{"text":"#ifndef SERVER_MIDDLEWARE_HPP\n#define SERVER_MIDDLEWARE_HPP\n\n#include \"request.hpp\"\n#include \"response.hpp\"\n\n\nnamespace server {\n\nclass Middleware;\nusing Middleware_ptr = std::shared_ptr;\n\nusing next_t = delegate;\nusing Next = std::shared_ptr;\nusing Callback = delegate;\n\nclass Middleware {\npublic:\n\n virtual void process(Request_ptr, Response_ptr, Next) = 0;\n\n Callback callback() {\n return Callback::from(this);\n }\n\n virtual void onMount(const std::string&) {\n \/\/ do nothing\n }\n\n};\n\n}; \/\/ << namespace server\n\n\n#endif\nDirector now use mount path to resolve file path#ifndef SERVER_MIDDLEWARE_HPP\n#define SERVER_MIDDLEWARE_HPP\n\n#include \"request.hpp\"\n#include \"response.hpp\"\n\n\nnamespace server {\n\nclass Middleware;\nusing Middleware_ptr = std::shared_ptr;\n\nusing next_t = delegate;\nusing Next = std::shared_ptr;\nusing Callback = delegate;\n\nclass Middleware {\npublic:\n\n virtual void process(Request_ptr, Response_ptr, Next) = 0;\n\n Callback callback() {\n return Callback::from(this);\n }\n\n virtual void onMount(const std::string& path) {\n mountpath_ = path;\n }\n\nprotected:\n std::string mountpath_;\n\n};\n\n}; \/\/ << namespace server\n\n\n#endif\n<|endoftext|>"} {"text":"#define WIN32_LEAN_AND_MEAN\n#pragma comment (lib, \"Shlwapi.lib\")\n\n#pragma warning (disable:4996)\n\n#include \n#include \n#include \n#include \n\nusing namespace std;\n\n#define BUF_SIZE MAX_PATH * 3\n\nlong long CurrentTime()\n{\n long long t;\n GetSystemTimeAsFileTime((LPFILETIME) &t);\n return t;\n}\n\n\nBOOL unhook_by_code(LPCTSTR szDllName, LPCTSTR szFuncName, PBYTE pOrgBytes)\n{\n FARPROC pFunc;\n DWORD dwOldProtect;\n\n \/\/ API ּ Ѵ\n pFunc = GetProcAddress(GetModuleHandle(szDllName), szFuncName);\n\n \/\/ ڵ (5 byte)  ޸𸮿 WRITE Ӽ ߰\n VirtualProtect((LPVOID) pFunc, 5, PAGE_EXECUTE_READWRITE, &dwOldProtect);\n\n \/\/ Unhook\n memcpy(pFunc, pOrgBytes, 5);\n\n \/\/ ޸ Ӽ \n VirtualProtect((LPVOID) pFunc, 5, dwOldProtect, &dwOldProtect);\n\n return TRUE;\n}\n\nBOOL hook_by_code(LPCTSTR szDllName, LPCTSTR szFuncName, PROC pfnNew, PBYTE pOrgBytes)\n{\n FARPROC pfnOrg;\n DWORD dwOldProtect, dwAddress;\n BYTE pBuf[5] = { 0xE9, 0, };\n PBYTE pByte;\n\n \/\/ ŷ API ּҸ Ѵ\n pfnOrg = (FARPROC) GetProcAddress(GetModuleHandle(szDllName), szFuncName);\n pByte = (PBYTE) pfnOrg;\n\n \/\/ ̹ ŷǾ ִٸ return FALSE\n if (pByte[0] == 0xE9)\n return FALSE;\n\n \/\/ 5 byte ġ Ͽ ޸𸮿 WRITE Ӽ ߰\n VirtualProtect((LPVOID) pfnOrg, 5, PAGE_EXECUTE_READWRITE, &dwOldProtect);\n\n \/\/ ڵ (5 byte) \n memcpy(pOrgBytes, pfnOrg, 5);\n\n \/\/ JMP ּҰ (E9 XXXX)\n \/\/ => XXXX = pfnNew - pfnOrg - 5\n dwAddress = (DWORD) pfnNew - (DWORD) pfnOrg - 5;\n memcpy(&pBuf[1], &dwAddress, 4);\n\n \/\/ Hook - 5 byte ġ(JMP XXXX)\n memcpy(pfnOrg, pBuf, 5);\n\n \/\/ ޸ Ӽ \n VirtualProtect((LPVOID) pfnOrg, 5, dwOldProtect, &dwOldProtect);\n\n return TRUE;\n}\n\n\nHANDLE hPipe;\nchar buffer[BUF_SIZE];\nmutex pQueueMutex;\n\nvolatile BOOL bCancelPipeThread = FALSE;\nvolatile BOOL bPipeConnected = FALSE;\n\nDWORD WINAPI PipeManager(LPVOID lParam)\n{\n hPipe = CreateNamedPipe(\"\\\\\\\\.\\\\pipe\\\\osu!Lyrics\", PIPE_ACCESS_OUTBOUND,\n PIPE_TYPE_MESSAGE | PIPE_WAIT, 1, BUF_SIZE * 5, 0, INFINITE, NULL);\n \/\/ û Ŭ̾Ʈ \n while (!bCancelPipeThread)\n {\n \/\/ ConnectNamedPipe Ŭ̾Ʈ :\n \/\/ Ҵ DisconnectNamedPipe \n if (ConnectNamedPipe(hPipe, NULL) || GetLastError() == ERROR_PIPE_CONNECTED)\n {\n bPipeConnected = TRUE;\n\n OVERLAPPED overlapped = {};\n string message;\n pQueueMutex.lock(); \/\/ť ؽ ϵɶ ٸ. ϵǸ .\n {\n message = buffer;\n }\n pQueueMutex.unlock(); \/\/ϵǸ buffer ޼ ī ٽ Ѵ.\n if (WriteFileEx(hPipe, message.c_str(), message.length(), &overlapped, [](DWORD, DWORD, LPOVERLAPPED) {}))\n {\n continue;\n }\n \/\/ WriteFileEx д Ŭ̾Ʈ ٴ ...\n }\n bPipeConnected = FALSE;\n DisconnectNamedPipe(hPipe);\n }\n \/\/ Ŭ̾Ʈ \n DisconnectNamedPipe(hPipe);\n CloseHandle(hPipe);\n return 0;\n}\n\n\ntypedef BOOL (WINAPI *tReadFile)(HANDLE, LPVOID, DWORD, LPDWORD, LPOVERLAPPED);\ntReadFile pReadFile;\nBYTE pReadFileJMP[5];\nmutex pBinaryMutex;\n\nunordered_map audioInfo;\n\n\/\/ osu! ReadFile ȣϸ osu!Lyrics \nBOOL WINAPI hkReadFile(HANDLE hFile, LPVOID lpBuffer, DWORD nNumberOfBytesToRead, LPDWORD lpNumberOfBytesRead, LPOVERLAPPED lpOverlapped)\n{\n long long calledAt = CurrentTime();\n\n BOOL result;\n pBinaryMutex.lock();\n {\n unhook_by_code(\"kernel32.dll\", \"ReadFile\", pReadFileJMP);\n result = pReadFile(hFile, lpBuffer, nNumberOfBytesToRead, lpNumberOfBytesRead, lpOverlapped);\n hook_by_code(\"kernel32.dll\", \"ReadFile\", (PROC) hkReadFile, pReadFileJMP);\n }\n pBinaryMutex.unlock();\n if (!result)\n {\n return result;\n }\n\n char path[MAX_PATH];\n DWORD pathLength = GetFinalPathNameByHandle(hFile, path, MAX_PATH, VOLUME_NAME_DOS);\n \/\/ 1: \\\\?\\D:\\Games\\osu!\\...\n DWORD seekPosition = SetFilePointer(hFile, 0, NULL, FILE_CURRENT) - *lpNumberOfBytesRead;\n \/\/ д Ʈ ̰ պκ оٸ:\n \/\/ AudioFilename պκп \/ ڵ !\n if (strnicmp(\".osu\", &path[pathLength - 4], 4) == 0 && seekPosition == 0)\n {\n \/\/ strtok ҽ ϹǷ ϴ \n char *buffer = strdup((char *) lpBuffer);\n char *line = strtok(buffer, \"\\n\");\n while (line != NULL)\n {\n \/\/ Ʈ \n if (strnicmp(line, \"AudioFilename:\", 14) == 0)\n {\n char *beatmapDir = strdup(path);\n PathRemoveFileSpec(beatmapDir);\n\n char audioPath[MAX_PATH];\n\n \/\/ get value & trim\n int i = 14;\n for (; line[i] == ' '; i++);\n buffer[0] = '\\0';\n strncat(buffer, &line[i], strlen(line) - i - 1);\n PathCombine(audioPath, beatmapDir, buffer);\n\n \/\/ ˻ ҹ ϹǷ \n WIN32_FIND_DATA fdata;\n FindClose(FindFirstFile(audioPath, &fdata));\n PathRemoveFileSpec(audioPath);\n PathCombine(audioPath, audioPath, fdata.cFileName);\n\n audioInfo.insert(make_pair(string(audioPath), string(path)));\n \n free(beatmapDir);\n break;\n }\n line = strtok(NULL, \"\\n\");\n }\n free(buffer);\n }\n else if (bPipeConnected)\n {\n \/\/ [ audioPath, beatmapPath ]\n unordered_map::iterator it = audioInfo.find(string(path));\n if (it != audioInfo.end())\n {\n sprintf(buffer, \"%llx|%s|%lx|%s\\n\", calledAt, &path[4], seekPosition, &it->second[4]);\n pQueueMutex.unlock(); \/\/ۿ ޼ Ѵ. ׷ κ lockȴ.\n \/\/ ý ̴ 尡 ޼ \n pQueueMutex.lock();\n \/* lockǰ ؽ ٽ ť ٸ. ׷ ϵ Ŀ ٽ ϵȴ.\n ׷ (޼) ó ̷. ٽ ϵǸ ٽ ޼ ޾Ƽ Ҷ\n lockԼ ٸ ȴ.*\/\n }\n }\n return result;\n}\n\n\nHANDLE hPipeThread;\n\nBOOL WINAPI DllMain(HINSTANCE hinstDLL, DWORD fdwReason, LPVOID lpvReserved)\n{\n if (fdwReason == DLL_PROCESS_ATTACH)\n {\n hPipeThread = CreateThread(NULL, 0, PipeManager, NULL, 0, NULL);\n \n pBinaryMutex.lock();\n {\n pReadFile = (tReadFile) GetProcAddress(GetModuleHandle(\"kernel32.dll\"), \"ReadFile\");\n hook_by_code(\"kernel32.dll\", \"ReadFile\", (PROC) hkReadFile, pReadFileJMP);\n }\n pBinaryMutex.unlock();\n }\n else if (fdwReason == DLL_PROCESS_DETACH)\n {\n bCancelPipeThread = TRUE;\n WaitForSingleObject(hPipeThread, INFINITE);\n CloseHandle(hPipeThread);\n\n pBinaryMutex.lock();\n {\n unhook_by_code(\"kernel32.dll\", \"ReadFile\", pReadFileJMP);\n }\n pBinaryMutex.unlock();\n }\n return TRUE;\n}데이터를 얻어서 처리하고 파이프라인에 보네는곳에서 나타난 스레드 동기화 버그를 수정했습니다 #19#define WIN32_LEAN_AND_MEAN\n#pragma comment (lib, \"Shlwapi.lib\")\n\n#pragma warning (disable:4996)\n\n#include \n#include \n#include \n#include \n#include \n\nusing namespace std;\n\nvolatile HANDLE hQueueObject;\nmutex QueueMutex;\nqueue InfoQueue;\n\n#define BUF_SIZE 256\n\nlong long CurrentTime()\n{\n long long t;\n GetSystemTimeAsFileTime((LPFILETIME) &t);\n return t;\n}\n\n\nBOOL unhook_by_code(LPCTSTR szDllName, LPCTSTR szFuncName, PBYTE pOrgBytes)\n{\n FARPROC pFunc;\n DWORD dwOldProtect;\n\n \/\/ API ּ Ѵ\n pFunc = GetProcAddress(GetModuleHandle(szDllName), szFuncName);\n\n \/\/ ڵ (5 byte)  ޸𸮿 WRITE Ӽ ߰\n VirtualProtect((LPVOID) pFunc, 5, PAGE_EXECUTE_READWRITE, &dwOldProtect);\n\n \/\/ Unhook\n memcpy(pFunc, pOrgBytes, 5);\n\n \/\/ ޸ Ӽ \n VirtualProtect((LPVOID) pFunc, 5, dwOldProtect, &dwOldProtect);\n\n return TRUE;\n}\n\nBOOL hook_by_code(LPCTSTR szDllName, LPCTSTR szFuncName, PROC pfnNew, PBYTE pOrgBytes)\n{\n FARPROC pfnOrg;\n DWORD dwOldProtect, dwAddress;\n BYTE pBuf[5] = { 0xE9, 0, };\n PBYTE pByte;\n\n \/\/ ŷ API ּҸ Ѵ\n pfnOrg = (FARPROC) GetProcAddress(GetModuleHandle(szDllName), szFuncName);\n pByte = (PBYTE) pfnOrg;\n\n \/\/ ̹ ŷǾ ִٸ return FALSE\n if (pByte[0] == 0xE9)\n return FALSE;\n\n \/\/ 5 byte ġ Ͽ ޸𸮿 WRITE Ӽ ߰\n VirtualProtect((LPVOID) pfnOrg, 5, PAGE_EXECUTE_READWRITE, &dwOldProtect);\n\n \/\/ ڵ (5 byte) \n memcpy(pOrgBytes, pfnOrg, 5);\n\n \/\/ JMP ּҰ (E9 XXXX)\n \/\/ => XXXX = pfnNew - pfnOrg - 5\n dwAddress = (DWORD) pfnNew - (DWORD) pfnOrg - 5;\n memcpy(&pBuf[1], &dwAddress, 4);\n\n \/\/ Hook - 5 byte ġ(JMP XXXX)\n memcpy(pfnOrg, pBuf, 5);\n\n \/\/ ޸ Ӽ \n VirtualProtect((LPVOID) pfnOrg, 5, dwOldProtect, &dwOldProtect);\n\n return TRUE;\n}\n\n\nHANDLE hPipe;\n\nvolatile BOOL bCancelPipeThread = FALSE;\nvolatile BOOL bIsPipeConnected = FALSE;\n\nDWORD WINAPI PipeManager(LPVOID lParam)\n{\n hPipe = CreateNamedPipeA(\"\\\\\\\\.\\\\pipe\\\\osu!Lyrics\", PIPE_ACCESS_OUTBOUND,\n PIPE_TYPE_MESSAGE | PIPE_WAIT, 1, BUF_SIZE * 5, 0, INFINITE, NULL);\n\n\n \/\/ Ŭ̾Ʈ \n while (!bCancelPipeThread)\n {\n\t\tif ((ConnectNamedPipe(hPipe, NULL)) || GetLastError() == ERROR_PIPE_CONNECTED)\n {\n\t\t\tbIsPipeConnected = TRUE;\n\n OVERLAPPED overlapped = {};\n\t\t\tstring tmpstring;\n\n\t\t\tWaitForSingleObject(hQueueObject, INFINITE);\n\n\t\t\tQueueMutex.lock();\n\t\t\twhile(!InfoQueue.empty())\n\t\t\t{\n\t\t\t\ttmpstring = (InfoQueue.front());\n\t\t\t\tInfoQueue.pop();\n\t\t\t\tif (WriteFileEx(hPipe, tmpstring.c_str(), tmpstring.length(), &overlapped, [](DWORD, DWORD, LPOVERLAPPED) {}))\n\t\t\t\t{\n\t\t\t\t\tcontinue;\n\t\t\t\t}\n\t\t\t}\n\t\t\tQueueMutex.unlock();\n\t\t\tcontinue;\n }\n\t\tbIsPipeConnected = FALSE;\n\t\tDisconnectNamedPipe(hPipe);\n }\n \/\/ Ŭ̾Ʈ \n return 0;\n}\n\n\ntypedef BOOL (WINAPI *tReadFile)(HANDLE, LPVOID, DWORD, LPDWORD, LPOVERLAPPED);\ntReadFile pReadFile;\nBYTE pReadFileJMP[5];\n\nmutex pBinaryMutex;\n\nunordered_map audioInfo;\n\n\/\/ osu! ReadFile ȣϸ osu!Lyrics \nBOOL WINAPI hkReadFile(HANDLE hFile, LPVOID lpBuffer, DWORD nNumberOfBytesToRead, LPDWORD lpNumberOfBytesRead, LPOVERLAPPED lpOverlapped)\n{\n long long calledAt = CurrentTime();\n BOOL result = FALSE;\n\n\tpBinaryMutex.lock();\n {\n unhook_by_code(\"kernel32.dll\", \"ReadFile\", pReadFileJMP);\n result = pReadFile(hFile, lpBuffer, nNumberOfBytesToRead, lpNumberOfBytesRead, lpOverlapped);\n hook_by_code(\"kernel32.dll\", \"ReadFile\", (PROC) hkReadFile, pReadFileJMP);\n }\n\tpBinaryMutex.unlock();\n if (!result)\n {\n \/\/ result ϰų ĿƮǾ 쿣 ٷ Լ Ѵ.\n return FALSE;\n }\n\n char path[MAX_PATH];\n DWORD pathLength = GetFinalPathNameByHandle(hFile, path, MAX_PATH, VOLUME_NAME_DOS);\n \/\/ 1: \\\\?\\D:\\Games\\osu!\\...\n DWORD seekPosition = SetFilePointer(hFile, 0, NULL, FILE_CURRENT) - *lpNumberOfBytesRead;\n \/\/ д Ʈ ̰ պκ оٸ:\n \/\/ AudioFilename պκп \/ ڵ !\n if (strnicmp(\".osu\", &path[pathLength - 4], 4) == 0 && seekPosition == 0)\n {\n \/\/ strtok ҽ ϹǷ ϴ \n char *buffer = strdup((char *) lpBuffer);\n char *line = strtok(buffer, \"\\n\");\n while (line != NULL)\n {\n \/\/ Ʈ \n if (strnicmp(line, \"AudioFilename:\", 14) == 0)\n {\n char *beatmapDir = strdup(path);\n PathRemoveFileSpec(beatmapDir);\n\n char audioPath[MAX_PATH];\n\n \/\/ get value & trim\n int i = 14;\n for (; line[i] == ' '; i++);\n buffer[0] = '\\0';\n strncat(buffer, &line[i], strlen(line) - i - 1);\n PathCombine(audioPath, beatmapDir, buffer);\n\n \/\/ ˻ ҹ ϹǷ \n WIN32_FIND_DATA fdata;\n FindClose(FindFirstFile(audioPath, &fdata));\n PathRemoveFileSpec(audioPath);\n PathCombine(audioPath, audioPath, fdata.cFileName);\n\n audioInfo.insert(make_pair(string(audioPath), string(path)));\n \n free(beatmapDir);\n break;\n }\n line = strtok(NULL, \"\\n\");\n }\n free(buffer);\n\n }\n\telse\n {\n \/\/ [ audioPath, beatmapPath ]\n unordered_map::iterator it = audioInfo.find(string(path));\n if (it != audioInfo.end())\n {\n\t\t\tchar *buffer = nullptr;\n\n\t\t\tbuffer = new char[BUF_SIZE];\n sprintf(buffer, \"%llx|%s|%lx|%s\\n\", calledAt, &path[4], seekPosition, &it->second[4]);\n\n\t\t\tQueueMutex.lock();\n\t\t\tInfoQueue.push(string(buffer));\n\t\t\tQueueMutex.unlock();\n\t\t\tSetEvent(hQueueObject);\n\n\t\t\tdelete[] buffer;\n }\n }\n return TRUE;\n}\n\n\nHANDLE hPipeThread;\n\nBOOL WINAPI DllMain(HINSTANCE hinstDLL, DWORD fdwReason, LPVOID lpvReserved)\n{\n if (fdwReason == DLL_PROCESS_ATTACH)\n {\n hPipeThread = CreateThread(NULL, 0, PipeManager, NULL, 0, NULL);\n\t\thQueueObject = CreateEventA(NULL, TRUE, FALSE, NULL);\n \n\t\tpBinaryMutex.lock();\n {\n pReadFile = (tReadFile) GetProcAddress(GetModuleHandle(\"kernel32.dll\"), \"ReadFile\");\n hook_by_code(\"kernel32.dll\", \"ReadFile\", (PROC) hkReadFile, pReadFileJMP);\n }\n\t\tpBinaryMutex.unlock();\n }\n else if (fdwReason == DLL_PROCESS_DETACH)\n {\n bCancelPipeThread = TRUE;\n\n WaitForSingleObject(hPipeThread, INFINITE);\n\n\t\tDisconnectNamedPipe(hPipe);\n\n CloseHandle(hPipeThread);\n\t\tCloseHandle(hPipe);\n\n\t\tpBinaryMutex.lock();\n {\n unhook_by_code(\"kernel32.dll\", \"ReadFile\", pReadFileJMP);\n }\n\t\tpBinaryMutex.unlock();\n }\n return TRUE;\n}<|endoftext|>"} {"text":"\/*-----------------------------------------------------------------------------\n\n Copyright 2017 Hopsan Group\n\n Licensed under the Apache License, Version 2.0 (the \"License\");\n you may not use this file except in compliance with the License.\n You may obtain a copy of the License at\n\n http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n\n Unless required by applicable law or agreed to in writing, software\n distributed under the License is distributed on an \"AS IS\" BASIS,\n WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n See the License for the specific language governing permissions and\n limitations under the License.\n\n\n The full license is available in the file LICENSE.\n For details about the 'Hopsan Group' or information about Authors and\n Contributors see the HOPSANGROUP and AUTHORS files that are located in\n the Hopsan source code root directory.\n\n-----------------------------------------------------------------------------*\/\n\n\/\/!\n\/\/! @file MechanicPulley.hpp\n\/\/! @author Robert Braun \n\/\/! @date 2013-02-28\n\/\/!\n\/\/! @brief Contains a mechanic pulley\n\/\/!\n\/\/$Id$\n\n#ifndef MECHANICPULLEY_HPP_INCLUDED\n#define MECHANICPULLEY_HPP_INCLUDED\n\n#include \"ComponentEssentials.h\"\n#include \"ComponentUtilities.h\"\n\nnamespace hopsan {\n\n \/\/!\n \/\/! @brief\n \/\/! @ingroup MechanicalComponents\n \/\/!\n class MechanicPulley : public ComponentQ\n {\n\n private:\n double m;\n double *mpB;\n double mNumTheta[3];\n double mDenTheta[3];\n double mNumOmega[2];\n double mDenOmega[2];\n SecondOrderTransferFunction mFilterTheta;\n FirstOrderTransferFunction mFilterOmega;\n \/\/ DoubleIntegratorWithDamping mIntegrator;\n double *mpND_f1, *mpND_x1, *mpND_v1, *mpND_me1, *mpND_c1, *mpND_Zx1,\n *mpND_f2, *mpND_x2, *mpND_v2, *mpND_me2, *mpND_c2, *mpND_Zx2;\n double f1, x1, v1, c1, Zx1,\n f2, x2, v2, c2, Zx2;\n Port *mpP1, *mpP2;\n\n public:\n static Component *Creator()\n {\n return new MechanicPulley();\n }\n\n void configure()\n {\n \/\/Add ports to the component\n mpP1 = addPowerPort(\"P1\", \"NodeMechanic\");\n mpP2 = addPowerPort(\"P2\", \"NodeMechanic\");\n\n \/\/Register changeable parameters to the HOPSAN++ core\n addConstant(\"m\", \"Inertia\", \"kg\", 1.0, m);\n addInputVariable(\"B\", \"Viscous Friction\", \"Nms\/rad\", 10, &mpB);\n }\n\n\n void initialize()\n {\n mpND_f1 = getSafeNodeDataPtr(mpP1, NodeMechanic::Force);\n mpND_x1 = getSafeNodeDataPtr(mpP1, NodeMechanic::Position);\n mpND_v1 = getSafeNodeDataPtr(mpP1, NodeMechanic::Velocity);\n mpND_me1 = getSafeNodeDataPtr(mpP1, NodeMechanic::EquivalentMass);\n mpND_c1 = getSafeNodeDataPtr(mpP1, NodeMechanic::WaveVariable);\n mpND_Zx1 = getSafeNodeDataPtr(mpP1, NodeMechanic::CharImpedance);\n\n mpND_f2 = getSafeNodeDataPtr(mpP2, NodeMechanic::Force);\n mpND_x2 = getSafeNodeDataPtr(mpP2, NodeMechanic::Position);\n mpND_v2 = getSafeNodeDataPtr(mpP2, NodeMechanic::Velocity);\n mpND_me2 = getSafeNodeDataPtr(mpP2, NodeMechanic::EquivalentMass);\n mpND_c2 = getSafeNodeDataPtr(mpP2, NodeMechanic::WaveVariable);\n mpND_Zx2 = getSafeNodeDataPtr(mpP2, NodeMechanic::CharImpedance);\n\n f1 = (*mpND_f1)*2.0;\n x1 = (*mpND_x1)\/2.0;\n v1 = (*mpND_v1)\/2.0;\n f2 = (*mpND_f2);\n x2 = (*mpND_x2);\n v2 = (*mpND_v2);\n\n mNumTheta[0] = 1.0;\n mNumTheta[1] = 0.0;\n mNumTheta[2] = 0.0;\n mDenTheta[0] = 0;\n mDenTheta[1] = (*mpB);\n mDenTheta[2] = m;\n mNumOmega[0] = 1.0;\n mNumOmega[1] = 0.0;\n mDenOmega[0] = (*mpB);\n mDenOmega[1] = m;\n\n mFilterTheta.initialize(mTimestep, mNumTheta, mDenTheta, f1-f2, -x1, -1.5e300, 1.5e300, -v1);\n mFilterOmega.initialize(mTimestep, mNumOmega, mDenOmega, f1-f2, -v1);\n\n (*mpND_me1) = m;\n (*mpND_me2) = m;\n }\n\n\n void simulateOneTimestep()\n {\n \/\/Get variable values from nodes\n c1 = (*mpND_c1)*2;\n Zx1 = (*mpND_Zx1)*4;\n c2 = (*mpND_c2);\n Zx2 = (*mpND_Zx2);\n\n \/\/Mass equations\n mDenTheta[1] = ((*mpB)+Zx1+Zx2);\n mDenOmega[0] = ((*mpB)+Zx1+Zx2);\n mFilterTheta.setDen(mDenTheta);\n mFilterOmega.setDen(mDenOmega);\n\n x2 = mFilterTheta.update(c1-c2);\n v2 = mFilterOmega.update(c1-c2);\n f2 = c2 + Zx2*v2;\n\n v1 = -v2*2;\n x1 = -x2*2;\n f1 = (c1 + Zx1*v1)\/2.0;\n\n\n \/\/Write new values to nodes\n (*mpND_f1) = f1;\n (*mpND_x1) = x1;\n (*mpND_v1) = v1;\n (*mpND_f2) = f2;\n (*mpND_x2) = x2;\n (*mpND_v2) = v2;\n }\n };\n}\n\n#endif \/\/ MECHANICPULLEY_HPP_INCLUDED\n\nFix wrong impedance for pulley component\/*-----------------------------------------------------------------------------\n\n Copyright 2017 Hopsan Group\n\n Licensed under the Apache License, Version 2.0 (the \"License\");\n you may not use this file except in compliance with the License.\n You may obtain a copy of the License at\n\n http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n\n Unless required by applicable law or agreed to in writing, software\n distributed under the License is distributed on an \"AS IS\" BASIS,\n WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n See the License for the specific language governing permissions and\n limitations under the License.\n\n\n The full license is available in the file LICENSE.\n For details about the 'Hopsan Group' or information about Authors and\n Contributors see the HOPSANGROUP and AUTHORS files that are located in\n the Hopsan source code root directory.\n\n-----------------------------------------------------------------------------*\/\n\n\/\/!\n\/\/! @file MechanicPulley.hpp\n\/\/! @author Robert Braun \n\/\/! @date 2013-02-28\n\/\/!\n\/\/! @brief Contains a mechanic pulley\n\/\/!\n\/\/$Id$\n\n#ifndef MECHANICPULLEY_HPP_INCLUDED\n#define MECHANICPULLEY_HPP_INCLUDED\n\n#include \"ComponentEssentials.h\"\n#include \"ComponentUtilities.h\"\n\nnamespace hopsan {\n\n \/\/!\n \/\/! @brief\n \/\/! @ingroup MechanicalComponents\n \/\/!\n class MechanicPulley : public ComponentQ\n {\n\n private:\n double m;\n double *mpB;\n double mNumTheta[3];\n double mDenTheta[3];\n double mNumOmega[2];\n double mDenOmega[2];\n SecondOrderTransferFunction mFilterTheta;\n FirstOrderTransferFunction mFilterOmega;\n \/\/ DoubleIntegratorWithDamping mIntegrator;\n double *mpND_f1, *mpND_x1, *mpND_v1, *mpND_me1, *mpND_c1, *mpND_Zx1,\n *mpND_f2, *mpND_x2, *mpND_v2, *mpND_me2, *mpND_c2, *mpND_Zx2;\n double f1, x1, v1, c1, Zx1,\n f2, x2, v2, c2, Zx2;\n Port *mpP1, *mpP2;\n\n public:\n static Component *Creator()\n {\n return new MechanicPulley();\n }\n\n void configure()\n {\n \/\/Add ports to the component\n mpP1 = addPowerPort(\"P1\", \"NodeMechanic\");\n mpP2 = addPowerPort(\"P2\", \"NodeMechanic\");\n\n \/\/Register changeable parameters to the HOPSAN++ core\n addConstant(\"m\", \"Inertia\", \"kg\", 1.0, m);\n addInputVariable(\"B\", \"Viscous Friction\", \"Nms\/rad\", 10, &mpB);\n }\n\n\n void initialize()\n {\n mpND_f1 = getSafeNodeDataPtr(mpP1, NodeMechanic::Force);\n mpND_x1 = getSafeNodeDataPtr(mpP1, NodeMechanic::Position);\n mpND_v1 = getSafeNodeDataPtr(mpP1, NodeMechanic::Velocity);\n mpND_me1 = getSafeNodeDataPtr(mpP1, NodeMechanic::EquivalentMass);\n mpND_c1 = getSafeNodeDataPtr(mpP1, NodeMechanic::WaveVariable);\n mpND_Zx1 = getSafeNodeDataPtr(mpP1, NodeMechanic::CharImpedance);\n\n mpND_f2 = getSafeNodeDataPtr(mpP2, NodeMechanic::Force);\n mpND_x2 = getSafeNodeDataPtr(mpP2, NodeMechanic::Position);\n mpND_v2 = getSafeNodeDataPtr(mpP2, NodeMechanic::Velocity);\n mpND_me2 = getSafeNodeDataPtr(mpP2, NodeMechanic::EquivalentMass);\n mpND_c2 = getSafeNodeDataPtr(mpP2, NodeMechanic::WaveVariable);\n mpND_Zx2 = getSafeNodeDataPtr(mpP2, NodeMechanic::CharImpedance);\n\n f1 = (*mpND_f1)*2.0;\n x1 = (*mpND_x1)\/2.0;\n v1 = (*mpND_v1)\/2.0;\n f2 = (*mpND_f2);\n x2 = (*mpND_x2);\n v2 = (*mpND_v2);\n\n mNumTheta[0] = 1.0;\n mNumTheta[1] = 0.0;\n mNumTheta[2] = 0.0;\n mDenTheta[0] = 0;\n mDenTheta[1] = (*mpB);\n mDenTheta[2] = m;\n mNumOmega[0] = 1.0;\n mNumOmega[1] = 0.0;\n mDenOmega[0] = (*mpB);\n mDenOmega[1] = m;\n\n mFilterTheta.initialize(mTimestep, mNumTheta, mDenTheta, f1-f2, -x1, -1.5e300, 1.5e300, -v1);\n mFilterOmega.initialize(mTimestep, mNumOmega, mDenOmega, f1-f2, -v1);\n\n (*mpND_me1) = m;\n (*mpND_me2) = m;\n }\n\n\n void simulateOneTimestep()\n {\n \/\/Get variable values from nodes\n c1 = (*mpND_c1);\n Zx1 = (*mpND_Zx1);\n c2 = (*mpND_c2);\n Zx2 = (*mpND_Zx2);\n\n \/\/Mass equations\n mDenTheta[1] = ((*mpB)+4*Zx1+Zx2);\n mDenOmega[0] = ((*mpB)+4*Zx1+Zx2);\n mFilterTheta.setDen(mDenTheta);\n mFilterOmega.setDen(mDenOmega);\n\n x2 = mFilterTheta.update(2*c1-c2);\n v2 = mFilterOmega.update(2*c1-c2);\n f2 = c2 + Zx2*v2;\n\n v1 = -v2*2;\n x1 = -x2*2;\n f1 = c1 + Zx1*v1;\n\n\n \/\/Write new values to nodes\n (*mpND_f1) = f1;\n (*mpND_x1) = x1;\n (*mpND_v1) = v1;\n (*mpND_f2) = f2;\n (*mpND_x2) = x2;\n (*mpND_v2) = v2;\n }\n };\n}\n\n#endif \/\/ MECHANICPULLEY_HPP_INCLUDED\n\n<|endoftext|>"} {"text":"\n\/*\n * Copyright (c) 1999-2008 Mark D. Hill and David A. Wood\n * All rights 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 DATABLOCK_H\n#define DATABLOCK_H\n\n#include \"mem\/ruby\/common\/Global.hh\"\n#include \"mem\/ruby\/system\/System.hh\"\n#include \"mem\/gems_common\/Vector.hh\"\n\nclass DataBlock {\n public:\n \/\/ Constructors\n DataBlock() {alloc();}\n DataBlock(const DataBlock & cp) {\n m_data = new uint8[RubySystem::getBlockSizeBytes()];\n memcpy(m_data, cp.m_data, RubySystem::getBlockSizeBytes());\n m_alloc = true;\n }\n\n \/\/ Destructor\n ~DataBlock() { if(m_alloc) delete [] m_data;}\n\n DataBlock& operator=(const DataBlock& obj);\n\n \/\/ Public Methods\n void assign(uint8* data);\n\n void clear();\n uint8 getByte(int whichByte) const;\n const uint8* getData(int offset, int len) const;\n void setByte(int whichByte, uint8 data);\n void setData(uint8* data, int offset, int len);\n void copyPartial(const DataBlock & dblk, int offset, int len);\n bool equal(const DataBlock& obj) const;\n void print(ostream& out) const;\n\nprivate:\n void alloc();\n \/\/ Data Members (m_ prefix)\n uint8* m_data;\n bool m_alloc;\n};\n\n\/\/ Output operator declaration\nostream& operator<<(ostream& out, const DataBlock& obj);\n\nbool operator==(const DataBlock& obj1, const DataBlock& obj2);\n\n\/\/ inline functions for speed\n\ninline\nvoid DataBlock::assign(uint8* data)\n{\n delete [] m_data;\n m_data = data;\n m_alloc = false;\n}\n\ninline\nvoid DataBlock::alloc()\n{\n m_data = new uint8[RubySystem::getBlockSizeBytes()];\n m_alloc = true;\n clear();\n}\n\ninline\nvoid DataBlock::clear()\n{\n memset(m_data, 0, RubySystem::getBlockSizeBytes());\n}\n\ninline\nbool DataBlock::equal(const DataBlock& obj) const\n{\n return !memcmp(m_data, obj.m_data, RubySystem::getBlockSizeBytes());\n}\n\ninline\nvoid DataBlock::print(ostream& out) const\n{\n int size = RubySystem::getBlockSizeBytes();\n out << \"[ \";\n for (int i = 0; i < size; i++) {\n out << setw(2) << setfill('0') << hex << \"0x\" << (int)m_data[i] << \" \";\n }\n out << dec << \"]\" << flush;\n}\n\ninline\nuint8 DataBlock::getByte(int whichByte) const\n{\n return m_data[whichByte];\n}\n\ninline\nconst uint8* DataBlock::getData(int offset, int len) const\n{\n assert(offset + len <= RubySystem::getBlockSizeBytes());\n return &m_data[offset];\n}\n\ninline\nvoid DataBlock::setByte(int whichByte, uint8 data)\n{\n m_data[whichByte] = data;\n}\n\ninline\nvoid DataBlock::setData(uint8* data, int offset, int len)\n{\n assert(offset + len <= RubySystem::getBlockSizeBytes());\n memcpy(&m_data[offset], data, len);\n}\n\ninline\nvoid DataBlock::copyPartial(const DataBlock & dblk, int offset, int len)\n{\n setData(&dblk.m_data[offset], offset, len);\n}\n\n\/\/ ******************* Definitions *******************\n\n\/\/ Output operator definition\nextern inline\nostream& operator<<(ostream& out, const DataBlock& obj)\n{\n obj.print(out);\n out << flush;\n return out;\n}\n\nextern inline\nbool operator==(const DataBlock& obj1,const DataBlock& obj2)\n{\n return (obj1.equal(obj2));\n}\n\n#endif \/\/DATABLOCK_H\nObject print bug fix\n\/*\n * Copyright (c) 1999-2008 Mark D. Hill and David A. Wood\n * All rights 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 DATABLOCK_H\n#define DATABLOCK_H\n\n#include \"mem\/ruby\/common\/Global.hh\"\n#include \"mem\/ruby\/system\/System.hh\"\n#include \"mem\/gems_common\/Vector.hh\"\n\nclass DataBlock {\n public:\n \/\/ Constructors\n DataBlock() {alloc();}\n DataBlock(const DataBlock & cp) {\n m_data = new uint8[RubySystem::getBlockSizeBytes()];\n memcpy(m_data, cp.m_data, RubySystem::getBlockSizeBytes());\n m_alloc = true;\n }\n\n \/\/ Destructor\n ~DataBlock() { if(m_alloc) delete [] m_data;}\n\n DataBlock& operator=(const DataBlock& obj);\n\n \/\/ Public Methods\n void assign(uint8* data);\n\n void clear();\n uint8 getByte(int whichByte) const;\n const uint8* getData(int offset, int len) const;\n void setByte(int whichByte, uint8 data);\n void setData(uint8* data, int offset, int len);\n void copyPartial(const DataBlock & dblk, int offset, int len);\n bool equal(const DataBlock& obj) const;\n void print(ostream& out) const;\n\nprivate:\n void alloc();\n \/\/ Data Members (m_ prefix)\n uint8* m_data;\n bool m_alloc;\n};\n\n\/\/ Output operator declaration\nostream& operator<<(ostream& out, const DataBlock& obj);\n\nbool operator==(const DataBlock& obj1, const DataBlock& obj2);\n\n\/\/ inline functions for speed\n\ninline\nvoid DataBlock::assign(uint8* data)\n{\n delete [] m_data;\n m_data = data;\n m_alloc = false;\n}\n\ninline\nvoid DataBlock::alloc()\n{\n m_data = new uint8[RubySystem::getBlockSizeBytes()];\n m_alloc = true;\n clear();\n}\n\ninline\nvoid DataBlock::clear()\n{\n memset(m_data, 0, RubySystem::getBlockSizeBytes());\n}\n\ninline\nbool DataBlock::equal(const DataBlock& obj) const\n{\n return !memcmp(m_data, obj.m_data, RubySystem::getBlockSizeBytes());\n}\n\ninline\nvoid DataBlock::print(ostream& out) const\n{\n int size = RubySystem::getBlockSizeBytes();\n out << \"[ \";\n for (int i = 0; i < size; i++) {\n out << setw(2) << setfill('0') << hex << \"0x\" << (int)m_data[i] << \" \";\n out << setfill(' ');\n }\n out << dec << \"]\" << flush;\n}\n\ninline\nuint8 DataBlock::getByte(int whichByte) const\n{\n return m_data[whichByte];\n}\n\ninline\nconst uint8* DataBlock::getData(int offset, int len) const\n{\n assert(offset + len <= RubySystem::getBlockSizeBytes());\n return &m_data[offset];\n}\n\ninline\nvoid DataBlock::setByte(int whichByte, uint8 data)\n{\n m_data[whichByte] = data;\n}\n\ninline\nvoid DataBlock::setData(uint8* data, int offset, int len)\n{\n assert(offset + len <= RubySystem::getBlockSizeBytes());\n memcpy(&m_data[offset], data, len);\n}\n\ninline\nvoid DataBlock::copyPartial(const DataBlock & dblk, int offset, int len)\n{\n setData(&dblk.m_data[offset], offset, len);\n}\n\n\/\/ ******************* Definitions *******************\n\n\/\/ Output operator definition\nextern inline\nostream& operator<<(ostream& out, const DataBlock& obj)\n{\n obj.print(out);\n out << flush;\n return out;\n}\n\nextern inline\nbool operator==(const DataBlock& obj1,const DataBlock& obj2)\n{\n return (obj1.equal(obj2));\n}\n\n#endif \/\/DATABLOCK_H\n<|endoftext|>"} {"text":"#pragma once\n\n#include \n#include \n#include \n\nnamespace {\n\ttemplate \n\tvoid swapEndian (T* p) {\n\t\tuint8_t* q = reinterpret_cast(p);\n\n\t\tstd::reverse(q, q + sizeof(T));\n\t}\n}\n\nstruct Slice {\n\tuint8_t* begin;\n\tuint8_t* end;\n\n\tSlice() : begin(nullptr), end(nullptr) {}\n\tSlice(uint8_t* begin, uint8_t* end) : begin(begin), end(end) {\n\t\tassert(begin);\n\t\tassert(end);\n\t}\n\n\tvoid popFrontN (size_t n) {\n\t\tassert(n <= this->length());\n\t\tbegin += n;\n\t}\n\n\tvoid popFront () {\n\t\tthis->popFrontN(1);\n\t}\n\n\tauto drop (size_t n) const {\n\t\tassert(n <= this->length());\n\t\treturn Slice(this->begin + n, this->end);\n\t}\n\n\tauto take (size_t n) const {\n\t\tassert(n <= this->length());\n\t\treturn Slice(this->begin, this->begin + n);\n\t}\n\n\tsize_t length () const {\n\t\treturn static_cast(this->end - this->begin);\n\t}\n\n\ttemplate \n\tY peek (size_t offset = 0) const {\n\t\treturn *(reinterpret_cast(this->begin + offset));\n\t}\n\n\ttemplate \n\tvoid put (Y value, size_t offset = 0) {\n\t\tassert(offset + sizeof(Y) <= this->length());\n\t\tauto ptr = reinterpret_cast(this->begin + offset);\n\t\t*ptr = value;\n\n\t\tif (swap) swapEndian(ptr);\n\t}\n\n\tvoid put (uint8_t* value, size_t n, size_t offset = 0) {\n\t\tassert(offset + n <= this->length());\n\t\tmemcpy(this->begin + offset, value, n);\n\t}\n\n\tvoid put (Slice value, size_t offset = 0) {\n\t\tthis->put(value.begin, value.length(), offset);\n\t}\n\n\ttemplate \n\tY read () {\n\t\tconst Y value = this->peek();\n\t\tthis->popFrontN(sizeof(Y));\n\t\treturn value;\n\t}\n\n\ttemplate \n\tvoid write (Y value) {\n\t\tthis->put(value);\n\t\tthis->popFrontN(sizeof(Y));\n\t}\n\n\tvoid write (Slice value) {\n\t\tthis->put(value);\n\t\tthis->popFrontN(value.length());\n\t}\n\n\tvoid write (uint8_t* value, size_t n) {\n\t\tthis->put(value, n);\n\t\tthis->popFrontN(n);\n\t}\n\n\tuint8_t& operator[](const size_t i) {\n\t\tassert(i <= this->length());\n\t\treturn this->begin[i];\n\t}\n\n\tconst uint8_t& operator[](const size_t i) const {\n\t\tassert(i <= this->length());\n\t\treturn this->begin[i];\n\t}\n};\nslice: consistent use of this#pragma once\n\n#include \n#include \n#include \n\nnamespace {\n\ttemplate \n\tvoid swapEndian (T* p) {\n\t\tuint8_t* q = reinterpret_cast(p);\n\n\t\tstd::reverse(q, q + sizeof(T));\n\t}\n}\n\nstruct Slice {\n\tuint8_t* begin;\n\tuint8_t* end;\n\n\tSlice() : begin(nullptr), end(nullptr) {}\n\tSlice(uint8_t* begin, uint8_t* end) : begin(begin), end(end) {\n\t\tassert(this->begin);\n\t\tassert(this->end);\n\t}\n\n\tvoid popFrontN (size_t n) {\n\t\tassert(n <= this->length());\n\t\tthis->begin += n;\n\t}\n\n\tvoid popFront () {\n\t\tthis->popFrontN(1);\n\t}\n\n\tauto drop (size_t n) const {\n\t\tassert(n <= this->length());\n\t\treturn Slice(this->begin + n, this->end);\n\t}\n\n\tauto take (size_t n) const {\n\t\tassert(n <= this->length());\n\t\treturn Slice(this->begin, this->begin + n);\n\t}\n\n\tsize_t length () const {\n\t\treturn static_cast(this->end - this->begin);\n\t}\n\n\ttemplate \n\tY peek (size_t offset = 0) const {\n\t\treturn *(reinterpret_cast(this->begin + offset));\n\t}\n\n\ttemplate \n\tvoid put (Y value, size_t offset = 0) {\n\t\tassert(offset + sizeof(Y) <= this->length());\n\t\tauto ptr = reinterpret_cast(this->begin + offset);\n\t\t*ptr = value;\n\n\t\tif (swap) swapEndian(ptr);\n\t}\n\n\tvoid put (uint8_t* value, size_t n, size_t offset = 0) {\n\t\tassert(offset + n <= this->length());\n\t\tmemcpy(this->begin + offset, value, n);\n\t}\n\n\tvoid put (Slice value, size_t offset = 0) {\n\t\tthis->put(value.begin, value.length(), offset);\n\t}\n\n\ttemplate \n\tY read () {\n\t\tconst Y value = this->peek();\n\t\tthis->popFrontN(sizeof(Y));\n\t\treturn value;\n\t}\n\n\ttemplate \n\tvoid write (Y value) {\n\t\tthis->put(value);\n\t\tthis->popFrontN(sizeof(Y));\n\t}\n\n\tvoid write (Slice value) {\n\t\tthis->put(value);\n\t\tthis->popFrontN(value.length());\n\t}\n\n\tvoid write (uint8_t* value, size_t n) {\n\t\tthis->put(value, n);\n\t\tthis->popFrontN(n);\n\t}\n\n\tuint8_t& operator[](const size_t i) {\n\t\tassert(i <= this->length());\n\t\treturn this->begin[i];\n\t}\n\n\tconst uint8_t& operator[](const size_t i) const {\n\t\tassert(i <= this->length());\n\t\treturn this->begin[i];\n\t}\n};\n<|endoftext|>"} {"text":"#ifndef stack_cpp\r\n#define stack_cpp\r\n#pragma once\r\n#include \r\n#include \r\n\r\nclass bitset\r\n{\r\npublic:\r\n\texplicit\r\n\t\tbitset(size_t size) \/*strong*\/;\r\n\r\n\tbitset(bitset const & other) = delete;\r\n\tauto operator =(bitset const & other)->bitset & = delete;\r\n\r\n\tbitset(bitset && other) = delete;\r\n\tauto operator =(bitset && other)->bitset & = delete;\r\n\r\n\tauto set(size_t index) \/*strong*\/ -> void;\r\n\tauto reset(size_t index) \/*strong*\/ -> void;\r\n\tauto test(size_t index) \/*strong*\/ -> bool;\r\n\r\n\tauto size() const \/*noexcept*\/ -> size_t;\r\n\tauto counter() const \/*noexcept*\/ -> size_t;\r\n\r\nprivate:\r\n\tstd::unique_ptr ptr_;\r\n\tsize_t size_;\r\n\tsize_t counter_;\r\n};\r\n\r\nbitset::bitset(size_t size) : ptr_(std::make_unique(size)), size_(size), counter_(0) {}\r\n\r\nauto bitset::set(size_t index) -> void\r\n{ if (index < size_) {\r\n\tptr_[index] = true; \r\n\t++counter_; }\r\n\telse throw(\"false_index\"); \r\n}\r\n\r\nauto bitset::reset(size_t index) -> void\r\n{\tif (index < size_)\r\n\t{\r\n\t\tptr_[index] = false;\r\n\t\t--counter_;\r\n\t}\r\n\telse throw(\"false_index\");\r\n}\r\n\r\nauto bitset::test(size_t index) -> bool\r\n{\r\n\tif (index < size_)\r\n\t{\r\n\t\treturn !ptr_[index];\r\n\t}\r\n\telse throw(\"false_index\");\r\n\t\r\n}\r\nauto bitset::size() const -> size_t\r\n{\r\n\treturn size_;\r\n}\r\n\r\nauto bitset::counter() const -> size_t\r\n{\r\n\treturn counter_;\r\n}\r\n\t\r\n\r\ntemplate \r\nclass allocator\r\n{\r\npublic:\r\n\texplicit\r\n\t\tallocator(std::size_t size = 0) \/*strong*\/;\r\n\tallocator(allocator const & other) \/*strong*\/;\r\n\tauto operator =(allocator const & other)->allocator & = delete;\r\n\t~allocator();\r\n\r\n\tauto resize() \/*strong*\/ -> void;\r\n\r\n\tauto construct(T * ptr, T const & value) \/*strong*\/ -> void;\r\n\tauto destroy(T * ptr) \/*noexcept*\/ -> void;\r\n\r\n\tauto get() \/*noexcept*\/ -> T *;\r\n\tauto get() const \/*noexcept*\/ -> T const *;\r\n\r\n\tauto count() const \/*noexcept*\/ -> size_t;\r\n\tauto full() const \/*noexcept*\/ -> bool;\r\n\tauto empty() const \/*noexcept*\/ -> bool;\r\nprivate:\r\n\tauto destroy(T * first, T * last) \/*noexcept*\/ -> void;\r\n\tauto swap(allocator & other) \/*noexcept*\/ -> void;\r\n\r\n\r\n\tT * ptr_;\r\n\tsize_t size_;\r\n\tstd::unique_ptr map_;\r\n};\r\n\r\ntemplate \r\nclass stack\r\n{\r\npublic:\r\n\texplicit\r\n\t\tstack(size_t size = 0);\r\n\tauto operator =(stack const & other) \/*strong*\/ -> stack &;\r\n\r\n\tauto empty() const \/*noexcept*\/ -> bool;\r\n\tauto count() const \/*noexcept*\/ -> size_t;\r\n\r\n\tauto push(T const & value) \/*strong*\/ -> void;\r\n\tauto pop() \/*strong*\/ -> void;\r\n\tauto top() \/*strong*\/ -> T &;\r\n\tauto top() const \/*strong*\/ -> T const &;\r\n\r\nprivate:\r\n\tallocator allocator_;\r\n\r\n\tauto throw_is_empty() const -> void;\r\n};\r\n\r\ntemplate \r\nallocator::allocator(size_t size) : ptr_((T*)(operator new(size*sizeof(T)))), size_(size), map_(std::make_unique(size)) {};\r\n\r\ntemplate\r\n\tallocator::allocator(allocator const& other) :\r\n\tallocator(other.size_){\r\n\tfor (size_t i=0; i < size_; ++i)\r\n\t\tif (map_->test(i))\r\n\t\tconstruct(ptr_ + i, other.ptr_[i]);\r\n}\r\ntemplate\r\nallocator::~allocator() {\r\n\tdestroy(ptr_, ptr_+size_);\r\n\toperator delete(ptr_); \r\n}\r\n\r\ntemplate\r\nauto allocator::resize() -> void\r\n{\r\n\tallocator buff(size_ * 2 + (size_ == 0));\r\n\tfor (size_t i = 0; i < size_; ++i) construct(buff.ptr_ + i, ptr_[i]);\r\n\tthis->swap(buff);\r\n}\r\n\r\ntemplate\r\nauto allocator::construct(T * ptr, T const & value)->void {\r\n\tif (ptr >= ptr_&&ptr < ptr_ + size_&&map_->test(ptr - ptr_)) {\r\n\t\tnew(ptr)T(value);\r\n\t\tmap_->set(ptr - ptr_);\r\n\t}\r\n\telse throw(\"error\");\r\n}\r\n\r\ntemplate\r\nauto allocator::destroy(T * ptr) -> void {\r\n\tif (!map_->test(ptr-ptr_)&&ptr>=ptr_&&ptr<=ptr_+this->count()){\r\n\tptr->~T();\r\n\tmap_->reset(ptr-ptr_);\r\n\t}\r\n\telse throw(\"error\");\r\n}\r\n\r\n\r\ntemplate\r\nauto allocator::destroy(T * first, T * last) -> void\r\n{\tif(first>=ptr_&&last<=ptr_+this->count())\r\n\tfor (; first != last; ++first) {\r\n\t\tdestroy(&*first);\r\n\t}\r\n}\r\n\r\ntemplate\r\nauto allocator::get()-> T* {\r\n\treturn ptr_; \r\n}\r\n\r\ntemplate\r\nauto allocator::get() const -> T const * { \r\n\treturn ptr_; \r\n}\r\n\r\ntemplate\r\nauto allocator::count() const -> size_t\r\n{\r\n\treturn map_->counter();\r\n}\r\n\r\ntemplate\r\nauto allocator::full() const -> bool\r\n{\r\n\treturn map_->counter()==size_;\r\n}\r\n\r\ntemplate\r\nauto allocator::empty() const -> bool\r\n{\r\n\treturn map_->counter()==0;\r\n}\r\n\r\ntemplate\r\nauto allocator::swap(allocator & other) -> void {\r\n\tstd::swap(ptr_, other.ptr_);\r\n\tstd::swap(map_, other.map_);\r\n\tstd::swap(size_, other.size_);\r\n}\r\n\r\ntemplate \r\nsize_t stack::count() const\r\n{\r\n\treturn allocator_.count();\r\n}\r\ntemplate \r\nstack::stack(size_t size) :allocator_(size) {} \r\n\r\ntemplate \r\nvoid stack::push(T const &item) {\r\n\tif (allocator_.full()) allocator_.resize(); \r\n\tallocator_.construct(allocator_.get() + this->count(), item);\r\n}\r\ntemplate\r\nvoid stack::pop()\r\n{\r\n\tif (this->count() > 0) \r\n\t\tallocator_.destroy(allocator_.get() + (this->count()-1));\r\n\telse throw_is_empty();\r\n}\r\ntemplate\r\nauto stack::top() -> T &\r\n{\r\n\tif (allocator_.count() == 0) {\r\n\t\tthrow_is_empty();\r\n\t}\r\n\treturn (*(allocator_.get() + allocator_.count() - 1));\r\n}\r\ntemplate\r\nauto stack::top() const -> T const &\r\n{\r\n\tif (allocator_.count() == 0) {\r\n\t\tthrow_is_empty();\r\n\t}\r\n\treturn (*(allocator_.get() + allocator_.count() - 1));\r\n}\r\n\r\ntemplate\r\nauto stack::throw_is_empty() const -> void\r\n{\r\n\t\tthrow(\"Stack is empty!\");\r\n}\r\n\r\ntemplate\r\nauto stack::operator =(stack const & right)-> stack &{ \r\n\tif (this != &right) {\r\n\t\t(allocator(right.allocator_)).swap(allocator_);\r\n\t}\r\n\treturn *this;\r\n}\r\ntemplate\r\nauto stack::empty() const -> bool {\r\n\treturn allocator_.empty(); \r\n}\r\n\r\n#endif\r\nUpdate stack.hpp#ifndef stack_cpp\r\n#define stack_cpp\r\n#pragma once\r\n#include \r\n#include \r\n\r\nclass bitset\r\n{\r\npublic:\r\n\texplicit\r\n\t\tbitset(size_t size) \/*strong*\/;\r\n\r\n\tbitset(bitset const & other) = delete;\r\n\tauto operator =(bitset const & other)->bitset & = delete;\r\n\r\n\tbitset(bitset && other) = delete;\r\n\tauto operator =(bitset && other)->bitset & = delete;\r\n\r\n\tauto set(size_t index) \/*strong*\/ -> void;\r\n\tauto reset(size_t index) \/*strong*\/ -> void;\r\n\tauto test(size_t index) \/*strong*\/ -> bool;\r\n\r\n\tauto size() const \/*noexcept*\/ -> size_t;\r\n\tauto counter() const \/*noexcept*\/ -> size_t;\r\n\r\nprivate:\r\n\tstd::unique_ptr ptr_;\r\n\tsize_t size_;\r\n\tsize_t counter_;\r\n};\r\n\r\nbitset::bitset(size_t size) : ptr_(std::make_unique(size)), size_(size), counter_(0) {}\r\n\r\nauto bitset::set(size_t index) -> void\r\n{ if (index < size_) {\r\n\tptr_[index] = true; \r\n\t++counter_; }\r\n\telse throw(\"false_index\"); \r\n}\r\n\r\nauto bitset::reset(size_t index) -> void\r\n{\tif (index < size_)\r\n\t{\r\n\t\tptr_[index] = false;\r\n\t\t--counter_;\r\n\t}\r\n\telse throw(\"false_index\");\r\n}\r\n\r\nauto bitset::test(size_t index) -> bool\r\n{\r\n\tif (index < size_)\r\n\t{\r\n\t\treturn !ptr_[index];\r\n\t}\r\n\telse throw(\"false_index\");\r\n\t\r\n}\r\nauto bitset::size() const -> size_t\r\n{\r\n\treturn size_;\r\n}\r\n\r\nauto bitset::counter() const -> size_t\r\n{\r\n\treturn counter_;\r\n}\r\n\t\r\n\r\ntemplate \r\nclass allocator\r\n{\r\npublic:\r\n\texplicit\r\n\t\tallocator(std::size_t size = 0) \/*strong*\/;\r\n\tallocator(allocator const & other) \/*strong*\/;\r\n\tauto operator =(allocator const & other)->allocator & = delete;\r\n\t~allocator();\r\n\r\n\tauto resize() \/*strong*\/ -> void;\r\n\r\n\tauto construct(T * ptr, T const & value) \/*strong*\/ -> void;\r\n\tauto destroy(T * ptr) \/*noexcept*\/ -> void;\r\n\r\n\tauto get() \/*noexcept*\/ -> T *;\r\n\tauto get() const \/*noexcept*\/ -> T const *;\r\n\r\n\tauto count() const \/*noexcept*\/ -> size_t;\r\n\tauto full() const \/*noexcept*\/ -> bool;\r\n\tauto empty() const \/*noexcept*\/ -> bool;\r\nprivate:\r\n\tauto destroy(T * first, T * last) \/*noexcept*\/ -> void;\r\n\tauto swap(allocator & other) \/*noexcept*\/ -> void;\r\n\r\n\r\n\tT * ptr_;\r\n\tsize_t size_;\r\n\tstd::unique_ptr map_;\r\n};\r\n\r\ntemplate \r\nclass stack\r\n{\r\npublic:\r\n\texplicit\r\n\t\tstack(size_t size = 0);\r\n\tauto operator =(stack const & other) \/*strong*\/ -> stack &;\r\n\r\n\tauto empty() const \/*noexcept*\/ -> bool;\r\n\tauto count() const \/*noexcept*\/ -> size_t;\r\n\r\n\tauto push(T const & value) \/*strong*\/ -> void;\r\n\tauto pop() \/*strong*\/ -> void;\r\n\tauto top() \/*strong*\/ -> T &;\r\n\tauto top() const \/*strong*\/ -> T const &;\r\n\r\nprivate:\r\n\tallocator allocator_;\r\n\r\n\tauto throw_is_empty() const -> void;\r\n};\r\n\r\ntemplate \r\nallocator::allocator(size_t size) : ptr_((T*)(operator new(size*sizeof(T)))), size_(size), map_(std::make_unique(size)) {};\r\n\r\ntemplate\r\n\tallocator::allocator(allocator const& other) :\r\n\tallocator(other.size_){\r\n\tfor (size_t i=0; i < size_; ++i)\r\n\t\tif (other.map_->test(i))\r\n\t\tconstruct(ptr_ + i, other.ptr_[i]);\r\n}\r\ntemplate\r\nallocator::~allocator() {\r\n\tdestroy(ptr_, ptr_+size_);\r\n\toperator delete(ptr_); \r\n}\r\n\r\ntemplate\r\nauto allocator::resize() -> void\r\n{\r\n\tallocator buff(size_ * 2 + (size_ == 0));\r\n\tfor (size_t i = 0; i < size_; ++i) construct(buff.ptr_ + i, ptr_[i]);\r\n\tthis->swap(buff);\r\n}\r\n\r\ntemplate\r\nauto allocator::construct(T * ptr, T const & value)->void {\r\n\tif (ptr >= ptr_&&ptr < ptr_ + size_&&map_->test(ptr - ptr_)) {\r\n\t\tnew(ptr)T(value);\r\n\t\tmap_->set(ptr - ptr_);\r\n\t}\r\n\telse throw(\"error\");\r\n}\r\n\r\ntemplate\r\nauto allocator::destroy(T * ptr) -> void {\r\n\tif(ptr>=ptr_&&ptr<=ptr_+this->size())\r\n\tif (!map_->test(ptr-ptr_){\r\n\tptr->~T();\r\n\tmap_->reset(ptr-ptr_);\r\n\t}\r\n}\r\n\telse throw(\"error\");\r\n}\r\n\r\n\r\ntemplate\r\nauto allocator::destroy(T * first, T * last) -> void\r\n{\tif(first>=ptr_&&last<=ptr_+this->())\r\n\tfor (; first != last; ++first) {\r\n\t\tdestroy(&*first);\r\n\t}\r\n}\r\n\r\ntemplate\r\nauto allocator::get()-> T* {\r\n\treturn ptr_; \r\n}\r\n\r\ntemplate\r\nauto allocator::get() const -> T const * { \r\n\treturn ptr_; \r\n}\r\n\r\ntemplate\r\nauto allocator::count() const -> size_t\r\n{\r\n\treturn map_->counter();\r\n}\r\n\r\ntemplate\r\nauto allocator::full() const -> bool\r\n{\r\n\treturn map_->counter()==size_;\r\n}\r\n\r\ntemplate\r\nauto allocator::empty() const -> bool\r\n{\r\n\treturn map_->counter()==0;\r\n}\r\n\r\ntemplate\r\nauto allocator::swap(allocator & other) -> void {\r\n\tstd::swap(ptr_, other.ptr_);\r\n\tstd::swap(map_, other.map_);\r\n\tstd::swap(size_, other.size_);\r\n}\r\n\r\ntemplate \r\nsize_t stack::count() const\r\n{\r\n\treturn allocator_.count();\r\n}\r\ntemplate \r\nstack::stack(size_t size) :allocator_(size) {} \r\n\r\ntemplate \r\nvoid stack::push(T const &item) {\r\n\tif (allocator_.full()) allocator_.resize(); \r\n\tallocator_.construct(allocator_.get() + this->count(), item);\r\n}\r\ntemplate\r\nvoid stack::pop()\r\n{\r\n\tif (this->count() > 0) \r\n\t\tallocator_.destroy(allocator_.get() + (this->count()-1));\r\n\telse throw_is_empty();\r\n}\r\ntemplate\r\nauto stack::top() -> T &\r\n{\r\n\tif (allocator_.count() == 0) {\r\n\t\tthrow_is_empty();\r\n\t}\r\n\treturn (*(allocator_.get() + allocator_.count() - 1));\r\n}\r\ntemplate\r\nauto stack::top() const -> T const &\r\n{\r\n\tif (allocator_.count() == 0) {\r\n\t\tthrow_is_empty();\r\n\t}\r\n\treturn (*(allocator_.get() + allocator_.count() - 1));\r\n}\r\n\r\ntemplate\r\nauto stack::throw_is_empty() const -> void\r\n{\r\n\t\tthrow(\"Stack is empty!\");\r\n}\r\n\r\ntemplate\r\nauto stack::operator =(stack const & right)-> stack &{ \r\n\tif (this != &right) {\r\n\t\t(allocator(right.allocator_)).swap(allocator_);\r\n\t}\r\n\treturn *this;\r\n}\r\ntemplate\r\nauto stack::empty() const -> bool {\r\n\treturn allocator_.empty(); \r\n}\r\n\r\n#endif\r\n<|endoftext|>"} {"text":"#ifndef stack_cpp\r\n#define stack_cpp\r\n#pragma once\r\n#include \r\n#include \r\n#include \r\n#include \r\nclass bitset\r\n{\r\npublic:\r\n\texplicit\r\n\t\tbitset(size_t size) \/*strong*\/;\r\n\r\n\tbitset(bitset const & other) = delete;\r\n\tauto operator =(bitset const & other)->bitset & = delete;\r\n\r\n\tbitset(bitset && other) = delete;\r\n\tauto operator =(bitset && other)->bitset & = delete;\r\n\r\n\tauto set(size_t index) \/*strong*\/ -> void;\r\n\tauto reset(size_t index) \/*strong*\/ -> void;\r\n\tauto test(size_t index) \/*strong*\/ -> bool;\r\n\r\n\tauto size() const \/*noexcept*\/ -> size_t;\r\n\tauto counter() const \/*noexcept*\/ -> size_t;\r\n\r\nprivate:\r\n\tstd::unique_ptr ptr_;\r\n\tsize_t size_;\r\n\tsize_t counter_;\r\n};\r\n\r\nbitset::bitset(size_t size) : ptr_(std::make_unique(size)), size_(size), counter_(0) {}\r\n\r\nauto bitset::set(size_t index) -> void\r\n{ if (index < size_) {\r\n\tptr_[index] = true; \r\n\t++counter_; }\r\n\telse throw(\"false_index\"); \r\n}\r\n\r\nauto bitset::reset(size_t index) -> void\r\n{\tif (index < size_)\r\n\t{\r\n\t\tptr_[index] = false;\r\n\t\t--counter_;\r\n\t}\r\n\telse throw(\"false_index\");\r\n}\r\n\r\nauto bitset::test(size_t index) -> bool\r\n{\r\n\tif (index < size_)\r\n\t{\r\n\t\treturn !ptr_[index];\r\n\t}\r\n\telse throw(\"false_index\");\r\n\t\r\n}\r\nauto bitset::size() const -> size_t\r\n{\r\n\treturn size_;\r\n}\r\n\r\nauto bitset::counter() const -> size_t\r\n{\r\n\treturn counter_;\r\n}\r\n\t\r\n\r\ntemplate \r\nclass allocator\r\n{\r\npublic:\r\n\texplicit\r\n\t\tallocator(std::size_t size = 0) \/*strong*\/;\r\n\tallocator(allocator const & other) \/*strong*\/;\r\n\tauto operator =(allocator const & other)->allocator & = delete;\r\n\t~allocator();\r\n\r\n\tauto resize() \/*strong*\/ -> void;\r\n\r\n\tauto construct(T * ptr, T const & value) \/*strong*\/ -> void;\r\n\tauto destroy(T * ptr) \/*noexcept*\/ -> void;\r\n\r\n\tauto get() \/*noexcept*\/ -> T *;\r\n\tauto get() const \/*noexcept*\/ -> T const *;\r\n\r\n\tauto count() const \/*noexcept*\/ -> size_t;\r\n\tauto full() const \/*noexcept*\/ -> bool;\r\n\tauto swap(allocator & other) \/*noexcept*\/ -> void;\r\n\tauto empty() const \/*noexcept*\/ -> bool;\r\nprivate:\r\n\tauto destroy(T * first, T * last) \/*noexcept*\/ -> void;\r\n\tT * ptr_;\r\n\tsize_t size_;\r\n\tstd::unique_ptr map_;\r\n};\r\n\r\ntemplate \r\nallocator::allocator(size_t size) : ptr_((T*)(operator new(size*sizeof(T)))), size_(size), map_(std::make_unique(size)) {};\r\n\r\ntemplate\r\n\tallocator::allocator(allocator const& other) :\r\n\tallocator(other.size_){\r\n\tfor (size_t i=0; i < size_; ++i)\r\n\t\tif (other.map_->test(i))\r\n\t\tconstruct(ptr_ + i, other.ptr_[i]);\r\n}\r\ntemplate\r\nallocator::~allocator() {\r\n\tdestroy(ptr_, ptr_+size_);\r\n\toperator delete(ptr_); \r\n}\r\n\r\ntemplate\r\nauto allocator::resize() -> void\r\n{\r\n\tallocator buff(size_ * 2 + (size_ == 0));\r\n\tfor (size_t i = 0; i < size_; ++i) construct(buff.ptr_ + i, ptr_[i]);\r\n\tthis->swap(buff);\r\n}\r\n\r\ntemplate\r\nauto allocator::construct(T * ptr, T const & value)->void {\r\n\tif (ptr >= ptr_&&ptr < ptr_ + size_&&map_->test(ptr - ptr_)) {\r\n\t\tnew(ptr)T(value);\r\n\t\tmap_->set(ptr - ptr_);\r\n\t}\r\n\telse throw(\"error\");\r\n}\r\n\r\ntemplate\r\nauto allocator::destroy(T * ptr) -> void {\r\n\tif(ptr>=ptr_&&ptr<=ptr_+this->size_){\r\n\tif (!map_->test(ptr-ptr_)){\r\n\tptr->~T();\r\n\tmap_->reset(ptr-ptr_);\r\n\t}\r\n}\r\n\telse throw(\"error\");\r\n}\r\n\r\n\r\ntemplate\r\nauto allocator::destroy(T * first, T * last) -> void\r\n{\tif(first>=ptr_&&last<=ptr_+this->size_)\r\n\tfor (; first != last; ++first) {\r\n\t\tdestroy(&*first);\r\n\t}\r\n}\r\n\r\ntemplate\r\nauto allocator::get()-> T* {\r\n\treturn ptr_; \r\n}\r\n\r\ntemplate\r\nauto allocator::get() const -> T const * { \r\n\treturn ptr_; \r\n}\r\n\r\ntemplate\r\nauto allocator::count() const -> size_t\r\n{\r\n\treturn map_->counter();\r\n}\r\n\r\ntemplate\r\nauto allocator::full() const -> bool\r\n{\r\n\treturn map_->counter()==size_;\r\n}\r\n\r\ntemplate\r\nauto allocator::empty() const -> bool\r\n{\r\n\treturn map_->counter()==0;\r\n}\r\n\r\ntemplate\r\nauto allocator::swap(allocator & other) -> void {\r\n\tstd::swap(ptr_, other.ptr_);\r\n\tstd::swap(map_, other.map_);\r\n\tstd::swap(size_, other.size_);\r\n}\r\ntemplate \r\nclass stack\r\n{\r\npublic:\r\n\texplicit\r\n\tstack(size_t size = 0);\r\n\tstack(stack const & other);\r\n\tauto operator =(stack const & other) \/*strong*\/ -> stack &;\r\n\r\n\tauto empty() const \/*noexcept*\/ -> bool;\r\n\tauto count() const \/*noexcept*\/ -> size_t;\r\n\r\n\tauto push(T const & value) \/*strong*\/ -> void;\r\n\tauto pop() \/*strong*\/ -> void;\r\n\tauto top() \/*strong*\/ -> T &;\r\n\tauto top() const \/*strong*\/ -> T const &;\r\n\r\nprivate:\r\n\tallocator allocator_;\r\n\tmutable std::mutex m;\r\n\tauto throw_is_empty() const -> void;\r\n};\r\ntemplate \r\nsize_t stack::count() const\r\n{\r\n\treturn allocator_.count();\r\n}\r\n\r\ntemplate\r\nstack::stack(stack const & other): allocator_(other.allocator_), m(){};\r\ntemplate \r\nstack::stack(size_t size):allocator_(size), m() {} ;\r\n\r\ntemplate \r\nvoid stack::push(T const &item) {\r\n\tstd::lock_guard locker(m);\r\n\tif (allocator_.full()) allocator_.resize(); \r\n\tallocator_.construct(allocator_.get() + this->count(), item);\r\n}\r\ntemplate\r\nvoid stack::pop()\r\n{\r\n\tstd::lock_guard locker(m);\r\n\tif (this->count() > 0) \r\n\t\tallocator_.destroy(allocator_.get() + (this->count()-1));\r\n\telse throw_is_empty();\r\n}\r\ntemplate\r\nauto stack::top() -> T &\r\n{\r\n\tstd::lock_guard locker(m);\r\n\tif (allocator_.count() == 0) {\r\n\t\tthrow_is_empty();\r\n\t}\r\n\treturn (*(allocator_.get() + allocator_.count() - 1));\r\n}\r\ntemplate\r\nauto stack::top() const -> T const &\r\n{\r\n\tstd::lock_guard locker(m);\r\n\tif (allocator_.count() == 0) {\r\n\t\tthrow_is_empty();\r\n\t}\r\n\treturn (*(allocator_.get() + allocator_.count() - 1));\r\n}\r\n\r\ntemplate\r\nauto stack::throw_is_empty() const -> void\r\n{\r\n\t\tthrow(\"Stack is empty!\");\r\n}\r\n\r\ntemplate\r\nauto stack::operator =(stack const & right)-> stack &{ \r\n\tif (this != &right) {\r\n\t\tstd::lock(m, right.m);\r\n\t\tstd::lock_guard locker1(m, std::adopt_lock);\r\n\t\tstd::lock_guard locker2(right.m, std::adopt_lock);\r\n\t\t(allocator(right.allocator_)).swap(allocator_);\r\n\t}\r\n\treturn *this;\r\n}\r\ntemplate\r\nauto stack::empty() const -> bool {\r\n\treturn allocator_.empty(); \r\n}\r\n\r\n#endif\r\nUpdate stack.hpp#ifndef stack_cpp \r\n#define stack_cpp\r\n#pragma once\r\n#include \r\n#include \r\n#include \r\n#include \r\n\r\nclass bitset\r\n{\r\npublic:\r\n\texplicit bitset(size_t size) \/*strong*\/;\r\n\r\n\tbitset(bitset const & other) = delete;\r\n\tauto operator =(bitset const & other)->bitset & = delete;\r\n\r\n\tbitset(bitset && other) = delete;\r\n\tauto operator =(bitset && other)->bitset & = delete;\r\n\r\n\tauto set(size_t index) \/*strong*\/ -> void;\r\n\tauto reset(size_t index) \/*strong*\/ -> void;\r\n\tauto test(size_t index) \/*strong*\/ -> bool;\r\n\r\n\tauto size() \/*noexcept*\/ -> size_t;\r\n\tauto counter() \/*noexcept*\/ -> size_t;\r\nprivate:\r\n\tstd::unique_ptr ptr_;\r\n\tsize_t size_;\r\n\tsize_t counter_;\r\n};\r\n\r\nbitset::bitset(size_t size) : ptr_(std::make_unique(size)), size_(size), counter_(0){}\r\n\r\nauto bitset::set(size_t index)->void {\r\n\tif (index >= 0 && index < size_) { ptr_[index] = true; ++counter_; }\r\n\telse throw(\"bad_index\");\r\n}\r\n\r\nauto bitset::reset(size_t index)->void {\r\n\tif (index >= 0 && index < size_) { ptr_[index] = false; --counter_; }\r\n\telse throw(\"bad_index\");\r\n}\r\n\r\nauto bitset::test(size_t index)->bool {\r\n\tif (index >= 0 && index < size_) return !ptr_[index];\r\n\telse throw(\"bad_index\");\r\n}\r\n\r\nauto bitset::size()->size_t{ return size_; }\r\n\r\nauto bitset::counter()->size_t{ return counter_; }\r\n\r\ntemplate \r\nclass allocator{\r\npublic:\r\n\texplicit allocator(std::size_t size = 0) \/*strong*\/;\r\n\tallocator(allocator const & other) \/*strong*\/;\r\n\tauto operator =(allocator const & other)->allocator & = delete;\r\n\t~allocator();\r\n\r\n\tauto resize() \/*strong*\/ -> void;\r\n\r\n\tauto construct(T * ptr, T const & value) \/*strong*\/ -> void;\r\n\tauto destroy(T * ptr) \/*noexcept*\/ -> void;\r\n\r\n\tauto get() \/*noexcept*\/ -> T *;\r\n\tauto get() const \/*noexcept*\/ -> T const *;\r\n\r\n\tauto count() const \/*noexcept*\/ -> size_t;\r\n\tauto full() const \/*noexcept*\/ -> bool;\r\n\tauto empty() const \/*noexcept*\/ -> bool;\r\n\tauto swap(allocator & other) \/*noexcept*\/ -> void;\r\nprivate:\r\n\tauto destroy(T * first, T * last) \/*noexcept*\/ -> void;\r\n\tsize_t count_;\r\n\tT * ptr_;\r\n\tsize_t size_;\r\n\tstd::unique_ptr map_;\r\n};\r\n\r\ntemplate\r\nallocator::allocator(size_t size) : ptr_((T*)operator new(size*sizeof(T))), size_(size), map_(std::make_unique(size)), count_(0) {}\r\n\r\ntemplate\r\nallocator::allocator(allocator const& other) : allocator(other.size_) {\r\n\tfor (size_t i = 0; i < other.count_; i++) if(map_->test(i)) construct(ptr_ + i, other.ptr_[i]);\r\n}\r\n\r\ntemplate\r\nallocator::~allocator(){\r\n\tif (this->count() > 0) {\r\n\t\tdestroy(ptr_, ptr_ + size_);\r\n\t}\r\n\toperator delete(ptr_);\r\n}\r\n\r\ntemplate\r\nauto allocator::resize()->void{\r\n\tallocator al(size_ * 2 + (size_ == 0));\r\n\tfor (size_t i = 0; i < size_; ++i) if (al.map_->test(i)) al.construct(al.get() + i, ptr_[i]);\r\n\tal.swap(*this);\r\n}\r\n\r\ntemplate\r\nauto allocator::construct(T * ptr, T const & value)->void{\r\n\tif (ptr >= ptr_&&ptr < ptr_ + size_){\r\n\t\tnew(ptr)T(value);\r\n\t\tmap_->set(ptr - ptr_);\r\n\t\t++count_;\r\n\t}\r\n\telse { throw(\"error\"); }\r\n}\r\n\r\ntemplate\r\nauto allocator::destroy(T* ptr)->void{\r\n\tif (!map_->test(ptr - ptr_) && ptr >= ptr_&&ptr <= ptr_ + this->count())\r\n\t{\r\n\t\tptr->~T();\r\n\t\tmap_->reset(ptr - ptr_);\r\n\t\t--count_;\r\n\t}\r\n}\r\n\r\ntemplate\r\nauto allocator::get()-> T* { return ptr_; }\r\n\r\ntemplate\r\nauto allocator::get() const -> T const * { return ptr_; }\r\n\r\ntemplate\r\nauto allocator::count() const -> size_t{ return count_; }\r\n\r\ntemplate\r\nauto allocator::full() const -> bool { return (map_->counter() == size_); }\r\n\r\ntemplate\r\nauto allocator::empty() const -> bool { return (map_->counter() == 0); }\r\n\r\ntemplate\r\nauto allocator::destroy(T * first, T * last)->void{\r\n\tif (first >= ptr_&&last <= ptr_ + this->count())\r\n\tfor (; first != last; ++first) {\r\n\t\tdestroy(&*first);\r\n\t}\r\n}\r\n\r\ntemplate\r\nauto allocator::swap(allocator & other)->void{\r\n\tstd::swap(ptr_, other.ptr_);\r\n\tstd::swap(size_, other.size_);\r\n\tstd::swap(map_, other.map_);\r\n\tstd::swap(count_, other.count_);\r\n}\r\n\r\n\r\n\r\ntemplate \r\nclass stack {\r\npublic:\r\n\texplicit stack(size_t size = 0);\r\n\tstack(stack const & other); \/*strong*\/\r\n\tauto operator =(stack const & other) \/*strong*\/ -> stack &;\r\n\r\n\tauto empty() const \/*noexcept*\/ -> bool;\r\n\tauto count() const \/*noexcept*\/ -> size_t;\r\n\r\n\tauto push(T const & value) \/*strong*\/ -> void;\r\n\tauto pop() \/*strong*\/ -> std::shared_ptr;\r\n\t\/\/auto top()const -> const T&;\r\n\r\nprivate:\r\n\tallocator allocator_;\r\n\tauto throw_is_empty()\/*strong*\/ const -> void;\r\n\tmutable std::mutex m;\r\n};\r\n\r\ntemplate \r\nstack::stack(size_t size) : allocator_(size), m() {};\r\n\r\ntemplate \r\nstack::stack(stack const & other) : allocator_(0), m() \r\n{\r\n\tstd::lock_guard locker2(other.m);\r\n\tallocator_.swap(allocator(other.allocator_));\r\n}\r\n\r\ntemplate \r\nauto stack::operator=(const stack &other)->stack& \r\n{\r\n\tif (this != &other) \r\n\t{\r\n\t\tstd::lock(m, other.m);\r\n\t\tstd::lock_guard locker1(m, std::adopt_lock);\r\n\t\tstd::lock_guard locker2(other.m, std::adopt_lock);\r\n\t\t(allocator(other.allocator_)).swap(allocator_);\r\n\t}\r\n\treturn *this;\r\n}\r\n\r\ntemplate\r\nauto stack::empty() const->bool \r\n{\r\n\tstd::lock_guard locker(m);\r\n\treturn (allocator_.count() == 0);\r\n}\r\n\r\ntemplate \r\nauto stack::count() const ->size_t \r\n{\r\n\tstd::lock_guard lockerk(m);\r\n\treturn allocator_.count();\r\n}\r\n\r\ntemplate \r\nauto stack::push(T const &val)->void \r\n{\r\n\tstd::lock_guard locker(m);\r\n\tif (allocator_.full()) \r\n\t{\r\n\t\tallocator_.resize();\r\n\t}\r\n\tallocator_.construct(allocator_.get() + allocator_.count(), val);\r\n}\r\n\r\ntemplate \r\nauto stack::pop()->std::shared_ptr \r\n{\r\n\tstd::lock_guard locker(m);\r\n\tif (allocator_.count() == 0) throw_is_empty();\r\n\tstd::shared_ptr top_(std::make_shared(std::move(allocator_.get()[allocator_.count() - 1])));\r\n\tallocator_.destroy(allocator_.get() + allocator_.count() - 1);\r\n\treturn top_;\r\n}\r\n\r\ntemplate \r\nauto stack::throw_is_empty()const->void\r\n{\r\n\tstd::lock_guard lk(m);\r\n\tthrow(\"EMPTY!\");\r\n}\r\n\r\n#endif\r\n<|endoftext|>"} {"text":"#pragma warning(push)\n#pragma warning(disable:4996)\n#pragma warning(disable:4244)\n#pragma warning(disable:4291)\n#pragma warning(disable:4146)\n\n#include \"clang\/AST\/AST.h\"\n#include \"clang\/AST\/ASTContext.h\"\n#include \"clang\/AST\/ASTConsumer.h\"\n#include \"clang\/AST\/DeclVisitor.h\"\n#include \"clang\/Frontend\/ASTConsumers.h\"\n#include \"clang\/Frontend\/FrontendActions.h\"\n#include \"clang\/Frontend\/CompilerInstance.h\"\n#include \"clang\/Frontend\/FrontendDiagnostic.h\"\n#include \"clang\/Lex\/Preprocessor.h\"\n#include \"clang\/Tooling\/CommonOptionsParser.h\"\n#include \"clang\/Tooling\/Tooling.h\"\n#include \"llvm\/Support\/raw_ostream.h\"\n#include \"llvm\/Support\/GraphWriter.h\"\n\n#pragma warning(pop)\n\n#include \n\nusing namespace std;\nusing namespace clang;\nusing namespace clang::tooling;\nusing namespace llvm;\n\n\/\/ ***************************************************************************\n\/\/ vvZbT̃R[obN\n\/\/ ***************************************************************************\n\nclass cincluder : public PPCallbacks {\nprivate:\n Preprocessor &PP;\n\n\ttypedef ::std::hash< ::std::string > hash;\n\ttypedef ::std::list< hash::result_type > hash_list;\n\n\tstruct header\n\t{\n\t\theader() : angled(false) {}\n\t\theader(const ::std::string& n, bool angled_) : name(n), angled(angled_) {}\n\t\t::std::string name;\n\t\tbool angled;\n\t\thash_list include;\n\t};\n\ttypedef ::std::map< hash::result_type, header > Map;\n\ttypedef ::std::map< hash::result_type, hash_list > Depend;\n\tMap m_includes;\n\tDepend m_depends;\n\thash::result_type m_root;\n\t::std::string m_output;\npublic:\n\tcincluder(Preprocessor &pp) : PP(pp) {}\n\tcincluder(Preprocessor &pp, const ::std::string& output) : PP(pp), m_output(output) {}\n\n\tconst header& getHeader(hash::result_type h)\n\t{\n\t\treturn m_includes[h];\n\t}\n\t\n\t::std::string getFilePath(hash::result_type h)\n\t{\n\t\treturn m_includes[h].name;\n\t}\n\t::std::string getFileName(hash::result_type h)\n\t{\n\t\t::std::string path = getFilePath(h);\n\t\tsize_t dpos1 = path.rfind('\\\\');\n\t\tsize_t dpos2 = path.rfind('\/');\n\t\tif( dpos1 == ::std::string::npos ) dpos1 = 0;\n\t\tif( dpos2 == ::std::string::npos ) dpos2 = 0;\n\t\tconst size_t dpos = (::std::max)(dpos1, dpos2) + 1;\n\n\t\treturn path.substr( dpos );\n\t}\n\t::std::string getFileName(const header& h)\n\t{\n\t\t::std::string path = h.name;\n\t\tsize_t dpos1 = path.rfind('\\\\');\n\t\tsize_t dpos2 = path.rfind('\/');\n\t\tif( dpos1 == ::std::string::npos ) dpos1 = 0;\n\t\tif( dpos2 == ::std::string::npos ) dpos2 = 0;\n\t\tconst size_t dpos = (::std::max)(dpos1, dpos2) + 1;\n\n\t\treturn path.substr(dpos);\n\t}\n\n\tvoid printRoot(hash::result_type h, int indent, bool expand)\n\t{\n\t\tif( indent > 2 ) return;\n\t\tfor( int i = 0; i < indent; ++i ) errs() << \" \";\n\t\tif( expand ) errs() << \"+ \";\n\t\telse errs() << \" \";\n\t\terrs() << getFileName(h) << \"\\n\";\n\n\t\tif( m_depends.find(h) != m_depends.end() )\n\t\t{\n\t\t\tauto depend = m_depends[h];\n\t\t\tif( depend.size() > 1 ) ++indent;\n\t\t\tfor( auto d : depend )\n\t\t\t{\n\t\t\t\tprintRoot(d, indent, (depend.size() > 1));\n\t\t\t}\n\t\t}\n\t}\n\n\tvoid report()\n\t{\n\t\tfor( auto h : m_depends )\n\t\t{\n\t\t\tif( h.second.size() > 1 )\n\t\t\t{\n\t\t\t\terrs() << getFileName(h.first) << \" is already include by \\n\";\n\t\t\t\tfor( auto d : h.second )\n\t\t\t\t{\n\t\t\t\t\tprintRoot(d, 1, true);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\n\tvoid writeID(raw_ostream& OS, hash::result_type h)\n\t{\n\t\tOS << \"header_\" << h;\n\t}\n\n\tvoid dot()\n\t{\n\t\tif( m_output.empty() ) return;\n\t\tstd::error_code EC;\n\t\tllvm::raw_fd_ostream OS(m_output, EC, llvm::sys::fs::F_Text);\n\t\tif( EC ) \n\t\t{\n\t\t\tPP.getDiagnostics().Report(diag::err_fe_error_opening) << m_output\n\t\t\t\t<< EC.message();\n\t\t\treturn;\n\t\t}\n\t\tconst char* endl = \"\\n\";\n\n\t\tOS << \"digraph \\\"dependencies\\\" {\" << endl;\n\n\t\tfor( auto inc : m_includes )\n\t\t{\n\t\t\twriteID(OS, inc.first);\n\t\t\tOS << \" [ shape=\\\"box\\\", label=\\\"\";\n\t\t\tOS << DOT::EscapeString(getFileName(inc.second));\n\t\t\tOS << \"\\\"];\" << endl;\n\t\t}\n\n\t\tfor( auto h : m_depends )\n\t\t{\n\t\t\tfor(auto depend : h.second)\n\t\t\t{\n\t\t\t\twriteID(OS, h.first);\n\t\t\t\tOS << \" -> \";\n\t\t\t\twriteID(OS, depend);\n\t\t\t\tOS << endl;\n\t\t\t}\n\t\t}\n\n\t\tOS << \"}\" << endl;\n\t}\n\n\tvoid EndOfMainFile() override\n\t{\n\t\treport();\n\t\tdot();\n\t}\n\n void InclusionDirective(SourceLocation HashLoc,\n const Token &IncludeTok,\n llvm::StringRef FileName, \n bool IsAngled,\n CharSourceRange FilenameRange,\n const FileEntry *File,\n llvm::StringRef SearchPath,\n llvm::StringRef RelativePath,\n const Module *Imported) override\n\t{\n\t\tif( File == nullptr ) return;\n\n\t\tSourceManager& SM = PP.getSourceManager();\n\t\tconst FileEntry* pFromFile = SM.getFileEntryForID(SM.getFileID(SM.getExpansionLoc(HashLoc)));\n\t\tif( pFromFile == nullptr ) return;\n\n\t\tconst auto h = hash()(File->getName());\n\t\tconst auto p = hash()(pFromFile->getName());\n\t\t{\n\t\t\tif( m_includes.find(h) == m_includes.end() )\n\t\t\t{\n\t\t\t\tm_includes.insert(::std::make_pair(h, header(File->getName(), IsAngled)));\n\t\t\t}\n\n\t\t\tauto it = m_includes.find(p);\n\t\t\tif( it == m_includes.end() )\n\t\t\t{\n\t\t\t\tm_root = p;\n\t\t\t\tm_includes.insert(::std::make_pair(p, header(pFromFile->getName(), false)));\n\t\t\t}\n\t\t\tif( it != m_includes.end() )\n\t\t\t{\n\t\t\t\tit->second.include.push_back(h);\n\t\t\t}\n\t\t}\n\t\tif( !IsAngled )\n\t\t{\n\t\t\tauto it = m_depends.find(h);\n\t\t\tif( it != m_depends.end() )\n\t\t\t{\n\t\t\t\tit->second.push_back(p);\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\thash_list a;\n\t\t\t\ta.push_back(p);\n\t\t\t\tm_depends.insert(::std::make_pair(h, a));\n\t\t\t}\n\t\t}\n\n\n#if 0\n errs() << \"InclusionDirective : \";\n if (File) {\n if (IsAngled) errs() << \"<\" << File->getName() << \">\\n\";\n else errs() << \"\\\"\" << File->getName() << \"\\\"\\n\";\n } else {\n errs() << \"not found file \";\n if (IsAngled) errs() << \"<\" << FileName << \">\\n\";\n else errs() << \"\\\"\" << FileName << \"\\\"\\n\";\n }\n#endif\n }\n};\n\nclass ExampleASTConsumer : public ASTConsumer {\nprivate:\npublic:\n\texplicit ExampleASTConsumer(CompilerInstance *CI) {\n\t\t\/\/ vvZbT̃R[obNo^\n\t\tPreprocessor &PP = CI->getPreprocessor();\n\t\tPP.addPPCallbacks(llvm::make_unique(PP, \"test.dot\"));\n\t\t\/\/AttachDependencyGraphGen(PP, \"test.dot\", \"\");\n\t}\n};\n\nclass ExampleFrontendAction : public SyntaxOnlyAction \/*ASTFrontendAction*\/ {\npublic:\n\tvirtual std::unique_ptr CreateASTConsumer(CompilerInstance &CI, StringRef file) {\n\t\treturn llvm::make_unique(&CI); \/\/ pass CI pointer to ASTConsumer\n\t}\n};\n\nstatic cl::OptionCategory MyToolCategory(\"cincluder\");\nint main(int argc, const char** argv)\n{\n\tCommonOptionsParser op(argc, argv, MyToolCategory);\n\tClangTool Tool(op.getCompilations(), op.getSourcePathList());\n\treturn Tool.run(newFrontendActionFactory().get());\n}\n\n\nwrite hex#pragma warning(push)\n#pragma warning(disable:4996)\n#pragma warning(disable:4244)\n#pragma warning(disable:4291)\n#pragma warning(disable:4146)\n\n#include \"clang\/AST\/AST.h\"\n#include \"clang\/AST\/ASTContext.h\"\n#include \"clang\/AST\/ASTConsumer.h\"\n#include \"clang\/AST\/DeclVisitor.h\"\n#include \"clang\/Frontend\/ASTConsumers.h\"\n#include \"clang\/Frontend\/FrontendActions.h\"\n#include \"clang\/Frontend\/CompilerInstance.h\"\n#include \"clang\/Frontend\/FrontendDiagnostic.h\"\n#include \"clang\/Lex\/Preprocessor.h\"\n#include \"clang\/Tooling\/CommonOptionsParser.h\"\n#include \"clang\/Tooling\/Tooling.h\"\n#include \"llvm\/Support\/raw_ostream.h\"\n#include \"llvm\/Support\/GraphWriter.h\"\n\n#pragma warning(pop)\n\n#include \n\nusing namespace std;\nusing namespace clang;\nusing namespace clang::tooling;\nusing namespace llvm;\n\n\/\/ ***************************************************************************\n\/\/ vvZbT̃R[obN\n\/\/ ***************************************************************************\n\nclass cincluder : public PPCallbacks {\nprivate:\n Preprocessor &PP;\n\n\ttypedef ::std::hash< ::std::string > hash;\n\ttypedef ::std::list< hash::result_type > hash_list;\n\n\tstruct header\n\t{\n\t\theader() : angled(false) {}\n\t\theader(const ::std::string& n, bool angled_) : name(n), angled(angled_) {}\n\t\t::std::string name;\n\t\tbool angled;\n\t\thash_list include;\n\t};\n\ttypedef ::std::map< hash::result_type, header > Map;\n\ttypedef ::std::map< hash::result_type, hash_list > Depend;\n\tMap m_includes;\n\tDepend m_depends;\n\thash::result_type m_root;\n\t::std::string m_output;\npublic:\n\tcincluder(Preprocessor &pp) : PP(pp) {}\n\tcincluder(Preprocessor &pp, const ::std::string& output) : PP(pp), m_output(output) {}\n\n\tconst header& getHeader(hash::result_type h)\n\t{\n\t\treturn m_includes[h];\n\t}\n\t\n\t::std::string getFilePath(hash::result_type h)\n\t{\n\t\treturn m_includes[h].name;\n\t}\n\t::std::string getFileName(hash::result_type h)\n\t{\n\t\t::std::string path = getFilePath(h);\n\t\tsize_t dpos1 = path.rfind('\\\\');\n\t\tsize_t dpos2 = path.rfind('\/');\n\t\tif( dpos1 == ::std::string::npos ) dpos1 = 0;\n\t\tif( dpos2 == ::std::string::npos ) dpos2 = 0;\n\t\tconst size_t dpos = (::std::max)(dpos1, dpos2) + 1;\n\n\t\treturn path.substr( dpos );\n\t}\n\t::std::string getFileName(const header& h)\n\t{\n\t\t::std::string path = h.name;\n\t\tsize_t dpos1 = path.rfind('\\\\');\n\t\tsize_t dpos2 = path.rfind('\/');\n\t\tif( dpos1 == ::std::string::npos ) dpos1 = 0;\n\t\tif( dpos2 == ::std::string::npos ) dpos2 = 0;\n\t\tconst size_t dpos = (::std::max)(dpos1, dpos2) + 1;\n\n\t\treturn path.substr(dpos);\n\t}\n\n\tvoid printRoot(hash::result_type h, int indent, bool expand)\n\t{\n\t\tif( indent > 2 ) return;\n\t\tfor( int i = 0; i < indent; ++i ) errs() << \" \";\n\t\tif( expand ) errs() << \"+ \";\n\t\telse errs() << \" \";\n\t\terrs() << getFileName(h) << \"\\n\";\n\n\t\tif( m_depends.find(h) != m_depends.end() )\n\t\t{\n\t\t\tauto depend = m_depends[h];\n\t\t\tif( depend.size() > 1 ) ++indent;\n\t\t\tfor( auto d : depend )\n\t\t\t{\n\t\t\t\tprintRoot(d, indent, (depend.size() > 1));\n\t\t\t}\n\t\t}\n\t}\n\n\tvoid report()\n\t{\n\t\tfor( auto h : m_depends )\n\t\t{\n\t\t\tif( h.second.size() > 1 )\n\t\t\t{\n\t\t\t\terrs() << getFileName(h.first) << \" is already include by \\n\";\n\t\t\t\tfor( auto d : h.second )\n\t\t\t\t{\n\t\t\t\t\tprintRoot(d, 1, true);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\n\tvoid writeID(raw_ostream& OS, hash::result_type h)\n\t{\n\t\tOS << \"header_\";\n\t\tOS.write_hex(h);\n\t}\n\n\tvoid dot()\n\t{\n\t\tif( m_output.empty() ) return;\n\t\tstd::error_code EC;\n\t\tllvm::raw_fd_ostream OS(m_output, EC, llvm::sys::fs::F_Text);\n\t\tif( EC ) \n\t\t{\n\t\t\tPP.getDiagnostics().Report(diag::err_fe_error_opening) << m_output\n\t\t\t\t<< EC.message();\n\t\t\treturn;\n\t\t}\n\t\tconst char* endl = \"\\n\";\n\n\t\tOS << \"digraph \\\"dependencies\\\" {\" << endl;\n\n\t\tfor( auto inc : m_includes )\n\t\t{\n\t\t\twriteID(OS, inc.first);\n\t\t\tOS << \" [ shape=\\\"box\\\", label=\\\"\";\n\t\t\tOS << DOT::EscapeString(getFileName(inc.second));\n\t\t\tOS << \"\\\"];\" << endl;\n\t\t}\n\n\t\tfor( auto h : m_depends )\n\t\t{\n\t\t\tfor(auto depend : h.second)\n\t\t\t{\n\t\t\t\twriteID(OS, h.first);\n\t\t\t\tOS << \" -> \";\n\t\t\t\twriteID(OS, depend);\n\t\t\t\tOS << endl;\n\t\t\t}\n\t\t}\n\n\t\tOS << \"}\" << endl;\n\t}\n\n\tvoid EndOfMainFile() override\n\t{\n\t\treport();\n\t\tdot();\n\t}\n\n void InclusionDirective(SourceLocation HashLoc,\n const Token &IncludeTok,\n llvm::StringRef FileName, \n bool IsAngled,\n CharSourceRange FilenameRange,\n const FileEntry *File,\n llvm::StringRef SearchPath,\n llvm::StringRef RelativePath,\n const Module *Imported) override\n\t{\n\t\tif( File == nullptr ) return;\n\n\t\tSourceManager& SM = PP.getSourceManager();\n\t\tconst FileEntry* pFromFile = SM.getFileEntryForID(SM.getFileID(SM.getExpansionLoc(HashLoc)));\n\t\tif( pFromFile == nullptr ) return;\n\n\t\tconst auto h = hash()(File->getName());\n\t\tconst auto p = hash()(pFromFile->getName());\n\t\t{\n\t\t\tif( m_includes.find(h) == m_includes.end() )\n\t\t\t{\n\t\t\t\tm_includes.insert(::std::make_pair(h, header(File->getName(), IsAngled)));\n\t\t\t}\n\n\t\t\tauto it = m_includes.find(p);\n\t\t\tif( it == m_includes.end() )\n\t\t\t{\n\t\t\t\tm_root = p;\n\t\t\t\tm_includes.insert(::std::make_pair(p, header(pFromFile->getName(), false)));\n\t\t\t}\n\t\t\tif( it != m_includes.end() )\n\t\t\t{\n\t\t\t\tit->second.include.push_back(h);\n\t\t\t}\n\t\t}\n\t\tif( !IsAngled )\n\t\t{\n\t\t\tauto it = m_depends.find(h);\n\t\t\tif( it != m_depends.end() )\n\t\t\t{\n\t\t\t\tit->second.push_back(p);\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\thash_list a;\n\t\t\t\ta.push_back(p);\n\t\t\t\tm_depends.insert(::std::make_pair(h, a));\n\t\t\t}\n\t\t}\n\n\n#if 0\n errs() << \"InclusionDirective : \";\n if (File) {\n if (IsAngled) errs() << \"<\" << File->getName() << \">\\n\";\n else errs() << \"\\\"\" << File->getName() << \"\\\"\\n\";\n } else {\n errs() << \"not found file \";\n if (IsAngled) errs() << \"<\" << FileName << \">\\n\";\n else errs() << \"\\\"\" << FileName << \"\\\"\\n\";\n }\n#endif\n }\n};\n\nclass ExampleASTConsumer : public ASTConsumer {\nprivate:\npublic:\n\texplicit ExampleASTConsumer(CompilerInstance *CI) {\n\t\t\/\/ vvZbT̃R[obNo^\n\t\tPreprocessor &PP = CI->getPreprocessor();\n\t\tPP.addPPCallbacks(llvm::make_unique(PP, \"test.dot\"));\n\t\t\/\/AttachDependencyGraphGen(PP, \"test.dot\", \"\");\n\t}\n};\n\nclass ExampleFrontendAction : public SyntaxOnlyAction \/*ASTFrontendAction*\/ {\npublic:\n\tvirtual std::unique_ptr CreateASTConsumer(CompilerInstance &CI, StringRef file) {\n\t\treturn llvm::make_unique(&CI); \/\/ pass CI pointer to ASTConsumer\n\t}\n};\n\nstatic cl::OptionCategory MyToolCategory(\"cincluder\");\nint main(int argc, const char** argv)\n{\n\tCommonOptionsParser op(argc, argv, MyToolCategory);\n\tClangTool Tool(op.getCompilations(), op.getSourcePathList());\n\treturn Tool.run(newFrontendActionFactory().get());\n}\n\n\n<|endoftext|>"} {"text":"\/**\n * @file lars.cpp\n * @author Nishant Mehta (niche)\n *\n * Implementation of LARS and LASSO.\n *\/\n#include \"lars.hpp\"\n\nusing namespace mlpack;\nusing namespace mlpack::regression;\n\nLARS::LARS(const bool useCholesky,\n const double lambda1,\n const double lambda2,\n const double tolerance) :\n matGram(matGramInternal),\n useCholesky(useCholesky),\n lasso((lambda1 != 0)),\n lambda1(lambda1),\n elasticNet((lambda1 != 0) && (lambda2 != 0)),\n lambda2(lambda2),\n tolerance(tolerance)\n{ \/* Nothing left to do. *\/ }\n\nLARS::LARS(const bool useCholesky,\n const arma::mat& gramMatrix,\n const double lambda1,\n const double lambda2,\n const double tolerance) :\n matGram(gramMatrix),\n useCholesky(useCholesky),\n lasso((lambda1 != 0)),\n lambda1(lambda1),\n elasticNet((lambda1 != 0) && (lambda2 != 0)),\n lambda2(lambda2),\n tolerance(tolerance)\n{ \/* Nothing left to do *\/ }\n\nvoid LARS::Regress(const arma::mat& matX,\n const arma::vec& y,\n arma::vec& beta,\n const bool rowMajor)\n{\n Timer::Start(\"lars_regression\");\n\n \/\/ This matrix may end up holding the transpose -- if necessary.\n arma::mat dataTrans;\n \/\/ dataRef is row-major.\n const arma::mat& dataRef = (rowMajor ? matX : dataTrans);\n if (!rowMajor)\n dataTrans = trans(matX);\n\n \/\/ Compute X' * y.\n arma::vec vecXTy = trans(dataRef) * y;\n\n \/\/ Set up active set variables. In the beginning, the active set has size 0\n \/\/ (all dimensions are inactive).\n isActive.resize(dataRef.n_cols, false);\n\n \/\/ Initialize yHat and beta.\n beta = arma::zeros(dataRef.n_cols);\n arma::vec yHat = arma::zeros(dataRef.n_rows);\n arma::vec yHatDirection = arma::vec(dataRef.n_rows);\n\n bool lassocond = false;\n\n \/\/ Compute the initial maximum correlation among all dimensions.\n arma::vec corr = vecXTy;\n double maxCorr = 0;\n size_t changeInd = 0;\n for (size_t i = 0; i < vecXTy.n_elem; ++i)\n {\n if (fabs(corr(i)) > maxCorr)\n {\n maxCorr = fabs(corr(i));\n changeInd = i;\n }\n }\n\n betaPath.push_back(beta);\n lambdaPath.push_back(maxCorr);\n\n \/\/ If the maximum correlation is too small, there is no reason to continue.\n if (maxCorr < lambda1)\n {\n lambdaPath[0] = lambda1;\n return;\n }\n\n \/\/ Compute the Gram matrix. If this is the elastic net problem, we will add\n \/\/ lambda2 * I_n to the matrix.\n if (matGram.n_elem == 0)\n {\n \/\/ In this case, matGram should reference matGramInternal.\n matGramInternal = trans(dataRef) * dataRef;\n\n if (elasticNet && !useCholesky)\n matGramInternal += lambda2 * arma::eye(dataRef.n_cols, dataRef.n_cols);\n }\n\n \/\/ Main loop.\n while ((activeSet.size() < dataRef.n_cols) && (maxCorr > tolerance))\n {\n \/\/ Compute the maximum correlation among inactive dimensions.\n maxCorr = 0;\n for (size_t i = 0; i < dataRef.n_cols; i++)\n {\n if ((!isActive[i]) && (fabs(corr(i)) > maxCorr))\n {\n maxCorr = fabs(corr(i));\n changeInd = i;\n }\n }\n\n if (!lassocond)\n {\n if (useCholesky)\n {\n \/\/ vec newGramCol = vec(activeSet.size());\n \/\/ for (size_t i = 0; i < activeSet.size(); i++)\n \/\/ {\n \/\/ newGramCol[i] = dot(matX.col(activeSet[i]), matX.col(changeInd));\n \/\/ }\n \/\/ This is equivalent to the above 5 lines.\n arma::vec newGramCol = matGram.elem(changeInd * dataRef.n_cols +\n arma::conv_to::from(activeSet));\n\n CholeskyInsert(matGram(changeInd, changeInd), newGramCol);\n }\n\n \/\/ Add variable to active set.\n Activate(changeInd);\n }\n\n \/\/ Compute signs of correlations.\n arma::vec s = arma::vec(activeSet.size());\n for (size_t i = 0; i < activeSet.size(); i++)\n s(i) = corr(activeSet[i]) \/ fabs(corr(activeSet[i]));\n\n \/\/ Compute the \"equiangular\" direction in parameter space (betaDirection).\n \/\/ We use quotes because in the case of non-unit norm variables, this need\n \/\/ not be equiangular.\n arma::vec unnormalizedBetaDirection;\n double normalization;\n arma::vec betaDirection;\n if (useCholesky)\n {\n \/**\n * Note that:\n * R^T R % S^T % S = (R % S)^T (R % S)\n * Now, for 1 the ones vector:\n * inv( (R % S)^T (R % S) ) 1\n * = inv(R % S) inv((R % S)^T) 1\n * = inv(R % S) Solve((R % S)^T, 1)\n * = inv(R % S) Solve(R^T, s)\n * = Solve(R % S, Solve(R^T, s)\n * = s % Solve(R, Solve(R^T, s))\n *\/\n unnormalizedBetaDirection = solve(trimatu(matUtriCholFactor),\n solve(trimatl(trans(matUtriCholFactor)), s));\n\n normalization = 1.0 \/ sqrt(dot(s, unnormalizedBetaDirection));\n betaDirection = normalization * unnormalizedBetaDirection;\n }\n else\n {\n arma::mat matGramActive = arma::mat(activeSet.size(), activeSet.size());\n for (size_t i = 0; i < activeSet.size(); i++)\n for (size_t j = 0; j < activeSet.size(); j++)\n matGramActive(i, j) = matGram(activeSet[i], activeSet[j]);\n\n arma::mat matS = s * arma::ones(1, activeSet.size());\n unnormalizedBetaDirection = solve(matGramActive % trans(matS) % matS,\n arma::ones(activeSet.size(), 1));\n normalization = 1.0 \/ sqrt(sum(unnormalizedBetaDirection));\n betaDirection = normalization * unnormalizedBetaDirection % s;\n }\n\n \/\/ compute \"equiangular\" direction in output space\n ComputeYHatDirection(dataRef, betaDirection, yHatDirection);\n\n double gamma = maxCorr \/ normalization;\n\n \/\/ If not all variables are active.\n if (activeSet.size() < dataRef.n_cols)\n {\n \/\/ Compute correlations with direction.\n for (size_t ind = 0; ind < dataRef.n_cols; ind++)\n {\n if (isActive[ind])\n continue;\n\n double dirCorr = dot(dataRef.col(ind), yHatDirection);\n double val1 = (maxCorr - corr(ind)) \/ (normalization - dirCorr);\n double val2 = (maxCorr + corr(ind)) \/ (normalization + dirCorr);\n if ((val1 > 0) && (val1 < gamma))\n gamma = val1;\n if ((val2 > 0) && (val2 < gamma))\n gamma = val2;\n }\n }\n\n \/\/ Bound gamma according to LASSO.\n if (lasso)\n {\n lassocond = false;\n double lassoboundOnGamma = DBL_MAX;\n size_t activeIndToKickOut = -1;\n\n for (size_t i = 0; i < activeSet.size(); i++)\n {\n double val = -beta(activeSet[i]) \/ betaDirection(i);\n if ((val > 0) && (val < lassoboundOnGamma))\n {\n lassoboundOnGamma = val;\n activeIndToKickOut = i;\n }\n }\n\n if (lassoboundOnGamma < gamma)\n {\n gamma = lassoboundOnGamma;\n lassocond = true;\n changeInd = activeIndToKickOut;\n }\n }\n\n \/\/ Update the prediction.\n yHat += gamma * yHatDirection;\n\n \/\/ Update the estimator.\n for (size_t i = 0; i < activeSet.size(); i++)\n {\n beta(activeSet[i]) += gamma * betaDirection(i);\n }\n\n \/\/ Sanity check to make sure the kicked out dimension is actually zero.\n if (lassocond)\n {\n if (beta(activeSet[changeInd]) != 0)\n beta(activeSet[changeInd]) = 0;\n }\n\n betaPath.push_back(beta);\n\n if (lassocond)\n {\n \/\/ Index is in position changeInd in activeSet.\n if (useCholesky)\n CholeskyDelete(changeInd);\n\n Deactivate(changeInd);\n }\n\n corr = vecXTy - trans(dataRef) * yHat;\n if (elasticNet)\n corr -= lambda2 * beta;\n\n double curLambda = 0;\n for (size_t i = 0; i < activeSet.size(); i++)\n curLambda += fabs(corr(activeSet[i]));\n\n curLambda \/= ((double) activeSet.size());\n\n lambdaPath.push_back(curLambda);\n\n \/\/ Time to stop for LASSO?\n if (lasso)\n {\n if (curLambda <= lambda1)\n {\n InterpolateBeta();\n break;\n }\n }\n }\n\n \/\/ Unfortunate copy...\n beta = betaPath.back();\n\n Timer::Stop(\"lars_regression\");\n}\n\n\/\/ Private functions.\nvoid LARS::Deactivate(const size_t activeVarInd)\n{\n isActive[activeSet[activeVarInd]] = false;\n activeSet.erase(activeSet.begin() + activeVarInd);\n}\n\nvoid LARS::Activate(const size_t varInd)\n{\n isActive[varInd] = true;\n activeSet.push_back(varInd);\n}\n\nvoid LARS::ComputeYHatDirection(const arma::mat& matX,\n const arma::vec& betaDirection,\n arma::vec& yHatDirection)\n{\n yHatDirection.fill(0);\n for (size_t i = 0; i < activeSet.size(); i++)\n yHatDirection += betaDirection(i) * matX.col(activeSet[i]);\n}\n\nvoid LARS::InterpolateBeta()\n{\n int pathLength = betaPath.size();\n\n \/\/ interpolate beta and stop\n double ultimateLambda = lambdaPath[pathLength - 1];\n double penultimateLambda = lambdaPath[pathLength - 2];\n double interp = (penultimateLambda - lambda1)\n \/ (penultimateLambda - ultimateLambda);\n\n betaPath[pathLength - 1] = (1 - interp) * (betaPath[pathLength - 2])\n + interp * betaPath[pathLength - 1];\n\n lambdaPath[pathLength - 1] = lambda1;\n}\n\nvoid LARS::CholeskyInsert(const arma::vec& newX, const arma::mat& X)\n{\n if (matUtriCholFactor.n_rows == 0)\n {\n matUtriCholFactor = arma::mat(1, 1);\n\n if (elasticNet)\n matUtriCholFactor(0, 0) = sqrt(dot(newX, newX) + lambda2);\n else\n matUtriCholFactor(0, 0) = norm(newX, 2);\n }\n else\n {\n arma::vec newGramCol = trans(X) * newX;\n CholeskyInsert(dot(newX, newX), newGramCol);\n }\n}\n\nvoid LARS::CholeskyInsert(double sqNormNewX, const arma::vec& newGramCol)\n{\n int n = matUtriCholFactor.n_rows;\n\n if (n == 0)\n {\n matUtriCholFactor = arma::mat(1, 1);\n\n if (elasticNet)\n matUtriCholFactor(0, 0) = sqrt(sqNormNewX + lambda2);\n else\n matUtriCholFactor(0, 0) = sqrt(sqNormNewX);\n }\n else\n {\n arma::mat matNewR = arma::mat(n + 1, n + 1);\n\n if (elasticNet)\n sqNormNewX += lambda2;\n\n arma::vec matUtriCholFactork = solve(trimatl(trans(matUtriCholFactor)),\n newGramCol);\n\n matNewR(arma::span(0, n - 1), arma::span(0, n - 1)) = matUtriCholFactor;\n matNewR(arma::span(0, n - 1), n) = matUtriCholFactork;\n matNewR(n, arma::span(0, n - 1)).fill(0.0);\n matNewR(n, n) = sqrt(sqNormNewX - dot(matUtriCholFactork,\n matUtriCholFactork));\n\n matUtriCholFactor = matNewR;\n }\n}\n\nvoid LARS::GivensRotate(const arma::vec::fixed<2>& x,\n arma::vec::fixed<2>& rotatedX,\n arma::mat& matG)\n{\n if (x(1) == 0)\n {\n matG = arma::eye(2, 2);\n rotatedX = x;\n }\n else\n {\n double r = norm(x, 2);\n matG = arma::mat(2, 2);\n\n double scaledX1 = x(0) \/ r;\n double scaledX2 = x(1) \/ r;\n\n matG(0, 0) = scaledX1;\n matG(1, 0) = -scaledX2;\n matG(0, 1) = scaledX2;\n matG(1, 1) = scaledX1;\n\n rotatedX = arma::vec(2);\n rotatedX(0) = r;\n rotatedX(1) = 0;\n }\n}\n\nvoid LARS::CholeskyDelete(const size_t colToKill)\n{\n size_t n = matUtriCholFactor.n_rows;\n\n if (colToKill == (n - 1))\n {\n matUtriCholFactor = matUtriCholFactor(arma::span(0, n - 2),\n arma::span(0, n - 2));\n }\n else\n {\n matUtriCholFactor.shed_col(colToKill); \/\/ remove column colToKill\n n--;\n\n for (size_t k = colToKill; k < n; k++)\n {\n arma::mat matG;\n arma::vec::fixed<2> rotatedVec;\n GivensRotate(matUtriCholFactor(arma::span(k, k + 1), k), rotatedVec,\n matG);\n matUtriCholFactor(arma::span(k, k + 1), k) = rotatedVec;\n if (k < n - 1)\n {\n matUtriCholFactor(arma::span(k, k + 1), arma::span(k + 1, n - 1)) =\n matG * matUtriCholFactor(arma::span(k, k + 1),\n arma::span(k + 1, n - 1));\n }\n }\n\n matUtriCholFactor.shed_row(n);\n }\n}\nStop timer for early exit.\/**\n * @file lars.cpp\n * @author Nishant Mehta (niche)\n *\n * Implementation of LARS and LASSO.\n *\/\n#include \"lars.hpp\"\n\nusing namespace mlpack;\nusing namespace mlpack::regression;\n\nLARS::LARS(const bool useCholesky,\n const double lambda1,\n const double lambda2,\n const double tolerance) :\n matGram(matGramInternal),\n useCholesky(useCholesky),\n lasso((lambda1 != 0)),\n lambda1(lambda1),\n elasticNet((lambda1 != 0) && (lambda2 != 0)),\n lambda2(lambda2),\n tolerance(tolerance)\n{ \/* Nothing left to do. *\/ }\n\nLARS::LARS(const bool useCholesky,\n const arma::mat& gramMatrix,\n const double lambda1,\n const double lambda2,\n const double tolerance) :\n matGram(gramMatrix),\n useCholesky(useCholesky),\n lasso((lambda1 != 0)),\n lambda1(lambda1),\n elasticNet((lambda1 != 0) && (lambda2 != 0)),\n lambda2(lambda2),\n tolerance(tolerance)\n{ \/* Nothing left to do *\/ }\n\nvoid LARS::Regress(const arma::mat& matX,\n const arma::vec& y,\n arma::vec& beta,\n const bool rowMajor)\n{\n Timer::Start(\"lars_regression\");\n\n \/\/ This matrix may end up holding the transpose -- if necessary.\n arma::mat dataTrans;\n \/\/ dataRef is row-major.\n const arma::mat& dataRef = (rowMajor ? matX : dataTrans);\n if (!rowMajor)\n dataTrans = trans(matX);\n\n \/\/ Compute X' * y.\n arma::vec vecXTy = trans(dataRef) * y;\n\n \/\/ Set up active set variables. In the beginning, the active set has size 0\n \/\/ (all dimensions are inactive).\n isActive.resize(dataRef.n_cols, false);\n\n \/\/ Initialize yHat and beta.\n beta = arma::zeros(dataRef.n_cols);\n arma::vec yHat = arma::zeros(dataRef.n_rows);\n arma::vec yHatDirection = arma::vec(dataRef.n_rows);\n\n bool lassocond = false;\n\n \/\/ Compute the initial maximum correlation among all dimensions.\n arma::vec corr = vecXTy;\n double maxCorr = 0;\n size_t changeInd = 0;\n for (size_t i = 0; i < vecXTy.n_elem; ++i)\n {\n if (fabs(corr(i)) > maxCorr)\n {\n maxCorr = fabs(corr(i));\n changeInd = i;\n }\n }\n\n betaPath.push_back(beta);\n lambdaPath.push_back(maxCorr);\n\n \/\/ If the maximum correlation is too small, there is no reason to continue.\n if (maxCorr < lambda1)\n {\n lambdaPath[0] = lambda1;\n Timer::Stop(\"lars_regression\");\n return;\n }\n\n \/\/ Compute the Gram matrix. If this is the elastic net problem, we will add\n \/\/ lambda2 * I_n to the matrix.\n if (matGram.n_elem == 0)\n {\n \/\/ In this case, matGram should reference matGramInternal.\n matGramInternal = trans(dataRef) * dataRef;\n\n if (elasticNet && !useCholesky)\n matGramInternal += lambda2 * arma::eye(dataRef.n_cols, dataRef.n_cols);\n }\n\n \/\/ Main loop.\n while ((activeSet.size() < dataRef.n_cols) && (maxCorr > tolerance))\n {\n \/\/ Compute the maximum correlation among inactive dimensions.\n maxCorr = 0;\n for (size_t i = 0; i < dataRef.n_cols; i++)\n {\n if ((!isActive[i]) && (fabs(corr(i)) > maxCorr))\n {\n maxCorr = fabs(corr(i));\n changeInd = i;\n }\n }\n\n if (!lassocond)\n {\n if (useCholesky)\n {\n \/\/ vec newGramCol = vec(activeSet.size());\n \/\/ for (size_t i = 0; i < activeSet.size(); i++)\n \/\/ {\n \/\/ newGramCol[i] = dot(matX.col(activeSet[i]), matX.col(changeInd));\n \/\/ }\n \/\/ This is equivalent to the above 5 lines.\n arma::vec newGramCol = matGram.elem(changeInd * dataRef.n_cols +\n arma::conv_to::from(activeSet));\n\n CholeskyInsert(matGram(changeInd, changeInd), newGramCol);\n }\n\n \/\/ Add variable to active set.\n Activate(changeInd);\n }\n\n \/\/ Compute signs of correlations.\n arma::vec s = arma::vec(activeSet.size());\n for (size_t i = 0; i < activeSet.size(); i++)\n s(i) = corr(activeSet[i]) \/ fabs(corr(activeSet[i]));\n\n \/\/ Compute the \"equiangular\" direction in parameter space (betaDirection).\n \/\/ We use quotes because in the case of non-unit norm variables, this need\n \/\/ not be equiangular.\n arma::vec unnormalizedBetaDirection;\n double normalization;\n arma::vec betaDirection;\n if (useCholesky)\n {\n \/**\n * Note that:\n * R^T R % S^T % S = (R % S)^T (R % S)\n * Now, for 1 the ones vector:\n * inv( (R % S)^T (R % S) ) 1\n * = inv(R % S) inv((R % S)^T) 1\n * = inv(R % S) Solve((R % S)^T, 1)\n * = inv(R % S) Solve(R^T, s)\n * = Solve(R % S, Solve(R^T, s)\n * = s % Solve(R, Solve(R^T, s))\n *\/\n unnormalizedBetaDirection = solve(trimatu(matUtriCholFactor),\n solve(trimatl(trans(matUtriCholFactor)), s));\n\n normalization = 1.0 \/ sqrt(dot(s, unnormalizedBetaDirection));\n betaDirection = normalization * unnormalizedBetaDirection;\n }\n else\n {\n arma::mat matGramActive = arma::mat(activeSet.size(), activeSet.size());\n for (size_t i = 0; i < activeSet.size(); i++)\n for (size_t j = 0; j < activeSet.size(); j++)\n matGramActive(i, j) = matGram(activeSet[i], activeSet[j]);\n\n arma::mat matS = s * arma::ones(1, activeSet.size());\n unnormalizedBetaDirection = solve(matGramActive % trans(matS) % matS,\n arma::ones(activeSet.size(), 1));\n normalization = 1.0 \/ sqrt(sum(unnormalizedBetaDirection));\n betaDirection = normalization * unnormalizedBetaDirection % s;\n }\n\n \/\/ compute \"equiangular\" direction in output space\n ComputeYHatDirection(dataRef, betaDirection, yHatDirection);\n\n double gamma = maxCorr \/ normalization;\n\n \/\/ If not all variables are active.\n if (activeSet.size() < dataRef.n_cols)\n {\n \/\/ Compute correlations with direction.\n for (size_t ind = 0; ind < dataRef.n_cols; ind++)\n {\n if (isActive[ind])\n continue;\n\n double dirCorr = dot(dataRef.col(ind), yHatDirection);\n double val1 = (maxCorr - corr(ind)) \/ (normalization - dirCorr);\n double val2 = (maxCorr + corr(ind)) \/ (normalization + dirCorr);\n if ((val1 > 0) && (val1 < gamma))\n gamma = val1;\n if ((val2 > 0) && (val2 < gamma))\n gamma = val2;\n }\n }\n\n \/\/ Bound gamma according to LASSO.\n if (lasso)\n {\n lassocond = false;\n double lassoboundOnGamma = DBL_MAX;\n size_t activeIndToKickOut = -1;\n\n for (size_t i = 0; i < activeSet.size(); i++)\n {\n double val = -beta(activeSet[i]) \/ betaDirection(i);\n if ((val > 0) && (val < lassoboundOnGamma))\n {\n lassoboundOnGamma = val;\n activeIndToKickOut = i;\n }\n }\n\n if (lassoboundOnGamma < gamma)\n {\n gamma = lassoboundOnGamma;\n lassocond = true;\n changeInd = activeIndToKickOut;\n }\n }\n\n \/\/ Update the prediction.\n yHat += gamma * yHatDirection;\n\n \/\/ Update the estimator.\n for (size_t i = 0; i < activeSet.size(); i++)\n {\n beta(activeSet[i]) += gamma * betaDirection(i);\n }\n\n \/\/ Sanity check to make sure the kicked out dimension is actually zero.\n if (lassocond)\n {\n if (beta(activeSet[changeInd]) != 0)\n beta(activeSet[changeInd]) = 0;\n }\n\n betaPath.push_back(beta);\n\n if (lassocond)\n {\n \/\/ Index is in position changeInd in activeSet.\n if (useCholesky)\n CholeskyDelete(changeInd);\n\n Deactivate(changeInd);\n }\n\n corr = vecXTy - trans(dataRef) * yHat;\n if (elasticNet)\n corr -= lambda2 * beta;\n\n double curLambda = 0;\n for (size_t i = 0; i < activeSet.size(); i++)\n curLambda += fabs(corr(activeSet[i]));\n\n curLambda \/= ((double) activeSet.size());\n\n lambdaPath.push_back(curLambda);\n\n \/\/ Time to stop for LASSO?\n if (lasso)\n {\n if (curLambda <= lambda1)\n {\n InterpolateBeta();\n break;\n }\n }\n }\n\n \/\/ Unfortunate copy...\n beta = betaPath.back();\n\n Timer::Stop(\"lars_regression\");\n}\n\n\/\/ Private functions.\nvoid LARS::Deactivate(const size_t activeVarInd)\n{\n isActive[activeSet[activeVarInd]] = false;\n activeSet.erase(activeSet.begin() + activeVarInd);\n}\n\nvoid LARS::Activate(const size_t varInd)\n{\n isActive[varInd] = true;\n activeSet.push_back(varInd);\n}\n\nvoid LARS::ComputeYHatDirection(const arma::mat& matX,\n const arma::vec& betaDirection,\n arma::vec& yHatDirection)\n{\n yHatDirection.fill(0);\n for (size_t i = 0; i < activeSet.size(); i++)\n yHatDirection += betaDirection(i) * matX.col(activeSet[i]);\n}\n\nvoid LARS::InterpolateBeta()\n{\n int pathLength = betaPath.size();\n\n \/\/ interpolate beta and stop\n double ultimateLambda = lambdaPath[pathLength - 1];\n double penultimateLambda = lambdaPath[pathLength - 2];\n double interp = (penultimateLambda - lambda1)\n \/ (penultimateLambda - ultimateLambda);\n\n betaPath[pathLength - 1] = (1 - interp) * (betaPath[pathLength - 2])\n + interp * betaPath[pathLength - 1];\n\n lambdaPath[pathLength - 1] = lambda1;\n}\n\nvoid LARS::CholeskyInsert(const arma::vec& newX, const arma::mat& X)\n{\n if (matUtriCholFactor.n_rows == 0)\n {\n matUtriCholFactor = arma::mat(1, 1);\n\n if (elasticNet)\n matUtriCholFactor(0, 0) = sqrt(dot(newX, newX) + lambda2);\n else\n matUtriCholFactor(0, 0) = norm(newX, 2);\n }\n else\n {\n arma::vec newGramCol = trans(X) * newX;\n CholeskyInsert(dot(newX, newX), newGramCol);\n }\n}\n\nvoid LARS::CholeskyInsert(double sqNormNewX, const arma::vec& newGramCol)\n{\n int n = matUtriCholFactor.n_rows;\n\n if (n == 0)\n {\n matUtriCholFactor = arma::mat(1, 1);\n\n if (elasticNet)\n matUtriCholFactor(0, 0) = sqrt(sqNormNewX + lambda2);\n else\n matUtriCholFactor(0, 0) = sqrt(sqNormNewX);\n }\n else\n {\n arma::mat matNewR = arma::mat(n + 1, n + 1);\n\n if (elasticNet)\n sqNormNewX += lambda2;\n\n arma::vec matUtriCholFactork = solve(trimatl(trans(matUtriCholFactor)),\n newGramCol);\n\n matNewR(arma::span(0, n - 1), arma::span(0, n - 1)) = matUtriCholFactor;\n matNewR(arma::span(0, n - 1), n) = matUtriCholFactork;\n matNewR(n, arma::span(0, n - 1)).fill(0.0);\n matNewR(n, n) = sqrt(sqNormNewX - dot(matUtriCholFactork,\n matUtriCholFactork));\n\n matUtriCholFactor = matNewR;\n }\n}\n\nvoid LARS::GivensRotate(const arma::vec::fixed<2>& x,\n arma::vec::fixed<2>& rotatedX,\n arma::mat& matG)\n{\n if (x(1) == 0)\n {\n matG = arma::eye(2, 2);\n rotatedX = x;\n }\n else\n {\n double r = norm(x, 2);\n matG = arma::mat(2, 2);\n\n double scaledX1 = x(0) \/ r;\n double scaledX2 = x(1) \/ r;\n\n matG(0, 0) = scaledX1;\n matG(1, 0) = -scaledX2;\n matG(0, 1) = scaledX2;\n matG(1, 1) = scaledX1;\n\n rotatedX = arma::vec(2);\n rotatedX(0) = r;\n rotatedX(1) = 0;\n }\n}\n\nvoid LARS::CholeskyDelete(const size_t colToKill)\n{\n size_t n = matUtriCholFactor.n_rows;\n\n if (colToKill == (n - 1))\n {\n matUtriCholFactor = matUtriCholFactor(arma::span(0, n - 2),\n arma::span(0, n - 2));\n }\n else\n {\n matUtriCholFactor.shed_col(colToKill); \/\/ remove column colToKill\n n--;\n\n for (size_t k = colToKill; k < n; k++)\n {\n arma::mat matG;\n arma::vec::fixed<2> rotatedVec;\n GivensRotate(matUtriCholFactor(arma::span(k, k + 1), k), rotatedVec,\n matG);\n matUtriCholFactor(arma::span(k, k + 1), k) = rotatedVec;\n if (k < n - 1)\n {\n matUtriCholFactor(arma::span(k, k + 1), arma::span(k + 1, n - 1)) =\n matG * matUtriCholFactor(arma::span(k, k + 1),\n arma::span(k + 1, n - 1));\n }\n }\n\n matUtriCholFactor.shed_row(n);\n }\n}\n<|endoftext|>"} {"text":"#include \"common.th\"\n#include \"serial.th\"\n\n#define CHANNEL \"#tenyr\"\n#define NICK \"rynet\"\n\n#define do(X) c <- rel(X) ; call(puts) ; c <- rel(rn) ; call(puts)\n\n_start:\n prologue\n\n#if 0\n c <- 2\n call(sleep)\n#endif\n\n do(nick)\n do(user)\n do(join)\n\nloop_line:\n call(getline)\n c <- b\n push(c)\n d <- 1\n call(skipwords)\n\n c <- b\n d <- rel(privmsg)\n e <- 7\n call(strncmp)\n pop(c)\n jnzrel(b,loop_line)\n d <- 3\n call(skipwords)\n\n c <- b + 1\n call(check_input)\n\n goto(loop_line)\n\n illegal\n\ncheck_input:\n push(c)\n d <- rel(trigger)\n e <- 3 \/\/ strlen(trigger)\n call(strncmp)\n pop(c)\n jzrel(b,triggered)\n ret\n\ntriggered:\n push(c)\n c <- c + 3\n call(parse_int)\n c <- b\n call(say_int)\n pop(c)\n ret\n\n ret\n\nparse_int:\n b <- -40\n ret\n\nsay_int:\n c <- rel(minus_forty)\n call(say)\n ret\n\nminus_forty: .utf32 \"-40C\" ; .word 0\n\nsay:\n push(c)\n c <- rel(talk)\n call(puts)\n pop(c)\n call(puts)\n c <- rel(rn)\n call(puts)\n ret\n\nskipwords:\nskipwords_top:\n g <- [c]\n e <- g == 0\n jnzrel(e,skipwords_done)\n e <- g == ' '\n c <- c + 1\n jnzrel(e,skipwords_foundspace)\n goto(skipwords_top)\n\nskipwords_foundspace:\n d <- d - 1\n e <- d < 1\n jzrel(e,skipwords_top)\n\nskipwords_done:\n b <- c\n ret\n\n\/\/ :usermask PRIVMSG #channel :message\ngetline:\n g <- rel(buffer)\n f <- g\n\ngetline_top:\n getch(b)\n c <- b == '\\r'\n d <- b == '\\n'\n c <- c | d\n jnzrel(c,getline_eol)\n b -> [f]\n f <- f + 1\n goto(getline_top)\n\ngetline_eol:\n a -> [f]\n b <- g\n ret\n\nsleep:\n c <- c * 2047\n c <- c * 2047\nsleep_loop:\n c <- c - 1\n d <- c == 0\n jnzrel(d,sleep_done)\n goto(sleep_loop)\nsleep_done:\n ret\n\n\/\/ ----------------------------------------------------------------------------\n\nbuffer: \/\/ 512 chars\n .utf32 \"----------------------------------------------------------------\"\n .utf32 \"----------------------------------------------------------------\"\n .utf32 \"----------------------------------------------------------------\"\n .utf32 \"----------------------------------------------------------------\"\n .utf32 \"----------------------------------------------------------------\"\n .utf32 \"----------------------------------------------------------------\"\n .utf32 \"----------------------------------------------------------------\"\n .utf32 \"----------------------------------------------------------------\"\n\nnick: .utf32 \"NICK \" NICK ; .word 0\nuser: .utf32 \"USER \" NICK \" 0 * :get your own bot\" ; .word 0\njoin: .utf32 \"JOIN \" CHANNEL ; .word 0\ntalk: .utf32 \"PRIVMSG \" CHANNEL \" :\" ; .word 0\n\nprivmsg: .utf32 \"PRIVMSG\" ; .word 0\ntrigger: .utf32 \"!f \" ; .word 0\n\nrn: .word '\\r', '\\n', 0\n\nPreliminary positive integer parsing#include \"common.th\"\n#include \"serial.th\"\n\n#define CHANNEL \"#tenyr\"\n#define NICK \"rynet\"\n\n#define do(X) c <- rel(X) ; call(puts) ; c <- rel(rn) ; call(puts)\n\n_start:\n prologue\n\n#if 0\n c <- 2\n call(sleep)\n#endif\n\n do(nick)\n do(user)\n do(join)\n\nloop_line:\n call(getline)\n c <- b\n push(c)\n d <- 1\n call(skipwords)\n\n c <- b\n d <- rel(privmsg)\n e <- 7\n call(strncmp)\n pop(c)\n jnzrel(b,loop_line)\n d <- 3\n call(skipwords)\n\n c <- b + 1\n call(check_input)\n\n goto(loop_line)\n\n illegal\n\ncheck_input:\n push(c)\n d <- rel(trigger)\n e <- 3 \/\/ strlen(trigger)\n call(strncmp)\n pop(c)\n jzrel(b,triggered)\n ret\n\ntriggered:\n push(c)\n c <- c + 3\n call(parse_int)\n c <- b * 2 \/\/ XXX\n call(say_int)\n pop(c)\n ret\n\n ret\n\n\/\/ c <- address of first character of number\nparse_int:\n b <- 0\nparse_int_top:\n d <- [c]\n c <- c + 1\n d <- d - '0'\n e <- d > 9\n jnzrel(e,parse_int_done)\n e <- d < 0\n jnzrel(e,parse_int_done)\n b <- b * 10 + d\n goto(parse_int_top)\nparse_int_done:\n ret\n\nsay_int:\n c <- rel(minus_forty)\n call(say)\n ret\n\nminus_forty: .utf32 \"-40C\" ; .word 0\n\nsay:\n push(c)\n c <- rel(talk)\n call(puts)\n pop(c)\n call(puts)\n c <- rel(rn)\n call(puts)\n ret\n\nskipwords:\nskipwords_top:\n g <- [c]\n e <- g == 0\n jnzrel(e,skipwords_done)\n e <- g == ' '\n c <- c + 1\n jnzrel(e,skipwords_foundspace)\n goto(skipwords_top)\n\nskipwords_foundspace:\n d <- d - 1\n e <- d < 1\n jzrel(e,skipwords_top)\n\nskipwords_done:\n b <- c\n ret\n\n\/\/ :usermask PRIVMSG #channel :message\ngetline:\n g <- rel(buffer)\n f <- g\n\ngetline_top:\n getch(b)\n c <- b == '\\r'\n d <- b == '\\n'\n c <- c | d\n jnzrel(c,getline_eol)\n b -> [f]\n f <- f + 1\n goto(getline_top)\n\ngetline_eol:\n a -> [f]\n b <- g\n ret\n\nsleep:\n c <- c * 2047\n c <- c * 2047\nsleep_loop:\n c <- c - 1\n d <- c == 0\n jnzrel(d,sleep_done)\n goto(sleep_loop)\nsleep_done:\n ret\n\n\/\/ ----------------------------------------------------------------------------\n\nbuffer: \/\/ 512 chars\n .utf32 \"----------------------------------------------------------------\"\n .utf32 \"----------------------------------------------------------------\"\n .utf32 \"----------------------------------------------------------------\"\n .utf32 \"----------------------------------------------------------------\"\n .utf32 \"----------------------------------------------------------------\"\n .utf32 \"----------------------------------------------------------------\"\n .utf32 \"----------------------------------------------------------------\"\n .utf32 \"----------------------------------------------------------------\"\n\nnick: .utf32 \"NICK \" NICK ; .word 0\nuser: .utf32 \"USER \" NICK \" 0 * :get your own bot\" ; .word 0\njoin: .utf32 \"JOIN \" CHANNEL ; .word 0\ntalk: .utf32 \"PRIVMSG \" CHANNEL \" :\" ; .word 0\n\nprivmsg: .utf32 \"PRIVMSG\" ; .word 0\ntrigger: .utf32 \"!f \" ; .word 0\n\nrn: .word '\\r', '\\n', 0\n\n<|endoftext|>"} {"text":"\/*\n*\n* Title: CurlDump\n* Authors: Eyaz Rehman [http:\/\/github.com\/Imposter]\n* Date: 2\/18\/2016\n*\n* Copyright (C) 2016 Eyaz Rehman. All Rights Reserved.\n*\n*\/\n\n#include \"Configuration\/All.h\"\n#include \"Utilities\/Indigo\/utility\/hook.hpp\"\n#include \"Utilities\/Indigo\/utility\/acp_dump.hpp\"\n#include \"Utilities\/Indigo\/utility\/config.hpp\"\n#include \"Curl.h\"\n\n#ifdef _DEBUG\n#include \"Utilities\/Indigo\/utility\/console.hpp\"\n#endif\n\n#include \n#include \n#include \n#include \n#include \n#include \n#define _WINSOCK_DEPRECATED_NO_WARNINGS\n#include \n\n#pragma comment(lib, \"ws2_32.lib\")\n\ntypedef size_t (*__cdecl CurlIOCallback)(char *data, size_t size, size_t bytes, void *userdata);\n\nstruct CurlInstance {\n\tvoid *Handle;\n\tvoid *WriteData;\n\tvoid *ReadData;\n\tCurlIOCallback WriteCallback;\n\tCurlIOCallback ReadCallback;\n};\n\nindigo::ACPDump acp_dump_;\nstd::map redirect_set_;\nstd::mutex redirect_mutex_;\nindigo::CallHook curl_setopt_hook_;\nindigo::CallHook curl_close_hook_;\n\nsize_t curl_write_callback(char *data, size_t size, size_t bytes, CurlInstance *instance) {\n\t\/\/ actual size == size * bytes\n\tprintf(\"CurlDump: (0x%08p) Writing %d bytes\\n\", instance->Handle, size * bytes);\n\tacp_dump_.Write(SOCK_STREAM, IPPROTO_TCP, static_cast(inet_addr(\"127.0.0.1\")),\n\t\treinterpret_cast(instance->Handle), reinterpret_cast(instance->Handle), 1337, data, size * bytes);\n\n\treturn instance->WriteCallback != nullptr ? instance->WriteCallback(data, size, bytes, instance->WriteData) : 0;\n}\n\nsize_t curl_read_callback(char *data, size_t size, size_t bytes, CurlInstance *instance) {\n\t\/\/ actual size == size * bytes\n\tprintf(\"CurlDump: (0x%08p) Reading %d bytes\\n\", instance->Handle, size * bytes);\n\tacp_dump_.Write(SOCK_STREAM, IPPROTO_TCP, reinterpret_cast(instance->Handle), 1337,\n\t\tstatic_cast(inet_addr(\"127.0.0.1\")), reinterpret_cast(instance->Handle), data, size * bytes);\n\n\treturn instance->ReadCallback != nullptr ? instance->ReadCallback(data, size, bytes, instance->ReadData) : 0;\n}\n\n\/\/ int __cdecl Curl_setopt(void *handle, signed int option, va_list param)\nint __cdecl curl_setopt_(void *handle, signed int option, va_list param) {\n\tprintf(\"CurlDump: Curl_setopt(0x%08p, %d, 0x%08p)\\n\", handle, option, param);\n\n\t\/\/ Curl instance\n\tCurlInstance *instance;\n\n\t\/\/ Get the original\n\tauto curl_setopt = curl_setopt_hook_.Get();\n\n\tredirect_mutex_.lock();\n\tif (redirect_set_.find(handle) == redirect_set_.end()) {\n\t\t\/\/ Initialize\n\t\tprintf(\"CurlDump: Monitoring easy handle 0x%08p\\n\", handle);\n\n\t\t\/\/ Create curl instance\n\t\tinstance = new CurlInstance{ nullptr };\n\t\tinstance->Handle = handle;\n\n\t\tif (option == CURLOPT_WRITEDATA) {\n\t\t\tinstance->WriteData = va_arg(param, void *);\n\t\t} else if (option == CURLOPT_READDATA) {\n\t\t\tinstance->ReadData = va_arg(param, void *);\n\t\t} else if (option == CURLOPT_WRITEFUNCTION) {\n\t\t\tinstance->WriteCallback = va_arg(param, CurlIOCallback);\n\t\t} else if (option == CURLOPT_READFUNCTION) {\n\t\t\tinstance->ReadCallback = va_arg(param, CurlIOCallback);\n\t\t}\n\n\t\tauto setopt = [=](CURLoption opt, ...) {\n\t\t\tprintf(\"CurlDump: Setting option %d for easy handle 0x%08p\\n\", opt, handle);\n\n\t\t\tva_list va;\n\t\t\tva_start(va, opt);\n\n\t\t\tcurl_setopt(handle, opt, va);\n\n\t\t\tva_end(va);\n\t\t};\n\n\t\tsetopt(CURLOPT_VERBOSE, 1);\n\t\tsetopt(CURLOPT_WRITEDATA, instance);\n\t\tsetopt(CURLOPT_READDATA, instance);\n\t\tsetopt(CURLOPT_WRITEFUNCTION, &curl_write_callback);\n\t\tsetopt(CURLOPT_READFUNCTION, &curl_read_callback);\n\n\t\tredirect_set_[handle] = instance;\n\t}\n\n\tredirect_mutex_.unlock();\n\n\tinstance = redirect_set_[handle];\n\tif (option == CURLOPT_WRITEDATA) {\n\t\tinstance->WriteData = va_arg(param, void *);\n\t\treturn 0;\n\t} \n\tif (option == CURLOPT_READDATA) {\n\t\tinstance->ReadData = va_arg(param, void *);\n\t\treturn 0;\n\t} \n\tif (option == CURLOPT_WRITEFUNCTION) {\n\t\tinstance->WriteCallback = va_arg(param, CurlIOCallback);\n\t\treturn 0;\n\t} \n\tif (option == CURLOPT_READFUNCTION) {\n\t\tinstance->ReadCallback = va_arg(param, CurlIOCallback);\n\t\treturn 0;\n\t}\n\n\treturn curl_setopt(handle, option, param);\n}\n\n\/\/ int __cdecl Curl_close(void *handle)\nint __cdecl curl_close_(void *handle) {\n\tredirect_mutex_.lock();\n\tfor (auto it = redirect_set_.begin(); it != redirect_set_.end();) {\n\t\tif (it->first == handle) {\n\t\t\tdelete it->second;\n\t\t\tit = redirect_set_.erase(it);\n\t\t} else {\n\t\t\t++it;\n\t\t}\n\t}\n\tredirect_mutex_.unlock();\n\n\treturn curl_close_hook_.Get()(handle);\n}\n\nextern \"C\" {\n\tEXPORT_ATTR void __cdecl onExtensionUnloading(void) {\n\t\t\/\/ Remove curl instances\n\t\tredirect_mutex_.lock();\n\t\tfor (auto it = redirect_set_.begin(); it != redirect_set_.end();) {\n\t\t\tdelete it->second;\n\t\t\tit = redirect_set_.erase(it);\n\t\t}\n\t\tredirect_mutex_.unlock();\n\n\t\t\/\/ Close dump\n\t\tacp_dump_.Close();\n\n#ifdef _DEBUG\n\t\tindigo::Console::Hide();\n#endif\n\t}\n\n\tEXPORT_ATTR void __cdecl onInitializationStart(void) {\n#ifdef _DEBUG\n\t\tindigo::Console::Show(\"Ayria Console\");\n\n\t\tMessageBoxA(nullptr, \"Attach debugger now!\", \"CurlDump - Debug\", MB_OK);\n#endif\n\n\t\t\/\/ Open the config file\n\t\tstd::ifstream config_file;\n\t\tconfig_file.open(\"curldump.ini\");\n\t\tif (!config_file.is_open()) {\n\t\t\tprintf(\"CurlDump: Failed to open curldump.ini\\n\");\n\t\t\treturn;\n\t\t}\n\n\t\tconfig_file.seekg(0, std::ios::end);\n\t\tsize_t config_size = config_file.tellg();\n\t\tconfig_file.seekg(0, std::ios::beg);\n\n\t\tstd::string config_buffer;\n\t\tconfig_buffer.resize(config_size);\n\t\tconfig_file.read(const_cast(config_buffer.c_str()), config_size);\n\n\t\tindigo::Config config;\n\t\tif (!config.Open(config_buffer)) {\n\t\t\tprintf(\"CurlDump: Failed to read curldump.ini\\n\");\n\t\t\treturn;\n\t\t}\n\n\t\t\/\/ Get addresses for Curl_setopt and Curl_close\n\t\tstd::string setopt = config.GetString(\"CURL\", \"SetOpt\");\n\t\tstd::string close = config.GetString(\"CURL\", \"Close\");\n\t\tint32_t delay = config.GetInteger(\"CURL\", \"HookDelay\", 1);\n\n\t\tif (setopt.empty()) {\n\t\t\tprintf(\"CurlDump: Invalid Curl_setopt pattern\\n\");\n\t\t\treturn;\n\t\t}\n\n\t\tif (close.empty()) {\n\t\t\tprintf(\"CurlDump: Invalid Curl_close pattern\\n\");\n\t\t\treturn;\n\t\t}\n\n\t\t\/\/ Install hooks\n\t\tstd::thread([=]() {\n\t\t\tstd::this_thread::sleep_for(std::chrono::milliseconds(delay));\n\n\t\t\twhile (true) {\n\t\t\t\tstd::this_thread::sleep_for(std::chrono::milliseconds(10));\n\n\t\t\t\tif (!curl_setopt_hook_.Install(indigo::Memory::Find(setopt.c_str()).Get(0).Get(), &curl_setopt_)) {\n\t\t\t\t\tprintf(\"CurlDump: Failed to install Curl_setopt hook\\n\");\n\t\t\t\t\tcontinue;\n\t\t\t\t}\n\n\t\t\t\tif (!curl_close_hook_.Install(indigo::Memory::Find(close.c_str()).Get(0).Get(), &curl_close_)) {\n\t\t\t\t\tprintf(\"CurlDump: Failed to install Curl_close hook\\n\");\n\t\t\t\t\tcontinue;\n\t\t\t\t}\n\n\t\t\t\t\/\/ Open dump\n\t\t\t\tstd::string file_name = indigo::String::Format(\"curldump_%i.acp\", time(nullptr));\n\t\t\t\tif (!acp_dump_.Open(file_name)) {\n\t\t\t\t\tprintf(\"CurlDump: Failed to open %s\\n\", file_name.c_str());\n\t\t\t\t\treturn;\n\t\t\t\t}\n\n\t\t\t\tbreak;\n\t\t\t}\n\n\t\t\tprintf(\"CurlDump: We're ready to go!\\n\");\n\t\t}).detach();\n\t}\n\n\tEXPORT_ATTR void __cdecl onInitializationComplete(void) {\n\t}\n\n\tEXPORT_ATTR void __cdecl onMessage(uint32_t message, ...) {\n\t\tva_list variadic;\n\t\tva_start(variadic, message);\n\n\t\t\/\/ Messages are a 32bit FNV1a hash of a string\n\t\tswitch (message)\n\t\t{\n\n\t\tcase FNV1a_Compiletime_32(\"DefaultCase\"):\n\t\tdefault:\n\t\t\tbreak;\n\t\t}\n\n\t\tva_end(variadic);\n\t}\n}\n\nBOOLEAN WINAPI DllMain(HINSTANCE instance, DWORD reason, LPVOID reserved) {\n\tif (reason == DLL_PROCESS_ATTACH) {\n\t\tDisableThreadLibraryCalls(instance);\n\t\tDeleteLogfile();\n\t}\n\n\treturn TRUE;\n}Removed unnecessary code.\/*\n*\n* Title: CurlDump\n* Authors: Eyaz Rehman [http:\/\/github.com\/Imposter]\n* Date: 2\/18\/2016\n*\n* Copyright (C) 2016 Eyaz Rehman. All Rights Reserved.\n*\n*\/\n\n#include \"Configuration\/All.h\"\n#include \"Utilities\/Indigo\/utility\/hook.hpp\"\n#include \"Utilities\/Indigo\/utility\/acp_dump.hpp\"\n#include \"Utilities\/Indigo\/utility\/config.hpp\"\n#include \"Curl.h\"\n\n#ifdef _DEBUG\n#include \"Utilities\/Indigo\/utility\/console.hpp\"\n#endif\n\n#include \n#include \n#include \n#include \n#include \n#include \n#define _WINSOCK_DEPRECATED_NO_WARNINGS\n#include \n\n#pragma comment(lib, \"ws2_32.lib\")\n\ntypedef size_t (*__cdecl CurlIOCallback)(char *data, size_t size, size_t bytes, void *userdata);\n\nstruct CurlInstance {\n\tvoid *Handle;\n\tvoid *WriteData;\n\tvoid *ReadData;\n\tCurlIOCallback WriteCallback;\n\tCurlIOCallback ReadCallback;\n};\n\nindigo::ACPDump acp_dump_;\nstd::map redirect_set_;\nstd::mutex redirect_mutex_;\nindigo::CallHook curl_setopt_hook_;\nindigo::CallHook curl_close_hook_;\n\nsize_t curl_write_callback(char *data, size_t size, size_t bytes, CurlInstance *instance) {\n\t\/\/ actual size == size * bytes\n\tprintf(\"CurlDump: (0x%08p) Writing %d bytes\\n\", instance->Handle, size * bytes);\n\tacp_dump_.Write(SOCK_STREAM, IPPROTO_TCP, static_cast(inet_addr(\"127.0.0.1\")),\n\t\treinterpret_cast(instance->Handle), reinterpret_cast(instance->Handle), 1337, data, size * bytes);\n\n\treturn instance->WriteCallback != nullptr ? instance->WriteCallback(data, size, bytes, instance->WriteData) : 0;\n}\n\nsize_t curl_read_callback(char *data, size_t size, size_t bytes, CurlInstance *instance) {\n\t\/\/ actual size == size * bytes\n\tprintf(\"CurlDump: (0x%08p) Reading %d bytes\\n\", instance->Handle, size * bytes);\n\tacp_dump_.Write(SOCK_STREAM, IPPROTO_TCP, reinterpret_cast(instance->Handle), 1337,\n\t\tstatic_cast(inet_addr(\"127.0.0.1\")), reinterpret_cast(instance->Handle), data, size * bytes);\n\n\treturn instance->ReadCallback != nullptr ? instance->ReadCallback(data, size, bytes, instance->ReadData) : 0;\n}\n\n\/\/ int __cdecl Curl_setopt(void *handle, signed int option, va_list param)\nint __cdecl curl_setopt_(void *handle, signed int option, va_list param) {\n\tprintf(\"CurlDump: Curl_setopt(0x%08p, %d, 0x%08p)\\n\", handle, option, param);\n\n\t\/\/ Curl instance\n\tCurlInstance *instance;\n\n\t\/\/ Get the original\n\tauto curl_setopt = curl_setopt_hook_.Get();\n\n\tredirect_mutex_.lock();\n\tif (redirect_set_.find(handle) == redirect_set_.end()) {\n\t\t\/\/ Initialize\n\t\tprintf(\"CurlDump: Monitoring easy handle 0x%08p\\n\", handle);\n\n\t\t\/\/ Create curl instance\n\t\tinstance = new CurlInstance{ nullptr };\n\t\tinstance->Handle = handle;\n\n\t\tif (option == CURLOPT_WRITEDATA) {\n\t\t\tinstance->WriteData = va_arg(param, void *);\n\t\t} else if (option == CURLOPT_READDATA) {\n\t\t\tinstance->ReadData = va_arg(param, void *);\n\t\t} else if (option == CURLOPT_WRITEFUNCTION) {\n\t\t\tinstance->WriteCallback = va_arg(param, CurlIOCallback);\n\t\t} else if (option == CURLOPT_READFUNCTION) {\n\t\t\tinstance->ReadCallback = va_arg(param, CurlIOCallback);\n\t\t}\n\n\t\tauto setopt = [=](CURLoption opt, ...) {\n\t\t\tprintf(\"CurlDump: Setting option %d for easy handle 0x%08p\\n\", opt, handle);\n\n\t\t\tva_list va;\n\t\t\tva_start(va, opt);\n\n\t\t\tcurl_setopt(handle, opt, va);\n\n\t\t\tva_end(va);\n\t\t};\n\n#ifdef _DEBUG\n\t\tsetopt(CURLOPT_VERBOSE, 1);\n#endif\n\t\tsetopt(CURLOPT_WRITEDATA, instance);\n\t\tsetopt(CURLOPT_READDATA, instance);\n\t\tsetopt(CURLOPT_WRITEFUNCTION, &curl_write_callback);\n\t\tsetopt(CURLOPT_READFUNCTION, &curl_read_callback);\n\n\t\tredirect_set_[handle] = instance;\n\t}\n\n\tinstance = redirect_set_[handle];\n\tredirect_mutex_.unlock();\n\tif (option == CURLOPT_WRITEDATA) {\n\t\tinstance->WriteData = va_arg(param, void *);\n\t\treturn 0;\n\t} \n\tif (option == CURLOPT_READDATA) {\n\t\tinstance->ReadData = va_arg(param, void *);\n\t\treturn 0;\n\t} \n\tif (option == CURLOPT_WRITEFUNCTION) {\n\t\tinstance->WriteCallback = va_arg(param, CurlIOCallback);\n\t\treturn 0;\n\t} \n\tif (option == CURLOPT_READFUNCTION) {\n\t\tinstance->ReadCallback = va_arg(param, CurlIOCallback);\n\t\treturn 0;\n\t}\n\n\treturn curl_setopt(handle, option, param);\n}\n\n\/\/ int __cdecl Curl_close(void *handle)\nint __cdecl curl_close_(void *handle) {\n\tredirect_mutex_.lock();\n\tfor (auto it = redirect_set_.begin(); it != redirect_set_.end();) {\n\t\tif (it->first == handle) {\n\t\t\tdelete it->second;\n\t\t\tit = redirect_set_.erase(it);\n\t\t\tbreak;\n\t\t} \n\t\t++it;\n\t}\n\tredirect_mutex_.unlock();\n\n\treturn curl_close_hook_.Get()(handle);\n}\n\nextern \"C\" {\n\tEXPORT_ATTR void __cdecl onExtensionUnloading(void) {\n\t\t\/\/ Remove curl instances\n\t\tredirect_mutex_.lock();\n\t\tfor (auto it = redirect_set_.begin(); it != redirect_set_.end();) {\n\t\t\tdelete it->second;\n\t\t\tit = redirect_set_.erase(it);\n\t\t}\n\t\tredirect_mutex_.unlock();\n\n\t\t\/\/ Close dump\n\t\tacp_dump_.Close();\n\n#ifdef _DEBUG\n\t\tindigo::Console::Hide();\n#endif\n\t}\n\n\tEXPORT_ATTR void __cdecl onInitializationStart(void) {\n#ifdef _DEBUG\n\t\tindigo::Console::Show(\"Ayria Console\");\n\n\t\tMessageBoxA(nullptr, \"Attach debugger now!\", \"CurlDump - Debug\", MB_OK);\n#endif\n\n\t\t\/\/ Open the config file\n\t\tstd::ifstream config_file;\n\t\tconfig_file.open(\"curldump.ini\");\n\t\tif (!config_file.is_open()) {\n\t\t\tprintf(\"CurlDump: Failed to open curldump.ini\\n\");\n\t\t\treturn;\n\t\t}\n\n\t\tconfig_file.seekg(0, std::ios::end);\n\t\tsize_t config_size = config_file.tellg();\n\t\tconfig_file.seekg(0, std::ios::beg);\n\n\t\tstd::string config_buffer;\n\t\tconfig_buffer.resize(config_size);\n\t\tconfig_file.read(const_cast(config_buffer.c_str()), config_size);\n\n\t\tindigo::Config config;\n\t\tif (!config.Open(config_buffer)) {\n\t\t\tprintf(\"CurlDump: Failed to read curldump.ini\\n\");\n\t\t\treturn;\n\t\t}\n\n\t\t\/\/ Get addresses for Curl_setopt and Curl_close\n\t\tstd::string setopt = config.GetString(\"CURL\", \"SetOpt\");\n\t\tstd::string close = config.GetString(\"CURL\", \"Close\");\n\t\tint32_t delay = config.GetInteger(\"CURL\", \"HookDelay\", 1);\n\n\t\tif (setopt.empty()) {\n\t\t\tprintf(\"CurlDump: Invalid Curl_setopt pattern\\n\");\n\t\t\treturn;\n\t\t}\n\n\t\tif (close.empty()) {\n\t\t\tprintf(\"CurlDump: Invalid Curl_close pattern\\n\");\n\t\t\treturn;\n\t\t}\n\n\t\t\/\/ Install hooks\n\t\tstd::thread([=]() {\n\t\t\tstd::this_thread::sleep_for(std::chrono::milliseconds(delay));\n\n\t\t\twhile (true) {\n\t\t\t\tstd::this_thread::sleep_for(std::chrono::milliseconds(10));\n\n\t\t\t\tif (!curl_setopt_hook_.Install(indigo::Memory::Find(setopt.c_str()).Get(0).Get(), &curl_setopt_)) {\n\t\t\t\t\tprintf(\"CurlDump: Failed to install Curl_setopt hook\\n\");\n\t\t\t\t\tcontinue;\n\t\t\t\t}\n\n\t\t\t\tif (!curl_close_hook_.Install(indigo::Memory::Find(close.c_str()).Get(0).Get(), &curl_close_)) {\n\t\t\t\t\tprintf(\"CurlDump: Failed to install Curl_close hook\\n\");\n\t\t\t\t\tcontinue;\n\t\t\t\t}\n\n\t\t\t\t\/\/ Open dump\n\t\t\t\tstd::string file_name = indigo::String::Format(\"curldump_%i.acp\", time(nullptr));\n\t\t\t\tif (!acp_dump_.Open(file_name)) {\n\t\t\t\t\tprintf(\"CurlDump: Failed to open %s\\n\", file_name.c_str());\n\t\t\t\t\treturn;\n\t\t\t\t}\n\n\t\t\t\tbreak;\n\t\t\t}\n\n\t\t\tprintf(\"CurlDump: We're ready to go!\\n\");\n\t\t}).detach();\n\t}\n\n\tEXPORT_ATTR void __cdecl onInitializationComplete(void) {\n\t}\n\n\tEXPORT_ATTR void __cdecl onMessage(uint32_t message, ...) {\n\t}\n}\n\nBOOLEAN WINAPI DllMain(HINSTANCE instance, DWORD reason, LPVOID reserved) {\n\tif (reason == DLL_PROCESS_ATTACH) {\n\t\tDisableThreadLibraryCalls(instance);\n\t\tDeleteLogfile();\n\t}\n\n\treturn TRUE;\n}<|endoftext|>"} {"text":"\/\/ Copyright (c) 2016 The Chromium Authors. All rights reserved.\n\/\/ 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\/third_party\/quiche\/src\/quic\/core\/quic_buffered_packet_store.h\"\n\n#include \n\n#include \"net\/third_party\/quiche\/src\/quic\/platform\/api\/quic_bug_tracker.h\"\n#include \"net\/third_party\/quiche\/src\/quic\/platform\/api\/quic_flags.h\"\n#include \"net\/third_party\/quiche\/src\/quic\/platform\/api\/quic_map_util.h\"\n\nnamespace quic {\n\ntypedef QuicBufferedPacketStore::BufferedPacket BufferedPacket;\ntypedef QuicBufferedPacketStore::BufferedPacketList BufferedPacketList;\ntypedef QuicBufferedPacketStore::EnqueuePacketResult EnqueuePacketResult;\n\n\/\/ Max number of connections this store can keep track.\nstatic const size_t kDefaultMaxConnectionsInStore = 100;\n\/\/ Up to half of the capacity can be used for storing non-CHLO packets.\nstatic const size_t kMaxConnectionsWithoutCHLO =\n kDefaultMaxConnectionsInStore \/ 2;\n\nnamespace {\n\n\/\/ This alarm removes expired entries in map each time this alarm fires.\nclass ConnectionExpireAlarm : public QuicAlarm::Delegate {\n public:\n explicit ConnectionExpireAlarm(QuicBufferedPacketStore* store)\n : connection_store_(store) {}\n\n void OnAlarm() override { connection_store_->OnExpirationTimeout(); }\n\n ConnectionExpireAlarm(const ConnectionExpireAlarm&) = delete;\n ConnectionExpireAlarm& operator=(const ConnectionExpireAlarm&) = delete;\n\n private:\n QuicBufferedPacketStore* connection_store_;\n};\n\n} \/\/ namespace\n\nBufferedPacket::BufferedPacket(std::unique_ptr packet,\n QuicSocketAddress self_address,\n QuicSocketAddress peer_address)\n : packet(std::move(packet)),\n self_address(self_address),\n peer_address(peer_address) {}\n\nBufferedPacket::BufferedPacket(BufferedPacket&& other) = default;\n\nBufferedPacket& BufferedPacket::operator=(BufferedPacket&& other) = default;\n\nBufferedPacket::~BufferedPacket() {}\n\nBufferedPacketList::BufferedPacketList()\n : creation_time(QuicTime::Zero()),\n ietf_quic(false),\n version(PROTOCOL_UNSUPPORTED, QUIC_VERSION_UNSUPPORTED) {}\n\nBufferedPacketList::BufferedPacketList(BufferedPacketList&& other) = default;\n\nBufferedPacketList& BufferedPacketList::operator=(BufferedPacketList&& other) =\n default;\n\nBufferedPacketList::~BufferedPacketList() {}\n\nQuicBufferedPacketStore::QuicBufferedPacketStore(\n VisitorInterface* visitor,\n const QuicClock* clock,\n QuicAlarmFactory* alarm_factory)\n : connection_life_span_(\n QuicTime::Delta::FromSeconds(kInitialIdleTimeoutSecs)),\n visitor_(visitor),\n clock_(clock),\n expiration_alarm_(\n alarm_factory->CreateAlarm(new ConnectionExpireAlarm(this))) {}\n\nQuicBufferedPacketStore::~QuicBufferedPacketStore() {}\n\nEnqueuePacketResult QuicBufferedPacketStore::EnqueuePacket(\n QuicConnectionId connection_id,\n bool ietf_quic,\n const QuicReceivedPacket& packet,\n QuicSocketAddress self_address,\n QuicSocketAddress peer_address,\n bool is_chlo,\n const std::string& alpn,\n const ParsedQuicVersion& version) {\n QUIC_BUG_IF(!FLAGS_quic_allow_chlo_buffering)\n << \"Shouldn't buffer packets if disabled via flag.\";\n QUIC_BUG_IF(is_chlo && QuicContainsKey(connections_with_chlo_, connection_id))\n << \"Shouldn't buffer duplicated CHLO on connection \" << connection_id;\n QUIC_BUG_IF(!is_chlo && !alpn.empty())\n << \"Shouldn't have an ALPN defined for a non-CHLO packet.\";\n QUIC_BUG_IF(is_chlo && version.transport_version == QUIC_VERSION_UNSUPPORTED)\n << \"Should have version for CHLO packet.\";\n\n if (!QuicContainsKey(undecryptable_packets_, connection_id) &&\n ShouldBufferPacket(is_chlo)) {\n \/\/ Drop the packet if the upper limit of undecryptable packets has been\n \/\/ reached or the whole capacity of the store has been reached.\n return TOO_MANY_CONNECTIONS;\n } else if (!QuicContainsKey(undecryptable_packets_, connection_id)) {\n undecryptable_packets_.emplace(\n std::make_pair(connection_id, BufferedPacketList()));\n undecryptable_packets_.back().second.ietf_quic = ietf_quic;\n undecryptable_packets_.back().second.version = version;\n }\n CHECK(QuicContainsKey(undecryptable_packets_, connection_id));\n BufferedPacketList& queue =\n undecryptable_packets_.find(connection_id)->second;\n\n if (!is_chlo) {\n \/\/ If current packet is not CHLO, it might not be buffered because store\n \/\/ only buffers certain number of undecryptable packets per connection.\n size_t num_non_chlo_packets =\n QuicContainsKey(connections_with_chlo_, connection_id)\n ? (queue.buffered_packets.size() - 1)\n : queue.buffered_packets.size();\n if (num_non_chlo_packets >= kDefaultMaxUndecryptablePackets) {\n \/\/ If there are kMaxBufferedPacketsPerConnection packets buffered up for\n \/\/ this connection, drop the current packet.\n return TOO_MANY_PACKETS;\n }\n }\n\n if (queue.buffered_packets.empty()) {\n \/\/ If this is the first packet arrived on a new connection, initialize the\n \/\/ creation time.\n queue.creation_time = clock_->ApproximateNow();\n }\n\n BufferedPacket new_entry(std::unique_ptr(packet.Clone()),\n self_address, peer_address);\n if (is_chlo) {\n \/\/ Add CHLO to the beginning of buffered packets so that it can be delivered\n \/\/ first later.\n queue.buffered_packets.push_front(std::move(new_entry));\n queue.alpn = alpn;\n connections_with_chlo_[connection_id] = false; \/\/ Dummy value.\n \/\/ Set the version of buffered packets of this connection on CHLO.\n queue.version = version;\n } else {\n \/\/ Buffer non-CHLO packets in arrival order.\n queue.buffered_packets.push_back(std::move(new_entry));\n }\n MaybeSetExpirationAlarm();\n return SUCCESS;\n}\n\nbool QuicBufferedPacketStore::HasBufferedPackets(\n QuicConnectionId connection_id) const {\n return QuicContainsKey(undecryptable_packets_, connection_id);\n}\n\nbool QuicBufferedPacketStore::HasChlosBuffered() const {\n return !connections_with_chlo_.empty();\n}\n\nBufferedPacketList QuicBufferedPacketStore::DeliverPackets(\n QuicConnectionId connection_id) {\n BufferedPacketList packets_to_deliver;\n auto it = undecryptable_packets_.find(connection_id);\n if (it != undecryptable_packets_.end()) {\n packets_to_deliver = std::move(it->second);\n undecryptable_packets_.erase(connection_id);\n }\n return packets_to_deliver;\n}\n\nvoid QuicBufferedPacketStore::DiscardPackets(QuicConnectionId connection_id) {\n undecryptable_packets_.erase(connection_id);\n connections_with_chlo_.erase(connection_id);\n}\n\nvoid QuicBufferedPacketStore::OnExpirationTimeout() {\n QuicTime expiration_time = clock_->ApproximateNow() - connection_life_span_;\n while (!undecryptable_packets_.empty()) {\n auto& entry = undecryptable_packets_.front();\n if (entry.second.creation_time > expiration_time) {\n break;\n }\n QuicConnectionId connection_id = entry.first;\n visitor_->OnExpiredPackets(connection_id, std::move(entry.second));\n undecryptable_packets_.pop_front();\n connections_with_chlo_.erase(connection_id);\n }\n if (!undecryptable_packets_.empty()) {\n MaybeSetExpirationAlarm();\n }\n}\n\nvoid QuicBufferedPacketStore::MaybeSetExpirationAlarm() {\n if (!expiration_alarm_->IsSet()) {\n expiration_alarm_->Set(clock_->ApproximateNow() + connection_life_span_);\n }\n}\n\nbool QuicBufferedPacketStore::ShouldBufferPacket(bool is_chlo) {\n bool is_store_full =\n undecryptable_packets_.size() >= kDefaultMaxConnectionsInStore;\n\n if (is_chlo) {\n return is_store_full;\n }\n\n size_t num_connections_without_chlo =\n undecryptable_packets_.size() - connections_with_chlo_.size();\n bool reach_non_chlo_limit =\n num_connections_without_chlo >= kMaxConnectionsWithoutCHLO;\n\n return is_store_full || reach_non_chlo_limit;\n}\n\nBufferedPacketList QuicBufferedPacketStore::DeliverPacketsForNextConnection(\n QuicConnectionId* connection_id) {\n if (connections_with_chlo_.empty()) {\n \/\/ Returns empty list if no CHLO has been buffered.\n return BufferedPacketList();\n }\n *connection_id = connections_with_chlo_.front().first;\n connections_with_chlo_.pop_front();\n\n BufferedPacketList packets = DeliverPackets(*connection_id);\n DCHECK(!packets.buffered_packets.empty())\n << \"Try to deliver connectons without CHLO\";\n return packets;\n}\n\nbool QuicBufferedPacketStore::HasChloForConnection(\n QuicConnectionId connection_id) {\n return QuicContainsKey(connections_with_chlo_, connection_id);\n}\n\n} \/\/ namespace quic\ngfe-relnote: n\/a(clean up) Switch existing directly access of FLAGS to use GetQuicFlag.\/\/ Copyright (c) 2016 The Chromium Authors. All rights reserved.\n\/\/ 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\/third_party\/quiche\/src\/quic\/core\/quic_buffered_packet_store.h\"\n\n#include \n\n#include \"net\/third_party\/quiche\/src\/quic\/platform\/api\/quic_bug_tracker.h\"\n#include \"net\/third_party\/quiche\/src\/quic\/platform\/api\/quic_flags.h\"\n#include \"net\/third_party\/quiche\/src\/quic\/platform\/api\/quic_map_util.h\"\n\nnamespace quic {\n\ntypedef QuicBufferedPacketStore::BufferedPacket BufferedPacket;\ntypedef QuicBufferedPacketStore::BufferedPacketList BufferedPacketList;\ntypedef QuicBufferedPacketStore::EnqueuePacketResult EnqueuePacketResult;\n\n\/\/ Max number of connections this store can keep track.\nstatic const size_t kDefaultMaxConnectionsInStore = 100;\n\/\/ Up to half of the capacity can be used for storing non-CHLO packets.\nstatic const size_t kMaxConnectionsWithoutCHLO =\n kDefaultMaxConnectionsInStore \/ 2;\n\nnamespace {\n\n\/\/ This alarm removes expired entries in map each time this alarm fires.\nclass ConnectionExpireAlarm : public QuicAlarm::Delegate {\n public:\n explicit ConnectionExpireAlarm(QuicBufferedPacketStore* store)\n : connection_store_(store) {}\n\n void OnAlarm() override { connection_store_->OnExpirationTimeout(); }\n\n ConnectionExpireAlarm(const ConnectionExpireAlarm&) = delete;\n ConnectionExpireAlarm& operator=(const ConnectionExpireAlarm&) = delete;\n\n private:\n QuicBufferedPacketStore* connection_store_;\n};\n\n} \/\/ namespace\n\nBufferedPacket::BufferedPacket(std::unique_ptr packet,\n QuicSocketAddress self_address,\n QuicSocketAddress peer_address)\n : packet(std::move(packet)),\n self_address(self_address),\n peer_address(peer_address) {}\n\nBufferedPacket::BufferedPacket(BufferedPacket&& other) = default;\n\nBufferedPacket& BufferedPacket::operator=(BufferedPacket&& other) = default;\n\nBufferedPacket::~BufferedPacket() {}\n\nBufferedPacketList::BufferedPacketList()\n : creation_time(QuicTime::Zero()),\n ietf_quic(false),\n version(PROTOCOL_UNSUPPORTED, QUIC_VERSION_UNSUPPORTED) {}\n\nBufferedPacketList::BufferedPacketList(BufferedPacketList&& other) = default;\n\nBufferedPacketList& BufferedPacketList::operator=(BufferedPacketList&& other) =\n default;\n\nBufferedPacketList::~BufferedPacketList() {}\n\nQuicBufferedPacketStore::QuicBufferedPacketStore(\n VisitorInterface* visitor,\n const QuicClock* clock,\n QuicAlarmFactory* alarm_factory)\n : connection_life_span_(\n QuicTime::Delta::FromSeconds(kInitialIdleTimeoutSecs)),\n visitor_(visitor),\n clock_(clock),\n expiration_alarm_(\n alarm_factory->CreateAlarm(new ConnectionExpireAlarm(this))) {}\n\nQuicBufferedPacketStore::~QuicBufferedPacketStore() {}\n\nEnqueuePacketResult QuicBufferedPacketStore::EnqueuePacket(\n QuicConnectionId connection_id,\n bool ietf_quic,\n const QuicReceivedPacket& packet,\n QuicSocketAddress self_address,\n QuicSocketAddress peer_address,\n bool is_chlo,\n const std::string& alpn,\n const ParsedQuicVersion& version) {\n QUIC_BUG_IF(!GetQuicFlag(FLAGS_quic_allow_chlo_buffering))\n << \"Shouldn't buffer packets if disabled via flag.\";\n QUIC_BUG_IF(is_chlo && QuicContainsKey(connections_with_chlo_, connection_id))\n << \"Shouldn't buffer duplicated CHLO on connection \" << connection_id;\n QUIC_BUG_IF(!is_chlo && !alpn.empty())\n << \"Shouldn't have an ALPN defined for a non-CHLO packet.\";\n QUIC_BUG_IF(is_chlo && version.transport_version == QUIC_VERSION_UNSUPPORTED)\n << \"Should have version for CHLO packet.\";\n\n if (!QuicContainsKey(undecryptable_packets_, connection_id) &&\n ShouldBufferPacket(is_chlo)) {\n \/\/ Drop the packet if the upper limit of undecryptable packets has been\n \/\/ reached or the whole capacity of the store has been reached.\n return TOO_MANY_CONNECTIONS;\n } else if (!QuicContainsKey(undecryptable_packets_, connection_id)) {\n undecryptable_packets_.emplace(\n std::make_pair(connection_id, BufferedPacketList()));\n undecryptable_packets_.back().second.ietf_quic = ietf_quic;\n undecryptable_packets_.back().second.version = version;\n }\n CHECK(QuicContainsKey(undecryptable_packets_, connection_id));\n BufferedPacketList& queue =\n undecryptable_packets_.find(connection_id)->second;\n\n if (!is_chlo) {\n \/\/ If current packet is not CHLO, it might not be buffered because store\n \/\/ only buffers certain number of undecryptable packets per connection.\n size_t num_non_chlo_packets =\n QuicContainsKey(connections_with_chlo_, connection_id)\n ? (queue.buffered_packets.size() - 1)\n : queue.buffered_packets.size();\n if (num_non_chlo_packets >= kDefaultMaxUndecryptablePackets) {\n \/\/ If there are kMaxBufferedPacketsPerConnection packets buffered up for\n \/\/ this connection, drop the current packet.\n return TOO_MANY_PACKETS;\n }\n }\n\n if (queue.buffered_packets.empty()) {\n \/\/ If this is the first packet arrived on a new connection, initialize the\n \/\/ creation time.\n queue.creation_time = clock_->ApproximateNow();\n }\n\n BufferedPacket new_entry(std::unique_ptr(packet.Clone()),\n self_address, peer_address);\n if (is_chlo) {\n \/\/ Add CHLO to the beginning of buffered packets so that it can be delivered\n \/\/ first later.\n queue.buffered_packets.push_front(std::move(new_entry));\n queue.alpn = alpn;\n connections_with_chlo_[connection_id] = false; \/\/ Dummy value.\n \/\/ Set the version of buffered packets of this connection on CHLO.\n queue.version = version;\n } else {\n \/\/ Buffer non-CHLO packets in arrival order.\n queue.buffered_packets.push_back(std::move(new_entry));\n }\n MaybeSetExpirationAlarm();\n return SUCCESS;\n}\n\nbool QuicBufferedPacketStore::HasBufferedPackets(\n QuicConnectionId connection_id) const {\n return QuicContainsKey(undecryptable_packets_, connection_id);\n}\n\nbool QuicBufferedPacketStore::HasChlosBuffered() const {\n return !connections_with_chlo_.empty();\n}\n\nBufferedPacketList QuicBufferedPacketStore::DeliverPackets(\n QuicConnectionId connection_id) {\n BufferedPacketList packets_to_deliver;\n auto it = undecryptable_packets_.find(connection_id);\n if (it != undecryptable_packets_.end()) {\n packets_to_deliver = std::move(it->second);\n undecryptable_packets_.erase(connection_id);\n }\n return packets_to_deliver;\n}\n\nvoid QuicBufferedPacketStore::DiscardPackets(QuicConnectionId connection_id) {\n undecryptable_packets_.erase(connection_id);\n connections_with_chlo_.erase(connection_id);\n}\n\nvoid QuicBufferedPacketStore::OnExpirationTimeout() {\n QuicTime expiration_time = clock_->ApproximateNow() - connection_life_span_;\n while (!undecryptable_packets_.empty()) {\n auto& entry = undecryptable_packets_.front();\n if (entry.second.creation_time > expiration_time) {\n break;\n }\n QuicConnectionId connection_id = entry.first;\n visitor_->OnExpiredPackets(connection_id, std::move(entry.second));\n undecryptable_packets_.pop_front();\n connections_with_chlo_.erase(connection_id);\n }\n if (!undecryptable_packets_.empty()) {\n MaybeSetExpirationAlarm();\n }\n}\n\nvoid QuicBufferedPacketStore::MaybeSetExpirationAlarm() {\n if (!expiration_alarm_->IsSet()) {\n expiration_alarm_->Set(clock_->ApproximateNow() + connection_life_span_);\n }\n}\n\nbool QuicBufferedPacketStore::ShouldBufferPacket(bool is_chlo) {\n bool is_store_full =\n undecryptable_packets_.size() >= kDefaultMaxConnectionsInStore;\n\n if (is_chlo) {\n return is_store_full;\n }\n\n size_t num_connections_without_chlo =\n undecryptable_packets_.size() - connections_with_chlo_.size();\n bool reach_non_chlo_limit =\n num_connections_without_chlo >= kMaxConnectionsWithoutCHLO;\n\n return is_store_full || reach_non_chlo_limit;\n}\n\nBufferedPacketList QuicBufferedPacketStore::DeliverPacketsForNextConnection(\n QuicConnectionId* connection_id) {\n if (connections_with_chlo_.empty()) {\n \/\/ Returns empty list if no CHLO has been buffered.\n return BufferedPacketList();\n }\n *connection_id = connections_with_chlo_.front().first;\n connections_with_chlo_.pop_front();\n\n BufferedPacketList packets = DeliverPackets(*connection_id);\n DCHECK(!packets.buffered_packets.empty())\n << \"Try to deliver connectons without CHLO\";\n return packets;\n}\n\nbool QuicBufferedPacketStore::HasChloForConnection(\n QuicConnectionId connection_id) {\n return QuicContainsKey(connections_with_chlo_, connection_id);\n}\n\n} \/\/ namespace quic\n<|endoftext|>"} {"text":"#include \"jsonfile.hpp\"\n#include \"xmlfile.hpp\"\n#include \"world.hpp\"\n\nusing namespace Headway;\n\nWorld::World(QObject* parent) : QObject(parent)\n{\n createWorld();\n}\n\nWorld::World(const World& other) : QObject(other.parent()), generations_(other.generations()), count_(other.count()), matrix(new Matrix(*(other.matrix)))\n{\n}\n\nWorld::~World() noexcept\n{\n delete matrix;\n}\n\nbool World::createWorld(quint32 width, quint32 height, quint64 generations) noexcept\n{\n if (width == 0)\n {\n emit error(\"Width must not be zero.\");\n return false;\n }\n\n if (height == 0)\n {\n emit error(\"Height must not be zero.\");\n return false;\n }\n\n if (matrix != nullptr)\n delete matrix;\n\n matrix = new Matrix(width, height);\n matrix->fill(false);\n\n generations_ = generations; emit generationsChanged(generations);\n count_ = 0; emit countChanged(0);\n\n return true;\n}\n\nbool World::loadFile(const QUrl& fileUrl) noexcept\n{\n QSharedPointer file;\n const QString filePath = fileUrl.toLocalFile();\n\n try\n {\n if (filePath.endsWith(QStringLiteral(\".xml\"), Qt::CaseInsensitive))\n {\n file = QSharedPointer(new XmlFile(filePath));\n }\n\n else if (filePath.endsWith(QStringLiteral(\".json\"), Qt::CaseInsensitive))\n {\n file = QSharedPointer(new JsonFile(filePath));\n }\n\n else\n {\n emit error(\"Unknown file type.\");\n return false;\n }\n\n if (!createWorld(file->readWidth(), file->readHeight(), file->readGenerations()))\n return false;\n\n while (file->hasNext())\n {\n quint32 x, y;\n\n file->readCoordinate(x, y);\n createCell(x, y);\n }\n }\n\n catch (FileException& e)\n {\n emit error(QStringLiteral(\"File is invalid: \") + e.error());\n return false;\n }\n\n return true;\n}\n\nbool World::saveFile(const QUrl& fileUrl) noexcept\n{\n const QString filePath = fileUrl.toLocalFile();\n\n try\n {\n if (filePath.endsWith(QStringLiteral(\".xml\"), Qt::CaseInsensitive))\n {\n XmlFile::write(filePath, *this);\n }\n\n else if (filePath.endsWith(QStringLiteral(\".json\"), Qt::CaseInsensitive))\n {\n JsonFile::write(filePath, *this);\n }\n\n else\n {\n emit error(\"Unknown file type.\");\n return false;\n }\n }\n\n catch (FileException& e)\n {\n emit error(e.error());\n return false;\n }\n\n return true;\n}\n\nbool World::isValid(quint32 x, quint32 y) const noexcept\n{\n return x < width() && y < height();\n}\n\nbool World::isAlive(quint32 x, quint32 y) const noexcept\n{\n if (!isValid(x ,y))\n return false;\n\n return matrix->get(x, y);\n}\n\nbool World::createCell(quint32 x, quint32 y) noexcept\n{\n if (isValid(x, y) && !isAlive(x, y))\n {\n matrix->set(x, y, true);\n emit countChanged(++count_);\n\n return true;\n }\n\n return false;\n}\n\nbool World::killCell(quint32 x, quint32 y) noexcept\n{\n if (isValid(x, y) && isAlive(x, y))\n {\n matrix->set(x, y, false);\n emit countChanged(--count_);\n\n return true;\n }\n\n return false;\n}\n\nquint8 World::neighbors(quint32 x, quint32 y) const noexcept\n{\n quint8 amount = 0;\n\n for (quint32 b = y - 1; b <= y + 1; ++b)\n {\n for (quint32 a = x - 1; a <= x + 1; ++a)\n {\n if (y == b && x == a) continue; \/\/ ignore self\n if (isValid(a, b) && isAlive(a, b)) ++amount;\n }\n }\n\n return amount;\n}\n\nbool World::random(quint64 number) noexcept\n{\n if (number > matrix->size() - count_)\n {\n emit error(\"Number of cells exceeds available space.\");\n return false;\n }\n\n QRandomGenerator* chaos = QRandomGenerator::global();\n\n while (number > 0)\n {\n quint32 x = chaos->bounded(width());\n quint32 y = chaos->bounded(height());\n\n if (createCell(x, y)) \/\/ if cell did not exist\n --number;\n }\n\n return true;\n}\n\nvoid World::next() noexcept\n{\n Headway::Matrix cache(width(), height()); \/\/ store neighbor information\n\n for (quint32 y = 0; y < height(); ++y)\n {\n for (quint32 x = 0; x < width(); ++x)\n {\n quint8 n = neighbors(x, y);\n cache.set(x, y, n);\n }\n }\n\n blockSignals(true); \/\/ emit countChanged only once\n\n for (quint32 y = 0; y < height(); ++y)\n {\n for (quint32 x = 0; x < width(); ++x)\n {\n quint8 n = cache.get(x, y);\n\n if (n <= 1 || n >= 4) killCell(x, y);\n else if (n == 3) createCell(x, y);\n }\n }\n\n blockSignals(false);\n\n emit countChanged(count_);\n emit generationsChanged(++generations_);\n}\n\nbool World::operator==(const World& other) const\n{\n return *matrix == *(other.matrix) &&\n generations_ == other.generations_ &&\n count_ == other.count_;\n}\n\nbool World::operator!=(const World& other) const\n{\n return !(*this == other);\n}\nconstness#include \"jsonfile.hpp\"\n#include \"xmlfile.hpp\"\n#include \"world.hpp\"\n\nusing namespace Headway;\n\nWorld::World(QObject* parent) : QObject(parent)\n{\n createWorld();\n}\n\nWorld::World(const World& other) : QObject(other.parent()), generations_(other.generations()), count_(other.count()), matrix(new Matrix(*(other.matrix)))\n{\n}\n\nWorld::~World() noexcept\n{\n delete matrix;\n}\n\nbool World::createWorld(quint32 width, quint32 height, quint64 generations) noexcept\n{\n if (width == 0)\n {\n emit error(\"Width must not be zero.\");\n return false;\n }\n\n if (height == 0)\n {\n emit error(\"Height must not be zero.\");\n return false;\n }\n\n if (matrix != nullptr)\n delete matrix;\n\n matrix = new Matrix(width, height);\n matrix->fill(false);\n\n generations_ = generations; emit generationsChanged(generations);\n count_ = 0; emit countChanged(0);\n\n return true;\n}\n\nbool World::loadFile(const QUrl& fileUrl) noexcept\n{\n QSharedPointer file;\n const QString filePath = fileUrl.toLocalFile();\n\n try\n {\n if (filePath.endsWith(QStringLiteral(\".xml\"), Qt::CaseInsensitive))\n {\n file = QSharedPointer(new XmlFile(filePath));\n }\n\n else if (filePath.endsWith(QStringLiteral(\".json\"), Qt::CaseInsensitive))\n {\n file = QSharedPointer(new JsonFile(filePath));\n }\n\n else\n {\n emit error(\"Unknown file type.\");\n return false;\n }\n\n if (!createWorld(file->readWidth(), file->readHeight(), file->readGenerations()))\n return false;\n\n while (file->hasNext())\n {\n quint32 x, y;\n\n file->readCoordinate(x, y);\n createCell(x, y);\n }\n }\n\n catch (FileException& e)\n {\n emit error(QStringLiteral(\"File is invalid: \") + e.error());\n return false;\n }\n\n return true;\n}\n\nbool World::saveFile(const QUrl& fileUrl) noexcept\n{\n const QString filePath = fileUrl.toLocalFile();\n\n try\n {\n if (filePath.endsWith(QStringLiteral(\".xml\"), Qt::CaseInsensitive))\n {\n XmlFile::write(filePath, *this);\n }\n\n else if (filePath.endsWith(QStringLiteral(\".json\"), Qt::CaseInsensitive))\n {\n JsonFile::write(filePath, *this);\n }\n\n else\n {\n emit error(\"Unknown file type.\");\n return false;\n }\n }\n\n catch (FileException& e)\n {\n emit error(e.error());\n return false;\n }\n\n return true;\n}\n\nbool World::isValid(quint32 x, quint32 y) const noexcept\n{\n return x < width() && y < height();\n}\n\nbool World::isAlive(quint32 x, quint32 y) const noexcept\n{\n if (!isValid(x ,y))\n return false;\n\n return matrix->get(x, y);\n}\n\nbool World::createCell(quint32 x, quint32 y) noexcept\n{\n if (isValid(x, y) && !isAlive(x, y))\n {\n matrix->set(x, y, true);\n emit countChanged(++count_);\n\n return true;\n }\n\n return false;\n}\n\nbool World::killCell(quint32 x, quint32 y) noexcept\n{\n if (isValid(x, y) && isAlive(x, y))\n {\n matrix->set(x, y, false);\n emit countChanged(--count_);\n\n return true;\n }\n\n return false;\n}\n\nquint8 World::neighbors(quint32 x, quint32 y) const noexcept\n{\n quint8 amount = 0;\n\n for (quint32 b = y - 1; b <= y + 1; ++b)\n {\n for (quint32 a = x - 1; a <= x + 1; ++a)\n {\n if (y == b && x == a) continue; \/\/ ignore self\n if (isValid(a, b) && isAlive(a, b)) ++amount;\n }\n }\n\n return amount;\n}\n\nbool World::random(quint64 number) noexcept\n{\n if (number > matrix->size() - count())\n {\n emit error(\"Number of cells exceeds available space.\");\n return false;\n }\n\n QRandomGenerator* chaos = QRandomGenerator::global();\n\n while (number > 0)\n {\n const quint32 x = chaos->bounded(width());\n const quint32 y = chaos->bounded(height());\n\n if (createCell(x, y)) \/\/ if cell did not exist\n --number;\n }\n\n return true;\n}\n\nvoid World::next() noexcept\n{\n Headway::Matrix cache(width(), height()); \/\/ store neighbor information\n\n for (quint32 y = 0; y < height(); ++y)\n {\n for (quint32 x = 0; x < width(); ++x)\n {\n const quint8 n = neighbors(x, y);\n cache.set(x, y, n);\n }\n }\n\n blockSignals(true); \/\/ emit countChanged only once\n\n for (quint32 y = 0; y < height(); ++y)\n {\n for (quint32 x = 0; x < width(); ++x)\n {\n const quint8 n = cache.get(x, y);\n\n if (n <= 1 || n >= 4) killCell(x, y);\n else if (n == 3) createCell(x, y);\n }\n }\n\n blockSignals(false);\n\n emit countChanged(count_);\n emit generationsChanged(++generations_);\n}\n\nbool World::operator==(const World& other) const\n{\n return *matrix == *(other.matrix) &&\n generations_ == other.generations_ &&\n count_ == other.count_;\n}\n\nbool World::operator!=(const World& other) const\n{\n return !(*this == other);\n}\n<|endoftext|>"} {"text":"\/\/ source changed by mrn@paus.ch\/ max rheiner\n\/\/ original source: henryj@paradise.net.nz\n\n#include \n#include \/\/ exit()\n\n#ifdef __APPLE_CC__\n #include \n#else\n #include \n#endif\n\n#include \"FTGLOutlineFont.h\"\n#include \"FTGLPolygonFont.h\"\n#include \"FTGLBitmapFont.h\"\n#ifndef FTGL_NO_TEXTURE_FONTS\n#include \"FTGLTextureFont.h\"\n#endif\n#include \"FTGLPixmapFont.h\"\n\nstatic FTFont* fonts[5];\nstatic int width;\nstatic int height;\n\n#ifdef __linux__\nconst char* DEFAULT_FONT = \"\/usr\/share\/fonts\/truetype\/arial.ttf\";\n#else\n#ifdef __APPLE_CC__\nconst char* DEFAULT_FONT = \"\/Users\/henry\/Development\/PROJECTS\/FTGL\/ftglcvs\/FTGL\/demo\/arial.ttf\";\n#else\n#ifdef WIN32\nconst char* DEFAULT_FONT = \"C:\\\\WINNT\\\\Fonts\\\\arial.ttf\";\n#else\nconst char* DEFAULT_FONT = \"arial.ttf\";\n#endif\n#endif\n#endif\n\nint file_exists( const char * filename );\n\nvoid draw_scene();\n\nvoid\nmy_init( const char* font_filename )\n{\n glClearColor(0.0, 0.0, 0.0, 0.0);\n glPolygonMode(GL_FRONT_AND_BACK, GL_FILL);\n\n fonts[0] = new FTGLOutlineFont;\n fonts[1] = new FTGLPolygonFont;\n#ifndef FTGL_NO_TEXTURE_FONTS\n fonts[2] = new FTGLTextureFont;\n#endif\n fonts[3] = new FTGLBitmapFont;\n fonts[4] = new FTGLPixmapFont;\n for (int i=0; i< 5; i++) {\n#ifdef FTGL_NO_TEXTURE_FONTS\n if (i == 2) continue;\n#endif\n if (!fonts[i]->Open(font_filename)) {\n cerr << \"ERROR: Unable to open file \" << font_filename << \"\\n\";\n }\n else {\n\t\t\tcout << \"Reading font \" << i << \" from \" << font_filename << endl;\n\n int point_size = 24;\n if (!fonts[i]->FaceSize(point_size)) {\n cerr << \"ERROR: Unable to set font face size \" << point_size << \"\\n\";\n }\n\n \/\/ Try to load AFM font metrics\n const char* ext = strrchr(font_filename, '.');\n if (ext && !strcmp(ext, \".pfb\"))\n {\n char *metrics = new char[strlen(font_filename)];\n strncpy(metrics, font_filename, ext - font_filename);\n strcpy(metrics + (ext - font_filename), \".afm\");\n if (file_exists(metrics))\n {\n cout << \"Attaching font metrics from \" << metrics << endl;\n fonts[i]->Attach(metrics);\n }\n }\n }\n }\n}\n\nstatic void\ndo_ortho()\n{\n int w;\n int h;\n GLdouble size;\n GLdouble aspect;\n\n w = width;\n h = height;\n aspect = (GLdouble)w \/ (GLdouble)h;\n\n \/\/ Use the whole window.\n glViewport(0, 0, w, h);\n\n \/\/ We are going to do some 2-D orthographic drawing.\n glMatrixMode(GL_PROJECTION);\n glLoadIdentity();\n size = (GLdouble)((w >= h) ? w : h) \/ 2.0;\n if (w <= h) {\n aspect = (GLdouble)h\/(GLdouble)w;\n glOrtho(-size, size, -size*aspect, size*aspect,\n -100000.0, 100000.0);\n }\n else {\n aspect = (GLdouble)w\/(GLdouble)h;\n glOrtho(-size*aspect, size*aspect, -size, size,\n -100000.0, 100000.0);\n }\n\n \/\/ Make the world and window coordinates coincide so that 1.0 in\n \/\/ model space equals one pixel in window space.\n glScaled(aspect, aspect, 1.0);\n\n \/\/ Now determine where to draw things.\n glMatrixMode(GL_MODELVIEW);\n glLoadIdentity();\n}\n\n#ifndef GLUTCALLBACK\n#define GLUTCALLBACK\n#endif\n\nextern \"C\" {\n\nvoid\nGLUTCALLBACK my_display(void)\n{\n glClear(GL_COLOR_BUFFER_BIT);\n\n draw_scene();\n\n glutSwapBuffers();\n}\n\nvoid\nGLUTCALLBACK my_reshape(int w, int h)\n{\n width = w;\n height = h;\n\n do_ortho( );\n}\n\nvoid\nGLUTCALLBACK my_handle_key(unsigned char key, int x, int y)\n{\n switch (key) {\n\n\t \/\/!!ELLERS\n case 'q': \/\/ Esc or 'q' Quits the program.\n case 27: \n\t {\n for (int i=0; i<5; i++) {\n#ifdef FTGL_NO_TEXTURE_FONTS\n if (i == 2) continue;\n#endif\n if (fonts[i]) {\n delete fonts[i];\n fonts[i] = 0;\n }\n }\n exit(1);\n\t }\n break;\n\n default:\n break;\n }\n}\n\n} \/\/ End of extern C\n\nvoid\ndraw_scene()\n{\n \/* Set up some strings with the characters to draw. *\/\n unsigned int count = 0;\n char string[8][256];\n int i;\n for (i=1; i < 32; i++) { \/* Skip zero - it's the null terminator! *\/\n string[0][count] = i;\n count++;\n }\n string[0][count] = '\\0';\n\n count = 0;\n for (i=32; i < 64; i++) {\n string[1][count] = i;\n count++;\n }\n string[1][count] = '\\0';\n\n count = 0;\n for (i=64; i < 96; i++) {\n string[2][count] = i;\n count++;\n }\n string[2][count] = '\\0';\n\n count = 0;\n for (i=96; i < 128; i++) {\n string[3][count] = i;\n count++;\n }\n string[3][count] = '\\0';\n\n count = 0;\n for (i=128; i < 160; i++) {\n string[4][count] = i;\n count++;\n }\n string[4][count] = '\\0';\n\n count = 0;\n for (i=160; i < 192; i++) {\n string[5][count] = i;\n count++;\n }\n string[5][count] = '\\0';\n\n count = 0;\n for (i=192; i < 224; i++) {\n string[6][count] = i;\n count++;\n }\n string[6][count] = '\\0';\n\n count = 0;\n for (i=224; i < 256; i++) {\n string[7][count] = i;\n count++;\n }\n string[7][count] = '\\0';\n\n\n glColor3f(1.0, 1.0, 1.0);\n\n for (int font = 0; font < 5; font++) {\n GLfloat x = -250.0;\n GLfloat y;\n GLfloat yild = 20.0;\n for (int j=0; j<4; j++) {\n y = 275.0-font*120.0-j*yild;\n if (font >= 3) {\n glRasterPos2f(x, y);\n fonts[font]->render(string[j]);\n }\n else {\n#ifdef FTGL_NO_TEXTURE_FONTS\n if (font == 2) continue;\n#endif\n if (font == 2) {\n glEnable(GL_TEXTURE_2D);\n glEnable(GL_BLEND);\n glBlendFunc(GL_SRC_ALPHA, GL_ONE_MINUS_SRC_ALPHA);\n }\n glPushMatrix(); {\n glTranslatef(x, y, 0.0);\n fonts[font]->render(string[j]);\n } glPopMatrix();\n if (font == 2) {\n glDisable(GL_TEXTURE_2D);\n glDisable(GL_BLEND);\n }\n }\n }\n }\n}\n\n\nint \nfile_exists( const char * filename )\n{\n\tFILE * fp = fopen( filename, \"r\" );\n\n\tif ( fp == NULL )\n\t{\n\t\t\/\/ That fopen failed does _not_ definitely mean the file isn't there \n\t\t\/\/ but for now this is ok\n\t\treturn 0;\n\t}\n\tfclose( fp );\n\treturn 1;\n}\n\nvoid\nusage( const char * program )\n{\n\tcerr << \"Usage: \" << program << \" \\n\" << endl;\n}\n\nint\nmain(int argc, char **argv)\n{\n\t\/\/!!ELLERS -- cleaned up\n\tconst char * filename;\n\n\tglutInitWindowSize(600, 600);\n\tglutInit(&argc, argv);\n\tglutInitDisplayMode(GLUT_RGB|GLUT_DOUBLE);\n\n\tglutCreateWindow(\"FTGL demo\");\n\n\tif ( argc >= 2 ) \n\t{\n\t\tif ( !file_exists( argv[ 1 ] ))\n\t\t{\n\t\t\tusage( argv[ 0 ]);\n\t\t\tcerr << \"Couldn't open file '\" << argv[ 1 ] << \"'\" << endl;\n\t\t\texit( -1 );\n\t\t}\n\t\tfilename = argv[ 1 ];\n\t}\n\telse \n\t{\n\t\t\/\/ try a default font\n\t\tfilename = DEFAULT_FONT;\n\n\t\tif ( !file_exists( filename ))\n\t\t{\n\t\t\tusage( argv[ 0 ]);\n\t\t\tcerr << \"Couldn't open default file '\" << filename << \"'\" << endl;\n\t\t\texit( -1 );\n\t\t}\n\t}\n\n\tmy_init( filename );\n\n\tglutDisplayFunc(my_display);\n\tglutReshapeFunc(my_reshape);\n\tglutKeyboardFunc(my_handle_key);\n\n\tglutMainLoop();\n\treturn 0;\n}\n\nFIX: fix warnings (unused vars)\/\/ source changed by mrn@paus.ch\/ max rheiner\n\/\/ original source: henryj@paradise.net.nz\n\n#include \n#include \/\/ exit()\n\n#ifdef __APPLE_CC__\n #include \n#else\n #include \n#endif\n\n#include \"FTGLOutlineFont.h\"\n#include \"FTGLPolygonFont.h\"\n#include \"FTGLBitmapFont.h\"\n#ifndef FTGL_NO_TEXTURE_FONTS\n#include \"FTGLTextureFont.h\"\n#endif\n#include \"FTGLPixmapFont.h\"\n\nstatic FTFont* fonts[5];\nstatic int width;\nstatic int height;\n\n#ifdef __linux__\nconst char* DEFAULT_FONT = \"\/usr\/share\/fonts\/truetype\/arial.ttf\";\n#else\n#ifdef __APPLE_CC__\nconst char* DEFAULT_FONT = \"\/Users\/henry\/Development\/PROJECTS\/FTGL\/ftglcvs\/FTGL\/demo\/arial.ttf\";\n#else\n#ifdef WIN32\nconst char* DEFAULT_FONT = \"C:\\\\WINNT\\\\Fonts\\\\arial.ttf\";\n#else\nconst char* DEFAULT_FONT = \"arial.ttf\";\n#endif\n#endif\n#endif\n\nint file_exists( const char * filename );\n\nvoid draw_scene();\n\nvoid\nmy_init( const char* font_filename )\n{\n glClearColor(0.0, 0.0, 0.0, 0.0);\n glPolygonMode(GL_FRONT_AND_BACK, GL_FILL);\n\n fonts[0] = new FTGLOutlineFont;\n fonts[1] = new FTGLPolygonFont;\n#ifndef FTGL_NO_TEXTURE_FONTS\n fonts[2] = new FTGLTextureFont;\n#endif\n fonts[3] = new FTGLBitmapFont;\n fonts[4] = new FTGLPixmapFont;\n for (int i=0; i< 5; i++) {\n#ifdef FTGL_NO_TEXTURE_FONTS\n if (i == 2) continue;\n#endif\n if (!fonts[i]->Open(font_filename)) {\n cerr << \"ERROR: Unable to open file \" << font_filename << \"\\n\";\n }\n else {\n\t\t\tcout << \"Reading font \" << i << \" from \" << font_filename << endl;\n\n int point_size = 24;\n if (!fonts[i]->FaceSize(point_size)) {\n cerr << \"ERROR: Unable to set font face size \" << point_size << \"\\n\";\n }\n\n \/\/ Try to load AFM font metrics\n const char* ext = strrchr(font_filename, '.');\n if (ext && !strcmp(ext, \".pfb\"))\n {\n char *metrics = new char[strlen(font_filename)];\n strncpy(metrics, font_filename, ext - font_filename);\n strcpy(metrics + (ext - font_filename), \".afm\");\n if (file_exists(metrics))\n {\n cout << \"Attaching font metrics from \" << metrics << endl;\n fonts[i]->Attach(metrics);\n }\n }\n }\n }\n}\n\nstatic void\ndo_ortho()\n{\n int w;\n int h;\n GLdouble size;\n GLdouble aspect;\n\n w = width;\n h = height;\n aspect = (GLdouble)w \/ (GLdouble)h;\n\n \/\/ Use the whole window.\n glViewport(0, 0, w, h);\n\n \/\/ We are going to do some 2-D orthographic drawing.\n glMatrixMode(GL_PROJECTION);\n glLoadIdentity();\n size = (GLdouble)((w >= h) ? w : h) \/ 2.0;\n if (w <= h) {\n aspect = (GLdouble)h\/(GLdouble)w;\n glOrtho(-size, size, -size*aspect, size*aspect,\n -100000.0, 100000.0);\n }\n else {\n aspect = (GLdouble)w\/(GLdouble)h;\n glOrtho(-size*aspect, size*aspect, -size, size,\n -100000.0, 100000.0);\n }\n\n \/\/ Make the world and window coordinates coincide so that 1.0 in\n \/\/ model space equals one pixel in window space.\n glScaled(aspect, aspect, 1.0);\n\n \/\/ Now determine where to draw things.\n glMatrixMode(GL_MODELVIEW);\n glLoadIdentity();\n}\n\n#ifndef GLUTCALLBACK\n#define GLUTCALLBACK\n#endif\n\nextern \"C\" {\n\nvoid\nGLUTCALLBACK my_display(void)\n{\n glClear(GL_COLOR_BUFFER_BIT);\n\n draw_scene();\n\n glutSwapBuffers();\n}\n\nvoid\nGLUTCALLBACK my_reshape(int w, int h)\n{\n width = w;\n height = h;\n\n do_ortho( );\n}\n\nvoid\nGLUTCALLBACK my_handle_key(unsigned char key, int, int)\n{\n switch (key) {\n\n\t \/\/!!ELLERS\n case 'q': \/\/ Esc or 'q' Quits the program.\n case 27: \n\t {\n for (int i=0; i<5; i++) {\n#ifdef FTGL_NO_TEXTURE_FONTS\n if (i == 2) continue;\n#endif\n if (fonts[i]) {\n delete fonts[i];\n fonts[i] = 0;\n }\n }\n exit(1);\n\t }\n break;\n\n default:\n break;\n }\n}\n\n} \/\/ End of extern C\n\nvoid\ndraw_scene()\n{\n \/* Set up some strings with the characters to draw. *\/\n unsigned int count = 0;\n char string[8][256];\n int i;\n for (i=1; i < 32; i++) { \/* Skip zero - it's the null terminator! *\/\n string[0][count] = i;\n count++;\n }\n string[0][count] = '\\0';\n\n count = 0;\n for (i=32; i < 64; i++) {\n string[1][count] = i;\n count++;\n }\n string[1][count] = '\\0';\n\n count = 0;\n for (i=64; i < 96; i++) {\n string[2][count] = i;\n count++;\n }\n string[2][count] = '\\0';\n\n count = 0;\n for (i=96; i < 128; i++) {\n string[3][count] = i;\n count++;\n }\n string[3][count] = '\\0';\n\n count = 0;\n for (i=128; i < 160; i++) {\n string[4][count] = i;\n count++;\n }\n string[4][count] = '\\0';\n\n count = 0;\n for (i=160; i < 192; i++) {\n string[5][count] = i;\n count++;\n }\n string[5][count] = '\\0';\n\n count = 0;\n for (i=192; i < 224; i++) {\n string[6][count] = i;\n count++;\n }\n string[6][count] = '\\0';\n\n count = 0;\n for (i=224; i < 256; i++) {\n string[7][count] = i;\n count++;\n }\n string[7][count] = '\\0';\n\n\n glColor3f(1.0, 1.0, 1.0);\n\n for (int font = 0; font < 5; font++) {\n GLfloat x = -250.0;\n GLfloat y;\n GLfloat yild = 20.0;\n for (int j=0; j<4; j++) {\n y = 275.0-font*120.0-j*yild;\n if (font >= 3) {\n glRasterPos2f(x, y);\n fonts[font]->render(string[j]);\n }\n else {\n#ifdef FTGL_NO_TEXTURE_FONTS\n if (font == 2) continue;\n#endif\n if (font == 2) {\n glEnable(GL_TEXTURE_2D);\n glEnable(GL_BLEND);\n glBlendFunc(GL_SRC_ALPHA, GL_ONE_MINUS_SRC_ALPHA);\n }\n glPushMatrix(); {\n glTranslatef(x, y, 0.0);\n fonts[font]->render(string[j]);\n } glPopMatrix();\n if (font == 2) {\n glDisable(GL_TEXTURE_2D);\n glDisable(GL_BLEND);\n }\n }\n }\n }\n}\n\n\nint \nfile_exists( const char * filename )\n{\n\tFILE * fp = fopen( filename, \"r\" );\n\n\tif ( fp == NULL )\n\t{\n\t\t\/\/ That fopen failed does _not_ definitely mean the file isn't there \n\t\t\/\/ but for now this is ok\n\t\treturn 0;\n\t}\n\tfclose( fp );\n\treturn 1;\n}\n\nvoid\nusage( const char * program )\n{\n\tcerr << \"Usage: \" << program << \" \\n\" << endl;\n}\n\nint\nmain(int argc, char **argv)\n{\n\t\/\/!!ELLERS -- cleaned up\n\tconst char * filename;\n\n\tglutInitWindowSize(600, 600);\n\tglutInit(&argc, argv);\n\tglutInitDisplayMode(GLUT_RGB|GLUT_DOUBLE);\n\n\tglutCreateWindow(\"FTGL demo\");\n\n\tif ( argc >= 2 ) \n\t{\n\t\tif ( !file_exists( argv[ 1 ] ))\n\t\t{\n\t\t\tusage( argv[ 0 ]);\n\t\t\tcerr << \"Couldn't open file '\" << argv[ 1 ] << \"'\" << endl;\n\t\t\texit( -1 );\n\t\t}\n\t\tfilename = argv[ 1 ];\n\t}\n\telse \n\t{\n\t\t\/\/ try a default font\n\t\tfilename = DEFAULT_FONT;\n\n\t\tif ( !file_exists( filename ))\n\t\t{\n\t\t\tusage( argv[ 0 ]);\n\t\t\tcerr << \"Couldn't open default file '\" << filename << \"'\" << endl;\n\t\t\texit( -1 );\n\t\t}\n\t}\n\n\tmy_init( filename );\n\n\tglutDisplayFunc(my_display);\n\tglutReshapeFunc(my_reshape);\n\tglutKeyboardFunc(my_handle_key);\n\n\tglutMainLoop();\n\treturn 0;\n}\n\n<|endoftext|>"} {"text":"#include \n#include \n\n\/\/ an interview question:\n\/\/ \"design a function such that f(f(n)) == -n, where n is a 32 bit signed int,\n\/\/ and which does not use complex numbers\"\n\nint minusItself(int n)\n{ \/\/ are globals or external state considered \"complex numbers\"?\n \/\/ a very philosophical question.\n static bool hasCalledItself = false;\n if (hasCalledItself) {\n hasCalledItself = false;\n return n;\n }\n hasCalledItself = true;\n return -n;\n}\n\ndouble changesItself(double n)\n{ \/\/ uses doubles instead of ints. again, this is \"extra info\"\n \/\/ and would fit a liberal definition of a complex number.\n if (n == int(n)) \/\/ first time called\n return n + 0.1;\n else\n return int(-n + 0.1);\n}\n\nint main()\n{\n for (int i = -3; i < 4; i++)\n std::cout << \"minusItself(minusItself(\" << i << \"): \" << minusItself(minusItself(i)) << std::endl;\n for (int i = -3; i < 4; i++)\n std::cout << \"changesItself(changesItself(\" << i << \"): \" << changesItself(changesItself(i)) << std::endl;\n}\ncleaned up puzzles\/inverter#include \n\n\/\/ an interview question:\n\/\/ \"design a function such that f(f(n)) == -n, where n is a 32 bit signed int,\n\/\/ and which does not use complex numbers\"\n\/\/\n\/\/ are globals or external state considered \"complex numbers\"?\n\/\/ a philosophical question.\n\nint minusItself(int n)\n{\n static bool hasCalledItself = false;\n if (hasCalledItself) {\n hasCalledItself = false;\n return n;\n }\n hasCalledItself = true;\n return -n;\n}\n\ndouble changesItself(double n)\n{ \/\/ uses doubles instead of ints. again, this is \"extra info\"\n \/\/ and would fit a liberal definition of a complex number.\n return (n == static_cast(n)) ? n + 0.1 : static_cast(-n + 0.1);\n}\n\nint main()\n{\n for (int i = -1; i < 2; i++)\n std::cout << \"minusItself(minusItself(\" << i << \"): \" << minusItself(minusItself(i)) << std::endl;\n\n std::cout << std::endl;\n\n for (int i = -1; i < 2; i++)\n std::cout << \"changesItself(changesItself(\" << i << \"): \" << changesItself(changesItself(i)) << std::endl;\n}\n\n\/\/ output:\n\/\/\n\/\/ minusItself(minusItself(-1): 1\n\/\/ minusItself(minusItself(0): 0\n\/\/ minusItself(minusItself(1): -1\n\/\/\n\/\/ changesItself(changesItself(-1): 1\n\/\/ changesItself(changesItself(0): 0\n\/\/ changesItself(changesItself(1): -1\n<|endoftext|>"} {"text":"\/**\n * @copyright Copyright 2016 The J-PET Framework Authors. All rights reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may find a copy of the License in the LICENCE file.\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n *\n * @file main.cpp\n *\/\n\n#include \n#include \n#include \n#include \"..\/LargeBarrelAnalysisExtended\/TimeWindowCreator.h\"\n#include \"..\/LargeBarrelAnalysisExtended\/TimeCalibLoader.h\"\n#include \"..\/LargeBarrelAnalysisExtended\/SignalFinder.h\"\n#include \"..\/LargeBarrelAnalysisExtended\/SignalTransformer.h\"\n#include \"..\/LargeBarrelAnalysisExtended\/HitFinder.h\"\n#include \"..\/LargeBarrelAnalysisExtended\/EventFinder.h\"\n#include \"..\/LargeBarrelAnalysisExtended\/EventCategorizer.h\"\n\nusing namespace std;\n\nint main(int argc, char* argv[])\n{\n\n \/\/Connection to the remote database disabled for the moment\n \/\/DB::SERVICES::DBHandler::createDBConnection(\"..\/DBConfig\/configDB.cfg\");\n\n JPetManager& manager = JPetManager::getManager();\n manager.parseCmdLine(argc, argv);\n\n \/\/First task - unpacking\n manager.registerTask([]() {\n return new JPetTaskLoader(\"hld\", \"tslot.raw\",\n new TimeWindowCreator(\n \"TimeWindowCreator\",\n \"Process unpacked HLD file into a tree of JPetTimeWindow objects\"\n )\n );\n });\n\n \/\/Second task - Signal Channel calibration\n manager.registerTask([]() {\n return new JPetTaskLoader(\"tslot.raw\", \"tslot.calib\",\n new TimeCalibLoader(\n \"TimeCalibLoader\",\n \"Apply time corrections from prepared calibrations\"\n )\n );\n });\n\n \/\/Third task - Raw Signal Creation\n manager.registerTask([]() {\n return new JPetTaskLoader(\"tslot.calib\", \"raw.sig\",\n new SignalFinder(\n \"SignalFinder\",\n \"Create Raw Signals, optional - draw control histograms\",\n true\n )\n );\n });\n\n \/\/\/\/Fourth task - Reco & Phys signal creation\n manager.registerTask([]() {\n return new JPetTaskLoader(\"raw.sig\", \"phys.sig\",\n new SignalTransformer(\n \"SignalTransformer\",\n \"Create Reco & Phys Signals\"\n )\n );\n });\n\n \/\/\/\/Fifth task - Hit construction\n manager.registerTask([]() {\n return new JPetTaskLoader(\"phys.sig\", \"hits\",\n new HitFinder(\n \"HitFinder\",\n \"Create hits from physical signals\"\n )\n );\n });\n\n \/\/\/\/Sixth task - unknown Event construction\n manager.registerTask([]() {\n return new JPetTaskLoader(\"hits\", \"unk.evt\",\n new EventFinder(\n \"EventFinder\",\n \"Create Events as group of Hits\"\n )\n );\n });\n\n \/\/Seventh task - Event Categorization\n manager.registerTask([]() {\n return new JPetTaskLoader(\"unk.evt\", \"cat.evt\",\n new EventCategorizer(\n \"EventCategorizer\",\n \"Categorize Events\"\n )\n );\n });\n\n manager.run();\n}\nDelete not needed modules from main function\/**\n * @copyright Copyright 2016 The J-PET Framework Authors. All rights reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may find a copy of the License in the LICENCE file.\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n *\n * @file main.cpp\n *\/\n\n#include \n#include \n#include \n#include \"..\/LargeBarrelAnalysisExtended\/TimeWindowCreator.h\"\n#include \"..\/LargeBarrelAnalysisExtended\/TimeCalibLoader.h\"\n#include \"..\/LargeBarrelAnalysisExtended\/SignalFinder.h\"\n#include \"..\/LargeBarrelAnalysisExtended\/SignalTransformer.h\"\n#include \"..\/LargeBarrelAnalysisExtended\/HitFinder.h\"\n\nusing namespace std;\n\nint main(int argc, char* argv[])\n{\n\n \/\/Connection to the remote database disabled for the moment\n \/\/DB::SERVICES::DBHandler::createDBConnection(\"..\/DBConfig\/configDB.cfg\");\n\n JPetManager& manager = JPetManager::getManager();\n manager.parseCmdLine(argc, argv);\n\n \/\/First task - unpacking\n manager.registerTask([]() {\n return new JPetTaskLoader(\"hld\", \"tslot.raw\",\n new TimeWindowCreator(\n \"TimeWindowCreator\",\n \"Process unpacked HLD file into a tree of JPetTimeWindow objects\"\n )\n );\n });\n\n \/\/Second task - Signal Channel calibration\n manager.registerTask([]() {\n return new JPetTaskLoader(\"tslot.raw\", \"tslot.calib\",\n new TimeCalibLoader(\n \"TimeCalibLoader\",\n \"Apply time corrections from prepared calibrations\"\n )\n );\n });\n\n \/\/Third task - Raw Signal Creation\n manager.registerTask([]() {\n return new JPetTaskLoader(\"tslot.calib\", \"raw.sig\",\n new SignalFinder(\n \"SignalFinder\",\n \"Create Raw Signals, optional - draw control histograms\",\n true\n )\n );\n });\n\n \/\/\/\/Fourth task - Reco & Phys signal creation\n manager.registerTask([]() {\n return new JPetTaskLoader(\"raw.sig\", \"phys.sig\",\n new SignalTransformer(\n \"SignalTransformer\",\n \"Create Reco & Phys Signals\"\n )\n );\n });\n\n \/\/\/\/Fifth task - Hit construction\n manager.registerTask([]() {\n return new JPetTaskLoader(\"phys.sig\", \"hits\",\n new HitFinder(\n \"HitFinder\",\n \"Create hits from physical signals\"\n )\n );\n });\n\n manager.run();\n}\n<|endoftext|>"} {"text":"\/****************************************************************************\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 mavlink_ulog.cpp\n * ULog data streaming via MAVLink\n *\n * @author Beat Küng \n *\/\n\n#include \"mavlink_ulog.h\"\n#include \n#include \n#include \n\nbool MavlinkULog::_init = false;\nMavlinkULog *MavlinkULog::_instance = nullptr;\npx4_sem_t MavlinkULog::_lock;\nconst float MavlinkULog::_rate_calculation_delta_t = 0.1f;\n\n\nMavlinkULog::MavlinkULog(int datarate, float max_rate_factor, uint8_t target_system, uint8_t target_component)\n\t: _target_system(target_system), _target_component(target_component),\n\t_max_rate_factor(max_rate_factor),\n\t_max_num_messages(math::max(1, (int)ceilf(_rate_calculation_delta_t * _max_rate_factor * datarate \/\n\t\t\t(MAVLINK_MSG_ID_LOGGING_DATA_LEN + MAVLINK_NUM_NON_PAYLOAD_BYTES)))),\n\t_current_rate_factor(max_rate_factor)\n{\n\t_ulog_stream_sub = orb_subscribe(ORB_ID(ulog_stream));\n\n\tif (_ulog_stream_sub < 0) {\n\t\tPX4_ERR(\"orb_subscribe failed (%i)\", errno);\n\t}\n\t_waiting_for_initial_ack = true;\n\t_last_sent_time = hrt_absolute_time(); \/\/(ab)use this timestamp during initialization\n\t_next_rate_check = _last_sent_time + _rate_calculation_delta_t * 1.e6f;\n}\n\nMavlinkULog::~MavlinkULog()\n{\n\tif (_ulog_stream_ack_pub) {\n\t\torb_unadvertise(_ulog_stream_ack_pub);\n\t}\n\tif (_ulog_stream_sub >= 0) {\n\t\torb_unsubscribe(_ulog_stream_sub);\n\t}\n}\n\nvoid MavlinkULog::start_ack_received()\n{\n\tif (_waiting_for_initial_ack) {\n\t\t_last_sent_time = 0;\n\t\t_waiting_for_initial_ack = false;\n\t\tPX4_DEBUG(\"got logger ack\");\n\t}\n}\n\nint MavlinkULog::handle_update(mavlink_channel_t channel)\n{\n\tstatic_assert(sizeof(ulog_stream_s::data) == MAVLINK_MSG_LOGGING_DATA_FIELD_DATA_LEN, \"Invalid uorb ulog_stream.data length\");\n\tstatic_assert(sizeof(ulog_stream_s::data) == MAVLINK_MSG_LOGGING_DATA_ACKED_FIELD_DATA_LEN, \"Invalid uorb ulog_stream.data length\");\n\n\tif (_waiting_for_initial_ack) {\n\t\tif (hrt_elapsed_time(&_last_sent_time) > 3e5) {\n\t\t\tPX4_WARN(\"no ack from logger (is it running?)\");\n\t\t\treturn -1;\n\t\t}\n\t}\n\n\t\/\/ check if we're waiting for an ACK\n\tif (_last_sent_time) {\n\t\tbool check_for_updates = false;\n\t\tif (_ack_received) {\n\t\t\t_last_sent_time = 0;\n\t\t\tcheck_for_updates = true;\n\t\t} else {\n\n\t\t\tif (hrt_elapsed_time(&_last_sent_time) > ulog_stream_ack_s::ACK_TIMEOUT * 1000) {\n\t\t\t\tif (++_sent_tries > ulog_stream_ack_s::ACK_MAX_TRIES) {\n\t\t\t\t\treturn -ETIMEDOUT;\n\t\t\t\t} else {\n\t\t\t\t\tPX4_DEBUG(\"re-sending ulog mavlink message (try=%i)\", _sent_tries);\n\t\t\t\t\t_last_sent_time = hrt_absolute_time();\n\t\t\t\t\tmavlink_logging_data_acked_t msg;\n\t\t\t\t\tmsg.sequence = _ulog_data.sequence;\n\t\t\t\t\tmsg.length = _ulog_data.length;\n\t\t\t\t\tmsg.first_message_offset = _ulog_data.first_message_offset;\n\t\t\t\t\tmsg.target_system = _target_system;\n\t\t\t\t\tmsg.target_component = _target_component;\n\t\t\t\t\tmemcpy(msg.data, _ulog_data.data, sizeof(msg.data));\n\t\t\t\t\tmavlink_msg_logging_data_acked_send_struct(channel, &msg);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\tif (!check_for_updates) {\n\t\t\treturn 0;\n\t\t}\n\t}\n\n\tbool updated = false;\n\tint ret = orb_check(_ulog_stream_sub, &updated);\n\twhile (updated && !ret && _current_num_msgs < _max_num_messages) {\n\t\torb_copy(ORB_ID(ulog_stream), _ulog_stream_sub, &_ulog_data);\n\t\tif (_ulog_data.flags & ulog_stream_s::FLAGS_NEED_ACK) {\n\t\t\t_sent_tries = 1;\n\t\t\t_last_sent_time = hrt_absolute_time();\n\t\t\tlock();\n\t\t\t_wait_for_ack_sequence = _ulog_data.sequence;\n\t\t\t_ack_received = false;\n\t\t\tunlock();\n\n\t\t\tmavlink_logging_data_acked_t msg;\n\t\t\tmsg.sequence = _ulog_data.sequence;\n\t\t\tmsg.length = _ulog_data.length;\n\t\t\tmsg.first_message_offset = _ulog_data.first_message_offset;\n\t\t\tmsg.target_system = _target_system;\n\t\t\tmsg.target_component = _target_component;\n\t\t\tmemcpy(msg.data, _ulog_data.data, sizeof(msg.data));\n\t\t\tmavlink_msg_logging_data_acked_send_struct(channel, &msg);\n\n\t\t} else {\n\t\t\tmavlink_logging_data_t msg;\n\t\t\tmsg.sequence = _ulog_data.sequence;\n\t\t\tmsg.length = _ulog_data.length;\n\t\t\tmsg.first_message_offset = _ulog_data.first_message_offset;\n\t\t\tmsg.target_system = _target_system;\n\t\t\tmsg.target_component = _target_component;\n\t\t\tmemcpy(msg.data, _ulog_data.data, sizeof(msg.data));\n\t\t\tmavlink_msg_logging_data_send_struct(channel, &msg);\n\t\t}\n\t\t++_current_num_msgs;\n\t\tret = orb_check(_ulog_stream_sub, &updated);\n\t}\n\n\t\/\/need to update the rate?\n\thrt_abstime t = hrt_absolute_time();\n\tif (t > _next_rate_check) {\n\t\tif (_current_num_msgs < _max_num_messages) {\n\t\t\t_current_rate_factor = _max_rate_factor * (float)_current_num_msgs \/ _max_num_messages;\n\t\t} else {\n\t\t\t_current_rate_factor = _max_rate_factor;\n\t\t}\n\t\t_current_num_msgs = 0;\n\t\t_next_rate_check = t + _rate_calculation_delta_t * 1.e6f;\n\t\tPX4_DEBUG(\"current rate=%.3f (max=%i msgs in %.3fs)\", (double)_current_rate_factor, _max_num_messages,\n\t\t\t\t(double)_rate_calculation_delta_t);\n\t}\n\n\treturn 0;\n}\n\nvoid MavlinkULog::initialize()\n{\n\tif (_init) {\n\t\treturn;\n\t}\n\tpx4_sem_init(&_lock, 1, 1);\n\t_init = true;\n}\n\nMavlinkULog* MavlinkULog::try_start(int datarate, float max_rate_factor, uint8_t target_system, uint8_t target_component)\n{\n\tMavlinkULog *ret = nullptr;\n\tbool failed = false;\n\tlock();\n\tif (!_instance) {\n\t\tret = _instance = new MavlinkULog(datarate, max_rate_factor, target_system, target_component);\n\t\tif (!_instance) {\n\t\t\tfailed = true;\n\t\t}\n\t}\n\tunlock();\n\n\tif (failed) {\n\t\tPX4_ERR(\"alloc failed\");\n\t}\n\treturn ret;\n}\n\nvoid MavlinkULog::stop()\n{\n\tlock();\n\tif (_instance) {\n\t\tdelete _instance;\n\t\t_instance = nullptr;\n\t}\n\tunlock();\n}\n\nvoid MavlinkULog::handle_ack(mavlink_logging_ack_t ack)\n{\n\tlock();\n\tif (_instance) { \/\/ make sure stop() was not called right before\n\t\tif (_wait_for_ack_sequence == ack.sequence) {\n\t\t\t_ack_received = true;\n\t\t\tpublish_ack(ack.sequence);\n\t\t}\n\t}\n\tunlock();\n}\n\nvoid MavlinkULog::publish_ack(uint16_t sequence)\n{\n\tulog_stream_ack_s ack;\n\tack.timestamp = hrt_absolute_time();\n\tack.sequence = sequence;\n\n\tif (_ulog_stream_ack_pub == nullptr) {\n\t\t_ulog_stream_ack_pub = orb_advertise_queue(ORB_ID(ulog_stream_ack), &ack, 3);\n\n\t} else {\n\t\torb_publish(ORB_ID(ulog_stream_ack), _ulog_stream_ack_pub, &ack);\n\t}\n}\nfix mavlink ulog: return if initial ack not yet received\/****************************************************************************\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 mavlink_ulog.cpp\n * ULog data streaming via MAVLink\n *\n * @author Beat Küng \n *\/\n\n#include \"mavlink_ulog.h\"\n#include \n#include \n#include \n\nbool MavlinkULog::_init = false;\nMavlinkULog *MavlinkULog::_instance = nullptr;\npx4_sem_t MavlinkULog::_lock;\nconst float MavlinkULog::_rate_calculation_delta_t = 0.1f;\n\n\nMavlinkULog::MavlinkULog(int datarate, float max_rate_factor, uint8_t target_system, uint8_t target_component)\n\t: _target_system(target_system), _target_component(target_component),\n\t_max_rate_factor(max_rate_factor),\n\t_max_num_messages(math::max(1, (int)ceilf(_rate_calculation_delta_t * _max_rate_factor * datarate \/\n\t\t\t(MAVLINK_MSG_ID_LOGGING_DATA_LEN + MAVLINK_NUM_NON_PAYLOAD_BYTES)))),\n\t_current_rate_factor(max_rate_factor)\n{\n\t_ulog_stream_sub = orb_subscribe(ORB_ID(ulog_stream));\n\n\tif (_ulog_stream_sub < 0) {\n\t\tPX4_ERR(\"orb_subscribe failed (%i)\", errno);\n\t}\n\t_waiting_for_initial_ack = true;\n\t_last_sent_time = hrt_absolute_time(); \/\/(ab)use this timestamp during initialization\n\t_next_rate_check = _last_sent_time + _rate_calculation_delta_t * 1.e6f;\n}\n\nMavlinkULog::~MavlinkULog()\n{\n\tif (_ulog_stream_ack_pub) {\n\t\torb_unadvertise(_ulog_stream_ack_pub);\n\t}\n\tif (_ulog_stream_sub >= 0) {\n\t\torb_unsubscribe(_ulog_stream_sub);\n\t}\n}\n\nvoid MavlinkULog::start_ack_received()\n{\n\tif (_waiting_for_initial_ack) {\n\t\t_last_sent_time = 0;\n\t\t_waiting_for_initial_ack = false;\n\t\tPX4_DEBUG(\"got logger ack\");\n\t}\n}\n\nint MavlinkULog::handle_update(mavlink_channel_t channel)\n{\n\tstatic_assert(sizeof(ulog_stream_s::data) == MAVLINK_MSG_LOGGING_DATA_FIELD_DATA_LEN, \"Invalid uorb ulog_stream.data length\");\n\tstatic_assert(sizeof(ulog_stream_s::data) == MAVLINK_MSG_LOGGING_DATA_ACKED_FIELD_DATA_LEN, \"Invalid uorb ulog_stream.data length\");\n\n\tif (_waiting_for_initial_ack) {\n\t\tif (hrt_elapsed_time(&_last_sent_time) > 3e5) {\n\t\t\tPX4_WARN(\"no ack from logger (is it running?)\");\n\t\t\treturn -1;\n\t\t}\n\t\treturn 0;\n\t}\n\n\t\/\/ check if we're waiting for an ACK\n\tif (_last_sent_time) {\n\t\tbool check_for_updates = false;\n\t\tif (_ack_received) {\n\t\t\t_last_sent_time = 0;\n\t\t\tcheck_for_updates = true;\n\t\t} else {\n\n\t\t\tif (hrt_elapsed_time(&_last_sent_time) > ulog_stream_ack_s::ACK_TIMEOUT * 1000) {\n\t\t\t\tif (++_sent_tries > ulog_stream_ack_s::ACK_MAX_TRIES) {\n\t\t\t\t\treturn -ETIMEDOUT;\n\t\t\t\t} else {\n\t\t\t\t\tPX4_DEBUG(\"re-sending ulog mavlink message (try=%i)\", _sent_tries);\n\t\t\t\t\t_last_sent_time = hrt_absolute_time();\n\t\t\t\t\tmavlink_logging_data_acked_t msg;\n\t\t\t\t\tmsg.sequence = _ulog_data.sequence;\n\t\t\t\t\tmsg.length = _ulog_data.length;\n\t\t\t\t\tmsg.first_message_offset = _ulog_data.first_message_offset;\n\t\t\t\t\tmsg.target_system = _target_system;\n\t\t\t\t\tmsg.target_component = _target_component;\n\t\t\t\t\tmemcpy(msg.data, _ulog_data.data, sizeof(msg.data));\n\t\t\t\t\tmavlink_msg_logging_data_acked_send_struct(channel, &msg);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\tif (!check_for_updates) {\n\t\t\treturn 0;\n\t\t}\n\t}\n\n\tbool updated = false;\n\tint ret = orb_check(_ulog_stream_sub, &updated);\n\twhile (updated && !ret && _current_num_msgs < _max_num_messages) {\n\t\torb_copy(ORB_ID(ulog_stream), _ulog_stream_sub, &_ulog_data);\n\t\tif (_ulog_data.flags & ulog_stream_s::FLAGS_NEED_ACK) {\n\t\t\t_sent_tries = 1;\n\t\t\t_last_sent_time = hrt_absolute_time();\n\t\t\tlock();\n\t\t\t_wait_for_ack_sequence = _ulog_data.sequence;\n\t\t\t_ack_received = false;\n\t\t\tunlock();\n\n\t\t\tmavlink_logging_data_acked_t msg;\n\t\t\tmsg.sequence = _ulog_data.sequence;\n\t\t\tmsg.length = _ulog_data.length;\n\t\t\tmsg.first_message_offset = _ulog_data.first_message_offset;\n\t\t\tmsg.target_system = _target_system;\n\t\t\tmsg.target_component = _target_component;\n\t\t\tmemcpy(msg.data, _ulog_data.data, sizeof(msg.data));\n\t\t\tmavlink_msg_logging_data_acked_send_struct(channel, &msg);\n\n\t\t} else {\n\t\t\tmavlink_logging_data_t msg;\n\t\t\tmsg.sequence = _ulog_data.sequence;\n\t\t\tmsg.length = _ulog_data.length;\n\t\t\tmsg.first_message_offset = _ulog_data.first_message_offset;\n\t\t\tmsg.target_system = _target_system;\n\t\t\tmsg.target_component = _target_component;\n\t\t\tmemcpy(msg.data, _ulog_data.data, sizeof(msg.data));\n\t\t\tmavlink_msg_logging_data_send_struct(channel, &msg);\n\t\t}\n\t\t++_current_num_msgs;\n\t\tret = orb_check(_ulog_stream_sub, &updated);\n\t}\n\n\t\/\/need to update the rate?\n\thrt_abstime t = hrt_absolute_time();\n\tif (t > _next_rate_check) {\n\t\tif (_current_num_msgs < _max_num_messages) {\n\t\t\t_current_rate_factor = _max_rate_factor * (float)_current_num_msgs \/ _max_num_messages;\n\t\t} else {\n\t\t\t_current_rate_factor = _max_rate_factor;\n\t\t}\n\t\t_current_num_msgs = 0;\n\t\t_next_rate_check = t + _rate_calculation_delta_t * 1.e6f;\n\t\tPX4_DEBUG(\"current rate=%.3f (max=%i msgs in %.3fs)\", (double)_current_rate_factor, _max_num_messages,\n\t\t\t\t(double)_rate_calculation_delta_t);\n\t}\n\n\treturn 0;\n}\n\nvoid MavlinkULog::initialize()\n{\n\tif (_init) {\n\t\treturn;\n\t}\n\tpx4_sem_init(&_lock, 1, 1);\n\t_init = true;\n}\n\nMavlinkULog* MavlinkULog::try_start(int datarate, float max_rate_factor, uint8_t target_system, uint8_t target_component)\n{\n\tMavlinkULog *ret = nullptr;\n\tbool failed = false;\n\tlock();\n\tif (!_instance) {\n\t\tret = _instance = new MavlinkULog(datarate, max_rate_factor, target_system, target_component);\n\t\tif (!_instance) {\n\t\t\tfailed = true;\n\t\t}\n\t}\n\tunlock();\n\n\tif (failed) {\n\t\tPX4_ERR(\"alloc failed\");\n\t}\n\treturn ret;\n}\n\nvoid MavlinkULog::stop()\n{\n\tlock();\n\tif (_instance) {\n\t\tdelete _instance;\n\t\t_instance = nullptr;\n\t}\n\tunlock();\n}\n\nvoid MavlinkULog::handle_ack(mavlink_logging_ack_t ack)\n{\n\tlock();\n\tif (_instance) { \/\/ make sure stop() was not called right before\n\t\tif (_wait_for_ack_sequence == ack.sequence) {\n\t\t\t_ack_received = true;\n\t\t\tpublish_ack(ack.sequence);\n\t\t}\n\t}\n\tunlock();\n}\n\nvoid MavlinkULog::publish_ack(uint16_t sequence)\n{\n\tulog_stream_ack_s ack;\n\tack.timestamp = hrt_absolute_time();\n\tack.sequence = sequence;\n\n\tif (_ulog_stream_ack_pub == nullptr) {\n\t\t_ulog_stream_ack_pub = orb_advertise_queue(ORB_ID(ulog_stream_ack), &ack, 3);\n\n\t} else {\n\t\torb_publish(ORB_ID(ulog_stream_ack), _ulog_stream_ack_pub, &ack);\n\t}\n}\n<|endoftext|>"} {"text":"\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\n\/\/ Copyright (c) 2004-2019 musikcube team\n\/\/\n\/\/ All rights reserved.\n\/\/\n\/\/ Redistribution and use in source and binary forms, with or without\n\/\/ modification, are permitted provided that the following conditions are met:\n\/\/\n\/\/ * Redistributions of source code must retain the above copyright notice,\n\/\/ this list of conditions and the following disclaimer.\n\/\/\n\/\/ * Redistributions in binary form must reproduce the above copyright\n\/\/ notice, this list of conditions and the following disclaimer in the\n\/\/ documentation and\/or other materials provided with the distribution.\n\/\/\n\/\/ * Neither the name of the author nor the names of other contributors may\n\/\/ be used to endorse or promote products derived from this software\n\/\/ without specific prior written permission.\n\/\/\n\/\/ THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS \"AS IS\"\n\/\/ AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE\n\/\/ IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE\n\/\/ ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE\n\/\/ LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR\n\/\/ CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF\n\/\/ SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS\n\/\/ INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN\n\/\/ CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)\n\/\/ ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE\n\/\/ POSSIBILITY OF SUCH DAMAGE.\n\/\/\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n#include \n#include \n#include \n\nusing namespace cursespp;\n\nvoid Scrollbar::Draw(ListWindow* list, Window* target) {\n int height = list->GetHeight();\n auto *adapter = &list->GetScrollAdapter();\n if (adapter && height > 2) {\n auto& pos = list->GetScrollPosition();\n\n \/* these are defaults for drawing to an external view, that\n is, when target != list. *\/\n int xOffset = 0;\n int from = 0, to = height;\n WINDOW* frame = nullptr;\n float range = (float) height;\n size_t minY = 0;\n\n if (!target || target == list) {\n \/* if we're drawing on top of the ListWindow's frame,\n we need to account for the padding it provides. *\/\n frame = list->GetFrame();\n xOffset = list->GetWidth() - 1;\n ++from; --to;\n range -= 2.0f;\n minY = 1;\n }\n else {\n frame = target->GetFrame();\n }\n\n float total = (float) std::max(minY, adapter->GetEntryCount());\n\n int yOffset;\n if (range >= total) {\n yOffset = -1;\n }\n else {\n float percent = (float)pos.logicalIndex \/ total;\n yOffset = (int)(range * percent) + minY;\n }\n\n for (int i = from; i < to; i++) {\n wmove(frame, i, xOffset);\n if (i == yOffset) wattron(frame, A_REVERSE);\n waddch(frame, (i == yOffset) ? ' ' : ACS_VLINE);\n if (i == yOffset) wattroff(frame, A_REVERSE);\n }\n }\n}\nUse mvwvline() to draw scrollbar -- maybe this will fix the problem some FreeBSD users have?\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\n\/\/ Copyright (c) 2004-2019 musikcube team\n\/\/\n\/\/ All rights reserved.\n\/\/\n\/\/ Redistribution and use in source and binary forms, with or without\n\/\/ modification, are permitted provided that the following conditions are met:\n\/\/\n\/\/ * Redistributions of source code must retain the above copyright notice,\n\/\/ this list of conditions and the following disclaimer.\n\/\/\n\/\/ * Redistributions in binary form must reproduce the above copyright\n\/\/ notice, this list of conditions and the following disclaimer in the\n\/\/ documentation and\/or other materials provided with the distribution.\n\/\/\n\/\/ * Neither the name of the author nor the names of other contributors may\n\/\/ be used to endorse or promote products derived from this software\n\/\/ without specific prior written permission.\n\/\/\n\/\/ THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS \"AS IS\"\n\/\/ AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE\n\/\/ IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE\n\/\/ ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE\n\/\/ LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR\n\/\/ CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF\n\/\/ SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS\n\/\/ INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN\n\/\/ CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)\n\/\/ ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE\n\/\/ POSSIBILITY OF SUCH DAMAGE.\n\/\/\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n#include \n#include \n#include \n\nusing namespace cursespp;\n\nvoid Scrollbar::Draw(ListWindow* list, Window* target) {\n int height = list->GetHeight();\n auto *adapter = &list->GetScrollAdapter();\n if (adapter && height > 2) {\n auto& pos = list->GetScrollPosition();\n\n \/* these are defaults for drawing to an external view, that\n is, when target != list. *\/\n int xOffset = 0;\n int from = 0, to = height;\n WINDOW* frame = nullptr;\n float range = (float) height;\n size_t minY = 0;\n\n if (!target || target == list) {\n \/* if we're drawing on top of the ListWindow's frame,\n we need to account for the padding it provides. *\/\n frame = list->GetFrame();\n xOffset = list->GetWidth() - 1;\n ++from; --to;\n range -= 2.0f;\n minY = 1;\n }\n else {\n frame = target->GetFrame();\n }\n\n float total = (float) std::max(minY, adapter->GetEntryCount());\n\n int yOffset;\n if (range >= total) {\n yOffset = -1;\n }\n else {\n float percent = (float) pos.logicalIndex \/ total;\n yOffset = (int) (range * percent) + minY;\n }\n\n mvwvline(frame, from, xOffset, 0, to - from);\n mvwaddch(frame, yOffset, xOffset, ' ' | A_REVERSE);\n }\n}\n<|endoftext|>"} {"text":"\/\/ This file is part of the dune-stuff project:\n\/\/ https:\/\/users.dune-project.org\/projects\/dune-stuff\n\/\/ Copyright holders: Rene Milk, Felix Schindler\n\/\/ License: BSD 2-Clause License (http:\/\/opensource.org\/licenses\/BSD-2-Clause)\n\/\/\n\/\/ Contributors: Kirsten Weber\n\n#ifndef DUNE_STUFF_FUNCTIONS_CONSTANT_HH\n#define DUNE_STUFF_FUNCTIONS_CONSTANT_HH\n\n#include \n\n#include \n\n#include \"interfaces.hh\"\n\nnamespace Dune {\nnamespace Stuff {\nnamespace Function {\n\n\ntemplate< class EntityImp, class DomainFieldImp, int domainDim, class RangeFieldImp, int rangeDim, int rangeDimCols = 1 >\nclass Constant\n : public LocalizableFunctionInterface< EntityImp, DomainFieldImp, domainDim, RangeFieldImp, rangeDim, rangeDimCols >\n{\n typedef LocalizableFunctionInterface\n < EntityImp, DomainFieldImp, domainDim, RangeFieldImp, rangeDim, rangeDimCols > BaseType;\n typedef Constant < EntityImp, DomainFieldImp, domainDim, RangeFieldImp, rangeDim, rangeDimCols > ThisType;\n\n class Localfunction\n : public LocalfunctionInterface< EntityImp, DomainFieldImp, domainDim, RangeFieldImp, rangeDim, rangeDimCols >\n {\n typedef LocalfunctionInterface< EntityImp, DomainFieldImp, domainDim, RangeFieldImp, rangeDim, rangeDimCols > BaseType;\n public:\n typedef typename BaseType::EntityType EntityType;\n\n typedef typename BaseType::DomainFieldType DomainFieldType;\n static const unsigned int dimDomain = BaseType::dimDomain;\n typedef typename BaseType::DomainType DomainType;\n\n typedef typename BaseType::RangeFieldType RangeFieldType;\n static const unsigned int dimRange = BaseType::dimRange;\n static const unsigned int dimRangeCols = BaseType::dimRangeCols;\n typedef typename BaseType::RangeType RangeType;\n\n typedef typename BaseType::JacobianRangeType JacobianRangeType;\n\n Localfunction(const EntityType& ent, const std::shared_ptr< const RangeType > value)\n : BaseType(ent)\n , value_(value)\n {}\n\n Localfunction(const Localfunction& \/*other*\/) = delete;\n\n Localfunction& operator=(const Localfunction& \/*other*\/) = delete;\n\n virtual size_t order() const DS_OVERRIDE\n {\n return 0;\n }\n\n virtual void evaluate(const DomainType& xx, RangeType& ret) const DS_OVERRIDE\n {\n assert(this->is_a_valid_point(xx));\n ret = *value_;\n }\n\n virtual void jacobian(const DomainType& xx, JacobianRangeType& ret) const DS_OVERRIDE\n {\n assert(this->is_a_valid_point(xx));\n ret *= RangeFieldType(0);\n }\n\n private:\n const std::shared_ptr< const RangeType > value_;\n }; \/\/ class Localfunction\n\npublic:\n typedef typename BaseType::EntityType EntityType;\n typedef typename BaseType::LocalfunctionType LocalfunctionType;\n\n typedef typename BaseType::DomainFieldType DomainFieldType;\n static const unsigned int dimDomain = BaseType::dimDomain;\n typedef typename BaseType::DomainType DomainType;\n\n typedef typename BaseType::RangeFieldType RangeFieldType;\n static const unsigned int dimRange = BaseType::dimRange;\n static const unsigned int dimRangeCols = BaseType::dimRangeCols;\n typedef typename BaseType::RangeType RangeType;\n\n static std::string static_id()\n {\n return BaseType::static_id() + \".constant\";\n }\n\n static Dune::ParameterTree defaultSettings(const std::string subName = \"\")\n {\n Dune::ParameterTree description;\n description[\"value\"] = \"1.0\";\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 DSC::ExtendedParameterTree settings = defaultSettings())\n {\n return new ThisType(settings.get< RangeFieldType >(\"value\", RangeFieldType(0)));\n } \/\/ ... create(...)\n\n Constant(const RangeFieldType& val, const std::string nm = static_id())\n : value_(std::make_shared< RangeType >(val))\n , name_(nm)\n {}\n\n Constant(const RangeType& val, const std::string nm = static_id())\n : value_(std::make_shared< RangeType >(val))\n , name_(nm)\n {}\n\n Constant(const ThisType& other)\n : value_(other.value_)\n , name_(other.name_)\n {}\n\n ThisType& operator=(const ThisType& other)\n {\n if (this != &other) {\n value_ = other.value_;\n name_ = other.name_;\n }\n return *this;\n }\n\n virtual ThisType* copy() const DS_OVERRIDE\n {\n return new ThisType(*this);\n }\n\n virtual std::string name() const DS_OVERRIDE\n {\n return name_;\n }\n\n virtual std::unique_ptr< LocalfunctionType > local_function(const EntityType& entity) const DS_OVERRIDE\n {\n return std::unique_ptr< Localfunction >(new Localfunction(entity, value_));\n }\n\nprivate:\n std::shared_ptr< const RangeType > value_;\n std::string name_;\n}; \/\/ class Constant\n\n\n} \/\/ namespace Function\n} \/\/ namespace Stuff\n} \/\/ namespace Dune\n\n#ifdef DUNE_STUFF_FUNCTIONS_TO_LIB\n# define DUNE_STUFF_FUNCTIONS_CONSTANT_LIST_DIMRANGE(etype, ddim) \\\n DUNE_STUFF_FUNCTIONS_CONSTANT_LIST_DIMRANGECOLS(etype, ddim, 1) \\\n DUNE_STUFF_FUNCTIONS_CONSTANT_LIST_DIMRANGECOLS(etype, ddim, 2) \\\n DUNE_STUFF_FUNCTIONS_CONSTANT_LIST_DIMRANGECOLS(etype, ddim, 3)\n\n# define DUNE_STUFF_FUNCTIONS_CONSTANT_LIST_DIMRANGECOLS(etype, ddim, rdim) \\\n DUNE_STUFF_FUNCTIONS_CONSTANT_LIST_DOMAINFIELDTYPES(etype, ddim, rdim, 1) \\\n DUNE_STUFF_FUNCTIONS_CONSTANT_LIST_DOMAINFIELDTYPES(etype, ddim, rdim, 2) \\\n DUNE_STUFF_FUNCTIONS_CONSTANT_LIST_DOMAINFIELDTYPES(etype, ddim, rdim, 3)\n\n# define DUNE_STUFF_FUNCTIONS_CONSTANT_LIST_DOMAINFIELDTYPES(etype, ddim, rdim, rcdim) \\\n DUNE_STUFF_FUNCTIONS_CONSTANT_LIST_RANGEFIELDTYPES(etype, double, ddim, rdim, rcdim)\n\n# define DUNE_STUFF_FUNCTIONS_CONSTANT_LIST_RANGEFIELDTYPES(etype, dftype, ddim, rdim, rcdim) \\\n DUNE_STUFF_FUNCTIONS_CONSTANT_LAST_EXPANSION(etype, dftype, ddim, double, rdim, rcdim) \\\n DUNE_STUFF_FUNCTIONS_CONSTANT_LAST_EXPANSION(etype, dftype, ddim, long double, rdim, rcdim)\n\n# define DUNE_STUFF_FUNCTIONS_CONSTANT_LAST_EXPANSION(etype, dftype, ddim, rftype, rdim, rcdim) \\\n extern template class Dune::Stuff::Function::Constant< etype, dftype, ddim, rftype, rdim, rcdim >;\n\nDUNE_STUFF_FUNCTIONS_CONSTANT_LIST_DIMRANGE(DuneStuffFunctionsInterfacesFake1dEntityType, 1)\nDUNE_STUFF_FUNCTIONS_CONSTANT_LIST_DIMRANGE(DuneStuffFunctionsInterfacesFake2dEntityType, 2)\nDUNE_STUFF_FUNCTIONS_CONSTANT_LIST_DIMRANGE(DuneStuffFunctionsInterfacesFake3dEntityType, 3)\n\n# if HAVE_DUNE_GRID\n\nDUNE_STUFF_FUNCTIONS_CONSTANT_LIST_DIMRANGE(DuneStuffFunctionsInterfacesSGrid1dEntityType, 1)\nDUNE_STUFF_FUNCTIONS_CONSTANT_LIST_DIMRANGE(DuneStuffFunctionsInterfacesSGrid2dEntityType, 2)\nDUNE_STUFF_FUNCTIONS_CONSTANT_LIST_DIMRANGE(DuneStuffFunctionsInterfacesSGrid3dEntityType, 3)\n\nDUNE_STUFF_FUNCTIONS_CONSTANT_LIST_DIMRANGE(DuneStuffFunctionsInterfacesYaspGrid1dEntityType, 1)\nDUNE_STUFF_FUNCTIONS_CONSTANT_LIST_DIMRANGE(DuneStuffFunctionsInterfacesYaspGrid2dEntityType, 2)\nDUNE_STUFF_FUNCTIONS_CONSTANT_LIST_DIMRANGE(DuneStuffFunctionsInterfacesYaspGrid3dEntityType, 3)\n\n# if HAVE_ALUGRID_SERIAL_H || HAVE_ALUGRID_PARALLEL_H\n\nDUNE_STUFF_FUNCTIONS_CONSTANT_LIST_DIMRANGE(DuneStuffFunctionsInterfacesAluSimplexGrid2dEntityType, 2)\nDUNE_STUFF_FUNCTIONS_CONSTANT_LIST_DIMRANGE(DuneStuffFunctionsInterfacesAluSimplexGrid3dEntityType, 3)\nDUNE_STUFF_FUNCTIONS_CONSTANT_LIST_DIMRANGE(DuneStuffFunctionsInterfacesAluCubeGrid3dEntityType, 3)\n\n# endif \/\/ HAVE_ALUGRID_SERIAL_H || HAVE_ALUGRID_PARALLEL_H\n# endif \/\/ HAVE_DUNE_GRID\n\n# undef DUNE_STUFF_FUNCTIONS_CONSTANT_LAST_EXPANSION\n# undef DUNE_STUFF_FUNCTIONS_CONSTANT_LIST_RANGEFIELDTYPES\n# undef DUNE_STUFF_FUNCTIONS_CONSTANT_LIST_DOMAINFIELDTYPES\n# undef DUNE_STUFF_FUNCTIONS_CONSTANT_LIST_DIMRANGECOLS\n# undef DUNE_STUFF_FUNCTIONS_CONSTANT_LIST_DIMRANGE\n# endif \/\/ DUNE_STUFF_FUNCTIONS_TO_LIB\n\n#endif \/\/ DUNE_STUFF_FUNCTIONS_CONSTANT_HH\n[functions.constant] updated create()\/\/ This file is part of the dune-stuff project:\n\/\/ https:\/\/users.dune-project.org\/projects\/dune-stuff\n\/\/ Copyright holders: Rene Milk, Felix Schindler\n\/\/ License: BSD 2-Clause License (http:\/\/opensource.org\/licenses\/BSD-2-Clause)\n\/\/\n\/\/ Contributors: Kirsten Weber\n\n#ifndef DUNE_STUFF_FUNCTIONS_CONSTANT_HH\n#define DUNE_STUFF_FUNCTIONS_CONSTANT_HH\n\n#include \n\n#include \n\n#include \"interfaces.hh\"\n\nnamespace Dune {\nnamespace Stuff {\nnamespace Function {\n\n\ntemplate< class EntityImp, class DomainFieldImp, int domainDim, class RangeFieldImp, int rangeDim, int rangeDimCols = 1 >\nclass Constant\n : public LocalizableFunctionInterface< EntityImp, DomainFieldImp, domainDim, RangeFieldImp, rangeDim, rangeDimCols >\n{\n typedef LocalizableFunctionInterface\n < EntityImp, DomainFieldImp, domainDim, RangeFieldImp, rangeDim, rangeDimCols > BaseType;\n typedef Constant < EntityImp, DomainFieldImp, domainDim, RangeFieldImp, rangeDim, rangeDimCols > ThisType;\n\n class Localfunction\n : public LocalfunctionInterface< EntityImp, DomainFieldImp, domainDim, RangeFieldImp, rangeDim, rangeDimCols >\n {\n typedef LocalfunctionInterface< EntityImp, DomainFieldImp, domainDim, RangeFieldImp, rangeDim, rangeDimCols > BaseType;\n public:\n typedef typename BaseType::EntityType EntityType;\n\n typedef typename BaseType::DomainFieldType DomainFieldType;\n static const unsigned int dimDomain = BaseType::dimDomain;\n typedef typename BaseType::DomainType DomainType;\n\n typedef typename BaseType::RangeFieldType RangeFieldType;\n static const unsigned int dimRange = BaseType::dimRange;\n static const unsigned int dimRangeCols = BaseType::dimRangeCols;\n typedef typename BaseType::RangeType RangeType;\n\n typedef typename BaseType::JacobianRangeType JacobianRangeType;\n\n Localfunction(const EntityType& ent, const std::shared_ptr< const RangeType > value)\n : BaseType(ent)\n , value_(value)\n {}\n\n Localfunction(const Localfunction& \/*other*\/) = delete;\n\n Localfunction& operator=(const Localfunction& \/*other*\/) = delete;\n\n virtual size_t order() const DS_OVERRIDE\n {\n return 0;\n }\n\n virtual void evaluate(const DomainType& xx, RangeType& ret) const DS_OVERRIDE\n {\n assert(this->is_a_valid_point(xx));\n ret = *value_;\n }\n\n virtual void jacobian(const DomainType& xx, JacobianRangeType& ret) const DS_OVERRIDE\n {\n assert(this->is_a_valid_point(xx));\n ret *= RangeFieldType(0);\n }\n\n private:\n const std::shared_ptr< const RangeType > value_;\n }; \/\/ class Localfunction\n\npublic:\n typedef typename BaseType::EntityType EntityType;\n typedef typename BaseType::LocalfunctionType LocalfunctionType;\n\n typedef typename BaseType::DomainFieldType DomainFieldType;\n static const unsigned int dimDomain = BaseType::dimDomain;\n typedef typename BaseType::DomainType DomainType;\n\n typedef typename BaseType::RangeFieldType RangeFieldType;\n static const unsigned int dimRange = BaseType::dimRange;\n static const unsigned int dimRangeCols = BaseType::dimRangeCols;\n typedef typename BaseType::RangeType RangeType;\n\n static std::string static_id()\n {\n return BaseType::static_id() + \".constant\";\n }\n\n static Dune::ParameterTree defaultSettings(const std::string subName = \"\")\n {\n Dune::ParameterTree description;\n description[\"value\"] = \"1.0\";\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 DSC::ExtendedParameterTree settings = defaultSettings())\n {\n const DSC::ExtendedParameterTree default_settings = defaultSettings();\n return new ThisType(settings.get(\"value\", default_settings.get< RangeFieldType >(\"value\")),\n settings.get(\"name\", static_id()));\n } \/\/ ... create(...)\n\n Constant(const RangeFieldType& val, const std::string nm = static_id())\n : value_(std::make_shared< RangeType >(val))\n , name_(nm)\n {}\n\n Constant(const RangeType& val, const std::string nm = static_id())\n : value_(std::make_shared< RangeType >(val))\n , name_(nm)\n {}\n\n Constant(const ThisType& other)\n : value_(other.value_)\n , name_(other.name_)\n {}\n\n ThisType& operator=(const ThisType& other)\n {\n if (this != &other) {\n value_ = other.value_;\n name_ = other.name_;\n }\n return *this;\n }\n\n virtual ThisType* copy() const DS_OVERRIDE\n {\n return new ThisType(*this);\n }\n\n virtual std::string name() const DS_OVERRIDE\n {\n return name_;\n }\n\n virtual std::unique_ptr< LocalfunctionType > local_function(const EntityType& entity) const DS_OVERRIDE\n {\n return std::unique_ptr< Localfunction >(new Localfunction(entity, value_));\n }\n\nprivate:\n std::shared_ptr< const RangeType > value_;\n std::string name_;\n}; \/\/ class Constant\n\n\n} \/\/ namespace Function\n} \/\/ namespace Stuff\n} \/\/ namespace Dune\n\n#ifdef DUNE_STUFF_FUNCTIONS_TO_LIB\n# define DUNE_STUFF_FUNCTIONS_CONSTANT_LIST_DIMRANGE(etype, ddim) \\\n DUNE_STUFF_FUNCTIONS_CONSTANT_LIST_DIMRANGECOLS(etype, ddim, 1) \\\n DUNE_STUFF_FUNCTIONS_CONSTANT_LIST_DIMRANGECOLS(etype, ddim, 2) \\\n DUNE_STUFF_FUNCTIONS_CONSTANT_LIST_DIMRANGECOLS(etype, ddim, 3)\n\n# define DUNE_STUFF_FUNCTIONS_CONSTANT_LIST_DIMRANGECOLS(etype, ddim, rdim) \\\n DUNE_STUFF_FUNCTIONS_CONSTANT_LIST_DOMAINFIELDTYPES(etype, ddim, rdim, 1) \\\n DUNE_STUFF_FUNCTIONS_CONSTANT_LIST_DOMAINFIELDTYPES(etype, ddim, rdim, 2) \\\n DUNE_STUFF_FUNCTIONS_CONSTANT_LIST_DOMAINFIELDTYPES(etype, ddim, rdim, 3)\n\n# define DUNE_STUFF_FUNCTIONS_CONSTANT_LIST_DOMAINFIELDTYPES(etype, ddim, rdim, rcdim) \\\n DUNE_STUFF_FUNCTIONS_CONSTANT_LIST_RANGEFIELDTYPES(etype, double, ddim, rdim, rcdim)\n\n# define DUNE_STUFF_FUNCTIONS_CONSTANT_LIST_RANGEFIELDTYPES(etype, dftype, ddim, rdim, rcdim) \\\n DUNE_STUFF_FUNCTIONS_CONSTANT_LAST_EXPANSION(etype, dftype, ddim, double, rdim, rcdim) \\\n DUNE_STUFF_FUNCTIONS_CONSTANT_LAST_EXPANSION(etype, dftype, ddim, long double, rdim, rcdim)\n\n# define DUNE_STUFF_FUNCTIONS_CONSTANT_LAST_EXPANSION(etype, dftype, ddim, rftype, rdim, rcdim) \\\n extern template class Dune::Stuff::Function::Constant< etype, dftype, ddim, rftype, rdim, rcdim >;\n\nDUNE_STUFF_FUNCTIONS_CONSTANT_LIST_DIMRANGE(DuneStuffFunctionsInterfacesFake1dEntityType, 1)\nDUNE_STUFF_FUNCTIONS_CONSTANT_LIST_DIMRANGE(DuneStuffFunctionsInterfacesFake2dEntityType, 2)\nDUNE_STUFF_FUNCTIONS_CONSTANT_LIST_DIMRANGE(DuneStuffFunctionsInterfacesFake3dEntityType, 3)\n\n# if HAVE_DUNE_GRID\n\nDUNE_STUFF_FUNCTIONS_CONSTANT_LIST_DIMRANGE(DuneStuffFunctionsInterfacesSGrid1dEntityType, 1)\nDUNE_STUFF_FUNCTIONS_CONSTANT_LIST_DIMRANGE(DuneStuffFunctionsInterfacesSGrid2dEntityType, 2)\nDUNE_STUFF_FUNCTIONS_CONSTANT_LIST_DIMRANGE(DuneStuffFunctionsInterfacesSGrid3dEntityType, 3)\n\nDUNE_STUFF_FUNCTIONS_CONSTANT_LIST_DIMRANGE(DuneStuffFunctionsInterfacesYaspGrid1dEntityType, 1)\nDUNE_STUFF_FUNCTIONS_CONSTANT_LIST_DIMRANGE(DuneStuffFunctionsInterfacesYaspGrid2dEntityType, 2)\nDUNE_STUFF_FUNCTIONS_CONSTANT_LIST_DIMRANGE(DuneStuffFunctionsInterfacesYaspGrid3dEntityType, 3)\n\n# if HAVE_ALUGRID_SERIAL_H || HAVE_ALUGRID_PARALLEL_H\n\nDUNE_STUFF_FUNCTIONS_CONSTANT_LIST_DIMRANGE(DuneStuffFunctionsInterfacesAluSimplexGrid2dEntityType, 2)\nDUNE_STUFF_FUNCTIONS_CONSTANT_LIST_DIMRANGE(DuneStuffFunctionsInterfacesAluSimplexGrid3dEntityType, 3)\nDUNE_STUFF_FUNCTIONS_CONSTANT_LIST_DIMRANGE(DuneStuffFunctionsInterfacesAluCubeGrid3dEntityType, 3)\n\n# endif \/\/ HAVE_ALUGRID_SERIAL_H || HAVE_ALUGRID_PARALLEL_H\n# endif \/\/ HAVE_DUNE_GRID\n\n# undef DUNE_STUFF_FUNCTIONS_CONSTANT_LAST_EXPANSION\n# undef DUNE_STUFF_FUNCTIONS_CONSTANT_LIST_RANGEFIELDTYPES\n# undef DUNE_STUFF_FUNCTIONS_CONSTANT_LIST_DOMAINFIELDTYPES\n# undef DUNE_STUFF_FUNCTIONS_CONSTANT_LIST_DIMRANGECOLS\n# undef DUNE_STUFF_FUNCTIONS_CONSTANT_LIST_DIMRANGE\n# endif \/\/ DUNE_STUFF_FUNCTIONS_TO_LIB\n\n#endif \/\/ DUNE_STUFF_FUNCTIONS_CONSTANT_HH\n<|endoftext|>"} {"text":"\/**\n * Copyright (c) 2015 - The CM Authors \n * All Rights Reserved.\n *\n * This file is CONFIDENTIAL -- Distribution or duplication of this material or\n * the information contained herein is strictly forbidden unless prior written\n * permission is obtained.\n *\/\n#include \n#include \n#include \n#include \"fnord-base\/io\/filerepository.h\"\n#include \"fnord-base\/io\/fileutil.h\"\n#include \"fnord-base\/application.h\"\n#include \"fnord-base\/logging.h\"\n#include \"fnord-base\/random.h\"\n#include \"fnord-base\/thread\/eventloop.h\"\n#include \"fnord-base\/thread\/threadpool.h\"\n#include \"fnord-base\/wallclock.h\"\n#include \"fnord-rpc\/ServerGroup.h\"\n#include \"fnord-rpc\/RPC.h\"\n#include \"fnord-rpc\/RPCClient.h\"\n#include \"fnord-base\/cli\/flagparser.h\"\n#include \"fnord-json\/json.h\"\n#include \"fnord-json\/jsonrpc.h\"\n#include \"fnord-http\/httprouter.h\"\n#include \"fnord-http\/httpserver.h\"\n#include \"fnord-feeds\/FeedService.h\"\n#include \"fnord-feeds\/RemoteFeedFactory.h\"\n#include \"fnord-feeds\/RemoteFeedReader.h\"\n#include \"fnord-base\/stats\/statsdagent.h\"\n#include \"fnord-http\/httpconnectionpool.h\"\n#include \"fnord-mdb\/MDB.h\"\n#include \n#include \n#include \"CustomerNamespace.h\"\n#include \"logjoin\/LogJoin.h\"\n#include \"logjoin\/LogJoinTarget.h\"\n#include \"logjoin\/LogJoinUpload.h\"\n#include \"logjoin\/LogJoinExport.h\"\n#include \"DocStore.h\"\n#include \"IndexChangeRequest.h\"\n#include \"DocIndex.h\"\n#include \"ItemRef.h\"\n#include \"common.h\"\n#include \"schemas.h\"\n\nusing namespace cm;\nusing namespace fnord;\n\nstd::atomic cm_logjoin_shutdown;\nfnord::thread::EventLoop ev;\n\nvoid quit(int n) {\n cm_logjoin_shutdown = true;\n}\n\nint main(int argc, const char** argv) {\n fnord::Application::init();\n fnord::Application::logToStderr();\n\n \/* shutdown hook *\/\n cm_logjoin_shutdown = false;\n struct sigaction sa;\n memset(&sa, 0, sizeof(struct sigaction));\n sa.sa_handler = quit;\n sigaction(SIGTERM, &sa, NULL);\n sigaction(SIGQUIT, &sa, NULL);\n sigaction(SIGINT, &sa, NULL);\n\n fnord::cli::FlagParser flags;\n\n flags.defineFlag(\n \"conf\",\n cli::FlagParser::T_STRING,\n false,\n NULL,\n \".\/conf\",\n \"conf directory\",\n \"\");\n\n flags.defineFlag(\n \"datadir\",\n cli::FlagParser::T_STRING,\n true,\n NULL,\n NULL,\n \"data dir\",\n \"\");\n\n flags.defineFlag(\n \"index\",\n cli::FlagParser::T_STRING,\n false,\n NULL,\n NULL,\n \"index directory\",\n \"\");\n\n flags.defineFlag(\n \"publish_to\",\n fnord::cli::FlagParser::T_STRING,\n true,\n NULL,\n NULL,\n \"upload target url\",\n \"\");\n\n flags.defineFlag(\n \"statsd_addr\",\n fnord::cli::FlagParser::T_STRING,\n false,\n NULL,\n \"127.0.0.1:8192\",\n \"Statsd addr\",\n \"\");\n\n flags.defineFlag(\n \"batch_size\",\n fnord::cli::FlagParser::T_INTEGER,\n false,\n NULL,\n \"2048\",\n \"batch_size\",\n \"\");\n\n flags.defineFlag(\n \"buffer_size\",\n fnord::cli::FlagParser::T_INTEGER,\n false,\n NULL,\n \"8192\",\n \"buffer_size\",\n \"\");\n\n flags.defineFlag(\n \"flush_interval\",\n fnord::cli::FlagParser::T_INTEGER,\n false,\n NULL,\n \"5\",\n \"flush_interval\",\n \"\");\n\n flags.defineFlag(\n \"db_size\",\n fnord::cli::FlagParser::T_INTEGER,\n false,\n NULL,\n \"128\",\n \"max sessiondb size\",\n \"\");\n\n flags.defineFlag(\n \"no_dryrun\",\n fnord::cli::FlagParser::T_SWITCH,\n false,\n NULL,\n NULL,\n \"no dryrun\",\n \"\");\n\n flags.defineFlag(\n \"shard\",\n fnord::cli::FlagParser::T_STRING,\n false,\n NULL,\n NULL,\n \"shard\",\n \"\");\n\n flags.defineFlag(\n \"loglevel\",\n fnord::cli::FlagParser::T_STRING,\n false,\n NULL,\n \"INFO\",\n \"loglevel\",\n \"\");\n\n flags.parseArgv(argc, argv);\n\n Logger::get()->setMinimumLogLevel(\n strToLogLevel(flags.getString(\"loglevel\")));\n\n \/* schema... *\/\n auto joined_sessions_schema = joinedSessionsSchema();\n\n \/* start event loop *\/\n auto evloop_thread = std::thread([] {\n ev.run();\n });\n\n \/* set up rpc client *\/\n HTTPRPCClient rpc_client(&ev);\n http::HTTPConnectionPool http(&ev);\n\n \/* start stats reporting *\/\n fnord::stats::StatsdAgent statsd_agent(\n fnord::net::InetAddr::resolve(flags.getString(\"statsd_addr\")),\n 10 * fnord::kMicrosPerSecond);\n\n statsd_agent.start();\n\n \/* get logjoin shard *\/\n cm::LogJoinShardMap shard_map;\n auto shard = shard_map.getShard(flags.getString(\"shard\"));\n\n \/* set up logjoin *\/\n auto dry_run = !flags.isSet(\"no_dryrun\");\n size_t batch_size = flags.getInt(\"batch_size\");\n size_t buffer_size = flags.getInt(\"buffer_size\");\n size_t flush_interval = flags.getInt(\"flush_interval\");\n\n fnord::logInfo(\n \"cm.logjoin\",\n \"Starting cm-logjoin with:\\n dry_run=$0\\n batch_size=$1\\n\" \\\n \" buffer_size=$2\\n flush_interval=$9\\n\"\n \" max_dbsize=$4MB\\n\" \\\n \" shard=$5\\n shard_range=[$6, $7)\\n shard_modulo=$8\",\n dry_run,\n batch_size,\n buffer_size,\n 0,\n flags.getInt(\"db_size\"),\n shard.shard_name,\n shard.begin,\n shard.end,\n cm::LogJoinShard::modulo,\n flush_interval);\n\n fnord::logInfo(\n \"cm.logjoin\",\n \"Using session schema:\\n$0\",\n joined_sessions_schema.toString());\n\n \/* open session db *\/\n auto sessdb = mdb::MDB::open(\n flags.getString(\"datadir\"),\n false,\n 1000000 * flags.getInt(\"db_size\"),\n shard.shard_name + \".db\",\n shard.shard_name + \".db.lck\",\n false);\n\n \/* set up input feed reader *\/\n feeds::RemoteFeedReader feed_reader(&rpc_client);\n feed_reader.setMaxSpread(10 * kMicrosPerSecond);\n\n HashMap input_feeds;\n input_feeds.emplace(\n \"tracker_log.feedserver01.nue01.production.fnrd.net\",\n URI(\"http:\/\/s01.nue01.production.fnrd.net:7001\/rpc\"));\n input_feeds.emplace(\n \"tracker_log.feedserver02.nue01.production.fnrd.net\",\n URI(\"http:\/\/s02.nue01.production.fnrd.net:7001\/rpc\"));\n\n input_feeds.emplace(\n \"tracker_log.feedserver03.production.fnrd.net\",\n URI(\"http:\/\/nue03.prod.fnrd.net:7001\/rpc\"));\n\n \/* setup time backfill *\/\n feed_reader.setTimeBackfill([] (const feeds::FeedEntry& entry) -> DateTime {\n const auto& log_line = entry.data;\n\n auto c_end = log_line.find(\"|\");\n if (c_end == std::string::npos) return 0;\n auto t_end = log_line.find(\"|\", c_end + 1);\n if (t_end == std::string::npos) return 0;\n\n auto timestr = log_line.substr(c_end + 1, t_end - c_end - 1);\n return std::stoul(timestr) * fnord::kMicrosPerSecond;\n });\n\n \/* open index *\/\n RefPtr index(\n new DocIndex(\n flags.getString(\"index\"),\n \"documents-dawanda\",\n true));\n\n \/* set up logjoin target *\/\n fnord::fts::Analyzer analyzer(flags.getString(\"conf\"));\n cm::LogJoinTarget logjoin_target(\n joined_sessions_schema,\n dry_run);\n\n auto normalize = [&analyzer] (Language lang, const String& query) -> String {\n return analyzer.normalize(lang, query);\n };\n logjoin_target.setNormalize(normalize);\n logjoin_target.setGetField(std::bind(\n &DocIndex::getField,\n index.get(),\n std::placeholders::_1,\n std::placeholders::_2));\n\n \/* set up logjoin upload *\/\n cm::LogJoinUpload logjoin_upload(\n sessdb,\n flags.getString(\"publish_to\"),\n &http);\n\n cm::LogJoinExport logjoin_export(&http);\n logjoin_upload.onSession(\n std::bind(\n &cm::LogJoinExport::exportSession,\n &logjoin_export,\n std::placeholders::_1));\n\n \/* setup logjoin *\/\n cm::LogJoin logjoin(shard, dry_run, &logjoin_target);\n logjoin.exportStats(\"\/cm-logjoin\/global\");\n logjoin.exportStats(StringUtil::format(\"\/cm-logjoin\/$0\", shard.shard_name));\n\n fnord::stats::Counter stat_stream_time_low;\n fnord::stats::Counter stat_stream_time_high;\n fnord::stats::Counter stat_active_sessions;\n fnord::stats::Counter stat_dbsize;\n\n exportStat(\n StringUtil::format(\"\/cm-logjoin\/$0\/stream_time_low\", shard.shard_name),\n &stat_stream_time_low,\n fnord::stats::ExportMode::EXPORT_VALUE);\n\n exportStat(\n StringUtil::format(\"\/cm-logjoin\/$0\/stream_time_high\", shard.shard_name),\n &stat_stream_time_high,\n fnord::stats::ExportMode::EXPORT_VALUE);\n\n exportStat(\n StringUtil::format(\"\/cm-logjoin\/$0\/active_sessions\", shard.shard_name),\n &stat_active_sessions,\n fnord::stats::ExportMode::EXPORT_VALUE);\n\n exportStat(\n StringUtil::format(\"\/cm-logjoin\/$0\/dbsize\", shard.shard_name),\n &stat_dbsize,\n fnord::stats::ExportMode::EXPORT_VALUE);\n\n\n \/* upload pending q *\/\n if (!dry_run) {\n logjoin_upload.upload();\n }\n\n \/* resume from last offset *\/\n auto txn = sessdb->startTransaction(true);\n try {\n logjoin.importTimeoutList(txn.get());\n\n for (const auto& input_feed : input_feeds) {\n uint64_t offset = 0;\n\n auto last_offset = txn->get(\n StringUtil::format(\"__logjoin_offset~$0\", input_feed.first));\n\n if (!last_offset.isEmpty()) {\n offset = std::stoul(last_offset.get().toString());\n }\n\n fnord::logInfo(\n \"cm.logjoin\",\n \"Adding source feed:\\n feed=$0\\n url=$1\\n offset: $2\",\n input_feed.first,\n input_feed.second.toString(),\n offset);\n\n feed_reader.addSourceFeed(\n input_feed.second,\n input_feed.first,\n offset,\n batch_size,\n buffer_size);\n }\n\n txn->abort();\n } catch (...) {\n txn->abort();\n throw;\n }\n\n fnord::logInfo(\"cm.logjoin\", \"Resuming logjoin...\");\n\n DateTime last_flush;\n uint64_t rate_limit_micros = flush_interval * kMicrosPerSecond;\n\n for (;;) {\n auto begin = WallClock::unixMicros();\n\n feed_reader.fillBuffers();\n auto txn = sessdb->startTransaction();\n\n int i = 0;\n for (; i < batch_size; ++i) {\n auto entry = feed_reader.fetchNextEntry();\n\n if (entry.isEmpty()) {\n break;\n }\n\n try {\n logjoin.insertLogline(entry.get().data, txn.get());\n } catch (const std::exception& e) {\n fnord::logError(\"cm.logjoin\", e, \"invalid log line\");\n }\n }\n\n auto watermarks = feed_reader.watermarks();\n\n auto etime = WallClock::now().unixMicros() - last_flush.unixMicros();\n if (etime > rate_limit_micros) {\n last_flush = WallClock::now();\n logjoin.flush(txn.get(), watermarks.first);\n }\n\n auto stream_offsets = feed_reader.streamOffsets();\n String stream_offsets_str;\n\n for (const auto& soff : stream_offsets) {\n txn->update(\n StringUtil::format(\"__logjoin_offset~$0\", soff.first),\n StringUtil::toString(soff.second));\n\n stream_offsets_str +=\n StringUtil::format(\"\\n offset[$0]=$1\", soff.first, soff.second);\n }\n\n fnord::logInfo(\n \"cm.logjoin\",\n \"LogJoin comitting...\\n stream_time=<$0 ... $1>\\n\" \\\n \" active_sessions=$2\\n flushed_sessions=$3$4\",\n watermarks.first,\n watermarks.second,\n logjoin.numSessions(),\n logjoin_target.num_sessions,\n stream_offsets_str);\n\n if (dry_run) {\n txn->abort();\n } else {\n txn->commit();\n\n try {\n logjoin_upload.upload();\n } catch (const std::exception& e) {\n fnord::logError(\"cm.logjoin\", e, \"upload failed\");\n }\n }\n\n sessdb->removeStaleReaders();\n index->getDBHanndle()->removeStaleReaders();\n\n if (cm_logjoin_shutdown.load()) {\n break;\n }\n\n stat_stream_time_low.set(watermarks.first.unixMicros());\n stat_stream_time_high.set(watermarks.second.unixMicros());\n stat_active_sessions.set(logjoin.numSessions());\n \/\/stat_dbsize.set(FileUtil::du_c(flags.getString(\"datadir\"));\n\n auto rtime = WallClock::unixMicros() - begin;\n auto rlimit = kMicrosPerSecond;\n if (i < 2 && rtime < rlimit) {\n usleep(rlimit - rtime);\n }\n }\n\n ev.shutdown();\n evloop_thread.join();\n\n sessdb->sync();\n fnord::logInfo(\"cm.logjoin\", \"LogJoin exiting...\");\n return 0;\n}\n\nremove feedserver01\/**\n * Copyright (c) 2015 - The CM Authors \n * All Rights Reserved.\n *\n * This file is CONFIDENTIAL -- Distribution or duplication of this material or\n * the information contained herein is strictly forbidden unless prior written\n * permission is obtained.\n *\/\n#include \n#include \n#include \n#include \"fnord-base\/io\/filerepository.h\"\n#include \"fnord-base\/io\/fileutil.h\"\n#include \"fnord-base\/application.h\"\n#include \"fnord-base\/logging.h\"\n#include \"fnord-base\/random.h\"\n#include \"fnord-base\/thread\/eventloop.h\"\n#include \"fnord-base\/thread\/threadpool.h\"\n#include \"fnord-base\/wallclock.h\"\n#include \"fnord-rpc\/ServerGroup.h\"\n#include \"fnord-rpc\/RPC.h\"\n#include \"fnord-rpc\/RPCClient.h\"\n#include \"fnord-base\/cli\/flagparser.h\"\n#include \"fnord-json\/json.h\"\n#include \"fnord-json\/jsonrpc.h\"\n#include \"fnord-http\/httprouter.h\"\n#include \"fnord-http\/httpserver.h\"\n#include \"fnord-feeds\/FeedService.h\"\n#include \"fnord-feeds\/RemoteFeedFactory.h\"\n#include \"fnord-feeds\/RemoteFeedReader.h\"\n#include \"fnord-base\/stats\/statsdagent.h\"\n#include \"fnord-http\/httpconnectionpool.h\"\n#include \"fnord-mdb\/MDB.h\"\n#include \n#include \n#include \"CustomerNamespace.h\"\n#include \"logjoin\/LogJoin.h\"\n#include \"logjoin\/LogJoinTarget.h\"\n#include \"logjoin\/LogJoinUpload.h\"\n#include \"logjoin\/LogJoinExport.h\"\n#include \"DocStore.h\"\n#include \"IndexChangeRequest.h\"\n#include \"DocIndex.h\"\n#include \"ItemRef.h\"\n#include \"common.h\"\n#include \"schemas.h\"\n\nusing namespace cm;\nusing namespace fnord;\n\nstd::atomic cm_logjoin_shutdown;\nfnord::thread::EventLoop ev;\n\nvoid quit(int n) {\n cm_logjoin_shutdown = true;\n}\n\nint main(int argc, const char** argv) {\n fnord::Application::init();\n fnord::Application::logToStderr();\n\n \/* shutdown hook *\/\n cm_logjoin_shutdown = false;\n struct sigaction sa;\n memset(&sa, 0, sizeof(struct sigaction));\n sa.sa_handler = quit;\n sigaction(SIGTERM, &sa, NULL);\n sigaction(SIGQUIT, &sa, NULL);\n sigaction(SIGINT, &sa, NULL);\n\n fnord::cli::FlagParser flags;\n\n flags.defineFlag(\n \"conf\",\n cli::FlagParser::T_STRING,\n false,\n NULL,\n \".\/conf\",\n \"conf directory\",\n \"\");\n\n flags.defineFlag(\n \"datadir\",\n cli::FlagParser::T_STRING,\n true,\n NULL,\n NULL,\n \"data dir\",\n \"\");\n\n flags.defineFlag(\n \"index\",\n cli::FlagParser::T_STRING,\n false,\n NULL,\n NULL,\n \"index directory\",\n \"\");\n\n flags.defineFlag(\n \"publish_to\",\n fnord::cli::FlagParser::T_STRING,\n true,\n NULL,\n NULL,\n \"upload target url\",\n \"\");\n\n flags.defineFlag(\n \"statsd_addr\",\n fnord::cli::FlagParser::T_STRING,\n false,\n NULL,\n \"127.0.0.1:8192\",\n \"Statsd addr\",\n \"\");\n\n flags.defineFlag(\n \"batch_size\",\n fnord::cli::FlagParser::T_INTEGER,\n false,\n NULL,\n \"2048\",\n \"batch_size\",\n \"\");\n\n flags.defineFlag(\n \"buffer_size\",\n fnord::cli::FlagParser::T_INTEGER,\n false,\n NULL,\n \"8192\",\n \"buffer_size\",\n \"\");\n\n flags.defineFlag(\n \"flush_interval\",\n fnord::cli::FlagParser::T_INTEGER,\n false,\n NULL,\n \"5\",\n \"flush_interval\",\n \"\");\n\n flags.defineFlag(\n \"db_size\",\n fnord::cli::FlagParser::T_INTEGER,\n false,\n NULL,\n \"128\",\n \"max sessiondb size\",\n \"\");\n\n flags.defineFlag(\n \"no_dryrun\",\n fnord::cli::FlagParser::T_SWITCH,\n false,\n NULL,\n NULL,\n \"no dryrun\",\n \"\");\n\n flags.defineFlag(\n \"shard\",\n fnord::cli::FlagParser::T_STRING,\n false,\n NULL,\n NULL,\n \"shard\",\n \"\");\n\n flags.defineFlag(\n \"loglevel\",\n fnord::cli::FlagParser::T_STRING,\n false,\n NULL,\n \"INFO\",\n \"loglevel\",\n \"\");\n\n flags.parseArgv(argc, argv);\n\n Logger::get()->setMinimumLogLevel(\n strToLogLevel(flags.getString(\"loglevel\")));\n\n \/* schema... *\/\n auto joined_sessions_schema = joinedSessionsSchema();\n\n \/* start event loop *\/\n auto evloop_thread = std::thread([] {\n ev.run();\n });\n\n \/* set up rpc client *\/\n HTTPRPCClient rpc_client(&ev);\n http::HTTPConnectionPool http(&ev);\n\n \/* start stats reporting *\/\n fnord::stats::StatsdAgent statsd_agent(\n fnord::net::InetAddr::resolve(flags.getString(\"statsd_addr\")),\n 10 * fnord::kMicrosPerSecond);\n\n statsd_agent.start();\n\n \/* get logjoin shard *\/\n cm::LogJoinShardMap shard_map;\n auto shard = shard_map.getShard(flags.getString(\"shard\"));\n\n \/* set up logjoin *\/\n auto dry_run = !flags.isSet(\"no_dryrun\");\n size_t batch_size = flags.getInt(\"batch_size\");\n size_t buffer_size = flags.getInt(\"buffer_size\");\n size_t flush_interval = flags.getInt(\"flush_interval\");\n\n fnord::logInfo(\n \"cm.logjoin\",\n \"Starting cm-logjoin with:\\n dry_run=$0\\n batch_size=$1\\n\" \\\n \" buffer_size=$2\\n flush_interval=$9\\n\"\n \" max_dbsize=$4MB\\n\" \\\n \" shard=$5\\n shard_range=[$6, $7)\\n shard_modulo=$8\",\n dry_run,\n batch_size,\n buffer_size,\n 0,\n flags.getInt(\"db_size\"),\n shard.shard_name,\n shard.begin,\n shard.end,\n cm::LogJoinShard::modulo,\n flush_interval);\n\n fnord::logInfo(\n \"cm.logjoin\",\n \"Using session schema:\\n$0\",\n joined_sessions_schema.toString());\n\n \/* open session db *\/\n auto sessdb = mdb::MDB::open(\n flags.getString(\"datadir\"),\n false,\n 1000000 * flags.getInt(\"db_size\"),\n shard.shard_name + \".db\",\n shard.shard_name + \".db.lck\",\n false);\n\n \/* set up input feed reader *\/\n feeds::RemoteFeedReader feed_reader(&rpc_client);\n feed_reader.setMaxSpread(10 * kMicrosPerSecond);\n\n HashMap input_feeds;\n \/\/input_feeds.emplace(\n \/\/ \"tracker_log.feedserver01.nue01.production.fnrd.net\",\n \/\/ URI(\"http:\/\/s01.nue01.production.fnrd.net:7001\/rpc\"));\n input_feeds.emplace(\n \"tracker_log.feedserver02.nue01.production.fnrd.net\",\n URI(\"http:\/\/s02.nue01.production.fnrd.net:7001\/rpc\"));\n\n input_feeds.emplace(\n \"tracker_log.feedserver03.production.fnrd.net\",\n URI(\"http:\/\/nue03.prod.fnrd.net:7001\/rpc\"));\n\n \/* setup time backfill *\/\n feed_reader.setTimeBackfill([] (const feeds::FeedEntry& entry) -> DateTime {\n const auto& log_line = entry.data;\n\n auto c_end = log_line.find(\"|\");\n if (c_end == std::string::npos) return 0;\n auto t_end = log_line.find(\"|\", c_end + 1);\n if (t_end == std::string::npos) return 0;\n\n auto timestr = log_line.substr(c_end + 1, t_end - c_end - 1);\n return std::stoul(timestr) * fnord::kMicrosPerSecond;\n });\n\n \/* open index *\/\n RefPtr index(\n new DocIndex(\n flags.getString(\"index\"),\n \"documents-dawanda\",\n true));\n\n \/* set up logjoin target *\/\n fnord::fts::Analyzer analyzer(flags.getString(\"conf\"));\n cm::LogJoinTarget logjoin_target(\n joined_sessions_schema,\n dry_run);\n\n auto normalize = [&analyzer] (Language lang, const String& query) -> String {\n return analyzer.normalize(lang, query);\n };\n logjoin_target.setNormalize(normalize);\n logjoin_target.setGetField(std::bind(\n &DocIndex::getField,\n index.get(),\n std::placeholders::_1,\n std::placeholders::_2));\n\n \/* set up logjoin upload *\/\n cm::LogJoinUpload logjoin_upload(\n sessdb,\n flags.getString(\"publish_to\"),\n &http);\n\n cm::LogJoinExport logjoin_export(&http);\n logjoin_upload.onSession(\n std::bind(\n &cm::LogJoinExport::exportSession,\n &logjoin_export,\n std::placeholders::_1));\n\n \/* setup logjoin *\/\n cm::LogJoin logjoin(shard, dry_run, &logjoin_target);\n logjoin.exportStats(\"\/cm-logjoin\/global\");\n logjoin.exportStats(StringUtil::format(\"\/cm-logjoin\/$0\", shard.shard_name));\n\n fnord::stats::Counter stat_stream_time_low;\n fnord::stats::Counter stat_stream_time_high;\n fnord::stats::Counter stat_active_sessions;\n fnord::stats::Counter stat_dbsize;\n\n exportStat(\n StringUtil::format(\"\/cm-logjoin\/$0\/stream_time_low\", shard.shard_name),\n &stat_stream_time_low,\n fnord::stats::ExportMode::EXPORT_VALUE);\n\n exportStat(\n StringUtil::format(\"\/cm-logjoin\/$0\/stream_time_high\", shard.shard_name),\n &stat_stream_time_high,\n fnord::stats::ExportMode::EXPORT_VALUE);\n\n exportStat(\n StringUtil::format(\"\/cm-logjoin\/$0\/active_sessions\", shard.shard_name),\n &stat_active_sessions,\n fnord::stats::ExportMode::EXPORT_VALUE);\n\n exportStat(\n StringUtil::format(\"\/cm-logjoin\/$0\/dbsize\", shard.shard_name),\n &stat_dbsize,\n fnord::stats::ExportMode::EXPORT_VALUE);\n\n\n \/* upload pending q *\/\n if (!dry_run) {\n logjoin_upload.upload();\n }\n\n \/* resume from last offset *\/\n auto txn = sessdb->startTransaction(true);\n try {\n logjoin.importTimeoutList(txn.get());\n\n for (const auto& input_feed : input_feeds) {\n uint64_t offset = 0;\n\n auto last_offset = txn->get(\n StringUtil::format(\"__logjoin_offset~$0\", input_feed.first));\n\n if (!last_offset.isEmpty()) {\n offset = std::stoul(last_offset.get().toString());\n }\n\n fnord::logInfo(\n \"cm.logjoin\",\n \"Adding source feed:\\n feed=$0\\n url=$1\\n offset: $2\",\n input_feed.first,\n input_feed.second.toString(),\n offset);\n\n feed_reader.addSourceFeed(\n input_feed.second,\n input_feed.first,\n offset,\n batch_size,\n buffer_size);\n }\n\n txn->abort();\n } catch (...) {\n txn->abort();\n throw;\n }\n\n fnord::logInfo(\"cm.logjoin\", \"Resuming logjoin...\");\n\n DateTime last_flush;\n uint64_t rate_limit_micros = flush_interval * kMicrosPerSecond;\n\n for (;;) {\n auto begin = WallClock::unixMicros();\n\n feed_reader.fillBuffers();\n auto txn = sessdb->startTransaction();\n\n int i = 0;\n for (; i < batch_size; ++i) {\n auto entry = feed_reader.fetchNextEntry();\n\n if (entry.isEmpty()) {\n break;\n }\n\n try {\n logjoin.insertLogline(entry.get().data, txn.get());\n } catch (const std::exception& e) {\n fnord::logError(\"cm.logjoin\", e, \"invalid log line\");\n }\n }\n\n auto watermarks = feed_reader.watermarks();\n\n auto etime = WallClock::now().unixMicros() - last_flush.unixMicros();\n if (etime > rate_limit_micros) {\n last_flush = WallClock::now();\n logjoin.flush(txn.get(), watermarks.first);\n }\n\n auto stream_offsets = feed_reader.streamOffsets();\n String stream_offsets_str;\n\n for (const auto& soff : stream_offsets) {\n txn->update(\n StringUtil::format(\"__logjoin_offset~$0\", soff.first),\n StringUtil::toString(soff.second));\n\n stream_offsets_str +=\n StringUtil::format(\"\\n offset[$0]=$1\", soff.first, soff.second);\n }\n\n fnord::logInfo(\n \"cm.logjoin\",\n \"LogJoin comitting...\\n stream_time=<$0 ... $1>\\n\" \\\n \" active_sessions=$2\\n flushed_sessions=$3$4\",\n watermarks.first,\n watermarks.second,\n logjoin.numSessions(),\n logjoin_target.num_sessions,\n stream_offsets_str);\n\n if (dry_run) {\n txn->abort();\n } else {\n txn->commit();\n\n try {\n logjoin_upload.upload();\n } catch (const std::exception& e) {\n fnord::logError(\"cm.logjoin\", e, \"upload failed\");\n }\n }\n\n sessdb->removeStaleReaders();\n index->getDBHanndle()->removeStaleReaders();\n\n if (cm_logjoin_shutdown.load()) {\n break;\n }\n\n stat_stream_time_low.set(watermarks.first.unixMicros());\n stat_stream_time_high.set(watermarks.second.unixMicros());\n stat_active_sessions.set(logjoin.numSessions());\n \/\/stat_dbsize.set(FileUtil::du_c(flags.getString(\"datadir\"));\n\n auto rtime = WallClock::unixMicros() - begin;\n auto rlimit = kMicrosPerSecond;\n if (i < 2 && rtime < rlimit) {\n usleep(rlimit - rtime);\n }\n }\n\n ev.shutdown();\n evloop_thread.join();\n\n sessdb->sync();\n fnord::logInfo(\"cm.logjoin\", \"LogJoin exiting...\");\n return 0;\n}\n\n<|endoftext|>"} {"text":"\/*\n Copyright 2017 Larry Gritz and the other authors and contributors.\n All Rights Reserved.\n\n Redistribution and use in source and binary forms, with or without\n modification, are permitted provided that the following conditions are\n met:\n * Redistributions of source code must retain the above copyright\n notice, this list of conditions and the following disclaimer.\n * Redistributions in binary form must reproduce the above copyright\n notice, this list of conditions and the following disclaimer in the\n documentation and\/or other materials provided with the distribution.\n * Neither the name of the software's owners nor the names of its\n contributors may be used to endorse or promote products derived from\n this software without specific prior written permission.\n THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS\n \"AS IS\" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT\n LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR\n A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT\n OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,\n SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT\n LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,\n DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY\n THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT\n (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE\n OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.\n\n (This is the Modified BSD License)\n*\/\n\n\n#include \n#include \n\n#include \n#include \n#include \n#include \n#include \"imageio_pvt.h\"\n\n\n\nOIIO_PLUGIN_NAMESPACE_BEGIN\n\n\n\/\/ Null output just sits there like a lump and returns ok for everything.\nclass NullOutput final : public ImageOutput {\npublic:\n NullOutput () { }\n virtual ~NullOutput () { }\n virtual const char * format_name (void) const override { return \"null\"; }\n virtual int supports (string_view feature) const override { return true; }\n virtual bool open (const std::string &name, const ImageSpec &spec,\n OpenMode mode=Create) override {\n m_spec = spec;\n return true;\n }\n virtual bool close () override { return true; }\n virtual bool write_scanline (int y, int z, TypeDesc format,\n const void *data, stride_t xstride) override {\n return true;\n }\n virtual bool write_tile (int x, int y, int z, TypeDesc format,\n const void *data, stride_t xstride,\n stride_t ystride, stride_t zstride) override {\n return true;\n }\n};\n\n\n\n\n\/\/ Null input emulates a file, but just returns black tiles.\n\/\/ But we accept REST-like filename designations to set certain parameters,\n\/\/ such as \"myfile.null&RES=1920x1080&CHANNELS=3&TYPE=uint16\"\nclass NullInput final : public ImageInput {\npublic:\n NullInput () { init(); }\n virtual ~NullInput () { }\n virtual const char * format_name (void) const override { return \"null\"; }\n virtual bool valid_file (const std::string &filename) const override;\n virtual int supports (string_view feature) const override { return true; }\n virtual bool open (const std::string &name, ImageSpec &newspec) override;\n virtual bool open (const std::string &name, ImageSpec &newspec,\n const ImageSpec &config) override;\n virtual bool close () override { return true; }\n virtual int current_subimage (void) const override { return m_subimage; }\n virtual int current_miplevel (void) const override { return m_miplevel; }\n virtual bool seek_subimage (int subimage, int miplevel) override;\n virtual bool read_native_scanline (int subimage, int miplevel,\n int y, int z, void *data) override;\n virtual bool read_native_tile (int subimage, int miplevel,\n int x, int y, int z, void *data) override;\n\nprivate:\n std::string m_filename; \/\/\/< Stash the filename\n int m_subimage; \/\/\/< What subimage are we looking at?\n int m_miplevel; \/\/\/< What miplevel are we looking at?\n bool m_mip; \/\/\/< MIP-mapped?\n std::vector m_value; \/\/\/< Pixel value (if not black)\n ImageSpec m_topspec;\n\n \/\/ Reset everything to initial state\n void init () {\n m_subimage = -1;\n m_miplevel = -1;\n m_mip = false;\n m_value.clear ();\n }\n};\n\n\n\n\/\/ Obligatory material to make this a recognizeable imageio plugin:\nOIIO_PLUGIN_EXPORTS_BEGIN\n\nOIIO_EXPORT ImageOutput *null_output_imageio_create () {\n return new NullOutput;\n}\n\nOIIO_EXPORT int null_imageio_version = OIIO_PLUGIN_VERSION;\n\nOIIO_EXPORT const char* null_imageio_library_version () {\n return \"null 1.0\";\n}\n\nOIIO_EXPORT const char * null_output_extensions[] = {\n \"null\", \"nul\", nullptr\n};\n\nOIIO_EXPORT ImageInput *null_input_imageio_create () {\n return new NullInput;\n}\n\nOIIO_EXPORT const char * null_input_extensions[] = {\n \"null\", \"nul\", nullptr\n};\n\nOIIO_PLUGIN_EXPORTS_END\n\n\n\n\nbool\nNullInput::valid_file (const std::string &name) const\n{\n std::map args;\n std::string filename;\n if (! Strutil::get_rest_arguments (name, filename, args))\n return false;\n return Strutil::ends_with (filename, \".null\") ||\n Strutil::ends_with (filename, \".nul\");\n}\n\n\n\nbool\nNullInput::open (const std::string &name, ImageSpec &newspec)\n{\n ImageSpec config;\n return open (name, newspec, config);\n}\n\n\n\nstatic void\nparse_res (string_view res, int &x, int &y, int &z)\n{\n if (Strutil::parse_int (res, x)) {\n if (Strutil::parse_char (res, 'x') &&\n Strutil::parse_int (res, y)) {\n if (! (Strutil::parse_char(res, 'x') &&\n Strutil::parse_int(res, z)))\n z = 1;\n } else {\n y = x;\n z = 1;\n }\n }\n}\n\n\n\n\/\/ Add the attribute -- figure out the type\nvoid\nparse_param (string_view paramname, string_view val, ImageSpec &spec)\n{\n TypeDesc type; \/\/ start out unknown\n\n \/\/ If the param string starts with a type name, that's what it is\n if (size_t typeportion = type.fromstring (paramname)) {\n paramname.remove_prefix (typeportion);\n Strutil::skip_whitespace (paramname);\n }\n \/\/ If the value string starts with a type name, that's what it is\n else if (size_t typeportion = type.fromstring (val)) {\n val.remove_prefix (typeportion);\n Strutil::skip_whitespace (val);\n }\n\n if (type.basetype == TypeDesc::UNKNOWN) {\n \/\/ If we didn't find a type name, try to guess\n if (val.size() >= 2 && val.front() == '\\\"' && val.back() == '\\\"') {\n \/\/ Surrounded by quotes? it's a string (strip off the quotes)\n val.remove_prefix(1); val.remove_suffix(1);\n type = TypeDesc::TypeString;\n } else if (Strutil::string_is(val)) {\n \/\/ Looks like an int, is an int\n type = TypeDesc::TypeInt;\n } else if (Strutil::string_is(val)) {\n \/\/ Looks like a float, is a float\n type = TypeDesc::TypeFloat;\n } else {\n \/\/ Everything else is assumed a string\n type = TypeDesc::TypeString;\n }\n }\n\n \/\/ Read the values and set the attribute\n int n = type.numelements() * type.aggregate;\n if (type.basetype == TypeDesc::INT) {\n std::vector values (n);\n for (int i = 0; i < n; ++i) {\n Strutil::parse_int (val, values[i]);\n Strutil::parse_char (val, ','); \/\/ optional\n }\n if (n > 0)\n spec.attribute (paramname, type, &values[0]);\n }\n if (type.basetype == TypeDesc::FLOAT) {\n std::vector values (n);\n for (int i = 0; i < n; ++i) {\n Strutil::parse_float (val, values[i]);\n Strutil::parse_char (val, ','); \/\/ optional\n }\n if (n > 0)\n spec.attribute (paramname, type, &values[0]);\n } else if (type.basetype == TypeDesc::STRING) {\n std::vector values (n);\n for (int i = 0; i < n; ++i) {\n string_view v;\n Strutil::parse_string (val, v);\n Strutil::parse_char (val, ','); \/\/ optional\n values[i] = v;\n }\n if (n > 0)\n spec.attribute (paramname, type, &values[0]);\n }\n}\n\n\n\nbool\nNullInput::open (const std::string &name, ImageSpec &newspec,\n const ImageSpec &config)\n{\n m_filename = name;\n m_subimage = -1;\n m_miplevel = -1;\n m_mip = false;\n m_topspec = config;\n\n \/\/ std::vector > args;\n \/\/ string_view filename = deconstruct_uri (name, &args);\n std::map args;\n std::string filename;\n if (! Strutil::get_rest_arguments (name, filename, args))\n return false;\n if (filename.empty())\n return false;\n\n \/\/ To keep the \"null\" input reader from reading from ANY name, only\n \/\/ succeed if it ends in \".null\" or \".nul\" --OR-- if the config has a\n \/\/ special override \"null:force\" set to nonzero (that lets the caller\n \/\/ guarantee a null input even if the name has no extension, say).\n if (! Strutil::ends_with (filename, \".null\") &&\n ! Strutil::ends_with (filename, \".nul\") &&\n config.get_int_attribute(\"null:force\") == 0)\n return false;\n\n \/\/ Override the config with default resolution if it was not set\n if (m_topspec.width <= 0)\n m_topspec.width = 1024;\n if (m_topspec.height <= 0)\n m_topspec.height = 1024;\n if (m_topspec.depth <= 0)\n m_topspec.depth = 1;\n if (m_topspec.nchannels <= 0)\n m_topspec.nchannels = 4;\n if (m_topspec.format == TypeUnknown)\n m_topspec.format = TypeFloat;\n\n m_filename = filename;\n std::vector fvalue;\n\n for (const auto& a : args) {\n if (a.first == \"RES\") {\n parse_res (a.second, m_topspec.width, m_topspec.height, m_topspec.depth);\n } else if (a.first == \"TILE\" || a.first == \"TILES\") {\n parse_res (a.second, m_topspec.tile_width, m_topspec.tile_height,\n m_topspec.tile_depth);\n } else if (a.first == \"CHANNELS\") {\n m_topspec.nchannels = Strutil::from_string(a.second);\n } else if (a.first == \"MIP\") {\n m_mip = Strutil::from_string(a.second);\n } else if (a.first == \"TEX\") {\n if (Strutil::from_string(a.second)) {\n if (!m_spec.tile_width) {\n m_topspec.tile_width = 64;\n m_topspec.tile_height = 64;\n m_topspec.tile_depth = 1;\n }\n m_topspec.attribute (\"wrapmodes\", \"black,black\");\n m_topspec.attribute (\"textureformat\", \"Plain Texture\");\n m_mip = true;\n }\n } else if (a.first == \"TYPE\") {\n m_topspec.set_format (TypeDesc(a.second));\n } else if (a.first == \"PIXEL\") {\n Strutil::extract_from_list_string (fvalue, a.second);\n fvalue.resize (m_topspec.nchannels);\n } else if (a.first.size() && a.second.size()) {\n parse_param (a.first, a.second, m_topspec);\n }\n }\n\n m_topspec.default_channel_names ();\n m_topspec.full_x = m_topspec.x;\n m_topspec.full_y = m_topspec.y;\n m_topspec.full_z = m_topspec.z;\n m_topspec.full_width = m_topspec.width;\n m_topspec.full_height = m_topspec.height;\n m_topspec.full_depth = m_topspec.depth;\n\n if (fvalue.size()) {\n \/\/ Convert float to the native type\n fvalue.resize (m_topspec.nchannels, 0.0f);\n m_value.resize (m_topspec.pixel_bytes());\n convert_types (TypeFloat, fvalue.data(),\n m_topspec.format, m_value.data(),\n m_topspec.nchannels);\n }\n\n bool ok = seek_subimage (0, 0);\n newspec = spec();\n return ok;\n}\n\n\n\nbool\nNullInput::seek_subimage (int subimage, int miplevel)\n{\n if (subimage == current_subimage() && miplevel == current_miplevel()) {\n return true;\n }\n\n if (subimage != 0)\n return false; \/\/ We only make one subimage\n m_subimage = subimage;\n\n if (miplevel > 0 && ! m_mip)\n return false; \/\/ Asked for MIP levels but we aren't makign them\n\n m_spec = m_topspec;\n for (m_miplevel = 0; m_miplevel < miplevel; ++m_miplevel) {\n if (m_spec.width == 1 && m_spec.height == 1 && m_spec.depth == 1)\n return false; \/\/ Asked for more MIP levels than were available\n m_spec.width = std::max (1, m_spec.width\/2);\n m_spec.height = std::max (1, m_spec.height\/2);\n m_spec.depth = std::max (1, m_spec.depth\/2);\n m_spec.full_width = m_spec.width;\n m_spec.full_height = m_spec.height;\n m_spec.full_depth = m_spec.depth;\n }\n return true;\n}\n\n\n\nbool\nNullInput::read_native_scanline (int subimage, int miplevel,\n int y, int z, void *data)\n{\n if (m_value.size()) {\n size_t s = m_spec.pixel_bytes();\n for (int x = 0; x < m_spec.width; ++x)\n memcpy ((char *)data + s*x, m_value.data(), s);\n } else {\n memset (data, 0, m_spec.scanline_bytes());\n }\n return true;\n}\n\n\n\nbool\nNullInput::read_native_tile (int subimage, int miplevel,\n int x, int y, int z, void *data)\n{\n if (m_value.size()) {\n size_t s = m_spec.pixel_bytes();\n for (size_t x = 0, e = m_spec.tile_pixels(); x < e; ++x)\n memcpy ((char *)data + s*x, m_value.data(), s);\n } else {\n memset (data, 0, m_spec.tile_bytes());\n }\n return true;\n}\n\n\nOIIO_PLUGIN_NAMESPACE_END\n\nnull input reader: be more careful with \"full\" (display) size (#2042)\/*\n Copyright 2017 Larry Gritz and the other authors and contributors.\n All Rights Reserved.\n\n Redistribution and use in source and binary forms, with or without\n modification, are permitted provided that the following conditions are\n met:\n * Redistributions of source code must retain the above copyright\n notice, this list of conditions and the following disclaimer.\n * Redistributions in binary form must reproduce the above copyright\n notice, this list of conditions and the following disclaimer in the\n documentation and\/or other materials provided with the distribution.\n * Neither the name of the software's owners nor the names of its\n contributors may be used to endorse or promote products derived from\n this software without specific prior written permission.\n THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS\n \"AS IS\" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT\n LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR\n A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT\n OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,\n SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT\n LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,\n DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY\n THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT\n (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE\n OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.\n\n (This is the Modified BSD License)\n*\/\n\n\n#include \n#include \n\n#include \n#include \n#include \n#include \n#include \"imageio_pvt.h\"\n\n\n\nOIIO_PLUGIN_NAMESPACE_BEGIN\n\n\n\/\/ Null output just sits there like a lump and returns ok for everything.\nclass NullOutput final : public ImageOutput {\npublic:\n NullOutput () { }\n virtual ~NullOutput () { }\n virtual const char * format_name (void) const override { return \"null\"; }\n virtual int supports (string_view feature) const override { return true; }\n virtual bool open (const std::string &name, const ImageSpec &spec,\n OpenMode mode=Create) override {\n m_spec = spec;\n return true;\n }\n virtual bool close () override { return true; }\n virtual bool write_scanline (int y, int z, TypeDesc format,\n const void *data, stride_t xstride) override {\n return true;\n }\n virtual bool write_tile (int x, int y, int z, TypeDesc format,\n const void *data, stride_t xstride,\n stride_t ystride, stride_t zstride) override {\n return true;\n }\n};\n\n\n\n\n\/\/ Null input emulates a file, but just returns black tiles.\n\/\/ But we accept REST-like filename designations to set certain parameters,\n\/\/ such as \"myfile.null&RES=1920x1080&CHANNELS=3&TYPE=uint16\"\nclass NullInput final : public ImageInput {\npublic:\n NullInput () { init(); }\n virtual ~NullInput () { }\n virtual const char * format_name (void) const override { return \"null\"; }\n virtual bool valid_file (const std::string &filename) const override;\n virtual int supports (string_view feature) const override { return true; }\n virtual bool open (const std::string &name, ImageSpec &newspec) override;\n virtual bool open (const std::string &name, ImageSpec &newspec,\n const ImageSpec &config) override;\n virtual bool close () override { return true; }\n virtual int current_subimage (void) const override { return m_subimage; }\n virtual int current_miplevel (void) const override { return m_miplevel; }\n virtual bool seek_subimage (int subimage, int miplevel) override;\n virtual bool read_native_scanline (int subimage, int miplevel,\n int y, int z, void *data) override;\n virtual bool read_native_tile (int subimage, int miplevel,\n int x, int y, int z, void *data) override;\n\nprivate:\n std::string m_filename; \/\/\/< Stash the filename\n int m_subimage; \/\/\/< What subimage are we looking at?\n int m_miplevel; \/\/\/< What miplevel are we looking at?\n bool m_mip; \/\/\/< MIP-mapped?\n std::vector m_value; \/\/\/< Pixel value (if not black)\n ImageSpec m_topspec;\n\n \/\/ Reset everything to initial state\n void init () {\n m_subimage = -1;\n m_miplevel = -1;\n m_mip = false;\n m_value.clear ();\n }\n};\n\n\n\n\/\/ Obligatory material to make this a recognizeable imageio plugin:\nOIIO_PLUGIN_EXPORTS_BEGIN\n\nOIIO_EXPORT ImageOutput *null_output_imageio_create () {\n return new NullOutput;\n}\n\nOIIO_EXPORT int null_imageio_version = OIIO_PLUGIN_VERSION;\n\nOIIO_EXPORT const char* null_imageio_library_version () {\n return \"null 1.0\";\n}\n\nOIIO_EXPORT const char * null_output_extensions[] = {\n \"null\", \"nul\", nullptr\n};\n\nOIIO_EXPORT ImageInput *null_input_imageio_create () {\n return new NullInput;\n}\n\nOIIO_EXPORT const char * null_input_extensions[] = {\n \"null\", \"nul\", nullptr\n};\n\nOIIO_PLUGIN_EXPORTS_END\n\n\n\n\nbool\nNullInput::valid_file (const std::string &name) const\n{\n std::map args;\n std::string filename;\n if (! Strutil::get_rest_arguments (name, filename, args))\n return false;\n return Strutil::ends_with (filename, \".null\") ||\n Strutil::ends_with (filename, \".nul\");\n}\n\n\n\nbool\nNullInput::open (const std::string &name, ImageSpec &newspec)\n{\n ImageSpec config;\n return open (name, newspec, config);\n}\n\n\n\nstatic void\nparse_res (string_view res, int &x, int &y, int &z)\n{\n if (Strutil::parse_int (res, x)) {\n if (Strutil::parse_char (res, 'x') &&\n Strutil::parse_int (res, y)) {\n if (! (Strutil::parse_char(res, 'x') &&\n Strutil::parse_int(res, z)))\n z = 1;\n } else {\n y = x;\n z = 1;\n }\n }\n}\n\n\n\n\/\/ Add the attribute -- figure out the type\nvoid\nparse_param (string_view paramname, string_view val, ImageSpec &spec)\n{\n TypeDesc type; \/\/ start out unknown\n\n \/\/ If the param string starts with a type name, that's what it is\n if (size_t typeportion = type.fromstring (paramname)) {\n paramname.remove_prefix (typeportion);\n Strutil::skip_whitespace (paramname);\n }\n \/\/ If the value string starts with a type name, that's what it is\n else if (size_t typeportion = type.fromstring (val)) {\n val.remove_prefix (typeportion);\n Strutil::skip_whitespace (val);\n }\n\n if (type.basetype == TypeDesc::UNKNOWN) {\n \/\/ If we didn't find a type name, try to guess\n if (val.size() >= 2 && val.front() == '\\\"' && val.back() == '\\\"') {\n \/\/ Surrounded by quotes? it's a string (strip off the quotes)\n val.remove_prefix(1); val.remove_suffix(1);\n type = TypeDesc::TypeString;\n } else if (Strutil::string_is(val)) {\n \/\/ Looks like an int, is an int\n type = TypeDesc::TypeInt;\n } else if (Strutil::string_is(val)) {\n \/\/ Looks like a float, is a float\n type = TypeDesc::TypeFloat;\n } else {\n \/\/ Everything else is assumed a string\n type = TypeDesc::TypeString;\n }\n }\n\n \/\/ Read the values and set the attribute\n int n = type.numelements() * type.aggregate;\n if (type.basetype == TypeDesc::INT) {\n std::vector values (n);\n for (int i = 0; i < n; ++i) {\n Strutil::parse_int (val, values[i]);\n Strutil::parse_char (val, ','); \/\/ optional\n }\n if (n > 0)\n spec.attribute (paramname, type, &values[0]);\n }\n if (type.basetype == TypeDesc::FLOAT) {\n std::vector values (n);\n for (int i = 0; i < n; ++i) {\n Strutil::parse_float (val, values[i]);\n Strutil::parse_char (val, ','); \/\/ optional\n }\n if (n > 0)\n spec.attribute (paramname, type, &values[0]);\n } else if (type.basetype == TypeDesc::STRING) {\n std::vector values (n);\n for (int i = 0; i < n; ++i) {\n string_view v;\n Strutil::parse_string (val, v);\n Strutil::parse_char (val, ','); \/\/ optional\n values[i] = v;\n }\n if (n > 0)\n spec.attribute (paramname, type, &values[0]);\n }\n}\n\n\n\nbool\nNullInput::open (const std::string &name, ImageSpec &newspec,\n const ImageSpec &config)\n{\n m_filename = name;\n m_subimage = -1;\n m_miplevel = -1;\n m_mip = false;\n m_topspec = config;\n\n \/\/ std::vector > args;\n \/\/ string_view filename = deconstruct_uri (name, &args);\n std::map args;\n std::string filename;\n if (! Strutil::get_rest_arguments (name, filename, args))\n return false;\n if (filename.empty())\n return false;\n\n \/\/ To keep the \"null\" input reader from reading from ANY name, only\n \/\/ succeed if it ends in \".null\" or \".nul\" --OR-- if the config has a\n \/\/ special override \"null:force\" set to nonzero (that lets the caller\n \/\/ guarantee a null input even if the name has no extension, say).\n if (! Strutil::ends_with (filename, \".null\") &&\n ! Strutil::ends_with (filename, \".nul\") &&\n config.get_int_attribute(\"null:force\") == 0)\n return false;\n\n \/\/ Override the config with default resolution if it was not set\n if (m_topspec.width <= 0)\n m_topspec.width = 1024;\n if (m_topspec.height <= 0)\n m_topspec.height = 1024;\n if (m_topspec.depth <= 0)\n m_topspec.depth = 1;\n if (m_topspec.full_width <= 0)\n m_topspec.full_width = m_topspec.width;\n if (m_topspec.full_height <= 0)\n m_topspec.full_height = m_topspec.height;\n if (m_topspec.full_depth <= 0)\n m_topspec.full_depth = m_topspec.depth;\n if (m_topspec.nchannels <= 0)\n m_topspec.nchannels = 4;\n if (m_topspec.format == TypeUnknown)\n m_topspec.format = TypeFloat;\n\n m_filename = filename;\n std::vector fvalue;\n\n for (const auto& a : args) {\n if (a.first == \"RES\") {\n parse_res (a.second, m_topspec.width, m_topspec.height, m_topspec.depth);\n m_topspec.full_x = m_topspec.x;\n m_topspec.full_y = m_topspec.y;\n m_topspec.full_z = m_topspec.z;\n m_topspec.full_width = m_topspec.width;\n m_topspec.full_height = m_topspec.height;\n m_topspec.full_depth = m_topspec.depth;\n } else if (a.first == \"TILE\" || a.first == \"TILES\") {\n parse_res (a.second, m_topspec.tile_width, m_topspec.tile_height,\n m_topspec.tile_depth);\n } else if (a.first == \"CHANNELS\") {\n m_topspec.nchannels = Strutil::from_string(a.second);\n m_topspec.default_channel_names ();\n } else if (a.first == \"MIP\") {\n m_mip = Strutil::from_string(a.second);\n } else if (a.first == \"TEX\") {\n if (Strutil::from_string(a.second)) {\n if (!m_spec.tile_width) {\n m_topspec.tile_width = 64;\n m_topspec.tile_height = 64;\n m_topspec.tile_depth = 1;\n }\n m_topspec.attribute (\"wrapmodes\", \"black,black\");\n m_topspec.attribute (\"textureformat\", \"Plain Texture\");\n m_mip = true;\n }\n } else if (a.first == \"TYPE\") {\n m_topspec.set_format (TypeDesc(a.second));\n } else if (a.first == \"PIXEL\") {\n Strutil::extract_from_list_string (fvalue, a.second);\n fvalue.resize (m_topspec.nchannels);\n } else if (a.first.size() && a.second.size()) {\n parse_param (a.first, a.second, m_topspec);\n }\n }\n\n if (fvalue.size()) {\n \/\/ Convert float to the native type\n fvalue.resize (m_topspec.nchannels, 0.0f);\n m_value.resize (m_topspec.pixel_bytes());\n convert_types (TypeFloat, fvalue.data(),\n m_topspec.format, m_value.data(),\n m_topspec.nchannels);\n }\n\n bool ok = seek_subimage (0, 0);\n newspec = spec();\n return ok;\n}\n\n\n\nbool\nNullInput::seek_subimage (int subimage, int miplevel)\n{\n if (subimage == current_subimage() && miplevel == current_miplevel()) {\n return true;\n }\n\n if (subimage != 0)\n return false; \/\/ We only make one subimage\n m_subimage = subimage;\n\n if (miplevel > 0 && ! m_mip)\n return false; \/\/ Asked for MIP levels but we aren't makign them\n\n m_spec = m_topspec;\n for (m_miplevel = 0; m_miplevel < miplevel; ++m_miplevel) {\n if (m_spec.width == 1 && m_spec.height == 1 && m_spec.depth == 1)\n return false; \/\/ Asked for more MIP levels than were available\n m_spec.width = std::max (1, m_spec.width\/2);\n m_spec.height = std::max (1, m_spec.height\/2);\n m_spec.depth = std::max (1, m_spec.depth\/2);\n m_spec.full_width = m_spec.width;\n m_spec.full_height = m_spec.height;\n m_spec.full_depth = m_spec.depth;\n }\n return true;\n}\n\n\n\nbool\nNullInput::read_native_scanline (int subimage, int miplevel,\n int y, int z, void *data)\n{\n if (m_value.size()) {\n size_t s = m_spec.pixel_bytes();\n for (int x = 0; x < m_spec.width; ++x)\n memcpy ((char *)data + s*x, m_value.data(), s);\n } else {\n memset (data, 0, m_spec.scanline_bytes());\n }\n return true;\n}\n\n\n\nbool\nNullInput::read_native_tile (int subimage, int miplevel,\n int x, int y, int z, void *data)\n{\n if (m_value.size()) {\n size_t s = m_spec.pixel_bytes();\n for (size_t x = 0, e = m_spec.tile_pixels(); x < e; ++x)\n memcpy ((char *)data + s*x, m_value.data(), s);\n } else {\n memset (data, 0, m_spec.tile_bytes());\n }\n return true;\n}\n\n\nOIIO_PLUGIN_NAMESPACE_END\n\n<|endoftext|>"} {"text":"\/* bzflag\n * Copyright (c) 1993 - 2004 Tim Riker\n *\n * This package is free software; you can redistribute it and\/or\n * modify it under the terms of the license found in the file\n * named COPYING that should have accompanied this file.\n *\n * THIS PACKAGE IS PROVIDED ``AS IS'' AND WITHOUT ANY EXPRESS OR\n * IMPLIED WARRANTIES, INCLUDING, WITHOUT LIMITATION, THE IMPLIED\n * WARRANTIES OF MERCHANTIBILITY AND FITNESS FOR A PARTICULAR PURPOSE.\n *\/\n\n#include \n#include \"common.h\"\n#include \"global.h\"\n#include \"PyramidBuilding.h\"\n#include \"Intersect.h\"\n#include \"TriWallSceneNode.h\"\n#include \"QuadWallSceneNode.h\"\n#include \"BZDBCache.h\"\n#include \"PyramidSceneNodeGenerator.h\"\n\nstd::string\t\tPyramidBuilding::typeName(\"PyramidBuilding\");\n\nPyramidBuilding::PyramidBuilding(const float* p, float a,\n\t\t\t\tfloat w, float b, float h, bool drive, bool shoot) :\n\t\t\t\tObstacle(p, a, w, b, h,drive,shoot)\n{\n \/\/ do nothing\n}\n\nPyramidBuilding::~PyramidBuilding()\n{\n \/\/ do nothing\n}\n\nstd::string\t\tPyramidBuilding::getType() const\n{\n return typeName;\n}\n\nstd::string\t\tPyramidBuilding::getClassName() \/\/ const\n{\n return typeName;\n}\n\nfloat\t\t\tPyramidBuilding::intersect(const Ray& r) const\n{\n return timeRayHitsPyramids(r, getPosition(), getRotation(),\n\t\t\t getWidth(), getBreadth(), getHeight(),\n\t\t\t getZFlip());\n}\n\nvoid\t\t\tPyramidBuilding::getNormal(const float* p,\n\t\t\t\t\t\t\tfloat* n) const\n{\n \/\/ get normal in z = const plane\n const float s = shrinkFactor(p[2]);\n getNormalRect(p, getPosition(), getRotation(),\n\t\t\ts * getWidth(), s * getBreadth(), n);\n\n \/\/ make sure we are not way above or way below it\n \/\/ above is good so we can drive on it when it's fliped\n float top = getPosition()[2]+getHeight();\n float bottom = getPosition()[2];\n\n if (s ==0){\n\t if (this->getZFlip()){\n\t\t if (p[2] >= top){\n\t\t\t n[0] = n[1] = 0;\n\t\t\t n[2] = 1;\n\t\t\t return;\n\t\t }\n\t }else{\n\t\t if (p[2] <= bottom){\n\t\t\t n[0] = n[1] = 0;\n\t\t\t n[2] = -1;\n\t\t\t return;\n\t\t }\n\t }\n }\n\n \/\/ now angle it due to slope of wall\n \/\/ FIXME -- this assumes the pyramid has a square base!\n const float h = 1.0f \/ hypotf(getHeight(), getWidth());\n n[0] *= h * getHeight();\n n[1] *= h * getHeight();\n n[2] = h * getWidth();\n\n if (this->getZFlip())\n\t n[2] *= -1;\n}\n\nvoid\t\t\tPyramidBuilding::get3DNormal(const float* p,\n\t\t\t\t\t\t float* n) const\n{\n const float epsilon = ZERO_TOLERANCE;\n\n \/\/ get normal in z = const plane\n const float s = shrinkFactor(p[2]);\n getNormalRect(p, getPosition(), getRotation(),\n\t\ts * getWidth(), s * getBreadth(), n);\n\n \/\/ make sure we are not way above or way below it\n \/\/ above is good so we can drive on it when it's fliped\n float top = getPosition()[2]+getHeight();\n float bottom = getPosition()[2];\n\n if (s == 0) {\n if (getZFlip()) {\n if (p[2] >= top) {\n\tn[0] = n[1] = 0;\n\tn[2] = 1;\n\treturn;\n }\n } else {\n if (p[2] <= bottom) {\n\tn[0] = n[1] = 0;\n\tn[2] = -1;\n\treturn;\n }\n }\n }\n\n if (s >= 1.0f - epsilon) {\n n[0] = n[1] = 0;\n if (getZFlip()) {\n n[2] = 1;\n } else {\n n[2] = -1;\n }\n return;\n }\n\n \/\/ now angle it due to slope of wall\n \/\/ FIXME -- this assumes the pyramid has a square base!\n const float h = 1.0f \/ hypotf(getHeight(), getWidth());\n n[0] *= h * getHeight();\n n[1] *= h * getHeight();\n n[2] = h * getWidth();\n\n if (this->getZFlip())\n n[2] *= -1;\n}\n\nbool\t\t\tPyramidBuilding::isInside(const float* p,\n\t\t\t\t\t\tfloat radius) const\n{\n \/\/ really rough -- doesn't decrease size with height\n return (p[2] <= getHeight())\n && ((p[2]+BZDBCache::tankHeight) >= getPosition()[2])\n && testRectCircle(getPosition(), getRotation(), getWidth(), getBreadth(), p, radius);\n}\n\nbool\t\t\tPyramidBuilding::isInside(const float* p, float a,\n\t\t\t\t\t\tfloat dx, float dy) const\n{\n \/\/ Tank is below pyramid ?\n if (p[2] + BZDBCache::tankHeight < getPosition()[2])\n return false;\n \/\/ Tank is above pyramid ?\n if (p[2] > getPosition()[2] + getHeight())\n return false;\n \/\/ Could be inside. Then check collision with the rectangle at object height\n \/\/ This is a rectangle reduced by shrinking but pass the height that we are\n \/\/ not so sure where collision can be\n const float s = shrinkFactor(p[2], BZDBCache::tankHeight);\n return testRectRect(getPosition(), getRotation(),\n\t\t s * getWidth(), s * getBreadth(), p, a, dx, dy);\n}\n\nbool\t\t\tPyramidBuilding::isCrossing(const float* p, float a,\n\t\t\t\t\tfloat dx, float dy, float* plane) const\n{\n \/\/ if not inside or contained then not crossing\n if (!isInside(p, a, dx, dy) ||\n\ttestRectInRect(getPosition(), getRotation(),\n\t\t\tgetWidth(), getBreadth(), p, a, dx, dy))\n return false;\n if (!plane) return true;\n\n \/\/ it's crossing -- choose which wall is being crossed (this\n \/\/ is a guestimate, should really do a careful test). just\n \/\/ see which wall the point is closest to.\n const float* p2 = getPosition();\n const float a2 = getRotation();\n const float c = cosf(-a2), s = sinf(-a2);\n const float x = c * (p[0] - p2[0]) - s * (p[1] - p2[1]);\n const float y = c * (p[1] - p2[1]) + s * (p[0] - p2[0]);\n float pw[2];\n if (fabsf(fabsf(x) - getWidth()) < fabsf(fabsf(y) - getBreadth())) {\n plane[0] = ((x < 0.0) ? -cosf(a2) : cosf(a2));\n plane[1] = ((x < 0.0) ? -sinf(a2) : sinf(a2));\n pw[0] = p2[0] + getWidth() * plane[0];\n pw[1] = p2[1] + getWidth() * plane[1];\n }\n else {\n plane[0] = ((y < 0.0) ? sinf(a2) : -sinf(a2));\n plane[1] = ((y < 0.0) ? -cosf(a2) : cosf(a2));\n pw[0] = p2[0] + getBreadth() * plane[0];\n pw[1] = p2[1] + getBreadth() * plane[1];\n }\n\n \/\/ now finish off plane equation (FIXME -- assumes a square base)\n const float h = 1.0f \/ hypotf(getHeight(), getWidth());\n plane[0] *= h * getHeight();\n plane[1] *= h * getHeight();\n plane[2] = h * getWidth();\n plane[3] = -(plane[0] * pw[0] + plane[1] * pw[1]);\n return true;\n}\n\nbool\t\t\tPyramidBuilding::getHitNormal(\n\t\t\t\tconst float* pos1, float,\n\t\t\t\tconst float* pos2, float,\n\t\t\t\tfloat, float, float height,\n\t\t\t\tfloat* normal) const\n{\n \/\/ pyramids height and flipping\n \/\/ normalize height sign and report that in flip\n float oHeight = getHeight();\n bool flip = getZFlip();\n if (oHeight < 0) {\n flip = !flip;\n oHeight = -oHeight;\n }\n\n \/\/ get Bottom and Top of building\n float oBottom = getPosition()[2];\n float oTop = oBottom + oHeight;\n\n \/\/ get higher and lower point of base of colliding object\n float objHigh = pos1[2];\n float objLow = pos2[2];\n if (objHigh < objLow) {\n float temp = objHigh;\n objHigh = objLow;\n objLow = temp;\n }\n\n normal[0] = normal[1] = 0;\n if (flip && objHigh > oTop) {\n \/\/ base of higher object is over the plateau\n normal[2] = 1;\n return true;\n } else if (!flip && objLow + height < oBottom) {\n \/\/ top of lower object is below the base\n normal[2] = -1;\n return true;\n }\n\n \/\/ get normal in z = const plane\n const float s = shrinkFactor(pos1[2], height);\n\n getNormalRect(pos1, getPosition(), getRotation(),\n\t\ts * getWidth(), s * getBreadth(), normal);\n\n \/\/ now angle it due to slope of wall\n \/\/ FIXME -- this assumes the pyramid has a square base!\n const float h = 1.0f \/ hypotf(oHeight, getWidth());\n normal[0] *= h * oHeight;\n normal[1] *= h * oHeight;\n normal[2] = h * getWidth();\n\n if (flip)\n normal[2] = -normal[2];\n return true;\n}\n\nObstacleSceneNodeGenerator*\tPyramidBuilding::newSceneNodeGenerator() const\n{\n return new PyramidSceneNodeGenerator(this);\n}\n\nvoid\t\t\tPyramidBuilding::getCorner(int index,\n\t\t\t\t\t\tfloat* pos) const\n{\n const float* base = getPosition();\n const float c = cosf(getRotation());\n const float s = sinf(getRotation());\n const float w = getWidth();\n const float h = getBreadth();\n const float top = getHeight() + base[2];\n switch (index) {\n case 0:\n pos[0] = base[0] + c * w - s * h;\n pos[1] = base[1] + s * w + c * h;\n\t if (getZFlip())\n\t\t pos[2] = top;\n\t else\n\t\t pos[2] = base[2];\n break;\n case 1:\n pos[0] = base[0] - c * w - s * h;\n pos[1] = base[1] - s * w + c * h;\n\t if (getZFlip())\n\t\t pos[2] = top;\n\t else\n\t\t pos[2] = base[2];\n break;\n case 2:\n pos[0] = base[0] - c * w + s * h;\n pos[1] = base[1] - s * w - c * h;\n\t if (getZFlip())\n\t\t pos[2] = top;\n\t else\n\t\t pos[2] = base[2];\n break;\n case 3:\n pos[0] = base[0] + c * w + s * h;\n pos[1] = base[1] + s * w - c * h;\n\t if (getZFlip())\n\t\t pos[2] = top;\n\t else\n\t\t pos[2] = base[2];\n break;\n case 4:\n pos[0] = base[0];\n pos[1] = base[1];\n\t if (getZFlip())\n\t\t pos[2] = base[2];\n\t else\n\t\t pos[2] = top;\n break;\n }\n}\n\nfloat\t\t\tPyramidBuilding::shrinkFactor(float z,\n\t\t\t\t\t\t float height) const\n{\n float shrink;\n\n \/\/ Normalize Height and flip to have height > 0\n float oHeight = getHeight();\n bool flip = getZFlip();\n if (oHeight < 0) {\n flip = !flip;\n oHeight = - oHeight;\n }\n\n \/\/ Remove heights bias\n const float *pos = getPosition();\n z -= pos[2];\n if (oHeight <= ZERO_TOLERANCE) {\n shrink = 1.0f;\n } else {\n \/\/ Normalize heights\n z \/= oHeight;\n\n \/\/ if flipped the bigger intersection is at top of the object\n if (flip) {\n \/\/ Normalize the object height, we have not done yet\n z += height \/ oHeight;\n }\n\n \/\/ shrink is that\n if (flip) {\n shrink = z;\n } else {\n shrink = 1.0f - z;\n }\n }\n\n \/\/ clamp in 0 .. 1\n if (shrink < 0.0)\n shrink = 0.0;\n else if (shrink > 1.0)\n shrink = 1.0;\n\n return shrink;\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\nFixing stuck on flipped pyramids\/* bzflag\n * Copyright (c) 1993 - 2004 Tim Riker\n *\n * This package is free software; you can redistribute it and\/or\n * modify it under the terms of the license found in the file\n * named COPYING that should have accompanied this file.\n *\n * THIS PACKAGE IS PROVIDED ``AS IS'' AND WITHOUT ANY EXPRESS OR\n * IMPLIED WARRANTIES, INCLUDING, WITHOUT LIMITATION, THE IMPLIED\n * WARRANTIES OF MERCHANTIBILITY AND FITNESS FOR A PARTICULAR PURPOSE.\n *\/\n\n#include \n#include \"common.h\"\n#include \"global.h\"\n#include \"PyramidBuilding.h\"\n#include \"Intersect.h\"\n#include \"TriWallSceneNode.h\"\n#include \"QuadWallSceneNode.h\"\n#include \"BZDBCache.h\"\n#include \"PyramidSceneNodeGenerator.h\"\n\nstd::string\t\tPyramidBuilding::typeName(\"PyramidBuilding\");\n\nPyramidBuilding::PyramidBuilding(const float* p, float a,\n\t\t\t\tfloat w, float b, float h, bool drive, bool shoot) :\n\t\t\t\tObstacle(p, a, w, b, h,drive,shoot)\n{\n \/\/ do nothing\n}\n\nPyramidBuilding::~PyramidBuilding()\n{\n \/\/ do nothing\n}\n\nstd::string\t\tPyramidBuilding::getType() const\n{\n return typeName;\n}\n\nstd::string\t\tPyramidBuilding::getClassName() \/\/ const\n{\n return typeName;\n}\n\nfloat\t\t\tPyramidBuilding::intersect(const Ray& r) const\n{\n return timeRayHitsPyramids(r, getPosition(), getRotation(),\n\t\t\t getWidth(), getBreadth(), getHeight(),\n\t\t\t getZFlip());\n}\n\nvoid\t\t\tPyramidBuilding::getNormal(const float* p,\n\t\t\t\t\t\t\tfloat* n) const\n{\n \/\/ get normal in z = const plane\n const float s = shrinkFactor(p[2]);\n getNormalRect(p, getPosition(), getRotation(),\n\t\t\ts * getWidth(), s * getBreadth(), n);\n\n \/\/ make sure we are not way above or way below it\n \/\/ above is good so we can drive on it when it's fliped\n float top = getPosition()[2]+getHeight();\n float bottom = getPosition()[2];\n\n if (s ==0){\n\t if (this->getZFlip()){\n\t\t if (p[2] >= top){\n\t\t\t n[0] = n[1] = 0;\n\t\t\t n[2] = 1;\n\t\t\t return;\n\t\t }\n\t }else{\n\t\t if (p[2] <= bottom){\n\t\t\t n[0] = n[1] = 0;\n\t\t\t n[2] = -1;\n\t\t\t return;\n\t\t }\n\t }\n }\n\n \/\/ now angle it due to slope of wall\n \/\/ FIXME -- this assumes the pyramid has a square base!\n const float h = 1.0f \/ hypotf(getHeight(), getWidth());\n n[0] *= h * getHeight();\n n[1] *= h * getHeight();\n n[2] = h * getWidth();\n\n if (this->getZFlip())\n\t n[2] *= -1;\n}\n\nvoid\t\t\tPyramidBuilding::get3DNormal(const float* p,\n\t\t\t\t\t\t float* n) const\n{\n const float epsilon = ZERO_TOLERANCE;\n\n \/\/ get normal in z = const plane\n const float s = shrinkFactor(p[2]);\n getNormalRect(p, getPosition(), getRotation(),\n\t\ts * getWidth(), s * getBreadth(), n);\n\n \/\/ make sure we are not way above or way below it\n \/\/ above is good so we can drive on it when it's fliped\n float top = getPosition()[2]+getHeight();\n float bottom = getPosition()[2];\n\n if (s == 0) {\n if (getZFlip()) {\n if (p[2] >= top) {\n\tn[0] = n[1] = 0;\n\tn[2] = 1;\n\treturn;\n }\n } else {\n if (p[2] <= bottom) {\n\tn[0] = n[1] = 0;\n\tn[2] = -1;\n\treturn;\n }\n }\n }\n\n if (s >= 1.0f - epsilon) {\n n[0] = n[1] = 0;\n if (getZFlip()) {\n n[2] = 1;\n } else {\n n[2] = -1;\n }\n return;\n }\n\n \/\/ now angle it due to slope of wall\n \/\/ FIXME -- this assumes the pyramid has a square base!\n const float h = 1.0f \/ hypotf(getHeight(), getWidth());\n n[0] *= h * getHeight();\n n[1] *= h * getHeight();\n n[2] = h * getWidth();\n\n if (this->getZFlip())\n n[2] *= -1;\n}\n\nbool\t\t\tPyramidBuilding::isInside(const float* p,\n\t\t\t\t\t\tfloat radius) const\n{\n \/\/ really rough -- doesn't decrease size with height\n return (p[2] <= getHeight())\n && ((p[2]+BZDBCache::tankHeight) >= getPosition()[2])\n && testRectCircle(getPosition(), getRotation(), getWidth(), getBreadth(), p, radius);\n}\n\nbool\t\t\tPyramidBuilding::isInside(const float* p, float a,\n\t\t\t\t\t\tfloat dx, float dy) const\n{\n \/\/ Tank is below pyramid ?\n if (p[2] + BZDBCache::tankHeight < getPosition()[2])\n return false;\n \/\/ Tank is above pyramid ?\n if (p[2] >= getPosition()[2] + getHeight())\n return false;\n \/\/ Could be inside. Then check collision with the rectangle at object height\n \/\/ This is a rectangle reduced by shrinking but pass the height that we are\n \/\/ not so sure where collision can be\n const float s = shrinkFactor(p[2], BZDBCache::tankHeight);\n return testRectRect(getPosition(), getRotation(),\n\t\t s * getWidth(), s * getBreadth(), p, a, dx, dy);\n}\n\nbool\t\t\tPyramidBuilding::isCrossing(const float* p, float a,\n\t\t\t\t\tfloat dx, float dy, float* plane) const\n{\n \/\/ if not inside or contained then not crossing\n if (!isInside(p, a, dx, dy) ||\n\ttestRectInRect(getPosition(), getRotation(),\n\t\t\tgetWidth(), getBreadth(), p, a, dx, dy))\n return false;\n if (!plane) return true;\n\n \/\/ it's crossing -- choose which wall is being crossed (this\n \/\/ is a guestimate, should really do a careful test). just\n \/\/ see which wall the point is closest to.\n const float* p2 = getPosition();\n const float a2 = getRotation();\n const float c = cosf(-a2), s = sinf(-a2);\n const float x = c * (p[0] - p2[0]) - s * (p[1] - p2[1]);\n const float y = c * (p[1] - p2[1]) + s * (p[0] - p2[0]);\n float pw[2];\n if (fabsf(fabsf(x) - getWidth()) < fabsf(fabsf(y) - getBreadth())) {\n plane[0] = ((x < 0.0) ? -cosf(a2) : cosf(a2));\n plane[1] = ((x < 0.0) ? -sinf(a2) : sinf(a2));\n pw[0] = p2[0] + getWidth() * plane[0];\n pw[1] = p2[1] + getWidth() * plane[1];\n }\n else {\n plane[0] = ((y < 0.0) ? sinf(a2) : -sinf(a2));\n plane[1] = ((y < 0.0) ? -cosf(a2) : cosf(a2));\n pw[0] = p2[0] + getBreadth() * plane[0];\n pw[1] = p2[1] + getBreadth() * plane[1];\n }\n\n \/\/ now finish off plane equation (FIXME -- assumes a square base)\n const float h = 1.0f \/ hypotf(getHeight(), getWidth());\n plane[0] *= h * getHeight();\n plane[1] *= h * getHeight();\n plane[2] = h * getWidth();\n plane[3] = -(plane[0] * pw[0] + plane[1] * pw[1]);\n return true;\n}\n\nbool\t\t\tPyramidBuilding::getHitNormal(\n\t\t\t\tconst float* pos1, float,\n\t\t\t\tconst float* pos2, float,\n\t\t\t\tfloat, float, float height,\n\t\t\t\tfloat* normal) const\n{\n \/\/ pyramids height and flipping\n \/\/ normalize height sign and report that in flip\n float oHeight = getHeight();\n bool flip = getZFlip();\n if (oHeight < 0) {\n flip = !flip;\n oHeight = -oHeight;\n }\n\n \/\/ get Bottom and Top of building\n float oBottom = getPosition()[2];\n float oTop = oBottom + oHeight;\n\n \/\/ get higher and lower point of base of colliding object\n float objHigh = pos1[2];\n float objLow = pos2[2];\n if (objHigh < objLow) {\n float temp = objHigh;\n objHigh = objLow;\n objLow = temp;\n }\n\n normal[0] = normal[1] = 0;\n if (flip && objHigh >= oTop) {\n \/\/ base of higher object is over the plateau\n normal[2] = 1;\n return true;\n } else if (!flip && objLow + height < oBottom) {\n \/\/ top of lower object is below the base\n normal[2] = -1;\n return true;\n }\n\n \/\/ get normal in z = const plane\n const float s = shrinkFactor(pos1[2], height);\n\n getNormalRect(pos1, getPosition(), getRotation(),\n\t\ts * getWidth(), s * getBreadth(), normal);\n\n \/\/ now angle it due to slope of wall\n \/\/ FIXME -- this assumes the pyramid has a square base!\n const float h = 1.0f \/ hypotf(oHeight, getWidth());\n normal[0] *= h * oHeight;\n normal[1] *= h * oHeight;\n normal[2] = h * getWidth();\n\n if (flip)\n normal[2] = -normal[2];\n return true;\n}\n\nObstacleSceneNodeGenerator*\tPyramidBuilding::newSceneNodeGenerator() const\n{\n return new PyramidSceneNodeGenerator(this);\n}\n\nvoid\t\t\tPyramidBuilding::getCorner(int index,\n\t\t\t\t\t\tfloat* pos) const\n{\n const float* base = getPosition();\n const float c = cosf(getRotation());\n const float s = sinf(getRotation());\n const float w = getWidth();\n const float h = getBreadth();\n const float top = getHeight() + base[2];\n switch (index) {\n case 0:\n pos[0] = base[0] + c * w - s * h;\n pos[1] = base[1] + s * w + c * h;\n\t if (getZFlip())\n\t\t pos[2] = top;\n\t else\n\t\t pos[2] = base[2];\n break;\n case 1:\n pos[0] = base[0] - c * w - s * h;\n pos[1] = base[1] - s * w + c * h;\n\t if (getZFlip())\n\t\t pos[2] = top;\n\t else\n\t\t pos[2] = base[2];\n break;\n case 2:\n pos[0] = base[0] - c * w + s * h;\n pos[1] = base[1] - s * w - c * h;\n\t if (getZFlip())\n\t\t pos[2] = top;\n\t else\n\t\t pos[2] = base[2];\n break;\n case 3:\n pos[0] = base[0] + c * w + s * h;\n pos[1] = base[1] + s * w - c * h;\n\t if (getZFlip())\n\t\t pos[2] = top;\n\t else\n\t\t pos[2] = base[2];\n break;\n case 4:\n pos[0] = base[0];\n pos[1] = base[1];\n\t if (getZFlip())\n\t\t pos[2] = base[2];\n\t else\n\t\t pos[2] = top;\n break;\n }\n}\n\nfloat\t\t\tPyramidBuilding::shrinkFactor(float z,\n\t\t\t\t\t\t float height) const\n{\n float shrink;\n\n \/\/ Normalize Height and flip to have height > 0\n float oHeight = getHeight();\n bool flip = getZFlip();\n if (oHeight < 0) {\n flip = !flip;\n oHeight = - oHeight;\n }\n\n \/\/ Remove heights bias\n const float *pos = getPosition();\n z -= pos[2];\n if (oHeight <= ZERO_TOLERANCE) {\n shrink = 1.0f;\n } else {\n \/\/ Normalize heights\n z \/= oHeight;\n\n \/\/ if flipped the bigger intersection is at top of the object\n if (flip) {\n \/\/ Normalize the object height, we have not done yet\n z += height \/ oHeight;\n }\n\n \/\/ shrink is that\n if (flip) {\n shrink = z;\n } else {\n shrink = 1.0f - z;\n }\n }\n\n \/\/ clamp in 0 .. 1\n if (shrink < 0.0)\n shrink = 0.0;\n else if (shrink > 1.0)\n shrink = 1.0;\n\n return shrink;\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":"#include \"animation.h\"\n\n#include \n\nAnimation::Animation(std::string object, int duration) :\n _object(object), _duration(duration), _easing(LINEAR)\n{\n}\n\n\n\nAnimation::Easing Animation::strToEasing(std::string s)\n{\n if (s == \"LINEAR\")\n return LINEAR;\n if (s == \"IN_QUAD\")\n return IN_QUAD;\n if (s == \"OUT_QUAD\")\n return OUT_QUAD;\n if (s == \"IN_OUT_QUAD\")\n return IN_OUT_QUAD;\n if (s == \"IN_BACK\")\n return IN_BACK;\n if (s == \"OUT_BACK\")\n return OUT_BACK;\n if (s == \"IN_OUT_BACK\")\n return IN_OUT_BACK;\n if (s == \"IN_ELASTIC\")\n return IN_ELASTIC;\n if (s == \"OUT_ELASTIC\")\n return OUT_ELASTIC;\n if (s == \"IN_OUT_ELASTIC\")\n return IN_OUT_ELASTIC;\n else\n return UNDEFINED;\n}\n\nstd::string Animation::object() const\n{\n return _object;\n}\n\nint Animation::duration() const\n{\n return _duration;\n}\n\nvoid Animation::setEasing(const Easing easing)\n{\n _easing = easing;\n}\n\nvoid Animation::addProperty(const std::string name, const float from, const float to)\n{\n AnimProperty p;\n p.property = name;\n p.from = from;\n p.to = to;\n addProperty(p);\n}\n\nvoid Animation::addProperty(AnimProperty p)\n{\n properties.push_back(p);\n}\n\nstd::map Animation::getStatus(int millisecond_elapsed)\n{\n float progress = relativeProgress(millisecond_elapsed);\n std::map res;\n std::vector::iterator i;\n for (i = properties.begin(); i != properties.end(); ++i){\n res[(*i).property] = (*i).from + (float((*i).to - (*i).from) * progress);\n }\n return res;\n}\n\nfloat Animation::relativeProgress(int millisecond_elapsed)\n{\n float progress = float(millisecond_elapsed)\/float(_duration);\n if (progress > 1.0)\n progress = 1.0;\n switch (_easing){\n case UNDEFINED:\n {\n return 1.0;\n }\n case LINEAR:\n {\n return progress;\n }\n case IN_QUAD:\n {\n return progress * progress;\n }\n case OUT_QUAD:\n {\n return -1.0 * progress * (progress - 2.0);\n }\n case IN_OUT_QUAD:\n {\n float p = progress * 2;\n if (p < 1)\n return 0.5 * p * p;\n p -= 1.0;\n return -0.5 * (p * (p - 2.0) - 1.0);\n }\n case IN_BACK:\n {\n return progress * progress * ((1.70158 + 1.0) * progress - 1.70158);\n }\n case OUT_BACK:\n {\n float p = progress - 1.0;\n return p * p * ((1.70158 + 1) * p + 1.70158) + 1.0;\n }\n case IN_OUT_BACK:\n {\n float p = progress * 2.0;\n float s = 1.70158 * 1.525;\n if (p < 1)\n return 0.5 * (p * p * ((s + 1.0) * p - s));\n p -= 2.0;\n return 0.5 * (p * p * ((s + 1.0) * p + s) + 2.0);\n }\n case IN_ELASTIC:\n {\n float p = 0.3;\n float s = p \/ 4.0;\n float q = progress;\n if (q == 1)\n return 1.0;\n q -= 1.0;\n return -(pow(2, 10 * q) * sin((q - s) * (2 * M_PI) \/ p));\n }\n case OUT_ELASTIC:\n {\n float p = 0.3;\n float s = p \/ 4.0;\n float q = progress;\n if (q == 1)\n return 1.0;\n return pow(2, -10 * q) * sin((q - s) * (2 * M_PI) \/ p) + 1.0;\n }\n case IN_OUT_ELASTIC:\n {\n float p = 0.3 * 1.5;\n float s = p \/ 4.0;\n float q = progress * 2;\n if (q == 2)\n return 1.0;\n float qq = q - 1.0;\n if (q < 1)\n return -0.5 * (pow(2, 10 * qq) * sin((qq - s) * (2.0 * M_PI) \/ p));\n return pow(2, -10 * qq) * sin((qq - s) * (2.0 * M_PI) \/ p) * 0.5 + 1.0;\n }\n }\n return 1.0;\n}\nUse cmath instead of math.h#include \"animation.h\"\n\n#include \n\nAnimation::Animation(std::string object, int duration) :\n _object(object), _duration(duration), _easing(LINEAR)\n{\n}\n\n\n\nAnimation::Easing Animation::strToEasing(std::string s)\n{\n if (s == \"LINEAR\")\n return LINEAR;\n if (s == \"IN_QUAD\")\n return IN_QUAD;\n if (s == \"OUT_QUAD\")\n return OUT_QUAD;\n if (s == \"IN_OUT_QUAD\")\n return IN_OUT_QUAD;\n if (s == \"IN_BACK\")\n return IN_BACK;\n if (s == \"OUT_BACK\")\n return OUT_BACK;\n if (s == \"IN_OUT_BACK\")\n return IN_OUT_BACK;\n if (s == \"IN_ELASTIC\")\n return IN_ELASTIC;\n if (s == \"OUT_ELASTIC\")\n return OUT_ELASTIC;\n if (s == \"IN_OUT_ELASTIC\")\n return IN_OUT_ELASTIC;\n else\n return UNDEFINED;\n}\n\nstd::string Animation::object() const\n{\n return _object;\n}\n\nint Animation::duration() const\n{\n return _duration;\n}\n\nvoid Animation::setEasing(const Easing easing)\n{\n _easing = easing;\n}\n\nvoid Animation::addProperty(const std::string name, const float from, const float to)\n{\n AnimProperty p;\n p.property = name;\n p.from = from;\n p.to = to;\n addProperty(p);\n}\n\nvoid Animation::addProperty(AnimProperty p)\n{\n properties.push_back(p);\n}\n\nstd::map Animation::getStatus(int millisecond_elapsed)\n{\n float progress = relativeProgress(millisecond_elapsed);\n std::map res;\n std::vector::iterator i;\n for (i = properties.begin(); i != properties.end(); ++i){\n res[(*i).property] = (*i).from + (float((*i).to - (*i).from) * progress);\n }\n return res;\n}\n\nfloat Animation::relativeProgress(int millisecond_elapsed)\n{\n float progress = float(millisecond_elapsed)\/float(_duration);\n if (progress > 1.0)\n progress = 1.0;\n switch (_easing){\n case UNDEFINED:\n {\n return 1.0;\n }\n case LINEAR:\n {\n return progress;\n }\n case IN_QUAD:\n {\n return progress * progress;\n }\n case OUT_QUAD:\n {\n return -1.0 * progress * (progress - 2.0);\n }\n case IN_OUT_QUAD:\n {\n float p = progress * 2;\n if (p < 1)\n return 0.5 * p * p;\n p -= 1.0;\n return -0.5 * (p * (p - 2.0) - 1.0);\n }\n case IN_BACK:\n {\n return progress * progress * ((1.70158 + 1.0) * progress - 1.70158);\n }\n case OUT_BACK:\n {\n float p = progress - 1.0;\n return p * p * ((1.70158 + 1) * p + 1.70158) + 1.0;\n }\n case IN_OUT_BACK:\n {\n float p = progress * 2.0;\n float s = 1.70158 * 1.525;\n if (p < 1)\n return 0.5 * (p * p * ((s + 1.0) * p - s));\n p -= 2.0;\n return 0.5 * (p * p * ((s + 1.0) * p + s) + 2.0);\n }\n case IN_ELASTIC:\n {\n float p = 0.3;\n float s = p \/ 4.0;\n float q = progress;\n if (q == 1)\n return 1.0;\n q -= 1.0;\n return -(pow(2, 10 * q) * sin((q - s) * (2 * M_PI) \/ p));\n }\n case OUT_ELASTIC:\n {\n float p = 0.3;\n float s = p \/ 4.0;\n float q = progress;\n if (q == 1)\n return 1.0;\n return pow(2, -10 * q) * sin((q - s) * (2 * M_PI) \/ p) + 1.0;\n }\n case IN_OUT_ELASTIC:\n {\n float p = 0.3 * 1.5;\n float s = p \/ 4.0;\n float q = progress * 2;\n if (q == 2)\n return 1.0;\n float qq = q - 1.0;\n if (q < 1)\n return -0.5 * (pow(2, 10 * qq) * sin((qq - s) * (2.0 * M_PI) \/ p));\n return pow(2, -10 * qq) * sin((qq - s) * (2.0 * M_PI) \/ p) * 0.5 + 1.0;\n }\n }\n return 1.0;\n}\n<|endoftext|>"} {"text":"\/*\n(c) Matthew Slocum 2015\n\nmsgComponent.cpp \n\nmsgComponent is resbonaible for sending and revieving messages\n upon creation it spins off a thread to listen for incoming messages.\n the parent process takes input from the user and executes commands or sends messages.\n\n*\/\n\n#include \n#include \n#include \n#include \n#include \n#include \"msgComponent.h\"\n#include \"regComponent.h\"\n#include \"secComponent.h\"\n\nusing namespace std;\nusing boost::asio::ip::tcp;\n\nmsgComponent::msgComponent() {\n \n}\n\n\/\/Code derived from:\n\/\/ daytime_server.cpp\n\/\/ ~~~~~~~~~~~~~~~~~~\n\/\/\n\/\/ Copyright (c) 2003-2015 Christopher M. Kohlhoff (chris at kohlhoff dot com)\n\/\/\n\/\/ Distributed under the Boost Software License, Version 1.0. (See\n\/\/ at http:\/\/www.boost.org\/LICENSE_1_0.txt)\n\n\/\/Function for listener thread\n\/\/This fucntion listens for incoming connections, recieves a message, decrypts it and displays it.\nvoid* listen(void *threadid) {\n try\n {\n extern regComponent* reg;\n extern secComponent* sec;\n boost::asio::io_service io_service;\n tcp::endpoint endpoint(tcp::v4(), 6283);\n tcp::acceptor acceptor(io_service, endpoint);\n for (;;)\n {\n tcp::iostream stream;\n boost::system::error_code ec;\n acceptor.accept(*stream.rdbuf(), ec);\n \/\/if the is an incomming connection\n if (!ec)\n { \n string message = \"\";\n string line; \n char c;\n char msg [1034];\n int msg_count=0; \n \/\/get message\n while(stream.get(c)) { \n msg[msg_count++]=c;\n } \n \/\/make holder for plaintext\n char plaintext[msg_count]; \n \/\/decrypt message and store in plaintext\n sec->decrypt(msg, msg_count, reg->key, 20, plaintext); \n \/\/display plaintext message\n cout << endl << endl;\n for(int i=0; iname_list[reg->dest] << \"]> \"; cout.clear(); cout.flush(); \n }\n }\n \n }\n \/\/catch any std exceptions\n catch (std::exception& e)\n {\n std::cerr << e.what() << std::endl; \n }\n pthread_exit(NULL);\n}\n\nvoid msgComponent::run() { \n \/\/spin off thread for listener\n pthread_t thread;\n int rc;\n rc = pthread_create(&thread, NULL, listen, NULL);\n if (rc){\n cout << \"Error:unable to create thread,\" << rc << endl;\n exit(-1);\n } \n command=\"\";\n \/\/draw some ui\n draw_header();\n draw_dest(); \n \/\/c&c loop\n while(command!=\":q\") { \n \/\/get input\n get_input(); \n \/\/parse special commands\n \/\/list destinations\n if(command==\":dlist\") {\n reg->printDest();\n } \n \/\/set destination\n else if (command.find(\":dset\")==0) {\n \/\/cout << command.substr(6) << endl;\n int d = atoi((command.substr(6)).c_str());\n d--;\n if(d>=0 && ddest_count) {\n reg->setDest(d);\n draw_dest();\n } else {\n cout << \"Destination out of range.\" << endl;\n }\n } \n \/\/else, its a message, send it!\n \/\/CODE derived from daytime_client.cpp (Boost::asio)\n \/\/Copyright (c) 2003-2015 Christopher M. Kohlhoff (chris at kohlhoff dot com)\n \/\/Distributed under the Boost Software License, Version 1.0 at http:\/\/www.boost.org\/LICENSE_1_0.txt)\n else {\n try { \n boost::asio::io_service io_service;\n boost::asio::ip::tcp::resolver resolver(io_service);\n boost::asio::ip::tcp::resolver::query query(reg->dest_list[reg->dest], \"6283\"); \n \/\/attempt to open connection\n tcp::iostream stream(reg->dest_list[reg->dest], \"6283\");\n if (!stream)\n {\n std::cout << \"Unable to connect: \" << stream.error().message() << std::endl;\n } \n \/\/build message\n string message;\n message = string(\"version: 0.2\\r\\n\") \n + \"from: \" + reg->username + \"\\r\\n\"\n + \"to: \" + reg->name_list[reg->dest] + \"\\r\\n\"\n + \"\\r\\n\"\n + command + \"\\r\\n\";\n \n \/\/init holder for ciphertext\n char ciphertext [message.length()+10]; \n \/\/encrypt the message\n sec->encrypt(message,reg->key,20, ciphertext); \n \/\/send the message\n for(unsigned int i=0; iname_list[reg->dest] << \"]\" << reg->dest_list[reg->dest] << \" ***\" << endl; \n}\n\nvoid msgComponent::get_input() {\n cout << endl;\n cin.clear();\n cout << \"TauNet [TO: \" << reg->name_list[reg->dest] << \"]> \";\n getline(cin,command);\n}\n\nvoid msgComponent::draw_get_input() {\n cout << \"TauNet [TO: \" << reg->name_list[reg->dest] << \"]> \";\n}\nadded code to discard messages of length zero\/*\n(c) Matthew Slocum 2015\n\nmsgComponent.cpp \n\nmsgComponent is resbonaible for sending and revieving messages\n upon creation it spins off a thread to listen for incoming messages.\n the parent process takes input from the user and executes commands or sends messages.\n\n*\/\n\n#include \n#include \n#include \n#include \n#include \n#include \"msgComponent.h\"\n#include \"regComponent.h\"\n#include \"secComponent.h\"\n\nusing namespace std;\nusing boost::asio::ip::tcp;\n\nmsgComponent::msgComponent() {\n \n}\n\n\/\/Code derived from:\n\/\/ daytime_server.cpp\n\/\/ ~~~~~~~~~~~~~~~~~~\n\/\/\n\/\/ Copyright (c) 2003-2015 Christopher M. Kohlhoff (chris at kohlhoff dot com)\n\/\/\n\/\/ Distributed under the Boost Software License, Version 1.0. (See\n\/\/ at http:\/\/www.boost.org\/LICENSE_1_0.txt)\n\n\/\/Function for listener thread\n\/\/This fucntion listens for incoming connections, recieves a message, decrypts it and displays it.\nvoid* listen(void *threadid) {\n try\n {\n extern regComponent* reg;\n extern secComponent* sec;\n boost::asio::io_service io_service;\n tcp::endpoint endpoint(tcp::v4(), 6283);\n tcp::acceptor acceptor(io_service, endpoint);\n for (;;)\n {\n tcp::iostream stream;\n boost::system::error_code ec;\n acceptor.accept(*stream.rdbuf(), ec);\n \/\/if the is an incomming connection\n if (!ec)\n { \n string message = \"\";\n string line; \n char c;\n char msg [1034];\n int msg_count=0; \n \/\/get message\n while(stream.get(c)) { \n msg[msg_count++]=c;\n } \n \/\/make holder for plaintext\n char plaintext[msg_count]; \n \/\/decrypt message and store in plaintext\n sec->decrypt(msg, msg_count, reg->key, 20, plaintext); \n \/\/display plaintext message if it exists\n if(msg_count>0) {\n cout << endl << endl;\n for(int i=0; iname_list[reg->dest] << \"]> \"; cout.clear(); cout.flush(); \n }\n }\n \n }\n \/\/catch any std exceptions\n catch (std::exception& e)\n {\n std::cerr << e.what() << std::endl; \n }\n pthread_exit(NULL);\n}\n\nvoid msgComponent::run() { \n \/\/spin off thread for listener\n pthread_t thread;\n int rc;\n rc = pthread_create(&thread, NULL, listen, NULL);\n if (rc){\n cout << \"Error:unable to create thread,\" << rc << endl;\n exit(-1);\n } \n command=\"\";\n \/\/draw some ui\n draw_header();\n draw_dest(); \n \/\/c&c loop\n while(command!=\":q\") { \n \/\/get input\n get_input(); \n \/\/parse special commands\n \/\/list destinations\n if(command==\":dlist\") {\n reg->printDest();\n } \n \/\/set destination\n else if (command.find(\":dset\")==0) {\n \/\/cout << command.substr(6) << endl;\n int d = atoi((command.substr(6)).c_str());\n d--;\n if(d>=0 && ddest_count) {\n reg->setDest(d);\n draw_dest();\n } else {\n cout << \"Destination out of range.\" << endl;\n }\n } \n \/\/else, its a message, send it!\n \/\/CODE derived from daytime_client.cpp (Boost::asio)\n \/\/Copyright (c) 2003-2015 Christopher M. Kohlhoff (chris at kohlhoff dot com)\n \/\/Distributed under the Boost Software License, Version 1.0 at http:\/\/www.boost.org\/LICENSE_1_0.txt)\n else {\n try { \n boost::asio::io_service io_service;\n boost::asio::ip::tcp::resolver resolver(io_service);\n boost::asio::ip::tcp::resolver::query query(reg->dest_list[reg->dest], \"6283\"); \n \/\/attempt to open connection\n tcp::iostream stream(reg->dest_list[reg->dest], \"6283\");\n if (!stream)\n {\n std::cout << \"Unable to connect: \" << stream.error().message() << std::endl;\n } \n \/\/build message\n string message;\n message = string(\"version: 0.2\\r\\n\") \n + \"from: \" + reg->username + \"\\r\\n\"\n + \"to: \" + reg->name_list[reg->dest] + \"\\r\\n\"\n + \"\\r\\n\"\n + command + \"\\r\\n\";\n \n \/\/init holder for ciphertext\n char ciphertext [message.length()+10]; \n \/\/encrypt the message\n sec->encrypt(message,reg->key,20, ciphertext); \n \/\/send the message\n for(unsigned int i=0; iname_list[reg->dest] << \"]\" << reg->dest_list[reg->dest] << \" ***\" << endl; \n}\n\nvoid msgComponent::get_input() {\n cout << endl;\n cin.clear();\n cout << \"TauNet [TO: \" << reg->name_list[reg->dest] << \"]> \";\n getline(cin,command);\n}\n\nvoid msgComponent::draw_get_input() {\n cout << \"TauNet [TO: \" << reg->name_list[reg->dest] << \"]> \";\n}\n<|endoftext|>"} {"text":"\/* 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 .\n\n*\/\n\n#include \"utils.h\"\n#include \"videooutput.h\"\n#include \"videooutputobserver.h\"\n\n#ifdef _DEBUG\n#include \"objectdump.h\"\n#endif\n\n#include \n#include \n#include \n#include \n\n\/\/ Required for implementation of transparentFill\n#include \n#include \n#include \n#include \n\n\nQT_BEGIN_NAMESPACE\n\nusing namespace Phonon;\nusing namespace Phonon::MMF;\n\n\/\/-----------------------------------------------------------------------------\n\/\/ Constructor \/ destructor\n\/\/-----------------------------------------------------------------------------\n\nMMF::VideoOutput::VideoOutput(QWidget* parent)\n : QWidget(parent)\n , m_observer(NULL)\n{\n TRACE_CONTEXT(VideoOutput::VideoOutput, EVideoInternal);\n TRACE_ENTRY(\"parent 0x%08x\", parent);\n\n#ifndef PHONON_MMF_VIDEOOUTPUT_IS_QWIDGET\n setPalette(QPalette(Qt::black));\n\tsetAttribute(Qt::WA_OpaquePaintEvent, true);\n\tsetAttribute(Qt::WA_NoSystemBackground, true);\n\tsetAutoFillBackground(false);\n#endif \/\/ PHONON_MMF_VIDEOOUTPUT_IS_QWIDGET\n\n dump();\n \n TRACE_EXIT_0();\n}\n\nMMF::VideoOutput::~VideoOutput()\n{\n TRACE_CONTEXT(VideoOutput::~VideoOutput, EVideoInternal);\n TRACE_ENTRY_0();\n\n TRACE_EXIT_0();\n}\n\nvoid MMF::VideoOutput::setFrameSize(const QSize& frameSize)\n{\n#ifdef PHONON_MMF_VIDEOOUTPUT_IS_QWIDGET\n Q_UNUSED(frameSize);\n#else\n TRACE_CONTEXT(VideoOutput::setFrameSize, EVideoInternal);\n TRACE(\"oldSize %d %d newSize %d %d\",\n m_frameSize.width(), m_frameSize.height(),\n frameSize.width(), frameSize.height());\n\n if (frameSize != m_frameSize) {\n m_frameSize = frameSize;\n updateGeometry();\n }\n#endif \/\/ PHONON_MMF_VIDEOOUTPUT_IS_QWIDGET\n}\n\nvoid MMF::VideoOutput::setObserver(VideoOutputObserver* observer)\n{\n TRACE_CONTEXT(VideoOutput::setObserver, EVideoInternal);\n TRACE(\"observer 0x%08x\", observer);\n\n m_observer = observer;\n}\n\n\n\/\/-----------------------------------------------------------------------------\n\/\/ QWidget\n\/\/-----------------------------------------------------------------------------\n\n#ifndef PHONON_MMF_VIDEOOUTPUT_IS_QWIDGET\n\nQSize MMF::VideoOutput::sizeHint() const\n{\n \/\/ TODO: replace this with a more sensible default\n QSize result(320, 240);\n\n if (!m_frameSize.isNull()) {\n result = m_frameSize;\n }\n\n return result;\n}\n\nvoid MMF::VideoOutput::paintEvent(QPaintEvent* event)\n{\n TRACE_CONTEXT(VideoOutput::paintEvent, EVideoInternal);\n TRACE(\"rect %d %d - %d %d\",\n event->rect().left(), event->rect().top(),\n event->rect().right(), event->rect().bottom());\n TRACE(\"regions %d\", event->region().numRects());\n TRACE(\"type %d\", event->type());\n\n dump();\n \n#ifdef PHONON_MMF_DIRECT_WRITE_ALPHA\n transparentFill(event->region().rects());\n#else\n \/\/ Note: composition mode code was a failed attempt to get transparent\n \/\/ alpha values to be propagated to the (EColor16MU) window surface.\n\n QPainter painter;\n \/\/const QPainter::CompositionMode compositionMode = painter.compositionMode();\n \/\/painter.setCompositionMode(QPainter::CompositionMode_Source);\n painter.begin(this);\n painter.setBrush(QColor(0, 0, 0, 0));\n painter.drawRects(event->region().rects());\n painter.end();\n \/\/painter.setCompositionMode(compositionMode);\n#endif\n}\n\nvoid MMF::VideoOutput::transparentFill(const QVector& rects)\n{\n\tTRACE_CONTEXT(VideoOutput::transparentFill, EVideoInternal);\n\tTRACE_ENTRY_0();\n\t\n\tQImage *image = window()->windowSurface()->buffer(window());\n\tQRgb *data = reinterpret_cast(image->bits());\n\tconst int row_stride = image->bytesPerLine() \/ 4;\n\n\tfor (QVector::const_iterator it = rects.begin(); it != rects.end(); ++it) {\n\t\n\t\tconst QRect& rect = *it;\n\t\t\n\t\tTRACE(\"%d %d size %d x %d\", rect.x(), rect.y(), rect.width(), rect.height());\n\t\n\t\tconst int x_start = rect.x();\n\t\tconst int width = rect.width();\n\n\t\tconst int y_start = rect.y();\n\t\tconst int height = rect.height();\n\n\t\tQRgb *row = data + row_stride * y_start;\n\t\tfor (int y = 0; y < height; ++y) {\n\t\t\n\t\t\t\/\/ Note: not using the optimised qt_memfill function implemented in\n\t\t\t\/\/ gui\/painting\/qdrawhelper.cpp - can we somehow link against this?\n\t\t\n\t\t\t\/\/qt_memfill(row + x_start, 0U, width);\n\t\t\tmemset(row + x_start, 0, width*4);\n\t\t\trow += row_stride;\n\t\t}\n\t}\n\t\n\tTRACE_EXIT_0();\n}\n\nvoid MMF::VideoOutput::resizeEvent(QResizeEvent* event)\n{\n TRACE_CONTEXT(VideoOutput::resizeEvent, EVideoInternal);\n TRACE(\"%d %d -> %d %d\",\n event->oldSize().width(), event->oldSize().height(),\n event->size().width(), event->size().height());\n\n QWidget::resizeEvent(event);\n\n if (m_observer)\n m_observer->videoOutputRegionChanged();\n}\n\nvoid MMF::VideoOutput::moveEvent(QMoveEvent* event)\n{\n TRACE_CONTEXT(VideoOutput::moveEvent, EVideoInternal);\n TRACE(\"%d %d -> %d %d\",\n event->oldPos().x(), event->oldPos().y(),\n event->pos().x(), event->pos().y());\n\n QWidget::moveEvent(event);\n\n if (m_observer)\n m_observer->videoOutputRegionChanged();\n}\n\n#endif \/\/ PHONON_MMF_VIDEOOUTPUT_IS_QWIDGET\n\n\n\/\/-----------------------------------------------------------------------------\n\/\/ Private functions\n\/\/-----------------------------------------------------------------------------\n\nvoid VideoOutput::dump() const\n{\n#ifdef _DEBUG\n TRACE_CONTEXT(VideoOutput::dump, EVideoInternal);\n QScopedPointer visitor(new ObjectDump::QVisitor);\n visitor->setPrefix(\"Phonon::MMF\"); \/\/ to aid searchability of logs\n ObjectDump::addDefaultAnnotators(*visitor);\n TRACE(\"Dumping tree from leaf 0x%08x:\", this);\n \/\/ObjectDump::dumpAncestors(*this, *visitor);\n ObjectDump::dumpTreeFromLeaf(*this, *visitor);\n#endif\n}\n\n\nQT_END_NAMESPACE\n\nModified transparentFill to allow RGBA color to be specified more easily, for testing\/* 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 .\n\n*\/\n\n#include \"utils.h\"\n#include \"videooutput.h\"\n#include \"videooutputobserver.h\"\n\n#ifdef _DEBUG\n#include \"objectdump.h\"\n#endif\n\n#include \n#include \n#include \n#include \n\n\/\/ Required for implementation of transparentFill\n#include \n#include \n#include \n#include \n\n\nQT_BEGIN_NAMESPACE\n\nusing namespace Phonon;\nusing namespace Phonon::MMF;\n\n\/\/-----------------------------------------------------------------------------\n\/\/ Constructor \/ destructor\n\/\/-----------------------------------------------------------------------------\n\nMMF::VideoOutput::VideoOutput(QWidget* parent)\n : QWidget(parent)\n , m_observer(NULL)\n{\n TRACE_CONTEXT(VideoOutput::VideoOutput, EVideoInternal);\n TRACE_ENTRY(\"parent 0x%08x\", parent);\n\n#ifndef PHONON_MMF_VIDEOOUTPUT_IS_QWIDGET\n setPalette(QPalette(Qt::black));\n\tsetAttribute(Qt::WA_OpaquePaintEvent, true);\n\tsetAttribute(Qt::WA_NoSystemBackground, true);\n\tsetAutoFillBackground(false);\n#endif \/\/ PHONON_MMF_VIDEOOUTPUT_IS_QWIDGET\n\n dump();\n \n TRACE_EXIT_0();\n}\n\nMMF::VideoOutput::~VideoOutput()\n{\n TRACE_CONTEXT(VideoOutput::~VideoOutput, EVideoInternal);\n TRACE_ENTRY_0();\n\n TRACE_EXIT_0();\n}\n\nvoid MMF::VideoOutput::setFrameSize(const QSize& frameSize)\n{\n#ifdef PHONON_MMF_VIDEOOUTPUT_IS_QWIDGET\n Q_UNUSED(frameSize);\n#else\n TRACE_CONTEXT(VideoOutput::setFrameSize, EVideoInternal);\n TRACE(\"oldSize %d %d newSize %d %d\",\n m_frameSize.width(), m_frameSize.height(),\n frameSize.width(), frameSize.height());\n\n if (frameSize != m_frameSize) {\n m_frameSize = frameSize;\n updateGeometry();\n }\n#endif \/\/ PHONON_MMF_VIDEOOUTPUT_IS_QWIDGET\n}\n\nvoid MMF::VideoOutput::setObserver(VideoOutputObserver* observer)\n{\n TRACE_CONTEXT(VideoOutput::setObserver, EVideoInternal);\n TRACE(\"observer 0x%08x\", observer);\n\n m_observer = observer;\n}\n\n\n\/\/-----------------------------------------------------------------------------\n\/\/ QWidget\n\/\/-----------------------------------------------------------------------------\n\n#ifndef PHONON_MMF_VIDEOOUTPUT_IS_QWIDGET\n\nQSize MMF::VideoOutput::sizeHint() const\n{\n \/\/ TODO: replace this with a more sensible default\n QSize result(320, 240);\n\n if (!m_frameSize.isNull()) {\n result = m_frameSize;\n }\n\n return result;\n}\n\nvoid MMF::VideoOutput::paintEvent(QPaintEvent* event)\n{\n TRACE_CONTEXT(VideoOutput::paintEvent, EVideoInternal);\n TRACE(\"rect %d %d - %d %d\",\n event->rect().left(), event->rect().top(),\n event->rect().right(), event->rect().bottom());\n TRACE(\"regions %d\", event->region().numRects());\n TRACE(\"type %d\", event->type());\n\n dump();\n \n#ifdef PHONON_MMF_DIRECT_WRITE_ALPHA\n transparentFill(event->region().rects());\n#else\n \/\/ Note: composition mode code was a failed attempt to get transparent\n \/\/ alpha values to be propagated to the (EColor16MU) window surface.\n\n QPainter painter;\n \/\/const QPainter::CompositionMode compositionMode = painter.compositionMode();\n \/\/painter.setCompositionMode(QPainter::CompositionMode_Source);\n painter.begin(this);\n painter.setBrush(QColor(0, 0, 0, 0));\n painter.drawRects(event->region().rects());\n painter.end();\n \/\/painter.setCompositionMode(compositionMode);\n#endif\n}\n\nvoid MMF::VideoOutput::transparentFill(const QVector& rects)\n{\n\tTRACE_CONTEXT(VideoOutput::transparentFill, EVideoInternal);\n\tTRACE_ENTRY_0();\n\t\n\tQImage *image = window()->windowSurface()->buffer(window());\n\tQRgb *data = reinterpret_cast(image->bits());\n\tconst int row_stride = image->bytesPerLine() \/ 4;\n\n\tfor (QVector::const_iterator it = rects.begin(); it != rects.end(); ++it) {\n\t\n\t\tconst QRect& rect = *it;\n\t\t\n\t\tTRACE(\"%d %d size %d x %d\", rect.x(), rect.y(), rect.width(), rect.height());\n\t\n\t\tconst int x_start = rect.x();\n\t\tconst int width = rect.width();\n\n\t\tconst int y_start = rect.y();\n\t\tconst int height = rect.height();\n\n\t\tQRgb *row = data + row_stride * y_start;\n\t\tfor (int y = 0; y < height; ++y) {\n\t\t\n\t\t\t\/\/ Note: not using the optimised qt_memfill function implemented in\n\t\t\t\/\/ gui\/painting\/qdrawhelper.cpp - can we somehow link against this?\n\t\t\n\t\t\tQRgb *ptr = row + x_start;\n\t\t\tfor(int x = 0; x < width; ++x)\n\t\t\t\t*ptr++ = 0x00000000;\n\t\t\n\t\t\trow += row_stride;\n\t\t}\n\t}\n\t\n\tTRACE_EXIT_0();\n}\n\nvoid MMF::VideoOutput::resizeEvent(QResizeEvent* event)\n{\n TRACE_CONTEXT(VideoOutput::resizeEvent, EVideoInternal);\n TRACE(\"%d %d -> %d %d\",\n event->oldSize().width(), event->oldSize().height(),\n event->size().width(), event->size().height());\n\n QWidget::resizeEvent(event);\n\n if (m_observer)\n m_observer->videoOutputRegionChanged();\n}\n\nvoid MMF::VideoOutput::moveEvent(QMoveEvent* event)\n{\n TRACE_CONTEXT(VideoOutput::moveEvent, EVideoInternal);\n TRACE(\"%d %d -> %d %d\",\n event->oldPos().x(), event->oldPos().y(),\n event->pos().x(), event->pos().y());\n\n QWidget::moveEvent(event);\n\n if (m_observer)\n m_observer->videoOutputRegionChanged();\n}\n\n#endif \/\/ PHONON_MMF_VIDEOOUTPUT_IS_QWIDGET\n\n\n\/\/-----------------------------------------------------------------------------\n\/\/ Private functions\n\/\/-----------------------------------------------------------------------------\n\nvoid VideoOutput::dump() const\n{\n#ifdef _DEBUG\n TRACE_CONTEXT(VideoOutput::dump, EVideoInternal);\n QScopedPointer visitor(new ObjectDump::QVisitor);\n visitor->setPrefix(\"Phonon::MMF\"); \/\/ to aid searchability of logs\n ObjectDump::addDefaultAnnotators(*visitor);\n TRACE(\"Dumping tree from leaf 0x%08x:\", this);\n \/\/ObjectDump::dumpAncestors(*this, *visitor);\n ObjectDump::dumpTreeFromLeaf(*this, *visitor);\n#endif\n}\n\n\nQT_END_NAMESPACE\n\n<|endoftext|>"} {"text":"#include \"SDBPConnection.h\"\n#include \"SDBPServer.h\"\n#include \"SDBPContext.h\"\n#include \"SDBPRequestMessage.h\"\n#include \"SDBPResponseMessage.h\"\n#include \"Application\/Common\/ClientRequestCache.h\"\n#include \"System\/Config.h\"\n\nstatic const unsigned keepAliveTimeout = 60*1000; \/\/ msec\n\nSDBPConnection::SDBPConnection()\n{\n server = NULL;\n context = NULL;\n numPending = 0;\n autoFlush = false;\n onKeepAlive.SetCallable(MFUNC(SDBPConnection, OnKeepAlive));\n onKeepAlive.SetDelay(0);\n}\n\nSDBPConnection::~SDBPConnection()\n{\n EventLoop::Remove(&onKeepAlive);\n}\n\nvoid SDBPConnection::Init(SDBPServer* server_)\n{\n ClientResponse resp;\n SDBPResponseMessage sdbpResponse;\n \n MessageConnection::InitConnected();\n \n numCompleted = 0;\n connectTimestamp = NowClock();\n server = server_;\n \n socket.GetEndpoint(remoteEndpoint);\n Log_Message(\"[%s] Client connected\", remoteEndpoint.ToString());\n \n resp.Hello();\n sdbpResponse.response = &resp;\n Write(sdbpResponse);\n Flush();\n\n if (onKeepAlive.GetDelay() > 0)\n EventLoop::Add(&onKeepAlive);\n}\n\nvoid SDBPConnection::SetContext(SDBPContext* context_)\n{\n context = context_;\n}\n\nbool SDBPConnection::OnMessage(ReadBuffer& msg)\n{\n SDBPRequestMessage sdbpRequest;\n ClientRequest* request;\n\n if (onKeepAlive.GetDelay() > 0)\n EventLoop::Reset(&onKeepAlive);\n\n request = REQUEST_CACHE->CreateRequest();\n request->session = this;\n sdbpRequest.request = request;\n if (!sdbpRequest.Read(msg) || !context->IsValidClientRequest(request))\n {\n REQUEST_CACHE->DeleteRequest(request);\n OnClose();\n return true;\n }\n\n numPending++;\n context->OnClientRequest(request);\n return false;\n}\n\nvoid SDBPConnection::OnWrite()\n{\n Log_Trace();\n \n if (onKeepAlive.GetDelay() > 0)\n EventLoop::Reset(&onKeepAlive);\n\n MessageConnection::OnWrite();\n}\n\nvoid SDBPConnection::OnClose()\n{\n uint64_t elapsed;\n \n EventLoop::Remove(&onKeepAlive);\n elapsed = NowClock() - connectTimestamp;\n\n Log_Message(\"[%s] Client disconnected (active: %u seconds, served: %u requests)\", \n remoteEndpoint.ToString(), (unsigned)(elapsed \/ 1000.0 + 0.5), numCompleted);\n \n context->OnClientClose(this);\n MessageConnection::Close();\n \n if (numPending == 0)\n {\n Log_Debug(\"[%s] Connection deleted\", remoteEndpoint.ToString());\n server->DeleteConn(this);\n }\n}\n\nvoid SDBPConnection::OnComplete(ClientRequest* request, bool last)\n{\n SDBPResponseMessage sdbpResponse;\n\n if (onKeepAlive.GetDelay() > 0)\n EventLoop::Reset(&onKeepAlive);\n\n if (last)\n numPending--;\n\n\/\/ if (request->response.type == CLIENTRESPONSE_OK)\n\/\/ Log_Debug(\"OK, commandID: %U\", request->commandID);\n\n if (state == TCPConnection::CONNECTED &&\n request->response.type != CLIENTRESPONSE_NORESPONSE &&\n !(request->response.type == CLIENTRESPONSE_CONFIG_STATE &&\n TCPConnection::GetWriteBuffer().GetLength() > SDBP_MAX_QUEUED_BYTES))\n {\n sdbpResponse.response = &request->response;\n Write(sdbpResponse);\n \/\/ TODO: HACK\n if (TCPConnection::GetWriteBuffer().GetLength() >= MESSAGING_BUFFER_THRESHOLD || last ||\n request->type == CLIENTREQUEST_GET_CONFIG_STATE)\n Flush();\n }\n\n if (last)\n {\n REQUEST_CACHE->DeleteRequest(request);\n numCompleted++;\n }\n \n if (numPending == 0 && state == DISCONNECTED)\n {\n Log_Debug(\"[%s] Connection deleted\", remoteEndpoint.ToString());\n server->DeleteConn(this);\n }\n}\n\nbool SDBPConnection::IsActive()\n{\n if (state == DISCONNECTED)\n return false;\n\n return true;\n}\n\nvoid SDBPConnection::UseKeepAlive(bool useKeepAlive_)\n{\n onKeepAlive.SetDelay(configFile.GetIntValue(\"sdbp.keepAliveTimeout\", keepAliveTimeout));\n}\n\nvoid SDBPConnection::OnKeepAlive()\n{\n Log_Debug(\"Keep alive timeout occured\");\n OnClose();\n}\nFixed bug in KeepAlive in SDBP connections.#include \"SDBPConnection.h\"\n#include \"SDBPServer.h\"\n#include \"SDBPContext.h\"\n#include \"SDBPRequestMessage.h\"\n#include \"SDBPResponseMessage.h\"\n#include \"Application\/Common\/ClientRequestCache.h\"\n#include \"System\/Config.h\"\n\nstatic const unsigned keepAliveTimeout = 60*1000; \/\/ msec\n\nSDBPConnection::SDBPConnection()\n{\n server = NULL;\n context = NULL;\n numPending = 0;\n autoFlush = false;\n onKeepAlive.SetCallable(MFUNC(SDBPConnection, OnKeepAlive));\n onKeepAlive.SetDelay(0);\n}\n\nSDBPConnection::~SDBPConnection()\n{\n if (onKeepAlive.GetDelay() > 0)\n EventLoop::Remove(&onKeepAlive);\n}\n\nvoid SDBPConnection::Init(SDBPServer* server_)\n{\n ClientResponse resp;\n SDBPResponseMessage sdbpResponse;\n \n MessageConnection::InitConnected();\n \n numCompleted = 0;\n connectTimestamp = NowClock();\n server = server_;\n \n socket.GetEndpoint(remoteEndpoint);\n Log_Message(\"[%s] Client connected\", remoteEndpoint.ToString());\n \n resp.Hello();\n sdbpResponse.response = &resp;\n Write(sdbpResponse);\n Flush();\n\n if (onKeepAlive.GetDelay() > 0)\n EventLoop::Reset(&onKeepAlive);\n}\n\nvoid SDBPConnection::SetContext(SDBPContext* context_)\n{\n context = context_;\n}\n\nbool SDBPConnection::OnMessage(ReadBuffer& msg)\n{\n SDBPRequestMessage sdbpRequest;\n ClientRequest* request;\n\n if (onKeepAlive.GetDelay() > 0)\n EventLoop::Reset(&onKeepAlive);\n\n request = REQUEST_CACHE->CreateRequest();\n request->session = this;\n sdbpRequest.request = request;\n if (!sdbpRequest.Read(msg) || !context->IsValidClientRequest(request))\n {\n REQUEST_CACHE->DeleteRequest(request);\n OnClose();\n return true;\n }\n\n numPending++;\n context->OnClientRequest(request);\n return false;\n}\n\nvoid SDBPConnection::OnWrite()\n{\n Log_Trace();\n \n if (onKeepAlive.GetDelay() > 0)\n EventLoop::Reset(&onKeepAlive);\n\n MessageConnection::OnWrite();\n}\n\nvoid SDBPConnection::OnClose()\n{\n uint64_t elapsed;\n \n if (onKeepAlive.GetDelay() > 0)\n EventLoop::Remove(&onKeepAlive);\n \n elapsed = NowClock() - connectTimestamp;\n\n Log_Message(\"[%s] Client disconnected (active: %u seconds, served: %u requests)\", \n remoteEndpoint.ToString(), (unsigned)(elapsed \/ 1000.0 + 0.5), numCompleted);\n \n context->OnClientClose(this);\n MessageConnection::Close();\n \n if (numPending == 0)\n {\n Log_Debug(\"[%s] Connection deleted\", remoteEndpoint.ToString());\n server->DeleteConn(this);\n }\n}\n\nvoid SDBPConnection::OnComplete(ClientRequest* request, bool last)\n{\n SDBPResponseMessage sdbpResponse;\n\n if (last)\n numPending--;\n\n\/\/ if (request->response.type == CLIENTRESPONSE_OK)\n\/\/ Log_Debug(\"OK, commandID: %U\", request->commandID);\n\n if (state == TCPConnection::CONNECTED &&\n request->response.type != CLIENTRESPONSE_NORESPONSE &&\n !(request->response.type == CLIENTRESPONSE_CONFIG_STATE &&\n TCPConnection::GetWriteBuffer().GetLength() > SDBP_MAX_QUEUED_BYTES))\n {\n sdbpResponse.response = &request->response;\n Write(sdbpResponse);\n \/\/ TODO: HACK\n if (TCPConnection::GetWriteBuffer().GetLength() >= MESSAGING_BUFFER_THRESHOLD || last ||\n request->type == CLIENTREQUEST_GET_CONFIG_STATE)\n Flush();\n }\n\n if (last)\n {\n REQUEST_CACHE->DeleteRequest(request);\n numCompleted++;\n }\n \n if (numPending == 0 && state == DISCONNECTED)\n {\n Log_Debug(\"[%s] Connection deleted\", remoteEndpoint.ToString());\n server->DeleteConn(this);\n }\n}\n\nbool SDBPConnection::IsActive()\n{\n if (state == DISCONNECTED)\n return false;\n\n return true;\n}\n\nvoid SDBPConnection::UseKeepAlive(bool useKeepAlive)\n{\n if (useKeepAlive)\n {\n onKeepAlive.SetDelay(configFile.GetIntValue(\"sdbp.keepAliveTimeout\", keepAliveTimeout));\n EventLoop::Reset(&onKeepAlive);\n }\n else\n {\n EventLoop::Remove(&onKeepAlive);\n onKeepAlive.SetDelay(0);\n }\n}\n\nvoid SDBPConnection::OnKeepAlive()\n{\n Log_Debug(\"Keep alive timeout occured\");\n OnClose();\n}\n<|endoftext|>"} {"text":"\/\/ Jubatus: Online machine learning framework for distributed environment\n\/\/ Copyright (C) 2011,2012 Preferred Infrastructure and Nippon Telegraph and Telephone Corporation.\n\/\/\n\/\/ This library is free software; you can redistribute it and\/or\n\/\/ modify it under the terms of the GNU Lesser General Public\n\/\/ License version 2.1 as published by the Free Software Foundation.\n\/\/\n\/\/ This library is distributed in the hope that it will be useful,\n\/\/ but WITHOUT ANY WARRANTY; without even the implied warranty of\n\/\/ MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU\n\/\/ Lesser General Public License for more details.\n\/\/\n\/\/ You should have received a copy of the GNU Lesser General Public\n\/\/ License along with this library; if not, write to the Free Software\n\/\/ Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA\n\n#ifndef JUBATUS_CORE_COMMON_UNORDERED_MAP_HPP_\n#define JUBATUS_CORE_COMMON_UNORDERED_MAP_HPP_\n\n#include \n#include \n\n\/\/ to make pfi::data::unordered_map serializable\n\nnamespace msgpack {\n\ntemplate\ninline pfi::data::unordered_map operator>>(\n object o,\n pfi::data::unordered_map& v) {\n if (o.type != type::MAP) {\n throw type_error();\n }\n object_kv* const p_end = o.via.map.ptr + o.via.map.size;\n for (object_kv* p = o.via.map.ptr; p != p_end; ++p) {\n K key;\n p->key.convert(&key);\n p->val.convert(&v[key]);\n }\n return v;\n}\n\ntemplate\ninline packer& operator<<(\n packer& o,\n const pfi::data::unordered_map& v) {\n o.pack_map(v.size());\n for (typename std::tr1::unordered_map::const_iterator it = v.begin();\n it != v.end(); ++it) {\n o.pack(it->first);\n o.pack(it->second);\n }\n return o;\n}\n\n} \/\/ namespace msgpack\n\n#endif \/\/ JUBATUS_CORE_COMMON_UNORDERED_MAP_HPP_\nFixed a bad typename.\/\/ Jubatus: Online machine learning framework for distributed environment\n\/\/ Copyright (C) 2011,2012 Preferred Infrastructure and Nippon Telegraph and Telephone Corporation.\n\/\/\n\/\/ This library is free software; you can redistribute it and\/or\n\/\/ modify it under the terms of the GNU Lesser General Public\n\/\/ License version 2.1 as published by the Free Software Foundation.\n\/\/\n\/\/ This library is distributed in the hope that it will be useful,\n\/\/ but WITHOUT ANY WARRANTY; without even the implied warranty of\n\/\/ MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU\n\/\/ Lesser General Public License for more details.\n\/\/\n\/\/ You should have received a copy of the GNU Lesser General Public\n\/\/ License along with this library; if not, write to the Free Software\n\/\/ Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA\n\n#ifndef JUBATUS_CORE_COMMON_UNORDERED_MAP_HPP_\n#define JUBATUS_CORE_COMMON_UNORDERED_MAP_HPP_\n\n#include \n#include \n\n\/\/ to make pfi::data::unordered_map serializable\n\nnamespace msgpack {\n\ntemplate\ninline pfi::data::unordered_map operator>>(\n object o,\n pfi::data::unordered_map& v) {\n if (o.type != type::MAP) {\n throw type_error();\n }\n object_kv* const p_end = o.via.map.ptr + o.via.map.size;\n for (object_kv* p = o.via.map.ptr; p != p_end; ++p) {\n K key;\n p->key.convert(&key);\n p->val.convert(&v[key]);\n }\n return v;\n}\n\ntemplate\ninline packer& operator<<(\n packer& o,\n const pfi::data::unordered_map& v) {\n o.pack_map(v.size());\n for (typename pfi::data::unordered_map::const_iterator it = v.begin();\n it != v.end(); ++it) {\n o.pack(it->first);\n o.pack(it->second);\n }\n return o;\n}\n\n} \/\/ namespace msgpack\n\n#endif \/\/ JUBATUS_CORE_COMMON_UNORDERED_MAP_HPP_\n<|endoftext|>"} {"text":"\/*\n This file is part of KAddressbook.\n Copyright (c) 2003 Tobias Koenig \n\n\tThis program 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 2 of the License, or\n\t(at your option) any later version.\n\n\tThis program is distributed in the hope that it will be useful,\n\tbut WITHOUT ANY WARRANTY; without even the implied warranty of\n\tMERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the\n\tGNU General Public License for more details.\n\n\tYou should have received a copy of the GNU General Public License\n\talong with this program; if not, write to the Free Software\n\tFoundation, Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA.\n\n\tAs a special exception, permission is given to link this program\n\twith any edition of Qt, and distribute the resulting executable,\n\twithout including the source code for Qt in the source distribution.\n *\/\n\n\n#include \n\n#include \n#include \n#include \n#include \n#include \n#include \n\n#include \n\n#include \"importdialog.h\"\n\n#include \"eudora_xxport.h\"\n\n#define CTRL_C 3\n\nclass EudoraXXPortFactory : public XXPortFactory\n{\n public:\n XXPortObject *xxportObject( KABCore *core, QObject *parent, const char *name )\n {\n return new EudoraXXPort( core, parent, name );\n }\n};\n\nextern \"C\"\n{\n void *init_libkaddrbk_eudora_xxport()\n {\n return ( new EudoraXXPortFactory() );\n }\n}\n\n\n EudoraXXPort::EudoraXXPort( KABCore *core, QObject *parent, const char *name )\n: XXPortObject( core, parent, name )\n{\n createImportAction( i18n( \"Import Eudora Addressbook ..\" ) );\n \/\/createExportAction( i18n( \"Export Eudora Addressbook ..\" ) );\n}\n\nbool EudoraXXPort::exportContacts( const KABC::AddresseeList &, const QString& )\n{\n \/\/ ### implement me\n return false;\n}\n\nKABC::AddresseeList EudoraXXPort::importContacts( const QString& ) const\n{\n\n QString file=KFileDialog::getOpenFileName(QDir::homeDirPath() ,\"*.txt *.TXT\",0);\n if (file.isEmpty())\n return KABC::AddresseeList();\n\n QFile f(file);\n if (!f.open(IO_ReadOnly))\n return KABC::AddresseeList();\n\n QString line;\n QTextStream stream(&f);\n KABC::Addressee *a = 0;\n int bytesRead = 0;\n\n KABC::AddresseeList list;\n\n while(!stream.eof()) {\n line = stream.readLine();\n bytesRead += line.length();\n QString tmp;\n\n if (line.startsWith(\"alias\")) {\n if (a) { \/\/ Write it out\n list << *a;\n delete a;\n a = 0;\n a = new KABC::Addressee();\n } else a = new KABC::Addressee();\n tmp = key(line);\n if (!tmp.isEmpty()) a->setFormattedName(tmp);\n tmp = email(line);\n if (!tmp.isEmpty()) a->insertEmail(tmp);\n }\n else if (line.startsWith(\"note\")) {\n if (!a) break; \/\/ Must have an alias before a note\n \n tmp = comment(line);\n if (!tmp.isEmpty()) a->setNote(tmp);\n \n tmp = get(line, \"name\");\n if (!tmp.isEmpty()) a->setFamilyName(tmp);\n \n tmp = get(line, \"address\");\n if (!tmp.isEmpty()){\n KABC::Address addr;\n kdDebug() << tmp << endl; \/\/ dump complete address\n addr.setLabel(tmp);\n a->insertAddress(addr);\n }\n\n tmp = get(line,\"phone\");\n if (tmp.isEmpty())\n a->insertPhoneNumber( KABC::PhoneNumber( tmp, KABC::PhoneNumber::Voice ));\n }\n }\n\n\n if (a) { \/\/ Write out address\n list << *a;\n delete a;\n a = 0;\n }\n\n f.close();\n\n return list;\n}\n\nvoid EudoraXXPort::doExport( QFile *fp, const KABC::AddresseeList &list )\n{\n QTextStream t( fp );\n\n KABC::AddresseeList::ConstIterator iter;\n KABC::Field::List fields = core()->addressBook()->fields();\n KABC::Field::List::Iterator fieldIter;\n bool first = true;\n\n \/\/ First output the column headings\n for ( fieldIter = fields.begin(); fieldIter != fields.end(); ++fieldIter ) {\n if ( !first )\n t << \",\";\n\n t << \"\\\"\" << (*fieldIter)->label() << \"\\\"\";\n first = false;\n }\n t << \"\\n\";\n\n \/\/ Then all the addressee objects\n KABC::Addressee addr;\n for ( iter = list.begin(); iter != list.end(); ++iter ) {\n addr = *iter;\n first = true;\n\n for ( fieldIter = fields.begin(); fieldIter != fields.end(); ++fieldIter ) {\n if ( !first )\n t << \",\";\n\n t << \"\\\"\" << (*fieldIter)->value( addr ).replace( \"\\n\", \"\\\\n\" ) << \"\\\"\";\n first = false;\n }\n\n t << \"\\n\";\n }\n}\n\nQString EudoraXXPort::key(const QString& line) const\n{\n int e;\n QString result;\n int b=line.find('\\\"',0);\n if (b==-1) { \n b=line.find(' ');\n if (b==-1) { return result; }\n b+=1;\n e=line.find(' ',b);\n result=line.mid(b,e-b);\n return result;\n }\n b+=1;\n e=line.find('\\\"',b);if (e==-1) { return result; }\n result=line.mid(b,e-b);\n return result;\n}\n\nQString EudoraXXPort::email(const QString& line) const\n{\n int b;\n QString result;\n b=line.findRev('\\\"');if (b==-1) { \n b=line.findRev(' ');if(b==-1) { return result; }\n }\n result=line.mid(b+1);\n return result;\n}\n\nQString EudoraXXPort::comment(const QString& line) const\n{\n int b;\n QString result;\n uint i;\n b=line.findRev('>');if (b==-1) {\n b=line.findRev('\\\"');if (b==-1) { return result; }\n }\n result=line.mid(b+1);\n for(i=0;i',b);\n if (e==-1) { return QString::null; }\n\n e--;\n QString result=line.mid(b,e-b+1);\n for(i=0;ibetter\/*\n This file is part of KAddressbook.\n Copyright (c) 2003 Tobias Koenig \n\n\tThis program 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 2 of the License, or\n\t(at your option) any later version.\n\n\tThis program is distributed in the hope that it will be useful,\n\tbut WITHOUT ANY WARRANTY; without even the implied warranty of\n\tMERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the\n\tGNU General Public License for more details.\n\n\tYou should have received a copy of the GNU General Public License\n\talong with this program; if not, write to the Free Software\n\tFoundation, Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA.\n\n\tAs a special exception, permission is given to link this program\n\twith any edition of Qt, and distribute the resulting executable,\n\twithout including the source code for Qt in the source distribution.\n *\/\n\n\n#include \n\n#include \n#include \n#include \n#include \n#include \n#include \n\n#include \n\n#include \"importdialog.h\"\n\n#include \"eudora_xxport.h\"\n\n#define CTRL_C 3\n\nclass EudoraXXPortFactory : public XXPortFactory\n{\n public:\n XXPortObject *xxportObject( KABCore *core, QObject *parent, const char *name )\n {\n return new EudoraXXPort( core, parent, name );\n }\n};\n\nextern \"C\"\n{\n void *init_libkaddrbk_eudora_xxport()\n {\n return ( new EudoraXXPortFactory() );\n }\n}\n\n\n EudoraXXPort::EudoraXXPort( KABCore *core, QObject *parent, const char *name )\n: XXPortObject( core, parent, name )\n{\n createImportAction( i18n( \"Import Eudora Addressbook ..\" ) );\n \/\/createExportAction( i18n( \"Export Eudora Addressbook ..\" ) );\n}\n\nbool EudoraXXPort::exportContacts( const KABC::AddresseeList &, const QString& )\n{\n \/\/ ### implement me\n return false;\n}\n\nKABC::AddresseeList EudoraXXPort::importContacts( const QString& ) const\n{\n\n QString file=KFileDialog::getOpenFileName(QDir::homeDirPath() ,\"*.txt *.TXT\",0);\n if (file.isEmpty())\n return KABC::AddresseeList();\n\n QFile f(file);\n if (!f.open(IO_ReadOnly))\n return KABC::AddresseeList();\n\n QString line;\n QTextStream stream(&f);\n KABC::Addressee *a = 0;\n int bytesRead = 0;\n\n KABC::AddresseeList list;\n\n while(!stream.eof()) {\n line = stream.readLine();\n bytesRead += line.length();\n QString tmp;\n\n if (line.startsWith(\"alias\")) {\n if (a) { \/\/ Write it out\n list << *a;\n delete a;\n a = 0;\n a = new KABC::Addressee();\n } else a = new KABC::Addressee();\n tmp = key(line).stripWhiteSpace();\n if (!tmp.isEmpty()) a->setFormattedName(tmp);\n tmp = email(line).stripWhiteSpace();\n if (!tmp.isEmpty()) a->insertEmail(tmp);\n }\n else if (line.startsWith(\"note\")) {\n if (!a) break; \/\/ Must have an alias before a note\n \n tmp = comment(line).stripWhiteSpace();\n if (!tmp.isEmpty()) a->setNote(tmp);\n \n tmp = get(line, \"name\").stripWhiteSpace();\n if (!tmp.isEmpty()) a->setFamilyName(tmp);\n \n tmp = get(line, \"address\").stripWhiteSpace();\n if (!tmp.isEmpty()){\n KABC::Address addr;\n kdDebug() << tmp << endl; \/\/ dump complete address\n addr.setLabel(tmp);\n a->insertAddress(addr);\n }\n\n tmp = get(line,\"phone\").stripWhiteSpace();\n if (tmp.isEmpty())\n a->insertPhoneNumber( KABC::PhoneNumber( tmp, KABC::PhoneNumber::Voice ));\n }\n }\n\n\n if (a) { \/\/ Write out address\n list << *a;\n delete a;\n a = 0;\n }\n\n f.close();\n\n return list;\n}\n\nvoid EudoraXXPort::doExport( QFile *fp, const KABC::AddresseeList &list )\n{\n QTextStream t( fp );\n\n KABC::AddresseeList::ConstIterator iter;\n KABC::Field::List fields = core()->addressBook()->fields();\n KABC::Field::List::Iterator fieldIter;\n bool first = true;\n\n \/\/ First output the column headings\n for ( fieldIter = fields.begin(); fieldIter != fields.end(); ++fieldIter ) {\n if ( !first )\n t << \",\";\n\n t << \"\\\"\" << (*fieldIter)->label() << \"\\\"\";\n first = false;\n }\n t << \"\\n\";\n\n \/\/ Then all the addressee objects\n KABC::Addressee addr;\n for ( iter = list.begin(); iter != list.end(); ++iter ) {\n addr = *iter;\n first = true;\n\n for ( fieldIter = fields.begin(); fieldIter != fields.end(); ++fieldIter ) {\n if ( !first )\n t << \",\";\n\n t << \"\\\"\" << (*fieldIter)->value( addr ).replace( \"\\n\", \"\\\\n\" ) << \"\\\"\";\n first = false;\n }\n\n t << \"\\n\";\n }\n}\n\nQString EudoraXXPort::key(const QString& line) const\n{\n int e;\n QString result;\n int b=line.find('\\\"',0);\n if (b==-1) { \n b=line.find(' ');\n if (b==-1) { return result; }\n b+=1;\n e=line.find(' ',b);\n result=line.mid(b,e-b);\n return result;\n }\n b+=1;\n e=line.find('\\\"',b);if (e==-1) { return result; }\n result=line.mid(b,e-b);\n return result;\n}\n\nQString EudoraXXPort::email(const QString& line) const\n{\n int b;\n QString result;\n b=line.findRev('\\\"');if (b==-1) { \n b=line.findRev(' ');if(b==-1) { return result; }\n }\n result=line.mid(b+1);\n return result;\n}\n\nQString EudoraXXPort::comment(const QString& line) const\n{\n int b;\n QString result;\n uint i;\n b=line.findRev('>');if (b==-1) {\n b=line.findRev('\\\"');if (b==-1) { return result; }\n }\n result=line.mid(b+1);\n for(i=0;i',b);\n if (e==-1) { return QString::null; }\n\n e--;\n QString result=line.mid(b,e-b+1);\n for(i=0;i"} {"text":"\/\/@author A0097630B\n#include \"stdafx.h\"\n#include \"exceptions\/parse_error_exception.h\"\n#include \"date_time_parser.h\"\n\nnamespace You {\nnamespace NLP {\n\nusing ptime = boost::posix_time::ptime;\nnamespace qi = boost::spirit::qi;\nnamespace phoenix = boost::phoenix;\n\nptime DateTimeParser::parse(const StringType& string) {\n\tptime result;\n\tif (parse(string, result)) {\n\t\treturn result;\n\t} else {\n\t\tthrow ParserException();\n\t}\n}\n\nbool DateTimeParser::parse(const StringType& string, ptime& result) {\n\treturn qi::parse(\n\t\tbegin(string),\n\t\tend(string),\n\t\tDateTimeParser(),\n\t\tresult);\n}\n\nDateTimeParser::DateTimeParser() : DateTimeParser::base_type(start) {\n\tstart %= (\n\t\tdate[qi::_val = phoenix::construct(\n\t\t\tqi::_1,\n\t\t\tboost::posix_time::hours(0))\n\t\t]\n\t) >> qi::eoi;\n\tBOOST_SPIRIT_DEBUG_NODE(start);\n\n\t#pragma region Primitive date component parsers\n\tyear = (\n\t\t+ParserCharTraits::digit\n\t)[qi::_val = phoenix::bind(&DateTimeParser::parseFuzzyYear, qi::_1)];\n\tBOOST_SPIRIT_DEBUG_NODE(year);\n\n\tmonthNames.add\n\t\t(L\"jan\", boost::gregorian::Jan)\n\t\t(L\"feb\", boost::gregorian::Feb)\n\t\t(L\"mar\", boost::gregorian::Mar)\n\t\t(L\"apr\", boost::gregorian::Apr)\n\t\t(L\"may\", boost::gregorian::May)\n\t\t(L\"jun\", boost::gregorian::Jun)\n\t\t(L\"jul\", boost::gregorian::Jul)\n\t\t(L\"aug\", boost::gregorian::Aug)\n\t\t(L\"sep\", boost::gregorian::Sep)\n\t\t(L\"oct\", boost::gregorian::Oct)\n\t\t(L\"nov\", boost::gregorian::Nov)\n\t\t(L\"dec\", boost::gregorian::Dec);\n\tmonthNames.name(\"monthNames\");\n\n\tmonth %= (\n\t\tqi::int_ |\n\t\tParserCharTraits::no_case[monthNames]\n\t);\n\tmonth.name(\"month\");\n\n\tweekDays.add\n\t\t(L\"mon\", boost::gregorian::Monday)\n\t\t(L\"monday\", boost::gregorian::Monday)\n\t\t(L\"tue\", boost::gregorian::Tuesday)\n\t\t(L\"tuesday\", boost::gregorian::Tuesday)\n\t\t(L\"wed\", boost::gregorian::Wednesday)\n\t\t(L\"wednesday\", boost::gregorian::Wednesday)\n\t\t(L\"thu\", boost::gregorian::Thursday)\n\t\t(L\"thursday\", boost::gregorian::Thursday)\n\t\t(L\"fri\", boost::gregorian::Friday)\n\t\t(L\"friday\", boost::gregorian::Friday)\n\t\t(L\"sat\", boost::gregorian::Saturday)\n\t\t(L\"saturday\", boost::gregorian::Saturday)\n\t\t(L\"sun\", boost::gregorian::Sunday)\n\t\t(L\"sunday\", boost::gregorian::Sunday);\n\tweekDays.name(\"weekDays\");\n\n\tday %= (\n\t\tqi::int_\n\t);\n\tBOOST_SPIRIT_DEBUG_NODE(day);\n\t#pragma endregion\n\n\tspace = qi::omit[+ParserCharTraits::blank];\n\n\t#pragma region Supported Date Formats\n\tdateYearMonthDay = (\n\t\tyear >> (space | '-') >> month >> (space | '-') >> day\n\t)[qi::_val = phoenix::construct(qi::_1, qi::_2, qi::_3)];\n\tBOOST_SPIRIT_DEBUG_NODE(dateYearMonthDay);\n\n\tdateYearMonth = (\n\t\tyear >> '-' >> month\n\t)[qi::_val = phoenix::construct(qi::_1, qi::_2, 1)];\n\tBOOST_SPIRIT_DEBUG_NODE(dateYearMonth);\n\n\tdateYear = (\n\t\tyear\n\t)[qi::_val = phoenix::construct(qi::_1, boost::gregorian::Jan, 1)];\n\tBOOST_SPIRIT_DEBUG_NODE(dateYear);\n\n\tdateMonthYear = (\n\t\tmonth >> space >> year\n\t)[qi::_val = phoenix::construct(qi::_2, qi::_1, 1)];\n\tBOOST_SPIRIT_DEBUG_NODE(dateMonthYear);\n\n\tdateDayMonth = (\n\t\tday >> space >> month\n\t)[qi::_val = phoenix::bind(&constructDayMonthDate, qi::_1, qi::_2)];\n\tBOOST_SPIRIT_DEBUG_NODE(dateDayMonth);\n\n\tdate %= (\n\t\trelativeDate |\n\t\tdateYearMonthDay |\n\t\tdateYearMonth |\n\t\tdateMonthYear |\n\t\tdateDayMonth |\n\t\tdateYear\n\t);\n\tBOOST_SPIRIT_DEBUG_NODE(date);\n\t#pragma endregion\n\n\trelativeDate %= (\n\t\tParserCharTraits::no_case[(\n\t\t\tqi::lit(L\"next\") |\n\t\t\tqi::lit(L\"coming\"))] >> space >>\n\t\trelativeDateInDirection(1) |\n\n\t\tParserCharTraits::no_case[(\n\t\t\tqi::lit(L\"this\"))] >> space >>\n\t\trelativeDateInDirection(0) |\n\n\t\tParserCharTraits::no_case[(\n\t\t\tqi::lit(L\"last\") |\n\t\t\tqi::lit(L\"previous\"))] >> space >>\n\t\trelativeDateInDirection(-1) |\n\n\t\trelativeDateInDays\n\t);\n\trelativeDate.name(\"relativeDate\");\n\n\trelativeDateInDirection = ParserCharTraits::no_case[(\n\t\t(\n\t\t\tmonthNames\n\t\t\t[qi::_val = phoenix::bind(&\n\t\t\t\tconstructRelativeMonthDate, qi::_r1, qi::_1)] |\n\n\t\t\tweekDays\n\t\t\t[qi::_val = phoenix::bind(&\n\t\t\t\tconstructRelativeWeekDayDate, qi::_r1, qi::_1)]\n\t\t)\n\t)];\n\trelativeDateInDirection.name(\"relativeDateInDirection\");\n\n\trelativeDateInDays = (\n\t\tParserCharTraits::no_case[qi::lit(L\"tomorrow\")][\n\t\t\tqi::_val = phoenix::bind(&constructRelativeDate, 1)\n\t\t] |\n\n\t\tParserCharTraits::no_case[qi::lit(L\"yesterday\")][\n\t\t\tqi::_val = phoenix::bind(&constructRelativeDate, -1)\n\t\t] |\n\n\t\t((qi::int_ >> space >> ParserCharTraits::no_case[qi::lit(\"days\")])[\n\t\t\tqi::_val = phoenix::bind(&constructRelativeDate, qi::_1)\n\t\t]) |\n\n\t\t((qi::int_ >> space >> ParserCharTraits::no_case[qi::lit(\"weeks\")])[\n\t\t\tqi::_val = phoenix::bind(&constructRelativeDate,\n\t\t\t\tqi::_1 * 7)\n\t\t])\n\t);\n\trelativeDateInDays.name(\"relativeDateInDays\");\n\t#pragma endregion\n\n\tqi::on_error(start,\n\t\tphoenix::bind(&onFailure, qi::_1, qi::_2, qi::_3, qi::_4));\n}\n\nvoid DateTimeParser::onFailure(\n\tParserIteratorType \/*begin*\/,\n\tParserIteratorType end,\n\tParserIteratorType errorPos,\n\tconst boost::spirit::info& message) {\n\tStringType lexeme(errorPos, end);\n\tthrow ParseErrorException(message, lexeme);\n}\n\n} \/\/ namespace NLP\n} \/\/ namespace You\nOur date parser might not parse a complete string.\/\/@author A0097630B\n#include \"stdafx.h\"\n#include \"exceptions\/parse_error_exception.h\"\n#include \"date_time_parser.h\"\n\nnamespace You {\nnamespace NLP {\n\nusing ptime = boost::posix_time::ptime;\nnamespace qi = boost::spirit::qi;\nnamespace phoenix = boost::phoenix;\n\nptime DateTimeParser::parse(const StringType& string) {\n\tptime result;\n\tif (parse(string, result)) {\n\t\treturn result;\n\t} else {\n\t\tthrow ParserException();\n\t}\n}\n\nbool DateTimeParser::parse(const StringType& string, ptime& result) {\n\treturn qi::parse(\n\t\tbegin(string),\n\t\tend(string),\n\t\tDateTimeParser(),\n\t\tresult);\n}\n\nDateTimeParser::DateTimeParser() : DateTimeParser::base_type(start) {\n\tstart %= (\n\t\tdate[qi::_val = phoenix::construct(\n\t\t\tqi::_1,\n\t\t\tboost::posix_time::hours(0))\n\t\t]\n\t);\n\tBOOST_SPIRIT_DEBUG_NODE(start);\n\n\t#pragma region Primitive date component parsers\n\tyear = (\n\t\t+ParserCharTraits::digit\n\t)[qi::_val = phoenix::bind(&DateTimeParser::parseFuzzyYear, qi::_1)];\n\tBOOST_SPIRIT_DEBUG_NODE(year);\n\n\tmonthNames.add\n\t\t(L\"jan\", boost::gregorian::Jan)\n\t\t(L\"feb\", boost::gregorian::Feb)\n\t\t(L\"mar\", boost::gregorian::Mar)\n\t\t(L\"apr\", boost::gregorian::Apr)\n\t\t(L\"may\", boost::gregorian::May)\n\t\t(L\"jun\", boost::gregorian::Jun)\n\t\t(L\"jul\", boost::gregorian::Jul)\n\t\t(L\"aug\", boost::gregorian::Aug)\n\t\t(L\"sep\", boost::gregorian::Sep)\n\t\t(L\"oct\", boost::gregorian::Oct)\n\t\t(L\"nov\", boost::gregorian::Nov)\n\t\t(L\"dec\", boost::gregorian::Dec);\n\tmonthNames.name(\"monthNames\");\n\n\tmonth %= (\n\t\tqi::int_ |\n\t\tParserCharTraits::no_case[monthNames]\n\t);\n\tmonth.name(\"month\");\n\n\tweekDays.add\n\t\t(L\"mon\", boost::gregorian::Monday)\n\t\t(L\"monday\", boost::gregorian::Monday)\n\t\t(L\"tue\", boost::gregorian::Tuesday)\n\t\t(L\"tuesday\", boost::gregorian::Tuesday)\n\t\t(L\"wed\", boost::gregorian::Wednesday)\n\t\t(L\"wednesday\", boost::gregorian::Wednesday)\n\t\t(L\"thu\", boost::gregorian::Thursday)\n\t\t(L\"thursday\", boost::gregorian::Thursday)\n\t\t(L\"fri\", boost::gregorian::Friday)\n\t\t(L\"friday\", boost::gregorian::Friday)\n\t\t(L\"sat\", boost::gregorian::Saturday)\n\t\t(L\"saturday\", boost::gregorian::Saturday)\n\t\t(L\"sun\", boost::gregorian::Sunday)\n\t\t(L\"sunday\", boost::gregorian::Sunday);\n\tweekDays.name(\"weekDays\");\n\n\tday %= (\n\t\tqi::int_\n\t);\n\tBOOST_SPIRIT_DEBUG_NODE(day);\n\t#pragma endregion\n\n\tspace = qi::omit[+ParserCharTraits::blank];\n\n\t#pragma region Supported Date Formats\n\tdateYearMonthDay = (\n\t\tyear >> (space | '-') >> month >> (space | '-') >> day\n\t)[qi::_val = phoenix::construct(qi::_1, qi::_2, qi::_3)];\n\tBOOST_SPIRIT_DEBUG_NODE(dateYearMonthDay);\n\n\tdateYearMonth = (\n\t\tyear >> '-' >> month\n\t)[qi::_val = phoenix::construct(qi::_1, qi::_2, 1)];\n\tBOOST_SPIRIT_DEBUG_NODE(dateYearMonth);\n\n\tdateYear = (\n\t\tyear\n\t)[qi::_val = phoenix::construct(qi::_1, boost::gregorian::Jan, 1)];\n\tBOOST_SPIRIT_DEBUG_NODE(dateYear);\n\n\tdateMonthYear = (\n\t\tmonth >> space >> year\n\t)[qi::_val = phoenix::construct(qi::_2, qi::_1, 1)];\n\tBOOST_SPIRIT_DEBUG_NODE(dateMonthYear);\n\n\tdateDayMonth = (\n\t\tday >> space >> month\n\t)[qi::_val = phoenix::bind(&constructDayMonthDate, qi::_1, qi::_2)];\n\tBOOST_SPIRIT_DEBUG_NODE(dateDayMonth);\n\n\tdate %= (\n\t\trelativeDate |\n\t\tdateYearMonthDay |\n\t\tdateYearMonth |\n\t\tdateMonthYear |\n\t\tdateDayMonth |\n\t\tdateYear\n\t);\n\tBOOST_SPIRIT_DEBUG_NODE(date);\n\t#pragma endregion\n\n\trelativeDate %= (\n\t\tParserCharTraits::no_case[(\n\t\t\tqi::lit(L\"next\") |\n\t\t\tqi::lit(L\"coming\"))] >> space >>\n\t\trelativeDateInDirection(1) |\n\n\t\tParserCharTraits::no_case[(\n\t\t\tqi::lit(L\"this\"))] >> space >>\n\t\trelativeDateInDirection(0) |\n\n\t\tParserCharTraits::no_case[(\n\t\t\tqi::lit(L\"last\") |\n\t\t\tqi::lit(L\"previous\"))] >> space >>\n\t\trelativeDateInDirection(-1) |\n\n\t\trelativeDateInDays\n\t);\n\trelativeDate.name(\"relativeDate\");\n\n\trelativeDateInDirection = ParserCharTraits::no_case[(\n\t\t(\n\t\t\tmonthNames\n\t\t\t[qi::_val = phoenix::bind(&\n\t\t\t\tconstructRelativeMonthDate, qi::_r1, qi::_1)] |\n\n\t\t\tweekDays\n\t\t\t[qi::_val = phoenix::bind(&\n\t\t\t\tconstructRelativeWeekDayDate, qi::_r1, qi::_1)]\n\t\t)\n\t)];\n\trelativeDateInDirection.name(\"relativeDateInDirection\");\n\n\trelativeDateInDays = (\n\t\tParserCharTraits::no_case[qi::lit(L\"tomorrow\")][\n\t\t\tqi::_val = phoenix::bind(&constructRelativeDate, 1)\n\t\t] |\n\n\t\tParserCharTraits::no_case[qi::lit(L\"yesterday\")][\n\t\t\tqi::_val = phoenix::bind(&constructRelativeDate, -1)\n\t\t] |\n\n\t\t((qi::int_ >> space >> ParserCharTraits::no_case[qi::lit(\"days\")])[\n\t\t\tqi::_val = phoenix::bind(&constructRelativeDate, qi::_1)\n\t\t]) |\n\n\t\t((qi::int_ >> space >> ParserCharTraits::no_case[qi::lit(\"weeks\")])[\n\t\t\tqi::_val = phoenix::bind(&constructRelativeDate,\n\t\t\t\tqi::_1 * 7)\n\t\t])\n\t);\n\trelativeDateInDays.name(\"relativeDateInDays\");\n\t#pragma endregion\n\n\tqi::on_error(start,\n\t\tphoenix::bind(&onFailure, qi::_1, qi::_2, qi::_3, qi::_4));\n}\n\nvoid DateTimeParser::onFailure(\n\tParserIteratorType \/*begin*\/,\n\tParserIteratorType end,\n\tParserIteratorType errorPos,\n\tconst boost::spirit::info& message) {\n\tStringType lexeme(errorPos, end);\n\tthrow ParseErrorException(message, lexeme);\n}\n\n} \/\/ namespace NLP\n} \/\/ namespace You\n<|endoftext|>"} {"text":"\/*******************************\nCopyright (c) 2016-2021 Grégoire Angerand\n\nPermission is hereby granted, free of charge, to any person obtaining a copy\nof this software and associated documentation files (the \"Software\"), to deal\nin the Software without restriction, including without limitation the rights\nto use, copy, modify, merge, publish, distribute, sublicense, and\/or sell\ncopies of the Software, and to permit persons to whom the Software is\nfurnished to do so, subject to the following conditions:\n\nThe above copyright notice and this permission notice shall be included in all\ncopies or substantial portions of the Software.\n\nTHE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\nIMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\nFITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE\nAUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\nLIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,\nOUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE\nSOFTWARE.\n**********************************\/\n\n#include \"utils.h\"\n\n#include \n#include \n#include \n\n#include \n\n#ifdef Y_OS_WIN\n#include \n#endif\n\n#ifdef Y_GCC\n#include \n#include \n#include \n#endif\n\nnamespace y {\n\n#ifdef Y_DEBUG\nnamespace core::result {\nbool break_on_error = false;\n}\n#endif\n\n\nvoid break_in_debugger() {\n#ifdef Y_OS_WIN\n if(IsDebuggerPresent()) {\n DebugBreak();\n }\n#endif\n}\n\n\nvoid fatal(const char* msg, const char* file, int line) {\n core::String msg_str(msg);\n if(file) {\n fmt_into(msg_str, \" in file \\\"%\\\"\", file);\n }\n if(line) {\n fmt_into(msg_str, \" at line %\", line);\n }\n\n if(const char* thread_name = concurrent::thread_name()) {\n fmt_into(msg_str, \" on thread \\\"%\\\"\", thread_name);\n }\n\n log_msg(msg_str, Log::Error);\n y_breakpoint;\n std::abort();\n}\n\n}\n\nFixed potential stack overflow in fatal\/*******************************\nCopyright (c) 2016-2021 Grégoire Angerand\n\nPermission is hereby granted, free of charge, to any person obtaining a copy\nof this software and associated documentation files (the \"Software\"), to deal\nin the Software without restriction, including without limitation the rights\nto use, copy, modify, merge, publish, distribute, sublicense, and\/or sell\ncopies of the Software, and to permit persons to whom the Software is\nfurnished to do so, subject to the following conditions:\n\nThe above copyright notice and this permission notice shall be included in all\ncopies or substantial portions of the Software.\n\nTHE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\nIMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\nFITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE\nAUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\nLIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,\nOUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE\nSOFTWARE.\n**********************************\/\n\n#include \"utils.h\"\n\n#include \n#include \n\n#include \n\n#ifdef Y_OS_WIN\n#include \n#endif\n\n#ifdef Y_GCC\n#include \n#include \n#include \n#endif\n\nnamespace y {\n\n#ifdef Y_DEBUG\nnamespace core::result {\nbool break_on_error = false;\n}\n#endif\n\n\nvoid break_in_debugger() {\n#ifdef Y_OS_WIN\n if(IsDebuggerPresent()) {\n DebugBreak();\n }\n#endif\n}\n\n\nvoid fatal(const char* msg, const char* file, int line) {\n \/\/ Don't use fmt since it can assert\n std::array buffer = {};\n std::snprintf(buffer.data(), buffer.size(), \"%s\", msg);\n\n if(file) {\n const auto tmp_buffer = buffer;\n std::snprintf(buffer.data(), buffer.size(), \"%s in file \\\"%s\\\"\", tmp_buffer.data(), file);\n }\n if(line) {\n const auto tmp_buffer = buffer;\n std::snprintf(buffer.data(), buffer.size(), \"%s at line %i\", tmp_buffer.data(), line);\n }\n\n if(const char* thread_name = concurrent::thread_name()) {\n const auto tmp_buffer = buffer;\n std::snprintf(buffer.data(), buffer.size(), \"%s on thread \\\"%s\\\"\", tmp_buffer.data(), thread_name);\n }\n\n log_msg(buffer.data(), Log::Error);\n y_breakpoint;\n std::abort();\n}\n\n}\n\n<|endoftext|>"} {"text":"\/* -*- mode: c++; c-basic-offset:4 -*-\n utils\/archivedefinition.cpp\n\n This file is part of Kleopatra, the KDE keymanager\n Copyright (c) 2009 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 \n\n#include \"archivedefinition.h\"\n\n#include \n#include \n#include \n\n#include \n#include \n#include \n#include \n\n#include \n#include \n#include \n#include \n#include \n\n#include \n\nusing namespace Kleo;\nusing namespace boost;\n\nstatic const QLatin1String ID_ENTRY( \"id\" );\nstatic const QLatin1String NAME_ENTRY( \"name\" );\nstatic const QLatin1String COMMAND_ENTRY( \"pack-command\" );\nstatic const QLatin1String EXTENSIONS_ENTRY( \"extensions\" );\nstatic const QLatin1String FILE_PLACEHOLDER( \"%f\" );\n\nnamespace {\n\n class ArchiveDefinitionError : Kleo::Exception {\n const QString m_id;\n public:\n ArchiveDefinitionError( const QString & id, const QString & message )\n : Kleo::Exception( GPG_ERR_INV_PARAMETER, i18n(\"Error in archive definition %1: %2\").arg( id, message ) ),\n m_id( id )\n {\n\n }\n ~ArchiveDefinitionError() throw() {}\n\n const QString & archiveDefinitionId() const { return m_id; }\n };\n\n class KConfigBasedArchiveDefinition : public ArchiveDefinition {\n public:\n explicit KConfigBasedArchiveDefinition( const KConfigGroup & group )\n : ArchiveDefinition( group.readEntryUntranslated( ID_ENTRY ),\n group.readEntry( NAME_ENTRY ),\n group.readEntry( EXTENSIONS_ENTRY, QStringList() ) )\n {\n if ( extensions().empty() )\n throw ArchiveDefinitionError( id(), i18n(\"'extensions' entry is empty\/missing\") );\n const QStringList l = group.readEntry( COMMAND_ENTRY ).split( QLatin1Char(' '), QString::SkipEmptyParts );\n qDebug() << \"ArchiveDefinition[\" << id() << ']' << l;\n if ( l.empty() )\n throw ArchiveDefinitionError( id(), i18n(\"'command' entry is empty\/missing\") );\n m_command = l.front();\n const int idx = l.indexOf( FILE_PLACEHOLDER );\n if ( idx < 0 ) {\n \/\/ none -> append\n m_prefixArguments = l.mid( 1 );\n } else {\n m_prefixArguments = l.mid( 1, idx-1 );\n m_postfixArguments = l.mid( idx+1 );\n }\n qDebug() << \"ArchiveDefinition[\" << id() << ']' << m_command << m_prefixArguments << FILE_PLACEHOLDER << m_postfixArguments;\n }\n\n private:\n \/* reimp *\/ QString doGetCommand() const { return m_command; }\n \/* reimp *\/ QStringList doGetArguments( const QStringList & files ) const {\n return m_prefixArguments + files + m_postfixArguments;\n }\n\n private:\n QString m_command;\n QStringList m_prefixArguments, m_postfixArguments;\n };\n\n}\n\nArchiveDefinition::ArchiveDefinition( const QString & id, const QString & label, const QStringList & extensions )\n : m_id( id ), m_label( label ), m_extensions( extensions )\n{\n\n}\n\nArchiveDefinition::~ArchiveDefinition() {}\n\nshared_ptr ArchiveDefinition::createInput( const QStringList & files ) const {\n const QString base = heuristicBaseDirectory( files );\n if ( base.isEmpty() )\n throw Kleo::Exception( GPG_ERR_CONFLICT, i18n(\"Cannot find common base directory for these files:\\n%1\", files.join( \"\\n\" ) ) );\n qDebug() << \"heuristicBaseDirectory(\" << files << \") ->\" << base;\n const QStringList relative = makeRelativeTo( base, files );\n qDebug() << \"relative\" << relative;\n return Input::createFromProcessStdOut( doGetCommand(),\n doGetArguments( relative ),\n QDir( base ) );\n}\n\n\/\/ static\nstd::vector< shared_ptr > ArchiveDefinition::getArchiveDefinitions() {\n std::vector< shared_ptr > result;\n if ( const KSharedConfigPtr config = KGlobal::config() ) {\n const QStringList groups = config->groupList().filter( QRegExp(QLatin1String(\"^Archive Definition #\")) );\n result.reserve( groups.size() );\n Q_FOREACH( const QString & group, groups )\n try {\n const shared_ptr ad( new KConfigBasedArchiveDefinition( KConfigGroup( config, group ) ) );\n result.push_back( ad );\n } catch ( const std::exception & e ) {\n qDebug() << e.what();\n }\n }\n return result;\n}\nArchiveDefiniton: read config from libkleopatrarc, not kleopatrarc\/* -*- mode: c++; c-basic-offset:4 -*-\n utils\/archivedefinition.cpp\n\n This file is part of Kleopatra, the KDE keymanager\n Copyright (c) 2009 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 \n\n#include \"archivedefinition.h\"\n\n#include \n#include \n#include \n\n#include \n\n#include \n#include \n#include \n#include \n\n#include \n#include \n#include \n#include \n#include \n\n#include \n\nusing namespace Kleo;\nusing namespace boost;\n\nstatic const QLatin1String ID_ENTRY( \"id\" );\nstatic const QLatin1String NAME_ENTRY( \"name\" );\nstatic const QLatin1String COMMAND_ENTRY( \"pack-command\" );\nstatic const QLatin1String EXTENSIONS_ENTRY( \"extensions\" );\nstatic const QLatin1String FILE_PLACEHOLDER( \"%f\" );\n\nnamespace {\n\n class ArchiveDefinitionError : Kleo::Exception {\n const QString m_id;\n public:\n ArchiveDefinitionError( const QString & id, const QString & message )\n : Kleo::Exception( GPG_ERR_INV_PARAMETER, i18n(\"Error in archive definition %1: %2\").arg( id, message ) ),\n m_id( id )\n {\n\n }\n ~ArchiveDefinitionError() throw() {}\n\n const QString & archiveDefinitionId() const { return m_id; }\n };\n\n class KConfigBasedArchiveDefinition : public ArchiveDefinition {\n public:\n explicit KConfigBasedArchiveDefinition( const KConfigGroup & group )\n : ArchiveDefinition( group.readEntryUntranslated( ID_ENTRY ),\n group.readEntry( NAME_ENTRY ),\n group.readEntry( EXTENSIONS_ENTRY, QStringList() ) )\n {\n if ( extensions().empty() )\n throw ArchiveDefinitionError( id(), i18n(\"'extensions' entry is empty\/missing\") );\n const QStringList l = group.readEntry( COMMAND_ENTRY ).split( QLatin1Char(' '), QString::SkipEmptyParts );\n qDebug() << \"ArchiveDefinition[\" << id() << ']' << l;\n if ( l.empty() )\n throw ArchiveDefinitionError( id(), i18n(\"'command' entry is empty\/missing\") );\n m_command = l.front();\n const int idx = l.indexOf( FILE_PLACEHOLDER );\n if ( idx < 0 ) {\n \/\/ none -> append\n m_prefixArguments = l.mid( 1 );\n } else {\n m_prefixArguments = l.mid( 1, idx-1 );\n m_postfixArguments = l.mid( idx+1 );\n }\n qDebug() << \"ArchiveDefinition[\" << id() << ']' << m_command << m_prefixArguments << FILE_PLACEHOLDER << m_postfixArguments;\n }\n\n private:\n \/* reimp *\/ QString doGetCommand() const { return m_command; }\n \/* reimp *\/ QStringList doGetArguments( const QStringList & files ) const {\n return m_prefixArguments + files + m_postfixArguments;\n }\n\n private:\n QString m_command;\n QStringList m_prefixArguments, m_postfixArguments;\n };\n\n}\n\nArchiveDefinition::ArchiveDefinition( const QString & id, const QString & label, const QStringList & extensions )\n : m_id( id ), m_label( label ), m_extensions( extensions )\n{\n\n}\n\nArchiveDefinition::~ArchiveDefinition() {}\n\nshared_ptr ArchiveDefinition::createInput( const QStringList & files ) const {\n const QString base = heuristicBaseDirectory( files );\n if ( base.isEmpty() )\n throw Kleo::Exception( GPG_ERR_CONFLICT, i18n(\"Cannot find common base directory for these files:\\n%1\", files.join( \"\\n\" ) ) );\n qDebug() << \"heuristicBaseDirectory(\" << files << \") ->\" << base;\n const QStringList relative = makeRelativeTo( base, files );\n qDebug() << \"relative\" << relative;\n return Input::createFromProcessStdOut( doGetCommand(),\n doGetArguments( relative ),\n QDir( base ) );\n}\n\n\/\/ static\nstd::vector< shared_ptr > ArchiveDefinition::getArchiveDefinitions() {\n std::vector< shared_ptr > result;\n if ( KConfig * config = CryptoBackendFactory::instance()->configObject() ) {\n const QStringList groups = config->groupList().filter( QRegExp(QLatin1String(\"^Archive Definition #\")) );\n result.reserve( groups.size() );\n Q_FOREACH( const QString & group, groups )\n try {\n const shared_ptr ad( new KConfigBasedArchiveDefinition( KConfigGroup( config, group ) ) );\n result.push_back( ad );\n } catch ( const std::exception & e ) {\n qDebug() << e.what();\n }\n }\n return result;\n}\n<|endoftext|>"} {"text":"\/*\n This file is part of the kolab resource - the implementation of the\n Kolab storage format. See www.kolab.org for documentation on this.\n\n Copyright (c) 2004 Bo Thorsen \n\n This library is free software; you can redistribute it and\/or\n modify it under the terms of the GNU Library General Public\n License as published by the Free Software Foundation; either\n version 2 of the License, or (at your option) any later version.\n\n This library is distributed in the hope that it will be useful,\n but WITHOUT ANY WARRANTY; without even the implied warranty of\n MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU\n Library General Public License for more details.\n\n You should have received a copy of the GNU Library General Public License\n along with this library; see the file COPYING.LIB. If not, write to\n the Free Software Foundation, Inc., 51 Franklin Street, Fifth Floor,\n Boston, MA 02110-1301, USA.\n\n In addition, as a special exception, the copyright holders give\n permission to link the code of this program with any edition of\n the Qt library by Trolltech AS, Norway (or with modified versions\n of Qt that use the same license as Qt), and distribute linked\n combinations including the two. You must obey the GNU General\n Public License in all respects for all of the code used other than\n Qt. If you modify this file, you may extend this exception to\n your version of the file, but you are not obligated to do so. If\n you do not wish to do so, delete this exception statement from\n your version.\n*\/\n\n#include \"kolabbase.h\"\n\n#include \n#include \n#include \n#include \n#include \n#include \n#include \n\nusing namespace Kolab;\n\nKolabBase::KolabBase( const QString& tz )\n : mCreationDate( QDateTime::currentDateTime() ),\n mLastModified( KDateTime::currentUtcDateTime() ),\n mSensitivity( Public ),\n mTimeZone( KSystemTimeZones::zone( tz ) ),\n mHasPilotSyncId( false ), mHasPilotSyncStatus( false )\n{\n}\n\nKolabBase::~KolabBase()\n{\n}\n\nvoid KolabBase::setFields( const KCal::Incidence* incidence )\n{\n \/\/ So far unhandled KCal::IncidenceBase fields:\n \/\/ mPilotID, mSyncStatus, mFloats\n\n setUid( incidence->uid() );\n setBody( incidence->description() );\n setCategories( incidence->categoriesStr() );\n setCreationDate( localToUTC( incidence->created() ) );\n setLastModified( incidence->lastModified() );\n setSensitivity( static_cast( incidence->secrecy() ) );\n \/\/ TODO: Attachments\n}\n\nvoid KolabBase::saveTo( KCal::Incidence* incidence ) const\n{\n incidence->setUid( uid() );\n incidence->setDescription( body() );\n incidence->setCategories( categories() );\n incidence->setCreated( utcToLocal( creationDate() ) );\n incidence->setLastModified( lastModified() );\n switch( sensitivity() ) {\n case 1:\n incidence->setSecrecy( KCal::Incidence::SecrecyPrivate );\n break;\n case 2:\n incidence->setSecrecy( KCal::Incidence::SecrecyConfidential );\n break;\n default:\n incidence->setSecrecy( KCal::Incidence::SecrecyPublic );\n break;\n }\n\n \/\/ TODO: Attachments\n}\n\nvoid KolabBase::setFields( const KABC::Addressee* addressee )\n{\n \/\/ An addressee does not have a creation date, so somehow we should\n \/\/ make one, if this is a new entry\n\n setUid( addressee->uid() );\n setBody( addressee->note() );\n setCategories( addressee->categories().join( \",\" ) );\n\n \/\/ Set creation-time and last-modification-time\n const QString creationString = addressee->custom( \"KOLAB\", \"CreationDate\" );\n kDebug(5006) <<\"Creation time string:\" << creationString;\n KDateTime creationDate;\n if ( creationString.isEmpty() ) {\n creationDate = KDateTime::currentDateTime(KDateTime::Spec( mTimeZone ) );\n kDebug(5006) <<\"Creation date set to current time\";\n }\n else {\n creationDate = stringToDateTime( creationString );\n kDebug(5006) <<\"Creation date loaded\";\n }\n KDateTime modified = KDateTime( addressee->revision(), mTimeZone );\n if ( !modified.isValid() )\n modified = KDateTime::currentUtcDateTime();\n setLastModified( modified );\n if ( modified < creationDate ) {\n \/\/ It's not possible that the modification date is earlier than creation\n creationDate = modified;\n kDebug(5006) <<\"Creation date set to modification date\";\n }\n setCreationDate( creationDate );\n const QString newCreationDate = dateTimeToString( creationDate );\n if ( creationString != newCreationDate ) {\n \/\/ We modified the creation date, so store it for future reference\n const_cast( addressee )\n ->insertCustom( \"KOLAB\", \"CreationDate\", newCreationDate );\n kDebug(5006) <<\"Creation date modified. New one:\" << newCreationDate;\n }\n\n switch( addressee->secrecy().type() ) {\n case KABC::Secrecy::Private:\n setSensitivity( Private );\n break;\n case KABC::Secrecy::Confidential:\n setSensitivity( Confidential );\n break;\n default:\n setSensitivity( Public );\n }\n\n \/\/ TODO: Attachments\n}\n\nvoid KolabBase::saveTo( KABC::Addressee* addressee ) const\n{\n addressee->setUid( uid() );\n addressee->setNote( body() );\n addressee->setCategories( categories().split( ',', QString::SkipEmptyParts ) );\n addressee->setRevision( lastModified().toZone( mTimeZone ).dateTime() );\n addressee->insertCustom( \"KOLAB\", \"CreationDate\",\n dateTimeToString( creationDate() ) );\n\n switch( sensitivity() ) {\n case Private:\n addressee->setSecrecy( KABC::Secrecy( KABC::Secrecy::Private ) );\n break;\n case Confidential:\n addressee->setSecrecy( KABC::Secrecy( KABC::Secrecy::Confidential ) );\n break;\n default:\n addressee->setSecrecy( KABC::Secrecy( KABC::Secrecy::Public ) );\n break;\n }\n \/\/ TODO: Attachments\n}\n\nvoid KolabBase::setUid( const QString& uid )\n{\n mUid = uid;\n}\n\nQString KolabBase::uid() const\n{\n return mUid;\n}\n\nvoid KolabBase::setBody( const QString& body )\n{\n mBody = body;\n}\n\nQString KolabBase::body() const\n{\n return mBody;\n}\n\nvoid KolabBase::setCategories( const QString& categories )\n{\n mCategories = categories;\n}\n\nQString KolabBase::categories() const\n{\n return mCategories;\n}\n\nvoid KolabBase::setCreationDate( const KDateTime& date )\n{\n mCreationDate = date;\n}\n\nKDateTime KolabBase::creationDate() const\n{\n return mCreationDate;\n}\n\nvoid KolabBase::setLastModified( const KDateTime& date )\n{\n mLastModified = date;\n}\n\nKDateTime KolabBase::lastModified() const\n{\n return mLastModified;\n}\n\nvoid KolabBase::setSensitivity( Sensitivity sensitivity )\n{\n mSensitivity = sensitivity;\n}\n\nKolabBase::Sensitivity KolabBase::sensitivity() const\n{\n return mSensitivity;\n}\n\nvoid KolabBase::setPilotSyncId( unsigned long id )\n{\n mHasPilotSyncId = true;\n mPilotSyncId = id;\n}\n\nbool KolabBase::hasPilotSyncId() const\n{\n return mHasPilotSyncId;\n}\n\nunsigned long KolabBase::pilotSyncId() const\n{\n return mPilotSyncId;\n}\n\nvoid KolabBase::setPilotSyncStatus( int status )\n{\n mHasPilotSyncStatus = true;\n mPilotSyncStatus = status;\n}\n\nbool KolabBase::hasPilotSyncStatus() const\n{\n return mHasPilotSyncStatus;\n}\n\nint KolabBase::pilotSyncStatus() const\n{\n return mPilotSyncStatus;\n}\n\nbool KolabBase::loadEmailAttribute( QDomElement& element, Email& email )\n{\n for ( QDomNode n = element.firstChild(); !n.isNull(); n = n.nextSibling() ) {\n if ( n.isComment() )\n continue;\n if ( n.isElement() ) {\n QDomElement e = n.toElement();\n const QString tagName = e.tagName();\n\n if ( tagName == \"display-name\" )\n email.displayName = e.text();\n else if ( tagName == \"smtp-address\" )\n email.smtpAddress = e.text();\n else\n \/\/ TODO: Unhandled tag - save for later storage\n kDebug() <<\"Warning: Unhandled tag\" << e.tagName();\n } else\n kDebug() <<\"Node is not a comment or an element???\";\n }\n\n return true;\n}\n\nvoid KolabBase::saveEmailAttribute( QDomElement& element, const Email& email,\n const QString& tagName ) const\n{\n QDomElement e = element.ownerDocument().createElement( tagName );\n element.appendChild( e );\n writeString( e, \"display-name\", email.displayName );\n writeString( e, \"smtp-address\", email.smtpAddress );\n}\n\nbool KolabBase::loadAttribute( QDomElement& element )\n{\n const QString tagName = element.tagName();\n switch ( tagName[0].toLatin1() ) {\n case 'u':\n if ( tagName == \"uid\" ) {\n setUid( element.text() );\n return true;\n }\n break;\n case 'b':\n if ( tagName == \"body\" ) {\n setBody( element.text() );\n return true;\n }\n break;\n case 'c':\n if ( tagName == \"categories\" ) {\n setCategories( element.text() );\n return true;\n }\n if ( tagName == \"creation-date\" ) {\n setCreationDate( stringToDateTime( element.text() ) );\n return true;\n }\n break;\n case 'l':\n if ( tagName == \"last-modification-date\" ) {\n setLastModified( stringToDateTime( element.text() ) );\n return true;\n }\n break;\n case 's':\n if ( tagName == \"sensitivity\" ) {\n setSensitivity( stringToSensitivity( element.text() ) );\n return true;\n }\n break;\n case 'p':\n if ( tagName == \"product-id\" )\n return true; \/\/ ignore this field\n if ( tagName == \"pilot-sync-id\" ) {\n setPilotSyncId( element.text().toULong() );\n return true;\n }\n if ( tagName == \"pilot-sync-status\" ) {\n setPilotSyncStatus( element.text().toInt() );\n return true;\n }\n break;\n default:\n break;\n }\n return false;\n}\n\nbool KolabBase::saveAttributes( QDomElement& element ) const\n{\n writeString( element, \"product-id\", productID() );\n writeString( element, \"uid\", uid() );\n writeString( element, \"body\", body() );\n writeString( element, \"categories\", categories() );\n writeString( element, \"creation-date\", dateTimeToString( creationDate() ) );\n writeString( element, \"last-modification-date\",\n dateTimeToString( lastModified().toZone( mTimeZone ) ) );\n writeString( element, \"sensitivity\", sensitivityToString( sensitivity() ) );\n if ( hasPilotSyncId() )\n writeString( element, \"pilot-sync-id\", QString::number( pilotSyncId() ) );\n if ( hasPilotSyncStatus() )\n writeString( element, \"pilot-sync-status\", QString::number( pilotSyncStatus() ) );\n return true;\n}\n\nbool KolabBase::load( const QString& xml )\n{\n QString errorMsg;\n int errorLine, errorColumn;\n QDomDocument document;\n bool ok = document.setContent( xml, &errorMsg, &errorLine, &errorColumn );\n\n if ( !ok ) {\n qWarning( \"Error loading document: %s, line %d, column %d\",\n qPrintable( errorMsg ), errorLine, errorColumn );\n return false;\n }\n\n \/\/ XML file loaded into tree. Now parse it\n return loadXML( document );\n}\n\nbool KolabBase::load( QFile& xml )\n{\n QString errorMsg;\n int errorLine, errorColumn;\n QDomDocument document;\n bool ok = document.setContent( &xml, &errorMsg, &errorLine, &errorColumn );\n\n if ( !ok ) {\n qWarning( \"Error loading document: %s, line %d, column %d\",\n qPrintable( errorMsg ), errorLine, errorColumn );\n return false;\n }\n\n \/\/ XML file loaded into tree. Now parse it\n return loadXML( document );\n}\n\nQDomDocument KolabBase::domTree()\n{\n QDomDocument document;\n\n QString p = \"version=\\\"1.0\\\" encoding=\\\"UTF-8\\\"\";\n document.appendChild(document.createProcessingInstruction( \"xml\", p ) );\n\n return document;\n}\n\n\nQString KolabBase::dateTimeToString( const KDateTime& time )\n{\n return time.toString( KDateTime::ISODate );\n}\n\nQString KolabBase::dateToString( const QDate& date )\n{\n return date.toString( Qt::ISODate );\n}\n\nKDateTime KolabBase::stringToDateTime( const QString& _date )\n{\n QString date( _date );\n \/\/deal with data from some clients that always append a Z to dates\n if ( date.endsWith( \"ZZ\" ) )\n date.truncate( date.length() - 1 );\n return KDateTime::fromString( date, KDateTime::ISODate );\n}\n\nQDate KolabBase::stringToDate( const QString& date )\n{\n return QDate::fromString( date, Qt::ISODate );\n}\n\nQString KolabBase::sensitivityToString( Sensitivity s )\n{\n switch( s ) {\n case Private: return \"private\";\n case Confidential: return \"confidential\";\n case Public: return \"public\";\n }\n\n return \"What what what???\";\n}\n\nKolabBase::Sensitivity KolabBase::stringToSensitivity( const QString& s )\n{\n if ( s == \"private\" )\n return Private;\n if ( s == \"confidential\" )\n return Confidential;\n return Public;\n}\n\nQString KolabBase::colorToString( const QColor& color )\n{\n \/\/ Color is in the format \"#RRGGBB\"\n return color.name();\n}\n\nQColor KolabBase::stringToColor( const QString& s )\n{\n return QColor( s );\n}\n\nvoid KolabBase::writeString( QDomElement& element, const QString& tag,\n const QString& tagString )\n{\n if ( !tagString.isEmpty() ) {\n QDomElement e = element.ownerDocument().createElement( tag );\n QDomText t = element.ownerDocument().createTextNode( tagString );\n e.appendChild( t );\n element.appendChild( e );\n }\n}\n\nKDateTime KolabBase::localToUTC( const KDateTime& time ) const\n{\n return time.toUtc();\n}\n\nKDateTime KolabBase::utcToLocal( const KDateTime& time ) const\n{\n KDateTime dt = time;\n dt.setTimeSpec( KDateTime::UTC );\n return dt;\n}\nBlocked revisions 961858 via svnmerge\/*\n This file is part of the kolab resource - the implementation of the\n Kolab storage format. See www.kolab.org for documentation on this.\n\n Copyright (c) 2004 Bo Thorsen \n\n This library is free software; you can redistribute it and\/or\n modify it under the terms of the GNU Library General Public\n License as published by the Free Software Foundation; either\n version 2 of the License, or (at your option) any later version.\n\n This library is distributed in the hope that it will be useful,\n but WITHOUT ANY WARRANTY; without even the implied warranty of\n MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU\n Library General Public License for more details.\n\n You should have received a copy of the GNU Library General Public License\n along with this library; see the file COPYING.LIB. If not, write to\n the Free Software Foundation, Inc., 51 Franklin Street, Fifth Floor,\n Boston, MA 02110-1301, USA.\n\n In addition, as a special exception, the copyright holders give\n permission to link the code of this program with any edition of\n the Qt library by Trolltech AS, Norway (or with modified versions\n of Qt that use the same license as Qt), and distribute linked\n combinations including the two. You must obey the GNU General\n Public License in all respects for all of the code used other than\n Qt. If you modify this file, you may extend this exception to\n your version of the file, but you are not obligated to do so. If\n you do not wish to do so, delete this exception statement from\n your version.\n*\/\n\n#include \"kolabbase.h\"\n\n#include \n#include \n#include \n#include \n#include \n#include \n#include \n\nusing namespace Kolab;\n\nKolabBase::KolabBase( const QString& tz )\n : mCreationDate( QDateTime::currentDateTime() ),\n mLastModified( KDateTime::currentUtcDateTime() ),\n mSensitivity( Public ),\n mTimeZone( KSystemTimeZones::zone( tz ) ),\n mHasPilotSyncId( false ), mHasPilotSyncStatus( false )\n{\n}\n\nKolabBase::~KolabBase()\n{\n}\n\nvoid KolabBase::setFields( const KCal::Incidence* incidence )\n{\n \/\/ So far unhandled KCal::IncidenceBase fields:\n \/\/ mPilotID, mSyncStatus, mFloats\n\n setUid( incidence->uid() );\n setBody( incidence->description() );\n setCategories( incidence->categoriesStr() );\n setCreationDate( localToUTC( incidence->created() ) );\n setLastModified( incidence->lastModified() );\n setSensitivity( static_cast( incidence->secrecy() ) );\n \/\/ TODO: Attachments\n}\n\nvoid KolabBase::saveTo( KCal::Incidence* incidence ) const\n{\n incidence->setUid( uid() );\n incidence->setDescription( body() );\n incidence->setCategories( categories() );\n incidence->setCreated( utcToLocal( creationDate() ) );\n incidence->setLastModified( lastModified() );\n switch( sensitivity() ) {\n case 1:\n incidence->setSecrecy( KCal::Incidence::SecrecyPrivate );\n break;\n case 2:\n incidence->setSecrecy( KCal::Incidence::SecrecyConfidential );\n break;\n default:\n incidence->setSecrecy( KCal::Incidence::SecrecyPublic );\n break;\n }\n\n \/\/ TODO: Attachments\n}\n\nvoid KolabBase::setFields( const KABC::Addressee* addressee )\n{\n \/\/ An addressee does not have a creation date, so somehow we should\n \/\/ make one, if this is a new entry\n\n setUid( addressee->uid() );\n setBody( addressee->note() );\n setCategories( addressee->categories().join( \",\" ) );\n\n \/\/ Set creation-time and last-modification-time\n const QString creationString = addressee->custom( \"KOLAB\", \"CreationDate\" );\n kDebug(5006) <<\"Creation time string:\" << creationString;\n KDateTime creationDate;\n if ( creationString.isEmpty() ) {\n creationDate = KDateTime::currentDateTime(KDateTime::Spec( mTimeZone ) );\n kDebug(5006) <<\"Creation date set to current time\";\n }\n else {\n creationDate = stringToDateTime( creationString );\n kDebug(5006) <<\"Creation date loaded\";\n }\n KDateTime modified = KDateTime( addressee->revision(), mTimeZone );\n if ( !modified.isValid() )\n modified = KDateTime::currentUtcDateTime();\n setLastModified( modified );\n if ( modified < creationDate ) {\n \/\/ It's not possible that the modification date is earlier than creation\n creationDate = modified;\n kDebug(5006) <<\"Creation date set to modification date\";\n }\n setCreationDate( creationDate );\n const QString newCreationDate = dateTimeToString( creationDate );\n if ( creationString != newCreationDate ) {\n \/\/ We modified the creation date, so store it for future reference\n const_cast( addressee )\n ->insertCustom( \"KOLAB\", \"CreationDate\", newCreationDate );\n kDebug(5006) <<\"Creation date modified. New one:\" << newCreationDate;\n }\n\n switch( addressee->secrecy().type() ) {\n case KABC::Secrecy::Private:\n setSensitivity( Private );\n break;\n case KABC::Secrecy::Confidential:\n setSensitivity( Confidential );\n break;\n default:\n setSensitivity( Public );\n }\n\n \/\/ TODO: Attachments\n}\n\nvoid KolabBase::saveTo( KABC::Addressee* addressee ) const\n{\n addressee->setUid( uid() );\n addressee->setNote( body() );\n addressee->setCategories( categories().split( ',', QString::SkipEmptyParts ) );\n addressee->setRevision( lastModified().toZone( mTimeZone ).dateTime() );\n addressee->insertCustom( \"KOLAB\", \"CreationDate\",\n dateTimeToString( creationDate() ) );\n\n switch( sensitivity() ) {\n case Private:\n addressee->setSecrecy( KABC::Secrecy( KABC::Secrecy::Private ) );\n break;\n case Confidential:\n addressee->setSecrecy( KABC::Secrecy( KABC::Secrecy::Confidential ) );\n break;\n default:\n addressee->setSecrecy( KABC::Secrecy( KABC::Secrecy::Public ) );\n break;\n }\n \/\/ TODO: Attachments\n}\n\nvoid KolabBase::setUid( const QString& uid )\n{\n mUid = uid;\n}\n\nQString KolabBase::uid() const\n{\n return mUid;\n}\n\nvoid KolabBase::setBody( const QString& body )\n{\n mBody = body;\n}\n\nQString KolabBase::body() const\n{\n return mBody;\n}\n\nvoid KolabBase::setCategories( const QString& categories )\n{\n mCategories = categories;\n}\n\nQString KolabBase::categories() const\n{\n return mCategories;\n}\n\nvoid KolabBase::setCreationDate( const KDateTime& date )\n{\n mCreationDate = date;\n}\n\nKDateTime KolabBase::creationDate() const\n{\n return mCreationDate;\n}\n\nvoid KolabBase::setLastModified( const KDateTime& date )\n{\n mLastModified = date;\n}\n\nKDateTime KolabBase::lastModified() const\n{\n return mLastModified;\n}\n\nvoid KolabBase::setSensitivity( Sensitivity sensitivity )\n{\n mSensitivity = sensitivity;\n}\n\nKolabBase::Sensitivity KolabBase::sensitivity() const\n{\n return mSensitivity;\n}\n\nvoid KolabBase::setPilotSyncId( unsigned long id )\n{\n mHasPilotSyncId = true;\n mPilotSyncId = id;\n}\n\nbool KolabBase::hasPilotSyncId() const\n{\n return mHasPilotSyncId;\n}\n\nunsigned long KolabBase::pilotSyncId() const\n{\n return mPilotSyncId;\n}\n\nvoid KolabBase::setPilotSyncStatus( int status )\n{\n mHasPilotSyncStatus = true;\n mPilotSyncStatus = status;\n}\n\nbool KolabBase::hasPilotSyncStatus() const\n{\n return mHasPilotSyncStatus;\n}\n\nint KolabBase::pilotSyncStatus() const\n{\n return mPilotSyncStatus;\n}\n\nbool KolabBase::loadEmailAttribute( QDomElement& element, Email& email )\n{\n for ( QDomNode n = element.firstChild(); !n.isNull(); n = n.nextSibling() ) {\n if ( n.isComment() )\n continue;\n if ( n.isElement() ) {\n QDomElement e = n.toElement();\n const QString tagName = e.tagName();\n\n if ( tagName == \"display-name\" )\n email.displayName = e.text();\n else if ( tagName == \"smtp-address\" )\n email.smtpAddress = e.text();\n else\n \/\/ TODO: Unhandled tag - save for later storage\n kDebug() <<\"Warning: Unhandled tag\" << e.tagName();\n } else\n kDebug() <<\"Node is not a comment or an element???\";\n }\n\n return true;\n}\n\nvoid KolabBase::saveEmailAttribute( QDomElement& element, const Email& email,\n const QString& tagName ) const\n{\n QDomElement e = element.ownerDocument().createElement( tagName );\n element.appendChild( e );\n writeString( e, \"display-name\", email.displayName );\n writeString( e, \"smtp-address\", email.smtpAddress );\n}\n\nbool KolabBase::loadAttribute( QDomElement& element )\n{\n const QString tagName = element.tagName();\n switch ( tagName[0].toLatin1() ) {\n case 'u':\n if ( tagName == \"uid\" ) {\n setUid( element.text() );\n return true;\n }\n break;\n case 'b':\n if ( tagName == \"body\" ) {\n setBody( element.text() );\n return true;\n }\n break;\n case 'c':\n if ( tagName == \"categories\" ) {\n setCategories( element.text() );\n return true;\n }\n if ( tagName == \"creation-date\" ) {\n setCreationDate( stringToDateTime( element.text() ) );\n return true;\n }\n break;\n case 'l':\n if ( tagName == \"last-modification-date\" ) {\n setLastModified( stringToDateTime( element.text() ) );\n return true;\n }\n break;\n case 's':\n if ( tagName == \"sensitivity\" ) {\n setSensitivity( stringToSensitivity( element.text() ) );\n return true;\n }\n break;\n case 'p':\n if ( tagName == \"product-id\" )\n return true; \/\/ ignore this field\n if ( tagName == \"pilot-sync-id\" ) {\n setPilotSyncId( element.text().toULong() );\n return true;\n }\n if ( tagName == \"pilot-sync-status\" ) {\n setPilotSyncStatus( element.text().toInt() );\n return true;\n }\n break;\n default:\n break;\n }\n return false;\n}\n\nbool KolabBase::saveAttributes( QDomElement& element ) const\n{\n writeString( element, \"product-id\", productID() );\n writeString( element, \"uid\", uid() );\n writeString( element, \"body\", body() );\n writeString( element, \"categories\", categories() );\n writeString( element, \"creation-date\", dateTimeToString( creationDate() ) );\n writeString( element, \"last-modification-date\",\n dateTimeToString( lastModified().toZone( mTimeZone ) ) );\n writeString( element, \"sensitivity\", sensitivityToString( sensitivity() ) );\n if ( hasPilotSyncId() )\n writeString( element, \"pilot-sync-id\", QString::number( pilotSyncId() ) );\n if ( hasPilotSyncStatus() )\n writeString( element, \"pilot-sync-status\", QString::number( pilotSyncStatus() ) );\n return true;\n}\n\nbool KolabBase::load( const QString& xml )\n{\n QString errorMsg;\n int errorLine, errorColumn;\n QDomDocument document;\n bool ok = document.setContent( xml, &errorMsg, &errorLine, &errorColumn );\n\n if ( !ok ) {\n qWarning( \"Error loading document: %s, line %d, column %d\",\n qPrintable( errorMsg ), errorLine, errorColumn );\n return false;\n }\n\n \/\/ XML file loaded into tree. Now parse it\n return loadXML( document );\n}\n\nbool KolabBase::load( QFile& xml )\n{\n QString errorMsg;\n int errorLine, errorColumn;\n QDomDocument document;\n bool ok = document.setContent( &xml, &errorMsg, &errorLine, &errorColumn );\n\n if ( !ok ) {\n qWarning( \"Error loading document: %s, line %d, column %d\",\n qPrintable( errorMsg ), errorLine, errorColumn );\n return false;\n }\n\n \/\/ XML file loaded into tree. Now parse it\n return loadXML( document );\n}\n\nQDomDocument KolabBase::domTree()\n{\n QDomDocument document;\n\n QString p = \"version=\\\"1.0\\\" encoding=\\\"UTF-8\\\"\";\n document.appendChild(document.createProcessingInstruction( \"xml\", p ) );\n\n return document;\n}\n\n\nQString KolabBase::dateTimeToString( const KDateTime& time )\n{\n return time.toString( KDateTime::ISODate );\n}\n\nQString KolabBase::dateToString( const QDate& date )\n{\n return date.toString( Qt::ISODate );\n}\n\nKDateTime KolabBase::stringToDateTime( const QString& _date )\n{\n QString date( _date );\n \/\/Deal with data from some clients that always append a Z to dates.\n \/\/In Qt4, Qt::ISODate must see a trailing Z for UTC, so keep such.\n if ( date.endsWith( \"ZZ\" ) )\n date.chop( 1 );\n return KDateTime::fromString( date, KDateTime::ISODate );\n}\n\nQDate KolabBase::stringToDate( const QString& date )\n{\n return QDate::fromString( date, Qt::ISODate );\n}\n\nQString KolabBase::sensitivityToString( Sensitivity s )\n{\n switch( s ) {\n case Private: return \"private\";\n case Confidential: return \"confidential\";\n case Public: return \"public\";\n }\n\n return \"What what what???\";\n}\n\nKolabBase::Sensitivity KolabBase::stringToSensitivity( const QString& s )\n{\n if ( s == \"private\" )\n return Private;\n if ( s == \"confidential\" )\n return Confidential;\n return Public;\n}\n\nQString KolabBase::colorToString( const QColor& color )\n{\n \/\/ Color is in the format \"#RRGGBB\"\n return color.name();\n}\n\nQColor KolabBase::stringToColor( const QString& s )\n{\n return QColor( s );\n}\n\nvoid KolabBase::writeString( QDomElement& element, const QString& tag,\n const QString& tagString )\n{\n if ( !tagString.isEmpty() ) {\n QDomElement e = element.ownerDocument().createElement( tag );\n QDomText t = element.ownerDocument().createTextNode( tagString );\n e.appendChild( t );\n element.appendChild( e );\n }\n}\n\nKDateTime KolabBase::localToUTC( const KDateTime& time ) const\n{\n return time.toUtc();\n}\n\nKDateTime KolabBase::utcToLocal( const KDateTime& time ) const\n{\n KDateTime dt = time;\n dt.setTimeSpec( KDateTime::UTC );\n return dt;\n}\n<|endoftext|>"} {"text":"\/* -*-c++-*-\n * Copyright (C) 2008 Cedric Pinson \n * Copyright (C) 2017 Julien Valentin \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 \n#include \n#include \n#include \n#include \n#include \n#include \n\nusing namespace osgAnimation;\n\nstruct invweight_ordered\n{\n inline bool operator() (const BoneWeight& bw1, const BoneWeight& bw2) const\n {\n if (bw1.second > bw2.second)return true;\n if (bw1.second < bw2.second)return false;\n return(bw1.first < bw2.first);\n }\n};\n\nvoid VertexInfluenceMap::normalize(unsigned int numvert)\n{\n\n typedef std::pair > PerVertWeights;\n std::vector localstore;\n localstore.resize(numvert);\n for(VertexInfluenceMap::iterator mapit = this->begin(); mapit != this->end(); ++mapit)\n {\n IndexWeightList &curvecinf = mapit->second;\n for(IndexWeightList::iterator curinf = curvecinf.begin(); curinf != curvecinf.end(); ++curinf)\n {\n VertexIndexWeight& inf = *curinf;\n localstore[inf.first].first += inf.second;\n localstore[inf.first].second.push_back(&inf.second);\n\n }\n }\n \n unsigned int vertid = 0;\n for(std::vector::iterator itvert = localstore.begin();\n itvert != localstore.end();\n ++itvert, ++vertid)\n {\n PerVertWeights & weights = *itvert;\n if(weights.first< 1e-4)\n {\n OSG_WARN << \"VertexInfluenceMap::normalize warning the vertex \" <::iterator itf = weights.second.begin(); itf != weights.second.end(); ++itf)\n {\n **itf *= mult;\n }\n }\n }\n\n}\n\/\/\/remove weakest influences in order to fit targetted numbonepervertex\nvoid VertexInfluenceMap::cullInfluenceCountPerVertex(unsigned int numbonepervertex,float minweight, bool renormalize)\n{\n\n typedef std::set BoneWeightOrdered;\n std::map tempVec2Bones;\n for(VertexInfluenceMap::iterator mapit = this->begin(); mapit != this->end(); ++mapit)\n {\n const std::string& bonename = mapit->first;\n IndexWeightList &curvecinf = mapit->second;\n for(IndexWeightList::iterator curinf = curvecinf.begin(); curinf != curvecinf.end(); ++curinf)\n {\n VertexIndexWeight& inf = *curinf;\n if( bonename.empty())\n {\n OSG_WARN << \"VertexInfluenceSet::cullInfluenceCountPerVertex warning vertex \" << inf.first << \" is not assigned to a bone\" << std::endl;\n }\n else if(inf.second>minweight)\n {\n tempVec2Bones[inf.first].insert(BoneWeight(bonename, inf.second));\n }\n }\n }\n this->clear();\n for( std::map::iterator mapit = tempVec2Bones.begin(); mapit != tempVec2Bones.end(); ++mapit)\n {\n BoneWeightOrdered& bwset = mapit->second;\n unsigned int newsize = numbonepervertexnewsize)bwset.erase(*bwset.rbegin());\n if(renormalize)\n {\n for(BoneWeightOrdered::iterator bwit = bwset.begin(); bwit != bwset.end(); ++bwit)\n {\n sum += bwit->second;\n }\n \n if(sum > 1e-4)\n {\n sum = 1.0f\/sum;\n for(BoneWeightOrdered::iterator bwit = bwset.begin(); bwit != bwset.end(); ++bwit)\n {\n VertexInfluence & inf = (*this)[bwit->first];\n inf.push_back(VertexIndexWeight(mapit->first, bwit->second*sum));\n inf.setName(bwit->first);\n }\n }\n }\n else\n {\n for(BoneWeightOrdered::iterator bwit = bwset.begin(); bwit != bwset.end(); ++bwit)\n {\n VertexInfluence & inf = (*this)[bwit->first];\n inf.push_back(VertexIndexWeight(mapit->first,bwit->second));\n inf.setName(bwit->first);\n }\n }\n }\n}\n\nvoid VertexInfluenceMap::computePerVertexInfluenceList(std::vector& vertex2Bones,unsigned int numvert)const\n{\n vertex2Bones.resize(numvert);\n for (osgAnimation::VertexInfluenceMap::const_iterator it = begin(); it != end(); ++it)\n {\n const IndexWeightList& inflist = it->second;\n if (it->first.empty())\n {\n OSG_WARN << \"VertexInfluenceMap::computePerVertexInfluenceList contains unamed bone IndexWeightList\" << std::endl;\n }\n \n for(IndexWeightList::const_iterator infit = inflist.begin(); infit != inflist.end(); ++infit)\n {\n const VertexIndexWeight &iw = *infit;\n const unsigned int &index = iw.first;\n const float &weight = iw.second;\n vertex2Bones[index].push_back(BoneWeight(it->first, weight));;\n }\n }\n}\n\n\/\/ sort by name and weight\nstruct SortByNameAndWeight : public std::less\n{\n bool operator()(const BoneWeight& b0, const BoneWeight& b1) const\n {\n if (b0.first < b1.first)\n return true;\n else if (b0.first > b1.first)\n return false;\n \n return (b0.second < b1.second);\n }\n};\n\nstruct SortByBoneWeightList : public std::less\n{\n bool operator()(const BoneWeightList& b0,\n const BoneWeightList& b1) const\n {\n if (b0.size() < b1.size())\n return true;\n else if (b0.size() > b1.size())\n return false;\n\n int size = b0.size();\n for (int i = 0; i < size; i++)\n {\n if (SortByNameAndWeight()(b0[i], b1[i]))\n return true;\n else if (SortByNameAndWeight()(b1[i], b0[i]))\n return false;\n }\n return false;\n }\n};\nvoid VertexInfluenceMap::computeMinimalVertexGroupList(std::vector& uniqVertexGroupList, unsigned int numvert) const\n{\n uniqVertexGroupList.clear();\n std::vector vertex2Bones;\n computePerVertexInfluenceList(vertex2Bones,numvert);\n typedef std::map UnifyBoneGroup;\n UnifyBoneGroup unifyBuffer;\n\n unsigned int vertexID = 0;\n for (std::vector::iterator it = vertex2Bones.begin(); it != vertex2Bones.end(); ++it,++vertexID)\n {\n BoneWeightList &boneweightlist = *it;\n \/\/ sort the vector to have a consistent key\n std::sort(boneweightlist.begin(), boneweightlist.end(), SortByNameAndWeight());\n \n \/\/ we use the vector as key to differentiate group\n UnifyBoneGroup::iterator result = unifyBuffer.find(boneweightlist);\n if (result == unifyBuffer.end())\n {\n unifyBuffer[boneweightlist].setBoneWeights(boneweightlist);\n }\n \n unifyBuffer[boneweightlist].vertIDs().push_back(vertexID);\n }\n \n if(vertex2Bones.size() == unifyBuffer.size())\n {\n OSG_WARN << \"VertexInfluenceMap::computeMinimalVertexGroupList is useless no duplicate VertexGroup\" << std::endl;\n }\n \n uniqVertexGroupList.reserve(unifyBuffer.size());\n for (UnifyBoneGroup::iterator it = unifyBuffer.begin(); it != unifyBuffer.end(); ++it)\n {\n uniqVertexGroupList.push_back(it->second);\n }\n}\n\n\/\/Experimental Bone removal stuff\ntypedef std::vector RigList;\nclass CollectRigVisitor : public osg::NodeVisitor\n{\npublic:\n META_NodeVisitor(osgAnimation, CollectRigVisitor)\n CollectRigVisitor();\n\n void apply(osg::Geometry& node);\n inline const RigList& getRigList() const{return _map;}\n\nprotected:\n RigList _map;\n};\n\nCollectRigVisitor::CollectRigVisitor() : osg::NodeVisitor(osg::NodeVisitor::TRAVERSE_ALL_CHILDREN) {}\n\nvoid CollectRigVisitor::apply(osg::Geometry& node)\n{\n RigGeometry* rig = dynamic_cast(&node);\n if ( rig )\n _map.push_back(rig);\n}\n\nbool recursiveisUsefull( Bone* bone, std::set foundnames)\n{\n for(unsigned int i=0; igetNumChildren(); ++i)\n {\n Bone* child = dynamic_cast< Bone* >(bone->getChild(i));\n if(child)\n {\n if( foundnames.find(child->getName()) != foundnames.end() )\n return true;\n if( recursiveisUsefull(child,foundnames) ) \n return true;\n }\n }\n return false;\n}\n\nvoid VertexInfluenceMap::removeUnexpressedBones(Skeleton &skel) const\n{\n BoneMapVisitor mapVisitor;\n skel.accept(mapVisitor);\n\n CollectRigVisitor rigvis;\n skel.accept(rigvis);\n\n RigList rigs = rigvis.getRigList();\n BoneMap boneMap = mapVisitor.getBoneMap();\n\n unsigned int removed=0;\n Bone* child, *par;\n\n std::set usebones;\n for(RigList::iterator rigit = rigs.begin(); rigit != rigs.end(); ++rigit)\n {\n for(VertexInfluenceMap::iterator mapit = (*rigit)->getInfluenceMap()->begin();\n mapit != (*rigit)->getInfluenceMap()->end();\n ++mapit)\n {\n usebones.insert((*mapit).first);\n }\n }\n \n for(BoneMap::iterator bmit = boneMap.begin(); bmit != boneMap.end();)\n {\n if(usebones.find(bmit->second->getName()) == usebones.end())\n {\n if( !(par = bmit->second->getBoneParent()) )\n {\n ++bmit;\n continue;\n }\n\n Bone * bone2rm = bmit->second.get();\n\n if( recursiveisUsefull(bone2rm,usebones))\n {\n ++bmit;\n continue;\n }\n\n \/\/\/Bone can be removed\n ++ removed;\n OSG_INFO<<\"removing useless bone: \"<< bone2rm->getName() <getNumChildren(); numchild++)\n {\n if( (child = dynamic_cast(bone2rm->getChild(numchild))) )\n {\n if(par!=child &&child!=bone2rm) {\n par->addChild(child);\n nodes.push_back(child);\n }\n }\n }\n for(unsigned int i=0; iremoveChild(nodes[i]);\n }\n par->removeChild(bone2rm);\n\n \/\/\/rebuild bonemap after bone removal\n BoneMapVisitor mapVis ; \n skel.accept(mapVis);\n boneMap = mapVis.getBoneMap();\n bmit = boneMap.begin(); \n \n }\n else \n {\n ++bmit;\n }\n }\n OSG_WARN<<\"Number of bone removed \"<Code readability improvements\/* -*-c++-*-\n * Copyright (C) 2008 Cedric Pinson \n * Copyright (C) 2017 Julien Valentin \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 \n#include \n#include \n#include \n#include \n#include \n#include \n\nusing namespace osgAnimation;\n\nstruct invweight_ordered\n{\n inline bool operator() (const BoneWeight& bw1, const BoneWeight& bw2) const\n {\n if (bw1.second > bw2.second)return true;\n if (bw1.second < bw2.second)return false;\n return(bw1.first < bw2.first);\n }\n};\n\nvoid VertexInfluenceMap::normalize(unsigned int numvert)\n{\n\n typedef std::pair > PerVertWeights;\n std::vector localstore;\n localstore.resize(numvert);\n for(VertexInfluenceMap::iterator mapit = this->begin(); mapit != this->end(); ++mapit)\n {\n IndexWeightList &curvecinf = mapit->second;\n for(IndexWeightList::iterator curinf = curvecinf.begin(); curinf != curvecinf.end(); ++curinf)\n {\n VertexIndexWeight& inf = *curinf;\n localstore[inf.first].first += inf.second;\n localstore[inf.first].second.push_back(&inf.second);\n }\n }\n \n unsigned int vertid = 0;\n for(std::vector::iterator itvert = localstore.begin();\n itvert != localstore.end();\n ++itvert, ++vertid)\n {\n PerVertWeights & weights = *itvert;\n if(weights.first< 1e-4)\n {\n OSG_WARN << \"VertexInfluenceMap::normalize warning the vertex \" <::iterator itf = weights.second.begin(); itf != weights.second.end(); ++itf)\n {\n **itf *= mult;\n }\n }\n }\n\n}\n\/\/\/remove weakest influences in order to fit targetted numbonepervertex\nvoid VertexInfluenceMap::cullInfluenceCountPerVertex(unsigned int numbonepervertex,float minweight, bool renormalize)\n{\n\n typedef std::set BoneWeightOrdered;\n std::map tempVec2Bones;\n for(VertexInfluenceMap::iterator mapit = this->begin(); mapit != this->end(); ++mapit)\n {\n const std::string& bonename = mapit->first;\n IndexWeightList &curvecinf = mapit->second;\n for(IndexWeightList::iterator curinf = curvecinf.begin(); curinf != curvecinf.end(); ++curinf)\n {\n VertexIndexWeight& inf = *curinf;\n if( bonename.empty())\n {\n OSG_WARN << \"VertexInfluenceSet::cullInfluenceCountPerVertex warning vertex \" << inf.first << \" is not assigned to a bone\" << std::endl;\n }\n else if(inf.second>minweight)\n {\n tempVec2Bones[inf.first].insert(BoneWeight(bonename, inf.second));\n }\n }\n }\n this->clear();\n for( std::map::iterator mapit = tempVec2Bones.begin(); mapit != tempVec2Bones.end(); ++mapit)\n {\n BoneWeightOrdered& bwset = mapit->second;\n unsigned int newsize = numbonepervertexnewsize)bwset.erase(*bwset.rbegin());\n if(renormalize)\n {\n for(BoneWeightOrdered::iterator bwit = bwset.begin(); bwit != bwset.end(); ++bwit)\n {\n sum += bwit->second;\n }\n \n if(sum > 1e-4)\n {\n sum = 1.0f\/sum;\n for(BoneWeightOrdered::iterator bwit = bwset.begin(); bwit != bwset.end(); ++bwit)\n {\n VertexInfluence & inf = (*this)[bwit->first];\n inf.push_back(VertexIndexWeight(mapit->first, bwit->second*sum));\n inf.setName(bwit->first);\n }\n }\n }\n else\n {\n for(BoneWeightOrdered::iterator bwit = bwset.begin(); bwit != bwset.end(); ++bwit)\n {\n VertexInfluence & inf = (*this)[bwit->first];\n inf.push_back(VertexIndexWeight(mapit->first,bwit->second));\n inf.setName(bwit->first);\n }\n }\n }\n}\n\nvoid VertexInfluenceMap::computePerVertexInfluenceList(std::vector& vertex2Bones,unsigned int numvert)const\n{\n vertex2Bones.resize(numvert);\n for (osgAnimation::VertexInfluenceMap::const_iterator it = begin(); it != end(); ++it)\n {\n const IndexWeightList& inflist = it->second;\n if (it->first.empty())\n {\n OSG_WARN << \"VertexInfluenceMap::computePerVertexInfluenceList contains unamed bone IndexWeightList\" << std::endl;\n }\n \n for(IndexWeightList::const_iterator infit = inflist.begin(); infit != inflist.end(); ++infit)\n {\n const VertexIndexWeight &iw = *infit;\n const unsigned int &index = iw.first;\n const float &weight = iw.second;\n vertex2Bones[index].push_back(BoneWeight(it->first, weight));;\n }\n }\n}\n\n\/\/ sort by name and weight\nstruct SortByNameAndWeight : public std::less\n{\n bool operator()(const BoneWeight& b0, const BoneWeight& b1) const\n {\n if (b0.first < b1.first)\n return true;\n else if (b0.first > b1.first)\n return false;\n \n return (b0.second < b1.second);\n }\n};\n\nstruct SortByBoneWeightList : public std::less\n{\n bool operator()(const BoneWeightList& b0,\n const BoneWeightList& b1) const\n {\n if (b0.size() < b1.size())\n return true;\n else if (b0.size() > b1.size())\n return false;\n\n int size = b0.size();\n for (int i = 0; i < size; i++)\n {\n if (SortByNameAndWeight()(b0[i], b1[i]))\n return true;\n else if (SortByNameAndWeight()(b1[i], b0[i]))\n return false;\n }\n return false;\n }\n};\nvoid VertexInfluenceMap::computeMinimalVertexGroupList(std::vector& uniqVertexGroupList, unsigned int numvert) const\n{\n uniqVertexGroupList.clear();\n std::vector vertex2Bones;\n computePerVertexInfluenceList(vertex2Bones,numvert);\n typedef std::map UnifyBoneGroup;\n UnifyBoneGroup unifyBuffer;\n\n unsigned int vertexID = 0;\n for (std::vector::iterator it = vertex2Bones.begin(); it != vertex2Bones.end(); ++it,++vertexID)\n {\n BoneWeightList &boneweightlist = *it;\n \/\/ sort the vector to have a consistent key\n std::sort(boneweightlist.begin(), boneweightlist.end(), SortByNameAndWeight());\n \n \/\/ we use the vector as key to differentiate group\n UnifyBoneGroup::iterator result = unifyBuffer.find(boneweightlist);\n if (result == unifyBuffer.end())\n {\n unifyBuffer[boneweightlist].setBoneWeights(boneweightlist);\n }\n \n unifyBuffer[boneweightlist].vertIDs().push_back(vertexID);\n }\n \n if(vertex2Bones.size() == unifyBuffer.size())\n {\n OSG_WARN << \"VertexInfluenceMap::computeMinimalVertexGroupList is useless no duplicate VertexGroup\" << std::endl;\n }\n \n uniqVertexGroupList.reserve(unifyBuffer.size());\n for (UnifyBoneGroup::iterator it = unifyBuffer.begin(); it != unifyBuffer.end(); ++it)\n {\n uniqVertexGroupList.push_back(it->second);\n }\n}\n\n\/\/Experimental Bone removal stuff\ntypedef std::vector RigList;\nclass CollectRigVisitor : public osg::NodeVisitor\n{\npublic:\n META_NodeVisitor(osgAnimation, CollectRigVisitor)\n CollectRigVisitor();\n\n void apply(osg::Geometry& node);\n inline const RigList& getRigList() const{return _map;}\n\nprotected:\n RigList _map;\n};\n\nCollectRigVisitor::CollectRigVisitor() : osg::NodeVisitor(osg::NodeVisitor::TRAVERSE_ALL_CHILDREN) {}\n\nvoid CollectRigVisitor::apply(osg::Geometry& node)\n{\n RigGeometry* rig = dynamic_cast(&node);\n if ( rig )\n _map.push_back(rig);\n}\n\nbool recursiveisUsefull( Bone* bone, std::set foundnames)\n{\n for(unsigned int i=0; igetNumChildren(); ++i)\n {\n Bone* child = dynamic_cast< Bone* >(bone->getChild(i));\n if(child)\n {\n if( foundnames.find(child->getName()) != foundnames.end() )\n return true;\n if( recursiveisUsefull(child,foundnames) ) \n return true;\n }\n }\n return false;\n}\n\nvoid VertexInfluenceMap::removeUnexpressedBones(Skeleton &skel) const\n{\n BoneMapVisitor mapVisitor;\n skel.accept(mapVisitor);\n\n CollectRigVisitor rigvis;\n skel.accept(rigvis);\n\n RigList rigs = rigvis.getRigList();\n BoneMap boneMap = mapVisitor.getBoneMap();\n\n unsigned int removed=0;\n Bone* child, *par;\n\n std::set usebones;\n for(RigList::iterator rigit = rigs.begin(); rigit != rigs.end(); ++rigit)\n {\n for(VertexInfluenceMap::iterator mapit = (*rigit)->getInfluenceMap()->begin();\n mapit != (*rigit)->getInfluenceMap()->end();\n ++mapit)\n {\n usebones.insert((*mapit).first);\n }\n }\n \n for(BoneMap::iterator bmit = boneMap.begin(); bmit != boneMap.end();)\n {\n if(usebones.find(bmit->second->getName()) == usebones.end())\n {\n if( !(par = bmit->second->getBoneParent()) )\n {\n ++bmit;\n continue;\n }\n\n Bone * bone2rm = bmit->second.get();\n\n if( recursiveisUsefull(bone2rm,usebones))\n {\n ++bmit;\n continue;\n }\n\n \/\/\/Bone can be removed\n ++ removed;\n OSG_INFO<<\"removing useless bone: \"<< bone2rm->getName() <getNumChildren(); numchild++)\n {\n if( (child = dynamic_cast(bone2rm->getChild(numchild))) )\n {\n if(par!=child &&child!=bone2rm)\n {\n par->addChild(child);\n nodes.push_back(child);\n }\n }\n }\n \n for(unsigned int i=0; iremoveChild(nodes[i]);\n }\n par->removeChild(bone2rm);\n\n \/\/\/rebuild bonemap after bone removal\n BoneMapVisitor mapVis ; \n skel.accept(mapVis);\n boneMap = mapVis.getBoneMap();\n bmit = boneMap.begin(); \n \n }\n else \n {\n ++bmit;\n }\n }\n OSG_WARN<<\"Number of bone removed \"<"} {"text":"\/\/===-- SelectionDAGPrinter.cpp - Implement SelectionDAG::viewGraph() -----===\/\/\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 implements the SelectionDAG::viewGraph method.\n\/\/\n\/\/===----------------------------------------------------------------------===\/\/\n\n#include \"ScheduleDAGSDNodes.h\"\n#include \"llvm\/Constants.h\"\n#include \"llvm\/Function.h\"\n#include \"llvm\/Assembly\/Writer.h\"\n#include \"llvm\/CodeGen\/SelectionDAG.h\"\n#include \"llvm\/CodeGen\/MachineConstantPool.h\"\n#include \"llvm\/CodeGen\/MachineFunction.h\"\n#include \"llvm\/CodeGen\/MachineModuleInfo.h\"\n#include \"llvm\/CodeGen\/PseudoSourceValue.h\"\n#include \"llvm\/Analysis\/DebugInfo.h\"\n#include \"llvm\/Target\/TargetRegisterInfo.h\"\n#include \"llvm\/Target\/TargetMachine.h\"\n#include \"llvm\/Support\/Debug.h\"\n#include \"llvm\/Support\/GraphWriter.h\"\n#include \"llvm\/Support\/raw_ostream.h\"\n#include \"llvm\/ADT\/DenseSet.h\"\n#include \"llvm\/ADT\/StringExtras.h\"\n#include \"llvm\/Config\/config.h\"\n#include \nusing namespace llvm;\n\nnamespace llvm {\n template<>\n struct DOTGraphTraits : public DefaultDOTGraphTraits {\n static bool hasEdgeDestLabels() {\n return true;\n }\n\n static unsigned numEdgeDestLabels(const void *Node) {\n return ((const SDNode *) Node)->getNumValues();\n }\n\n static std::string getEdgeDestLabel(const void *Node, unsigned i) {\n return ((const SDNode *) Node)->getValueType(i).getMVTString();\n }\n\n \/\/\/ edgeTargetsEdgeSource - This method returns true if this outgoing edge\n \/\/\/ should actually target another edge source, not a node. If this method is\n \/\/\/ implemented, getEdgeTarget should be implemented.\n template\n static bool edgeTargetsEdgeSource(const void *Node, EdgeIter I) {\n return true;\n }\n\n \/\/\/ getEdgeTarget - If edgeTargetsEdgeSource returns true, this method is\n \/\/\/ called to determine which outgoing edge of Node is the target of this\n \/\/\/ edge.\n template\n static EdgeIter getEdgeTarget(const void *Node, EdgeIter I) {\n SDNode *TargetNode = *I;\n SDNodeIterator NI = SDNodeIterator::begin(TargetNode);\n std::advance(NI, I.getNode()->getOperand(I.getOperand()).getResNo());\n return NI;\n }\n\n static std::string getGraphName(const SelectionDAG *G) {\n return G->getMachineFunction().getFunction()->getName();\n }\n\n static bool renderGraphFromBottomUp() {\n return true;\n }\n \n static bool hasNodeAddressLabel(const SDNode *Node,\n const SelectionDAG *Graph) {\n return true;\n }\n \n \/\/\/ If you want to override the dot attributes printed for a particular\n \/\/\/ edge, override this method.\n template\n static std::string getEdgeAttributes(const void *Node, EdgeIter EI) {\n SDValue Op = EI.getNode()->getOperand(EI.getOperand());\n MVT VT = Op.getValueType();\n if (VT == MVT::Flag)\n return \"color=red,style=bold\";\n else if (VT == MVT::Other)\n return \"color=blue,style=dashed\";\n return \"\";\n }\n \n\n static std::string getNodeLabel(const SDNode *Node,\n const SelectionDAG *Graph,\n bool ShortNames);\n static std::string getNodeAttributes(const SDNode *N,\n const SelectionDAG *Graph) {\n#ifndef NDEBUG\n const std::string &Attrs = Graph->getGraphAttrs(N);\n if (!Attrs.empty()) {\n if (Attrs.find(\"shape=\") == std::string::npos)\n return std::string(\"shape=Mrecord,\") + Attrs;\n else\n return Attrs;\n }\n#endif\n return \"shape=Mrecord\";\n }\n\n static void addCustomGraphFeatures(SelectionDAG *G,\n GraphWriter &GW) {\n GW.emitSimpleNode(0, \"plaintext=circle\", \"GraphRoot\");\n if (G->getRoot().getNode())\n GW.emitEdge(0, -1, G->getRoot().getNode(), G->getRoot().getResNo(),\n \"color=blue,style=dashed\");\n }\n };\n}\n\nstd::string DOTGraphTraits::getNodeLabel(const SDNode *Node,\n const SelectionDAG *G,\n bool ShortNames) {\n std::string Op = Node->getOperationName(G);\n\n if (const ConstantSDNode *CSDN = dyn_cast(Node)) {\n Op += \": \" + utostr(CSDN->getZExtValue());\n } else if (const ConstantFPSDNode *CSDN = dyn_cast(Node)) {\n Op += \": \" + ftostr(CSDN->getValueAPF());\n } else if (const GlobalAddressSDNode *GADN =\n dyn_cast(Node)) {\n Op += \": \" + GADN->getGlobal()->getName();\n if (int64_t Offset = GADN->getOffset()) {\n if (Offset > 0)\n Op += \"+\" + itostr(Offset);\n else\n Op += itostr(Offset);\n }\n if (unsigned char TF = GADN->getTargetFlags())\n Op += \" [TF=\" + utostr(TF) + \"]\";\n\n } else if (const FrameIndexSDNode *FIDN = dyn_cast(Node)) {\n Op += \" \" + itostr(FIDN->getIndex());\n } else if (const JumpTableSDNode *JTDN = dyn_cast(Node)) {\n Op += \" \" + itostr(JTDN->getIndex());\n if (unsigned char TF = JTDN->getTargetFlags())\n Op += \" [TF=\" + utostr(TF) + \"]\";\n } else if (const ConstantPoolSDNode *CP = dyn_cast(Node)){\n if (CP->isMachineConstantPoolEntry()) {\n Op += '<';\n {\n raw_string_ostream OSS(Op);\n OSS << *CP->getMachineCPVal();\n }\n Op += '>';\n } else {\n if (ConstantFP *CFP = dyn_cast(CP->getConstVal()))\n Op += \"<\" + ftostr(CFP->getValueAPF()) + \">\";\n else if (ConstantInt *CI = dyn_cast(CP->getConstVal()))\n Op += \"<\" + utostr(CI->getZExtValue()) + \">\";\n else {\n Op += '<';\n {\n raw_string_ostream OSS(Op);\n WriteAsOperand(OSS, CP->getConstVal(), false);\n }\n Op += '>';\n }\n }\n Op += \" A=\" + itostr(CP->getAlignment());\n if (unsigned char TF = CP->getTargetFlags())\n Op += \" TF=\" + utostr(TF);\n } else if (const BasicBlockSDNode *BBDN = dyn_cast(Node)) {\n Op = \"BB: \";\n const Value *LBB = (const Value*)BBDN->getBasicBlock()->getBasicBlock();\n if (LBB)\n Op += LBB->getName();\n \/\/Op += \" \" + (const void*)BBDN->getBasicBlock();\n } else if (const RegisterSDNode *R = dyn_cast(Node)) {\n if (G && R->getReg() != 0 &&\n TargetRegisterInfo::isPhysicalRegister(R->getReg())) {\n Op = Op + \" \" +\n G->getTarget().getRegisterInfo()->getName(R->getReg());\n } else {\n Op += \" #\" + utostr(R->getReg());\n }\n } else if (const DbgStopPointSDNode *D = dyn_cast(Node)) {\n DICompileUnit CU(cast(D->getCompileUnit()));\n std::string FN;\n Op += \": \" + CU.getFilename(FN);\n Op += \":\" + utostr(D->getLine());\n if (D->getColumn() != 0)\n Op += \":\" + utostr(D->getColumn());\n } else if (const LabelSDNode *L = dyn_cast(Node)) {\n Op += \": LabelID=\" + utostr(L->getLabelID());\n } else if (const CallSDNode *C = dyn_cast(Node)) {\n Op += \": CallingConv=\" + utostr(C->getCallingConv());\n if (C->isVarArg())\n Op += \", isVarArg\";\n if (C->isTailCall())\n Op += \", isTailCall\";\n } else if (const ExternalSymbolSDNode *ES =\n dyn_cast(Node)) {\n Op += \"'\" + std::string(ES->getSymbol()) + \"'\";\n } else if (const SrcValueSDNode *M = dyn_cast(Node)) {\n if (M->getValue())\n Op += \"<\" + M->getValue()->getName() + \">\";\n else\n Op += \"\";\n } else if (const MemOperandSDNode *M = dyn_cast(Node)) {\n const Value *V = M->MO.getValue();\n Op += '<';\n if (!V) {\n Op += \"(unknown)\";\n } else if (const PseudoSourceValue *PSV = dyn_cast(V)) {\n \/\/ PseudoSourceValues don't have names, so use their print method.\n raw_string_ostream OSS(Op);\n PSV->print(OSS);\n } else {\n Op += V->getName();\n }\n Op += '+' + itostr(M->MO.getOffset()) + '>';\n } else if (const ARG_FLAGSSDNode *N = dyn_cast(Node)) {\n Op = Op + \" AF=\" + N->getArgFlags().getArgFlagsString();\n } else if (const VTSDNode *N = dyn_cast(Node)) {\n Op = Op + \" VT=\" + N->getVT().getMVTString();\n } else if (const LoadSDNode *LD = dyn_cast(Node)) {\n bool doExt = true;\n switch (LD->getExtensionType()) {\n default: doExt = false; break;\n case ISD::EXTLOAD:\n Op = Op + \"getMemoryVT().getMVTString() + \">\";\n if (LD->isVolatile())\n Op += \"\";\n Op += LD->getIndexedModeName(LD->getAddressingMode());\n if (LD->getAlignment() > 1)\n Op += \" A=\" + utostr(LD->getAlignment());\n } else if (const StoreSDNode *ST = dyn_cast(Node)) {\n if (ST->isTruncatingStore())\n Op += \"getMemoryVT().getMVTString() + \">\";\n if (ST->isVolatile())\n Op += \"\";\n Op += ST->getIndexedModeName(ST->getAddressingMode());\n if (ST->getAlignment() > 1)\n Op += \" A=\" + utostr(ST->getAlignment());\n }\n\n#if 0\n Op += \" Id=\" + itostr(Node->getNodeId());\n#endif\n \n return Op;\n}\n\n\n\/\/\/ viewGraph - Pop up a ghostview window with the reachable parts of the DAG\n\/\/\/ rendered using 'dot'.\n\/\/\/\nvoid SelectionDAG::viewGraph(const std::string &Title) {\n\/\/ This code is only for debugging!\n#ifndef NDEBUG\n ViewGraph(this, \"dag.\" + getMachineFunction().getFunction()->getName(), false,\n Title);\n#else\n cerr << \"SelectionDAG::viewGraph is only available in debug builds on \"\n << \"systems with Graphviz or gv!\\n\";\n#endif \/\/ NDEBUG\n}\n\n\/\/ This overload is defined out-of-line here instead of just using a\n\/\/ default parameter because this is easiest for gdb to call.\nvoid SelectionDAG::viewGraph() {\n viewGraph(\"\");\n}\n\n\/\/\/ clearGraphAttrs - Clear all previously defined node graph attributes.\n\/\/\/ Intended to be used from a debugging tool (eg. gdb).\nvoid SelectionDAG::clearGraphAttrs() {\n#ifndef NDEBUG\n NodeGraphAttrs.clear();\n#else\n cerr << \"SelectionDAG::clearGraphAttrs is only available in debug builds\"\n << \" on systems with Graphviz or gv!\\n\";\n#endif\n}\n\n\n\/\/\/ setGraphAttrs - Set graph attributes for a node. (eg. \"color=red\".)\n\/\/\/\nvoid SelectionDAG::setGraphAttrs(const SDNode *N, const char *Attrs) {\n#ifndef NDEBUG\n NodeGraphAttrs[N] = Attrs;\n#else\n cerr << \"SelectionDAG::setGraphAttrs is only available in debug builds\"\n << \" on systems with Graphviz or gv!\\n\";\n#endif\n}\n\n\n\/\/\/ getGraphAttrs - Get graph attributes for a node. (eg. \"color=red\".)\n\/\/\/ Used from getNodeAttributes.\nconst std::string SelectionDAG::getGraphAttrs(const SDNode *N) const {\n#ifndef NDEBUG\n std::map::const_iterator I =\n NodeGraphAttrs.find(N);\n \n if (I != NodeGraphAttrs.end())\n return I->second;\n else\n return \"\";\n#else\n cerr << \"SelectionDAG::getGraphAttrs is only available in debug builds\"\n << \" on systems with Graphviz or gv!\\n\";\n return std::string(\"\");\n#endif\n}\n\n\/\/\/ setGraphColor - Convenience for setting node color attribute.\n\/\/\/\nvoid SelectionDAG::setGraphColor(const SDNode *N, const char *Color) {\n#ifndef NDEBUG\n NodeGraphAttrs[N] = std::string(\"color=\") + Color;\n#else\n cerr << \"SelectionDAG::setGraphColor is only available in debug builds\"\n << \" on systems with Graphviz or gv!\\n\";\n#endif\n}\n\n\/\/\/ setSubgraphColorHelper - Implement setSubgraphColor. Return\n\/\/\/ whether we truncated the search.\n\/\/\/\nbool SelectionDAG::setSubgraphColorHelper(SDNode *N, const char *Color, DenseSet &visited,\n int level, bool &printed) {\n bool hit_limit = false;\n\n#ifndef NDEBUG\n if (level >= 20) {\n if (!printed) {\n printed = true;\n DOUT << \"setSubgraphColor hit max level\\n\";\n }\n return true;\n }\n\n unsigned oldSize = visited.size();\n visited.insert(N);\n if (visited.size() != oldSize) {\n setGraphColor(N, Color);\n for(SDNodeIterator i = SDNodeIterator::begin(N), iend = SDNodeIterator::end(N);\n i != iend;\n ++i) {\n hit_limit = setSubgraphColorHelper(*i, Color, visited, level+1, printed) || hit_limit;\n }\n }\n#else\n cerr << \"SelectionDAG::setSubgraphColor is only available in debug builds\"\n << \" on systems with Graphviz or gv!\\n\";\n#endif\n return hit_limit;\n}\n\n\/\/\/ setSubgraphColor - Convenience for setting subgraph color attribute.\n\/\/\/\nvoid SelectionDAG::setSubgraphColor(SDNode *N, const char *Color) {\n#ifndef NDEBUG\n DenseSet visited;\n bool printed = false;\n if (setSubgraphColorHelper(N, Color, visited, 0, printed)) {\n \/\/ Visually mark that we hit the limit\n if (strcmp(Color, \"red\") == 0) {\n setSubgraphColorHelper(N, \"blue\", visited, 0, printed);\n }\n else if (strcmp(Color, \"yellow\") == 0) {\n setSubgraphColorHelper(N, \"green\", visited, 0, printed);\n }\n }\n\n#else\n cerr << \"SelectionDAG::setSubgraphColor is only available in debug builds\"\n << \" on systems with Graphviz or gv!\\n\";\n#endif\n}\n\nstd::string ScheduleDAGSDNodes::getGraphNodeLabel(const SUnit *SU) const {\n std::string s;\n raw_string_ostream O(s);\n O << \"SU(\" << SU->NodeNum << \"): \";\n if (SU->getNode()) {\n SmallVector FlaggedNodes;\n for (SDNode *N = SU->getNode(); N; N = N->getFlaggedNode())\n FlaggedNodes.push_back(N);\n while (!FlaggedNodes.empty()) {\n O << DOTGraphTraits::getNodeLabel(FlaggedNodes.back(),\n DAG, false);\n FlaggedNodes.pop_back();\n if (!FlaggedNodes.empty())\n O << \"\\n \";\n }\n } else {\n O << \"CROSS RC COPY\";\n }\n return O.str();\n}\n\nvoid ScheduleDAGSDNodes::getCustomGraphFeatures(GraphWriter &GW) const {\n if (DAG) {\n \/\/ Draw a special \"GraphRoot\" node to indicate the root of the graph.\n GW.emitSimpleNode(0, \"plaintext=circle\", \"GraphRoot\");\n const SDNode *N = DAG->getRoot().getNode();\n if (N && N->getNodeId() != -1)\n GW.emitEdge(0, -1, &SUnits[N->getNodeId()], -1,\n \"color=blue,style=dashed\");\n }\n}\nimplement DOTGraphTraits::getNodeLabel in terms of SDNode::print_details to eliminate a ton of near-duplicate code.\/\/===-- SelectionDAGPrinter.cpp - Implement SelectionDAG::viewGraph() -----===\/\/\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 implements the SelectionDAG::viewGraph method.\n\/\/\n\/\/===----------------------------------------------------------------------===\/\/\n\n#include \"ScheduleDAGSDNodes.h\"\n#include \"llvm\/Constants.h\"\n#include \"llvm\/Function.h\"\n#include \"llvm\/Assembly\/Writer.h\"\n#include \"llvm\/CodeGen\/SelectionDAG.h\"\n#include \"llvm\/CodeGen\/MachineConstantPool.h\"\n#include \"llvm\/CodeGen\/MachineFunction.h\"\n#include \"llvm\/CodeGen\/MachineModuleInfo.h\"\n#include \"llvm\/CodeGen\/PseudoSourceValue.h\"\n#include \"llvm\/Analysis\/DebugInfo.h\"\n#include \"llvm\/Target\/TargetRegisterInfo.h\"\n#include \"llvm\/Target\/TargetMachine.h\"\n#include \"llvm\/Support\/Debug.h\"\n#include \"llvm\/Support\/GraphWriter.h\"\n#include \"llvm\/Support\/raw_ostream.h\"\n#include \"llvm\/ADT\/DenseSet.h\"\n#include \"llvm\/ADT\/StringExtras.h\"\n#include \"llvm\/Config\/config.h\"\n#include \nusing namespace llvm;\n\nnamespace llvm {\n template<>\n struct DOTGraphTraits : public DefaultDOTGraphTraits {\n static bool hasEdgeDestLabels() {\n return true;\n }\n\n static unsigned numEdgeDestLabels(const void *Node) {\n return ((const SDNode *) Node)->getNumValues();\n }\n\n static std::string getEdgeDestLabel(const void *Node, unsigned i) {\n return ((const SDNode *) Node)->getValueType(i).getMVTString();\n }\n\n \/\/\/ edgeTargetsEdgeSource - This method returns true if this outgoing edge\n \/\/\/ should actually target another edge source, not a node. If this method is\n \/\/\/ implemented, getEdgeTarget should be implemented.\n template\n static bool edgeTargetsEdgeSource(const void *Node, EdgeIter I) {\n return true;\n }\n\n \/\/\/ getEdgeTarget - If edgeTargetsEdgeSource returns true, this method is\n \/\/\/ called to determine which outgoing edge of Node is the target of this\n \/\/\/ edge.\n template\n static EdgeIter getEdgeTarget(const void *Node, EdgeIter I) {\n SDNode *TargetNode = *I;\n SDNodeIterator NI = SDNodeIterator::begin(TargetNode);\n std::advance(NI, I.getNode()->getOperand(I.getOperand()).getResNo());\n return NI;\n }\n\n static std::string getGraphName(const SelectionDAG *G) {\n return G->getMachineFunction().getFunction()->getName();\n }\n\n static bool renderGraphFromBottomUp() {\n return true;\n }\n \n static bool hasNodeAddressLabel(const SDNode *Node,\n const SelectionDAG *Graph) {\n return true;\n }\n \n \/\/\/ If you want to override the dot attributes printed for a particular\n \/\/\/ edge, override this method.\n template\n static std::string getEdgeAttributes(const void *Node, EdgeIter EI) {\n SDValue Op = EI.getNode()->getOperand(EI.getOperand());\n MVT VT = Op.getValueType();\n if (VT == MVT::Flag)\n return \"color=red,style=bold\";\n else if (VT == MVT::Other)\n return \"color=blue,style=dashed\";\n return \"\";\n }\n \n\n static std::string getNodeLabel(const SDNode *Node,\n const SelectionDAG *Graph,\n bool ShortNames);\n static std::string getNodeAttributes(const SDNode *N,\n const SelectionDAG *Graph) {\n#ifndef NDEBUG\n const std::string &Attrs = Graph->getGraphAttrs(N);\n if (!Attrs.empty()) {\n if (Attrs.find(\"shape=\") == std::string::npos)\n return std::string(\"shape=Mrecord,\") + Attrs;\n else\n return Attrs;\n }\n#endif\n return \"shape=Mrecord\";\n }\n\n static void addCustomGraphFeatures(SelectionDAG *G,\n GraphWriter &GW) {\n GW.emitSimpleNode(0, \"plaintext=circle\", \"GraphRoot\");\n if (G->getRoot().getNode())\n GW.emitEdge(0, -1, G->getRoot().getNode(), G->getRoot().getResNo(),\n \"color=blue,style=dashed\");\n }\n };\n}\n\nstd::string DOTGraphTraits::getNodeLabel(const SDNode *Node,\n const SelectionDAG *G,\n bool ShortNames) {\n std::string Result = Node->getOperationName(G);\n {\n raw_string_ostream OS(Result);\n Node->print_details(OS, G);\n }\n return Result;\n}\n\n\n\/\/\/ viewGraph - Pop up a ghostview window with the reachable parts of the DAG\n\/\/\/ rendered using 'dot'.\n\/\/\/\nvoid SelectionDAG::viewGraph(const std::string &Title) {\n\/\/ This code is only for debugging!\n#ifndef NDEBUG\n ViewGraph(this, \"dag.\" + getMachineFunction().getFunction()->getName(), false,\n Title);\n#else\n cerr << \"SelectionDAG::viewGraph is only available in debug builds on \"\n << \"systems with Graphviz or gv!\\n\";\n#endif \/\/ NDEBUG\n}\n\n\/\/ This overload is defined out-of-line here instead of just using a\n\/\/ default parameter because this is easiest for gdb to call.\nvoid SelectionDAG::viewGraph() {\n viewGraph(\"\");\n}\n\n\/\/\/ clearGraphAttrs - Clear all previously defined node graph attributes.\n\/\/\/ Intended to be used from a debugging tool (eg. gdb).\nvoid SelectionDAG::clearGraphAttrs() {\n#ifndef NDEBUG\n NodeGraphAttrs.clear();\n#else\n cerr << \"SelectionDAG::clearGraphAttrs is only available in debug builds\"\n << \" on systems with Graphviz or gv!\\n\";\n#endif\n}\n\n\n\/\/\/ setGraphAttrs - Set graph attributes for a node. (eg. \"color=red\".)\n\/\/\/\nvoid SelectionDAG::setGraphAttrs(const SDNode *N, const char *Attrs) {\n#ifndef NDEBUG\n NodeGraphAttrs[N] = Attrs;\n#else\n cerr << \"SelectionDAG::setGraphAttrs is only available in debug builds\"\n << \" on systems with Graphviz or gv!\\n\";\n#endif\n}\n\n\n\/\/\/ getGraphAttrs - Get graph attributes for a node. (eg. \"color=red\".)\n\/\/\/ Used from getNodeAttributes.\nconst std::string SelectionDAG::getGraphAttrs(const SDNode *N) const {\n#ifndef NDEBUG\n std::map::const_iterator I =\n NodeGraphAttrs.find(N);\n \n if (I != NodeGraphAttrs.end())\n return I->second;\n else\n return \"\";\n#else\n cerr << \"SelectionDAG::getGraphAttrs is only available in debug builds\"\n << \" on systems with Graphviz or gv!\\n\";\n return std::string(\"\");\n#endif\n}\n\n\/\/\/ setGraphColor - Convenience for setting node color attribute.\n\/\/\/\nvoid SelectionDAG::setGraphColor(const SDNode *N, const char *Color) {\n#ifndef NDEBUG\n NodeGraphAttrs[N] = std::string(\"color=\") + Color;\n#else\n cerr << \"SelectionDAG::setGraphColor is only available in debug builds\"\n << \" on systems with Graphviz or gv!\\n\";\n#endif\n}\n\n\/\/\/ setSubgraphColorHelper - Implement setSubgraphColor. Return\n\/\/\/ whether we truncated the search.\n\/\/\/\nbool SelectionDAG::setSubgraphColorHelper(SDNode *N, const char *Color, DenseSet &visited,\n int level, bool &printed) {\n bool hit_limit = false;\n\n#ifndef NDEBUG\n if (level >= 20) {\n if (!printed) {\n printed = true;\n DOUT << \"setSubgraphColor hit max level\\n\";\n }\n return true;\n }\n\n unsigned oldSize = visited.size();\n visited.insert(N);\n if (visited.size() != oldSize) {\n setGraphColor(N, Color);\n for(SDNodeIterator i = SDNodeIterator::begin(N), iend = SDNodeIterator::end(N);\n i != iend;\n ++i) {\n hit_limit = setSubgraphColorHelper(*i, Color, visited, level+1, printed) || hit_limit;\n }\n }\n#else\n cerr << \"SelectionDAG::setSubgraphColor is only available in debug builds\"\n << \" on systems with Graphviz or gv!\\n\";\n#endif\n return hit_limit;\n}\n\n\/\/\/ setSubgraphColor - Convenience for setting subgraph color attribute.\n\/\/\/\nvoid SelectionDAG::setSubgraphColor(SDNode *N, const char *Color) {\n#ifndef NDEBUG\n DenseSet visited;\n bool printed = false;\n if (setSubgraphColorHelper(N, Color, visited, 0, printed)) {\n \/\/ Visually mark that we hit the limit\n if (strcmp(Color, \"red\") == 0) {\n setSubgraphColorHelper(N, \"blue\", visited, 0, printed);\n }\n else if (strcmp(Color, \"yellow\") == 0) {\n setSubgraphColorHelper(N, \"green\", visited, 0, printed);\n }\n }\n\n#else\n cerr << \"SelectionDAG::setSubgraphColor is only available in debug builds\"\n << \" on systems with Graphviz or gv!\\n\";\n#endif\n}\n\nstd::string ScheduleDAGSDNodes::getGraphNodeLabel(const SUnit *SU) const {\n std::string s;\n raw_string_ostream O(s);\n O << \"SU(\" << SU->NodeNum << \"): \";\n if (SU->getNode()) {\n SmallVector FlaggedNodes;\n for (SDNode *N = SU->getNode(); N; N = N->getFlaggedNode())\n FlaggedNodes.push_back(N);\n while (!FlaggedNodes.empty()) {\n O << DOTGraphTraits::getNodeLabel(FlaggedNodes.back(),\n DAG, false);\n FlaggedNodes.pop_back();\n if (!FlaggedNodes.empty())\n O << \"\\n \";\n }\n } else {\n O << \"CROSS RC COPY\";\n }\n return O.str();\n}\n\nvoid ScheduleDAGSDNodes::getCustomGraphFeatures(GraphWriter &GW) const {\n if (DAG) {\n \/\/ Draw a special \"GraphRoot\" node to indicate the root of the graph.\n GW.emitSimpleNode(0, \"plaintext=circle\", \"GraphRoot\");\n const SDNode *N = DAG->getRoot().getNode();\n if (N && N->getNodeId() != -1)\n GW.emitEdge(0, -1, &SUnits[N->getNodeId()], -1,\n \"color=blue,style=dashed\");\n }\n}\n<|endoftext|>"} {"text":"#include \"get_new_points.hxx\"\n\n#include \"eval_weighted.hxx\"\n#include \"poles_prefactor.hxx\"\n#include \"power_prefactor.hxx\"\n\n#include \"..\/sdp_solve.hxx\"\n#include \"..\/ostream_set.hxx\"\n\nstd::vector\ncompute_optimal(const std::vector &matrices,\n const std::vector &objectives,\n const std::vector &normalization,\n const SDP_Solver_Parameters ¶meters)\n{\n size_t num_weights(normalization.size());\n\n const size_t num_blocks(matrices.size());\n std::vector weights(num_weights, 0);\n std::vector> points(num_blocks);\n std::vector> new_points(num_blocks);\n\n \/\/ Need to have a point at zero and infinity\n \/\/ GMP does not have a special infinity value, so we use max double.\n const El::BigFloat infinity(std::numeric_limits::max());\n const El::BigFloat min_x(0), max_x(infinity);\n for(size_t block(0); block < num_blocks; ++block)\n {\n points.at(block).emplace(min_x);\n points.at(block).emplace(1);\n \/\/ for(double x(min_x); x < max_x; x *= 4)\n \/\/ points.at(block).emplace(x);\n\n new_points.at(block).emplace_back(max_x);\n }\n\n bool has_new_points(true);\n\n while(has_new_points)\n {\n has_new_points = false;\n size_t num_constraints(0);\n std::vector matrix_dimensions;\n for(size_t block(0); block != num_blocks; ++block)\n {\n for(auto &point : new_points.at(block))\n {\n points.at(block).emplace(point);\n }\n num_constraints += points.at(block).size();\n matrix_dimensions.insert(matrix_dimensions.end(),\n points.at(block).size(),\n matrices[block].polynomials.size());\n if(El::mpi::Rank() == 0)\n {\n std::cout << \"points: \" << block << \" \" << points.at(block)\n << \"\\n\";\n }\n }\n\n if(El::mpi::Rank() == 0)\n {\n std::cout << \"num_constraints: \" << num_constraints << \"\\n\";\n }\n \/\/ std::cout << \"matrix_dimensions: \" << matrix_dimensions << \"\\n\";\n\n Block_Info block_info(matrix_dimensions, parameters.procs_per_node,\n parameters.proc_granularity, parameters.verbosity);\n El::Grid grid(block_info.mpi_comm.value);\n std::vector prefactors;\n prefactors.reserve(num_constraints);\n std::vector> primal_objective_c;\n primal_objective_c.reserve(num_constraints);\n std::vector> free_var_matrix;\n free_var_matrix.reserve(num_constraints);\n\n \/\/ TODO: This is duplicated from sdp2input\/write_output\/write_output.cxx\n auto max_normalization(normalization.begin());\n for(auto n(normalization.begin()); n != normalization.end(); ++n)\n {\n if(Abs(*n) > Abs(*max_normalization))\n {\n max_normalization = n;\n }\n }\n const int64_t max_index(\n std::distance(normalization.begin(), max_normalization));\n \n for(size_t block(0); block != num_blocks; ++block)\n {\n for(auto &x : points.at(block))\n {\n if(x == infinity)\n {\n prefactors.push_back(1);\n }\n else\n {\n prefactors.push_back(\n power_prefactor(matrices[block].damped_rational.base, x)\n * poles_prefactor(matrices[block].damped_rational.poles,\n x));\n }\n auto &prefactor(prefactors.back());\n const size_t dim(matrices[block].polynomials.size());\n free_var_matrix.emplace_back(\n dim * (dim + 1) \/ 2,\n matrices[block].polynomials.at(0).at(0).size() - 1);\n auto &free_var(free_var_matrix.back());\n\n primal_objective_c.emplace_back();\n auto &primal(primal_objective_c.back());\n\n size_t flattened_matrix_row(0);\n for(size_t matrix_row(0); matrix_row != dim; ++matrix_row)\n for(size_t matrix_column(0); matrix_column <= matrix_row;\n ++matrix_column)\n {\n if(x == infinity)\n {\n int64_t max_degree(0);\n for(auto &poly : matrices[block]\n .polynomials.at(matrix_row)\n .at(matrix_column))\n max_degree = std::max(max_degree, poly.degree());\n if(matrices[block]\n .polynomials.at(matrix_row)\n .at(matrix_column)\n .at(max_index)\n .degree()\n < max_degree)\n {\n primal.push_back(0);\n }\n else\n {\n primal.push_back(matrices[block]\n .polynomials.at(matrix_row)\n .at(matrix_column)\n .at(max_index)\n .coefficients.at(max_degree)\n \/ normalization.at(max_index));\n }\n auto &primal_constant(primal.back());\n for(int64_t column(0); column != free_var.Width();\n ++column)\n {\n const int64_t index(\n column + (column < max_index ? 0 : 1));\n if(matrices[block]\n .polynomials.at(matrix_row)\n .at(matrix_column)\n .at(index)\n .degree()\n < max_degree)\n {\n free_var(flattened_matrix_row, column)\n = primal_constant * normalization.at(index);\n }\n else\n {\n free_var(flattened_matrix_row, column)\n = primal_constant * normalization.at(index)\n - matrices[block]\n .polynomials.at(matrix_row)\n .at(matrix_column)\n .at(index)\n .coefficients.at(max_degree);\n }\n }\n }\n else\n {\n primal.push_back(prefactor\n * matrices[block]\n .polynomials.at(matrix_row)\n .at(matrix_column)\n .at(max_index)(x)\n \/ normalization.at(max_index));\n\n auto &primal_constant(primal.back());\n for(int64_t column(0); column != free_var.Width();\n ++column)\n {\n const int64_t index(\n column + (column < max_index ? 0 : 1));\n free_var(flattened_matrix_row, column)\n = primal_constant * normalization.at(index)\n - prefactor\n * matrices[block]\n .polynomials.at(matrix_row)\n .at(matrix_column)\n .at(index)(x);\n }\n }\n ++flattened_matrix_row;\n }\n }\n }\n\n SDP sdp(objectives, normalization, prefactors, primal_objective_c,\n free_var_matrix, block_info, grid);\n\n SDP_Solver solver(parameters, block_info, grid,\n sdp.dual_objective_b.Height());\n\n for(auto &block : solver.y.blocks)\n {\n if(block.GlobalCol(0) == 0)\n {\n for(int64_t row(0); row != block.LocalHeight(); ++row)\n {\n int64_t global_row(block.GlobalRow(row));\n const int64_t index(global_row\n + (global_row < max_index ? 0 : 1));\n block.SetLocal(row, 0, weights.at(index));\n }\n }\n }\n\n Timers timers(parameters.verbosity >= Verbosity::debug);\n SDP_Solver_Terminate_Reason reason\n = solver.run(parameters, block_info, sdp, grid, timers);\n if(reason != SDP_Solver_Terminate_Reason::PrimalDualOptimal)\n {\n std::stringstream ss;\n ss << \"Can not find solution: \" << reason;\n throw std::runtime_error(ss.str());\n }\n\n \/\/ y is duplicated among cores, so only need to print out copy on\n \/\/ the root node.\n \/\/ THe weight at max_index is determined by the normalization condition\n \/\/ dot(norm,weights)=1\n weights.at(max_index) = 1;\n for(int64_t block_row(0); block_row != solver.y.blocks.at(0).Height();\n ++block_row)\n {\n const int64_t index(block_row + (block_row < max_index ? 0 : 1));\n weights.at(index) = solver.y.blocks.at(0).Get(block_row, 0);\n weights.at(max_index) -= weights.at(index) * normalization.at(index);\n }\n weights.at(max_index) \/= normalization.at(max_index);\n\n if(El::mpi::Rank() == 0)\n {\n std::cout.precision(10);\n std::cout << \"weight: \" << weights << \"\\n\";\n\n El::BigFloat optimal(0);\n for(size_t index(0); index < objectives.size(); ++index)\n {\n optimal += objectives[index] * weights[index];\n }\n std::cout << \"optimal: \" << optimal << \"\\n\";\n }\n for(size_t block(0); block != num_blocks; ++block)\n {\n \/\/ 0.01 should be a small enough relative error so that we are\n \/\/ in the regime of convergence. Then the error estimates will\n \/\/ work\n \/\/ Mesh mesh(*(points.at(block).begin()), *(points.at(block).rbegin()),\n Mesh mesh(*(points.at(block).begin()), El::BigFloat(100),\n [&](const El::BigFloat &x) {\n return eval_weighted(matrices[block], x, weights);\n },\n 0.01);\n new_points.at(block) = get_new_points(mesh);\n for(auto &point : new_points.at(block))\n {\n has_new_points\n = has_new_points || (points.at(block).count(point) == 0);\n }\n }\n }\n \/\/ if(El::mpi::Rank() == 0)\n \/\/ {\n \/\/ std::cout << \"weights: \" << weights << \"\\n\";\n \/\/ }\n return weights;\n}\nSet max_degree correctly, once for the entire matrix#include \"get_new_points.hxx\"\n\n#include \"eval_weighted.hxx\"\n#include \"poles_prefactor.hxx\"\n#include \"power_prefactor.hxx\"\n\n#include \"..\/sdp_solve.hxx\"\n#include \"..\/ostream_set.hxx\"\n\nstd::vector\ncompute_optimal(const std::vector &matrices,\n const std::vector &objectives,\n const std::vector &normalization,\n const SDP_Solver_Parameters ¶meters)\n{\n size_t num_weights(normalization.size());\n\n const size_t num_blocks(matrices.size());\n std::vector weights(num_weights, 0);\n std::vector> points(num_blocks);\n std::vector> new_points(num_blocks);\n\n \/\/ Need to have a point at zero and infinity\n \/\/ GMP does not have a special infinity value, so we use max double.\n const El::BigFloat infinity(std::numeric_limits::max());\n const El::BigFloat min_x(0), max_x(infinity);\n for(size_t block(0); block < num_blocks; ++block)\n {\n points.at(block).emplace(min_x);\n points.at(block).emplace(1);\n \/\/ for(double x(min_x); x < max_x; x *= 4)\n \/\/ points.at(block).emplace(x);\n\n new_points.at(block).emplace_back(max_x);\n }\n\n bool has_new_points(true);\n\n while(has_new_points)\n {\n has_new_points = false;\n size_t num_constraints(0);\n std::vector matrix_dimensions;\n for(size_t block(0); block != num_blocks; ++block)\n {\n for(auto &point : new_points.at(block))\n {\n points.at(block).emplace(point);\n }\n num_constraints += points.at(block).size();\n matrix_dimensions.insert(matrix_dimensions.end(),\n points.at(block).size(),\n matrices[block].polynomials.size());\n if(El::mpi::Rank() == 0)\n {\n std::cout << \"points: \" << block << \" \" << points.at(block)\n << \"\\n\";\n }\n }\n\n if(El::mpi::Rank() == 0)\n {\n std::cout << \"num_constraints: \" << num_constraints << \"\\n\";\n }\n \/\/ std::cout << \"matrix_dimensions: \" << matrix_dimensions << \"\\n\";\n\n Block_Info block_info(matrix_dimensions, parameters.procs_per_node,\n parameters.proc_granularity, parameters.verbosity);\n El::Grid grid(block_info.mpi_comm.value);\n std::vector prefactors;\n prefactors.reserve(num_constraints);\n std::vector> primal_objective_c;\n primal_objective_c.reserve(num_constraints);\n std::vector> free_var_matrix;\n free_var_matrix.reserve(num_constraints);\n\n \/\/ TODO: This is duplicated from sdp2input\/write_output\/write_output.cxx\n auto max_normalization(normalization.begin());\n for(auto n(normalization.begin()); n != normalization.end(); ++n)\n {\n if(Abs(*n) > Abs(*max_normalization))\n {\n max_normalization = n;\n }\n }\n const int64_t max_index(\n std::distance(normalization.begin(), max_normalization));\n \n for(size_t block(0); block != num_blocks; ++block)\n {\n for(auto &x : points.at(block))\n {\n if(x == infinity)\n {\n prefactors.push_back(1);\n }\n else\n {\n prefactors.push_back(\n power_prefactor(matrices[block].damped_rational.base, x)\n * poles_prefactor(matrices[block].damped_rational.poles,\n x));\n }\n auto &prefactor(prefactors.back());\n const size_t dim(matrices[block].polynomials.size());\n free_var_matrix.emplace_back(\n dim * (dim + 1) \/ 2,\n matrices[block].polynomials.at(0).at(0).size() - 1);\n auto &free_var(free_var_matrix.back());\n\n primal_objective_c.emplace_back();\n auto &primal(primal_objective_c.back());\n\n int64_t max_degree(0);\n for(auto &row: matrices[block].polynomials)\n for(auto &column: row)\n for(auto &poly: column)\n {\n max_degree = std::max(max_degree, poly.degree());\n }\n\n size_t flattened_matrix_row(0);\n for(size_t matrix_row(0); matrix_row != dim; ++matrix_row)\n for(size_t matrix_column(0); matrix_column <= matrix_row;\n ++matrix_column)\n {\n if(x == infinity)\n {\n if(matrices[block]\n .polynomials.at(matrix_row)\n .at(matrix_column)\n .at(max_index)\n .degree()\n < max_degree)\n {\n primal.push_back(0);\n }\n else\n {\n primal.push_back(matrices[block]\n .polynomials.at(matrix_row)\n .at(matrix_column)\n .at(max_index)\n .coefficients.at(max_degree)\n \/ normalization.at(max_index));\n }\n auto &primal_constant(primal.back());\n for(int64_t column(0); column != free_var.Width();\n ++column)\n {\n const int64_t index(\n column + (column < max_index ? 0 : 1));\n if(matrices[block]\n .polynomials.at(matrix_row)\n .at(matrix_column)\n .at(index)\n .degree()\n < max_degree)\n {\n free_var(flattened_matrix_row, column)\n = primal_constant * normalization.at(index);\n }\n else\n {\n free_var(flattened_matrix_row, column)\n = primal_constant * normalization.at(index)\n - matrices[block]\n .polynomials.at(matrix_row)\n .at(matrix_column)\n .at(index)\n .coefficients.at(max_degree);\n }\n }\n }\n else\n {\n primal.push_back(prefactor\n * matrices[block]\n .polynomials.at(matrix_row)\n .at(matrix_column)\n .at(max_index)(x)\n \/ normalization.at(max_index));\n\n auto &primal_constant(primal.back());\n for(int64_t column(0); column != free_var.Width();\n ++column)\n {\n const int64_t index(\n column + (column < max_index ? 0 : 1));\n free_var(flattened_matrix_row, column)\n = primal_constant * normalization.at(index)\n - prefactor\n * matrices[block]\n .polynomials.at(matrix_row)\n .at(matrix_column)\n .at(index)(x);\n }\n }\n ++flattened_matrix_row;\n }\n }\n }\n\n SDP sdp(objectives, normalization, prefactors, primal_objective_c,\n free_var_matrix, block_info, grid);\n\n SDP_Solver solver(parameters, block_info, grid,\n sdp.dual_objective_b.Height());\n\n for(auto &block : solver.y.blocks)\n {\n if(block.GlobalCol(0) == 0)\n {\n for(int64_t row(0); row != block.LocalHeight(); ++row)\n {\n int64_t global_row(block.GlobalRow(row));\n const int64_t index(global_row\n + (global_row < max_index ? 0 : 1));\n block.SetLocal(row, 0, weights.at(index));\n }\n }\n }\n\n Timers timers(parameters.verbosity >= Verbosity::debug);\n SDP_Solver_Terminate_Reason reason\n = solver.run(parameters, block_info, sdp, grid, timers);\n if(reason != SDP_Solver_Terminate_Reason::PrimalDualOptimal)\n {\n std::stringstream ss;\n ss << \"Can not find solution: \" << reason;\n throw std::runtime_error(ss.str());\n }\n\n \/\/ y is duplicated among cores, so only need to print out copy on\n \/\/ the root node.\n \/\/ THe weight at max_index is determined by the normalization condition\n \/\/ dot(norm,weights)=1\n weights.at(max_index) = 1;\n for(int64_t block_row(0); block_row != solver.y.blocks.at(0).Height();\n ++block_row)\n {\n const int64_t index(block_row + (block_row < max_index ? 0 : 1));\n weights.at(index) = solver.y.blocks.at(0).Get(block_row, 0);\n weights.at(max_index) -= weights.at(index) * normalization.at(index);\n }\n weights.at(max_index) \/= normalization.at(max_index);\n\n if(El::mpi::Rank() == 0)\n {\n std::cout.precision(10);\n std::cout << \"weight: \" << weights << \"\\n\";\n\n El::BigFloat optimal(0);\n for(size_t index(0); index < objectives.size(); ++index)\n {\n optimal += objectives[index] * weights[index];\n }\n std::cout << \"optimal: \" << optimal << \"\\n\";\n }\n for(size_t block(0); block != num_blocks; ++block)\n {\n \/\/ 0.01 should be a small enough relative error so that we are\n \/\/ in the regime of convergence. Then the error estimates will\n \/\/ work\n \/\/ Mesh mesh(*(points.at(block).begin()), *(points.at(block).rbegin()),\n Mesh mesh(*(points.at(block).begin()), El::BigFloat(100),\n [&](const El::BigFloat &x) {\n return eval_weighted(matrices[block], x, weights);\n },\n 0.01);\n new_points.at(block) = get_new_points(mesh);\n for(auto &point : new_points.at(block))\n {\n has_new_points\n = has_new_points || (points.at(block).count(point) == 0);\n }\n }\n }\n \/\/ if(El::mpi::Rank() == 0)\n \/\/ {\n \/\/ std::cout << \"weights: \" << weights << \"\\n\";\n \/\/ }\n return weights;\n}\n<|endoftext|>"} {"text":"#include \"get_new_points.hxx\"\n\n#include \"eval_weighted.hxx\"\n#include \"poles_prefactor.hxx\"\n#include \"power_prefactor.hxx\"\n\n#include \"..\/sdp_solve.hxx\"\n#include \"..\/ostream_set.hxx\"\n\nstd::vector\ncompute_optimal(const std::vector &matrices,\n const std::vector &objectives,\n const std::vector &normalization,\n const SDP_Solver_Parameters ¶meters)\n{\n size_t num_weights(normalization.size());\n\n const size_t num_blocks(matrices.size());\n std::vector weights(num_weights, 0);\n std::vector> points(num_blocks);\n std::vector> new_points(num_blocks);\n\n \/\/ Need to have a point at zero and infinity\n \/\/ GMP does not have a special infinity value, so we use max double.\n const El::BigFloat infinity(std::numeric_limits::max());\n const El::BigFloat min_x(0), max_x(infinity);\n for(size_t block(0); block < num_blocks; ++block)\n {\n points.at(block).emplace(min_x);\n\n \/\/ points.at(block).emplace(0.1);\n \/\/ points.at(block).emplace(1);\n\n \/\/ const int64_t num_points(64);\n \/\/ const double dx(1.0\/num_points);\n \/\/ for(double x(dx); x < 1; x +=dx)\n \/\/ points.at(block).emplace(-log(1-x));\n\n \/\/ const int64_t num_points(64);\n \/\/ const double dx(64.0\/num_points);\n \/\/ for(double x(dx); x <= 64; x +=dx)\n \/\/ points.at(block).emplace(x);\n\n for(double x(1 \/ 64.0); x < 64; x *= 1.13878863476 * 1.13878863476)\n points.at(block).emplace(x);\n\n new_points.at(block).emplace_back(max_x);\n }\n\n bool has_new_points(true);\n\n bool is_first_iteration(true);\n while(has_new_points)\n {\n has_new_points = false;\n size_t num_constraints(0);\n std::vector matrix_dimensions;\n for(size_t block(0); block != num_blocks; ++block)\n {\n for(auto &point : new_points.at(block))\n {\n points.at(block).emplace(point);\n }\n num_constraints += points.at(block).size();\n matrix_dimensions.insert(matrix_dimensions.end(),\n points.at(block).size(),\n matrices[block].polynomials.size());\n if(El::mpi::Rank() == 0)\n {\n std::cout << \"points: \" << block << \" \" << points.at(block)\n << \"\\n\";\n }\n }\n\n \/\/ if(El::mpi::Rank() == 0)\n \/\/ {\n \/\/ std::cout << \"num_constraints: \" << num_constraints << \"\\n\";\n \/\/ }\n\n std::vector> primal_objective_c;\n primal_objective_c.reserve(num_constraints);\n std::vector> free_var_matrix;\n free_var_matrix.reserve(num_constraints);\n\n \/\/ TODO: This is duplicated from sdp2input\/write_output\/write_output.cxx\n auto max_normalization(normalization.begin());\n for(auto n(normalization.begin()); n != normalization.end(); ++n)\n {\n if(Abs(*n) > Abs(*max_normalization))\n {\n max_normalization = n;\n }\n }\n const size_t max_index(\n std::distance(normalization.begin(), max_normalization));\n\n for(size_t block(0); block != num_blocks; ++block)\n {\n const int64_t max_degree([&]() {\n int64_t result(0);\n for(auto &row : matrices[block].polynomials)\n for(auto &column : row)\n for(auto &poly : column)\n {\n result = std::max(result, poly.degree());\n }\n return result;\n }());\n\n for(auto &x : points.at(block))\n {\n El::BigFloat prefactor([&]() {\n if(x == infinity)\n {\n return El::BigFloat(1);\n }\n return power_prefactor(matrices[block].damped_rational.base, x)\n * poles_prefactor(matrices[block].damped_rational.poles,\n x);\n }());\n const size_t dim(matrices[block].polynomials.size());\n free_var_matrix.emplace_back(\n dim * (dim + 1) \/ 2,\n matrices[block].polynomials.at(0).at(0).size() - 1);\n auto &free_var(free_var_matrix.back());\n\n primal_objective_c.emplace_back();\n auto &primal(primal_objective_c.back());\n\n size_t flattened_matrix_row(0);\n for(size_t matrix_row(0); matrix_row != dim; ++matrix_row)\n for(size_t matrix_column(0); matrix_column <= matrix_row;\n ++matrix_column)\n {\n if(x == infinity)\n {\n if(matrices[block]\n .polynomials.at(matrix_row)\n .at(matrix_column)\n .at(max_index)\n .degree()\n < max_degree)\n {\n primal.push_back(0);\n }\n else\n {\n primal.push_back(matrices[block]\n .polynomials.at(matrix_row)\n .at(matrix_column)\n .at(max_index)\n .coefficients.at(max_degree)\n \/ normalization.at(max_index));\n }\n auto &primal_constant(primal.back());\n for(size_t column(0);\n column != size_t(free_var.Width()); ++column)\n {\n const size_t index(column\n + (column < max_index ? 0 : 1));\n if(matrices[block]\n .polynomials.at(matrix_row)\n .at(matrix_column)\n .at(index)\n .degree()\n < max_degree)\n {\n free_var(flattened_matrix_row, column)\n = primal_constant * normalization.at(index);\n }\n else\n {\n free_var(flattened_matrix_row, column)\n = primal_constant * normalization.at(index)\n - matrices[block]\n .polynomials.at(matrix_row)\n .at(matrix_column)\n .at(index)\n .coefficients.at(max_degree);\n }\n }\n }\n else\n {\n primal.push_back(prefactor\n * matrices[block]\n .polynomials.at(matrix_row)\n .at(matrix_column)\n .at(max_index)(x)\n \/ normalization.at(max_index));\n\n auto &primal_constant(primal.back());\n for(size_t column(0);\n column != size_t(free_var.Width()); ++column)\n {\n const size_t index(column\n + (column < max_index ? 0 : 1));\n free_var(flattened_matrix_row, column)\n = primal_constant * normalization.at(index)\n - prefactor\n * matrices[block]\n .polynomials.at(matrix_row)\n .at(matrix_column)\n .at(index)(x);\n }\n }\n ++flattened_matrix_row;\n }\n \/\/ Rescale rows\n const El::BigFloat scaling([&]() {\n El::BigFloat max_value(0);\n size_t flattened_matrix_row(0);\n for(size_t matrix_row(0); matrix_row != dim; ++matrix_row)\n for(size_t matrix_column(0); matrix_column <= matrix_row;\n ++matrix_column)\n {\n max_value = std::max(\n max_value, El::Abs(primal.at(flattened_matrix_row)));\n for(size_t column(0); column != size_t(free_var.Width());\n ++column)\n {\n max_value = std::max(\n max_value,\n El::Abs(free_var(flattened_matrix_row, column)));\n }\n ++flattened_matrix_row;\n }\n return 1 \/ max_value;\n }());\n {\n size_t flattened_matrix_row(0);\n for(size_t matrix_row(0); matrix_row != dim; ++matrix_row)\n for(size_t matrix_column(0); matrix_column <= matrix_row;\n ++matrix_column)\n {\n primal.at(flattened_matrix_row) *= scaling;\n for(size_t column(0); column != size_t(free_var.Width());\n ++column)\n {\n free_var(flattened_matrix_row, column) *= scaling;\n }\n ++flattened_matrix_row;\n }\n }\n }\n }\n\n El::BigFloat objective_const(objectives.at(max_index)\n \/ normalization.at(max_index));\n std::vector dual_objective_b;\n dual_objective_b.reserve(normalization.size() - 1);\n for(size_t index = 0; index < normalization.size(); ++index)\n {\n if(index != max_index)\n {\n dual_objective_b.push_back(objectives.at(index)\n - normalization.at(index)\n * objective_const);\n }\n }\n\n \/\/ Rescale columns\n std::vector rescaling(num_weights - 1, 0);\n for(auto &matrix : free_var_matrix)\n {\n for(size_t column(0); column < size_t(matrix.Width()); ++column)\n {\n for(size_t row(0); row < size_t(matrix.Height()); ++row)\n {\n rescaling.at(column) = std::max(\n rescaling.at(column), El::Abs(matrix(row, column)));\n }\n }\n }\n\n for(size_t index(0); index != rescaling.size(); ++index)\n {\n rescaling[index] = 1 \/ rescaling[index];\n dual_objective_b[index] *= rescaling[index];\n }\n\n for(auto &matrix : free_var_matrix)\n {\n for(size_t row(0); row != size_t(matrix.Height()); ++row)\n {\n for(size_t column(0); column != size_t(matrix.Width()); ++column)\n {\n matrix(row, column) *= rescaling[column];\n }\n }\n }\n\n if(is_first_iteration)\n {\n std::vector elements_to_keep(1, 0);\n const El::BigFloat tolerance(0.1);\n for(size_t matrix_index(0);\n matrix_index + 1 < free_var_matrix.size();)\n {\n auto &matrix(free_var_matrix[matrix_index]);\n auto &c(primal_objective_c[matrix_index]);\n\n size_t offset_index(matrix_index + 1);\n for(; offset_index != free_var_matrix.size(); ++offset_index)\n {\n if(free_var_matrix[offset_index].Height() != matrix.Height())\n {\n elements_to_keep.push_back(offset_index);\n break;\n }\n bool should_erase(true);\n for(size_t row(0);\n should_erase && row != size_t(matrix.Height()); ++row)\n {\n should_erase\n = should_erase\n && (El::Abs(c[row]\n - primal_objective_c[offset_index][row])\n < tolerance);\n for(size_t column(0);\n should_erase && column != size_t(matrix.Width());\n ++column)\n {\n should_erase\n = should_erase\n && (El::Abs(matrix(row, column)\n - free_var_matrix[offset_index](\n row, column))\n < tolerance);\n }\n }\n if(!should_erase)\n {\n elements_to_keep.push_back(offset_index);\n break;\n }\n }\n matrix_index = offset_index;\n }\n\n std::vector> temp_c;\n temp_c.reserve(elements_to_keep.size());\n std::vector> temp_matrix;\n temp_matrix.reserve(elements_to_keep.size());\n std::vector temp_dimensions;\n temp_dimensions.reserve(elements_to_keep.size());\n\n for(auto element : elements_to_keep)\n {\n temp_c.push_back(primal_objective_c[element]);\n temp_matrix.push_back(free_var_matrix[element]);\n temp_dimensions.push_back(matrix_dimensions[element]);\n }\n\n std::vector> temp_points(num_blocks);\n size_t index(0), temp_num_constraints(0);\n for(size_t block(0); block != num_blocks; ++block)\n {\n for(auto &point : points.at(block))\n {\n if(std::find(elements_to_keep.begin(),\n elements_to_keep.end(), index)\n != elements_to_keep.end())\n temp_points.at(block).emplace(point);\n ++index;\n }\n temp_num_constraints += temp_points.at(block).size();\n if(El::mpi::Rank() == 0)\n {\n std::cout << \"points: \" << block << \" \"\n << temp_points.at(block) << \"\\n\";\n }\n }\n\n std::swap(temp_c, primal_objective_c);\n std::swap(temp_matrix, free_var_matrix);\n std::swap(temp_dimensions, matrix_dimensions);\n std::swap(temp_points, points);\n\n is_first_iteration = false;\n \/\/ std::cout << \"dimensions: \" << temp_dimensions.size() << \" \"\n \/\/ << matrix_dimensions.size() << \" \"\n \/\/ << temp_num_constraints << \"\\n\";\n \/\/ std::cout << matrix_dimensions << \"\\n\";\n \/\/ std::cout << points << \"\\n\";\n }\n std::cout << \"num_constraints: \" << free_var_matrix.size() << \"\\n\";\n\n Block_Info block_info(matrix_dimensions, parameters.procs_per_node,\n parameters.proc_granularity, parameters.verbosity);\n El::Grid grid(block_info.mpi_comm.value);\n\n SDP sdp(objective_const, dual_objective_b, primal_objective_c,\n free_var_matrix, block_info, grid);\n\n SDP_Solver solver(parameters, block_info, grid,\n sdp.dual_objective_b.Height());\n\n for(auto &block : solver.y.blocks)\n {\n if(block.GlobalCol(0) == 0)\n {\n for(size_t row(0); row != size_t(block.LocalHeight()); ++row)\n {\n size_t global_row(block.GlobalRow(row));\n const size_t index(global_row\n + (global_row < max_index ? 0 : 1));\n block.SetLocal(row, 0, weights.at(index));\n }\n }\n }\n\n Timers timers(parameters.verbosity >= Verbosity::debug);\n SDP_Solver_Terminate_Reason reason\n = solver.run(parameters, block_info, sdp, grid, timers);\n\n if(reason != SDP_Solver_Terminate_Reason::PrimalDualOptimal)\n {\n std::stringstream ss;\n ss << \"Can not find solution: \" << reason;\n throw std::runtime_error(ss.str());\n }\n \/\/ y is duplicated among cores, so only need to print out copy on\n \/\/ the root node.\n \/\/ THe weight at max_index is determined by the normalization condition\n \/\/ dot(norm,weights)=1\n weights.at(max_index) = 1;\n for(size_t block_row(0);\n block_row != size_t(solver.y.blocks.at(0).Height()); ++block_row)\n {\n const size_t index(block_row + (block_row < max_index ? 0 : 1));\n weights.at(index)\n = solver.y.blocks.at(0).Get(block_row, 0) * rescaling[block_row];\n weights.at(max_index) -= weights.at(index) * normalization.at(index);\n }\n weights.at(max_index) \/= normalization.at(max_index);\n\n if(El::mpi::Rank() == 0)\n {\n std::cout.precision(20);\n std::cout << \"weight: \" << weights << \"\\n\";\n\n El::BigFloat optimal(0);\n for(size_t index(0); index < objectives.size(); ++index)\n {\n optimal += objectives[index] * weights[index];\n }\n std::cout << \"optimal: \" << optimal << \"\\n\";\n }\n for(size_t block(0); block != num_blocks; ++block)\n {\n \/\/ 0.01 should be a small enough relative error so that we are\n \/\/ in the regime of convergence. Then the error estimates will\n \/\/ work\n \/\/ Mesh mesh(*(points.at(block).begin()), *(points.at(block).rbegin()),\n Mesh mesh(*(points.at(block).begin()), El::BigFloat(100),\n [&](const El::BigFloat &x) {\n return eval_weighted(matrices[block], x, weights);\n },\n 0.01);\n new_points.at(block) = get_new_points(mesh);\n for(auto &point : new_points.at(block))\n {\n has_new_points\n = has_new_points || (points.at(block).count(point) == 0);\n }\n }\n }\n \/\/ if(El::mpi::Rank() == 0)\n \/\/ {\n \/\/ std::cout << \"weights: \" << weights << \"\\n\";\n \/\/ }\n return weights;\n}\nRemove column scaling. Add dynamics duality gap.#include \"get_new_points.hxx\"\n\n#include \"eval_weighted.hxx\"\n#include \"poles_prefactor.hxx\"\n#include \"power_prefactor.hxx\"\n\n#include \"..\/sdp_solve.hxx\"\n#include \"..\/ostream_set.hxx\"\n\nstd::vector\ncompute_optimal(const std::vector &matrices,\n const std::vector &objectives,\n const std::vector &normalization,\n const SDP_Solver_Parameters ¶meters_in)\n{\n SDP_Solver_Parameters parameters(parameters_in);\n\n size_t num_weights(normalization.size());\n\n const size_t num_blocks(matrices.size());\n std::vector weights(num_weights, 0);\n std::vector> points(num_blocks);\n std::vector> new_points(num_blocks);\n\n \/\/ Need to have a point at zero and infinity\n \/\/ GMP does not have a special infinity value, so we use max double.\n const El::BigFloat infinity(std::numeric_limits::max());\n const El::BigFloat min_x(0), max_x(infinity);\n for(size_t block(0); block < num_blocks; ++block)\n {\n points.at(block).emplace(min_x);\n\n \/\/ points.at(block).emplace(0.1);\n \/\/ points.at(block).emplace(1);\n\n \/\/ const int64_t num_points(64);\n \/\/ const double dx(1.0\/num_points);\n \/\/ for(double x(dx); x < 1; x +=dx)\n \/\/ points.at(block).emplace(-log(1-x));\n\n \/\/ const int64_t num_points(64);\n \/\/ const double dx(64.0\/num_points);\n \/\/ for(double x(dx); x <= 64; x +=dx)\n \/\/ points.at(block).emplace(x);\n\n for(double x(1 \/ 64.0); x < 64; x *= 1.13878863476 * 1.13878863476)\n points.at(block).emplace(x);\n\n new_points.at(block).emplace_back(max_x);\n }\n\n parameters.duality_gap_threshold = 1.1;\n while(parameters.duality_gap_threshold > parameters_in.duality_gap_threshold)\n {\n size_t num_constraints(0);\n std::vector matrix_dimensions;\n for(size_t block(0); block != num_blocks; ++block)\n {\n for(auto &point : new_points.at(block))\n {\n points.at(block).emplace(point);\n }\n num_constraints += points.at(block).size();\n matrix_dimensions.insert(matrix_dimensions.end(),\n points.at(block).size(),\n matrices[block].polynomials.size());\n if(El::mpi::Rank() == 0)\n {\n std::cout << \"points: \" << block << \" \" << points.at(block)\n << \"\\n\";\n }\n }\n\n if(El::mpi::Rank() == 0)\n {\n std::cout << \"num_constraints: \" << num_constraints << \"\\n\";\n }\n\n std::vector> primal_objective_c;\n primal_objective_c.reserve(num_constraints);\n std::vector> free_var_matrix;\n free_var_matrix.reserve(num_constraints);\n\n \/\/ TODO: This is duplicated from sdp2input\/write_output\/write_output.cxx\n auto max_normalization(normalization.begin());\n for(auto n(normalization.begin()); n != normalization.end(); ++n)\n {\n if(Abs(*n) > Abs(*max_normalization))\n {\n max_normalization = n;\n }\n }\n const size_t max_index(\n std::distance(normalization.begin(), max_normalization));\n\n for(size_t block(0); block != num_blocks; ++block)\n {\n const int64_t max_degree([&]() {\n int64_t result(0);\n for(auto &row : matrices[block].polynomials)\n for(auto &column : row)\n for(auto &poly : column)\n {\n result = std::max(result, poly.degree());\n }\n return result;\n }());\n\n for(auto &x : points.at(block))\n {\n El::BigFloat prefactor([&]() {\n if(x == infinity)\n {\n return El::BigFloat(1);\n }\n return power_prefactor(matrices[block].damped_rational.base, x)\n * poles_prefactor(matrices[block].damped_rational.poles,\n x);\n }());\n const size_t dim(matrices[block].polynomials.size());\n free_var_matrix.emplace_back(\n dim * (dim + 1) \/ 2,\n matrices[block].polynomials.at(0).at(0).size() - 1);\n auto &free_var(free_var_matrix.back());\n\n primal_objective_c.emplace_back();\n auto &primal(primal_objective_c.back());\n\n size_t flattened_matrix_row(0);\n for(size_t matrix_row(0); matrix_row != dim; ++matrix_row)\n for(size_t matrix_column(0); matrix_column <= matrix_row;\n ++matrix_column)\n {\n if(x == infinity)\n {\n if(matrices[block]\n .polynomials.at(matrix_row)\n .at(matrix_column)\n .at(max_index)\n .degree()\n < max_degree)\n {\n primal.push_back(0);\n }\n else\n {\n primal.push_back(matrices[block]\n .polynomials.at(matrix_row)\n .at(matrix_column)\n .at(max_index)\n .coefficients.at(max_degree)\n \/ normalization.at(max_index));\n }\n auto &primal_constant(primal.back());\n for(size_t column(0);\n column != size_t(free_var.Width()); ++column)\n {\n const size_t index(column\n + (column < max_index ? 0 : 1));\n if(matrices[block]\n .polynomials.at(matrix_row)\n .at(matrix_column)\n .at(index)\n .degree()\n < max_degree)\n {\n free_var(flattened_matrix_row, column)\n = primal_constant * normalization.at(index);\n }\n else\n {\n free_var(flattened_matrix_row, column)\n = primal_constant * normalization.at(index)\n - matrices[block]\n .polynomials.at(matrix_row)\n .at(matrix_column)\n .at(index)\n .coefficients.at(max_degree);\n }\n }\n }\n else\n {\n primal.push_back(prefactor\n * matrices[block]\n .polynomials.at(matrix_row)\n .at(matrix_column)\n .at(max_index)(x)\n \/ normalization.at(max_index));\n\n auto &primal_constant(primal.back());\n for(size_t column(0);\n column != size_t(free_var.Width()); ++column)\n {\n const size_t index(column\n + (column < max_index ? 0 : 1));\n free_var(flattened_matrix_row, column)\n = primal_constant * normalization.at(index)\n - prefactor\n * matrices[block]\n .polynomials.at(matrix_row)\n .at(matrix_column)\n .at(index)(x);\n }\n }\n ++flattened_matrix_row;\n }\n \/\/ Rescale rows\n const El::BigFloat scaling([&]() {\n El::BigFloat max_value(0);\n size_t flattened_matrix_row(0);\n for(size_t matrix_row(0); matrix_row != dim; ++matrix_row)\n for(size_t matrix_column(0); matrix_column <= matrix_row;\n ++matrix_column)\n {\n max_value = std::max(\n max_value, El::Abs(primal.at(flattened_matrix_row)));\n for(size_t column(0); column != size_t(free_var.Width());\n ++column)\n {\n max_value = std::max(\n max_value,\n El::Abs(free_var(flattened_matrix_row, column)));\n }\n ++flattened_matrix_row;\n }\n return 1 \/ max_value;\n }());\n {\n size_t flattened_matrix_row(0);\n for(size_t matrix_row(0); matrix_row != dim; ++matrix_row)\n for(size_t matrix_column(0); matrix_column <= matrix_row;\n ++matrix_column)\n {\n primal.at(flattened_matrix_row) *= scaling;\n for(size_t column(0); column != size_t(free_var.Width());\n ++column)\n {\n free_var(flattened_matrix_row, column) *= scaling;\n }\n ++flattened_matrix_row;\n }\n }\n }\n }\n\n El::BigFloat objective_const(objectives.at(max_index)\n \/ normalization.at(max_index));\n std::vector dual_objective_b;\n dual_objective_b.reserve(normalization.size() - 1);\n for(size_t index = 0; index < normalization.size(); ++index)\n {\n if(index != max_index)\n {\n dual_objective_b.push_back(objectives.at(index)\n - normalization.at(index)\n * objective_const);\n }\n }\n\n Block_Info block_info(matrix_dimensions, parameters.procs_per_node,\n parameters.proc_granularity, parameters.verbosity);\n El::Grid grid(block_info.mpi_comm.value);\n\n SDP sdp(objective_const, dual_objective_b, primal_objective_c,\n free_var_matrix, block_info, grid);\n\n SDP_Solver solver(parameters, block_info, grid,\n sdp.dual_objective_b.Height());\n\n for(auto &block : solver.y.blocks)\n {\n if(block.GlobalCol(0) == 0)\n {\n for(size_t row(0); row != size_t(block.LocalHeight()); ++row)\n {\n size_t global_row(block.GlobalRow(row));\n const size_t index(global_row\n + (global_row < max_index ? 0 : 1));\n block.SetLocal(row, 0, weights.at(index));\n }\n }\n }\n\n Timers timers(parameters.verbosity >= Verbosity::debug);\n SDP_Solver_Terminate_Reason reason\n = solver.run(parameters, block_info, sdp, grid, timers);\n\n if(El::mpi::Rank() == 0)\n {\n set_stream_precision(std::cout);\n std::cout << \"-----\" << reason << \"-----\\n\"\n << '\\n'\n << \"primalObjective = \" << solver.primal_objective << '\\n'\n << \"dualObjective = \" << solver.dual_objective << '\\n'\n << \"dualityGap = \" << solver.duality_gap << '\\n'\n << \"primalError = \" << solver.primal_error() << '\\n'\n << \"dualError = \" << solver.dual_error << '\\n'\n << '\\n';\n }\n\n \/\/ if(reason != SDP_Solver_Terminate_Reason::PrimalDualOptimal)\n \/\/ {\n \/\/ std::stringstream ss;\n \/\/ ss << \"Can not find solution: \" << reason;\n \/\/ throw std::runtime_error(ss.str());\n \/\/ }\n\n \/\/ y is duplicated among cores, so only need to print out copy on\n \/\/ the root node.\n \/\/ THe weight at max_index is determined by the normalization condition\n \/\/ dot(norm,weights)=1\n weights.at(max_index) = 1;\n for(size_t block_row(0);\n block_row != size_t(solver.y.blocks.at(0).Height()); ++block_row)\n {\n const size_t index(block_row + (block_row < max_index ? 0 : 1));\n weights.at(index) = solver.y.blocks.at(0).Get(block_row, 0);\n \/\/ weights.at(index)\n \/\/ = solver.y.blocks.at(0).Get(block_row, 0) * rescaling[block_row];\n weights.at(max_index) -= weights.at(index) * normalization.at(index);\n }\n weights.at(max_index) \/= normalization.at(max_index);\n\n if(El::mpi::Rank() == 0)\n {\n std::cout.precision(20);\n std::cout << \"weight: \" << weights << \"\\n\";\n\n El::BigFloat optimal(0);\n for(size_t index(0); index < objectives.size(); ++index)\n {\n optimal += objectives[index] * weights[index];\n }\n std::cout << \"optimal: \" << optimal << \"\\n\";\n }\n bool has_new_points(false);\n for(size_t block(0); block != num_blocks; ++block)\n {\n \/\/ 0.01 should be a small enough relative error so that we are\n \/\/ in the regime of convergence. Then the error estimates will\n \/\/ work\n \/\/ Mesh mesh(*(points.at(block).begin()), *(points.at(block).rbegin()),\n Mesh mesh(*(points.at(block).begin()), El::BigFloat(100),\n [&](const El::BigFloat &x) {\n return eval_weighted(matrices[block], x, weights);\n },\n (1.0 \/ 128));\n new_points.at(block) = get_new_points(mesh);\n for(auto &point : new_points.at(block))\n {\n has_new_points\n = has_new_points || (points.at(block).count(point) == 0);\n }\n }\n if(!has_new_points)\n {\n parameters.duality_gap_threshold *= (1.0 \/ 8);\n }\n }\n return weights;\n}\n<|endoftext|>"} {"text":"\/\/ 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\/logging.h\"\n#include \"chrome\/browser\/extensions\/extension_apitest.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\/web_contents.h\"\n#include \"googleurl\/src\/gurl.h\"\n#include \"net\/base\/mock_host_resolver.h\"\n\nclass ExtensionResourceRequestPolicyTest : public ExtensionApiTest {\n protected:\n virtual void SetUpCommandLine(CommandLine* command_line) OVERRIDE {\n ExtensionApiTest::SetUpCommandLine(command_line);\n command_line->AppendSwitch(switches::kAllowLegacyExtensionManifests);\n }\n};\n\n\/\/ Note, this mostly tests the logic of chrome\/renderer\/extensions\/\n\/\/ extension_resource_request_policy.*, but we have it as a browser test so that\n\/\/ can make sure it works end-to-end.\nIN_PROC_BROWSER_TEST_F(ExtensionResourceRequestPolicyTest, OriginPrivileges) {\n host_resolver()->AddRule(\"*\", \"127.0.0.1\");\n ASSERT_TRUE(test_server()->Start());\n ASSERT_TRUE(LoadExtension(test_data_dir_\n .AppendASCII(\"extension_resource_request_policy\")\n .AppendASCII(\"extension\")));\n\n GURL web_resource(\n test_server()->GetURL(\n \"files\/extensions\/api_test\/extension_resource_request_policy\/\"\n \"index.html\"));\n\n std::string host_a(\"a.com\");\n GURL::Replacements make_host_a_com;\n make_host_a_com.SetHostStr(host_a);\n\n std::string host_b(\"b.com\");\n GURL::Replacements make_host_b_com;\n make_host_b_com.SetHostStr(host_b);\n\n \/\/ A web host that has permission.\n ui_test_utils::NavigateToURL(\n browser(), web_resource.ReplaceComponents(make_host_a_com));\n std::string result;\n ASSERT_TRUE(ui_test_utils::ExecuteJavaScriptAndExtractString(\n browser()->GetSelectedWebContents()->GetRenderViewHost(), L\"\",\n L\"window.domAutomationController.send(document.title)\",\n &result));\n EXPECT_EQ(result, \"Loaded\");\n\n \/\/ A web host that loads a non-existent extension.\n GURL non_existent_extension(\n test_server()->GetURL(\n \"files\/extensions\/api_test\/extension_resource_request_policy\/\"\n \"non_existent_extension.html\"));\n ui_test_utils::NavigateToURL(browser(), non_existent_extension);\n ASSERT_TRUE(ui_test_utils::ExecuteJavaScriptAndExtractString(\n browser()->GetSelectedWebContents()->GetRenderViewHost(), L\"\",\n L\"window.domAutomationController.send(document.title)\",\n &result));\n EXPECT_EQ(result, \"Image failed to load\");\n\n \/\/ A data URL. Data URLs should always be able to load chrome-extension:\/\/\n \/\/ resources.\n std::string file_source;\n ASSERT_TRUE(file_util::ReadFileToString(\n test_data_dir_.AppendASCII(\"extension_resource_request_policy\")\n .AppendASCII(\"index.html\"), &file_source));\n ui_test_utils::NavigateToURL(browser(),\n GURL(std::string(\"data:text\/html;charset=utf-8,\") + file_source));\n ASSERT_TRUE(ui_test_utils::ExecuteJavaScriptAndExtractString(\n browser()->GetSelectedWebContents()->GetRenderViewHost(), L\"\",\n L\"window.domAutomationController.send(document.title)\",\n &result));\n EXPECT_EQ(result, \"Loaded\");\n\n \/\/ A different extension. Extensions should always be able to load each\n \/\/ other's resources.\n ASSERT_TRUE(LoadExtension(test_data_dir_\n .AppendASCII(\"extension_resource_request_policy\")\n .AppendASCII(\"extension2\")));\n ui_test_utils::NavigateToURL(\n browser(),\n GURL(\"chrome-extension:\/\/pbkkcbgdkliohhfaeefcijaghglkahja\/index.html\"));\n ASSERT_TRUE(ui_test_utils::ExecuteJavaScriptAndExtractString(\n browser()->GetSelectedWebContents()->GetRenderViewHost(), L\"\",\n L\"window.domAutomationController.send(document.title)\",\n &result));\n EXPECT_EQ(result, \"Loaded\");\n}\n\nIN_PROC_BROWSER_TEST_F(ExtensionResourceRequestPolicyTest,\n ExtensionCanLoadHostedAppIcons) {\n ASSERT_TRUE(LoadExtension(test_data_dir_\n .AppendASCII(\"extension_resource_request_policy\")\n .AppendASCII(\"extension\")));\n\n ASSERT_TRUE(RunExtensionSubtest(\n \"extension_resource_request_policy\/extension2\/\",\n \"can_load_icons_from_hosted_apps.html\"));\n}\n\nIN_PROC_BROWSER_TEST_F(ExtensionResourceRequestPolicyTest, Audio) {\n EXPECT_TRUE(RunExtensionSubtest(\n \"extension_resource_request_policy\/extension2\",\n \"audio.html\"));\n}\n\n#if defined(OS_MACOSX)\n\/\/ http:\/\/crbug.com\/95274 - Video is flaky on Mac.\n#define MAYBE_Video DISABLED_Video\n#else\n#define MAYBE_Video Video\n#endif\n\nIN_PROC_BROWSER_TEST_F(ExtensionResourceRequestPolicyTest, MAYBE_Video) {\n EXPECT_TRUE(RunExtensionSubtest(\n \"extension_resource_request_policy\/extension2\",\n \"video.html\"));\n}\n\nIN_PROC_BROWSER_TEST_F(ExtensionResourceRequestPolicyTest,\n WebAccessibleResources) {\n std::string result;\n ASSERT_TRUE(test_server()->Start());\n ASSERT_TRUE(LoadExtension(test_data_dir_\n .AppendASCII(\"extension_resource_request_policy\")\n .AppendASCII(\"web_accessible\")));\n\n GURL accessible_resource(\n test_server()->GetURL(\n \"files\/extensions\/api_test\/extension_resource_request_policy\/\"\n \"web_accessible\/accessible_resource.html\"));\n ui_test_utils::NavigateToURL(browser(), accessible_resource);\n ASSERT_TRUE(ui_test_utils::ExecuteJavaScriptAndExtractString(\n browser()->GetSelectedWebContents()->GetRenderViewHost(), L\"\",\n L\"window.domAutomationController.send(document.title)\",\n &result));\n EXPECT_EQ(\"Loaded\", result);\n\n GURL xhr_accessible_resource(\n test_server()->GetURL(\n \"files\/extensions\/api_test\/extension_resource_request_policy\/\"\n \"web_accessible\/xhr_accessible_resource.html\"));\n ui_test_utils::NavigateToURL(\n browser(), xhr_accessible_resource);\n ASSERT_TRUE(ui_test_utils::ExecuteJavaScriptAndExtractString(\n browser()->GetSelectedWebContents()->GetRenderViewHost(), L\"\",\n L\"window.domAutomationController.send(document.title)\",\n &result));\n EXPECT_EQ(\"XHR completed with status: 200\", result);\n\n GURL xhr_inaccessible_resource(\n test_server()->GetURL(\n \"files\/extensions\/api_test\/extension_resource_request_policy\/\"\n \"web_accessible\/xhr_inaccessible_resource.html\"));\n ui_test_utils::NavigateToURL(\n browser(), xhr_inaccessible_resource);\n ASSERT_TRUE(ui_test_utils::ExecuteJavaScriptAndExtractString(\n browser()->GetSelectedWebContents()->GetRenderViewHost(), L\"\",\n L\"window.domAutomationController.send(document.title)\",\n &result));\n EXPECT_EQ(\"XHR failed to load resource\", result);\n\n GURL nonaccessible_resource(\n test_server()->GetURL(\n \"files\/extensions\/api_test\/extension_resource_request_policy\/\"\n \"web_accessible\/nonaccessible_resource.html\"));\n ui_test_utils::NavigateToURL(browser(), nonaccessible_resource);\n ASSERT_TRUE(ui_test_utils::ExecuteJavaScriptAndExtractString(\n browser()->GetSelectedWebContents()->GetRenderViewHost(), L\"\",\n L\"window.domAutomationController.send(document.title)\",\n &result));\n EXPECT_EQ(\"Image failed to load\", result);\n\n GURL nonexistent_resource(\n test_server()->GetURL(\n \"files\/extensions\/api_test\/extension_resource_request_policy\/\"\n \"web_accessible\/nonexistent_resource.html\"));\n ui_test_utils::NavigateToURL(browser(), nonexistent_resource);\n ASSERT_TRUE(ui_test_utils::ExecuteJavaScriptAndExtractString(\n browser()->GetSelectedWebContents()->GetRenderViewHost(), L\"\",\n L\"window.domAutomationController.send(document.title)\",\n &result));\n EXPECT_EQ(\"Image failed to load\", result);\n}\n\nDisable ExtensionResourceRequestPolicyTest.WebAccessibleResources on Windows. It times out regularly on the win_rel trybots.\/\/ 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\/logging.h\"\n#include \"chrome\/browser\/extensions\/extension_apitest.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\/web_contents.h\"\n#include \"googleurl\/src\/gurl.h\"\n#include \"net\/base\/mock_host_resolver.h\"\n\nclass ExtensionResourceRequestPolicyTest : public ExtensionApiTest {\n protected:\n virtual void SetUpCommandLine(CommandLine* command_line) OVERRIDE {\n ExtensionApiTest::SetUpCommandLine(command_line);\n command_line->AppendSwitch(switches::kAllowLegacyExtensionManifests);\n }\n};\n\n\/\/ Note, this mostly tests the logic of chrome\/renderer\/extensions\/\n\/\/ extension_resource_request_policy.*, but we have it as a browser test so that\n\/\/ can make sure it works end-to-end.\nIN_PROC_BROWSER_TEST_F(ExtensionResourceRequestPolicyTest, OriginPrivileges) {\n host_resolver()->AddRule(\"*\", \"127.0.0.1\");\n ASSERT_TRUE(test_server()->Start());\n ASSERT_TRUE(LoadExtension(test_data_dir_\n .AppendASCII(\"extension_resource_request_policy\")\n .AppendASCII(\"extension\")));\n\n GURL web_resource(\n test_server()->GetURL(\n \"files\/extensions\/api_test\/extension_resource_request_policy\/\"\n \"index.html\"));\n\n std::string host_a(\"a.com\");\n GURL::Replacements make_host_a_com;\n make_host_a_com.SetHostStr(host_a);\n\n std::string host_b(\"b.com\");\n GURL::Replacements make_host_b_com;\n make_host_b_com.SetHostStr(host_b);\n\n \/\/ A web host that has permission.\n ui_test_utils::NavigateToURL(\n browser(), web_resource.ReplaceComponents(make_host_a_com));\n std::string result;\n ASSERT_TRUE(ui_test_utils::ExecuteJavaScriptAndExtractString(\n browser()->GetSelectedWebContents()->GetRenderViewHost(), L\"\",\n L\"window.domAutomationController.send(document.title)\",\n &result));\n EXPECT_EQ(result, \"Loaded\");\n\n \/\/ A web host that loads a non-existent extension.\n GURL non_existent_extension(\n test_server()->GetURL(\n \"files\/extensions\/api_test\/extension_resource_request_policy\/\"\n \"non_existent_extension.html\"));\n ui_test_utils::NavigateToURL(browser(), non_existent_extension);\n ASSERT_TRUE(ui_test_utils::ExecuteJavaScriptAndExtractString(\n browser()->GetSelectedWebContents()->GetRenderViewHost(), L\"\",\n L\"window.domAutomationController.send(document.title)\",\n &result));\n EXPECT_EQ(result, \"Image failed to load\");\n\n \/\/ A data URL. Data URLs should always be able to load chrome-extension:\/\/\n \/\/ resources.\n std::string file_source;\n ASSERT_TRUE(file_util::ReadFileToString(\n test_data_dir_.AppendASCII(\"extension_resource_request_policy\")\n .AppendASCII(\"index.html\"), &file_source));\n ui_test_utils::NavigateToURL(browser(),\n GURL(std::string(\"data:text\/html;charset=utf-8,\") + file_source));\n ASSERT_TRUE(ui_test_utils::ExecuteJavaScriptAndExtractString(\n browser()->GetSelectedWebContents()->GetRenderViewHost(), L\"\",\n L\"window.domAutomationController.send(document.title)\",\n &result));\n EXPECT_EQ(result, \"Loaded\");\n\n \/\/ A different extension. Extensions should always be able to load each\n \/\/ other's resources.\n ASSERT_TRUE(LoadExtension(test_data_dir_\n .AppendASCII(\"extension_resource_request_policy\")\n .AppendASCII(\"extension2\")));\n ui_test_utils::NavigateToURL(\n browser(),\n GURL(\"chrome-extension:\/\/pbkkcbgdkliohhfaeefcijaghglkahja\/index.html\"));\n ASSERT_TRUE(ui_test_utils::ExecuteJavaScriptAndExtractString(\n browser()->GetSelectedWebContents()->GetRenderViewHost(), L\"\",\n L\"window.domAutomationController.send(document.title)\",\n &result));\n EXPECT_EQ(result, \"Loaded\");\n}\n\nIN_PROC_BROWSER_TEST_F(ExtensionResourceRequestPolicyTest,\n ExtensionCanLoadHostedAppIcons) {\n ASSERT_TRUE(LoadExtension(test_data_dir_\n .AppendASCII(\"extension_resource_request_policy\")\n .AppendASCII(\"extension\")));\n\n ASSERT_TRUE(RunExtensionSubtest(\n \"extension_resource_request_policy\/extension2\/\",\n \"can_load_icons_from_hosted_apps.html\"));\n}\n\nIN_PROC_BROWSER_TEST_F(ExtensionResourceRequestPolicyTest, Audio) {\n EXPECT_TRUE(RunExtensionSubtest(\n \"extension_resource_request_policy\/extension2\",\n \"audio.html\"));\n}\n\n#if defined(OS_MACOSX)\n\/\/ http:\/\/crbug.com\/95274 - Video is flaky on Mac.\n#define MAYBE_Video DISABLED_Video\n#else\n#define MAYBE_Video Video\n#endif\n\nIN_PROC_BROWSER_TEST_F(ExtensionResourceRequestPolicyTest, MAYBE_Video) {\n EXPECT_TRUE(RunExtensionSubtest(\n \"extension_resource_request_policy\/extension2\",\n \"video.html\"));\n}\n\n\/\/ This test times out regularly on win_rel trybots. See http:\/\/crbug.com\/122154\n#if defined(OS_WIN)\n#define MAYBE_WebAccessibleResources DISABLED_WebAccessibleResources\n#else\n#define MAYBE_WebAccessibleResources WebAccessibleResources\n#endif\nIN_PROC_BROWSER_TEST_F(ExtensionResourceRequestPolicyTest,\n MAYBE_WebAccessibleResources) {\n std::string result;\n ASSERT_TRUE(test_server()->Start());\n ASSERT_TRUE(LoadExtension(test_data_dir_\n .AppendASCII(\"extension_resource_request_policy\")\n .AppendASCII(\"web_accessible\")));\n\n GURL accessible_resource(\n test_server()->GetURL(\n \"files\/extensions\/api_test\/extension_resource_request_policy\/\"\n \"web_accessible\/accessible_resource.html\"));\n ui_test_utils::NavigateToURL(browser(), accessible_resource);\n ASSERT_TRUE(ui_test_utils::ExecuteJavaScriptAndExtractString(\n browser()->GetSelectedWebContents()->GetRenderViewHost(), L\"\",\n L\"window.domAutomationController.send(document.title)\",\n &result));\n EXPECT_EQ(\"Loaded\", result);\n\n GURL xhr_accessible_resource(\n test_server()->GetURL(\n \"files\/extensions\/api_test\/extension_resource_request_policy\/\"\n \"web_accessible\/xhr_accessible_resource.html\"));\n ui_test_utils::NavigateToURL(\n browser(), xhr_accessible_resource);\n ASSERT_TRUE(ui_test_utils::ExecuteJavaScriptAndExtractString(\n browser()->GetSelectedWebContents()->GetRenderViewHost(), L\"\",\n L\"window.domAutomationController.send(document.title)\",\n &result));\n EXPECT_EQ(\"XHR completed with status: 200\", result);\n\n GURL xhr_inaccessible_resource(\n test_server()->GetURL(\n \"files\/extensions\/api_test\/extension_resource_request_policy\/\"\n \"web_accessible\/xhr_inaccessible_resource.html\"));\n ui_test_utils::NavigateToURL(\n browser(), xhr_inaccessible_resource);\n ASSERT_TRUE(ui_test_utils::ExecuteJavaScriptAndExtractString(\n browser()->GetSelectedWebContents()->GetRenderViewHost(), L\"\",\n L\"window.domAutomationController.send(document.title)\",\n &result));\n EXPECT_EQ(\"XHR failed to load resource\", result);\n\n GURL nonaccessible_resource(\n test_server()->GetURL(\n \"files\/extensions\/api_test\/extension_resource_request_policy\/\"\n \"web_accessible\/nonaccessible_resource.html\"));\n ui_test_utils::NavigateToURL(browser(), nonaccessible_resource);\n ASSERT_TRUE(ui_test_utils::ExecuteJavaScriptAndExtractString(\n browser()->GetSelectedWebContents()->GetRenderViewHost(), L\"\",\n L\"window.domAutomationController.send(document.title)\",\n &result));\n EXPECT_EQ(\"Image failed to load\", result);\n\n GURL nonexistent_resource(\n test_server()->GetURL(\n \"files\/extensions\/api_test\/extension_resource_request_policy\/\"\n \"web_accessible\/nonexistent_resource.html\"));\n ui_test_utils::NavigateToURL(browser(), nonexistent_resource);\n ASSERT_TRUE(ui_test_utils::ExecuteJavaScriptAndExtractString(\n browser()->GetSelectedWebContents()->GetRenderViewHost(), L\"\",\n L\"window.domAutomationController.send(document.title)\",\n &result));\n EXPECT_EQ(\"Image failed to load\", result);\n}\n\n<|endoftext|>"} {"text":"\/\/ 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 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\nThrottle websocket live experiment\/\/ 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 runner;\n\n\/* static *\/\nvoid WebSocketExperimentRunner::Start() {\n DCHECK(!runner.get());\n\n scoped_refptr 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":"\/\/-------------------------------------------------------------------------------------------------------\n\/\/ Copyright (C) Microsoft. All rights reserved.\n\/\/ Licensed under the MIT license. See LICENSE.txt file in the project root for full license information.\n\/\/-------------------------------------------------------------------------------------------------------\n#include \"CommonMemoryPch.h\"\n#ifdef __clang__\n#include \n#endif\n\n#if ENABLE_MEM_STATS\nMemStats::MemStats()\n : objectByteCount(0), totalByteCount(0)\n{}\n\nvoid MemStats::Reset()\n{\n objectByteCount = 0;\n totalByteCount = 0;\n}\n\nsize_t MemStats::FreeBytes() const\n{\n return totalByteCount - objectByteCount;\n}\n\ndouble MemStats::UsedRatio() const\n{\n return (double)objectByteCount \/ totalByteCount;\n}\n\nvoid MemStats::Aggregate(const MemStats& other)\n{\n objectByteCount += other.objectByteCount;\n totalByteCount += other.totalByteCount;\n}\n\n#ifdef DUMP_FRAGMENTATION_STATS\nHeapBucketStats::HeapBucketStats()\n : totalBlockCount(0), objectCount(0), finalizeCount(0)\n{}\n\nvoid HeapBucketStats::Reset()\n{\n MemStats::Reset();\n totalBlockCount = 0;\n objectCount = 0;\n finalizeCount = 0;\n}\n\nvoid HeapBucketStats::Dump() const\n{\n Output::Print(_u(\"%5d %7d %7d %11lu %11lu %11lu %6.2f%%\\n\"),\n totalBlockCount, objectCount, finalizeCount,\n static_cast(objectByteCount),\n static_cast(FreeBytes()),\n static_cast(totalByteCount),\n UsedRatio() * 100);\n}\n#endif\n\nvoid HeapBucketStats::PreAggregate()\n{\n \/\/ When first enter Pre-Aggregate state, clear data and mark state.\n if (!(totalByteCount & 1))\n {\n Reset();\n totalByteCount |= 1;\n }\n}\n\nvoid HeapBucketStats::BeginAggregate()\n{\n \/\/ If was Pre-Aggregate state, keep data and clear state\n if (totalByteCount & 1)\n {\n totalByteCount &= ~1;\n }\n else\n {\n Reset();\n }\n}\n\nvoid HeapBucketStats::Aggregate(const HeapBucketStats& other)\n{\n MemStats::Aggregate(other);\n#ifdef DUMP_FRAGMENTATION_STATS\n totalBlockCount += other.totalBlockCount;\n objectCount += other.objectCount;\n finalizeCount += other.finalizeCount;\n#endif\n}\n#endif \/\/ ENABLE_MEM_STATS\nRemove reference to unused header file\/\/-------------------------------------------------------------------------------------------------------\n\/\/ Copyright (C) Microsoft. All rights reserved.\n\/\/ Licensed under the MIT license. See LICENSE.txt file in the project root for full license information.\n\/\/-------------------------------------------------------------------------------------------------------\n#include \"CommonMemoryPch.h\"\n\n#if ENABLE_MEM_STATS\nMemStats::MemStats()\n : objectByteCount(0), totalByteCount(0)\n{}\n\nvoid MemStats::Reset()\n{\n objectByteCount = 0;\n totalByteCount = 0;\n}\n\nsize_t MemStats::FreeBytes() const\n{\n return totalByteCount - objectByteCount;\n}\n\ndouble MemStats::UsedRatio() const\n{\n return (double)objectByteCount \/ totalByteCount;\n}\n\nvoid MemStats::Aggregate(const MemStats& other)\n{\n objectByteCount += other.objectByteCount;\n totalByteCount += other.totalByteCount;\n}\n\n#ifdef DUMP_FRAGMENTATION_STATS\nHeapBucketStats::HeapBucketStats()\n : totalBlockCount(0), objectCount(0), finalizeCount(0)\n{}\n\nvoid HeapBucketStats::Reset()\n{\n MemStats::Reset();\n totalBlockCount = 0;\n objectCount = 0;\n finalizeCount = 0;\n}\n\nvoid HeapBucketStats::Dump() const\n{\n Output::Print(_u(\"%5d %7d %7d %11lu %11lu %11lu %6.2f%%\\n\"),\n totalBlockCount, objectCount, finalizeCount,\n static_cast(objectByteCount),\n static_cast(FreeBytes()),\n static_cast(totalByteCount),\n UsedRatio() * 100);\n}\n#endif\n\nvoid HeapBucketStats::PreAggregate()\n{\n \/\/ When first enter Pre-Aggregate state, clear data and mark state.\n if (!(totalByteCount & 1))\n {\n Reset();\n totalByteCount |= 1;\n }\n}\n\nvoid HeapBucketStats::BeginAggregate()\n{\n \/\/ If was Pre-Aggregate state, keep data and clear state\n if (totalByteCount & 1)\n {\n totalByteCount &= ~1;\n }\n else\n {\n Reset();\n }\n}\n\nvoid HeapBucketStats::Aggregate(const HeapBucketStats& other)\n{\n MemStats::Aggregate(other);\n#ifdef DUMP_FRAGMENTATION_STATS\n totalBlockCount += other.totalBlockCount;\n objectCount += other.objectCount;\n finalizeCount += other.finalizeCount;\n#endif\n}\n#endif \/\/ ENABLE_MEM_STATS\n<|endoftext|>"} {"text":"#include \"depthai\/pipeline\/datatype\/NNData.hpp\"\n\n#include \n#include \n#include \n#include \n\n#include \"depthai-shared\/datatype\/RawNNData.hpp\"\n#include \"depthai\/pipeline\/datatype\/ADatatype.hpp\"\n#include \"fp16\/fp16.h\"\n\nnamespace dai {\n\nNNData::NNData() : Buffer(std::make_shared()), rawNn(*dynamic_cast(raw.get())) {}\nNNData::NNData(std::shared_ptr ptr) : Buffer(ptr), rawNn(*ptr.get()) {}\n\nstatic std::size_t sizeofTensorInfoDataType(TensorInfo::DataType type) {\n switch(type) {\n case TensorInfo::DataType::FP16:\n return sizeof(uint16_t);\n case TensorInfo::DataType::FP32:\n return sizeof(float);\n case TensorInfo::DataType::I8:\n return sizeof(int8_t);\n case TensorInfo::DataType::INT:\n return sizeof(int32_t);\n case TensorInfo::DataType::U8F:\n return sizeof(uint8_t);\n default:\n \/\/ invalid type, shouldn't happen\n assert(0);\n }\n}\n\nstd::shared_ptr NNData::serialize() const {\n \/\/ get data from u8Data and fp16Data and place properly into the underlying raw buffer\n rawNn.tensors = {};\n\n \/\/ U8 tensors\n for(const auto& kv : u8Data) {\n const auto dataType = TensorInfo::DataType::U8F;\n const auto dataSize = kv.second.size() * sizeofTensorInfoDataType(dataType);\n\n \/\/ First add any required padding bytes\n \/\/ calculate how many alignment bytes to add for next tensor\n size_t remainder = (rawNn.data.end() - rawNn.data.begin()) % DATA_ALIGNMENT;\n if(remainder > 0) {\n rawNn.data.insert(rawNn.data.end(), DATA_ALIGNMENT - remainder, 0);\n }\n\n \/\/ Then get offset to beginning of data\n size_t offset = rawNn.data.end() - rawNn.data.begin();\n\n const auto* data = reinterpret_cast(kv.second.data());\n rawNn.data.insert(rawNn.data.end(), data, data + dataSize);\n\n \/\/ Add entry in tensors\n TensorInfo info;\n info.dataType = dataType;\n info.numDimensions = 0;\n info.name = kv.first;\n info.offset = offset;\n rawNn.tensors.push_back(info);\n }\n\n \/\/ FP16 tensors\n for(const auto& kv : fp16Data) {\n const auto dataType = TensorInfo::DataType::FP16;\n const auto dataSize = kv.second.size() * sizeofTensorInfoDataType(dataType);\n\n \/\/ First add any required padding bytes\n \/\/ calculate how many alignment bytes to add for next tensor\n size_t remainder = (rawNn.data.end() - rawNn.data.begin()) % DATA_ALIGNMENT;\n if(remainder > 0) {\n rawNn.data.insert(rawNn.data.end(), DATA_ALIGNMENT - remainder, 0);\n }\n\n \/\/ Then get offset to beginning of data\n size_t offset = rawNn.data.end() - rawNn.data.begin();\n\n const auto* data = reinterpret_cast(kv.second.data());\n rawNn.data.insert(rawNn.data.end(), data, data + dataSize);\n\n \/\/ Add entry in tensors\n TensorInfo info;\n info.dataType = dataType;\n info.numDimensions = 0;\n info.name = kv.first;\n info.offset = offset;\n rawNn.tensors.push_back(info);\n }\n\n return raw;\n}\n\n\/\/ setters\n\/\/ uint8_t\nvoid NNData::setLayer(const std::string& name, std::vector data) {\n u8Data[name] = std::move(data);\n}\nvoid NNData::setLayer(const std::string& name, const std::vector& data) {\n u8Data[name] = std::vector(data.size());\n for(unsigned i = 0; i < data.size(); i++) {\n u8Data[name][i] = static_cast(data[i]);\n }\n}\n\n\/\/ fp16\nvoid NNData::setLayer(const std::string& name, std::vector data) {\n fp16Data[name] = std::vector(data.size());\n for(unsigned i = 0; i < data.size(); i++) {\n fp16Data[name][i] = fp16_ieee_from_fp32_value(data[i]);\n }\n}\nvoid NNData::setLayer(const std::string& name, std::vector data) {\n fp16Data[name] = std::vector(data.size());\n for(unsigned i = 0; i < data.size(); i++) {\n fp16Data[name][i] = fp16_ieee_from_fp32_value(data[i]);\n }\n}\n\n\/\/ getters\nstd::vector NNData::getAllLayerNames() const {\n std::vector names;\n for(const auto& t : rawNn.tensors) {\n names.push_back(t.name);\n }\n return names;\n}\n\nstd::vector NNData::getAllLayers() const {\n return rawNn.tensors;\n}\n\nbool NNData::getLayer(const std::string& name, TensorInfo& tensor) const {\n for(const auto& t : rawNn.tensors) {\n if(t.name == name) {\n tensor = t;\n return true;\n }\n }\n return false;\n}\n\nbool NNData::hasLayer(const std::string& name) const {\n for(const auto& tensor : rawNn.tensors) {\n if(tensor.name == name) return true;\n }\n return false;\n}\n\nbool NNData::getLayerDatatype(const std::string& name, TensorInfo::DataType& datatype) const {\n TensorInfo tensor;\n if(getLayer(name, tensor)) {\n datatype = tensor.dataType;\n return true;\n }\n return false;\n}\n\n\/\/ uint8\nstd::vector NNData::getLayerUInt8(const std::string& name) const {\n \/\/ std::vector data;\n \/\/ find layer name and its offset\n TensorInfo tensor;\n if(getLayer(name, tensor)) {\n if(tensor.dataType == TensorInfo::DataType::U8F) {\n \/\/ Total data size = last dimension * last stride\n if(tensor.numDimensions > 0) {\n size_t size = tensor.dims[tensor.numDimensions - 1] * tensor.strides[tensor.numDimensions - 1];\n auto beg = rawNn.data.begin() + tensor.offset;\n auto end = beg + size;\n return {beg, end};\n }\n }\n }\n return {};\n}\n\n\/\/ fp16\nstd::vector NNData::getLayerFp16(const std::string& name) const {\n \/\/ find layer name and its offset\n TensorInfo tensor;\n if(getLayer(name, tensor)) {\n if(tensor.dataType == TensorInfo::DataType::FP16) {\n \/\/ Total data size = last dimension * last stride\n if(tensor.numDimensions > 0) {\n std::size_t size = tensor.dims[tensor.numDimensions - 1] * tensor.strides[tensor.numDimensions - 1];\n std::size_t numElements = size \/ 2; \/\/ FP16\n\n std::vector data;\n auto* pFp16Data = reinterpret_cast(&rawNn.data[tensor.offset]);\n for(std::size_t i = 0; i < numElements; i++) {\n data.push_back(fp16_ieee_to_fp32_value(pFp16Data[i]));\n }\n return data;\n }\n }\n }\n return {};\n}\n\n\/\/ uint8\nstd::vector NNData::getFirstLayerUInt8() const {\n \/\/ find layer name and its offset\n if(!rawNn.tensors.empty()) {\n return getLayerUInt8(rawNn.tensors[0].name);\n }\n\n return {};\n}\n\n\/\/ fp16\nstd::vector NNData::getFirstLayerFp16() const {\n \/\/ find layer name and its offset\n if(!rawNn.tensors.empty()) {\n return getLayerFp16(rawNn.tensors[0].name);\n }\n return {};\n}\n\n} \/\/ namespace dai\nCompilation error fix#include \"depthai\/pipeline\/datatype\/NNData.hpp\"\n\n#include \n#include \n#include \n#include \n\n#include \"depthai-shared\/datatype\/RawNNData.hpp\"\n#include \"depthai\/pipeline\/datatype\/ADatatype.hpp\"\n#include \"fp16\/fp16.h\"\n\nnamespace dai {\n\nNNData::NNData() : Buffer(std::make_shared()), rawNn(*dynamic_cast(raw.get())) {}\nNNData::NNData(std::shared_ptr ptr) : Buffer(ptr), rawNn(*ptr.get()) {}\n\nstatic std::size_t sizeofTensorInfoDataType(TensorInfo::DataType type) {\n switch(type) {\n case TensorInfo::DataType::FP16:\n return sizeof(uint16_t);\n case TensorInfo::DataType::FP32:\n return sizeof(float);\n case TensorInfo::DataType::I8:\n return sizeof(int8_t);\n case TensorInfo::DataType::INT:\n return sizeof(int32_t);\n case TensorInfo::DataType::U8F:\n return sizeof(uint8_t);\n default:\n \/\/ invalid type, shouldn't happen\n assert(0);\n return 0;\n }\n}\n\nstd::shared_ptr NNData::serialize() const {\n \/\/ get data from u8Data and fp16Data and place properly into the underlying raw buffer\n rawNn.tensors = {};\n\n \/\/ U8 tensors\n for(const auto& kv : u8Data) {\n const auto dataType = TensorInfo::DataType::U8F;\n const auto dataSize = kv.second.size() * sizeofTensorInfoDataType(dataType);\n\n \/\/ First add any required padding bytes\n \/\/ calculate how many alignment bytes to add for next tensor\n size_t remainder = (rawNn.data.end() - rawNn.data.begin()) % DATA_ALIGNMENT;\n if(remainder > 0) {\n rawNn.data.insert(rawNn.data.end(), DATA_ALIGNMENT - remainder, 0);\n }\n\n \/\/ Then get offset to beginning of data\n size_t offset = rawNn.data.end() - rawNn.data.begin();\n\n const auto* data = reinterpret_cast(kv.second.data());\n rawNn.data.insert(rawNn.data.end(), data, data + dataSize);\n\n \/\/ Add entry in tensors\n TensorInfo info;\n info.dataType = dataType;\n info.numDimensions = 0;\n info.name = kv.first;\n info.offset = offset;\n rawNn.tensors.push_back(info);\n }\n\n \/\/ FP16 tensors\n for(const auto& kv : fp16Data) {\n const auto dataType = TensorInfo::DataType::FP16;\n const auto dataSize = kv.second.size() * sizeofTensorInfoDataType(dataType);\n\n \/\/ First add any required padding bytes\n \/\/ calculate how many alignment bytes to add for next tensor\n size_t remainder = (rawNn.data.end() - rawNn.data.begin()) % DATA_ALIGNMENT;\n if(remainder > 0) {\n rawNn.data.insert(rawNn.data.end(), DATA_ALIGNMENT - remainder, 0);\n }\n\n \/\/ Then get offset to beginning of data\n size_t offset = rawNn.data.end() - rawNn.data.begin();\n\n const auto* data = reinterpret_cast(kv.second.data());\n rawNn.data.insert(rawNn.data.end(), data, data + dataSize);\n\n \/\/ Add entry in tensors\n TensorInfo info;\n info.dataType = dataType;\n info.numDimensions = 0;\n info.name = kv.first;\n info.offset = offset;\n rawNn.tensors.push_back(info);\n }\n\n return raw;\n}\n\n\/\/ setters\n\/\/ uint8_t\nvoid NNData::setLayer(const std::string& name, std::vector data) {\n u8Data[name] = std::move(data);\n}\nvoid NNData::setLayer(const std::string& name, const std::vector& data) {\n u8Data[name] = std::vector(data.size());\n for(unsigned i = 0; i < data.size(); i++) {\n u8Data[name][i] = static_cast(data[i]);\n }\n}\n\n\/\/ fp16\nvoid NNData::setLayer(const std::string& name, std::vector data) {\n fp16Data[name] = std::vector(data.size());\n for(unsigned i = 0; i < data.size(); i++) {\n fp16Data[name][i] = fp16_ieee_from_fp32_value(data[i]);\n }\n}\nvoid NNData::setLayer(const std::string& name, std::vector data) {\n fp16Data[name] = std::vector(data.size());\n for(unsigned i = 0; i < data.size(); i++) {\n fp16Data[name][i] = fp16_ieee_from_fp32_value(data[i]);\n }\n}\n\n\/\/ getters\nstd::vector NNData::getAllLayerNames() const {\n std::vector names;\n for(const auto& t : rawNn.tensors) {\n names.push_back(t.name);\n }\n return names;\n}\n\nstd::vector NNData::getAllLayers() const {\n return rawNn.tensors;\n}\n\nbool NNData::getLayer(const std::string& name, TensorInfo& tensor) const {\n for(const auto& t : rawNn.tensors) {\n if(t.name == name) {\n tensor = t;\n return true;\n }\n }\n return false;\n}\n\nbool NNData::hasLayer(const std::string& name) const {\n for(const auto& tensor : rawNn.tensors) {\n if(tensor.name == name) return true;\n }\n return false;\n}\n\nbool NNData::getLayerDatatype(const std::string& name, TensorInfo::DataType& datatype) const {\n TensorInfo tensor;\n if(getLayer(name, tensor)) {\n datatype = tensor.dataType;\n return true;\n }\n return false;\n}\n\n\/\/ uint8\nstd::vector NNData::getLayerUInt8(const std::string& name) const {\n \/\/ std::vector data;\n \/\/ find layer name and its offset\n TensorInfo tensor;\n if(getLayer(name, tensor)) {\n if(tensor.dataType == TensorInfo::DataType::U8F) {\n \/\/ Total data size = last dimension * last stride\n if(tensor.numDimensions > 0) {\n size_t size = tensor.dims[tensor.numDimensions - 1] * tensor.strides[tensor.numDimensions - 1];\n auto beg = rawNn.data.begin() + tensor.offset;\n auto end = beg + size;\n return {beg, end};\n }\n }\n }\n return {};\n}\n\n\/\/ fp16\nstd::vector NNData::getLayerFp16(const std::string& name) const {\n \/\/ find layer name and its offset\n TensorInfo tensor;\n if(getLayer(name, tensor)) {\n if(tensor.dataType == TensorInfo::DataType::FP16) {\n \/\/ Total data size = last dimension * last stride\n if(tensor.numDimensions > 0) {\n std::size_t size = tensor.dims[tensor.numDimensions - 1] * tensor.strides[tensor.numDimensions - 1];\n std::size_t numElements = size \/ 2; \/\/ FP16\n\n std::vector data;\n auto* pFp16Data = reinterpret_cast(&rawNn.data[tensor.offset]);\n for(std::size_t i = 0; i < numElements; i++) {\n data.push_back(fp16_ieee_to_fp32_value(pFp16Data[i]));\n }\n return data;\n }\n }\n }\n return {};\n}\n\n\/\/ uint8\nstd::vector NNData::getFirstLayerUInt8() const {\n \/\/ find layer name and its offset\n if(!rawNn.tensors.empty()) {\n return getLayerUInt8(rawNn.tensors[0].name);\n }\n\n return {};\n}\n\n\/\/ fp16\nstd::vector NNData::getFirstLayerFp16() const {\n \/\/ find layer name and its offset\n if(!rawNn.tensors.empty()) {\n return getLayerFp16(rawNn.tensors[0].name);\n }\n return {};\n}\n\n} \/\/ namespace dai\n<|endoftext|>"} {"text":"\/\/\n\/\/ Copyright (c) Microsoft. All rights reserved.\n\/\/ Copyright (c) Geoff Norton. All rights reserved.\n\/\/ Licensed under the MIT license. See LICENSE file in the project root for full license information.\n\/\/\n\n\/*++\n\n\n\nModule Name:\n\n seh-unwind.cpp\n\nAbstract:\n\n Implementation of exception API functions based on\n the Unwind API.\n\n\n\n--*\/\n\n#ifndef FEATURE_PAL_SXS\n#error FEATURE_PAL_SXS needs to be defined for this file.\n#endif \/\/ !FEATURE_PAL_SXS\n\n#include \"pal\/context.h\"\n#include \n#include \n#define UNW_LOCAL_ONLY\n#include \n\n\/\/----------------------------------------------------------------------\n\/\/ Virtual Unwinding\n\/\/----------------------------------------------------------------------\n\n#if UNWIND_CONTEXT_IS_UCONTEXT_T\nstatic void WinContextToUnwindContext(CONTEXT *winContext, unw_context_t *unwContext)\n{\n#if defined(_AMD64_)\n unwContext->uc_mcontext.gregs[REG_RIP] = winContext->Rip;\n unwContext->uc_mcontext.gregs[REG_RSP] = winContext->Rsp;\n unwContext->uc_mcontext.gregs[REG_RBP] = winContext->Rbp;\n unwContext->uc_mcontext.gregs[REG_RBX] = winContext->Rbx;\n unwContext->uc_mcontext.gregs[REG_R12] = winContext->R12;\n unwContext->uc_mcontext.gregs[REG_R13] = winContext->R13;\n unwContext->uc_mcontext.gregs[REG_R14] = winContext->R14;\n unwContext->uc_mcontext.gregs[REG_R15] = winContext->R15;\n#else\n#error unsupported architecture\n#endif\n}\n#else\nstatic void WinContextToUnwindCursor(CONTEXT *winContext, unw_cursor_t *cursor)\n{\n#if defined(_AMD64_)\n unw_set_reg(cursor, UNW_REG_IP, winContext->Rip);\n unw_set_reg(cursor, UNW_REG_SP, winContext->Rsp);\n unw_set_reg(cursor, UNW_X86_64_RBP, winContext->Rbp);\n unw_set_reg(cursor, UNW_X86_64_RBX, winContext->Rbx);\n unw_set_reg(cursor, UNW_X86_64_R12, winContext->R12);\n unw_set_reg(cursor, UNW_X86_64_R13, winContext->R13);\n unw_set_reg(cursor, UNW_X86_64_R14, winContext->R14);\n unw_set_reg(cursor, UNW_X86_64_R15, winContext->R15);\n#else\n#error unsupported architecture\n#endif\n}\n#endif\n\nstatic void UnwindContextToWinContext(unw_cursor_t *cursor, CONTEXT *winContext)\n{\n#if defined(_AMD64_)\n unw_get_reg(cursor, UNW_REG_IP, (unw_word_t *) &winContext->Rip);\n unw_get_reg(cursor, UNW_REG_SP, (unw_word_t *) &winContext->Rsp);\n unw_get_reg(cursor, UNW_X86_64_RBP, (unw_word_t *) &winContext->Rbp);\n unw_get_reg(cursor, UNW_X86_64_RBX, (unw_word_t *) &winContext->Rbx);\n unw_get_reg(cursor, UNW_X86_64_R12, (unw_word_t *) &winContext->R12);\n unw_get_reg(cursor, UNW_X86_64_R13, (unw_word_t *) &winContext->R13);\n unw_get_reg(cursor, UNW_X86_64_R14, (unw_word_t *) &winContext->R14);\n unw_get_reg(cursor, UNW_X86_64_R15, (unw_word_t *) &winContext->R15);\n#else\n#error unsupported architecture\n#endif\n}\n\nstatic void GetContextPointer(unw_cursor_t *cursor, int reg, PDWORD64 *contextPointer)\n{\n#if defined(__APPLE__)\n \/\/OSXTODO\n#else\n unw_save_loc_t saveLoc;\n unw_get_save_loc(cursor, reg, &saveLoc);\n if (saveLoc.type == UNW_SLT_MEMORY)\n {\n *contextPointer = (PDWORD64)saveLoc.u.addr;\n }\n#endif\n}\n\nstatic void GetContextPointers(unw_cursor_t *cursor, KNONVOLATILE_CONTEXT_POINTERS *contextPointers)\n{\n#if defined(_AMD64_)\n GetContextPointer(cursor, UNW_X86_64_RBP, &contextPointers->Rbp);\n GetContextPointer(cursor, UNW_X86_64_RBX, &contextPointers->Rbx);\n GetContextPointer(cursor, UNW_X86_64_R12, &contextPointers->R12);\n GetContextPointer(cursor, UNW_X86_64_R13, &contextPointers->R13);\n GetContextPointer(cursor, UNW_X86_64_R14, &contextPointers->R14);\n GetContextPointer(cursor, UNW_X86_64_R15, &contextPointers->R15);\n#else\n#error unsupported architecture\n#endif\n}\n\nBOOL PAL_VirtualUnwind(CONTEXT *context, KNONVOLATILE_CONTEXT_POINTERS *contextPointers)\n{\n int st;\n unw_context_t unwContext;\n unw_cursor_t cursor;\n\n#if UNWIND_CONTEXT_IS_UCONTEXT_T\n WinContextToUnwindContext(context, &unwContext);\n#else\n st = unw_getcontext(&unwContext);\n if (st < 0)\n {\n return FALSE;\n }\n#endif\n\n st = unw_init_local(&cursor, &unwContext);\n if (st < 0)\n {\n return FALSE;\n }\n\n#if !UNWIND_CONTEXT_IS_UCONTEXT_T\n \/\/ Set the unwind context to the specified windows context\n WinContextToUnwindCursor(context, &cursor);\n#endif\n\n st = unw_step(&cursor);\n if (st < 0)\n {\n return FALSE;\n }\n\n \/\/ Update the passed in windows context to reflect the unwind\n UnwindContextToWinContext(&cursor, context);\n\n if (contextPointers != NULL)\n {\n GetContextPointers(&cursor, contextPointers);\n }\n\n return TRUE;\n}\n\nPAL_NORETURN\nstatic void RtlpRaiseException(EXCEPTION_RECORD *ExceptionRecord)\n{\n \/\/ Capture the context of RtlpRaiseException.\n CONTEXT ContextRecord;\n ZeroMemory(&ContextRecord, sizeof(CONTEXT));\n ContextRecord.ContextFlags = CONTEXT_FULL;\n CONTEXT_CaptureContext(&ContextRecord);\n\n \/\/ Find the caller of RtlpRaiseException. \n PAL_VirtualUnwind(&ContextRecord, NULL);\n\n \/\/ The frame we're looking at now is RaiseException. We have to unwind one \n \/\/ level further to get the actual context user code could be resumed at.\n PAL_VirtualUnwind(&ContextRecord, NULL);\n#if defined(_X86_)\n ExceptionRecord->ExceptionAddress = (void *) ContextRecord.Eip;\n#elif defined(_AMD64_)\n ExceptionRecord->ExceptionAddress = (void *) ContextRecord.Rip;\n#else\n#error unsupported architecture\n#endif\n\n EXCEPTION_POINTERS pointers;\n pointers.ExceptionRecord = ExceptionRecord;\n pointers.ContextRecord = &ContextRecord;\n\n SEHRaiseException(InternalGetCurrentThread(), &pointers, 0);\n}\n\nPAL_NORETURN\nvoid SEHRaiseException(CPalThread *pthrCurrent,\n PEXCEPTION_POINTERS lpExceptionPointers,\n int signal_code)\n{\n throw PAL_SEHException(lpExceptionPointers->ExceptionRecord, lpExceptionPointers->ContextRecord);\n}\n\n\/*++\nFunction:\n RaiseException\n\nSee MSDN doc.\n--*\/\n\/\/ no PAL_NORETURN, as callers must assume this can return for continuable exceptions.\nVOID\nPALAPI\nRaiseException(IN DWORD dwExceptionCode,\n IN DWORD dwExceptionFlags,\n IN DWORD nNumberOfArguments,\n IN CONST ULONG_PTR *lpArguments)\n{\n \/\/ PERF_ENTRY_ONLY is used here because RaiseException may or may not\n \/\/ return. We can not get latency data without PERF_EXIT. For this reason,\n \/\/ PERF_ENTRY_ONLY is used to profile frequency only.\n PERF_ENTRY_ONLY(RaiseException);\n ENTRY(\"RaiseException(dwCode=%#x, dwFlags=%#x, nArgs=%u, lpArguments=%p)\\n\",\n dwExceptionCode, dwExceptionFlags, nNumberOfArguments, lpArguments);\n\n \/* Validate parameters *\/\n if (dwExceptionCode & RESERVED_SEH_BIT)\n {\n WARN(\"Exception code %08x has bit 28 set; clearing it.\\n\", dwExceptionCode);\n dwExceptionCode ^= RESERVED_SEH_BIT;\n }\n\n if (nNumberOfArguments > EXCEPTION_MAXIMUM_PARAMETERS) \n {\n nNumberOfArguments = EXCEPTION_MAXIMUM_PARAMETERS;\n }\n\n EXCEPTION_RECORD exceptionRecord;\n ZeroMemory(&exceptionRecord, sizeof(EXCEPTION_RECORD));\n\n exceptionRecord.ExceptionCode = dwExceptionCode;\n exceptionRecord.ExceptionFlags = dwExceptionFlags;\n exceptionRecord.ExceptionRecord = NULL;\n exceptionRecord.ExceptionAddress = NULL; \/\/ will be set by RtlpRaiseException\n exceptionRecord.NumberParameters = nNumberOfArguments;\n if (nNumberOfArguments)\n {\n if (nNumberOfArguments > EXCEPTION_MAXIMUM_PARAMETERS)\n {\n WARN(\"Number of arguments (%d) exceeds the limit \"\n \"EXCEPTION_MAXIMUM_PARAMETERS (%d); ignoring extra parameters.\\n\",\n nNumberOfArguments, EXCEPTION_MAXIMUM_PARAMETERS);\n nNumberOfArguments = EXCEPTION_MAXIMUM_PARAMETERS;\n }\n CopyMemory(exceptionRecord.ExceptionInformation, lpArguments,\n nNumberOfArguments * sizeof(ULONG_PTR));\n }\n RtlpRaiseException(&exceptionRecord);\n\n LOGEXIT(\"RaiseException returns\\n\");\n}\nRemove duplicate check for number of exception arguments\/\/\n\/\/ Copyright (c) Microsoft. All rights reserved.\n\/\/ Copyright (c) Geoff Norton. All rights reserved.\n\/\/ Licensed under the MIT license. See LICENSE file in the project root for full license information.\n\/\/\n\n\/*++\n\n\n\nModule Name:\n\n seh-unwind.cpp\n\nAbstract:\n\n Implementation of exception API functions based on\n the Unwind API.\n\n\n\n--*\/\n\n#ifndef FEATURE_PAL_SXS\n#error FEATURE_PAL_SXS needs to be defined for this file.\n#endif \/\/ !FEATURE_PAL_SXS\n\n#include \"pal\/context.h\"\n#include \n#include \n#define UNW_LOCAL_ONLY\n#include \n\n\/\/----------------------------------------------------------------------\n\/\/ Virtual Unwinding\n\/\/----------------------------------------------------------------------\n\n#if UNWIND_CONTEXT_IS_UCONTEXT_T\nstatic void WinContextToUnwindContext(CONTEXT *winContext, unw_context_t *unwContext)\n{\n#if defined(_AMD64_)\n unwContext->uc_mcontext.gregs[REG_RIP] = winContext->Rip;\n unwContext->uc_mcontext.gregs[REG_RSP] = winContext->Rsp;\n unwContext->uc_mcontext.gregs[REG_RBP] = winContext->Rbp;\n unwContext->uc_mcontext.gregs[REG_RBX] = winContext->Rbx;\n unwContext->uc_mcontext.gregs[REG_R12] = winContext->R12;\n unwContext->uc_mcontext.gregs[REG_R13] = winContext->R13;\n unwContext->uc_mcontext.gregs[REG_R14] = winContext->R14;\n unwContext->uc_mcontext.gregs[REG_R15] = winContext->R15;\n#else\n#error unsupported architecture\n#endif\n}\n#else\nstatic void WinContextToUnwindCursor(CONTEXT *winContext, unw_cursor_t *cursor)\n{\n#if defined(_AMD64_)\n unw_set_reg(cursor, UNW_REG_IP, winContext->Rip);\n unw_set_reg(cursor, UNW_REG_SP, winContext->Rsp);\n unw_set_reg(cursor, UNW_X86_64_RBP, winContext->Rbp);\n unw_set_reg(cursor, UNW_X86_64_RBX, winContext->Rbx);\n unw_set_reg(cursor, UNW_X86_64_R12, winContext->R12);\n unw_set_reg(cursor, UNW_X86_64_R13, winContext->R13);\n unw_set_reg(cursor, UNW_X86_64_R14, winContext->R14);\n unw_set_reg(cursor, UNW_X86_64_R15, winContext->R15);\n#else\n#error unsupported architecture\n#endif\n}\n#endif\n\nstatic void UnwindContextToWinContext(unw_cursor_t *cursor, CONTEXT *winContext)\n{\n#if defined(_AMD64_)\n unw_get_reg(cursor, UNW_REG_IP, (unw_word_t *) &winContext->Rip);\n unw_get_reg(cursor, UNW_REG_SP, (unw_word_t *) &winContext->Rsp);\n unw_get_reg(cursor, UNW_X86_64_RBP, (unw_word_t *) &winContext->Rbp);\n unw_get_reg(cursor, UNW_X86_64_RBX, (unw_word_t *) &winContext->Rbx);\n unw_get_reg(cursor, UNW_X86_64_R12, (unw_word_t *) &winContext->R12);\n unw_get_reg(cursor, UNW_X86_64_R13, (unw_word_t *) &winContext->R13);\n unw_get_reg(cursor, UNW_X86_64_R14, (unw_word_t *) &winContext->R14);\n unw_get_reg(cursor, UNW_X86_64_R15, (unw_word_t *) &winContext->R15);\n#else\n#error unsupported architecture\n#endif\n}\n\nstatic void GetContextPointer(unw_cursor_t *cursor, int reg, PDWORD64 *contextPointer)\n{\n#if defined(__APPLE__)\n \/\/OSXTODO\n#else\n unw_save_loc_t saveLoc;\n unw_get_save_loc(cursor, reg, &saveLoc);\n if (saveLoc.type == UNW_SLT_MEMORY)\n {\n *contextPointer = (PDWORD64)saveLoc.u.addr;\n }\n#endif\n}\n\nstatic void GetContextPointers(unw_cursor_t *cursor, KNONVOLATILE_CONTEXT_POINTERS *contextPointers)\n{\n#if defined(_AMD64_)\n GetContextPointer(cursor, UNW_X86_64_RBP, &contextPointers->Rbp);\n GetContextPointer(cursor, UNW_X86_64_RBX, &contextPointers->Rbx);\n GetContextPointer(cursor, UNW_X86_64_R12, &contextPointers->R12);\n GetContextPointer(cursor, UNW_X86_64_R13, &contextPointers->R13);\n GetContextPointer(cursor, UNW_X86_64_R14, &contextPointers->R14);\n GetContextPointer(cursor, UNW_X86_64_R15, &contextPointers->R15);\n#else\n#error unsupported architecture\n#endif\n}\n\nBOOL PAL_VirtualUnwind(CONTEXT *context, KNONVOLATILE_CONTEXT_POINTERS *contextPointers)\n{\n int st;\n unw_context_t unwContext;\n unw_cursor_t cursor;\n\n#if UNWIND_CONTEXT_IS_UCONTEXT_T\n WinContextToUnwindContext(context, &unwContext);\n#else\n st = unw_getcontext(&unwContext);\n if (st < 0)\n {\n return FALSE;\n }\n#endif\n\n st = unw_init_local(&cursor, &unwContext);\n if (st < 0)\n {\n return FALSE;\n }\n\n#if !UNWIND_CONTEXT_IS_UCONTEXT_T\n \/\/ Set the unwind context to the specified windows context\n WinContextToUnwindCursor(context, &cursor);\n#endif\n\n st = unw_step(&cursor);\n if (st < 0)\n {\n return FALSE;\n }\n\n \/\/ Update the passed in windows context to reflect the unwind\n UnwindContextToWinContext(&cursor, context);\n\n if (contextPointers != NULL)\n {\n GetContextPointers(&cursor, contextPointers);\n }\n\n return TRUE;\n}\n\nPAL_NORETURN\nstatic void RtlpRaiseException(EXCEPTION_RECORD *ExceptionRecord)\n{\n \/\/ Capture the context of RtlpRaiseException.\n CONTEXT ContextRecord;\n ZeroMemory(&ContextRecord, sizeof(CONTEXT));\n ContextRecord.ContextFlags = CONTEXT_FULL;\n CONTEXT_CaptureContext(&ContextRecord);\n\n \/\/ Find the caller of RtlpRaiseException. \n PAL_VirtualUnwind(&ContextRecord, NULL);\n\n \/\/ The frame we're looking at now is RaiseException. We have to unwind one \n \/\/ level further to get the actual context user code could be resumed at.\n PAL_VirtualUnwind(&ContextRecord, NULL);\n#if defined(_X86_)\n ExceptionRecord->ExceptionAddress = (void *) ContextRecord.Eip;\n#elif defined(_AMD64_)\n ExceptionRecord->ExceptionAddress = (void *) ContextRecord.Rip;\n#else\n#error unsupported architecture\n#endif\n\n EXCEPTION_POINTERS pointers;\n pointers.ExceptionRecord = ExceptionRecord;\n pointers.ContextRecord = &ContextRecord;\n\n SEHRaiseException(InternalGetCurrentThread(), &pointers, 0);\n}\n\nPAL_NORETURN\nvoid SEHRaiseException(CPalThread *pthrCurrent,\n PEXCEPTION_POINTERS lpExceptionPointers,\n int signal_code)\n{\n throw PAL_SEHException(lpExceptionPointers->ExceptionRecord, lpExceptionPointers->ContextRecord);\n}\n\n\/*++\nFunction:\n RaiseException\n\nSee MSDN doc.\n--*\/\n\/\/ no PAL_NORETURN, as callers must assume this can return for continuable exceptions.\nVOID\nPALAPI\nRaiseException(IN DWORD dwExceptionCode,\n IN DWORD dwExceptionFlags,\n IN DWORD nNumberOfArguments,\n IN CONST ULONG_PTR *lpArguments)\n{\n \/\/ PERF_ENTRY_ONLY is used here because RaiseException may or may not\n \/\/ return. We can not get latency data without PERF_EXIT. For this reason,\n \/\/ PERF_ENTRY_ONLY is used to profile frequency only.\n PERF_ENTRY_ONLY(RaiseException);\n ENTRY(\"RaiseException(dwCode=%#x, dwFlags=%#x, nArgs=%u, lpArguments=%p)\\n\",\n dwExceptionCode, dwExceptionFlags, nNumberOfArguments, lpArguments);\n\n \/* Validate parameters *\/\n if (dwExceptionCode & RESERVED_SEH_BIT)\n {\n WARN(\"Exception code %08x has bit 28 set; clearing it.\\n\", dwExceptionCode);\n dwExceptionCode ^= RESERVED_SEH_BIT;\n }\n\n if (nNumberOfArguments > EXCEPTION_MAXIMUM_PARAMETERS)\n {\n WARN(\"Number of arguments (%d) exceeds the limit \"\n \"EXCEPTION_MAXIMUM_PARAMETERS (%d); ignoring extra parameters.\\n\",\n nNumberOfArguments, EXCEPTION_MAXIMUM_PARAMETERS);\n nNumberOfArguments = EXCEPTION_MAXIMUM_PARAMETERS;\n }\n\n EXCEPTION_RECORD exceptionRecord;\n ZeroMemory(&exceptionRecord, sizeof(EXCEPTION_RECORD));\n\n exceptionRecord.ExceptionCode = dwExceptionCode;\n exceptionRecord.ExceptionFlags = dwExceptionFlags;\n exceptionRecord.ExceptionRecord = NULL;\n exceptionRecord.ExceptionAddress = NULL; \/\/ will be set by RtlpRaiseException\n exceptionRecord.NumberParameters = nNumberOfArguments;\n if (nNumberOfArguments)\n {\n CopyMemory(exceptionRecord.ExceptionInformation, lpArguments,\n nNumberOfArguments * sizeof(ULONG_PTR));\n }\n RtlpRaiseException(&exceptionRecord);\n\n LOGEXIT(\"RaiseException returns\\n\");\n}\n<|endoftext|>"} {"text":"#include \n\n#include \n\n#include \n#include \n\n#include \n#include \n#include \n\n#include \n\n#include \"datatypes\/state.h\"\n#include \"datatypes\/context.h\"\n\nnamespace {\n\ndependency_graph::InAttr a_src;\ndependency_graph::InAttr a_context;\ndependency_graph::OutAttr a_out;\n\nclass Popup : public QMenu {\n\tpublic:\n\t\tPopup(QWidget* parent) : QMenu(parent) {\n\t\t}\n\n\t\tvoid addItem(const std::string& name) {\n\t\t\taddAction(name.c_str());\n\t\t}\n\n\tprivate:\n};\n\n\nclass Editor : public possumwood::SourceEditor {\n\tpublic:\n\t\tEditor() : SourceEditor(a_src), m_popup(nullptr) {\n\t\t\tm_varsButton = new QPushButton(\"Variables\");\n\t\t\tbuttonsLayout()->insertWidget(0, m_varsButton);\n\n\t\t\twidget()->connect(m_varsButton, &QPushButton::pressed, [this]() {\n\t\t\t\tif(m_popup)\n\t\t\t\t\tm_popup->popup(\n\t\t\t\t\t\tm_varsButton->mapToGlobal(QPoint(0,-m_popup->sizeHint().height()))\n\t\t\t\t\t);\n\t\t\t});\n\t\t}\n\n\tprotected:\n\t\tvirtual void valueChanged(const dependency_graph::Attr& attr) override {\n\t\t\tif(attr == a_context) {\n\t\t\t\tif(m_popup)\n\t\t\t\t\tm_popup->deleteLater();\n\n\t\t\t\tpopulateVariableList();\n\t\t\t}\n\n\t\t\telse\n\t\t\t\tSourceEditor::valueChanged(attr);\n\t\t}\n\n\t\tvoid populateVariableList() {\n\t\t\tif(m_popup)\n\t\t\t\tm_popup->deleteLater();\n\n\t\t\tm_popup = new Popup(m_varsButton);\n\n\t\t\tm_popup->connect(m_popup, &Popup::triggered, [this](QAction* action) {\n\t\t\t\tQString text = action->text();\n\t\t\t\twhile(!text.isEmpty() && !QChar(text[0]).isLetterOrNumber())\n\t\t\t\t\ttext = text.mid(1, text.length()-1);\n\t\t\t\tif(text.indexOf('\\t') >= 0)\n\t\t\t\t\ttext = text.mid(0, text.indexOf('\\t'));\n\n\t\t\t\teditorWidget()->insertPlainText(text);\n\t\t\t});\n\n\t\t\t\/\/ variables\n\t\t\tunsigned ctr = 0;\n\t\t\tfor(auto& s : values().get(a_context).variables()) {\n\t\t\t\tm_popup->addItem(s.name() + \"\\t\" + s.str());\n\t\t\t\t++ctr;\n\t\t\t}\n\t\t}\n\n\tprivate:\n\t\tQPushButton* m_varsButton;\n\n\t\tPopup* m_popup;\n};\n\ndependency_graph::State compute(dependency_graph::Values& data) {\n\tdependency_graph::State result;\n\n\tconst std::string& src = data.get(a_src);\n\n\t\/\/ Create a new lua state\n\tpossumwood::lua::State state(data.get(a_context));\n\n\t\/\/ Define a lua function that we can call\n\tluaL_dostring(state, src.c_str());\n\n\tconst float out = luabind::call_function(state, \"main\");\n\tdata.set(a_out, out);\n\n\treturn result;\n}\n\nvoid init(possumwood::Metadata& meta) {\n\tmeta.addAttribute(a_src, \"source\", std::string(\"function main()\\n return 0\\nend\\n\"));\n\tmeta.addAttribute(a_context, \"context\");\n\tmeta.addAttribute(a_out, \"out\");\n\n\tmeta.addInfluence(a_src, a_out);\n\tmeta.addInfluence(a_context, a_out);\n\n\tmeta.setCompute(&compute);\n\tmeta.setEditor();\n}\n\npossumwood::NodeImplementation s_impl(\"lua\/script\", init);\n\n}\nAdded exception handling for Lua Script - now print outs detailed error message in the status bar#include \n\n#include \n\n#include \n#include \n\n#include \n#include \n#include \n\n#include \n\n#include \"datatypes\/state.h\"\n#include \"datatypes\/context.h\"\n\nnamespace {\n\ndependency_graph::InAttr a_src;\ndependency_graph::InAttr a_context;\ndependency_graph::OutAttr a_out;\n\nclass Popup : public QMenu {\n\tpublic:\n\t\tPopup(QWidget* parent) : QMenu(parent) {\n\t\t}\n\n\t\tvoid addItem(const std::string& name) {\n\t\t\taddAction(name.c_str());\n\t\t}\n\n\tprivate:\n};\n\n\nclass Editor : public possumwood::SourceEditor {\n\tpublic:\n\t\tEditor() : SourceEditor(a_src), m_popup(nullptr) {\n\t\t\tm_varsButton = new QPushButton(\"Variables\");\n\t\t\tbuttonsLayout()->insertWidget(0, m_varsButton);\n\n\t\t\twidget()->connect(m_varsButton, &QPushButton::pressed, [this]() {\n\t\t\t\tif(m_popup)\n\t\t\t\t\tm_popup->popup(\n\t\t\t\t\t\tm_varsButton->mapToGlobal(QPoint(0,-m_popup->sizeHint().height()))\n\t\t\t\t\t);\n\t\t\t});\n\t\t}\n\n\tprotected:\n\t\tvirtual void valueChanged(const dependency_graph::Attr& attr) override {\n\t\t\tif(attr == a_context) {\n\t\t\t\tif(m_popup)\n\t\t\t\t\tm_popup->deleteLater();\n\n\t\t\t\tpopulateVariableList();\n\t\t\t}\n\n\t\t\telse\n\t\t\t\tSourceEditor::valueChanged(attr);\n\t\t}\n\n\t\tvoid populateVariableList() {\n\t\t\tif(m_popup)\n\t\t\t\tm_popup->deleteLater();\n\n\t\t\tm_popup = new Popup(m_varsButton);\n\n\t\t\tm_popup->connect(m_popup, &Popup::triggered, [this](QAction* action) {\n\t\t\t\tQString text = action->text();\n\t\t\t\twhile(!text.isEmpty() && !QChar(text[0]).isLetterOrNumber())\n\t\t\t\t\ttext = text.mid(1, text.length()-1);\n\t\t\t\tif(text.indexOf('\\t') >= 0)\n\t\t\t\t\ttext = text.mid(0, text.indexOf('\\t'));\n\n\t\t\t\teditorWidget()->insertPlainText(text);\n\t\t\t});\n\n\t\t\t\/\/ variables\n\t\t\tunsigned ctr = 0;\n\t\t\tfor(auto& s : values().get(a_context).variables()) {\n\t\t\t\tm_popup->addItem(s.name() + \"\\t\" + s.str());\n\t\t\t\t++ctr;\n\t\t\t}\n\t\t}\n\n\tprivate:\n\t\tQPushButton* m_varsButton;\n\n\t\tPopup* m_popup;\n};\n\ndependency_graph::State compute(dependency_graph::Values& data) {\n\tdependency_graph::State result;\n\n\tconst std::string& src = data.get(a_src);\n\n\t\/\/ Create a new lua state\n\tpossumwood::lua::State state(data.get(a_context));\n\n\t\/\/ Define a lua function that we can call\n\tluaL_dostring(state, src.c_str());\n\n\ttry {\n\t\tconst float out = luabind::call_function(state, \"main\");\n\t\tdata.set(a_out, out);\n\t}\n\tcatch(const luabind::error& err) {\n\t\tthrow std::runtime_error(lua_tostring(err.state(), -1));\n\t}\n\n\treturn result;\n}\n\nvoid init(possumwood::Metadata& meta) {\n\tmeta.addAttribute(a_src, \"source\", std::string(\"function main()\\n return 0\\nend\\n\"));\n\tmeta.addAttribute(a_context, \"context\");\n\tmeta.addAttribute(a_out, \"out\");\n\n\tmeta.addInfluence(a_src, a_out);\n\tmeta.addInfluence(a_context, a_out);\n\n\tmeta.setCompute(&compute);\n\tmeta.setEditor();\n}\n\npossumwood::NodeImplementation s_impl(\"lua\/script\", init);\n\n}\n<|endoftext|>"} {"text":"\/**************************************************************************\n**\n** Copyright (C) 2012 - 2014 BlackBerry Limited. All rights reserved.\n**\n** Contact: BlackBerry (qt@blackberry.com)\n** Contact: KDAB (info@kdab.com)\n**\n** This file is part of Qt Creator.\n**\n** Commercial License Usage\n** Licensees holding valid commercial Qt licenses may use this file in\n** accordance with the commercial license agreement provided with the\n** Software or, alternatively, in accordance with the terms contained in\n** a written agreement between you and 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 \"qnxqtversion.h\"\n\n#include \"qnxbaseqtconfigwidget.h\"\n#include \"qnxconstants.h\"\n#include \"qnxutils.h\"\n\n#include \n#include \n#include \n#include \n\n#include \n\nnamespace Qnx {\nnamespace Internal {\n\nstatic char SDK_PATH_KEY[] = \"SDKPath\";\nstatic char ARCH_KEY[] = \"Arch\";\n\nQnxQtVersion::QnxQtVersion() : m_arch(UnknownArch)\n{ }\n\nQnxQtVersion::QnxQtVersion(QnxArchitecture arch, const Utils::FileName &path, bool isAutoDetected,\n const QString &autoDetectionSource) :\n QtSupport::BaseQtVersion(path, isAutoDetected, autoDetectionSource),\n m_arch(arch)\n{\n setUnexpandedDisplayName(defaultUnexpandedDisplayName(path, false));\n}\n\nQnxQtVersion *QnxQtVersion::clone() const\n{\n return new QnxQtVersion(*this);\n}\n\nQString QnxQtVersion::type() const\n{\n return QLatin1String(Constants::QNX_QNX_QT);\n}\n\nQString QnxQtVersion::description() const\n{\n \/\/: Qt Version is meant for QNX\n return QCoreApplication::translate(\"Qnx::Internal::QnxQtVersion\", \"QNX %1\").arg(archString());\n}\n\nCore::FeatureSet QnxQtVersion::availableFeatures() const\n{\n Core::FeatureSet features = QtSupport::BaseQtVersion::availableFeatures();\n features |= Core::FeatureSet(Constants::QNX_QNX_FEATURE);\n features.remove(Core::Feature(QtSupport::Constants::FEATURE_QT_CONSOLE));\n features.remove(Core::Feature(QtSupport::Constants::FEATURE_QT_WEBKIT));\n return features;\n}\n\nQString QnxQtVersion::platformName() const\n{\n return QString::fromLatin1(Constants::QNX_QNX_PLATFORM_NAME);\n}\n\nQString QnxQtVersion::platformDisplayName() const\n{\n return QCoreApplication::translate(\"Qnx::Internal::QnxQtVersion\", \"QNX\");\n}\n\nQString QnxQtVersion::qnxHost() const\n{\n if (!m_environmentUpToDate)\n updateEnvironment();\n\n foreach (const Utils::EnvironmentItem &item, m_qnxEnv) {\n if (item.name == QLatin1String(Constants::QNX_HOST_KEY))\n return item.value;\n }\n\n return QString();\n}\n\nQString QnxQtVersion::qnxTarget() const\n{\n if (!m_environmentUpToDate)\n updateEnvironment();\n\n foreach (const Utils::EnvironmentItem &item, m_qnxEnv) {\n if (item.name == QLatin1String(Constants::QNX_TARGET_KEY))\n return item.value;\n }\n\n return QString();\n}\n\nQnxArchitecture QnxQtVersion::architecture() const\n{\n return m_arch;\n}\n\nQString QnxQtVersion::archString() const\n{\n switch (m_arch) {\n case X86:\n return QLatin1String(\"x86\");\n case ArmLeV7:\n return QLatin1String(\"ARMle-v7\");\n case UnknownArch:\n return QString();\n }\n return QString();\n}\n\nQVariantMap QnxQtVersion::toMap() const\n{\n QVariantMap result = BaseQtVersion::toMap();\n result.insert(QLatin1String(SDK_PATH_KEY), sdkPath());\n result.insert(QLatin1String(ARCH_KEY), m_arch);\n return result;\n}\n\nvoid QnxQtVersion::fromMap(const QVariantMap &map)\n{\n BaseQtVersion::fromMap(map);\n setSdkPath(QDir::fromNativeSeparators(map.value(QLatin1String(SDK_PATH_KEY)).toString()));\n m_arch = static_cast(map.value(QLatin1String(ARCH_KEY), UnknownArch).toInt());\n}\n\nQList QnxQtVersion::detectQtAbis() const\n{\n ensureMkSpecParsed();\n return qtAbisFromLibrary(qtCorePaths(versionInfo(), qtVersionString()));\n}\n\nvoid QnxQtVersion::addToEnvironment(const ProjectExplorer::Kit *k, Utils::Environment &env) const\n{\n QtSupport::BaseQtVersion::addToEnvironment(k, env);\n updateEnvironment();\n env.modify(m_qnxEnv);\n\n env.prependOrSetLibrarySearchPath(versionInfo().value(QLatin1String(\"QT_INSTALL_LIBS\")));\n}\n\nUtils::Environment QnxQtVersion::qmakeRunEnvironment() const\n{\n if (!sdkPath().isEmpty())\n updateEnvironment();\n\n Utils::Environment env = Utils::Environment::systemEnvironment();\n env.modify(m_qnxEnv);\n\n return env;\n}\n\nQtSupport::QtConfigWidget *QnxQtVersion::createConfigurationWidget() const\n{\n return new QnxBaseQtConfigWidget(const_cast(this));\n}\n\nbool QnxQtVersion::isValid() const\n{\n return QtSupport::BaseQtVersion::isValid() && !sdkPath().isEmpty();\n}\n\nQString QnxQtVersion::invalidReason() const\n{\n if (sdkPath().isEmpty())\n return QCoreApplication::translate(\"Qnx::Internal::QnxQtVersion\", \"No SDK path was set up\");\n return QtSupport::BaseQtVersion::invalidReason();\n}\n\nQString QnxQtVersion::sdkPath() const\n{\n return m_sdkPath;\n}\n\nvoid QnxQtVersion::setSdkPath(const QString &sdkPath)\n{\n if (m_sdkPath == sdkPath)\n return;\n\n m_sdkPath = sdkPath;\n m_environmentUpToDate = false;\n}\n\nvoid QnxQtVersion::updateEnvironment() const\n{\n if (!m_environmentUpToDate) {\n m_qnxEnv = environment();\n m_environmentUpToDate = true;\n }\n}\n\nQList QnxQtVersion::environment() const\n{\n return QnxUtils::qnxEnvironment(sdkPath());\n}\n\n} \/\/ namespace Internal\n} \/\/ namespace Qnx\nQNX: fix message punctuation\/**************************************************************************\n**\n** Copyright (C) 2012 - 2014 BlackBerry Limited. All rights reserved.\n**\n** Contact: BlackBerry (qt@blackberry.com)\n** Contact: KDAB (info@kdab.com)\n**\n** This file is part of Qt Creator.\n**\n** Commercial License Usage\n** Licensees holding valid commercial Qt licenses may use this file in\n** accordance with the commercial license agreement provided with the\n** Software or, alternatively, in accordance with the terms contained in\n** a written agreement between you and 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 \"qnxqtversion.h\"\n\n#include \"qnxbaseqtconfigwidget.h\"\n#include \"qnxconstants.h\"\n#include \"qnxutils.h\"\n\n#include \n#include \n#include \n#include \n\n#include \n\nnamespace Qnx {\nnamespace Internal {\n\nstatic char SDK_PATH_KEY[] = \"SDKPath\";\nstatic char ARCH_KEY[] = \"Arch\";\n\nQnxQtVersion::QnxQtVersion() : m_arch(UnknownArch)\n{ }\n\nQnxQtVersion::QnxQtVersion(QnxArchitecture arch, const Utils::FileName &path, bool isAutoDetected,\n const QString &autoDetectionSource) :\n QtSupport::BaseQtVersion(path, isAutoDetected, autoDetectionSource),\n m_arch(arch)\n{\n setUnexpandedDisplayName(defaultUnexpandedDisplayName(path, false));\n}\n\nQnxQtVersion *QnxQtVersion::clone() const\n{\n return new QnxQtVersion(*this);\n}\n\nQString QnxQtVersion::type() const\n{\n return QLatin1String(Constants::QNX_QNX_QT);\n}\n\nQString QnxQtVersion::description() const\n{\n \/\/: Qt Version is meant for QNX\n return QCoreApplication::translate(\"Qnx::Internal::QnxQtVersion\", \"QNX %1\").arg(archString());\n}\n\nCore::FeatureSet QnxQtVersion::availableFeatures() const\n{\n Core::FeatureSet features = QtSupport::BaseQtVersion::availableFeatures();\n features |= Core::FeatureSet(Constants::QNX_QNX_FEATURE);\n features.remove(Core::Feature(QtSupport::Constants::FEATURE_QT_CONSOLE));\n features.remove(Core::Feature(QtSupport::Constants::FEATURE_QT_WEBKIT));\n return features;\n}\n\nQString QnxQtVersion::platformName() const\n{\n return QString::fromLatin1(Constants::QNX_QNX_PLATFORM_NAME);\n}\n\nQString QnxQtVersion::platformDisplayName() const\n{\n return QCoreApplication::translate(\"Qnx::Internal::QnxQtVersion\", \"QNX\");\n}\n\nQString QnxQtVersion::qnxHost() const\n{\n if (!m_environmentUpToDate)\n updateEnvironment();\n\n foreach (const Utils::EnvironmentItem &item, m_qnxEnv) {\n if (item.name == QLatin1String(Constants::QNX_HOST_KEY))\n return item.value;\n }\n\n return QString();\n}\n\nQString QnxQtVersion::qnxTarget() const\n{\n if (!m_environmentUpToDate)\n updateEnvironment();\n\n foreach (const Utils::EnvironmentItem &item, m_qnxEnv) {\n if (item.name == QLatin1String(Constants::QNX_TARGET_KEY))\n return item.value;\n }\n\n return QString();\n}\n\nQnxArchitecture QnxQtVersion::architecture() const\n{\n return m_arch;\n}\n\nQString QnxQtVersion::archString() const\n{\n switch (m_arch) {\n case X86:\n return QLatin1String(\"x86\");\n case ArmLeV7:\n return QLatin1String(\"ARMle-v7\");\n case UnknownArch:\n return QString();\n }\n return QString();\n}\n\nQVariantMap QnxQtVersion::toMap() const\n{\n QVariantMap result = BaseQtVersion::toMap();\n result.insert(QLatin1String(SDK_PATH_KEY), sdkPath());\n result.insert(QLatin1String(ARCH_KEY), m_arch);\n return result;\n}\n\nvoid QnxQtVersion::fromMap(const QVariantMap &map)\n{\n BaseQtVersion::fromMap(map);\n setSdkPath(QDir::fromNativeSeparators(map.value(QLatin1String(SDK_PATH_KEY)).toString()));\n m_arch = static_cast(map.value(QLatin1String(ARCH_KEY), UnknownArch).toInt());\n}\n\nQList QnxQtVersion::detectQtAbis() const\n{\n ensureMkSpecParsed();\n return qtAbisFromLibrary(qtCorePaths(versionInfo(), qtVersionString()));\n}\n\nvoid QnxQtVersion::addToEnvironment(const ProjectExplorer::Kit *k, Utils::Environment &env) const\n{\n QtSupport::BaseQtVersion::addToEnvironment(k, env);\n updateEnvironment();\n env.modify(m_qnxEnv);\n\n env.prependOrSetLibrarySearchPath(versionInfo().value(QLatin1String(\"QT_INSTALL_LIBS\")));\n}\n\nUtils::Environment QnxQtVersion::qmakeRunEnvironment() const\n{\n if (!sdkPath().isEmpty())\n updateEnvironment();\n\n Utils::Environment env = Utils::Environment::systemEnvironment();\n env.modify(m_qnxEnv);\n\n return env;\n}\n\nQtSupport::QtConfigWidget *QnxQtVersion::createConfigurationWidget() const\n{\n return new QnxBaseQtConfigWidget(const_cast(this));\n}\n\nbool QnxQtVersion::isValid() const\n{\n return QtSupport::BaseQtVersion::isValid() && !sdkPath().isEmpty();\n}\n\nQString QnxQtVersion::invalidReason() const\n{\n if (sdkPath().isEmpty())\n return QCoreApplication::translate(\"Qnx::Internal::QnxQtVersion\", \"No SDK path was set up.\");\n return QtSupport::BaseQtVersion::invalidReason();\n}\n\nQString QnxQtVersion::sdkPath() const\n{\n return m_sdkPath;\n}\n\nvoid QnxQtVersion::setSdkPath(const QString &sdkPath)\n{\n if (m_sdkPath == sdkPath)\n return;\n\n m_sdkPath = sdkPath;\n m_environmentUpToDate = false;\n}\n\nvoid QnxQtVersion::updateEnvironment() const\n{\n if (!m_environmentUpToDate) {\n m_qnxEnv = environment();\n m_environmentUpToDate = true;\n }\n}\n\nQList QnxQtVersion::environment() const\n{\n return QnxUtils::qnxEnvironment(sdkPath());\n}\n\n} \/\/ namespace Internal\n} \/\/ namespace Qnx\n<|endoftext|>"} {"text":"#ifdef _WIN32\n\n#include \n#include \n#include \n#include \n#include \n\nstruct DbgEngPlugin : public DebugBaseEventCallbacks\n{\n\tPDDebugState state = PDDebugState_noTarget;\n\tbool hasValidTarget = false;\n\n\tstd::string targetName;\n\n\tIDebugClient* debugClient = nullptr;\n\tIDebugControl* debugControl = nullptr;\n\n\t\/\/ IUnknown\n\tSTDMETHOD_(ULONG, AddRef)(THIS);\n\tSTDMETHOD_(ULONG, Release)(THIS);\n\n\t\/\/ IDebugEventCallbacks\n\tSTDMETHOD(GetInterestMask)(THIS_\n\t\tOUT PULONG Mask);\n\tSTDMETHOD(Breakpoint)(THIS_\n\t\tIN PDEBUG_BREAKPOINT Bp);\n\tSTDMETHOD(Exception)(THIS_\n\t\tIN PEXCEPTION_RECORD64 Exception, IN ULONG FirstChance);\n\tSTDMETHOD(CreateProcess)(THIS_\n\t\tIN ULONG64 ImageFileHandle,\n\t\tIN ULONG64 Handle,\n\t\tIN ULONG64 BaseOffset,\n\t\tIN ULONG ModuleSize,\n\t\tIN PCSTR ModuleName,\n\t\tIN PCSTR ImageName,\n\t\tIN ULONG CheckSum,\n\t\tIN ULONG TimeDateStamp,\n\t\tIN ULONG64 InitialThreadHandle,\n\t\tIN ULONG64 ThreadDataOffset,\n\t\tIN ULONG64 StartOffset);\n\tSTDMETHOD(LoadModule)(THIS_\n\t\tIN ULONG64 ImageFileHandle,\n\t\tIN ULONG64 BaseOffset,\n\t\tIN ULONG ModuleSize,\n\t\tIN PCSTR ModuleName,\n\t\tIN PCSTR ImageName,\n\t\tIN ULONG CheckSum,\n\t\tIN ULONG TimeDateStamp);\n\tSTDMETHOD(SessionStatus)(THIS_\n\t\tIN ULONG Status);\n};\n\nSTDMETHODIMP_(ULONG) DbgEngPlugin::AddRef(THIS)\n{\n\treturn 1;\n}\n\nSTDMETHODIMP_(ULONG) DbgEngPlugin::Release(THIS)\n{\n\treturn 0;\n}\n\nSTDMETHODIMP DbgEngPlugin::GetInterestMask(THIS_\n\tOUT PULONG Mask)\n{\n\t*Mask =\n\t\tDEBUG_EVENT_BREAKPOINT |\n\t\tDEBUG_EVENT_EXCEPTION |\n\t\tDEBUG_EVENT_CREATE_PROCESS |\n\t\tDEBUG_EVENT_LOAD_MODULE |\n\t\tDEBUG_EVENT_SESSION_STATUS;\n\treturn S_OK;\n}\n\nSTDMETHODIMP DbgEngPlugin::Breakpoint(THIS_\n\tIN PDEBUG_BREAKPOINT Bp)\n{\n\tprintf(\"DbgEngPlugin: Breakpoint\\n\");\n\treturn S_OK;\n}\n\nSTDMETHODIMP DbgEngPlugin::Exception(THIS_\n\tIN PEXCEPTION_RECORD64 Exception,\n\tIN ULONG FirstChance)\n{\n\tprintf(\"DbgEngPlugin: Exception\\n\");\n\treturn S_OK;\n}\n\nSTDMETHODIMP DbgEngPlugin::CreateProcess(THIS_\n\tIN ULONG64 ImageFileHandle,\n\tIN ULONG64 Handle,\n\tIN ULONG64 BaseOffset,\n\tIN ULONG ModuleSize,\n\tIN PCSTR ModuleName,\n\tIN PCSTR ImageName,\n\tIN ULONG CheckSum,\n\tIN ULONG TimeDateStamp,\n\tIN ULONG64 InitialThreadHandle,\n\tIN ULONG64 ThreadDataOffset,\n\tIN ULONG64 StartOffset)\n{\n\tprintf(\"DbgEngPlugin: CreateProcess\\n\");\n\treturn S_OK;\n}\n\nSTDMETHODIMP DbgEngPlugin::LoadModule(THIS_\n\tIN ULONG64 ImageFileHandle,\n\tIN ULONG64 BaseOffset,\n\tIN ULONG ModuleSize,\n\tIN PCSTR ModuleName,\n\tIN PCSTR ImageName,\n\tIN ULONG CheckSum,\n\tIN ULONG TimeDateStamp)\n{\n\tprintf(\"DbgEngPlugin: LoadModule\\n\");\n\treturn S_OK;\n}\n\nSTDMETHODIMP DbgEngPlugin::SessionStatus(THIS_\n\tIN ULONG Status)\n{\n\tswitch (Status)\n\t{\n\t\tcase DEBUG_SESSION_ACTIVE:\n\t\t\tprintf(\"DbgEngPlugin: SessionStatus DEBUG_SESSION_ACTIVE\\n\");\n\t\t\tbreak;\n\t\tcase DEBUG_SESSION_END_SESSION_ACTIVE_TERMINATE:\n\t\t\tprintf(\"DbgEngPlugin: SessionStatus DEBUG_SESSION_END_SESSION_ACTIVE_TERMINATE\\n\");\n\t\t\tbreak;\n\t\tcase DEBUG_SESSION_END_SESSION_ACTIVE_DETACH:\n\t\t\tprintf(\"DbgEngPlugin: SessionStatus DEBUG_SESSION_END_SESSION_ACTIVE_DETACH\\n\");\n\t\t\tbreak;\n\t\tcase DEBUG_SESSION_END_SESSION_PASSIVE:\n\t\t\tprintf(\"DbgEngPlugin: SessionStatus DEBUG_SESSION_END_SESSION_PASSIVE\\n\");\n\t\t\tbreak;\n\t\tcase DEBUG_SESSION_END:\n\t\t\tprintf(\"DbgEngPlugin: SessionStatus DEBUG_SESSION_END\\n\");\n\t\t\tbreak;\n\t\tcase DEBUG_SESSION_REBOOT:\n\t\t\tprintf(\"DbgEngPlugin: SessionStatus DEBUG_SESSION_REBOOT\\n\");\n\t\t\tbreak;\n\t\tcase DEBUG_SESSION_HIBERNATE:\n\t\t\tprintf(\"DbgEngPlugin: SessionStatus DEBUG_SESSION_HIBERNATE\\n\");\n\t\t\tbreak;\n\t\tcase DEBUG_SESSION_FAILURE:\n\t\t\tprintf(\"DbgEngPlugin: SessionStatus DEBUG_SESSION_FAILURE\\n\");\n\t\t\tbreak;\n\t}\n\n\treturn S_OK;\n}\n\nstatic void updateDbgEngEvent(DbgEngPlugin* plugin, PDWriter* writer)\n{\n\tHRESULT hr = plugin->debugControl->WaitForEvent(DEBUG_WAIT_DEFAULT, 100);\n\n\tif (hr == S_FALSE)\n\t{\n\t\t\/\/ WaitForEvent timeout occurred\n\t\treturn;\n\t}\n\n\t\/\/ TODO: check and handle execution status\n}\n\nvoid onRun(DbgEngPlugin* plugin)\n{\n\tprintf(\"DbgEngPlugin: onRun\\n\");\n\n\tif (plugin->state == PDDebugState_noTarget)\n\t{\n\t\tassert(!plugin->targetName.empty());\n\n\t\tHRESULT hr = plugin->debugClient->CreateProcess(0, PSTR(plugin->targetName.c_str()), DEBUG_ONLY_THIS_PROCESS);\n\t\tassert(SUCCEEDED(hr));\n\n\t\tif (SUCCEEDED(hr))\n\t\t{\n\t\t\tprintf(\"Error: could not create process '%s'\\n\", plugin->targetName.c_str());\n\t\t}\n\t\telse\n\t\t{\n\t\t\tprintf(\"Valid target %s\\n\", plugin->targetName.c_str());\n\t\t}\n\n\t\tplugin->state = PDDebugState_running;\n\t}\n}\n\nvoid onStop(DbgEngPlugin* plugin)\n{\n\tprintf(\"DbgEngPlugin: onStop\\n\");\n}\n\nstatic void onBreak(DbgEngPlugin* plugin)\n{\n\tprintf(\"DbgEngPlugin: onBreak\\n\");\n}\n\nstatic void onStep(DbgEngPlugin* plugin)\n{\n\tprintf(\"DbgEngPlugin: onStep\\n\");\n}\n\nstatic void onStepOver(DbgEngPlugin* plugin)\n{\n\tprintf(\"DbgEngPlugin: onStepOver\\n\");\n}\n\nstatic void onStepOut(DbgEngPlugin* plugin)\n{\n\tprintf(\"DbgEngPlugin: onStepOut\\n\");\n}\n\nstatic void doAction(DbgEngPlugin* plugin, PDAction action)\n{\n\tprintf(\"DbgEngPlugin: doAction\\n\");\n\n\tswitch (action)\n\t{\n\tcase PDAction_stop: onStop(plugin); break;\n\tcase PDAction_break: onBreak(plugin); break;\n\tcase PDAction_run: onRun(plugin); break;\n\tcase PDAction_step: onStep(plugin); break;\n\tcase PDAction_stepOut: onStepOut(plugin); break;\n\tcase PDAction_stepOver: onStepOver(plugin); break;\n\t}\n}\n\nstatic void setExceptionLocation(DbgEngPlugin* plugin, PDWriter* writer)\n{\n\tprintf(\"DbgEngPlugin: setExceptionLocation\\n\");\n}\n\nstatic void setCallstack(DbgEngPlugin* plugin, PDWriter* writer)\n{\n\tprintf(\"DbgEngPlugin: setCallstack\\n\");\n}\n\nstatic void setExecutable(DbgEngPlugin* plugin, PDReader* reader)\n{\n\tprintf(\"DbgEngPlugin: setExecutable\\n\");\n\n\tconst char* filename = 0;\n\n\tPDRead_findString(reader, &filename, \"filename\", 0);\n\n\tif (!filename)\n\t{\n\t\tprintf(\"Unable to find filename which is required when starting a LLDB debug session\\n\");\n\t\treturn;\n\t}\n\n\tprintf(\"found filename \\\"%s\\\"\\n\", filename);\n\n\tplugin->targetName = filename;\n}\n\nstatic void setLocals(DbgEngPlugin* plugin, PDWriter* writer)\n{\n\tprintf(\"DbgEngPlugin: setLocals\\n\");\n}\n\nstatic void setBreakpoint(DbgEngPlugin* plugin, PDReader* reader, PDWriter* writer)\n{\n\tprintf(\"DbgEngPlugin: setBreakpoint\\n\");\n}\n\nstatic void eventAction(DbgEngPlugin* plugin, PDReader* reader)\n{\n\tprintf(\"DbgEngPlugin: eventAction\\n\");\n\n\tuint32_t action = 0;\n\n\tprintf(\"DbgEngPlugin; %d\\n\", (PDRead_findU32(reader, &action, \"action\", 0) & 0xff) >> 8);\n\tprintf(\"DbgEngPlugin: got action (from event) %d\\n\", action);\n\n\tdoAction(plugin, (PDAction)action);\n}\n\nstatic const char* eventTypes[] =\n{\n\t\"PDEventType_none\",\n\t\"PDEventType_getLocals\",\n\t\"PDEventType_setLocals\",\n\t\"PDEventType_getCallstack\",\n\t\"PDEventType_setCallstack\",\n\t\"PDEventType_getWatch\",\n\t\"PDEventType_setWatch\",\n\t\"PDEventType_getRegisters\",\n\t\"PDEventType_setRegisters\",\n\t\"PDEventType_getMemory\",\n\t\"PDEventType_setMemory\",\n\t\"PDEventType_getTty\",\n\t\"PDEventType_setTty\",\n\t\"PDEventType_getExceptionLocation\",\n\t\"PDEventType_setExceptionLocation\",\n\t\"PDEventType_getDisassembly\",\n\t\"PDEventType_setDisassembly\",\n\t\"PDEventType_setBreakpoint\",\n\t\"PDEventType_getBreakpoint\",\n\t\"PDEventType_setExecutable\",\n\t\"PDEventType_attachToProcess\",\n\t\"PDEventType_attachToRemoteSession\",\n\t\"PDEventType_action\",\n};\n\nstatic void processEvents(DbgEngPlugin* plugin, PDReader* reader, PDWriter* writer)\n{\n\tprintf(\"DbgEngPlugin: processEvents\\n\");\n\n\tPDEventType event;\n\n\twhile ((event = (PDEventType)PDRead_getEvent(reader)))\n\t{\n\t\tprintf(\"DbgEngPlugin: %d Got event %s\\n\", (int)event, eventTypes[event]);\n\n\t\tswitch (event)\n\t\t{\n\t\tcase PDEventType_getExceptionLocation: setExceptionLocation(plugin, writer); break;\n\t\tcase PDEventType_getCallstack: setCallstack(plugin, writer); break;\n\t\tcase PDEventType_setExecutable: setExecutable(plugin, reader); break;\n\t\tcase PDEventType_getLocals: setLocals(plugin, writer); break;\n\t\tcase PDEventType_setBreakpoint: setBreakpoint(plugin, reader, writer); break;\n\t\tcase PDEventType_action: eventAction(plugin, reader); break;\n\t\t}\n\t}\n}\n\nvoid* createInstance(ServiceFunc* serviceFunc)\n{\n\tDbgEngPlugin* plugin = new DbgEngPlugin;\n\n\tHRESULT hr = DebugCreate(__uuidof(IDebugClient), (void**)&plugin->debugClient);\n\tassert(SUCCEEDED(hr));\n\n\thr = plugin->debugClient->SetEventCallbacks(plugin);\n\tassert(SUCCEEDED(hr));\n\n\thr = plugin->debugClient->QueryInterface(__uuidof(IDebugControl), (void**)&plugin->debugControl);\n\tassert(SUCCEEDED(hr));\n\n\treturn plugin;\n}\n\nvoid destroyInstance(void* userData)\n{\n\tDbgEngPlugin* plugin = reinterpret_cast(userData);\n\n\tif (plugin->debugControl)\n\t{\n\t\tplugin->debugControl->Release();\n\t\tplugin->debugControl = nullptr;\n\t}\n\n\tif (plugin->debugClient)\n\t{\n\t\tplugin->debugClient->Release();\n\t\tplugin->debugClient = nullptr;\n\t}\n\n\tdelete plugin;\n}\n\nstatic PDDebugState update(void* userData, PDAction action, PDReader* reader, PDWriter* writer)\n{\n\tDbgEngPlugin* plugin = reinterpret_cast(userData);\n\n\tprocessEvents(plugin, reader, writer);\n\n\tdoAction(plugin, action);\n\n\tif (plugin->state == PDDebugState_running)\n\t{\n\t\tupdateDbgEngEvent(plugin, writer);\n\t}\n\n\treturn plugin->state;\n}\n\nstatic PDBackendPlugin plugin =\n{\n\t\"Microsoft Debugger Engine\",\n\tcreateInstance,\n\tdestroyInstance,\n\tupdate,\n};\n\nextern \"C\" PD_EXPORT void InitPlugin(RegisterPlugin* registerPlugin, void* privateData)\n{\n\tregisterPlugin(PD_BACKEND_API_VERSION, &plugin, privateData);\n}\n\n#endif\nAdded basic stack tracing#ifdef _WIN32\n\n#include \n#include \n#include \n#include \n#include \n\nstruct DbgEngPlugin : public DebugBaseEventCallbacks\n{\n\tPDDebugState state = PDDebugState_noTarget;\n\tbool hasValidTarget = false;\n\n\tstd::string targetName;\n\n\tIDebugClient* debugClient = nullptr;\n\tIDebugControl* debugControl = nullptr;\n\n\t\/\/ IUnknown\n\tSTDMETHOD_(ULONG, AddRef)(THIS);\n\tSTDMETHOD_(ULONG, Release)(THIS);\n\n\t\/\/ IDebugEventCallbacks\n\tSTDMETHOD(GetInterestMask)(THIS_\n\t\tOUT PULONG Mask);\n\tSTDMETHOD(Breakpoint)(THIS_\n\t\tIN PDEBUG_BREAKPOINT Bp);\n\tSTDMETHOD(Exception)(THIS_\n\t\tIN PEXCEPTION_RECORD64 Exception, IN ULONG FirstChance);\n\tSTDMETHOD(CreateProcess)(THIS_\n\t\tIN ULONG64 ImageFileHandle,\n\t\tIN ULONG64 Handle,\n\t\tIN ULONG64 BaseOffset,\n\t\tIN ULONG ModuleSize,\n\t\tIN PCSTR ModuleName,\n\t\tIN PCSTR ImageName,\n\t\tIN ULONG CheckSum,\n\t\tIN ULONG TimeDateStamp,\n\t\tIN ULONG64 InitialThreadHandle,\n\t\tIN ULONG64 ThreadDataOffset,\n\t\tIN ULONG64 StartOffset);\n\tSTDMETHOD(LoadModule)(THIS_\n\t\tIN ULONG64 ImageFileHandle,\n\t\tIN ULONG64 BaseOffset,\n\t\tIN ULONG ModuleSize,\n\t\tIN PCSTR ModuleName,\n\t\tIN PCSTR ImageName,\n\t\tIN ULONG CheckSum,\n\t\tIN ULONG TimeDateStamp);\n\tSTDMETHOD(SessionStatus)(THIS_\n\t\tIN ULONG Status);\n};\n\nSTDMETHODIMP_(ULONG) DbgEngPlugin::AddRef(THIS)\n{\n\treturn 1;\n}\n\nSTDMETHODIMP_(ULONG) DbgEngPlugin::Release(THIS)\n{\n\treturn 0;\n}\n\nSTDMETHODIMP DbgEngPlugin::GetInterestMask(THIS_\n\tOUT PULONG Mask)\n{\n\t*Mask =\n\t\tDEBUG_EVENT_BREAKPOINT |\n\t\tDEBUG_EVENT_EXCEPTION |\n\t\tDEBUG_EVENT_CREATE_PROCESS |\n\t\tDEBUG_EVENT_LOAD_MODULE |\n\t\tDEBUG_EVENT_SESSION_STATUS;\n\treturn S_OK;\n}\n\nSTDMETHODIMP DbgEngPlugin::Breakpoint(THIS_\n\tIN PDEBUG_BREAKPOINT Bp)\n{\n\tprintf(\"DbgEngPlugin: Breakpoint\\n\");\n\treturn S_OK;\n}\n\nSTDMETHODIMP DbgEngPlugin::Exception(THIS_\n\tIN PEXCEPTION_RECORD64 Exception,\n\tIN ULONG FirstChance)\n{\n\tprintf(\"DbgEngPlugin: Exception\\n\");\n\tstate = PDDebugState_stopException;\n\treturn S_OK;\n}\n\nSTDMETHODIMP DbgEngPlugin::CreateProcess(THIS_\n\tIN ULONG64 ImageFileHandle,\n\tIN ULONG64 Handle,\n\tIN ULONG64 BaseOffset,\n\tIN ULONG ModuleSize,\n\tIN PCSTR ModuleName,\n\tIN PCSTR ImageName,\n\tIN ULONG CheckSum,\n\tIN ULONG TimeDateStamp,\n\tIN ULONG64 InitialThreadHandle,\n\tIN ULONG64 ThreadDataOffset,\n\tIN ULONG64 StartOffset)\n{\n\tprintf(\"DbgEngPlugin: CreateProcess\\n\");\n\treturn S_OK;\n}\n\nSTDMETHODIMP DbgEngPlugin::LoadModule(THIS_\n\tIN ULONG64 ImageFileHandle,\n\tIN ULONG64 BaseOffset,\n\tIN ULONG ModuleSize,\n\tIN PCSTR ModuleName,\n\tIN PCSTR ImageName,\n\tIN ULONG CheckSum,\n\tIN ULONG TimeDateStamp)\n{\n\tprintf(\"DbgEngPlugin: LoadModule\\n\");\n\treturn S_OK;\n}\n\nSTDMETHODIMP DbgEngPlugin::SessionStatus(THIS_\n\tIN ULONG Status)\n{\n\tswitch (Status)\n\t{\n\t\tcase DEBUG_SESSION_ACTIVE:\n\t\t\tprintf(\"DbgEngPlugin: SessionStatus DEBUG_SESSION_ACTIVE\\n\");\n\t\t\tbreak;\n\t\tcase DEBUG_SESSION_END_SESSION_ACTIVE_TERMINATE:\n\t\t\tprintf(\"DbgEngPlugin: SessionStatus DEBUG_SESSION_END_SESSION_ACTIVE_TERMINATE\\n\");\n\t\t\tbreak;\n\t\tcase DEBUG_SESSION_END_SESSION_ACTIVE_DETACH:\n\t\t\tprintf(\"DbgEngPlugin: SessionStatus DEBUG_SESSION_END_SESSION_ACTIVE_DETACH\\n\");\n\t\t\tbreak;\n\t\tcase DEBUG_SESSION_END_SESSION_PASSIVE:\n\t\t\tprintf(\"DbgEngPlugin: SessionStatus DEBUG_SESSION_END_SESSION_PASSIVE\\n\");\n\t\t\tbreak;\n\t\tcase DEBUG_SESSION_END:\n\t\t\tprintf(\"DbgEngPlugin: SessionStatus DEBUG_SESSION_END\\n\");\n\t\t\tbreak;\n\t\tcase DEBUG_SESSION_REBOOT:\n\t\t\tprintf(\"DbgEngPlugin: SessionStatus DEBUG_SESSION_REBOOT\\n\");\n\t\t\tbreak;\n\t\tcase DEBUG_SESSION_HIBERNATE:\n\t\t\tprintf(\"DbgEngPlugin: SessionStatus DEBUG_SESSION_HIBERNATE\\n\");\n\t\t\tbreak;\n\t\tcase DEBUG_SESSION_FAILURE:\n\t\t\tprintf(\"DbgEngPlugin: SessionStatus DEBUG_SESSION_FAILURE\\n\");\n\t\t\tbreak;\n\t}\n\n\treturn S_OK;\n}\n\nstatic void updateDbgEngEvent(DbgEngPlugin* plugin, PDWriter* writer)\n{\n\tHRESULT hr = plugin->debugControl->WaitForEvent(DEBUG_WAIT_DEFAULT, 100);\n\n\tif (hr == S_FALSE)\n\t{\n\t\t\/\/ WaitForEvent timeout occurred\n\t\treturn;\n\t}\n\n\t\/\/ TODO: check and handle execution status\n}\n\nvoid onRun(DbgEngPlugin* plugin)\n{\n\tprintf(\"DbgEngPlugin: onRun\\n\");\n\n\tif (plugin->state == PDDebugState_noTarget)\n\t{\n\t\tassert(!plugin->targetName.empty());\n\n\t\tHRESULT hr = plugin->debugClient->CreateProcess(0, PSTR(plugin->targetName.c_str()), DEBUG_ONLY_THIS_PROCESS);\n\t\tassert(SUCCEEDED(hr));\n\n\t\tif (!SUCCEEDED(hr))\n\t\t{\n\t\t\tprintf(\"Error: could not create process '%s'\\n\", plugin->targetName.c_str());\n\t\t}\n\t\telse\n\t\t{\n\t\t\tprintf(\"Valid target %s\\n\", plugin->targetName.c_str());\n\t\t}\n\n\t\tplugin->state = PDDebugState_running;\n\t}\n}\n\nvoid onStop(DbgEngPlugin* plugin)\n{\n\tprintf(\"DbgEngPlugin: onStop\\n\");\n}\n\nstatic void onBreak(DbgEngPlugin* plugin)\n{\n\tprintf(\"DbgEngPlugin: onBreak\\n\");\n}\n\nstatic void onStep(DbgEngPlugin* plugin)\n{\n\tprintf(\"DbgEngPlugin: onStep\\n\");\n}\n\nstatic void onStepOver(DbgEngPlugin* plugin)\n{\n\tprintf(\"DbgEngPlugin: onStepOver\\n\");\n}\n\nstatic void onStepOut(DbgEngPlugin* plugin)\n{\n\tprintf(\"DbgEngPlugin: onStepOut\\n\");\n}\n\nstatic void doAction(DbgEngPlugin* plugin, PDAction action)\n{\n\tprintf(\"DbgEngPlugin: doAction\\n\");\n\n\tswitch (action)\n\t{\n\tcase PDAction_stop: onStop(plugin); break;\n\tcase PDAction_break: onBreak(plugin); break;\n\tcase PDAction_run: onRun(plugin); break;\n\tcase PDAction_step: onStep(plugin); break;\n\tcase PDAction_stepOut: onStepOut(plugin); break;\n\tcase PDAction_stepOver: onStepOver(plugin); break;\n\t}\n}\n\nstatic void setExceptionLocation(DbgEngPlugin* plugin, PDWriter* writer)\n{\n\tprintf(\"DbgEngPlugin: setExceptionLocation\\n\");\n}\n\nstatic void setCallstack(DbgEngPlugin* plugin, PDWriter* writer)\n{\n\tconst ULONG maxFrames = 1024;\n\tDEBUG_STACK_FRAME frames[maxFrames];\n\tULONG frameSize = sizeof(frames[0]);\n\tULONG framesFilled = 0;\n\n\tplugin->debugControl->GetStackTrace(0, 0, 0, frames, frameSize, &framesFilled);\n\tprintf(\"DbgEngPlugin: setCallstack\\n\");\n\n\tif (framesFilled == 0)\n\t\treturn;\n\n\tPDWrite_eventBegin(writer, PDEventType_setCallstack);\n\tPDWrite_arrayBegin(writer, \"callstack\");\n\n\tfor (ULONG i = 0; i < framesFilled; ++i)\n\t{\n\t\tconst DEBUG_STACK_FRAME& frame = frames[i];\n\n\t\tPDWrite_arrayEntryBegin(writer);\n\t\tPDWrite_u64(writer, \"address\", frame.InstructionOffset);\n\t\tPDWrite_arrayEntryEnd(writer);\n\t}\n\n\tPDWrite_arrayEnd(writer);\n\tPDWrite_eventEnd(writer);\n}\n\nstatic void setExecutable(DbgEngPlugin* plugin, PDReader* reader)\n{\n\tprintf(\"DbgEngPlugin: setExecutable\\n\");\n\n\tconst char* filename = 0;\n\n\tPDRead_findString(reader, &filename, \"filename\", 0);\n\n\tif (!filename)\n\t{\n\t\tprintf(\"Unable to find filename which is required when starting a LLDB debug session\\n\");\n\t\treturn;\n\t}\n\n\tprintf(\"found filename \\\"%s\\\"\\n\", filename);\n\n\tplugin->targetName = filename;\n}\n\nstatic void setLocals(DbgEngPlugin* plugin, PDWriter* writer)\n{\n\tprintf(\"DbgEngPlugin: setLocals\\n\");\n}\n\nstatic void setBreakpoint(DbgEngPlugin* plugin, PDReader* reader, PDWriter* writer)\n{\n\tprintf(\"DbgEngPlugin: setBreakpoint\\n\");\n}\n\nstatic void eventAction(DbgEngPlugin* plugin, PDReader* reader)\n{\n\tprintf(\"DbgEngPlugin: eventAction\\n\");\n\n\tuint32_t action = 0;\n\n\tprintf(\"DbgEngPlugin; %d\\n\", (PDRead_findU32(reader, &action, \"action\", 0) & 0xff) >> 8);\n\tprintf(\"DbgEngPlugin: got action (from event) %d\\n\", action);\n\n\tdoAction(plugin, (PDAction)action);\n}\n\nstatic const char* eventTypes[] =\n{\n\t\"PDEventType_none\",\n\t\"PDEventType_getLocals\",\n\t\"PDEventType_setLocals\",\n\t\"PDEventType_getCallstack\",\n\t\"PDEventType_setCallstack\",\n\t\"PDEventType_getWatch\",\n\t\"PDEventType_setWatch\",\n\t\"PDEventType_getRegisters\",\n\t\"PDEventType_setRegisters\",\n\t\"PDEventType_getMemory\",\n\t\"PDEventType_setMemory\",\n\t\"PDEventType_getTty\",\n\t\"PDEventType_setTty\",\n\t\"PDEventType_getExceptionLocation\",\n\t\"PDEventType_setExceptionLocation\",\n\t\"PDEventType_getDisassembly\",\n\t\"PDEventType_setDisassembly\",\n\t\"PDEventType_setBreakpoint\",\n\t\"PDEventType_getBreakpoint\",\n\t\"PDEventType_setExecutable\",\n\t\"PDEventType_attachToProcess\",\n\t\"PDEventType_attachToRemoteSession\",\n\t\"PDEventType_action\",\n};\n\nstatic void processEvents(DbgEngPlugin* plugin, PDReader* reader, PDWriter* writer)\n{\n\tprintf(\"DbgEngPlugin: processEvents\\n\");\n\n\tPDEventType event;\n\n\twhile ((event = (PDEventType)PDRead_getEvent(reader)))\n\t{\n\t\tprintf(\"DbgEngPlugin: %d Got event %s\\n\", (int)event, eventTypes[event]);\n\n\t\tswitch (event)\n\t\t{\n\t\tcase PDEventType_getExceptionLocation: setExceptionLocation(plugin, writer); break;\n\t\tcase PDEventType_getCallstack: setCallstack(plugin, writer); break;\n\t\tcase PDEventType_setExecutable: setExecutable(plugin, reader); break;\n\t\tcase PDEventType_getLocals: setLocals(plugin, writer); break;\n\t\tcase PDEventType_setBreakpoint: setBreakpoint(plugin, reader, writer); break;\n\t\tcase PDEventType_action: eventAction(plugin, reader); break;\n\t\t}\n\t}\n}\n\nvoid* createInstance(ServiceFunc* serviceFunc)\n{\n\tDbgEngPlugin* plugin = new DbgEngPlugin;\n\n\tHRESULT hr = DebugCreate(__uuidof(IDebugClient), (void**)&plugin->debugClient);\n\tassert(SUCCEEDED(hr));\n\n\thr = plugin->debugClient->SetEventCallbacks(plugin);\n\tassert(SUCCEEDED(hr));\n\n\thr = plugin->debugClient->QueryInterface(__uuidof(IDebugControl), (void**)&plugin->debugControl);\n\tassert(SUCCEEDED(hr));\n\n\treturn plugin;\n}\n\nvoid destroyInstance(void* userData)\n{\n\tDbgEngPlugin* plugin = reinterpret_cast(userData);\n\n\tif (plugin->debugControl)\n\t{\n\t\tplugin->debugControl->Release();\n\t\tplugin->debugControl = nullptr;\n\t}\n\n\tif (plugin->debugClient)\n\t{\n\t\tplugin->debugClient->Release();\n\t\tplugin->debugClient = nullptr;\n\t}\n\n\tdelete plugin;\n}\n\nstatic PDDebugState update(void* userData, PDAction action, PDReader* reader, PDWriter* writer)\n{\n\tDbgEngPlugin* plugin = reinterpret_cast(userData);\n\n\tprocessEvents(plugin, reader, writer);\n\n\tdoAction(plugin, action);\n\n\tif (plugin->state == PDDebugState_running)\n\t{\n\t\tupdateDbgEngEvent(plugin, writer);\n\t}\n\n\treturn plugin->state;\n}\n\nstatic PDBackendPlugin plugin =\n{\n\t\"Microsoft Debugger Engine\",\n\tcreateInstance,\n\tdestroyInstance,\n\tupdate,\n};\n\nextern \"C\" PD_EXPORT void InitPlugin(RegisterPlugin* registerPlugin, void* privateData)\n{\n\tregisterPlugin(PD_BACKEND_API_VERSION, &plugin, privateData);\n}\n\n#endif\n<|endoftext|>"} {"text":"\/****************************************************************************\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 \"settingspage.h\"\n#include \"locatorconstants.h\"\n\n#include \"locatorplugin.h\"\n#include \"ilocatorfilter.h\"\n#include \"directoryfilter.h\"\n\n#include \n#include \n#include \n\n#include \n\nQ_DECLARE_METATYPE(Locator::ILocatorFilter*)\n\nusing namespace Locator;\nusing namespace Locator::Internal;\n\nSettingsPage::SettingsPage(LocatorPlugin *plugin)\n : m_plugin(plugin), m_page(0)\n{\n setId(Constants::FILTER_OPTIONS_PAGE);\n setDisplayName(QCoreApplication::translate(\"Locator\", Locator::Constants::FILTER_OPTIONS_PAGE));\n setCategory(Core::Constants::SETTINGS_CATEGORY_CORE);\n setDisplayCategory(QCoreApplication::translate(\"Core\", Core::Constants::SETTINGS_TR_CATEGORY_CORE));\n setCategoryIcon(QLatin1String(Core::Constants::SETTINGS_CATEGORY_CORE_ICON));\n}\n\nQWidget *SettingsPage::createPage(QWidget *parent)\n{\n\n m_page = new QWidget(parent);\n m_ui.setupUi(m_page);\n connect(m_ui.filterList, SIGNAL(currentItemChanged(QListWidgetItem*,QListWidgetItem*)),\n this, SLOT(updateButtonStates()));\n connect(m_ui.filterList, SIGNAL(itemActivated(QListWidgetItem*)),\n this, SLOT(configureFilter(QListWidgetItem*)));\n connect(m_ui.editButton, SIGNAL(clicked()),\n this, SLOT(configureFilter()));\n connect(m_ui.addButton, SIGNAL(clicked()),\n this, SLOT(addCustomFilter()));\n connect(m_ui.removeButton, SIGNAL(clicked()),\n this, SLOT(removeCustomFilter()));\n\n m_ui.refreshInterval->setValue(m_plugin->refreshInterval());\n m_filters = m_plugin->filters();\n m_customFilters = m_plugin->customFilters();\n saveFilterStates();\n updateFilterList();\n if (m_searchKeywords.isEmpty()) {\n m_searchKeywords = m_ui.refreshIntervalLabel->text();\n m_searchKeywords.remove(QLatin1Char('&'));\n }\n return m_page;\n}\n\nvoid SettingsPage::apply()\n{\n \/\/ Delete removed filters and clear added filters\n qDeleteAll(m_removedFilters);\n m_removedFilters.clear();\n m_addedFilters.clear();\n\n \/\/ Pass the new configuration on to the plugin\n m_plugin->setFilters(m_filters);\n m_plugin->setCustomFilters(m_customFilters);\n m_plugin->setRefreshInterval(m_ui.refreshInterval->value());\n requestRefresh();\n m_plugin->saveSettings();\n saveFilterStates();\n}\n\nvoid SettingsPage::finish()\n{\n \/\/ If settings were applied, this shouldn't change anything. Otherwise it\n \/\/ makes sure the filter states aren't changed permanently.\n restoreFilterStates();\n\n \/\/ Delete added filters and clear removed filters\n qDeleteAll(m_addedFilters);\n m_addedFilters.clear();\n m_removedFilters.clear();\n\n \/\/ Further cleanup\n m_filters.clear();\n m_customFilters.clear();\n m_refreshFilters.clear();\n}\n\nvoid SettingsPage::requestRefresh()\n{\n if (!m_refreshFilters.isEmpty())\n m_plugin->refresh(m_refreshFilters);\n}\n\nvoid SettingsPage::saveFilterStates()\n{\n m_filterStates.clear();\n foreach (ILocatorFilter *filter, m_filters)\n m_filterStates.insert(filter, filter->saveState());\n}\n\nvoid SettingsPage::restoreFilterStates()\n{\n foreach (ILocatorFilter *filter, m_filterStates.keys())\n filter->restoreState(m_filterStates.value(filter));\n}\n\nvoid SettingsPage::updateFilterList()\n{\n m_ui.filterList->clear();\n foreach (ILocatorFilter *filter, m_filters) {\n if (filter->isHidden())\n continue;\n\n QString title;\n if (filter->isIncludedByDefault())\n title = filter->displayName();\n else\n title = tr(\"%1 (prefix: %2)\").arg(filter->displayName()).arg(filter->shortcutString());\n QListWidgetItem *item = new QListWidgetItem(title);\n item->setData(Qt::UserRole, qVariantFromValue(filter));\n m_ui.filterList->addItem(item);\n }\n if (m_ui.filterList->count() > 0)\n m_ui.filterList->setCurrentRow(0);\n}\n\nvoid SettingsPage::updateButtonStates()\n{\n QListWidgetItem *item = m_ui.filterList->currentItem();\n ILocatorFilter *filter = (item ? item->data(Qt::UserRole).value() : 0);\n m_ui.editButton->setEnabled(filter && filter->isConfigurable());\n m_ui.removeButton->setEnabled(filter && m_customFilters.contains(filter));\n}\n\nvoid SettingsPage::configureFilter(QListWidgetItem *item)\n{\n if (!item)\n item = m_ui.filterList->currentItem();\n QTC_ASSERT(item, return);\n ILocatorFilter *filter = item->data(Qt::UserRole).value();\n QTC_ASSERT(filter, return);\n\n if (!filter->isConfigurable())\n return;\n bool needsRefresh = false;\n filter->openConfigDialog(m_page, needsRefresh);\n if (needsRefresh && !m_refreshFilters.contains(filter))\n m_refreshFilters.append(filter);\n updateFilterList();\n}\n\nvoid SettingsPage::addCustomFilter()\n{\n ILocatorFilter *filter = new DirectoryFilter;\n bool needsRefresh = false;\n if (filter->openConfigDialog(m_page, needsRefresh)) {\n m_filters.append(filter);\n m_addedFilters.append(filter);\n m_customFilters.append(filter);\n m_refreshFilters.append(filter);\n updateFilterList();\n }\n}\n\nvoid SettingsPage::removeCustomFilter()\n{\n QListWidgetItem *item = m_ui.filterList->currentItem();\n QTC_ASSERT(item, return);\n ILocatorFilter *filter = item->data(Qt::UserRole).value();\n QTC_ASSERT(m_customFilters.contains(filter), return);\n m_filters.removeAll(filter);\n m_customFilters.removeAll(filter);\n m_refreshFilters.removeAll(filter);\n if (m_addedFilters.contains(filter)) {\n m_addedFilters.removeAll(filter);\n delete filter;\n } else {\n m_removedFilters.append(filter);\n }\n updateFilterList();\n}\n\nbool SettingsPage::matches(const QString &s) const\n{\n return m_searchKeywords.contains(s, Qt::CaseInsensitive);\n}\nLocator settings: replicate tool tip also on spinbox\/****************************************************************************\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 \"settingspage.h\"\n#include \"locatorconstants.h\"\n\n#include \"locatorplugin.h\"\n#include \"ilocatorfilter.h\"\n#include \"directoryfilter.h\"\n\n#include \n#include \n#include \n\n#include \n\nQ_DECLARE_METATYPE(Locator::ILocatorFilter*)\n\nusing namespace Locator;\nusing namespace Locator::Internal;\n\nSettingsPage::SettingsPage(LocatorPlugin *plugin)\n : m_plugin(plugin), m_page(0)\n{\n setId(Constants::FILTER_OPTIONS_PAGE);\n setDisplayName(QCoreApplication::translate(\"Locator\", Locator::Constants::FILTER_OPTIONS_PAGE));\n setCategory(Core::Constants::SETTINGS_CATEGORY_CORE);\n setDisplayCategory(QCoreApplication::translate(\"Core\", Core::Constants::SETTINGS_TR_CATEGORY_CORE));\n setCategoryIcon(QLatin1String(Core::Constants::SETTINGS_CATEGORY_CORE_ICON));\n}\n\nQWidget *SettingsPage::createPage(QWidget *parent)\n{\n\n m_page = new QWidget(parent);\n m_ui.setupUi(m_page);\n m_ui.refreshInterval->setToolTip(m_ui.refreshIntervalLabel->toolTip());\n connect(m_ui.filterList, SIGNAL(currentItemChanged(QListWidgetItem*,QListWidgetItem*)),\n this, SLOT(updateButtonStates()));\n connect(m_ui.filterList, SIGNAL(itemActivated(QListWidgetItem*)),\n this, SLOT(configureFilter(QListWidgetItem*)));\n connect(m_ui.editButton, SIGNAL(clicked()),\n this, SLOT(configureFilter()));\n connect(m_ui.addButton, SIGNAL(clicked()),\n this, SLOT(addCustomFilter()));\n connect(m_ui.removeButton, SIGNAL(clicked()),\n this, SLOT(removeCustomFilter()));\n\n m_ui.refreshInterval->setValue(m_plugin->refreshInterval());\n m_filters = m_plugin->filters();\n m_customFilters = m_plugin->customFilters();\n saveFilterStates();\n updateFilterList();\n if (m_searchKeywords.isEmpty()) {\n m_searchKeywords = m_ui.refreshIntervalLabel->text();\n m_searchKeywords.remove(QLatin1Char('&'));\n }\n return m_page;\n}\n\nvoid SettingsPage::apply()\n{\n \/\/ Delete removed filters and clear added filters\n qDeleteAll(m_removedFilters);\n m_removedFilters.clear();\n m_addedFilters.clear();\n\n \/\/ Pass the new configuration on to the plugin\n m_plugin->setFilters(m_filters);\n m_plugin->setCustomFilters(m_customFilters);\n m_plugin->setRefreshInterval(m_ui.refreshInterval->value());\n requestRefresh();\n m_plugin->saveSettings();\n saveFilterStates();\n}\n\nvoid SettingsPage::finish()\n{\n \/\/ If settings were applied, this shouldn't change anything. Otherwise it\n \/\/ makes sure the filter states aren't changed permanently.\n restoreFilterStates();\n\n \/\/ Delete added filters and clear removed filters\n qDeleteAll(m_addedFilters);\n m_addedFilters.clear();\n m_removedFilters.clear();\n\n \/\/ Further cleanup\n m_filters.clear();\n m_customFilters.clear();\n m_refreshFilters.clear();\n}\n\nvoid SettingsPage::requestRefresh()\n{\n if (!m_refreshFilters.isEmpty())\n m_plugin->refresh(m_refreshFilters);\n}\n\nvoid SettingsPage::saveFilterStates()\n{\n m_filterStates.clear();\n foreach (ILocatorFilter *filter, m_filters)\n m_filterStates.insert(filter, filter->saveState());\n}\n\nvoid SettingsPage::restoreFilterStates()\n{\n foreach (ILocatorFilter *filter, m_filterStates.keys())\n filter->restoreState(m_filterStates.value(filter));\n}\n\nvoid SettingsPage::updateFilterList()\n{\n m_ui.filterList->clear();\n foreach (ILocatorFilter *filter, m_filters) {\n if (filter->isHidden())\n continue;\n\n QString title;\n if (filter->isIncludedByDefault())\n title = filter->displayName();\n else\n title = tr(\"%1 (prefix: %2)\").arg(filter->displayName()).arg(filter->shortcutString());\n QListWidgetItem *item = new QListWidgetItem(title);\n item->setData(Qt::UserRole, qVariantFromValue(filter));\n m_ui.filterList->addItem(item);\n }\n if (m_ui.filterList->count() > 0)\n m_ui.filterList->setCurrentRow(0);\n}\n\nvoid SettingsPage::updateButtonStates()\n{\n QListWidgetItem *item = m_ui.filterList->currentItem();\n ILocatorFilter *filter = (item ? item->data(Qt::UserRole).value() : 0);\n m_ui.editButton->setEnabled(filter && filter->isConfigurable());\n m_ui.removeButton->setEnabled(filter && m_customFilters.contains(filter));\n}\n\nvoid SettingsPage::configureFilter(QListWidgetItem *item)\n{\n if (!item)\n item = m_ui.filterList->currentItem();\n QTC_ASSERT(item, return);\n ILocatorFilter *filter = item->data(Qt::UserRole).value();\n QTC_ASSERT(filter, return);\n\n if (!filter->isConfigurable())\n return;\n bool needsRefresh = false;\n filter->openConfigDialog(m_page, needsRefresh);\n if (needsRefresh && !m_refreshFilters.contains(filter))\n m_refreshFilters.append(filter);\n updateFilterList();\n}\n\nvoid SettingsPage::addCustomFilter()\n{\n ILocatorFilter *filter = new DirectoryFilter;\n bool needsRefresh = false;\n if (filter->openConfigDialog(m_page, needsRefresh)) {\n m_filters.append(filter);\n m_addedFilters.append(filter);\n m_customFilters.append(filter);\n m_refreshFilters.append(filter);\n updateFilterList();\n }\n}\n\nvoid SettingsPage::removeCustomFilter()\n{\n QListWidgetItem *item = m_ui.filterList->currentItem();\n QTC_ASSERT(item, return);\n ILocatorFilter *filter = item->data(Qt::UserRole).value();\n QTC_ASSERT(m_customFilters.contains(filter), return);\n m_filters.removeAll(filter);\n m_customFilters.removeAll(filter);\n m_refreshFilters.removeAll(filter);\n if (m_addedFilters.contains(filter)) {\n m_addedFilters.removeAll(filter);\n delete filter;\n } else {\n m_removedFilters.append(filter);\n }\n updateFilterList();\n}\n\nbool SettingsPage::matches(const QString &s) const\n{\n return m_searchKeywords.contains(s, Qt::CaseInsensitive);\n}\n<|endoftext|>"} {"text":"\/** \\file SysLog.h\n * \\brief Declaration of class SysLog.\n * \\author Dr. Johannes Ruscheinski\n *\/\n\n\/*\n * Copyright 2020 University Library 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 .\n *\/\n#include \"SysLog.h\"\n\n\nSysLog::SysLog(const std::string &message_prefix, const int option, const int facility) {\n ::openlog(message_prefix.c_str(), option, facility);\n ::setlogmask(LOG_EMERG | LOG_ALERT | LOG_CRIT | LOG_ERR | LOG_WARNING | LOG_NOTICE | LOG_INFO);\n}\n\n\nSysLog::~SysLog() {\n ::closelog();\n}\n\n\nvoid SysLog::log(const LogLevel level, const std::string &message) {\n ::syslog(level, \"%s\", message.c_str());\n}\nUse progran name as default log entry prefix.\/** \\file SysLog.h\n * \\brief Declaration of class SysLog.\n * \\author Dr. Johannes Ruscheinski\n *\/\n\n\/*\n * Copyright 2020 University Library 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 .\n *\/\n#include \"SysLog.h\"\n\n\nSysLog::SysLog(const std::string &message_prefix, const int option, const int facility) {\n ::openlog(message_prefix.empty() ? nullptr : message_prefix.c_str(), option, facility);\n ::setlogmask(LOG_EMERG | LOG_ALERT | LOG_CRIT | LOG_ERR | LOG_WARNING | LOG_NOTICE | LOG_INFO);\n}\n\n\nSysLog::~SysLog() {\n ::closelog();\n}\n\n\nvoid SysLog::log(const LogLevel level, const std::string &message) {\n ::syslog(level, \"%s\", message.c_str());\n}\n<|endoftext|>"} {"text":"\/* -*- 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 \n#include \"TagLogger.hxx\"\n#include \"PropertyMapHelper.hxx\"\n\nnamespace writerfilter\n{\nnamespace dmapper\n{\n\nusing namespace ::com::sun::star;\n\nvoid lcl_DumpTableColumnSeparators(const TagLogger::Pointer_t& pLogger, const uno::Any & rTableColumnSeparators)\n{\n (void) pLogger;\n (void) rTableColumnSeparators;\n#ifdef DEBUG_WRITERFILTER\n uno::Sequence aSeq;\n rTableColumnSeparators >>= aSeq;\n\n pLogger->startElement(\"property.TableColumnSeparators\");\n\n sal_uInt32 nLength = aSeq.getLength();\n for (sal_uInt32 n = 0; n < nLength; ++n)\n {\n pLogger->startElement(\"separator\");\n\n pLogger->attribute(\"position\", aSeq[n].Position);\n pLogger->attribute(\"visible\", aSeq[n].IsVisible);\n\n pLogger->endElement();\n }\n\n pLogger->endElement();\n#endif \/\/ DEBUG_WRITERFILTER\n}\n\n#ifdef DEBUG_WRITERFILTER\nvoid lcl_DumpPropertyValues(const TagLogger::Pointer_t pLogger, beans::PropertyValues & rValues)\n{\n pLogger->startElement(\"propertyValues\");\n\n beans::PropertyValue * pValues = rValues.getArray();\n\n for (sal_Int32 n = 0; n < rValues.getLength(); ++n)\n {\n pLogger->startElement(\"propertyValue\");\n\n pLogger->attribute(\"name\", pValues[n].Name);\n\n try\n {\n sal_Int32 aInt = 0;\n pValues[n].Value >>= aInt;\n pLogger->attribute(\"value\", aInt);\n }\n catch (...)\n {\n }\n\n if ( pValues[n].Name == \"TableColumnSeparators\" )\n {\n lcl_DumpTableColumnSeparators(pLogger, pValues[n].Value);\n }\n\n pLogger->endElement();\n }\n pLogger->endElement();\n}\n\nvoid lcl_DumpPropertyValueSeq(const TagLogger::Pointer_t pLogger, PropertyValueSeq_t & rPropValSeq)\n{\n pLogger->startElement(\"PropertyValueSeq\");\n\n beans::PropertyValues * pValues = rPropValSeq.getArray();\n\n for (sal_Int32 n = 0; n < rPropValSeq.getLength(); ++n)\n {\n lcl_DumpPropertyValues(pLogger, pValues[n]);\n }\n\n pLogger->endElement();\n}\n#endif \/\/ DEBUG_WRITERFILTER\n\n}\n}\n\n\/* vim:set shiftwidth=4 softtabstop=4 expandtab: *\/\nBooleans are logged via sal_uInt32 here\/* -*- 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 \n#include \"TagLogger.hxx\"\n#include \"PropertyMapHelper.hxx\"\n\nnamespace writerfilter\n{\nnamespace dmapper\n{\n\nusing namespace ::com::sun::star;\n\nvoid lcl_DumpTableColumnSeparators(const TagLogger::Pointer_t& pLogger, const uno::Any & rTableColumnSeparators)\n{\n (void) pLogger;\n (void) rTableColumnSeparators;\n#ifdef DEBUG_WRITERFILTER\n uno::Sequence aSeq;\n rTableColumnSeparators >>= aSeq;\n\n pLogger->startElement(\"property.TableColumnSeparators\");\n\n sal_uInt32 nLength = aSeq.getLength();\n for (sal_uInt32 n = 0; n < nLength; ++n)\n {\n pLogger->startElement(\"separator\");\n\n pLogger->attribute(\"position\", aSeq[n].Position);\n pLogger->attribute(\"visible\", sal_uInt32(aSeq[n].IsVisible));\n\n pLogger->endElement();\n }\n\n pLogger->endElement();\n#endif \/\/ DEBUG_WRITERFILTER\n}\n\n#ifdef DEBUG_WRITERFILTER\nvoid lcl_DumpPropertyValues(const TagLogger::Pointer_t pLogger, beans::PropertyValues & rValues)\n{\n pLogger->startElement(\"propertyValues\");\n\n beans::PropertyValue * pValues = rValues.getArray();\n\n for (sal_Int32 n = 0; n < rValues.getLength(); ++n)\n {\n pLogger->startElement(\"propertyValue\");\n\n pLogger->attribute(\"name\", pValues[n].Name);\n\n try\n {\n sal_Int32 aInt = 0;\n pValues[n].Value >>= aInt;\n pLogger->attribute(\"value\", aInt);\n }\n catch (...)\n {\n }\n\n if ( pValues[n].Name == \"TableColumnSeparators\" )\n {\n lcl_DumpTableColumnSeparators(pLogger, pValues[n].Value);\n }\n\n pLogger->endElement();\n }\n pLogger->endElement();\n}\n\nvoid lcl_DumpPropertyValueSeq(const TagLogger::Pointer_t pLogger, PropertyValueSeq_t & rPropValSeq)\n{\n pLogger->startElement(\"PropertyValueSeq\");\n\n beans::PropertyValues * pValues = rPropValSeq.getArray();\n\n for (sal_Int32 n = 0; n < rPropValSeq.getLength(); ++n)\n {\n lcl_DumpPropertyValues(pLogger, pValues[n]);\n }\n\n pLogger->endElement();\n}\n#endif \/\/ DEBUG_WRITERFILTER\n\n}\n}\n\n\/* vim:set shiftwidth=4 softtabstop=4 expandtab: *\/\n<|endoftext|>"} {"text":"\/\/ ROS\n#include \n#include \n#include \n#include \n\n\/\/ for debugging\n#include \n\n\/\/ stl\n#include \n#include \n\n\/\/ MoveIt!\n#include \n#include \n#include \n#include \n\n\/\/ joint states\n#include \n\n\/\/ predicator\n#include \n#include \n\n\/\/ boost includes\n#include \n\nusing planning_scene::PlanningScene;\nusing robot_model_loader::RobotModelLoader;\nusing robot_model::RobotModelPtr;\nusing robot_state::RobotState;\nusing collision_detection::CollisionRobot;\n\nstd::vector robots;\nstd::vector states;\nstd::vector scenes;\nstd::vector subs;\n\n\/**\n * joint_state_callback()\n * Update the robot state variable values\n *\/\nvoid joint_state_callback(const sensor_msgs::JointState::ConstPtr &msg, RobotState *state) {\n state->setVariableValues(*msg);\n}\n\n\/**\n * cleanup()\n * Delete memory allocated for robot states and subscribers\n *\/\nvoid cleanup() {\n for (typename std::vector::iterator it = states.begin();\n it != states.end();\n ++it)\n {\n delete *it;\n }\n\n for (typename std::vector::iterator it = scenes.begin();\n it != scenes.end();\n ++it)\n {\n delete *it;\n }\n}\n\nint main(int argc, char **argv) {\n\n double padding; \/\/ how much padding do we give robot links?\n int verbosity; \/\/ how much should get printed for debugging purposes\n std::map floating_frames;\n std::string world_frame;\n\n ros::init(argc, argv, \"predicator_robot_interaction_node\");\n\n ros::NodeHandle nh;\n ros::NodeHandle nh_tilde(\"~\");\n\n XmlRpc::XmlRpcValue descriptions;\n XmlRpc::XmlRpcValue topics;\n XmlRpc::XmlRpcValue floating; \/\/ set of floating root joints that need to be updated\n\n nh_tilde.param(\"verbosity\", verbosity, 0);\n nh_tilde.param(\"padding\", padding, 0.01);\n nh_tilde.param(\"world_frame\", world_frame, std::string(\"\/world\"));\n\n ros::Publisher pub = nh.advertise(\"\/predicator\/input\", 1000);\n tf::TransformListener listener;\n\n if(nh_tilde.hasParam(\"description_list\")) {\n nh_tilde.param(\"description_list\", descriptions, descriptions);\n } else {\n ROS_ERROR(\"No list of robot description parameters!\");\n exit(-1);\n }\n\n if(nh_tilde.hasParam(\"joint_state_topic_list\")) {\n nh_tilde.param(\"joint_state_topic_list\", topics, topics);\n } else {\n ROS_ERROR(\"No list of joint state topics!\");\n exit(-1);\n }\n\n if(nh_tilde.hasParam(\"floating_root_list\")) {\n nh_tilde.param(\"floating_root_list\", floating, floating);\n } else {\n ROS_INFO(\"No list of robots with floating root joints given.\");\n }\n\n if(descriptions.size() != topics.size()) {\n ROS_WARN(\"An unequal number of joint state and robot topics was provided!\");\n }\n\n \/\/ read in topics and descriptions\n for(unsigned int i = 0; i < descriptions.size(); ++i) {\n std::string desc;\n std::string topic;\n\n if(descriptions[i].getType() == XmlRpc::XmlRpcValue::TypeString) {\n desc = static_cast(descriptions[i]);\n if(verbosity > 0) {\n std::cout << \"Robot Description parameter name: \" << desc << std::endl;\n }\n } else {\n ROS_WARN(\"Description %u was not of type \\\"string\\\"!\", i);\n continue;\n }\n\n \/\/ create a robot model with state desc\n robot_model_loader::RobotModelLoader robot_model_loader(desc);\n robot_model::RobotModelPtr model = robot_model_loader.getModel();\n PlanningScene *scene = new PlanningScene(model);\n scene->getCollisionRobotNonConst()->setPadding(padding);\n scene->propogateRobotPadding();\n\n robots.push_back(model);\n scenes.push_back(scene);\n\n RobotState *state = new RobotState(model);\n states.push_back(state);\n\n if(i < topics.size() && topics[i].getType() == XmlRpc::XmlRpcValue::TypeString) {\n topic = static_cast(topics[i]);\n if(verbosity > 0) {\n std::cout << \"JointState topic name: \" << topic << std::endl;\n }\n\n \/\/ create the subscriber\n subs.push_back(nh.subscribe\n (topic, 1000,\n boost::bind(joint_state_callback, _1, state)));\n } else if (verbosity > 0) {\n ROS_WARN(\"no topic corresponding to description %s!\", desc.c_str());\n }\n }\n\n \/\/ read in root TF frames\n for(unsigned int i = 0; i < floating.size(); ++i) {\n std::string id = floating[i][\"id\"];\n std::string frame = floating[i][\"frame\"];\n\n floating_frames[id] = frame;\n }\n\n \/\/ define spin rate\n ros::Rate rate(30);\n\n \/\/ print out information on all the different joints\n if(verbosity > 0) {\n unsigned int i = 0;\n for(typename std::vector::iterator it1 = scenes.begin();\n it1 != scenes.end();\n ++it1, ++i)\n {\n collision_detection::CollisionRobotConstPtr robot1 = (*it1)->getCollisionRobot();\n \/\/ -----------------------------------------------------------\n std::cout << std::endl;\n std::cout << \"PRINTING STATE INFO:\";\n std::cout << robot1->getRobotModel()->getName() << std::endl;\n std::cout << robots[i]->getRootJointName() << std::endl;\n states[i]->update(true);\n states[i]->printStateInfo(std::cout);\n \/\/ -----------------------------------------------------------\n }\n }\n\n \/\/ start main loop\n while(ros::ok()) {\n ros::spinOnce();\n\n predicator_msgs::PredicateList output;\n output.header.frame_id = ros::this_node::getName();\n\n unsigned int i = 0;\n\n \/\/ make sure base frames are up to date\n \/\/ some objects, such as free-floating robots (aka the ring) need to be updated by TF\n \/\/ not sure why this doesn't work naturally\n for(typename std::vector::iterator it1 = scenes.begin();\n it1 != scenes.end();\n ++it1, ++i)\n {\n\n collision_detection::CollisionRobotConstPtr robot1 = (*it1)->getCollisionRobot();\n std::string name = robot1->getRobotModel()->getName();\n\n if(floating_frames.find(name) != floating_frames.end()) {\n std::string base_frame = floating_frames[name];\n\n tf::StampedTransform transform;\n Eigen::Affine3d t;\n\n try{\n listener.lookupTransform(world_frame, base_frame,\n ros::Time(0), transform);\n tf::transformTFToEigen(transform,t);\n states[i]->setJointPositions(robot1->getRobotModel()->getRootJointName(), t);\n }\n catch (tf::TransformException ex){\n ROS_ERROR(\"%s\",ex.what());\n }\n\n if(verbosity > 1) {\n std::cout << \"----------------------------\" << std::endl;\n std::cout << \"PRINTING STATE INFO:\";\n std::cout << robot1->getRobotModel()->getName() << std::endl;\n std::cout << robots[i]->getRootJointName() << std::endl;\n states[i]->update(true);\n states[i]->printStateInfo(std::cout);\n }\n\n } else {\n continue;\n }\n }\n\n \/\/ main collision checking loop\n \/\/ checks for all pairs of objects, determines collisions and distances\n \/\/ publishes the relationships between all of these objects\n i = 0;\n for(typename std::vector::iterator it1 = scenes.begin();\n it1 != scenes.end();\n ++it1, ++i)\n {\n\n collision_detection::CollisionRobotConstPtr robot1 = (*it1)->getCollisionRobot();\n\n\n typename std::vector::iterator it2 = it1;\n unsigned int j = i+1;\n for(++it2; it2 != scenes.end(); ++it2, ++j) {\n\n collision_detection::CollisionRobotConstPtr robot2 = (*it2)->getCollisionRobot();\n\n collision_detection::CollisionRequest req;\n collision_detection::CollisionResult res;\n req.contacts = true;\n req.max_contacts = 1000;\n\n \/\/ force an update\n \/\/ source: https:\/\/groups.google.com\/forum\/#!topic\/moveit-users\/O9CEef6sxbE\n states[i]->update(true);\n states[j]->update(true);\n robot1->checkOtherCollision(req, res, *states[i], *robot2, *states[j]);\n double dist = robot1->distanceOther(*states[i], *robot2, *states[j]);\n\n predicator_msgs::PredicateStatement ps_dist;\n ps_dist.predicate = \"distance\";\n ps_dist.value = dist;\n ps_dist.num_params = 2;\n ps_dist.params[0] = robot1->getRobotModel()->getName();\n ps_dist.params[1] = robot2->getRobotModel()->getName();\n\n output.statements.push_back(ps_dist);\n\n \/\/ iterate over all collisions\n for(collision_detection::CollisionResult::ContactMap::const_iterator cit = res.contacts.begin(); \n cit != res.contacts.end(); \n ++cit)\n {\n predicator_msgs::PredicateStatement ps;\n ps.predicate = \"touching\";\n ps.value = 1.0;\n ps.num_params = 2;\n ps.params[0] = cit->first.first;\n ps.params[1] = cit->first.second;\n output.statements.push_back(ps);\n }\n\n if (verbosity > 1) {\n std::cout << \"(\" << robot1->getRobotModel()->getName()\n << \", \" << robot2->getRobotModel()->getName()\n << \": Distance to collision: \" << dist << std::endl;\n }\n }\n }\n\n pub.publish(output);\n\n rate.sleep();\n }\n\n cleanup();\n}\nprint both the forward and inverse of predicates; aka, flip the parameters around so that we have both touching(x, y) and touching(y, x)\/\/ ROS\n#include \n#include \n#include \n#include \n\n\/\/ for debugging\n#include \n\n\/\/ stl\n#include \n#include \n\n\/\/ MoveIt!\n#include \n#include \n#include \n#include \n\n\/\/ joint states\n#include \n\n\/\/ predicator\n#include \n#include \n\n\/\/ boost includes\n#include \n\nusing planning_scene::PlanningScene;\nusing robot_model_loader::RobotModelLoader;\nusing robot_model::RobotModelPtr;\nusing robot_state::RobotState;\nusing collision_detection::CollisionRobot;\n\nstd::vector robots;\nstd::vector states;\nstd::vector scenes;\nstd::vector subs;\n\n\/**\n * joint_state_callback()\n * Update the robot state variable values\n *\/\nvoid joint_state_callback(const sensor_msgs::JointState::ConstPtr &msg, RobotState *state) {\n state->setVariableValues(*msg);\n}\n\n\/**\n * cleanup()\n * Delete memory allocated for robot states and subscribers\n *\/\nvoid cleanup() {\n for (typename std::vector::iterator it = states.begin();\n it != states.end();\n ++it)\n {\n delete *it;\n }\n\n for (typename std::vector::iterator it = scenes.begin();\n it != scenes.end();\n ++it)\n {\n delete *it;\n }\n}\n\nint main(int argc, char **argv) {\n\n double padding; \/\/ how much padding do we give robot links?\n int verbosity; \/\/ how much should get printed for debugging purposes\n std::map floating_frames;\n std::string world_frame;\n\n ros::init(argc, argv, \"predicator_robot_interaction_node\");\n\n ros::NodeHandle nh;\n ros::NodeHandle nh_tilde(\"~\");\n\n XmlRpc::XmlRpcValue descriptions;\n XmlRpc::XmlRpcValue topics;\n XmlRpc::XmlRpcValue floating; \/\/ set of floating root joints that need to be updated\n\n nh_tilde.param(\"verbosity\", verbosity, 0);\n nh_tilde.param(\"padding\", padding, 0.01);\n nh_tilde.param(\"world_frame\", world_frame, std::string(\"\/world\"));\n\n ros::Publisher pub = nh.advertise(\"\/predicator\/input\", 1000);\n tf::TransformListener listener;\n\n if(nh_tilde.hasParam(\"description_list\")) {\n nh_tilde.param(\"description_list\", descriptions, descriptions);\n } else {\n ROS_ERROR(\"No list of robot description parameters!\");\n exit(-1);\n }\n\n if(nh_tilde.hasParam(\"joint_state_topic_list\")) {\n nh_tilde.param(\"joint_state_topic_list\", topics, topics);\n } else {\n ROS_ERROR(\"No list of joint state topics!\");\n exit(-1);\n }\n\n if(nh_tilde.hasParam(\"floating_root_list\")) {\n nh_tilde.param(\"floating_root_list\", floating, floating);\n } else {\n ROS_INFO(\"No list of robots with floating root joints given.\");\n }\n\n if(descriptions.size() != topics.size()) {\n ROS_WARN(\"An unequal number of joint state and robot topics was provided!\");\n }\n\n \/\/ read in topics and descriptions\n for(unsigned int i = 0; i < descriptions.size(); ++i) {\n std::string desc;\n std::string topic;\n\n if(descriptions[i].getType() == XmlRpc::XmlRpcValue::TypeString) {\n desc = static_cast(descriptions[i]);\n if(verbosity > 0) {\n std::cout << \"Robot Description parameter name: \" << desc << std::endl;\n }\n } else {\n ROS_WARN(\"Description %u was not of type \\\"string\\\"!\", i);\n continue;\n }\n\n \/\/ create a robot model with state desc\n robot_model_loader::RobotModelLoader robot_model_loader(desc);\n robot_model::RobotModelPtr model = robot_model_loader.getModel();\n PlanningScene *scene = new PlanningScene(model);\n scene->getCollisionRobotNonConst()->setPadding(padding);\n scene->propogateRobotPadding();\n\n robots.push_back(model);\n scenes.push_back(scene);\n\n RobotState *state = new RobotState(model);\n states.push_back(state);\n\n if(i < topics.size() && topics[i].getType() == XmlRpc::XmlRpcValue::TypeString) {\n topic = static_cast(topics[i]);\n if(verbosity > 0) {\n std::cout << \"JointState topic name: \" << topic << std::endl;\n }\n\n \/\/ create the subscriber\n subs.push_back(nh.subscribe\n (topic, 1000,\n boost::bind(joint_state_callback, _1, state)));\n } else if (verbosity > 0) {\n ROS_WARN(\"no topic corresponding to description %s!\", desc.c_str());\n }\n }\n\n \/\/ read in root TF frames\n for(unsigned int i = 0; i < floating.size(); ++i) {\n std::string id = floating[i][\"id\"];\n std::string frame = floating[i][\"frame\"];\n\n floating_frames[id] = frame;\n }\n\n \/\/ define spin rate\n ros::Rate rate(30);\n\n \/\/ print out information on all the different joints\n if(verbosity > 0) {\n unsigned int i = 0;\n for(typename std::vector::iterator it1 = scenes.begin();\n it1 != scenes.end();\n ++it1, ++i)\n {\n collision_detection::CollisionRobotConstPtr robot1 = (*it1)->getCollisionRobot();\n \/\/ -----------------------------------------------------------\n std::cout << std::endl;\n std::cout << \"PRINTING STATE INFO:\";\n std::cout << robot1->getRobotModel()->getName() << std::endl;\n std::cout << robots[i]->getRootJointName() << std::endl;\n states[i]->update(true);\n states[i]->printStateInfo(std::cout);\n \/\/ -----------------------------------------------------------\n }\n }\n\n \/\/ start main loop\n while(ros::ok()) {\n ros::spinOnce();\n\n predicator_msgs::PredicateList output;\n output.header.frame_id = ros::this_node::getName();\n\n unsigned int i = 0;\n\n \/\/ make sure base frames are up to date\n \/\/ some objects, such as free-floating robots (aka the ring) need to be updated by TF\n \/\/ not sure why this doesn't work naturally\n for(typename std::vector::iterator it1 = scenes.begin();\n it1 != scenes.end();\n ++it1, ++i)\n {\n\n collision_detection::CollisionRobotConstPtr robot1 = (*it1)->getCollisionRobot();\n std::string name = robot1->getRobotModel()->getName();\n\n if(floating_frames.find(name) != floating_frames.end()) {\n std::string base_frame = floating_frames[name];\n\n tf::StampedTransform transform;\n Eigen::Affine3d t;\n\n try{\n listener.lookupTransform(world_frame, base_frame,\n ros::Time(0), transform);\n tf::transformTFToEigen(transform,t);\n states[i]->setJointPositions(robot1->getRobotModel()->getRootJointName(), t);\n }\n catch (tf::TransformException ex){\n ROS_ERROR(\"%s\",ex.what());\n }\n\n if(verbosity > 1) {\n std::cout << \"----------------------------\" << std::endl;\n std::cout << \"PRINTING STATE INFO:\";\n std::cout << robot1->getRobotModel()->getName() << std::endl;\n std::cout << robots[i]->getRootJointName() << std::endl;\n states[i]->update(true);\n states[i]->printStateInfo(std::cout);\n }\n\n } else {\n continue;\n }\n }\n\n \/\/ main collision checking loop\n \/\/ checks for all pairs of objects, determines collisions and distances\n \/\/ publishes the relationships between all of these objects\n i = 0;\n for(typename std::vector::iterator it1 = scenes.begin();\n it1 != scenes.end();\n ++it1, ++i)\n {\n\n collision_detection::CollisionRobotConstPtr robot1 = (*it1)->getCollisionRobot();\n\n\n typename std::vector::iterator it2 = it1;\n unsigned int j = i+1;\n for(++it2; it2 != scenes.end(); ++it2, ++j) {\n \/\/unsigned int j = 0;\n \/\/for(typename std::vector::iterator it2 = scenes.begin();\n \/\/ it2 != scenes.end();\n \/\/ ++it2, ++j)\n \/\/{\n\n \/\/if (i == j) continue;\n\n collision_detection::CollisionRobotConstPtr robot2 = (*it2)->getCollisionRobot();\n\n collision_detection::CollisionRequest req;\n collision_detection::CollisionResult res;\n req.contacts = true;\n req.max_contacts = 1000;\n\n \/\/ force an update\n \/\/ source: https:\/\/groups.google.com\/forum\/#!topic\/moveit-users\/O9CEef6sxbE\n states[i]->update(true);\n states[j]->update(true);\n robot1->checkOtherCollision(req, res, *states[i], *robot2, *states[j]);\n double dist = robot1->distanceOther(*states[i], *robot2, *states[j]);\n\n \/\/ write distance predicate\n predicator_msgs::PredicateStatement ps_dist;\n ps_dist.predicate = \"distance\";\n ps_dist.value = dist;\n ps_dist.num_params = 2;\n ps_dist.params[0] = robot1->getRobotModel()->getName();\n ps_dist.params[1] = robot2->getRobotModel()->getName();\n output.statements.push_back(ps_dist);\n\n \/\/ the reverse is also true, so write it as well\n predicator_msgs::PredicateStatement ps_dist2;\n ps_dist2.predicate = \"distance\";\n ps_dist2.value = dist;\n ps_dist2.num_params = 2;\n ps_dist2.params[0] = robot1->getRobotModel()->getName();\n ps_dist2.params[1] = robot2->getRobotModel()->getName();\n output.statements.push_back(ps_dist2);\n\n \/\/ iterate over all collisions\n for(collision_detection::CollisionResult::ContactMap::const_iterator cit = res.contacts.begin(); \n cit != res.contacts.end(); \n ++cit)\n {\n \/\/ write the correct predicate\n predicator_msgs::PredicateStatement ps;\n ps.predicate = \"touching\";\n ps.value = 1.0;\n ps.num_params = 2;\n ps.params[0] = cit->first.first;\n ps.params[1] = cit->first.second;\n output.statements.push_back(ps);\n\n \/\/ the reverse is also true, so update it\n predicator_msgs::PredicateStatement ps2;\n ps2.predicate = \"touching\";\n ps2.value = 1.0;\n ps2.num_params = 2;\n ps2.params[0] = cit->first.second;\n ps2.params[1] = cit->first.first;\n output.statements.push_back(ps2);\n }\n\n if (verbosity > 1) {\n std::cout << \"(\" << robot1->getRobotModel()->getName()\n << \", \" << robot2->getRobotModel()->getName()\n << \": Distance to collision: \" << dist << std::endl;\n }\n }\n }\n\n pub.publish(output);\n\n rate.sleep();\n }\n\n cleanup();\n}\n<|endoftext|>"} {"text":"\/** \\brief A MARC-21 filter uliity that replace URNs in 856u-fields with URLs\n * \\author Oliver Obenland (oliver.obenland@uni-tuebingen.de)\n * \\author Dr. Johannes Ruscheinski\n *\n * \\copyright 2016-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 .\n *\/\n\n#include \n#include \n#include \n#include \"MARC.h\"\n#include \"StringUtil.h\"\n#include \"util.h\"\n\n\nnamespace {\n\n\n[[noreturn]] void Usage() {\n std::cerr << \"Usage: \" << ::progname << \" [-v|--verbose] marc_input marc_output\\n\";\n std::exit(EXIT_FAILURE);\n}\n\n\ninline bool IsHttpOrHttpsURL(const std::string &url_candidate) {\n return StringUtil::StartsWith(url_candidate, \"http:\/\/\") or StringUtil::StartsWith(url_candidate, \"https:\/\/\");\n}\n\n\n\/\/ Returns the number of extracted 856u subfields.\nsize_t ExtractAllHttpOrHttps856uSubfields(const MARC::Record &record, std::vector * const _856u_urls) {\n for (const auto &_856_field : record.getTagRange(\"856\")) {\n const std::string _856u_subfield_value(_856_field.getSubfields().getFirstSubfieldWithCode('u'));\n if (IsHttpOrHttpsURL(_856u_subfield_value))\n _856u_urls->emplace_back(_856u_subfield_value);\n }\n\n return _856u_urls->size();\n}\n\n\n\/\/ Returns true if \"test_string\" is the suffix of \"url\" after stripping off the schema and domain name as well as\n\/\/ a single slash after the domain name.\nbool IsSuffixOfURL(const std::string &url, const std::string &test_string) {\n const bool starts_with_http(StringUtil::StartsWith(url, \"http:\/\/\"));\n if (not starts_with_http and not StringUtil::StartsWith(url, \"https:\/\/\"))\n return false;\n\n const size_t next_slash_pos(url.find('\/', starts_with_http ? std::strlen(\"http:\/\/\") : std::strlen(\"https:\/\/\")));\n if (unlikely(next_slash_pos == std::string::npos))\n return false;\n if (unlikely(next_slash_pos + 1 >= url.size()))\n return false; \/\/ We have no path component in our URL.\n\n return url.substr(next_slash_pos + 1) == test_string;\n}\n\n\n\/\/ Returns true if \"test_string\" is a proper suffix of any of the URLs contained in \"urls\".\nbool IsSuffixOfAnyURL(const std::vector &urls, const std::string &test_string) {\n for (const auto &url : urls) {\n if (IsSuffixOfURL(url, test_string))\n return true;\n }\n\n return false;\n}\n\n\nvoid CreateUrlsFrom024(MARC::Record * const record) {\n for (const auto &_024_field : record->getTagRange(\"024\")) {\n if (_024_field.getFirstSubfieldWithCode('2') == \"doi\") {\n const std::string doi(_024_field.getFirstSubfieldWithCode('a'));\n if (not doi.empty())\n record->insertField(\"856\", { { 'u', \"https:\/\/doi.org\/\" + doi }, { 'x', \"doi\" } });\n }\n }\n}\n\n\nvoid NormaliseURLs(const bool verbose, MARC::Reader * const reader, MARC::Writer * const writer) {\n unsigned count(0), modified_count(0), duplicate_skip_count(0);\n while (MARC::Record record = reader->read()) {\n ++count;\n\n CreateUrlsFrom024(&record);\n\n std::vector _856u_urls;\n ExtractAllHttpOrHttps856uSubfields(record, &_856u_urls);\n\n bool modified_record(false);\n std::unordered_set already_seen_links;\n\n auto _856_field(record.findTag(\"856\"));\n while (_856_field != record.end() and _856_field->getTag() == \"856\") {\n MARC::Subfields _856_subfields(_856_field->getSubfields());\n bool duplicate_link(false);\n if (_856_subfields.hasSubfield('u')) {\n const std::string u_subfield(StringUtil::Trim(_856_subfields.getFirstSubfieldWithCode('u')));\n\n if (IsHttpOrHttpsURL(u_subfield)) {\n if (already_seen_links.find(u_subfield) == already_seen_links.cend())\n already_seen_links.insert(u_subfield);\n else\n duplicate_link = true;\n } else if (IsSuffixOfAnyURL(_856u_urls, u_subfield)) {\n if (verbose)\n std::cout << \"Dropped field w\/ duplicate URL suffix. (\" << u_subfield << \")\";\n _856_field = record.erase(_856_field);\n continue;\n } else {\n std::string new_http_replacement_link;\n if (StringUtil::StartsWith(u_subfield, \"urn:\"))\n new_http_replacement_link = \"https:\/\/nbn-resolving.org\/\" + u_subfield;\n else if (StringUtil::StartsWith(u_subfield, \"10900\/\"))\n new_http_replacement_link = \"https:\/\/publikationen.uni-tuebingen.de\/xmlui\/handle\/\"\n + u_subfield;\n else\n new_http_replacement_link = \"http:\/\/\" + u_subfield;\n if (already_seen_links.find(new_http_replacement_link) == already_seen_links.cend()) {\n _856_subfields.replaceFirstSubfield('u', new_http_replacement_link);\n if (verbose)\n std::cout << \"Replaced \\\"\" << u_subfield << \"\\\" with \\\"\" << new_http_replacement_link\n << \"\\\". (PPN: \" << record.getControlNumber() << \")\\n\";\n already_seen_links.insert(new_http_replacement_link);\n modified_record = true;\n } else\n duplicate_link = true;\n }\n }\n\n if (not duplicate_link)\n ++_856_field;\n else {\n ++duplicate_skip_count;\n if (verbose)\n std::cout << \"Skipping duplicate, control numbers is \" << record.getControlNumber() << \".\\n\";\n _856_field = record.erase(_856_field);\n modified_record = true;\n }\n }\n\n if (modified_record)\n ++modified_count;\n\n writer->write(record);\n }\n\n std::cerr << \"Read \" << count << \" records.\\n\";\n std::cerr << \"Modified \" << modified_count << \" record(s).\\n\";\n std::cerr << \"Skipped \" << duplicate_skip_count << \" duplicate links.\\n\";\n}\n\n\n} \/\/ unnamed namespace\n\n\nint Main(int argc, char **argv) {\n if (argc < 2)\n Usage();\n\n const bool verbose(std::strcmp(\"-v\", argv[1]) == 0 or std::strcmp(\"--verbose\", argv[1]) == 0);\n if (verbose)\n --argc, ++argv;\n\n if (argc < 2)\n Usage();\n\n if (argc != 3)\n Usage();\n\n auto marc_reader(MARC::Reader::Factory(argv[1]));\n auto marc_writer(MARC::Writer::Factory(argv[2]));\n NormaliseURLs(verbose, marc_reader.get(), marc_writer.get());\n\n return EXIT_SUCCESS;\n}\nFixed reporting.\/** \\brief A MARC-21 filter uliity that replace URNs in 856u-fields with URLs\n * \\author Oliver Obenland (oliver.obenland@uni-tuebingen.de)\n * \\author Dr. Johannes Ruscheinski\n *\n * \\copyright 2016-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 .\n *\/\n\n#include \n#include \n#include \n#include \"MARC.h\"\n#include \"StringUtil.h\"\n#include \"util.h\"\n\n\nnamespace {\n\n\n[[noreturn]] void Usage() {\n std::cerr << \"Usage: \" << ::progname << \" [-v|--verbose] marc_input marc_output\\n\";\n std::exit(EXIT_FAILURE);\n}\n\n\ninline bool IsHttpOrHttpsURL(const std::string &url_candidate) {\n return StringUtil::StartsWith(url_candidate, \"http:\/\/\") or StringUtil::StartsWith(url_candidate, \"https:\/\/\");\n}\n\n\n\/\/ Returns the number of extracted 856u subfields.\nsize_t ExtractAllHttpOrHttps856uSubfields(const MARC::Record &record, std::vector * const _856u_urls) {\n for (const auto &_856_field : record.getTagRange(\"856\")) {\n const std::string _856u_subfield_value(_856_field.getSubfields().getFirstSubfieldWithCode('u'));\n if (IsHttpOrHttpsURL(_856u_subfield_value))\n _856u_urls->emplace_back(_856u_subfield_value);\n }\n\n return _856u_urls->size();\n}\n\n\n\/\/ Returns true if \"test_string\" is the suffix of \"url\" after stripping off the schema and domain name as well as\n\/\/ a single slash after the domain name.\nbool IsSuffixOfURL(const std::string &url, const std::string &test_string) {\n const bool starts_with_http(StringUtil::StartsWith(url, \"http:\/\/\"));\n if (not starts_with_http and not StringUtil::StartsWith(url, \"https:\/\/\"))\n return false;\n\n const size_t next_slash_pos(url.find('\/', starts_with_http ? std::strlen(\"http:\/\/\") : std::strlen(\"https:\/\/\")));\n if (unlikely(next_slash_pos == std::string::npos))\n return false;\n if (unlikely(next_slash_pos + 1 >= url.size()))\n return false; \/\/ We have no path component in our URL.\n\n return url.substr(next_slash_pos + 1) == test_string;\n}\n\n\n\/\/ Returns true if \"test_string\" is a proper suffix of any of the URLs contained in \"urls\".\nbool IsSuffixOfAnyURL(const std::vector &urls, const std::string &test_string) {\n for (const auto &url : urls) {\n if (IsSuffixOfURL(url, test_string))\n return true;\n }\n\n return false;\n}\n\n\nbool CreateUrlsFrom024(MARC::Record * const record) {\n bool added_at_least_one_url(false);\n\n for (const auto &_024_field : record->getTagRange(\"024\")) {\n if (_024_field.getFirstSubfieldWithCode('2') == \"doi\") {\n const std::string doi(_024_field.getFirstSubfieldWithCode('a'));\n if (not doi.empty()) {\n record->insertField(\"856\", { { 'u', \"https:\/\/doi.org\/\" + doi }, { 'x', \"doi\" } });\n added_at_least_one_url = true;\n }\n }\n }\n\n return added_at_least_one_url;\n}\n\n\nvoid NormaliseURLs(const bool verbose, MARC::Reader * const reader, MARC::Writer * const writer) {\n unsigned count(0), modified_count(0), duplicate_skip_count(0);\n while (MARC::Record record = reader->read()) {\n ++count;\n\n bool modified_record(false);\n if (CreateUrlsFrom024(&record))\n modified_record = true;\n\n std::vector _856u_urls;\n ExtractAllHttpOrHttps856uSubfields(record, &_856u_urls);\n\n std::unordered_set already_seen_links;\n\n auto _856_field(record.findTag(\"856\"));\n while (_856_field != record.end() and _856_field->getTag() == \"856\") {\n MARC::Subfields _856_subfields(_856_field->getSubfields());\n bool duplicate_link(false);\n if (_856_subfields.hasSubfield('u')) {\n const std::string u_subfield(StringUtil::Trim(_856_subfields.getFirstSubfieldWithCode('u')));\n\n if (IsHttpOrHttpsURL(u_subfield)) {\n if (already_seen_links.find(u_subfield) == already_seen_links.cend())\n already_seen_links.insert(u_subfield);\n else\n duplicate_link = true;\n } else if (IsSuffixOfAnyURL(_856u_urls, u_subfield)) {\n if (verbose)\n std::cout << \"Dropped field w\/ duplicate URL suffix. (\" << u_subfield << \")\";\n _856_field = record.erase(_856_field);\n continue;\n } else {\n std::string new_http_replacement_link;\n if (StringUtil::StartsWith(u_subfield, \"urn:\"))\n new_http_replacement_link = \"https:\/\/nbn-resolving.org\/\" + u_subfield;\n else if (StringUtil::StartsWith(u_subfield, \"10900\/\"))\n new_http_replacement_link = \"https:\/\/publikationen.uni-tuebingen.de\/xmlui\/handle\/\"\n + u_subfield;\n else\n new_http_replacement_link = \"http:\/\/\" + u_subfield;\n if (already_seen_links.find(new_http_replacement_link) == already_seen_links.cend()) {\n _856_subfields.replaceFirstSubfield('u', new_http_replacement_link);\n if (verbose)\n std::cout << \"Replaced \\\"\" << u_subfield << \"\\\" with \\\"\" << new_http_replacement_link\n << \"\\\". (PPN: \" << record.getControlNumber() << \")\\n\";\n already_seen_links.insert(new_http_replacement_link);\n modified_record = true;\n } else\n duplicate_link = true;\n }\n }\n\n if (not duplicate_link)\n ++_856_field;\n else {\n ++duplicate_skip_count;\n if (verbose)\n std::cout << \"Skipping duplicate, control numbers is \" << record.getControlNumber() << \".\\n\";\n _856_field = record.erase(_856_field);\n modified_record = true;\n }\n }\n\n if (modified_record)\n ++modified_count;\n\n writer->write(record);\n }\n\n std::cerr << \"Read \" << count << \" records.\\n\";\n std::cerr << \"Modified \" << modified_count << \" record(s).\\n\";\n std::cerr << \"Skipped \" << duplicate_skip_count << \" duplicate links.\\n\";\n}\n\n\n} \/\/ unnamed namespace\n\n\nint Main(int argc, char **argv) {\n if (argc < 2)\n Usage();\n\n const bool verbose(std::strcmp(\"-v\", argv[1]) == 0 or std::strcmp(\"--verbose\", argv[1]) == 0);\n if (verbose)\n --argc, ++argv;\n\n if (argc < 2)\n Usage();\n\n if (argc != 3)\n Usage();\n\n auto marc_reader(MARC::Reader::Factory(argv[1]));\n auto marc_writer(MARC::Writer::Factory(argv[2]));\n NormaliseURLs(verbose, marc_reader.get(), marc_writer.get());\n\n return EXIT_SUCCESS;\n}\n<|endoftext|>"} {"text":"\/** \\file rss_aggregator.cc\n * \\brief Downloads and aggregates RSS feeds.\n * \\author Dr. Johannes Ruscheinski (johannes.ruscheinski@uni-tuebingen.de)\n *\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 .\n *\/\n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \"Compiler.h\"\n#include \"DbConnection.h\"\n#include \"DbResultSet.h\"\n#include \"Downloader.h\"\n#include \"IniFile.h\"\n#include \"SignalUtil.h\"\n#include \"StringUtil.h\"\n#include \"SyndicationFormat.h\"\n#include \"util.h\"\n\n\nnamespace {\n\n\nvolatile sig_atomic_t sigterm_seen = false;\n\n\nvoid SigTermHandler(int \/* signum *\/) {\n sigterm_seen = true;\n}\n\n\nvolatile sig_atomic_t sighup_seen = false;\n\n\nvoid SigHupHandler(int \/* signum *\/) {\n sighup_seen = true;\n}\n\n\n[[noreturn]] void Usage() {\n std::cerr << \"Usage: \" << ::progname\n << \" [--verbosity=min_verbosity] [--test] xml_output_path\\n\"\n << \" When --test has been specified no data will be stored.\\n\";\n std::exit(EXIT_FAILURE);\n}\n\n\n\/\/ These must be in sync with the sizes in data\/ub_tools.sql (rss_aggregator table)\nconst size_t MAX_ITEM_ID_LENGTH(100);\nconst size_t MAX_ITEM_URL_LENGTH(512);\nconst size_t MAX_SERIAL_NAME_LENGTH(200);\n\n\n\/\/ \\return true if the item was new, else false.\nbool ProcessRSSItem(const SyndicationFormat::Item &item, const std::string §ion_name, DbConnection * const db_connection) {\n const std::string item_id(item.getId());\n db_connection->queryOrDie(\"SELECT insertion_time FROM rss_aggregator WHERE item_id='\" + db_connection->escapeString(item_id) + \"'\");\n const DbResultSet result_set(db_connection->getLastResultSet());\n if (not result_set.empty())\n return false;\n\n const std::string item_url(item.getLink());\n if (item_url.empty()) {\n LOG_WARNING(\"got an item w\/o a URL, ID is \\\"\" + item.getId());\n return false;\n }\n\n std::string title_and_or_description(item.getTitle());\n if (title_and_or_description.empty())\n title_and_or_description = item.getDescription();\n else {\n const std::string description(item.getDescription());\n if (not description.empty())\n title_and_or_description += \" (\" + description + \")\";\n }\n\n db_connection->queryOrDie(\"INSERT INTO rss_aggregator SET item_id='\"\n + db_connection->escapeString(StringUtil::Truncate(MAX_ITEM_ID_LENGTH, item_id)) + \"',\" + \"item_url='\"\n + db_connection->escapeString(StringUtil::Truncate(MAX_ITEM_URL_LENGTH, item_url))\n + \"',title_and_or_description='\" + db_connection->escapeString(title_and_or_description) + \", serial_name='\"\n + db_connection->escapeString(StringUtil::Truncate(MAX_SERIAL_NAME_LENGTH, section_name)) + \"'\");\n\n return true;\n}\n\n\nvoid CheckForSigTermAndExitIfSeen() {\n if (sigterm_seen) {\n LOG_WARNING(\"caught SIGTERM, existing...\");\n std::exit(EXIT_SUCCESS);\n }\n}\n\n\nvoid CheckForSigHupAndReloadIniFileIfSeen(IniFile * const ini_file) {\n if (sighup_seen) {\n LOG_WARNING(\"caught SIGHUP, reloading config file...\");\n ini_file->reload();\n sighup_seen = false;\n }\n}\n\n\nstd::unordered_map section_name_to_ticks_map;\n\n\n\/\/ \\return the number of new items.\nunsigned ProcessSection(const IniFile::Section §ion, Downloader * const downloader, DbConnection * const db_connection,\n const unsigned default_downloader_time_limit, const unsigned default_poll_interval, const uint64_t now)\n{\n const std::string feed_url(section.getString(\"feed_url\"));\n const unsigned poll_interval(section.getUnsigned(\"poll_interval\", default_poll_interval));\n const unsigned downloader_time_limit(section.getUnsigned(\"downloader_time_limit\", default_downloader_time_limit) * 1000);\n\n const std::string §ion_name(section.getSectionName());\n const auto section_name_and_ticks(section_name_to_ticks_map.find(section_name));\n if (section_name_and_ticks != section_name_to_ticks_map.end()) {\n if (section_name_and_ticks->second + poll_interval < now) {\n LOG_DEBUG(section_name + \": not yet time to do work, last work was done at \" + std::to_string(section_name_and_ticks->second)\n + \".\");\n return 0;\n }\n }\n\n unsigned new_item_count(0);\n SignalUtil::SignalBlocker sigterm_blocker(SIGTERM);\n if (not downloader->newUrl(feed_url, downloader_time_limit))\n LOG_WARNING(section_name + \": failed to download the feed: \" + downloader->getLastErrorMessage());\n else {\n sigterm_blocker.unblock();\n CheckForSigTermAndExitIfSeen();\n\n std::string error_message;\n std::unique_ptr syndication_format(SyndicationFormat::Factory(downloader->getMessageBody(), &error_message));\n if (unlikely(syndication_format == nullptr))\n LOG_WARNING(\"failed to parse feed: \" + error_message);\n else {\n for (const auto &item : *syndication_format) {\n CheckForSigTermAndExitIfSeen();\n SignalUtil::SignalBlocker sigterm_blocker2(SIGTERM);\n\n if (ProcessRSSItem(item, section_name, db_connection))\n ++new_item_count;\n }\n }\n }\n\n section_name_to_ticks_map[section_name] = now;\n return new_item_count;\n}\n\n\nconst std::string CONF_FILE_PATH(\"\/usr\/local\/var\/lib\/tuelib\/rss_aggregator.conf\");\n\n\n} \/\/ unnamed namespace\n\n\nint Main(int argc, char *argv[]) {\n ::progname = argv[0];\n\n if (argc != 2 and argc != 3)\n Usage();\n\n bool test(false);\n if (argc == 3) {\n if (std::strcmp(argv[1], \"--test\") == 0) {\n test = true;\n --argc, ++argv;\n } else\n Usage();\n }\n\n IniFile ini_file(CONF_FILE_PATH);\n DbConnection db_connection(ini_file);\n\n const unsigned DEFAULT_POLL_INTERVAL(ini_file.getUnsigned(\"\", \"default_poll_interval\"));\n const unsigned DEFAULT_DOWNLOADER_TIME_LIMIT(ini_file.getUnsigned(\"\", \"default_downloader_time_limit\"));\n const unsigned UPDATE_INTERVAL(ini_file.getUnsigned(\"\", \"update_interval\"));\n\n if (not test) {\n SignalUtil::InstallHandler(SIGTERM, SigTermHandler);\n SignalUtil::InstallHandler(SIGHUP, SigHupHandler);\n\n if (::daemon(0, 1 \/* do not close file descriptors and redirect to \/dev\/null *\/) != 0)\n LOG_ERROR(\"we failed to deamonize our process!\");\n }\n\n uint64_t ticks(0);\n Downloader downloader;\n for (;;) {\n LOG_DEBUG(\"now we're at \" + std::to_string(ticks) + \".\");\n\n CheckForSigHupAndReloadIniFileIfSeen(&ini_file);\n\n const time_t before(std::time(nullptr));\n\n std::unordered_set already_seen_sections;\n for (const auto §ion : ini_file) {\n if (sigterm_seen) {\n LOG_INFO(\"caught SIGTERM, shutting down...\");\n return EXIT_SUCCESS;\n }\n\n SignalUtil::SignalBlocker sighup_blocker(SIGHUP);\n\n const std::string §ion_name(section.first);\n if (not section_name.empty() and section_name != \"CGI Params\") {\n if (unlikely(already_seen_sections.find(section_name) != already_seen_sections.end()))\n LOG_ERROR(\"duplicate section: \\\"\" + section_name + \"\\\"!\");\n already_seen_sections.emplace(section_name);\n\n LOG_INFO(\"Processing section \\\"\" + section_name + \"\\\".\");\n const unsigned new_item_count(ProcessSection(section.second, &downloader, &db_connection, DEFAULT_DOWNLOADER_TIME_LIMIT,\n DEFAULT_POLL_INTERVAL, ticks));\n LOG_INFO(\"found \" + std::to_string(new_item_count) + \" new items.\");\n }\n }\n\n if (test) \/\/ -> only run through our loop once\n return EXIT_SUCCESS;\n\n const time_t after(std::time(nullptr));\n\n uint64_t sleep_interval;\n if (after - before > UPDATE_INTERVAL * 60)\n sleep_interval = 0;\n else\n sleep_interval = (UPDATE_INTERVAL * 60 - (after - before));\n\n unsigned total_time_slept(0);\n do {\n const unsigned actual_time_slept(::sleep(static_cast(sleep_interval - total_time_slept)));\n CheckForSigTermAndExitIfSeen();\n CheckForSigHupAndReloadIniFileIfSeen(&ini_file);\n\n total_time_slept += actual_time_slept;\n } while (total_time_slept < sleep_interval);\n ticks += UPDATE_INTERVAL;\n }\n}\nUpdate rss_aggregator.cc\/** \\file rss_aggregator.cc\n * \\brief Downloads and aggregates RSS feeds.\n * \\author Dr. Johannes Ruscheinski (johannes.ruscheinski@uni-tuebingen.de)\n *\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 .\n *\/\n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \"Compiler.h\"\n#include \"DbConnection.h\"\n#include \"DbResultSet.h\"\n#include \"Downloader.h\"\n#include \"IniFile.h\"\n#include \"SignalUtil.h\"\n#include \"StringUtil.h\"\n#include \"SyndicationFormat.h\"\n#include \"util.h\"\n\n\nnamespace {\n\n\nvolatile sig_atomic_t sigterm_seen = false;\n\n\nvoid SigTermHandler(int \/* signum *\/) {\n sigterm_seen = true;\n}\n\n\nvolatile sig_atomic_t sighup_seen = false;\n\n\nvoid SigHupHandler(int \/* signum *\/) {\n sighup_seen = true;\n}\n\n\n[[noreturn]] void Usage() {\n std::cerr << \"Usage: \" << ::progname\n << \" [--verbosity=min_verbosity] [--test] xml_output_path\\n\"\n << \" When --test has been specified no data will be stored.\\n\";\n std::exit(EXIT_FAILURE);\n}\n\n\n\/\/ These must be in sync with the sizes in data\/ub_tools.sql (rss_aggregator table)\nconst size_t MAX_ITEM_ID_LENGTH(100);\nconst size_t MAX_ITEM_URL_LENGTH(512);\nconst size_t MAX_SERIAL_NAME_LENGTH(200);\n\n\n\/\/ \\return true if the item was new, else false.\nbool ProcessRSSItem(const SyndicationFormat::Item &item, const std::string §ion_name, DbConnection * const db_connection) {\n const std::string item_id(item.getId());\n db_connection->queryOrDie(\"SELECT insertion_time FROM rss_aggregator WHERE item_id='\" + db_connection->escapeString(item_id) + \"'\");\n const DbResultSet result_set(db_connection->getLastResultSet());\n if (not result_set.empty())\n return false;\n\n const std::string item_url(item.getLink());\n if (item_url.empty()) {\n LOG_WARNING(\"got an item w\/o a URL, ID is \\\"\" + item.getId());\n return false;\n }\n\n std::string title_and_or_description(item.getTitle());\n if (title_and_or_description.empty())\n title_and_or_description = item.getDescription();\n else {\n const std::string description(item.getDescription());\n if (not description.empty())\n title_and_or_description += \" (\" + description + \")\";\n }\n\n db_connection->queryOrDie(\"INSERT INTO rss_aggregator SET item_id='\"\n + db_connection->escapeString(StringUtil::Truncate(MAX_ITEM_ID_LENGTH, item_id)) + \"',\" + \"item_url='\"\n + db_connection->escapeString(StringUtil::Truncate(MAX_ITEM_URL_LENGTH, item_url))\n + \"',title_and_or_description='\" + db_connection->escapeString(title_and_or_description) + \", serial_name='\"\n + db_connection->escapeString(StringUtil::Truncate(MAX_SERIAL_NAME_LENGTH, section_name)) + \"'\");\n\n return true;\n}\n\n\nvoid CheckForSigTermAndExitIfSeen() {\n if (sigterm_seen) {\n LOG_WARNING(\"caught SIGTERM, exiting...\");\n std::exit(EXIT_SUCCESS);\n }\n}\n\n\nvoid CheckForSigHupAndReloadIniFileIfSeen(IniFile * const ini_file) {\n if (sighup_seen) {\n LOG_INFO(\"caught SIGHUP, reloading config file...\");\n ini_file->reload();\n sighup_seen = false;\n }\n}\n\n\nstd::unordered_map section_name_to_ticks_map;\n\n\n\/\/ \\return the number of new items.\nunsigned ProcessSection(const IniFile::Section §ion, Downloader * const downloader, DbConnection * const db_connection,\n const unsigned default_downloader_time_limit, const unsigned default_poll_interval, const uint64_t now)\n{\n const std::string feed_url(section.getString(\"feed_url\"));\n const unsigned poll_interval(section.getUnsigned(\"poll_interval\", default_poll_interval));\n const unsigned downloader_time_limit(section.getUnsigned(\"downloader_time_limit\", default_downloader_time_limit) * 1000);\n\n const std::string §ion_name(section.getSectionName());\n const auto section_name_and_ticks(section_name_to_ticks_map.find(section_name));\n if (section_name_and_ticks != section_name_to_ticks_map.end()) {\n if (section_name_and_ticks->second + poll_interval < now) {\n LOG_DEBUG(section_name + \": not yet time to do work, last work was done at \" + std::to_string(section_name_and_ticks->second)\n + \".\");\n return 0;\n }\n }\n\n unsigned new_item_count(0);\n SignalUtil::SignalBlocker sigterm_blocker(SIGTERM);\n if (not downloader->newUrl(feed_url, downloader_time_limit))\n LOG_WARNING(section_name + \": failed to download the feed: \" + downloader->getLastErrorMessage());\n else {\n sigterm_blocker.unblock();\n CheckForSigTermAndExitIfSeen();\n\n std::string error_message;\n std::unique_ptr syndication_format(SyndicationFormat::Factory(downloader->getMessageBody(), &error_message));\n if (unlikely(syndication_format == nullptr))\n LOG_WARNING(\"failed to parse feed: \" + error_message);\n else {\n for (const auto &item : *syndication_format) {\n CheckForSigTermAndExitIfSeen();\n SignalUtil::SignalBlocker sigterm_blocker2(SIGTERM);\n\n if (ProcessRSSItem(item, section_name, db_connection))\n ++new_item_count;\n }\n }\n }\n\n section_name_to_ticks_map[section_name] = now;\n return new_item_count;\n}\n\n\nconst std::string CONF_FILE_PATH(\"\/usr\/local\/var\/lib\/tuelib\/rss_aggregator.conf\");\n\n\n} \/\/ unnamed namespace\n\n\nint Main(int argc, char *argv[]) {\n ::progname = argv[0];\n\n if (argc != 2 and argc != 3)\n Usage();\n\n bool test(false);\n if (argc == 3) {\n if (std::strcmp(argv[1], \"--test\") == 0) {\n test = true;\n --argc, ++argv;\n } else\n Usage();\n }\n\n IniFile ini_file(CONF_FILE_PATH);\n DbConnection db_connection(ini_file);\n\n const unsigned DEFAULT_POLL_INTERVAL(ini_file.getUnsigned(\"\", \"default_poll_interval\"));\n const unsigned DEFAULT_DOWNLOADER_TIME_LIMIT(ini_file.getUnsigned(\"\", \"default_downloader_time_limit\"));\n const unsigned UPDATE_INTERVAL(ini_file.getUnsigned(\"\", \"update_interval\"));\n\n if (not test) {\n SignalUtil::InstallHandler(SIGTERM, SigTermHandler);\n SignalUtil::InstallHandler(SIGHUP, SigHupHandler);\n\n if (::daemon(0, 1 \/* do not close file descriptors and redirect to \/dev\/null *\/) != 0)\n LOG_ERROR(\"we failed to deamonize our process!\");\n }\n\n uint64_t ticks(0);\n Downloader downloader;\n for (;;) {\n LOG_DEBUG(\"now we're at \" + std::to_string(ticks) + \".\");\n\n CheckForSigHupAndReloadIniFileIfSeen(&ini_file);\n\n const time_t before(std::time(nullptr));\n\n std::unordered_set already_seen_sections;\n for (const auto §ion : ini_file) {\n if (sigterm_seen) {\n LOG_INFO(\"caught SIGTERM, shutting down...\");\n return EXIT_SUCCESS;\n }\n\n SignalUtil::SignalBlocker sighup_blocker(SIGHUP);\n\n const std::string §ion_name(section.first);\n if (not section_name.empty() and section_name != \"CGI Params\") {\n if (unlikely(already_seen_sections.find(section_name) != already_seen_sections.end()))\n LOG_ERROR(\"duplicate section: \\\"\" + section_name + \"\\\"!\");\n already_seen_sections.emplace(section_name);\n\n LOG_INFO(\"Processing section \\\"\" + section_name + \"\\\".\");\n const unsigned new_item_count(ProcessSection(section.second, &downloader, &db_connection, DEFAULT_DOWNLOADER_TIME_LIMIT,\n DEFAULT_POLL_INTERVAL, ticks));\n LOG_INFO(\"found \" + std::to_string(new_item_count) + \" new items.\");\n }\n }\n\n if (test) \/\/ -> only run through our loop once\n return EXIT_SUCCESS;\n\n const time_t after(std::time(nullptr));\n\n uint64_t sleep_interval;\n if (after - before > UPDATE_INTERVAL * 60)\n sleep_interval = 0;\n else\n sleep_interval = (UPDATE_INTERVAL * 60 - (after - before));\n\n unsigned total_time_slept(0);\n do {\n const unsigned actual_time_slept(::sleep(static_cast(sleep_interval - total_time_slept)));\n CheckForSigTermAndExitIfSeen();\n CheckForSigHupAndReloadIniFileIfSeen(&ini_file);\n\n total_time_slept += actual_time_slept;\n } while (total_time_slept < sleep_interval);\n ticks += UPDATE_INTERVAL;\n }\n}\n<|endoftext|>"} {"text":"\/** \\file system_updater.cc\n * \\brief Runs scripts from \/usr\/local\/ub_tools\/data\/system_updates\n * \\author Dr. Johannes Ruscheinski (johannes.ruscheinski@uni-tuebingen.de)\n *\n * \\copyright 2017-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 .\n*\/\n\n#include \n#include \n#include \n#include \"DbConnection.h\"\n#include \"ExecUtil.h\"\n#include \"FileUtil.h\"\n#include \"StringUtil.h\"\n#include \"UBTools.h\"\n#include \"util.h\"\n\nnamespace {\n\n\nconst std::string VERSION_PATH(UBTools::GetTuelibPath() + \"system_version\");\n\n\nunsigned GetCurrentVersion() {\n if (not FileUtil::Exists(VERSION_PATH))\n return 0;\n\n const auto version_number_string(StringUtil::TrimWhite(FileUtil::ReadStringOrDie(VERSION_PATH)));\n\n unsigned version;\n if (not StringUtil::ToUnsigned(version_number_string, &version))\n LOG_ERROR(\"can't convert the contents of \\\"\" + VERSION_PATH + \"\\\" to an unsigned number! (\\\"\" + version_number_string + \"\\\")\");\n\n return version;\n}\n\n\nunsigned GetVersionFromScriptName(const std::string &script_name) {\n const auto basename(FileUtil::GetBasename(script_name));\n if (StringUtil::EndsWith(script_name, \".sh\", true) or StringUtil::EndsWith(script_name, \".sql\", true))\n return StringUtil::ToUnsignedOrDie(script_name.substr(0, script_name.find('.')));\n else\n LOG_ERROR(\"unexpected script name: \\\"\" + script_name + \"\\\"!\");\n}\n\n\n\/\/ \\return True if the version number of \"script_name1\" is smaller then the version number\n\/\/ of \"script_name2\".\ninline bool ScriptLessThan(const std::string &script_name1, const std::string &script_name2) {\n return GetVersionFromScriptName(script_name1) < GetVersionFromScriptName(script_name2);\n}\n\n\nvoid SplitIntoDatabaseAndVersion(const std::string &update_filename, std::string * const database, unsigned * const version) {\n const auto first_dot_pos(update_filename.find('.'));\n if (first_dot_pos == std::string::npos or first_dot_pos == 0 or first_dot_pos == update_filename.length() - 1)\n LOG_ERROR(\"invalid update filename \\\"\" + update_filename + \"\\\"!\");\n\n if (not StringUtil::ToUnsigned(update_filename.substr(0, first_dot_pos), version))\n LOG_ERROR(\"bad or missing version in update filename \\\"\" + update_filename + \"\\\"!\");\n *database = update_filename.substr(first_dot_pos + 1, update_filename.find_last_of('.') - (first_dot_pos + 1));\n}\n\n\nvoid ApplyDatabaseUpdate(DbConnection * const db_connection, const std::string &update_directory_path,\n const std::string &update_filename, std::string * const current_schema, const std::string &last_schema)\n{\n std::string database;\n unsigned update_version;\n SplitIntoDatabaseAndVersion(update_filename, &database, &update_version);\n *current_schema = database;\n\n if (not db_connection->mySQLDatabaseExists(database)) {\n LOG_WARNING(\"database \\\"\" + database + \"\\\" does not exist, skipping file \" + update_filename);\n return;\n }\n\n if (last_schema.empty() or database != last_schema) {\n LOG_INFO(\"switching to database: \" + database);\n db_connection->queryOrDie(\"USE \" + database);\n }\n\n LOG_INFO(\"applying update \" + std::to_string(update_version) + \" to database \\\"\" + database + \"\\\".\");\n db_connection->queryFileOrDie(update_directory_path + \"\/\" + update_filename);\n}\n\n\n} \/\/ unnamed namespace\n\n\nint Main(int argc, char *argv[]) {\n if (argc != 2)\n ::Usage(\"path_to_update_scripts\");\n\n bool dry_run = false;\n\n DbConnection db_connection(DbConnection::UBToolsFactory());\n const auto current_version(GetCurrentVersion());\n\n std::vector script_names;\n const std::string SYSTEM_UPDATES_DIR(argv[1]);\n FileUtil::Directory system_updates_dir(SYSTEM_UPDATES_DIR, \"(^\\\\d+\\\\.sh$|\\\\d+\\\\.(?:.*)\\\\.sql)\");\n for (const auto &entry : system_updates_dir) {\n const unsigned script_version = GetVersionFromScriptName(entry.getName());\n if (script_version < 100)\n LOG_WARNING(\"script version \" + std::to_string(script_version) + \" might belong to the old update schema and is no longer supported\");\n else if (script_version > current_version)\n script_names.emplace_back(entry.getName());\n }\n if (script_names.empty()) {\n if (current_version < 100) {\n LOG_INFO(\"Setting current version to 99\");\n FileUtil::WriteStringOrDie(VERSION_PATH, \"99\");\n }\n LOG_INFO(\"nothing to be done!\");\n return EXIT_SUCCESS;\n }\n\n std::sort(script_names.begin(), script_names.end(), ScriptLessThan);\n std::string last_schema, current_schema;\n int last_version_number = -1;\n\n for (const auto &script_name : script_names) {\n LOG_INFO(\"Running \" + script_name);\n const unsigned version_number(GetVersionFromScriptName(script_name));\n\n if (last_version_number == (int) version_number)\n LOG_ERROR(\"the number \" + std::to_string(version_number) + \" was used multiple times.\");\n else\n last_version_number = version_number;\n\n if (StringUtil::EndsWith(script_name, \".sh\", true)) {\n if (dry_run)\n std::cout << SYSTEM_UPDATES_DIR << \"---\" << script_name << std::endl;\n else\n ExecUtil::ExecOrDie(SYSTEM_UPDATES_DIR + \"\/\" + script_name);\n }\n else if (StringUtil::EndsWith(script_name, \".sql\", true)) {\n if (dry_run)\n std::cout << SYSTEM_UPDATES_DIR << \" \" << script_name << std::endl;\n else\n ApplyDatabaseUpdate(&db_connection, SYSTEM_UPDATES_DIR, script_name, ¤t_schema, last_schema);\n last_schema = current_schema;\n }\n else {\n LOG_WARNING(\"unable to process file: \\\"\" + script_name + \"\\\" - skipping file\");\n continue;\n }\n\n \/\/ We want to write the version number after each script\n \/\/ in case anything goes wrong, to avoid double execution\n \/\/ of successfully run scripts\n FileUtil::WriteStringOrDie(VERSION_PATH, std::to_string(version_number));\n }\n\n return EXIT_SUCCESS;\n}\nchanges after code review\/** \\file system_updater.cc\n * \\brief Runs scripts from \/usr\/local\/ub_tools\/data\/system_updates\n * \\author Dr. Johannes Ruscheinski (johannes.ruscheinski@uni-tuebingen.de)\n *\n * \\copyright 2017-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 .\n*\/\n\n#include \n#include \n#include \n#include \"DbConnection.h\"\n#include \"ExecUtil.h\"\n#include \"FileUtil.h\"\n#include \"StringUtil.h\"\n#include \"UBTools.h\"\n#include \"util.h\"\n\nnamespace {\n\n\nconst std::string VERSION_PATH(UBTools::GetTuelibPath() + \"system_version\");\n\n\nunsigned GetCurrentVersion() {\n if (not FileUtil::Exists(VERSION_PATH))\n return 0;\n\n const auto version_number_string(StringUtil::TrimWhite(FileUtil::ReadStringOrDie(VERSION_PATH)));\n\n unsigned version;\n if (not StringUtil::ToUnsigned(version_number_string, &version))\n LOG_ERROR(\"can't convert the contents of \\\"\" + VERSION_PATH + \"\\\" to an unsigned number! (\\\"\" + version_number_string + \"\\\")\");\n\n return version;\n}\n\n\nunsigned GetVersionFromScriptName(const std::string &script_name) {\n const auto basename(FileUtil::GetBasename(script_name));\n if (StringUtil::EndsWith(script_name, \".sh\", true) or StringUtil::EndsWith(script_name, \".sql\", true))\n return StringUtil::ToUnsignedOrDie(script_name.substr(0, script_name.find('.')));\n else\n LOG_ERROR(\"unexpected script name: \\\"\" + script_name + \"\\\"!\");\n}\n\n\n\/\/ \\return True if the version number of \"script_name1\" is smaller then the version number\n\/\/ of \"script_name2\".\ninline bool ScriptLessThan(const std::string &script_name1, const std::string &script_name2) {\n return GetVersionFromScriptName(script_name1) < GetVersionFromScriptName(script_name2);\n}\n\n\nvoid SplitIntoDatabaseAndVersion(const std::string &update_filename, std::string * const database, unsigned * const version) {\n const auto first_dot_pos(update_filename.find('.'));\n if (first_dot_pos == std::string::npos or first_dot_pos == 0 or first_dot_pos == update_filename.length() - 1)\n LOG_ERROR(\"invalid update filename \\\"\" + update_filename + \"\\\"!\");\n\n if (not StringUtil::ToUnsigned(update_filename.substr(0, first_dot_pos), version))\n LOG_ERROR(\"bad or missing version in update filename \\\"\" + update_filename + \"\\\"!\");\n *database = update_filename.substr(first_dot_pos + 1, update_filename.find_last_of('.') - (first_dot_pos + 1));\n}\n\n\nvoid ApplyDatabaseUpdate(DbConnection * const db_connection, const std::string &update_directory_path,\n const std::string &update_filename, std::string * const current_schema, const std::string &last_schema)\n{\n std::string database;\n unsigned update_version;\n SplitIntoDatabaseAndVersion(update_filename, &database, &update_version);\n *current_schema = database;\n\n if (not db_connection->mySQLDatabaseExists(database)) {\n LOG_WARNING(\"database \\\"\" + database + \"\\\" does not exist, skipping file \" + update_filename);\n return;\n }\n\n if (last_schema.empty() or database != last_schema) {\n LOG_INFO(\"switching to database: \" + database);\n db_connection->queryOrDie(\"USE \" + database);\n }\n\n LOG_INFO(\"applying update \" + std::to_string(update_version) + \" to database \\\"\" + database + \"\\\".\");\n db_connection->queryFileOrDie(update_directory_path + \"\/\" + update_filename);\n}\n\n\n} \/\/ unnamed namespace\n\n\nint Main(int argc, char *argv[]) {\n if (argc != 2)\n ::Usage(\"path_to_update_scripts\");\n\n bool dry_run = false;\n\n DbConnection db_connection(DbConnection::UBToolsFactory());\n const auto current_version(GetCurrentVersion());\n\n std::vector script_names;\n const std::string SYSTEM_UPDATES_DIR(argv[1]);\n FileUtil::Directory system_updates_dir(SYSTEM_UPDATES_DIR, \"(^\\\\d+\\\\.sh$|\\\\d+\\\\.(?:.*)\\\\.sql)\");\n for (const auto &entry : system_updates_dir) {\n const unsigned script_version = GetVersionFromScriptName(entry.getName());\n if (script_version < 100)\n LOG_WARNING(\"script version \" + std::to_string(script_version) + \" might belong to the old update schema and is no longer supported\");\n else if (script_version > current_version)\n script_names.emplace_back(entry.getName());\n }\n if (script_names.empty()) {\n if (current_version < 100) {\n LOG_INFO(\"Setting current version to 99\");\n FileUtil::WriteStringOrDie(VERSION_PATH, \"99\");\n }\n LOG_INFO(\"nothing to be done!\");\n return EXIT_SUCCESS;\n }\n\n std::sort(script_names.begin(), script_names.end(), ScriptLessThan);\n std::string last_schema, current_schema;\n int previous_version_number = -1;\n\n for (const auto &script_name : script_names) {\n LOG_INFO(\"Running \" + script_name);\n const unsigned version_number(GetVersionFromScriptName(script_name));\n\n if (previous_version_number == (int) version_number)\n LOG_ERROR(\"the number \" + std::to_string(version_number) + \" was used multiple times.\");\n else\n previous_version_number = version_number;\n\n if (StringUtil::EndsWith(script_name, \".sh\", true)) {\n if (dry_run)\n std::cout << SYSTEM_UPDATES_DIR << \"---\" << script_name << std::endl;\n else\n ExecUtil::ExecOrDie(SYSTEM_UPDATES_DIR + \"\/\" + script_name);\n }\n else if (StringUtil::EndsWith(script_name, \".sql\", true)) {\n if (dry_run)\n std::cout << SYSTEM_UPDATES_DIR << \" \" << script_name << std::endl;\n else\n ApplyDatabaseUpdate(&db_connection, SYSTEM_UPDATES_DIR, script_name, ¤t_schema, last_schema);\n last_schema = current_schema;\n }\n else {\n LOG_WARNING(\"unable to process file: \\\"\" + script_name + \"\\\" - skipping file\");\n continue;\n }\n\n \/\/ We want to write the version number after each script\n \/\/ in case anything goes wrong, to avoid double execution\n \/\/ of successfully run scripts\n FileUtil::WriteStringOrDie(VERSION_PATH, std::to_string(version_number));\n }\n\n return EXIT_SUCCESS;\n}\n<|endoftext|>"} {"text":"#include \"Exception.h\"\n\nusing namespace CppUnit;\n\nconst std::string \nCppUnit::Exception::UNKNOWNFILENAME = \n \"\";\nconst int CppUnit::Exception::UNKNOWNLINENUMBER = -1;\n\n\/\/\/ Construct the exception\nCppUnit::Exception::Exception (const Exception& other)\n : exception (other)\n{ \n m_message = other.m_message; \n m_lineNumber = other.m_lineNumber;\n m_fileName = other.m_fileName;\n} \n\nCppUnit::Exception::Exception (std::string message, long lineNumber, std::string fileName)\n : m_message (message), m_lineNumber (lineNumber), m_fileName (fileName)\n{}\n\n\n\/\/\/ Destruct the exception\nCppUnit::Exception::~Exception ()\n{}\n\n\n\/\/\/ Perform an assignment\nException& \nCppUnit::Exception::operator= (const Exception& other)\n{ \n exception::operator= (other);\n\n if (&other != this) {\n m_message = other.m_message; \n m_lineNumber = other.m_lineNumber;\n m_fileName = other.m_fileName;\n }\n\n return *this; \n}\n\n\n\/\/\/ Return descriptive message\nconst char*\nCppUnit::Exception::what() const throw ()\n{ return m_message.c_str (); }\n\n\/\/\/ The line on which the error occurred\nlong \nCppUnit::Exception::lineNumber ()\n{ return m_lineNumber; }\n\n\n\/\/\/ The file in which the error occurred\nstd::string \nCppUnit::Exception::fileName ()\n{ return m_fileName; }\n\ncode beautification.#include \"Exception.h\"\n\nusing namespace CppUnit;\n\nconst std::string \nCppUnit::Exception::UNKNOWNFILENAME = \n \"\";\nconst int CppUnit::Exception::UNKNOWNLINENUMBER = -1;\n\n\/\/\/ Construct the exception\nCppUnit::Exception::Exception (const Exception& other)\n : exception (other)\n{ \n m_message = other.m_message; \n m_lineNumber = other.m_lineNumber;\n m_fileName = other.m_fileName;\n} \n\nCppUnit::Exception::Exception (std::string message, long lineNumber, std::string fileName)\n : m_message (message), m_lineNumber (lineNumber), m_fileName (fileName)\n{\n}\n\n\n\/\/\/ Destruct the exception\nCppUnit::Exception::~Exception ()\n{}\n\n\n\/\/\/ Perform an assignment\nException& \nCppUnit::Exception::operator= (const Exception& other)\n{ \n exception::operator= (other);\n\n if (&other != this) {\n m_message = other.m_message; \n m_lineNumber = other.m_lineNumber;\n m_fileName = other.m_fileName;\n }\n\n return *this; \n}\n\n\n\/\/\/ Return descriptive message\nconst char*\nCppUnit::Exception::what() const throw ()\n{ return m_message.c_str (); }\n\n\/\/\/ The line on which the error occurred\nlong \nCppUnit::Exception::lineNumber ()\n{ return m_lineNumber; }\n\n\n\/\/\/ The file in which the error occurred\nstd::string \nCppUnit::Exception::fileName ()\n{ return m_fileName; }\n\n<|endoftext|>"} {"text":"\/*\n * Copyright (C) 2008, 2009 Nokia Corporation.\n *\n * Contact: Marius Vollmer \n *\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 \"contextpropertyinfo.h\"\n#include \"infobackend.h\"\n#include \"sconnect.h\"\n#include \"logging.h\"\n#include \"loggingfeatures.h\"\n#include \n#include \n\n\/*!\n \\page Introspection\n\n \\brief The Context Framework maintains a registry defining which\n context properties are currently provided and by whom. The\n introspection API of libcontextsubscriber allows you to inspect\n the current state of the registry and observe its changes.\n\n \\section Overview\n\n The introspection is provided via two classes: ContextRegistryInfo and\n ContextPropertyInfo.\n\n ContextRegistryInfo provides a high-level view to the registry\n contents. You can use it to obtain info about the list of\n currently available keys or e.g. get a list of keys for one\n particular provider. ContextRegistryInfo is a singleton instance\n which is created on the first access.\n\n ContextPropertyInfo is used to obtain metadata about one\n particular key. Once created, it can be used to retrieve the type\n and provider information (DBus bus type and name) of the\n introspected key. It also provides a signal to listen for changes\n happening to a key.\n\n \\section Usage\n\n \\code\n \/\/ To get a list of all keys in the registry\n ContextRegistryInfo *context = ContextRegistryInfo::instance();\n QStringList currentKeys = context->listKeys();\n \\endcode\n\n Using the ContextPropertyInfo is even more straight-forward.\n\n \\code\n \/\/ To check the type of a particular key\n ContextPropertyInfo propInfo(\"Battery.ChargeLevel\");\n QString propType = propInfo.type();\n \\endcode\n\n The introspection API in general never asserts (never fails). It'll return empty strings\n on errors or if data is missing. For example:\n\n \\code\n ContextPropertyInfo propInfo(\"Something.That.Doesnt.Exist\");\n propInfo.type(); \/\/ ...returns empty string\n propInfo.doc(); \/\/ ...returns empty string\n \\endcode\n\n You can use this functionality to wait for keys to become available in the registry.\n Just create a ContextPropertyInfo for a key that you're expecting to become present\n and connect to the \\c changed signal.\n\n \\code\n ContextPropertyInfo propInfo(\"Something.That.Doesnt.Exist\");\n propInfo.declared(); \/\/ false\n \/\/ Connect something to the changed signal, keep checking it\n \\endcode\n\n \\section xmlvscdb XML vs.CDB\n\n When the introspection API is first used, a backend choice is being made. \\b CDB backend\n (reading data from \\c 'cache.cdb' ) is used if the tiny database cache file exists\n in the registry. The standard (slower) \\b XML backend is used in other cases.\n\n It's possible to force a usage of a particular backend.\n This can be done by calling the \\c instance method with a string name of the backend:\n\n \\code\n ContextRegistryInfo::instance(\"cdb\"); \/\/ or \"xml\"\n \\endcode\n\n This needs to be done early enough before the introspection API is first used.\n For more information about the \\b xml and \\cdb backends read the \\ref UpdatingContextProviders page.\n\n*\/\n\n\/*!\n \\page MigratingFromDuiValueSpace\n\n \\brief libcontextsubscriber is a replacement library for DuiValueSpace which is deprecated.\n\n DuiValueSpace, the old subscription library providing the keys, is deprecated. This library\n is a replacement for it, providing better API and better implementation while maintaining the\n same core ideas and structure.\n\n \\section quicklook A quick look\n\n The following code for creating a handle for a context property:\n\n \\code\n DuiValueSpaceItem topEdge(\"Context.Screen.TopEdge\");\n QObject::connect(&topEdge, SIGNAL(valueChanged()),\n this, SLOT(topEdgeChanged()));\n \\endcode\n\n becomes:\n\n \\code\n ContextProperty topEdge(\"Screen.TopEdge\");\n QObject::connect(&topEdge, SIGNAL(valueChanged()),\n this, SLOT(topEdgeChanged()));\n \\endcode\n\n The following code for listing the available context keys:\n\n \\code\n DuiValueSpaceItem::listKeys();\n \\endcode\n\n becomes:\n\n \\code\n ContextRegistryInfo::instance()->listKeys();\n \\endcode\n\n \\section prefix The Context. prefix\n\n In \\b DuiValueSpace and accompanying packages, the properties used to\n have a \"Context.\" prefix. For example:\n\n \\code\n Context.Screen.TopEdge\n Context.Screen.IsCovered\n \\endcode\n\n This 'Context.' has been dropped now from \\b libcontextsubscriber and\n all the provider packages. Providers now explicitly provide properties\n with keys like:\n\n \\code\n Screen.TopEdge\n Screen.IsCovered\n \\endcode\n\n For compatibility reasons the 'Context.' prefix is still supported in\n newer releases of \\b DuiValueSpace. The \\b DuiValueSpace library transparently\n adds the 'Context.' prefix to all access functions.\n\n A call to:\n\n \\code\n DuiValueSpaceItem topEdge(\"Context.Screen.TopEdge\");\n \\endcode\n\n ...is internally in \\b DuiValueSpace converted to actual \\c Screen.TopEdge\n wire access. This mechanism has been introduced to make the\n \\b DuiValueSpace and \\b libcontextsubscriber libraries parallel-installable.\n\n It's expected that all \\b DuiValueSpace clients migrate to \\b libcontextsubscriber\n eventually and \\b DuiValueSpace library will be removed.\n\n \\warning When migrating to \\b libcontextsubscriber make sure to remove the 'Context.'\n from you key access paths.\n*\/\n\n\/*!\n \\class ContextPropertyInfo\n\n \\brief A class to introspect a context property details.\n\n This class is used to obtain information about a given key in the context registry.\n The information can be provided either from xml files or from a cdb database.\n It's possible to query the type, the provider and the documentation of the given\n key\/property.\n*\/\n\n\/\/\/ Constructs a new ContextPropertyInfo for \\a key with the given \\a parent.\n\/\/\/ The object can be used to perform introspection on the given \\a key.\n\/\/\/ \\param key The full name of the key.\nContextPropertyInfo::ContextPropertyInfo(const QString &key, QObject *parent)\n : QObject(parent)\n{\n keyName = key;\n\n if (key != \"\") {\n InfoBackend* infoBackend = InfoBackend::instance();\n sconnect(infoBackend, SIGNAL(keyChanged(QString)),\n this, SLOT(onKeyChanged(QString)));\n\n cachedTypeInfo = infoBackend->typeInfoForKey(keyName);\n cachedDoc = infoBackend->docForKey(keyName);\n cachedDeclared = infoBackend->keyDeclared(keyName);\n cachedProviders = infoBackend->providersForKey(keyName);\n }\n}\n\n\/\/\/ Returns the full name of the introspected key.\nQString ContextPropertyInfo::key() const\n{\n QMutexLocker lock(&cacheLock);\n return keyName;\n}\n\n\/\/\/ Returns the doc (documentation) for the introspected key.\nQString ContextPropertyInfo::doc() const\n{\n QMutexLocker lock(&cacheLock);\n return cachedDoc;\n}\n\n\/\/\/ Returns the old-style type name for the introspected key. To be deprecated soon.\nQString ContextPropertyInfo::type() const\n{\n QMutexLocker lock(&cacheLock);\n\n QString typeInfoName = cachedTypeInfo.name();\n if (typeInfoName == \"int64\")\n return \"INT\";\n else if (typeInfoName == \"int32\")\n return \"INT\";\n else if (typeInfoName == \"integer\")\n return \"INT\";\n else if (typeInfoName == \"uint32\")\n return \"INT\";\n else if (typeInfoName == \"uint64\")\n return \"INT\";\n else if (typeInfoName == \"bool\")\n return \"TRUTH\";\n else if (typeInfoName == \"string\")\n return \"STRING\";\n else if (typeInfoName == \"number\")\n return \"DOUBLE\";\n else\n return \"\";\n}\n\n\/\/\/ Returns the advanced type info for the introspected key.\nContextTypeInfo ContextPropertyInfo::typeInfo() const\n{\n QMutexLocker lock(&cacheLock);\n return cachedTypeInfo;\n}\n\n\/\/\/ DEPRECATED Returns true if the key exists in the registry.\n\/\/\/ This function is deprecated, use declared() instead.\nbool ContextPropertyInfo::exists() const\n{\n contextWarning() << F_DEPRECATION << \"ContextPropertyInfo::exists() is deprecated.\";\n QMutexLocker lock(&cacheLock);\n return cachedDeclared;\n}\n\n\/\/\/ Returns true if the key is declared in the registry\n\/\/\/ (it \"exists\").\nbool ContextPropertyInfo::declared() const\n{\n QMutexLocker lock(&cacheLock);\n return cachedDeclared;\n}\n\n\/\/\/ Returns true if the key is provided by someone.\nbool ContextPropertyInfo::provided() const\n{\n QMutexLocker lock(&cacheLock);\n return (cachedProviders.size() > 0);\n}\n\n\/\/\/ DEPRECATED Returns the name of the plugin supplying this property.\n\/\/\/ This function is deprecated, use providers() instead.\nQString ContextPropertyInfo::plugin() const\n{\n contextWarning() << F_DEPRECATION << \"ContextPropertyInfo::plugin() is deprecated.\";\n return plugin_i();\n}\n\nQString ContextPropertyInfo::plugin_i() const\n{\n QMutexLocker lock(&cacheLock);\n if (cachedProviders.size() == 0)\n return \"\";\n else\n return cachedProviders.at(0).plugin;\n}\n\n\/\/\/ DEPRECATED Returns the construction parameter for the Provider supplying this property\n\/\/\/ This function is deprecated, use providers() instead.\nQString ContextPropertyInfo::constructionString() const\n{\n contextWarning() << F_DEPRECATION << \"ContextPropertyInfo::constructionString() is deprecated.\";\n return constructionString_i();\n}\n\nQString ContextPropertyInfo::constructionString_i() const\n{\n QMutexLocker lock(&cacheLock);\n if (cachedProviders.size() == 0)\n return \"\";\n else\n return cachedProviders.at(0).constructionString;\n}\n\n\/\/\/ DEPRECATED Returns the dbus name of the provider supplying this\n\/\/\/ property\/key. This function is maintained for backwards\n\/\/\/ compatibility. Use providers() instead.\nQString ContextPropertyInfo::providerDBusName_i() const\n{\n QMutexLocker lock(&cacheLock);\n if (cachedProviders.size() == 0)\n return \"\";\n else {\n QString plg = cachedProviders.at(0).plugin;\n QString constructionString = cachedProviders.at(0).constructionString;\n if (plg == \"contextkit-dbus\")\n return constructionString.split(\":\").last();\n else\n return \"\";\n }\n}\n\n\/\/\/ DEPRECATED Returns the dbus name of the provider supplying this\n\/\/\/ property\/key. This function is maintained for backwards\n\/\/\/ compatibility. Use listProviders() instead.\nQString ContextPropertyInfo::providerDBusName() const\n{\n contextWarning() << F_DEPRECATION << \"ContextPropertyInfo::providerDBusName() is deprecated.\";\n return providerDBusName_i();\n}\nQDBusConnection::BusType ContextPropertyInfo::providerDBusType_i() const\n{\n QMutexLocker lock(&cacheLock);\n QString busType = \"\";\n\n if (cachedProviders.size() > 0) {\n QString plg = cachedProviders.at(0).plugin;\n QString constructionString = cachedProviders.at(0).constructionString;\n if (plg == \"contextkit-dbus\")\n busType = constructionString.split(\":\").first();\n }\n\n if (busType == \"system\")\n return QDBusConnection::SystemBus;\n else \/* if (busType == \"session\") *\/\n return QDBusConnection::SessionBus;\n}\n\n\n\/\/\/ DEPRECATED Returns the bus type of the provider supplying this property\/key.\n\/\/\/ Ie. if it's a session bus or a system bus. This function is\n\/\/\/ maintained for backwards compatibility. Use listProviders() instead.\nQDBusConnection::BusType ContextPropertyInfo::providerDBusType() const\n{\n contextWarning() << F_DEPRECATION << \"ContextPropertyInfo::providerDBusType() is deprecated.\";\n return providerDBusType_i();\n}\n\n\/* Slots *\/\n\n\/\/\/ This slot is connected to the \\a keyChanged signal of the\n\/\/\/ actual infobackend instance. It's executed on every change to any\n\/\/\/ of the keys. We first check if the data concerns us. Next we\n\/\/\/ update the cached values and fire the actual signals.\nvoid ContextPropertyInfo::onKeyChanged(const QString& key)\n{\n QMutexLocker lock(&cacheLock);\n\n if (key != keyName)\n return;\n\n \/\/ Update caches\n cachedTypeInfo = InfoBackend::instance()->typeInfoForKey(keyName);\n cachedDoc = InfoBackend::instance()->docForKey(keyName);\n cachedDeclared = InfoBackend::instance()->keyDeclared(keyName);\n cachedProviders = InfoBackend::instance()->providersForKey(keyName);\n\n \/\/ Release the lock before emitting the signals; otherwise\n \/\/ listeners trying to access cached values would create a\n \/\/ deadlock.\n lock.unlock();\n\n \/\/ Emit the needed signals\n emit changed(keyName);\n emit typeChanged(type());\n emit existsChanged(cachedDeclared);\n emit providedChanged((cachedProviders.size() > 0));\n\n emit providerChanged(providerDBusName_i());\n emit providerDBusTypeChanged(providerDBusType_i());\n emit pluginChanged(plugin_i(), constructionString_i());\n}\n\n\/\/\/ Returns a list of providers that provide this key.\nconst QList ContextPropertyInfo::providers() const\n{\n QMutexLocker lock(&cacheLock);\n return cachedProviders;\n}\n\n\/\/\/ Called when people connect to signals. Used to emit deprecation warnings\n\/\/\/ when people connect to deprecated signals.\nvoid ContextPropertyInfo::connectNotify(const char *_signal)\n{\n QObject::connectNotify(_signal);\n QLatin1String signal(_signal);\n\n if (signal == SIGNAL(providerChanged(QString)))\n contextWarning() << F_DEPRECATION << \"ContextPropertyInfo::providerChanged signal is deprecated.\";\n else if (signal == SIGNAL(providerDBusTypeChanged(QDBusConnection::BusType)))\n contextWarning() << F_DEPRECATION << \"ContextPropertyInfo::providerDBusTypeChanged signal is deprecated.\";\n else if (signal == SIGNAL(typeChanged(QString)))\n contextWarning() << F_DEPRECATION << \"ContextPropertyInfo::typeChanged signal is deprecated.\";\n else if (signal == SIGNAL(existsChanged(bool)))\n contextWarning() << F_DEPRECATION << \"ContextPropertyInfo::existsChanged signal is deprecated.\";\n else if (signal == SIGNAL(providedChanged(bool)))\n contextWarning() << F_DEPRECATION << \"ContextPropertyInfo::providedChanged signal is deprecated.\";\n else if (signal == SIGNAL(pluginChanged(QString,QString)))\n contextWarning() << F_DEPRECATION << \"ContextPropertyInfo::pluginChanged signal is deprecated.\";\n}\n\n\/\/\/ Returns resolution strategy for this property. Resolution strategy defines how values\n\/\/\/ are computed in relation to multiple providers being present for one property.\nContextPropertyInfo::ResolutionStrategy ContextPropertyInfo::resolutionStrategy() const\n{\n return ContextPropertyInfo::LastValue;\n}\nDo not support \"int32\", \"int64\", \"uint32\", \"uint64\" intentional type names in legacy API.\/*\n * Copyright (C) 2008, 2009 Nokia Corporation.\n *\n * Contact: Marius Vollmer \n *\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 \"contextpropertyinfo.h\"\n#include \"infobackend.h\"\n#include \"sconnect.h\"\n#include \"logging.h\"\n#include \"loggingfeatures.h\"\n#include \n#include \n\n\/*!\n \\page Introspection\n\n \\brief The Context Framework maintains a registry defining which\n context properties are currently provided and by whom. The\n introspection API of libcontextsubscriber allows you to inspect\n the current state of the registry and observe its changes.\n\n \\section Overview\n\n The introspection is provided via two classes: ContextRegistryInfo and\n ContextPropertyInfo.\n\n ContextRegistryInfo provides a high-level view to the registry\n contents. You can use it to obtain info about the list of\n currently available keys or e.g. get a list of keys for one\n particular provider. ContextRegistryInfo is a singleton instance\n which is created on the first access.\n\n ContextPropertyInfo is used to obtain metadata about one\n particular key. Once created, it can be used to retrieve the type\n and provider information (DBus bus type and name) of the\n introspected key. It also provides a signal to listen for changes\n happening to a key.\n\n \\section Usage\n\n \\code\n \/\/ To get a list of all keys in the registry\n ContextRegistryInfo *context = ContextRegistryInfo::instance();\n QStringList currentKeys = context->listKeys();\n \\endcode\n\n Using the ContextPropertyInfo is even more straight-forward.\n\n \\code\n \/\/ To check the type of a particular key\n ContextPropertyInfo propInfo(\"Battery.ChargeLevel\");\n QString propType = propInfo.type();\n \\endcode\n\n The introspection API in general never asserts (never fails). It'll return empty strings\n on errors or if data is missing. For example:\n\n \\code\n ContextPropertyInfo propInfo(\"Something.That.Doesnt.Exist\");\n propInfo.type(); \/\/ ...returns empty string\n propInfo.doc(); \/\/ ...returns empty string\n \\endcode\n\n You can use this functionality to wait for keys to become available in the registry.\n Just create a ContextPropertyInfo for a key that you're expecting to become present\n and connect to the \\c changed signal.\n\n \\code\n ContextPropertyInfo propInfo(\"Something.That.Doesnt.Exist\");\n propInfo.declared(); \/\/ false\n \/\/ Connect something to the changed signal, keep checking it\n \\endcode\n\n \\section xmlvscdb XML vs.CDB\n\n When the introspection API is first used, a backend choice is being made. \\b CDB backend\n (reading data from \\c 'cache.cdb' ) is used if the tiny database cache file exists\n in the registry. The standard (slower) \\b XML backend is used in other cases.\n\n It's possible to force a usage of a particular backend.\n This can be done by calling the \\c instance method with a string name of the backend:\n\n \\code\n ContextRegistryInfo::instance(\"cdb\"); \/\/ or \"xml\"\n \\endcode\n\n This needs to be done early enough before the introspection API is first used.\n For more information about the \\b xml and \\cdb backends read the \\ref UpdatingContextProviders page.\n\n*\/\n\n\/*!\n \\page MigratingFromDuiValueSpace\n\n \\brief libcontextsubscriber is a replacement library for DuiValueSpace which is deprecated.\n\n DuiValueSpace, the old subscription library providing the keys, is deprecated. This library\n is a replacement for it, providing better API and better implementation while maintaining the\n same core ideas and structure.\n\n \\section quicklook A quick look\n\n The following code for creating a handle for a context property:\n\n \\code\n DuiValueSpaceItem topEdge(\"Context.Screen.TopEdge\");\n QObject::connect(&topEdge, SIGNAL(valueChanged()),\n this, SLOT(topEdgeChanged()));\n \\endcode\n\n becomes:\n\n \\code\n ContextProperty topEdge(\"Screen.TopEdge\");\n QObject::connect(&topEdge, SIGNAL(valueChanged()),\n this, SLOT(topEdgeChanged()));\n \\endcode\n\n The following code for listing the available context keys:\n\n \\code\n DuiValueSpaceItem::listKeys();\n \\endcode\n\n becomes:\n\n \\code\n ContextRegistryInfo::instance()->listKeys();\n \\endcode\n\n \\section prefix The Context. prefix\n\n In \\b DuiValueSpace and accompanying packages, the properties used to\n have a \"Context.\" prefix. For example:\n\n \\code\n Context.Screen.TopEdge\n Context.Screen.IsCovered\n \\endcode\n\n This 'Context.' has been dropped now from \\b libcontextsubscriber and\n all the provider packages. Providers now explicitly provide properties\n with keys like:\n\n \\code\n Screen.TopEdge\n Screen.IsCovered\n \\endcode\n\n For compatibility reasons the 'Context.' prefix is still supported in\n newer releases of \\b DuiValueSpace. The \\b DuiValueSpace library transparently\n adds the 'Context.' prefix to all access functions.\n\n A call to:\n\n \\code\n DuiValueSpaceItem topEdge(\"Context.Screen.TopEdge\");\n \\endcode\n\n ...is internally in \\b DuiValueSpace converted to actual \\c Screen.TopEdge\n wire access. This mechanism has been introduced to make the\n \\b DuiValueSpace and \\b libcontextsubscriber libraries parallel-installable.\n\n It's expected that all \\b DuiValueSpace clients migrate to \\b libcontextsubscriber\n eventually and \\b DuiValueSpace library will be removed.\n\n \\warning When migrating to \\b libcontextsubscriber make sure to remove the 'Context.'\n from you key access paths.\n*\/\n\n\/*!\n \\class ContextPropertyInfo\n\n \\brief A class to introspect a context property details.\n\n This class is used to obtain information about a given key in the context registry.\n The information can be provided either from xml files or from a cdb database.\n It's possible to query the type, the provider and the documentation of the given\n key\/property.\n*\/\n\n\/\/\/ Constructs a new ContextPropertyInfo for \\a key with the given \\a parent.\n\/\/\/ The object can be used to perform introspection on the given \\a key.\n\/\/\/ \\param key The full name of the key.\nContextPropertyInfo::ContextPropertyInfo(const QString &key, QObject *parent)\n : QObject(parent)\n{\n keyName = key;\n\n if (key != \"\") {\n InfoBackend* infoBackend = InfoBackend::instance();\n sconnect(infoBackend, SIGNAL(keyChanged(QString)),\n this, SLOT(onKeyChanged(QString)));\n\n cachedTypeInfo = infoBackend->typeInfoForKey(keyName);\n cachedDoc = infoBackend->docForKey(keyName);\n cachedDeclared = infoBackend->keyDeclared(keyName);\n cachedProviders = infoBackend->providersForKey(keyName);\n }\n}\n\n\/\/\/ Returns the full name of the introspected key.\nQString ContextPropertyInfo::key() const\n{\n QMutexLocker lock(&cacheLock);\n return keyName;\n}\n\n\/\/\/ Returns the doc (documentation) for the introspected key.\nQString ContextPropertyInfo::doc() const\n{\n QMutexLocker lock(&cacheLock);\n return cachedDoc;\n}\n\n\/\/\/ Returns the old-style type name for the introspected key. To be deprecated soon.\nQString ContextPropertyInfo::type() const\n{\n QMutexLocker lock(&cacheLock);\n\n QString typeInfoName = cachedTypeInfo.name();\n if (typeInfoName == \"integer\")\n return \"INT\";\n else if (typeInfoName == \"bool\")\n return \"TRUTH\";\n else if (typeInfoName == \"string\")\n return \"STRING\";\n else if (typeInfoName == \"number\")\n return \"DOUBLE\";\n else\n return \"\";\n}\n\n\/\/\/ Returns the advanced type info for the introspected key.\nContextTypeInfo ContextPropertyInfo::typeInfo() const\n{\n QMutexLocker lock(&cacheLock);\n return cachedTypeInfo;\n}\n\n\/\/\/ DEPRECATED Returns true if the key exists in the registry.\n\/\/\/ This function is deprecated, use declared() instead.\nbool ContextPropertyInfo::exists() const\n{\n contextWarning() << F_DEPRECATION << \"ContextPropertyInfo::exists() is deprecated.\";\n QMutexLocker lock(&cacheLock);\n return cachedDeclared;\n}\n\n\/\/\/ Returns true if the key is declared in the registry\n\/\/\/ (it \"exists\").\nbool ContextPropertyInfo::declared() const\n{\n QMutexLocker lock(&cacheLock);\n return cachedDeclared;\n}\n\n\/\/\/ Returns true if the key is provided by someone.\nbool ContextPropertyInfo::provided() const\n{\n QMutexLocker lock(&cacheLock);\n return (cachedProviders.size() > 0);\n}\n\n\/\/\/ DEPRECATED Returns the name of the plugin supplying this property.\n\/\/\/ This function is deprecated, use providers() instead.\nQString ContextPropertyInfo::plugin() const\n{\n contextWarning() << F_DEPRECATION << \"ContextPropertyInfo::plugin() is deprecated.\";\n return plugin_i();\n}\n\nQString ContextPropertyInfo::plugin_i() const\n{\n QMutexLocker lock(&cacheLock);\n if (cachedProviders.size() == 0)\n return \"\";\n else\n return cachedProviders.at(0).plugin;\n}\n\n\/\/\/ DEPRECATED Returns the construction parameter for the Provider supplying this property\n\/\/\/ This function is deprecated, use providers() instead.\nQString ContextPropertyInfo::constructionString() const\n{\n contextWarning() << F_DEPRECATION << \"ContextPropertyInfo::constructionString() is deprecated.\";\n return constructionString_i();\n}\n\nQString ContextPropertyInfo::constructionString_i() const\n{\n QMutexLocker lock(&cacheLock);\n if (cachedProviders.size() == 0)\n return \"\";\n else\n return cachedProviders.at(0).constructionString;\n}\n\n\/\/\/ DEPRECATED Returns the dbus name of the provider supplying this\n\/\/\/ property\/key. This function is maintained for backwards\n\/\/\/ compatibility. Use providers() instead.\nQString ContextPropertyInfo::providerDBusName_i() const\n{\n QMutexLocker lock(&cacheLock);\n if (cachedProviders.size() == 0)\n return \"\";\n else {\n QString plg = cachedProviders.at(0).plugin;\n QString constructionString = cachedProviders.at(0).constructionString;\n if (plg == \"contextkit-dbus\")\n return constructionString.split(\":\").last();\n else\n return \"\";\n }\n}\n\n\/\/\/ DEPRECATED Returns the dbus name of the provider supplying this\n\/\/\/ property\/key. This function is maintained for backwards\n\/\/\/ compatibility. Use listProviders() instead.\nQString ContextPropertyInfo::providerDBusName() const\n{\n contextWarning() << F_DEPRECATION << \"ContextPropertyInfo::providerDBusName() is deprecated.\";\n return providerDBusName_i();\n}\nQDBusConnection::BusType ContextPropertyInfo::providerDBusType_i() const\n{\n QMutexLocker lock(&cacheLock);\n QString busType = \"\";\n\n if (cachedProviders.size() > 0) {\n QString plg = cachedProviders.at(0).plugin;\n QString constructionString = cachedProviders.at(0).constructionString;\n if (plg == \"contextkit-dbus\")\n busType = constructionString.split(\":\").first();\n }\n\n if (busType == \"system\")\n return QDBusConnection::SystemBus;\n else \/* if (busType == \"session\") *\/\n return QDBusConnection::SessionBus;\n}\n\n\n\/\/\/ DEPRECATED Returns the bus type of the provider supplying this property\/key.\n\/\/\/ Ie. if it's a session bus or a system bus. This function is\n\/\/\/ maintained for backwards compatibility. Use listProviders() instead.\nQDBusConnection::BusType ContextPropertyInfo::providerDBusType() const\n{\n contextWarning() << F_DEPRECATION << \"ContextPropertyInfo::providerDBusType() is deprecated.\";\n return providerDBusType_i();\n}\n\n\/* Slots *\/\n\n\/\/\/ This slot is connected to the \\a keyChanged signal of the\n\/\/\/ actual infobackend instance. It's executed on every change to any\n\/\/\/ of the keys. We first check if the data concerns us. Next we\n\/\/\/ update the cached values and fire the actual signals.\nvoid ContextPropertyInfo::onKeyChanged(const QString& key)\n{\n QMutexLocker lock(&cacheLock);\n\n if (key != keyName)\n return;\n\n \/\/ Update caches\n cachedTypeInfo = InfoBackend::instance()->typeInfoForKey(keyName);\n cachedDoc = InfoBackend::instance()->docForKey(keyName);\n cachedDeclared = InfoBackend::instance()->keyDeclared(keyName);\n cachedProviders = InfoBackend::instance()->providersForKey(keyName);\n\n \/\/ Release the lock before emitting the signals; otherwise\n \/\/ listeners trying to access cached values would create a\n \/\/ deadlock.\n lock.unlock();\n\n \/\/ Emit the needed signals\n emit changed(keyName);\n emit typeChanged(type());\n emit existsChanged(cachedDeclared);\n emit providedChanged((cachedProviders.size() > 0));\n\n emit providerChanged(providerDBusName_i());\n emit providerDBusTypeChanged(providerDBusType_i());\n emit pluginChanged(plugin_i(), constructionString_i());\n}\n\n\/\/\/ Returns a list of providers that provide this key.\nconst QList ContextPropertyInfo::providers() const\n{\n QMutexLocker lock(&cacheLock);\n return cachedProviders;\n}\n\n\/\/\/ Called when people connect to signals. Used to emit deprecation warnings\n\/\/\/ when people connect to deprecated signals.\nvoid ContextPropertyInfo::connectNotify(const char *_signal)\n{\n QObject::connectNotify(_signal);\n QLatin1String signal(_signal);\n\n if (signal == SIGNAL(providerChanged(QString)))\n contextWarning() << F_DEPRECATION << \"ContextPropertyInfo::providerChanged signal is deprecated.\";\n else if (signal == SIGNAL(providerDBusTypeChanged(QDBusConnection::BusType)))\n contextWarning() << F_DEPRECATION << \"ContextPropertyInfo::providerDBusTypeChanged signal is deprecated.\";\n else if (signal == SIGNAL(typeChanged(QString)))\n contextWarning() << F_DEPRECATION << \"ContextPropertyInfo::typeChanged signal is deprecated.\";\n else if (signal == SIGNAL(existsChanged(bool)))\n contextWarning() << F_DEPRECATION << \"ContextPropertyInfo::existsChanged signal is deprecated.\";\n else if (signal == SIGNAL(providedChanged(bool)))\n contextWarning() << F_DEPRECATION << \"ContextPropertyInfo::providedChanged signal is deprecated.\";\n else if (signal == SIGNAL(pluginChanged(QString,QString)))\n contextWarning() << F_DEPRECATION << \"ContextPropertyInfo::pluginChanged signal is deprecated.\";\n}\n\n\/\/\/ Returns resolution strategy for this property. Resolution strategy defines how values\n\/\/\/ are computed in relation to multiple providers being present for one property.\nContextPropertyInfo::ResolutionStrategy ContextPropertyInfo::resolutionStrategy() const\n{\n return ContextPropertyInfo::LastValue;\n}\n<|endoftext|>"} {"text":"#include \"bookmarkmodel.h\"\n#include \n\nvoid BookmarkModel::addNode(LiteApi::IEditorMark *mark, LiteApi::IEditorMarkNode *node)\n{\n beginInsertRows(QModelIndex(), m_nodeList.size(), m_nodeList.size());\n\n BookmarkNode *bn = createBookmarkNode(mark,node);\n m_nodeList.append(bn);\n m_nodeMap.insert(node,bn);\n\n endInsertRows();\n \/\/selectionModel()->setCurrentIndex(index(m_bookmarksList.size()-1 , 0, QModelIndex()), QItemSelectionModel::Select | QItemSelectionModel::Clear);\n}\n\nvoid BookmarkModel::removeNode(LiteApi::IEditorMark *mark, LiteApi::IEditorMarkNode *node)\n{\n BookmarkNode *bn = findBookmarkNode(mark,node);\n if (!bn) {\n return;\n }\n int idx = m_nodeList.indexOf(bn);\n beginRemoveRows(QModelIndex(), idx, idx);\n\n m_nodeMap.remove(node);\n\n delete bn;\n\n m_nodeList.removeAt(idx);\n endRemoveRows();\n \/\/ if (selectionModel()->currentIndex().isValid())\n \/\/ selectionModel()->setCurrentIndex(selectionModel()->currentIndex(), QItemSelectionModel::Select | QItemSelectionModel::Clear);\n}\n\nvoid BookmarkModel::updateNode(LiteApi::IEditorMark *mark, LiteApi::IEditorMarkNode *node)\n{\n BookmarkNode *bn = findBookmarkNode(mark,node);\n if (!bn) {\n return;\n }\n bn->setLineNumber(node->blockNumber()+1);\n bn->setLineText(node->block().text());\n int idx = m_nodeList.indexOf(bn);\n\n emit dataChanged(index(idx, 0, QModelIndex()), index(idx, 2, QModelIndex()));\n}\n\nBookmarkNode *BookmarkModel::createBookmarkNode(LiteApi::IEditorMark *mark, LiteApi::IEditorMarkNode *node) const\n{\n BookmarkNode *n = new BookmarkNode();\n n->setFilePath(mark->filePath());\n n->setLineNumber(node->blockNumber()+1);\n n->setLineText(node->block().text());\n return n;\n}\n\nBookmarkNode *BookmarkModel::bookmarkNodeForIndex(const QModelIndex &index) const\n{\n if (!index.isValid() || index.row() >= m_nodeList.size())\n return 0;\n return m_nodeList.at(index.row());\n}\n\nBookmarkNode *BookmarkModel::findBookmarkNode(LiteApi::IEditorMark *\/*mark*\/, LiteApi::IEditorMarkNode *node) const\n{\n return m_nodeMap.value(node);\n}\n\nBookmarkModel::BookmarkModel(QObject *parent)\n : QAbstractItemModel(parent)\n{\n}\n\nQModelIndex BookmarkModel::index(int row, int column, const QModelIndex &parent) const\n{\n if (parent.isValid())\n return QModelIndex();\n else\n return createIndex(row, column);\n}\n\nQModelIndex BookmarkModel::parent(const QModelIndex &index) const\n{\n return QModelIndex();\n}\n\nint BookmarkModel::rowCount(const QModelIndex &parent) const\n{\n if (parent.isValid())\n return 0;\n\n return m_nodeList.size();\n}\n\nint BookmarkModel::columnCount(const QModelIndex &parent) const\n{\n if (parent.isValid())\n return 0;\n\n return 1;\n}\n\nQVariant BookmarkModel::data(const QModelIndex &index, int role) const\n{\n if (!index.isValid() || index.column() !=0 || index.row() < 0 || index.row() >= m_nodeList.count())\n return QVariant();\n\n BookmarkNode *node = m_nodeList.at(index.row());\n if (role == BookmarkModel::FileName)\n return node->fileName();\n if (role == BookmarkModel::LineNumber)\n return node->lineNumber();\n if (role == BookmarkModel::FilePath)\n return node->filePath();\n if (role == BookmarkModel::LineText)\n return node->lineText();\n if (role == BookmarkModel::Note)\n return node->noteText();\n if (role == Qt::ToolTipRole)\n return QDir::toNativeSeparators(node->filePath());\n return QVariant();\n}\n\nBookmarkDelegate::BookmarkDelegate(QObject *parent)\n : QStyledItemDelegate(parent)\n{\n}\n\nQSize BookmarkDelegate::sizeHint(const QStyleOptionViewItem &option, const QModelIndex &index) const\n{\n QStyleOptionViewItem opt = option;\n initStyleOption(&opt, index);\n\n QFontMetrics fm(option.font);\n QSize s;\n s.setWidth(option.rect.width());\n s.setHeight(fm.height() * 2 + 10);\n return s;\n}\n\nvoid BookmarkDelegate::generateGradientPixmap(int width, int height, const QColor &color, bool selected) const\n{\n QColor c = color;\n c.setAlpha(0);\n\n QPixmap pixmap(width+1, height);\n pixmap.fill(c);\n\n QPainter painter(&pixmap);\n painter.setPen(Qt::NoPen);\n\n QLinearGradient lg;\n lg.setCoordinateMode(QGradient::ObjectBoundingMode);\n lg.setFinalStop(1,0);\n\n lg.setColorAt(0, c);\n lg.setColorAt(0.4, color);\n\n painter.setBrush(lg);\n painter.drawRect(0, 0, width+1, height);\n\n if (selected)\n m_selectedPixmap = pixmap;\n else\n m_normalPixmap = pixmap;\n}\n\nvoid BookmarkDelegate::paint(QPainter *painter, const QStyleOptionViewItem &option, const QModelIndex &index) const\n{\n QStyleOptionViewItem opt = option;\n initStyleOption(&opt, index);\n painter->save();\n\n QFontMetrics fm(opt.font);\n static int lwidth = fm.width(QLatin1String(\"8888\")) + 18;\n\n QColor backgroundColor;\n QColor textColor;\n\n bool selected = opt.state & QStyle::State_Selected;\n\n if (selected) {\n painter->setBrush(opt.palette.highlight().color());\n backgroundColor = opt.palette.highlight().color();\n if (!m_selectedPixmap)\n generateGradientPixmap(lwidth, fm.height()+1, backgroundColor, selected);\n } else {\n painter->setBrush(opt.palette.background().color());\n backgroundColor = opt.palette.background().color();\n if (!m_normalPixmap)\n generateGradientPixmap(lwidth, fm.height(), backgroundColor, selected);\n }\n painter->setPen(Qt::NoPen);\n painter->drawRect(opt.rect);\n\n \/\/ Set Text Color\n if (opt.state & QStyle::State_Selected)\n textColor = opt.palette.highlightedText().color();\n else\n textColor = opt.palette.text().color();\n\n painter->setPen(textColor);\n\n\n \/\/ TopLeft\n QString topLeft = index.data(BookmarkModel::FileName).toString();\n painter->drawText(6, 2 + opt.rect.top() + fm.ascent(), topLeft);\n\n QString topRight = index.data(BookmarkModel::LineNumber).toString();\n \/\/ Check whether we need to be fancy and paint some background\n int fwidth = fm.width(topLeft);\n if (fwidth + lwidth > opt.rect.width()) {\n int left = opt.rect.right() - lwidth;\n painter->drawPixmap(left, opt.rect.top(), selected ? m_selectedPixmap : m_normalPixmap);\n }\n \/\/ topRight\n painter->drawText(opt.rect.right() - fm.width(topRight) - 6 , 2 + opt.rect.top() + fm.ascent(), topRight);\n\n \/\/ Directory\n QColor mix;\n mix.setRgbF(0.7 * textColor.redF() + 0.3 * backgroundColor.redF(),\n 0.7 * textColor.greenF() + 0.3 * backgroundColor.greenF(),\n 0.7 * textColor.blueF() + 0.3 * backgroundColor.blueF());\n painter->setPen(mix);\n\/\/\n\/\/ QString directory = index.data(BookmarkManager::Directory).toString();\n\/\/ int availableSpace = opt.rect.width() - 12;\n\/\/ if (fm.width(directory) > availableSpace) {\n\/\/ \/\/ We need a shorter directory\n\/\/ availableSpace -= fm.width(\"...\");\n\/\/\n\/\/ int pos = directory.size();\n\/\/ int idx;\n\/\/ forever {\n\/\/ idx = directory.lastIndexOf(\"\/\", pos-1);\n\/\/ if (idx == -1) {\n\/\/ \/\/ Can't happen, this means the string did fit after all?\n\/\/ break;\n\/\/ }\n\/\/ int width = fm.width(directory.mid(idx, pos-idx));\n\/\/ if (width > availableSpace) {\n\/\/ directory = \"...\" + directory.mid(pos);\n\/\/ break;\n\/\/ } else {\n\/\/ pos = idx;\n\/\/ availableSpace -= width;\n\/\/ }\n\/\/ }\n\/\/ }\n\/\/\n\/\/ painter->drawText(3, opt.rect.top() + fm.ascent() + fm.height() + 6, directory);\n\n QString lineText = index.data(BookmarkModel::Note).toString().trimmed();\n if (lineText.isEmpty())\n lineText = index.data(BookmarkModel::LineText).toString().trimmed();\n\n painter->drawText(6, opt.rect.top() + fm.ascent() + fm.height() + 6, lineText);\n\n \/\/ Separator lines\n const QRectF innerRect = QRectF(opt.rect).adjusted(0.5, 0.5, -0.5, -0.5);\n painter->setPen(QColor::fromRgb(150,150,150));\n painter->drawLine(innerRect.bottomLeft(), innerRect.bottomRight());\n painter->restore();\n}\nbookmakrs: draw full path#include \"bookmarkmodel.h\"\n#include \n\nvoid BookmarkModel::addNode(LiteApi::IEditorMark *mark, LiteApi::IEditorMarkNode *node)\n{\n beginInsertRows(QModelIndex(), m_nodeList.size(), m_nodeList.size());\n\n BookmarkNode *bn = createBookmarkNode(mark,node);\n m_nodeList.append(bn);\n m_nodeMap.insert(node,bn);\n\n endInsertRows();\n \/\/selectionModel()->setCurrentIndex(index(m_bookmarksList.size()-1 , 0, QModelIndex()), QItemSelectionModel::Select | QItemSelectionModel::Clear);\n}\n\nvoid BookmarkModel::removeNode(LiteApi::IEditorMark *mark, LiteApi::IEditorMarkNode *node)\n{\n BookmarkNode *bn = findBookmarkNode(mark,node);\n if (!bn) {\n return;\n }\n int idx = m_nodeList.indexOf(bn);\n beginRemoveRows(QModelIndex(), idx, idx);\n\n m_nodeMap.remove(node);\n\n delete bn;\n\n m_nodeList.removeAt(idx);\n endRemoveRows();\n \/\/ if (selectionModel()->currentIndex().isValid())\n \/\/ selectionModel()->setCurrentIndex(selectionModel()->currentIndex(), QItemSelectionModel::Select | QItemSelectionModel::Clear);\n}\n\nvoid BookmarkModel::updateNode(LiteApi::IEditorMark *mark, LiteApi::IEditorMarkNode *node)\n{\n BookmarkNode *bn = findBookmarkNode(mark,node);\n if (!bn) {\n return;\n }\n bn->setLineNumber(node->blockNumber()+1);\n bn->setLineText(node->block().text());\n int idx = m_nodeList.indexOf(bn);\n\n emit dataChanged(index(idx, 0, QModelIndex()), index(idx, 2, QModelIndex()));\n}\n\nBookmarkNode *BookmarkModel::createBookmarkNode(LiteApi::IEditorMark *mark, LiteApi::IEditorMarkNode *node) const\n{\n BookmarkNode *n = new BookmarkNode();\n n->setFilePath(mark->filePath());\n n->setLineNumber(node->blockNumber()+1);\n n->setLineText(node->block().text());\n return n;\n}\n\nBookmarkNode *BookmarkModel::bookmarkNodeForIndex(const QModelIndex &index) const\n{\n if (!index.isValid() || index.row() >= m_nodeList.size())\n return 0;\n return m_nodeList.at(index.row());\n}\n\nBookmarkNode *BookmarkModel::findBookmarkNode(LiteApi::IEditorMark *\/*mark*\/, LiteApi::IEditorMarkNode *node) const\n{\n return m_nodeMap.value(node);\n}\n\nBookmarkModel::BookmarkModel(QObject *parent)\n : QAbstractItemModel(parent)\n{\n}\n\nQModelIndex BookmarkModel::index(int row, int column, const QModelIndex &parent) const\n{\n if (parent.isValid())\n return QModelIndex();\n else\n return createIndex(row, column);\n}\n\nQModelIndex BookmarkModel::parent(const QModelIndex &index) const\n{\n return QModelIndex();\n}\n\nint BookmarkModel::rowCount(const QModelIndex &parent) const\n{\n if (parent.isValid())\n return 0;\n\n return m_nodeList.size();\n}\n\nint BookmarkModel::columnCount(const QModelIndex &parent) const\n{\n if (parent.isValid())\n return 0;\n\n return 1;\n}\n\nQVariant BookmarkModel::data(const QModelIndex &index, int role) const\n{\n if (!index.isValid() || index.column() !=0 || index.row() < 0 || index.row() >= m_nodeList.count())\n return QVariant();\n\n BookmarkNode *node = m_nodeList.at(index.row());\n if (role == BookmarkModel::FileName)\n return node->fileName();\n if (role == BookmarkModel::LineNumber)\n return node->lineNumber();\n if (role == BookmarkModel::FilePath)\n return node->filePath();\n if (role == BookmarkModel::LineText)\n return node->lineText();\n if (role == BookmarkModel::Note)\n return node->noteText();\n if (role == Qt::ToolTipRole)\n return QDir::toNativeSeparators(node->filePath());\n return QVariant();\n}\n\nBookmarkDelegate::BookmarkDelegate(QObject *parent)\n : QStyledItemDelegate(parent)\n{\n}\n\nQSize BookmarkDelegate::sizeHint(const QStyleOptionViewItem &option, const QModelIndex &index) const\n{\n QStyleOptionViewItem opt = option;\n initStyleOption(&opt, index);\n\n QFontMetrics fm(option.font);\n QSize s;\n s.setWidth(option.rect.width());\n s.setHeight(fm.height() * 2 + 10);\n return s;\n}\n\nvoid BookmarkDelegate::generateGradientPixmap(int width, int height, const QColor &color, bool selected) const\n{\n QColor c = color;\n c.setAlpha(0);\n\n QPixmap pixmap(width+1, height);\n pixmap.fill(c);\n\n QPainter painter(&pixmap);\n painter.setPen(Qt::NoPen);\n\n QLinearGradient lg;\n lg.setCoordinateMode(QGradient::ObjectBoundingMode);\n lg.setFinalStop(1,0);\n\n lg.setColorAt(0, c);\n lg.setColorAt(0.4, color);\n\n painter.setBrush(lg);\n painter.drawRect(0, 0, width+1, height);\n\n if (selected)\n m_selectedPixmap = pixmap;\n else\n m_normalPixmap = pixmap;\n}\n\nvoid BookmarkDelegate::paint(QPainter *painter, const QStyleOptionViewItem &option, const QModelIndex &index) const\n{\n QStyleOptionViewItem opt = option;\n initStyleOption(&opt, index);\n painter->save();\n\n QFontMetrics fm(opt.font);\n static int lwidth = fm.width(QLatin1String(\"8888\")) + 18;\n\n QColor backgroundColor;\n QColor textColor;\n\n bool selected = opt.state & QStyle::State_Selected;\n\n if (selected) {\n painter->setBrush(opt.palette.highlight().color());\n backgroundColor = opt.palette.highlight().color();\n if (!m_selectedPixmap)\n generateGradientPixmap(lwidth, fm.height()+1, backgroundColor, selected);\n } else {\n painter->setBrush(opt.palette.background().color());\n backgroundColor = opt.palette.background().color();\n if (!m_normalPixmap)\n generateGradientPixmap(lwidth, fm.height(), backgroundColor, selected);\n }\n painter->setPen(Qt::NoPen);\n painter->drawRect(opt.rect);\n\n \/\/ Set Text Color\n if (opt.state & QStyle::State_Selected)\n textColor = opt.palette.highlightedText().color();\n else\n textColor = opt.palette.text().color();\n\n painter->setPen(textColor);\n\n\n \/\/ TopLeft\n QString topLeft = index.data(BookmarkModel::FileName).toString();\n \/\/painter->drawText(6, 2 + opt.rect.top() + fm.ascent(), topLeft);\n\n QString topRight = index.data(BookmarkModel::LineNumber).toString();\n \/\/ Check whether we need to be fancy and paint some background\n int fwidth = fm.width(topLeft);\n if (fwidth + lwidth > opt.rect.width()) {\n int left = opt.rect.right() - lwidth;\n painter->drawPixmap(left, opt.rect.top(), selected ? m_selectedPixmap : m_normalPixmap);\n }\n \/\/ topRight\n painter->drawText(opt.rect.right() - fm.width(topRight) - 6 , 2 + opt.rect.top() + fm.ascent(), topRight);\n\n \/\/ Directory\n QColor mix;\n mix.setRgbF(0.7 * textColor.redF() + 0.3 * backgroundColor.redF(),\n 0.7 * textColor.greenF() + 0.3 * backgroundColor.greenF(),\n 0.7 * textColor.blueF() + 0.3 * backgroundColor.blueF());\n painter->setPen(mix);\n\n QString directory = index.data(BookmarkModel::FilePath).toString();\n int availableSpace = opt.rect.width() - fm.width(\"888\");\n if (fm.width(directory) > availableSpace) {\n \/\/ We need a shorter directory\n availableSpace -= fm.width(\"...\");\n\n int pos = directory.size();\n int idx;\n forever {\n idx = directory.lastIndexOf(\"\/\", pos-1);\n if (idx == -1) {\n \/\/ Can't happen, this means the string did fit after all?\n break;\n }\n int width = fm.width(directory.mid(idx, pos-idx));\n if (width > availableSpace) {\n directory = \"...\" + directory.mid(pos);\n break;\n } else {\n pos = idx;\n availableSpace -= width;\n }\n }\n }\n\n \/\/painter->drawText(3, opt.rect.top() + fm.ascent() + fm.height() + 6, directory);\n painter->drawText(6, 2 + opt.rect.top() + fm.ascent(), directory);\n\n QString lineText = index.data(BookmarkModel::Note).toString().trimmed();\n if (lineText.isEmpty())\n lineText = index.data(BookmarkModel::LineText).toString().trimmed();\n\n painter->drawText(6, opt.rect.top() + fm.ascent() + fm.height() + 6, lineText);\n\n \/\/ Separator lines\n const QRectF innerRect = QRectF(opt.rect).adjusted(0.5, 0.5, -0.5, -0.5);\n painter->setPen(QColor::fromRgb(150,150,150));\n painter->drawLine(innerRect.bottomLeft(), innerRect.bottomRight());\n painter->restore();\n}\n<|endoftext|>"} {"text":"\/*************************************************************************\n > File Name: fileloader.cpp\n > Author: anryyang\n > Mail: anryyang@gmail.com \n > Created Time: Tue 06 Dec 2016 05:13:05 PM\n ************************************************************************\/\n\n#include \"fileloader.h\"\n\/\/ #include \"timer.h\"\n\nvoid handle_error(const char* msg) {\n perror(msg); \n exit(255);\n}\n\nBigFileLoader::BigFileLoader(std::string file_path):\n m_file_path(file_path){\n load();\n}\n\nBigFileLoader::~BigFileLoader(){\n free();\n}\n\nvoid BigFileLoader::load(){\n auto f = map_file();\n auto l = f + m_length;\n\n m_line_num = 0;\n while (f && f!=l){\n auto e = f;\n if ((f = static_cast(memchr(f, '\\n', l-f)))){\n Line line = std::make_pair(e, f-e);\n m_lines.push_back(line);\n m_line_num++;\n f++;\n }\n }\n }\n\nconst char* BigFileLoader::map_file(){\n m_fd = open(m_file_path.c_str(), O_RDONLY);\n if (-1 == m_fd)\n handle_error(\"open\");\n\n posix_fadvise(m_fd, 0, 0, 1); \/\/ FDADVICE_SEQUENTIAL\n\n \/\/ obtain file size\n struct stat sb;\n if (-1 == fstat(m_fd, &sb))\n handle_error(\"fstat\");\n\n m_length = sb.st_size;\n\n \/\/ const char* addr = static_cast(mmap(NULL, m_length, PROT_READ, MAP_PRIVATE, m_fd, 0u));\n m_file_ptr = static_cast(mmap(NULL, m_length, PROT_READ, MAP_PRIVATE, m_fd, 0u));\n const char* addr = m_file_ptr;\n if (addr == MAP_FAILED)\n handle_error(\"mmap\");\n \n \/\/ TODO close fd at some point in time, call munmap(...)\n \/\/ close(m_fd);\n \/\/ munmap(m_file_ptr, m_length);\n\n return addr;\n}\n\nuintmax_t BigFileLoader::line_num(){\n return m_line_num;\n}\n\nstd::size_t BigFileLoader::size(){\n return m_length;\n}\n\nstd::string BigFileLoader::get_line(uintmax_t line_num){\n if(line_num >= m_line_num) return \"\";\n std::string str(m_lines[line_num].first, m_lines[line_num].second);\n return str;\n}\n\nvoid BigFileLoader::free(){\n m_lines.clear();\n if(m_file_ptr!=NULL){\n if( -1 == munmap( m_file_ptr, m_length ) ){\n handle_error(\"munmap\");\n }\n }\n if(m_fd>0) close(m_fd);\n m_file_ptr = NULL;\n m_length = 0;\n m_line_num = 0;\n}\n\n\/\/ int main(){\n\/\/ Timer timer;\n\/\/ timer.start();\n\/\/ BigFileLoader loader(\"graph.txt\");\n\/\/ timer.stop();\n\/\/ std::cout << \" line number:\" << loader.line_num()\n\/\/ << \" file size:\" << loader.size()\n\/\/ << \" time:\" << timer.elapsed()\n\/\/ << std::endl;\n\/\/ for(int i=0;i<10;i++){\n\/\/ std::cout << \"line\" << i << \" :\" << loader.get_line(i) << std::endl;\n\/\/ }\n\n\/\/ loader.free(); \n\/\/ }add free memory func\/*************************************************************************\n > File Name: fileloader.cpp\n > Author: anryyang\n > Mail: anryyang@gmail.com \n > Created Time: Tue 06 Dec 2016 05:13:05 PM\n ************************************************************************\/\n\n#include \"fileloader.h\"\n\/\/ #include \"timer.h\"\n\nvoid handle_error(const char* msg) {\n perror(msg); \n exit(255);\n}\n\nBigFileLoader::BigFileLoader(std::string file_path):\n m_file_path(file_path){\n load();\n}\n\nBigFileLoader::~BigFileLoader(){\n free();\n}\n\nvoid BigFileLoader::load(){\n auto f = map_file();\n auto l = f + m_length;\n\n m_line_num = 0;\n while (f && f!=l){\n auto e = f;\n if ((f = static_cast(memchr(f, '\\n', l-f)))){\n Line line = std::make_pair(e, f-e);\n m_lines.push_back(line);\n m_line_num++;\n f++;\n }\n }\n }\n\nconst char* BigFileLoader::map_file(){\n m_fd = open(m_file_path.c_str(), O_RDONLY);\n if (-1 == m_fd)\n handle_error(\"open\");\n\n posix_fadvise(m_fd, 0, 0, 1); \/\/ FDADVICE_SEQUENTIAL\n\n \/\/ obtain file size\n struct stat sb;\n if (-1 == fstat(m_fd, &sb))\n handle_error(\"fstat\");\n\n m_length = sb.st_size;\n\n \/\/ const char* addr = static_cast(mmap(NULL, m_length, PROT_READ, MAP_PRIVATE, m_fd, 0u));\n m_file_ptr = static_cast(mmap(NULL, m_length, PROT_READ, MAP_PRIVATE, m_fd, 0u));\n const char* addr = m_file_ptr;\n if (addr == MAP_FAILED)\n handle_error(\"mmap\");\n \n \/\/ TODO close fd at some point in time, call munmap(...)\n \/\/ close(m_fd);\n \/\/ munmap(m_file_ptr, m_length);\n\n return addr;\n}\n\nuintmax_t BigFileLoader::line_num(){\n return m_line_num;\n}\n\nstd::size_t BigFileLoader::size(){\n return m_length;\n}\n\nstd::string BigFileLoader::get_line(uintmax_t line_num){\n if(line_num >= m_line_num) return \"\";\n std::string str(m_lines[line_num].first, m_lines[line_num].second);\n return str;\n}\n\nvoid BigFileLoader::free(){\n m_lines.clear();\n if(m_file_ptr!=NULL){\n if( -1 == munmap( m_file_ptr, m_length ) ){\n handle_error(\"munmap\");\n }\n }\n if(m_fd>0)\n close(m_fd);\n m_file_ptr = NULL;\n m_length = 0;\n m_line_num = 0;\n}\n\n\/\/ int main(){\n\/\/ Timer timer;\n\/\/ timer.start();\n\/\/ BigFileLoader loader(\"graph.txt\");\n\/\/ timer.stop();\n\/\/ std::cout << \" line number:\" << loader.line_num()\n\/\/ << \" file size:\" << loader.size()\n\/\/ << \" time:\" << timer.elapsed()\n\/\/ << std::endl;\n\/\/ for(int i=0;i<10;i++){\n\/\/ std::cout << \"line\" << i << \" :\" << loader.get_line(i) << std::endl;\n\/\/ }\n\n\/\/ loader.free(); \n\/\/ }<|endoftext|>"} {"text":"#include \"core\/mesh.h\"\n#include \"core\/memory.h\"\n#include \nNARUKAMI_BEGIN\n\n MeshData::MeshData(const Transform& object2wrold,int triangle_num,const uint32_t *indices,int vertex_num,const Point3f *vertices,const Normal3f *normals,const Point2f *uvs){\n assert(vertices!=nullptr);\n assert(indices!=nullptr);\n \n this->indices = std::unique_ptr(new uint32_t[triangle_num*3]);\n memcpy(this->indices.get(),indices,sizeof(uint32_t)*triangle_num*3);\n this->vertices=std::unique_ptr(new Point3f[vertex_num]);\n for(int i=0;ivertices[i]=object2wrold(vertices[i]);\n }\n\n if(normals){\n this->normals=std::unique_ptr(new Normal3f[vertex_num]);\n for(int i=0;inormals[i]=object2wrold(normals[i]);\n }\n }\n\n if(uvs){\n this->uvs=std::unique_ptr(new Point2f[vertex_num]);\n for(int i=0;iuvs[i]=uvs[i];\n }\n }\n \n\n }\n\n std::vector cast2SoA(const std::vector>& triangles,uint32_t start,uint32_t count){\n assert(count>0);\n assert((start+count)<=triangles.size());\n\n size_t soa_count = (uint32_t)count\/SSE_FLOAT_COUNT + 1;\n\n std::vector v0_array;\n std::vector e1_array;\n std::vector e2_array;\n\n for(size_t i=0;i soa_triangles;\n \n for(size_t i=0;i> create_mesh_triangles(const Transform* object2wrold,const Transform* world2object,int triangle_num,const uint32_t *indices,int vertex_num,const Point3f *vertices,const Normal3f *normals,const Point2f *uvs){\n std::shared_ptr mesh_data=std::make_shared(*object2wrold,triangle_num,indices,vertex_num,vertices,normals,uvs);\n std::vector> triangles;\n for(int i=0;i(object2wrold,world2object,mesh_data,&indices[3*i]));\n }\n return triangles;\n}\n\nNARUKAMI_ENDadd a TODO#include \"core\/mesh.h\"\n#include \"core\/memory.h\"\n#include \nNARUKAMI_BEGIN\n\n MeshData::MeshData(const Transform& object2wrold,int triangle_num,const uint32_t *indices,int vertex_num,const Point3f *vertices,const Normal3f *normals,const Point2f *uvs){\n assert(vertices!=nullptr);\n assert(indices!=nullptr);\n \n this->indices = std::unique_ptr(new uint32_t[triangle_num*3]);\n memcpy(this->indices.get(),indices,sizeof(uint32_t)*triangle_num*3);\n this->vertices=std::unique_ptr(new Point3f[vertex_num]);\n for(int i=0;ivertices[i]=object2wrold(vertices[i]);\n }\n\n if(normals){\n this->normals=std::unique_ptr(new Normal3f[vertex_num]);\n for(int i=0;inormals[i]=object2wrold(normals[i]);\n }\n }\n\n if(uvs){\n this->uvs=std::unique_ptr(new Point2f[vertex_num]);\n for(int i=0;iuvs[i]=uvs[i];\n }\n }\n \n\n }\n\n \/\/TODO SSE alignas\n std::vector cast2SoA(const std::vector>& triangles,uint32_t start,uint32_t count){\n assert(count>0);\n assert((start+count)<=triangles.size());\n\n size_t soa_count = (uint32_t)count\/SSE_FLOAT_COUNT + 1;\n\n std::vector v0_array;\n std::vector e1_array;\n std::vector e2_array;\n\n for(size_t i=0;i soa_triangles;\n \n for(size_t i=0;i> create_mesh_triangles(const Transform* object2wrold,const Transform* world2object,int triangle_num,const uint32_t *indices,int vertex_num,const Point3f *vertices,const Normal3f *normals,const Point2f *uvs){\n std::shared_ptr mesh_data=std::make_shared(*object2wrold,triangle_num,indices,vertex_num,vertices,normals,uvs);\n std::vector> triangles;\n for(int i=0;i(object2wrold,world2object,mesh_data,&indices[3*i]));\n }\n return triangles;\n}\n\nNARUKAMI_END<|endoftext|>"} {"text":"#include \"regex.h\"\n#include \n#include \"pcre2.h\"\n\nusing std::u16string;\nusing MatchResult = Regex::MatchResult;\n\nconst char16_t EMPTY_PATTERN[] = u\".{0}\";\n\nRegex::Regex() : code{nullptr} {}\n\nstatic u16string preprocess_pattern(const char16_t *pattern, uint32_t length) {\n u16string result;\n for (unsigned i = 0; i < length;) {\n char16_t c = pattern[i];\n\n \/\/ Replace escape sequences like '\\u00cf' with their literal UTF16 value\n if (c == '\\\\' && i + 1 < length && pattern[i + 1] == 'u') {\n if (i + 6 <= length) {\n std::string char_code_string(&pattern[i + 2], &pattern[i + 6]);\n char16_t char_code_value = strtol(char_code_string.data(), nullptr, 16);\n if (char_code_value != 0) {\n result += char_code_value;\n i += 6;\n continue;\n }\n }\n\n \/\/ Replace invalid '\\u' escape sequences with the literal characters '\\' and 'u'\n result += u\"\\\\\\\\u\";\n i += 2;\n continue;\n }\n\n result += c;\n i++;\n }\n\n return result;\n}\n\n\nRegex::Regex(const char16_t *pattern, uint32_t pattern_length, u16string *error_message, bool ignore_case) {\n if (pattern_length == 0) {\n pattern = EMPTY_PATTERN;\n pattern_length = 4;\n }\n\n u16string final_pattern = preprocess_pattern(pattern, pattern_length);\n\n int error_number = 0;\n size_t error_offset = 0;\n uint32_t options = PCRE2_MULTILINE;\n if (ignore_case) options |= PCRE2_CASELESS;\n code = pcre2_compile(\n reinterpret_cast(final_pattern.data()),\n final_pattern.size(),\n options,\n &error_number,\n &error_offset,\n nullptr\n );\n\n if (!code) {\n uint16_t message_buffer[256];\n size_t length = pcre2_get_error_message(error_number, message_buffer, 256);\n error_message->assign(message_buffer, message_buffer + length);\n return;\n }\n\n pcre2_jit_compile(\n code,\n PCRE2_JIT_COMPLETE|PCRE2_JIT_PARTIAL_HARD|PCRE2_JIT_PARTIAL_SOFT\n );\n}\n\nRegex::Regex(const u16string &pattern, u16string *error_message, bool ignore_case)\n : Regex(pattern.data(), pattern.size(), error_message, ignore_case) {}\n\nRegex::Regex(Regex &&other) : code{other.code} {\n other.code = nullptr;\n}\n\nRegex::~Regex() {\n if (code) pcre2_code_free(code);\n}\n\nRegex::MatchData::MatchData(const Regex ®ex)\n : data{pcre2_match_data_create_from_pattern(regex.code, nullptr)} {}\n\nRegex::MatchData::~MatchData() {\n pcre2_match_data_free(data);\n}\n\nMatchResult Regex::match(const char16_t *string, size_t length,\n MatchData &match_data, unsigned options) const {\n MatchResult result{MatchResult::None, 0, 0};\n\n unsigned int pcre_options = 0;\n if (!(options & MatchOptions::IsEndSearch)) pcre_options |= PCRE2_PARTIAL_HARD;\n if (!(options & MatchOptions::IsBeginningOfLine)) pcre_options |= PCRE2_NOTBOL;\n if (!(options & MatchOptions::IsEndOfLine)) pcre_options |= PCRE2_NOTEOL;\n\n int status = pcre2_match(\n code,\n reinterpret_cast(string),\n length,\n 0,\n pcre_options,\n match_data.data,\n nullptr\n );\n\n if (status < 0) {\n switch (status) {\n case PCRE2_ERROR_PARTIAL:\n result.type = MatchResult::Partial;\n result.start_offset = pcre2_get_ovector_pointer(match_data.data)[0];\n result.end_offset = pcre2_get_ovector_pointer(match_data.data)[1];\n break;\n case PCRE2_ERROR_NOMATCH:\n result.type = MatchResult::None;\n break;\n default:\n result.type = MatchResult::Error;\n break;\n }\n } else {\n result.type = MatchResult::Full;\n result.start_offset = pcre2_get_ovector_pointer(match_data.data)[0];\n result.end_offset = pcre2_get_ovector_pointer(match_data.data)[1];\n }\n\n return result;\n}\nConfigure pcre2 to always treat \\r and \\n as newlines#include \"regex.h\"\n#include \n#include \"pcre2.h\"\n\nusing std::u16string;\nusing MatchResult = Regex::MatchResult;\n\nconst char16_t EMPTY_PATTERN[] = u\".{0}\";\n\nRegex::Regex() : code{nullptr} {}\n\nstatic u16string preprocess_pattern(const char16_t *pattern, uint32_t length) {\n u16string result;\n for (unsigned i = 0; i < length;) {\n char16_t c = pattern[i];\n\n \/\/ Replace escape sequences like '\\u00cf' with their literal UTF16 value\n if (c == '\\\\' && i + 1 < length && pattern[i + 1] == 'u') {\n if (i + 6 <= length) {\n std::string char_code_string(&pattern[i + 2], &pattern[i + 6]);\n char16_t char_code_value = strtol(char_code_string.data(), nullptr, 16);\n if (char_code_value != 0) {\n result += char_code_value;\n i += 6;\n continue;\n }\n }\n\n \/\/ Replace invalid '\\u' escape sequences with the literal characters '\\' and 'u'\n result += u\"\\\\\\\\u\";\n i += 2;\n continue;\n }\n\n result += c;\n i++;\n }\n\n return result;\n}\n\n\nRegex::Regex(const char16_t *pattern, uint32_t pattern_length, u16string *error_message, bool ignore_case) {\n if (pattern_length == 0) {\n pattern = EMPTY_PATTERN;\n pattern_length = 4;\n }\n\n u16string final_pattern = preprocess_pattern(pattern, pattern_length);\n\n pcre2_compile_context *context = pcre2_compile_context_create(nullptr);\n pcre2_set_newline(context, PCRE2_NEWLINE_ANY);\n\n int error_number = 0;\n size_t error_offset = 0;\n uint32_t options = PCRE2_MULTILINE;\n if (ignore_case) options |= PCRE2_CASELESS;\n code = pcre2_compile(\n reinterpret_cast(final_pattern.data()),\n final_pattern.size(),\n options,\n &error_number,\n &error_offset,\n context\n );\n pcre2_compile_context_free(context);\n\n if (!code) {\n uint16_t message_buffer[256];\n size_t length = pcre2_get_error_message(error_number, message_buffer, 256);\n error_message->assign(message_buffer, message_buffer + length);\n return;\n }\n\n pcre2_jit_compile(\n code,\n PCRE2_JIT_COMPLETE|PCRE2_JIT_PARTIAL_HARD|PCRE2_JIT_PARTIAL_SOFT\n );\n}\n\nRegex::Regex(const u16string &pattern, u16string *error_message, bool ignore_case)\n : Regex(pattern.data(), pattern.size(), error_message, ignore_case) {}\n\nRegex::Regex(Regex &&other) : code{other.code} {\n other.code = nullptr;\n}\n\nRegex::~Regex() {\n if (code) pcre2_code_free(code);\n}\n\nRegex::MatchData::MatchData(const Regex ®ex)\n : data{pcre2_match_data_create_from_pattern(regex.code, nullptr)} {}\n\nRegex::MatchData::~MatchData() {\n pcre2_match_data_free(data);\n}\n\nMatchResult Regex::match(const char16_t *string, size_t length,\n MatchData &match_data, unsigned options) const {\n MatchResult result{MatchResult::None, 0, 0};\n\n unsigned int pcre_options = 0;\n if (!(options & MatchOptions::IsEndSearch)) pcre_options |= PCRE2_PARTIAL_HARD;\n if (!(options & MatchOptions::IsBeginningOfLine)) pcre_options |= PCRE2_NOTBOL;\n if (!(options & MatchOptions::IsEndOfLine)) pcre_options |= PCRE2_NOTEOL;\n\n int status = pcre2_match(\n code,\n reinterpret_cast(string),\n length,\n 0,\n pcre_options,\n match_data.data,\n nullptr\n );\n\n if (status < 0) {\n switch (status) {\n case PCRE2_ERROR_PARTIAL:\n result.type = MatchResult::Partial;\n result.start_offset = pcre2_get_ovector_pointer(match_data.data)[0];\n result.end_offset = pcre2_get_ovector_pointer(match_data.data)[1];\n break;\n case PCRE2_ERROR_NOMATCH:\n result.type = MatchResult::None;\n break;\n default:\n result.type = MatchResult::Error;\n break;\n }\n } else {\n result.type = MatchResult::Full;\n result.start_offset = pcre2_get_ovector_pointer(match_data.data)[0];\n result.end_offset = pcre2_get_ovector_pointer(match_data.data)[1];\n }\n\n return result;\n}\n<|endoftext|>"} {"text":"\/*\n * Copyright 2016 Marcus Soll\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, 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 \"csvhandle.h\"\n\n#include \n#include \n\nCSVHandle::CSVHandle(QObject *parent) : QObject(parent)\n{\n}\n\nQStringList CSVHandle::loadCSV(QString path, CSVHandle::seperator sep, bool has_header, int column_word, int column_translation, int column_priority, bool import_priority)\n{\n QStringList errors;\n\n if(column_priority < 0 || column_translation < 0 || column_word < 0)\n {\n errors << tr(\"All column indices must be positive or zero\");\n return errors;\n }\n\n QFile file(path);\n\n if(!file.open(QIODevice::ReadOnly | QIODevice::Text))\n {\n QString error = QString(tr(\"Can not open file \\\"%1\\\": %2\")).arg(path).arg(file.errorString());\n WARNING(error);\n errors << error;\n return errors;\n }\n\n QTextStream stream(&file);\n\n database.transaction();\n QSqlQuery q(database);\n QString s = \"INSERT OR ABORT INTO vocabulary VALUES (?,?,100)\";\n\n int need_num_columns = qMax(column_word, column_translation);\n QChar sep_char = getSeperator(sep);\n\n if(import_priority)\n {\n need_num_columns = qMax(need_num_columns, column_priority);\n s = \"INSERT OR ABORT INTO vocabulary VALUES (?,?,?)\";\n }\n\n if(has_header)\n {\n \/\/ Ignore header\n stream.readLine();\n }\n\n while(!stream.atEnd())\n {\n QString line = stream.readLine();\n QStringList columns = line.split(sep_char, QString::KeepEmptyParts);\n if(columns.size() < need_num_columns+1)\n {\n QString error = QString(tr(\"Error at \\\"%1\\\": Column to small\")).arg(line);\n WARNING(error);\n errors << error;\n continue;\n }\n q.prepare(s);\n q.addBindValue(columns[column_word]);\n q.addBindValue(columns[column_translation]);\n if(import_priority)\n {\n bool ok = true;\n int priority = qBound(1, columns[column_priority].toInt(&ok), 100);\n if(!ok)\n {\n priority = 100;\n QString error = QString(tr(\"Can not convert \\\"%1\\\" to priority\")).arg(columns[column_priority]);\n WARNING(error);\n errors << error;\n }\n q.addBindValue(priority);\n }\n\n if(!q.exec())\n {\n QString error = s.append(\": \").append(q.lastError().text());\n WARNING(error);\n errors << error;\n }\n }\n\n if(!database.commit())\n {\n errors << database.lastError().text();\n }\n return errors;\n}\n\nQStringList CSVHandle::saveCSV(QString path, CSVHandle::seperator sep, bool write_header)\n{\n QStringList errors;\n\n QFile file(path);\n\n if(!file.open(QIODevice::WriteOnly | QIODevice::Text))\n {\n QString error = QString(tr(\"Can not open file \\\"%1\\\": %2\")).arg(path).arg(file.errorString());\n WARNING(error);\n errors << error;\n return errors;\n }\n\n QTextStream stream(&file);\n\n QSqlQuery q(database);\n QString s = \"SELECT word,translation,priority FROM vocabulary\";\n\n if(!q.exec(s))\n {\n QString error = s.append(\": \").append(q.lastError().text());\n WARNING(error);\n errors << error;\n file.close();\n return errors;\n }\n if(!q.isSelect())\n {\n QString error = s.append(\": No select\");\n WARNING(error);\n errors << error;\n file.close();\n return errors;\n }\n\n QChar sep_char = getSeperator(sep);\n\n if(write_header)\n {\n stream << QString(tr(\"word%1translation%1priority\\n\")).arg(sep_char);\n }\n\n while(q.next())\n {\n QString line;\n line.append(q.value(0).toString());\n line.append(sep_char);\n line.append(q.value(1).toString());\n line.append(sep_char);\n line.append(q.value(2).toString());\n line.append('\\n');\n stream << line;\n }\n\n file.close();\n return errors;\n}\n\nQChar CSVHandle::getSeperator(CSVHandle::seperator sep)\n{\n switch(sep)\n {\n case TAB:\n return QChar('\\t');\n break;\n case SPACE:\n return QChar(' ');\n break;\n case COMMA:\n return QChar(',');\n break;\n case SEMICOLON:\n return QChar(';');\n break;\n }\n Q_UNREACHABLE();\n}\n\nUse UTF-8 for handling CSV files.\/*\n * Copyright 2016 Marcus Soll\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, 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 \"csvhandle.h\"\n\n#include \n#include \n#include \n\nCSVHandle::CSVHandle(QObject *parent) : QObject(parent)\n{\n}\n\nQStringList CSVHandle::loadCSV(QString path, CSVHandle::seperator sep, bool has_header, int column_word, int column_translation, int column_priority, bool import_priority)\n{\n QStringList errors;\n\n if(column_priority < 0 || column_translation < 0 || column_word < 0)\n {\n errors << tr(\"All column indices must be positive or zero\");\n return errors;\n }\n\n QFile file(path);\n\n if(!file.open(QIODevice::ReadOnly | QIODevice::Text))\n {\n QString error = QString(tr(\"Can not open file \\\"%1\\\": %2\")).arg(path).arg(file.errorString());\n WARNING(error);\n errors << error;\n return errors;\n }\n\n QTextStream stream(&file);\n stream.setCodec(QTextCodec::codecForName(\"UTF-8\"));\n\n database.transaction();\n QSqlQuery q(database);\n QString s = \"INSERT OR ABORT INTO vocabulary VALUES (?,?,100)\";\n\n int need_num_columns = qMax(column_word, column_translation);\n QChar sep_char = getSeperator(sep);\n\n if(import_priority)\n {\n need_num_columns = qMax(need_num_columns, column_priority);\n s = \"INSERT OR ABORT INTO vocabulary VALUES (?,?,?)\";\n }\n\n if(has_header)\n {\n \/\/ Ignore header\n stream.readLine();\n }\n\n while(!stream.atEnd())\n {\n QString line = stream.readLine();\n QStringList columns = line.split(sep_char, QString::KeepEmptyParts);\n if(columns.size() < need_num_columns+1)\n {\n QString error = QString(tr(\"Error at \\\"%1\\\": Column to small\")).arg(line);\n WARNING(error);\n errors << error;\n continue;\n }\n q.prepare(s);\n q.addBindValue(columns[column_word]);\n q.addBindValue(columns[column_translation]);\n if(import_priority)\n {\n bool ok = true;\n int priority = qBound(1, columns[column_priority].toInt(&ok), 100);\n if(!ok)\n {\n priority = 100;\n QString error = QString(tr(\"Can not convert \\\"%1\\\" to priority\")).arg(columns[column_priority]);\n WARNING(error);\n errors << error;\n }\n q.addBindValue(priority);\n }\n\n if(!q.exec())\n {\n QString error = s.append(\": \").append(q.lastError().text());\n WARNING(error);\n errors << error;\n }\n }\n\n if(!database.commit())\n {\n errors << database.lastError().text();\n }\n return errors;\n}\n\nQStringList CSVHandle::saveCSV(QString path, CSVHandle::seperator sep, bool write_header)\n{\n QStringList errors;\n\n QFile file(path);\n\n if(!file.open(QIODevice::WriteOnly | QIODevice::Text))\n {\n QString error = QString(tr(\"Can not open file \\\"%1\\\": %2\")).arg(path).arg(file.errorString());\n WARNING(error);\n errors << error;\n return errors;\n }\n\n QTextStream stream(&file);\n stream.setCodec(QTextCodec::codecForName(\"UTF-8\"));\n\n QSqlQuery q(database);\n QString s = \"SELECT word,translation,priority FROM vocabulary\";\n\n if(!q.exec(s))\n {\n QString error = s.append(\": \").append(q.lastError().text());\n WARNING(error);\n errors << error;\n file.close();\n return errors;\n }\n if(!q.isSelect())\n {\n QString error = s.append(\": No select\");\n WARNING(error);\n errors << error;\n file.close();\n return errors;\n }\n\n QChar sep_char = getSeperator(sep);\n\n if(write_header)\n {\n stream << QString(tr(\"word%1translation%1priority\\n\")).arg(sep_char);\n }\n\n while(q.next())\n {\n QString line;\n line.append(q.value(0).toString());\n line.append(sep_char);\n line.append(q.value(1).toString());\n line.append(sep_char);\n line.append(q.value(2).toString());\n line.append('\\n');\n stream << line;\n }\n\n file.close();\n return errors;\n}\n\nQChar CSVHandle::getSeperator(CSVHandle::seperator sep)\n{\n switch(sep)\n {\n case TAB:\n return QChar('\\t');\n break;\n case SPACE:\n return QChar(' ');\n break;\n case COMMA:\n return QChar(',');\n break;\n case SEMICOLON:\n return QChar(';');\n break;\n }\n Q_UNREACHABLE();\n}\n\n<|endoftext|>"} {"text":"#include \"cvm.h\"\n#include \"..\/cshared\/disasm.h\"\n\nvoid DabVM_debug::print_registers()\n{\n fprintf(stderr, \"IP = %p (%d)\\n\", (void *)vm.ip(), (int)vm.ip());\n}\n\nvoid DabVM_debug::print_ssa_registers()\n{\n auto err_stream = $VM->options.output;\n fprintf(err_stream, \"Registers:\\n\");\n size_t index = 0;\n for (const auto ® : vm._registers)\n {\n fprintf(err_stream, \"R%zu: \", index);\n reg.dump(err_stream);\n fprintf(err_stream, \"\\n\");\n }\n}\n\nvoid DabVM_debug::print_classes()\n{\n for (const auto &it : vm.classes)\n {\n fprintf(stderr, \" - 0x%04x %s (super = 0x%04x)\\n\", it.first, it.second.name.c_str(),\n it.second.superclass_index);\n for (const auto &fin : it.second.static_functions)\n {\n fprintf(stderr, \" ::%s [%s]\\n\", $VM->get_symbol(fin.first).c_str(),\n fin.second.regular ? \"Dab\" : \"C\");\n }\n for (const auto &fin : it.second.functions)\n {\n fprintf(stderr, \" .%s [%s]\\n\", $VM->get_symbol(fin.first).c_str(),\n fin.second.regular ? \"Dab\" : \"C\");\n }\n }\n}\n\nvoid DabVM_debug::print_functions()\n{\n for (auto it : vm.functions)\n {\n auto &fun = it.second;\n fprintf(stderr, \" - %s: %s at %p\\n\", fun.name.c_str(), fun.regular ? \"Dab\" : \"C\",\n (void *)fun.address);\n }\n}\n\nvoid DabVM_debug::print_constants()\n{\n auto output = $VM->options.output;\n fprintf(output, \"symbols:\\n\");\n size_t i = 0;\n for (const auto &symbol : $VM->symbols)\n {\n fprintf(output, \"%d: %s\\n\", (int)i, symbol.c_str());\n i++;\n }\n}\n\nvoid DabVM_debug::print_stack()\n{\n}\n\nvoid DabVM_debug::print_code(bool current_only)\n{\n prepare_disasm();\n\n auto err_stream = $VM->options.output;\n\n auto ip = vm.ip();\n\n fprintf(err_stream, \"IP = %d\\n\", (int)ip);\n\n auto it = find_if(disasm.begin(), disasm.end(),\n [ip](const std::pair &obj) { return obj.first == ip; });\n\n if (it == disasm.end())\n return;\n\n auto index = std::distance(disasm.begin(), it);\n\n long start = current_only ? (index - 2) : 0;\n long end = current_only ? (index + 3) : disasm.size();\n\n for (long i = start; i < end; i++)\n {\n if (i < 0 || i >= (int)disasm.size())\n continue;\n\n const auto &line = disasm[i];\n fprintf(err_stream, \"%c %8ld: %s\\n\", line.first == ip ? '>' : ' ', line.first,\n line.second.c_str());\n }\n}\n\nstruct InstructionsReader : public BaseReader\n{\n DabVM &vm;\n\n const byte *_data;\n size_t _length;\n\n size_t start_position = 0;\n\n InstructionsReader(DabVM &vm, size_t &position) : BaseReader(position), vm(vm)\n {\n _data = vm.instructions.raw_base_data();\n _length = vm.instructions.raw_base_length();\n\n BinSection code_section;\n bool has_code = false;\n\n for (auto §ion : vm.sections)\n {\n if (std::string(section.name) == \"code\")\n {\n code_section = section;\n has_code = true;\n break;\n }\n }\n\n if (!has_code)\n throw \"no code?\";\n\n start_position = code_section.pos;\n\n _data += start_position;\n _length = code_section.length;\n }\n\n virtual size_t raw_read(void *buffer, size_t size) override\n {\n auto data = _data;\n auto length = _length;\n auto offset = position();\n auto max_length = std::min(size, length - offset);\n\n memcpy(buffer, data + offset, max_length);\n\n return max_length;\n }\n\n bool feof()\n {\n return false;\n }\n};\n\nvoid DabVM_debug::prepare_disasm()\n{\n if (has_disasm)\n return;\n\n has_disasm = true;\n\n size_t position = 0;\n InstructionsReader reader(vm, position);\n DisasmProcessor processor(reader);\n\n processor.go([this, reader](size_t pos, std::string info) {\n disasm.push_back(std::make_pair(pos + reader.start_position, info));\n });\n}\n\nvoid DabVM::execute_debug(Stream &input)\n{\n auto err_stream = options.output;\n\n DabVM_debug debug(*this);\n while (!input.eof())\n {\n char rawcmd[2048];\n fprintf(stderr, \"> \");\n fgets(rawcmd, sizeof(rawcmd), stdin);\n std::string cmd = rawcmd;\n\n cmd = cmd.substr(0, cmd.length() - 1);\n\n if (cmd == \"help\")\n {\n fprintf(err_stream, \"Help:\\n\");\n fprintf(err_stream, \"help - print this\\n\");\n fprintf(err_stream, \"[s]tep - run single instruction\\n\");\n fprintf(err_stream, \"[r]egisters - show registers\\n\");\n fprintf(err_stream, \"classes - print classes\\n\");\n fprintf(err_stream, \"functions - print functions\\n\");\n fprintf(err_stream, \"constants - dump constants\\n\");\n fprintf(err_stream, \"stack - dump stack\\n\");\n fprintf(err_stream, \"code - show current code\\n\");\n fprintf(err_stream, \"allcode - show all code\\n\");\n fprintf(err_stream, \"run - run remaining instructions\\n\");\n fprintf(err_stream, \"break [ip] - break at defined IP\\n\");\n fprintf(err_stream, \"quit - quit\\n\");\n }\n else if (cmd == \"step\" || cmd == \"s\")\n {\n execute_single(input);\n }\n else if (cmd == \"registers\" || cmd == \"r\")\n {\n debug.print_registers();\n }\n else if (cmd == \"classes\")\n {\n debug.print_classes();\n }\n else if (cmd == \"functions\")\n {\n debug.print_functions();\n }\n else if (cmd == \"constants\")\n {\n debug.print_constants();\n }\n else if (cmd == \"stack\")\n {\n debug.print_stack();\n }\n else if (cmd == \"ip\")\n {\n fprintf(err_stream, \"IP = %zu\\n\", ip());\n }\n else if (cmd == \"code\")\n {\n debug.print_code(true);\n }\n else if (cmd == \"allcode\")\n {\n debug.print_code(false);\n }\n else if (cmd == \"quit\")\n {\n exit(0);\n }\n else if (cmd == \"run\")\n {\n execute(input);\n }\n else if (cmd.substr(0, 6) == \"break \")\n {\n int ip = 0;\n int ret = sscanf(cmd.c_str(), \"break %d\", &ip);\n assert(ret == 1);\n fprintf(err_stream, \"debug: break at %d.\\n\", ip);\n breakpoints.insert(ip);\n }\n else if (cmd == \"ssaregs\")\n {\n debug.print_ssa_registers();\n }\n else\n {\n fprintf(stderr, \"Unknown command, type to get available commands.\\n\");\n }\n }\n}\nvm: fix debug type specifier on windows#include \"cvm.h\"\n#include \"..\/cshared\/disasm.h\"\n\nvoid DabVM_debug::print_registers()\n{\n fprintf(stderr, \"IP = %p (%d)\\n\", (void *)vm.ip(), (int)vm.ip());\n}\n\nvoid DabVM_debug::print_ssa_registers()\n{\n auto err_stream = $VM->options.output;\n fprintf(err_stream, \"Registers:\\n\");\n size_t index = 0;\n for (const auto ® : vm._registers)\n {\n fprintf(err_stream, \"R%zu: \", index);\n reg.dump(err_stream);\n fprintf(err_stream, \"\\n\");\n }\n}\n\nvoid DabVM_debug::print_classes()\n{\n for (const auto &it : vm.classes)\n {\n fprintf(stderr, \" - 0x%04x %s (super = 0x%04x)\\n\", it.first, it.second.name.c_str(),\n it.second.superclass_index);\n for (const auto &fin : it.second.static_functions)\n {\n fprintf(stderr, \" ::%s [%s]\\n\", $VM->get_symbol(fin.first).c_str(),\n fin.second.regular ? \"Dab\" : \"C\");\n }\n for (const auto &fin : it.second.functions)\n {\n fprintf(stderr, \" .%s [%s]\\n\", $VM->get_symbol(fin.first).c_str(),\n fin.second.regular ? \"Dab\" : \"C\");\n }\n }\n}\n\nvoid DabVM_debug::print_functions()\n{\n for (auto it : vm.functions)\n {\n auto &fun = it.second;\n fprintf(stderr, \" - %s: %s at %p\\n\", fun.name.c_str(), fun.regular ? \"Dab\" : \"C\",\n (void *)fun.address);\n }\n}\n\nvoid DabVM_debug::print_constants()\n{\n auto output = $VM->options.output;\n fprintf(output, \"symbols:\\n\");\n size_t i = 0;\n for (const auto &symbol : $VM->symbols)\n {\n fprintf(output, \"%d: %s\\n\", (int)i, symbol.c_str());\n i++;\n }\n}\n\nvoid DabVM_debug::print_stack()\n{\n}\n\nvoid DabVM_debug::print_code(bool current_only)\n{\n prepare_disasm();\n\n auto err_stream = $VM->options.output;\n\n auto ip = vm.ip();\n\n fprintf(err_stream, \"IP = %d\\n\", (int)ip);\n\n auto it = find_if(disasm.begin(), disasm.end(),\n [ip](const std::pair &obj) { return obj.first == ip; });\n\n if (it == disasm.end())\n return;\n\n auto index = std::distance(disasm.begin(), it);\n\n long start = current_only ? (index - 2) : 0;\n long end = current_only ? (index + 3) : disasm.size();\n\n for (long i = start; i < end; i++)\n {\n if (i < 0 || i >= (int)disasm.size())\n continue;\n\n const auto &line = disasm[i];\n fprintf(err_stream, \"%c %8\" PRIu64 \": %s\\n\", line.first == ip ? '>' : ' ', line.first,\n line.second.c_str());\n }\n}\n\nstruct InstructionsReader : public BaseReader\n{\n DabVM &vm;\n\n const byte *_data;\n size_t _length;\n\n size_t start_position = 0;\n\n InstructionsReader(DabVM &vm, size_t &position) : BaseReader(position), vm(vm)\n {\n _data = vm.instructions.raw_base_data();\n _length = vm.instructions.raw_base_length();\n\n BinSection code_section;\n bool has_code = false;\n\n for (auto §ion : vm.sections)\n {\n if (std::string(section.name) == \"code\")\n {\n code_section = section;\n has_code = true;\n break;\n }\n }\n\n if (!has_code)\n throw \"no code?\";\n\n start_position = code_section.pos;\n\n _data += start_position;\n _length = code_section.length;\n }\n\n virtual size_t raw_read(void *buffer, size_t size) override\n {\n auto data = _data;\n auto length = _length;\n auto offset = position();\n auto max_length = std::min(size, length - offset);\n\n memcpy(buffer, data + offset, max_length);\n\n return max_length;\n }\n\n bool feof()\n {\n return false;\n }\n};\n\nvoid DabVM_debug::prepare_disasm()\n{\n if (has_disasm)\n return;\n\n has_disasm = true;\n\n size_t position = 0;\n InstructionsReader reader(vm, position);\n DisasmProcessor processor(reader);\n\n processor.go([this, reader](size_t pos, std::string info) {\n disasm.push_back(std::make_pair(pos + reader.start_position, info));\n });\n}\n\nvoid DabVM::execute_debug(Stream &input)\n{\n auto err_stream = options.output;\n\n DabVM_debug debug(*this);\n while (!input.eof())\n {\n char rawcmd[2048];\n fprintf(stderr, \"> \");\n fgets(rawcmd, sizeof(rawcmd), stdin);\n std::string cmd = rawcmd;\n\n cmd = cmd.substr(0, cmd.length() - 1);\n\n if (cmd == \"help\")\n {\n fprintf(err_stream, \"Help:\\n\");\n fprintf(err_stream, \"help - print this\\n\");\n fprintf(err_stream, \"[s]tep - run single instruction\\n\");\n fprintf(err_stream, \"[r]egisters - show registers\\n\");\n fprintf(err_stream, \"classes - print classes\\n\");\n fprintf(err_stream, \"functions - print functions\\n\");\n fprintf(err_stream, \"constants - dump constants\\n\");\n fprintf(err_stream, \"stack - dump stack\\n\");\n fprintf(err_stream, \"code - show current code\\n\");\n fprintf(err_stream, \"allcode - show all code\\n\");\n fprintf(err_stream, \"run - run remaining instructions\\n\");\n fprintf(err_stream, \"break [ip] - break at defined IP\\n\");\n fprintf(err_stream, \"quit - quit\\n\");\n }\n else if (cmd == \"step\" || cmd == \"s\")\n {\n execute_single(input);\n }\n else if (cmd == \"registers\" || cmd == \"r\")\n {\n debug.print_registers();\n }\n else if (cmd == \"classes\")\n {\n debug.print_classes();\n }\n else if (cmd == \"functions\")\n {\n debug.print_functions();\n }\n else if (cmd == \"constants\")\n {\n debug.print_constants();\n }\n else if (cmd == \"stack\")\n {\n debug.print_stack();\n }\n else if (cmd == \"ip\")\n {\n fprintf(err_stream, \"IP = %zu\\n\", ip());\n }\n else if (cmd == \"code\")\n {\n debug.print_code(true);\n }\n else if (cmd == \"allcode\")\n {\n debug.print_code(false);\n }\n else if (cmd == \"quit\")\n {\n exit(0);\n }\n else if (cmd == \"run\")\n {\n execute(input);\n }\n else if (cmd.substr(0, 6) == \"break \")\n {\n int ip = 0;\n int ret = sscanf(cmd.c_str(), \"break %d\", &ip);\n assert(ret == 1);\n fprintf(err_stream, \"debug: break at %d.\\n\", ip);\n breakpoints.insert(ip);\n }\n else if (cmd == \"ssaregs\")\n {\n debug.print_ssa_registers();\n }\n else\n {\n fprintf(stderr, \"Unknown command, type to get available commands.\\n\");\n }\n }\n}\n<|endoftext|>"} {"text":"\/*\n * cgreterm.hpp\n *\n * Created on: 18.08.2014\n * Author: andreas\n *\/\n\n#ifndef CGRETERM_HPP_\n#define CGRETERM_HPP_\n\n#include \n#include \n#include \n#include \n#include \n\n#include \n#include \n#include \n#include \n#include \n#include \n#include \n\n#include \n\n\nnamespace roflibs {\nnamespace gre {\n\nclass eGreTermBase : public std::runtime_error {\npublic:\n\teGreTermBase(const std::string& __arg) : std::runtime_error(__arg) {};\n};\nclass eGreTermNotFound : public eGreTermBase {\npublic:\n\teGreTermNotFound(const std::string& __arg) : eGreTermBase(__arg) {};\n};\n\n\n\/*\n * -ingress- means: send traffic into the tunnel\n * -egress- means: strip the tunnel and send traffic to the external world\n *\/\nclass cgreterm {\npublic:\n\n\t\/**\n\t *\n\t *\/\n\tcgreterm() :\n\t\tstate(STATE_DETACHED), eth_ofp_table_id(0), gre_ofp_table_id(0), ip_fwd_ofp_table_id(0),\n\t\tidle_timeout(DEFAULT_IDLE_TIMEOUT),\n\t\tgre_portno(0), gre_key(0) {};\n\n\t\/**\n\t *\n\t *\/\n\t~cgreterm() {};\n\n\t\/**\n\t *\n\t *\/\n\tcgreterm(const rofl::cdpid& dpid, uint8_t eth_ofp_table_id,\n\t\t\tuint8_t gre_ofp_table_id, uint8_t ip_fwd_ofp_table_id,\n\t\t\tuint32_t gre_portno, uint32_t gre_key) :\n\t\tstate(STATE_DETACHED), dpid(dpid), eth_ofp_table_id(eth_ofp_table_id),\n\t\tgre_ofp_table_id(gre_ofp_table_id), ip_fwd_ofp_table_id(ip_fwd_ofp_table_id),\n\t\tidle_timeout(DEFAULT_IDLE_TIMEOUT),\n\t\tgre_portno(gre_portno), gre_key(gre_key) {};\n\n\t\/**\n\t *\n\t *\/\n\tcgreterm(const cgreterm& greterm) { *this = greterm; };\n\n\t\/**\n\t *\n\t *\/\n\tcgreterm&\n\toperator= (const cgreterm& greterm) {\n\t\tif (this == &greterm)\n\t\t\treturn *this;\n\t\tstate \t\t\t\t= greterm.state;\n\t\tdpid \t\t\t\t= greterm.dpid;\n\t\teth_ofp_table_id \t= greterm.eth_ofp_table_id;\n\t\tgre_ofp_table_id \t= greterm.gre_ofp_table_id;\n\t\tip_fwd_ofp_table_id\t= greterm.ip_fwd_ofp_table_id;\n\t\tidle_timeout \t\t= greterm.idle_timeout;\n\t\tgre_portno \t\t\t= greterm.gre_portno;\n\t\tgre_key \t\t\t= greterm.gre_key;\n\t\treturn *this;\n\t};\n\npublic:\n\n\t\/**\n\t *\n\t *\/\n\tconst uint32_t&\n\tget_gre_key() const { return gre_key; };\n\n\t\/**\n\t *\n\t *\/\n\tconst uint32_t&\n\tget_gre_portno() const { return gre_portno; };\n\nprotected:\n\n\t\/**\n\t *\n\t *\/\n\tvoid\n\texecute(\n\t\t\tstd::string const& executable,\n\t\t\tstd::vector argv,\n\t\t\tstd::vector envp);\n\npublic:\n\n\tfriend std::ostream&\n\toperator<< (std::ostream& os, const cgreterm& greterm) {\n\t\tos << rofcore::indent(0) << \"\" << std::endl;\n\t\treturn os;\n\t};\n\nprotected:\n\n\tenum ofp_state_t {\n\t\tSTATE_DETACHED = 1,\n\t\tSTATE_ATTACHED = 2,\n\t};\n\tenum ofp_state_t \t\tstate;\n\n\tenum cgreterm_flags_t {\n\t\tFLAG_INGRESS_FM_INSTALLED \t= (1 << 0),\n\t\tFLAG_EGRESS_FM_INSTALLED \t= (1 << 1),\n\t};\n\tstd::bitset<32>\t\t\tflags;\n\n\trofl::cdpid \t\t\tdpid;\n\tuint8_t\t\t\t\t\teth_ofp_table_id;\t\t\t\t\/\/ OFP tableid for capturing plain ethernet frames (table 0)\n\tuint8_t \t\t\t\tgre_ofp_table_id;\t\t\t\t\/\/ OFP tableid for installing GRE-pop entries\n\tuint8_t\t\t\t\t\tip_fwd_ofp_table_id;\t\t\t\/\/ OFP tableid for forwarding IP datagrams\n\tstatic const int \t\tDEFAULT_IDLE_TIMEOUT = 15; \t\t\/\/ seconds\n\tint \t\t\t\t\tidle_timeout;\n\n\tstd::string\t\t\t\tgre_portname;\n\tuint32_t\t\t\t\tgre_portno; \t\t\t\t\t\/\/ portno of ethernet port\n\tuint32_t\t\t\t\tgre_key;\t\t\t\t\t\t\t\/\/ GRE key according to IETF RFC 2890\n\tstatic const uint8_t\tGRE_IP_PROTO = 47;\n\tstatic const uint16_t \tGRE_PROT_TYPE_TRANSPARENT_ETHERNET_BRIDGING = 0x6558;\n\n\tstatic std::string\t\tscript_path_init;\n\tstatic std::string\t\tscript_path_term;\n};\n\n\n\nclass cgreterm_in4 : public cgreterm {\npublic:\n\n\t\/**\n\t *\n\t *\/\n\tcgreterm_in4() {};\n\n\t\/**\n\t *\n\t *\/\n\t~cgreterm_in4() {\n\t\ttry {\n\t\t\tif (STATE_ATTACHED == state) {\n\t\t\t\thandle_dpt_close(rofl::crofdpt::get_dpt(dpid));\n\t\t\t}\n\t\t} catch (rofl::eRofDptNotFound& e) {};\n\t\thook_term();\n\t};\n\n\t\/**\n\t *\n\t *\/\n\tcgreterm_in4(const rofl::cdpid& dpid, uint8_t eth_ofp_table_id, uint8_t gre_ofp_table_id, uint8_t ip_fwd_ofp_table_id,\n\t\t\tconst rofl::caddress_in4& laddr, const rofl::caddress_in4& raddr, uint32_t gre_portno, uint32_t gre_key) :\n\t\tcgreterm(dpid, eth_ofp_table_id, gre_ofp_table_id, ip_fwd_ofp_table_id, gre_portno, gre_key),\n\t\tladdr(laddr), raddr(raddr) {\n\t\thook_init();\n\t};\n\n\t\/**\n\t *\n\t *\/\n\tcgreterm_in4(const cgreterm_in4& greterm) { *this = greterm; };\n\n\t\/**\n\t *\n\t *\/\n\tcgreterm_in4&\n\toperator= (const cgreterm_in4& greterm) {\n\t\tif (this == &greterm)\n\t\t\treturn *this;\n\t\tcgreterm::operator= (greterm);\n\t\tladdr = greterm.laddr;\n\t\traddr = greterm.raddr;\n\t\treturn *this;\n\t};\n\n\t\/**\n\t *\n\t *\/\n\tbool\n\toperator< (const cgreterm_in4& greterm) const {\n\t\treturn (raddr < greterm.raddr);\n\t};\n\npublic:\n\n\t\/**\n\t *\n\t *\/\n\tconst rofl::caddress_in4&\n\tget_local_addr() const { return laddr; };\n\n\t\/**\n\t *\n\t *\/\n\tconst rofl::caddress_in4&\n\tget_remote_addr() const { return raddr; };\n\npublic:\n\n\t\/**\n\t *\n\t *\/\n\tvoid\n\thandle_dpt_open(rofl::crofdpt& dpt) {\n\t\thandle_dpt_open_egress(dpt);\n\t\thandle_dpt_open_ingress(dpt);\n\t};\n\n\t\/**\n\t *\n\t *\/\n\tvoid\n\thandle_dpt_close(rofl::crofdpt& dpt) {\n\t\thandle_dpt_close_egress(dpt);\n\t\thandle_dpt_close_ingress(dpt);\n\t};\n\npublic:\n\n\tfriend std::ostream&\n\toperator<< (std::ostream& os, const cgreterm_in4& greterm) {\n\t\tos << dynamic_cast( greterm );\n\t\tos << rofcore::indent(2) << \" raddr:\" << greterm.get_remote_addr().str() << \" >\" << std::endl;\n\t\treturn os;\n\t};\n\nprivate:\n\n\t\/**\n\t *\n\t *\/\n\tvoid\n\thandle_dpt_open_egress(rofl::crofdpt& dpt);\n\n\t\/**\n\t *\n\t *\/\n\tvoid\n\thandle_dpt_close_egress(rofl::crofdpt& dpt);\n\n\t\/**\n\t *\n\t *\/\n\tvoid\n\thandle_dpt_open_ingress(rofl::crofdpt& dpt);\n\n\t\/**\n\t *\n\t *\/\n\tvoid\n\thandle_dpt_close_ingress(rofl::crofdpt& dpt);\n\n\t\/**\n\t *\n\t *\/\n\tvoid\n\thook_init();\n\n\t\/**\n\t *\n\t *\/\n\tvoid\n\thook_term();\n\nprivate:\n\n\trofl::caddress_in4 laddr;\n\trofl::caddress_in4 raddr;\n};\n\n\n\nclass cgreterm_in6 : public cgreterm {\npublic:\n\n\t\/**\n\t *\n\t *\/\n\tcgreterm_in6() {};\n\n\t\/**\n\t *\n\t *\/\n\t~cgreterm_in6() {\n\t\ttry {\n\t\t\tif (STATE_ATTACHED == state) {\n\t\t\t\thandle_dpt_close(rofl::crofdpt::get_dpt(dpid));\n\t\t\t}\n\t\t} catch (rofl::eRofDptNotFound& e) {};\n\t\thook_term();\n\t};\n\n\t\/**\n\t *\n\t *\/\n\tcgreterm_in6(const rofl::cdpid& dpid, uint8_t eth_ofp_table_id, uint8_t gre_ofp_table_id, uint8_t ip_fwd_ofp_table_id,\n\t\t\tconst rofl::caddress_in6& laddr, const rofl::caddress_in6& raddr, uint32_t gre_portno, uint32_t gre_key) :\n\t\tcgreterm(dpid, eth_ofp_table_id, gre_ofp_table_id, ip_fwd_ofp_table_id, gre_portno, gre_key),\n\t\tladdr(laddr), raddr(raddr) {\n\t\thook_init();\n\t};\n\n\n\t\/**\n\t *\n\t *\/\n\tcgreterm_in6(const cgreterm_in6& greterm) { *this = greterm; };\n\n\t\/**\n\t *\n\t *\/\n\tcgreterm_in6&\n\toperator= (const cgreterm_in6& greterm) {\n\t\tif (this == &greterm)\n\t\t\treturn *this;\n\t\tcgreterm::operator= (greterm);\n\t\tladdr = greterm.laddr;\n\t\traddr = greterm.raddr;\n\t\treturn *this;\n\t};\n\n\t\/**\n\t *\n\t *\/\n\tbool\n\toperator< (const cgreterm_in6& greterm) const {\n\t\treturn (raddr < greterm.raddr);\n\t};\n\npublic:\n\n\t\/**\n\t *\n\t *\/\n\tconst rofl::caddress_in6&\n\tget_local_addr() const { return laddr; };\n\n\t\/**\n\t *\n\t *\/\n\tconst rofl::caddress_in6&\n\tget_remote_addr() const { return raddr; };\n\npublic:\n\n\t\/**\n\t *\n\t *\/\n\tvoid\n\thandle_dpt_open(rofl::crofdpt& dpt) {\n\t\thandle_dpt_open_egress(dpt);\n\t\thandle_dpt_open_ingress(dpt);\n\t};\n\n\t\/**\n\t *\n\t *\/\n\tvoid\n\thandle_dpt_close(rofl::crofdpt& dpt) {\n\t\thandle_dpt_close_egress(dpt);\n\t\thandle_dpt_close_ingress(dpt);\n\t};\n\npublic:\n\n\tfriend std::ostream&\n\toperator<< (std::ostream& os, const cgreterm_in6& greterm) {\n\t\tos << dynamic_cast( greterm );\n\t\tos << rofcore::indent(2) << \" raddr:\" << greterm.get_remote_addr().str() << \" >\" << std::endl;\n\t\treturn os;\n\t};\n\nprivate:\n\n\t\/**\n\t *\n\t *\/\n\tvoid\n\thandle_dpt_open_egress(rofl::crofdpt& dpt);\n\n\t\/**\n\t *\n\t *\/\n\tvoid\n\thandle_dpt_close_egress(rofl::crofdpt& dpt);\n\n\t\/**\n\t *\n\t *\/\n\tvoid\n\thandle_dpt_open_ingress(rofl::crofdpt& dpt);\n\n\t\/**\n\t *\n\t *\/\n\tvoid\n\thandle_dpt_close_ingress(rofl::crofdpt& dpt);\n\n\t\/**\n\t *\n\t *\/\n\tvoid\n\thook_init();\n\n\t\/**\n\t *\n\t *\/\n\tvoid\n\thook_term();\n\nprivate:\n\n\trofl::caddress_in6 laddr;\n\trofl::caddress_in6 raddr;\n};\n\n}; \/\/ end of namespace gre\n}; \/\/ end of namespace roflibs\n\n#endif \/* CGRETERM_HPP_ *\/\ncgreterm => moving init and term hook methods to handle_dpt_open()\/close()\/*\n * cgreterm.hpp\n *\n * Created on: 18.08.2014\n * Author: andreas\n *\/\n\n#ifndef CGRETERM_HPP_\n#define CGRETERM_HPP_\n\n#include \n#include \n#include \n#include \n#include \n\n#include \n#include \n#include \n#include \n#include \n#include \n#include \n\n#include \n\n\nnamespace roflibs {\nnamespace gre {\n\nclass eGreTermBase : public std::runtime_error {\npublic:\n\teGreTermBase(const std::string& __arg) : std::runtime_error(__arg) {};\n};\nclass eGreTermNotFound : public eGreTermBase {\npublic:\n\teGreTermNotFound(const std::string& __arg) : eGreTermBase(__arg) {};\n};\n\n\n\/*\n * -ingress- means: send traffic into the tunnel\n * -egress- means: strip the tunnel and send traffic to the external world\n *\/\nclass cgreterm {\npublic:\n\n\t\/**\n\t *\n\t *\/\n\tcgreterm() :\n\t\tstate(STATE_DETACHED), eth_ofp_table_id(0), gre_ofp_table_id(0), ip_fwd_ofp_table_id(0),\n\t\tidle_timeout(DEFAULT_IDLE_TIMEOUT),\n\t\tgre_portno(0), gre_key(0) {};\n\n\t\/**\n\t *\n\t *\/\n\t~cgreterm() {};\n\n\t\/**\n\t *\n\t *\/\n\tcgreterm(const rofl::cdpid& dpid, uint8_t eth_ofp_table_id,\n\t\t\tuint8_t gre_ofp_table_id, uint8_t ip_fwd_ofp_table_id,\n\t\t\tuint32_t gre_portno, uint32_t gre_key) :\n\t\tstate(STATE_DETACHED), dpid(dpid), eth_ofp_table_id(eth_ofp_table_id),\n\t\tgre_ofp_table_id(gre_ofp_table_id), ip_fwd_ofp_table_id(ip_fwd_ofp_table_id),\n\t\tidle_timeout(DEFAULT_IDLE_TIMEOUT),\n\t\tgre_portno(gre_portno), gre_key(gre_key) {};\n\n\t\/**\n\t *\n\t *\/\n\tcgreterm(const cgreterm& greterm) { *this = greterm; };\n\n\t\/**\n\t *\n\t *\/\n\tcgreterm&\n\toperator= (const cgreterm& greterm) {\n\t\tif (this == &greterm)\n\t\t\treturn *this;\n\t\tstate \t\t\t\t= greterm.state;\n\t\tdpid \t\t\t\t= greterm.dpid;\n\t\teth_ofp_table_id \t= greterm.eth_ofp_table_id;\n\t\tgre_ofp_table_id \t= greterm.gre_ofp_table_id;\n\t\tip_fwd_ofp_table_id\t= greterm.ip_fwd_ofp_table_id;\n\t\tidle_timeout \t\t= greterm.idle_timeout;\n\t\tgre_portno \t\t\t= greterm.gre_portno;\n\t\tgre_key \t\t\t= greterm.gre_key;\n\t\treturn *this;\n\t};\n\npublic:\n\n\t\/**\n\t *\n\t *\/\n\tconst uint32_t&\n\tget_gre_key() const { return gre_key; };\n\n\t\/**\n\t *\n\t *\/\n\tconst uint32_t&\n\tget_gre_portno() const { return gre_portno; };\n\nprotected:\n\n\t\/**\n\t *\n\t *\/\n\tvoid\n\texecute(\n\t\t\tstd::string const& executable,\n\t\t\tstd::vector argv,\n\t\t\tstd::vector envp);\n\npublic:\n\n\tfriend std::ostream&\n\toperator<< (std::ostream& os, const cgreterm& greterm) {\n\t\tos << rofcore::indent(0) << \"\" << std::endl;\n\t\treturn os;\n\t};\n\nprotected:\n\n\tenum ofp_state_t {\n\t\tSTATE_DETACHED = 1,\n\t\tSTATE_ATTACHED = 2,\n\t};\n\tenum ofp_state_t \t\tstate;\n\n\tenum cgreterm_flags_t {\n\t\tFLAG_INGRESS_FM_INSTALLED \t= (1 << 0),\n\t\tFLAG_EGRESS_FM_INSTALLED \t= (1 << 1),\n\t};\n\tstd::bitset<32>\t\t\tflags;\n\n\trofl::cdpid \t\t\tdpid;\n\tuint8_t\t\t\t\t\teth_ofp_table_id;\t\t\t\t\/\/ OFP tableid for capturing plain ethernet frames (table 0)\n\tuint8_t \t\t\t\tgre_ofp_table_id;\t\t\t\t\/\/ OFP tableid for installing GRE-pop entries\n\tuint8_t\t\t\t\t\tip_fwd_ofp_table_id;\t\t\t\/\/ OFP tableid for forwarding IP datagrams\n\tstatic const int \t\tDEFAULT_IDLE_TIMEOUT = 15; \t\t\/\/ seconds\n\tint \t\t\t\t\tidle_timeout;\n\n\tstd::string\t\t\t\tgre_portname;\n\tuint32_t\t\t\t\tgre_portno; \t\t\t\t\t\/\/ portno of ethernet port\n\tuint32_t\t\t\t\tgre_key;\t\t\t\t\t\t\t\/\/ GRE key according to IETF RFC 2890\n\tstatic const uint8_t\tGRE_IP_PROTO = 47;\n\tstatic const uint16_t \tGRE_PROT_TYPE_TRANSPARENT_ETHERNET_BRIDGING = 0x6558;\n\n\tstatic std::string\t\tscript_path_init;\n\tstatic std::string\t\tscript_path_term;\n};\n\n\n\nclass cgreterm_in4 : public cgreterm {\npublic:\n\n\t\/**\n\t *\n\t *\/\n\tcgreterm_in4() {};\n\n\t\/**\n\t *\n\t *\/\n\t~cgreterm_in4() {\n\t\ttry {\n\t\t\tif (STATE_ATTACHED == state) {\n\t\t\t\thandle_dpt_close(rofl::crofdpt::get_dpt(dpid));\n\t\t\t}\n\t\t} catch (rofl::eRofDptNotFound& e) {};\n\t};\n\n\t\/**\n\t *\n\t *\/\n\tcgreterm_in4(const rofl::cdpid& dpid, uint8_t eth_ofp_table_id, uint8_t gre_ofp_table_id, uint8_t ip_fwd_ofp_table_id,\n\t\t\tconst rofl::caddress_in4& laddr, const rofl::caddress_in4& raddr, uint32_t gre_portno, uint32_t gre_key) :\n\t\tcgreterm(dpid, eth_ofp_table_id, gre_ofp_table_id, ip_fwd_ofp_table_id, gre_portno, gre_key),\n\t\tladdr(laddr), raddr(raddr) {\n\t};\n\n\t\/**\n\t *\n\t *\/\n\tcgreterm_in4(const cgreterm_in4& greterm) { *this = greterm; };\n\n\t\/**\n\t *\n\t *\/\n\tcgreterm_in4&\n\toperator= (const cgreterm_in4& greterm) {\n\t\tif (this == &greterm)\n\t\t\treturn *this;\n\t\tcgreterm::operator= (greterm);\n\t\tladdr = greterm.laddr;\n\t\traddr = greterm.raddr;\n\t\treturn *this;\n\t};\n\n\t\/**\n\t *\n\t *\/\n\tbool\n\toperator< (const cgreterm_in4& greterm) const {\n\t\treturn (raddr < greterm.raddr);\n\t};\n\npublic:\n\n\t\/**\n\t *\n\t *\/\n\tconst rofl::caddress_in4&\n\tget_local_addr() const { return laddr; };\n\n\t\/**\n\t *\n\t *\/\n\tconst rofl::caddress_in4&\n\tget_remote_addr() const { return raddr; };\n\npublic:\n\n\t\/**\n\t *\n\t *\/\n\tvoid\n\thandle_dpt_open(rofl::crofdpt& dpt) {\n\t\thandle_dpt_open_egress(dpt);\n\t\thandle_dpt_open_ingress(dpt);\n\t\thook_init();\n\t};\n\n\t\/**\n\t *\n\t *\/\n\tvoid\n\thandle_dpt_close(rofl::crofdpt& dpt) {\n\t\thook_term();\n\t\thandle_dpt_close_egress(dpt);\n\t\thandle_dpt_close_ingress(dpt);\n\t};\n\npublic:\n\n\tfriend std::ostream&\n\toperator<< (std::ostream& os, const cgreterm_in4& greterm) {\n\t\tos << dynamic_cast( greterm );\n\t\tos << rofcore::indent(2) << \" raddr:\" << greterm.get_remote_addr().str() << \" >\" << std::endl;\n\t\treturn os;\n\t};\n\nprivate:\n\n\t\/**\n\t *\n\t *\/\n\tvoid\n\thandle_dpt_open_egress(rofl::crofdpt& dpt);\n\n\t\/**\n\t *\n\t *\/\n\tvoid\n\thandle_dpt_close_egress(rofl::crofdpt& dpt);\n\n\t\/**\n\t *\n\t *\/\n\tvoid\n\thandle_dpt_open_ingress(rofl::crofdpt& dpt);\n\n\t\/**\n\t *\n\t *\/\n\tvoid\n\thandle_dpt_close_ingress(rofl::crofdpt& dpt);\n\n\t\/**\n\t *\n\t *\/\n\tvoid\n\thook_init();\n\n\t\/**\n\t *\n\t *\/\n\tvoid\n\thook_term();\n\nprivate:\n\n\trofl::caddress_in4 laddr;\n\trofl::caddress_in4 raddr;\n};\n\n\n\nclass cgreterm_in6 : public cgreterm {\npublic:\n\n\t\/**\n\t *\n\t *\/\n\tcgreterm_in6() {};\n\n\t\/**\n\t *\n\t *\/\n\t~cgreterm_in6() {\n\t\ttry {\n\t\t\tif (STATE_ATTACHED == state) {\n\t\t\t\thandle_dpt_close(rofl::crofdpt::get_dpt(dpid));\n\t\t\t}\n\t\t} catch (rofl::eRofDptNotFound& e) {};\n\t};\n\n\t\/**\n\t *\n\t *\/\n\tcgreterm_in6(const rofl::cdpid& dpid, uint8_t eth_ofp_table_id, uint8_t gre_ofp_table_id, uint8_t ip_fwd_ofp_table_id,\n\t\t\tconst rofl::caddress_in6& laddr, const rofl::caddress_in6& raddr, uint32_t gre_portno, uint32_t gre_key) :\n\t\tcgreterm(dpid, eth_ofp_table_id, gre_ofp_table_id, ip_fwd_ofp_table_id, gre_portno, gre_key),\n\t\tladdr(laddr), raddr(raddr) {\n\t};\n\n\n\t\/**\n\t *\n\t *\/\n\tcgreterm_in6(const cgreterm_in6& greterm) { *this = greterm; };\n\n\t\/**\n\t *\n\t *\/\n\tcgreterm_in6&\n\toperator= (const cgreterm_in6& greterm) {\n\t\tif (this == &greterm)\n\t\t\treturn *this;\n\t\tcgreterm::operator= (greterm);\n\t\tladdr = greterm.laddr;\n\t\traddr = greterm.raddr;\n\t\treturn *this;\n\t};\n\n\t\/**\n\t *\n\t *\/\n\tbool\n\toperator< (const cgreterm_in6& greterm) const {\n\t\treturn (raddr < greterm.raddr);\n\t};\n\npublic:\n\n\t\/**\n\t *\n\t *\/\n\tconst rofl::caddress_in6&\n\tget_local_addr() const { return laddr; };\n\n\t\/**\n\t *\n\t *\/\n\tconst rofl::caddress_in6&\n\tget_remote_addr() const { return raddr; };\n\npublic:\n\n\t\/**\n\t *\n\t *\/\n\tvoid\n\thandle_dpt_open(rofl::crofdpt& dpt) {\n\t\thandle_dpt_open_egress(dpt);\n\t\thandle_dpt_open_ingress(dpt);\n\t\thook_init();\n\t};\n\n\t\/**\n\t *\n\t *\/\n\tvoid\n\thandle_dpt_close(rofl::crofdpt& dpt) {\n\t\thook_term();\n\t\thandle_dpt_close_egress(dpt);\n\t\thandle_dpt_close_ingress(dpt);\n\t};\n\npublic:\n\n\tfriend std::ostream&\n\toperator<< (std::ostream& os, const cgreterm_in6& greterm) {\n\t\tos << dynamic_cast( greterm );\n\t\tos << rofcore::indent(2) << \" raddr:\" << greterm.get_remote_addr().str() << \" >\" << std::endl;\n\t\treturn os;\n\t};\n\nprivate:\n\n\t\/**\n\t *\n\t *\/\n\tvoid\n\thandle_dpt_open_egress(rofl::crofdpt& dpt);\n\n\t\/**\n\t *\n\t *\/\n\tvoid\n\thandle_dpt_close_egress(rofl::crofdpt& dpt);\n\n\t\/**\n\t *\n\t *\/\n\tvoid\n\thandle_dpt_open_ingress(rofl::crofdpt& dpt);\n\n\t\/**\n\t *\n\t *\/\n\tvoid\n\thandle_dpt_close_ingress(rofl::crofdpt& dpt);\n\n\t\/**\n\t *\n\t *\/\n\tvoid\n\thook_init();\n\n\t\/**\n\t *\n\t *\/\n\tvoid\n\thook_term();\n\nprivate:\n\n\trofl::caddress_in6 laddr;\n\trofl::caddress_in6 raddr;\n};\n\n}; \/\/ end of namespace gre\n}; \/\/ end of namespace roflibs\n\n#endif \/* CGRETERM_HPP_ *\/\n<|endoftext|>"} {"text":"\/*\n kopetepasswordedaccount.cpp - Kopete Account with a password\n\n Copyright (c) 2004 by Richard Smith \n Kopete (c) 2002-2004 by the Kopete developers \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 \"kopetepasswordedaccount.h\"\n#include \"kopetepassword.h\"\n#include \"kopeteprotocol.h\"\n#include \"kopeteonlinestatus.h\"\n\n#include \n\n#include \n\nstruct Kopete::PasswordedAccount::Private\n{\n\tPrivate( const QString &group, bool allowBlankPassword ) :\n\t\tpassword( group, allowBlankPassword ) {}\n\tKopete::Password password;\n\tKopete::OnlineStatus initialStatus;\n};\n\nKopete::PasswordedAccount::PasswordedAccount( Kopete::Protocol *parent, const QString &acctId, bool allowBlankPassword )\n : Kopete::Account( parent, acctId ), d( new Private( QString::fromLatin1(\"Account_\")+ parent->pluginId() + QString::fromLatin1(\"_\") + acctId , allowBlankPassword ) )\n{\n}\n\nKopete::PasswordedAccount::~PasswordedAccount()\n{\n\tdelete d;\n}\n\nKopete::Password &Kopete::PasswordedAccount::password()\n{\n\treturn d->password;\n}\n\nvoid Kopete::PasswordedAccount::connect( )\n{\n\tKopete::OnlineStatus s(Kopete::OnlineStatus::Online);\n\tconnect( s );\n}\n\nvoid Kopete::PasswordedAccount::connect( const Kopete::OnlineStatus& initialStatus )\n{\n\t\/\/ check that the networkstatus is up\n\n\t\/\/ warn user somewhere\n\td->initialStatus = initialStatus;\n\tQString cached = password().cachedValue();\n\tif( !cached.isNull() || d->password.allowBlankPassword() )\n\t{\n\t\tconnectWithPassword( cached );\n\t\treturn;\n\t}\n\n\tQString prompt = passwordPrompt();\n\tKopete::Password::PasswordSource src = password().isWrong() ? Kopete::Password::FromUser : Kopete::Password::FromConfigOrUser;\n\n\tpassword().request( this, SLOT( connectWithPassword( const QString & ) ), accountIcon( Kopete::Password::preferredImageSize() ), prompt, src );\n}\n\nQString Kopete::PasswordedAccount::passwordPrompt()\n{\n\tif ( password().isWrong() )\n\t\treturn i18n( \"The password was wrong.<\/b> Please re-enter your password for %1 account %2<\/b><\/qt>\", protocol()->displayName(), accountId() );\n\telse\n\t\treturn i18n( \"Please enter your password for %1 account %2<\/b><\/qt>\", protocol()->displayName(), accountId() );\n}\n\nKopete::OnlineStatus Kopete::PasswordedAccount::initialStatus()\n{\n\treturn d->initialStatus;\n}\n\nbool Kopete::PasswordedAccount::removeAccount()\n{\n\tpassword().set(QString::null);\t\/\/krazy:exclude=nullstrassign for old broken gcc\n\treturn Kopete::Account::removeAccount();\n}\n\nvoid Kopete::PasswordedAccount::disconnected( Kopete::Account::DisconnectReason reason )\n{\n\tif(reason==Kopete::Account::BadPassword || reason==Kopete::Account::BadUserName)\n\t{\n\t\tpassword().setWrong(true);\n\t}\n\tKopete::Account::disconnected(reason);\n}\n\n\n#include \"kopetepasswordedaccount.moc\"\n\n\/\/ vim: set noet ts=4 sts=4 sw=4:\ndone elsewhere, redundant comment\/*\n kopetepasswordedaccount.cpp - Kopete Account with a password\n\n Copyright (c) 2004 by Richard Smith \n Kopete (c) 2002-2004 by the Kopete developers \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 \"kopetepasswordedaccount.h\"\n#include \"kopetepassword.h\"\n#include \"kopeteprotocol.h\"\n#include \"kopeteonlinestatus.h\"\n\n#include \n\n#include \n\nstruct Kopete::PasswordedAccount::Private\n{\n\tPrivate( const QString &group, bool allowBlankPassword ) :\n\t\tpassword( group, allowBlankPassword ) {}\n\tKopete::Password password;\n\tKopete::OnlineStatus initialStatus;\n};\n\nKopete::PasswordedAccount::PasswordedAccount( Kopete::Protocol *parent, const QString &acctId, bool allowBlankPassword )\n : Kopete::Account( parent, acctId ), d( new Private( QString::fromLatin1(\"Account_\")+ parent->pluginId() + QString::fromLatin1(\"_\") + acctId , allowBlankPassword ) )\n{\n}\n\nKopete::PasswordedAccount::~PasswordedAccount()\n{\n\tdelete d;\n}\n\nKopete::Password &Kopete::PasswordedAccount::password()\n{\n\treturn d->password;\n}\n\nvoid Kopete::PasswordedAccount::connect( )\n{\n\tKopete::OnlineStatus s(Kopete::OnlineStatus::Online);\n\tconnect( s );\n}\n\nvoid Kopete::PasswordedAccount::connect( const Kopete::OnlineStatus& initialStatus )\n{\n\t\/\/ warn user somewhere\n\td->initialStatus = initialStatus;\n\tQString cached = password().cachedValue();\n\tif( !cached.isNull() || d->password.allowBlankPassword() )\n\t{\n\t\tconnectWithPassword( cached );\n\t\treturn;\n\t}\n\n\tQString prompt = passwordPrompt();\n\tKopete::Password::PasswordSource src = password().isWrong() ? Kopete::Password::FromUser : Kopete::Password::FromConfigOrUser;\n\n\tpassword().request( this, SLOT( connectWithPassword( const QString & ) ), accountIcon( Kopete::Password::preferredImageSize() ), prompt, src );\n}\n\nQString Kopete::PasswordedAccount::passwordPrompt()\n{\n\tif ( password().isWrong() )\n\t\treturn i18n( \"The password was wrong.<\/b> Please re-enter your password for %1 account %2<\/b><\/qt>\", protocol()->displayName(), accountId() );\n\telse\n\t\treturn i18n( \"Please enter your password for %1 account %2<\/b><\/qt>\", protocol()->displayName(), accountId() );\n}\n\nKopete::OnlineStatus Kopete::PasswordedAccount::initialStatus()\n{\n\treturn d->initialStatus;\n}\n\nbool Kopete::PasswordedAccount::removeAccount()\n{\n\tpassword().set(QString::null);\t\/\/krazy:exclude=nullstrassign for old broken gcc\n\treturn Kopete::Account::removeAccount();\n}\n\nvoid Kopete::PasswordedAccount::disconnected( Kopete::Account::DisconnectReason reason )\n{\n\tif(reason==Kopete::Account::BadPassword || reason==Kopete::Account::BadUserName)\n\t{\n\t\tpassword().setWrong(true);\n\t}\n\tKopete::Account::disconnected(reason);\n}\n\n\n#include \"kopetepasswordedaccount.moc\"\n\n\/\/ vim: set noet ts=4 sts=4 sw=4:\n<|endoftext|>"} {"text":"#include \"DNSServer.h\"\n#include \n#include \n\n\nDNSServer::DNSServer()\n{\n _ttl = htonl(60);\n _errorReplyCode = DNSReplyCode::NonExistentDomain;\n}\n\nbool DNSServer::start(const uint16_t &port, const String &domainName,\n const IPAddress &resolvedIP)\n{\n _port = port;\n \n _domainName = domainName;\n _resolvedIP[0] = resolvedIP[0];\n _resolvedIP[1] = resolvedIP[1];\n _resolvedIP[2] = resolvedIP[2];\n _resolvedIP[3] = resolvedIP[3];\n downcaseAndRemoveWwwPrefix(_domainName);\n return _udp.begin(_port) == 1;\n}\n\nvoid DNSServer::setErrorReplyCode(const DNSReplyCode &replyCode)\n{\n _errorReplyCode = replyCode;\n}\n\nvoid DNSServer::setTTL(const uint32_t &ttl)\n{\n _ttl = htonl(ttl);\n}\n\nvoid DNSServer::stop()\n{\n _udp.stop();\n}\n\nvoid DNSServer::downcaseAndRemoveWwwPrefix(String &domainName)\n{\n domainName.toLowerCase();\n domainName.replace(\"www.\", \"\");\n}\n\nvoid DNSServer::processNextRequest()\n{\n size_t packetSize = _udp.parsePacket();\n\n if (packetSize >= sizeof(DNSHeader))\n {\n uint8_t* buffer = reinterpret_cast(malloc(packetSize));\n if (buffer == NULL) return;\n\n _udp.read(buffer, packetSize);\n\n DNSHeader* dnsHeader = reinterpret_cast(buffer);\n\n if (dnsHeader->QR == DNS_QR_QUERY &&\n dnsHeader->OPCode == DNS_OPCODE_QUERY &&\n requestIncludesOnlyOneQuestion(dnsHeader) &&\n (_domainName == \"*\" || getDomainNameWithoutWwwPrefix(buffer, packetSize) == _domainName)\n )\n {\n replyWithIP(buffer, packetSize);\n }\n else if (dnsHeader->QR == DNS_QR_QUERY)\n {\n replyWithCustomCode(buffer, packetSize);\n }\n\n free(buffer);\n }\n}\n\nbool DNSServer::requestIncludesOnlyOneQuestion(const DNSHeader* dnsHeader)\n{\n return ntohs(dnsHeader->QDCount) == 1 &&\n dnsHeader->ANCount == 0 &&\n dnsHeader->NSCount == 0 &&\n dnsHeader->ARCount == 0;\n}\n\nString DNSServer::getDomainNameWithoutWwwPrefix(const uint8_t* buffer, size_t packetSize)\n{\n String parsedDomainName;\n \n const uint8_t* pos = buffer + sizeof(DNSHeader);\n const uint8_t* end = buffer + packetSize;\n\n \/\/ to minimize reallocations due to concats below\n \/\/ we reserve enough space that a median or average domain\n \/\/ name size cold be easily contained without a reallocation\n \/\/ - max size would be 253, in 2013, average is 11 and max was 42\n \/\/\n parsedDomainName.reserve(32); \n\n uint8_t labelLength = *pos;\n\n while (true)\n {\n if (labelLength == 0)\n {\n \/\/ no more labels\n downcaseAndRemoveWwwPrefix(parsedDomainName);\n return parsedDomainName;\n }\n\n \/\/ append next label\n for (int i = 0; i < labelLength && pos < end; i++)\n {\n pos++;\n parsedDomainName += static_cast(*pos);\n }\n\n if (pos >= end)\n {\n \/\/ malformed packet, return an empty domain name\n parsedDomainName = \"\";\n return parsedDomainName;\n }\n else\n {\n \/\/ next label\n pos++;\n labelLength = *pos;\n\n \/\/ if there is another label, add delimiter\n if (labelLength != 0)\n {\n parsedDomainName += \".\";\n }\n }\n }\n}\n\nvoid DNSServer::replyWithIP(uint8_t* buffer, size_t packetSize)\n{\n DNSHeader* dnsHeader = reinterpret_cast(buffer);\n\n dnsHeader->QR = DNS_QR_RESPONSE;\n dnsHeader->ANCount = dnsHeader->QDCount;\n dnsHeader->QDCount = dnsHeader->QDCount; \n \/\/dnsHeader->RA = 1; \n\n _udp.beginPacket(_udp.remoteIP(), _udp.remotePort());\n _udp.write(buffer, packetSize);\n\n _udp.write((uint8_t)192); \/\/ answer name is a pointer\n _udp.write((uint8_t)12); \/\/ pointer to offset at 0x00c\n\n _udp.write((uint8_t)0); \/\/ 0x0001 answer is type A query (host address)\n _udp.write((uint8_t)1);\n\n _udp.write((uint8_t)0); \/\/0x0001 answer is class IN (internet address)\n _udp.write((uint8_t)1);\n \n _udp.write((unsigned char*)&_ttl, 4);\n\n \/\/ Length of RData is 4 bytes (because, in this case, RData is IPv4)\n _udp.write((uint8_t)0);\n _udp.write((uint8_t)4);\n _udp.write(_resolvedIP, sizeof(_resolvedIP));\n _udp.endPacket();\n\n #ifdef DEBUG_ESP_DNS\n DEBUG_ESP_PORT.printf(\"DNS responds: %s for %s\\n\",\n IPAddress(_resolvedIP).toString().c_str(), getDomainNameWithoutWwwPrefix(buffer, packetSize).c_str() );\n #endif\n}\n\nvoid DNSServer::replyWithCustomCode(uint8_t* buffer, size_t packetSize)\n{\n if (packetSize < sizeof(DNSHeader))\n {\n return;\n }\n\n DNSHeader* dnsHeader = reinterpret_cast(buffer);\n\n dnsHeader->QR = DNS_QR_RESPONSE;\n dnsHeader->RCode = (unsigned char)_errorReplyCode;\n dnsHeader->QDCount = 0;\n\n _udp.beginPacket(_udp.remoteIP(), _udp.remotePort());\n _udp.write(buffer, sizeof(DNSHeader));\n _udp.endPacket();\n}\nFix debug provision for DNSServer (#5329)#include \"DNSServer.h\"\n#include \n#include \n\n#ifdef DEBUG_ESP_PORT\n#define DEBUG_OUTPUT DEBUG_ESP_PORT\n#else\n#define DEBUG_OUTPUT Serial\n#endif\n\nDNSServer::DNSServer()\n{\n _ttl = htonl(60);\n _errorReplyCode = DNSReplyCode::NonExistentDomain;\n}\n\nbool DNSServer::start(const uint16_t &port, const String &domainName,\n const IPAddress &resolvedIP)\n{\n _port = port;\n \n _domainName = domainName;\n _resolvedIP[0] = resolvedIP[0];\n _resolvedIP[1] = resolvedIP[1];\n _resolvedIP[2] = resolvedIP[2];\n _resolvedIP[3] = resolvedIP[3];\n downcaseAndRemoveWwwPrefix(_domainName);\n return _udp.begin(_port) == 1;\n}\n\nvoid DNSServer::setErrorReplyCode(const DNSReplyCode &replyCode)\n{\n _errorReplyCode = replyCode;\n}\n\nvoid DNSServer::setTTL(const uint32_t &ttl)\n{\n _ttl = htonl(ttl);\n}\n\nvoid DNSServer::stop()\n{\n _udp.stop();\n}\n\nvoid DNSServer::downcaseAndRemoveWwwPrefix(String &domainName)\n{\n domainName.toLowerCase();\n domainName.replace(\"www.\", \"\");\n}\n\nvoid DNSServer::processNextRequest()\n{\n size_t packetSize = _udp.parsePacket();\n\n if (packetSize >= sizeof(DNSHeader))\n {\n uint8_t* buffer = reinterpret_cast(malloc(packetSize));\n if (buffer == NULL) return;\n\n _udp.read(buffer, packetSize);\n\n DNSHeader* dnsHeader = reinterpret_cast(buffer);\n\n if (dnsHeader->QR == DNS_QR_QUERY &&\n dnsHeader->OPCode == DNS_OPCODE_QUERY &&\n requestIncludesOnlyOneQuestion(dnsHeader) &&\n (_domainName == \"*\" || getDomainNameWithoutWwwPrefix(buffer, packetSize) == _domainName)\n )\n {\n replyWithIP(buffer, packetSize);\n }\n else if (dnsHeader->QR == DNS_QR_QUERY)\n {\n replyWithCustomCode(buffer, packetSize);\n }\n\n free(buffer);\n }\n}\n\nbool DNSServer::requestIncludesOnlyOneQuestion(const DNSHeader* dnsHeader)\n{\n return ntohs(dnsHeader->QDCount) == 1 &&\n dnsHeader->ANCount == 0 &&\n dnsHeader->NSCount == 0 &&\n dnsHeader->ARCount == 0;\n}\n\nString DNSServer::getDomainNameWithoutWwwPrefix(const uint8_t* buffer, size_t packetSize)\n{\n String parsedDomainName;\n \n const uint8_t* pos = buffer + sizeof(DNSHeader);\n const uint8_t* end = buffer + packetSize;\n\n \/\/ to minimize reallocations due to concats below\n \/\/ we reserve enough space that a median or average domain\n \/\/ name size cold be easily contained without a reallocation\n \/\/ - max size would be 253, in 2013, average is 11 and max was 42\n \/\/\n parsedDomainName.reserve(32); \n\n uint8_t labelLength = *pos;\n\n while (true)\n {\n if (labelLength == 0)\n {\n \/\/ no more labels\n downcaseAndRemoveWwwPrefix(parsedDomainName);\n return parsedDomainName;\n }\n\n \/\/ append next label\n for (int i = 0; i < labelLength && pos < end; i++)\n {\n pos++;\n parsedDomainName += static_cast(*pos);\n }\n\n if (pos >= end)\n {\n \/\/ malformed packet, return an empty domain name\n parsedDomainName = \"\";\n return parsedDomainName;\n }\n else\n {\n \/\/ next label\n pos++;\n labelLength = *pos;\n\n \/\/ if there is another label, add delimiter\n if (labelLength != 0)\n {\n parsedDomainName += \".\";\n }\n }\n }\n}\n\nvoid DNSServer::replyWithIP(uint8_t* buffer, size_t packetSize)\n{\n DNSHeader* dnsHeader = reinterpret_cast(buffer);\n\n dnsHeader->QR = DNS_QR_RESPONSE;\n dnsHeader->ANCount = dnsHeader->QDCount;\n dnsHeader->QDCount = dnsHeader->QDCount; \n \/\/dnsHeader->RA = 1; \n\n _udp.beginPacket(_udp.remoteIP(), _udp.remotePort());\n _udp.write(buffer, packetSize);\n\n _udp.write((uint8_t)192); \/\/ answer name is a pointer\n _udp.write((uint8_t)12); \/\/ pointer to offset at 0x00c\n\n _udp.write((uint8_t)0); \/\/ 0x0001 answer is type A query (host address)\n _udp.write((uint8_t)1);\n\n _udp.write((uint8_t)0); \/\/0x0001 answer is class IN (internet address)\n _udp.write((uint8_t)1);\n \n _udp.write((unsigned char*)&_ttl, 4);\n\n \/\/ Length of RData is 4 bytes (because, in this case, RData is IPv4)\n _udp.write((uint8_t)0);\n _udp.write((uint8_t)4);\n _udp.write(_resolvedIP, sizeof(_resolvedIP));\n _udp.endPacket();\n\n #ifdef DEBUG_ESP_DNS\n DEBUG_OUTPUT.printf(\"DNS responds: %s for %s\\n\",\n IPAddress(_resolvedIP).toString().c_str(), getDomainNameWithoutWwwPrefix(buffer, packetSize).c_str() );\n #endif\n}\n\nvoid DNSServer::replyWithCustomCode(uint8_t* buffer, size_t packetSize)\n{\n if (packetSize < sizeof(DNSHeader))\n {\n return;\n }\n\n DNSHeader* dnsHeader = reinterpret_cast(buffer);\n\n dnsHeader->QR = DNS_QR_RESPONSE;\n dnsHeader->RCode = (unsigned char)_errorReplyCode;\n dnsHeader->QDCount = 0;\n\n _udp.beginPacket(_udp.remoteIP(), _udp.remotePort());\n _udp.write(buffer, sizeof(DNSHeader));\n _udp.endPacket();\n}\n<|endoftext|>"} {"text":"#pragma once\n\nnamespace supermarx\n{\n\nnamespace detail\n{\n\ttemplate\n\tinline size_t numlength(const T x)\n\t{\n\t\treturn std::log10(x)+1;\n\t}\n\n\ttemplate<>\n\tinline size_t numlength(const long x)\n\t{\n\t\tif(x > 9)\n\t\t\treturn 2;\n\t\telse\n\t\t\treturn 1;\n\t}\n\n\ttemplate\n\tinline void write_int_to_cstr(char* str, T x)\n\t{\n\t\tsize_t x_length(numlength(x));\n\t\tint64_t pad_length(LENGTH - x_length);\n\n\t\tfor(size_t i = 0; i < pad_length; ++i)\n\t\t\tstr[i] = '0';\n\n\t\tfor(int64_t i = LENGTH-1; i >= pad_length; --i)\n\t\t{\n\t\t\tstr[i] = '0' + x % 10;\n\t\t\tx \/= 10;\n\t\t}\n\t}\n\n\tinline void write_time(char* str, time const& rhs)\n\t{\n\t\twrite_int_to_cstr(str, rhs.hours());\n\t\twrite_int_to_cstr(str+3, rhs.minutes());\n\t\twrite_int_to_cstr(str+6, rhs.seconds());\n\t}\n\n\tinline void write_date(char* str, date const& rhs)\n\t{\n\t\tauto ymd(rhs.year_month_day());\n\t\twrite_int_to_cstr(str, ymd.year);\n\t\twrite_int_to_cstr(str+5, ymd.month);\n\t\twrite_int_to_cstr(str+8, ymd.day);\n\t}\n}\n\ninline std::string to_string(time const& rhs)\n{\n\tchar result[] = \"xx:xx:xx\";\n\tdetail::write_time(result, rhs);\n\treturn std::string(result);\n}\n\ninline std::string to_string(date const& rhs)\n{\n\tchar result[] = \"xxxx-xx-xx\";\n\tdetail::write_date(result, rhs);\n\treturn std::string(result);\n}\n\ninline std::string to_string(datetime const& rhs)\n{\n\tchar result[] = \"xxxx-xx-xxTxx:xx:xx\";\n\tdetail::write_date(result, rhs.date());\n\tdetail::write_time(result+11, rhs.time_of_day());\n\treturn std::string(result);\n}\n\ninline std::ostream& operator<<(std::ostream& os, time const& rhs)\n{\n\tchar result[] = \"xx:xx:xx\";\n\tdetail::write_time(result, rhs);\n\tos << result;\n\treturn os;\n}\n\ninline std::ostream& operator<<(std::ostream& os, date const& rhs)\n{\n\tchar result[] = \"xxxx-xx-xx\";\n\tdetail::write_date(result, rhs);\n\tos << result;\n\treturn os;\n}\n\ninline std::ostream& operator<<(std::ostream& os, datetime const& rhs)\n{\n\tchar result[] = \"xxxx-xx-xxTxx:xx:xx\";\n\tdetail::write_date(result, rhs.date());\n\tdetail::write_time(result+11, rhs.time_of_day());\n\tos << result;\n\treturn os;\n}\n\n}\nImproved performance a slight bit for writing dates#pragma once\n\nnamespace supermarx\n{\n\nnamespace detail\n{\n\ttemplate\n\tinline size_t numlength(const T x)\n\t{\n\t\treturn std::log10(x)+1;\n\t}\n\n\ttemplate<>\n\tinline size_t numlength(const long x)\n\t{\n\t\tif(x > 9)\n\t\t\treturn 2;\n\t\telse\n\t\t\treturn 1;\n\t}\n\n\ttemplate<>\n\tinline size_t numlength(const long x)\n\t{\n\t\tif(x > 999)\n\t\t\treturn 4;\n\t\telse if(x > 99)\n\t\t\treturn 3;\n\t\telse if(x > 9)\n\t\t\treturn 2;\n\t\telse\n\t\t\treturn 1;\n\t}\n\n\ttemplate\n\tinline void write_int_to_cstr(char* str, T x)\n\t{\n\t\tsize_t x_length(numlength(x));\n\t\tint64_t pad_length(LENGTH - x_length);\n\n\t\tfor(size_t i = 0; i < pad_length; ++i)\n\t\t\tstr[i] = '0';\n\n\t\tfor(int64_t i = LENGTH-1; i >= pad_length; --i)\n\t\t{\n\t\t\tstr[i] = '0' + x % 10;\n\t\t\tx \/= 10;\n\t\t}\n\t}\n\n\tinline void write_time(char* str, time const& rhs)\n\t{\n\t\twrite_int_to_cstr(str, rhs.hours());\n\t\twrite_int_to_cstr(str+3, rhs.minutes());\n\t\twrite_int_to_cstr(str+6, rhs.seconds());\n\t}\n\n\tinline void write_date(char* str, date const& rhs)\n\t{\n\t\tauto ymd(rhs.year_month_day());\n\t\twrite_int_to_cstr(str, ymd.year);\n\t\twrite_int_to_cstr(str+5, ymd.month);\n\t\twrite_int_to_cstr(str+8, ymd.day);\n\t}\n}\n\ninline std::string to_string(time const& rhs)\n{\n\tchar result[] = \"xx:xx:xx\";\n\tdetail::write_time(result, rhs);\n\treturn std::string(result);\n}\n\ninline std::string to_string(date const& rhs)\n{\n\tchar result[] = \"xxxx-xx-xx\";\n\tdetail::write_date(result, rhs);\n\treturn std::string(result);\n}\n\ninline std::string to_string(datetime const& rhs)\n{\n\tchar result[] = \"xxxx-xx-xxTxx:xx:xx\";\n\tdetail::write_date(result, rhs.date());\n\tdetail::write_time(result+11, rhs.time_of_day());\n\treturn std::string(result);\n}\n\ninline std::ostream& operator<<(std::ostream& os, time const& rhs)\n{\n\tchar result[] = \"xx:xx:xx\";\n\tdetail::write_time(result, rhs);\n\tos << result;\n\treturn os;\n}\n\ninline std::ostream& operator<<(std::ostream& os, date const& rhs)\n{\n\tchar result[] = \"xxxx-xx-xx\";\n\tdetail::write_date(result, rhs);\n\tos << result;\n\treturn os;\n}\n\ninline std::ostream& operator<<(std::ostream& os, datetime const& rhs)\n{\n\tchar result[] = \"xxxx-xx-xxTxx:xx:xx\";\n\tdetail::write_date(result, rhs.date());\n\tdetail::write_time(result+11, rhs.time_of_day());\n\tos << result;\n\treturn os;\n}\n\n}\n<|endoftext|>"} {"text":"\/\/ Copyright 2017 The NXT Authors\n\/\/\n\/\/ Licensed under the Apache License, Version 2.0 (the \"License\");\n\/\/ you may not use this file except in compliance with the License.\n\/\/ You may obtain a copy of the License at\n\/\/\n\/\/ http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n\/\/\n\/\/ Unless required by applicable law or agreed to in writing, software\n\/\/ distributed under the License is distributed on an \"AS IS\" BASIS,\n\/\/ WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n\/\/ See the License for the specific language governing permissions and\n\/\/ limitations under the License.\n\n#include \"tests\/NXTTest.h\"\n\n#include \"utils\/NXTHelpers.h\"\n\nclass BasicTests : public NXTTest {\n};\n\n\/\/ Test Buffer::SetSubData changes the content of the buffer, but really this is the most\n\/\/ basic test possible, and tests the test harness\nTEST_P(BasicTests, BufferSetSubData) {\n nxt::Buffer buffer = device.CreateBufferBuilder()\n .SetSize(4)\n .SetAllowedUsage(nxt::BufferUsageBit::TransferSrc | nxt::BufferUsageBit::TransferDst)\n .SetInitialUsage(nxt::BufferUsageBit::TransferDst)\n .GetResult();\n\n uint32_t value = 3094587;\n buffer.SetSubData(0, 1, &value);\n\n EXPECT_BUFFER_U32_EQ(value, buffer, 0);\n}\n\nNXT_INSTANTIATE_TEST(BasicTests, D3D12Backend, MetalBackend, OpenGLBackend)\nEnable BasicTests on the Vulkan backend\/\/ Copyright 2017 The NXT Authors\n\/\/\n\/\/ Licensed under the Apache License, Version 2.0 (the \"License\");\n\/\/ you may not use this file except in compliance with the License.\n\/\/ You may obtain a copy of the License at\n\/\/\n\/\/ http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n\/\/\n\/\/ Unless required by applicable law or agreed to in writing, software\n\/\/ distributed under the License is distributed on an \"AS IS\" BASIS,\n\/\/ WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n\/\/ See the License for the specific language governing permissions and\n\/\/ limitations under the License.\n\n#include \"tests\/NXTTest.h\"\n\n#include \"utils\/NXTHelpers.h\"\n\nclass BasicTests : public NXTTest {\n};\n\n\/\/ Test Buffer::SetSubData changes the content of the buffer, but really this is the most\n\/\/ basic test possible, and tests the test harness\nTEST_P(BasicTests, BufferSetSubData) {\n nxt::Buffer buffer = device.CreateBufferBuilder()\n .SetSize(4)\n .SetAllowedUsage(nxt::BufferUsageBit::TransferSrc | nxt::BufferUsageBit::TransferDst)\n .SetInitialUsage(nxt::BufferUsageBit::TransferDst)\n .GetResult();\n\n uint32_t value = 3094587;\n buffer.SetSubData(0, 1, &value);\n\n EXPECT_BUFFER_U32_EQ(value, buffer, 0);\n}\n\nNXT_INSTANTIATE_TEST(BasicTests, D3D12Backend, MetalBackend, OpenGLBackend, VulkanBackend)\n<|endoftext|>"} {"text":"\/** @file\n *\n * A brief file description\n *\n * @section license License\n *\n * Licensed to the Apache Software Foundation (ASF) under one\n * or more contributor license agreements. See the NOTICE file\n * distributed with this work for additional information\n * regarding copyright ownership. The ASF licenses this file\n * to you under the Apache License, Version 2.0 (the\n * \"License\"); you may not use this file except in compliance\n * with the License. You may obtain a copy of the License at\n *\n * http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n *\/\n\n#include \"tscore\/ink_string.h\"\n#include \"tscore\/ink_args.h\"\n#include \"tscore\/I_Layout.h\"\n#include \"tscore\/I_Version.h\"\n\n#include \"RecordsConfig.h\"\n#include \"URL.h\"\n#include \"MIME.h\"\n#include \"HTTP.h\"\n#include \"HuffmanCodec.h\"\n#include \"Http3Config.h\"\n\n#include \"diags.h\"\n#include \"quic_client.h\"\n\n#define THREADS 1\n\nconstexpr size_t stacksize = 1048576;\n\n\/\/ TODO: Support QUIC version, cipher suite ...etc\n\/\/ TODO: Support qdrive tests\n\/\/ https:\/\/github.com\/ekr\/qdrive\n\/\/ https:\/\/github.com\/mcmanus\/mozquic\/tree\/master\/tests\/qdrive\nint\nmain(int argc, const char **argv)\n{\n \/\/ Before accessing file system initialize Layout engine\n Layout::create();\n\n \/\/ Set up the application version info\n AppVersionInfo appVersionInfo;\n appVersionInfo.setup(PACKAGE_NAME, \"traffic_quic\", PACKAGE_VERSION, __DATE__, __TIME__, BUILD_MACHINE, BUILD_PERSON, \"\");\n\n QUICClientConfig config;\n\n const ArgumentDescription argument_descriptions[] = {\n {\"addr\", 'a', \"Address\", \"S1023\", config.addr, nullptr, nullptr},\n {\"output\", 'o', \"Write to FILE instead of stdout\", \"S1023\", config.output, nullptr, nullptr},\n {\"port\", 'p', \"Port\", \"S15\", config.port, nullptr, nullptr},\n {\"path\", 'P', \"Path\", \"S1017\", config.path, nullptr, nullptr},\n {\"debug\", 'T', \"Vertical-bar-separated Debug Tags\", \"S1023\", config.debug_tags, nullptr, nullptr},\n {\"close\", 'c', \"Enable connection close excercise\", \"F\", &config.close, nullptr, nullptr},\n {\"http0_9\", '-', \"Enable HTTP\/0.9\", \"T\", &config.http0_9, nullptr, nullptr},\n {\"http3\", '-', \"Enable HTTP\/3\", \"F\", &config.http3, nullptr, nullptr},\n\n HELP_ARGUMENT_DESCRIPTION(),\n VERSION_ARGUMENT_DESCRIPTION(),\n RUNROOT_ARGUMENT_DESCRIPTION(),\n };\n\n \/\/ Process command line arguments and dump into variables\n process_args(&appVersionInfo, argument_descriptions, countof(argument_descriptions), argv);\n\n if (config.http3) {\n config.http0_9 = false;\n }\n\n init_diags(config.debug_tags, nullptr);\n RecProcessInit(RECM_STAND_ALONE);\n LibRecordsConfigInit();\n\n Debug(\"quic_client\", \"Load configs from %s\", RecConfigReadConfigDir().c_str());\n\n Thread *main_thread = new EThread;\n main_thread->set_specific();\n net_config_poll_timeout = 10;\n ink_net_init(ts::ModuleVersion(1, 0, ts::ModuleVersion::PRIVATE));\n\n SSLInitializeLibrary();\n SSLConfig::startup();\n\n netProcessor.init();\n quic_NetProcessor.init();\n\n ink_event_system_init(EVENT_SYSTEM_MODULE_PUBLIC_VERSION);\n eventProcessor.start(THREADS);\n udpNet.start(1, stacksize);\n quic_NetProcessor.start(-1, stacksize);\n\n \/\/ Same to init_http_header(); in traffic_server.cc\n url_init();\n mime_init();\n http_init();\n hpack_huffman_init();\n\n Http3Config::startup();\n\n QUICClient client(&config);\n eventProcessor.schedule_in(&client, 1, ET_NET);\n\n this_thread()->execute();\n}\n\n\/\/ FIXME: remove stub\n\/\/\n\/\/ stub\n\/\/\nvoid\ninitialize_thread_for_http_sessions(EThread *, int)\n{\n ink_assert(false);\n}\n\n#include \"P_UnixNet.h\"\n#include \"P_DNSConnection.h\"\nint\nDNSConnection::close()\n{\n ink_assert(false);\n return 0;\n}\n\nvoid\nDNSConnection::trigger()\n{\n ink_assert(false);\n}\n\n#include \"StatPages.h\"\nvoid\nStatPagesManager::register_http(char const *, Action *(*)(Continuation *, HTTPHdr *))\n{\n \/\/ ink_assert(false);\n}\n\n#include \"ParentSelection.h\"\nvoid\nSocksServerConfig::startup()\n{\n ink_assert(false);\n}\n\nint SocksServerConfig::m_id = 0;\n\nvoid\nParentConfigParams::findParent(HttpRequestData *, ParentResult *, unsigned int, unsigned int)\n{\n ink_assert(false);\n}\n\nvoid\nParentConfigParams::nextParent(HttpRequestData *, ParentResult *, unsigned int, unsigned int)\n{\n ink_assert(false);\n}\n\n#include \"Log.h\"\nvoid\nLog::trace_in(sockaddr const *, unsigned short, char const *, ...)\n{\n ink_assert(false);\n}\n\nvoid\nLog::trace_out(sockaddr const *, unsigned short, char const *, ...)\n{\n ink_assert(false);\n}\n\n#include \"InkAPIInternal.h\"\n\nint\nAPIHook::invoke(int, void *)\n{\n ink_assert(false);\n return 0;\n}\n\nAPIHook *\nAPIHook::next() const\n{\n ink_assert(false);\n return nullptr;\n}\n\nAPIHook *\nAPIHooks::get() const\n{\n ink_assert(false);\n return nullptr;\n}\n\nvoid\nAPIHooks::clear()\n{\n ink_abort(\"do not call stub\");\n}\n\nvoid\nAPIHooks::append(INKContInternal *)\n{\n ink_abort(\"do not call stub\");\n}\n\nvoid\nAPIHooks::prepend(INKContInternal *)\n{\n ink_abort(\"do not call stub\");\n}\n\nvoid\nConfigUpdateCbTable::invoke(const char * \/* name ATS_UNUSED *\/)\n{\n ink_release_assert(false);\n}\n\n#include \"ControlMatcher.h\"\nchar *\nHttpRequestData::get_string()\n{\n ink_assert(false);\n return nullptr;\n}\n\nconst char *\nHttpRequestData::get_host()\n{\n ink_assert(false);\n return nullptr;\n}\n\nsockaddr const *\nHttpRequestData::get_ip()\n{\n ink_assert(false);\n return nullptr;\n}\n\nsockaddr const *\nHttpRequestData::get_client_ip()\n{\n ink_assert(false);\n return nullptr;\n}\n\nSslAPIHooks *ssl_hooks = nullptr;\nStatPagesManager statPagesManager;\n\n#include \"HttpDebugNames.h\"\nconst char *\nHttpDebugNames::get_api_hook_name(TSHttpHookID t)\n{\n return \"dummy\";\n}\n\n#include \"HttpSM.h\"\nHttpSM::HttpSM() : Continuation(nullptr), vc_table(this) {}\n\nvoid\nHttpSM::cleanup()\n{\n ink_abort(\"do not call stub\");\n}\n\nvoid\nHttpSM::destroy()\n{\n ink_abort(\"do not call stub\");\n}\n\nvoid\nHttpSM::set_next_state()\n{\n ink_abort(\"do not call stub\");\n}\n\nvoid\nHttpSM::handle_api_return()\n{\n ink_abort(\"do not call stub\");\n}\n\nint\nHttpSM::kill_this_async_hook(int \/* event ATS_UNUSED *\/, void * \/* data ATS_UNUSED *\/)\n{\n return EVENT_DONE;\n}\n\nvoid\nHttpSM::attach_client_session(ProxyTransaction *, IOBufferReader *)\n{\n ink_abort(\"do not call stub\");\n}\n\nvoid\nHttpSM::init()\n{\n ink_abort(\"do not call stub\");\n}\n\nClassAllocator httpSMAllocator(\"httpSMAllocator\");\nHttpAPIHooks *http_global_hooks;\n\nHttpVCTable::HttpVCTable(HttpSM *) {}\n\nPostDataBuffers::~PostDataBuffers() {}\n\n#include \"HttpTunnel.h\"\nHttpTunnel::HttpTunnel() : Continuation(nullptr) {}\nHttpTunnelConsumer::HttpTunnelConsumer() {}\nHttpTunnelProducer::HttpTunnelProducer() {}\nChunkedHandler::ChunkedHandler() {}\n\n#include \"HttpCacheSM.h\"\nHttpCacheSM::HttpCacheSM() {}\n\nHttpCacheAction::HttpCacheAction() : sm(nullptr) {}\nvoid\nHttpCacheAction::cancel(Continuation *c)\n{\n}\nFix QUIC build\/** @file\n *\n * A brief file description\n *\n * @section license License\n *\n * Licensed to the Apache Software Foundation (ASF) under one\n * or more contributor license agreements. See the NOTICE file\n * distributed with this work for additional information\n * regarding copyright ownership. The ASF licenses this file\n * to you under the Apache License, Version 2.0 (the\n * \"License\"); you may not use this file except in compliance\n * with the License. You may obtain a copy of the License at\n *\n * http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n *\/\n\n#include \"tscore\/ink_string.h\"\n#include \"tscore\/ink_args.h\"\n#include \"tscore\/I_Layout.h\"\n#include \"tscore\/I_Version.h\"\n\n#include \"RecordsConfig.h\"\n#include \"URL.h\"\n#include \"MIME.h\"\n#include \"HTTP.h\"\n#include \"HuffmanCodec.h\"\n#include \"Http3Config.h\"\n\n#include \"diags.h\"\n#include \"quic_client.h\"\n\n#define THREADS 1\n\nconstexpr size_t stacksize = 1048576;\n\n\/\/ TODO: Support QUIC version, cipher suite ...etc\n\/\/ TODO: Support qdrive tests\n\/\/ https:\/\/github.com\/ekr\/qdrive\n\/\/ https:\/\/github.com\/mcmanus\/mozquic\/tree\/master\/tests\/qdrive\nint\nmain(int argc, const char **argv)\n{\n \/\/ Before accessing file system initialize Layout engine\n Layout::create();\n\n \/\/ Set up the application version info\n AppVersionInfo appVersionInfo;\n appVersionInfo.setup(PACKAGE_NAME, \"traffic_quic\", PACKAGE_VERSION, __DATE__, __TIME__, BUILD_MACHINE, BUILD_PERSON, \"\");\n\n QUICClientConfig config;\n\n const ArgumentDescription argument_descriptions[] = {\n {\"addr\", 'a', \"Address\", \"S1023\", config.addr, nullptr, nullptr},\n {\"output\", 'o', \"Write to FILE instead of stdout\", \"S1023\", config.output, nullptr, nullptr},\n {\"port\", 'p', \"Port\", \"S15\", config.port, nullptr, nullptr},\n {\"path\", 'P', \"Path\", \"S1017\", config.path, nullptr, nullptr},\n {\"debug\", 'T', \"Vertical-bar-separated Debug Tags\", \"S1023\", config.debug_tags, nullptr, nullptr},\n {\"close\", 'c', \"Enable connection close excercise\", \"F\", &config.close, nullptr, nullptr},\n {\"http0_9\", '-', \"Enable HTTP\/0.9\", \"T\", &config.http0_9, nullptr, nullptr},\n {\"http3\", '-', \"Enable HTTP\/3\", \"F\", &config.http3, nullptr, nullptr},\n\n HELP_ARGUMENT_DESCRIPTION(),\n VERSION_ARGUMENT_DESCRIPTION(),\n RUNROOT_ARGUMENT_DESCRIPTION(),\n };\n\n \/\/ Process command line arguments and dump into variables\n process_args(&appVersionInfo, argument_descriptions, countof(argument_descriptions), argv);\n\n if (config.http3) {\n config.http0_9 = false;\n }\n\n init_diags(config.debug_tags, nullptr);\n RecProcessInit(RECM_STAND_ALONE);\n LibRecordsConfigInit();\n\n Debug(\"quic_client\", \"Load configs from %s\", RecConfigReadConfigDir().c_str());\n\n Thread *main_thread = new EThread;\n main_thread->set_specific();\n net_config_poll_timeout = 10;\n ink_net_init(ts::ModuleVersion(1, 0, ts::ModuleVersion::PRIVATE));\n\n SSLInitializeLibrary();\n SSLConfig::startup();\n\n netProcessor.init();\n quic_NetProcessor.init();\n\n ink_event_system_init(EVENT_SYSTEM_MODULE_PUBLIC_VERSION);\n eventProcessor.start(THREADS);\n udpNet.start(1, stacksize);\n quic_NetProcessor.start(-1, stacksize);\n\n \/\/ Same to init_http_header(); in traffic_server.cc\n url_init();\n mime_init();\n http_init();\n hpack_huffman_init();\n\n Http3Config::startup();\n\n QUICClient client(&config);\n eventProcessor.schedule_in(&client, 1, ET_NET);\n\n this_thread()->execute();\n}\n\n\/\/ FIXME: remove stub\n\/\/\n\/\/ stub\n\/\/\nvoid\ninitialize_thread_for_http_sessions(EThread *, int)\n{\n ink_assert(false);\n}\n\n#include \"P_UnixNet.h\"\n#include \"P_DNSConnection.h\"\nint\nDNSConnection::close()\n{\n ink_assert(false);\n return 0;\n}\n\nvoid\nDNSConnection::trigger()\n{\n ink_assert(false);\n}\n\n#include \"StatPages.h\"\nvoid\nStatPagesManager::register_http(char const *, Action *(*)(Continuation *, HTTPHdr *))\n{\n \/\/ ink_assert(false);\n}\n\n#include \"ParentSelection.h\"\nvoid\nSocksServerConfig::startup()\n{\n ink_assert(false);\n}\n\nint SocksServerConfig::m_id = 0;\n\nvoid\nParentConfigParams::findParent(HttpRequestData *, ParentResult *, unsigned int, unsigned int)\n{\n ink_assert(false);\n}\n\nvoid\nParentConfigParams::nextParent(HttpRequestData *, ParentResult *, unsigned int, unsigned int)\n{\n ink_assert(false);\n}\n\n#include \"Log.h\"\nvoid\nLog::trace_in(sockaddr const *, unsigned short, char const *, ...)\n{\n ink_assert(false);\n}\n\nvoid\nLog::trace_out(sockaddr const *, unsigned short, char const *, ...)\n{\n ink_assert(false);\n}\n\n#include \"InkAPIInternal.h\"\n\nAPIHook *\nAPIHook::next() const\n{\n ink_assert(false);\n return nullptr;\n}\n\nvoid\nAPIHooks::clear()\n{\n ink_abort(\"do not call stub\");\n}\n\nvoid\nAPIHooks::append(INKContInternal *)\n{\n ink_abort(\"do not call stub\");\n}\n\nint\nAPIHook::invoke(int, void *) const\n{\n ink_assert(false);\n return 0;\n}\n\nAPIHook *\nAPIHooks::head() const\n{\n return nullptr;\n}\n\nHttpHookState::HttpHookState() {}\n\nvoid\nHttpHookState::init(TSHttpHookID id, HttpAPIHooks const *global, HttpAPIHooks const *ssn, HttpAPIHooks const *txn)\n{\n}\n\nAPIHook const *\nHttpHookState::getNext()\n{\n return nullptr;\n}\n\nvoid\nConfigUpdateCbTable::invoke(const char * \/* name ATS_UNUSED *\/)\n{\n ink_release_assert(false);\n}\n\n#include \"ControlMatcher.h\"\nchar *\nHttpRequestData::get_string()\n{\n ink_assert(false);\n return nullptr;\n}\n\nconst char *\nHttpRequestData::get_host()\n{\n ink_assert(false);\n return nullptr;\n}\n\nsockaddr const *\nHttpRequestData::get_ip()\n{\n ink_assert(false);\n return nullptr;\n}\n\nsockaddr const *\nHttpRequestData::get_client_ip()\n{\n ink_assert(false);\n return nullptr;\n}\n\nSslAPIHooks *ssl_hooks = nullptr;\nStatPagesManager statPagesManager;\n\n#include \"HttpDebugNames.h\"\nconst char *\nHttpDebugNames::get_api_hook_name(TSHttpHookID t)\n{\n return \"dummy\";\n}\n\n#include \"HttpSM.h\"\nHttpSM::HttpSM() : Continuation(nullptr), vc_table(this) {}\n\nvoid\nHttpSM::cleanup()\n{\n ink_abort(\"do not call stub\");\n}\n\nvoid\nHttpSM::destroy()\n{\n ink_abort(\"do not call stub\");\n}\n\nvoid\nHttpSM::set_next_state()\n{\n ink_abort(\"do not call stub\");\n}\n\nvoid\nHttpSM::handle_api_return()\n{\n ink_abort(\"do not call stub\");\n}\n\nint\nHttpSM::kill_this_async_hook(int \/* event ATS_UNUSED *\/, void * \/* data ATS_UNUSED *\/)\n{\n return EVENT_DONE;\n}\n\nvoid\nHttpSM::attach_client_session(ProxyTransaction *, IOBufferReader *)\n{\n ink_abort(\"do not call stub\");\n}\n\nvoid\nHttpSM::init()\n{\n ink_abort(\"do not call stub\");\n}\n\nClassAllocator httpSMAllocator(\"httpSMAllocator\");\nHttpAPIHooks *http_global_hooks;\n\nHttpVCTable::HttpVCTable(HttpSM *) {}\n\nPostDataBuffers::~PostDataBuffers() {}\n\n#include \"HttpTunnel.h\"\nHttpTunnel::HttpTunnel() : Continuation(nullptr) {}\nHttpTunnelConsumer::HttpTunnelConsumer() {}\nHttpTunnelProducer::HttpTunnelProducer() {}\nChunkedHandler::ChunkedHandler() {}\n\n#include \"HttpCacheSM.h\"\nHttpCacheSM::HttpCacheSM() {}\n\nHttpCacheAction::HttpCacheAction() : sm(nullptr) {}\nvoid\nHttpCacheAction::cancel(Continuation *c)\n{\n}\n<|endoftext|>"} {"text":"\/*\nThis file is part of the Multivariate Splines library.\nCopyright (C) 2012 Bjarne Grimstad (bjarne.grimstad@gmail.com)\n\nThis program is free software; you can redistribute it and\/or modify\nit under the terms of the GNU General Public License as published by\nthe Free Software Foundation; either version 2 of the License, or\n(at your option) any later version.\n\nThis program is distributed in the hope that it will be useful,\nbut WITHOUT ANY WARRANTY; without even the implied warranty of\nMERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the\nGNU General Public License for more details.\n\nYou should have received a copy of the GNU General Public License along\nwith this program; if not, write to the Free Software Foundation, Inc.,\n51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA.\n*\/\n\n#include \"datatable.h\"\n\n#include \n#include \n#include \n#include \n\nnamespace MultivariateSplines\n{\n\n\/\/Simple definition of checked strto* functions according to the implementations of sto* C++11 functions at:\n\/\/ http:\/\/msdn.microsoft.com\/en-us\/library\/ee404775.aspx\n\/\/ http:\/\/msdn.microsoft.com\/en-us\/library\/ee404860.aspx\n\/\/ https:\/\/gcc.gnu.org\/svn\/gcc\/trunk\/libstdc++-v3\/include\/bits\/basic_string.h\n\/\/ https:\/\/gcc.gnu.org\/svn\/gcc\/trunk\/libstdc++-v3\/include\/ext\/string_conversions.h\n\ndouble checked_strtod(const char* _Str, char** _Eptr) {\n\n double _Ret;\n char* _EptrTmp;\n\n errno = 0;\n\n _Ret = std::strtod(_Str, &_EptrTmp);\n\n if(_EptrTmp == _Str)\n {\n throw std::invalid_argument(\"strtod\");\n }\n else if(errno == ERANGE)\n {\n throw std::out_of_range(\"strtod\");\n }\n else\n {\n if(_Eptr != nullptr)\n {\n *_Eptr = _EptrTmp;\n }\n\n return _Ret;\n }\n}\n\nint checked_strtol(const char* _Str, char** _Eptr, size_t _Base = 10) {\n\n long _Ret;\n char* _EptrTmp;\n\n errno = 0;\n\n _Ret = std::strtol(_Str, &_EptrTmp, _Base);\n\n if(_EptrTmp == _Str)\n {\n throw std::invalid_argument(\"strtol\");\n }\n else if(errno == ERANGE ||\n (_Ret < std::numeric_limits::min() || _Ret > std::numeric_limits::max()))\n {\n throw std::out_of_range(\"strtol\");\n }\n else\n {\n if(_Eptr != nullptr)\n {\n *_Eptr = _EptrTmp;\n }\n\n return _Ret;\n }\n}\n\n\nDataTable::DataTable()\n : DataTable(false, false)\n{\n}\n\nDataTable::DataTable(bool allowDuplicates)\n : DataTable(allowDuplicates, false)\n{\n}\n\nDataTable::DataTable(bool allowDuplicates, bool allowIncompleteGrid)\n : allowDuplicates(allowDuplicates),\n allowIncompleteGrid(allowIncompleteGrid),\n numDuplicates(0),\n numVariables(0)\n{\n}\n\nvoid DataTable::addSample(double x, double y)\n{\n addSample(DataSample(x, y));\n}\n\nvoid DataTable::addSample(std::vector x, double y)\n{\n addSample(DataSample(x, y));\n}\n\nvoid DataTable::addSample(DenseVector x, double y)\n{\n addSample(DataSample(x, y));\n}\n\nvoid DataTable::addSample(const DataSample &sample)\n{\n if(getNumSamples() == 0)\n {\n numVariables = sample.getDimX();\n initDataStructures();\n }\n\n assert(sample.getDimX() == numVariables); \/\/ All points must have the same dimension\n\n \/\/ Check if the sample has been added already\n if(samples.count(sample) > 0)\n {\n if(!allowDuplicates)\n {\n std::cout << \"Discarding duplicate sample because allowDuplicates is false!\" << std::endl;\n std::cout << \"Initialise with DataTable(true) to set it to true.\" << std::endl;\n return;\n }\n\n numDuplicates++;\n }\n\n samples.insert(sample);\n\n recordGridPoint(sample);\n}\n\nvoid DataTable::recordGridPoint(const DataSample &sample)\n{\n for(unsigned int i = 0; i < getNumVariables(); i++)\n {\n grid.at(i).insert(sample.getX().at(i));\n }\n}\n\nunsigned int DataTable::getNumSamplesRequired() const\n{\n unsigned long samplesRequired = 1;\n unsigned int i = 0;\n for(auto &variable : grid)\n {\n samplesRequired *= (unsigned long) variable.size();\n i++;\n }\n\n return (i > 0 ? samplesRequired : (unsigned long) 0);\n}\n\nbool DataTable::isGridComplete() const\n{\n return samples.size() > 0 && samples.size() - numDuplicates == getNumSamplesRequired();\n}\n\nvoid DataTable::initDataStructures()\n{\n for(unsigned int i = 0; i < getNumVariables(); i++)\n {\n grid.push_back(std::set());\n }\n}\n\nvoid DataTable::gridCompleteGuard() const\n{\n if(!isGridComplete() && !allowIncompleteGrid)\n {\n std::cout << \"The grid is not complete yet!\" << std::endl;\n exit(1);\n }\n}\n\n\/***********\n * Getters *\n ***********\/\n\nstd::multiset::const_iterator DataTable::cbegin() const\n{\n gridCompleteGuard();\n\n return samples.cbegin();\n}\n\nstd::multiset::const_iterator DataTable::cend() const\n{\n gridCompleteGuard();\n\n return samples.cend();\n}\n\n\/\/ Get table of samples x-values,\n\/\/ i.e. table[i][j] is the value of variable i at sample j\nstd::vector< std::vector > DataTable::getTableX() const\n{\n gridCompleteGuard();\n\n \/\/ Initialize table\n std::vector> table;\n for(unsigned int i = 0; i < numVariables; i++)\n {\n std::vector xi(getNumSamples(), 0.0);\n table.push_back(xi);\n }\n\n \/\/ Fill table with values\n int i = 0;\n for(auto &sample : samples)\n {\n std::vector x = sample.getX();\n\n for(unsigned int j = 0; j < numVariables; j++)\n {\n table.at(j).at(i) = x.at(j);\n }\n i++;\n }\n\n return table;\n}\n\n\/\/ Get vector of y-values\nstd::vector DataTable::getVectorY() const\n{\n std::vector y;\n for(std::multiset::const_iterator it = cbegin(); it != cend(); ++it)\n {\n y.push_back(it->getY());\n }\n return y;\n}\n\n\/*****************\n * Save and load *\n *****************\/\n\nvoid DataTable::save(std::string fileName) const\n{\n std::ofstream outFile;\n\n try\n {\n outFile.open(fileName);\n }\n catch(const std::ios_base::failure &e)\n {\n throw;\n }\n\n \/\/ If this function is still alive the file must be open,\n \/\/ no need to call is_open()\n\n \/\/ Write header\n outFile << \"# Saved DataTable\" << '\\n';\n outFile << \"# Number of samples: \" << getNumSamples() << '\\n';\n outFile << \"# Complete grid: \" << (isGridComplete() ? \"yes\" : \"no\") << '\\n';\n outFile << \"# xDim: \" << numVariables << '\\n';\n outFile << numVariables << \" \" << 1 << '\\n';\n\n for(auto it = cbegin(); it != cend(); it++)\n {\n for(unsigned int i = 0; i < numVariables; i++)\n {\n outFile << std::setprecision(SAVE_DOUBLE_PRECISION) << it->getX().at(i) << \" \";\n }\n\n outFile << std::setprecision(SAVE_DOUBLE_PRECISION) << it->getY();\n\n outFile << '\\n';\n }\n\n \/\/ close() also flushes\n try\n {\n outFile.close();\n }\n catch(const std::ios_base::failure &e)\n {\n throw;\n }\n}\n\nvoid DataTable::load(std::string fileName)\n{\n std::ifstream inFile;\n\n try\n {\n inFile.open(fileName);\n }\n catch(const std::ios_base::failure &e)\n {\n throw;\n }\n\n \/\/ If this function is still alive the file must be open,\n \/\/ no need to call is_open()\n\n \/\/ Skip past comments\n std::string line;\n\n int nX, nY;\n int state = 0;\n while(std::getline(inFile, line))\n {\n \/\/ Look for comment sign\n if(line.at(0) == '#')\n continue;\n\n \/\/ Reading number of dimensions\n if(state == 0)\n {\n nX = checked_strtol(line.c_str(), nullptr, 10);\n nY = 1;\n state = 1;\n }\n\n \/\/ Reading samples\n else if(state == 1)\n {\n auto x = std::vector(nX);\n auto y = std::vector(nY);\n\n const char* str = line.c_str();\n char* nextStr = nullptr;\n\n for(int i = 0; i < nX; i++)\n {\n x.at(i) = checked_strtod(str, &nextStr);\n str = nextStr;\n }\n for(int j = 0; j < nY; j++)\n {\n y.at(j) = checked_strtod(str, &nextStr);\n str = nextStr;\n }\n\n addSample(x, y.at(0));\n }\n }\n\n \/\/ close() also flushes\n try\n {\n inFile.close();\n }\n catch(const std::ios_base::failure &e)\n {\n throw;\n }\n}\n\n\/**************\n * Debug code *\n **************\/\nvoid DataTable::printSamples() const\n{\n for(auto &sample : samples)\n {\n std::cout << sample << std::endl;\n }\n}\n\nvoid DataTable::printGrid() const\n{\n std::cout << \"===== Printing grid =====\" << std::endl;\n\n unsigned int i = 0;\n for(auto &variable : grid)\n {\n std::cout << \"x\" << i++ << \"(\" << variable.size() << \"): \";\n for(double value : variable)\n {\n std::cout << value << \" \";\n }\n std::cout << std::endl;\n }\n\n std::cout << \"Unique samples added: \" << samples.size() << std::endl;\n std::cout << \"Samples required: \" << getNumSamplesRequired() << std::endl;\n}\n\n} \/\/ namespace MultivariateSplines\nEnsure consistent behavior across all locales by saving and loading datatables with the C locale.\/*\nThis file is part of the Multivariate Splines library.\nCopyright (C) 2012 Bjarne Grimstad (bjarne.grimstad@gmail.com)\n\nThis program is free software; you can redistribute it and\/or modify\nit under the terms of the GNU General Public License as published by\nthe Free Software Foundation; either version 2 of the License, or\n(at your option) any later version.\n\nThis program is distributed in the hope that it will be useful,\nbut WITHOUT ANY WARRANTY; without even the implied warranty of\nMERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the\nGNU General Public License for more details.\n\nYou should have received a copy of the GNU General Public License along\nwith this program; if not, write to the Free Software Foundation, Inc.,\n51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA.\n*\/\n\n#include \"datatable.h\"\n\n#include \n#include \n#include \n#include \n\nnamespace MultivariateSplines\n{\n\n\/\/Simple definition of checked strto* functions according to the implementations of sto* C++11 functions at:\n\/\/ http:\/\/msdn.microsoft.com\/en-us\/library\/ee404775.aspx\n\/\/ http:\/\/msdn.microsoft.com\/en-us\/library\/ee404860.aspx\n\/\/ https:\/\/gcc.gnu.org\/svn\/gcc\/trunk\/libstdc++-v3\/include\/bits\/basic_string.h\n\/\/ https:\/\/gcc.gnu.org\/svn\/gcc\/trunk\/libstdc++-v3\/include\/ext\/string_conversions.h\n\ndouble checked_strtod(const char* _Str, char** _Eptr) {\n\n double _Ret;\n char* _EptrTmp;\n\n errno = 0;\n\n _Ret = std::strtod(_Str, &_EptrTmp);\n\n if(_EptrTmp == _Str)\n {\n throw std::invalid_argument(\"strtod\");\n }\n else if(errno == ERANGE)\n {\n throw std::out_of_range(\"strtod\");\n }\n else\n {\n if(_Eptr != nullptr)\n {\n *_Eptr = _EptrTmp;\n }\n\n return _Ret;\n }\n}\n\nint checked_strtol(const char* _Str, char** _Eptr, size_t _Base = 10) {\n\n long _Ret;\n char* _EptrTmp;\n\n errno = 0;\n\n _Ret = std::strtol(_Str, &_EptrTmp, _Base);\n\n if(_EptrTmp == _Str)\n {\n throw std::invalid_argument(\"strtol\");\n }\n else if(errno == ERANGE ||\n (_Ret < std::numeric_limits::min() || _Ret > std::numeric_limits::max()))\n {\n throw std::out_of_range(\"strtol\");\n }\n else\n {\n if(_Eptr != nullptr)\n {\n *_Eptr = _EptrTmp;\n }\n\n return _Ret;\n }\n}\n\n\nDataTable::DataTable()\n : DataTable(false, false)\n{\n}\n\nDataTable::DataTable(bool allowDuplicates)\n : DataTable(allowDuplicates, false)\n{\n}\n\nDataTable::DataTable(bool allowDuplicates, bool allowIncompleteGrid)\n : allowDuplicates(allowDuplicates),\n allowIncompleteGrid(allowIncompleteGrid),\n numDuplicates(0),\n numVariables(0)\n{\n}\n\nvoid DataTable::addSample(double x, double y)\n{\n addSample(DataSample(x, y));\n}\n\nvoid DataTable::addSample(std::vector x, double y)\n{\n addSample(DataSample(x, y));\n}\n\nvoid DataTable::addSample(DenseVector x, double y)\n{\n addSample(DataSample(x, y));\n}\n\nvoid DataTable::addSample(const DataSample &sample)\n{\n if(getNumSamples() == 0)\n {\n numVariables = sample.getDimX();\n initDataStructures();\n }\n\n assert(sample.getDimX() == numVariables); \/\/ All points must have the same dimension\n\n \/\/ Check if the sample has been added already\n if(samples.count(sample) > 0)\n {\n if(!allowDuplicates)\n {\n std::cout << \"Discarding duplicate sample because allowDuplicates is false!\" << std::endl;\n std::cout << \"Initialise with DataTable(true) to set it to true.\" << std::endl;\n return;\n }\n\n numDuplicates++;\n }\n\n samples.insert(sample);\n\n recordGridPoint(sample);\n}\n\nvoid DataTable::recordGridPoint(const DataSample &sample)\n{\n for(unsigned int i = 0; i < getNumVariables(); i++)\n {\n grid.at(i).insert(sample.getX().at(i));\n }\n}\n\nunsigned int DataTable::getNumSamplesRequired() const\n{\n unsigned long samplesRequired = 1;\n unsigned int i = 0;\n for(auto &variable : grid)\n {\n samplesRequired *= (unsigned long) variable.size();\n i++;\n }\n\n return (i > 0 ? samplesRequired : (unsigned long) 0);\n}\n\nbool DataTable::isGridComplete() const\n{\n return samples.size() > 0 && samples.size() - numDuplicates == getNumSamplesRequired();\n}\n\nvoid DataTable::initDataStructures()\n{\n for(unsigned int i = 0; i < getNumVariables(); i++)\n {\n grid.push_back(std::set());\n }\n}\n\nvoid DataTable::gridCompleteGuard() const\n{\n if(!isGridComplete() && !allowIncompleteGrid)\n {\n std::cout << \"The grid is not complete yet!\" << std::endl;\n exit(1);\n }\n}\n\n\/***********\n * Getters *\n ***********\/\n\nstd::multiset::const_iterator DataTable::cbegin() const\n{\n gridCompleteGuard();\n\n return samples.cbegin();\n}\n\nstd::multiset::const_iterator DataTable::cend() const\n{\n gridCompleteGuard();\n\n return samples.cend();\n}\n\n\/\/ Get table of samples x-values,\n\/\/ i.e. table[i][j] is the value of variable i at sample j\nstd::vector< std::vector > DataTable::getTableX() const\n{\n gridCompleteGuard();\n\n \/\/ Initialize table\n std::vector> table;\n for(unsigned int i = 0; i < numVariables; i++)\n {\n std::vector xi(getNumSamples(), 0.0);\n table.push_back(xi);\n }\n\n \/\/ Fill table with values\n int i = 0;\n for(auto &sample : samples)\n {\n std::vector x = sample.getX();\n\n for(unsigned int j = 0; j < numVariables; j++)\n {\n table.at(j).at(i) = x.at(j);\n }\n i++;\n }\n\n return table;\n}\n\n\/\/ Get vector of y-values\nstd::vector DataTable::getVectorY() const\n{\n std::vector y;\n for(std::multiset::const_iterator it = cbegin(); it != cend(); ++it)\n {\n y.push_back(it->getY());\n }\n return y;\n}\n\n\/*****************\n * Save and load *\n *****************\/\n\nvoid DataTable::save(std::string fileName) const\n{\n\n \/\/ To give a consistent format across all locales, use the C locale when saving and loading\n std::locale current_locale = std::locale::global(std::locale(\"C\"));\n\n std::ofstream outFile;\n\n try\n {\n outFile.open(fileName);\n }\n catch(const std::ios_base::failure &e)\n {\n throw;\n }\n\n \/\/ If this function is still alive the file must be open,\n \/\/ no need to call is_open()\n\n \/\/ Write header\n outFile << \"# Saved DataTable\" << '\\n';\n outFile << \"# Number of samples: \" << getNumSamples() << '\\n';\n outFile << \"# Complete grid: \" << (isGridComplete() ? \"yes\" : \"no\") << '\\n';\n outFile << \"# xDim: \" << numVariables << '\\n';\n outFile << numVariables << \" \" << 1 << '\\n';\n\n for(auto it = cbegin(); it != cend(); it++)\n {\n for(unsigned int i = 0; i < numVariables; i++)\n {\n outFile << std::setprecision(SAVE_DOUBLE_PRECISION) << it->getX().at(i) << \" \";\n }\n\n outFile << std::setprecision(SAVE_DOUBLE_PRECISION) << it->getY();\n\n outFile << '\\n';\n }\n\n \/\/ close() also flushes\n try\n {\n outFile.close();\n }\n catch(const std::ios_base::failure &e)\n {\n throw;\n }\n\n std::locale::global(current_locale);\n}\n\nvoid DataTable::load(std::string fileName)\n{\n\n \/\/ To give a consistent format across all locales, use the C locale when saving and loading\n std::locale current_locale = std::locale::global(std::locale(\"C\"));\n\n std::ifstream inFile;\n\n try\n {\n inFile.open(fileName);\n }\n catch(const std::ios_base::failure &e)\n {\n throw;\n }\n\n \/\/ If this function is still alive the file must be open,\n \/\/ no need to call is_open()\n\n \/\/ Skip past comments\n std::string line;\n\n int nX, nY;\n int state = 0;\n while(std::getline(inFile, line))\n {\n \/\/ Look for comment sign\n if(line.at(0) == '#')\n {\n continue;\n }\n\n \/\/ Reading number of dimensions\n else if(state == 0)\n {\n nX = checked_strtol(line.c_str(), nullptr, 10);\n nY = 1;\n state = 1;\n }\n\n \/\/ Reading samples\n else if(state == 1)\n {\n auto x = std::vector(nX);\n auto y = std::vector(nY);\n\n const char* str = line.c_str();\n char* nextStr = nullptr;\n\n for(int i = 0; i < nX; i++)\n {\n x.at(i) = checked_strtod(str, &nextStr);\n str = nextStr;\n }\n for(int j = 0; j < nY; j++)\n {\n y.at(j) = checked_strtod(str, &nextStr);\n str = nextStr;\n }\n\n addSample(x, y.at(0));\n }\n }\n\n \/\/ close() also flushes\n try\n {\n inFile.close();\n }\n catch(const std::ios_base::failure &e)\n {\n throw;\n }\n\n std::locale::global(current_locale);\n}\n\n\/**************\n * Debug code *\n **************\/\nvoid DataTable::printSamples() const\n{\n for(auto &sample : samples)\n {\n std::cout << sample << std::endl;\n }\n}\n\nvoid DataTable::printGrid() const\n{\n std::cout << \"===== Printing grid =====\" << std::endl;\n\n unsigned int i = 0;\n for(auto &variable : grid)\n {\n std::cout << \"x\" << i++ << \"(\" << variable.size() << \"): \";\n for(double value : variable)\n {\n std::cout << value << \" \";\n }\n std::cout << std::endl;\n }\n\n std::cout << \"Unique samples added: \" << samples.size() << std::endl;\n std::cout << \"Samples required: \" << getNumSamplesRequired() << std::endl;\n}\n\n} \/\/ namespace MultivariateSplines\n<|endoftext|>"} {"text":"#include \n#include \n\nusing namespace std;\nusing namespace pqxx;\n\n\/\/ clang++ update.cpp -o update -lpqxx -lpq\n\nint main() {\n const char * sql;\n \n try {\n connection C(\"dbname=benchcare user=synod password= \\\n hostaddr=127.0.0.1 port=5432\");\n if (C.is_open()) {\n cout << \"Opened database successfully: \" << C.dbname() << endl;\n } else {\n cout << \"Can't open database\" << endl;\n return 1;\n }\n \n \/* Create a transactional object. *\/\n work W(C);\n \/* Create SQL UPDATE statement *\/\n sql = \"UPDATE COMPANY set SALARY = 25000.00 where ID=1\";\n \/* Execute SQL query *\/\n W.exec( sql );\n W.commit();\n cout << \"Records updated successfully\" << endl;\n \n \/* Create SQL SELECT statement *\/\n sql = \"SELECT * from COMPANY\";\n\n \/* Create a non-transactional object. *\/\n nontransaction N(C);\n \n \/* Execute SQL query *\/\n result R( N.exec( sql ));\n \n \/* List down all the records *\/\n for (result::const_iterator c = R.begin(); c != R.end(); ++c) {\n cout << \"ID = \" << c[0].as() << endl;\n cout << \"Name = \" << c[1].as() << endl;\n cout << \"Age = \" << c[2].as() << endl;\n cout << \"Address = \" << c[3].as() << endl;\n cout << \"Salary = \" << c[4].as() << endl;\n }\n cout << \"Operation done successfully\" << endl;\n C.disconnect ();\n } catch (const std::exception &e){\n cerr << e.what() << std::endl;\n return 1;\n }\n\n return 0;\n}\nupdate query#include \n#include \n\nusing namespace std;\nusing namespace pqxx;\n\n\/\/ clang++ update.cpp -o update -lpqxx -lpq\n\nint main() {\n const char * sql;\n \n try {\n connection C(\"dbname=benchcare user=synod password= \\\n hostaddr=127.0.0.1 port=5432\");\n if (C.is_open()) {\n cout << \"Opened database successfully: \" << C.dbname() << endl;\n } else {\n cout << \"Can't open database\" << endl;\n return 1;\n }\n \n \/* Create a transactional object. *\/\n work W(C);\n \/* Create SQL UPDATE statement *\/\n sql = \"UPDATE COMPANY set SALARY = 25000.00 where ID=1\";\n \/* Execute SQL query *\/\n W.exec( sql );\n W.commit();\n cout << \"Records updated successfully\" << endl;\n \n \/* Create SQL SELECT statement *\/\n sql = \"SELECT * from COMPANY\";\n\n \/* Create a non-transactional object. *\/\n nontransaction N(C);\n \n \/* Execute SQL query *\/\n result R( N.exec( sql ));\n \n \/* List down all the records *\/\n for (result::const_iterator c = R.begin(); c != R.end(); ++c) {\n cout << \"ID = \" << c[0].as() << endl;\n cout << \"Name = \" << c[1].as() << endl;\n cout << \"Age = \" << c[2].as() << endl;\n cout << \"Address = \" << c[3].as() << endl;\n cout << \"Salary = \" << c[4].as() << endl;\n }\n cout << \"Operation done successfully\" << endl;\n C.disconnect ();\n } catch (const std::exception &e) {\n cerr << e.what() << std::endl;\n return 1;\n }\n\n return 0;\n}\n<|endoftext|>"} {"text":"#include \"dispatcher.h\"\n#include \n\nDispatcher::Dispatcher() {\n connection=dispatcher.connect([this] {\n std::vector>::iterator> its;\n {\n std::unique_lock lock(functions_mutex);\n its.reserve(functions.size());\n for(auto it=functions.begin();it!=functions.end();++it)\n its.emplace_back(it);\n }\n for(auto &it: its)\n (*it)();\n {\n std::unique_lock lock(functions_mutex);\n for(auto &it: its)\n functions.erase(it);\n }\n });\n}\n\nDispatcher::~Dispatcher() {\n disconnect();\n}\n\nvoid Dispatcher::disconnect() {\n connection.disconnect();\n}\nMinor optimization of Dispatcher::dispatcher handler#include \"dispatcher.h\"\n#include \n\nDispatcher::Dispatcher() {\n connection=dispatcher.connect([this] {\n std::vector>::iterator> its;\n {\n std::unique_lock lock(functions_mutex);\n if(functions.empty())\n return;\n its.reserve(functions.size());\n for(auto it=functions.begin();it!=functions.end();++it)\n its.emplace_back(it);\n }\n for(auto &it: its)\n (*it)();\n {\n std::unique_lock lock(functions_mutex);\n for(auto &it: its)\n functions.erase(it);\n }\n });\n}\n\nDispatcher::~Dispatcher() {\n disconnect();\n}\n\nvoid Dispatcher::disconnect() {\n connection.disconnect();\n}\n<|endoftext|>"} {"text":"\/*************************************************************************\n *\n * OpenOffice.org - a multi-platform office productivity suite\n *\n * $RCSfile: AttributeContainerHandler.cxx,v $\n *\n * $Revision: 1.5 $\n *\n * last change: $Author: obo $ $Date: 2006-10-12 14:44: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_xmloff.hxx\"\n\n#ifndef _COM_SUN_STAR_CONTAINER_XNAMECONTAINER_HPP_\n#include \n#endif\n#ifndef _COM_SUN_STAR_XML_ATTRIBUTEDATA_HPP_\n#include \n#endif\n\n#ifndef _COM_SUN_STAR_UNO_ANY_HXX_\n#include \n#endif\n\n#ifndef _RTL_USTRBUF_HXX_\n#include \n#endif\n\n#ifndef _COM_SUN_STAR_TEXT_GRAPHICCROP_HPP_\n#include \n#endif\n\n#include \"AttributeContainerHandler.hxx\"\n\nusing namespace ::rtl;\nusing namespace ::com::sun::star;\nusing namespace ::com::sun::star::uno;\nusing namespace ::com::sun::star::container;\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\n\/\/ class XMLAttributeContainerHandler\n\/\/\n\nXMLAttributeContainerHandler::~XMLAttributeContainerHandler()\n{\n \/\/ nothing to do\n}\n\nbool XMLAttributeContainerHandler::equals(\n const Any& r1,\n const Any& r2 ) const\n{\n Reference< XNameContainer > xContainer1;\n Reference< XNameContainer > xContainer2;\n\n if( ( r1 >>= xContainer1 ) && ( r2 >>= xContainer2 ) )\n {\n uno::Sequence< OUString > aAttribNames1( xContainer1->getElementNames() );\n uno::Sequence< OUString > aAttribNames2( xContainer2->getElementNames() );\n const sal_Int32 nCount = aAttribNames1.getLength();\n\n if( aAttribNames2.getLength() == nCount )\n {\n const OUString* pAttribName = aAttribNames1.getConstArray();\n\n xml::AttributeData aData1;\n xml::AttributeData aData2;\n\n for( sal_Int32 i=0; i < nCount; i++, pAttribName++ )\n {\n if( !xContainer2->hasByName( *pAttribName ) )\n return sal_False;\n\n xContainer1->getByName( *pAttribName ) >>= aData1;\n xContainer2->getByName( *pAttribName ) >>= aData2;\n\n if( ( aData1.Namespace != aData2.Namespace ) ||\n ( aData1.Type != aData2.Type ) ||\n ( aData1.Value != aData2.Value ) )\n return sal_False;\n }\n\n return sal_True;\n }\n }\n\n return sal_False;\n}\n\nsal_Bool XMLAttributeContainerHandler::importXML( const OUString& \/*rStrImpValue*\/, Any& \/*rValue*\/, const SvXMLUnitConverter& \/*rUnitConverter*\/ ) const\n{\n return sal_True;\n}\n\nsal_Bool XMLAttributeContainerHandler::exportXML( OUString& \/*rStrExpValue*\/, const Any& \/*rValue*\/, const SvXMLUnitConverter& \/*rUnitConverter*\/ ) const\n{\n return sal_True;\n}\nINTEGRATION: CWS impresstables2 (1.5.70); FILE MERGED 2007\/07\/27 09:09:53 cl 1.5.70.1: fixed build issues due to pch and namespace ::rtl\/*************************************************************************\n *\n * OpenOffice.org - a multi-platform office productivity suite\n *\n * $RCSfile: AttributeContainerHandler.cxx,v $\n *\n * $Revision: 1.6 $\n *\n * last change: $Author: rt $ $Date: 2008-03-12 10:41:02 $\n *\n * The Contents of this file are made available subject to\n * the terms of GNU Lesser General Public License Version 2.1.\n *\n *\n * GNU Lesser General Public License Version 2.1\n * =============================================\n * Copyright 2005 by Sun Microsystems, Inc.\n * 901 San Antonio Road, Palo Alto, CA 94303, USA\n *\n * This library is free software; you can redistribute it and\/or\n * modify it under the terms of the GNU Lesser General Public\n * License version 2.1, as published by the Free Software Foundation.\n *\n * This library is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU\n * Lesser General Public License for more details.\n *\n * You should have received a copy of the GNU Lesser General Public\n * License along with this library; if not, write to the Free Software\n * Foundation, Inc., 59 Temple Place, Suite 330, Boston,\n * MA 02111-1307 USA\n *\n ************************************************************************\/\n\n\/\/ MARKER(update_precomp.py): autogen include statement, do not remove\n#include \"precompiled_xmloff.hxx\"\n\n#ifndef _COM_SUN_STAR_CONTAINER_XNAMECONTAINER_HPP_\n#include \n#endif\n#ifndef _COM_SUN_STAR_XML_ATTRIBUTEDATA_HPP_\n#include \n#endif\n\n#ifndef _COM_SUN_STAR_UNO_ANY_HXX_\n#include \n#endif\n\n#ifndef _RTL_USTRBUF_HXX_\n#include \n#endif\n\n#ifndef _COM_SUN_STAR_TEXT_GRAPHICCROP_HPP_\n#include \n#endif\n\n#include \"AttributeContainerHandler.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;\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\n\/\/ class XMLAttributeContainerHandler\n\/\/\n\nXMLAttributeContainerHandler::~XMLAttributeContainerHandler()\n{\n \/\/ nothing to do\n}\n\nbool XMLAttributeContainerHandler::equals(\n const Any& r1,\n const Any& r2 ) const\n{\n Reference< XNameContainer > xContainer1;\n Reference< XNameContainer > xContainer2;\n\n if( ( r1 >>= xContainer1 ) && ( r2 >>= xContainer2 ) )\n {\n uno::Sequence< OUString > aAttribNames1( xContainer1->getElementNames() );\n uno::Sequence< OUString > aAttribNames2( xContainer2->getElementNames() );\n const sal_Int32 nCount = aAttribNames1.getLength();\n\n if( aAttribNames2.getLength() == nCount )\n {\n const OUString* pAttribName = aAttribNames1.getConstArray();\n\n xml::AttributeData aData1;\n xml::AttributeData aData2;\n\n for( sal_Int32 i=0; i < nCount; i++, pAttribName++ )\n {\n if( !xContainer2->hasByName( *pAttribName ) )\n return sal_False;\n\n xContainer1->getByName( *pAttribName ) >>= aData1;\n xContainer2->getByName( *pAttribName ) >>= aData2;\n\n if( ( aData1.Namespace != aData2.Namespace ) ||\n ( aData1.Type != aData2.Type ) ||\n ( aData1.Value != aData2.Value ) )\n return sal_False;\n }\n\n return sal_True;\n }\n }\n\n return sal_False;\n}\n\nsal_Bool XMLAttributeContainerHandler::importXML( const OUString& \/*rStrImpValue*\/, Any& \/*rValue*\/, const SvXMLUnitConverter& \/*rUnitConverter*\/ ) const\n{\n return sal_True;\n}\n\nsal_Bool XMLAttributeContainerHandler::exportXML( OUString& \/*rStrExpValue*\/, const Any& \/*rValue*\/, const SvXMLUnitConverter& \/*rUnitConverter*\/ ) const\n{\n return sal_True;\n}\n<|endoftext|>"} {"text":"\/*************************************************************************\n *\n * OpenOffice.org - a multi-platform office productivity suite\n *\n * $RCSfile: XMLBackgroundImageContext.cxx,v $\n *\n * $Revision: 1.12 $\n *\n * last change: $Author: hr $ $Date: 2006-04-19 13:36: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 _TOOLS_DEBUG_HXX\n#include \n#endif\n\n#ifndef _COM_SUN_STAR_IO_XOUTPUTSTREAM_HPP_\n#include \n#endif\n\n#ifndef _XMLOFF_XMLTKMAP_HXX\n#include \"xmltkmap.hxx\"\n#endif\n#ifndef _XMLOFF_XMLUCONV_HXX\n#include \"xmluconv.hxx\"\n#endif\n#ifndef _XMLOFF_XMLNMSPE_HXX\n#include \"xmlnmspe.hxx\"\n#endif\n#ifndef _XMLOFF_XMLTOKEN_HXX\n#include \"xmltoken.hxx\"\n#endif\n#ifndef _XMLOFF_XMLIMP_HXX\n#include \"xmlimp.hxx\"\n#endif\n#ifndef _XMLOFF_NMSPMAP_HXX\n#include \"nmspmap.hxx\"\n#endif\n#ifndef _XMLOFF_XMLBASE64IMPORTCONTEXT_HXX\n#include \"XMLBase64ImportContext.hxx\"\n#endif\n\n#ifndef _XMLBACKGROUNDIMAGECONTEXT_HXX\n#include \"XMLBackgroundImageContext.hxx\"\n#endif\n\nusing namespace ::rtl;\nusing namespace ::com::sun::star;\nusing namespace ::com::sun::star::uno;\nusing namespace ::com::sun::star::style;\nusing namespace ::com::sun::star::io;\nusing namespace ::xmloff::token;\n\nenum SvXMLTokenMapAttrs\n{\n XML_TOK_BGIMG_HREF,\n XML_TOK_BGIMG_TYPE,\n XML_TOK_BGIMG_ACTUATE,\n XML_TOK_BGIMG_SHOW,\n XML_TOK_BGIMG_POSITION,\n XML_TOK_BGIMG_REPEAT,\n XML_TOK_BGIMG_FILTER,\n XML_TOK_BGIMG_OPACITY,\n XML_TOK_NGIMG_END=XML_TOK_UNKNOWN\n};\n\nstatic __FAR_DATA SvXMLTokenMapEntry aBGImgAttributesAttrTokenMap[] =\n{\n { XML_NAMESPACE_XLINK, XML_HREF, XML_TOK_BGIMG_HREF },\n { XML_NAMESPACE_XLINK, XML_TYPE, XML_TOK_BGIMG_TYPE },\n { XML_NAMESPACE_XLINK, XML_ACTUATE, XML_TOK_BGIMG_ACTUATE },\n { XML_NAMESPACE_XLINK, XML_SHOW, XML_TOK_BGIMG_SHOW },\n { XML_NAMESPACE_STYLE, XML_POSITION, XML_TOK_BGIMG_POSITION },\n { XML_NAMESPACE_STYLE, XML_REPEAT, XML_TOK_BGIMG_REPEAT },\n { XML_NAMESPACE_STYLE, XML_FILTER_NAME, XML_TOK_BGIMG_FILTER },\n { XML_NAMESPACE_DRAW, XML_OPACITY, XML_TOK_BGIMG_OPACITY },\n XML_TOKEN_MAP_END\n};\n\nSvXMLEnumMapEntry psXML_BrushRepeat[] =\n{\n { XML_BACKGROUND_REPEAT, GraphicLocation_TILED },\n { XML_BACKGROUND_NO_REPEAT, GraphicLocation_MIDDLE_MIDDLE },\n { XML_BACKGROUND_STRETCH, GraphicLocation_AREA },\n { XML_TOKEN_INVALID, 0 }\n};\n\nSvXMLEnumMapEntry psXML_BrushHoriPos[] =\n{\n { XML_LEFT, GraphicLocation_LEFT_MIDDLE },\n { XML_RIGHT, GraphicLocation_RIGHT_MIDDLE },\n { XML_TOKEN_INVALID, 0 }\n};\n\nSvXMLEnumMapEntry psXML_BrushVertPos[] =\n{\n { XML_TOP, GraphicLocation_MIDDLE_TOP },\n { XML_BOTTOM, GraphicLocation_MIDDLE_BOTTOM },\n { XML_TOKEN_INVALID, 0 }\n};\n\nvoid lcl_xmlbic_MergeHoriPos( GraphicLocation& ePos,\n GraphicLocation eHori )\n{\n DBG_ASSERT( GraphicLocation_LEFT_MIDDLE==eHori ||\n GraphicLocation_MIDDLE_MIDDLE==eHori ||\n GraphicLocation_RIGHT_MIDDLE==eHori,\n \"lcl_xmlbic_MergeHoriPos: vertical pos must be middle\" );\n\n switch( ePos )\n {\n case GraphicLocation_LEFT_TOP:\n case GraphicLocation_MIDDLE_TOP:\n case GraphicLocation_RIGHT_TOP:\n ePos = GraphicLocation_LEFT_MIDDLE==eHori\n ? GraphicLocation_LEFT_TOP\n : (GraphicLocation_MIDDLE_MIDDLE==eHori\n ? GraphicLocation_MIDDLE_TOP\n : GraphicLocation_RIGHT_TOP);\n break;\n\n case GraphicLocation_LEFT_MIDDLE:\n case GraphicLocation_MIDDLE_MIDDLE:\n case GraphicLocation_RIGHT_MIDDLE:\n ePos = eHori;\n break;\n\n case GraphicLocation_LEFT_BOTTOM:\n case GraphicLocation_MIDDLE_BOTTOM:\n case GraphicLocation_RIGHT_BOTTOM:\n ePos = GraphicLocation_LEFT_MIDDLE==eHori\n ? GraphicLocation_LEFT_BOTTOM\n : (GraphicLocation_MIDDLE_MIDDLE==eHori\n ? GraphicLocation_MIDDLE_BOTTOM\n : GraphicLocation_RIGHT_BOTTOM);\n break;\n }\n}\n\nvoid lcl_xmlbic_MergeVertPos( GraphicLocation& ePos,\n GraphicLocation eVert )\n{\n DBG_ASSERT( GraphicLocation_MIDDLE_TOP==eVert ||\n GraphicLocation_MIDDLE_MIDDLE==eVert ||\n GraphicLocation_MIDDLE_BOTTOM==eVert,\n \"lcl_xmlbic_MergeVertPos: horizontal pos must be middle\" );\n\n switch( ePos )\n {\n case GraphicLocation_LEFT_TOP:\n case GraphicLocation_LEFT_MIDDLE:\n case GraphicLocation_LEFT_BOTTOM:\n ePos = GraphicLocation_MIDDLE_TOP==eVert\n ? GraphicLocation_LEFT_TOP\n : (GraphicLocation_MIDDLE_MIDDLE==eVert\n ? GraphicLocation_LEFT_MIDDLE\n : GraphicLocation_LEFT_BOTTOM);\n ePos = eVert;\n break;\n\n case GraphicLocation_MIDDLE_TOP:\n case GraphicLocation_MIDDLE_MIDDLE:\n case GraphicLocation_MIDDLE_BOTTOM:\n ePos = eVert;\n break;\n\n case GraphicLocation_RIGHT_TOP:\n case GraphicLocation_RIGHT_MIDDLE:\n case GraphicLocation_RIGHT_BOTTOM:\n ePos = GraphicLocation_MIDDLE_TOP==eVert\n ? GraphicLocation_RIGHT_TOP\n : (GraphicLocation_MIDDLE_MIDDLE==eVert\n ? GraphicLocation_RIGHT_MIDDLE\n : GraphicLocation_RIGHT_BOTTOM);\n break;\n }\n}\n\nTYPEINIT1( XMLBackgroundImageContext, XMLElementPropertyContext );\n\nvoid XMLBackgroundImageContext::ProcessAttrs(\n const Reference< xml::sax::XAttributeList >& xAttrList )\n{\n SvXMLTokenMap aTokenMap( aBGImgAttributesAttrTokenMap );\n\n ePos = GraphicLocation_NONE;\n\n SvXMLUnitConverter& rUnitConverter = GetImport().GetMM100UnitConverter();\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 OUString aLocalName;\n sal_uInt16 nPrefix =\n GetImport().GetNamespaceMap().GetKeyByAttrName( rAttrName,\n &aLocalName );\n const OUString& rValue = xAttrList->getValueByIndex( i );\n\n switch( aTokenMap.Get( nPrefix, aLocalName ) )\n {\n case XML_TOK_BGIMG_HREF:\n sURL = rValue;\n if( GraphicLocation_NONE == ePos )\n ePos = GraphicLocation_TILED;\n break;\n case XML_TOK_BGIMG_TYPE:\n case XML_TOK_BGIMG_ACTUATE:\n case XML_TOK_BGIMG_SHOW:\n break;\n case XML_TOK_BGIMG_POSITION:\n {\n GraphicLocation eNewPos = GraphicLocation_NONE, eTmp;\n sal_uInt16 nTmp;\n SvXMLTokenEnumerator aTokenEnum( rValue );\n OUString aToken;\n sal_Bool bHori = sal_False, bVert = sal_False;\n sal_Bool bOK = sal_True;\n while( bOK && aTokenEnum.getNextToken( aToken ) )\n {\n if( bHori && bVert )\n {\n bOK = sal_False;\n }\n else if( -1 != aToken.indexOf( sal_Unicode('%') ) )\n {\n sal_Int32 nPrc = 50;\n if( rUnitConverter.convertPercent( nPrc, aToken ) )\n {\n if( !bHori )\n {\n eNewPos = nPrc < 25\n ? GraphicLocation_LEFT_TOP\n : (nPrc < 75 ? GraphicLocation_MIDDLE_MIDDLE\n : GraphicLocation_RIGHT_BOTTOM);\n bHori = sal_True;\n }\n else\n {\n eTmp = nPrc < 25\n ? GraphicLocation_LEFT_TOP\n : (nPrc < 75 ? GraphicLocation_LEFT_MIDDLE\n : GraphicLocation_LEFT_BOTTOM);\n lcl_xmlbic_MergeVertPos( eNewPos, eTmp );\n bVert = sal_True;\n }\n }\n else\n {\n \/\/ wrong percentage\n bOK = sal_False;\n }\n }\n else if( IsXMLToken( aToken, XML_CENTER ) )\n {\n if( bHori )\n lcl_xmlbic_MergeVertPos( eNewPos,\n GraphicLocation_MIDDLE_MIDDLE );\n else if ( bVert )\n lcl_xmlbic_MergeHoriPos( eNewPos,\n GraphicLocation_MIDDLE_MIDDLE );\n else\n eNewPos = GraphicLocation_MIDDLE_MIDDLE;\n }\n else if( rUnitConverter.convertEnum( nTmp, aToken,\n psXML_BrushHoriPos ) )\n {\n if( bVert )\n lcl_xmlbic_MergeHoriPos( eNewPos,\n (GraphicLocation)nTmp );\n else if( !bHori )\n eNewPos = (GraphicLocation)nTmp;\n else\n bOK = sal_False;\n bHori = sal_True;\n }\n else if( rUnitConverter.convertEnum( nTmp, aToken,\n psXML_BrushVertPos ) )\n {\n if( bHori )\n lcl_xmlbic_MergeVertPos( eNewPos,\n (GraphicLocation)nTmp );\n else if( !bVert )\n eNewPos = (GraphicLocation)nTmp;\n else\n bOK = sal_False;\n bVert = sal_True;\n }\n else\n {\n bOK = sal_False;\n }\n }\n\n bOK &= GraphicLocation_NONE != eNewPos;\n if( bOK )\n ePos = eNewPos;\n }\n break;\n case XML_TOK_BGIMG_REPEAT:\n {\n sal_uInt16 nPos = GraphicLocation_NONE;\n if( rUnitConverter.convertEnum( nPos, rValue,\n psXML_BrushRepeat ) )\n {\n if( GraphicLocation_MIDDLE_MIDDLE != nPos ||\n GraphicLocation_NONE == ePos ||\n GraphicLocation_AREA == ePos ||\n GraphicLocation_TILED == ePos )\n ePos = (GraphicLocation)nPos;\n }\n }\n break;\n case XML_TOK_BGIMG_FILTER:\n sFilter = rValue;\n break;\n case XML_TOK_BGIMG_OPACITY:\n {\n sal_Int32 nTmp;\n \/\/ convert from percent and clip\n if( SvXMLUnitConverter::convertPercent( nTmp, rValue ) )\n {\n if( (nTmp >= 0) && (nTmp <= 100) )\n nTransparency = static_cast( 100-nTmp );\n }\n }\n break;\n }\n }\n\n}\n\nXMLBackgroundImageContext::XMLBackgroundImageContext(\n SvXMLImport& rImport, sal_uInt16 nPrfx,\n const OUString& rLName,\n const Reference< xml::sax::XAttributeList > & xAttrList,\n const XMLPropertyState& rProp,\n sal_Int32 nPosIdx,\n sal_Int32 nFilterIdx,\n sal_Int32 nTransparencyIdx,\n ::std::vector< XMLPropertyState > &rProps ) :\n XMLElementPropertyContext( rImport, nPrfx, rLName, rProp, rProps ),\n aPosProp( nPosIdx ),\n aFilterProp( nFilterIdx ),\n aTransparencyProp( nTransparencyIdx ),\n nTransparency( 0 )\n{\n ProcessAttrs( xAttrList );\n}\n\nXMLBackgroundImageContext::~XMLBackgroundImageContext()\n{\n}\n\nSvXMLImportContext *XMLBackgroundImageContext::CreateChildContext(\n sal_uInt16 nPrefix, const OUString& rLocalName,\n const Reference< xml::sax::XAttributeList > & xAttrList )\n{\n SvXMLImportContext *pContext = NULL;\n if( (XML_NAMESPACE_OFFICE == nPrefix) &&\n xmloff::token::IsXMLToken( rLocalName,\n xmloff::token::XML_BINARY_DATA ) )\n {\n if( !sURL.getLength() && !xBase64Stream.is() )\n {\n xBase64Stream = GetImport().GetStreamForGraphicObjectURLFromBase64();\n if( xBase64Stream.is() )\n pContext = new XMLBase64ImportContext( GetImport(), nPrefix,\n rLocalName, xAttrList,\n xBase64Stream );\n }\n }\n if( !pContext )\n {\n pContext = new SvXMLImportContext( GetImport(), nPrefix, rLocalName );\n }\n\n return pContext;\n}\n\nvoid XMLBackgroundImageContext::EndElement()\n{\n if( sURL.getLength() )\n {\n sURL = GetImport().ResolveGraphicObjectURL( sURL, sal_False );\n }\n else if( xBase64Stream.is() )\n {\n sURL = GetImport().ResolveGraphicObjectURLFromBase64( xBase64Stream );\n xBase64Stream = 0;\n }\n\n if( !sURL.getLength() )\n ePos = GraphicLocation_NONE;\n else if( GraphicLocation_NONE == ePos )\n ePos = GraphicLocation_TILED;\n\n aProp.maValue <<= sURL;\n aPosProp.maValue <<= ePos;\n aFilterProp.maValue <<= sFilter;\n aTransparencyProp.maValue <<= nTransparency;\n\n SetInsert( sal_True );\n XMLElementPropertyContext::EndElement();\n\n if( -1 != aPosProp.mnIndex )\n rProperties.push_back( aPosProp );\n if( -1 != aFilterProp.mnIndex )\n rProperties.push_back( aFilterProp );\n if( -1 != aTransparencyProp.mnIndex )\n rProperties.push_back( aTransparencyProp );\n}\nINTEGRATION: CWS warnings01 (1.11.32); FILE MERGED 2006\/05\/23 19:16:52 sb 1.11.32.2: RESYNC: (1.11-1.12); FILE MERGED 2005\/11\/03 17:47:02 cl 1.11.32.1: warning free code changes for unxlngi6\/*************************************************************************\n *\n * OpenOffice.org - a multi-platform office productivity suite\n *\n * $RCSfile: XMLBackgroundImageContext.cxx,v $\n *\n * $Revision: 1.13 $\n *\n * last change: $Author: hr $ $Date: 2006-06-19 18:28:12 $\n *\n * The Contents of this file are made available subject to\n * the terms of GNU Lesser General Public License Version 2.1.\n *\n *\n * GNU Lesser General Public License Version 2.1\n * =============================================\n * Copyright 2005 by Sun Microsystems, Inc.\n * 901 San Antonio Road, Palo Alto, CA 94303, USA\n *\n * This library is free software; you can redistribute it and\/or\n * modify it under the terms of the GNU Lesser General Public\n * License version 2.1, as published by the Free Software Foundation.\n *\n * This library is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU\n * Lesser General Public License for more details.\n *\n * You should have received a copy of the GNU Lesser General Public\n * License along with this library; if not, write to the Free Software\n * Foundation, Inc., 59 Temple Place, Suite 330, Boston,\n * MA 02111-1307 USA\n *\n ************************************************************************\/\n\n#ifndef _TOOLS_DEBUG_HXX\n#include \n#endif\n\n#ifndef _COM_SUN_STAR_IO_XOUTPUTSTREAM_HPP_\n#include \n#endif\n\n#ifndef _XMLOFF_XMLTKMAP_HXX\n#include \"xmltkmap.hxx\"\n#endif\n#ifndef _XMLOFF_XMLUCONV_HXX\n#include \"xmluconv.hxx\"\n#endif\n#ifndef _XMLOFF_XMLNMSPE_HXX\n#include \"xmlnmspe.hxx\"\n#endif\n#ifndef _XMLOFF_XMLTOKEN_HXX\n#include \"xmltoken.hxx\"\n#endif\n#ifndef _XMLOFF_XMLIMP_HXX\n#include \"xmlimp.hxx\"\n#endif\n#ifndef _XMLOFF_NMSPMAP_HXX\n#include \"nmspmap.hxx\"\n#endif\n#ifndef _XMLOFF_XMLBASE64IMPORTCONTEXT_HXX\n#include \"XMLBase64ImportContext.hxx\"\n#endif\n\n#ifndef _XMLBACKGROUNDIMAGECONTEXT_HXX\n#include \"XMLBackgroundImageContext.hxx\"\n#endif\n\nusing namespace ::rtl;\nusing namespace ::com::sun::star;\nusing namespace ::com::sun::star::uno;\nusing namespace ::com::sun::star::style;\nusing namespace ::com::sun::star::io;\nusing namespace ::xmloff::token;\n\nenum SvXMLTokenMapAttrs\n{\n XML_TOK_BGIMG_HREF,\n XML_TOK_BGIMG_TYPE,\n XML_TOK_BGIMG_ACTUATE,\n XML_TOK_BGIMG_SHOW,\n XML_TOK_BGIMG_POSITION,\n XML_TOK_BGIMG_REPEAT,\n XML_TOK_BGIMG_FILTER,\n XML_TOK_BGIMG_OPACITY,\n XML_TOK_NGIMG_END=XML_TOK_UNKNOWN\n};\n\nstatic __FAR_DATA SvXMLTokenMapEntry aBGImgAttributesAttrTokenMap[] =\n{\n { XML_NAMESPACE_XLINK, XML_HREF, XML_TOK_BGIMG_HREF },\n { XML_NAMESPACE_XLINK, XML_TYPE, XML_TOK_BGIMG_TYPE },\n { XML_NAMESPACE_XLINK, XML_ACTUATE, XML_TOK_BGIMG_ACTUATE },\n { XML_NAMESPACE_XLINK, XML_SHOW, XML_TOK_BGIMG_SHOW },\n { XML_NAMESPACE_STYLE, XML_POSITION, XML_TOK_BGIMG_POSITION },\n { XML_NAMESPACE_STYLE, XML_REPEAT, XML_TOK_BGIMG_REPEAT },\n { XML_NAMESPACE_STYLE, XML_FILTER_NAME, XML_TOK_BGIMG_FILTER },\n { XML_NAMESPACE_DRAW, XML_OPACITY, XML_TOK_BGIMG_OPACITY },\n XML_TOKEN_MAP_END\n};\n\nSvXMLEnumMapEntry psXML_BrushRepeat[] =\n{\n { XML_BACKGROUND_REPEAT, GraphicLocation_TILED },\n { XML_BACKGROUND_NO_REPEAT, GraphicLocation_MIDDLE_MIDDLE },\n { XML_BACKGROUND_STRETCH, GraphicLocation_AREA },\n { XML_TOKEN_INVALID, 0 }\n};\n\nSvXMLEnumMapEntry psXML_BrushHoriPos[] =\n{\n { XML_LEFT, GraphicLocation_LEFT_MIDDLE },\n { XML_RIGHT, GraphicLocation_RIGHT_MIDDLE },\n { XML_TOKEN_INVALID, 0 }\n};\n\nSvXMLEnumMapEntry psXML_BrushVertPos[] =\n{\n { XML_TOP, GraphicLocation_MIDDLE_TOP },\n { XML_BOTTOM, GraphicLocation_MIDDLE_BOTTOM },\n { XML_TOKEN_INVALID, 0 }\n};\n\nvoid lcl_xmlbic_MergeHoriPos( GraphicLocation& ePos,\n GraphicLocation eHori )\n{\n DBG_ASSERT( GraphicLocation_LEFT_MIDDLE==eHori ||\n GraphicLocation_MIDDLE_MIDDLE==eHori ||\n GraphicLocation_RIGHT_MIDDLE==eHori,\n \"lcl_xmlbic_MergeHoriPos: vertical pos must be middle\" );\n\n switch( ePos )\n {\n case GraphicLocation_LEFT_TOP:\n case GraphicLocation_MIDDLE_TOP:\n case GraphicLocation_RIGHT_TOP:\n ePos = GraphicLocation_LEFT_MIDDLE==eHori\n ? GraphicLocation_LEFT_TOP\n : (GraphicLocation_MIDDLE_MIDDLE==eHori\n ? GraphicLocation_MIDDLE_TOP\n : GraphicLocation_RIGHT_TOP);\n break;\n\n case GraphicLocation_LEFT_MIDDLE:\n case GraphicLocation_MIDDLE_MIDDLE:\n case GraphicLocation_RIGHT_MIDDLE:\n ePos = eHori;\n break;\n\n case GraphicLocation_LEFT_BOTTOM:\n case GraphicLocation_MIDDLE_BOTTOM:\n case GraphicLocation_RIGHT_BOTTOM:\n ePos = GraphicLocation_LEFT_MIDDLE==eHori\n ? GraphicLocation_LEFT_BOTTOM\n : (GraphicLocation_MIDDLE_MIDDLE==eHori\n ? GraphicLocation_MIDDLE_BOTTOM\n : GraphicLocation_RIGHT_BOTTOM);\n break;\n default:\n break;\n }\n}\n\nvoid lcl_xmlbic_MergeVertPos( GraphicLocation& ePos,\n GraphicLocation eVert )\n{\n DBG_ASSERT( GraphicLocation_MIDDLE_TOP==eVert ||\n GraphicLocation_MIDDLE_MIDDLE==eVert ||\n GraphicLocation_MIDDLE_BOTTOM==eVert,\n \"lcl_xmlbic_MergeVertPos: horizontal pos must be middle\" );\n\n switch( ePos )\n {\n case GraphicLocation_LEFT_TOP:\n case GraphicLocation_LEFT_MIDDLE:\n case GraphicLocation_LEFT_BOTTOM:\n ePos = GraphicLocation_MIDDLE_TOP==eVert\n ? GraphicLocation_LEFT_TOP\n : (GraphicLocation_MIDDLE_MIDDLE==eVert\n ? GraphicLocation_LEFT_MIDDLE\n : GraphicLocation_LEFT_BOTTOM);\n ePos = eVert;\n break;\n\n case GraphicLocation_MIDDLE_TOP:\n case GraphicLocation_MIDDLE_MIDDLE:\n case GraphicLocation_MIDDLE_BOTTOM:\n ePos = eVert;\n break;\n\n case GraphicLocation_RIGHT_TOP:\n case GraphicLocation_RIGHT_MIDDLE:\n case GraphicLocation_RIGHT_BOTTOM:\n ePos = GraphicLocation_MIDDLE_TOP==eVert\n ? GraphicLocation_RIGHT_TOP\n : (GraphicLocation_MIDDLE_MIDDLE==eVert\n ? GraphicLocation_RIGHT_MIDDLE\n : GraphicLocation_RIGHT_BOTTOM);\n break;\n default:\n break;\n }\n}\n\nTYPEINIT1( XMLBackgroundImageContext, XMLElementPropertyContext );\n\nvoid XMLBackgroundImageContext::ProcessAttrs(\n const Reference< xml::sax::XAttributeList >& xAttrList )\n{\n SvXMLTokenMap aTokenMap( aBGImgAttributesAttrTokenMap );\n\n ePos = GraphicLocation_NONE;\n\n SvXMLUnitConverter& rUnitConverter = GetImport().GetMM100UnitConverter();\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 OUString aLocalName;\n sal_uInt16 nPrefix =\n GetImport().GetNamespaceMap().GetKeyByAttrName( rAttrName,\n &aLocalName );\n const OUString& rValue = xAttrList->getValueByIndex( i );\n\n switch( aTokenMap.Get( nPrefix, aLocalName ) )\n {\n case XML_TOK_BGIMG_HREF:\n sURL = rValue;\n if( GraphicLocation_NONE == ePos )\n ePos = GraphicLocation_TILED;\n break;\n case XML_TOK_BGIMG_TYPE:\n case XML_TOK_BGIMG_ACTUATE:\n case XML_TOK_BGIMG_SHOW:\n break;\n case XML_TOK_BGIMG_POSITION:\n {\n GraphicLocation eNewPos = GraphicLocation_NONE, eTmp;\n sal_uInt16 nTmp;\n SvXMLTokenEnumerator aTokenEnum( rValue );\n OUString aToken;\n sal_Bool bHori = sal_False, bVert = sal_False;\n sal_Bool bOK = sal_True;\n while( bOK && aTokenEnum.getNextToken( aToken ) )\n {\n if( bHori && bVert )\n {\n bOK = sal_False;\n }\n else if( -1 != aToken.indexOf( sal_Unicode('%') ) )\n {\n sal_Int32 nPrc = 50;\n if( rUnitConverter.convertPercent( nPrc, aToken ) )\n {\n if( !bHori )\n {\n eNewPos = nPrc < 25\n ? GraphicLocation_LEFT_TOP\n : (nPrc < 75 ? GraphicLocation_MIDDLE_MIDDLE\n : GraphicLocation_RIGHT_BOTTOM);\n bHori = sal_True;\n }\n else\n {\n eTmp = nPrc < 25\n ? GraphicLocation_LEFT_TOP\n : (nPrc < 75 ? GraphicLocation_LEFT_MIDDLE\n : GraphicLocation_LEFT_BOTTOM);\n lcl_xmlbic_MergeVertPos( eNewPos, eTmp );\n bVert = sal_True;\n }\n }\n else\n {\n \/\/ wrong percentage\n bOK = sal_False;\n }\n }\n else if( IsXMLToken( aToken, XML_CENTER ) )\n {\n if( bHori )\n lcl_xmlbic_MergeVertPos( eNewPos,\n GraphicLocation_MIDDLE_MIDDLE );\n else if ( bVert )\n lcl_xmlbic_MergeHoriPos( eNewPos,\n GraphicLocation_MIDDLE_MIDDLE );\n else\n eNewPos = GraphicLocation_MIDDLE_MIDDLE;\n }\n else if( rUnitConverter.convertEnum( nTmp, aToken,\n psXML_BrushHoriPos ) )\n {\n if( bVert )\n lcl_xmlbic_MergeHoriPos( eNewPos,\n (GraphicLocation)nTmp );\n else if( !bHori )\n eNewPos = (GraphicLocation)nTmp;\n else\n bOK = sal_False;\n bHori = sal_True;\n }\n else if( rUnitConverter.convertEnum( nTmp, aToken,\n psXML_BrushVertPos ) )\n {\n if( bHori )\n lcl_xmlbic_MergeVertPos( eNewPos,\n (GraphicLocation)nTmp );\n else if( !bVert )\n eNewPos = (GraphicLocation)nTmp;\n else\n bOK = sal_False;\n bVert = sal_True;\n }\n else\n {\n bOK = sal_False;\n }\n }\n\n bOK &= GraphicLocation_NONE != eNewPos;\n if( bOK )\n ePos = eNewPos;\n }\n break;\n case XML_TOK_BGIMG_REPEAT:\n {\n sal_uInt16 nPos = GraphicLocation_NONE;\n if( rUnitConverter.convertEnum( nPos, rValue,\n psXML_BrushRepeat ) )\n {\n if( GraphicLocation_MIDDLE_MIDDLE != nPos ||\n GraphicLocation_NONE == ePos ||\n GraphicLocation_AREA == ePos ||\n GraphicLocation_TILED == ePos )\n ePos = (GraphicLocation)nPos;\n }\n }\n break;\n case XML_TOK_BGIMG_FILTER:\n sFilter = rValue;\n break;\n case XML_TOK_BGIMG_OPACITY:\n {\n sal_Int32 nTmp;\n \/\/ convert from percent and clip\n if( SvXMLUnitConverter::convertPercent( nTmp, rValue ) )\n {\n if( (nTmp >= 0) && (nTmp <= 100) )\n nTransparency = static_cast( 100-nTmp );\n }\n }\n break;\n }\n }\n\n}\n\nXMLBackgroundImageContext::XMLBackgroundImageContext(\n SvXMLImport& rImport, sal_uInt16 nPrfx,\n const OUString& rLName,\n const Reference< xml::sax::XAttributeList > & xAttrList,\n const XMLPropertyState& rProp,\n sal_Int32 nPosIdx,\n sal_Int32 nFilterIdx,\n sal_Int32 nTransparencyIdx,\n ::std::vector< XMLPropertyState > &rProps ) :\n XMLElementPropertyContext( rImport, nPrfx, rLName, rProp, rProps ),\n aPosProp( nPosIdx ),\n aFilterProp( nFilterIdx ),\n aTransparencyProp( nTransparencyIdx ),\n nTransparency( 0 )\n{\n ProcessAttrs( xAttrList );\n}\n\nXMLBackgroundImageContext::~XMLBackgroundImageContext()\n{\n}\n\nSvXMLImportContext *XMLBackgroundImageContext::CreateChildContext(\n sal_uInt16 nPrefix, const OUString& rLocalName,\n const Reference< xml::sax::XAttributeList > & xAttrList )\n{\n SvXMLImportContext *pContext = NULL;\n if( (XML_NAMESPACE_OFFICE == nPrefix) &&\n xmloff::token::IsXMLToken( rLocalName,\n xmloff::token::XML_BINARY_DATA ) )\n {\n if( !sURL.getLength() && !xBase64Stream.is() )\n {\n xBase64Stream = GetImport().GetStreamForGraphicObjectURLFromBase64();\n if( xBase64Stream.is() )\n pContext = new XMLBase64ImportContext( GetImport(), nPrefix,\n rLocalName, xAttrList,\n xBase64Stream );\n }\n }\n if( !pContext )\n {\n pContext = new SvXMLImportContext( GetImport(), nPrefix, rLocalName );\n }\n\n return pContext;\n}\n\nvoid XMLBackgroundImageContext::EndElement()\n{\n if( sURL.getLength() )\n {\n sURL = GetImport().ResolveGraphicObjectURL( sURL, sal_False );\n }\n else if( xBase64Stream.is() )\n {\n sURL = GetImport().ResolveGraphicObjectURLFromBase64( xBase64Stream );\n xBase64Stream = 0;\n }\n\n if( !sURL.getLength() )\n ePos = GraphicLocation_NONE;\n else if( GraphicLocation_NONE == ePos )\n ePos = GraphicLocation_TILED;\n\n aProp.maValue <<= sURL;\n aPosProp.maValue <<= ePos;\n aFilterProp.maValue <<= sFilter;\n aTransparencyProp.maValue <<= nTransparency;\n\n SetInsert( sal_True );\n XMLElementPropertyContext::EndElement();\n\n if( -1 != aPosProp.mnIndex )\n rProperties.push_back( aPosProp );\n if( -1 != aFilterProp.mnIndex )\n rProperties.push_back( aFilterProp );\n if( -1 != aTransparencyProp.mnIndex )\n rProperties.push_back( aTransparencyProp );\n}\n<|endoftext|>"} {"text":"#include \n#include \n#include \n#include \n#include \"config.h\" \/\/ autogenerated from config.h.in\n\nint main(int argc, char** argv) {\n using namespace duke;\n try {\n const CmdLineParameters parameters(argc, argv);\n switch (parameters.mode) {\n case ApplicationMode::VERSION: {\n const char* pCompilationMode = DUKE_RELEASE ? \"\" : \"debug\";\n printf(\"Duke %s #%s %s\\n\", \/\/\n DUKE_VERSION, \/\/\n DUKE_GIT_SHA1, \/\/\n pCompilationMode); \/\/ autogenerated from config.h.in\n break;\n }\n case ApplicationMode::LIST_SUPPORTED_FORMAT: {\n printf(\"Supported plugins :\\n\");\n for (const auto &pDescriptor : IODescriptors::instance().getDescriptors()) {\n printf(\" * %s : \", pDescriptor->getName());\n for (const auto &extension : pDescriptor->getSupportedExtensions())\n printf(\"%s \", extension.c_str());\n printf(\"\\n\");\n }\n break;\n }\n case ApplicationMode::HELP:\n parameters.printHelpMessage();\n break;\n case ApplicationMode::BENCHMARK:\n benchmark();\n break;\n case ApplicationMode::DUKE:\n DukeApplication duke(parameters);\n duke.run();\n break;\n }\n } catch (duke::commandline_error &e) {\n fprintf(stderr, \"Command line says : %s\\n\", e.what());\n return EXIT_FAILURE;\n } catch (std::exception &e) {\n fprintf(stderr, \"Unexpected error\\n%s\\n\", e.what());\n return EXIT_FAILURE;\n }\n return EXIT_SUCCESS;\n}\nFormatting main#include \n#include \n#include \n#include \n#include \"config.h\" \/\/ autogenerated from config.h.in\n\nint main(int argc, char **argv) {\n using namespace duke;\n try {\n const CmdLineParameters parameters(argc, argv);\n switch (parameters.mode) {\n case ApplicationMode::VERSION: {\n const char *pCompilationMode = DUKE_RELEASE ? \"\" : \"debug\";\n printf(\"Duke %s #%s %s\\n\", \/\/\n DUKE_VERSION, \/\/\n DUKE_GIT_SHA1, \/\/\n pCompilationMode); \/\/ autogenerated from config.h.in\n break;\n }\n case ApplicationMode::LIST_SUPPORTED_FORMAT: {\n printf(\"Supported plugins :\\n\");\n for (const auto &pDescriptor : IODescriptors::instance().getDescriptors()) {\n printf(\" * %s : \", pDescriptor->getName());\n for (const auto &extension : pDescriptor->getSupportedExtensions()) printf(\"%s \", extension.c_str());\n printf(\"\\n\");\n }\n break;\n }\n case ApplicationMode::HELP:\n parameters.printHelpMessage();\n break;\n case ApplicationMode::BENCHMARK:\n benchmark();\n break;\n case ApplicationMode::DUKE:\n DukeApplication duke(parameters);\n duke.run();\n break;\n }\n }\n catch (duke::commandline_error &e) {\n fprintf(stderr, \"Command line says : %s\\n\", e.what());\n return EXIT_FAILURE;\n }\n catch (std::exception &e) {\n fprintf(stderr, \"Unexpected error\\n%s\\n\", e.what());\n return EXIT_FAILURE;\n }\n return EXIT_SUCCESS;\n}\n<|endoftext|>"} {"text":"#include \n#include \n#include \n#include \n\nvoid testRegexp()\n{\n QString s = \"v=0\/t=1\/title = hello world\/Message=How are you?\/Foo3=bar4\";\n QRegularExpression re(\"(?[A-Za-z][A-Za-z0-9_]*)\\\\s*=\\\\s*(?[^\/]+)\");\n QRegularExpressionMatchIterator i = re.globalMatch(s);\n while (i.hasNext()) {\n QRegularExpressionMatch match = i.next();\n QString key = match.captured(\"key\");\n QString val = match.captured(\"val\");\n qDebug() << \"match: \" << key << \"=\" << val;\n }\n}\n\n\/*\nRF,Kpa,230,C,30,OK*4F\nRR,Kpa,230,C,30,OK*4F\nLR,Kpa,230,C,30,OK*4F\nLF,Kpa,230,C,30,OK*4F\n*\/\nvoid test2()\n{\n QRegularExpression re(\"(?[LR][RF]),\"\n \"(?(Kpa|Psi|Bar)),\"\n \"(?\\\\d+\\\\.?\\\\d*),\"\n \"(?(C|F)),\"\n \"(?\\\\d+),\"\n \"(?(OK|LOW))\");\n QString s = \"RF,Kpa,230,C,30,OK*4F\";\n QRegularExpressionMatch match = re.match(s);\n if (match.hasMatch()) {\n QString pos = match.captured(\"pos\");\n QString punit = match.captured(\"punit\");\n QString press = match.captured(\"press\");\n QString tunit = match.captured(\"tunit\");\n QString temp = match.captured(\"temp\");\n QString batt = match.captured(\"batt\");\n qDebug() << pos << punit << press << tunit << temp << batt;\n }\n}\n\nvoid test3()\n{\n char s[] =\n\"system: CIS002-0.01.001.201609082206\\x0a\"\n\"uboot: 40\\x0a\"\n\"mcu:201608030004\\x0a\"\n\"lcd:201609130008\\x0a\"\n\"board id:2\\x0a\";\n\n QRegularExpression re(\"(?system: [A-Za-z0-9.-]+)\");\n QRegularExpressionMatch match = re.match(s);\n if (match.hasMatch()) {\n QString pos = match.captured(\"sys\");\n qDebug() << pos;\n }\n}\n\nQString translate_utf16be_to_qstring(const unsigned char utf16be[32])\n{\n const int MAXLEN = 32;\n QString str = \"\";\n for (int i = 0; i < MAXLEN\/2; i+=2) {\n \/\/printf(\"i: %02x %02x\\n\", utf16be[i], utf16be[i+1]);\n ushort uc = (utf16be[i] << 8) | utf16be[i+1];\n if (uc == 0) {\n break;\n }\n \/\/printf(\"uc: %04x\\n\", uc);\n QChar cc = QChar(uc);\n \/\/qDebug() << cc;\n str = str + QString(cc);\n }\n\n\t\/\/qDebug() << \"str:\" << str;\n return str;\n}\n\n\/\/\/ https:\/\/en.wikipedia.org\/wiki\/Percent-encoding\nvoid test4()\n{\n QString s = \"I%60m Lengend%21\";\n QRegularExpression re(\"(%([A-Fa-f0-9][A-Fa-f0-9]))\");\n QRegularExpressionMatchIterator i = re.globalMatch(s);\n while (i.hasNext()) {\n QRegularExpressionMatch match = i.next();\n QString all = match.captured(1);\n QString key = match.captured(2);\n bool ok;\n int _hex = key.toInt(&ok, 16);\n if (ok) {\n char value = (char)_hex;\n QString after = QString(value);\n qDebug() << \"all:\" << all << \"key:\" << key << \":\" << after;\n s.replace(all, after);\n qDebug() << \"s:\" << s;\n }\n }\n}\n\nint main(int argc, char *argv[])\n{\n\tQ_UNUSED(argc);\n\tQ_UNUSED(argv);\n\/\/ QCoreApplication a(argc, argv);\n\n \/\/testRegexp();\n \/\/test2();\n \/\/test3();\n \/\/test4();\n\n unsigned char utf16be[32] = {0x4e, 0x00, 0x58, 0x34, 0x90, 0x4a, 0x62, 0x32};\n qDebug() << translate_utf16be_to_qstring(utf16be);\n\n \/\/return a.exec();\n return 0;\n}\nadd localre function tester#include \n#include \n#include \n#include \n\nvoid testRegexp()\n{\n QString s = \"v=0\/t=1\/title = hello world\/Message=How are you?\/Foo3=bar4\";\n QRegularExpression re(\"(?[A-Za-z][A-Za-z0-9_]*)\\\\s*=\\\\s*(?[^\/]+)\");\n QRegularExpressionMatchIterator i = re.globalMatch(s);\n while (i.hasNext()) {\n QRegularExpressionMatch match = i.next();\n QString key = match.captured(\"key\");\n QString val = match.captured(\"val\");\n qDebug() << \"match: \" << key << \"=\" << val;\n }\n}\n\n\/*\nRF,Kpa,230,C,30,OK*4F\nRR,Kpa,230,C,30,OK*4F\nLR,Kpa,230,C,30,OK*4F\nLF,Kpa,230,C,30,OK*4F\n*\/\nvoid test2()\n{\n QRegularExpression re(\"(?[LR][RF]),\"\n \"(?(Kpa|Psi|Bar)),\"\n \"(?\\\\d+\\\\.?\\\\d*),\"\n \"(?(C|F)),\"\n \"(?\\\\d+),\"\n \"(?(OK|LOW))\");\n QString s = \"RF,Kpa,230,C,30,OK*4F\";\n QRegularExpressionMatch match = re.match(s);\n if (match.hasMatch()) {\n QString pos = match.captured(\"pos\");\n QString punit = match.captured(\"punit\");\n QString press = match.captured(\"press\");\n QString tunit = match.captured(\"tunit\");\n QString temp = match.captured(\"temp\");\n QString batt = match.captured(\"batt\");\n qDebug() << pos << punit << press << tunit << temp << batt;\n }\n}\n\n\nvoid localre(const QString& re, const QString& str)\n{\n QRegularExpression regexp(re);\n QRegularExpressionMatch match = regexp.match(str);\n if (match.hasMatch()) {\n qDebug() << Q_FUNC_INFO << match.captured(1);\n } else {\n qDebug() << Q_FUNC_INFO << \"no matched\";\n }\n}\n\nvoid test3()\n{\n char s[] =\n\"system: CIS002-0.01.001.201609082206\\x0a\"\n\"uboot: 40\\x0a\"\n\"mcu:201608030004\\x0a\"\n\"lcd:201609130008\\x0a\"\n\"board id:2\\x0a\";\n\n localre(\"system: ([A-Za-z0-9.-]+)\", s);\n localre(\"uboot: ([A-Za-z0-9.-]+)\", s);\n localre(\"mcu:([A-Za-z0-9.-]+)\", s);\n localre(\"lcd:([A-Za-z0-9.-]+)\", s);\n localre(\"board id:([A-Za-z0-9.-]+)\", s);\n \/\/ QString _sysinfo;\n \/\/ QRegularExpression re(\"system: (?[A-Za-z0-9.-]+)\");\n \/\/ QRegularExpressionMatch match = re.match(s);\n \/\/ if (match.hasMatch()) {\n \/\/ _sysinfo = match.captured(\"sys\");\n \/\/ qDebug() << Q_FUNC_INFO << _sysinfo;\n \/\/ } else {\n \/\/ qDebug() << Q_FUNC_INFO << \"no matched\";\n \/\/ }\n\n \/\/ QRegularExpression re2(\"uboot: ([A-Za-z0-9.-]+)\");\n \/\/ QRegularExpressionMatch match = re2.match(s);\n \/\/ if (match.hasMatch()) {\n \/\/ qDebug() << match.captured(1);\n \/\/ }\n\n}\n\nQString translate_utf16be_to_qstring(const unsigned char utf16be[32])\n{\n const int MAXLEN = 32;\n QString str = \"\";\n for (int i = 0; i < MAXLEN\/2; i+=2) {\n \/\/printf(\"i: %02x %02x\\n\", utf16be[i], utf16be[i+1]);\n ushort uc = (utf16be[i] << 8) | utf16be[i+1];\n if (uc == 0) {\n break;\n }\n \/\/printf(\"uc: %04x\\n\", uc);\n QChar cc = QChar(uc);\n \/\/qDebug() << cc;\n str = str + QString(cc);\n }\n\n\t\/\/qDebug() << \"str:\" << str;\n return str;\n}\n\n\/\/\/ https:\/\/en.wikipedia.org\/wiki\/Percent-encoding\nvoid test4()\n{\n QString s = \"I%60m Lengend%21\";\n QRegularExpression re(\"(%([A-Fa-f0-9][A-Fa-f0-9]))\");\n QRegularExpressionMatchIterator i = re.globalMatch(s);\n while (i.hasNext()) {\n QRegularExpressionMatch match = i.next();\n QString all = match.captured(1);\n QString key = match.captured(2);\n bool ok;\n int _hex = key.toInt(&ok, 16);\n if (ok) {\n char value = (char)_hex;\n QString after = QString(value);\n qDebug() << \"all:\" << all << \"key:\" << key << \":\" << after;\n s.replace(all, after);\n qDebug() << \"s:\" << s;\n }\n }\n}\n\nint main(int argc, char *argv[])\n{\n\tQ_UNUSED(argc);\n\tQ_UNUSED(argv);\n\/\/ QCoreApplication a(argc, argv);\n\n \/\/testRegexp();\n \/\/test2();\n test3();\n \/\/test4();\n\n \/\/ unsigned char utf16be[32] = {0x4e, 0x00, 0x58, 0x34, 0x90, 0x4a, 0x62, 0x32};\n \/\/ qDebug() << translate_utf16be_to_qstring(utf16be);\n\n \/\/return a.exec();\n return 0;\n}\n<|endoftext|>"} {"text":"\/**\n * \\file sync_solution_stream.cc\n *\n *\n *\n * \\author eaburns\n * \\date 2009-04-14\n *\/\n\n#include \n\nusing namespace std;\n\n#include \n\n#include \n\n#include \"..\/state.h\"\n#include \"sync_solution_stream.h\"\n#include \"solution_stream.h\"\n#include \"timer.h\"\n\nSyncSolutionStream::SyncSolutionStream(Timer *t, double g)\n\t: SerialSolutionStream(t, g)\n{\n}\n\nvoid SyncSolutionStream::see_solution(vector *path,\n\t\t\t\t\t unsigned int gen,\n\t\t\t\t\t unsigned int exp)\n{\n\tpthread_mutex_lock(&mutex);\n\tSerialSolutionStream::see_solution(path, gen, exp);\n\tpthread_mutex_unlock(&mutex);\n}\n\nvector *SyncSolutionStream::get_best_path(void)\n{\n\tvector *p;\n\tpthread_mutex_lock(&mutex);\n\tp = SerialSolutionStream::get_best_path();\n\tpthread_mutex_unlock(&mutex);\n\treturn p;\n}\nInitialize the mutex\/**\n * \\file sync_solution_stream.cc\n *\n *\n *\n * \\author eaburns\n * \\date 2009-04-14\n *\/\n\n#include \n\nusing namespace std;\n\n#include \n\n#include \n\n#include \"..\/state.h\"\n#include \"sync_solution_stream.h\"\n#include \"solution_stream.h\"\n#include \"timer.h\"\n\nSyncSolutionStream::SyncSolutionStream(Timer *t, double g)\n\t: SerialSolutionStream(t, g)\n{\n\tpthread_mutex_init(&mutex, NULL);\n}\n\nvoid SyncSolutionStream::see_solution(vector *path,\n\t\t\t\t\t unsigned int gen,\n\t\t\t\t\t unsigned int exp)\n{\n\tpthread_mutex_lock(&mutex);\n\tSerialSolutionStream::see_solution(path, gen, exp);\n\tpthread_mutex_unlock(&mutex);\n}\n\nvector *SyncSolutionStream::get_best_path(void)\n{\n\tvector *p;\n\tpthread_mutex_lock(&mutex);\n\tp = SerialSolutionStream::get_best_path();\n\tpthread_mutex_unlock(&mutex);\n\treturn p;\n}\n<|endoftext|>"} {"text":"#include \r\n\r\nclass Device\r\n{\r\npublic:\r\n int static GetTimestamp()\r\n {\r\n return std::time(0);\r\n }\r\n\r\n void static OpenUrl(const String url)\r\n {\r\n String cmd(\"open \");\r\n cmd += url;\r\n system(cmd.ToCString());\r\n }\r\n\r\n String static GetLanguage()\r\n {\r\n return \"en\";\r\n }\r\n};\r\nImplement Device.ShowAlertNative for OSX#include \n\nclass AlertDelegate : public Object\n{\npublic:\n virtual void Call(int buttonIndex, String buttonTitle) = 0;\n};\n\n#if __APPLE__\n#include \n#endif\n\nclass Device\n{\npublic:\n int static GetTimestamp()\n {\n return std::time(0);\n }\n\n void static OpenUrl(const String url)\n {\n String cmd(\"open \");\n cmd += url;\n system(cmd.ToCString());\n }\n\n String static GetLanguage()\n {\n return \"en\";\n }\n\n#if __APPLE__\n void static ShowAlertNative(String title, String message, Array buttons, AlertDelegate* delegate)\n {\n CFOptionFlags cfRes;\n CFUserNotificationDisplayAlert(0, kCFUserNotificationNoteAlertLevel,\n NULL, NULL, NULL,\n CFStringCreateWithCString(NULL, title.ToCString(), kCFStringEncodingASCII),\n CFStringCreateWithCString(NULL, message.ToCString(), kCFStringEncodingASCII),\n CFStringCreateWithCString(NULL, buttons.At(0).ToCString(), kCFStringEncodingASCII),\n CFStringCreateWithCString(NULL, buttons.At(1).ToCString(), kCFStringEncodingASCII),\n CFStringCreateWithCString(NULL, buttons.At(2).ToCString(), kCFStringEncodingASCII),\n &cfRes);\n\n switch (cfRes)\n {\n case kCFUserNotificationDefaultResponse:\n delegate->Call(0, buttons.At(0));\n break;\n case kCFUserNotificationAlternateResponse:\n delegate->Call(1, buttons.At(1));\n break;\n case kCFUserNotificationOtherResponse:\n delegate->Call(2, buttons.At(2));\n break;\n default:\n break;\n }\n }\n#endif\n\n};\n<|endoftext|>"} {"text":"\/*\n * Copyright (C) 2010-2011 O01eg \n *\n * This file is part of Genetic Function Programming.\n *\n * Genetic Function Programming is free software: you can redistribute it 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 * Genetic Function Programming is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the\n * GNU General Public License for more details.\n *\n * You should have received a copy of the GNU General Public License\n * along with Genetic Function Programming. If not, see .\n *\/\n\n#include \n#include \n#include \n#include \n#include \n#include \n\nint main(int argc, char **argv)\n{\n\t{\n\t\tVM::Environment env;\n\n\t\t\/\/Load types from file\n\t\tstd::ifstream f(DATA_DIR \"static_types.lsp\");\n\t\tif(f.fail())\n\t\t{\n\t\t\tTHROW(\"Cann't open types list.\");\n\t\t}\n\t\tVM::Object types_list(env);\n\t\tf >> types_list;\n\t\tstd::cout << \"Types: \" << types_list << std::endl;\n\n\t\tstd::vector defined_types;\n\t\tstd::vector > unbinded_types; \/\/ Type and number of unbinded parameters, for (TYPE:LIST @1) it is 1.\n\n\t\tVM::Object p(types_list);\n\t\twhile((! p.IsNIL()) && (p.GetType() == VM::LIST))\n\t\t{\n\t\t\tVM::Object t = p.GetHead();\n\t\t\tif(! t.IsNIL())\n\t\t\t{\n\t\t\t\t\/\/ if type is SYMBOL, then it defined type\n\t\t\t\tif(t.GetType() == VM::SYMBOL)\n\t\t\t\t{\n\t\t\t\t\tdefined_types.push_back(t);\n\t\t\t\t}\n\t\t\t\t\/\/ if type is LIST then it possible unbinded type\n\t\t\t\telse if(t.GetType() == VM::LIST)\n\t\t\t\t{\n\t\t\t\t\tsize_t unbinded_parameters = 0;\n\n\t\t\t\t\t\/\/ search on the all tree fo MACRO, check for single use it\n\t\t\t\t\tstd::stack stack;\n\t\t\t\t\tstack.push(t);\n\t\t\t\t\tsize_t num_macros = 0;\n\t\t\t\t\twhile(! stack.empty())\n\t\t\t\t\t{\n\t\t\t\t\t\tVM::WeakObject p = stack.top();\n\t\t\t\t\t\tstack.pop();\n\n\t\t\t\t\t\tif(! p.IsNIL())\n\t\t\t\t\t\t{\n\t\t\t\t\t\t\tif(p.GetType() == VM::MACRO)\n\t\t\t\t\t\t\t{\n\t\t\t\t\t\t\t\tif(p.GetValue() == unbinded_parameters)\n\t\t\t\t\t\t\t\t{\n\t\t\t\t\t\t\t\t\tTHROW(FormatString(\"Duplicate MACRO &\", unbinded_parameters, \" in \", t));\n\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\telse if(p.GetValue() > unbinded_parameters)\n\t\t\t\t\t\t\t\t{\n\t\t\t\t\t\t\t\t\tunbinded_parameters = p.GetValue();\t\n\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t++ num_macros;\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\telse if(p.GetType() == VM::LIST)\n\t\t\t\t\t\t\t{\n\t\t\t\t\t\t\t\tstack.push(p.GetHead());\n\t\t\t\t\t\t\t\tstack.push(p.GetTail());\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\tif(num_macros != unbinded_parameters)\n\t\t\t\t\t{\n\t\t\t\t\t\tTHROW(FormatString(\"Wrong MACRO in \", t));\n\t\t\t\t\t}\n\t\t\t\t\tif(num_macros > 0)\n\t\t\t\t\t{\n\t\t\t\t\t\tunbinded_types.push_back(std::make_pair(t, num_macros));\n\t\t\t\t\t}\n\t\t\t\t\telse\n\t\t\t\t\t{\n\t\t\t\t\t\tdefined_types.push_back(t);\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t\tp = p.GetTail();\n\t\t}\n\n\n\n\t\tsize_t i;\n\t\tstd::cout << \"Defined types:\" << std::endl;\n\t\tfor(i = 0; i < defined_types.size(); ++ i)\n\t\t{\n\t\t\tstd::cout << \" \" << defined_types[i] << std::endl;\n\t\t}\n\n\t\tstd::cout << \"Unbinded types:\" << std::endl;\n\t\tfor(i = 0; i < unbinded_types.size(); ++ i)\n\t\t{\n\t\t\tstd::cout << \" \" << unbinded_types[i].first << \" with \" << unbinded_types[i].second << \" params\" << std::endl;\n\t\t}\n\t}\n\treturn 0;\n}\nVM: Static types: Move searching unbindes into function.\/*\n * Copyright (C) 2010-2011 O01eg \n *\n * This file is part of Genetic Function Programming.\n *\n * Genetic Function Programming is free software: you can redistribute it 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 * Genetic Function Programming is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the\n * GNU General Public License for more details.\n *\n * You should have received a copy of the GNU General Public License\n * along with Genetic Function Programming. If not, see .\n *\/\n\n#include \n#include \n#include \n#include \n#include \n#include \n\nstd::pair get_unbindes(const VM::Object& obj)\n{\n\tstd::pair res = std::make_pair(obj, 0);\n\tif(! obj.IsNIL())\n\t{\n\t\t\/\/ if type is MACRO, then it self undinded\n\t\tif(obj.GetType() == VM::MACRO)\n\t\t{\n\t\t\tres.second = 1;\n\t\t}\n\t\t\/\/ if type is LIST then it possible unbinded type\n\t\telse if(obj.GetType() == VM::LIST)\n\t\t{\n\t\t\tsize_t unbinded_parameters = 0;\n\n\t\t\t\/\/ search on the all tree for MACRO, check for single use it\n\t\t\tstd::stack stack;\n\t\t\tstack.push(obj);\n\t\t\tsize_t num_macros = 0;\n\t\t\twhile(! stack.empty())\n\t\t\t{\n\t\t\t\tVM::WeakObject p = stack.top();\n\t\t\t\tstack.pop();\n\n\t\t\t\tif(! p.IsNIL())\n\t\t\t\t{\n\t\t\t\t\tif(p.GetType() == VM::MACRO)\n\t\t\t\t\t{\n\t\t\t\t\t\tif(p.GetValue() == unbinded_parameters)\n\t\t\t\t\t\t{\n\t\t\t\t\t\t\tTHROW(FormatString(\"Duplicate MACRO &\", unbinded_parameters, \" in \", obj));\n\t\t\t\t\t\t}\n\t\t\t\t\t\telse if(p.GetValue() > unbinded_parameters)\n\t\t\t\t\t\t{\n\t\t\t\t\t\t\tunbinded_parameters = p.GetValue();\t\n\t\t\t\t\t\t}\n\t\t\t\t\t\t++ num_macros;\n\t\t\t\t\t}\n\t\t\t\t\telse if(p.GetType() == VM::LIST)\n\t\t\t\t\t{\n\t\t\t\t\t\tstack.push(p.GetHead());\n\t\t\t\t\t\tstack.push(p.GetTail());\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t\tif(num_macros != unbinded_parameters)\n\t\t\t{\n\t\t\t\tTHROW(FormatString(\"Wrong MACRO in \", obj));\n\t\t\t}\n\t\t\tres.second = num_macros;\n\t\t}\n\t}\n\treturn res;\n}\n\nint main(int argc, char **argv)\n{\n\t{\n\t\tVM::Environment env;\n\n\t\t\/\/Load types from file\n\t\tstd::ifstream f(DATA_DIR \"static_types.lsp\");\n\t\tif(f.fail())\n\t\t{\n\t\t\tTHROW(\"Cann't open types list.\");\n\t\t}\n\t\tVM::Object types_list(env);\n\t\tf >> types_list;\n\t\tstd::cout << \"Types: \" << types_list << std::endl;\n\n\t\tstd::vector defined_types;\n\t\tstd::vector > unbinded_types; \/\/ Type and number of unbinded parameters, for (TYPE:LIST @1) it is 1.\n\n\t\tVM::Object p(types_list);\n\t\twhile((! p.IsNIL()) && (p.GetType() == VM::LIST))\n\t\t{\n\t\t\tVM::Object t = p.GetHead();\n\t\t\tstd::pair unbind = get_unbindes(t);\n\t\t\tif(unbind.second > 0)\n\t\t\t{\n\t\t\t\tunbinded_types.push_back(unbind);\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\tdefined_types.push_back(t);\n\t\t\t}\n\n\t\t\tp = p.GetTail();\n\t\t}\n\n\n\n\t\tsize_t i;\n\t\tstd::cout << \"Defined types:\" << std::endl;\n\t\tfor(i = 0; i < defined_types.size(); ++ i)\n\t\t{\n\t\t\tstd::cout << \" \" << defined_types[i] << std::endl;\n\t\t}\n\n\t\tstd::cout << \"Unbinded types:\" << std::endl;\n\t\tfor(i = 0; i < unbinded_types.size(); ++ i)\n\t\t{\n\t\t\tstd::cout << \" \" << unbinded_types[i].first << \" with \" << unbinded_types[i].second << \" params\" << std::endl;\n\t\t}\n\t}\n\treturn 0;\n}\n<|endoftext|>"} {"text":"\/*\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 \"websocketpp.hpp\"\n#include \"websocket_client_session.hpp\"\n\n#include \"websocket_frame.hpp\"\n#include \"utf8_validator\/utf8_validator.hpp\"\n\n#include \n#include \n#include \n#include \n#include \n\n\n#include \n#include \n#include \n#include \n\nusing websocketpp::client_session;\n\nclient_session::client_session (client_ptr c,\n boost::asio::io_service& io_service,\n connection_handler_ptr defc)\n\t: session(io_service,defc),m_client(c) {}\n\nvoid client_session::on_connect() {\n\t\/\/ TODO: section 4.1: Figure out if we have another connection to this \n\t\/\/ host\/port pending.\n\twrite_handshake();\n}\n\nvoid client_session::set_uri(const std::string& uri) {\n\tif (!m_uri.parse(uri)) {\n\t\tthrow client_error(\"Invalid WebSocket URI\");\n\t}\n\n\tif (m_uri.secure) {\n\t\tthrow client_error(\"wss \/ secure connections are not supported at this time\");\n\t}\n\t\n\tm_resource = m_uri.resource;\n\t\n\tstd::stringstream l;\n\t\n\tl << \"parsed websocket url: secure: \" << m_uri.secure << \" host: \" << m_uri.host\n\t << \" port (final): \" << m_uri.port << \" resource \" << m_uri.resource;\n\t\n\tlog(l.str(),LOG_DEBUG);\n}\n\nbool client_session::get_secure() const {\n\treturn m_uri.secure;\n}\n\nstd::string client_session::get_host() const{\n\treturn m_uri.host;\n}\n\nuint16_t client_session::get_port() const {\n\treturn m_uri.port;\n}\n\nvoid client_session::set_header(const std::string &key,const std::string &val) {\n\t\/\/ TODO: prevent use of reserved headers\n\tm_client_headers[key] = val;\n}\n\nvoid client_session::set_origin(const std::string& val) {\n\t\/\/ TODO: input validation\n\tm_client_origin = val;\n}\n\nvoid client_session::add_subprotocol(const std::string &val) {\n\t\/\/ TODO: input validation\n\tm_client_subprotocols.push_back(val);\n}\n\nvoid client_session::add_extension(const std::string& val) {\n\t\/\/ TODO: input validation\n\tm_client_extensions.push_back(val);\n}\n\nvoid client_session::read_handshake() {\n\tboost::asio::async_read_until(\n\t\tm_socket,\n\t\tm_buf,\n\t\t\t\"\\r\\n\\r\\n\",\n\t\tboost::bind(\n\t\t\t&session::handle_read_handshake,\n\t\t\tshared_from_this(),\n\t\t\tboost::asio::placeholders::error,\n\t\t\tboost::asio::placeholders::bytes_transferred\n\t\t)\n\t);\n}\n\nvoid client_session::handle_read_handshake(const boost::system::error_code& e,\n\tstd::size_t bytes_transferred) {\n\t\/\/ parse server handshake\n\t\n\t\n\t\/\/ read handshake and set local state (or pass to write_handshake)\n\tstd::ostringstream line;\n\tline << &m_buf;\n\tm_raw_server_handshake += line.str();\n\t\n\tm_client->access_log(m_raw_server_handshake,ALOG_HANDSHAKE);\n\t\n\tstd::vector tokens;\n\tstd::string::size_type start = 0;\n\tstd::string::size_type end;\n\t\n\t\/\/ Get request and parse headers\n\tend = m_raw_server_handshake.find(\"\\r\\n\",start);\n\t\n\twhile(end != std::string::npos) {\n\t\ttokens.push_back(m_raw_server_handshake.substr(start, end - start));\n\t\t\n\t\tstart = end + 2;\n\t\t\n\t\tend = m_raw_server_handshake.find(\"\\r\\n\",start);\n\t}\n\t\n\tfor (size_t i = 0; i < tokens.size(); i++) {\n\t\tif (i == 0) {\n\t\t\tm_server_http_request = tokens[i];\n\t\t}\n\t\t\n\t\tend = tokens[i].find(\": \",0);\n\t\t\n\t\tif (end != std::string::npos) {\n\t\t\tstd::string h = tokens[i].substr(0,end);\n\t\t\tif (get_server_header(h) == \"\") {\n\t\t\t\tm_server_headers[h] = tokens[i].substr(end+2);\n\t\t\t} else {\n\t\t\t\tm_server_headers[h] += \", \" + tokens[i].substr(end+2);\n\t\t\t}\n\t\t}\n\t}\n\t\n\t\/\/ handshake error checking\n\ttry {\n\t\tstd::stringstream err;\n\t\tstd::string h;\n\t\t\n\t\t\/\/ TODO: allow versions greater than 1.1\n\t\tif (m_server_http_request.substr(0,9) != \"HTTP\/1.1 \") {\n\t\t\terr << \"Websocket handshake has invalid HTTP version: \"\n\t\t\t\t<< m_server_http_request.substr(0,9);\n\t\t\t\n\t\t\tthrow(handshake_error(err.str(),400));\n\t\t}\n\t\t\n\t\t\/\/ check the HTTP version\n\t\tif (m_server_http_request.substr(9,3) != \"101\") {\n\t\t\terr << \"Websocket handshake ended with status \"\n\t\t\t << m_server_http_request.substr(9);\n\t\t\t\n\t\t\t\/\/ TODO: check version header for other supported versions.\n\t\t\t\n\t\t\tthrow(handshake_error(err.str(),400));\n\t\t}\n\t\t\n\t\t\/\/ verify the presence of required headers\n\t\th = get_server_header(\"Upgrade\");\n\t\tif (h == \"\") {\n\t\t\tthrow(handshake_error(\"Required Upgrade header is missing\",400));\n\t\t} else if (!boost::iequals(h,\"websocket\")) {\n\t\t\terr << \"Upgrade header was \" << h << \" instead of \\\"websocket\\\"\";\n\t\t\tthrow(handshake_error(err.str(),400));\n\t\t}\n\t\t\n\t\th = get_server_header(\"Connection\");\n\t\tif (h == \"\") {\n\t\t\tthrow(handshake_error(\"Required Connection header is missing\",400));\n\t\t} else if (!boost::ifind_first(h,\"upgrade\")) {\n\t\t\terr << \"Connection header, \\\"\" << h \n\t\t\t\t<< \"\\\", does not contain required token \\\"upgrade\\\"\";\n\t\t\tthrow(handshake_error(err.str(),400));\n\t\t}\n\t\t\t\n\t\tif (get_server_header(\"Sec-WebSocket-Accept\") == \"\") {\n\t\t\tthrow(handshake_error(\"Required Sec-WebSocket-Key header is missing\",400));\n\t\t} else {\n\t\t\t\/\/ TODO: make a helper function for this.\n\t\t\tstd::string server_key = m_client_key;\n\t\t\tserver_key += \"258EAFA5-E914-47DA-95CA-C5AB0DC85B11\";\n\t\t\t\n\t\t\tSHA1\t\tsha;\n\t\t\tuint32_t\tmessage_digest[5];\n\t\t\t\n\t\t\tsha.Reset();\n\t\t\tsha << server_key.c_str();\n\t\n\t\t\tif (!sha.Result(message_digest)) {\n\t\t\t\tm_client->log(\"Error computing handshake sha1 hash.\",LOG_ERROR);\n\t\t\t\t\/\/ TODO: close behavior\n\t\t\t\treturn;\n\t\t\t}\n\t\n\t\t\t\/\/ convert sha1 hash bytes to network byte order because this sha1\n\t\t\t\/\/ library works on ints rather than bytes\n\t\t\tfor (int i = 0; i < 5; i++) {\n\t\t\t\tmessage_digest[i] = htonl(message_digest[i]);\n\t\t\t}\n\t\n\t\t\tserver_key = base64_encode(\n\t\t\t\t\treinterpret_cast(message_digest),20);\n\t\t\tif (server_key != get_server_header(\"Sec-WebSocket-Accept\")) {\n\t\t\t\tm_client->log(\"Server key does not match\",LOG_ERROR);\n\t\t\t\t\/\/ TODO: close behavior\n\t\t\t\treturn;\n\t\t\t}\n\t\t}\n\t} catch (const handshake_error& e) {\n\t\tstd::stringstream err;\n\t\terr << \"Caught handshake exception: \" << e.what();\n\t\t\n\t\tm_client->access_log(e.what(),ALOG_HANDSHAKE);\n\t\tm_client->log(err.str(),LOG_ERROR);\n\t\t\n\t\t\/\/ TODO: close behavior\n\t\treturn;\n\t}\n\t\n\tlog_open_result();\n\n\tm_status = OPEN;\n\n\tif (m_local_interface) {\n\t\tm_local_interface->on_open(shared_from_this());\n\t}\n\t\n\treset_message();\n\tread_frame();\n}\n\nvoid client_session::write_handshake() {\n\t\/\/ generate client handshake.\t\n\tstd::string client_handshake;\n\t\n\tclient_handshake += \"GET \"+m_resource+\" HTTP\/1.1\\r\\n\";\n\t\n\tset_header(\"Upgrade\",\"websocket\");\n\tset_header(\"Connection\",\"Upgrade\");\n\tset_header(\"Sec-WebSocket-Version\",\"13\");\n\t\n\tset_header(\"Host\",m_uri.host);\n\n\tif (m_client_origin != \"\") {\n\t\tset_header(\"Origin\",m_client_origin);\n\t}\n\t\n\t\/\/ TODO: generate proper key\n\tm_client_key = \"XO4pxrIMLnK1CEVQP9untQ==\";\n\t\n\tint32_t raw_key[4];\n\t\n\tboost::random::random_device rng;\n\tboost::random::variate_generator > gen(rng, boost::random::uniform_int_distribution<>(INT32_MIN,INT32_MAX));\n\t\n\tfor (int i = 0; i < 4; i++) {\n\t\traw_key[i] = gen();\n\t}\n\t\n\tm_client_key = base64_encode(reinterpret_cast(raw_key), 16);\n\t\n\tm_client->access_log(\"Client key chosen: \"+m_client_key, ALOG_HANDSHAKE);\n\t\n\tset_header(\"Sec-WebSocket-Key\",m_client_key);\n\t\n\t\n\n\tset_header(\"User Agent\",\"WebSocket++\/2011-09-25\");\n\n\theader_list::iterator it;\n\tfor (it = m_client_headers.begin(); it != m_client_headers.end(); it++) {\n\t\tclient_handshake += it->first + \": \" + it->second + \"\\r\\n\";\n\t}\n\t\n\tclient_handshake += \"\\r\\n\";\n\t\n\tm_raw_client_handshake = client_handshake;\n\n\t\/\/ start async write to handle_write_handshake\n\tboost::asio::async_write(\n\t\tm_socket,\n\t\tboost::asio::buffer(m_raw_client_handshake),\n\t\tboost::bind(\n\t\t\t&session::handle_write_handshake,\n\t\t\tshared_from_this(),\n\t\t\tboost::asio::placeholders::error\n\t\t)\n\t);\n}\n\nvoid client_session::handle_write_handshake(const boost::system::error_code& error) {\n\tif (error) {\n\t\thandle_error(\"Error writing handshake\",error);\n\t\t\/\/ TODO: close behavior\n\t\treturn;\n\t}\n\t\n\tread_handshake();\n}\n\nvoid client_session::log(const std::string& msg, uint16_t level) const {\n\tm_client->log(msg,level);\n}\n\nvoid client_session::access_log(const std::string& msg, uint16_t level) const {\n\tm_client->access_log(msg,level);\n}\nsome temporary debug printing\/*\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 \"websocketpp.hpp\"\n#include \"websocket_client_session.hpp\"\n\n#include \"websocket_frame.hpp\"\n#include \"utf8_validator\/utf8_validator.hpp\"\n\n#include \n#include \n#include \n#include \n#include \n\n\n#include \n#include \n#include \n#include \n\nusing websocketpp::client_session;\n\nclient_session::client_session (client_ptr c,\n boost::asio::io_service& io_service,\n connection_handler_ptr defc)\n\t: session(io_service,defc),m_client(c) {}\n\nvoid client_session::on_connect() {\n\t\/\/ TODO: section 4.1: Figure out if we have another connection to this \n\t\/\/ host\/port pending.\n\twrite_handshake();\n}\n\nvoid client_session::set_uri(const std::string& uri) {\n\tif (!m_uri.parse(uri)) {\n\t\tthrow client_error(\"Invalid WebSocket URI\");\n\t}\n\n\tif (m_uri.secure) {\n\t\tthrow client_error(\"wss \/ secure connections are not supported at this time\");\n\t}\n\t\n\tm_resource = m_uri.resource;\n\t\n\tstd::stringstream l;\n\t\n\tl << \"parsed websocket url: secure: \" << m_uri.secure << \" host: \" << m_uri.host\n\t << \" port (final): \" << m_uri.port << \" resource \" << m_uri.resource;\n\t\n\tlog(l.str(),LOG_DEBUG);\n}\n\nbool client_session::get_secure() const {\n\treturn m_uri.secure;\n}\n\nstd::string client_session::get_host() const{\n\treturn m_uri.host;\n}\n\nuint16_t client_session::get_port() const {\n\treturn m_uri.port;\n}\n\nvoid client_session::set_header(const std::string &key,const std::string &val) {\n\t\/\/ TODO: prevent use of reserved headers\n\tm_client_headers[key] = val;\n}\n\nvoid client_session::set_origin(const std::string& val) {\n\t\/\/ TODO: input validation\n\tm_client_origin = val;\n}\n\nvoid client_session::add_subprotocol(const std::string &val) {\n\t\/\/ TODO: input validation\n\tm_client_subprotocols.push_back(val);\n}\n\nvoid client_session::add_extension(const std::string& val) {\n\t\/\/ TODO: input validation\n\tm_client_extensions.push_back(val);\n}\n\nvoid client_session::read_handshake() {\n\tboost::asio::async_read_until(\n\t\tm_socket,\n\t\tm_buf,\n\t\t\t\"\\r\\n\\r\\n\",\n\t\tboost::bind(\n\t\t\t&session::handle_read_handshake,\n\t\t\tshared_from_this(),\n\t\t\tboost::asio::placeholders::error,\n\t\t\tboost::asio::placeholders::bytes_transferred\n\t\t)\n\t);\n}\n\nvoid client_session::handle_read_handshake(const boost::system::error_code& e,\n\tstd::size_t bytes_transferred) {\n\t\/\/ parse server handshake\n\t\n\t\n\t\/\/ read handshake and set local state (or pass to write_handshake)\n\tstd::ostringstream line;\n\tline << &m_buf;\n\tm_raw_server_handshake += line.str();\n\t\n\tm_buf << m_raw_server_handshake.substr(bytes_transferred);\n\t\n\tstd::stringstream foo;\n\t\n\tfoo << \"data size: \" << m_raw_server_handshake.size() \n\t<< \" bytes transferred\" << bytes_transferred;\n\t\n\tm_client->access_log(foo.str(), ALOG_HANDSHAKE);\n\tm_client->access_log(m_raw_server_handshake,ALOG_HANDSHAKE);\n\tm_client->access_log(\"SPACER\",ALOG_HANDSHAKE);\n\t\n\tstd::vector tokens;\n\tstd::string::size_type start = 0;\n\tstd::string::size_type end;\n\t\n\t\/\/ Get request and parse headers\n\tend = m_raw_server_handshake.find(\"\\r\\n\",start);\n\t\n\twhile(end != std::string::npos) {\n\t\ttokens.push_back(m_raw_server_handshake.substr(start, end - start));\n\t\t\n\t\tstart = end + 2;\n\t\t\n\t\tend = m_raw_server_handshake.find(\"\\r\\n\",start);\n\t}\n\t\n\tfor (size_t i = 0; i < tokens.size(); i++) {\n\t\tif (i == 0) {\n\t\t\tm_server_http_request = tokens[i];\n\t\t}\n\t\t\n\t\tend = tokens[i].find(\": \",0);\n\t\t\n\t\tif (end != std::string::npos) {\n\t\t\tstd::string h = tokens[i].substr(0,end);\n\t\t\tif (get_server_header(h) == \"\") {\n\t\t\t\tm_server_headers[h] = tokens[i].substr(end+2);\n\t\t\t} else {\n\t\t\t\tm_server_headers[h] += \", \" + tokens[i].substr(end+2);\n\t\t\t}\n\t\t}\n\t}\n\t\n\t\/\/ handshake error checking\n\ttry {\n\t\tstd::stringstream err;\n\t\tstd::string h;\n\t\t\n\t\t\/\/ TODO: allow versions greater than 1.1\n\t\tif (m_server_http_request.substr(0,9) != \"HTTP\/1.1 \") {\n\t\t\terr << \"Websocket handshake has invalid HTTP version: \"\n\t\t\t\t<< m_server_http_request.substr(0,9);\n\t\t\t\n\t\t\tthrow(handshake_error(err.str(),400));\n\t\t}\n\t\t\n\t\t\/\/ check the HTTP version\n\t\tif (m_server_http_request.substr(9,3) != \"101\") {\n\t\t\terr << \"Websocket handshake ended with status \"\n\t\t\t << m_server_http_request.substr(9);\n\t\t\t\n\t\t\t\/\/ TODO: check version header for other supported versions.\n\t\t\t\n\t\t\tthrow(handshake_error(err.str(),400));\n\t\t}\n\t\t\n\t\t\/\/ verify the presence of required headers\n\t\th = get_server_header(\"Upgrade\");\n\t\tif (h == \"\") {\n\t\t\tthrow(handshake_error(\"Required Upgrade header is missing\",400));\n\t\t} else if (!boost::iequals(h,\"websocket\")) {\n\t\t\terr << \"Upgrade header was \" << h << \" instead of \\\"websocket\\\"\";\n\t\t\tthrow(handshake_error(err.str(),400));\n\t\t}\n\t\t\n\t\th = get_server_header(\"Connection\");\n\t\tif (h == \"\") {\n\t\t\tthrow(handshake_error(\"Required Connection header is missing\",400));\n\t\t} else if (!boost::ifind_first(h,\"upgrade\")) {\n\t\t\terr << \"Connection header, \\\"\" << h \n\t\t\t\t<< \"\\\", does not contain required token \\\"upgrade\\\"\";\n\t\t\tthrow(handshake_error(err.str(),400));\n\t\t}\n\t\t\t\n\t\tif (get_server_header(\"Sec-WebSocket-Accept\") == \"\") {\n\t\t\tthrow(handshake_error(\"Required Sec-WebSocket-Key header is missing\",400));\n\t\t} else {\n\t\t\t\/\/ TODO: make a helper function for this.\n\t\t\tstd::string server_key = m_client_key;\n\t\t\tserver_key += \"258EAFA5-E914-47DA-95CA-C5AB0DC85B11\";\n\t\t\t\n\t\t\tSHA1\t\tsha;\n\t\t\tuint32_t\tmessage_digest[5];\n\t\t\t\n\t\t\tsha.Reset();\n\t\t\tsha << server_key.c_str();\n\t\n\t\t\tif (!sha.Result(message_digest)) {\n\t\t\t\tm_client->log(\"Error computing handshake sha1 hash.\",LOG_ERROR);\n\t\t\t\t\/\/ TODO: close behavior\n\t\t\t\treturn;\n\t\t\t}\n\t\n\t\t\t\/\/ convert sha1 hash bytes to network byte order because this sha1\n\t\t\t\/\/ library works on ints rather than bytes\n\t\t\tfor (int i = 0; i < 5; i++) {\n\t\t\t\tmessage_digest[i] = htonl(message_digest[i]);\n\t\t\t}\n\t\n\t\t\tserver_key = base64_encode(\n\t\t\t\t\treinterpret_cast(message_digest),20);\n\t\t\tif (server_key != get_server_header(\"Sec-WebSocket-Accept\")) {\n\t\t\t\tm_client->log(\"Server key does not match\",LOG_ERROR);\n\t\t\t\t\/\/ TODO: close behavior\n\t\t\t\treturn;\n\t\t\t}\n\t\t}\n\t} catch (const handshake_error& e) {\n\t\tstd::stringstream err;\n\t\terr << \"Caught handshake exception: \" << e.what();\n\t\t\n\t\tm_client->access_log(e.what(),ALOG_HANDSHAKE);\n\t\tm_client->log(err.str(),LOG_ERROR);\n\t\t\n\t\t\/\/ TODO: close behavior\n\t\treturn;\n\t}\n\t\n\tlog_open_result();\n\n\tm_status = OPEN;\n\n\tif (m_local_interface) {\n\t\tm_local_interface->on_open(shared_from_this());\n\t}\n\t\n\treset_message();\n\tread_frame();\n}\n\nvoid client_session::write_handshake() {\n\t\/\/ generate client handshake.\t\n\tstd::string client_handshake;\n\t\n\tclient_handshake += \"GET \"+m_resource+\" HTTP\/1.1\\r\\n\";\n\t\n\tset_header(\"Upgrade\",\"websocket\");\n\tset_header(\"Connection\",\"Upgrade\");\n\tset_header(\"Sec-WebSocket-Version\",\"13\");\n\t\n\tset_header(\"Host\",m_uri.host);\n\n\tif (m_client_origin != \"\") {\n\t\tset_header(\"Origin\",m_client_origin);\n\t}\n\t\n\t\/\/ TODO: generate proper key\n\tm_client_key = \"XO4pxrIMLnK1CEVQP9untQ==\";\n\t\n\tint32_t raw_key[4];\n\t\n\tboost::random::random_device rng;\n\tboost::random::variate_generator > gen(rng, boost::random::uniform_int_distribution<>(INT32_MIN,INT32_MAX));\n\t\n\tfor (int i = 0; i < 4; i++) {\n\t\traw_key[i] = gen();\n\t}\n\t\n\tm_client_key = base64_encode(reinterpret_cast(raw_key), 16);\n\t\n\tm_client->access_log(\"Client key chosen: \"+m_client_key, ALOG_HANDSHAKE);\n\t\n\tset_header(\"Sec-WebSocket-Key\",m_client_key);\n\t\n\t\n\n\tset_header(\"User Agent\",\"WebSocket++\/2011-09-25\");\n\n\theader_list::iterator it;\n\tfor (it = m_client_headers.begin(); it != m_client_headers.end(); it++) {\n\t\tclient_handshake += it->first + \": \" + it->second + \"\\r\\n\";\n\t}\n\t\n\tclient_handshake += \"\\r\\n\";\n\t\n\tm_raw_client_handshake = client_handshake;\n\n\t\/\/ start async write to handle_write_handshake\n\tboost::asio::async_write(\n\t\tm_socket,\n\t\tboost::asio::buffer(m_raw_client_handshake),\n\t\tboost::bind(\n\t\t\t&session::handle_write_handshake,\n\t\t\tshared_from_this(),\n\t\t\tboost::asio::placeholders::error\n\t\t)\n\t);\n}\n\nvoid client_session::handle_write_handshake(const boost::system::error_code& error) {\n\tif (error) {\n\t\thandle_error(\"Error writing handshake\",error);\n\t\t\/\/ TODO: close behavior\n\t\treturn;\n\t}\n\t\n\tread_handshake();\n}\n\nvoid client_session::log(const std::string& msg, uint16_t level) const {\n\tm_client->log(msg,level);\n}\n\nvoid client_session::access_log(const std::string& msg, uint16_t level) const {\n\tm_client->access_log(msg,level);\n}\n<|endoftext|>"} {"text":"\/*\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 \n#include \n#include \n\n#include \"hip\/hip_runtime.h\"\n#include \"hip_hcc_internal.h\"\n#include \"hip_fatbin.h\"\n#include \"trace_helper.h\"\n\nextern \"C\" std::vector*\n__hipRegisterFatBinary(const void* data)\n{\n hip_impl::hip_init();\n\n tprintf(DB_FB, \"Enter __hipRegisterFatBinary(%p)\\n\", data);\n const __CudaFatBinaryWrapper* fbwrapper = reinterpret_cast(data);\n if (fbwrapper->magic != __hipFatMAGIC2 || fbwrapper->version != 1) {\n return nullptr;\n }\n\n const __ClangOffloadBundleHeader* header = fbwrapper->binary;\n std::string magic(reinterpret_cast(header), sizeof(CLANG_OFFLOAD_BUNDLER_MAGIC) - 1);\n if (magic.compare(CLANG_OFFLOAD_BUNDLER_MAGIC)) {\n return nullptr;\n }\n\n auto modules = new std::vector{g_deviceCnt};\n if (!modules) {\n return nullptr;\n }\n\n const __ClangOffloadBundleDesc* desc = &header->desc[0];\n for (uint64_t i = 0; i < header->numBundles; ++i,\n desc = reinterpret_cast(\n reinterpret_cast(&desc->triple[0]) + desc->tripleSize)) {\n\n std::string triple{&desc->triple[0], sizeof(AMDGCN_AMDHSA_TRIPLE) - 1};\n if (triple.compare(AMDGCN_AMDHSA_TRIPLE))\n continue;\n\n std::string target{&desc->triple[sizeof(AMDGCN_AMDHSA_TRIPLE)],\n desc->tripleSize - sizeof(AMDGCN_AMDHSA_TRIPLE)};\n tprintf(DB_FB, \"Found bundle for %s\\n\", target.c_str());\n\n for (int deviceId = 0; deviceId < g_deviceCnt; ++deviceId) {\n hsa_agent_t agent = g_allAgents[deviceId + 1];\n\n char name[64] = {};\n hsa_agent_get_info(agent, HSA_AGENT_INFO_NAME, name);\n if (target.compare(name)) {\n continue;\n }\n\n ihipModule_t* module = new ihipModule_t;\n if (!module) {\n continue;\n }\n\n hsa_executable_create_alt(HSA_PROFILE_FULL, HSA_DEFAULT_FLOAT_ROUNDING_MODE_DEFAULT, nullptr,\n &module->executable);\n\n std::string image{reinterpret_cast(\n reinterpret_cast(header) + desc->offset), desc->size};\n if (HIP_DUMP_CODE_OBJECT)\n __hipDumpCodeObject(image);\n module->executable = hip_impl::get_program_state().load_executable(image.data(), image.size(),\n module->executable,\n agent);\n\n if (module->executable.handle) {\n modules->at(deviceId) = module;\n tprintf(DB_FB, \"Loaded code object for %s\\n\", name);\n } else {\n fprintf(stderr, \"Failed to load code object for %s\\n\", name);\n abort();\n }\n }\n }\n\n for (int deviceId = 0; deviceId < g_deviceCnt; ++deviceId) {\n hsa_agent_t agent = g_allAgents[deviceId + 1];\n\n char name[64] = {};\n hsa_agent_get_info(agent, HSA_AGENT_INFO_NAME, name);\n if (!(*modules)[deviceId]) {\n fprintf(stderr, \"No device code bundle for %s\\n\", name);\n abort();\n }\n }\n\n tprintf(DB_FB, \"__hipRegisterFatBinary succeeds and returns %p\\n\", modules);\n return modules;\n}\n\nstd::map> g_functions;\n\nextern \"C\" void __hipRegisterFunction(\n std::vector* modules,\n const void* hostFunction,\n char* deviceFunction,\n const char* deviceName,\n unsigned int threadLimit,\n uint3* tid,\n uint3* bid,\n dim3* blockDim,\n dim3* gridDim,\n int* wSize)\n{\n HIP_INIT_API(NONE, modules, hostFunction, deviceFunction, deviceName);\n std::vector functions{g_deviceCnt};\n\n assert(modules && modules->size() >= g_deviceCnt);\n for (int deviceId = 0; deviceId < g_deviceCnt; ++deviceId) {\n hipFunction_t function;\n hsa_agent_t agent = g_allAgents[deviceId + 1];\n if ((hipSuccess == hipModuleGetFunctionEx(&function, modules->at(deviceId), deviceName, &agent) ||\n \/\/ With code-object-v3, we need to match the kernel descriptor symbol name\n (hipSuccess == hipModuleGetFunctionEx(\n &function, modules->at(deviceId),\n (std::string(deviceName) + std::string(\".kd\")).c_str(),\n &agent\n ))) && function != nullptr) {\n functions[deviceId] = function;\n }\n else {\n tprintf(DB_FB, \"__hipRegisterFunction cannot find kernel %s for\"\n \" device %d\\n\", deviceName, deviceId);\n }\n }\n\n g_functions.insert(std::make_pair(hostFunction, std::move(functions)));\n}\n\nextern \"C\" void __hipRegisterVar(\n std::vector* modules,\n char* hostVar,\n char* deviceVar,\n const char* deviceName,\n int ext,\n int size,\n int constant,\n int global)\n{\n}\n\nextern \"C\" void __hipUnregisterFatBinary(std::vector* modules)\n{\n std::for_each(modules->begin(), modules->end(), [](hipModule_t module){ delete module; });\n delete modules;\n}\n\nhipError_t hipConfigureCall(\n dim3 gridDim,\n dim3 blockDim,\n size_t sharedMem,\n hipStream_t stream)\n{\n GET_TLS();\n auto ctx = ihipGetTlsDefaultCtx();\n LockedAccessor_CtxCrit_t crit(ctx->criticalData());\n\n crit->_execStack.push(ihipExec_t{gridDim, blockDim, sharedMem, stream});\n return hipSuccess;\n}\n\nhipError_t hipSetupArgument(\n const void *arg,\n size_t size,\n size_t offset)\n{\n HIP_INIT_API(hipSetupArgument, arg, size, offset);\n auto ctx = ihipGetTlsDefaultCtx();\n LockedAccessor_CtxCrit_t crit(ctx->criticalData());\n auto& arguments = crit->_execStack.top()._arguments;\n\n if (arguments.size() < offset + size) {\n arguments.resize(offset + size);\n }\n\n ::memcpy(&arguments[offset], arg, size);\n return hipSuccess;\n}\n\nhipError_t hipLaunchByPtr(const void *hostFunction)\n{\n HIP_INIT_API(hipLaunchByPtr, hostFunction);\n ihipExec_t exec;\n {\n auto ctx = ihipGetTlsDefaultCtx();\n LockedAccessor_CtxCrit_t crit(ctx->criticalData());\n exec = std::move(crit->_execStack.top());\n crit->_execStack.pop();\n }\n\n int deviceId;\n if (exec._hStream) {\n deviceId = exec._hStream->getDevice()->_deviceId;\n }\n else if (ihipGetTlsDefaultCtx() && ihipGetTlsDefaultCtx()->getDevice()) {\n deviceId = ihipGetTlsDefaultCtx()->getDevice()->_deviceId;\n }\n else {\n deviceId = 0;\n }\n\n hipError_t e = hipSuccess;\n decltype(g_functions)::iterator it;\n if ((it = g_functions.find(hostFunction)) == g_functions.end() ||\n !it->second[deviceId]) {\n e = hipErrorUnknown;\n fprintf(stderr, \"hipLaunchByPtr cannot find kernel with stub address %p\"\n \" for device %d!\\n\", hostFunction, deviceId);\n abort();\n } else {\n size_t size = exec._arguments.size();\n void *extra[] = {\n HIP_LAUNCH_PARAM_BUFFER_POINTER, &exec._arguments[0],\n HIP_LAUNCH_PARAM_BUFFER_SIZE, &size,\n HIP_LAUNCH_PARAM_END\n };\n\n e = hipModuleLaunchKernel(it->second[deviceId],\n exec._gridDim.x, exec._gridDim.y, exec._gridDim.z,\n exec._blockDim.x, exec._blockDim.y, exec._blockDim.z,\n exec._sharedMem, exec._hStream, nullptr, extra);\n }\n\n return ihipLogStatus(e);\n}\n\nFix build issues seen with hip-clang path (#1331)\/*\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 \n#include \n#include \n\n#include \"hip\/hip_runtime.h\"\n#include \"hip_hcc_internal.h\"\n#include \"hip_fatbin.h\"\n#include \"trace_helper.h\"\n\n#ifdef __GNUC__\n#pragma GCC visibility push (default)\n#endif\n\nextern \"C\" std::vector*\n__hipRegisterFatBinary(const void* data)\n{\n hip_impl::hip_init();\n\n tprintf(DB_FB, \"Enter __hipRegisterFatBinary(%p)\\n\", data);\n const __CudaFatBinaryWrapper* fbwrapper = reinterpret_cast(data);\n if (fbwrapper->magic != __hipFatMAGIC2 || fbwrapper->version != 1) {\n return nullptr;\n }\n\n const __ClangOffloadBundleHeader* header = fbwrapper->binary;\n std::string magic(reinterpret_cast(header), sizeof(CLANG_OFFLOAD_BUNDLER_MAGIC) - 1);\n if (magic.compare(CLANG_OFFLOAD_BUNDLER_MAGIC)) {\n return nullptr;\n }\n\n auto modules = new std::vector{g_deviceCnt};\n if (!modules) {\n return nullptr;\n }\n\n const __ClangOffloadBundleDesc* desc = &header->desc[0];\n for (uint64_t i = 0; i < header->numBundles; ++i,\n desc = reinterpret_cast(\n reinterpret_cast(&desc->triple[0]) + desc->tripleSize)) {\n\n std::string triple{&desc->triple[0], sizeof(AMDGCN_AMDHSA_TRIPLE) - 1};\n if (triple.compare(AMDGCN_AMDHSA_TRIPLE))\n continue;\n\n std::string target{&desc->triple[sizeof(AMDGCN_AMDHSA_TRIPLE)],\n desc->tripleSize - sizeof(AMDGCN_AMDHSA_TRIPLE)};\n tprintf(DB_FB, \"Found bundle for %s\\n\", target.c_str());\n\n for (int deviceId = 0; deviceId < g_deviceCnt; ++deviceId) {\n hsa_agent_t agent = g_allAgents[deviceId + 1];\n\n char name[64] = {};\n hsa_agent_get_info(agent, HSA_AGENT_INFO_NAME, name);\n if (target.compare(name)) {\n continue;\n }\n\n ihipModule_t* module = new ihipModule_t;\n if (!module) {\n continue;\n }\n\n hsa_executable_create_alt(HSA_PROFILE_FULL, HSA_DEFAULT_FLOAT_ROUNDING_MODE_DEFAULT, nullptr,\n &module->executable);\n\n std::string image{reinterpret_cast(\n reinterpret_cast(header) + desc->offset), desc->size};\n if (HIP_DUMP_CODE_OBJECT)\n __hipDumpCodeObject(image);\n module->executable = hip_impl::get_program_state().load_executable(image.data(), image.size(),\n module->executable,\n agent);\n\n if (module->executable.handle) {\n modules->at(deviceId) = module;\n tprintf(DB_FB, \"Loaded code object for %s\\n\", name);\n } else {\n fprintf(stderr, \"Failed to load code object for %s\\n\", name);\n abort();\n }\n }\n }\n\n for (int deviceId = 0; deviceId < g_deviceCnt; ++deviceId) {\n hsa_agent_t agent = g_allAgents[deviceId + 1];\n\n char name[64] = {};\n hsa_agent_get_info(agent, HSA_AGENT_INFO_NAME, name);\n if (!(*modules)[deviceId]) {\n fprintf(stderr, \"No device code bundle for %s\\n\", name);\n abort();\n }\n }\n\n tprintf(DB_FB, \"__hipRegisterFatBinary succeeds and returns %p\\n\", modules);\n return modules;\n}\n\nstd::map> g_functions;\n\nextern \"C\" void __hipRegisterFunction(\n std::vector* modules,\n const void* hostFunction,\n char* deviceFunction,\n const char* deviceName,\n unsigned int threadLimit,\n uint3* tid,\n uint3* bid,\n dim3* blockDim,\n dim3* gridDim,\n int* wSize)\n{\n HIP_INIT_API(NONE, modules, hostFunction, deviceFunction, deviceName);\n std::vector functions{g_deviceCnt};\n\n assert(modules && modules->size() >= g_deviceCnt);\n for (int deviceId = 0; deviceId < g_deviceCnt; ++deviceId) {\n hipFunction_t function;\n hsa_agent_t agent = g_allAgents[deviceId + 1];\n if ((hipSuccess == hipModuleGetFunctionEx(&function, modules->at(deviceId), deviceName, &agent) ||\n \/\/ With code-object-v3, we need to match the kernel descriptor symbol name\n (hipSuccess == hipModuleGetFunctionEx(\n &function, modules->at(deviceId),\n (std::string(deviceName) + std::string(\".kd\")).c_str(),\n &agent\n ))) && function != nullptr) {\n functions[deviceId] = function;\n }\n else {\n tprintf(DB_FB, \"__hipRegisterFunction cannot find kernel %s for\"\n \" device %d\\n\", deviceName, deviceId);\n }\n }\n\n g_functions.insert(std::make_pair(hostFunction, std::move(functions)));\n}\n\nextern \"C\" void __hipRegisterVar(\n std::vector* modules,\n char* hostVar,\n char* deviceVar,\n const char* deviceName,\n int ext,\n int size,\n int constant,\n int global)\n{\n}\n\nextern \"C\" void __hipUnregisterFatBinary(std::vector* modules)\n{\n std::for_each(modules->begin(), modules->end(), [](hipModule_t module){ delete module; });\n delete modules;\n}\n\nhipError_t hipConfigureCall(\n dim3 gridDim,\n dim3 blockDim,\n size_t sharedMem,\n hipStream_t stream)\n{\n GET_TLS();\n auto ctx = ihipGetTlsDefaultCtx();\n LockedAccessor_CtxCrit_t crit(ctx->criticalData());\n\n crit->_execStack.push(ihipExec_t{gridDim, blockDim, sharedMem, stream});\n return hipSuccess;\n}\n\nhipError_t hipSetupArgument(\n const void *arg,\n size_t size,\n size_t offset)\n{\n HIP_INIT_API(hipSetupArgument, arg, size, offset);\n auto ctx = ihipGetTlsDefaultCtx();\n LockedAccessor_CtxCrit_t crit(ctx->criticalData());\n auto& arguments = crit->_execStack.top()._arguments;\n\n if (arguments.size() < offset + size) {\n arguments.resize(offset + size);\n }\n\n ::memcpy(&arguments[offset], arg, size);\n return hipSuccess;\n}\n\nhipError_t hipLaunchByPtr(const void *hostFunction)\n{\n HIP_INIT_API(hipLaunchByPtr, hostFunction);\n ihipExec_t exec;\n {\n auto ctx = ihipGetTlsDefaultCtx();\n LockedAccessor_CtxCrit_t crit(ctx->criticalData());\n exec = std::move(crit->_execStack.top());\n crit->_execStack.pop();\n }\n\n int deviceId;\n if (exec._hStream) {\n deviceId = exec._hStream->getDevice()->_deviceId;\n }\n else if (ihipGetTlsDefaultCtx() && ihipGetTlsDefaultCtx()->getDevice()) {\n deviceId = ihipGetTlsDefaultCtx()->getDevice()->_deviceId;\n }\n else {\n deviceId = 0;\n }\n\n hipError_t e = hipSuccess;\n decltype(g_functions)::iterator it;\n if ((it = g_functions.find(hostFunction)) == g_functions.end() ||\n !it->second[deviceId]) {\n e = hipErrorUnknown;\n fprintf(stderr, \"hipLaunchByPtr cannot find kernel with stub address %p\"\n \" for device %d!\\n\", hostFunction, deviceId);\n abort();\n } else {\n size_t size = exec._arguments.size();\n void *extra[] = {\n HIP_LAUNCH_PARAM_BUFFER_POINTER, &exec._arguments[0],\n HIP_LAUNCH_PARAM_BUFFER_SIZE, &size,\n HIP_LAUNCH_PARAM_END\n };\n\n e = hipModuleLaunchKernel(it->second[deviceId],\n exec._gridDim.x, exec._gridDim.y, exec._gridDim.z,\n exec._blockDim.x, exec._blockDim.y, exec._blockDim.z,\n exec._sharedMem, exec._hStream, nullptr, extra);\n }\n\n return ihipLogStatus(e);\n}\n#ifdef __GNUC__\n#pragma GCC visibility pop\n#endif\n<|endoftext|>"} {"text":"\/**\n ******************************************************************************\n * Xenia : Xbox 360 Emulator Research Project *\n ******************************************************************************\n * Copyright 2015 Ben Vanik. All rights reserved. *\n * Released under the BSD license - see LICENSE in the root for more details. *\n ******************************************************************************\n *\/\n\n#include \"xenia\/base\/filesystem.h\"\n#include \"xenia\/base\/logging.h\"\n\n#include \n\n#include \"xenia\/base\/platform_win.h\"\n\nnamespace xe {\nnamespace filesystem {\n\nbool PathExists(const std::wstring& path) {\n DWORD attrib = GetFileAttributes(path.c_str());\n return attrib != INVALID_FILE_ATTRIBUTES;\n}\n\nbool CreateFolder(const std::wstring& path) {\n wchar_t folder[kMaxPath] = {0};\n auto end = std::wcschr(path.c_str(), xe::kWPathSeparator);\n while (end) {\n wcsncpy(folder, path.c_str(), end - path.c_str() + 1);\n CreateDirectory(folder, NULL);\n end = wcschr(++end, xe::kWPathSeparator);\n }\n return PathExists(path);\n}\n\nbool DeleteFolder(const std::wstring& path) {\n auto double_null_path = path + L\"\\0\";\n SHFILEOPSTRUCT op = {0};\n op.wFunc = FO_DELETE;\n op.pFrom = double_null_path.c_str();\n op.fFlags = FOF_NO_UI;\n return SHFileOperation(&op) == 0;\n}\n\nbool IsFolder(const std::wstring& path) {\n DWORD attrib = GetFileAttributes(path.c_str());\n return attrib != INVALID_FILE_ATTRIBUTES &&\n (attrib & FILE_ATTRIBUTE_DIRECTORY) == FILE_ATTRIBUTE_DIRECTORY;\n}\n\n#undef CreateFile\nbool CreateFile(const std::wstring& path) {\n auto handle = CreateFileW(path.c_str(), 0, 0, nullptr, CREATE_ALWAYS,\n FILE_ATTRIBUTE_NORMAL, nullptr);\n if (handle == INVALID_HANDLE_VALUE) {\n return false;\n }\n\n CloseHandle(handle);\n return true;\n}\n\nFILE* OpenFile(const std::wstring& path, const char* mode) {\n auto fixed_path = xe::fix_path_separators(path);\n return _wfopen(fixed_path.c_str(), xe::to_wstring(mode).c_str());\n}\n\nbool DeleteFile(const std::wstring& path) {\n return DeleteFileW(path.c_str()) ? true : false;\n}\n\nclass Win32FileHandle : public FileHandle {\n public:\n Win32FileHandle(std::wstring path, HANDLE handle)\n : FileHandle(std::move(path)), handle_(handle) {}\n ~Win32FileHandle() override {\n CloseHandle(handle_);\n handle_ = nullptr;\n }\n bool Read(size_t file_offset, void* buffer, size_t buffer_length,\n size_t* out_bytes_read) override {\n *out_bytes_read = 0;\n OVERLAPPED overlapped;\n overlapped.Pointer = (PVOID)file_offset;\n overlapped.hEvent = NULL;\n DWORD bytes_read = 0;\n BOOL read = ReadFile(handle_, buffer, (DWORD)buffer_length, &bytes_read,\n &overlapped);\n if (read) {\n *out_bytes_read = bytes_read;\n return true;\n } else {\n if (GetLastError() == ERROR_NOACCESS) {\n XELOGW(\n \"Win32FileHandle::Read(..., %.8llX, %.8llX, ...) returned \"\n \"ERROR_NOACCESS. Read-only memory?\",\n buffer, buffer_length);\n }\n return false;\n }\n }\n bool Write(size_t file_offset, const void* buffer, size_t buffer_length,\n size_t* out_bytes_written) override {\n *out_bytes_written = 0;\n OVERLAPPED overlapped;\n overlapped.Pointer = (PVOID)file_offset;\n overlapped.hEvent = NULL;\n DWORD bytes_written = 0;\n BOOL wrote = WriteFile(handle_, buffer, (DWORD)buffer_length,\n &bytes_written, &overlapped);\n if (wrote) {\n *out_bytes_written = bytes_written;\n return true;\n } else {\n return false;\n }\n }\n void Flush() override { FlushFileBuffers(handle_); }\n\n private:\n HANDLE handle_ = nullptr;\n};\n\nstd::unique_ptr FileHandle::OpenExisting(std::wstring path,\n uint32_t desired_access) {\n DWORD open_access = 0;\n if (desired_access & FileAccess::kGenericRead) {\n open_access |= GENERIC_READ;\n }\n if (desired_access & FileAccess::kGenericWrite) {\n open_access |= GENERIC_WRITE;\n }\n if (desired_access & FileAccess::kGenericExecute) {\n open_access |= GENERIC_EXECUTE;\n }\n if (desired_access & FileAccess::kGenericAll) {\n open_access |= GENERIC_READ | GENERIC_WRITE;\n }\n if (desired_access & FileAccess::kFileReadData) {\n open_access |= FILE_READ_DATA;\n }\n if (desired_access & FileAccess::kFileWriteData) {\n open_access |= FILE_WRITE_DATA;\n }\n if (desired_access & FileAccess::kFileAppendData) {\n open_access |= FILE_APPEND_DATA;\n }\n DWORD share_mode = FILE_SHARE_READ | FILE_SHARE_WRITE;\n \/\/ We assume we've already created the file in the caller.\n DWORD creation_disposition = OPEN_EXISTING;\n HANDLE handle = CreateFileW(\n path.c_str(), open_access, share_mode, nullptr, creation_disposition,\n FILE_ATTRIBUTE_NORMAL | FILE_FLAG_BACKUP_SEMANTICS, nullptr);\n if (handle == INVALID_HANDLE_VALUE) {\n \/\/ TODO(benvanik): pick correct response.\n return nullptr;\n }\n return std::make_unique(path, handle);\n}\n\n#define COMBINE_TIME(t) (((uint64_t)t.dwHighDateTime << 32) | t.dwLowDateTime)\n\nbool GetInfo(const std::wstring& path, FileInfo* out_info) {\n std::memset(out_info, 0, sizeof(FileInfo));\n WIN32_FILE_ATTRIBUTE_DATA data = {0};\n if (!GetFileAttributesEx(path.c_str(), GetFileExInfoStandard, &data)) {\n return false;\n }\n if (data.dwFileAttributes & FILE_ATTRIBUTE_DIRECTORY) {\n out_info->type = FileInfo::Type::kDirectory;\n out_info->total_size = 0;\n } else {\n out_info->type = FileInfo::Type::kFile;\n out_info->total_size =\n (data.nFileSizeHigh * (size_t(MAXDWORD) + 1)) + data.nFileSizeLow;\n }\n out_info->name = xe::find_name_from_path(path);\n out_info->create_timestamp = COMBINE_TIME(data.ftCreationTime);\n out_info->access_timestamp = COMBINE_TIME(data.ftLastAccessTime);\n out_info->write_timestamp = COMBINE_TIME(data.ftLastWriteTime);\n return true;\n}\n\nstd::vector ListFiles(const std::wstring& path) {\n std::vector result;\n\n WIN32_FIND_DATA ffd;\n HANDLE handle = FindFirstFile((path + L\"\\\\*\").c_str(), &ffd);\n if (handle == INVALID_HANDLE_VALUE) {\n return result;\n }\n do {\n if (std::wcscmp(ffd.cFileName, L\".\") == 0 ||\n std::wcscmp(ffd.cFileName, L\"..\") == 0) {\n continue;\n }\n FileInfo info;\n if (ffd.dwFileAttributes & FILE_ATTRIBUTE_DIRECTORY) {\n info.type = FileInfo::Type::kDirectory;\n info.total_size = 0;\n } else {\n info.type = FileInfo::Type::kFile;\n info.total_size =\n (ffd.nFileSizeHigh * (size_t(MAXDWORD) + 1)) + ffd.nFileSizeLow;\n }\n info.name = ffd.cFileName;\n info.create_timestamp = COMBINE_TIME(ffd.ftCreationTime);\n info.access_timestamp = COMBINE_TIME(ffd.ftLastAccessTime);\n info.write_timestamp = COMBINE_TIME(ffd.ftLastWriteTime);\n result.push_back(info);\n } while (FindNextFile(handle, &ffd) != 0);\n FindClose(handle);\n\n return result;\n}\n\n} \/\/ namespace filesystem\n} \/\/ namespace xe\nFixed xe::filesystem::DeleteFolder on Windows. Should fix some issues where games tried to overwrite existing content such as saves and was failing.\/**\n ******************************************************************************\n * Xenia : Xbox 360 Emulator Research Project *\n ******************************************************************************\n * Copyright 2015 Ben Vanik. All rights reserved. *\n * Released under the BSD license - see LICENSE in the root for more details. *\n ******************************************************************************\n *\/\n\n#include \"xenia\/base\/filesystem.h\"\n#include \"xenia\/base\/logging.h\"\n\n#include \n\n#include \"xenia\/base\/platform_win.h\"\n\nnamespace xe {\nnamespace filesystem {\n\nbool PathExists(const std::wstring& path) {\n DWORD attrib = GetFileAttributes(path.c_str());\n return attrib != INVALID_FILE_ATTRIBUTES;\n}\n\nbool CreateFolder(const std::wstring& path) {\n wchar_t folder[kMaxPath] = {0};\n auto end = std::wcschr(path.c_str(), xe::kWPathSeparator);\n while (end) {\n wcsncpy(folder, path.c_str(), end - path.c_str() + 1);\n CreateDirectory(folder, NULL);\n end = wcschr(++end, xe::kWPathSeparator);\n }\n return PathExists(path);\n}\n\nbool DeleteFolder(const std::wstring& path) {\n auto double_null_path = path + std::wstring(L\"\\0\", 1);\n SHFILEOPSTRUCT op = {0};\n op.wFunc = FO_DELETE;\n op.pFrom = double_null_path.c_str();\n op.fFlags = FOF_NO_UI;\n return SHFileOperation(&op) == 0;\n}\n\nbool IsFolder(const std::wstring& path) {\n DWORD attrib = GetFileAttributes(path.c_str());\n return attrib != INVALID_FILE_ATTRIBUTES &&\n (attrib & FILE_ATTRIBUTE_DIRECTORY) == FILE_ATTRIBUTE_DIRECTORY;\n}\n\n#undef CreateFile\nbool CreateFile(const std::wstring& path) {\n auto handle = CreateFileW(path.c_str(), 0, 0, nullptr, CREATE_ALWAYS,\n FILE_ATTRIBUTE_NORMAL, nullptr);\n if (handle == INVALID_HANDLE_VALUE) {\n return false;\n }\n\n CloseHandle(handle);\n return true;\n}\n\nFILE* OpenFile(const std::wstring& path, const char* mode) {\n auto fixed_path = xe::fix_path_separators(path);\n return _wfopen(fixed_path.c_str(), xe::to_wstring(mode).c_str());\n}\n\nbool DeleteFile(const std::wstring& path) {\n return DeleteFileW(path.c_str()) ? true : false;\n}\n\nclass Win32FileHandle : public FileHandle {\n public:\n Win32FileHandle(std::wstring path, HANDLE handle)\n : FileHandle(std::move(path)), handle_(handle) {}\n ~Win32FileHandle() override {\n CloseHandle(handle_);\n handle_ = nullptr;\n }\n bool Read(size_t file_offset, void* buffer, size_t buffer_length,\n size_t* out_bytes_read) override {\n *out_bytes_read = 0;\n OVERLAPPED overlapped;\n overlapped.Pointer = (PVOID)file_offset;\n overlapped.hEvent = NULL;\n DWORD bytes_read = 0;\n BOOL read = ReadFile(handle_, buffer, (DWORD)buffer_length, &bytes_read,\n &overlapped);\n if (read) {\n *out_bytes_read = bytes_read;\n return true;\n } else {\n if (GetLastError() == ERROR_NOACCESS) {\n XELOGW(\n \"Win32FileHandle::Read(..., %.8llX, %.8llX, ...) returned \"\n \"ERROR_NOACCESS. Read-only memory?\",\n buffer, buffer_length);\n }\n return false;\n }\n }\n bool Write(size_t file_offset, const void* buffer, size_t buffer_length,\n size_t* out_bytes_written) override {\n *out_bytes_written = 0;\n OVERLAPPED overlapped;\n overlapped.Pointer = (PVOID)file_offset;\n overlapped.hEvent = NULL;\n DWORD bytes_written = 0;\n BOOL wrote = WriteFile(handle_, buffer, (DWORD)buffer_length,\n &bytes_written, &overlapped);\n if (wrote) {\n *out_bytes_written = bytes_written;\n return true;\n } else {\n return false;\n }\n }\n void Flush() override { FlushFileBuffers(handle_); }\n\n private:\n HANDLE handle_ = nullptr;\n};\n\nstd::unique_ptr FileHandle::OpenExisting(std::wstring path,\n uint32_t desired_access) {\n DWORD open_access = 0;\n if (desired_access & FileAccess::kGenericRead) {\n open_access |= GENERIC_READ;\n }\n if (desired_access & FileAccess::kGenericWrite) {\n open_access |= GENERIC_WRITE;\n }\n if (desired_access & FileAccess::kGenericExecute) {\n open_access |= GENERIC_EXECUTE;\n }\n if (desired_access & FileAccess::kGenericAll) {\n open_access |= GENERIC_READ | GENERIC_WRITE;\n }\n if (desired_access & FileAccess::kFileReadData) {\n open_access |= FILE_READ_DATA;\n }\n if (desired_access & FileAccess::kFileWriteData) {\n open_access |= FILE_WRITE_DATA;\n }\n if (desired_access & FileAccess::kFileAppendData) {\n open_access |= FILE_APPEND_DATA;\n }\n DWORD share_mode = FILE_SHARE_READ | FILE_SHARE_WRITE;\n \/\/ We assume we've already created the file in the caller.\n DWORD creation_disposition = OPEN_EXISTING;\n HANDLE handle = CreateFileW(\n path.c_str(), open_access, share_mode, nullptr, creation_disposition,\n FILE_ATTRIBUTE_NORMAL | FILE_FLAG_BACKUP_SEMANTICS, nullptr);\n if (handle == INVALID_HANDLE_VALUE) {\n \/\/ TODO(benvanik): pick correct response.\n return nullptr;\n }\n return std::make_unique(path, handle);\n}\n\n#define COMBINE_TIME(t) (((uint64_t)t.dwHighDateTime << 32) | t.dwLowDateTime)\n\nbool GetInfo(const std::wstring& path, FileInfo* out_info) {\n std::memset(out_info, 0, sizeof(FileInfo));\n WIN32_FILE_ATTRIBUTE_DATA data = {0};\n if (!GetFileAttributesEx(path.c_str(), GetFileExInfoStandard, &data)) {\n return false;\n }\n if (data.dwFileAttributes & FILE_ATTRIBUTE_DIRECTORY) {\n out_info->type = FileInfo::Type::kDirectory;\n out_info->total_size = 0;\n } else {\n out_info->type = FileInfo::Type::kFile;\n out_info->total_size =\n (data.nFileSizeHigh * (size_t(MAXDWORD) + 1)) + data.nFileSizeLow;\n }\n out_info->name = xe::find_name_from_path(path);\n out_info->create_timestamp = COMBINE_TIME(data.ftCreationTime);\n out_info->access_timestamp = COMBINE_TIME(data.ftLastAccessTime);\n out_info->write_timestamp = COMBINE_TIME(data.ftLastWriteTime);\n return true;\n}\n\nstd::vector ListFiles(const std::wstring& path) {\n std::vector result;\n\n WIN32_FIND_DATA ffd;\n HANDLE handle = FindFirstFile((path + L\"\\\\*\").c_str(), &ffd);\n if (handle == INVALID_HANDLE_VALUE) {\n return result;\n }\n do {\n if (std::wcscmp(ffd.cFileName, L\".\") == 0 ||\n std::wcscmp(ffd.cFileName, L\"..\") == 0) {\n continue;\n }\n FileInfo info;\n if (ffd.dwFileAttributes & FILE_ATTRIBUTE_DIRECTORY) {\n info.type = FileInfo::Type::kDirectory;\n info.total_size = 0;\n } else {\n info.type = FileInfo::Type::kFile;\n info.total_size =\n (ffd.nFileSizeHigh * (size_t(MAXDWORD) + 1)) + ffd.nFileSizeLow;\n }\n info.name = ffd.cFileName;\n info.create_timestamp = COMBINE_TIME(ffd.ftCreationTime);\n info.access_timestamp = COMBINE_TIME(ffd.ftLastAccessTime);\n info.write_timestamp = COMBINE_TIME(ffd.ftLastWriteTime);\n result.push_back(info);\n } while (FindNextFile(handle, &ffd) != 0);\n FindClose(handle);\n\n return result;\n}\n\n} \/\/ namespace filesystem\n} \/\/ namespace xe\n<|endoftext|>"} {"text":"\/*\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 \n#include \n\n#include \"hip\/hip_runtime.h\"\n#include \"hip_hcc_internal.h\"\n#include \"trace_helper.h\"\n\nconstexpr unsigned __hipFatMAGIC2 = 0x48495046; \/\/ \"HIPF\"\n\n#define CLANG_OFFLOAD_BUNDLER_MAGIC \"__CLANG_OFFLOAD_BUNDLE__\"\n#define AMDGCN_AMDHSA_TRIPLE \"hip-amdgcn-amd-amdhsa\"\n\nstruct __ClangOffloadBundleDesc {\n uint64_t offset;\n uint64_t size;\n uint64_t tripleSize;\n const char triple[1];\n};\n\nstruct __ClangOffloadBundleHeader {\n const char magic[sizeof(CLANG_OFFLOAD_BUNDLER_MAGIC) - 1];\n uint64_t numBundles;\n __ClangOffloadBundleDesc desc[1];\n};\n\nstruct __CudaFatBinaryWrapper {\n unsigned int magic;\n unsigned int version;\n __ClangOffloadBundleHeader* binary;\n void* unused;\n};\n\n\nextern \"C\" std::vector*\n__hipRegisterFatBinary(const void* data)\n{\n HIP_INIT();\n\n tprintf(DB_FB, \"Enter __hipRegisterFatBinary(%p)\\n\", data);\n const __CudaFatBinaryWrapper* fbwrapper = reinterpret_cast(data);\n if (fbwrapper->magic != __hipFatMAGIC2 || fbwrapper->version != 1) {\n return nullptr;\n }\n\n const __ClangOffloadBundleHeader* header = fbwrapper->binary;\n std::string magic(reinterpret_cast(header), sizeof(CLANG_OFFLOAD_BUNDLER_MAGIC) - 1);\n if (magic.compare(CLANG_OFFLOAD_BUNDLER_MAGIC)) {\n return nullptr;\n }\n\n auto modules = new std::vector{g_deviceCnt};\n if (!modules) {\n return nullptr;\n }\n\n const __ClangOffloadBundleDesc* desc = &header->desc[0];\n for (uint64_t i = 0; i < header->numBundles; ++i,\n desc = reinterpret_cast(\n reinterpret_cast(&desc->triple[0]) + desc->tripleSize)) {\n\n std::string triple{&desc->triple[0], sizeof(AMDGCN_AMDHSA_TRIPLE) - 1};\n if (triple.compare(AMDGCN_AMDHSA_TRIPLE))\n continue;\n\n std::string target{&desc->triple[sizeof(AMDGCN_AMDHSA_TRIPLE)],\n desc->tripleSize - sizeof(AMDGCN_AMDHSA_TRIPLE)};\n\n for (int deviceId = 0; deviceId < g_deviceCnt; ++deviceId) {\n hsa_agent_t agent = g_allAgents[deviceId + 1];\n\n char name[64] = {};\n hsa_agent_get_info(agent, HSA_AGENT_INFO_NAME, name);\n if (target.compare(name)) {\n continue;\n }\n\n ihipModule_t* module = new ihipModule_t;\n if (!module) {\n continue;\n }\n\n hsa_executable_create_alt(HSA_PROFILE_FULL, HSA_DEFAULT_FLOAT_ROUNDING_MODE_DEFAULT, nullptr,\n &module->executable);\n\n std::string image{reinterpret_cast(\n reinterpret_cast(header) + desc->offset), desc->size};\n module->executable = hip_impl::load_executable(image, module->executable, agent);\n\n if (module->executable.handle) {\n modules->at(deviceId) = module;\n }\n }\n }\n\n tprintf(DB_FB, \"__hipRegisterFatBinary succeeds and returns %p\\n\", modules);\n return modules;\n}\n\nstd::map> g_functions;\n\nextern \"C\" void __hipRegisterFunction(\n std::vector* modules,\n const void* hostFunction,\n char* deviceFunction,\n const char* deviceName,\n unsigned int threadLimit,\n uint3* tid,\n uint3* bid,\n dim3* blockDim,\n dim3* gridDim,\n int* wSize)\n{\n std::vector functions{g_deviceCnt};\n\n for (int deviceId = 0; deviceId < g_deviceCnt; ++deviceId) {\n hipFunction_t function;\n if (hipSuccess == hipModuleGetFunction(&function, modules->at(deviceId), deviceName)) {\n functions[deviceId] = function;\n }\n }\n\n g_functions.insert(std::make_pair(hostFunction, std::move(functions)));\n}\n\nextern \"C\" void __hipRegisterVar(\n std::vector* modules,\n char* hostVar,\n char* deviceVar,\n const char* deviceName,\n int ext,\n int size,\n int constant,\n int global)\n{\n}\n\nextern \"C\" void __hipUnregisterFatBinary(std::vector* modules)\n{\n std::for_each(modules->begin(), modules->end(), [](hipModule_t module){ delete module; });\n delete modules;\n}\n\nhipError_t hipConfigureCall(\n dim3 gridDim,\n dim3 blockDim,\n size_t sharedMem,\n hipStream_t stream)\n{\n auto ctx = ihipGetTlsDefaultCtx();\n LockedAccessor_CtxCrit_t crit(ctx->criticalData());\n\n crit->_execStack.push(ihipExec_t{gridDim, blockDim, sharedMem, stream});\n return hipSuccess;\n}\n\nhipError_t hipSetupArgument(\n const void *arg,\n size_t size,\n size_t offset)\n{\n auto ctx = ihipGetTlsDefaultCtx();\n LockedAccessor_CtxCrit_t crit(ctx->criticalData());\n auto& arguments = crit->_execStack.top()._arguments;\n\n if (arguments.size() < offset + size) {\n arguments.resize(offset + size);\n }\n\n ::memcpy(&arguments[offset], arg, size);\n return hipSuccess;\n}\n\nhipError_t hipLaunchByPtr(const void *hostFunction)\n{\n ihipExec_t exec;\n {\n auto ctx = ihipGetTlsDefaultCtx();\n LockedAccessor_CtxCrit_t crit(ctx->criticalData());\n exec = std::move(crit->_execStack.top());\n crit->_execStack.pop();\n }\n\n int deviceId;\n if (exec._hStream) {\n deviceId = exec._hStream->getDevice()->_deviceId;\n }\n else if (ihipGetTlsDefaultCtx() && ihipGetTlsDefaultCtx()->getDevice()) {\n deviceId = ihipGetTlsDefaultCtx()->getDevice()->_deviceId;\n }\n else {\n deviceId = 0;\n }\n\n decltype(g_functions)::iterator it;\n if ((it = g_functions.find(hostFunction)) == g_functions.end())\n return hipErrorUnknown;\n\n size_t size = exec._arguments.size();\n void *extra[] = {\n HIP_LAUNCH_PARAM_BUFFER_POINTER, &exec._arguments[0],\n HIP_LAUNCH_PARAM_BUFFER_SIZE, &size,\n HIP_LAUNCH_PARAM_END\n };\n\n return hipModuleLaunchKernel(it->second[deviceId],\n exec._gridDim.x, exec._gridDim.y, exec._gridDim.z,\n exec._blockDim.x, exec._blockDim.y, exec._blockDim.z,\n exec._sharedMem, exec._hStream, nullptr, extra);\n}\n\nAdding checks and debug output for fat binary for hip-clang\/*\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 \n#include \n\n#include \"hip\/hip_runtime.h\"\n#include \"hip_hcc_internal.h\"\n#include \"trace_helper.h\"\n\nconstexpr unsigned __hipFatMAGIC2 = 0x48495046; \/\/ \"HIPF\"\n\n#define CLANG_OFFLOAD_BUNDLER_MAGIC \"__CLANG_OFFLOAD_BUNDLE__\"\n#define AMDGCN_AMDHSA_TRIPLE \"hip-amdgcn-amd-amdhsa\"\n\nstruct __ClangOffloadBundleDesc {\n uint64_t offset;\n uint64_t size;\n uint64_t tripleSize;\n const char triple[1];\n};\n\nstruct __ClangOffloadBundleHeader {\n const char magic[sizeof(CLANG_OFFLOAD_BUNDLER_MAGIC) - 1];\n uint64_t numBundles;\n __ClangOffloadBundleDesc desc[1];\n};\n\nstruct __CudaFatBinaryWrapper {\n unsigned int magic;\n unsigned int version;\n __ClangOffloadBundleHeader* binary;\n void* unused;\n};\n\n\nextern \"C\" std::vector*\n__hipRegisterFatBinary(const void* data)\n{\n HIP_INIT();\n\n tprintf(DB_FB, \"Enter __hipRegisterFatBinary(%p)\\n\", data);\n const __CudaFatBinaryWrapper* fbwrapper = reinterpret_cast(data);\n if (fbwrapper->magic != __hipFatMAGIC2 || fbwrapper->version != 1) {\n return nullptr;\n }\n\n const __ClangOffloadBundleHeader* header = fbwrapper->binary;\n std::string magic(reinterpret_cast(header), sizeof(CLANG_OFFLOAD_BUNDLER_MAGIC) - 1);\n if (magic.compare(CLANG_OFFLOAD_BUNDLER_MAGIC)) {\n return nullptr;\n }\n\n auto modules = new std::vector{g_deviceCnt};\n if (!modules) {\n return nullptr;\n }\n\n const __ClangOffloadBundleDesc* desc = &header->desc[0];\n for (uint64_t i = 0; i < header->numBundles; ++i,\n desc = reinterpret_cast(\n reinterpret_cast(&desc->triple[0]) + desc->tripleSize)) {\n\n std::string triple{&desc->triple[0], sizeof(AMDGCN_AMDHSA_TRIPLE) - 1};\n if (triple.compare(AMDGCN_AMDHSA_TRIPLE))\n continue;\n\n std::string target{&desc->triple[sizeof(AMDGCN_AMDHSA_TRIPLE)],\n desc->tripleSize - sizeof(AMDGCN_AMDHSA_TRIPLE)};\n tprintf(DB_FB, \"Found bundle for %s\\n\", target.c_str());\n\n for (int deviceId = 0; deviceId < g_deviceCnt; ++deviceId) {\n hsa_agent_t agent = g_allAgents[deviceId + 1];\n\n char name[64] = {};\n hsa_agent_get_info(agent, HSA_AGENT_INFO_NAME, name);\n if (target.compare(name)) {\n continue;\n }\n\n ihipModule_t* module = new ihipModule_t;\n if (!module) {\n continue;\n }\n\n hsa_executable_create_alt(HSA_PROFILE_FULL, HSA_DEFAULT_FLOAT_ROUNDING_MODE_DEFAULT, nullptr,\n &module->executable);\n\n std::string image{reinterpret_cast(\n reinterpret_cast(header) + desc->offset), desc->size};\n module->executable = hip_impl::load_executable(image, module->executable, agent);\n\n if (module->executable.handle) {\n modules->at(deviceId) = module;\n tprintf(DB_FB, \"Loaded code object for %s\\n\", name);\n } else {\n fprintf(stderr, \"Failed to load code object for %s\\n\", name);\n abort();\n }\n }\n }\n\n for (int deviceId = 0; deviceId < g_deviceCnt; ++deviceId) {\n hsa_agent_t agent = g_allAgents[deviceId + 1];\n\n char name[64] = {};\n hsa_agent_get_info(agent, HSA_AGENT_INFO_NAME, name);\n if (!(*modules)[deviceId]) {\n fprintf(stderr, \"No device code bundle for %s\\n\", name);\n abort();\n }\n }\n\n tprintf(DB_FB, \"__hipRegisterFatBinary succeeds and returns %p\\n\", modules);\n return modules;\n}\n\nstd::map> g_functions;\n\nextern \"C\" void __hipRegisterFunction(\n std::vector* modules,\n const void* hostFunction,\n char* deviceFunction,\n const char* deviceName,\n unsigned int threadLimit,\n uint3* tid,\n uint3* bid,\n dim3* blockDim,\n dim3* gridDim,\n int* wSize)\n{\n HIP_INIT_API(modules, hostFunction, deviceFunction, deviceName);\n std::vector functions{g_deviceCnt};\n\n assert(modules && modules->size() >= g_deviceCnt);\n for (int deviceId = 0; deviceId < g_deviceCnt; ++deviceId) {\n hipFunction_t function;\n if (hipSuccess == hipModuleGetFunction(&function, modules->at(deviceId), deviceName)) {\n functions[deviceId] = function;\n }\n else {\n tprintf(DB_FB, \"missing kernel %s for device %d\\n\", deviceName, deviceId);\n }\n }\n\n g_functions.insert(std::make_pair(hostFunction, std::move(functions)));\n}\n\nextern \"C\" void __hipRegisterVar(\n std::vector* modules,\n char* hostVar,\n char* deviceVar,\n const char* deviceName,\n int ext,\n int size,\n int constant,\n int global)\n{\n}\n\nextern \"C\" void __hipUnregisterFatBinary(std::vector* modules)\n{\n std::for_each(modules->begin(), modules->end(), [](hipModule_t module){ delete module; });\n delete modules;\n}\n\nhipError_t hipConfigureCall(\n dim3 gridDim,\n dim3 blockDim,\n size_t sharedMem,\n hipStream_t stream)\n{\n auto ctx = ihipGetTlsDefaultCtx();\n LockedAccessor_CtxCrit_t crit(ctx->criticalData());\n\n crit->_execStack.push(ihipExec_t{gridDim, blockDim, sharedMem, stream});\n return hipSuccess;\n}\n\nhipError_t hipSetupArgument(\n const void *arg,\n size_t size,\n size_t offset)\n{\n HIP_INIT_API(arg, size, offset);\n auto ctx = ihipGetTlsDefaultCtx();\n LockedAccessor_CtxCrit_t crit(ctx->criticalData());\n auto& arguments = crit->_execStack.top()._arguments;\n\n if (arguments.size() < offset + size) {\n arguments.resize(offset + size);\n }\n\n ::memcpy(&arguments[offset], arg, size);\n return hipSuccess;\n}\n\nhipError_t hipLaunchByPtr(const void *hostFunction)\n{\n HIP_INIT_API(hostFunction);\n ihipExec_t exec;\n {\n auto ctx = ihipGetTlsDefaultCtx();\n LockedAccessor_CtxCrit_t crit(ctx->criticalData());\n exec = std::move(crit->_execStack.top());\n crit->_execStack.pop();\n }\n\n int deviceId;\n if (exec._hStream) {\n deviceId = exec._hStream->getDevice()->_deviceId;\n }\n else if (ihipGetTlsDefaultCtx() && ihipGetTlsDefaultCtx()->getDevice()) {\n deviceId = ihipGetTlsDefaultCtx()->getDevice()->_deviceId;\n }\n else {\n deviceId = 0;\n }\n\n hipError_t e = hipSuccess;\n decltype(g_functions)::iterator it;\n if ((it = g_functions.find(hostFunction)) == g_functions.end()) {\n e = hipErrorUnknown;\n fprintf(stderr, \"kernel %p not found!\\n\", hostFunction);\n abort();\n } else {\n size_t size = exec._arguments.size();\n void *extra[] = {\n HIP_LAUNCH_PARAM_BUFFER_POINTER, &exec._arguments[0],\n HIP_LAUNCH_PARAM_BUFFER_SIZE, &size,\n HIP_LAUNCH_PARAM_END\n };\n\n e = hipModuleLaunchKernel(it->second[deviceId],\n exec._gridDim.x, exec._gridDim.y, exec._gridDim.z,\n exec._blockDim.x, exec._blockDim.y, exec._blockDim.z,\n exec._sharedMem, exec._hStream, nullptr, extra);\n }\n\n return ihipLogStatus(e);\n}\n\n<|endoftext|>"} {"text":"#ifndef STAN_MATH_REV_FUN_REP_MATRIX_HPP\n#define STAN_MATH_REV_FUN_REP_MATRIX_HPP\n\n#include \n#include \n#include \n\nnamespace stan {\nnamespace math {\n\ntemplate <>\ninline auto rep_matrix<\n double, var_value>>(\n const double& x, int m, int n) {\n check_nonnegative(\"rep_matrix\", \"rows\", m);\n check_nonnegative(\"rep_matrix\", \"cols\", n);\n using eig_mat = Eigen::Matrix;\n return var_value(eig_mat::Constant(m, n, x));\n}\n\ntemplate <>\ninline auto rep_matrix<\n var, var_value>>(\n const var& x, int m, int n) {\n check_nonnegative(\"rep_matrix\", \"rows\", m);\n check_nonnegative(\"rep_matrix\", \"cols\", n);\n using eig_mat = Eigen::Matrix;\n return make_callback_var(\n eig_mat::Constant(m, n, x.val()),\n [x](auto& rep) mutable { x.adj() += rep.adj().sum(); });\n}\n\n} \/\/ namespace math\n} \/\/ namespace stan\n\n#endif\nfix headers#ifndef STAN_MATH_REV_FUN_REP_MATRIX_HPP\n#define STAN_MATH_REV_FUN_REP_MATRIX_HPP\n\n#include \n#include \n#include \n#include \n#include \n\n\nnamespace stan {\nnamespace math {\n\ntemplate <>\ninline auto rep_matrix>>(const double& x, int m, int n) {\n check_nonnegative(\"rep_matrix\", \"rows\", m);\n check_nonnegative(\"rep_matrix\", \"cols\", n);\n using eig_mat = Eigen::Matrix;\n return var_value(eig_mat::Constant(m, n, x));\n}\n\ntemplate <>\ninline auto rep_matrix>>(const var& x, int m, int n) {\n check_nonnegative(\"rep_matrix\", \"rows\", m);\n check_nonnegative(\"rep_matrix\", \"cols\", n);\n using eig_mat = Eigen::Matrix;\n return make_callback_var(eig_mat::Constant(m, n, x.val()), [x](auto& rep) mutable {\n x.adj() += rep.adj().sum();\n });\n}\n\n} \/\/ namespace math\n} \/\/ namespace stan\n\n#endif\n<|endoftext|>"} {"text":"\/* 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: image_util.cc 70 2004-11-25 22:09:48Z artem $\n\n#include \n#include \n#include \n#include \"graphics.hh\"\n#include \"image_util.hh\"\n#include \"memory.hh\"\nnamespace mapnik\n{\n\n \/\/use memory manager for mem allocation in libpng\n\n png_voidp malloc_fn(png_structp png_ptr,png_size_t size)\n {\n return Object::operator new(size);\n }\n void free_fn(png_structp png_ptr, png_voidp ptr)\n {\n Object::operator delete(ptr);\n }\n \/\/\n void ImageUtils::save_to_file(const std::string& filename,const std::string& type,const Image32& image)\n {\n\t\/\/all that should go into image_writer factory\n if (type==\"png\")\n {\n save_as_png(filename,image);\n } \n\telse if (type==\"jpeg\")\n\t{\n\t save_as_jpeg(filename,85,image);\n\t}\n }\n\n void ImageUtils::save_as_png(const std::string& filename,const Image32& image)\n {\n FILE *fp=fopen(filename.c_str(), \"wb\");\n if (!fp) return;\n png_voidp mem_ptr=0;\n png_structp png_ptr=png_create_write_struct(PNG_LIBPNG_VER_STRING,\n\t\t\t\t\t\t (png_voidp)mem_ptr,0, 0);\n\t\n if (!png_ptr) return;\n png_set_mem_fn(png_ptr,mem_ptr,malloc_fn,free_fn);\n\n \/\/ switch on optimization\n#if defined(PNG_LIBPNG_VER) && (PNG_LIBPNG_VER >= 10200)\n png_uint_32 mask, flags;\n\n flags = png_get_asm_flags(png_ptr);\n mask = png_get_asm_flagmask(PNG_SELECT_READ | PNG_SELECT_WRITE);\n png_set_asm_flags(png_ptr, flags | mask);\n#endif\n\n png_infop info_ptr = png_create_info_struct(png_ptr);\n if (!info_ptr)\n {\n png_destroy_write_struct(&png_ptr,(png_infopp)0);\n fclose(fp);\n return;\n }\n if (setjmp(png_jmpbuf(png_ptr)))\n {\n png_destroy_write_struct(&png_ptr, &info_ptr);\n fclose(fp);\n return;\n }\n\n png_init_io(png_ptr, fp);\n png_set_IHDR(png_ptr, info_ptr,image.width(),image.height(),8,\n PNG_COLOR_TYPE_RGB_ALPHA,PNG_INTERLACE_NONE,\n PNG_COMPRESSION_TYPE_DEFAULT,PNG_FILTER_TYPE_DEFAULT);\n png_write_info(png_ptr, info_ptr);\n\n const ImageData32& imageData=image.data();\n\n for (int i=0;i>8)&0xff;\n\t\trow[index++]=(imageRow[i]>>16)&0xff;\n\t }\n\t row_pointer[0] = &row[0];\n\t (void) jpeg_write_scanlines(&cinfo, row_pointer, 1);\n\t}\n\tdelete [] row;\n\tjpeg_finish_compress(&cinfo);\n\tfclose(fp);\n\tjpeg_destroy_compress(&cinfo);\n }\n}\ncomment out optimization and png_set_filter (png_ptr, 0, PNG_FILTER_NONE)\/* 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#include \n#include \n#include \n#include \"graphics.hh\"\n#include \"image_util.hh\"\n#include \"memory.hh\"\nnamespace mapnik\n{\n\n \/\/use memory manager for mem allocation in libpng\n\n png_voidp malloc_fn(png_structp png_ptr,png_size_t size)\n {\n return Object::operator new(size);\n }\n void free_fn(png_structp png_ptr, png_voidp ptr)\n {\n Object::operator delete(ptr);\n }\n \/\/\n void ImageUtils::save_to_file(const std::string& filename,const std::string& type,const Image32& image)\n {\n\t\/\/all that should go into image_writer factory\n if (type==\"png\")\n {\n save_as_png(filename,image);\n } \n\telse if (type==\"jpeg\")\n\t{\n\t save_as_jpeg(filename,85,image);\n\t}\n }\n\n void ImageUtils::save_as_png(const std::string& filename,const Image32& image)\n {\n FILE *fp=fopen(filename.c_str(), \"wb\");\n if (!fp) return;\n png_voidp mem_ptr=0;\n png_structp png_ptr=png_create_write_struct(PNG_LIBPNG_VER_STRING,\n\t\t\t\t\t\t (png_voidp)mem_ptr,0, 0);\n\t\n if (!png_ptr) return;\n png_set_mem_fn(png_ptr,mem_ptr,malloc_fn,free_fn);\n\n \/\/ switch on optimization\n\t\/\/#if defined(PNG_LIBPNG_VER) && (PNG_LIBPNG_VER >= 10200)\n \/\/png_uint_32 mask, flags;\n\n \/\/flags = png_get_asm_flags(png_ptr);\n \/\/mask = png_get_asm_flagmask(PNG_SELECT_READ | PNG_SELECT_WRITE);\n \/\/png_set_asm_flags(png_ptr, flags | mask);\n\t\/\/#endif\n\tpng_set_filter (png_ptr, 0, PNG_FILTER_NONE);\n png_infop info_ptr = png_create_info_struct(png_ptr);\n if (!info_ptr)\n {\n png_destroy_write_struct(&png_ptr,(png_infopp)0);\n fclose(fp);\n return;\n }\n if (setjmp(png_jmpbuf(png_ptr)))\n {\n png_destroy_write_struct(&png_ptr, &info_ptr);\n fclose(fp);\n return;\n }\n\n png_init_io(png_ptr, fp);\n png_set_IHDR(png_ptr, info_ptr,image.width(),image.height(),8,\n PNG_COLOR_TYPE_RGB_ALPHA,PNG_INTERLACE_NONE,\n PNG_COMPRESSION_TYPE_DEFAULT,PNG_FILTER_TYPE_DEFAULT);\n png_write_info(png_ptr, info_ptr);\n\n const ImageData32& imageData=image.data();\n\n for (int i=0;i>8)&0xff;\n\t\trow[index++]=(imageRow[i]>>16)&0xff;\n\t }\n\t row_pointer[0] = &row[0];\n\t (void) jpeg_write_scanlines(&cinfo, row_pointer, 1);\n\t}\n\tdelete [] row;\n\tjpeg_finish_compress(&cinfo);\n\tfclose(fp);\n\tjpeg_destroy_compress(&cinfo);\n }\n}\n<|endoftext|>"} {"text":"#pragma once\n#include \"includes.hpp\"\n#include \"tabs.hpp\"\n#include \"interpreter.hpp\"\n#include \"layout.hpp\"\n#include \"playback.hpp\"\n\nclass user_interface : public Component {\n\tstd::map> components;\n\tComponent *mainComponent;\n\tbase::lisp ≷\n\npublic:\n\tuser_interface(base::lisp &glisp) : mainComponent(nullptr), gl(glisp) {}\n\t~user_interface() {}\n\n\tvoid resized() override {\n\t\tif (mainComponent)\n\t\t\tmainComponent->setBounds(getLocalBounds());\n\t}\n\n\t\/\/ (set-main-component name) -> bool\n\tbase::cell_t set_main_component(base::cell_t c, base::cells_t &ret) {\n\t\tif (base::lisp::validate(c, base::cell::list(1), base::cell::typeIdentifier)) {\n\t\t\tconst auto &name = c + 1;\n\t\t\tauto cc = components.find(name->s);\n\t\t\tif (cc != components.end()) {\n\t\t\t\tmainComponent = cc->second.get();\n\t\t\t\taddAndMakeVisible(mainComponent);\n\t\t\t\tmainComponent->setBounds(getLocalBounds());\n\t\t\t\treturn gl.t();\n\t\t\t}\n\t\t\tgl.signalError(\"component not found\");\n\t\t\treturn gl.nil();\n\t\t}\n\t\tgl.signalError(\"set-main-component: invalid arguments, expected (id)\");\n\t\treturn gl.nil();\n\t}\n\n\t\/\/ (refresh-interface)\n\tbase::cell_t refresh_interface(base::cell_t c, base::cells_t &ret) {\n\t\t\/\/ signal to all components resized event (to refresh UI)\n\t\tfor (auto &c : components)\n\t\t\tc.second->resized();\n\t\treturn gl.t();\n\t}\n\n\t\/\/ (create-playlist name) -> bool\/id\n\tbase::cell_t create_playlist(base::cell_t c, base::cells_t &ret) {\n\t\tif (base::lisp::validate(c, base::cell::list(1), base::cell::typeIdentifier)) {\n\t\t\tconst auto &name = c + 1;\n\t\t\tif (components.find(name->s) == components.end()) {\n\t\t\t\tcomponents.insert(std::make_pair(name->s, std::make_unique()));\n\t\t\t\treturn name;\n\t\t\t}\n\t\t\tgl.signalError(base::strs(\"component named \", name->s, \" already exists\"));\n\t\t\treturn gl.nil();\n\t\t}\n\t\tgl.signalError(\"create-playlist: invalid arguments, expected (id)\");\n\t\treturn gl.nil();\n\t}\n\n\t\/\/ (create-tabs name 'orientation{top, bottom, left, right}) -> bool\/id\n\tbase::cell_t create_tabs(base::cell_t c, base::cells_t &ret) {\n\t\tusing namespace base;\n\t\tif (lisp::validate(c, cell::list(2), cell::typeIdentifier, cell::typeIdentifier)) {\n\t\t\tconst auto &name = c + 1;\n\t\t\tif (components.find(name->s) == components.end()) {\n\t\t\t\tconst auto &orientation = c + 2;\n\t\t\t\tTabbedButtonBar::Orientation o = TabbedButtonBar::TabsAtTop;\n\t\t\t\tif (orientation->s == \"bottom\")\n\t\t\t\t\to = TabbedButtonBar::TabsAtBottom;\n\t\t\t\telse if (orientation->s == \"left\")\n\t\t\t\t\to = TabbedButtonBar::TabsAtLeft;\n\t\t\t\telse if (orientation->s == \"right\")\n\t\t\t\t\to = TabbedButtonBar::TabsAtRight;\n\t\t\t\tcomponents.insert(std::make_pair(name->s, std::make_unique(o)));\n\t\t\t\treturn name;\n\t\t\t}\n\t\t\tgl.signalError(base::strs(\"component named \", name->s, \" already exists\"));\n\t\t\treturn gl.nil();\n\t\t}\n\t\tgl.signalError(\"create-tabs: invalid arguments, expected (id 'id)\");\n\t\treturn gl.nil();\n\t}\n\n\t\/\/ (create-audio-settings name)\n\tbase::cell_t create_audio_settings(base::cell_t c, base::cells_t &) {\n\t\tusing namespace base;\n\t\tif (lisp::validate(c, cell::list(1), cell::typeIdentifier)) {\n\t\t\tconst auto &name = c + 1;\n\t\t\tif (components.find(name->s) == components.end()) {\n\t\t\t\tcomponents.insert(std::make_pair(name->s, std::make_unique(\n\t\t\t\t\t\t\t\t\t\t\t\t\t playback::dm, 0, 256, 0, 256, false, false, true, false)));\n\t\t\t\treturn gl.t();\n\t\t\t}\n\t\t\tgl.signalError(strs(\"components named \", name->s, \" already exists\"));\n\t\t\treturn gl.nil();\n\t\t}\n\t\tgl.signalError(\"create-audio-settings: invalid arguments, expected (id)\");\n\t\treturn gl.nil();\n\t}\n\n\t\/\/ (tabs-add-component tabs-name component-name \"caption\" |color|) -> bool\n\tbase::cell_t tabs_add_component(base::cell_t c, base::cells_t &ret) {\n\t\tusing namespace base;\n\t\tif (lisp::validate(c, cell::list(4), cell::typeIdentifier, cell::typeIdentifier, cell::typeString, cell::typeVector)) {\n\t\t\tconst auto &name = c + 1;\n\t\t\tconst auto &cname = c + 2;\n\t\t\tauto t = components.find(name->s);\n\t\t\tauto com = components.find(cname->s);\n\t\t\tif (t != components.end() && com != components.end()) {\n\t\t\t\tconst auto &caption = c + 3;\n\t\t\t\tconst auto &color = c + 4;\n\t\t\t\ttabs *ptabs = reinterpret_cast(t->second.get());\n\t\t\t\tptabs->addTab(caption->s, Colour::fromFloatRGBA(color->v4[0],\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tcolor->v4[1],\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tcolor->v4[2],\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tcolor->v4[3]), com->second.get(), false);\n\t\t\t\treturn gl.t();\n\t\t\t}\n\t\t\tgl.signalError(\"tabs or component not found\");\n\t\t\treturn gl.nil();\n\t\t}\n\t\tgl.signalError(\"tabs-add-component: invalid arguments, expected (id id \\\"string\\\" |vector|)\");\n\t\treturn gl.nil();\n\t}\n\n\t\/\/ (create-layout name (bool)horizontal) -> bool\/id\n\tbase::cell_t create_layout(base::cell_t c, base::cells_t &ret) {\n\t\tusing namespace base;\n\t\tif (lisp::validate(c, cell::list(2), cell::typeIdentifier, cell::typeIdentifier)) {\n\t\t\tconst auto &name = c + 1;\n\t\t\tconst auto &horizontal = c + 2;\n\t\t\tif (components.find(name->s) == components.end()) {\n\t\t\t\tcomponents.insert(std::make_pair(name->s, std::make_unique(!horizontal->isNil())));\n\t\t\t\treturn name;\n\t\t\t}\n\t\t\tgl.signalError(strs(\"component named \", name->s, \" already exists\"));\n\t\t\treturn gl.nil();\n\t\t}\n\t\tgl.signalError(\"create-layout: invalid arguments, expected (id bool)\");\n\t\treturn gl.nil();\n\t}\n\n\t\/\/ (create-interpreter name) -> bool\/id\n\tbase::cell_t create_interpreter(base::cell_t c, base::cells_t &ret) {\n\t\tif (base::lisp::validate(c, base::cell::list(1), base::cell::typeIdentifier)) {\n\t\t\tconst auto &name = c + 1;\n\t\t\tif (components.find(name->s) == components.end()) {\n\t\t\t\tcomponents.insert(std::make_pair(name->s, std::make_unique(gl)));\n\t\t\t\treturn name;\n\t\t\t}\n\t\t\tgl.signalError(base::strs(\"component named \", name->s, \" already exists\"));\n\t\t\treturn gl.nil();\n\t\t}\n\t\tgl.signalError(\"create-interpreter: invalid arguments, expected (id)\");\n\t\treturn gl.nil();\n\t}\n\n\t\/\/ (layout-add-component layout-id component-id (float)min (float)max (float)preffered) -> bool\n\tbase::cell_t layout_add_component(base::cell_t c, base::cells_t &ret) {\n\t\tusing namespace base;\n\t\tif (lisp::validate(c, cell::list(5),\n\t\t\t\t\t\t cell::typeIdentifier, cell::typeIdentifier,\n\t\t\t\t\t\t cell::typeFloat, cell::typeFloat, cell::typeFloat)) {\n\t\t\tconst auto &lname = c + 1;\n\t\t\tconst auto &cname = c + 2;\n\t\t\tauto l = components.find(lname->s);\n\t\t\tauto com = components.find(cname->s);\n\t\t\tif (l != components.end() && com != components.end()) {\n\t\t\t\tconst auto &minimum = c + 3;\n\t\t\t\tconst auto &maximum = c + 4;\n\t\t\t\tconst auto &preferred = c + 5;\n\t\t\t\tlayout *lay = reinterpret_cast(l->second.get());\n\t\t\t\tlay->addComponent(com->second.get(), (double)minimum->f, (double)maximum->f, (double)preferred->f);\n\t\t\t\treturn gl.t();\n\t\t\t}\n\t\t\tgl.signalError(\"layout or component not found\");\n\t\t\treturn gl.nil();\n\t\t}\n\t\tgl.signalError(\"layout-add-component: invalid arguments, expected (id, id, float, float, float)\");\n\t\treturn gl.nil();\n\t}\n\n\t\/\/ (layout-remove-component layout-id component-id) -> bool\n\tbase::cell_t layout_remove_component(base::cell_t c, base::cells_t &ret) {\n\t\tusing namespace base;\n\t\tif (lisp::validate(c, cell::list(2), cell::typeIdentifier, cell::typeIdentifier)) {\n\t\t\tconst auto &lname = c + 1;\n\t\t\tconst auto &cname = c + 2;\n\t\t\tauto l = components.find(lname->s);\n\t\t\tauto com = components.find(cname->s);\n\t\t\tif (l != components.end() && com != components.end()) {\n\t\t\t\tlayout *lay = reinterpret_cast(l->second.get());\n\t\t\t\tlay->removeComponent(com->second.get());\n\t\t\t\treturn gl.t();\n\t\t\t}\n\t\t\tgl.signalError(\"layout or component not found\");\n\t\t\treturn gl.nil();\n\t\t}\n\t\tgl.signalError(\"layout-remove-component: invalid arguments, expected (id id)\");\n\t\treturn gl.nil();\n\t}\n\n\t\/\/ (layout-remove-splitter layout-id (int)splitter-index)\n\tbase::cell_t layout_remove_splitter(base::cell_t c, base::cells_t &ret) {\n\t\tusing namespace base;\n\t\tif (lisp::validate(c, cell::list(2), cell::typeIdentifier, cell::typeInt)) {\n\t\t\tconst auto &lname = c + 1;\n\t\t\tauto l = components.find(lname->s);\n\t\t\tif (l != components.end()) {\n\t\t\t\tconst auto sIndex = c + 2;\n\t\t\t\tlayout *lay = reinterpret_cast(l->second.get());\n\t\t\t\tlay->removeSplitter(sIndex->i);\n\t\t\t\treturn gl.t();\n\t\t\t}\n\t\t\tgl.signalError(\"layout not found\");\n\t\t\treturn gl.nil();\n\t\t}\n\t\tgl.signalError(\"layout-remove-splitter: invalid arguments, expected (id int)\");\n\t\treturn gl.nil();\n\t}\n\n\t\/\/ (layout-add-splitter layout-id)\n\tbase::cell_t layout_add_splitter(base::cell_t c, base::cells_t &ret) {\n\t\tif (base::lisp::validate(c, base::cell::list(1), base::cell::typeIdentifier)) {\n\t\t\tconst auto &lname = c + 1;\n\t\t\tauto l = components.find(lname->s);\n\t\t\tif (l != components.end()) {\n\t\t\t\tlayout *lay = reinterpret_cast(l->second.get());\n\t\t\t\tlay->addSplitter();\n\t\t\t\treturn gl.t();\n\t\t\t}\n\t\t\tgl.signalError(\"layout not found\");\n\t\t\treturn gl.nil();\n\t\t}\n\t\tgl.signalError(\"layout-add-splitter: invalid arguments, expected (id)\");\n\t\treturn gl.nil();\n\t}\n\n\t\/\/ (layout-get-splitters-count layout-id)\n\tbase::cell_t layout_get_splitters_count(base::cell_t c, base::cells_t &ret) {\n\t\tusing namespace base;\n\t\tif (lisp::validate(c, cell::list(1), cell::typeIdentifier)) {\n\t\t\tconst auto &lname = c + 1;\n\t\t\tauto l = components.find(lname->s);\n\t\t\tif (l != components.end()) {\n\t\t\t\tlayout *lay = reinterpret_cast(l->second.get());\n\t\t\t\tret.push_back(base::cell(lay->getSplittersCount()));\n\t\t\t\treturn ret.end() - 1;\n\t\t\t\t\/\/ TODO: better return\n\t\t\t}\n\t\t\tgl.signalError(\"layout not found\");\n\t\t\treturn gl.nil();\n\t\t}\n\t\tgl.signalError(\"layout-get-splitters-count: invalid arguments, expected (id)\");\n\t\treturn gl.nil();\n\t}\n};\n+ cleanup warnings#pragma once\n#include \"includes.hpp\"\n#include \"tabs.hpp\"\n#include \"interpreter.hpp\"\n#include \"layout.hpp\"\n#include \"playback.hpp\"\n\nclass user_interface : public Component {\n\tstd::map> components;\n\tComponent *mainComponent;\n\tbase::lisp ≷\n\npublic:\n\tuser_interface(base::lisp &glisp) : mainComponent(nullptr), gl(glisp) {}\n\t~user_interface() {}\n\n\tvoid resized() override {\n\t\tif (mainComponent)\n\t\t\tmainComponent->setBounds(getLocalBounds());\n\t}\n\n\t\/\/ (set-main-component name) -> bool\n\tbase::cell_t set_main_component(base::cell_t c, base::cells_t &) {\n\t\tif (base::lisp::validate(c, base::cell::list(1), base::cell::typeIdentifier)) {\n\t\t\tconst auto &name = c + 1;\n\t\t\tauto cc = components.find(name->s);\n\t\t\tif (cc != components.end()) {\n\t\t\t\tmainComponent = cc->second.get();\n\t\t\t\taddAndMakeVisible(mainComponent);\n\t\t\t\tmainComponent->setBounds(getLocalBounds());\n\t\t\t\treturn gl.t();\n\t\t\t}\n\t\t\tgl.signalError(\"component not found\");\n\t\t\treturn gl.nil();\n\t\t}\n\t\tgl.signalError(\"set-main-component: invalid arguments, expected (id)\");\n\t\treturn gl.nil();\n\t}\n\n\t\/\/ (refresh-interface)\n\tbase::cell_t refresh_interface(base::cell_t, base::cells_t &) {\n\t\t\/\/ signal to all components resized event (to refresh UI)\n\t\tfor (auto &c : components)\n\t\t\tc.second->resized();\n\t\treturn gl.t();\n\t}\n\n\t\/\/ (create-playlist name) -> bool\/id\n\tbase::cell_t create_playlist(base::cell_t c, base::cells_t &) {\n\t\tif (base::lisp::validate(c, base::cell::list(1), base::cell::typeIdentifier)) {\n\t\t\tconst auto &name = c + 1;\n\t\t\tif (components.find(name->s) == components.end()) {\n\t\t\t\tcomponents.insert(std::make_pair(name->s, std::make_unique()));\n\t\t\t\treturn name;\n\t\t\t}\n\t\t\tgl.signalError(base::strs(\"component named \", name->s, \" already exists\"));\n\t\t\treturn gl.nil();\n\t\t}\n\t\tgl.signalError(\"create-playlist: invalid arguments, expected (id)\");\n\t\treturn gl.nil();\n\t}\n\n\t\/\/ (create-tabs name 'orientation{top, bottom, left, right}) -> bool\/id\n\tbase::cell_t create_tabs(base::cell_t c, base::cells_t &) {\n\t\tusing namespace base;\n\t\tif (lisp::validate(c, cell::list(2), cell::typeIdentifier, cell::typeIdentifier)) {\n\t\t\tconst auto &name = c + 1;\n\t\t\tif (components.find(name->s) == components.end()) {\n\t\t\t\tconst auto &orientation = c + 2;\n\t\t\t\tTabbedButtonBar::Orientation o = TabbedButtonBar::TabsAtTop;\n\t\t\t\tif (orientation->s == \"bottom\")\n\t\t\t\t\to = TabbedButtonBar::TabsAtBottom;\n\t\t\t\telse if (orientation->s == \"left\")\n\t\t\t\t\to = TabbedButtonBar::TabsAtLeft;\n\t\t\t\telse if (orientation->s == \"right\")\n\t\t\t\t\to = TabbedButtonBar::TabsAtRight;\n\t\t\t\tcomponents.insert(std::make_pair(name->s, std::make_unique(o)));\n\t\t\t\treturn name;\n\t\t\t}\n\t\t\tgl.signalError(base::strs(\"component named \", name->s, \" already exists\"));\n\t\t\treturn gl.nil();\n\t\t}\n\t\tgl.signalError(\"create-tabs: invalid arguments, expected (id 'id)\");\n\t\treturn gl.nil();\n\t}\n\n\t\/\/ (create-audio-settings name)\n\tbase::cell_t create_audio_settings(base::cell_t c, base::cells_t &) {\n\t\tusing namespace base;\n\t\tif (lisp::validate(c, cell::list(1), cell::typeIdentifier)) {\n\t\t\tconst auto &name = c + 1;\n\t\t\tif (components.find(name->s) == components.end()) {\n\t\t\t\tcomponents.insert(std::make_pair(name->s, std::make_unique(\n\t\t\t\t\t\t\t\t\t\t\t\t\t playback::dm, 0, 256, 0, 256, false, false, true, false)));\n\t\t\t\treturn gl.t();\n\t\t\t}\n\t\t\tgl.signalError(strs(\"components named \", name->s, \" already exists\"));\n\t\t\treturn gl.nil();\n\t\t}\n\t\tgl.signalError(\"create-audio-settings: invalid arguments, expected (id)\");\n\t\treturn gl.nil();\n\t}\n\n\t\/\/ (tabs-add-component tabs-name component-name \"caption\" |color|) -> bool\n\tbase::cell_t tabs_add_component(base::cell_t c, base::cells_t &) {\n\t\tusing namespace base;\n\t\tif (lisp::validate(c, cell::list(4), cell::typeIdentifier, cell::typeIdentifier, cell::typeString, cell::typeVector)) {\n\t\t\tconst auto &name = c + 1;\n\t\t\tconst auto &cname = c + 2;\n\t\t\tauto t = components.find(name->s);\n\t\t\tauto com = components.find(cname->s);\n\t\t\tif (t != components.end() && com != components.end()) {\n\t\t\t\tconst auto &caption = c + 3;\n\t\t\t\tconst auto &color = c + 4;\n\t\t\t\ttabs *ptabs = reinterpret_cast(t->second.get());\n\t\t\t\tptabs->addTab(caption->s, Colour::fromFloatRGBA(color->v4[0],\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tcolor->v4[1],\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tcolor->v4[2],\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tcolor->v4[3]), com->second.get(), false);\n\t\t\t\treturn gl.t();\n\t\t\t}\n\t\t\tgl.signalError(\"tabs or component not found\");\n\t\t\treturn gl.nil();\n\t\t}\n\t\tgl.signalError(\"tabs-add-component: invalid arguments, expected (id id \\\"string\\\" |vector|)\");\n\t\treturn gl.nil();\n\t}\n\n\t\/\/ (create-layout name (bool)horizontal) -> bool\/id\n\tbase::cell_t create_layout(base::cell_t c, base::cells_t &) {\n\t\tusing namespace base;\n\t\tif (lisp::validate(c, cell::list(2), cell::typeIdentifier, cell::typeIdentifier)) {\n\t\t\tconst auto &name = c + 1;\n\t\t\tconst auto &horizontal = c + 2;\n\t\t\tif (components.find(name->s) == components.end()) {\n\t\t\t\tcomponents.insert(std::make_pair(name->s, std::make_unique(!horizontal->isNil())));\n\t\t\t\treturn name;\n\t\t\t}\n\t\t\tgl.signalError(strs(\"component named \", name->s, \" already exists\"));\n\t\t\treturn gl.nil();\n\t\t}\n\t\tgl.signalError(\"create-layout: invalid arguments, expected (id bool)\");\n\t\treturn gl.nil();\n\t}\n\n\t\/\/ (create-interpreter name) -> bool\/id\n\tbase::cell_t create_interpreter(base::cell_t c, base::cells_t &) {\n\t\tif (base::lisp::validate(c, base::cell::list(1), base::cell::typeIdentifier)) {\n\t\t\tconst auto &name = c + 1;\n\t\t\tif (components.find(name->s) == components.end()) {\n\t\t\t\tcomponents.insert(std::make_pair(name->s, std::make_unique(gl)));\n\t\t\t\treturn name;\n\t\t\t}\n\t\t\tgl.signalError(base::strs(\"component named \", name->s, \" already exists\"));\n\t\t\treturn gl.nil();\n\t\t}\n\t\tgl.signalError(\"create-interpreter: invalid arguments, expected (id)\");\n\t\treturn gl.nil();\n\t}\n\n\t\/\/ (layout-add-component layout-id component-id (float)min (float)max (float)preffered) -> bool\n\tbase::cell_t layout_add_component(base::cell_t c, base::cells_t &) {\n\t\tusing namespace base;\n\t\tif (lisp::validate(c, cell::list(5),\n\t\t\t\t\t\t cell::typeIdentifier, cell::typeIdentifier,\n\t\t\t\t\t\t cell::typeFloat, cell::typeFloat, cell::typeFloat)) {\n\t\t\tconst auto &lname = c + 1;\n\t\t\tconst auto &cname = c + 2;\n\t\t\tauto l = components.find(lname->s);\n\t\t\tauto com = components.find(cname->s);\n\t\t\tif (l != components.end() && com != components.end()) {\n\t\t\t\tconst auto &minimum = c + 3;\n\t\t\t\tconst auto &maximum = c + 4;\n\t\t\t\tconst auto &preferred = c + 5;\n\t\t\t\tlayout *lay = reinterpret_cast(l->second.get());\n\t\t\t\tlay->addComponent(com->second.get(), (double)minimum->f, (double)maximum->f, (double)preferred->f);\n\t\t\t\treturn gl.t();\n\t\t\t}\n\t\t\tgl.signalError(\"layout or component not found\");\n\t\t\treturn gl.nil();\n\t\t}\n\t\tgl.signalError(\"layout-add-component: invalid arguments, expected (id, id, float, float, float)\");\n\t\treturn gl.nil();\n\t}\n\n\t\/\/ (layout-remove-component layout-id component-id) -> bool\n\tbase::cell_t layout_remove_component(base::cell_t c, base::cells_t &) {\n\t\tusing namespace base;\n\t\tif (lisp::validate(c, cell::list(2), cell::typeIdentifier, cell::typeIdentifier)) {\n\t\t\tconst auto &lname = c + 1;\n\t\t\tconst auto &cname = c + 2;\n\t\t\tauto l = components.find(lname->s);\n\t\t\tauto com = components.find(cname->s);\n\t\t\tif (l != components.end() && com != components.end()) {\n\t\t\t\tlayout *lay = reinterpret_cast(l->second.get());\n\t\t\t\tlay->removeComponent(com->second.get());\n\t\t\t\treturn gl.t();\n\t\t\t}\n\t\t\tgl.signalError(\"layout or component not found\");\n\t\t\treturn gl.nil();\n\t\t}\n\t\tgl.signalError(\"layout-remove-component: invalid arguments, expected (id id)\");\n\t\treturn gl.nil();\n\t}\n\n\t\/\/ (layout-remove-splitter layout-id (int)splitter-index)\n\tbase::cell_t layout_remove_splitter(base::cell_t c, base::cells_t &) {\n\t\tusing namespace base;\n\t\tif (lisp::validate(c, cell::list(2), cell::typeIdentifier, cell::typeInt)) {\n\t\t\tconst auto &lname = c + 1;\n\t\t\tauto l = components.find(lname->s);\n\t\t\tif (l != components.end()) {\n\t\t\t\tconst auto sIndex = c + 2;\n\t\t\t\tlayout *lay = reinterpret_cast(l->second.get());\n\t\t\t\tlay->removeSplitter(sIndex->i);\n\t\t\t\treturn gl.t();\n\t\t\t}\n\t\t\tgl.signalError(\"layout not found\");\n\t\t\treturn gl.nil();\n\t\t}\n\t\tgl.signalError(\"layout-remove-splitter: invalid arguments, expected (id int)\");\n\t\treturn gl.nil();\n\t}\n\n\t\/\/ (layout-add-splitter layout-id)\n\tbase::cell_t layout_add_splitter(base::cell_t c, base::cells_t &) {\n\t\tif (base::lisp::validate(c, base::cell::list(1), base::cell::typeIdentifier)) {\n\t\t\tconst auto &lname = c + 1;\n\t\t\tauto l = components.find(lname->s);\n\t\t\tif (l != components.end()) {\n\t\t\t\tlayout *lay = reinterpret_cast(l->second.get());\n\t\t\t\tlay->addSplitter();\n\t\t\t\treturn gl.t();\n\t\t\t}\n\t\t\tgl.signalError(\"layout not found\");\n\t\t\treturn gl.nil();\n\t\t}\n\t\tgl.signalError(\"layout-add-splitter: invalid arguments, expected (id)\");\n\t\treturn gl.nil();\n\t}\n\n\t\/\/ (layout-get-splitters-count layout-id)\n\tbase::cell_t layout_get_splitters_count(base::cell_t c, base::cells_t &ret) {\n\t\tusing namespace base;\n\t\tif (lisp::validate(c, cell::list(1), cell::typeIdentifier)) {\n\t\t\tconst auto &lname = c + 1;\n\t\t\tauto l = components.find(lname->s);\n\t\t\tif (l != components.end()) {\n\t\t\t\tlayout *lay = reinterpret_cast(l->second.get());\n\t\t\t\tret.push_back(base::cell(lay->getSplittersCount()));\n\t\t\t\treturn ret.end() - 1;\n\t\t\t\t\/\/ TODO: better return\n\t\t\t}\n\t\t\tgl.signalError(\"layout not found\");\n\t\t\treturn gl.nil();\n\t\t}\n\t\tgl.signalError(\"layout-get-splitters-count: invalid arguments, expected (id)\");\n\t\treturn gl.nil();\n\t}\n};\n<|endoftext|>"} {"text":"\/*******************************************************************************\n Infomap software package for multi-level network clustering\n Copyright (c) 2013, 2014 Daniel Edler, Anton Eriksson, Martin Rosvall\n\n This file is part of the Infomap software package.\n See file LICENSE_AGPLv3.txt for full license details.\n For more information, see \n ******************************************************************************\/\n\n#include \"Config.h\"\n#include \"ProgramInterface.h\"\n#include \"SafeFile.h\"\n#include \"..\/utils\/FileURI.h\"\n#include \"..\/utils\/Log.h\"\n#include \n#include \n\nnamespace infomap {\n\nconstexpr int FlowModel::undirected;\nconstexpr int FlowModel::directed;\nconstexpr int FlowModel::undirdir;\nconstexpr int FlowModel::outdirdir;\nconstexpr int FlowModel::rawdir;\n\nConfig::Config(const std::string& flags, bool isCLI) : isCLI(isCLI)\n{\n ProgramInterface api(\"Infomap\",\n \"Implementation of the Infomap clustering algorithm based on the Map Equation (see www.mapequation.org)\",\n INFOMAP_VERSION);\n\n api.setGroups({ \"Input\", \"Algorithm\", \"Accuracy\", \"Output\" });\n\n bool deprecated_includeSelfLinks = false;\n std::vector optionalOutputDir; \/\/ Used if !isCLI\n \/\/ --------------------- Input options ---------------------\n if (isCLI) {\n api.addNonOptionArgument(networkFile, \"network_file\", \"File containing the network data. Assumes a link list format if no Pajek formatted heading.\", \"Input\");\n } else {\n api.addOptionArgument(networkFile, \"input\", \"File containing the network data. Assumes a link list format if no Pajek formatted heading.\", ArgType::path, \"Input\");\n }\n\n api.addOptionArgument(skipAdjustBipartiteFlow, \"skip-adjust-bipartite-flow\", \"Skip distributing all flow from the bipartite nodes to the primary nodes.\", \"Input\", true);\n\n api.addOptionArgument(bipartiteTeleportation, \"bipartite-teleportation\", \"Teleport like the bipartite flow instead of two-step (unipartite) teleportation.\", \"Input\", true);\n\n api.addOptionArgument(weightThreshold, \"weight-threshold\", \"Limit the number of links to read from the network. Ignore links with less weight than the threshold.\", ArgType::number, \"Input\", true);\n\n api.addOptionArgument(deprecated_includeSelfLinks, 'k', \"include-self-links\", \"DEPRECATED. Include self links by default now, exclude with --no-self-links.\", \"Input\", true);\n\n api.addOptionArgument(noSelfLinks, \"no-self-links\", \"Exclude self links in the input network.\", \"Input\", true);\n\n api.addOptionArgument(nodeLimit, \"node-limit\", \"Limit the number of nodes to read from the network. Ignore links connected to ignored nodes.\", ArgType::integer, \"Input\", true);\n\n api.addOptionArgument(matchableMultilayerIds, \"matchable-multilayer-ids\", \"Construct state ids from node and layer ids that are consistent across networks for the same max number of layers. Set to at least the largest layer id among networks to match.\", ArgType::integer, \"Input\", true);\n\n api.addOptionArgument(clusterDataFile, 'c', \"cluster-data\", \"Provide an initial two-level (clu format) or multi-layer (tree format) solution.\", ArgType::path, \"Input\");\n\n api.addOptionArgument(assignToNeighbouringModule, \"assign-to-neighbouring-module\", \"Assign nodes without module assignments (from --cluster-data) to the module assignment of a neighbouring node if possible.\", \"Input\", true);\n\n api.addOptionArgument(metaDataFile, \"meta-data\", \"Provide meta data (clu format) that should be encoded.\", ArgType::path, \"Input\", true);\n\n api.addOptionArgument(metaDataRate, \"meta-data-rate\", \"Metadata encoding rate. Default is to encode each step.\", ArgType::number, \"Input\", true);\n\n api.addOptionArgument(unweightedMetaData, \"meta-data-unweighted\", \"Don't weight meta data by node flow.\", \"Input\", true);\n\n api.addOptionArgument(noInfomap, \"no-infomap\", \"Don't run the optimizer. Useful to calculate codelength of provided cluster data or to print non-modular statistics.\", \"Input\");\n\n \/\/ --------------------- Output options ---------------------\n\n api.addOptionArgument(outName, \"out-name\", \"Name for the output files, e.g. [output_directory]\/[out-name].tree\", ArgType::string, \"Output\", true);\n\n api.addOptionArgument(noFileOutput, '0', \"no-file-output\", \"Don't write output to file.\", \"Output\", true);\n\n api.addOptionArgument(printTree, \"tree\", \"Write a tree file with the modular hierarchy. Automatically enabled if no other output is specified.\", \"Output\");\n\n api.addOptionArgument(printFlowTree, \"ftree\", \"Write a ftree file with the modular hierarchy including aggregated links between (nested) modules. (Used by Network Navigator)\", \"Output\");\n\n api.addOptionArgument(printClu, \"clu\", \"Write a clu file with the top cluster ids for each node.\", \"Output\");\n\n api.addOptionArgument(cluLevel, \"clu-level\", \"For clu output, print modules at specified depth from root. Use -1 for bottom level modules.\", ArgType::integer, \"Output\", true);\n\n api.addOptionArgument(outputFormats, 'o', \"output\", \"Comma-separated output formats without spaces, e.g. -o clu,tree,ftree. Options: clu, tree, ftree, newick, json, csv, network, states, flow.\", ArgType::list, \"Output\", true);\n\n api.addOptionArgument(hideBipartiteNodes, \"hide-bipartite-nodes\", \"Project bipartite solution to unipartite.\", \"Output\", true);\n\n \/\/ --------------------- Core algorithm options ---------------------\n api.addOptionArgument(twoLevel, '2', \"two-level\", \"Optimize a two-level partition of the network. Default is multi-level.\", \"Algorithm\");\n\n std::string flowModelArg;\n\n api.addOptionArgument(flowModelArg, 'f', \"flow-model\", \"Specify flow model. Options: undirected, directed, undirdir, outdirdir, rawdir.\", ArgType::option, \"Algorithm\");\n\n api.addOptionArgument(directed, 'd', \"directed\", \"Assume directed links. Shorthand for '--flow-model directed'.\", \"Algorithm\");\n\n api.addOptionArgument(recordedTeleportation, 'e', \"recorded-teleportation\", \"If teleportation is used to calculate the flow, also record it when minimizing codelength.\", \"Algorithm\", true);\n\n api.addOptionArgument(useNodeWeightsAsFlow, \"use-node-weights-as-flow\", \"Use node weights (from api or after names in Pajek format) as flow, normalized to sum to 1\", \"Algorithm\", true);\n\n api.addOptionArgument(teleportToNodes, \"to-nodes\", \"Teleport to nodes instead of to links, assuming uniform node weights if no such input data.\", \"Algorithm\", true);\n\n api.addOptionArgument(teleportationProbability, 'p', \"teleportation-probability\", \"Probability of teleporting to a random node or link.\", ArgType::probability, \"Algorithm\", true);\n\n api.addOptionArgument(regularized, \"regularized\", \"Effectively add a fully connected Bayesian prior network to not overfit due to missing links. Implies recorded teleportation\", \"Algorithm\", true);\n\n api.addOptionArgument(regularizationStrength, \"regularization-strength\", \"Adjust relative strength of Bayesian prior network with this multiplier.\", ArgType::number, \"Algorithm\", true);\n\n api.addOptionArgument(entropyBiasCorrection, \"entropy-corrected\", \"Correct for negative entropy bias in small samples (many modules).\", \"Algorithm\", true);\n\n api.addOptionArgument(entropyBiasCorrectionMultiplier, \"entropy-correction-strength\", \"Increase or decrease the default entropy correction with this factor.\", ArgType::number, \"Algorithm\", true);\n\n api.addOptionArgument(markovTime, \"markov-time\", \"Scales link flow to change the cost of moving between modules. Higher values results in fewer modules.\", ArgType::number, \"Algorithm\", true);\n\n api.addOptionArgument(preferredNumberOfModules, \"preferred-number-of-modules\", \"Penalize solutions the more they differ from this number.\", ArgType::integer, \"Algorithm\", true);\n\n api.addOptionArgument(multilayerRelaxRate, \"multilayer-relax-rate\", \"Probability to relax the constraint to move only in the current layer.\", ArgType::probability, \"Algorithm\", true);\n\n api.addOptionArgument(multilayerRelaxLimit, \"multilayer-relax-limit\", \"Number of neighboring layers in each direction to relax to. If negative, relax to any layer.\", ArgType::integer, \"Algorithm\", true);\n\n api.addOptionArgument(multilayerRelaxLimitUp, \"multilayer-relax-limit-up\", \"Number of neighboring layers with higher id to relax to. If negative, relax to any layer.\", ArgType::integer, \"Algorithm\", true);\n\n api.addOptionArgument(multilayerRelaxLimitDown, \"multilayer-relax-limit-down\", \"Number of neighboring layers with lower id to relax to. If negative, relax to any layer.\", ArgType::integer, \"Algorithm\", true);\n\n api.addOptionArgument(multilayerRelaxByJensenShannonDivergence, \"multilayer-relax-by-jsd\", \"Relax proportional to the out-link similarity measured by the Jensen-Shannon divergence.\", \"Algorithm\", true);\n\n \/\/ --------------------- Performance and accuracy options ---------------------\n api.addOptionArgument(seedToRandomNumberGenerator, 's', \"seed\", \"A seed (integer) to the random number generator for reproducible results.\", ArgType::integer, \"Accuracy\");\n\n api.addOptionArgument(numTrials, 'N', \"num-trials\", \"Number of outer-most loops to run before picking the best solution.\", ArgType::integer, \"Accuracy\");\n\n api.addOptionArgument(coreLoopLimit, 'M', \"core-loop-limit\", \"Limit the number of loops that tries to move each node into the best possible module.\", ArgType::integer, \"Accuracy\", true);\n\n api.addOptionArgument(levelAggregationLimit, 'L', \"core-level-limit\", \"Limit the number of times the core loops are reapplied on existing modular network to search bigger structures.\", ArgType::integer, \"Accuracy\", true);\n\n api.addOptionArgument(tuneIterationLimit, 'T', \"tune-iteration-limit\", \"Limit the number of main iterations in the two-level partition algorithm. 0 means no limit.\", ArgType::integer, \"Accuracy\", true);\n\n api.addOptionArgument(minimumCodelengthImprovement, \"core-loop-codelength-threshold\", \"Minimum codelength threshold for accepting a new solution in core loop.\", ArgType::number, \"Accuracy\", true);\n\n api.addOptionArgument(minimumRelativeTuneIterationImprovement, \"tune-iteration-relative-threshold\", \"Set codelength improvement threshold of each new tune iteration to 'f' times the initial two-level codelength.\", ArgType::number, \"Accuracy\", true);\n\n api.addIncrementalOptionArgument(fastHierarchicalSolution, 'F', \"fast-hierarchical-solution\", \"Find top modules fast. Use -FF to keep all fast levels. Use -FFF to skip recursive part.\", \"Accuracy\", true);\n\n api.addOptionArgument(preferModularSolution, \"prefer-modular-solution\", \"Prefer modular solutions even if they are worse than putting all nodes in one module.\", \"Accuracy\", true);\n\n api.addOptionArgument(innerParallelization, \"inner-parallelization\", \"Parallelize the inner-most loop for greater speed. This may give some accuracy tradeoff.\", \"Accuracy\", true);\n\n api.addOptionalNonOptionArguments(optionalOutputDir, \"out_directory\", \"Directory to write the results to.\", \"Output\");\n\n api.addIncrementalOptionArgument(verbosity, 'v', \"verbose\", \"Verbose output on the console. Add additional 'v' flags to increase verbosity up to -vvv.\", \"Output\");\n\n api.addOptionArgument(silent, \"silent\", \"No output on the console.\", \"Output\");\n\n api.parseArgs(flags);\n\n if (deprecated_includeSelfLinks) {\n throw std::runtime_error(\"The --include-self-links flag is deprecated to include self links by default. Use --no-loops to exclude.\");\n }\n\n if (!optionalOutputDir.empty())\n outDirectory = optionalOutputDir[0];\n\n if (!isCLI && outDirectory.empty())\n noFileOutput = true;\n\n if (!noFileOutput && outDirectory.empty() && isCLI) {\n throw std::runtime_error(\"Missing out_directory\");\n }\n\n if (flowModelArg == \"directed\" || directed) {\n setFlowModel(FlowModel::directed);\n } else if (flowModelArg == \"undirected\") {\n setFlowModel(FlowModel::undirected);\n } else if (flowModelArg == \"undirdir\") {\n setFlowModel(FlowModel::undirdir);\n } else if (flowModelArg == \"outdirdir\") {\n setFlowModel(FlowModel::outdirdir);\n } else if (flowModelArg == \"rawdir\") {\n setFlowModel(FlowModel::rawdir);\n } else if (!flowModelArg.empty()) {\n throw std::runtime_error(\"Unrecognized flow model\");\n }\n\n if (regularized) {\n recordedTeleportation = true;\n }\n\n if (*--outDirectory.end() != '\/')\n outDirectory.append(\"\/\");\n\n if (haveOutput() && !isDirectoryWritable(outDirectory))\n throw std::runtime_error(io::Str() << \"Can't write to directory '\" << outDirectory << \"'. Check that the directory exists and that you have write permissions.\");\n\n if (outName.empty()) {\n outName = !networkFile.empty() ? FileURI(networkFile).getName() : \"no-name\";\n }\n\n parsedString = flags;\n parsedOptions = api.getUsedOptionArguments();\n\n adaptDefaults();\n\n Log::init(verbosity, silent, verboseNumberPrecision);\n}\n\nvoid Config::adaptDefaults()\n{\n auto outputs = io::split(outputFormats, ',');\n for (std::string& o : outputs) {\n if (o == \"clu\") {\n printClu = true;\n } else if (o == \"tree\") {\n printTree = true;\n } else if (o == \"ftree\") {\n printFlowTree = true;\n } else if (o == \"newick\") {\n printNewick = true;\n } else if (o == \"json\") {\n printJson = true;\n } else if (o == \"csv\") {\n printCsv = true;\n } else if (o == \"network\") {\n printPajekNetwork = true;\n } else if (o == \"flow\") {\n printFlowNetwork = true;\n } else if (o == \"states\") {\n printStateNetwork = true;\n } else {\n throw std::runtime_error(io::Str() << \"Unrecognized output format: '\" << o << \"'.\");\n }\n }\n\n \/\/ Of no output format specified, use tree as default (if not used as a library).\n if (isCLI && !haveModularResultOutput()) {\n printTree = true;\n }\n}\n\nstd::ostream& operator<<(std::ostream& out, FlowModel f)\n{\n return out << flowModelToString(f);\n}\n\n} \/\/ namespace infomap\nfix: Using deprecated option --include-self-links references missing option --no-loops\/*******************************************************************************\n Infomap software package for multi-level network clustering\n Copyright (c) 2013, 2014 Daniel Edler, Anton Eriksson, Martin Rosvall\n\n This file is part of the Infomap software package.\n See file LICENSE_AGPLv3.txt for full license details.\n For more information, see \n ******************************************************************************\/\n\n#include \"Config.h\"\n#include \"ProgramInterface.h\"\n#include \"SafeFile.h\"\n#include \"..\/utils\/FileURI.h\"\n#include \"..\/utils\/Log.h\"\n#include \n#include \n\nnamespace infomap {\n\nconstexpr int FlowModel::undirected;\nconstexpr int FlowModel::directed;\nconstexpr int FlowModel::undirdir;\nconstexpr int FlowModel::outdirdir;\nconstexpr int FlowModel::rawdir;\n\nConfig::Config(const std::string& flags, bool isCLI) : isCLI(isCLI)\n{\n ProgramInterface api(\"Infomap\",\n \"Implementation of the Infomap clustering algorithm based on the Map Equation (see www.mapequation.org)\",\n INFOMAP_VERSION);\n\n api.setGroups({ \"Input\", \"Algorithm\", \"Accuracy\", \"Output\" });\n\n bool deprecated_includeSelfLinks = false;\n std::vector optionalOutputDir; \/\/ Used if !isCLI\n \/\/ --------------------- Input options ---------------------\n if (isCLI) {\n api.addNonOptionArgument(networkFile, \"network_file\", \"File containing the network data. Assumes a link list format if no Pajek formatted heading.\", \"Input\");\n } else {\n api.addOptionArgument(networkFile, \"input\", \"File containing the network data. Assumes a link list format if no Pajek formatted heading.\", ArgType::path, \"Input\");\n }\n\n api.addOptionArgument(skipAdjustBipartiteFlow, \"skip-adjust-bipartite-flow\", \"Skip distributing all flow from the bipartite nodes to the primary nodes.\", \"Input\", true);\n\n api.addOptionArgument(bipartiteTeleportation, \"bipartite-teleportation\", \"Teleport like the bipartite flow instead of two-step (unipartite) teleportation.\", \"Input\", true);\n\n api.addOptionArgument(weightThreshold, \"weight-threshold\", \"Limit the number of links to read from the network. Ignore links with less weight than the threshold.\", ArgType::number, \"Input\", true);\n\n api.addOptionArgument(deprecated_includeSelfLinks, 'k', \"include-self-links\", \"DEPRECATED. Include self links by default now, exclude with --no-self-links.\", \"Input\", true);\n\n api.addOptionArgument(noSelfLinks, \"no-self-links\", \"Exclude self links in the input network.\", \"Input\", true);\n\n api.addOptionArgument(nodeLimit, \"node-limit\", \"Limit the number of nodes to read from the network. Ignore links connected to ignored nodes.\", ArgType::integer, \"Input\", true);\n\n api.addOptionArgument(matchableMultilayerIds, \"matchable-multilayer-ids\", \"Construct state ids from node and layer ids that are consistent across networks for the same max number of layers. Set to at least the largest layer id among networks to match.\", ArgType::integer, \"Input\", true);\n\n api.addOptionArgument(clusterDataFile, 'c', \"cluster-data\", \"Provide an initial two-level (clu format) or multi-layer (tree format) solution.\", ArgType::path, \"Input\");\n\n api.addOptionArgument(assignToNeighbouringModule, \"assign-to-neighbouring-module\", \"Assign nodes without module assignments (from --cluster-data) to the module assignment of a neighbouring node if possible.\", \"Input\", true);\n\n api.addOptionArgument(metaDataFile, \"meta-data\", \"Provide meta data (clu format) that should be encoded.\", ArgType::path, \"Input\", true);\n\n api.addOptionArgument(metaDataRate, \"meta-data-rate\", \"Metadata encoding rate. Default is to encode each step.\", ArgType::number, \"Input\", true);\n\n api.addOptionArgument(unweightedMetaData, \"meta-data-unweighted\", \"Don't weight meta data by node flow.\", \"Input\", true);\n\n api.addOptionArgument(noInfomap, \"no-infomap\", \"Don't run the optimizer. Useful to calculate codelength of provided cluster data or to print non-modular statistics.\", \"Input\");\n\n \/\/ --------------------- Output options ---------------------\n\n api.addOptionArgument(outName, \"out-name\", \"Name for the output files, e.g. [output_directory]\/[out-name].tree\", ArgType::string, \"Output\", true);\n\n api.addOptionArgument(noFileOutput, '0', \"no-file-output\", \"Don't write output to file.\", \"Output\", true);\n\n api.addOptionArgument(printTree, \"tree\", \"Write a tree file with the modular hierarchy. Automatically enabled if no other output is specified.\", \"Output\");\n\n api.addOptionArgument(printFlowTree, \"ftree\", \"Write a ftree file with the modular hierarchy including aggregated links between (nested) modules. (Used by Network Navigator)\", \"Output\");\n\n api.addOptionArgument(printClu, \"clu\", \"Write a clu file with the top cluster ids for each node.\", \"Output\");\n\n api.addOptionArgument(cluLevel, \"clu-level\", \"For clu output, print modules at specified depth from root. Use -1 for bottom level modules.\", ArgType::integer, \"Output\", true);\n\n api.addOptionArgument(outputFormats, 'o', \"output\", \"Comma-separated output formats without spaces, e.g. -o clu,tree,ftree. Options: clu, tree, ftree, newick, json, csv, network, states, flow.\", ArgType::list, \"Output\", true);\n\n api.addOptionArgument(hideBipartiteNodes, \"hide-bipartite-nodes\", \"Project bipartite solution to unipartite.\", \"Output\", true);\n\n \/\/ --------------------- Core algorithm options ---------------------\n api.addOptionArgument(twoLevel, '2', \"two-level\", \"Optimize a two-level partition of the network. Default is multi-level.\", \"Algorithm\");\n\n std::string flowModelArg;\n\n api.addOptionArgument(flowModelArg, 'f', \"flow-model\", \"Specify flow model. Options: undirected, directed, undirdir, outdirdir, rawdir.\", ArgType::option, \"Algorithm\");\n\n api.addOptionArgument(directed, 'd', \"directed\", \"Assume directed links. Shorthand for '--flow-model directed'.\", \"Algorithm\");\n\n api.addOptionArgument(recordedTeleportation, 'e', \"recorded-teleportation\", \"If teleportation is used to calculate the flow, also record it when minimizing codelength.\", \"Algorithm\", true);\n\n api.addOptionArgument(useNodeWeightsAsFlow, \"use-node-weights-as-flow\", \"Use node weights (from api or after names in Pajek format) as flow, normalized to sum to 1\", \"Algorithm\", true);\n\n api.addOptionArgument(teleportToNodes, \"to-nodes\", \"Teleport to nodes instead of to links, assuming uniform node weights if no such input data.\", \"Algorithm\", true);\n\n api.addOptionArgument(teleportationProbability, 'p', \"teleportation-probability\", \"Probability of teleporting to a random node or link.\", ArgType::probability, \"Algorithm\", true);\n\n api.addOptionArgument(regularized, \"regularized\", \"Effectively add a fully connected Bayesian prior network to not overfit due to missing links. Implies recorded teleportation\", \"Algorithm\", true);\n\n api.addOptionArgument(regularizationStrength, \"regularization-strength\", \"Adjust relative strength of Bayesian prior network with this multiplier.\", ArgType::number, \"Algorithm\", true);\n\n api.addOptionArgument(entropyBiasCorrection, \"entropy-corrected\", \"Correct for negative entropy bias in small samples (many modules).\", \"Algorithm\", true);\n\n api.addOptionArgument(entropyBiasCorrectionMultiplier, \"entropy-correction-strength\", \"Increase or decrease the default entropy correction with this factor.\", ArgType::number, \"Algorithm\", true);\n\n api.addOptionArgument(markovTime, \"markov-time\", \"Scales link flow to change the cost of moving between modules. Higher values results in fewer modules.\", ArgType::number, \"Algorithm\", true);\n\n api.addOptionArgument(preferredNumberOfModules, \"preferred-number-of-modules\", \"Penalize solutions the more they differ from this number.\", ArgType::integer, \"Algorithm\", true);\n\n api.addOptionArgument(multilayerRelaxRate, \"multilayer-relax-rate\", \"Probability to relax the constraint to move only in the current layer.\", ArgType::probability, \"Algorithm\", true);\n\n api.addOptionArgument(multilayerRelaxLimit, \"multilayer-relax-limit\", \"Number of neighboring layers in each direction to relax to. If negative, relax to any layer.\", ArgType::integer, \"Algorithm\", true);\n\n api.addOptionArgument(multilayerRelaxLimitUp, \"multilayer-relax-limit-up\", \"Number of neighboring layers with higher id to relax to. If negative, relax to any layer.\", ArgType::integer, \"Algorithm\", true);\n\n api.addOptionArgument(multilayerRelaxLimitDown, \"multilayer-relax-limit-down\", \"Number of neighboring layers with lower id to relax to. If negative, relax to any layer.\", ArgType::integer, \"Algorithm\", true);\n\n api.addOptionArgument(multilayerRelaxByJensenShannonDivergence, \"multilayer-relax-by-jsd\", \"Relax proportional to the out-link similarity measured by the Jensen-Shannon divergence.\", \"Algorithm\", true);\n\n \/\/ --------------------- Performance and accuracy options ---------------------\n api.addOptionArgument(seedToRandomNumberGenerator, 's', \"seed\", \"A seed (integer) to the random number generator for reproducible results.\", ArgType::integer, \"Accuracy\");\n\n api.addOptionArgument(numTrials, 'N', \"num-trials\", \"Number of outer-most loops to run before picking the best solution.\", ArgType::integer, \"Accuracy\");\n\n api.addOptionArgument(coreLoopLimit, 'M', \"core-loop-limit\", \"Limit the number of loops that tries to move each node into the best possible module.\", ArgType::integer, \"Accuracy\", true);\n\n api.addOptionArgument(levelAggregationLimit, 'L', \"core-level-limit\", \"Limit the number of times the core loops are reapplied on existing modular network to search bigger structures.\", ArgType::integer, \"Accuracy\", true);\n\n api.addOptionArgument(tuneIterationLimit, 'T', \"tune-iteration-limit\", \"Limit the number of main iterations in the two-level partition algorithm. 0 means no limit.\", ArgType::integer, \"Accuracy\", true);\n\n api.addOptionArgument(minimumCodelengthImprovement, \"core-loop-codelength-threshold\", \"Minimum codelength threshold for accepting a new solution in core loop.\", ArgType::number, \"Accuracy\", true);\n\n api.addOptionArgument(minimumRelativeTuneIterationImprovement, \"tune-iteration-relative-threshold\", \"Set codelength improvement threshold of each new tune iteration to 'f' times the initial two-level codelength.\", ArgType::number, \"Accuracy\", true);\n\n api.addIncrementalOptionArgument(fastHierarchicalSolution, 'F', \"fast-hierarchical-solution\", \"Find top modules fast. Use -FF to keep all fast levels. Use -FFF to skip recursive part.\", \"Accuracy\", true);\n\n api.addOptionArgument(preferModularSolution, \"prefer-modular-solution\", \"Prefer modular solutions even if they are worse than putting all nodes in one module.\", \"Accuracy\", true);\n\n api.addOptionArgument(innerParallelization, \"inner-parallelization\", \"Parallelize the inner-most loop for greater speed. This may give some accuracy tradeoff.\", \"Accuracy\", true);\n\n api.addOptionalNonOptionArguments(optionalOutputDir, \"out_directory\", \"Directory to write the results to.\", \"Output\");\n\n api.addIncrementalOptionArgument(verbosity, 'v', \"verbose\", \"Verbose output on the console. Add additional 'v' flags to increase verbosity up to -vvv.\", \"Output\");\n\n api.addOptionArgument(silent, \"silent\", \"No output on the console.\", \"Output\");\n\n api.parseArgs(flags);\n\n if (deprecated_includeSelfLinks) {\n throw std::runtime_error(\"The --include-self-links flag is deprecated to include self links by default. Use --no-self-links to exclude.\");\n }\n\n if (!optionalOutputDir.empty())\n outDirectory = optionalOutputDir[0];\n\n if (!isCLI && outDirectory.empty())\n noFileOutput = true;\n\n if (!noFileOutput && outDirectory.empty() && isCLI) {\n throw std::runtime_error(\"Missing out_directory\");\n }\n\n if (flowModelArg == \"directed\" || directed) {\n setFlowModel(FlowModel::directed);\n } else if (flowModelArg == \"undirected\") {\n setFlowModel(FlowModel::undirected);\n } else if (flowModelArg == \"undirdir\") {\n setFlowModel(FlowModel::undirdir);\n } else if (flowModelArg == \"outdirdir\") {\n setFlowModel(FlowModel::outdirdir);\n } else if (flowModelArg == \"rawdir\") {\n setFlowModel(FlowModel::rawdir);\n } else if (!flowModelArg.empty()) {\n throw std::runtime_error(\"Unrecognized flow model\");\n }\n\n if (regularized) {\n recordedTeleportation = true;\n }\n\n if (*--outDirectory.end() != '\/')\n outDirectory.append(\"\/\");\n\n if (haveOutput() && !isDirectoryWritable(outDirectory))\n throw std::runtime_error(io::Str() << \"Can't write to directory '\" << outDirectory << \"'. Check that the directory exists and that you have write permissions.\");\n\n if (outName.empty()) {\n outName = !networkFile.empty() ? FileURI(networkFile).getName() : \"no-name\";\n }\n\n parsedString = flags;\n parsedOptions = api.getUsedOptionArguments();\n\n adaptDefaults();\n\n Log::init(verbosity, silent, verboseNumberPrecision);\n}\n\nvoid Config::adaptDefaults()\n{\n auto outputs = io::split(outputFormats, ',');\n for (std::string& o : outputs) {\n if (o == \"clu\") {\n printClu = true;\n } else if (o == \"tree\") {\n printTree = true;\n } else if (o == \"ftree\") {\n printFlowTree = true;\n } else if (o == \"newick\") {\n printNewick = true;\n } else if (o == \"json\") {\n printJson = true;\n } else if (o == \"csv\") {\n printCsv = true;\n } else if (o == \"network\") {\n printPajekNetwork = true;\n } else if (o == \"flow\") {\n printFlowNetwork = true;\n } else if (o == \"states\") {\n printStateNetwork = true;\n } else {\n throw std::runtime_error(io::Str() << \"Unrecognized output format: '\" << o << \"'.\");\n }\n }\n\n \/\/ Of no output format specified, use tree as default (if not used as a library).\n if (isCLI && !haveModularResultOutput()) {\n printTree = true;\n }\n}\n\nstd::ostream& operator<<(std::ostream& out, FlowModel f)\n{\n return out << flowModelToString(f);\n}\n\n} \/\/ namespace infomap\n<|endoftext|>"} {"text":"#include\"all_defines.hpp\"\n\n#include\"aio.hpp\"\n\n#include\n#include\n#include\n#include\n\n\/\/ used for error reporting before aborting\n#include\n\n\/*\nPOSIX-based asynchronous I\/O and signal handling\n\nNote that we don't program to the letter of the POSIX\nspecs: AFAIK no actual OS conforms perfectly to POSIX.\nPreferably we try to be somewhat more resilient and\ntry to be more defensive when making system calls.\n*\/\n\n\/*self-pipe trick with SIGCHLD*\/\nstatic int sigchld_wr, sigchld_rd;\n\/*PLANNED (not yet implemented)\nWhen compiled single_threaded, signal handlers also\nwrite to sigchld_wr, in order to (hopefully!)\ninterrupt pending select()\/poll()'s. We don't depend\non this too much, because we will still raise flags\nsomewhere - we only depend on it to interrupt our\ncalls.\nWhen compiled without single_threaded, signals are\nblocked on all threads, then at initialization we\nstart a \"hidden\" thread whose sole purpose is to\nwait for signals.\n*\/\n\n\/*SIGCHLD Known issues:\nOn Linux < 2.4, each thread's child processes belonged\nonly to that thread; this meant (1) SIGCHLD gets sent\nexactly to the thread which launched that process, and\nnobody else, and (2) a thread couldn't waitpid() on any\nother thread's child process. Both behaviors are not\nPOSIX compliant. I also can't think of a way to handle\nthose properly, at least not with the fact that the\nevents system in `hl` may be launched from any of N\nworker threads.\n\nFor Linux >= 2.4, a thread could now waitpid() on other\nthread's child processes. However, AFAIK (can't find\nreferences regarding exact behavior) SIGCHLD is still\nsent to the launching thread.\n\nFor Linux >= 2.6, we have NPTL, which is supposedly\ncorrectly POSIX.\n\nThe code here *should* work on Linux 2.4, assuming that\nwrite() from multiple threads simultaneously gets\nproperly handled (locked!!) by the OS.\n*\/\n\nstatic void sigchld_handler(int) {\n\tssize_t rv;\n\tchar buf[1]; \/*exact data doesn't matter*\/\n\tdo {\n\t\terrno = 0;\n\t\trv = write(sigchld_wr, buf, 1);\n\t\t\/*our signal installer actually\n\t\tmasks out all other signals for\n\t\tthis handler, so we shouldn't get\n\t\tEINTR, but better safe than\n\t\tsorry...\n\t\t*\/\n\t} while(rv < 0 && errno == EINTR);\n\t\/*All other errors get ignored!*\/\n\t\/*Errors:\n\tEAGAIN\n\t\t- we *shouldn't* mark sigchld_wr as nonblocking\n\tEBADF\n\t\t- pretty bad problem, means we failed to init,\n\t\tbut we *do* check the pipe FD's at init time\n\t\tbefore we even install this sighandler.\n\tEFAULT\n\t\t- nasty, means buf is segfaultable, meaning we\n\t\tprobably can't return anyway.\n\tEFBIG\n\t\t- not writing to a file, just a pipe.\n\tEINTR\n\t\t- handled by restarting the call.\n\tEINVAL\n\t\t- pretty bad problem, means we failed to init\n\tEIO\n\t\t- not writing to a file, just a pipe.\n\tENOSPC\n\t\t- that's OK, we only care that there's data\n\t\ton the pipe to wake up the select() call\n\tEPIPE\n\t\t- will only happen when we're cleaning up\n\t\tand closing everything, so won't matter if\n\t\tsignal is lost, we're already exiting.\n\t*\/\n}\n\n\/*FD_CLOEXEC Known Issues:\nNormally FD's will remain open across fork() and exec() calls.\nThis is useful when piping. Unfortunately, we rarely even\nwant to use piping; almost definitely we will pipe only a few\nFD's.\n\nThus, in the general case, when acquiring FD's from the OS,\nwe must very soon force them to FD_CLOEXEC. However, this\nhas problems in a multithreaded implementation which fork()s.\nIt's possible for one thread to fork()+exec() while another\nthread has just, say, called socket(). In this case the\nreturned socket will *not* have FD_CLOEXEC and will remain\nopen in the child process, reducing the number of useable\nFD's in the process, as well as other weird stuff like tape\ndrives not rewinding...\n\nThis can be solved in many ways:\n1. Ignore CLOEXEC. After fork() and before exec(), close\neverything except for any redirections we want. This means\nabout sysconf(_SC_OPEN_MAX) calls to close(). Now suppose\n_SC_OPEN_MAX is 65,536...\n2. Like above. But we just keep closing until we get N\nconsecutive EBADF failures for close(), where N is some big\nnumber. Hackish solution which depends on the probability\nthat FD numbers will skip at most N consecutive values.\n3. Keep track of the largest ever FD we ever see from any\nsource. Just loop up to that instead of\nsysconf(_SC_OPEN_MAX), which should be faster because the\nlargest FD will be much smaller than _SC_OPEN_MAX. However\nwhen multithreaded we have to rely on locks to keep track\nof the largest seen FD anyway, so....\n4. Protect all open()+fcntl()\/socket()+fcntl\/pipe()+fcntl(),\nas well as fork(), with a mutex. While fork() will also\nduplicate the mutex in the child, we do an exec() soon\nanwyay, so the child's mutex copy gets implicitly deleted.\n\n#4 above seems the best solution but it *might* mean that\nsome LIBC and other third-party library routines can't be\nsafely used (since they would internally open some FD's,\nwhich we can't protect with a mutex).\n*\/\nstatic void force_cloexec(int fd) {\n\tint flag;\n\tdo {\n\t\terrno = 0;\n\t\tflag = fcntl(fd, F_GETFD);\n\t} while(flag < 0 && errno == EINTR);\n\tif(flag < 0) {\n\t\tstd::cerr << \"cloexec: error during getting of flag\"\n\t\t\t<< std::endl;\n\t\texit(1);\n\t}\n\tlong lflag = ((long) (flag)) | FD_CLOEXEC;\n\tint rv;\n\tdo {\n\t\terrno = 0;\n\t\trv = fcntl(fd, F_SETFD, lflag);\n\t} while(rv < 0 && errno == EINTR);\n\tif(flag < 0) {\n\t\tstd::cerr << \"cloexec: error during setting of flag\"\n\t\t\t<< std::endl;\n\t\texit(1);\n\t}\n}\n\n\nsrc\/ios_posix.cpp: Added initialization#include\"all_defines.hpp\"\n\n#include\"aio.hpp\"\n\n#include\n#include\n#include\n#include\n\n\/\/ used for error reporting before aborting\n#include\n\n\/*\nPOSIX-based asynchronous I\/O and signal handling\n\nNote that we don't program to the letter of the POSIX\nspecs: AFAIK no actual OS conforms perfectly to POSIX.\nPreferably we try to be somewhat more resilient and\ntry to be more defensive when making system calls.\n*\/\n\n\/*self-pipe trick with SIGCHLD*\/\nstatic int sigchld_wr, sigchld_rd;\n\/*PLANNED (not yet implemented)\nWhen compiled single_threaded, signal handlers also\nwrite to sigchld_wr, in order to (hopefully!)\ninterrupt pending select()\/poll()'s. We don't depend\non this too much, because we will still raise flags\nsomewhere - we only depend on it to interrupt our\ncalls.\nWhen compiled without single_threaded, signals are\nblocked on all threads, then at initialization we\nstart a \"hidden\" thread whose sole purpose is to\nwait for signals.\n*\/\n\n\/*SIGCHLD Known issues:\nOn Linux < 2.4, each thread's child processes belonged\nonly to that thread; this meant (1) SIGCHLD gets sent\nexactly to the thread which launched that process, and\nnobody else, and (2) a thread couldn't waitpid() on any\nother thread's child process. Both behaviors are not\nPOSIX compliant. I also can't think of a way to handle\nthose properly, at least not with the fact that the\nevents system in `hl` may be launched from any of N\nworker threads.\n\nFor Linux >= 2.4, a thread could now waitpid() on other\nthread's child processes. However, AFAIK (can't find\nreferences regarding exact behavior) SIGCHLD is still\nsent to the launching thread.\n\nFor Linux >= 2.6, we have NPTL, which is supposedly\ncorrectly POSIX.\n\nThe code here *should* work on Linux 2.4, assuming that\nwrite() from multiple threads simultaneously gets\nproperly handled (locked!!) by the OS.\n*\/\n\nstatic void sigchld_handler(int) {\n\tssize_t rv;\n\tchar buf[1]; \/*exact data doesn't matter*\/\n\tdo {\n\t\terrno = 0;\n\t\trv = write(sigchld_wr, buf, 1);\n\t\t\/*our signal installer actually\n\t\tmasks out all other signals for\n\t\tthis handler, so we shouldn't get\n\t\tEINTR, but better safe than\n\t\tsorry...\n\t\t*\/\n\t} while(rv < 0 && errno == EINTR);\n\t\/*All other errors get ignored!*\/\n\t\/*Errors:\n\tEAGAIN\n\t\t- we *shouldn't* mark sigchld_wr as nonblocking\n\tEBADF\n\t\t- pretty bad problem, means we failed to init,\n\t\tbut we *do* check the pipe FD's at init time\n\t\tbefore we even install this sighandler.\n\tEFAULT\n\t\t- nasty, means buf is segfaultable, meaning we\n\t\tprobably can't return anyway.\n\tEFBIG\n\t\t- not writing to a file, just a pipe.\n\tEINTR\n\t\t- handled by restarting the call.\n\tEINVAL\n\t\t- pretty bad problem, means we failed to init\n\tEIO\n\t\t- not writing to a file, just a pipe.\n\tENOSPC\n\t\t- that's OK, we only care that there's data\n\t\ton the pipe to wake up the select() call\n\tEPIPE\n\t\t- will only happen when we're cleaning up\n\t\tand closing everything, so won't matter if\n\t\tsignal is lost, we're already exiting.\n\t*\/\n}\n\n\/*empty signal handler, used for e.g. SIGPIPE*\/\nstatic void nihilistic_handler(int) { return; }\n\n\/*FD_CLOEXEC Known Issues:\nNormally FD's will remain open across fork() and exec() calls.\nThis is useful when piping. Unfortunately, we rarely even\nwant to use piping; almost definitely we will pipe only a few\nFD's.\n\nThus, in the general case, when acquiring FD's from the OS,\nwe must very soon force them to FD_CLOEXEC. However, this\nhas problems in a multithreaded implementation which fork()s.\nIt's possible for one thread to fork()+exec() while another\nthread has just, say, called socket(). In this case the\nreturned socket will *not* have FD_CLOEXEC and will remain\nopen in the child process, reducing the number of useable\nFD's in the process, as well as other weird stuff like tape\ndrives not rewinding...\n\nThis can be solved in many ways:\n1. Ignore CLOEXEC. After fork() and before exec(), close\neverything except for any redirections we want. This means\nabout sysconf(_SC_OPEN_MAX) calls to close(). Now suppose\n_SC_OPEN_MAX is 65,536...\n2. Like above. But we just keep closing until we get N\nconsecutive EBADF failures for close(), where N is some big\nnumber. Hackish solution which depends on the probability\nthat FD numbers will skip at most N consecutive values.\n3. Keep track of the largest ever FD we ever see from any\nsource. Just loop up to that instead of\nsysconf(_SC_OPEN_MAX), which should be faster because the\nlargest FD will be much smaller than _SC_OPEN_MAX. However\nwhen multithreaded we have to rely on locks to keep track\nof the largest seen FD anyway, so....\n4. Protect all open()+fcntl()\/socket()+fcntl\/pipe()+fcntl(),\nas well as fork(), with a mutex. While fork() will also\nduplicate the mutex in the child, we do an exec() soon\nanwyay, so the child's mutex copy gets implicitly deleted.\n\n#4 above seems the best solution but it *might* mean that\nsome LIBC and other third-party library routines can't be\nsafely used (since they would internally open some FD's,\nwhich we can't protect with a mutex).\n*\/\nstatic void force_cloexec(int fd) {\n\tint flag;\n\tdo {\n\t\terrno = 0;\n\t\tflag = fcntl(fd, F_GETFD);\n\t} while(flag < 0 && errno == EINTR);\n\tif(flag < 0) {\n\t\tstd::cerr << \"cloexec: error during getting of flag\"\n\t\t\t<< std::endl;\n\t\texit(1);\n\t}\n\tlong lflag = ((long) (flag)) | FD_CLOEXEC;\n\tint rv;\n\tdo {\n\t\terrno = 0;\n\t\trv = fcntl(fd, F_SETFD, lflag);\n\t} while(rv < 0 && errno == EINTR);\n\tif(flag < 0) {\n\t\tstd::cerr << \"cloexec: error during setting of flag\"\n\t\t\t<< std::endl;\n\t\texit(1);\n\t}\n}\n\nvoid aio_initialize(void) {\n\tint rv;\n\n\t\/*---------------------------------------------------------------------\n\tsetup self-pipe\n\t---------------------------------------------------------------------*\/\n\tint pipefds[2];\n\terrno = 0;\n\trv = pipe(pipefds);\n\tif(rv < 0) {\n\t\tif(errno == ENFILE) {\n\t\t\tstd::cerr << \"aio_initialize: too many open \"\n\t\t\t\t<< \"files during self-pipe \"\n\t\t\t\t<< \"initialization, oh noes!\"\n\t\t\t\t<< std::endl;\n\t\t} else {\n\t\t\tstd::cerr << \"aio_initialize: Unexpected error \"\n\t\t\t\t<< \"during self-pipe initialization\"\n\t\t\t\t<< std::endl;\n\t\t}\n\t\texit(1);\n\t}\n\tforce_cloexec(pipefds[0]);\n\tforce_cloexec(pipefds[1]);\n\tsigchld_rd = pipefds[0]; sigchld_wr = pipefds[1];\n\n\t\/*---------------------------------------------------------------------\n\tsetup SIGCHLD and SIGPIPE\n\t---------------------------------------------------------------------*\/\n\tstruct sigaction sa;\n\t\/*SIGCHLD*\/\n\tsigfillset(&sa.sa_mask); \/*block everything inside handler*\/\n\tsa.sa_flags = 0;\n\tsa.sa_handler = &sigchld_handler;\n\trv = sigaction(SIGCHLD, &sa, 0);\n\tif(rv < 0) {\n\t\tstd::cerr << \"aio_initialize: Unexpected error during \"\n\t\t\t<< \"SIGCHLD handler setup.\"\n\t\t\t<< std::endl;\n\t\texit(1);\n\t}\n\t\/*SIGPIPE*\/\n\tsigfillset(&sa.sa_mask);\n\tsa.sa_flags = 0;\n\tsa.sa_handler = &nihilistic_handler;\n\trv = sigaction(SIGPIPE, &sa, 0);\n\tif(rv < 0) {\n\t\tstd::cerr << \"aio_initialize: Unexpected error during \"\n\t\t\t<< \"SIGPIPE handler setup.\"\n\t\t\t<< std::endl;\n\t\texit(1);\n\t}\n\n}\n\nvoid aio_deinitialize(void) {\n\t\/*TODO: figure out what to clean up, if any*\/\n}\n\n<|endoftext|>"} {"text":"\/\/ Licensed GNU LGPL v3 or later: http:\/\/www.gnu.org\/licenses\/lgpl.html\n#ifndef __RAPICORN_CORE_OBJECTS_HH__\n#define __RAPICORN_CORE_OBJECTS_HH__\n\n#include \n#include \n#include \n\nnamespace Rapicorn {\n\n\/\/ == VirtualTypeid ==\nclass VirtualTypeid {\nprotected:\n virtual ~VirtualTypeid ();\npublic:\n String typeid_name ();\n static String cxx_demangle (const char *mangled_identifier);\n};\n\n\/\/ == ClassDoctor (used for private class copies) ==\n#ifdef __RAPICORN_BUILD__\nclass ClassDoctor;\n#else\nclass ClassDoctor {};\n#endif\n\n\/\/ == Deletable ==\n\/**\n * Deletable is a virtual base class that can be derived from (usually with\n * public virtual) to ensure an object has a vtable and a virtual destructor.\n * Also, it allows deletion hooks to be called during the objects destructor,\n * by deriving from Rapicorn::Deletable::DeletionHook. No extra per-object space is\n * consumed to allow deletion hooks, which makes Deletable a suitable base\n * type for classes that may or may not need this feature (e.g. objects that\n * can but often aren't used for signal handler connections).\n *\/\nstruct Deletable : public virtual VirtualTypeid {\n \/**\n * DeletionHook is the base implementation class for hooks which are hooked\n * up into the deletion phase of a Rapicorn::Deletable.\n *\/\n class DeletionHook {\n DeletionHook *prev;\n DeletionHook *next;\n friend class Deletable;\n protected:\n virtual ~DeletionHook (); \/* { if (deletable) deletable_remove_hook (deletable); deletable = NULL; } *\/\n virtual void monitoring_deletable (Deletable &deletable) = 0;\n virtual void dismiss_deletable () = 0;\n public:\n explicit DeletionHook () : prev (NULL), next (NULL) {}\n bool deletable_add_hook (void *any) { return false; }\n bool deletable_add_hook (Deletable *deletable);\n bool deletable_remove_hook (void *any) { return false; }\n bool deletable_remove_hook (Deletable *deletable);\n };\nprivate:\n void add_deletion_hook (DeletionHook *hook);\n void remove_deletion_hook (DeletionHook *hook);\nprotected:\n void invoke_deletion_hooks ();\n virtual ~Deletable ();\n};\n\n\/\/ == DataListContainer ==\n\/**\n * By using a DataKey, DataListContainer objects allow storage and retrieval of custom data members in a typesafe fashion.\n * The custom data members will initially default to DataKey::fallback and are deleted by the DataListContainer destructor.\n * Example: @snippet rcore\/tests\/datalist.cc DataListContainer-EXAMPLE\n *\/\nclass DataListContainer {\n DataList data_list;\npublic: \/\/\/ @name Accessing custom data members\n \/\/\/ Assign @a data to the custom keyed data member, deletes any previously set data.\n template inline void set_data (DataKey *key, Type data) { data_list.set (key, data); }\n \/\/\/ Retrieve contents of the custom keyed data member, returns DataKey::fallback if nothing was set.\n template inline Type get_data (DataKey *key) const { return data_list.get (key); }\n \/\/\/ Swap @a data with the current contents of the custom keyed data member, returns the current contents.\n template inline Type swap_data (DataKey *key, Type data) { return data_list.swap (key, data); }\n \/\/\/ Removes and returns the current contents of the custom keyed data member without deleting it.\n template inline Type swap_data (DataKey *key) { return data_list.swap (key); }\n \/\/\/ Delete the current contents of the custom keyed data member, invokes DataKey::destroy.\n template inline void delete_data (DataKey *key) { data_list.del (key); }\n};\n\n\/\/ == BaseObject ==\nclass BaseObject : public virtual Deletable, public virtual Aida::PropertyHostInterface {\nprotected:\n class InterfaceMatcher;\n template class InterfaceMatch;\n virtual void dispose ();\npublic:\n};\ntypedef Aida::PropertyList PropertyList; \/\/ import PropertyList from Aida namespace\ntypedef Aida::Property Property; \/\/ import Property from Aida namespace\nclass NullInterface : std::exception {};\n\nstruct BaseObject::InterfaceMatcher {\n explicit InterfaceMatcher (const String &ident) : ident_ (ident), match_found_ (false) {}\n bool done () const { return match_found_; }\n virtual bool match (BaseObject *object, const String &ident = String()) = 0;\n RAPICORN_CLASS_NON_COPYABLE (InterfaceMatcher);\nprotected:\n const String &ident_;\n bool match_found_;\n};\n\ntemplate\nstruct BaseObject::InterfaceMatch : BaseObject::InterfaceMatcher {\n typedef C& Result;\n explicit InterfaceMatch (const String &ident) : InterfaceMatcher (ident), instance_ (NULL) {}\n C& result (bool may_throw) const;\n virtual bool match (BaseObject *obj, const String &ident);\nprotected:\n C *instance_;\n};\ntemplate\nstruct BaseObject::InterfaceMatch : InterfaceMatch {\n explicit InterfaceMatch (const String &ident) : InterfaceMatch (ident) {}\n};\ntemplate\nstruct BaseObject::InterfaceMatch : InterfaceMatch {\n typedef C* Result;\n explicit InterfaceMatch (const String &ident) : InterfaceMatch (ident) {}\n C* result (bool may_throw) const { return InterfaceMatch::instance_; }\n};\n\ntemplate bool\nBaseObject::InterfaceMatch::match (BaseObject *obj, const String &ident)\n{\n if (!instance_)\n {\n const String &id = ident_;\n if (id.empty() || id == ident)\n {\n instance_ = dynamic_cast (obj);\n match_found_ = instance_ != NULL;\n }\n }\n return match_found_;\n}\n\ntemplate C&\nBaseObject::InterfaceMatch::result (bool may_throw) const\n{\n if (!this->instance_ && may_throw)\n throw NullInterface();\n return *this->instance_;\n}\n\n\/\/ == ReferenceCountable ==\nclass ReferenceCountable : public virtual BaseObject {\n volatile mutable uint32 ref_field;\n static const uint32 FLOATING_FLAG = 1 << 31;\n inline uint32 ref_get () const { return Lib::atomic_load (&ref_field); }\n inline bool ref_cas (uint32 oldv, uint32 newv) const { return __sync_bool_compare_and_swap (&ref_field, oldv, newv); }\n inline void fast_ref () const;\n inline void fast_unref () const;\n void real_unref () const;\n RAPICORN_CLASS_NON_COPYABLE (ReferenceCountable);\nprotected:\n virtual ~ReferenceCountable ();\n virtual void delete_this ();\n virtual void pre_finalize ();\n virtual void finalize ();\n inline uint32 ref_count () const { return ref_get() & ~FLOATING_FLAG; }\npublic:\n bool floating () const { return 0 != (ref_get() & FLOATING_FLAG); }\n void ref () const { fast_ref(); }\n void ref_sink () const;\n bool finalizing () const { return ref_count() < 1; }\n void unref () const { fast_unref(); }\n void ref_diag (const char *msg = NULL) const;\n explicit ReferenceCountable (uint allow_stack_magic = 0);\n template static Obj& ref (Obj &obj) { obj.ref(); return obj; }\n template static Obj* ref (Obj *obj) { obj->ref(); return obj; }\n template static Obj& ref_sink (Obj &obj) { obj.ref_sink(); return obj; }\n template static Obj* ref_sink (Obj *obj) { obj->ref_sink(); return obj; }\n template static void unref (Obj &obj) { obj.unref(); }\n template static void unref (Obj *obj) { obj->unref(); }\n};\ntemplate static Obj& ref (Obj &obj) { obj.ref(); return obj; }\ntemplate static Obj* ref (Obj *obj) { obj->ref(); return obj; }\ntemplate static Obj& ref_sink (Obj &obj) { obj.ref_sink(); return obj; }\ntemplate static Obj* ref_sink (Obj *obj) { obj->ref_sink(); return obj; }\ntemplate static void unref (Obj &obj) { obj.unref(); }\ntemplate static void unref (Obj *obj) { obj->unref(); }\n\n\/\/ == Implementation Details ==\ninline void\nReferenceCountable::fast_ref () const\n{\n \/\/ fast-path: use one atomic op and deferred checks\n uint32 old_ref = __sync_fetch_and_add (&ref_field, 1);\n uint32 new_ref = old_ref + 1; \/\/ ...and_add (,1)\n RAPICORN_ASSERT (old_ref & ~FLOATING_FLAG); \/\/ check dead objects\n RAPICORN_ASSERT (new_ref & ~FLOATING_FLAG); \/\/ check overflow\n}\n\ninline void\nReferenceCountable::fast_unref () const\n{\n RAPICORN_CFENCE;\n uint32 old_ref = ref_field; \/\/ skip read-barrier for fast-path\n if (RAPICORN_LIKELY (old_ref & ~(FLOATING_FLAG | 1)) && \/\/ old_ref >= 2\n RAPICORN_LIKELY (ref_cas (old_ref, old_ref - 1)))\n return; \/\/ trying fast-path with single atomic op\n real_unref();\n}\n\n} \/\/ Rapicorn\n\n#endif \/\/ __RAPICORN_CORE_OBJECTS_HH__\nRCORE: BaseObject: derive from ReferenceCountable (not vice versa) and Aida::ImplicitBase\/\/ Licensed GNU LGPL v3 or later: http:\/\/www.gnu.org\/licenses\/lgpl.html\n#ifndef __RAPICORN_CORE_OBJECTS_HH__\n#define __RAPICORN_CORE_OBJECTS_HH__\n\n#include \n#include \n#include \n\nnamespace Rapicorn {\n\n\/\/ == VirtualTypeid ==\nclass VirtualTypeid {\nprotected:\n virtual ~VirtualTypeid ();\npublic:\n String typeid_name ();\n static String cxx_demangle (const char *mangled_identifier);\n};\n\n\/\/ == ClassDoctor (used for private class copies) ==\n#ifdef __RAPICORN_BUILD__\nclass ClassDoctor;\n#else\nclass ClassDoctor {};\n#endif\n\n\/\/ == Deletable ==\n\/**\n * Deletable is a virtual base class that can be derived from (usually with\n * public virtual) to ensure an object has a vtable and a virtual destructor.\n * Also, it allows deletion hooks to be called during the objects destructor,\n * by deriving from Rapicorn::Deletable::DeletionHook. No extra per-object space is\n * consumed to allow deletion hooks, which makes Deletable a suitable base\n * type for classes that may or may not need this feature (e.g. objects that\n * can but often aren't used for signal handler connections).\n *\/\nstruct Deletable : public virtual VirtualTypeid {\n \/**\n * DeletionHook is the base implementation class for hooks which are hooked\n * up into the deletion phase of a Rapicorn::Deletable.\n *\/\n class DeletionHook {\n DeletionHook *prev;\n DeletionHook *next;\n friend class Deletable;\n protected:\n virtual ~DeletionHook (); \/* { if (deletable) deletable_remove_hook (deletable); deletable = NULL; } *\/\n virtual void monitoring_deletable (Deletable &deletable) = 0;\n virtual void dismiss_deletable () = 0;\n public:\n explicit DeletionHook () : prev (NULL), next (NULL) {}\n bool deletable_add_hook (void *any) { return false; }\n bool deletable_add_hook (Deletable *deletable);\n bool deletable_remove_hook (void *any) { return false; }\n bool deletable_remove_hook (Deletable *deletable);\n };\nprivate:\n void add_deletion_hook (DeletionHook *hook);\n void remove_deletion_hook (DeletionHook *hook);\nprotected:\n void invoke_deletion_hooks ();\n virtual ~Deletable ();\n};\n\n\/\/ == DataListContainer ==\n\/**\n * By using a DataKey, DataListContainer objects allow storage and retrieval of custom data members in a typesafe fashion.\n * The custom data members will initially default to DataKey::fallback and are deleted by the DataListContainer destructor.\n * Example: @snippet rcore\/tests\/datalist.cc DataListContainer-EXAMPLE\n *\/\nclass DataListContainer {\n DataList data_list;\npublic: \/\/\/ @name Accessing custom data members\n \/\/\/ Assign @a data to the custom keyed data member, deletes any previously set data.\n template inline void set_data (DataKey *key, Type data) { data_list.set (key, data); }\n \/\/\/ Retrieve contents of the custom keyed data member, returns DataKey::fallback if nothing was set.\n template inline Type get_data (DataKey *key) const { return data_list.get (key); }\n \/\/\/ Swap @a data with the current contents of the custom keyed data member, returns the current contents.\n template inline Type swap_data (DataKey *key, Type data) { return data_list.swap (key, data); }\n \/\/\/ Removes and returns the current contents of the custom keyed data member without deleting it.\n template inline Type swap_data (DataKey *key) { return data_list.swap (key); }\n \/\/\/ Delete the current contents of the custom keyed data member, invokes DataKey::destroy.\n template inline void delete_data (DataKey *key) { data_list.del (key); }\n};\n\n\/\/ == ReferenceCountable ==\nclass ReferenceCountable : public virtual Deletable {\n volatile mutable uint32 ref_field;\n static const uint32 FLOATING_FLAG = 1 << 31;\n inline uint32 ref_get () const { return Lib::atomic_load (&ref_field); }\n inline bool ref_cas (uint32 oldv, uint32 newv) const { return __sync_bool_compare_and_swap (&ref_field, oldv, newv); }\n inline void fast_ref () const;\n inline void fast_unref () const;\n void real_unref () const;\n RAPICORN_CLASS_NON_COPYABLE (ReferenceCountable);\nprotected:\n virtual ~ReferenceCountable ();\n virtual void delete_this ();\n virtual void pre_finalize ();\n virtual void finalize ();\n inline uint32 ref_count () const { return ref_get() & ~FLOATING_FLAG; }\npublic:\n bool floating () const { return 0 != (ref_get() & FLOATING_FLAG); }\n void ref () const { fast_ref(); }\n void ref_sink () const;\n bool finalizing () const { return ref_count() < 1; }\n void unref () const { fast_unref(); }\n void ref_diag (const char *msg = NULL) const;\n explicit ReferenceCountable (uint allow_stack_magic = 0);\n template static Obj& ref (Obj &obj) { obj.ref(); return obj; }\n template static Obj* ref (Obj *obj) { obj->ref(); return obj; }\n template static Obj& ref_sink (Obj &obj) { obj.ref_sink(); return obj; }\n template static Obj* ref_sink (Obj *obj) { obj->ref_sink(); return obj; }\n template static void unref (Obj &obj) { obj.unref(); }\n template static void unref (Obj *obj) { obj->unref(); }\n};\ntemplate static Obj& ref (Obj &obj) { obj.ref(); return obj; }\ntemplate static Obj* ref (Obj *obj) { obj->ref(); return obj; }\ntemplate static Obj& ref_sink (Obj &obj) { obj.ref_sink(); return obj; }\ntemplate static Obj* ref_sink (Obj *obj) { obj->ref_sink(); return obj; }\ntemplate static void unref (Obj &obj) { obj.unref(); }\ntemplate static void unref (Obj *obj) { obj->unref(); }\n\n\/\/ == BaseObject ==\nclass BaseObject : public virtual ReferenceCountable, public virtual Aida::ImplicitBase {\nprotected:\n class InterfaceMatcher;\n template class InterfaceMatch;\n virtual void dispose ();\npublic:\n};\ntypedef Aida::PropertyList PropertyList; \/\/ import PropertyList from Aida namespace\ntypedef Aida::Property Property; \/\/ import Property from Aida namespace\nclass NullInterface : std::exception {};\n\nstruct BaseObject::InterfaceMatcher {\n explicit InterfaceMatcher (const String &ident) : ident_ (ident), match_found_ (false) {}\n bool done () const { return match_found_; }\n virtual bool match (BaseObject *object, const String &ident = String()) = 0;\n RAPICORN_CLASS_NON_COPYABLE (InterfaceMatcher);\nprotected:\n const String &ident_;\n bool match_found_;\n};\n\ntemplate\nstruct BaseObject::InterfaceMatch : BaseObject::InterfaceMatcher {\n typedef C& Result;\n explicit InterfaceMatch (const String &ident) : InterfaceMatcher (ident), instance_ (NULL) {}\n C& result (bool may_throw) const;\n virtual bool match (BaseObject *obj, const String &ident);\nprotected:\n C *instance_;\n};\ntemplate\nstruct BaseObject::InterfaceMatch : InterfaceMatch {\n explicit InterfaceMatch (const String &ident) : InterfaceMatch (ident) {}\n};\ntemplate\nstruct BaseObject::InterfaceMatch : InterfaceMatch {\n typedef C* Result;\n explicit InterfaceMatch (const String &ident) : InterfaceMatch (ident) {}\n C* result (bool may_throw) const { return InterfaceMatch::instance_; }\n};\n\ntemplate bool\nBaseObject::InterfaceMatch::match (BaseObject *obj, const String &ident)\n{\n if (!instance_)\n {\n const String &id = ident_;\n if (id.empty() || id == ident)\n {\n instance_ = dynamic_cast (obj);\n match_found_ = instance_ != NULL;\n }\n }\n return match_found_;\n}\n\ntemplate C&\nBaseObject::InterfaceMatch::result (bool may_throw) const\n{\n if (!this->instance_ && may_throw)\n throw NullInterface();\n return *this->instance_;\n}\n\n\/\/ == Implementation Details ==\ninline void\nReferenceCountable::fast_ref () const\n{\n \/\/ fast-path: use one atomic op and deferred checks\n uint32 old_ref = __sync_fetch_and_add (&ref_field, 1);\n uint32 new_ref = old_ref + 1; \/\/ ...and_add (,1)\n RAPICORN_ASSERT (old_ref & ~FLOATING_FLAG); \/\/ check dead objects\n RAPICORN_ASSERT (new_ref & ~FLOATING_FLAG); \/\/ check overflow\n}\n\ninline void\nReferenceCountable::fast_unref () const\n{\n RAPICORN_CFENCE;\n uint32 old_ref = ref_field; \/\/ skip read-barrier for fast-path\n if (RAPICORN_LIKELY (old_ref & ~(FLOATING_FLAG | 1)) && \/\/ old_ref >= 2\n RAPICORN_LIKELY (ref_cas (old_ref, old_ref - 1)))\n return; \/\/ trying fast-path with single atomic op\n real_unref();\n}\n\n} \/\/ Rapicorn\n\n#endif \/\/ __RAPICORN_CORE_OBJECTS_HH__\n<|endoftext|>"} {"text":"\/*\n Copyright (c) 2014\n Author: Jeff Weisberg \n Created: 2014-Mar-27 14:55 (EDT)\n Function: todo state transitions\n\n*\/\n\n#define CURRENT_SUBSYSTEM\t'j'\n\n#include \"defs.h\"\n#include \"diag.h\"\n#include \"config.h\"\n#include \"misc.h\"\n#include \"network.h\"\n#include \"runmode.h\"\n#include \"thread.h\"\n#include \"lock.h\"\n#include \"peers.h\"\n#include \"queued.h\"\n#include \"job.h\"\n\n#include \n\n#include \"mrmagoo.pb.h\"\n#include \"std_reply.pb.h\"\n\n#define IO_TIMEOUT\t\t30\n\n#define XFERMAX\t\t\t48\n#define TODORETRYDELAY\t\t15\n#define TODORETRYQUICK\t \t5\n#define SERVERTASKMAX\t\t10\n#define SERVERXFERMAX\t\t20\n#define SERVERTASKDELAY\t\t2\n\n\nvoid\nJob::derunning_x(ToDo *t){\n _running.remove(t);\n}\n\nvoid\nJob::enrunning_x(ToDo *t){\n _pending.remove(t);\n _running.push_back(t);\n}\n\nvoid\nJob::depending_x(ToDo *t){\n _pending.remove(t);\n}\n\nvoid\nToDo::retry_or_abort(bool did_timeout){\n\n if( _job->_n_fails > _job->current_width() * TODOMAXFAIL \/ 2){\n _job->abort();\n return;\n }\n\n if( ++_tries >= TODOMAXFAIL ){\n const char *serv = _job->_servers[_serveridx]->name.c_str();\n\n \/\/ cannot replace a map task\n \/\/ only replace if the failure is likely because the server is down\n if( _job->_stepno && (did_timeout || !peerdb->is_it_up(serv) )){\n maybe_replace(1);\n }else{\n _job->abort();\n }\n return;\n }\n\n \/\/ retry\n int delay = (did_timeout ? TODORETRYDELAY * _tries : TODORETRYQUICK);\n _delay_until = lr_now() + delay\/2 + random_n( delay\/2 ) + random_n( delay\/2 );\n\n pend();\n}\n\nint\nXferToDo::maybe_replace(bool import){\n \/\/ wait until the task fails, and replace that\n return 0;\n}\n\nint\nTaskToDo::maybe_replace(bool important){\n\n if( replace() )\n return 1;\n\n if( important ) _job->abort();\n\n return 0;\n}\n\nvoid\nTaskToDo::failed(bool did_timeout){\n\n if( _state != JOB_TODO_STATE_RUNNING ) return;\n\n _job->kvetch(\"task %s failed\", _xid.c_str());\n _job->derunning_x(this);\n _job->_servers[ _serveridx ]->_n_task_running --;\n _job->_servers[ _serveridx ]->_n_fails ++;\n _job->_n_task_running --;\n _job->_n_fails ++;\n _state = JOB_TODO_STATE_FINISHED;\n\n TaskToDo *alt = _replaces ? _replaces : _replacedby;\n if( alt ){\n \/\/ if there is an alternate task still running, let it finish\n if( ! alt->is_finished() ) return;\n }\n\n retry_or_abort(did_timeout);\n}\n\nvoid\nXferToDo::failed(bool did_timeout){\n\n _job->kvetch(\"xfer %s failed file %s host %s - %s\", _xid.c_str(), _g.filename().c_str(),\n _job->_servers[_serveridx]->name.c_str(), _g.location(0).c_str());\n\n _job->derunning_x(this);\n _job->_servers[ _serveridx ]->_n_xfer_running --;\n _job->_servers[ _peeridx ]->_n_xfer_peering --;\n _job->_servers[ _serveridx ]->_n_fails ++;\n _job->_n_xfer_running --;\n _job->_n_fails ++;\n _state = JOB_TODO_STATE_FINISHED;\n\n retry_or_abort(did_timeout);\n}\n\nvoid\nToDo::timedout(void){\n\n _job->kvetch(\"task %s timed out\", _xid.c_str());\n\n abort();\n failed(1);\n}\n\nstatic void *\ntodo_start(void *x){\n ToDo *t = (ToDo*)x;\n t->start();\n}\n\nint\nToDo::start_check(void){\n \/\/ are we good to go?\n if( _job->_n_threads >= JOBMAXTHREAD ) return 0;\n if( _delay_until > lr_now() ) return 0;\n return 1;\n}\n\nvoid\nToDo::start_common(void){\n\n _state = JOB_TODO_STATE_RUNNING;\n _last_status = lr_now();\n _job->_n_threads ++;\n _job->_pending.remove(this);\n _job->_running.push_back(this);\n}\n\nint\nTaskToDo::maybe_start(void){\n\n Server *svr = _job->_servers[ _serveridx ];\n\n \/\/ too much running?\n if( svr->_n_task_running >= SERVERTASKMAX ) return 0;\n if( svr->_last_task + SERVERTASKDELAY > lr_now() ) return 0;\n if( ! start_check() ) return 0;\n\n \/\/ check prereqs\n if( !_prerequisite.empty() ){\n for(list::iterator it=_prerequisite.begin(); it !=_prerequisite.end(); it++){\n ToDo *t = *it;\n\n if( ! t->is_finished() ) return 0;\n }\n\n _prerequisite.clear();\n }\n\n \/\/ ok, let's start....\n\n \/\/ we could create these at task construction time, but deferring until here\n \/\/ saves us effort if the job is aborted\n if( !_tries )\n create_deles();\n\n _job->inform(\"starting task %s - %s on %s\", _xid.c_str(), _g.phase().c_str(),\n _job->_servers[ _serveridx ]->name.c_str());\n\n svr->_n_task_running ++;\n svr->_last_task = lr_now();\n _job->_n_task_running ++;\n _job->_n_tasks_run ++;\n\n _run_start = lr_now();\n start_common();\n\n DEBUG(\"started\");\n start_thread(todo_start, (void*)(ToDo*)this);\n return 1;\n}\n\nint\nXferToDo::maybe_start(void){\n\n \/\/ too much running?\n if( _job->_servers[ _serveridx ]->_n_xfer_running >= SERVERXFERMAX ) return 0;\n if( _job->_servers[ _peeridx ]->_n_xfer_peering >= SERVERXFERMAX ) return 0;\n if( _job->_n_xfer_running >= XFERMAX ) return 0;\n if( ! start_check() ) return 0;\n\n\n _job->inform(\"starting xfer %s - %s : %s\", _xid.c_str(), _g.filename().c_str(),\n _job->_servers[ _serveridx ]->name.c_str());\n\n _job->_servers[ _serveridx ]->_n_xfer_running ++;\n _job->_servers[ _peeridx ]->_n_xfer_peering ++;\n _job->_n_xfer_running ++;\n _job->_n_xfers_run ++;\n start_common();\n\n DEBUG(\"started\");\n start_thread(todo_start, (void*)(ToDo*)this);\n return 1;\n}\n\nvoid\nJob::thread_done(void){\n\n _lock.w_lock();\n _n_threads--;\n _lock.w_unlock();\n\n try_to_do_something( _n_threads ? 0 : 1 );\n}\n\nint\nTaskToDo::start(void){\n\n if( ! make_request( _job->_servers[_serveridx], PHMT_MR_TASKCREATE, &_g, IO_TIMEOUT ) ){\n string status = \"FAILED\";\n _job->update( &_xid, &status, 0, 0 );\n }\n\n _job->thread_done();\n}\n\nint\nXferToDo::start(void){\n\n if( ! make_request( _job->_servers[_serveridx], PHMT_MR_FILEXFER, &_g, IO_TIMEOUT ) ){\n string status = \"FAILED\";\n _job->update( &_xid, &status, 0, 0 );\n }\n\n _job->thread_done();\n}\n\n\nvoid\nTaskToDo::abort(void){\n DEBUG(\"abort task\");\n ACPMRMTaskAbort req;\n\n if( _state != JOB_TODO_STATE_RUNNING ) return;\n\n req.set_jobid( _job->_id );\n req.set_taskid( _xid.c_str() );\n\n \/\/ udp fire+forget\n toss_request(udp4_fd, _job->_servers[ _serveridx ], PHMT_MR_TASKABORT, &req );\n}\n\nvoid\nTaskToDo::discard(void){\n\n DEBUG(\"discard %s %d\", _xid.c_str(), _state);\n if( _state == JOB_TODO_STATE_PENDING ){\n _job->depending_x(this);\n _state = JOB_TODO_STATE_FINISHED;\n return;\n }\n\n if( _state == JOB_TODO_STATE_RUNNING ){\n _job->derunning_x(this);\n _state = JOB_TODO_STATE_FINISHED;\n _job->_servers[ _serveridx ]->_n_task_running --;\n _job->_n_task_running --;\n return;\n }\n}\n\n\/\/ remove task from run list, send abort request (tcp)\nvoid\nTaskToDo::cancel(void){\n ACPMRMTaskAbort req;\n\n int prevstate = _state;\n\n discard();\n\n if( prevstate != JOB_TODO_STATE_RUNNING ) return;\n\n req.set_jobid( _job->_id );\n req.set_taskid( _xid.c_str() );\n\n make_request( _job->_servers[_serveridx], PHMT_MR_TASKABORT, &req, IO_TIMEOUT );\n}\n\n\/\/ same, but udp\nvoid\nTaskToDo::cancel_light(void){\n ACPMRMTaskAbort req;\n\n int prevstate = _state;\n\n discard();\n\n if( prevstate != JOB_TODO_STATE_RUNNING ) return;\n\n req.set_jobid( _job->_id );\n req.set_taskid( _xid.c_str() );\n\n toss_request(udp4_fd, _job->_servers[ _serveridx ], PHMT_MR_TASKABORT, &req );\n}\n\nvoid\nXferToDo::abort(void){\n DEBUG(\"abort xfer\");\n \/\/ there is no abort method, just wait...\n}\nvoid\nXferToDo::cancel(void){\n DEBUG(\"cancel xfer\");\n \/\/ there is no cancel method, just wait...\n}\n\n\nvoid\nTaskToDo::finished(int amount){\n\n _job->inform(\"task %s finished\", _xid.c_str());\n _job->derunning_x(this);\n\n if( _state == JOB_TODO_STATE_RUNNING ){\n _job->_servers[ _serveridx ]->_n_task_running --;\n _job->_n_task_running --;\n }\n _state = JOB_TODO_STATE_FINISHED;\n\n \/\/ so how slow was it?\n if( amount ){\n _run_time = amount;\n }else{\n _run_time = lr_now() - _run_start;\n }\n\n _job->_task_run_time += _run_time;\n\n create_xfers();\n\n \/\/ if this was replaced, abort the replacement (and vv)\n if( _replacedby ) _replacedby->cancel_light();\n if( _replaces ) _replaces->cancel_light();\n\n}\n\nvoid\nXferToDo::finished(int amount){\n\n _job->derunning_x(this);\n _state = JOB_TODO_STATE_FINISHED;\n _job->_servers[ _serveridx ]->_n_xfer_running --;\n _job->_servers[ _peeridx ]->_n_xfer_peering --;\n _job->_n_xfer_running --;\n\n \/\/ tally up file xfer sizes\n _job->_plan[ _job->_stepno ]->_xfer_size += amount;\n _job->_plan[ _job->_stepno ]->_n_xfers_run ++;\n\n}\n\nXferToDo::XferToDo(Job *j, const string *name, int src, int dst){\n\n unique( &_xid );\n _job = j;\n _serveridx = dst;\n _peeridx = src;\n _state = JOB_TODO_STATE_PENDING;\n _tries = 0;\n _delay_until = 0;\n\n _g.set_jobid( j->_id );\n _g.set_console( j->_g.console().c_str() );\n _g.set_master( myipandport.c_str() );\n _g.set_copyid( _xid.c_str() );\n _g.set_filename( name->c_str() );\n _g.add_location( _job->_servers[src]->name.c_str() );\n\n}\n\nvoid\nTaskToDo::create_xfers(void){\n\n \/\/ files from last step can stay where they are\n if( _job->_stepno == _job->_plan.size() - 1 ) return;\n\n \/\/ for all outfiles\n \/\/ new Xfer -> job pend\n\n int nserv = _job->_servers.size();\n int noutf = _g.outfile_size();\n\n for(int i=0; i_pending.push_back(x);\n _job->_xfers.push_back(x);\n }\n}\n\nverbosity\/*\n Copyright (c) 2014\n Author: Jeff Weisberg \n Created: 2014-Mar-27 14:55 (EDT)\n Function: todo state transitions\n\n*\/\n\n#define CURRENT_SUBSYSTEM\t'j'\n\n#include \"defs.h\"\n#include \"diag.h\"\n#include \"config.h\"\n#include \"misc.h\"\n#include \"network.h\"\n#include \"runmode.h\"\n#include \"thread.h\"\n#include \"lock.h\"\n#include \"peers.h\"\n#include \"queued.h\"\n#include \"job.h\"\n\n#include \n\n#include \"mrmagoo.pb.h\"\n#include \"std_reply.pb.h\"\n\n#define IO_TIMEOUT\t\t30\n\n#define XFERMAX\t\t\t48\n#define TODORETRYDELAY\t\t15\n#define TODORETRYQUICK\t \t5\n#define SERVERTASKMAX\t\t10\n#define SERVERXFERMAX\t\t20\n#define SERVERTASKDELAY\t\t2\n\n\nvoid\nJob::derunning_x(ToDo *t){\n _running.remove(t);\n}\n\nvoid\nJob::enrunning_x(ToDo *t){\n _pending.remove(t);\n _running.push_back(t);\n}\n\nvoid\nJob::depending_x(ToDo *t){\n _pending.remove(t);\n}\n\nvoid\nToDo::retry_or_abort(bool did_timeout){\n\n if( _job->_n_fails > _job->current_width() * TODOMAXFAIL \/ 2){\n _job->abort();\n return;\n }\n\n if( ++_tries >= TODOMAXFAIL ){\n const char *serv = _job->_servers[_serveridx]->name.c_str();\n\n \/\/ cannot replace a map task\n \/\/ only replace if the failure is likely because the server is down\n if( _job->_stepno && (did_timeout || !peerdb->is_it_up(serv) )){\n maybe_replace(1);\n }else{\n _job->abort();\n }\n return;\n }\n\n \/\/ retry\n int delay = (did_timeout ? TODORETRYDELAY * _tries : TODORETRYQUICK);\n _delay_until = lr_now() + delay\/2 + random_n( delay\/2 ) + random_n( delay\/2 );\n\n pend();\n}\n\nint\nXferToDo::maybe_replace(bool import){\n \/\/ wait until the task fails, and replace that\n return 0;\n}\n\nint\nTaskToDo::maybe_replace(bool important){\n\n if( replace() )\n return 1;\n\n if( important ) _job->abort();\n\n return 0;\n}\n\nvoid\nTaskToDo::failed(bool did_timeout){\n\n if( _state != JOB_TODO_STATE_RUNNING ) return;\n\n _job->kvetch(\"task %s failed on %s\", _xid.c_str(), _job->_servers[_serveridx]->name.c_str());\n _job->derunning_x(this);\n _job->_servers[ _serveridx ]->_n_task_running --;\n _job->_servers[ _serveridx ]->_n_fails ++;\n _job->_n_task_running --;\n _job->_n_fails ++;\n _state = JOB_TODO_STATE_FINISHED;\n\n TaskToDo *alt = _replaces ? _replaces : _replacedby;\n if( alt ){\n \/\/ if there is an alternate task still running, let it finish\n if( ! alt->is_finished() ) return;\n }\n\n retry_or_abort(did_timeout);\n}\n\nvoid\nXferToDo::failed(bool did_timeout){\n\n _job->kvetch(\"xfer %s failed file %s host %s - %s\", _xid.c_str(), _g.filename().c_str(),\n _job->_servers[_serveridx]->name.c_str(), _g.location(0).c_str());\n\n _job->derunning_x(this);\n _job->_servers[ _serveridx ]->_n_xfer_running --;\n _job->_servers[ _peeridx ]->_n_xfer_peering --;\n _job->_servers[ _serveridx ]->_n_fails ++;\n _job->_n_xfer_running --;\n _job->_n_fails ++;\n _state = JOB_TODO_STATE_FINISHED;\n\n retry_or_abort(did_timeout);\n}\n\nvoid\nToDo::timedout(void){\n\n _job->kvetch(\"task %s timed out\", _xid.c_str());\n\n abort();\n failed(1);\n}\n\nstatic void *\ntodo_start(void *x){\n ToDo *t = (ToDo*)x;\n t->start();\n}\n\nint\nToDo::start_check(void){\n \/\/ are we good to go?\n if( _job->_n_threads >= JOBMAXTHREAD ) return 0;\n if( _delay_until > lr_now() ) return 0;\n return 1;\n}\n\nvoid\nToDo::start_common(void){\n\n _state = JOB_TODO_STATE_RUNNING;\n _last_status = lr_now();\n _job->_n_threads ++;\n _job->_pending.remove(this);\n _job->_running.push_back(this);\n}\n\nint\nTaskToDo::maybe_start(void){\n\n Server *svr = _job->_servers[ _serveridx ];\n\n \/\/ too much running?\n if( svr->_n_task_running >= SERVERTASKMAX ) return 0;\n if( svr->_last_task + SERVERTASKDELAY > lr_now() ) return 0;\n if( ! start_check() ) return 0;\n\n \/\/ check prereqs\n if( !_prerequisite.empty() ){\n for(list::iterator it=_prerequisite.begin(); it !=_prerequisite.end(); it++){\n ToDo *t = *it;\n\n if( ! t->is_finished() ) return 0;\n }\n\n _prerequisite.clear();\n }\n\n \/\/ ok, let's start....\n\n \/\/ we could create these at task construction time, but deferring until here\n \/\/ saves us effort if the job is aborted\n if( !_tries )\n create_deles();\n\n _job->inform(\"starting task %s - %s on %s\", _xid.c_str(), _g.phase().c_str(),\n _job->_servers[ _serveridx ]->name.c_str());\n\n svr->_n_task_running ++;\n svr->_last_task = lr_now();\n _job->_n_task_running ++;\n _job->_n_tasks_run ++;\n\n _run_start = lr_now();\n start_common();\n\n DEBUG(\"started\");\n start_thread(todo_start, (void*)(ToDo*)this);\n return 1;\n}\n\nint\nXferToDo::maybe_start(void){\n\n \/\/ too much running?\n if( _job->_servers[ _serveridx ]->_n_xfer_running >= SERVERXFERMAX ) return 0;\n if( _job->_servers[ _peeridx ]->_n_xfer_peering >= SERVERXFERMAX ) return 0;\n if( _job->_n_xfer_running >= XFERMAX ) return 0;\n if( ! start_check() ) return 0;\n\n\n _job->inform(\"starting xfer %s - %s : %s\", _xid.c_str(), _g.filename().c_str(),\n _job->_servers[ _serveridx ]->name.c_str());\n\n _job->_servers[ _serveridx ]->_n_xfer_running ++;\n _job->_servers[ _peeridx ]->_n_xfer_peering ++;\n _job->_n_xfer_running ++;\n _job->_n_xfers_run ++;\n start_common();\n\n DEBUG(\"started\");\n start_thread(todo_start, (void*)(ToDo*)this);\n return 1;\n}\n\nvoid\nJob::thread_done(void){\n\n _lock.w_lock();\n _n_threads--;\n _lock.w_unlock();\n\n try_to_do_something( _n_threads ? 0 : 1 );\n}\n\nint\nTaskToDo::start(void){\n\n if( ! make_request( _job->_servers[_serveridx], PHMT_MR_TASKCREATE, &_g, IO_TIMEOUT ) ){\n string status = \"FAILED\";\n _job->update( &_xid, &status, 0, 0 );\n }\n\n _job->thread_done();\n}\n\nint\nXferToDo::start(void){\n\n if( ! make_request( _job->_servers[_serveridx], PHMT_MR_FILEXFER, &_g, IO_TIMEOUT ) ){\n string status = \"FAILED\";\n _job->update( &_xid, &status, 0, 0 );\n }\n\n _job->thread_done();\n}\n\n\nvoid\nTaskToDo::abort(void){\n DEBUG(\"abort task\");\n ACPMRMTaskAbort req;\n\n if( _state != JOB_TODO_STATE_RUNNING ) return;\n\n req.set_jobid( _job->_id );\n req.set_taskid( _xid.c_str() );\n\n \/\/ udp fire+forget\n toss_request(udp4_fd, _job->_servers[ _serveridx ], PHMT_MR_TASKABORT, &req );\n}\n\nvoid\nTaskToDo::discard(void){\n\n DEBUG(\"discard %s %d\", _xid.c_str(), _state);\n if( _state == JOB_TODO_STATE_PENDING ){\n _job->depending_x(this);\n _state = JOB_TODO_STATE_FINISHED;\n return;\n }\n\n if( _state == JOB_TODO_STATE_RUNNING ){\n _job->derunning_x(this);\n _state = JOB_TODO_STATE_FINISHED;\n _job->_servers[ _serveridx ]->_n_task_running --;\n _job->_n_task_running --;\n return;\n }\n}\n\n\/\/ remove task from run list, send abort request (tcp)\nvoid\nTaskToDo::cancel(void){\n ACPMRMTaskAbort req;\n\n int prevstate = _state;\n\n discard();\n\n if( prevstate != JOB_TODO_STATE_RUNNING ) return;\n\n req.set_jobid( _job->_id );\n req.set_taskid( _xid.c_str() );\n\n make_request( _job->_servers[_serveridx], PHMT_MR_TASKABORT, &req, IO_TIMEOUT );\n}\n\n\/\/ same, but udp\nvoid\nTaskToDo::cancel_light(void){\n ACPMRMTaskAbort req;\n\n int prevstate = _state;\n\n discard();\n\n if( prevstate != JOB_TODO_STATE_RUNNING ) return;\n\n req.set_jobid( _job->_id );\n req.set_taskid( _xid.c_str() );\n\n toss_request(udp4_fd, _job->_servers[ _serveridx ], PHMT_MR_TASKABORT, &req );\n}\n\nvoid\nXferToDo::abort(void){\n DEBUG(\"abort xfer\");\n \/\/ there is no abort method, just wait...\n}\nvoid\nXferToDo::cancel(void){\n DEBUG(\"cancel xfer\");\n \/\/ there is no cancel method, just wait...\n}\n\n\nvoid\nTaskToDo::finished(int amount){\n\n _job->inform(\"task %s finished\", _xid.c_str());\n _job->derunning_x(this);\n\n if( _state == JOB_TODO_STATE_RUNNING ){\n _job->_servers[ _serveridx ]->_n_task_running --;\n _job->_n_task_running --;\n }\n _state = JOB_TODO_STATE_FINISHED;\n\n \/\/ so how slow was it?\n if( amount ){\n _run_time = amount;\n }else{\n _run_time = lr_now() - _run_start;\n }\n\n _job->_task_run_time += _run_time;\n\n create_xfers();\n\n \/\/ if this was replaced, abort the replacement (and vv)\n if( _replacedby ) _replacedby->cancel_light();\n if( _replaces ) _replaces->cancel_light();\n\n}\n\nvoid\nXferToDo::finished(int amount){\n\n _job->derunning_x(this);\n _state = JOB_TODO_STATE_FINISHED;\n _job->_servers[ _serveridx ]->_n_xfer_running --;\n _job->_servers[ _peeridx ]->_n_xfer_peering --;\n _job->_n_xfer_running --;\n\n \/\/ tally up file xfer sizes\n _job->_plan[ _job->_stepno ]->_xfer_size += amount;\n _job->_plan[ _job->_stepno ]->_n_xfers_run ++;\n\n}\n\nXferToDo::XferToDo(Job *j, const string *name, int src, int dst){\n\n unique( &_xid );\n _job = j;\n _serveridx = dst;\n _peeridx = src;\n _state = JOB_TODO_STATE_PENDING;\n _tries = 0;\n _delay_until = 0;\n\n _g.set_jobid( j->_id );\n _g.set_console( j->_g.console().c_str() );\n _g.set_master( myipandport.c_str() );\n _g.set_copyid( _xid.c_str() );\n _g.set_filename( name->c_str() );\n _g.add_location( _job->_servers[src]->name.c_str() );\n\n}\n\nvoid\nTaskToDo::create_xfers(void){\n\n \/\/ files from last step can stay where they are\n if( _job->_stepno == _job->_plan.size() - 1 ) return;\n\n \/\/ for all outfiles\n \/\/ new Xfer -> job pend\n\n int nserv = _job->_servers.size();\n int noutf = _g.outfile_size();\n\n for(int i=0; i_pending.push_back(x);\n _job->_xfers.push_back(x);\n }\n}\n\n<|endoftext|>"} {"text":"#include \"video.h\"\n#include \"misc.h\"\n\n#include \n\nusing namespace std;\n\nVideo::Video(string imgFolder, string imgPrefix, int w, int h) {\n\timageFolder = imgFolder;\n\timagePrefix = imgPrefix;\n\n\twidth = to_string(w);\n\theight = to_string(h);\n}\n\nvoid Video::ClearImageFolder() {\n\tsystem( (\"rm \" + imageFolder + \"*.ppm\").c_str() );\n}\n\nvoid Video::Build(string outputFName, int frameCount) {\n\toutputFileName = outputFName;\n\tint framerate = 60;\n\n\t\/\/string command = \"\/usr\/local\/bin\/ffmpeg \";\n\tstring command = \"avconv \";\n\t\/\/command += \"-loglevel panic \";\n\tcommand += \"-r \" + to_string(framerate) + \" \";\n\tcommand += \"-s \" + width + \"x\" + height + \" \";\n\tcommand += \"-i \" + imageFolder + imagePrefix + \"%0\" + to_string(NumberLength(frameCount) - 1) + \"d.ppm \";\n\tcommand += \"-vcodec libx264 -crf 25 -pix_fmt yuv420p \";\n\tcommand += \"-y \";\n\tcommand += outputFileName;\n\n\tsystem( command.c_str() );\n}\n\nvoid Video::Open() {\n\tsystem( (\"open \" + outputFileName).c_str() );\n}\nActually fixed video compilation issue#include \"video.h\"\n#include \"misc.h\"\n\n#include \n\nusing namespace std;\n\nVideo::Video(string imgFolder, string imgPrefix, int w, int h) {\n\timageFolder = imgFolder;\n\timagePrefix = imgPrefix;\n\n\twidth = to_string(w);\n\theight = to_string(h);\n}\n\nvoid Video::ClearImageFolder() {\n\tsystem( (\"rm \" + imageFolder + \"*.ppm\").c_str() );\n}\n\nvoid Video::Build(string outputFName, int frameCount) {\n\toutputFileName = outputFName;\n\tint framerate = 60;\n\n\t\/\/string command = \"\/usr\/local\/bin\/ffmpeg \";\n\tstring command = \"avconv \";\n\t\/\/command += \"-loglevel panic \";\n\tcommand += \"-r \" + to_string(framerate) + \" \";\n\tcommand += \"-s \" + width + \"x\" + height + \" \";\n\tcommand += \"-i \" + imageFolder + imagePrefix + \"%0\" + to_string(NumberLength(frameCount - 1)) + \"d.ppm \";\n\tcommand += \"-vcodec libx264 -crf 25 -pix_fmt yuv420p \";\n\tcommand += \"-y \";\n\tcommand += outputFileName;\n\n\tsystem( command.c_str() );\n}\n\nvoid Video::Open() {\n\tsystem( (\"open \" + outputFileName).c_str() );\n}\n<|endoftext|>"} {"text":"\/*\n * Copyright 2009-2019 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 \n#include \n#include \n#include \n#include \n#include \n#include \n\nnamespace votca {\nnamespace csg {\nclass Molecule;\n} \/\/ namespace csg\nnamespace tools {\nclass Property;\n} \/\/ namespace tools\n} \/\/ namespace votca\n\nnamespace votca {\nnamespace csg {\n\nusing namespace std;\n\nMap::~Map() {\n vector::iterator iter;\n for (iter = _maps.begin(); iter != _maps.end(); ++iter) delete (*iter);\n _maps.clear();\n}\n\nvoid Map::Apply() {\n vector::iterator iter;\n for (iter = _maps.begin(); iter != _maps.end(); ++iter) (*iter)->Apply();\n}\n\nvoid Map_Sphere::Initialize(Molecule *in, Bead *out, Property *opts_bead,\n Property *opts_map) {\n BeadMap::Initialize(in, out, opts_bead, opts_map);\n\n vector beads;\n vector weights;\n vector fweights;\n\n \/\/ get the beads\n string s(_opts_bead->get(\"beads\").value());\n Tokenizer tok_beads(s, \" \\n\\t\");\n tok_beads.ToVector(beads);\n\n \/\/ get vector of weights\n Tokenizer tok_weights(_opts_map->get(\"weights\").value(), \" \\n\\t\");\n tok_weights.ConvertToVector(weights);\n\n \/\/ check weather weights and # beads matches\n if (beads.size() != weights.size())\n throw runtime_error(\n string(\"number of subbeads in \" + opts_bead->get(\"name\").as() +\n \" and number of weights in map \" +\n opts_map->get(\"name\").as() + \" do not match\"));\n\n \/\/ normalize the weights\n double norm = 1. \/ std::accumulate(weights.begin(), weights.end(), 0.);\n\n transform(weights.begin(), weights.end(), weights.begin(),\n bind2nd(multiplies(), norm));\n \/\/ get the d vector if exists or initialize same as weights\n vector d;\n if (_opts_map->exists(\"d\")) {\n Tokenizer tok_weights(_opts_map->get(\"d\").value(), \" \\n\\t\");\n tok_weights.ConvertToVector(d);\n \/\/ normalize d coefficients\n norm = 1. \/ std::accumulate(d.begin(), d.end(), 0.);\n transform(d.begin(), d.end(), d.begin(),\n bind2nd(multiplies(), norm));\n } else {\n \/\/ initialize force-weights with weights\n d.resize(weights.size());\n copy(weights.begin(), weights.end(), d.begin());\n }\n\n \/\/ check weather number of d coeffs is correct\n if (beads.size() != d.size()) {\n throw runtime_error(\n string(\"number of subbeads in \" + opts_bead->get(\"name\").as() +\n \" and number of d-coefficients in map \" +\n opts_map->get(\"name\").as() + \" do not match\"));\n }\n\n fweights.resize(weights.size());\n \/\/ calculate force weights by d_i\/w_i\n for (size_t i = 0; i < weights.size(); ++i) {\n if (weights[i] == 0 && d[i] != 0) {\n throw runtime_error(\n \"A d coefficient is nonzero while weights is zero in mapping \" +\n opts_map->get(\"name\").as());\n }\n if (weights[i] != 0)\n fweights[i] = d[i] \/ weights[i];\n else\n fweights[i] = 0;\n }\n\n for (size_t i = 0; i < beads.size(); ++i) {\n int iin = in->getBeadByName(beads[i]);\n if (iin < 0)\n throw std::runtime_error(\n string(\"mapping error: molecule \" + beads[i] + \" does not exist\"));\n AddElem(in->getBead(iin), weights[i], fweights[i]);\n }\n}\n\nvoid Map_Sphere::Apply() {\n vector::iterator iter;\n vec cg(0., 0., 0.), f(0., 0., 0.), vel(0., 0., 0.);\n bool bPos, bVel, bF;\n bPos = bVel = bF = false;\n _out->ClearParentBeads();\n\n \/\/ the following is needed for pbc treatment\n Topology *top = _out->getParent();\n double max_dist = 0.5 * top->ShortestBoxSize();\n vec r0 = vec(0, 0, 0);\n string name0;\n int id0 = 0;\n if (_matrix.size() > 0) {\n if (_matrix.front()._in->HasPos()) {\n r0 = _matrix.front()._in->getPos();\n name0 = _matrix.front()._in->getName();\n id0 = _matrix.front()._in->getId();\n }\n }\n\n double M = 0;\n\n for (iter = _matrix.begin(); iter != _matrix.end(); ++iter) {\n Bead *bead = iter->_in;\n _out->AddParentBead(bead->getId());\n M += bead->getMass();\n if (bead->HasPos()) {\n vec r = top->BCShortestConnection(r0, bead->getPos());\n if (abs(r) > max_dist) {\n cout << r0 << \" \" << bead->getPos() << endl;\n throw std::runtime_error(\n \"coarse-grained bead is bigger than half the box \\n (atoms \" +\n name0 + \" (id \" + boost::lexical_cast(id0 + 1) + \")\" +\n \", \" + bead->getName() + \" (id \" +\n boost::lexical_cast(bead->getId() + 1) + \")\" +\n +\" , molecule \" +\n boost::lexical_cast(bead->getMolecule()->getId() + 1) +\n \")\");\n }\n cg += (*iter)._weight * (r + r0);\n bPos = true;\n }\n if (bead->HasVel()) {\n vel += (*iter)._weight * bead->getVel();\n bVel = true;\n }\n if (bead->HasF()) {\n f += (*iter)._force_weight * bead->getF();\n bF = true;\n }\n }\n _out->setMass(M);\n if (bPos) _out->setPos(cg);\n if (bVel) _out->setVel(vel);\n if (bF) _out->setF(f);\n}\n\n\/\/\/ \\todo implement this function\nvoid Map_Ellipsoid::Apply() {\n vector::iterator iter;\n vec cg(0., 0., 0.), c(0., 0., 0.), f(0., 0., 0.), vel(0., 0., 0.);\n matrix m(0.);\n bool bPos, bVel, bF;\n bPos = bVel = bF = false;\n\n \/\/ the following is needed for pbc treatment\n Topology *top = _out->getParent();\n double max_dist = 0.5 * top->ShortestBoxSize();\n vec r0 = vec(0, 0, 0);\n if (_matrix.size() > 0) {\n if (_matrix.front()._in->HasPos()) {\n r0 = _matrix.front()._in->getPos();\n }\n }\n\n int n;\n n = 0;\n _out->ClearParentBeads();\n for (iter = _matrix.begin(); iter != _matrix.end(); ++iter) {\n Bead *bead = iter->_in;\n _out->AddParentBead(bead->getId());\n if (bead->HasPos()) {\n vec r = top->BCShortestConnection(r0, bead->getPos());\n if (abs(r) > max_dist)\n throw std::runtime_error(\n \"coarse-grained bead is bigger than half the box\");\n cg += (*iter)._weight * (r + r0);\n bPos = true;\n }\n if (bead->HasVel() == true) {\n vel += (*iter)._weight * bead->getVel();\n bVel = true;\n }\n if (bead->HasF()) {\n \/\/\/ \\todo fix me, right calculation should be F_i = m_cg \/ sum(w_i) *\n \/\/\/ sum(w_i\/m_i*F_i)\n \/\/ f += (*iter)._weight * _in->getBeadF((*iter)._in);\n f += (*iter)._force_weight * bead->getF();\n bF = true;\n }\n\n if ((*iter)._weight > 0 && bead->HasPos()) {\n c += bead->getPos();\n n++;\n }\n }\n\n if (bPos) _out->setPos(cg);\n if (bVel) _out->setVel(vel);\n if (bF) _out->setF(f);\n\n if (!_matrix[0]._in->HasPos()) {\n _out->setU(vec(1.0, 0, 0));\n _out->setV(vec(.0, 1, 0));\n _out->setW(vec(.0, 0, 1));\n return;\n }\n\n \/\/ calculate the tensor of gyration\n c = c \/ (double)n;\n for (iter = _matrix.begin(); iter != _matrix.end(); ++iter) {\n if ((*iter)._weight == 0) continue;\n Bead *bead = iter->_in;\n vec v = bead->getPos() - c;\n \/\/ v = vec(1, 0.5, 0) * 0.*(drand48()-0.5)\n \/\/ + vec(0.5, -1, 0) * (drand48()-0.5)\n \/\/ + vec(0, 0, 1) * (drand48()-0.5);\n\n \/\/ Normalize the tensor with 1\/number_of_atoms_per_bead\n m[0][0] += v.getX() * v.getX() \/ (double)_matrix.size();\n m[0][1] += v.getX() * v.getY() \/ (double)_matrix.size();\n m[0][2] += v.getX() * v.getZ() \/ (double)_matrix.size();\n m[1][1] += v.getY() * v.getY() \/ (double)_matrix.size();\n m[1][2] += v.getY() * v.getZ() \/ (double)_matrix.size();\n m[2][2] += v.getZ() * v.getZ() \/ (double)_matrix.size();\n }\n m[1][0] = m[0][1];\n m[2][0] = m[0][2];\n m[2][1] = m[1][2];\n\n \/\/ calculate the eigenvectors\n matrix::eigensystem_t es;\n m.SolveEigensystem(es);\n\n \/\/ vec eigenv1=es.eigenvecs[0];\n \/\/ vec eigenv2=es.eigenvecs[1];\n \/\/ vec eigenv3=es.eigenvecs[2];\n\n \/* _out->seteigenvec1(eigenv1);\n _out->seteigenvec2(eigenv2);\n _out->seteigenvec3(eigenv3);\n *\/\n\n vec u = es.eigenvecs[0];\n vec v = _matrix[1]._in->getPos() - _matrix[0]._in->getPos();\n v.normalize();\n\n _out->setV(v);\n\n vec w = _matrix[2]._in->getPos() - _matrix[0]._in->getPos();\n w.normalize();\n\n if ((v ^ w) * u < 0) u = vec(0., 0., 0.) - u;\n _out->setU(u);\n\n \/\/ write out w\n w = u ^ v;\n w.normalize();\n _out->setW(w);\n\n \/\/ out.BeadV(_out) = v;\n\n \/\/ out.BeadW(_out) = es.eigenvecs[2];\n}\n\n} \/\/ namespace csg\n} \/\/ namespace votca\nAdded numeric include\/*\n * Copyright 2009-2019 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 \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n\nnamespace votca {\nnamespace csg {\nclass Molecule;\n} \/\/ namespace csg\nnamespace tools {\nclass Property;\n} \/\/ namespace tools\n} \/\/ namespace votca\n\nnamespace votca {\nnamespace csg {\n\nusing namespace std;\n\nMap::~Map() {\n vector::iterator iter;\n for (iter = _maps.begin(); iter != _maps.end(); ++iter) delete (*iter);\n _maps.clear();\n}\n\nvoid Map::Apply() {\n vector::iterator iter;\n for (iter = _maps.begin(); iter != _maps.end(); ++iter) (*iter)->Apply();\n}\n\nvoid Map_Sphere::Initialize(Molecule *in, Bead *out, Property *opts_bead,\n Property *opts_map) {\n BeadMap::Initialize(in, out, opts_bead, opts_map);\n\n vector beads;\n vector weights;\n vector fweights;\n\n \/\/ get the beads\n string s(_opts_bead->get(\"beads\").value());\n Tokenizer tok_beads(s, \" \\n\\t\");\n tok_beads.ToVector(beads);\n\n \/\/ get vector of weights\n Tokenizer tok_weights(_opts_map->get(\"weights\").value(), \" \\n\\t\");\n tok_weights.ConvertToVector(weights);\n\n \/\/ check weather weights and # beads matches\n if (beads.size() != weights.size())\n throw runtime_error(\n string(\"number of subbeads in \" + opts_bead->get(\"name\").as() +\n \" and number of weights in map \" +\n opts_map->get(\"name\").as() + \" do not match\"));\n\n \/\/ normalize the weights\n double norm = 1. \/ std::accumulate(weights.begin(), weights.end(), 0.);\n\n transform(weights.begin(), weights.end(), weights.begin(),\n bind2nd(multiplies(), norm));\n \/\/ get the d vector if exists or initialize same as weights\n vector d;\n if (_opts_map->exists(\"d\")) {\n Tokenizer tok_weights(_opts_map->get(\"d\").value(), \" \\n\\t\");\n tok_weights.ConvertToVector(d);\n \/\/ normalize d coefficients\n norm = 1. \/ std::accumulate(d.begin(), d.end(), 0.);\n transform(d.begin(), d.end(), d.begin(),\n bind2nd(multiplies(), norm));\n } else {\n \/\/ initialize force-weights with weights\n d.resize(weights.size());\n copy(weights.begin(), weights.end(), d.begin());\n }\n\n \/\/ check weather number of d coeffs is correct\n if (beads.size() != d.size()) {\n throw runtime_error(\n string(\"number of subbeads in \" + opts_bead->get(\"name\").as() +\n \" and number of d-coefficients in map \" +\n opts_map->get(\"name\").as() + \" do not match\"));\n }\n\n fweights.resize(weights.size());\n \/\/ calculate force weights by d_i\/w_i\n for (size_t i = 0; i < weights.size(); ++i) {\n if (weights[i] == 0 && d[i] != 0) {\n throw runtime_error(\n \"A d coefficient is nonzero while weights is zero in mapping \" +\n opts_map->get(\"name\").as());\n }\n if (weights[i] != 0)\n fweights[i] = d[i] \/ weights[i];\n else\n fweights[i] = 0;\n }\n\n for (size_t i = 0; i < beads.size(); ++i) {\n int iin = in->getBeadByName(beads[i]);\n if (iin < 0)\n throw std::runtime_error(\n string(\"mapping error: molecule \" + beads[i] + \" does not exist\"));\n AddElem(in->getBead(iin), weights[i], fweights[i]);\n }\n}\n\nvoid Map_Sphere::Apply() {\n vector::iterator iter;\n vec cg(0., 0., 0.), f(0., 0., 0.), vel(0., 0., 0.);\n bool bPos, bVel, bF;\n bPos = bVel = bF = false;\n _out->ClearParentBeads();\n\n \/\/ the following is needed for pbc treatment\n Topology *top = _out->getParent();\n double max_dist = 0.5 * top->ShortestBoxSize();\n vec r0 = vec(0, 0, 0);\n string name0;\n int id0 = 0;\n if (_matrix.size() > 0) {\n if (_matrix.front()._in->HasPos()) {\n r0 = _matrix.front()._in->getPos();\n name0 = _matrix.front()._in->getName();\n id0 = _matrix.front()._in->getId();\n }\n }\n\n double M = 0;\n\n for (iter = _matrix.begin(); iter != _matrix.end(); ++iter) {\n Bead *bead = iter->_in;\n _out->AddParentBead(bead->getId());\n M += bead->getMass();\n if (bead->HasPos()) {\n vec r = top->BCShortestConnection(r0, bead->getPos());\n if (abs(r) > max_dist) {\n cout << r0 << \" \" << bead->getPos() << endl;\n throw std::runtime_error(\n \"coarse-grained bead is bigger than half the box \\n (atoms \" +\n name0 + \" (id \" + boost::lexical_cast(id0 + 1) + \")\" +\n \", \" + bead->getName() + \" (id \" +\n boost::lexical_cast(bead->getId() + 1) + \")\" +\n +\" , molecule \" +\n boost::lexical_cast(bead->getMolecule()->getId() + 1) +\n \")\");\n }\n cg += (*iter)._weight * (r + r0);\n bPos = true;\n }\n if (bead->HasVel()) {\n vel += (*iter)._weight * bead->getVel();\n bVel = true;\n }\n if (bead->HasF()) {\n f += (*iter)._force_weight * bead->getF();\n bF = true;\n }\n }\n _out->setMass(M);\n if (bPos) _out->setPos(cg);\n if (bVel) _out->setVel(vel);\n if (bF) _out->setF(f);\n}\n\n\/\/\/ \\todo implement this function\nvoid Map_Ellipsoid::Apply() {\n vector::iterator iter;\n vec cg(0., 0., 0.), c(0., 0., 0.), f(0., 0., 0.), vel(0., 0., 0.);\n matrix m(0.);\n bool bPos, bVel, bF;\n bPos = bVel = bF = false;\n\n \/\/ the following is needed for pbc treatment\n Topology *top = _out->getParent();\n double max_dist = 0.5 * top->ShortestBoxSize();\n vec r0 = vec(0, 0, 0);\n if (_matrix.size() > 0) {\n if (_matrix.front()._in->HasPos()) {\n r0 = _matrix.front()._in->getPos();\n }\n }\n\n int n;\n n = 0;\n _out->ClearParentBeads();\n for (iter = _matrix.begin(); iter != _matrix.end(); ++iter) {\n Bead *bead = iter->_in;\n _out->AddParentBead(bead->getId());\n if (bead->HasPos()) {\n vec r = top->BCShortestConnection(r0, bead->getPos());\n if (abs(r) > max_dist)\n throw std::runtime_error(\n \"coarse-grained bead is bigger than half the box\");\n cg += (*iter)._weight * (r + r0);\n bPos = true;\n }\n if (bead->HasVel() == true) {\n vel += (*iter)._weight * bead->getVel();\n bVel = true;\n }\n if (bead->HasF()) {\n \/\/\/ \\todo fix me, right calculation should be F_i = m_cg \/ sum(w_i) *\n \/\/\/ sum(w_i\/m_i*F_i)\n \/\/ f += (*iter)._weight * _in->getBeadF((*iter)._in);\n f += (*iter)._force_weight * bead->getF();\n bF = true;\n }\n\n if ((*iter)._weight > 0 && bead->HasPos()) {\n c += bead->getPos();\n n++;\n }\n }\n\n if (bPos) _out->setPos(cg);\n if (bVel) _out->setVel(vel);\n if (bF) _out->setF(f);\n\n if (!_matrix[0]._in->HasPos()) {\n _out->setU(vec(1.0, 0, 0));\n _out->setV(vec(.0, 1, 0));\n _out->setW(vec(.0, 0, 1));\n return;\n }\n\n \/\/ calculate the tensor of gyration\n c = c \/ (double)n;\n for (iter = _matrix.begin(); iter != _matrix.end(); ++iter) {\n if ((*iter)._weight == 0) continue;\n Bead *bead = iter->_in;\n vec v = bead->getPos() - c;\n \/\/ v = vec(1, 0.5, 0) * 0.*(drand48()-0.5)\n \/\/ + vec(0.5, -1, 0) * (drand48()-0.5)\n \/\/ + vec(0, 0, 1) * (drand48()-0.5);\n\n \/\/ Normalize the tensor with 1\/number_of_atoms_per_bead\n m[0][0] += v.getX() * v.getX() \/ (double)_matrix.size();\n m[0][1] += v.getX() * v.getY() \/ (double)_matrix.size();\n m[0][2] += v.getX() * v.getZ() \/ (double)_matrix.size();\n m[1][1] += v.getY() * v.getY() \/ (double)_matrix.size();\n m[1][2] += v.getY() * v.getZ() \/ (double)_matrix.size();\n m[2][2] += v.getZ() * v.getZ() \/ (double)_matrix.size();\n }\n m[1][0] = m[0][1];\n m[2][0] = m[0][2];\n m[2][1] = m[1][2];\n\n \/\/ calculate the eigenvectors\n matrix::eigensystem_t es;\n m.SolveEigensystem(es);\n\n \/\/ vec eigenv1=es.eigenvecs[0];\n \/\/ vec eigenv2=es.eigenvecs[1];\n \/\/ vec eigenv3=es.eigenvecs[2];\n\n \/* _out->seteigenvec1(eigenv1);\n _out->seteigenvec2(eigenv2);\n _out->seteigenvec3(eigenv3);\n *\/\n\n vec u = es.eigenvecs[0];\n vec v = _matrix[1]._in->getPos() - _matrix[0]._in->getPos();\n v.normalize();\n\n _out->setV(v);\n\n vec w = _matrix[2]._in->getPos() - _matrix[0]._in->getPos();\n w.normalize();\n\n if ((v ^ w) * u < 0) u = vec(0., 0., 0.) - u;\n _out->setU(u);\n\n \/\/ write out w\n w = u ^ v;\n w.normalize();\n _out->setW(w);\n\n \/\/ out.BeadV(_out) = v;\n\n \/\/ out.BeadW(_out) = es.eigenvecs[2];\n}\n\n} \/\/ namespace csg\n} \/\/ namespace votca\n<|endoftext|>"} {"text":"\/*\n pvsops.c: pvs and other spectral-based opcodes\n\n Copyright (C) 2017 Victor Lazzarini\n This file is part of Csound.\n\n The Csound Library is free software; you can redistribute it\n and\/or modify it under the terms of the GNU Lesser General Public\n License as published by the Free Software Foundation; either\n version 2.1 of the License, or (at your option) any later version.\n\n Csound is distributed in the hope that it will be useful,\n but WITHOUT ANY WARRANTY; without even the implied warranty of\n MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the\n GNU Lesser General Public License for more details.\n\n You should have received a copy of the GNU Lesser General Public\n License along with Csound; if not, write to the Free Software\n Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA\n 02111-1307 USA\n*\/\n#include \n#include \n\nstruct PVTrace : csnd::FPlugin<1, 2> {\n csnd::AuxMem amps;\n static constexpr char const *otypes = \"f\";\n static constexpr char const *itypes = \"fk\";\n\n int init() {\n if (inargs.fsig_data(0).isSliding())\n return csound->init_error(Str(\"sliding not supported\"));\n\n if (inargs.fsig_data(0).fsig_format() != csnd::fsig_format::pvs &&\n inargs.fsig_data(0).fsig_format() != csnd::fsig_format::polar)\n return csound->init_error(Str(\"fsig format not supported\"));\n\n amps.allocate(csound, inargs.fsig_data(0).nbins());\n csnd::Fsig &fout = outargs.fsig_data(0);\n fout.init(csound, inargs.fsig_data(0));\n framecount = 0;\n return OK;\n }\n\n int kperf() {\n csnd::pv_frame &fin = inargs.fsig_data(0);\n csnd::pv_frame &fout = outargs.fsig_data(0);\n\n if (framecount < fin.count()) {\n int n = fin.len() - (int)inargs[1];\n float thrsh;\n std::transform(fin.begin(), fin.end(), amps.begin(),\n [](csnd::pv_bin f) { return f.amp(); });\n std::nth_element(amps.begin(), amps.begin() + n, amps.end());\n thrsh = amps[n];\n std::transform(fin.begin(), fin.end(), fout.begin(),\n [thrsh](csnd::pv_bin f) {\n return f.amp() >= thrsh ? f : csnd::pv_bin();\n });\n framecount = fout.count(fin.count());\n }\n return OK;\n }\n};\n\nstruct TVConv : csnd::Plugin<1, 6> {\n csnd::AuxMem ir;\n csnd::AuxMem in;\n csnd::AuxMem insp;\n csnd::AuxMem irsp;\n csnd::AuxMem out;\n csnd::AuxMem saved;\n uint32_t n;\n uint32_t fils;\n uint32_t pars;\n uint32_t ffts;\n uint32_t nparts;\n uint32_t pp;\n csnd::fftp fwd, inv;\n typedef std::complex cmplx;\n\n uint32_t rpow2(uint32_t n) {\n uint32_t v = 2;\n while (v <= n)\n v <<= 1;\n if ((n - (v >> 1)) < (v - n))\n return v >> 1;\n else\n return v;\n }\n\n cmplx *to_cmplx(MYFLT *f) { return reinterpret_cast(f); }\n\n cmplx real_prod(cmplx &a, cmplx &b) {\n return cmplx(a.real() * b.real(), a.imag() * b.imag());\n }\n\n int init() {\n pars = inargs[4];\n fils = inargs[5];\n if (pars > fils)\n std::swap(pars, fils);\n if (pars > 1) {\n pars = rpow2(pars);\n fils = rpow2(fils);\n ffts = pars * 2;\n fwd = csound->fft_setup(ffts, FFT_FWD);\n inv = csound->fft_setup(ffts, FFT_INV);\n out.allocate(csound, 2 * pars);\n insp.allocate(csound, 2 * fils);\n irsp.allocate(csound, 2 * fils);\n saved.allocate(csound, pars);\n ir.allocate(csound, 2 * fils);\n in.allocate(csound, 2 * fils);\n nparts = fils \/ pars;\n fils *= 2;\n } else {\n ir.allocate(csound, fils);\n in.allocate(csound, fils);\n }\n n = 0;\n pp = 0;\n return OK;\n }\n\n int pconv() {\n csnd::AudioSig insig(this, inargs(0));\n csnd::AudioSig irsig(this, inargs(1));\n csnd::AudioSig outsig(this, outargs(0));\n auto irp = irsig.begin();\n auto inp = insig.begin();\n MYFLT *frz1 = inargs(2);\n MYFLT *frz2 = inargs(3);\n bool inc1 = csound->is_asig(frz1);\n bool inc2 = csound->is_asig(frz2);\n\n for (auto &s : outsig) {\n if(*frz1 > 0) in[pp + n] = *inp;\n if(*frz2 > 0) ir[pp + n] = *irp;\n\n s = out[n] + saved[n];\n saved[n] = out[n + pars];\n if (++n == pars) {\n cmplx *ins, *irs, *ous = to_cmplx(out.data());\n std::copy(in.begin() + pp, in.begin() + pp + ffts, insp.begin() + pp);\n std::copy(ir.begin() + pp, ir.begin() + pp + ffts, irsp.begin() + pp);\n std::fill(out.begin(), out.end(), 0.);\n \/\/ FFT\n csound->rfft(fwd, insp.data() + pp);\n csound->rfft(fwd, irsp.data() + pp);\n pp += ffts;\n if (pp == fils)\n pp = 0;\n \/\/ spectral delay line\n for (uint32_t k = 0, kp = pp; k < nparts; k++, kp += ffts) {\n if (kp == fils)\n kp = 0;\n ins = to_cmplx(insp.data() + kp);\n irs = to_cmplx(irsp.data() + (nparts - k - 1) * ffts);\n \/\/ spectral product\n for (uint32_t i = 1; i < pars; i++)\n ous[i] += ins[i] * irs[i];\n ous[0] += real_prod(ins[0], irs[0]);\n }\n \/\/ IFFT\n csound->rfft(inv, out.data());\n n = 0;\n }\n frz1 += inc1;\n frz2 += inc2;\n irp++;\n inp++;\n }\n return OK;\n }\n\n\n int pconv_ols() {\n csnd::AudioSig insig(this, inargs(0));\n csnd::AudioSig irsig(this, inargs(1));\n csnd::AudioSig outsig(this, outargs(0));\n auto irp = irsig.begin();\n auto inp = insig.begin();\n MYFLT *frz1 = inargs(2);\n MYFLT *frz2 = inargs(3);\n bool inc1 = csound->is_asig(frz1);\n bool inc2 = csound->is_asig(frz2);\n\n for (auto &s : outsig) {\n if(*frz1 > 0) \n\tin[pp + n + pars] = *inp;\n if(*frz2 > 0)\n ir[pp + n] = *irp;\n\n s = out[n+pars];\n \n if (++n == pars) {\n cmplx *ins, *irs, *ous = to_cmplx(out.data());\n\tuint32_t po = pp;\n std::copy(in.begin() + pp, in.begin() + pp + ffts, insp.begin() + pp);\n\tstd::copy(ir.begin() + pp, ir.begin() + pp + ffts, irsp.begin() + pp);\n std::fill(out.begin(), out.end(), 0.);\n \/\/ FFT\n csound->rfft(fwd, insp.data() + pp);\n\tcsound->rfft(fwd, irsp.data() + pp);\n pp += ffts;\n\tif (pp == fils) pp = 0;\n \/\/ spectral delay line\n for (uint32_t k = 0, kp = pp; k < nparts; k++, kp += ffts) {\n\t if (kp == fils) kp = 0;\n ins = to_cmplx(insp.data() + kp);\n irs = to_cmplx(irsp.data() + (nparts - k - 1) * ffts);\n \/\/ spectral product\n for (uint32_t i = 1; i < pars; i++)\n ous[i] += ins[i] * irs[i];\n ous[0] += real_prod(ins[0], irs[0]);\n\t }\n \/\/ IFFT\n csound->rfft(inv, out.data());\n\tstd::copy(in.begin() + po + pars, in.begin() + po + ffts, in.begin() + pp);\n n = 0;\n }\n frz1 += inc1;\n frz2 += inc2;\n irp++;\n inp++;\n }\n return OK;\n }\n\n\n int dconv() {\n csnd::AudioSig insig(this, inargs(0));\n csnd::AudioSig irsig(this, inargs(1));\n csnd::AudioSig outsig(this, outargs(0));\n auto irp = irsig.begin();\n auto inp = insig.begin();\n MYFLT *frz1 = inargs(2);\n MYFLT *frz2 = inargs(3);\n bool inc1 = csound->is_asig(frz1);\n bool inc2 = csound->is_asig(frz2);\n for (auto &s : outsig) {\n if(*frz1 > 0) in[pp] = *inp;\n if(*frz2 > 0) ir[pp] = *irp;\n pp = pp != fils - 1 ? pp + 1 : 0;\n s = 0.;\n for (uint32_t k = 0, kp = pp; k < fils; k++, kp++) {\n if (kp == fils)\n kp = 0;\n s += in[kp] * ir[fils - k - 1];\n }\n frz1 += inc1;\n frz2 += inc2;\n inp++;\n irp++;\n }\n return OK;\n }\n\n int aperf() {\n if (pars > 1)\n return pconv();\n else\n return dconv();\n }\n};\n\n\/*\nclass PrintThread : public csnd::Thread {\n std::atomic_bool splock;\n std::atomic_bool on;\n std::string message;\n\n void lock() {\n bool tmp = false;\n while(!splock.compare_exchange_weak(tmp,true))\n tmp = false;\n }\n \n void unlock() {\n splock = false;\n }\n\n uintptr_t run() {\n std::string old;\n while(on) {\n lock();\n if(old.compare(message)) {\n csound->message(message.c_str());\n old = message;\n } \n unlock(); \n }\n return 0;\n }\n \npublic:\n PrintThread(csnd::Csound *csound)\n : Thread(csound), splock(false), on(true), message(\"\") {};\n\n ~PrintThread(){\n on = false;\n join();\n }\n \n void set_message(const char *m) {\n lock();\n message = m;\n unlock(); \n }\n \n};\n\n\nstruct TPrint : csnd::Plugin<0, 1> {\n static constexpr char const *otypes = \"\";\n static constexpr char const *itypes = \"S\";\n PrintThread t;\n\n int init() {\n csound->plugin_deinit(this);\n csnd::constr(&t, csound);\n return OK;\n }\n\n int deinit() {\n csnd::destr(&t);\n return OK;\n }\n\n int kperf() {\n t.set_message(inargs.str_data(0).data);\n return OK;\n }\n};\n*\/\n\n\n\n#include \nvoid csnd::on_load(Csound *csound) {\n csnd::plugin(csound, \"pvstrace\", csnd::thread::ik);\n csnd::plugin(csound, \"tvconv\", \"a\", \"aakkii\", csnd::thread::ia);\n csnd::plugin(csound, \"tvconv\", \"a\", \"aaakii\", csnd::thread::ia);\n csnd::plugin(csound, \"tvconv\", \"a\", \"aakaii\", csnd::thread::ia);\n csnd::plugin(csound, \"tvconv\", \"a\", \"aaaaii\", csnd::thread::ia);\n}\nupdated tvconv code\/*\n pvsops.c: pvs and other spectral-based opcodes\n\n Copyright (C) 2017 Victor Lazzarini\n This file is part of Csound.\n\n The Csound Library is free software; you can redistribute it\n and\/or modify it under the terms of the GNU Lesser General Public\n License as published by the Free Software Foundation; either\n version 2.1 of the License, or (at your option) any later version.\n\n Csound is distributed in the hope that it will be useful,\n but WITHOUT ANY WARRANTY; without even the implied warranty of\n MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the\n GNU Lesser General Public License for more details.\n\n You should have received a copy of the GNU Lesser General Public\n License along with Csound; if not, write to the Free Software\n Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA\n 02111-1307 USA\n*\/\n#include \n#include \n\nstruct PVTrace : csnd::FPlugin<1, 2> {\n csnd::AuxMem amps;\n static constexpr char const *otypes = \"f\";\n static constexpr char const *itypes = \"fk\";\n\n int init() {\n if (inargs.fsig_data(0).isSliding())\n return csound->init_error(Str(\"sliding not supported\"));\n\n if (inargs.fsig_data(0).fsig_format() != csnd::fsig_format::pvs &&\n inargs.fsig_data(0).fsig_format() != csnd::fsig_format::polar)\n return csound->init_error(Str(\"fsig format not supported\"));\n\n amps.allocate(csound, inargs.fsig_data(0).nbins());\n csnd::Fsig &fout = outargs.fsig_data(0);\n fout.init(csound, inargs.fsig_data(0));\n framecount = 0;\n return OK;\n }\n\n int kperf() {\n csnd::pv_frame &fin = inargs.fsig_data(0);\n csnd::pv_frame &fout = outargs.fsig_data(0);\n\n if (framecount < fin.count()) {\n int n = fin.len() - (int)inargs[1];\n float thrsh;\n std::transform(fin.begin(), fin.end(), amps.begin(),\n [](csnd::pv_bin f) { return f.amp(); });\n std::nth_element(amps.begin(), amps.begin() + n, amps.end());\n thrsh = amps[n];\n std::transform(fin.begin(), fin.end(), fout.begin(),\n [thrsh](csnd::pv_bin f) {\n return f.amp() >= thrsh ? f : csnd::pv_bin();\n });\n framecount = fout.count(fin.count());\n }\n return OK;\n }\n};\n\nstruct TVConv : csnd::Plugin<1, 6> {\n csnd::AuxMem insp;\n csnd::AuxMem irsp;\n csnd::AuxMem out;\n csnd::AuxMem saved;\n csnd::AuxMem::iterator itn;\n csnd::AuxMem::iterator itr;\n uint32_t n;\n uint32_t fils;\n uint32_t pars;\n uint32_t ffts;\n\n csnd::fftp fwd, inv;\n typedef std::complex cmplx;\n\n uint32_t rpow2(uint32_t n) {\n uint32_t v = 2;\n while (v <= n)\n v <<= 1;\n if ((n - (v >> 1)) < (v - n))\n return v >> 1;\n else\n return v;\n }\n\n cmplx *to_cmplx(MYFLT *f) { return reinterpret_cast(f); }\n\n cmplx real_prod(cmplx &a, cmplx &b) {\n return cmplx(a.real() * b.real(), a.imag() * b.imag());\n }\n\n int init() {\n pars = inargs[4];\n fils = inargs[5];\n if (pars > fils)\n std::swap(pars, fils);\n if (pars > 1) {\n pars = rpow2(pars);\n fils = rpow2(fils) * 2;\n ffts = pars * 2;\n fwd = csound->fft_setup(ffts, FFT_FWD);\n inv = csound->fft_setup(ffts, FFT_INV);\n out.allocate(csound, ffts);\n insp.allocate(csound, fils);\n irsp.allocate(csound, fils);\n saved.allocate(csound, pars);\n n = 0;\n } else {\n insp.allocate(csound, fils);\n irsp.allocate(csound, fils);\n }\n itn = insp.begin();\n itr = irsp.begin();\n return OK;\n }\n\n int pconv() {\n csnd::AudioSig insig(this, inargs(0));\n csnd::AudioSig irsig(this, inargs(1));\n csnd::AudioSig outsig(this, outargs(0));\n auto irp = irsig.begin();\n auto inp = insig.begin();\n auto frz1 = inargs(2);\n auto frz2 = inargs(3);\n auto inc1 = csound->is_asig(frz1);\n auto inc2 = csound->is_asig(frz2);\n\n for (auto &s : outsig) {\n if(*frz1 > 0) itn[n] = *inp;\n if(*frz2 > 0) itr[n] = *irp;\n\n s = out[n] + saved[n];\n saved[n] = out[n + pars];\n if (++n == pars) {\n cmplx *ins, *irs, *ous = to_cmplx(out.data());\n\tstd::fill(itn + pars, itn + ffts, 0.);\n\tstd::fill(itr + pars, itr + ffts, 0.);\n\tstd::fill(out.begin(), out.end(), 0.);\n \/\/ FFT\n csound->rfft(fwd, itn);\n csound->rfft(fwd, itr);\n itn += ffts;\n\titr += ffts;\n if (itn == insp.end()) itn = insp.begin();\n if (itr == irsp.end()) itr = irsp.begin();\n \/\/ spectral delay line\n\tfor (csnd::AuxMem::iterator in = itn,\n\t ir = irsp.end() - ffts; ir >= irsp.begin();\n\t in += ffts, ir -= ffts) {\n\t if (in == insp.end()) in = insp.begin();\n\t ins = to_cmplx(in);\n irs = to_cmplx(ir);\n \/\/ spectral product\n for (uint32_t i = 1; i < pars; i++)\n ous[i] += ins[i] * irs[i];\n ous[0] += real_prod(ins[0], irs[0]);\n }\n \/\/ IFFT\n csound->rfft(inv, out.data());\n n = 0;\n }\n frz1 += inc1;\n frz2 += inc2;\n irp++;\n inp++;\n }\n return OK;\n }\n\n int dconv() {\n csnd::AudioSig insig(this, inargs(0));\n csnd::AudioSig irsig(this, inargs(1));\n csnd::AudioSig outsig(this, outargs(0));\n auto irp = irsig.begin();\n auto inp = insig.begin();\n auto frz1 = inargs(2);\n auto frz2 = inargs(3);\n auto inc1 = csound->is_asig(frz1);\n auto inc2 = csound->is_asig(frz2);\n\n for (auto &s : outsig) {\n if(*frz1 > 0) *itn++ = *inp;\n if(*frz2 > 0) *itr++ = *irp;\n if(itn == insp.end()) itn = insp.begin();\n if(itr == irsp.end()) itr = irsp.begin();\n s = 0.;\n for (csnd::AuxMem::iterator in = itn,\n\t ir = irsp.end() - 1; ir >= irsp.begin();\n\t in++, ir--) {\n\tif(in == insp.end()) in = insp.begin();\n s += *in * *ir;\n }\n frz1 += inc1;\n frz2 += inc2;\n inp++;\n irp++;\n }\n return OK;\n }\n\n int aperf() {\n if (pars > 1)\n return pconv();\n else\n return dconv();\n }\n};\n\n\/*\nclass PrintThread : public csnd::Thread {\n std::atomic_bool splock;\n std::atomic_bool on;\n std::string message;\n\n void lock() {\n bool tmp = false;\n while(!splock.compare_exchange_weak(tmp,true))\n tmp = false;\n }\n \n void unlock() {\n splock = false;\n }\n\n uintptr_t run() {\n std::string old;\n while(on) {\n lock();\n if(old.compare(message)) {\n csound->message(message.c_str());\n old = message;\n } \n unlock(); \n }\n return 0;\n }\n \npublic:\n PrintThread(csnd::Csound *csound)\n : Thread(csound), splock(false), on(true), message(\"\") {};\n\n ~PrintThread(){\n on = false;\n join();\n }\n \n void set_message(const char *m) {\n lock();\n message = m;\n unlock(); \n }\n \n};\n\n\nstruct TPrint : csnd::Plugin<0, 1> {\n static constexpr char const *otypes = \"\";\n static constexpr char const *itypes = \"S\";\n PrintThread t;\n\n int init() {\n csound->plugin_deinit(this);\n csnd::constr(&t, csound);\n return OK;\n }\n\n int deinit() {\n csnd::destr(&t);\n return OK;\n }\n\n int kperf() {\n t.set_message(inargs.str_data(0).data);\n return OK;\n }\n};\n*\/\n\n\n\n#include \nvoid csnd::on_load(Csound *csound) {\n csnd::plugin(csound, \"pvstrace\", csnd::thread::ik);\n csnd::plugin(csound, \"tvconv\", \"a\", \"aakkii\", csnd::thread::ia);\n csnd::plugin(csound, \"tvconv\", \"a\", \"aaakii\", csnd::thread::ia);\n csnd::plugin(csound, \"tvconv\", \"a\", \"aakaii\", csnd::thread::ia);\n csnd::plugin(csound, \"tvconv\", \"a\", \"aaaaii\", csnd::thread::ia);\n}\n<|endoftext|>"} {"text":"\/*************************************************************************\n *\n * $RCSfile: hfi_struct.hxx,v $\n *\n * $Revision: 1.1 $\n *\n * last change: $Author: np $ $Date: 2002-11-01 17:14: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 ADC_DISPLAY_HFI_STRUCT_HXX\n#define ADC_DISPLAY_HFI_STRUCT_HXX\n\n\n\n\/\/ USED SERVICES\n \/\/ BASE CLASSES\n#include \"hi_factory.hxx\"\n \/\/ COMPONENTS\n \/\/ PARAMETERS\n\n\nclass HF_IdlStruct : public HtmlFactory_Idl\n{\n public:\n\n HF_IdlStruct(\n Environment & io_rEnv,\n Xml::Element & o_rOut,\n bool i_bIsException );\n virtual ~HF_IdlStruct();\n\n void Produce_byData(\n const client & ce ) const;\n private:\n \/\/ Interface HtmlFactory_Idl:\n virtual type_id inq_BaseOf(\n const client & i_ce ) const;\n \/\/ Locals\n HF_NaviSubRow & make_Navibar(\n const client & ce ) const;\n virtual void produce_MemberDetails(\n HF_SubTitleTable & o_table,\n const client & ce ) const;\n \/\/ DATA\n bool bIsException;\n};\n\n\n\n\/\/ IMPLEMENTATION\n\n\nextern const String\n C_sCePrefix_Struct;\nextern const String\n C_sCePrefix_Exception;\n\n\n#endif\nINTEGRATION: CWS adc9 (1.1.116); FILE MERGED 2004\/11\/09 17:29:35 np 1.1.116.1: #i33253#\/*************************************************************************\n *\n * $RCSfile: hfi_struct.hxx,v $\n *\n * $Revision: 1.2 $\n *\n * last change: $Author: obo $ $Date: 2004-11-15 13:34: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 ADC_DISPLAY_HFI_STRUCT_HXX\n#define ADC_DISPLAY_HFI_STRUCT_HXX\n\n\n\n\/\/ USED SERVICES\n \/\/ BASE CLASSES\n#include \"hi_factory.hxx\"\n \/\/ COMPONENTS\n \/\/ PARAMETERS\n\n\/** Is used to display ->ary::idl::Exception s as well as ->ary::idl::Struct s.\n*\/\nclass HF_IdlStruct : public HtmlFactory_Idl\n{\n public:\n\n HF_IdlStruct(\n Environment & io_rEnv,\n Xml::Element & o_rOut,\n bool i_bIsException );\n virtual ~HF_IdlStruct();\n\n void Produce_byData(\n const client & ce ) const;\n private:\n \/\/ Interface HtmlFactory_Idl:\n virtual type_id inq_BaseOf(\n const client & i_ce ) const;\n \/\/ Locals\n HF_NaviSubRow & make_Navibar(\n const client & ce ) const;\n virtual void produce_MemberDetails(\n HF_SubTitleTable & o_table,\n const client & ce ) const;\n \/\/ DATA\n bool bIsException;\n};\n\n\n\n\/\/ IMPLEMENTATION\n\n\nextern const String\n C_sCePrefix_Struct;\nextern const String\n C_sCePrefix_Exception;\n\n\n#endif\n<|endoftext|>"} {"text":"Properly remove HAS_ASYNC code<|endoftext|>"} {"text":"\/****************************************************************************\n**\n** Copyright (C) 1992-$THISYEAR$ $TROLLTECH$. All rights reserved.\n**\n** This file is part of $PRODUCT$.\n**\n** $CPP_LICENSE$\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\n#include \"metainfogenerator.h\"\n#include \"reporthandler.h\"\n\n#include \n#include \n\nMetaInfoGenerator::MetaInfoGenerator() : Generator()\n{\n setFilenameStub(\"metainfo\");\n}\n\nQString MetaInfoGenerator::subDirectoryForClass(const MetaJavaClass *cls) const\n{\n Q_ASSERT(cls);\n return \"cpp\/\" + cls->package().replace(\".\", \"_\") + \"\/\";\n}\n\nvoid MetaInfoGenerator::generate()\n{\n writeCppFile();\n writeHeaderFile();\n}\n\nbool MetaInfoGenerator::shouldGenerate(const TypeEntry *entry) const\n{\n return entry != 0 && !entry->isNamespace() && !entry->isEnum();\n}\n\nbool MetaInfoGenerator::shouldGenerate(const MetaJavaClass *cls) const\n{\n return (!cls->isInterface() && cls->typeEntry()->isValue() && !cls->isNamespace()\n && !cls->isAbstract() && (cls->typeEntry()->codeGeneration() & TypeEntry::GenerateCpp));\n}\n\nQString MetaInfoGenerator::fileNameForClass(const MetaJavaClass *) const\n{\n return filenameStub() + \".cpp\";\n}\n\nvoid MetaInfoGenerator::write(QTextStream &, const MetaJavaClass *)\n{\n \/\/ not used\n}\n\nvoid MetaInfoGenerator::writeCppFile()\n{\n TypeEntryHash entries = TypeDatabase::instance()->entries();\n TypeEntryHash::iterator it;\n\n MetaJavaClassList classList = classes();\n QHash fileHash;\n\n foreach (MetaJavaClass *cls, classList) {\n QTextStream s;\n QFile *f = fileHash.value(cls->package(), 0);\n if (f == 0) {\n QDir dir(outputDirectory() + \"\/\" + subDirectoryForClass(cls));\n dir.mkpath(dir.absolutePath());\n\n f = new QFile(dir.absoluteFilePath(cppFilename()));\n if (!f->open(QIODevice::WriteOnly)) {\n ReportHandler::warning(QString(\"failed to open file '%1' for writing\")\n .arg(f->fileName()));\n return;\n }\n\n s.setDevice(f);\n writeIncludeStatements(s, classList, cls->package());\n s << endl;\n\n fileHash.insert(cls->package(), f);\n } else {\n s.setDevice(f);\n }\n\n writeCustomStructors(s, cls->typeEntry());\n }\n\n \/\/ Primitive types must be added to all packages\n foreach (QFile *f, fileHash.values()) {\n QTextStream s(f);\n for (it=entries.begin(); it!=entries.end(); ++it) {\n TypeEntry *entry = it.value();\n if (shouldGenerate(entry) && entry->isPrimitive())\n writeCustomStructors(s, entry);\n }\n\n \/\/ Initialization function: Registers meta types\n writeInitializationFunctionName(s);\n s << endl << \"{\" << endl;\n for (it=entries.begin(); it!=entries.end(); ++it) {\n TypeEntry *entry = it.value();\n if (entry &&\n ( (shouldGenerate(entry) && entry->isPrimitive())\n || entry->isString()\n || entry->isChar())) {\n writeInitialization(s, entry);\n }\n }\n }\n\n foreach (MetaJavaClass *cls, classList) {\n QFile *f = fileHash.value(cls->package(), 0);\n\n if (f != 0) {\n QTextStream s(f);\n writeInitialization(s, cls->typeEntry(), shouldGenerate(cls));\n }\n }\n\n foreach (QFile *f, fileHash.values()) {\n QTextStream s(f);\n s << \"}\" << endl << endl;\n f->close();\n delete f;\n }\n}\n\nvoid MetaInfoGenerator::writeHeaderFile()\n{\n MetaJavaClassList classList = classes();\n QHash fileHash;\n\n foreach (MetaJavaClass *cls, classList) {\n bool hasGenerated = fileHash.value(cls->package(), false);\n if (!hasGenerated) {\n QDir dir(outputDirectory() + \"\/\" + subDirectoryForClass(cls));\n dir.mkpath(dir.absolutePath());\n\n QFile file(dir.absoluteFilePath(headerFilename()));\n if (!file.open(QIODevice::WriteOnly)) {\n ReportHandler::warning(QString(\"failed to open file '%1' for writing\")\n .arg(file.fileName()));\n return;\n }\n\n QTextStream s(&file);\n s << \"#ifndef \" << filenameStub().toUpper() << \"_H\" << endl;\n s << \"#define \" << filenameStub().toUpper() << \"_H\" << endl << endl;\n writeInitializationFunctionName(s);\n s << \";\" << endl << \"#endif\" << endl << endl;\n\n fileHash.insert(cls->package(), true);\n }\n }\n}\n\nvoid MetaInfoGenerator::writeCodeBlock(QTextStream &s, const QString &code)\n{\n QStringList lines = code.split('\\n');\n QString indent;\n foreach (QString str, lines) {\n s << \" \" << indent << str.trimmed() << endl;\n if (!str.trimmed().endsWith(\";\") && !str.trimmed().isEmpty())\n indent = \" \";\n else\n indent = \"\";\n }\n}\n\nvoid MetaInfoGenerator::writeCustomStructors(QTextStream &s, const TypeEntry *entry)\n{\n CustomFunction customConstructor = entry->customConstructor();\n CustomFunction customDestructor = entry->customDestructor();\n\n if (!customConstructor.name.isEmpty() && !customDestructor.name.isEmpty()) {\n s << \"\/\/ Custom constructor and destructor for \" << entry->qualifiedCppName() << endl\n << \"static void *\" << customConstructor.name << \"(\"\n << \"const \" << entry->qualifiedCppName() << \" *\" << customConstructor.param_name\n << \")\" << endl\n << \"{\" << endl;\n writeCodeBlock(s, customConstructor.code);\n s << \"}\" << endl << endl;\n\n s << \"static void \" << customDestructor.name << \"(\"\n << \"const \" << entry->qualifiedCppName() << \" *\" << customDestructor.param_name\n << \")\" << endl\n << \"{\" << endl;\n writeCodeBlock(s, customDestructor.code);\n s << \"}\" << endl << endl;\n }\n}\n\nvoid MetaInfoGenerator::writeInclude(QTextStream &s, const Include &inc)\n{\n if (inc.name.isEmpty())\n return;\n\n s << \"#include \";\n if (inc.type == Include::LocalPath)\n s << \"\\\"\" << inc.name << \"\\\"\";\n else\n s << \"<\" << inc.name << \">\";\n s << endl;\n}\n\nvoid MetaInfoGenerator::writeIncludeStatements(QTextStream &s, const MetaJavaClassList &classList,\n const QString &package)\n{\n writeInclude(s, Include(Include::LocalPath, headerFilename()));\n writeInclude(s, Include(Include::IncludePath, \"QMetaType\"));\n writeInclude(s, Include(Include::IncludePath, \"QString\"));\n writeInclude(s, Include(Include::IncludePath, \"QLatin1String\"));\n writeInclude(s, Include(Include::IncludePath, \"QHash\"));\n writeInclude(s, Include(Include::IncludePath, \"QReadWriteLock\"));\n writeInclude(s, Include(Include::IncludePath, \"QReadLocker\"));\n writeInclude(s, Include(Include::IncludePath, \"QWriteLocker\"));\n writeInclude(s, Include(Include::IncludePath, \"qtjambi_cache.h\"));\n s << endl;\n\n foreach (MetaJavaClass *cls, classList) {\n if (shouldGenerate(cls) && cls->package() == package) {\n const ComplexTypeEntry *ctype = cls->typeEntry();\n\n Include inc = ctype->include();\n if (inc.name.isEmpty())\n writeInclude(s, Include(Include::IncludePath, ctype->name()));\n else\n writeInclude(s, inc);\n }\n }\n}\n\nvoid MetaInfoGenerator::writeInitializationFunctionName(QTextStream &s)\n{\n s << \"void __metainfo_init()\";\n}\n\nvoid MetaInfoGenerator::writeInitialization(QTextStream &s, const TypeEntry *entry,\n bool registerMetaType)\n{\n QString constructorName = entry->customConstructor().name;\n QString destructorName = entry->customDestructor().name;\n\n if (constructorName.isEmpty() != destructorName.isEmpty()) {\n ReportHandler::warning(QString(\"specify either no custom functions, or both \"\n \"constructor and destructor for type '%1'\").arg(entry->name()));\n }\n\n if (!entry->preferredConversion())\n return ;\n\n QString javaName = entry->qualifiedJavaName().replace(\".\", \"\/\");\n QString qtName = entry->name();\n\n s << \" registerQtToJava(\\\"\" << qtName << \"\\\", \\\"\" << javaName << \"\\\");\" << endl\n << \" registerJavaToQt(\\\"\" << javaName << \"\\\", \\\"\" << qtName << \"\\\");\" << endl;\n\n if (!registerMetaType)\n return ;\n\n int metaType = QMetaType::type(entry->name().toLocal8Bit().constData());\n if (metaType != QMetaType::Void)\n return ;\n\n if (!constructorName.isEmpty() && !destructorName.isEmpty()) {\n s << \" QMetaType::registerType(\\\"\" << entry->name() << \"\\\",\" << endl\n << \" reinterpret_cast(\"\n << destructorName\n << \"),\" << endl\n << \" reinterpret_cast(\"\n << constructorName\n << \"));\" << endl;\n } else {\n s << \" qRegisterMetaType<\" << entry->qualifiedCppName() << \">(\\\"\" << entry->name() << \"\\\");\" << endl;\n }\n\n}\n(split) Integrate 232827\/****************************************************************************\n**\n** Copyright (C) 1992-$THISYEAR$ $TROLLTECH$. All rights reserved.\n**\n** This file is part of $PRODUCT$.\n**\n** $CPP_LICENSE$\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\n#include \"metainfogenerator.h\"\n#include \"reporthandler.h\"\n\n#include \n#include \n\nMetaInfoGenerator::MetaInfoGenerator() : Generator()\n{\n setFilenameStub(\"metainfo\");\n}\n\nQString MetaInfoGenerator::subDirectoryForClass(const MetaJavaClass *cls) const\n{\n Q_ASSERT(cls);\n return \"cpp\/\" + cls->package().replace(\".\", \"_\") + \"\/\";\n}\n\nvoid MetaInfoGenerator::generate()\n{\n writeCppFile();\n writeHeaderFile();\n}\n\nbool MetaInfoGenerator::shouldGenerate(const TypeEntry *entry) const\n{\n return entry != 0 && !entry->isNamespace() && !entry->isEnum();\n}\n\nbool MetaInfoGenerator::shouldGenerate(const MetaJavaClass *cls) const\n{\n return (!cls->isInterface() && cls->typeEntry()->isValue() && !cls->isNamespace()\n && !cls->isAbstract() && (cls->typeEntry()->codeGeneration() & TypeEntry::GenerateCpp));\n}\n\nQString MetaInfoGenerator::fileNameForClass(const MetaJavaClass *) const\n{\n return filenameStub() + \".cpp\";\n}\n\nvoid MetaInfoGenerator::write(QTextStream &, const MetaJavaClass *)\n{\n \/\/ not used\n}\n\nvoid MetaInfoGenerator::writeCppFile()\n{\n TypeEntryHash entries = TypeDatabase::instance()->entries();\n TypeEntryHash::iterator it;\n\n MetaJavaClassList classList = classes();\n QHash fileHash;\n\n QHash skip_list;\n foreach (MetaJavaClass *cls, classList) {\n if (shouldGenerate(cls))\n skip_list[cls->package()] = false; \n }\n\n foreach (MetaJavaClass *cls, classList) {\n QTextStream s;\n QFile *f = fileHash.value(cls->package(), 0); \n if (f == 0 && !skip_list.value(cls->package(), true)) {\n QDir dir(outputDirectory() + \"\/\" + subDirectoryForClass(cls));\n dir.mkpath(dir.absolutePath());\n\n f = new QFile(dir.absoluteFilePath(cppFilename()));\n if (!f->open(QIODevice::WriteOnly)) {\n ReportHandler::warning(QString(\"failed to open file '%1' for writing\")\n .arg(f->fileName()));\n return;\n }\n\n s.setDevice(f);\n writeIncludeStatements(s, classList, cls->package());\n s << endl;\n\n fileHash.insert(cls->package(), f);\n } else {\n s.setDevice(f);\n }\n\n writeCustomStructors(s, cls->typeEntry());\n }\n\n \/\/ Primitive types must be added to all packages\n foreach (QFile *f, fileHash.values()) {\n QTextStream s(f);\n for (it=entries.begin(); it!=entries.end(); ++it) {\n TypeEntry *entry = it.value();\n if (shouldGenerate(entry) && entry->isPrimitive())\n writeCustomStructors(s, entry);\n }\n\n \/\/ Initialization function: Registers meta types\n writeInitializationFunctionName(s);\n s << endl << \"{\" << endl;\n for (it=entries.begin(); it!=entries.end(); ++it) {\n TypeEntry *entry = it.value();\n if (entry &&\n ( (shouldGenerate(entry) && entry->isPrimitive())\n || entry->isString()\n || entry->isChar())) {\n writeInitialization(s, entry);\n }\n }\n }\n\n foreach (MetaJavaClass *cls, classList) {\n QFile *f = fileHash.value(cls->package(), 0);\n\n if (f != 0) {\n QTextStream s(f);\n writeInitialization(s, cls->typeEntry(), shouldGenerate(cls));\n }\n }\n\n foreach (QFile *f, fileHash.values()) {\n QTextStream s(f);\n s << \"}\" << endl << endl;\n f->close();\n delete f;\n }\n}\n\nvoid MetaInfoGenerator::writeHeaderFile()\n{\n MetaJavaClassList classList = classes();\n QHash fileHash;\n\n QHash skip_list;\n foreach (MetaJavaClass *cls, classList) {\n if (shouldGenerate(cls))\n skip_list[cls->package()] = false; \n }\n\n foreach (MetaJavaClass *cls, classList) {\n bool hasGenerated = fileHash.value(cls->package(), false);\n if (!hasGenerated && !skip_list.value(cls->package(), true)) {\n QDir dir(outputDirectory() + \"\/\" + subDirectoryForClass(cls));\n dir.mkpath(dir.absolutePath());\n\n QFile file(dir.absoluteFilePath(headerFilename()));\n if (!file.open(QIODevice::WriteOnly)) {\n ReportHandler::warning(QString(\"failed to open file '%1' for writing\")\n .arg(file.fileName()));\n return;\n }\n\n QTextStream s(&file);\n s << \"#ifndef \" << filenameStub().toUpper() << \"_H\" << endl;\n s << \"#define \" << filenameStub().toUpper() << \"_H\" << endl << endl;\n writeInitializationFunctionName(s);\n s << \";\" << endl << \"#endif\" << endl << endl;\n\n fileHash.insert(cls->package(), true);\n }\n }\n}\n\nvoid MetaInfoGenerator::writeCodeBlock(QTextStream &s, const QString &code)\n{\n QStringList lines = code.split('\\n');\n QString indent;\n foreach (QString str, lines) {\n s << \" \" << indent << str.trimmed() << endl;\n if (!str.trimmed().endsWith(\";\") && !str.trimmed().isEmpty())\n indent = \" \";\n else\n indent = \"\";\n }\n}\n\nvoid MetaInfoGenerator::writeCustomStructors(QTextStream &s, const TypeEntry *entry)\n{\n CustomFunction customConstructor = entry->customConstructor();\n CustomFunction customDestructor = entry->customDestructor();\n\n if (!customConstructor.name.isEmpty() && !customDestructor.name.isEmpty()) {\n s << \"\/\/ Custom constructor and destructor for \" << entry->qualifiedCppName() << endl\n << \"static void *\" << customConstructor.name << \"(\"\n << \"const \" << entry->qualifiedCppName() << \" *\" << customConstructor.param_name\n << \")\" << endl\n << \"{\" << endl;\n writeCodeBlock(s, customConstructor.code);\n s << \"}\" << endl << endl;\n\n s << \"static void \" << customDestructor.name << \"(\"\n << \"const \" << entry->qualifiedCppName() << \" *\" << customDestructor.param_name\n << \")\" << endl\n << \"{\" << endl;\n writeCodeBlock(s, customDestructor.code);\n s << \"}\" << endl << endl;\n }\n}\n\nvoid MetaInfoGenerator::writeInclude(QTextStream &s, const Include &inc)\n{\n if (inc.name.isEmpty())\n return;\n\n s << \"#include \";\n if (inc.type == Include::LocalPath)\n s << \"\\\"\" << inc.name << \"\\\"\";\n else\n s << \"<\" << inc.name << \">\";\n s << endl;\n}\n\nvoid MetaInfoGenerator::writeIncludeStatements(QTextStream &s, const MetaJavaClassList &classList,\n const QString &package)\n{\n writeInclude(s, Include(Include::LocalPath, headerFilename()));\n writeInclude(s, Include(Include::IncludePath, \"QMetaType\"));\n writeInclude(s, Include(Include::IncludePath, \"QString\"));\n writeInclude(s, Include(Include::IncludePath, \"QLatin1String\"));\n writeInclude(s, Include(Include::IncludePath, \"QHash\"));\n writeInclude(s, Include(Include::IncludePath, \"QReadWriteLock\"));\n writeInclude(s, Include(Include::IncludePath, \"QReadLocker\"));\n writeInclude(s, Include(Include::IncludePath, \"QWriteLocker\"));\n writeInclude(s, Include(Include::IncludePath, \"qtjambi_cache.h\"));\n s << endl;\n\n foreach (MetaJavaClass *cls, classList) {\n if (shouldGenerate(cls) && cls->package() == package) {\n const ComplexTypeEntry *ctype = cls->typeEntry();\n\n Include inc = ctype->include();\n if (inc.name.isEmpty())\n writeInclude(s, Include(Include::IncludePath, ctype->name()));\n else\n writeInclude(s, inc);\n }\n }\n}\n\nvoid MetaInfoGenerator::writeInitializationFunctionName(QTextStream &s)\n{\n s << \"void __metainfo_init()\";\n}\n\nvoid MetaInfoGenerator::writeInitialization(QTextStream &s, const TypeEntry *entry,\n bool registerMetaType)\n{\n QString constructorName = entry->customConstructor().name;\n QString destructorName = entry->customDestructor().name;\n\n if (constructorName.isEmpty() != destructorName.isEmpty()) {\n ReportHandler::warning(QString(\"specify either no custom functions, or both \"\n \"constructor and destructor for type '%1'\").arg(entry->name()));\n }\n\n if (!entry->preferredConversion())\n return ;\n\n QString javaName = entry->qualifiedJavaName().replace(\".\", \"\/\");\n QString qtName = entry->name();\n\n s << \" registerQtToJava(\\\"\" << qtName << \"\\\", \\\"\" << javaName << \"\\\");\" << endl\n << \" registerJavaToQt(\\\"\" << javaName << \"\\\", \\\"\" << qtName << \"\\\");\" << endl;\n\n if (!registerMetaType)\n return ;\n\n int metaType = QMetaType::type(entry->name().toLocal8Bit().constData());\n if (metaType != QMetaType::Void)\n return ;\n\n if (!constructorName.isEmpty() && !destructorName.isEmpty()) {\n s << \" QMetaType::registerType(\\\"\" << entry->name() << \"\\\",\" << endl\n << \" reinterpret_cast(\"\n << destructorName\n << \"),\" << endl\n << \" reinterpret_cast(\"\n << constructorName\n << \"));\" << endl;\n } else {\n s << \" qRegisterMetaType<\" << entry->qualifiedCppName() << \">(\\\"\" << entry->name() << \"\\\");\" << endl;\n }\n\n}\n<|endoftext|>"} {"text":"#pragma once\n\n#include \n#include \n#include \n\n#include \n#include \"..\/linking.hpp\"\n\n#include \n#include \n#undef CreateDirectory\n\n\/\/\/ Handles profiling.\nclass ProfilingManager {\n friend class Hub;\n friend class Profiling;\n friend class GPUProfiling;\n \n public:\n \/\/\/ The type of profiling to perform.\n enum Type {\n CPU_TIME = 0,\n GPU_TIME_ELAPSED,\n GPU_SAMPLES_PASSED,\n COUNT\n };\n\n \/\/\/ A profiling result.\n struct Result {\n std::string name;\n double value = 0.0;\n std::list children;\n Result* parent;\n\n ENGINE_API Result(const std::string& name, Result* parent);\n };\n\n \/\/\/ Begin profiling a frame.\n ENGINE_API void BeginFrame();\n\n \/\/\/ End profiling a frame and collect the results.\n ENGINE_API void EndFrame();\n\n \/\/\/ Check whether %ProfilingManager is active.\n \/**\n * @return Active state.\n *\/\n ENGINE_API bool Active() const;\n\n \/\/\/ Set whether %ProfilingManager is active.\n \/**\n * @param active Active state.\n *\/\n ENGINE_API void SetActive(bool active);\n\n \/\/\/ Get number of frames being monitored.\n \/**\n * @return The number of frames being stored.\n *\/\n ENGINE_API unsigned int GetFrameCount() const;\n\n \/\/\/ Get the measured CPU frame times.\n \/**\n * @return The CPU frame times.\n *\/\n ENGINE_API const float* GetCPUFrameTimes() const;\n\n \/\/\/ Get the measured GPU frame times.\n \/**\n * @return The GPU frame times.\n *\/\n ENGINE_API const float* GetGPUFrameTimes() const;\n\n \/\/\/ Get profiling result.\n \/**\n * @param type The type of profiling to get results for.\n * @return The measured result.\n *\/\n ENGINE_API Result* GetResult(Type type) const;\n\n \/\/\/ Get the name of a type of profiling.\n \/**\n * @param type The type of profiling.\n * @return The name.\n *\/\n ENGINE_API static std::string TypeToString(Type type);\n\n ENGINE_API unsigned int MeasureRAM();\n\n ENGINE_API unsigned int MeasureVRAM();\n \n private:\n ProfilingManager();\n ~ProfilingManager();\n ProfilingManager(ProfilingManager const&) = delete;\n void operator=(ProfilingManager const&) = delete;\n \n Result* StartResult(const std::string& name, Type type);\n void FinishResult(Result* result, Type type);\n \n void ShowResult(Result* result);\n\n bool active;\n \n Result* root[Type::COUNT];\n Result* current[Type::COUNT];\n\n std::map> queryPool;\n std::map queryMap;\n \n Video::Query* frameQuery;\n double frameStart;\n static const unsigned int frames = 100;\n unsigned int frame = 0;\n float frameTimes[2][frames];\n\n#ifdef MEASURE_VRAM\n IDXGIFactory* dxgiFactory = nullptr;\n IDXGIAdapter3* dxgiAdapter3 = nullptr;\n#endif\n};\nAdded missing ifdef.#pragma once\n\n#include \n#include \n#include \n\n#include \n#include \"..\/linking.hpp\"\n#ifdef MEASURE_VRAM\n#include \n#include \n#undef CreateDirectory\n#endif\n\n\/\/\/ Handles profiling.\nclass ProfilingManager {\n friend class Hub;\n friend class Profiling;\n friend class GPUProfiling;\n \n public:\n \/\/\/ The type of profiling to perform.\n enum Type {\n CPU_TIME = 0,\n GPU_TIME_ELAPSED,\n GPU_SAMPLES_PASSED,\n COUNT\n };\n\n \/\/\/ A profiling result.\n struct Result {\n std::string name;\n double value = 0.0;\n std::list children;\n Result* parent;\n\n ENGINE_API Result(const std::string& name, Result* parent);\n };\n\n \/\/\/ Begin profiling a frame.\n ENGINE_API void BeginFrame();\n\n \/\/\/ End profiling a frame and collect the results.\n ENGINE_API void EndFrame();\n\n \/\/\/ Check whether %ProfilingManager is active.\n \/**\n * @return Active state.\n *\/\n ENGINE_API bool Active() const;\n\n \/\/\/ Set whether %ProfilingManager is active.\n \/**\n * @param active Active state.\n *\/\n ENGINE_API void SetActive(bool active);\n\n \/\/\/ Get number of frames being monitored.\n \/**\n * @return The number of frames being stored.\n *\/\n ENGINE_API unsigned int GetFrameCount() const;\n\n \/\/\/ Get the measured CPU frame times.\n \/**\n * @return The CPU frame times.\n *\/\n ENGINE_API const float* GetCPUFrameTimes() const;\n\n \/\/\/ Get the measured GPU frame times.\n \/**\n * @return The GPU frame times.\n *\/\n ENGINE_API const float* GetGPUFrameTimes() const;\n\n \/\/\/ Get profiling result.\n \/**\n * @param type The type of profiling to get results for.\n * @return The measured result.\n *\/\n ENGINE_API Result* GetResult(Type type) const;\n\n \/\/\/ Get the name of a type of profiling.\n \/**\n * @param type The type of profiling.\n * @return The name.\n *\/\n ENGINE_API static std::string TypeToString(Type type);\n\n ENGINE_API unsigned int MeasureRAM();\n\n ENGINE_API unsigned int MeasureVRAM();\n \n private:\n ProfilingManager();\n ~ProfilingManager();\n ProfilingManager(ProfilingManager const&) = delete;\n void operator=(ProfilingManager const&) = delete;\n \n Result* StartResult(const std::string& name, Type type);\n void FinishResult(Result* result, Type type);\n \n void ShowResult(Result* result);\n\n bool active;\n \n Result* root[Type::COUNT];\n Result* current[Type::COUNT];\n\n std::map> queryPool;\n std::map queryMap;\n \n Video::Query* frameQuery;\n double frameStart;\n static const unsigned int frames = 100;\n unsigned int frame = 0;\n float frameTimes[2][frames];\n\n#ifdef MEASURE_VRAM\n IDXGIFactory* dxgiFactory = nullptr;\n IDXGIAdapter3* dxgiAdapter3 = nullptr;\n#endif\n};\n<|endoftext|>"} {"text":"Matrix2f M = Matrix2f::Random();\nMatrix2f m;\nm = M;\ncout << \"Here is the matrix m:\" << endl << m << endl;\ncout << \"Now we want to replace m by its own transpose.\" << endl;\ncout << \"If we do m = m.transpose(), then m becomes:\" << endl;\nm = m.transpose() * 1;\ncout << m << endl << \"which is wrong!\" << endl;\ncout << \"Now let us instead do m = m.transpose().eval(). Then m becomes\" << endl;\nm = M;\nm = m.transpose().eval();\ncout << m << endl << \"which is right.\" << endl;\nMake snippet run successfully again: the snippet for 'eval' was taking m=m.transpose() as an example of code that needs an explicit call to eval(), but that doesn't work anymore now that we have the clever assert detecting aliasing issues.Matrix2f M = Matrix2f::Random();\nMatrix2f m;\nm = M;\ncout << \"Here is the matrix m:\" << endl << m << endl;\ncout << \"Now we want to copy a column into a row.\" << endl;\ncout << \"If we do m.col(1) = m.row(0), then m becomes:\" << endl;\nm.col(1) = m.row(0);\ncout << m << endl << \"which is wrong!\" << endl;\ncout << \"Now let us instead do m.col(1) = m.row(0).eval(). Then m becomes\" << endl;\nm = M;\nm.col(1) = m.row(0).eval();\ncout << m << endl << \"which is right.\" << endl;\n<|endoftext|>"} {"text":"\/*\n * Copyright (C) 2011 by Julian Wiesener\n * \n * This library is free software; you can redistribute it and\/or\n * modify it under the terms of the GNU Lesser General Public\n * License 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 \n#include \n#include \n#include \n#include \n#include \n\n#include \n#include \n#include \n#include \n\n#include \n\nnamespace vagra\n{\n\nlog_define(\"vagra\")\n\n\/\/begin User\n\nUser::User(const unsigned int _id, const unsigned int _aid)\n\t: BaseObject(\"vuser\", _id, _aid) \/\/call baseconstructor(db_tablename,id,authId)\n{\n\tInit(_aid);\n}\n\nUser::User(const std::string& _name, const unsigned int _aid)\n\t: BaseObject(\"vuser\", getIdByName(_name), _aid)\n{\n\tInit(_aid);\n}\n\nvoid User::Init(const unsigned int _aid)\n{\n\ttry\n\t{\n\t\tNexus& nx = Nexus::getInstance();\n\t\tdbconn conn = nx.dbConnection();\n\t\ttntdb::Statement q_user = conn.prepare(\n\t\t\t\"SELECT logname, dispname, pw_id FROM vuser WHERE id = :Qid\");\n\t\tq_user.setUnsigned(\"Qid\", id);\n\t\ttntdb::Row row_user = q_user.selectRow();\n\t\tif(!row_user[0].isNull())\n\t\t\tlogname = row_user[0].getString();\n\t\tif(!row_user[1].isNull())\n\t\t\tdispname = row_user[1].getString();\n\t\tif(!row_user[2].isNull() && row_user[2].getUnsigned())\n\t\t\tpassword = Passwd(row_user[2].getUnsigned(), _aid);\n\t}\n\tcatch(const Exception&)\n\t{\n\t\tlog_error(gettext(\"cannot read passwd\"));\n\t\tthrow;\n\t}\n\tcatch(const std::exception& er_user)\n\t{\n\t\tlog_error(er_user.what());\n\t\tthrow std::domain_error(gettext(\"failed to read user data\"));\n\t}\n}\n\nUser::operator bool() const\n{\n\treturn(id && !logname.empty());\n}\n\nUser::operator int() const\n{\n\treturn(id);\n}\n\nUser::operator unsigned int() const\n{\n\treturn(id);\n}\n\nvoid User::clear()\n{\n\tclearBase();\n\n\tlogname.clear();\n\tdispname.clear();\n\tpassword.clear();\n}\n\nconst std::string& User::getLogname() const\n{\n\treturn logname;\n}\n\nconst std::string& User::getDispname() const\n{\n\treturn dispname;\n}\n\nconst Passwd& User::getPasswd() const\n{\n\treturn password;\n}\n\nvoid User::setLogname(const std::string& s)\n{\n\tlogname = s;\n}\n\nvoid User::setDispname(const std::string& s)\n{\n\tdispname = s;\n}\n\nvoid User::setPasswd(const Passwd& _pw)\n{\n\tif(password)\n\t\tthrow InvalidValue(gettext(\"user already has a password\"));\n\tif(!_pw)\n\t\tthrow InvalidValue(gettext(\"invalid password submitted\"));\n\tif(_pw.getOwner() != id)\n\t\tthrow InvalidValue(gettext(\"password must be owned by the user\"));\n\tpassword = _pw;\n}\n\nvoid User::setPasswd(const std::string& _pw)\n{\n\tif(_pw.empty())\n\t\tthrow InvalidValue(gettext(\"empty password submitted\"));\n\tpassword.update(_pw);\n}\n\nstd::string User::setRandomPasswd(const unsigned int _aid)\n{\n\tpassword.setContext(\"passwd\", _aid);\n\tvagra::randomString randstr(12);\n\tpassword.update(randstr);\n\treturn randstr;\n}\n\nvoid User::dbCommit(const unsigned int _aid)\n{\n\tif(logname.empty())\n\t\tthrow InvalidValue(gettext(\"need a login name name\"));\n\tif(logname.length() > 16)\n\t\tthrow InvalidValue(gettext(\"logname to long\"));\n\t\n\tcxxtools::Regex checkLogname(\"^[aA-zZ]*$\");\n\tif(!checkLogname.match(logname))\n\t\tthrow InvalidValue(gettext(\"invalid logname\"));\n\n\tif(!password)\n\t\tthrow InvalidValue(gettext(\"password not set\"));\n\n\tNexus& nx = Nexus::getInstance();\n\tdbconn conn = nx.dbConnection();\n\n\tunsigned int _id = getUidByLogname(logname,conn);\n\tif(_id && _id != id)\n\t\tthrow InvalidValue(gettext(\"logname belongs to differen user\"));\n\n\tif(dispname.empty())\n\t\tdispname = logname;\n\n\t_id = getUidByDispname(dispname,conn);\n\tif(_id && _id != id)\n\t\tthrow InvalidValue(gettext(\"dispname belongs to differen user\"));\n\n\t_id = getUidByLogname(dispname,conn); \/\/ do not allow to set other users logname as dispname\n\tif(_id && _id != id)\n\t\tthrow InvalidValue(gettext(\"dispname belongs to differen user\"));\n\n\ttntdb::Transaction trans_user(conn);\n\ttry\n\t{\n\t\tdbCommitBase(conn, _aid); \/\/init base, INSERT if id==0, otherwise UPDATE\n\t\tif(!password.getOwner())\n\t\t\tpassword.setOwner(id, _aid);\n\t\tpassword.dbCommit(conn, _aid);\n\n\t\tconn.prepare(\"UPDATE vuser SET logname = :Ilogname, dispname = :Idispname,\"\n\t\t\t\" pw_id = :Ipw_id WHERE id = :Iid\")\n\t\t.setString(\"Ilogname\", logname)\n\t\t.setString(\"Idispname\", dispname)\n\t\t.setUnsigned(\"Ipw_id\", password.getId())\n\t\t.setUnsigned(\"Iid\", id)\n\t\t.execute();\n\t}\n\tcatch(const Exception&)\n\t{\n\t\tthrow;\n\t}\n\tcatch(const std::exception& er_db)\n\t{\n\t\tlog_error(er_db.what());\n\t\tthrow std::domain_error(gettext(\"could not write user data\"));\n\t}\n\n\ttry\n\t{\n\t\tCache& user_cache = Cache::getInstance();\n\t\ttrans_user.commit();\n\t\tuser_cache.clear(id);\n\n\t}\n\tcatch(const std::exception& er_trans)\n\t{\n\t\tlog_error(er_trans.what());\n\t\tthrow std::domain_error(gettext(\"commit failed\"));\n\t}\n}\n\nvoid User::passwdCommit(const unsigned int _aid)\n{\n\tCache& user_cache = Cache::getInstance();\n\tpassword.dbCommit(_aid);\n\tuser_cache.clear(id);\n}\n\nunsigned int User::getIdByName(const std::string& _name)\n{\n\tunsigned int _uid = getUidByLogname(_name);\n\tif(!_uid)\n\t\tthrow InvalidObject(gettext(\"unknown user\"));\n\n\treturn _uid;\n}\n\n\/\/ end User\n\nunsigned int getUidByLogname(const std::string& logname)\n{\n try\n {\n Nexus& nx = Nexus::getInstance();\n dbconn conn = nx.dbConnection();\n return getUidByLogname(logname, conn);\n }\n catch(const std::exception& er_comm)\n {\n log_error(er_comm.what());\n }\n return 0;\n}\n\nunsigned int getUidByDispname(const std::string& dispname)\n{\n try\n {\n Nexus& nx = Nexus::getInstance();\n dbconn conn = nx.dbConnection();\n return getUidByDispname(dispname, conn);\n }\n catch(const std::exception& er_comm)\n {\n log_error(er_comm.what());\n }\n return 0;\n}\n\n\/* need this versions , because we may\n * read id during transaction.\n *\/\n\nunsigned int getUidByLogname(const std::string& logname, dbconn& conn)\n{\n try\n {\n tntdb::Statement q_u_id = conn.prepare(\n \"SELECT id FROM vuser WHERE logname = :Qlogname\");\n q_u_id.setString(\"Qlogname\", logname);\n tntdb::Row row_u_id = q_u_id.selectRow();\n if(!row_u_id[0].isNull())\n \treturn row_u_id[0].getUnsigned();\n }\n catch(const std::exception& er_uid)\n {\n log_warn(er_uid.what());\n }\n return 0;\n}\n\nunsigned int getUidByDispname(const std::string& dispname, dbconn& conn)\n{\n try\n {\n tntdb::Statement q_u_id = conn.prepare(\n \"SELECT id FROM vuser WHERE dispname = :Qdispname\");\n q_u_id.setString(\"Qdispname\", dispname);\n tntdb::Row row_u_id = q_u_id.selectRow();\n if(!row_u_id[0].isNull())\n \treturn row_u_id[0].getUnsigned();\n }\n catch(const std::exception& er_uid)\n {\n log_warn(er_uid.what());\n }\n return 0;\n}\n\n} \/\/namespace vagra\nadded password.setOwner() to setRandomPasswd\/*\n * Copyright (C) 2011 by Julian Wiesener\n * \n * This library is free software; you can redistribute it and\/or\n * modify it under the terms of the GNU Lesser General Public\n * License 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 \n#include \n#include \n#include \n#include \n#include \n\n#include \n#include \n#include \n#include \n\n#include \n\nnamespace vagra\n{\n\nlog_define(\"vagra\")\n\n\/\/begin User\n\nUser::User(const unsigned int _id, const unsigned int _aid)\n\t: BaseObject(\"vuser\", _id, _aid) \/\/call baseconstructor(db_tablename,id,authId)\n{\n\tInit(_aid);\n}\n\nUser::User(const std::string& _name, const unsigned int _aid)\n\t: BaseObject(\"vuser\", getIdByName(_name), _aid)\n{\n\tInit(_aid);\n}\n\nvoid User::Init(const unsigned int _aid)\n{\n\ttry\n\t{\n\t\tNexus& nx = Nexus::getInstance();\n\t\tdbconn conn = nx.dbConnection();\n\t\ttntdb::Statement q_user = conn.prepare(\n\t\t\t\"SELECT logname, dispname, pw_id FROM vuser WHERE id = :Qid\");\n\t\tq_user.setUnsigned(\"Qid\", id);\n\t\ttntdb::Row row_user = q_user.selectRow();\n\t\tif(!row_user[0].isNull())\n\t\t\tlogname = row_user[0].getString();\n\t\tif(!row_user[1].isNull())\n\t\t\tdispname = row_user[1].getString();\n\t\tif(!row_user[2].isNull() && row_user[2].getUnsigned())\n\t\t\tpassword = Passwd(row_user[2].getUnsigned(), _aid);\n\t}\n\tcatch(const Exception&)\n\t{\n\t\tlog_error(gettext(\"cannot read passwd\"));\n\t\tthrow;\n\t}\n\tcatch(const std::exception& er_user)\n\t{\n\t\tlog_error(er_user.what());\n\t\tthrow std::domain_error(gettext(\"failed to read user data\"));\n\t}\n}\n\nUser::operator bool() const\n{\n\treturn(id && !logname.empty());\n}\n\nUser::operator int() const\n{\n\treturn(id);\n}\n\nUser::operator unsigned int() const\n{\n\treturn(id);\n}\n\nvoid User::clear()\n{\n\tclearBase();\n\n\tlogname.clear();\n\tdispname.clear();\n\tpassword.clear();\n}\n\nconst std::string& User::getLogname() const\n{\n\treturn logname;\n}\n\nconst std::string& User::getDispname() const\n{\n\treturn dispname;\n}\n\nconst Passwd& User::getPasswd() const\n{\n\treturn password;\n}\n\nvoid User::setLogname(const std::string& s)\n{\n\tlogname = s;\n}\n\nvoid User::setDispname(const std::string& s)\n{\n\tdispname = s;\n}\n\nvoid User::setPasswd(const Passwd& _pw)\n{\n\tif(password)\n\t\tthrow InvalidValue(gettext(\"user already has a password\"));\n\tif(!_pw)\n\t\tthrow InvalidValue(gettext(\"invalid password submitted\"));\n\tif(_pw.getOwner() != id)\n\t\tthrow InvalidValue(gettext(\"password must be owned by the user\"));\n\tpassword = _pw;\n}\n\nvoid User::setPasswd(const std::string& _pw)\n{\n\tif(_pw.empty())\n\t\tthrow InvalidValue(gettext(\"empty password submitted\"));\n\tpassword.update(_pw);\n}\n\nstd::string User::setRandomPasswd(const unsigned int _aid)\n{\n\tpassword.setContext(\"passwd\", _aid);\n\tpassword.setOwner(id, _aid);\n\tvagra::randomString randstr(12);\n\tpassword.update(randstr);\n\treturn randstr;\n}\n\nvoid User::dbCommit(const unsigned int _aid)\n{\n\tif(logname.empty())\n\t\tthrow InvalidValue(gettext(\"need a login name name\"));\n\tif(logname.length() > 16)\n\t\tthrow InvalidValue(gettext(\"logname to long\"));\n\t\n\tcxxtools::Regex checkLogname(\"^[aA-zZ]*$\");\n\tif(!checkLogname.match(logname))\n\t\tthrow InvalidValue(gettext(\"invalid logname\"));\n\n\tif(!password)\n\t\tthrow InvalidValue(gettext(\"password not set\"));\n\n\tNexus& nx = Nexus::getInstance();\n\tdbconn conn = nx.dbConnection();\n\n\tunsigned int _id = getUidByLogname(logname,conn);\n\tif(_id && _id != id)\n\t\tthrow InvalidValue(gettext(\"logname belongs to differen user\"));\n\n\tif(dispname.empty())\n\t\tdispname = logname;\n\n\t_id = getUidByDispname(dispname,conn);\n\tif(_id && _id != id)\n\t\tthrow InvalidValue(gettext(\"dispname belongs to differen user\"));\n\n\t_id = getUidByLogname(dispname,conn); \/\/ do not allow to set other users logname as dispname\n\tif(_id && _id != id)\n\t\tthrow InvalidValue(gettext(\"dispname belongs to differen user\"));\n\n\ttntdb::Transaction trans_user(conn);\n\ttry\n\t{\n\t\tdbCommitBase(conn, _aid); \/\/init base, INSERT if id==0, otherwise UPDATE\n\t\tif(!password.getOwner())\n\t\t\tpassword.setOwner(id, _aid);\n\t\tpassword.dbCommit(conn, _aid);\n\n\t\tconn.prepare(\"UPDATE vuser SET logname = :Ilogname, dispname = :Idispname,\"\n\t\t\t\" pw_id = :Ipw_id WHERE id = :Iid\")\n\t\t.setString(\"Ilogname\", logname)\n\t\t.setString(\"Idispname\", dispname)\n\t\t.setUnsigned(\"Ipw_id\", password.getId())\n\t\t.setUnsigned(\"Iid\", id)\n\t\t.execute();\n\t}\n\tcatch(const Exception&)\n\t{\n\t\tthrow;\n\t}\n\tcatch(const std::exception& er_db)\n\t{\n\t\tlog_error(er_db.what());\n\t\tthrow std::domain_error(gettext(\"could not write user data\"));\n\t}\n\n\ttry\n\t{\n\t\tCache& user_cache = Cache::getInstance();\n\t\ttrans_user.commit();\n\t\tuser_cache.clear(id);\n\n\t}\n\tcatch(const std::exception& er_trans)\n\t{\n\t\tlog_error(er_trans.what());\n\t\tthrow std::domain_error(gettext(\"commit failed\"));\n\t}\n}\n\nvoid User::passwdCommit(const unsigned int _aid)\n{\n\tCache& user_cache = Cache::getInstance();\n\tpassword.dbCommit(_aid);\n\tuser_cache.clear(id);\n}\n\nunsigned int User::getIdByName(const std::string& _name)\n{\n\tunsigned int _uid = getUidByLogname(_name);\n\tif(!_uid)\n\t\tthrow InvalidObject(gettext(\"unknown user\"));\n\n\treturn _uid;\n}\n\n\/\/ end User\n\nunsigned int getUidByLogname(const std::string& logname)\n{\n try\n {\n Nexus& nx = Nexus::getInstance();\n dbconn conn = nx.dbConnection();\n return getUidByLogname(logname, conn);\n }\n catch(const std::exception& er_comm)\n {\n log_error(er_comm.what());\n }\n return 0;\n}\n\nunsigned int getUidByDispname(const std::string& dispname)\n{\n try\n {\n Nexus& nx = Nexus::getInstance();\n dbconn conn = nx.dbConnection();\n return getUidByDispname(dispname, conn);\n }\n catch(const std::exception& er_comm)\n {\n log_error(er_comm.what());\n }\n return 0;\n}\n\n\/* need this versions , because we may\n * read id during transaction.\n *\/\n\nunsigned int getUidByLogname(const std::string& logname, dbconn& conn)\n{\n try\n {\n tntdb::Statement q_u_id = conn.prepare(\n \"SELECT id FROM vuser WHERE logname = :Qlogname\");\n q_u_id.setString(\"Qlogname\", logname);\n tntdb::Row row_u_id = q_u_id.selectRow();\n if(!row_u_id[0].isNull())\n \treturn row_u_id[0].getUnsigned();\n }\n catch(const std::exception& er_uid)\n {\n log_warn(er_uid.what());\n }\n return 0;\n}\n\nunsigned int getUidByDispname(const std::string& dispname, dbconn& conn)\n{\n try\n {\n tntdb::Statement q_u_id = conn.prepare(\n \"SELECT id FROM vuser WHERE dispname = :Qdispname\");\n q_u_id.setString(\"Qdispname\", dispname);\n tntdb::Row row_u_id = q_u_id.selectRow();\n if(!row_u_id[0].isNull())\n \treturn row_u_id[0].getUnsigned();\n }\n catch(const std::exception& er_uid)\n {\n log_warn(er_uid.what());\n }\n return 0;\n}\n\n} \/\/namespace vagra\n<|endoftext|>"} {"text":"#include \"mbed.h\"\n#include \"WS2811.h\"\n\n#define X_MAX 64\n#define Y_MAX 64\n\n#define nRows 8 \/\/The number of rows in a basic block\n#define nCols 8 \/\/ The number of columns in a basic block\n\n\/\/ per LED: 3 * 20 mA = 60mA max\n\/\/ 60 LEDs: 60 * 60mA = 3600 mA max\n\/\/ 120 LEDs: 7200 mA max\nunsigned const nLEDs = MAX_LEDS_PER_STRIP; \/\/ 64\n\nunsigned const horizontal_blocks = 2; \/\/The number of basic blocks connected horizontally\nunsigned const vertical_blocks = 4; \/\/The number of basic blocks connected vertically\n\n\/\/Each mask corresponds to the nth significant bit in a binary word\nuint8_t mask_1 = 1;\nuint8_t mask_2 = 2;\nuint8_t mask_3 = 4;\nuint8_t mask_4 = 8;\nuint8_t mask_5 = 16;\nuint8_t mask_6 = 32;\n\n\/\/ Pins *NUMBERS* for PORTC (convenient for KL25Z freedom board)\n\nunsigned const DATA_OUT_PIN1 = 7; \/\/ DATA OUT for the highest vertical block\nunsigned const DATA_OUT_PIN2 = 0;\/\/ The lower the PIN number, the higher it is IRL\nunsigned const DATA_OUT_PIN3 = 3;\nunsigned const DATA_OUT_PIN4 = 4;\n\n\/\/ Address Pin locations (There is some issue with the pins where only these specific pins can be used for addressing.)\nDigitalOut ADDRESS_PIN_3(D2); \/\/ AKA PTD4\nDigitalOut ADDRESS_PIN_2(D3); \/\/ AKA PTA12\nDigitalOut ADDRESS_PIN_1(D5); \/\/ AKA PTA5\n\n\n\nSerial pc(USBTX, USBRX); \/\/ D1 (PTA2) and D0 (PTA1) on KL25Z\n\nstatic void clearStrip(WS2811 &strip)\n{\n unsigned nLEDs = strip.numPixels();\n for (unsigned i = 0; i < nLEDs; i++) {\n strip.setPixelColor(i, 0, 0, 0);\n }\n strip.show();\n}\n\nstatic void illuminateStrip(WS2811 &strip, uint8_t led_matrix[])\n{\n unsigned nLEDs = strip.numPixels();\n for (unsigned i = 0; i < nLEDs; i++) {\n strip.setPixelColor(i, led_matrix[3*i], led_matrix[(3*i)+1], led_matrix[(3*i)+2]);\n }\n strip.show();\n}\n\n\n\nint main(void)\n{\n pc.baud(115200); \/\/ 11520 Bytes\/s -> ~0.3s for 32x32 RGB pixels\n \n \n \/\/ Initialize one LED Strip, run from one pin. This is a placeholder for the entire block.\n\n WS2811 lightStrip1(nLEDs,DATA_OUT_PIN1); \/\/Highest Vertical Block (1.0)\n WS2811 lightStrip2(nLEDs,DATA_OUT_PIN2);\n WS2811 lightStrip3(nLEDs,DATA_OUT_PIN3); \n WS2811 lightStrip4(nLEDs,DATA_OUT_PIN4); \/\/ Lowest Vertical Block (4.0)\n \n \n \/* -------------------------------------\n | | |\n | BLOCK | BLOCK |\n | 1.0 | 1.1 |\n | | |\n |_______________|___________________|\n | | |\n | | |\n | BLOCK | BLOCK |\n | 2.0 | 2.1 |\n | | |\n ----------------|--------------------\n *\/\n \n lightStrip1.begin();\n lightStrip2.begin();\n lightStrip3.begin();\n lightStrip4.begin();\n \n uint8_t q = 0; \/\/ index variable\n uint8_t char_buff[10]; \/\/ UART buffer\n uint8_t curr_char = 0; \/\/ current byte read from UART\n \n \n uint8_t led_matrix[nRows*vertical_blocks][3*nCols*horizontal_blocks] = {0}; \/\/ Define a matrix to store RGB info about each LED in the array\n \n uint8_t ledmatrix_row1[3*nCols*horizontal_blocks] = {0}; \/\/ Temporary variables to take in each row in an array for input to a function\n uint8_t ledmatrix_row2[3*nCols*horizontal_blocks] = {0};\t\t\/\/ Each array represents a separate data pin. All data pins are driven simultaeneously\t\n uint8_t ledmatrix_row3[3*nCols*horizontal_blocks] = {0};\t\t\/\/ to keep the matrix correct.\n uint8_t ledmatrix_row4[3*nCols*horizontal_blocks] = {0};\n \n \n \n for (;;) {\n \n \/* I have defined a custom UART packet protocol\n * A general packet may look like: \n * char_buff[0] start byte: 254\n * char_buff[1] x-coordinate [0, 63]\n * char_buff[2] y-coordinate [0, 63]\n * char_buff[3] R (6-bit) [0, 63]\n * char_buff[4] G (6-bit) [0, 63]\n * char_buff[5] B (6-bit) [0, 63]\n * char_buff[6] Delimiter: 255\n *\/\n while(curr_char != 255 && q < 7)\n {\n \/* If there is UART traffic *\/\n if(pc.readable())\n {\n curr_char = uint8_t(pc.getc());\n char_buff[q] = curr_char;\n q++;\n }\n }\n \n \n \n \/\/Store the RGB values at the correct place in the array\n led_matrix[char_buff[2]][3*(char_buff[1]%X_MAX)] = char_buff[3];\n led_matrix[char_buff[2]][3*(char_buff[1]%X_MAX)+1] = char_buff[4];\n led_matrix[char_buff[2]][3*(char_buff[1]%X_MAX)+2] = char_buff[5]; \n \n \n \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/ Writing the colours to the LED's \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n \n \n unsigned vert_pos = char_buff[2]%Y_MAX; \/\/ The absolute vertical position in the structure\n \n unsigned row_pos = char_buff[2] % 8 ; \/\/ The relative position of the strip being actuated\n \n if((char_buff[0] == 254) && (q >= 5)){\n \n \n ADDRESS_PIN_1 = mask_1 & vert_pos; \/\/Change the value on each address pin\n ADDRESS_PIN_2 = mask_2 & vert_pos;\n ADDRESS_PIN_3 = mask_3 & vert_pos;\n \n \n \n \n for (int col = 0; col < 3*nCols*horizontal_blocks; col++){\n \/\/ This is the data to be sent out on each data pin\n ledmatrix_row1[col] = led_matrix[row_pos] [col];\n if (vertical_blocks > 1) {\n \tledmatrix_row2[col] = led_matrix[row_pos+nRows] [col];}\t\n if (vertical_blocks > 2) {\n \tledmatrix_row3[col] = led_matrix[row_pos+2*nRows] [col];}\n if (vertical_blocks > 3) {\n \tledmatrix_row4[col] = led_matrix[row_pos+3*nRows] [col];}\n }\n \n \n \/\/\t\tSend the data out into the real world...\n illuminateStrip(lightStrip1, ledmatrix_row1);\n \n if (vertical_blocks > 1) {\n \t\tilluminateStrip(lightStrip2, ledmatrix_row2);}\n if (vertical_blocks > 2) {\n \tilluminateStrip(lightStrip3, ledmatrix_row3);}\n if (vertical_blocks > 3) {\n \tilluminateStrip(lightStrip4, ledmatrix_row4);}\n \n \n \n pc.putc(48+(char_buff[1]));\n \n }\n else{ \n \n \/\/ Clear function. Still a little tempermental.\n for (int col = 0; col < 3*nCols*horizontal_blocks; col++){\n for (int row = 0; row < nRows*vertical_blocks; row ++) {\n \n led_matrix[row][col] = 0; \/\/Set the entire matrix to zero\n } \n }\n \n for (int j = 0; j Update multiplexing_code.cpp#include \"mbed.h\"\n#include \"WS2811.h\"\n\n#define X_MAX 64\n#define Y_MAX 64\n\n#define nRows 8 \/\/The number of rows in a basic block\n#define nCols 8 \/\/ The number of columns in a basic block\n\n\/\/ per LED: 3 * 20 mA = 60mA max\n\/\/ 60 LEDs: 60 * 60mA = 3600 mA max\n\/\/ 120 LEDs: 7200 mA max\nunsigned const nLEDs = MAX_LEDS_PER_STRIP; \/\/ 64\n\nunsigned const horizontal_blocks = 3; \/\/The number of basic blocks connected horizontally\nunsigned const vertical_blocks = 4; \/\/The number of basic blocks connected vertically\n\n\/\/Each mask corresponds to the nth significant bit in a binary word\nuint8_t mask_1 = 1;\nuint8_t mask_2 = 2;\nuint8_t mask_3 = 4;\nuint8_t mask_4 = 8;\nuint8_t mask_5 = 16;\nuint8_t mask_6 = 32;\n\n\/\/ Pins *NUMBERS* for PORTC (convenient for KL25Z freedom board)\n\nunsigned const DATA_OUT_PIN1 = 7; \/\/ DATA OUT for the highest vertical block\nunsigned const DATA_OUT_PIN2 = 0;\/\/ The lower the PIN number, the higher it is IRL\nunsigned const DATA_OUT_PIN3 = 3;\nunsigned const DATA_OUT_PIN4 = 4;\n\n\/\/ Address Pin locations (There is some issue with the pins where only these specific pins can be used for addressing.)\nDigitalOut ADDRESS_PIN_3(D2); \/\/ AKA PTD4\nDigitalOut ADDRESS_PIN_2(D3); \/\/ AKA PTA12\nDigitalOut ADDRESS_PIN_1(D5); \/\/ AKA PTA5\n\n\n\nSerial pc(USBTX, USBRX); \/\/ D1 (PTA2) and D0 (PTA1) on KL25Z\n\nstatic void clearStrip(WS2811 &strip, unsigned nLEDs)\n{\n for (unsigned i = 0; i < nLEDs; i++) {\n strip.setPixelColor(i, 0, 0, 0);\n }\n strip.show();\n}\n\nstatic void illuminateStrip(WS2811 &strip, uint8_t led_matrix[],unsigned nLEDs)\n{\n for (unsigned i = 0; i < nLEDs; i++) {\n strip.setPixelColor(i, led_matrix[3*i], led_matrix[(3*i)+1], led_matrix[(3*i)+2]);\n }\n strip.show();\n}\n\n\n\nint main(void)\n{\n pc.baud(115200); \/\/ 11520 Bytes\/s -> ~0.3s for 32x32 RGB pixels\n \n \n \/\/ Initialize one LED Strip, run from one pin. This is a placeholder for the entire block.\n\n WS2811 lightStrip1(nLEDs,DATA_OUT_PIN1); \/\/Highest Vertical Block (1.0)\n WS2811 lightStrip2(nLEDs,DATA_OUT_PIN2);\n WS2811 lightStrip3(nLEDs,DATA_OUT_PIN3); \n WS2811 lightStrip4(nLEDs,DATA_OUT_PIN4); \/\/ Lowest Vertical Block (4.0)\n \n \n \/* -------------------------------------\n | | |\n | BLOCK | BLOCK |\n | 1.0 | 1.1 |\n | | |\n |_______________|___________________|\n | | |\n | | |\n | BLOCK | BLOCK |\n | 2.0 | 2.1 |\n | | |\n ----------------|--------------------\n *\/\n \n lightStrip1.begin();\n lightStrip2.begin();\n lightStrip3.begin();\n lightStrip4.begin();\n \n uint8_t q = 0; \/\/ index variable\n uint8_t char_buff[10]; \/\/ UART buffer\n uint8_t curr_char = 0; \/\/ current byte read from UART\n \n \n uint8_t led_matrix[nRows*vertical_blocks][3*nCols*horizontal_blocks] = {0}; \/\/ Define a matrix to store RGB info about each LED in the array\n \n uint8_t ledmatrix_row1[3*nCols*horizontal_blocks] = {0}; \/\/ Temporary variables to take in each row in an array for input to a function\n uint8_t ledmatrix_row2[3*nCols*horizontal_blocks] = {0};\t\t\/\/ Each array represents a separate data pin. All data pins are driven simultaeneously\t\n uint8_t ledmatrix_row3[3*nCols*horizontal_blocks] = {0};\t\t\/\/ to keep the matrix correct.\n uint8_t ledmatrix_row4[3*nCols*horizontal_blocks] = {0};\n \n \n \n for (;;) {\n \n \/* I have defined a custom UART packet protocol\n * A general packet may look like: \n * char_buff[0] start byte: 254\n * char_buff[1] x-coordinate [0, 63]\n * char_buff[2] y-coordinate [0, 63]\n * char_buff[3] R (6-bit) [0, 63]\n * char_buff[4] G (6-bit) [0, 63]\n * char_buff[5] B (6-bit) [0, 63]\n * char_buff[6] Delimiter: 255\n *\/\n while(curr_char != 255 && q < 7)\n {\n \/* If there is UART traffic *\/\n if(pc.readable())\n {\n curr_char = uint8_t(pc.getc());\n char_buff[q] = curr_char;\n q++;\n }\n }\n \n \n \n \/\/Store the RGB values at the correct place in the array\n led_matrix[char_buff[2]][3*(char_buff[1]%X_MAX)] = char_buff[3];\n led_matrix[char_buff[2]][3*(char_buff[1]%X_MAX)+1] = char_buff[4];\n led_matrix[char_buff[2]][3*(char_buff[1]%X_MAX)+2] = char_buff[5]; \n \n \n \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/ Writing the colours to the LED's \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n \n \n unsigned vert_pos = char_buff[2]%Y_MAX; \/\/ The absolute vertical position in the structure\n \n unsigned row_pos = char_buff[2] % nRows ; \/\/ The relative position of the strip being actuated\n \n if((char_buff[0] == 254) && (q >= 5)){\n \n \n ADDRESS_PIN_1 = mask_1 & vert_pos; \/\/Change the value on each address pin\n ADDRESS_PIN_2 = mask_2 & vert_pos;\n ADDRESS_PIN_3 = mask_3 & vert_pos;\n \n \n \n \n for (int col = 0; col < 3*nCols*horizontal_blocks; col++){\n \/\/ This is the data to be sent out on each data pin\n ledmatrix_row1[col] = led_matrix[row_pos] [col];\n if (vertical_blocks > 1) {\n \tledmatrix_row2[col] = led_matrix[row_pos+nRows] [col];}\t\n if (vertical_blocks > 2) {\n \tledmatrix_row3[col] = led_matrix[row_pos+2*nRows] [col];}\n if (vertical_blocks > 3) {\n \tledmatrix_row4[col] = led_matrix[row_pos+3*nRows] [col];}\n }\n \n \n \/\/\t\tSend the data out into the real world...\n illuminateStrip(lightStrip1, ledmatrix_row1,nCols*horizontal_blocks);\n \n if (vertical_blocks > 1) {\n \t\tilluminateStrip(lightStrip2, ledmatrix_row2,nCols*horizontal_blocks);}\n if (vertical_blocks > 2) {\n \tilluminateStrip(lightStrip3, ledmatrix_row3,nCols*horizontal_blocks);}\n if (vertical_blocks > 3) {\n \tilluminateStrip(lightStrip4, ledmatrix_row4,nCols*horizontal_blocks);}\n \n \n \n pc.putc(48+(char_buff[1]));\n \n }\n else{ \n \n \/\/ Clear function. Still a little tempermental.\n for (int col = 0; col < 3*nCols*horizontal_blocks; col++){\n for (int row = 0; row < nRows*vertical_blocks; row ++) {\n \n led_matrix[row][col] = 0; \/\/Set the entire matrix to zero\n } \n }\n \n for (int j = 0; j "} {"text":"#include \"ofxLog4CppChannel.h\"\n\nnamespace ofxLog4CppChannelNS{\n\tbool isShutdown;\n\tvoid shutdown(){\n\t\tisShutdown = true;\n\t}\n}\n\nofxLog4CppChannel::ofxLog4CppChannel():\n\troot(log4cpp::Category::getRoot())\n{\n\tofxLog4Cpp::init();\n\tofSetLogLevel(ofLogLevel::OF_LOG_VERBOSE);\/\/let's let log4cpp handle the filtering, not oF\n\tofxLog4CppChannelNS::isShutdown = false;\n\tlog4cpp::HierarchyMaintainer::getDefaultMaintainer().register_shutdown_handler(&ofxLog4CppChannelNS::shutdown);\n}\n\nofxLog4CppChannel::~ofxLog4CppChannel(){\n}\n\nvoid ofxLog4CppChannel::close(){\n}\n\nvoid ofxLog4CppChannel::log(ofLogLevel level, const string & module, const string & message){\n\tif (!ofxLog4CppChannelNS::isShutdown){\n\t\troot.log(of2l4c(level), message);\n\t}\n\t\/\/ofxLog4Cpp::log(module, of2l4c(level), message);\n}\n\nvoid ofxLog4CppChannel::log(ofLogLevel level, const string & module, const char* format, ...){\n\tva_list args;\n\tva_start(args, format);\n\tlog(level, module, format, args);\n\tva_end(args);\n}\n\nvoid ofxLog4CppChannel::log(ofLogLevel level, const string & module, const char* format, va_list args){\n\tlog(level, module, ofVAArgsToString(format, args));\n}\nincluding module info in my hack#include \"ofxLog4CppChannel.h\"\n\nnamespace ofxLog4CppChannelNS{\n\tbool isShutdown;\n\tvoid shutdown(){\n\t\tisShutdown = true;\n\t}\n}\n\nofxLog4CppChannel::ofxLog4CppChannel():\n\troot(log4cpp::Category::getRoot())\n{\n\tofxLog4Cpp::init();\n\tofSetLogLevel(ofLogLevel::OF_LOG_VERBOSE);\/\/let's let log4cpp handle the filtering, not oF\n\tofxLog4CppChannelNS::isShutdown = false;\n\tlog4cpp::HierarchyMaintainer::getDefaultMaintainer().register_shutdown_handler(&ofxLog4CppChannelNS::shutdown);\n}\n\nofxLog4CppChannel::~ofxLog4CppChannel(){\n}\n\nvoid ofxLog4CppChannel::close(){\n}\n\nvoid ofxLog4CppChannel::log(ofLogLevel level, const string & module, const string & message){\n\tif (!ofxLog4CppChannelNS::isShutdown){\n\t\troot.log(of2l4c(level), \"[\" + module + \"] \" + message);\n\t}\n\t\/\/ofxLog4Cpp::log(module, of2l4c(level), message);\n}\n\nvoid ofxLog4CppChannel::log(ofLogLevel level, const string & module, const char* format, ...){\n\tva_list args;\n\tva_start(args, format);\n\tlog(level, module, format, args);\n\tva_end(args);\n}\n\nvoid ofxLog4CppChannel::log(ofLogLevel level, const string & module, const char* format, va_list args){\n\tlog(level, module, ofVAArgsToString(format, args));\n}\n<|endoftext|>"} {"text":"#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n\nnamespace std\n{\n ostream&\n operator<< (ostream& o, const parser::case_type& c)\n {\n return o << \"\/* \" << (const void*) &c << \" *\/ \"\n << \"case \"\n << libport::deref << c.first\n << \" => \"\n << libport::deref << c.second;\n }\n\n ostream&\n operator<< (ostream& o, const parser::cases_type& cs)\n {\n o << \"\/* \" << (const void*) &cs << \" *\/ \"\n << \"{\" << endl;\n foreach (const parser::case_type& c, cs)\n o << \" \" << c << endl;\n return o << \"}\";\n }\n\n}\n\nnamespace parser\n{\n ast::rExp\n ast_at(const yy::location& loc,\n ast::rExp cond,\n ast::rExp body, ast::rExp onleave,\n ast::rExp duration)\n {\n if (!onleave)\n onleave = new ast::Noop(loc, 0);\n\n if (duration)\n {\n PARAMETRIC_AST(desugar,\n \"var '$at' = persist(%exp:1, %exp:2) |\"\n \"at ('$at') %exp:3 onleave %exp:4\");\n\n return exp(desugar % cond % duration % body % onleave);\n }\n else\n {\n PARAMETRIC_AST(desugar,\n \"Control.at_(%exp:1, detach(%exp:2), detach(%exp:3))\");\n\n return exp(desugar % cond % body % onleave);\n }\n }\n\n ast::rExp\n ast_event_catcher(const ast::loc& loc,\n EventMatch& event,\n ast::rExp body, ast::rExp onleave)\n {\n if (onleave)\n {\n PARAMETRIC_AST(a, \"%exp:1 | %exp:2\");\n body = exp(a % body % onleave);\n }\n\n if (event.guard)\n {\n PARAMETRIC_AST(desugar_guard,\n \"if (%exp:1) %exp:2;\");\n body = exp(desugar_guard % event.guard % body);\n }\n\n if (event.pattern)\n {\n ast::rExp pattern = new ast::List(loc, event.pattern);\n rewrite::PatternBinder bind(ast_call(loc, SYMBOL(DOLLAR_pattern)), loc);\n bind(pattern.get());\n PARAMETRIC_AST(desugar,\n \"detach(\"\n \"{\"\n \" %exp:1.onEvent(\"\n \" closure ('$evt')\"\n \" {\"\n \" var '$pattern' = Pattern.new(%exp:2) |\"\n \" if ('$pattern'.match('$evt'.payload))\"\n \" {\"\n \" %exp: 3 |\"\n \" %exp: 4 |\"\n \" }\"\n \" })\"\n \"})\");\n return exp(desugar\n % event.event\n % bind.result_get().unchecked_cast()\n % bind.bindings_get()\n % body);\n }\n else\n {\n PARAMETRIC_AST(desugar_no_pattern,\n \"detach(\"\n \"{\"\n \" %exp:1.onEvent(closure ('$evt')\"\n \" {\"\n \" %exp: 2 |\"\n \" })\"\n \"})\");\n return exp(desugar_no_pattern % event.event % body);\n }\n }\n\n\n ast::rExp\n ast_at_event(const ast::loc& loc,\n EventMatch& event,\n ast::rExp body, ast::rExp onleave)\n {\n PARAMETRIC_AST(desugar_body,\n \"%exp:1 |\"\n \"waituntil(!'$evt'.active)\");\n body = exp(desugar_body % body);\n return ast_event_catcher(loc, event, body, onleave);\n }\n\n\n \/\/\/ Create a new Tree node composing \\c Lhs and \\c Rhs with \\c Op.\n \/\/\/ \\param op must be & or |.\n ast::rExp\n ast_bin(const yy::location& l,\n ast::flavor_type op, ast::rExp lhs, ast::rExp rhs)\n {\n ast::rExp res = 0;\n assert (lhs);\n assert (rhs);\n switch (op)\n {\n case ast::flavor_pipe:\n {\n ast::rPipe pipe;\n if (pipe = lhs.unsafe_cast())\n pipe->children_get().push_back(rhs);\n else\n {\n pipe = new ast::Pipe(l, ast::exps_type());\n pipe->children_get().push_back(lhs);\n pipe->children_get().push_back(rhs);\n }\n res = pipe;\n break;\n }\n case ast::flavor_and:\n {\n ast::rAnd rand;\n if (rand = lhs.unsafe_cast())\n rand->children_get().push_back(rhs);\n else\n {\n rand = new ast::And(l, ast::exps_type());\n rand->children_get().push_back(lhs);\n rand->children_get().push_back(rhs);\n }\n res = rand;\n break;\n }\n case ast::flavor_comma:\n case ast::flavor_semicolon:\n {\n ast::rNary nary = new ast::Nary(l);\n nary->push_back(lhs, op);\n nary->push_back(rhs);\n res = nary;\n break;\n }\n case ast::flavor_none:\n pabort(op);\n }\n return res;\n }\n\n\n \/\/\/ \" (args)\".\n ast::rCall\n ast_call (const yy::location& l,\n libport::Symbol method)\n {\n return ast_call(l, new ast::Implicit(l), method);\n }\n\n\n \/\/\/ \" . (args)\".\n ast::rCall\n ast_call(const yy::location& l,\n ast::rExp target, libport::Symbol method, ast::exps_type* args)\n {\n return new ast::Call(l, args, target, method);\n }\n\n \/\/\/ \" . ()\".\n ast::rCall\n ast_call(const yy::location& l, ast::rExp target, libport::Symbol method)\n {\n return ast_call(l, target, method, 0);\n }\n\n \/\/\/ \" . ()\".\n ast::rCall\n ast_call(const yy::location& l,\n ast::rExp target, libport::Symbol method, ast::rExp arg1)\n {\n ast::rCall res = ast_call(l, target, method, new ast::exps_type);\n res->arguments_get()->push_back(arg1);\n return res;\n }\n\n\n \/\/\/ \" . (, )\".\n \/\/\/ \" . (, , )\".\n ast::rCall\n ast_call(const yy::location& l,\n ast::rExp target, libport::Symbol method,\n ast::rExp arg1, ast::rExp arg2, ast::rExp arg3)\n {\n ast::rCall res = ast_call(l, target, method, new ast::exps_type);\n res->arguments_get()->push_back(arg1);\n res->arguments_get()->push_back(arg2);\n if (arg3)\n res->arguments_get()->push_back(arg3);\n return res;\n }\n\n\n ast::rExp\n ast_closure(ast::rExp value)\n {\n PARAMETRIC_AST(a, \"closure () { %exp:1 }\");\n return exp(a % value);\n }\n\n\n \/\/\/ Build a for loop.\n \/\/ The increment is included directly in the condition to make sure\n \/\/ it is executed on `continue'.\n ast::rExp\n ast_for(const yy::location&, ast::flavor_type,\n ast::rExp init, ast::rExp test, ast::rExp inc,\n ast::rExp body)\n {\n \/\/ FIXME: for| is handled as a simple for\n PARAMETRIC_AST(desugar,\n \"{\"\n \" %exp:1 |\"\n \" var '$tmp-for-first' = true |\"\n \" while ({ if ('$tmp-for-first') '$tmp-for-first' = false else %exp:2 | %exp:3})\"\n \" %exp:4 |\"\n \"}\"\n );\n return exp(desugar % init % inc % test % body);\n }\n\n\n ast::rExp\n ast_if(const yy::location& l,\n ast::rExp cond, ast::rExp iftrue, ast::rExp iffalse)\n {\n return new ast::If(l, ast_strip(cond),\n ast_scope(l, iftrue),\n\t\t iffalse ? ast_scope(l, iffalse) : new ast::Noop(l, 0));\n }\n\n\n ast::rLValue\n ast_lvalue_once(const ast::rLValue& lvalue)\n {\n ast::rCall tmp = ast_call(lvalue->location_get(), SYMBOL(DOLLAR_tmp));\n\n if (lvalue->call()->target_implicit())\n return lvalue.get();\n else\n return ast_call(lvalue->location_get(), tmp, lvalue->call()->name_get());\n }\n\n ast::rExp\n ast_lvalue_wrap(const ast::rLValue& lvalue, const ast::rExp& e)\n {\n PARAMETRIC_AST(wrap,\n \"{\"\n \"var '$tmp' = %exp:1;\"\n \"%exp:2;\"\n \"}\"\n );\n\n if (lvalue->call()->target_implicit())\n return e;\n else\n {\n wrap % lvalue->call()->target_get() % e;\n return exp(wrap);\n }\n }\n\n ast::rExp\n ast_nil()\n {\n PARAMETRIC_AST(nil, \"nil\");\n return exp(nil);\n }\n\n \/\/\/ Return \\a e in a ast::Scope unless it is already one.\n ast::rScope\n ast_scope(const yy::location& l, ast::rExp target, ast::rExp e)\n {\n if (ast::rScope res = e.unsafe_cast())\n return res;\n else if (target)\n return new ast::Do(l, e, target);\n else\n return new ast::Scope(l, e);\n }\n\n ast::rScope\n ast_scope(const yy::location& l, ast::rExp e)\n {\n return ast_scope(l, 0, e);\n }\n\n ast::rExp\n ast_string(const yy::location& l, libport::Symbol s)\n {\n return new ast::String(l, s);\n }\n\n\n \/*------------.\n | ast_strip. |\n `------------*\/\n\n ast::rExp\n ast_strip(ast::rNary nary)\n {\n ast::rExp res = nary;\n \/\/ Remove useless nary and statement if there's only one child.\n if (nary->children_get().size() == 1)\n res = (nary->children_get().front()\n .unchecked_cast()\n ->expression_get());\n return res;\n }\n\n ast::rExp\n ast_strip(ast::rExp e)\n {\n if (ast::rNary nary = e.unsafe_cast())\n return ast_strip(nary);\n else\n return e;\n }\n\n\n ast::rExp\n ast_switch(const yy::location&, ast::rExp cond,\n const cases_type& cases, ast::rExp def)\n {\n const ast::loc& loc = cond->location_get();\n ast::rExp inner = def ? def : ast_nil();\n rforeach (const case_type& c, cases)\n {\n PARAMETRIC_AST(desugar,\n \"var '$pattern' = Pattern.new(%exp:1) |\"\n \"if (if ('$pattern'.match('$switch'))\"\n \" {\"\n \" %exp:2 |\"\n \" %exp:3\"\n \" }\"\n \" else\"\n \" false)\"\n \"{\"\n \" %exp:4 |\"\n \" %exp:5\"\n \"}\"\n \"else\"\n \" %exp:6\"\n );\n\n PARAMETRIC_AST(cond,\n \"true\");\n\n ast::rExp condition = c.first->guard_get();\n if (!condition)\n condition = exp(cond);\n\n rewrite::PatternBinder bind(ast_call(loc, SYMBOL(DOLLAR_pattern)), loc);\n bind(c.first->pattern_get().get());\n\n desugar\n % bind.result_get().unchecked_cast()\n % bind.bindings_get()\n % condition\n % bind.bindings_get()\n % c.second\n % inner;\n inner = ast::exp(desugar);\n }\n\n PARAMETRIC_AST(sw, \"{ var '$switch' = %exp:1 | %exp:2 }\");\n return exp(sw % cond % inner);\n }\n\n ast::rExp\n ast_timeout(const ast::rExp& duration, const ast::rExp& body)\n {\n PARAMETRIC_AST(desugar,\n\t\t \"{\"\n\t\t \" var '$tag' = Tag.new |\"\n\t\t \" '$tag':\"\n\t\t \" {\"\n\t\t \" {\"\n\t\t \" sleep(%exp:1) | '$tag'.stop\"\n\t\t \" },\"\n\t\t \" %exp:2 | '$tag'.stop\"\n\t\t \" }\"\n\t\t \"}\");\n return exp(desugar % duration % body);\n }\n\n\n ast::rExp\n ast_waituntil(const yy::location&,\n const ast::rExp& cond, ast::rExp duration)\n {\n if (duration)\n {\n PARAMETRIC_AST(desugar,\n \"{\"\n \" var '$waituntil' = persist(%exp:1, %exp:2) |\"\n \" waituntil('$waituntil'())\"\n \"}\"\n );\n return exp(desugar % cond % duration);\n }\n else\n {\n PARAMETRIC_AST(desugar,\n \"{var '$tag' = Tag.new |\"\n \"'$tag': {at (%exp:1) '$tag'.stop | sleep(inf)}}\");\n return exp(desugar % cond);\n }\n }\n\n\n ast::rExp\n ast_waituntil_event(const ast::loc& loc,\n ast::rExp event,\n ast::exps_type* payload)\n {\n if (!payload)\n {\n PARAMETRIC_AST\n (desugar,\n \" %exp:1.'waituntil'(nil)\");\n return exp(desugar % event);\n }\n\n PARAMETRIC_AST\n (desugar,\n \"{\"\n \" var '$pattern' = Pattern.new(%exp:1) |\"\n \" %exp:2.'waituntil'('$pattern') |\"\n \" {\"\n \" %unscope: 2 |\"\n \" %exp:3 |\"\n \" }\"\n \"}\");\n\n ast::rList d_payload = new ast::List(loc, payload);\n\n rewrite::PatternBinder bind(ast_call(loc, SYMBOL(DOLLAR_pattern)), loc);\n bind(d_payload.get());\n\n return exp(desugar\n % bind.result_get().unchecked_cast()\n % event\n % bind.bindings_get());\n }\n\n ast::rExp\n ast_whenever_event(const ast::loc& loc,\n EventMatch& event,\n ast::rExp body, ast::rExp onleave)\n {\n PARAMETRIC_AST(desugar_body,\n \"while (true)\"\n \"{\"\n \" %exp:1 |\"\n \" if(!'$evt'.active)\"\n \" break\"\n \"}\");\n body = exp(desugar_body % body);\n return ast_event_catcher(loc, event, body, onleave);\n }\n\n ast::rExp\n ast_whenever(const yy::location&,\n ast::rExp cond,\n ast::rExp body, ast::rExp else_stmt,\n ast::rExp duration)\n {\n \/\/ FIXME: Be smarter on empty else_stmt.\n if (!else_stmt)\n else_stmt = ast_nil();\n if (duration)\n {\n PARAMETRIC_AST(desugar,\n \"var '$whenever' = persist(%exp:1, %exp:2) |\"\n \"Control.whenever_('$whenever'.val, %exp:3, %exp:4) |'\"\n );\n return exp(desugar % cond % duration % body % else_stmt);\n }\n else\n {\n PARAMETRIC_AST(desugar,\n \"Control.whenever_(%exp:1, %exp:2, %exp:3)\");\n return exp(desugar % cond % body % else_stmt);\n }\n }\n\n}\nparser: avoid unary naries in scopes.#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n\nnamespace std\n{\n ostream&\n operator<< (ostream& o, const parser::case_type& c)\n {\n return o << \"\/* \" << (const void*) &c << \" *\/ \"\n << \"case \"\n << libport::deref << c.first\n << \" => \"\n << libport::deref << c.second;\n }\n\n ostream&\n operator<< (ostream& o, const parser::cases_type& cs)\n {\n o << \"\/* \" << (const void*) &cs << \" *\/ \"\n << \"{\" << endl;\n foreach (const parser::case_type& c, cs)\n o << \" \" << c << endl;\n return o << \"}\";\n }\n\n}\n\nnamespace parser\n{\n ast::rExp\n ast_at(const yy::location& loc,\n ast::rExp cond,\n ast::rExp body, ast::rExp onleave,\n ast::rExp duration)\n {\n if (!onleave)\n onleave = new ast::Noop(loc, 0);\n\n if (duration)\n {\n PARAMETRIC_AST(desugar,\n \"var '$at' = persist(%exp:1, %exp:2) |\"\n \"at ('$at') %exp:3 onleave %exp:4\");\n\n return exp(desugar % cond % duration % body % onleave);\n }\n else\n {\n PARAMETRIC_AST(desugar,\n \"Control.at_(%exp:1, detach(%exp:2), detach(%exp:3))\");\n\n return exp(desugar % cond % body % onleave);\n }\n }\n\n ast::rExp\n ast_event_catcher(const ast::loc& loc,\n EventMatch& event,\n ast::rExp body, ast::rExp onleave)\n {\n if (onleave)\n {\n PARAMETRIC_AST(a, \"%exp:1 | %exp:2\");\n body = exp(a % body % onleave);\n }\n\n if (event.guard)\n {\n PARAMETRIC_AST(desugar_guard,\n \"if (%exp:1) %exp:2;\");\n body = exp(desugar_guard % event.guard % body);\n }\n\n if (event.pattern)\n {\n ast::rExp pattern = new ast::List(loc, event.pattern);\n rewrite::PatternBinder bind(ast_call(loc, SYMBOL(DOLLAR_pattern)), loc);\n bind(pattern.get());\n PARAMETRIC_AST(desugar,\n \"detach(\"\n \"{\"\n \" %exp:1.onEvent(\"\n \" closure ('$evt')\"\n \" {\"\n \" var '$pattern' = Pattern.new(%exp:2) |\"\n \" if ('$pattern'.match('$evt'.payload))\"\n \" {\"\n \" %exp: 3 |\"\n \" %exp: 4 |\"\n \" }\"\n \" })\"\n \"})\");\n return exp(desugar\n % event.event\n % bind.result_get().unchecked_cast()\n % bind.bindings_get()\n % body);\n }\n else\n {\n PARAMETRIC_AST(desugar_no_pattern,\n \"detach(\"\n \"{\"\n \" %exp:1.onEvent(closure ('$evt')\"\n \" {\"\n \" %exp: 2 |\"\n \" })\"\n \"})\");\n return exp(desugar_no_pattern % event.event % body);\n }\n }\n\n\n ast::rExp\n ast_at_event(const ast::loc& loc,\n EventMatch& event,\n ast::rExp body, ast::rExp onleave)\n {\n PARAMETRIC_AST(desugar_body,\n \"%exp:1 |\"\n \"waituntil(!'$evt'.active)\");\n body = exp(desugar_body % body);\n return ast_event_catcher(loc, event, body, onleave);\n }\n\n\n \/\/\/ Create a new Tree node composing \\c Lhs and \\c Rhs with \\c Op.\n \/\/\/ \\param op must be & or |.\n ast::rExp\n ast_bin(const yy::location& l,\n ast::flavor_type op, ast::rExp lhs, ast::rExp rhs)\n {\n ast::rExp res = 0;\n assert (lhs);\n assert (rhs);\n switch (op)\n {\n case ast::flavor_pipe:\n {\n ast::rPipe pipe;\n if (pipe = lhs.unsafe_cast())\n pipe->children_get().push_back(rhs);\n else\n {\n pipe = new ast::Pipe(l, ast::exps_type());\n pipe->children_get().push_back(lhs);\n pipe->children_get().push_back(rhs);\n }\n res = pipe;\n break;\n }\n case ast::flavor_and:\n {\n ast::rAnd rand;\n if (rand = lhs.unsafe_cast())\n rand->children_get().push_back(rhs);\n else\n {\n rand = new ast::And(l, ast::exps_type());\n rand->children_get().push_back(lhs);\n rand->children_get().push_back(rhs);\n }\n res = rand;\n break;\n }\n case ast::flavor_comma:\n case ast::flavor_semicolon:\n {\n ast::rNary nary = new ast::Nary(l);\n nary->push_back(lhs, op);\n nary->push_back(rhs);\n res = nary;\n break;\n }\n case ast::flavor_none:\n pabort(op);\n }\n return res;\n }\n\n\n \/\/\/ \" (args)\".\n ast::rCall\n ast_call (const yy::location& l,\n libport::Symbol method)\n {\n return ast_call(l, new ast::Implicit(l), method);\n }\n\n\n \/\/\/ \" . (args)\".\n ast::rCall\n ast_call(const yy::location& l,\n ast::rExp target, libport::Symbol method, ast::exps_type* args)\n {\n return new ast::Call(l, args, target, method);\n }\n\n \/\/\/ \" . ()\".\n ast::rCall\n ast_call(const yy::location& l, ast::rExp target, libport::Symbol method)\n {\n return ast_call(l, target, method, 0);\n }\n\n \/\/\/ \" . ()\".\n ast::rCall\n ast_call(const yy::location& l,\n ast::rExp target, libport::Symbol method, ast::rExp arg1)\n {\n ast::rCall res = ast_call(l, target, method, new ast::exps_type);\n res->arguments_get()->push_back(arg1);\n return res;\n }\n\n\n \/\/\/ \" . (, )\".\n \/\/\/ \" . (, , )\".\n ast::rCall\n ast_call(const yy::location& l,\n ast::rExp target, libport::Symbol method,\n ast::rExp arg1, ast::rExp arg2, ast::rExp arg3)\n {\n ast::rCall res = ast_call(l, target, method, new ast::exps_type);\n res->arguments_get()->push_back(arg1);\n res->arguments_get()->push_back(arg2);\n if (arg3)\n res->arguments_get()->push_back(arg3);\n return res;\n }\n\n\n ast::rExp\n ast_closure(ast::rExp value)\n {\n PARAMETRIC_AST(a, \"closure () { %exp:1 }\");\n return exp(a % value);\n }\n\n\n \/\/\/ Build a for loop.\n \/\/ The increment is included directly in the condition to make sure\n \/\/ it is executed on `continue'.\n ast::rExp\n ast_for(const yy::location&, ast::flavor_type,\n ast::rExp init, ast::rExp test, ast::rExp inc,\n ast::rExp body)\n {\n \/\/ FIXME: for| is handled as a simple for\n PARAMETRIC_AST(desugar,\n \"{\"\n \" %exp:1 |\"\n \" var '$tmp-for-first' = true |\"\n \" while ({ if ('$tmp-for-first') '$tmp-for-first' = false else %exp:2 | %exp:3})\"\n \" %exp:4 |\"\n \"}\"\n );\n return exp(desugar % init % inc % test % body);\n }\n\n\n ast::rExp\n ast_if(const yy::location& l,\n ast::rExp cond, ast::rExp iftrue, ast::rExp iffalse)\n {\n return new ast::If(l, ast_strip(cond),\n ast_scope(l, iftrue),\n\t\t iffalse ? ast_scope(l, iffalse) : new ast::Noop(l, 0));\n }\n\n\n ast::rLValue\n ast_lvalue_once(const ast::rLValue& lvalue)\n {\n ast::rCall tmp = ast_call(lvalue->location_get(), SYMBOL(DOLLAR_tmp));\n\n if (lvalue->call()->target_implicit())\n return lvalue.get();\n else\n return ast_call(lvalue->location_get(), tmp, lvalue->call()->name_get());\n }\n\n ast::rExp\n ast_lvalue_wrap(const ast::rLValue& lvalue, const ast::rExp& e)\n {\n PARAMETRIC_AST(wrap,\n \"{\"\n \"var '$tmp' = %exp:1;\"\n \"%exp:2;\"\n \"}\"\n );\n\n if (lvalue->call()->target_implicit())\n return e;\n else\n {\n wrap % lvalue->call()->target_get() % e;\n return exp(wrap);\n }\n }\n\n ast::rExp\n ast_nil()\n {\n PARAMETRIC_AST(nil, \"nil\");\n return exp(nil);\n }\n\n \/\/\/ Return \\a e in a ast::Scope unless it is already one.\n ast::rScope\n ast_scope(const yy::location& l, ast::rExp target, ast::rExp e)\n {\n if (ast::rScope res = e.unsafe_cast())\n return res;\n else if (target)\n return new ast::Do(l, ast_strip(e), ast_strip(target));\n else\n return new ast::Scope(l, ast_strip(e));\n }\n\n ast::rScope\n ast_scope(const yy::location& l, ast::rExp e)\n {\n return ast_scope(l, 0, e);\n }\n\n ast::rExp\n ast_string(const yy::location& l, libport::Symbol s)\n {\n return new ast::String(l, s);\n }\n\n\n \/*------------.\n | ast_strip. |\n `------------*\/\n\n ast::rExp\n ast_strip(ast::rNary nary)\n {\n ast::rExp res = nary;\n \/\/ Remove useless nary and statement if there's only one child.\n if (nary->children_get().size() == 1)\n res = (nary->children_get().front()\n .unchecked_cast()\n ->expression_get());\n return res;\n }\n\n ast::rExp\n ast_strip(ast::rExp e)\n {\n if (ast::rNary nary = e.unsafe_cast())\n return ast_strip(nary);\n else\n return e;\n }\n\n\n ast::rExp\n ast_switch(const yy::location&, ast::rExp cond,\n const cases_type& cases, ast::rExp def)\n {\n const ast::loc& loc = cond->location_get();\n ast::rExp inner = def ? def : ast_nil();\n rforeach (const case_type& c, cases)\n {\n PARAMETRIC_AST(desugar,\n \"var '$pattern' = Pattern.new(%exp:1) |\"\n \"if (if ('$pattern'.match('$switch'))\"\n \" {\"\n \" %exp:2 |\"\n \" %exp:3\"\n \" }\"\n \" else\"\n \" false)\"\n \"{\"\n \" %exp:4 |\"\n \" %exp:5\"\n \"}\"\n \"else\"\n \" %exp:6\"\n );\n\n PARAMETRIC_AST(cond,\n \"true\");\n\n ast::rExp condition = c.first->guard_get();\n if (!condition)\n condition = exp(cond);\n\n rewrite::PatternBinder bind(ast_call(loc, SYMBOL(DOLLAR_pattern)), loc);\n bind(c.first->pattern_get().get());\n\n desugar\n % bind.result_get().unchecked_cast()\n % bind.bindings_get()\n % condition\n % bind.bindings_get()\n % c.second\n % inner;\n inner = ast::exp(desugar);\n }\n\n PARAMETRIC_AST(sw, \"{ var '$switch' = %exp:1 | %exp:2 }\");\n return exp(sw % cond % inner);\n }\n\n ast::rExp\n ast_timeout(const ast::rExp& duration, const ast::rExp& body)\n {\n PARAMETRIC_AST(desugar,\n\t\t \"{\"\n\t\t \" var '$tag' = Tag.new |\"\n\t\t \" '$tag':\"\n\t\t \" {\"\n\t\t \" {\"\n\t\t \" sleep(%exp:1) | '$tag'.stop\"\n\t\t \" },\"\n\t\t \" %exp:2 | '$tag'.stop\"\n\t\t \" }\"\n\t\t \"}\");\n return exp(desugar % duration % body);\n }\n\n\n ast::rExp\n ast_waituntil(const yy::location&,\n const ast::rExp& cond, ast::rExp duration)\n {\n if (duration)\n {\n PARAMETRIC_AST(desugar,\n \"{\"\n \" var '$waituntil' = persist(%exp:1, %exp:2) |\"\n \" waituntil('$waituntil'())\"\n \"}\"\n );\n return exp(desugar % cond % duration);\n }\n else\n {\n PARAMETRIC_AST(desugar,\n \"{var '$tag' = Tag.new |\"\n \"'$tag': {at (%exp:1) '$tag'.stop | sleep(inf)}}\");\n return exp(desugar % cond);\n }\n }\n\n\n ast::rExp\n ast_waituntil_event(const ast::loc& loc,\n ast::rExp event,\n ast::exps_type* payload)\n {\n if (!payload)\n {\n PARAMETRIC_AST\n (desugar,\n \" %exp:1.'waituntil'(nil)\");\n return exp(desugar % event);\n }\n\n PARAMETRIC_AST\n (desugar,\n \"{\"\n \" var '$pattern' = Pattern.new(%exp:1) |\"\n \" %exp:2.'waituntil'('$pattern') |\"\n \" {\"\n \" %unscope: 2 |\"\n \" %exp:3 |\"\n \" }\"\n \"}\");\n\n ast::rList d_payload = new ast::List(loc, payload);\n\n rewrite::PatternBinder bind(ast_call(loc, SYMBOL(DOLLAR_pattern)), loc);\n bind(d_payload.get());\n\n return exp(desugar\n % bind.result_get().unchecked_cast()\n % event\n % bind.bindings_get());\n }\n\n ast::rExp\n ast_whenever_event(const ast::loc& loc,\n EventMatch& event,\n ast::rExp body, ast::rExp onleave)\n {\n PARAMETRIC_AST(desugar_body,\n \"while (true)\"\n \"{\"\n \" %exp:1 |\"\n \" if(!'$evt'.active)\"\n \" break\"\n \"}\");\n body = exp(desugar_body % body);\n return ast_event_catcher(loc, event, body, onleave);\n }\n\n ast::rExp\n ast_whenever(const yy::location&,\n ast::rExp cond,\n ast::rExp body, ast::rExp else_stmt,\n ast::rExp duration)\n {\n \/\/ FIXME: Be smarter on empty else_stmt.\n if (!else_stmt)\n else_stmt = ast_nil();\n if (duration)\n {\n PARAMETRIC_AST(desugar,\n \"var '$whenever' = persist(%exp:1, %exp:2) |\"\n \"Control.whenever_('$whenever'.val, %exp:3, %exp:4) |'\"\n );\n return exp(desugar % cond % duration % body % else_stmt);\n }\n else\n {\n PARAMETRIC_AST(desugar,\n \"Control.whenever_(%exp:1, %exp:2, %exp:3)\");\n return exp(desugar % cond % body % else_stmt);\n }\n }\n\n}\n<|endoftext|>"} {"text":"\/\/\n\/\/ libavg - Media Playback Engine. \n\/\/ Copyright (C) 2003-2008 Ulrich von Zadow\n\/\/\n\/\/ This library is free software; you can redistribute it and\/or\n\/\/ modify it under the terms of the GNU Lesser General Public\n\/\/ License as published by the Free Software Foundation; either\n\/\/ version 2 of the License, or (at your option) any later version.\n\/\/\n\/\/ This library is distributed in the hope that it will be useful,\n\/\/ but WITHOUT ANY WARRANTY; without even the implied warranty of\n\/\/ MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU\n\/\/ Lesser General Public License for more details.\n\/\/\n\/\/ You should have received a copy of the GNU Lesser General Public\n\/\/ License along with this library; if not, write to the Free Software\n\/\/ Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA\n\/\/\n\/\/ Current versions can be found at www.libavg.de\n\/\/\n\n#include \"TextEngine.h\"\n\n#include \"..\/base\/Logger.h\"\n#include \"..\/base\/OSHelper.h\"\n#include \"..\/base\/Exception.h\"\n#include \"..\/base\/FileHelper.h\"\n#include \"..\/base\/StringHelper.h\"\n\n#include \n#include \n\nnamespace avg {\n\nusing namespace std;\n\nstatic void\ntext_subst_func_hint(FcPattern *pattern, gpointer data)\n{\n FcPatternAddBool(pattern, FC_HINTING, true);\n FcPatternAddInteger(pattern, FC_HINT_STYLE, FC_HINT_MEDIUM);\n FcPatternAddInteger(pattern, FC_RGBA, FC_RGBA_NONE);\n FcPatternAddBool(pattern, FC_ANTIALIAS, true);\n}\n\nstatic void\ntext_subst_func_nohint(FcPattern *pattern, gpointer data)\n{\n FcPatternAddBool(pattern, FC_HINTING, false);\n FcPatternAddBool(pattern, FC_AUTOHINT, false);\n FcPatternAddInteger(pattern, FC_HINT_STYLE, FC_HINT_NONE);\n FcPatternAddInteger(pattern, FC_RGBA, FC_RGBA_NONE);\n FcPatternAddBool(pattern, FC_ANTIALIAS, true);\n}\n\nTextEngine& TextEngine::get(bool bHint) \n{\n if (bHint) {\n static TextEngine s_Instance(true);\n return s_Instance;\n } else {\n static TextEngine s_Instance(false);\n return s_Instance;\n }\n}\n\n\nTextEngine::TextEngine(bool bHint)\n : m_bHint(bHint)\n{\n m_sFontDirs.push_back(\"fonts\/\");\n init();\n}\n\nTextEngine::~TextEngine()\n{\n deinit();\n}\n\nvoid TextEngine::init()\n{\n g_type_init();\n m_pFontMap = PANGO_FT2_FONT_MAP(pango_ft2_font_map_new());\n pango_ft2_font_map_set_resolution(m_pFontMap, 72, 72);\n if (m_bHint) {\n pango_ft2_font_map_set_default_substitute(m_pFontMap, text_subst_func_hint, \n 0, 0);\n } else {\n pango_ft2_font_map_set_default_substitute(m_pFontMap, text_subst_func_nohint, \n 0, 0);\n }\n m_pPangoContext = pango_font_map_create_context(PANGO_FONT_MAP(m_pFontMap));\n\n pango_context_set_language(m_pPangoContext,\n pango_language_from_string (\"en_US\"));\n pango_context_set_base_dir(m_pPangoContext, PANGO_DIRECTION_LTR);\n\n initFonts();\n\n string sOldLang = \"\";\n getEnv(\"LC_CTYPE\", sOldLang);\n setEnv(\"LC_CTYPE\", \"en-us\");\n pango_font_map_list_families(PANGO_FONT_MAP(m_pFontMap), &m_ppFontFamilies, \n &m_NumFontFamilies);\n setEnv(\"LC_CTYPE\", sOldLang);\n for (int i=0; i& TextEngine::getFontFamilies()\n{\n return m_sFonts;\n}\n\nconst vector& TextEngine::getFontVariants(const string& sFontName)\n{\n PangoFontFamily * pCurFamily = getFontFamily(sFontName);\n PangoFontFace ** ppFaces;\n int numFaces;\n pango_font_family_list_faces (pCurFamily, &ppFaces, &numFaces);\n static vector sVariants;\n for (int i=0; i(sFamily, sVariant));\n if (it == m_FontDescriptionCache.end()) {\n PangoFontFamily * pFamily;\n bool bFamilyFound = true;\n try {\n pFamily = getFontFamily(sFamily);\n } catch (Exception&) {\n if (m_sFontsNotFound.find(sFamily) == m_sFontsNotFound.end()) {\n AVG_TRACE(Logger::WARNING, \"Could not find font face \" << sFamily << \n \". Using sans instead.\");\n m_sFontsNotFound.insert(sFamily);\n }\n bFamilyFound = false;\n pFamily = getFontFamily(\"sans\");\n }\n PangoFontFace ** ppFaces;\n int numFaces;\n pango_font_family_list_faces(pFamily, &ppFaces, &numFaces);\n PangoFontFace * pFace = 0;\n if (sVariant == \"\") {\n pFace = ppFaces[0];\n } else {\n for (int i=0; i variant(sFamily, sVariant);\n if (m_VariantsNotFound.find(variant) == m_VariantsNotFound.end()) {\n m_VariantsNotFound.insert(variant);\n AVG_TRACE(Logger::WARNING, \"Could not find font variant \" \n << sFamily << \":\" << sVariant << \". Using \" <<\n pango_font_face_get_face_name(pFace) << \" instead.\");\n }\n }\n }\n g_free(ppFaces);\n pDescription = pango_font_face_describe(pFace);\n m_FontDescriptionCache[pair(sFamily, sVariant)] =\n pDescription;\n } else {\n pDescription = it->second;\n }\n return pango_font_description_copy(pDescription);\n}\n\nvoid GLibLogFunc(const gchar *log_domain, GLogLevelFlags log_level, \n const gchar *message, gpointer unused_data)\n{\n#ifndef WIN32\n string s = \"Pango \";\n if (log_level & G_LOG_LEVEL_ERROR) {\n s += \"error: \";\n } else if (log_level & G_LOG_LEVEL_CRITICAL) {\n s += string(\"critical: \")+message;\n AVG_TRACE(Logger::ERROR, s);\n assert(false);\n } else if (log_level & G_LOG_LEVEL_WARNING) {\n s += \"warning: \";\n } else if (log_level & G_LOG_LEVEL_MESSAGE) {\n s += \"message: \";\n } else if (log_level & G_LOG_LEVEL_INFO) {\n s += \"info: \";\n } else if (log_level & G_LOG_LEVEL_DEBUG) {\n s += \"debug: \";\n }\n s += message;\n AVG_TRACE(Logger::WARNING, s);\n#endif\n}\n\nvoid TextEngine::initFonts()\n{\n g_type_init();\n std::string sFontConfPath = \"\/etc\/fonts\/fonts.conf\"; \n if (!fileExists(sFontConfPath)) {\n sFontConfPath = getAvgLibPath()+\"etc\/fonts\/fonts.conf\";\n }\n FcConfig * pConfig = FcConfigCreate();\n int Ok = (int)FcConfigParseAndLoad(pConfig, \n (const FcChar8 *)(sFontConfPath.c_str()), true);\n checkFontError(Ok, string(\"Font error: could not load config file \")+sFontConfPath);\n Ok = (int)FcConfigBuildFonts(pConfig);\n checkFontError(Ok, string(\"Font error: FcConfigBuildFonts failed.\"));\n Ok = (int)FcConfigSetCurrent(pConfig);\n checkFontError(Ok, string(\"Font error: FcConfigSetCurrent failed.\"));\n for(std::vector::const_iterator it = m_sFontDirs.begin();\n it != m_sFontDirs.end(); ++it) {\n Ok = (int)FcConfigAppFontAddDir(pConfig, (const FcChar8 *)it->c_str());\n checkFontError(Ok, string(\"Font error: FcConfigAppFontAddDir(\"\n + *it + \") failed.\"));\n }\n \/*\n FcStrList * pCacheDirs = FcConfigGetCacheDirs(pConfig);\n FcChar8 * pDir;\n do {\n pDir = FcStrListNext(pCacheDirs);\n if (pDir) {\n cerr << pDir << endl;\n }\n } while (pDir);\n *\/\n g_log_set_default_handler(GLibLogFunc, 0);\n}\n\nPangoFontFamily * TextEngine::getFontFamily(const string& sFamily)\n{\n PangoFontFamily * pFamily = 0;\n assert(m_NumFontFamilies != 0);\n for (int i=0; iFixed windows unresolved external.\/\/\n\/\/ libavg - Media Playback Engine. \n\/\/ Copyright (C) 2003-2008 Ulrich von Zadow\n\/\/\n\/\/ This library is free software; you can redistribute it and\/or\n\/\/ modify it under the terms of the GNU Lesser General Public\n\/\/ License as published by the Free Software Foundation; either\n\/\/ version 2 of the License, or (at your option) any later version.\n\/\/\n\/\/ This library is distributed in the hope that it will be useful,\n\/\/ but WITHOUT ANY WARRANTY; without even the implied warranty of\n\/\/ MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU\n\/\/ Lesser General Public License for more details.\n\/\/\n\/\/ You should have received a copy of the GNU Lesser General Public\n\/\/ License along with this library; if not, write to the Free Software\n\/\/ Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA\n\/\/\n\/\/ Current versions can be found at www.libavg.de\n\/\/\n\n#include \"TextEngine.h\"\n\n#include \"..\/base\/Logger.h\"\n#include \"..\/base\/OSHelper.h\"\n#include \"..\/base\/Exception.h\"\n#include \"..\/base\/FileHelper.h\"\n#include \"..\/base\/StringHelper.h\"\n\n#include \n#include \n\nnamespace avg {\n\nusing namespace std;\n\nstatic void\ntext_subst_func_hint(FcPattern *pattern, gpointer data)\n{\n FcPatternAddBool(pattern, FC_HINTING, true);\n FcPatternAddInteger(pattern, FC_HINT_STYLE, FC_HINT_MEDIUM);\n FcPatternAddInteger(pattern, FC_RGBA, FC_RGBA_NONE);\n FcPatternAddBool(pattern, FC_ANTIALIAS, true);\n}\n\nstatic void\ntext_subst_func_nohint(FcPattern *pattern, gpointer data)\n{\n FcPatternAddBool(pattern, FC_HINTING, false);\n FcPatternAddBool(pattern, FC_AUTOHINT, false);\n FcPatternAddInteger(pattern, FC_HINT_STYLE, FC_HINT_NONE);\n FcPatternAddInteger(pattern, FC_RGBA, FC_RGBA_NONE);\n FcPatternAddBool(pattern, FC_ANTIALIAS, true);\n}\n\nTextEngine& TextEngine::get(bool bHint) \n{\n if (bHint) {\n static TextEngine s_Instance(true);\n return s_Instance;\n } else {\n static TextEngine s_Instance(false);\n return s_Instance;\n }\n}\n\n\nTextEngine::TextEngine(bool bHint)\n : m_bHint(bHint)\n{\n m_sFontDirs.push_back(\"fonts\/\");\n init();\n}\n\nTextEngine::~TextEngine()\n{\n deinit();\n}\n\nvoid TextEngine::init()\n{\n g_type_init();\n m_pFontMap = PANGO_FT2_FONT_MAP(pango_ft2_font_map_new());\n pango_ft2_font_map_set_resolution(m_pFontMap, 72, 72);\n if (m_bHint) {\n pango_ft2_font_map_set_default_substitute(m_pFontMap, text_subst_func_hint, \n 0, 0);\n } else {\n pango_ft2_font_map_set_default_substitute(m_pFontMap, text_subst_func_nohint, \n 0, 0);\n }\n m_pPangoContext = pango_ft2_font_map_create_context(m_pFontMap);\n\n pango_context_set_language(m_pPangoContext,\n pango_language_from_string (\"en_US\"));\n pango_context_set_base_dir(m_pPangoContext, PANGO_DIRECTION_LTR);\n\n initFonts();\n\n string sOldLang = \"\";\n getEnv(\"LC_CTYPE\", sOldLang);\n setEnv(\"LC_CTYPE\", \"en-us\");\n pango_font_map_list_families(PANGO_FONT_MAP(m_pFontMap), &m_ppFontFamilies, \n &m_NumFontFamilies);\n setEnv(\"LC_CTYPE\", sOldLang);\n for (int i=0; i& TextEngine::getFontFamilies()\n{\n return m_sFonts;\n}\n\nconst vector& TextEngine::getFontVariants(const string& sFontName)\n{\n PangoFontFamily * pCurFamily = getFontFamily(sFontName);\n PangoFontFace ** ppFaces;\n int numFaces;\n pango_font_family_list_faces (pCurFamily, &ppFaces, &numFaces);\n static vector sVariants;\n for (int i=0; i(sFamily, sVariant));\n if (it == m_FontDescriptionCache.end()) {\n PangoFontFamily * pFamily;\n bool bFamilyFound = true;\n try {\n pFamily = getFontFamily(sFamily);\n } catch (Exception&) {\n if (m_sFontsNotFound.find(sFamily) == m_sFontsNotFound.end()) {\n AVG_TRACE(Logger::WARNING, \"Could not find font face \" << sFamily << \n \". Using sans instead.\");\n m_sFontsNotFound.insert(sFamily);\n }\n bFamilyFound = false;\n pFamily = getFontFamily(\"sans\");\n }\n PangoFontFace ** ppFaces;\n int numFaces;\n pango_font_family_list_faces(pFamily, &ppFaces, &numFaces);\n PangoFontFace * pFace = 0;\n if (sVariant == \"\") {\n pFace = ppFaces[0];\n } else {\n for (int i=0; i variant(sFamily, sVariant);\n if (m_VariantsNotFound.find(variant) == m_VariantsNotFound.end()) {\n m_VariantsNotFound.insert(variant);\n AVG_TRACE(Logger::WARNING, \"Could not find font variant \" \n << sFamily << \":\" << sVariant << \". Using \" <<\n pango_font_face_get_face_name(pFace) << \" instead.\");\n }\n }\n }\n g_free(ppFaces);\n pDescription = pango_font_face_describe(pFace);\n m_FontDescriptionCache[pair(sFamily, sVariant)] =\n pDescription;\n } else {\n pDescription = it->second;\n }\n return pango_font_description_copy(pDescription);\n}\n\nvoid GLibLogFunc(const gchar *log_domain, GLogLevelFlags log_level, \n const gchar *message, gpointer unused_data)\n{\n#ifndef WIN32\n string s = \"Pango \";\n if (log_level & G_LOG_LEVEL_ERROR) {\n s += \"error: \";\n } else if (log_level & G_LOG_LEVEL_CRITICAL) {\n s += string(\"critical: \")+message;\n AVG_TRACE(Logger::ERROR, s);\n assert(false);\n } else if (log_level & G_LOG_LEVEL_WARNING) {\n s += \"warning: \";\n } else if (log_level & G_LOG_LEVEL_MESSAGE) {\n s += \"message: \";\n } else if (log_level & G_LOG_LEVEL_INFO) {\n s += \"info: \";\n } else if (log_level & G_LOG_LEVEL_DEBUG) {\n s += \"debug: \";\n }\n s += message;\n AVG_TRACE(Logger::WARNING, s);\n#endif\n}\n\nvoid TextEngine::initFonts()\n{\n g_type_init();\n std::string sFontConfPath = \"\/etc\/fonts\/fonts.conf\"; \n if (!fileExists(sFontConfPath)) {\n sFontConfPath = getAvgLibPath()+\"etc\/fonts\/fonts.conf\";\n }\n FcConfig * pConfig = FcConfigCreate();\n int Ok = (int)FcConfigParseAndLoad(pConfig, \n (const FcChar8 *)(sFontConfPath.c_str()), true);\n checkFontError(Ok, string(\"Font error: could not load config file \")+sFontConfPath);\n Ok = (int)FcConfigBuildFonts(pConfig);\n checkFontError(Ok, string(\"Font error: FcConfigBuildFonts failed.\"));\n Ok = (int)FcConfigSetCurrent(pConfig);\n checkFontError(Ok, string(\"Font error: FcConfigSetCurrent failed.\"));\n for(std::vector::const_iterator it = m_sFontDirs.begin();\n it != m_sFontDirs.end(); ++it) {\n Ok = (int)FcConfigAppFontAddDir(pConfig, (const FcChar8 *)it->c_str());\n checkFontError(Ok, string(\"Font error: FcConfigAppFontAddDir(\"\n + *it + \") failed.\"));\n }\n \/*\n FcStrList * pCacheDirs = FcConfigGetCacheDirs(pConfig);\n FcChar8 * pDir;\n do {\n pDir = FcStrListNext(pCacheDirs);\n if (pDir) {\n cerr << pDir << endl;\n }\n } while (pDir);\n *\/\n g_log_set_default_handler(GLibLogFunc, 0);\n}\n\nPangoFontFamily * TextEngine::getFontFamily(const string& sFamily)\n{\n PangoFontFamily * pFamily = 0;\n assert(m_NumFontFamilies != 0);\n for (int i=0; i"} {"text":"\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\n\/\/ The MIT License (MIT)\n\/\/\n\/\/ Copyright (c) 2014 stevehalliwell\n\/\/\n\/\/ Permission is hereby granted, free of charge, to any person obtaining a copy\n\/\/ of this software and associated documentation files (the \"Software\"), to deal\n\/\/ in the Software without restriction, including without limitation the rights\n\/\/ to use, copy, modify, merge, publish, distribute, sublicense, and\/or sell\n\/\/ copies of the Software, and to permit persons to whom the Software is\n\/\/ furnished to do so, subject to the following conditions:\n\/\/\n\/\/ The above copyright notice and this permission notice shall be included in all\n\/\/ copies or substantial portions of the Software.\n\/\/\n\/\/ THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\n\/\/ IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\n\/\/ FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE\n\/\/ AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\n\/\/ LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,\n\/\/ OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE\n\/\/ SOFTWARE.\n\/\/\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n#include \n#include \n#include \n#include \nnamespace rm\n{\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\/ Initialise static members\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nResourceLookup ResourceManager::resources = {};\nResourceLookup ResourceManager::errorResources = {};\nResourceQueue ResourceManager::loadingQueue = {};\nResourceQueue ResourceManager::unloadQueue = {};\nResourceQueue ResourceManager::reloadQueue = {};\nbool ResourceManager::useNullForErrorRes = true;\n\nLoadCompleteCallback ResourceManager::loadCompleteCallback = nullptr;\n\n\n\nenum class LoadMode\n{\n Queue,\n Block,\n};\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\/ Function definitions\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n\n\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\/ \\brief ResourceManager loads this single resource and \n\/\/\/ assigns the mode for the queue.\n\/\/\/\n\/\/\/ \\param name Either a path to where the resource is located or \n\/\/\/ the resource's alias\n\/\/\/\n\/\/\/ \\param mode If the resource hasn't been loaded yet, mode determines\n\/\/\/ whether it should queue it for loading or load it immediately\n\/\/\/\n\/\/\/ \\returns A shared_ptr to the resource, upcasted to type T\n\/\/\/\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nstd::shared_ptr ResourceManager::loadResource(const std::string& name, LoadMode mode)\n{\n \/\/ Checking if resource exists in resources\n if (resources.find(name) != resources.end())\n {\n \/\/ Assigns a new pointer to the key for the resource \n ResourcePtr pointer = resources.find(name)->second;\n\n \/\/ Checking if the resource is not loaded\n if (pointer->isLoaded == false)\n {\n \/\/ If the resource has to be loaded immediately\n if (mode == LoadMode::Block)\n {\n \/\/ Change the status of the BaseResource \n pointer->setIsLoaded(true);\n \/\/ Unload the BaseResource\n pointer->load;\n }\n else\n {\n \/\/ Change the status of the BaseResource \n pointer->setIsLoaded(true);\n \/\/ Send to unloadQueue list\n loadingQueue.push(pointer);\n }\n }\n return;\n }\n\n\n throw(\"Not implemented\");\n\n return;\n}\n\n\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\/ \\brief ResourceManager unloads this single resource and \n\/\/\/ assigns the mode for the queue.\n\/\/\/\n\/\/\/ \\param name The resource's alias\n\/\/\/\n\/\/\/ \\param mode If the resource hasn't been unloaded yet, mode determines\n\/\/\/ whether it should queue it for unloading or unload it immediately\n\/\/\/\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nvoid ResourceManager::unloadResource(const std::string& name, LoadMode mode)\n{\n \/\/ Setting a new Resource pointer to append to &name if found\n ResourcePtr pointer;\n\n \/\/ Checking if resource exists in resources\n if (resources.find(name) != resources.end())\n {\n \/\/ Assigns a new pointer to the key for the resource \n pointer = resources.find(name)->second;\n\n \/\/ If the resource has to be removed immediately\n if(mode == LoadMode::Block)\n {\n \/\/ Change the status of the BaseResource \n pointer->setIsLoaded(false);\n \/\/ Unload the BaseResource\n pointer->unload;\n }\n else\n {\n \/\/ Change the status of the BaseResource \n pointer->setIsLoaded(false);\n \/\/ Send to unloadQueue list\n unloadQueue.push(pointer);\n }\n return;\n }\n \n \n throw(\"Not implemented\");\n \n return;\n \n}\n\nvoid ResourceManager::reloadResource(const std::string& name)\n{\n throw(\"Not implemented\");\n \/\/ Must appropriately set isLoaded in resource\n}\n\nvoid ResourceManager::initResource(const std::string& path)\n{\n\t\/\/How do you check if a string is a valid file path? Does this even need to be checked?\n\t\/*\n\tif(path is not a valid filepath)\n\t{\n\t\treturn error?\n\t}\n\t*\/\n\t\n\tbool exists = false;\n\t\n\t\/\/Check if resource with file path already exists.\n\tfor(ResourceLookup::iterator iter = resources.begin(); iter != resources.end(); iter++)\n\t{\n\t\tif(resources[iter].second->getFilePath() == path)\n\t\t{\n\t\t\texists = true;\n\t\t}\n\t}\n\t\n\t\/\/If it does not already exist then create and add to resources.\n\tif(!exists)\n\t{\n\t\tResourcePtr res = ResourceFactory::createResource(path, \/*type?*\/);\n\t\tresources.insert({path, res});\n\t\t\n\t\t\/\/return success?\n\t}\n\telse\n\t{\n\t\t\/\/return error (already exists)?\n\t}\n}\n\nvoid ResourceManager::initPack(const std::string& path)\n{\n \/\/How do you check if a string is a valid file path? Does this even need to be checked?\n\t\/*\n\tif(path is not a valid filepath)\n\t{\n\t\treturn error?\n\t}\n\t*\/\n\t\n\t\/\/Get a list of data from the resource pack lua table\n\tResourceDataList list = LuaParser::parsePack(path);\n\t\n\t\/\/iterate through the list and create a new resource if one does not already exist.\t\n\tfor(ResourceDataList::iterator iter = list.begin(); iter != list.end(); iter++)\n\t{\n\t\t\/\/is this supposed to call initResource()? It seems like initResource() will not set an alias as it only takes a path, whereas this function can set the alias and type returned from the luaparser.\n\t\t\/\/initResource(list[iter].path);\n\t\t\n\t\t\/\/If it does not call initResource()\n\t\tbool exists = false;\n\t\tfor(ResourceLookup::iterator iter2 = resources.begin(); iter2 != resources.end(); iter2++)\n\t\t{\n\t\t\tif(resources[iter2].second->getFilePath() == path)\n\t\t\t{\n\t\t\t\texists = true;\n\t\t\t}\n\t\t}\n\t\t\n\t\tif(!exists)\n\t\t{\n\t\t\tResourcePtr res = ResourceFactory::createResource(list[iter]->path, list[iter]->type);\n\t\t\tres->setAlias(list[iter]->alias);\n\t\t\tresources.insert({list[iter]->alias, res});\n\t\t\t\n\t\t\t\/\/return success?\n\t\t}\n\t\telse\n\t\t{\n\t\t\t\/\/return error (already exists)?\n\t\t}\n\t}\n}\n\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\/ \\brief ResourceManager will load this Pack of resources \n\/\/\/ assigning each resource a mode for the queue.\n\/\/\/\n\/\/\/ \\param path The resource packs's path\n\/\/\/\n\/\/\/ \\param mode Determines the load mode for each resource\n\/\/\/\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nvoid ResourceManager::loadPack(const std::string& path, LoadMode mode)\n{\n throw(\"Not implemented\");\n\n}\n\nvoid ResourceManager::unloadPack(const std::string& path, LoadMode mode)\n{\n throw(\"Not implemented\");\n\n}\n\nvoid ResourceManager::reloadPack(const std::string& path)\n{\n throw(\"Not implemented\");\n\n}\n\nvoid ResourceManager::switchPack(const std::string& fromPath, const std::string& toPath)\n{\n throw(\"Not implemented\");\n\n}\n\nvoid ResourceManager::init(bool _useNullForErrorRes)\n{\n useNullForErrorRes = _useNullForErrorRes;\n\n if(!useNullForErrorRes)\n {\n \/\/ Init default resources\n \/\/ but we don't have any yet\n }\n}\n\nvoid ResourceManager::update()\n{\n loadFromQueue();\n unloadFromQueue();\n reloadFromQueue();\n}\n\nvoid ResourceManager::cleanupUnused()\n{\n for(ResourcePtr r : resources)\n {\n if(r.unique()) \n {\n r->setIsLoaded(false);\n r->unload();\n }\n }\n}\n\n}\n\nbool ResourceManager::isLoading()\n{\n return getNumToLoad() > 0;\n}\n\nsize_t ResourceManager::getNumToLoad()\n{\n return loadingQueue.size();\n}\n\nResourceList ResourceManager::listAll()\n{\n throw(\"Not implemented\");\n return ResourceList();\n}\n\nsize_t ResourceManager::getMemUsage()\n{\n throw(\"Not implemented\");\n\n}\n\nsize_t ResourceManager::getNumResources()\n{\n return resources.size();\n}\n\nvoid ResourceManager::setLoadCompleteCallback(LoadCompleteCallback callback)\n{\n loadCompleteCallback = callback;\n}\n\nvoid ResourceManager::loadFromQueue()\n{\n throw(\"Not implemented\");\n \/\/ Must appropriately set isLoaded in resource\n\n \/\/ bail if queue empty\n \/\/ load\n \/\/ pop\n \/\/ if queue empty call loadCompleteCallback\n}\n\nvoid ResourceManager::unloadFromQueue()\n{\n throw(\"Not implemented\");\n \/\/ Must appropriately set isLoaded in resource\n}\n\nvoid ResourceManager::reloadFromQueue()\n{\n throw(\"Not implemented\");\n \n}\n\n} \/\/ rm\nloadPack completed\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\n\/\/ The MIT License (MIT)\n\/\/\n\/\/ Copyright (c) 2014 stevehalliwell\n\/\/\n\/\/ Permission is hereby granted, free of charge, to any person obtaining a copy\n\/\/ of this software and associated documentation files (the \"Software\"), to deal\n\/\/ in the Software without restriction, including without limitation the rights\n\/\/ to use, copy, modify, merge, publish, distribute, sublicense, and\/or sell\n\/\/ copies of the Software, and to permit persons to whom the Software is\n\/\/ furnished to do so, subject to the following conditions:\n\/\/\n\/\/ The above copyright notice and this permission notice shall be included in all\n\/\/ copies or substantial portions of the Software.\n\/\/\n\/\/ THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\n\/\/ IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\n\/\/ FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE\n\/\/ AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\n\/\/ LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,\n\/\/ OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE\n\/\/ SOFTWARE.\n\/\/\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n#include \n#include \n#include \n#include \nnamespace rm\n{\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\/ Initialise static members\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nResourceLookup ResourceManager::resources = {};\nResourceLookup ResourceManager::errorResources = {};\nResourceQueue ResourceManager::loadingQueue = {};\nResourceQueue ResourceManager::unloadQueue = {};\nResourceQueue ResourceManager::reloadQueue = {};\nbool ResourceManager::useNullForErrorRes = true;\n\nLoadCompleteCallback ResourceManager::loadCompleteCallback = nullptr;\n\n\n\nenum class LoadMode\n{\n Queue,\n Block,\n};\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\/ Function definitions\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n\n\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\/ \\brief ResourceManager loads this single resource and \n\/\/\/ assigns the mode for the queue.\n\/\/\/\n\/\/\/ \\param name Either a path to where the resource is located or \n\/\/\/ the resource's alias\n\/\/\/\n\/\/\/ \\param mode If the resource hasn't been loaded yet, mode determines\n\/\/\/ whether it should queue it for loading or load it immediately\n\/\/\/\n\/\/\/ \\returns A shared_ptr to the resource, upcasted to type T\n\/\/\/\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nstd::shared_ptr ResourceManager::loadResource(const std::string& name, LoadMode mode)\n{\n \/\/ Checking if resource exists in resources\n if (resources.find(name) != resources.end())\n {\n \/\/ Assigns a new pointer to the key for the resource \n ResourcePtr pointer = resources.find(name)->second;\n\n \/\/ Checking if the resource is not loaded\n if (pointer->isLoaded == false)\n {\n \/\/ If the resource has to be loaded immediately\n if (mode == LoadMode::Block)\n {\n \/\/ Change the status of the BaseResource \n pointer->setIsLoaded(true);\n \/\/ Unload the BaseResource\n pointer->load;\n }\n else\n {\n \/\/ Change the status of the BaseResource \n pointer->setIsLoaded(true);\n \/\/ Send to unloadQueue list\n loadingQueue.push(pointer);\n }\n }\n return;\n }\n\n\n throw(\"Not implemented\");\n\n return;\n}\n\n\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\/ \\brief ResourceManager unloads this single resource and \n\/\/\/ assigns the mode for the queue.\n\/\/\/\n\/\/\/ \\param name The resource's alias\n\/\/\/\n\/\/\/ \\param mode If the resource hasn't been unloaded yet, mode determines\n\/\/\/ whether it should queue it for unloading or unload it immediately\n\/\/\/\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nvoid ResourceManager::unloadResource(const std::string& name, LoadMode mode)\n{\n \/\/ Setting a new Resource pointer to append to &name if found\n ResourcePtr pointer;\n\n \/\/ Checking if resource exists in resources\n if (resources.find(name) != resources.end())\n {\n \/\/ Assigns a new pointer to the key for the resource \n pointer = resources.find(name)->second;\n\n \/\/ If the resource has to be removed immediately\n if(mode == LoadMode::Block)\n {\n \/\/ Change the status of the BaseResource \n pointer->setIsLoaded(false);\n \/\/ Unload the BaseResource\n pointer->unload;\n }\n else\n {\n \/\/ Change the status of the BaseResource \n pointer->setIsLoaded(false);\n \/\/ Send to unloadQueue list\n unloadQueue.push(pointer);\n }\n return;\n }\n \n \n throw(\"Not implemented\");\n \n return;\n \n}\n\nvoid ResourceManager::reloadResource(const std::string& name)\n{\n throw(\"Not implemented\");\n \/\/ Must appropriately set isLoaded in resource\n}\n\nvoid ResourceManager::initResource(const std::string& path)\n{\n\t\/\/How do you check if a string is a valid file path? Does this even need to be checked?\n\t\/*\n\tif(path is not a valid filepath)\n\t{\n\t\treturn error?\n\t}\n\t*\/\n\t\n\tbool exists = false;\n\t\n\t\/\/Check if resource with file path already exists.\n\tfor(ResourceLookup::iterator iter = resources.begin(); iter != resources.end(); iter++)\n\t{\n\t\tif(resources[iter].second->getFilePath() == path)\n\t\t{\n\t\t\texists = true;\n\t\t}\n\t}\n\t\n\t\/\/If it does not already exist then create and add to resources.\n\tif(!exists)\n\t{\n\t\tResourcePtr res = ResourceFactory::createResource(path, \/*type?*\/);\n\t\tresources.insert({path, res});\n\t\t\n\t\t\/\/return success?\n\t}\n\telse\n\t{\n\t\t\/\/return error (already exists)?\n\t}\n}\n\nvoid ResourceManager::initPack(const std::string& path)\n{\n \/\/How do you check if a string is a valid file path? Does this even need to be checked?\n\t\/*\n\tif(path is not a valid filepath)\n\t{\n\t\treturn error?\n\t}\n\t*\/\n\t\n\t\/\/Get a list of data from the resource pack lua table\n\tResourceDataList list = LuaParser::parsePack(path);\n\t\n\t\/\/iterate through the list and create a new resource if one does not already exist.\t\n\tfor(ResourceDataList::iterator iter = list.begin(); iter != list.end(); iter++)\n\t{\n\t\t\/\/is this supposed to call initResource()? It seems like initResource() will not set an alias as it only takes a path, whereas this function can set the alias and type returned from the luaparser.\n\t\t\/\/initResource(list[iter].path);\n\t\t\n\t\t\/\/If it does not call initResource()\n\t\tbool exists = false;\n\t\tfor(ResourceLookup::iterator iter2 = resources.begin(); iter2 != resources.end(); iter2++)\n\t\t{\n\t\t\tif(resources[iter2].second->getFilePath() == path)\n\t\t\t{\n\t\t\t\texists = true;\n\t\t\t}\n\t\t}\n\t\t\n\t\tif(!exists)\n\t\t{\n\t\t\tResourcePtr res = ResourceFactory::createResource(list[iter]->path, list[iter]->type);\n\t\t\tres->setAlias(list[iter]->alias);\n\t\t\tresources.insert({list[iter]->alias, res});\n\t\t\t\n\t\t\t\/\/return success?\n\t\t}\n\t\telse\n\t\t{\n\t\t\t\/\/return error (already exists)?\n\t\t}\n\t}\n}\n\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\/ \\brief ResourceManager will load this Pack of resources \n\/\/\/ assigning each resource a mode for the queue.\n\/\/\/\n\/\/\/ \\param path The resource packs's path\n\/\/\/\n\/\/\/ \\param mode Determines the load mode for each resource\n\/\/\/\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nvoid ResourceManager::loadPack(const std::string& path, LoadMode mode)\n{\n \/\/ Create a list from the parsePack\n ResourceDataList list = LuaParser::parsePack(path);\n\n \/\/ Iterate through the list\n for (ResourceDataList::iterator var = list.begin; var != list.end; ++var)\n {\n \/\/ Assign the alias to a throw-away string\n std::string name = var->alias;\n\n \/\/ Checking if resource exists in resources\n if (resources.find(name) != resources.end())\n {\n \/\/ Assigns a new pointer to the key for the resource \n ResourcePtr pointer = resources.find(name)->second;\n\n \/\/ Checking if the resource is not loaded\n if (pointer->isLoaded == false)\n {\n \/\/ If the resource has to be loaded immediately\n if (mode == LoadMode::Block)\n {\n \/\/ Change the status of the BaseResource \n pointer->setIsLoaded(true);\n \/\/ Unload the BaseResource\n pointer->load;\n }\n else\n {\n \/\/ Change the status of the BaseResource \n pointer->setIsLoaded(true);\n \/\/ Send to unloadQueue list\n loadingQueue.push(pointer);\n }\n }\n }\n \n }\n\n throw(\"Not implemented\");\n return;\n}\n\nvoid ResourceManager::unloadPack(const std::string& path, LoadMode mode)\n{\n throw(\"Not implemented\");\n\n}\n\nvoid ResourceManager::reloadPack(const std::string& path)\n{\n throw(\"Not implemented\");\n\n}\n\nvoid ResourceManager::switchPack(const std::string& fromPath, const std::string& toPath)\n{\n throw(\"Not implemented\");\n\n}\n\nvoid ResourceManager::init(bool _useNullForErrorRes)\n{\n useNullForErrorRes = _useNullForErrorRes;\n\n if(!useNullForErrorRes)\n {\n \/\/ Init default resources\n \/\/ but we don't have any yet\n }\n}\n\nvoid ResourceManager::update()\n{\n loadFromQueue();\n unloadFromQueue();\n reloadFromQueue();\n}\n\nvoid ResourceManager::cleanupUnused()\n{\n for(ResourcePtr r : resources)\n {\n if(r.unique()) \n {\n r->setIsLoaded(false);\n r->unload();\n }\n }\n}\n\n}\n\nbool ResourceManager::isLoading()\n{\n return getNumToLoad() > 0;\n}\n\nsize_t ResourceManager::getNumToLoad()\n{\n return loadingQueue.size();\n}\n\nResourceList ResourceManager::listAll()\n{\n throw(\"Not implemented\");\n return ResourceList();\n}\n\nsize_t ResourceManager::getMemUsage()\n{\n throw(\"Not implemented\");\n\n}\n\nsize_t ResourceManager::getNumResources()\n{\n return resources.size();\n}\n\nvoid ResourceManager::setLoadCompleteCallback(LoadCompleteCallback callback)\n{\n loadCompleteCallback = callback;\n}\n\nvoid ResourceManager::loadFromQueue()\n{\n throw(\"Not implemented\");\n \/\/ Must appropriately set isLoaded in resource\n\n \/\/ bail if queue empty\n \/\/ load\n \/\/ pop\n \/\/ if queue empty call loadCompleteCallback\n}\n\nvoid ResourceManager::unloadFromQueue()\n{\n\n \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n \/\/ I thought Steve said that we could not remove anything from the queue..\n \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n\n throw(\"Not implemented\");\n \/\/ Must appropriately set isLoaded in resource\n}\n\nvoid ResourceManager::reloadFromQueue()\n{\n throw(\"Not implemented\");\n \n}\n\n} \/\/ rm\n<|endoftext|>"} {"text":"\/\/ Copyright (c) 2015-2018 The Gulden developers\n\/\/ Authored by: Malcolm MacLeod (mmacleod@webmail.co.za)\n\/\/ Distributed under the GULDEN software license, see the accompanying\n\/\/ file COPYING\n\n#include \"clientversion.h\"\n#include \"ticker.h\"\n#include \"utilmoneystr.h\"\n#include \"arith_uint256.h\"\n#include \"units.h\"\n\n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n\n\n#include \n#include \n#include \n\n#include \n\nCurrencyTableModel::CurrencyTableModel(QObject *parent, CurrencyTicker* ticker)\n: QAbstractTableModel( parent )\n, m_ticker( ticker )\n, m_currenciesMap( NULL )\n{\n}\n\nint CurrencyTableModel::rowCount(const QModelIndex& parent) const\n{\n if (m_currenciesMap)\n return m_currenciesMap->size();\n\n return 0;\n}\n\nint CurrencyTableModel::columnCount(const QModelIndex & parent) const\n{\n return 3;\n}\n\nQVariant CurrencyTableModel::data(const QModelIndex& index, int role) const\n{\n if (!m_currenciesMap)\n return QVariant();\n\n if (index.row() < 0 || index.row() >= (int)m_currenciesMap->size() || role != Qt::DisplayRole)\n {\n return QVariant();\n }\n\n auto iter = m_currenciesMap->begin();\n std::advance(iter, index.row());\n\n if (index.column() == 0)\n {\n return QString::fromStdString(iter->first);\n }\n if (index.column() == 1)\n {\n return QString(\"ratebalance\");\n }\n if (index.column() == 2)\n {\n CAmount temp;\n ParseMoney(iter->second,temp);\n \/\/fixme: (2.1) Truncates - we should instead round here...\n QString rate = GuldenUnits::format(GuldenUnits::NLG, temp, false, GuldenUnits::separatorAlways, 4);\n QString balance = GuldenUnits::format(GuldenUnits::NLG, m_ticker->convertGuldenToForex(m_balanceNLG, iter->first), false, GuldenUnits::separatorAlways, 2);\n return rate + QString(\"\") + balance;\n }\n\n return QVariant();\n}\n\n\nvoid CurrencyTableModel::setBalance(CAmount balanceNLG)\n{\n m_balanceNLG = balanceNLG;\n}\n\nvoid CurrencyTableModel::balanceChanged(const CAmount& availableBalance, const CAmount& unconfirmedBalance, const CAmount& immatureBalance, const CAmount& watchOnlyBalance, const CAmount& watchUnconfBalance, const CAmount& watchImmatureBalance, const CAmount& lockedBalance)\n{\n setBalance(availableBalance + unconfirmedBalance + immatureBalance);\n \/\/fixme: (2.1) Only emit if data actually changes.\n Q_EMIT dataChanged(index(0, 0, QModelIndex()), index(rowCount()-1, columnCount()-1, QModelIndex()));\n}\n\nCurrencyTicker::CurrencyTicker( QObject* parent )\n: count(0)\n{\n netManager = new QNetworkAccessManager( this );\n netManager->setObjectName(\"currency_ticker_net_manager\");\n\n connect( netManager, SIGNAL( finished( QNetworkReply* ) ), this, SLOT( netRequestFinished( QNetworkReply* ) ) );\n connect( netManager, SIGNAL( sslErrors( QNetworkReply*, const QList& ) ), this, SLOT( reportSslErrors( QNetworkReply*, const QList& ) ) );\n}\n\nCurrencyTicker::~CurrencyTicker()\n{\n disconnect( netManager, SIGNAL( finished( QNetworkReply* ) ), this, SLOT( netRequestFinished( QNetworkReply* ) ) );\n disconnect( netManager, SIGNAL( sslErrors( QNetworkReply*, const QList& ) ), this, SLOT( reportSslErrors( QNetworkReply*, const QList& ) ) );\n}\n\nCAmount CurrencyTicker::convertGuldenToForex(CAmount guldenAmount, std::string forexCurrencyCode)\n{\n if (m_ExchangeRates.find(forexCurrencyCode) != m_ExchangeRates.end())\n {\n CAmount exchangeRate;\n if ( ParseMoney(m_ExchangeRates[forexCurrencyCode], exchangeRate) )\n {\n arith_uint256 forexAmountBN = guldenAmount;\n forexAmountBN *= exchangeRate;\n forexAmountBN \/= COIN;\n return forexAmountBN.GetLow64();\n }\n }\n return CAmount(0);\n}\n\n\nCAmount CurrencyTicker::convertForexToGulden(CAmount forexAmount, std::string forexCurrencyCode)\n{\n if (m_ExchangeRates.find(forexCurrencyCode) != m_ExchangeRates.end())\n {\n CAmount exchangeRate;\n if ( ParseMoney(m_ExchangeRates[forexCurrencyCode], exchangeRate) )\n {\n arith_uint256 forexAmountBN = forexAmount;\n forexAmountBN *= COIN;\n forexAmountBN \/= exchangeRate;\n return forexAmountBN.GetLow64();\n }\n }\n return CAmount(0);\n}\n\nCurrencyTableModel* CurrencyTicker::GetCurrencyTableModel()\n{\n CurrencyTableModel* model = new CurrencyTableModel(this, this);\n model->setObjectName(\"ticker_currency_table_model\");\n model->setMap(&m_ExchangeRates);\n model->setBalance(CAmount(0));\n return model;\n}\n\nvoid CurrencyTicker::pollTicker()\n{\n QNetworkRequest netRequest;\n netRequest.setUrl( QString::fromStdString( \"https:\/\/api.gulden.com\/api\/v1\/ticker\" ) );\n netRequest.setRawHeader( \"User-Agent\", QByteArray(UserAgent().c_str()));\n netRequest.setRawHeader( \"Accept\", \"application\/json\" );\n\n QSslConfiguration config( QSslConfiguration::defaultConfiguration() );\n netRequest.setSslConfiguration( config );\n\n netManager->get( netRequest );\n}\n\nvoid CurrencyTicker::netRequestFinished( QNetworkReply* reply )\n{\n bool signalUpdates = false;\n\n if ( reply->error() != QNetworkReply::NetworkError::NoError )\n {\n \/\/fixme: (2.1) Error handling code here.\n \/\/Note - it is possible the ticker has temporary outages etc. and these are not a major issue\n \/\/We update every ~10s but if we miss a few updates it has no ill-effects\n \/\/So if we do anything here, it should only be after multiple failiures...\n }\n else\n {\n int statusCode = reply->attribute( QNetworkRequest::HttpStatusCodeAttribute ).toInt();\n\n if ( statusCode != 200 )\n {\n \/\/fixme: (2.1) Error handling code here.\n \/\/Note - it is possible the ticker has temporary outages etc. and these are not a major issue\n \/\/We update every ~10s but if we miss a few updates it has no ill-effects\n \/\/So if we do anything here, it should only be after multiple failiures...\n }\n else\n {\n QByteArray jsonReply = reply->readAll();\n QString temp = QString::fromStdString( jsonReply.data() );\n QJsonDocument jsonDoc = QJsonDocument::fromJson( jsonReply );\n QJsonArray jsonArray = jsonDoc.object().value( \"data\" ).toArray();\n\n for ( auto jsonVal : jsonArray )\n {\n QJsonObject jsonObject = jsonVal.toObject();\n std::string currencyName = jsonObject.value( \"name\" ).toString().toStdString();\n std::string currencyCode = jsonObject.value( \"code\" ).toString().toStdString();\n \/\/NB! Possible precision loss here - but in this case it is probably acceptible.\n std::string currencyRate;\n std::ostringstream bufstream;\n bufstream << std::fixed << std::setprecision(8) << jsonObject.value( \"rate\" ).toDouble();\n currencyRate = bufstream.str();\n\n m_ExchangeRates[currencyCode] = currencyRate;\n signalUpdates = true;\n }\n }\n }\n\n if ( signalUpdates )\n {\n Q_EMIT exchangeRatesUpdated();\n if(++count % 20 == 0)\n {\n Q_EMIT exchangeRatesUpdatedLongPoll();\n }\n }\n\n \/\/ Call again every ~10 seconds\n QTimer::singleShot( 10000, this, SLOT(pollTicker()) );\n}\n\nvoid CurrencyTicker::reportSslErrors( QNetworkReply* reply, const QList& errorList )\n{\n \/\/fixme: (2.1) In future (I guess) we should signal in UI somehow that ticker is unavailable - need to decide how to do this in a user friendly way.\n \/\/Note - it is possible the ticker has temporary outages - is switching hosts or whatever other minor thing \n \/\/We update every ~10s but if we miss a few updates it has no ill-effects\n \/\/So if we do anything here, it should only be after multiple failiures...\n}\n\n\n\n\n\nFix crash on forex amount entry with invalid exchangerate\/\/ Copyright (c) 2015-2018 The Gulden developers\n\/\/ Authored by: Malcolm MacLeod (mmacleod@webmail.co.za)\n\/\/ Distributed under the GULDEN software license, see the accompanying\n\/\/ file COPYING\n\n#include \"clientversion.h\"\n#include \"ticker.h\"\n#include \"utilmoneystr.h\"\n#include \"arith_uint256.h\"\n#include \"units.h\"\n\n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n\n\n#include \n#include \n#include \n\n#include \n\nCurrencyTableModel::CurrencyTableModel(QObject *parent, CurrencyTicker* ticker)\n: QAbstractTableModel( parent )\n, m_ticker( ticker )\n, m_currenciesMap( NULL )\n{\n}\n\nint CurrencyTableModel::rowCount(const QModelIndex& parent) const\n{\n if (m_currenciesMap)\n return m_currenciesMap->size();\n\n return 0;\n}\n\nint CurrencyTableModel::columnCount(const QModelIndex & parent) const\n{\n return 3;\n}\n\nQVariant CurrencyTableModel::data(const QModelIndex& index, int role) const\n{\n if (!m_currenciesMap)\n return QVariant();\n\n if (index.row() < 0 || index.row() >= (int)m_currenciesMap->size() || role != Qt::DisplayRole)\n {\n return QVariant();\n }\n\n auto iter = m_currenciesMap->begin();\n std::advance(iter, index.row());\n\n if (index.column() == 0)\n {\n return QString::fromStdString(iter->first);\n }\n if (index.column() == 1)\n {\n return QString(\"ratebalance\");\n }\n if (index.column() == 2)\n {\n CAmount temp;\n ParseMoney(iter->second,temp);\n \/\/fixme: (2.1) Truncates - we should instead round here...\n QString rate = GuldenUnits::format(GuldenUnits::NLG, temp, false, GuldenUnits::separatorAlways, 4);\n QString balance = GuldenUnits::format(GuldenUnits::NLG, m_ticker->convertGuldenToForex(m_balanceNLG, iter->first), false, GuldenUnits::separatorAlways, 2);\n return rate + QString(\"\") + balance;\n }\n\n return QVariant();\n}\n\n\nvoid CurrencyTableModel::setBalance(CAmount balanceNLG)\n{\n m_balanceNLG = balanceNLG;\n}\n\nvoid CurrencyTableModel::balanceChanged(const CAmount& availableBalance, const CAmount& unconfirmedBalance, const CAmount& immatureBalance, const CAmount& watchOnlyBalance, const CAmount& watchUnconfBalance, const CAmount& watchImmatureBalance, const CAmount& lockedBalance)\n{\n setBalance(availableBalance + unconfirmedBalance + immatureBalance);\n \/\/fixme: (2.1) Only emit if data actually changes.\n Q_EMIT dataChanged(index(0, 0, QModelIndex()), index(rowCount()-1, columnCount()-1, QModelIndex()));\n}\n\nCurrencyTicker::CurrencyTicker( QObject* parent )\n: count(0)\n{\n netManager = new QNetworkAccessManager( this );\n netManager->setObjectName(\"currency_ticker_net_manager\");\n\n connect( netManager, SIGNAL( finished( QNetworkReply* ) ), this, SLOT( netRequestFinished( QNetworkReply* ) ) );\n connect( netManager, SIGNAL( sslErrors( QNetworkReply*, const QList& ) ), this, SLOT( reportSslErrors( QNetworkReply*, const QList& ) ) );\n}\n\nCurrencyTicker::~CurrencyTicker()\n{\n disconnect( netManager, SIGNAL( finished( QNetworkReply* ) ), this, SLOT( netRequestFinished( QNetworkReply* ) ) );\n disconnect( netManager, SIGNAL( sslErrors( QNetworkReply*, const QList& ) ), this, SLOT( reportSslErrors( QNetworkReply*, const QList& ) ) );\n}\n\nCAmount CurrencyTicker::convertGuldenToForex(CAmount guldenAmount, std::string forexCurrencyCode)\n{\n if (m_ExchangeRates.find(forexCurrencyCode) != m_ExchangeRates.end())\n {\n CAmount exchangeRate;\n if ( ParseMoney(m_ExchangeRates[forexCurrencyCode], exchangeRate) )\n {\n arith_uint256 forexAmountBN = guldenAmount;\n forexAmountBN *= exchangeRate;\n forexAmountBN \/= COIN;\n return forexAmountBN.GetLow64();\n }\n }\n return CAmount(0);\n}\n\n\nCAmount CurrencyTicker::convertForexToGulden(CAmount forexAmount, std::string forexCurrencyCode)\n{\n if (m_ExchangeRates.find(forexCurrencyCode) != m_ExchangeRates.end())\n {\n CAmount exchangeRate;\n if ( ParseMoney(m_ExchangeRates[forexCurrencyCode], exchangeRate) )\n {\n arith_uint256 forexAmountBN = forexAmount;\n forexAmountBN *= COIN;\n if (exchangeRate != 0)\n {\n forexAmountBN \/= exchangeRate;\n return forexAmountBN.GetLow64();\n }\n }\n }\n return CAmount(0);\n}\n\nCurrencyTableModel* CurrencyTicker::GetCurrencyTableModel()\n{\n CurrencyTableModel* model = new CurrencyTableModel(this, this);\n model->setObjectName(\"ticker_currency_table_model\");\n model->setMap(&m_ExchangeRates);\n model->setBalance(CAmount(0));\n return model;\n}\n\nvoid CurrencyTicker::pollTicker()\n{\n QNetworkRequest netRequest;\n netRequest.setUrl( QString::fromStdString( \"https:\/\/api.gulden.com\/api\/v1\/ticker\" ) );\n netRequest.setRawHeader( \"User-Agent\", QByteArray(UserAgent().c_str()));\n netRequest.setRawHeader( \"Accept\", \"application\/json\" );\n\n QSslConfiguration config( QSslConfiguration::defaultConfiguration() );\n netRequest.setSslConfiguration( config );\n\n netManager->get( netRequest );\n}\n\nvoid CurrencyTicker::netRequestFinished( QNetworkReply* reply )\n{\n bool signalUpdates = false;\n\n if ( reply->error() != QNetworkReply::NetworkError::NoError )\n {\n \/\/fixme: (2.1) Error handling code here.\n \/\/Note - it is possible the ticker has temporary outages etc. and these are not a major issue\n \/\/We update every ~10s but if we miss a few updates it has no ill-effects\n \/\/So if we do anything here, it should only be after multiple failiures...\n }\n else\n {\n int statusCode = reply->attribute( QNetworkRequest::HttpStatusCodeAttribute ).toInt();\n\n if ( statusCode != 200 )\n {\n \/\/fixme: (2.1) Error handling code here.\n \/\/Note - it is possible the ticker has temporary outages etc. and these are not a major issue\n \/\/We update every ~10s but if we miss a few updates it has no ill-effects\n \/\/So if we do anything here, it should only be after multiple failiures...\n }\n else\n {\n QByteArray jsonReply = reply->readAll();\n QString temp = QString::fromStdString( jsonReply.data() );\n QJsonDocument jsonDoc = QJsonDocument::fromJson( jsonReply );\n QJsonArray jsonArray = jsonDoc.object().value( \"data\" ).toArray();\n\n for ( auto jsonVal : jsonArray )\n {\n QJsonObject jsonObject = jsonVal.toObject();\n std::string currencyName = jsonObject.value( \"name\" ).toString().toStdString();\n std::string currencyCode = jsonObject.value( \"code\" ).toString().toStdString();\n \/\/NB! Possible precision loss here - but in this case it is probably acceptible.\n std::string currencyRate;\n std::ostringstream bufstream;\n bufstream << std::fixed << std::setprecision(8) << jsonObject.value( \"rate\" ).toDouble();\n currencyRate = bufstream.str();\n\n m_ExchangeRates[currencyCode] = currencyRate;\n signalUpdates = true;\n }\n }\n }\n\n if ( signalUpdates )\n {\n Q_EMIT exchangeRatesUpdated();\n if(++count % 20 == 0)\n {\n Q_EMIT exchangeRatesUpdatedLongPoll();\n }\n }\n\n \/\/ Call again every ~10 seconds\n QTimer::singleShot( 10000, this, SLOT(pollTicker()) );\n}\n\nvoid CurrencyTicker::reportSslErrors( QNetworkReply* reply, const QList& errorList )\n{\n \/\/fixme: (2.1) In future (I guess) we should signal in UI somehow that ticker is unavailable - need to decide how to do this in a user friendly way.\n \/\/Note - it is possible the ticker has temporary outages - is switching hosts or whatever other minor thing \n \/\/We update every ~10s but if we miss a few updates it has no ill-effects\n \/\/So if we do anything here, it should only be after multiple failiures...\n}\n\n\n\n\n\n<|endoftext|>"} {"text":"\/\/ 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 \"sendcoinsentry.h\"\n#include \"ui_sendcoinsentry.h\"\n\n#include \"addressbookpage.h\"\n#include \"addresstablemodel.h\"\n#include \"guiutil.h\"\n#include \"optionsmodel.h\"\n#include \"walletmodel.h\"\n\n#include \n#include \n\nSendCoinsEntry::SendCoinsEntry(QWidget *parent) :\n QStackedWidget(parent),\n ui(new Ui::SendCoinsEntry),\n model(0)\n{\n ui->setupUi(this);\n\n setCurrentWidget(ui->SendCoins);\n\n#ifdef Q_OS_MAC\n ui->payToLayout->setSpacing(4);\n#endif\n#if QT_VERSION >= 0x040700\n ui->addAsLabel->setPlaceholderText(tr(\"Enter a label for this address to add it to your address book\"));\n#endif\n\n \/\/ normal bitcoin address field\n GUIUtil::setupAddressWidget(ui->payTo, this);\n \/\/ just a label for displaying bitcoin address(es)\n ui->payTo_is->setFont(GUIUtil::bitcoinAddressFont());\n}\n\nSendCoinsEntry::~SendCoinsEntry()\n{\n delete ui;\n}\n\nvoid SendCoinsEntry::on_pasteButton_clicked()\n{\n \/\/ Paste text from clipboard into recipient field\n ui->payTo->setText(QApplication::clipboard()->text());\n}\n\nvoid SendCoinsEntry::on_addressBookButton_clicked()\n{\n if(!model)\n return;\n AddressBookPage dlg(AddressBookPage::ForSelection, AddressBookPage::SendingTab, this);\n dlg.setModel(model->getAddressTableModel());\n if(dlg.exec())\n {\n ui->payTo->setText(dlg.getReturnValue());\n ui->payAmount->setFocus();\n }\n}\n\nvoid SendCoinsEntry::on_payTo_textChanged(const QString &address)\n{\n updateLabel(address);\n}\n\nvoid SendCoinsEntry::setModel(WalletModel *model)\n{\n this->model = model;\n\n if (model && model->getOptionsModel())\n connect(model->getOptionsModel(), SIGNAL(displayUnitChanged(int)), this, SLOT(updateDisplayUnit()));\n\n connect(ui->payAmount, SIGNAL(textChanged()), this, SIGNAL(payAmountChanged()));\n connect(ui->deleteButton, SIGNAL(clicked()), this, SLOT(deleteClicked()));\n connect(ui->deleteButton_is, SIGNAL(clicked()), this, SLOT(deleteClicked()));\n connect(ui->deleteButton_s, SIGNAL(clicked()), this, SLOT(deleteClicked()));\n\n clear();\n}\n\nvoid SendCoinsEntry::clear()\n{\n \/\/ clear UI elements for normal payment\n ui->payTo->clear();\n ui->addAsLabel->clear();\n ui->payAmount->clear();\n ui->messageTextLabel->clear();\n ui->messageTextLabel->hide();\n ui->messageLabel->hide();\n \/\/ clear UI elements for insecure payment request\n ui->payTo_is->clear();\n ui->memoTextLabel_is->clear();\n ui->payAmount_is->clear();\n \/\/ clear UI elements for secure payment request\n ui->payTo_s->clear();\n ui->memoTextLabel_s->clear();\n ui->payAmount_s->clear();\n\n \/\/ update the display unit, to not use the default (\"BTC\")\n updateDisplayUnit();\n}\n\nvoid SendCoinsEntry::deleteClicked()\n{\n emit removeEntry(this);\n}\n\nbool SendCoinsEntry::validate()\n{\n if (!model)\n return false;\n\n \/\/ Check input validity\n bool retval = true;\n\n \/\/ Skip checks for payment request\n if (recipient.paymentRequest.IsInitialized())\n return retval;\n\n if (!model->validateAddress(ui->payTo->text()))\n {\n ui->payTo->setValid(false);\n retval = false;\n }\n\n if (!ui->payAmount->validate())\n {\n retval = false;\n }\n\n \/\/ Reject dust outputs:\n if (retval && GUIUtil::isDust(ui->payTo->text(), ui->payAmount->value())) {\n ui->payAmount->setValid(false);\n retval = false;\n }\n\n return retval;\n}\n\nSendCoinsRecipient SendCoinsEntry::getValue()\n{\n \/\/ Payment request\n if (recipient.paymentRequest.IsInitialized())\n return recipient;\n\n \/\/ Normal payment\n recipient.address = ui->payTo->text();\n recipient.label = ui->addAsLabel->text();\n recipient.amount = ui->payAmount->value();\n recipient.message = ui->messageTextLabel->text();\n\n return recipient;\n}\n\nQWidget *SendCoinsEntry::setupTabChain(QWidget *prev)\n{\n QWidget::setTabOrder(prev, ui->payTo);\n QWidget::setTabOrder(ui->payTo, ui->addAsLabel);\n QWidget *w = ui->payAmount->setupTabChain(ui->addAsLabel);\n QWidget::setTabOrder(w, ui->addressBookButton);\n QWidget::setTabOrder(ui->addressBookButton, ui->pasteButton);\n QWidget::setTabOrder(ui->pasteButton, ui->deleteButton);\n return ui->deleteButton;\n}\n\nvoid SendCoinsEntry::setValue(const SendCoinsRecipient &value)\n{\n recipient = value;\n\n if (recipient.paymentRequest.IsInitialized()) \/\/ payment request\n {\n if (recipient.authenticatedMerchant.isEmpty()) \/\/ insecure\n {\n ui->payTo_is->setText(recipient.address);\n ui->memoTextLabel_is->setText(recipient.message);\n ui->payAmount_is->setValue(recipient.amount);\n ui->payAmount_is->setReadOnly(true);\n setCurrentWidget(ui->SendCoins_InsecurePaymentRequest);\n }\n else \/\/ secure\n {\n ui->payTo_s->setText(recipient.authenticatedMerchant);\n ui->memoTextLabel_s->setText(recipient.message);\n ui->payAmount_s->setValue(recipient.amount);\n ui->payAmount_s->setReadOnly(true);\n setCurrentWidget(ui->SendCoins_SecurePaymentRequest);\n }\n }\n else \/\/ normal payment\n {\n \/\/ message\n ui->messageTextLabel->setText(recipient.message);\n ui->messageTextLabel->setVisible(!recipient.message.isEmpty());\n ui->messageLabel->setVisible(!recipient.message.isEmpty());\n\n ui->payTo->setText(recipient.address);\n ui->addAsLabel->setText(recipient.label);\n ui->payAmount->setValue(recipient.amount);\n }\n}\n\nvoid SendCoinsEntry::setAddress(const QString &address)\n{\n ui->payTo->setText(address);\n ui->payAmount->setFocus();\n}\n\nbool SendCoinsEntry::isClear()\n{\n return ui->payTo->text().isEmpty() && ui->payTo_is->text().isEmpty() && ui->payTo_s->text().isEmpty();\n}\n\nvoid SendCoinsEntry::setFocus()\n{\n ui->payTo->setFocus();\n}\n\nvoid SendCoinsEntry::updateDisplayUnit()\n{\n if(model && model->getOptionsModel())\n {\n \/\/ Update payAmount with the current unit\n ui->payAmount->setDisplayUnit(model->getOptionsModel()->getDisplayUnit());\n ui->payAmount_is->setDisplayUnit(model->getOptionsModel()->getDisplayUnit());\n ui->payAmount_s->setDisplayUnit(model->getOptionsModel()->getDisplayUnit());\n }\n}\n\nbool SendCoinsEntry::updateLabel(const QString &address)\n{\n if(!model)\n return false;\n\n \/\/ Fill in label from address book, if address has an associated label\n QString associatedLabel = model->getAddressTableModel()->labelForAddress(address);\n if(!associatedLabel.isEmpty())\n {\n ui->addAsLabel->setText(associatedLabel);\n return true;\n }\n\n return false;\n}\n[Qt] Fill in label from address book also for URIs\/\/ 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 \"sendcoinsentry.h\"\n#include \"ui_sendcoinsentry.h\"\n\n#include \"addressbookpage.h\"\n#include \"addresstablemodel.h\"\n#include \"guiutil.h\"\n#include \"optionsmodel.h\"\n#include \"walletmodel.h\"\n\n#include \n#include \n\nSendCoinsEntry::SendCoinsEntry(QWidget *parent) :\n QStackedWidget(parent),\n ui(new Ui::SendCoinsEntry),\n model(0)\n{\n ui->setupUi(this);\n\n setCurrentWidget(ui->SendCoins);\n\n#ifdef Q_OS_MAC\n ui->payToLayout->setSpacing(4);\n#endif\n#if QT_VERSION >= 0x040700\n ui->addAsLabel->setPlaceholderText(tr(\"Enter a label for this address to add it to your address book\"));\n#endif\n\n \/\/ normal bitcoin address field\n GUIUtil::setupAddressWidget(ui->payTo, this);\n \/\/ just a label for displaying bitcoin address(es)\n ui->payTo_is->setFont(GUIUtil::bitcoinAddressFont());\n}\n\nSendCoinsEntry::~SendCoinsEntry()\n{\n delete ui;\n}\n\nvoid SendCoinsEntry::on_pasteButton_clicked()\n{\n \/\/ Paste text from clipboard into recipient field\n ui->payTo->setText(QApplication::clipboard()->text());\n}\n\nvoid SendCoinsEntry::on_addressBookButton_clicked()\n{\n if(!model)\n return;\n AddressBookPage dlg(AddressBookPage::ForSelection, AddressBookPage::SendingTab, this);\n dlg.setModel(model->getAddressTableModel());\n if(dlg.exec())\n {\n ui->payTo->setText(dlg.getReturnValue());\n ui->payAmount->setFocus();\n }\n}\n\nvoid SendCoinsEntry::on_payTo_textChanged(const QString &address)\n{\n updateLabel(address);\n}\n\nvoid SendCoinsEntry::setModel(WalletModel *model)\n{\n this->model = model;\n\n if (model && model->getOptionsModel())\n connect(model->getOptionsModel(), SIGNAL(displayUnitChanged(int)), this, SLOT(updateDisplayUnit()));\n\n connect(ui->payAmount, SIGNAL(textChanged()), this, SIGNAL(payAmountChanged()));\n connect(ui->deleteButton, SIGNAL(clicked()), this, SLOT(deleteClicked()));\n connect(ui->deleteButton_is, SIGNAL(clicked()), this, SLOT(deleteClicked()));\n connect(ui->deleteButton_s, SIGNAL(clicked()), this, SLOT(deleteClicked()));\n\n clear();\n}\n\nvoid SendCoinsEntry::clear()\n{\n \/\/ clear UI elements for normal payment\n ui->payTo->clear();\n ui->addAsLabel->clear();\n ui->payAmount->clear();\n ui->messageTextLabel->clear();\n ui->messageTextLabel->hide();\n ui->messageLabel->hide();\n \/\/ clear UI elements for insecure payment request\n ui->payTo_is->clear();\n ui->memoTextLabel_is->clear();\n ui->payAmount_is->clear();\n \/\/ clear UI elements for secure payment request\n ui->payTo_s->clear();\n ui->memoTextLabel_s->clear();\n ui->payAmount_s->clear();\n\n \/\/ update the display unit, to not use the default (\"BTC\")\n updateDisplayUnit();\n}\n\nvoid SendCoinsEntry::deleteClicked()\n{\n emit removeEntry(this);\n}\n\nbool SendCoinsEntry::validate()\n{\n if (!model)\n return false;\n\n \/\/ Check input validity\n bool retval = true;\n\n \/\/ Skip checks for payment request\n if (recipient.paymentRequest.IsInitialized())\n return retval;\n\n if (!model->validateAddress(ui->payTo->text()))\n {\n ui->payTo->setValid(false);\n retval = false;\n }\n\n if (!ui->payAmount->validate())\n {\n retval = false;\n }\n\n \/\/ Reject dust outputs:\n if (retval && GUIUtil::isDust(ui->payTo->text(), ui->payAmount->value())) {\n ui->payAmount->setValid(false);\n retval = false;\n }\n\n return retval;\n}\n\nSendCoinsRecipient SendCoinsEntry::getValue()\n{\n \/\/ Payment request\n if (recipient.paymentRequest.IsInitialized())\n return recipient;\n\n \/\/ Normal payment\n recipient.address = ui->payTo->text();\n recipient.label = ui->addAsLabel->text();\n recipient.amount = ui->payAmount->value();\n recipient.message = ui->messageTextLabel->text();\n\n return recipient;\n}\n\nQWidget *SendCoinsEntry::setupTabChain(QWidget *prev)\n{\n QWidget::setTabOrder(prev, ui->payTo);\n QWidget::setTabOrder(ui->payTo, ui->addAsLabel);\n QWidget *w = ui->payAmount->setupTabChain(ui->addAsLabel);\n QWidget::setTabOrder(w, ui->addressBookButton);\n QWidget::setTabOrder(ui->addressBookButton, ui->pasteButton);\n QWidget::setTabOrder(ui->pasteButton, ui->deleteButton);\n return ui->deleteButton;\n}\n\nvoid SendCoinsEntry::setValue(const SendCoinsRecipient &value)\n{\n recipient = value;\n\n if (recipient.paymentRequest.IsInitialized()) \/\/ payment request\n {\n if (recipient.authenticatedMerchant.isEmpty()) \/\/ insecure\n {\n ui->payTo_is->setText(recipient.address);\n ui->memoTextLabel_is->setText(recipient.message);\n ui->payAmount_is->setValue(recipient.amount);\n ui->payAmount_is->setReadOnly(true);\n setCurrentWidget(ui->SendCoins_InsecurePaymentRequest);\n }\n else \/\/ secure\n {\n ui->payTo_s->setText(recipient.authenticatedMerchant);\n ui->memoTextLabel_s->setText(recipient.message);\n ui->payAmount_s->setValue(recipient.amount);\n ui->payAmount_s->setReadOnly(true);\n setCurrentWidget(ui->SendCoins_SecurePaymentRequest);\n }\n }\n else \/\/ normal payment\n {\n \/\/ message\n ui->messageTextLabel->setText(recipient.message);\n ui->messageTextLabel->setVisible(!recipient.message.isEmpty());\n ui->messageLabel->setVisible(!recipient.message.isEmpty());\n\n ui->addAsLabel->clear();\n ui->payTo->setText(recipient.address); \/\/ this may set a label from addressbook\n if (!recipient.label.isEmpty()) \/\/ if a label had been set from the addressbook, dont overwrite with an empty label\n ui->addAsLabel->setText(recipient.label);\n ui->payAmount->setValue(recipient.amount);\n }\n}\n\nvoid SendCoinsEntry::setAddress(const QString &address)\n{\n ui->payTo->setText(address);\n ui->payAmount->setFocus();\n}\n\nbool SendCoinsEntry::isClear()\n{\n return ui->payTo->text().isEmpty() && ui->payTo_is->text().isEmpty() && ui->payTo_s->text().isEmpty();\n}\n\nvoid SendCoinsEntry::setFocus()\n{\n ui->payTo->setFocus();\n}\n\nvoid SendCoinsEntry::updateDisplayUnit()\n{\n if(model && model->getOptionsModel())\n {\n \/\/ Update payAmount with the current unit\n ui->payAmount->setDisplayUnit(model->getOptionsModel()->getDisplayUnit());\n ui->payAmount_is->setDisplayUnit(model->getOptionsModel()->getDisplayUnit());\n ui->payAmount_s->setDisplayUnit(model->getOptionsModel()->getDisplayUnit());\n }\n}\n\nbool SendCoinsEntry::updateLabel(const QString &address)\n{\n if(!model)\n return false;\n\n \/\/ Fill in label from address book, if address has an associated label\n QString associatedLabel = model->getAddressTableModel()->labelForAddress(address);\n if(!associatedLabel.isEmpty())\n {\n ui->addAsLabel->setText(associatedLabel);\n return true;\n }\n\n return false;\n}\n<|endoftext|>"} {"text":"Fix HTTPServer::GetNextLoop compile error for libevent2.0 version<|endoftext|>"} {"text":"Update sensorflare.cpp<|endoftext|>"} {"text":"#include \"station.h\"\r\n#include \"ed_info.h\"\r\n#include \"util.h\"\r\n\r\nStation::Station(Statement &stmt, ED_Info &info){\r\n\tunsigned hasness_bitmap;\r\n\tboost::optional government, allegiance, state, type;\r\n\tstmt\r\n\t\t>> this->id\r\n\t\t>> this->system_id\r\n\t\t>> this->name\r\n\t\t>> this->max_landing_pad_size\r\n\t\t>> this->distance_to_star\r\n\t\t>> this->faction\r\n\t\t>> government\r\n\t\t>> allegiance\r\n\t\t>> state\r\n\t\t>> type\r\n\t\t>> hasness_bitmap\r\n\t\t>> this->updated_at\r\n\t\t>> this->shipyard_updated_at;\r\n\tthis->parse_hasness_bitmap(hasness_bitmap);\r\n\tthis->government = info.get_government(government);\r\n\tthis->allegiance = info.get_allegiance(allegiance);\r\n\tthis->state = info.get_state(state);\r\n\tthis->type = info.get_station_type(type);\r\n}\r\n\r\nStation::Station(const json_value &obj, ED_Info &info){\r\n\tSET_MEMBER(id, obj);\r\n\tSET_MEMBER(system_id, obj);\r\n\tSET_MEMBER(name, obj);\r\n\tstd::string max_landing_pad_size;\r\n\tassign(max_landing_pad_size, obj, \"max_landing_pad_size\");\r\n\tif (max_landing_pad_size == \"M\")\r\n\t\tthis->max_landing_pad_size = 0;\r\n\telse if (max_landing_pad_size == \"L\")\r\n\t\tthis->max_landing_pad_size = 1;\r\n\telse\r\n\t\tthrow std::exception(\"Invalid data.\");\r\n\tSET_MEMBER(distance_to_star, obj);\r\n\tSET_MEMBER(faction, obj);\r\n\tstd::string government, allegiance, state, type;\r\n\tSET_VARIABLE(government, obj);\r\n\tSET_VARIABLE(allegiance, obj);\r\n\tSET_VARIABLE(state, obj);\r\n\tSET_VARIABLE(type, obj);\r\n\tthis->government = info.get_government(government);\r\n\tthis->allegiance = info.get_allegiance(allegiance);\r\n\tthis->state = info.get_state(state);\r\n\tthis->type = info.get_station_type(type);\r\n\tSET_MEMBER(has_blackmarket, obj);\r\n\tSET_MEMBER(has_market, obj);\r\n\tSET_MEMBER(has_refuel, obj);\r\n\tSET_MEMBER(has_repair, obj);\r\n\tSET_MEMBER(has_rearm, obj);\r\n\tSET_MEMBER(has_outfitting, obj);\r\n\tSET_MEMBER(has_shipyard, obj);\r\n\tSET_MEMBER(has_commodities, obj);\r\n\tSET_MEMBER(updated_at, obj);\r\n\tSET_MEMBER(shipyard_updated_at, obj);\r\n\t{\r\n\t\tauto &import_commodities = obj[\"import_commodities\"];\r\n\t\tif (import_commodities.IsArray()){\r\n\t\t\tauto n = import_commodities.Size();\r\n\t\t\tfor (decltype(n) i = 0; i < n; i++){\r\n\t\t\t\tauto &val = import_commodities[i];\r\n\t\t\t\tif (val.IsString()){\r\n\t\t\t\t\tstd::string name = val.GetString();\r\n\t\t\t\t\tthis->import_commodities.push_back(info.get_commodity(name));\r\n\t\t\t\t}\r\n\t\t\t}\r\n\t\t}\r\n\t}\r\n\t{\r\n\t\tauto &export_commodities = obj[\"export_commodities\"];\r\n\t\tif (export_commodities.IsArray()){\r\n\t\t\tauto n = export_commodities.Size();\r\n\t\t\tfor (decltype(n) i = 0; i < n; i++){\r\n\t\t\t\tauto &val = export_commodities[i];\r\n\t\t\t\tif (val.IsString()){\r\n\t\t\t\t\tstd::string name = val.GetString();\r\n\t\t\t\t\tthis->export_commodities.push_back(info.get_commodity(name));\r\n\t\t\t\t}\r\n\t\t\t}\r\n\t\t}\r\n\t}\r\n\t{\r\n\t\tauto &prohibited_commodities = obj[\"prohibited_commodities\"];\r\n\t\tif (prohibited_commodities.IsArray()){\r\n\t\t\tauto n = prohibited_commodities.Size();\r\n\t\t\tfor (decltype(n) i = 0; i < n; i++){\r\n\t\t\t\tauto &val = prohibited_commodities[i];\r\n\t\t\t\tif (val.IsString()){\r\n\t\t\t\t\tstd::string name = val.GetString();\r\n\t\t\t\t\tthis->prohibited_commodities.push_back(info.get_commodity(name));\r\n\t\t\t\t}\r\n\t\t\t}\r\n\t\t}\r\n\t}\r\n\t{\r\n\t\tauto &economies = obj[\"economies\"];\r\n\t\tif (economies.IsArray()){\r\n\t\t\tauto n = economies.Size();\r\n\t\t\tfor (decltype(n) i = 0; i < n; i++){\r\n\t\t\t\tauto &val = economies[i];\r\n\t\t\t\tif (val.IsString()){\r\n\t\t\t\t\tstd::string name = val.GetString();\r\n\t\t\t\t\tthis->main_economies.push_back(info.get_economy(name));\r\n\t\t\t\t}\r\n\t\t\t}\r\n\t\t}\r\n\t}\r\n\t{\r\n\t\tauto &selling_ships = obj[\"selling_ships\"];\r\n\t\tif (selling_ships.IsArray()){\r\n\t\t\tauto n = selling_ships.Size();\r\n\t\t\tfor (decltype(n) i = 0; i < n; i++){\r\n\t\t\t\tauto &val = selling_ships[i];\r\n\t\t\t\tif (val.IsString()){\r\n\t\t\t\t\tstd::string name = val.GetString();\r\n\t\t\t\t\tthis->selling_ships.push_back(info.get_ship(name));\r\n\t\t\t\t}\r\n\t\t\t}\r\n\t\t}\r\n\t}\r\n\t{\r\n\t\tauto &selling_modules = obj[\"selling_modules\"];\r\n\t\tif (selling_modules.IsArray()){\r\n\t\t\tauto n = selling_modules.Size();\r\n\t\t\tfor (decltype(n) i = 0; i < n; i++){\r\n\t\t\t\tauto &mod = selling_modules[i];\r\n\t\t\t\tu64 id;\r\n\t\t\t\tif (mod.IsInt())\r\n\t\t\t\t\tid = selling_modules[i].GetInt();\r\n\t\t\t\telse if (mod.IsInt64())\r\n\t\t\t\t\tid = selling_modules[i].GetInt64();\r\n\t\t\t\telse\r\n\t\t\t\t\tcontinue;\r\n\t\t\t\tthis->selling_modules.push_back(info.modules[id]);\r\n\t\t\t}\r\n\t\t}\r\n\t}\r\n}\r\n\r\nvoid Station::add_extra(Statement &stmt, const ED_Info &info){\r\n\tu64 foreign_id;\r\n\tint kind;\r\n\tstmt >> foreign_id >> kind;\r\n\tswitch ((StationExtra)kind) {\r\n\t\tcase StationExtra::Import:\r\n\t\t\tthis->import_commodities.push_back(info.commodities[foreign_id]);\r\n\t\t\tbreak;\r\n\t\tcase StationExtra::Export:\r\n\t\t\tthis->export_commodities.push_back(info.commodities[foreign_id]);\r\n\t\t\tbreak;\r\n\t\tcase StationExtra::Prohibited:\r\n\t\t\tthis->prohibited_commodities.push_back(info.commodities[foreign_id]);\r\n\t\t\tbreak;\r\n\t\tcase StationExtra::Economy:\r\n\t\t\tthis->main_economies.push_back(info.economies[foreign_id]);\r\n\t\t\tbreak;\r\n\t\tcase StationExtra::Ship:\r\n\t\t\tthis->selling_ships.push_back(info.ships[foreign_id]);\r\n\t\t\tbreak;\r\n\t\tcase StationExtra::Module:\r\n\t\t\tthis->selling_modules.push_back(info.modules[foreign_id]);\r\n\t\t\tbreak;\r\n\t}\r\n}\r\n\r\nvoid Station::add_economy(Statement &stmt, const std::shared_ptr &commodity){\r\n\tthis->economy.emplace_back(EconomicEntry(stmt, commodity));\r\n\tthis->economy.back().station = this;\r\n}\r\n\r\nEconomicEntry::EconomicEntry(u64 listing[9], const std::shared_ptr &commodity){\r\n\t\/\/id,station_id,commodity_id,supply,buy,sell,demand,collected_at,update_count\r\n\tthis->commodity = commodity;\r\n\tint i = 3;\r\n\tthis->supply = listing[i++];\r\n\tthis->buy = listing[i++];\r\n\tthis->sell = listing[i++];\r\n\tthis->demand = listing[i++];\r\n\tthis->collected_at = listing[i++];\r\n\tthis->update_count = listing[i++];\r\n}\r\n\r\nvoid Station::add_economy(u64 listing[9], const std::shared_ptr &commodity){\r\n\tthis->economy.emplace_back(EconomicEntry(listing, commodity));\r\n\tthis->economy.back().station = this;\r\n}\r\n\r\nconst EconomicEntry &Station::find_economic_entry(Commodity *commodity) const{\r\n\tfor (auto &entry : this->economy)\r\n\t\tif (entry.commodity->id == commodity->id)\r\n\t\t\treturn entry;\r\n\tthrow std::exception(\"Cannot find commodity.\");\r\n}\r\n\r\nunsigned Station::get_hasness_bitmap() const{\r\n\tunsigned ret = 0;\r\n\t\/\/Order matters!\r\n\tconst boost::optional *array[] = {\r\n\t\t&this->has_commodities,\r\n\t\t&this->has_shipyard,\r\n\t\t&this->has_outfitting,\r\n\t\t&this->has_rearm,\r\n\t\t&this->has_repair,\r\n\t\t&this->has_refuel,\r\n\t\t&this->has_market,\r\n\t\t&this->has_blackmarket,\r\n\t};\r\n\r\n\tfor (auto p : array){\r\n\t\tret <<= 2;\r\n\t\tif (!p->is_initialized())\r\n\t\t\tcontinue;\r\n\t\tret |= ((unsigned)p->value() << 1) | 1;\r\n\t}\r\n\treturn ret;\r\n}\r\n\r\nvoid Station::parse_hasness_bitmap(unsigned n){\r\n\t\/\/Order matters!\r\n\tboost::optional *array[] = {\r\n\t\t&this->has_blackmarket,\r\n\t\t&this->has_market,\r\n\t\t&this->has_refuel,\r\n\t\t&this->has_repair,\r\n\t\t&this->has_rearm,\r\n\t\t&this->has_outfitting,\r\n\t\t&this->has_shipyard,\r\n\t\t&this->has_commodities,\r\n\t};\r\n\tfor (auto p : array){\r\n\t\tbool is_value = (n & 1) != 0;\r\n\t\tbool value = (n & 2) != 0;\r\n\t\tn >>= 2;\r\n\t\tif (is_value)\r\n\t\t\t*p = value;\r\n\t}\r\n}\r\n\r\nvoid Station::save(\r\n\t\tStatement &new_station,\r\n\t\tStatement &new_extra,\r\n\t\tStatement &new_station_economy){\r\n\tnew_station\r\n\t\t<< Reset()\r\n\t\t<< this->id\r\n\t\t<< this->system->id\r\n\t\t<< this->name\r\n\t\t<< this->max_landing_pad_size\r\n\t\t<< this->distance_to_star\r\n\t\t<< this->faction;\r\n\tBasicStringType *array[] = {\r\n\t\tthis->government.get(),\r\n\t\tthis->allegiance.get(),\r\n\t\tthis->state.get(),\r\n\t\tthis->type.get(),\r\n\t};\r\n\tfor (auto p : array){\r\n\t\tif (p)\r\n\t\t\tnew_station << p->id;\r\n\t\telse\r\n\t\t\tnew_station << Null();\r\n\t}\r\n\tnew_station\r\n\t\t<< this->get_hasness_bitmap()\r\n\t\t<< this->updated_at\r\n\t\t<< this->shipyard_updated_at\r\n\t\t<< Step();\r\n\r\n\tfor (auto &commodity : this->import_commodities)\r\n\t\tnew_extra\r\n\t\t\t<< Reset()\r\n\t\t\t<< this->id\r\n\t\t\t<< commodity->id\r\n\t\t\t<< (int)StationExtra::Import\r\n\t\t\t<< Step();\r\n\tfor (auto &commodity : this->export_commodities)\r\n\t\tnew_extra\r\n\t\t\t<< Reset()\r\n\t\t\t<< this->id\r\n\t\t\t<< commodity->id\r\n\t\t\t<< (int)StationExtra::Export\r\n\t\t\t<< Step();\r\n\tfor (auto &commodity : this->prohibited_commodities)\r\n\t\tnew_extra\r\n\t\t\t<< Reset()\r\n\t\t\t<< this->id\r\n\t\t\t<< commodity->id\r\n\t\t\t<< (int)StationExtra::Prohibited\r\n\t\t\t<< Step();\r\n\tfor (auto &econ : this->main_economies)\r\n\t\tnew_extra\r\n\t\t\t<< Reset()\r\n\t\t\t<< this->id\r\n\t\t\t<< econ->id\r\n\t\t\t<< (int)StationExtra::Economy\r\n\t\t\t<< Step();\r\n\tfor (auto &ship : this->selling_ships)\r\n\t\tnew_extra\r\n\t\t\t<< Reset()\r\n\t\t\t<< this->id\r\n\t\t\t<< ship->id\r\n\t\t\t<< (int)StationExtra::Ship\r\n\t\t\t<< Step();\r\n\tfor (auto &module : this->selling_modules)\r\n\t\tnew_extra\r\n\t\t\t<< Reset()\r\n\t\t\t<< this->id\r\n\t\t\t<< module->id\r\n\t\t\t<< (int)StationExtra::Module\r\n\t\t\t<< Step();\r\n\r\n\tfor (auto &econ : this->economy){\r\n\t\tnew_station_economy\r\n\t\t\t<< Reset()\r\n\t\t\t<< this->id\r\n\t\t\t<< econ.commodity->id\r\n\t\t\t<< econ.supply\r\n\t\t\t<< econ.demand\r\n\t\t\t<< econ.buy\r\n\t\t\t<< econ.sell\r\n\t\t\t<< econ.collected_at\r\n\t\t\t<< econ.update_count\r\n\t\t\t<< Step();\r\n\t}\r\n}\r\n\r\nstd::shared_ptr Station::create_virtual_station(StarSystem *system){\r\n\tstd::shared_ptr ret(new Station);\r\n\tret->id = std::numeric_limitsid)>::max();\r\n\tret->system_id = system->id;\r\n\tret->max_landing_pad_size = std::numeric_limitsmax_landing_pad_size)>::max();\r\n\tret->distance_to_star = 0;\r\n\tret->updated_at = 0;\r\n\tret->system = system;\r\n\treturn ret;\r\n}\r\nFixed data import bug.#include \"station.h\"\r\n#include \"ed_info.h\"\r\n#include \"util.h\"\r\n\r\nStation::Station(Statement &stmt, ED_Info &info){\r\n\tunsigned hasness_bitmap;\r\n\tboost::optional government, allegiance, state, type;\r\n\tstmt\r\n\t\t>> this->id\r\n\t\t>> this->system_id\r\n\t\t>> this->name\r\n\t\t>> this->max_landing_pad_size\r\n\t\t>> this->distance_to_star\r\n\t\t>> this->faction\r\n\t\t>> government\r\n\t\t>> allegiance\r\n\t\t>> state\r\n\t\t>> type\r\n\t\t>> hasness_bitmap\r\n\t\t>> this->updated_at\r\n\t\t>> this->shipyard_updated_at;\r\n\tthis->parse_hasness_bitmap(hasness_bitmap);\r\n\tthis->government = info.get_government(government);\r\n\tthis->allegiance = info.get_allegiance(allegiance);\r\n\tthis->state = info.get_state(state);\r\n\tthis->type = info.get_station_type(type);\r\n}\r\n\r\nStation::Station(const json_value &obj, ED_Info &info){\r\n\tSET_MEMBER(id, obj);\r\n\tSET_MEMBER(system_id, obj);\r\n\tSET_MEMBER(name, obj);\r\n\tstd::string max_landing_pad_size;\r\n\tassign(max_landing_pad_size, obj, \"max_landing_pad_size\");\r\n\tif (max_landing_pad_size == \"M\")\r\n\t\tthis->max_landing_pad_size = 0;\r\n\telse if (max_landing_pad_size == \"L\")\r\n\t\tthis->max_landing_pad_size = 1;\r\n\telse\r\n\t\tthis->max_landing_pad_size = 0;\r\n\tSET_MEMBER(distance_to_star, obj);\r\n\tSET_MEMBER(faction, obj);\r\n\tstd::string government, allegiance, state, type;\r\n\tSET_VARIABLE(government, obj);\r\n\tSET_VARIABLE(allegiance, obj);\r\n\tSET_VARIABLE(state, obj);\r\n\tSET_VARIABLE(type, obj);\r\n\tthis->government = info.get_government(government);\r\n\tthis->allegiance = info.get_allegiance(allegiance);\r\n\tthis->state = info.get_state(state);\r\n\tthis->type = info.get_station_type(type);\r\n\tSET_MEMBER(has_blackmarket, obj);\r\n\tSET_MEMBER(has_market, obj);\r\n\tSET_MEMBER(has_refuel, obj);\r\n\tSET_MEMBER(has_repair, obj);\r\n\tSET_MEMBER(has_rearm, obj);\r\n\tSET_MEMBER(has_outfitting, obj);\r\n\tSET_MEMBER(has_shipyard, obj);\r\n\tSET_MEMBER(has_commodities, obj);\r\n\tSET_MEMBER(updated_at, obj);\r\n\tSET_MEMBER(shipyard_updated_at, obj);\r\n\t{\r\n\t\tauto &import_commodities = obj[\"import_commodities\"];\r\n\t\tif (import_commodities.IsArray()){\r\n\t\t\tauto n = import_commodities.Size();\r\n\t\t\tfor (decltype(n) i = 0; i < n; i++){\r\n\t\t\t\tauto &val = import_commodities[i];\r\n\t\t\t\tif (val.IsString()){\r\n\t\t\t\t\tstd::string name = val.GetString();\r\n\t\t\t\t\tthis->import_commodities.push_back(info.get_commodity(name));\r\n\t\t\t\t}\r\n\t\t\t}\r\n\t\t}\r\n\t}\r\n\t{\r\n\t\tauto &export_commodities = obj[\"export_commodities\"];\r\n\t\tif (export_commodities.IsArray()){\r\n\t\t\tauto n = export_commodities.Size();\r\n\t\t\tfor (decltype(n) i = 0; i < n; i++){\r\n\t\t\t\tauto &val = export_commodities[i];\r\n\t\t\t\tif (val.IsString()){\r\n\t\t\t\t\tstd::string name = val.GetString();\r\n\t\t\t\t\tthis->export_commodities.push_back(info.get_commodity(name));\r\n\t\t\t\t}\r\n\t\t\t}\r\n\t\t}\r\n\t}\r\n\t{\r\n\t\tauto &prohibited_commodities = obj[\"prohibited_commodities\"];\r\n\t\tif (prohibited_commodities.IsArray()){\r\n\t\t\tauto n = prohibited_commodities.Size();\r\n\t\t\tfor (decltype(n) i = 0; i < n; i++){\r\n\t\t\t\tauto &val = prohibited_commodities[i];\r\n\t\t\t\tif (val.IsString()){\r\n\t\t\t\t\tstd::string name = val.GetString();\r\n\t\t\t\t\tthis->prohibited_commodities.push_back(info.get_commodity(name));\r\n\t\t\t\t}\r\n\t\t\t}\r\n\t\t}\r\n\t}\r\n\t{\r\n\t\tauto &economies = obj[\"economies\"];\r\n\t\tif (economies.IsArray()){\r\n\t\t\tauto n = economies.Size();\r\n\t\t\tfor (decltype(n) i = 0; i < n; i++){\r\n\t\t\t\tauto &val = economies[i];\r\n\t\t\t\tif (val.IsString()){\r\n\t\t\t\t\tstd::string name = val.GetString();\r\n\t\t\t\t\tthis->main_economies.push_back(info.get_economy(name));\r\n\t\t\t\t}\r\n\t\t\t}\r\n\t\t}\r\n\t}\r\n\t{\r\n\t\tauto &selling_ships = obj[\"selling_ships\"];\r\n\t\tif (selling_ships.IsArray()){\r\n\t\t\tauto n = selling_ships.Size();\r\n\t\t\tfor (decltype(n) i = 0; i < n; i++){\r\n\t\t\t\tauto &val = selling_ships[i];\r\n\t\t\t\tif (val.IsString()){\r\n\t\t\t\t\tstd::string name = val.GetString();\r\n\t\t\t\t\tthis->selling_ships.push_back(info.get_ship(name));\r\n\t\t\t\t}\r\n\t\t\t}\r\n\t\t}\r\n\t}\r\n\t{\r\n\t\tauto &selling_modules = obj[\"selling_modules\"];\r\n\t\tif (selling_modules.IsArray()){\r\n\t\t\tauto n = selling_modules.Size();\r\n\t\t\tfor (decltype(n) i = 0; i < n; i++){\r\n\t\t\t\tauto &mod = selling_modules[i];\r\n\t\t\t\tu64 id;\r\n\t\t\t\tif (mod.IsInt())\r\n\t\t\t\t\tid = selling_modules[i].GetInt();\r\n\t\t\t\telse if (mod.IsInt64())\r\n\t\t\t\t\tid = selling_modules[i].GetInt64();\r\n\t\t\t\telse\r\n\t\t\t\t\tcontinue;\r\n\t\t\t\tthis->selling_modules.push_back(info.modules[id]);\r\n\t\t\t}\r\n\t\t}\r\n\t}\r\n}\r\n\r\nvoid Station::add_extra(Statement &stmt, const ED_Info &info){\r\n\tu64 foreign_id;\r\n\tint kind;\r\n\tstmt >> foreign_id >> kind;\r\n\tswitch ((StationExtra)kind) {\r\n\t\tcase StationExtra::Import:\r\n\t\t\tthis->import_commodities.push_back(info.commodities[foreign_id]);\r\n\t\t\tbreak;\r\n\t\tcase StationExtra::Export:\r\n\t\t\tthis->export_commodities.push_back(info.commodities[foreign_id]);\r\n\t\t\tbreak;\r\n\t\tcase StationExtra::Prohibited:\r\n\t\t\tthis->prohibited_commodities.push_back(info.commodities[foreign_id]);\r\n\t\t\tbreak;\r\n\t\tcase StationExtra::Economy:\r\n\t\t\tthis->main_economies.push_back(info.economies[foreign_id]);\r\n\t\t\tbreak;\r\n\t\tcase StationExtra::Ship:\r\n\t\t\tthis->selling_ships.push_back(info.ships[foreign_id]);\r\n\t\t\tbreak;\r\n\t\tcase StationExtra::Module:\r\n\t\t\tthis->selling_modules.push_back(info.modules[foreign_id]);\r\n\t\t\tbreak;\r\n\t}\r\n}\r\n\r\nvoid Station::add_economy(Statement &stmt, const std::shared_ptr &commodity){\r\n\tthis->economy.emplace_back(EconomicEntry(stmt, commodity));\r\n\tthis->economy.back().station = this;\r\n}\r\n\r\nEconomicEntry::EconomicEntry(u64 listing[9], const std::shared_ptr &commodity){\r\n\t\/\/id,station_id,commodity_id,supply,buy,sell,demand,collected_at,update_count\r\n\tthis->commodity = commodity;\r\n\tint i = 3;\r\n\tthis->supply = listing[i++];\r\n\tthis->buy = listing[i++];\r\n\tthis->sell = listing[i++];\r\n\tthis->demand = listing[i++];\r\n\tthis->collected_at = listing[i++];\r\n\tthis->update_count = listing[i++];\r\n}\r\n\r\nvoid Station::add_economy(u64 listing[9], const std::shared_ptr &commodity){\r\n\tthis->economy.emplace_back(EconomicEntry(listing, commodity));\r\n\tthis->economy.back().station = this;\r\n}\r\n\r\nconst EconomicEntry &Station::find_economic_entry(Commodity *commodity) const{\r\n\tfor (auto &entry : this->economy)\r\n\t\tif (entry.commodity->id == commodity->id)\r\n\t\t\treturn entry;\r\n\tthrow std::exception(\"Cannot find commodity.\");\r\n}\r\n\r\nunsigned Station::get_hasness_bitmap() const{\r\n\tunsigned ret = 0;\r\n\t\/\/Order matters!\r\n\tconst boost::optional *array[] = {\r\n\t\t&this->has_commodities,\r\n\t\t&this->has_shipyard,\r\n\t\t&this->has_outfitting,\r\n\t\t&this->has_rearm,\r\n\t\t&this->has_repair,\r\n\t\t&this->has_refuel,\r\n\t\t&this->has_market,\r\n\t\t&this->has_blackmarket,\r\n\t};\r\n\r\n\tfor (auto p : array){\r\n\t\tret <<= 2;\r\n\t\tif (!p->is_initialized())\r\n\t\t\tcontinue;\r\n\t\tret |= ((unsigned)p->value() << 1) | 1;\r\n\t}\r\n\treturn ret;\r\n}\r\n\r\nvoid Station::parse_hasness_bitmap(unsigned n){\r\n\t\/\/Order matters!\r\n\tboost::optional *array[] = {\r\n\t\t&this->has_blackmarket,\r\n\t\t&this->has_market,\r\n\t\t&this->has_refuel,\r\n\t\t&this->has_repair,\r\n\t\t&this->has_rearm,\r\n\t\t&this->has_outfitting,\r\n\t\t&this->has_shipyard,\r\n\t\t&this->has_commodities,\r\n\t};\r\n\tfor (auto p : array){\r\n\t\tbool is_value = (n & 1) != 0;\r\n\t\tbool value = (n & 2) != 0;\r\n\t\tn >>= 2;\r\n\t\tif (is_value)\r\n\t\t\t*p = value;\r\n\t}\r\n}\r\n\r\nvoid Station::save(\r\n\t\tStatement &new_station,\r\n\t\tStatement &new_extra,\r\n\t\tStatement &new_station_economy){\r\n\tnew_station\r\n\t\t<< Reset()\r\n\t\t<< this->id\r\n\t\t<< this->system->id\r\n\t\t<< this->name\r\n\t\t<< this->max_landing_pad_size\r\n\t\t<< this->distance_to_star\r\n\t\t<< this->faction;\r\n\tBasicStringType *array[] = {\r\n\t\tthis->government.get(),\r\n\t\tthis->allegiance.get(),\r\n\t\tthis->state.get(),\r\n\t\tthis->type.get(),\r\n\t};\r\n\tfor (auto p : array){\r\n\t\tif (p)\r\n\t\t\tnew_station << p->id;\r\n\t\telse\r\n\t\t\tnew_station << Null();\r\n\t}\r\n\tnew_station\r\n\t\t<< this->get_hasness_bitmap()\r\n\t\t<< this->updated_at\r\n\t\t<< this->shipyard_updated_at\r\n\t\t<< Step();\r\n\r\n\tfor (auto &commodity : this->import_commodities)\r\n\t\tnew_extra\r\n\t\t\t<< Reset()\r\n\t\t\t<< this->id\r\n\t\t\t<< commodity->id\r\n\t\t\t<< (int)StationExtra::Import\r\n\t\t\t<< Step();\r\n\tfor (auto &commodity : this->export_commodities)\r\n\t\tnew_extra\r\n\t\t\t<< Reset()\r\n\t\t\t<< this->id\r\n\t\t\t<< commodity->id\r\n\t\t\t<< (int)StationExtra::Export\r\n\t\t\t<< Step();\r\n\tfor (auto &commodity : this->prohibited_commodities)\r\n\t\tnew_extra\r\n\t\t\t<< Reset()\r\n\t\t\t<< this->id\r\n\t\t\t<< commodity->id\r\n\t\t\t<< (int)StationExtra::Prohibited\r\n\t\t\t<< Step();\r\n\tfor (auto &econ : this->main_economies)\r\n\t\tnew_extra\r\n\t\t\t<< Reset()\r\n\t\t\t<< this->id\r\n\t\t\t<< econ->id\r\n\t\t\t<< (int)StationExtra::Economy\r\n\t\t\t<< Step();\r\n\tfor (auto &ship : this->selling_ships)\r\n\t\tnew_extra\r\n\t\t\t<< Reset()\r\n\t\t\t<< this->id\r\n\t\t\t<< ship->id\r\n\t\t\t<< (int)StationExtra::Ship\r\n\t\t\t<< Step();\r\n\tfor (auto &module : this->selling_modules)\r\n\t\tnew_extra\r\n\t\t\t<< Reset()\r\n\t\t\t<< this->id\r\n\t\t\t<< module->id\r\n\t\t\t<< (int)StationExtra::Module\r\n\t\t\t<< Step();\r\n\r\n\tfor (auto &econ : this->economy){\r\n\t\tnew_station_economy\r\n\t\t\t<< Reset()\r\n\t\t\t<< this->id\r\n\t\t\t<< econ.commodity->id\r\n\t\t\t<< econ.supply\r\n\t\t\t<< econ.demand\r\n\t\t\t<< econ.buy\r\n\t\t\t<< econ.sell\r\n\t\t\t<< econ.collected_at\r\n\t\t\t<< econ.update_count\r\n\t\t\t<< Step();\r\n\t}\r\n}\r\n\r\nstd::shared_ptr Station::create_virtual_station(StarSystem *system){\r\n\tstd::shared_ptr ret(new Station);\r\n\tret->id = std::numeric_limitsid)>::max();\r\n\tret->system_id = system->id;\r\n\tret->max_landing_pad_size = std::numeric_limitsmax_landing_pad_size)>::max();\r\n\tret->distance_to_star = 0;\r\n\tret->updated_at = 0;\r\n\tret->system = system;\r\n\treturn ret;\r\n}\r\n<|endoftext|>"} {"text":"\/* \n * File: BackpropeagationLearner.cpp\n * Author: janvojt\n * \n * Created on July 13, 2014, 12:10 AM\n *\/\n\n#include \"BackpropagationLearner.h\"\n#include \"Network.h\"\n#include \"LabeledDataset.h\"\n#include \n#include \n#include \n\n#include \"log\/LoggerFactory.h\"\n#include \"log4cpp\/Category.hh\"\n\nBackpropagationLearner::BackpropagationLearner(Network *network) {\n this->network = network;\n learningRate = 1;\n epochCounter = 0;\n epochLimit = 1000000;\n targetMse = .0001;\n errorTotal = std::numeric_limits::infinity();\n allocateCache();\n}\n\nBackpropagationLearner::BackpropagationLearner(const BackpropagationLearner &orig) {\n}\n\nBackpropagationLearner::~BackpropagationLearner() {\n \n}\n\nvoid BackpropagationLearner::allocateCache() {\n weightDiffs = new double[network->getWeightsOffset(network->getConfiguration()->getLayers())];\n localGradients = new double[network->getAllNeurons()];\n \n useBias = network->getConfiguration()->getBias();\n biasDiff = useBias ? new double[network->getAllNeurons()] : NULL;\n}\n\nvoid BackpropagationLearner::train(LabeledDataset *dataset) {\n double mse;\n LOG()->info(\"Started training with limits of %d epochs and target MSE of %f.\", epochLimit, targetMse);\n do {\n epochCounter++;\n LOG()->debug(\"Starting epoch %d.\", epochCounter);\n dataset->reset();\n int datasetSize = 0;\n mse = 0;\n while (dataset->hasNext()) {\n datasetSize++;\n double *pattern = dataset->next();\n double *expOutput = pattern + dataset->getInputDimension();\n LOG()->debug(\"Learning pattern [%f, %f] -> [%f].\", pattern[0], pattern[1], expOutput[0]);\n doForwardPhase(pattern);\n doBackwardPhase(expOutput);\n mse += errorComputer->compute(network, expOutput);\n }\n mse = mse \/ datasetSize;\n LOG()->debug(\"Finished epoch %d with MSE: %f.\", epochCounter, mse);\n } while (mse > targetMse && epochCounter < epochLimit);\n LOG()->info(\"Finished training after %d epochs with MSE of %f.\", epochCounter, mse);\n}\n\nvoid BackpropagationLearner::doForwardPhase(double *input) {\n network->setInput(input);\n network->run();\n}\n\nvoid BackpropagationLearner::doBackwardPhase(double *expectedOutput) {\n computeOutputGradients(expectedOutput);\n computeWeightDifferentials();\n adjustWeights();\n if (network->getConfiguration()->getBias()) {\n adjustBias();\n }\n}\n\nvoid BackpropagationLearner::computeOutputGradients(double *expectedOutput) {\n int on = network->getOutputNeurons();\n int noLayers = network->getConfiguration()->getLayers();\n double *localGradient = localGradients + network->getPotentialOffset(noLayers-1);\n double *output = network->getOutput();\n void (*daf) (double*,double*,int) = network->getConfiguration()->dActivationFnc;\n \n \/\/ compute local gradients\n double *dv = new double[network->getOutputNeurons()];\n daf(network->getPotentialValues() + network->getPotentialOffset(noLayers-1), dv, on);\n for (int i = 0; igetConfiguration()->getLayers();\n void (*daf) (double*,double*,int) = network->getConfiguration()->dActivationFnc;\n \n for (int l = noLayers-1; l>0; l--) {\n \n \/\/ INITIALIZE HELPER VARIABLES\n int thisPotentialIndex = network->getPotentialOffset(l-1);\n double *thisLocalGradient = localGradients + thisPotentialIndex;\n int nextPotentialIndex = network->getPotentialOffset(l);\n double *nextLocalGradient = localGradients + nextPotentialIndex;\n int thisNeurons = network->getConfiguration()->getNeurons(l-1);\n int nextNeurons = network->getConfiguration()->getNeurons(l);\n double *thisPotential = network->getPotentialValues() + thisPotentialIndex;\n double *weights = network->getWeights() + network->getWeightsOffset(l-1);\n \n \n \/\/ COMPUTE TOTAL DERIVATIVES for weights between layer l and l+1\n int wc = network->getWeightsOffset(l+1) - network->getWeightsOffset(l);\n double *thisInputs = network->getInputValues() + network->getPotentialOffset(l-1);\n double *wdiff = weightDiffs + network->getWeightsOffset(l);\n for (int i = 0; igetWeightsOffset(network->getConfiguration()->getLayers());\n double *weights = network->getWeights();\n LOG()->debug(\"Adjusting weights by: [[%f, %f, %f, %f], [%f, %f]].\", weightDiffs[2], weightDiffs[3], weightDiffs[4], weightDiffs[5], weightDiffs[6], weightDiffs[7]);\n \/\/ we should skip the garbage in zero-layer weights\n for(int i = network->getWeightsOffset(1); igetBiasValues();\n int noNeurons = network->getAllNeurons();\n for (int i = 0; igetInputDimension() != network->getInputNeurons()) {\n throw new std::invalid_argument(\"Provided dataset must have the same input dimension as the number of input neurons!\");\n }\n if (dataset->getOutputDimension() != network->getOutputNeurons()) {\n throw new std::invalid_argument(\"Provided dataset must have the same output dimension as the number of output neurons!\");\n }\n}\n\nvoid BackpropagationLearner::setEpochLimit(int limit) {\n epochLimit = limit;\n}\n\nvoid BackpropagationLearner::setErrorComputer(ErrorComputer* errorComputer) {\n this->errorComputer = errorComputer;\n}\n\nvoid BackpropagationLearner::setTargetMse(double mse) {\n targetMse = mse;\n}\nFixed weight indexing in BP learner.\/* \n * File: BackpropeagationLearner.cpp\n * Author: janvojt\n * \n * Created on July 13, 2014, 12:10 AM\n *\/\n\n#include \"BackpropagationLearner.h\"\n#include \"Network.h\"\n#include \"LabeledDataset.h\"\n#include \n#include \n#include \n\n#include \"log\/LoggerFactory.h\"\n#include \"log4cpp\/Category.hh\"\n\nBackpropagationLearner::BackpropagationLearner(Network *network) {\n this->network = network;\n learningRate = 1;\n epochCounter = 0;\n epochLimit = 1000000;\n targetMse = .0001;\n errorTotal = std::numeric_limits::infinity();\n allocateCache();\n}\n\nBackpropagationLearner::BackpropagationLearner(const BackpropagationLearner &orig) {\n}\n\nBackpropagationLearner::~BackpropagationLearner() {\n \n}\n\nvoid BackpropagationLearner::allocateCache() {\n weightDiffs = new double[network->getWeightsOffset(network->getConfiguration()->getLayers())];\n localGradients = new double[network->getAllNeurons()];\n \n useBias = network->getConfiguration()->getBias();\n biasDiff = useBias ? new double[network->getAllNeurons()] : NULL;\n}\n\nvoid BackpropagationLearner::train(LabeledDataset *dataset) {\n double mse;\n LOG()->info(\"Started training with limits of %d epochs and target MSE of %f.\", epochLimit, targetMse);\n do {\n epochCounter++;\n LOG()->debug(\"Starting epoch %d.\", epochCounter);\n dataset->reset();\n int datasetSize = 0;\n mse = 0;\n while (dataset->hasNext()) {\n datasetSize++;\n double *pattern = dataset->next();\n double *expOutput = pattern + dataset->getInputDimension();\n LOG()->debug(\"Learning pattern [%f, %f] -> [%f].\", pattern[0], pattern[1], expOutput[0]);\n doForwardPhase(pattern);\n doBackwardPhase(expOutput);\n mse += errorComputer->compute(network, expOutput);\n }\n mse = mse \/ datasetSize;\n LOG()->debug(\"Finished epoch %d with MSE: %f.\", epochCounter, mse);\n } while (mse > targetMse && epochCounter < epochLimit);\n LOG()->info(\"Finished training after %d epochs with MSE of %f.\", epochCounter, mse);\n}\n\nvoid BackpropagationLearner::doForwardPhase(double *input) {\n network->setInput(input);\n network->run();\n}\n\nvoid BackpropagationLearner::doBackwardPhase(double *expectedOutput) {\n computeOutputGradients(expectedOutput);\n computeWeightDifferentials();\n adjustWeights();\n if (network->getConfiguration()->getBias()) {\n adjustBias();\n }\n}\n\nvoid BackpropagationLearner::computeOutputGradients(double *expectedOutput) {\n int on = network->getOutputNeurons();\n int noLayers = network->getConfiguration()->getLayers();\n double *localGradient = localGradients + network->getPotentialOffset(noLayers-1);\n double *output = network->getOutput();\n void (*daf) (double*,double*,int) = network->getConfiguration()->dActivationFnc;\n \n \/\/ compute local gradients\n double *dv = new double[network->getOutputNeurons()];\n daf(network->getPotentialValues() + network->getPotentialOffset(noLayers-1), dv, on);\n for (int i = 0; igetConfiguration()->getLayers();\n void (*daf) (double*,double*,int) = network->getConfiguration()->dActivationFnc;\n \n for (int l = noLayers-1; l>0; l--) {\n \n \/\/ INITIALIZE HELPER VARIABLES\n int thisPotentialIndex = network->getPotentialOffset(l-1);\n double *thisLocalGradient = localGradients + thisPotentialIndex;\n int nextPotentialIndex = network->getPotentialOffset(l);\n double *nextLocalGradient = localGradients + nextPotentialIndex;\n int thisNeurons = network->getConfiguration()->getNeurons(l-1);\n int nextNeurons = network->getConfiguration()->getNeurons(l);\n double *thisPotential = network->getPotentialValues() + thisPotentialIndex;\n double *weights = network->getWeights() + network->getWeightsOffset(l-1);\n \n \n \/\/ COMPUTE TOTAL DERIVATIVES for weights between layer l and l+1\n int wc = network->getWeightsOffset(l+1) - network->getWeightsOffset(l) + 1;\n double *thisInputs = network->getInputValues() + network->getPotentialOffset(l-1);\n double *wdiff = weightDiffs + network->getWeightsOffset(l);\n for (int i = 0; igetWeightsOffset(network->getConfiguration()->getLayers()) + 1;\n double *weights = network->getWeights();\n LOG()->debug(\"Adjusting weights by: [[%f, %f, %f], [%f, %f, %f], [%f, %f, %f]].\",\n weightDiffs[2], weightDiffs[3], weightDiffs[4],\n weightDiffs[5], weightDiffs[6], weightDiffs[7], weightDiffs[8],\n weightDiffs[9], weightDiffs[10]);\n \n \/\/ we should skip the garbage in zero-layer weights\n for(int i = network->getWeightsOffset(1); igetBiasValues();\n int noNeurons = network->getAllNeurons();\n for (int i = 0; igetInputDimension() != network->getInputNeurons()) {\n throw new std::invalid_argument(\"Provided dataset must have the same input dimension as the number of input neurons!\");\n }\n if (dataset->getOutputDimension() != network->getOutputNeurons()) {\n throw new std::invalid_argument(\"Provided dataset must have the same output dimension as the number of output neurons!\");\n }\n}\n\nvoid BackpropagationLearner::setEpochLimit(int limit) {\n epochLimit = limit;\n}\n\nvoid BackpropagationLearner::setErrorComputer(ErrorComputer* errorComputer) {\n this->errorComputer = errorComputer;\n}\n\nvoid BackpropagationLearner::setTargetMse(double mse) {\n targetMse = mse;\n}\n<|endoftext|>"} {"text":"#include \n#include \n#include \n\/\/ PCL specific includes\n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n\nros::Publisher pub_v; \/\/ voxel publisher\nros::Publisher pub_p;\nros::Publisher pub_f;\n\/\/ How to avoid hard-coding a topic name?\nros::Publisher pub_c; \/\/ publish cluster\n\nvoid cloud_cb(const sensor_msgs::PointCloud2ConstPtr& input) {\n \/\/ Container for original & filtered data\n pcl::PCLPointCloud2* cloud = new pcl::PCLPointCloud2;\n pcl::PCLPointCloud2ConstPtr cloudPtr(cloud);\n pcl::PCLPointCloud2 cloud_filtered; \/\/ (new pcl::PCLPointCloud2);\n pcl::PointCloud::Ptr cloud_templated (new pcl::PointCloud);\n pcl::PointCloud::Ptr cloud_p (new pcl::PointCloud);\n pcl::PointCloud::Ptr cloud_f (new pcl::PointCloud);\n pcl_conversions::toPCL(*input, *cloud);\n\n \/\/ StatOutlierRemoval\n \/\/ How to use both of SOR and VG?\n \/* pcl::StatisticalOutlierRemoval sor_0;\n sor_0.setInputCloud(cloudPtr);\n sor_0.setMeanK(50);\n sor_0.setStddevMulThresh(1.0);\n sor_0.filter(cloud_filtered); \/\/ fill in an empty variable *\/\n\n \/\/ Downsampling\n pcl::VoxelGrid sor;\n sor.setInputCloud(cloudPtr);\n sor.setLeafSize(0.02f, 0.02f, 0.02f);\n sor.filter(cloud_filtered);\n\n \/\/ Publishing voxel\n sensor_msgs::PointCloud2 output_v;\n pcl_conversions::fromPCL(cloud_filtered, output_v);\n pub_v.publish(output_v);\n\n \/\/ Convert\n pcl::fromPCLPointCloud2(cloud_filtered, *cloud_templated); \/\/ unused\n\n \/* Perform the actual filtering *\/\n \/\/ Create the segmentation object\n pcl::SACSegmentation seg;\n pcl::PointIndices::Ptr inliers (new pcl::PointIndices ());\n pcl::ModelCoefficients::Ptr coefficients (new pcl::ModelCoefficients ());\n seg.setOptimizeCoefficients (true); \/\/ Optional\n \/\/ Mandatory\n seg.setModelType (pcl::SACMODEL_PLANE);\n seg.setMethodType (pcl::SAC_RANSAC);\n seg.setMaxIterations (1000); \/\/ added\n seg.setDistanceThreshold (0.02);\n\n \/* Filtering Object: Extraction *\/\n \/\/ pcl::ExtractIndices extract;\n\n int i = 0, nr_points = (int) cloud_templated->points.size ();\n \/\/ While 30% of the original cloud is still there\n while (cloud_templated->points.size () > 0.3 * nr_points)\n {\n \/\/ Segment the largest planar component from the remaining cloud\n seg.setInputCloud (cloud_templated);\n seg.segment (*inliers, *coefficients);\n if (inliers->indices.size () == 0)\n {\n ROS_INFO(\"Could not estimate a planar model for the given dataset.\");\n break;\n }\n\n \/\/ Extract the inliers\n pcl::ExtractIndices extract;\n extract.setInputCloud (cloud_templated);\n extract.setIndices (inliers);\n extract.setNegative (false);\n\n \/\/ Get the points associated with the planar surface\n extract.filter (*cloud_p);\n\n \/\/ Remove the planar inliers, extract the rest\n extract.setNegative (true);\n extract.filter (*cloud_f);\n *cloud_templated = *cloud_f;\n \/\/ cloud_templated.swap (cloud_f);\n i++;\n }\n\n \/\/ Creating the KdTree object for the search method of the extraction\n pcl::search::KdTree::Ptr tree (new pcl::search::KdTree);\n tree->setInputCloud (cloud_templated);\n\n std::vector cluster_indices;\n pcl::EuclideanClusterExtraction ec;\n ec.setClusterTolerance (0.02); \/\/ 0.02 = 2ch\n ec.setMinClusterSize (100); \/\/ parameter\n ec.setMaxClusterSize (25000); \/\/ parameter\n ec.setSearchMethod (tree);\n ec.setInputCloud (cloud_templated);\n ec.extract (cluster_indices);\n\n int j = 0;\n for (std::vector::const_iterator it = cluster_indices.begin ();\n it != cluster_indices.end (); ++it) {\n pcl::PointCloud::Ptr cloud_cluster (new pcl::PointCloud);\n for (std::vector::const_iterator pit = it->indices.begin (); pit != it->indices.end (); pit++)\n cloud_cluster->points.push_back (cloud_templated->points[*pit]); \/\/*\n cloud_cluster->width = cloud_cluster->points.size ();\n cloud_cluster->height = 1;\n cloud_cluster->is_dense = true;\n\n \/\/ Convert data type and publish, but not sure which cluster is published!\n pcl::PCLPointCloud2 out_c;\n sensor_msgs::PointCloud2 output_c;\n pcl::toPCLPointCloud2(*cloud_cluster, out_c);\n pcl_conversions::fromPCL(out_c, output_c);\n pub_p.publish(output_c);\n j++;\n }\n\n \/\/ Convert to ROS data type\n pcl::PCLPointCloud2 out_p;\n pcl::PCLPointCloud2 out_f;\n sensor_msgs::PointCloud2 output_p;\n sensor_msgs::PointCloud2 output_f;\n pcl::toPCLPointCloud2(*cloud_p, out_p);\n pcl::toPCLPointCloud2(*cloud_f, out_f);\n pcl_conversions::fromPCL(out_p, output_p);\n pcl_conversions::fromPCL(out_f, output_f);\n pub_p.publish(output_p);\n pub_f.publish(output_f); \n \/\/ output = *input; \/\/ only for debuging\n \/\/ ROS_INFO_STREAM(\"cloud_width:\" << output.width);\n \/\/ pcl_conversions::fromPCL(cloud_filtered, output);\n\n \/\/ Publish the model coefficients\n \/\/ pcl_msgs::ModelCoefficients ros_coefficients;\n \/\/ pcl_msgs::PointIndices ros_inliers;\n \/\/ pcl_conversions::fromPCL(coefficients, ros_coefficients);\n \/\/ pcl_conversions::fromPCL(inliers, ros_inliers);\n \/\/ pub.publish(ros_coefficients);\n \/\/ pub.publish(ros_inliers);\n}\n\nint main (int argc, char** argv) {\n \/\/ Initialize ROS\n ros::init (argc, argv, \"my_pcl_tutorial\");\n ros::NodeHandle nh;\n \n \/\/ Create a ROS subscriber for the input point cloud\n \/\/ when topic \/input is incoming, cloud_cb callback is called\n ros::Subscriber sub = nh.subscribe(\"assemble_cloud\", 1, cloud_cb);\n \n \/\/ Create a ROS publisher for the output point cloud\n \/\/ A node has both of publisheres and subscribers.\n pub_p = nh.advertise(\"output_p\", 1);\n pub_f = nh.advertise(\"output_f\", 1);\n pub_v = nh.advertise(\"output_v\", 1);\n pub_c = nh.advertise(\"cluster_c\", 1);\n \/\/ pub = nh.advertise(\"output\", 1);\n \/\/ pub = nh.advertise(\"output\", 1);\n \/\/ Spin\n ros::spin();\n}\nchanged topic name used for segmentation.#include \n#include \n#include \n\/\/ PCL specific includes\n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n\nros::Publisher pub_v; \/\/ voxel publisher\nros::Publisher pub_p;\nros::Publisher pub_f;\n\/\/ How to avoid hard-coding a topic name?\nros::Publisher pub_c; \/\/ publish cluster\n\nvoid cloud_cb(const sensor_msgs::PointCloud2ConstPtr& input) {\n \/\/ Container for original & filtered data\n pcl::PCLPointCloud2* cloud = new pcl::PCLPointCloud2;\n pcl::PCLPointCloud2ConstPtr cloudPtr(cloud);\n pcl::PCLPointCloud2 cloud_filtered; \/\/ (new pcl::PCLPointCloud2);\n pcl::PointCloud::Ptr cloud_templated (new pcl::PointCloud);\n pcl::PointCloud::Ptr cloud_p (new pcl::PointCloud);\n pcl::PointCloud::Ptr cloud_f (new pcl::PointCloud);\n pcl_conversions::toPCL(*input, *cloud);\n\n \/\/ StatOutlierRemoval\n \/\/ How to use both of SOR and VG?\n \/* pcl::StatisticalOutlierRemoval sor_0;\n sor_0.setInputCloud(cloudPtr);\n sor_0.setMeanK(50);\n sor_0.setStddevMulThresh(1.0);\n sor_0.filter(cloud_filtered); \/\/ fill in an empty variable *\/\n\n \/\/ Downsampling\n pcl::VoxelGrid sor;\n sor.setInputCloud(cloudPtr);\n sor.setLeafSize(0.02f, 0.02f, 0.02f);\n sor.filter(cloud_filtered);\n\n \/\/ Publishing voxel\n sensor_msgs::PointCloud2 output_v;\n pcl_conversions::fromPCL(cloud_filtered, output_v);\n pub_v.publish(output_v);\n\n \/\/ Convert\n pcl::fromPCLPointCloud2(cloud_filtered, *cloud_templated); \/\/ unused\n\n \/* Perform the actual filtering *\/\n \/\/ Create the segmentation object\n pcl::SACSegmentation seg;\n pcl::PointIndices::Ptr inliers (new pcl::PointIndices ());\n pcl::ModelCoefficients::Ptr coefficients (new pcl::ModelCoefficients ());\n seg.setOptimizeCoefficients (true); \/\/ Optional\n \/\/ Mandatory\n seg.setModelType (pcl::SACMODEL_PLANE);\n seg.setMethodType (pcl::SAC_RANSAC);\n seg.setMaxIterations (1000); \/\/ added\n seg.setDistanceThreshold (0.02);\n\n \/* Filtering Object: Extraction *\/\n \/\/ pcl::ExtractIndices extract;\n\n int i = 0, nr_points = (int) cloud_templated->points.size ();\n \/\/ While 30% of the original cloud is still there\n while (cloud_templated->points.size () > 0.3 * nr_points)\n {\n \/\/ Segment the largest planar component from the remaining cloud\n seg.setInputCloud (cloud_templated);\n seg.segment (*inliers, *coefficients);\n if (inliers->indices.size () == 0)\n {\n ROS_INFO(\"Could not estimate a planar model for the given dataset.\");\n break;\n }\n\n \/\/ Extract the inliers\n pcl::ExtractIndices extract;\n extract.setInputCloud (cloud_templated);\n extract.setIndices (inliers);\n extract.setNegative (false);\n\n \/\/ Get the points associated with the planar surface\n extract.filter (*cloud_p);\n\n \/\/ Remove the planar inliers, extract the rest\n extract.setNegative (true);\n extract.filter (*cloud_f);\n *cloud_templated = *cloud_f;\n \/\/ cloud_templated.swap (cloud_f);\n i++;\n }\n\n \/\/ Creating the KdTree object for the search method of the extraction\n pcl::search::KdTree::Ptr tree (new pcl::search::KdTree);\n tree->setInputCloud (cloud_templated);\n\n std::vector cluster_indices;\n pcl::EuclideanClusterExtraction ec;\n ec.setClusterTolerance (0.02); \/\/ 0.02 = 2ch\n ec.setMinClusterSize (100); \/\/ parameter\n ec.setMaxClusterSize (25000); \/\/ parameter\n ec.setSearchMethod (tree);\n ec.setInputCloud (cloud_templated);\n ec.extract (cluster_indices);\n\n int j = 0;\n for (std::vector::const_iterator it = cluster_indices.begin ();\n it != cluster_indices.end (); ++it) {\n pcl::PointCloud::Ptr cloud_cluster (new pcl::PointCloud);\n for (std::vector::const_iterator pit = it->indices.begin (); pit != it->indices.end (); pit++)\n cloud_cluster->points.push_back (cloud_templated->points[*pit]); \/\/*\n cloud_cluster->width = cloud_cluster->points.size ();\n cloud_cluster->height = 1;\n cloud_cluster->is_dense = true;\n\n \/\/ Convert data type and publish, but not sure which cluster is published!\n pcl::PCLPointCloud2 out_c;\n sensor_msgs::PointCloud2 output_c;\n pcl::toPCLPointCloud2(*cloud_cluster, out_c);\n pcl_conversions::fromPCL(out_c, output_c);\n pub_p.publish(output_c);\n j++;\n }\n\n \/\/ Convert to ROS data type\n pcl::PCLPointCloud2 out_p;\n pcl::PCLPointCloud2 out_f;\n sensor_msgs::PointCloud2 output_p;\n sensor_msgs::PointCloud2 output_f;\n pcl::toPCLPointCloud2(*cloud_p, out_p);\n pcl::toPCLPointCloud2(*cloud_f, out_f);\n pcl_conversions::fromPCL(out_p, output_p);\n pcl_conversions::fromPCL(out_f, output_f);\n pub_p.publish(output_p);\n pub_f.publish(output_f); \n \/\/ output = *input; \/\/ only for debuging\n \/\/ ROS_INFO_STREAM(\"cloud_width:\" << output.width);\n \/\/ pcl_conversions::fromPCL(cloud_filtered, output);\n\n \/\/ Publish the model coefficients\n \/\/ pcl_msgs::ModelCoefficients ros_coefficients;\n \/\/ pcl_msgs::PointIndices ros_inliers;\n \/\/ pcl_conversions::fromPCL(coefficients, ros_coefficients);\n \/\/ pcl_conversions::fromPCL(inliers, ros_inliers);\n \/\/ pub.publish(ros_coefficients);\n \/\/ pub.publish(ros_inliers);\n}\n\nint main (int argc, char** argv) {\n \/\/ Initialize ROS\n ros::init (argc, argv, \"my_pcl_tutorial\");\n ros::NodeHandle nh;\n \n \/\/ Create a ROS subscriber for the input point cloud\n \/\/ when topic \/input is incoming, cloud_cb callback is called\n \/\/ \/assemble_cloud -> \/cloud_pcd\n ros::Subscriber sub = nh.subscribe(\"cloud_pcd\", 1, cloud_cb);\n \n \/\/ Create a ROS publisher for the output point cloud\n \/\/ A node has both of publisheres and subscribers.\n pub_p = nh.advertise(\"output_p\", 1);\n pub_f = nh.advertise(\"output_f\", 1);\n pub_v = nh.advertise(\"output_v\", 1);\n pub_c = nh.advertise(\"cluster_c\", 1);\n \/\/ pub = nh.advertise(\"output\", 1);\n \/\/ pub = nh.advertise(\"output\", 1);\n \/\/ Spin\n ros::spin();\n}\n<|endoftext|>"} {"text":"#include \"board\/Board.h\"\n#include \"board\/common\/indicators\/Variables.h\"\n#include \"board\/common\/uart\/Variables.h\"\n#include \"Constants.h\"\n\nRingBuff_t txBuffer[UART_INTERFACES];\nRingBuff_t rxBuffer[UART_INTERFACES];\n\n\/\/\/\n\/\/\/ \\brief Flag determining whether or not UART loopback functionality is enabled.\n\/\/\/ When enabled, all incoming UART traffic is immediately passed on to UART TX.\n\/\/\/\nstatic bool loopbackEnabled[UART_INTERFACES];\n\n\n\/\/\/\n\/\/\/ \\brief ISR used to store incoming data from UART to buffer.\n\/\/\/ @{\n\nISR(USART_RX_vect_0)\n{\n uint8_t data = UDR_0;\n\n if (!loopbackEnabled[0])\n {\n if (!RingBuffer_IsFull(&rxBuffer[0]))\n {\n RingBuffer_Insert(&rxBuffer[0], data);\n UARTreceived = true;\n }\n }\n else\n {\n if (!RingBuffer_IsFull(&txBuffer[0]))\n {\n RingBuffer_Insert(&txBuffer[0], data);\n UCSRB_0 |= (1< 1\nISR(USART_RX_vect_1)\n{\n uint8_t data = UDR_1;\n\n if (!loopbackEnabled[1])\n {\n if (!RingBuffer_IsFull(&rxBuffer[1]))\n {\n RingBuffer_Insert(&rxBuffer[1], data);\n UARTreceived = true;\n }\n }\n else\n {\n if (!RingBuffer_IsFull(&txBuffer[1]))\n {\n RingBuffer_Insert(&txBuffer[1], data);\n UCSRB_1 |= (1< 1\nISR(USART_UDRE_vect_1)\n{\n if (RingBuffer_IsEmpty(&txBuffer[1]))\n {\n \/\/buffer is empty, disable transmit interrupt\n UCSRB_1 &= ~(1<= UART_INTERFACES)\n return;\n\n ATOMIC_BLOCK(ATOMIC_RESTORESTATE)\n {\n switch(channel)\n {\n case 0:\n UCSRA_0 = 0;\n UCSRB_0 = 0;\n UCSRC_0 = 0;\n UBRR_0 = 0;\n break;\n\n #if UART_INTERFACES > 1\n case 1:\n UCSRA_1 = 0;\n UCSRB_1 = 0;\n UCSRC_1 = 0;\n UBRR_1 = 0;\n break;\n #endif\n\n default:\n break;\n }\n }\n\n RingBuffer_InitBuffer(&rxBuffer[channel]);\n RingBuffer_InitBuffer(&txBuffer[channel]);\n}\n\nvoid Board::initUART(uint32_t baudRate, uint8_t channel)\n{\n if (channel >= UART_INTERFACES)\n return;\n\n resetUART(channel);\n\n int32_t baud_count = ((F_CPU \/ 8) + (baudRate \/ 2)) \/ baudRate;\n\n if ((baud_count & 1) && baud_count <= 4096)\n {\n switch(channel)\n {\n case 0:\n UCSRA_0 = (1< 1\n case 1:\n UCSRA_1 = (1<> 1) - 1;\n break;\n\n #if UART_INTERFACES > 1\n case 1:\n UCSRA_1 = 0;\n UBRR_1 = (baud_count >> 1) - 1;\n break;\n #endif\n\n default:\n break;\n }\n }\n\n \/\/8 bit, no parity, 1 stop bit\n \/\/enable receiver, transmitter and receive interrupt\n switch(channel)\n {\n case 0:\n UCSRC_0 = (1< 1\n case 1:\n UCSRC_1 = (1<= UART_INTERFACES)\n return -1;\n\n if (RingBuffer_IsEmpty(&rxBuffer[channel]))\n return -1;\n\n uint8_t data = RingBuffer_Remove(&rxBuffer[channel]);\n\n return data;\n}\n\nint8_t Board::uartWrite(uint8_t channel, uint8_t data)\n{\n if (channel >= UART_INTERFACES)\n return -1;\n\n \/\/if both the outgoing buffer and the UART data register are empty\n \/\/write the byte to the data register directly\n if (RingBuffer_IsEmpty(&txBuffer[channel]))\n {\n switch(channel)\n {\n case 0:\n if (UCSRA_0 & (1< 1\n case 1:\n if (UCSRA_1 & (1<= UART_INTERFACES)\n return;\n\n switch(channel)\n {\n case 0:\n UCSRB_0 |= (1< 1\n case 1:\n UCSRB_1 |= (1<= UART_INTERFACES)\n return;\n\n loopbackEnabled[channel] = state;\n}\n\nbool Board::getUARTloopbackState(uint8_t channel)\n{\n if (channel >= UART_INTERFACES)\n return false;\n\n return loopbackEnabled[channel];\n}fix handling#include \"board\/Board.h\"\n#include \"board\/common\/indicators\/Variables.h\"\n#include \"board\/common\/uart\/Variables.h\"\n#include \"Constants.h\"\n\nRingBuff_t txBuffer[UART_INTERFACES];\nRingBuff_t rxBuffer[UART_INTERFACES];\n\n\/\/\/\n\/\/\/ \\brief Flag determining whether or not UART loopback functionality is enabled.\n\/\/\/ When enabled, all incoming UART traffic is immediately passed on to UART TX.\n\/\/\/\nstatic bool loopbackEnabled[UART_INTERFACES];\n\n\n\/\/\/\n\/\/\/ \\brief ISR used to store incoming data from UART to buffer.\n\/\/\/ @{\n\nISR(USART_RX_vect_0)\n{\n uint8_t data = UDR_0;\n\n if (!loopbackEnabled[0])\n {\n if (!RingBuffer_IsFull(&rxBuffer[0]))\n {\n RingBuffer_Insert(&rxBuffer[0], data);\n UARTreceived = true;\n }\n }\n else\n {\n if (!RingBuffer_IsFull(&txBuffer[0]))\n {\n RingBuffer_Insert(&txBuffer[0], data);\n UCSRB_0 |= (1< 1\nISR(USART_RX_vect_1)\n{\n uint8_t data = UDR_1;\n\n if (!loopbackEnabled[1])\n {\n if (!RingBuffer_IsFull(&rxBuffer[1]))\n {\n RingBuffer_Insert(&rxBuffer[1], data);\n UARTreceived = true;\n }\n }\n else\n {\n if (!RingBuffer_IsFull(&txBuffer[1]))\n {\n RingBuffer_Insert(&txBuffer[1], data);\n UCSRB_1 |= (1< 1\nISR(USART_UDRE_vect_1)\n{\n if (RingBuffer_IsEmpty(&txBuffer[1]))\n {\n \/\/buffer is empty, disable transmit interrupt\n UCSRB_1 &= ~(1<= UART_INTERFACES)\n return;\n\n ATOMIC_BLOCK(ATOMIC_RESTORESTATE)\n {\n switch(channel)\n {\n case 0:\n UCSRA_0 = 0;\n UCSRB_0 = 0;\n UCSRC_0 = 0;\n UBRR_0 = 0;\n break;\n\n #if UART_INTERFACES > 1\n case 1:\n UCSRA_1 = 0;\n UCSRB_1 = 0;\n UCSRC_1 = 0;\n UBRR_1 = 0;\n break;\n #endif\n\n default:\n break;\n }\n }\n\n RingBuffer_InitBuffer(&rxBuffer[channel]);\n RingBuffer_InitBuffer(&txBuffer[channel]);\n}\n\nvoid Board::initUART(uint32_t baudRate, uint8_t channel)\n{\n if (channel >= UART_INTERFACES)\n return;\n\n resetUART(channel);\n\n int32_t baud_count = ((F_CPU \/ 8) + (baudRate \/ 2)) \/ baudRate;\n\n if ((baud_count & 1) && baud_count <= 4096)\n {\n switch(channel)\n {\n case 0:\n UCSRA_0 = (1< 1\n case 1:\n UCSRA_1 = (1<> 1) - 1;\n break;\n\n #if UART_INTERFACES > 1\n case 1:\n UCSRA_1 = 0;\n UBRR_1 = (baud_count >> 1) - 1;\n break;\n #endif\n\n default:\n break;\n }\n }\n\n \/\/8 bit, no parity, 1 stop bit\n \/\/enable receiver, transmitter and receive interrupt\n switch(channel)\n {\n case 0:\n UCSRC_0 = (1< 1\n case 1:\n UCSRC_1 = (1<= UART_INTERFACES)\n return -1;\n\n if (RingBuffer_IsEmpty(&rxBuffer[channel]))\n return -1;\n\n uint8_t data = RingBuffer_Remove(&rxBuffer[channel]);\n\n return data;\n}\n\nint8_t Board::uartWrite(uint8_t channel, uint8_t data)\n{\n if (channel >= UART_INTERFACES)\n return -1;\n\n \/\/if both the outgoing buffer and the UART data register are empty\n \/\/write the byte to the data register directly\n if (RingBuffer_IsEmpty(&txBuffer[channel]))\n {\n switch(channel)\n {\n case 0:\n if (UCSRA_0 & (1< 1\n case 1:\n if (UCSRA_1 & (1<= UART_INTERFACES)\n return;\n\n switch(channel)\n {\n case 0:\n UCSRB_0 |= (1< 1\n case 1:\n UCSRB_1 |= (1<= UART_INTERFACES)\n return;\n\n loopbackEnabled[channel] = state;\n}\n\nbool Board::getUARTloopbackState(uint8_t channel)\n{\n if (channel >= UART_INTERFACES)\n return false;\n\n return loopbackEnabled[channel];\n}<|endoftext|>"} {"text":"\/*\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 \"sphere_user.hpp\"\n#include \n\n#include \n\n\nstatic fc2d_clawpack46_vtable_t classic_claw;\n\nstatic fclaw2d_vtable_t vt;\n\nvoid sphere_link_solvers(fclaw2d_domain_t *domain)\n{\n fclaw2d_init_vtable(&vt);\n fc2d_clawpack46_init_vtable(&classic_claw);\n\n vt.problem_setup = &fc2d_clawpack46_setprob;\n classic_claw.setprob = &SETPROB;\n\n vt.patch_setup = &sphere_patch_manifold_setup;\n \/* classic_claw.setaux = &SETAUX_SPHERE; *\/\n\n vt.patch_initialize = &fc2d_clawpack46_qinit;\n classic_claw.qinit = &QINIT;\n\n vt.patch_physical_bc = &fc2d_clawpack46_bc2; \/* Needed for lat-long grid *\/\n\n vt.patch_single_step_update = &fc2d_clawpack46_update; \/* Includes b4step2 and src2 *\/\n classic_claw.b4step2 = &B4STEP2;\n classic_claw.rpn2 = &RPN2;\n classic_claw.rpt2 = &RPT2;\n\n\n fclaw2d_set_vtable(domain,&vt);\n fc2d_clawpack46_set_vtable(&classic_claw);\n\n}\n\nvoid sphere_patch_manifold_setup(fclaw2d_domain_t *domain,\n fclaw2d_patch_t *this_patch,\n int this_block_idx,\n int this_patch_idx)\n{\n int mx,my,mbc,maux;\n double xlower,ylower,dx,dy;\n double *aux;\n double *xnormals, *ynormals,*xtangents;\n double *ytangents,*surfnormals;\n double *edgelengths, *curvature;\n\n fc2d_clawpack46_define_auxarray(domain,this_patch);\n\n fclaw2d_clawpatch_grid_data(domain,this_patch,&mx,&my,&mbc,\n &xlower,&ylower,&dx,&dy);\n\n fc2d_clawpack46_aux_data(domain,this_patch,&aux,&maux);\n fclaw2d_clawpatch_metric_data2(domain,this_patch,&xnormals,&ynormals,\n &xtangents,&ytangents,&surfnormals,\n &edgelengths,&curvature);\n\n SETAUX_SPHERE(&mx,&my,&mbc,&xlower,&ylower,\n &dx,&dy,&maux,aux,xnormals,ynormals,\n xtangents,ytangents,surfnormals);\n\n fc2d_clawpack46_set_capacity(domain,this_patch,this_block_idx,this_patch_idx);\n}\n(SWE\/sphere) Set virtual function for computing area\/*\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 \"sphere_user.hpp\"\n#include \n\n#include \n\n\nstatic fc2d_clawpack46_vtable_t classic_claw;\n\nstatic fclaw2d_vtable_t vt;\n\nvoid sphere_link_solvers(fclaw2d_domain_t *domain)\n{\n fclaw2d_init_vtable(&vt);\n fc2d_clawpack46_init_vtable(&classic_claw);\n\n vt.problem_setup = &fc2d_clawpack46_setprob;\n classic_claw.setprob = &SETPROB;\n\n vt.patch_setup = &sphere_patch_manifold_setup;\n \/* classic_claw.setaux = &SETAUX_SPHERE; *\/\n\n vt.patch_initialize = &fc2d_clawpack46_qinit;\n classic_claw.qinit = &QINIT;\n\n vt.patch_physical_bc = &fc2d_clawpack46_bc2; \/* Needed for lat-long grid *\/\n\n vt.metric_compute_area = &fclaw2d_metric_compute_area;\n\n vt.patch_single_step_update = &fc2d_clawpack46_update; \/* Includes b4step2 and src2 *\/\n classic_claw.b4step2 = &B4STEP2;\n classic_claw.rpn2 = &RPN2;\n classic_claw.rpt2 = &RPT2;\n\n\n fclaw2d_set_vtable(domain,&vt);\n fc2d_clawpack46_set_vtable(&classic_claw);\n\n}\n\nvoid sphere_patch_manifold_setup(fclaw2d_domain_t *domain,\n fclaw2d_patch_t *this_patch,\n int this_block_idx,\n int this_patch_idx)\n{\n int mx,my,mbc,maux;\n double xlower,ylower,dx,dy;\n double *aux;\n double *xnormals, *ynormals,*xtangents;\n double *ytangents,*surfnormals;\n double *edgelengths, *curvature;\n\n fc2d_clawpack46_define_auxarray(domain,this_patch);\n\n fclaw2d_clawpatch_grid_data(domain,this_patch,&mx,&my,&mbc,\n &xlower,&ylower,&dx,&dy);\n\n fc2d_clawpack46_aux_data(domain,this_patch,&aux,&maux);\n fclaw2d_clawpatch_metric_data2(domain,this_patch,&xnormals,&ynormals,\n &xtangents,&ytangents,&surfnormals,\n &edgelengths,&curvature);\n\n SETAUX_SPHERE(&mx,&my,&mbc,&xlower,&ylower,\n &dx,&dy,&maux,aux,xnormals,ynormals,\n xtangents,ytangents,surfnormals);\n\n fc2d_clawpack46_set_capacity(domain,this_patch,this_block_idx,this_patch_idx);\n}\n<|endoftext|>"} {"text":"\/*************************************************************************\n *\n * $RCSfile: borderconn.hxx,v $\n *\n * $Revision: 1.2 $\n *\n * last change: $Author: hr $ $Date: 2004-08-02 17:42: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 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 SVX_BORDERCONN_HXX\n#define SVX_BORDERCONN_HXX\n\n#ifndef SFX_ITEMCONNECT_HXX\n#include \n#endif\n#ifndef SVX_FRAMEBORDERTYPE_HXX\n#include \"framebordertype.hxx\"\n#endif\n\nclass SfxItemSet;\nclass MetricField;\nclass ValueSet;\nclass ColorListBox;\n\nnamespace svx {\n\nclass FrameSelector;\n\n\/\/ ============================================================================\n\n\/** Creates an item connection object that connects an SvxLineItem with an\n svx::FrameSelector control. *\/\nsfx::ItemConnectionBase* CreateFrameLineConnection( USHORT nSlot,\n FrameSelector& rFrameSel, FrameBorderType eBorder,\n sfx::ItemConnFlags nFlags = sfx::ITEMCONN_DEFAULT );\n\n\/** Creates an item connection object that connects an SvxBoxItem and an\n SvxBoxInfoItem with an svx::FrameSelector control. *\/\nsfx::ItemConnectionBase* CreateFrameBoxConnection(\n USHORT nBoxSlot, USHORT nBoxInfoSlot,\n FrameSelector& rFrameSel, FrameBorderType eBorder,\n sfx::ItemConnFlags nFlags = sfx::ITEMCONN_DEFAULT );\n\n\/** Creates an item connection object that connects an SvxMarginItem with the\n controls of the SvxBorderTabPage. *\/\nsfx::ItemConnectionBase* CreateMarginConnection( const SfxItemSet& rItemSet,\n MetricField& rMfLeft, MetricField& rMfRight,\n MetricField& rMfTop, MetricField& rMfBottom,\n sfx::ItemConnFlags nFlags = sfx::ITEMCONN_DEFAULT );\n\n\/** Creates an item connection object that connects an SvxShadowItem with the\n controls of the SvxBorderTabPage. *\/\nsfx::ItemConnectionBase* CreateShadowConnection( const SfxItemSet& rItemSet,\n ValueSet& rVsPos, MetricField& rMfSize, ColorListBox& rLbColor,\n sfx::ItemConnFlags nFlags = sfx::ITEMCONN_DEFAULT );\n\n\/\/ ============================================================================\n\n} \/\/ namespace svx\n\n#endif\n\nINTEGRATION: CWS visibility01 (1.2.142); FILE MERGED 2004\/11\/19 12:54:56 mmeeks 1.2.142.1: Issue number: #i35758# Submitted by: mnicel Reviewed by: mmeeks\/*************************************************************************\n *\n * $RCSfile: borderconn.hxx,v $\n *\n * $Revision: 1.3 $\n *\n * last change: $Author: kz $ $Date: 2005-01-21 16:28: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 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 SVX_BORDERCONN_HXX\n#define SVX_BORDERCONN_HXX\n\n#ifndef SFX_ITEMCONNECT_HXX\n#include \n#endif\n#ifndef SVX_FRAMEBORDERTYPE_HXX\n#include \"framebordertype.hxx\"\n#endif\n\n#ifndef INCLUDED_SVXDLLAPI_H\n#include \"svx\/svxdllapi.h\"\n#endif\n\nclass SfxItemSet;\nclass MetricField;\nclass ValueSet;\nclass ColorListBox;\n\nnamespace svx {\n\nclass FrameSelector;\n\n\/\/ ============================================================================\n\n\/** Creates an item connection object that connects an SvxLineItem with an\n svx::FrameSelector control. *\/\nSVX_DLLPUBLIC sfx::ItemConnectionBase* CreateFrameLineConnection( USHORT nSlot,\n FrameSelector& rFrameSel, FrameBorderType eBorder,\n sfx::ItemConnFlags nFlags = sfx::ITEMCONN_DEFAULT );\n\n\/** Creates an item connection object that connects an SvxBoxItem and an\n SvxBoxInfoItem with an svx::FrameSelector control. *\/\nsfx::ItemConnectionBase* CreateFrameBoxConnection(\n USHORT nBoxSlot, USHORT nBoxInfoSlot,\n FrameSelector& rFrameSel, FrameBorderType eBorder,\n sfx::ItemConnFlags nFlags = sfx::ITEMCONN_DEFAULT );\n\n\/** Creates an item connection object that connects an SvxMarginItem with the\n controls of the SvxBorderTabPage. *\/\nSVX_DLLPUBLIC sfx::ItemConnectionBase* CreateMarginConnection( const SfxItemSet& rItemSet,\n MetricField& rMfLeft, MetricField& rMfRight,\n MetricField& rMfTop, MetricField& rMfBottom,\n sfx::ItemConnFlags nFlags = sfx::ITEMCONN_DEFAULT );\n\n\/** Creates an item connection object that connects an SvxShadowItem with the\n controls of the SvxBorderTabPage. *\/\nSVX_DLLPUBLIC sfx::ItemConnectionBase* CreateShadowConnection( const SfxItemSet& rItemSet,\n ValueSet& rVsPos, MetricField& rMfSize, ColorListBox& rLbColor,\n sfx::ItemConnFlags nFlags = sfx::ITEMCONN_DEFAULT );\n\n\/\/ ============================================================================\n\n} \/\/ namespace svx\n\n#endif\n\n<|endoftext|>"} {"text":"\/\/\n\/\/ ADSREnvelope.hpp\n\/\/ AudioKit Core\n\/\/\n\/\/ Created by Shane Dunne, revision history on Github.\n\/\/ Copyright © 2018 AudioKit. All rights reserved.\n\/\/\n\n#include \"ADSREnvelope.hpp\"\n#include \n\nnamespace AudioKitCore\n{\n\n ADSREnvelopeParameters::ADSREnvelopeParameters()\n : sampleRateHz(44100.0f) \/\/ a guess, will be overridden later by a call to init(,,,,)\n {\n init(0.0f, 0.0f, 1.0f, 0.0f);\n }\n \n void ADSREnvelopeParameters::init(float attackSeconds, float decaySeconds, float susFraction, float releaseSeconds)\n {\n attackSamples = attackSeconds * sampleRateHz;\n decaySamples = decaySeconds * sampleRateHz;\n sustainFraction = susFraction;\n releaseSamples = releaseSeconds * sampleRateHz;\n }\n \n void ADSREnvelopeParameters::init(float newSampleRateHz, float attackSeconds, float decaySeconds, float susFraction, float releaseSeconds)\n {\n sampleRateHz = newSampleRateHz;\n init(attackSeconds, decaySeconds, susFraction, releaseSeconds);\n }\n \n void ADSREnvelopeParameters::updateSampleRate(float newSampleRateHz)\n {\n float scaleFactor = newSampleRateHz \/ sampleRateHz;\n sampleRateHz = newSampleRateHz;\n attackSamples *= scaleFactor;\n decaySamples *= scaleFactor;\n releaseSamples *= scaleFactor;\n }\n \n \n void ADSREnvelope::init()\n {\n segment = kIdle;\n ramper.init(0.0f);\n }\n \n void ADSREnvelope::start()\n {\n \/\/ have to make attack go above 1.0, or decay won't work if sustain is 1.0\n ramper.init(0.0f, 1.01f, pParameters->attackSamples);\n segment = kAttack;\n }\n \n void ADSREnvelope::release()\n {\n segment = kRelease;\n if (ramper.value != 0.0f)\n ramper.reinit(0.0f, pParameters->releaseSamples);\n }\n\n void ADSREnvelope::restart()\n {\n segment = kSilence;\n if (ramper.value != 0.0f)\n ramper.reinit(0.0f, pParameters->releaseSamples);\n }\n\n void ADSREnvelope::reset()\n {\n ramper.init(0.0f);\n segment = kIdle;\n }\n\n}\nFurther fixes for AKSampler release bug\/\/\n\/\/ ADSREnvelope.hpp\n\/\/ AudioKit Core\n\/\/\n\/\/ Created by Shane Dunne, revision history on Github.\n\/\/ Copyright © 2018 AudioKit. All rights reserved.\n\/\/\n\n#include \"ADSREnvelope.hpp\"\n#include \n\nnamespace AudioKitCore\n{\n\n ADSREnvelopeParameters::ADSREnvelopeParameters()\n : sampleRateHz(44100.0f) \/\/ a guess, will be overridden later by a call to init(,,,,)\n {\n init(0.0f, 0.0f, 1.0f, 0.0f);\n }\n \n void ADSREnvelopeParameters::init(float attackSeconds, float decaySeconds, float susFraction, float releaseSeconds)\n {\n attackSamples = attackSeconds * sampleRateHz;\n decaySamples = decaySeconds * sampleRateHz;\n sustainFraction = susFraction;\n releaseSamples = releaseSeconds * sampleRateHz;\n }\n \n void ADSREnvelopeParameters::init(float newSampleRateHz, float attackSeconds, float decaySeconds, float susFraction, float releaseSeconds)\n {\n sampleRateHz = newSampleRateHz;\n init(attackSeconds, decaySeconds, susFraction, releaseSeconds);\n }\n \n void ADSREnvelopeParameters::updateSampleRate(float newSampleRateHz)\n {\n float scaleFactor = newSampleRateHz \/ sampleRateHz;\n sampleRateHz = newSampleRateHz;\n attackSamples *= scaleFactor;\n decaySamples *= scaleFactor;\n releaseSamples *= scaleFactor;\n }\n \n \n void ADSREnvelope::init()\n {\n segment = kIdle;\n ramper.init(0.0f);\n }\n \n void ADSREnvelope::start()\n {\n \/\/ have to make attack go above 1.0, or decay won't work if sustain is 1.0\n ramper.init(0.0f, 1.01f, pParameters->attackSamples);\n segment = kAttack;\n }\n \n void ADSREnvelope::release()\n {\n if (ramper.value == 0.0f) init();\n else\n {\n segment = kRelease;\n ramper.reinit(0.0f, pParameters->releaseSamples);\n }\n }\n\n void ADSREnvelope::restart()\n {\n if (ramper.value == 0.0f) init();\n else\n {\n segment = kSilence;\n ramper.reinit(0.0f, 0.01f * pParameters->sampleRateHz); \/\/ always silence in 10 ms\n }\n }\n\n void ADSREnvelope::reset()\n {\n init();\n }\n\n}\n<|endoftext|>"} {"text":"\/*\n * Copyright (C) 2014 Pavel Kirienko \n *\/\n\n#include \n#include \n#include \n#include \n\n\nTEST(FloatSpec, Limits)\n{\n using uavcan::FloatSpec;\n using uavcan::CastModeSaturate;\n using uavcan::CastModeTruncate;\n\n typedef FloatSpec<16, CastModeSaturate> F16S;\n typedef FloatSpec<16, CastModeTruncate> F16T;\n typedef FloatSpec<32, CastModeSaturate> F32S;\n typedef FloatSpec<32, CastModeTruncate> F32T;\n typedef FloatSpec<64, CastModeSaturate> F64S;\n typedef FloatSpec<64, CastModeTruncate> F64T;\n\n ASSERT_FALSE(F16S::IsExactRepresentation);\n ASSERT_FLOAT_EQ(65504.0, F16S::max());\n ASSERT_FLOAT_EQ(9.77e-04, F16S::epsilon());\n\n ASSERT_TRUE(F32T::IsExactRepresentation);\n ASSERT_FLOAT_EQ(std::numeric_limits::max(), F32T::max());\n ASSERT_FLOAT_EQ(std::numeric_limits::epsilon(), F32T::epsilon());\n\n ASSERT_TRUE(F64S::IsExactRepresentation);\n ASSERT_FLOAT_EQ(std::numeric_limits::max(), F64S::max());\n ASSERT_FLOAT_EQ(std::numeric_limits::epsilon(), F64S::epsilon());\n}\n\nTEST(FloatSpec, Basic)\n{\n using uavcan::FloatSpec;\n using uavcan::CastModeSaturate;\n using uavcan::CastModeTruncate;\n using uavcan::StorageType;\n\n typedef FloatSpec<16, CastModeSaturate> F16S;\n typedef FloatSpec<16, CastModeTruncate> F16T;\n typedef FloatSpec<32, CastModeSaturate> F32S;\n typedef FloatSpec<32, CastModeTruncate> F32T;\n typedef FloatSpec<64, CastModeSaturate> F64S;\n typedef FloatSpec<64, CastModeTruncate> F64T;\n\n static const long double Values[] =\n {\n 0.0,\n 1.0,\n M_PI,\n 123,\n -123,\n 99999,\n -999999,\n std::numeric_limits::max(),\n -std::numeric_limits::max(),\n std::numeric_limits::infinity(),\n -std::numeric_limits::infinity(),\n nanl(\"\")\n };\n static const int NumValues = sizeof(Values) \/ sizeof(Values[0]);\n\n static const long double ValuesF16S[] =\n {\n 0.0,\n 1.0,\n 3.140625,\n 123,\n -123,\n F16S::max(),\n -F16S::max(),\n F16S::max(),\n -F16S::max(),\n std::numeric_limits::infinity(),\n -std::numeric_limits::infinity(),\n nanl(\"\")\n };\n static const long double ValuesF16T[] =\n {\n 0.0,\n 1.0,\n 3.140625,\n 123,\n -123,\n std::numeric_limits::infinity(),\n -std::numeric_limits::infinity(),\n std::numeric_limits::infinity(),\n -std::numeric_limits::infinity(),\n std::numeric_limits::infinity(),\n -std::numeric_limits::infinity(),\n nanl(\"\")\n };\n\n \/*\n * Writing\n *\/\n uavcan::StaticTransferBuffer buf;\n uavcan::BitStream bs_wr(buf);\n uavcan::ScalarCodec sc_wr(bs_wr);\n\n for (int i = 0; i < NumValues; i++)\n {\n ASSERT_EQ(1, F16S::encode(Values[i], sc_wr, uavcan::TailArrayOptDisabled));\n ASSERT_EQ(1, F16T::encode(Values[i], sc_wr, uavcan::TailArrayOptDisabled));\n ASSERT_EQ(1, F32S::encode(Values[i], sc_wr, uavcan::TailArrayOptDisabled));\n ASSERT_EQ(1, F32T::encode(Values[i], sc_wr, uavcan::TailArrayOptDisabled));\n ASSERT_EQ(1, F64S::encode(Values[i], sc_wr, uavcan::TailArrayOptDisabled));\n ASSERT_EQ(1, F64T::encode(Values[i], sc_wr, uavcan::TailArrayOptDisabled));\n }\n\n ASSERT_EQ(0, F16S::encode(0, sc_wr, uavcan::TailArrayOptDisabled)); \/\/ Out of buffer space now\n\n \/*\n * Reading\n *\/\n uavcan::BitStream bs_rd(buf);\n uavcan::ScalarCodec sc_rd(bs_rd);\n\n#define CHECK(FloatType, expected_value) \\\n do { \\\n StorageType::Type var = StorageType::Type(); \\\n ASSERT_EQ(1, FloatType::decode(var, sc_rd, uavcan::TailArrayOptDisabled)); \\\n if (!isnan(expected_value)) { \\\n ASSERT_FLOAT_EQ(expected_value, var); } \\\n else { \\\n ASSERT_EQ(!!isnan(expected_value), !!isnan(var)); } \\\n } while (0)\n\n for (int i = 0; i < NumValues; i++)\n {\n CHECK(F16S, ValuesF16S[i]);\n CHECK(F16T, ValuesF16T[i]);\n CHECK(F32S, Values[i]);\n CHECK(F32T, Values[i]);\n CHECK(F64S, Values[i]);\n CHECK(F64T, Values[i]);\n }\n\n#undef CHECK\n}\n\nTEST(FloatSpec, Float16Representation)\n{\n using uavcan::FloatSpec;\n using uavcan::CastModeSaturate;\n using uavcan::CastModeTruncate;\n\n typedef FloatSpec<16, CastModeSaturate> F16S;\n typedef FloatSpec<16, CastModeTruncate> F16T;\n\n uavcan::StaticTransferBuffer<2 * 6> buf;\n uavcan::BitStream bs_wr(buf);\n uavcan::ScalarCodec sc_wr(bs_wr);\n\n ASSERT_EQ(1, F16S::encode(0.0, sc_wr, uavcan::TailArrayOptDisabled));\n ASSERT_EQ(1, F16S::encode(1.0, sc_wr, uavcan::TailArrayOptDisabled));\n ASSERT_EQ(1, F16S::encode(-2.0, sc_wr, uavcan::TailArrayOptDisabled));\n ASSERT_EQ(1, F16T::encode(999999, sc_wr, uavcan::TailArrayOptDisabled)); \/\/ +inf\n ASSERT_EQ(1, F16S::encode(-999999, sc_wr, uavcan::TailArrayOptDisabled)); \/\/ -max\n ASSERT_EQ(1, F16S::encode(nan(\"\"), sc_wr, uavcan::TailArrayOptDisabled)); \/\/ nan\n\n ASSERT_EQ(0, F16S::encode(0, sc_wr, uavcan::TailArrayOptDisabled)); \/\/ Out of buffer space now\n\n \/\/ Keep in mind that this is LITTLE ENDIAN representation\n static const std::string Reference =\n \"00000000 00000000 \" \/\/ 0.0\n \"00000000 00111100 \" \/\/ 1.0\n \"00000000 11000000 \" \/\/ -2.0\n \"00000000 01111100 \" \/\/ +inf\n \"11111111 11111011 \" \/\/ -max\n \"11111111 01111111\"; \/\/ nan\n\n ASSERT_EQ(Reference, bs_wr.toString());\n}\nlibuavcan test: removed unused local type declarations\/*\n * Copyright (C) 2014 Pavel Kirienko \n *\/\n\n#include \n#include \n#include \n#include \n\n\nTEST(FloatSpec, Limits)\n{\n using uavcan::FloatSpec;\n using uavcan::CastModeSaturate;\n using uavcan::CastModeTruncate;\n\n typedef FloatSpec<16, CastModeSaturate> F16S;\n typedef FloatSpec<32, CastModeTruncate> F32T;\n typedef FloatSpec<64, CastModeSaturate> F64S;\n\n ASSERT_FALSE(F16S::IsExactRepresentation);\n ASSERT_FLOAT_EQ(65504.0, F16S::max());\n ASSERT_FLOAT_EQ(9.77e-04, F16S::epsilon());\n\n ASSERT_TRUE(F32T::IsExactRepresentation);\n ASSERT_FLOAT_EQ(std::numeric_limits::max(), F32T::max());\n ASSERT_FLOAT_EQ(std::numeric_limits::epsilon(), F32T::epsilon());\n\n ASSERT_TRUE(F64S::IsExactRepresentation);\n ASSERT_FLOAT_EQ(std::numeric_limits::max(), F64S::max());\n ASSERT_FLOAT_EQ(std::numeric_limits::epsilon(), F64S::epsilon());\n}\n\nTEST(FloatSpec, Basic)\n{\n using uavcan::FloatSpec;\n using uavcan::CastModeSaturate;\n using uavcan::CastModeTruncate;\n using uavcan::StorageType;\n\n typedef FloatSpec<16, CastModeSaturate> F16S;\n typedef FloatSpec<16, CastModeTruncate> F16T;\n typedef FloatSpec<32, CastModeSaturate> F32S;\n typedef FloatSpec<32, CastModeTruncate> F32T;\n typedef FloatSpec<64, CastModeSaturate> F64S;\n typedef FloatSpec<64, CastModeTruncate> F64T;\n\n static const long double Values[] =\n {\n 0.0,\n 1.0,\n M_PI,\n 123,\n -123,\n 99999,\n -999999,\n std::numeric_limits::max(),\n -std::numeric_limits::max(),\n std::numeric_limits::infinity(),\n -std::numeric_limits::infinity(),\n nanl(\"\")\n };\n static const int NumValues = sizeof(Values) \/ sizeof(Values[0]);\n\n static const long double ValuesF16S[] =\n {\n 0.0,\n 1.0,\n 3.140625,\n 123,\n -123,\n F16S::max(),\n -F16S::max(),\n F16S::max(),\n -F16S::max(),\n std::numeric_limits::infinity(),\n -std::numeric_limits::infinity(),\n nanl(\"\")\n };\n static const long double ValuesF16T[] =\n {\n 0.0,\n 1.0,\n 3.140625,\n 123,\n -123,\n std::numeric_limits::infinity(),\n -std::numeric_limits::infinity(),\n std::numeric_limits::infinity(),\n -std::numeric_limits::infinity(),\n std::numeric_limits::infinity(),\n -std::numeric_limits::infinity(),\n nanl(\"\")\n };\n\n \/*\n * Writing\n *\/\n uavcan::StaticTransferBuffer buf;\n uavcan::BitStream bs_wr(buf);\n uavcan::ScalarCodec sc_wr(bs_wr);\n\n for (int i = 0; i < NumValues; i++)\n {\n ASSERT_EQ(1, F16S::encode(Values[i], sc_wr, uavcan::TailArrayOptDisabled));\n ASSERT_EQ(1, F16T::encode(Values[i], sc_wr, uavcan::TailArrayOptDisabled));\n ASSERT_EQ(1, F32S::encode(Values[i], sc_wr, uavcan::TailArrayOptDisabled));\n ASSERT_EQ(1, F32T::encode(Values[i], sc_wr, uavcan::TailArrayOptDisabled));\n ASSERT_EQ(1, F64S::encode(Values[i], sc_wr, uavcan::TailArrayOptDisabled));\n ASSERT_EQ(1, F64T::encode(Values[i], sc_wr, uavcan::TailArrayOptDisabled));\n }\n\n ASSERT_EQ(0, F16S::encode(0, sc_wr, uavcan::TailArrayOptDisabled)); \/\/ Out of buffer space now\n\n \/*\n * Reading\n *\/\n uavcan::BitStream bs_rd(buf);\n uavcan::ScalarCodec sc_rd(bs_rd);\n\n#define CHECK(FloatType, expected_value) \\\n do { \\\n StorageType::Type var = StorageType::Type(); \\\n ASSERT_EQ(1, FloatType::decode(var, sc_rd, uavcan::TailArrayOptDisabled)); \\\n if (!isnan(expected_value)) { \\\n ASSERT_FLOAT_EQ(expected_value, var); } \\\n else { \\\n ASSERT_EQ(!!isnan(expected_value), !!isnan(var)); } \\\n } while (0)\n\n for (int i = 0; i < NumValues; i++)\n {\n CHECK(F16S, ValuesF16S[i]);\n CHECK(F16T, ValuesF16T[i]);\n CHECK(F32S, Values[i]);\n CHECK(F32T, Values[i]);\n CHECK(F64S, Values[i]);\n CHECK(F64T, Values[i]);\n }\n\n#undef CHECK\n}\n\nTEST(FloatSpec, Float16Representation)\n{\n using uavcan::FloatSpec;\n using uavcan::CastModeSaturate;\n using uavcan::CastModeTruncate;\n\n typedef FloatSpec<16, CastModeSaturate> F16S;\n typedef FloatSpec<16, CastModeTruncate> F16T;\n\n uavcan::StaticTransferBuffer<2 * 6> buf;\n uavcan::BitStream bs_wr(buf);\n uavcan::ScalarCodec sc_wr(bs_wr);\n\n ASSERT_EQ(1, F16S::encode(0.0, sc_wr, uavcan::TailArrayOptDisabled));\n ASSERT_EQ(1, F16S::encode(1.0, sc_wr, uavcan::TailArrayOptDisabled));\n ASSERT_EQ(1, F16S::encode(-2.0, sc_wr, uavcan::TailArrayOptDisabled));\n ASSERT_EQ(1, F16T::encode(999999, sc_wr, uavcan::TailArrayOptDisabled)); \/\/ +inf\n ASSERT_EQ(1, F16S::encode(-999999, sc_wr, uavcan::TailArrayOptDisabled)); \/\/ -max\n ASSERT_EQ(1, F16S::encode(nan(\"\"), sc_wr, uavcan::TailArrayOptDisabled)); \/\/ nan\n\n ASSERT_EQ(0, F16S::encode(0, sc_wr, uavcan::TailArrayOptDisabled)); \/\/ Out of buffer space now\n\n \/\/ Keep in mind that this is LITTLE ENDIAN representation\n static const std::string Reference =\n \"00000000 00000000 \" \/\/ 0.0\n \"00000000 00111100 \" \/\/ 1.0\n \"00000000 11000000 \" \/\/ -2.0\n \"00000000 01111100 \" \/\/ +inf\n \"11111111 11111011 \" \/\/ -max\n \"11111111 01111111\"; \/\/ nan\n\n ASSERT_EQ(Reference, bs_wr.toString());\n}\n<|endoftext|>"} {"text":"#include \"ContainerWithMostWater.hpp\"\n\n#include \nusing namespace std;\n\nint Solution::maxArea(vector& height)\n{\n if (height.size() < 2) return 0;\n\n int i = 0;\n int j = height.size() - 1;\n int area = min(height[i], height[j]) * (j - i);\n\n while (i < j) {\n if (height[i] < height[j]) {\n int k = i + 1;\n while (k < j) {\n if (height[k] > height[i] && min(height[k], height[j]) * (j - k) > area)\n area = min(height[k], height[j]) * (j - k);\n if (height[k] > height[j]) break;\n k++;\n }\n if (k == j) break;\n else i = k;\n } else {\n int k = j - 1;\n while (k > i) {\n if (height[k] > height[j] && min(height[k], height[i]) * (k - i) > area)\n area = min(height[k], height[i]) * (k - i);\n if (height[k] > height[i]) break;\n k--;\n }\n if (k == i) break;\n else j = k;\n }\n }\n return area;\n}\nUpdate Problem 11 solution#include \"ContainerWithMostWater.hpp\"\n\n#include \nusing namespace std;\n\nint Solution::maxArea(vector& height)\n{\n if (height.size() < 2) return 0;\n\n int i = 0;\n int j = height.size() - 1;\n int area = min(height[i], height[j]) * (j - i);\n\n while (i < j) {\n area = max(area, min(height[i], height[j]) * (j - i));\n if (height[i] < height[j]) i++;\n else j--;\n }\n return area;\n}\n<|endoftext|>"} {"text":"\/*-------------------------------------------------------------------------\n *\n * plan_transformer.cpp\n * file description\n *\n * Copyright(c) 2015, CMU\n *\n * \/n-store\/src\/bridge\/plan_transformer.cpp\n *\n *-------------------------------------------------------------------------\n *\/\n\n#include \"nodes\/pprint.h\"\n#include \"utils\/rel.h\"\n#include \"bridge\/bridge.h\"\n#include \"executor\/executor.h\"\n\n#include \"backend\/bridge\/plan_transformer.h\"\n#include \"backend\/bridge\/tuple_transformer.h\"\n#include \"backend\/storage\/data_table.h\"\n#include \"backend\/planner\/insert_node.h\"\n\nvoid printPlanStateTree(const PlanState * planstate);\n\nnamespace peloton {\nnamespace bridge {\n\n\/**\n * @brief Get an instance of the plan transformer.\n * @return The instance.\n *\/\nPlanTransformer& PlanTransformer::GetInstance() {\n static PlanTransformer planTransformer;\n return planTransformer;\n}\n\n\/**\n * @brief Pretty print the plan state tree.\n * @return none.\n *\/\nvoid PlanTransformer::PrintPlanState(const PlanState *plan_state) const {\n printPlanStateTree(plan_state);\n}\n\n\/**\n * @brief Convert Postgres PlanState into AbstractPlanNode.\n * @return Pointer to the constructed AbstractPlanNode.\n *\/\nplanner::AbstractPlanNode *PlanTransformer::TransformPlan(const PlanState *plan_state) {\n\n Plan *plan = plan_state->plan;\n planner::AbstractPlanNode *plan_node;\n\n switch (nodeTag(plan)) {\n case T_ModifyTable:\n plan_node = PlanTransformer::TransformModifyTable(reinterpret_cast(plan_state));\n break;\n case T_SeqScan:\n plan_node = PlanTransformer::TransformSeqScan(reinterpret_cast(plan_state));\n break;\n default:\n plan_node = nullptr;\n break;\n }\n\n return plan_node;\n}\n\n\/**\n * @brief Convert ModifyTableState into AbstractPlanNode.\n * @return Pointer to the constructed AbstractPlanNode.\n *\/\nplanner::AbstractPlanNode *PlanTransformer::TransformModifyTable(\n const ModifyTableState *mt_plan_state) {\n\n \/* TODO: handle UPDATE, DELETE *\/\n \/* TODO: Add logging *\/\n ModifyTable *plan = (ModifyTable *) mt_plan_state->ps.plan;\n\n switch (plan->operation) {\n case CMD_INSERT:\n return PlanTransformer::TransformInsert(mt_plan_state);\n break;\n\n default:\n break;\n }\n\n return nullptr;\n}\n\n\/**\n * @brief Convert ModifyTableState Insert case into AbstractPlanNode.\n * @return Pointer to the constructed AbstractPlanNode.\n *\/\nplanner::AbstractPlanNode *PlanTransformer::TransformInsert(\n const ModifyTableState *mt_plan_state) {\n\n \/* Resolve result table *\/\n ResultRelInfo *result_rel_info = mt_plan_state->resultRelInfo;\n Relation result_relation_desc = result_rel_info->ri_RelationDesc;\n\n \/* Currently, we only support plain insert statement.\n * So, the number of subplan must be exactly 1.\n * TODO: can it be 0? *\/\n assert(mt_plan_state->mt_nplans == 1);\n\n Oid database_oid = GetCurrentDatabaseOid();\n Oid table_oid = result_relation_desc->rd_id;\n\n \/* Get the target table *\/\n storage::DataTable *target_table = static_cast(catalog::Manager::GetInstance().\n GetLocation(database_oid, table_oid));\n\n \/* Get the tuple schema *\/\n auto schema = target_table->GetSchema();\n\n \/* Should be only one which is a Result Plan *\/\n PlanState *subplan_state = mt_plan_state->mt_plans[0];\n TupleTableSlot *plan_slot;\n std::vector tuples;\n\n \/*\n plan_slot = ExecProcNode(subplan_state);\n assert(!TupIsNull(plan_slot)); \/\/ The tuple should not be null\n\n auto tuple = TupleTransformer(plan_slot, schema);\n tuples.push_back(tuple);\n *\/\n\n auto plan_node = new planner::InsertNode(target_table, tuples);\n\n return plan_node;\n}\n\n\/**\n * @brief Convert a Postgres SeqScanState into a Peloton SeqScanNode.\n * @return Pointer to the constructed AbstractPlanNode.\n *\n * TODO: Can we also scan result from a child operator? (Non-base-table scan?)\n * We can't for now, but postgres can.\n *\/\nplanner::AbstractPlanNode* PlanTransformer::TransformSeqScan(\n const SeqScanState* ss_plan_state) {\n\n \/\/ Grab Database ID and Table ID\n assert(ss_plan_state->ss_currentRelation); \/\/ Null if not a base table scan\n Oid database_oid = GetCurrentDatabaseOid();\n Oid table_oid = ss_plan_state->ss_currentRelation->rd_id;\n\n \/* Grab the target table *\/\n storage::DataTable *target_table = static_cast(catalog::Manager::GetInstance().\n GetLocation(database_oid, table_oid));\n\n \/*\n * Grab and transform the predicate.\n *\n * TODO:\n * The qualifying predicate should extracted from:\n * ss_plan_state->ps.qual\n *\n * Let's just use a null predicate for now.\n *\/\n expression::AbstractExpression* predicate = nullptr;\n\n \/*\n * Grab and transform the output column Id's.\n *\n * TODO:\n * The output columns should be extracted from:\n * ss_plan_state->ps.ps_ProjInfo (null if no projection)\n *\n * Let's just select all columns for now\n *\/\n auto schema = target_table->GetSchema();\n std::vector column_ids(schema->GetColumnCount());\n std::iota(column_ids.begin(), column_ids.end(), 0);\n assert(column_ids.size() > 0);\n\n \/* Construct and return the Peloton plan node *\/\n auto plan_node = new planner::SeqScanNode(target_table, predicate, column_ids);\n return plan_node;\n}\n\n} \/\/ namespace bridge\n} \/\/ namespace peloton\nFix compilation\/*-------------------------------------------------------------------------\n *\n * plan_transformer.cpp\n * file description\n *\n * Copyright(c) 2015, CMU\n *\n * \/n-store\/src\/bridge\/plan_transformer.cpp\n *\n *-------------------------------------------------------------------------\n *\/\n\n#include \"nodes\/pprint.h\"\n#include \"utils\/rel.h\"\n#include \"bridge\/bridge.h\"\n#include \"executor\/executor.h\"\n\n#include \"backend\/bridge\/plan_transformer.h\"\n#include \"backend\/bridge\/tuple_transformer.h\"\n#include \"backend\/expression\/abstract_expression.h\"\n#include \"backend\/storage\/data_table.h\"\n#include \"backend\/planner\/insert_node.h\"\n#include \"backend\/planner\/seq_scan_node.h\"\n\nvoid printPlanStateTree(const PlanState * planstate);\n\nnamespace peloton {\nnamespace bridge {\n\n\/**\n * @brief Get an instance of the plan transformer.\n * @return The instance.\n *\/\nPlanTransformer& PlanTransformer::GetInstance() {\n static PlanTransformer planTransformer;\n return planTransformer;\n}\n\n\/**\n * @brief Pretty print the plan state tree.\n * @return none.\n *\/\nvoid PlanTransformer::PrintPlanState(const PlanState *plan_state) const {\n printPlanStateTree(plan_state);\n}\n\n\/**\n * @brief Convert Postgres PlanState into AbstractPlanNode.\n * @return Pointer to the constructed AbstractPlanNode.\n *\/\nplanner::AbstractPlanNode *PlanTransformer::TransformPlan(const PlanState *plan_state) {\n\n Plan *plan = plan_state->plan;\n planner::AbstractPlanNode *plan_node;\n\n switch (nodeTag(plan)) {\n case T_ModifyTable:\n plan_node = PlanTransformer::TransformModifyTable(reinterpret_cast(plan_state));\n break;\n case T_SeqScan:\n plan_node = PlanTransformer::TransformSeqScan(reinterpret_cast(plan_state));\n break;\n default:\n plan_node = nullptr;\n break;\n }\n\n return plan_node;\n}\n\n\/**\n * @brief Convert ModifyTableState into AbstractPlanNode.\n * @return Pointer to the constructed AbstractPlanNode.\n *\/\nplanner::AbstractPlanNode *PlanTransformer::TransformModifyTable(\n const ModifyTableState *mt_plan_state) {\n\n \/* TODO: handle UPDATE, DELETE *\/\n \/* TODO: Add logging *\/\n ModifyTable *plan = (ModifyTable *) mt_plan_state->ps.plan;\n\n switch (plan->operation) {\n case CMD_INSERT:\n return PlanTransformer::TransformInsert(mt_plan_state);\n break;\n\n default:\n break;\n }\n\n return nullptr;\n}\n\n\/**\n * @brief Convert ModifyTableState Insert case into AbstractPlanNode.\n * @return Pointer to the constructed AbstractPlanNode.\n *\/\nplanner::AbstractPlanNode *PlanTransformer::TransformInsert(\n const ModifyTableState *mt_plan_state) {\n\n \/* Resolve result table *\/\n ResultRelInfo *result_rel_info = mt_plan_state->resultRelInfo;\n Relation result_relation_desc = result_rel_info->ri_RelationDesc;\n\n \/* Currently, we only support plain insert statement.\n * So, the number of subplan must be exactly 1.\n * TODO: can it be 0? *\/\n assert(mt_plan_state->mt_nplans == 1);\n\n Oid database_oid = GetCurrentDatabaseOid();\n Oid table_oid = result_relation_desc->rd_id;\n\n \/* Get the target table *\/\n storage::DataTable *target_table = static_cast(catalog::Manager::GetInstance().\n GetLocation(database_oid, table_oid));\n\n \/* Get the tuple schema *\/\n auto schema = target_table->GetSchema();\n\n \/* Should be only one which is a Result Plan *\/\n PlanState *subplan_state = mt_plan_state->mt_plans[0];\n TupleTableSlot *plan_slot;\n std::vector tuples;\n\n \/*\n plan_slot = ExecProcNode(subplan_state);\n assert(!TupIsNull(plan_slot)); \/\/ The tuple should not be null\n\n auto tuple = TupleTransformer(plan_slot, schema);\n tuples.push_back(tuple);\n *\/\n\n auto plan_node = new planner::InsertNode(target_table, tuples);\n\n return plan_node;\n}\n\n\/**\n * @brief Convert a Postgres SeqScanState into a Peloton SeqScanNode.\n * @return Pointer to the constructed AbstractPlanNode.\n *\n * TODO: Can we also scan result from a child operator? (Non-base-table scan?)\n * We can't for now, but postgres can.\n *\/\nplanner::AbstractPlanNode* PlanTransformer::TransformSeqScan(\n const SeqScanState* ss_plan_state) {\n\n assert(nodeTag(ss_plan_state) == T_SeqScanState);\n\n \/\/ Grab Database ID and Table ID\n assert(ss_plan_state->ss_currentRelation); \/\/ Null if not a base table scan\n Oid database_oid = GetCurrentDatabaseOid();\n Oid table_oid = ss_plan_state->ss_currentRelation->rd_id;\n\n \/* Grab the target table *\/\n storage::DataTable *target_table = static_cast(catalog::Manager::GetInstance().\n GetLocation(database_oid, table_oid));\n\n \/*\n * Grab and transform the predicate.\n *\n * TODO:\n * The qualifying predicate should extracted from:\n * ss_plan_state->ps.qual\n *\n * Let's just use a null predicate for now.\n *\/\n expression::AbstractExpression* predicate = nullptr;\n\n \/*\n * Grab and transform the output column Id's.\n *\n * TODO:\n * The output columns should be extracted from:\n * ss_plan_state->ps.ps_ProjInfo (null if no projection)\n *\n * Let's just select all columns for now\n *\/\n auto schema = target_table->GetSchema();\n std::vector column_ids(schema->GetColumnCount());\n std::iota(column_ids.begin(), column_ids.end(), 0);\n assert(column_ids.size() > 0);\n\n \/* Construct and return the Peloton plan node *\/\n auto plan_node = new planner::SeqScanNode(target_table, predicate, column_ids);\n return plan_node;\n}\n\n} \/\/ namespace bridge\n} \/\/ namespace peloton\n<|endoftext|>"} {"text":"\/*************************************************************************\n *\n * OpenOffice.org - a multi-platform office productivity suite\n *\n * $RCSfile: outlundo.cxx,v $\n *\n * $Revision: 1.7 $\n *\n * last change: $Author: hr $ $Date: 2007-06-27 18:42: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_svx.hxx\"\n\n#include \n\n#define _OUTLINER_CXX\n#include \n#include \n\n\nOutlinerUndoBase::OutlinerUndoBase( USHORT _nId, Outliner* pOutliner )\n : EditUndo( _nId, NULL )\n{\n DBG_ASSERT( pOutliner, \"Undo: Outliner?!\" );\n mpOutliner = pOutliner;\n}\n\n\nOutlinerUndoChangeDepth::OutlinerUndoChangeDepth( Outliner* pOutliner, USHORT nPara, USHORT nOldDepth, USHORT nNewDepth )\n : OutlinerUndoBase( OLUNDO_DEPTH, pOutliner )\n{\n mnPara = nPara;\n mnOldDepth = nOldDepth;\n mnNewDepth = nNewDepth;\n}\n\nvoid OutlinerUndoChangeDepth::Undo()\n{\n GetOutliner()->ImplInitDepth( mnPara, mnOldDepth, FALSE );\n}\n\nvoid OutlinerUndoChangeDepth::Redo()\n{\n GetOutliner()->ImplInitDepth( mnPara, mnNewDepth, FALSE );\n}\n\nvoid OutlinerUndoChangeDepth::Repeat()\n{\n DBG_ERROR( \"Repeat not implemented!\" );\n}\n\n\nOutlinerUndoCheckPara::OutlinerUndoCheckPara( Outliner* pOutliner, USHORT nPara )\n : OutlinerUndoBase( OLUNDO_DEPTH, pOutliner )\n{\n mnPara = nPara;\n}\n\nvoid OutlinerUndoCheckPara::Undo()\n{\n Paragraph* pPara = GetOutliner()->GetParagraph( mnPara );\n pPara->Invalidate();\n GetOutliner()->ImplCalcBulletText( mnPara, FALSE, FALSE );\n}\n\nvoid OutlinerUndoCheckPara::Redo()\n{\n Paragraph* pPara = GetOutliner()->GetParagraph( mnPara );\n pPara->Invalidate();\n GetOutliner()->ImplCalcBulletText( mnPara, FALSE, FALSE );\n}\n\nvoid OutlinerUndoCheckPara::Repeat()\n{\n DBG_ERROR( \"Repeat not implemented!\" );\n}\n\nDBG_NAME(OLUndoExpand);\n\nOLUndoExpand::OLUndoExpand(Outliner* pOut, USHORT _nId )\n : EditUndo( _nId, 0 )\n{\n DBG_CTOR(OLUndoExpand,0);\n DBG_ASSERT(pOut,\"Undo:No Outliner\");\n pOutliner = pOut;\n nCount = 0;\n pParas = 0;\n}\n\n\nOLUndoExpand::~OLUndoExpand()\n{\n DBG_DTOR(OLUndoExpand,0);\n delete pParas;\n}\n\n\nvoid OLUndoExpand::Restore( BOOL bUndo )\n{\n DBG_CHKTHIS(OLUndoExpand,0);\n DBG_ASSERT(pOutliner,\"Undo:No Outliner\");\n DBG_ASSERT(pOutliner->pEditEngine,\"Outliner already deleted\");\n Paragraph* pPara;\n\n BOOL bExpand = FALSE;\n USHORT _nId = GetId();\n if((_nId == OLUNDO_EXPAND && !bUndo) || (_nId == OLUNDO_COLLAPSE && bUndo))\n bExpand = TRUE;\n if( !pParas )\n {\n pPara = pOutliner->GetParagraph( (ULONG)nCount );\n if( bExpand )\n pOutliner->Expand( pPara );\n else\n pOutliner->Collapse( pPara );\n }\n else\n {\n for( USHORT nIdx = 0; nIdx < nCount; nIdx++ )\n {\n pPara = pOutliner->GetParagraph( (ULONG)(pParas[nIdx]) );\n if( bExpand )\n pOutliner->Expand( pPara );\n else\n pOutliner->Collapse( pPara );\n }\n }\n}\n\n\nvoid OLUndoExpand::Undo()\n{\n DBG_CHKTHIS(OLUndoExpand,0);\n Restore( TRUE );\n}\n\n\nvoid OLUndoExpand::Redo()\n{\n DBG_CHKTHIS(OLUndoExpand,0);\n Restore( FALSE );\n}\n\n\nvoid OLUndoExpand::Repeat()\n{\n DBG_CHKTHIS(OLUndoExpand,0);\n DBG_ERROR(\"Not implemented\");\n}\nINTEGRATION: CWS changefileheader (1.7.368); FILE MERGED 2008\/03\/31 14:23:09 rt 1.7.368.1: #i87441# Change license header to LPGL v3.\/*************************************************************************\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: outlundo.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 * \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\n#define _OUTLINER_CXX\n#include \n#include \n\n\nOutlinerUndoBase::OutlinerUndoBase( USHORT _nId, Outliner* pOutliner )\n : EditUndo( _nId, NULL )\n{\n DBG_ASSERT( pOutliner, \"Undo: Outliner?!\" );\n mpOutliner = pOutliner;\n}\n\n\nOutlinerUndoChangeDepth::OutlinerUndoChangeDepth( Outliner* pOutliner, USHORT nPara, USHORT nOldDepth, USHORT nNewDepth )\n : OutlinerUndoBase( OLUNDO_DEPTH, pOutliner )\n{\n mnPara = nPara;\n mnOldDepth = nOldDepth;\n mnNewDepth = nNewDepth;\n}\n\nvoid OutlinerUndoChangeDepth::Undo()\n{\n GetOutliner()->ImplInitDepth( mnPara, mnOldDepth, FALSE );\n}\n\nvoid OutlinerUndoChangeDepth::Redo()\n{\n GetOutliner()->ImplInitDepth( mnPara, mnNewDepth, FALSE );\n}\n\nvoid OutlinerUndoChangeDepth::Repeat()\n{\n DBG_ERROR( \"Repeat not implemented!\" );\n}\n\n\nOutlinerUndoCheckPara::OutlinerUndoCheckPara( Outliner* pOutliner, USHORT nPara )\n : OutlinerUndoBase( OLUNDO_DEPTH, pOutliner )\n{\n mnPara = nPara;\n}\n\nvoid OutlinerUndoCheckPara::Undo()\n{\n Paragraph* pPara = GetOutliner()->GetParagraph( mnPara );\n pPara->Invalidate();\n GetOutliner()->ImplCalcBulletText( mnPara, FALSE, FALSE );\n}\n\nvoid OutlinerUndoCheckPara::Redo()\n{\n Paragraph* pPara = GetOutliner()->GetParagraph( mnPara );\n pPara->Invalidate();\n GetOutliner()->ImplCalcBulletText( mnPara, FALSE, FALSE );\n}\n\nvoid OutlinerUndoCheckPara::Repeat()\n{\n DBG_ERROR( \"Repeat not implemented!\" );\n}\n\nDBG_NAME(OLUndoExpand);\n\nOLUndoExpand::OLUndoExpand(Outliner* pOut, USHORT _nId )\n : EditUndo( _nId, 0 )\n{\n DBG_CTOR(OLUndoExpand,0);\n DBG_ASSERT(pOut,\"Undo:No Outliner\");\n pOutliner = pOut;\n nCount = 0;\n pParas = 0;\n}\n\n\nOLUndoExpand::~OLUndoExpand()\n{\n DBG_DTOR(OLUndoExpand,0);\n delete pParas;\n}\n\n\nvoid OLUndoExpand::Restore( BOOL bUndo )\n{\n DBG_CHKTHIS(OLUndoExpand,0);\n DBG_ASSERT(pOutliner,\"Undo:No Outliner\");\n DBG_ASSERT(pOutliner->pEditEngine,\"Outliner already deleted\");\n Paragraph* pPara;\n\n BOOL bExpand = FALSE;\n USHORT _nId = GetId();\n if((_nId == OLUNDO_EXPAND && !bUndo) || (_nId == OLUNDO_COLLAPSE && bUndo))\n bExpand = TRUE;\n if( !pParas )\n {\n pPara = pOutliner->GetParagraph( (ULONG)nCount );\n if( bExpand )\n pOutliner->Expand( pPara );\n else\n pOutliner->Collapse( pPara );\n }\n else\n {\n for( USHORT nIdx = 0; nIdx < nCount; nIdx++ )\n {\n pPara = pOutliner->GetParagraph( (ULONG)(pParas[nIdx]) );\n if( bExpand )\n pOutliner->Expand( pPara );\n else\n pOutliner->Collapse( pPara );\n }\n }\n}\n\n\nvoid OLUndoExpand::Undo()\n{\n DBG_CHKTHIS(OLUndoExpand,0);\n Restore( TRUE );\n}\n\n\nvoid OLUndoExpand::Redo()\n{\n DBG_CHKTHIS(OLUndoExpand,0);\n Restore( FALSE );\n}\n\n\nvoid OLUndoExpand::Repeat()\n{\n DBG_CHKTHIS(OLUndoExpand,0);\n DBG_ERROR(\"Not implemented\");\n}\n<|endoftext|>"} {"text":"\/******************************************************************************\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 \n\n#include \"vast\/error.hpp\"\n\n#include \"vast\/detail\/fdinbuf.hpp\"\n#include \"vast\/detail\/fdostream.hpp\"\n#include \"vast\/detail\/make_io_stream.hpp\"\n#include \"vast\/detail\/posix.hpp\"\n\nnamespace vast {\nnamespace detail {\n\nexpected>\nmake_input_stream(const std::string& input, bool is_uds) {\n struct owning_istream : public std::istream {\n owning_istream(std::unique_ptr&& ptr) : std::istream{ptr.release()} {\n \/\/ nop\n }\n ~owning_istream() {\n delete rdbuf();\n }\n };\n if (is_uds) {\n if (input == \"-\")\n return make_error(ec::filesystem_error,\n \"cannot use stdin as UNIX domain socket\");\n auto uds = unix_domain_socket::connect(input);\n if (!uds)\n return make_error(ec::filesystem_error,\n \"failed to connect to UNIX domain socket at\", input);\n auto remote_fd = uds.recv_fd(); \/\/ Blocks!\n auto sb = std::make_unique(remote_fd);\n return std::make_unique(std::move(sb));\n }\n if (input == \"-\") {\n auto sb = std::make_unique(0);\n return std::make_unique(std::move(sb));\n }\n auto fb = std::make_unique();\n fb->open(input, std::ios_base::binary | std::ios_base::in);\n return std::make_unique(std::move(fb));\n}\n\nexpected>\nmake_output_stream(const std::string& output, bool is_uds) {\n if (is_uds) {\n return make_error(ec::filesystem_error,\n \"cannot use stdout as UNIX domain socket\");\n auto uds = unix_domain_socket::connect(output);\n if (!uds)\n return make_error(ec::filesystem_error,\n \"failed to connect to UNIX domain socket at\", output);\n auto remote_fd = uds.recv_fd(); \/\/ Blocks!\n return std::make_unique(remote_fd);\n }\n if (output == \"-\")\n return std::make_unique(1); \/\/ stdout\n return std::make_unique(output);\n}\n\n} \/\/ namespace detail\n} \/\/ namespace vast\nAdhere to style guide\/******************************************************************************\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 \n\n#include \"vast\/error.hpp\"\n\n#include \"vast\/detail\/fdinbuf.hpp\"\n#include \"vast\/detail\/fdostream.hpp\"\n#include \"vast\/detail\/make_io_stream.hpp\"\n#include \"vast\/detail\/posix.hpp\"\n\nnamespace vast {\nnamespace detail {\n\nexpected>\nmake_input_stream(const std::string& input, bool is_uds) {\n struct owning_istream : public std::istream {\n owning_istream(std::unique_ptr&& ptr)\n : std::istream{ptr.release()} {\n \/\/ nop\n }\n ~owning_istream() {\n delete rdbuf();\n }\n };\n if (is_uds) {\n if (input == \"-\")\n return make_error(ec::filesystem_error,\n \"cannot use stdin as UNIX domain socket\");\n auto uds = unix_domain_socket::connect(input);\n if (!uds)\n return make_error(ec::filesystem_error,\n \"failed to connect to UNIX domain socket at\", input);\n auto remote_fd = uds.recv_fd(); \/\/ Blocks!\n auto sb = std::make_unique(remote_fd);\n return std::make_unique(std::move(sb));\n }\n if (input == \"-\") {\n auto sb = std::make_unique(0); \/\/ stdin\n return std::make_unique(std::move(sb));\n }\n auto fb = std::make_unique();\n fb->open(input, std::ios_base::binary | std::ios_base::in);\n return std::make_unique(std::move(fb));\n}\n\nexpected>\nmake_output_stream(const std::string& output, bool is_uds) {\n if (is_uds) {\n return make_error(ec::filesystem_error,\n \"cannot use stdout as UNIX domain socket\");\n auto uds = unix_domain_socket::connect(output);\n if (!uds)\n return make_error(ec::filesystem_error,\n \"failed to connect to UNIX domain socket at\", output);\n auto remote_fd = uds.recv_fd(); \/\/ Blocks!\n return std::make_unique(remote_fd);\n }\n if (output == \"-\")\n return std::make_unique(1); \/\/ stdout\n return std::make_unique(output);\n}\n\n} \/\/ namespace detail\n} \/\/ namespace vast\n<|endoftext|>"} {"text":"\/*-------------------------------------------------------------------------\n *\n * plan_transformer.cpp\n * file description\n *\n * Copyright(c) 2015, CMU\n *\n * \/n-store\/src\/bridge\/plan_transformer.cpp\n *\n *-------------------------------------------------------------------------\n *\/\n\n#include \"nodes\/pprint.h\"\n#include \"utils\/rel.h\"\n#include \"bridge\/bridge.h\"\n#include \"executor\/executor.h\"\n\n#include \"backend\/bridge\/plan_transformer.h\"\n#include \"backend\/bridge\/tuple_transformer.h\"\n#include \"backend\/storage\/data_table.h\"\n#include \"backend\/planner\/insert_node.h\"\n\nvoid printPlanStateTree(const PlanState * planstate);\n\nnamespace peloton {\nnamespace bridge {\n\n\/**\n * @brief Get an instance of the plan transformer.\n * @return The instance.\n *\/\nPlanTransformer& PlanTransformer::GetInstance() {\n static PlanTransformer planTransformer;\n return planTransformer;\n}\n\n\/**\n * @brief Pretty print the plan state tree.\n * @return none.\n *\/\nvoid PlanTransformer::PrintPlanState(const PlanState *plan_state) const {\n printPlanStateTree(plan_state);\n}\n\n\/**\n * @brief Convert Postgres PlanState into AbstractPlanNode.\n * @return Pointer to the constructed AbstractPlanNode.\n *\/\nplanner::AbstractPlanNode *PlanTransformer::TransformPlan(const PlanState *plan_state) {\n\n Plan *plan = plan_state->plan;\n planner::AbstractPlanNode *plan_node;\n\n switch (nodeTag(plan)) {\n case T_ModifyTable:\n plan_node = PlanTransformer::TransformModifyTable(reinterpret_cast(plan_state));\n break;\n case T_SeqScan:\n plan_node = PlanTransformer::TransformSeqScan(reinterpret_cast(plan_state));\n break;\n default:\n plan_node = nullptr;\n break;\n }\n\n return plan_node;\n}\n\n\/**\n * @brief Convert ModifyTableState into AbstractPlanNode.\n * @return Pointer to the constructed AbstractPlanNode.\n *\/\nplanner::AbstractPlanNode *PlanTransformer::TransformModifyTable(\n const ModifyTableState *mt_plan_state) {\n\n \/* TODO: handle UPDATE, DELETE *\/\n \/* TODO: Add logging *\/\n ModifyTable *plan = (ModifyTable *) mt_plan_state->ps.plan;\n\n switch (plan->operation) {\n case CMD_INSERT:\n return PlanTransformer::TransformInsert(mt_plan_state);\n break;\n\n default:\n break;\n }\n\n return nullptr;\n}\n\n\/**\n * @brief Convert ModifyTableState Insert case into AbstractPlanNode.\n * @return Pointer to the constructed AbstractPlanNode.\n *\/\nplanner::AbstractPlanNode *PlanTransformer::TransformInsert(\n const ModifyTableState *mt_plan_state) {\n\n \/* Resolve result table *\/\n ResultRelInfo *result_rel_info = mt_plan_state->resultRelInfo;\n Relation result_relation_desc = result_rel_info->ri_RelationDesc;\n\n \/* Currently, we only support plain insert statement.\n * So, the number of subplan must be exactly 1.\n * TODO: can it be 0? *\/\n assert(mt_plan_state->mt_nplans == 1);\n\n Oid database_oid = GetCurrentDatabaseOid();\n Oid table_oid = result_relation_desc->rd_id;\n\n \/* Get the target table *\/\n storage::DataTable *target_table = static_cast(catalog::Manager::GetInstance().\n GetLocation(database_oid, table_oid));\n\n \/* Get the tuple schema *\/\n auto schema = target_table->GetSchema();\n\n \/* Should be only one which is a Result Plan *\/\n PlanState *subplan_state = mt_plan_state->mt_plans[0];\n TupleTableSlot *plan_slot;\n std::vector tuples;\n\n \/*\n plan_slot = ExecProcNode(subplan_state);\n assert(!TupIsNull(plan_slot)); \/\/ The tuple should not be null\n\n auto tuple = TupleTransformer(plan_slot, schema);\n tuples.push_back(tuple);\n *\/\n\n auto plan_node = new planner::InsertNode(target_table, tuples);\n\n return plan_node;\n}\n\n\/**\n * @brief Convert a Postgres SeqScanState into a Peloton SeqScanNode.\n * @return Pointer to the constructed AbstractPlanNode.\n *\n * TODO: Can we also scan result from a child operator? (Non-base-table scan?)\n * We can't for now, but postgres can.\n *\/\nplanner::AbstractPlanNode* PlanTransformer::TransformSeqScan(\n const SeqScanState* ss_plan_state) {\n\n \/\/ Grab Database ID and Table ID\n assert(ss_plan_state->ss_currentRelation); \/\/ Null if not a base table scan\n Oid database_oid = GetCurrentDatabaseOid();\n Oid table_oid = ss_plan_state->ss_currentRelation->rd_id;\n\n \/* Grab the target table *\/\n storage::DataTable *target_table = static_cast(catalog::Manager::GetInstance().\n GetLocation(database_oid, table_oid));\n\n \/*\n * Grab and transform the predicate.\n *\n * TODO:\n * The qualifying predicate should extracted from:\n * ss_plan_state->ps.qual\n *\n * Let's just use a null predicate for now.\n *\/\n expression::AbstractExpression* predicate = nullptr;\n\n \/*\n * Grab and transform the output column Id's.\n *\n * TODO:\n * The output columns should be extracted from:\n * ss_plan_state->ps.ps_ProjInfo (null if no projection)\n *\n * Let's just select all columns for now\n *\/\n auto schema = target_table->GetSchema();\n std::vector column_ids(schema->GetColumnCount());\n std::iota(column_ids.begin(), column_ids.end(), 0);\n assert(column_ids.size() > 0);\n\n \/* Construct and return the Peloton plan node *\/\n auto plan_node = new planner::SeqScanNode(target_table, predicate, column_ids);\n return plan_node;\n}\n\n} \/\/ namespace bridge\n} \/\/ namespace peloton\nFix compilation\/*-------------------------------------------------------------------------\n *\n * plan_transformer.cpp\n * file description\n *\n * Copyright(c) 2015, CMU\n *\n * \/n-store\/src\/bridge\/plan_transformer.cpp\n *\n *-------------------------------------------------------------------------\n *\/\n\n#include \"nodes\/pprint.h\"\n#include \"utils\/rel.h\"\n#include \"bridge\/bridge.h\"\n#include \"executor\/executor.h\"\n\n#include \"backend\/bridge\/plan_transformer.h\"\n#include \"backend\/bridge\/tuple_transformer.h\"\n#include \"backend\/expression\/abstract_expression.h\"\n#include \"backend\/storage\/data_table.h\"\n#include \"backend\/planner\/insert_node.h\"\n#include \"backend\/planner\/seq_scan_node.h\"\n\nvoid printPlanStateTree(const PlanState * planstate);\n\nnamespace peloton {\nnamespace bridge {\n\n\/**\n * @brief Get an instance of the plan transformer.\n * @return The instance.\n *\/\nPlanTransformer& PlanTransformer::GetInstance() {\n static PlanTransformer planTransformer;\n return planTransformer;\n}\n\n\/**\n * @brief Pretty print the plan state tree.\n * @return none.\n *\/\nvoid PlanTransformer::PrintPlanState(const PlanState *plan_state) const {\n printPlanStateTree(plan_state);\n}\n\n\/**\n * @brief Convert Postgres PlanState into AbstractPlanNode.\n * @return Pointer to the constructed AbstractPlanNode.\n *\/\nplanner::AbstractPlanNode *PlanTransformer::TransformPlan(const PlanState *plan_state) {\n\n Plan *plan = plan_state->plan;\n planner::AbstractPlanNode *plan_node;\n\n switch (nodeTag(plan)) {\n case T_ModifyTable:\n plan_node = PlanTransformer::TransformModifyTable(reinterpret_cast(plan_state));\n break;\n case T_SeqScan:\n plan_node = PlanTransformer::TransformSeqScan(reinterpret_cast(plan_state));\n break;\n default:\n plan_node = nullptr;\n break;\n }\n\n return plan_node;\n}\n\n\/**\n * @brief Convert ModifyTableState into AbstractPlanNode.\n * @return Pointer to the constructed AbstractPlanNode.\n *\/\nplanner::AbstractPlanNode *PlanTransformer::TransformModifyTable(\n const ModifyTableState *mt_plan_state) {\n\n \/* TODO: handle UPDATE, DELETE *\/\n \/* TODO: Add logging *\/\n ModifyTable *plan = (ModifyTable *) mt_plan_state->ps.plan;\n\n switch (plan->operation) {\n case CMD_INSERT:\n return PlanTransformer::TransformInsert(mt_plan_state);\n break;\n\n default:\n break;\n }\n\n return nullptr;\n}\n\n\/**\n * @brief Convert ModifyTableState Insert case into AbstractPlanNode.\n * @return Pointer to the constructed AbstractPlanNode.\n *\/\nplanner::AbstractPlanNode *PlanTransformer::TransformInsert(\n const ModifyTableState *mt_plan_state) {\n\n \/* Resolve result table *\/\n ResultRelInfo *result_rel_info = mt_plan_state->resultRelInfo;\n Relation result_relation_desc = result_rel_info->ri_RelationDesc;\n\n \/* Currently, we only support plain insert statement.\n * So, the number of subplan must be exactly 1.\n * TODO: can it be 0? *\/\n assert(mt_plan_state->mt_nplans == 1);\n\n Oid database_oid = GetCurrentDatabaseOid();\n Oid table_oid = result_relation_desc->rd_id;\n\n \/* Get the target table *\/\n storage::DataTable *target_table = static_cast(catalog::Manager::GetInstance().\n GetLocation(database_oid, table_oid));\n\n \/* Get the tuple schema *\/\n auto schema = target_table->GetSchema();\n\n \/* Should be only one which is a Result Plan *\/\n PlanState *subplan_state = mt_plan_state->mt_plans[0];\n TupleTableSlot *plan_slot;\n std::vector tuples;\n\n \/*\n plan_slot = ExecProcNode(subplan_state);\n assert(!TupIsNull(plan_slot)); \/\/ The tuple should not be null\n\n auto tuple = TupleTransformer(plan_slot, schema);\n tuples.push_back(tuple);\n *\/\n\n auto plan_node = new planner::InsertNode(target_table, tuples);\n\n return plan_node;\n}\n\n\/**\n * @brief Convert a Postgres SeqScanState into a Peloton SeqScanNode.\n * @return Pointer to the constructed AbstractPlanNode.\n *\n * TODO: Can we also scan result from a child operator? (Non-base-table scan?)\n * We can't for now, but postgres can.\n *\/\nplanner::AbstractPlanNode* PlanTransformer::TransformSeqScan(\n const SeqScanState* ss_plan_state) {\n\n assert(nodeTag(ss_plan_state) == T_SeqScanState);\n\n \/\/ Grab Database ID and Table ID\n assert(ss_plan_state->ss_currentRelation); \/\/ Null if not a base table scan\n Oid database_oid = GetCurrentDatabaseOid();\n Oid table_oid = ss_plan_state->ss_currentRelation->rd_id;\n\n \/* Grab the target table *\/\n storage::DataTable *target_table = static_cast(catalog::Manager::GetInstance().\n GetLocation(database_oid, table_oid));\n\n \/*\n * Grab and transform the predicate.\n *\n * TODO:\n * The qualifying predicate should extracted from:\n * ss_plan_state->ps.qual\n *\n * Let's just use a null predicate for now.\n *\/\n expression::AbstractExpression* predicate = nullptr;\n\n \/*\n * Grab and transform the output column Id's.\n *\n * TODO:\n * The output columns should be extracted from:\n * ss_plan_state->ps.ps_ProjInfo (null if no projection)\n *\n * Let's just select all columns for now\n *\/\n auto schema = target_table->GetSchema();\n std::vector column_ids(schema->GetColumnCount());\n std::iota(column_ids.begin(), column_ids.end(), 0);\n assert(column_ids.size() > 0);\n\n \/* Construct and return the Peloton plan node *\/\n auto plan_node = new planner::SeqScanNode(target_table, predicate, column_ids);\n return plan_node;\n}\n\n} \/\/ namespace bridge\n} \/\/ namespace peloton\n<|endoftext|>"} {"text":"\/* Copyright (C) 2011 LinBox\n * Written by BB \n *\n *\n *\n * ========LICENCE========\n * This file is part of the library LinBox.\n *\n * LinBox 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.\t See the GNU\n * Lesser General Public License for more details.\n *\n * You should have received 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\/*! @file benchmarks\/benchmark-example.C\n * @ingroup benchmarks\n * @brief Benchmarking example\n * @example benchmark\n *\/\n\n#include \"benchmarks\/benchmark.h\"\n#include \"linbox\/util\/error.h\"\n#include \"fflas-ffpack\/fflas-ffpack.h\"\n#include \"linbox\/field\/modular.h\"\n#include \"linbox\/field\/modular-balanced.h\"\n#include \"linbox\/matrix\/random-matrix.h\"\n#include \"linbox\/matrix\/dense-matrix.h\"\n#include \"linbox\/matrix\/matrix-domain.h\"\n#include \"linbox\/matrix\/sparse-matrix.h\"\n#include \"linbox\/solutions\/rank.h\"\n\n\nusing namespace LinBox ;\nusing Givaro::Timer;\n\n\/* compute MegaFLOPS for mat mul (2 m n k) *\/\ndouble mm_mflops(index_t m, index_t n, index_t k)\n{\n\treturn 2*(double)m\/100*(double)n\/100*(double)k\/100 ;\n}\n\n\/* Benchmark on a field *\/\n\n\/*! @internal\n * @brief launches the benchmarks for the square case.\n * @param F field\n * @param min min size to bench\n * @param max max size to bench\n * @param step step between two sizes\n * @param Data where data is stored\n * @param series_nb index of the current series of measures.\n *\/\ntemplate\nvoid launch_bench_square(Field & F \/\/ const problem\n\t\t\t , index_t min, index_t max, index_t step \/\/ no negative step\n\t\t\t , PlotData & Data\n\t\t\t)\n{\n\tlinbox_check(step);\n\tlinbox_check(min <= max);\n\n\tstd::ostringstream nam ;\n\tF.write(nam);\n\t\/\/ Data.setCurrentSerieName(nam.str());\n\n\tData.newSerie(nam.str());\n\tChrono TW ;\n\n\ttypedef typename Field::RandIter Randiter ;\n\tRanditer R(F) ;\n\tBlasMatrixDomain BMD(F) ;\n\tRandomDenseMatrix RandMat(F,R);\n\n\tfor ( index_t i = min ; i < max ; i += step ) {\n\n\t\tshowAdvanceLinear(i,min,max);\n\t\tsize_t ii = i ;\n\t\tBlasMatrix A (F,ii,ii);\n\t\tBlasMatrix B (F,ii,ii);\n\t\tBlasMatrix C (F,ii,ii);\n\n\t\tindex_t j = 0 ; \/\/ number of repets.\n\n\t\tRandMat.random(A);\n\t\tRandMat.random(B);\n\t\tRandMat.random(C);\n\t\tTW.clear() ;\n\t\twhile( Data.keepon(j,TW.time()) ) {\n\t\t\tTW.start() ;\n\t\t\tBMD.mul(C,A,B) ; \/\/ C = AB\n\t\t\tTW.stop();\n\t\t\t++j ;\n\t\t}\n\t\tdouble mflops = computeMFLOPS(TW.times(),mm_mflops(i,i,i));\n\n\t\tData.setCurrentSeriesEntry(i,mflops,i,TW.time()); \/\/ could be i*i*i\n\n\t}\n\n\tData.finishSerie();\n}\n\n\/* Collects Benchmarks *\/\n\n\n\/*! @brief Benchmark square fgemm Y=AX for several fields.\n * @param min min size\n * @param max max size\n * @param step step of the size between 2 benchmarks\n * @param charac characteristic of the field.\n *\/\nvoid bench_square( index_t min, index_t max, index_t step, int charac )\n{\n\n\tindex_t nb = 1 ;\/\/ une col de plus (la première)\n\ttypedef LinBox::Modular Field0 ; ++nb ;\n\ttypedef LinBox::Modular Field1 ; ++nb ;\n\t\/\/ typedef LinBox::Modular Field2 ; ++nb ;\n\t\/\/ typedef LinBox::ModularBalanced Field3 ; ++nb ;\n\t\/\/ typedef LinBox::ModularBalanced Field4 ; ++nb ;\n\t\/\/ typedef LinBox::ModularBalanced Field5 ; ++nb ;\n\t\/\/ GivaroZpZ\n\n\t\/\/\/\/\/ DATA HARVEST \/\/\/\/\n\n\tPlotData Data;\n\tshowProgression Show(nb) ;\n\n\tField0 F0(charac) ;\n\t\/\/ launch_bench_square(F0,100,1500,300,Data);\n\tlaunch_bench_square(F0,min,max,step,Data);\n\tShow.FinishIter();\n\n\tif (charac < 2048) {\n\t\tField1 F1(charac) ;\n\t\t\/\/ launch_bench_square(F1,200,1500,200,Data);\n\t\tlaunch_bench_square(F1,min,max,step,Data);\n\t\tShow.FinishIter();\n\t}\n\telse {\n\t\tShow.SkipIter();\n\t}\n\n\n\n#if 0\n\tField2 F2(charac) ;\n\tlaunch_bench_square(F2,min,max,step,Data);\n\tShow.FinishIter();\n\n\tField3 F3(charac) ;\n\tlaunch_bench_square(F3,min,max,step,Data);\n\tShow.FinishIter();\n\n\tif (charac < 2048) {\n\t\tField4 F4(charac) ;\n\t\tlaunch_bench_square(F4,min,max,step,Data);\n\t\tShow.FinishIter();\n\t}\n\telse {\n\t\tShow.SkipIter();\n\t}\n\n\tField5 F5(charac) ;\n\tlaunch_bench_square(F5,min,max,step,Data);\n\tShow.FinishIter();\n#endif\n\n\t\/\/\/\/\/ PLOT STYLE \/\/\/\/\n\tLinBox::PlotStyle Style;\n\n\tStyle.setTerm(LinBox::PlotStyle::Term::eps);\n\tStyle.setTitle(\"BlasMatrixDomain mul\",\"Mflops\",\"dimensions\");\n\n\tStyle.setPlotType(LinBox::PlotStyle::Plot::graph);\n\tStyle.setLineType(LinBox::PlotStyle::Line::linespoints);\n\n\n\tLinBox::PlotGraph Graph(Data,Style);\n\tGraph.setOutFilename(\"bmdmul_square\");\n\n\t\/\/ Graph.plot();\n\n\tGraph.print(Tag::Printer::gnuplot);\n\n\tGraph.print(Tag::Printer::tex);\n\tGraph.print(Tag::Printer::csv);\n\n\treturn ;\n\n}\n\ntemplate\nvoid launch_bench_rank(const Field &F, const std::string & name\n\t\t\t , PlotData & Data\n\t\t )\n{\n\n\tSparseMatrix Mat(F);\n\tstd::ifstream mat1 (name);\n\tMat.read(mat1);\n\n\tMatrixMetaData mmd (Mat,name);\n\n\t\/\/ Data.newSerie(name);\n\tChrono TW ;\n\n\tshowAdvanceLinear(1,1,2);\n\n\tTW.clear() ;\n\tindex_t j = 0 ;\n\twhile( Data.keepon(j,TW.time()) ) {\n\t\tTW.start() ;\n\t\tunsigned long d ;\n\t\tLinBox::rank(d,Mat,Method::Blackbox());\n\t\tTW.stop();\n\t\t++j ;\n\t}\n\n\t\/\/ double mflops = computeMFLOPS(TW.times(),mm_mflops(i,i,i));\n\n\tData.setSeriesEntry(\"Rank (Blackbox)\",name,TW.time(),(double)Mat.size(),TW.time());\n\tData.addCurrentEntryMetaData(mmd);\n\t\/\/ Data.addCurrentSerieMetaData(mmd);\n\t\/\/ Data.addMetaData(mmd);\n\n\n\tshowAdvanceLinear(2,1,2);\n\n\tTW.clear() ;\n\tj = 0 ;\n\twhile( Data.keepon(j,TW.time()) ) {\n\t\tTW.start() ;\n\t\tunsigned long d ;\n\t\tLinBox::rank(d,Mat,Method::SparseElimination());\n\t\tTW.stop();\n\t\t++j ;\n\t}\n\n\tData.selectSeries(\"Rank (SparseElimination)\");\n\tData.setCurrentSeriesEntry(name,TW.time(),(double)Mat.size(),TW.time());\n\tData.addCurrentEntryMetaData(mmd);\n\n}\n\nvoid bench_rank(int carac)\n{\n\ttypedef LinBox::Modular Field0 ;\n\tField0 F(carac);\n\tint nb = 1;\n\n\t\/\/! @bug no gz reader ?\n\n\tstd::string m1 = \"matrix\/bibd_12_5_66x792.sms\" ; ++nb;\n\tstd::string m2 = \"matrix\/bibd_13_6_78x1716.sms\" ; ++nb;\n\tstd::string m3 = \"matrix\/bibd_14_7_91x3432.sms\" ; ++nb;\n\n\tPlotData Data;\n\tshowProgression Show((index_t)nb) ;\n\n\tlaunch_bench_rank(F,m1,Data);\n\tShow.FinishIter();\n\n\tlaunch_bench_rank(F,m2,Data);\n\tShow.FinishIter();\n\n\tlaunch_bench_rank(F,m3,Data);\n\tShow.FinishIter();\n\n\t\/\/\/\/\/ PLOT STYLE \/\/\/\/\n\tLinBox::PlotStyle Style;\n\tStyle.setTerm(LinBox::PlotStyle::Term::eps);\n\tStyle.setTitle(\"Rank algorithms\",\"seconds\",\"matrices\");\n\tStyle.setXtics(LinBox::PlotStyle::Options::oblique);\n\n\tStyle.setPlotType(LinBox::PlotStyle::Plot::histo);\n\tStyle.setLineType(LinBox::PlotStyle::Line::histogram);\n\n\n\tLinBox::PlotGraph Graph(Data,Style);\n\tGraph.setOutFilename(\"rank_comparison\");\n\n\t\/\/ Graph.plot();\n\n\tGraph.print(Tag::Printer::gnuplot);\n\n\t\/\/ change style\n\tGraph.refStyle().setTerm(LinBox::PlotStyle::Term::png);\n\tGraph.print(Tag::Printer::gnuplot);\n\n\tGraph.print(Tag::Printer::xml);\n\tGraph.print(Tag::Printer::html);\n\n\treturn;\n}\n\n\/* main *\/\n\nint main( int ac, char ** av)\n{\n\t\/* Argument parsing\/setting *\/\n\n\tstatic index_t min = 100; \/* min size *\/\n\tstatic index_t max = 1500; \/* max size (not included) *\/\n\tstatic index_t step = 300; \/* step between 2 sizes *\/\n\t\/\/ static std::list lst ; \/* what bench to start ? *\/\n\t\/\/ lst.push_front(1);\/\/ ={1,2} vivement le nouveau std...\n\t\/\/ lst.push_front(2);\n\n\tstatic Argument as[] = {\n\t\t{ 'm', \"-m min\" , \"Set minimal size of matrix to test.\" , TYPE_INT , &min },\n\t\t{ 'M', \"-M Max\" , \"Set maximal size.\" , TYPE_INT , &max },\n\t\t{ 's', \"-s step\", \"Sets the gap between two matrix sizes.\", TYPE_INT , &step },\n\t\t\/\/ { 'l', \"-l list\", \"Only launches a subset of available benchmarks\\n - 1: compare to raw blas\\n - 2:various square sizes\\n - 3:various shapes\\n - 4: various parameters (a,b)\\n - 5 : various transp. combinations\", TYPE_INTLIST, &lst },\n\t\tEND_OF_ARGUMENTS\n\t};\n\n\tparseArguments (ac, av, as);\n\n\tif (min >= max) {\n\t\tthrow LinBoxError(\"min value should be smaller than max...\");\n\t}\n\tif (min + step >= max) {\n\t\tstd::cout << \"Warning : your x axis has only one point. You should have a smaller step.\" << std::endl;\n\t}\n\n\t\/* square for various fields *\/\n\t{\n\t\tstd::cout << \" *** Lines plot *** \" << std::endl;\n\t\tstd::cout << \"Benchmark square matrix multiplication via BMD.mul()\" << std::endl;\n\t\tbench_square(min,max,step,13);\n\t}\n\n\t\/* different sparse matrix *\/\n\n\t{\n\t\tstd::cout << \" *** Bar plot *** \" << std::endl;\n\t\tstd::cout << \"Benchmark different matrices on different rank algorithms\" << std::endl;\n\t\tbench_rank(13);\n\t}\n\n\n\n\treturn EXIT_SUCCESS ;\n}\n\n\/\/ Local Variables:\n\/\/ mode: C++\n\/\/ tab-width: 8\n\/\/ indent-tabs-mode: nil\n\/\/ c-basic-offset: 8\n\/\/ End:\n\/\/ vim:sts=8:sw=8:ts=8:noet:sr:cino=>s,f0,{0,g0,(0,\\:0,t0,+0,=s\ndouble vs int\/* Copyright (C) 2011 LinBox\n * Written by BB \n *\n *\n *\n * ========LICENCE========\n * This file is part of the library LinBox.\n *\n * LinBox 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.\t See the GNU\n * Lesser General Public License for more details.\n *\n * You should have received 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\/*! @file benchmarks\/benchmark-example.C\n * @ingroup benchmarks\n * @brief Benchmarking example\n * @example benchmark\n *\/\n\n#include \"benchmarks\/benchmark.h\"\n#include \"linbox\/util\/error.h\"\n#include \"fflas-ffpack\/fflas-ffpack.h\"\n#include \"linbox\/field\/modular.h\"\n#include \"linbox\/field\/modular-balanced.h\"\n#include \"linbox\/matrix\/random-matrix.h\"\n#include \"linbox\/matrix\/dense-matrix.h\"\n#include \"linbox\/matrix\/matrix-domain.h\"\n#include \"linbox\/matrix\/sparse-matrix.h\"\n#include \"linbox\/solutions\/rank.h\"\n\n\nusing namespace LinBox ;\nusing Givaro::Timer;\n\n\/* compute MegaFLOPS for mat mul (2 m n k) *\/\ndouble mm_mflops(index_t m, index_t n, index_t k)\n{\n\treturn 2*(double)m\/100*(double)n\/100*(double)k\/100 ;\n}\n\n\/* Benchmark on a field *\/\n\n\/*! @internal\n * @brief launches the benchmarks for the square case.\n * @param F field\n * @param min min size to bench\n * @param max max size to bench\n * @param step step between two sizes\n * @param Data where data is stored\n * @param series_nb index of the current series of measures.\n *\/\ntemplate\nvoid launch_bench_square(Field & F \/\/ const problem\n\t\t\t , index_t min, index_t max, index_t step \/\/ no negative step\n\t\t\t , PlotData & Data\n\t\t\t)\n{\n\tlinbox_check(step);\n\tlinbox_check(min <= max);\n\n\tstd::ostringstream nam ;\n\tF.write(nam);\n\t\/\/ Data.setCurrentSerieName(nam.str());\n\n\tData.newSerie(nam.str());\n\tChrono TW ;\n\n\ttypedef typename Field::RandIter Randiter ;\n\tRanditer R(F) ;\n\tBlasMatrixDomain BMD(F) ;\n\tRandomDenseMatrix RandMat(F,R);\n\n\tfor ( index_t i = min ; i < max ; i += step ) {\n\n\t\tshowAdvanceLinear(i,min,max);\n\t\tsize_t ii = i ;\n\t\tBlasMatrix A (F,ii,ii);\n\t\tBlasMatrix B (F,ii,ii);\n\t\tBlasMatrix C (F,ii,ii);\n\n\t\tindex_t j = 0 ; \/\/ number of repets.\n\n\t\tRandMat.random(A);\n\t\tRandMat.random(B);\n\t\tRandMat.random(C);\n\t\tTW.clear() ;\n\t\twhile( Data.keepon(j,TW.time()) ) {\n\t\t\tTW.start() ;\n\t\t\tBMD.mul(C,A,B) ; \/\/ C = AB\n\t\t\tTW.stop();\n\t\t\t++j ;\n\t\t}\n\t\tdouble mflops = computeMFLOPS(TW.times(),mm_mflops(i,i,i));\n\n\t\tData.setCurrentSeriesEntry(i,mflops,(double)i,TW.time()); \/\/ could be i*i*i\n\n\t}\n\n\tData.finishSerie();\n}\n\n\/* Collects Benchmarks *\/\n\n\n\/*! @brief Benchmark square fgemm Y=AX for several fields.\n * @param min min size\n * @param max max size\n * @param step step of the size between 2 benchmarks\n * @param charac characteristic of the field.\n *\/\nvoid bench_square( index_t min, index_t max, index_t step, int charac )\n{\n\n\tindex_t nb = 1 ;\/\/ une col de plus (la première)\n\ttypedef LinBox::Modular Field0 ; ++nb ;\n\ttypedef LinBox::Modular Field1 ; ++nb ;\n\t\/\/ typedef LinBox::Modular Field2 ; ++nb ;\n\t\/\/ typedef LinBox::ModularBalanced Field3 ; ++nb ;\n\t\/\/ typedef LinBox::ModularBalanced Field4 ; ++nb ;\n\t\/\/ typedef LinBox::ModularBalanced Field5 ; ++nb ;\n\t\/\/ GivaroZpZ\n\n\t\/\/\/\/\/ DATA HARVEST \/\/\/\/\n\n\tPlotData Data;\n\tshowProgression Show(nb) ;\n\n\tField0 F0(charac) ;\n\t\/\/ launch_bench_square(F0,100,1500,300,Data);\n\tlaunch_bench_square(F0,min,max,step,Data);\n\tShow.FinishIter();\n\n\tif (charac < 2048) {\n\t\tField1 F1(charac) ;\n\t\t\/\/ launch_bench_square(F1,200,1500,200,Data);\n\t\tlaunch_bench_square(F1,min,max,step,Data);\n\t\tShow.FinishIter();\n\t}\n\telse {\n\t\tShow.SkipIter();\n\t}\n\n\n\n#if 0\n\tField2 F2(charac) ;\n\tlaunch_bench_square(F2,min,max,step,Data);\n\tShow.FinishIter();\n\n\tField3 F3(charac) ;\n\tlaunch_bench_square(F3,min,max,step,Data);\n\tShow.FinishIter();\n\n\tif (charac < 2048) {\n\t\tField4 F4(charac) ;\n\t\tlaunch_bench_square(F4,min,max,step,Data);\n\t\tShow.FinishIter();\n\t}\n\telse {\n\t\tShow.SkipIter();\n\t}\n\n\tField5 F5(charac) ;\n\tlaunch_bench_square(F5,min,max,step,Data);\n\tShow.FinishIter();\n#endif\n\n\t\/\/\/\/\/ PLOT STYLE \/\/\/\/\n\tLinBox::PlotStyle Style;\n\n\tStyle.setTerm(LinBox::PlotStyle::Term::eps);\n\tStyle.setTitle(\"BlasMatrixDomain mul\",\"Mflops\",\"dimensions\");\n\n\tStyle.setPlotType(LinBox::PlotStyle::Plot::graph);\n\tStyle.setLineType(LinBox::PlotStyle::Line::linespoints);\n\n\n\tLinBox::PlotGraph Graph(Data,Style);\n\tGraph.setOutFilename(\"bmdmul_square\");\n\n\t\/\/ Graph.plot();\n\n\tGraph.print(Tag::Printer::gnuplot);\n\n\tGraph.print(Tag::Printer::tex);\n\tGraph.print(Tag::Printer::csv);\n\n\treturn ;\n\n}\n\ntemplate\nvoid launch_bench_rank(const Field &F, const std::string & name\n\t\t\t , PlotData & Data\n\t\t )\n{\n\n\tSparseMatrix Mat(F);\n\tstd::ifstream mat1 (name);\n\tMat.read(mat1);\n\n\tMatrixMetaData mmd (Mat,name);\n\n\t\/\/ Data.newSerie(name);\n\tChrono TW ;\n\n\tshowAdvanceLinear(1,1,2);\n\n\tTW.clear() ;\n\tindex_t j = 0 ;\n\twhile( Data.keepon(j,TW.time()) ) {\n\t\tTW.start() ;\n\t\tunsigned long d ;\n\t\tLinBox::rank(d,Mat,Method::Blackbox());\n\t\tTW.stop();\n\t\t++j ;\n\t}\n\n\t\/\/ double mflops = computeMFLOPS(TW.times(),mm_mflops(i,i,i));\n\n\tData.setSeriesEntry(\"Rank (Blackbox)\",name,TW.time(),(double)Mat.size(),TW.time());\n\tData.addCurrentEntryMetaData(mmd);\n\t\/\/ Data.addCurrentSerieMetaData(mmd);\n\t\/\/ Data.addMetaData(mmd);\n\n\n\tshowAdvanceLinear(2,1,2);\n\n\tTW.clear() ;\n\tj = 0 ;\n\twhile( Data.keepon(j,TW.time()) ) {\n\t\tTW.start() ;\n\t\tunsigned long d ;\n\t\tLinBox::rank(d,Mat,Method::SparseElimination());\n\t\tTW.stop();\n\t\t++j ;\n\t}\n\n\tData.selectSeries(\"Rank (SparseElimination)\");\n\tData.setCurrentSeriesEntry(name,TW.time(),(double)Mat.size(),TW.time());\n\tData.addCurrentEntryMetaData(mmd);\n\n}\n\nvoid bench_rank(int carac)\n{\n\ttypedef LinBox::Modular Field0 ;\n\tField0 F(carac);\n\tint nb = 1;\n\n\t\/\/! @bug no gz reader ?\n\n\tstd::string m1 = \"matrix\/bibd_12_5_66x792.sms\" ; ++nb;\n\tstd::string m2 = \"matrix\/bibd_13_6_78x1716.sms\" ; ++nb;\n\tstd::string m3 = \"matrix\/bibd_14_7_91x3432.sms\" ; ++nb;\n\n\tPlotData Data;\n\tshowProgression Show((index_t)nb) ;\n\n\tlaunch_bench_rank(F,m1,Data);\n\tShow.FinishIter();\n\n\tlaunch_bench_rank(F,m2,Data);\n\tShow.FinishIter();\n\n\tlaunch_bench_rank(F,m3,Data);\n\tShow.FinishIter();\n\n\t\/\/\/\/\/ PLOT STYLE \/\/\/\/\n\tLinBox::PlotStyle Style;\n\tStyle.setTerm(LinBox::PlotStyle::Term::eps);\n\tStyle.setTitle(\"Rank algorithms\",\"seconds\",\"matrices\");\n\tStyle.setXtics(LinBox::PlotStyle::Options::oblique);\n\n\tStyle.setPlotType(LinBox::PlotStyle::Plot::histo);\n\tStyle.setLineType(LinBox::PlotStyle::Line::histogram);\n\n\n\tLinBox::PlotGraph Graph(Data,Style);\n\tGraph.setOutFilename(\"rank_comparison\");\n\n\t\/\/ Graph.plot();\n\n\tGraph.print(Tag::Printer::gnuplot);\n\n\t\/\/ change style\n\tGraph.refStyle().setTerm(LinBox::PlotStyle::Term::png);\n\tGraph.print(Tag::Printer::gnuplot);\n\n\tGraph.print(Tag::Printer::xml);\n\tGraph.print(Tag::Printer::html);\n\n\treturn;\n}\n\n\/* main *\/\n\nint main( int ac, char ** av)\n{\n\t\/* Argument parsing\/setting *\/\n\n\tstatic index_t min = 100; \/* min size *\/\n\tstatic index_t max = 1500; \/* max size (not included) *\/\n\tstatic index_t step = 300; \/* step between 2 sizes *\/\n\t\/\/ static std::list lst ; \/* what bench to start ? *\/\n\t\/\/ lst.push_front(1);\/\/ ={1,2} vivement le nouveau std...\n\t\/\/ lst.push_front(2);\n\n\tstatic Argument as[] = {\n\t\t{ 'm', \"-m min\" , \"Set minimal size of matrix to test.\" , TYPE_INT , &min },\n\t\t{ 'M', \"-M Max\" , \"Set maximal size.\" , TYPE_INT , &max },\n\t\t{ 's', \"-s step\", \"Sets the gap between two matrix sizes.\", TYPE_INT , &step },\n\t\t\/\/ { 'l', \"-l list\", \"Only launches a subset of available benchmarks\\n - 1: compare to raw blas\\n - 2:various square sizes\\n - 3:various shapes\\n - 4: various parameters (a,b)\\n - 5 : various transp. combinations\", TYPE_INTLIST, &lst },\n\t\tEND_OF_ARGUMENTS\n\t};\n\n\tparseArguments (ac, av, as);\n\n\tif (min >= max) {\n\t\tthrow LinBoxError(\"min value should be smaller than max...\");\n\t}\n\tif (min + step >= max) {\n\t\tstd::cout << \"Warning : your x axis has only one point. You should have a smaller step.\" << std::endl;\n\t}\n\n\t\/* square for various fields *\/\n\t{\n\t\tstd::cout << \" *** Lines plot *** \" << std::endl;\n\t\tstd::cout << \"Benchmark square matrix multiplication via BMD.mul()\" << std::endl;\n\t\tbench_square(min,max,step,13);\n\t}\n\n\t\/* different sparse matrix *\/\n\n\t{\n\t\tstd::cout << \" *** Bar plot *** \" << std::endl;\n\t\tstd::cout << \"Benchmark different matrices on different rank algorithms\" << std::endl;\n\t\tbench_rank(13);\n\t}\n\n\n\n\treturn EXIT_SUCCESS ;\n}\n\n\/\/ Local Variables:\n\/\/ mode: C++\n\/\/ tab-width: 8\n\/\/ indent-tabs-mode: nil\n\/\/ c-basic-offset: 8\n\/\/ End:\n\/\/ vim:sts=8:sw=8:ts=8:noet:sr:cino=>s,f0,{0,g0,(0,\\:0,t0,+0,=s\n<|endoftext|>"} {"text":"#pragma once\n\n\n#include \n\n\nnamespace DO {\n\n \/\/! \\defgroup ColorTypes Color typedefs\n \/\/! @{\n\n\n \/\/ ======================================================================== \/\/\n \/\/! Macro for generic color typedefs like in OpenGL.\n#define DEFINE_GENERIC_COLOR_TYPEDEFS(N) \\\n \/*! \\brief Color{NumChannels}{ChannelType} *\/ \\\n typedef Matrix Color##N##ub; \\\n \/*! \\brief Color{NumChannels}{ChannelType} *\/ \\\n typedef Matrix Color##N##b; \\\n \/*! \\brief Color{NumChannels}{ChannelType} *\/ \\\n typedef Matrix Color##N##us;\\\n \/*! \\brief Color{NumChannels}{ChannelType} *\/ \\\n typedef Matrix Color##N##s; \\\n \/*! \\brief Color{NumChannels}{ChannelType}. *\/ \\\n typedef Matrix Color##N##ui; \\\n \/*! \\brief Color{NumChannels}{ChannelType} *\/ \\\n typedef Matrix Color##N##i; \\\n \/*! \\brief Color{NumChannels}{ChannelType} *\/ \\\n typedef Matrix Color##N##f; \\\n \/*! \\brief Color{NumChannels}{ChannelType} *\/ \\\n typedef Matrix Color##N##d;\n\n DEFINE_GENERIC_COLOR_TYPEDEFS(3)\n DEFINE_GENERIC_COLOR_TYPEDEFS(4)\n#undef DEFINE_GENERIC_COLOR_TYPEDEFS\n\n \/\/ ======================================================================== \/\/\n \/\/! Macro for color typedefs.\n#define DEFINE_COLOR_TYPES(colorspace) \\\n \/*! \\brief {ColorSpace}{BitDepthPerChannel} *\/ \\\n typedef Pixel colorspace##8; \\\n \/*! \\brief {PixelSpace}{BitDepthPerChannel} *\/ \\\n typedef Pixel colorspace##16; \\\n \/*! \\brief {PixelSpace}{BitDepthPerChannel} *\/ \\\n typedef Pixel colorspace##32; \\\n \/*! \\brief {PixelSpace}{BitDepthPerChannel} *\/ \\\n typedef Pixel colorspace##8s; \\\n \/*! \\brief {PixelSpace}{BitDepthPerChannel} *\/ \\\n typedef Pixel colorspace##16s; \\\n \/*! \\brief {PixelSpace}{BitDepthPerChannel} *\/ \\\n typedef Pixel colorspace##32s; \\\n \/*! \\brief {PixelSpace}{BitDepthPerChannel} *\/ \\\n typedef Pixel colorspace##32f; \\\n \/*! \\brief {PixelSpace}{BitDepthPerChannel} *\/ \\\n typedef Pixel colorspace##64f;\n\n DEFINE_COLOR_TYPES(Rgb)\n DEFINE_COLOR_TYPES(Rgba)\n DEFINE_COLOR_TYPES(Yuv)\n#undef DEFINE_COLOR_TYPES\n\n \/\/! @} ColorTypes\n\n\n \/\/ ======================================================================== \/\/\n \/\/! \\defgroup PrimaryColors Primary Colors in RGB.\n \/\/! @{\n\n \/\/! White color function.\n template inline Matrix white()\n { \n return Matrix(\n channel_max_value(),\n channel_max_value(),\n channel_max_value() );\n }\n \/\/! Black color function.\n template inline Matrix black()\n { \n return Matrix(\n channel_min_value(),\n channel_min_value(),\n channel_min_value() );\n }\n \/\/! Red color function.\n template inline Matrix red()\n {\n return Matrix(\n channel_max_value(),\n channel_min_value(),\n channel_min_value() );\n }\n \/\/! Green color function.\n template inline Matrix green()\n {\n return Matrix(\n channel_min_value(),\n channel_max_value(),\n channel_min_value() );\n }\n \/\/! Blue color function.\n template inline Matrix blue()\n {\n return Matrix(\n channel_min_value(),\n channel_min_value(),\n channel_max_value() );\n }\n \/\/! Cyan color function.\n template inline Matrix cyan()\n {\n return Matrix(\n channel_min_value(),\n channel_max_value(),\n channel_max_value() );\n }\n \/\/! Yellow color function.\n template inline Matrix yellow()\n {\n return Matrix(\n channel_max_value(),\n channel_max_value(),\n channel_min_value() );\n }\n \/\/! Magenta color function.\n template inline Matrix magenta()\n {\n return Matrix(\n channel_max_value(),\n channel_min_value(),\n channel_max_value() );\n }\n\n \/\/! Primary color definition.\n#define DEFINE_COLOR_CONSTANT(Name, function) \\\n \/*! \\brief Return primary color of type Rgb8. *\/ \\\n const Rgb8 Name##8(function()); \\\n \/*! \\brief Return primary color of type Rgb8s. *\/ \\\n const Rgb8s Name##8s(function()); \\\n \/*! \\brief Return primary color of type Rgb16. *\/ \\\n const Rgb16 Name##16(function()); \\\n \/*! \\brief Return primary color of type Rgb16s. *\/\\\n const Rgb16s Name##16s(function()); \\\n \/*! \\brief Return primary color of type Rgb32. *\/ \\\n const Rgb32 Name##32(function()); \\\n \/*! \\brief Return primary color of type Rgb32s. *\/\\\n const Rgb32s Name##32s(function()); \\\n \/*! \\brief Return primary color of type Rgb32f. *\/\\\n const Rgb32f Name##32f(function()); \\\n \/*! \\brief Return primary color of type Rgb64f. *\/\\\n const Rgb64f Name##64f(function());\n\n DEFINE_COLOR_CONSTANT(Red, red)\n DEFINE_COLOR_CONSTANT(Green, green)\n DEFINE_COLOR_CONSTANT(Blue, blue)\n DEFINE_COLOR_CONSTANT(Cyan, cyan)\n DEFINE_COLOR_CONSTANT(Magenta, magenta)\n DEFINE_COLOR_CONSTANT(Yellow, yellow)\n DEFINE_COLOR_CONSTANT(Black, black)\n DEFINE_COLOR_CONSTANT(White, white)\n#undef DEFINE_COLOR_CONSTANT\n\n \/\/! @}\n\n\n} \/* namespace DO *\/Add missing header inclusion to file 'Typedefs.hpp'.#pragma once\n\n\n#include \n#include \n#include \n\n\nnamespace DO {\n\n \/\/! \\defgroup ColorTypes Color typedefs\n \/\/! @{\n\n \/\/ ======================================================================== \/\/\n \/\/! Macro for generic color typedefs like in OpenGL.\n#define DEFINE_GENERIC_COLOR_TYPEDEFS(N) \\\n \/*! \\brief Color{NumChannels}{ChannelType} *\/ \\\n typedef Matrix Color##N##ub; \\\n \/*! \\brief Color{NumChannels}{ChannelType} *\/ \\\n typedef Matrix Color##N##b; \\\n \/*! \\brief Color{NumChannels}{ChannelType} *\/ \\\n typedef Matrix Color##N##us;\\\n \/*! \\brief Color{NumChannels}{ChannelType} *\/ \\\n typedef Matrix Color##N##s; \\\n \/*! \\brief Color{NumChannels}{ChannelType}. *\/ \\\n typedef Matrix Color##N##ui; \\\n \/*! \\brief Color{NumChannels}{ChannelType} *\/ \\\n typedef Matrix Color##N##i; \\\n \/*! \\brief Color{NumChannels}{ChannelType} *\/ \\\n typedef Matrix Color##N##f; \\\n \/*! \\brief Color{NumChannels}{ChannelType} *\/ \\\n typedef Matrix Color##N##d;\n\n DEFINE_GENERIC_COLOR_TYPEDEFS(3)\n DEFINE_GENERIC_COLOR_TYPEDEFS(4)\n#undef DEFINE_GENERIC_COLOR_TYPEDEFS\n\n \/\/ ======================================================================== \/\/\n \/\/! Macro for color typedefs.\n#define DEFINE_COLOR_TYPES(colorspace) \\\n \/*! \\brief {ColorSpace}{BitDepthPerChannel} *\/ \\\n typedef Pixel colorspace##8; \\\n \/*! \\brief {PixelSpace}{BitDepthPerChannel} *\/ \\\n typedef Pixel colorspace##16; \\\n \/*! \\brief {PixelSpace}{BitDepthPerChannel} *\/ \\\n typedef Pixel colorspace##32; \\\n \/*! \\brief {PixelSpace}{BitDepthPerChannel} *\/ \\\n typedef Pixel colorspace##8s; \\\n \/*! \\brief {PixelSpace}{BitDepthPerChannel} *\/ \\\n typedef Pixel colorspace##16s; \\\n \/*! \\brief {PixelSpace}{BitDepthPerChannel} *\/ \\\n typedef Pixel colorspace##32s; \\\n \/*! \\brief {PixelSpace}{BitDepthPerChannel} *\/ \\\n typedef Pixel colorspace##32f; \\\n \/*! \\brief {PixelSpace}{BitDepthPerChannel} *\/ \\\n typedef Pixel colorspace##64f;\n\n DEFINE_COLOR_TYPES(Rgb)\n DEFINE_COLOR_TYPES(Rgba)\n DEFINE_COLOR_TYPES(Yuv)\n#undef DEFINE_COLOR_TYPES\n\n \/\/! @} ColorTypes\n\n\n \/\/ ======================================================================== \/\/\n \/\/! \\defgroup PrimaryColors Primary Colors in RGB.\n \/\/! @{\n\n \/\/! White color function.\n template inline Matrix white()\n { \n return Matrix(\n channel_max_value(),\n channel_max_value(),\n channel_max_value() );\n }\n \/\/! Black color function.\n template inline Matrix black()\n { \n return Matrix(\n channel_min_value(),\n channel_min_value(),\n channel_min_value() );\n }\n \/\/! Red color function.\n template inline Matrix red()\n {\n return Matrix(\n channel_max_value(),\n channel_min_value(),\n channel_min_value() );\n }\n \/\/! Green color function.\n template inline Matrix green()\n {\n return Matrix(\n channel_min_value(),\n channel_max_value(),\n channel_min_value() );\n }\n \/\/! Blue color function.\n template inline Matrix blue()\n {\n return Matrix(\n channel_min_value(),\n channel_min_value(),\n channel_max_value() );\n }\n \/\/! Cyan color function.\n template inline Matrix cyan()\n {\n return Matrix(\n channel_min_value(),\n channel_max_value(),\n channel_max_value() );\n }\n \/\/! Yellow color function.\n template inline Matrix yellow()\n {\n return Matrix(\n channel_max_value(),\n channel_max_value(),\n channel_min_value() );\n }\n \/\/! Magenta color function.\n template inline Matrix magenta()\n {\n return Matrix(\n channel_max_value(),\n channel_min_value(),\n channel_max_value() );\n }\n\n \/\/! Primary color definition.\n#define DEFINE_COLOR_CONSTANT(Name, function) \\\n \/*! \\brief Return primary color of type Rgb8. *\/ \\\n const Rgb8 Name##8(function()); \\\n \/*! \\brief Return primary color of type Rgb8s. *\/ \\\n const Rgb8s Name##8s(function()); \\\n \/*! \\brief Return primary color of type Rgb16. *\/ \\\n const Rgb16 Name##16(function()); \\\n \/*! \\brief Return primary color of type Rgb16s. *\/\\\n const Rgb16s Name##16s(function()); \\\n \/*! \\brief Return primary color of type Rgb32. *\/ \\\n const Rgb32 Name##32(function()); \\\n \/*! \\brief Return primary color of type Rgb32s. *\/\\\n const Rgb32s Name##32s(function()); \\\n \/*! \\brief Return primary color of type Rgb32f. *\/\\\n const Rgb32f Name##32f(function()); \\\n \/*! \\brief Return primary color of type Rgb64f. *\/\\\n const Rgb64f Name##64f(function());\n\n DEFINE_COLOR_CONSTANT(Red, red)\n DEFINE_COLOR_CONSTANT(Green, green)\n DEFINE_COLOR_CONSTANT(Blue, blue)\n DEFINE_COLOR_CONSTANT(Cyan, cyan)\n DEFINE_COLOR_CONSTANT(Magenta, magenta)\n DEFINE_COLOR_CONSTANT(Yellow, yellow)\n DEFINE_COLOR_CONSTANT(Black, black)\n DEFINE_COLOR_CONSTANT(White, white)\n#undef DEFINE_COLOR_CONSTANT\n\n \/\/! @}\n\n\n} \/* namespace DO *\/<|endoftext|>"} {"text":"coverity#704894 Explicit NULL derefenced<|endoftext|>"} {"text":"Refactor a tiny bit of SwLayAction::IsShortCut<|endoftext|>"} {"text":"\/*************************************************************************\n *\n * $RCSfile: itrform2.hxx,v $\n *\n * $Revision: 1.12 $\n *\n * last change: $Author: kz $ $Date: 2004-03-25 12:53: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 _ITRFORM2_HXX\n#define _ITRFORM2_HXX\n\n#include \"itrpaint.hxx\"\n\nclass SwFlyCntPortion;\nclass SwInterHyphInfo;\nclass SwDropPortion;\nclass SwFmtDrop;\nclass SwDrawObjs;\nclass SwTxtAttr;\nclass SwNumberPortion;\nclass SwErgoSumPortion;\nclass SwExpandPortion;\nclass SwMultiPortion;\nclass SvLongs;\n\n\/*************************************************************************\n * class SwTxtFormatter\n *************************************************************************\/\n\nclass SwTxtFormatter : public SwTxtPainter\n{\n const SwFmtDrop *pDropFmt;\n SwMultiPortion* pMulti; \/\/ during formatting a multi-portion\n sal_uInt8 nCntEndHyph; \/\/ zaehlt aufeinanderfolgende Hyphens am Zeilenende\n sal_uInt8 nCntMidHyph; \/\/ zaehlt aufeinanderfolgende Hyphens vor Flies\n xub_StrLen nLeftScanIdx; \/\/ for increasing performance during\n xub_StrLen nRightScanIdx; \/\/ scanning for portion ends\n sal_Bool bOnceMore : 1; \/\/ noch 'ne Runde?\n sal_Bool bFlyInCntBase : 1; \/\/ Base-Referenz der zeichengeb. Rahmen setzen\n sal_Bool bChanges : 1; \/\/ Flag, fuer die Berechnung des Repaint-Rechtecks\n sal_Bool bTruncLines : 1; \/\/ Flag, Repaint-Rechtecks ggf. erweitern\n sal_Bool bUnclipped : 1; \/\/ Flag, ob Repaint groesser als feste Zeilenhoehe\n SwLinePortion *NewPortion( SwTxtFormatInfo &rInf );\n SwTxtPortion *NewTxtPortion( SwTxtFormatInfo &rInf );\n SwLinePortion *NewExtraPortion( SwTxtFormatInfo &rInf );\n SwTabPortion *NewTabPortion( SwTxtFormatInfo &rInf, bool bAuto ) const;\n SwNumberPortion *NewNumberPortion( SwTxtFormatInfo &rInf ) const;\n SwDropPortion *NewDropPortion( SwTxtFormatInfo &rInf );\n SwNumberPortion *NewFtnNumPortion( SwTxtFormatInfo &rInf ) const;\n SwErgoSumPortion *NewErgoSumPortion( SwTxtFormatInfo &rInf ) const;\n SwExpandPortion *NewFldPortion( SwTxtFormatInfo &rInf,\n const SwTxtAttr *pHt ) const;\n SwFtnPortion *NewFtnPortion( SwTxtFormatInfo &rInf, SwTxtAttr *pHt );\n SwFlyCntPortion *NewFlyCntPortion( SwTxtFormatInfo &rInf,\n SwTxtAttr *pHt ) const;\n SwLinePortion *WhichFirstPortion( SwTxtFormatInfo &rInf );\n SwTxtPortion *WhichTxtPor( SwTxtFormatInfo &rInf ) const;\n\n \/\/ Das Herzstueck der Formatierung\n void BuildPortions( SwTxtFormatInfo &rInf );\n BOOL BuildMultiPortion( SwTxtFormatInfo &rInf, SwMultiPortion& rMulti );\n\n \/\/ Berechnung des emulierten rechten Rands\n void CalcFlyWidth( SwTxtFormatInfo &rInf );\n\n \/\/ wird von SwTxtFormatter wegen UpdatePos ueberladen\n void CalcAdjustLine( SwLineLayout *pCurr );\n\n \/\/ consideres line spacing attributes\n void CalcRealHeight( sal_Bool bNewLine = sal_False );\n\n \/\/ uebertraegt die Daten nach rInf\n void FeedInf( SwTxtFormatInfo &rInf ) const;\n\n \/\/ behandelt die Unterlaufsituationen\n SwLinePortion *UnderFlow( SwTxtFormatInfo &rInf );\n\n \/\/ errechnet den Ascent und die Hoehe aus der Fontmetric\n void CalcAscent( SwTxtFormatInfo &rInf, SwLinePortion *pPor );\n\n \/\/ determines, if a optimized repaint rectange is allowed\n sal_Bool AllowRepaintOpt() const;\n\n \/\/ calculates and sets the optimized repaint offset\n long CalcOptRepaint( xub_StrLen nOldLineEnd, const SvLongs* pFlyStart );\n\n \/\/ wird von FormatLine gerufen.\n void FormatReset( SwTxtFormatInfo &rInf );\n\n \/\/ durch das Adjustment aendert sich die Position der Portions\n void UpdatePos( SwLineLayout *pCurr, Point aStart, xub_StrLen nStartIdx,\n sal_Bool bAllWays = sal_False ) const;\n\n \/\/ Setze alle FlyInCntFrms auf die uebergebene BaseLine\n void AlignFlyInCntBase( long nBaseLine ) const;\n\n \/\/ Unterlaufbedingungen bei Flys\n sal_Bool ChkFlyUnderflow( SwTxtFormatInfo &rInf ) const;\n\n \/\/ Portion einfuegen.\n void InsertPortion( SwTxtFormatInfo &rInf, SwLinePortion *pPor ) const;\n\n \/\/ schaetzt die Hoehe fuer die DropPortion\n void GuessDropHeight( const MSHORT nLines );\n\npublic:\n \/\/ errechnet die Hoehe fuer die DropPortion\n void CalcDropHeight( const MSHORT nLines );\n\n \/\/ errechnet den Bottom des Absatzes, beruecksichtigt an diesem verankerte\n \/\/ Objekte mit Umlauf 1. Absatz.\n SwTwips CalcBottomLine() const;\n\n \/\/ Beruecksichtigt zeichengebundene Objekte bei der Repaintrechteck-\n \/\/ berechnung in Zeilen mit fester Zeilenhoehe\n void CalcUnclipped( SwTwips& rTop, SwTwips& rBottom );\n\n \/\/ u.a. fuer DropCaps\n sal_Bool CalcOnceMore();\n\n void CtorInit( SwTxtFrm *pFrm, SwTxtFormatInfo *pInf );\n inline SwTxtFormatter( SwTxtFrm *pFrm, SwTxtFormatInfo *pInf )\n { CtorInit( pFrm, pInf ); }\n ~SwTxtFormatter();\n\n xub_StrLen FormatLine( const xub_StrLen nStart );\n\n void RecalcRealHeight();\n\n \/\/ Wir formatieren eine Zeile fuer die interaktive Trennung\n sal_Bool Hyphenate( SwInterHyphInfo &rInf );\n\n \/\/ Spezialmethode fuer QuoVadis-Texte\n \/\/ nErgo ist die Seitennummer der ErgoSum-Ftn\n \/\/ Bei 0 ist es noch unklar.\n xub_StrLen FormatQuoVadis( const xub_StrLen nStart );\n\n \/\/ Die Notbremse: Formatierung abbrechen, Zeile verwerfen.\n inline sal_Bool IsStop() const { return GetInfo().IsStop(); }\n\n \/\/ Das Gegenstueck: Formatierung unbedingt fortsetzen.\n inline sal_Bool IsNewLine() const { return GetInfo().IsNewLine(); }\n\n \/\/ FormatQuick(); auffrischen von Formatinformationen\n inline sal_Bool IsQuick() const { return GetInfo().IsQuick(); }\n\n \/\/ erzeugt ggfs. ein SwLineLayout, dass Ftn\/Fly--Oszillation unterbindet.\n void MakeDummyLine();\n\n \/\/ SwTxtIter-Funktionalitaet\n void Insert( SwLineLayout *pLine );\n\n \/\/ die noch verbleibende Hoehe bis zum Seitenrand\n KSHORT GetFrmRstHeight() const;\n\n \/\/ Wie breit waerest Du ohne rechte Begrenzungen (Flys etc.)?\n KSHORT _CalcFitToContent( );\n\n SwLinePortion* MakeRestPortion(const SwLineLayout* pLine, xub_StrLen nPos);\n\n inline const SwFmtDrop *GetDropFmt() const { return pDropFmt; }\n inline void ClearDropFmt() { pDropFmt = 0; }\n\n inline SwMultiPortion *GetMulti() const { return pMulti; }\n\n inline const sal_Bool IsOnceMore() const { return bOnceMore; }\n inline void SetOnceMore( sal_Bool bNew ) { bOnceMore = bNew; }\n\n inline const sal_Bool HasChanges() const { return bChanges; }\n inline void SetChanges() { bChanges = sal_True; }\n\n inline const sal_Bool HasTruncLines() const { return bTruncLines; }\n inline void SetTruncLines( sal_Bool bNew ) { bTruncLines = bNew; }\n\n inline const sal_Bool IsUnclipped() const { return bUnclipped; }\n inline void SetUnclipped( sal_Bool bNew ) { bUnclipped = bNew; }\n\n inline const sal_Bool IsFlyInCntBase() const { return bFlyInCntBase; }\n inline void SetFlyInCntBase( sal_Bool bNew = sal_True ){ bFlyInCntBase = bNew; }\n\n inline SwTxtFormatInfo &GetInfo()\n { return (SwTxtFormatInfo&)SwTxtIter::GetInfo(); }\n inline const SwTxtFormatInfo &GetInfo() const\n { return (const SwTxtFormatInfo&)SwTxtIter::GetInfo(); }\n\n inline void InitCntHyph() { CntHyphens( nCntEndHyph, nCntMidHyph ); }\n inline const sal_uInt8 &CntEndHyph() const { return nCntEndHyph; }\n inline const sal_uInt8 &CntMidHyph() const { return nCntMidHyph; }\n inline sal_uInt8 &CntEndHyph() { return nCntEndHyph; }\n inline sal_uInt8 &CntMidHyph() { return nCntMidHyph; }\n};\n\n\n\n#endif\nINTEGRATION: CWS swobjpos04 (1.12.60); FILE MERGED 2004\/05\/07 15:23:47 od 1.12.60.1: #i28701# - usage of new class \/*************************************************************************\n *\n * $RCSfile: itrform2.hxx,v $\n *\n * $Revision: 1.13 $\n *\n * last change: $Author: kz $ $Date: 2004-08-02 14:15:18 $\n *\n * The Contents of this file are made available subject to the terms of\n * either of the following licenses\n *\n * - GNU Lesser General Public License Version 2.1\n * - Sun Industry Standards Source License Version 1.1\n *\n * Sun Microsystems Inc., October, 2000\n *\n * GNU Lesser General Public License Version 2.1\n * =============================================\n * Copyright 2000 by Sun Microsystems, Inc.\n * 901 San Antonio Road, Palo Alto, CA 94303, USA\n *\n * This library is free software; you can redistribute it and\/or\n * modify it under the terms of the GNU Lesser General Public\n * License version 2.1, as published by the Free Software Foundation.\n *\n * This library is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU\n * Lesser General Public License for more details.\n *\n * You should have received a copy of the GNU Lesser General Public\n * License along with this library; if not, write to the Free Software\n * Foundation, Inc., 59 Temple Place, Suite 330, Boston,\n * MA 02111-1307 USA\n *\n *\n * Sun Industry Standards Source License Version 1.1\n * =================================================\n * The contents of this file are subject to the Sun Industry Standards\n * Source License Version 1.1 (the \"License\"); You may not use this file\n * except in compliance with the License. You may obtain a copy of the\n * License at http:\/\/www.openoffice.org\/license.html.\n *\n * Software provided under this License is provided on an \"AS IS\" basis,\n * WITHOUT WARRANTY OF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING,\n * WITHOUT LIMITATION, WARRANTIES THAT THE SOFTWARE IS FREE OF DEFECTS,\n * MERCHANTABLE, FIT FOR A PARTICULAR PURPOSE, OR NON-INFRINGING.\n * See the License for the specific provisions governing your rights and\n * obligations concerning the Software.\n *\n * The Initial Developer of the Original Code is: Sun Microsystems, Inc.\n *\n * Copyright: 2000 by Sun Microsystems, Inc.\n *\n * All Rights Reserved.\n *\n * Contributor(s): _______________________________________\n *\n *\n ************************************************************************\/\n#ifndef _ITRFORM2_HXX\n#define _ITRFORM2_HXX\n\n#include \"itrpaint.hxx\"\n\nclass SwFlyCntPortion;\nclass SwInterHyphInfo;\nclass SwDropPortion;\nclass SwFmtDrop;\nclass SwTxtAttr;\nclass SwNumberPortion;\nclass SwErgoSumPortion;\nclass SwExpandPortion;\nclass SwMultiPortion;\nclass SvLongs;\n\n\/*************************************************************************\n * class SwTxtFormatter\n *************************************************************************\/\n\nclass SwTxtFormatter : public SwTxtPainter\n{\n const SwFmtDrop *pDropFmt;\n SwMultiPortion* pMulti; \/\/ during formatting a multi-portion\n sal_uInt8 nCntEndHyph; \/\/ zaehlt aufeinanderfolgende Hyphens am Zeilenende\n sal_uInt8 nCntMidHyph; \/\/ zaehlt aufeinanderfolgende Hyphens vor Flies\n xub_StrLen nLeftScanIdx; \/\/ for increasing performance during\n xub_StrLen nRightScanIdx; \/\/ scanning for portion ends\n sal_Bool bOnceMore : 1; \/\/ noch 'ne Runde?\n sal_Bool bFlyInCntBase : 1; \/\/ Base-Referenz der zeichengeb. Rahmen setzen\n sal_Bool bChanges : 1; \/\/ Flag, fuer die Berechnung des Repaint-Rechtecks\n sal_Bool bTruncLines : 1; \/\/ Flag, Repaint-Rechtecks ggf. erweitern\n sal_Bool bUnclipped : 1; \/\/ Flag, ob Repaint groesser als feste Zeilenhoehe\n SwLinePortion *NewPortion( SwTxtFormatInfo &rInf );\n SwTxtPortion *NewTxtPortion( SwTxtFormatInfo &rInf );\n SwLinePortion *NewExtraPortion( SwTxtFormatInfo &rInf );\n SwTabPortion *NewTabPortion( SwTxtFormatInfo &rInf, bool bAuto ) const;\n SwNumberPortion *NewNumberPortion( SwTxtFormatInfo &rInf ) const;\n SwDropPortion *NewDropPortion( SwTxtFormatInfo &rInf );\n SwNumberPortion *NewFtnNumPortion( SwTxtFormatInfo &rInf ) const;\n SwErgoSumPortion *NewErgoSumPortion( SwTxtFormatInfo &rInf ) const;\n SwExpandPortion *NewFldPortion( SwTxtFormatInfo &rInf,\n const SwTxtAttr *pHt ) const;\n SwFtnPortion *NewFtnPortion( SwTxtFormatInfo &rInf, SwTxtAttr *pHt );\n SwFlyCntPortion *NewFlyCntPortion( SwTxtFormatInfo &rInf,\n SwTxtAttr *pHt ) const;\n SwLinePortion *WhichFirstPortion( SwTxtFormatInfo &rInf );\n SwTxtPortion *WhichTxtPor( SwTxtFormatInfo &rInf ) const;\n\n \/\/ Das Herzstueck der Formatierung\n void BuildPortions( SwTxtFormatInfo &rInf );\n BOOL BuildMultiPortion( SwTxtFormatInfo &rInf, SwMultiPortion& rMulti );\n\n \/\/ Berechnung des emulierten rechten Rands\n void CalcFlyWidth( SwTxtFormatInfo &rInf );\n\n \/\/ wird von SwTxtFormatter wegen UpdatePos ueberladen\n void CalcAdjustLine( SwLineLayout *pCurr );\n\n \/\/ consideres line spacing attributes\n void CalcRealHeight( sal_Bool bNewLine = sal_False );\n\n \/\/ uebertraegt die Daten nach rInf\n void FeedInf( SwTxtFormatInfo &rInf ) const;\n\n \/\/ behandelt die Unterlaufsituationen\n SwLinePortion *UnderFlow( SwTxtFormatInfo &rInf );\n\n \/\/ errechnet den Ascent und die Hoehe aus der Fontmetric\n void CalcAscent( SwTxtFormatInfo &rInf, SwLinePortion *pPor );\n\n \/\/ determines, if a optimized repaint rectange is allowed\n sal_Bool AllowRepaintOpt() const;\n\n \/\/ calculates and sets the optimized repaint offset\n long CalcOptRepaint( xub_StrLen nOldLineEnd, const SvLongs* pFlyStart );\n\n \/\/ wird von FormatLine gerufen.\n void FormatReset( SwTxtFormatInfo &rInf );\n\n \/\/ durch das Adjustment aendert sich die Position der Portions\n void UpdatePos( SwLineLayout *pCurr, Point aStart, xub_StrLen nStartIdx,\n sal_Bool bAllWays = sal_False ) const;\n\n \/\/ Setze alle FlyInCntFrms auf die uebergebene BaseLine\n void AlignFlyInCntBase( long nBaseLine ) const;\n\n \/\/ Unterlaufbedingungen bei Flys\n sal_Bool ChkFlyUnderflow( SwTxtFormatInfo &rInf ) const;\n\n \/\/ Portion einfuegen.\n void InsertPortion( SwTxtFormatInfo &rInf, SwLinePortion *pPor ) const;\n\n \/\/ schaetzt die Hoehe fuer die DropPortion\n void GuessDropHeight( const MSHORT nLines );\n\npublic:\n \/\/ errechnet die Hoehe fuer die DropPortion\n void CalcDropHeight( const MSHORT nLines );\n\n \/\/ errechnet den Bottom des Absatzes, beruecksichtigt an diesem verankerte\n \/\/ Objekte mit Umlauf 1. Absatz.\n SwTwips CalcBottomLine() const;\n\n \/\/ Beruecksichtigt zeichengebundene Objekte bei der Repaintrechteck-\n \/\/ berechnung in Zeilen mit fester Zeilenhoehe\n void CalcUnclipped( SwTwips& rTop, SwTwips& rBottom );\n\n \/\/ u.a. fuer DropCaps\n sal_Bool CalcOnceMore();\n\n void CtorInit( SwTxtFrm *pFrm, SwTxtFormatInfo *pInf );\n inline SwTxtFormatter( SwTxtFrm *pFrm, SwTxtFormatInfo *pInf )\n { CtorInit( pFrm, pInf ); }\n ~SwTxtFormatter();\n\n xub_StrLen FormatLine( const xub_StrLen nStart );\n\n void RecalcRealHeight();\n\n \/\/ Wir formatieren eine Zeile fuer die interaktive Trennung\n sal_Bool Hyphenate( SwInterHyphInfo &rInf );\n\n \/\/ Spezialmethode fuer QuoVadis-Texte\n \/\/ nErgo ist die Seitennummer der ErgoSum-Ftn\n \/\/ Bei 0 ist es noch unklar.\n xub_StrLen FormatQuoVadis( const xub_StrLen nStart );\n\n \/\/ Die Notbremse: Formatierung abbrechen, Zeile verwerfen.\n inline sal_Bool IsStop() const { return GetInfo().IsStop(); }\n\n \/\/ Das Gegenstueck: Formatierung unbedingt fortsetzen.\n inline sal_Bool IsNewLine() const { return GetInfo().IsNewLine(); }\n\n \/\/ FormatQuick(); auffrischen von Formatinformationen\n inline sal_Bool IsQuick() const { return GetInfo().IsQuick(); }\n\n \/\/ erzeugt ggfs. ein SwLineLayout, dass Ftn\/Fly--Oszillation unterbindet.\n void MakeDummyLine();\n\n \/\/ SwTxtIter-Funktionalitaet\n void Insert( SwLineLayout *pLine );\n\n \/\/ die noch verbleibende Hoehe bis zum Seitenrand\n KSHORT GetFrmRstHeight() const;\n\n \/\/ Wie breit waerest Du ohne rechte Begrenzungen (Flys etc.)?\n KSHORT _CalcFitToContent( );\n\n SwLinePortion* MakeRestPortion(const SwLineLayout* pLine, xub_StrLen nPos);\n\n inline const SwFmtDrop *GetDropFmt() const { return pDropFmt; }\n inline void ClearDropFmt() { pDropFmt = 0; }\n\n inline SwMultiPortion *GetMulti() const { return pMulti; }\n\n inline const sal_Bool IsOnceMore() const { return bOnceMore; }\n inline void SetOnceMore( sal_Bool bNew ) { bOnceMore = bNew; }\n\n inline const sal_Bool HasChanges() const { return bChanges; }\n inline void SetChanges() { bChanges = sal_True; }\n\n inline const sal_Bool HasTruncLines() const { return bTruncLines; }\n inline void SetTruncLines( sal_Bool bNew ) { bTruncLines = bNew; }\n\n inline const sal_Bool IsUnclipped() const { return bUnclipped; }\n inline void SetUnclipped( sal_Bool bNew ) { bUnclipped = bNew; }\n\n inline const sal_Bool IsFlyInCntBase() const { return bFlyInCntBase; }\n inline void SetFlyInCntBase( sal_Bool bNew = sal_True ){ bFlyInCntBase = bNew; }\n\n inline SwTxtFormatInfo &GetInfo()\n { return (SwTxtFormatInfo&)SwTxtIter::GetInfo(); }\n inline const SwTxtFormatInfo &GetInfo() const\n { return (const SwTxtFormatInfo&)SwTxtIter::GetInfo(); }\n\n inline void InitCntHyph() { CntHyphens( nCntEndHyph, nCntMidHyph ); }\n inline const sal_uInt8 &CntEndHyph() const { return nCntEndHyph; }\n inline const sal_uInt8 &CntMidHyph() const { return nCntMidHyph; }\n inline sal_uInt8 &CntEndHyph() { return nCntEndHyph; }\n inline sal_uInt8 &CntMidHyph() { return nCntMidHyph; }\n};\n\n\n\n#endif\n<|endoftext|>"} {"text":"Rework some loops<|endoftext|>"} {"text":"\/*\n * Funambol is a mobile platform developed by Funambol, Inc. \n * Copyright (C) 2003 - 2007 Funambol, Inc.\n * \n * This program is free software; you can redistribute it and\/or modify it under\n * the terms of the GNU Affero General Public License version 3 as published by\n * the Free Software Foundation with the addition of the following permission \n * added to Section 15 as permitted in Section 7(a): FOR ANY PART OF THE COVERED\n * WORK IN WHICH THE COPYRIGHT IS OWNED BY FUNAMBOL, FUNAMBOL DISCLAIMS THE \n * WARRANTY OF NON INFRINGEMENT OF THIRD PARTY RIGHTS.\n * \n * This program is distributed in the hope that it will be useful, but WITHOUT\n * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS\n * FOR A PARTICULAR PURPOSE. See the GNU General Public License for more\n * details.\n * \n * You should have received a copy of the GNU Affero General Public License \n * along with this program; if not, see http:\/\/www.gnu.org\/licenses or write to\n * the Free Software Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston,\n * MA 02110-1301 USA.\n * \n * You can contact Funambol, Inc. headquarters at 643 Bair Island Road, Suite \n * 305, Redwood City, CA 94063, USA, or at email address info@funambol.com.\n * \n * The interactive user interfaces in modified source and object code versions\n * of this program must display Appropriate Legal Notices, as required under\n * Section 5 of the GNU Affero General Public License version 3.\n * \n * In accordance with Section 7(b) of the GNU Affero General Public License\n * version 3, these Appropriate Legal Notices must retain the display of the\n * \"Powered by Funambol\" logo. If the display of the logo is not reasonably \n * feasible for technical reasons, the Appropriate Legal Notices must display\n * the words \"Powered by Funambol\".\n *\/\n\n#include \n#include \n#include \n#include \n\n#include \"base\/fscapi.h\"\n#include \"base\/Log.h\"\n#include \"base\/util\/utils.h\"\n#include \"base\/util\/symbianUtils.h\"\n#include \"base\/globalsdef.h\"\n\nBEGIN_NAMESPACE\n\nwchar_t * wcsncpy (wchar_t *dst, const wchar_t *src, size_t count) {\n memcpy(dst, src, count * sizeof(wchar_t));\n return dst;\n}\n\nint towlower(int c) {\n wchar_t tmpStr[2];\n tmpStr[0] = (wchar_t)c;\n tmpStr[1] = 0;\n TBuf16<1> buf = (const TUint16*)tmpStr;\n buf.LowerCase();\n const TUint16* resStr = buf.Ptr();\n return (int)*resStr;\n}\n\nint towupper(int c) {\n wchar_t tmpStr[2];\n tmpStr[1] = 0;\n tmpStr[0] = (wchar_t)c;\n TBuf16<1> buf = (const TUint16*)tmpStr;\n buf.UpperCase();\n const TUint16* resStr = buf.Ptr();\n return (int)*resStr;\n}\n\nstatic size_t estimateMaxSize(const char* format, PLATFORM_VA_LIST ap) {\n\n const char* p = format;\n size_t maxSize = strlen(format);\n while (*p) {\n if (*p == '%') {\n ++p;\n \/\/ We may have a precision or width here and we must skip it\n while ((*p) >= '0' && (*p) <= '9') {\n ++p;\n }\n char type = *p;\n switch (type) {\n case 'd':\n case 'i':\n case 'u':\n {\n maxSize += 10;\n PLATFORM_VA_ARG(ap, int32_t);\n break;\n }\n case 's':\n {\n char* s = PLATFORM_VA_ARG(ap, char*);\n maxSize += strlen(s);\n break;\n }\n case 'b':\n {\n maxSize += 32 * 8 + 2;\n PLATFORM_VA_ARG(ap, int32_t);\n break;\n }\n case 'x':\n {\n maxSize += 32 + 2;\n PLATFORM_VA_ARG(ap, int32_t);\n break;\n }\n case 'o':\n {\n maxSize += 32 * 2 + 2;\n PLATFORM_VA_ARG(ap, int32_t);\n break;\n }\n case 'c':\n {\n maxSize += 1;\n PLATFORM_VA_ARG(ap, int32_t);\n break;\n }\n case 'L':\n case 'l':\n {\n if (*(p+1) == 's') {\n \/\/ Symbian does not support %ls because the underlying\n \/\/ FormatList does not support it.\n \/\/ To avoid problems we do not print this string, as we\n \/\/ do not have an easy way of doing it\n return -2;\n } else {\n maxSize += 20;\n PLATFORM_VA_ARG(ap, int64_t);\n }\n break;\n }\n default:\n {\n \/\/ Floating point cases...\n maxSize += 50;\n }\n }\n }\n ++p;\n }\n return maxSize;\n}\n\nstatic char* translateFormat(const char* format) {\n char* ret = new char[strlen(format) + 1];\n char* p = ret;\n const char* q = format;\n\n while (*q) {\n if (*q == '%') {\n q++;\n \/\/ We may have a precision or width here and we must just copy it\n while ((*q) >= '0' && (*q) <= '9') {\n *(p++) = *(q++);\n }\n char fmt = *q;\n *(p++) = '%';\n switch (fmt) {\n case 'l':\n {\n q++;\n if (*q == 'l') {\n *p = 'L';\n q++;\n p++;\n }\n *p = *q;\n break;\n }\n default:\n {\n *p = fmt;\n }\n }\n } else {\n *p = *q;\n }\n ++q;\n ++p;\n }\n *p = NULL;\n return ret;\n}\n\nsize_t vsnprintf(char* s, size_t size, const char* format, PLATFORM_VA_LIST aq) {\n\n char* newFormat = translateFormat(format);\n TPtrC8 formatBuf((unsigned char*)newFormat);\n TInt error;\n RBuf8 formattedBuf;\n PLATFORM_VA_LIST aqCopy;\n size_t finalSize = (size_t)-1;\n\n#ifdef va_copy\n PLATFORM_VA_COPY(aqCopy, aq);\n#else\n aqCopy = aq;\n#endif\n\n size_t estimatedSize = estimateMaxSize(format, aqCopy);\n\n \/\/ Handle errors\n if (estimatedSize == -2) {\n \/\/ The string contains formats which are not supported\n \/\/ and we cannot print the string\n char* replaceMsg = \"Symbian does not support %ls\";\n int replaceMsgLen = strlen(replaceMsg);\n if (replaceMsgLen < size) {\n memcpy(s, replaceMsg, replaceMsgLen);\n s[replaceMsgLen-1] = (char)0;\n return replaceMsgLen;\n } else {\n memcpy(s, replaceMsg, size);\n if (size > 1) {\n s[size-1] = (char)0;\n return size-1;\n } else {\n return 0;\n }\n }\n }\n\n if (estimatedSize > size) {\n finalSize = estimatedSize;\n } else {\n TRAP(error, formattedBuf.CreateL(size));\n if (error == KErrNone) {\n TRAP(error, formattedBuf.FormatList(formatBuf, aq));\n if (error == KErrNone) {\n char* ptr = (char *) formattedBuf.Ptr();\n finalSize = formattedBuf.Length();\n if (finalSize < size) {\n memcpy(s, ptr, finalSize);\n s[finalSize] = (char)0; \/\/ Symbian descriptors don't have the trailing null char\n } else {\n \/\/ In this case we truncate. We signal this by returning -1\n memcpy(s, ptr, size);\n if (size) {\n s[size-1] = (char)0;\n }\n finalSize = (size_t)-1;\n }\n }\n }\n }\n\n delete newFormat;\n return finalSize;\n}\n\n\n\/\/ TODO: convert to the specified encoding, assuming wc is UTF-8\nchar* toMultibyte(const WCHAR *wc, const char *encoding)\n{\n#ifdef USE_WCHAR\n size_t length = wcstombs(NULL, wc, 0) + 1;\n if(length == (size_t)-1) {\n \/\/LOG.error(\"toMultibyte: invalid string.\");\n return strdup(\"\");\n }\n char* ret = new char[length];\n wcstombs(ret, wc, length);\n\n return ret;\n#else\n return stringdup(wc);\n#endif\n}\n\n\/\/ TODO: convert to UTF-8 from the specified encoding\nWCHAR* toWideChar(const char *mb, const char *encoding)\n{\n#ifdef USE_WCHAR\n size_t length = mbstowcs(NULL, mb, 0) + 1;\n if(length == (size_t)-1) {\n \/\/LOG.error(\"toWideChar: invalid string.\");\n return wstrdup(TEXT(\"\"));\n }\n WCHAR* ret = new WCHAR[length];\n mbstowcs(ret, mb, length);\n\n return ret;\n#else\n return stringdup(mb);\n#endif\n}\n\n\nsize_t snwprintf(WCHAR *v, size_t size, const WCHAR* format, unsigned long value) {\n\n TPtrC16 formatBuf((const TUint16*)format);\n TInt error;\n RBuf16 formattedBuf;\n\n TRAP(error, formattedBuf.CreateL(size));\n if (error == KErrNone) {\n TRAP(error, formattedBuf.Format(formatBuf, value));\n if (error == KErrNone) {\n WCHAR* ptr = (WCHAR *) formattedBuf.Ptr();\n size_t finalSize = formattedBuf.Length() * sizeof(WCHAR);\n if (finalSize < size) {\n memcpy(v, ptr, finalSize);\n v[finalSize] = 0; \/\/ Symbian descriptors don't have the trailing null char\n return finalSize;\n } else {\n \/\/ In this case we truncate. We signal this by returning -1\n memcpy(v, ptr, size);\n v[size] = 0; \/\/ Symbian descriptors don't have the trailing null char\n return (size_t)-1;\n }\n }\n }\n \/\/ We cannot format the string. Return -1.\n return (size_t)-1;\n}\n\nbool saveFile(const char *filename, const char *buffer, size_t len, bool binary)\n{\n const char *mode = binary ? \"wb\" : \"w\" ;\n\n FILE *f = fopen(filename, \"w\");\n\n if(!f)\n return false;\n\n if (fwrite(buffer, sizeof(char), len, f) != len) {\n fclose(f);\n return false;\n }\n fclose(f);\n\n return true;\n}\n\nbool readFile(const char* path, char **message, size_t *len, bool binary)\n{\n FILE *f = NULL;\n size_t msglen=0;\n char *msg=0;\n const char *mode = binary ? \"rb\" : \"r\" ;\n bool res = false;\n size_t read = 0;\n\n *len = 0;\n f = fopen(path, mode);\n if ( !f ) {\n goto done;\n }\n\n \/\/ Get file length\n fseek(f, 0, SEEK_END);\n msglen = (size_t)ftell(f);\n fseek(f, 0, SEEK_SET);\n\n msg = new char[msglen+1];\n if (!msg) {\n goto done;\n }\n\n while (read < msglen) {\n read += fread(msg + read, sizeof(char), 256, f);\n if (ferror(f)) {\n goto done;\n }\n }\n if (read != msglen) {\n goto done;\n }\n\n *len = msglen;\n msg[msglen] = 0;\n\n \/\/ Set return parameters\n *message=msg;\n msg = 0;\n res = true;\n\n done:\n if (f) {\n fclose(f);\n }\n if (msg) {\n delete [] msg;\n }\n\n return res;\n}\n\n\nWCHAR *wcschr(const WCHAR *ws, WCHAR wc) {\n LOG.error(\"***** wcschr not implemented *****\");\n return NULL;\n}\n\nWCHAR *wcsstr(WCHAR *ws1, WCHAR *ws2) {\n LOG.error(\"***** wcsstr not implemented *****\");\n return NULL;\n}\n\nWCHAR *wcstok(WCHAR *ws1, const WCHAR *ws2) {\n LOG.error(\"***** wcstok not implemented *****\");\n return NULL;\n}\n\nWCHAR *wcsncat(WCHAR *ws1, const WCHAR *ws2, size_t n) {\n LOG.error(\"***** wcsncat not implemented *****\");\n return NULL;\n}\n\ndouble wcstod(const WCHAR *nptr, WCHAR **endptr) {\n LOG.error(\"***** wcstod not implemented *****\");\n return 0.0;\n}\n\nint _wtoi(const WCHAR *str) {\n LOG.error(\"***** _wtoi not implemented *****\");\n return 0;\n}\n\nStringBuffer getCacheDirectory() {\n StringBuffer empty;\n return empty;\n}\n\nEND_NAMESPACE\n\nBug fixed in vsnprintf.\/*\n * Funambol is a mobile platform developed by Funambol, Inc. \n * Copyright (C) 2003 - 2007 Funambol, Inc.\n * \n * This program is free software; you can redistribute it and\/or modify it under\n * the terms of the GNU Affero General Public License version 3 as published by\n * the Free Software Foundation with the addition of the following permission \n * added to Section 15 as permitted in Section 7(a): FOR ANY PART OF THE COVERED\n * WORK IN WHICH THE COPYRIGHT IS OWNED BY FUNAMBOL, FUNAMBOL DISCLAIMS THE \n * WARRANTY OF NON INFRINGEMENT OF THIRD PARTY RIGHTS.\n * \n * This program is distributed in the hope that it will be useful, but WITHOUT\n * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS\n * FOR A PARTICULAR PURPOSE. See the GNU General Public License for more\n * details.\n * \n * You should have received a copy of the GNU Affero General Public License \n * along with this program; if not, see http:\/\/www.gnu.org\/licenses or write to\n * the Free Software Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston,\n * MA 02110-1301 USA.\n * \n * You can contact Funambol, Inc. headquarters at 643 Bair Island Road, Suite \n * 305, Redwood City, CA 94063, USA, or at email address info@funambol.com.\n * \n * The interactive user interfaces in modified source and object code versions\n * of this program must display Appropriate Legal Notices, as required under\n * Section 5 of the GNU Affero General Public License version 3.\n * \n * In accordance with Section 7(b) of the GNU Affero General Public License\n * version 3, these Appropriate Legal Notices must retain the display of the\n * \"Powered by Funambol\" logo. If the display of the logo is not reasonably \n * feasible for technical reasons, the Appropriate Legal Notices must display\n * the words \"Powered by Funambol\".\n *\/\n\n#include \n#include \n#include \n#include \n\n#include \"base\/fscapi.h\"\n#include \"base\/Log.h\"\n#include \"base\/util\/utils.h\"\n#include \"base\/util\/symbianUtils.h\"\n#include \"base\/globalsdef.h\"\n\nBEGIN_NAMESPACE\n\nwchar_t * wcsncpy (wchar_t *dst, const wchar_t *src, size_t count) {\n memcpy(dst, src, count * sizeof(wchar_t));\n return dst;\n}\n\nint towlower(int c) {\n wchar_t tmpStr[2];\n tmpStr[0] = (wchar_t)c;\n tmpStr[1] = 0;\n TBuf16<1> buf = (const TUint16*)tmpStr;\n buf.LowerCase();\n const TUint16* resStr = buf.Ptr();\n return (int)*resStr;\n}\n\nint towupper(int c) {\n wchar_t tmpStr[2];\n tmpStr[1] = 0;\n tmpStr[0] = (wchar_t)c;\n TBuf16<1> buf = (const TUint16*)tmpStr;\n buf.UpperCase();\n const TUint16* resStr = buf.Ptr();\n return (int)*resStr;\n}\n\nstatic size_t estimateMaxSize(const char* format, PLATFORM_VA_LIST ap) {\n\n const char* p = format;\n size_t maxSize = strlen(format);\n while (*p) {\n if (*p == '%') {\n ++p;\n \/\/ We may have a precision or width here and we must skip it\n char number[16];\n int idx = 0;\n while ((*p) >= '0' && (*p) <= '9') {\n number[idx++] = *p;\n ++p;\n }\n number[idx] = (char)0;\n char type = *p;\n switch (type) {\n case 'd':\n case 'i':\n case 'u':\n {\n maxSize += 10;\n PLATFORM_VA_ARG(ap, int32_t);\n break;\n }\n case 's':\n {\n char* s = PLATFORM_VA_ARG(ap, char*);\n int len = 0;\n if (s) {\n len = strlen(s);\n }\n int align = atoi(number);\n maxSize += (len>align) ? len : align;\n break;\n }\n case 'b':\n {\n maxSize += 32 * 8 + 2;\n PLATFORM_VA_ARG(ap, int32_t);\n break;\n }\n case 'x':\n {\n maxSize += 32 + 2;\n PLATFORM_VA_ARG(ap, int32_t);\n break;\n }\n case 'o':\n {\n maxSize += 32 * 2 + 2;\n PLATFORM_VA_ARG(ap, int32_t);\n break;\n }\n case 'c':\n {\n maxSize += 1;\n PLATFORM_VA_ARG(ap, int32_t);\n break;\n }\n case 'L':\n case 'l':\n {\n if (*(p+1) == 's') {\n \/\/ Symbian does not support %ls because the underlying\n \/\/ FormatList does not support it.\n \/\/ To avoid problems we do not print this string, as we\n \/\/ do not have an easy way of doing it\n return -2;\n } else {\n maxSize += 20;\n PLATFORM_VA_ARG(ap, int64_t);\n }\n break;\n }\n default:\n {\n \/\/ Floating point cases...\n maxSize += 50;\n }\n }\n }\n ++p;\n }\n return maxSize;\n}\n\nstatic char* translateFormat(const char* format) {\n char* ret = new char[strlen(format) + 1];\n char* p = ret;\n const char* q = format;\n\n while (*q) {\n if (*q == '%') {\n q++;\n *(p++) = '%';\n \/\/ We may have a precision or width here and we must just copy it\n while ((*q) >= '0' && (*q) <= '9') {\n *(p++) = *(q++);\n }\n char fmt = *q;\n switch (fmt) {\n case 'l':\n {\n q++;\n if (*q == 'l') {\n *p = 'L';\n q++;\n p++;\n }\n *p = *q;\n break;\n }\n default:\n {\n *p = fmt;\n }\n }\n } else {\n *p = *q;\n }\n ++q;\n ++p;\n }\n *p = NULL;\n return ret;\n}\n\nsize_t vsnprintf(char* s, size_t size, const char* format, PLATFORM_VA_LIST aq) {\n\n char* newFormat = translateFormat(format);\n TPtrC8 formatBuf((unsigned char*)newFormat);\n TInt error;\n RBuf8 formattedBuf;\n PLATFORM_VA_LIST aqCopy;\n size_t finalSize = (size_t)-1;\n\n#ifdef va_copy\n PLATFORM_VA_COPY(aqCopy, aq);\n#else\n aqCopy = aq;\n#endif\n\n size_t estimatedSize = estimateMaxSize(format, aqCopy);\n\n \/\/ Handle errors\n if (estimatedSize == -2) {\n \/\/ The string contains formats which are not supported\n \/\/ and we cannot print the string\n char* replaceMsg = \"Symbian does not support %ls\";\n int replaceMsgLen = strlen(replaceMsg);\n if (replaceMsgLen < size) {\n memcpy(s, replaceMsg, replaceMsgLen);\n s[replaceMsgLen-1] = (char)0;\n return replaceMsgLen;\n } else {\n memcpy(s, replaceMsg, size);\n if (size > 1) {\n s[size-1] = (char)0;\n return size-1;\n } else {\n return 0;\n }\n }\n }\n\n if (estimatedSize > size) {\n finalSize = estimatedSize;\n } else {\n TRAP(error, formattedBuf.CreateL(size));\n if (error == KErrNone) {\n TRAP(error, formattedBuf.FormatList(formatBuf, aq));\n if (error == KErrNone) {\n char* ptr = (char *) formattedBuf.Ptr();\n finalSize = formattedBuf.Length();\n if (finalSize < size) {\n memcpy(s, ptr, finalSize);\n s[finalSize] = (char)0; \/\/ Symbian descriptors don't have the trailing null char\n } else {\n \/\/ In this case we truncate. We signal this by returning -1\n memcpy(s, ptr, size);\n if (size) {\n s[size-1] = (char)0;\n }\n finalSize = (size_t)-1;\n }\n }\n }\n }\n\n delete newFormat;\n return finalSize;\n}\n\n\n\/\/ TODO: convert to the specified encoding, assuming wc is UTF-8\nchar* toMultibyte(const WCHAR *wc, const char *encoding)\n{\n#ifdef USE_WCHAR\n size_t length = wcstombs(NULL, wc, 0) + 1;\n if(length == (size_t)-1) {\n \/\/LOG.error(\"toMultibyte: invalid string.\");\n return strdup(\"\");\n }\n char* ret = new char[length];\n wcstombs(ret, wc, length);\n\n return ret;\n#else\n return stringdup(wc);\n#endif\n}\n\n\/\/ TODO: convert to UTF-8 from the specified encoding\nWCHAR* toWideChar(const char *mb, const char *encoding)\n{\n#ifdef USE_WCHAR\n size_t length = mbstowcs(NULL, mb, 0) + 1;\n if(length == (size_t)-1) {\n \/\/LOG.error(\"toWideChar: invalid string.\");\n return wstrdup(TEXT(\"\"));\n }\n WCHAR* ret = new WCHAR[length];\n mbstowcs(ret, mb, length);\n\n return ret;\n#else\n return stringdup(mb);\n#endif\n}\n\n\nsize_t snwprintf(WCHAR *v, size_t size, const WCHAR* format, unsigned long value) {\n\n TPtrC16 formatBuf((const TUint16*)format);\n TInt error;\n RBuf16 formattedBuf;\n\n TRAP(error, formattedBuf.CreateL(size));\n if (error == KErrNone) {\n TRAP(error, formattedBuf.Format(formatBuf, value));\n if (error == KErrNone) {\n WCHAR* ptr = (WCHAR *) formattedBuf.Ptr();\n size_t finalSize = formattedBuf.Length() * sizeof(WCHAR);\n if (finalSize < size) {\n memcpy(v, ptr, finalSize);\n v[finalSize] = 0; \/\/ Symbian descriptors don't have the trailing null char\n return finalSize;\n } else {\n \/\/ In this case we truncate. We signal this by returning -1\n memcpy(v, ptr, size);\n v[size] = 0; \/\/ Symbian descriptors don't have the trailing null char\n return (size_t)-1;\n }\n }\n }\n \/\/ We cannot format the string. Return -1.\n return (size_t)-1;\n}\n\nbool saveFile(const char *filename, const char *buffer, size_t len, bool binary)\n{\n const char *mode = binary ? \"wb\" : \"w\" ;\n\n FILE *f = fopen(filename, \"w\");\n\n if(!f)\n return false;\n\n if (fwrite(buffer, sizeof(char), len, f) != len) {\n fclose(f);\n return false;\n }\n fclose(f);\n\n return true;\n}\n\nbool readFile(const char* path, char **message, size_t *len, bool binary)\n{\n FILE *f = NULL;\n size_t msglen=0;\n char *msg=0;\n const char *mode = binary ? \"rb\" : \"r\" ;\n bool res = false;\n size_t read = 0;\n\n *len = 0;\n f = fopen(path, mode);\n if ( !f ) {\n goto done;\n }\n\n \/\/ Get file length\n fseek(f, 0, SEEK_END);\n msglen = (size_t)ftell(f);\n fseek(f, 0, SEEK_SET);\n\n msg = new char[msglen+1];\n if (!msg) {\n goto done;\n }\n\n while (read < msglen) {\n read += fread(msg + read, sizeof(char), 256, f);\n if (ferror(f)) {\n goto done;\n }\n }\n if (read != msglen) {\n goto done;\n }\n\n *len = msglen;\n msg[msglen] = 0;\n\n \/\/ Set return parameters\n *message=msg;\n msg = 0;\n res = true;\n\n done:\n if (f) {\n fclose(f);\n }\n if (msg) {\n delete [] msg;\n }\n\n return res;\n}\n\n\nWCHAR *wcschr(const WCHAR *ws, WCHAR wc) {\n LOG.error(\"***** wcschr not implemented *****\");\n return NULL;\n}\n\nWCHAR *wcsstr(WCHAR *ws1, WCHAR *ws2) {\n LOG.error(\"***** wcsstr not implemented *****\");\n return NULL;\n}\n\nWCHAR *wcstok(WCHAR *ws1, const WCHAR *ws2) {\n LOG.error(\"***** wcstok not implemented *****\");\n return NULL;\n}\n\nWCHAR *wcsncat(WCHAR *ws1, const WCHAR *ws2, size_t n) {\n LOG.error(\"***** wcsncat not implemented *****\");\n return NULL;\n}\n\ndouble wcstod(const WCHAR *nptr, WCHAR **endptr) {\n LOG.error(\"***** wcstod not implemented *****\");\n return 0.0;\n}\n\nint _wtoi(const WCHAR *str) {\n LOG.error(\"***** _wtoi not implemented *****\");\n return 0;\n}\n\nStringBuffer getCacheDirectory() {\n StringBuffer empty;\n return empty;\n}\n\nEND_NAMESPACE\n\n<|endoftext|>"} {"text":"\/*\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) 2013 Evgeniy Andreev (gsomix)\n *\/\n\n#include \n\n#include \n#include \n\nusing namespace shogun;\n\nCCSVFile::CCSVFile()\n{\n\tinit();\n}\n\nCCSVFile::CCSVFile(FILE* f, const char* name) :\n\tCFile(f, name)\n{\n\tinit();\n\tinit_with_defaults();\n}\n\nCCSVFile::CCSVFile(const char* fname, char rw, const char* name) :\n\tCFile(fname, rw, name)\n{\n\tinit();\n\tinit_with_defaults();\n}\n\nCCSVFile::~CCSVFile()\n{\n\tSG_UNREF(m_tokenizer);\n\tSG_UNREF(m_line_tokenizer);\n\tSG_UNREF(m_parser);\n\tSG_UNREF(m_line_reader);\n}\n\nvoid CCSVFile::set_order(csv_data_order order)\n{\n\tm_order=order;\n}\n\nvoid CCSVFile::set_delimiter(char delimiter)\n{\n\tm_tokenizer->delimiters[m_delimiter]=0;\n\t\n\tm_delimiter=delimiter;\n\tm_tokenizer->delimiters[m_delimiter]=1;\n}\n\nvoid CCSVFile::skip_lines(int32_t num_lines)\n{\n\tfor (int32_t i=0; iskip_line();\n}\n\nvoid CCSVFile::init()\n{\n\tm_order=FORTRAN_ORDER;\n\tm_delimiter=0;\n\n\tm_tokenizer=NULL;\n\tm_line_tokenizer=NULL;\n\tm_parser=NULL;\n\tm_line_reader=NULL;\n}\n\nvoid CCSVFile::init_with_defaults()\n{\n\tm_order=FORTRAN_ORDER;\n\tm_delimiter=',';\n\n\tm_tokenizer=new CDelimiterTokenizer(true);\n\tm_tokenizer->delimiters[m_delimiter]=1;\n\tm_tokenizer->delimiters[' ']=1;\n\tSG_REF(m_tokenizer);\n\n\tm_line_tokenizer=new CDelimiterTokenizer(true);\n\tm_line_tokenizer->delimiters['\\n']=1;\n\tSG_REF(m_line_tokenizer);\n\n\tm_parser=new CParser();\n\tm_parser->set_tokenizer(m_tokenizer);\n\n\tm_line_reader=new CLineReader(file, m_line_tokenizer);\n}\n\n#define GET_VECTOR(fname, read_func, sg_type) \\\nvoid CCSVFile::fname(sg_type*& vector, int32_t& len) \\\n{ \\\n\tif (!m_line_reader->has_next()) \\\n\t\treturn; \\\n\t\\\n\tSGVector line=m_line_reader->read_line(); \\\n\tm_tokenizer->set_text(line); \\\n\t\\\n\tlen=0; \\\n\twhile (m_tokenizer->has_next()) \\\n\t{ \\\n\t\tindex_t temp_start=0; \\\n\t\tm_tokenizer->next_token_idx(temp_start); \\\n\t\\\n\t\tlen++; \\\n\t} \\\n\t\\\n\tm_parser->set_text(line); \\\n\tvector=SG_MALLOC(sg_type, len); \\\n\tfor (int32_t i=0; iread_func(); \\\n\t} \\\n}\n\nGET_VECTOR(get_vector, read_char, int8_t)\nGET_VECTOR(get_vector, read_byte, uint8_t)\nGET_VECTOR(get_vector, read_char, char)\nGET_VECTOR(get_vector, read_int, int32_t)\nGET_VECTOR(get_vector, read_uint, uint32_t)\nGET_VECTOR(get_vector, read_short_real, float32_t)\nGET_VECTOR(get_vector, read_real, float64_t)\nGET_VECTOR(get_vector, read_long_real, floatmax_t)\nGET_VECTOR(get_vector, read_short, int16_t)\nGET_VECTOR(get_vector, read_word, uint16_t)\nGET_VECTOR(get_vector, read_long, int64_t)\nGET_VECTOR(get_vector, read_ulong, uint64_t)\n#undef GET_VECTOR\n\n#define GET_MATRIX(fname, read_func, sg_type) \\\nvoid CCSVFile::fname(sg_type*& matrix, int32_t& num_feat, int32_t& num_vec) \\\n{ \\\n\t\\\n\tint32_t nlines=0; \\\n\tint32_t ntokens=-1; \\\n\t\\\n\tint32_t last_idx=0; \\\n\tSGVector line_memory(true); \\\n\tSGVector temp(true); \\\n\twhile(m_line_reader->has_next()) \\\n\t{ \\\n\t\tread_func(temp.vector, temp.vlen); \\\n\t\tif (ntokens<0) \\\n\t\t\tntokens=temp.vlen; \\\n\t\t\\\n\t\tif (ntokens!=temp.vlen) \\\n\t\t\treturn; \\\n\t\t\\\n\t\tline_memory.resize_vector(last_idx+temp.vlen); \\\n\t\tfor (int32_t i=0; i::convert_to_matrix(matrix, num_vec, num_feat, line_memory.vector, line_memory.vlen, true); \\\n\t} \\\n\telse \\\n\t{ \\\n\t\tnum_feat=ntokens; \\\n\t\tnum_vec=nlines; \\\n\t\tSGVector::convert_to_matrix(matrix, num_vec, num_feat, line_memory.vector, line_memory.vlen, false); \\\n\t} \\\n} \\\n\nGET_MATRIX(get_matrix, get_vector, int8_t)\nGET_MATRIX(get_matrix, get_vector, uint8_t)\nGET_MATRIX(get_matrix, get_vector, char)\nGET_MATRIX(get_matrix, get_vector, int32_t)\nGET_MATRIX(get_matrix, get_vector, uint32_t)\nGET_MATRIX(get_matrix, get_vector, int64_t)\nGET_MATRIX(get_matrix, get_vector, uint64_t)\nGET_MATRIX(get_matrix, get_vector, float32_t)\nGET_MATRIX(get_matrix, get_vector, float64_t)\nGET_MATRIX(get_matrix, get_vector, floatmax_t)\nGET_MATRIX(get_matrix, get_vector, int16_t)\nGET_MATRIX(get_matrix, get_vector, uint16_t)\n#undef GET_MATRIX\n\n#define SET_VECTOR(fname, format, sg_type) \\\nvoid CCSVFile::fname(const sg_type* vector, int32_t len) \\\n{ \\\n\tfor (int32_t i=0; iswitch to C_ORDER per default\/*\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) 2013 Evgeniy Andreev (gsomix)\n *\/\n\n#include \n\n#include \n#include \n\nusing namespace shogun;\n\nCCSVFile::CCSVFile()\n{\n\tinit();\n}\n\nCCSVFile::CCSVFile(FILE* f, const char* name) :\n\tCFile(f, name)\n{\n\tinit();\n\tinit_with_defaults();\n}\n\nCCSVFile::CCSVFile(const char* fname, char rw, const char* name) :\n\tCFile(fname, rw, name)\n{\n\tinit();\n\tinit_with_defaults();\n}\n\nCCSVFile::~CCSVFile()\n{\n\tSG_UNREF(m_tokenizer);\n\tSG_UNREF(m_line_tokenizer);\n\tSG_UNREF(m_parser);\n\tSG_UNREF(m_line_reader);\n}\n\nvoid CCSVFile::set_order(csv_data_order order)\n{\n\tm_order=order;\n}\n\nvoid CCSVFile::set_delimiter(char delimiter)\n{\n\tm_tokenizer->delimiters[m_delimiter]=0;\n\t\n\tm_delimiter=delimiter;\n\tm_tokenizer->delimiters[m_delimiter]=1;\n}\n\nvoid CCSVFile::skip_lines(int32_t num_lines)\n{\n\tfor (int32_t i=0; iskip_line();\n}\n\nvoid CCSVFile::init()\n{\n\tm_order=C_ORDER;\n\tm_delimiter=0;\n\n\tm_tokenizer=NULL;\n\tm_line_tokenizer=NULL;\n\tm_parser=NULL;\n\tm_line_reader=NULL;\n}\n\nvoid CCSVFile::init_with_defaults()\n{\n\tm_order=C_ORDER;\n\tm_delimiter=',';\n\n\tm_tokenizer=new CDelimiterTokenizer(true);\n\tm_tokenizer->delimiters[m_delimiter]=1;\n\tm_tokenizer->delimiters[' ']=1;\n\tSG_REF(m_tokenizer);\n\n\tm_line_tokenizer=new CDelimiterTokenizer(true);\n\tm_line_tokenizer->delimiters['\\n']=1;\n\tSG_REF(m_line_tokenizer);\n\n\tm_parser=new CParser();\n\tm_parser->set_tokenizer(m_tokenizer);\n\n\tm_line_reader=new CLineReader(file, m_line_tokenizer);\n}\n\n#define GET_VECTOR(fname, read_func, sg_type) \\\nvoid CCSVFile::fname(sg_type*& vector, int32_t& len) \\\n{ \\\n\tif (!m_line_reader->has_next()) \\\n\t\treturn; \\\n\t\\\n\tSGVector line=m_line_reader->read_line(); \\\n\tm_tokenizer->set_text(line); \\\n\t\\\n\tlen=0; \\\n\twhile (m_tokenizer->has_next()) \\\n\t{ \\\n\t\tindex_t temp_start=0; \\\n\t\tm_tokenizer->next_token_idx(temp_start); \\\n\t\\\n\t\tlen++; \\\n\t} \\\n\t\\\n\tm_parser->set_text(line); \\\n\tvector=SG_MALLOC(sg_type, len); \\\n\tfor (int32_t i=0; iread_func(); \\\n\t} \\\n}\n\nGET_VECTOR(get_vector, read_char, int8_t)\nGET_VECTOR(get_vector, read_byte, uint8_t)\nGET_VECTOR(get_vector, read_char, char)\nGET_VECTOR(get_vector, read_int, int32_t)\nGET_VECTOR(get_vector, read_uint, uint32_t)\nGET_VECTOR(get_vector, read_short_real, float32_t)\nGET_VECTOR(get_vector, read_real, float64_t)\nGET_VECTOR(get_vector, read_long_real, floatmax_t)\nGET_VECTOR(get_vector, read_short, int16_t)\nGET_VECTOR(get_vector, read_word, uint16_t)\nGET_VECTOR(get_vector, read_long, int64_t)\nGET_VECTOR(get_vector, read_ulong, uint64_t)\n#undef GET_VECTOR\n\n#define GET_MATRIX(fname, read_func, sg_type) \\\nvoid CCSVFile::fname(sg_type*& matrix, int32_t& num_feat, int32_t& num_vec) \\\n{ \\\n\t\\\n\tint32_t nlines=0; \\\n\tint32_t ntokens=-1; \\\n\t\\\n\tint32_t last_idx=0; \\\n\tSGVector line_memory(true); \\\n\tSGVector temp(true); \\\n\twhile(m_line_reader->has_next()) \\\n\t{ \\\n\t\tread_func(temp.vector, temp.vlen); \\\n\t\tif (ntokens<0) \\\n\t\t\tntokens=temp.vlen; \\\n\t\t\\\n\t\tif (ntokens!=temp.vlen) \\\n\t\t\treturn; \\\n\t\t\\\n\t\tline_memory.resize_vector(last_idx+temp.vlen); \\\n\t\tfor (int32_t i=0; i::convert_to_matrix(matrix, num_vec, num_feat, line_memory.vector, line_memory.vlen, true); \\\n\t} \\\n\telse \\\n\t{ \\\n\t\tnum_feat=ntokens; \\\n\t\tnum_vec=nlines; \\\n\t\tSGVector::convert_to_matrix(matrix, num_vec, num_feat, line_memory.vector, line_memory.vlen, false); \\\n\t} \\\n} \\\n\nGET_MATRIX(get_matrix, get_vector, int8_t)\nGET_MATRIX(get_matrix, get_vector, uint8_t)\nGET_MATRIX(get_matrix, get_vector, char)\nGET_MATRIX(get_matrix, get_vector, int32_t)\nGET_MATRIX(get_matrix, get_vector, uint32_t)\nGET_MATRIX(get_matrix, get_vector, int64_t)\nGET_MATRIX(get_matrix, get_vector, uint64_t)\nGET_MATRIX(get_matrix, get_vector, float32_t)\nGET_MATRIX(get_matrix, get_vector, float64_t)\nGET_MATRIX(get_matrix, get_vector, floatmax_t)\nGET_MATRIX(get_matrix, get_vector, int16_t)\nGET_MATRIX(get_matrix, get_vector, uint16_t)\n#undef GET_MATRIX\n\n#define SET_VECTOR(fname, format, sg_type) \\\nvoid CCSVFile::fname(const sg_type* vector, int32_t len) \\\n{ \\\n\tfor (int32_t i=0; i"} {"text":"CID#705102 try and help coverity out re infinite loop<|endoftext|>"} {"text":"OUString: avoid concatenated appends and temporaries<|endoftext|>"} {"text":"\/*************************************************************************\n *\n * $RCSfile: tbxanchr.cxx,v $\n *\n * $Revision: 1.4 $\n *\n * last change: $Author: rt $ $Date: 2003-12-01 09:46:51 $\n *\n * The Contents of this file are made available subject to the terms of\n * either of the following licenses\n *\n * - GNU Lesser General Public License Version 2.1\n * - Sun Industry Standards Source License Version 1.1\n *\n * Sun Microsystems Inc., October, 2000\n *\n * GNU Lesser General Public License Version 2.1\n * =============================================\n * Copyright 2000 by Sun Microsystems, Inc.\n * 901 San Antonio Road, Palo Alto, CA 94303, USA\n *\n * This library is free software; you can redistribute it and\/or\n * modify it under the terms of the GNU Lesser General Public\n * License version 2.1, as published by the Free Software Foundation.\n *\n * This library is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU\n * Lesser General Public License for more details.\n *\n * You should have received a copy of the GNU Lesser General Public\n * License along with this library; if not, write to the Free Software\n * Foundation, Inc., 59 Temple Place, Suite 330, Boston,\n * MA 02111-1307 USA\n *\n *\n * Sun Industry Standards Source License Version 1.1\n * =================================================\n * The contents of this file are subject to the Sun Industry Standards\n * Source License Version 1.1 (the \"License\"); You may not use this file\n * except in compliance with the License. You may obtain a copy of the\n * License at http:\/\/www.openoffice.org\/license.html.\n *\n * Software provided under this License is provided on an \"AS IS\" basis,\n * WITHOUT WARRANTY OF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING,\n * WITHOUT LIMITATION, WARRANTIES THAT THE SOFTWARE IS FREE OF DEFECTS,\n * MERCHANTABLE, FIT FOR A PARTICULAR PURPOSE, OR NON-INFRINGING.\n * See the License for the specific provisions governing your rights and\n * obligations concerning the Software.\n *\n * The Initial Developer of the Original Code is: Sun Microsystems, Inc.\n *\n * Copyright: 2000 by Sun Microsystems, Inc.\n *\n * All Rights Reserved.\n *\n * Contributor(s): _______________________________________\n *\n *\n ************************************************************************\/\n\n\n#pragma hdrstop\n\n#include \/\/ HACK: prevent conflict between STLPORT and Workshop headers\n\n#ifndef _SV_TIMER_HXX \/\/autogen\n#include \n#endif\n\n#ifndef _SFXAPP_HXX \/\/autogen\n#include \n#endif\n#ifndef _SVX_HTMLMODE_HXX \/\/autogen\n#include \n#endif\n#ifndef _SFXINTITEM_HXX \/\/autogen\n#include \n#endif\n#ifndef _SFXDISPATCH_HXX \/\/autogen\n#include \n#endif\n#ifndef _TOOLBOX_HXX \/\/autogen\n#include \n#endif\n#ifndef _SFXMNUMGR_HXX \/\/autogen\n#include \n#endif\n\n\n#include \"cmdid.h\"\n#include \"docsh.hxx\"\n#include \"swtypes.hxx\"\n#include \"swmodule.hxx\"\n#include \"wrtsh.hxx\"\n#include \"view.hxx\"\n#include \"viewopt.hxx\"\n#include \"errhdl.hxx\"\n#include \"ribbar.hrc\"\n#include \"tbxanchr.hxx\"\n\n\n\nSFX_IMPL_TOOLBOX_CONTROL(SwTbxAnchor, SfxUInt16Item);\n\n\/******************************************************************************\n * Beschreibung:\n ******************************************************************************\/\n\nSwTbxAnchor::SwTbxAnchor(USHORT nId, ToolBox& rTbx, SfxBindings& rBind) :\n SfxToolBoxControl(nId, rTbx, rBind),\n nActAnchorId(0)\n{\n}\n\n\/******************************************************************************\n * Beschreibung:\n ******************************************************************************\/\n\n SwTbxAnchor::~SwTbxAnchor()\n{\n}\n\n\/******************************************************************************\n * Beschreibung:\n ******************************************************************************\/\n\nvoid SwTbxAnchor::StateChanged( USHORT nSID, SfxItemState eState, const SfxPoolItem* pState )\n{\n GetToolBox().EnableItem( GetId(), (GetItemState(pState) != SFX_ITEM_DISABLED) );\n\n if( eState == SFX_ITEM_AVAILABLE )\n {\n const SfxUInt16Item* pItem = PTR_CAST( SfxUInt16Item, pState );\n if(pItem)\n nActAnchorId = pItem->GetValue();\n }\n\n}\n\n\/******************************************************************************\n * Beschreibung:\n ******************************************************************************\/\n\nvoid SwTbxAnchor::Click()\n{\n PopupMenu aPopMenu(SW_RES(MN_ANCHOR_POPUP));\n\n SfxDispatcher* pDispatch = GetBindings().GetDispatcher();\n SfxViewFrame* pViewFrame = pDispatch ? pDispatch->GetFrame() : 0;\n SwView* pActiveView = 0;\n if(pViewFrame)\n {\n const TypeId aTypeId = TYPE(SwView);\n SwView* pView = (SwView*)SfxViewShell::GetFirst(&aTypeId);\n while( pView )\n {\n if(pView->GetViewFrame() == pViewFrame)\n {\n pActiveView = pView;\n break;\n }\n pView = (SwView*)SfxViewShell::GetNext(*pView, &aTypeId);\n }\n }\n if(!pActiveView)\n {\n DBG_ERROR(\"No active view could be found\")\n return;\n }\n SwWrtShell* pWrtShell = pActiveView->GetWrtShellPtr();\n aPopMenu.EnableItem( FN_TOOL_ANKER_FRAME, 0 != pWrtShell->IsFlyInFly() );\n\n Rectangle aRect(GetToolBox().GetItemRect(FN_TOOL_ANKER));\n USHORT nHtmlMode = ::GetHtmlMode((SwDocShell*)SfxObjectShell::Current());\n BOOL bHtmlModeNoAnchor = ( nHtmlMode & HTMLMODE_ON) && 0 == (nHtmlMode & HTMLMODE_SOME_ABS_POS);\n\n if (bHtmlModeNoAnchor || pWrtShell->IsInHeaderFooter())\n aPopMenu.RemoveItem(aPopMenu.GetItemPos(FN_TOOL_ANKER_PAGE));\n\n if (!pWrtShell->IsFrmSelected())\n aPopMenu.RemoveItem(aPopMenu.GetItemPos(FN_TOOL_ANKER_AT_CHAR));\n\n if (nActAnchorId)\n aPopMenu.CheckItem(nActAnchorId);\n\n\n USHORT nSlotId = aPopMenu.Execute(&GetToolBox(), aRect.BottomLeft());\n GetToolBox().EndSelection();\n\n if (nSlotId)\n pDispatch->Execute(nSlotId, SFX_CALLMODE_ASYNCHRON|SFX_CALLMODE_RECORD);\n}\n\n\n\nINTEGRATION: CWS swdrawpositioning (1.4.150); FILE MERGED 2004\/04\/14 11:34:26 os 1.4.150.1: #i26173# anchor context menu\/drop down completed for drawings\/*************************************************************************\n *\n * $RCSfile: tbxanchr.cxx,v $\n *\n * $Revision: 1.5 $\n *\n * last change: $Author: hjs $ $Date: 2004-06-28 13:50:52 $\n *\n * The Contents of this file are made available subject to the terms of\n * either of the following licenses\n *\n * - GNU Lesser General Public License Version 2.1\n * - Sun Industry Standards Source License Version 1.1\n *\n * Sun Microsystems Inc., October, 2000\n *\n * GNU Lesser General Public License Version 2.1\n * =============================================\n * Copyright 2000 by Sun Microsystems, Inc.\n * 901 San Antonio Road, Palo Alto, CA 94303, USA\n *\n * This library is free software; you can redistribute it and\/or\n * modify it under the terms of the GNU Lesser General Public\n * License version 2.1, as published by the Free Software Foundation.\n *\n * This library is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU\n * Lesser General Public License for more details.\n *\n * You should have received a copy of the GNU Lesser General Public\n * License along with this library; if not, write to the Free Software\n * Foundation, Inc., 59 Temple Place, Suite 330, Boston,\n * MA 02111-1307 USA\n *\n *\n * Sun Industry Standards Source License Version 1.1\n * =================================================\n * The contents of this file are subject to the Sun Industry Standards\n * Source License Version 1.1 (the \"License\"); You may not use this file\n * except in compliance with the License. You may obtain a copy of the\n * License at http:\/\/www.openoffice.org\/license.html.\n *\n * Software provided under this License is provided on an \"AS IS\" basis,\n * WITHOUT WARRANTY OF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING,\n * WITHOUT LIMITATION, WARRANTIES THAT THE SOFTWARE IS FREE OF DEFECTS,\n * MERCHANTABLE, FIT FOR A PARTICULAR PURPOSE, OR NON-INFRINGING.\n * See the License for the specific provisions governing your rights and\n * obligations concerning the Software.\n *\n * The Initial Developer of the Original Code is: Sun Microsystems, Inc.\n *\n * Copyright: 2000 by Sun Microsystems, Inc.\n *\n * All Rights Reserved.\n *\n * Contributor(s): _______________________________________\n *\n *\n ************************************************************************\/\n\n\n#pragma hdrstop\n\n#include \/\/ HACK: prevent conflict between STLPORT and Workshop headers\n\n#ifndef _SV_TIMER_HXX \/\/autogen\n#include \n#endif\n\n#ifndef _SFXAPP_HXX \/\/autogen\n#include \n#endif\n#ifndef _SVX_HTMLMODE_HXX \/\/autogen\n#include \n#endif\n#ifndef _SFXINTITEM_HXX \/\/autogen\n#include \n#endif\n#ifndef _SFXDISPATCH_HXX \/\/autogen\n#include \n#endif\n#ifndef _TOOLBOX_HXX \/\/autogen\n#include \n#endif\n#ifndef _SFXMNUMGR_HXX \/\/autogen\n#include \n#endif\n\n\n#include \"cmdid.h\"\n#include \"docsh.hxx\"\n#include \"swtypes.hxx\"\n#include \"swmodule.hxx\"\n#include \"wrtsh.hxx\"\n#include \"view.hxx\"\n#include \"viewopt.hxx\"\n#include \"errhdl.hxx\"\n#include \"ribbar.hrc\"\n#include \"tbxanchr.hxx\"\n\n\n\nSFX_IMPL_TOOLBOX_CONTROL(SwTbxAnchor, SfxUInt16Item);\n\n\/******************************************************************************\n * Beschreibung:\n ******************************************************************************\/\n\nSwTbxAnchor::SwTbxAnchor(USHORT nId, ToolBox& rTbx, SfxBindings& rBind) :\n SfxToolBoxControl(nId, rTbx, rBind),\n nActAnchorId(0)\n{\n}\n\n\/******************************************************************************\n * Beschreibung:\n ******************************************************************************\/\n\n SwTbxAnchor::~SwTbxAnchor()\n{\n}\n\n\/******************************************************************************\n * Beschreibung:\n ******************************************************************************\/\n\nvoid SwTbxAnchor::StateChanged( USHORT nSID, SfxItemState eState, const SfxPoolItem* pState )\n{\n GetToolBox().EnableItem( GetId(), (GetItemState(pState) != SFX_ITEM_DISABLED) );\n\n if( eState == SFX_ITEM_AVAILABLE )\n {\n const SfxUInt16Item* pItem = PTR_CAST( SfxUInt16Item, pState );\n if(pItem)\n nActAnchorId = pItem->GetValue();\n }\n\n}\n\n\/******************************************************************************\n * Beschreibung:\n ******************************************************************************\/\n\nvoid SwTbxAnchor::Click()\n{\n PopupMenu aPopMenu(SW_RES(MN_ANCHOR_POPUP));\n\n SfxDispatcher* pDispatch = GetBindings().GetDispatcher();\n SfxViewFrame* pViewFrame = pDispatch ? pDispatch->GetFrame() : 0;\n SwView* pActiveView = 0;\n if(pViewFrame)\n {\n const TypeId aTypeId = TYPE(SwView);\n SwView* pView = (SwView*)SfxViewShell::GetFirst(&aTypeId);\n while( pView )\n {\n if(pView->GetViewFrame() == pViewFrame)\n {\n pActiveView = pView;\n break;\n }\n pView = (SwView*)SfxViewShell::GetNext(*pView, &aTypeId);\n }\n }\n if(!pActiveView)\n {\n DBG_ERROR(\"No active view could be found\")\n return;\n }\n SwWrtShell* pWrtShell = pActiveView->GetWrtShellPtr();\n aPopMenu.EnableItem( FN_TOOL_ANKER_FRAME, 0 != pWrtShell->IsFlyInFly() );\n\n Rectangle aRect(GetToolBox().GetItemRect(FN_TOOL_ANKER));\n USHORT nHtmlMode = ::GetHtmlMode((SwDocShell*)SfxObjectShell::Current());\n BOOL bHtmlModeNoAnchor = ( nHtmlMode & HTMLMODE_ON) && 0 == (nHtmlMode & HTMLMODE_SOME_ABS_POS);\n\n if (bHtmlModeNoAnchor || pWrtShell->IsInHeaderFooter())\n aPopMenu.RemoveItem(aPopMenu.GetItemPos(FN_TOOL_ANKER_PAGE));\n\n if (nActAnchorId)\n aPopMenu.CheckItem(nActAnchorId);\n\n\n USHORT nSlotId = aPopMenu.Execute(&GetToolBox(), aRect.BottomLeft());\n GetToolBox().EndSelection();\n\n if (nSlotId)\n pDispatch->Execute(nSlotId, SFX_CALLMODE_ASYNCHRON|SFX_CALLMODE_RECORD);\n}\n\n\n\n<|endoftext|>"} {"text":"Correct way to do it.<|endoftext|>"} {"text":"\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\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 \"GafferUI\/DotNodeGadget.h\"\n\n#include \"GafferUI\/ConnectionGadget.h\"\n#include \"GafferUI\/GraphGadget.h\"\n#include \"GafferUI\/Nodule.h\"\n#include \"GafferUI\/SpacerGadget.h\"\n#include \"GafferUI\/Style.h\"\n\n#include \"Gaffer\/Dot.h\"\n#include \"Gaffer\/MetadataAlgo.h\"\n#include \"Gaffer\/ScriptNode.h\"\n#include \"Gaffer\/StringPlug.h\"\n#include \"Gaffer\/UndoScope.h\"\n\n#include \"IECoreGL\/GL.h\"\n#include \"IECoreGL\/Selector.h\"\n\n#include \"boost\/bind.hpp\"\n\nusing namespace Imath;\nusing namespace IECore;\nusing namespace Gaffer;\nusing namespace GafferUI;\n\nIE_CORE_DEFINERUNTIMETYPED( DotNodeGadget );\n\nDotNodeGadget::NodeGadgetTypeDescription DotNodeGadget::g_nodeGadgetTypeDescription( Gaffer::Dot::staticTypeId() );\n\nDotNodeGadget::DotNodeGadget( Gaffer::NodePtr node )\n\t:\tStandardNodeGadget( node )\n{\n\tif( !runTimeCast( node ) )\n\t{\n\t\tthrow Exception( \"DotNodeGadget requires a Dot\" );\n\t}\n\n\t\/\/ Set the contents to have a small size, so the size of the Dot is controlled\n\t\/\/ largely by the nodeGadget:padding Metadata.\n\tsetContents( new SpacerGadget( Box3f( V3f( -0.25 ), V3f( 0.25 ) ) ) );\n\n\tnode->plugDirtiedSignal().connect( boost::bind( &DotNodeGadget::plugDirtied, this, ::_1 ) );\n\tnode->nameChangedSignal().connect( boost::bind( &DotNodeGadget::nameChanged, this, ::_1 ) );\n\n\tdragEnterSignal().connect( boost::bind( &DotNodeGadget::dragEnter, this, ::_2 ) );\n\tdropSignal().connect( boost::bind( &DotNodeGadget::drop, this, ::_2 ) );\n\n\tupdateUpstreamNameChangedConnection();\n\tupdateLabel();\n}\n\nDotNodeGadget::~DotNodeGadget()\n{\n}\n\nvoid DotNodeGadget::doRenderLayer( Layer layer, const Style *style ) const\n{\n\tif( layer != GraphLayer::Nodes )\n\t{\n\t\treturn NodeGadget::doRenderLayer( layer, style );\n\t}\n\n\tStyle::State state = getHighlighted() ? Style::HighlightedState : Style::NormalState;\n\n\tconst Box3f b = bound();\n\tconst V3f s = b.size();\n\tstyle->renderNodeFrame( Box2f( V2f( 0 ), V2f( 0 ) ), std::min( s.x, s.y ) \/ 2.0f, state, userColor() );\n\n\tif( !m_label.empty() && !IECoreGL::Selector::currentSelector() )\n\t{\n\t\tglPushMatrix();\n\t\tIECoreGL::glTranslate( m_labelPosition );\n\t\tstyle->renderText( Style::LabelText, m_label );\n\t\tglPopMatrix();\n\t}\n\n\tNodeGadget::doRenderLayer( layer, style );\n}\n\nGaffer::Dot *DotNodeGadget::dotNode()\n{\n\treturn static_cast( node() );\n}\n\nconst Gaffer::Dot *DotNodeGadget::dotNode() const\n{\n\treturn static_cast( node() );\n}\n\nGaffer::Node *DotNodeGadget::upstreamNode()\n{\n\tPlug *plug = dotNode()->inPlug();\n\twhile( plug && runTimeCast( plug->node() ) )\n\t{\n\t\tplug = plug->getInput();\n\t}\n\treturn plug ? plug->node() : nullptr;\n}\n\nvoid DotNodeGadget::plugDirtied( const Gaffer::Plug *plug )\n{\n\tconst Dot *dot = dotNode();\n\tif( plug == dot->labelTypePlug() || plug == dot->labelPlug() )\n\t{\n\t\tupdateLabel();\n\t}\n\telse if( plug == dot->inPlug() )\n\t{\n\t\tupdateUpstreamNameChangedConnection();\n\t\tupdateLabel();\n\t}\n}\n\nvoid DotNodeGadget::nameChanged( const Gaffer::GraphComponent *graphComponent )\n{\n\tupdateLabel();\n}\n\nvoid DotNodeGadget::updateUpstreamNameChangedConnection()\n{\n\tm_upstreamNameChangedConnection.disconnect();\n\tif( Node *n = upstreamNode() )\n\t{\n\t\tm_upstreamNameChangedConnection = n->nameChangedSignal().connect( boost::bind( &DotNodeGadget::nameChanged, this, ::_1 ) );\n\t}\n}\n\nvoid DotNodeGadget::updateLabel()\n{\n\tconst Dot *dot = dotNode();\n\n\tconst Dot::LabelType labelType = (Dot::LabelType)dot->labelTypePlug()->getValue();\n\tif( labelType == Dot::None )\n\t{\n\t\tm_label.clear();\n\t}\n\telse if( labelType == Dot::NodeName )\n\t{\n\t\tm_label = dot->getName();\n\t}\n\telse if( labelType == Dot::UpstreamNodeName )\n\t{\n\t\tconst Node *n = upstreamNode();\n\t\tm_label = n ? n->getName() : \"\";\n\t}\n\telse\n\t{\n\t\tm_label = dot->labelPlug()->getValue();\n\t}\n\n\tEdge labelEdge = RightEdge;\n\tif( const Plug *p = dot->inPlug() )\n\t{\n\t\tif( noduleTangent( nodule( p ) ).x != 0 )\n\t\t{\n\t\t\tlabelEdge = TopEdge;\n\t\t}\n\t}\n\n\tconst Imath::Box3f thisBound = bound();\n\tif( labelEdge == TopEdge )\n\t{\n\t\tconst Imath::Box3f labelBound = style()->textBound( Style::LabelText, m_label );\n\t\tm_labelPosition = V2f(\n\t\t\t-labelBound.size().x \/ 2.0,\n\t\t\tthisBound.max.y + 1.0\n\t\t);\n\t}\n\telse\n\t{\n\t\tconst Imath::Box3f characterBound = style()->characterBound( Style::LabelText );\n\t\tm_labelPosition = V2f(\n\t\t\tthisBound.max.x,\n\t\t\tthisBound.center().y - characterBound.size().y \/ 2.0\n\t\t);\n\t}\n\n\trequestRender();\n}\n\nbool DotNodeGadget::dragEnter( const DragDropEvent &event )\n{\n\tif( MetadataAlgo::readOnly( dotNode() ) )\n\t{\n\t\treturn false;\n\t}\n\n\tif( dotNode()->inPlug() )\n\t{\n\t\t\/\/ We've already got our plugs set up - StandardNodeGadget\n\t\t\/\/ behaviour will take care of everything.\n\t\treturn false;\n\t}\n\n\tconst Plug *plug = runTimeCast( event.data.get() );\n\tif( !plug )\n\t{\n\t\treturn false;\n\t}\n\n\tconst GraphGadget *graphGadget = ancestor();\n\tif( !graphGadget )\n\t{\n\t\treturn false;\n\t}\n\n\tconst NodeGadget *nodeGadget = graphGadget->nodeGadget( plug->node() );\n\tif( !nodeGadget )\n\t{\n\t\treturn false;\n\t}\n\n\tconst Nodule *nodule = nodeGadget->nodule( plug );\n\tif( !nodule )\n\t{\n\t\treturn false;\n\t}\n\n\tV3f tangent = -nodeGadget->noduleTangent( nodule );\n\tV3f position = ( tangent * bound().size().x \/ 2.0f ) * fullTransform();\n\tposition = position * event.sourceGadget->fullTransform().inverse();\n\n\tif( Nodule *sourceNodule = runTimeCast( event.sourceGadget.get() ) )\n\t{\n\t\tsourceNodule->updateDragEndPoint( position, tangent );\n\t}\n\telse if( ConnectionGadget *sourceConnection = runTimeCast( event.sourceGadget.get() ) )\n\t{\n\t\tsourceConnection->updateDragEndPoint( position, tangent );\n\t}\n\n\treturn true;\n}\n\nbool DotNodeGadget::drop( const DragDropEvent &event )\n{\n\tif( dotNode()->inPlug() )\n\t{\n\t\t\/\/ We've already got our plugs set up - StandardNodeGadget\n\t\t\/\/ behaviour will take care of everything.\n\t\treturn false;\n\t}\n\n\tPlug *plug = runTimeCast( event.data.get() );\n\tif( !plug )\n\t{\n\t\treturn false;\n\t}\n\n\tGaffer::UndoScope undoEnabler( node()->ancestor() );\n\n\tdotNode()->setup( plug );\n\tif( plug->direction() == Plug::In )\n\t{\n\t\tplug->setInput( dotNode()->outPlug() );\n\t}\n\telse\n\t{\n\t\tdotNode()->inPlug()->setInput( plug );\n\t}\n\n\treturn true;\n}\nDotNodeGadget : Simplify drag snapping\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\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 \"GafferUI\/DotNodeGadget.h\"\n\n#include \"GafferUI\/ConnectionGadget.h\"\n#include \"GafferUI\/GraphGadget.h\"\n#include \"GafferUI\/Nodule.h\"\n#include \"GafferUI\/SpacerGadget.h\"\n#include \"GafferUI\/Style.h\"\n\n#include \"Gaffer\/Dot.h\"\n#include \"Gaffer\/MetadataAlgo.h\"\n#include \"Gaffer\/ScriptNode.h\"\n#include \"Gaffer\/StringPlug.h\"\n#include \"Gaffer\/UndoScope.h\"\n\n#include \"IECoreGL\/GL.h\"\n#include \"IECoreGL\/Selector.h\"\n\n#include \"boost\/bind.hpp\"\n\nusing namespace Imath;\nusing namespace IECore;\nusing namespace Gaffer;\nusing namespace GafferUI;\n\nIE_CORE_DEFINERUNTIMETYPED( DotNodeGadget );\n\nDotNodeGadget::NodeGadgetTypeDescription DotNodeGadget::g_nodeGadgetTypeDescription( Gaffer::Dot::staticTypeId() );\n\nDotNodeGadget::DotNodeGadget( Gaffer::NodePtr node )\n\t:\tStandardNodeGadget( node )\n{\n\tif( !runTimeCast( node ) )\n\t{\n\t\tthrow Exception( \"DotNodeGadget requires a Dot\" );\n\t}\n\n\t\/\/ Set the contents to have a small size, so the size of the Dot is controlled\n\t\/\/ largely by the nodeGadget:padding Metadata.\n\tsetContents( new SpacerGadget( Box3f( V3f( -0.25 ), V3f( 0.25 ) ) ) );\n\n\tnode->plugDirtiedSignal().connect( boost::bind( &DotNodeGadget::plugDirtied, this, ::_1 ) );\n\tnode->nameChangedSignal().connect( boost::bind( &DotNodeGadget::nameChanged, this, ::_1 ) );\n\n\tdragEnterSignal().connect( boost::bind( &DotNodeGadget::dragEnter, this, ::_2 ) );\n\tdropSignal().connect( boost::bind( &DotNodeGadget::drop, this, ::_2 ) );\n\n\tupdateUpstreamNameChangedConnection();\n\tupdateLabel();\n}\n\nDotNodeGadget::~DotNodeGadget()\n{\n}\n\nvoid DotNodeGadget::doRenderLayer( Layer layer, const Style *style ) const\n{\n\tif( layer != GraphLayer::Nodes )\n\t{\n\t\treturn NodeGadget::doRenderLayer( layer, style );\n\t}\n\n\tStyle::State state = getHighlighted() ? Style::HighlightedState : Style::NormalState;\n\n\tconst Box3f b = bound();\n\tconst V3f s = b.size();\n\tstyle->renderNodeFrame( Box2f( V2f( 0 ), V2f( 0 ) ), std::min( s.x, s.y ) \/ 2.0f, state, userColor() );\n\n\tif( !m_label.empty() && !IECoreGL::Selector::currentSelector() )\n\t{\n\t\tglPushMatrix();\n\t\tIECoreGL::glTranslate( m_labelPosition );\n\t\tstyle->renderText( Style::LabelText, m_label );\n\t\tglPopMatrix();\n\t}\n\n\tNodeGadget::doRenderLayer( layer, style );\n}\n\nGaffer::Dot *DotNodeGadget::dotNode()\n{\n\treturn static_cast( node() );\n}\n\nconst Gaffer::Dot *DotNodeGadget::dotNode() const\n{\n\treturn static_cast( node() );\n}\n\nGaffer::Node *DotNodeGadget::upstreamNode()\n{\n\tPlug *plug = dotNode()->inPlug();\n\twhile( plug && runTimeCast( plug->node() ) )\n\t{\n\t\tplug = plug->getInput();\n\t}\n\treturn plug ? plug->node() : nullptr;\n}\n\nvoid DotNodeGadget::plugDirtied( const Gaffer::Plug *plug )\n{\n\tconst Dot *dot = dotNode();\n\tif( plug == dot->labelTypePlug() || plug == dot->labelPlug() )\n\t{\n\t\tupdateLabel();\n\t}\n\telse if( plug == dot->inPlug() )\n\t{\n\t\tupdateUpstreamNameChangedConnection();\n\t\tupdateLabel();\n\t}\n}\n\nvoid DotNodeGadget::nameChanged( const Gaffer::GraphComponent *graphComponent )\n{\n\tupdateLabel();\n}\n\nvoid DotNodeGadget::updateUpstreamNameChangedConnection()\n{\n\tm_upstreamNameChangedConnection.disconnect();\n\tif( Node *n = upstreamNode() )\n\t{\n\t\tm_upstreamNameChangedConnection = n->nameChangedSignal().connect( boost::bind( &DotNodeGadget::nameChanged, this, ::_1 ) );\n\t}\n}\n\nvoid DotNodeGadget::updateLabel()\n{\n\tconst Dot *dot = dotNode();\n\n\tconst Dot::LabelType labelType = (Dot::LabelType)dot->labelTypePlug()->getValue();\n\tif( labelType == Dot::None )\n\t{\n\t\tm_label.clear();\n\t}\n\telse if( labelType == Dot::NodeName )\n\t{\n\t\tm_label = dot->getName();\n\t}\n\telse if( labelType == Dot::UpstreamNodeName )\n\t{\n\t\tconst Node *n = upstreamNode();\n\t\tm_label = n ? n->getName() : \"\";\n\t}\n\telse\n\t{\n\t\tm_label = dot->labelPlug()->getValue();\n\t}\n\n\tEdge labelEdge = RightEdge;\n\tif( const Plug *p = dot->inPlug() )\n\t{\n\t\tif( noduleTangent( nodule( p ) ).x != 0 )\n\t\t{\n\t\t\tlabelEdge = TopEdge;\n\t\t}\n\t}\n\n\tconst Imath::Box3f thisBound = bound();\n\tif( labelEdge == TopEdge )\n\t{\n\t\tconst Imath::Box3f labelBound = style()->textBound( Style::LabelText, m_label );\n\t\tm_labelPosition = V2f(\n\t\t\t-labelBound.size().x \/ 2.0,\n\t\t\tthisBound.max.y + 1.0\n\t\t);\n\t}\n\telse\n\t{\n\t\tconst Imath::Box3f characterBound = style()->characterBound( Style::LabelText );\n\t\tm_labelPosition = V2f(\n\t\t\tthisBound.max.x,\n\t\t\tthisBound.center().y - characterBound.size().y \/ 2.0\n\t\t);\n\t}\n\n\trequestRender();\n}\n\nbool DotNodeGadget::dragEnter( const DragDropEvent &event )\n{\n\tif( MetadataAlgo::readOnly( dotNode() ) )\n\t{\n\t\treturn false;\n\t}\n\n\tif( dotNode()->inPlug() )\n\t{\n\t\t\/\/ We've already got our plugs set up - StandardNodeGadget\n\t\t\/\/ behaviour will take care of everything.\n\t\treturn false;\n\t}\n\n\tconst Plug *plug = runTimeCast( event.data.get() );\n\tif( !plug )\n\t{\n\t\treturn false;\n\t}\n\n\tconst GraphGadget *graphGadget = ancestor();\n\tif( !graphGadget )\n\t{\n\t\treturn false;\n\t}\n\n\tconst NodeGadget *nodeGadget = graphGadget->nodeGadget( plug->node() );\n\tif( !nodeGadget )\n\t{\n\t\treturn false;\n\t}\n\n\tconst Nodule *nodule = nodeGadget->nodule( plug );\n\tif( !nodule )\n\t{\n\t\treturn false;\n\t}\n\n\tif( auto connectionCreator = runTimeCast( event.sourceGadget.get() ) )\n\t{\n\t\tV3f tangent = -nodeGadget->noduleTangent( nodule );\n\t\tV3f position = ( tangent * bound().size().x \/ 2.0f ) * fullTransform();\n\t\tposition = position * connectionCreator->fullTransform().inverse();\n\t\tconnectionCreator->updateDragEndPoint( position, tangent );\n\t}\n\n\treturn true;\n}\n\nbool DotNodeGadget::drop( const DragDropEvent &event )\n{\n\tif( dotNode()->inPlug() )\n\t{\n\t\t\/\/ We've already got our plugs set up - StandardNodeGadget\n\t\t\/\/ behaviour will take care of everything.\n\t\treturn false;\n\t}\n\n\tPlug *plug = runTimeCast( event.data.get() );\n\tif( !plug )\n\t{\n\t\treturn false;\n\t}\n\n\tGaffer::UndoScope undoEnabler( node()->ancestor() );\n\n\tdotNode()->setup( plug );\n\tif( plug->direction() == Plug::In )\n\t{\n\t\tplug->setInput( dotNode()->outPlug() );\n\t}\n\telse\n\t{\n\t\tdotNode()->inPlug()->setInput( plug );\n\t}\n\n\treturn true;\n}\n<|endoftext|>"} {"text":"\/************************************************************************\/\n\/* *\/\n\/* Copyright 2008-2011 by Ullrich Koethe *\/\n\/* Cognitive Systems Group, University of Hamburg, Germany *\/\n\/* *\/\n\/* This file is part of the VIGRA computer vision library. *\/\n\/* The VIGRA Website is *\/\n\/* http:\/\/kogs-www.informatik.uni-hamburg.de\/~koethe\/vigra\/ *\/\n\/* Please direct questions, bug reports, and contributions to *\/\n\/* ullrich.koethe@iwr.uni-heidelberg.de or *\/\n\/* vigra@informatik.uni-hamburg.de *\/\n\/* *\/\n\/* Permission is hereby granted, free of charge, to any person *\/\n\/* obtaining a copy of this software and associated documentation *\/\n\/* files (the \"Software\"), to deal in the Software without *\/\n\/* restriction, including without limitation the rights to use, *\/\n\/* copy, modify, merge, publish, distribute, sublicense, and\/or *\/\n\/* sell copies of the Software, and to permit persons to whom the *\/\n\/* Software is furnished to do so, subject to the following *\/\n\/* conditions: *\/\n\/* *\/\n\/* The above copyright notice and this permission notice shall be *\/\n\/* included in all copies or substantial portions of the *\/\n\/* Software. *\/\n\/* *\/\n\/* THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND *\/\n\/* EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES *\/\n\/* OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND *\/\n\/* NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT *\/\n\/* HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, *\/\n\/* WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING *\/\n\/* FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR *\/\n\/* OTHER DEALINGS IN THE SOFTWARE. *\/\n\/* *\/\n\/************************************************************************\/\n\n\n#ifndef VIGRA_TIMING_HXX\n#define VIGRA_TIMING_HXX\n#ifndef VIGRA_NO_TIMING\n\n#include \n#include \n#include \n\n\/\/ Usage:\n\/\/\n\/\/ void time_it()\n\/\/ {\n\/\/ USETICTOC\n\/\/\n\/\/ TIC\n\/\/ ... \/\/ code to be timed\n\/\/ TOC\n\/\/ ... \/\/ untimed code\n\/\/ TIC\n\/\/ ... \/\/ other code to be timed\n\/\/ TOC\n\/\/ }\n\/\/\n\/\/ Intead of TOC which outputs the time difference to std::cerr, \n\/\/ you may use TOCN (the time difference in msec as a double)\n\/\/ or TOCS (the time difference as a std::string). \n\/\/\n\/\/ Alternatively, you can performe nested timing like so:\n\/\/\n\/\/ void time_it()\n\/\/ {\n\/\/ USE_NESTED_TICTOC\n\/\/\n\/\/ TICPUSH\n\/\/ ... \/\/ code to be timed\n\/\/ TICPUSH\n\/\/ ... \/\/ nested code to be timed\n\/\/ TOC \/\/ print time for nested code\n\/\/ ... \/\/ more code to be timed\n\/\/ TOC \/\/ print total time\n\/\/ }\n\/\/\n\/\/ Timings below 1 msec are generally subject to round-off errors. Under\n\/\/ LINUX, you can #define VIGRA_HIRES_TIMING to get better\n\/\/ accuracy, but this requires linking against librt.\n\n#ifdef WIN32\n\n #include \"windows.h\"\n\n namespace {\n\n inline double queryTimerUnit()\n {\n LARGE_INTEGER frequency;\n QueryPerformanceFrequency(&frequency);\n return 1000.0 \/ frequency.QuadPart;\n }\n\n inline double tic_toc_diff_num(LARGE_INTEGER const & tic)\n {\n LARGE_INTEGER toc;\n QueryPerformanceCounter(&toc);\n static double unit = queryTimerUnit();\n return ((toc.QuadPart - tic.QuadPart) * unit);\n }\n\n inline std::string tic_toc_diff_string(LARGE_INTEGER const & tic)\n {\n double diff = tic_toc_diff_num(tic); \n std::stringstream s;\n s << diff << \" msec\";\n return s.str();\n }\n\n inline void tic_toc_diff(LARGE_INTEGER const & tic)\n {\n std::cerr << tic_toc_diff_string(tic) < & tic)\n {\n double res = tic_toc_diff_num(tic.back());\n tic.pop_back();\n return res;\n }\n\n inline std::string tic_toc_diff_string(std::vector & tic)\n {\n std::string res = tic_toc_diff_string(tic.back());\n tic.pop_back();\n return res;\n }\n\n inline void tic_toc_diff(std::vector & tic)\n {\n tic_toc_diff(tic.back());\n tic.pop_back();\n }\n\n } \/\/ unnamed namespace\n \n #define USETICTOC LARGE_INTEGER tic_timer;\n #define USE_NESTED_TICTOC std::vector tic_timer;\n #define TIC QueryPerformanceCounter(&tic_timer);\n #define TICPUSH tic_timer.push_back(LARGE_INTEGER());\\\n QueryPerformanceCounter(&(tic_timer.back()));\n #define TOC tic_toc_diff (tic_timer);\n #define TOCN tic_toc_diff_num (tic_timer)\n #define TOCS tic_toc_diff_string(tic_timer)\n\n#else\n\n #if defined(VIGRA_HIRES_TIMING) && !defined(__CYGWIN__)\n \/\/ requires linking against librt\n \n #include \n\n namespace {\n\n inline double tic_toc_diff_num(timespec const & tic)\n {\n timespec toc;\n clock_gettime(CLOCK_PROCESS_CPUTIME_ID, &toc);\n return ((toc.tv_sec*1000.0 + toc.tv_nsec\/1000000.0) -\n (tic.tv_sec*1000.0 + tic.tv_nsec\/1000000.0));\n }\n\n inline std::string tic_toc_diff_string(timespec const & tic)\n {\n double diff = tic_toc_diff_num(tic); \n std::stringstream s;\n s << diff << \" msec\";\n return s.str();\n }\n\n inline void tic_toc_diff(timespec const & tic)\n {\n std::cerr << tic_toc_diff_string(tic) << std::endl;\n }\n \n inline double tic_toc_diff_num(std::vector & tic)\n {\n double res = tic_toc_diff_num(tic.back());\n tic.pop_back();\n return res;\n }\n\n inline std::string tic_toc_diff_string(std::vector & tic)\n {\n std::string res = tic_toc_diff_string(tic.back());\n tic.pop_back();\n return res;\n }\n\n inline void tic_toc_diff(std::vector & tic)\n {\n tic_toc_diff(tic.back());\n tic.pop_back();\n }\n\n } \/\/ unnamed namespace\n\n #define USETICTOC timespec tic_timer;\n #define TIC clock_gettime(CLOCK_PROCESS_CPUTIME_ID, &tic_timer);\n #define TOC tic_toc_diff (tic_timer);\n #define TOCN tic_toc_diff_num (tic_timer)\n #define TOCS tic_toc_diff_string(tic_timer)\n #define USE_NESTED_TICTOC std::vector tic_timer;\n #define TICPUSH tic_timer.push_back(timespec());\\\n clock_gettime(CLOCK_PROCESS_CPUTIME_ID, &(tic_timer.back()));\n\n #else\n \n #include \n\n namespace {\n\n inline double tic_toc_diff_num(timeval const & tic)\n {\n timeval toc;\n gettimeofday(&toc, NULL);\n return ((toc.tv_sec*1000.0 + toc.tv_usec\/1000.0) -\n (tic.tv_sec*1000.0 + tic.tv_usec\/1000.0));\n }\n \n inline std::string tic_toc_diff_string(timeval const & tic)\n {\n double diff = tic_toc_diff_num(tic); \n std::stringstream s;\n s << diff << \" msec\";\n return s.str();\n }\n \n inline void tic_toc_diff(timeval const & tic)\n {\n std::cerr << tic_toc_diff_string(tic)<< std::endl;\n }\n\n inline double tic_toc_diff_num(std::vector & tic)\n {\n double res = tic_toc_diff_num(tic.back());\n tic.pop_back();\n return res;\n }\n\n inline std::string tic_toc_diff_string(std::vector & tic)\n {\n std::string res = tic_toc_diff_string(tic.back());\n tic.pop_back();\n return res;\n }\n\n inline void tic_toc_diff(std::vector & tic)\n {\n tic_toc_diff(tic.back());\n tic.pop_back();\n }\n\n } \/\/ unnamed namespace\n\n #define USETICTOC timeval tic_timer;\n #define TIC gettimeofday (&tic_timer, NULL);\n #define TOC tic_toc_diff (tic_timer);\n #define TOCN tic_toc_diff_num (tic_timer)\n #define TOCS tic_toc_diff_string(tic_timer)\n #define USE_NESTED_TICTOC std::vector tic_timer;\n #define TICPUSH tic_timer.push_back(timeval());\\\n gettimeofday(&(tic_timer.back()), NULL);\n\n #endif \/\/ VIGRA_HIRES_TIMING\n\n#endif \/\/ WIN32\n\n#else \/\/ NDEBUG\n\n#define USETICTOC \n#define TIC\n#define TOC\n#define TOCN 0.0\n#define TICS \"\"\n#define USE_NESTED_TICTOC\n#define TICPUSH\n#endif \/\/ NDEBUG\n\n#endif \/\/ VIGRA_TIMING_HXX\nTiming macro for a executing a number of repetitions of some measurement, and taking the best of possibly several runs. (More advanced versions are of course possible, such as outputting some summary statistics of the runs.)\/************************************************************************\/\n\/* *\/\n\/* Copyright 2008-2011 by Ullrich Koethe *\/\n\/* Cognitive Systems Group, University of Hamburg, Germany *\/\n\/* *\/\n\/* This file is part of the VIGRA computer vision library. *\/\n\/* The VIGRA Website is *\/\n\/* http:\/\/kogs-www.informatik.uni-hamburg.de\/~koethe\/vigra\/ *\/\n\/* Please direct questions, bug reports, and contributions to *\/\n\/* ullrich.koethe@iwr.uni-heidelberg.de or *\/\n\/* vigra@informatik.uni-hamburg.de *\/\n\/* *\/\n\/* Permission is hereby granted, free of charge, to any person *\/\n\/* obtaining a copy of this software and associated documentation *\/\n\/* files (the \"Software\"), to deal in the Software without *\/\n\/* restriction, including without limitation the rights to use, *\/\n\/* copy, modify, merge, publish, distribute, sublicense, and\/or *\/\n\/* sell copies of the Software, and to permit persons to whom the *\/\n\/* Software is furnished to do so, subject to the following *\/\n\/* conditions: *\/\n\/* *\/\n\/* The above copyright notice and this permission notice shall be *\/\n\/* included in all copies or substantial portions of the *\/\n\/* Software. *\/\n\/* *\/\n\/* THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND *\/\n\/* EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES *\/\n\/* OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND *\/\n\/* NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT *\/\n\/* HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, *\/\n\/* WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING *\/\n\/* FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR *\/\n\/* OTHER DEALINGS IN THE SOFTWARE. *\/\n\/* *\/\n\/************************************************************************\/\n\n\n#ifndef VIGRA_TIMING_HXX\n#define VIGRA_TIMING_HXX\n#ifndef VIGRA_NO_TIMING\n\n#include \n#include \n#include \n\n\/\/ Usage:\n\/\/\n\/\/ void time_it()\n\/\/ {\n\/\/ USETICTOC\n\/\/\n\/\/ TIC\n\/\/ ... \/\/ code to be timed\n\/\/ TOC\n\/\/ ... \/\/ untimed code\n\/\/ TIC\n\/\/ ... \/\/ other code to be timed\n\/\/ TOC\n\/\/ }\n\/\/\n\/\/ Intead of TOC which outputs the time difference to std::cerr, \n\/\/ you may use TOCN (the time difference in msec as a double)\n\/\/ or TOCS (the time difference as a std::string). \n\/\/\n\/\/ Alternatively, you can performe nested timing like so:\n\/\/\n\/\/ void time_it()\n\/\/ {\n\/\/ USE_NESTED_TICTOC\n\/\/\n\/\/ TICPUSH\n\/\/ ... \/\/ code to be timed\n\/\/ TICPUSH\n\/\/ ... \/\/ nested code to be timed\n\/\/ TOC \/\/ print time for nested code\n\/\/ ... \/\/ more code to be timed\n\/\/ TOC \/\/ print total time\n\/\/ }\n\/\/\n\/\/ Timings below 1 msec are generally subject to round-off errors. Under\n\/\/ LINUX, you can #define VIGRA_HIRES_TIMING to get better\n\/\/ accuracy, but this requires linking against librt.\n\n#ifdef WIN32\n\n #include \"windows.h\"\n\n namespace {\n\n inline double queryTimerUnit()\n {\n LARGE_INTEGER frequency;\n QueryPerformanceFrequency(&frequency);\n return 1000.0 \/ frequency.QuadPart;\n }\n\n inline double tic_toc_diff_num(LARGE_INTEGER const & tic)\n {\n LARGE_INTEGER toc;\n QueryPerformanceCounter(&toc);\n static double unit = queryTimerUnit();\n return ((toc.QuadPart - tic.QuadPart) * unit);\n }\n\n inline std::string tic_toc_diff_string(LARGE_INTEGER const & tic)\n {\n double diff = tic_toc_diff_num(tic); \n std::stringstream s;\n s << diff << \" msec\";\n return s.str();\n }\n\n inline void tic_toc_diff(LARGE_INTEGER const & tic)\n {\n std::cerr << tic_toc_diff_string(tic) < & tic)\n {\n double res = tic_toc_diff_num(tic.back());\n tic.pop_back();\n return res;\n }\n\n inline std::string tic_toc_diff_string(std::vector & tic)\n {\n std::string res = tic_toc_diff_string(tic.back());\n tic.pop_back();\n return res;\n }\n\n inline void tic_toc_diff(std::vector & tic)\n {\n tic_toc_diff(tic.back());\n tic.pop_back();\n }\n\n } \/\/ unnamed namespace\n \n #define USETICTOC LARGE_INTEGER tic_timer;\n #define USE_NESTED_TICTOC std::vector tic_timer;\n #define TIC QueryPerformanceCounter(&tic_timer);\n #define TICPUSH tic_timer.push_back(LARGE_INTEGER());\\\n QueryPerformanceCounter(&(tic_timer.back()));\n #define TOC tic_toc_diff (tic_timer);\n #define TOCN tic_toc_diff_num (tic_timer)\n #define TOCS tic_toc_diff_string(tic_timer)\n\n#else\n\n #if defined(VIGRA_HIRES_TIMING) && !defined(__CYGWIN__)\n \/\/ requires linking against librt\n \n #include \n\n namespace {\n\n inline double tic_toc_diff_num(timespec const & tic)\n {\n timespec toc;\n clock_gettime(CLOCK_PROCESS_CPUTIME_ID, &toc);\n return ((toc.tv_sec*1000.0 + toc.tv_nsec\/1000000.0) -\n (tic.tv_sec*1000.0 + tic.tv_nsec\/1000000.0));\n }\n\n inline std::string tic_toc_diff_string(timespec const & tic)\n {\n double diff = tic_toc_diff_num(tic); \n std::stringstream s;\n s << diff << \" msec\";\n return s.str();\n }\n\n inline void tic_toc_diff(timespec const & tic)\n {\n std::cerr << tic_toc_diff_string(tic) << std::endl;\n }\n \n inline double tic_toc_diff_num(std::vector & tic)\n {\n double res = tic_toc_diff_num(tic.back());\n tic.pop_back();\n return res;\n }\n\n inline std::string tic_toc_diff_string(std::vector & tic)\n {\n std::string res = tic_toc_diff_string(tic.back());\n tic.pop_back();\n return res;\n }\n\n inline void tic_toc_diff(std::vector & tic)\n {\n tic_toc_diff(tic.back());\n tic.pop_back();\n }\n\n } \/\/ unnamed namespace\n\n #define USETICTOC timespec tic_timer;\n #define TIC clock_gettime(CLOCK_PROCESS_CPUTIME_ID, &tic_timer);\n #define TOC tic_toc_diff (tic_timer);\n #define TOCN tic_toc_diff_num (tic_timer)\n #define TOCS tic_toc_diff_string(tic_timer)\n #define USE_NESTED_TICTOC std::vector tic_timer;\n #define TICPUSH tic_timer.push_back(timespec());\\\n clock_gettime(CLOCK_PROCESS_CPUTIME_ID, &(tic_timer.back()));\n\n #else\n \n #include \n\n namespace {\n\n inline double tic_toc_diff_num(timeval const & tic)\n {\n timeval toc;\n gettimeofday(&toc, NULL);\n return ((toc.tv_sec*1000.0 + toc.tv_usec\/1000.0) -\n (tic.tv_sec*1000.0 + tic.tv_usec\/1000.0));\n }\n \n inline std::string tic_toc_diff_string(timeval const & tic)\n {\n double diff = tic_toc_diff_num(tic); \n std::stringstream s;\n s << diff << \" msec\";\n return s.str();\n }\n \n inline void tic_toc_diff(timeval const & tic)\n {\n std::cerr << tic_toc_diff_string(tic)<< std::endl;\n }\n\n inline double tic_toc_diff_num(std::vector & tic)\n {\n double res = tic_toc_diff_num(tic.back());\n tic.pop_back();\n return res;\n }\n\n inline std::string tic_toc_diff_string(std::vector & tic)\n {\n std::string res = tic_toc_diff_string(tic.back());\n tic.pop_back();\n return res;\n }\n\n inline void tic_toc_diff(std::vector & tic)\n {\n tic_toc_diff(tic.back());\n tic.pop_back();\n }\n\n } \/\/ unnamed namespace\n\n #define USETICTOC timeval tic_timer;\n #define TIC gettimeofday (&tic_timer, NULL);\n #define TOC tic_toc_diff (tic_timer);\n #define TOCN tic_toc_diff_num (tic_timer)\n #define TOCS tic_toc_diff_string(tic_timer)\n #define USE_NESTED_TICTOC std::vector tic_timer;\n #define TICPUSH tic_timer.push_back(timeval());\\\n gettimeofday(&(tic_timer.back()), NULL);\n\n #endif \/\/ VIGRA_HIRES_TIMING\n\n#endif \/\/ WIN32\n\n\/\/ TICTOCLOOP runs the body inner_repetitions times, and minimizes the result over a number of outer_repetitions runs,\n\/\/ outputting the final minimal average to std::cerr\n#define TICTOCLOOP_BEGIN(inner_repetitions,outer_repetitions) \\\n { \\\n\tUSETICTOC \\\n\t double tictoc_best_, tictoc_inner_repetitions_=inner_repetitions; size_t tictoc_outer_repetitions_=outer_repetitions; \\\n\t for (size_t tictoccounter_=0; tictoccounter_"} {"text":"MAINT-3553 Another checking is added to avoid possible crash.<|endoftext|>"} {"text":"\/* Copyright 2018 The TensorFlow Authors. All Rights Reserved.\n\nLicensed under the Apache License, Version 2.0 (the \"License\");\nyou may not use this file except in compliance with the License.\nYou may obtain a copy of the License at\n\n http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n\nUnless required by applicable law or agreed to in writing, software\ndistributed under the License is distributed on an \"AS IS\" BASIS,\nWITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\nSee the License for the specific language governing permissions and\nlimitations under the License.\n==============================================================================*\/\n\n#include \"tensorflow\/compiler\/jit\/flags.h\"\n\n#include \/\/ NOLINT\n\n#include \"absl\/base\/call_once.h\"\n#include \"absl\/strings\/numbers.h\"\n#include \"absl\/strings\/str_split.h\"\n#include \"absl\/strings\/strip.h\"\n#include \"tensorflow\/compiler\/xla\/parse_flags_from_env.h\"\n#include \"tensorflow\/core\/platform\/macros.h\"\n#include \"tensorflow\/core\/util\/command_line_flags.h\"\n\nnamespace tensorflow {\nnamespace {\n\nBuildXlaOpsPassFlags* build_ops_flags;\nMarkForCompilationPassFlags* mark_for_compilation_flags;\nXlaDeviceFlags* device_flags;\nXlaOpsCommonFlags* ops_flags;\nIntroduceFloatingPointJitterPassFlags* jitter_flags;\n\nstd::vector* flag_list;\nabsl::once_flag flags_init;\n\nbool SetterForXlaAutoJitFlag(const string& value) {\n int32 opt_level;\n \/\/ We need to use the mark_for_compilation_flags directly here instead of\n \/\/ going via GetMarkForCompilationPassFlags() to avoid infinite recursion. The\n \/\/ latter will try to setup and parse flags, which would bring us back to this\n \/\/ setter.\n if (absl::SimpleAtoi(value, &opt_level)) {\n mark_for_compilation_flags->xla_auto_jit_flag\n .optimization_level_single_gpu = opt_level;\n mark_for_compilation_flags->xla_auto_jit_flag.optimization_level_general =\n opt_level;\n return true;\n }\n\n if (value == \"fusible\") {\n mark_for_compilation_flags->xla_auto_jit_flag\n .optimization_level_single_gpu = 1;\n mark_for_compilation_flags->xla_auto_jit_flag.optimization_level_general =\n 1;\n mark_for_compilation_flags->tf_xla_ops_to_cluster = \"FUSIBLE\";\n return true;\n }\n\n absl::string_view value_sv(value);\n if (!absl::ConsumePrefix(&value_sv, \"single-gpu(\") ||\n !absl::ConsumeSuffix(&value_sv, \")\") ||\n !absl::SimpleAtoi(value_sv, &opt_level)) {\n return false;\n }\n\n mark_for_compilation_flags->xla_auto_jit_flag.optimization_level_single_gpu =\n opt_level;\n return true;\n}\n\nvoid AppendMarkForCompilationPassFlagsInternal(std::vector* flag_list) {\n std::vector new_flags = {\n Flag(\"tf_xla_auto_jit\", SetterForXlaAutoJitFlag, \"0\",\n \"Control compilation of operators into XLA computations on CPU and \"\n \"GPU devices. 0 = use ConfigProto setting; -1 = off; 1 = on for \"\n \"things very likely to be improved; 2 = on for everything; \"\n \"(experimental) fusible = only for Tensorflow operations that XLA \"\n \"knows how to fuse. \"\n \"If set to single-gpu() then this resolves to for single-GPU \"\n \"graphs (graphs that have at least one node placed on a GPU and no \"\n \"more than one GPU is in use through the entire graph) and 0 \"\n \"otherwise. Experimental.\"),\n Flag(\"tf_xla_min_cluster_size\",\n &mark_for_compilation_flags->tf_xla_min_cluster_size,\n \"Minimum number of operators in an XLA compilation. Ignored for \"\n \"operators placed on an XLA device or operators explicitly marked \"\n \"for compilation.\"),\n Flag(\"tf_xla_max_cluster_size\",\n &mark_for_compilation_flags->tf_xla_max_cluster_size,\n \"Maximum number of operators in an XLA compilation.\"),\n Flag(\n \"tf_xla_ops_to_cluster\",\n &mark_for_compilation_flags->tf_xla_ops_to_cluster,\n \"(experimental) \"\n \"Limit the operations clustered by XLA to these operations. \"\n \"If multiple, separate them with commas. Shortcuts: \"\n \" PW: All point-wise operations.\"\n \" RED: All reduction operations.\"\n \" MISC: Mixed operations.\"\n \" PWRED: TF operations that get converted to PW+RED operation in XLA.\"\n \" REDUCEWINDOW: TF operations like MaxPool\/AvgPool that get \"\n \"converted to ReduceWindow in XLA.\"\n \" REDUCEWINDOWPW: Operation that get converted to ReduceWindow + PW \"\n \"(LRN, LRNGrad).\"\n \" BN: TF FusedBatchNorm* operations.\"\n \" FUSIBLE: All TF operations that XLA can fuse (All the above). \"\n \"You can also put any TF operation name, e.g. 'FUSIBLE,Matmul'.\"),\n Flag(\"tf_xla_clustering_debug\",\n &mark_for_compilation_flags->tf_xla_clustering_debug,\n \"Dump graphs during XLA compilation.\"),\n Flag(\"tf_xla_cpu_global_jit\",\n &mark_for_compilation_flags->tf_xla_cpu_global_jit,\n \"Enables global JIT compilation for CPU via SessionOptions.\"),\n Flag(\"tf_xla_clustering_fuel\",\n &mark_for_compilation_flags->tf_xla_clustering_fuel,\n \"Places an artificial limit on the number of ops marked as \"\n \"eligible for clustering.\"),\n Flag(\"tf_xla_disable_deadness_safety_checks_for_debugging\",\n &mark_for_compilation_flags\n ->tf_xla_disable_deadness_safety_checks_for_debugging,\n \"Disable deadness related safety checks when clustering (this is \"\n \"unsound).\"),\n Flag(\"tf_xla_disable_resource_variable_safety_checks_for_debugging\",\n &mark_for_compilation_flags\n ->tf_xla_disable_resource_variable_safety_checks_for_debugging,\n \"Disable resource variables related safety checks when clustering \"\n \"(this is unsound).\")};\n flag_list->insert(flag_list->end(), new_flags.begin(), new_flags.end());\n}\n\nvoid AllocateAndParseFlags() {\n build_ops_flags = new BuildXlaOpsPassFlags;\n build_ops_flags->tf_xla_enable_lazy_compilation = true;\n build_ops_flags->tf_xla_print_cluster_outputs = false;\n build_ops_flags->tf_xla_check_cluster_input_numerics = false;\n build_ops_flags->tf_xla_check_cluster_output_numerics = false;\n build_ops_flags->tf_xla_disable_constant_folding = false;\n\n mark_for_compilation_flags = new MarkForCompilationPassFlags;\n mark_for_compilation_flags->xla_auto_jit_flag.optimization_level_single_gpu =\n 0;\n mark_for_compilation_flags->xla_auto_jit_flag.optimization_level_general = 0;\n mark_for_compilation_flags->tf_xla_min_cluster_size = 4;\n mark_for_compilation_flags->tf_xla_max_cluster_size =\n std::numeric_limits::max();\n mark_for_compilation_flags->tf_xla_clustering_debug = false;\n mark_for_compilation_flags->tf_xla_cpu_global_jit = false;\n mark_for_compilation_flags->tf_xla_clustering_fuel =\n std::numeric_limits::max();\n mark_for_compilation_flags\n ->tf_xla_disable_deadness_safety_checks_for_debugging = false;\n mark_for_compilation_flags\n ->tf_xla_disable_resource_variable_safety_checks_for_debugging = false;\n\n device_flags = new XlaDeviceFlags;\n device_flags->tf_xla_compile_on_demand = false;\n device_flags->tf_xla_enable_xla_devices = true;\n\n ops_flags = new XlaOpsCommonFlags;\n ops_flags->tf_xla_always_defer_compilation = false;\n\n jitter_flags = new IntroduceFloatingPointJitterPassFlags;\n jitter_flags->jitter_amount = 1e-5;\n\n auto setter_for_jitter_tensor_names = [](string sequence) {\n jitter_flags->tensor_names = absl::StrSplit(sequence, ',');\n return true;\n };\n\n flag_list = new std::vector(\n {Flag(\"tf_xla_enable_lazy_compilation\",\n &build_ops_flags->tf_xla_enable_lazy_compilation, \"\"),\n Flag(\"tf_xla_print_cluster_outputs\",\n &build_ops_flags->tf_xla_print_cluster_outputs,\n \"If true then insert Print nodes to print out values produced by \"\n \"XLA clusters.\"),\n Flag(\"tf_xla_check_cluster_input_numerics\",\n &build_ops_flags->tf_xla_check_cluster_input_numerics,\n \"If true then insert CheckNumerics nodes to to check all cluster \"\n \"inputs.\"),\n Flag(\"tf_xla_check_cluster_output_numerics\",\n &build_ops_flags->tf_xla_check_cluster_output_numerics,\n \"If true then insert CheckNumerics nodes to to check all cluster \"\n \"outputs.\"),\n Flag(\"tf_xla_disable_constant_folding\",\n &build_ops_flags->tf_xla_disable_constant_folding,\n \"If true then disables constant folding on TF graph before XLA \"\n \"compilation.\"),\n\n Flag(\"tf_xla_compile_on_demand\", &device_flags->tf_xla_compile_on_demand,\n \"Switch a device into 'on-demand' mode, where instead of \"\n \"autoclustering ops are compiled one by one just-in-time.\"),\n\n Flag(\"tf_xla_enable_xla_devices\",\n &device_flags->tf_xla_enable_xla_devices,\n \"Generate XLA_* devices, where placing a computation on such a \"\n \"device\"\n \"forces compilation by XLA. Deprecated.\"),\n\n Flag(\"tf_xla_always_defer_compilation\",\n &ops_flags->tf_xla_always_defer_compilation, \"\"),\n\n Flag(\"tf_introduce_floating_point_jitter_to_tensors\",\n setter_for_jitter_tensor_names, \"\",\n \"The Tensors to add the jitter to. The tensors are named in the \"\n \"TensorId format of :.\"),\n Flag(\"tf_introduce_floating_point_jitter_amount\",\n &jitter_flags->jitter_amount,\n \"The amount of jitter to introduce. This amount is added to each \"\n \"element in the tensors named in `tensor_names.\")});\n\n AppendMarkForCompilationPassFlagsInternal(flag_list);\n xla::ParseFlagsFromEnvAndDieIfUnknown(\"TF_XLA_FLAGS\", *flag_list);\n}\n\n} \/\/ namespace\n\nbool SetXlaAutoJitFlagFromFlagString(const string& value) {\n absl::call_once(flags_init, &AllocateAndParseFlags);\n return SetterForXlaAutoJitFlag(value);\n}\n\nBuildXlaOpsPassFlags* GetBuildXlaOpsPassFlags() {\n absl::call_once(flags_init, &AllocateAndParseFlags);\n return build_ops_flags;\n}\n\nMarkForCompilationPassFlags* GetMarkForCompilationPassFlags() {\n absl::call_once(flags_init, &AllocateAndParseFlags);\n return mark_for_compilation_flags;\n}\n\nXlaDeviceFlags* GetXlaDeviceFlags() {\n absl::call_once(flags_init, &AllocateAndParseFlags);\n return device_flags;\n}\n\nconst XlaOpsCommonFlags& GetXlaOpsCommonFlags() {\n absl::call_once(flags_init, &AllocateAndParseFlags);\n return *ops_flags;\n}\n\nconst IntroduceFloatingPointJitterPassFlags&\nGetIntroduceFloatingPointJitterPassFlags() {\n absl::call_once(flags_init, &AllocateAndParseFlags);\n return *jitter_flags;\n}\n\nvoid AppendMarkForCompilationPassFlags(std::vector* flag_list) {\n absl::call_once(flags_init, &AllocateAndParseFlags);\n AppendMarkForCompilationPassFlagsInternal(flag_list);\n}\n\nstatic bool xla_is_enabled = false;\n\nvoid SetXlaIsEnabled() { xla_is_enabled = true; }\n\nbool IsXlaEnabled() { return xla_is_enabled; }\n\n} \/\/ namespace tensorflow\nSmall docstring fix. This make the example work.\/* Copyright 2018 The TensorFlow Authors. All Rights Reserved.\n\nLicensed under the Apache License, Version 2.0 (the \"License\");\nyou may not use this file except in compliance with the License.\nYou may obtain a copy of the License at\n\n http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n\nUnless required by applicable law or agreed to in writing, software\ndistributed under the License is distributed on an \"AS IS\" BASIS,\nWITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\nSee the License for the specific language governing permissions and\nlimitations under the License.\n==============================================================================*\/\n\n#include \"tensorflow\/compiler\/jit\/flags.h\"\n\n#include \/\/ NOLINT\n\n#include \"absl\/base\/call_once.h\"\n#include \"absl\/strings\/numbers.h\"\n#include \"absl\/strings\/str_split.h\"\n#include \"absl\/strings\/strip.h\"\n#include \"tensorflow\/compiler\/xla\/parse_flags_from_env.h\"\n#include \"tensorflow\/core\/platform\/macros.h\"\n#include \"tensorflow\/core\/util\/command_line_flags.h\"\n\nnamespace tensorflow {\nnamespace {\n\nBuildXlaOpsPassFlags* build_ops_flags;\nMarkForCompilationPassFlags* mark_for_compilation_flags;\nXlaDeviceFlags* device_flags;\nXlaOpsCommonFlags* ops_flags;\nIntroduceFloatingPointJitterPassFlags* jitter_flags;\n\nstd::vector* flag_list;\nabsl::once_flag flags_init;\n\nbool SetterForXlaAutoJitFlag(const string& value) {\n int32 opt_level;\n \/\/ We need to use the mark_for_compilation_flags directly here instead of\n \/\/ going via GetMarkForCompilationPassFlags() to avoid infinite recursion. The\n \/\/ latter will try to setup and parse flags, which would bring us back to this\n \/\/ setter.\n if (absl::SimpleAtoi(value, &opt_level)) {\n mark_for_compilation_flags->xla_auto_jit_flag\n .optimization_level_single_gpu = opt_level;\n mark_for_compilation_flags->xla_auto_jit_flag.optimization_level_general =\n opt_level;\n return true;\n }\n\n if (value == \"fusible\") {\n mark_for_compilation_flags->xla_auto_jit_flag\n .optimization_level_single_gpu = 1;\n mark_for_compilation_flags->xla_auto_jit_flag.optimization_level_general =\n 1;\n mark_for_compilation_flags->tf_xla_ops_to_cluster = \"FUSIBLE\";\n return true;\n }\n\n absl::string_view value_sv(value);\n if (!absl::ConsumePrefix(&value_sv, \"single-gpu(\") ||\n !absl::ConsumeSuffix(&value_sv, \")\") ||\n !absl::SimpleAtoi(value_sv, &opt_level)) {\n return false;\n }\n\n mark_for_compilation_flags->xla_auto_jit_flag.optimization_level_single_gpu =\n opt_level;\n return true;\n}\n\nvoid AppendMarkForCompilationPassFlagsInternal(std::vector* flag_list) {\n std::vector new_flags = {\n Flag(\"tf_xla_auto_jit\", SetterForXlaAutoJitFlag, \"0\",\n \"Control compilation of operators into XLA computations on CPU and \"\n \"GPU devices. 0 = use ConfigProto setting; -1 = off; 1 = on for \"\n \"things very likely to be improved; 2 = on for everything; \"\n \"(experimental) fusible = only for Tensorflow operations that XLA \"\n \"knows how to fuse. \"\n \"If set to single-gpu() then this resolves to for single-GPU \"\n \"graphs (graphs that have at least one node placed on a GPU and no \"\n \"more than one GPU is in use through the entire graph) and 0 \"\n \"otherwise. Experimental.\"),\n Flag(\"tf_xla_min_cluster_size\",\n &mark_for_compilation_flags->tf_xla_min_cluster_size,\n \"Minimum number of operators in an XLA compilation. Ignored for \"\n \"operators placed on an XLA device or operators explicitly marked \"\n \"for compilation.\"),\n Flag(\"tf_xla_max_cluster_size\",\n &mark_for_compilation_flags->tf_xla_max_cluster_size,\n \"Maximum number of operators in an XLA compilation.\"),\n Flag(\n \"tf_xla_ops_to_cluster\",\n &mark_for_compilation_flags->tf_xla_ops_to_cluster,\n \"(experimental) \"\n \"Limit the operations clustered by XLA to these operations. \"\n \"If multiple, separate them with commas. Shortcuts: \"\n \" PW: All point-wise operations.\"\n \" RED: All reduction operations.\"\n \" MISC: Mixed operations.\"\n \" PWRED: TF operations that get converted to PW+RED operation in XLA.\"\n \" REDUCEWINDOW: TF operations like MaxPool\/AvgPool that get \"\n \"converted to ReduceWindow in XLA.\"\n \" REDUCEWINDOWPW: Operation that get converted to ReduceWindow + PW \"\n \"(LRN, LRNGrad).\"\n \" BN: TF FusedBatchNorm* operations.\"\n \" FUSIBLE: All TF operations that XLA can fuse (All the above). \"\n \"You can also put any TF operation name, e.g. 'FUSIBLE,MatMul'.\"),\n Flag(\"tf_xla_clustering_debug\",\n &mark_for_compilation_flags->tf_xla_clustering_debug,\n \"Dump graphs during XLA compilation.\"),\n Flag(\"tf_xla_cpu_global_jit\",\n &mark_for_compilation_flags->tf_xla_cpu_global_jit,\n \"Enables global JIT compilation for CPU via SessionOptions.\"),\n Flag(\"tf_xla_clustering_fuel\",\n &mark_for_compilation_flags->tf_xla_clustering_fuel,\n \"Places an artificial limit on the number of ops marked as \"\n \"eligible for clustering.\"),\n Flag(\"tf_xla_disable_deadness_safety_checks_for_debugging\",\n &mark_for_compilation_flags\n ->tf_xla_disable_deadness_safety_checks_for_debugging,\n \"Disable deadness related safety checks when clustering (this is \"\n \"unsound).\"),\n Flag(\"tf_xla_disable_resource_variable_safety_checks_for_debugging\",\n &mark_for_compilation_flags\n ->tf_xla_disable_resource_variable_safety_checks_for_debugging,\n \"Disable resource variables related safety checks when clustering \"\n \"(this is unsound).\")};\n flag_list->insert(flag_list->end(), new_flags.begin(), new_flags.end());\n}\n\nvoid AllocateAndParseFlags() {\n build_ops_flags = new BuildXlaOpsPassFlags;\n build_ops_flags->tf_xla_enable_lazy_compilation = true;\n build_ops_flags->tf_xla_print_cluster_outputs = false;\n build_ops_flags->tf_xla_check_cluster_input_numerics = false;\n build_ops_flags->tf_xla_check_cluster_output_numerics = false;\n build_ops_flags->tf_xla_disable_constant_folding = false;\n\n mark_for_compilation_flags = new MarkForCompilationPassFlags;\n mark_for_compilation_flags->xla_auto_jit_flag.optimization_level_single_gpu =\n 0;\n mark_for_compilation_flags->xla_auto_jit_flag.optimization_level_general = 0;\n mark_for_compilation_flags->tf_xla_min_cluster_size = 4;\n mark_for_compilation_flags->tf_xla_max_cluster_size =\n std::numeric_limits::max();\n mark_for_compilation_flags->tf_xla_clustering_debug = false;\n mark_for_compilation_flags->tf_xla_cpu_global_jit = false;\n mark_for_compilation_flags->tf_xla_clustering_fuel =\n std::numeric_limits::max();\n mark_for_compilation_flags\n ->tf_xla_disable_deadness_safety_checks_for_debugging = false;\n mark_for_compilation_flags\n ->tf_xla_disable_resource_variable_safety_checks_for_debugging = false;\n\n device_flags = new XlaDeviceFlags;\n device_flags->tf_xla_compile_on_demand = false;\n device_flags->tf_xla_enable_xla_devices = true;\n\n ops_flags = new XlaOpsCommonFlags;\n ops_flags->tf_xla_always_defer_compilation = false;\n\n jitter_flags = new IntroduceFloatingPointJitterPassFlags;\n jitter_flags->jitter_amount = 1e-5;\n\n auto setter_for_jitter_tensor_names = [](string sequence) {\n jitter_flags->tensor_names = absl::StrSplit(sequence, ',');\n return true;\n };\n\n flag_list = new std::vector(\n {Flag(\"tf_xla_enable_lazy_compilation\",\n &build_ops_flags->tf_xla_enable_lazy_compilation, \"\"),\n Flag(\"tf_xla_print_cluster_outputs\",\n &build_ops_flags->tf_xla_print_cluster_outputs,\n \"If true then insert Print nodes to print out values produced by \"\n \"XLA clusters.\"),\n Flag(\"tf_xla_check_cluster_input_numerics\",\n &build_ops_flags->tf_xla_check_cluster_input_numerics,\n \"If true then insert CheckNumerics nodes to to check all cluster \"\n \"inputs.\"),\n Flag(\"tf_xla_check_cluster_output_numerics\",\n &build_ops_flags->tf_xla_check_cluster_output_numerics,\n \"If true then insert CheckNumerics nodes to to check all cluster \"\n \"outputs.\"),\n Flag(\"tf_xla_disable_constant_folding\",\n &build_ops_flags->tf_xla_disable_constant_folding,\n \"If true then disables constant folding on TF graph before XLA \"\n \"compilation.\"),\n\n Flag(\"tf_xla_compile_on_demand\", &device_flags->tf_xla_compile_on_demand,\n \"Switch a device into 'on-demand' mode, where instead of \"\n \"autoclustering ops are compiled one by one just-in-time.\"),\n\n Flag(\"tf_xla_enable_xla_devices\",\n &device_flags->tf_xla_enable_xla_devices,\n \"Generate XLA_* devices, where placing a computation on such a \"\n \"device\"\n \"forces compilation by XLA. Deprecated.\"),\n\n Flag(\"tf_xla_always_defer_compilation\",\n &ops_flags->tf_xla_always_defer_compilation, \"\"),\n\n Flag(\"tf_introduce_floating_point_jitter_to_tensors\",\n setter_for_jitter_tensor_names, \"\",\n \"The Tensors to add the jitter to. The tensors are named in the \"\n \"TensorId format of :.\"),\n Flag(\"tf_introduce_floating_point_jitter_amount\",\n &jitter_flags->jitter_amount,\n \"The amount of jitter to introduce. This amount is added to each \"\n \"element in the tensors named in `tensor_names.\")});\n\n AppendMarkForCompilationPassFlagsInternal(flag_list);\n xla::ParseFlagsFromEnvAndDieIfUnknown(\"TF_XLA_FLAGS\", *flag_list);\n}\n\n} \/\/ namespace\n\nbool SetXlaAutoJitFlagFromFlagString(const string& value) {\n absl::call_once(flags_init, &AllocateAndParseFlags);\n return SetterForXlaAutoJitFlag(value);\n}\n\nBuildXlaOpsPassFlags* GetBuildXlaOpsPassFlags() {\n absl::call_once(flags_init, &AllocateAndParseFlags);\n return build_ops_flags;\n}\n\nMarkForCompilationPassFlags* GetMarkForCompilationPassFlags() {\n absl::call_once(flags_init, &AllocateAndParseFlags);\n return mark_for_compilation_flags;\n}\n\nXlaDeviceFlags* GetXlaDeviceFlags() {\n absl::call_once(flags_init, &AllocateAndParseFlags);\n return device_flags;\n}\n\nconst XlaOpsCommonFlags& GetXlaOpsCommonFlags() {\n absl::call_once(flags_init, &AllocateAndParseFlags);\n return *ops_flags;\n}\n\nconst IntroduceFloatingPointJitterPassFlags&\nGetIntroduceFloatingPointJitterPassFlags() {\n absl::call_once(flags_init, &AllocateAndParseFlags);\n return *jitter_flags;\n}\n\nvoid AppendMarkForCompilationPassFlags(std::vector* flag_list) {\n absl::call_once(flags_init, &AllocateAndParseFlags);\n AppendMarkForCompilationPassFlagsInternal(flag_list);\n}\n\nstatic bool xla_is_enabled = false;\n\nvoid SetXlaIsEnabled() { xla_is_enabled = true; }\n\nbool IsXlaEnabled() { return xla_is_enabled; }\n\n} \/\/ namespace tensorflow\n<|endoftext|>"} {"text":"#include \n#include \n#include \"..\/test.hpp\"\n\n#include \n#include \n\nusing namespace realm;\nusing namespace realm::util;\n\nstruct InputStreamAdapter : _impl::InputStream {\n InputStreamAdapter(std::ifstream& s) : m_stream(s) {}\n\n size_t read(char* buffer, size_t size) final\n {\n return m_stream.read(buffer, size).gcount();\n }\n\n std::ifstream& m_stream;\n};\n\nint main(int argc, const char* argv[])\n{\n if (argc == 1) {\n fprintf(stderr, \"Usage: %s \\n(where is a transaction log file that will be replayed.)\", argv[0]);\n exit(1);\n }\n\n std::ifstream in{argv[1]};\n if (!in.is_open()) {\n fprintf(stderr, \"Could not open file for reading: %s\\n\", argv[1]);\n exit(1);\n }\n\n InputStreamAdapter in_a{in};\n std::vector buffer;\n buffer.resize(1024);\n _impl::NoCopyInputStreamAdaptor in_aa{in_a, buffer.data(), buffer.size()};\n\n test_util::unit_test::TestDetails test_details;\n test_details.test_index = 0;\n test_details.suite_name = \"FuzzyTest\";\n test_details.test_name = \"TransactLogApplier\";\n test_details.file_name = __FILE__;\n test_details.line_number = __LINE__;\n\n Group group;\n\n try {\n Replication::apply_changeset(in_aa, group);\n }\n catch (_impl::TransactLogParser::BadTransactLog) {\n return 0;\n }\n\n return 0;\n}\nRemove old unused code, preventing compile of fuzz_transact_log.cpp#include \n#include \n#include \"..\/test.hpp\"\n\n#include \n#include \n\nusing namespace realm;\nusing namespace realm::util;\n\nstruct InputStreamAdapter : _impl::InputStream {\n InputStreamAdapter(std::ifstream& s) : m_stream(s) {}\n\n size_t read(char* buffer, size_t size) final\n {\n return m_stream.read(buffer, size).gcount();\n }\n\n std::ifstream& m_stream;\n};\n\nint main(int argc, const char* argv[])\n{\n if (argc == 1) {\n fprintf(stderr, \"Usage: %s \\n(where is a transaction log file that will be replayed.)\", argv[0]);\n exit(1);\n }\n\n std::ifstream in{argv[1]};\n if (!in.is_open()) {\n fprintf(stderr, \"Could not open file for reading: %s\\n\", argv[1]);\n exit(1);\n }\n\n InputStreamAdapter in_a{in};\n std::vector buffer;\n buffer.resize(1024);\n _impl::NoCopyInputStreamAdaptor in_aa{in_a, buffer.data(), buffer.size()};\n\n Group group;\n\n try {\n Replication::apply_changeset(in_aa, group);\n }\n catch (_impl::TransactLogParser::BadTransactLog) {\n return 0;\n }\n\n return 0;\n}\n<|endoftext|>"} {"text":"#include \"nanocv.h\"\n#include \"models\/forward_network.h\"\n#include \"task.h\"\n#include \n\nnamespace ncv \n{\n class dummy_tast_t : public ncv::task_t\n {\n public:\n \n NANOCV_MAKE_CLONABLE(dummy_tast_t)\n \n \/\/ constructor\n dummy_tast_t(const string_t& = string_t())\n : task_t(\"test task\")\n { \n }\n \n \/\/ create samples\n void resize(size_t samples)\n {\n m_images.clear();\n m_samples.clear();\n \n for (size_t i = 0; i < samples; i ++)\n { \n sample_t sample(m_images.size(), sample_region(0, 0));\n sample.m_label = \"label\";\n sample.m_target = ncv::class_target(i % n_outputs(), n_outputs());\n sample.m_fold = { 0, protocol::train };\n m_samples.push_back(sample);\n\n image_t image(n_rows(), n_cols(), color());\n m_images.push_back(image);\n } \n } \n \n \/\/ load images from the given directory\n virtual bool load(const string_t&) { return true; }\n \n \/\/ access functions\n virtual size_t n_rows() const { return 28; }\n virtual size_t n_cols() const { return 28; }\n virtual size_t n_outputs() const { return 10; }\n virtual size_t n_folds() const { return 1; }\n virtual color_mode color() const { return color_mode::luma; }\n };\n}\n\nint main(int argc, char *argv[])\n{\n ncv::init();\n\n using namespace ncv;\n\n \/\/ parse the command line\n boost::program_options::options_description po_desc(\"\", 160);\n po_desc.add_options()(\"help,h\", \"test program\");\n po_desc.add_options()(\"threads,t\",\n boost::program_options::value()->default_value(1),\n \"number of threads to use [1, 16], 0 - use all available threads\");\n po_desc.add_options()(\"samples,s\",\n boost::program_options::value()->default_value(100000),\n \"number of samples to use [1000, 100000]\");\n po_desc.add_options()(\"forward\",\n \"evaluate the \\'forward\\' pass (output)\");\n po_desc.add_options()(\"backward\",\n \"evaluate the \\'backward' pass (gradient)\");\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_threads = math::clamp(po_vm[\"threads\"].as(), 0, 16);\n const size_t cmd_samples = math::clamp(po_vm[\"samples\"].as(), 1000, 100 * 1000);\n const bool cmd_forward = po_vm.count(\"forward\");\n const bool cmd_backward = po_vm.count(\"backward\");\n\n if (!cmd_forward && !cmd_backward)\n {\n std::cout << po_desc;\n return EXIT_FAILURE;\n }\n \n dummy_tast_t task;\n task.resize(cmd_samples);\n\n const size_t cmd_outputs = task.n_outputs();\n\n const string_t lmodel0;\n const string_t lmodel1 = lmodel0 + \"linear:dims=128;act-snorm;\";\n const string_t lmodel2 = lmodel1 + \"linear:dims=64;act-snorm;\";\n const string_t lmodel3 = lmodel2 + \"linear:dims=32;act-snorm;\";\n const string_t lmodel4 = lmodel3 + \"linear:dims=16;act-snorm;\";\n const string_t lmodel5 = lmodel4 + \"linear:dims=8;act-snorm;\";\n \n string_t cmodel;\n cmodel = cmodel + \"conv:dims=16,rows=7,cols=7;act-snorm;pool-max;\";\n cmodel = cmodel + \"conv:dims=32,rows=5,cols=5;act-snorm;pool-max;\";\n cmodel = cmodel + \"conv:dims=64,rows=3,cols=3;act-snorm;\";\n \n const string_t outlayer = \"linear:dims=\" + text::to_string(cmd_outputs) + \";softmax:type=global;\";\n\n strings_t cmd_networks =\n {\n lmodel0 + outlayer,\n lmodel1 + outlayer,\n lmodel2 + outlayer,\n lmodel3 + outlayer,\n lmodel4 + outlayer,\n lmodel5 + outlayer,\n cmodel + outlayer\n };\n\n const rloss_t rloss = loss_manager_t::instance().get(\"class-ratio\");\n assert(rloss);\n const loss_t& loss = *rloss;\n\n for (const string_t& cmd_network : cmd_networks)\n {\n log_info() << \"<<< running network [\" << cmd_network << \"] ...\";\n\n \/\/ create feed-forward network\n forward_network_t model(cmd_network);\n model.resize(task, true);\n\n \/\/ process the samples\n if (cmd_forward)\n {\n accumulator_t ldata(model, cmd_threads, \"l2-reg\", criterion_t::type::value, 0.1);\n\n const ncv::timer_t timer;\n ldata.update(task, task.samples(), loss);\n\n log_info() << \"<<< processed [\" << ldata.count() << \"] forward samples in \" << timer.elapsed() << \".\";\n }\n\n if (cmd_backward)\n {\n accumulator_t gdata(model, cmd_threads, \"l2-reg\", criterion_t::type::vgrad, 0.1);\n\n const ncv::timer_t timer;\n gdata.update(task, task.samples(), loss);\n\n log_info() << \"<<< processed [\" << gdata.count() << \"] backward samples in \" << timer.elapsed() << \".\";\n }\n }\n\n \/\/ OK\n log_info() << done;\n return EXIT_SUCCESS;\n}\nsample randomly for the test program#include \"nanocv.h\"\n#include \"models\/forward_network.h\"\n#include \"task.h\"\n#include \n\nnamespace ncv \n{\n class dummy_tast_t : public ncv::task_t\n {\n public:\n \n NANOCV_MAKE_CLONABLE(dummy_tast_t)\n \n \/\/ constructor\n dummy_tast_t(const string_t& = string_t())\n : task_t(\"test task\")\n { \n }\n \n \/\/ create samples\n void resize(size_t samples)\n {\n m_images.clear();\n m_samples.clear();\n \n for (size_t i = 0; i < samples; i ++)\n { \n sample_t sample(m_images.size(), sample_region(0, 0));\n sample.m_label = \"label\";\n sample.m_target = ncv::class_target(i % n_outputs(), n_outputs());\n sample.m_fold = { 0, protocol::train };\n m_samples.push_back(sample);\n\n image_t image(n_rows(), n_cols(), color());\n m_images.push_back(image);\n } \n } \n \n \/\/ load images from the given directory\n virtual bool load(const string_t&) { return true; }\n \n \/\/ access functions\n virtual size_t n_rows() const { return 28; }\n virtual size_t n_cols() const { return 28; }\n virtual size_t n_outputs() const { return 10; }\n virtual size_t n_folds() const { return 1; }\n virtual color_mode color() const { return color_mode::luma; }\n };\n}\n\nint main(int argc, char *argv[])\n{\n ncv::init();\n\n using namespace ncv;\n\n \/\/ parse the command line\n boost::program_options::options_description po_desc(\"\", 160);\n po_desc.add_options()(\"help,h\", \"test program\");\n po_desc.add_options()(\"threads,t\",\n boost::program_options::value()->default_value(1),\n \"number of threads to use [1, 16], 0 - use all available threads\");\n po_desc.add_options()(\"samples,s\",\n boost::program_options::value()->default_value(100000),\n \"number of samples to use [1000, 100000]\");\n po_desc.add_options()(\"forward\",\n \"evaluate the \\'forward\\' pass (output)\");\n po_desc.add_options()(\"backward\",\n \"evaluate the \\'backward' pass (gradient)\");\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_threads = math::clamp(po_vm[\"threads\"].as(), 0, 16);\n const size_t cmd_samples = math::clamp(po_vm[\"samples\"].as(), 1000, 100 * 1000);\n const bool cmd_forward = po_vm.count(\"forward\");\n const bool cmd_backward = po_vm.count(\"backward\");\n\n if (!cmd_forward && !cmd_backward)\n {\n std::cout << po_desc;\n return EXIT_FAILURE;\n }\n \n dummy_tast_t task;\n task.resize(cmd_samples * 100);\n\n const size_t cmd_outputs = task.n_outputs();\n\n const string_t lmodel0;\n const string_t lmodel1 = lmodel0 + \"linear:dims=128;act-snorm;\";\n const string_t lmodel2 = lmodel1 + \"linear:dims=64;act-snorm;\";\n const string_t lmodel3 = lmodel2 + \"linear:dims=32;act-snorm;\";\n const string_t lmodel4 = lmodel3 + \"linear:dims=16;act-snorm;\";\n const string_t lmodel5 = lmodel4 + \"linear:dims=8;act-snorm;\";\n \n string_t cmodel;\n cmodel = cmodel + \"conv:dims=16,rows=7,cols=7;act-snorm;pool-max;\";\n cmodel = cmodel + \"conv:dims=32,rows=5,cols=5;act-snorm;pool-max;\";\n cmodel = cmodel + \"conv:dims=64,rows=3,cols=3;act-snorm;\";\n \n const string_t outlayer = \"linear:dims=\" + text::to_string(cmd_outputs) + \";softmax:type=global;\";\n\n strings_t cmd_networks =\n {\n lmodel0 + outlayer,\n lmodel1 + outlayer,\n lmodel2 + outlayer,\n lmodel3 + outlayer,\n lmodel4 + outlayer,\n lmodel5 + outlayer,\n cmodel + outlayer\n };\n\n const rloss_t rloss = loss_manager_t::instance().get(\"class-ratio\");\n assert(rloss);\n const loss_t& loss = *rloss;\n\n for (const string_t& cmd_network : cmd_networks)\n {\n log_info() << \"<<< running network [\" << cmd_network << \"] ...\";\n\n \/\/ create feed-forward network\n forward_network_t model(cmd_network);\n model.resize(task, true);\n\n sampler_t sampler(task);\n sampler.setup(sampler_t::stype::uniform, cmd_samples).setup(sampler_t::atype::annotated);\n\n \/\/ process the samples\n if (cmd_forward)\n {\n accumulator_t ldata(model, cmd_threads, \"l2-reg\", criterion_t::type::value, 0.1);\n\n const ncv::timer_t timer;\n ldata.update(task, sampler.get(), loss);\n\n log_info() << \"<<< processed [\" << ldata.count() << \"] forward samples in \" << timer.elapsed() << \".\";\n }\n\n if (cmd_backward)\n {\n accumulator_t gdata(model, cmd_threads, \"l2-reg\", criterion_t::type::vgrad, 0.1);\n\n const ncv::timer_t timer;\n gdata.update(task, sampler.get(), loss);\n\n log_info() << \"<<< processed [\" << gdata.count() << \"] backward samples in \" << timer.elapsed() << \".\";\n }\n }\n\n \/\/ OK\n log_info() << done;\n return EXIT_SUCCESS;\n}\n<|endoftext|>"} {"text":"#include \"diff_system.h\"\n#include \"dof_map.h\"\n#include \"numeric_vector.h\"\n#include \"time_solver.h\"\n\n\n\nDifferentiableSystem::DifferentiableSystem\n (EquationSystems& es,\n const std::string& name,\n const unsigned int number) :\n Parent (es, name, number),\n compute_internal_sides(false),\n postprocess_sides(false),\n time_solver (NULL),\n time(0.),\n deltat(1.),\n print_solution_norms(false),\n print_residual_norms(false),\n print_residuals(false),\n print_jacobian_norms(false),\n print_jacobians(false),\n current_local_nonlinear_solution(NumericVector::build())\n{\n untested();\n}\n\n\n\nDifferentiableSystem::~DifferentiableSystem ()\n{\n}\n\n\n\nvoid DifferentiableSystem::reinit ()\n{\n Parent::reinit();\n\n \/\/ Resize the serial nonlinear solution for the current mesh\n current_local_nonlinear_solution->init (this->n_dofs());\n\n time_solver->reinit();\n}\n\n\n\nvoid DifferentiableSystem::init_data ()\n{\n \/\/ First, allocate a vector for the iterate in our quasi_Newton\n \/\/ solver\n\n \/\/ FIXME - there really ought to be a way to just use the System\n \/\/ solution vector if the solver doesn't need an extra vector!\n\n \/\/ We don't want to project more solutions than we have to\n\/\/ this->add_vector(\"_nonlinear_solution\", false);\n this->add_vector(\"_nonlinear_solution\");\n\/\/ this->project_solution_on_reinit() = false;\n\n \/\/ Next, give us flags for every variable that might be time\n \/\/ evolving\n _time_evolving.resize(this->n_vars(), false);\n\n \/\/ Do any initialization our solvers need\n assert (time_solver.get() != NULL);\n time_solver->init();\n\n \/\/ Next initialize ImplicitSystem data\n Parent::init_data();\n\n \/\/ Finally initialize solution\/residual\/jacobian data structures\n unsigned int n_vars = this->n_vars();\n\n dof_indices_var.resize(n_vars);\n\n elem_subsolutions.clear();\n elem_subsolutions.reserve(n_vars);\n elem_subresiduals.clear();\n elem_subresiduals.reserve(n_vars);\n elem_subjacobians.clear();\n elem_subjacobians.resize(n_vars);\n for (unsigned int i=0; i != n_vars; ++i)\n {\n elem_subsolutions.push_back(new DenseSubVector(elem_solution));\n elem_subresiduals.push_back(new DenseSubVector(elem_residual));\n elem_subjacobians[i].clear();\n elem_subjacobians[i].reserve(n_vars);\n\n for (unsigned int j=0; j != n_vars; ++j)\n {\n elem_subjacobians[i].push_back\n (new DenseSubMatrix(elem_jacobian));\n }\n }\n\n \/\/ Resize the serial nonlinear solution for the current mesh\n current_local_nonlinear_solution->init (this->n_dofs());\n}\n\n\n\nvoid DifferentiableSystem::assemble ()\n{\n this->assembly(true, true);\n}\n\n\n\nvoid DifferentiableSystem::solve ()\n{\n time_solver->solve();\n}\n\n\nNumber DifferentiableSystem::current_nonlinear_solution (const unsigned int global_dof_number) const\n{\n \/\/ Check the sizes\n assert (global_dof_number < this->get_dof_map().n_dofs());\n assert (global_dof_number < current_local_nonlinear_solution->size());\n\n return (*current_local_nonlinear_solution)(global_dof_number);\n}\nMake sure print_solutions is initialized to a sane default#include \"diff_system.h\"\n#include \"dof_map.h\"\n#include \"numeric_vector.h\"\n#include \"time_solver.h\"\n\n\n\nDifferentiableSystem::DifferentiableSystem\n (EquationSystems& es,\n const std::string& name,\n const unsigned int number) :\n Parent (es, name, number),\n compute_internal_sides(false),\n postprocess_sides(false),\n time_solver (NULL),\n time(0.),\n deltat(1.),\n print_solution_norms(false),\n print_solutions(false),\n print_residual_norms(false),\n print_residuals(false),\n print_jacobian_norms(false),\n print_jacobians(false),\n current_local_nonlinear_solution(NumericVector::build())\n{\n untested();\n}\n\n\n\nDifferentiableSystem::~DifferentiableSystem ()\n{\n}\n\n\n\nvoid DifferentiableSystem::reinit ()\n{\n Parent::reinit();\n\n \/\/ Resize the serial nonlinear solution for the current mesh\n current_local_nonlinear_solution->init (this->n_dofs());\n\n time_solver->reinit();\n}\n\n\n\nvoid DifferentiableSystem::init_data ()\n{\n \/\/ First, allocate a vector for the iterate in our quasi_Newton\n \/\/ solver\n\n \/\/ FIXME - there really ought to be a way to just use the System\n \/\/ solution vector if the solver doesn't need an extra vector!\n\n \/\/ We don't want to project more solutions than we have to\n\/\/ this->add_vector(\"_nonlinear_solution\", false);\n this->add_vector(\"_nonlinear_solution\");\n\/\/ this->project_solution_on_reinit() = false;\n\n \/\/ Next, give us flags for every variable that might be time\n \/\/ evolving\n _time_evolving.resize(this->n_vars(), false);\n\n \/\/ Do any initialization our solvers need\n assert (time_solver.get() != NULL);\n time_solver->init();\n\n \/\/ Next initialize ImplicitSystem data\n Parent::init_data();\n\n \/\/ Finally initialize solution\/residual\/jacobian data structures\n unsigned int n_vars = this->n_vars();\n\n dof_indices_var.resize(n_vars);\n\n elem_subsolutions.clear();\n elem_subsolutions.reserve(n_vars);\n elem_subresiduals.clear();\n elem_subresiduals.reserve(n_vars);\n elem_subjacobians.clear();\n elem_subjacobians.resize(n_vars);\n for (unsigned int i=0; i != n_vars; ++i)\n {\n elem_subsolutions.push_back(new DenseSubVector(elem_solution));\n elem_subresiduals.push_back(new DenseSubVector(elem_residual));\n elem_subjacobians[i].clear();\n elem_subjacobians[i].reserve(n_vars);\n\n for (unsigned int j=0; j != n_vars; ++j)\n {\n elem_subjacobians[i].push_back\n (new DenseSubMatrix(elem_jacobian));\n }\n }\n\n \/\/ Resize the serial nonlinear solution for the current mesh\n current_local_nonlinear_solution->init (this->n_dofs());\n}\n\n\n\nvoid DifferentiableSystem::assemble ()\n{\n this->assembly(true, true);\n}\n\n\n\nvoid DifferentiableSystem::solve ()\n{\n time_solver->solve();\n}\n\n\nNumber DifferentiableSystem::current_nonlinear_solution (const unsigned int global_dof_number) const\n{\n \/\/ Check the sizes\n assert (global_dof_number < this->get_dof_map().n_dofs());\n assert (global_dof_number < current_local_nonlinear_solution->size());\n\n return (*current_local_nonlinear_solution)(global_dof_number);\n}\n<|endoftext|>"} {"text":"\/\/ Source : https:\/\/oj.leetcode.com\/problems\/3sum\/\n\/\/ Author : Hao Chen\n\/\/ Date : 2014-07-22\n\n\/********************************************************************************** \n* \n* Given an array S of n integers, are there elements a, b, c in S such that a + b + c = 0? \n* Find all unique triplets in the array which gives the sum of zero.\n* \n* Note:\n* \n* Elements in a triplet (a,b,c) must be in non-descending order. (ie, a ≤ b ≤ c)\n* The solution set must not contain duplicate triplets.\n* \n* For example, given array S = {-1 0 1 2 -1 -4},\n* \n* A solution set is:\n* (-1, 0, 1)\n* (-1, -1, 2)\n* \n* \n**********************************************************************************\/\n\n#include \n#include \n#include \n#include \n#include \nusing namespace std;\n\n\n\/*\n * Simlar like \"Two Number\" problem, we can have the simlar solution.\n *\n * Suppose the input array is S[0..n-1], 3SUM can be solved in O(n^2) time on average by \n * inserting each number S[i] into a hash table, and then for each index i and j, \n * checking whether the hash table contains the integer - (s[i]+s[j])\n *\n * Alternatively, the algorithm below first sorts the input array and then tests all \n * possible pairs in a careful order that avoids the need to binary search for the pairs \n * in the sorted list, achieving worst-case O(n^n)\n *\n * Solution: Quadratic algorithm\n * http:\/\/en.wikipedia.org\/wiki\/3SUM\n *\n *\/\nvector > threeSum(vector &num) {\n\n vector< vector > result;\n\n \/\/sort the array, this is the key\n sort(num.begin(), num.end());\n\n int n = num.size();\n\n for (int i=0; i0 && num[i-1]==num[i]) continue;\n int a = num[i];\n int low = i+1;\n int high = n-1;\n while ( low < high ) {\n int b = num[low];\n int c = num[high];\n if (a+b+c == 0) {\n \/\/got the soultion\n vector v;\n v.push_back(a);\n v.push_back(b);\n v.push_back(c);\n result.push_back(v);\n \/\/ Continue search for all triplet combinations summing to zero.\n \/\/skip the duplication\n while(low0 && num[high]==num[high-1]) high--; \n low++;\n high--;\n } else if (a+b+c > 0) {\n \/\/skip the duplication\n while(high>0 && num[high]==num[high-1]) high--;\n high--;\n } else{\n \/\/skip the duplication\n while(low> error\nvector > combination(vector &v, int k);\nbool isSumZero(vector& v);\nint sum(vector& v);\n\nvector > threeSum2(vector &num) {\n vector< vector > result;\n vector< vector > r = combination(num, 3);\n for (int i=0; i& v){\n return sum(v)==0;\n}\n\nint sum(vector& v){\n int s=0;\n for(int i=0; i > combination(vector &v, int k) {\n\n vector > result;\n vector d;\n int n = v.size();\n for (int i=0; i tmp;\n for(int x=0; x 0 ) ? 1 : 0;\n ones--;\n }\n break;\n }\n if (d[i]==1) ones++;\n }\n if (!found){\n break;\n }\n\n }\n return result;\n}\n\n\nvoid printMatrix(vector > &matrix)\n{\n for(int i=0; i n(a, a+sizeof(a)\/sizeof(int));\n vector< vector > result = threeSum(n);\n printMatrix(result); \n return 0;\n}\narray index out of bounds, fix to low\/\/ Source : https:\/\/oj.leetcode.com\/problems\/3sum\/\n\/\/ Author : Hao Chen\n\/\/ Date : 2014-07-22\n\n\/********************************************************************************** \n* \n* Given an array S of n integers, are there elements a, b, c in S such that a + b + c = 0? \n* Find all unique triplets in the array which gives the sum of zero.\n* \n* Note:\n* \n* Elements in a triplet (a,b,c) must be in non-descending order. (ie, a ≤ b ≤ c)\n* The solution set must not contain duplicate triplets.\n* \n* For example, given array S = {-1 0 1 2 -1 -4},\n* \n* A solution set is:\n* (-1, 0, 1)\n* (-1, -1, 2)\n* \n* \n**********************************************************************************\/\n\n#include \n#include \n#include \n#include \n#include \nusing namespace std;\n\n\n\/*\n * Simlar like \"Two Number\" problem, we can have the simlar solution.\n *\n * Suppose the input array is S[0..n-1], 3SUM can be solved in O(n^2) time on average by \n * inserting each number S[i] into a hash table, and then for each index i and j, \n * checking whether the hash table contains the integer - (s[i]+s[j])\n *\n * Alternatively, the algorithm below first sorts the input array and then tests all \n * possible pairs in a careful order that avoids the need to binary search for the pairs \n * in the sorted list, achieving worst-case O(n^n)\n *\n * Solution: Quadratic algorithm\n * http:\/\/en.wikipedia.org\/wiki\/3SUM\n *\n *\/\nvector > threeSum(vector &num) {\n\n vector< vector > result;\n\n \/\/sort the array, this is the key\n sort(num.begin(), num.end());\n\n int n = num.size();\n\n for (int i=0; i0 && num[i-1]==num[i]) continue;\n int a = num[i];\n int low = i+1;\n int high = n-1;\n while ( low < high ) {\n int b = num[low];\n int c = num[high];\n if (a+b+c == 0) {\n \/\/got the soultion\n vector v;\n v.push_back(a);\n v.push_back(b);\n v.push_back(c);\n result.push_back(v);\n \/\/ Continue search for all triplet combinations summing to zero.\n \/\/skip the duplication\n while(low0 && num[high]==num[high-1]) high--; \n low++;\n high--;\n } else if (a+b+c > 0) {\n \/\/skip the duplication\n while(high>0 && num[high]==num[high-1]) high--;\n high--;\n } else{\n \/\/skip the duplication\n while(low> error\nvector > combination(vector &v, int k);\nbool isSumZero(vector& v);\nint sum(vector& v);\n\nvector > threeSum2(vector &num) {\n vector< vector > result;\n vector< vector > r = combination(num, 3);\n for (int i=0; i& v){\n return sum(v)==0;\n}\n\nint sum(vector& v){\n int s=0;\n for(int i=0; i > combination(vector &v, int k) {\n\n vector > result;\n vector d;\n int n = v.size();\n for (int i=0; i tmp;\n for(int x=0; x 0 ) ? 1 : 0;\n ones--;\n }\n break;\n }\n if (d[i]==1) ones++;\n }\n if (!found){\n break;\n }\n\n }\n return result;\n}\n\n\nvoid printMatrix(vector > &matrix)\n{\n for(int i=0; i n(a, a+sizeof(a)\/sizeof(int));\n vector< vector > result = threeSum(n);\n printMatrix(result); \n return 0;\n}\n<|endoftext|>"} {"text":"\/\/ Copyright 2018 The Bazel Authors. All rights reserved.\n\/\/\n\/\/ Licensed under the Apache License, Version 2.0 (the \"License\");\n\/\/ you may not use this file except in compliance with the License.\n\/\/ You may obtain a copy of the License at\n\/\/\n\/\/ http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n\/\/\n\/\/ Unless required by applicable law or agreed to in writing, software\n\/\/ distributed under the License is distributed on an \"AS IS\" BASIS,\n\/\/ WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n\/\/ See the License for the specific language governing permissions and\n\/\/ limitations under the License.\n#include \"src\/test\/cpp\/test_util.h\"\n\n#include \"src\/main\/cpp\/startup_options.h\"\n#include \"googletest\/include\/gtest\/gtest.h\"\n\nnamespace blaze {\n\nvoid ExpectIsNullaryOption(const StartupOptions* options,\n const std::string& flag_name) {\n EXPECT_TRUE(options->IsNullary(\"--\" + flag_name));\n EXPECT_TRUE(options->IsNullary(\"--no\" + flag_name));\n\n EXPECT_FALSE(options->IsNullary(\"--\" + flag_name + \"__invalid\"));\n\n EXPECT_DEATH(options->IsNullary(\"--\" + flag_name + \"=foo\"),\n (\"In argument '--\" + flag_name + \"=foo': option '--\" +\n flag_name + \"' does not take a value\")\n .c_str());\n\n EXPECT_DEATH(options->IsNullary(\"--no\" + flag_name + \"=foo\"),\n (\"In argument '--no\" + flag_name + \"=foo': option '--no\" +\n flag_name + \"' does not take a value\")\n .c_str());\n\n EXPECT_FALSE(options->IsUnary(\"--\" + flag_name));\n EXPECT_FALSE(options->IsUnary(\"--no\" + flag_name));\n}\n\nvoid ExpectIsUnaryOption(const StartupOptions* options,\n const std::string& flag_name) {\n EXPECT_TRUE(options->IsUnary(\"--\" + flag_name));\n EXPECT_TRUE(options->IsUnary(\"--\" + flag_name + \"=\"));\n EXPECT_TRUE(options->IsUnary(\"--\" + flag_name + \"=foo\"));\n\n EXPECT_FALSE(options->IsUnary(\"--\" + flag_name + \"__invalid\"));\n EXPECT_FALSE(options->IsNullary(\"--\" + flag_name));\n EXPECT_FALSE(options->IsNullary(\"--no\" + flag_name));\n}\n\nvoid ParseStartupOptionsAndExpectWarning(\n StartupOptions* startup_options,\n const std::vector& options_to_parse,\n const std::string& expected_warning) {\n std::vector flags;\n for (std::string option : options_to_parse) {\n flags.push_back(RcStartupFlag(\"\", option));\n }\n\n std::string error;\n EXPECT_EQ(blaze_exit_code::SUCCESS,\n startup_options->ProcessArgs(flags, &error));\n ASSERT_EQ(\"\", error);\n\n testing::internal::CaptureStderr();\n startup_options->MaybeLogStartupOptionWarnings();\n const std::string& output = testing::internal::GetCapturedStderr();\n\n EXPECT_EQ(expected_warning, output);\n}\n\n} \/\/ namespace blaze\nAutomatic ClangTidyPerformance code cleanup.\/\/ Copyright 2018 The Bazel Authors. All rights reserved.\n\/\/\n\/\/ Licensed under the Apache License, Version 2.0 (the \"License\");\n\/\/ you may not use this file except in compliance with the License.\n\/\/ You may obtain a copy of the License at\n\/\/\n\/\/ http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n\/\/\n\/\/ Unless required by applicable law or agreed to in writing, software\n\/\/ distributed under the License is distributed on an \"AS IS\" BASIS,\n\/\/ WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n\/\/ See the License for the specific language governing permissions and\n\/\/ limitations under the License.\n#include \"src\/test\/cpp\/test_util.h\"\n\n#include \"src\/main\/cpp\/startup_options.h\"\n#include \"googletest\/include\/gtest\/gtest.h\"\n\nnamespace blaze {\n\nvoid ExpectIsNullaryOption(const StartupOptions* options,\n const std::string& flag_name) {\n EXPECT_TRUE(options->IsNullary(\"--\" + flag_name));\n EXPECT_TRUE(options->IsNullary(\"--no\" + flag_name));\n\n EXPECT_FALSE(options->IsNullary(\"--\" + flag_name + \"__invalid\"));\n\n EXPECT_DEATH(options->IsNullary(\"--\" + flag_name + \"=foo\"),\n (\"In argument '--\" + flag_name + \"=foo': option '--\" +\n flag_name + \"' does not take a value\")\n .c_str());\n\n EXPECT_DEATH(options->IsNullary(\"--no\" + flag_name + \"=foo\"),\n (\"In argument '--no\" + flag_name + \"=foo': option '--no\" +\n flag_name + \"' does not take a value\")\n .c_str());\n\n EXPECT_FALSE(options->IsUnary(\"--\" + flag_name));\n EXPECT_FALSE(options->IsUnary(\"--no\" + flag_name));\n}\n\nvoid ExpectIsUnaryOption(const StartupOptions* options,\n const std::string& flag_name) {\n EXPECT_TRUE(options->IsUnary(\"--\" + flag_name));\n EXPECT_TRUE(options->IsUnary(\"--\" + flag_name + \"=\"));\n EXPECT_TRUE(options->IsUnary(\"--\" + flag_name + \"=foo\"));\n\n EXPECT_FALSE(options->IsUnary(\"--\" + flag_name + \"__invalid\"));\n EXPECT_FALSE(options->IsNullary(\"--\" + flag_name));\n EXPECT_FALSE(options->IsNullary(\"--no\" + flag_name));\n}\n\nvoid ParseStartupOptionsAndExpectWarning(\n StartupOptions* startup_options,\n const std::vector& options_to_parse,\n const std::string& expected_warning) {\n std::vector flags;\n flags.reserve(options_to_parse.size());\n for (const std::string& option : options_to_parse) {\n flags.push_back(RcStartupFlag(\"\", option));\n }\n\n std::string error;\n EXPECT_EQ(blaze_exit_code::SUCCESS,\n startup_options->ProcessArgs(flags, &error));\n ASSERT_EQ(\"\", error);\n\n testing::internal::CaptureStderr();\n startup_options->MaybeLogStartupOptionWarnings();\n const std::string& output = testing::internal::GetCapturedStderr();\n\n EXPECT_EQ(expected_warning, output);\n}\n\n} \/\/ namespace blaze\n<|endoftext|>"} {"text":"\/*\n * The MIT License (MIT)\n *\n * Copyright (c) <2015> \n *\n * Permission is hereby granted, free of charge, to any person obtaining\n * a copy of this software and associated documentation files (the\n * \"Software\"), to deal in the Software without restriction, including\n * without limitation the rights to use, copy, modify, merge, publish,\n * distribute, sublicense, and\/or sell copies of the Software, and to\n * permit persons to whom the Software is furnished to do so, subject to\n * the following conditions:\n *\n * The above copyright notice and this permission notice shall be\n * included in all copies or substantial portions of the Software.\n *\n * THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND,\n * EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF\n * MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND\n * NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS\n * BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN\n * ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN\n * CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE\n * SOFTWARE.\n *\/\n\n#define BOOST_TEST_DYN_LINK\n#define BOOST_TEST_MAIN\n#define BOOST_TEST_MODULE method\n\n#include \n\n#include \"json\/cJSON.h\"\n#include \"peer.h\"\n#include \"router.h\"\n#include \"state.h\"\n#include \"table.h\"\n\nstatic const char *method_no_args_path = \"\/method_no_args\/\";\n\nstatic const int INVALID_PARAMS_ERROR = -32602;\n\nextern \"C\" {\n\tint send_message(struct peer *p, const char *rendered, size_t len)\n\t{\n\t\t(void)p;\n\t\t(void)rendered;\n\t\t(void)len;\n\t\treturn 0;\n\t}\n\n\tint add_io(struct peer *p)\n\t{\n\t\t(void)p;\n\t\treturn 0;\n\t}\n\n\tvoid remove_io(const struct peer *p)\n\t{\n\t\t(void)p;\n\t\treturn;\n\t}\n}\n\nstruct F {\n\tF()\n\t{\n\t\tstate_hashtable_create();\n\t\towner_peer = alloc_peer(-1);\n\t\tcall_peer = alloc_peer(-1);\n\t}\n\t~F()\n\t{\n\t\tfree_peer(call_peer);\n\t\tfree_peer(owner_peer);\n\t\tstate_hashtable_delete();\n\t}\n\n\tstruct peer *owner_peer;\n\tstruct peer *call_peer;\n};\n\nstatic cJSON *create_call_json_rpc(const char *path_string)\n{\n\tcJSON *root = cJSON_CreateObject();\n\tBOOST_REQUIRE(root != NULL);\n\tcJSON_AddStringToObject(root, \"method\", \"call\");\n\tcJSON_AddStringToObject(root, \"id\", \"id_1\");\n\tcJSON *params = cJSON_CreateObject();\n\tBOOST_REQUIRE(params != NULL);\n\tcJSON_AddItemToObject(root, \"params\", params);\n\tcJSON_AddStringToObject(params, \"path\", path_string);\n\n\treturn root;\n}\n\nstatic cJSON *create_call_json_rpc_wrong_id_type(const char *path_string)\n{\n\tcJSON *root = cJSON_CreateObject();\n\tBOOST_REQUIRE(root != NULL);\n\tcJSON_AddStringToObject(root, \"method\", \"call\");\n\tcJSON_AddTrueToObject(root, \"id\");\n\tcJSON *params = cJSON_CreateObject();\n\tBOOST_REQUIRE(params != NULL);\n\tcJSON_AddItemToObject(root, \"params\", params);\n\tcJSON_AddStringToObject(params, \"path\", path_string);\n\n\treturn root;\n}\n\nstatic void check_invalid_params(const cJSON *error)\n{\n\tcJSON *code = cJSON_GetObjectItem(error, \"code\");\n\tif (code != NULL) {\n\t\tBOOST_CHECK(code->type == cJSON_Number);\n\t\tBOOST_CHECK(code->valueint == INVALID_PARAMS_ERROR);\n\t} else {\n\t\tBOOST_FAIL(\"No code object!\");\n\t}\n\n\tcJSON *message = cJSON_GetObjectItem(error, \"message\");\n\tif (message != NULL) {\n\t\tBOOST_CHECK(message->type == cJSON_String);\n\t\tBOOST_CHECK(strcmp(message->valuestring, \"Invalid params\") == 0);\n\t} else {\n\t\tBOOST_FAIL(\"No message object!\");\n\t}\n}\n\nBOOST_FIXTURE_TEST_CASE(delete_nonexisting_state, F)\n{\n\tconst char path[] = \"\/foo\/bar\/\";\n\tint ret = remove_state_or_method_from_peer(owner_peer, path);\n\tBOOST_CHECK(ret == -1);\n}\n\nBOOST_FIXTURE_TEST_CASE(call_wrong_path, F)\n{\n\n\tcJSON *error = add_state_or_method_to_peer(owner_peer, \"\/foo\/bar\", NULL);\n\tBOOST_CHECK(error == NULL);\n\n\tcJSON *call_json_rpc = create_call_json_rpc(method_no_args_path);\n\terror = set_or_call(owner_peer, \"\/bar\/foo\", NULL, call_json_rpc, METHOD);\n\tcJSON_Delete(call_json_rpc);\n\n\tif (error != NULL) {\n\t\tcheck_invalid_params(error);\n\t\tcJSON_Delete(error);\n\t} else {\n\t\tBOOST_FAIL(\"expected to get an error!\");\n\t}\n}\n\nBOOST_FIXTURE_TEST_CASE(add_method_twice, F)\n{\n\tconst char path[] = \"\/foo\/bar\";\n\n\tcJSON *error = add_state_or_method_to_peer(owner_peer, path, NULL);\n\tBOOST_CHECK(error == NULL);\n\n\terror = add_state_or_method_to_peer(owner_peer, path, NULL);\n\tBOOST_REQUIRE(error != NULL);\n\tcheck_invalid_params(error);\n\tcJSON_Delete(error);\n}\n\nBOOST_FIXTURE_TEST_CASE(add_method_existing_state, F)\n{\n\tconst char path[] = \"\/foo\/bar\";\n\tint state_value = 12345;\n\n\tcJSON *value = cJSON_CreateNumber(state_value);\n\tcJSON *error = add_state_or_method_to_peer(owner_peer, path, value);\n\tBOOST_CHECK(error == NULL);\n\tcJSON_Delete(value);\n\n\terror = add_state_or_method_to_peer(owner_peer, path, NULL);\n\tBOOST_REQUIRE(error != NULL);\n\tcheck_invalid_params(error);\n\tcJSON_Delete(error);\n}\n\nBOOST_FIXTURE_TEST_CASE(call_on_state, F)\n{\n\tconst char path[] = \"\/foo\/bar\";\n\tint state_value = 12345;\n\n\tcJSON *value = cJSON_CreateNumber(state_value);\n\tcJSON *error = add_state_or_method_to_peer(owner_peer, path, value);\n\tBOOST_CHECK(error == NULL);\n\tcJSON_Delete(value);\n\n\tcJSON *call_json_rpc = create_call_json_rpc(method_no_args_path);\n\terror = set_or_call(call_peer, path, NULL, call_json_rpc, METHOD);\n\tcJSON_Delete(call_json_rpc);\n\n\tif (error != NULL) {\n\t\tcheck_invalid_params(error);\n\t\tcJSON_Delete(error);\n\t} else {\n\t\tBOOST_FAIL(\"expected to get an error!\");\n\t}\n}\n\nBOOST_FIXTURE_TEST_CASE(double_free_method, F)\n{\n\tconst char path[] = \"\/foo\/bar\";\n\tcJSON *error = add_state_or_method_to_peer(owner_peer, path, NULL);\n\tBOOST_CHECK(error == NULL);\n\n\tint ret = remove_state_or_method_from_peer(owner_peer, path);\n\tBOOST_CHECK(ret == 0);\n\n\tret = remove_state_or_method_from_peer(owner_peer, path);\n\tBOOST_CHECK(ret == -1);\n}\n\n\nBOOST_FIXTURE_TEST_CASE(call_not_by_owner, F)\n{\n\tcJSON *error = add_state_or_method_to_peer(owner_peer, method_no_args_path, NULL);\n\tBOOST_CHECK(error == NULL);\n\n\tcJSON *call_json_rpc = create_call_json_rpc(method_no_args_path);\n\terror = set_or_call(owner_peer, method_no_args_path, NULL, call_json_rpc, METHOD);\n\tcJSON_Delete(call_json_rpc);\n\tif (error != NULL) {\n\t\tcheck_invalid_params(error);\n\t\tcJSON_Delete(error);\n\t} else {\n\t\tBOOST_FAIL(\"expected to get an error!\");\n\t}\n}\n\nBOOST_FIXTURE_TEST_CASE(set_wrong_id_type, F)\n{\n\tcJSON *error = add_state_or_method_to_peer(owner_peer, method_no_args_path, NULL);\n\tBOOST_CHECK(error == NULL);\n\n\tcJSON *call_json_rpc = create_call_json_rpc_wrong_id_type(method_no_args_path);\n\terror = set_or_call(call_peer, method_no_args_path, NULL, call_json_rpc, METHOD);\n\tcJSON_Delete(call_json_rpc);\n\n\tif ((error != NULL) && (error != (cJSON *)ROUTED_MESSAGE)) {\n\t\tcheck_invalid_params(error);\n\t\tcJSON_Delete(error);\n\t} else {\n\t\tBOOST_FAIL(\"expected to get an error!\");\n\t}\n}\nAdd test for correct method call.\/*\n * The MIT License (MIT)\n *\n * Copyright (c) <2015> \n *\n * Permission is hereby granted, free of charge, to any person obtaining\n * a copy of this software and associated documentation files (the\n * \"Software\"), to deal in the Software without restriction, including\n * without limitation the rights to use, copy, modify, merge, publish,\n * distribute, sublicense, and\/or sell copies of the Software, and to\n * permit persons to whom the Software is furnished to do so, subject to\n * the following conditions:\n *\n * The above copyright notice and this permission notice shall be\n * included in all copies or substantial portions of the Software.\n *\n * THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND,\n * EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF\n * MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND\n * NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS\n * BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN\n * ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN\n * CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE\n * SOFTWARE.\n *\/\n\n#define BOOST_TEST_DYN_LINK\n#define BOOST_TEST_MAIN\n#define BOOST_TEST_MODULE method\n\n#include \n\n#include \"json\/cJSON.h\"\n#include \"peer.h\"\n#include \"router.h\"\n#include \"state.h\"\n#include \"table.h\"\n\nstatic const char *method_no_args_path = \"\/method_no_args\/\";\n\nstatic const int INVALID_PARAMS_ERROR = -32602;\n\nextern \"C\" {\n\tint send_message(struct peer *p, const char *rendered, size_t len)\n\t{\n\t\t(void)p;\n\t\t(void)rendered;\n\t\t(void)len;\n\t\treturn 0;\n\t}\n\n\tint add_io(struct peer *p)\n\t{\n\t\t(void)p;\n\t\treturn 0;\n\t}\n\n\tvoid remove_io(const struct peer *p)\n\t{\n\t\t(void)p;\n\t\treturn;\n\t}\n}\n\nstruct F {\n\tF()\n\t{\n\t\tstate_hashtable_create();\n\t\towner_peer = alloc_peer(-1);\n\t\tcall_peer = alloc_peer(-1);\n\t}\n\t~F()\n\t{\n\t\tfree_peer(call_peer);\n\t\tfree_peer(owner_peer);\n\t\tstate_hashtable_delete();\n\t}\n\n\tstruct peer *owner_peer;\n\tstruct peer *call_peer;\n};\n\nstatic cJSON *create_call_json_rpc(const char *path_string)\n{\n\tcJSON *root = cJSON_CreateObject();\n\tBOOST_REQUIRE(root != NULL);\n\tcJSON_AddStringToObject(root, \"method\", \"call\");\n\tcJSON_AddStringToObject(root, \"id\", \"id_1\");\n\tcJSON *params = cJSON_CreateObject();\n\tBOOST_REQUIRE(params != NULL);\n\tcJSON_AddItemToObject(root, \"params\", params);\n\tcJSON_AddStringToObject(params, \"path\", path_string);\n\n\treturn root;\n}\n\nstatic cJSON *create_call_json_rpc_wrong_id_type(const char *path_string)\n{\n\tcJSON *root = cJSON_CreateObject();\n\tBOOST_REQUIRE(root != NULL);\n\tcJSON_AddStringToObject(root, \"method\", \"call\");\n\tcJSON_AddTrueToObject(root, \"id\");\n\tcJSON *params = cJSON_CreateObject();\n\tBOOST_REQUIRE(params != NULL);\n\tcJSON_AddItemToObject(root, \"params\", params);\n\tcJSON_AddStringToObject(params, \"path\", path_string);\n\n\treturn root;\n}\n\nstatic void check_invalid_params(const cJSON *error)\n{\n\tcJSON *code = cJSON_GetObjectItem(error, \"code\");\n\tif (code != NULL) {\n\t\tBOOST_CHECK(code->type == cJSON_Number);\n\t\tBOOST_CHECK(code->valueint == INVALID_PARAMS_ERROR);\n\t} else {\n\t\tBOOST_FAIL(\"No code object!\");\n\t}\n\n\tcJSON *message = cJSON_GetObjectItem(error, \"message\");\n\tif (message != NULL) {\n\t\tBOOST_CHECK(message->type == cJSON_String);\n\t\tBOOST_CHECK(strcmp(message->valuestring, \"Invalid params\") == 0);\n\t} else {\n\t\tBOOST_FAIL(\"No message object!\");\n\t}\n}\n\nBOOST_FIXTURE_TEST_CASE(delete_nonexisting_state, F)\n{\n\tconst char path[] = \"\/foo\/bar\/\";\n\tint ret = remove_state_or_method_from_peer(owner_peer, path);\n\tBOOST_CHECK(ret == -1);\n}\n\nBOOST_FIXTURE_TEST_CASE(call_wrong_path, F)\n{\n\n\tcJSON *error = add_state_or_method_to_peer(owner_peer, \"\/foo\/bar\", NULL);\n\tBOOST_CHECK(error == NULL);\n\n\tcJSON *call_json_rpc = create_call_json_rpc(method_no_args_path);\n\terror = set_or_call(owner_peer, \"\/bar\/foo\", NULL, call_json_rpc, METHOD);\n\tcJSON_Delete(call_json_rpc);\n\n\tif (error != NULL) {\n\t\tcheck_invalid_params(error);\n\t\tcJSON_Delete(error);\n\t} else {\n\t\tBOOST_FAIL(\"expected to get an error!\");\n\t}\n}\n\nBOOST_FIXTURE_TEST_CASE(add_method_twice, F)\n{\n\tconst char path[] = \"\/foo\/bar\";\n\n\tcJSON *error = add_state_or_method_to_peer(owner_peer, path, NULL);\n\tBOOST_CHECK(error == NULL);\n\n\terror = add_state_or_method_to_peer(owner_peer, path, NULL);\n\tBOOST_REQUIRE(error != NULL);\n\tcheck_invalid_params(error);\n\tcJSON_Delete(error);\n}\n\nBOOST_FIXTURE_TEST_CASE(add_method_existing_state, F)\n{\n\tconst char path[] = \"\/foo\/bar\";\n\tint state_value = 12345;\n\n\tcJSON *value = cJSON_CreateNumber(state_value);\n\tcJSON *error = add_state_or_method_to_peer(owner_peer, path, value);\n\tBOOST_CHECK(error == NULL);\n\tcJSON_Delete(value);\n\n\terror = add_state_or_method_to_peer(owner_peer, path, NULL);\n\tBOOST_REQUIRE(error != NULL);\n\tcheck_invalid_params(error);\n\tcJSON_Delete(error);\n}\n\nBOOST_FIXTURE_TEST_CASE(call_on_state, F)\n{\n\tconst char path[] = \"\/foo\/bar\";\n\tint state_value = 12345;\n\n\tcJSON *value = cJSON_CreateNumber(state_value);\n\tcJSON *error = add_state_or_method_to_peer(owner_peer, path, value);\n\tBOOST_CHECK(error == NULL);\n\tcJSON_Delete(value);\n\n\tcJSON *call_json_rpc = create_call_json_rpc(method_no_args_path);\n\terror = set_or_call(call_peer, path, NULL, call_json_rpc, METHOD);\n\tcJSON_Delete(call_json_rpc);\n\n\tif (error != NULL) {\n\t\tcheck_invalid_params(error);\n\t\tcJSON_Delete(error);\n\t} else {\n\t\tBOOST_FAIL(\"expected to get an error!\");\n\t}\n}\n\nBOOST_FIXTURE_TEST_CASE(double_free_method, F)\n{\n\tconst char path[] = \"\/foo\/bar\";\n\tcJSON *error = add_state_or_method_to_peer(owner_peer, path, NULL);\n\tBOOST_CHECK(error == NULL);\n\n\tint ret = remove_state_or_method_from_peer(owner_peer, path);\n\tBOOST_CHECK(ret == 0);\n\n\tret = remove_state_or_method_from_peer(owner_peer, path);\n\tBOOST_CHECK(ret == -1);\n}\n\n\nBOOST_FIXTURE_TEST_CASE(call_not_by_owner, F)\n{\n\tcJSON *error = add_state_or_method_to_peer(owner_peer, method_no_args_path, NULL);\n\tBOOST_CHECK(error == NULL);\n\n\tcJSON *call_json_rpc = create_call_json_rpc(method_no_args_path);\n\terror = set_or_call(owner_peer, method_no_args_path, NULL, call_json_rpc, METHOD);\n\tcJSON_Delete(call_json_rpc);\n\tif (error != NULL) {\n\t\tcheck_invalid_params(error);\n\t\tcJSON_Delete(error);\n\t} else {\n\t\tBOOST_FAIL(\"expected to get an error!\");\n\t}\n}\n\nBOOST_FIXTURE_TEST_CASE(correct_call, F)\n{\n\tcJSON *error = add_state_or_method_to_peer(owner_peer, method_no_args_path, NULL);\n\tBOOST_CHECK(error == NULL);\n\n\tcJSON *call_json_rpc = create_call_json_rpc(method_no_args_path);\n\terror = set_or_call(call_peer, method_no_args_path, NULL, call_json_rpc, METHOD);\n\tcJSON_Delete(call_json_rpc);\n\tBOOST_CHECK(error == (cJSON *)ROUTED_MESSAGE);\n}\n\nBOOST_FIXTURE_TEST_CASE(set_wrong_id_type, F)\n{\n\tcJSON *error = add_state_or_method_to_peer(owner_peer, method_no_args_path, NULL);\n\tBOOST_CHECK(error == NULL);\n\n\tcJSON *call_json_rpc = create_call_json_rpc_wrong_id_type(method_no_args_path);\n\terror = set_or_call(call_peer, method_no_args_path, NULL, call_json_rpc, METHOD);\n\tcJSON_Delete(call_json_rpc);\n\n\tif ((error != NULL) && (error != (cJSON *)ROUTED_MESSAGE)) {\n\t\tcheck_invalid_params(error);\n\t\tcJSON_Delete(error);\n\t} else {\n\t\tBOOST_FAIL(\"expected to get an error!\");\n\t}\n}\n<|endoftext|>"} {"text":"\/*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 \n\n#include \n#include \n#include \n#include \n#include \n#include \n#include \n\n#include \n\n#include \n#include \n#include \n#include \n#include \n#include \n\n#include \n#include \n#include \n#include \n\n#include \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 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();\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(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(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::name_t const name = proc->name();\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(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 const& flags = options.flags;\n boost::optional 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}\nOutput proper names configuration blocks\/*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 \n\n#include \n#include \n#include \n#include \n#include \n#include \n#include \n\n#include \n\n#include \n#include \n#include \n#include \n#include \n#include \n#include \n\n#include \n#include \n#include \n#include \n#include \n#include \n\n#include \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 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();\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\nstatic vistk::process::name_t denormalize_name(vistk::process::name_t const& name);\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 vistk::process::name_t const denorm_name = denormalize_name(key_path);\n\n output_process_by_name(denorm_name, false);\n}\n\nstatic vistk::process::name_t normalize_name(vistk::process::name_t const& name);\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(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(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::name_t const name = proc->name();\n vistk::process::type_t const type = proc->type();\n vistk::process::name_t const norm_name = normalize_name(name);\n\n m_ostr << \"# Defaults for \\'\" << name << \"\\' \" << kind << \":\" << std::endl;\n m_ostr << \"config \" << norm_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 vistk::process::name_t const norm_name = normalize_name(name);\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 = norm_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(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 const& flags = options.flags;\n boost::optional 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\nvistk::process::name_t\ndenormalize_name(vistk::process::name_t const& name)\n{\n vistk::process::name_t denorm_name;\n\n std::replace_copy_if(name.begin(), name.end(),\n std::back_inserter(denorm_name),\n boost::is_any_of(\":\"), '\/');\n\n return denorm_name;\n}\n\nvistk::process::name_t\nnormalize_name(vistk::process::name_t const& name)\n{\n vistk::process::name_t norm_name;\n\n std::replace_copy_if(name.begin(), name.end(),\n std::back_inserter(norm_name),\n boost::is_any_of(\"\/\"), ':');\n\n return norm_name;\n}\n<|endoftext|>"} {"text":"#include \n#include \n\n#include \n#include \n\nnamespace tr_hub_parser {\n\nTr_hub_parser::Tr_hub_parser() {\n\n \/\/ Get parameters\n ros::NodeHandle private_node_handle_(\"~\");\n private_node_handle_.param(\"portname\", portname_,\n std::string(\"\/dev\/ttyACM0\"));\n \/\/ Publishers\n range_publisher_ = nh_.advertise(\"tr_hub_parser\", 8);\n\n \/\/ Serial Port init\n serial_port_ = new SerialPort();\n if (!serial_port_->connect(portname_)) {\n ROS_ERROR(\"Could not open : %s \", portname_.c_str());\n ros::shutdown();\n return;\n }\n else {\n serial_data_callback_function_ =\n boost::bind(&Tr_hub_parser::serialDataCallback, this, _1);\n serial_port_->setSerialCallbackFunction(&serial_data_callback_function_);\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 \/\/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 \/\/ Initialize rangeArray\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(i));\n\n measure.ranges.push_back(range);\n }\n\n \/\/ This line is needed to start measurements on the hub\n setMode(ENABLE_CMD, 5);\n setMode(BINARY_MODE, 4);\n setMode(CROSSTALK_MODE, 4);\n setMode(RATE_700, 5);\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\n Tr_hub_parser::~Tr_hub_parser() {}\n\n uint8_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\n float 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\n void Tr_hub_parser::setMode(const char *c, int length) {\n serial_port_->sendChar(c, length);\n }\n\n void 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 void 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 == 0) {\n \/\/ Waiting for T\n input_buffer[buffer_ctr++] = single_character;\n return;\n }\n else if (single_character == 'H' && buffer_ctr == 1) {\n \/\/ Waiting for H after a T\n input_buffer[buffer_ctr++] = single_character;\n return;\n }\n\n if (buffer_ctr > 1 && buffer_ctr < RANGES_FRAME_LENGTH) {\n input_buffer[buffer_ctr++] = single_character;\n return;\n }\n\n if (buffer_ctr == RANGES_FRAME_LENGTH) {\n \/\/ end of feed, calculate\n input_buffer[buffer_ctr++] = single_character;\n int16_t crc = crc8(input_buffer, 19);\n\n if (crc == input_buffer[RANGE_CRC_POS]) {\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) || (float_range < 0)) { \/\/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 } else {\n ROS_DEBUG(\"[%s] crc missmatch\", ros::this_node::getName().c_str());\n }\n } else {\n ROS_DEBUG(\"[%s] : Buffer overflow, resetting buffer without \"\n \"evaluating data\",\n ros::this_node::getName().c_str());\n }\n\n \/\/ resetting buffer and ctr\n buffer_ctr = 0;\n bzero(&input_buffer, BUFFER_SIZE);\n }\n\n }\n\n int 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 }\nEnhance parsing method#include \n#include \n\n#include \n#include \n\nnamespace tr_hub_parser {\n\nTr_hub_parser::Tr_hub_parser() {\n\n \/\/ Get parameters\n ros::NodeHandle private_node_handle_(\"~\");\n private_node_handle_.param(\"portname\", portname_,\n std::string(\"\/dev\/ttyACM0\"));\n \/\/ Publishers\n range_publisher_ = nh_.advertise(\"tr_hub_parser\", 8);\n\n \/\/ Serial Port init\n serial_port_ = new SerialPort();\n if (!serial_port_->connect(portname_)) {\n ROS_ERROR(\"Could not open : %s \", portname_.c_str());\n ros::shutdown();\n return;\n }\n else {\n serial_data_callback_function_ =\n boost::bind(&Tr_hub_parser::serialDataCallback, this, _1);\n serial_port_->setSerialCallbackFunction(&serial_data_callback_function_);\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 \/\/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 \/\/ Initialize rangeArray\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(i));\n\n measure.ranges.push_back(range);\n }\n\n \/\/ This line is needed to start measurements on the hub\n setMode(ENABLE_CMD, 5);\n setMode(BINARY_MODE, 4);\n setMode(CROSSTALK_MODE, 4);\n setMode(RATE_700, 5);\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\n Tr_hub_parser::~Tr_hub_parser() {}\n\n uint8_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\n float 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\n void Tr_hub_parser::setMode(const char *c, int length) {\n serial_port_->sendChar(c, length);\n }\n\n void 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 void 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 ROS_DEBUG(\"Buffer of size %d : %s | current char : %c\", buffer_ctr, input_buffer, (char)single_character);\n\n if (single_character == 'T' && buffer_ctr == 0) {\n \/\/ Waiting for T\n input_buffer[buffer_ctr++] = single_character;\n return;\n }\n else if (single_character == 'H' && buffer_ctr == 1) {\n \/\/ Waiting for H after a T\n input_buffer[buffer_ctr++] = single_character;\n return;\n }\n\n \/\/ Gathering after-header range data\n if (buffer_ctr > 1 && buffer_ctr < RANGES_FRAME_LENGTH) {\n input_buffer[buffer_ctr++] = single_character;\n return;\n }\n else if (buffer_ctr == RANGES_FRAME_LENGTH) {\n \/\/Processing full range frame\n int16_t crc = crc8(input_buffer, 19);\n\n if (crc == input_buffer[RANGE_CRC_POS]) {\n ROS_DEBUG(\"Frame of size %d : %s \", buffer_ctr, 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) || (float_range < 0)) { \/\/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 } else {\n ROS_DEBUG(\"[%s] crc missmatch\", ros::this_node::getName().c_str());\n }\n } else if (buffer_ctr > RANGES_FRAME_LENGTH){\n ROS_DEBUG(\"[%s] : Buffer overflow, resetting buffer without \"\n \"evaluating data\",\n ros::this_node::getName().c_str());\n }\n \/\/ resetting buffer and ctr\n buffer_ctr = 0;\n bzero(&input_buffer, BUFFER_SIZE);\n\n \/\/ Appending current char to hook next frame\n input_buffer[buffer_ctr++] = single_character;\n }\n\n }\n\n int 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":"\/*\n* Copyright 2008 Free Software Foundation, Inc.\n*\n*\n* This software is distributed under the terms of the GNU Affero Public License.\n* See the COPYING file in the main directory for details.\n*\n* This use of this software may be subject to additional restrictions.\n* See the LEGAL file in the main directory for details.\n\n\tThis program is free software: you can redistribute it and\/or modify\n\tit under the terms of the GNU Affero General Public License as published by\n\tthe Free Software Foundation, either version 3 of the License, or\n\t(at your option) any later version.\n\n\tThis program is distributed in the hope that it will be useful,\n\tbut WITHOUT ANY WARRANTY; without even the implied warranty of\n\tMERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the\n\tGNU Affero General Public License for more details.\n\n\tYou should have received a copy of the GNU Affero General Public License\n\talong with this program. If not, see .\n\n*\/\n\n\n\n\n#include \"Sockets.h\"\n#include \"Threads.h\"\n#include \n#include \n#include \n#include \n\nstatic const int gNumToSend = 10;\n\nstatic void sigalarm_handler(int foo)\n{\n\tprintf(\"FAIL: test did not run successfully\\n\");\n\texit(EXIT_FAILURE);\n}\n\nvoid *testReaderIP(void *param)\n{\n\tUDPSocket *readSocket = (UDPSocket *)param;\n\treadSocket->nonblocking();\n\tint rc = 0;\n\twhile (rcread(buf, MAX_UDP_LENGTH);\n\t\tif (count>0) {\n\t\t\tCERR(\"read: \" << buf);\n\t\t\trc++;\n\t\t} else {\n\t\t\tsleep(2);\n\t\t}\n\t}\n\treturn NULL;\n}\n\nint main(int argc, char * argv[] )\n{\n int count;\n\n if (signal(SIGALRM, sigalarm_handler) == SIG_ERR) {\n perror(\"signal\");\n exit(EXIT_FAILURE);\n }\n\n \/* If the test takes longer than 2*gNumToSend seconds, abort it *\/\n alarm(2* gNumToSend);\n\n UDPSocket readSocket(\"127.0.0.1\", 0);\n UDPSocket socket1(\"127.0.0.1\", 0, \"localhost\", readSocket.port());\n\n CERR(\"socket1: \" << socket1.port() << \", readSocket: \" << readSocket.port());\n\n Thread readerThreadIP;\n readerThreadIP.start(testReaderIP, &readSocket);\n\n \/\/ give the readers time to open\n sleep(1);\n\n for (int i=0; itests: null-terminate buffer\/*\n* Copyright 2008 Free Software Foundation, Inc.\n*\n*\n* This software is distributed under the terms of the GNU Affero Public License.\n* See the COPYING file in the main directory for details.\n*\n* This use of this software may be subject to additional restrictions.\n* See the LEGAL file in the main directory for details.\n\n\tThis program is free software: you can redistribute it and\/or modify\n\tit under the terms of the GNU Affero General Public License as published by\n\tthe Free Software Foundation, either version 3 of the License, or\n\t(at your option) any later version.\n\n\tThis program is distributed in the hope that it will be useful,\n\tbut WITHOUT ANY WARRANTY; without even the implied warranty of\n\tMERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the\n\tGNU Affero General Public License for more details.\n\n\tYou should have received a copy of the GNU Affero General Public License\n\talong with this program. If not, see .\n\n*\/\n\n\n\n\n#include \"Sockets.h\"\n#include \"Threads.h\"\n#include \n#include \n#include \n#include \n\nstatic const int gNumToSend = 10;\n\nstatic void sigalarm_handler(int foo)\n{\n\tprintf(\"FAIL: test did not run successfully\\n\");\n\texit(EXIT_FAILURE);\n}\n\nvoid *testReaderIP(void *param)\n{\n\tUDPSocket *readSocket = (UDPSocket *)param;\n\treadSocket->nonblocking();\n\tint rc = 0;\n\twhile (rcread(buf, MAX_UDP_LENGTH);\n\t\tif (count>0) {\n\t\t\tCERR(\"read: \" << buf);\n\t\t\trc++;\n\t\t} else {\n\t\t\tsleep(2);\n\t\t}\n\t}\n\treturn NULL;\n}\n\nint main(int argc, char * argv[] )\n{\n int count;\n\n if (signal(SIGALRM, sigalarm_handler) == SIG_ERR) {\n perror(\"signal\");\n exit(EXIT_FAILURE);\n }\n\n \/* If the test takes longer than 2*gNumToSend seconds, abort it *\/\n alarm(2* gNumToSend);\n\n UDPSocket readSocket(\"127.0.0.1\", 0);\n UDPSocket socket1(\"127.0.0.1\", 0, \"localhost\", readSocket.port());\n\n CERR(\"socket1: \" << socket1.port() << \", readSocket: \" << readSocket.port());\n\n Thread readerThreadIP;\n readerThreadIP.start(testReaderIP, &readSocket);\n\n \/\/ give the readers time to open\n sleep(1);\n\n for (int i=0; i"} {"text":"#include \n#include \n#include \n#include \n\n#include \n#include \n\n#include \n#include \nnamespace Ra {\nnamespace Testing {\n\nbool isSameMesh( Ra::Core::Geometry::TriangleMesh& meshOne,\n Ra::Core::Geometry::TriangleMesh& meshTwo ) {\n\n using Ra::Core::Vector3;\n using Ra::Core::Geometry::TopologicalMesh;\n using Ra::Core::Geometry::TriangleMesh;\n\n bool result = true;\n int i = 0;\n \/\/ Check length\n if ( meshOne.vertices().size() != meshTwo.vertices().size() )\n return false;\n if ( meshOne.normals().size() != meshTwo.normals().size() )\n return false;\n if ( meshOne.m_triangles.size() != meshTwo.m_triangles.size() )\n return false;\n\n \/\/ Check triangles\n std::vector stackVertices;\n std::vector stackNormals;\n\n i = 0;\n while ( result && i < meshOne.m_triangles.size() )\n {\n std::vector::iterator it;\n stackVertices.clear();\n stackVertices.push_back( meshOne.vertices()[meshOne.m_triangles[i][0]] );\n stackVertices.push_back( meshOne.vertices()[meshOne.m_triangles[i][1]] );\n stackVertices.push_back( meshOne.vertices()[meshOne.m_triangles[i][2]] );\n\n stackNormals.clear();\n stackNormals.push_back( meshOne.normals()[meshOne.m_triangles[i][0]] );\n stackNormals.push_back( meshOne.normals()[meshOne.m_triangles[i][1]] );\n stackNormals.push_back( meshOne.normals()[meshOne.m_triangles[i][2]] );\n\n for ( int j = 0; j < 3; ++j )\n {\n it = find( stackVertices.begin(), stackVertices.end(),\n meshTwo.vertices()[meshTwo.m_triangles[i][j]] );\n if ( it != stackVertices.end() )\n {\n stackVertices.erase( it );\n } else\n { result = false; }\n }\n\n for ( int j = 0; j < 3; ++j )\n {\n it = find( stackNormals.begin(), stackNormals.end(),\n meshTwo.normals()[meshTwo.m_triangles[i][j]] );\n if ( it != stackNormals.end() )\n {\n stackNormals.erase( it );\n } else\n { result = false; }\n }\n\n ++i;\n }\n return result;\n}\n\nvoid run() {\n using Ra::Core::Vector3;\n using Ra::Core::Geometry::TopologicalMesh;\n using Ra::Core::Geometry::TriangleMesh;\n\n using Catmull =\n OpenMesh::Subdivider::Uniform::CatmullClarkT;\n using Loop = OpenMesh::Subdivider::Uniform::LoopT;\n\n using Decimater = OpenMesh::Decimater::DecimaterT;\n using HModQuadric =\n OpenMesh::Decimater::ModQuadricT::Handle;\n\n TriangleMesh newMesh;\n TriangleMesh mesh;\n TopologicalMesh topologicalMesh;\n\n \/\/ Test for close mesh\n mesh = Ra::Core::Geometry::makeBox();\n topologicalMesh = TopologicalMesh( mesh );\n newMesh = topologicalMesh.toTriangleMesh();\n RA_VERIFY( isSameMesh( mesh, newMesh ), \"Conversion to topological box mesh\" );\n\n mesh = Ra::Core::Geometry::makeSharpBox();\n topologicalMesh = TopologicalMesh( mesh );\n newMesh = topologicalMesh.toTriangleMesh();\n RA_VERIFY( isSameMesh( mesh, newMesh ), \"Conversion to topological sharp box mesh\" );\n\n \/\/ Test for mesh with boundaries\n mesh = Ra::Core::Geometry::makePlaneGrid( 2, 2 );\n topologicalMesh = TopologicalMesh( mesh );\n newMesh = topologicalMesh.toTriangleMesh();\n RA_VERIFY( isSameMesh( mesh, newMesh ), \"Conversion to topological grid mesh\" );\n\n mesh = Ra::Core::Geometry::makeCylinder( Vector3( 0, 0, 0 ), Vector3( 0, 0, 1 ), 1 );\n topologicalMesh = TopologicalMesh( mesh );\n newMesh = topologicalMesh.toTriangleMesh();\n RA_VERIFY( isSameMesh( mesh, newMesh ), \"Conversion to topological cylinder mesh\" );\n\n mesh = Ra::Core::Geometry::makeBox();\n topologicalMesh = TopologicalMesh( mesh );\n\n for ( TopologicalMesh::ConstVertexIter v_it = topologicalMesh.vertices_begin();\n v_it != topologicalMesh.vertices_end(); ++v_it )\n {\n topologicalMesh.set_normal(\n *v_it, TopologicalMesh::Normal( Scalar( 1. ), Scalar( 0. ), Scalar( 0. ) ) );\n }\n\n for ( TopologicalMesh::ConstVertexIter v_it = topologicalMesh.vertices_begin();\n v_it != topologicalMesh.vertices_end(); ++v_it )\n {\n topologicalMesh.propagate_normal_to_halfedges( *v_it );\n }\n\n {\n newMesh = topologicalMesh.toTriangleMesh();\n bool check1 = true;\n bool check2 = true;\n for ( auto n : newMesh.normals() )\n {\n if ( !Ra::Core::Math::areApproxEqual(\n n.dot( Vector3( Scalar( 1. ), Scalar( 0. ), Scalar( 0. ) ) ), Scalar( 1. ) ) )\n {\n check1 = false;\n }\n if ( n.dot( Vector3( Scalar( 0.5 ), Scalar( 0. ), Scalar( 0. ) ) ) > Scalar( 0.8 ) )\n {\n check2 = false;\n }\n }\n RA_VERIFY( check1 && check2, \"Set normal to topo vertex and apply them to halfedge\" );\n }\n}\n} \/\/ namespace Testing\n} \/\/ namespace Ra\n\nint main( int argc, const char** argv ) {\n using namespace Ra;\n\n if ( !Testing::init_testing( 1, argv ) )\n {\n return EXIT_FAILURE;\n }\n\n#pragma omp parallel for\n for ( int i = 0; i < Testing::g_repeat; ++i )\n {\n CALL_SUBTEST( ( Testing::run() ) );\n }\n\n return EXIT_SUCCESS;\n}\nAdd test for attrib size in TopologicalMesh ;#include \n#include \n#include \n#include \n\n#include \n#include \n\n#include \n#include \nnamespace Ra {\nnamespace Testing {\n\nbool isSameMesh( Ra::Core::Geometry::TriangleMesh& meshOne,\n Ra::Core::Geometry::TriangleMesh& meshTwo ) {\n\n using Ra::Core::Vector3;\n using Ra::Core::Geometry::TopologicalMesh;\n using Ra::Core::Geometry::TriangleMesh;\n\n bool result = true;\n int i = 0;\n \/\/ Check length\n if ( meshOne.vertices().size() != meshTwo.vertices().size() )\n return false;\n if ( meshOne.normals().size() != meshTwo.normals().size() )\n return false;\n if ( meshOne.m_triangles.size() != meshTwo.m_triangles.size() )\n return false;\n\n \/\/ Check triangles\n std::vector stackVertices;\n std::vector stackNormals;\n\n i = 0;\n while ( result && i < meshOne.m_triangles.size() )\n {\n std::vector::iterator it;\n stackVertices.clear();\n stackVertices.push_back( meshOne.vertices()[meshOne.m_triangles[i][0]] );\n stackVertices.push_back( meshOne.vertices()[meshOne.m_triangles[i][1]] );\n stackVertices.push_back( meshOne.vertices()[meshOne.m_triangles[i][2]] );\n\n stackNormals.clear();\n stackNormals.push_back( meshOne.normals()[meshOne.m_triangles[i][0]] );\n stackNormals.push_back( meshOne.normals()[meshOne.m_triangles[i][1]] );\n stackNormals.push_back( meshOne.normals()[meshOne.m_triangles[i][2]] );\n\n for ( int j = 0; j < 3; ++j )\n {\n it = find( stackVertices.begin(), stackVertices.end(),\n meshTwo.vertices()[meshTwo.m_triangles[i][j]] );\n if ( it != stackVertices.end() )\n {\n stackVertices.erase( it );\n } else\n { result = false; }\n }\n\n for ( int j = 0; j < 3; ++j )\n {\n it = find( stackNormals.begin(), stackNormals.end(),\n meshTwo.normals()[meshTwo.m_triangles[i][j]] );\n if ( it != stackNormals.end() )\n {\n stackNormals.erase( it );\n } else\n { result = false; }\n }\n\n ++i;\n }\n return result;\n}\n\nvoid run() {\n using Ra::Core::Vector3;\n using Ra::Core::Geometry::TopologicalMesh;\n using Ra::Core::Geometry::TriangleMesh;\n\n using Catmull =\n OpenMesh::Subdivider::Uniform::CatmullClarkT;\n using Loop = OpenMesh::Subdivider::Uniform::LoopT;\n\n using Decimater = OpenMesh::Decimater::DecimaterT;\n using HModQuadric =\n OpenMesh::Decimater::ModQuadricT::Handle;\n\n TriangleMesh newMesh;\n TriangleMesh mesh;\n TopologicalMesh topologicalMesh;\n\n \/\/ Test for close mesh\n mesh = Ra::Core::Geometry::makeBox();\n topologicalMesh = TopologicalMesh( mesh );\n newMesh = topologicalMesh.toTriangleMesh();\n RA_VERIFY( isSameMesh( mesh, newMesh ), \"Conversion to topological box mesh\" );\n\n mesh = Ra::Core::Geometry::makeSharpBox();\n topologicalMesh = TopologicalMesh( mesh );\n newMesh = topologicalMesh.toTriangleMesh();\n RA_VERIFY( isSameMesh( mesh, newMesh ), \"Conversion to topological sharp box mesh\" );\n\n \/\/ Test for mesh with boundaries\n mesh = Ra::Core::Geometry::makePlaneGrid( 2, 2 );\n topologicalMesh = TopologicalMesh( mesh );\n newMesh = topologicalMesh.toTriangleMesh();\n RA_VERIFY( isSameMesh( mesh, newMesh ), \"Conversion to topological grid mesh\" );\n\n mesh = Ra::Core::Geometry::makeCylinder( Vector3( 0, 0, 0 ), Vector3( 0, 0, 1 ), 1 );\n topologicalMesh = TopologicalMesh( mesh );\n newMesh = topologicalMesh.toTriangleMesh();\n RA_VERIFY( isSameMesh( mesh, newMesh ), \"Conversion to topological cylinder mesh\" );\n\n \/\/ Test skip empty attributes\n mesh.addAttrib( \"empty\" );\n topologicalMesh = TopologicalMesh( mesh );\n newMesh = topologicalMesh.toTriangleMesh();\n RA_VERIFY( !newMesh.hasAttrib( \"empty\" ), \"TopologicalMesh skip empty attributes\" );\n\n \/\/ Test normals\n mesh = Ra::Core::Geometry::makeBox();\n topologicalMesh = TopologicalMesh( mesh );\n\n for ( TopologicalMesh::ConstVertexIter v_it = topologicalMesh.vertices_begin();\n v_it != topologicalMesh.vertices_end(); ++v_it )\n {\n topologicalMesh.set_normal(\n *v_it, TopologicalMesh::Normal( Scalar( 1. ), Scalar( 0. ), Scalar( 0. ) ) );\n }\n\n for ( TopologicalMesh::ConstVertexIter v_it = topologicalMesh.vertices_begin();\n v_it != topologicalMesh.vertices_end(); ++v_it )\n {\n topologicalMesh.propagate_normal_to_halfedges( *v_it );\n }\n\n {\n newMesh = topologicalMesh.toTriangleMesh();\n bool check1 = true;\n bool check2 = true;\n for ( auto n : newMesh.normals() )\n {\n if ( !Ra::Core::Math::areApproxEqual(\n n.dot( Vector3( Scalar( 1. ), Scalar( 0. ), Scalar( 0. ) ) ), Scalar( 1. ) ) )\n {\n check1 = false;\n }\n if ( n.dot( Vector3( Scalar( 0.5 ), Scalar( 0. ), Scalar( 0. ) ) ) > Scalar( 0.8 ) )\n {\n check2 = false;\n }\n }\n RA_VERIFY( check1 && check2, \"Set normal to topo vertex and apply them to halfedge\" );\n }\n}\n} \/\/ namespace Testing\n} \/\/ namespace Ra\n\nint main( int argc, const char** argv ) {\n using namespace Ra;\n\n if ( !Testing::init_testing( 1, argv ) )\n {\n return EXIT_FAILURE;\n }\n\n#pragma omp parallel for\n for ( int i = 0; i < Testing::g_repeat; ++i )\n {\n CALL_SUBTEST( ( Testing::run() ) );\n }\n\n return EXIT_SUCCESS;\n}\n<|endoftext|>"} {"text":"\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\/ @brief vocbase traversals\n\/\/\/\n\/\/\/ @file\n\/\/\/\n\/\/\/ DISCLAIMER\n\/\/\/\n\/\/\/ Copyright 2014-2015 ArangoDB GmbH, Cologne, Germany\n\/\/\/ Copyright 2004-2014 triAGENS GmbH, Cologne, Germany\n\/\/\/\n\/\/\/ Licensed under the Apache License, Version 2.0 (the \"License\");\n\/\/\/ you may not use this file except in compliance with the License.\n\/\/\/ You may obtain a copy of the License at\n\/\/\/\n\/\/\/ http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n\/\/\/\n\/\/\/ Unless required by applicable law or agreed to in writing, software\n\/\/\/ distributed under the License is distributed on an \"AS IS\" BASIS,\n\/\/\/ WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n\/\/\/ See the License for the specific language governing permissions and\n\/\/\/ limitations under the License.\n\/\/\/\n\/\/\/ Copyright holder is ArangoDB GmbH, Cologne, Germany\n\/\/\/\n\/\/\/ @author Michael Hackstein\n\/\/\/ @author Max Neunhoeffer\n\/\/\/ @author Copyright 2014-2015, ArangoDB GmbH, Cologne, Germany\n\/\/\/ @author Copyright 2012-2013, triAGENS GmbH, Cologne, Germany\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n#include \"Traverser.h\"\n\n#include \"Basics\/Thread.h\"\n\nusing namespace std;\nusing namespace triagens::basics;\n\nclass Searcher : public Thread {\n\n Traverser* _traverser;\n Traverser::ThreadInfo& _myInfo;\n Traverser::ThreadInfo& _peerInfo;\n Traverser::VertexId _start;\n Traverser::ExpanderFunction _expander;\n string _id;\n\n public:\n\n Searcher (Traverser* traverser, Traverser::ThreadInfo& myInfo, \n Traverser::ThreadInfo& peerInfo, Traverser::VertexId start,\n Traverser::ExpanderFunction expander, string id)\n : Thread(id), _traverser(traverser), _myInfo(myInfo), \n _peerInfo(peerInfo), _start(start), _expander(expander), _id(id) {\n }\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\/ @brief Insert a neighbor to the todo list.\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n private:\n\n void insertNeighbor (Traverser::VertexId& neighbor,\n Traverser::VertexId& predecessor,\n Traverser::EdgeId& edge,\n Traverser::EdgeWeight weight) {\n\n std::lock_guard guard(_myInfo._mutex);\n Traverser::Step* s = _myInfo._pq.lookup(neighbor);\n\n \/\/ Not found, so insert it:\n if (s == nullptr) {\n _myInfo._pq.insert(neighbor, \n Traverser::Step(neighbor, predecessor, \n weight, edge));\n return;\n }\n if (s->_done) {\n return;\n }\n if (s->_weight > weight) {\n _myInfo._pq.lowerWeight(neighbor, weight);\n }\n }\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\/ @brief Lookup our current vertex in the data of our peer.\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n void lookupPeer (Traverser::VertexId& vertex,\n Traverser::EdgeWeight weight) {\n\n std::lock_guard guard(_peerInfo._mutex);\n Traverser::Step* s = _peerInfo._pq.lookup(vertex);\n if (s == nullptr) {\n \/\/ Not found, nothing more to do\n return;\n }\n Traverser::EdgeWeight total = s->_weight + weight;\n\n \/\/ Update the highscore:\n std::lock_guard guard2(_traverser->_resultMutex);\n if (!_traverser->_highscoreSet || total < _traverser->_highscore) {\n _traverser->_highscoreSet = true;\n _traverser->_highscore = total;\n }\n\n \/\/ Now the highscore is set!\n\n \/\/ Did we find a solution together with the other thread?\n if (s->_done) {\n if (total <= _traverser->_highscore) {\n _traverser->_intermediate = vertex;\n _traverser->_bingo = true;\n }\n \/\/ We found a way, but somebody else found a better way, so\n \/\/ this is not the shortest path\n return;\n }\n\n \/\/ Did we find a solution on our own? This is for the single thread\n \/\/ case and for the case that the other thread is too slow to even\n \/\/ finish its own start vertex!\n if (s->_weight == 0) {\n \/\/ We have found the target, we have finished all vertices with\n \/\/ a smaller weight than this one (and did not succeed), so this\n \/\/ must be a best solution:\n _traverser->_intermediate = vertex;\n _traverser->_bingo = true;\n }\n }\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\/ @brief Search graph starting at Start following edges of the given\n\/\/\/ direction only\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n public:\n\n virtual void run () {\n\n Traverser::VertexId v;\n Traverser::Step s;\n bool b = _myInfo._pq.popMinimal(v, s, true);\n \n std::vector neighbors;\n\n \/\/ Iterate while no bingo found and\n \/\/ there still is a vertex on the stack.\n while (!_traverser->_bingo && b) {\n neighbors.clear();\n _expander(v, neighbors);\n for (auto& neighbor : neighbors) {\n insertNeighbor(neighbor._vertex, v, neighbor._edge, \n s._weight + neighbor._weight);\n }\n lookupPeer(v, s._weight);\n\n std::lock_guard guard(_myInfo._mutex);\n Traverser::Step* s2 = _myInfo._pq.lookup(v);\n s2->_done = true;\n b = _myInfo._pq.popMinimal(v, s, true);\n }\n }\n};\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\/ @brief return the shortest path between the start and target vertex.\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nTraverser::Path* Traverser::shortestPath (VertexId const& start,\n VertexId const& target) {\n\n \/\/ For the result:\n std::deque r_vertices;\n std::deque r_edges;\n _highscoreSet = false;\n _highscore = 0;\n _bingo = false;\n\n \/\/ Forward with initialization:\n string empty;\n ThreadInfo forward;\n forward._pq.insert(start, Step(start, empty, 0, empty));\n\n \/\/ backward with initialization:\n ThreadInfo backward;\n backward._pq.insert(target, Step(target, empty, 0, empty));\n\n \/\/ Now the searcher threads:\n Searcher forwardSearcher(this, forward, backward, start,\n _forwardExpander, \"Forward\");\n Searcher backwardSearcher(this, backward, forward, target,\n _backwardExpander, \"Backward\");\n forwardSearcher.start();\n backwardSearcher.start();\n forwardSearcher.join();\n backwardSearcher.join();\n\n if (!_bingo || _intermediate == \"\") {\n return nullptr;\n }\n\n Step* s = forward._pq.lookup(_intermediate);\n r_vertices.push_back(_intermediate);\n\n \/\/ FORWARD Go path back from intermediate -> start.\n \/\/ Insert all vertices and edges at front of vector\n \/\/ Do NOT! insert the intermediate vertex\n while (s->_predecessor != \"\") {\n r_edges.push_front(s->_edge);\n r_vertices.push_front(s->_predecessor);\n s = forward._pq.lookup(s->_predecessor);\n }\n\n \/\/ BACKWARD Go path back from intermediate -> target.\n \/\/ Insert all vertices and edges at back of vector\n \/\/ Also insert the intermediate vertex\n s = backward._pq.lookup(_intermediate);\n while (s->_predecessor != \"\") {\n r_edges.push_back(s->_edge);\n r_vertices.push_back(s->_predecessor);\n s = backward._pq.lookup(s->_predecessor);\n }\n return new Path(r_vertices, r_edges, _highscore);\n};\n\nDisable bidirectional search for now.\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\/ @brief vocbase traversals\n\/\/\/\n\/\/\/ @file\n\/\/\/\n\/\/\/ DISCLAIMER\n\/\/\/\n\/\/\/ Copyright 2014-2015 ArangoDB GmbH, Cologne, Germany\n\/\/\/ Copyright 2004-2014 triAGENS GmbH, Cologne, Germany\n\/\/\/\n\/\/\/ Licensed under the Apache License, Version 2.0 (the \"License\");\n\/\/\/ you may not use this file except in compliance with the License.\n\/\/\/ You may obtain a copy of the License at\n\/\/\/\n\/\/\/ http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n\/\/\/\n\/\/\/ Unless required by applicable law or agreed to in writing, software\n\/\/\/ distributed under the License is distributed on an \"AS IS\" BASIS,\n\/\/\/ WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n\/\/\/ See the License for the specific language governing permissions and\n\/\/\/ limitations under the License.\n\/\/\/\n\/\/\/ Copyright holder is ArangoDB GmbH, Cologne, Germany\n\/\/\/\n\/\/\/ @author Michael Hackstein\n\/\/\/ @author Max Neunhoeffer\n\/\/\/ @author Copyright 2014-2015, ArangoDB GmbH, Cologne, Germany\n\/\/\/ @author Copyright 2012-2013, triAGENS GmbH, Cologne, Germany\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n#include \"Traverser.h\"\n\n#include \"Basics\/Thread.h\"\n\nusing namespace std;\nusing namespace triagens::basics;\n\nclass Searcher : public Thread {\n\n Traverser* _traverser;\n Traverser::ThreadInfo& _myInfo;\n Traverser::ThreadInfo& _peerInfo;\n Traverser::VertexId _start;\n Traverser::ExpanderFunction _expander;\n string _id;\n\n public:\n\n Searcher (Traverser* traverser, Traverser::ThreadInfo& myInfo, \n Traverser::ThreadInfo& peerInfo, Traverser::VertexId start,\n Traverser::ExpanderFunction expander, string id)\n : Thread(id), _traverser(traverser), _myInfo(myInfo), \n _peerInfo(peerInfo), _start(start), _expander(expander), _id(id) {\n }\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\/ @brief Insert a neighbor to the todo list.\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n private:\n\n void insertNeighbor (Traverser::VertexId& neighbor,\n Traverser::VertexId& predecessor,\n Traverser::EdgeId& edge,\n Traverser::EdgeWeight weight) {\n\n std::lock_guard guard(_myInfo._mutex);\n Traverser::Step* s = _myInfo._pq.lookup(neighbor);\n\n \/\/ Not found, so insert it:\n if (s == nullptr) {\n _myInfo._pq.insert(neighbor, \n Traverser::Step(neighbor, predecessor, \n weight, edge));\n return;\n }\n if (s->_done) {\n return;\n }\n if (s->_weight > weight) {\n _myInfo._pq.lowerWeight(neighbor, weight);\n }\n }\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\/ @brief Lookup our current vertex in the data of our peer.\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n void lookupPeer (Traverser::VertexId& vertex,\n Traverser::EdgeWeight weight) {\n\n std::lock_guard guard(_peerInfo._mutex);\n Traverser::Step* s = _peerInfo._pq.lookup(vertex);\n if (s == nullptr) {\n \/\/ Not found, nothing more to do\n return;\n }\n Traverser::EdgeWeight total = s->_weight + weight;\n\n \/\/ Update the highscore:\n std::lock_guard guard2(_traverser->_resultMutex);\n if (!_traverser->_highscoreSet || total < _traverser->_highscore) {\n _traverser->_highscoreSet = true;\n _traverser->_highscore = total;\n }\n\n \/\/ Now the highscore is set!\n\n \/\/ Did we find a solution together with the other thread?\n if (s->_done) {\n if (total <= _traverser->_highscore) {\n _traverser->_intermediate = vertex;\n _traverser->_bingo = true;\n }\n \/\/ We found a way, but somebody else found a better way, so\n \/\/ this is not the shortest path\n return;\n }\n\n \/\/ Did we find a solution on our own? This is for the single thread\n \/\/ case and for the case that the other thread is too slow to even\n \/\/ finish its own start vertex!\n if (s->_weight == 0) {\n \/\/ We have found the target, we have finished all vertices with\n \/\/ a smaller weight than this one (and did not succeed), so this\n \/\/ must be a best solution:\n _traverser->_intermediate = vertex;\n _traverser->_bingo = true;\n }\n }\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\/ @brief Search graph starting at Start following edges of the given\n\/\/\/ direction only\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n public:\n\n virtual void run () {\n\n Traverser::VertexId v;\n Traverser::Step s;\n bool b = _myInfo._pq.popMinimal(v, s, true);\n \n std::vector neighbors;\n\n \/\/ Iterate while no bingo found and\n \/\/ there still is a vertex on the stack.\n while (!_traverser->_bingo && b) {\n neighbors.clear();\n _expander(v, neighbors);\n for (auto& neighbor : neighbors) {\n insertNeighbor(neighbor._vertex, v, neighbor._edge, \n s._weight + neighbor._weight);\n }\n lookupPeer(v, s._weight);\n\n std::lock_guard guard(_myInfo._mutex);\n Traverser::Step* s2 = _myInfo._pq.lookup(v);\n s2->_done = true;\n b = _myInfo._pq.popMinimal(v, s, true);\n }\n }\n};\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\/ @brief return the shortest path between the start and target vertex.\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nTraverser::Path* Traverser::shortestPath (VertexId const& start,\n VertexId const& target) {\n\n \/\/ For the result:\n std::deque r_vertices;\n std::deque r_edges;\n _highscoreSet = false;\n _highscore = 0;\n _bingo = false;\n\n \/\/ Forward with initialization:\n string empty;\n ThreadInfo forward;\n forward._pq.insert(start, Step(start, empty, 0, empty));\n\n \/\/ backward with initialization:\n ThreadInfo backward;\n backward._pq.insert(target, Step(target, empty, 0, empty));\n\n \/\/ Now the searcher threads:\n Searcher forwardSearcher(this, forward, backward, start,\n _forwardExpander, \"Forward\");\n Searcher backwardSearcher(this, backward, forward, target,\n _backwardExpander, \"Backward\");\n forwardSearcher.start();\n \/\/backwardSearcher.start();\n forwardSearcher.join();\n \/\/backwardSearcher.join();\n\n if (!_bingo || _intermediate == \"\") {\n return nullptr;\n }\n\n Step* s = forward._pq.lookup(_intermediate);\n r_vertices.push_back(_intermediate);\n\n \/\/ FORWARD Go path back from intermediate -> start.\n \/\/ Insert all vertices and edges at front of vector\n \/\/ Do NOT! insert the intermediate vertex\n while (s->_predecessor != \"\") {\n r_edges.push_front(s->_edge);\n r_vertices.push_front(s->_predecessor);\n s = forward._pq.lookup(s->_predecessor);\n }\n\n \/\/ BACKWARD Go path back from intermediate -> target.\n \/\/ Insert all vertices and edges at back of vector\n \/\/ Also insert the intermediate vertex\n s = backward._pq.lookup(_intermediate);\n while (s->_predecessor != \"\") {\n r_edges.push_back(s->_edge);\n r_vertices.push_back(s->_predecessor);\n s = backward._pq.lookup(s->_predecessor);\n }\n return new Path(r_vertices, r_edges, _highscore);\n};\n\n<|endoftext|>"} {"text":"#include \"gru.h\"\n\n#include \n#include \n#include \n#include \n#include \"logging.h\"\n#include \"util.h\"\n\nDECLARE_int32(galaxy_deploy_step);\nDECLARE_string(minion_path);\nDECLARE_string(nexus_server_list);\nDECLARE_string(nexus_root_path);\nDECLARE_string(master_path);\nDECLARE_bool(enable_cpu_soft_limit);\nDECLARE_bool(enable_memory_soft_limit);\nDECLARE_string(galaxy_node_label);\nDECLARE_string(galaxy_user);\nDECLARE_string(galaxy_token);\nDECLARE_string(galaxy_pool);\nDECLARE_int32(max_minions_per_host);\n\nnamespace baidu {\nnamespace shuttle {\n\nstatic const int64_t default_additional_map_memory = 1024l * 1024 * 1024;\nstatic const int64_t default_additional_reduce_memory = 2048l * 1024 * 1024;\nstatic const int default_map_additional_millicores = 0;\nstatic const int default_reduce_additional_millicores = 500;\n\nint Gru::additional_map_millicores = default_map_additional_millicores;\nint Gru::additional_reduce_millicores = default_reduce_additional_millicores;\nint64_t Gru::additional_map_memory = default_additional_map_memory;\nint64_t Gru::additional_reduce_memory = default_additional_reduce_memory;\n\nGru::Gru(::baidu::galaxy::sdk::AppMaster* galaxy, JobDescriptor* job,\n const std::string& job_id, WorkMode mode) :\n galaxy_(galaxy), job_(job), job_id_(job_id), mode_(mode) {\n mode_str_ = ((mode == kReduce) ? \"reduce\" : \"map\");\n minion_name_ = job->name() + \"_\" + mode_str_;\n}\n\nStatus Gru::Start() {\n ::baidu::galaxy::sdk::SubmitJobRequest galaxy_job;\n galaxy_job.user.user = FLAGS_galaxy_user;\n galaxy_job.user.token = FLAGS_galaxy_token;\n galaxy_job.hostname = ::baidu::common::util::GetLocalHostName();\n galaxy_job.job.deploy.pools.push_back(FLAGS_galaxy_pool);\n galaxy_job.job.name = minion_name_ + \"@minion\";\n galaxy_job.job.type = ::baidu::galaxy::sdk::kJobBatch;\n galaxy_job.job.deploy.replica = (mode_ == kReduce) ? job_->reduce_capacity() : job_->map_capacity();\n galaxy_job.job.deploy.step = FLAGS_galaxy_deploy_step;\n galaxy_job.job.deploy.interval = 1;\n galaxy_job.job.deploy.max_per_host = FLAGS_max_minions_per_host;\n galaxy_job.job.deploy.update_break_count = 0;\n galaxy_job.job.version = \"1.0.0\";\n galaxy_job.job.run_user = \"galaxy\";\n if (!FLAGS_galaxy_node_label.empty()) {\n galaxy_job.job.deploy.tag = FLAGS_galaxy_node_label;\n }\n ::baidu::galaxy::sdk::PodDescription & pod_desc = galaxy_job.job.pod;\n pod_desc.workspace_volum.size = (3L << 30);\n pod_desc.workspace_volum.medium = ::baidu::galaxy::sdk::kDisk;\n pod_desc.workspace_volum.exclusive = false;\n pod_desc.workspace_volum.readonly = false;\n pod_desc.workspace_volum.use_symlink = false;\n pod_desc.workspace_volum.dest_path = \"\/home\/shuttle\";\n pod_desc.workspace_volum.type = ::baidu::galaxy::sdk::kEmptyDir;\n\n ::baidu::galaxy::sdk::TaskDescription task_desc;\n if (mode_str_ == \"map\") {\n task_desc.cpu.milli_core = job_->millicores() + additional_map_millicores;\n } else {\n task_desc.cpu.milli_core = job_->millicores() + additional_reduce_millicores;\n }\n task_desc.memory.size = job_->memory() +\n ((mode_ == kReduce) ? additional_reduce_memory : additional_map_memory);\n std::string app_package;\n std::vector cache_archive_list;\n int file_size = job_->files().size();\n for (int i = 0; i < file_size; ++i) {\n const std::string& file = job_->files(i);\n if (boost::starts_with(file, \"hdfs:\/\/\")) {\n cache_archive_list.push_back(file);\n } else {\n app_package = file;\n }\n }\n std::stringstream ss;\n if (!job_->input_dfs().user().empty()) {\n ss << \"hadoop_job_ugi=\" << job_->input_dfs().user()\n << \",\" << job_->input_dfs().password()\n << \" fs_default_name=hdfs:\/\/\" << job_->input_dfs().host()\n << \":\" << job_->input_dfs().port() << \" \"; \n }\n for (size_t i = 0; i < cache_archive_list.size(); i++) {\n ss << \"cache_archive_\" << i << \"=\" << cache_archive_list[i] << \" \";\n }\n ss << \"app_package=\" << app_package\n << \" .\/minion_boot.sh -jobid=\" << job_id_ << \" -nexus_addr=\" << FLAGS_nexus_server_list\n << \" -master_nexus_path=\" << FLAGS_nexus_root_path + FLAGS_master_path\n << \" -work_mode=\" << ((mode_ == kMapOnly) ? \"map-only\" : mode_str_);\n std::stringstream ss_stop;\n ss_stop << \"source hdfs_env.sh; .\/minion -jobid=\" << job_id_ << \" -nexus_addr=\" << FLAGS_nexus_server_list\n << \" -master_nexus_path=\" << FLAGS_nexus_root_path + FLAGS_master_path\n << \" -work_mode=\" << ((mode_ == kMapOnly) ? \"map-only\" : mode_str_)\n << \" -kill_task\";\n task_desc.exe_package.package.source_path = FLAGS_minion_path;\n task_desc.exe_package.package.dest_path = \".\";\n task_desc.exe_package.package.version = \"1.0\";\n task_desc.exe_package.start_cmd = ss.str().c_str();\n task_desc.exe_package.stop_cmd = ss_stop.str().c_str();\n task_desc.tcp_throt.recv_bps_quota = (50L << 20);\n task_desc.tcp_throt.send_bps_quota = (50L << 20);\n task_desc.blkio.weight = 100;\n ::baidu::galaxy::sdk::PortRequired port_req;\n port_req.port = \"dynamic\";\n port_req.port_name = \"NFS_CLIENT_PORT\";\n task_desc.ports.push_back(port_req);\n port_req.port = \"dynamic\";\n port_req.port_name = \"MINION_PORT\";\n task_desc.ports.push_back(port_req);\n if (FLAGS_enable_cpu_soft_limit) {\n task_desc.cpu.excess = true;\n } else {\n task_desc.cpu.excess = false;\n }\n if (FLAGS_enable_memory_soft_limit) {\n task_desc.memory.excess = true;\n } else {\n task_desc.memory.excess = false;\n }\n pod_desc.tasks.push_back(task_desc);\n std::string minion_id;\n ::baidu::galaxy::sdk::SubmitJobResponse rsps;\n if (galaxy_->SubmitJob(galaxy_job, &rsps)) {\n minion_id = rsps.jobid;\n LOG(INFO, \"galaxy job id: %s\", minion_id.c_str());\n minion_id_ = minion_id;\n galaxy_job_ = galaxy_job;\n if (minion_id_.empty()) {\n LOG(INFO, \"can not get galaxy job id\");\n return kGalaxyError;\n }\n return kOk;\n } else {\n LOG(WARNING, \"galaxy error: %s\", rsps.error_code.reason.c_str());\n }\n return kGalaxyError;\n}\n\nStatus Gru::Kill() {\n LOG(INFO, \"kill galaxy job: %s\", minion_id_.c_str());\n if (minion_id_.empty()) {\n return kOk;\n }\n ::baidu::galaxy::sdk::RemoveJobRequest rqst;\n ::baidu::galaxy::sdk::RemoveJobResponse rsps;\n rqst.jobid = minion_id_;\n rqst.user = galaxy_job_.user;\n rqst.hostname = ::baidu::common::util::GetLocalHostName();\n if (galaxy_->RemoveJob(rqst, &rsps)) {\n return kOk;\n } else {\n LOG(WARNING, \"galaxy error: %s\", rsps.error_code.reason.c_str());\n }\n return kGalaxyError;\n}\n\nStatus Gru::Update(const std::string& priority,\n int capacity) {\n ::baidu::galaxy::sdk::JobDescription job_desc = galaxy_job_.job;\n if (!priority.empty()) {\n \/\/job_desc.priority = priority;\n }\n if (capacity != -1) {\n job_desc.deploy.replica = capacity;\n }\n ::baidu::galaxy::sdk::UpdateJobRequest rqst;\n ::baidu::galaxy::sdk::UpdateJobResponse rsps;\n rqst.user = galaxy_job_.user;\n rqst.job = job_desc;\n rqst.jobid = minion_id_;\n rqst.operate = ::baidu::galaxy::sdk::kUpdateJobDefault;\n rqst.hostname = ::baidu::common::util::GetLocalHostName();\n if (galaxy_->UpdateJob(rqst, &rsps)) {\n if (!priority.empty()) {\n \/\/galaxy_job_.priority = priority;\n }\n if (capacity != -1) {\n galaxy_job_.job.deploy.replica = capacity;\n }\n return kOk;\n } else {\n LOG(WARNING, \"galaxy error: %s\", rsps.error_code.reason.c_str());\n }\n return kGalaxyError;\n}\n\n}\n}\n\nset deploy step#include \"gru.h\"\n\n#include \n#include \n#include \n#include \n#include \"logging.h\"\n#include \"util.h\"\n\nDECLARE_int32(galaxy_deploy_step);\nDECLARE_string(minion_path);\nDECLARE_string(nexus_server_list);\nDECLARE_string(nexus_root_path);\nDECLARE_string(master_path);\nDECLARE_bool(enable_cpu_soft_limit);\nDECLARE_bool(enable_memory_soft_limit);\nDECLARE_string(galaxy_node_label);\nDECLARE_string(galaxy_user);\nDECLARE_string(galaxy_token);\nDECLARE_string(galaxy_pool);\nDECLARE_int32(max_minions_per_host);\n\nnamespace baidu {\nnamespace shuttle {\n\nstatic const int64_t default_additional_map_memory = 1024l * 1024 * 1024;\nstatic const int64_t default_additional_reduce_memory = 2048l * 1024 * 1024;\nstatic const int default_map_additional_millicores = 0;\nstatic const int default_reduce_additional_millicores = 500;\n\nint Gru::additional_map_millicores = default_map_additional_millicores;\nint Gru::additional_reduce_millicores = default_reduce_additional_millicores;\nint64_t Gru::additional_map_memory = default_additional_map_memory;\nint64_t Gru::additional_reduce_memory = default_additional_reduce_memory;\n\nGru::Gru(::baidu::galaxy::sdk::AppMaster* galaxy, JobDescriptor* job,\n const std::string& job_id, WorkMode mode) :\n galaxy_(galaxy), job_(job), job_id_(job_id), mode_(mode) {\n mode_str_ = ((mode == kReduce) ? \"reduce\" : \"map\");\n minion_name_ = job->name() + \"_\" + mode_str_;\n}\n\nStatus Gru::Start() {\n ::baidu::galaxy::sdk::SubmitJobRequest galaxy_job;\n galaxy_job.user.user = FLAGS_galaxy_user;\n galaxy_job.user.token = FLAGS_galaxy_token;\n galaxy_job.hostname = ::baidu::common::util::GetLocalHostName();\n galaxy_job.job.deploy.pools.push_back(FLAGS_galaxy_pool);\n galaxy_job.job.name = minion_name_ + \"@minion\";\n galaxy_job.job.type = ::baidu::galaxy::sdk::kJobBatch;\n galaxy_job.job.deploy.replica = (mode_ == kReduce) ? job_->reduce_capacity() : job_->map_capacity();\n galaxy_job.job.deploy.step = std::min((int)FLAGS_galaxy_deploy_step, (int)galaxy_job.job.deploy.replica);\n galaxy_job.job.deploy.interval = 1;\n galaxy_job.job.deploy.max_per_host = FLAGS_max_minions_per_host;\n galaxy_job.job.deploy.update_break_count = 0;\n galaxy_job.job.version = \"1.0.0\";\n galaxy_job.job.run_user = \"galaxy\";\n if (!FLAGS_galaxy_node_label.empty()) {\n galaxy_job.job.deploy.tag = FLAGS_galaxy_node_label;\n }\n ::baidu::galaxy::sdk::PodDescription & pod_desc = galaxy_job.job.pod;\n pod_desc.workspace_volum.size = (3L << 30);\n pod_desc.workspace_volum.medium = ::baidu::galaxy::sdk::kDisk;\n pod_desc.workspace_volum.exclusive = false;\n pod_desc.workspace_volum.readonly = false;\n pod_desc.workspace_volum.use_symlink = false;\n pod_desc.workspace_volum.dest_path = \"\/home\/shuttle\";\n pod_desc.workspace_volum.type = ::baidu::galaxy::sdk::kEmptyDir;\n\n ::baidu::galaxy::sdk::TaskDescription task_desc;\n if (mode_str_ == \"map\") {\n task_desc.cpu.milli_core = job_->millicores() + additional_map_millicores;\n } else {\n task_desc.cpu.milli_core = job_->millicores() + additional_reduce_millicores;\n }\n task_desc.memory.size = job_->memory() +\n ((mode_ == kReduce) ? additional_reduce_memory : additional_map_memory);\n std::string app_package;\n std::vector cache_archive_list;\n int file_size = job_->files().size();\n for (int i = 0; i < file_size; ++i) {\n const std::string& file = job_->files(i);\n if (boost::starts_with(file, \"hdfs:\/\/\")) {\n cache_archive_list.push_back(file);\n } else {\n app_package = file;\n }\n }\n std::stringstream ss;\n if (!job_->input_dfs().user().empty()) {\n ss << \"hadoop_job_ugi=\" << job_->input_dfs().user()\n << \",\" << job_->input_dfs().password()\n << \" fs_default_name=hdfs:\/\/\" << job_->input_dfs().host()\n << \":\" << job_->input_dfs().port() << \" \"; \n }\n for (size_t i = 0; i < cache_archive_list.size(); i++) {\n ss << \"cache_archive_\" << i << \"=\" << cache_archive_list[i] << \" \";\n }\n ss << \"app_package=\" << app_package\n << \" .\/minion_boot.sh -jobid=\" << job_id_ << \" -nexus_addr=\" << FLAGS_nexus_server_list\n << \" -master_nexus_path=\" << FLAGS_nexus_root_path + FLAGS_master_path\n << \" -work_mode=\" << ((mode_ == kMapOnly) ? \"map-only\" : mode_str_);\n std::stringstream ss_stop;\n ss_stop << \"source hdfs_env.sh; .\/minion -jobid=\" << job_id_ << \" -nexus_addr=\" << FLAGS_nexus_server_list\n << \" -master_nexus_path=\" << FLAGS_nexus_root_path + FLAGS_master_path\n << \" -work_mode=\" << ((mode_ == kMapOnly) ? \"map-only\" : mode_str_)\n << \" -kill_task\";\n task_desc.exe_package.package.source_path = FLAGS_minion_path;\n task_desc.exe_package.package.dest_path = \".\";\n task_desc.exe_package.package.version = \"1.0\";\n task_desc.exe_package.start_cmd = ss.str().c_str();\n task_desc.exe_package.stop_cmd = ss_stop.str().c_str();\n task_desc.tcp_throt.recv_bps_quota = (50L << 20);\n task_desc.tcp_throt.send_bps_quota = (50L << 20);\n task_desc.blkio.weight = 100;\n ::baidu::galaxy::sdk::PortRequired port_req;\n port_req.port = \"dynamic\";\n port_req.port_name = \"NFS_CLIENT_PORT\";\n task_desc.ports.push_back(port_req);\n port_req.port = \"dynamic\";\n port_req.port_name = \"MINION_PORT\";\n task_desc.ports.push_back(port_req);\n if (FLAGS_enable_cpu_soft_limit) {\n task_desc.cpu.excess = true;\n } else {\n task_desc.cpu.excess = false;\n }\n if (FLAGS_enable_memory_soft_limit) {\n task_desc.memory.excess = true;\n } else {\n task_desc.memory.excess = false;\n }\n pod_desc.tasks.push_back(task_desc);\n std::string minion_id;\n ::baidu::galaxy::sdk::SubmitJobResponse rsps;\n if (galaxy_->SubmitJob(galaxy_job, &rsps)) {\n minion_id = rsps.jobid;\n LOG(INFO, \"galaxy job id: %s\", minion_id.c_str());\n minion_id_ = minion_id;\n galaxy_job_ = galaxy_job;\n if (minion_id_.empty()) {\n LOG(INFO, \"can not get galaxy job id\");\n return kGalaxyError;\n }\n return kOk;\n } else {\n LOG(WARNING, \"galaxy error: %s\", rsps.error_code.reason.c_str());\n }\n return kGalaxyError;\n}\n\nStatus Gru::Kill() {\n LOG(INFO, \"kill galaxy job: %s\", minion_id_.c_str());\n if (minion_id_.empty()) {\n return kOk;\n }\n ::baidu::galaxy::sdk::RemoveJobRequest rqst;\n ::baidu::galaxy::sdk::RemoveJobResponse rsps;\n rqst.jobid = minion_id_;\n rqst.user = galaxy_job_.user;\n rqst.hostname = ::baidu::common::util::GetLocalHostName();\n if (galaxy_->RemoveJob(rqst, &rsps)) {\n return kOk;\n } else {\n LOG(WARNING, \"galaxy error: %s\", rsps.error_code.reason.c_str());\n }\n return kGalaxyError;\n}\n\nStatus Gru::Update(const std::string& priority,\n int capacity) {\n ::baidu::galaxy::sdk::JobDescription job_desc = galaxy_job_.job;\n if (!priority.empty()) {\n \/\/job_desc.priority = priority;\n }\n if (capacity != -1) {\n job_desc.deploy.replica = capacity;\n }\n ::baidu::galaxy::sdk::UpdateJobRequest rqst;\n ::baidu::galaxy::sdk::UpdateJobResponse rsps;\n rqst.user = galaxy_job_.user;\n rqst.job = job_desc;\n rqst.jobid = minion_id_;\n rqst.operate = ::baidu::galaxy::sdk::kUpdateJobDefault;\n rqst.hostname = ::baidu::common::util::GetLocalHostName();\n if (galaxy_->UpdateJob(rqst, &rsps)) {\n if (!priority.empty()) {\n \/\/galaxy_job_.priority = priority;\n }\n if (capacity != -1) {\n galaxy_job_.job.deploy.replica = capacity;\n }\n return kOk;\n } else {\n LOG(WARNING, \"galaxy error: %s\", rsps.error_code.reason.c_str());\n }\n return kGalaxyError;\n}\n\n}\n}\n\n<|endoftext|>"} {"text":"#include \"affinity.hh\" \/\/ FIXME\n#include \"command.hh\"\n#include \"progress-bar.hh\"\n#include \"shared.hh\"\n#include \"store-api.hh\"\n#include \"sync.hh\"\n#include \"thread-pool.hh\"\n\n#include \n\nusing namespace nix;\n\nstruct CmdVerifyPaths : StorePathsCommand\n{\n bool noContents = false;\n bool noSigs = false;\n\n CmdVerifyPaths()\n {\n mkFlag(0, \"no-contents\", \"do not verify the contents of each store path\", &noContents);\n mkFlag(0, \"no-sigs\", \"do not verify whether each store path has a valid signature\", &noSigs);\n }\n\n std::string name() override\n {\n return \"verify-paths\";\n }\n\n std::string description() override\n {\n return \"verify the integrity of store paths\";\n }\n\n void run(ref store, Paths storePaths) override\n {\n restoreAffinity(); \/\/ FIXME\n\n auto publicKeys = getDefaultPublicKeys();\n\n std::atomic untrusted{0};\n std::atomic corrupted{0};\n std::atomic done{0};\n std::atomic failed{0};\n\n ProgressBar progressBar;\n\n auto showProgress = [&](bool final) {\n std::string s;\n if (final)\n s = (format(\"checked %d paths\") % storePaths.size()).str();\n else\n s = (format(\"[%d\/%d checked\") % done % storePaths.size()).str();\n if (corrupted > 0)\n s += (format(\", %d corrupted\") % corrupted).str();\n if (untrusted > 0)\n s += (format(\", %d untrusted\") % untrusted).str();\n if (failed > 0)\n s += (format(\", %d failed\") % failed).str();\n if (!final) s += \"]\";\n return s;\n };\n\n progressBar.updateStatus(showProgress(false));\n\n ThreadPool pool;\n\n auto doPath = [&](const Path & storePath) {\n try {\n progressBar.startActivity(format(\"checking ‘%s’\") % storePath);\n\n auto info = store->queryPathInfo(storePath);\n\n if (!noContents) {\n\n HashSink sink(info.narHash.type);\n store->narFromPath(storePath, sink);\n\n auto hash = sink.finish();\n\n if (hash.first != info.narHash) {\n corrupted = 1;\n printMsg(lvlError,\n format(\"path ‘%s’ was modified! expected hash ‘%s’, got ‘%s’\")\n % storePath % printHash(info.narHash) % printHash(hash.first));\n }\n\n }\n\n if (!noSigs) {\n\n if (!info.ultimate && !info.checkSignatures(publicKeys)) {\n untrusted++;\n printMsg(lvlError, format(\"path ‘%s’ is untrusted\") % storePath);\n }\n\n }\n\n done++;\n\n progressBar.updateStatus(showProgress(false));\n\n } catch (Error & e) {\n printMsg(lvlError, format(ANSI_RED \"error:\" ANSI_NORMAL \" %s\") % e.what());\n failed++;\n }\n };\n\n for (auto & storePath : storePaths)\n pool.enqueue(std::bind(doPath, storePath));\n\n pool.process();\n\n progressBar.done();\n\n printMsg(lvlInfo, showProgress(true));\n\n throw Exit(\n (corrupted ? 1 : 0) |\n (untrusted ? 2 : 0) |\n (failed ? 4 : 0));\n }\n};\n\nstatic RegisterCommand r1(make_ref());\nAdd \"nix verify-store\" command#include \"affinity.hh\" \/\/ FIXME\n#include \"command.hh\"\n#include \"progress-bar.hh\"\n#include \"shared.hh\"\n#include \"store-api.hh\"\n#include \"sync.hh\"\n#include \"thread-pool.hh\"\n\n#include \n\nusing namespace nix;\n\nstruct MixVerify : virtual Args\n{\n bool noContents = false;\n bool noSigs = false;\n\n MixVerify()\n {\n mkFlag(0, \"no-contents\", \"do not verify the contents of each store path\", &noContents);\n mkFlag(0, \"no-sigs\", \"do not verify whether each store path has a valid signature\", &noSigs);\n }\n\n void verifyPaths(ref store, const Paths & storePaths)\n {\n restoreAffinity(); \/\/ FIXME\n\n auto publicKeys = getDefaultPublicKeys();\n\n std::atomic untrusted{0};\n std::atomic corrupted{0};\n std::atomic done{0};\n std::atomic failed{0};\n\n ProgressBar progressBar;\n\n auto showProgress = [&](bool final) {\n std::string s;\n if (final)\n s = (format(\"checked %d paths\") % storePaths.size()).str();\n else\n s = (format(\"[%d\/%d checked\") % done % storePaths.size()).str();\n if (corrupted > 0)\n s += (format(\", %d corrupted\") % corrupted).str();\n if (untrusted > 0)\n s += (format(\", %d untrusted\") % untrusted).str();\n if (failed > 0)\n s += (format(\", %d failed\") % failed).str();\n if (!final) s += \"]\";\n return s;\n };\n\n progressBar.updateStatus(showProgress(false));\n\n ThreadPool pool;\n\n auto doPath = [&](const Path & storePath) {\n try {\n progressBar.startActivity(format(\"checking ‘%s’\") % storePath);\n\n auto info = store->queryPathInfo(storePath);\n\n if (!noContents) {\n\n HashSink sink(info.narHash.type);\n store->narFromPath(storePath, sink);\n\n auto hash = sink.finish();\n\n if (hash.first != info.narHash) {\n corrupted = 1;\n printMsg(lvlError,\n format(\"path ‘%s’ was modified! expected hash ‘%s’, got ‘%s’\")\n % storePath % printHash(info.narHash) % printHash(hash.first));\n }\n\n }\n\n if (!noSigs) {\n\n if (!info.ultimate && !info.checkSignatures(publicKeys)) {\n untrusted++;\n printMsg(lvlError, format(\"path ‘%s’ is untrusted\") % storePath);\n }\n\n }\n\n done++;\n\n progressBar.updateStatus(showProgress(false));\n\n } catch (Error & e) {\n printMsg(lvlError, format(ANSI_RED \"error:\" ANSI_NORMAL \" %s\") % e.what());\n failed++;\n }\n };\n\n for (auto & storePath : storePaths)\n pool.enqueue(std::bind(doPath, storePath));\n\n pool.process();\n\n progressBar.done();\n\n printMsg(lvlInfo, showProgress(true));\n\n throw Exit(\n (corrupted ? 1 : 0) |\n (untrusted ? 2 : 0) |\n (failed ? 4 : 0));\n }\n};\n\nstruct CmdVerifyPaths : StorePathsCommand, MixVerify\n{\n CmdVerifyPaths()\n {\n }\n\n std::string name() override\n {\n return \"verify-paths\";\n }\n\n std::string description() override\n {\n return \"verify the integrity of store paths\";\n }\n\n void run(ref store, Paths storePaths) override\n {\n verifyPaths(store, storePaths);\n }\n};\n\nstatic RegisterCommand r1(make_ref());\n\nstruct CmdVerifyStore : StoreCommand, MixVerify\n{\n CmdVerifyStore()\n {\n }\n\n std::string name() override\n {\n return \"verify-store\";\n }\n\n std::string description() override\n {\n return \"verify the integrity of all paths in the Nix store\";\n }\n\n void run(ref store) override\n {\n \/\/ FIXME: use store->verifyStore()?\n\n PathSet validPaths = store->queryAllValidPaths();\n\n verifyPaths(store, Paths(validPaths.begin(), validPaths.end()));\n }\n};\n\nstatic RegisterCommand r2(make_ref());\n<|endoftext|>"} {"text":"\/*\n Copyright (c) 2016 Louis McCarthy\n All rights reserved.\n\n Licensed under MIT License, see LICENSE for full License text\n\n opensspro.cpp - Basic USB driver for the Starshoot Pro V2.0 Color Imager\n*\/\n\n#include \n#include \n#include \n#include \n#include \n#include \n\n#include \"opensspro.h\"\n\n#define USB_REQ_STATUS 0x02\n#define USB_REQ_SET_FRAME 0x0B\n#define USB_REQ_CAPTURE 0x03\n#define USB_REQ_DOWNLOAD 0x04\n#define USB_REQ_ABORT 0x05\n#define USB_REQ_SET_DIO 0x0C\n#define USB_REQ_UNKNOWN 0x09\n\n#define USB_TIMEOUT 1000\n#define USB_RX_ENDPOINT 0x82\n#define USB_CMD_ENDPOINT 0x08\n#define USB_CONTROL_TYPE 0x03\n#define START_BYTE 0xA5\n\n#define IMAGE_WIDTH 3040\n#define IMAGE_HEIGHT 2024\n#define BUFFER_SIZE 1024\n\nusing namespace OpenSSPRO;\n\nlibusb_context* usb = NULL;\n\nSSPRO::SSPRO()\n{\n lastImage.width = IMAGE_WIDTH;\n lastImage.height = IMAGE_HEIGHT;\n lastImage.data = NULL;\n\n DEBUG(\"Searching for USB root...\");\n if (usb == NULL)\n {\n int result = libusb_init(&usb);\n if (result < 0)\n ERROR(\"Failed to init libusb, result = %d\", result);\n else\n DEBUG(\"Ready\\n\");\n }\n}\n\nbool SSPRO::Connect()\n{\n DEBUG(\"Looking for camera...\");\n if ((this->device = libusb_open_device_with_vid_pid(usb, SSPRO_VENDOR_ID, SSPRO_PRODUCT_ID)) == NULL)\n {\n DEBUG(\"NOT found!\\n\");\n return false;\n }\n DEBUG(\"Found it!\\n\");\n\n DEBUG(\"Checking for kernel driver...\");\n int result;\n if (libusb_kernel_driver_active(this->device, 0) == 1)\n {\n result = libusb_detach_kernel_driver(this->device, 0);\n if (result < 0)\n ERROR(\"Failed to detach kernel driver, result = %d\", result);\n }\n DEBUG(\"Done\\n\");\n\n DEBUG(\"Setting USB configuration...\");\n result = libusb_set_configuration(this->device, 1); \/\/ Only one configuration available\n if (result < 0)\n ERROR(\"Failed to set configuration, result = %d\", result);\n DEBUG(\"Done\\n\");\n\n DEBUG(\"Claiming USB interface...\");\n result = libusb_claim_interface(this->device, 0); \/\/ Only one interface available\n if (result < 0)\n ERROR(\"Failed to claim interface, result = %d\", result);\n DEBUG(\"Done\\n\");\n\n this->Init();\n return true;\n}\n\nvoid SSPRO::Disconnect()\n{\n DEBUG(\"Disconnecting camera...\");\n if (this->device)\n libusb_close(this->device);\n this->device = NULL;\n DEBUG(\"Done\\n\");\n}\n\nvoid SSPRO::GetStatus()\n{\n DEBUG(\"Requesting camera status...\");\n int txCount;\n unsigned char data[6] = { START_BYTE, USB_REQ_STATUS, 0x00, 0x00, 0x00, 0x00 };\n int result = libusb_bulk_transfer(this->device, USB_CMD_ENDPOINT, data, 6, &txCount, USB_TIMEOUT);\n if (result < 0)\n ERROR(\"Failed to get status, result = %d\", result);\n else\n DEBUG(\"Done\\n\");\n\n this->GetCMDResult(USB_REQ_STATUS);\n}\n\nvoid SSPRO::SetupFrame()\n{\n DEBUG(\"Setting up frame...\");\n int txCount;\n unsigned char data[6] = { START_BYTE, USB_REQ_SET_FRAME, 0x00, 0x00, 0x03, 0xF9 };\n int result = libusb_bulk_transfer(this->device, USB_CMD_ENDPOINT, data, 6, &txCount, USB_TIMEOUT);\n if (result < 0)\n ERROR(\"Failed to setup frame, result = %d\", result);\n else\n DEBUG(\"Done\\n\");\n\n this->GetCMDResult(USB_REQ_SET_FRAME);\n}\n\nbool SSPRO::IsConnected()\n{\n return (this->device != NULL);\n}\n\nbool SSPRO::GetCMDResult(unsigned char cmd)\n{\n DEBUG(\"Getting command result...\");\n int rxCount;\n unsigned char rxData[8];\n int result = libusb_bulk_transfer(this->device, USB_RX_ENDPOINT, rxData, sizeof(rxData), &rxCount, USB_TIMEOUT);\n if (result < 0)\n {\n ERROR(\"Failed to read command result, returned %d\", result);\n return false;\n }\n\n if (rxCount != 8)\n {\n ERROR(\"Invalid packet size, %d\", rxCount);\n return false;\n }\n\n if (rxData[0] != 0xA5)\n {\n ERROR(\"Invalid header, %d\", rxData[0]);\n return false;\n }\n\n if (rxData[2] != cmd)\n {\n ERROR(\"Mismatched command type, RX:%d vs CMD:%d\", rxData[1], cmd);\n return false;\n }\n\n switch (rxData[2])\n {\n case USB_REQ_STATUS:\n DEBUG(\"Found Status Result\\n\");\n DEBUG(\"Data: %02x, %02x, %02x, %02x, %02x, %02x, %02x, %02x\\n\",\n rxData[0], rxData[1], rxData[2], rxData[3], rxData[4], rxData[5], rxData[6], rxData[7]);\n capturing = (rxData[4] & 0x01) == 0x01;\n frameReady = (rxData[4] & 0x02) == 0x02;\n DEBUG(\"Capturing = %d, FrameReady = %d\\n\", capturing, frameReady);\n return true;\n break;\n case USB_REQ_SET_FRAME:\n DEBUG(\"Found Frame Result\\n\");\n DEBUG(\"Data: %02x, %02x, %02x, %02x, %02x, %02x, %02x, %02x\\n\",\n rxData[0], rxData[1], rxData[2], rxData[3], rxData[4], rxData[5], rxData[6], rxData[7]);\n return true;\n break;\n case USB_REQ_CAPTURE:\n DEBUG(\"Found Capture Result\\n\");\n DEBUG(\"Data: %02x, %02x, %02x, %02x, %02x, %02x, %02x, %02x\\n\",\n rxData[0], rxData[1], rxData[2], rxData[3], rxData[4], rxData[5], rxData[6], rxData[7]);\n return true;\n break;\n case USB_REQ_DOWNLOAD:\n DEBUG(\"Found Download Result\\n\");\n DEBUG(\"Data: %02x, %02x, %02x, %02x, %02x, %02x, %02x, %02x\\n\",\n rxData[0], rxData[1], rxData[2], rxData[3], rxData[4], rxData[5], rxData[6], rxData[7]);\n return true;\n break;\n case USB_REQ_ABORT:\n DEBUG(\"Found Abort Result\\n\");\n DEBUG(\"Data: %02x, %02x, %02x, %02x, %02x, %02x, %02x, %02x\\n\",\n rxData[0], rxData[1], rxData[2], rxData[3], rxData[4], rxData[5], rxData[6], rxData[7]);\n return true;\n break;\n case USB_REQ_SET_DIO:\n DEBUG(\"Found DIO Result\\n\");\n DEBUG(\"Data: %02x, %02x, %02x, %02x, %02x, %02x, %02x, %02x\\n\",\n rxData[0], rxData[1], rxData[2], rxData[3], rxData[4], rxData[5], rxData[6], rxData[7]);\n return true;\n break;\n case USB_REQ_UNKNOWN:\n DEBUG(\"Found 0x09 Result\\n\");\n DEBUG(\"Data: %02x, %02x, %02x, %02x, %02x, %02x, %02x, %02x\\n\",\n rxData[0], rxData[1], rxData[2], rxData[3], rxData[4], rxData[5], rxData[6], rxData[7]);\n return true;\n break;\n default:\n ERROR(\"Unknown command result, %d\", rxData[1]);\n break;\n }\n\n return false;\n}\n\nstruct rawImage* SSPRO::Capture(int ms)\n{\n DEBUG(\"Performing a blocking capture...\\n\");\n if (!this->StartCapture(ms))\n return NULL;\n\n \/\/ Wait capture time + 100 ms\n sleep(ms+100);\n\n \/\/ while status == busy\n while (!this->frameReady)\n {\n this->GetStatus();\n sleep(500);\n }\n\n this->DownloadFrame();\n return &lastImage;\n}\n\nbool SSPRO::StartCapture(int ms)\n{\n this->SetupFrame();\n\n DEBUG(\"Starting capture...\");\n int txCount;\n unsigned char data[6] = { START_BYTE, USB_REQ_CAPTURE, 0x01, 0x04, 0x92, 0x02 }; \/\/ 120s Color 1x1 binning\n int result = libusb_bulk_transfer(this->device, USB_CMD_ENDPOINT, data, 6, &txCount, USB_TIMEOUT);\n if (result < 0)\n {\n ERROR(\"Failed to capture, result = %d\", result);\n return false;\n }\n DEBUG(\"Done\\n\");\n\n return this->GetCMDResult(USB_REQ_CAPTURE);\n}\n\nvoid SSPRO::CancelCapture()\n{\n DEBUG(\"Attempting to cancel capture...\");\n int txCount;\n unsigned char data[6] = { START_BYTE, USB_REQ_ABORT, 0x00, 0x00, 0x00, 0x00 };\n int result = libusb_bulk_transfer(this->device, USB_CMD_ENDPOINT, data, 6, &txCount, USB_TIMEOUT);\n if (result < 0)\n ERROR(\"Failed to cancel capture, result = %d\", result);\n else\n DEBUG(\"Done\\n\");\n\n this->GetCMDResult(USB_REQ_ABORT);\n}\n\nvoid SSPRO::DownloadFrame()\n{ \/\/ TODO: Check camera status before trying to download\n DEBUG(\"Requesting frame download...\");\n int txCount;\n unsigned char data[6] = { START_BYTE, USB_REQ_DOWNLOAD, 0x00, 0x00, 0x00, 0x00 };\n int result = libusb_bulk_transfer(this->device, USB_CMD_ENDPOINT, data, 6, &txCount, USB_TIMEOUT);\n if (result < 0)\n {\n ERROR(\"Failed to start download, result = %d\", result);\n return;\n }\n DEBUG(\"Done\\n\");\n\n this->GetCMDResult(USB_REQ_DOWNLOAD);\n\n DEBUG(\"Waiting for data from camera...\");\n int rxCount;\n unsigned char* rxData = (unsigned char*)malloc(BUFFER_SIZE);\n unsigned char* newImage = (unsigned char*)malloc(IMAGE_WIDTH * IMAGE_HEIGHT);\n unsigned char* pointer = newImage;\n \/\/ Loop through until we get a partial buffer of data\n do\n {\n result = libusb_bulk_transfer(this->device, USB_RX_ENDPOINT, rxData, BUFFER_SIZE, &rxCount, USB_TIMEOUT);\n if (result < 0)\n {\n ERROR(\"Failed to download image, result = %d\", result);\n free(rxData);\n return;\n }\n\n memcpy(pointer, rxData, rxCount);\n pointer += BUFFER_SIZE;\n } while (rxCount == BUFFER_SIZE);\n free(rxData);\n DEBUG(\"Done\\n\");\n\n DEBUG(\"Updating lastImage...\");\n if (lastImage.data)\n free(lastImage.data);\n lastImage.data = newImage;\n lastImage.width = IMAGE_WIDTH;\n lastImage.height = IMAGE_HEIGHT;\n DEBUG(\"Done\\n\");\n}\n\nvoid SSPRO::SetDIO()\n{\n DEBUG(\"Setting DIO...\");\n int txCount;\n unsigned char dio =0x00;\n if (fanHigh)\n dio |= 0x02;\n if (coolerOn)\n dio |= 0x01;\n unsigned char data[6] = { START_BYTE, USB_REQ_SET_DIO, dio, 0x00, 0x00, 0x00 };\n int result = libusb_bulk_transfer(this->device, USB_CMD_ENDPOINT, data, 6, &txCount, USB_TIMEOUT);\n if (result < 0)\n ERROR(\"Failed to set DIO, result = %d\", result);\n else\n DEBUG(\"Done\\n\");\n\n this->GetCMDResult(USB_REQ_SET_DIO);\n}\n\nvoid SSPRO::Init()\n{\n DEBUG(\"Initializing camera...\");\n fanHigh = false;\n coolerOn = true;\n frameReady = false;\n readoutSpeed = READOUT_FASTEST;\n DEBUG(\"Done\\n\");\n\n this->SetDIO();\n}\nFixed capture function sleeps, it now uses milliseconds\/*\n Copyright (c) 2016 Louis McCarthy\n All rights reserved.\n\n Licensed under MIT License, see LICENSE for full License text\n\n opensspro.cpp - Basic USB driver for the Starshoot Pro V2.0 Color Imager\n*\/\n\n#include \n#include \n#include \n#include \n#include \n\n#include \"opensspro.h\"\n\n#define USB_REQ_STATUS 0x02\n#define USB_REQ_SET_FRAME 0x0B\n#define USB_REQ_CAPTURE 0x03\n#define USB_REQ_DOWNLOAD 0x04\n#define USB_REQ_ABORT 0x05\n#define USB_REQ_SET_DIO 0x0C\n#define USB_REQ_UNKNOWN 0x09\n\n#define USB_TIMEOUT 1000\n#define USB_RX_ENDPOINT 0x82\n#define USB_CMD_ENDPOINT 0x08\n#define USB_CONTROL_TYPE 0x03\n#define START_BYTE 0xA5\n\n#define IMAGE_WIDTH 3040\n#define IMAGE_HEIGHT 2024\n#define BUFFER_SIZE 1024\n\nusing namespace OpenSSPRO;\n\nlibusb_context* usb = NULL;\n\nSSPRO::SSPRO()\n{\n lastImage.width = IMAGE_WIDTH;\n lastImage.height = IMAGE_HEIGHT;\n lastImage.data = NULL;\n\n DEBUG(\"Searching for USB root...\");\n if (usb == NULL)\n {\n int result = libusb_init(&usb);\n if (result < 0)\n ERROR(\"Failed to init libusb, result = %d\", result);\n else\n DEBUG(\"Ready\\n\");\n }\n}\n\nbool SSPRO::Connect()\n{\n DEBUG(\"Looking for camera...\");\n if ((this->device = libusb_open_device_with_vid_pid(usb, SSPRO_VENDOR_ID, SSPRO_PRODUCT_ID)) == NULL)\n {\n DEBUG(\"NOT found!\\n\");\n return false;\n }\n DEBUG(\"Found it!\\n\");\n\n DEBUG(\"Checking for kernel driver...\");\n int result;\n if (libusb_kernel_driver_active(this->device, 0) == 1)\n {\n result = libusb_detach_kernel_driver(this->device, 0);\n if (result < 0)\n ERROR(\"Failed to detach kernel driver, result = %d\", result);\n }\n DEBUG(\"Done\\n\");\n\n DEBUG(\"Setting USB configuration...\");\n result = libusb_set_configuration(this->device, 1); \/\/ Only one configuration available\n if (result < 0)\n ERROR(\"Failed to set configuration, result = %d\", result);\n DEBUG(\"Done\\n\");\n\n DEBUG(\"Claiming USB interface...\");\n result = libusb_claim_interface(this->device, 0); \/\/ Only one interface available\n if (result < 0)\n ERROR(\"Failed to claim interface, result = %d\", result);\n DEBUG(\"Done\\n\");\n\n this->Init();\n return true;\n}\n\nvoid SSPRO::Disconnect()\n{\n DEBUG(\"Disconnecting camera...\");\n if (this->device)\n libusb_close(this->device);\n this->device = NULL;\n DEBUG(\"Done\\n\");\n}\n\nvoid SSPRO::GetStatus()\n{\n DEBUG(\"Requesting camera status...\");\n int txCount;\n unsigned char data[6] = { START_BYTE, USB_REQ_STATUS, 0x00, 0x00, 0x00, 0x00 };\n int result = libusb_bulk_transfer(this->device, USB_CMD_ENDPOINT, data, 6, &txCount, USB_TIMEOUT);\n if (result < 0)\n ERROR(\"Failed to get status, result = %d\", result);\n else\n DEBUG(\"Done\\n\");\n\n this->GetCMDResult(USB_REQ_STATUS);\n}\n\nvoid SSPRO::SetupFrame()\n{\n DEBUG(\"Setting up frame...\");\n int txCount;\n unsigned char data[6] = { START_BYTE, USB_REQ_SET_FRAME, 0x00, 0x00, 0x03, 0xF9 };\n int result = libusb_bulk_transfer(this->device, USB_CMD_ENDPOINT, data, 6, &txCount, USB_TIMEOUT);\n if (result < 0)\n ERROR(\"Failed to setup frame, result = %d\", result);\n else\n DEBUG(\"Done\\n\");\n\n this->GetCMDResult(USB_REQ_SET_FRAME);\n}\n\nbool SSPRO::IsConnected()\n{\n return (this->device != NULL);\n}\n\nbool SSPRO::GetCMDResult(unsigned char cmd)\n{\n DEBUG(\"Getting command result...\");\n int rxCount;\n unsigned char rxData[8];\n int result = libusb_bulk_transfer(this->device, USB_RX_ENDPOINT, rxData, sizeof(rxData), &rxCount, USB_TIMEOUT);\n if (result < 0)\n {\n ERROR(\"Failed to read command result, returned %d\", result);\n return false;\n }\n\n if (rxCount != 8)\n {\n ERROR(\"Invalid packet size, %d\", rxCount);\n return false;\n }\n\n if (rxData[0] != 0xA5)\n {\n ERROR(\"Invalid header, %d\", rxData[0]);\n return false;\n }\n\n if (rxData[2] != cmd)\n {\n ERROR(\"Mismatched command type, RX:%d vs CMD:%d\", rxData[1], cmd);\n return false;\n }\n\n switch (rxData[2])\n {\n case USB_REQ_STATUS:\n DEBUG(\"Found Status Result\\n\");\n DEBUG(\"Data: %02x, %02x, %02x, %02x, %02x, %02x, %02x, %02x\\n\",\n rxData[0], rxData[1], rxData[2], rxData[3], rxData[4], rxData[5], rxData[6], rxData[7]);\n capturing = (rxData[4] & 0x01) == 0x01;\n frameReady = (rxData[4] & 0x02) == 0x02;\n DEBUG(\"Capturing = %d, FrameReady = %d\\n\", capturing, frameReady);\n return true;\n break;\n case USB_REQ_SET_FRAME:\n DEBUG(\"Found Frame Result\\n\");\n DEBUG(\"Data: %02x, %02x, %02x, %02x, %02x, %02x, %02x, %02x\\n\",\n rxData[0], rxData[1], rxData[2], rxData[3], rxData[4], rxData[5], rxData[6], rxData[7]);\n return true;\n break;\n case USB_REQ_CAPTURE:\n DEBUG(\"Found Capture Result\\n\");\n DEBUG(\"Data: %02x, %02x, %02x, %02x, %02x, %02x, %02x, %02x\\n\",\n rxData[0], rxData[1], rxData[2], rxData[3], rxData[4], rxData[5], rxData[6], rxData[7]);\n return true;\n break;\n case USB_REQ_DOWNLOAD:\n DEBUG(\"Found Download Result\\n\");\n DEBUG(\"Data: %02x, %02x, %02x, %02x, %02x, %02x, %02x, %02x\\n\",\n rxData[0], rxData[1], rxData[2], rxData[3], rxData[4], rxData[5], rxData[6], rxData[7]);\n return true;\n break;\n case USB_REQ_ABORT:\n DEBUG(\"Found Abort Result\\n\");\n DEBUG(\"Data: %02x, %02x, %02x, %02x, %02x, %02x, %02x, %02x\\n\",\n rxData[0], rxData[1], rxData[2], rxData[3], rxData[4], rxData[5], rxData[6], rxData[7]);\n return true;\n break;\n case USB_REQ_SET_DIO:\n DEBUG(\"Found DIO Result\\n\");\n DEBUG(\"Data: %02x, %02x, %02x, %02x, %02x, %02x, %02x, %02x\\n\",\n rxData[0], rxData[1], rxData[2], rxData[3], rxData[4], rxData[5], rxData[6], rxData[7]);\n return true;\n break;\n case USB_REQ_UNKNOWN:\n DEBUG(\"Found 0x09 Result\\n\");\n DEBUG(\"Data: %02x, %02x, %02x, %02x, %02x, %02x, %02x, %02x\\n\",\n rxData[0], rxData[1], rxData[2], rxData[3], rxData[4], rxData[5], rxData[6], rxData[7]);\n return true;\n break;\n default:\n ERROR(\"Unknown command result, %d\", rxData[1]);\n break;\n }\n\n return false;\n}\n\nstruct rawImage* SSPRO::Capture(int ms)\n{\n DEBUG(\"Performing a blocking capture...\\n\");\n if (!this->StartCapture(ms))\n return NULL;\n\n \/\/ Wait capture time + 100 ms\n usleep((ms+100)*1000);\n\n \/\/ while status == busy\n while (!this->frameReady)\n {\n this->GetStatus();\n usleep(500*1000);\n }\n\n this->DownloadFrame();\n return &lastImage;\n}\n\nbool SSPRO::StartCapture(int ms)\n{\n this->SetupFrame();\n\n DEBUG(\"Starting capture...\");\n int txCount;\n unsigned char data[6] = { START_BYTE, USB_REQ_CAPTURE, 0x01, 0x04, 0x92, 0x02 }; \/\/ 120s Color 1x1 binning\n int result = libusb_bulk_transfer(this->device, USB_CMD_ENDPOINT, data, 6, &txCount, USB_TIMEOUT);\n if (result < 0)\n {\n ERROR(\"Failed to capture, result = %d\", result);\n return false;\n }\n DEBUG(\"Done\\n\");\n\n return this->GetCMDResult(USB_REQ_CAPTURE);\n}\n\nvoid SSPRO::CancelCapture()\n{\n DEBUG(\"Attempting to cancel capture...\");\n int txCount;\n unsigned char data[6] = { START_BYTE, USB_REQ_ABORT, 0x00, 0x00, 0x00, 0x00 };\n int result = libusb_bulk_transfer(this->device, USB_CMD_ENDPOINT, data, 6, &txCount, USB_TIMEOUT);\n if (result < 0)\n ERROR(\"Failed to cancel capture, result = %d\", result);\n else\n DEBUG(\"Done\\n\");\n\n this->GetCMDResult(USB_REQ_ABORT);\n}\n\nvoid SSPRO::DownloadFrame()\n{ \/\/ TODO: Check camera status before trying to download\n DEBUG(\"Requesting frame download...\");\n int txCount;\n unsigned char data[6] = { START_BYTE, USB_REQ_DOWNLOAD, 0x00, 0x00, 0x00, 0x00 };\n int result = libusb_bulk_transfer(this->device, USB_CMD_ENDPOINT, data, 6, &txCount, USB_TIMEOUT);\n if (result < 0)\n {\n ERROR(\"Failed to start download, result = %d\", result);\n return;\n }\n DEBUG(\"Done\\n\");\n\n this->GetCMDResult(USB_REQ_DOWNLOAD);\n\n DEBUG(\"Waiting for data from camera...\");\n int rxCount;\n unsigned char* rxData = (unsigned char*)malloc(BUFFER_SIZE);\n unsigned char* newImage = (unsigned char*)malloc(IMAGE_WIDTH * IMAGE_HEIGHT);\n unsigned char* pointer = newImage;\n \/\/ Loop through until we get a partial buffer of data\n do\n {\n result = libusb_bulk_transfer(this->device, USB_RX_ENDPOINT, rxData, BUFFER_SIZE, &rxCount, USB_TIMEOUT);\n if (result < 0)\n {\n ERROR(\"Failed to download image, result = %d\", result);\n free(rxData);\n return;\n }\n\n memcpy(pointer, rxData, rxCount);\n pointer += BUFFER_SIZE;\n } while (rxCount == BUFFER_SIZE);\n free(rxData);\n DEBUG(\"Done\\n\");\n\n DEBUG(\"Updating lastImage...\");\n if (lastImage.data)\n free(lastImage.data);\n lastImage.data = newImage;\n lastImage.width = IMAGE_WIDTH;\n lastImage.height = IMAGE_HEIGHT;\n DEBUG(\"Done\\n\");\n}\n\nvoid SSPRO::SetDIO()\n{\n DEBUG(\"Setting DIO...\");\n int txCount;\n unsigned char dio =0x00;\n if (fanHigh)\n dio |= 0x02;\n if (coolerOn)\n dio |= 0x01;\n unsigned char data[6] = { START_BYTE, USB_REQ_SET_DIO, dio, 0x00, 0x00, 0x00 };\n int result = libusb_bulk_transfer(this->device, USB_CMD_ENDPOINT, data, 6, &txCount, USB_TIMEOUT);\n if (result < 0)\n ERROR(\"Failed to set DIO, result = %d\", result);\n else\n DEBUG(\"Done\\n\");\n\n this->GetCMDResult(USB_REQ_SET_DIO);\n}\n\nvoid SSPRO::Init()\n{\n DEBUG(\"Initializing camera...\");\n fanHigh = false;\n coolerOn = true;\n frameReady = false;\n readoutSpeed = READOUT_FASTEST;\n DEBUG(\"Done\\n\");\n\n this->SetDIO();\n}\n<|endoftext|>"} {"text":"\/**\n * @file piper_proc.cc\n *\/\n\n#include \"config.h\"\n\n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n\n#include \"piper_proc.hh\"\n#include \"line_buffer.hh\"\n\nusing namespace std;\n\npiper_proc::piper_proc(int pipefd, bool timestamp, const char *filename)\n : pp_fd(-1), pp_timestamp(timestamp), pp_child(-1)\n{\n assert(pipefd >= 0);\n\n if (filename) {\n if ((this->pp_fd = open(filename, O_RDWR|O_CREAT|O_TRUNC, 0600)) == -1) {\n perror(\"Unable to open output file for stdin\");\n throw error(errno);\n }\n }\n else {\n char piper_tmpname[PATH_MAX];\n const char *tmpdir;\n\n if ((tmpdir = getenv(\"TMPDIR\")) == NULL) {\n tmpdir = _PATH_VARTMP;\n }\n snprintf(piper_tmpname, sizeof(piper_tmpname),\n \"%s\/lnav.piper.XXXXXX\",\n tmpdir);\n if ((this->pp_fd = mkstemp(piper_tmpname)) == -1) {\n throw error(errno);\n }\n\n unlink(piper_tmpname);\n }\n\n this->pp_child = fork();\n switch (this->pp_child) {\n case -1:\n\tthrow error(errno);\n case 0:\n\t{\n\t auto_fd infd(pipefd);\n\t line_buffer lb;\n\t off_t woff = 0;\n\t off_t off = 0;\n\t char *line;\n\t size_t len;\n\n\t lb.set_fd(infd);\n\t while ((line = lb.read_line(off, len)) != NULL) {\n int wrc;\n\n\t \tif (timestamp) {\n\t \t char time_str[64];\n\t \t struct timeval tv;\n\t \t char ms_str[8];\n\n\t \t gettimeofday(&tv, NULL);\n\t \t strftime(time_str, sizeof(time_str), \"%FT%T\", gmtime(&tv.tv_sec));\n\t \t snprintf(ms_str, sizeof(ms_str), \".%03d\", tv.tv_usec \/ 1000);\n\t \t strcat(time_str, ms_str);\n\t \t strcat(time_str, \"Z \");\n\t \t wrc = pwrite(this->pp_fd, time_str, strlen(time_str), woff);\n if (wrc == -1) {\n perror(\"Unable to write to output file for stdin\");\n break;\n }\n woff += wrc;\n\t \t}\n\n\t \tline[len] = '\\n';\n\t\t\/* Need to do pwrite here since the fd is used by the main\n\t\t * lnav process as well.\n\t\t *\/\n\t\twrc = pwrite(this->pp_fd, line, len + 1, woff);\n if (wrc == -1) {\n perror(\"Unable to write to output file for stdin\");\n break;\n }\n\t\twoff += wrc;\n\t }\n\t}\n\texit(0);\n\tbreak;\n default:\n\tbreak;\n }\n}\n\npiper_proc::~piper_proc()\n{\n if (this->pp_child > 0) {\n\tint status;\n\t\n\tkill(this->pp_child, SIGTERM);\n\twhile (waitpid(this->pp_child, &status, 0) < 0 && (errno == EINTR)) {\n\t ;\n\t}\n\n\tthis->pp_child = -1;\n }\n}\n[build] fix build issues\/**\n * @file piper_proc.cc\n *\/\n\n#include \"config.h\"\n\n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n\n#include \"piper_proc.hh\"\n#include \"line_buffer.hh\"\n\nusing namespace std;\n\npiper_proc::piper_proc(int pipefd, bool timestamp, const char *filename)\n : pp_fd(-1), pp_timestamp(timestamp), pp_child(-1)\n{\n assert(pipefd >= 0);\n\n if (filename) {\n if ((this->pp_fd = open(filename, O_RDWR|O_CREAT|O_TRUNC, 0600)) == -1) {\n perror(\"Unable to open output file for stdin\");\n throw error(errno);\n }\n }\n else {\n char piper_tmpname[PATH_MAX];\n const char *tmpdir;\n\n if ((tmpdir = getenv(\"TMPDIR\")) == NULL) {\n tmpdir = _PATH_VARTMP;\n }\n snprintf(piper_tmpname, sizeof(piper_tmpname),\n \"%s\/lnav.piper.XXXXXX\",\n tmpdir);\n if ((this->pp_fd = mkstemp(piper_tmpname)) == -1) {\n throw error(errno);\n }\n\n unlink(piper_tmpname);\n }\n\n this->pp_child = fork();\n switch (this->pp_child) {\n case -1:\n\tthrow error(errno);\n case 0:\n\t{\n\t auto_fd infd(pipefd);\n\t line_buffer lb;\n\t off_t woff = 0;\n\t off_t off = 0;\n\t char *line;\n\t size_t len;\n\n\t lb.set_fd(infd);\n\t while ((line = lb.read_line(off, len)) != NULL) {\n int wrc;\n\n\t \tif (timestamp) {\n\t \t char time_str[64];\n\t \t struct timeval tv;\n\t \t char ms_str[8];\n\n\t \t gettimeofday(&tv, NULL);\n\t \t strftime(time_str, sizeof(time_str), \"%FT%T\", gmtime(&tv.tv_sec));\n\t \t snprintf(ms_str, sizeof(ms_str), \".%03d\", (int)(tv.tv_usec \/ 1000));\n\t \t strcat(time_str, ms_str);\n\t \t strcat(time_str, \"Z \");\n\t \t wrc = pwrite(this->pp_fd, time_str, strlen(time_str), woff);\n if (wrc == -1) {\n perror(\"Unable to write to output file for stdin\");\n break;\n }\n woff += wrc;\n\t \t}\n\n\t \tline[len] = '\\n';\n\t\t\/* Need to do pwrite here since the fd is used by the main\n\t\t * lnav process as well.\n\t\t *\/\n\t\twrc = pwrite(this->pp_fd, line, len + 1, woff);\n if (wrc == -1) {\n perror(\"Unable to write to output file for stdin\");\n break;\n }\n\t\twoff += wrc;\n\t }\n\t}\n\texit(0);\n\tbreak;\n default:\n\tbreak;\n }\n}\n\npiper_proc::~piper_proc()\n{\n if (this->pp_child > 0) {\n\tint status;\n\t\n\tkill(this->pp_child, SIGTERM);\n\twhile (waitpid(this->pp_child, &status, 0) < 0 && (errno == EINTR)) {\n\t ;\n\t}\n\n\tthis->pp_child = -1;\n }\n}\n<|endoftext|>"} {"text":"#include \"qnodeview.h\"\n\n#include \n\n#include \"graphicsnode.hpp\"\n\n#include \"qreactiveproxymodel.h\"\n#include \"graphicsnodescene.hpp\"\n#include \"graphicsnodesocket.hpp\"\n\n#include \"qnodeeditorsocketmodel.h\"\n\nclass QNodeViewPrivate final : public QObject\n{\npublic:\n explicit QNodeViewPrivate(QObject* p) : QObject(p) {}\n\n QReactiveProxyModel m_Proxy {this };\n QAbstractItemModel* m_pModel {Q_NULLPTR};\n QVector m_lNodes { };\n GraphicsNodeScene m_Scene {this };\n QNodeEditorSocketModel* m_pFactory{Q_NULLPTR};\n};\n\nQNodeView::QNodeView(QWidget* parent) : GraphicsNodeView(parent),\n d_ptr(new QNodeViewPrivate(this))\n{\n d_ptr->m_pFactory = new QNodeEditorSocketModel(&d_ptr->m_Proxy, &d_ptr->m_Scene);\n\n m_pModel = d_ptr->m_pFactory; \/\/HACK to remove\n\n d_ptr->m_Scene.setSceneRect(-9999, -9999, 9999, 9999);\n setScene(&d_ptr->m_Scene);\n}\n\nQNodeView::~QNodeView()\n{\n delete d_ptr;\n}\n\nGraphicsNodeScene* QNodeView::scene() const\n{\n return &d_ptr->m_Scene;\n}\n\nvoid QNodeView::setModel(QAbstractItemModel* m)\n{\n d_ptr->m_pModel = m;\n d_ptr->m_Proxy.setSourceModel(m);\n}\n\nGraphicsNode* QNodeView::getNode(const QModelIndex& idx) const\n{\n if (!idx.isValid())\n return Q_NULLPTR;\n\n const auto factoryIdx = d_ptr->m_pFactory->mapFromSource(\n d_ptr->m_Proxy.mapFromSource(idx)\n );\n\n Q_ASSERT(factoryIdx.isValid());\n\n return d_ptr->m_pFactory->getNode(factoryIdx);\n}\n\nQReactiveProxyModel* QNodeView::reactiveModel() const\n{\n return &d_ptr->m_Proxy;\n}\n\nQAbstractItemModel *QNodeView::sinkSocketModel(const QModelIndex& node) const\n{\n return d_ptr->m_pFactory->sinkSocketModel(node);\n}\n\nQAbstractItemModel *QNodeView::sourceSocketModel(const QModelIndex& node) const\n{\n return d_ptr->m_pFactory->sourceSocketModel(node);\n}\n\nQAbstractItemModel* QNodeView::edgeModel() const\n{\n return d_ptr->m_pFactory->edgeModel();\n}\nqnodeview: Do not set the view size#include \"qnodeview.h\"\n\n#include \n\n#include \"graphicsnode.hpp\"\n\n#include \"qreactiveproxymodel.h\"\n#include \"graphicsnodescene.hpp\"\n#include \"graphicsnodesocket.hpp\"\n\n#include \"qnodeeditorsocketmodel.h\"\n\nclass QNodeViewPrivate final : public QObject\n{\npublic:\n explicit QNodeViewPrivate(QObject* p) : QObject(p) {}\n\n QReactiveProxyModel m_Proxy {this };\n QAbstractItemModel* m_pModel {Q_NULLPTR};\n QVector m_lNodes { };\n GraphicsNodeScene m_Scene {this };\n QNodeEditorSocketModel* m_pFactory{Q_NULLPTR};\n};\n\nQNodeView::QNodeView(QWidget* parent) : GraphicsNodeView(parent),\n d_ptr(new QNodeViewPrivate(this))\n{\n d_ptr->m_pFactory = new QNodeEditorSocketModel(&d_ptr->m_Proxy, &d_ptr->m_Scene);\n\n m_pModel = d_ptr->m_pFactory; \/\/HACK to remove\n\n setScene(&d_ptr->m_Scene);\n}\n\nQNodeView::~QNodeView()\n{\n delete d_ptr;\n}\n\nGraphicsNodeScene* QNodeView::scene() const\n{\n return &d_ptr->m_Scene;\n}\n\nvoid QNodeView::setModel(QAbstractItemModel* m)\n{\n d_ptr->m_pModel = m;\n d_ptr->m_Proxy.setSourceModel(m);\n}\n\nGraphicsNode* QNodeView::getNode(const QModelIndex& idx) const\n{\n if (!idx.isValid())\n return Q_NULLPTR;\n\n const auto factoryIdx = d_ptr->m_pFactory->mapFromSource(\n d_ptr->m_Proxy.mapFromSource(idx)\n );\n\n Q_ASSERT(factoryIdx.isValid());\n\n return d_ptr->m_pFactory->getNode(factoryIdx);\n}\n\nQReactiveProxyModel* QNodeView::reactiveModel() const\n{\n return &d_ptr->m_Proxy;\n}\n\nQAbstractItemModel *QNodeView::sinkSocketModel(const QModelIndex& node) const\n{\n return d_ptr->m_pFactory->sinkSocketModel(node);\n}\n\nQAbstractItemModel *QNodeView::sourceSocketModel(const QModelIndex& node) const\n{\n return d_ptr->m_pFactory->sourceSocketModel(node);\n}\n\nQAbstractItemModel* QNodeView::edgeModel() const\n{\n return d_ptr->m_pFactory->edgeModel();\n}\n<|endoftext|>"} {"text":"\/\/ Copyright (c) 2010 Satoshi Nakamoto\n\/\/ Copyright (c) 2009-2014 The Bitcoin 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 \"amount.h\"\n#include \"chainparams.h\"\n#include \"core_io.h\"\n#include \"init.h\"\n#include \"net.h\"\n#include \"main.h\"\n#include \"pow.h\"\n#include \"rpcserver.h\"\n#include \"util.h\"\n#ifdef ENABLE_WALLET\n#include \"db.h\"\n#include \"wallet.h\"\n#endif\n\n#include \n\n#include \n\n#include \"json\/json_spirit_utils.h\"\n#include \"json\/json_spirit_value.h\"\n\nusing namespace json_spirit;\nusing namespace std;\n\n\/**\n * Return average network hashes per second based on the last 'lookup' blocks,\n * or from the last difficulty change if 'lookup' is nonpositive.\n * If 'height' is nonnegative, compute the estimate at the time when a given block was found.\n *\/\nValue GetNetworkHashPS(int lookup, int height) {\n CBlockIndex *pb = chainActive.Tip();\n\n if (height >= 0 && height < chainActive.Height())\n pb = chainActive[height];\n\n if (pb == NULL || !pb->nHeight)\n return 0;\n\n \/\/ If lookup is -1, then use blocks since last difficulty change.\n if (lookup <= 0)\n lookup = pb->nHeight % 2016 + 1;\n\n \/\/ If lookup is larger than chain, then set it to chain length.\n if (lookup > pb->nHeight)\n lookup = pb->nHeight;\n\n CBlockIndex *pb0 = pb;\n int64_t minTime = pb0->GetBlockTime();\n int64_t maxTime = minTime;\n for (int i = 0; i < lookup; i++) {\n pb0 = pb0->pprev;\n int64_t time = pb0->GetBlockTime();\n minTime = std::min(time, minTime);\n maxTime = std::max(time, maxTime);\n }\n\n \/\/ In case there's a situation where minTime == maxTime, we don't want a divide by zero exception.\n if (minTime == maxTime)\n return 0;\n\n uint256 workDiff = pb->nChainWork - pb0->nChainWork;\n int64_t timeDiff = maxTime - minTime;\n\n return (int64_t)(workDiff.getdouble() \/ timeDiff);\n}\n\nValue getnetworkhashps(const Array& params, bool fHelp)\n{\n if (fHelp || params.size() > 2)\n throw runtime_error(\n \"getnetworkhashps ( blocks height )\\n\"\n \"\\nReturns the estimated network hashes per second based on the last n blocks.\\n\"\n \"Pass in [blocks] to override # of blocks, -1 specifies since last difficulty change.\\n\"\n \"Pass in [height] to estimate the network speed at the time when a certain block was found.\\n\"\n \"\\nArguments:\\n\"\n \"1. blocks (numeric, optional, default=120) The number of blocks, or -1 for blocks since last difficulty change.\\n\"\n \"2. height (numeric, optional, default=-1) To estimate at the time of the given height.\\n\"\n \"\\nResult:\\n\"\n \"x (numeric) Hashes per second estimated\\n\"\n \"\\nExamples:\\n\"\n + HelpExampleCli(\"getnetworkhashps\", \"\")\n + HelpExampleRpc(\"getnetworkhashps\", \"\")\n );\n\n return GetNetworkHashPS(params.size() > 0 ? params[0].get_int() : 120, params.size() > 1 ? params[1].get_int() : -1);\n}\n\n#ifdef ENABLE_WALLET\nValue getgenerate(const Array& params, bool fHelp)\n{\n if (fHelp || params.size() != 0)\n throw runtime_error(\n \"getgenerate\\n\"\n \"\\nReturn if the server is set to generate coins or not. The default is false.\\n\"\n \"It is set with the command line argument -gen (or bata.conf setting gen)\\n\"\n \"It can also be set with the setgenerate call.\\n\"\n \"\\nResult\\n\"\n \"true|false (boolean) If the server is set to generate coins or not\\n\"\n \"\\nExamples:\\n\"\n + HelpExampleCli(\"getgenerate\", \"\")\n + HelpExampleRpc(\"getgenerate\", \"\")\n );\n\n return GetBoolArg(\"-gen\", false);\n}\n\n\nValue setgenerate(const Array& params, bool fHelp)\n{\n if (fHelp || params.size() < 1 || params.size() > 2)\n throw runtime_error(\n \"setgenerate generate ( genproclimit )\\n\"\n \"\\nSet 'generate' true or false to turn generation on or off.\\n\"\n \"Generation is limited to 'genproclimit' processors, -1 is unlimited.\\n\"\n \"See the getgenerate call for the current setting.\\n\"\n \"\\nArguments:\\n\"\n \"1. generate (boolean, required) Set to true to turn on generation, off to turn off.\\n\"\n \"2. genproclimit (numeric, optional) Set the processor limit for when generation is on. Can be -1 for unlimited.\\n\"\n \" Note: in -regtest mode, genproclimit controls how many blocks are generated immediately.\\n\"\n \"\\nResult\\n\"\n \"[ blockhashes ] (array, -regtest only) hashes of blocks generated\\n\"\n \"\\nExamples:\\n\"\n \"\\nSet the generation on with a limit of one processor\\n\"\n + HelpExampleCli(\"setgenerate\", \"true 1\") +\n \"\\nCheck the setting\\n\"\n + HelpExampleCli(\"getgenerate\", \"\") +\n \"\\nTurn off generation\\n\"\n + HelpExampleCli(\"setgenerate\", \"false\") +\n \"\\nUsing json rpc\\n\"\n + HelpExampleRpc(\"setgenerate\", \"true, 1\")\n );\n\n if (pwalletMain == NULL)\n throw JSONRPCError(RPC_METHOD_NOT_FOUND, \"Method not found (disabled)\");\n\n bool fGenerate = true;\n if (params.size() > 0)\n fGenerate = params[0].get_bool();\n\n int nGenProcLimit = -1;\n if (params.size() > 1)\n {\n nGenProcLimit = params[1].get_int();\n if (nGenProcLimit == 0)\n fGenerate = false;\n }\n\n \/\/ -regtest mode: don't return until nGenProcLimit blocks are generated\n if (fGenerate && Params().MineBlocksOnDemand())\n {\n int nHeightStart = 0;\n int nHeightEnd = 0;\n int nHeight = 0;\n int nGenerate = (nGenProcLimit > 0 ? nGenProcLimit : 1);\n CReserveKey reservekey(pwalletMain);\n\n { \/\/ Don't keep cs_main locked\n LOCK(cs_main);\n nHeightStart = chainActive.Height();\n nHeight = nHeightStart;\n nHeightEnd = nHeightStart+nGenerate;\n }\n unsigned int nExtraNonce = 0;\n Array blockHashes;\n while (nHeight < nHeightEnd)\n {\n auto_ptr pblocktemplate(CreateNewBlockWithKey(reservekey));\n if (!pblocktemplate.get())\n throw JSONRPCError(RPC_INTERNAL_ERROR, \"Wallet keypool empty\");\n CBlock *pblock = &pblocktemplate->block;\n {\n LOCK(cs_main);\n IncrementExtraNonce(pblock, chainActive.Tip(), nExtraNonce);\n }\n while (!CheckProofOfWork(pblock->GetPoWHash(), pblock->nBits)) {\n \/\/ Yes, there is a chance every nonce could fail to satisfy the -regtest\n \/\/ target -- 1 in 2^(2^32). That ain't gonna happen.\n ++pblock->nNonce;\n }\n CValidationState state;\n if (!ProcessNewBlock(state, NULL, pblock))\n throw JSONRPCError(RPC_INTERNAL_ERROR, \"ProcessNewBlock, block not accepted\");\n ++nHeight;\n blockHashes.push_back(pblock->GetHash().GetHex());\n }\n return blockHashes;\n }\n else \/\/ Not -regtest: start generate thread, return immediately\n {\n mapArgs[\"-gen\"] = (fGenerate ? \"1\" : \"0\");\n mapArgs [\"-genproclimit\"] = itostr(nGenProcLimit);\n GenerateBitcoins(fGenerate, pwalletMain, nGenProcLimit);\n }\n\n return Value::null;\n}\n\nValue gethashespersec(const Array& params, bool fHelp)\n{\n if (fHelp || params.size() != 0)\n throw runtime_error(\n \"gethashespersec\\n\"\n \"\\nReturns a recent hashes per second performance measurement while generating.\\n\"\n \"See the getgenerate and setgenerate calls to turn generation on and off.\\n\"\n \"\\nResult:\\n\"\n \"n (numeric) The recent hashes per second when generation is on (will return 0 if generation is off)\\n\"\n \"\\nExamples:\\n\"\n + HelpExampleCli(\"gethashespersec\", \"\")\n + HelpExampleRpc(\"gethashespersec\", \"\")\n );\n\n if (GetTimeMillis() - nHPSTimerStart > 8000)\n return (int64_t)0;\n return (int64_t)dHashesPerSec;\n}\n#endif\n\n\nValue getmininginfo(const Array& params, bool fHelp)\n{\n if (fHelp || params.size() != 0)\n throw runtime_error(\n \"getmininginfo\\n\"\n \"\\nReturns a json object containing mining-related information.\"\n \"\\nResult:\\n\"\n \"{\\n\"\n \" \\\"blocks\\\": nnn, (numeric) The current block\\n\"\n \" \\\"currentblocksize\\\": nnn, (numeric) The last block size\\n\"\n \" \\\"currentblocktx\\\": nnn, (numeric) The last block transaction\\n\"\n \" \\\"difficulty\\\": xxx.xxxxx (numeric) The current difficulty\\n\"\n \" \\\"errors\\\": \\\"...\\\" (string) Current errors\\n\"\n \" \\\"generate\\\": true|false (boolean) If the generation is on or off (see getgenerate or setgenerate calls)\\n\"\n \" \\\"genproclimit\\\": n (numeric) The processor limit for generation. -1 if no generation. (see getgenerate or setgenerate calls)\\n\"\n \" \\\"hashespersec\\\": n (numeric) The hashes per second of the generation, or 0 if no generation.\\n\"\n \" \\\"pooledtx\\\": n (numeric) The size of the mem pool\\n\"\n \" \\\"testnet\\\": true|false (boolean) If using testnet or not\\n\"\n \" \\\"chain\\\": \\\"xxxx\\\", (string) current network name as defined in BIP70 (main, test, regtest)\\n\"\n \"}\\n\"\n \"\\nExamples:\\n\"\n + HelpExampleCli(\"getmininginfo\", \"\")\n + HelpExampleRpc(\"getmininginfo\", \"\")\n );\n\n Object obj;\n obj.push_back(Pair(\"blocks\", (int)chainActive.Height()));\n obj.push_back(Pair(\"currentblocksize\", (uint64_t)nLastBlockSize));\n obj.push_back(Pair(\"currentblocktx\", (uint64_t)nLastBlockTx));\n obj.push_back(Pair(\"difficulty\", (double)GetDifficulty()));\n obj.push_back(Pair(\"errors\", GetWarnings(\"statusbar\")));\n obj.push_back(Pair(\"genproclimit\", (int)GetArg(\"-genproclimit\", -1)));\n obj.push_back(Pair(\"networkhashps\", getnetworkhashps(params, false)));\n obj.push_back(Pair(\"pooledtx\", (uint64_t)mempool.size()));\n obj.push_back(Pair(\"testnet\", Params().TestnetToBeDeprecatedFieldRPC()));\n obj.push_back(Pair(\"chain\", Params().NetworkIDString()));\n#ifdef ENABLE_WALLET\n obj.push_back(Pair(\"generate\", getgenerate(params, false)));\n obj.push_back(Pair(\"hashespersec\", gethashespersec(params, false)));\n#endif\n return obj;\n}\n\n\n\/\/ NOTE: Unlike wallet RPC (which use BTC values), mining RPCs follow GBT (BIP 22) in using satoshi amounts\nValue prioritisetransaction(const Array& params, bool fHelp)\n{\n if (fHelp || params.size() != 3)\n throw runtime_error(\n \"prioritisetransaction \\n\"\n \"Accepts the transaction into mined blocks at a higher (or lower) priority\\n\"\n \"\\nArguments:\\n\"\n \"1. \\\"txid\\\" (string, required) The transaction id.\\n\"\n \"2. priority delta (numeric, required) The priority to add or subtract.\\n\"\n \" The transaction selection algorithm considers the tx as it would have a higher priority.\\n\"\n \" (priority of a transaction is calculated: coinage * value_in_satoshis \/ txsize) \\n\"\n \"3. fee delta (numeric, required) The fee value (in satoshis) to add (or subtract, if negative).\\n\"\n \" The fee is not actually paid, only the algorithm for selecting transactions into a block\\n\"\n \" considers the transaction as it would have paid a higher (or lower) fee.\\n\"\n \"\\nResult\\n\"\n \"true (boolean) Returns true\\n\"\n \"\\nExamples:\\n\"\n + HelpExampleCli(\"prioritisetransaction\", \"\\\"txid\\\" 0.0 10000\")\n + HelpExampleRpc(\"prioritisetransaction\", \"\\\"txid\\\", 0.0, 10000\")\n );\n\n uint256 hash = ParseHashStr(params[0].get_str(), \"txid\");\n\n CAmount nAmount = params[2].get_int64();\n\n mempool.PrioritiseTransaction(hash, params[0].get_str(), params[1].get_real(), nAmount);\n return true;\n}\n\n\n\/\/ NOTE: Assumes a conclusive result; if result is inconclusive, it must be handled by caller\nstatic Value BIP22ValidationResult(const CValidationState& state)\n{\n if (state.IsValid())\n return Value::null;\n\n std::string strRejectReason = state.GetRejectReason();\n if (state.IsError())\n throw JSONRPCError(RPC_VERIFY_ERROR, strRejectReason);\n if (state.IsInvalid())\n {\n if (strRejectReason.empty())\n return \"rejected\";\n return strRejectReason;\n }\n \/\/ Should be impossible\n return \"valid?\";\n}\n\nValue getblocktemplate(const Array& params, bool fHelp)\n{\n if (fHelp || params.size() > 1)\n throw runtime_error(\n \"getblocktemplate ( \\\"jsonrequestobject\\\" )\\n\"\n \"\\nIf the request parameters include a 'mode' key, that is used to explicitly select between the default 'template' request or a 'proposal'.\\n\"\n \"It returns data needed to construct a block to work on.\\n\"\n \"See https:\/\/en.bitcoin.it\/wiki\/BIP_0022 for full specification.\\n\"\n\n \"\\nArguments:\\n\"\n \"1. \\\"jsonrequestobject\\\" (string, optional) A json object in the following spec\\n\"\n \" {\\n\"\n \" \\\"mode\\\":\\\"template\\\" (string, optional) This must be set to \\\"template\\\" or omitted\\n\"\n \" \\\"capabilities\\\":[ (array, optional) A list of strings\\n\"\n \" \\\"support\\\" (string) client side supported feature, 'longpoll', 'coinbasetxn', 'coinbasevalue', 'proposal', 'serverlist', 'workid'\\n\"\n \" ,...\\n\"\n \" ]\\n\"\n \" }\\n\"\n \"\\n\"\n\n \"\\nResult:\\n\"\n \"{\\n\"\n \" \\\"version\\\" : n, (numeric) The block version\\n\"\n \" \\\"previousblockhash\\\" : \\\"xxxx\\\", (string) The hash of current highest block\\n\"\n \" \\\"transactions\\\" : [ (array) contents of non-coinbase transactions that should be included in the next block\\n\"\n \" {\\n\"\n \" \\\"data\\\" : \\\"xxxx\\\", (string) transaction data encoded in hexadecimal (byte-for-byte)\\n\"\n \" \\\"hash\\\" : \\\"xxxx\\\", (string) hash\/id encoded in little-endian hexadecimal\\n\"\n \" \\\"depends\\\" : [ (array) array of numbers \\n\"\n \" n (numeric) transactions before this one (by 1-based index in 'transactions' list) that must be present in the final block if this one is\\n\"\n \" ,...\\n\"\n \" ],\\n\"\n \" \\\"fee\\\": n, (numeric) difference in value between transaction inputs and outputs (in Satoshis); for coinbase transactions, this is a negative Number of the total collected block fees (ie, not including the block subsidy); if key is not present, fee is unknown and clients MUST NOT assume there isn't one\\n\"\n \" \\\"sigops\\\" : n, (numeric) total number of SigOps, as counted for purposes of block limits; if key is not present, sigop count is unknown and clients MUST NOT assume there aren't any\\n\"\n \" \\\"required\\\" : true|false (boolean) if provided and true, this transaction must be in the final block\\n\"\n \" }\\n\"\n \" ,...\\n\"\n \" ],\\n\"\n \" \\\"coinbaseaux\\\" : { (json object) data that should be included in the coinbase's scriptSig content\\n\"\n \" \\\"flags\\\" : \\\"flags\\\" (string) \\n\"\n \" },\\n\"\n \" \\\"coinbasevalue\\\" : n, (numeric) maximum allowable input to coinbase transaction, including the generation award and transaction fees (in Satoshis)\\n\"\n \" \\\"coinbasetxn\\\" : { ... }, (json object) information for coinbase transaction\\n\"\n \" \\\"target\\\" : \\\"xxxx\\\", (string) The hash target\\n\"\n \" \\\"mintime\\\" : xxx, (numeric) The minimum timestamp appropriate for next block time in seconds since epoch (Jan 1 1970 GMT)\\n\"\n \" \\\"mutable\\\" : [ (array of string) list of ways the block template may be changed \\n\"\n \" \\\"value\\\" (string) A way the block template may be changed, e.g. 'time', 'transactions', 'prevblock'\\n\"\n \" ,...\\n\"\n \" ],\\n\"\n \" \\\"noncerange\\\" : \\\"00000000ffffffff\\\", (string) A range of valid nonces\\n\"\n \" \\\"sigoplimit\\\" : n, (numeric) limit of sigops in blocks\\n\"\n \" \\\"sizelimit\\\" : n, (numeric) limit of block size\\n\"\n \" \\\"curtime\\\" : ttt, (numeric) current timestamp in seconds since epoch (Jan 1 1970 GMT)\\n\"\n \" \\\"bits\\\" : \\\"xxx\\\", (string) compressed target of next block\\n\"\n \" \\\"height\\\" : n (numeric) The height of the next block\\n\"\n \"}\\n\"\n\n \"\\nExamples:\\n\"\n + HelpExampleCli(\"getblocktemplate\", \"\")\n + HelpExampleRpc(\"getblocktemplate\", \"\")\n );\n\n std::string strMode = \"template\";\n Value lpval = Value::null;\n if (params.size() > 0)\n {\n const Object& oparam = params[0].get_obj();\n const Value& modeval = find_value(oparam, \"mode\");\n if (modeval.type() == str_type)\n strMode = modeval.get_str();\n else if (modeval.type() == null_type)\n {\n \/* Do nothing *\/\n }\n else\n throw JSONRPCError(RPC_INVALID_PARAMETER, \"Invalid mode\");\n lpval = find_value(oparam, \"longpollid\");\n\n if (strMode == \"proposal\")\n {\n const Value& dataval = find_value(oparam, \"data\");\n if (dataval.type() != str_type)\n throw JSONRPCError(RPC_TYPE_ERROR, \"Missing data String key for proposal\");\n\n CBlock block;\n if (!DecodeHexBlk(block, dataval.get_str()))\n throw JSONRPCError(RPC_DESERIALIZATION_ERROR, \"Block decode failed\");\n\n uint256 hash = block.GetHash();\n BlockMap::iterator mi = mapBlockIndex.find(hash);\n if (mi != mapBlockIndex.end()) {\n CBlockIndex *pindex = mi->second;\n if (pindex->IsValid(BLOCK_VALID_SCRIPTS))\n return \"duplicate\";\n if (pindex->nStatus & BLOCK_FAILED_MASK)\n return \"duplicate-invalid\";\n return \"duplicate-inconclusive\";\n }\n\n CBlockIndex* const pindexPrev = chainActive.Tip();\n \/\/ TestBlockValidity only supports blocks built on the current Tip\n if (block.hashPrevBlock != pindexPrev->GetBlockHash())\n return \"inconclusive-not-best-prevblk\";\n CValidationState state;\n TestBlockValidity(state, block, pindexPrev, false, true);\n return BIP22ValidationResult(state);\n }\n }\n\n if (strMode != \"template\")\n throw JSONRPCError(RPC_INVALID_PARAMETER, \"Invalid mode\");\n\n if (vNodes.empty())\n throw JSONRPCError(RPC_CLIENT_NOT_CONNECTED, \"Bata is not connected!\");\n\n if (IsInitialBlockDownload())\n throw JSONRPCError(RPC_CLIENT_IN_INITIAL_DOWNLOAD, \"Bata is downloading blocks...\");\n\n static unsigned int nTransactionsUpdatedLast;\n\n if (lpval.type() != null_type)\n {\n \/\/ Wait to respond until either the best block changes, OR a minute has passed and there are more transactions\n uint256 hashWatchedChain;\n boost::system_time checktxtime;\n unsigned int nTransactionsUpdatedLastLP;\n\n if (lpval.type() == str_type)\n {\n \/\/ Format: \n std::string lpstr = lpval.get_str();\n\n hashWatchedChain.SetHex(lpstr.substr(0, 64));\n nTransactionsUpdatedLastLP = atoi64(lpstr.substr(64));\n }\n else\n {\n \/\/ NOTE: Spec does not specify behaviour for non-string longpollid, but this makes testing easier\n hashWatchedChain = chainActive.Tip()->GetBlockHash();\n nTransactionsUpdatedLastLP = nTransactionsUpdatedLast;\n }\n\n \/\/ Release the wallet and main lock while waiting\n#ifdef ENABLE_WALLET\n if(pwalletMain)\n LEAVE_CRITICAL_SECTION(pwalletMain->cs_wallet);\n#endif\n LEAVE_CRITICAL_SECTION(cs_main);\n {\n checktxtime = boost::get_system_time() + boost::posix_time::minutes(1);\n\n boost::unique_lock lock(csBestBlock);\n while (chainActive.Tip()->GetBlockHash() == hashWatchedChain && IsRPCRunning())\n {\n if (!cvBlockChange.timed_wait(lock, checktxtime))\n {\n \/\/ Timeout: Check transactions for update\n if (mempool.GetTransactionsUpdated() != nTransactionsUpdatedLastLP)\n break;\n checktxtime += boost::posix_time::seconds(10);\n }\n }\n }\n ENTER_CRITICAL_SECTION(cs_main);\n#ifdef ENABLE_WALLET\n if(pwalletMain)\n ENTER_CRITICAL_SECTION(pwalletMain->cs_wallet);\n#endif\n\n if (!IsRPCRunning())\n throw JSONRPCError(RPC_CLIENT_NOT_CONNECTED, \"Shutting down\");\n \/\/ TODO: Maybe recheck connections\/IBD and (if something wrong) send an expires-immediately template to stop miners?\n }\n\n \/\/ Update block\n static CBlockIndex* pindexPrev;\n static int64_t nStart;\n static CBlockTemplate* pblocktemplate;\n if (pindexPrev != chainActive.Tip() ||\n (mempool.GetTransactionsUpdated() != nTransactionsUpdatedLast && GetTime() - nStart > 5))\n {\n \/\/ Clear pindexPrev so future calls make a new block, despite any failures from here on\n pindexPrev = NULL;\n\n \/\/ Store the pindexBest used before CreateNewBlock, to avoid races\n nTransactionsUpdatedLast = mempool.GetTransactionsUpdated();\n CBlockIndex* pindexPrevNew = chainActive.Tip();\n nStart = GetTime();\n\n \/\/ Create new block\n if(pblocktemplate)\n {\n delete pblocktemplate;\n pblocktemplate = NULL;\n }\n CScript scriptDummy = CScript() << OP_TRUE;\n pblocktemplate = CreateNewBlock(scriptDummy);\n if (!pblocktemplate)\n throw JSONRPCError(RPC_OUT_OF_MEMORY, \"Out of memory\");\n\n \/\/ Need to update only after we know CreateNewBlock succeeded\n pindexPrev = pindexPrevNew;\n }\n CBlock* pblock = &pblocktemplate->block; \/\/ pointer for convenience\n\n \/\/ Update nTime\n UpdateTime(pblock, pindexPrev);\n pblock->nNonce = 0;\n\n static const Array aCaps = boost::assign::list_of(\"proposal\");\n\n Array transactions;\n map setTxIndex;\n int i = 0;\n BOOST_FOREACH (CTransaction& tx, pblock->vtx)\n {\n uint256 txHash = tx.GetHash();\n setTxIndex[txHash] = i++;\n\n if (tx.IsCoinBase())\n continue;\n\n Object entry;\n\n entry.push_back(Pair(\"data\", EncodeHexTx(tx)));\n\n entry.push_back(Pair(\"hash\", txHash.GetHex()));\n\n Array deps;\n BOOST_FOREACH (const CTxIn &in, tx.vin)\n {\n if (setTxIndex.count(in.prevout.hash))\n deps.push_back(setTxIndex[in.prevout.hash]);\n }\n entry.push_back(Pair(\"depends\", deps));\n\n int index_in_template = i - 1;\n entry.push_back(Pair(\"fee\", pblocktemplate->vTxFees[index_in_template]));\n entry.push_back(Pair(\"sigops\", pblocktemplate->vTxSigOps[index_in_template]));\n\n transactions.push_back(entry);\n }\n\n Object aux;\n aux.push_back(Pair(\"flags\", HexStr(COINBASE_FLAGS.begin(), COINBASE_FLAGS.end())));\n\n uint256 hashTarget = uint256().SetCompact(pblock->nBits);\n\n static Array aMutable;\n if (aMutable.empty())\n {\n aMutable.push_back(\"time\");\n aMutable.push_back(\"transactions\");\n aMutable.push_back(\"prevblock\");\n }\n\n Object result;\n result.push_back(Pair(\"capabilities\", aCaps));\n result.push_back(Pair(\"version\", pblock->nVersion));\n result.push_back(Pair(\"previousblockhash\", pblock->hashPrevBlock.GetHex()));\n result.push_back(Pair(\"transactions\", transactions));\n result.push_back(Pair(\"coinbaseaux\", aux));\n result.push_back(Pair(\"coinbasevalue\", (int64_t)pblock->vtx[0].vout[0].nValue));\n result.push_back(Pair(\"longpollid\", chainActive.Tip()->GetBlockHash().GetHex() + i64tostr(nTransactionsUpdatedLast)));\n result.push_back(Pair(\"target\", hashTarget.GetHex()));\n result.push_back(Pair(\"mintime\", (int64_t)pindexPrev->GetMedianTimePast()+1));\n result.push_back(Pair(\"mutable\", aMutable));\n result.push_back(Pair(\"noncerange\", \"00000000ffffffff\"));\n result.push_back(Pair(\"sigoplimit\", (int64_t)MAX_BLOCK_SIGOPS));\n result.push_back(Pair(\"sizelimit\", (int64_t)MAX_BLOCK_SIZE));\n result.push_back(Pair(\"curtime\", pblock->GetBlockTime()));\n result.push_back(Pair(\"bits\", strprintf(\"%08x\", pblock->nBits)));\n result.push_back(Pair(\"height\", (int64_t)(pindexPrev->nHeight+1)));\n\n return result;\n}\n\nclass submitblock_StateCatcher : public CValidationInterface\n{\npublic:\n uint256 hash;\n bool found;\n CValidationState state;\n\n submitblock_StateCatcher(const uint256 &hashIn) : hash(hashIn), found(false), state() {};\n\nprotected:\n virtual void BlockChecked(const CBlock& block, const CValidationState& stateIn) {\n if (block.GetHash() != hash)\n return;\n found = true;\n state = stateIn;\n };\n};\n\nValue submitblock(const Array& params, bool fHelp)\n{\n if (fHelp || params.size() < 1 || params.size() > 2)\n throw runtime_error(\n \"submitblock \\\"hexdata\\\" ( \\\"jsonparametersobject\\\" )\\n\"\n \"\\nAttempts to submit new block to network.\\n\"\n \"The 'jsonparametersobject' parameter is currently ignored.\\n\"\n \"See https:\/\/en.bitcoin.it\/wiki\/BIP_0022 for full specification.\\n\"\n\n \"\\nArguments\\n\"\n \"1. \\\"hexdata\\\" (string, required) the hex-encoded block data to submit\\n\"\n \"2. \\\"jsonparametersobject\\\" (string, optional) object of optional parameters\\n\"\n \" {\\n\"\n \" \\\"workid\\\" : \\\"id\\\" (string, optional) if the server provided a workid, it MUST be included with submissions\\n\"\n \" }\\n\"\n \"\\nResult:\\n\"\n \"\\nExamples:\\n\"\n + HelpExampleCli(\"submitblock\", \"\\\"mydata\\\"\")\n + HelpExampleRpc(\"submitblock\", \"\\\"mydata\\\"\")\n );\n\n CBlock block;\n if (!DecodeHexBlk(block, params[0].get_str()))\n throw JSONRPCError(RPC_DESERIALIZATION_ERROR, \"Block decode failed\");\n\n uint256 hash = block.GetHash();\n bool fBlockPresent = false;\n {\n LOCK(cs_main);\n BlockMap::iterator mi = mapBlockIndex.find(hash);\n if (mi != mapBlockIndex.end()) {\n CBlockIndex *pindex = mi->second;\n if (pindex->IsValid(BLOCK_VALID_SCRIPTS))\n return \"duplicate\";\n if (pindex->nStatus & BLOCK_FAILED_MASK)\n return \"duplicate-invalid\";\n \/\/ Otherwise, we might only have the header - process the block before returning\n fBlockPresent = true;\n }\n }\n\n CValidationState state;\n submitblock_StateCatcher sc(block.GetHash());\n RegisterValidationInterface(&sc);\n bool fAccepted = ProcessNewBlock(state, NULL, &block);\n UnregisterValidationInterface(&sc);\n if (fBlockPresent)\n {\n if (fAccepted && !sc.found)\n return \"duplicate-inconclusive\";\n return \"duplicate\";\n }\n if (fAccepted)\n {\n if (!sc.found)\n return \"inconclusive\";\n state = sc.state;\n }\n return BIP22ValidationResult(state);\n}\n\nValue estimatefee(const Array& params, bool fHelp)\n{\n if (fHelp || params.size() != 1)\n throw runtime_error(\n \"estimatefee nblocks\\n\"\n \"\\nEstimates the approximate fee per kilobyte\\n\"\n \"needed for a transaction to begin confirmation\\n\"\n \"within nblocks blocks.\\n\"\n \"\\nArguments:\\n\"\n \"1. nblocks (numeric)\\n\"\n \"\\nResult:\\n\"\n \"n : (numeric) estimated fee-per-kilobyte\\n\"\n \"\\n\"\n \"-1.0 is returned if not enough transactions and\\n\"\n \"blocks have been observed to make an estimate.\\n\"\n \"\\nExample:\\n\"\n + HelpExampleCli(\"estimatefee\", \"6\")\n );\n\n RPCTypeCheck(params, boost::assign::list_of(int_type));\n\n int nBlocks = params[0].get_int();\n if (nBlocks < 1)\n nBlocks = 1;\n\n CFeeRate feeRate = mempool.estimateFee(nBlocks);\n if (feeRate == CFeeRate(0))\n return -1.0;\n\n return ValueFromAmount(feeRate.GetFeePerK());\n}\n\nValue estimatepriority(const Array& params, bool fHelp)\n{\n if (fHelp || params.size() != 1)\n throw runtime_error(\n \"estimatepriority nblocks\\n\"\n \"\\nEstimates the approximate priority\\n\"\n \"a zero-fee transaction needs to begin confirmation\\n\"\n \"within nblocks blocks.\\n\"\n \"\\nArguments:\\n\"\n \"1. nblocks (numeric)\\n\"\n \"\\nResult:\\n\"\n \"n : (numeric) estimated priority\\n\"\n \"\\n\"\n \"-1.0 is returned if not enough transactions and\\n\"\n \"blocks have been observed to make an estimate.\\n\"\n \"\\nExample:\\n\"\n + HelpExampleCli(\"estimatepriority\", \"6\")\n );\n\n RPCTypeCheck(params, boost::assign::list_of(int_type));\n\n int nBlocks = params[0].get_int();\n if (nBlocks < 1)\n nBlocks = 1;\n\n return mempool.estimatePriority(nBlocks);\n}\nDelete rpcmining.cpp<|endoftext|>"} {"text":"#include \"reader_options.h\"\n#include \"rpg_actor.h\"\n#include \"rpg_event.h\"\n#include \"rpg_map.h\"\n#include \"rpg_mapinfo.h\"\n#include \"rpg_system.h\"\n#include \"rpg_save.h\"\n#include \"rpg_chipset.h\"\n#include \"rpg_parameters.h\"\n#include \"data.h\"\n\nvoid RPG::SaveActor::Setup(int actor_id) {\n\tconst RPG::Actor& actor = Data::actors[actor_id - 1];\n\tID = actor.ID;\n\tname = actor.name;\n\ttitle = actor.title;\n\tsprite_name = actor.character_name;\n\tsprite_id = actor.character_index;\n\tsprite_flags = actor.transparent ? 3 : 0;\n\tface_name = actor.face_name;\n\tface_id = actor.face_index;\n\tlevel = actor.initial_level;\n\texp = 0;\n\thp_mod = 0;\n\tsp_mod = 0;\n\tattack_mod = 0;\n\tdefense_mod = 0;\n\tspirit_mod = 0;\n\tagility_mod = 0;\n\tskills_size = 0;\n\tskills.clear();\n\tequipped.clear();\n\tequipped.push_back(actor.initial_equipment.weapon_id);\n\tequipped.push_back(actor.initial_equipment.shield_id);\n\tequipped.push_back(actor.initial_equipment.armor_id);\n\tequipped.push_back(actor.initial_equipment.helmet_id);\n\tequipped.push_back(actor.initial_equipment.accessory_id);\n\tcurrent_hp = 0;\n\tcurrent_sp = 0;\n\tbattle_commands = actor.battle_commands;\n\tstatus_size = 0;\n\tstatus.clear();\n\tchanged_class = false;\n\tclass_id = actor.class_id;\n\tunknown_5b = -1;\n\ttwo_weapon = actor.two_swords_style;\n\tlock_equipment = actor.fix_equipment;\n\tauto_battle = actor.auto_battle;\n\tmighty_guard = actor.super_guard;\n\tunknown_60 = -1;\n}\n\nvoid RPG::SaveInventory::Setup() {\n\tparty = Data::system.party;\n\tparty_size = party.size();\n}\n\nvoid RPG::SaveMapEvent::Setup(const RPG::Event& event) {\n\tID = event.ID;\n\tposition_x = event.x;\n\tposition_y = event.y;\n}\n\nvoid RPG::SaveMapInfo::Setup() {\n\tpan_x = 0;\n\tpan_y = 0;\n\tlower_tiles.resize(144);\n\tupper_tiles.resize(144);\n\tfor (int i = 0; i < 144; i++) {\n\t\tlower_tiles[i] = i;\n\t\tupper_tiles[i] = i;\n\t}\n}\n\nvoid RPG::SaveMapInfo::Setup(const RPG::Map& map) {\n\tchipset_id = map.chipset_id;\n\tparallax_name = map.parallax_name;\n\tparallax_horz = map.parallax_loop_x;\n\tparallax_vert = map.parallax_loop_y;\n\tparallax_horz_auto = map.parallax_auto_loop_x;\n\tparallax_vert_auto = map.parallax_auto_loop_y;\n\tparallax_horz_speed = map.parallax_sx;\n\tparallax_vert_speed = map.parallax_sy;\n}\n\nvoid RPG::SaveMapInfo::Setup(const RPG::MapInfo& map_info) {\n\tencounter_rate = map_info.encounter_steps;\n}\n\nvoid RPG::SaveSystem::Setup() {\n\tconst RPG::System& system = Data::system;\n\tscreen = 0;\n\tframe_count = 0;\n\tgraphics_name = system.system_name;\n\tswitches_size = Data::switches.size();\n\tswitches.resize(switches_size);\n\tvariables_size = Data::variables.size();\n\tvariables.resize(variables_size);\n\tmessage_transparent = -1;\n\tmessage_position = -1;\n\tmessage_placement = -1;\n\tmessage_continue = -1;\n\tface_name = \"\";\n\tface_id = -1;\n\tface_right = false;\n\tface_flip = false;\n\ttransparent = false;\n\tunknown_3d = -1;\n\ttitle_music = system.title_music;\n\tbattle_music = system.battle_music;\n\tbattle_end_music = system.battle_end_music;\n\tinn_music = system.inn_music;\n\t\/\/ current_music\n\t\/\/ unknown1_music\n\t\/\/ unknown2_music\n\t\/\/ stored_music\n\tboat_music = system.boat_music;\n\tship_music = system.ship_music;\n\tairship_music = system.airship_music;\n\tgameover_music = system.gameover_music;\n\tcursor_se = system.cursor_se;\n\tdecision_se = system.decision_se;\n\tcancel_se = system.cancel_se;\n\tbuzzer_se = system.buzzer_se;\n\tbattle_se = system.battle_se;\n\tescape_se = system.escape_se;\n\tenemy_attack_se = system.enemy_attack_se;\n\tenemy_damaged_se = system.enemy_damaged_se;\n\tactor_damaged_se = system.actor_damaged_se;\n\tdodge_se = system.dodge_se;\n\tenemy_death_se = system.enemy_death_se;\n\titem_se = system.item_se;\n\ttransition_out = system.transition_out;\n\ttransition_in = system.transition_in;\n\tbattle_start_fadeout = system.battle_start_fadeout;\n\tbattle_start_fadein = system.battle_start_fadein;\n\tbattle_end_fadeout = system.battle_end_fadeout;\n\tbattle_end_fadein = system.battle_end_fadein;\n\tteleport_allowed = true;\n\tescape_allowed = true;\n\tsave_allowed = true;\n\tmenu_allowed = true;\n\tbackground = \"\";\n\tsave_count = -1;\n\tsave_slot = -1;\n}\n\nvoid RPG::Save::Setup() {\n\tsystem.Setup();\n\tpictures.resize(50);\n\tfor (int i = 1; i <= (int) pictures.size(); i++)\n\t\tpictures[i - 1].ID = i;\n\tactors.resize(Data::actors.size());\n\tfor (int i = 1; i <= (int) actors.size(); i++)\n\t\tactors[i - 1].Setup(i);\n\tmap_info.Setup();\n}\n\nvoid RPG::Actor::Init() {\n#if RPGMAKER == RPG2K3\n\tfinal_level = 99;\n\texp_base = 300;\n\texp_inflation = 300;\n#endif\n\tparameters.Setup(final_level);\n}\n\nvoid RPG::MapInfo::Init() {\n\tmusic.name = \"(OFF)\";\n}\n\nvoid RPG::Chipset::Init() {\n\tterrain_data.resize(162, 1);\n\tpassable_data_lower.resize(162, 15);\n\tpassable_data_upper.resize(162, 15);\n}\n\nvoid RPG::Parameters::Setup(int final_level) {\n\tmaxhp.resize(final_level + 1);\n\tmaxsp.resize(final_level + 1);\n\tattack.resize(final_level + 1);\n\tdefense.resize(final_level + 1);\n\tspirit.resize(final_level + 1);\n\tagility.resize(final_level + 1);\n\tfor (int i = 0; i <= final_level; i++) {\n\t\tmaxhp[i] = 1;\n\t\tmaxsp[i] = 0;\n\t\tattack[i] = 1;\n\t\tdefense[i] = 1;\n\t\tspirit[i] = 1;\n\t\tagility[i] = 1;\n\t}\n}\nBugfix: When the player resets (via F12 or Menu) switches and variables are not reset to the default values.#include \"reader_options.h\"\n#include \"rpg_actor.h\"\n#include \"rpg_event.h\"\n#include \"rpg_map.h\"\n#include \"rpg_mapinfo.h\"\n#include \"rpg_system.h\"\n#include \"rpg_save.h\"\n#include \"rpg_chipset.h\"\n#include \"rpg_parameters.h\"\n#include \"data.h\"\n\nvoid RPG::SaveActor::Setup(int actor_id) {\n\tconst RPG::Actor& actor = Data::actors[actor_id - 1];\n\tID = actor.ID;\n\tname = actor.name;\n\ttitle = actor.title;\n\tsprite_name = actor.character_name;\n\tsprite_id = actor.character_index;\n\tsprite_flags = actor.transparent ? 3 : 0;\n\tface_name = actor.face_name;\n\tface_id = actor.face_index;\n\tlevel = actor.initial_level;\n\texp = 0;\n\thp_mod = 0;\n\tsp_mod = 0;\n\tattack_mod = 0;\n\tdefense_mod = 0;\n\tspirit_mod = 0;\n\tagility_mod = 0;\n\tskills_size = 0;\n\tskills.clear();\n\tequipped.clear();\n\tequipped.push_back(actor.initial_equipment.weapon_id);\n\tequipped.push_back(actor.initial_equipment.shield_id);\n\tequipped.push_back(actor.initial_equipment.armor_id);\n\tequipped.push_back(actor.initial_equipment.helmet_id);\n\tequipped.push_back(actor.initial_equipment.accessory_id);\n\tcurrent_hp = 0;\n\tcurrent_sp = 0;\n\tbattle_commands = actor.battle_commands;\n\tstatus_size = 0;\n\tstatus.clear();\n\tchanged_class = false;\n\tclass_id = actor.class_id;\n\tunknown_5b = -1;\n\ttwo_weapon = actor.two_swords_style;\n\tlock_equipment = actor.fix_equipment;\n\tauto_battle = actor.auto_battle;\n\tmighty_guard = actor.super_guard;\n\tunknown_60 = -1;\n}\n\nvoid RPG::SaveInventory::Setup() {\n\tparty = Data::system.party;\n\tparty_size = party.size();\n}\n\nvoid RPG::SaveMapEvent::Setup(const RPG::Event& event) {\n\tID = event.ID;\n\tposition_x = event.x;\n\tposition_y = event.y;\n}\n\nvoid RPG::SaveMapInfo::Setup() {\n\tpan_x = 0;\n\tpan_y = 0;\n\tlower_tiles.resize(144);\n\tupper_tiles.resize(144);\n\tfor (int i = 0; i < 144; i++) {\n\t\tlower_tiles[i] = i;\n\t\tupper_tiles[i] = i;\n\t}\n}\n\nvoid RPG::SaveMapInfo::Setup(const RPG::Map& map) {\n\tchipset_id = map.chipset_id;\n\tparallax_name = map.parallax_name;\n\tparallax_horz = map.parallax_loop_x;\n\tparallax_vert = map.parallax_loop_y;\n\tparallax_horz_auto = map.parallax_auto_loop_x;\n\tparallax_vert_auto = map.parallax_auto_loop_y;\n\tparallax_horz_speed = map.parallax_sx;\n\tparallax_vert_speed = map.parallax_sy;\n}\n\nvoid RPG::SaveMapInfo::Setup(const RPG::MapInfo& map_info) {\n\tencounter_rate = map_info.encounter_steps;\n}\n\nvoid RPG::SaveSystem::Setup() {\n\tconst RPG::System& system = Data::system;\n\tscreen = 0;\n\tframe_count = 0;\n\tgraphics_name = system.system_name;\n\tswitches_size = Data::switches.size();\n\tswitches.clear();\n\tswitches.resize(switches_size);\n\tvariables_size = Data::variables.size();\n\tvariables.clear();\n\tvariables.resize(variables_size);\n\tmessage_transparent = -1;\n\tmessage_position = -1;\n\tmessage_placement = -1;\n\tmessage_continue = -1;\n\tface_name = \"\";\n\tface_id = -1;\n\tface_right = false;\n\tface_flip = false;\n\ttransparent = false;\n\tunknown_3d = -1;\n\ttitle_music = system.title_music;\n\tbattle_music = system.battle_music;\n\tbattle_end_music = system.battle_end_music;\n\tinn_music = system.inn_music;\n\t\/\/ current_music\n\t\/\/ unknown1_music\n\t\/\/ unknown2_music\n\t\/\/ stored_music\n\tboat_music = system.boat_music;\n\tship_music = system.ship_music;\n\tairship_music = system.airship_music;\n\tgameover_music = system.gameover_music;\n\tcursor_se = system.cursor_se;\n\tdecision_se = system.decision_se;\n\tcancel_se = system.cancel_se;\n\tbuzzer_se = system.buzzer_se;\n\tbattle_se = system.battle_se;\n\tescape_se = system.escape_se;\n\tenemy_attack_se = system.enemy_attack_se;\n\tenemy_damaged_se = system.enemy_damaged_se;\n\tactor_damaged_se = system.actor_damaged_se;\n\tdodge_se = system.dodge_se;\n\tenemy_death_se = system.enemy_death_se;\n\titem_se = system.item_se;\n\ttransition_out = system.transition_out;\n\ttransition_in = system.transition_in;\n\tbattle_start_fadeout = system.battle_start_fadeout;\n\tbattle_start_fadein = system.battle_start_fadein;\n\tbattle_end_fadeout = system.battle_end_fadeout;\n\tbattle_end_fadein = system.battle_end_fadein;\n\tteleport_allowed = true;\n\tescape_allowed = true;\n\tsave_allowed = true;\n\tmenu_allowed = true;\n\tbackground = \"\";\n\tsave_count = -1;\n\tsave_slot = -1;\n}\n\nvoid RPG::Save::Setup() {\n\tsystem.Setup();\n\tpictures.resize(50);\n\tfor (int i = 1; i <= (int) pictures.size(); i++)\n\t\tpictures[i - 1].ID = i;\n\tactors.resize(Data::actors.size());\n\tfor (int i = 1; i <= (int) actors.size(); i++)\n\t\tactors[i - 1].Setup(i);\n\tmap_info.Setup();\n}\n\nvoid RPG::Actor::Init() {\n#if RPGMAKER == RPG2K3\n\tfinal_level = 99;\n\texp_base = 300;\n\texp_inflation = 300;\n#endif\n\tparameters.Setup(final_level);\n}\n\nvoid RPG::MapInfo::Init() {\n\tmusic.name = \"(OFF)\";\n}\n\nvoid RPG::Chipset::Init() {\n\tterrain_data.resize(162, 1);\n\tpassable_data_lower.resize(162, 15);\n\tpassable_data_upper.resize(162, 15);\n}\n\nvoid RPG::Parameters::Setup(int final_level) {\n\tmaxhp.resize(final_level + 1);\n\tmaxsp.resize(final_level + 1);\n\tattack.resize(final_level + 1);\n\tdefense.resize(final_level + 1);\n\tspirit.resize(final_level + 1);\n\tagility.resize(final_level + 1);\n\tfor (int i = 0; i <= final_level; i++) {\n\t\tmaxhp[i] = 1;\n\t\tmaxsp[i] = 0;\n\t\tattack[i] = 1;\n\t\tdefense[i] = 1;\n\t\tspirit[i] = 1;\n\t\tagility[i] = 1;\n\t}\n}\n<|endoftext|>"} {"text":"\/\/ Copyright (c) 2016 The Zcash developers\n\/\/ Copyright (c) 2017-2018 The LitecoinZ developers\n\/\/ Original code from: https:\/\/gist.github.com\/laanwj\/0e689cfa37b52bcbbb44\n\n\/*\n\nTo set up a new alert system\n----------------------------\n\nCreate a new alert key pair:\nopenssl ecparam -name secp256k1 -genkey -param_enc explicit -outform PEM -out data.pem\n\nGet the private key in hex:\nopenssl ec -in data.pem -outform DER | tail -c 279 | xxd -p -c 279\n\nGet the public key in hex:\nopenssl ec -in data.pem -pubout -outform DER | tail -c 65 | xxd -p -c 65\n\nUpdate the public keys found in chainparams.cpp.\n\n\nTo send an alert message\n------------------------\n\nCopy the private keys into alertkeys.h.\n\nModify the alert parameters, id and message found in this file.\n\nBuild and run with -sendalert or -printalert.\n\n.\/litecoinzd -printtoconsole -sendalert\n\nOne minute after starting up, the alert will be broadcast. It is then\nflooded through the network until the nRelayUntil time, and will be\nactive until nExpiration OR the alert is cancelled.\n\nIf you make a mistake, send another alert with nCancel set to cancel\nthe bad alert.\n\n*\/\n\n#include \"main.h\"\n#include \"net.h\"\n#include \"alert.h\"\n#include \"init.h\"\n\n#include \"util.h\"\n#include \"utiltime.h\"\n#include \"key.h\"\n#include \"clientversion.h\"\n#include \"chainparams.h\"\n\n#include \"alertkeys.h\"\n\n\nstatic const int64_t DAYS = 24 * 60 * 60;\n\nvoid ThreadSendAlert()\n{\n if (!mapArgs.count(\"-sendalert\") && !mapArgs.count(\"-printalert\"))\n return;\n\n MilliSleep(60*1000); \/\/ Wait a minute so we get connected\n\n \/\/\n \/\/ Alerts are relayed around the network until nRelayUntil, flood\n \/\/ filling to every node.\n \/\/ After the relay time is past, new nodes are told about alerts\n \/\/ when they connect to peers, until either nExpiration or\n \/\/ the alert is cancelled by a newer alert.\n \/\/ Nodes never save alerts to disk, they are in-memory-only.\n \/\/\n CAlert alert;\n alert.nRelayUntil = GetTime() + 15 * 60;\n alert.nExpiration = GetTime() + 10 * 365 * 24 * 60 * 60;\n alert.nID = 1005; \/\/ use https:\/\/github.com\/zcash\/zcash\/wiki\/specification#assigned-numbers to keep track of alert IDs\n alert.nCancel = 1004; \/\/ cancels previous messages up to this ID number\n\n \/\/ These versions are protocol versions\n \/\/ 170004 : 1.0.16\n alert.nMinVer = 170004;\n alert.nMaxVer = 170004;\n\n \/\/\n \/\/ main.cpp:\n \/\/ 1000 for Misc warnings like out of disk space and clock is wrong\n \/\/ 2000 for longer invalid proof-of-work chain\n \/\/ Higher numbers mean higher priority\n \/\/ 4000 or higher will put the RPC into safe mode\n alert.nPriority = 4000;\n alert.strComment = \"\";\n alert.strStatusBar = \"Your client is out of date and incompatible with the Overwinter network upgrade. Please update to a recent version of LitecoinZ (2.0.0 or later).\";\n alert.strRPCError = alert.strStatusBar;\n\n \/\/ Set specific client version\/versions here. If setSubVer is empty, no filtering on subver is done:\n \/\/ alert.setSubVer.insert(std::string(\"\/MagicBean:0.7.2\/\"));\n const std::vector useragents = {}; \/\/{\"MagicBean\", \"BeanStalk\", \"AppleSeed\", \"EleosZcash\"};\n\n BOOST_FOREACH(const std::string& useragent, useragents) {\n }\n\n \/\/ Sanity check\n assert(alert.strComment.length() <= 65536); \/\/ max length in alert.h\n assert(alert.strStatusBar.length() <= 256);\n assert(alert.strRPCError.length() <= 256);\n\n \/\/ Sign\n const CChainParams& chainparams = Params();\n std::string networkID = chainparams.NetworkIDString();\n bool fIsTestNet = networkID.compare(\"test\") == 0;\n std::vector vchTmp(ParseHex(fIsTestNet ? pszTestNetPrivKey : pszPrivKey));\n CPrivKey vchPrivKey(vchTmp.begin(), vchTmp.end());\n\n CDataStream sMsg(SER_NETWORK, CLIENT_VERSION);\n sMsg << *(CUnsignedAlert*)&alert;\n alert.vchMsg = std::vector(sMsg.begin(), sMsg.end());\n CKey key;\n if (!key.SetPrivKey(vchPrivKey, false))\n {\n printf(\"ThreadSendAlert() : key.SetPrivKey failed\\n\");\n return;\n }\n if (!key.Sign(Hash(alert.vchMsg.begin(), alert.vchMsg.end()), alert.vchSig))\n {\n printf(\"ThreadSendAlert() : key.Sign failed\\n\");\n return;\n }\n\n \/\/ Test\n CDataStream sBuffer(SER_NETWORK, CLIENT_VERSION);\n sBuffer << alert;\n CAlert alert2;\n sBuffer >> alert2;\n if (!alert2.CheckSignature(chainparams.AlertKey()))\n {\n printf(\"ThreadSendAlert() : CheckSignature failed\\n\");\n return;\n }\n assert(alert2.vchMsg == alert.vchMsg);\n assert(alert2.vchSig == alert.vchSig);\n alert.SetNull();\n printf(\"\\nThreadSendAlert:\\n\");\n printf(\"hash=%s\\n\", alert2.GetHash().ToString().c_str());\n printf(\"%s\\n\", alert2.ToString().c_str());\n printf(\"vchMsg=%s\\n\", HexStr(alert2.vchMsg).c_str());\n printf(\"vchSig=%s\\n\", HexStr(alert2.vchSig).c_str());\n\n \/\/ Confirm\n if (!mapArgs.count(\"-sendalert\"))\n return;\n while (vNodes.size() < 1 && !ShutdownRequested())\n MilliSleep(500);\n if (ShutdownRequested())\n return;\n\n \/\/ Send\n printf(\"ThreadSendAlert() : Sending alert\\n\");\n int nSent = 0;\n {\n LOCK(cs_vNodes);\n BOOST_FOREACH(CNode* pnode, vNodes)\n {\n if (alert2.RelayTo(pnode))\n {\n printf(\"ThreadSendAlert() : Sent alert to %s\\n\", pnode->addr.ToString().c_str());\n nSent++;\n }\n }\n }\n printf(\"ThreadSendAlert() : Alert sent to %d nodes\\n\", nSent);\n}\nSend alert to put non-Sapling nodes into safe mode\/\/ Copyright (c) 2016 The Zcash developers\n\/\/ Copyright (c) 2017-2018 The LitecoinZ developers\n\/\/ Original code from: https:\/\/gist.github.com\/laanwj\/0e689cfa37b52bcbbb44\n\n\/*\n\nTo set up a new alert system\n----------------------------\n\nCreate a new alert key pair:\nopenssl ecparam -name secp256k1 -genkey -param_enc explicit -outform PEM -out data.pem\n\nGet the private key in hex:\nopenssl ec -in data.pem -outform DER | tail -c 279 | xxd -p -c 279\n\nGet the public key in hex:\nopenssl ec -in data.pem -pubout -outform DER | tail -c 65 | xxd -p -c 65\n\nUpdate the public keys found in chainparams.cpp.\n\n\nTo send an alert message\n------------------------\n\nCopy the private keys into alertkeys.h.\n\nModify the alert parameters, id and message found in this file.\n\nBuild and run with -sendalert or -printalert.\n\n.\/litecoinzd -printtoconsole -sendalert\n\nOne minute after starting up, the alert will be broadcast. It is then\nflooded through the network until the nRelayUntil time, and will be\nactive until nExpiration OR the alert is cancelled.\n\nIf you make a mistake, send another alert with nCancel set to cancel\nthe bad alert.\n\n*\/\n\n#include \"main.h\"\n#include \"net.h\"\n#include \"alert.h\"\n#include \"init.h\"\n\n#include \"util.h\"\n#include \"utiltime.h\"\n#include \"key.h\"\n#include \"clientversion.h\"\n#include \"chainparams.h\"\n\n#include \"alertkeys.h\"\n\n\nstatic const int64_t DAYS = 24 * 60 * 60;\n\nvoid ThreadSendAlert()\n{\n if (!mapArgs.count(\"-sendalert\") && !mapArgs.count(\"-printalert\"))\n return;\n\n MilliSleep(60*1000); \/\/ Wait a minute so we get connected\n\n \/\/\n \/\/ Alerts are relayed around the network until nRelayUntil, flood\n \/\/ filling to every node.\n \/\/ After the relay time is past, new nodes are told about alerts\n \/\/ when they connect to peers, until either nExpiration or\n \/\/ the alert is cancelled by a newer alert.\n \/\/ Nodes never save alerts to disk, they are in-memory-only.\n \/\/\n CAlert alert;\n alert.nRelayUntil = GetTime() + 15 * 60;\n alert.nExpiration = GetTime() + 10 * 365 * 24 * 60 * 60;\n alert.nID = 1006; \/\/ use https:\/\/github.com\/zcash\/zcash\/wiki\/specification#assigned-numbers to keep track of alert IDs\n alert.nCancel = 1005; \/\/ cancels previous messages up to this ID number\n\n \/\/ These versions are protocol versions\n \/\/ 170004 : 1.0.16\n \/\/ 170007 : 2.0.0\n alert.nMinVer = 170004;\n alert.nMaxVer = 170006;\n\n \/\/\n \/\/ main.cpp:\n \/\/ 1000 for Misc warnings like out of disk space and clock is wrong\n \/\/ 2000 for longer invalid proof-of-work chain\n \/\/ Higher numbers mean higher priority\n \/\/ 4000 or higher will put the RPC into safe mode\n alert.nPriority = 4000;\n alert.strComment = \"\";\n alert.strStatusBar = \"Your client is out of date and incompatible with the Sapling network upgrade. Please update to a recent version of LitecoinZ (2.0.0 or later).\";\n alert.strRPCError = alert.strStatusBar;\n\n \/\/ Set specific client version\/versions here. If setSubVer is empty, no filtering on subver is done:\n \/\/ alert.setSubVer.insert(std::string(\"\/MagicBean:0.7.2\/\"));\n const std::vector useragents = {}; \/\/{\"MagicBean\", \"BeanStalk\", \"AppleSeed\", \"EleosZcash\"};\n\n BOOST_FOREACH(const std::string& useragent, useragents) {\n }\n\n \/\/ Sanity check\n assert(alert.strComment.length() <= 65536); \/\/ max length in alert.h\n assert(alert.strStatusBar.length() <= 256);\n assert(alert.strRPCError.length() <= 256);\n\n \/\/ Sign\n const CChainParams& chainparams = Params();\n std::string networkID = chainparams.NetworkIDString();\n bool fIsTestNet = networkID.compare(\"test\") == 0;\n std::vector vchTmp(ParseHex(fIsTestNet ? pszTestNetPrivKey : pszPrivKey));\n CPrivKey vchPrivKey(vchTmp.begin(), vchTmp.end());\n\n CDataStream sMsg(SER_NETWORK, CLIENT_VERSION);\n sMsg << *(CUnsignedAlert*)&alert;\n alert.vchMsg = std::vector(sMsg.begin(), sMsg.end());\n CKey key;\n if (!key.SetPrivKey(vchPrivKey, false))\n {\n printf(\"ThreadSendAlert() : key.SetPrivKey failed\\n\");\n return;\n }\n if (!key.Sign(Hash(alert.vchMsg.begin(), alert.vchMsg.end()), alert.vchSig))\n {\n printf(\"ThreadSendAlert() : key.Sign failed\\n\");\n return;\n }\n\n \/\/ Test\n CDataStream sBuffer(SER_NETWORK, CLIENT_VERSION);\n sBuffer << alert;\n CAlert alert2;\n sBuffer >> alert2;\n if (!alert2.CheckSignature(chainparams.AlertKey()))\n {\n printf(\"ThreadSendAlert() : CheckSignature failed\\n\");\n return;\n }\n assert(alert2.vchMsg == alert.vchMsg);\n assert(alert2.vchSig == alert.vchSig);\n alert.SetNull();\n printf(\"\\nThreadSendAlert:\\n\");\n printf(\"hash=%s\\n\", alert2.GetHash().ToString().c_str());\n printf(\"%s\\n\", alert2.ToString().c_str());\n printf(\"vchMsg=%s\\n\", HexStr(alert2.vchMsg).c_str());\n printf(\"vchSig=%s\\n\", HexStr(alert2.vchSig).c_str());\n\n \/\/ Confirm\n if (!mapArgs.count(\"-sendalert\"))\n return;\n while (vNodes.size() < 1 && !ShutdownRequested())\n MilliSleep(500);\n if (ShutdownRequested())\n return;\n\n \/\/ Send\n printf(\"ThreadSendAlert() : Sending alert\\n\");\n int nSent = 0;\n {\n LOCK(cs_vNodes);\n BOOST_FOREACH(CNode* pnode, vNodes)\n {\n if (alert2.RelayTo(pnode))\n {\n printf(\"ThreadSendAlert() : Sent alert to %s\\n\", pnode->addr.ToString().c_str());\n nSent++;\n }\n }\n }\n printf(\"ThreadSendAlert() : Alert sent to %d nodes\\n\", nSent);\n}\n<|endoftext|>"} {"text":"\/*****************************************************************************************\/\/**\n* @file sensortag.cpp\n*\n* Copyright (c)\n* SmartRoboticSystems\n* December 2015\n*\n* This program creates connection to SensorTag 2650 using hcitool & gatttool, starts\n* temperature, light and humidity measurements, set up and process notifications,\n* computes real world data and saves results to files temperature.txt, humidity.txt,\n* light.txt on \"IoT\/data\/\" filepath. Child process & stdin\/stdout redirection is utilized\n*\n* Licensed under the EUPL V.1.1\n*\n* This Software is provided to You under the terms of the European\n* Union Public License (the \"EUPL\") version 1.1 as published by the\n* European Union. Any use of this Software, other than as authorized\n* under this License is strictly prohibited (to the extent such use\n* is covered by a right of the copyright holder of this Software).\n*\n* This Software is provided under the License on an \"AS IS\" basis and\n* without warranties of any kind concerning the Software, including\n* without limitation merchantability, fitness for a particular purpose,\n* absence of defects or errors, accuracy, and non-infringement of\n* intellectual property rights other than copyright. This disclaimer\n* of warranty is an essential part of the License and a condition for\n* the grant of any rights to this Software.\n******************************************************************************\/\n\n#include \n#include \n#include \n#include \n#include \n\n#include \n#include \n#include \n#include \n#include \n\n#include \"filepaths.h\"\n\n#define PIPE_READ 0\n#define PIPE_WRITE 1\n\nint createChildProcess(const char* command, char* const arguments[], char* const environment[])\n{\n int stdin_pipe[2];\n int stdout_pipe[2];\n int child_num;\n int execve_result;\n char act_char;\n\n if (pipe(stdin_pipe) < 0)\n {\n perror(\"allocating pipe for child input redirect\");\n return -1;\n }\n if (pipe(stdout_pipe) < 0)\n {\n close(stdin_pipe[PIPE_READ]);\n close(stdin_pipe[PIPE_WRITE]);\n perror(\"allocating pipe for child output redirect\");\n return -1;\n }\n\n child_num = fork();\n if (0 == child_num)\n {\n \/\/ child continues here\n \/\/ redirect stdin\n if (dup2(stdin_pipe[PIPE_READ], STDIN_FILENO) == -1)\n {\n perror(\"redirecting stdin\");\n return -1;\n }\n\n \/\/ redirect stdout\n if (dup2(stdout_pipe[PIPE_WRITE], STDOUT_FILENO) == -1)\n {\n perror(\"redirecting stdout\");\n return -1;\n }\n\n \/\/ redirect stderr\n if (dup2(stdout_pipe[PIPE_WRITE], STDERR_FILENO) == -1)\n {\n perror(\"redirecting stderr\");\n return -1;\n }\n\n \/\/ all these are for use by parent only\n close(stdin_pipe[PIPE_READ]);\n close(stdin_pipe[PIPE_WRITE]);\n close(stdout_pipe[PIPE_READ]);\n close(stdout_pipe[PIPE_WRITE]);\n\n \/\/ run child process image\n execve_result = execve(command, arguments, environment);\n\n \/\/ if we get here at all, an error occurred, but we are in the child\n \/\/ process, so just exit\n perror(\"exec of the child process\");\n exit(execve_result);\n }\n else if (child_num > 0)\n {\n \/\/ parent continues here\n\n \/\/ close unused file descriptors, these are for child only\n close(stdin_pipe[PIPE_READ]);\n close(stdout_pipe[PIPE_WRITE]);\n\n \/\/==============================================================\n \/\/ Connect\n \/\/==============================================================\n const char* connect_message = \"connect \\r\\n\";\n if (NULL != connect_message)\n write(stdin_pipe[PIPE_WRITE], connect_message, strlen(connect_message));\n\n \/\/Read console output\n do {\n read(stdout_pipe[PIPE_READ], &act_char, 1);\n write(STDOUT_FILENO, &act_char, 1);\n } while (act_char != '\\n');\n\n usleep(1000000);\n\n \/\/==============================================================\n \/\/ Start Temperature measurement\n \/\/==============================================================\n\n \/\/Start measurement\n const char* start_temperature = \"char-write-req 0x24 01 \\r\\n\";\n if (NULL != start_temperature)\n write(stdin_pipe[PIPE_WRITE], start_temperature, strlen(start_temperature));\n\n \/\/Turn on notifications\n const char* read_temperature = \"char-write-req 0x22 0100 \\r\\n\";\n if (NULL != read_temperature)\n write(stdin_pipe[PIPE_WRITE], read_temperature, strlen(read_temperature));\n\n \/\/Set notification period to 2.5 sec\n const char* temperature_period = \"char-write-req 0x26 0xFA \\r\\n\";\n if (NULL != temperature_period)\n write(stdin_pipe[PIPE_WRITE], temperature_period, strlen(temperature_period));\n\n\n \/\/==============================================================\n \/\/ Start Light measurement\n \/\/==============================================================\n\n \/\/Start measurement\n const char* start_light = \"char-write-req 0x44 01 \\r\\n\";\n if (NULL != start_light)\n write(stdin_pipe[PIPE_WRITE], start_light, strlen(start_light));\n\n \/\/Turn on notifications\n const char* read_light = \"char-write-req 0x42 0100 \\r\\n\";\n if (NULL != read_light)\n write(stdin_pipe[PIPE_WRITE], read_light, strlen(read_light));\n\n \/\/Set notification period to 2.5 sec\n const char* light_period = \"char-write-req 0x46 0xFA \\r\\n\";\n if (NULL != light_period)\n write(stdin_pipe[PIPE_WRITE], light_period, strlen(light_period));\n\n\n \/\/==============================================================\n \/\/ Start Humidity measurement\n \/\/==============================================================\n\n \/\/Start measurement\n const char* start_humidity = \"char-write-req 0x2c 01 \\r\\n\";\n if (NULL != start_humidity)\n write(stdin_pipe[PIPE_WRITE], start_humidity, strlen(start_humidity));\n\n \/\/Turn on notifications\n const char* read_humidity = \"char-write-req 0x2A 0100 \\r\\n\";\n if (NULL != read_humidity)\n write(stdin_pipe[PIPE_WRITE], read_humidity, strlen(read_humidity));\n\n \/\/Set notification period to 2.5 sec\n const char* humidity_period = \"char-write-req 0x2e 0xFA \\r\\n\";\n if (NULL != humidity_period)\n write(stdin_pipe[PIPE_WRITE], humidity_period, strlen(humidity_period));\n\n\/* \/\/==============================================================\n \/\/ Start Barometer measurement\n \/\/==============================================================\n\n \/\/Start measurement\n const char* start_barometer = \"char-write-req 0x34 01 \\r\\n\";\n if (NULL != start_barometer)\n write(aStdinPipe[PIPE_WRITE], start_barometer, strlen(start_barometer));\n\n \/\/Turn on notifications\n const char* read_barometer = \"char-write-req 0x32 0100 \\r\\n\";\n if (NULL != read_barometer)\n write(aStdinPipe[PIPE_WRITE], read_barometer, strlen(read_barometer));\n\n \/\/Set notification period to 2.5 sec\n const char* barometer_period = \"char-write-req 0x36 0xFA \\r\\n\";\n if (NULL != barometer_period)\n write(aStdinPipe[PIPE_WRITE], barometer_period, strlen(barometer_period));\n*\/\n\n \/\/==============================================================\n \/\/ Process notifications\n \/\/==============================================================\n\n double humidity = 0;\n double temperature = 0;\n double light = 0;\n double barometer = 0;\n\n const std::string temp_handle = \"0x0021\";\n const std::string light_handle = \"0x0041\";\n const std::string humidity_handle = \"0x0029\";\n const std::string barometer_handle = \"0x0031\";\n bool new_measurement = false;\n\n while(1)\n {\n std::string actual_line;\n\n do {\n read(stdout_pipe[PIPE_READ], &act_char, 1);\n actual_line += act_char;\n } while (act_char != '\\n');\n\n \/\/Temperature notification\n int temperature_index = actual_line.find(temp_handle);\n\n if(temperature_index != -1)\n {\n new_measurement = true;\n std::string temp;\n unsigned int temperature_bytes[2];\n\n \/\/Extract bytes from string notifications\n temp = actual_line.substr(temperature_index + 20, 2);\n temperature_bytes[0] = strtoul(temp.c_str(), 0, 16);\n\n temp = actual_line.substr(temperature_index + 23,2);\n temperature_bytes[1] = strtoul(temp.c_str(), 0, 16);\n\n \/\/Merge bytes\n unsigned int temperature_raw = (temperature_bytes[1] << 8) + temperature_bytes[0];\n\n \/\/Compute final value\n temperature = temperature_raw\/128.0;\n }\n\n \/\/Light notification\n int light_index = actual_line.find(light_handle);\n if(light_index != -1)\n {\n new_measurement = true;\n std::string temp;\n unsigned int light_bytes[2];\n\n \/\/Extract bytes from string notifications\n temp = actual_line.substr(light_index + 14, 2);\n light_bytes[0] = strtoul(temp.c_str(), 0, 16);\n\n temp = actual_line.substr(light_index + 17, 2);\n light_bytes[1] = strtoul(temp.c_str(), 0, 16);\n\n \/\/Compute exponent and fraction according to formula\n unsigned int exponent = (light_bytes[1] & 0b11110000) >> 4;\n unsigned int fraction = ((light_bytes[1] & 0b00001111) << 8) + light_bytes[0];\n\n \/\/Compute final value\n light = 0.01 * pow(2,exponent) * fraction;\n }\n\n \/\/Humidity notification\n int humidity_index = actual_line.find(humidity_handle);\n if(humidity_index != -1)\n {\n new_measurement = true;\n std::string temp;\n unsigned int humidity_bytes[2];\n\n \/\/Extract bytes from string notification\n temp = actual_line.substr(humidity_index + 20, 2);\n humidity_bytes[0] = strtoul(temp.c_str(), 0, 16);\n\n temp = actual_line.substr(humidity_index + 23,2);\n humidity_bytes[1] = strtoul(temp.c_str(), 0, 16);\n\n \/\/Merge bytes\n unsigned int humidity_raw = (humidity_bytes[1] << 8) + humidity_bytes[0];\n\n \/\/Clear 2 LSB\n humidity_raw &= ~0x0003;\n\n \/\/Cast to double\n humidity = static_cast(humidity_raw);\n\n \/\/Compute final value\n humidity = 125*(humidity\/65536) - 6;\n }\n\n \/\/Print if new measurement occured\n if(new_measurement == true)\n {\n std::cout << \"Temp: \" << std::setprecision(4) << std::setw(5) << std::setfill(' ') << temperature << \" [°C]\"\n << \" Light: \" << std::setprecision(4) << std::setw(5) << std::setfill(' ') << light << \" [lux]\"\n << \" Humidity: \" << std::setprecision(4) << std::setw(5) << std::setfill(' ') << humidity << \" [%]\" << std::endl;\n\n \/\/Clear the flag\n new_measurement = false;\n\n std::ofstream temperature_minute;\n std::ofstream humidity_minute;\n std::ofstream light_minute;\n\n \/\/Try to open the _MINUTE file for writing\n do {\n temperature_minute.open(TEMPERATURE_MINUTE_FILEPATH);\n } while((temperature_minute.is_open()) == 0);\n\n temperature_minute << temperature;\n temperature_minute.close();\n\n do {\n humidity_minute.open(HUMIDITY_MINUTE_FILEPATH);\n } while((humidity_minute.is_open()) == 0);\n\n humidity_minute << humidity;\n humidity_minute.close();\n\n do {\n light_minute.open(LIGHT_MINUTE_FILEPATH);\n } while((light_minute.is_open()) == 0);\n\n light_minute << light;\n light_minute.close();\n }\n }\n\n \/\/==============================================================\n \/\/ Exit\n \/\/==============================================================\n const char* exit_communication = \"exit\\r\\n\";\n if (NULL != exit_communication) {\n write(stdin_pipe[PIPE_WRITE], exit_communication, strlen(exit_communication));\n }\n\n \/\/ done with these in this example program, you would normally keep these\n \/\/ open of course as long as you want to talk to the child\n close(stdin_pipe[PIPE_WRITE]);\n close(stdout_pipe[PIPE_READ]);\n }\n else\n {\n \/\/ failed to create child\n close(stdin_pipe[PIPE_READ]);\n close(stdin_pipe[PIPE_WRITE]);\n close(stdout_pipe[PIPE_READ]);\n close(stdout_pipe[PIPE_WRITE]);\n }\n return child_num;\n}\n\nint main(int argc, char* argv[])\n{\n if(argc < 2)\n {\n std::cerr << \"Error: missing argument! Correct Usage: .\/iot AA:BB:CC:DD:EE:FF\" << std::endl;\n return(-1);\n }\n else if(argc == 2)\n {\n char* args[4];\n\n args[0] = const_cast(\"gatttool\");\n args[1] = const_cast(\"-b\");\n args[2] = argv[1];\n args[3] = const_cast(\"-I\");\n\n std::cout << \"Connecting to device: [\" << argv[1] << \"]\" << std::endl;\n std::string hcitool_lecc(\"sudo hcitool lecc \");\n hcitool_lecc += argv[1];\n system(hcitool_lecc.c_str());\n\n \/\/Create separate process + redirect console\n createChildProcess(\"\/usr\/bin\/gatttool\",args, NULL);\n\n std::cout << \"Disconnecting from device: [\" << argv[1] << \"]\" << std::endl;\n std::string hcitool_cc(\"sudo hcitool cc \");\n hcitool_cc += argv[1];\n system(hcitool_cc.c_str());\n\n return(0);\n }\n}\nFixed processing of negative temperatue values\/*****************************************************************************************\/\/**\n* @file sensortag.cpp\n*\n* Copyright (c)\n* SmartRoboticSystems\n* December 2015\n*\n* This program creates connection to SensorTag 2650 using hcitool & gatttool, starts\n* temperature, light and humidity measurements, set up and process notifications,\n* computes real world data and saves results to files temperature.txt, humidity.txt,\n* light.txt on \"IoT\/data\/\" filepath. Child process & stdin\/stdout redirection is utilized\n*\n* Licensed under the EUPL V.1.1\n*\n* This Software is provided to You under the terms of the European\n* Union Public License (the \"EUPL\") version 1.1 as published by the\n* European Union. Any use of this Software, other than as authorized\n* under this License is strictly prohibited (to the extent such use\n* is covered by a right of the copyright holder of this Software).\n*\n* This Software is provided under the License on an \"AS IS\" basis and\n* without warranties of any kind concerning the Software, including\n* without limitation merchantability, fitness for a particular purpose,\n* absence of defects or errors, accuracy, and non-infringement of\n* intellectual property rights other than copyright. This disclaimer\n* of warranty is an essential part of the License and a condition for\n* the grant of any rights to this Software.\n******************************************************************************\/\n\n#include \n#include \n#include \n#include \n#include \n\n#include \n#include \n#include \n#include \n#include \n\n#include \"filepaths.h\"\n\n#define PIPE_READ 0\n#define PIPE_WRITE 1\n\nint createChildProcess(const char* command, char* const arguments[], char* const environment[])\n{\n int stdin_pipe[2];\n int stdout_pipe[2];\n int child_num;\n int execve_result;\n char act_char;\n\n if (pipe(stdin_pipe) < 0)\n {\n perror(\"allocating pipe for child input redirect\");\n return -1;\n }\n if (pipe(stdout_pipe) < 0)\n {\n close(stdin_pipe[PIPE_READ]);\n close(stdin_pipe[PIPE_WRITE]);\n perror(\"allocating pipe for child output redirect\");\n return -1;\n }\n\n child_num = fork();\n if (0 == child_num)\n {\n \/\/ child continues here\n \/\/ redirect stdin\n if (dup2(stdin_pipe[PIPE_READ], STDIN_FILENO) == -1)\n {\n perror(\"redirecting stdin\");\n return -1;\n }\n\n \/\/ redirect stdout\n if (dup2(stdout_pipe[PIPE_WRITE], STDOUT_FILENO) == -1)\n {\n perror(\"redirecting stdout\");\n return -1;\n }\n\n \/\/ redirect stderr\n if (dup2(stdout_pipe[PIPE_WRITE], STDERR_FILENO) == -1)\n {\n perror(\"redirecting stderr\");\n return -1;\n }\n\n \/\/ all these are for use by parent only\n close(stdin_pipe[PIPE_READ]);\n close(stdin_pipe[PIPE_WRITE]);\n close(stdout_pipe[PIPE_READ]);\n close(stdout_pipe[PIPE_WRITE]);\n\n \/\/ run child process image\n execve_result = execve(command, arguments, environment);\n\n \/\/ if we get here at all, an error occurred, but we are in the child\n \/\/ process, so just exit\n perror(\"exec of the child process\");\n exit(execve_result);\n }\n else if (child_num > 0)\n {\n \/\/ parent continues here\n\n \/\/ close unused file descriptors, these are for child only\n close(stdin_pipe[PIPE_READ]);\n close(stdout_pipe[PIPE_WRITE]);\n\n \/\/==============================================================\n \/\/ Connect\n \/\/==============================================================\n const char* connect_message = \"connect \\r\\n\";\n if (NULL != connect_message)\n write(stdin_pipe[PIPE_WRITE], connect_message, strlen(connect_message));\n\n \/\/Read console output\n do {\n read(stdout_pipe[PIPE_READ], &act_char, 1);\n write(STDOUT_FILENO, &act_char, 1);\n } while (act_char != '\\n');\n\n usleep(1000000);\n\n \/\/==============================================================\n \/\/ Start Temperature measurement\n \/\/==============================================================\n\n \/\/Start measurement\n const char* start_temperature = \"char-write-req 0x24 01 \\r\\n\";\n if (NULL != start_temperature)\n write(stdin_pipe[PIPE_WRITE], start_temperature, strlen(start_temperature));\n\n \/\/Turn on notifications\n const char* read_temperature = \"char-write-req 0x22 0100 \\r\\n\";\n if (NULL != read_temperature)\n write(stdin_pipe[PIPE_WRITE], read_temperature, strlen(read_temperature));\n\n \/\/Set notification period to 2.5 sec\n const char* temperature_period = \"char-write-req 0x26 0xFA \\r\\n\";\n if (NULL != temperature_period)\n write(stdin_pipe[PIPE_WRITE], temperature_period, strlen(temperature_period));\n\n\n \/\/==============================================================\n \/\/ Start Light measurement\n \/\/==============================================================\n\n \/\/Start measurement\n const char* start_light = \"char-write-req 0x44 01 \\r\\n\";\n if (NULL != start_light)\n write(stdin_pipe[PIPE_WRITE], start_light, strlen(start_light));\n\n \/\/Turn on notifications\n const char* read_light = \"char-write-req 0x42 0100 \\r\\n\";\n if (NULL != read_light)\n write(stdin_pipe[PIPE_WRITE], read_light, strlen(read_light));\n\n \/\/Set notification period to 2.5 sec\n const char* light_period = \"char-write-req 0x46 0xFA \\r\\n\";\n if (NULL != light_period)\n write(stdin_pipe[PIPE_WRITE], light_period, strlen(light_period));\n\n\n \/\/==============================================================\n \/\/ Start Humidity measurement\n \/\/==============================================================\n\n \/\/Start measurement\n const char* start_humidity = \"char-write-req 0x2c 01 \\r\\n\";\n if (NULL != start_humidity)\n write(stdin_pipe[PIPE_WRITE], start_humidity, strlen(start_humidity));\n\n \/\/Turn on notifications\n const char* read_humidity = \"char-write-req 0x2A 0100 \\r\\n\";\n if (NULL != read_humidity)\n write(stdin_pipe[PIPE_WRITE], read_humidity, strlen(read_humidity));\n\n \/\/Set notification period to 2.5 sec\n const char* humidity_period = \"char-write-req 0x2e 0xFA \\r\\n\";\n if (NULL != humidity_period)\n write(stdin_pipe[PIPE_WRITE], humidity_period, strlen(humidity_period));\n\n\/* \/\/==============================================================\n \/\/ Start Barometer measurement\n \/\/==============================================================\n\n \/\/Start measurement\n const char* start_barometer = \"char-write-req 0x34 01 \\r\\n\";\n if (NULL != start_barometer)\n write(aStdinPipe[PIPE_WRITE], start_barometer, strlen(start_barometer));\n\n \/\/Turn on notifications\n const char* read_barometer = \"char-write-req 0x32 0100 \\r\\n\";\n if (NULL != read_barometer)\n write(aStdinPipe[PIPE_WRITE], read_barometer, strlen(read_barometer));\n\n \/\/Set notification period to 2.5 sec\n const char* barometer_period = \"char-write-req 0x36 0xFA \\r\\n\";\n if (NULL != barometer_period)\n write(aStdinPipe[PIPE_WRITE], barometer_period, strlen(barometer_period));\n*\/\n\n \/\/==============================================================\n \/\/ Process notifications\n \/\/==============================================================\n\n double humidity = 0;\n double temperature = 0;\n double light = 0;\n double barometer = 0;\n\n const std::string temp_handle = \"0x0021\";\n const std::string light_handle = \"0x0041\";\n const std::string humidity_handle = \"0x0029\";\n const std::string barometer_handle = \"0x0031\";\n bool new_measurement = false;\n\n while(1)\n {\n std::string actual_line;\n\n do {\n read(stdout_pipe[PIPE_READ], &act_char, 1);\n actual_line += act_char;\n } while (act_char != '\\n');\n\n \/\/Temperature notification\n int temperature_index = actual_line.find(temp_handle);\n\n if(temperature_index != -1)\n {\n new_measurement = true;\n std::string temp;\n unsigned int temperature_bytes[2];\n\n \/\/Extract bytes from string notifications\n temp = actual_line.substr(temperature_index + 20, 2);\n temperature_bytes[0] = strtoul(temp.c_str(), 0, 16);\n\n temp = actual_line.substr(temperature_index + 23,2);\n temperature_bytes[1] = strtoul(temp.c_str(), 0, 16);\n\n \/\/Merge bytes\n unsigned int temperature_raw = (temperature_bytes[1] << 8) + temperature_bytes[0];\n\n \/\/Compute and filter final value\n if((temperature > 0) && (temperature < 32768))\n temperature = temperature_raw\/128.0; \/\/Positive temperature values\n else if (temperature > 32768)\n temperature = (temperature_raw - 65536) \/ 128.0; \/\/Negative temperature values\n else\n temperature = temperature; \/\/Filtering false zero measurements\n }\n\n \/\/Light notification\n int light_index = actual_line.find(light_handle);\n if(light_index != -1)\n {\n new_measurement = true;\n std::string temp;\n unsigned int light_bytes[2];\n\n \/\/Extract bytes from string notifications\n temp = actual_line.substr(light_index + 14, 2);\n light_bytes[0] = strtoul(temp.c_str(), 0, 16);\n\n temp = actual_line.substr(light_index + 17, 2);\n light_bytes[1] = strtoul(temp.c_str(), 0, 16);\n\n \/\/Compute exponent and fraction according to formula\n unsigned int exponent = (light_bytes[1] & 0b11110000) >> 4;\n unsigned int fraction = ((light_bytes[1] & 0b00001111) << 8) + light_bytes[0];\n\n \/\/Compute final value\n light = 0.01 * pow(2,exponent) * fraction;\n }\n\n \/\/Humidity notification\n int humidity_index = actual_line.find(humidity_handle);\n if(humidity_index != -1)\n {\n new_measurement = true;\n std::string temp;\n unsigned int humidity_bytes[2];\n\n \/\/Extract bytes from string notification\n temp = actual_line.substr(humidity_index + 20, 2);\n humidity_bytes[0] = strtoul(temp.c_str(), 0, 16);\n\n temp = actual_line.substr(humidity_index + 23,2);\n humidity_bytes[1] = strtoul(temp.c_str(), 0, 16);\n\n \/\/Merge bytes\n unsigned int humidity_raw = (humidity_bytes[1] << 8) + humidity_bytes[0];\n\n \/\/Clear 2 LSB\n humidity_raw &= ~0x0003;\n\n \/\/Cast to double\n humidity = static_cast(humidity_raw);\n\n \/\/Compute final value\n humidity = 125*(humidity\/65536) - 6;\n }\n\n \/\/Print if new measurement occured\n if(new_measurement == true)\n {\n std::cout << \"Temp: \" << std::setprecision(4) << std::setw(5) << std::setfill(' ') << temperature << \" [°C]\"\n << \" Light: \" << std::setprecision(4) << std::setw(5) << std::setfill(' ') << light << \" [lux]\"\n << \" Humidity: \" << std::setprecision(4) << std::setw(5) << std::setfill(' ') << humidity << \" [%]\" << std::endl;\n\n \/\/Clear the flag\n new_measurement = false;\n\n std::ofstream temperature_minute;\n std::ofstream humidity_minute;\n std::ofstream light_minute;\n\n \/\/Try to open the _MINUTE file for writing\n do {\n temperature_minute.open(TEMPERATURE_MINUTE_FILEPATH);\n } while((temperature_minute.is_open()) == 0);\n\n temperature_minute << temperature;\n temperature_minute.close();\n\n do {\n humidity_minute.open(HUMIDITY_MINUTE_FILEPATH);\n } while((humidity_minute.is_open()) == 0);\n\n humidity_minute << humidity;\n humidity_minute.close();\n\n do {\n light_minute.open(LIGHT_MINUTE_FILEPATH);\n } while((light_minute.is_open()) == 0);\n\n light_minute << light;\n light_minute.close();\n }\n }\n\n \/\/==============================================================\n \/\/ Exit\n \/\/==============================================================\n const char* exit_communication = \"exit\\r\\n\";\n if (NULL != exit_communication) {\n write(stdin_pipe[PIPE_WRITE], exit_communication, strlen(exit_communication));\n }\n\n \/\/ done with these in this example program, you would normally keep these\n \/\/ open of course as long as you want to talk to the child\n close(stdin_pipe[PIPE_WRITE]);\n close(stdout_pipe[PIPE_READ]);\n }\n else\n {\n \/\/ failed to create child\n close(stdin_pipe[PIPE_READ]);\n close(stdin_pipe[PIPE_WRITE]);\n close(stdout_pipe[PIPE_READ]);\n close(stdout_pipe[PIPE_WRITE]);\n }\n return child_num;\n}\n\nint main(int argc, char* argv[])\n{\n if(argc < 2)\n {\n std::cerr << \"Error: missing argument! Correct Usage: .\/iot AA:BB:CC:DD:EE:FF\" << std::endl;\n return(-1);\n }\n else if(argc == 2)\n {\n char* args[4];\n\n args[0] = const_cast(\"gatttool\");\n args[1] = const_cast(\"-b\");\n args[2] = argv[1];\n args[3] = const_cast(\"-I\");\n\n std::cout << \"Connecting to device: [\" << argv[1] << \"]\" << std::endl;\n std::string hcitool_lecc(\"sudo hcitool lecc \");\n hcitool_lecc += argv[1];\n system(hcitool_lecc.c_str());\n\n \/\/Create separate process + redirect console\n createChildProcess(\"\/usr\/bin\/gatttool\",args, NULL);\n\n std::cout << \"Disconnecting from device: [\" << argv[1] << \"]\" << std::endl;\n std::string hcitool_cc(\"sudo hcitool cc \");\n hcitool_cc += argv[1];\n system(hcitool_cc.c_str());\n\n return(0);\n }\n}\n<|endoftext|>"} {"text":"#include \"singletons.h\"\n\nstd::unique_ptr Singleton::Config::source_=std::unique_ptr(new Source::Config());\nstd::unique_ptr Singleton::Config::directories_=std::unique_ptr(new Directories::Config());\nstd::unique_ptr Singleton::Config::terminal_=std::unique_ptr(new Terminal::Config());\nstd::unique_ptr Singleton::Config::window_ = std::unique_ptr(new Window::Config());\nstd::unique_ptr Singleton::terminal_=std::unique_ptr();\nstd::unique_ptr Singleton::directories_=std::unique_ptr();\nstd::unique_ptr Singleton::window_=std::unique_ptr();\n\nTerminal *Singleton::terminal() {\n if(!terminal_)\n terminal_=std::unique_ptr(new Terminal());\n return terminal_.get();\n}\n\nDirectories *Singleton::directories() {\n if(!directories_)\n directories_=std::unique_ptr(new Directories());\n return directories_.get();\n}\n\nWindow *Singleton::window() {\n if(!window_)\n window_=std::unique_ptr(new Window());\n return window_.get();\n}\n\nstd::unique_ptr Singleton::status_=std::unique_ptr();\nGtk::Label *Singleton::status() {\n if(!status_)\n status_=std::unique_ptr(new Gtk::Label());\n return status_.get();\n}\nstd::unique_ptr Singleton::info_=std::unique_ptr();\nGtk::Label *Singleton::info() {\n if(!info_)\n info_=std::unique_ptr(new Gtk::Label());\n return info_.get();\n}\n\nboost::filesystem::path Singleton::create_config_path(const std::string &subfolder) {\n auto home = filesystem::get_home_folder();\n if(home.empty()) {\n Singleton::terminal()->print(\"Could not find\/write to home directory. Using defaults, no settings will be saved.\");\n home = filesystem::get_tmp_folder();\n if(home.empty()) {\n std::string message(\"Please fix permissions of your home folder\");\n std::cerr << message << std::endl;\n JFATAL(message);\n throw new std::exception;\n }\n }\n home \/= subfolder;\n return home;\n}\n\nboost::filesystem::path Singleton::config_dir() { return create_config_path(\".juci\/config\"); }\nboost::filesystem::path Singleton::log_dir() { return create_config_path(\".juci\/log\"); }\nboost::filesystem::path Singleton::style_dir() { return create_config_path(\".juci\/styles\"); }\nstd::string Singleton::config_json() {\n auto conf_dir = Singleton::config_dir();\n conf_dir \/= \"config.json\"; \/\/ to ensure correct paths on windows\n return conf_dir.string();\n}\n\nBegin simplify of paths#include \"singletons.h\"\n\nstd::unique_ptr Singleton::Config::source_=std::unique_ptr(new Source::Config());\nstd::unique_ptr Singleton::Config::directories_=std::unique_ptr(new Directories::Config());\nstd::unique_ptr Singleton::Config::terminal_=std::unique_ptr(new Terminal::Config());\nstd::unique_ptr Singleton::Config::window_ = std::unique_ptr(new Window::Config());\nstd::unique_ptr Singleton::terminal_=std::unique_ptr();\nstd::unique_ptr Singleton::directories_=std::unique_ptr();\nstd::unique_ptr Singleton::window_=std::unique_ptr();\n\nTerminal *Singleton::terminal() {\n if(!terminal_)\n terminal_=std::unique_ptr(new Terminal());\n return terminal_.get();\n}\n\nDirectories *Singleton::directories() {\n if(!directories_)\n directories_=std::unique_ptr(new Directories());\n return directories_.get();\n}\n\nWindow *Singleton::window() {\n if(!window_)\n window_=std::unique_ptr(new Window());\n return window_.get();\n}\n\nstd::unique_ptr Singleton::status_=std::unique_ptr();\nGtk::Label *Singleton::status() {\n if(!status_)\n status_=std::unique_ptr(new Gtk::Label());\n return status_.get();\n}\nstd::unique_ptr Singleton::info_=std::unique_ptr();\nGtk::Label *Singleton::info() {\n if(!info_)\n info_=std::unique_ptr(new Gtk::Label());\n return info_.get();\n}\n\nboost::filesystem::path Singleton::create_config_path(const std::string &subfolder) {\n auto home = filesystem::get_home_folder();\n if(home.empty()) {\n Singleton::terminal()->print(\"Could not find\/write to home directory. Using defaults, no settings will be saved.\");\n home = filesystem::get_tmp_folder();\n if(home.empty()) {\n std::string message(\"Please fix permissions of your home folder\");\n std::cerr << message << std::endl;\n JFATAL(message);\n throw new std::exception;\n }\n }\n home \/= subfolder;\n return home;\n}\n\nboost::filesystem::path Singleton::config_dir() { return create_config_path({\".juci\", \"config\"}); }\nboost::filesystem::path Singleton::log_dir() { return create_config_path({\".juci\", \"log\"}); }\nboost::filesystem::path Singleton::style_dir() { return create_config_path({\".juci\", \"styles\"}); }\nstd::string Singleton::config_json() { return (Singleton::config_dir()\/\"config.json\").string(); }\n\n<|endoftext|>"} {"text":"\/*\n* Copyright (c) 2013-2020 Fredrik Mellbin\n*\n* This file is part of VapourSynth.\n*\n* VapourSynth is free software; you can redistribute it and\/or\n* modify it under the terms of the GNU Lesser General Public\n* License as published by the Free Software Foundation; either\n* version 2.1 of the License, or (at your option) any later version.\n*\n* VapourSynth is distributed in the hope that it will be useful,\n* but WITHOUT ANY WARRANTY; without even the implied warranty of\n* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU\n* Lesser General Public License for more details.\n*\n* You should have received a copy of the GNU Lesser General Public\n* License along with VapourSynth; if not, write to the Free Software\n* Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA\n*\/\n\n#include \"VapourSynth4.h\"\n#include \"VSScript4.h\"\n#include \"cython\/vapoursynth_api.h\"\n#include \n#include \n#include \n\n#ifdef VS_TARGET_OS_WINDOWS\n#define WIN32_LEAN_AND_MEAN\n#define NOMINMAX\n#include \n#endif\n\nstatic std::once_flag flag;\n\nstruct VSScript : public VPYScriptExport {\n};\n\nstatic std::mutex vsscriptlock;\nstatic std::atomic initializationCount(0);\nstatic std::atomic scriptId(1000);\nstatic bool initialized = false;\nstatic PyThreadState *ts = nullptr;\nstatic PyGILState_STATE s;\n\nstatic void real_init(void) VS_NOEXCEPT {\n#ifdef VS_TARGET_OS_WINDOWS\n#ifdef _WIN64\n #define VS_INSTALL_REGKEY L\"Software\\\\VapourSynth\" \n#else\n #define VS_INSTALL_REGKEY L\"Software\\\\VapourSynth-32\"\n#endif\n\n \/\/ portable\n const std::wstring pythonDllName = L\"python38.dll\";\n HMODULE module;\n GetModuleHandleExW(GET_MODULE_HANDLE_EX_FLAG_FROM_ADDRESS, (LPCWSTR)&real_init, &module);\n std::vector pathBuf(65536);\n GetModuleFileNameW(module, pathBuf.data(), (DWORD)pathBuf.size());\n std::wstring dllPath = pathBuf.data();\n dllPath.resize(dllPath.find_last_of('\\\\') + 1);\n std::wstring portableFilePath = dllPath + L\"portable.vs\";\n FILE *portableFile = _wfopen(portableFilePath.c_str(), L\"rb\");\n bool isPortable = !!portableFile;\n if (portableFile)\n fclose(portableFile);\n\n HMODULE pythonDll = nullptr;\n\n if (isPortable) {\n std::wstring pyPath = dllPath + L\"\\\\\" + pythonDllName;\n pythonDll = LoadLibraryExW(pyPath.c_str(), nullptr, LOAD_LIBRARY_SEARCH_DEFAULT_DIRS | LOAD_LIBRARY_SEARCH_DLL_LOAD_DIR);\n } else {\n DWORD dwType = REG_SZ;\n HKEY hKey = 0;\n\n wchar_t value[1024];\n DWORD valueLength = 1000;\n if (RegOpenKeyW(HKEY_CURRENT_USER, VS_INSTALL_REGKEY, &hKey) != ERROR_SUCCESS) {\n if (RegOpenKeyW(HKEY_LOCAL_MACHINE, VS_INSTALL_REGKEY, &hKey) != ERROR_SUCCESS)\n return;\n }\n\n LSTATUS status = RegQueryValueExW(hKey, L\"PythonPath\", nullptr, &dwType, (LPBYTE)&value, &valueLength);\n RegCloseKey(hKey);\n if (status != ERROR_SUCCESS)\n return;\n\n std::wstring pyPath = value;\n pyPath += L\"\\\\\" + pythonDllName;\n\n pythonDll = LoadLibraryExW(pyPath.c_str(), nullptr, LOAD_LIBRARY_SEARCH_DEFAULT_DIRS | LOAD_LIBRARY_SEARCH_DLL_LOAD_DIR);\n }\n if (!pythonDll)\n return;\n#endif\n int preInitialized = Py_IsInitialized();\n if (!preInitialized)\n Py_InitializeEx(0);\n s = PyGILState_Ensure();\n if (import_vapoursynth())\n return;\n if (vpy_initVSScript())\n return;\n ts = PyEval_SaveThread();\n initialized = true;\n}\n\nVS_API(int) vsscript_getApiVersion(void) VS_NOEXCEPT {\n return VSSCRIPT_API_VERSION;\n}\n\nVS_API(int) vsscript_init() VS_NOEXCEPT {\n std::lock_guard lock(vsscriptlock);\n std::call_once(flag, real_init);\n if (initialized)\n return ++initializationCount;\n else\n return initializationCount;\n}\n\nVS_API(int) vsscript_finalize(void) VS_NOEXCEPT {\n std::lock_guard lock(vsscriptlock);\n int count = --initializationCount;\n assert(count >= 0);\n return count;\n}\n\nstatic int vsscript_createScriptInternal(VSScript **handle) VS_NOEXCEPT {\n *handle = new(std::nothrow)VSScript();\n if (*handle) {\n (*handle)->pyenvdict = nullptr;\n (*handle)->errstr = nullptr;\n (*handle)->id = ++scriptId;\n return vpy_createScript(*handle);\n } else {\n return 1;\n }\n}\n\nVS_API(int) vsscript_createScript(VSScript **handle) VS_NOEXCEPT {\n std::lock_guard lock(vsscriptlock);\n return vsscript_createScriptInternal(handle);\n}\n\nVS_API(int) vsscript_evaluateScript(VSScript **handle, const char *script, const char *scriptFilename, int flags) VS_NOEXCEPT {\n std::lock_guard lock(vsscriptlock);\n if (*handle == nullptr) {\n if (vsscript_createScriptInternal(handle)) return 1;\n }\n return vpy_evaluateScript(*handle, script, scriptFilename ? scriptFilename : \"\", flags);\n}\n\nVS_API(int) vsscript_evaluateFile(VSScript **handle, const char *scriptFilename, int flags) VS_NOEXCEPT {\n std::lock_guard lock(vsscriptlock);\n if (*handle == nullptr) {\n if (vsscript_createScriptInternal(handle)) return 1;\n }\n return vpy_evaluateFile(*handle, scriptFilename, flags);\n}\n\nVS_API(void) vsscript_freeScript(VSScript *handle) VS_NOEXCEPT {\n std::lock_guard lock(vsscriptlock);\n if (handle) {\n vpy_freeScript(handle);\n delete handle;\n }\n}\n\nVS_API(const char *) vsscript_getError(VSScript *handle) VS_NOEXCEPT {\n std::lock_guard lock(vsscriptlock);\n if (handle)\n return vpy_getError(handle);\n else\n return \"Invalid handle (NULL)\";\n}\n\n\/\/ V3 API compatibility\n\/\/ FIXME, check for audio nodes and return null\nVS_API(VSNodeRef *) vsscript_getOutput(VSScript *handle, int index) VS_NOEXCEPT {\n std::lock_guard lock(vsscriptlock);\n return vpy_getOutput(handle, index);\n}\n\n\/\/ V3 API compatibility\n\/\/ FIXME, check for audio nodes and return null\nVS_API(VSNodeRef *) vsscript_getOutput2(VSScript *handle, int index, VSNodeRef **alpha) VS_NOEXCEPT {\n std::lock_guard lock(vsscriptlock);\n return vpy_getOutput2(handle, index, alpha);\n}\n\nstatic VSNodeRef *VS_CC vsscript_getOutput4(VSScript *handle, int index, VSNodeRef **alpha) VS_NOEXCEPT {\n std::lock_guard lock(vsscriptlock);\n return vpy_getOutput2(handle, index, alpha);\n}\n\nVS_API(int) vsscript_clearOutput(VSScript *handle, int index) VS_NOEXCEPT {\n std::lock_guard lock(vsscriptlock);\n return vpy_clearOutput(handle, index);\n}\n\nVS_API(VSCore *) vsscript_getCore(VSScript *handle) VS_NOEXCEPT {\n std::lock_guard lock(vsscriptlock);\n return vpy_getCore(handle);\n}\n\n\/\/ V3 API compatibility\nVS_API(const VSAPI *) vsscript_getVSApi(void) VS_NOEXCEPT {\n std::lock_guard lock(vsscriptlock);\n return vpy_getVSApi2(3);\n}\n\nVS_API(const VSAPI *) vsscript_getVSApi2(int version) VS_NOEXCEPT {\n \/\/ it's possible no lock is needed here but do it just to be sure\n std::lock_guard lock(vsscriptlock);\n return vpy_getVSApi2(version);\n}\n\n\/\/ FIXME, needs check to prevent audio types from escaping to V3\nVS_API(int) vsscript_getVariable(VSScript *handle, const char *name, VSMap *dst) VS_NOEXCEPT {\n std::lock_guard lock(vsscriptlock);\n return vpy_getVariable(handle, name, dst);\n}\n\nVS_API(int) vsscript_setVariable(VSScript *handle, const VSMap *vars) VS_NOEXCEPT {\n std::lock_guard lock(vsscriptlock);\n return vpy_setVariable(handle, vars);\n}\n\nVS_API(int) vsscript_clearVariable(VSScript *handle, const char *name) VS_NOEXCEPT {\n std::lock_guard lock(vsscriptlock);\n return vpy_clearVariable(handle, name);\n}\n\nVS_API(void) vsscript_clearEnvironment(VSScript *handle) VS_NOEXCEPT {\n std::lock_guard lock(vsscriptlock);\n vpy_clearEnvironment(handle);\n}\n\nstatic VSSCRIPTAPI vsscript_api = {\n &vsscript_getApiVersion,\n &vsscript_getVSApi2,\n &vsscript_init,\n &vsscript_finalize,\n &vsscript_evaluateScript,\n &vsscript_evaluateFile,\n &vsscript_createScript,\n &vsscript_freeScript,\n &vsscript_getError,\n &vsscript_getOutput4,\n &vsscript_clearOutput,\n &vsscript_getCore,\n &vsscript_getVariable,\n &vsscript_setVariable,\n &vsscript_clearVariable,\n &vsscript_clearEnvironment\n};\n\nconst VSSCRIPTAPI *VS_CC getVSScriptAPI(int version) VS_NOEXCEPT {\n int apiMajor = (version >> 16);\n int apiMinor = (apiMajor & 0xFFFF);\n\n if (apiMajor == VSSCRIPT_API_MAJOR && apiMinor <= VSSCRIPT_API_MINOR)\n return &vsscript_api;\n return nullptr;\n}Prevent audio nodes from escaping into the V3 api in vsscript\/*\n* Copyright (c) 2013-2020 Fredrik Mellbin\n*\n* This file is part of VapourSynth.\n*\n* VapourSynth is free software; you can redistribute it and\/or\n* modify it under the terms of the GNU Lesser General Public\n* License as published by the Free Software Foundation; either\n* version 2.1 of the License, or (at your option) any later version.\n*\n* VapourSynth is distributed in the hope that it will be useful,\n* but WITHOUT ANY WARRANTY; without even the implied warranty of\n* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU\n* Lesser General Public License for more details.\n*\n* You should have received a copy of the GNU Lesser General Public\n* License along with VapourSynth; if not, write to the Free Software\n* Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA\n*\/\n\n#include \"VapourSynth4.h\"\n#include \"VSScript4.h\"\n#include \"cython\/vapoursynth_api.h\"\n#include \n#include \n#include \n\n#ifdef VS_TARGET_OS_WINDOWS\n#define WIN32_LEAN_AND_MEAN\n#define NOMINMAX\n#include \n#endif\n\nstatic std::once_flag flag;\n\nstruct VSScript : public VPYScriptExport {\n};\n\nstatic std::mutex vsscriptlock;\nstatic std::atomic initializationCount(0);\nstatic std::atomic scriptId(1000);\nstatic bool initialized = false;\nstatic PyThreadState *ts = nullptr;\nstatic PyGILState_STATE s;\n\nstatic void real_init(void) VS_NOEXCEPT {\n#ifdef VS_TARGET_OS_WINDOWS\n#ifdef _WIN64\n #define VS_INSTALL_REGKEY L\"Software\\\\VapourSynth\" \n#else\n #define VS_INSTALL_REGKEY L\"Software\\\\VapourSynth-32\"\n#endif\n\n \/\/ portable\n const std::wstring pythonDllName = L\"python38.dll\";\n HMODULE module;\n GetModuleHandleExW(GET_MODULE_HANDLE_EX_FLAG_FROM_ADDRESS, (LPCWSTR)&real_init, &module);\n std::vector pathBuf(65536);\n GetModuleFileNameW(module, pathBuf.data(), (DWORD)pathBuf.size());\n std::wstring dllPath = pathBuf.data();\n dllPath.resize(dllPath.find_last_of('\\\\') + 1);\n std::wstring portableFilePath = dllPath + L\"portable.vs\";\n FILE *portableFile = _wfopen(portableFilePath.c_str(), L\"rb\");\n bool isPortable = !!portableFile;\n if (portableFile)\n fclose(portableFile);\n\n HMODULE pythonDll = nullptr;\n\n if (isPortable) {\n std::wstring pyPath = dllPath + L\"\\\\\" + pythonDllName;\n pythonDll = LoadLibraryExW(pyPath.c_str(), nullptr, LOAD_LIBRARY_SEARCH_DEFAULT_DIRS | LOAD_LIBRARY_SEARCH_DLL_LOAD_DIR);\n } else {\n DWORD dwType = REG_SZ;\n HKEY hKey = 0;\n\n wchar_t value[1024];\n DWORD valueLength = 1000;\n if (RegOpenKeyW(HKEY_CURRENT_USER, VS_INSTALL_REGKEY, &hKey) != ERROR_SUCCESS) {\n if (RegOpenKeyW(HKEY_LOCAL_MACHINE, VS_INSTALL_REGKEY, &hKey) != ERROR_SUCCESS)\n return;\n }\n\n LSTATUS status = RegQueryValueExW(hKey, L\"PythonPath\", nullptr, &dwType, (LPBYTE)&value, &valueLength);\n RegCloseKey(hKey);\n if (status != ERROR_SUCCESS)\n return;\n\n std::wstring pyPath = value;\n pyPath += L\"\\\\\" + pythonDllName;\n\n pythonDll = LoadLibraryExW(pyPath.c_str(), nullptr, LOAD_LIBRARY_SEARCH_DEFAULT_DIRS | LOAD_LIBRARY_SEARCH_DLL_LOAD_DIR);\n }\n if (!pythonDll)\n return;\n#endif\n int preInitialized = Py_IsInitialized();\n if (!preInitialized)\n Py_InitializeEx(0);\n s = PyGILState_Ensure();\n if (import_vapoursynth())\n return;\n if (vpy_initVSScript())\n return;\n ts = PyEval_SaveThread();\n initialized = true;\n}\n\nVS_API(int) vsscript_getApiVersion(void) VS_NOEXCEPT {\n return VSSCRIPT_API_VERSION;\n}\n\nVS_API(int) vsscript_init() VS_NOEXCEPT {\n std::lock_guard lock(vsscriptlock);\n std::call_once(flag, real_init);\n if (initialized)\n return ++initializationCount;\n else\n return initializationCount;\n}\n\nVS_API(int) vsscript_finalize(void) VS_NOEXCEPT {\n std::lock_guard lock(vsscriptlock);\n int count = --initializationCount;\n assert(count >= 0);\n return count;\n}\n\nstatic int vsscript_createScriptInternal(VSScript **handle) VS_NOEXCEPT {\n *handle = new(std::nothrow)VSScript();\n if (*handle) {\n (*handle)->pyenvdict = nullptr;\n (*handle)->errstr = nullptr;\n (*handle)->id = ++scriptId;\n return vpy_createScript(*handle);\n } else {\n return 1;\n }\n}\n\nVS_API(int) vsscript_createScript(VSScript **handle) VS_NOEXCEPT {\n std::lock_guard lock(vsscriptlock);\n return vsscript_createScriptInternal(handle);\n}\n\nVS_API(int) vsscript_evaluateScript(VSScript **handle, const char *script, const char *scriptFilename, int flags) VS_NOEXCEPT {\n std::lock_guard lock(vsscriptlock);\n if (*handle == nullptr) {\n if (vsscript_createScriptInternal(handle)) return 1;\n }\n return vpy_evaluateScript(*handle, script, scriptFilename ? scriptFilename : \"\", flags);\n}\n\nVS_API(int) vsscript_evaluateFile(VSScript **handle, const char *scriptFilename, int flags) VS_NOEXCEPT {\n std::lock_guard lock(vsscriptlock);\n if (*handle == nullptr) {\n if (vsscript_createScriptInternal(handle)) return 1;\n }\n return vpy_evaluateFile(*handle, scriptFilename, flags);\n}\n\nVS_API(void) vsscript_freeScript(VSScript *handle) VS_NOEXCEPT {\n std::lock_guard lock(vsscriptlock);\n if (handle) {\n vpy_freeScript(handle);\n delete handle;\n }\n}\n\nVS_API(const char *) vsscript_getError(VSScript *handle) VS_NOEXCEPT {\n std::lock_guard lock(vsscriptlock);\n if (handle)\n return vpy_getError(handle);\n else\n return \"Invalid handle (NULL)\";\n}\n\n\/\/ V3 API compatibility\nVS_API(VSNodeRef *) vsscript_getOutput(VSScript *handle, int index) VS_NOEXCEPT {\n return vsscript_getOutput2(handle, index, nullptr);\n}\n\n\/\/ V3 API compatibility\nVS_API(VSNodeRef *) vsscript_getOutput2(VSScript *handle, int index, VSNodeRef **alpha) VS_NOEXCEPT {\n std::lock_guard lock(vsscriptlock);\n VSNodeRef *node = vpy_getOutput2(handle, index, alpha);\n const VSAPI *vsapi = vsscript_getVSApi2(VAPOURSYNTH_API_VERSION);\n if (node && vsapi->getNodeType(node) == mtAudio) {\n vsapi->freeNode(node);\n if (alpha) {\n vsapi->freeNode(*alpha);\n *alpha = nullptr;\n }\n return nullptr;\n }\n return node;\n}\n\nstatic VSNodeRef *VS_CC vsscript_getOutputAPI4(VSScript *handle, int index, VSNodeRef **alpha) VS_NOEXCEPT {\n std::lock_guard lock(vsscriptlock);\n return vpy_getOutput2(handle, index, alpha);\n}\n\nVS_API(int) vsscript_clearOutput(VSScript *handle, int index) VS_NOEXCEPT {\n std::lock_guard lock(vsscriptlock);\n return vpy_clearOutput(handle, index);\n}\n\nVS_API(VSCore *) vsscript_getCore(VSScript *handle) VS_NOEXCEPT {\n std::lock_guard lock(vsscriptlock);\n return vpy_getCore(handle);\n}\n\n\/\/ V3 API compatibility\nVS_API(const VSAPI *) vsscript_getVSApi(void) VS_NOEXCEPT {\n std::lock_guard lock(vsscriptlock);\n return vpy_getVSApi2(3 << 16);\n}\n\nVS_API(const VSAPI *) vsscript_getVSApi2(int version) VS_NOEXCEPT {\n \/\/ it's possible no lock is needed here but do it just to be sure\n std::lock_guard lock(vsscriptlock);\n return vpy_getVSApi2(version);\n}\n\n\/\/ FIXME, needs check to prevent audio types from escaping to V3\nVS_API(int) vsscript_getVariable(VSScript *handle, const char *name, VSMap *dst) VS_NOEXCEPT {\n std::lock_guard lock(vsscriptlock);\n return vpy_getVariable(handle, name, dst);\n}\n\nVS_API(int) vsscript_setVariable(VSScript *handle, const VSMap *vars) VS_NOEXCEPT {\n std::lock_guard lock(vsscriptlock);\n return vpy_setVariable(handle, vars);\n}\n\nVS_API(int) vsscript_clearVariable(VSScript *handle, const char *name) VS_NOEXCEPT {\n std::lock_guard lock(vsscriptlock);\n return vpy_clearVariable(handle, name);\n}\n\nVS_API(void) vsscript_clearEnvironment(VSScript *handle) VS_NOEXCEPT {\n std::lock_guard lock(vsscriptlock);\n vpy_clearEnvironment(handle);\n}\n\nstatic VSSCRIPTAPI vsscript_api = {\n &vsscript_getApiVersion,\n &vsscript_getVSApi2,\n &vsscript_init,\n &vsscript_finalize,\n &vsscript_evaluateScript,\n &vsscript_evaluateFile,\n &vsscript_createScript,\n &vsscript_freeScript,\n &vsscript_getError,\n &vsscript_getOutputAPI4,\n &vsscript_clearOutput,\n &vsscript_getCore,\n &vsscript_getVariable,\n &vsscript_setVariable,\n &vsscript_clearVariable,\n &vsscript_clearEnvironment\n};\n\nconst VSSCRIPTAPI *VS_CC getVSScriptAPI(int version) VS_NOEXCEPT {\n int apiMajor = (version >> 16);\n int apiMinor = (apiMajor & 0xFFFF);\n\n if (apiMajor == VSSCRIPT_API_MAJOR && apiMinor <= VSSCRIPT_API_MINOR)\n return &vsscript_api;\n return nullptr;\n}<|endoftext|>"} {"text":"\/\/---------------------------- dof_constraints_01.cc ---------------------------\n\/\/ $Id$\n\/\/ Version: $Name$ \n\/\/\n\/\/ Copyright (C) 2004 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\/\/---------------------------- dof_constraints_01.cc ---------------------------\n\n\n\/\/ check DoFConstraints::distribute_local_to_global for matrices\n\n#include \"..\/tests.h\"\n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n\n\ntemplate \nvoid test ()\n{\n deallog << dim << \"D\" << std::endl;\n \n Triangulation triangulation;\n GridGenerator::hyper_cube (triangulation);\n\n \/\/ refine the mesh in a random way so as to\n \/\/ generate as many hanging node\n \/\/ constraints as possible\n\/\/ triangulation.refine_global (4-dim);\n triangulation.refine_global (1);\n for (unsigned int i=0; i<1; ++i)\n {\n typename Triangulation::active_cell_iterator\n cell = triangulation.begin_active();\n for (unsigned int index=0; cell != triangulation.end(); ++cell, ++index)\n if (index % (3*dim) == 0)\n cell->set_refine_flag();\n triangulation.execute_coarsening_and_refinement ();\n }\n deallog << \"Number of cells: \" << triangulation.n_active_cells() << std::endl;\n \n \/\/ set up a DoFHandler and compute hanging\n \/\/ node constraints\n FE_Q fe(1);\n DoFHandler dof_handler (triangulation);\n dof_handler.distribute_dofs (fe);\n deallog << \"Number of dofs: \" << dof_handler.n_dofs() << std::endl;\n\n ConstraintMatrix constraints;\n DoFTools::make_hanging_node_constraints (dof_handler, constraints);\n constraints.close ();\n deallog << \"Number of constraints: \" << constraints.n_constraints() << std::endl;\n\n \/\/ then set up a sparsity pattern and two\n \/\/ matrices on top of it\n SparsityPattern sparsity (dof_handler.n_dofs(),\n dof_handler.n_dofs(),\n dof_handler.max_couplings_between_dofs());\n DoFTools::make_sparsity_pattern (dof_handler, sparsity);\n constraints.condense (sparsity);\n SparseMatrix A(sparsity), B(sparsity);\n\n \/\/ then fill the two matrices by setting up\n \/\/ bogus matrix entries and (1) writing\n \/\/ them into the matrix and condensing away\n \/\/ hanging node constraints later on, or\n \/\/ (2) distributing them right away\n std::vector local_dofs (fe.dofs_per_cell);\n FullMatrix local_matrix (fe.dofs_per_cell, fe.dofs_per_cell);\n for (typename DoFHandler::active_cell_iterator\n cell = dof_handler.begin_active();\n cell != dof_handler.end(); ++cell)\n {\n cell->get_dof_indices (local_dofs);\n local_matrix.clear ();\n for (unsigned int i=0; i ();\n\/\/ test<2> ();\n test<3> ();\n }\n catch (std::exception &exc)\n {\n std::cerr << std::endl << std::endl\n\t\t<< \"----------------------------------------------------\"\n\t\t<< std::endl;\n std::cerr << \"Exception on processing: \" << std::endl\n\t\t<< exc.what() << std::endl\n\t\t<< \"Aborting!\" << std::endl\n\t\t<< \"----------------------------------------------------\"\n\t\t<< std::endl;\n \n return 1;\n }\n catch (...) \n {\n std::cerr << std::endl << std::endl\n\t\t<< \"----------------------------------------------------\"\n\t\t<< std::endl;\n std::cerr << \"Unknown exception!\" << std::endl\n\t\t<< \"Aborting!\" << std::endl\n\t\t<< \"----------------------------------------------------\"\n\t\t<< std::endl;\n return 1;\n };\n}\nRemove changes made when debugging.\/\/---------------------------- dof_constraints_01.cc ---------------------------\n\/\/ $Id$\n\/\/ Version: $Name$ \n\/\/\n\/\/ Copyright (C) 2004 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\/\/---------------------------- dof_constraints_01.cc ---------------------------\n\n\n\/\/ check DoFConstraints::distribute_local_to_global for matrices\n\n#include \"..\/tests.h\"\n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n\n\ntemplate \nvoid test ()\n{\n deallog << dim << \"D\" << std::endl;\n \n Triangulation triangulation;\n GridGenerator::hyper_cube (triangulation);\n\n \/\/ refine the mesh in a random way so as to\n \/\/ generate as many hanging node\n \/\/ constraints as possible\n triangulation.refine_global (4-dim);\n for (unsigned int i=0; i<11-2*dim; ++i)\n {\n typename Triangulation::active_cell_iterator\n cell = triangulation.begin_active();\n for (unsigned int index=0; cell != triangulation.end(); ++cell, ++index)\n if (index % (3*dim) == 0)\n cell->set_refine_flag();\n triangulation.execute_coarsening_and_refinement ();\n }\n deallog << \"Number of cells: \" << triangulation.n_active_cells() << std::endl;\n \n \/\/ set up a DoFHandler and compute hanging\n \/\/ node constraints\n FE_Q fe(1);\n DoFHandler dof_handler (triangulation);\n dof_handler.distribute_dofs (fe);\n deallog << \"Number of dofs: \" << dof_handler.n_dofs() << std::endl;\n\n ConstraintMatrix constraints;\n DoFTools::make_hanging_node_constraints (dof_handler, constraints);\n constraints.close ();\n deallog << \"Number of constraints: \" << constraints.n_constraints() << std::endl;\n\n \/\/ then set up a sparsity pattern and two\n \/\/ matrices on top of it\n SparsityPattern sparsity (dof_handler.n_dofs(),\n dof_handler.n_dofs(),\n dof_handler.max_couplings_between_dofs());\n DoFTools::make_sparsity_pattern (dof_handler, sparsity);\n constraints.condense (sparsity);\n SparseMatrix A(sparsity), B(sparsity);\n\n \/\/ then fill the two matrices by setting up\n \/\/ bogus matrix entries and (1) writing\n \/\/ them into the matrix and condensing away\n \/\/ hanging node constraints later on, or\n \/\/ (2) distributing them right away\n std::vector local_dofs (fe.dofs_per_cell);\n FullMatrix local_matrix (fe.dofs_per_cell, fe.dofs_per_cell);\n for (typename DoFHandler::active_cell_iterator\n cell = dof_handler.begin_active();\n cell != dof_handler.end(); ++cell)\n {\n cell->get_dof_indices (local_dofs);\n local_matrix.clear ();\n for (unsigned int i=0; i ();\n test<2> ();\n test<3> ();\n }\n catch (std::exception &exc)\n {\n std::cerr << std::endl << std::endl\n\t\t<< \"----------------------------------------------------\"\n\t\t<< std::endl;\n std::cerr << \"Exception on processing: \" << std::endl\n\t\t<< exc.what() << std::endl\n\t\t<< \"Aborting!\" << std::endl\n\t\t<< \"----------------------------------------------------\"\n\t\t<< std::endl;\n \n return 1;\n }\n catch (...) \n {\n std::cerr << std::endl << std::endl\n\t\t<< \"----------------------------------------------------\"\n\t\t<< std::endl;\n std::cerr << \"Unknown exception!\" << std::endl\n\t\t<< \"Aborting!\" << std::endl\n\t\t<< \"----------------------------------------------------\"\n\t\t<< std::endl;\n return 1;\n };\n}\n<|endoftext|>"} {"text":"\/* \n *\n * This file is part of the x0 web server project and is released under LGPL-3.\n *\n * (c) 2009 Chrisitan Parpart \n *\/\n\n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n\n\/**\n * \\ingroup modules\n * \\brief implements automatic content generation for raw directories\n *\/\nclass dirlisting_plugin :\n\tpublic x0::plugin\n{\nprivate:\n\tx0::handler::connection c;\n\npublic:\n\tdirlisting_plugin(x0::server& srv, const std::string& name) :\n\t\tx0::plugin(srv, name)\n\t{\n\t\tc = server_.generate_content.connect(boost::bind(&dirlisting_plugin::dirlisting, this, _1, _2));\n\t}\n\n\t~dirlisting_plugin()\n\t{\n\t\tserver_.generate_content.disconnect(c);\n\t}\n\n\tvirtual void configure()\n\t{\n\t\t\/\/ TODO get some kind of solution to let dir-listing only be used for directories we allow it for.\n\t}\n\nprivate:\n\tbool dirlisting(x0::request& in, x0::response& out)\n\t{\n\t\tif (!x0::isdir(in.entity)) return false;\n\n\t\tif (DIR *dir = opendir(in.entity.c_str()))\n\t\t{\n\t\t\tstd::list listing;\n\t\t\tlisting.push_back(\"..\");\n\n\t\t\tint len = offsetof(dirent, d_name) + pathconf(in.entity.c_str(), _PC_NAME_MAX);\n\t\t\tdirent *dep = (dirent *)new unsigned char[len + 1];\n\t\t\tdirent *res = 0;\n\n\t\t\twhile (readdir_r(dir, dep, &res) == 0 && res)\n\t\t\t{\n\t\t\t\tstd::string name(dep->d_name);\n\n\t\t\t\tif (name[0] != '.')\n\t\t\t\t{\n\t\t\t\t\tif (x0::isdir(in.entity + name)) name += \"\/\";\n\n\t\t\t\t\tlisting.push_back(name);\n\t\t\t\t}\n\t\t\t}\n\n\t\t\tdelete[] dep;\n\n\t\t\tstd::stringstream sstr;\n\t\t\tsstr << \"Directory: \"\n\t\t\t\t << in.path\n\t\t\t\t << \"<\/title><\/head>\\n<body>\\n\";\n\n\t\t\tsstr << \"<h2>Index of \" << in.path << \"<\/h2>\\n\";\n\t\t\tsstr << \"<ul>\\n\";\n\n\t\t\tfor (std::list<std::string>::iterator i = listing.begin(), e = listing.end(); i != e; ++i)\n\t\t\t{\n\t\t\t\tsstr << \"<li><a href='\" << *i << \"'>\" << *i << \"<\/a><\/li>\\n\";\n\t\t\t}\n\n\t\t\tsstr << \"<\/ul>\\n\";\n\n\t\t\tsstr << \"<hr\/>\\n\";\n\t\t\tsstr << \"<small><i>\" << in.connection.server().tag() << \"<\/i><\/small><br\/>\\n\";\n\n\t\t\tsstr << \"<\/body><\/html>\\n\";\n\n\t\t\tstd::string result(sstr.str());\n\n\t\t\tout.write(result);\n\t\t\tout *= x0::header(\"Content-Type\", \"text\/html\");\n\t\t\tout *= x0::header(\"Content-Length\", boost::lexical_cast<std::string>(result.size()));\n\n\t\t\tout.flush();\n\n\t\t\treturn true;\n\t\t}\n\t\treturn false;\n\t}\n};\n\nX0_EXPORT_PLUGIN(dirlisting);\n<commit_msg>dirlisting: added missing closedir(p) fixing a resource leak<commit_after>\/* <x0\/mod_dirlisting.cpp>\n *\n * This file is part of the x0 web server project and is released under LGPL-3.\n *\n * (c) 2009 Chrisitan Parpart <trapni@gentoo.org>\n *\/\n\n#include <x0\/server.hpp>\n#include <x0\/request.hpp>\n#include <x0\/response.hpp>\n#include <x0\/header.hpp>\n#include <x0\/strutils.hpp>\n#include <x0\/types.hpp>\n#include <boost\/lexical_cast.hpp>\n#include <boost\/bind.hpp>\n#include <cstring>\n#include <cerrno>\n#include <sys\/types.h>\n#include <sys\/stat.h>\n#include <unistd.h>\n#include <dirent.h>\n#include <stddef.h>\n\n\/**\n * \\ingroup modules\n * \\brief implements automatic content generation for raw directories\n *\/\nclass dirlisting_plugin :\n\tpublic x0::plugin\n{\nprivate:\n\tx0::handler::connection c;\n\npublic:\n\tdirlisting_plugin(x0::server& srv, const std::string& name) :\n\t\tx0::plugin(srv, name)\n\t{\n\t\tc = server_.generate_content.connect(boost::bind(&dirlisting_plugin::dirlisting, this, _1, _2));\n\t}\n\n\t~dirlisting_plugin()\n\t{\n\t\tserver_.generate_content.disconnect(c);\n\t}\n\n\tvirtual void configure()\n\t{\n\t\t\/\/ TODO get some kind of solution to let dir-listing only be used for directories we allow it for.\n\t}\n\nprivate:\n\tbool dirlisting(x0::request& in, x0::response& out)\n\t{\n\t\tif (!x0::isdir(in.entity)) return false;\n\n\t\tif (DIR *dir = opendir(in.entity.c_str()))\n\t\t{\n\t\t\tstd::list<std::string> listing;\n\t\t\tlisting.push_back(\"..\");\n\n\t\t\tint len = offsetof(dirent, d_name) + pathconf(in.entity.c_str(), _PC_NAME_MAX);\n\t\t\tdirent *dep = (dirent *)new unsigned char[len + 1];\n\t\t\tdirent *res = 0;\n\n\t\t\twhile (readdir_r(dir, dep, &res) == 0 && res)\n\t\t\t{\n\t\t\t\tstd::string name(dep->d_name);\n\n\t\t\t\tif (name[0] != '.')\n\t\t\t\t{\n\t\t\t\t\tif (x0::isdir(in.entity + name)) name += \"\/\";\n\n\t\t\t\t\tlisting.push_back(name);\n\t\t\t\t}\n\t\t\t}\n\n\t\t\tdelete[] dep;\n\n\t\t\tstd::stringstream sstr;\n\t\t\tsstr << \"<html><head><title>Directory: \"\n\t\t\t\t << in.path\n\t\t\t\t << \"<\/title><\/head>\\n<body>\\n\";\n\n\t\t\tsstr << \"<h2>Index of \" << in.path << \"<\/h2>\\n\";\n\t\t\tsstr << \"<ul>\\n\";\n\n\t\t\tfor (std::list<std::string>::iterator i = listing.begin(), e = listing.end(); i != e; ++i)\n\t\t\t{\n\t\t\t\tsstr << \"<li><a href='\" << *i << \"'>\" << *i << \"<\/a><\/li>\\n\";\n\t\t\t}\n\n\t\t\tsstr << \"<\/ul>\\n\";\n\n\t\t\tsstr << \"<hr\/>\\n\";\n\t\t\tsstr << \"<small><i>\" << in.connection.server().tag() << \"<\/i><\/small><br\/>\\n\";\n\n\t\t\tsstr << \"<\/body><\/html>\\n\";\n\n\t\t\tstd::string result(sstr.str());\n\n\t\t\tout.write(result);\n\t\t\tout *= x0::header(\"Content-Type\", \"text\/html\");\n\t\t\tout *= x0::header(\"Content-Length\", boost::lexical_cast<std::string>(result.size()));\n\n\t\t\tout.flush();\n\n\t\t\tclosedir(dir);\n\t\t\treturn true;\n\t\t}\n\t\treturn false;\n\t}\n};\n\nX0_EXPORT_PLUGIN(dirlisting);\n<|endoftext|>"} {"text":"<commit_before>\/*\r\n * Copyright (c) 2015 WinT 3794 <http:\/\/wint3794.org>\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 <QPointer>\r\n#include <QSpinBox>\r\n#include <QPushButton>\r\n#include <QProgressBar>\r\n\r\n#include <QDebug>\r\n\r\n#include \"JoysticksTab.h\"\r\n#include \"VirtualJoystick.h\"\r\n\r\n\/\/=============================================================================\r\n\/\/ JoysticksTab::JoysticksTab\r\n\/\/=============================================================================\r\n\r\nJoysticksTab::JoysticksTab (QWidget* parent) : QWidget (parent) {\r\n ui.setupUi (this);\r\n\r\n \/* Hide the indicator containers *\/\r\n ui.Axes->setVisible (false);\r\n ui.Hats->setVisible (false);\r\n ui.Buttons->setVisible (false);\r\n\r\n \/* Send SDL and virtual joystick data to this widget *\/\r\n m_keyboardDrive = new VirtualJoystick;\r\n connect (m_keyboardDrive, SIGNAL (HatEvent (GM_Hat)),\r\n this, SLOT (OnHatEvent (GM_Hat)));\r\n connect (m_keyboardDrive, SIGNAL (AxisEvent (GM_Axis)),\r\n this, SLOT (OnAxisEvent (GM_Axis)));\r\n connect (m_keyboardDrive, SIGNAL (ButtonEvent (GM_Button)),\r\n this, SLOT (OnButtonEvent (GM_Button)));\r\n connect (m_keyboardDrive, SIGNAL (CountChanged (QStringList)),\r\n this, SLOT (OnCountChanged (QStringList)));\r\n\r\n \/* Re-generate indicators when user selects another joystick *\/\r\n connect (ui.JoystickList, SIGNAL (currentRowChanged (int)),\r\n this, SLOT (GenerateIndicators (int)));\r\n}\r\n\r\n\/\/=============================================================================\r\n\/\/ JoysticksTab::~JoysticksTab\r\n\/\/=============================================================================\r\n\r\nJoysticksTab::~JoysticksTab() {\r\n delete m_keyboardDrive;\r\n}\r\n\r\n\/\/=============================================================================\r\n\/\/ JoysticksTab::ReadSettings\r\n\/\/=============================================================================\r\n\r\nvoid JoysticksTab::ReadSettings() {\r\n m_keyboardDrive->ReadSettings();\r\n}\r\n\r\n\/\/=============================================================================\r\n\/\/ JoysticksTab::ShowKeyboardWindow\r\n\/\/=============================================================================\r\n\r\nvoid JoysticksTab::ShowKeyboardWindow() {\r\n m_keyboardDrive->show();\r\n}\r\n\r\n\/\/=============================================================================\r\n\/\/ JoysticksTab::GenerateIndicators\r\n\/\/=============================================================================\r\n\r\nvoid JoysticksTab::GenerateIndicators (int row) {\r\n \/* Remove all joystick indicators in the widget *\/\r\n foreach (QSpinBox * b, findChildren<QSpinBox*>()) delete b;\r\n foreach (QPushButton * c, findChildren<QPushButton*>()) delete c;\r\n foreach (QProgressBar * p, findChildren<QProgressBar*>()) delete p;\r\n\r\n \/* Clear joystick data *\/\r\n m_axes.clear();\r\n m_hats.clear();\r\n m_buttons.clear();\r\n\r\n \/* Avoid crashing the application when there are no joysticks *\/\r\n if (row < 0)\r\n return;\r\n\r\n \/* Get joystick information *\/\r\n int hatCount = m_keyboardDrive->GetNumHats (row);\r\n int axisCount = m_keyboardDrive->GetNumAxes (row);\r\n int buttonCount = m_keyboardDrive->GetNumButtons (row);\r\n\r\n \/* Make the indicator containers visible *\/\r\n ui.Hats->setVisible (hatCount > 0);\r\n ui.Axes->setVisible (axisCount > 0);\r\n ui.Buttons->setVisible (buttonCount > 0);\r\n\r\n \/* Create a progress bar for each axis *\/\r\n for (int i = 0; i < axisCount; ++i) {\r\n QPointer<QProgressBar> bar = new QProgressBar (this);\r\n\r\n bar->setMaximumHeight (19);\r\n bar->setMinimumHeight (19);\r\n\r\n bar->setValue (0);\r\n bar->setMaximum (100);\r\n bar->setMinimum (-100);\r\n bar->setFormat (tr (\"Axis %1\").arg (i));\r\n\r\n m_axes.append (bar);\r\n ui.AxesWidget->layout()->addWidget (bar);\r\n }\r\n\r\n \/* Create a button for each joystick button *\/\r\n for (int i = 0; i < buttonCount; ++i) {\r\n QPointer<QPushButton> button = new QPushButton (this);\r\n\r\n button->setEnabled (false);\r\n button->setCheckable (true);\r\n button->setMaximumSize (18, 12);\r\n button->setMinimumSize (18, 12);\r\n button->setToolTip (tr (\"Button %1\").arg (i));\r\n\r\n \/* Distribute the button items in a nice layout *\/\r\n int row = (i <= 7) ? i : i - 8;\r\n int column = (i <= 7) ? 0 : (i \/ 8);\r\n\r\n m_buttons.append (button);\r\n ui.ButtonLayout->addWidget (button, row, column);\r\n }\r\n\r\n \/* Create a spinbox for each joystick hat *\/\r\n for (int i = 0; i < hatCount; ++i) {\r\n QPointer<QSpinBox> box = new QSpinBox (this);\r\n\r\n box->setRange (0, 360);\r\n box->setEnabled (false);\r\n\r\n m_hats.append (box);\r\n ui.HatsWidget->layout()->addWidget (box);\r\n }\r\n}\r\n\r\n\/\/=============================================================================\r\n\/\/ JoysticksTab::OnCountChanged\r\n\/\/=============================================================================\r\n\r\nvoid JoysticksTab::OnCountChanged (QStringList list) {\r\n \/* A joystick was removed *\/\r\n if (list.count() < ui.JoystickList->count())\r\n emit JoystickRemoved();\r\n\r\n \/* Clear the joystick list (we will re-generate it later) *\/\r\n ui.JoystickList->clear();\r\n\r\n \/* Put the current joysticks in the joystick list *\/\r\n if (list.count() > 0) {\r\n for (int i = 1; i <= list.count(); ++i)\r\n ui.JoystickList->addItem (QString (\"%1: \").arg (i) + list.at (i - 1));\r\n\r\n \/* Select the first item in the joystick selector *\/\r\n ui.JoystickList->setCurrentRow (0);\r\n }\r\n\r\n \/* Notify other objects that JS count has changed *\/\r\n emit StatusChanged (list.count() > 0);\r\n}\r\n\r\n\/\/=============================================================================\r\n\/\/ JoysticksTab::OnHatEvent\r\n\/\/=============================================================================\r\n\r\nvoid JoysticksTab::OnHatEvent (const GM_Hat& hat) {\r\n if (ui.JoystickList->currentRow() != hat.joystick.id)\r\n return;\r\n\r\n if (hat.id < m_hats.count())\r\n m_hats.at (hat.id)->setValue ((hat.angle == 0) ? 360 : hat.angle);\r\n}\r\n\r\n\/\/=============================================================================\r\n\/\/ JoysticksTab::OnAxisEvent\r\n\/\/=============================================================================\r\n\r\nvoid JoysticksTab::OnAxisEvent (const GM_Axis& axis) {\r\n if (ui.JoystickList->currentRow() != axis.joystick.id)\r\n return;\r\n\r\n if (axis.id < m_axes.count())\r\n m_axes.at (axis.id)->setValue (axis.value * 100);\r\n}\r\n\r\n\/\/=============================================================================\r\n\/\/ JoysticksTab::OnButtonEvent\r\n\/\/=============================================================================\r\n\r\nvoid JoysticksTab::OnButtonEvent (const GM_Button& button) {\r\n if (ui.JoystickList->currentRow() != button.joystick.id)\r\n return;\r\n\r\n if (button.id < m_buttons.count())\r\n m_buttons.at (button.id)->setChecked (button.pressed);\r\n}\r\n<commit_msg>Update JoysticksTab.cpp<commit_after>\/*\r\n * Copyright (c) 2015 WinT 3794 <http:\/\/wint3794.org>\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 <QPointer>\r\n#include <QSpinBox>\r\n#include <QPushButton>\r\n#include <QProgressBar>\r\n\r\n#include <QDebug>\r\n\r\n#include \"JoysticksTab.h\"\r\n#include \"VirtualJoystick.h\"\r\n\r\n\/\/=============================================================================\r\n\/\/ JoysticksTab::JoysticksTab\r\n\/\/=============================================================================\r\n\r\nJoysticksTab::JoysticksTab (QWidget* parent) : QWidget (parent) {\r\n ui.setupUi (this);\r\n\r\n \/* Hide the indicator containers *\/\r\n ui.Axes->setVisible (false);\r\n ui.Hats->setVisible (false);\r\n ui.Buttons->setVisible (false);\r\n\r\n \/* Send SDL and virtual joystick data to this widget *\/\r\n m_keyboardDrive = new VirtualJoystick;\r\n connect (m_keyboardDrive, SIGNAL (HatEvent (GM_Hat)),\r\n this, SLOT (OnHatEvent (GM_Hat)));\r\n connect (m_keyboardDrive, SIGNAL (AxisEvent (GM_Axis)),\r\n this, SLOT (OnAxisEvent (GM_Axis)));\r\n connect (m_keyboardDrive, SIGNAL (ButtonEvent (GM_Button)),\r\n this, SLOT (OnButtonEvent (GM_Button)));\r\n connect (m_keyboardDrive, SIGNAL (CountChanged (QStringList)),\r\n this, SLOT (OnCountChanged (QStringList)));\r\n\r\n \/* Re-generate indicators when user selects another joystick *\/\r\n connect (ui.JoystickList, SIGNAL (currentRowChanged (int)),\r\n this, SLOT (GenerateIndicators (int)));\r\n}\r\n\r\n\/\/=============================================================================\r\n\/\/ JoysticksTab::~JoysticksTab\r\n\/\/=============================================================================\r\n\r\nJoysticksTab::~JoysticksTab() {\r\n delete m_keyboardDrive;\r\n}\r\n\r\n\/\/=============================================================================\r\n\/\/ JoysticksTab::ReadSettings\r\n\/\/=============================================================================\r\n\r\nvoid JoysticksTab::ReadSettings() {\r\n m_keyboardDrive->ReadSettings();\r\n}\r\n\r\n\/\/=============================================================================\r\n\/\/ JoysticksTab::ShowKeyboardWindow\r\n\/\/=============================================================================\r\n\r\nvoid JoysticksTab::ShowKeyboardWindow() {\r\n m_keyboardDrive->show();\r\n}\r\n\r\n\/\/=============================================================================\r\n\/\/ JoysticksTab::GenerateIndicators\r\n\/\/=============================================================================\r\n\r\nvoid JoysticksTab::GenerateIndicators (int row) {\r\n \/* Remove all joystick indicators in the widget *\/\r\n foreach (QSpinBox * b, findChildren<QSpinBox*>()) delete b;\r\n foreach (QPushButton * c, findChildren<QPushButton*>()) delete c;\r\n foreach (QProgressBar * p, findChildren<QProgressBar*>()) delete p;\r\n\r\n \/* Clear joystick data *\/\r\n m_axes.clear();\r\n m_hats.clear();\r\n m_buttons.clear();\r\n\r\n \/* Avoid crashing the application when there are no joysticks *\/\r\n if (row < 0)\r\n return;\r\n\r\n \/* Get joystick information *\/\r\n int hatCount = m_keyboardDrive->GetNumHats (row);\r\n int axisCount = m_keyboardDrive->GetNumAxes (row);\r\n int buttonCount = m_keyboardDrive->GetNumButtons (row);\r\n\r\n \/* Make the indicator containers visible *\/\r\n ui.Hats->setVisible (hatCount > 0);\r\n ui.Axes->setVisible (axisCount > 0);\r\n ui.Buttons->setVisible (buttonCount > 0);\r\n\r\n \/* Create a progress bar for each axis *\/\r\n for (int i = 0; i < axisCount; ++i) {\r\n QPointer<QProgressBar> bar = new QProgressBar (this);\r\n\r\n bar->setMaximumHeight (19);\r\n bar->setMinimumHeight (19);\r\n\r\n bar->setValue (0);\r\n bar->setMaximum (100);\r\n bar->setMinimum (-100);\r\n bar->setFormat (tr (\"Axis %1\").arg (i));\r\n\r\n m_axes.append (bar);\r\n ui.AxesWidget->layout()->addWidget (bar);\r\n }\r\n\r\n \/* Create a button for each joystick button *\/\r\n for (int i = 0; i < buttonCount; ++i) {\r\n QPointer<QPushButton> button = new QPushButton (this);\r\n\r\n button->setEnabled (false);\r\n button->setCheckable (true);\r\n button->setMaximumSize (18, 12);\r\n button->setMinimumSize (18, 12);\r\n button->setToolTip (tr (\"Button %1\").arg (i));\r\n\r\n \/* Distribute the button items in a nice layout *\/\r\n int row = (i <= 7) ? i : i - 8;\r\n int column = (i <= 7) ? 0 : (i \/ 8);\r\n\r\n m_buttons.append (button);\r\n ui.ButtonLayout->addWidget (button, row, column);\r\n }\r\n\r\n \/* Create a spinbox for each joystick hat *\/\r\n for (int i = 0; i < hatCount; ++i) {\r\n QPointer<QSpinBox> box = new QSpinBox (this);\r\n\r\n box->setRange (0, 360);\r\n box->setEnabled (false);\r\n\r\n m_hats.append (box);\r\n ui.HatsWidget->layout()->addWidget (box);\r\n }\r\n}\r\n\r\n\/\/=============================================================================\r\n\/\/ JoysticksTab::OnCountChanged\r\n\/\/=============================================================================\r\n\r\nvoid JoysticksTab::OnCountChanged (QStringList list) {\r\n \/* A joystick was removed *\/\r\n if (list.count() < ui.JoystickList->count())\r\n emit JoystickRemoved();\r\n\r\n \/* Clear the joystick list (we will re-generate it later) *\/\r\n ui.JoystickList->clear();\r\n\r\n \/* Put the current joysticks in the joystick list *\/\r\n if (list.count() > 0) {\r\n for (int i = 1; i <= list.count(); ++i)\r\n ui.JoystickList->addItem (QString (\"%1: \").arg (i) + list.at (i - 1));\r\n\r\n \/* Select the first item in the joystick selector *\/\r\n ui.JoystickList->setCurrentRow (0);\r\n }\r\n\r\n \/* Notify other objects that JS count has changed *\/\r\n emit StatusChanged (list.count() > 0);\r\n}\r\n\r\n\/\/=============================================================================\r\n\/\/ JoysticksTab::OnHatEvent\r\n\/\/=============================================================================\r\n\r\nvoid JoysticksTab::OnHatEvent (const GM_Hat& hat) {\r\n if (ui.JoystickList->currentRow() != hat.joystick.id)\r\n return;\r\n\r\n if (hat.id < m_hats.count())\r\n m_hats.at (hat.id)->setValue ((hat.angle == 0) ? 360 : hat.angle);\r\n}\r\n\r\n\/\/=============================================================================\r\n\/\/ JoysticksTab::OnAxisEvent\r\n\/\/=============================================================================\r\n\r\nvoid JoysticksTab::OnAxisEvent (const GM_Axis& axis) {\r\n if (ui.JoystickList->currentRow() != axis.joystick.id)\r\n return;\r\n\r\n if (axis.id < m_axes.count())\r\n m_axes.at (axis.id)->setValue (axis.value * 100);\r\n}\r\n\r\n\/\/=============================================================================\r\n\/\/ JoysticksTab::OnButtonEvent\r\n\/\/=============================================================================\r\n\r\nvoid JoysticksTab::OnButtonEvent (const GM_Button& button) {\r\n if (ui.JoystickList->currentRow() != button.joystick.id)\r\n return;\r\n\r\n if (button.id < m_buttons.count())\r\n m_buttons.at (button.id)->setChecked (button.pressed);\r\n}\r\n<|endoftext|>"} {"text":"<commit_before>\/**\n *\n * \\section COPYRIGHT\n *\n * Copyright 2013-2015 The srsLTE Developers. See the\n * COPYRIGHT file at the top-level directory of this distribution.\n *\n * \\section LICENSE\n *\n * This file is part of the srsLTE library.\n *\n * srsLTE is free software: you can redistribute it and\/or modify\n * it under the terms of the GNU Affero General Public License as\n * published by the Free Software Foundation, either version 3 of\n * the License, or (at your option) any later version.\n *\n * srsLTE is distributed in the hope that it will be 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 * A copy of the GNU Affero General Public License can be found in\n * the LICENSE file in the top-level directory of this distribution\n * and at http:\/\/www.gnu.org\/licenses\/.\n *\n *\/\n\n\n#include \"srsapps\/ue\/mac\/mux.h\"\n#include \"srsapps\/ue\/mac\/mac.h\"\n\nnamespace srslte {\nnamespace ue {\n\n#define IO_IDX(lch) (lch + mac_io::MAC_LCH_CCCH_UL)\n#define UL_IDX(lch) (lch - mac_io::MAC_LCH_CCCH_UL)\n\nmux::mux() : pdu_msg(20)\n{\n msg3_buff.init(1, MSG3_BUFF_SZ);\n pdu_buff.init(1, PDU_BUFF_SZ);\n bzero(nof_tx_pkts, sizeof(uint32_t) * mac_io::NOF_UL_LCH);\n pthread_mutex_init(&mutex, NULL);\n msg3_has_been_transmitted = false; \n \n for (int i=0;i<mac_io::NOF_UL_LCH;i++) {\n priority[i] = 1; \n priority_sorted[i] = 1; \n PBR[i] = -1; \/\/ -1 is infinite \n BSD[i] = 10;\n lchid_sorted[i] = i; \n } \n}\n\nvoid mux::init(log *log_h_, mac_io *mac_io_h_, bsr_proc *bsr_procedure_)\n{\n log_h = log_h_;\n mac_io_h = mac_io_h_;\n bsr_procedure = bsr_procedure_;\n}\n\nvoid mux::reset()\n{\n for (int i=0;i<mac_io::NOF_UL_LCH;i++) {\n Bj[i] = 0; \n }\n}\n\nbool mux::is_pending_ccch_sdu()\n{\n return is_pending_sdu(0);\n}\n\nbool mux::is_pending_any_sdu()\n{\n for (int i=0;i<mac_io::NOF_UL_LCH;i++) {\n if (!mac_io_h->get(i)->isempty()) {\n return true; \n }\n }\n return false; \n}\n\nbool mux::is_pending_sdu(uint32_t lch_id) {\n lch_id += (uint32_t) mac_io::MAC_LCH_CCCH_UL;\n if (lch_id < mac_io::MAC_NOF_QUEUES) {\n return !mac_io_h->get(lch_id)->isempty();\n }\n}\n\nvoid mux::set_priority(uint32_t lch_id, uint32_t set_priority, int set_PBR, uint32_t set_BSD)\n{\n pthread_mutex_lock(&mutex);\n if (lch_id < mac_io::NOF_UL_LCH) {\n priority[lch_id] = set_priority;\n PBR[lch_id] = set_PBR;\n BSD[lch_id] = set_BSD; \n \n \/\/ Insert priority in sorted idx array\n int new_index = 0; \n while(set_priority > priority_sorted[new_index] && new_index < mac_io::NOF_UL_LCH) {\n new_index++; \n }\n int old_index = 0; \n while(lch_id != lchid_sorted[old_index] && new_index < mac_io::NOF_UL_LCH) {\n old_index++;\n }\n if (new_index == mac_io::NOF_UL_LCH) {\n Error(\"Can't find LchID=%d in sorted list\\n\", lch_id);\n return;\n }\n \/\/ Replace goes in one direction or the other \n int add=new_index>old_index?1:-1;\n for (int i=old_index;i!=new_index;i+=add) {\n priority_sorted[i] = priority_sorted[i+add];\n lchid_sorted[i] = lchid_sorted[i+add];\n }\n priority_sorted[new_index] = set_priority;\n lchid_sorted[new_index] = lch_id; \n }\n pthread_mutex_unlock(&mutex);\n}\n\nvoid mux::pdu_release()\n{\n pdu_buff.release();\n}\n\nbool mux::pdu_move_to_msg3(uint32_t pdu_sz)\n{\n if (pdu_buff.isempty()) {\n if (assemble_pdu(pdu_sz)) {\n if (pdu_buff.pending_data() < MSG3_BUFF_SZ) {\n pdu_buff.move_to(&msg3_buff); \n return true; \n } else {\n pdu_buff.release();\n Error(\"Assembled PDU size exceeds Msg3 buffer size\\n\");\n return false; \n }\n } else {\n Error(\"Assembling PDU\\n\");\n return false; \n } \n } else {\n Error(\"Generating PDU: PDU pending in buffer for transmission\\n\");\n return false; \n } \n}\n\n\/\/ Multiplexing and logical channel priorization as defined in Section 5.4.3\nuint8_t* mux::pdu_pop(uint32_t pdu_sz)\n{\n if (pdu_buff.isempty()) {\n if (assemble_pdu(pdu_sz)) {\n return (uint8_t*) pdu_buff.pop();\n } else {\n return NULL; \n } \n } else {\n Error(\"Generating PDU: PDU pending in buffer for transmission\\n\");\n return NULL; \n }\n}\n\nvoid mux::append_crnti_ce_next_tx(uint16_t crnti) {\n pending_crnti_ce = crnti; \n}\n\nsch_subh::cetype bsr_format_convert(bsr_proc::bsr_format_t format) {\n switch(format) {\n case bsr_proc::LONG_BSR: \n return sch_subh::LONG_BSR;\n case bsr_proc::SHORT_BSR: \n return sch_subh::SHORT_BSR;\n case bsr_proc::TRUNC_BSR: \n return sch_subh::TRUNC_BSR;\n \n }\n}\n\nbool mux::assemble_pdu(uint32_t pdu_sz_nbits) {\n\n uint8_t *buff = (uint8_t*) pdu_buff.request();\n if (!buff) {\n Error(\"Assembling PDU: Buffer is not available\\n\");\n return false; \n }\n \n \/\/ Make sure pdu_sz is byte-aligned\n pdu_sz_nbits = 8*(pdu_sz_nbits\/8);\n \n \/\/ Acquire mutex. Cannot change priorities, PBR or BSD after assemble finishes\n pthread_mutex_lock(&mutex); \n \n \/\/ Update Bj\n for (int i=0;i<mac_io::NOF_UL_LCH;i++) { \n \/\/ Add PRB unless it's infinity \n if (PBR[i] >= 0) {\n Bj[i] += PBR[i];\n }\n if (Bj[i] >= BSD[i]) {\n Bj[i] = BSD[i]; \n } \n }\n \n\/\/ Logical Channel Procedure\n \n uint32_t sdu_sz = 0; \n \n pdu_msg.init(pdu_sz_nbits\/8, true);\n \n \/\/ MAC control element for C-RNTI or data from UL-CCCH\n bool is_first = true; \n if (!allocate_sdu(UL_IDX(mac_io::MAC_LCH_CCCH_UL), &pdu_msg, &is_first)) {\n if (pending_crnti_ce) {\n if (pdu_msg.new_subh()) {\n pdu_msg.next();\n if (!pdu_msg.get()->set_c_rnti(pending_crnti_ce)) {\n Warning(\"Pending C-RNTI CE could not be inserted in MAC PDU\\n\");\n }\n }\n }\n }\n pending_crnti_ce = 0; \n \n uint32_t bsr_payload_sz = bsr_procedure->need_to_send_bsr_on_ul_grant(pdu_msg.rem_size());\n bsr_proc::bsr_t bsr; \n \n \/\/ MAC control element for BSR, with exception of BSR included for padding;\n sch_subh *bsr_subh = NULL;\n if (bsr_payload_sz) {\n Info(\"Including BSR CE size %d\\n\", bsr_payload_sz);\n if (pdu_msg.new_subh()) {\n pdu_msg.next();\n bsr_subh = pdu_msg.get();\n pdu_msg.update_space_ce(bsr_payload_sz);\n }\n }\n \/\/ MAC control element for PHR\n \/\/ TODO\n\n \/\/ data from any Logical Channel, except data from UL-CCCH; \n \/\/ first only those with positive Bj\n for (int i=0;i<mac_io::NOF_UL_LCH;i++) {\n bool res = true; \n while ((Bj[i] > 0 || PBR[i] < 0) && res) {\n res = allocate_sdu(lchid_sorted[i], &pdu_msg, &sdu_sz, &is_first);\n if (res && PBR[i] >= 0) {\n Bj[i] -= sdu_sz; \n }\n }\n }\n\n \/\/ If resources remain, allocate regardless of their Bj value\n for (int i=0;i<mac_io::NOF_UL_LCH;i++) {\n while (allocate_sdu(lchid_sorted[i], &pdu_msg)); \n }\n\n bool send_bsr = bsr_procedure->generate_bsr_on_ul_grant(pdu_msg.rem_size(), &bsr);\n \/\/ Insert Padding BSR if not inserted Regular\/Periodic BSR \n if (!bsr_payload_sz && send_bsr) {\n if (pdu_msg.new_subh()) {\n pdu_msg.next();\n bsr_subh = pdu_msg.get();\n } \n }\n\n \/\/ And set the BSR \n if (bsr_subh) {\n bsr_subh->set_bsr(bsr.buff_size, bsr_format_convert(bsr.format), bsr_payload_sz?false:true); \n }\n\n pthread_mutex_unlock(&mutex);\n\n \/* Release all SDUs *\/\n for (int i=0;i<mac_io::NOF_UL_LCH;i++) {\n while(nof_tx_pkts[i] > 0) {\n mac_io_h->get(IO_IDX(i))->release(); \n nof_tx_pkts[i]--;\n }\n }\n\n Info(\"Assembled MAC PDU msg size %d\/%d bytes\\n\", pdu_msg.size(), pdu_sz_nbits\/8);\n \/\/pdu_msg.fprint(stdout);\n \n \/* Generate MAC PDU and save to buffer *\/\n if (pdu_msg.write_packet(buff)) {\n pdu_buff.push(pdu_sz_nbits);\n } else {\n Error(\"Writing PDU message to packet\\n\");\n return false; \n } \n return true; \n}\n\nbool mux::allocate_sdu(uint32_t lcid, sch_pdu *pdu_msg) \n{\n return allocate_sdu(lcid, pdu_msg, NULL, NULL);\n}\nbool mux::allocate_sdu(uint32_t lcid, sch_pdu *pdu_msg, bool *is_first) \n{\n return allocate_sdu(lcid, pdu_msg, NULL, is_first);\n}\nbool mux::allocate_sdu(uint32_t lcid, sch_pdu *pdu_msg, uint32_t *sdu_sz, bool *is_first) \n{\n \n \/\/ Get n-th pending SDU pointer and length\n uint32_t buff_len = 0; \n uint8_t *buff_ptr = (uint8_t*) mac_io_h->get(mac_io::MAC_LCH_CCCH_UL + lcid)->pop(&buff_len, nof_tx_pkts[lcid]); \n\n if (buff_ptr && buff_len > 0) { \/\/ there is pending SDU to allocate\n if (sdu_sz) {\n *sdu_sz = buff_len; \n }\n if (pdu_msg->new_subh()) { \/\/ there is space for a new subheader\n pdu_msg->next();\n if (pdu_msg->get()->set_sdu(lcid, buff_ptr, buff_len\/8, is_first?*is_first:false)) { \/\/ new SDU could be added\n if (is_first) {\n *is_first = false; \n }\n \/\/ Increase number of pop'ed packets from queue\n nof_tx_pkts[lcid]++; \n return true; \n } else {\n pdu_msg->del_subh();\n }\n } \n }\n return false; \n}\n\n\n\nvoid mux::msg3_flush()\n{\n msg3_buff.flush();\n msg3_has_been_transmitted = false; \n}\n\nvoid mux::msg3_transmitted()\n{\n msg3_has_been_transmitted = true; \n}\n\nbool mux::msg3_is_transmitted()\n{\n return msg3_has_been_transmitted; \n}\n\n\/* Returns a pointer to the Msg3 buffer *\/\nuint8_t* mux::msg3_pop(uint32_t TB_size)\n{\n uint32_t len; \n uint8_t *msg3 = (uint8_t*) msg3_buff.pop(&len);\n if (msg3) {\n if (len < TB_size) {\n \/\/ Pad with zeros without exceeding maximum buffer size \n if (TB_size <= MSG3_BUFF_SZ) {\n bzero(&msg3[len], (TB_size-len)*sizeof(uint8_t));\n } else {\n Error(\"Requested TB size from Msg3 buffer exceeds buffer size (%d>%d)\\n\", TB_size, MSG3_BUFF_SZ);\n return NULL; \n }\n } \n }\n return msg3;\n}\n\n \n}\n}\n<commit_msg>MAC MUX rounding up SDU payload size<commit_after>\/**\n *\n * \\section COPYRIGHT\n *\n * Copyright 2013-2015 The srsLTE Developers. See the\n * COPYRIGHT file at the top-level directory of this distribution.\n *\n * \\section LICENSE\n *\n * This file is part of the srsLTE library.\n *\n * srsLTE is free software: you can redistribute it and\/or modify\n * it under the terms of the GNU Affero General Public License as\n * published by the Free Software Foundation, either version 3 of\n * the License, or (at your option) any later version.\n *\n * srsLTE is distributed in the hope that it will be 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 * A copy of the GNU Affero General Public License can be found in\n * the LICENSE file in the top-level directory of this distribution\n * and at http:\/\/www.gnu.org\/licenses\/.\n *\n *\/\n\n\n#include \"srsapps\/ue\/mac\/mux.h\"\n#include \"srsapps\/ue\/mac\/mac.h\"\n\nnamespace srslte {\nnamespace ue {\n\n#define IO_IDX(lch) (lch + mac_io::MAC_LCH_CCCH_UL)\n#define UL_IDX(lch) (lch - mac_io::MAC_LCH_CCCH_UL)\n\nmux::mux() : pdu_msg(20)\n{\n msg3_buff.init(1, MSG3_BUFF_SZ);\n pdu_buff.init(1, PDU_BUFF_SZ);\n bzero(nof_tx_pkts, sizeof(uint32_t) * mac_io::NOF_UL_LCH);\n pthread_mutex_init(&mutex, NULL);\n msg3_has_been_transmitted = false; \n \n for (int i=0;i<mac_io::NOF_UL_LCH;i++) {\n priority[i] = 1; \n priority_sorted[i] = 1; \n PBR[i] = -1; \/\/ -1 is infinite \n BSD[i] = 10;\n lchid_sorted[i] = i; \n } \n}\n\nvoid mux::init(log *log_h_, mac_io *mac_io_h_, bsr_proc *bsr_procedure_)\n{\n log_h = log_h_;\n mac_io_h = mac_io_h_;\n bsr_procedure = bsr_procedure_;\n}\n\nvoid mux::reset()\n{\n for (int i=0;i<mac_io::NOF_UL_LCH;i++) {\n Bj[i] = 0; \n }\n}\n\nbool mux::is_pending_ccch_sdu()\n{\n return is_pending_sdu(0);\n}\n\nbool mux::is_pending_any_sdu()\n{\n for (int i=0;i<mac_io::NOF_UL_LCH;i++) {\n if (!mac_io_h->get(i)->isempty()) {\n return true; \n }\n }\n return false; \n}\n\nbool mux::is_pending_sdu(uint32_t lch_id) {\n lch_id += (uint32_t) mac_io::MAC_LCH_CCCH_UL;\n if (lch_id < mac_io::MAC_NOF_QUEUES) {\n return !mac_io_h->get(lch_id)->isempty();\n }\n}\n\nvoid mux::set_priority(uint32_t lch_id, uint32_t set_priority, int set_PBR, uint32_t set_BSD)\n{\n pthread_mutex_lock(&mutex);\n if (lch_id < mac_io::NOF_UL_LCH) {\n priority[lch_id] = set_priority;\n PBR[lch_id] = set_PBR;\n BSD[lch_id] = set_BSD; \n \n \/\/ Insert priority in sorted idx array\n int new_index = 0; \n while(set_priority > priority_sorted[new_index] && new_index < mac_io::NOF_UL_LCH) {\n new_index++; \n }\n int old_index = 0; \n while(lch_id != lchid_sorted[old_index] && new_index < mac_io::NOF_UL_LCH) {\n old_index++;\n }\n if (new_index == mac_io::NOF_UL_LCH) {\n Error(\"Can't find LchID=%d in sorted list\\n\", lch_id);\n return;\n }\n \/\/ Replace goes in one direction or the other \n int add=new_index>old_index?1:-1;\n for (int i=old_index;i!=new_index;i+=add) {\n priority_sorted[i] = priority_sorted[i+add];\n lchid_sorted[i] = lchid_sorted[i+add];\n }\n priority_sorted[new_index] = set_priority;\n lchid_sorted[new_index] = lch_id; \n }\n pthread_mutex_unlock(&mutex);\n}\n\nvoid mux::pdu_release()\n{\n pdu_buff.release();\n}\n\nbool mux::pdu_move_to_msg3(uint32_t pdu_sz)\n{\n if (pdu_buff.isempty()) {\n if (assemble_pdu(pdu_sz)) {\n if (pdu_buff.pending_data() < MSG3_BUFF_SZ) {\n pdu_buff.move_to(&msg3_buff); \n return true; \n } else {\n pdu_buff.release();\n Error(\"Assembled PDU size exceeds Msg3 buffer size\\n\");\n return false; \n }\n } else {\n Error(\"Assembling PDU\\n\");\n return false; \n } \n } else {\n Error(\"Generating PDU: PDU pending in buffer for transmission\\n\");\n return false; \n } \n}\n\n\/\/ Multiplexing and logical channel priorization as defined in Section 5.4.3\nuint8_t* mux::pdu_pop(uint32_t pdu_sz)\n{\n if (pdu_buff.isempty()) {\n if (assemble_pdu(pdu_sz)) {\n return (uint8_t*) pdu_buff.pop();\n } else {\n return NULL; \n } \n } else {\n Error(\"Generating PDU: PDU pending in buffer for transmission\\n\");\n return NULL; \n }\n}\n\nvoid mux::append_crnti_ce_next_tx(uint16_t crnti) {\n pending_crnti_ce = crnti; \n}\n\nsch_subh::cetype bsr_format_convert(bsr_proc::bsr_format_t format) {\n switch(format) {\n case bsr_proc::LONG_BSR: \n return sch_subh::LONG_BSR;\n case bsr_proc::SHORT_BSR: \n return sch_subh::SHORT_BSR;\n case bsr_proc::TRUNC_BSR: \n return sch_subh::TRUNC_BSR;\n \n }\n}\n\nbool mux::assemble_pdu(uint32_t pdu_sz_nbits) {\n\n uint8_t *buff = (uint8_t*) pdu_buff.request();\n if (!buff) {\n Error(\"Assembling PDU: Buffer is not available\\n\");\n return false; \n }\n \n \/\/ Make sure pdu_sz is byte-aligned\n pdu_sz_nbits = 8*(pdu_sz_nbits\/8);\n \n \/\/ Acquire mutex. Cannot change priorities, PBR or BSD after assemble finishes\n pthread_mutex_lock(&mutex); \n \n \/\/ Update Bj\n for (int i=0;i<mac_io::NOF_UL_LCH;i++) { \n \/\/ Add PRB unless it's infinity \n if (PBR[i] >= 0) {\n Bj[i] += PBR[i];\n }\n if (Bj[i] >= BSD[i]) {\n Bj[i] = BSD[i]; \n } \n }\n \n\/\/ Logical Channel Procedure\n \n uint32_t sdu_sz = 0; \n \n pdu_msg.init(pdu_sz_nbits\/8, true);\n \n \/\/ MAC control element for C-RNTI or data from UL-CCCH\n bool is_first = true; \n if (!allocate_sdu(UL_IDX(mac_io::MAC_LCH_CCCH_UL), &pdu_msg, &is_first)) {\n if (pending_crnti_ce) {\n if (pdu_msg.new_subh()) {\n pdu_msg.next();\n if (!pdu_msg.get()->set_c_rnti(pending_crnti_ce)) {\n Warning(\"Pending C-RNTI CE could not be inserted in MAC PDU\\n\");\n }\n }\n }\n }\n pending_crnti_ce = 0; \n \n uint32_t bsr_payload_sz = bsr_procedure->need_to_send_bsr_on_ul_grant(pdu_msg.rem_size());\n bsr_proc::bsr_t bsr; \n \n \/\/ MAC control element for BSR, with exception of BSR included for padding;\n sch_subh *bsr_subh = NULL;\n if (bsr_payload_sz) {\n Info(\"Including BSR CE size %d\\n\", bsr_payload_sz);\n if (pdu_msg.new_subh()) {\n pdu_msg.next();\n bsr_subh = pdu_msg.get();\n pdu_msg.update_space_ce(bsr_payload_sz);\n }\n }\n \/\/ MAC control element for PHR\n \/\/ TODO\n printf(\"1 nof_subh=%d, rem_size=%d\\n\", pdu_msg.nof_subh(), pdu_msg.rem_size());\n\n \/\/ data from any Logical Channel, except data from UL-CCCH; \n \/\/ first only those with positive Bj\n for (int i=0;i<mac_io::NOF_UL_LCH;i++) {\n bool res = true; \n while ((Bj[i] > 0 || PBR[i] < 0) && res) {\n res = allocate_sdu(lchid_sorted[i], &pdu_msg, &sdu_sz, &is_first);\n if (res && PBR[i] >= 0) {\n Bj[i] -= sdu_sz; \n }\n }\n }\n printf(\"2 nof_subh=%d, rem_size=%d\\n\", pdu_msg.nof_subh(), pdu_msg.rem_size());\n\n \/\/ If resources remain, allocate regardless of their Bj value\n for (int i=0;i<mac_io::NOF_UL_LCH;i++) {\n while (allocate_sdu(lchid_sorted[i], &pdu_msg)); \n }\n\n printf(\"3 nof_subh=%d, rem_size=%d\\n\", pdu_msg.nof_subh(), pdu_msg.rem_size());\n\n bool send_bsr = bsr_procedure->generate_bsr_on_ul_grant(pdu_msg.rem_size(), &bsr);\n \/\/ Insert Padding BSR if not inserted Regular\/Periodic BSR \n if (!bsr_payload_sz && send_bsr) {\n if (pdu_msg.new_subh()) {\n pdu_msg.next();\n bsr_subh = pdu_msg.get();\n } \n }\n\n \/\/ And set the BSR \n if (bsr_subh) {\n bsr_subh->set_bsr(bsr.buff_size, bsr_format_convert(bsr.format), bsr_payload_sz?false:true); \n }\n\n pthread_mutex_unlock(&mutex);\n\n \/* Release all SDUs *\/\n for (int i=0;i<mac_io::NOF_UL_LCH;i++) {\n while(nof_tx_pkts[i] > 0) {\n mac_io_h->get(IO_IDX(i))->release(); \n nof_tx_pkts[i]--;\n }\n }\n\n Info(\"Assembled MAC PDU msg size %d\/%d bytes\\n\", pdu_msg.size(), pdu_sz_nbits\/8);\n \/\/pdu_msg.fprint(stdout);\n \n \/* Generate MAC PDU and save to buffer *\/\n if (pdu_msg.write_packet(buff)) {\n pdu_buff.push(pdu_sz_nbits);\n } else {\n Error(\"Writing PDU message to packet\\n\");\n return false; \n } \n return true; \n}\n\nbool mux::allocate_sdu(uint32_t lcid, sch_pdu *pdu_msg) \n{\n return allocate_sdu(lcid, pdu_msg, NULL, NULL);\n}\nbool mux::allocate_sdu(uint32_t lcid, sch_pdu *pdu_msg, bool *is_first) \n{\n return allocate_sdu(lcid, pdu_msg, NULL, is_first);\n}\nbool mux::allocate_sdu(uint32_t lcid, sch_pdu *pdu_msg, uint32_t *sdu_sz, bool *is_first) \n{\n \n \/\/ Get n-th pending SDU pointer and length\n uint32_t buff_len = 0; \n uint8_t *buff_ptr = (uint8_t*) mac_io_h->get(mac_io::MAC_LCH_CCCH_UL + lcid)->pop(&buff_len, nof_tx_pkts[lcid]); \n\n uint32_t nbytes = (buff_len-1)\/8 + 1; \n \n if (buff_ptr && buff_len > 0) { \/\/ there is pending SDU to allocate\n if (sdu_sz) {\n *sdu_sz = buff_len; \n }\n if (pdu_msg->new_subh()) { \/\/ there is space for a new subheader\n pdu_msg->next();\n if (pdu_msg->get()->set_sdu(lcid, buff_ptr, nbytes, is_first?*is_first:false)) { \/\/ new SDU could be added\n if (is_first) {\n *is_first = false; \n }\n Info(\"Allocated SDU lcid=%d nbytes=%d\\n\", lcid, nbytes);\n \/\/ Increase number of pop'ed packets from queue\n nof_tx_pkts[lcid]++; \n return true; \n } else {\n pdu_msg->del_subh();\n }\n } \n }\n return false; \n}\n\n\n\nvoid mux::msg3_flush()\n{\n msg3_buff.flush();\n msg3_has_been_transmitted = false; \n}\n\nvoid mux::msg3_transmitted()\n{\n msg3_has_been_transmitted = true; \n}\n\nbool mux::msg3_is_transmitted()\n{\n return msg3_has_been_transmitted; \n}\n\n\/* Returns a pointer to the Msg3 buffer *\/\nuint8_t* mux::msg3_pop(uint32_t TB_size)\n{\n uint32_t len; \n uint8_t *msg3 = (uint8_t*) msg3_buff.pop(&len);\n if (msg3) {\n if (len < TB_size) {\n \/\/ Pad with zeros without exceeding maximum buffer size \n if (TB_size <= MSG3_BUFF_SZ) {\n bzero(&msg3[len], (TB_size-len)*sizeof(uint8_t));\n } else {\n Error(\"Requested TB size from Msg3 buffer exceeds buffer size (%d>%d)\\n\", TB_size, MSG3_BUFF_SZ);\n return NULL; \n }\n } \n }\n return msg3;\n}\n\n \n}\n}\n<|endoftext|>"} {"text":"<commit_before>#include <cassert>\n#include <libport\/statistics.hh>\n\n#include <iostream>\n\ntemplate<typename T, typename R>\nstatic void\ncheck(const libport::Statistics<T, R>& s,\n size_t size, T min, T max, R mean, R variance)\n{\n std::cerr << \"Mean: \" << s.mean() << std::endl;\n std::cerr << \"Variance: \" << s.variance() << std::endl;\n assert(size == s.size());\n assert(min == s.min());\n assert(max == s.max());\n assert(fabs(mean - s.mean()) < 1e-4);\n assert(fabs(variance - s.variance()) < 1e-4);\n}\n\ntemplate<typename R>\nstatic void\ncheck1(size_t capacity, unsigned int size, unsigned int min, unsigned int max, R mean, R variance)\n{\n libport::Statistics<unsigned int, R> s(capacity);\n s.add_sample(2);\n s.add_sample(2);\n s.add_sample(3);\n s.add_sample(4);\n s.add_sample(7);\n check(s, size, min, max, mean, variance);\n}\n\nint\nmain()\n{\n \/\/ Running samples\n check1<unsigned int>(3, 3, 3, 7, 4, 3);\n check1<double>(3, 3, 3, 7, 4.666666666, 2.8888888888);\n\n \/\/ Non-running samples\n check1<unsigned int>(0, 5, 2, 7, 3, 3);\n check1<double>(0, 5, 2, 7, 3.6, 3.44);\n\n \/\/ Running samples with non-full buffer\n check1<unsigned int>(10, 5, 2, 7, 3, 3);\n check1<double>(10, 5, 2, 7, 3.6, 3.44);\n}\n<commit_msg>Desambiguate \"fabs\" call.<commit_after>#include <cassert>\n#include <libport\/statistics.hh>\n\n#include <iostream>\n\n\/\/ Visual C++ gets confused if we use \"fabs\" in the template below, as\n\/\/ it is an overloaded operator.\nstatic double\n_fabs(double d)\n{\n return fabs(d);\n}\n\ntemplate<typename T, typename R>\nstatic void\ncheck(const libport::Statistics<T, R>& s,\n size_t size, T min, T max, R mean, R variance)\n{\n std::cerr << \"Mean: \" << s.mean() << std::endl;\n std::cerr << \"Variance: \" << s.variance() << std::endl;\n assert(size == s.size());\n assert(min == s.min());\n assert(max == s.max());\n assert(_fabs(mean - s.mean()) < 1e-4);\n assert(_fabs(variance - s.variance()) < 1e-4);\n}\n\ntemplate<typename R>\nstatic void\ncheck1(size_t capacity, unsigned int size, unsigned int min, unsigned int max, R mean, R variance)\n{\n libport::Statistics<unsigned int, R> s(capacity);\n s.add_sample(2);\n s.add_sample(2);\n s.add_sample(3);\n s.add_sample(4);\n s.add_sample(7);\n check(s, size, min, max, mean, variance);\n}\n\nint\nmain()\n{\n \/\/ Running samples\n check1<unsigned int>(3, 3, 3, 7, 4, 3);\n check1<double>(3, 3, 3, 7, 4.666666666, 2.8888888888);\n\n \/\/ Non-running samples\n check1<unsigned int>(0, 5, 2, 7, 3, 3);\n check1<double>(0, 5, 2, 7, 3.6, 3.44);\n\n \/\/ Running samples with non-full buffer\n check1<unsigned int>(10, 5, 2, 7, 3, 3);\n check1<double>(10, 5, 2, 7, 3.6, 3.44);\n}\n<|endoftext|>"} {"text":"<commit_before>#include \"bombled.h\"\n\n#define LED_PWM 255\n#define SEGMENT_PWM 255\n\nBombLED::BombLED()\n{\n _blinkOn = false;\n}\n\nvoid BombLED::setup()\n{\n _driver.setup();\n}\n\nvoid BombLED::reset() {\n _minutes = DEFAULT_MINUTES;\n _seconds = DEFAULT_SECONDS;\n _ledState = 0;\n _enabled = false;\n _refresh = true;\n update();\n}\n\nvoid BombLED::complete() {\n _ledState = 0x3FF;\n _enabled = true;\n _refresh = true;\n update();\n}\n\nbool BombLED::isFinished()\n{\n return (_ledState == 0x3FF) && !isFailed();\n}\n\nbool BombLED::isFailed() \n{\n return (_minutes == 0) && (_seconds == 0);\n}\n\nvoid BombLED::update()\n{\n if (!_refresh) return;\n \n if (_enabled) { \n word leds = _ledState;\n if (_blinkOn) leds |= ((1 << 10) | (1 << 11)); \n _setLeds(~leds, LED_PWM);\n\n byte duty;\n if (isFinished() & _blinkOn) duty = 0;\n else duty = SEGMENT_PWM;\n \n setDigits(_minutes \/ 10, _minutes % 10, _seconds \/ 10, _seconds % 10, duty);\n }\n else {\n _driver.clear();\n }\n _driver.update();\n _refresh = false;\n}\n\nvoid BombLED::tickSecond()\n{\n if (!_enabled) return;\n if (isFinished()) return;\n if (_seconds > 0) {\n _seconds--;\n _refresh = true;\n }\n else if (_minutes > 0) {\n _seconds = 59;\n _minutes--;\n _refresh = true;\n }\n}\n\nvoid BombLED::toggleBlink() {\n if (!_enabled) return;\n if (isFinished()) return;\n _blinkOn = !_blinkOn;\n _refresh = true;\n}\n\nvoid BombLED::setLeds(word state) {\n _ledState = state;\n}\n\nword BombLED::getLeds() {\n return _ledState;\n}\n\nvoid BombLED::setEnabled(byte enabled)\n{\n _enabled = enabled;\n _refresh = true;\n}\n\nbyte BombLED::getEnabled() const\n{\n return _enabled;\n}\n\nvoid BombLED::setMinutes(byte minutes)\n{\n _minutes = (minutes > 99) ? 99 : minutes;\n _refresh = true;\n}\n\nbyte BombLED::getMinutes() const\n{\n return _minutes;\n}\n\nvoid BombLED::setSeconds(byte seconds)\n{\n _seconds = (seconds > 59) ? 59 : seconds;\n _refresh = true;\n}\n\nbyte BombLED::getSeconds() const\n{\n return _seconds;\n}\n\n\nconst byte BombLED::_onesmap[]={16,17,0,1,2,14,13,15};\nconst byte BombLED::_tensmap[]={11,12,5,6,7,9,8,10};\nconst byte BombLED::_ledmap[]={17,15,14,13,12,11,10,9,8,7,1,16};\n\n\nconst byte BombLED::_digits[11]={\n 0b01111110, \/\/ 0\n 0b00110000, \/\/ 1\n 0b01101101,\n 0b01111001,\n 0b00110011, \/\/ 4\n 0b01011011,\n 0b01011111,\n 0b01110000, \/\/ 7\n 0b01111111, \/\/ 8\n 0b01111011, \/\/ 9\n 0b00000000 \/\/ OFF\n};\n\nvoid BombLED::_setLeds(word indata, byte duty) {\n for (byte i=0;i<12;i++){\n _driver.set(_ledmap[i]+18, (indata & (1 << i))? duty : 0);\n }\n}\n\n\nvoid BombLED::setDots(byte indata, byte duty) {\n _driver.set(_tensmap[7], (indata & (1 << 3))?duty : 0); \/\/mTens\n _driver.set(_onesmap[7], (indata & (1 << 2))?duty : 0); \/\/mOnes\n _driver.set(_tensmap[7]+36, (indata & (1 << 1))?duty : 0); \/\/sTens\n _driver.set(_onesmap[7]+36, (indata & (1 << 0))?duty : 0); \/\/sOnes\n}\n\nvoid BombLED::setDigit(byte index, byte value, byte duty) {\n setSegments(index, _digits[value], duty);\n}\n\nvoid BombLED::setSegments(byte index, byte mask, byte duty) {\n for (byte i = 0; i < 7; i++) {\n byte bit_idx;\n switch (index) {\n case 0:\n bit_idx = _tensmap[i];\n break;\n case 1:\n bit_idx = _onesmap[i];\n break; \n case 2:\n bit_idx = _tensmap[i]+36;\n break;\n case 3:\n bit_idx = _onesmap[i]+36;\n break;\n }\n _driver.set(bit_idx, (mask & (1 << (6-i)))?duty : 0);\n }\n}\n\nvoid BombLED::setDigits(byte mTens,byte mOnes,byte sTens,byte sOnes, byte duty) {\n byte i;\n for (i=0;i<7;i++){\n _driver.set(_tensmap[i], (_digits[mTens] & (1 << (6-i)))?duty : 0);\n _driver.set(_onesmap[i], (_digits[mOnes] & (1 << (6-i)))?duty : 0);\n _driver.set(_tensmap[i]+36, (_digits[sTens] & (1 << (6-i)))?duty : 0);\n _driver.set(_onesmap[i]+36, (_digits[sOnes] & (1 << (6-i)))?duty : 0);\n }\n}\n\n<commit_msg>Fixed last LED dimming<commit_after>#include \"bombled.h\"\n\n#define LED_PWM 255\n#define SEGMENT_PWM 255\n\nBombLED::BombLED()\n{\n _blinkOn = false;\n}\n\nvoid BombLED::setup()\n{\n _driver.setup();\n}\n\nvoid BombLED::reset() {\n _minutes = DEFAULT_MINUTES;\n _seconds = DEFAULT_SECONDS;\n _ledState = 0;\n _enabled = false;\n _refresh = true;\n update();\n}\n\nvoid BombLED::complete() {\n _ledState = 0x3FF;\n _enabled = true;\n _refresh = true;\n update();\n}\n\nbool BombLED::isFinished()\n{\n return (_ledState == 0x3FF) && !isFailed();\n}\n\nbool BombLED::isFailed() \n{\n return (_minutes == 0) && (_seconds == 0);\n}\n\nvoid BombLED::update()\n{\n if (!_refresh) return;\n \n if (_enabled) { \n word leds = _ledState;\n if (_blinkOn) leds |= ((1 << 10) | (1 << 11)); \n _setLeds(~leds, LED_PWM);\n\n byte duty;\n if (isFinished() & _blinkOn) duty = 0;\n else duty = SEGMENT_PWM;\n \n setDigits(_minutes \/ 10, _minutes % 10, _seconds \/ 10, _seconds % 10, duty);\n }\n else {\n _driver.clear();\n }\n _driver.update();\n _refresh = false;\n}\n\nvoid BombLED::tickSecond()\n{\n if (!_enabled) return;\n if (isFinished()) return;\n if (_seconds > 0) {\n _seconds--;\n _refresh = true;\n }\n else if (_minutes > 0) {\n _seconds = 59;\n _minutes--;\n _refresh = true;\n }\n}\n\nvoid BombLED::toggleBlink() {\n if (!_enabled) return;\n if (isFinished()) return;\n _blinkOn = !_blinkOn;\n _refresh = true;\n}\n\nvoid BombLED::setLeds(word state) {\n _ledState = state;\n _refresh = true;\n}\n\nword BombLED::getLeds() {\n return _ledState;\n}\n\nvoid BombLED::setEnabled(byte enabled)\n{\n _enabled = enabled;\n _refresh = true;\n}\n\nbyte BombLED::getEnabled() const\n{\n return _enabled;\n}\n\nvoid BombLED::setMinutes(byte minutes)\n{\n _minutes = (minutes > 99) ? 99 : minutes;\n _refresh = true;\n}\n\nbyte BombLED::getMinutes() const\n{\n return _minutes;\n}\n\nvoid BombLED::setSeconds(byte seconds)\n{\n _seconds = (seconds > 59) ? 59 : seconds;\n _refresh = true;\n}\n\nbyte BombLED::getSeconds() const\n{\n return _seconds;\n}\n\n\nconst byte BombLED::_onesmap[]={16,17,0,1,2,14,13,15};\nconst byte BombLED::_tensmap[]={11,12,5,6,7,9,8,10};\nconst byte BombLED::_ledmap[]={17,15,14,13,12,11,10,9,8,7,1,16};\n\n\nconst byte BombLED::_digits[11]={\n 0b01111110, \/\/ 0\n 0b00110000, \/\/ 1\n 0b01101101,\n 0b01111001,\n 0b00110011, \/\/ 4\n 0b01011011,\n 0b01011111,\n 0b01110000, \/\/ 7\n 0b01111111, \/\/ 8\n 0b01111011, \/\/ 9\n 0b00000000 \/\/ OFF\n};\n\nvoid BombLED::_setLeds(word indata, byte duty) {\n for (byte i=0;i<12;i++){\n _driver.set(_ledmap[i]+18, (indata & (1 << i))? duty : 0);\n }\n}\n\n\nvoid BombLED::setDots(byte indata, byte duty) {\n _driver.set(_tensmap[7], (indata & (1 << 3))?duty : 0); \/\/mTens\n _driver.set(_onesmap[7], (indata & (1 << 2))?duty : 0); \/\/mOnes\n _driver.set(_tensmap[7]+36, (indata & (1 << 1))?duty : 0); \/\/sTens\n _driver.set(_onesmap[7]+36, (indata & (1 << 0))?duty : 0); \/\/sOnes\n}\n\nvoid BombLED::setDigit(byte index, byte value, byte duty) {\n setSegments(index, _digits[value], duty);\n}\n\nvoid BombLED::setSegments(byte index, byte mask, byte duty) {\n for (byte i = 0; i < 7; i++) {\n byte bit_idx;\n switch (index) {\n case 0:\n bit_idx = _tensmap[i];\n break;\n case 1:\n bit_idx = _onesmap[i];\n break; \n case 2:\n bit_idx = _tensmap[i]+36;\n break;\n case 3:\n bit_idx = _onesmap[i]+36;\n break;\n }\n _driver.set(bit_idx, (mask & (1 << (6-i)))?duty : 0);\n }\n}\n\nvoid BombLED::setDigits(byte mTens,byte mOnes,byte sTens,byte sOnes, byte duty) {\n byte i;\n for (i=0;i<7;i++){\n _driver.set(_tensmap[i], (_digits[mTens] & (1 << (6-i)))?duty : 0);\n _driver.set(_onesmap[i], (_digits[mOnes] & (1 << (6-i)))?duty : 0);\n _driver.set(_tensmap[i]+36, (_digits[sTens] & (1 << (6-i)))?duty : 0);\n _driver.set(_onesmap[i]+36, (_digits[sOnes] & (1 << (6-i)))?duty : 0);\n }\n}\n\n<|endoftext|>"} {"text":"<commit_before>#ifndef SWITCH_NODE_HPP\n#define SWITCH_NODE_HPP\n\n#include <core\/tp_aware_dtm_node.hpp>\n#include <core\/error_handler.hpp>\n#include <math\/functions.hpp>\n#include <helper\/node_counter.hpp>\n#include <memory>\n#include <utility>\n#include <string>\n\n\n\nnamespace mcmc_utilities\n{\n template <typename T,template <typename TE> class T_vector>\n class switch_node\n :public tp_aware_dtm_node<T,T_vector>\n {\n public:\n switch_node(int ninputs)\n :tp_aware_dtm_node<T,T_vector>(ninputs+1,1)\n {}\n\n T do_calc(size_t idx,const T_vector<T>& parent)const override\n {\n int n=size_t(parent.back());\n if(n<0||n>=this->num_of_parents()-1)\n\t{\n\t throw var_out_of_range();\n\t}\n return parent.at(n);\n }\n\n std::shared_ptr<node<T,T_vector> > do_clone()const override\n {\n auto p=new switch_node(this->num_of_parents()-1);\n return std::shared_ptr<node<T,T_vector> >(p);\n }\n\n order do_get_order(const node<T,T_vector>* pn,int n)const override\n {\n for(int i=0;i<this->num_of_parents();++i)\n\t{\n\t order o=this->get_parent_order(0,pn,n);\n\t \/\/return order{0,false,false};\n\t if(o.n!=0||\n\t !o.poly)\n\t {\n\t return order{0,false,false};\n\t }\n\t}\n return order{0,true,true};\n } \n };\n}\n\n\n#endif\n<commit_msg>\t修改： nodes\/switch_node.hpp<commit_after>#ifndef SWITCH_NODE_HPP\n#define SWITCH_NODE_HPP\n\n#include <core\/tp_aware_dtm_node.hpp>\n#include <core\/error_handler.hpp>\n#include <math\/functions.hpp>\n#include <helper\/node_counter.hpp>\n#include <memory>\n#include <utility>\n#include <string>\n\n\n\nnamespace mcmc_utilities\n{\n template <typename T,template <typename TE> class T_vector>\n class switch_node\n :public tp_aware_dtm_node<T,T_vector>\n {\n public:\n switch_node(int ninputs)\n :tp_aware_dtm_node<T,T_vector>(ninputs+1,1)\n {}\n\n T do_calc(size_t idx,const T_vector<T>& parent)const override\n {\n int n=size_t(parent.back());\n if(n<0||n>=this->num_of_parents()-1)\n\t{\n\t std::cerr<<\"n=\"<<n<<std::endl;\n\t std::cerr<<\"nswitch=\"<<(this->num_of_parents()-1)<<std::endl;\n\t throw var_out_of_range();\n\t}\n return parent.at(n);\n }\n\n std::shared_ptr<node<T,T_vector> > do_clone()const override\n {\n auto p=new switch_node(this->num_of_parents()-1);\n return std::shared_ptr<node<T,T_vector> >(p);\n }\n\n order do_get_order(const node<T,T_vector>* pn,int n)const override\n {\n for(int i=0;i<this->num_of_parents();++i)\n\t{\n\t order o=this->get_parent_order(0,pn,n);\n\t \/\/return order{0,false,false};\n\t if(o.n!=0||\n\t !o.poly)\n\t {\n\t return order{0,false,false};\n\t }\n\t}\n return order{0,true,true};\n } \n };\n}\n\n\n#endif\n<|endoftext|>"} {"text":"<commit_before>#include <libmesh\/dirichlet_boundaries.h>\n#include <libmesh\/dof_map.h>\n#include <libmesh\/elem.h>\n#include <libmesh\/equation_systems.h>\n#include <libmesh\/exodusII_io.h>\n#include <libmesh\/function_base.h>\n#include <libmesh\/linear_implicit_system.h>\n#include <libmesh\/mesh.h>\n#include <libmesh\/numeric_vector.h>\n#include <libmesh\/periodic_boundary.h>\n#include <libmesh\/quadrature_gauss.h>\n#include <libmesh\/sparse_matrix.h>\n#include <libmesh\/wrapped_function.h>\n\n#include \"test_comm.h\"\n#include \"libmesh_cppunit.h\"\n\n\nusing namespace libMesh;\n\n\n\nNumber quadratic_solution (const Point& p,\n const Parameters&,\n const std::string&,\n const std::string&)\n{\n const Real & y = LIBMESH_DIM > 1 ? p(1) : 0;\n\n \/\/ Discontinuity at y=1 from the forcing function there.\n \/\/ Periodic on -3 < y < 2\n return (y > 1) ? (y-3)*(y-3) : (y+1)*(y+1);\n}\n\n\n\nstruct PeriodicQuadFunction : public FunctionBase<Number>\n{\n PeriodicQuadFunction() = default;\n\n virtual std::unique_ptr<FunctionBase<Number>> clone () const\n { return libmesh_make_unique<PeriodicQuadFunction>(); }\n\n \/\/ We only really need the vector-valued output for projections\n virtual Number operator() (const Point &,\n const Real \/*time*\/ = 0.) override\n { libmesh_error(); }\n\n virtual void operator() (const Point & p,\n const Real time,\n DenseVector<Number> & output) override\n {\n libmesh_assert_equal_to(output.size(), 1);\n Parameters params;\n output(0) = quadratic_solution(p, params, \"\", \"\");\n }\n\n Number component (unsigned int i,\n const Point & p,\n Real \/* time *\/) override\n {\n Parameters params;\n switch (i) {\n case 0:\n return quadratic_solution(p, params, \"\", \"\");\n default:\n libmesh_error();\n }\n return 0;\n }\n};\n\n\nvoid periodic_bc_test_poisson(EquationSystems& es,\n const std::string& system_name)\n{\n const MeshBase& mesh = es.get_mesh();\n LinearImplicitSystem& system = es.get_system<LinearImplicitSystem>(\"PBCSys\");\n const DofMap& dof_map = system.get_dof_map();\n\n \/\/ Interior FE to integrate smooth part of poisson problem\n FEType fe_type = dof_map.variable_type(0);\n std::unique_ptr<FEBase> fe (FEBase::build(2, fe_type));\n QGauss qrule (2, fe_type.default_quadrature_order());\n fe->attach_quadrature_rule(&qrule);\n\n const std::vector<Real> & JxW = fe->get_JxW();\n const std::vector<std::vector<Real>> & phi = fe->get_phi();\n const std::vector<std::vector<RealGradient>> & dphi = fe->get_dphi();\n\n \/\/ Face FE to integrate delta function part of forcing\n std::unique_ptr<FEBase> fe_face (FEBase::build(2, fe_type));\n QGauss qface (1, fe_type.default_quadrature_order());\n fe_face->attach_quadrature_rule(&qface);\n\n const std::vector<Real> & JxW_face = fe_face->get_JxW();\n const std::vector<std::vector<Real>> & phi_face = fe_face->get_phi();\n std::unique_ptr<const Elem> elem_side;\n\n DenseMatrix<Number> Ke;\n DenseVector<Number> Fe;\n\n std::vector<dof_id_type> dof_indices;\n\n for (const Elem * elem : mesh.active_local_element_ptr_range())\n {\n dof_map.dof_indices (elem, dof_indices);\n const unsigned int n_dofs = dof_indices.size();\n\n Ke.resize (n_dofs, n_dofs);\n Fe.resize (n_dofs);\n\n fe->reinit (elem);\n\n \/\/ Integrate the poisson problem over the element interior, where we have\n \/\/ a nice f=2 forcing function aside from the discontinuity\n for (unsigned int qp=0; qp<qrule.n_points(); qp++)\n {\n for (unsigned int i=0; i != n_dofs; i++)\n {\n for (unsigned int j=0; j != n_dofs; j++)\n Ke(i,j) += -JxW[qp]*(dphi[i][qp]*dphi[j][qp]);\n\n Fe(i) += JxW[qp]*phi[i][qp]*2;\n }\n }\n\n for(unsigned int s=0; s != elem->n_sides(); ++s)\n {\n elem->build_side_ptr(elem_side, s);\n Point centroid = elem_side->centroid();\n if (std::abs(centroid(1) - 1) < TOLERANCE)\n {\n fe_face->reinit(elem, s);\n\n for (unsigned int qp=0; qp<qface.n_points(); qp++)\n {\n \/\/ delta function divided by 2 since we hit it from\n \/\/ both sides\n for (unsigned int i=0; i != n_dofs; i++)\n Fe(i) += JxW_face[qp]*phi_face[i][qp]*(-4);\n }\n }\n }\n\n dof_map.heterogenously_constrain_element_matrix_and_vector(Ke, Fe, dof_indices);\n system.matrix->add_matrix (Ke, dof_indices);\n system.rhs->add_vector (Fe, dof_indices);\n }\n\n system.rhs->close();\n system.matrix->close();\n}\n\n\nconst boundary_id_type top_id = 50;\nconst boundary_id_type bottom_id = 60;\nconst boundary_id_type side_id = 70;\n\n\nclass PeriodicBCTest : public CppUnit::TestCase {\npublic:\n CPPUNIT_TEST_SUITE( PeriodicBCTest );\n\n#if LIBMESH_DIM > 1\n#if defined(LIBMESH_HAVE_SOLVER) && defined(LIBMESH_HAVE_EXODUS_API) && defined(LIBMESH_HAVE_GZSTREAM)\n CPPUNIT_TEST( testPeriodicLagrange2 );\n#endif\n#endif \/\/ LIBMESH_DIM > 1\n\n CPPUNIT_TEST_SUITE_END();\n\nprivate:\n\n void testPeriodicBC (FEType fe_type)\n {\n Mesh mesh(*TestCommWorld);\n BoundaryInfo & boundary = mesh.get_boundary_info();\n\n EquationSystems es(mesh);\n LinearImplicitSystem &sys =\n es.add_system<LinearImplicitSystem> (\"PBCSys\");\n\n \/\/ We need to change around BCIDs and set up the periodic BC first\n mesh.allow_remote_element_removal(false);\n\n mesh.read(\"meshes\/shark_tooth_tri6.xda.gz\");\n\n \/\/ Add some BCIDs on top and bottom for our periodic boundary\n for (const Elem * elem : mesh.active_element_ptr_range())\n {\n for (unsigned int s=0; s != 3; ++s)\n if (!elem->neighbor_ptr(s))\n {\n unsigned v2 = (s+1)%3;\n \/\/ Left-running edges are on bottom, because this xda\n \/\/ has a flipped mesh\n if (elem->point(s)(0) - elem->point(v2)(0) < -.1)\n boundary.add_side(elem, s, top_id);\n\n \/\/ Right-running edges are on top\n else if (elem->point(s)(0) - elem->point(v2)(0) > .1)\n boundary.add_side(elem, s, bottom_id);\n\n \/\/ Vertical edges are Dirichlet\n else\n boundary.add_side(elem, s, side_id);\n }\n }\n\n PeriodicBoundary vert(RealVectorValue(0., 4.0));\n vert.myboundary = bottom_id;\n vert.pairedboundary = top_id;\n sys.get_dof_map().add_periodic_boundary(vert);\n\n \/\/ Okay, *now* the mesh knows to save periodic neighbors\n mesh.allow_remote_element_removal(true);\n mesh.delete_remote_elements();\n\n const unsigned int u_var = sys.add_variable(\"u\", fe_type);\n sys.attach_assemble_function (periodic_bc_test_poisson);\n\n std::set<boundary_id_type> side_bdy { side_id };\n std::vector<unsigned int> all_vars (1, u_var);\n WrappedFunction<Number> exact_val(sys, quadratic_solution);\n DirichletBoundary exact_bc(side_bdy, all_vars, exact_val);\n sys.get_dof_map().add_dirichlet_boundary(exact_bc);\n\n es.init();\n\n sys.solve();\n\n ExodusII_IO(mesh).write_equation_systems(\"periodic.e\", es);\n\n Parameters params;\n\n for (Real x = 0.1; x < 10; x += 0.2)\n for (Real ya = -2.9; ya < 1; ya += 0.2)\n {\n \/\/ Integrate the sharktooth shape\n const Real offset = 1-std::abs(std::fmod(x,2)-1);\n const Real y = ya + offset;\n Point p{x,y};\n const Number exact = quadratic_solution(p,params,\"\",\"\");\n const Number approx = sys.point_value(0,p);\n LIBMESH_ASSERT_FP_EQUAL(libmesh_real(exact),\n libmesh_real(approx),\n TOLERANCE*TOLERANCE*10);\n }\n }\n\n\n void testPeriodicLagrange2() { testPeriodicBC(FEType(SECOND, LAGRANGE)); }\n};\n\nCPPUNIT_TEST_SUITE_REGISTRATION( PeriodicBCTest );\n<commit_msg>Bump up tolerance in the \"sharktooth\" PBC test<commit_after>#include <libmesh\/dirichlet_boundaries.h>\n#include <libmesh\/dof_map.h>\n#include <libmesh\/elem.h>\n#include <libmesh\/equation_systems.h>\n#include <libmesh\/exodusII_io.h>\n#include <libmesh\/function_base.h>\n#include <libmesh\/linear_implicit_system.h>\n#include <libmesh\/mesh.h>\n#include <libmesh\/numeric_vector.h>\n#include <libmesh\/periodic_boundary.h>\n#include <libmesh\/quadrature_gauss.h>\n#include <libmesh\/sparse_matrix.h>\n#include <libmesh\/wrapped_function.h>\n\n#include \"test_comm.h\"\n#include \"libmesh_cppunit.h\"\n\n\nusing namespace libMesh;\n\n\n\nNumber quadratic_solution (const Point& p,\n const Parameters&,\n const std::string&,\n const std::string&)\n{\n const Real & y = LIBMESH_DIM > 1 ? p(1) : 0;\n\n \/\/ Discontinuity at y=1 from the forcing function there.\n \/\/ Periodic on -3 < y < 2\n return (y > 1) ? (y-3)*(y-3) : (y+1)*(y+1);\n}\n\n\n\nstruct PeriodicQuadFunction : public FunctionBase<Number>\n{\n PeriodicQuadFunction() = default;\n\n virtual std::unique_ptr<FunctionBase<Number>> clone () const\n { return libmesh_make_unique<PeriodicQuadFunction>(); }\n\n \/\/ We only really need the vector-valued output for projections\n virtual Number operator() (const Point &,\n const Real \/*time*\/ = 0.) override\n { libmesh_error(); }\n\n virtual void operator() (const Point & p,\n const Real time,\n DenseVector<Number> & output) override\n {\n libmesh_assert_equal_to(output.size(), 1);\n Parameters params;\n output(0) = quadratic_solution(p, params, \"\", \"\");\n }\n\n Number component (unsigned int i,\n const Point & p,\n Real \/* time *\/) override\n {\n Parameters params;\n switch (i) {\n case 0:\n return quadratic_solution(p, params, \"\", \"\");\n default:\n libmesh_error();\n }\n return 0;\n }\n};\n\n\nvoid periodic_bc_test_poisson(EquationSystems& es,\n const std::string& system_name)\n{\n const MeshBase& mesh = es.get_mesh();\n LinearImplicitSystem& system = es.get_system<LinearImplicitSystem>(\"PBCSys\");\n const DofMap& dof_map = system.get_dof_map();\n\n \/\/ Interior FE to integrate smooth part of poisson problem\n FEType fe_type = dof_map.variable_type(0);\n std::unique_ptr<FEBase> fe (FEBase::build(2, fe_type));\n QGauss qrule (2, fe_type.default_quadrature_order());\n fe->attach_quadrature_rule(&qrule);\n\n const std::vector<Real> & JxW = fe->get_JxW();\n const std::vector<std::vector<Real>> & phi = fe->get_phi();\n const std::vector<std::vector<RealGradient>> & dphi = fe->get_dphi();\n\n \/\/ Face FE to integrate delta function part of forcing\n std::unique_ptr<FEBase> fe_face (FEBase::build(2, fe_type));\n QGauss qface (1, fe_type.default_quadrature_order());\n fe_face->attach_quadrature_rule(&qface);\n\n const std::vector<Real> & JxW_face = fe_face->get_JxW();\n const std::vector<std::vector<Real>> & phi_face = fe_face->get_phi();\n std::unique_ptr<const Elem> elem_side;\n\n DenseMatrix<Number> Ke;\n DenseVector<Number> Fe;\n\n std::vector<dof_id_type> dof_indices;\n\n for (const Elem * elem : mesh.active_local_element_ptr_range())\n {\n dof_map.dof_indices (elem, dof_indices);\n const unsigned int n_dofs = dof_indices.size();\n\n Ke.resize (n_dofs, n_dofs);\n Fe.resize (n_dofs);\n\n fe->reinit (elem);\n\n \/\/ Integrate the poisson problem over the element interior, where we have\n \/\/ a nice f=2 forcing function aside from the discontinuity\n for (unsigned int qp=0; qp<qrule.n_points(); qp++)\n {\n for (unsigned int i=0; i != n_dofs; i++)\n {\n for (unsigned int j=0; j != n_dofs; j++)\n Ke(i,j) += -JxW[qp]*(dphi[i][qp]*dphi[j][qp]);\n\n Fe(i) += JxW[qp]*phi[i][qp]*2;\n }\n }\n\n for(unsigned int s=0; s != elem->n_sides(); ++s)\n {\n elem->build_side_ptr(elem_side, s);\n Point centroid = elem_side->centroid();\n if (std::abs(centroid(1) - 1) < TOLERANCE)\n {\n fe_face->reinit(elem, s);\n\n for (unsigned int qp=0; qp<qface.n_points(); qp++)\n {\n \/\/ delta function divided by 2 since we hit it from\n \/\/ both sides\n for (unsigned int i=0; i != n_dofs; i++)\n Fe(i) += JxW_face[qp]*phi_face[i][qp]*(-4);\n }\n }\n }\n\n dof_map.heterogenously_constrain_element_matrix_and_vector(Ke, Fe, dof_indices);\n system.matrix->add_matrix (Ke, dof_indices);\n system.rhs->add_vector (Fe, dof_indices);\n }\n\n system.rhs->close();\n system.matrix->close();\n}\n\n\nconst boundary_id_type top_id = 50;\nconst boundary_id_type bottom_id = 60;\nconst boundary_id_type side_id = 70;\n\n\nclass PeriodicBCTest : public CppUnit::TestCase {\npublic:\n CPPUNIT_TEST_SUITE( PeriodicBCTest );\n\n#if LIBMESH_DIM > 1\n#if defined(LIBMESH_HAVE_SOLVER) && defined(LIBMESH_HAVE_EXODUS_API) && defined(LIBMESH_HAVE_GZSTREAM)\n CPPUNIT_TEST( testPeriodicLagrange2 );\n#endif\n#endif \/\/ LIBMESH_DIM > 1\n\n CPPUNIT_TEST_SUITE_END();\n\nprivate:\n\n void testPeriodicBC (FEType fe_type)\n {\n Mesh mesh(*TestCommWorld);\n BoundaryInfo & boundary = mesh.get_boundary_info();\n\n EquationSystems es(mesh);\n LinearImplicitSystem &sys =\n es.add_system<LinearImplicitSystem> (\"PBCSys\");\n\n \/\/ We need to change around BCIDs and set up the periodic BC first\n mesh.allow_remote_element_removal(false);\n\n mesh.read(\"meshes\/shark_tooth_tri6.xda.gz\");\n\n \/\/ Add some BCIDs on top and bottom for our periodic boundary\n for (const Elem * elem : mesh.active_element_ptr_range())\n {\n for (unsigned int s=0; s != 3; ++s)\n if (!elem->neighbor_ptr(s))\n {\n unsigned v2 = (s+1)%3;\n \/\/ Left-running edges are on bottom, because this xda\n \/\/ has a flipped mesh\n if (elem->point(s)(0) - elem->point(v2)(0) < -.1)\n boundary.add_side(elem, s, top_id);\n\n \/\/ Right-running edges are on top\n else if (elem->point(s)(0) - elem->point(v2)(0) > .1)\n boundary.add_side(elem, s, bottom_id);\n\n \/\/ Vertical edges are Dirichlet\n else\n boundary.add_side(elem, s, side_id);\n }\n }\n\n PeriodicBoundary vert(RealVectorValue(0., 4.0));\n vert.myboundary = bottom_id;\n vert.pairedboundary = top_id;\n sys.get_dof_map().add_periodic_boundary(vert);\n\n \/\/ Okay, *now* the mesh knows to save periodic neighbors\n mesh.allow_remote_element_removal(true);\n mesh.delete_remote_elements();\n\n const unsigned int u_var = sys.add_variable(\"u\", fe_type);\n sys.attach_assemble_function (periodic_bc_test_poisson);\n\n std::set<boundary_id_type> side_bdy { side_id };\n std::vector<unsigned int> all_vars (1, u_var);\n WrappedFunction<Number> exact_val(sys, quadratic_solution);\n DirichletBoundary exact_bc(side_bdy, all_vars, exact_val);\n sys.get_dof_map().add_dirichlet_boundary(exact_bc);\n\n es.init();\n\n sys.solve();\n\n ExodusII_IO(mesh).write_equation_systems(\"periodic.e\", es);\n\n Parameters params;\n\n for (Real x = 0.1; x < 10; x += 0.2)\n for (Real ya = -2.9; ya < 1; ya += 0.2)\n {\n \/\/ Integrate the sharktooth shape\n const Real offset = 1-std::abs(std::fmod(x,2)-1);\n const Real y = ya + offset;\n Point p{x,y};\n const Number exact = quadratic_solution(p,params,\"\",\"\");\n const Number approx = sys.point_value(0,p);\n LIBMESH_ASSERT_FP_EQUAL(libmesh_real(exact),\n libmesh_real(approx),\n TOLERANCE*TOLERANCE*20);\n }\n }\n\n\n void testPeriodicLagrange2() { testPeriodicBC(FEType(SECOND, LAGRANGE)); }\n};\n\nCPPUNIT_TEST_SUITE_REGISTRATION( PeriodicBCTest );\n<|endoftext|>"} {"text":"<commit_before>\/* \n * The Biomechanical ToolKit\n * Copyright (c) 2009-2013, 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 \"btkForcePlatformWrenchFilter.h\"\n#include \"btkConvert.h\"\n\nnamespace btk\n{\n \/**\n * @class ForcePlatformWrenchFilter btkForcePlatformWrenchFilter.h\n * @brief Calcule the wrench of the center of the force platform data, expressed in the global frame (by default).\n *\n * Based on the given collection of forceplate set in input, this filter transform the associated analog channels in forces and moments.\n * This transformation take into account the type of each force platform.\n *\n * You can use the method SetTransformToGlobalFrame() to have the wrench expressed in the frame of the force platform.\n *\n * @ingroup BTKBasicFilters\n *\/\n \n \/**\n * @typedef ForcePlatformWrenchFilter::Pointer\n * Smart pointer associated with a ForcePlatformWrenchFilter object.\n *\/\n \n \/**\n * @typedef ForcePlatformWrenchFilter::ConstPointer\n * Smart pointer associated with a const ForcePlatformWrenchFilter object.\n *\/\n \n \/**\n * @fn static Pointer ForcePlatformWrenchFilter::New();\n * Creates a smart pointer associated with a ForcePlatformWrenchFilter object.\n *\/\n\n \/**\n * @fn WrenchCollection::Pointer ForcePlatformWrenchFilter::GetInput()\n * Gets the input registered with this process.\n *\/\n\n \/**\n * @fn void ForcePlatformWrenchFilter::SetInput(ForcePlatform::Pointer input)\n * Sets the input required with this process. This input is transformed in a collection force platforms with a single force platform.\n *\/\n \n \/**\n * @fn void ForcePlatformWrenchFilter::SetInput(ForcePlatformCollection::Pointer input)\n * Sets the input required with this process.\n *\/\n \n \/**\n * @fn PointCollection::Pointer ForcePlatformWrenchFilter::GetOutput()\n * Gets the output created with this process.\n *\/\n \n \/**\n * Sets the flag to activate the transformation to the global frame.\n *\/\n void ForcePlatformWrenchFilter::SetTransformToGlobalFrame(bool activation)\n {\n if (this->m_GlobalTransformationActivated == activation)\n return;\n this->m_GlobalTransformationActivated = activation;\n this->Modified();\n };\n \n \/**\n * @fn bool ForcePlatformWrenchFilter::GetTransformToGlobalFrame() const\n * Returns the activation flag for the transformation in the global frame.\n *\/\n \n \/**\n * Constructor. Sets the number of inputs and outputs to 1.\n *\/\n ForcePlatformWrenchFilter::ForcePlatformWrenchFilter()\n : ProcessObject()\n {\n this->SetInputNumber(1);\n this->SetOutputNumber(1);\n this->m_GlobalTransformationActivated = true;\n };\n\n \/**\n * @fn ForcePlatformCollection::Pointer ForcePlatformWrenchFilter::GetInput(int idx)\n * Returns the input at the index @a idx.\n *\/\n \n \/**\n * @fn WrenchCollection::Pointer ForcePlatformWrenchFilter::GetOutput(int idx)\n * Returns the output at the index @a idx.\n *\/\n \n \/**\n * Creates a WrenchCollection:Pointer object and return it as a DataObject::Pointer.\n *\/\n DataObject::Pointer ForcePlatformWrenchFilter::MakeOutput(int \/* idx *\/)\n {\n return WrenchCollection::New();\n };\n \n \/**\n * Generates the outputs' data.\n *\/\n void ForcePlatformWrenchFilter::GenerateData()\n {\n WrenchCollection::Pointer output = this->GetOutput();\n ForcePlatformCollection::Pointer input = this->GetInput();\n if (input.get() != 0)\n {\n int inc = 0;\n for (ForcePlatformCollection::ConstIterator it = input->Begin() ; it != input->End() ; ++it)\n {\n ++inc;\n if ((*it)->GetChannelNumber() == 0)\n {\n btkErrorMacro(\"Unexpected number of analog channels (0) for force platform #\" + ToString(inc));\n continue;\n }\n int frameNumber = (*it)->GetChannel(0)->GetFrameNumber();\n Wrench::Pointer wrh;\n if (inc <= output->GetItemNumber())\n {\n wrh = output->GetItem(inc-1);\n wrh->SetFrameNumber(frameNumber);\n output->Modified();\n }\n else\n {\n wrh = Wrench::New(this->GetWrenchPrefix() + ToString(inc), frameNumber);\n output->InsertItem(wrh);\n }\n wrh->Modified();\n \/\/ Residuals\n wrh->GetPosition()->GetResiduals().setZero(frameNumber); \n wrh->GetForce()->GetResiduals().setZero(frameNumber);\n wrh->GetMoment()->GetResiduals().setZero(frameNumber);\n \/\/ Values\n switch((*it)->GetType())\n {\n \/\/ 6 channels\n case 1:\n wrh->GetForce()->GetValues().col(0) = (*it)->GetChannel(0)->GetValues();\n wrh->GetForce()->GetValues().col(1) = (*it)->GetChannel(1)->GetValues();\n wrh->GetForce()->GetValues().col(2) = (*it)->GetChannel(2)->GetValues();\n wrh->GetPosition()->GetValues().col(0) = (*it)->GetChannel(3)->GetValues();\n wrh->GetPosition()->GetValues().col(1) = (*it)->GetChannel(4)->GetValues();\n wrh->GetPosition()->GetValues().col(2).setZero();\n wrh->GetMoment()->GetValues().col(0).setZero();\n wrh->GetMoment()->GetValues().col(1).setZero();\n wrh->GetMoment()->GetValues().col(2) = (*it)->GetChannel(5)->GetValues();\n this->FinishTypeI(wrh, *it, inc);\n break;\n case 2:\n case 4:\n case 5:\n wrh->GetForce()->GetValues().col(0) = (*it)->GetChannel(0)->GetValues();\n wrh->GetForce()->GetValues().col(1) = (*it)->GetChannel(1)->GetValues();\n wrh->GetForce()->GetValues().col(2) = (*it)->GetChannel(2)->GetValues();\n wrh->GetMoment()->GetValues().col(0) = (*it)->GetChannel(3)->GetValues();\n wrh->GetMoment()->GetValues().col(1) = (*it)->GetChannel(4)->GetValues();\n wrh->GetMoment()->GetValues().col(2) = (*it)->GetChannel(5)->GetValues();\n this->FinishAMTI(wrh, *it, inc);\n break;\n case 3:\n \/\/ Fx\n wrh->GetForce()->GetValues().col(0) = (*it)->GetChannel(0)->GetValues() + (*it)->GetChannel(1)->GetValues();\n \/\/ Fy\n wrh->GetForce()->GetValues().col(1) = (*it)->GetChannel(2)->GetValues() + (*it)->GetChannel(3)->GetValues();\n \/\/ Fz\n wrh->GetForce()->GetValues().col(2) = (*it)->GetChannel(4)->GetValues() + (*it)->GetChannel(5)->GetValues() + (*it)->GetChannel(6)->GetValues() + (*it)->GetChannel(7)->GetValues();\n \/\/ Mx\n wrh->GetMoment()->GetValues().col(0) = (*it)->GetOrigin().y() * ((*it)->GetChannel(4)->GetValues() + (*it)->GetChannel(5)->GetValues() - (*it)->GetChannel(6)->GetValues() - (*it)->GetChannel(7)->GetValues());\n \/\/ My\n wrh->GetMoment()->GetValues().col(1) = (*it)->GetOrigin().x() * ((*it)->GetChannel(5)->GetValues() + (*it)->GetChannel(6)->GetValues() - (*it)->GetChannel(4)->GetValues() - (*it)->GetChannel(7)->GetValues());\n \/\/ Mz\n wrh->GetMoment()->GetValues().col(2) = (*it)->GetOrigin().y() * ((*it)->GetChannel(1)->GetValues() - (*it)->GetChannel(0)->GetValues()) + (*it)->GetOrigin().x() * ((*it)->GetChannel(2)->GetValues() - (*it)->GetChannel(3)->GetValues());\n this->FinishKistler(wrh, *it, inc);\n break;\n case 6:\n btkErrorMacro(\"Force Platform type 6 is not yet supported. Please, report this to the developers\");\n break;\n case 7:\n btkErrorMacro(\"Force Platform type 7 is not yet supported. Please, report this to the developers\");\n break;\n case 11:\n btkErrorMacro(\"Force Platform type 11 is not yet supported. Please, report this to the developers\");\n break;\n case 12:\n btkErrorMacro(\"Force Platform type 12 is not yet supported. Please, report this to the developers\");\n break;\n case 21:\n btkErrorMacro(\"Force Platform type 21 is not yet supported. Please, report this to the developers\");\n break;\n }\n if (this->m_GlobalTransformationActivated)\n this->TransformToGlobal(wrh, (*it)->GetCorners());\n }\n }\n };\n \n \/**\n * Finish the computation of the wrench for the force platform type I.\n * Because, it is force platform Type I, the position is not set to the origin, but measured to the COP. The moment must be corrected!\n *\/\n void ForcePlatformWrenchFilter::FinishTypeI(Wrench::Pointer wrh , ForcePlatform::Pointer \/* fp *\/, int \/* index *\/)\n {\n typedef Eigen::Array<double, Eigen::Dynamic, 1> Component;\n Component Fx = wrh->GetForce()->GetValues().col(0).array();\n Component Fy = wrh->GetForce()->GetValues().col(1).array();\n Component Fz = wrh->GetForce()->GetValues().col(2).array();\n Component Mx = wrh->GetMoment()->GetValues().col(0).array();\n Component My = wrh->GetMoment()->GetValues().col(1).array();\n Component Mz = wrh->GetMoment()->GetValues().col(2).array();\n Component Px = wrh->GetPosition()->GetValues().col(0).array();\n Component Py = wrh->GetPosition()->GetValues().col(1).array();\n Component Pz = wrh->GetPosition()->GetValues().col(2).array();\n Mx -= Fy * Pz - Py * Fz;\n My -= Fz * Px - Pz * Fx;\n Mz -= Fx * Py - Px * Fy;\n wrh->GetMoment()->GetValues().col(0) = Mx;\n wrh->GetMoment()->GetValues().col(1) = My;\n wrh->GetMoment()->GetValues().col(2) = Mz;\n };\n \n \/**\n * Finish the computation of the wrench for the AMTI force platform (nothing to do).\n *\/\n void ForcePlatformWrenchFilter::FinishAMTI(Wrench::Pointer \/* wrh *\/, ForcePlatform::Pointer \/* fp *\/, int \/* index *\/)\n {};\n \n \/**\n * Finish the computation of the wrench for the Kistler force platform (nothing to do).\n *\/\n void ForcePlatformWrenchFilter::FinishKistler(Wrench::Pointer \/* wrh *\/, ForcePlatform::Pointer \/* fp *\/, int \/* index *\/)\n {};\n};\n\n<commit_msg>[FIX] Loading an acquisition with 3 force platforms in Mokka and loading another acquisition with only 2 force platforms still show the force vector of the third one.<commit_after>\/* \n * The Biomechanical ToolKit\n * Copyright (c) 2009-2013, 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 \"btkForcePlatformWrenchFilter.h\"\n#include \"btkConvert.h\"\n\nnamespace btk\n{\n \/**\n * @class ForcePlatformWrenchFilter btkForcePlatformWrenchFilter.h\n * @brief Calcule the wrench of the center of the force platform data, expressed in the global frame (by default).\n *\n * Based on the given collection of forceplate set in input, this filter transform the associated analog channels in forces and moments.\n * This transformation take into account the type of each force platform.\n *\n * You can use the method SetTransformToGlobalFrame() to have the wrench expressed in the frame of the force platform.\n *\n * @ingroup BTKBasicFilters\n *\/\n \n \/**\n * @typedef ForcePlatformWrenchFilter::Pointer\n * Smart pointer associated with a ForcePlatformWrenchFilter object.\n *\/\n \n \/**\n * @typedef ForcePlatformWrenchFilter::ConstPointer\n * Smart pointer associated with a const ForcePlatformWrenchFilter object.\n *\/\n \n \/**\n * @fn static Pointer ForcePlatformWrenchFilter::New();\n * Creates a smart pointer associated with a ForcePlatformWrenchFilter object.\n *\/\n\n \/**\n * @fn WrenchCollection::Pointer ForcePlatformWrenchFilter::GetInput()\n * Gets the input registered with this process.\n *\/\n\n \/**\n * @fn void ForcePlatformWrenchFilter::SetInput(ForcePlatform::Pointer input)\n * Sets the input required with this process. This input is transformed in a collection force platforms with a single force platform.\n *\/\n \n \/**\n * @fn void ForcePlatformWrenchFilter::SetInput(ForcePlatformCollection::Pointer input)\n * Sets the input required with this process.\n *\/\n \n \/**\n * @fn PointCollection::Pointer ForcePlatformWrenchFilter::GetOutput()\n * Gets the output created with this process.\n *\/\n \n \/**\n * Sets the flag to activate the transformation to the global frame.\n *\/\n void ForcePlatformWrenchFilter::SetTransformToGlobalFrame(bool activation)\n {\n if (this->m_GlobalTransformationActivated == activation)\n return;\n this->m_GlobalTransformationActivated = activation;\n this->Modified();\n };\n \n \/**\n * @fn bool ForcePlatformWrenchFilter::GetTransformToGlobalFrame() const\n * Returns the activation flag for the transformation in the global frame.\n *\/\n \n \/**\n * Constructor. Sets the number of inputs and outputs to 1.\n *\/\n ForcePlatformWrenchFilter::ForcePlatformWrenchFilter()\n : ProcessObject()\n {\n this->SetInputNumber(1);\n this->SetOutputNumber(1);\n this->m_GlobalTransformationActivated = true;\n };\n\n \/**\n * @fn ForcePlatformCollection::Pointer ForcePlatformWrenchFilter::GetInput(int idx)\n * Returns the input at the index @a idx.\n *\/\n \n \/**\n * @fn WrenchCollection::Pointer ForcePlatformWrenchFilter::GetOutput(int idx)\n * Returns the output at the index @a idx.\n *\/\n \n \/**\n * Creates a WrenchCollection:Pointer object and return it as a DataObject::Pointer.\n *\/\n DataObject::Pointer ForcePlatformWrenchFilter::MakeOutput(int \/* idx *\/)\n {\n return WrenchCollection::New();\n };\n \n \/**\n * Generates the outputs' data.\n *\/\n void ForcePlatformWrenchFilter::GenerateData()\n {\n WrenchCollection::Pointer output = this->GetOutput();\n ForcePlatformCollection::Pointer input = this->GetInput();\n if (input.get() != 0)\n {\n int inc = 0;\n for (ForcePlatformCollection::ConstIterator it = input->Begin() ; it != input->End() ; ++it)\n {\n ++inc;\n if ((*it)->GetChannelNumber() == 0)\n {\n btkErrorMacro(\"Unexpected number of analog channels (0) for force platform #\" + ToString(inc));\n continue;\n }\n int frameNumber = (*it)->GetChannel(0)->GetFrameNumber();\n Wrench::Pointer wrh;\n if (inc <= output->GetItemNumber())\n {\n wrh = output->GetItem(inc-1);\n wrh->SetFrameNumber(frameNumber);\n output->Modified();\n }\n else\n {\n wrh = Wrench::New(this->GetWrenchPrefix() + ToString(inc), frameNumber);\n output->InsertItem(wrh);\n }\n wrh->Modified();\n \/\/ Residuals\n wrh->GetPosition()->GetResiduals().setZero(frameNumber); \n wrh->GetForce()->GetResiduals().setZero(frameNumber);\n wrh->GetMoment()->GetResiduals().setZero(frameNumber);\n \/\/ Values\n switch((*it)->GetType())\n {\n \/\/ 6 channels\n case 1:\n wrh->GetForce()->GetValues().col(0) = (*it)->GetChannel(0)->GetValues();\n wrh->GetForce()->GetValues().col(1) = (*it)->GetChannel(1)->GetValues();\n wrh->GetForce()->GetValues().col(2) = (*it)->GetChannel(2)->GetValues();\n wrh->GetPosition()->GetValues().col(0) = (*it)->GetChannel(3)->GetValues();\n wrh->GetPosition()->GetValues().col(1) = (*it)->GetChannel(4)->GetValues();\n wrh->GetPosition()->GetValues().col(2).setZero();\n wrh->GetMoment()->GetValues().col(0).setZero();\n wrh->GetMoment()->GetValues().col(1).setZero();\n wrh->GetMoment()->GetValues().col(2) = (*it)->GetChannel(5)->GetValues();\n this->FinishTypeI(wrh, *it, inc);\n break;\n case 2:\n case 4:\n case 5:\n wrh->GetForce()->GetValues().col(0) = (*it)->GetChannel(0)->GetValues();\n wrh->GetForce()->GetValues().col(1) = (*it)->GetChannel(1)->GetValues();\n wrh->GetForce()->GetValues().col(2) = (*it)->GetChannel(2)->GetValues();\n wrh->GetMoment()->GetValues().col(0) = (*it)->GetChannel(3)->GetValues();\n wrh->GetMoment()->GetValues().col(1) = (*it)->GetChannel(4)->GetValues();\n wrh->GetMoment()->GetValues().col(2) = (*it)->GetChannel(5)->GetValues();\n this->FinishAMTI(wrh, *it, inc);\n break;\n case 3:\n \/\/ Fx\n wrh->GetForce()->GetValues().col(0) = (*it)->GetChannel(0)->GetValues() + (*it)->GetChannel(1)->GetValues();\n \/\/ Fy\n wrh->GetForce()->GetValues().col(1) = (*it)->GetChannel(2)->GetValues() + (*it)->GetChannel(3)->GetValues();\n \/\/ Fz\n wrh->GetForce()->GetValues().col(2) = (*it)->GetChannel(4)->GetValues() + (*it)->GetChannel(5)->GetValues() + (*it)->GetChannel(6)->GetValues() + (*it)->GetChannel(7)->GetValues();\n \/\/ Mx\n wrh->GetMoment()->GetValues().col(0) = (*it)->GetOrigin().y() * ((*it)->GetChannel(4)->GetValues() + (*it)->GetChannel(5)->GetValues() - (*it)->GetChannel(6)->GetValues() - (*it)->GetChannel(7)->GetValues());\n \/\/ My\n wrh->GetMoment()->GetValues().col(1) = (*it)->GetOrigin().x() * ((*it)->GetChannel(5)->GetValues() + (*it)->GetChannel(6)->GetValues() - (*it)->GetChannel(4)->GetValues() - (*it)->GetChannel(7)->GetValues());\n \/\/ Mz\n wrh->GetMoment()->GetValues().col(2) = (*it)->GetOrigin().y() * ((*it)->GetChannel(1)->GetValues() - (*it)->GetChannel(0)->GetValues()) + (*it)->GetOrigin().x() * ((*it)->GetChannel(2)->GetValues() - (*it)->GetChannel(3)->GetValues());\n this->FinishKistler(wrh, *it, inc);\n break;\n case 6:\n btkErrorMacro(\"Force Platform type 6 is not yet supported. Please, report this to the developers\");\n break;\n case 7:\n btkErrorMacro(\"Force Platform type 7 is not yet supported. Please, report this to the developers\");\n break;\n case 11:\n btkErrorMacro(\"Force Platform type 11 is not yet supported. Please, report this to the developers\");\n break;\n case 12:\n btkErrorMacro(\"Force Platform type 12 is not yet supported. Please, report this to the developers\");\n break;\n case 21:\n btkErrorMacro(\"Force Platform type 21 is not yet supported. Please, report this to the developers\");\n break;\n }\n if (this->m_GlobalTransformationActivated)\n this->TransformToGlobal(wrh, (*it)->GetCorners());\n }\n output->SetItemNumber(input->GetItemNumber());\n }\n };\n \n \/**\n * Finish the computation of the wrench for the force platform type I.\n * Because, it is force platform Type I, the position is not set to the origin, but measured to the COP. The moment must be corrected!\n *\/\n void ForcePlatformWrenchFilter::FinishTypeI(Wrench::Pointer wrh , ForcePlatform::Pointer \/* fp *\/, int \/* index *\/)\n {\n typedef Eigen::Array<double, Eigen::Dynamic, 1> Component;\n Component Fx = wrh->GetForce()->GetValues().col(0).array();\n Component Fy = wrh->GetForce()->GetValues().col(1).array();\n Component Fz = wrh->GetForce()->GetValues().col(2).array();\n Component Mx = wrh->GetMoment()->GetValues().col(0).array();\n Component My = wrh->GetMoment()->GetValues().col(1).array();\n Component Mz = wrh->GetMoment()->GetValues().col(2).array();\n Component Px = wrh->GetPosition()->GetValues().col(0).array();\n Component Py = wrh->GetPosition()->GetValues().col(1).array();\n Component Pz = wrh->GetPosition()->GetValues().col(2).array();\n Mx -= Fy * Pz - Py * Fz;\n My -= Fz * Px - Pz * Fx;\n Mz -= Fx * Py - Px * Fy;\n wrh->GetMoment()->GetValues().col(0) = Mx;\n wrh->GetMoment()->GetValues().col(1) = My;\n wrh->GetMoment()->GetValues().col(2) = Mz;\n };\n \n \/**\n * Finish the computation of the wrench for the AMTI force platform (nothing to do).\n *\/\n void ForcePlatformWrenchFilter::FinishAMTI(Wrench::Pointer \/* wrh *\/, ForcePlatform::Pointer \/* fp *\/, int \/* index *\/)\n {};\n \n \/**\n * Finish the computation of the wrench for the Kistler force platform (nothing to do).\n *\/\n void ForcePlatformWrenchFilter::FinishKistler(Wrench::Pointer \/* wrh *\/, ForcePlatform::Pointer \/* fp *\/, int \/* index *\/)\n {};\n};\n\n<|endoftext|>"} {"text":"<commit_before>\/***************************************************************************\n* Copyright © 2003 Unai Garro <ugarro@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\n#include \"ingredientmatcherdialog.h\"\n\n#include \"datablocks\/recipelist.h\"\n#include \"widgets\/ingredientlistview.h\"\n#include \"datablocks\/elementlist.h\"\n#include \"backends\/recipedb.h\"\n#include \"widgets\/krelistview.h\"\n#include \"widgets\/unitcombobox.h\"\n#include \"widgets\/fractioninput.h\"\n#include \"widgets\/amountunitinput.h\"\n#include \"datablocks\/mixednumber.h\"\n#include \"actionshandlers\/recipeactionshandler.h\"\n\n#include <q3header.h>\n#include <QPainter>\n#include <q3groupbox.h>\n#include <QPointer>\n\/\/Added by qt3to4:\n#include <QHBoxLayout>\n#include <Q3ValueList>\n#include <QLabel>\n#include <QVBoxLayout>\n\n#include <kapplication.h>\n#include <kcursor.h>\n#include <klocale.h>\n#include <knuminput.h>\n#include <kconfig.h>\n#include <kglobal.h>\n#include <kdebug.h>\n#include <kdialog.h>\n#include <kvbox.h>\n#include <KHBox>\n\n#include \"profiling.h\"\n\nIngredientMatcherDialog::IngredientMatcherDialog( QWidget *parent, RecipeDB *db ) : QSplitter( parent )\n{\n\t\/\/ Initialize internal variables\n\tdatabase = db;\n\n\t\/\/Design the dialog\n\n\tsetOrientation( Qt::Vertical );\n\tsetChildrenCollapsible( false );\n\t\n\tQWidget * upperBox = new QWidget( this );\n\n\t\/\/ Ingredient list\n\tQHBoxLayout *layout2 = new QHBoxLayout;\n\tlayout2->setObjectName( \"layout2\" );\n\n\tallIngListView = new KreListView( this, QString(), true, 0 );\n\tStdIngredientListView *list_view = new StdIngredientListView(allIngListView,database);\n\tlist_view->setSelectionMode( Q3ListView::Multi );\n\tallIngListView->setListView(list_view);\n\tlayout2->addWidget( allIngListView );\n\tallIngListView->setSizePolicy( QSizePolicy::Preferred, QSizePolicy::Preferred );\n\n\tQVBoxLayout *layout1 = new QVBoxLayout;\n\tlayout1->addStretch();\n\tlayout1->setObjectName( \"layout1\" );\n\n\taddButton = new KPushButton;\n\taddButton->setObjectName( \"addButton\" );\n\taddButton->setIcon( KIcon( \"arrow-right\" ) );\n\taddButton->setFixedSize( QSize( 32, 32 ) );\n\tlayout1->addWidget( addButton );\n\n\tremoveButton = new KPushButton;\n\tremoveButton->setObjectName( \"removeButton\" );\n\tremoveButton->setIcon( KIcon( \"arrow-left\" ) );\n\tremoveButton->setFixedSize( QSize( 32, 32 ) );\n\tlayout1->addWidget( removeButton );\n\tlayout1->addStretch();\n\tlayout2->addLayout( layout1 );\n\n\tingListView = new KreListView( this, QString(), true );\n\tingListView->listView() ->addColumn( i18nc( \"@title:column\", \"Ingredient (required?)\" ) );\n\tingListView->listView() ->addColumn( i18nc( \"@title:column\", \"Amount Available\" ) );\n\tlayout2->addWidget( ingListView );\n\tupperBox->setLayout( layout2 );\n\taddWidget( upperBox );\n\tingListView->setSizePolicy( QSizePolicy::Preferred, QSizePolicy::Preferred );\n\n\tKVBox * lowerBox = new KVBox( this );\n\n\t\/\/ Box to select allowed number of missing ingredients\n\tmissingBox = new KHBox( lowerBox );\n\tmissingNumberLabel = new QLabel( missingBox );\n\tmissingNumberLabel->setText( i18nc(\n\t\t\"@label:spinbox Number of missing ingredients allowed when doing a search by ingredients\",\n\t\t\"Missing ingredients allowed:\" ) );\n\tmissingNumberSpinBox = new KIntSpinBox( missingBox );\n\tmissingNumberSpinBox->setMinimum( -1 );\n\tmissingNumberSpinBox->setSpecialValueText( i18nc(\n\t\t\"@item Any amount of ingredients missing when doing a search by ingredients\", \"Any\" ) );\n\n\t\/\/ Found recipe list\n\trecipeListView = new KreListView( lowerBox, i18nc( \"@title\", \"Matching Recipes\" ), false, 1, missingBox );\n\trecipeListView->listView() ->setAllColumnsShowFocus( true );\n\n\trecipeListView->listView() ->addColumn( i18nc( \"@title:column Recipe Title\", \"Title\" ) );\n\n\tKConfigGroup config( KGlobal::config(), \"Advanced\" );\n\tbool show_id = config.readEntry( \"ShowID\", false );\n\trecipeListView->listView() ->addColumn( \"Id\" , show_id ? -1 : 0 );\n\n\trecipeListView->listView()->addColumn( i18nc( \"@title:column Missing ingredients in a search result\",\n\t\t\"Missing Ingredients\" ) );\n\n\trecipeListView->listView() ->setSorting( -1 );\n\trecipeListView->setSizePolicy( QSizePolicy::Preferred, QSizePolicy::Preferred );\n\n\tactionHandler = new RecipeActionsHandler( recipeListView->listView(), database );\n\n\tKHBox *buttonBox = new KHBox( lowerBox );\n\n\tokButton = new KPushButton( buttonBox );\n\tokButton->setIcon( KIcon( \"dialog-ok\" ) );\n\tokButton->setText( i18nc( \"@action:button\", \"Find matching recipes\" ) );\n\n\t\/\/buttonBox->layout()->addItem( new QSpacerItem( 10,10, QSizePolicy::MinimumExpanding, QSizePolicy::Fixed ) );\n\n\tclearButton = new KPushButton( buttonBox );\n\tclearButton->setIcon( KIcon( \"edit-clear\" ) );\n\tclearButton->setText( i18nc( \"@action:button Clear search criteria\", \"Clear\" ) );\n\n\taddWidget( lowerBox );\n\n\t\/\/ Connect signals & slots\n\tconnect ( okButton, SIGNAL( clicked() ), this, SLOT( findRecipes() ) );\n\tconnect ( clearButton, SIGNAL( clicked() ), recipeListView->listView(), SLOT( clear() ) );\n\tconnect ( clearButton, SIGNAL( clicked() ), this, SLOT( unselectIngredients() ) );\n\tconnect( recipeListView->listView(), SIGNAL( selectionChanged() ), this, SLOT( haveSelectedItems() ) );\n\tconnect ( actionHandler, SIGNAL( recipeSelected( int, int ) ), SIGNAL( recipeSelected( int, int ) ) );\n\tconnect( addButton, SIGNAL( clicked() ), this, SLOT( addIngredient() ) );\n\tconnect( removeButton, SIGNAL( clicked() ), this, SLOT( removeIngredient() ) );\n\tconnect( ingListView->listView(), SIGNAL( doubleClicked( Q3ListViewItem*, const QPoint &, int ) ), SLOT( itemRenamed( Q3ListViewItem*, const QPoint &, int ) ) );\n}\n\nIngredientMatcherDialog::~IngredientMatcherDialog()\n{\n}\n\nvoid IngredientMatcherDialog::itemRenamed( Q3ListViewItem* item, const QPoint &, int col )\n{\n\tif ( col == 1 ) {\n\t\tQPointer<KDialog> amountEditDialog = new KDialog(this);\n\t\tamountEditDialog->setCaption(i18nc(\"@title:window\", \"Enter amount\"));\n\t\tamountEditDialog->setButtons(KDialog::Cancel | KDialog::Ok);\n\t\tamountEditDialog->setDefaultButton(KDialog::Ok);\n\t\tamountEditDialog->setModal( false );\t\n\t\tQ3GroupBox *box = new Q3GroupBox( 1, Qt::Horizontal, i18nc(\"@title:group\", \"Amount\"), amountEditDialog );\n\t\tAmountUnitInput *amountEdit = new AmountUnitInput( box, database );\n\t\t\/\/ Set the values from the item\n\t\tif ( !item->text(1).isEmpty() ) {\n\t\t\tamountEdit->setAmount( MixedNumber::fromString(item->text(2)) );\n\t\t\tUnit u;\n\t\t\tu.setId(item->text(3).toInt());\n\t\t\tamountEdit->setUnit( u );\n\t\t} else {\n\t\t\tamountEdit->setAmount( MixedNumber(-1) );\n\t\t\tUnit u;\n\t\t\tu.setId(-1);\n\t\t\tamountEdit->setUnit( u );\n\t\t}\n\n\t\tamountEditDialog->setMainWidget(box);\n\t\tamountEditDialog->adjustSize();\n\t\tamountEditDialog->resize( 400, amountEditDialog->size().height() );\n\t\tamountEditDialog->setFixedHeight( amountEditDialog->size().height() );\n\n\t\tif ( amountEditDialog->exec() == QDialog::Accepted ) {\n\t\t\tMixedNumber amount = amountEdit->amount();\n\t\t\tUnit unit = amountEdit->unit();\n\n\t\t\tif ( amount.toDouble() <= 1e-5 ) {\n\t\t\t\tamount = MixedNumber(-1);\n\t\t\t\tunit.setId(-1);\n\n\t\t\t\titem->setText(1,QString());\n\t\t\t} else {\n\t\t\t\titem->setText(1,amount.toString()+' '+unit.determineName(amount.toDouble(), \/*useAbbrev=*\/false));\n\t\t\t}\n\n\t\t\titem->setText(2,amount.toString());\n\t\t\titem->setText(3,QString::number(unit.id()));\n\n\t\t\tIngredientList::iterator ing_it = m_item_ing_map[item];\n\t\t\t(*ing_it).amount = amount.toDouble();\n\t\t\t(*ing_it).units = unit;\n\t\t}\n\n\t\tdelete amountEditDialog;\n\t}\n}\n\nvoid IngredientMatcherDialog::addIngredient()\n{\n\tQList<Q3ListViewItem *> items = allIngListView->listView()->selectedItems();\n\tif ( !items.isEmpty() ) {\n\t\tfor (int i = 0; i < items.size(); ++i) {\n\t\t\tbool dup = false;\n\t\t\tfor ( Q3ListViewItem *exists_it = ingListView->listView()->firstChild(); exists_it; exists_it = exists_it->nextSibling() ) {\n\t\t\t\tif ( exists_it->text( 0 ) == items[i]->text( 0 ) ) {\n\t\t\t\t\tdup = true;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\n\t\t\tif ( !dup ) {\n\t\t\t\tQ3ListViewItem * new_item = new Q3CheckListItem( ingListView->listView(), items[i]->text( 0 ), Q3CheckListItem::CheckBox );\n\n\t\t\t\tingListView->listView() ->setSelected( new_item, true );\n\t\t\t\tingListView->listView() ->ensureItemVisible( new_item );\n\t\t\t\tallIngListView->listView() ->setSelected( items[i], false );\n\n\t\t\t\tm_ingredientList.append( Ingredient( items[i]->text( 0 ), 0, Unit(), -1, items[i]->text( 1 ).toInt() ) );\n\t\t\t\tm_item_ing_map.insert( new_item, m_ingredientList.end()-- );\n\t\t\t}\n\t\t}\n\t}\n}\n\nvoid IngredientMatcherDialog::removeIngredient()\n{\n\tQ3ListViewItem * item = ingListView->listView() ->selectedItem();\n\tif ( item ) {\n\t\tfor ( IngredientList::iterator it = m_ingredientList.begin(); it != m_ingredientList.end(); ++it ) {\n\t\t\tif ( *m_item_ing_map.find( item ) == it ) {\n\t\t\t\tm_ingredientList.remove( it );\n\t\t\t\tm_item_ing_map.remove( item );\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t\tdelete item;\n\t}\n}\n\nvoid IngredientMatcherDialog::unselectIngredients()\n{\n\tingListView->listView()->clear();\n\tfor ( Q3ListViewItem *it = allIngListView->listView()->firstChild(); it; it = it->nextSibling() )\n\t\tallIngListView->listView()->setSelected(it,false);\n\tm_ingredientList.clear();\n\tm_item_ing_map.clear();\n}\n\nvoid IngredientMatcherDialog::findRecipes( void )\n{\n\tKApplication::setOverrideCursor( Qt::WaitCursor );\n\n\tSTART_TIMER(\"Ingredient Matcher: loading database data\");\n\n\tRecipeList rlist;\n\tdatabase->loadRecipes( &rlist, RecipeDB::Title | RecipeDB::NamesOnly | RecipeDB::Ingredients | RecipeDB::IngredientAmounts );\n\n\tEND_TIMER();\n\tSTART_TIMER(\"Ingredient Matcher: analyzing data for matching recipes\");\n\n\t\/\/ Clear the list\n\trecipeListView->listView() ->clear();\n\n\t\/\/ Now show the recipes with ingredients that are contained in the previous set\n\t\/\/ of ingredients\n\tRecipeList incompleteRecipes;\n\tQList <int> missingNumbers;\n\tQ3ValueList <IngredientList> missingIngredients;\n\n\tRecipeList::Iterator it;\n\tfor ( it = rlist.begin();it != rlist.end();++it ) {\n\t\tIngredientList il = ( *it ).ingList;\n\t\tif ( il.isEmpty() )\n\t\t\tcontinue;\n\n\t\tIngredientList missing;\n\t\tif ( m_ingredientList.containsSubSet( il, missing, true, database ) ) {\n\t\t\tnew CustomRecipeListItem( recipeListView->listView(), *it );\n\t\t}\n\t\telse {\n\t\t\tincompleteRecipes.append( *it );\n\t\t\tmissingIngredients.append( missing );\n\t\t\tmissingNumbers.append( missing.count() );\n\t\t}\n\t}\n\tEND_TIMER();\n\n\t\/\/Check if the user wants to show missing ingredients\n\n\tif ( missingNumberSpinBox->value() == 0 ) {\n\t\tKApplication::restoreOverrideCursor();\n\t\treturn ;\n\t} \/\/\"None\"\n\n\n\n\tSTART_TIMER(\"Ingredient Matcher: searching for and displaying partial matches\");\n\n\tIngredientList requiredIngredients;\n\tfor ( Q3ListViewItem *it = ingListView->listView()->firstChild(); it; it = it->nextSibling() ) {\n\t\tif ( ((Q3CheckListItem*)it)->isOn() )\n\t\t\trequiredIngredients << *m_item_ing_map[it];\n\t}\n\n\t\/\/ Classify recipes with missing ingredients in different lists by amount\n\tQList<int>::Iterator nit;\n\tQ3ValueList<IngredientList>::Iterator ilit;\n\tint missingNoAllowed = missingNumberSpinBox->value();\n\n\tif ( missingNoAllowed == -1 ) \/\/ \"Any\"\n\t{\n\t\tfor ( nit = missingNumbers.begin();nit != missingNumbers.end();++nit )\n\t\t\tif ( ( *nit ) > missingNoAllowed )\n\t\t\t\tmissingNoAllowed = ( *nit );\n\t}\n\n\n\tfor ( int missingNo = 1; missingNo <= missingNoAllowed; missingNo++ ) {\n\t\tnit = missingNumbers.begin();\n\t\tilit = missingIngredients.begin();\n\n\t\tbool titleShownYet = false;\n\n\t\tfor ( it = incompleteRecipes.begin();it != incompleteRecipes.end();++it, ++nit, ++ilit ) {\n\t\t\tif ( !( *it ).ingList.containsAny( m_ingredientList ) )\n\t\t\t\tcontinue;\n\n\t\t\tif ( !( *it ).ingList.containsSubSet( requiredIngredients ) )\n\t\t\t\tcontinue;\n\n\t\t\tif ( ( *nit ) == missingNo ) {\n\t\t\t\tif ( !titleShownYet ) {\n\t\t\t\t\tnew SectionItem( recipeListView->listView(), i18ncp( \"@label:textbox\", \"You are missing 1 ingredient for:\", \"You are missing %1 ingredients for:\", missingNo ) );\n\t\t\t\t\ttitleShownYet = true;\n\t\t\t\t}\n\t\t\t\tnew CustomRecipeListItem( recipeListView->listView(), *it, *ilit );\n\t\t\t}\n\t\t}\n\t}\n\tEND_TIMER();\n\n\tKApplication::restoreOverrideCursor();\n}\n\nvoid IngredientMatcherDialog::reload( ReloadFlags flag )\n{\n\t( ( StdIngredientListView* ) allIngListView->listView() ) ->reload(flag);\n}\n\nRecipeActionsHandler* IngredientMatcherDialog::getActionsHandler() const\n{\n\treturn actionHandler;\n}\n\nvoid IngredientMatcherDialog::addAction( KAction * action )\n{\n\tactionHandler->addRecipeAction( action );\n}\n\nvoid IngredientMatcherDialog::haveSelectedItems()\n{\n\tQList<int> list = actionHandler->recipeIDs();\n\tif ( list.isEmpty() )\n\t\temit recipeSelected( false );\n\telse\n\t\temit recipeSelected( true );\n}\n\nvoid SectionItem::paintCell ( QPainter * p, const QColorGroup & \/*cg*\/, int column, int width, int \/*align*\/ )\n{\n\t\/\/ Draw the section's deco\n\tp->setPen( KGlobalSettings::activeTitleColor() );\n\tp->setBrush( KGlobalSettings::activeTitleColor() );\n\tp->drawRect( 0, 0, width, height() );\n\n\t\/\/ Draw the section's text\n\tif ( column == 0 ) {\n\t\tQFont titleFont = KGlobalSettings::windowTitleFont ();\n\t\tp->setFont( titleFont );\n\n\t\tp->setPen( KGlobalSettings::activeTextColor() );\n\t\tp->drawText( 0, 0, width, height(), Qt::AlignLeft | Qt::AlignVCenter, mText );\n\t}\n}\n\n#include \"ingredientmatcherdialog.moc\"\n<commit_msg>Fix iterator use<commit_after>\/***************************************************************************\n* Copyright © 2003 Unai Garro <ugarro@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\n#include \"ingredientmatcherdialog.h\"\n\n#include \"datablocks\/recipelist.h\"\n#include \"widgets\/ingredientlistview.h\"\n#include \"datablocks\/elementlist.h\"\n#include \"backends\/recipedb.h\"\n#include \"widgets\/krelistview.h\"\n#include \"widgets\/unitcombobox.h\"\n#include \"widgets\/fractioninput.h\"\n#include \"widgets\/amountunitinput.h\"\n#include \"datablocks\/mixednumber.h\"\n#include \"actionshandlers\/recipeactionshandler.h\"\n\n#include <q3header.h>\n#include <QPainter>\n#include <q3groupbox.h>\n#include <QPointer>\n\/\/Added by qt3to4:\n#include <QHBoxLayout>\n#include <Q3ValueList>\n#include <QLabel>\n#include <QVBoxLayout>\n\n#include <kapplication.h>\n#include <kcursor.h>\n#include <klocale.h>\n#include <knuminput.h>\n#include <kconfig.h>\n#include <kglobal.h>\n#include <kdebug.h>\n#include <kdialog.h>\n#include <kvbox.h>\n#include <KHBox>\n\n#include \"profiling.h\"\n\nIngredientMatcherDialog::IngredientMatcherDialog( QWidget *parent, RecipeDB *db ) : QSplitter( parent )\n{\n\t\/\/ Initialize internal variables\n\tdatabase = db;\n\n\t\/\/Design the dialog\n\n\tsetOrientation( Qt::Vertical );\n\tsetChildrenCollapsible( false );\n\t\n\tQWidget * upperBox = new QWidget( this );\n\n\t\/\/ Ingredient list\n\tQHBoxLayout *layout2 = new QHBoxLayout;\n\tlayout2->setObjectName( \"layout2\" );\n\n\tallIngListView = new KreListView( this, QString(), true, 0 );\n\tStdIngredientListView *list_view = new StdIngredientListView(allIngListView,database);\n\tlist_view->setSelectionMode( Q3ListView::Multi );\n\tallIngListView->setListView(list_view);\n\tlayout2->addWidget( allIngListView );\n\tallIngListView->setSizePolicy( QSizePolicy::Preferred, QSizePolicy::Preferred );\n\n\tQVBoxLayout *layout1 = new QVBoxLayout;\n\tlayout1->addStretch();\n\tlayout1->setObjectName( \"layout1\" );\n\n\taddButton = new KPushButton;\n\taddButton->setObjectName( \"addButton\" );\n\taddButton->setIcon( KIcon( \"arrow-right\" ) );\n\taddButton->setFixedSize( QSize( 32, 32 ) );\n\tlayout1->addWidget( addButton );\n\n\tremoveButton = new KPushButton;\n\tremoveButton->setObjectName( \"removeButton\" );\n\tremoveButton->setIcon( KIcon( \"arrow-left\" ) );\n\tremoveButton->setFixedSize( QSize( 32, 32 ) );\n\tlayout1->addWidget( removeButton );\n\tlayout1->addStretch();\n\tlayout2->addLayout( layout1 );\n\n\tingListView = new KreListView( this, QString(), true );\n\tingListView->listView() ->addColumn( i18nc( \"@title:column\", \"Ingredient (required?)\" ) );\n\tingListView->listView() ->addColumn( i18nc( \"@title:column\", \"Amount Available\" ) );\n\tlayout2->addWidget( ingListView );\n\tupperBox->setLayout( layout2 );\n\taddWidget( upperBox );\n\tingListView->setSizePolicy( QSizePolicy::Preferred, QSizePolicy::Preferred );\n\n\tKVBox * lowerBox = new KVBox( this );\n\n\t\/\/ Box to select allowed number of missing ingredients\n\tmissingBox = new KHBox( lowerBox );\n\tmissingNumberLabel = new QLabel( missingBox );\n\tmissingNumberLabel->setText( i18nc(\n\t\t\"@label:spinbox Number of missing ingredients allowed when doing a search by ingredients\",\n\t\t\"Missing ingredients allowed:\" ) );\n\tmissingNumberSpinBox = new KIntSpinBox( missingBox );\n\tmissingNumberSpinBox->setMinimum( -1 );\n\tmissingNumberSpinBox->setSpecialValueText( i18nc(\n\t\t\"@item Any amount of ingredients missing when doing a search by ingredients\", \"Any\" ) );\n\n\t\/\/ Found recipe list\n\trecipeListView = new KreListView( lowerBox, i18nc( \"@title\", \"Matching Recipes\" ), false, 1, missingBox );\n\trecipeListView->listView() ->setAllColumnsShowFocus( true );\n\n\trecipeListView->listView() ->addColumn( i18nc( \"@title:column Recipe Title\", \"Title\" ) );\n\n\tKConfigGroup config( KGlobal::config(), \"Advanced\" );\n\tbool show_id = config.readEntry( \"ShowID\", false );\n\trecipeListView->listView() ->addColumn( \"Id\" , show_id ? -1 : 0 );\n\n\trecipeListView->listView()->addColumn( i18nc( \"@title:column Missing ingredients in a search result\",\n\t\t\"Missing Ingredients\" ) );\n\n\trecipeListView->listView() ->setSorting( -1 );\n\trecipeListView->setSizePolicy( QSizePolicy::Preferred, QSizePolicy::Preferred );\n\n\tactionHandler = new RecipeActionsHandler( recipeListView->listView(), database );\n\n\tKHBox *buttonBox = new KHBox( lowerBox );\n\n\tokButton = new KPushButton( buttonBox );\n\tokButton->setIcon( KIcon( \"dialog-ok\" ) );\n\tokButton->setText( i18nc( \"@action:button\", \"Find matching recipes\" ) );\n\n\t\/\/buttonBox->layout()->addItem( new QSpacerItem( 10,10, QSizePolicy::MinimumExpanding, QSizePolicy::Fixed ) );\n\n\tclearButton = new KPushButton( buttonBox );\n\tclearButton->setIcon( KIcon( \"edit-clear\" ) );\n\tclearButton->setText( i18nc( \"@action:button Clear search criteria\", \"Clear\" ) );\n\n\taddWidget( lowerBox );\n\n\t\/\/ Connect signals & slots\n\tconnect ( okButton, SIGNAL( clicked() ), this, SLOT( findRecipes() ) );\n\tconnect ( clearButton, SIGNAL( clicked() ), recipeListView->listView(), SLOT( clear() ) );\n\tconnect ( clearButton, SIGNAL( clicked() ), this, SLOT( unselectIngredients() ) );\n\tconnect( recipeListView->listView(), SIGNAL( selectionChanged() ), this, SLOT( haveSelectedItems() ) );\n\tconnect ( actionHandler, SIGNAL( recipeSelected( int, int ) ), SIGNAL( recipeSelected( int, int ) ) );\n\tconnect( addButton, SIGNAL( clicked() ), this, SLOT( addIngredient() ) );\n\tconnect( removeButton, SIGNAL( clicked() ), this, SLOT( removeIngredient() ) );\n\tconnect( ingListView->listView(), SIGNAL( doubleClicked( Q3ListViewItem*, const QPoint &, int ) ), SLOT( itemRenamed( Q3ListViewItem*, const QPoint &, int ) ) );\n}\n\nIngredientMatcherDialog::~IngredientMatcherDialog()\n{\n}\n\nvoid IngredientMatcherDialog::itemRenamed( Q3ListViewItem* item, const QPoint &, int col )\n{\n\tif ( col == 1 ) {\n\t\tQPointer<KDialog> amountEditDialog = new KDialog(this);\n\t\tamountEditDialog->setCaption(i18nc(\"@title:window\", \"Enter amount\"));\n\t\tamountEditDialog->setButtons(KDialog::Cancel | KDialog::Ok);\n\t\tamountEditDialog->setDefaultButton(KDialog::Ok);\n\t\tamountEditDialog->setModal( false );\t\n\t\tQ3GroupBox *box = new Q3GroupBox( 1, Qt::Horizontal, i18nc(\"@title:group\", \"Amount\"), amountEditDialog );\n\t\tAmountUnitInput *amountEdit = new AmountUnitInput( box, database );\n\t\t\/\/ Set the values from the item\n\t\tif ( !item->text(1).isEmpty() ) {\n\t\t\tamountEdit->setAmount( MixedNumber::fromString(item->text(2)) );\n\t\t\tUnit u;\n\t\t\tu.setId(item->text(3).toInt());\n\t\t\tamountEdit->setUnit( u );\n\t\t} else {\n\t\t\tamountEdit->setAmount( MixedNumber(-1) );\n\t\t\tUnit u;\n\t\t\tu.setId(-1);\n\t\t\tamountEdit->setUnit( u );\n\t\t}\n\n\t\tamountEditDialog->setMainWidget(box);\n\t\tamountEditDialog->adjustSize();\n\t\tamountEditDialog->resize( 400, amountEditDialog->size().height() );\n\t\tamountEditDialog->setFixedHeight( amountEditDialog->size().height() );\n\n\t\tif ( amountEditDialog->exec() == QDialog::Accepted ) {\n\t\t\tMixedNumber amount = amountEdit->amount();\n\t\t\tUnit unit = amountEdit->unit();\n\n\t\t\tif ( amount.toDouble() <= 1e-5 ) {\n\t\t\t\tamount = MixedNumber(-1);\n\t\t\t\tunit.setId(-1);\n\n\t\t\t\titem->setText(1,QString());\n\t\t\t} else {\n\t\t\t\titem->setText(1,amount.toString()+' '+unit.determineName(amount.toDouble(), \/*useAbbrev=*\/false));\n\t\t\t}\n\n\t\t\titem->setText(2,amount.toString());\n\t\t\titem->setText(3,QString::number(unit.id()));\n\n\t\t\tIngredientList::iterator ing_it = m_item_ing_map[item];\n\t\t\t(*ing_it).amount = amount.toDouble();\n\t\t\t(*ing_it).units = unit;\n\t\t}\n\n\t\tdelete amountEditDialog;\n\t}\n}\n\nvoid IngredientMatcherDialog::addIngredient()\n{\n\tQList<Q3ListViewItem *> items = allIngListView->listView()->selectedItems();\n\tif ( !items.isEmpty() ) {\n\t\tfor (int i = 0; i < items.size(); ++i) {\n\t\t\tbool dup = false;\n\t\t\tfor ( Q3ListViewItem *exists_it = ingListView->listView()->firstChild(); exists_it; exists_it = exists_it->nextSibling() ) {\n\t\t\t\tif ( exists_it->text( 0 ) == items[i]->text( 0 ) ) {\n\t\t\t\t\tdup = true;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\n\t\t\tif ( !dup ) {\n\t\t\t\tQ3ListViewItem * new_item = new Q3CheckListItem( ingListView->listView(), items[i]->text( 0 ), Q3CheckListItem::CheckBox );\n\n\t\t\t\tingListView->listView() ->setSelected( new_item, true );\n\t\t\t\tingListView->listView() ->ensureItemVisible( new_item );\n\t\t\t\tallIngListView->listView() ->setSelected( items[i], false );\n\n\t\t\t\tIngredientList::iterator it = m_ingredientList.append( Ingredient( items[i]->text( 0 ), 0, Unit(), -1, items[i]->text( 1 ).toInt() ) );\n\t\t\t\tm_item_ing_map.insert( new_item, it );\n\t\t\t}\n\t\t}\n\t}\n}\n\nvoid IngredientMatcherDialog::removeIngredient()\n{\n\tQ3ListViewItem * item = ingListView->listView() ->selectedItem();\n\tif ( item ) {\n\t\tfor ( IngredientList::iterator it = m_ingredientList.begin(); it != m_ingredientList.end(); ++it ) {\n\t\t\tif ( *m_item_ing_map.find( item ) == it ) {\n\t\t\t\tm_ingredientList.remove( it );\n\t\t\t\tm_item_ing_map.remove( item );\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t\tdelete item;\n\t}\n}\n\nvoid IngredientMatcherDialog::unselectIngredients()\n{\n\tingListView->listView()->clear();\n\tfor ( Q3ListViewItem *it = allIngListView->listView()->firstChild(); it; it = it->nextSibling() )\n\t\tallIngListView->listView()->setSelected(it,false);\n\tm_ingredientList.clear();\n\tm_item_ing_map.clear();\n}\n\nvoid IngredientMatcherDialog::findRecipes( void )\n{\n\tKApplication::setOverrideCursor( Qt::WaitCursor );\n\n\tSTART_TIMER(\"Ingredient Matcher: loading database data\");\n\n\tRecipeList rlist;\n\tdatabase->loadRecipes( &rlist, RecipeDB::Title | RecipeDB::NamesOnly | RecipeDB::Ingredients | RecipeDB::IngredientAmounts );\n\n\tEND_TIMER();\n\tSTART_TIMER(\"Ingredient Matcher: analyzing data for matching recipes\");\n\n\t\/\/ Clear the list\n\trecipeListView->listView() ->clear();\n\n\t\/\/ Now show the recipes with ingredients that are contained in the previous set\n\t\/\/ of ingredients\n\tRecipeList incompleteRecipes;\n\tQList <int> missingNumbers;\n\tQ3ValueList <IngredientList> missingIngredients;\n\n\tRecipeList::Iterator it;\n\tfor ( it = rlist.begin();it != rlist.end();++it ) {\n\t\tIngredientList il = ( *it ).ingList;\n\t\tif ( il.isEmpty() )\n\t\t\tcontinue;\n\n\t\tIngredientList missing;\n\t\tif ( m_ingredientList.containsSubSet( il, missing, true, database ) ) {\n\t\t\tnew CustomRecipeListItem( recipeListView->listView(), *it );\n\t\t}\n\t\telse {\n\t\t\tincompleteRecipes.append( *it );\n\t\t\tmissingIngredients.append( missing );\n\t\t\tmissingNumbers.append( missing.count() );\n\t\t}\n\t}\n\tEND_TIMER();\n\n\t\/\/Check if the user wants to show missing ingredients\n\n\tif ( missingNumberSpinBox->value() == 0 ) {\n\t\tKApplication::restoreOverrideCursor();\n\t\treturn ;\n\t} \/\/\"None\"\n\n\n\n\tSTART_TIMER(\"Ingredient Matcher: searching for and displaying partial matches\");\n\n\tIngredientList requiredIngredients;\n\tfor ( Q3ListViewItem *it = ingListView->listView()->firstChild(); it; it = it->nextSibling() ) {\n\t\tif ( ((Q3CheckListItem*)it)->isOn() )\n\t\t\trequiredIngredients << *m_item_ing_map[it];\n\t}\n\n\t\/\/ Classify recipes with missing ingredients in different lists by amount\n\tQList<int>::Iterator nit;\n\tQ3ValueList<IngredientList>::Iterator ilit;\n\tint missingNoAllowed = missingNumberSpinBox->value();\n\n\tif ( missingNoAllowed == -1 ) \/\/ \"Any\"\n\t{\n\t\tfor ( nit = missingNumbers.begin();nit != missingNumbers.end();++nit )\n\t\t\tif ( ( *nit ) > missingNoAllowed )\n\t\t\t\tmissingNoAllowed = ( *nit );\n\t}\n\n\n\tfor ( int missingNo = 1; missingNo <= missingNoAllowed; missingNo++ ) {\n\t\tnit = missingNumbers.begin();\n\t\tilit = missingIngredients.begin();\n\n\t\tbool titleShownYet = false;\n\n\t\tfor ( it = incompleteRecipes.begin();it != incompleteRecipes.end();++it, ++nit, ++ilit ) {\n\t\t\tif ( !( *it ).ingList.containsAny( m_ingredientList ) )\n\t\t\t\tcontinue;\n\n\t\t\tif ( !( *it ).ingList.containsSubSet( requiredIngredients ) )\n\t\t\t\tcontinue;\n\n\t\t\tif ( ( *nit ) == missingNo ) {\n\t\t\t\tif ( !titleShownYet ) {\n\t\t\t\t\tnew SectionItem( recipeListView->listView(), i18ncp( \"@label:textbox\", \"You are missing 1 ingredient for:\", \"You are missing %1 ingredients for:\", missingNo ) );\n\t\t\t\t\ttitleShownYet = true;\n\t\t\t\t}\n\t\t\t\tnew CustomRecipeListItem( recipeListView->listView(), *it, *ilit );\n\t\t\t}\n\t\t}\n\t}\n\tEND_TIMER();\n\n\tKApplication::restoreOverrideCursor();\n}\n\nvoid IngredientMatcherDialog::reload( ReloadFlags flag )\n{\n\t( ( StdIngredientListView* ) allIngListView->listView() ) ->reload(flag);\n}\n\nRecipeActionsHandler* IngredientMatcherDialog::getActionsHandler() const\n{\n\treturn actionHandler;\n}\n\nvoid IngredientMatcherDialog::addAction( KAction * action )\n{\n\tactionHandler->addRecipeAction( action );\n}\n\nvoid IngredientMatcherDialog::haveSelectedItems()\n{\n\tQList<int> list = actionHandler->recipeIDs();\n\tif ( list.isEmpty() )\n\t\temit recipeSelected( false );\n\telse\n\t\temit recipeSelected( true );\n}\n\nvoid SectionItem::paintCell ( QPainter * p, const QColorGroup & \/*cg*\/, int column, int width, int \/*align*\/ )\n{\n\t\/\/ Draw the section's deco\n\tp->setPen( KGlobalSettings::activeTitleColor() );\n\tp->setBrush( KGlobalSettings::activeTitleColor() );\n\tp->drawRect( 0, 0, width, height() );\n\n\t\/\/ Draw the section's text\n\tif ( column == 0 ) {\n\t\tQFont titleFont = KGlobalSettings::windowTitleFont ();\n\t\tp->setFont( titleFont );\n\n\t\tp->setPen( KGlobalSettings::activeTextColor() );\n\t\tp->drawText( 0, 0, width, height(), Qt::AlignLeft | Qt::AlignVCenter, mText );\n\t}\n}\n\n#include \"ingredientmatcherdialog.moc\"\n<|endoftext|>"} {"text":"<commit_before>\/***************************************************************************\n * Copyright (C) 2003 by *\n * Unai Garro (ugarro@users.sourceforge.net) *\n * *\n * This program is free software; you can redistribute it and\/or modify *\n * it under the terms of the GNU General Public License as published by *\n * the Free Software Foundation; either version 2 of the License, or *\n * (at your option) any later version. *\n ***************************************************************************\/\n\n#include \"ingredientmatcherdialog.h\"\n\n#include \"datablocks\/recipelist.h\"\n#include \"elementlist.h\"\n#include \"DBBackend\/recipedb.h\"\n#include \"widgets\/krelistview.h\"\n\n#include <qhbox.h>\n#include <kiconloader.h>\n#include <klocale.h>\n\nIngredientMatcherDialog::IngredientMatcherDialog(QWidget *parent,RecipeDB *db):QVBox(parent)\n{\n\/\/ Initialize internal variables\ndatabase=db;\n\n\/\/Design the dialog\nsetSpacing(10);\n\ningredientListView=new KreListView(this,i18n(\"Ingredients\"));\ningredientListView->listView()->setAllColumnsShowFocus(true);\ningredientListView->listView()->addColumn(\"*\");\ningredientListView->listView()->addColumn(i18n(\"Ingredient\"));\n\nrecipeListView=new KreListView(this,i18n(\"Matching Recipes\"));\nrecipeListView->listView()->setAllColumnsShowFocus(true);\nrecipeListView->listView()->addColumn(i18n(\"Title\"));\nrecipeListView->listView()->addColumn(i18n(\"Missing Ingredients\"));\n\nKIconLoader il;\nQHBox *buttonBox=new QHBox(this);\n\nokButton=new QPushButton(buttonBox);\nokButton->setIconSet(il.loadIconSet(\"button_ok\", KIcon::Small));\nokButton->setText(i18n(\"Find matching recipes\"));\n\nclearButton=new QPushButton(buttonBox);\nclearButton->setIconSet(il.loadIconSet(\"editclear\", KIcon::Small));\nclearButton->setText(i18n(\"Clear recipe list\"));\n\n\/\/ Load the data\nreloadIngredients();\n\n\/\/ Connect signals & slots\nconnect (okButton,SIGNAL(clicked()), this,SLOT(findRecipes()));\nconnect (clearButton,SIGNAL(clicked()),recipeListView->listView(),SLOT(clear()));\n\n}\n\nIngredientMatcherDialog::~IngredientMatcherDialog()\n{\n\n}\n\nvoid IngredientMatcherDialog::findRecipes(void)\n{\nRecipeList rlist;\nIngredientList ilist;\ndatabase->loadRecipeDetails(&rlist,true,false);\n\n\nQListViewItem *qlv_it;\n\n\/\/ First make a list of the ingredients that we have\nfor (qlv_it=ingredientListView->listView()->firstChild();qlv_it;qlv_it=qlv_it->nextSibling())\n\t{\n\tIngredientListItem *il_it=(IngredientListItem*) qlv_it;\n\tif (il_it->isOn())\n\t\t{\n\t\tIngredient ing; ing.name=il_it->name(); ing.ingredientID=il_it->id();\n\t\tilist.append(ing);\n\t\t}\n\t}\n\n\/\/ Now show the recipes with ingredients that are contained in the previous set\n\/\/ of ingredients\nRecipeList::Iterator it;\nfor (it=rlist.begin();it!=rlist.end();++it)\n\t{\n\tIngredientList il=(*it).ingList;\n\t\n\tif (ilist.containsSubSet(il))\n\t\t{\n\t\tnew RecipeListItem(recipeListView->listView(),*it);\n\t\t}\n\t\n\t}\n}\n\nvoid IngredientMatcherDialog::reloadIngredients(void)\n{\n\ningredientListView->listView()->clear();\nElementList ingredientList;\ndatabase->loadIngredients(&ingredientList);\n\nElementList::Iterator it;\n\nfor (it=ingredientList.begin();it!=ingredientList.end();++it)\n\t{\n\tElement ingredient=*it;\n\tnew IngredientListItem(ingredientListView->listView(),ingredient);\n\t}\n}\n<commit_msg>Take advantage of the new filter function in KreListView<commit_after>\/***************************************************************************\n * Copyright (C) 2003 by *\n * Unai Garro (ugarro@users.sourceforge.net) *\n * *\n * This program is free software; you can redistribute it and\/or modify *\n * it under the terms of the GNU General Public License as published by *\n * the Free Software Foundation; either version 2 of the License, or *\n * (at your option) any later version. *\n ***************************************************************************\/\n\n#include \"ingredientmatcherdialog.h\"\n\n#include \"datablocks\/recipelist.h\"\n#include \"elementlist.h\"\n#include \"DBBackend\/recipedb.h\"\n#include \"widgets\/krelistview.h\"\n\n#include <qhbox.h>\n#include <kiconloader.h>\n#include <klocale.h>\n\nIngredientMatcherDialog::IngredientMatcherDialog(QWidget *parent,RecipeDB *db):QVBox(parent)\n{\n\t\/\/ Initialize internal variables\n\tdatabase=db;\n\t\n\t\/\/Design the dialog\n\tsetSpacing(10);\n\t\n\tingredientListView=new KreListView(this,i18n(\"Ingredients\"),true,1);\n\tingredientListView->listView()->setAllColumnsShowFocus(true);\n\tingredientListView->listView()->addColumn(\"*\");\n\tingredientListView->listView()->addColumn(i18n(\"Ingredient\"));\n\t\n\trecipeListView=new KreListView(this,i18n(\"Matching Recipes\"));\n\trecipeListView->listView()->setAllColumnsShowFocus(true);\n\trecipeListView->listView()->addColumn(i18n(\"Title\"));\n\trecipeListView->listView()->addColumn(i18n(\"Missing Ingredients\"));\n\t\n\tKIconLoader il;\n\tQHBox *buttonBox=new QHBox(this);\n\t\n\tokButton=new QPushButton(buttonBox);\n\tokButton->setIconSet(il.loadIconSet(\"button_ok\", KIcon::Small));\n\tokButton->setText(i18n(\"Find matching recipes\"));\n\t\n\tclearButton=new QPushButton(buttonBox);\n\tclearButton->setIconSet(il.loadIconSet(\"editclear\", KIcon::Small));\n\tclearButton->setText(i18n(\"Clear recipe list\"));\n\t\n\t\/\/ Load the data\n\treloadIngredients();\n\t\n\t\/\/ Connect signals & slots\n\tconnect (okButton,SIGNAL(clicked()), this,SLOT(findRecipes()));\n\tconnect (clearButton,SIGNAL(clicked()),recipeListView->listView(),SLOT(clear()));\n\n}\n\nIngredientMatcherDialog::~IngredientMatcherDialog()\n{\n\n}\n\n\n\nvoid IngredientMatcherDialog::findRecipes(void)\n{\n\tRecipeList rlist;\n\tIngredientList ilist;\n\tdatabase->loadRecipeDetails(&rlist,true,false);\n\t\n\t\n\tQListViewItem *qlv_it;\n\t\n\t\/\/ First make a list of the ingredients that we have\n\tfor (qlv_it=ingredientListView->listView()->firstChild();qlv_it;qlv_it=qlv_it->nextSibling())\n\t\t{\n\t\tIngredientListItem *il_it=(IngredientListItem*) qlv_it;\n\t\tif (il_it->isOn())\n\t\t\t{\n\t\t\tIngredient ing; ing.name=il_it->name(); ing.ingredientID=il_it->id();\n\t\t\tilist.append(ing);\n\t\t\t}\n\t\t}\n\t\n\t\/\/ Now show the recipes with ingredients that are contained in the previous set\n\t\/\/ of ingredients\n\tRecipeList::Iterator it;\n\tfor (it=rlist.begin();it!=rlist.end();++it)\n\t\t{\n\t\tIngredientList il=(*it).ingList;\n\t\t\n\t\tif (ilist.containsSubSet(il))\n\t\t\t{\n\t\t\tnew RecipeListItem(recipeListView->listView(),*it);\n\t\t\t}\n\t\t\n\t\t}\n}\n\nvoid IngredientMatcherDialog::reloadIngredients(void)\n{\n\n\tingredientListView->listView()->clear();\n\tElementList ingredientList;\n\tdatabase->loadIngredients(&ingredientList);\n\t\n\tElementList::Iterator it;\n\t\n\tfor (it=ingredientList.begin();it!=ingredientList.end();++it)\n\t\t{\n\t\tElement ingredient=*it;\n\t\tnew IngredientListItem(ingredientListView->listView(),ingredient);\n\t\t}\n}\n<|endoftext|>"} {"text":"<commit_before>#include \"staticfunctions.h\"\n#include <QRegExp>\n\nvoid\nStaticFunctions::initQColorDialog()\n{\n int i;\n \n int nNodes = 16;\n int Nodes[] = { 0, 4, 8, 12, 16, 20, 23, 24, 28, 32, 36, 40, 44, 45, 46, 47 };\n int RED[] = { 255, 255, 0, 0, 0, 255, 255, 255, 255, 128, 255, 128, 128, 0, 128, 255 };\n int GREEN[]={ 0, 255, 255, 255, 0, 0, 0, 255, 128, 255, 128, 255, 128, 0, 128, 255 };\n int BLUE[] ={ 0, 0, 0, 255, 255, 255, 64, 128, 255, 255, 128, 128, 255, 0, 128, 255 };\n\n int ai;\n for(i = 0; i < 48; i++)\n {\n ai = i;\n if (ai >= 8 && ai < 16) ai = 15 - ai%8;\n else if (ai >= 32 && ai < 40) ai = 39 - ai%32;\n \n int n, r, g, b;\n for(n=nNodes-1; n>=0; n--)\n\tif (ai >= Nodes[n])\n\t break;\n \n r = RED[n];\n g = GREEN[n];\n b = BLUE[n];\n if (n < nNodes-1)\n\t{\n\t float frc;\n\t frc = Nodes[n+1]-Nodes[n];\n\t frc = (ai-Nodes[n])\/frc;\n\t r = (int)(r + frc*(RED[n+1]-r));\n\t g = (int)(g + frc*(GREEN[n+1]-g));\n\t b = (int)(b + frc*(BLUE[n+1]-b));\n\t}\n\n int x, y;\n y = i%8;\n x = i\/8;\n \n QColorDialog::setStandardColor(y*6+x, qRgb(r,g,b));\n }\n}\n\nbool\nStaticFunctions::checkExtension(QString flnm, const char *ext)\n{\n bool ok = true;\n int extlen = strlen(ext);\n\n QFileInfo info(flnm);\n if (info.exists() && info.isFile())\n {\n QByteArray exten = flnm.toLatin1().right(extlen);\n if (exten != ext)\n\tok = false;\n }\n else\n ok = false;\n\n return ok;\n}\n\nbool\nStaticFunctions::checkRegExp(QString flnm, QString regex)\n{\n QRegExp rx(regex);\n rx.setPatternSyntax(QRegExp::Wildcard);\n\n bool ok = true;\n\n QFileInfo info(flnm);\n if (info.exists() && info.isFile())\n {\n if (! rx.exactMatch(flnm))\n\tok = false;\n }\n else\n ok = false;\n\n return ok;\n}\n\nbool\nStaticFunctions::checkURLs(QList<QUrl> urls, const char *ext)\n{\n bool ok = true;\n int extlen = strlen(ext);\n\n for(uint i=0; i<urls.count(); i++)\n {\n QUrl url = urls[i];\n QFileInfo info(url.toLocalFile());\n if (info.exists() && info.isFile())\n\t{\n\t QByteArray exten = url.toLocalFile().toLatin1().right(extlen);\n\t if (exten != ext)\n\t {\n\t ok = false;\n\t break;\n\t }\n\t}\n else\n\t{\n\t ok = false;\n\t break;\n\t}\n }\n return ok;\n}\n\nbool\nStaticFunctions::checkURLsRegExp(QList<QUrl> urls, QString regex)\n{\n QRegExp rx(regex);\n rx.setPatternSyntax(QRegExp::Wildcard);\n\n bool ok = true;\n\n for(uint i=0; i<urls.count(); i++)\n {\n QUrl url = urls[i];\n QFileInfo info(url.toLocalFile());\n if (info.exists() && info.isFile())\n\t{\n\t if (! rx.exactMatch(url.toLocalFile()))\n\t {\n\t ok = false;\n\t break;\n\t }\n\t}\n else\n\t{\n\t ok = false;\n\t break;\n\t}\n }\n return ok;\n}\n\nQGradientStops\nStaticFunctions::resampleGradientStops(QGradientStops stops)\n{\n QColor colorMap[101];\n\n int startj, endj;\n for(int i=0; i<stops.size(); i++)\n {\n float pos = stops[i].first;\n QColor color = stops[i].second;\n endj = pos*100;\n colorMap[endj] = color;\n if (i > 0)\n\t{\n\t QColor colStart, colEnd;\n\t colStart = colorMap[startj];\n\t colEnd = colorMap[endj];\n\t float rb,gb,bb,ab, re,ge,be,ae;\n\t rb = colStart.red();\n\t gb = colStart.green();\n\t bb = colStart.blue();\n\t ab = colStart.alpha();\n\t re = colEnd.red();\n\t ge = colEnd.green();\n\t be = colEnd.blue();\n\t ae = colEnd.alpha();\n\t for (int j=startj+1; j<endj; j++)\n\t {\n\t float frc = (float)(j-startj)\/(float)(endj-startj);\n\t float r,g,b,a;\n\t r = rb + frc*(re-rb);\n\t g = gb + frc*(ge-gb);\n\t b = bb + frc*(be-bb);\n\t a = ab + frc*(ae-ab);\n\t colorMap[j] = QColor(r, g, b, a);\n\t }\n\t}\n startj = endj;\n }\n\n QGradientStops newStops;\n for (int i=0; i<100; i++)\n {\n float pos = (float)i\/100.0f;\n newStops << QGradientStop(pos, colorMap[i]);\n }\n\n return newStops;\n}\n\nint\nStaticFunctions::getScaledown(int scldn, int nX)\n{\n int ttct = 2*scldn-1;\n int ct=0;\n int snx = 0;\n for(int i=0; i<nX; i++)\n {\n ct ++;\n if (ct == ttct)\n\t{\n\t snx ++;\n\t ct = ttct\/2;\n\t}\n }\n return snx;\n}\n\nvoid\nStaticFunctions::swapbytes(uchar *ptr, int nbytes)\n{\n for(uint i=0; i<nbytes\/2; i++)\n {\n uchar t;\n t = ptr[i];\n ptr[i] = ptr[nbytes-1-i];\n ptr[nbytes-1-i] = t;\n }\n}\n\nvoid\nStaticFunctions::swapbytes(uchar *ptr, int bpv, int nbytes)\n{\n int nb = nbytes\/bpv;\n for(uint j=0; j<nb; j++)\n {\n uchar *p = ptr + bpv*j;\n for(uint i=0; i<bpv\/2; i++)\n\t{\n\t uchar t;\n\t t = p[i];\n\t p[i] = p[bpv-1-i];\n\t p[bpv-1-i] = t;\n\t}\n }\n\n}\n<commit_msg>import : fixed checkExtension<commit_after>#include \"staticfunctions.h\"\n#include <QRegExp>\n\nvoid\nStaticFunctions::initQColorDialog()\n{\n int i;\n \n int nNodes = 16;\n int Nodes[] = { 0, 4, 8, 12, 16, 20, 23, 24, 28, 32, 36, 40, 44, 45, 46, 47 };\n int RED[] = { 255, 255, 0, 0, 0, 255, 255, 255, 255, 128, 255, 128, 128, 0, 128, 255 };\n int GREEN[]={ 0, 255, 255, 255, 0, 0, 0, 255, 128, 255, 128, 255, 128, 0, 128, 255 };\n int BLUE[] ={ 0, 0, 0, 255, 255, 255, 64, 128, 255, 255, 128, 128, 255, 0, 128, 255 };\n\n int ai;\n for(i = 0; i < 48; i++)\n {\n ai = i;\n if (ai >= 8 && ai < 16) ai = 15 - ai%8;\n else if (ai >= 32 && ai < 40) ai = 39 - ai%32;\n \n int n, r, g, b;\n for(n=nNodes-1; n>=0; n--)\n\tif (ai >= Nodes[n])\n\t break;\n \n r = RED[n];\n g = GREEN[n];\n b = BLUE[n];\n if (n < nNodes-1)\n\t{\n\t float frc;\n\t frc = Nodes[n+1]-Nodes[n];\n\t frc = (ai-Nodes[n])\/frc;\n\t r = (int)(r + frc*(RED[n+1]-r));\n\t g = (int)(g + frc*(GREEN[n+1]-g));\n\t b = (int)(b + frc*(BLUE[n+1]-b));\n\t}\n\n int x, y;\n y = i%8;\n x = i\/8;\n \n QColorDialog::setStandardColor(y*6+x, qRgb(r,g,b));\n }\n}\n\nbool\nStaticFunctions::checkExtension(QString flnm, const char *ext)\n{\n bool ok = true;\n int extlen = strlen(ext);\n\n QByteArray exten = flnm.toLatin1().right(extlen);\n if (exten != ext)\n ok = false;\n\n return ok;\n}\n\nbool\nStaticFunctions::checkRegExp(QString flnm, QString regex)\n{\n QRegExp rx(regex);\n rx.setPatternSyntax(QRegExp::Wildcard);\n\n bool ok = true;\n\n QFileInfo info(flnm);\n if (info.exists() && info.isFile())\n {\n if (! rx.exactMatch(flnm))\n\tok = false;\n }\n else\n ok = false;\n\n return ok;\n}\n\nbool\nStaticFunctions::checkURLs(QList<QUrl> urls, const char *ext)\n{\n bool ok = true;\n int extlen = strlen(ext);\n\n for(uint i=0; i<urls.count(); i++)\n {\n QUrl url = urls[i];\n QFileInfo info(url.toLocalFile());\n if (info.exists() && info.isFile())\n\t{\n\t QByteArray exten = url.toLocalFile().toLatin1().right(extlen);\n\t if (exten != ext)\n\t {\n\t ok = false;\n\t break;\n\t }\n\t}\n else\n\t{\n\t ok = false;\n\t break;\n\t}\n }\n return ok;\n}\n\nbool\nStaticFunctions::checkURLsRegExp(QList<QUrl> urls, QString regex)\n{\n QRegExp rx(regex);\n rx.setPatternSyntax(QRegExp::Wildcard);\n\n bool ok = true;\n\n for(uint i=0; i<urls.count(); i++)\n {\n QUrl url = urls[i];\n QFileInfo info(url.toLocalFile());\n if (info.exists() && info.isFile())\n\t{\n\t if (! rx.exactMatch(url.toLocalFile()))\n\t {\n\t ok = false;\n\t break;\n\t }\n\t}\n else\n\t{\n\t ok = false;\n\t break;\n\t}\n }\n return ok;\n}\n\nQGradientStops\nStaticFunctions::resampleGradientStops(QGradientStops stops)\n{\n QColor colorMap[101];\n\n int startj, endj;\n for(int i=0; i<stops.size(); i++)\n {\n float pos = stops[i].first;\n QColor color = stops[i].second;\n endj = pos*100;\n colorMap[endj] = color;\n if (i > 0)\n\t{\n\t QColor colStart, colEnd;\n\t colStart = colorMap[startj];\n\t colEnd = colorMap[endj];\n\t float rb,gb,bb,ab, re,ge,be,ae;\n\t rb = colStart.red();\n\t gb = colStart.green();\n\t bb = colStart.blue();\n\t ab = colStart.alpha();\n\t re = colEnd.red();\n\t ge = colEnd.green();\n\t be = colEnd.blue();\n\t ae = colEnd.alpha();\n\t for (int j=startj+1; j<endj; j++)\n\t {\n\t float frc = (float)(j-startj)\/(float)(endj-startj);\n\t float r,g,b,a;\n\t r = rb + frc*(re-rb);\n\t g = gb + frc*(ge-gb);\n\t b = bb + frc*(be-bb);\n\t a = ab + frc*(ae-ab);\n\t colorMap[j] = QColor(r, g, b, a);\n\t }\n\t}\n startj = endj;\n }\n\n QGradientStops newStops;\n for (int i=0; i<100; i++)\n {\n float pos = (float)i\/100.0f;\n newStops << QGradientStop(pos, colorMap[i]);\n }\n\n return newStops;\n}\n\nint\nStaticFunctions::getScaledown(int scldn, int nX)\n{\n int ttct = 2*scldn-1;\n int ct=0;\n int snx = 0;\n for(int i=0; i<nX; i++)\n {\n ct ++;\n if (ct == ttct)\n\t{\n\t snx ++;\n\t ct = ttct\/2;\n\t}\n }\n return snx;\n}\n\nvoid\nStaticFunctions::swapbytes(uchar *ptr, int nbytes)\n{\n for(uint i=0; i<nbytes\/2; i++)\n {\n uchar t;\n t = ptr[i];\n ptr[i] = ptr[nbytes-1-i];\n ptr[nbytes-1-i] = t;\n }\n}\n\nvoid\nStaticFunctions::swapbytes(uchar *ptr, int bpv, int nbytes)\n{\n int nb = nbytes\/bpv;\n for(uint j=0; j<nb; j++)\n {\n uchar *p = ptr + bpv*j;\n for(uint i=0; i<bpv\/2; i++)\n\t{\n\t uchar t;\n\t t = p[i];\n\t p[i] = p[bpv-1-i];\n\t p[bpv-1-i] = t;\n\t}\n }\n\n}\n<|endoftext|>"} {"text":"<commit_before>#ifdef LIBUS_USE_QUIC\n\n\/* Do not rely on this API, it will change *\/\n#include \"Http3App.h\"\n#include <iostream>\n\n\/* Example of simple Http3 server handling both GET with headers and POST with body.\n * You might be surprised to find out you can replace uWS::H3App with uWS::SSLApp and\n * serve TCP\/TLS-based HTTP instead of QUIC-based HTTP, using the same very code ;) *\/\nint main() {\n\tuWS::SSLApp({\n\t .key_file_name = \"misc\/key.pem\",\n\t .cert_file_name = \"misc\/cert.pem\",\n\t .passphrase = \"1234\"\n\t}).get(\"\/*\", [](auto *res, auto *req) {\n\n\t\t\/* Printing these should obviously be disabled if doing benchmarking *\/\n\t\tstd::cout << req->getHeader(\":path\") << std::endl;\n\t\tstd::cout << req->getHeader(\":method\") << std::endl;\n\n\t res->end(\"Hello H3 from uWS!\");\n\t}).post(\"\/*\", [](auto *res, auto *\/*req*\/) {\n\n\t\t\/* You also need to set onAborted if receiving data *\/\n\t\tres->onData([res, bodyBuffer = (std::string *)nullptr](std::string_view chunk, bool isLast) mutable {\n\t\t\tif (isLast) {\n\t\t\t\tif (bodyBuffer) {\n\t\t\t\t\t\/* Send back the (chunked) body we got, as response *\/\n\t\t\t\t\tbodyBuffer->append(chunk);\n\t\t\t\t\tres->end(*bodyBuffer);\n\t\t\t\t\tdelete bodyBuffer;\n\t\t\t\t} else {\n\t\t\t\t\t\/* Send back the body we got, as response (fast path) *\/\n\t\t\t\t\tres->end(chunk);\n\t\t\t\t}\n\t\t\t} else {\n\t\t\t\t\/* Slow path *\/\n\t\t\t\tif (!bodyBuffer) {\n\t\t\t\t\tbodyBuffer = new std::string;\n\t\t\t\t}\n\t\t\t\t\/* If we got the body in a chunk, buffer it up until whole *\/\n\t\t\t\tbodyBuffer->append(chunk);\n\t\t\t}\n\n\t\t});\n\n\t\t\/* If you have pending, asynch work, you should abort such work in this callback *\/\n\t\tres->onAborted([]() {\n\t\t\t\/* Again, just printing is not enough, you need to abort any pending work here\n\t\t\t * so that nothing will call res->end, since the request was aborted and deleted *\/\n\t\t\tprintf(\"Stream was aborted!\\n\");\n\t\t});\n\t}).listen(9004, [](auto *listen_socket) {\n\t if (listen_socket) {\n\t\t\tstd::cout << \"Listening on port \" << 9004 << std::endl;\n\t }\n\t}).run();\n\n\tstd::cout << \"Failed to listen on port 3000\" << std::endl;\n}\n\n#else\n\n#include <stdio.h>\n\nint main() {\n printf(\"Compile with WITH_QUIC=1 WITH_BORINGSSL=1 make in order to build this example\\n\");\n}\n\n#endif<commit_msg>That should obviously be h3<commit_after>#ifdef LIBUS_USE_QUIC\n\n\/* Do not rely on this API, it will change *\/\n#include \"Http3App.h\"\n#include <iostream>\n\n\/* Example of simple Http3 server handling both GET with headers and POST with body.\n * You might be surprised to find out you can replace uWS::H3App with uWS::SSLApp and\n * serve TCP\/TLS-based HTTP instead of QUIC-based HTTP, using the same very code ;) *\/\nint main() {\n\tuWS::H3App({\n\t .key_file_name = \"misc\/key.pem\",\n\t .cert_file_name = \"misc\/cert.pem\",\n\t .passphrase = \"1234\"\n\t}).get(\"\/*\", [](auto *res, auto *req) {\n\n\t\t\/* Printing these should obviously be disabled if doing benchmarking *\/\n\t\tstd::cout << req->getHeader(\":path\") << std::endl;\n\t\tstd::cout << req->getHeader(\":method\") << std::endl;\n\n\t res->end(\"Hello H3 from uWS!\");\n\t}).post(\"\/*\", [](auto *res, auto *\/*req*\/) {\n\n\t\t\/* You also need to set onAborted if receiving data *\/\n\t\tres->onData([res, bodyBuffer = (std::string *)nullptr](std::string_view chunk, bool isLast) mutable {\n\t\t\tif (isLast) {\n\t\t\t\tif (bodyBuffer) {\n\t\t\t\t\t\/* Send back the (chunked) body we got, as response *\/\n\t\t\t\t\tbodyBuffer->append(chunk);\n\t\t\t\t\tres->end(*bodyBuffer);\n\t\t\t\t\tdelete bodyBuffer;\n\t\t\t\t} else {\n\t\t\t\t\t\/* Send back the body we got, as response (fast path) *\/\n\t\t\t\t\tres->end(chunk);\n\t\t\t\t}\n\t\t\t} else {\n\t\t\t\t\/* Slow path *\/\n\t\t\t\tif (!bodyBuffer) {\n\t\t\t\t\tbodyBuffer = new std::string;\n\t\t\t\t}\n\t\t\t\t\/* If we got the body in a chunk, buffer it up until whole *\/\n\t\t\t\tbodyBuffer->append(chunk);\n\t\t\t}\n\n\t\t});\n\n\t\t\/* If you have pending, asynch work, you should abort such work in this callback *\/\n\t\tres->onAborted([]() {\n\t\t\t\/* Again, just printing is not enough, you need to abort any pending work here\n\t\t\t * so that nothing will call res->end, since the request was aborted and deleted *\/\n\t\t\tprintf(\"Stream was aborted!\\n\");\n\t\t});\n\t}).listen(9004, [](auto *listen_socket) {\n\t if (listen_socket) {\n\t\t\tstd::cout << \"Listening on port \" << 9004 << std::endl;\n\t }\n\t}).run();\n\n\tstd::cout << \"Failed to listen on port 3000\" << std::endl;\n}\n\n#else\n\n#include <stdio.h>\n\nint main() {\n printf(\"Compile with WITH_QUIC=1 WITH_BORINGSSL=1 make in order to build this example\\n\");\n}\n\n#endif<|endoftext|>"} {"text":"<commit_before><commit_msg>Don't allow duplicate keys on PropertyMap construction<commit_after><|endoftext|>"} {"text":"<commit_before>#include <common\/FSUtils.h>\n\n#include <cstring>\n#include <future>\n#include <sstream>\n\n#include <common\/CapricaConfig.h>\n#include <common\/CapricaReportingContext.h>\n#include <common\/CaselessStringComparer.h>\n#include <common\/Concurrency.h>\n\nnamespace caprica { namespace FSUtils {\n\nstruct FileReadCacheEntry final\n{\n FileReadCacheEntry() :\n read(std::make_unique<std::atomic<bool>>(false)),\n dataMutex(std::make_unique<std::mutex>()),\n taskMutex(std::make_unique<std::mutex>())\n {\n }\n FileReadCacheEntry(FileReadCacheEntry&& o) = default;\n FileReadCacheEntry& operator =(FileReadCacheEntry&&) = default;\n FileReadCacheEntry(const FileReadCacheEntry&) = delete;\n FileReadCacheEntry& operator =(const FileReadCacheEntry&) = delete;\n ~FileReadCacheEntry() = default;\n\n void wantFile(const std::string& filename, size_t filesize) {\n if (!this->filesize && filesize)\n this->filesize = filesize;\n if (conf::Performance::asyncFileRead) {\n if (!read->load() && !readTask.valid()) {\n std::unique_lock<std::mutex> lock{ *taskMutex };\n if (!read->load() && !readTask.valid()) {\n readTask = std::move(std::async(std::launch::async, [this, filename]() {\n this->readFile(filename);\n }));\n }\n }\n }\n }\n\n void readFile(const std::string& filename) {\n std::ifstream inFile{ filename, std::ifstream::binary };\n inFile.exceptions(std::ifstream::badbit | std::ifstream::failbit);\n std::string str;\n if (filesize != 0) {\n auto size = filesize;\n auto buf = new char[size];\n inFile.read(buf, size);\n str = std::string(buf, size);\n delete buf;\n }\n \/\/ Just because the filesize was one thing when\n \/\/ we iterated the directory doesn't mean it's\n \/\/ not gotten bigger since then.\n inFile.peek();\n if (!inFile.eof()) {\n std::stringstream strStream{ };\n strStream.exceptions(std::ifstream::badbit | std::ifstream::failbit);\n strStream << inFile.rdbuf();\n str += strStream.str();\n }\n {\n std::unique_lock<std::mutex> lock{ *dataMutex };\n readFileData = std::move(str);\n read->store(true);\n }\n }\n\n boost::string_ref getData(const std::string& filename) {\n if (read->load())\n return readFileData;\n\n if (readTask.valid()) {\n std::unique_lock<std::mutex> lock{ *taskMutex };\n if (readTask.valid())\n readTask.get();\n assert(read->load());\n return readFileData;\n }\n\n readFile(filename);\n assert(read->load());\n return readFileData;\n }\n\n void waitForRead() {\n if (readTask.valid()) {\n std::unique_lock<std::mutex> lock{ *taskMutex };\n if (readTask.valid())\n readTask.get();\n assert(read->load());\n }\n }\n\nprivate:\n std::unique_ptr<std::atomic<bool>> read;\n std::unique_ptr<std::mutex> dataMutex;\n std::string readFileData{ \"\" };\n std::unique_ptr<std::mutex> taskMutex;\n std::future<void> readTask{ };\n size_t filesize{ 0 };\n};\n\nstatic caseless_concurrent_unordered_path_map<std::string, FileReadCacheEntry> readFilesMap{ };\n\nvoid Cache::waitForAll() {\n for (auto& f : readFilesMap) {\n f.second.waitForRead();\n }\n}\n\nvoid Cache::push_need(const std::string& filename, size_t filesize) {\n pushKnownExists(filename);\n readFilesMap[filename].wantFile(filename, filesize);\n}\n\nboost::string_ref Cache::cachedReadFull(const std::string& filename) {\n auto abs = canonical(filename);\n push_need(abs);\n return readFilesMap[abs].getData(abs);\n}\n\nboost::string_ref basenameAsRef(boost::string_ref file) {\n auto pos = file.find_last_of(\"\\\\\/\");\n if (pos != boost::string_ref::npos)\n file = file.substr(pos + 1);\n auto pos2 = file.rfind('.');\n if (pos2 != boost::string_ref::npos)\n return file.substr(0, pos2);\n return file;\n}\n\nboost::string_ref extensionAsRef(boost::string_ref file) {\n auto pos = file.rfind('.');\n if (pos != boost::string_ref::npos)\n return file.substr(pos);\n return \"\";\n}\n\nboost::string_ref filenameAsRef(boost::string_ref file) {\n auto pos = file.find_last_of(\"\\\\\/\");\n if (pos != boost::string_ref::npos)\n return file.substr(pos + 1);\n return file;\n}\n\nboost::string_ref parentPathAsRef(boost::string_ref file) {\n auto pos = file.find_last_of(\"\\\\\/\");\n if (pos != boost::string_ref::npos)\n file = file.substr(0, pos);\n return file;\n}\n\nstatic void writeFile(const std::string& filename, std::string&& value) {\n if (!conf::Performance::performanceTestMode) {\n auto containingDir = boost::filesystem::path(filename).parent_path();\n if (!boost::filesystem::exists(containingDir))\n boost::filesystem::create_directories(containingDir);\n std::ofstream destFile{ filename, std::ifstream::binary };\n destFile.exceptions(std::ifstream::badbit | std::ifstream::failbit);\n destFile << value;\n }\n}\n\nvoid async_write(const std::string& filename, std::string&& value) {\n if (!conf::Performance::asyncFileWrite) {\n writeFile(filename, std::move(value));\n } else {\n std::async(std::launch::async, [](const std::string& filename, std::string&& value) {\n writeFile(filename, std::move(value));\n }, filename, std::move(value));\n }\n}\n\nstatic caseless_unordered_path_map<std::string, caseless_unordered_set<std::string>> directoryContentsMap{ };\nvoid pushKnownInDirectory(const std::string& directory, caseless_unordered_set<std::string>&& files) {\n if (directoryContentsMap.count(directory))\n CapricaReportingContext::logicalFatal(\"Attempted to push the known directory state of '%s' multiple times!\", directory.c_str());\n directoryContentsMap.emplace(directory, std::move(files));\n}\n\nstatic caseless_concurrent_unordered_path_map<std::string, uint8_t> fileExistenceMap{ };\nvoid pushKnownExists(const std::string& path) {\n fileExistenceMap.insert({ path, 2 });\n}\n\nstatic bool checkAndSetExists(const std::string& path) {\n bool exists = false;\n auto toFind = boost::filesystem::path(path).parent_path().string();\n auto f = directoryContentsMap.find(toFind);\n if (f != directoryContentsMap.end()) {\n auto fName = filenameAsRef(path).to_string();\n auto e = f->second.count(fName);\n exists = e != 0;\n } else {\n exists = boost::filesystem::exists(path);\n }\n fileExistenceMap.insert({ path, exists ? 2 : 1 });\n return exists;\n}\n\nbool exists(const std::string& path) {\n \/\/ These concurrent maps are a pain, as it's possible to get a value\n \/\/ in the process of being set.\n if (fileExistenceMap.count(path))\n return fileExistenceMap[path] == 2 ? true : checkAndSetExists(path);\n return checkAndSetExists(path);\n}\n\n\/\/ Borrowed and modified from http:\/\/stackoverflow.com\/a\/1750710\/776797\nstd::string canonical(const std::string& path) {\n if (path.size() > 3 && path[1] == ':') {\n \/\/ Shortcircuit for already canon paths.\n if (path.find(\"\/\") == std::string::npos &&\n path.find(\"..\") == std::string::npos &&\n path.find(\"\\\\.\\\\\") == std::string::npos &&\n path.find(\"\\\\\\\\\") == std::string::npos) {\n return path;\n }\n }\n static boost::filesystem::path currentDirectory = boost::filesystem::current_path();\n auto absPath = boost::filesystem::absolute(path, currentDirectory);\n if (conf::Performance::resolveSymlinks) {\n return boost::filesystem::canonical(absPath).make_preferred().string();\n } else {\n boost::filesystem::path result;\n for (auto it = absPath.begin(); it != absPath.end(); ++it) {\n if (!wcscmp(it->c_str(), L\"..\")) {\n \/\/ \/a\/b\/..\/.. is not \/a\/b\/.. under most circumstances\n \/\/ We can end up with ..s in our result because of symbolic links\n if (!wcscmp(result.filename().c_str(), L\"..\"))\n result \/= *it;\n \/\/ Otherwise it should be safe to resolve the parent\n else\n result = result.parent_path();\n } else if (!wcscmp(it->c_str(), L\".\")) {\n \/\/ Ignore\n } else {\n \/\/ Just cat other path entries\n result \/= *it;\n }\n }\n return result.make_preferred().string();\n }\n}\n\n}}\n<commit_msg>Do the file reads more efficiently.<commit_after>#include <common\/FSUtils.h>\n\n#include <io.h>\n#include <fcntl.h>\n\n#include <cstring>\n#include <future>\n#include <sstream>\n\n#include <common\/CapricaConfig.h>\n#include <common\/CapricaReportingContext.h>\n#include <common\/CaselessStringComparer.h>\n#include <common\/Concurrency.h>\n\nnamespace caprica { namespace FSUtils {\n\nstruct FileReadCacheEntry final\n{\n FileReadCacheEntry() :\n read(std::make_unique<std::atomic<bool>>(false)),\n dataMutex(std::make_unique<std::mutex>()),\n taskMutex(std::make_unique<std::mutex>())\n {\n }\n FileReadCacheEntry(FileReadCacheEntry&& o) = default;\n FileReadCacheEntry& operator =(FileReadCacheEntry&&) = default;\n FileReadCacheEntry(const FileReadCacheEntry&) = delete;\n FileReadCacheEntry& operator =(const FileReadCacheEntry&) = delete;\n ~FileReadCacheEntry() = default;\n\n void wantFile(const std::string& filename, size_t filesize) {\n if (!this->filesize && filesize)\n this->filesize = filesize;\n if (conf::Performance::asyncFileRead) {\n if (!read->load() && !readTask.valid()) {\n std::unique_lock<std::mutex> lock{ *taskMutex };\n if (!read->load() && !readTask.valid()) {\n readTask = std::move(std::async(std::launch::async, [this, filename]() {\n this->readFile(filename);\n }));\n }\n }\n }\n }\n\n void readFile(const std::string& filename) {\n std::string str;\n str.resize(filesize);\n auto fd = _open(filename.c_str(), _O_BINARY | _O_RDONLY | _O_SEQUENTIAL);\n if (fd != -1) {\n auto len = _read(fd, (void*)str.data(), filesize);\n if (len != filesize)\n str.resize(len);\n if (_eof(fd) == 1) {\n _close(fd);\n goto DoMove;\n }\n }\n {\n std::ifstream inFile{ filename, std::ifstream::binary };\n inFile.exceptions(std::ifstream::badbit | std::ifstream::failbit);\n if (filesize != 0)\n inFile.read((char*)str.data(), filesize);\n \/\/ Just because the filesize was one thing when\n \/\/ we iterated the directory doesn't mean it's\n \/\/ not gotten bigger since then.\n inFile.peek();\n if (!inFile.eof()) {\n std::stringstream strStream{ };\n strStream.exceptions(std::ifstream::badbit | std::ifstream::failbit);\n strStream << inFile.rdbuf();\n str += strStream.str();\n }\n }\n DoMove:\n {\n std::unique_lock<std::mutex> lock{ *dataMutex };\n readFileData = std::move(str);\n read->store(true);\n }\n }\n\n boost::string_ref getData(const std::string& filename) {\n if (read->load())\n return readFileData;\n\n if (readTask.valid()) {\n std::unique_lock<std::mutex> lock{ *taskMutex };\n if (readTask.valid())\n readTask.get();\n assert(read->load());\n return readFileData;\n }\n\n readFile(filename);\n assert(read->load());\n return readFileData;\n }\n\n void waitForRead() {\n if (readTask.valid()) {\n std::unique_lock<std::mutex> lock{ *taskMutex };\n if (readTask.valid())\n readTask.get();\n assert(read->load());\n }\n }\n\nprivate:\n std::unique_ptr<std::atomic<bool>> read;\n std::unique_ptr<std::mutex> dataMutex;\n std::string readFileData{ \"\" };\n std::unique_ptr<std::mutex> taskMutex;\n std::future<void> readTask{ };\n size_t filesize{ 0 };\n};\n\nstatic caseless_concurrent_unordered_path_map<std::string, FileReadCacheEntry> readFilesMap{ };\n\nvoid Cache::waitForAll() {\n for (auto& f : readFilesMap) {\n f.second.waitForRead();\n }\n}\n\nvoid Cache::push_need(const std::string& filename, size_t filesize) {\n pushKnownExists(filename);\n readFilesMap[filename].wantFile(filename, filesize);\n}\n\nboost::string_ref Cache::cachedReadFull(const std::string& filename) {\n auto abs = canonical(filename);\n push_need(abs);\n return readFilesMap[abs].getData(abs);\n}\n\nboost::string_ref basenameAsRef(boost::string_ref file) {\n auto pos = file.find_last_of(\"\\\\\/\");\n if (pos != boost::string_ref::npos)\n file = file.substr(pos + 1);\n auto pos2 = file.rfind('.');\n if (pos2 != boost::string_ref::npos)\n return file.substr(0, pos2);\n return file;\n}\n\nboost::string_ref extensionAsRef(boost::string_ref file) {\n auto pos = file.rfind('.');\n if (pos != boost::string_ref::npos)\n return file.substr(pos);\n return \"\";\n}\n\nboost::string_ref filenameAsRef(boost::string_ref file) {\n auto pos = file.find_last_of(\"\\\\\/\");\n if (pos != boost::string_ref::npos)\n return file.substr(pos + 1);\n return file;\n}\n\nboost::string_ref parentPathAsRef(boost::string_ref file) {\n auto pos = file.find_last_of(\"\\\\\/\");\n if (pos != boost::string_ref::npos)\n file = file.substr(0, pos);\n return file;\n}\n\nstatic void writeFile(const std::string& filename, std::string&& value) {\n if (!conf::Performance::performanceTestMode) {\n auto containingDir = boost::filesystem::path(filename).parent_path();\n if (!boost::filesystem::exists(containingDir))\n boost::filesystem::create_directories(containingDir);\n std::ofstream destFile{ filename, std::ifstream::binary };\n destFile.exceptions(std::ifstream::badbit | std::ifstream::failbit);\n destFile << value;\n }\n}\n\nvoid async_write(const std::string& filename, std::string&& value) {\n if (!conf::Performance::asyncFileWrite) {\n writeFile(filename, std::move(value));\n } else {\n std::async(std::launch::async, [](const std::string& filename, std::string&& value) {\n writeFile(filename, std::move(value));\n }, filename, std::move(value));\n }\n}\n\nstatic caseless_unordered_path_map<std::string, caseless_unordered_set<std::string>> directoryContentsMap{ };\nvoid pushKnownInDirectory(const std::string& directory, caseless_unordered_set<std::string>&& files) {\n if (directoryContentsMap.count(directory))\n CapricaReportingContext::logicalFatal(\"Attempted to push the known directory state of '%s' multiple times!\", directory.c_str());\n directoryContentsMap.emplace(directory, std::move(files));\n}\n\nstatic caseless_concurrent_unordered_path_map<std::string, uint8_t> fileExistenceMap{ };\nvoid pushKnownExists(const std::string& path) {\n fileExistenceMap.insert({ path, 2 });\n}\n\nstatic bool checkAndSetExists(const std::string& path) {\n bool exists = false;\n auto toFind = boost::filesystem::path(path).parent_path().string();\n auto f = directoryContentsMap.find(toFind);\n if (f != directoryContentsMap.end()) {\n auto fName = filenameAsRef(path).to_string();\n auto e = f->second.count(fName);\n exists = e != 0;\n } else {\n exists = boost::filesystem::exists(path);\n }\n fileExistenceMap.insert({ path, exists ? 2 : 1 });\n return exists;\n}\n\nbool exists(const std::string& path) {\n \/\/ These concurrent maps are a pain, as it's possible to get a value\n \/\/ in the process of being set.\n if (fileExistenceMap.count(path))\n return fileExistenceMap[path] == 2 ? true : checkAndSetExists(path);\n return checkAndSetExists(path);\n}\n\n\/\/ Borrowed and modified from http:\/\/stackoverflow.com\/a\/1750710\/776797\nstd::string canonical(const std::string& path) {\n if (path.size() > 3 && path[1] == ':') {\n \/\/ Shortcircuit for already canon paths.\n if (path.find(\"\/\") == std::string::npos &&\n path.find(\"..\") == std::string::npos &&\n path.find(\"\\\\.\\\\\") == std::string::npos &&\n path.find(\"\\\\\\\\\") == std::string::npos) {\n return path;\n }\n }\n static boost::filesystem::path currentDirectory = boost::filesystem::current_path();\n auto absPath = boost::filesystem::absolute(path, currentDirectory);\n if (conf::Performance::resolveSymlinks) {\n return boost::filesystem::canonical(absPath).make_preferred().string();\n } else {\n boost::filesystem::path result;\n for (auto it = absPath.begin(); it != absPath.end(); ++it) {\n if (!wcscmp(it->c_str(), L\"..\")) {\n \/\/ \/a\/b\/..\/.. is not \/a\/b\/.. under most circumstances\n \/\/ We can end up with ..s in our result because of symbolic links\n if (!wcscmp(result.filename().c_str(), L\"..\"))\n result \/= *it;\n \/\/ Otherwise it should be safe to resolve the parent\n else\n result = result.parent_path();\n } else if (!wcscmp(it->c_str(), L\".\")) {\n \/\/ Ignore\n } else {\n \/\/ Just cat other path entries\n result \/= *it;\n }\n }\n return result.make_preferred().string();\n }\n}\n\n}}\n<|endoftext|>"} {"text":"<commit_before>\/*\n * nt loader\n *\n * Copyright 2006-2008 Mike McCormack\n *\n * This library is free software; you can redistribute it and\/or\n * modify it under the terms of the GNU Lesser General Public\n * License as published by the Free Software Foundation; either\n * version 2.1 of the License, or (at your option) any later version.\n *\n * This library is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU\n * Lesser General Public License for more details.\n *\n * You should have received a copy of the GNU Lesser General Public\n * License along with this library; if not, write to the Free Software\n * Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301, USA\n *\/\n\n\n#include <stdarg.h>\n#include <stdlib.h>\n\n#include \"ntstatus.h\"\n#define WIN32_NO_STATUS\n#include \"windef.h\"\n#include \"winternl.h\"\n\n#include \"debug.h\"\n#include \"object.h\"\n#include \"mem.h\"\n#include \"ntcall.h\"\n#include \"timer.h\"\n\nNTSTATUS copy_to_user( void *dest, const void *src, size_t len )\n{\n\treturn current->copy_to_user( dest, src, len );\n}\n\nNTSTATUS copy_from_user( void *dest, const void *src, size_t len )\n{\n\treturn current->copy_from_user( dest, src, len );\n}\n\nNTSTATUS verify_for_write( void *dest, size_t len )\n{\n\treturn current->verify_for_write( dest, len );\n}\n\nNTSTATUS NTAPI NtRaiseHardError(\n\tNTSTATUS Status,\n\tULONG NumberOfArguments,\n\tULONG StringArgumentsMask,\n\tPULONG Arguments,\n\tHARDERROR_RESPONSE_OPTION ResponseOption,\n\tPHARDERROR_RESPONSE Response)\n{\n\tNTSTATUS r;\n\tULONG i;\n\n\tdprintf(\"%08lx %lu %lu %p %u %p\\n\", Status, NumberOfArguments,\n\t\t\tStringArgumentsMask, Arguments, ResponseOption, Response);\n\n\tif (NumberOfArguments>32)\n\t\treturn STATUS_INVALID_PARAMETER;\n\n\tdprintf(\"hard error:\\n\");\n\tfor (i=0; i<NumberOfArguments; i++)\n\t{\n\t\tvoid *arg;\n\n\t\tr = copy_from_user( &arg, &Arguments[i], sizeof (PUNICODE_STRING) );\n\t\tif (r < STATUS_SUCCESS)\n\t\t\tbreak;\n\n\t\tif (StringArgumentsMask & (1<<i))\n\t\t{\n\t\t\tunicode_string_t us;\n\n\t\t\tr = us.copy_from_user( (UNICODE_STRING*) arg );\n\t\t\tif (r < STATUS_SUCCESS)\n\t\t\t\tbreak;\n\n\t\t\tdprintf(\"arg[%ld]: %pus\\n\", i, &us);\n\t\t}\n\t\telse\n\t\t\tdprintf(\"arg[%ld]: %08lx\\n\", i, (ULONG)arg);\n\t}\n\n\tdebugger();\n\n\treturn STATUS_SUCCESS;\n}\n\n#define SET_INFO_LENGTH(len, item) \\\n\tdo { \\\n\t\t(len) = sizeof (item); \\\n\t\tif ((len) < SystemInformationLength) \\\n\t\t\treturn STATUS_INFO_LENGTH_MISMATCH; \\\n\t\t(len) = SystemInformationLength; \\\n\t} while (0)\n\nNTSTATUS NTAPI NtQuerySystemInformation(\n\tSYSTEM_INFORMATION_CLASS SystemInformationClass,\n\tPVOID SystemInformation,\n\tULONG SystemInformationLength,\n\tPULONG ReturnLength )\n{\n\tNTSTATUS r = STATUS_SUCCESS;\n\tunion {\n\t\tSYSTEM_BASIC_INFORMATION basic;\n\t\tSYSTEM_CPU_INFORMATION cpu;\n\t\tSYSTEM_THREAD_INFORMATION thread;\n\t\tSYSTEM_TIME_OF_DAY_INFORMATION time_of_day;\n\t\tSYSTEM_RANGE_START_INFORMATION range_start;\n\t\tSYSTEM_GLOBAL_FLAG global_flag;\n\t\tSYSTEM_KERNEL_DEBUGGER_INFORMATION kernel_debugger_info;\n\t\tSYSTEM_PERFORMANCE_INFORMATION performance_info;\n\t\tSYSTEM_CRASH_DUMP_STATE_INFORMATION crash_dump_info;\n\t} info;\n\tULONG len = 0;\n\n\tdprintf(\"%d %p %lu %p\\n\", SystemInformationClass, SystemInformation,\n\t\t\tSystemInformationLength, ReturnLength);\n\n\tif (ReturnLength)\n\t{\n\t\tr = copy_to_user( ReturnLength, &len, sizeof len );\n\t\tif (r < STATUS_SUCCESS)\n\t\t\treturn r;\n\t}\n\n\tmemset( &info, 0, sizeof info );\n\n\tswitch( SystemInformationClass )\n\t{\n\tcase SystemBasicInformation:\n\t\tSET_INFO_LENGTH( len, info.basic );\n\t\tinfo.basic.dwUnknown1 = 0;\n\t\tinfo.basic.uKeMaximumIncrement = 0x18730;\n\t\tinfo.basic.uPageSize = 0x1000;\n\t\tinfo.basic.uMmNumberOfPhysicalPages = 0xbf6c;\n\t\tinfo.basic.uMmLowestPhysicalPage = 1;\n\t\tinfo.basic.uMmHighestPhysicalPage = 0xbfdf;\n\t\tinfo.basic.uAllocationGranularity = 0x1000;\n\t\tinfo.basic.pLowestUserAddress = (void*)0x1000;\n\t\tinfo.basic.pMmHighestUserAddress = (void*)0x7ffeffff;\n\t\tinfo.basic.uKeActiveProcessors = 1;\n\t\tinfo.basic.uKeNumberProcessors = 1;\n\t\tbreak;\n\n\tcase SystemCpuInformation:\n\t\tSET_INFO_LENGTH( len, info.cpu );\n\t\tinfo.cpu.Architecture = 0;\n\t\tinfo.cpu.Level = 6;\n\t\tinfo.cpu.Revision = 0x0801;\n\t\tinfo.cpu.FeatureSet = 0x2fff;\n\t\tbreak;\n\n\tcase SystemTimeOfDayInformation:\n\t\tSET_INFO_LENGTH( len, info.time_of_day );\n\t\tget_system_time_of_day( info.time_of_day );\n\t\tbreak;\n\n\tcase SystemRangeStartInformation:\n\t\tSET_INFO_LENGTH( len, info.range_start );\n\t\tinfo.range_start.SystemRangeStart = (PVOID) 0x80000000;\n\t\tbreak;\n\n\tcase SystemGlobalFlag:\n\t\tSET_INFO_LENGTH( len, info.global_flag );\n\t\tinfo.global_flag.GlobalFlag = 0;\n\t\tif (option_trace)\n\t\t\tinfo.global_flag.GlobalFlag |= FLG_SHOW_LDR_SNAPS | FLG_ENABLE_CSRDEBUG;\n\t\tbreak;\n\n\tcase SystemKernelDebuggerInformation:\n\t\tSET_INFO_LENGTH( len, info.kernel_debugger_info );\n\t\tinfo.kernel_debugger_info.DebuggerEnabled = FALSE;\n\t\tinfo.kernel_debugger_info.DebuggerNotPresent = TRUE;\n\t\tbreak;\n\n\tcase SystemPerformanceInformation:\n\t\tSET_INFO_LENGTH( len, info.performance_info );\n\t\tinfo.performance_info.AvailablePages = 0x80000; \/\/ 512Mb\n\t\tbreak;\n\n\tcase SystemCrashDumpStateInformation:\n\t\tSET_INFO_LENGTH( len, info.crash_dump_info );\n\t\tinfo.crash_dump_info.CrashDumpSectionExists = 0;\n\t\tinfo.crash_dump_info.Unknown = 0;\n\t\tbreak;\n\n\tdefault:\n\t\tdprintf(\"SystemInformationClass = %d not handled\\n\", SystemInformationClass);\n\t\tr = STATUS_INVALID_INFO_CLASS;\n\t}\n\n\tr = copy_to_user( SystemInformation, &info, len );\n\tif (ReturnLength)\n\t\tr = copy_to_user( ReturnLength, &len, sizeof len );\n\n\treturn r;\n}\n\nNTSTATUS NTAPI NtSetSystemInformation(\n\tSYSTEM_INFORMATION_CLASS SystemInformationClass,\n\tPVOID SystemInformation,\n\tULONG SystemInformationLength )\n{\n\tdprintf(\"%d %p %lu\\n\", SystemInformationClass, SystemInformation, SystemInformationLength );\n\treturn STATUS_SUCCESS;\n}\n\nNTSTATUS NTAPI NtFlushInstructionCache(\n\tHANDLE Process,\n\tPVOID BaseAddress,\n\tSIZE_T NumberOfBytesToFlush )\n{\n\tdprintf(\"%p %p %08lx\\n\", Process, BaseAddress, NumberOfBytesToFlush);\n\treturn STATUS_SUCCESS;\n}\n\nNTSTATUS NTAPI NtDisplayString( PUNICODE_STRING String )\n{\n\tunicode_string_t us;\n\tNTSTATUS r;\n\n\tr = us.copy_from_user( String );\n\tif (r < STATUS_SUCCESS)\n\t\treturn r;\n\n\tdprintf(\"%pus\\n\", &us );\n\n\treturn STATUS_SUCCESS;\n}\n\nNTSTATUS NTAPI NtCreatePagingFile(\n\tPUNICODE_STRING FileName,\n\tPULARGE_INTEGER InitialSize,\n\tPULARGE_INTEGER MaximumSize,\n\tULONG Reserved)\n{\n\tunicode_string_t us;\n\tNTSTATUS r;\n\n\tr = us.copy_from_user( FileName );\n\tif (r < STATUS_SUCCESS)\n\t\treturn r;\n\n\tULARGE_INTEGER init_sz, max_sz;\n\n\tr = copy_from_user( &init_sz, InitialSize, sizeof init_sz );\n\tif (r < STATUS_SUCCESS)\n\t\treturn r;\n\n\tr = copy_from_user( &max_sz, MaximumSize, sizeof max_sz );\n\tif (r < STATUS_SUCCESS)\n\t\treturn r;\n\n\tdprintf(\"unimplemented - %pus %llu %llu %08lx\\n\",\n\t\t\t &us, init_sz.QuadPart, max_sz.QuadPart, Reserved);\n\n\treturn STATUS_SUCCESS;\n}\n\nNTSTATUS NTAPI NtShutdownSystem(\n\tSHUTDOWN_ACTION Action)\n{\n\tconst char *action = 0;\n\tswitch (Action)\n\t{\n\tcase ShutdownNoReboot:\n\t\taction = \"ShutdownNoReboot\";\n\t\tbreak;\n\tcase ShutdownReboot:\n\t\taction = \"ShutdownReboot\";\n\t\tbreak;\n\tcase ShutdownPowerOff:\n\t\taction = \"ShutdownPowerOff\";\n\t\tbreak;\n\tdefault:\n\t\treturn STATUS_INVALID_PARAMETER;\n\t}\n\tdprintf(\"%s\\n\", action);\n\texit(1);\n}\n\nNTSTATUS NTAPI NtQueryPerformanceCounter(\n\tPLARGE_INTEGER PerformanceCount,\n\tPLARGE_INTEGER PerformanceFrequency)\n{\n\tLARGE_INTEGER now = timeout_t::current_time();\n\tLARGE_INTEGER freq;\n\tNTSTATUS r;\n\tfreq.QuadPart = 1000LL;\n\tr = copy_to_user( PerformanceCount, &now, sizeof now );\n\tif (r < STATUS_SUCCESS)\n\t\treturn r;\n\tr = copy_to_user( PerformanceFrequency, &freq, sizeof freq );\n\treturn r;\n}\n\nNTSTATUS NTAPI NtAllocateLocallyUniqueId(\n\tPLUID Luid)\n{\n\tstatic LARGE_INTEGER id;\n\tLUID luid;\n\tluid.HighPart = id.QuadPart >> 32;\n\tluid.LowPart = id.QuadPart & 0xffffffffLL;\n\tNTSTATUS r = copy_to_user( Luid, &luid, sizeof luid );\n\tif (r == STATUS_SUCCESS)\n\t\tid.QuadPart++;\n\treturn r;\n}\n\nNTSTATUS NTAPI NtQueryDebugFilterState(\n\tULONG Component,\n\tULONG Level)\n{\n\tdprintf(\"%08lx %08lx\\n\", Component, Level);\n\treturn STATUS_SUCCESS;\n}\n<commit_msg>Improve upon starting the debugger when minitris quits...<commit_after>\/*\n * nt loader\n *\n * Copyright 2006-2008 Mike McCormack\n *\n * This library is free software; you can redistribute it and\/or\n * modify it under the terms of the GNU Lesser General Public\n * License as published by the Free Software Foundation; either\n * version 2.1 of the License, or (at your option) any later version.\n *\n * This library is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU\n * Lesser General Public License for more details.\n *\n * You should have received a copy of the GNU Lesser General Public\n * License along with this library; if not, write to the Free Software\n * Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301, USA\n *\/\n\n\n#include <stdarg.h>\n#include <stdlib.h>\n#include <stdio.h>\n\n#include \"ntstatus.h\"\n#define WIN32_NO_STATUS\n#include \"windef.h\"\n#include \"winternl.h\"\n\n#include \"debug.h\"\n#include \"object.h\"\n#include \"mem.h\"\n#include \"ntcall.h\"\n#include \"timer.h\"\n\nNTSTATUS copy_to_user( void *dest, const void *src, size_t len )\n{\n\treturn current->copy_to_user( dest, src, len );\n}\n\nNTSTATUS copy_from_user( void *dest, const void *src, size_t len )\n{\n\treturn current->copy_from_user( dest, src, len );\n}\n\nNTSTATUS verify_for_write( void *dest, size_t len )\n{\n\treturn current->verify_for_write( dest, len );\n}\n\nNTSTATUS NTAPI NtRaiseHardError(\n\tNTSTATUS Status,\n\tULONG NumberOfArguments,\n\tULONG StringArgumentsMask,\n\tPULONG Arguments,\n\tHARDERROR_RESPONSE_OPTION ResponseOption,\n\tPHARDERROR_RESPONSE Response)\n{\n\tNTSTATUS r;\n\tULONG i;\n\n\tdprintf(\"%08lx %lu %lu %p %u %p\\n\", Status, NumberOfArguments,\n\t\t\tStringArgumentsMask, Arguments, ResponseOption, Response);\n\n\tif (NumberOfArguments>32)\n\t\treturn STATUS_INVALID_PARAMETER;\n\n\t\/\/ set color to white on blue - appologies for the lame hack ;)\n\tfprintf(stderr, \"\\x1b[37;44m\");\n\tfprintf(stderr, \"Hard error (Blue screen of death!):\\n\");\n\tfor (i=0; i<NumberOfArguments; i++)\n\t{\n\t\tvoid *arg;\n\n\t\tr = copy_from_user( &arg, &Arguments[i], sizeof (PUNICODE_STRING) );\n\t\tif (r < STATUS_SUCCESS)\n\t\t\tbreak;\n\n\t\tif (StringArgumentsMask & (1<<i))\n\t\t{\n\t\t\tchar buffer[0x100];\n\t\t\tunicode_string_t us;\n\n\t\t\tr = us.copy_from_user( (UNICODE_STRING*) arg );\n\t\t\tif (r < STATUS_SUCCESS)\n\t\t\t\tbreak;\n\n\t\t\tus.wchar_to_utf8( buffer, sizeof buffer );\n\t\t\tfprintf(stderr, \"arg[%ld]: %s\\n\", i, buffer);\n\t\t}\n\t\telse\n\t\t\tfprintf(stderr, \"arg[%ld]: %08lx\\n\", i, (ULONG)arg);\n\t}\n\t\/\/ restore the color\n\tfprintf(stderr, \"\\x1b[0m\");\n\n\texit(1);\n\n\treturn STATUS_SUCCESS;\n}\n\n#define SET_INFO_LENGTH(len, item) \\\n\tdo { \\\n\t\t(len) = sizeof (item); \\\n\t\tif ((len) < SystemInformationLength) \\\n\t\t\treturn STATUS_INFO_LENGTH_MISMATCH; \\\n\t\t(len) = SystemInformationLength; \\\n\t} while (0)\n\nNTSTATUS NTAPI NtQuerySystemInformation(\n\tSYSTEM_INFORMATION_CLASS SystemInformationClass,\n\tPVOID SystemInformation,\n\tULONG SystemInformationLength,\n\tPULONG ReturnLength )\n{\n\tNTSTATUS r = STATUS_SUCCESS;\n\tunion {\n\t\tSYSTEM_BASIC_INFORMATION basic;\n\t\tSYSTEM_CPU_INFORMATION cpu;\n\t\tSYSTEM_THREAD_INFORMATION thread;\n\t\tSYSTEM_TIME_OF_DAY_INFORMATION time_of_day;\n\t\tSYSTEM_RANGE_START_INFORMATION range_start;\n\t\tSYSTEM_GLOBAL_FLAG global_flag;\n\t\tSYSTEM_KERNEL_DEBUGGER_INFORMATION kernel_debugger_info;\n\t\tSYSTEM_PERFORMANCE_INFORMATION performance_info;\n\t\tSYSTEM_CRASH_DUMP_STATE_INFORMATION crash_dump_info;\n\t} info;\n\tULONG len = 0;\n\n\tdprintf(\"%d %p %lu %p\\n\", SystemInformationClass, SystemInformation,\n\t\t\tSystemInformationLength, ReturnLength);\n\n\tif (ReturnLength)\n\t{\n\t\tr = copy_to_user( ReturnLength, &len, sizeof len );\n\t\tif (r < STATUS_SUCCESS)\n\t\t\treturn r;\n\t}\n\n\tmemset( &info, 0, sizeof info );\n\n\tswitch( SystemInformationClass )\n\t{\n\tcase SystemBasicInformation:\n\t\tSET_INFO_LENGTH( len, info.basic );\n\t\tinfo.basic.dwUnknown1 = 0;\n\t\tinfo.basic.uKeMaximumIncrement = 0x18730;\n\t\tinfo.basic.uPageSize = 0x1000;\n\t\tinfo.basic.uMmNumberOfPhysicalPages = 0xbf6c;\n\t\tinfo.basic.uMmLowestPhysicalPage = 1;\n\t\tinfo.basic.uMmHighestPhysicalPage = 0xbfdf;\n\t\tinfo.basic.uAllocationGranularity = 0x1000;\n\t\tinfo.basic.pLowestUserAddress = (void*)0x1000;\n\t\tinfo.basic.pMmHighestUserAddress = (void*)0x7ffeffff;\n\t\tinfo.basic.uKeActiveProcessors = 1;\n\t\tinfo.basic.uKeNumberProcessors = 1;\n\t\tbreak;\n\n\tcase SystemCpuInformation:\n\t\tSET_INFO_LENGTH( len, info.cpu );\n\t\tinfo.cpu.Architecture = 0;\n\t\tinfo.cpu.Level = 6;\n\t\tinfo.cpu.Revision = 0x0801;\n\t\tinfo.cpu.FeatureSet = 0x2fff;\n\t\tbreak;\n\n\tcase SystemTimeOfDayInformation:\n\t\tSET_INFO_LENGTH( len, info.time_of_day );\n\t\tget_system_time_of_day( info.time_of_day );\n\t\tbreak;\n\n\tcase SystemRangeStartInformation:\n\t\tSET_INFO_LENGTH( len, info.range_start );\n\t\tinfo.range_start.SystemRangeStart = (PVOID) 0x80000000;\n\t\tbreak;\n\n\tcase SystemGlobalFlag:\n\t\tSET_INFO_LENGTH( len, info.global_flag );\n\t\tinfo.global_flag.GlobalFlag = 0;\n\t\tif (option_trace)\n\t\t\tinfo.global_flag.GlobalFlag |= FLG_SHOW_LDR_SNAPS | FLG_ENABLE_CSRDEBUG;\n\t\tbreak;\n\n\tcase SystemKernelDebuggerInformation:\n\t\tSET_INFO_LENGTH( len, info.kernel_debugger_info );\n\t\tinfo.kernel_debugger_info.DebuggerEnabled = FALSE;\n\t\tinfo.kernel_debugger_info.DebuggerNotPresent = TRUE;\n\t\tbreak;\n\n\tcase SystemPerformanceInformation:\n\t\tSET_INFO_LENGTH( len, info.performance_info );\n\t\tinfo.performance_info.AvailablePages = 0x80000; \/\/ 512Mb\n\t\tbreak;\n\n\tcase SystemCrashDumpStateInformation:\n\t\tSET_INFO_LENGTH( len, info.crash_dump_info );\n\t\tinfo.crash_dump_info.CrashDumpSectionExists = 0;\n\t\tinfo.crash_dump_info.Unknown = 0;\n\t\tbreak;\n\n\tdefault:\n\t\tdprintf(\"SystemInformationClass = %d not handled\\n\", SystemInformationClass);\n\t\tr = STATUS_INVALID_INFO_CLASS;\n\t}\n\n\tr = copy_to_user( SystemInformation, &info, len );\n\tif (ReturnLength)\n\t\tr = copy_to_user( ReturnLength, &len, sizeof len );\n\n\treturn r;\n}\n\nNTSTATUS NTAPI NtSetSystemInformation(\n\tSYSTEM_INFORMATION_CLASS SystemInformationClass,\n\tPVOID SystemInformation,\n\tULONG SystemInformationLength )\n{\n\tdprintf(\"%d %p %lu\\n\", SystemInformationClass, SystemInformation, SystemInformationLength );\n\treturn STATUS_SUCCESS;\n}\n\nNTSTATUS NTAPI NtFlushInstructionCache(\n\tHANDLE Process,\n\tPVOID BaseAddress,\n\tSIZE_T NumberOfBytesToFlush )\n{\n\tdprintf(\"%p %p %08lx\\n\", Process, BaseAddress, NumberOfBytesToFlush);\n\treturn STATUS_SUCCESS;\n}\n\nNTSTATUS NTAPI NtDisplayString( PUNICODE_STRING String )\n{\n\tunicode_string_t us;\n\tNTSTATUS r;\n\n\tr = us.copy_from_user( String );\n\tif (r < STATUS_SUCCESS)\n\t\treturn r;\n\n\tdprintf(\"%pus\\n\", &us );\n\n\treturn STATUS_SUCCESS;\n}\n\nNTSTATUS NTAPI NtCreatePagingFile(\n\tPUNICODE_STRING FileName,\n\tPULARGE_INTEGER InitialSize,\n\tPULARGE_INTEGER MaximumSize,\n\tULONG Reserved)\n{\n\tunicode_string_t us;\n\tNTSTATUS r;\n\n\tr = us.copy_from_user( FileName );\n\tif (r < STATUS_SUCCESS)\n\t\treturn r;\n\n\tULARGE_INTEGER init_sz, max_sz;\n\n\tr = copy_from_user( &init_sz, InitialSize, sizeof init_sz );\n\tif (r < STATUS_SUCCESS)\n\t\treturn r;\n\n\tr = copy_from_user( &max_sz, MaximumSize, sizeof max_sz );\n\tif (r < STATUS_SUCCESS)\n\t\treturn r;\n\n\tdprintf(\"unimplemented - %pus %llu %llu %08lx\\n\",\n\t\t\t &us, init_sz.QuadPart, max_sz.QuadPart, Reserved);\n\n\treturn STATUS_SUCCESS;\n}\n\nNTSTATUS NTAPI NtShutdownSystem(\n\tSHUTDOWN_ACTION Action)\n{\n\tconst char *action = 0;\n\tswitch (Action)\n\t{\n\tcase ShutdownNoReboot:\n\t\taction = \"ShutdownNoReboot\";\n\t\tbreak;\n\tcase ShutdownReboot:\n\t\taction = \"ShutdownReboot\";\n\t\tbreak;\n\tcase ShutdownPowerOff:\n\t\taction = \"ShutdownPowerOff\";\n\t\tbreak;\n\tdefault:\n\t\treturn STATUS_INVALID_PARAMETER;\n\t}\n\tdprintf(\"%s\\n\", action);\n\texit(1);\n}\n\nNTSTATUS NTAPI NtQueryPerformanceCounter(\n\tPLARGE_INTEGER PerformanceCount,\n\tPLARGE_INTEGER PerformanceFrequency)\n{\n\tLARGE_INTEGER now = timeout_t::current_time();\n\tLARGE_INTEGER freq;\n\tNTSTATUS r;\n\tfreq.QuadPart = 1000LL;\n\tr = copy_to_user( PerformanceCount, &now, sizeof now );\n\tif (r < STATUS_SUCCESS)\n\t\treturn r;\n\tr = copy_to_user( PerformanceFrequency, &freq, sizeof freq );\n\treturn r;\n}\n\nNTSTATUS NTAPI NtAllocateLocallyUniqueId(\n\tPLUID Luid)\n{\n\tstatic LARGE_INTEGER id;\n\tLUID luid;\n\tluid.HighPart = id.QuadPart >> 32;\n\tluid.LowPart = id.QuadPart & 0xffffffffLL;\n\tNTSTATUS r = copy_to_user( Luid, &luid, sizeof luid );\n\tif (r == STATUS_SUCCESS)\n\t\tid.QuadPart++;\n\treturn r;\n}\n\nNTSTATUS NTAPI NtQueryDebugFilterState(\n\tULONG Component,\n\tULONG Level)\n{\n\tdprintf(\"%08lx %08lx\\n\", Component, Level);\n\treturn STATUS_SUCCESS;\n}\n<|endoftext|>"} {"text":"<commit_before>#include \"drake\/solvers\/MosekSolver.h\"\n\n#include <iostream>\n\n#include <Eigen\/Core>\n\n#include \"gtest\/gtest.h\"\n\n#include \"drake\/util\/testUtil.h\"\n#include \"drake\/solvers\/MathematicalProgram.h\"\n#include \"drake\/solvers\/Optimization.h\"\n#include \"drake\/util\/eigen_matrix_compare.h\"\n#include \"drake\/solvers\/Constraint.h\"\n\n\nusing drake::util::MatrixCompareType;\nnamespace drake {\nnamespace solvers {\nnamespace {\n\nGTEST_TEST(testMosek, MosekLinearProgram) {\n \/\/ Taken from http:\/\/docs.mosek.com\/7.1\/capi\/Linear_optimization.html\n OptimizationProblem prog;\n auto x = prog.AddContinuousVariables(4);\n Eigen::Vector4d A;\n A << 3, 1, 5, 1;\n LinearConstraint obj(A, Eigen::Vector4d::Constant(0),\n Eigen::Vector4d::Constant(0));\n std::shared_ptr<LinearConstraint> ptrtoobj =\n std::make_shared<LinearConstraint>(obj);\n\n prog.AddCost(ptrtoobj);\n Eigen::MatrixXd constraint1(1, 4);\n Eigen::MatrixXd constraint2(1, 4);\n constraint1 << 2, 1, 3, 1;\n constraint2 << 0, 2, 0, 3;\n Eigen::MatrixXd lineqconstraint(1,4);\n lineqconstraint << 3, 1, 2, 0;\n Eigen::MatrixXd lb1(1, 1), ub1(1, 1);\n Eigen::MatrixXd lb2(1, 1), ub2(1, 1);\n lb1 << 15;\n ub1 << +std::numeric_limits<double>::infinity();\n lb2 << -std::numeric_limits<double>::infinity();\n ub2 << 25;\n Eigen::MatrixXd lineqbounds(1,1);\n lineqbounds << 30;\n\n prog.AddLinearConstraint(constraint1, lb1, ub1);\n prog.AddLinearConstraint(constraint2, lb2, ub2);\n prog.AddLinearEqualityConstraint(lineqconstraint, lineqbounds);\n Eigen::Vector4d bboxlow, bboxhigh;\n bboxlow << 0, 0, 0, 0;\n bboxhigh << std::numeric_limits<double>::infinity(),\n 10,\n std::numeric_limits<double>::infinity(),\n std::numeric_limits<double>::infinity();\n prog.AddBoundingBoxConstraint(bboxlow, bboxhigh);\n prog.SetSolverOption(\"Mosek\", \"maxormin\", \"max\");\n prog.SetSolverOption(\"Mosek\", \"problemtype\", \"linear\");\n SolutionResult result = SolutionResult::kUnknownError;\n MosekSolver msk;\n ASSERT_NO_THROW(result = msk.Solve(prog)) << \"Using solver: Mosek\";\n EXPECT_EQ(result, SolutionResult::kSolutionFound) << \"Using solver: Mosek\";\n Eigen::Vector4d solutions;\n solutions << 0, 0, 15, 8.33333333333333333333;\n EXPECT_TRUE(CompareMatrices(solutions, x.value(), 1e-10,\n MatrixCompareType::absolute));\n}\n\n}\n}\n}\n<commit_msg>Added spaces between commas in parenthesis.<commit_after>#include \"drake\/solvers\/MosekSolver.h\"\n\n#include <iostream>\n\n#include <Eigen\/Core>\n\n#include \"gtest\/gtest.h\"\n\n#include \"drake\/util\/testUtil.h\"\n#include \"drake\/solvers\/MathematicalProgram.h\"\n#include \"drake\/solvers\/Optimization.h\"\n#include \"drake\/util\/eigen_matrix_compare.h\"\n#include \"drake\/solvers\/Constraint.h\"\n\n\nusing drake::util::MatrixCompareType;\nnamespace drake {\nnamespace solvers {\nnamespace {\n\nGTEST_TEST(testMosek, MosekLinearProgram) {\n \/\/ Taken from http:\/\/docs.mosek.com\/7.1\/capi\/Linear_optimization.html\n OptimizationProblem prog;\n auto x = prog.AddContinuousVariables(4);\n Eigen::Vector4d A;\n A << 3, 1, 5, 1;\n LinearConstraint obj(A, Eigen::Vector4d::Constant(0),\n Eigen::Vector4d::Constant(0));\n std::shared_ptr<LinearConstraint> ptrtoobj =\n std::make_shared<LinearConstraint>(obj);\n\n prog.AddCost(ptrtoobj);\n Eigen::MatrixXd constraint1(1, 4);\n Eigen::MatrixXd constraint2(1, 4);\n constraint1 << 2, 1, 3, 1;\n constraint2 << 0, 2, 0, 3;\n Eigen::MatrixXd lineqconstraint(1, 4);\n lineqconstraint << 3, 1, 2, 0;\n Eigen::MatrixXd lb1(1, 1), ub1(1, 1);\n Eigen::MatrixXd lb2(1, 1), ub2(1, 1);\n lb1 << 15;\n ub1 << +std::numeric_limits<double>::infinity();\n lb2 << -std::numeric_limits<double>::infinity();\n ub2 << 25;\n Eigen::MatrixXd lineqbounds(1, 1);\n lineqbounds << 30;\n\n prog.AddLinearConstraint(constraint1, lb1, ub1);\n prog.AddLinearConstraint(constraint2, lb2, ub2);\n prog.AddLinearEqualityConstraint(lineqconstraint, lineqbounds);\n Eigen::Vector4d bboxlow, bboxhigh;\n bboxlow << 0, 0, 0, 0;\n bboxhigh << std::numeric_limits<double>::infinity(),\n 10,\n std::numeric_limits<double>::infinity(),\n std::numeric_limits<double>::infinity();\n prog.AddBoundingBoxConstraint(bboxlow, bboxhigh);\n prog.SetSolverOption(\"Mosek\", \"maxormin\", \"max\");\n prog.SetSolverOption(\"Mosek\", \"problemtype\", \"linear\");\n SolutionResult result = SolutionResult::kUnknownError;\n MosekSolver msk;\n ASSERT_NO_THROW(result = msk.Solve(prog)) << \"Using solver: Mosek\";\n EXPECT_EQ(result, SolutionResult::kSolutionFound) << \"Using solver: Mosek\";\n Eigen::Vector4d solutions;\n solutions << 0, 0, 15, 8.33333333333333333333;\n EXPECT_TRUE(CompareMatrices(solutions, x.value(), 1e-10,\n MatrixCompareType::absolute));\n}\n\n}\n}\n}\n<|endoftext|>"} {"text":"<commit_before>#include <sstream>\n#include <map>\n\n#include \"gtest\/gtest.h\"\n\n#include \"drake\/util\/Polynomial.h\"\n#include \"drake\/util\/TrigPoly.h\"\n\nusing namespace Eigen;\nusing namespace std;\n\nnamespace drake {\nnamespace util {\nnamespace {\n\ntypedef std::map<TrigPolyd::VarType, double> MapType;\nconst double kPi = 3.1415926535897;\n\nvoid test_serialization(TrigPolyd dut, std::string expect) {\n std::stringstream test_stream;\n test_stream << dut;\n EXPECT_EQ(test_stream.str(), expect);\n}\n\nTEST(TrigPolyTest, SmokeTest) {\n \/\/ Confirm that these conversions compile okay.\n TrigPolyd x(1.0);\n TrigPolyd y = 2.0;\n TrigPolyd z = 3;\n\n \/\/ Test something else.\n Polynomiald q(\"q\");\n Polynomiald s(\"s\");\n Polynomiald c(\"c\");\n\n TrigPolyd p(q, s, c);\n\n test_serialization(p, \"q1\");\n test_serialization(sin(p), \"s1\");\n test_serialization(cos(p), \"c1\");\n test_serialization(sin(p) * p * p + cos(p), \"s1*q1^2+c1\");\n test_serialization(sin(p + p), \"s1*c1+c1*s1\");\n}\n\nTEST(TrigPolyTest, EvaluateMultivariateTest) {\n const TrigPolyd theta(Polynomiald(\"th\"),\n Polynomiald(\"sth\"), Polynomiald(\"cth\"));\n const TrigPolyd::VarType theta_var =\n theta.getPolynomial().getSimpleVariable();\n\n \/\/ Check some basic evaluations.\n EXPECT_EQ(theta.evaluateMultivariate(MapType {{theta_var, 1}}), 1);\n EXPECT_EQ(sin(theta).evaluateMultivariate(MapType {{theta_var, 0}}), 0);\n EXPECT_EQ(cos(theta).evaluateMultivariate(MapType {{theta_var, 0}}), 1);\n\n \/\/ Test that the pythagorean theorem is true for various angles.\n for (const double angle : {0.2, 0.4, 0.6, 0.8, 1.0, 1.2, 1.4}) {\n EXPECT_NEAR((sin(theta) * sin(theta) + cos(theta) * cos(theta) - 1)\n .evaluateMultivariate(MapType {{theta_var, angle}}),\n 0,\n 1e-6);\n }\n\n \/\/ Test an arbitrary multivariate polynomial.\n const TrigPolyd phi(Polynomiald(\"phi\"),\n Polynomiald(\"sphi\"), Polynomiald(\"cphi\"));\n const TrigPolyd::VarType phi_var = phi.getPolynomial().getSimpleVariable();\n const TrigPolyd multivariate = theta + phi * cos(theta) + sin(phi + theta);\n for (const double theta_value : {0., 1., kPi \/ 4, kPi \/ 2, -kPi \/ 4}) {\n for (const double phi_value : {0., 1., kPi \/ 4, kPi \/ 2, -kPi \/ 4}) {\n EXPECT_NEAR(multivariate.evaluateMultivariate(\n MapType {{theta_var, theta_value}, {phi_var, phi_value}}),\n (theta_value + (phi_value * std::cos(theta_value)) +\n std::sin(phi_value + theta_value)),\n 1e-6) << \"phi: \" << phi_value << \" theta: \" << theta_value;\n }\n }\n}\n\nTEST(TrigPolyTest, EvaluatePartialTest) {\n const TrigPolyd theta(Polynomiald(\"th\"),\n Polynomiald(\"sth\"), Polynomiald(\"cth\"));\n const TrigPolyd::VarType theta_var =\n theta.getPolynomial().getSimpleVariable();\n const TrigPolyd phi(Polynomiald(\"phi\"),\n Polynomiald(\"sphi\"), Polynomiald(\"cphi\"));\n const TrigPolyd::VarType phi_var = phi.getPolynomial().getSimpleVariable();\n const TrigPolyd multivariate = theta + phi * cos(theta) + sin(phi + theta);\n\n EXPECT_EQ(multivariate.evaluatePartial(MapType {{theta_var, 0}}),\n phi + sin(phi));\n}\n\n} \/\/ anonymous namespace\n} \/\/ namespace test\n} \/\/ namespace drake\n<commit_msg>Add a couple more tests.<commit_after>#include <sstream>\n#include <map>\n\n#include \"gtest\/gtest.h\"\n\n#include \"drake\/util\/Polynomial.h\"\n#include \"drake\/util\/TrigPoly.h\"\n\nusing namespace Eigen;\nusing namespace std;\n\nnamespace drake {\nnamespace util {\nnamespace {\n\ntypedef std::map<TrigPolyd::VarType, double> MapType;\nconst double kPi = 3.1415926535897;\n\nvoid test_serialization(TrigPolyd dut, std::string expect) {\n std::stringstream test_stream;\n test_stream << dut;\n EXPECT_EQ(test_stream.str(), expect);\n}\n\nTEST(TrigPolyTest, SmokeTest) {\n \/\/ Confirm that these conversions compile okay.\n TrigPolyd x(1.0);\n TrigPolyd y = 2.0;\n TrigPolyd z = 3;\n\n \/\/ Test something else.\n Polynomiald q(\"q\");\n Polynomiald s(\"s\");\n Polynomiald c(\"c\");\n\n TrigPolyd p(q, s, c);\n\n test_serialization(p, \"q1\");\n test_serialization(sin(p), \"s1\");\n test_serialization(cos(p), \"c1\");\n test_serialization(sin(p) * p * p + cos(p), \"s1*q1^2+c1\");\n test_serialization(sin(p + p), \"s1*c1+c1*s1\");\n}\n\nTEST(TrigPolyTest, EvaluateMultivariateTest) {\n const TrigPolyd theta(Polynomiald(\"th\"),\n Polynomiald(\"sth\"), Polynomiald(\"cth\"));\n const TrigPolyd::VarType theta_var =\n theta.getPolynomial().getSimpleVariable();\n\n \/\/ Check some basic evaluations.\n EXPECT_EQ(theta.evaluateMultivariate(MapType {{theta_var, 1}}), 1);\n EXPECT_EQ(sin(theta).evaluateMultivariate(MapType {{theta_var, 0}}), 0);\n EXPECT_EQ(cos(theta).evaluateMultivariate(MapType {{theta_var, 0}}), 1);\n\n \/\/ Test that the pythagorean theorem is true for various angles.\n for (const double angle : {0.2, 0.4, 0.6, 0.8, 1.0, 1.2, 1.4}) {\n EXPECT_NEAR((sin(theta) * sin(theta) + cos(theta) * cos(theta) - 1)\n .evaluateMultivariate(MapType {{theta_var, angle}}),\n 0,\n 1e-6);\n }\n\n \/\/ Test an arbitrary multivariate polynomial.\n const TrigPolyd phi(Polynomiald(\"phi\"),\n Polynomiald(\"sphi\"), Polynomiald(\"cphi\"));\n const TrigPolyd::VarType phi_var = phi.getPolynomial().getSimpleVariable();\n const TrigPolyd multivariate = theta + phi * cos(theta) + sin(phi + theta);\n for (const double theta_value : {0., 1., kPi \/ 4, kPi \/ 2, -kPi \/ 4}) {\n for (const double phi_value : {0., 1., kPi \/ 4, kPi \/ 2, -kPi \/ 4}) {\n EXPECT_NEAR(multivariate.evaluateMultivariate(\n MapType {{theta_var, theta_value}, {phi_var, phi_value}}),\n (theta_value + (phi_value * std::cos(theta_value)) +\n std::sin(phi_value + theta_value)),\n 1e-6) << \"phi: \" << phi_value << \" theta: \" << theta_value;\n }\n }\n}\n\nTEST(TrigPolyTest, EvaluatePartialTest) {\n const TrigPolyd theta(Polynomiald(\"th\"),\n Polynomiald(\"sth\"), Polynomiald(\"cth\"));\n const TrigPolyd::VarType theta_var =\n theta.getPolynomial().getSimpleVariable();\n const TrigPolyd phi(Polynomiald(\"phi\"),\n Polynomiald(\"sphi\"), Polynomiald(\"cphi\"));\n const TrigPolyd::VarType phi_var = phi.getPolynomial().getSimpleVariable();\n const TrigPolyd multivariate = theta + phi * cos(theta) + sin(phi + theta);\n\n EXPECT_EQ(multivariate.evaluatePartial(MapType {{theta_var, 0}}),\n phi + sin(phi));\n EXPECT_EQ(multivariate.evaluatePartial(MapType {{phi_var, 0}}),\n theta + sin(theta));\n \/\/ TODO(#2216) This fails due to a known drake bug:\n#if 0\n EXPECT_EQ(multivariate.evaluatePartial(MapType {{phi_var, 1}}),\n theta + cos(theta) + sin(theta + 1));\n#endif\n}\n\n} \/\/ anonymous namespace\n} \/\/ namespace test\n} \/\/ namespace drake\n<|endoftext|>"} {"text":"<commit_before>\/*\n\nCopyright (c) 2006, Arvid Norberg\nAll rights reserved.\n\nRedistribution and use in source and binary forms, with or without\nmodification, are permitted provided that the following conditions\nare met:\n\n * Redistributions of source code must retain the above copyright\n notice, this list of conditions and the following disclaimer.\n * Redistributions in binary form must reproduce the above copyright\n notice, this list of conditions and the following disclaimer in\n the documentation and\/or other materials provided with the distribution.\n * Neither the name of the author nor the names of its\n contributors may be used to endorse or promote products derived\n from this software without specific prior written permission.\n\nTHIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS \"AS IS\"\nAND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE\nIMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE\nARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE\nLIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR\nCONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF\nSUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS\nINTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN\nCONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)\nARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE\nPOSSIBILITY OF SUCH DAMAGE.\n\n*\/\n\n#include \"libtorrent\/entry.hpp\"\n#include \"libtorrent\/bencode.hpp\"\n#include \"libtorrent\/torrent_info.hpp\"\n#include \"libtorrent\/file.hpp\"\n#include \"libtorrent\/storage.hpp\"\n#include \"libtorrent\/hasher.hpp\"\n#include \"libtorrent\/create_torrent.hpp\"\n#include \"libtorrent\/file.hpp\"\n\n#include <boost\/bind.hpp>\n\nusing namespace libtorrent;\n\n\/\/ do not include files and folders whose\n\/\/ name starts with a .\nbool file_filter(std::string const& f)\n{\n\tif (filename(f)[0] == '.') return false;\n\tfprintf(stderr, \"%s\\n\", f.c_str());\n\treturn true;\n}\n\nvoid print_progress(int i, int num)\n{\n\tfprintf(stderr, \"\\r%d\/%d\", i+1, num);\n}\n\nvoid print_usage()\n{\n\tfputs(\"usage: make_torrent FILE [OPTIONS]\\n\"\n\t\t\"\\n\"\n\t\t\"Generates a torrent file from the specified file\\n\"\n\t\t\"or directory and writes it to standard out\\n\\n\"\n\t\t\"OPTIONS:\\n\"\n\t\t\"-m generate a merkle hash tree torrent.\\n\"\n\t\t\" merkle torrents require client support\\n\"\n\t\t\"-w url adds a web seed to the torrent with\\n\"\n\t\t\" the specified url\\n\"\n\t\t\"-t url adds the specified tracker to the\\n\"\n\t\t\" torrent\\n\"\n\t\t\"-p bytes enables padding files. Files larger\\n\"\n\t\t\" than bytes will be piece-aligned\\n\"\n\t\t\"-s bytes specifies a piece size for the torrent\\n\"\n\t\t\" This has to be a multiple of 16 kiB\\n\"\n\t\t, stderr);\n}\n\nint main(int argc, char* argv[])\n{\n\tusing namespace libtorrent;\n\n\tchar const* creator_str = \"libtorrent\";\n\n\tif (argc < 2)\n\t{\n\t\tprint_usage();\n\t\treturn 1;\n\t}\n\n#ifndef BOOST_NO_EXCEPTIONS\n\ttry\n\t{\n#endif\n\t\tstd::vector<std::string> web_seeds;\n\t\tstd::vector<std::string> trackers;\n\t\tint pad_file_limit = -1;\n\t\tint piece_size = 0;\n\t\tint flags = 0;\n\n\t\tfor (int i = 2; i < argc; ++i)\n\t\t{\n\t\t\tif (argv[i][0] != '-')\n\t\t\t{\n\t\t\t\tprint_usage();\n\t\t\t\treturn 1;\n\t\t\t}\n\n\t\t\tswitch (argv[i][1])\n\t\t\t{\n\t\t\t\tcase 'w':\n\t\t\t\t\t++i;\n\t\t\t\t\tweb_seeds.push_back(argv[i]);\n\t\t\t\t\tbreak;\n\t\t\t\tcase 't':\n\t\t\t\t\t++i;\n\t\t\t\t\ttrackers.push_back(argv[i]);\n\t\t\t\t\tbreak;\n\t\t\t\tcase 'p':\n\t\t\t\t\t++i;\n\t\t\t\t\tpad_file_limit = atoi(argv[i]);\n\t\t\t\t\tflags |= create_torrent::optimize;\n\t\t\t\t\tbreak;\n\t\t\t\tcase 's':\n\t\t\t\t\t++i;\n\t\t\t\t\tpiece_size = atoi(argv[i]);\n\t\t\t\t\tbreak;\n\t\t\t\tcase 'm':\n\t\t\t\t\tflags |= create_torrent::merkle;\n\t\t\t\t\tbreak;\n\t\t\t\tdefault:\n\t\t\t\t\tprint_usage();\n\t\t\t\t\treturn 1;\n\t\t\t}\n\t\t}\n\n\t\tfile_storage fs;\n\t\tfile_pool fp;\n\t\tstd::string full_path = libtorrent::complete(argv[1]);\n\n\t\tadd_files(fs, full_path, file_filter);\n\t\tif (fs.num_files() == 0)\n\t\t{\n\t\t\tfputs(\"no files specified.\\n\", stderr);\n\t\t\treturn 1;\n\t\t}\n\n\t\tcreate_torrent t(fs, piece_size, pad_file_limit, flags);\n\t\tfor (std::vector<std::string>::iterator i = trackers.begin()\n\t\t\t, end(trackers.end()); i != end; ++i)\n\t\t\tt.add_tracker(*i);\n\n\t\tfor (std::vector<std::string>::iterator i = web_seeds.begin()\n\t\t\t, end(web_seeds.end()); i != end; ++i)\n\t\t\tt.add_url_seed(*i);\n\n\t\terror_code ec;\n\t\tset_piece_hashes(t, parent_path(full_path)\n\t\t\t, boost::bind(&print_progress, _1, t.num_pieces()), ec);\n\t\tif (ec)\n\t\t{\n\t\t\tfprintf(stderr, \"%s\\n\", ec.message().c_str());\n\t\t\treturn 1;\n\t\t}\n\n\t\tfprintf(stderr, \"\\n\");\n\t\tt.set_creator(creator_str);\n\n\t\t\/\/ create the torrent and print it to stdout\n\t\tstd::vector<char> torrent;\n\t\tbencode(back_inserter(torrent), t.generate());\n\t\tfwrite(&torrent[0], 1, torrent.size(), stdout);\n\n#ifndef BOOST_NO_EXCEPTIONS\n\t}\n\tcatch (std::exception& e)\n\t{\n\t\tfprintf(stderr, \"%s\\n\", e.what());\n\t}\n#endif\n\n\treturn 0;\n}\n\n<commit_msg>never write binary data to stdout on windows<commit_after>\/*\n\nCopyright (c) 2006, Arvid Norberg\nAll rights reserved.\n\nRedistribution and use in source and binary forms, with or without\nmodification, are permitted provided that the following conditions\nare met:\n\n * Redistributions of source code must retain the above copyright\n notice, this list of conditions and the following disclaimer.\n * Redistributions in binary form must reproduce the above copyright\n notice, this list of conditions and the following disclaimer in\n the documentation and\/or other materials provided with the distribution.\n * Neither the name of the author nor the names of its\n contributors may be used to endorse or promote products derived\n from this software without specific prior written permission.\n\nTHIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS \"AS IS\"\nAND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE\nIMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE\nARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE\nLIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR\nCONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF\nSUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS\nINTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN\nCONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)\nARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE\nPOSSIBILITY OF SUCH DAMAGE.\n\n*\/\n\n#include \"libtorrent\/entry.hpp\"\n#include \"libtorrent\/bencode.hpp\"\n#include \"libtorrent\/torrent_info.hpp\"\n#include \"libtorrent\/file.hpp\"\n#include \"libtorrent\/storage.hpp\"\n#include \"libtorrent\/hasher.hpp\"\n#include \"libtorrent\/create_torrent.hpp\"\n#include \"libtorrent\/file.hpp\"\n\n#include <boost\/bind.hpp>\n\nusing namespace libtorrent;\n\n\/\/ do not include files and folders whose\n\/\/ name starts with a .\nbool file_filter(std::string const& f)\n{\n\tif (filename(f)[0] == '.') return false;\n\tfprintf(stderr, \"%s\\n\", f.c_str());\n\treturn true;\n}\n\nvoid print_progress(int i, int num)\n{\n\tfprintf(stderr, \"\\r%d\/%d\", i+1, num);\n}\n\nvoid print_usage()\n{\n\tfputs(\"usage: make_torrent FILE [OPTIONS]\\n\"\n\t\t\"\\n\"\n\t\t\"Generates a torrent file from the specified file\\n\"\n\t\t\"or directory and writes it to standard out\\n\\n\"\n\t\t\"OPTIONS:\\n\"\n\t\t\"-m generate a merkle hash tree torrent.\\n\"\n\t\t\" merkle torrents require client support\\n\"\n\t\t\"-w url adds a web seed to the torrent with\\n\"\n\t\t\" the specified url\\n\"\n\t\t\"-t url adds the specified tracker to the\\n\"\n\t\t\" torrent\\n\"\n\t\t\"-p bytes enables padding files. Files larger\\n\"\n\t\t\" than bytes will be piece-aligned\\n\"\n\t\t\"-s bytes specifies a piece size for the torrent\\n\"\n\t\t\" This has to be a multiple of 16 kiB\\n\"\n\t\t\"-o file specifies the output filename of the torrent file\\n\"\n\t\t\" If this is not specified, the torrent file is\\n\"\n\t\t\" printed to the standard out, except on windows\\n\"\n\t\t\" where the filename defaults to a.torrent\\n\"\n\t\t, stderr);\n}\n\nint main(int argc, char* argv[])\n{\n\tusing namespace libtorrent;\n\n\tchar const* creator_str = \"libtorrent\";\n\n\tif (argc < 2)\n\t{\n\t\tprint_usage();\n\t\treturn 1;\n\t}\n\n#ifndef BOOST_NO_EXCEPTIONS\n\ttry\n\t{\n#endif\n\t\tstd::vector<std::string> web_seeds;\n\t\tstd::vector<std::string> trackers;\n\t\tint pad_file_limit = -1;\n\t\tint piece_size = 0;\n\t\tint flags = 0;\n\n\t\tstd::string outfile;\n#ifdef TORRENT_WINDOWS\n\t\t\/\/ don't ever write binary data to the console on windows\n\t\t\/\/ it will just be interpreted as text and corrupted\n\t\toutfile = \"a.torrent\";\n#endif\n\n\t\tfor (int i = 2; i < argc; ++i)\n\t\t{\n\t\t\tif (argv[i][0] != '-')\n\t\t\t{\n\t\t\t\tprint_usage();\n\t\t\t\treturn 1;\n\t\t\t}\n\n\t\t\tswitch (argv[i][1])\n\t\t\t{\n\t\t\t\tcase 'w':\n\t\t\t\t\t++i;\n\t\t\t\t\tweb_seeds.push_back(argv[i]);\n\t\t\t\t\tbreak;\n\t\t\t\tcase 't':\n\t\t\t\t\t++i;\n\t\t\t\t\ttrackers.push_back(argv[i]);\n\t\t\t\t\tbreak;\n\t\t\t\tcase 'p':\n\t\t\t\t\t++i;\n\t\t\t\t\tpad_file_limit = atoi(argv[i]);\n\t\t\t\t\tflags |= create_torrent::optimize;\n\t\t\t\t\tbreak;\n\t\t\t\tcase 's':\n\t\t\t\t\t++i;\n\t\t\t\t\tpiece_size = atoi(argv[i]);\n\t\t\t\t\tbreak;\n\t\t\t\tcase 'm':\n\t\t\t\t\tflags |= create_torrent::merkle;\n\t\t\t\t\tbreak;\n\t\t\t\tcase 'o':\n\t\t\t\t\t++i;\n\t\t\t\t\toutfile = argv[i];\n\t\t\t\t\tbreak;\n\t\t\t\tdefault:\n\t\t\t\t\tprint_usage();\n\t\t\t\t\treturn 1;\n\t\t\t}\n\t\t}\n\n\t\tfile_storage fs;\n\t\tfile_pool fp;\n\t\tstd::string full_path = libtorrent::complete(argv[1]);\n\n\t\tadd_files(fs, full_path, file_filter);\n\t\tif (fs.num_files() == 0)\n\t\t{\n\t\t\tfputs(\"no files specified.\\n\", stderr);\n\t\t\treturn 1;\n\t\t}\n\n\t\tcreate_torrent t(fs, piece_size, pad_file_limit, flags);\n\t\tfor (std::vector<std::string>::iterator i = trackers.begin()\n\t\t\t, end(trackers.end()); i != end; ++i)\n\t\t\tt.add_tracker(*i);\n\n\t\tfor (std::vector<std::string>::iterator i = web_seeds.begin()\n\t\t\t, end(web_seeds.end()); i != end; ++i)\n\t\t\tt.add_url_seed(*i);\n\n\t\terror_code ec;\n\t\tset_piece_hashes(t, parent_path(full_path)\n\t\t\t, boost::bind(&print_progress, _1, t.num_pieces()), ec);\n\t\tif (ec)\n\t\t{\n\t\t\tfprintf(stderr, \"%s\\n\", ec.message().c_str());\n\t\t\treturn 1;\n\t\t}\n\n\t\tfprintf(stderr, \"\\n\");\n\t\tt.set_creator(creator_str);\n\n\t\t\/\/ create the torrent and print it to stdout\n\t\tstd::vector<char> torrent;\n\t\tbencode(back_inserter(torrent), t.generate());\n\t\tFILE* output = stdout;\n\t\tif (!outfile.empty())\n\t\t\toutput = fopen(outfile.c_str(), \"wb+\");\n\t\tfwrite(&torrent[0], 1, torrent.size(), output);\n\n\t\tif (output != stdout)\n\t\t\tfclose(output);\n\n#ifndef BOOST_NO_EXCEPTIONS\n\t}\n\tcatch (std::exception& e)\n\t{\n\t\tfprintf(stderr, \"%s\\n\", e.what());\n\t}\n#endif\n\n\treturn 0;\n}\n\n<|endoftext|>"} {"text":"<commit_before>\/*=========================================================================\n\n Program: Insight Segmentation & Registration Toolkit\n Module: itkMetaImageIO.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 \"itkMetaImageIO.h\"\n#include \"itkExceptionObject.h\"\n\nnamespace itk\n{\n\nMetaImageIO::MetaImageIO()\n {\n if(MET_SystemByteOrderMSB())\n m_ByteOrder = BigEndian;\n else\n m_ByteOrder = LittleEndian;\n } \n\n\n\nMetaImageIO::~MetaImageIO()\n {\n m_Ifstream.close();\n }\n\n\n\nvoid MetaImageIO::PrintSelf(std::ostream& os, Indent indent) const\n {\n Superclass::PrintSelf(os, indent);\n m_MetaImage.PrintInfo();\n }\n\n\n\/\/ This method will only test if the header looks like a\n\/\/ MetaImage. Some code is redundant with ReadImageInformation\n\/\/ a StateMachine could provide a better implementation\nbool MetaImageIO::CanReadFile( const char* filename ) \n { \n \n std::ifstream inputStream;\n\n inputStream.open( filename, std::ios::in | std::ios::binary );\n\n if( inputStream.fail() )\n {\n return false;\n }\n\n char key[8000];\n\n inputStream >> key;\n\n if( inputStream.eof() )\n {\n inputStream.close();\n return false;\n }\n\n if( strcmp(key,\"NDims\")==0 ) \n {\n inputStream.close();\n return true;\n }\n\n inputStream.close();\n return false;\n\n }\n \n\nvoid MetaImageIO::ReadImageInformation()\n { \n if(!m_MetaImage.Read(m_FileName.c_str()), false)\n {\n ExceptionObject exception(__FILE__, __LINE__);\n exception.SetDescription(\"File cannot be read\");\n throw exception;\n }\n\n if(m_MetaImage.BinaryData())\n {\n this->SetFileType(Binary);\n }\n else\n {\n this->SetFileType(ASCII);\n }\n\n this->SetNumberOfComponents(m_MetaImage.ElementNumberOfChannels());\n\n switch(m_MetaImage.ElementType())\n {\n default:\n case MET_OTHER:\n case MET_NONE:\n this->SetPixelType( UNKNOWN );\n this->SetComponentType( UNKNOWN );\n break;\n case MET_CHAR:\n case MET_CHAR_ARRAY:\n case MET_STRING:\n case MET_ASCII_CHAR:\n this->SetPixelType( CHAR );\n this->SetComponentType( CHAR );\n break;\n case MET_UCHAR:\n case MET_UCHAR_ARRAY:\n this->SetPixelType( UCHAR );\n this->SetComponentType( UCHAR );\n break;\n case MET_SHORT:\n case MET_SHORT_ARRAY:\n this->SetPixelType( SHORT );\n this->SetComponentType( SHORT );\n break;\n case MET_USHORT:\n case MET_USHORT_ARRAY:\n this->SetPixelType( USHORT );\n this->SetComponentType( USHORT );\n break;\n case MET_INT:\n case MET_INT_ARRAY:\n this->SetPixelType( INT );\n this->SetComponentType( INT );\n break;\n case MET_UINT:\n case MET_UINT_ARRAY: \n this->SetPixelType( UINT );\n this->SetComponentType( UINT );\n break;\n case MET_FLOAT:\n case MET_FLOAT_ARRAY: \n this->SetPixelType( FLOAT );\n this->SetComponentType( FLOAT );\n break;\n case MET_DOUBLE:\n case MET_DOUBLE_ARRAY:\n this->SetPixelType( DOUBLE );\n this->SetComponentType( DOUBLE );\n break;\n case MET_FLOAT_MATRIX:\n this->SetPixelType( FLOAT );\n this->SetComponentType( FLOAT );\n this->SetNumberOfComponents(m_NumberOfComponents * m_NumberOfComponents);\n break;\n }\n \n this->SetNumberOfDimensions(m_MetaImage.NDims());\n\n int i;\n for(i=0; i<(int)m_NumberOfDimensions; i++)\n {\n this->SetDimensions(i, m_MetaImage.DimSize(i));\n this->SetSpacing(i, m_MetaImage.ElementSpacing(i));\n this->SetOrigin(i, m_MetaImage.Position(i));\n } \n } \n\n\nvoid MetaImageIO::Read(void* buffer)\n { \n if(!m_MetaImage.Read(m_FileName.c_str(), true, buffer))\n {\n ExceptionObject exception(__FILE__, __LINE__);\n exception.SetDescription(\"File cannot be read\");\n throw exception;\n }\n\n m_MetaImage.ElementByteOrderFix();\n } \n\nMetaImage * MetaImageIO::GetMetaImagePointer(void)\n {\n return & m_MetaImage;\n }\n\nbool MetaImageIO::CanWriteFile(const char*)\n {\n return true;\n }\n\n \nvoid \nMetaImageIO\n::WriteImageInformation(void)\n {\n }\n\n\n\/**\n *\n *\/\nvoid \nMetaImageIO\n::Write( const void* buffer) \n {\n int nDims = this->GetNumberOfDimensions();\n\n bool binaryData = false;\n if(this->GetFileType() == Binary)\n {\n binaryData = true;\n }\n\n int nChannels = this->GetNumberOfComponents();\n\n MET_ValueEnumType eType = MET_OTHER;\n switch(m_PixelType)\n {\n default:\n case UNKNOWN:\n eType = MET_OTHER;\n break;\n case CHAR:\n eType = MET_CHAR;\n break;\n case UCHAR:\n eType = MET_UCHAR;\n break;\n case SHORT:\n eType = MET_SHORT;\n break;\n case USHORT:\n eType = MET_USHORT;\n break;\n case INT:\n eType = MET_INT;\n break;\n case UINT:\n eType = MET_UINT;\n break;\n case FLOAT:\n eType = MET_FLOAT;\n break;\n case DOUBLE:\n eType = MET_DOUBLE;\n break;\n }\n \n int i;\n int * dSize = new int[nDims];\n float * eSpacing = new float[nDims];\n float * eOrigin = new float[nDims];\n for(i=0; i<nDims; i++)\n {\n dSize[i] = this->GetDimensions(i);\n eSpacing[i] = this->GetSpacing(i);\n eOrigin[i] = this->GetOrigin(i);\n } \n\n m_MetaImage.InitializeEssential(nDims, dSize, eSpacing, eType, nChannels,\n (void *)buffer);\n m_MetaImage.Position(eOrigin);\n m_MetaImage.BinaryData(binaryData);\n\n m_MetaImage.Write(m_FileName.c_str());\n } \n\n\n\n\n\n} \/\/ end namespace itk\n<commit_msg>BUG: Better heuristic for detecting if file can be read<commit_after>\/*=========================================================================\n\n Program: Insight Segmentation & Registration Toolkit\n Module: itkMetaImageIO.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 \"itkMetaImageIO.h\"\n#include \"itkExceptionObject.h\"\n\nnamespace itk\n{\n\nMetaImageIO::MetaImageIO()\n {\n if(MET_SystemByteOrderMSB())\n m_ByteOrder = BigEndian;\n else\n m_ByteOrder = LittleEndian;\n } \n\n\n\nMetaImageIO::~MetaImageIO()\n {\n m_Ifstream.close();\n }\n\n\n\nvoid MetaImageIO::PrintSelf(std::ostream& os, Indent indent) const\n {\n Superclass::PrintSelf(os, indent);\n m_MetaImage.PrintInfo();\n }\n\n\n\/\/ This method will only test if the header looks like a\n\/\/ MetaImage. Some code is redundant with ReadImageInformation\n\/\/ a StateMachine could provide a better implementation\nbool MetaImageIO::CanReadFile( const char* filename ) \n { \n \n std::ifstream inputStream;\n\n inputStream.open( filename, std::ios::in | std::ios::binary );\n\n if( inputStream.fail() )\n {\n return false;\n }\n\n char key[8000];\n\n inputStream >> key;\n\n if( inputStream.eof() )\n {\n inputStream.close();\n return false;\n }\n\n if( strcmp(key,\"NDims\")==0 ) \n {\n inputStream.close();\n return true;\n }\n if( strcmp(key,\"ObjectType\")==0 ) \n {\n inputStream.close();\n return true;\n }\n if( strcmp(key,\"TransformType\")==0 ) \n {\n inputStream.close();\n return true;\n }\n if( strcmp(key,\"ID\")==0 ) \n {\n inputStream.close();\n return true;\n }\n if( strcmp(key,\"ParentID\")==0 ) \n {\n inputStream.close();\n return true;\n }\n if( strcmp(key,\"BinaryData\")==0 ) \n {\n inputStream.close();\n return true;\n }\n\n inputStream.close();\n return false;\n\n }\n \n\nvoid MetaImageIO::ReadImageInformation()\n { \n if(!m_MetaImage.Read(m_FileName.c_str()), false)\n {\n ExceptionObject exception(__FILE__, __LINE__);\n exception.SetDescription(\"File cannot be read\");\n throw exception;\n }\n\n if(m_MetaImage.BinaryData())\n {\n this->SetFileType(Binary);\n }\n else\n {\n this->SetFileType(ASCII);\n }\n\n this->SetNumberOfComponents(m_MetaImage.ElementNumberOfChannels());\n\n switch(m_MetaImage.ElementType())\n {\n default:\n case MET_OTHER:\n case MET_NONE:\n this->SetPixelType( UNKNOWN );\n this->SetComponentType( UNKNOWN );\n break;\n case MET_CHAR:\n case MET_CHAR_ARRAY:\n case MET_STRING:\n case MET_ASCII_CHAR:\n this->SetPixelType( CHAR );\n this->SetComponentType( CHAR );\n break;\n case MET_UCHAR:\n case MET_UCHAR_ARRAY:\n this->SetPixelType( UCHAR );\n this->SetComponentType( UCHAR );\n break;\n case MET_SHORT:\n case MET_SHORT_ARRAY:\n this->SetPixelType( SHORT );\n this->SetComponentType( SHORT );\n break;\n case MET_USHORT:\n case MET_USHORT_ARRAY:\n this->SetPixelType( USHORT );\n this->SetComponentType( USHORT );\n break;\n case MET_INT:\n case MET_INT_ARRAY:\n this->SetPixelType( INT );\n this->SetComponentType( INT );\n break;\n case MET_UINT:\n case MET_UINT_ARRAY: \n this->SetPixelType( UINT );\n this->SetComponentType( UINT );\n break;\n case MET_FLOAT:\n case MET_FLOAT_ARRAY: \n this->SetPixelType( FLOAT );\n this->SetComponentType( FLOAT );\n break;\n case MET_DOUBLE:\n case MET_DOUBLE_ARRAY:\n this->SetPixelType( DOUBLE );\n this->SetComponentType( DOUBLE );\n break;\n case MET_FLOAT_MATRIX:\n this->SetPixelType( FLOAT );\n this->SetComponentType( FLOAT );\n this->SetNumberOfComponents(m_NumberOfComponents * m_NumberOfComponents);\n break;\n }\n \n this->SetNumberOfDimensions(m_MetaImage.NDims());\n\n int i;\n for(i=0; i<(int)m_NumberOfDimensions; i++)\n {\n this->SetDimensions(i, m_MetaImage.DimSize(i));\n this->SetSpacing(i, m_MetaImage.ElementSpacing(i));\n this->SetOrigin(i, m_MetaImage.Position(i));\n } \n } \n\n\nvoid MetaImageIO::Read(void* buffer)\n { \n if(!m_MetaImage.Read(m_FileName.c_str(), true, buffer))\n {\n ExceptionObject exception(__FILE__, __LINE__);\n exception.SetDescription(\"File cannot be read\");\n throw exception;\n }\n\n m_MetaImage.ElementByteOrderFix();\n } \n\nMetaImage * MetaImageIO::GetMetaImagePointer(void)\n {\n return & m_MetaImage;\n }\n\nbool MetaImageIO::CanWriteFile(const char*)\n {\n return true;\n }\n\n \nvoid \nMetaImageIO\n::WriteImageInformation(void)\n {\n }\n\n\n\/**\n *\n *\/\nvoid \nMetaImageIO\n::Write( const void* buffer) \n {\n int nDims = this->GetNumberOfDimensions();\n\n bool binaryData = false;\n if(this->GetFileType() == Binary)\n {\n binaryData = true;\n }\n\n int nChannels = this->GetNumberOfComponents();\n\n MET_ValueEnumType eType = MET_OTHER;\n switch(m_PixelType)\n {\n default:\n case UNKNOWN:\n eType = MET_OTHER;\n break;\n case CHAR:\n eType = MET_CHAR;\n break;\n case UCHAR:\n eType = MET_UCHAR;\n break;\n case SHORT:\n eType = MET_SHORT;\n break;\n case USHORT:\n eType = MET_USHORT;\n break;\n case INT:\n eType = MET_INT;\n break;\n case UINT:\n eType = MET_UINT;\n break;\n case FLOAT:\n eType = MET_FLOAT;\n break;\n case DOUBLE:\n eType = MET_DOUBLE;\n break;\n }\n \n int i;\n int * dSize = new int[nDims];\n float * eSpacing = new float[nDims];\n float * eOrigin = new float[nDims];\n for(i=0; i<nDims; i++)\n {\n dSize[i] = this->GetDimensions(i);\n eSpacing[i] = this->GetSpacing(i);\n eOrigin[i] = this->GetOrigin(i);\n } \n\n m_MetaImage.InitializeEssential(nDims, dSize, eSpacing, eType, nChannels,\n (void *)buffer);\n m_MetaImage.Position(eOrigin);\n m_MetaImage.BinaryData(binaryData);\n\n m_MetaImage.Write(m_FileName.c_str());\n } \n\n\n\n\n\n} \/\/ end namespace itk\n<|endoftext|>"} {"text":"<commit_before>#include <osg\/ArgumentParser>\n\n#include <osg\/LightModel>\n#include <osg\/Depth>\n#include <osg\/BlendFunc>\n#include <osg\/Camera>\n#include <osg\/Stencil>\n#include <osg\/CullFace>\n\n#include <osgProducer\/Viewer>\n\n#include <osgShadow\/OccluderGeometry>\n\n#include <osgDB\/ReadFile>\n\n\nclass ComputeBoundingBoxVisitor : public osg::NodeVisitor\n{\npublic:\n ComputeBoundingBoxVisitor():\n osg::NodeVisitor(osg::NodeVisitor::TRAVERSE_ALL_CHILDREN)\n {\n }\n \n virtual void reset()\n {\n _matrixStack.clear();\n _bb.init();\n }\n \n osg::BoundingBox& getBoundingBox() { return _bb; }\n\n void getPolytope(osg::Polytope& polytope, float margin=0.1) const\n {\n float delta = _bb.radius()*margin;\n polytope.add( osg::Plane(0.0, 0.0, 1.0, -(_bb.zMin()-delta)) );\n polytope.add( osg::Plane(0.0, 0.0, -1.0, (_bb.zMax()+delta)) );\n\n polytope.add( osg::Plane(1.0, 0.0, 0.0, -(_bb.xMin()-delta)) );\n polytope.add( osg::Plane(-1.0, 0.0, 0.0, (_bb.xMax()+delta)) );\n\n polytope.add( osg::Plane(0.0, 1.0, 0.0, -(_bb.yMin()-delta)) );\n polytope.add( osg::Plane(0.0, -1.0, 0.0, (_bb.yMax()+delta)) );\n }\n \n void apply(osg::Node& node)\n {\n traverse(node);\n }\n \n void apply(osg::Transform& transform)\n {\n osg::Matrix matrix;\n if (!_matrixStack.empty()) matrix = _matrixStack.back();\n \n transform.computeLocalToWorldMatrix(matrix,this);\n \n pushMatrix(matrix);\n \n traverse(transform);\n \n popMatrix();\n }\n \n void apply(osg::Geode& geode)\n {\n for(unsigned int i=0; i<geode.getNumDrawables(); ++i)\n {\n apply(geode.getDrawable(i));\n }\n }\n \n void pushMatrix(osg::Matrix& matrix)\n {\n _matrixStack.push_back(matrix);\n }\n \n void popMatrix()\n {\n _matrixStack.pop_back();\n }\n\n void apply(osg::Drawable* drawable)\n {\n if (_matrixStack.empty()) _bb.expandBy(drawable->getBound());\n else\n {\n osg::Matrix& matrix = _matrixStack.back();\n const osg::BoundingBox& dbb = drawable->getBound();\n if (dbb.valid())\n {\n _bb.expandBy(dbb.corner(0) * matrix);\n _bb.expandBy(dbb.corner(1) * matrix);\n _bb.expandBy(dbb.corner(2) * matrix);\n _bb.expandBy(dbb.corner(3) * matrix);\n _bb.expandBy(dbb.corner(4) * matrix);\n _bb.expandBy(dbb.corner(5) * matrix);\n _bb.expandBy(dbb.corner(6) * matrix);\n _bb.expandBy(dbb.corner(7) * matrix);\n }\n }\n }\n \nprotected:\n \n typedef std::vector<osg::Matrix> MatrixStack;\n\n MatrixStack _matrixStack;\n osg::BoundingBox _bb;\n};\n\n\n\nint main(int argc, char** argv)\n{\n \/\/ use an ArgumentParser object to manage the program arguments.\n osg::ArgumentParser arguments(&argc, argv);\n\n \/\/ set up the usage document, in case we need to print out how to use this program.\n arguments.getApplicationUsage()->setDescription(arguments.getApplicationName() + \" is the example which demonstrates using of GL_ARB_shadow extension implemented in osg::Texture class\");\n arguments.getApplicationUsage()->setCommandLineUsage(arguments.getApplicationName());\n arguments.getApplicationUsage()->addCommandLineOption(\"-h or --help\", \"Display this information\");\n arguments.getApplicationUsage()->addCommandLineOption(\"--with-base-texture\", \"Adde base texture to shadowed model.\");\n arguments.getApplicationUsage()->addCommandLineOption(\"--no-base-texture\", \"Adde base texture to shadowed model.\");\n\n \/\/ construct the viewer.\n osgProducer::Viewer viewer(arguments);\n\n \/\/ set up the value with sensible default event handlers.\n viewer.setUpViewer(osgProducer::Viewer::STANDARD_SETTINGS);\n\n \/\/ get details on keyboard and mouse bindings used by the viewer.\n viewer.getUsage(*arguments. getApplicationUsage());\n\n \/\/ if user request help write it out to cout.\n if (arguments.read(\"-h\") || arguments.read(\"--help\"))\n {\n arguments.getApplicationUsage()->write(std::cout);\n return 1;\n }\n\n bool postionalLight = false;\n while (arguments.read(\"--positionalLight\")) postionalLight = true;\n while (arguments.read(\"--directionalLight\")) postionalLight = false;\n\n bool addOccluderToScene = false;\n while (arguments.read(\"--addOccluderToScene\")) addOccluderToScene = true;\n\n bool updateLightPosition = true;\n while (arguments.read(\"--noUpdate\")) updateLightPosition = false;\n\n bool doShadow = true;\n while (arguments.read(\"--noShadow\")) doShadow = false;\n\n \/\/ any option left unread are converted into errors to write out later.\n arguments.reportRemainingOptionsAsUnrecognized();\n\n \/\/ report any errors if they have occured when parsing the program aguments.\n if (arguments.errors())\n {\n arguments.writeErrorMessages(std::cout);\n return 1;\n }\n\n\n osg::ref_ptr<osg::Node> model = osgDB::readNodeFiles(arguments);\n if (!model)\n {\n osg::notify(osg::NOTICE)<<\"No model loaded, please specify a model to load.\"<<std::endl;\n return 1;\n }\n\n \/\/ get the bounds of the model. \n ComputeBoundingBoxVisitor cbbv;\n model->accept(cbbv);\n osg::BoundingBox bb = cbbv.getBoundingBox();\n \n osg::ref_ptr<osg::Group> group = new osg::Group;\n\n \/\/ set up the occluder\n osg::ref_ptr<osgShadow::OccluderGeometry> occluder = new osgShadow::OccluderGeometry;\n occluder->computeOccluderGeometry(model.get());\n cbbv.getPolytope(occluder->getBoundingPolytope(),0.001);\n\n if (addOccluderToScene)\n {\n osg::ref_ptr<osg::Geode> geode = new osg::Geode;\n geode->addDrawable(occluder.get());\n group->addChild(geode.get());\n }\n \n osg::ref_ptr<osgShadow::ShadowVolumeGeometry> shadowVolume = new osgShadow::ShadowVolumeGeometry;\n\n shadowVolume->setUseDisplayList(!updateLightPosition);\n\n osg::Vec4 lightpos;\n \n if (postionalLight)\n {\n lightpos.set(bb.center().x(), bb.center().y(), bb.zMax() + bb.radius() ,1.0f);\n }\n else\n {\n lightpos.set(0.5f,0.25f,0.8f,0.0f);\n }\n\n\n osg::ref_ptr<osg::Light> light = new osg::Light;\n\n if (!doShadow)\n {\n group->addChild(model.get());\n\n osg::ref_ptr<osg::Geode> geode = new osg::Geode;\n occluder->computeShadowVolumeGeometry(lightpos, *shadowVolume);\n geode->addDrawable(shadowVolume.get());\n group->addChild(geode.get());\n\n osg::StateSet* ss = geode->getOrCreateStateSet();\n ss->setAttributeAndModes(new osg::CullFace(osg::CullFace::BACK), osg::StateAttribute::ON | osg::StateAttribute::OVERRIDE);\n\n }\n else\n {\n osg::Vec4 ambient(0.2,0.2,0.2,1.0);\n osg::Vec4 diffuse(0.8,0.8,0.8,1.0);\n osg::Vec4 zero_colour(0.0,0.0,0.0,1.0);\n \n \/\/ first group\n {\n\n osg::Group* first_model_group = new osg::Group;\n first_model_group->addChild(model.get());\n group->addChild(first_model_group);\n\n osg::StateSet* ss1 = first_model_group->getOrCreateStateSet();\n\n osg::LightModel* lm1 = new osg::LightModel;\n lm1->setAmbientIntensity(ambient);\n ss1->setAttribute(lm1);\n\n osg::Light* light1 = new osg::Light;\n light1->setAmbient(ambient);\n light1->setDiffuse(zero_colour);\n light1->setPosition(lightpos);\n ss1->setAttributeAndModes(light1, osg::StateAttribute::ON | osg::StateAttribute::OVERRIDE);\n ss1->setMode(GL_LIGHTING, osg::StateAttribute::ON | osg::StateAttribute::OVERRIDE);\n \n } \n \n \/\/ second group\n {\n \/\/ use a camera here just to implement a seperate post rendering stage.\n osg::Camera* camera = new osg::Camera;\n camera->setRenderOrder(osg::Camera::POST_RENDER);\n camera->setClearMask(GL_STENCIL_BUFFER_BIT);\n group->addChild(camera);\n\n osg::StateSet* ss_camera = camera->getOrCreateStateSet();\n\n osg::Depth* depth = new osg::Depth;\n depth->setWriteMask(false);\n depth->setFunction(osg::Depth::LEQUAL);\n ss_camera->setAttribute(depth);\n\n {\n osg::ref_ptr<osg::Geode> geode = new osg::Geode;\n occluder->computeShadowVolumeGeometry(lightpos, *shadowVolume);\n geode->addDrawable(shadowVolume.get());\n\n \/\/ switch off the writing to the color bit planes.\n osg::ColorMask* colourMask = new osg::ColorMask;\n colourMask->setMask(false,false,false,false);\n\n osg::Stencil* stencil = new osg::Stencil;\n stencil->setFunction(osg::Stencil::ALWAYS,0,~0u);\n stencil->setOperation(osg::Stencil::KEEP, osg::Stencil::KEEP, osg::Stencil::INCR);\n\n osg::StateSet* ss_sv1 = geode->getOrCreateStateSet();\n ss_sv1->setRenderBinDetails(0, \"RenderBin\");\n ss_sv1->setAttributeAndModes(stencil,osg::StateAttribute::ON);\n ss_sv1->setAttribute(colourMask);\n \n ss_sv1->setAttributeAndModes(new osg::CullFace(osg::CullFace::BACK), osg::StateAttribute::ON | osg::StateAttribute::OVERRIDE);\n\n camera->addChild(geode.get());\n }\n \n if (true)\n {\n osg::ref_ptr<osg::Geode> geode = new osg::Geode;\n occluder->computeShadowVolumeGeometry(lightpos, *shadowVolume);\n geode->addDrawable(shadowVolume.get());\n\n \/\/ switch off the writing to the color bit planes.\n osg::ColorMask* colourMask = new osg::ColorMask;\n colourMask->setMask(false,false,false,false);\n\n osg::Stencil* stencil = new osg::Stencil;\n stencil->setFunction(osg::Stencil::ALWAYS,0,~0u);\n stencil->setOperation(osg::Stencil::KEEP, osg::Stencil::KEEP, osg::Stencil::DECR);\n\n osg::StateSet* ss_sv1 = geode->getOrCreateStateSet();\n ss_sv1->setRenderBinDetails(1, \"RenderBin\");\n ss_sv1->setAttributeAndModes(stencil,osg::StateAttribute::ON);\n ss_sv1->setAttribute(colourMask);\n \n ss_sv1->setAttributeAndModes(new osg::CullFace(osg::CullFace::FRONT), osg::StateAttribute::ON | osg::StateAttribute::OVERRIDE);\n\n camera->addChild(geode.get());\n }\n\n {\n osg::Group* second_model_group = new osg::Group;\n second_model_group->addChild(model.get());\n\n\n osg::StateSet* ss1 = second_model_group->getOrCreateStateSet();\n ss1->setRenderBinDetails(5, \"RenderBin\");\n\n osg::LightModel* lm1 = new osg::LightModel;\n lm1->setAmbientIntensity(zero_colour);\n ss1->setAttribute(lm1);\n\n\n osg::LightSource* lightsource = new osg::LightSource;\n lightsource->setLight(light.get());\n light->setAmbient(zero_colour);\n light->setDiffuse(diffuse);\n light->setPosition(lightpos);\n second_model_group->addChild(lightsource);\n\n ss1->setMode(GL_LIGHT0, osg::StateAttribute::ON | osg::StateAttribute::OVERRIDE);\n\n \/\/ set up the stencil ops so that only operator on this mirrors stencil value.\n osg::Stencil* stencil = new osg::Stencil;\n stencil->setFunction(osg::Stencil::EQUAL,0,~0u);\n stencil->setOperation(osg::Stencil::KEEP, osg::Stencil::KEEP, osg::Stencil::KEEP);\n ss1->setAttributeAndModes(stencil,osg::StateAttribute::ON);\n\n\n osg::BlendFunc* blend = new osg::BlendFunc;\n blend->setFunction(osg::BlendFunc::ONE, osg::BlendFunc::ONE);\n ss1->setAttributeAndModes(blend, osg::StateAttribute::ON | osg::StateAttribute::OVERRIDE);\n ss1->setMode(GL_LIGHTING, osg::StateAttribute::ON | osg::StateAttribute::OVERRIDE);\n\n camera->addChild(second_model_group);\n }\n \n } \n\n }\n\n\n viewer.setSceneData(group.get());\n\n \/\/ create the windows and run the threads.\n viewer.realize();\n\n while (!viewer.done())\n {\n \/\/ wait for all cull and draw threads to complete.\n viewer.sync();\n\n if (updateLightPosition)\n {\n float t = viewer.getFrameStamp()->getReferenceTime();\n if (postionalLight)\n {\n lightpos.set(bb.center().x()+sinf(t)*bb.radius(), bb.center().y() + cosf(t)*bb.radius(), bb.zMax() + bb.radius() ,1.0f);\n }\n else\n {\n lightpos.set(sinf(t),cosf(t),0.8f,0.0f);\n }\n light->setPosition(lightpos);\n occluder->computeShadowVolumeGeometry(lightpos, *shadowVolume);\n }\n\n \/\/ update the scene by traversing it with the the update visitor which will\n \/\/ call all node update callbacks and animations.\n viewer.update();\n \n \/\/ fire off the cull and draw traversals of the scene.\n viewer.frame();\n }\n \n \/\/ wait for all cull and draw threads to complete.\n viewer.sync();\n\n \/\/ run a clean up frame to delete all OpenGL objects.\n viewer.cleanup_frame();\n\n \/\/ wait for all the clean up frame to complete.\n viewer.sync();\n\n return 0;\n}\n<commit_msg>Added support for placing a base in the scene to shadow against<commit_after>#include <osg\/ArgumentParser>\n\n#include <osg\/LightModel>\n#include <osg\/Depth>\n#include <osg\/BlendFunc>\n#include <osg\/Camera>\n#include <osg\/Stencil>\n#include <osg\/CullFace>\n\n#include <osgProducer\/Viewer>\n\n#include <osgShadow\/OccluderGeometry>\n\n#include <osgDB\/ReadFile>\n\n\nclass ComputeBoundingBoxVisitor : public osg::NodeVisitor\n{\npublic:\n ComputeBoundingBoxVisitor():\n osg::NodeVisitor(osg::NodeVisitor::TRAVERSE_ALL_CHILDREN)\n {\n }\n \n virtual void reset()\n {\n _matrixStack.clear();\n _bb.init();\n }\n \n osg::BoundingBox& getBoundingBox() { return _bb; }\n\n void getPolytope(osg::Polytope& polytope, float margin=0.1) const\n {\n float delta = _bb.radius()*margin;\n polytope.add( osg::Plane(0.0, 0.0, 1.0, -(_bb.zMin()-delta)) );\n polytope.add( osg::Plane(0.0, 0.0, -1.0, (_bb.zMax()+delta)) );\n\n polytope.add( osg::Plane(1.0, 0.0, 0.0, -(_bb.xMin()-delta)) );\n polytope.add( osg::Plane(-1.0, 0.0, 0.0, (_bb.xMax()+delta)) );\n\n polytope.add( osg::Plane(0.0, 1.0, 0.0, -(_bb.yMin()-delta)) );\n polytope.add( osg::Plane(0.0, -1.0, 0.0, (_bb.yMax()+delta)) );\n }\n \n void apply(osg::Node& node)\n {\n traverse(node);\n }\n \n void apply(osg::Transform& transform)\n {\n osg::Matrix matrix;\n if (!_matrixStack.empty()) matrix = _matrixStack.back();\n \n transform.computeLocalToWorldMatrix(matrix,this);\n \n pushMatrix(matrix);\n \n traverse(transform);\n \n popMatrix();\n }\n \n void apply(osg::Geode& geode)\n {\n for(unsigned int i=0; i<geode.getNumDrawables(); ++i)\n {\n apply(geode.getDrawable(i));\n }\n }\n \n void pushMatrix(osg::Matrix& matrix)\n {\n _matrixStack.push_back(matrix);\n }\n \n void popMatrix()\n {\n _matrixStack.pop_back();\n }\n\n void apply(osg::Drawable* drawable)\n {\n if (_matrixStack.empty()) _bb.expandBy(drawable->getBound());\n else\n {\n osg::Matrix& matrix = _matrixStack.back();\n const osg::BoundingBox& dbb = drawable->getBound();\n if (dbb.valid())\n {\n _bb.expandBy(dbb.corner(0) * matrix);\n _bb.expandBy(dbb.corner(1) * matrix);\n _bb.expandBy(dbb.corner(2) * matrix);\n _bb.expandBy(dbb.corner(3) * matrix);\n _bb.expandBy(dbb.corner(4) * matrix);\n _bb.expandBy(dbb.corner(5) * matrix);\n _bb.expandBy(dbb.corner(6) * matrix);\n _bb.expandBy(dbb.corner(7) * matrix);\n }\n }\n }\n \nprotected:\n \n typedef std::vector<osg::Matrix> MatrixStack;\n\n MatrixStack _matrixStack;\n osg::BoundingBox _bb;\n};\n\n\n\nint main(int argc, char** argv)\n{\n \/\/ use an ArgumentParser object to manage the program arguments.\n osg::ArgumentParser arguments(&argc, argv);\n\n \/\/ set up the usage document, in case we need to print out how to use this program.\n arguments.getApplicationUsage()->setDescription(arguments.getApplicationName() + \" is the example which demonstrates using of GL_ARB_shadow extension implemented in osg::Texture class\");\n arguments.getApplicationUsage()->setCommandLineUsage(arguments.getApplicationName());\n arguments.getApplicationUsage()->addCommandLineOption(\"-h or --help\", \"Display this information\");\n arguments.getApplicationUsage()->addCommandLineOption(\"--with-base-texture\", \"Adde base texture to shadowed model.\");\n arguments.getApplicationUsage()->addCommandLineOption(\"--no-base-texture\", \"Adde base texture to shadowed model.\");\n\n \/\/ construct the viewer.\n osgProducer::Viewer viewer(arguments);\n\n \/\/ set up the value with sensible default event handlers.\n viewer.setUpViewer(osgProducer::Viewer::STANDARD_SETTINGS);\n\n \/\/ get details on keyboard and mouse bindings used by the viewer.\n viewer.getUsage(*arguments. getApplicationUsage());\n\n \/\/ if user request help write it out to cout.\n if (arguments.read(\"-h\") || arguments.read(\"--help\"))\n {\n arguments.getApplicationUsage()->write(std::cout);\n return 1;\n }\n\n bool postionalLight = false;\n while (arguments.read(\"--positionalLight\")) postionalLight = true;\n while (arguments.read(\"--directionalLight\")) postionalLight = false;\n\n bool addOccluderToScene = false;\n while (arguments.read(\"--addOccluderToScene\")) addOccluderToScene = true;\n\n bool updateLightPosition = true;\n while (arguments.read(\"--noUpdate\")) updateLightPosition = false;\n\n bool createBase = false;\n while (arguments.read(\"--base\")) createBase = true;\n\n bool doShadow = true;\n while (arguments.read(\"--noShadow\")) doShadow = false;\n\n \/\/ any option left unread are converted into errors to write out later.\n arguments.reportRemainingOptionsAsUnrecognized();\n\n \/\/ report any errors if they have occured when parsing the program aguments.\n if (arguments.errors())\n {\n arguments.writeErrorMessages(std::cout);\n return 1;\n }\n\n\n osg::ref_ptr<osg::Node> model = osgDB::readNodeFiles(arguments);\n if (!model)\n {\n osg::notify(osg::NOTICE)<<\"No model loaded, please specify a model to load.\"<<std::endl;\n return 1;\n }\n\n \/\/ get the bounds of the model. \n ComputeBoundingBoxVisitor cbbv;\n model->accept(cbbv);\n osg::BoundingBox bb = cbbv.getBoundingBox();\n\n if (createBase)\n {\n osg::ref_ptr<osg::Group> newGroup = new osg::Group;\n newGroup->addChild(model.get());\n \n osg::Geode* geode = new osg::Geode;\n \n osg::Vec3 widthVec(bb.radius(), 0.0f, 0.0f);\n osg::Vec3 depthVec(0.0f, bb.radius(), 0.0f);\n osg::Vec3 centerBase( (bb.xMin()+bb.xMax())*0.5f, (bb.yMin()+bb.yMax())*0.5f, bb.zMin()-bb.radius()*0.1f );\n \n geode->addDrawable( createTexturedQuadGeometry( centerBase-widthVec*1.5f-depthVec*1.5f, \n widthVec*3.0f, depthVec*3.0f) );\n newGroup->addChild(geode);\n \n model = newGroup.get();\n }\n\n \/\/ get the bounds of the model.\n cbbv.reset();\n model->accept(cbbv);\n bb = cbbv.getBoundingBox();\n \n osg::ref_ptr<osg::Group> group = new osg::Group;\n\n \/\/ set up the occluder\n osg::ref_ptr<osgShadow::OccluderGeometry> occluder = new osgShadow::OccluderGeometry;\n occluder->computeOccluderGeometry(model.get());\n cbbv.getPolytope(occluder->getBoundingPolytope(),0.001);\n\n if (addOccluderToScene)\n {\n osg::ref_ptr<osg::Geode> geode = new osg::Geode;\n geode->addDrawable(occluder.get());\n group->addChild(geode.get());\n }\n \n osg::ref_ptr<osgShadow::ShadowVolumeGeometry> shadowVolume = new osgShadow::ShadowVolumeGeometry;\n\n shadowVolume->setUseDisplayList(!updateLightPosition);\n\n osg::Vec4 lightpos;\n \n if (postionalLight)\n {\n lightpos.set(bb.center().x(), bb.center().y(), bb.zMax() + bb.radius() ,1.0f);\n }\n else\n {\n lightpos.set(0.5f,0.25f,0.8f,0.0f);\n }\n\n\n\n osg::ref_ptr<osg::Light> light = new osg::Light;\n\n if (!doShadow)\n {\n group->addChild(model.get());\n\n osg::ref_ptr<osg::Geode> geode = new osg::Geode;\n occluder->computeShadowVolumeGeometry(lightpos, *shadowVolume);\n geode->addDrawable(shadowVolume.get());\n group->addChild(geode.get());\n\n osg::StateSet* ss = geode->getOrCreateStateSet();\n ss->setAttributeAndModes(new osg::CullFace(osg::CullFace::BACK), osg::StateAttribute::ON | osg::StateAttribute::OVERRIDE);\n\n }\n else\n {\n osg::Vec4 ambient(0.2,0.2,0.2,1.0);\n osg::Vec4 diffuse(0.8,0.8,0.8,1.0);\n osg::Vec4 zero_colour(0.0,0.0,0.0,1.0);\n \n \/\/ first group\n {\n\n osg::Group* first_model_group = new osg::Group;\n first_model_group->addChild(model.get());\n group->addChild(first_model_group);\n\n osg::StateSet* ss1 = first_model_group->getOrCreateStateSet();\n\n osg::LightModel* lm1 = new osg::LightModel;\n lm1->setAmbientIntensity(ambient);\n ss1->setAttribute(lm1);\n\n osg::Light* light1 = new osg::Light;\n light1->setAmbient(ambient);\n light1->setDiffuse(zero_colour);\n light1->setPosition(lightpos);\n ss1->setAttributeAndModes(light1, osg::StateAttribute::ON | osg::StateAttribute::OVERRIDE);\n ss1->setMode(GL_LIGHTING, osg::StateAttribute::ON | osg::StateAttribute::OVERRIDE);\n \n } \n \n \/\/ second group\n {\n \/\/ use a camera here just to implement a seperate post rendering stage.\n osg::Camera* camera = new osg::Camera;\n camera->setRenderOrder(osg::Camera::POST_RENDER);\n camera->setClearMask(GL_STENCIL_BUFFER_BIT);\n group->addChild(camera);\n\n osg::StateSet* ss_camera = camera->getOrCreateStateSet();\n\n osg::Depth* depth = new osg::Depth;\n depth->setWriteMask(false);\n depth->setFunction(osg::Depth::LEQUAL);\n ss_camera->setAttribute(depth);\n\n {\n osg::ref_ptr<osg::Geode> geode = new osg::Geode;\n occluder->computeShadowVolumeGeometry(lightpos, *shadowVolume);\n geode->addDrawable(shadowVolume.get());\n\n \/\/ switch off the writing to the color bit planes.\n osg::ColorMask* colourMask = new osg::ColorMask;\n colourMask->setMask(false,false,false,false);\n\n osg::Stencil* stencil = new osg::Stencil;\n stencil->setFunction(osg::Stencil::ALWAYS,0,~0u);\n stencil->setOperation(osg::Stencil::KEEP, osg::Stencil::KEEP, osg::Stencil::INCR);\n\n osg::StateSet* ss_sv1 = geode->getOrCreateStateSet();\n ss_sv1->setRenderBinDetails(0, \"RenderBin\");\n ss_sv1->setAttributeAndModes(stencil,osg::StateAttribute::ON);\n ss_sv1->setAttribute(colourMask);\n \n ss_sv1->setAttributeAndModes(new osg::CullFace(osg::CullFace::BACK), osg::StateAttribute::ON | osg::StateAttribute::OVERRIDE);\n\n camera->addChild(geode.get());\n }\n \n if (true)\n {\n osg::ref_ptr<osg::Geode> geode = new osg::Geode;\n occluder->computeShadowVolumeGeometry(lightpos, *shadowVolume);\n geode->addDrawable(shadowVolume.get());\n\n \/\/ switch off the writing to the color bit planes.\n osg::ColorMask* colourMask = new osg::ColorMask;\n colourMask->setMask(false,false,false,false);\n\n osg::Stencil* stencil = new osg::Stencil;\n stencil->setFunction(osg::Stencil::ALWAYS,0,~0u);\n stencil->setOperation(osg::Stencil::KEEP, osg::Stencil::KEEP, osg::Stencil::DECR);\n\n osg::StateSet* ss_sv1 = geode->getOrCreateStateSet();\n ss_sv1->setRenderBinDetails(1, \"RenderBin\");\n ss_sv1->setAttributeAndModes(stencil,osg::StateAttribute::ON);\n ss_sv1->setAttribute(colourMask);\n \n ss_sv1->setAttributeAndModes(new osg::CullFace(osg::CullFace::FRONT), osg::StateAttribute::ON | osg::StateAttribute::OVERRIDE);\n\n camera->addChild(geode.get());\n }\n\n {\n osg::Group* second_model_group = new osg::Group;\n second_model_group->addChild(model.get());\n\n\n osg::StateSet* ss1 = second_model_group->getOrCreateStateSet();\n ss1->setRenderBinDetails(5, \"RenderBin\");\n\n osg::LightModel* lm1 = new osg::LightModel;\n lm1->setAmbientIntensity(zero_colour);\n ss1->setAttribute(lm1);\n\n\n osg::LightSource* lightsource = new osg::LightSource;\n lightsource->setLight(light.get());\n light->setAmbient(zero_colour);\n light->setDiffuse(diffuse);\n light->setPosition(lightpos);\n second_model_group->addChild(lightsource);\n\n ss1->setMode(GL_LIGHT0, osg::StateAttribute::ON | osg::StateAttribute::OVERRIDE);\n\n \/\/ set up the stencil ops so that only operator on this mirrors stencil value.\n osg::Stencil* stencil = new osg::Stencil;\n stencil->setFunction(osg::Stencil::EQUAL,0,~0u);\n stencil->setOperation(osg::Stencil::KEEP, osg::Stencil::KEEP, osg::Stencil::KEEP);\n ss1->setAttributeAndModes(stencil,osg::StateAttribute::ON);\n\n\n osg::BlendFunc* blend = new osg::BlendFunc;\n blend->setFunction(osg::BlendFunc::ONE, osg::BlendFunc::ONE);\n ss1->setAttributeAndModes(blend, osg::StateAttribute::ON | osg::StateAttribute::OVERRIDE);\n ss1->setMode(GL_LIGHTING, osg::StateAttribute::ON | osg::StateAttribute::OVERRIDE);\n\n camera->addChild(second_model_group);\n }\n \n } \n\n }\n\n\n viewer.setSceneData(group.get());\n\n \/\/ create the windows and run the threads.\n viewer.realize();\n\n while (!viewer.done())\n {\n \/\/ wait for all cull and draw threads to complete.\n viewer.sync();\n\n if (updateLightPosition)\n {\n float t = viewer.getFrameStamp()->getReferenceTime();\n if (postionalLight)\n {\n lightpos.set(bb.center().x()+sinf(t)*bb.radius(), bb.center().y() + cosf(t)*bb.radius(), bb.zMax() + bb.radius() ,1.0f);\n }\n else\n {\n lightpos.set(sinf(t),cosf(t),0.8f,0.0f);\n }\n light->setPosition(lightpos);\n occluder->computeShadowVolumeGeometry(lightpos, *shadowVolume);\n }\n\n \/\/ update the scene by traversing it with the the update visitor which will\n \/\/ call all node update callbacks and animations.\n viewer.update();\n \n \/\/ fire off the cull and draw traversals of the scene.\n viewer.frame();\n }\n \n \/\/ wait for all cull and draw threads to complete.\n viewer.sync();\n\n \/\/ run a clean up frame to delete all OpenGL objects.\n viewer.cleanup_frame();\n\n \/\/ wait for all the clean up frame to complete.\n viewer.sync();\n\n return 0;\n}\n<|endoftext|>"} {"text":"<commit_before>\/*************************************************************************\n *\n * OpenOffice.org - a multi-platform office productivity suite\n *\n * $RCSfile: dtrans.cxx,v $\n *\n * $Revision: 1.4 $\n *\n * last change: $Author: rt $ $Date: 2005-09-08 18:12: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\n#include <cppuhelper\/factory.hxx>\n#include <clipboardmanager.hxx>\n#include <generic_clipboard.hxx>\n\nusing namespace com::sun::star::lang;\nusing namespace com::sun::star::registry;\nusing namespace com::sun::star::uno;\nusing namespace cppu;\nusing namespace rtl;\n\nextern \"C\"\n{\n\n\/\/==================================================================================================\n\nvoid SAL_CALL component_getImplementationEnvironment(const sal_Char ** ppEnvTypeName,\n uno_Environment ** ppEnv )\n{\n *ppEnvTypeName = CPPU_CURRENT_LANGUAGE_BINDING_NAME;\n}\n\n\/\/==================================================================================================\n\nsal_Bool SAL_CALL component_writeInfo(void * pServiceManager, void * pRegistryKey )\n{\n if (pRegistryKey)\n {\n try\n {\n Reference< XRegistryKey > xNewKey(\n reinterpret_cast< XRegistryKey * >( pRegistryKey )->createKey(\n OUString::createFromAscii(\"\/\" CLIPBOARDMANAGER_IMPLEMENTATION_NAME \"\/UNO\/SERVICES\" ) ) );\n\n const Sequence< OUString > & rSNL = ClipboardManager_getSupportedServiceNames();\n const OUString * pArray = rSNL.getConstArray();\n sal_Int32 nPos;\n for ( nPos = rSNL.getLength(); nPos--; )\n xNewKey->createKey( pArray[nPos] );\n\n xNewKey = reinterpret_cast< XRegistryKey * >( pRegistryKey )->createKey(\n OUString::createFromAscii(\"\/\" GENERIC_CLIPBOARD_IMPLEMENTATION_NAME \"\/UNO\/SERVICES\" ) );\n\n const Sequence< OUString > & rSNL2 = GenericClipboard_getSupportedServiceNames();\n pArray = rSNL2.getConstArray();\n for ( nPos = rSNL2.getLength(); nPos--; )\n xNewKey->createKey( pArray[nPos] );\n\n return sal_True;\n }\n catch (InvalidRegistryException &)\n {\n OSL_ENSURE( sal_False, \"### InvalidRegistryException!\" );\n }\n }\n\n return sal_False;\n}\n\n\/\/==================================================================================================\n\nvoid * SAL_CALL component_getFactory(\n const sal_Char * pImplName,\n void * pServiceManager,\n void * pRegistryKey\n)\n{\n void * pRet = 0;\n\n if (pServiceManager)\n {\n Reference< XSingleServiceFactory > xFactory;\n\n if (rtl_str_compare( pImplName, CLIPBOARDMANAGER_IMPLEMENTATION_NAME ) == 0)\n {\n xFactory = createOneInstanceFactory(\n reinterpret_cast< XMultiServiceFactory * >( pServiceManager ),\n OUString::createFromAscii( pImplName ),\n ClipboardManager_createInstance,\n ClipboardManager_getSupportedServiceNames() );\n }\n else if (rtl_str_compare( pImplName, GENERIC_CLIPBOARD_IMPLEMENTATION_NAME ) == 0)\n {\n xFactory = createSingleFactory(\n reinterpret_cast< XMultiServiceFactory * >( pServiceManager ),\n OUString::createFromAscii( pImplName ),\n GenericClipboard_createInstance,\n GenericClipboard_getSupportedServiceNames() );\n }\n\n if (xFactory.is())\n {\n xFactory->acquire();\n pRet = xFactory.get();\n }\n }\n\n return pRet;\n}\n\n}\n<commit_msg>INTEGRATION: CWS warnings01 (1.4.4); FILE MERGED 2005\/10\/27 11:44:56 pl 1.4.4.1: #i55991# removed warnings for solaris platform<commit_after>\/*************************************************************************\n *\n * OpenOffice.org - a multi-platform office productivity suite\n *\n * $RCSfile: dtrans.cxx,v $\n *\n * $Revision: 1.5 $\n *\n * last change: $Author: hr $ $Date: 2006-06-20 06:00: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\n#include <cppuhelper\/factory.hxx>\n#include <clipboardmanager.hxx>\n#include <generic_clipboard.hxx>\n\nusing namespace com::sun::star::lang;\nusing namespace com::sun::star::registry;\nusing namespace com::sun::star::uno;\nusing namespace cppu;\nusing namespace rtl;\n\nextern \"C\"\n{\n\n\/\/==================================================================================================\n\nvoid SAL_CALL component_getImplementationEnvironment(const sal_Char ** ppEnvTypeName,\n uno_Environment ** \/*ppEnv*\/ )\n{\n *ppEnvTypeName = CPPU_CURRENT_LANGUAGE_BINDING_NAME;\n}\n\n\/\/==================================================================================================\n\nsal_Bool SAL_CALL component_writeInfo(void * \/*pServiceManager*\/, void * pRegistryKey )\n{\n if (pRegistryKey)\n {\n try\n {\n Reference< XRegistryKey > xNewKey(\n reinterpret_cast< XRegistryKey * >( pRegistryKey )->createKey(\n OUString::createFromAscii(\"\/\" CLIPBOARDMANAGER_IMPLEMENTATION_NAME \"\/UNO\/SERVICES\" ) ) );\n\n const Sequence< OUString > & rSNL = ClipboardManager_getSupportedServiceNames();\n const OUString * pArray = rSNL.getConstArray();\n sal_Int32 nPos;\n for ( nPos = rSNL.getLength(); nPos--; )\n xNewKey->createKey( pArray[nPos] );\n\n xNewKey = reinterpret_cast< XRegistryKey * >( pRegistryKey )->createKey(\n OUString::createFromAscii(\"\/\" GENERIC_CLIPBOARD_IMPLEMENTATION_NAME \"\/UNO\/SERVICES\" ) );\n\n const Sequence< OUString > & rSNL2 = GenericClipboard_getSupportedServiceNames();\n pArray = rSNL2.getConstArray();\n for ( nPos = rSNL2.getLength(); nPos--; )\n xNewKey->createKey( pArray[nPos] );\n\n return sal_True;\n }\n catch (InvalidRegistryException &)\n {\n OSL_ENSURE( sal_False, \"### InvalidRegistryException!\" );\n }\n }\n\n return sal_False;\n}\n\n\/\/==================================================================================================\n\nvoid * SAL_CALL component_getFactory(\n const sal_Char * pImplName,\n void * pServiceManager,\n void * \/*pRegistryKey*\/\n)\n{\n void * pRet = 0;\n\n if (pServiceManager)\n {\n Reference< XSingleServiceFactory > xFactory;\n\n if (rtl_str_compare( pImplName, CLIPBOARDMANAGER_IMPLEMENTATION_NAME ) == 0)\n {\n xFactory = createOneInstanceFactory(\n reinterpret_cast< XMultiServiceFactory * >( pServiceManager ),\n OUString::createFromAscii( pImplName ),\n ClipboardManager_createInstance,\n ClipboardManager_getSupportedServiceNames() );\n }\n else if (rtl_str_compare( pImplName, GENERIC_CLIPBOARD_IMPLEMENTATION_NAME ) == 0)\n {\n xFactory = createSingleFactory(\n reinterpret_cast< XMultiServiceFactory * >( pServiceManager ),\n OUString::createFromAscii( pImplName ),\n GenericClipboard_createInstance,\n GenericClipboard_getSupportedServiceNames() );\n }\n\n if (xFactory.is())\n {\n xFactory->acquire();\n pRet = xFactory.get();\n }\n }\n\n return pRet;\n}\n\n}\n<|endoftext|>"} {"text":"<commit_before>\/*\n * Copyright 2015 Milian Wolff <mail@milianw.de>\n *\n * This program is free software; you can redistribute it and\/or modify\n * it under the terms of the GNU Library General Public License as\n * published by the Free Software Foundation; either version 2 of the\n * License, or (at your option) any later version.\n *\n * This program is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the\n * GNU General Public License for more details.\n *\n * You should have received a copy of the GNU General Public\n * License along with this program; if not, write to the\n * Free Software Foundation, Inc.,\n * 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA.\n *\/\n\n#include \"parser.h\"\n\n#include <ThreadWeaver\/ThreadWeaver>\n#include <KFormat>\n#include <KLocalizedString>\n\n#include <QTextStream>\n\n#include \"..\/accumulatedtracedata.h\"\n\n#include <vector>\n\nusing namespace std;\n\nnamespace {\nstruct ParserData final : public AccumulatedTraceData\n{\n ParserData()\n {\n chartData.push_back({0, 0, 0, 0});\n }\n\n void handleTimeStamp(size_t \/*newStamp*\/, size_t oldStamp)\n {\n maxLeakedSinceLastTimeStamp = max(maxLeakedSinceLastTimeStamp, leaked);\n chartData.push_back({oldStamp, maxLeakedSinceLastTimeStamp, totalAllocations, totalAllocated});\n maxLeakedSinceLastTimeStamp = 0;\n }\n\n void handleAllocation()\n {\n maxLeakedSinceLastTimeStamp = max(maxLeakedSinceLastTimeStamp, leaked);\n }\n\n void handleDebuggee(const char* command)\n {\n debuggee = command;\n }\n\n string debuggee;\n\n ChartData chartData;\n size_t maxLeakedSinceLastTimeStamp = 0;\n};\n\nQString generateSummary(const ParserData& data)\n{\n QString ret;\n KFormat format;\n QTextStream stream(&ret);\n const double totalTimeS = 0.001 * data.totalTime;\n stream << \"<qt>\"\n << i18n(\"<strong>debuggee<\/strong>: <code>%1<\/code>\", QString::fromStdString(data.debuggee)) << \"<br\/>\"\n << i18n(\"<strong>total runtime<\/strong>: %1s\", totalTimeS) << \"<br\/>\"\n << i18n(\"<strong>bytes allocated in total<\/strong> (ignoring deallocations): %1 (%2\/s)\",\n format.formatByteSize(data.totalAllocated, 2), format.formatByteSize(data.totalAllocated \/ totalTimeS)) << \"<br\/>\"\n << i18n(\"<strong>calls to allocation functions<\/strong>: %1 (%2\/s)\",\n data.totalAllocations, quint64(data.totalAllocations \/ totalTimeS)) << \"<br\/>\"\n << i18n(\"<strong>peak heap memory consumption<\/strong>: %1\", format.formatByteSize(data.peak)) << \"<br\/>\"\n << i18n(\"<strong>total memory leaked<\/strong>: %1\", format.formatByteSize(data.leaked)) << \"<br\/>\";\n stream << \"<\/qt>\";\n return ret;\n}\n\nstruct StringCache\n{\n StringCache(const AccumulatedTraceData& data)\n {\n m_strings.resize(data.strings.size());\n transform(data.strings.begin(), data.strings.end(),\n m_strings.begin(), [] (const string& str) { return QString::fromStdString(str); });\n }\n\n QString func(const InstructionPointer& ip) const\n {\n if (ip.functionIndex) {\n \/\/ TODO: support removal of template arguments\n return stringify(ip.functionIndex);\n } else {\n return static_cast<QString>(QLatin1String(\"0x\") + QString::number(ip.instructionPointer, 16));\n }\n }\n\n QString file(const InstructionPointer& ip) const\n {\n if (ip.fileIndex) {\n auto file = stringify(ip.fileIndex);\n return file + QLatin1Char(':') + QString::number(ip.line);\n } else {\n return {};\n }\n }\n\n QString module(const InstructionPointer& ip) const\n {\n return stringify(ip.moduleIndex);\n }\n\n QString stringify(const StringIndex index) const\n {\n if (!index || index.index > m_strings.size()) {\n return {};\n } else {\n return m_strings.at(index.index - 1);\n }\n }\n\n LocationData location(const InstructionPointer& ip) const\n {\n return {func(ip), file(ip), module(ip)};\n }\n\n vector<QString> m_strings;\n};\n\nvoid setParents(QVector<RowData>& children, const RowData* parent)\n{\n for (auto& row: children) {\n row.parent = parent;\n setParents(row.children, &row);\n }\n}\n\nQVector<RowData> mergeAllocations(const AccumulatedTraceData& data)\n{\n QVector<RowData> topRows;\n StringCache strings(data);\n \/\/ merge allocations, leave parent pointers invalid (their location may change)\n for (const auto& allocation : data.allocations) {\n auto traceIndex = allocation.traceIndex;\n auto rows = &topRows;\n while (traceIndex) {\n const auto& trace = data.findTrace(traceIndex);\n const auto& ip = data.findIp(trace.ipIndex);\n \/\/ TODO: only store the IpIndex and use that\n auto location = strings.location(ip);\n auto it = lower_bound(rows->begin(), rows->end(), location);\n if (it != rows->end() && it->location == location) {\n it->allocated += allocation.allocated;\n it->allocations += allocation.allocations;\n it->leaked += allocation.leaked;\n it->peak = max(it->peak, static_cast<quint64>(allocation.peak));\n } else {\n it = rows->insert(it, {allocation.allocations, allocation.allocated, allocation.leaked, allocation.peak,\n location, nullptr, {}});\n }\n traceIndex = trace.parentIndex;\n rows = &it->children;\n }\n }\n \/\/ now set the parents, the data is constant from here on\n setParents(topRows, nullptr);\n return topRows;\n}\n}\n\nParser::Parser(QObject* parent)\n : QObject(parent)\n{}\n\nParser::~Parser() = default;\n\nvoid Parser::parse(const QString& path)\n{\n using namespace ThreadWeaver;\n stream() << make_job([=]() {\n ParserData data;\n data.read(path.toStdString());\n emit summaryAvailable(generateSummary(data));\n emit bottomUpDataAvailable(mergeAllocations(data));\n emit chartDataAvailable(data.chartData);\n emit finished();\n });\n}\n<commit_msg>Get rid of c-formatting message with %1s<commit_after>\/*\n * Copyright 2015 Milian Wolff <mail@milianw.de>\n *\n * This program is free software; you can redistribute it and\/or modify\n * it under the terms of the GNU Library General Public License as\n * published by the Free Software Foundation; either version 2 of the\n * License, or (at your option) any later version.\n *\n * This program is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the\n * GNU General Public License for more details.\n *\n * You should have received a copy of the GNU General Public\n * License along with this program; if not, write to the\n * Free Software Foundation, Inc.,\n * 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA.\n *\/\n\n#include \"parser.h\"\n\n#include <ThreadWeaver\/ThreadWeaver>\n#include <KFormat>\n#include <KLocalizedString>\n\n#include <QTextStream>\n\n#include \"..\/accumulatedtracedata.h\"\n\n#include <vector>\n\nusing namespace std;\n\nnamespace {\nstruct ParserData final : public AccumulatedTraceData\n{\n ParserData()\n {\n chartData.push_back({0, 0, 0, 0});\n }\n\n void handleTimeStamp(size_t \/*newStamp*\/, size_t oldStamp)\n {\n maxLeakedSinceLastTimeStamp = max(maxLeakedSinceLastTimeStamp, leaked);\n chartData.push_back({oldStamp, maxLeakedSinceLastTimeStamp, totalAllocations, totalAllocated});\n maxLeakedSinceLastTimeStamp = 0;\n }\n\n void handleAllocation()\n {\n maxLeakedSinceLastTimeStamp = max(maxLeakedSinceLastTimeStamp, leaked);\n }\n\n void handleDebuggee(const char* command)\n {\n debuggee = command;\n }\n\n string debuggee;\n\n ChartData chartData;\n size_t maxLeakedSinceLastTimeStamp = 0;\n};\n\nQString generateSummary(const ParserData& data)\n{\n QString ret;\n KFormat format;\n QTextStream stream(&ret);\n const double totalTimeS = 0.001 * data.totalTime;\n stream << \"<qt>\"\n << i18n(\"<strong>debuggee<\/strong>: <code>%1<\/code>\", QString::fromStdString(data.debuggee)) << \"<br\/>\"\n \/\/ xgettext:no-c-format\n << i18n(\"<strong>total runtime<\/strong>: %1s\", totalTimeS) << \"<br\/>\"\n << i18n(\"<strong>bytes allocated in total<\/strong> (ignoring deallocations): %1 (%2\/s)\",\n format.formatByteSize(data.totalAllocated, 2), format.formatByteSize(data.totalAllocated \/ totalTimeS)) << \"<br\/>\"\n << i18n(\"<strong>calls to allocation functions<\/strong>: %1 (%2\/s)\",\n data.totalAllocations, quint64(data.totalAllocations \/ totalTimeS)) << \"<br\/>\"\n << i18n(\"<strong>peak heap memory consumption<\/strong>: %1\", format.formatByteSize(data.peak)) << \"<br\/>\"\n << i18n(\"<strong>total memory leaked<\/strong>: %1\", format.formatByteSize(data.leaked)) << \"<br\/>\";\n stream << \"<\/qt>\";\n return ret;\n}\n\nstruct StringCache\n{\n StringCache(const AccumulatedTraceData& data)\n {\n m_strings.resize(data.strings.size());\n transform(data.strings.begin(), data.strings.end(),\n m_strings.begin(), [] (const string& str) { return QString::fromStdString(str); });\n }\n\n QString func(const InstructionPointer& ip) const\n {\n if (ip.functionIndex) {\n \/\/ TODO: support removal of template arguments\n return stringify(ip.functionIndex);\n } else {\n return static_cast<QString>(QLatin1String(\"0x\") + QString::number(ip.instructionPointer, 16));\n }\n }\n\n QString file(const InstructionPointer& ip) const\n {\n if (ip.fileIndex) {\n auto file = stringify(ip.fileIndex);\n return file + QLatin1Char(':') + QString::number(ip.line);\n } else {\n return {};\n }\n }\n\n QString module(const InstructionPointer& ip) const\n {\n return stringify(ip.moduleIndex);\n }\n\n QString stringify(const StringIndex index) const\n {\n if (!index || index.index > m_strings.size()) {\n return {};\n } else {\n return m_strings.at(index.index - 1);\n }\n }\n\n LocationData location(const InstructionPointer& ip) const\n {\n return {func(ip), file(ip), module(ip)};\n }\n\n vector<QString> m_strings;\n};\n\nvoid setParents(QVector<RowData>& children, const RowData* parent)\n{\n for (auto& row: children) {\n row.parent = parent;\n setParents(row.children, &row);\n }\n}\n\nQVector<RowData> mergeAllocations(const AccumulatedTraceData& data)\n{\n QVector<RowData> topRows;\n StringCache strings(data);\n \/\/ merge allocations, leave parent pointers invalid (their location may change)\n for (const auto& allocation : data.allocations) {\n auto traceIndex = allocation.traceIndex;\n auto rows = &topRows;\n while (traceIndex) {\n const auto& trace = data.findTrace(traceIndex);\n const auto& ip = data.findIp(trace.ipIndex);\n \/\/ TODO: only store the IpIndex and use that\n auto location = strings.location(ip);\n auto it = lower_bound(rows->begin(), rows->end(), location);\n if (it != rows->end() && it->location == location) {\n it->allocated += allocation.allocated;\n it->allocations += allocation.allocations;\n it->leaked += allocation.leaked;\n it->peak = max(it->peak, static_cast<quint64>(allocation.peak));\n } else {\n it = rows->insert(it, {allocation.allocations, allocation.allocated, allocation.leaked, allocation.peak,\n location, nullptr, {}});\n }\n traceIndex = trace.parentIndex;\n rows = &it->children;\n }\n }\n \/\/ now set the parents, the data is constant from here on\n setParents(topRows, nullptr);\n return topRows;\n}\n}\n\nParser::Parser(QObject* parent)\n : QObject(parent)\n{}\n\nParser::~Parser() = default;\n\nvoid Parser::parse(const QString& path)\n{\n using namespace ThreadWeaver;\n stream() << make_job([=]() {\n ParserData data;\n data.read(path.toStdString());\n emit summaryAvailable(generateSummary(data));\n emit bottomUpDataAvailable(mergeAllocations(data));\n emit chartDataAvailable(data.chartData);\n emit finished();\n });\n}\n<|endoftext|>"} {"text":"<commit_before>\/**\n * @file\n * @author Nico Wollenzin <nico@wollenzin>\n * @version 1.0\n *\n * @section LICENSE\n *\n * Copyright [2014] [Nico Wollenzin]\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\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 * @section DESCRIPTION\n *\n * Skeleton file as starting point for other files.\n *\/\n\n#include <iostream>\n\nint main() {\n std::cout << \"Hello World!\\n\";\n}\n<commit_msg>initial Commit + Hello World<commit_after><|endoftext|>"} {"text":"<commit_before>#include \"stdafx.hpp\"\n\n#include <CppUnitTest.h>\n\n#include \"Geometry\/Grassmann.hpp\"\n#include \"Geometry\/R3Element.hpp\"\n#include \"Quantities\/Astronomy.hpp\"\n#include \"Quantities\/BIPM.hpp\"\n#include \"Quantities\/Constants.hpp\"\n#include \"Quantities\/Dimensionless.hpp\"\n#include \"Quantities\/ElementaryFunctions.hpp\"\n#include \"Quantities\/Quantities.hpp\"\n#include \"Quantities\/SI.hpp\"\n#include \"Quantities\/UK.hpp\"\n#include \"TestUtilities\/Algebra.hpp\"\n#include \"TestUtilities\/GeometryComparisons.hpp\"\n#include \"TestUtilities\/QuantityComparisons.hpp\"\n#include \"TestUtilities\/TestUtilities.hpp\"\n\n\nnamespace principia {\nnamespace geometry {\n\nusing namespace astronomy;\nusing namespace bipm;\nusing namespace constants;\nusing namespace Microsoft::VisualStudio::CppUnitTestFramework;\nusing namespace quantities;\nusing namespace si;\nusing namespace test_utilities;\nusing namespace uk;\n\nTEST_CLASS(R3ElementTests) {\n public:\n TEST_METHOD(Dumb3Vector) {\n R3Element<Speed> nullVector(0 * Metre \/ Second,\n 0 * Metre \/ Second,\n 0 * Metre \/ Second);\n R3Element<Speed> u(1 * Metre \/ Second,\n 120 * Kilo(Metre) \/ Hour,\n -SpeedOfLight);\n R3Element<Speed> v(-20 * Knot,\n 2 * π * AstronomicalUnit \/ JulianYear,\n 1 * admiralty::NauticalMile \/ Hour);\n R3Element<Speed> w(-1 * Mile \/ Hour, -2 * Foot \/ Second, -3 * Knot);\n R3Element<Speed> a(88 * Mile \/ Hour, 300 * Metre \/ Second, 46 * Knot);\n AssertEqual((e * Dimensionless(42)) * v, e * (Dimensionless(42) * v));\n TestVectorSpace<R3Element<Speed>,\n Dimensionless>(nullVector, u, v, w, Dimensionless(0),\n Dimensionless(1), e, Dimensionless(42));\n TestAlternatingBilinearMap(Cross<Speed, Speed>, u,\n v, w, a, Dimensionless(42));\n TestSymmetricPositiveDefiniteBilinearMap(Dot<Speed, Speed>,\n u, v, w, a, Dimensionless(42));\n }\n \n TEST_METHOD(MixedProduct) {\n R3Element<Speed> nullVector(0 * Metre \/ Second,\n 0 * Metre \/ Second,\n 0 * Metre \/ Second);\n R3Element<Speed> u(1 * Metre \/ Second,\n 120 * Kilo(Metre) \/ Hour,\n -SpeedOfLight);\n R3Element<Speed> v(-20 * Knot,\n 2 * π * AstronomicalUnit \/ JulianYear,\n 1 * admiralty::NauticalMile \/ Hour);\n R3Element<Speed> w(-1 * Mile \/ Hour, -2 * Foot \/ Second, -3 * Knot);\n R3Element<Speed> a(88 * Mile \/ Hour, 300 * Metre \/ Second, 46 * Knot);\n auto leftTimeMultiplication = [](Time left, R3Element<Speed> right) {\n return left * right;\n };\n auto rightTimeMultiplication = [](R3Element<Speed> left, Time right) {\n return left * right;\n };\n TestBilinearMap(leftTimeMultiplication, 1 * Second, 1 * JulianYear, u, v,\n Dimensionless(42));\n TestBilinearMap(rightTimeMultiplication, w, a, -1 * Day,\n 1 * Parsec \/ SpeedOfLight, Dimensionless(-π));\n Time t = -3 * Second;\n AssertEqual(t * u, u * t);\n AssertEqual((u * t) \/ t, u);\n }\n};\n\n} \/\/ namespace geometry\n} \/\/ namespace principia\n<commit_msg>Fix capitalisation as per @pleroy's review, factor boilerplate definitions.<commit_after>#include \"stdafx.hpp\"\n\n#include <CppUnitTest.h>\n\n#include \"Geometry\/Grassmann.hpp\"\n#include \"Geometry\/R3Element.hpp\"\n#include \"Quantities\/Astronomy.hpp\"\n#include \"Quantities\/BIPM.hpp\"\n#include \"Quantities\/Constants.hpp\"\n#include \"Quantities\/Dimensionless.hpp\"\n#include \"Quantities\/ElementaryFunctions.hpp\"\n#include \"Quantities\/Quantities.hpp\"\n#include \"Quantities\/SI.hpp\"\n#include \"Quantities\/UK.hpp\"\n#include \"TestUtilities\/Algebra.hpp\"\n#include \"TestUtilities\/GeometryComparisons.hpp\"\n#include \"TestUtilities\/QuantityComparisons.hpp\"\n#include \"TestUtilities\/TestUtilities.hpp\"\n\n\nnamespace principia {\nnamespace geometry {\n\nusing namespace astronomy;\nusing namespace bipm;\nusing namespace constants;\nusing namespace Microsoft::VisualStudio::CppUnitTestFramework;\nusing namespace quantities;\nusing namespace si;\nusing namespace test_utilities;\nusing namespace uk;\n\nTEST_CLASS(R3ElementTests) {\n R3Element<Speed> const null_velocity_ =\n R3Element<Speed>(0 * Knot, 0 * Knot, 0 * Knot);\n R3Element<Speed> const u_ =\n R3Element<Speed>(3 * Knot, -42 * Parsec \/ JulianYear, 0 * Knot);\n R3Element<Speed> const v_ =\n R3Element<Speed>(-π * SpeedOfLight, -e * Kilo(Metre) \/ Hour, -1 * Knot);\n R3Element<Speed> const w_ =\n R3Element<Speed>(2 * Mile \/ Hour, 2 * Furlong \/ Day, 2 * Rod \/ Minute);\n R3Element<Speed> const a_ =\n R3Element<Speed>(88 * Mile \/ Hour, 300 * Metre \/ Second, 46 * Knot);\n\n public:\n TEST_METHOD(Dumb3Vector) {\n AssertEqual((e * Dimensionless(42)) * v_, e * (Dimensionless(42) * v_));\n TestVectorSpace<R3Element<Speed>, Dimensionless>(null_velocity_, u_, v_,\n w_, Dimensionless(0),\n Dimensionless(1), e,\n Dimensionless(42));\n TestAlternatingBilinearMap(Cross<Speed, Speed>, u_, v_, w_, a_,\n Dimensionless(42));\n TestSymmetricPositiveDefiniteBilinearMap(Dot<Speed, Speed>, u_, v_, w_, a_,\n Dimensionless(42));\n }\n\n TEST_METHOD(MixedProduct) {\n auto left_time_multiplication = [](Time left, R3Element<Speed> right) {\n return left * right;\n };\n auto right_time_multiplication = [](R3Element<Speed> left, Time right) {\n return left * right;\n };\n TestBilinearMap(left_time_multiplication, 1 * Second, 1 * JulianYear, u_, v_,\n Dimensionless(42));\n TestBilinearMap(right_time_multiplication, w_, a_, -1 * Day,\n 1 * Parsec \/ SpeedOfLight, Dimensionless(-π));\n Time t = -3 * Second;\n AssertEqual(t * u_, u_ * t);\n AssertEqual((u_ * t) \/ t, u_);\n }\n};\n\n} \/\/ namespace geometry\n} \/\/ namespace principia\n<|endoftext|>"} {"text":"<commit_before>\/*\n Copyright 2014 Brain Research Institute, Melbourne, Australia\n\n Written by David Raffelt 2014.\n\n This file is part of MRtrix.\n\n MRtrix is free software: you can redistribute it and\/or modify\n it under the terms of the GNU General Public License as published by\n the Free Software Foundation, either version 3 of the License, or\n (at your option) any later version.\n\n MRtrix is distributed in the hope that it will be useful,\n but WITHOUT ANY WARRANTY; without even the implied warranty of\n MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the\n GNU General Public License for more details.\n\n You should have received a copy of the GNU General Public License\n along with MRtrix. If not, see <http:\/\/www.gnu.org\/licenses\/>.\n\n*\/\n\n#include \"gui\/mrview\/tool\/fixel.h\"\n\n\nnamespace MR\n{\n namespace GUI\n {\n namespace MRView\n {\n namespace Tool\n {\n\n\n Fixel::Fixel (const std::string& filename, Vector& fixel_tool) :\n Displayable (filename),\n filename (filename),\n fixel_tool (fixel_tool),\n header (filename),\n fixel_data (header),\n fixel_vox (fixel_data),\n header_transform (fixel_vox),\n colourbar_position_index (4),\n slice_fixel_indices (3),\n slice_fixel_sizes (3),\n slice_fixel_counts (3),\n line_length_multiplier (1.0),\n scale_line_length_by_value (false),\n color_type (Value),\n show_colour_bar (true)\n {\n set_allowed_features (true, true, false);\n colourmap = 1;\n alpha = 1.0f;\n set_use_transparency (true);\n colour[0] = colour[1] = colour[2] = 1;\n line_length = 0.45 * static_cast<float>(fixel_vox.vox(0) + fixel_vox.vox(1) + fixel_vox.vox(2)) \/ 3.0;\n value_min = std::numeric_limits<float>::infinity();\n value_max = -std::numeric_limits<float>::infinity();\n load_image();\n }\n\n\n Fixel::~Fixel()\n {\n if (vertex_buffer)\n gl::DeleteBuffers (1, &vertex_buffer);\n if (vertex_array_object)\n gl::DeleteVertexArrays (1, &vertex_array_object);\n if (value_buffer)\n gl::DeleteBuffers (1, &value_buffer);\n if (value_array_object)\n gl::DeleteBuffers (1, &value_array_object);\n }\n\n\n std::string Fixel::Shader::vertex_shader_source (const Displayable& fixel)\n {\n std::string source =\n \"layout (location = 0) in vec3 pos;\\n\"\n \"layout (location = 1) in vec3 prev;\\n\"\n \"layout (location = 2) in vec3 next;\\n\"\n \"layout (location = 3) in float value;\\n\"\n \"uniform mat4 MVP;\\n\"\n \"uniform float line_length;\\n\"\n \"uniform float max_value;\\n\"\n \"uniform bool scale_line_length_by_value;\\n\"\n \"flat out float value_out;\\n\"\n \"out vec3 fragmentColour;\\n\";\n\n switch (color_type) {\n case Direction: break;\n case Colour:\n source += \"uniform vec3 const_colour;\\n\";\n break;\n case Value:\n source += \"uniform float offset, scale;\\n\";\n break;\n }\n\n source +=\n \"void main() {\\n\"\n \" vec3 centre = pos;\\n\"\n \" vec3 dir = next;\\n\"\n \" if ((gl_VertexID % 2) > 0) {\\n\"\n \" centre = prev;\\n\"\n \" dir = -pos;\\n\"\n \" }\\n\"\n \" value_out = value;\\n\"\n \" if (scale_line_length_by_value)\\n\"\n \" gl_Position = MVP * vec4 (centre + line_length * value * dir,1);\\n\"\n \" else\\n\"\n \" gl_Position = MVP * vec4 (centre + line_length * dir,1);\\n\";\n\n switch (color_type) {\n case Colour:\n source +=\n \" fragmentColour = const_colour;\\n\";\n break;\n case Value:\n if (!ColourMap::maps[colourmap].special) {\n source += \" float amplitude = clamp (\";\n if (fixel.scale_inverted())\n source += \"1.0 -\";\n source += \" scale * (value_out - offset), 0.0, 1.0);\\n\";\n }\n source +=\n std::string (\" vec3 color;\\n\") +\n ColourMap::maps[colourmap].mapping +\n \" fragmentColour = color;\\n\";\n break;\n case Direction:\n source +=\n \" fragmentColour = normalize (abs (dir));\\n\";\n break;\n default:\n break;\n }\n source += \"}\\n\";\n return source;\n }\n\n\n std::string Fixel::Shader::fragment_shader_source (const Displayable& fixel)\n {\n std::string source =\n \"in float include; \\n\"\n \"out vec3 color;\\n\"\n \"flat in float value_out;\\n\"\n \"in vec3 fragmentColour;\\n\";\n\n if (fixel.use_discard_lower())\n source += \"uniform float lower;\\n\";\n if (fixel.use_discard_upper())\n source += \"uniform float upper;\\n\";\n\n source +=\n \"void main(){\\n\";\n\n if (fixel.use_discard_lower())\n source += \" if (value_out < lower) discard;\\n\";\n if (fixel.use_discard_upper())\n source += \" if (value_out > upper) discard;\\n\";\n\n source +=\n std::string(\" color = fragmentColour;\\n\");\n\n source += \"}\\n\";\n return source;\n }\n\n\n bool Fixel::Shader::need_update (const Displayable& object) const\n {\n const Fixel& fixel (dynamic_cast<const Fixel&> (object));\n if (color_type != fixel.color_type)\n return true;\n return Displayable::Shader::need_update (object);\n }\n\n\n void Fixel::Shader::update (const Displayable& object)\n {\n const Fixel& fixel (dynamic_cast<const Fixel&> (object));\n do_crop_to_slice = fixel.fixel_tool.do_crop_to_slice;\n color_type = fixel.color_type;\n Displayable::Shader::update (object);\n }\n\n\n void Fixel::render (const Projection& projection, int axis, int slice)\n {\n start (fixel_shader);\n projection.set (fixel_shader);\n\n gl::Uniform1f (gl::GetUniformLocation (fixel_shader, \"line_length\"),\n line_length * line_length_multiplier);\n gl::Uniform1f (gl::GetUniformLocation (fixel_shader, \"max_value\"), value_max);\n gl::Uniform1f (gl::GetUniformLocation (fixel_shader, \"scale_line_length_by_value\"),\n scale_line_length_by_value);\n\n if (use_discard_lower())\n gl::Uniform1f (gl::GetUniformLocation (fixel_shader, \"lower\"), lessthan);\n if (use_discard_upper())\n gl::Uniform1f (gl::GetUniformLocation (fixel_shader, \"upper\"), greaterthan);\n\n if (color_type == Colour)\n gl::Uniform3fv (gl::GetUniformLocation (fixel_shader, \"const_colour\"), 1, colour);\n\n if (fixel_tool.line_opacity < 1.0) {\n gl::Enable (gl::BLEND);\n gl::Disable (gl::DEPTH_TEST);\n gl::DepthMask (gl::FALSE_);\n gl::BlendEquation (gl::FUNC_ADD);\n gl::BlendFunc (gl::CONSTANT_ALPHA, gl::ONE);\n gl::BlendColor (1.0, 1.0, 1.0, fixel_tool.line_opacity);\n } else {\n gl::Disable (gl::BLEND);\n gl::Enable (gl::DEPTH_TEST);\n gl::DepthMask (gl::TRUE_);\n }\n\n gl::LineWidth (fixel_tool.line_thickness);\n\n gl::BindVertexArray (vertex_array_object);\n\n if (!fixel_tool.do_crop_to_slice) {\n for (size_t x = 0; x < slice_fixel_indices[0].size(); ++x)\n gl::MultiDrawArrays (gl::LINES, &slice_fixel_indices[0][x][0], &slice_fixel_sizes[0][x][0], slice_fixel_counts[0][x]);\n } else {\n gl::MultiDrawArrays (gl::LINES, &slice_fixel_indices[axis][slice][0], &slice_fixel_sizes[axis][slice][0], slice_fixel_counts[axis][slice]);\n }\n\n if (fixel_tool.line_opacity < 1.0) {\n gl::Disable (gl::BLEND);\n gl::Enable (gl::DEPTH_TEST);\n gl::DepthMask (gl::TRUE_);\n }\n\n stop (fixel_shader);\n }\n\n\n void Fixel::load_image ()\n {\n for (size_t dim = 0; dim < 3; ++dim) {\n slice_fixel_indices[dim].resize (fixel_vox.dim(dim));\n slice_fixel_sizes[dim].resize (fixel_vox.dim(dim));\n slice_fixel_counts[dim].resize (fixel_vox.dim(dim), 0);\n }\n\n MR::Image::LoopInOrder loop (fixel_vox);\n std::vector<Point<float> > buffer_dir;\n std::vector<float> buffer_val;\n buffer_dir.push_back(Point<float>());\n buffer_val.push_back(NAN);\n Point<float> voxel_pos;\n for (loop.start (fixel_vox); loop.ok(); loop.next (fixel_vox)) {\n for (size_t f = 0; f != fixel_vox.value().size(); ++f) {\n if (fixel_vox.value()[f].value > value_max)\n value_max = fixel_vox.value()[f].value;\n if (fixel_vox.value()[f].value < value_min)\n value_min = fixel_vox.value()[f].value;\n for (size_t dim = 0; dim < 3; ++dim) {\n slice_fixel_indices[dim][fixel_vox[dim]].push_back (buffer_dir.size() - 1);\n slice_fixel_sizes[dim][fixel_vox[dim]].push_back(2);\n slice_fixel_counts[dim][fixel_vox[dim]]++;\n }\n header_transform.voxel2scanner (fixel_vox, voxel_pos);\n buffer_dir.push_back (voxel_pos);\n buffer_dir.push_back (fixel_vox.value()[f].dir);\n buffer_val.push_back (fixel_vox.value()[f].value);\n buffer_val.push_back (fixel_vox.value()[f].value);\n }\n }\n buffer_dir.push_back (Point<float>());\n buffer_val.push_back (NAN);\n this->set_windowing (value_min, value_max);\n greaterthan = value_max;\n lessthan = value_min;\n\n \/\/ voxel centres and fixel directions\n gl::GenBuffers (1, &vertex_buffer);\n gl::BindBuffer (gl::ARRAY_BUFFER, vertex_buffer);\n gl::BufferData (gl::ARRAY_BUFFER, buffer_dir.size() * sizeof(Point<float>), &buffer_dir[0][0], gl::STATIC_DRAW);\n gl::GenVertexArrays (1, &vertex_array_object);\n gl::BindVertexArray (vertex_array_object);\n gl::EnableVertexAttribArray (0);\n gl::VertexAttribPointer (0, 3, gl::FLOAT, gl::FALSE_, 0, (void*)(3*sizeof(float)));\n gl::EnableVertexAttribArray (1);\n gl::VertexAttribPointer (1, 3, gl::FLOAT, gl::FALSE_, 0, (void*)0);\n gl::EnableVertexAttribArray (2);\n gl::VertexAttribPointer (2, 3, gl::FLOAT, gl::FALSE_, 0, (void*)(6*sizeof(float)));\n\n \/\/ fixel values\n gl::GenBuffers (1, &value_buffer);\n gl::BindBuffer (gl::ARRAY_BUFFER, value_buffer);\n gl::BufferData (gl::ARRAY_BUFFER, buffer_val.size() * sizeof(float), &buffer_val[0], gl::STATIC_DRAW);\n gl::EnableVertexAttribArray (3);\n gl::VertexAttribPointer (3, 1, gl::FLOAT, gl::FALSE_, 0, (void*)(sizeof(float)));\n }\n }\n }\n }\n}\n<commit_msg>Fixed seg fault when vector plot overlay tried to render slice outside of the image<commit_after>\/*\n Copyright 2014 Brain Research Institute, Melbourne, Australia\n\n Written by David Raffelt 2014.\n\n This file is part of MRtrix.\n\n MRtrix is free software: you can redistribute it and\/or modify\n it under the terms of the GNU General Public License as published by\n the Free Software Foundation, either version 3 of the License, or\n (at your option) any later version.\n\n MRtrix is distributed in the hope that it will be useful,\n but WITHOUT ANY WARRANTY; without even the implied warranty of\n MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the\n GNU General Public License for more details.\n\n You should have received a copy of the GNU General Public License\n along with MRtrix. If not, see <http:\/\/www.gnu.org\/licenses\/>.\n\n*\/\n\n#include \"gui\/mrview\/tool\/fixel.h\"\n\n\nnamespace MR\n{\n namespace GUI\n {\n namespace MRView\n {\n namespace Tool\n {\n\n\n Fixel::Fixel (const std::string& filename, Vector& fixel_tool) :\n Displayable (filename),\n filename (filename),\n fixel_tool (fixel_tool),\n header (filename),\n fixel_data (header),\n fixel_vox (fixel_data),\n header_transform (fixel_vox),\n colourbar_position_index (4),\n slice_fixel_indices (3),\n slice_fixel_sizes (3),\n slice_fixel_counts (3),\n line_length_multiplier (1.0),\n scale_line_length_by_value (false),\n color_type (Value),\n show_colour_bar (true)\n {\n set_allowed_features (true, true, false);\n colourmap = 1;\n alpha = 1.0f;\n set_use_transparency (true);\n colour[0] = colour[1] = colour[2] = 1;\n line_length = 0.45 * static_cast<float>(fixel_vox.vox(0) + fixel_vox.vox(1) + fixel_vox.vox(2)) \/ 3.0;\n value_min = std::numeric_limits<float>::infinity();\n value_max = -std::numeric_limits<float>::infinity();\n load_image();\n }\n\n\n Fixel::~Fixel()\n {\n if (vertex_buffer)\n gl::DeleteBuffers (1, &vertex_buffer);\n if (vertex_array_object)\n gl::DeleteVertexArrays (1, &vertex_array_object);\n if (value_buffer)\n gl::DeleteBuffers (1, &value_buffer);\n if (value_array_object)\n gl::DeleteBuffers (1, &value_array_object);\n }\n\n\n std::string Fixel::Shader::vertex_shader_source (const Displayable& fixel)\n {\n std::string source =\n \"layout (location = 0) in vec3 pos;\\n\"\n \"layout (location = 1) in vec3 prev;\\n\"\n \"layout (location = 2) in vec3 next;\\n\"\n \"layout (location = 3) in float value;\\n\"\n \"uniform mat4 MVP;\\n\"\n \"uniform float line_length;\\n\"\n \"uniform float max_value;\\n\"\n \"uniform bool scale_line_length_by_value;\\n\"\n \"flat out float value_out;\\n\"\n \"out vec3 fragmentColour;\\n\";\n\n switch (color_type) {\n case Direction: break;\n case Colour:\n source += \"uniform vec3 const_colour;\\n\";\n break;\n case Value:\n source += \"uniform float offset, scale;\\n\";\n break;\n }\n\n source +=\n \"void main() {\\n\"\n \" vec3 centre = pos;\\n\"\n \" vec3 dir = next;\\n\"\n \" if ((gl_VertexID % 2) > 0) {\\n\"\n \" centre = prev;\\n\"\n \" dir = -pos;\\n\"\n \" }\\n\"\n \" value_out = value;\\n\"\n \" if (scale_line_length_by_value)\\n\"\n \" gl_Position = MVP * vec4 (centre + line_length * value * dir,1);\\n\"\n \" else\\n\"\n \" gl_Position = MVP * vec4 (centre + line_length * dir,1);\\n\";\n\n switch (color_type) {\n case Colour:\n source +=\n \" fragmentColour = const_colour;\\n\";\n break;\n case Value:\n if (!ColourMap::maps[colourmap].special) {\n source += \" float amplitude = clamp (\";\n if (fixel.scale_inverted())\n source += \"1.0 -\";\n source += \" scale * (value_out - offset), 0.0, 1.0);\\n\";\n }\n source +=\n std::string (\" vec3 color;\\n\") +\n ColourMap::maps[colourmap].mapping +\n \" fragmentColour = color;\\n\";\n break;\n case Direction:\n source +=\n \" fragmentColour = normalize (abs (dir));\\n\";\n break;\n default:\n break;\n }\n source += \"}\\n\";\n return source;\n }\n\n\n std::string Fixel::Shader::fragment_shader_source (const Displayable& fixel)\n {\n std::string source =\n \"in float include; \\n\"\n \"out vec3 color;\\n\"\n \"flat in float value_out;\\n\"\n \"in vec3 fragmentColour;\\n\";\n\n if (fixel.use_discard_lower())\n source += \"uniform float lower;\\n\";\n if (fixel.use_discard_upper())\n source += \"uniform float upper;\\n\";\n\n source +=\n \"void main(){\\n\";\n\n if (fixel.use_discard_lower())\n source += \" if (value_out < lower) discard;\\n\";\n if (fixel.use_discard_upper())\n source += \" if (value_out > upper) discard;\\n\";\n\n source +=\n std::string(\" color = fragmentColour;\\n\");\n\n source += \"}\\n\";\n return source;\n }\n\n\n bool Fixel::Shader::need_update (const Displayable& object) const\n {\n const Fixel& fixel (dynamic_cast<const Fixel&> (object));\n if (color_type != fixel.color_type)\n return true;\n return Displayable::Shader::need_update (object);\n }\n\n\n void Fixel::Shader::update (const Displayable& object)\n {\n const Fixel& fixel (dynamic_cast<const Fixel&> (object));\n do_crop_to_slice = fixel.fixel_tool.do_crop_to_slice;\n color_type = fixel.color_type;\n Displayable::Shader::update (object);\n }\n\n\n void Fixel::render (const Projection& projection, int axis, int slice)\n {\n\n if (fixel_tool.do_crop_to_slice && (slice < 0 || slice >= header.dim(axis)))\n return;\n\n start (fixel_shader);\n projection.set (fixel_shader);\n\n gl::Uniform1f (gl::GetUniformLocation (fixel_shader, \"line_length\"),\n line_length * line_length_multiplier);\n gl::Uniform1f (gl::GetUniformLocation (fixel_shader, \"max_value\"), value_max);\n gl::Uniform1f (gl::GetUniformLocation (fixel_shader, \"scale_line_length_by_value\"),\n scale_line_length_by_value);\n\n if (use_discard_lower())\n gl::Uniform1f (gl::GetUniformLocation (fixel_shader, \"lower\"), lessthan);\n if (use_discard_upper())\n gl::Uniform1f (gl::GetUniformLocation (fixel_shader, \"upper\"), greaterthan);\n\n if (color_type == Colour)\n gl::Uniform3fv (gl::GetUniformLocation (fixel_shader, \"const_colour\"), 1, colour);\n\n if (fixel_tool.line_opacity < 1.0) {\n gl::Enable (gl::BLEND);\n gl::Disable (gl::DEPTH_TEST);\n gl::DepthMask (gl::FALSE_);\n gl::BlendEquation (gl::FUNC_ADD);\n gl::BlendFunc (gl::CONSTANT_ALPHA, gl::ONE);\n gl::BlendColor (1.0, 1.0, 1.0, fixel_tool.line_opacity);\n } else {\n gl::Disable (gl::BLEND);\n gl::Enable (gl::DEPTH_TEST);\n gl::DepthMask (gl::TRUE_);\n }\n\n gl::LineWidth (fixel_tool.line_thickness);\n\n gl::BindVertexArray (vertex_array_object);\n\n if (!fixel_tool.do_crop_to_slice) {\n for (size_t x = 0; x < slice_fixel_indices[0].size(); ++x)\n gl::MultiDrawArrays (gl::LINES, &slice_fixel_indices[0][x][0], &slice_fixel_sizes[0][x][0], slice_fixel_counts[0][x]);\n } else {\n gl::MultiDrawArrays (gl::LINES, &slice_fixel_indices[axis][slice][0], &slice_fixel_sizes[axis][slice][0], slice_fixel_counts[axis][slice]);\n }\n\n if (fixel_tool.line_opacity < 1.0) {\n gl::Disable (gl::BLEND);\n gl::Enable (gl::DEPTH_TEST);\n gl::DepthMask (gl::TRUE_);\n }\n\n stop (fixel_shader);\n }\n\n\n void Fixel::load_image ()\n {\n for (size_t dim = 0; dim < 3; ++dim) {\n slice_fixel_indices[dim].resize (fixel_vox.dim(dim));\n slice_fixel_sizes[dim].resize (fixel_vox.dim(dim));\n slice_fixel_counts[dim].resize (fixel_vox.dim(dim), 0);\n }\n\n MR::Image::LoopInOrder loop (fixel_vox);\n std::vector<Point<float> > buffer_dir;\n std::vector<float> buffer_val;\n buffer_dir.push_back(Point<float>());\n buffer_val.push_back(NAN);\n Point<float> voxel_pos;\n for (loop.start (fixel_vox); loop.ok(); loop.next (fixel_vox)) {\n for (size_t f = 0; f != fixel_vox.value().size(); ++f) {\n if (fixel_vox.value()[f].value > value_max)\n value_max = fixel_vox.value()[f].value;\n if (fixel_vox.value()[f].value < value_min)\n value_min = fixel_vox.value()[f].value;\n for (size_t dim = 0; dim < 3; ++dim) {\n slice_fixel_indices[dim][fixel_vox[dim]].push_back (buffer_dir.size() - 1);\n slice_fixel_sizes[dim][fixel_vox[dim]].push_back(2);\n slice_fixel_counts[dim][fixel_vox[dim]]++;\n }\n header_transform.voxel2scanner (fixel_vox, voxel_pos);\n buffer_dir.push_back (voxel_pos);\n buffer_dir.push_back (fixel_vox.value()[f].dir);\n buffer_val.push_back (fixel_vox.value()[f].value);\n buffer_val.push_back (fixel_vox.value()[f].value);\n }\n }\n buffer_dir.push_back (Point<float>());\n buffer_val.push_back (NAN);\n this->set_windowing (value_min, value_max);\n greaterthan = value_max;\n lessthan = value_min;\n\n \/\/ voxel centres and fixel directions\n gl::GenBuffers (1, &vertex_buffer);\n gl::BindBuffer (gl::ARRAY_BUFFER, vertex_buffer);\n gl::BufferData (gl::ARRAY_BUFFER, buffer_dir.size() * sizeof(Point<float>), &buffer_dir[0][0], gl::STATIC_DRAW);\n gl::GenVertexArrays (1, &vertex_array_object);\n gl::BindVertexArray (vertex_array_object);\n gl::EnableVertexAttribArray (0);\n gl::VertexAttribPointer (0, 3, gl::FLOAT, gl::FALSE_, 0, (void*)(3*sizeof(float)));\n gl::EnableVertexAttribArray (1);\n gl::VertexAttribPointer (1, 3, gl::FLOAT, gl::FALSE_, 0, (void*)0);\n gl::EnableVertexAttribArray (2);\n gl::VertexAttribPointer (2, 3, gl::FLOAT, gl::FALSE_, 0, (void*)(6*sizeof(float)));\n\n \/\/ fixel values\n gl::GenBuffers (1, &value_buffer);\n gl::BindBuffer (gl::ARRAY_BUFFER, value_buffer);\n gl::BufferData (gl::ARRAY_BUFFER, buffer_val.size() * sizeof(float), &buffer_val[0], gl::STATIC_DRAW);\n gl::EnableVertexAttribArray (3);\n gl::VertexAttribPointer (3, 1, gl::FLOAT, gl::FALSE_, 0, (void*)(sizeof(float)));\n }\n }\n }\n }\n}\n<|endoftext|>"} {"text":"<commit_before>\/*\nResembla: Word-based Japanese similar sentence search library\nhttps:\/\/github.com\/tuem\/resembla\n\nCopyright 2017 Takashi Uemura\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#ifndef __HIERARCHICAL_RESEMBLA_HPP__\n#define __HIERARCHICAL_RESEMBLA_HPP__\n\n#include <string>\n#include <vector>\n#include <memory>\n#include <fstream>\n\n#include <resembla\/resembla_interface.hpp>\n#include <resembla\/reranker.hpp>\n\nnamespace resembla {\n\ntemplate<class Preprocessor, class ScoreFunction>\nclass HierarchicalResembla: public ResemblaInterface\n{\npublic:\n HierarchicalResembla(std::shared_ptr<ResemblaInterface> resembla, size_t max_candidate,\n std::shared_ptr<Preprocessor> preprocess, std::shared_ptr<ScoreFunction> score_func,\n const std::string corpus_path = \"\", int col = 2):\n resembla(resembla), max_candidate(max_candidate),\n preprocess(preprocess), score_func(score_func), reranker(), preprocess_corpus(!corpus_path.empty())\n {\n if(preprocess_corpus){\n loadCorpusFeatures(corpus_path, col);\n }\n }\n\n std::vector<ResemblaInterface::response_type> getSimilarTexts(\n const string_type& input, size_t max_response, double threshold)\n {\n \/\/ extract candidates using original resembla\n std::vector<WorkData> candidates;\n auto original_results = resembla->getSimilarTexts(input, max_candidate, threshold);\n for(const auto& original_result: original_results){\n if(preprocess_corpus){\n candidates.push_back(std::make_pair(original_result.text, (*preprocess)(original_result, corpus_features[original_result.text])));\n }\n else{\n candidates.push_back(std::make_pair(original_result.text, (*preprocess)(original_result)));\n }\n }\n\n \/\/ rerank by its own metric\n WorkData input_data = std::make_pair(input, (*preprocess)(input));\n auto reranked = reranker.rerank(input_data, std::begin(candidates), std::end(candidates), *score_func);\n\n std::vector<ResemblaInterface::response_type> results;\n for(const auto& r: reranked){\n if(r.second < threshold || results.size() >= max_response){\n break;\n }\n results.push_back({r.first, score_func->name, r.second});\n }\n return results;\n }\n\nprotected:\n using WorkData = std::pair<string_type, typename Preprocessor::return_type>;\n\n const std::shared_ptr<ResemblaInterface> resembla;\n const size_t max_candidate;\n\n const std::shared_ptr<Preprocessor> preprocess;\n const std::shared_ptr<ScoreFunction> score_func;\n const Reranker<string_type> reranker;\n\n bool preprocess_corpus;\n\n void loadCorpusFeatures(const std::string& corpus_path, size_t col)\n {\n std::ifstream ifs(corpus_path);\n if(ifs.fail()){\n throw std::runtime_error(\"input file is not available: \" + corpus_path);\n }\n while(ifs.good()){\n std::string line;\n std::getline(ifs, line);\n if(ifs.eof() || line.length() == 0){\n break;\n }\n auto columns = split(line, '\\t');\n if(columns.size() + 1 < col){\n continue;\n }\n corpus_features[cast_string<string_type>(columns[0])] = (*preprocess)(columns[0], columns[1]);\n }\n }\n\n std::unordered_map<string_type, typename Preprocessor::return_type> corpus_features;\n};\n\n}\n#endif\n<commit_msg>improve code<commit_after>\/*\nResembla: Word-based Japanese similar sentence search library\nhttps:\/\/github.com\/tuem\/resembla\n\nCopyright 2017 Takashi Uemura\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#ifndef __HIERARCHICAL_RESEMBLA_HPP__\n#define __HIERARCHICAL_RESEMBLA_HPP__\n\n#include <string>\n#include <vector>\n#include <memory>\n#include <unordered_map>\n#include <fstream>\n\n#include <resembla\/resembla_interface.hpp>\n#include <resembla\/reranker.hpp>\n\nnamespace resembla {\n\ntemplate<class Preprocessor, class ScoreFunction>\nclass HierarchicalResembla: public ResemblaInterface\n{\npublic:\n HierarchicalResembla(std::shared_ptr<ResemblaInterface> resembla, size_t max_candidate,\n std::shared_ptr<Preprocessor> preprocess, std::shared_ptr<ScoreFunction> score_func,\n std::string corpus_path = \"\", size_t col = 2):\n resembla(resembla), max_candidate(max_candidate),\n preprocess(preprocess), score_func(score_func), reranker(), preprocess_corpus(!corpus_path.empty())\n {\n if(preprocess_corpus){\n loadCorpusFeatures(corpus_path, col);\n }\n }\n\n std::vector<ResemblaInterface::response_type> getSimilarTexts(\n const string_type& input, size_t max_response, double threshold)\n {\n \/\/ extract candidates using original resembla\n std::vector<WorkData> candidates;\n auto original_results = resembla->getSimilarTexts(input, max_candidate, threshold);\n for(const auto& original_result: original_results){\n candidates.push_back(std::make_pair(original_result.text, preprocess_corpus ?\n (*preprocess)(original_result, corpus_features[original_result.text]) :\n (*preprocess)(original_result)));\n }\n\n \/\/ rerank by its own metric\n WorkData input_data = std::make_pair(input, (*preprocess)(input));\n auto reranked = reranker.rerank(input_data, std::begin(candidates), std::end(candidates), *score_func);\n\n std::vector<ResemblaInterface::response_type> results;\n for(const auto& r: reranked){\n if(r.second < threshold || results.size() >= max_response){\n break;\n }\n results.push_back({r.first, score_func->name, r.second});\n }\n return results;\n }\n\nprotected:\n using WorkData = std::pair<string_type, typename Preprocessor::return_type>;\n\n const std::shared_ptr<ResemblaInterface> resembla;\n const size_t max_candidate;\n\n const std::shared_ptr<Preprocessor> preprocess;\n const std::shared_ptr<ScoreFunction> score_func;\n const Reranker<string_type> reranker;\n\n const bool preprocess_corpus;\n\n void loadCorpusFeatures(const std::string& corpus_path, size_t col)\n {\n std::ifstream ifs(corpus_path);\n if(ifs.fail()){\n throw std::runtime_error(\"input file is not available: \" + corpus_path);\n }\n while(ifs.good()){\n std::string line;\n std::getline(ifs, line);\n if(ifs.eof() || line.length() == 0){\n break;\n }\n auto columns = split(line, '\\t');\n if(columns.size() + 1 < col){\n continue;\n }\n corpus_features[cast_string<string_type>(columns[0])] = (*preprocess)(columns[0], columns[1]);\n }\n }\n\n std::unordered_map<string_type, typename Preprocessor::return_type> corpus_features;\n};\n\n}\n#endif\n<|endoftext|>"} {"text":"<commit_before>\/****************************************************************\n *\n * Copyright (c) 2011\n * All rights reserved.\n *\n * Hochschule Bonn-Rhein-Sieg\n * University of Applied Sciences\n * Computer Science Department\n *\n * +++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++\n *\n * Author:\n * Jan Paulus, Nico Hochgeschwender, Michael Reckhaus, Azamat Shakhimardanov\n * Supervised by:\n * Gerhard K. Kraetzschmar\n *\n * +++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++\n *\n * This sofware is published under a dual-license: GNU Lesser General Public\n * License LGPL 2.1 and BSD license. The dual-license implies that users of this\n * code may choose which terms they prefer.\n *\n * +++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++\n *\n * Redistribution and use in source and binary forms, with or without\n * modification, are permitted provided that the following conditions are met:\n *\n * * Redistributions of source code must retain the above copyright\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 Hochschule Bonn-Rhein-Sieg 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 program is free software: you can redistribute it and\/or modify\n * it under the terms of the GNU Lesser General Public License LGPL as\n * published by the Free Software Foundation, either version 2.1 of the\n * License, or (at your option) any later version or the BSD 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 Lesser General Public License LGPL and the BSD license for more details.\n *\n * You should have received a copy of the GNU Lesser General Public\n * License LGPL and BSD license along with this program.\n *\n ****************************************************************\/\n\n#ifndef _YOUBOT_SLAVE_MAILBOX_MESSAGE_H\n#define\t_YOUBOT_SLAVE_MAILBOX_MESSAGE_H\n\n#include <ethercattype.h>\n#include <string>\n#include <time.h>\n\nnamespace youbot {\n\n \/\/\/ Output part from the EtherCAT mailbox message of the youBot slaves\n\n struct mailboxOutputBuffer {\n uint8 moduleAddress; \/\/0 = Drive 1 = Gripper\n uint8 commandNumber;\n uint8 typeNumber;\n uint8 motorNumber; \/\/always zero\n uint32 value; \/\/MSB first!\n\n mailboxOutputBuffer() : moduleAddress(0), commandNumber(0), typeNumber(0), motorNumber(0), value(0) {};\n } __attribute__((__packed__));\n\n \/\/\/ Input part from the EtherCAT mailbox message of the youBot slaves\n\n struct mailboxInputBuffer {\n uint8 replyAddress;\n uint8 moduleAddress;\n uint8 status; \/\/(e.g. 100 means “no error”)\n uint8 commandNumber;\n uint32 value; \/\/MSB first!\n\n mailboxInputBuffer() : replyAddress(0), moduleAddress(0), status(0), commandNumber(0), value(0) {};\n } __attribute__((__packed__));\n\n \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n \/\/\/ EtherCAT mailbox message of the youBot slaves \n \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n class YouBotSlaveMailboxMsg {\n public:\n\n mailboxOutputBuffer stctOutput;\n mailboxInputBuffer stctInput;\n\n \/\/ Constructor\n YouBotSlaveMailboxMsg() {\n slaveNumber = 1000;\n }\n\n \/\/ Constructor\n\n YouBotSlaveMailboxMsg(unsigned int slaveNo) {\n slaveNumber = slaveNo;\n }\n \/\/ Copy-Constructor\n\n YouBotSlaveMailboxMsg(const YouBotSlaveMailboxMsg& copy) {\n stctOutput = copy.stctOutput;\n stctInput = copy.stctInput;\n slaveNumber = copy.slaveNumber;\n parameterName = copy.parameterName;\n }\n \n\n \/\/ Destructor\n\n ~YouBotSlaveMailboxMsg() {\n }\n\n \/\/ assignment operator\n\n YouBotSlaveMailboxMsg & operator=(const YouBotSlaveMailboxMsg& copy) {\n stctOutput = copy.stctOutput;\n stctInput = copy.stctInput;\n slaveNumber = copy.slaveNumber;\n parameterName = copy.parameterName;\n return *this;\n }\n \n std::string parameterName;\n unsigned int slaveNumber;\n };\n \n \n \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n \/\/\/ EtherCAT mailbox message of the youBot slaves (thread safe)\n \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n class YouBotSlaveMailboxMsgThreadSafe {\n public:\n\n DataObjectLockFree<mailboxOutputBuffer> stctOutput;\n DataObjectLockFree<mailboxInputBuffer> stctInput;\n\n \/\/ Constructor\n YouBotSlaveMailboxMsgThreadSafe() {\n slaveNumber.Set(1000);\n }\n\n \/\/ Constructor\n\n YouBotSlaveMailboxMsgThreadSafe(unsigned int slaveNo) {\n slaveNumber.Set(slaveNo);\n }\n \/\/ Copy-Constructor\n\n YouBotSlaveMailboxMsgThreadSafe(const YouBotSlaveMailboxMsgThreadSafe& copy) {\n mailboxOutputBuffer tempStctOutput;\n mailboxInputBuffer tempStctInput;\n std::string tempParameterName;\n unsigned int SlaveNumber;\n \n \n copy.stctOutput.Get(tempStctOutput);\n stctOutput.Set(tempStctOutput);\n \n copy.stctInput.Get(tempStctInput);\n stctInput.Set(tempStctInput);\n \n copy.slaveNumber.Get(SlaveNumber);\n slaveNumber.Set(SlaveNumber);\n \n copy.parameterName.Get(tempParameterName);\n parameterName.Set(tempParameterName);\n }\n\n \/\/ Destructor\n\n ~YouBotSlaveMailboxMsgThreadSafe() {\n }\n\n \/\/ assignment operator\n\n YouBotSlaveMailboxMsgThreadSafe & operator=(const YouBotSlaveMailboxMsgThreadSafe& copy) {\n mailboxOutputBuffer tempStctOutput;\n mailboxInputBuffer tempStctInput;\n std::string tempParameterName;\n unsigned int SlaveNumber;\n \n \n copy.stctOutput.Get(tempStctOutput);\n stctOutput.Set(tempStctOutput);\n \n copy.stctInput.Get(tempStctInput);\n stctInput.Set(tempStctInput);\n \n copy.slaveNumber.Get(SlaveNumber);\n slaveNumber.Set(SlaveNumber);\n \n copy.parameterName.Get(tempParameterName);\n parameterName.Set(tempParameterName);\n return *this;\n }\n\n DataObjectLockFree<std::string> parameterName;\n\n DataObjectLockFree<unsigned int> slaveNumber;\n };\n \n \n\n} \/\/ namespace youbot\n\n#endif\t\/* _YOUBOT_SLAVE_MESSAGE_H *\/\n<commit_msg>add missing include file<commit_after>\/****************************************************************\n *\n * Copyright (c) 2011\n * All rights reserved.\n *\n * Hochschule Bonn-Rhein-Sieg\n * University of Applied Sciences\n * Computer Science Department\n *\n * +++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++\n *\n * Author:\n * Jan Paulus, Nico Hochgeschwender, Michael Reckhaus, Azamat Shakhimardanov\n * Supervised by:\n * Gerhard K. Kraetzschmar\n *\n * +++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++\n *\n * This sofware is published under a dual-license: GNU Lesser General Public\n * License LGPL 2.1 and BSD license. The dual-license implies that users of this\n * code may choose which terms they prefer.\n *\n * +++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++\n *\n * Redistribution and use in source and binary forms, with or without\n * modification, are permitted provided that the following conditions are met:\n *\n * * Redistributions of source code must retain the above copyright\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 Hochschule Bonn-Rhein-Sieg 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 program is free software: you can redistribute it and\/or modify\n * it under the terms of the GNU Lesser General Public License LGPL as\n * published by the Free Software Foundation, either version 2.1 of the\n * License, or (at your option) any later version or the BSD 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 Lesser General Public License LGPL and the BSD license for more details.\n *\n * You should have received a copy of the GNU Lesser General Public\n * License LGPL and BSD license along with this program.\n *\n ****************************************************************\/\n\n#ifndef _YOUBOT_SLAVE_MAILBOX_MESSAGE_H\n#define\t_YOUBOT_SLAVE_MAILBOX_MESSAGE_H\n\n#include <ethercattype.h>\n#include <string>\n#include <time.h>\n#include \"generic\/dataobjectlockfree\/DataObjectLockFree.hpp\"\n\nnamespace youbot {\n\n \/\/\/ Output part from the EtherCAT mailbox message of the youBot slaves\n\n struct mailboxOutputBuffer {\n uint8 moduleAddress; \/\/0 = Drive 1 = Gripper\n uint8 commandNumber;\n uint8 typeNumber;\n uint8 motorNumber; \/\/always zero\n uint32 value; \/\/MSB first!\n\n mailboxOutputBuffer() : moduleAddress(0), commandNumber(0), typeNumber(0), motorNumber(0), value(0) {};\n } __attribute__((__packed__));\n\n \/\/\/ Input part from the EtherCAT mailbox message of the youBot slaves\n\n struct mailboxInputBuffer {\n uint8 replyAddress;\n uint8 moduleAddress;\n uint8 status; \/\/(e.g. 100 means “no error”)\n uint8 commandNumber;\n uint32 value; \/\/MSB first!\n\n mailboxInputBuffer() : replyAddress(0), moduleAddress(0), status(0), commandNumber(0), value(0) {};\n } __attribute__((__packed__));\n\n \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n \/\/\/ EtherCAT mailbox message of the youBot slaves \n \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n class YouBotSlaveMailboxMsg {\n public:\n\n mailboxOutputBuffer stctOutput;\n mailboxInputBuffer stctInput;\n\n \/\/ Constructor\n YouBotSlaveMailboxMsg() {\n slaveNumber = 1000;\n }\n\n \/\/ Constructor\n\n YouBotSlaveMailboxMsg(unsigned int slaveNo) {\n slaveNumber = slaveNo;\n }\n \/\/ Copy-Constructor\n\n YouBotSlaveMailboxMsg(const YouBotSlaveMailboxMsg& copy) {\n stctOutput = copy.stctOutput;\n stctInput = copy.stctInput;\n slaveNumber = copy.slaveNumber;\n parameterName = copy.parameterName;\n }\n \n\n \/\/ Destructor\n\n ~YouBotSlaveMailboxMsg() {\n }\n\n \/\/ assignment operator\n\n YouBotSlaveMailboxMsg & operator=(const YouBotSlaveMailboxMsg& copy) {\n stctOutput = copy.stctOutput;\n stctInput = copy.stctInput;\n slaveNumber = copy.slaveNumber;\n parameterName = copy.parameterName;\n return *this;\n }\n \n std::string parameterName;\n unsigned int slaveNumber;\n };\n \n \n \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n \/\/\/ EtherCAT mailbox message of the youBot slaves (thread safe)\n \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n class YouBotSlaveMailboxMsgThreadSafe {\n public:\n\n DataObjectLockFree<mailboxOutputBuffer> stctOutput;\n DataObjectLockFree<mailboxInputBuffer> stctInput;\n\n \/\/ Constructor\n YouBotSlaveMailboxMsgThreadSafe() {\n slaveNumber.Set(1000);\n }\n\n \/\/ Constructor\n\n YouBotSlaveMailboxMsgThreadSafe(unsigned int slaveNo) {\n slaveNumber.Set(slaveNo);\n }\n \/\/ Copy-Constructor\n\n YouBotSlaveMailboxMsgThreadSafe(const YouBotSlaveMailboxMsgThreadSafe& copy) {\n mailboxOutputBuffer tempStctOutput;\n mailboxInputBuffer tempStctInput;\n std::string tempParameterName;\n unsigned int SlaveNumber;\n \n \n copy.stctOutput.Get(tempStctOutput);\n stctOutput.Set(tempStctOutput);\n \n copy.stctInput.Get(tempStctInput);\n stctInput.Set(tempStctInput);\n \n copy.slaveNumber.Get(SlaveNumber);\n slaveNumber.Set(SlaveNumber);\n \n copy.parameterName.Get(tempParameterName);\n parameterName.Set(tempParameterName);\n }\n\n \/\/ Destructor\n\n ~YouBotSlaveMailboxMsgThreadSafe() {\n }\n\n \/\/ assignment operator\n\n YouBotSlaveMailboxMsgThreadSafe & operator=(const YouBotSlaveMailboxMsgThreadSafe& copy) {\n mailboxOutputBuffer tempStctOutput;\n mailboxInputBuffer tempStctInput;\n std::string tempParameterName;\n unsigned int SlaveNumber;\n \n \n copy.stctOutput.Get(tempStctOutput);\n stctOutput.Set(tempStctOutput);\n \n copy.stctInput.Get(tempStctInput);\n stctInput.Set(tempStctInput);\n \n copy.slaveNumber.Get(SlaveNumber);\n slaveNumber.Set(SlaveNumber);\n \n copy.parameterName.Get(tempParameterName);\n parameterName.Set(tempParameterName);\n return *this;\n }\n\n DataObjectLockFree<std::string> parameterName;\n\n DataObjectLockFree<unsigned int> slaveNumber;\n };\n \n \n\n} \/\/ namespace youbot\n\n#endif\t\/* _YOUBOT_SLAVE_MESSAGE_H *\/\n<|endoftext|>"} {"text":"<commit_before>\/*\n HardwareSerial.cpp - Hardware serial library for Wiring\n Copyright (c) 2006 Nicholas Zambetti. All right reserved.\n\n This library is free software; you can redistribute it and\/or\n modify it under the terms of the GNU Lesser General Public\n License as published by the Free Software Foundation; either\n version 2.1 of the License, or (at your option) any later version.\n\n This library is distributed in the hope that it will be useful,\n but WITHOUT ANY WARRANTY; without even the implied warranty of\n MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU\n Lesser General Public License for more details.\n\n You should have received a copy of the GNU Lesser General Public\n License along with this library; if not, write to the Free Software\n Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA\n \n Modified 23 November 2006 by David A. Mellis\n Modified 28 September 2010 by Mark Sproul\n*\/\n\n#include <stdlib.h>\n#include <stdio.h>\n#include <string.h>\n#include <inttypes.h>\n#include \"wiring.h\"\n#include \"wiring_private.h\"\n\n\/\/ this next line disables the entire HardwareSerial.cpp, \n\/\/ this is so I can support Attiny series and any other chip without a uart\n#if defined(UBRRH) || defined(UBRR0H) || defined(UBRR1H) || defined(UBRR2H) || defined(UBRR3H)\n\n#include \"HardwareSerial.h\"\n\n\/\/ Define constants and variables for buffering incoming serial data. We're\n\/\/ using a ring buffer (I think), in which rx_buffer_head is the index of the\n\/\/ location to which to write the next incoming character and rx_buffer_tail\n\/\/ is the index of the location from which to read.\n#if (RAMEND < 1000)\n #define RX_BUFFER_SIZE 32\n#else\n #define RX_BUFFER_SIZE 128\n#endif\n\nstruct ring_buffer\n{\n unsigned char buffer[RX_BUFFER_SIZE];\n int head;\n int tail;\n};\n\n#if defined(UBRRH) || defined(UBRR0H)\n ring_buffer rx_buffer = { { 0 }, 0, 0 };\n#endif\n#if defined(UBRR1H)\n ring_buffer rx_buffer1 = { { 0 }, 0, 0 };\n#endif\n#if defined(UBRR2H)\n ring_buffer rx_buffer2 = { { 0 }, 0, 0 };\n#endif\n#if defined(UBRR3H)\n ring_buffer rx_buffer3 = { { 0 }, 0, 0 };\n#endif\n\ninline void store_char(unsigned char c, ring_buffer *rx_buffer)\n{\n int i = (rx_buffer->head + 1) % RX_BUFFER_SIZE;\n\n \/\/ if we should be storing the received character into the location\n \/\/ just before the tail (meaning that the head would advance to the\n \/\/ current location of the tail), we're about to overflow the buffer\n \/\/ and so we don't write the character or advance the head.\n if (i != rx_buffer->tail) {\n rx_buffer->buffer[rx_buffer->head] = c;\n rx_buffer->head = i;\n }\n}\n\n#if defined(USART_RX_vect)\n SIGNAL(USART_RX_vect)\n {\n #if defined(UDR0)\n unsigned char c = UDR0;\n #elif defined(UDR)\n unsigned char c = UDR; \/\/ atmega8535\n #else\n #error UDR not defined\n #endif\n store_char(c, &rx_buffer);\n }\n#elif defined(SIG_USART0_RECV) && defined(UDR0)\n SIGNAL(SIG_USART0_RECV)\n {\n unsigned char c = UDR0;\n store_char(c, &rx_buffer);\n }\n#elif defined(SIG_UART0_RECV) && defined(UDR0)\n SIGNAL(SIG_UART0_RECV)\n {\n unsigned char c = UDR0;\n store_char(c, &rx_buffer);\n }\n\/\/#elif defined(SIG_USART_RECV)\n#elif defined(USART0_RX_vect)\n \/\/ fixed by Mark Sproul this is on the 644\/644p\n \/\/SIGNAL(SIG_USART_RECV)\n SIGNAL(USART0_RX_vect)\n {\n #if defined(UDR0)\n unsigned char c = UDR0;\n #elif defined(UDR)\n unsigned char c = UDR; \/\/ atmega8, atmega32\n #else\n #error UDR not defined\n #endif\n store_char(c, &rx_buffer);\n }\n#elif defined(SIG_UART_RECV)\n \/\/ this is for atmega8\n SIGNAL(SIG_UART_RECV)\n {\n #if defined(UDR0)\n unsigned char c = UDR0; \/\/ atmega645\n #elif defined(UDR)\n unsigned char c = UDR; \/\/ atmega8\n #endif\n store_char(c, &rx_buffer);\n }\n#elif defined(USBCON)\n #warning No interrupt handler for usart 0\n #warning Serial(0) is on USB interface\n#else\n #error No interrupt handler for usart 0\n#endif\n\n\/\/#if defined(SIG_USART1_RECV)\n#if defined(USART1_RX_vect)\n \/\/SIGNAL(SIG_USART1_RECV)\n SIGNAL(USART1_RX_vect)\n {\n unsigned char c = UDR1;\n store_char(c, &rx_buffer1);\n }\n#elif defined(SIG_USART1_RECV)\n #error SIG_USART1_RECV\n#endif\n\n#if defined(USART2_RX_vect) && defined(UDR2)\n SIGNAL(USART2_RX_vect)\n {\n unsigned char c = UDR2;\n store_char(c, &rx_buffer2);\n }\n#elif defined(SIG_USART2_RECV)\n #error SIG_USART2_RECV\n#endif\n\n#if defined(USART3_RX_vect) && defined(UDR3)\n SIGNAL(USART3_RX_vect)\n {\n unsigned char c = UDR3;\n store_char(c, &rx_buffer3);\n }\n#elif defined(SIG_USART3_RECV)\n #error SIG_USART3_RECV\n#endif\n\n\n\n\/\/ Constructors \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nHardwareSerial::HardwareSerial(ring_buffer *rx_buffer,\n volatile uint8_t *ubrrh, volatile uint8_t *ubrrl,\n volatile uint8_t *ucsra, volatile uint8_t *ucsrb,\n volatile uint8_t *udr,\n uint8_t rxen, uint8_t txen, uint8_t rxcie, uint8_t udre, uint8_t u2x)\n{\n _rx_buffer = rx_buffer;\n _ubrrh = ubrrh;\n _ubrrl = ubrrl;\n _ucsra = ucsra;\n _ucsrb = ucsrb;\n _udr = udr;\n _rxen = rxen;\n _txen = txen;\n _rxcie = rxcie;\n _udre = udre;\n _u2x = u2x;\n}\n\n\/\/ Public Methods \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nvoid HardwareSerial::begin(long baud)\n{\n uint16_t baud_setting;\n bool use_u2x;\n\n \/\/ U2X mode is needed for baud rates higher than (CPU Hz \/ 16)\n if (baud > F_CPU \/ 16) {\n use_u2x = true;\n } else {\n \/\/ figure out if U2X mode would allow for a better connection\n \n \/\/ calculate the percent difference between the baud-rate specified and\n \/\/ the real baud rate for both U2X and non-U2X mode (0-255 error percent)\n uint8_t nonu2x_baud_error = abs((int)(255-((F_CPU\/(16*(((F_CPU\/8\/baud-1)\/2)+1))*255)\/baud)));\n uint8_t u2x_baud_error = abs((int)(255-((F_CPU\/(8*(((F_CPU\/4\/baud-1)\/2)+1))*255)\/baud)));\n \n \/\/ prefer non-U2X mode because it handles clock skew better\n use_u2x = (nonu2x_baud_error > u2x_baud_error);\n }\n \n if (use_u2x) {\n *_ucsra = 1 << _u2x;\n baud_setting = (F_CPU \/ 4 \/ baud - 1) \/ 2;\n } else {\n *_ucsra = 0;\n baud_setting = (F_CPU \/ 8 \/ baud - 1) \/ 2;\n }\n\n \/\/ assign the baud_setting, a.k.a. ubbr (USART Baud Rate Register)\n *_ubrrh = baud_setting >> 8;\n *_ubrrl = baud_setting;\n\n sbi(*_ucsrb, _rxen);\n sbi(*_ucsrb, _txen);\n sbi(*_ucsrb, _rxcie);\n}\n\nvoid HardwareSerial::end()\n{\n cbi(*_ucsrb, _rxen);\n cbi(*_ucsrb, _txen);\n cbi(*_ucsrb, _rxcie); \n}\n\nint HardwareSerial::available(void)\n{\n return (RX_BUFFER_SIZE + _rx_buffer->head - _rx_buffer->tail) % RX_BUFFER_SIZE;\n}\n\nint HardwareSerial::peek(void)\n{\n if (_rx_buffer->head == _rx_buffer->tail) {\n return -1;\n } else {\n return _rx_buffer->buffer[_rx_buffer->tail];\n }\n}\n\nint HardwareSerial::read(void)\n{\n \/\/ if the head isn't ahead of the tail, we don't have any characters\n if (_rx_buffer->head == _rx_buffer->tail) {\n return -1;\n } else {\n unsigned char c = _rx_buffer->buffer[_rx_buffer->tail];\n _rx_buffer->tail = (_rx_buffer->tail + 1) % RX_BUFFER_SIZE;\n return c;\n }\n}\n\nvoid HardwareSerial::flush()\n{\n \/\/ don't reverse this or there may be problems if the RX interrupt\n \/\/ occurs after reading the value of rx_buffer_head but before writing\n \/\/ the value to rx_buffer_tail; the previous value of rx_buffer_head\n \/\/ may be written to rx_buffer_tail, making it appear as if the buffer\n \/\/ don't reverse this or there may be problems if the RX interrupt\n \/\/ occurs after reading the value of rx_buffer_head but before writing\n \/\/ the value to rx_buffer_tail; the previous value of rx_buffer_head\n \/\/ may be written to rx_buffer_tail, making it appear as if the buffer\n \/\/ were full, not empty.\n _rx_buffer->head = _rx_buffer->tail;\n}\n\nvoid HardwareSerial::write(uint8_t c)\n{\n while (!((*_ucsra) & (1 << _udre)))\n ;\n\n *_udr = c;\n}\n\n\/\/ Preinstantiate Objects \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n#if defined(UBRRH) && defined(UBRRL)\n HardwareSerial Serial(&rx_buffer, &UBRRH, &UBRRL, &UCSRA, &UCSRB, &UDR, RXEN, TXEN, RXCIE, UDRE, U2X);\n#elif defined(UBRR0H) && defined(UBRR0L)\n HardwareSerial Serial(&rx_buffer, &UBRR0H, &UBRR0L, &UCSR0A, &UCSR0B, &UDR0, RXEN0, TXEN0, RXCIE0, UDRE0, U2X0);\n#elif defined(USBCON)\n #warning no serial port defined (port 0)\n#else\n #error no serial port defined (port 0)\n#endif\n\n#if defined(UBRR1H)\n HardwareSerial Serial1(&rx_buffer1, &UBRR1H, &UBRR1L, &UCSR1A, &UCSR1B, &UDR1, RXEN1, TXEN1, RXCIE1, UDRE1, U2X1);\n#endif\n#if defined(UBRR2H)\n HardwareSerial Serial2(&rx_buffer2, &UBRR2H, &UBRR2L, &UCSR2A, &UCSR2B, &UDR2, RXEN2, TXEN2, RXCIE2, UDRE2, U2X2);\n#endif\n#if defined(UBRR3H)\n HardwareSerial Serial3(&rx_buffer3, &UBRR3H, &UBRR3L, &UCSR3A, &UCSR3B, &UDR3, RXEN3, TXEN3, RXCIE3, UDRE3, U2X3);\n#endif\n\n#endif \/\/ whole file\n\n<commit_msg>Changing baud rate calculation to always use double speed mode except for 57600 baud at 16 MHz.<commit_after>\/*\n HardwareSerial.cpp - Hardware serial library for Wiring\n Copyright (c) 2006 Nicholas Zambetti. All right reserved.\n\n This library is free software; you can redistribute it and\/or\n modify it under the terms of the GNU Lesser General Public\n License as published by the Free Software Foundation; either\n version 2.1 of the License, or (at your option) any later version.\n\n This library is distributed in the hope that it will be useful,\n but WITHOUT ANY WARRANTY; without even the implied warranty of\n MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU\n Lesser General Public License for more details.\n\n You should have received a copy of the GNU Lesser General Public\n License along with this library; if not, write to the Free Software\n Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA\n \n Modified 23 November 2006 by David A. Mellis\n Modified 28 September 2010 by Mark Sproul\n*\/\n\n#include <stdlib.h>\n#include <stdio.h>\n#include <string.h>\n#include <inttypes.h>\n#include \"wiring.h\"\n#include \"wiring_private.h\"\n\n\/\/ this next line disables the entire HardwareSerial.cpp, \n\/\/ this is so I can support Attiny series and any other chip without a uart\n#if defined(UBRRH) || defined(UBRR0H) || defined(UBRR1H) || defined(UBRR2H) || defined(UBRR3H)\n\n#include \"HardwareSerial.h\"\n\n\/\/ Define constants and variables for buffering incoming serial data. We're\n\/\/ using a ring buffer (I think), in which rx_buffer_head is the index of the\n\/\/ location to which to write the next incoming character and rx_buffer_tail\n\/\/ is the index of the location from which to read.\n#if (RAMEND < 1000)\n #define RX_BUFFER_SIZE 32\n#else\n #define RX_BUFFER_SIZE 128\n#endif\n\nstruct ring_buffer\n{\n unsigned char buffer[RX_BUFFER_SIZE];\n int head;\n int tail;\n};\n\n#if defined(UBRRH) || defined(UBRR0H)\n ring_buffer rx_buffer = { { 0 }, 0, 0 };\n#endif\n#if defined(UBRR1H)\n ring_buffer rx_buffer1 = { { 0 }, 0, 0 };\n#endif\n#if defined(UBRR2H)\n ring_buffer rx_buffer2 = { { 0 }, 0, 0 };\n#endif\n#if defined(UBRR3H)\n ring_buffer rx_buffer3 = { { 0 }, 0, 0 };\n#endif\n\ninline void store_char(unsigned char c, ring_buffer *rx_buffer)\n{\n int i = (rx_buffer->head + 1) % RX_BUFFER_SIZE;\n\n \/\/ if we should be storing the received character into the location\n \/\/ just before the tail (meaning that the head would advance to the\n \/\/ current location of the tail), we're about to overflow the buffer\n \/\/ and so we don't write the character or advance the head.\n if (i != rx_buffer->tail) {\n rx_buffer->buffer[rx_buffer->head] = c;\n rx_buffer->head = i;\n }\n}\n\n#if defined(USART_RX_vect)\n SIGNAL(USART_RX_vect)\n {\n #if defined(UDR0)\n unsigned char c = UDR0;\n #elif defined(UDR)\n unsigned char c = UDR; \/\/ atmega8535\n #else\n #error UDR not defined\n #endif\n store_char(c, &rx_buffer);\n }\n#elif defined(SIG_USART0_RECV) && defined(UDR0)\n SIGNAL(SIG_USART0_RECV)\n {\n unsigned char c = UDR0;\n store_char(c, &rx_buffer);\n }\n#elif defined(SIG_UART0_RECV) && defined(UDR0)\n SIGNAL(SIG_UART0_RECV)\n {\n unsigned char c = UDR0;\n store_char(c, &rx_buffer);\n }\n\/\/#elif defined(SIG_USART_RECV)\n#elif defined(USART0_RX_vect)\n \/\/ fixed by Mark Sproul this is on the 644\/644p\n \/\/SIGNAL(SIG_USART_RECV)\n SIGNAL(USART0_RX_vect)\n {\n #if defined(UDR0)\n unsigned char c = UDR0;\n #elif defined(UDR)\n unsigned char c = UDR; \/\/ atmega8, atmega32\n #else\n #error UDR not defined\n #endif\n store_char(c, &rx_buffer);\n }\n#elif defined(SIG_UART_RECV)\n \/\/ this is for atmega8\n SIGNAL(SIG_UART_RECV)\n {\n #if defined(UDR0)\n unsigned char c = UDR0; \/\/ atmega645\n #elif defined(UDR)\n unsigned char c = UDR; \/\/ atmega8\n #endif\n store_char(c, &rx_buffer);\n }\n#elif defined(USBCON)\n #warning No interrupt handler for usart 0\n #warning Serial(0) is on USB interface\n#else\n #error No interrupt handler for usart 0\n#endif\n\n\/\/#if defined(SIG_USART1_RECV)\n#if defined(USART1_RX_vect)\n \/\/SIGNAL(SIG_USART1_RECV)\n SIGNAL(USART1_RX_vect)\n {\n unsigned char c = UDR1;\n store_char(c, &rx_buffer1);\n }\n#elif defined(SIG_USART1_RECV)\n #error SIG_USART1_RECV\n#endif\n\n#if defined(USART2_RX_vect) && defined(UDR2)\n SIGNAL(USART2_RX_vect)\n {\n unsigned char c = UDR2;\n store_char(c, &rx_buffer2);\n }\n#elif defined(SIG_USART2_RECV)\n #error SIG_USART2_RECV\n#endif\n\n#if defined(USART3_RX_vect) && defined(UDR3)\n SIGNAL(USART3_RX_vect)\n {\n unsigned char c = UDR3;\n store_char(c, &rx_buffer3);\n }\n#elif defined(SIG_USART3_RECV)\n #error SIG_USART3_RECV\n#endif\n\n\n\n\/\/ Constructors \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nHardwareSerial::HardwareSerial(ring_buffer *rx_buffer,\n volatile uint8_t *ubrrh, volatile uint8_t *ubrrl,\n volatile uint8_t *ucsra, volatile uint8_t *ucsrb,\n volatile uint8_t *udr,\n uint8_t rxen, uint8_t txen, uint8_t rxcie, uint8_t udre, uint8_t u2x)\n{\n _rx_buffer = rx_buffer;\n _ubrrh = ubrrh;\n _ubrrl = ubrrl;\n _ucsra = ucsra;\n _ucsrb = ucsrb;\n _udr = udr;\n _rxen = rxen;\n _txen = txen;\n _rxcie = rxcie;\n _udre = udre;\n _u2x = u2x;\n}\n\n\/\/ Public Methods \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nvoid HardwareSerial::begin(long baud)\n{\n uint16_t baud_setting;\n bool use_u2x = true;\n\n#if F_CPU == 16000000UL\n \/\/ hardcoded exception for compatibility with the bootloader shipped\n \/\/ with the Duemilanove and previous boards and the firmware on the 8U2\n \/\/ on the Uno and Mega 2560.\n if (baud == 57600) {\n use_u2x = false;\n }\n#endif\n \n if (use_u2x) {\n *_ucsra = 1 << _u2x;\n baud_setting = (F_CPU \/ 4 \/ baud - 1) \/ 2;\n } else {\n *_ucsra = 0;\n baud_setting = (F_CPU \/ 8 \/ baud - 1) \/ 2;\n }\n\n \/\/ assign the baud_setting, a.k.a. ubbr (USART Baud Rate Register)\n *_ubrrh = baud_setting >> 8;\n *_ubrrl = baud_setting;\n\n sbi(*_ucsrb, _rxen);\n sbi(*_ucsrb, _txen);\n sbi(*_ucsrb, _rxcie);\n}\n\nvoid HardwareSerial::end()\n{\n cbi(*_ucsrb, _rxen);\n cbi(*_ucsrb, _txen);\n cbi(*_ucsrb, _rxcie); \n}\n\nint HardwareSerial::available(void)\n{\n return (RX_BUFFER_SIZE + _rx_buffer->head - _rx_buffer->tail) % RX_BUFFER_SIZE;\n}\n\nint HardwareSerial::peek(void)\n{\n if (_rx_buffer->head == _rx_buffer->tail) {\n return -1;\n } else {\n return _rx_buffer->buffer[_rx_buffer->tail];\n }\n}\n\nint HardwareSerial::read(void)\n{\n \/\/ if the head isn't ahead of the tail, we don't have any characters\n if (_rx_buffer->head == _rx_buffer->tail) {\n return -1;\n } else {\n unsigned char c = _rx_buffer->buffer[_rx_buffer->tail];\n _rx_buffer->tail = (_rx_buffer->tail + 1) % RX_BUFFER_SIZE;\n return c;\n }\n}\n\nvoid HardwareSerial::flush()\n{\n \/\/ don't reverse this or there may be problems if the RX interrupt\n \/\/ occurs after reading the value of rx_buffer_head but before writing\n \/\/ the value to rx_buffer_tail; the previous value of rx_buffer_head\n \/\/ may be written to rx_buffer_tail, making it appear as if the buffer\n \/\/ don't reverse this or there may be problems if the RX interrupt\n \/\/ occurs after reading the value of rx_buffer_head but before writing\n \/\/ the value to rx_buffer_tail; the previous value of rx_buffer_head\n \/\/ may be written to rx_buffer_tail, making it appear as if the buffer\n \/\/ were full, not empty.\n _rx_buffer->head = _rx_buffer->tail;\n}\n\nvoid HardwareSerial::write(uint8_t c)\n{\n while (!((*_ucsra) & (1 << _udre)))\n ;\n\n *_udr = c;\n}\n\n\/\/ Preinstantiate Objects \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n#if defined(UBRRH) && defined(UBRRL)\n HardwareSerial Serial(&rx_buffer, &UBRRH, &UBRRL, &UCSRA, &UCSRB, &UDR, RXEN, TXEN, RXCIE, UDRE, U2X);\n#elif defined(UBRR0H) && defined(UBRR0L)\n HardwareSerial Serial(&rx_buffer, &UBRR0H, &UBRR0L, &UCSR0A, &UCSR0B, &UDR0, RXEN0, TXEN0, RXCIE0, UDRE0, U2X0);\n#elif defined(USBCON)\n #warning no serial port defined (port 0)\n#else\n #error no serial port defined (port 0)\n#endif\n\n#if defined(UBRR1H)\n HardwareSerial Serial1(&rx_buffer1, &UBRR1H, &UBRR1L, &UCSR1A, &UCSR1B, &UDR1, RXEN1, TXEN1, RXCIE1, UDRE1, U2X1);\n#endif\n#if defined(UBRR2H)\n HardwareSerial Serial2(&rx_buffer2, &UBRR2H, &UBRR2L, &UCSR2A, &UCSR2B, &UDR2, RXEN2, TXEN2, RXCIE2, UDRE2, U2X2);\n#endif\n#if defined(UBRR3H)\n HardwareSerial Serial3(&rx_buffer3, &UBRR3H, &UBRR3L, &UCSR3A, &UCSR3B, &UDR3, RXEN3, TXEN3, RXCIE3, UDRE3, U2X3);\n#endif\n\n#endif \/\/ whole file\n\n<|endoftext|>"} {"text":"<commit_before>\/*\n * #%L\n * %%\n * Copyright (C) 2020 BMW Car IT GmbH\n * %%\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n * \n * http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n * \n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * #L%\n *\/\n#include \"joynr\/UdsSettings.h\"\n\n#include <cassert>\n#include <cstdint>\n#include <limits>\n\n#include \"joynr\/Settings.h\"\n#include \"joynr\/Util.h\"\n#include \"joynr\/system\/RoutingTypes\/UdsAddress.h\"\n#include \"joynr\/system\/RoutingTypes\/UdsClientAddress.h\"\n\nnamespace joynr\n{\n\nconst std::string& UdsSettings::DEFAULT_UDS_SETTINGS_FILENAME()\n{\n static const std::string value(\"default-uds.settings\");\n return value;\n}\n\nUdsSettings::UdsSettings(Settings& settings) : _settings(settings)\n{\n _settings.fillEmptySettingsWithDefaults(DEFAULT_UDS_SETTINGS_FILENAME());\n checkSettings();\n}\n\nvoid UdsSettings::checkSettings()\n{\n if (!_settings.contains(SETTING_SOCKET_PATH())) {\n setSocketPath(DEFAULT_SOCKET_PATH());\n }\n\n if (!_settings.contains(SETTING_CONNECT_SLEEP_TIME_MS())) {\n setConnectSleepTimeMs(DEFAULT_CONNECT_SLEEP_TIME_MS());\n }\n\n if (!_settings.contains(SETTING_CLIENT_ID())) {\n setClientId(joynr::util::createUuid());\n }\n\n if (!_settings.contains(SETTING_SENDING_QUEUE_SIZE())) {\n setSendingQueueSize(DEFAULT_SENDING_QUEUE_SIZE());\n }\n\n if (!_settings.contains(SETTING_READ_WRITE_TIMEOUT())) {\n setReadWriteTimeout(DEFAULT_READ_WRITE_TIMEOUT());\n }\n}\n\nconst std::string& UdsSettings::SETTING_SOCKET_PATH()\n{\n static const std::string value(\"uds\/socket-path\");\n return value;\n}\n\nconst std::string& UdsSettings::SETTING_CONNECT_SLEEP_TIME_MS()\n{\n static const std::string value(\"uds\/connect-sleep-time-ms\");\n return value;\n}\n\nconst std::string& UdsSettings::SETTING_CLIENT_ID()\n{\n static const std::string value(\"uds\/client-id\");\n return value;\n}\n\nstd::string UdsSettings::getSocketPath() const\n{\n return _settings.get<std::string>(UdsSettings::SETTING_SOCKET_PATH());\n}\n\nvoid UdsSettings::setSocketPath(const std::string& socketPath)\n{\n _settings.set(UdsSettings::SETTING_SOCKET_PATH(), socketPath);\n}\n\nstd::chrono::milliseconds UdsSettings::getConnectSleepTimeMs() const\n{\n return std::chrono::milliseconds(\n _settings.get<std::int64_t>(UdsSettings::SETTING_CONNECT_SLEEP_TIME_MS()));\n}\n\nvoid UdsSettings::setConnectSleepTimeMs(const std::chrono::milliseconds connectSleepTimeMs)\n{\n _settings.set(UdsSettings::SETTING_CONNECT_SLEEP_TIME_MS(), connectSleepTimeMs.count());\n}\n\nstd::string UdsSettings::getClientId() const\n{\n return _settings.get<std::string>(UdsSettings::SETTING_CLIENT_ID());\n}\n\nvoid UdsSettings::setClientId(const std::string& clientId)\n{\n _settings.set(UdsSettings::SETTING_CLIENT_ID(), clientId);\n}\n\nconst std::string& UdsSettings::DEFAULT_SOCKET_PATH()\n{\n static const std::string value(\"\/var\/run\/joynr\/cluster-controller.sock\");\n return value;\n}\n\nstd::chrono::milliseconds UdsSettings::DEFAULT_CONNECT_SLEEP_TIME_MS()\n{\n static const std::chrono::milliseconds value(500);\n return value;\n}\n\nconst std::string& UdsSettings::SETTING_SENDING_QUEUE_SIZE()\n{\n static const std::string value(\"uds\/sending-queue-size\");\n return value;\n}\n\nconst std::size_t& UdsSettings::DEFAULT_SENDING_QUEUE_SIZE()\n{\n static const std::size_t value{1024};\n return value;\n}\nstd::size_t UdsSettings::getSendingQueueSize() const\n{\n const auto sendingQueueSizeStr =\n _settings.get<std::string>(UdsSettings::SETTING_SENDING_QUEUE_SIZE());\n try {\n const auto sendingQueueSize = std::stoul(sendingQueueSizeStr);\n return sendingQueueSize; \/\/ In case of zero, an additional message will trigger a reschedule\n \/\/ if one message is still processed.\n } catch (const std::logic_error& ex) {\n JOYNR_LOG_ERROR(logger(),\n \"Cannot parse \",\n UdsSettings::SETTING_SENDING_QUEUE_SIZE(),\n \" value '\",\n sendingQueueSizeStr,\n \" '. Exception: \",\n ex.what());\n }\n return DEFAULT_SENDING_QUEUE_SIZE();\n}\n\nvoid UdsSettings::setSendingQueueSize(const std::size_t& queueSize)\n{\n _settings.set(UdsSettings::SETTING_SENDING_QUEUE_SIZE(), std::to_string(queueSize));\n}\n\nconst std::string& UdsSettings::SETTING_READ_WRITE_TIMEOUT()\n{\n static const std::string value(\"uds\/read-write-timeout\");\n return value;\n}\n\nstd::chrono::milliseconds UdsSettings::DEFAULT_READ_WRITE_TIMEOUT()\n{\n static const std::chrono::milliseconds value(1000);\n return value;\n}\n\nstd::chrono::milliseconds UdsSettings::getReadWriteTimeout() const\n{\n return std::chrono::milliseconds(\n _settings.get<std::int64_t>(UdsSettings::SETTING_READ_WRITE_TIMEOUT()));\n}\n\nvoid UdsSettings::setReadWriteTimeout(const std::chrono::milliseconds timeout)\n{\n _settings.set(UdsSettings::SETTING_READ_WRITE_TIMEOUT(), timeout.count());\n}\n\njoynr::system::RoutingTypes::UdsAddress UdsSettings::createClusterControllerMessagingAddress() const\n{\n return system::RoutingTypes::UdsAddress(getSocketPath());\n}\n\nsystem::RoutingTypes::UdsClientAddress UdsSettings::createClientMessagingAddress() const\n{\n return system::RoutingTypes::UdsClientAddress(getClientId());\n}\n\nbool UdsSettings::contains(const std::string& key) const\n{\n return _settings.contains(key);\n}\n\nvoid UdsSettings::printSettings() const\n{\n JOYNR_LOG_INFO(logger(),\n \"SETTING: {} = {}\",\n SETTING_SOCKET_PATH(),\n _settings.get<std::string>(SETTING_SOCKET_PATH()));\n\n JOYNR_LOG_INFO(logger(),\n \"SETTING: {} = {}\",\n SETTING_CONNECT_SLEEP_TIME_MS(),\n _settings.get<std::string>(SETTING_CONNECT_SLEEP_TIME_MS()));\n\n JOYNR_LOG_INFO(logger(),\n \"SETTING: {} = {}\",\n SETTING_CLIENT_ID(),\n _settings.get<std::string>(SETTING_CLIENT_ID()));\n\n JOYNR_LOG_INFO(logger(),\n \"SETTING: {} = {}\",\n SETTING_SENDING_QUEUE_SIZE(),\n _settings.get<std::string>(SETTING_SENDING_QUEUE_SIZE()));\n}\n\n} \/\/ namespace joynr\n<commit_msg>[C++] Print SETTING_READ_WRITE_TIMEOUT in UdsSettings::PrintSettings<commit_after>\/*\n * #%L\n * %%\n * Copyright (C) 2020 BMW Car IT GmbH\n * %%\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n * \n * http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n * \n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * #L%\n *\/\n#include \"joynr\/UdsSettings.h\"\n\n#include <cassert>\n#include <cstdint>\n#include <limits>\n\n#include \"joynr\/Settings.h\"\n#include \"joynr\/Util.h\"\n#include \"joynr\/system\/RoutingTypes\/UdsAddress.h\"\n#include \"joynr\/system\/RoutingTypes\/UdsClientAddress.h\"\n\nnamespace joynr\n{\n\nconst std::string& UdsSettings::DEFAULT_UDS_SETTINGS_FILENAME()\n{\n static const std::string value(\"default-uds.settings\");\n return value;\n}\n\nUdsSettings::UdsSettings(Settings& settings) : _settings(settings)\n{\n _settings.fillEmptySettingsWithDefaults(DEFAULT_UDS_SETTINGS_FILENAME());\n checkSettings();\n}\n\nvoid UdsSettings::checkSettings()\n{\n if (!_settings.contains(SETTING_SOCKET_PATH())) {\n setSocketPath(DEFAULT_SOCKET_PATH());\n }\n\n if (!_settings.contains(SETTING_CONNECT_SLEEP_TIME_MS())) {\n setConnectSleepTimeMs(DEFAULT_CONNECT_SLEEP_TIME_MS());\n }\n\n if (!_settings.contains(SETTING_CLIENT_ID())) {\n setClientId(joynr::util::createUuid());\n }\n\n if (!_settings.contains(SETTING_SENDING_QUEUE_SIZE())) {\n setSendingQueueSize(DEFAULT_SENDING_QUEUE_SIZE());\n }\n\n if (!_settings.contains(SETTING_READ_WRITE_TIMEOUT())) {\n setReadWriteTimeout(DEFAULT_READ_WRITE_TIMEOUT());\n }\n}\n\nconst std::string& UdsSettings::SETTING_SOCKET_PATH()\n{\n static const std::string value(\"uds\/socket-path\");\n return value;\n}\n\nconst std::string& UdsSettings::SETTING_CONNECT_SLEEP_TIME_MS()\n{\n static const std::string value(\"uds\/connect-sleep-time-ms\");\n return value;\n}\n\nconst std::string& UdsSettings::SETTING_CLIENT_ID()\n{\n static const std::string value(\"uds\/client-id\");\n return value;\n}\n\nstd::string UdsSettings::getSocketPath() const\n{\n return _settings.get<std::string>(UdsSettings::SETTING_SOCKET_PATH());\n}\n\nvoid UdsSettings::setSocketPath(const std::string& socketPath)\n{\n _settings.set(UdsSettings::SETTING_SOCKET_PATH(), socketPath);\n}\n\nstd::chrono::milliseconds UdsSettings::getConnectSleepTimeMs() const\n{\n return std::chrono::milliseconds(\n _settings.get<std::int64_t>(UdsSettings::SETTING_CONNECT_SLEEP_TIME_MS()));\n}\n\nvoid UdsSettings::setConnectSleepTimeMs(const std::chrono::milliseconds connectSleepTimeMs)\n{\n _settings.set(UdsSettings::SETTING_CONNECT_SLEEP_TIME_MS(), connectSleepTimeMs.count());\n}\n\nstd::string UdsSettings::getClientId() const\n{\n return _settings.get<std::string>(UdsSettings::SETTING_CLIENT_ID());\n}\n\nvoid UdsSettings::setClientId(const std::string& clientId)\n{\n _settings.set(UdsSettings::SETTING_CLIENT_ID(), clientId);\n}\n\nconst std::string& UdsSettings::DEFAULT_SOCKET_PATH()\n{\n static const std::string value(\"\/var\/run\/joynr\/cluster-controller.sock\");\n return value;\n}\n\nstd::chrono::milliseconds UdsSettings::DEFAULT_CONNECT_SLEEP_TIME_MS()\n{\n static const std::chrono::milliseconds value(500);\n return value;\n}\n\nconst std::string& UdsSettings::SETTING_SENDING_QUEUE_SIZE()\n{\n static const std::string value(\"uds\/sending-queue-size\");\n return value;\n}\n\nconst std::size_t& UdsSettings::DEFAULT_SENDING_QUEUE_SIZE()\n{\n static const std::size_t value{1024};\n return value;\n}\nstd::size_t UdsSettings::getSendingQueueSize() const\n{\n const auto sendingQueueSizeStr =\n _settings.get<std::string>(UdsSettings::SETTING_SENDING_QUEUE_SIZE());\n try {\n const auto sendingQueueSize = std::stoul(sendingQueueSizeStr);\n return sendingQueueSize; \/\/ In case of zero, an additional message will trigger a reschedule\n \/\/ if one message is still processed.\n } catch (const std::logic_error& ex) {\n JOYNR_LOG_ERROR(logger(),\n \"Cannot parse \",\n UdsSettings::SETTING_SENDING_QUEUE_SIZE(),\n \" value '\",\n sendingQueueSizeStr,\n \" '. Exception: \",\n ex.what());\n }\n return DEFAULT_SENDING_QUEUE_SIZE();\n}\n\nvoid UdsSettings::setSendingQueueSize(const std::size_t& queueSize)\n{\n _settings.set(UdsSettings::SETTING_SENDING_QUEUE_SIZE(), std::to_string(queueSize));\n}\n\nconst std::string& UdsSettings::SETTING_READ_WRITE_TIMEOUT()\n{\n static const std::string value(\"uds\/read-write-timeout\");\n return value;\n}\n\nstd::chrono::milliseconds UdsSettings::DEFAULT_READ_WRITE_TIMEOUT()\n{\n static const std::chrono::milliseconds value(1000);\n return value;\n}\n\nstd::chrono::milliseconds UdsSettings::getReadWriteTimeout() const\n{\n return std::chrono::milliseconds(\n _settings.get<std::int64_t>(UdsSettings::SETTING_READ_WRITE_TIMEOUT()));\n}\n\nvoid UdsSettings::setReadWriteTimeout(const std::chrono::milliseconds timeout)\n{\n _settings.set(UdsSettings::SETTING_READ_WRITE_TIMEOUT(), timeout.count());\n}\n\njoynr::system::RoutingTypes::UdsAddress UdsSettings::createClusterControllerMessagingAddress() const\n{\n return system::RoutingTypes::UdsAddress(getSocketPath());\n}\n\nsystem::RoutingTypes::UdsClientAddress UdsSettings::createClientMessagingAddress() const\n{\n return system::RoutingTypes::UdsClientAddress(getClientId());\n}\n\nbool UdsSettings::contains(const std::string& key) const\n{\n return _settings.contains(key);\n}\n\nvoid UdsSettings::printSettings() const\n{\n JOYNR_LOG_INFO(logger(),\n \"SETTING: {} = {}\",\n SETTING_SOCKET_PATH(),\n _settings.get<std::string>(SETTING_SOCKET_PATH()));\n\n JOYNR_LOG_INFO(logger(),\n \"SETTING: {} = {}\",\n SETTING_CONNECT_SLEEP_TIME_MS(),\n _settings.get<std::string>(SETTING_CONNECT_SLEEP_TIME_MS()));\n\n JOYNR_LOG_INFO(logger(),\n \"SETTING: {} = {}\",\n SETTING_CLIENT_ID(),\n _settings.get<std::string>(SETTING_CLIENT_ID()));\n\n JOYNR_LOG_INFO(logger(),\n \"SETTING: {} = {}\",\n SETTING_SENDING_QUEUE_SIZE(),\n _settings.get<std::string>(SETTING_SENDING_QUEUE_SIZE()));\n\n JOYNR_LOG_INFO(logger(),\n \"SETTING: {} = {}\",\n SETTING_READ_WRITE_TIMEOUT(),\n _settings.get<std::string>(SETTING_READ_WRITE_TIMEOUT()));\n}\n\n} \/\/ namespace joynr\n<|endoftext|>"} {"text":"<commit_before>#include <sys\/time.h>\n#include <sys\/syscall.h>\n#include <stdarg.h>\n#include <string.h>\n\n#include \"log.h\"\n#include \"config.h\"\n#include \"simulator.h\"\n#include \"core_manager.h\"\n\nusing namespace std;\n\nLog *Log::_singleton;\n\nconst UInt32 Log::MODULE_LENGTH;\n\nstatic string formatFileName(const char* s)\n{\n return Sim()->getConfig()->formatOutputFileName(s);\n}\n\nLog::Log(Config &config)\n : _coreCount(config.getTotalCores())\n , _startTime(0)\n{\n assert(Config::getSingleton()->getProcessCount() != 0);\n\n _coreFiles = new FILE* [_coreCount];\n _simFiles = new FILE* [_coreCount];\n\n for (core_id_t i = 0; i < _coreCount; i++)\n {\n _coreFiles[i] = NULL;\n _simFiles[i] = NULL;\n }\n\n _coreLocks = new Lock [_coreCount];\n _simLocks = new Lock [_coreCount];\n\n _systemFile = NULL;\n\n _defaultFile = fopen(formatFileName(\"system-default.log\").c_str(),\"w\");\n\n std::set<std::string> disabledModulesUnformatted;\n Config::getSingleton()->getDisabledLogModules(disabledModulesUnformatted);\n for (std::set<std::string>::iterator it = disabledModulesUnformatted.begin();\n it != disabledModulesUnformatted.end();\n it++)\n {\n string formatted;\n\n for (unsigned int i = 0; i < min(MODULE_LENGTH, it->length()); i++)\n {\n formatted.push_back((*it)[i]);\n }\n\n for (unsigned int i = formatted.length(); i < MODULE_LENGTH; i++)\n {\n formatted.push_back(' ');\n }\n\n assert(formatted.length() == MODULE_LENGTH);\n _disabledModules.insert(formatted);\n }\n\n _loggingEnabled = Config::getSingleton()->getLoggingEnabled();\n\n assert(_singleton == NULL);\n _singleton = this;\n}\n\nLog::~Log()\n{\n _singleton = NULL;\n\n for (core_id_t i = 0; i < _coreCount; i++)\n {\n if (_coreFiles[i])\n fclose(_coreFiles[i]);\n if (_simFiles[i])\n fclose(_simFiles[i]);\n }\n\n delete [] _coreLocks;\n delete [] _simLocks;\n delete [] _coreFiles;\n delete [] _simFiles;\n\n if (_systemFile)\n fclose(_systemFile);\n fclose(_defaultFile);\n}\n\nLog* Log::getSingleton()\n{\n assert(_singleton);\n return _singleton;\n}\n\nBoolean Log::isEnabled(const char* module)\n{\n return _disabledModules.find(module) == _disabledModules.end();\n}\n\nBoolean Log::isLoggingEnabled()\n{\n return _loggingEnabled;\n}\n\nUInt64 Log::getTimestamp()\n{\n timeval t;\n gettimeofday(&t, NULL);\n UInt64 time = (((UInt64)t.tv_sec) * 1000000 + t.tv_usec);\n if (_startTime == 0) _startTime = time;\n return time - _startTime;\n}\n\nvoid Log::discoverCore(core_id_t *core_id, bool *sim_thread)\n{\n CoreManager *core_manager;\n\n if (!Sim() || !(core_manager = Sim()->getCoreManager()))\n {\n *core_id = INVALID_CORE_ID;\n *sim_thread = false;\n return;\n }\n\n *core_id = core_manager->getCurrentCoreID();\n if (*core_id != INVALID_CORE_ID)\n {\n *sim_thread = false;\n return;\n }\n else\n {\n *core_id = core_manager->getCurrentSimThreadCoreID();\n *sim_thread = true;\n return;\n }\n}\n\nvoid Log::getFile(core_id_t core_id, bool sim_thread, FILE **file, Lock **lock)\n{\n \/\/ we use on-demand file allocation to prevent contention between\n \/\/ processes for files\n\n *file = NULL;\n *lock = NULL;\n\n if (core_id == INVALID_CORE_ID)\n {\n \/\/ System file -- use process num if available\n UInt32 procNum = Config::getSingleton()->getCurrentProcessNum();\n \n if (procNum != (UInt32)-1)\n {\n if (_systemFile == NULL)\n {\n assert(procNum < Config::getSingleton()->getProcessCount());\n char filename[256];\n sprintf(filename, \"system_%u.log\", procNum);\n _systemFile = fopen(formatFileName(filename).c_str(), \"w\");\n assert(_systemFile != NULL);\n }\n\n *file = _systemFile;\n *lock = &_systemLock;\n }\n else\n {\n *file = _defaultFile;\n *lock = &_defaultLock;\n }\n }\n else if (sim_thread)\n {\n \/\/ sim thread file\n if (_simFiles[core_id] == NULL)\n {\n assert(core_id < _coreCount);\n char filename[256];\n sprintf(filename, \"sim_%u.log\", core_id);\n _simFiles[core_id] = fopen(formatFileName(filename).c_str(), \"w\");\n assert(_simFiles[core_id] != NULL);\n }\n\n *file = _simFiles[core_id];\n *lock = &_simLocks[core_id];\n }\n else\n {\n \/\/ core file\n if (_coreFiles[core_id] == NULL)\n {\n assert(core_id < _coreCount);\n char filename[256];\n sprintf(filename, \"app_%u.log\", core_id);\n _coreFiles[core_id] = fopen(formatFileName(filename).c_str(), \"w\");\n assert(_coreFiles[core_id] != NULL);\n }\n\n \/\/ Core file\n *file = _coreFiles[core_id];\n *lock = &_coreLocks[core_id];\n }\n}\n\nstd::string Log::getModule(const char *filename)\n{\n#ifdef LOCK_LOGS\n ScopedLock sl(_modules_lock);\n#endif\n std::map<const char*, std::string>::const_iterator it = _modules.find(filename);\n\n if (it != _modules.end())\n {\n return it->second;\n }\n else\n {\n \/\/ build module string\n string mod;\n\n \/\/ find actual file name ...\n const char *ptr = strrchr(filename, '\/');\n if (ptr != NULL)\n filename = ptr + 1;\n\n for (UInt32 i = 0; i < MODULE_LENGTH && filename[i] != '\\0'; i++)\n mod.push_back(filename[i]);\n\n while (mod.length() < MODULE_LENGTH)\n mod.push_back(' ');\n\n pair<const char*, std::string> p(filename, mod);\n _modules.insert(p);\n\n return mod;\n }\n}\n\nvoid Log::log(ErrorState err, const char* source_file, SInt32 source_line, const char *format, ...)\n{\n if (!_loggingEnabled && err != Error)\n return;\n\n \/\/ Called in LOG_PRINT macro (see log.h)\n\/\/ if (!isEnabled(source_file))\n\/\/ return;\n\n core_id_t core_id;\n bool sim_thread;\n discoverCore(&core_id, &sim_thread);\n \n FILE *file;\n Lock *lock;\n\n getFile(core_id, sim_thread, &file, &lock);\n int tid = syscall(__NR_gettid);\n\n\n char message[512];\n char *p = message;\n\n \/\/ This is ugly, but it just prints the time stamp, process number, core number, source file\/line\n if (core_id != INVALID_CORE_ID) \/\/ valid core id\n p += sprintf(p, \"%-10llu [%5d] (%2i) [%2i]%s[%s:%4d] \", getTimestamp(), tid, Config::getSingleton()->getCurrentProcessNum(), core_id, (sim_thread ? \"* \" : \" \"), source_file, source_line);\n else if (Config::getSingleton()->getCurrentProcessNum() != (UInt32)-1) \/\/ valid proc id\n p += sprintf(p, \"%-10llu [%5d] (%2i) [ ] [%s:%4d] \", getTimestamp(), tid, Config::getSingleton()->getCurrentProcessNum(), source_file, source_line);\n else \/\/ who knows\n p += sprintf(p, \"%-10llu [%5d] ( ) [ ] [%s:%4d] \", getTimestamp(), tid, source_file, source_line);\n\n switch (err)\n {\n case None:\n default:\n break;\n\n case Warning:\n p += sprintf(p, \"*WARNING* \");\n break;\n\n case Error:\n p += sprintf(p, \"*ERROR* \");\n break;\n };\n\n va_list args;\n va_start(args, format);\n p += vsprintf(p, format, args);\n va_end(args);\n\n p += sprintf(p, \"\\n\");\n\n lock->acquire();\n\n fputs(message, file);\n fflush(file);\n\n lock->release();\n\n switch (err)\n {\n case Error:\n fputs(message, stderr);\n abort();\n break;\n\n case Warning:\n fputs(message, stderr);\n break;\n\n case None:\n default:\n break;\n }\n}\n<commit_msg>[log] Print out warnings even if logging is disabled.<commit_after>#include <sys\/time.h>\n#include <sys\/syscall.h>\n#include <stdarg.h>\n#include <string.h>\n\n#include \"log.h\"\n#include \"config.h\"\n#include \"simulator.h\"\n#include \"core_manager.h\"\n\nusing namespace std;\n\nLog *Log::_singleton;\n\nconst UInt32 Log::MODULE_LENGTH;\n\nstatic string formatFileName(const char* s)\n{\n return Sim()->getConfig()->formatOutputFileName(s);\n}\n\nLog::Log(Config &config)\n : _coreCount(config.getTotalCores())\n , _startTime(0)\n{\n assert(Config::getSingleton()->getProcessCount() != 0);\n\n _coreFiles = new FILE* [_coreCount];\n _simFiles = new FILE* [_coreCount];\n\n for (core_id_t i = 0; i < _coreCount; i++)\n {\n _coreFiles[i] = NULL;\n _simFiles[i] = NULL;\n }\n\n _coreLocks = new Lock [_coreCount];\n _simLocks = new Lock [_coreCount];\n\n _systemFile = NULL;\n\n _defaultFile = fopen(formatFileName(\"system-default.log\").c_str(),\"w\");\n\n std::set<std::string> disabledModulesUnformatted;\n Config::getSingleton()->getDisabledLogModules(disabledModulesUnformatted);\n for (std::set<std::string>::iterator it = disabledModulesUnformatted.begin();\n it != disabledModulesUnformatted.end();\n it++)\n {\n string formatted;\n\n for (unsigned int i = 0; i < min(MODULE_LENGTH, it->length()); i++)\n {\n formatted.push_back((*it)[i]);\n }\n\n for (unsigned int i = formatted.length(); i < MODULE_LENGTH; i++)\n {\n formatted.push_back(' ');\n }\n\n assert(formatted.length() == MODULE_LENGTH);\n _disabledModules.insert(formatted);\n }\n\n _loggingEnabled = Config::getSingleton()->getLoggingEnabled();\n\n assert(_singleton == NULL);\n _singleton = this;\n}\n\nLog::~Log()\n{\n _singleton = NULL;\n\n for (core_id_t i = 0; i < _coreCount; i++)\n {\n if (_coreFiles[i])\n fclose(_coreFiles[i]);\n if (_simFiles[i])\n fclose(_simFiles[i]);\n }\n\n delete [] _coreLocks;\n delete [] _simLocks;\n delete [] _coreFiles;\n delete [] _simFiles;\n\n if (_systemFile)\n fclose(_systemFile);\n fclose(_defaultFile);\n}\n\nLog* Log::getSingleton()\n{\n assert(_singleton);\n return _singleton;\n}\n\nBoolean Log::isEnabled(const char* module)\n{\n return _disabledModules.find(module) == _disabledModules.end();\n}\n\nBoolean Log::isLoggingEnabled()\n{\n return _loggingEnabled;\n}\n\nUInt64 Log::getTimestamp()\n{\n timeval t;\n gettimeofday(&t, NULL);\n UInt64 time = (((UInt64)t.tv_sec) * 1000000 + t.tv_usec);\n if (_startTime == 0) _startTime = time;\n return time - _startTime;\n}\n\nvoid Log::discoverCore(core_id_t *core_id, bool *sim_thread)\n{\n CoreManager *core_manager;\n\n if (!Sim() || !(core_manager = Sim()->getCoreManager()))\n {\n *core_id = INVALID_CORE_ID;\n *sim_thread = false;\n return;\n }\n\n *core_id = core_manager->getCurrentCoreID();\n if (*core_id != INVALID_CORE_ID)\n {\n *sim_thread = false;\n return;\n }\n else\n {\n *core_id = core_manager->getCurrentSimThreadCoreID();\n *sim_thread = true;\n return;\n }\n}\n\nvoid Log::getFile(core_id_t core_id, bool sim_thread, FILE **file, Lock **lock)\n{\n \/\/ we use on-demand file allocation to prevent contention between\n \/\/ processes for files\n\n *file = NULL;\n *lock = NULL;\n\n if (core_id == INVALID_CORE_ID)\n {\n \/\/ System file -- use process num if available\n UInt32 procNum = Config::getSingleton()->getCurrentProcessNum();\n \n if (procNum != (UInt32)-1)\n {\n if (_systemFile == NULL)\n {\n assert(procNum < Config::getSingleton()->getProcessCount());\n char filename[256];\n sprintf(filename, \"system_%u.log\", procNum);\n _systemFile = fopen(formatFileName(filename).c_str(), \"w\");\n assert(_systemFile != NULL);\n }\n\n *file = _systemFile;\n *lock = &_systemLock;\n }\n else\n {\n *file = _defaultFile;\n *lock = &_defaultLock;\n }\n }\n else if (sim_thread)\n {\n \/\/ sim thread file\n if (_simFiles[core_id] == NULL)\n {\n assert(core_id < _coreCount);\n char filename[256];\n sprintf(filename, \"sim_%u.log\", core_id);\n _simFiles[core_id] = fopen(formatFileName(filename).c_str(), \"w\");\n assert(_simFiles[core_id] != NULL);\n }\n\n *file = _simFiles[core_id];\n *lock = &_simLocks[core_id];\n }\n else\n {\n \/\/ core file\n if (_coreFiles[core_id] == NULL)\n {\n assert(core_id < _coreCount);\n char filename[256];\n sprintf(filename, \"app_%u.log\", core_id);\n _coreFiles[core_id] = fopen(formatFileName(filename).c_str(), \"w\");\n assert(_coreFiles[core_id] != NULL);\n }\n\n \/\/ Core file\n *file = _coreFiles[core_id];\n *lock = &_coreLocks[core_id];\n }\n}\n\nstd::string Log::getModule(const char *filename)\n{\n#ifdef LOCK_LOGS\n ScopedLock sl(_modules_lock);\n#endif\n std::map<const char*, std::string>::const_iterator it = _modules.find(filename);\n\n if (it != _modules.end())\n {\n return it->second;\n }\n else\n {\n \/\/ build module string\n string mod;\n\n \/\/ find actual file name ...\n const char *ptr = strrchr(filename, '\/');\n if (ptr != NULL)\n filename = ptr + 1;\n\n for (UInt32 i = 0; i < MODULE_LENGTH && filename[i] != '\\0'; i++)\n mod.push_back(filename[i]);\n\n while (mod.length() < MODULE_LENGTH)\n mod.push_back(' ');\n\n pair<const char*, std::string> p(filename, mod);\n _modules.insert(p);\n\n return mod;\n }\n}\n\nvoid Log::log(ErrorState err, const char* source_file, SInt32 source_line, const char *format, ...)\n{\n if (!_loggingEnabled && err == None)\n return;\n\n \/\/ Called in LOG_PRINT macro (see log.h)\n\/\/ if (!isEnabled(source_file))\n\/\/ return;\n\n core_id_t core_id;\n bool sim_thread;\n discoverCore(&core_id, &sim_thread);\n \n FILE *file;\n Lock *lock;\n\n getFile(core_id, sim_thread, &file, &lock);\n int tid = syscall(__NR_gettid);\n\n\n char message[512];\n char *p = message;\n\n \/\/ This is ugly, but it just prints the time stamp, process number, core number, source file\/line\n if (core_id != INVALID_CORE_ID) \/\/ valid core id\n p += sprintf(p, \"%-10llu [%5d] (%2i) [%2i]%s[%s:%4d] \", getTimestamp(), tid, Config::getSingleton()->getCurrentProcessNum(), core_id, (sim_thread ? \"* \" : \" \"), source_file, source_line);\n else if (Config::getSingleton()->getCurrentProcessNum() != (UInt32)-1) \/\/ valid proc id\n p += sprintf(p, \"%-10llu [%5d] (%2i) [ ] [%s:%4d] \", getTimestamp(), tid, Config::getSingleton()->getCurrentProcessNum(), source_file, source_line);\n else \/\/ who knows\n p += sprintf(p, \"%-10llu [%5d] ( ) [ ] [%s:%4d] \", getTimestamp(), tid, source_file, source_line);\n\n switch (err)\n {\n case None:\n default:\n break;\n\n case Warning:\n p += sprintf(p, \"*WARNING* \");\n break;\n\n case Error:\n p += sprintf(p, \"*ERROR* \");\n break;\n };\n\n va_list args;\n va_start(args, format);\n p += vsprintf(p, format, args);\n va_end(args);\n\n p += sprintf(p, \"\\n\");\n\n lock->acquire();\n\n fputs(message, file);\n fflush(file);\n\n lock->release();\n\n switch (err)\n {\n case Error:\n fputs(message, stderr);\n abort();\n break;\n\n case Warning:\n fputs(message, stderr);\n break;\n\n case None:\n default:\n break;\n }\n}\n<|endoftext|>"} {"text":"<commit_before>\/*=========================================================================\n\n Program: Visualization Toolkit\n Module: vtkCell.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 \"vtkCell.h\"\n\n\/\/ Construct cell.\nvtkCell::vtkCell()\n{\n this->Points = vtkPoints::New();\n this->PointIds = vtkIdList::New();\n} \n\nvtkCell::~vtkCell()\n{\n this->Points->Delete();\n this->PointIds->Delete();\n}\n\n\n\/\/\n\/\/ Instantiate cell from outside\n\/\/\nvoid vtkCell::Initialize(int npts, int *pts, vtkPoints *p)\n{\n this->PointIds->Reset();\n this->Points->Reset();\n\n for (int i=0; i<npts; i++)\n {\n this->PointIds->InsertId(i,pts[i]);\n this->Points->InsertPoint(i,p->GetPoint(pts[i]));\n }\n}\n \nvoid vtkCell::ShallowCopy(vtkCell *c)\n{\n this->Points->ShallowCopy(c->Points);\n this->PointIds->DeepCopy(c->PointIds);\n}\n\nvoid vtkCell::DeepCopy(vtkCell *c)\n{\n this->Points->DeepCopy(c->Points);\n this->PointIds->DeepCopy(c->PointIds);\n}\n\n#define VTK_RIGHT 0\n#define VTK_LEFT 1\n#define VTK_MIDDLE 2\n\n\/\/ Bounding box intersection modified from Graphics Gems Vol I.\n\/\/ Note: the intersection ray is assumed normalized, such that\n\/\/ valid intersections can only occur between [0,1]. Method returns non-zero\n\/\/ value if bounding box is hit. Origin[3] starts the ray, dir[3] is the \n\/\/ components of the ray in the x-y-z directions, coord[3] is the location \n\/\/ of hit, and t is the parametric coordinate along line.\nchar vtkCell::HitBBox (float bounds[6], float origin[3], float dir[3], \n float coord[3], float& t)\n{\n char inside=1;\n char quadrant[3];\n int i, whichPlane=0;\n float maxT[3], candidatePlane[3];\n\/\/\n\/\/ First find closest planes\n\/\/\n for (i=0; i<3; i++) \n {\n if ( origin[i] < bounds[2*i] ) \n {\n quadrant[i] = VTK_LEFT;\n candidatePlane[i] = bounds[2*i];\n inside = 0;\n }\n else if ( origin[i] > bounds[2*i+1] ) \n {\n quadrant[i] = VTK_RIGHT;\n candidatePlane[i] = bounds[2*i+1];\n inside = 0;\n }\n else \n {\n quadrant[i] = VTK_MIDDLE;\n }\n }\n\/\/\n\/\/ Check whether origin of ray is inside bbox\n\/\/\n if (inside) \n {\n coord[0] = origin[0];\n coord[1] = origin[1];\n coord[2] = origin[2];\n t = 0;\n return 1;\n }\n \n\/\/\n\/\/ Calculate parametric distances to plane\n\/\/\n for (i=0; i<3; i++)\n {\n if ( quadrant[i] != VTK_MIDDLE && dir[i] != 0.0 )\n {\n maxT[i] = (candidatePlane[i]-origin[i]) \/ dir[i];\n }\n else\n {\n maxT[i] = -1.0;\n }\n }\n\/\/\n\/\/ Find the largest parametric value of intersection\n\/\/\n for (i=0; i<3; i++)\n {\n if ( maxT[whichPlane] < maxT[i] )\n {\n whichPlane = i;\n }\n }\n\/\/\n\/\/ Check for valid intersection along line\n\/\/\n if ( maxT[whichPlane] > 1.0 || maxT[whichPlane] < 0.0 )\n {\n return 0;\n }\n else\n {\n t = maxT[whichPlane];\n }\n\/\/\n\/\/ Intersection point along line is okay. Check bbox.\n\/\/\n for (i=0; i<3; i++) \n {\n if (whichPlane != i) \n {\n coord[i] = origin[i] + maxT[whichPlane]*dir[i];\n if ( coord[i] < bounds[2*i] || coord[i] > bounds[2*i+1] )\n\t{\n return 0;\n\t}\n } \n else \n {\n coord[i] = candidatePlane[i];\n }\n }\n\n return 1;\n}\n\n\/\/ Compute cell bounding box (xmin,xmax,ymin,ymax,zmin,zmax). Return pointer\n\/\/ to array of six float values.\nfloat *vtkCell::GetBounds ()\n{\n float *x;\n int i, numPts=this->Points->GetNumberOfPoints();\n\n this->Bounds[0] = this->Bounds[2] = this->Bounds[4] = VTK_LARGE_FLOAT;\n this->Bounds[1] = this->Bounds[3] = this->Bounds[5] = -VTK_LARGE_FLOAT;\n\n for (i=0; i<numPts; i++)\n {\n x = this->Points->GetPoint(i);\n\n this->Bounds[0] = (x[0] < this->Bounds[0] ? x[0] : this->Bounds[0]);\n this->Bounds[1] = (x[0] > this->Bounds[1] ? x[0] : this->Bounds[1]);\n this->Bounds[2] = (x[1] < this->Bounds[2] ? x[1] : this->Bounds[2]);\n this->Bounds[3] = (x[1] > this->Bounds[3] ? x[1] : this->Bounds[3]);\n this->Bounds[4] = (x[2] < this->Bounds[4] ? x[2] : this->Bounds[4]);\n this->Bounds[5] = (x[2] > this->Bounds[5] ? x[2] : this->Bounds[5]);\n \n }\n return this->Bounds;\n}\n\n\/\/ Compute cell bounding box (xmin,xmax,ymin,ymax,zmin,zmax). Copy result into\n\/\/ user provided array.\nvoid vtkCell::GetBounds(float bounds[6])\n{\n this->GetBounds();\n for (int i=0; i < 6; i++)\n {\n bounds[i] = this->Bounds[i];\n }\n}\n\n\/\/ Compute Length squared of cell (i.e., bounding box diagonal squared).\nfloat vtkCell::GetLength2 ()\n{\n float diff, l=0.0;\n int i;\n\n this->GetBounds();\n for (i=0; i<3; i++)\n {\n diff = this->Bounds[2*i+1] - this->Bounds[2*i];\n l += diff * diff;\n }\n \n return l;\n}\n\n\/\/ Return center of the cell in parametric coordinates.\n\/\/ Note that the parametric center is not always located \n\/\/ at (0.5,0.5,0.5). The return value is the subId that\n\/\/ the center is in (if a composite cell). If you want the\n\/\/ center in x-y-z space, invoke the EvaluateLocation() method.\nint vtkCell::GetParametricCenter(float pcoords[3])\n{\n pcoords[0] = pcoords[1] = pcoords[2] = 0.5;\n return 0;\n}\n\nvoid vtkCell::PrintSelf(ostream& os, vtkIndent indent)\n{\n int numIds=this->PointIds->GetNumberOfIds();\n\n vtkObject::PrintSelf(os,indent);\n\n os << indent << \"Number Of Points: \" << numIds << \"\\n\";\n\n if ( numIds > 0 )\n {\n float *bounds=this->GetBounds();\n\n os << indent << \"Bounds: \\n\";\n os << indent << \" Xmin,Xmax: (\" << bounds[0] << \", \" << bounds[1] << \")\\n\";\n os << indent << \" Ymin,Ymax: (\" << bounds[2] << \", \" << bounds[3] << \")\\n\";\n os << indent << \" Zmin,Zmax: (\" << bounds[4] << \", \" << bounds[5] << \")\\n\";\n\n os << indent << \" Point ids are: \";\n for (int i=0; i < numIds; i++)\n {\n os << this->PointIds->GetId(i);\n if ( i && !(i % 12) )\n\t{\n\tos << \"\\n\\t\";\n\t}\n else\n\t{\n\tif ( i != (numIds-1) )\n\t {\n\t os << \", \";\n\t }\n\t}\n }\n os << indent << \"\\n\";\n }\n}\n<commit_msg>ENH:Corrected SHallowCopy method<commit_after>\/*=========================================================================\n\n Program: Visualization Toolkit\n Module: vtkCell.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 \"vtkCell.h\"\n\n\/\/ Construct cell.\nvtkCell::vtkCell()\n{\n this->Points = vtkPoints::New();\n this->PointIds = vtkIdList::New();\n} \n\nvtkCell::~vtkCell()\n{\n this->Points->Delete();\n this->PointIds->Delete();\n}\n\n\n\/\/\n\/\/ Instantiate cell from outside\n\/\/\nvoid vtkCell::Initialize(int npts, int *pts, vtkPoints *p)\n{\n this->PointIds->Reset();\n this->Points->Reset();\n\n for (int i=0; i<npts; i++)\n {\n this->PointIds->InsertId(i,pts[i]);\n this->Points->InsertPoint(i,p->GetPoint(pts[i]));\n }\n}\n \nvoid vtkCell::ShallowCopy(vtkCell *c)\n{\n this->Points->ShallowCopy(c->Points);\n if ( this->PointIds )\n {\n this->PointIds->Delete();\n this->PointIds = c->PointIds;\n this->PointIds->Register(this);\n }\n}\n\nvoid vtkCell::DeepCopy(vtkCell *c)\n{\n this->Points->DeepCopy(c->Points);\n this->PointIds->DeepCopy(c->PointIds);\n}\n\n#define VTK_RIGHT 0\n#define VTK_LEFT 1\n#define VTK_MIDDLE 2\n\n\/\/ Bounding box intersection modified from Graphics Gems Vol I.\n\/\/ Note: the intersection ray is assumed normalized, such that\n\/\/ valid intersections can only occur between [0,1]. Method returns non-zero\n\/\/ value if bounding box is hit. Origin[3] starts the ray, dir[3] is the \n\/\/ components of the ray in the x-y-z directions, coord[3] is the location \n\/\/ of hit, and t is the parametric coordinate along line.\nchar vtkCell::HitBBox (float bounds[6], float origin[3], float dir[3], \n float coord[3], float& t)\n{\n char inside=1;\n char quadrant[3];\n int i, whichPlane=0;\n float maxT[3], candidatePlane[3];\n\/\/\n\/\/ First find closest planes\n\/\/\n for (i=0; i<3; i++) \n {\n if ( origin[i] < bounds[2*i] ) \n {\n quadrant[i] = VTK_LEFT;\n candidatePlane[i] = bounds[2*i];\n inside = 0;\n }\n else if ( origin[i] > bounds[2*i+1] ) \n {\n quadrant[i] = VTK_RIGHT;\n candidatePlane[i] = bounds[2*i+1];\n inside = 0;\n }\n else \n {\n quadrant[i] = VTK_MIDDLE;\n }\n }\n\/\/\n\/\/ Check whether origin of ray is inside bbox\n\/\/\n if (inside) \n {\n coord[0] = origin[0];\n coord[1] = origin[1];\n coord[2] = origin[2];\n t = 0;\n return 1;\n }\n \n\/\/\n\/\/ Calculate parametric distances to plane\n\/\/\n for (i=0; i<3; i++)\n {\n if ( quadrant[i] != VTK_MIDDLE && dir[i] != 0.0 )\n {\n maxT[i] = (candidatePlane[i]-origin[i]) \/ dir[i];\n }\n else\n {\n maxT[i] = -1.0;\n }\n }\n\/\/\n\/\/ Find the largest parametric value of intersection\n\/\/\n for (i=0; i<3; i++)\n {\n if ( maxT[whichPlane] < maxT[i] )\n {\n whichPlane = i;\n }\n }\n\/\/\n\/\/ Check for valid intersection along line\n\/\/\n if ( maxT[whichPlane] > 1.0 || maxT[whichPlane] < 0.0 )\n {\n return 0;\n }\n else\n {\n t = maxT[whichPlane];\n }\n\/\/\n\/\/ Intersection point along line is okay. Check bbox.\n\/\/\n for (i=0; i<3; i++) \n {\n if (whichPlane != i) \n {\n coord[i] = origin[i] + maxT[whichPlane]*dir[i];\n if ( coord[i] < bounds[2*i] || coord[i] > bounds[2*i+1] )\n\t{\n return 0;\n\t}\n } \n else \n {\n coord[i] = candidatePlane[i];\n }\n }\n\n return 1;\n}\n\n\/\/ Compute cell bounding box (xmin,xmax,ymin,ymax,zmin,zmax). Return pointer\n\/\/ to array of six float values.\nfloat *vtkCell::GetBounds ()\n{\n float *x;\n int i, numPts=this->Points->GetNumberOfPoints();\n\n this->Bounds[0] = this->Bounds[2] = this->Bounds[4] = VTK_LARGE_FLOAT;\n this->Bounds[1] = this->Bounds[3] = this->Bounds[5] = -VTK_LARGE_FLOAT;\n\n for (i=0; i<numPts; i++)\n {\n x = this->Points->GetPoint(i);\n\n this->Bounds[0] = (x[0] < this->Bounds[0] ? x[0] : this->Bounds[0]);\n this->Bounds[1] = (x[0] > this->Bounds[1] ? x[0] : this->Bounds[1]);\n this->Bounds[2] = (x[1] < this->Bounds[2] ? x[1] : this->Bounds[2]);\n this->Bounds[3] = (x[1] > this->Bounds[3] ? x[1] : this->Bounds[3]);\n this->Bounds[4] = (x[2] < this->Bounds[4] ? x[2] : this->Bounds[4]);\n this->Bounds[5] = (x[2] > this->Bounds[5] ? x[2] : this->Bounds[5]);\n \n }\n return this->Bounds;\n}\n\n\/\/ Compute cell bounding box (xmin,xmax,ymin,ymax,zmin,zmax). Copy result into\n\/\/ user provided array.\nvoid vtkCell::GetBounds(float bounds[6])\n{\n this->GetBounds();\n for (int i=0; i < 6; i++)\n {\n bounds[i] = this->Bounds[i];\n }\n}\n\n\/\/ Compute Length squared of cell (i.e., bounding box diagonal squared).\nfloat vtkCell::GetLength2 ()\n{\n float diff, l=0.0;\n int i;\n\n this->GetBounds();\n for (i=0; i<3; i++)\n {\n diff = this->Bounds[2*i+1] - this->Bounds[2*i];\n l += diff * diff;\n }\n \n return l;\n}\n\n\/\/ Return center of the cell in parametric coordinates.\n\/\/ Note that the parametric center is not always located \n\/\/ at (0.5,0.5,0.5). The return value is the subId that\n\/\/ the center is in (if a composite cell). If you want the\n\/\/ center in x-y-z space, invoke the EvaluateLocation() method.\nint vtkCell::GetParametricCenter(float pcoords[3])\n{\n pcoords[0] = pcoords[1] = pcoords[2] = 0.5;\n return 0;\n}\n\nvoid vtkCell::PrintSelf(ostream& os, vtkIndent indent)\n{\n int numIds=this->PointIds->GetNumberOfIds();\n\n vtkObject::PrintSelf(os,indent);\n\n os << indent << \"Number Of Points: \" << numIds << \"\\n\";\n\n if ( numIds > 0 )\n {\n float *bounds=this->GetBounds();\n\n os << indent << \"Bounds: \\n\";\n os << indent << \" Xmin,Xmax: (\" << bounds[0] << \", \" << bounds[1] << \")\\n\";\n os << indent << \" Ymin,Ymax: (\" << bounds[2] << \", \" << bounds[3] << \")\\n\";\n os << indent << \" Zmin,Zmax: (\" << bounds[4] << \", \" << bounds[5] << \")\\n\";\n\n os << indent << \" Point ids are: \";\n for (int i=0; i < numIds; i++)\n {\n os << this->PointIds->GetId(i);\n if ( i && !(i % 12) )\n\t{\n\tos << \"\\n\\t\";\n\t}\n else\n\t{\n\tif ( i != (numIds-1) )\n\t {\n\t os << \", \";\n\t }\n\t}\n }\n os << indent << \"\\n\";\n }\n}\n<|endoftext|>"} {"text":"<commit_before>\/\/ Copyright (c) 2010 The Chromium Authors. All rights reserved.\n\/\/ Use of this source code is governed by a BSD-style license that can be\n\/\/ found in the LICENSE file.\n\n#include \"base\/command_line.h\"\n#include \"base\/file_path.h\"\n#include \"base\/file_util.h\"\n#include \"base\/ref_counted.h\"\n#include \"base\/scoped_temp_dir.h\"\n#include \"base\/utf_string_conversions.h\"\n#include \"chrome\/browser\/in_process_webkit\/indexed_db_context.h\"\n#include \"chrome\/browser\/in_process_webkit\/webkit_context.h\"\n#include \"chrome\/browser\/tab_contents\/tab_contents.h\"\n#include \"chrome\/browser\/ui\/browser.h\"\n#include \"chrome\/test\/in_process_browser_test.h\"\n#include \"chrome\/test\/testing_profile.h\"\n#include \"chrome\/test\/thread_test_helper.h\"\n#include \"chrome\/test\/ui_test_utils.h\"\n\n\/\/ This browser test is aimed towards exercising the IndexedDB bindings and\n\/\/ the actual implementation that lives in the browser side (in_process_webkit).\nclass IndexedDBBrowserTest : public InProcessBrowserTest {\n public:\n IndexedDBBrowserTest() {\n EnableDOMAutomation();\n }\n\n GURL testUrl(const FilePath& file_path) {\n const FilePath kTestDir(FILE_PATH_LITERAL(\"indexeddb\"));\n return ui_test_utils::GetTestUrl(kTestDir, file_path);\n }\n\n void SimpleTest(const GURL& test_url) {\n \/\/ The test page will perform tests on IndexedDB, then navigate to either\n \/\/ a #pass or #fail ref.\n LOG(INFO) << \"Navigating to URL and blocking.\";\n ui_test_utils::NavigateToURLBlockUntilNavigationsComplete(\n browser(), test_url, 2);\n LOG(INFO) << \"Navigation done.\";\n std::string result = browser()->GetSelectedTabContents()->GetURL().ref();\n if (result != \"pass\") {\n std::string js_result;\n ASSERT_TRUE(ui_test_utils::ExecuteJavaScriptAndExtractString(\n browser()->GetSelectedTabContents()->render_view_host(), L\"\",\n L\"window.domAutomationController.send(getLog())\", &js_result));\n FAIL() << \"Failed: \" << js_result;\n }\n }\n};\n\n\/\/ TODO(jorlow): As of Feb 14, 2011 I'm re-enabling these tests because we have\n\/\/ fixed a couple known sources of flake and I'm hoping they\n\/\/ were the cause of problems. If you see these turn red again,\n\/\/ please don't hesitate to re-disable and mark them against bug\n\/\/ http:\/\/code.google.com\/p\/chromium\/issues\/detail?id=70773\n\nIN_PROC_BROWSER_TEST_F(IndexedDBBrowserTest, CursorTest) {\n SimpleTest(testUrl(FilePath(FILE_PATH_LITERAL(\"cursor_test.html\"))));\n}\n\nIN_PROC_BROWSER_TEST_F(IndexedDBBrowserTest, IndexTest) {\n SimpleTest(testUrl(FilePath(FILE_PATH_LITERAL(\"index_test.html\"))));\n}\n\nIN_PROC_BROWSER_TEST_F(IndexedDBBrowserTest, KeyPathTest) {\n SimpleTest(testUrl(FilePath(FILE_PATH_LITERAL(\"key_path_test.html\"))));\n}\n\nIN_PROC_BROWSER_TEST_F(IndexedDBBrowserTest, TransactionGetTest) {\n SimpleTest(testUrl(FilePath(FILE_PATH_LITERAL(\"transaction_get_test.html\"))));\n}\n\nIN_PROC_BROWSER_TEST_F(IndexedDBBrowserTest, ObjectStoreTest) {\n SimpleTest(testUrl(FilePath(FILE_PATH_LITERAL(\"object_store_test.html\"))));\n}\n\nIN_PROC_BROWSER_TEST_F(IndexedDBBrowserTest, DatabaseTest) {\n SimpleTest(testUrl(FilePath(FILE_PATH_LITERAL(\"database_test.html\"))));\n}\n\nIN_PROC_BROWSER_TEST_F(IndexedDBBrowserTest, TransactionTest) {\n SimpleTest(testUrl(FilePath(FILE_PATH_LITERAL(\"transaction_test.html\"))));\n}\n\nIN_PROC_BROWSER_TEST_F(IndexedDBBrowserTest, DoesntHangTest) {\n SimpleTest(testUrl(FilePath(\n FILE_PATH_LITERAL(\"transaction_run_forever.html\"))));\n ui_test_utils::CrashTab(browser()->GetSelectedTabContents());\n SimpleTest(testUrl(FilePath(FILE_PATH_LITERAL(\"transaction_test.html\"))));\n}\n\n\/\/ In proc browser test is needed here because ClearLocalState indirectly calls\n\/\/ WebKit's isMainThread through WebSecurityOrigin->SecurityOrigin.\nIN_PROC_BROWSER_TEST_F(IndexedDBBrowserTest, ClearLocalState) {\n \/\/ Create test files.\n ScopedTempDir temp_dir;\n ASSERT_TRUE(temp_dir.CreateUniqueTempDir());\n FilePath indexeddb_dir = temp_dir.path().Append(\n IndexedDBContext::kIndexedDBDirectory);\n ASSERT_TRUE(file_util::CreateDirectory(indexeddb_dir));\n\n FilePath::StringType file_name_1(FILE_PATH_LITERAL(\"http_foo_0\"));\n file_name_1.append(IndexedDBContext::kIndexedDBExtension);\n FilePath::StringType file_name_2(FILE_PATH_LITERAL(\"chrome-extension_foo_0\"));\n file_name_2.append(IndexedDBContext::kIndexedDBExtension);\n FilePath temp_file_path_1 = indexeddb_dir.Append(file_name_1);\n FilePath temp_file_path_2 = indexeddb_dir.Append(file_name_2);\n\n ASSERT_EQ(1, file_util::WriteFile(temp_file_path_1, \".\", 1));\n ASSERT_EQ(1, file_util::WriteFile(temp_file_path_2, \"o\", 1));\n\n \/\/ Create the scope which will ensure we run the destructor of the webkit\n \/\/ context which should trigger the clean up.\n {\n TestingProfile profile;\n WebKitContext *webkit_context = profile.GetWebKitContext();\n webkit_context->indexed_db_context()->set_data_path(indexeddb_dir);\n webkit_context->set_clear_local_state_on_exit(true);\n }\n \/\/ Make sure we wait until the destructor has run.\n scoped_refptr<ThreadTestHelper> helper(\n new ThreadTestHelper(BrowserThread::WEBKIT));\n ASSERT_TRUE(helper->Run());\n\n \/\/ Because we specified https for scheme to be skipped the second file\n \/\/ should survive and the first go into vanity.\n ASSERT_FALSE(file_util::PathExists(temp_file_path_1));\n ASSERT_TRUE(file_util::PathExists(temp_file_path_2));\n}\n<commit_msg>These tests are still flaky, so I'm disabling agin.<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\/file_path.h\"\n#include \"base\/file_util.h\"\n#include \"base\/ref_counted.h\"\n#include \"base\/scoped_temp_dir.h\"\n#include \"base\/utf_string_conversions.h\"\n#include \"chrome\/browser\/in_process_webkit\/indexed_db_context.h\"\n#include \"chrome\/browser\/in_process_webkit\/webkit_context.h\"\n#include \"chrome\/browser\/tab_contents\/tab_contents.h\"\n#include \"chrome\/browser\/ui\/browser.h\"\n#include \"chrome\/test\/in_process_browser_test.h\"\n#include \"chrome\/test\/testing_profile.h\"\n#include \"chrome\/test\/thread_test_helper.h\"\n#include \"chrome\/test\/ui_test_utils.h\"\n\n\/\/ This browser test is aimed towards exercising the IndexedDB bindings and\n\/\/ the actual implementation that lives in the browser side (in_process_webkit).\nclass IndexedDBBrowserTest : public InProcessBrowserTest {\n public:\n IndexedDBBrowserTest() {\n EnableDOMAutomation();\n }\n\n GURL testUrl(const FilePath& file_path) {\n const FilePath kTestDir(FILE_PATH_LITERAL(\"indexeddb\"));\n return ui_test_utils::GetTestUrl(kTestDir, file_path);\n }\n\n void SimpleTest(const GURL& test_url) {\n \/\/ The test page will perform tests on IndexedDB, then navigate to either\n \/\/ a #pass or #fail ref.\n LOG(INFO) << \"Navigating to URL and blocking.\";\n ui_test_utils::NavigateToURLBlockUntilNavigationsComplete(\n browser(), test_url, 2);\n LOG(INFO) << \"Navigation done.\";\n std::string result = browser()->GetSelectedTabContents()->GetURL().ref();\n if (result != \"pass\") {\n std::string js_result;\n ASSERT_TRUE(ui_test_utils::ExecuteJavaScriptAndExtractString(\n browser()->GetSelectedTabContents()->render_view_host(), L\"\",\n L\"window.domAutomationController.send(getLog())\", &js_result));\n FAIL() << \"Failed: \" << js_result;\n }\n }\n};\n\nIN_PROC_BROWSER_TEST_F(IndexedDBBrowserTest, CursorTest) {\n SimpleTest(testUrl(FilePath(FILE_PATH_LITERAL(\"cursor_test.html\"))));\n}\n\n\/\/ Flaky: http:\/\/crbug.com\/70773\nIN_PROC_BROWSER_TEST_F(IndexedDBBrowserTest, DISABLED_IndexTest) {\n SimpleTest(testUrl(FilePath(FILE_PATH_LITERAL(\"index_test.html\"))));\n}\n\n\/\/ Flaky: http:\/\/crbug.com\/70773\nIN_PROC_BROWSER_TEST_F(IndexedDBBrowserTest, DISABLED_KeyPathTest) {\n SimpleTest(testUrl(FilePath(FILE_PATH_LITERAL(\"key_path_test.html\"))));\n}\n\nIN_PROC_BROWSER_TEST_F(IndexedDBBrowserTest, TransactionGetTest) {\n SimpleTest(testUrl(FilePath(FILE_PATH_LITERAL(\"transaction_get_test.html\"))));\n}\n\n\/\/ Flaky: http:\/\/crbug.com\/70773\nIN_PROC_BROWSER_TEST_F(IndexedDBBrowserTest, DISABLED_ObjectStoreTest) {\n SimpleTest(testUrl(FilePath(FILE_PATH_LITERAL(\"object_store_test.html\"))));\n}\n\nIN_PROC_BROWSER_TEST_F(IndexedDBBrowserTest, DatabaseTest) {\n SimpleTest(testUrl(FilePath(FILE_PATH_LITERAL(\"database_test.html\"))));\n}\n\n\/\/ Flaky: http:\/\/crbug.com\/70773\nIN_PROC_BROWSER_TEST_F(IndexedDBBrowserTest, DISABLED_TransactionTest) {\n SimpleTest(testUrl(FilePath(FILE_PATH_LITERAL(\"transaction_test.html\"))));\n}\n\n\/\/ Flaky: http:\/\/crbug.com\/70773\nIN_PROC_BROWSER_TEST_F(IndexedDBBrowserTest, DISABLED_DoesntHangTest) {\n SimpleTest(testUrl(FilePath(\n FILE_PATH_LITERAL(\"transaction_run_forever.html\"))));\n ui_test_utils::CrashTab(browser()->GetSelectedTabContents());\n SimpleTest(testUrl(FilePath(FILE_PATH_LITERAL(\"transaction_test.html\"))));\n}\n\n\/\/ In proc browser test is needed here because ClearLocalState indirectly calls\n\/\/ WebKit's isMainThread through WebSecurityOrigin->SecurityOrigin.\nIN_PROC_BROWSER_TEST_F(IndexedDBBrowserTest, ClearLocalState) {\n \/\/ Create test files.\n ScopedTempDir temp_dir;\n ASSERT_TRUE(temp_dir.CreateUniqueTempDir());\n FilePath indexeddb_dir = temp_dir.path().Append(\n IndexedDBContext::kIndexedDBDirectory);\n ASSERT_TRUE(file_util::CreateDirectory(indexeddb_dir));\n\n FilePath::StringType file_name_1(FILE_PATH_LITERAL(\"http_foo_0\"));\n file_name_1.append(IndexedDBContext::kIndexedDBExtension);\n FilePath::StringType file_name_2(FILE_PATH_LITERAL(\"chrome-extension_foo_0\"));\n file_name_2.append(IndexedDBContext::kIndexedDBExtension);\n FilePath temp_file_path_1 = indexeddb_dir.Append(file_name_1);\n FilePath temp_file_path_2 = indexeddb_dir.Append(file_name_2);\n\n ASSERT_EQ(1, file_util::WriteFile(temp_file_path_1, \".\", 1));\n ASSERT_EQ(1, file_util::WriteFile(temp_file_path_2, \"o\", 1));\n\n \/\/ Create the scope which will ensure we run the destructor of the webkit\n \/\/ context which should trigger the clean up.\n {\n TestingProfile profile;\n WebKitContext *webkit_context = profile.GetWebKitContext();\n webkit_context->indexed_db_context()->set_data_path(indexeddb_dir);\n webkit_context->set_clear_local_state_on_exit(true);\n }\n \/\/ Make sure we wait until the destructor has run.\n scoped_refptr<ThreadTestHelper> helper(\n new ThreadTestHelper(BrowserThread::WEBKIT));\n ASSERT_TRUE(helper->Run());\n\n \/\/ Because we specified https for scheme to be skipped the second file\n \/\/ should survive and the first go into vanity.\n ASSERT_FALSE(file_util::PathExists(temp_file_path_1));\n ASSERT_TRUE(file_util::PathExists(temp_file_path_2));\n}\n<|endoftext|>"} {"text":"<commit_before><commit_msg>Resolves: #i120663# The SvXMLImportContext is always leaked<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\/ui\/views\/notifications\/balloon_view_host.h\"\n\n#include \"chrome\/browser\/notifications\/balloon.h\"\n#include \"content\/browser\/renderer_host\/render_view_host.h\"\n#include \"content\/browser\/renderer_host\/render_widget_host_view.h\"\n#include \"content\/public\/browser\/content_browser_client.h\"\n#include \"views\/widget\/widget.h\"\n\n#if defined(USE_AURA)\n#include \"content\/browser\/renderer_host\/render_widget_host_view_aura.h\"\n#elif defined(OS_WIN)\n#include \"content\/browser\/renderer_host\/render_widget_host_view_win.h\"\n#elif defined(TOUCH_UI)\n#include \"chrome\/browser\/renderer_host\/render_widget_host_view_views.h\"\n#elif defined(TOOLKIT_USES_GTK)\n#include \"content\/browser\/renderer_host\/render_widget_host_view_gtk.h\"\n#endif\n\nclass BalloonViewHostView : public views::NativeViewHost {\n public:\n explicit BalloonViewHostView(BalloonViewHost* host)\n : host_(host),\n initialized_(false) {\n }\n\n virtual void ViewHierarchyChanged(bool is_add,\n views::View* parent,\n views::View* child) {\n NativeViewHost::ViewHierarchyChanged(is_add, parent, child);\n if (is_add && GetWidget() && !initialized_) {\n initialized_ = true;\n host_->Init(GetWidget()->GetNativeView());\n }\n }\n\n private:\n \/\/ The host owns this object.\n BalloonViewHost* host_;\n\n bool initialized_;\n};\n\nBalloonViewHost::BalloonViewHost(Balloon* balloon)\n : BalloonHost(balloon) {\n native_host_ = new BalloonViewHostView(this);\n}\n\nBalloonViewHost::~BalloonViewHost() {\n Shutdown();\n}\n\nvoid BalloonViewHost::Init(gfx::NativeView parent_native_view) {\n parent_native_view_ = parent_native_view;\n BalloonHost::Init();\n}\n\nvoid BalloonViewHost::InitRenderWidgetHostView() {\n DCHECK(render_view_host_);\n\n render_widget_host_view_ =\n content::GetContentClient()->browser()->CreateViewForWidget(\n render_view_host_);\n\n \/\/ TODO(johnnyg): http:\/\/crbug.com\/23954. Need a cross-platform solution.\n#if defined(USE_AURA)\n RenderWidgetHostViewAura* view_aura =\n static_cast<RenderWidgetHostViewAura*>(render_widget_host_view_);\n view_aura->Init();\n view_aura->Show();\n native_host_->Attach(view_aura->GetNativeView());\n#elif defined(OS_WIN)\n RenderWidgetHostViewWin* view_win =\n static_cast<RenderWidgetHostViewWin*>(render_widget_host_view_);\n\n \/\/ Create the HWND.\n HWND hwnd = view_win->Create(parent_native_view_);\n view_win->ShowWindow(SW_SHOW);\n native_host_->Attach(hwnd);\n#elif defined(TOUCH_UI)\n RenderWidgetHostViewViews* view_views =\n static_cast<RenderWidgetHostViewViews*>(render_widget_host_view_);\n view_views->InitAsChild();\n native_host_->AttachToView(view_views);\n#elif defined(TOOLKIT_USES_GTK)\n RenderWidgetHostViewGtk* view_gtk =\n static_cast<RenderWidgetHostViewGtk*>(render_widget_host_view_);\n view_gtk->InitAsChild();\n native_host_->Attach(view_gtk->native_view());\n#else\n NOTIMPLEMENTED();\n#endif\n}\n\nRenderWidgetHostView* BalloonViewHost::render_widget_host_view() const {\n return render_widget_host_view_;\n}\n<commit_msg>aura: Fix build after r108132 and r108048.<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\/notifications\/balloon_view_host.h\"\n\n#include \"chrome\/browser\/notifications\/balloon.h\"\n#include \"content\/browser\/renderer_host\/render_view_host.h\"\n#include \"content\/browser\/renderer_host\/render_widget_host_view.h\"\n#include \"content\/public\/browser\/content_browser_client.h\"\n#include \"views\/widget\/widget.h\"\n\n#if defined(USE_AURA)\n#include \"content\/browser\/renderer_host\/render_widget_host_view_aura.h\"\n#elif defined(OS_WIN)\n#include \"content\/browser\/renderer_host\/render_widget_host_view_win.h\"\n#elif defined(TOUCH_UI)\n#include \"chrome\/browser\/renderer_host\/render_widget_host_view_views.h\"\n#elif defined(TOOLKIT_USES_GTK)\n#include \"content\/browser\/renderer_host\/render_widget_host_view_gtk.h\"\n#endif\n\nclass BalloonViewHostView : public views::NativeViewHost {\n public:\n explicit BalloonViewHostView(BalloonViewHost* host)\n : host_(host),\n initialized_(false) {\n }\n\n virtual void ViewHierarchyChanged(bool is_add,\n views::View* parent,\n views::View* child) {\n NativeViewHost::ViewHierarchyChanged(is_add, parent, child);\n if (is_add && GetWidget() && !initialized_) {\n initialized_ = true;\n host_->Init(GetWidget()->GetNativeView());\n }\n }\n\n private:\n \/\/ The host owns this object.\n BalloonViewHost* host_;\n\n bool initialized_;\n};\n\nBalloonViewHost::BalloonViewHost(Balloon* balloon)\n : BalloonHost(balloon) {\n native_host_ = new BalloonViewHostView(this);\n}\n\nBalloonViewHost::~BalloonViewHost() {\n Shutdown();\n}\n\nvoid BalloonViewHost::Init(gfx::NativeView parent_native_view) {\n parent_native_view_ = parent_native_view;\n BalloonHost::Init();\n}\n\nvoid BalloonViewHost::InitRenderWidgetHostView() {\n DCHECK(render_view_host_);\n\n render_widget_host_view_ =\n content::GetContentClient()->browser()->CreateViewForWidget(\n render_view_host_);\n\n \/\/ TODO(johnnyg): http:\/\/crbug.com\/23954. Need a cross-platform solution.\n#if defined(USE_AURA)\n RenderWidgetHostViewAura* view_aura =\n static_cast<RenderWidgetHostViewAura*>(render_widget_host_view_);\n view_aura->InitAsChild();\n view_aura->Show();\n native_host_->Attach(view_aura->GetNativeView());\n#elif defined(OS_WIN)\n RenderWidgetHostViewWin* view_win =\n static_cast<RenderWidgetHostViewWin*>(render_widget_host_view_);\n\n \/\/ Create the HWND.\n HWND hwnd = view_win->Create(parent_native_view_);\n view_win->ShowWindow(SW_SHOW);\n native_host_->Attach(hwnd);\n#elif defined(TOUCH_UI)\n RenderWidgetHostViewViews* view_views =\n static_cast<RenderWidgetHostViewViews*>(render_widget_host_view_);\n view_views->InitAsChild();\n native_host_->AttachToView(view_views);\n#elif defined(TOOLKIT_USES_GTK)\n RenderWidgetHostViewGtk* view_gtk =\n static_cast<RenderWidgetHostViewGtk*>(render_widget_host_view_);\n view_gtk->InitAsChild();\n native_host_->Attach(view_gtk->native_view());\n#else\n NOTIMPLEMENTED();\n#endif\n}\n\nRenderWidgetHostView* BalloonViewHost::render_widget_host_view() const {\n return render_widget_host_view_;\n}\n<|endoftext|>"} {"text":"<commit_before>\/****************************************************************************\n**\n** Copyright (C) 2013 Digia Plc and\/or its subsidiary(-ies).\n** Contact: http:\/\/www.qt-project.org\/legal\n**\n** This file is part of the QtQml module of the Qt Toolkit.\n**\n** $QT_BEGIN_LICENSE:LGPL$\n** Commercial License Usage\n** Licensees holding valid commercial Qt licenses may use this file in\n** accordance with the commercial license agreement provided with the\n** Software or, alternatively, in accordance with the terms contained in\n** a written agreement between you and Digia. For licensing terms and\n** conditions see http:\/\/qt.digia.com\/licensing. For further information\n** use the contact form at http:\/\/qt.digia.com\/contact-us.\n**\n** GNU Lesser General Public License Usage\n** Alternatively, this file may be used under the terms of the GNU Lesser\n** General Public License version 2.1 as published by the Free Software\n** Foundation and appearing in the file LICENSE.LGPL included in the\n** packaging of this file. Please review the following information to\n** ensure the GNU Lesser General Public License version 2.1 requirements\n** will be met: http:\/\/www.gnu.org\/licenses\/old-licenses\/lgpl-2.1.html.\n**\n** In addition, as a special exception, Digia gives you certain additional\n** rights. These rights are described in the Digia Qt LGPL Exception\n** version 1.1, included in the file LGPL_EXCEPTION.txt in this package.\n**\n** GNU General Public License Usage\n** Alternatively, this file may be used under the terms of the GNU\n** General Public License version 3.0 as published by the Free Software\n** Foundation and appearing in the file LICENSE.GPL included in the\n** packaging of this file. Please review the following information to\n** ensure the GNU General Public License version 3.0 requirements will be\n** met: http:\/\/www.gnu.org\/copyleft\/gpl.html.\n**\n**\n** $QT_END_LICENSE$\n**\n****************************************************************************\/\n\n#include \"qv4compileddata_p.h\"\n#include \"qv4jsir_p.h\"\n#include <private\/qv4engine_p.h>\n#include <private\/qv4function_p.h>\n#include <private\/qv4objectproto_p.h>\n#include <private\/qv4lookup_p.h>\n#include <private\/qv4regexpobject_p.h>\n#include <QCoreApplication>\n\n#include <algorithm>\n\nQT_BEGIN_NAMESPACE\n\nnamespace QV4 {\n\nnamespace CompiledData {\n\nCompilationUnit::~CompilationUnit()\n{\n unlink();\n}\n\nQV4::Function *CompilationUnit::linkToEngine(ExecutionEngine *engine)\n{\n this->engine = engine;\n engine->compilationUnits.insert(this);\n\n assert(!runtimeStrings);\n assert(data);\n runtimeStrings = (QV4::StringValue *)malloc(data->stringTableSize * sizeof(QV4::StringValue));\n \/\/ memset the strings to 0 in case a GC run happens while we're within the loop below\n memset(runtimeStrings, 0, data->stringTableSize * sizeof(QV4::StringValue));\n for (uint i = 0; i < data->stringTableSize; ++i)\n runtimeStrings[i] = engine->newIdentifier(data->stringAt(i));\n\n runtimeRegularExpressions = new QV4::Value[data->regexpTableSize];\n \/\/ memset the regexps to 0 in case a GC run happens while we're within the loop below\n memset(runtimeRegularExpressions, 0, data->regexpTableSize * sizeof(QV4::Value));\n for (uint i = 0; i < data->regexpTableSize; ++i) {\n const CompiledData::RegExp *re = data->regexpAt(i);\n int flags = 0;\n if (re->flags & CompiledData::RegExp::RegExp_Global)\n flags |= IR::RegExp::RegExp_Global;\n if (re->flags & CompiledData::RegExp::RegExp_IgnoreCase)\n flags |= IR::RegExp::RegExp_IgnoreCase;\n if (re->flags & CompiledData::RegExp::RegExp_Multiline)\n flags |= IR::RegExp::RegExp_Multiline;\n runtimeRegularExpressions[i] = engine->newRegExpObject(data->stringAt(re->stringIndex), flags);\n }\n\n if (data->lookupTableSize) {\n runtimeLookups = new QV4::Lookup[data->lookupTableSize];\n memset(runtimeLookups, 0, data->lookupTableSize * sizeof(QV4::Lookup));\n const CompiledData::Lookup *compiledLookups = data->lookupTable();\n for (uint i = 0; i < data->lookupTableSize; ++i) {\n QV4::Lookup *l = runtimeLookups + i;\n\n Lookup::Type type = Lookup::Type(compiledLookups[i].type_and_flags);\n if (type == CompiledData::Lookup::Type_Getter)\n l->getter = QV4::Lookup::getterGeneric;\n else if (type == CompiledData::Lookup::Type_Setter)\n l->setter = QV4::Lookup::setterGeneric;\n else if (type == CompiledData::Lookup::Type_GlobalGetter)\n l->globalGetter = QV4::Lookup::globalGetterGeneric;\n else if (type == CompiledData::Lookup::Type_IndexedGetter)\n l->indexedGetter = QV4::Lookup::indexedGetterGeneric;\n else if (type == CompiledData::Lookup::Type_IndexedSetter)\n l->indexedSetter = QV4::Lookup::indexedSetterGeneric;\n\n for (int j = 0; j < QV4::Lookup::Size; ++j)\n l->classList[j] = 0;\n l->level = -1;\n l->index = UINT_MAX;\n l->name = runtimeStrings[compiledLookups[i].nameIndex].asString();\n if (type == CompiledData::Lookup::Type_IndexedGetter || type == CompiledData::Lookup::Type_IndexedSetter)\n l->engine = engine;\n }\n }\n\n if (data->jsClassTableSize) {\n runtimeClasses = (QV4::InternalClass**)malloc(data->jsClassTableSize * sizeof(QV4::InternalClass*));\n\n for (uint i = 0; i < data->jsClassTableSize; ++i) {\n int memberCount = 0;\n const CompiledData::JSClassMember *member = data->jsClassAt(i, &memberCount);\n QV4::InternalClass *klass = engine->objectClass;\n for (int j = 0; j < memberCount; ++j, ++member)\n klass = klass->addMember(runtimeStrings[member->nameOffset].asString(), member->isAccessor ? QV4::Attr_Accessor : QV4::Attr_Data);\n\n runtimeClasses[i] = klass;\n }\n }\n\n linkBackendToEngine(engine);\n\n#if 0\n runtimeFunctionsSortedByAddress.resize(runtimeFunctions.size());\n memcpy(runtimeFunctionsSortedByAddress.data(), runtimeFunctions.data(), runtimeFunctions.size() * sizeof(QV4::Function*));\n std::sort(runtimeFunctionsSortedByAddress.begin(), runtimeFunctionsSortedByAddress.end(), functionSortHelper);\n#endif\n\n if (data->indexOfRootFunction != -1)\n return runtimeFunctions[data->indexOfRootFunction];\n else\n return 0;\n}\n\nvoid CompilationUnit::unlink()\n{\n if (engine)\n engine->compilationUnits.erase(engine->compilationUnits.find(this));\n engine = 0;\n free(data);\n data = 0;\n free(runtimeStrings);\n runtimeStrings = 0;\n delete [] runtimeLookups;\n runtimeLookups = 0;\n delete [] runtimeRegularExpressions;\n runtimeRegularExpressions = 0;\n free(runtimeClasses);\n runtimeClasses = 0;\n qDeleteAll(runtimeFunctions);\n runtimeFunctions.clear();\n}\n\nvoid CompilationUnit::markObjects(QV4::ExecutionEngine *e)\n{\n for (uint i = 0; i < data->stringTableSize; ++i)\n runtimeStrings[i].mark(e);\n if (runtimeRegularExpressions) {\n for (uint i = 0; i < data->regexpTableSize; ++i)\n runtimeRegularExpressions[i].mark(e);\n }\n if (runtimeLookups) {\n for (uint i = 0; i < data->lookupTableSize; ++i)\n runtimeLookups[i].name->mark(e);\n }\n}\n\nQString Binding::valueAsString(const Unit *unit) const\n{\n switch (type) {\n case Type_Script:\n case Type_String:\n return unit->stringAt(stringIndex);\n case Type_Boolean:\n return value.b ? QStringLiteral(\"true\") : QStringLiteral(\"false\");\n case Type_Number:\n return QString::number(value.d);\n case Type_Invalid:\n return QString();\n case Type_TranslationById: {\n QByteArray id = unit->stringAt(stringIndex).toUtf8();\n return qtTrId(id.constData(), value.translationData.number);\n }\n case Type_Translation: {\n \/\/ This code must match that in the qsTr() implementation\n const QString &path = unit->stringAt(unit->sourceFileIndex);\n int lastSlash = path.lastIndexOf(QLatin1Char('\/'));\n QString context = (lastSlash > -1) ? path.mid(lastSlash + 1, path.length()-lastSlash-5) :\n QString();\n QByteArray contextUtf8 = context.toUtf8();\n QByteArray comment = unit->stringAt(value.translationData.commentIndex).toUtf8();\n QByteArray text = unit->stringAt(stringIndex).toUtf8();\n return QCoreApplication::translate(contextUtf8.constData(), text.constData(),\n comment.constData(), value.translationData.number);\n }\n default:\n break;\n }\n return QString();\n}\n\n\/\/reverse of Lexer::singleEscape()\nstatic QString escapedString(const QString &string)\n{\n QString tmp = QLatin1String(\"\\\"\");\n for (int i = 0; i < string.length(); ++i) {\n const QChar &c = string.at(i);\n switch (c.unicode()) {\n case 0x08:\n tmp += QLatin1String(\"\\\\b\");\n break;\n case 0x09:\n tmp += QLatin1String(\"\\\\t\");\n break;\n case 0x0A:\n tmp += QLatin1String(\"\\\\n\");\n break;\n case 0x0B:\n tmp += QLatin1String(\"\\\\v\");\n break;\n case 0x0C:\n tmp += QLatin1String(\"\\\\f\");\n break;\n case 0x0D:\n tmp += QLatin1String(\"\\\\r\");\n break;\n case 0x22:\n tmp += QLatin1String(\"\\\\\\\"\");\n break;\n case 0x27:\n tmp += QLatin1String(\"\\\\\\'\");\n break;\n case 0x5C:\n tmp += QLatin1String(\"\\\\\\\\\");\n break;\n default:\n tmp += c;\n break;\n }\n }\n tmp += QLatin1Char('\\\"');\n return tmp;\n}\n\nQString Binding::valueAsScriptString(const Unit *unit) const\n{\n if (type == Type_String)\n return escapedString(unit->stringAt(stringIndex));\n else\n return valueAsString(unit);\n}\n\n}\n\n}\n\nQT_END_NAMESPACE\n<commit_msg>Avoid crash when unlinking compilation unit<commit_after>\/****************************************************************************\n**\n** Copyright (C) 2013 Digia Plc and\/or its subsidiary(-ies).\n** Contact: http:\/\/www.qt-project.org\/legal\n**\n** This file is part of the QtQml module of the Qt Toolkit.\n**\n** $QT_BEGIN_LICENSE:LGPL$\n** Commercial License Usage\n** Licensees holding valid commercial Qt licenses may use this file in\n** accordance with the commercial license agreement provided with the\n** Software or, alternatively, in accordance with the terms contained in\n** a written agreement between you and Digia. For licensing terms and\n** conditions see http:\/\/qt.digia.com\/licensing. For further information\n** use the contact form at http:\/\/qt.digia.com\/contact-us.\n**\n** GNU Lesser General Public License Usage\n** Alternatively, this file may be used under the terms of the GNU Lesser\n** General Public License version 2.1 as published by the Free Software\n** Foundation and appearing in the file LICENSE.LGPL included in the\n** packaging of this file. Please review the following information to\n** ensure the GNU Lesser General Public License version 2.1 requirements\n** will be met: http:\/\/www.gnu.org\/licenses\/old-licenses\/lgpl-2.1.html.\n**\n** In addition, as a special exception, Digia gives you certain additional\n** rights. These rights are described in the Digia Qt LGPL Exception\n** version 1.1, included in the file LGPL_EXCEPTION.txt in this package.\n**\n** GNU General Public License Usage\n** Alternatively, this file may be used under the terms of the GNU\n** General Public License version 3.0 as published by the Free Software\n** Foundation and appearing in the file LICENSE.GPL included in the\n** packaging of this file. Please review the following information to\n** ensure the GNU General Public License version 3.0 requirements will be\n** met: http:\/\/www.gnu.org\/copyleft\/gpl.html.\n**\n**\n** $QT_END_LICENSE$\n**\n****************************************************************************\/\n\n#include \"qv4compileddata_p.h\"\n#include \"qv4jsir_p.h\"\n#include <private\/qv4engine_p.h>\n#include <private\/qv4function_p.h>\n#include <private\/qv4objectproto_p.h>\n#include <private\/qv4lookup_p.h>\n#include <private\/qv4regexpobject_p.h>\n#include <QCoreApplication>\n\n#include <algorithm>\n\nQT_BEGIN_NAMESPACE\n\nnamespace QV4 {\n\nnamespace CompiledData {\n\nCompilationUnit::~CompilationUnit()\n{\n unlink();\n}\n\nQV4::Function *CompilationUnit::linkToEngine(ExecutionEngine *engine)\n{\n this->engine = engine;\n engine->compilationUnits.insert(this);\n\n assert(!runtimeStrings);\n assert(data);\n runtimeStrings = (QV4::StringValue *)malloc(data->stringTableSize * sizeof(QV4::StringValue));\n \/\/ memset the strings to 0 in case a GC run happens while we're within the loop below\n memset(runtimeStrings, 0, data->stringTableSize * sizeof(QV4::StringValue));\n for (uint i = 0; i < data->stringTableSize; ++i)\n runtimeStrings[i] = engine->newIdentifier(data->stringAt(i));\n\n runtimeRegularExpressions = new QV4::Value[data->regexpTableSize];\n \/\/ memset the regexps to 0 in case a GC run happens while we're within the loop below\n memset(runtimeRegularExpressions, 0, data->regexpTableSize * sizeof(QV4::Value));\n for (uint i = 0; i < data->regexpTableSize; ++i) {\n const CompiledData::RegExp *re = data->regexpAt(i);\n int flags = 0;\n if (re->flags & CompiledData::RegExp::RegExp_Global)\n flags |= IR::RegExp::RegExp_Global;\n if (re->flags & CompiledData::RegExp::RegExp_IgnoreCase)\n flags |= IR::RegExp::RegExp_IgnoreCase;\n if (re->flags & CompiledData::RegExp::RegExp_Multiline)\n flags |= IR::RegExp::RegExp_Multiline;\n runtimeRegularExpressions[i] = engine->newRegExpObject(data->stringAt(re->stringIndex), flags);\n }\n\n if (data->lookupTableSize) {\n runtimeLookups = new QV4::Lookup[data->lookupTableSize];\n memset(runtimeLookups, 0, data->lookupTableSize * sizeof(QV4::Lookup));\n const CompiledData::Lookup *compiledLookups = data->lookupTable();\n for (uint i = 0; i < data->lookupTableSize; ++i) {\n QV4::Lookup *l = runtimeLookups + i;\n\n Lookup::Type type = Lookup::Type(compiledLookups[i].type_and_flags);\n if (type == CompiledData::Lookup::Type_Getter)\n l->getter = QV4::Lookup::getterGeneric;\n else if (type == CompiledData::Lookup::Type_Setter)\n l->setter = QV4::Lookup::setterGeneric;\n else if (type == CompiledData::Lookup::Type_GlobalGetter)\n l->globalGetter = QV4::Lookup::globalGetterGeneric;\n else if (type == CompiledData::Lookup::Type_IndexedGetter)\n l->indexedGetter = QV4::Lookup::indexedGetterGeneric;\n else if (type == CompiledData::Lookup::Type_IndexedSetter)\n l->indexedSetter = QV4::Lookup::indexedSetterGeneric;\n\n for (int j = 0; j < QV4::Lookup::Size; ++j)\n l->classList[j] = 0;\n l->level = -1;\n l->index = UINT_MAX;\n l->name = runtimeStrings[compiledLookups[i].nameIndex].asString();\n if (type == CompiledData::Lookup::Type_IndexedGetter || type == CompiledData::Lookup::Type_IndexedSetter)\n l->engine = engine;\n }\n }\n\n if (data->jsClassTableSize) {\n runtimeClasses = (QV4::InternalClass**)malloc(data->jsClassTableSize * sizeof(QV4::InternalClass*));\n\n for (uint i = 0; i < data->jsClassTableSize; ++i) {\n int memberCount = 0;\n const CompiledData::JSClassMember *member = data->jsClassAt(i, &memberCount);\n QV4::InternalClass *klass = engine->objectClass;\n for (int j = 0; j < memberCount; ++j, ++member)\n klass = klass->addMember(runtimeStrings[member->nameOffset].asString(), member->isAccessor ? QV4::Attr_Accessor : QV4::Attr_Data);\n\n runtimeClasses[i] = klass;\n }\n }\n\n linkBackendToEngine(engine);\n\n#if 0\n runtimeFunctionsSortedByAddress.resize(runtimeFunctions.size());\n memcpy(runtimeFunctionsSortedByAddress.data(), runtimeFunctions.data(), runtimeFunctions.size() * sizeof(QV4::Function*));\n std::sort(runtimeFunctionsSortedByAddress.begin(), runtimeFunctionsSortedByAddress.end(), functionSortHelper);\n#endif\n\n if (data->indexOfRootFunction != -1)\n return runtimeFunctions[data->indexOfRootFunction];\n else\n return 0;\n}\n\nvoid CompilationUnit::unlink()\n{\n if (engine)\n engine->compilationUnits.erase(engine->compilationUnits.find(this));\n engine = 0;\n if (data && !(data->flags & QV4::CompiledData::Unit::StaticData))\n free(data);\n data = 0;\n free(runtimeStrings);\n runtimeStrings = 0;\n delete [] runtimeLookups;\n runtimeLookups = 0;\n delete [] runtimeRegularExpressions;\n runtimeRegularExpressions = 0;\n free(runtimeClasses);\n runtimeClasses = 0;\n qDeleteAll(runtimeFunctions);\n runtimeFunctions.clear();\n}\n\nvoid CompilationUnit::markObjects(QV4::ExecutionEngine *e)\n{\n for (uint i = 0; i < data->stringTableSize; ++i)\n runtimeStrings[i].mark(e);\n if (runtimeRegularExpressions) {\n for (uint i = 0; i < data->regexpTableSize; ++i)\n runtimeRegularExpressions[i].mark(e);\n }\n if (runtimeLookups) {\n for (uint i = 0; i < data->lookupTableSize; ++i)\n runtimeLookups[i].name->mark(e);\n }\n}\n\nQString Binding::valueAsString(const Unit *unit) const\n{\n switch (type) {\n case Type_Script:\n case Type_String:\n return unit->stringAt(stringIndex);\n case Type_Boolean:\n return value.b ? QStringLiteral(\"true\") : QStringLiteral(\"false\");\n case Type_Number:\n return QString::number(value.d);\n case Type_Invalid:\n return QString();\n case Type_TranslationById: {\n QByteArray id = unit->stringAt(stringIndex).toUtf8();\n return qtTrId(id.constData(), value.translationData.number);\n }\n case Type_Translation: {\n \/\/ This code must match that in the qsTr() implementation\n const QString &path = unit->stringAt(unit->sourceFileIndex);\n int lastSlash = path.lastIndexOf(QLatin1Char('\/'));\n QString context = (lastSlash > -1) ? path.mid(lastSlash + 1, path.length()-lastSlash-5) :\n QString();\n QByteArray contextUtf8 = context.toUtf8();\n QByteArray comment = unit->stringAt(value.translationData.commentIndex).toUtf8();\n QByteArray text = unit->stringAt(stringIndex).toUtf8();\n return QCoreApplication::translate(contextUtf8.constData(), text.constData(),\n comment.constData(), value.translationData.number);\n }\n default:\n break;\n }\n return QString();\n}\n\n\/\/reverse of Lexer::singleEscape()\nstatic QString escapedString(const QString &string)\n{\n QString tmp = QLatin1String(\"\\\"\");\n for (int i = 0; i < string.length(); ++i) {\n const QChar &c = string.at(i);\n switch (c.unicode()) {\n case 0x08:\n tmp += QLatin1String(\"\\\\b\");\n break;\n case 0x09:\n tmp += QLatin1String(\"\\\\t\");\n break;\n case 0x0A:\n tmp += QLatin1String(\"\\\\n\");\n break;\n case 0x0B:\n tmp += QLatin1String(\"\\\\v\");\n break;\n case 0x0C:\n tmp += QLatin1String(\"\\\\f\");\n break;\n case 0x0D:\n tmp += QLatin1String(\"\\\\r\");\n break;\n case 0x22:\n tmp += QLatin1String(\"\\\\\\\"\");\n break;\n case 0x27:\n tmp += QLatin1String(\"\\\\\\'\");\n break;\n case 0x5C:\n tmp += QLatin1String(\"\\\\\\\\\");\n break;\n default:\n tmp += c;\n break;\n }\n }\n tmp += QLatin1Char('\\\"');\n return tmp;\n}\n\nQString Binding::valueAsScriptString(const Unit *unit) const\n{\n if (type == Type_String)\n return escapedString(unit->stringAt(stringIndex));\n else\n return valueAsString(unit);\n}\n\n}\n\n}\n\nQT_END_NAMESPACE\n<|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 \"PreviewImageProvider.h\"\n\n#include <kiconloader.h>\n#include <kio\/previewjob.h>\n\n#include <QCoreApplication>\n#include <QDir>\n#include <QIcon>\n#include <QMimeDatabase>\n#include <QThreadPool>\n#include <QDebug>\n\nclass PreviewImageProvider::Private\n{\npublic:\n Private() {};\n};\n\nPreviewImageProvider::PreviewImageProvider()\n : QQuickAsyncImageProvider()\n , d(new Private)\n{\n qRegisterMetaType<KFileItem>(\"KFileItem\");\n}\n\nPreviewImageProvider::~PreviewImageProvider()\n{\n delete d;\n}\n\nclass PreviewResponse : public QQuickImageResponse\n{\n public:\n PreviewResponse(const QString &id, const QSize &requestedSize)\n {\n m_runnable = new PreviewRunnable(id, requestedSize);\n m_runnable->setAutoDelete(false);\n connect(m_runnable, &PreviewRunnable::done, this, &PreviewResponse::handleDone, Qt::QueuedConnection);\n QThreadPool::globalInstance()->start(m_runnable);\n }\n virtual ~PreviewResponse()\n {\n m_runnable->deleteLater();\n }\n\n void handleDone(QImage image) {\n m_image = image;\n emit finished();\n }\n\n QQuickTextureFactory *textureFactory() const override\n {\n return QQuickTextureFactory::textureFactoryForImage(m_image);\n }\n\n void cancel() override\n {\n m_runnable->abort();\n }\n\n PreviewRunnable* m_runnable{nullptr};\n QImage m_image;\n};\n\nQQuickImageResponse * PreviewImageProvider::requestImageResponse(const QString& id, const QSize& requestedSize)\n{\n PreviewResponse* response = new PreviewResponse(id, requestedSize);\n return response;\n}\n\nclass PreviewRunnable::Private {\npublic:\n Private() {}\n QString id;\n QSize requestedSize;\n\n bool abort{false};\n\n QImage preview;\n bool jobCompletion{false};\n KIO::PreviewJob* job{nullptr};\n};\n\nPreviewRunnable::PreviewRunnable(const QString& id, const QSize& requestedSize)\n : d(new Private)\n{\n d->id = id;\n d->requestedSize = requestedSize;\n}\n\nvoid PreviewRunnable::run()\n{\n QImage image;\n\n QSize ourSize(KIconLoader::SizeEnormous, KIconLoader::SizeEnormous);\n if(d->requestedSize.width() > 0 && d->requestedSize.height() > 0)\n {\n ourSize = d->requestedSize;\n }\n\n if(QFile(d->id).exists())\n {\n QMimeDatabase db;\n QList<QMimeType> mimetypes = db.mimeTypesForFileName(d->id);\n QString mimetype;\n if(mimetypes.count() > 0)\n {\n mimetype = mimetypes.first().name();\n }\n\n if(!d->abort) {\n static QStringList allPlugins{KIO::PreviewJob::availablePlugins()};\n d->job = new KIO::PreviewJob(KFileItemList() << KFileItem(QUrl::fromLocalFile(d->id), mimetype, 0), ourSize, &allPlugins);\n d->job->setIgnoreMaximumSize(true);\n d->job->setScaleType(KIO::PreviewJob::ScaledAndCached);\n connect(d->job, &KIO::PreviewJob::gotPreview, this, &PreviewRunnable::updatePreview);\n connect(d->job, &KIO::PreviewJob::failed, this, &PreviewRunnable::fallbackPreview);\n connect(d->job, &KIO::PreviewJob::finished, this, &PreviewRunnable::finishedPreview);\n\n d->jobCompletion = false;\n if(d->job->exec())\n {\n \/\/ Do not access the job after this point! As we are requesting that\n \/\/ it be deleted in finishedPreview(), don't expect it to be around.\n while(!d->jobCompletion) {\n \/\/ Let's let the job do its thing and whatnot...\n qApp->processEvents();\n }\n if(!d->preview.isNull())\n {\n if(d->requestedSize.width() > 0 && d->requestedSize.height() > 0)\n {\n image = d->preview.scaled(d->requestedSize, Qt::KeepAspectRatio, Qt::SmoothTransformation);\n }\n else\n {\n image = d->preview;\n }\n }\n }\n }\n }\n else\n {\n image = QImage(ourSize, QImage::Format_ARGB32);\n }\n\n Q_EMIT done(image);\n}\n\nvoid PreviewRunnable::abort()\n{\n if (d->job) {\n d->abort = true;\n d->job->kill();\n }\n}\n\nvoid PreviewRunnable::fallbackPreview(const KFileItem& item)\n{\n KIO::PreviewJob* previewJob = qobject_cast<KIO::PreviewJob*>(sender());\n if(previewJob)\n {\n QMimeDatabase db;\n QImage preview = QIcon::fromTheme(db.mimeTypeForName(item.mimetype()).iconName()).pixmap(d->requestedSize).toImage();\n d->preview = preview;\n d->jobCompletion = true;\n }\n}\n\nvoid PreviewRunnable::updatePreview(const KFileItem&, const QPixmap& p)\n{\n KIO::PreviewJob* previewJob = qobject_cast<KIO::PreviewJob*>(sender());\n if(previewJob)\n {\n d->preview = p.toImage();\n }\n}\n\nvoid PreviewRunnable::finishedPreview(KJob* \/*job*\/)\n{\n d->jobCompletion = true;\n}\n<commit_msg>Short-stop preview jobs at 1.5s, so we don't wait forever<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 \"PreviewImageProvider.h\"\n\n#include <kiconloader.h>\n#include <kio\/previewjob.h>\n\n#include <QCoreApplication>\n#include <QDir>\n#include <QIcon>\n#include <QMimeDatabase>\n#include <QThreadPool>\n#include <QDebug>\n\nclass PreviewImageProvider::Private\n{\npublic:\n Private() {};\n};\n\nPreviewImageProvider::PreviewImageProvider()\n : QQuickAsyncImageProvider()\n , d(new Private)\n{\n qRegisterMetaType<KFileItem>(\"KFileItem\");\n}\n\nPreviewImageProvider::~PreviewImageProvider()\n{\n delete d;\n}\n\nclass PreviewResponse : public QQuickImageResponse\n{\n public:\n PreviewResponse(const QString &id, const QSize &requestedSize)\n {\n m_runnable = new PreviewRunnable(id, requestedSize);\n m_runnable->setAutoDelete(false);\n connect(m_runnable, &PreviewRunnable::done, this, &PreviewResponse::handleDone, Qt::QueuedConnection);\n QThreadPool::globalInstance()->start(m_runnable);\n }\n virtual ~PreviewResponse()\n {\n m_runnable->deleteLater();\n }\n\n void handleDone(QImage image) {\n m_image = image;\n emit finished();\n }\n\n QQuickTextureFactory *textureFactory() const override\n {\n return QQuickTextureFactory::textureFactoryForImage(m_image);\n }\n\n void cancel() override\n {\n m_runnable->abort();\n }\n\n PreviewRunnable* m_runnable{nullptr};\n QImage m_image;\n};\n\nQQuickImageResponse * PreviewImageProvider::requestImageResponse(const QString& id, const QSize& requestedSize)\n{\n PreviewResponse* response = new PreviewResponse(id, requestedSize);\n return response;\n}\n\nclass PreviewRunnable::Private {\npublic:\n Private() {}\n QString id;\n QSize requestedSize;\n\n bool abort{false};\n\n QImage preview;\n bool jobCompletion{false};\n KIO::PreviewJob* job{nullptr};\n};\n\nPreviewRunnable::PreviewRunnable(const QString& id, const QSize& requestedSize)\n : d(new Private)\n{\n d->id = id;\n d->requestedSize = requestedSize;\n}\n\nvoid PreviewRunnable::run()\n{\n QImage image;\n\n QSize ourSize(KIconLoader::SizeEnormous, KIconLoader::SizeEnormous);\n if(d->requestedSize.width() > 0 && d->requestedSize.height() > 0)\n {\n ourSize = d->requestedSize;\n }\n\n if(QFile(d->id).exists())\n {\n QMimeDatabase db;\n QList<QMimeType> mimetypes = db.mimeTypesForFileName(d->id);\n QString mimetype;\n if(mimetypes.count() > 0)\n {\n mimetype = mimetypes.first().name();\n }\n\n if(!d->abort) {\n static QStringList allPlugins{KIO::PreviewJob::availablePlugins()};\n d->job = new KIO::PreviewJob(KFileItemList() << KFileItem(QUrl::fromLocalFile(d->id), mimetype, 0), ourSize, &allPlugins);\n d->job->setIgnoreMaximumSize(true);\n d->job->setScaleType(KIO::PreviewJob::ScaledAndCached);\n connect(d->job, &KIO::PreviewJob::gotPreview, this, &PreviewRunnable::updatePreview);\n connect(d->job, &KIO::PreviewJob::failed, this, &PreviewRunnable::fallbackPreview);\n connect(d->job, &KIO::PreviewJob::finished, this, &PreviewRunnable::finishedPreview);\n\n d->jobCompletion = false;\n QElapsedTimer breaker;\n breaker.start();\n if(d->job->exec())\n {\n \/\/ Do not access the job after this point! As we are requesting that\n \/\/ it be deleted in finishedPreview(), don't expect it to be around.\n while(!d->jobCompletion) {\n \/\/ Let's let the job do its thing and whatnot...\n qApp->processEvents(QEventLoop::WaitForMoreEvents, 100);\n \/\/ This is not the prettiest thing ever, but let's not wait too long for previews...\n \/\/ Short-stop the process at 1.5 seconds\n if (breaker.elapsed() == 1500) {\n d->job->deleteLater();\n qDebug() << \"Not awesome, this is taking way too long\" << d->id;\n break;\n }\n }\n if(!d->preview.isNull())\n {\n if(d->requestedSize.width() > 0 && d->requestedSize.height() > 0)\n {\n image = d->preview.scaled(d->requestedSize, Qt::KeepAspectRatio, Qt::SmoothTransformation);\n }\n else\n {\n image = d->preview;\n }\n }\n }\n }\n }\n else\n {\n image = QImage(ourSize, QImage::Format_ARGB32);\n }\n\n Q_EMIT done(image);\n}\n\nvoid PreviewRunnable::abort()\n{\n if (d->job) {\n d->abort = true;\n d->job->kill();\n }\n}\n\nvoid PreviewRunnable::fallbackPreview(const KFileItem& item)\n{\n KIO::PreviewJob* previewJob = qobject_cast<KIO::PreviewJob*>(sender());\n if(previewJob)\n {\n QMimeDatabase db;\n QImage preview = QIcon::fromTheme(db.mimeTypeForName(item.mimetype()).iconName()).pixmap(d->requestedSize).toImage();\n d->preview = preview;\n d->jobCompletion = true;\n }\n}\n\nvoid PreviewRunnable::updatePreview(const KFileItem&, const QPixmap& p)\n{\n KIO::PreviewJob* previewJob = qobject_cast<KIO::PreviewJob*>(sender());\n if(previewJob)\n {\n d->preview = p.toImage();\n }\n}\n\nvoid PreviewRunnable::finishedPreview(KJob* \/*job*\/)\n{\n d->jobCompletion = true;\n}\n<|endoftext|>"} {"text":"<commit_before><commit_msg>Increased the default stack size for the threads<commit_after><|endoftext|>"} {"text":"<commit_before>\/*\n Copyright 2011 Brain Research Institute, Melbourne, Australia\n\n Written by Robert E. Smith, 2011.\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\n#include \"dwi\/tractography\/mapping\/mapper.h\"\n\n\nnamespace MR {\nnamespace DWI {\nnamespace Tractography {\nnamespace Mapping {\n\n\n\n\ntemplate <>\nvoid TrackMapperBase<SetVoxel>::voxelise (const std::vector< Point<float> >& tck, SetVoxel& voxels) const\n{\n\n Voxel vox;\n for (std::vector< Point<float> >::const_iterator i = tck.begin(); i != tck.end(); ++i) {\n vox = round (interp_out.scanner2voxel (*i));\n if (check (vox, H_out))\n voxels.insert (vox);\n }\n\n}\n\n\ntemplate <>\nvoid TrackMapperTWI<SetVoxel>::voxelise (const std::vector< Point<float> >& tck, SetVoxel& voxels) const\n{\n\n if (contrast == ENDPOINT) {\n\n Voxel vox = round (interp_out.scanner2voxel (tck.front()));\n if (check (vox, H_out))\n voxels.insert (vox);\n\n vox = round (interp_out.scanner2voxel (tck.back()));\n if (check (vox, H_out))\n voxels.insert (vox);\n\n } else {\n\n TrackMapperBase<SetVoxel>::voxelise (tck, voxels);\n\n }\n\n}\n\n\n\ntemplate <>\nvoid TrackMapperBase<SetVoxelDEC>::voxelise (const std::vector< Point<float> >& tck, SetVoxelDEC& voxels) const\n{\n\n std::vector< Point<float> >::const_iterator prev = tck.begin();\n const std::vector< Point<float> >::const_iterator last = tck.end() - 1;\n\n VoxelDEC vox;\n for (std::vector< Point<float> >::const_iterator i = tck.begin(); i != last; ++i) {\n vox = round (interp_out.scanner2voxel (*i));\n if (check (vox, H_out)) {\n SetVoxelDEC::iterator existing_vox = voxels.find (vox);\n if (existing_vox == voxels.end()) {\n vox.set_dir (*(i+1) - *prev);\n voxels.insert (vox);\n } else {\n existing_vox->add_dir (*(i+1) - *prev);\n }\n }\n prev = i;\n }\n\n vox = round (interp_out.scanner2voxel (*last));\n if (check (vox, H_out)) {\n SetVoxelDEC::iterator existing_vox = voxels.find (vox);\n if (existing_vox == voxels.end()) {\n vox.add_dir (*last - *prev);\n voxels.insert (vox);\n } else {\n existing_vox->add_dir (*last - *prev);\n }\n }\n\n for (SetVoxelDEC::iterator i = voxels.begin(); i != voxels.end(); ++i)\n i->norm_dir();\n\n}\n\n\ntemplate <>\nvoid TrackMapperTWI<SetVoxelDEC>::voxelise (const std::vector< Point<float> >& tck, SetVoxelDEC& voxels) const\n{\n\n if (contrast == ENDPOINT) {\n\n VoxelDEC vox = round (interp_out.scanner2voxel (tck.front()));\n if (check (vox, H_out)) {\n vox.add_dir (tck[0] - tck[1]);\n voxels.insert (vox);\n }\n\n vox = round (interp_out.scanner2voxel (tck.back()));\n if (check (vox, H_out)) {\n vox.add_dir (tck[tck.size() - 1] - tck[tck.size() - 2]);\n voxels.insert (vox);\n }\n\n } else {\n\n TrackMapperBase<SetVoxelDEC>::voxelise (tck, voxels);\n\n }\n\n}\n\n\n\ntemplate <>\nvoid TrackMapperBase<SetVoxelDir>::voxelise (const std::vector< Point<float> >& tck, SetVoxelDir& voxels) const\n{\n\n typedef Point<float> PointF;\n\n static const float accuracy = Math::pow2 (0.005 * maxvalue (H_out.vox (0), H_out.vox (1), H_out.vox (2)));\n\n Math::Hermite<float> hermite (0.1);\n\n const PointF start_vector_offset = (tck.size() > 2) ? ((tck.front() - tck[1]) - (tck[1] - tck[2])) : PointF (0.0, 0.0, 0.0);\n const PointF start_vector = (tck.front() - tck[1]) + start_vector_offset;\n const PointF tck_proj_front = tck.front() + start_vector;\n\n const unsigned int last_point = tck.size() - 1;\n\n const PointF end_vector_offset = (tck.size() > 2) ? ((tck[last_point] - tck[last_point - 1]) - (tck[last_point - 1] - tck[last_point - 2])) : PointF (0.0, 0.0, 0.0);\n const PointF end_vector = (tck[last_point] - tck[last_point - 1]) + end_vector_offset;\n const PointF tck_proj_back = tck.back() + end_vector;\n\n unsigned int p = 0;\n PointF p_end = tck.front();\n float mu = 0.0;\n bool end_track = false;\n Voxel next_voxel (round (interp_out.scanner2voxel (tck.front())));\n\n while (!end_track) {\n\n const PointF p_start (p_end);\n\n const Voxel this_voxel = next_voxel;\n\n while ((p != tck.size()) && (round (interp_out.scanner2voxel (tck[p])) == this_voxel)) {\n ++p;\n mu = 0.0;\n }\n\n if (p == tck.size()) {\n p_end = tck.back();\n end_track = true;\n } else {\n\n float mu_min = mu;\n float mu_max = 1.0;\n Voxel mu_voxel = this_voxel;\n\n PointF p_mu = tck[p];\n\n do {\n\n p_end = p_mu;\n\n mu = 0.5 * (mu_min + mu_max);\n const PointF* p_one = (p == 1) ? &tck_proj_front : &tck[p - 2];\n const PointF* p_four = (p == tck.size() - 1) ? &tck_proj_back : &tck[p + 1];\n\n hermite.set (mu);\n p_mu = hermite.value (*p_one, tck[p - 1], tck[p], *p_four);\n\n mu_voxel = round (interp_out.scanner2voxel (p_mu));\n if (mu_voxel == this_voxel) {\n mu_min = mu;\n } else {\n mu_max = mu;\n next_voxel = mu_voxel;\n }\n\n } while (dist2 (p_mu, p_end) > accuracy);\n\n }\n\n const PointF traversal_vector (p_end - p_start);\n if (traversal_vector.norm2()) {\n SetVoxelDir::iterator existing_vox = voxels.find (this_voxel);\n if (existing_vox == voxels.end()) {\n VoxelDir voxel_dir (this_voxel);\n voxel_dir.add_dir (traversal_vector);\n voxels.insert (voxel_dir);\n } else {\n existing_vox->add_dir (traversal_vector);\n }\n }\n\n }\n\n}\n\n\n\ntemplate <>\nvoid TrackMapperTWI<SetVoxelFactor>::voxelise (const std::vector< Point<float> >& tck, SetVoxelFactor& voxels) const\n{\n\n VoxelFactor vox;\n for (size_t i = 0; i != tck.size(); ++i) {\n vox = round (interp_out.scanner2voxel (tck[i]));\n if (check (vox, H_out)) {\n\n \/\/ Get a linearly-interpolated value from factors[] based upon factors[] being\n \/\/ generated with non-interpolated data, and index 'i' here representing interpolated data\n const float ideal_index = float(i) \/ float(os_factor);\n const size_t lower_index = MAX(floor (ideal_index), 0);\n const size_t upper_index = MIN(ceil (ideal_index), tck.size() - 1);\n const float mu = ideal_index - lower_index;\n const float factor = (mu * factors[upper_index]) + ((1.0 - mu) * factors[lower_index]);\n\n \/\/ Change here from base classes: need to explicitly check whether this voxel has been visited\n SetVoxelFactor::iterator v = voxels.find (vox);\n if (v == voxels.end()) {\n vox.set_factor (factor);\n voxels.insert (vox);\n } else {\n vox = *v;\n vox.add_contribution (factor);\n voxels.erase (v);\n voxels.insert (vox);\n }\n\n }\n }\n\n}\n\n\n\ntemplate <>\nvoid TrackMapperTWI<SetVoxelDECFactor>::voxelise (const std::vector< Point<float> >& tck, SetVoxelDECFactor& voxels) const\n{\n\n Point<float> prev = tck.front();\n const Point<float>& last = tck[tck.size() - 1];\n\n VoxelDECFactor vox;\n for (unsigned int i = 0; i != tck.size() - 1; ++i) {\n vox = round (interp_out.scanner2voxel (tck[i]));\n if (check (vox, H_out)) {\n\n const float ideal_index = float(i) \/ float(os_factor);\n const size_t lower_index = MAX(floor (ideal_index), 0);\n const size_t upper_index = MIN(ceil (ideal_index), tck.size() - 1);\n const float mu = ideal_index - lower_index;\n const float factor = (mu * factors[upper_index]) + ((1.0 - mu) * factors[lower_index]);\n\n SetVoxelDECFactor::iterator existing_vox = voxels.find (vox);\n if (existing_vox == voxels.end()) {\n vox.set_factor (factor);\n vox.add_dir (tck[i+1] - prev);\n voxels.insert (vox);\n } else {\n existing_vox->add_dir (tck[i+1] - prev);\n existing_vox->add_contribution (factor);\n }\n }\n prev = tck[i];\n }\n\n vox = round (interp_out.scanner2voxel (last));\n if (check (vox, H_out)) {\n\n const float ideal_index = float(tck.size() - 1) \/ float(os_factor);\n const size_t lower_index = MAX(floor (ideal_index), 0);\n const size_t upper_index = MIN(ceil (ideal_index), tck.size() - 1);\n const float mu = ideal_index - lower_index;\n const float factor = (mu * factors[upper_index]) + ((1.0 - mu) * factors[lower_index]);\n\n SetVoxelDECFactor::iterator existing_vox = voxels.find (vox);\n if (existing_vox == voxels.end()) {\n vox.add_dir (last - prev);\n vox.set_factor (factor);\n voxels.insert (vox);\n } else {\n existing_vox->add_dir (last - prev);\n existing_vox->add_contribution (factor);\n }\n }\n\n for (SetVoxelDECFactor::iterator i = voxels.begin(); i != voxels.end(); ++i)\n i->norm_dir();\n\n}\n\n\n\n\n\n}\n}\n}\n}\n\n\n\n\n<commit_msg>A little more cleanup of the DECTDI bug from the previous revision<commit_after>\/*\n Copyright 2011 Brain Research Institute, Melbourne, Australia\n\n Written by Robert E. Smith, 2011.\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\n#include \"dwi\/tractography\/mapping\/mapper.h\"\n\n\nnamespace MR {\nnamespace DWI {\nnamespace Tractography {\nnamespace Mapping {\n\n\n\n\ntemplate <>\nvoid TrackMapperBase<SetVoxel>::voxelise (const std::vector< Point<float> >& tck, SetVoxel& voxels) const\n{\n\n Voxel vox;\n for (std::vector< Point<float> >::const_iterator i = tck.begin(); i != tck.end(); ++i) {\n vox = round (interp_out.scanner2voxel (*i));\n if (check (vox, H_out))\n voxels.insert (vox);\n }\n\n}\n\n\ntemplate <>\nvoid TrackMapperTWI<SetVoxel>::voxelise (const std::vector< Point<float> >& tck, SetVoxel& voxels) const\n{\n\n if (contrast == ENDPOINT) {\n\n Voxel vox = round (interp_out.scanner2voxel (tck.front()));\n if (check (vox, H_out))\n voxels.insert (vox);\n\n vox = round (interp_out.scanner2voxel (tck.back()));\n if (check (vox, H_out))\n voxels.insert (vox);\n\n } else {\n\n TrackMapperBase<SetVoxel>::voxelise (tck, voxels);\n\n }\n\n}\n\n\n\ntemplate <>\nvoid TrackMapperBase<SetVoxelDEC>::voxelise (const std::vector< Point<float> >& tck, SetVoxelDEC& voxels) const\n{\n\n std::vector< Point<float> >::const_iterator prev = tck.begin();\n const std::vector< Point<float> >::const_iterator last = tck.end() - 1;\n\n VoxelDEC vox;\n for (std::vector< Point<float> >::const_iterator i = tck.begin(); i != last; ++i) {\n vox = round (interp_out.scanner2voxel (*i));\n if (check (vox, H_out)) {\n SetVoxelDEC::iterator existing_vox = voxels.find (vox);\n if (existing_vox == voxels.end()) {\n vox.set_dir (*(i+1) - *prev);\n voxels.insert (vox);\n } else {\n existing_vox->add_dir (*(i+1) - *prev);\n }\n }\n prev = i;\n }\n\n vox = round (interp_out.scanner2voxel (*last));\n if (check (vox, H_out)) {\n SetVoxelDEC::iterator existing_vox = voxels.find (vox);\n if (existing_vox == voxels.end()) {\n vox.set_dir (*last - *prev);\n voxels.insert (vox);\n } else {\n existing_vox->add_dir (*last - *prev);\n }\n }\n\n for (SetVoxelDEC::iterator i = voxels.begin(); i != voxels.end(); ++i)\n i->norm_dir();\n\n}\n\n\ntemplate <>\nvoid TrackMapperTWI<SetVoxelDEC>::voxelise (const std::vector< Point<float> >& tck, SetVoxelDEC& voxels) const\n{\n\n if (contrast == ENDPOINT) {\n\n VoxelDEC vox = round (interp_out.scanner2voxel (tck.front()));\n if (check (vox, H_out)) {\n vox.set_dir (tck[0] - tck[1]);\n voxels.insert (vox);\n }\n\n vox = round (interp_out.scanner2voxel (tck.back()));\n if (check (vox, H_out)) {\n vox.set_dir (tck[tck.size() - 1] - tck[tck.size() - 2]);\n voxels.insert (vox);\n }\n\n } else {\n\n TrackMapperBase<SetVoxelDEC>::voxelise (tck, voxels);\n\n }\n\n}\n\n\n\ntemplate <>\nvoid TrackMapperBase<SetVoxelDir>::voxelise (const std::vector< Point<float> >& tck, SetVoxelDir& voxels) const\n{\n\n typedef Point<float> PointF;\n\n static const float accuracy = Math::pow2 (0.005 * maxvalue (H_out.vox (0), H_out.vox (1), H_out.vox (2)));\n\n Math::Hermite<float> hermite (0.1);\n\n const PointF start_vector_offset = (tck.size() > 2) ? ((tck.front() - tck[1]) - (tck[1] - tck[2])) : PointF (0.0, 0.0, 0.0);\n const PointF start_vector = (tck.front() - tck[1]) + start_vector_offset;\n const PointF tck_proj_front = tck.front() + start_vector;\n\n const unsigned int last_point = tck.size() - 1;\n\n const PointF end_vector_offset = (tck.size() > 2) ? ((tck[last_point] - tck[last_point - 1]) - (tck[last_point - 1] - tck[last_point - 2])) : PointF (0.0, 0.0, 0.0);\n const PointF end_vector = (tck[last_point] - tck[last_point - 1]) + end_vector_offset;\n const PointF tck_proj_back = tck.back() + end_vector;\n\n unsigned int p = 0;\n PointF p_end = tck.front();\n float mu = 0.0;\n bool end_track = false;\n Voxel next_voxel (round (interp_out.scanner2voxel (tck.front())));\n\n while (!end_track) {\n\n const PointF p_start (p_end);\n\n const Voxel this_voxel = next_voxel;\n\n while ((p != tck.size()) && (round (interp_out.scanner2voxel (tck[p])) == this_voxel)) {\n ++p;\n mu = 0.0;\n }\n\n if (p == tck.size()) {\n p_end = tck.back();\n end_track = true;\n } else {\n\n float mu_min = mu;\n float mu_max = 1.0;\n Voxel mu_voxel = this_voxel;\n\n PointF p_mu = tck[p];\n\n do {\n\n p_end = p_mu;\n\n mu = 0.5 * (mu_min + mu_max);\n const PointF* p_one = (p == 1) ? &tck_proj_front : &tck[p - 2];\n const PointF* p_four = (p == tck.size() - 1) ? &tck_proj_back : &tck[p + 1];\n\n hermite.set (mu);\n p_mu = hermite.value (*p_one, tck[p - 1], tck[p], *p_four);\n\n mu_voxel = round (interp_out.scanner2voxel (p_mu));\n if (mu_voxel == this_voxel) {\n mu_min = mu;\n } else {\n mu_max = mu;\n next_voxel = mu_voxel;\n }\n\n } while (dist2 (p_mu, p_end) > accuracy);\n\n }\n\n const PointF traversal_vector (p_end - p_start);\n if (traversal_vector.norm2()) {\n SetVoxelDir::iterator existing_vox = voxels.find (this_voxel);\n if (existing_vox == voxels.end()) {\n VoxelDir voxel_dir (this_voxel);\n voxel_dir.add_dir (traversal_vector);\n voxels.insert (voxel_dir);\n } else {\n existing_vox->add_dir (traversal_vector);\n }\n }\n\n }\n\n}\n\n\n\ntemplate <>\nvoid TrackMapperTWI<SetVoxelFactor>::voxelise (const std::vector< Point<float> >& tck, SetVoxelFactor& voxels) const\n{\n\n VoxelFactor vox;\n for (size_t i = 0; i != tck.size(); ++i) {\n vox = round (interp_out.scanner2voxel (tck[i]));\n if (check (vox, H_out)) {\n\n \/\/ Get a linearly-interpolated value from factors[] based upon factors[] being\n \/\/ generated with non-interpolated data, and index 'i' here representing interpolated data\n const float ideal_index = float(i) \/ float(os_factor);\n const size_t lower_index = MAX(floor (ideal_index), 0);\n const size_t upper_index = MIN(ceil (ideal_index), tck.size() - 1);\n const float mu = ideal_index - lower_index;\n const float factor = (mu * factors[upper_index]) + ((1.0 - mu) * factors[lower_index]);\n\n \/\/ Change here from base classes: need to explicitly check whether this voxel has been visited\n SetVoxelFactor::iterator v = voxels.find (vox);\n if (v == voxels.end()) {\n vox.set_factor (factor);\n voxels.insert (vox);\n } else {\n vox = *v;\n vox.add_contribution (factor);\n voxels.erase (v);\n voxels.insert (vox);\n }\n\n }\n }\n\n}\n\n\n\ntemplate <>\nvoid TrackMapperTWI<SetVoxelDECFactor>::voxelise (const std::vector< Point<float> >& tck, SetVoxelDECFactor& voxels) const\n{\n\n Point<float> prev = tck.front();\n const Point<float>& last = tck[tck.size() - 1];\n\n VoxelDECFactor vox;\n for (unsigned int i = 0; i != tck.size() - 1; ++i) {\n vox = round (interp_out.scanner2voxel (tck[i]));\n if (check (vox, H_out)) {\n\n const float ideal_index = float(i) \/ float(os_factor);\n const size_t lower_index = MAX(floor (ideal_index), 0);\n const size_t upper_index = MIN(ceil (ideal_index), tck.size() - 1);\n const float mu = ideal_index - lower_index;\n const float factor = (mu * factors[upper_index]) + ((1.0 - mu) * factors[lower_index]);\n\n SetVoxelDECFactor::iterator existing_vox = voxels.find (vox);\n if (existing_vox == voxels.end()) {\n vox.set_factor (factor);\n vox.set_dir (tck[i+1] - prev);\n voxels.insert (vox);\n } else {\n existing_vox->add_dir (tck[i+1] - prev);\n existing_vox->add_contribution (factor);\n }\n }\n prev = tck[i];\n }\n\n vox = round (interp_out.scanner2voxel (last));\n if (check (vox, H_out)) {\n\n const float ideal_index = float(tck.size() - 1) \/ float(os_factor);\n const size_t lower_index = MAX(floor (ideal_index), 0);\n const size_t upper_index = MIN(ceil (ideal_index), tck.size() - 1);\n const float mu = ideal_index - lower_index;\n const float factor = (mu * factors[upper_index]) + ((1.0 - mu) * factors[lower_index]);\n\n SetVoxelDECFactor::iterator existing_vox = voxels.find (vox);\n if (existing_vox == voxels.end()) {\n vox.set_dir (last - prev);\n vox.set_factor (factor);\n voxels.insert (vox);\n } else {\n existing_vox->add_dir (last - prev);\n existing_vox->add_contribution (factor);\n }\n }\n\n for (SetVoxelDECFactor::iterator i = voxels.begin(); i != voxels.end(); ++i)\n i->norm_dir();\n\n}\n\n\n\n\n\n}\n}\n}\n}\n\n\n\n\n<|endoftext|>"} {"text":"<commit_before>\/\/ Copyright (c) Microsoft Corporation. All rights reserved.\n\/\/ Licensed under the MIT License.\n\n#include \"mlas.h\"\n#include \"bench_util.h\"\n#include \"core\/util\/thread_utils.h\"\n\n#include <stdexcept>\n#include <memory>\n#include <numeric>\n#include <algorithm>\n\nstatic const std::vector<std::string> qgemm_arg_names = {\"M\", \"N\", \"K\", \"Batch\", \"Threads\"};\n\nvoid SYMMQGEMM(benchmark::State& state, bool a_signed) {\n const int8_t a_zero_point = 29;\n\n if (state.range(0) <= 0) throw std::invalid_argument(\"M must greater than 0!\");\n if (state.range(1) <= 0) throw std::invalid_argument(\"N must greater than 0!\");\n if (state.range(2) <= 0) throw std::invalid_argument(\"K must greater than 0!\");\n if (state.range(3) <= 0) throw std::invalid_argument(\"Batch must greater than 0!\");\n if (state.range(4) <= 0) throw std::invalid_argument(\"Threads must greater than 0!\");\n\n const size_t M = static_cast<size_t>(state.range(0));\n const size_t N = static_cast<size_t>(state.range(1));\n const size_t K = static_cast<size_t>(state.range(2));\n\n const size_t batch = static_cast<size_t>(state.range(3));\n const size_t threads = static_cast<size_t>(state.range(4));\n \n OrtThreadPoolParams tpo;\n tpo.thread_pool_size = int(threads);\n tpo.auto_set_affinity = true;\n std::unique_ptr<onnxruntime::concurrency::ThreadPool> tp(\n onnxruntime::concurrency::CreateThreadPool(&onnxruntime::Env::Default(),\n tpo, onnxruntime::concurrency::ThreadPoolType::INTRA_OP));\n\n auto A_holder = RandomVectorUniform<int8_t>(static_cast<size_t>(M * K * batch) + 16, int8_t(-120), int8_t(120));\n auto B_holder = RandomVectorUniform<int8_t>(static_cast<size_t>(N * K * batch), int8_t(-122), int8_t(122));\n std::vector<int32_t> C_holder(static_cast<size_t>(M * N * batch));\n std::vector<uint8_t> pack_b_holder;\n\n size_t packed_b_size = MlasGemmPackBSize(N, K, a_signed, true);\n pack_b_holder.resize(packed_b_size * batch);\n\n MLAS_GEMM_QUANT_SHAPE_PARAMS gemm_shape;\n\n gemm_shape.M = static_cast<size_t>(M);\n gemm_shape.N = static_cast<size_t>(N);\n gemm_shape.K = static_cast<size_t>(K);\n gemm_shape.AIsSigned = true;\n gemm_shape.BIsSigned = true;\n\n std::vector<MLAS_SYMM_QGEMM_DATA_PARAMS> gemm_data_vec(batch);\n for (size_t i = 0; i < batch; i++) {\n auto& gemm_params = gemm_data_vec[i];\n gemm_params.lda = gemm_shape.K;\n gemm_params.ldc = gemm_shape.N;\n gemm_params.A = A_holder.data() + M * K * i;\n gemm_params.C = C_holder.data() + M * N * i;\n\n MlasSymmQgemmPackB(N, K, (const int8_t*)gemm_params.B, N, a_signed, a_zero_point, (void*)(pack_b_holder.data() + packed_b_size * i));\n gemm_params.B = (void*)(pack_b_holder.data() + packed_b_size * i);\n }\n for (auto _ : state) {\n MlasSymmQgemmBatch(gemm_shape, gemm_data_vec.data(), batch, tp.get());\n }\n}\n\nstatic void SymmQGemmSize(benchmark::internal::Benchmark* b) {\n b->ArgNames(qgemm_arg_names);\n \/\/ Args for \"M\", \"N\", \"K\", \"Batch\",\n\n b->Args({512, 32128, 768, 1, 1});\n b->Args({512, 32128, 768, 1, 4});\n b->Args({512, 32128, 768, 1, 6});\n\n b->Args({512, 3072, 768, 1, 1});\n b->Args({512, 3072, 768, 1, 4});\n b->Args({512, 3072, 768, 1, 6});\n\n b->Args({512, 768, 3072, 1, 1});\n b->Args({512, 768, 3072, 1, 4});\n b->Args({512, 768, 3072, 1, 6});\n\n b->Args({512, 768, 768, 1, 1});\n b->Args({512, 768, 768, 1, 4});\n b->Args({512, 768, 768, 1, 6});\n\n b->Args({512, 64, 512, 1, 1});\n b->Args({512, 64, 512, 1, 4});\n b->Args({512, 64, 512, 1, 6});\n\n b->Args({512, 512, 64, 12, 1});\n b->Args({512, 512, 64, 12, 4});\n b->Args({512, 512, 64, 12, 6});\n\n b->Args({512, 64, 512, 12, 1});\n b->Args({512, 64, 512, 12, 4});\n b->Args({512, 64, 512, 12, 6});\n}\n\nBENCHMARK_CAPTURE(SYMMQGEMM, SignedActivation, true)->Apply(SymmQGemmSize)->UseRealTime();\n<commit_msg>Disable SYMMQGEMM benchmark for CPU other than ARM (#12739)<commit_after>\/\/ Copyright (c) Microsoft Corporation. All rights reserved.\n\/\/ Licensed under the MIT License.\n\n#include \"mlas.h\"\n#include \"bench_util.h\"\n#include \"core\/util\/thread_utils.h\"\n\n#include <stdexcept>\n#include <memory>\n#include <numeric>\n#include <algorithm>\n\nstatic const std::vector<std::string> qgemm_arg_names = {\"M\", \"N\", \"K\", \"Batch\", \"Threads\"};\n\nvoid SYMMQGEMM(benchmark::State& state, bool a_signed) {\n const int8_t a_zero_point = 29;\n\n if (state.range(0) <= 0) throw std::invalid_argument(\"M must greater than 0!\");\n if (state.range(1) <= 0) throw std::invalid_argument(\"N must greater than 0!\");\n if (state.range(2) <= 0) throw std::invalid_argument(\"K must greater than 0!\");\n if (state.range(3) <= 0) throw std::invalid_argument(\"Batch must greater than 0!\");\n if (state.range(4) <= 0) throw std::invalid_argument(\"Threads must greater than 0!\");\n\n const size_t M = static_cast<size_t>(state.range(0));\n const size_t N = static_cast<size_t>(state.range(1));\n const size_t K = static_cast<size_t>(state.range(2));\n\n const size_t batch = static_cast<size_t>(state.range(3));\n const size_t threads = static_cast<size_t>(state.range(4));\n\n OrtThreadPoolParams tpo;\n tpo.thread_pool_size = int(threads);\n tpo.auto_set_affinity = true;\n std::unique_ptr<onnxruntime::concurrency::ThreadPool> tp(\n onnxruntime::concurrency::CreateThreadPool(&onnxruntime::Env::Default(),\n tpo, onnxruntime::concurrency::ThreadPoolType::INTRA_OP));\n\n auto A_holder = RandomVectorUniform<int8_t>(static_cast<size_t>(M * K * batch) + 16, int8_t(-120), int8_t(120));\n auto B_holder = RandomVectorUniform<int8_t>(static_cast<size_t>(N * K * batch), int8_t(-122), int8_t(122));\n std::vector<int32_t> C_holder(static_cast<size_t>(M * N * batch));\n std::vector<uint8_t> pack_b_holder;\n\n size_t packed_b_size = MlasSymmQgemmPackBSize(N, K, a_signed);\n pack_b_holder.resize(packed_b_size * batch);\n\n MLAS_GEMM_QUANT_SHAPE_PARAMS gemm_shape;\n\n gemm_shape.M = static_cast<size_t>(M);\n gemm_shape.N = static_cast<size_t>(N);\n gemm_shape.K = static_cast<size_t>(K);\n gemm_shape.AIsSigned = true;\n gemm_shape.BIsSigned = true;\n\n std::vector<MLAS_SYMM_QGEMM_DATA_PARAMS> gemm_data_vec(batch);\n for (size_t i = 0; i < batch; i++) {\n auto& gemm_params = gemm_data_vec[i];\n gemm_params.lda = gemm_shape.K;\n gemm_params.ldc = gemm_shape.N;\n gemm_params.A = A_holder.data() + M * K * i;\n gemm_params.C = C_holder.data() + M * N * i;\n\n MlasSymmQgemmPackB(N, K, (const int8_t*)gemm_params.B, N, a_signed, a_zero_point, (void*)(pack_b_holder.data() + packed_b_size * i));\n gemm_params.B = (void*)(pack_b_holder.data() + packed_b_size * i);\n }\n for (auto _ : state) {\n MlasSymmQgemmBatch(gemm_shape, gemm_data_vec.data(), batch, tp.get());\n }\n}\n\n#if defined(MLAS_TARGET_ARM64)\nstatic void SymmQGemmSize(benchmark::internal::Benchmark* b) {\n b->ArgNames(qgemm_arg_names);\n \/\/ Args for \"M\", \"N\", \"K\", \"Batch\",\n\n b->Args({512, 32128, 768, 1, 1});\n b->Args({512, 32128, 768, 1, 4});\n b->Args({512, 32128, 768, 1, 6});\n\n b->Args({512, 3072, 768, 1, 1});\n b->Args({512, 3072, 768, 1, 4});\n b->Args({512, 3072, 768, 1, 6});\n\n b->Args({512, 768, 3072, 1, 1});\n b->Args({512, 768, 3072, 1, 4});\n b->Args({512, 768, 3072, 1, 6});\n\n b->Args({512, 768, 768, 1, 1});\n b->Args({512, 768, 768, 1, 4});\n b->Args({512, 768, 768, 1, 6});\n\n b->Args({512, 64, 512, 1, 1});\n b->Args({512, 64, 512, 1, 4});\n b->Args({512, 64, 512, 1, 6});\n\n b->Args({512, 512, 64, 12, 1});\n b->Args({512, 512, 64, 12, 4});\n b->Args({512, 512, 64, 12, 6});\n\n b->Args({512, 64, 512, 12, 1});\n b->Args({512, 64, 512, 12, 4});\n b->Args({512, 64, 512, 12, 6});\n}\n\nBENCHMARK_CAPTURE(SYMMQGEMM, SignedActivation, true)->Apply(SymmQGemmSize)->UseRealTime();\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: textcharacterproperties.cxx,v $\n * $Revision: 1.5 $\n *\n * This file is part of OpenOffice.org.\n *\n * OpenOffice.org is free software: you can redistribute it and\/or modify\n * it under the terms of the GNU Lesser General Public License version 3\n * only, as published by the Free Software Foundation.\n *\n * OpenOffice.org is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the\n * GNU Lesser General Public License version 3 for more details\n * (a copy is included in the LICENSE file that accompanied this code).\n *\n * You should have received a copy of the GNU Lesser General Public License\n * version 3 along with OpenOffice.org. If not, see\n * <http:\/\/www.openoffice.org\/license.html>\n * for a copy of the LGPLv3 License.\n *\n ************************************************************************\/\n\n#include \"oox\/drawingml\/textcharacterproperties.hxx\"\n\n#include \"oox\/helper\/propertyset.hxx\"\n#include \"oox\/core\/namespaces.hxx\"\n#include \"tokens.hxx\"\n\nusing rtl::OUString;\nusing namespace ::oox::core;\nusing namespace ::com::sun::star;\nusing namespace ::com::sun::star::uno;\nusing namespace ::com::sun::star::beans;\n\nnamespace oox { namespace drawingml {\n\nTextCharacterProperties::TextCharacterProperties()\n: maCharColorPtr( new Color() )\n, maUnderlineColorPtr( new Color() )\n, maHighlightColorPtr( new Color() )\n{\n}\nTextCharacterProperties::~TextCharacterProperties()\n{\n}\nvoid TextCharacterProperties::apply( const TextCharacterPropertiesPtr& rSourceTextCharacterPropertiesPtr )\n{\n maTextCharacterPropertyMap.insert( rSourceTextCharacterPropertiesPtr->maTextCharacterPropertyMap.begin(), rSourceTextCharacterPropertiesPtr->maTextCharacterPropertyMap.end() );\n maHyperlinkPropertyMap.insert( rSourceTextCharacterPropertiesPtr->maHyperlinkPropertyMap.begin(), rSourceTextCharacterPropertiesPtr->maHyperlinkPropertyMap.end() );\n ColorPtr rSourceCharColor( rSourceTextCharacterPropertiesPtr->getCharColor() );\n if ( rSourceCharColor->isUsed() )\n maCharColorPtr = rSourceCharColor;\n ColorPtr rSourceHighlightColor( rSourceTextCharacterPropertiesPtr->getHighlightColor() );\n if ( rSourceHighlightColor->isUsed() )\n maHighlightColorPtr = rSourceHighlightColor;\n ColorPtr rSourceUnderlineColor( rSourceTextCharacterPropertiesPtr->getUnderlineColor() );\n if ( rSourceUnderlineColor->isUsed() )\n maUnderlineColorPtr = rSourceUnderlineColor;\n Any& rHasUnderline = rSourceTextCharacterPropertiesPtr->getHasUnderline();\n if ( rHasUnderline.hasValue() )\n maHasUnderline = rHasUnderline;\n Any& rUnderlineLineFollowText = rSourceTextCharacterPropertiesPtr->getUnderlineLineFollowText();\n if ( rUnderlineLineFollowText.hasValue() )\n maUnderlineLineFollowText = rUnderlineLineFollowText;\n Any& rUnderlineFillFollowText = rSourceTextCharacterPropertiesPtr->getUnderlineFillFollowText();\n if ( rUnderlineFillFollowText.hasValue() )\n maUnderlineFillFollowText = rUnderlineFillFollowText;\n}\nvoid TextCharacterProperties::pushToPropSet( const ::oox::core::XmlFilterBase& rFilterBase, const Reference < XPropertySet > & xPropSet ) const\n{\n\/\/ maTextCharacterPropertyMap.dump_debug(\"TextCharacter props\");\n\n PropertySet aPropSet( xPropSet );\n aPropSet.setProperties( maTextCharacterPropertyMap );\n if ( maCharColorPtr->isUsed() )\n {\n const rtl::OUString sCharColor( CREATE_OUSTRING( \"CharColor\" ) );\n aPropSet.setProperty( sCharColor, maCharColorPtr->getColor( rFilterBase ) );\n }\n\n sal_Bool bHasUnderline = sal_False;\n sal_Bool bUnderlineFillFollowText = sal_False;\n maHasUnderline >>= bHasUnderline;\n maUnderlineFillFollowText >>= bUnderlineFillFollowText;\n if( bHasUnderline )\n {\n if( maUnderlineColorPtr.get() && !bUnderlineFillFollowText )\n {\n const rtl::OUString sCharUnderlineColor( CREATE_OUSTRING( \"CharUnderlineColor\" ) );\n aPropSet.setProperty( sCharUnderlineColor, maUnderlineColorPtr->getColor( rFilterBase ) );\n const rtl::OUString sCharUnderlineHasColor( CREATE_OUSTRING( \"CharUnderlineHasColor\" ) );\n aPropSet.setProperty( sCharUnderlineHasColor, Any( sal_True ) );\n }\n }\n}\n\nvoid TextCharacterProperties::pushToUrlFieldPropSet( const Reference < XPropertySet > & xPropSet ) const\n{\n PropertySet aPropSet( xPropSet );\n aPropSet.setProperties( maHyperlinkPropertyMap );\n}\n\nfloat TextCharacterProperties::getCharacterSize( float fDefault ) const\n{\n const rtl::OUString sCharHeight( CREATE_OUSTRING( \"CharHeight\" ) );\n float fCharHeight = 0;\n const Any* pAny = maTextCharacterPropertyMap.getPropertyValue( sCharHeight );\n if ( pAny && ( *pAny >>= fCharHeight ) )\n return fCharHeight;\n else\n return fDefault;\n}\n\n} }\n<commit_msg>INTEGRATION: CWS xmlfilter06 (1.5.6); FILE MERGED 2008\/06\/20 14:24:47 dr 1.5.6.3: resolve theme font names, e.g. '+mj-lt' or '+mn-ea' 2008\/06\/20 11:58:16 dr 1.5.6.2: line\/fill\/character properties rework; first steps of chart text formatting and rotation import; make line arrow import work 2008\/05\/27 10:40:35 dr 1.5.6.1: joined changes from CWS xmlfilter05<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: textcharacterproperties.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#include \"oox\/drawingml\/textcharacterproperties.hxx\"\n#include <com\/sun\/star\/lang\/Locale.hpp>\n#include <com\/sun\/star\/awt\/FontSlant.hpp>\n#include <com\/sun\/star\/awt\/FontWeight.hpp>\n#include \"oox\/helper\/helper.hxx\"\n#include \"oox\/helper\/propertyset.hxx\"\n#include \"oox\/drawingml\/drawingmltypes.hxx\"\n#include \"tokens.hxx\"\n\nusing ::rtl::OUString;\nusing ::oox::core::XmlFilterBase;\nusing namespace ::com::sun::star;\nusing namespace ::com::sun::star::uno;\nusing namespace ::com::sun::star::beans;\n\nnamespace oox {\nnamespace drawingml {\n\n\/\/ ============================================================================\n\nvoid TextCharacterProperties::assignUsed( const TextCharacterProperties& rSourceProps )\n{\n \/\/ overwrite all properties exisiting in rSourceProps\n maHyperlinkPropertyMap.insert( rSourceProps.maHyperlinkPropertyMap.begin(), rSourceProps.maHyperlinkPropertyMap.end() );\n maLatinFont.assignIfUsed( rSourceProps.maLatinFont );\n maAsianFont.assignIfUsed( rSourceProps.maAsianFont );\n maComplexFont.assignIfUsed( rSourceProps.maComplexFont );\n maSymbolFont.assignIfUsed( rSourceProps.maSymbolFont );\n maCharColor.assignIfUsed( rSourceProps.maCharColor );\n maHighlightColor.assignIfUsed( rSourceProps.maHighlightColor );\n maUnderlineColor.assignIfUsed( rSourceProps.maUnderlineColor );\n moHeight.assignIfUsed( rSourceProps.moHeight );\n moUnderline.assignIfUsed( rSourceProps.moUnderline );\n moStrikeout.assignIfUsed( rSourceProps.moStrikeout );\n moCaseMap.assignIfUsed( rSourceProps.moCaseMap );\n moBold.assignIfUsed( rSourceProps.moBold );\n moItalic.assignIfUsed( rSourceProps.moItalic );\n moUnderlineLineFollowText.assignIfUsed( rSourceProps.moUnderlineLineFollowText );\n moUnderlineFillFollowText.assignIfUsed( rSourceProps.moUnderlineFillFollowText );\n}\n\nvoid TextCharacterProperties::pushToPropMap( PropertyMap& rPropMap, const XmlFilterBase& rFilter ) const\n{\n OUString aFontName;\n sal_Int16 nFontPitch = 0;\n sal_Int16 nFontFamily = 0;\n\n if( maLatinFont.getFontData( aFontName, nFontPitch, nFontFamily, rFilter ) )\n {\n rPropMap[ CREATE_OUSTRING( \"CharFontName\" ) ] <<= aFontName;\n rPropMap[ CREATE_OUSTRING( \"CharFontPitch\" ) ] <<= nFontPitch;\n rPropMap[ CREATE_OUSTRING( \"CharFontFamily\" ) ] <<= nFontFamily;\n }\n\n if( maAsianFont.getFontData( aFontName, nFontPitch, nFontFamily, rFilter ) )\n {\n rPropMap[ CREATE_OUSTRING( \"CharFontNameAsian\" ) ] <<= aFontName;\n rPropMap[ CREATE_OUSTRING( \"CharFontPitchAsian\" ) ] <<= nFontFamily;\n rPropMap[ CREATE_OUSTRING( \"CharFontFamilyAsian\" ) ] <<= nFontPitch;\n }\n\n if( maComplexFont.getFontData( aFontName, nFontPitch, nFontFamily, rFilter ) )\n {\n rPropMap[ CREATE_OUSTRING( \"CharFontNameComplex\" ) ] <<= aFontName;\n rPropMap[ CREATE_OUSTRING( \"CharFontPitchComplex\" ) ] <<= nFontPitch;\n rPropMap[ CREATE_OUSTRING( \"CharFontFamilyComplex\" ) ] <<= nFontFamily;\n }\n\n \/\/ symbol font not supported\n\n if( maCharColor.isUsed() )\n rPropMap[ CREATE_OUSTRING( \"CharColor\" ) ] <<= maCharColor.getColor( rFilter );\n\n if( moLang.has() && (moLang.get().getLength() > 0) )\n {\n lang::Locale aLocale;\n sal_Int32 nSepPos = moLang.get().indexOf( sal_Unicode( '-' ), 0 );\n if ( nSepPos >= 0 )\n {\n aLocale.Language = moLang.get().copy( 0, nSepPos );\n aLocale.Country = moLang.get().copy( nSepPos + 1 );\n }\n else\n {\n aLocale.Language = moLang.get();\n }\n rPropMap[ CREATE_OUSTRING( \"CharLocale\" ) ] <<= aLocale;\n rPropMap[ CREATE_OUSTRING( \"CharLocaleAsian\" ) ] <<= aLocale;\n rPropMap[ CREATE_OUSTRING( \"CharLocaleComplex\" ) ] <<= aLocale;\n }\n\n if( moHeight.has() )\n {\n float fHeight = GetFontHeight( moHeight.get() );\n rPropMap[ CREATE_OUSTRING( \"CharHeight\" ) ] <<= fHeight;\n rPropMap[ CREATE_OUSTRING( \"CharHeightAsian\" ) ] <<= fHeight;\n rPropMap[ CREATE_OUSTRING( \"CharHeightComplex\" ) ] <<= fHeight;\n }\n\n rPropMap[ CREATE_OUSTRING( \"CharUnderline\" ) ] <<= GetFontUnderline( moUnderline.get( XML_none ) );\n rPropMap[ CREATE_OUSTRING( \"CharStrikeout\" ) ] <<= GetFontStrikeout( moStrikeout.get( XML_noStrike ) );\n rPropMap[ CREATE_OUSTRING( \"CharCaseMap\" ) ] <<= GetCaseMap( moCaseMap.get( XML_none ) );\n\n float fWeight = moBold.get( false ) ? awt::FontWeight::BOLD : awt::FontWeight::NORMAL;\n rPropMap[ CREATE_OUSTRING( \"CharWeight\" ) ] <<= fWeight;\n rPropMap[ CREATE_OUSTRING( \"CharWeightAsian\" ) ] <<= fWeight;\n rPropMap[ CREATE_OUSTRING( \"CharWeightComplex\" ) ] <<= fWeight;\n\n awt::FontSlant eSlant = moItalic.get( false ) ? awt::FontSlant_ITALIC : awt::FontSlant_NONE;\n rPropMap[ CREATE_OUSTRING( \"CharPosture\" ) ] <<= eSlant;\n rPropMap[ CREATE_OUSTRING( \"CharPostureAsian\" ) ] <<= eSlant;\n rPropMap[ CREATE_OUSTRING( \"CharPostureComplex\" ) ] <<= eSlant;\n\n bool bUnderlineFillFollowText = moUnderlineFillFollowText.get( false );\n if( moUnderline.has() && maUnderlineColor.isUsed() && !bUnderlineFillFollowText )\n {\n rPropMap[ CREATE_OUSTRING( \"CharUnderlineHasColor\" ) ] <<= true;\n rPropMap[ CREATE_OUSTRING( \"CharUnderlineColor\" ) ] <<= maUnderlineColor.getColor( rFilter );\n }\n}\n\nvoid TextCharacterProperties::pushToPropSet( PropertySet& rPropSet, const XmlFilterBase& rFilter ) const\n{\n PropertyMap aPropMap;\n pushToPropMap( aPropMap, rFilter );\n rPropSet.setProperties( aPropMap );\n}\n\nfloat TextCharacterProperties::getCharHeightPoints( float fDefault ) const\n{\n return moHeight.has() ? GetFontHeight( moHeight.get() ) : fDefault;\n}\n\n\/\/ ============================================================================\n\n} \/\/ namespace drawingml\n} \/\/ namespace oox\n\n<|endoftext|>"} {"text":"<commit_before>\/*\n * Copyright (C) 2017 Daniel Nicoletti <dantti12@gmail.com>\n *\n * This library is free software; you can redistribute it and\/or\n * modify it under the terms of the GNU Lesser General Public\n * License as published by the Free Software Foundation; either\n * version 2.1 of the License, or (at your option) any later version.\n *\n * This library is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU\n * Lesser General Public License for more details.\n *\n * You should have received 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 \"enginerequest.h\"\n\n#include \"common.h\"\n\n#include <Cutelyst\/response_p.h>\n#include <Cutelyst\/Context>\n\n#include <QLoggingCategory>\nQ_LOGGING_CATEGORY(CUTELYST_ENGINEREQUEST, \"cutelyst.engine_request\")\n\nusing namespace Cutelyst;\n\nEngineRequest::EngineRequest()\n{\n\n}\n\nEngineRequest::~EngineRequest()\n{\n delete body;\n delete context;\n}\n\nvoid EngineRequest::finalizeBody()\n{\n Response *response = context->response();\n\n if (!(status & EngineRequest::Chunked)) {\n QIODevice *body = response->bodyDevice();\n\n if (body) {\n body->seek(0);\n char block[64 * 1024];\n while (!body->atEnd()) {\n qint64 in = body->read(block, sizeof(block));\n if (in <= 0) {\n break;\n }\n\n if (write(block, in) != in) {\n qCWarning(CUTELYST_ENGINEREQUEST) << \"Failed to write body\";\n break;\n }\n }\n } else {\n const QByteArray bodyByteArray = response->body();\n write(bodyByteArray.constData(), bodyByteArray.size());\n }\n } else if (!(status & EngineRequest::ChunkedDone)) {\n \/\/ Write the final '0' chunk\n doWrite(\"0\\r\\n\\r\\n\", 5);\n }\n}\n\nvoid EngineRequest::finalizeError()\n{\n Response *res = context->response();\n\n res->setContentType(QStringLiteral(\"text\/html; charset=utf-8\"));\n\n QByteArray body;\n\n \/\/ Trick IE. Old versions of IE would display their own error page instead\n \/\/ of ours if we'd give it less than 512 bytes.\n body.reserve(512);\n\n body.append(context->errors().join(QLatin1Char('\\n')).toUtf8());\n\n res->setBody(body);\n\n \/\/ Return 500\n res->setStatus(Response::InternalServerError);\n}\n\nvoid EngineRequest::finalize()\n{\n if (context->error()) {\n finalizeError();\n }\n\n if (!(status & EngineRequest::FinalizedHeaders) && !finalizeHeaders()) {\n return;\n }\n\n finalizeBody();\n}\n\nvoid EngineRequest::finalizeCookies()\n{\n Response *res = context->response();\n Headers &headers = res->headers();\n const auto cookies = res->cookies();\n for (const QNetworkCookie &cookie : cookies) {\n headers.pushHeader(QStringLiteral(\"SET_COOKIE\"), QString::fromLatin1(cookie.toRawForm()));\n }\n}\n\nbool EngineRequest::finalizeHeaders()\n{\n Response *response = context->response();\n Headers &headers = response->headers();\n\n \/\/ Fix missing content length\n if (headers.contentLength() < 0) {\n qint64 size = response->size();\n if (size >= 0) {\n headers.setContentLength(size);\n }\n }\n\n finalizeCookies();\n\n \/\/ Done\n status |= EngineRequest::FinalizedHeaders;\n return writeHeaders(response->status(), headers);\n}\n\nqint64 EngineRequest::write(const char *data, qint64 len)\n{\n if (!(status & EngineRequest::Chunked)) {\n return doWrite(data, len);\n } else if (!(status & EngineRequest::ChunkedDone)) {\n const QByteArray chunkSize = QByteArray::number(len, 16).toUpper();\n QByteArray chunk;\n chunk.reserve(len + chunkSize.size() + 4);\n chunk.append(chunkSize).append(\"\\r\\n\", 2)\n .append(data, len).append(\"\\r\\n\", 2);\n\n qint64 retWrite = doWrite(chunk.data(), chunk.size());\n\n \/\/ Flag if we wrote an empty chunk\n if (!len) {\n status |= EngineRequest::ChunkedDone;\n }\n\n return retWrite == chunk.size() ? len : -1;\n }\n return -1;\n}\n\nbool EngineRequest::webSocketHandshake(const QString &key, const QString &origin, const QString &protocol)\n{\n if (status & EngineRequest::FinalizedHeaders) {\n return false;\n }\n\n if (webSocketHandshakeDo(key, origin, protocol)) {\n status |= EngineRequest::FinalizedHeaders;\n return true;\n }\n\n return false;\n}\n\nbool EngineRequest::webSocketSendTextMessage(const QString &message)\n{\n Q_UNUSED(message)\n return false;\n}\n\nbool EngineRequest::webSocketSendBinaryMessage(const QByteArray &message)\n{\n Q_UNUSED(message)\n return false;\n}\n\nbool EngineRequest::webSocketSendPing(const QByteArray &payload)\n{\n Q_UNUSED(payload)\n return false;\n}\n\nbool EngineRequest::webSocketClose(quint16 code, const QString &reason)\n{\n Q_UNUSED(code)\n Q_UNUSED(reason)\n return false;\n}\n\nvoid EngineRequest::processingFinished()\n{\n}\n\nbool EngineRequest::webSocketHandshakeDo(const QString &key, const QString &origin, const QString &protocol)\n{\n Q_UNUSED(key)\n Q_UNUSED(origin)\n Q_UNUSED(protocol)\n return false;\n}\n\n#include \"moc_enginerequest.cpp\"\n<commit_msg>core: Reduce response scope<commit_after>\/*\n * Copyright (C) 2017 Daniel Nicoletti <dantti12@gmail.com>\n *\n * This library is free software; you can redistribute it and\/or\n * modify it under the terms of the GNU Lesser General Public\n * License as published by the Free Software Foundation; either\n * version 2.1 of the License, or (at your option) any later version.\n *\n * This library is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU\n * Lesser General Public License for more details.\n *\n * You should have received 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 \"enginerequest.h\"\n\n#include \"common.h\"\n\n#include <Cutelyst\/response_p.h>\n#include <Cutelyst\/Context>\n\n#include <QLoggingCategory>\nQ_LOGGING_CATEGORY(CUTELYST_ENGINEREQUEST, \"cutelyst.engine_request\")\n\nusing namespace Cutelyst;\n\nEngineRequest::EngineRequest()\n{\n\n}\n\nEngineRequest::~EngineRequest()\n{\n delete body;\n delete context;\n}\n\nvoid EngineRequest::finalizeBody()\n{\n if (!(status & EngineRequest::Chunked)) {\n Response *response = context->response();\n QIODevice *body = response->bodyDevice();\n\n if (body) {\n body->seek(0);\n char block[64 * 1024];\n while (!body->atEnd()) {\n qint64 in = body->read(block, sizeof(block));\n if (in <= 0) {\n break;\n }\n\n if (write(block, in) != in) {\n qCWarning(CUTELYST_ENGINEREQUEST) << \"Failed to write body\";\n break;\n }\n }\n } else {\n const QByteArray bodyByteArray = response->body();\n write(bodyByteArray.constData(), bodyByteArray.size());\n }\n } else if (!(status & EngineRequest::ChunkedDone)) {\n \/\/ Write the final '0' chunk\n doWrite(\"0\\r\\n\\r\\n\", 5);\n }\n}\n\nvoid EngineRequest::finalizeError()\n{\n Response *res = context->response();\n\n res->setContentType(QStringLiteral(\"text\/html; charset=utf-8\"));\n\n QByteArray body;\n\n \/\/ Trick IE. Old versions of IE would display their own error page instead\n \/\/ of ours if we'd give it less than 512 bytes.\n body.reserve(512);\n\n body.append(context->errors().join(QLatin1Char('\\n')).toUtf8());\n\n res->setBody(body);\n\n \/\/ Return 500\n res->setStatus(Response::InternalServerError);\n}\n\nvoid EngineRequest::finalize()\n{\n if (context->error()) {\n finalizeError();\n }\n\n if (!(status & EngineRequest::FinalizedHeaders) && !finalizeHeaders()) {\n return;\n }\n\n finalizeBody();\n}\n\nvoid EngineRequest::finalizeCookies()\n{\n Response *res = context->response();\n Headers &headers = res->headers();\n const auto cookies = res->cookies();\n for (const QNetworkCookie &cookie : cookies) {\n headers.pushHeader(QStringLiteral(\"SET_COOKIE\"), QString::fromLatin1(cookie.toRawForm()));\n }\n}\n\nbool EngineRequest::finalizeHeaders()\n{\n Response *response = context->response();\n Headers &headers = response->headers();\n\n \/\/ Fix missing content length\n if (headers.contentLength() < 0) {\n qint64 size = response->size();\n if (size >= 0) {\n headers.setContentLength(size);\n }\n }\n\n finalizeCookies();\n\n \/\/ Done\n status |= EngineRequest::FinalizedHeaders;\n return writeHeaders(response->status(), headers);\n}\n\nqint64 EngineRequest::write(const char *data, qint64 len)\n{\n if (!(status & EngineRequest::Chunked)) {\n return doWrite(data, len);\n } else if (!(status & EngineRequest::ChunkedDone)) {\n const QByteArray chunkSize = QByteArray::number(len, 16).toUpper();\n QByteArray chunk;\n chunk.reserve(len + chunkSize.size() + 4);\n chunk.append(chunkSize).append(\"\\r\\n\", 2)\n .append(data, len).append(\"\\r\\n\", 2);\n\n qint64 retWrite = doWrite(chunk.data(), chunk.size());\n\n \/\/ Flag if we wrote an empty chunk\n if (!len) {\n status |= EngineRequest::ChunkedDone;\n }\n\n return retWrite == chunk.size() ? len : -1;\n }\n return -1;\n}\n\nbool EngineRequest::webSocketHandshake(const QString &key, const QString &origin, const QString &protocol)\n{\n if (status & EngineRequest::FinalizedHeaders) {\n return false;\n }\n\n if (webSocketHandshakeDo(key, origin, protocol)) {\n status |= EngineRequest::FinalizedHeaders;\n return true;\n }\n\n return false;\n}\n\nbool EngineRequest::webSocketSendTextMessage(const QString &message)\n{\n Q_UNUSED(message)\n return false;\n}\n\nbool EngineRequest::webSocketSendBinaryMessage(const QByteArray &message)\n{\n Q_UNUSED(message)\n return false;\n}\n\nbool EngineRequest::webSocketSendPing(const QByteArray &payload)\n{\n Q_UNUSED(payload)\n return false;\n}\n\nbool EngineRequest::webSocketClose(quint16 code, const QString &reason)\n{\n Q_UNUSED(code)\n Q_UNUSED(reason)\n return false;\n}\n\nvoid EngineRequest::processingFinished()\n{\n}\n\nbool EngineRequest::webSocketHandshakeDo(const QString &key, const QString &origin, const QString &protocol)\n{\n Q_UNUSED(key)\n Q_UNUSED(origin)\n Q_UNUSED(protocol)\n return false;\n}\n\n#include \"moc_enginerequest.cpp\"\n<|endoftext|>"} {"text":"<commit_before>#ifndef ALEPH_COMPLEXES_FLANN_HH__\n#define ALEPH_COMPLEXES_FLANN_HH__\n\n#include <complexes\/NearestNeighbours.hh>\n\n#include <flann\/flann.hpp>\n\nnamespace aleph\n{\n\nnamespace complexes\n{\n\ntemplate <class Container> class FLANN : public NearestNeighbours< FLANN<Container> >\n{\npublic:\n using ElementType = typename Container::ElementType;\n using DistanceFunctor = flann::L2<ElementType>;\n\n FLANN( const Container& container )\n : _container( container )\n {\n _matrix\n = flann::Matrix<ElementType>( container.data(),\n container.size(), container.dimension() );\n\n flann::IndexParams indexParameters\n = flann::KDTreeSingleIndexParams();\n\n _index\n = new flann::Index<DistanceFunctor>( _matrix, indexParameters );\n }\n\n ~FLANN()\n {\n delete _index;\n }\n\nprivate:\n const Container& _container;\n\n \/**\n Copy of container data. This makes interfacing with FLANN easier, at\n the expense of having large storage costs.\n *\/\n\n flann::Matrix<ElementType> _matrix;\n\n \/** Index structure for queries. TODO: Make configurable\/generic. *\/\n flann::Index<DistanceFunctor>* _index = nullptr;\n};\n\n}\n\n}\n\n#endif\n<commit_msg>Basic radius search capabilities for FLANN wrapper<commit_after>#ifndef ALEPH_COMPLEXES_FLANN_HH__\n#define ALEPH_COMPLEXES_FLANN_HH__\n\n#include <complexes\/NearestNeighbours.hh>\n\n#include <flann\/flann.hpp>\n\n#include <algorithm>\n#include <vector>\n\nnamespace aleph\n{\n\nnamespace complexes\n{\n\ntemplate <class Container> class FLANN : public NearestNeighbours< FLANN<Container> >\n{\npublic:\n using IndexType = std::size_t;\n using ElementType = typename Container::ElementType;\n\n \/\/ TODO: Make configurable...\n using DistanceFunctor = flann::L2<ElementType>;\n\n FLANN( const Container& container )\n : _container( container )\n {\n _matrix\n = flann::Matrix<ElementType>( container.data(),\n container.size(), container.dimension() );\n\n flann::IndexParams indexParameters\n = flann::KDTreeSingleIndexParams();\n\n _index\n = new flann::Index<DistanceFunctor>( _matrix, indexParameters );\n }\n\n ~FLANN()\n {\n delete _index;\n }\n\n void radiusSearch( ElementType radius,\n std::vector< std::vector<IndexType> >& indices,\n std::vector< std::vector<ElementType> >& distances )\n {\n\n flann::SearchParams searchParameters = flann::SearchParams();\n searchParameters.checks = flann::FLANN_CHECKS_UNLIMITED;\n\n std::vector< std::vector<int> > internalIndices;\n\n _index->radiusSearch( _matrix,\n internalIndices,\n distances,\n radius,\n searchParameters );\n\n \/\/ Perform transformation of indices -------------------------------\n\n indices.clear();\n indices.resize( _matrix.rows );\n\n for( std::size_t i = 0; i < internalIndices.size(); i++ )\n {\n indices[i] = std::vector<IndexType>( internalIndices[i].size() );\n\n std::transform( internalIndices[i].begin(), internalIndices[i].end(),\n indices[i].begin(),\n [] ( int j )\n {\n return static_cast<IndexType>( j );\n } );\n }\n }\n\nprivate:\n const Container& _container;\n\n \/**\n Copy of container data. This makes interfacing with FLANN easier, at\n the expense of having large storage costs.\n *\/\n\n flann::Matrix<ElementType> _matrix;\n\n \/** Index structure for queries. TODO: Make configurable\/generic. *\/\n flann::Index<DistanceFunctor>* _index = nullptr;\n};\n\n}\n\n}\n\n#endif\n<|endoftext|>"} {"text":"<commit_before>#include \"ruby.h\"\n#include <osl\/state\/simpleState.h>\n#include <osl\/handicap.h>\n#include <iostream>\n\nusing namespace osl;\n\nvoid\nrb_SimpleState_free(state::SimpleState* ptr)\n{\n ptr->~SimpleState();\n ruby_xfree(ptr);\n}\n\nstatic VALUE\nrb_SimpleState_allocate(VALUE self)\n{\n void* p = ruby_xmalloc(sizeof(state::SimpleState));\n return Data_Wrap_Struct(self, NULL, rb_SimpleState_free, p);\n}\n\nstatic VALUE\nrb_SimpleState_initialize(VALUE self)\n{\n state::SimpleState* p;\n Data_Get_Struct(self, state::SimpleState, p);\n new (p) state::SimpleState(HIRATE);\n return Qnil;\n}\n\nstatic VALUE\nrb_SimpleState_show(VALUE self)\n{\n state::SimpleState* p;\n Data_Get_Struct(self, state::SimpleState, p);\n std::cout << *p << std::endl;\n return Qnil;\n}\n\n#ifdef __cplusplus\nextern \"C\" {\n#endif\nvoid\nInit_simpleState(VALUE mState)\n{\n VALUE cSimpleState;\n cSimpleState = rb_define_class_under(mState, \"SimpleState\", rb_cObject);\n rb_define_alloc_func(cSimpleState, rb_SimpleState_allocate);\n rb_define_private_method(cSimpleState, \"initialize\", RUBY_METHOD_FUNC(rb_SimpleState_initialize), 0);\n rb_define_method(cSimpleState, \"show\", RUBY_METHOD_FUNC(rb_SimpleState_show), 0);\n}\n#ifdef __cplusplus\n} \/* extern \"C\" *\/\n#endif\n<commit_msg>Use \"new\" style instead of \"initialize\" style<commit_after>#include \"ruby.h\"\n#include <osl\/state\/simpleState.h>\n#include <osl\/handicap.h>\n#include <iostream>\n\nusing namespace osl;\n\nvoid\nrb_SimpleState_free(state::SimpleState* ptr)\n{\n ptr->~SimpleState();\n ruby_xfree(ptr);\n}\n\nstatic VALUE\nrb_SimpleState_s_new(VALUE self)\n{\n state::SimpleState* p = new state::SimpleState(HIRATE);\n return Data_Wrap_Struct(self, NULL, rb_SimpleState_free, p);\n}\n\nstatic VALUE\nrb_SimpleState_show(VALUE self)\n{\n state::SimpleState* p;\n Data_Get_Struct(self, state::SimpleState, p);\n std::cout << *p << std::endl;\n return Qnil;\n}\n\n#ifdef __cplusplus\nextern \"C\" {\n#endif\nvoid\nInit_simpleState(VALUE mState)\n{\n VALUE cSimpleState;\n cSimpleState = rb_define_class_under(mState, \"SimpleState\", rb_cObject);\n rb_define_alloc_func(cSimpleState, rb_SimpleState_allocate);\n rb_define_singleton_method(cSimpleState, \"new\", RUBY_METHOD_FUNC(rb_SimpleState_s_new), 0);\n rb_define_method(cSimpleState, \"show\", RUBY_METHOD_FUNC(rb_SimpleState_show), 0);\n}\n#ifdef __cplusplus\n} \/* extern \"C\" *\/\n#endif\n<|endoftext|>"} {"text":"<commit_before>\/*!\n * \\file static_resource.cpp\n * \\brief file static_resource.cpp\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#include <fastuidraw\/util\/util.hpp>\n#include <map>\n#include <vector>\n\n#include <fastuidraw\/util\/util.hpp>\n#include <fastuidraw\/util\/reference_counted.hpp>\n#include <fastuidraw\/util\/static_resource.hpp>\n\n#include \"..\/private\/util_private.hpp\"\n\nnamespace\n{\n class resource_hoard:fastuidraw::noncopyable\n {\n public:\n std::map<std::string, std::vector<uint8_t> > m_data;\n fastuidraw::mutex m_mutex;\n };\n\n static\n resource_hoard&\n hoard(void)\n {\n static resource_hoard R;\n return R;\n }\n}\n\nvoid\nfastuidraw::\ngenerate_static_resource(const char *presource_label, const_c_array<uint8_t> pvalue)\n{\n std::string sresource_label(presource_label);\n std::vector<uint8_t> svalue(pvalue.begin(), pvalue.end());\n hoard().m_mutex.lock();\n FASTUIDRAWassert(hoard().m_data.find(sresource_label) == hoard().m_data.end());\n hoard().m_data[sresource_label] = svalue;\n hoard().m_mutex.unlock();\n}\n\nfastuidraw::const_c_array<uint8_t>\nfastuidraw::\nfetch_static_resource(const char *presource_label)\n{\n const_c_array<uint8_t> return_value;\n std::string sresource_label(presource_label);\n std::map<std::string, std::vector<uint8_t> >::const_iterator iter;\n\n hoard().m_mutex.lock();\n iter = hoard().m_data.find(sresource_label);\n if(iter != hoard().m_data.end())\n {\n return_value = make_c_array(iter->second);\n }\n hoard().m_mutex.unlock();\n return return_value;\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ fastuidraw::static_resource methods\nfastuidraw::static_resource::\nstatic_resource(const char *resource_label, const_c_array<uint8_t> value)\n{\n generate_static_resource(resource_label, value);\n}\n<commit_msg>fastuidraw\/util: add missing include <string><commit_after>\/*!\n * \\file static_resource.cpp\n * \\brief file static_resource.cpp\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#include <fastuidraw\/util\/util.hpp>\n#include <map>\n#include <vector>\n#include <string>\n\n#include <fastuidraw\/util\/util.hpp>\n#include <fastuidraw\/util\/reference_counted.hpp>\n#include <fastuidraw\/util\/static_resource.hpp>\n\n#include \"..\/private\/util_private.hpp\"\n\nnamespace\n{\n class resource_hoard:fastuidraw::noncopyable\n {\n public:\n std::map<std::string, std::vector<uint8_t> > m_data;\n fastuidraw::mutex m_mutex;\n };\n\n static\n resource_hoard&\n hoard(void)\n {\n static resource_hoard R;\n return R;\n }\n}\n\nvoid\nfastuidraw::\ngenerate_static_resource(const char *presource_label, const_c_array<uint8_t> pvalue)\n{\n std::string sresource_label(presource_label);\n std::vector<uint8_t> svalue(pvalue.begin(), pvalue.end());\n hoard().m_mutex.lock();\n FASTUIDRAWassert(hoard().m_data.find(sresource_label) == hoard().m_data.end());\n hoard().m_data[sresource_label] = svalue;\n hoard().m_mutex.unlock();\n}\n\nfastuidraw::const_c_array<uint8_t>\nfastuidraw::\nfetch_static_resource(const char *presource_label)\n{\n const_c_array<uint8_t> return_value;\n std::string sresource_label(presource_label);\n std::map<std::string, std::vector<uint8_t> >::const_iterator iter;\n\n hoard().m_mutex.lock();\n iter = hoard().m_data.find(sresource_label);\n if(iter != hoard().m_data.end())\n {\n return_value = make_c_array(iter->second);\n }\n hoard().m_mutex.unlock();\n return return_value;\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ fastuidraw::static_resource methods\nfastuidraw::static_resource::\nstatic_resource(const char *resource_label, const_c_array<uint8_t> value)\n{\n generate_static_resource(resource_label, value);\n}\n<|endoftext|>"} {"text":"<commit_before>#ifndef SOLAIRE_ISTREAM_HPP\n#define SOLAIRE_ISTREAM_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 IStream.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: 20th November 2015\n\tLast Modified\t: 12th January 2016\n*\/\n\n#include <cstdint>\n#include \"Solaire\/Core\/ModuleHeader.hpp\"\n\nnamespace Solaire {\n\n\tSOLAIRE_EXPORT_INTERFACE IStream {\n private:\n virtual uint8_t SOLAIRE_EXPORT_CALL readU8() throw() = 0;\n virtual uint16_t SOLAIRE_EXPORT_CALL readU16() throw() = 0;\n virtual uint32_t SOLAIRE_EXPORT_CALL readU32() throw() = 0;\n virtual uint64_t SOLAIRE_EXPORT_CALL readU64() throw() = 0;\n virtual int8_t SOLAIRE_EXPORT_CALL readI8() throw() = 0;\n virtual int16_t SOLAIRE_EXPORT_CALL readI16() throw() = 0;\n virtual int32_t SOLAIRE_EXPORT_CALL readI32() throw() = 0;\n virtual int64_t SOLAIRE_EXPORT_CALL readI64() throw() = 0;\n virtual float SOLAIRE_EXPORT_CALL readF() throw() = 0;\n virtual double SOLAIRE_EXPORT_CALL readD() throw() = 0;\n virtual char SOLAIRE_EXPORT_CALL readC() throw() = 0;\n public:\n virtual SOLAIRE_EXPORT_CALL ~IStream(){}\n\n virtual void SOLAIRE_EXPORT_CALL read(void* const, const uint32_t) throw() = 0;\n virtual bool SOLAIRE_EXPORT_CALL isOffsetable() const throw() = 0;\n virtual int32_t SOLAIRE_EXPORT_CALL getOffset() const throw() = 0;\n virtual bool SOLAIRE_EXPORT_CALL setOffset(const int32_t) throw() = 0;\n virtual bool SOLAIRE_EXPORT_CALL end() const throw() = 0;\n\n SOLAIRE_FORCE_INLINE IStream& operator>>(uint8_t& aValue) throw() {\n aValue = readU8();\n return *this;\n }\n\n SOLAIRE_FORCE_INLINE IStream& operator>>(uint16_t& aValue) throw() {\n aValue = readU16();\n return *this;\n }\n\n SOLAIRE_FORCE_INLINE IStream& operator>>(uint32_t& aValue) throw() {\n aValue = readU32();\n return *this;\n }\n\n SOLAIRE_FORCE_INLINE IStream& operator>>(uint64_t& aValue) throw() {\n aValue = readU64();\n return *this;\n }\n\n SOLAIRE_FORCE_INLINE IStream& operator>>(int8_t& aValue) throw() {\n aValue = readI8();\n return *this;\n }\n\n SOLAIRE_FORCE_INLINE IStream& operator>>(int16_t& aValue) throw() {\n aValue = readI16();\n return *this;\n }\n\n SOLAIRE_FORCE_INLINE IStream& operator>>(int32_t& aValue) throw() {\n aValue = readI32();\n return *this;\n }\n\n SOLAIRE_FORCE_INLINE IStream& operator>>(int64_t& aValue) throw() {\n aValue = readI64();\n return *this;\n }\n\n SOLAIRE_FORCE_INLINE IStream& operator>>(float& aValue) throw() {\n aValue = readF();\n return *this;\n }\n\n SOLAIRE_FORCE_INLINE IStream& operator>>(double& aValue) throw() {\n aValue = readD();\n return *this;\n }\n\n SOLAIRE_FORCE_INLINE IStream& operator>>(char& aValue) throw() {\n aValue = readC();\n return *this;\n }\n };\n\n}\n\n#endif\n<commit_msg>Added helper functions to IStream<commit_after>#ifndef SOLAIRE_ISTREAM_HPP\n#define SOLAIRE_ISTREAM_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 IStream.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: 20th November 2015\n\tLast Modified\t: 12th January 2016\n*\/\n\n#include <cstdint>\n#include \"Solaire\/Core\/ModuleHeader.hpp\"\n\nnamespace Solaire {\n\n\tSOLAIRE_EXPORT_INTERFACE IStream {\n private:\n virtual uint8_t SOLAIRE_EXPORT_CALL readU8() throw() = 0;\n virtual uint16_t SOLAIRE_EXPORT_CALL readU16() throw() = 0;\n virtual uint32_t SOLAIRE_EXPORT_CALL readU32() throw() = 0;\n virtual uint64_t SOLAIRE_EXPORT_CALL readU64() throw() = 0;\n virtual int8_t SOLAIRE_EXPORT_CALL readI8() throw() = 0;\n virtual int16_t SOLAIRE_EXPORT_CALL readI16() throw() = 0;\n virtual int32_t SOLAIRE_EXPORT_CALL readI32() throw() = 0;\n virtual int64_t SOLAIRE_EXPORT_CALL readI64() throw() = 0;\n virtual float SOLAIRE_EXPORT_CALL readF() throw() = 0;\n virtual double SOLAIRE_EXPORT_CALL readD() throw() = 0;\n virtual char SOLAIRE_EXPORT_CALL readC() throw() = 0;\n public:\n virtual SOLAIRE_EXPORT_CALL ~IStream(){}\n\n virtual void SOLAIRE_EXPORT_CALL read(void* const, const uint32_t) throw() = 0;\n virtual bool SOLAIRE_EXPORT_CALL isOffsetable() const throw() = 0;\n virtual int32_t SOLAIRE_EXPORT_CALL getOffset() const throw() = 0;\n virtual bool SOLAIRE_EXPORT_CALL setOffset(const int32_t) throw() = 0;\n virtual bool SOLAIRE_EXPORT_CALL end() const throw() = 0;\n\n SOLAIRE_FORCE_INLINE IStream& operator>>(uint8_t& aValue) throw() {\n aValue = readU8();\n return *this;\n }\n\n SOLAIRE_FORCE_INLINE IStream& operator>>(uint16_t& aValue) throw() {\n aValue = readU16();\n return *this;\n }\n\n SOLAIRE_FORCE_INLINE IStream& operator>>(uint32_t& aValue) throw() {\n aValue = readU32();\n return *this;\n }\n\n SOLAIRE_FORCE_INLINE IStream& operator>>(uint64_t& aValue) throw() {\n aValue = readU64();\n return *this;\n }\n\n SOLAIRE_FORCE_INLINE IStream& operator>>(int8_t& aValue) throw() {\n aValue = readI8();\n return *this;\n }\n\n SOLAIRE_FORCE_INLINE IStream& operator>>(int16_t& aValue) throw() {\n aValue = readI16();\n return *this;\n }\n\n SOLAIRE_FORCE_INLINE IStream& operator>>(int32_t& aValue) throw() {\n aValue = readI32();\n return *this;\n }\n\n SOLAIRE_FORCE_INLINE IStream& operator>>(int64_t& aValue) throw() {\n aValue = readI64();\n return *this;\n }\n\n SOLAIRE_FORCE_INLINE IStream& operator>>(float& aValue) throw() {\n aValue = readF();\n return *this;\n }\n\n SOLAIRE_FORCE_INLINE IStream& operator>>(double& aValue) throw() {\n aValue = readD();\n return *this;\n }\n\n SOLAIRE_FORCE_INLINE IStream& operator>>(char& aValue) throw() {\n aValue = readC();\n return *this;\n }\n\n template<class T>\n SOLAIRE_FORCE_INLINE T peak() throw() {\n const int32_t offset = this->getOffset();\n T tmp;\n *this >> tmp;\n this->setOffset(offset);\n return tmp;\n }\n\n template<class T>\n SOLAIRE_FORCE_INLINE bool ignore() throw() {\n T tmp;\n *this >> tmp;\n return true;\n }\n };\n\n}\n\n#endif\n<|endoftext|>"} {"text":"<commit_before><commit_msg>Implement all remaining arithmetic operations.<commit_after><|endoftext|>"} {"text":"<commit_before>\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ \/\/\n\/\/ A brief class that handles reading input from a configuration text file \/\/\n\/\/ based on root's TEnv format, i.e. key-value pairs, and shamelessly stolen \/\/\n\/\/ from the HGamAnalysisTools package. \/\/\n\/\/ \/\/\n\/\/ Author: Dag Gillberg \/\/\n\/\/ Appropriator: Andrew Hard \/\/\n\/\/ Email: ahard@cern.ch \/\/\n\/\/ Date: 03\/08\/2015 \/\/\n\/\/ \/\/\n\/\/ Config: \/\/\n\/\/ class to read settings from text files \/\/\n\/\/ relies on root's TEnv \/\/\n\/\/ \/\/\n\/\/ Usage: \/\/\n\/\/ Config settings(\"Hgamma.config\"); \/\/\n\/\/ TString gamContainerName = settings.getStr(\"PhotonContainer\"); \/\/\n\/\/ TString elContainerName = settings.getStr(\"ElectronContainer\"); \/\/\n\/\/ vector<TString> systShifts = settings.getStrV(\"Systematics\"); \/\/\n\/\/ \/\/\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n#include \"Config.h\"\n\n\/**\n Class constructor.\n*\/\nConfig::Config(TString fileName) {\n addFile(fileName);\n}\n\n\/**\n Ensures that there is a value in the database assocated with key if not, \n abort with error message\n*\/\nvoid Config::ensureDefined(TString key) {\n if (!isDefined(key)) {\n std::cout << \"HG::Config no value found for \" << key << std::endl;\n exit(0);\n }\n}\n\n\/**\n returns true if the key is defined\n*\/\nbool Config::isDefined(TString key) {\n return m_env.Defined(key);\n}\n\n\/**\n Access a string value from the config database. Exception thrown if no entry exist.\n*\/\nTString Config::getStr(TString key, bool expand) {\n ensureDefined(key);\n if (!expand) return m_env.GetValue(key,\"\");\n else return gSystem->ExpandPathName(m_env.GetValue(key,\"\"));\n}\n\n\/**\n Access a string value from the config database. Default value used if no entry exist.\n*\/\nTString Config::getStr(TString key, TString dflt) {\n return m_env.GetValue(key, dflt);\n}\n\n\/**\n Access an integer from the config database. Default value used if no entry exist.\n*\/\nint Config::getInt(TString key) {\n ensureDefined(key);\n return m_env.GetValue(key,-99);\n}\n\n\/**\n Access an integer from the config database. Exception thrown if no entry exist.\n*\/\nint Config::getInt(TString key, int dflt) {\n return m_env.GetValue(key,dflt);\n}\n\n\/**\n Access a boolean from the config database. Default value used if no entry exist\n*\/\nbool Config::getBool(TString key, bool dflt) {\n return m_env.GetValue(key,dflt);\n}\n\n\/**\n Access a boolean from the config database. Exception thrown if no entry exist.\n*\/\nbool Config::getBool(TString key) {\n ensureDefined(key); return getBool(key,false);\n}\n\n\/**\n Access a real number from the config database\n*\/\ndouble Config::getNum(TString key) {\n ensureDefined(key);\n return m_env.GetValue(key,-99.0);\n}\n\n\/**\n Access a vector of doubles from the config database\n*\/\ndouble Config::getNum(TString key, double dflt) {\n return m_env.GetValue(key, dflt);\n}\n\n\/**\n Access a vector of strings from the config database\n*\/\nstd::vector<TString> Config::getStrV(TString key) {\n ensureDefined(key);\n return vectorize(m_env.GetValue(key,\"\"),\" \\t\");\n}\n\nstd::vector<double> Config::getNumV(TString key) {\n ensureDefined(key);\n return vectorizeNum(m_env.GetValue(key,\"\"),\" \\t\");\n}\n\n\/**\n Prints the TEnv database to screen.\n*\/\nvoid Config::printDB() {\n TIter next(m_env.GetTable());\n while (TEnvRec *er = (TEnvRec*) next()) {\n printf(\" %-60s%s\\n\", Form(\"%s:\", er->GetName()), er->GetValue());\n }\n}\n\n\/**\n Add more user specified settings.\n*\/\nvoid Config::addFile(TString fileName) {\n TString path(fileName);\n if (!fileExist(path) || path == \"\") {\n std::cout << \"Cannot find settings file \" << fileName\n\t << \"\\n also searched in \" << path << std::endl;\n exit(0);\n }\n \/\/ settings read in by files should not overwrite values set by setValue()\n TEnv env;\n int status = env.ReadFile(path.Data(),EEnvLevel(0));\n if (status != 0) {\n std::cout << \"Cannot read settings file \" << fileName << std::endl;\n exit(0);\n }\n TIter next(env.GetTable());\n while (TEnvRec *er = (TEnvRec*) next()) {\n if (!isDefined(er->GetName())) {\n setValue(er->GetName(), er->GetValue());\n }\n }\n}\n\n\/**\n Set value\n*\/\nvoid Config::setValue(TString key, TString value) {\n m_env.SetValue(key,value);\n}\n\nstd::vector<TString> Config::vectorize(TString str, TString sep) {\n std::vector<TString> result;\n TObjArray *strings = str.Tokenize(sep.Data());\n if (strings->GetEntries()==0) { delete strings; return result; }\n TIter istr(strings);\n while (TObjString* os=(TObjString*)istr()) {\n \/\/ the number sign and everything after is treated as a comment\n if (os->GetString()[0]=='#') break;\n result.push_back(os->GetString());\n }\n delete strings;\n return result;\n }\n \n \/\/ convert a text line containing a list of numbers to a vector<double>\nstd::vector<double> Config::vectorizeNum(TString str, TString sep) {\n std::vector<double> result; std::vector<TString> vecS = vectorize(str,sep);\n for (uint i=0;i<vecS.size();++i)\n result.push_back(atof(vecS[i]));\n return result;\n }\n\n\/\/ checks if a given file or directory exist\nbool Config::fileExist(TString fn) {\n return !(gSystem->AccessPathName(fn.Data()));\n}\n<commit_msg>Updating config class<commit_after>\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ \/\/\n\/\/ A brief class that handles reading input from a configuration text file \/\/\n\/\/ based on root's TEnv format, i.e. key-value pairs, and shamelessly stolen \/\/\n\/\/ from the HGamAnalysisTools package. \/\/\n\/\/ \/\/\n\/\/ Author: Dag Gillberg \/\/\n\/\/ Appropriator: Andrew Hard \/\/\n\/\/ Email: ahard@cern.ch \/\/\n\/\/ Date: 03\/08\/2015 \/\/\n\/\/ \/\/\n\/\/ Config: \/\/\n\/\/ class to read settings from text files \/\/\n\/\/ relies on root's TEnv \/\/\n\/\/ \/\/\n\/\/ Usage: \/\/\n\/\/ Config settings(\"Hgamma.config\"); \/\/\n\/\/ TString gamContainerName = settings.getStr(\"PhotonContainer\"); \/\/\n\/\/ TString elContainerName = settings.getStr(\"ElectronContainer\"); \/\/\n\/\/ vector<TString> systShifts = settings.getStrV(\"Systematics\"); \/\/\n\/\/ \/\/\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n#include \"Config.h\"\n\n\/**\n Class constructor.\n*\/\nConfig::Config(TString fileName) {\n addFile(fileName);\n}\n\n\/**\n Ensures that there is a value in the database assocated with key if not, \n abort with error message\n*\/\nvoid Config::ensureDefined(TString key) {\n if (!isDefined(key)) {\n std::cout << \"Config: no value found for \" << key << std::endl;\n exit(0);\n }\n}\n\n\/**\n returns true if the key is defined\n*\/\nbool Config::isDefined(TString key) {\n return m_env.Defined(key);\n}\n\n\/**\n Access a string value from the config database. Exception thrown if no entry exist.\n*\/\nTString Config::getStr(TString key, bool expand) {\n ensureDefined(key);\n if (!expand) return m_env.GetValue(key,\"\");\n else return gSystem->ExpandPathName(m_env.GetValue(key,\"\"));\n}\n\n\/**\n Access a string value from the config database. Default value used if no entry exist.\n*\/\nTString Config::getStr(TString key, TString dflt) {\n return m_env.GetValue(key, dflt);\n}\n\n\/**\n Access an integer from the config database. Default value used if no entry exist.\n*\/\nint Config::getInt(TString key) {\n ensureDefined(key);\n return m_env.GetValue(key,-99);\n}\n\n\/**\n Access an integer from the config database. Exception thrown if no entry exist.\n*\/\nint Config::getInt(TString key, int dflt) {\n return m_env.GetValue(key,dflt);\n}\n\n\/**\n Access a boolean from the config database. Default value used if no entry exist\n*\/\nbool Config::getBool(TString key, bool dflt) {\n return m_env.GetValue(key,dflt);\n}\n\n\/**\n Access a boolean from the config database. Exception thrown if no entry exist.\n*\/\nbool Config::getBool(TString key) {\n ensureDefined(key); return getBool(key,false);\n}\n\n\/**\n Access a real number from the config database\n*\/\ndouble Config::getNum(TString key) {\n ensureDefined(key);\n return m_env.GetValue(key,-99.0);\n}\n\n\/**\n Access a vector of doubles from the config database\n*\/\ndouble Config::getNum(TString key, double dflt) {\n return m_env.GetValue(key, dflt);\n}\n\n\/**\n Access a vector of strings from the config database\n*\/\nstd::vector<TString> Config::getStrV(TString key) {\n ensureDefined(key);\n return vectorize(m_env.GetValue(key,\"\"),\" \\t\");\n}\n\nstd::vector<double> Config::getNumV(TString key) {\n ensureDefined(key);\n return vectorizeNum(m_env.GetValue(key,\"\"),\" \\t\");\n}\n\n\/**\n Prints the TEnv database to screen.\n*\/\nvoid Config::printDB() {\n TIter next(m_env.GetTable());\n while (TEnvRec *er = (TEnvRec*) next()) {\n printf(\" %-60s%s\\n\", Form(\"%s:\", er->GetName()), er->GetValue());\n }\n}\n\n\/**\n Add more user specified settings.\n*\/\nvoid Config::addFile(TString fileName) {\n TString path(fileName);\n if (!fileExist(path) || path == \"\") {\n std::cout << \"Cannot find settings file \" << fileName\n\t << \"\\n also searched in \" << path << std::endl;\n exit(0);\n }\n \/\/ settings read in by files should not overwrite values set by setValue()\n TEnv env;\n int status = env.ReadFile(path.Data(),EEnvLevel(0));\n if (status != 0) {\n std::cout << \"Cannot read settings file \" << fileName << std::endl;\n exit(0);\n }\n TIter next(env.GetTable());\n while (TEnvRec *er = (TEnvRec*) next()) {\n if (!isDefined(er->GetName())) {\n setValue(er->GetName(), er->GetValue());\n }\n }\n}\n\n\/**\n Set value\n*\/\nvoid Config::setValue(TString key, TString value) {\n m_env.SetValue(key,value);\n}\n\nstd::vector<TString> Config::vectorize(TString str, TString sep) {\n std::vector<TString> result;\n TObjArray *strings = str.Tokenize(sep.Data());\n if (strings->GetEntries()==0) { delete strings; return result; }\n TIter istr(strings);\n while (TObjString* os=(TObjString*)istr()) {\n \/\/ the number sign and everything after is treated as a comment\n if (os->GetString()[0]=='#') break;\n result.push_back(os->GetString());\n }\n delete strings;\n return result;\n }\n \n \/\/ convert a text line containing a list of numbers to a vector<double>\nstd::vector<double> Config::vectorizeNum(TString str, TString sep) {\n std::vector<double> result; std::vector<TString> vecS = vectorize(str,sep);\n for (uint i=0;i<vecS.size();++i)\n result.push_back(atof(vecS[i]));\n return result;\n }\n\n\/\/ checks if a given file or directory exist\nbool Config::fileExist(TString fn) {\n return !(gSystem->AccessPathName(fn.Data()));\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 \"halley\/text\/string_converter.h\"\n#ifdef _WIN32\n#include \"halley\/support\/exception.h\"\n\n#pragma warning(disable: 6387)\n#include \"os_win32.h\"\n\n#include <iostream>\n#include <winuser.h>\n#include <Lmcons.h>\n#include <Shlobj.h>\n#include <fcntl.h>\n#include <io.h>\n#include <comutil.h>\n#include <objbase.h>\n#include <atlbase.h>\n\n#pragma comment(lib, \"wbemuuid.lib\")\n\/\/#pragma comment(lib, \"comsupp.lib\")\n#pragma comment(lib, \"comsuppw.lib\")\n\n\nusing namespace Halley;\n\nHalley::OSWin32::OSWin32()\n\t: pLoc(nullptr)\n\t, pSvc(nullptr)\n{\n\t\/\/ From http:\/\/msdn.microsoft.com\/en-us\/library\/aa389762(v=VS.85).aspx\n\t\/\/ \"Creating a WMI Application Using C++\"\n\n\ttry {\n\t\t\/\/ Initialize COM\n\t\tHRESULT hr;\n\t\thr = CoInitializeEx(nullptr, COINIT_APARTMENTTHREADED);\n\t\tif (FAILED(hr)) throw Exception(\"Unable to initialize COM.\");\n\t\thr = CoInitializeSecurity(nullptr, -1, nullptr, nullptr, RPC_C_AUTHN_LEVEL_DEFAULT, RPC_C_IMP_LEVEL_IMPERSONATE, nullptr, EOAC_NONE, nullptr);\n\t\tif (FAILED(hr)) throw Exception(\"Unable to initialize COM security.\");\n\n\t\t\/\/ Initialize WMI\n\t\thr = CoCreateInstance(CLSID_WbemAdministrativeLocator, nullptr, CLSCTX_INPROC_SERVER, IID_IWbemLocator, reinterpret_cast<void**>(&pLoc));\n\t\tif (FAILED(hr)) throw Exception(\"Unable to obtain locator\");\n\t\t\/\/hr = pLoc->ConnectServer(BSTR(L\"ROOT\\\\DEFAULT\"), nullptr, nullptr, 0, 0, 0, 0, &pSvc);\n\t\thr = pLoc->ConnectServer( L\"root\\\\cimv2\", nullptr, nullptr, nullptr, WBEM_FLAG_CONNECT_USE_MAX_WAIT, nullptr, nullptr, &pSvc);\n\t\tif (FAILED(hr)) throw Exception(\"Unable to connect to WMI service\");\n\n\t\t\/\/ Set security on WMI connection\n\t\thr = CoSetProxyBlanket(pSvc, RPC_C_AUTHN_WINNT, RPC_C_AUTHZ_NONE, nullptr, RPC_C_AUTHN_LEVEL_CALL, RPC_C_IMP_LEVEL_IMPERSONATE, nullptr, EOAC_NONE);\n\t\tif (FAILED(hr)) throw Exception(\"Unable to set WMI security\");\n\t} catch (std::exception& e) {\n\t\tstd::cout << \"Exception initializing COM\/WMI: \" << e.what() << std::endl;\n\t\tpSvc = nullptr;\n\t\tpLoc = nullptr;\n\t} catch (...) {\n\t\tstd::cout << \"Unknown exception initializing COM\/WMI.\";\n\t\tpSvc = nullptr;\n\t\tpLoc = nullptr;\n\t}\n\n\t\/\/ Load icon\n\tHINSTANCE handle = ::GetModuleHandle(nullptr);\n\ticon = ::LoadIcon(handle, \"IDI_MAIN_ICON\");\n}\n\nHalley::OSWin32::~OSWin32()\n{\n\tif (pSvc) {\n\t\tpSvc->Release();\n\t\tpLoc->Release();\n\t\tCoUninitialize();\n\t}\n}\n\nstatic String getCOMError(int hr)\n{\n\tIErrorInfo* info;\n\tHRESULT hr2 = GetErrorInfo(0, &info);\n\tif (FAILED(hr2)) return \"Failed getting COM error.\";\n\tBSTR str;\n\tinfo->GetDescription(&str);\n\t_bstr_t tmp(str);\n\treturn \"\\\"\" + String(LPCSTR(tmp)) + \"\\\", code 0x\"+ toString(hr, 16);\n}\n\nHalley::String Halley::OSWin32::runWMIQuery(String query, String parameter) const\n{\n\t\/\/ See:\n\t\/\/ http:\/\/www.codeproject.com\/KB\/system\/UsingWMI.aspx\n\t\/\/ http:\/\/www.codeproject.com\/KB\/system\/Using_WMI_in_Visual_C__.aspx\n\n\tif (pSvc) {\n\t\ttry {\n\t\t\tHRESULT hr;\n\t\t\tCComPtr<IEnumWbemClassObject> enumerator;\n\t\t\tBSTR lang = CComBSTR(L\"WQL\");\n\t\t\tBSTR q = CComBSTR(query.c_str());\n\t\t\thr = pSvc->ExecQuery(lang, q, WBEM_FLAG_FORWARD_ONLY, nullptr, &enumerator);\n\t\t\tif (FAILED(hr)) throw Exception(\"Error running WMI query: \"+getCOMError(hr));\n\n\t\t\tULONG retcnt;\n\t\t\tCComPtr<IWbemClassObject> result;\n\t\t\thr = enumerator->Next(WBEM_INFINITE, 1L, &result, &retcnt);\n\t\t\tif (retcnt == 0) return \"Unknown\";\n\t\t\tif (FAILED(hr)) throw Exception(\"Error obtaining WMI enumeration\");\n\n\t\t\t_variant_t var_val;\n\t\t\thr = result->Get(parameter.getUTF16().c_str(), 0, &var_val, nullptr, nullptr);\n\t\t\tif (FAILED(hr)) throw Exception(\"Error retrieving name from WMI query result\");\n\n\t\t\tif (var_val.vt == VT_NULL) {\n\t\t\t\treturn \"\";\n\t\t\t} else {\n\t\t\t\treturn String(static_cast<const char*>(_bstr_t(var_val)));\n\t\t\t}\n\t\t} catch (std::exception& e) {\n\t\t\tstd::cout << \"Exception running WMI query: \" << e.what() << std::endl;\n\t\t} catch (...) {\n\t\t\tstd::cout << \"Unknown exception running WMI query.\" << std::endl;\n\t\t}\n\t}\n\treturn \"Unknown\";\n}\n\n\n\nstruct MonitorInfo {\npublic:\n\tint n;\n\tint x, y, w, h;\n};\n\nBOOL CALLBACK onMonitorInfo(HMONITOR \/*hMonitor*\/, HDC \/*hdcMonitor*\/, LPRECT lprcMonitor, LPARAM dwData)\n{\n\tMonitorInfo* info = reinterpret_cast<MonitorInfo*>(dwData);\n\tinfo->n++;\n\tinfo->x = lprcMonitor->left;\n\tinfo->y = lprcMonitor->top;\n\tinfo->w = lprcMonitor->right - lprcMonitor->left;\n\tinfo->h = lprcMonitor->bottom - lprcMonitor->top;\n\treturn (info->n != 2);\n}\n\nvoid OSWin32::loadWindowIcon(HWND hwnd)\n{\n\tif (icon != nullptr) {\n\t\t::SetClassLongPtr(hwnd, GCLP_HICON, reinterpret_cast<LONG_PTR>(icon));\n\t\t::SendMessage(hwnd, WM_SETICON, ICON_SMALL, reinterpret_cast<LPARAM>(icon));\n\t}\n}\n\nvoid OSWin32::onWindowCreated(void* window)\n{\n\tloadWindowIcon(reinterpret_cast<HWND>(window));\n}\n\nvoid Halley::OSWin32::createLogConsole(String winTitle)\n{\n\tAllocConsole();\n\tSetConsoleTitle(winTitle.c_str());\n\n\t\/\/ Icon\n\tHWND con = GetConsoleWindow();\n\tloadWindowIcon(con);\n\n\t\/\/ Position console\n\tMonitorInfo info;\n\tinfo.n = 0;\n\tEnumDisplayMonitors(nullptr, nullptr, onMonitorInfo, LPARAM(&info));\n\tif (info.n > 1) {\n\t\tRECT rect;\n\t\tGetWindowRect(con, &rect);\n\t\tint w = rect.right - rect.left;\n\t\tint h = info.h;\n\t\t\/\/MoveWindow(con, (info.w - w)\/2 + info.x, (info.h - h)\/2 + info.h, w, h, true);\n\t\tSetWindowPos(con, HWND_TOP, (info.w - w)\/2 + info.x, (info.h - h)\/2 + info.y, w, h, 0);\n\t}\n}\n\nvoid OSWin32::initializeConsole()\n{\n\t\/\/ From http:\/\/stackoverflow.com\/a\/25927081\/546712\n\t\/\/ Redirect the CRT standard input, output, and error handles to the console\n#pragma warning(push)\n#pragma warning(disable: 4996)\n\tfreopen(\"CONIN$\", \"r\", stdin);\n\tfreopen(\"CONOUT$\", \"w\", stdout);\n\tfreopen(\"CONOUT$\", \"w\", stderr);\n#pragma warning(pop)\n\n\t\/\/Clear the error state for each of the C++ standard stream objects. We need to do this, as\n\t\/\/attempts to access the standard streams before they refer to a valid target will cause the\n\t\/\/iostream objects to enter an error state. In versions of Visual Studio after 2005, this seems\n\t\/\/to always occur during startup regardless of whether anything has been read from or written to\n\t\/\/the console or not.\n\tstd::wcout.clear();\n\tstd::cout.clear();\n\tstd::wcerr.clear();\n\tstd::cerr.clear();\n\tstd::wcin.clear();\n\tstd::cin.clear();\n}\n\nHalley::ComputerData Halley::OSWin32::getComputerData()\n{\n\tComputerData data;\n\n\tTCHAR chrComputerName[MAX_COMPUTERNAME_LENGTH + 1];\n\tDWORD dwBufferSize = MAX_COMPUTERNAME_LENGTH + 1;\n\tif (GetComputerName(chrComputerName, &dwBufferSize)) data.computerName = String(chrComputerName);\n\n\tTCHAR name[UNLEN + 1];\n\tDWORD dwBufferSize2 = UNLEN + 1;\n\tif (GetUserName(name, &dwBufferSize2)) data.userName = String(name);\n\n\tString os = runWMIQuery(\"SELECT * FROM Win32_OperatingSystem\", \"Caption\");\n\tString servPack = runWMIQuery(\"SELECT * FROM Win32_OperatingSystem\", \"CSDVersion\");\n\tString osArch = \"Unknown\";\n\tif (!os.contains(\"Windows XP\") && !os.contains(\"2003\") && !os.contains(\"2000\")) osArch = runWMIQuery(\"SELECT * FROM Win32_OperatingSystem\", \"OSArchitecture\");\n\tdata.osName = os.trimBoth();\n\tif (osArch != \"Unknown\") data.osName += \" \" + osArch.trimBoth();\n\tif (servPack != \"Unknown\") data.osName += \" \" + servPack.trimBoth();\n\tdata.cpuName = runWMIQuery(\"SELECT * FROM Win32_Processor\", \"Name\");\n\tdata.gpuName = runWMIQuery(\"SELECT * FROM Win32_DisplayConfiguration\", \"DeviceName\");\n\tdata.RAM = runWMIQuery(\"SELECT * FROM Win32_OperatingSystem\", \"TotalVisibleMemorySize\").toInteger64() * 1024;\n\n\treturn data;\n}\n\nHalley::String Halley::OSWin32::getUserDataDir()\n{\n\tTCHAR path[MAX_PATH];\n\tSHGetFolderPath(nullptr, CSIDL_APPDATA, nullptr, 0, path);\n\treturn String(path) + \"\\\\\";\n}\n\nPath OSWin32::parseProgramPath(const String&)\n{\n\tHMODULE hModule = GetModuleHandleW(nullptr);\n\tWCHAR path[MAX_PATH];\n\tGetModuleFileNameW(hModule, path, MAX_PATH);\n\tString programPath(path);\n\treturn Path(programPath).parentPath() \/ \".\";\n}\n\nvoid Halley::OSWin32::setConsoleColor(int foreground, int background)\n{\n\tif (foreground == -1) {\n\t\tforeground = 7;\n\t}\n\tif (background == -1) {\n\t\tbackground = 0;\n\t}\n\n\tHANDLE hConsole = GetStdHandle(STD_OUTPUT_HANDLE);\n\tSetConsoleTextAttribute(hConsole, WORD(foreground | (background << 4)));\n}\n\nstatic bool hasDirectory(const Path& directory) {\n DWORD res = GetFileAttributesW(directory.getString().getUTF16().c_str());\n return res != INVALID_FILE_ATTRIBUTES && (res & FILE_ATTRIBUTE_DIRECTORY) != 0;\n}\n\nvoid OSWin32::createDirectories(const Path& path)\n{\n\tsize_t n = path.getNumberPaths();\n\tfor (size_t i = 1; i < n; ++i) {\n\t\tPath curPath = path.getFront(i);\n\t\tif (!hasDirectory(curPath)) {\n\t\t\tif (!CreateDirectoryW(curPath.getString().getUTF16().c_str(), 0)) {\n\t\t\t\tthrow Exception(\"Unable to create directory: \" + curPath + \" (trying to make \" + path + \")\");\n\t\t\t}\n\t\t}\n\t}\n}\n\nint OSWin32::runCommand(String command)\n{\n\tchar buffer[1024];\n\tstrcpy_s(buffer, 1024, command.c_str());\n\tbuffer[command.size()] = 0;\n\n\tSTARTUPINFO si;\n PROCESS_INFORMATION pi;\n\tDWORD exitCode = -2;\n\n\tmemset(&si, 0, sizeof(STARTUPINFO));\n\tmemset(&pi, 0, sizeof(PROCESS_INFORMATION));\n\n\tif (!CreateProcessA(nullptr, buffer, nullptr, nullptr, false, 0, nullptr, nullptr, &si, &pi)) {\n\t\treturn -1;\n\t}\n\tWaitForSingleObject(pi.hProcess, INFINITE);\n\tGetExitCodeProcess(pi.hProcess, &exitCode);\n\tCloseHandle(pi.hProcess);\n\tCloseHandle(pi.hThread);\n\n\treturn int(exitCode);\n}\n\n#endif\n<commit_msg>Don't create console window when spawning console programs.<commit_after>\/*****************************************************************\\\n __\n \/ \/\n\t\t \/ \/ __ __\n\t\t\/ \/______ _______ \/ \/ \/ \/ ________ __ __\n\t \/ ______ \\ \/_____ \\ \/ \/ \/ \/ \/ _____ | \/ \/ \/ \/\n\t \/ \/ | \/ _______| \/ \/ \/ \/ \/ \/ \/____\/ \/ \/ \/ \/ \/\n\t \/ \/ \/ \/ \/ _____ \/ \/ \/ \/ \/ \/ _______\/ \/ \/ \/ \/\n\t\/ \/ \/ \/ \/ \/____\/ \/ \/ \/ \/ \/ \/ |______ \/ |______\/ \/\n \/_\/ \/_\/ |________\/ \/ \/ \/ \/ \\_______\/ \\_______ \/\n \/_\/ \/_\/ \/ \/\n\t\t\t \/ \/\n\t\t High Level Game Framework \/_\/\n\n ---------------------------------------------------------------\n\n Copyright (c) 2007-2011 - Rodrigo Braz Monteiro.\n This file is subject to the terms of halley_license.txt.\n\n\\*****************************************************************\/\n\n#include \"halley\/text\/string_converter.h\"\n#ifdef _WIN32\n#include \"halley\/support\/exception.h\"\n\n#pragma warning(disable: 6387)\n#include \"os_win32.h\"\n\n#include <iostream>\n#include <winuser.h>\n#include <Lmcons.h>\n#include <Shlobj.h>\n#include <fcntl.h>\n#include <io.h>\n#include <comutil.h>\n#include <objbase.h>\n#include <atlbase.h>\n\n#pragma comment(lib, \"wbemuuid.lib\")\n\/\/#pragma comment(lib, \"comsupp.lib\")\n#pragma comment(lib, \"comsuppw.lib\")\n\n\nusing namespace Halley;\n\nHalley::OSWin32::OSWin32()\n\t: pLoc(nullptr)\n\t, pSvc(nullptr)\n{\n\t\/\/ From http:\/\/msdn.microsoft.com\/en-us\/library\/aa389762(v=VS.85).aspx\n\t\/\/ \"Creating a WMI Application Using C++\"\n\n\ttry {\n\t\t\/\/ Initialize COM\n\t\tHRESULT hr;\n\t\thr = CoInitializeEx(nullptr, COINIT_APARTMENTTHREADED);\n\t\tif (FAILED(hr)) throw Exception(\"Unable to initialize COM.\");\n\t\thr = CoInitializeSecurity(nullptr, -1, nullptr, nullptr, RPC_C_AUTHN_LEVEL_DEFAULT, RPC_C_IMP_LEVEL_IMPERSONATE, nullptr, EOAC_NONE, nullptr);\n\t\tif (FAILED(hr)) throw Exception(\"Unable to initialize COM security.\");\n\n\t\t\/\/ Initialize WMI\n\t\thr = CoCreateInstance(CLSID_WbemAdministrativeLocator, nullptr, CLSCTX_INPROC_SERVER, IID_IWbemLocator, reinterpret_cast<void**>(&pLoc));\n\t\tif (FAILED(hr)) throw Exception(\"Unable to obtain locator\");\n\t\t\/\/hr = pLoc->ConnectServer(BSTR(L\"ROOT\\\\DEFAULT\"), nullptr, nullptr, 0, 0, 0, 0, &pSvc);\n\t\thr = pLoc->ConnectServer( L\"root\\\\cimv2\", nullptr, nullptr, nullptr, WBEM_FLAG_CONNECT_USE_MAX_WAIT, nullptr, nullptr, &pSvc);\n\t\tif (FAILED(hr)) throw Exception(\"Unable to connect to WMI service\");\n\n\t\t\/\/ Set security on WMI connection\n\t\thr = CoSetProxyBlanket(pSvc, RPC_C_AUTHN_WINNT, RPC_C_AUTHZ_NONE, nullptr, RPC_C_AUTHN_LEVEL_CALL, RPC_C_IMP_LEVEL_IMPERSONATE, nullptr, EOAC_NONE);\n\t\tif (FAILED(hr)) throw Exception(\"Unable to set WMI security\");\n\t} catch (std::exception& e) {\n\t\tstd::cout << \"Exception initializing COM\/WMI: \" << e.what() << std::endl;\n\t\tpSvc = nullptr;\n\t\tpLoc = nullptr;\n\t} catch (...) {\n\t\tstd::cout << \"Unknown exception initializing COM\/WMI.\";\n\t\tpSvc = nullptr;\n\t\tpLoc = nullptr;\n\t}\n\n\t\/\/ Load icon\n\tHINSTANCE handle = ::GetModuleHandle(nullptr);\n\ticon = ::LoadIcon(handle, \"IDI_MAIN_ICON\");\n}\n\nHalley::OSWin32::~OSWin32()\n{\n\tif (pSvc) {\n\t\tpSvc->Release();\n\t\tpLoc->Release();\n\t\tCoUninitialize();\n\t}\n}\n\nstatic String getCOMError(int hr)\n{\n\tIErrorInfo* info;\n\tHRESULT hr2 = GetErrorInfo(0, &info);\n\tif (FAILED(hr2)) return \"Failed getting COM error.\";\n\tBSTR str;\n\tinfo->GetDescription(&str);\n\t_bstr_t tmp(str);\n\treturn \"\\\"\" + String(LPCSTR(tmp)) + \"\\\", code 0x\"+ toString(hr, 16);\n}\n\nHalley::String Halley::OSWin32::runWMIQuery(String query, String parameter) const\n{\n\t\/\/ See:\n\t\/\/ http:\/\/www.codeproject.com\/KB\/system\/UsingWMI.aspx\n\t\/\/ http:\/\/www.codeproject.com\/KB\/system\/Using_WMI_in_Visual_C__.aspx\n\n\tif (pSvc) {\n\t\ttry {\n\t\t\tHRESULT hr;\n\t\t\tCComPtr<IEnumWbemClassObject> enumerator;\n\t\t\tBSTR lang = CComBSTR(L\"WQL\");\n\t\t\tBSTR q = CComBSTR(query.c_str());\n\t\t\thr = pSvc->ExecQuery(lang, q, WBEM_FLAG_FORWARD_ONLY, nullptr, &enumerator);\n\t\t\tif (FAILED(hr)) throw Exception(\"Error running WMI query: \"+getCOMError(hr));\n\n\t\t\tULONG retcnt;\n\t\t\tCComPtr<IWbemClassObject> result;\n\t\t\thr = enumerator->Next(WBEM_INFINITE, 1L, &result, &retcnt);\n\t\t\tif (retcnt == 0) return \"Unknown\";\n\t\t\tif (FAILED(hr)) throw Exception(\"Error obtaining WMI enumeration\");\n\n\t\t\t_variant_t var_val;\n\t\t\thr = result->Get(parameter.getUTF16().c_str(), 0, &var_val, nullptr, nullptr);\n\t\t\tif (FAILED(hr)) throw Exception(\"Error retrieving name from WMI query result\");\n\n\t\t\tif (var_val.vt == VT_NULL) {\n\t\t\t\treturn \"\";\n\t\t\t} else {\n\t\t\t\treturn String(static_cast<const char*>(_bstr_t(var_val)));\n\t\t\t}\n\t\t} catch (std::exception& e) {\n\t\t\tstd::cout << \"Exception running WMI query: \" << e.what() << std::endl;\n\t\t} catch (...) {\n\t\t\tstd::cout << \"Unknown exception running WMI query.\" << std::endl;\n\t\t}\n\t}\n\treturn \"Unknown\";\n}\n\n\n\nstruct MonitorInfo {\npublic:\n\tint n;\n\tint x, y, w, h;\n};\n\nBOOL CALLBACK onMonitorInfo(HMONITOR \/*hMonitor*\/, HDC \/*hdcMonitor*\/, LPRECT lprcMonitor, LPARAM dwData)\n{\n\tMonitorInfo* info = reinterpret_cast<MonitorInfo*>(dwData);\n\tinfo->n++;\n\tinfo->x = lprcMonitor->left;\n\tinfo->y = lprcMonitor->top;\n\tinfo->w = lprcMonitor->right - lprcMonitor->left;\n\tinfo->h = lprcMonitor->bottom - lprcMonitor->top;\n\treturn (info->n != 2);\n}\n\nvoid OSWin32::loadWindowIcon(HWND hwnd)\n{\n\tif (icon != nullptr) {\n\t\t::SetClassLongPtr(hwnd, GCLP_HICON, reinterpret_cast<LONG_PTR>(icon));\n\t\t::SendMessage(hwnd, WM_SETICON, ICON_SMALL, reinterpret_cast<LPARAM>(icon));\n\t}\n}\n\nvoid OSWin32::onWindowCreated(void* window)\n{\n\tloadWindowIcon(reinterpret_cast<HWND>(window));\n}\n\nvoid Halley::OSWin32::createLogConsole(String winTitle)\n{\n\tAllocConsole();\n\tSetConsoleTitle(winTitle.c_str());\n\n\t\/\/ Icon\n\tHWND con = GetConsoleWindow();\n\tloadWindowIcon(con);\n\n\t\/\/ Position console\n\tMonitorInfo info;\n\tinfo.n = 0;\n\tEnumDisplayMonitors(nullptr, nullptr, onMonitorInfo, LPARAM(&info));\n\tif (info.n > 1) {\n\t\tRECT rect;\n\t\tGetWindowRect(con, &rect);\n\t\tint w = rect.right - rect.left;\n\t\tint h = info.h;\n\t\t\/\/MoveWindow(con, (info.w - w)\/2 + info.x, (info.h - h)\/2 + info.h, w, h, true);\n\t\tSetWindowPos(con, HWND_TOP, (info.w - w)\/2 + info.x, (info.h - h)\/2 + info.y, w, h, 0);\n\t}\n}\n\nvoid OSWin32::initializeConsole()\n{\n\t\/\/ From http:\/\/stackoverflow.com\/a\/25927081\/546712\n\t\/\/ Redirect the CRT standard input, output, and error handles to the console\n#pragma warning(push)\n#pragma warning(disable: 4996)\n\tfreopen(\"CONIN$\", \"r\", stdin);\n\tfreopen(\"CONOUT$\", \"w\", stdout);\n\tfreopen(\"CONOUT$\", \"w\", stderr);\n#pragma warning(pop)\n\n\t\/\/Clear the error state for each of the C++ standard stream objects. We need to do this, as\n\t\/\/attempts to access the standard streams before they refer to a valid target will cause the\n\t\/\/iostream objects to enter an error state. In versions of Visual Studio after 2005, this seems\n\t\/\/to always occur during startup regardless of whether anything has been read from or written to\n\t\/\/the console or not.\n\tstd::wcout.clear();\n\tstd::cout.clear();\n\tstd::wcerr.clear();\n\tstd::cerr.clear();\n\tstd::wcin.clear();\n\tstd::cin.clear();\n}\n\nHalley::ComputerData Halley::OSWin32::getComputerData()\n{\n\tComputerData data;\n\n\tTCHAR chrComputerName[MAX_COMPUTERNAME_LENGTH + 1];\n\tDWORD dwBufferSize = MAX_COMPUTERNAME_LENGTH + 1;\n\tif (GetComputerName(chrComputerName, &dwBufferSize)) data.computerName = String(chrComputerName);\n\n\tTCHAR name[UNLEN + 1];\n\tDWORD dwBufferSize2 = UNLEN + 1;\n\tif (GetUserName(name, &dwBufferSize2)) data.userName = String(name);\n\n\tString os = runWMIQuery(\"SELECT * FROM Win32_OperatingSystem\", \"Caption\");\n\tString servPack = runWMIQuery(\"SELECT * FROM Win32_OperatingSystem\", \"CSDVersion\");\n\tString osArch = \"Unknown\";\n\tif (!os.contains(\"Windows XP\") && !os.contains(\"2003\") && !os.contains(\"2000\")) osArch = runWMIQuery(\"SELECT * FROM Win32_OperatingSystem\", \"OSArchitecture\");\n\tdata.osName = os.trimBoth();\n\tif (osArch != \"Unknown\") data.osName += \" \" + osArch.trimBoth();\n\tif (servPack != \"Unknown\") data.osName += \" \" + servPack.trimBoth();\n\tdata.cpuName = runWMIQuery(\"SELECT * FROM Win32_Processor\", \"Name\");\n\tdata.gpuName = runWMIQuery(\"SELECT * FROM Win32_DisplayConfiguration\", \"DeviceName\");\n\tdata.RAM = runWMIQuery(\"SELECT * FROM Win32_OperatingSystem\", \"TotalVisibleMemorySize\").toInteger64() * 1024;\n\n\treturn data;\n}\n\nHalley::String Halley::OSWin32::getUserDataDir()\n{\n\tTCHAR path[MAX_PATH];\n\tSHGetFolderPath(nullptr, CSIDL_APPDATA, nullptr, 0, path);\n\treturn String(path) + \"\\\\\";\n}\n\nPath OSWin32::parseProgramPath(const String&)\n{\n\tHMODULE hModule = GetModuleHandleW(nullptr);\n\tWCHAR path[MAX_PATH];\n\tGetModuleFileNameW(hModule, path, MAX_PATH);\n\tString programPath(path);\n\treturn Path(programPath).parentPath() \/ \".\";\n}\n\nvoid Halley::OSWin32::setConsoleColor(int foreground, int background)\n{\n\tif (foreground == -1) {\n\t\tforeground = 7;\n\t}\n\tif (background == -1) {\n\t\tbackground = 0;\n\t}\n\n\tHANDLE hConsole = GetStdHandle(STD_OUTPUT_HANDLE);\n\tSetConsoleTextAttribute(hConsole, WORD(foreground | (background << 4)));\n}\n\nstatic bool hasDirectory(const Path& directory) {\n DWORD res = GetFileAttributesW(directory.getString().getUTF16().c_str());\n return res != INVALID_FILE_ATTRIBUTES && (res & FILE_ATTRIBUTE_DIRECTORY) != 0;\n}\n\nvoid OSWin32::createDirectories(const Path& path)\n{\n\tsize_t n = path.getNumberPaths();\n\tfor (size_t i = 1; i < n; ++i) {\n\t\tPath curPath = path.getFront(i);\n\t\tif (!hasDirectory(curPath)) {\n\t\t\tif (!CreateDirectoryW(curPath.getString().getUTF16().c_str(), 0)) {\n\t\t\t\tthrow Exception(\"Unable to create directory: \" + curPath + \" (trying to make \" + path + \")\");\n\t\t\t}\n\t\t}\n\t}\n}\n\nint OSWin32::runCommand(String command)\n{\n\tchar buffer[1024];\n\tstrcpy_s(buffer, 1024, command.c_str());\n\tbuffer[command.size()] = 0;\n\n\tSTARTUPINFO si;\n PROCESS_INFORMATION pi;\n\tDWORD exitCode = -2;\n\n\tmemset(&si, 0, sizeof(STARTUPINFO));\n\tmemset(&pi, 0, sizeof(PROCESS_INFORMATION));\n\n\tif (!CreateProcessA(nullptr, buffer, nullptr, nullptr, false, CREATE_NO_WINDOW, nullptr, nullptr, &si, &pi)) {\n\t\treturn -1;\n\t}\n\tWaitForSingleObject(pi.hProcess, INFINITE);\n\tGetExitCodeProcess(pi.hProcess, &exitCode);\n\tCloseHandle(pi.hProcess);\n\tCloseHandle(pi.hThread);\n\n\treturn int(exitCode);\n}\n\n#endif\n<|endoftext|>"} {"text":"<commit_before>#include <iostream>\n\n#include \"sash\/sash.hpp\"\n#include \"sash\/libedit_backend.hpp\" \/\/ our backend\n#include \"sash\/variables_engine.hpp\"\n\nusing namespace std;\n\nint main()\n{\n using char_iter = string::const_iterator;\n using sash::command_result;\n sash::sash<sash::libedit_backend>::type cli;\n string line;\n auto mptr = cli.mode_add(\"default\", \"SASH> \", sash::color::blue);\n cli.mode_push(\"default\");\n cli.add_preprocessor(sash::variables_engine<>::create());\n bool done = false;\n mptr->add_all({\n {\n \"quit\", \"terminates the whole thing\",\n [&](string& err, char_iter first, char_iter last) -> command_result\n {\n if (first == last)\n {\n done = true;\n return sash::executed;\n }\n err = \"quit: to many arguments (none expected)\";\n return sash::no_command;\n }\n },\n {\n \"echo\", \"prints its arguments\",\n [](string&, char_iter first, char_iter last) -> command_result\n {\n copy(first, last, ostream_iterator<char>(cout));\n cout << endl;\n return sash::executed;\n }\n },\n {\n \"help\", \"prints this text\",\n [&](string& err, char_iter first, char_iter last) -> command_result\n {\n if (first == last)\n {\n \/\/ doin' it complicated!\n std::string cmd = \"echo \";\n cmd += cli.current_mode().help();\n return cli.process(cmd);\n }\n err = \"help: to many arguments (none expected)\";\n return sash::no_command;\n }\n }});\n while (!done)\n {\n cli.read_line(line);\n switch (cli.process(line))\n {\n default:\n break;\n case sash::nop:\n break;\n case sash::executed:\n cli.append_to_history(line);\n break;\n case sash::no_command:\n cout << cli.last_error() << endl;\n break;\n }\n }\n}\n<commit_msg>Print errors in red in the simple shell example<commit_after>#include <iostream>\n\n#include \"sash\/sash.hpp\"\n#include \"sash\/libedit_backend.hpp\" \/\/ our backend\n#include \"sash\/variables_engine.hpp\"\n\nusing namespace std;\n\nint main()\n{\n using char_iter = string::const_iterator;\n using sash::command_result;\n sash::sash<sash::libedit_backend>::type cli;\n string line;\n auto mptr = cli.mode_add(\"default\", \"SASH> \", sash::color::blue);\n cli.mode_push(\"default\");\n cli.add_preprocessor(sash::variables_engine<>::create());\n bool done = false;\n mptr->add_all({\n {\n \"quit\", \"terminates the whole thing\",\n [&](string& err, char_iter first, char_iter last) -> command_result\n {\n if (first == last)\n {\n done = true;\n return sash::executed;\n }\n err = \"quit: to many arguments (none expected)\";\n return sash::no_command;\n }\n },\n {\n \"echo\", \"prints its arguments\",\n [](string&, char_iter first, char_iter last) -> command_result\n {\n copy(first, last, ostream_iterator<char>(cout));\n cout << endl;\n return sash::executed;\n }\n },\n {\n \"help\", \"prints this text\",\n [&](string& err, char_iter first, char_iter last) -> command_result\n {\n if (first == last)\n {\n \/\/ doin' it complicated!\n std::string cmd = \"echo \";\n cmd += cli.current_mode().help();\n return cli.process(cmd);\n }\n err = \"help: to many arguments (none expected)\";\n return sash::no_command;\n }\n }});\n while (!done)\n {\n cli.read_line(line);\n switch (cli.process(line))\n {\n default:\n break;\n case sash::nop:\n break;\n case sash::executed:\n cli.append_to_history(line);\n break;\n case sash::no_command:\n cout << sash::color::red\n << cli.last_error()\n << sash::color::reset\n << endl;\n break;\n }\n }\n}\n<|endoftext|>"} {"text":"<commit_before>#pragma once\r\n\/\/=====================================================================\/\/\r\n\/*!\t@file\r\n\t@brief\t１２×１２漢字フォント・クラス\r\n\t@author\t平松邦仁 (hira@rvf-rc45.net)\r\n*\/\r\n\/\/=====================================================================\/\/\r\n#include <cstdint>\r\n#include \"ff12a\/src\/ff.h\"\r\n\r\n\/\/ #include \"common\/format.hpp\"\r\n\r\nnamespace graphics {\r\n\r\n\t\/\/+++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++\/\/\r\n\t\/*!\r\n\t\t@brief\t漢字フォント・クラス\r\n\t*\/\r\n\t\/\/+++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++\/\/\r\n\ttemplate <uint8_t CASH_SIZE>\r\n\tclass kfont12 {\r\n\r\n\t\tstruct kanji_cash {\r\n\t\t\tuint16_t\tcode;\r\n\t\t\tuint8_t\t\tbitmap[18];\r\n\t\t};\r\n\t\tkanji_cash cash_[CASH_SIZE];\r\n\t\tuint8_t cash_idx_;\r\n\r\n\t\tbool\tmount_;\r\n\r\n\t\tstatic uint16_t sjis_to_liner_(uint16_t sjis)\r\n\t\t{\r\n\t\t\tuint16_t code;\r\n\t\t\tuint8_t up = sjis >> 8;\r\n\t\t\tuint8_t lo = sjis & 0xff;\r\n\t\t\tif(0x81 <= up && up <= 0x9f) {\r\n\t\t\t\tcode = up - 0x81;\r\n\t\t\t} else if(0xe0 <= up && up <= 0xef) {\r\n\t\t\t\tcode = (0x9f + 1 - 0x81) + up - 0xe0;\r\n\t\t\t} else {\r\n\t\t\t\treturn 0xffff;\r\n\t\t\t}\r\n\t\t\tuint16_t loa = (0x7e + 1 - 0x40) + (0xfc + 1 - 0x80);\r\n\t\t\tif(0x40 <= lo && lo <= 0x7e) {\r\n\t\t\t\tcode *= loa;\r\n\t\t\t\tcode += lo - 0x40;\r\n\t\t\t} else if(0x80 <= lo && lo <= 0xfc) {\r\n\t\t\t\tcode *= loa;\r\n\t\t\t\tcode += 0x7e + 1 - 0x40;\r\n\t\t\t\tcode += lo - 0x80;\r\n\t\t\t} else {\r\n\t\t\t\treturn 0xffff;\r\n\t\t\t}\r\n\t\t\treturn code;\r\n\t\t}\r\n\r\n\tpublic:\r\n\t\t\/\/-----------------------------------------------------------------\/\/\r\n\t\t\/*!\r\n\t\t\t@brief\tコンストラクター\r\n\t\t*\/\r\n\t\t\/\/-----------------------------------------------------------------\/\/\r\n\t\tkfont12() : cash_idx_(0), mount_(false) {\r\n\t\t\tfor(uint8_t i = 0; i < CASH_SIZE; ++i) {\r\n\t\t\t\tcash_[i].code = 0;\r\n\t\t\t}\r\n\t\t}\r\n\r\n\r\n\t\t\/\/-----------------------------------------------------------------\/\/\r\n\t\t\/*!\r\n\t\t\t@brief\t文字の横幅\r\n\t\t*\/\r\n\t\t\/\/-----------------------------------------------------------------\/\/\r\n\t\tstatic const int8_t width = 12;\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\tstatic const int8_t height = 12;\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 set_mount(bool f) { mount_ = f; }\r\n\r\n\r\n\t\t\/\/-----------------------------------------------------------------\/\/\r\n\t\t\/*!\r\n\t\t\t@brief\t文字のビットマップを取得\r\n\t\t\t@param[in]\tcode\t文字コード（unicode）\r\n\t\t\t@return 文字のビットマップ\r\n\t\t*\/\r\n\t\t\/\/-----------------------------------------------------------------\/\/\r\n\t\tconst uint8_t* get(uint16_t code) {\r\n\r\n\t\t\tif(code == 0) return nullptr;\r\n\r\n\t\t\t\/\/ キャッシュ内検索\r\n\t\t\tint8_t n = -1;\r\n\t\t\tfor(uint8_t i = 0; i < CASH_SIZE; ++i) {\r\n\t\t\t\tif(cash_[i].code == code) {\r\n\t\t\t\t\treturn &cash_[i].bitmap[0];\r\n\t\t\t\t} else if(cash_[i].code == 0) {\r\n\t\t\t\t\tn = i;\r\n\t\t\t\t}\r\n\t\t\t}\r\n\t\t\tif(n >= 0) cash_idx_ = n;\r\n\t\t\telse {\r\n\t\t\t\tfor(uint8_t i = 0; i < CASH_SIZE; ++i) {\r\n\t\t\t\t\t++cash_idx_;\r\n\t\t\t\t\tif(cash_idx_ >= CASH_SIZE) cash_idx_ = 0;\r\n\t\t\t\t\tif(cash_[cash_idx_].code != 0) {\r\n\t\t\t\t\t\tbreak;\r\n\t\t\t\t\t}\r\n\t\t\t\t}\r\n\t\t\t}\r\n\r\n\t\t\tif(!mount_) return nullptr;\r\n\r\n\t\t\tuint32_t lin = sjis_to_liner_(ff_convert(code, 0));\r\n\r\n\t\t\tif(lin == 0xffff) {\r\n\t\t\t\treturn nullptr;\r\n\t\t\t}\r\n\r\n\t\t\tFIL fp;\r\n\t\t\tif(f_open(&fp, \"\/kfont12.bin\", FA_READ) != FR_OK) {\r\n\/\/\t\t\t\tutils::format(\"Open error\\n\");\r\n\t\t\t\treturn nullptr;\r\n\t\t\t}\r\n \r\n\t\t\tif(f_lseek(&fp, lin * 18) != FR_OK) {\r\n\t\t\t\tf_close(&fp);\r\n\/\/\t\t\t\tutils::format(\"Seek error\\n\");\r\n\t\t\t\treturn nullptr;\r\n\t\t\t}\r\n\r\n\t\t\tUINT rs;\r\n\t\t\tif(f_read(&fp, &cash_[cash_idx_].bitmap[0], 18, &rs) != FR_OK) {\r\n\t\t\t\tf_close(&fp);\r\n\/\/\t\t\t\tutils::format(\"Read error\\n\");\r\n\t\t\t\treturn nullptr;\r\n\t\t\t}\r\n\t\t\tcash_[cash_idx_].code = code;\r\n\r\n\t\t\tf_close(&fp);\r\n\r\n\t\t\treturn &cash_[cash_idx_].bitmap[0];\r\n\t\t}\r\n\t};\r\n}\r\n<commit_msg>update comment<commit_after>#pragma once\r\n\/\/=====================================================================\/\/\r\n\/*!\t@file\r\n\t@brief\t１２×１２漢字フォント・クラス\r\n\t@author\t平松邦仁 (hira@rvf-rc45.net)\r\n*\/\r\n\/\/=====================================================================\/\/\r\n#include <cstdint>\r\n#include \"ff12a\/src\/ff.h\"\r\n\r\nnamespace graphics {\r\n\r\n\t\/\/+++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++\/\/\r\n\t\/*!\r\n\t\t@brief\t漢字フォント・クラス\r\n\t*\/\r\n\t\/\/+++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++\/\/\r\n\ttemplate <uint8_t CASH_SIZE>\r\n\tclass kfont12 {\r\n\r\n\t\tstruct kanji_cash {\r\n\t\t\tuint16_t\tcode;\r\n\t\t\tuint8_t\t\tbitmap[18];\r\n\t\t};\r\n\t\tkanji_cash cash_[CASH_SIZE];\r\n\t\tuint8_t cash_idx_;\r\n\r\n\t\tbool\tmount_;\r\n\r\n\t\tstatic uint16_t sjis_to_liner_(uint16_t sjis)\r\n\t\t{\r\n\t\t\tuint16_t code;\r\n\t\t\tuint8_t up = sjis >> 8;\r\n\t\t\tuint8_t lo = sjis & 0xff;\r\n\t\t\tif(0x81 <= up && up <= 0x9f) {\r\n\t\t\t\tcode = up - 0x81;\r\n\t\t\t} else if(0xe0 <= up && up <= 0xef) {\r\n\t\t\t\tcode = (0x9f + 1 - 0x81) + up - 0xe0;\r\n\t\t\t} else {\r\n\t\t\t\treturn 0xffff;\r\n\t\t\t}\r\n\t\t\tuint16_t loa = (0x7e + 1 - 0x40) + (0xfc + 1 - 0x80);\r\n\t\t\tif(0x40 <= lo && lo <= 0x7e) {\r\n\t\t\t\tcode *= loa;\r\n\t\t\t\tcode += lo - 0x40;\r\n\t\t\t} else if(0x80 <= lo && lo <= 0xfc) {\r\n\t\t\t\tcode *= loa;\r\n\t\t\t\tcode += 0x7e + 1 - 0x40;\r\n\t\t\t\tcode += lo - 0x80;\r\n\t\t\t} else {\r\n\t\t\t\treturn 0xffff;\r\n\t\t\t}\r\n\t\t\treturn code;\r\n\t\t}\r\n\r\n\tpublic:\r\n\t\t\/\/-----------------------------------------------------------------\/\/\r\n\t\t\/*!\r\n\t\t\t@brief\tコンストラクター\r\n\t\t*\/\r\n\t\t\/\/-----------------------------------------------------------------\/\/\r\n\t\tkfont12() : cash_idx_(0), mount_(false) {\r\n\t\t\tfor(uint8_t i = 0; i < CASH_SIZE; ++i) {\r\n\t\t\t\tcash_[i].code = 0;\r\n\t\t\t}\r\n\t\t}\r\n\r\n\r\n\t\t\/\/-----------------------------------------------------------------\/\/\r\n\t\t\/*!\r\n\t\t\t@brief\t文字の横幅\r\n\t\t*\/\r\n\t\t\/\/-----------------------------------------------------------------\/\/\r\n\t\tstatic const int8_t width = 12;\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\tstatic const int8_t height = 12;\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 set_mount(bool f) { mount_ = f; }\r\n\r\n\r\n\t\t\/\/-----------------------------------------------------------------\/\/\r\n\t\t\/*!\r\n\t\t\t@brief\t文字のビットマップを取得\r\n\t\t\t@param[in]\tcode\t文字コード（unicode）\r\n\t\t\t@return 文字のビットマップ\r\n\t\t*\/\r\n\t\t\/\/-----------------------------------------------------------------\/\/\r\n\t\tconst uint8_t* get(uint16_t code) {\r\n\r\n\t\t\tif(code == 0) return nullptr;\r\n\r\n\t\t\t\/\/ キャッシュ内検索\r\n\t\t\tint8_t n = -1;\r\n\t\t\tfor(uint8_t i = 0; i < CASH_SIZE; ++i) {\r\n\t\t\t\tif(cash_[i].code == code) {\r\n\t\t\t\t\treturn &cash_[i].bitmap[0];\r\n\t\t\t\t} else if(cash_[i].code == 0) {\r\n\t\t\t\t\tn = i;\r\n\t\t\t\t}\r\n\t\t\t}\r\n\t\t\tif(n >= 0) cash_idx_ = n;\r\n\t\t\telse {\r\n\t\t\t\tfor(uint8_t i = 0; i < CASH_SIZE; ++i) {\r\n\t\t\t\t\t++cash_idx_;\r\n\t\t\t\t\tif(cash_idx_ >= CASH_SIZE) cash_idx_ = 0;\r\n\t\t\t\t\tif(cash_[cash_idx_].code != 0) {\r\n\t\t\t\t\t\tbreak;\r\n\t\t\t\t\t}\r\n\t\t\t\t}\r\n\t\t\t}\r\n\r\n\t\t\tif(!mount_) return nullptr;\r\n\r\n\t\t\tuint32_t lin = sjis_to_liner_(ff_convert(code, 0));\r\n\r\n\t\t\tif(lin == 0xffff) {\r\n\t\t\t\treturn nullptr;\r\n\t\t\t}\r\n\r\n\t\t\tFIL fp;\r\n\t\t\tif(f_open(&fp, \"\/kfont12.bin\", FA_READ) != FR_OK) {\r\n\t\t\t\treturn nullptr;\r\n\t\t\t}\r\n \r\n\t\t\tif(f_lseek(&fp, lin * 18) != FR_OK) {\r\n\t\t\t\tf_close(&fp);\r\n\t\t\t\treturn nullptr;\r\n\t\t\t}\r\n\r\n\t\t\tUINT rs;\r\n\t\t\tif(f_read(&fp, &cash_[cash_idx_].bitmap[0], 18, &rs) != FR_OK) {\r\n\t\t\t\tf_close(&fp);\r\n\t\t\t\treturn nullptr;\r\n\t\t\t}\r\n\t\t\tcash_[cash_idx_].code = code;\r\n\r\n\t\t\tf_close(&fp);\r\n\r\n\t\t\treturn &cash_[cash_idx_].bitmap[0];\r\n\t\t}\r\n\t};\r\n}\r\n<|endoftext|>"} {"text":"<commit_before>#pragma once\n\/\/=====================================================================\/\/\n\/*!\t@file\n\t@brief\tRX グループ・RSPI I\/O 制御\n @author 平松邦仁 (hira@rvf-rc45.net)\n\t@copyright\tCopyright (C) 2016, 2020 Kunihito Hiramatsu @n\n\t\t\t\tReleased under the MIT license @n\n\t\t\t\thttps:\/\/github.com\/hirakuni45\/RX\/blob\/master\/LICENSE\n*\/\n\/\/=====================================================================\/\/\n#include \"common\/renesas.hpp\"\n#include \"common\/vect.h\"\n\nnamespace device {\n\n\t\/\/+++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++\/\/\n\t\/*!\n\t\t@brief RSPI 制御クラス\n\t\t@param[in]\tRSPI\tRSPI 定義クラス\n\t\t@param[in]\tPSEL\tポート候補\n\t*\/\n\t\/\/+++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++\/\/\n\ttemplate <class RSPI, port_map::option PSEL = port_map::option::FIRST>\n\tclass rspi_io {\n\tpublic:\n\n\t\t\/\/+++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++\/\/\n\t\t\/*!\n\t\t\t@brief データ、クロック位相タイプ型\n\t\t\t\t\tTYPE1(MODE0): CPOL:0 CPHA:0 @n\n\t\t\t\t\tTYPE2(MODE1): CPOL:0 CPHA:1 @n\n\t\t\t\t\tTYPE3(MODE2): CPOL:1 CPHA:0 @n\n\t\t\t\t\tTYPE4(MODE3): CPOL:1 CPHA:1\n\t\t*\/\n\t\t\/\/+++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++\/\/\n\t\tenum class PHASE : uint8_t {\n\t\t\tTYPE1, \/\/\/< タイプ１\n\t\t\tTYPE2, \/\/\/< タイプ２\n\t\t\tTYPE3, \/\/\/< タイプ３\n\t\t\tTYPE4, \/\/\/< タイプ４ (SD カードアクセス）\n\t\t};\n\n\n\t\t\/\/+++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++\/\/\n\t\t\/*!\n\t\t\t@brief データ長型\n\t\t*\/\n\t\t\/\/+++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++\/\/\n\t\tenum class DLEN : uint8_t {\n\t\t\tW8 = 0b0111,\t\/\/\/< 8 Bits\n\t\t\tW9 = 0b1000,\t\/\/\/< 9 Bits\n\t\t\tW10 = 0b1001,\t\/\/\/< 10 Bits\n\t\t\tW11 = 0b1010,\t\/\/\/< 11 Bits\n\t\t\tW12 = 0b1011,\t\/\/\/< 12 Bits\n\t\t\tW13 = 0b1100,\t\/\/\/< 13 Bits\n\t\t\tW14 = 0b1101,\t\/\/\/< 14 Bits\n\t\t\tW15 = 0b1110,\t\/\/\/< 15 Bits\n\t\t\tW16 = 0b1111,\t\/\/\/< 16 Bits\n\t\t\tW20 = 0b0000,\t\/\/\/< 20 Bits\n\t\t\tW24 = 0b0001,\t\/\/\/< 24 Bits\n\t\t\tW32 = 0b0011,\t\/\/\/< 32 Bits\n\t\t};\n\n\tprivate:\n\n\t\tuint8_t\tlevel_;\n\n\t\t\/\/ 便宜上のスリープ\n\t\tvoid sleep_() { asm(\"nop\"); }\n\n\n\t\tbool clock_div_(uint32_t speed, uint8_t& brdv, uint8_t& spbr) {\n\/\/\/\t\t\tutils::format(\"PCLK: %d\\n\") % static_cast<uint32_t>(PCLK_);\n\t\t\tuint32_t br = static_cast<uint32_t>(RSPI::PCLK) \/ speed;\n\t\t\tuint8_t dv = 0;\n\t\t\twhile(br > 512) {\n\t\t\t\tbr >>= 1;\n\t\t\t\t++dv;\n\t\t\t\tif(dv > 3) {\n\t\t\t\t\tbrdv = 3;\n\t\t\t\t\tspbr = 255;\n\t\t\t\t\treturn false;\n\t\t\t\t}\n\t\t\t}\n\t\t\tbrdv = dv;\n\t\t\tif(br & 1) {\n\t\t\t\tbr >>= 1;\n\t\t\t\t++br;\n\t\t\t} else {\n\t\t\t\tbr >>= 1;\n\t\t\t}\n\t\t\tif(br) --br;\n\t\t\tspbr = br;\n\t\t\treturn true;\n\t\t}\n\n\tpublic:\n\t\t\/\/-----------------------------------------------------------------\/\/\n\t\t\/*!\n\t\t\t@brief コンストラクター\n\t\t*\/\n\t\t\/\/-----------------------------------------------------------------\/\/\n\t\trspi_io() noexcept : level_(0) { }\n\n\n\t\t\/\/-----------------------------------------------------------------\/\/\n\t\t\/*!\n\t\t\t@brief 設定可能な最大速度を返す @n\n\t\t\t\t\t・RX24T: 20MHz @n\n\t\t\t\t\t・RX64M: 40MHz\n\t\t\t@return 最大速度\n\t\t*\/\n\t\t\/\/-----------------------------------------------------------------\/\/\n\t\tuint32_t get_max_speed() const noexcept {\n\t\t\tuint32_t clk = RSPI::PCLK;\n#ifdef SEEDA\n\t\t\twhile(clk > 20000000) { \/\/ 15MHz\n\/\/\t\t\twhile(clk > 10000000) { \/\/ 7MHz\n#else\n\t\t\twhile(clk > 40000000) {\n#endif\n\t\t\t\tclk >>= 1;\n\t\t\t}\n\t\t\treturn clk;\n\t\t}\n\n\n\t\t\/\/-----------------------------------------------------------------\/\/\n\t\t\/*!\n\t\t\t@brief 通信速度を設定して、CSI を有効にする\n\t\t\t@param[in]\tspeed\t通信速度\n\t\t\t@param[in]\tctype\tクロック位相タイプ\n\t\t\t@param[in]\tdlen\tデータ長設定\n\t\t\t@param[in]\tlevel\t割り込みレベル（１～２）、０の場合はポーリング\n\t\t\t@return エラー（速度設定範囲外）なら「false」\n\t\t*\/\n\t\t\/\/-----------------------------------------------------------------\/\/\n\t\tbool start(uint32_t speed, PHASE ctype, DLEN dlen, uint8_t level = 0) noexcept\n\t\t{\n\t\t\tlevel_ = level;\n\n\t\t\tpower_mgr::turn(RSPI::PERIPHERAL);\n\n\t\t\t\/\/ デバイスを不許可\n\t\t\tRSPI::SPCR = 0x00;\n\n\t\t\t\/\/ ポートを有効にする\n\t\t\tport_map::turn(RSPI::PERIPHERAL, true, PSEL);\n\n\t\t\tbool f = true;\n\t\t\tuint8_t brdv;\n\t\t\tuint8_t spbr;\n\t\t\tif(!clock_div_(speed, brdv, spbr)) {\n\t\t\t\tf = false;\n\t\t\t}\n\n\t\t\t\/\/ 設定\n\t\t RSPI::SPBR = spbr;\n\n\t\t\tRSPI::SPPCR = 0x00;\t\/\/ Fixed idle value, disable loop-back\n\t\t\tRSPI::SPSCR = 0x00;\t\/\/ disable sequence control\n\t\t\tRSPI::SPDCR = 0x20;\t\/\/ SPLW=1 (long word access) \n\/\/\/\t\t\tRSPI::SPCMD0 = RSPI::SPCMD0.LSBF.b() | RSPI::SPCMD0.BRDV.b(brdv) | RSPI::SPCMD0.SPB.b(0b0100);\n\t\t\tbool cpol = 0;\n\t\t\tbool cpha = 0;\n\t\t\tswitch(ctype) {\n\t\t\tcase PHASE::TYPE1:\n\t\t\t\tbreak;\n\t\t\tcase PHASE::TYPE2:\n\t\t\t\tcpha = 1;\n\t\t\t\tbreak;\n\t\t\tcase PHASE::TYPE3:\n\t\t\t\tcpol = 1;\n\t\t\t\tbreak;\n\t\t\tcase PHASE::TYPE4:\n\t\t\t\tcpol = 1;\n\t\t\t\tcpha = 1;\n\t\t\t\tbreak;\n\t\t\tdefault:\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\tRSPI::SPCMD0 = RSPI::SPCMD0.BRDV.b(brdv)\n\t\t\t\t| RSPI::SPCMD0.SPB.b(static_cast<uint8_t>(dlen))\n\t\t\t\t| RSPI::SPCMD0.CPOL.b(cpol) | RSPI::SPCMD0.CPHA.b(cpha);\n\n\t\t\tRSPI::SPCR.SPMS = 1;\n\t\t\tRSPI::SPCR.MSTR = 1;\n\n\t\t\tRSPI::SPCR.SPE = 1;\n\n\t\t\treturn f;\n\t\t}\n\n\n\t\t\/\/-----------------------------------------------------------------\/\/\n\t\t\/*!\n\t\t\t@brief ＳＤカード用設定を有効にする\n\t\t\t@param[in]\tspeed\t通信速度\n\t\t\t@return エラー（速度設定範囲外）なら「false」\n\t\t*\/\n\t\t\/\/-----------------------------------------------------------------\/\/\n\t\tbool start_sdc(uint32_t speed) noexcept\n\t\t{\n\t\t\tlevel_ = 0;\n\n\t\t\tpower_mgr::turn(RSPI::PERIPHERAL);\n\n\t\t\tRSPI::SPCR = 0x00;\t\t\t\n\n\t\t\tbool f = true;\n\t\t\tuint8_t brdv;\n\t\t\tuint8_t spbr;\n\t\t\tif(!clock_div_(speed, brdv, spbr)) {\n\t\t\t\tf = false;\n\t\t\t}\n\t\t\tport_map::turn(RSPI::PERIPHERAL, true, PSEL);\n#if 0\n\t\t\tutils::format(\"RSPI Request Speed: %u [Hz]\\n\") % speed;\n\t\t\tutils::format(\"RSPI SPBR: %d\\n\") % static_cast<uint32_t>(spbr);\n\t\t\tutils::format(\"RSPI BRDV: %d\\n\") % static_cast<uint32_t>(brdv);\n#endif\n\t\t RSPI::SPBR = spbr;\n\n\t\t\t\/\/ 実際のクロックを表示\n#if 0\n\t\t\tstatic const uint8_t n[4] = { 1, 2, 4, 8 };\n\t\t\tuint32_t z = static_cast<uint32_t>(PCLK_)\n\t\t\t\t\t\/ (2 * static_cast<uint32_t>(spbr + 1) * static_cast<uint32_t>(n[brdv]));\n\t\t\tutils::format(\"RSPI Real Speed: %u [Hz]\\n\") % z;\n#endif\n\t\t\tRSPI::SPPCR = 0x00;\t\/\/ Fixed idle value, disable loop-back\n\t\t\tRSPI::SPSCR = 0x00;\t\/\/ disable sequence control\n\t\t\tRSPI::SPDCR = 0x20;\t\/\/ SPLW=1 (long word access) \n\t\t\tRSPI::SPCMD0 = RSPI::SPCMD0.BRDV.b(brdv) | RSPI::SPCMD0.SPB.b(0b0100);\n\/\/\/\t\t\t\t| RSPI::SPCMD0.CPHA.b(0) | RSPI::SPCMD0.CPOL.b(1);\n\n\t\t\tRSPI::SPCR.SPMS = 1;\n\t\t\tRSPI::SPCR.MSTR = 1;\n\n\t\t\tRSPI::SPCR.SPE = 1;\n\n\t\t\treturn f;\n\t\t}\n\n\n\t\t\/\/----------------------------------------------------------------\/\/\n\t\t\/*!\n\t\t\t@brief\tリード・ライト\n\t\t\t@param[in]\tdata\t書き込みデータ\n\t\t\t@return 読み出しデータ\n\t\t*\/\n\t\t\/\/----------------------------------------------------------------\/\/\n\t\tuint8_t xchg(uint8_t data = 0xff) noexcept\n\t\t{\n\t\t\tRSPI::SPDR = static_cast<uint32_t>(data);\n\t\t\twhile(RSPI::SPSR.SPRF() == 0) sleep_();\n\t\t return RSPI::SPDR();\n\t\t}\n\n\n\t\t\/\/----------------------------------------------------------------\/\/\n\t\t\/*!\n\t\t\t@brief\t通信レジスタへ書き込み @n\n\t\t\t\t\t※通信幅は最大３２ビット（通信モード設定による）\n\t\t\t@param[in]\tdata\t書き込みデータ\n\t\t*\/\n\t\t\/\/----------------------------------------------------------------\/\/\n\t\tinline void xchg32_start(uint32_t data = 0) noexcept\n\t\t{\n\t\t\tRSPI::SPDR = static_cast<uint32_t>(data);\n\t\t}\n\n\n\t\t\/\/----------------------------------------------------------------\/\/\n\t\t\/*!\n\t\t\t@brief\t通信の同期とレジスタからの読み出し @n\n\t\t\t\t\t※通信幅は最大３２ビット（通信モード設定による）\n\t\t\t@return\t読み出しデータ\n\t\t*\/\n\t\t\/\/----------------------------------------------------------------\/\/\n\t\tinline uint32_t xchg32_sync() noexcept\n\t\t{\n\t\t\twhile(RSPI::SPSR.SPRF() == 0) sleep_();\n\t\t return RSPI::SPDR();\n\t\t}\n\n\n\t\t\/\/----------------------------------------------------------------\/\/\n\t\t\/*!\n\t\t\t@brief\tリード・ライト\n\t\t\t@param[in]\tdata\t書き込みデータ\n\t\t\t@return 読み出しデータ\n\t\t*\/\n\t\t\/\/----------------------------------------------------------------\/\/\n\t\tinline uint32_t xchg32(uint32_t data = 0) noexcept\n\t\t{\n\t\t\txchg32_start(data);\n\t\t\treturn xchg32_sync();\n\t\t}\n\n\n\t\t\/\/-----------------------------------------------------------------\/\/\n\t\t\/*!\n\t\t\t@brief シリアル送信\n\t\t\t@param[in]\tsrc\t送信ソース\n\t\t\t@param[in]\tcnt\t送信サイズ\n\t\t*\/\n\t\t\/\/-----------------------------------------------------------------\/\/\n\t\tvoid send(const void* src, uint32_t size) noexcept\n\t\t{\n\t\t\tauto ptr = static_cast<const uint8_t*>(src);\n\t\t\twhile(size > 0) {\n\t\t\t\txchg(*ptr);\n\t\t\t\t++ptr;\n\t\t\t\tsize--;\n\t\t\t}\n\t\t}\n\n\n\t\t\/\/-----------------------------------------------------------------\/\/\n\t\t\/*!\n\t\t\t@brief シリアル受信\n\t\t\t@param[out]\tdst\t受信先\n\t\t\t@param[in]\tcnt\t受信サイズ\n\t\t*\/\n\t\t\/\/-----------------------------------------------------------------\/\/\n\t\tvoid recv(void* dst, uint32_t size) noexcept\n\t\t{\n\t\t\tauto ptr = static_cast<uint8_t*>(dst);\n\t\t\twhile(size > 0) {\n\t\t\t\t*ptr = xchg();\n\t\t\t\t++ptr;\n\t\t\t\tsize--;\n\t\t\t}\n\t\t}\n\n\n\t\t\/\/-----------------------------------------------------------------\/\/\n\t\t\/*!\n\t\t\t@brief RSPIを無効にして、パワーダウンする\n\t\t\t@param[in]\tpower パワーダウンをしない場合「false」\n\t\t*\/\n\t\t\/\/-----------------------------------------------------------------\/\/\n\t\tvoid destroy(bool power = true) noexcept\n\t\t{\n\t\t\tRSPI::SPCR = 0x00;\n\t\t\tport_map::turn(RSPI::PERIPHERAL, false);\n\t\t\tif(power) power_mgr::turn(RSPI::PERIPHERAL, false);\n\t\t}\n\t};\n}\n<commit_msg>Update: cleanup<commit_after>#pragma once\n\/\/=====================================================================\/\/\n\/*!\t@file\n\t@brief\tRX グループ・RSPI I\/O 制御\n @author 平松邦仁 (hira@rvf-rc45.net)\n\t@copyright\tCopyright (C) 2016, 2020 Kunihito Hiramatsu @n\n\t\t\t\tReleased under the MIT license @n\n\t\t\t\thttps:\/\/github.com\/hirakuni45\/RX\/blob\/master\/LICENSE\n*\/\n\/\/=====================================================================\/\/\n#include \"common\/renesas.hpp\"\n#include \"common\/vect.h\"\n\nnamespace device {\n\n\t\/\/+++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++\/\/\n\t\/*!\n\t\t@brief RSPI 制御クラス\n\t\t@param[in]\tRSPI\tRSPI 定義クラス\n\t\t@param[in]\tPSEL\tポート候補\n\t*\/\n\t\/\/+++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++\/\/\n\ttemplate <class RSPI, port_map::option PSEL = port_map::option::FIRST>\n\tclass rspi_io {\n\tpublic:\n\n\t\t\/\/+++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++\/\/\n\t\t\/*!\n\t\t\t@brief データ、クロック位相タイプ型\n\t\t\t\t\tTYPE1(MODE0): CPOL:0 CPHA:0 @n\n\t\t\t\t\tTYPE2(MODE1): CPOL:0 CPHA:1 @n\n\t\t\t\t\tTYPE3(MODE2): CPOL:1 CPHA:0 @n\n\t\t\t\t\tTYPE4(MODE3): CPOL:1 CPHA:1\n\t\t*\/\n\t\t\/\/+++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++\/\/\n\t\tenum class PHASE : uint8_t {\n\t\t\tTYPE1, \/\/\/< タイプ１\n\t\t\tTYPE2, \/\/\/< タイプ２\n\t\t\tTYPE3, \/\/\/< タイプ３\n\t\t\tTYPE4, \/\/\/< タイプ４ (SD カードアクセス）\n\t\t};\n\n\n\t\t\/\/+++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++\/\/\n\t\t\/*!\n\t\t\t@brief データ長型\n\t\t*\/\n\t\t\/\/+++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++\/\/\n\t\tenum class DLEN : uint8_t {\n\t\t\tW8 = 0b0111,\t\/\/\/< 8 Bits\n\t\t\tW9 = 0b1000,\t\/\/\/< 9 Bits\n\t\t\tW10 = 0b1001,\t\/\/\/< 10 Bits\n\t\t\tW11 = 0b1010,\t\/\/\/< 11 Bits\n\t\t\tW12 = 0b1011,\t\/\/\/< 12 Bits\n\t\t\tW13 = 0b1100,\t\/\/\/< 13 Bits\n\t\t\tW14 = 0b1101,\t\/\/\/< 14 Bits\n\t\t\tW15 = 0b1110,\t\/\/\/< 15 Bits\n\t\t\tW16 = 0b1111,\t\/\/\/< 16 Bits\n\t\t\tW20 = 0b0000,\t\/\/\/< 20 Bits\n\t\t\tW24 = 0b0001,\t\/\/\/< 24 Bits\n\t\t\tW32 = 0b0011,\t\/\/\/< 32 Bits\n\t\t};\n\n\tprivate:\n\n\t\tuint8_t\tlevel_;\n\n\t\t\/\/ 便宜上のスリープ\n\t\tvoid sleep_() { asm(\"nop\"); }\n\n\n\t\tbool clock_div_(uint32_t speed, uint8_t& brdv, uint8_t& spbr) {\n\/\/\/\t\t\tutils::format(\"PCLK: %d\\n\") % static_cast<uint32_t>(RSPI::PCLK);\n\t\t\tuint32_t br = static_cast<uint32_t>(RSPI::PCLK) \/ speed;\n\t\t\tuint8_t dv = 0;\n\t\t\twhile(br > 512) {\n\t\t\t\tbr >>= 1;\n\t\t\t\t++dv;\n\t\t\t\tif(dv > 3) {\n\t\t\t\t\tbrdv = 3;\n\t\t\t\t\tspbr = 255;\n\t\t\t\t\treturn false;\n\t\t\t\t}\n\t\t\t}\n\t\t\tbrdv = dv;\n\t\t\tif(br & 1) {\n\t\t\t\tbr >>= 1;\n\t\t\t\t++br;\n\t\t\t} else {\n\t\t\t\tbr >>= 1;\n\t\t\t}\n\t\t\tif(br) --br;\n\t\t\tspbr = br;\n\t\t\treturn true;\n\t\t}\n\n\tpublic:\n\t\t\/\/-----------------------------------------------------------------\/\/\n\t\t\/*!\n\t\t\t@brief コンストラクター\n\t\t*\/\n\t\t\/\/-----------------------------------------------------------------\/\/\n\t\trspi_io() noexcept : level_(0) { }\n\n\n\t\t\/\/-----------------------------------------------------------------\/\/\n\t\t\/*!\n\t\t\t@brief 設定可能な最大速度を返す @n\n\t\t\t\t\t・RX24T: 20MHz @n\n\t\t\t\t\t・RX64M: 40MHz\n\t\t\t@return 最大速度\n\t\t*\/\n\t\t\/\/-----------------------------------------------------------------\/\/\n\t\tuint32_t get_max_speed() const noexcept {\n\t\t\tuint32_t clk = RSPI::PCLK;\n#ifdef SEEDA\n\t\t\twhile(clk > 20000000) { \/\/ 15MHz\n\/\/\t\t\twhile(clk > 10000000) { \/\/ 7MHz\n#else\n\t\t\twhile(clk > 40000000) {\n#endif\n\t\t\t\tclk >>= 1;\n\t\t\t}\n\t\t\treturn clk;\n\t\t}\n\n\n\t\t\/\/-----------------------------------------------------------------\/\/\n\t\t\/*!\n\t\t\t@brief 通信速度を設定して、CSI を有効にする\n\t\t\t@param[in]\tspeed\t通信速度\n\t\t\t@param[in]\tctype\tクロック位相タイプ\n\t\t\t@param[in]\tdlen\tデータ長設定\n\t\t\t@param[in]\tlevel\t割り込みレベル、０の場合はポーリング\n\t\t\t@return エラー（速度設定範囲外）なら「false」\n\t\t*\/\n\t\t\/\/-----------------------------------------------------------------\/\/\n\t\tbool start(uint32_t speed, PHASE ctype, DLEN dlen, uint8_t level = 0) noexcept\n\t\t{\n\t\t\tlevel_ = level;\n\n\t\t\tuint8_t brdv;\n\t\t\tuint8_t spbr;\n\t\t\tif(!clock_div_(speed, brdv, spbr)) {\n\t\t\t\treturn false;\n\t\t\t}\n\n\t\t\tpower_mgr::turn(RSPI::PERIPHERAL);\n\n\t\t\t\/\/ デバイスを不許可\n\t\t\tRSPI::SPCR = 0x00;\n\n\t\t\t\/\/ ポートを有効にする\n\t\t\tport_map::turn(RSPI::PERIPHERAL, true, PSEL);\n\n\t\t\t\/\/ 設定\n\t\t RSPI::SPBR = spbr;\n\n\t\t\tRSPI::SPPCR = 0x00;\t\/\/ Fixed idle value, disable loop-back\n\t\t\tRSPI::SPSCR = 0x00;\t\/\/ disable sequence control\n\t\t\tRSPI::SPDCR = 0x20;\t\/\/ SPLW=1 (long word access) \n\n\t\t\tbool cpol = 0;\n\t\t\tbool cpha = 0;\n\t\t\tswitch(ctype) {\n\t\t\tcase PHASE::TYPE1:\n\t\t\t\tbreak;\n\t\t\tcase PHASE::TYPE2:\n\t\t\t\tcpha = 1;\n\t\t\t\tbreak;\n\t\t\tcase PHASE::TYPE3:\n\t\t\t\tcpol = 1;\n\t\t\t\tbreak;\n\t\t\tcase PHASE::TYPE4:\n\t\t\t\tcpol = 1;\n\t\t\t\tcpha = 1;\n\t\t\t\tbreak;\n\t\t\tdefault:\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\tRSPI::SPCMD0 = RSPI::SPCMD0.BRDV.b(brdv)\n\t\t\t\t| RSPI::SPCMD0.SPB.b(static_cast<uint8_t>(dlen))\n\t\t\t\t| RSPI::SPCMD0.CPOL.b(cpol) | RSPI::SPCMD0.CPHA.b(cpha);\n\n\t\t\tRSPI::SPCR.SPMS = 1;\n\t\t\tRSPI::SPCR.MSTR = 1;\n\n\t\t\tRSPI::SPCR.SPE = 1;\n\n\t\t\treturn true;\n\t\t}\n\n\n\t\t\/\/-----------------------------------------------------------------\/\/\n\t\t\/*!\n\t\t\t@brief ＳＤカード用設定を有効にする\n\t\t\t@param[in]\tspeed\t通信速度\n\t\t\t@return エラー（速度設定範囲外）なら「false」\n\t\t*\/\n\t\t\/\/-----------------------------------------------------------------\/\/\n\t\tbool start_sdc(uint32_t speed) noexcept\n\t\t{\n\t\t\tlevel_ = 0;\n\n\t\t\tuint8_t brdv;\n\t\t\tuint8_t spbr;\n\t\t\tif(!clock_div_(speed, brdv, spbr)) {\n\t\t\t\treturn false;\n\t\t\t}\n\n\t\t\tpower_mgr::turn(RSPI::PERIPHERAL);\n\n\t\t\tRSPI::SPCR = 0x00;\n\n\t\t\tport_map::turn(RSPI::PERIPHERAL, true, PSEL);\n#if 0\n\t\t\tutils::format(\"RSPI Request Speed: %u [Hz]\\n\") % speed;\n\t\t\tutils::format(\"RSPI SPBR: %d\\n\") % static_cast<uint32_t>(spbr);\n\t\t\tutils::format(\"RSPI BRDV: %d\\n\") % static_cast<uint32_t>(brdv);\n#endif\n\t\t RSPI::SPBR = spbr;\n\n\t\t\t\/\/ 実際のクロックを表示\n#if 0\n\t\t\tstatic const uint8_t n[4] = { 1, 2, 4, 8 };\n\t\t\tuint32_t z = static_cast<uint32_t>(RSPI::PCLK)\n\t\t\t\t\t\/ (2 * static_cast<uint32_t>(spbr + 1) * static_cast<uint32_t>(n[brdv]));\n\t\t\tutils::format(\"RSPI Real Speed: %u [Hz]\\n\") % z;\n#endif\n\t\t\tRSPI::SPPCR = 0x00;\t \/\/ Fixed idle value, disable loop-back\n\t\t\tRSPI::SPSCR = 0x00;\t \/\/ disable sequence control\n\t\t\tRSPI::SPDCR = 0x20;\t \/\/ SPLW=1 (data register 32bits access) \n\t\t\tRSPI::SPCMD0 = RSPI::SPCMD0.BRDV.b(brdv)\n\t\t\t\t| RSPI::SPCMD0.SPB.b(static_cast<uint8_t>(DLEN::W8))\n\t\t\t\t| RSPI::SPCMD0.CPHA.b(0) | RSPI::SPCMD0.CPOL.b(0);\n\n\t\t\t\/\/ 3 線式（SSLAx を使わない）、Master\n\t\t\tRSPI::SPCR = RSPI::SPCR.SPMS.b(1) | RSPI::SPCR.MSTR.b(1);\n\n\t\t\tRSPI::SPCR.SPE = 1;\n\n\t\t\treturn true;\n\t\t}\n\n\n\t\t\/\/----------------------------------------------------------------\/\/\n\t\t\/*!\n\t\t\t@brief\tリード・ライト\n\t\t\t@param[in]\tdata\t書き込みデータ\n\t\t\t@return 読み出しデータ\n\t\t*\/\n\t\t\/\/----------------------------------------------------------------\/\/\n\t\tuint8_t xchg(uint8_t data = 0xff) noexcept\n\t\t{\n\t\t\tRSPI::SPDR = static_cast<uint32_t>(data);\n\t\t\twhile(RSPI::SPSR.SPRF() == 0) sleep_();\n\t\t return RSPI::SPDR();\n\t\t}\n\n\n\t\t\/\/----------------------------------------------------------------\/\/\n\t\t\/*!\n\t\t\t@brief\t通信レジスタへ書き込み @n\n\t\t\t\t\t※通信幅は最大３２ビット（通信モード設定による）\n\t\t\t@param[in]\tdata\t書き込みデータ\n\t\t*\/\n\t\t\/\/----------------------------------------------------------------\/\/\n\t\tinline void xchg32_start(uint32_t data = 0) noexcept\n\t\t{\n\t\t\tRSPI::SPDR = static_cast<uint32_t>(data);\n\t\t}\n\n\n\t\t\/\/----------------------------------------------------------------\/\/\n\t\t\/*!\n\t\t\t@brief\t通信の同期とレジスタからの読み出し @n\n\t\t\t\t\t※通信幅は最大３２ビット（通信モード設定による）\n\t\t\t@return\t読み出しデータ\n\t\t*\/\n\t\t\/\/----------------------------------------------------------------\/\/\n\t\tinline uint32_t xchg32_sync() noexcept\n\t\t{\n\t\t\twhile(RSPI::SPSR.SPRF() == 0) sleep_();\n\t\t return RSPI::SPDR();\n\t\t}\n\n\n\t\t\/\/----------------------------------------------------------------\/\/\n\t\t\/*!\n\t\t\t@brief\tリード・ライト\n\t\t\t@param[in]\tdata\t書き込みデータ\n\t\t\t@return 読み出しデータ\n\t\t*\/\n\t\t\/\/----------------------------------------------------------------\/\/\n\t\tinline uint32_t xchg32(uint32_t data = 0) noexcept\n\t\t{\n\t\t\txchg32_start(data);\n\t\t\treturn xchg32_sync();\n\t\t}\n\n\n\t\t\/\/-----------------------------------------------------------------\/\/\n\t\t\/*!\n\t\t\t@brief シリアル送信\n\t\t\t@param[in]\tsrc\t送信ソース\n\t\t\t@param[in]\tcnt\t送信サイズ\n\t\t*\/\n\t\t\/\/-----------------------------------------------------------------\/\/\n\t\tvoid send(const void* src, uint32_t size) noexcept\n\t\t{\n\t\t\tauto ptr = static_cast<const uint8_t*>(src);\n\t\t\twhile(size > 0) {\n\t\t\t\txchg(*ptr);\n\t\t\t\t++ptr;\n\t\t\t\tsize--;\n\t\t\t}\n\t\t}\n\n\n\t\t\/\/-----------------------------------------------------------------\/\/\n\t\t\/*!\n\t\t\t@brief シリアル受信\n\t\t\t@param[out]\tdst\t受信先\n\t\t\t@param[in]\tcnt\t受信サイズ\n\t\t*\/\n\t\t\/\/-----------------------------------------------------------------\/\/\n\t\tvoid recv(void* dst, uint32_t size) noexcept\n\t\t{\n\t\t\tauto ptr = static_cast<uint8_t*>(dst);\n\t\t\twhile(size > 0) {\n\t\t\t\t*ptr = xchg();\n\t\t\t\t++ptr;\n\t\t\t\tsize--;\n\t\t\t}\n\t\t}\n\n\n\t\t\/\/-----------------------------------------------------------------\/\/\n\t\t\/*!\n\t\t\t@brief RSPIを無効にして、パワーダウンする\n\t\t\t@param[in]\tpower パワーダウンをしない場合「false」\n\t\t*\/\n\t\t\/\/-----------------------------------------------------------------\/\/\n\t\tvoid destroy(bool power = true) noexcept\n\t\t{\n\t\t\tRSPI::SPCR = 0x00;\n\t\t\tport_map::turn(RSPI::PERIPHERAL, false);\n\t\t\tif(power) power_mgr::turn(RSPI::PERIPHERAL, false);\n\t\t}\n\t};\n}\n<|endoftext|>"} {"text":"<commit_before>#pragma once\n\/\/=====================================================================\/\/\n\/*!\t@file\n\t@brief\tソフト制御 I2C テンプレートクラス \n @author 平松邦仁 (hira@rvf-rc45.net)\n\t@copyright\tCopyright (C) 2017 Kunihito Hiramatsu @n\n\t\t\t\tReleased under the MIT license @n\n\t\t\t\thttps:\/\/github.com\/hirakuni45\/RX\/blob\/master\/LICENSE\n*\/\n\/\/=====================================================================\/\/\n#include <cstdint>\n#include \"common\/delay.hpp\"\n\nnamespace device {\n\n\t\/\/+++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++\/\/\n\t\/*!\n\t\t@brief I2C テンプレートクラス @n\n\t\t@param[in]\tSDA\tSDA ポート定義クラス\n\t\t@param[in]\tSCL\tSCL ポート定義クラス\n\t*\/\n\t\/\/+++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++\/\/\n\ttemplate <class SDA, class SCL>\n\tclass si2c_io {\n\tpublic:\n\t\t\/\/+++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++\/\/\n\t\t\/*!\n\t\t\t@brief I2C の速度タイプ\n\t\t*\/\n\t\t\/\/+++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++\/\/\n\t\tenum class speed : uint8_t {\n\t\t\tstandard,\t\/\/\/< 100K b.p.s. (Standard mode)\n\t\t\tfast,\t\t\/\/\/< 400K b.p.s. (Fast mode)\n\t\t\tfast_plus,\t\/\/\/< 1M b.p.s. (Fast plus mode)\n\t\t};\n\n\n\t\t\/\/+++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++\/\/\n\t\t\/*!\n\t\t\t@brief I2C のエラー\n\t\t*\/\n\t\t\/\/+++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++\/\/\n\t\tenum class error : uint8_t {\n\t\t\tnone,\t\t\/\/\/< エラー無し\n\t\t\tstart,\t\t\/\/\/< スタート（初期化）\n\t\t\tbus_open,\t\/\/\/< バス・オープン\n\t\t\taddress,\t\/\/\/< アドレス転送\n\t\t\tsend_data,\t\/\/\/< 送信データ転送\n\t\t\trecv_data,\t\/\/\/< 受信データ転送\n\t\t\tstop,\t\t\/\/\/< ストップ・コンディション\n\t\t};\n\n\tprivate:\n\t\tuint8_t\t\tclock_;\n\t\terror\t\terror_;\n\t\tuint16_t\tbusy_;\n\n\t\tstatic const uint8_t slow_clock_ = 10 \/ 2;\n\t\tstatic const uint8_t fast_clock_ = 4 \/ 2;\n\n\t\tvoid start_() const {\n\t\t\tSDA::P = 0;\n\t\t\tutils::delay::micro_second(clock_);\n\t\t\tSCL::P = 0;\n\t\t\tutils::delay::micro_second(clock_);\n\t\t}\n\n\n\t\tbool ack_() const {\n\t\t\tSDA::P = 1;\n\t\t\tutils::delay::micro_second(clock_);\n\t\t\tSCL::P = 1;\n\t\t\tSDA::DIR = 0;\n\t\t\tutils::delay::micro_second(clock_);\n\t\t\tbool f = SDA::P();\n\t\t\tSDA::P = 0;\n\t\t\tSDA::DIR = 1;\n\t\t\tSCL::P = 0;\n\t\t\treturn f;\n\t\t}\n\n\n\t\tvoid out_ack_(bool b) const {\n\t\t\tutils::delay::micro_second(clock_);\n\t\t\tSDA::P = b;\n\t\t\tSCL::P = 1;\n\t\t\tutils::delay::micro_second(clock_);\n\t\t\tSCL::P = 0;\n\t\t}\n\n\n\t\tbool wait_() const {\n\t\t\tuint16_t cnt = busy_;\n\t\t\tSCL::DIR = 0;\n\t\t\twhile(SCL::P() == 0) {\n\t\t\t\tutils::delay::micro_second(1);\n\t\t\t\tif(cnt) {\n\t\t\t\t\t--cnt;\n\t\t\t\t} else {\n\t\t\t\t\tSCL::DIR = 1;\n\t\t\t\t\treturn false; \/\/ wait stall\n\t\t\t\t}\n\t\t\t}\n\t\t\tSCL::DIR = 1;\n\t\t\treturn true;\n\t\t}\n\n\n\t\tvoid stop_() const {\n\t\t\tutils::delay::micro_second(clock_);\n\t\t\tSCL::P = 1;\n\t\t\tutils::delay::micro_second(clock_);\n\t\t\tSDA::P = 1;\n\t\t}\n\n\n\t\tbool write_(uint8_t val, bool sync) const {\n\t\t\tfor(uint8_t n = 0; n < 8; ++n) {\n\t\t\t\tSDA::P = (val & 0x80) != 0 ? 1 : 0;\n\t\t\t\tutils::delay::micro_second(clock_);\n\t\t\t\tSCL::P = 1;\n\t\t\t\tif(n == 0 && sync) {\n\t\t\t\t\tif(!wait_()) return false;\n\t\t\t\t}\n\t\t\t\tval <<= 1;\n\t\t\t\tutils::delay::micro_second(clock_);\n\t\t\t\tSCL::P = 0;\n\t\t\t}\n\t\t\treturn true;\n\t\t}\n\n\n\t\tbool write_(uint8_t data) const {\n\t\t\tif(!write_(data, true)) {\n\t\t\t\tstop_();\n\t\t\t\treturn false;\n\t\t\t}\n\t\t\tif(ack_()) {\n\t\t\t\tstop_();\n\t\t\t\treturn false;\n\t\t\t}\n\t\t\treturn true;\n\t\t}\n\n\n\t\tbool write_(const uint8_t* src, uint8_t num) const {\n\t\t\tfor(uint8_t n = 0; n < num; ++n) {\n\t\t\t\tif(!write_(*src, true)) {\n\t\t\t\t\tstop_();\n\t\t\t\t\treturn false;\n\t\t\t\t}\n\t\t\t\t++src;\n\t\t\t\tif(ack_()) {\n\t\t\t\t\tstop_();\n\t\t\t\t\treturn false;\n\t\t\t\t}\n\t\t\t}\n\t\t\treturn true;\n\t\t}\n\n\n\t\tbool read_(uint8_t& val, bool sync) const {\n\t\t\tSDA::DIR = 0;\n\t\t\tfor(uint8_t n = 0; n < 8; ++n) {\n\t\t\t\tutils::delay::micro_second(clock_);\n\t\t\t\tval <<= 1;\n\t\t\t\tSCL::P = 1;\n\t\t\t\tif(n == 0 && sync) {\n\t\t\t\t\tif(!wait_()) {\n\t\t\t\t\t\tSDA::DIR = 1;\n\t\t\t\t\t\treturn false;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\tutils::delay::micro_second(clock_);\n\t\t\t\tif(SDA::P()) val |= 1;\n\t\t\t\tSCL::P = 0;\n\t\t\t}\n\t\t\tSDA::DIR = 1;\n\t\t\treturn true;\n\t\t}\n\n\tpublic:\n\t\t\/\/-----------------------------------------------------------------\/\/\n\t\t\/*!\n\t\t\t@brief コンストラクター\n\t\t*\/\n\t\t\/\/-----------------------------------------------------------------\/\/\n\t\tsi2c_io() : clock_(slow_clock_), error_(error::none), busy_(200) { }\n\n\n\t\t\/\/-----------------------------------------------------------------\/\/\n\t\t\/*!\n\t\t\t@brief 初期化\n\t\t\t@param[in]\tspd\tスピード\n\t\t\t@return 成功なら「true」\n\t\t*\/\n\t\t\/\/-----------------------------------------------------------------\/\/\n\t\tbool start(speed spd)\n\t\t{\n\t\t\tSCL::OD = 1;\n\t\t\tSDA::OD = 1;\n\t\t\tSCL::DIR = 1;\n\t\t\tSDA::DIR = 1;\n\t\t\tSCL::P = 1;\n\t\t\tSDA::P = 1;\n\t\t\tif(spd == speed::standard) {\n\t\t\t\tset_standard();\n\t\t\t} else if(spd == speed::fast) {\n\t\t\t\tset_fast();\n\t\t\t} else {\n\t\t\t\terror_ = error::start;\n\t\t\t\treturn false;\n\t\t\t}\n\t\t\treturn true;\n\t\t}\n\n\n\t\t\/\/-----------------------------------------------------------------\/\/\n\t\t\/*!\n\t\t\t@brief クロック設定\n\t\t\t@param[in]\tclock\tパルス５０％待ち時間（単位マイクロ秒）\n\t\t*\/\n\t\t\/\/-----------------------------------------------------------------\/\/\n\t\tvoid set_clock(uint8_t clock) { clock_ = clock; }\n\n\n\t\t\/\/-----------------------------------------------------------------\/\/\n\t\t\/*!\n\t\t\t@brief 標準速度指定（maybe 100KBPS）\n\t\t*\/\n\t\t\/\/-----------------------------------------------------------------\/\/\n\t\tvoid set_standard() { clock_ = slow_clock_; }\n\n\n\t\t\/\/-----------------------------------------------------------------\/\/\n\t\t\/*!\n\t\t\t@brief 高速指定（maybe 400KBPS）\n\t\t*\/\n\t\t\/\/-----------------------------------------------------------------\/\/\n\t\tvoid set_fast() { clock_ = fast_clock_; }\n\n\n\t\t\/\/-----------------------------------------------------------------\/\/\n\t\t\/*!\n\t\t\t@brief スレーブデバイスの「待ち」時間の最大値を設定\n\t\t\t@param[in]\tbusy\t待ち時間（単位マイクロ秒）\n\t\t*\/\n\t\t\/\/-----------------------------------------------------------------\/\/\n\t\tvoid set_busy(uint16_t busy) { busy_ = busy; }\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\terror get_last_error() const { return error_; }\n\n\n\t\t\/\/-----------------------------------------------------------------\/\/\n\t\t\/*!\n\t\t\t@brief 受信（リード）\n\t\t\t@param[in] address スレーブアドレス（７ビット）\n\t\t\t@param[out]\tdst\t先\n\t\t\t@param[in]\tnum\t数\n\t\t\t@return 失敗なら「false」が返る\n\t\t*\/\n\t\t\/\/-----------------------------------------------------------------\/\/\n\t\tbool recv(uint8_t address, uint8_t* dst, uint8_t num) {\n\t\t\tstart_();\n\t\t\twrite_((address << 1) | 1, false);\n\t\t\tif(ack_()) {\n\t\t\t\tstop_();\n\t\t\t\terror_ = error::address;\n\t\t\t\treturn false;\n\t\t\t}\n\n\t\t\tfor(uint8_t n = 0; n < num; ++n) {\n\t\t\t\tif(!read_(*dst, true)) {\n\t\t\t\t\tstop_();\n\t\t\t\t\terror_ = error::recv_data;\n\t\t\t\t\treturn false;\n\t\t\t\t}\n\t\t\t\tbool f = 0;\n\t\t\t\tif(n == (num - 1)) f = 1;\n\t\t\t\tout_ack_(f);\n\t\t\t\t++dst;\n\t\t\t}\n\t\t\tstop_();\n\t\t\treturn true;\n\t\t}\n\n\n\t\t\/\/-----------------------------------------------------------------\/\/\n\t\t\/*!\n\t\t\t@brief 送信（ライト）\n\t\t\t@param[in] address スレーブアドレス（７ビット）\n\t\t\t@param[in]\tsrc\t元\n\t\t\t@param[in]\tnum\t数\n\t\t\t@return 失敗なら「false」が返る\n\t\t*\/\n\t\t\/\/-----------------------------------------------------------------\/\/\n\t\tbool send(uint8_t address, const uint8_t* src, uint8_t num) {\n\t\t\tstart_();\n\t\t\twrite_(address << 1, false);\n\t\t\tif(ack_()) {\n\t\t\t\tstop_();\n\t\t\t\terror_ = error::address;\n\t\t\t\treturn false;\n\t\t\t}\n\n\t\t\tif(!write_(src, num)) {\n\t\t\t\tstop_();\n\t\t\t\terror_ = error::send_data;\n\t\t\t\treturn false;\n\t\t\t}\n\t\t\tstop_();\n\t\t\treturn true;\n\t\t}\n\n\n\t\t\/\/-----------------------------------------------------------------\/\/\n\t\t\/*!\n\t\t\t@brief 送信（ライト）\n\t\t\t@param[in] address スレーブアドレス（７ビット）\n\t\t\t@param[in]\tfirst\tファーストデータ\n\t\t\t@param[in]\tsrc\t元\n\t\t\t@param[in]\tnum\t数\n\t\t\t@return 失敗なら「false」が返る\n\t\t*\/\n\t\t\/\/-----------------------------------------------------------------\/\/\n\t\tbool send(uint8_t address, uint8_t first, const uint8_t* src, uint8_t num) {\n\t\t\tstart_();\n\t\t\twrite_(address << 1, false);\n\t\t\tif(ack_()) {\n\t\t\t\tstop_();\n\t\t\t\terror_ = error::address;\n\t\t\t\treturn false;\n\t\t\t}\n\n\t\t\tif(!write_(first)) {\n\t\t\t\tstop_();\n\t\t\t\terror_ = error::send_data;\n\t\t\t\treturn false;\n\t\t\t}\n\n\t\t\tif(!write_(src, num)) {\n\t\t\t\tstop_();\n\t\t\t\terror_ = error::send_data;\n\t\t\t\treturn false;\n\t\t\t}\n\t\t\tstop_();\n\t\t\treturn true;\n\t\t}\n\n\n\t\t\/\/-----------------------------------------------------------------\/\/\n\t\t\/*!\n\t\t\t@brief 送信（ライト）\n\t\t\t@param[in] address スレーブアドレス（７ビット）\n\t\t\t@param[in]\tfirst\tファースト・データ\n\t\t\t@param[in]\tsecond\tセカンド・データ\n\t\t\t@param[in]\tsrc\t元\n\t\t\t@param[in]\tnum\t数\n\t\t\t@return 失敗なら「false」が返る\n\t\t*\/\n\t\t\/\/-----------------------------------------------------------------\/\/\n\t\tbool send(uint8_t address, uint8_t first, uint8_t second, const uint8_t* src, uint8_t num) {\n\t\t\tstart_();\n\t\t\twrite_(address << 1, false);\n\t\t\tif(ack_()) {\n\t\t\t\tstop_();\n\t\t\t\terror_ = error::address;\n\t\t\t\treturn false;\n\t\t\t}\n\n\t\t\tif(!write_(first)) {\n\t\t\t\tstop_();\n\t\t\t\terror_ = error::send_data;\n\t\t\t\treturn false;\n\t\t\t}\n\t\t\tif(!write_(second)) {\n\t\t\t\tstop_();\n\t\t\t\terror_ = error::send_data;\n\t\t\t\treturn false;\n\t\t\t}\n\t\t\tif(!write_(src, num)) {\n\t\t\t\tstop_();\n\t\t\t\terror_ = error::send_data;\n\t\t\t\treturn false;\n\t\t\t}\n\t\t\tstop_();\n\t\t\treturn true;\n\t\t}\n\t};\n}\n<commit_msg>update: cleanup soft I2C<commit_after>#pragma once\n\/\/=====================================================================\/\/\n\/*!\t@file\n\t@brief\tソフト制御 I2C テンプレートクラス \n @author 平松邦仁 (hira@rvf-rc45.net)\n\t@copyright\tCopyright (C) 2017, 2018 Kunihito Hiramatsu @n\n\t\t\t\tReleased under the MIT license @n\n\t\t\t\thttps:\/\/github.com\/hirakuni45\/RX\/blob\/master\/LICENSE\n*\/\n\/\/=====================================================================\/\/\n#include <cstdint>\n#include \"common\/delay.hpp\"\n\nnamespace device {\n\n\t\/\/+++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++\/\/\n\t\/*!\n\t\t@brief I2C テンプレートクラス @n\n\t\t@param[in]\tSDA\tSDA ポート定義クラス\n\t\t@param[in]\tSCL\tSCL ポート定義クラス\n\t*\/\n\t\/\/+++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++\/\/\n\ttemplate <class SDA, class SCL>\n\tclass si2c_io {\n\tpublic:\n\t\t\/\/+++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++\/\/\n\t\t\/*!\n\t\t\t@brief I2C の速度タイプ\n\t\t*\/\n\t\t\/\/+++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++\/\/\n\t\tenum class SPEED : uint8_t {\n\t\t\tSTANDARD,\t\/\/\/< 100K b.p.s. (Standard mode)\n\t\t\tFAST,\t\t\/\/\/< 400K b.p.s. (Fast mode)\n\t\t\tFAST_PLUS,\t\/\/\/< 1M b.p.s. (Fast plus mode)\n\t\t};\n\n\n\t\t\/\/+++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++\/\/\n\t\t\/*!\n\t\t\t@brief I2C のエラー\n\t\t*\/\n\t\t\/\/+++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++\/\/\n\t\tenum class error : uint8_t {\n\t\t\tnone,\t\t\/\/\/< エラー無し\n\t\t\tstart,\t\t\/\/\/< スタート（初期化）\n\t\t\tbus_open,\t\/\/\/< バス・オープン\n\t\t\taddress,\t\/\/\/< アドレス転送\n\t\t\tsend_data,\t\/\/\/< 送信データ転送\n\t\t\trecv_data,\t\/\/\/< 受信データ転送\n\t\t\tstop,\t\t\/\/\/< ストップ・コンディション\n\t\t};\n\n\tprivate:\n\t\tuint8_t\t\tclock_;\n\t\terror\t\terror_;\n\t\tuint16_t\tbusy_;\n\n\t\tstatic const uint8_t slow_clock_ = 10 \/ 2;\n\t\tstatic const uint8_t fast_clock_ = 4 \/ 2;\n\n\t\tvoid start_() const {\n\t\t\tSDA::P = 0;\n\t\t\tutils::delay::micro_second(clock_);\n\t\t\tSCL::P = 0;\n\t\t\tutils::delay::micro_second(clock_);\n\t\t}\n\n\n\t\tbool ack_() const {\n\t\t\tSDA::P = 1;\n\t\t\tutils::delay::micro_second(clock_);\n\t\t\tSCL::P = 1;\n\t\t\tSDA::DIR = 0;\n\t\t\tutils::delay::micro_second(clock_);\n\t\t\tbool f = SDA::P();\n\t\t\tSDA::P = 0;\n\t\t\tSDA::DIR = 1;\n\t\t\tSCL::P = 0;\n\t\t\treturn f;\n\t\t}\n\n\n\t\tvoid out_ack_(bool b) const {\n\t\t\tutils::delay::micro_second(clock_);\n\t\t\tSDA::P = b;\n\t\t\tSCL::P = 1;\n\t\t\tutils::delay::micro_second(clock_);\n\t\t\tSCL::P = 0;\n\t\t}\n\n\n\t\tbool wait_() const {\n\t\t\tuint16_t cnt = busy_;\n\t\t\tSCL::DIR = 0;\n\t\t\twhile(SCL::P() == 0) {\n\t\t\t\tutils::delay::micro_second(1);\n\t\t\t\tif(cnt) {\n\t\t\t\t\t--cnt;\n\t\t\t\t} else {\n\t\t\t\t\tSCL::DIR = 1;\n\t\t\t\t\treturn false; \/\/ wait stall\n\t\t\t\t}\n\t\t\t}\n\t\t\tSCL::DIR = 1;\n\t\t\treturn true;\n\t\t}\n\n\n\t\tvoid stop_() const {\n\t\t\tutils::delay::micro_second(clock_);\n\t\t\tSCL::P = 1;\n\t\t\tutils::delay::micro_second(clock_);\n\t\t\tSDA::P = 1;\n\t\t}\n\n\n\t\tbool write_(uint8_t val, bool sync) const {\n\t\t\tfor(uint8_t n = 0; n < 8; ++n) {\n\t\t\t\tSDA::P = (val & 0x80) != 0 ? 1 : 0;\n\t\t\t\tutils::delay::micro_second(clock_);\n\t\t\t\tSCL::P = 1;\n\t\t\t\tif(n == 0 && sync) {\n\t\t\t\t\tif(!wait_()) return false;\n\t\t\t\t}\n\t\t\t\tval <<= 1;\n\t\t\t\tutils::delay::micro_second(clock_);\n\t\t\t\tSCL::P = 0;\n\t\t\t}\n\t\t\treturn true;\n\t\t}\n\n\n\t\tbool write_(uint8_t data) const {\n\t\t\tif(!write_(data, true)) {\n\t\t\t\tstop_();\n\t\t\t\treturn false;\n\t\t\t}\n\t\t\tif(ack_()) {\n\t\t\t\tstop_();\n\t\t\t\treturn false;\n\t\t\t}\n\t\t\treturn true;\n\t\t}\n\n\n\t\tbool write_(const uint8_t* src, uint8_t num) const {\n\t\t\tfor(uint8_t n = 0; n < num; ++n) {\n\t\t\t\tif(!write_(*src, true)) {\n\t\t\t\t\tstop_();\n\t\t\t\t\treturn false;\n\t\t\t\t}\n\t\t\t\t++src;\n\t\t\t\tif(ack_()) {\n\t\t\t\t\tstop_();\n\t\t\t\t\treturn false;\n\t\t\t\t}\n\t\t\t}\n\t\t\treturn true;\n\t\t}\n\n\n\t\tbool read_(uint8_t& val, bool sync) const {\n\t\t\tSDA::DIR = 0;\n\t\t\tfor(uint8_t n = 0; n < 8; ++n) {\n\t\t\t\tutils::delay::micro_second(clock_);\n\t\t\t\tval <<= 1;\n\t\t\t\tSCL::P = 1;\n\t\t\t\tif(n == 0 && sync) {\n\t\t\t\t\tif(!wait_()) {\n\t\t\t\t\t\tSDA::DIR = 1;\n\t\t\t\t\t\treturn false;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\tutils::delay::micro_second(clock_);\n\t\t\t\tif(SDA::P()) val |= 1;\n\t\t\t\tSCL::P = 0;\n\t\t\t}\n\t\t\tSDA::DIR = 1;\n\t\t\treturn true;\n\t\t}\n\n\tpublic:\n\t\t\/\/-----------------------------------------------------------------\/\/\n\t\t\/*!\n\t\t\t@brief コンストラクター\n\t\t*\/\n\t\t\/\/-----------------------------------------------------------------\/\/\n\t\tsi2c_io() : clock_(slow_clock_), error_(error::none), busy_(200) { }\n\n\n\t\t\/\/-----------------------------------------------------------------\/\/\n\t\t\/*!\n\t\t\t@brief 初期化\n\t\t\t@param[in]\tspd\tスピード\n\t\t\t@return 成功なら「true」\n\t\t*\/\n\t\t\/\/-----------------------------------------------------------------\/\/\n\t\tbool start(SPEED spd)\n\t\t{\n\t\t\tSCL::OD = 1;\n\t\t\tSDA::OD = 1;\n\t\t\tSCL::DIR = 1;\n\t\t\tSDA::DIR = 1;\n\t\t\tSCL::P = 1;\n\t\t\tSDA::P = 1;\n\t\t\tif(spd == SPEED::STANDARD) {\n\t\t\t\tset_standard();\n\t\t\t} else if(spd == SPEED::FAST) {\n\t\t\t\tset_fast();\n\t\t\t} else {\n\t\t\t\terror_ = error::start;\n\t\t\t\treturn false;\n\t\t\t}\n\t\t\treturn true;\n\t\t}\n\n\n\t\t\/\/-----------------------------------------------------------------\/\/\n\t\t\/*!\n\t\t\t@brief クロック設定\n\t\t\t@param[in]\tclock\tパルス５０％待ち時間（単位マイクロ秒）\n\t\t*\/\n\t\t\/\/-----------------------------------------------------------------\/\/\n\t\tvoid set_clock(uint8_t clock) { clock_ = clock; }\n\n\n\t\t\/\/-----------------------------------------------------------------\/\/\n\t\t\/*!\n\t\t\t@brief 標準速度指定（maybe 100KBPS）\n\t\t*\/\n\t\t\/\/-----------------------------------------------------------------\/\/\n\t\tvoid set_standard() { clock_ = slow_clock_; }\n\n\n\t\t\/\/-----------------------------------------------------------------\/\/\n\t\t\/*!\n\t\t\t@brief 高速指定（maybe 400KBPS）\n\t\t*\/\n\t\t\/\/-----------------------------------------------------------------\/\/\n\t\tvoid set_fast() { clock_ = fast_clock_; }\n\n\n\t\t\/\/-----------------------------------------------------------------\/\/\n\t\t\/*!\n\t\t\t@brief スレーブデバイスの「待ち」時間の最大値を設定\n\t\t\t@param[in]\tbusy\t待ち時間（単位マイクロ秒）\n\t\t*\/\n\t\t\/\/-----------------------------------------------------------------\/\/\n\t\tvoid set_busy(uint16_t busy) { busy_ = busy; }\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\terror get_last_error() const { return error_; }\n\n\n\t\t\/\/-----------------------------------------------------------------\/\/\n\t\t\/*!\n\t\t\t@brief 受信（リード）\n\t\t\t@param[in] address スレーブアドレス（７ビット）\n\t\t\t@param[out]\tdst\t先\n\t\t\t@param[in]\tnum\t数\n\t\t\t@return 失敗なら「false」が返る\n\t\t*\/\n\t\t\/\/-----------------------------------------------------------------\/\/\n\t\tbool recv(uint8_t address, uint8_t* dst, uint8_t num) {\n\t\t\tstart_();\n\t\t\twrite_((address << 1) | 1, false);\n\t\t\tif(ack_()) {\n\t\t\t\tstop_();\n\t\t\t\terror_ = error::address;\n\t\t\t\treturn false;\n\t\t\t}\n\n\t\t\tfor(uint8_t n = 0; n < num; ++n) {\n\t\t\t\tif(!read_(*dst, true)) {\n\t\t\t\t\tstop_();\n\t\t\t\t\terror_ = error::recv_data;\n\t\t\t\t\treturn false;\n\t\t\t\t}\n\t\t\t\tbool f = 0;\n\t\t\t\tif(n == (num - 1)) f = 1;\n\t\t\t\tout_ack_(f);\n\t\t\t\t++dst;\n\t\t\t}\n\t\t\tstop_();\n\t\t\treturn true;\n\t\t}\n\n\n\t\t\/\/-----------------------------------------------------------------\/\/\n\t\t\/*!\n\t\t\t@brief 送信（ライト）\n\t\t\t@param[in] address スレーブアドレス（７ビット）\n\t\t\t@param[in]\tsrc\t元\n\t\t\t@param[in]\tnum\t数\n\t\t\t@return 失敗なら「false」が返る\n\t\t*\/\n\t\t\/\/-----------------------------------------------------------------\/\/\n\t\tbool send(uint8_t address, const uint8_t* src, uint8_t num) {\n\t\t\tstart_();\n\t\t\twrite_(address << 1, false);\n\t\t\tif(ack_()) {\n\t\t\t\tstop_();\n\t\t\t\terror_ = error::address;\n\t\t\t\treturn false;\n\t\t\t}\n\n\t\t\tif(!write_(src, num)) {\n\t\t\t\tstop_();\n\t\t\t\terror_ = error::send_data;\n\t\t\t\treturn false;\n\t\t\t}\n\t\t\tstop_();\n\t\t\treturn true;\n\t\t}\n\n\n\t\t\/\/-----------------------------------------------------------------\/\/\n\t\t\/*!\n\t\t\t@brief 送信（ライト）\n\t\t\t@param[in] address スレーブアドレス（７ビット）\n\t\t\t@param[in]\tfirst\tファーストデータ\n\t\t\t@param[in]\tsrc\t元\n\t\t\t@param[in]\tnum\t数\n\t\t\t@return 失敗なら「false」が返る\n\t\t*\/\n\t\t\/\/-----------------------------------------------------------------\/\/\n\t\tbool send(uint8_t address, uint8_t first, const uint8_t* src, uint8_t num) {\n\t\t\tstart_();\n\t\t\twrite_(address << 1, false);\n\t\t\tif(ack_()) {\n\t\t\t\tstop_();\n\t\t\t\terror_ = error::address;\n\t\t\t\treturn false;\n\t\t\t}\n\n\t\t\tif(!write_(first)) {\n\t\t\t\tstop_();\n\t\t\t\terror_ = error::send_data;\n\t\t\t\treturn false;\n\t\t\t}\n\n\t\t\tif(!write_(src, num)) {\n\t\t\t\tstop_();\n\t\t\t\terror_ = error::send_data;\n\t\t\t\treturn false;\n\t\t\t}\n\t\t\tstop_();\n\t\t\treturn true;\n\t\t}\n\n\n\t\t\/\/-----------------------------------------------------------------\/\/\n\t\t\/*!\n\t\t\t@brief 送信（ライト）\n\t\t\t@param[in] address スレーブアドレス（７ビット）\n\t\t\t@param[in]\tfirst\tファースト・データ\n\t\t\t@param[in]\tsecond\tセカンド・データ\n\t\t\t@param[in]\tsrc\t元\n\t\t\t@param[in]\tnum\t数\n\t\t\t@return 失敗なら「false」が返る\n\t\t*\/\n\t\t\/\/-----------------------------------------------------------------\/\/\n\t\tbool send(uint8_t address, uint8_t first, uint8_t second, const uint8_t* src, uint8_t num) {\n\t\t\tstart_();\n\t\t\twrite_(address << 1, false);\n\t\t\tif(ack_()) {\n\t\t\t\tstop_();\n\t\t\t\terror_ = error::address;\n\t\t\t\treturn false;\n\t\t\t}\n\n\t\t\tif(!write_(first)) {\n\t\t\t\tstop_();\n\t\t\t\terror_ = error::send_data;\n\t\t\t\treturn false;\n\t\t\t}\n\t\t\tif(!write_(second)) {\n\t\t\t\tstop_();\n\t\t\t\terror_ = error::send_data;\n\t\t\t\treturn false;\n\t\t\t}\n\t\t\tif(!write_(src, num)) {\n\t\t\t\tstop_();\n\t\t\t\terror_ = error::send_data;\n\t\t\t\treturn false;\n\t\t\t}\n\t\t\tstop_();\n\t\t\treturn true;\n\t\t}\n\t};\n}\n<|endoftext|>"} {"text":"<commit_before>#include \"gl\/impl\/backend\/vk2\/hardware\/queue.hpp\"\n#if TZ_VULKAN\n#include \"gl\/impl\/backend\/vk2\/descriptors.hpp\"\n\nnamespace tz::gl::vk2\n{\n\tDescriptorLayoutBindlessFlagsInfo::NativeType DescriptorLayoutBindlessFlagsInfo::native() const\n\t{\n\t\treturn\n\t\t{\n\t\t\t.sType = VK_STRUCTURE_TYPE_DESCRIPTOR_SET_LAYOUT_BINDING_FLAGS_CREATE_INFO,\n\t\t\t.pNext = nullptr,\n\t\t\t.bindingCount = static_cast<std::uint32_t>(this->binding_flags.length()),\n\t\t\t.pBindingFlags = this->binding_flags.data()\n\t\t};\n\t}\n\n\tDescriptorLayoutBuilder::DescriptorLayoutBuilder(const LogicalDevice& logical_device):\n\tlogical_device(&logical_device),\n\tdescriptors()\n\t{}\n\n\tDescriptorLayoutBuilder& DescriptorLayoutBuilder::with_descriptor(DescriptorType desc)\n\t{\n\t\tthis->descriptors.push_back(desc);\n\t\treturn *this;\n\t}\n\n\tDescriptorLayoutInfo DescriptorLayoutBuilder::build() const\n\t{\n\t\tDescriptorLayoutInfo info;\n\t\tinfo.context = DescriptorContext::Classic;\n\t\tinfo.bindings.resize(this->descriptors.size());\n\t\tfor(std::size_t i = 0; i < this->descriptors.size(); i++)\n\t\t{\n\t\t\tVkDescriptorSetLayoutBinding& binding = info.bindings[i];\n\t\t\tbinding.binding = i;\n\t\t\tbinding.descriptorType = static_cast<VkDescriptorType>(this->descriptors[i]);\n\t\t\tbinding.descriptorCount = 1;\n\t\t\t\/\/ TODO: Improve\n\t\t\tbinding.stageFlags = VK_SHADER_STAGE_ALL;\n\t\t\t\/\/ TODO: Improve\n\t\t\tbinding.pImmutableSamplers = nullptr;\n\t\t}\n\t\tinfo.logical_device = this->logical_device;\n\t\treturn info;\n\t}\n\n\tDescriptorLayoutBuilderBindless::DescriptorLayoutBuilderBindless(const LogicalDevice& logical_device):\n\tlogical_device(&logical_device),\n\tdescriptors(){}\n\n\tDescriptorLayoutBuilderBindless& DescriptorLayoutBuilderBindless::with_descriptor(DescriptorType desc, std::size_t descriptor_count)\n\t{\n\t\tthis->descriptors.push_back({.type = desc, .count = static_cast<std::uint32_t>(descriptor_count)});\n\t\treturn *this;\n\t}\n\n\tDescriptorLayoutInfo DescriptorLayoutBuilderBindless::build() const\n\t{\n\t\tconstexpr VkDescriptorBindingFlags vk_bindless_flags_head =\n\t\t\tVK_DESCRIPTOR_BINDING_UPDATE_AFTER_BIND_BIT &\n\t\t\tVK_DESCRIPTOR_BINDING_UPDATE_UNUSED_WHILE_PENDING_BIT &\n\t\t\tVK_DESCRIPTOR_BINDING_PARTIALLY_BOUND_BIT;\n\t\tconstexpr VkDescriptorBindingFlags vk_bindless_flags_tail =\n\t\t\tVK_DESCRIPTOR_BINDING_UPDATE_AFTER_BIND_BIT &\n\t\t\tVK_DESCRIPTOR_BINDING_UPDATE_UNUSED_WHILE_PENDING_BIT &\n\t\t\tVK_DESCRIPTOR_BINDING_PARTIALLY_BOUND_BIT &\n\t\t\tVK_DESCRIPTOR_BINDING_VARIABLE_DESCRIPTOR_COUNT_BIT;\n\n\t\tDescriptorLayoutBindlessFlagsInfo bindless_flags;\n\t\tbindless_flags.binding_flags.resize(this->descriptors.size());\n\t\t\/\/ binding_flags = {head, head, head, ..., head, head, tail}\n\t\tstd::for_each(bindless_flags.binding_flags.begin(), bindless_flags.binding_flags.end(),\n\t\t[](VkDescriptorBindingFlags& flags){flags = vk_bindless_flags_head;});\n\t\tbindless_flags.binding_flags.back() = vk_bindless_flags_tail;\n\n\t\tDescriptorLayoutInfo info;\n\t\tinfo.context = DescriptorContext::Bindless;\n\t\tinfo.maybe_bindless_flags = bindless_flags;\n\t\tinfo.bindings.resize(this->descriptors.size());\n\t\tfor(std::size_t i = 0; i < this->descriptors.size(); i++)\n\t\t{\n\t\t\tconst DescriptorLayoutElementInfo& elem = this->descriptors[i];\n\n\t\t\tVkDescriptorSetLayoutBinding& binding = info.bindings[i];\n\t\t\tbinding.binding = i;\n\t\t\tbinding.descriptorType = static_cast<VkDescriptorType>(elem.type);\n\t\t\tbinding.descriptorCount = elem.count;\n\t\t\t\/\/ TODO: Improve\n\t\t\tbinding.stageFlags = VK_SHADER_STAGE_ALL;\n\t\t\t\/\/ TODO: Improve\n\t\t\tbinding.pImmutableSamplers = nullptr;\n\t\t}\n\t\tinfo.logical_device = this->logical_device;\n\t\treturn info;\n\t}\n\n\tDescriptorLayout::DescriptorLayout(const DescriptorLayoutInfo& info):\n\tdescriptor_layout(VK_NULL_HANDLE),\n\tlogical_device(info.logical_device)\n\t{\n\t\tVkDescriptorSetLayoutCreateInfo create{};\n\t\tVkDescriptorSetLayoutBindingFlagsCreateInfo create_bindless{};\n\t\tswitch(info.context)\n\t\t{\n\t\t\tcase DescriptorContext::Classic:\n\t\t\t\tcreate =\n\t\t\t\t{\n\t\t\t\t\t.sType = VK_STRUCTURE_TYPE_DESCRIPTOR_SET_LAYOUT_CREATE_INFO,\n\t\t\t\t\t.pNext = nullptr,\n\t\t\t\t\t.flags = 0,\n\t\t\t\t\t.bindingCount = static_cast<std::uint32_t>(info.bindings.length()),\n\t\t\t\t\t.pBindings = info.bindings.data()\n\t\t\t\t};\n\t\t\tbreak;\n\t\t\tcase DescriptorContext::Bindless:\n\t\t\t\ttz_assert(info.maybe_bindless_flags.has_value(), \"DescriptorLayoutInfo contains DescriptorContext::Bindless, but no bindless flags were specified. Please submit a bug report\");\n\t\t\t\tcreate_bindless = info.maybe_bindless_flags.value().native();\n\t\t\t\tcreate = \n\t\t\t\t{\n\t\t\t\t\t.sType = VK_STRUCTURE_TYPE_DESCRIPTOR_SET_LAYOUT_CREATE_INFO,\n\t\t\t\t\t.pNext = &create_bindless,\n\t\t\t\t\t.bindingCount = static_cast<std::uint32_t>(info.bindings.length()),\n\t\t\t\t\t.pBindings = info.bindings.data()\n\t\t\t\t};\n\t\t\tbreak;\n\t\t\tdefault:\n\t\t\t\ttz_error(\"Unrecognised DescriptorContext\");\n\t\t\tbreak;\n\t\t}\n\n\t\tVkResult res = vkCreateDescriptorSetLayout(this->logical_device->native(), &create, nullptr, &this->descriptor_layout);\n\t\tswitch(res)\n\t\t{\n\t\t\tcase VK_SUCCESS:\n\t\t\t\t\/\/ do nothing\n\t\t\tbreak;\n\t\t\tcase VK_ERROR_OUT_OF_HOST_MEMORY:\n\t\t\t\ttz_error(\"Failed to create DescriptorLayout because we ran out of host memory (RAM). Please ensure that your system meets the minimum requirements.\");\n\t\t\tbreak;\n\t\t\tcase VK_ERROR_OUT_OF_DEVICE_MEMORY:\n\t\t\t\ttz_error(\"Failed to create DescriptorLayout because we ran out of device memory (VRAM). Please ensure that your system meets the minimum requirements.\");\n\t\t\tbreak;\n\t\t\tdefault:\n\t\t\t\ttz_error(\"Failed to create DescriptorSetLayout but cannot determine why. Please submit a bug report.\");\n\t\t\tbreak;\n\t\t}\n\t}\n\n\tDescriptorLayout::DescriptorLayout(DescriptorLayout&& move):\n\tdescriptor_layout(VK_NULL_HANDLE),\n\tlogical_device(nullptr)\n\t{\n\t\t*this = std::move(move);\n\t}\n\n\tDescriptorLayout::~DescriptorLayout()\n\t{\n\t\tif(this->descriptor_layout != VK_NULL_HANDLE)\n\t\t{\n\t\t\ttz_assert(this->logical_device != nullptr && !this->logical_device->is_null(), \"Cannot destroy DescriptorLayout because LogicalDevice provided is nullptr or a null device.\");\n\t\t\tvkDestroyDescriptorSetLayout(this->logical_device->native(), this->descriptor_layout, nullptr);\n\t\t\tthis->descriptor_layout = VK_NULL_HANDLE;\n\t\t}\n\t}\n\n\tDescriptorLayout& DescriptorLayout::operator=(DescriptorLayout&& rhs)\n\t{\n\t\tstd::swap(this->descriptor_layout, rhs.descriptor_layout);\n\t\tstd::swap(this->logical_device, rhs.logical_device);\n\t\treturn *this;\n\t}\n\n\tDescriptorLayout::NativeType DescriptorLayout::native() const\n\t{\n\t\treturn this->descriptor_layout;\n\t}\n}\n\n#endif \/\/ TZ_VULKAN\n<commit_msg>* More bindless support work<commit_after>#include \"gl\/impl\/backend\/vk2\/hardware\/queue.hpp\"\n#if TZ_VULKAN\n#include \"gl\/impl\/backend\/vk2\/descriptors.hpp\"\n\nnamespace tz::gl::vk2\n{\n\tDescriptorLayoutBindlessFlagsInfo::NativeType DescriptorLayoutBindlessFlagsInfo::native() const\n\t{\n\t\treturn\n\t\t{\n\t\t\t.sType = VK_STRUCTURE_TYPE_DESCRIPTOR_SET_LAYOUT_BINDING_FLAGS_CREATE_INFO,\n\t\t\t.pNext = nullptr,\n\t\t\t.bindingCount = static_cast<std::uint32_t>(this->binding_flags.length()),\n\t\t\t.pBindingFlags = this->binding_flags.data()\n\t\t};\n\t}\n\n\tDescriptorLayoutBuilder::DescriptorLayoutBuilder(const LogicalDevice& logical_device):\n\tlogical_device(&logical_device),\n\tdescriptors()\n\t{}\n\n\tDescriptorLayoutBuilder& DescriptorLayoutBuilder::with_descriptor(DescriptorType desc)\n\t{\n\t\tthis->descriptors.push_back(desc);\n\t\treturn *this;\n\t}\n\n\tDescriptorLayoutInfo DescriptorLayoutBuilder::build() const\n\t{\n\t\tDescriptorLayoutInfo info;\n\t\tinfo.context = DescriptorContext::Classic;\n\t\tinfo.bindings.resize(this->descriptors.size());\n\t\tfor(std::size_t i = 0; i < this->descriptors.size(); i++)\n\t\t{\n\t\t\tVkDescriptorSetLayoutBinding& binding = info.bindings[i];\n\t\t\tbinding.binding = i;\n\t\t\tbinding.descriptorType = static_cast<VkDescriptorType>(this->descriptors[i]);\n\t\t\tbinding.descriptorCount = 1;\n\t\t\t\/\/ TODO: Improve\n\t\t\tbinding.stageFlags = VK_SHADER_STAGE_ALL;\n\t\t\t\/\/ TODO: Improve\n\t\t\tbinding.pImmutableSamplers = nullptr;\n\t\t}\n\t\tinfo.logical_device = this->logical_device;\n\t\treturn info;\n\t}\n\n\tDescriptorLayoutBuilderBindless::DescriptorLayoutBuilderBindless(const LogicalDevice& logical_device):\n\tlogical_device(&logical_device),\n\tdescriptors(){}\n\n\tDescriptorLayoutBuilderBindless& DescriptorLayoutBuilderBindless::with_descriptor(DescriptorType desc, std::size_t descriptor_count)\n\t{\n\t\tthis->descriptors.push_back({.type = desc, .count = static_cast<std::uint32_t>(descriptor_count)});\n\t\treturn *this;\n\t}\n\n\tDescriptorLayoutInfo DescriptorLayoutBuilderBindless::build() const\n\t{\n\t\tconstexpr VkDescriptorBindingFlags vk_bindless_flags_head =\n\t\t\tVK_DESCRIPTOR_BINDING_UPDATE_AFTER_BIND_BIT |\n\t\t\tVK_DESCRIPTOR_BINDING_UPDATE_UNUSED_WHILE_PENDING_BIT |\n\t\t\tVK_DESCRIPTOR_BINDING_PARTIALLY_BOUND_BIT;\n\t\tconstexpr VkDescriptorBindingFlags vk_bindless_flags_tail =\n\t\t\tvk_bindless_flags_head |\n\t\t\tVK_DESCRIPTOR_BINDING_VARIABLE_DESCRIPTOR_COUNT_BIT;\n\n\t\tDescriptorLayoutBindlessFlagsInfo bindless_flags;\n\t\tbindless_flags.binding_flags.resize(this->descriptors.size());\n\t\t\/\/ binding_flags = {head, head, head, ..., head, head, tail}\n\t\tstd::for_each(bindless_flags.binding_flags.begin(), bindless_flags.binding_flags.end(),\n\t\t[](VkDescriptorBindingFlags& flags){flags = vk_bindless_flags_head;});\n\t\tbindless_flags.binding_flags.back() = vk_bindless_flags_tail;\n\n\t\tDescriptorLayoutInfo info;\n\t\tinfo.context = DescriptorContext::Bindless;\n\t\tinfo.maybe_bindless_flags = bindless_flags;\n\t\tinfo.bindings.resize(this->descriptors.size());\n\t\tfor(std::size_t i = 0; i < this->descriptors.size(); i++)\n\t\t{\n\t\t\tconst DescriptorLayoutElementInfo& elem = this->descriptors[i];\n\n\t\t\tVkDescriptorSetLayoutBinding& binding = info.bindings[i];\n\t\t\tbinding.binding = i;\n\t\t\tbinding.descriptorType = static_cast<VkDescriptorType>(elem.type);\n\t\t\tbinding.descriptorCount = elem.count;\n\t\t\t\/\/ TODO: Improve\n\t\t\tbinding.stageFlags = VK_SHADER_STAGE_ALL;\n\t\t\t\/\/ TODO: Improve\n\t\t\tbinding.pImmutableSamplers = nullptr;\n\t\t}\n\t\tinfo.logical_device = this->logical_device;\n\t\treturn info;\n\t}\n\n\tDescriptorLayout::DescriptorLayout(const DescriptorLayoutInfo& info):\n\tdescriptor_layout(VK_NULL_HANDLE),\n\tlogical_device(info.logical_device)\n\t{\n\t\tVkDescriptorSetLayoutCreateInfo create{};\n\t\tVkDescriptorSetLayoutBindingFlagsCreateInfo create_bindless{};\n\t\tswitch(info.context)\n\t\t{\n\t\t\tcase DescriptorContext::Classic:\n\t\t\t\tcreate =\n\t\t\t\t{\n\t\t\t\t\t.sType = VK_STRUCTURE_TYPE_DESCRIPTOR_SET_LAYOUT_CREATE_INFO,\n\t\t\t\t\t.pNext = nullptr,\n\t\t\t\t\t.flags = 0,\n\t\t\t\t\t.bindingCount = static_cast<std::uint32_t>(info.bindings.length()),\n\t\t\t\t\t.pBindings = info.bindings.data()\n\t\t\t\t};\n\t\t\tbreak;\n\t\t\tcase DescriptorContext::Bindless:\n\t\t\t\ttz_assert(info.maybe_bindless_flags.has_value(), \"DescriptorLayoutInfo contains DescriptorContext::Bindless, but no bindless flags were specified. Please submit a bug report\");\n\t\t\t\tcreate_bindless = info.maybe_bindless_flags.value().native();\n\t\t\t\tcreate = \n\t\t\t\t{\n\t\t\t\t\t.sType = VK_STRUCTURE_TYPE_DESCRIPTOR_SET_LAYOUT_CREATE_INFO,\n\t\t\t\t\t.pNext = &create_bindless,\n\t\t\t\t\t.flags = VK_DESCRIPTOR_SET_LAYOUT_CREATE_UPDATE_AFTER_BIND_POOL_BIT,\n\t\t\t\t\t.bindingCount = static_cast<std::uint32_t>(info.bindings.length()),\n\t\t\t\t\t.pBindings = info.bindings.data()\n\t\t\t\t};\n\t\t\tbreak;\n\t\t\tdefault:\n\t\t\t\ttz_error(\"Unrecognised DescriptorContext\");\n\t\t\tbreak;\n\t\t}\n\n\t\tVkResult res = vkCreateDescriptorSetLayout(this->logical_device->native(), &create, nullptr, &this->descriptor_layout);\n\t\tswitch(res)\n\t\t{\n\t\t\tcase VK_SUCCESS:\n\t\t\t\t\/\/ do nothing\n\t\t\tbreak;\n\t\t\tcase VK_ERROR_OUT_OF_HOST_MEMORY:\n\t\t\t\ttz_error(\"Failed to create DescriptorLayout because we ran out of host memory (RAM). Please ensure that your system meets the minimum requirements.\");\n\t\t\tbreak;\n\t\t\tcase VK_ERROR_OUT_OF_DEVICE_MEMORY:\n\t\t\t\ttz_error(\"Failed to create DescriptorLayout because we ran out of device memory (VRAM). Please ensure that your system meets the minimum requirements.\");\n\t\t\tbreak;\n\t\t\tdefault:\n\t\t\t\ttz_error(\"Failed to create DescriptorSetLayout but cannot determine why. Please submit a bug report.\");\n\t\t\tbreak;\n\t\t}\n\t}\n\n\tDescriptorLayout::DescriptorLayout(DescriptorLayout&& move):\n\tdescriptor_layout(VK_NULL_HANDLE),\n\tlogical_device(nullptr)\n\t{\n\t\t*this = std::move(move);\n\t}\n\n\tDescriptorLayout::~DescriptorLayout()\n\t{\n\t\tif(this->descriptor_layout != VK_NULL_HANDLE)\n\t\t{\n\t\t\ttz_assert(this->logical_device != nullptr && !this->logical_device->is_null(), \"Cannot destroy DescriptorLayout because LogicalDevice provided is nullptr or a null device.\");\n\t\t\tvkDestroyDescriptorSetLayout(this->logical_device->native(), this->descriptor_layout, nullptr);\n\t\t\tthis->descriptor_layout = VK_NULL_HANDLE;\n\t\t}\n\t}\n\n\tDescriptorLayout& DescriptorLayout::operator=(DescriptorLayout&& rhs)\n\t{\n\t\tstd::swap(this->descriptor_layout, rhs.descriptor_layout);\n\t\tstd::swap(this->logical_device, rhs.logical_device);\n\t\treturn *this;\n\t}\n\n\tDescriptorLayout::NativeType DescriptorLayout::native() const\n\t{\n\t\treturn this->descriptor_layout;\n\t}\n}\n\n#endif \/\/ TZ_VULKAN\n<|endoftext|>"} {"text":"<commit_before>\/*************************************************************************\n *\n * OpenOffice.org - a multi-platform office productivity suite\n *\n * $RCSfile: i_ce.hxx,v $\n *\n * $Revision: 1.3 $\n *\n * last change: $Author: hr $ $Date: 2007-11-02 15:05:28 $\n *\n * The Contents of this file are made available subject to\n * the terms of GNU Lesser General Public License Version 2.1.\n *\n *\n * GNU Lesser General Public License Version 2.1\n * =============================================\n * Copyright 2005 by Sun Microsystems, Inc.\n * 901 San Antonio Road, Palo Alto, CA 94303, USA\n *\n * This library is free software; you can redistribute it and\/or\n * modify it under the terms of the GNU Lesser General Public\n * License version 2.1, as published by the Free Software Foundation.\n *\n * This library is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU\n * Lesser General Public License for more details.\n *\n * You should have received a copy of the GNU Lesser General Public\n * License along with this library; if not, write to the Free Software\n * Foundation, Inc., 59 Temple Place, Suite 330, Boston,\n * MA 02111-1307 USA\n *\n ************************************************************************\/\n\n#ifndef ARY_IDL_I_CE_HXX\n#define ARY_IDL_I_CE_HXX\n\n\/\/ BASE CLASSES\n#include <ary\/entity.hxx>\n\/\/ USED SERVICES\n#include <ary\/doc\/d_docu.hxx>\n#include <ary\/idl\/i_ce2s.hxx>\n#include <ary\/idl\/i_types4idl.hxx>\n\n\n\n\n\n\nnamespace ary\n{\nnamespace idl\n{\n\n\n\/** @resp Base class for all IDL code entities.\n\n A @->CodeEntity is a namespace, type, data or function, which occures in\n the parsed UNO IDL code and is described and\/or commented within the\n Autodoc repository.\n\n This is a storage base class, where more special classes are\n derived from.\n*\/\nclass CodeEntity : public ary::Entity\n{\n public:\n \/\/ LIFECYCLE\n virtual ~CodeEntity();\n\n \/\/ OPERATION\n\n \/\/ INQUIRY\n Ce_id CeId() const { return Ce_id(Id()); }\n const String & LocalName() const;\n Ce_id NameRoom() const;\n Ce_id Owner() const;\n E_SightLevel SightLevel() const;\n\n const ary::doc::Documentation &\n Docu() const;\n const Ce_2s & Secondaries() const;\n\n static const CodeEntity &\n Null_();\n \/\/ ACCESS\n void Set_Docu(\n DYN ary::doc::Node &\n pass_data );\n Ce_2s & Secondaries();\n\n protected:\n CodeEntity();\n private:\n \/\/ Locals\n virtual const String & inq_LocalName() const = 0;\n virtual Ce_id inq_NameRoom() const = 0;\n virtual Ce_id inq_Owner() const = 0;\n virtual E_SightLevel inq_SightLevel() const = 0;\n\n \/\/ DATA\n ary::doc::Documentation\n aDocu;\n Dyn<Ce_2s> p2s;\n};\n\n\n\n\n\/\/ IMPLEMENTATION\ninline const String &\nCodeEntity::LocalName() const\n { return inq_LocalName(); }\n\ninline Ce_id\nCodeEntity::NameRoom() const\n { return inq_NameRoom(); }\n\ninline Ce_id\nCodeEntity::Owner() const\n { return inq_Owner(); }\n\ninline E_SightLevel\nCodeEntity::SightLevel() const\n { return inq_SightLevel(); }\n\ninline const ary::doc::Documentation &\nCodeEntity::Docu() const\n { return aDocu; }\n\ninline void\nCodeEntity::Set_Docu(DYN ary::doc::Node & pass_data)\n{\n aDocu.Set_Data(pass_data);\n}\n\n\n\n\n} \/\/ namespace idl\n} \/\/ namespace ary\n#endif\n<commit_msg>INTEGRATION: CWS changefileheader (1.3.22); FILE MERGED 2008\/03\/28 16:01:13 rt 1.3.22.1: #i87441# Change license header to LPGL v3.<commit_after>\/*************************************************************************\n *\n * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.\n *\n * Copyright 2008 by Sun Microsystems, Inc.\n *\n * OpenOffice.org - a multi-platform office productivity suite\n *\n * $RCSfile: i_ce.hxx,v $\n * $Revision: 1.4 $\n *\n * This file is part of OpenOffice.org.\n *\n * OpenOffice.org is free software: you can redistribute it and\/or modify\n * it under the terms of the GNU Lesser General Public License version 3\n * only, as published by the Free Software Foundation.\n *\n * OpenOffice.org is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the\n * GNU Lesser General Public License version 3 for more details\n * (a copy is included in the LICENSE file that accompanied this code).\n *\n * You should have received a copy of the GNU Lesser General Public License\n * version 3 along with OpenOffice.org. If not, see\n * <http:\/\/www.openoffice.org\/license.html>\n * for a copy of the LGPLv3 License.\n *\n ************************************************************************\/\n\n#ifndef ARY_IDL_I_CE_HXX\n#define ARY_IDL_I_CE_HXX\n\n\/\/ BASE CLASSES\n#include <ary\/entity.hxx>\n\/\/ USED SERVICES\n#include <ary\/doc\/d_docu.hxx>\n#include <ary\/idl\/i_ce2s.hxx>\n#include <ary\/idl\/i_types4idl.hxx>\n\n\n\n\n\n\nnamespace ary\n{\nnamespace idl\n{\n\n\n\/** @resp Base class for all IDL code entities.\n\n A @->CodeEntity is a namespace, type, data or function, which occures in\n the parsed UNO IDL code and is described and\/or commented within the\n Autodoc repository.\n\n This is a storage base class, where more special classes are\n derived from.\n*\/\nclass CodeEntity : public ary::Entity\n{\n public:\n \/\/ LIFECYCLE\n virtual ~CodeEntity();\n\n \/\/ OPERATION\n\n \/\/ INQUIRY\n Ce_id CeId() const { return Ce_id(Id()); }\n const String & LocalName() const;\n Ce_id NameRoom() const;\n Ce_id Owner() const;\n E_SightLevel SightLevel() const;\n\n const ary::doc::Documentation &\n Docu() const;\n const Ce_2s & Secondaries() const;\n\n static const CodeEntity &\n Null_();\n \/\/ ACCESS\n void Set_Docu(\n DYN ary::doc::Node &\n pass_data );\n Ce_2s & Secondaries();\n\n protected:\n CodeEntity();\n private:\n \/\/ Locals\n virtual const String & inq_LocalName() const = 0;\n virtual Ce_id inq_NameRoom() const = 0;\n virtual Ce_id inq_Owner() const = 0;\n virtual E_SightLevel inq_SightLevel() const = 0;\n\n \/\/ DATA\n ary::doc::Documentation\n aDocu;\n Dyn<Ce_2s> p2s;\n};\n\n\n\n\n\/\/ IMPLEMENTATION\ninline const String &\nCodeEntity::LocalName() const\n { return inq_LocalName(); }\n\ninline Ce_id\nCodeEntity::NameRoom() const\n { return inq_NameRoom(); }\n\ninline Ce_id\nCodeEntity::Owner() const\n { return inq_Owner(); }\n\ninline E_SightLevel\nCodeEntity::SightLevel() const\n { return inq_SightLevel(); }\n\ninline const ary::doc::Documentation &\nCodeEntity::Docu() const\n { return aDocu; }\n\ninline void\nCodeEntity::Set_Docu(DYN ary::doc::Node & pass_data)\n{\n aDocu.Set_Data(pass_data);\n}\n\n\n\n\n} \/\/ namespace idl\n} \/\/ namespace ary\n#endif\n<|endoftext|>"} {"text":"<commit_before>\n#include \"integrators\/explicit_embedded_runge_kutta_nyström_integrator.hpp\"\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\nnamespace principia {\n\nusing quantities::Abs;\nusing quantities::Length;\nusing si::Metre;\nusing si::Milli;\nusing si::Second;\nusing testing_utilities::ComputeHarmonicOscillatorAcceleration;\nusing ::std::placeholders::_1;\nusing ::std::placeholders::_2;\nusing ::std::placeholders::_3;\n\nnamespace integrators {\n\nnamespace {\n\ndouble HarmonicOscillatorToleranceRatio(\n Time const& h,\n std::vector<Length> const& q_error_estimate,\n std::vector<Speed> const& v_error_estimate,\n Length const& q_tolerance,\n Speed const& v_tolerance) {\n double const r = std::min(q_tolerance \/ Abs(q_error_estimate[0]),\n v_tolerance \/ Abs(v_error_estimate[0]));\n LOG(ERROR) << (r > 1.0 ? \"Accepting\" : \"REJECTING\") << \" step size \"\n << h << \" with ratio \" << r;\n return r;\n}\n\n} \/\/ namespace\n\nclass ExplicitEmbeddedRungeKuttaNyströmIntegratorTest\n : public ::testing::Test {};\n\nTEST_F(ExplicitEmbeddedRungeKuttaNyströmIntegratorTest, Dummy) {\n ExplicitEmbeddedRungeKuttaNyströmIntegrator const& integrator =\n DormandElMikkawyPrince1986RKN434FM();\n\n ExplicitEmbeddedRungeKuttaNyströmIntegrator::Solution<Length, Speed> solution;\n integrator.Solve<Length>(\n ComputeHarmonicOscillatorAcceleration,\n {{1 * Metre}, {0 * Metre \/ Second}, 0 * Second},\n 10 * π * Second,\n 10 * π * Second,\n std::bind(HarmonicOscillatorToleranceRatio,\n _1, _2, _3, 1 * Milli(Metre), 1 * Milli(Metre) \/ Second),\n 0.9,\n &solution);\n LOG(ERROR) << solution.back().positions[0].value;\n LOG(ERROR) << solution.back().momenta[0].value;\n LOG(ERROR) << solution.back().time.value;\n integrator.Solve<Length>(\n ComputeHarmonicOscillatorAcceleration,\n solution.back(),\n 0 * Second,\n -10 * π * Second,\n std::bind(HarmonicOscillatorToleranceRatio,\n _1, _2, _3, 1 * Milli(Metre), 1 * Milli(Metre) \/ Second),\n 0.9,\n &solution);\n LOG(ERROR) << solution.back().positions[0].value;\n LOG(ERROR) << solution.back().momenta[0].value;\n LOG(ERROR) << solution.back().time.value;\n}\n\n} \/\/ namespace integrators\n} \/\/ namespace principia\n<commit_msg>actually test things<commit_after>\n#include \"integrators\/explicit_embedded_runge_kutta_nyström_integrator.hpp\"\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 testing_utilities::ComputeHarmonicOscillatorAcceleration;\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\nnamespace {\n\ndouble HarmonicOscillatorToleranceRatio(\n Time const& h,\n std::vector<Length> const& q_error_estimate,\n std::vector<Speed> const& v_error_estimate,\n Length const& q_tolerance,\n Speed const& v_tolerance) {\n double const r = std::min(q_tolerance \/ Abs(q_error_estimate[0]),\n v_tolerance \/ Abs(v_error_estimate[0]));\n LOG(INFO) << (r > 1.0 ? \"Accepting\" : \"Rejecting\") << \" step size \"\n << h << \" with ratio \" << r;\n return r;\n}\n\n} \/\/ namespace\n\nclass ExplicitEmbeddedRungeKuttaNyströmIntegratorTest\n : public ::testing::Test {};\n\nTEST_F(ExplicitEmbeddedRungeKuttaNyströmIntegratorTest,\n HarmonicOscillatorBackAndForth) {\n ExplicitEmbeddedRungeKuttaNyströmIntegrator const& integrator =\n DormandElMikkawyPrince1986RKN434FM();\n Length const x_0 = 1 * Metre;\n Speed const v_0 = 0 * Metre \/ Second;\n Time const period = 2 * π * Second;\n Time const t_0 = 0 * Second;\n Time const t_final = 10 * period;\n\n ExplicitEmbeddedRungeKuttaNyströmIntegrator::Solution<Length, Speed> solution;\n integrator.Solve<Length>(\n ComputeHarmonicOscillatorAcceleration,\n {{x_0}, {v_0}, t_0},\n t_final,\n t_final - t_0,\n std::bind(HarmonicOscillatorToleranceRatio,\n _1, _2, _3, 1 * Milli(Metre), 1 * Milli(Metre) \/ Second),\n 0.9,\n &solution);\n EXPECT_THAT(AbsoluteError(x_0, solution.back().positions[0].value),\n AllOf(Ge(1 * Milli(Metre)), Le(2 * Milli(Metre))));\n EXPECT_THAT(AbsoluteError(v_0, solution.back().momenta[0].value),\n AllOf(Ge(1 * Centi(Metre) \/ Second),\n Le(2 * Centi(Metre) \/ Second)));\n EXPECT_EQ(t_final, solution.back().time.value);\n integrator.Solve<Length>(\n ComputeHarmonicOscillatorAcceleration,\n solution.back(),\n t_0,\n t_0 - t_final,\n std::bind(HarmonicOscillatorToleranceRatio,\n _1, _2, _3, 1 * Milli(Metre), 1 * Milli(Metre) \/ Second),\n 0.9,\n &solution);\n EXPECT_THAT(AbsoluteError(x_0, solution.back().positions[0].value),\n AllOf(Ge(3 * Milli(Metre)), Le(4 * Milli(Metre))));\n EXPECT_THAT(AbsoluteError(v_0, solution.back().momenta[0].value),\n AllOf(Ge(1E-5 * Metre \/ Second),\n Le(1E-4 * Centi(Metre) \/ Second)));\n EXPECT_EQ(t_0, solution.back().time.value);\n}\n\n} \/\/ namespace integrators\n} \/\/ namespace principia\n<|endoftext|>"} {"text":"<commit_before>\/\/ $Id$\n\/\/ -*-C++-*-\n\/\/ * BeginRiceCopyright *****************************************************\n\/\/ \n\/\/ Copyright ((c)) 2002, Rice University \n\/\/ All rights reserved.\n\/\/ \n\/\/ Redistribution and use in source and binary forms, with or without\n\/\/ modification, are permitted provided that the following conditions are\n\/\/ met:\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 Rice University (RICE) 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 RICE and contributors \"as is\" and any\n\/\/ express or implied warranties, including, but not limited to, the\n\/\/ implied warranties of merchantability and fitness for a particular\n\/\/ purpose are disclaimed. In no event shall RICE 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\n\/\/ business interruption) however caused and on any theory of liability,\n\/\/ whether in contract, strict liability, or tort (including negligence\n\/\/ or otherwise) arising in any way out of the use of this software, even\n\/\/ if advised of the possibility of such damage. \n\/\/ \n\/\/ ******************************************************* EndRiceCopyright *\n\n\/\/***************************************************************************\n\/\/\n\/\/ File:\n\/\/ PCProfileUtils.C\n\/\/\n\/\/ Purpose:\n\/\/ [The purpose of this file]\n\/\/\n\/\/ Description:\n\/\/ [The set of functions, macros, etc. defined in the file]\n\/\/\n\/\/***************************************************************************\n\n\/\/************************* System Include Files ****************************\n\n#include <iostream>\n#include <fstream>\n#include <map>\n\n#ifdef NO_STD_CHEADERS\n# include <string.h>\n#else\n# include <cstring>\nusing namespace std; \/\/ For compatibility with non-std C headers\n#endif\n\n\/\/*************************** User Include Files ****************************\n\n#include <include\/general.h>\n\n#include \"PCProfileUtils.h\"\n#include \"PCProfile.h\"\n\n#include <lib\/binutils\/LoadModule.h>\n#include <lib\/binutils\/Section.h>\n#include <lib\/binutils\/Procedure.h>\n#include <lib\/binutils\/Instruction.h>\n#include <lib\/binutils\/PCToSrcLineMap.h>\n#include <lib\/binutils\/BinUtils.h>\n#include <lib\/support\/String.h> \n#include <lib\/xml\/xml.h>\n\n\/\/*************************** Forward Declarations ***************************\n\nusing namespace xml;\n\nusing std::ostream;\nusing std::cerr;\nusing std::endl;\nusing std::hex;\nusing std::dec;\n\n\/\/ LineToPCProfileVecMap\n\nstruct lt_SrcLineX\n{\n \/\/ return true if s1 < s2; false otherwise\n bool operator()(const SrcLineX* s1, const SrcLineX* s2) const\n {\n if (s1->GetSrcLine() == s2->GetSrcLine()) {\n return (s1->GetSrcLineX() < s2->GetSrcLineX());\n } else {\n return (s1->GetSrcLine() < s2->GetSrcLine());\n }\n }\n};\n\ntypedef std::map<SrcLineX*, PCProfileVec*, lt_SrcLineX> LineToPCProfileVecMap;\ntypedef std::map<SrcLineX*, PCProfileVec*, lt_SrcLineX>::iterator\n LineToPCProfileVecMapIt;\ntypedef std::map<SrcLineX*, PCProfileVec*>::value_type\n LineToPCProfileVecMapVal;\n\nvoid DumpFuncLineMap(ostream& ofile, LineToPCProfileVecMap& map,\n\t\t PCProfile* profData,\n\t\t const char* func, const char* file);\nvoid ClearFuncLineMap(LineToPCProfileVecMap& map);\n\n\/\/****************************************************************************\n\/\/ Combine 'PCProfile' with symbolic info and dump\n\/\/****************************************************************************\n\nvoid\nDumpWithSymbolicInfo(ostream& os, PCProfile* profData, LoadModuleInfo* modInfo)\n{\n const char* profiledFile = profData->GetProfiledFile();\n PCProfileMetric* m = profData->GetMetric(0);\n const Addr txtStart = m->GetTxtStart(); \/\/ All metrics guaranteed to \n const Addr txtEnd = txtStart + m->GetTxtSz(); \/\/ have identical values.\n const unsigned long numMetrics = profData->GetMetricVecSz();\n\n \/\/ ------------------------------------------------------------------------\n \/\/ Dump header info\n \/\/ ------------------------------------------------------------------------ \n DumpProfileHeader(os);\n os << \"<PROFILE version=\\\"3.0\\\">\\n\";\n os << \"<PROFILEHDR>\\n\" << profData->GetHdrInfo() << \"<\/PROFILEHDR>\\n\";\n os << \"<PROFILEPARAMS>\\n\";\n {\n os << \"<TARGET name\"; WriteAttrStr(os, profiledFile); os << \"\/>\\n\";\n os << \"<METRICS>\\n\";\n for (suint i = 0; i < numMetrics; i++) {\n m = profData->GetMetric(i);\n os << \"<METRIC shortName\"; WriteAttrNum(os, i);\n os << \" nativeName\"; WriteAttrNum(os, m->GetName());\n os << \" period\"; WriteAttrNum(os, m->GetPeriod());\n \/\/ os << \" count_total\"; WriteAttrNum(os, m->GetTotalCount());\n os << \"\/>\\n\";\n }\n os << \"<\/METRICS>\\n\";\n os << \"<\/PROFILEPARAMS>\\n\";\n }\n\n \/\/ ------------------------------------------------------------------------\n \/\/ Iterate through the PC values of the text section, collect\n \/\/ symbolic information on a source line basis, and output the results\n \/\/ ------------------------------------------------------------------------ \n\n os << \"<PROFILESCOPETREE>\\n\";\n os << \"<PGM n\"; WriteAttrStr(os, profiledFile); os << \">\\n\";\n \n \/\/ 'funcLineMap' maps a line number to a 'PCProfileVec'. It should\n \/\/ contain information only for the current function, 'theFunc'.\n LineToPCProfileVecMap funcLineMap;\n\n for (LoadModuleSectionIterator it(*modInfo->GetLM()); it.IsValid(); ++it) {\n Section* sec = it.Current();\n if (sec->GetType() != Section::Text) { continue; }\n\n \/\/ We have a 'TextSection'. Iterate over procedures.\n TextSection* tsec = dynamic_cast<TextSection*>(sec);\n for (TextSectionProcedureIterator it(*tsec); it.IsValid(); ++it) {\n Procedure* p = it.Current();\n String pName = GetBestFuncName(p->GetName());\n\n \/\/ We have a 'Procedure'. Iterate over PC values\n String theFunc = pName, theFile; \n for (ProcedureInstructionIterator it(*p); it.IsValid(); ++it) {\n\tInstruction* inst = it.Current();\n\tAddr pc = inst->GetPC();\n\n\t\/\/ We want to iterate only over PC values for which counts are\n\t\/\/ recorded. Note: Every metric in 'profData' has entries for\n\t\/\/ the same pc values.\n\tif (profData->GetMetric(0)->Find(pc) == PCProfileDatum_NIL) {\n\t continue;\n\t}\n\n\t\/\/ --------------------------------------------------\n\t\/\/ Attempt to find symbolic information\n\t\/\/ --------------------------------------------------\n\tString func, file;\n\tSrcLineX srcLn; \n\tmodInfo->GetSymbolicInfo(pc, inst->GetOpIndex(), func, file, srcLn);\n\t\n\tif (theFile.Empty() && !file.Empty()) { theFile = file; }\n\t\n\t\/\/ Bad line numbers: cannot fix; advance iteration\n\tif (!IsValidLine(srcLn.GetSrcLine())) {\n\t continue; \/\/ No useful symbolic information; advance iteration\n\t}\n\n\t\/\/ Bad\/Different func name: ignore for now and use 'theFunc' (FIXME)\n\t\/\/ Bad file name: ignore and use 'theFile' (FIXME)\n\t \n\t\/\/ --------------------------------------------------\n\t\/\/ Update 'funcLineMap'\n\t\/\/ -------------------------------------------------- \n\tLineToPCProfileVecMapIt it1 = funcLineMap.find(&srcLn);\n\tif (it1 != funcLineMap.end()) { \/\/ found -- update counts\n\t PCProfileVec* vec = (*it1).second;\n\t for (unsigned long i = 0; i < numMetrics; i++) {\n\t m = profData->GetMetric(i);\n\t (*vec)[i] += m->Find(pc);\n\t BriefAssertion(m->Find(pc) != PCProfileDatum_NIL);\n\t } \n\t} else { \/\/ no entry found -- assign counts\n\t PCProfileVec* vec = new PCProfileVec(numMetrics);\n\t for (unsigned long i = 0; i < numMetrics; i++) {\n\t m = profData->GetMetric(i);\n\t (*vec)[i] = m->Find(pc);\n\t BriefAssertion(m->Find(pc) != PCProfileDatum_NIL);\n\t }\n\t \n\t \/\/ Don't keep 'vec' if all pc counts are 0.\n\t if (!vec->IsZeroed()) {\n\t funcLineMap.insert(LineToPCProfileVecMapVal(new SrcLineX(srcLn),\n\t\t\t\t\t\t\tvec));\n\t } else {\n\t delete vec;\n\t }\n\t}\n }\n\n \/\/ --------------------------------------------------\n \/\/ Dump the contents of 'funcLineMap'\n \/\/ --------------------------------------------------\n if (funcLineMap.size() > 0 && !theFunc.Empty() && !theFile.Empty()) {\n\tDumpFuncLineMap(os, funcLineMap, profData, theFunc, theFile);\n }\n ClearFuncLineMap(funcLineMap); \/\/ clears map and memory\n \n }\n }\n \n os << \"<\/PGM>\\n\";\n os << \"<\/PROFILESCOPETREE>\\n\";\n\n \/\/ ------------------------------------------------------------------------\n \/\/ Dump footer\n \/\/ ------------------------------------------------------------------------ \n\n os << \"<\/PROFILE>\\n\"; \n DumpProfileFooter(os);\n}\n\n\/\/****************************************************************************\n\/\/ \n\/\/****************************************************************************\n\nconst char *PROFILEdtd =\n#include <lib\/xml\/PROFILE.dtd.h>\n\nvoid DumpProfileHeader(ostream& os)\n{\n os << \"<?xml version=\\\"1.0\\\"?>\" << endl;\n os << \"<!DOCTYPE PROFILE [\\n\" << PROFILEdtd << \"]>\" << endl;\n os.flush();\n}\n\nvoid DumpProfileFooter(ostream& os)\n{\n \/* nothing to do *\/\n}\n\n\/\/ Output should be in increasing order by line number.\nvoid DumpFuncLineMap(ostream& os, LineToPCProfileVecMap& map,\n\t\t PCProfile* profData, const char* func, const char* file)\n{\n \/\/ 'func' will be different than the last call; 'file' may be the same\n static String theFile; \/\/ initializes to empty string\n\n if (strcmp(theFile, file) != 0) {\n \/\/ close and begin new file\n \/\/ (but don't close if this is the first time (theFile is empty)...\n }\n\n static const char* I[] = { \"\", \/\/ Indent levels (0 - 5)\n\t\t\t \" \",\n\t\t\t \" \",\n\t\t\t \" \",\n\t\t\t \" \",\n\t\t\t \" \" };\n \n os << I[1] << \"<F n\"; WriteAttrStr(os, file); os << \">\\n\";\n \n \/\/ Output 'func'\n os << I[2] << \"<P n\"; WriteAttrStr(os, func); os << \">\\n\";\n \n LineToPCProfileVecMapIt it;\n for (it = map.begin(); it != map.end(); ++it) {\n SrcLineX* srcLn = (*it).first;\n PCProfileVec* vec = (*it).second;\n \n os << I[3] << \"<S b\"; WriteAttrNum(os, srcLn->GetSrcLine());\n os << \" id\"; WriteAttrNum(os, srcLn->GetSrcLineX());\n os << \">\\n\";\n for (suint i = 0; i < vec->GetSz(); ++i) {\n if ( (*vec)[i] != 0 ) {\n\tPCProfileMetric* e = profData->GetMetric(i);\n\tdouble v = (double)(*vec)[i] * (double)e->GetPeriod();\n\t\n\tos << I[4] << \"<M n\"; WriteAttrNum(os, i);\n\tos << \" v\"; WriteAttrNum(os, v);\n\tos << \"\/>\\n\";\n }\n }\n os << I[3] << \"<\/S>\" << endl;\n }\n\n os << I[2] << \"<\/P>\" << endl;\n os << I[1] << \"<\/F>\\n\";\n}\n\n\nvoid ClearFuncLineMap(LineToPCProfileVecMap& map)\n{\n LineToPCProfileVecMapIt it;\n for (it = map.begin(); it != map.end(); ++it) {\n delete (*it).first;\n delete (*it).second;\n }\n map.clear();\n}\n\n\/\/***************************************************************************\n<commit_msg>Renaming to ProfileWriter.C.<commit_after><|endoftext|>"} {"text":"<commit_before>\/\/ $Id$\n\/\/ -*-C++-*-\n\/\/ * BeginRiceCopyright *****************************************************\n\/\/ \n\/\/ Copyright ((c)) 2002, Rice University \n\/\/ All rights reserved.\n\/\/ \n\/\/ Redistribution and use in source and binary forms, with or without\n\/\/ modification, are permitted provided that the following conditions are\n\/\/ met:\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 Rice University (RICE) 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 RICE and contributors \"as is\" and any\n\/\/ express or implied warranties, including, but not limited to, the\n\/\/ implied warranties of merchantability and fitness for a particular\n\/\/ purpose are disclaimed. In no event shall RICE 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\n\/\/ business interruption) however caused and on any theory of liability,\n\/\/ whether in contract, strict liability, or tort (including negligence\n\/\/ or otherwise) arising in any way out of the use of this software, even\n\/\/ if advised of the possibility of such damage. \n\/\/ \n\/\/ ******************************************************* EndRiceCopyright *\n\n\/\/***************************************************************************\n\/\/\n\/\/ File:\n\/\/ PCProfileUtils.h\n\/\/\n\/\/ Purpose:\n\/\/ [The purpose of this file]\n\/\/\n\/\/ Description:\n\/\/ [The set of functions, macros, etc. defined in the file]\n\/\/\n\/\/***************************************************************************\n\n#ifndef PCProfileUtils_H \n#define PCProfileUtils_H\n\n\/\/************************* System Include Files ****************************\n\n#include <fstream>\n\n\/\/*************************** User Include Files ****************************\n\n#include <include\/general.h>\n\n#include <lib\/binutils\/PCToSrcLineMap.h>\n#include <lib\/binutils\/LoadModuleInfo.h>\n\n\/\/*************************** Forward Declarations ***************************\n\nclass PCProfile;\nclass Executable;\n\n\/\/****************************************************************************\n\nvoid DumpWithSymbolicInfo(std::ostream& os, PCProfile* profData,\n\t\t\t LoadModuleInfo* modInfo);\n\nvoid DumpProfileHeader(std::ostream& os);\nvoid DumpProfileFooter(std::ostream& os);\n\n\/\/****************************************************************************\n\n#endif \n<commit_msg>Renaming to ProfileWriter.h<commit_after><|endoftext|>"} {"text":"<commit_before><commit_msg>Disabled mipmap generation and fixed memory allocation in constructor.<commit_after><|endoftext|>"} {"text":"<commit_before>\n#include <boost\/test\/unit_test.hpp>\n\n#include \"SoftXMT.hpp\"\n\n\nBOOST_AUTO_TEST_SUITE( Delegate_tests );\n\n\nint64_t some_data = 1234;\n\nvoid user_main( thread * me, void * args ) \n{\n BOOST_MESSAGE( \"Spawning user main thread \" << (void *) current_thread <<\n \" \" << me <<\n \" on node \" << SoftXMT_mynode() );\n\n BOOST_CHECK_EQUAL( 2, SoftXMT_nodes() );\n \/\/ try read\n some_data = 1111;\n int64_t remote_data = SoftXMT_delegate_read_word( make_global(&some_data,1) );\n BOOST_CHECK_EQUAL( 1234, remote_data );\n BOOST_CHECK_EQUAL( 1111, some_data );\n \n \/\/ write\n SoftXMT_delegate_write_word( make_global(&some_data,1), 2345 );\n BOOST_CHECK_EQUAL( 1111, some_data );\n \n \/\/ verify write\n remote_data = SoftXMT_delegate_read_word( make_global(&some_data,1) );\n BOOST_CHECK_EQUAL( 2345, remote_data );\n\n \/\/ fetch and add\n remote_data = SoftXMT_delegate_fetch_and_add_word( make_global(&some_data,1), 1 );\n BOOST_CHECK_EQUAL( 1111, some_data );\n BOOST_CHECK_EQUAL( 2345, remote_data );\n \n \/\/ verify write\n remote_data = SoftXMT_delegate_read_word( make_global(&some_data,1) );\n BOOST_CHECK_EQUAL( 2346, remote_data );\n\n SoftXMT_signal_done();\n}\n\nBOOST_AUTO_TEST_CASE( test1 ) {\n\n SoftXMT_init( &(boost::unit_test::framework::master_test_suite().argc),\n &(boost::unit_test::framework::master_test_suite().argv) );\n\n SoftXMT_activate();\n\n SoftXMT_run_user_main( &user_main, NULL );\n BOOST_CHECK( SoftXMT_done() == true );\n\n SoftXMT_finish( 0 );\n}\n\nBOOST_AUTO_TEST_SUITE_END();\n\n<commit_msg>Whoops, this should have been included in the delegate commit yesterday<commit_after>\n#include <boost\/test\/unit_test.hpp>\n\n#include \"SoftXMT.hpp\"\n#include \"Delegate.hpp\"\n\nBOOST_AUTO_TEST_SUITE( Delegate_tests );\n\n\nint64_t some_data = 1234;\n\nvoid user_main( thread * me, void * args ) \n{\n BOOST_MESSAGE( \"Spawning user main thread \" << (void *) current_thread <<\n \" \" << me <<\n \" on node \" << SoftXMT_mynode() );\n\n BOOST_CHECK_EQUAL( 2, SoftXMT_nodes() );\n \/\/ try read\n some_data = 1111;\n int64_t remote_data = SoftXMT_delegate_read_word( make_global(&some_data,1) );\n BOOST_CHECK_EQUAL( 1234, remote_data );\n BOOST_CHECK_EQUAL( 1111, some_data );\n \n \/\/ write\n SoftXMT_delegate_write_word( make_global(&some_data,1), 2345 );\n BOOST_CHECK_EQUAL( 1111, some_data );\n \n \/\/ verify write\n remote_data = SoftXMT_delegate_read_word( make_global(&some_data,1) );\n BOOST_CHECK_EQUAL( 2345, remote_data );\n\n \/\/ fetch and add\n remote_data = SoftXMT_delegate_fetch_and_add_word( make_global(&some_data,1), 1 );\n BOOST_CHECK_EQUAL( 1111, some_data );\n BOOST_CHECK_EQUAL( 2345, remote_data );\n \n \/\/ verify write\n remote_data = SoftXMT_delegate_read_word( make_global(&some_data,1) );\n BOOST_CHECK_EQUAL( 2346, remote_data );\n\n SoftXMT_signal_done();\n}\n\nBOOST_AUTO_TEST_CASE( test1 ) {\n\n SoftXMT_init( &(boost::unit_test::framework::master_test_suite().argc),\n &(boost::unit_test::framework::master_test_suite().argv) );\n\n SoftXMT_activate();\n\n SoftXMT_run_user_main( &user_main, NULL );\n BOOST_CHECK( SoftXMT_done() == true );\n\n SoftXMT_finish( 0 );\n}\n\nBOOST_AUTO_TEST_SUITE_END();\n\n<|endoftext|>"} {"text":"<commit_before>\/\/ nonpareil_sampling - Part of the nonpareil package\n\/\/ @author Luis M. Rodriguez-R <lmrodriguezr at gmail dot com>\n\/\/ @license artistic 2.0\n\/\/ @version 1.0\n\n#define _MULTI_THREADED\n#include <iostream>\n#include <fstream>\n#include <unistd.h>\n#include <stdio.h>\n#include <math.h>\n#include <pthread.h>\n#include <vector>\n#include <algorithm>\n\n#include \"universal.h\"\n\/\/ #include \"multinode.h\"\n#include \"sequence.h\"\n#include \"nonpareil_sampling.h\"\n\n\/\/extern int processID;\n\/\/extern int processes;\n\n#define LARGEST_LABEL\t128\n#define LARGEST_LINE\t2048\n\nusing namespace std;\n\nint nonpareil_sample_portion(double *&result, int threads, samplepar_t samplepar){\n \/\/ Vars\n if(samplepar.replicates<threads) threads = samplepar.replicates;\n samplejob_t\t\tsamplejob[threads];\n pthread_t\t\tthread[threads];\n pthread_mutex_t\tmutex = PTHREAD_MUTEX_INITIALIZER;\n int\t\t\trc, samples_per_thr, launched_replicates=0;\n\n \/\/ Blank result\n result = new double[samplepar.replicates];\n for(int a=0; a<samplepar.replicates; a++) result[a] = 0.0;\n\n \/\/ Set sample\n \/\/if(processID==0)\n say(\"4sfs^\", \"Sampling at \", samplepar.portion*100, \"%\");\n samples_per_thr = (int)ceil((double)samplepar.replicates\/(double)threads);\n threads = (int)ceil((double)samplepar.replicates\/samples_per_thr);\n\n \/\/ Launch samplings\n for(int thr=0; thr<threads; thr++){\n samplejob[thr].id = thr;\n samplejob[thr].from_in_result = thr*samples_per_thr; \/\/ Zero-based index to start at in the results array\n samplejob[thr].number = samplejob[thr].from_in_result+samples_per_thr > samplepar.replicates ? samplepar.replicates-samplejob[thr].from_in_result : samples_per_thr;\n samplejob[thr].samplepar = samplepar;\n samplejob[thr].result = &result;\n samplejob[thr].mutex = &mutex;\n launched_replicates += samplejob[thr].number;\n\n if((rc=pthread_create(&thread[thr], NULL, &nonpareil_sample_portion_thr, (void *)&samplejob[thr] )))\n\t error(\"Thread creation failed\", (char)rc);\n }\n\n \/\/ Gather jobs\n for(int thr=0; thr<threads; thr++){\n \/\/if(thr%processes == processID)\n pthread_join(thread[thr], NULL);\n }\n\n \/\/ Return\n return launched_replicates;\n}\n\nvoid *nonpareil_sample_portion_thr(void *samplejob_ref){\n \/\/ Vars\n samplejob_t\t*samplejob = (samplejob_t *)samplejob_ref;\n int\t\t*&mates_ref = *samplejob->samplepar.mates, n;\n double\t*result_cp = new double[samplejob->number], p, p_gt_0;\n\n \/\/ Sample\n for(int i=0; i<samplejob->number; i++){\n int\tfound=0, sample_size=0;\n \/\/ For each read with known number of mates\n for(int j=0; j<samplejob->samplepar.mates_size; j++){\n \/\/ Include the read in the sample?\n\t if(((double)rand()\/(double)RAND_MAX) < samplejob->samplepar.portion){\n\t sample_size++;\n\t \/\/ Does the sample contain at least one mate?\n\t \/\/ if((double)rand()\/(double)RAND_MAX < 1.0-pow(1-samplejob->samplepar.portion, mates_ref[j]-1)) found++;\n\t n=(int)floor((samplejob->samplepar.total_reads)*samplejob->samplepar.portion)-1; \/\/ -1 because we exclude the query read from the sample\n\t if(n<0) n=0;\n\t p=(double)(mates_ref[j]-1.0)\/(samplejob->samplepar.total_reads-1.0); \/\/ Again, -1 in both terms because of the query read\n\t p_gt_0 = 1.0 - pow(1.0-p, n);\n\t \/\/cout << \"n=\" << n << \", p=\" << p << \"P(X>0)=\" << p_gt_0 << endl;\n\t if((double)rand()\/(double)RAND_MAX < p_gt_0) found++;\n\t }\n }\n result_cp[i] = sample_size==0 ? 0.0 : (double)found\/(double)sample_size;\n }\n\n \/\/ Transfer results to the external vector\n pthread_mutex_lock( samplejob->mutex );\n double *&result_ref = *samplejob->result;\n \/\/\t\t\t\t\t v--> position + first of the thread\n for(int i=0; i<samplejob->number; i++) result_ref[i + samplejob->from_in_result] = result_cp[i];\n pthread_mutex_unlock( samplejob->mutex );\n\n return (void *)0;\n}\n\nsample_t nonpareil_sample_summary(double *&sample_result, int sample_number, char *alldata, char *outfile, samplepar_t samplepar){\n \/\/ Vars\n double\t\tx2=0;\n vector<double>\tdataPoints;\n FILE\t\t\t*alldatah, *summaryh;\n bool\t\t\treportAllData=false;\n int\t\t\treportSummary=0;\n char\t\t\t*text, *label, *sep, *header=(char*)\"\";\n sample_t\t\ts;\n\n s.portion = samplepar.portion;\n\n \/\/ File handlers\n if(alldata && strlen(alldata)>0){\n alldatah = fopen(alldata, (samplepar.portion==samplepar.portion_min ? \"w\" : \"a+\"));\n if(alldatah==NULL) error(\"I cannot write on all-data file\", alldata);\n reportAllData=true;\n }\n if(strlen(outfile)>0 && strcmp(outfile, \"-\")!=0){\n summaryh = fopen(outfile, (samplepar.portion==samplepar.portion_min ? \"w\" : \"a+\"));\n if(summaryh==NULL) error(\"I cannot write on summary file\", outfile);\n reportSummary=1;\n }else if(strlen(outfile)>0){\n reportSummary=2;\n }\n\n if(samplepar.portion==samplepar.portion_min){\n header = new char[LARGEST_LINE];\n if(samplepar.type == 1) {\n sprintf(header, \"# @impl: Nonpareil\\n# @version: %.2f\\n# @maxL: %d\\n# @L: %.3f\\n# @R: %llu\\n# @overlap: %.2f\\n# @divide: %.2f\\n\",\n samplepar.k,\n samplepar.np_version,\n samplepar.max_read_len,\n \t\t samplepar.avg_read_len,\n\t\t samplepar.total_reads,\n\t\t samplepar.seq_overlap*100.0,\n\t\t samplepar.divide);\n }\n else if(samplepar.type == 2) {\n sprintf(header, \"# @ksize: %d\\n# @impl: Nonpareil\\n# @version: %.2f\\n# @L: %.3f\\n# @AL: %.3f\\n# @R: %llu\\n# @overlap: %.2f\\n# @divide: %.2f\\n\",\n samplepar.k,\n samplepar.np_version,\n \t\t samplepar.avg_read_len,\n samplepar.adj_avg_read_len,\n \t\t samplepar.total_reads,\n \t\t samplepar.seq_overlap*100.0,\n \t\t samplepar.divide);\n }\n }\n\n if(sample_number>0){\n \/\/ Average & SD\n s.avg = s.sd = x2 = 0.0;\n for(int a=0; a<sample_number; a++){\n\t s.avg += (double)sample_result[a];\n\t x2 += pow((double)sample_result[a], 2.0);\n\t dataPoints.push_back(sample_result[a]);\n\t if(reportAllData) fprintf(alldatah, \"%.2f\\t%d\\t%.10f\\n\", samplepar.portion, a, sample_result[a]);\n }\n fclose(alldatah);\n s.avg \/= (double)sample_number;\n x2 \/= (double)sample_number;\n s.sd = sqrt(x2-pow(s.avg, 2.0));\n\n \/\/ Quartiles\n vector<double>::iterator\tfirstDatum = dataPoints.begin();\n vector<double>::iterator\tlastDatum = dataPoints.end();\n vector<double>::iterator\tq1Datum = firstDatum + (lastDatum - firstDatum) \/ 4;\n vector<double>::iterator\tq2Datum = firstDatum + (lastDatum - firstDatum) \/ 2;\n vector<double>::iterator\tq3Datum = firstDatum + (lastDatum - firstDatum) * 3 \/ 4;\n nth_element(firstDatum, q1Datum, lastDatum);\n nth_element(firstDatum, q2Datum, lastDatum);\n nth_element(firstDatum, q3Datum, lastDatum);\n s.q1 = *q1Datum;\n s.q2 = *q2Datum;\n s.q3 = *q3Datum;\n }else{\n s.avg = 0;\n s.sd = 0;\n s.q1 = 0;\n s.q2 = 0;\n s.q3 = 0;\n }\n\n \/\/ Report summary\n if(reportSummary==0) return s;\n label = new char[LARGEST_LABEL];\n text = new char[LARGEST_LINE];\n sep = (char *)\"\\t\";\n sprintf(label, (samplepar.portion_as_label ? \"%.6f\" : \"%.0f\"), samplepar.portion*(samplepar.portion_as_label? 1.0 : samplepar.total_reads ));\n sprintf(text, \"%s%s%.5f%s%.5f%s%.5f%s%.5f%s%.5f\",\n \t\tlabel, sep, s.avg, sep, s.sd, sep, s.q1, sep, s.q2, sep, s.q3);\n if(reportSummary==1) {\n fprintf(summaryh, \"%s%s\\n\", header, text);\n fclose(summaryh);\n } else if(reportSummary==2) printf(\"%s%s\\n\", header, text);\n\n return s;\n}\n<commit_msg>Clean compilation in OS X<commit_after>\/\/ nonpareil_sampling - Part of the nonpareil package\n\/\/ @author Luis M. Rodriguez-R <lmrodriguezr at gmail dot com>\n\/\/ @license artistic 2.0\n\/\/ @version 1.0\n\n#define _MULTI_THREADED\n#include <iostream>\n#include <fstream>\n#include <unistd.h>\n#include <stdio.h>\n#include <math.h>\n#include <pthread.h>\n#include <vector>\n#include <algorithm>\n\n#include \"universal.h\"\n\/\/ #include \"multinode.h\"\n#include \"sequence.h\"\n#include \"nonpareil_sampling.h\"\n\n\/\/extern int processID;\n\/\/extern int processes;\n\n#define LARGEST_LABEL\t128\n#define LARGEST_LINE\t2048\n\nusing namespace std;\n\nint nonpareil_sample_portion(double *&result, int threads, samplepar_t samplepar){\n \/\/ Vars\n if(samplepar.replicates<threads) threads = samplepar.replicates;\n samplejob_t\t\tsamplejob[threads];\n pthread_t\t\tthread[threads];\n pthread_mutex_t\tmutex = PTHREAD_MUTEX_INITIALIZER;\n int\t\t\trc, samples_per_thr, launched_replicates=0;\n\n \/\/ Blank result\n result = new double[samplepar.replicates];\n for(int a=0; a<samplepar.replicates; a++) result[a] = 0.0;\n\n \/\/ Set sample\n \/\/if(processID==0)\n say(\"4sfs^\", \"Sampling at \", samplepar.portion*100, \"%\");\n samples_per_thr = (int)ceil((double)samplepar.replicates\/(double)threads);\n threads = (int)ceil((double)samplepar.replicates\/samples_per_thr);\n\n \/\/ Launch samplings\n for(int thr=0; thr<threads; thr++){\n samplejob[thr].id = thr;\n samplejob[thr].from_in_result = thr*samples_per_thr; \/\/ Zero-based index to start at in the results array\n samplejob[thr].number = samplejob[thr].from_in_result+samples_per_thr > samplepar.replicates ? samplepar.replicates-samplejob[thr].from_in_result : samples_per_thr;\n samplejob[thr].samplepar = samplepar;\n samplejob[thr].result = &result;\n samplejob[thr].mutex = &mutex;\n launched_replicates += samplejob[thr].number;\n\n if((rc=pthread_create(&thread[thr], NULL, &nonpareil_sample_portion_thr, (void *)&samplejob[thr] )))\n\t error(\"Thread creation failed\", (char)rc);\n }\n\n \/\/ Gather jobs\n for(int thr=0; thr<threads; thr++){\n \/\/if(thr%processes == processID)\n pthread_join(thread[thr], NULL);\n }\n\n \/\/ Return\n return launched_replicates;\n}\n\nvoid *nonpareil_sample_portion_thr(void *samplejob_ref){\n \/\/ Vars\n samplejob_t\t*samplejob = (samplejob_t *)samplejob_ref;\n int\t\t*&mates_ref = *samplejob->samplepar.mates, n;\n double\t*result_cp = new double[samplejob->number], p, p_gt_0;\n\n \/\/ Sample\n for(int i=0; i<samplejob->number; i++){\n int\tfound=0, sample_size=0;\n \/\/ For each read with known number of mates\n for(int j=0; j<samplejob->samplepar.mates_size; j++){\n \/\/ Include the read in the sample?\n\t if(((double)rand()\/(double)RAND_MAX) < samplejob->samplepar.portion){\n\t sample_size++;\n\t \/\/ Does the sample contain at least one mate?\n\t \/\/ if((double)rand()\/(double)RAND_MAX < 1.0-pow(1-samplejob->samplepar.portion, mates_ref[j]-1)) found++;\n\t n=(int)floor((samplejob->samplepar.total_reads)*samplejob->samplepar.portion)-1; \/\/ -1 because we exclude the query read from the sample\n\t if(n<0) n=0;\n\t p=(double)(mates_ref[j]-1.0)\/(samplejob->samplepar.total_reads-1.0); \/\/ Again, -1 in both terms because of the query read\n\t p_gt_0 = 1.0 - pow(1.0-p, n);\n\t \/\/cout << \"n=\" << n << \", p=\" << p << \"P(X>0)=\" << p_gt_0 << endl;\n\t if((double)rand()\/(double)RAND_MAX < p_gt_0) found++;\n\t }\n }\n result_cp[i] = sample_size==0 ? 0.0 : (double)found\/(double)sample_size;\n }\n\n \/\/ Transfer results to the external vector\n pthread_mutex_lock( samplejob->mutex );\n double *&result_ref = *samplejob->result;\n \/\/\t\t\t\t\t v--> position + first of the thread\n for(int i=0; i<samplejob->number; i++) result_ref[i + samplejob->from_in_result] = result_cp[i];\n pthread_mutex_unlock( samplejob->mutex );\n\n return (void *)0;\n}\n\nsample_t nonpareil_sample_summary(double *&sample_result, int sample_number, char *alldata, char *outfile, samplepar_t samplepar){\n \/\/ Vars\n double\t\tx2=0;\n vector<double>\tdataPoints;\n FILE\t\t\t*alldatah, *summaryh;\n bool\t\t\treportAllData=false;\n int\t\t\treportSummary=0;\n char\t\t\t*text, *label, *sep, *header=(char*)\"\";\n sample_t\t\ts;\n\n s.portion = samplepar.portion;\n\n \/\/ File handlers\n if(alldata && strlen(alldata)>0){\n alldatah = fopen(alldata, (samplepar.portion==samplepar.portion_min ? \"w\" : \"a+\"));\n if(alldatah==NULL) error(\"I cannot write on all-data file\", alldata);\n reportAllData=true;\n }\n if(strlen(outfile)>0 && strcmp(outfile, \"-\")!=0){\n summaryh = fopen(outfile, (samplepar.portion==samplepar.portion_min ? \"w\" : \"a+\"));\n if(summaryh==NULL) error(\"I cannot write on summary file\", outfile);\n reportSummary=1;\n }else if(strlen(outfile)>0){\n reportSummary=2;\n }\n\n if(samplepar.portion==samplepar.portion_min){\n header = new char[LARGEST_LINE];\n if(samplepar.type == 1) {\n sprintf(header, \"# @impl: Nonpareil\\n# @ksize: %d\\n# @version: %.2f\\n# @maxL: %d\\n# @L: %.3f\\n# @R: %llu\\n# @overlap: %.2f\\n# @divide: %.2f\\n\",\n samplepar.k,\n samplepar.np_version,\n samplepar.max_read_len,\n \t\t samplepar.avg_read_len,\n\t\t samplepar.total_reads,\n\t\t samplepar.seq_overlap*100.0,\n\t\t samplepar.divide);\n }\n else if(samplepar.type == 2) {\n sprintf(header, \"# @impl: Nonpareil\\n# @ksize: %d\\n# @version: %.2f\\n# @L: %.3f\\n# @AL: %.3f\\n# @R: %llu\\n# @overlap: %.2f\\n# @divide: %.2f\\n\",\n samplepar.k,\n samplepar.np_version,\n \t\t samplepar.avg_read_len,\n samplepar.adj_avg_read_len,\n \t\t samplepar.total_reads,\n \t\t samplepar.seq_overlap*100.0,\n \t\t samplepar.divide);\n }\n }\n\n if(sample_number>0){\n \/\/ Average & SD\n s.avg = s.sd = x2 = 0.0;\n for(int a=0; a<sample_number; a++){\n\t s.avg += (double)sample_result[a];\n\t x2 += pow((double)sample_result[a], 2.0);\n\t dataPoints.push_back(sample_result[a]);\n\t if(reportAllData) fprintf(alldatah, \"%.2f\\t%d\\t%.10f\\n\", samplepar.portion, a, sample_result[a]);\n }\n fclose(alldatah);\n s.avg \/= (double)sample_number;\n x2 \/= (double)sample_number;\n s.sd = sqrt(x2-pow(s.avg, 2.0));\n\n \/\/ Quartiles\n vector<double>::iterator\tfirstDatum = dataPoints.begin();\n vector<double>::iterator\tlastDatum = dataPoints.end();\n vector<double>::iterator\tq1Datum = firstDatum + (lastDatum - firstDatum) \/ 4;\n vector<double>::iterator\tq2Datum = firstDatum + (lastDatum - firstDatum) \/ 2;\n vector<double>::iterator\tq3Datum = firstDatum + (lastDatum - firstDatum) * 3 \/ 4;\n nth_element(firstDatum, q1Datum, lastDatum);\n nth_element(firstDatum, q2Datum, lastDatum);\n nth_element(firstDatum, q3Datum, lastDatum);\n s.q1 = *q1Datum;\n s.q2 = *q2Datum;\n s.q3 = *q3Datum;\n }else{\n s.avg = 0;\n s.sd = 0;\n s.q1 = 0;\n s.q2 = 0;\n s.q3 = 0;\n }\n\n \/\/ Report summary\n if(reportSummary==0) return s;\n label = new char[LARGEST_LABEL];\n text = new char[LARGEST_LINE];\n sep = (char *)\"\\t\";\n sprintf(label, (samplepar.portion_as_label ? \"%.6f\" : \"%.0f\"), samplepar.portion*(samplepar.portion_as_label? 1.0 : samplepar.total_reads ));\n sprintf(text, \"%s%s%.5f%s%.5f%s%.5f%s%.5f%s%.5f\",\n \t\tlabel, sep, s.avg, sep, s.sd, sep, s.q1, sep, s.q2, sep, s.q3);\n if(reportSummary==1) {\n fprintf(summaryh, \"%s%s\\n\", header, text);\n fclose(summaryh);\n } else if(reportSummary==2) printf(\"%s%s\\n\", header, text);\n\n return s;\n}\n<|endoftext|>"} {"text":"<commit_before>\/\/ Source : https:\/\/oj.leetcode.com\/problems\/single-number-ii\/\n\/\/ Author : Hao Chen\n\/\/ Date : 2014-06-17\n\n\/********************************************************************************** \n* \n* Given an array of integers, every element appears three times except for one. Find that single one.\n* \n* Note:\n* Your algorithm should have a linear runtime complexity. Could you implement it without using extra memory?\n* \n* \n**********************************************************************************\/\n\nclass Solution {\npublic:\n Solution(){\n srand(time(0));\n }\n \n \/\/random invoker\n int singleNumber(int A[], int n) {\n if (rand()%2){\n return singleNumber_1(A, n);\n }\n return singleNumber_2(A, n);\n }\n\n \/*\n * This solution is clear & straightforward implementation.\n * \n * We use an array of 32 length(e.g. count[32]) to count the the bits for all of numbers. \n *\n * Because the same number appear 3 times, which means the sum of i-th bits for all numbers should be 3 times.\n *\n * In other word, the sum of i-th bits mod 3, it must be 0 or 1. 1 means that is the single number bit.\n *\n * This solution can be easy to extend to \"every element appears k times except for one.\"\n *\n *\/\n int singleNumber_1(int A[], int n) {\n int count[32] = {0};\n int result = 0;\n for (int i = 0; i < 32; i++) {\n for (int j = 0; j < n; j++) {\n if ((A[j] >> i) & 1) {\n count[i]++;\n }\n }\n result |= ((count[i] % 3) << i);\n }\n return result;\n }\n\n\n \/*\n * The following solution is popular solution on Internet, but it looks it's not easy to understand.\n *\n * Actually, it just optimizes the above soultion.\n *\n * Let's see how it improve the above.\n *\n * We use three bitmask, \n * 1) `ones` represent the i-th bit had apear once.\n * 2) `twos` represent the i-th bit had apear twice.\n * 3) `threes` represent the i-th bit had apear three times.\n *\n * When the i-th bit had appeared for the third time, clear the i-th bit of both `ones` and `twos` to 0.\n * The final answer will be the value of `ones`\n *\n *\/\n int singleNumber_2(int A[], int n) {\n int ones = 0, twos = 0, threes = 0;\n for (int i = 0; i < n; i++) {\n twos |= ones & A[i];\n ones ^= A[i];\n threes = ones & twos;\n ones &= ~threes;\n twos &= ~threes;\n }\n return ones;\n }\n\n};\n<commit_msg>improve the comments (resolves #29)<commit_after>\/\/ Source : https:\/\/oj.leetcode.com\/problems\/single-number-ii\/\n\/\/ Author : Hao Chen\n\/\/ Date : 2014-06-17\n\n\/********************************************************************************** \n* \n* Given an array of integers, every element appears three times except for one. Find that single one.\n* \n* Note:\n* Your algorithm should have a linear runtime complexity. Could you implement it without using extra memory?\n* \n* \n**********************************************************************************\/\n\nclass Solution {\npublic:\n Solution(){\n srand(time(0));\n }\n \n \/\/random invoker\n int singleNumber(int A[], int n) {\n if (rand()%2){\n return singleNumber_1(A, n);\n }\n return singleNumber_2(A, n);\n }\n\n \/*\n * This solution is clear & straightforward implementation.\n * \n * We use an array of 32 length(e.g. count[32]) to count the the bits for all of numbers. \n *\n * Because the same number appear 3 times, which means the sum of i-th bits for all numbers should be 3 times.\n *\n * In other word, the sum of the i-th bits mod 3, it must be 0 or 1. 1 means that is the single number bit.\n *\n * This solution can be easy to extend to \"every element appears k times except for one.\"\n *\n *\/\n int singleNumber_1(int A[], int n) {\n int count[32] = {0};\n int result = 0;\n for (int i = 0; i < 32; i++) {\n for (int j = 0; j < n; j++) {\n if ((A[j] >> i) & 1) {\n count[i]++;\n }\n }\n result |= ((count[i] % 3) << i);\n }\n return result;\n }\n\n\n \/*\n * The following solution is popular solution on Internet, but it looks it's not easy to understand.\n *\n * Actually, it just optimizes the above soultion.\n *\n * Let's see how it improve the above.\n *\n * We use three bitmasks, \n * 1) `ones` as a bitmask which represents the i-th bit had appeared once.\n * 2) `twos` as a bitmask which represents the i-th bit had appeared twice.\n * 3) `threes` as a bit mask which represents the i-th bit had appeared three times.\n *\n * When the i-th bit had appeared for the third time, clear the i-th bit of both `ones` and `twos` to 0.\n * The final answer will be the value of `ones`\n *\n *\/\n int singleNumber_2(int A[], int n) {\n int ones = 0, twos = 0, threes = 0;\n for (int i = 0; i < n; i++) {\n \/\/ `ones & A[i]` the result is the bitmask which the bits appeared twice\n twos |= ones & A[i]; \n \/\/ XOR means remove the bit which appeared twice int `ones` \n ones ^= A[i];\n \/\/ count the `three`\n threes = ones & twos;\n \/\/ clear the `ones` and `twos` if the i-th bit had appeared three times.\n ones &= ~threes;\n twos &= ~threes;\n }\n return ones;\n }\n\n};\n<|endoftext|>"} {"text":"<commit_before>\/*\n Copyright (C) 2008 Torsten Rahn <rahn@kde.org>\n\n This file is part of the KDE project\n\n This library is free software you can redistribute it and\/or\n modify it under the terms of the GNU Library General Public\n License as published by the Free Software Foundation either\n version 2 of the License, or (at your option) any later version.\n\n This library is distributed in the hope that it will be useful,\n but WITHOUT ANY WARRANTY without even the implied warranty of\n MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU\n Library General Public License for more details.\n\n You should have received a copy of the GNU Library General Public License\n aint with this library see the file COPYING.LIB. If not, write to\n the Free Software Foundation, Inc., 51 Franklin Street, Fifth Floor,\n Boston, MA 02110-1301, USA.\n*\/\n\n#include \"GeoSceneGroup.h\"\n\n#include <QtCore\/QDebug>\n\n#include \"GeoSceneProperty.h\"\n\nnamespace Marble\n{\n\nGeoSceneGroup::GeoSceneGroup( const QString& name )\n : m_name( name )\n{\n}\n\nGeoSceneGroup::~GeoSceneGroup()\n{\n qDeleteAll( m_properties );\n}\n\nbool GeoSceneGroup::propertyAvailable( const QString& name, bool& available )\n{\n QVector<GeoSceneProperty*>::const_iterator it = m_properties.constBegin();\n QVector<GeoSceneProperty*>::const_iterator end = m_properties.constEnd();\n for (; it != end; ++it) {\n if ( (*it)->name() == name ) {\n available = (*it)->available();\n return true;\n }\n }\n\n available = false;\n\n return false;\n}\n\nbool GeoSceneGroup::setPropertyValue( const QString& name, bool value )\n{\n QVector<GeoSceneProperty*>::const_iterator it = m_properties.constBegin();\n QVector<GeoSceneProperty*>::const_iterator end = m_properties.constEnd();\n for (; it != end; ++it) {\n if ( (*it)->name() == name ) {\n (*it)->setValue( value );\n return true;\n }\n }\n\n return false;\n}\n\nbool GeoSceneGroup::propertyValue( const QString& name, bool& value )\n{\n QVector<GeoSceneProperty*>::const_iterator it = m_properties.constBegin();\n QVector<GeoSceneProperty*>::const_iterator end = m_properties.constEnd();\n for (; it != end; ++it) {\n if ( (*it)->name() == name ) {\n value = (*it)->value();\n return true;\n }\n }\n\n value = false;\n\n return false;\n}\n\nvoid GeoSceneGroup::addProperty( GeoSceneProperty* property )\n{\n \/\/ Remove any property that has the same name\n QVector<GeoSceneProperty*>::iterator it = m_properties.begin();\n while (it != m_properties.end()) {\n GeoSceneProperty* currentProperty = *it;\n if ( currentProperty->name() == property->name() ) {\n delete currentProperty;\n it = m_properties.erase(it);\n }\n else {\n ++it;\n }\n }\n\n if ( property ) {\n m_properties.append( property );\n\n \/\/ Establish connection to the outside, e.g. the LegendBrowser\n connect ( property, SIGNAL( valueChanged( QString, bool ) ), \n SIGNAL( valueChanged( QString, bool ) ) );\n emit valueChanged( property->name(), property->value() );\n }\n}\n\nGeoSceneProperty* GeoSceneGroup::property( const QString& name )\n{\n GeoSceneProperty* property = 0;\n\n QVector<GeoSceneProperty*>::const_iterator it = m_properties.constBegin();\n QVector<GeoSceneProperty*>::const_iterator end = m_properties.constEnd();\n for (; it != end; ++it) {\n if ( (*it)->name() == name )\n property = *it;\n break;\n }\n\n return property;\n}\n\nQVector<GeoSceneProperty*> GeoSceneGroup::properties() const\n{\n return m_properties;\n}\n\nQString GeoSceneGroup::name() const\n{\n return m_name;\n}\n\n}\n\n#include \"GeoSceneGroup.moc\"\n<commit_msg>Fix bug introduced by commit 994465, add missing braces.<commit_after>\/*\n Copyright (C) 2008 Torsten Rahn <rahn@kde.org>\n\n This file is part of the KDE project\n\n This library is free software you can redistribute it and\/or\n modify it under the terms of the GNU Library General Public\n License as published by the Free Software Foundation either\n version 2 of the License, or (at your option) any later version.\n\n This library is distributed in the hope that it will be useful,\n but WITHOUT ANY WARRANTY without even the implied warranty of\n MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU\n Library General Public License for more details.\n\n You should have received a copy of the GNU Library General Public License\n aint with this library see the file COPYING.LIB. If not, write to\n the Free Software Foundation, Inc., 51 Franklin Street, Fifth Floor,\n Boston, MA 02110-1301, USA.\n*\/\n\n#include \"GeoSceneGroup.h\"\n\n#include <QtCore\/QDebug>\n\n#include \"GeoSceneProperty.h\"\n\nnamespace Marble\n{\n\nGeoSceneGroup::GeoSceneGroup( const QString& name )\n : m_name( name )\n{\n}\n\nGeoSceneGroup::~GeoSceneGroup()\n{\n qDeleteAll( m_properties );\n}\n\nbool GeoSceneGroup::propertyAvailable( const QString& name, bool& available )\n{\n QVector<GeoSceneProperty*>::const_iterator it = m_properties.constBegin();\n QVector<GeoSceneProperty*>::const_iterator end = m_properties.constEnd();\n for (; it != end; ++it) {\n if ( (*it)->name() == name ) {\n available = (*it)->available();\n return true;\n }\n }\n\n available = false;\n\n return false;\n}\n\nbool GeoSceneGroup::setPropertyValue( const QString& name, bool value )\n{\n QVector<GeoSceneProperty*>::const_iterator it = m_properties.constBegin();\n QVector<GeoSceneProperty*>::const_iterator end = m_properties.constEnd();\n for (; it != end; ++it) {\n if ( (*it)->name() == name ) {\n (*it)->setValue( value );\n return true;\n }\n }\n\n return false;\n}\n\nbool GeoSceneGroup::propertyValue( const QString& name, bool& value )\n{\n QVector<GeoSceneProperty*>::const_iterator it = m_properties.constBegin();\n QVector<GeoSceneProperty*>::const_iterator end = m_properties.constEnd();\n for (; it != end; ++it) {\n if ( (*it)->name() == name ) {\n value = (*it)->value();\n return true;\n }\n }\n\n value = false;\n\n return false;\n}\n\nvoid GeoSceneGroup::addProperty( GeoSceneProperty* property )\n{\n \/\/ Remove any property that has the same name\n QVector<GeoSceneProperty*>::iterator it = m_properties.begin();\n while (it != m_properties.end()) {\n GeoSceneProperty* currentProperty = *it;\n if ( currentProperty->name() == property->name() ) {\n delete currentProperty;\n it = m_properties.erase(it);\n }\n else {\n ++it;\n }\n }\n\n if ( property ) {\n m_properties.append( property );\n\n \/\/ Establish connection to the outside, e.g. the LegendBrowser\n connect ( property, SIGNAL( valueChanged( QString, bool ) ), \n SIGNAL( valueChanged( QString, bool ) ) );\n emit valueChanged( property->name(), property->value() );\n }\n}\n\nGeoSceneProperty* GeoSceneGroup::property( const QString& name )\n{\n GeoSceneProperty* property = 0;\n\n QVector<GeoSceneProperty*>::const_iterator it = m_properties.constBegin();\n QVector<GeoSceneProperty*>::const_iterator end = m_properties.constEnd();\n for (; it != end; ++it) {\n if ( (*it)->name() == name ) {\n property = *it;\n break;\n }\n }\n\n return property;\n}\n\nQVector<GeoSceneProperty*> GeoSceneGroup::properties() const\n{\n return m_properties;\n}\n\nQString GeoSceneGroup::name() const\n{\n return m_name;\n}\n\n}\n\n#include \"GeoSceneGroup.moc\"\n<|endoftext|>"} {"text":"<commit_before>#pragma once\n\nstruct AlignmentLengths {\n uint32_t raLen;\n uint32_t qaLen;\n uint32_t sclip;\n uint32_t eclip;\n\n AlignmentLengths(char *cigar)\n : raLen(0)\n , qaLen(0)\n , sclip(0)\n , eclip(0)\n {}\n\n AlignmentLengths(uint32_t *cigar, uint32_t n_cigar)\n : raLen(0)\n , qaLen(0)\n , sclip(0)\n , eclip(0)\n {}\n\n};\n\nstruct Alignment {\n AlignmentLengths lens;\n uint32_t pos; \/\/1-based start position of the alignment\n uint32_t rapos;\n uint32_t SQO;\n uint32_t EQO;\n char strand;\n char *chrom;\n\n Alignment()\n : pos(0)\n , raLen(0)\n , rapos(0)\n , qaLen(0)\n , sclip(0)\n , eclip(0)\n , SQO(0)\n , EQO(0)\n , strand(0)\n , chrom(NULL)\n {}\n\n Alignment(bam1_t *aln);\n Alignment(char *sa_tag);\n};\n<commit_msg>first pass at alignment class<commit_after>#pragma once\n\n#include \"AlignmentOffsets.hpp\"\n\n#include <algorithm>\n#include <string.h>\n\nstruct Alignment {\n AlignmentOffsets offsets;\n uint32_t pos; \/\/1-based start position of the alignment\n uint32_t rapos;\n int SQO;\n int EQO;\n char strand;\n char *chrom;\n\n Alignment()\n : offsets()\n , pos(0)\n , rapos(0)\n , SQO(0)\n , EQO(0)\n , strand(0)\n , chrom(NULL)\n {}\n\n Alignment(bam1_t *aln) {\n rapos = aln->core.pos + 1;\n offsets = AlignmentOffsets(bam_get_cigar(aln), aln->core.n_cigar);\n if (bam_is_rev(aln)) {\n strand = '-';\n pos = rapos + offsets.raLen + offsets.eclip - 1;\n SQO = offsets.eclip;\n EQO = offsets.eclip + offsets.qaLen - 1;\n }\n else {\n strand = '+';\n pos = rapos - offsets.sclip;\n SQO = offsets.sclip;\n EQO = offsets.sclip + offsets.qaLen - 1;\n }\n }\n\n \/\/Alignment(char *sa_tag);\n \n int start_diagonal() const {\n return rapos - offsets.sclip;\n }\n\n int end_diagonal() const {\n return (rapos + offsets.raLen) - (offsets.sclip + offsets.qaLen);\n }\n \n friend int mno(Alignment const& left, Alignment const& right) {\n int overlap = std::max(1 + std::min(left.EQO, right.EQO) - std::max(left.SQO, right.SQO), 0);\n int alen1 = 1 + left.EQO - left.SQO;\n int alen2 = 1 + right.EQO - right.SQO;\n return std::min(alen1 - overlap, alen2 - overlap);\n }\n\n friend int desert(Alignment const& left, Alignment const& right) {\n return right.SQO - left.EQO - 1;\n }\n\n friend int insert_size(Alignment const& left, Alignment const& right) {\n if (left.strand == '-') {\n return right.end_diagonal() - left.start_diagonal();\n }\n else {\n return left.end_diagonal() - right.start_diagonal();\n }\n }\n\n friend bool should_check(Alignment const& left, Alignment const& right) {\n return (strcmp(left.chrom, right.chrom) == 0 && left.strand == right.strand);\n }\n \n};\n<|endoftext|>"} {"text":"<commit_before>#include \"precompiled.h\"\n\/\/\n\/\/ Copyright (c) 2002-2012 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\/\/ VertexBuffer.cpp: Defines the abstract VertexBuffer class and VertexBufferInterface\n\/\/ class with derivations, classes that perform graphics API agnostic vertex buffer operations.\n\n#include \"libGLESv2\/renderer\/VertexBuffer.h\"\n#include \"libGLESv2\/renderer\/Renderer.h\"\n#include \"libGLESv2\/VertexAttribute.h\"\n#include \"libGLESv2\/renderer\/BufferStorage.h\"\n#include \"common\/mathutil.h\"\n\nnamespace rx\n{\n\nunsigned int VertexBuffer::mNextSerial = 1;\n\nVertexBuffer::VertexBuffer()\n{\n updateSerial();\n}\n\nVertexBuffer::~VertexBuffer()\n{\n}\n\nvoid VertexBuffer::updateSerial()\n{\n mSerial = mNextSerial++;\n}\n\nunsigned int VertexBuffer::getSerial() const\n{\n return mSerial;\n}\n\nVertexBufferInterface::VertexBufferInterface(rx::Renderer *renderer, bool dynamic) : mRenderer(renderer)\n{\n mDynamic = dynamic;\n mWritePosition = 0;\n mReservedSpace = 0;\n\n mVertexBuffer = renderer->createVertexBuffer();\n}\n\nVertexBufferInterface::~VertexBufferInterface()\n{\n delete mVertexBuffer;\n}\n\nunsigned int VertexBufferInterface::getSerial() const\n{\n return mVertexBuffer->getSerial();\n}\n\nunsigned int VertexBufferInterface::getBufferSize() const\n{\n return mVertexBuffer->getBufferSize();\n}\n\nbool VertexBufferInterface::setBufferSize(unsigned int size)\n{\n if (mVertexBuffer->getBufferSize() == 0)\n {\n return mVertexBuffer->initialize(size, mDynamic);\n }\n else\n {\n return mVertexBuffer->setBufferSize(size);\n }\n}\n\nunsigned int VertexBufferInterface::getWritePosition() const\n{\n return mWritePosition;\n}\n\nvoid VertexBufferInterface::setWritePosition(unsigned int writePosition)\n{\n mWritePosition = writePosition;\n}\n\nbool VertexBufferInterface::discard()\n{\n return mVertexBuffer->discard();\n}\n\nbool VertexBufferInterface::storeVertexAttributes(const gl::VertexAttribute &attrib, const gl::VertexAttribCurrentValueData ¤tValue,\n GLint start, GLsizei count, GLsizei instances, unsigned int *outStreamOffset)\n{\n unsigned int spaceRequired;\n if (!mVertexBuffer->getSpaceRequired(attrib, count, instances, &spaceRequired))\n {\n return false;\n }\n\n if (mWritePosition + spaceRequired < mWritePosition)\n {\n return false;\n }\n\n if (!reserveSpace(mReservedSpace))\n {\n return false;\n }\n mReservedSpace = 0;\n\n if (!mVertexBuffer->storeVertexAttributes(attrib, currentValue, start, count, instances, mWritePosition))\n {\n return false;\n }\n\n if (outStreamOffset)\n {\n *outStreamOffset = mWritePosition;\n }\n\n mWritePosition += spaceRequired;\n\n \/\/ Align to 16-byte boundary\n mWritePosition = rx::roundUp(mWritePosition, 16u);\n\n return true;\n}\n\nbool VertexBufferInterface::reserveVertexSpace(const gl::VertexAttribute &attribute, GLsizei count, GLsizei instances)\n{\n unsigned int requiredSpace;\n if (!mVertexBuffer->getSpaceRequired(attribute, count, instances, &requiredSpace))\n {\n return false;\n }\n\n \/\/ Protect against integer overflow\n if (mReservedSpace + requiredSpace < mReservedSpace)\n {\n return false;\n }\n\n mReservedSpace += requiredSpace;\n\n \/\/ Align to 16-byte boundary\n mReservedSpace = rx::roundUp(mReservedSpace, 16u);\n\n return true;\n}\n\nVertexBuffer* VertexBufferInterface::getVertexBuffer() const\n{\n return mVertexBuffer;\n}\n\nbool VertexBufferInterface::directStoragePossible(const gl::VertexAttribute &attrib,\n const gl::VertexAttribCurrentValueData ¤tValue) const\n{\n gl::Buffer *buffer = attrib.mBoundBuffer.get();\n BufferStorage *storage = buffer ? buffer->getStorage() : NULL;\n gl::VertexFormat vertexFormat(attrib, currentValue.Type);\n\n \/\/ Alignment restrictions: In D3D, vertex data must be aligned to\n \/\/ the format stride, or to a 4-byte boundary, whichever is smaller.\n \/\/ (Undocumented, and experimentally confirmed)\n unsigned int outputElementSize;\n getVertexBuffer()->getSpaceRequired(attrib, 1, 0, &outputElementSize);\n size_t alignment = std::min(static_cast<size_t>(outputElementSize), 4u);\n\n bool isAligned = (static_cast<size_t>(attrib.stride()) % alignment == 0) &&\n (static_cast<size_t>(attrib.mOffset) % alignment == 0);\n bool requiresConversion = (mRenderer->getVertexConversionType(vertexFormat) & VERTEX_CONVERT_CPU) > 0;\n\n return storage && storage->supportsDirectBinding() && !requiresConversion && isAligned;\n}\n\nStreamingVertexBufferInterface::StreamingVertexBufferInterface(rx::Renderer *renderer, std::size_t initialSize) : VertexBufferInterface(renderer, true)\n{\n setBufferSize(initialSize);\n}\n\nStreamingVertexBufferInterface::~StreamingVertexBufferInterface()\n{\n}\n\nbool StreamingVertexBufferInterface::reserveSpace(unsigned int size)\n{\n bool result = true;\n unsigned int curBufferSize = getBufferSize();\n if (size > curBufferSize)\n {\n result = setBufferSize(std::max(size, 3 * curBufferSize \/ 2));\n setWritePosition(0);\n }\n else if (getWritePosition() + size > curBufferSize)\n {\n if (!discard())\n {\n return false;\n }\n setWritePosition(0);\n }\n\n return result;\n}\n\nStaticVertexBufferInterface::StaticVertexBufferInterface(rx::Renderer *renderer) : VertexBufferInterface(renderer, false)\n{\n}\n\nStaticVertexBufferInterface::~StaticVertexBufferInterface()\n{\n}\n\nbool StaticVertexBufferInterface::lookupAttribute(const gl::VertexAttribute &attribute, unsigned int *outStreamOffset)\n{\n for (unsigned int element = 0; element < mCache.size(); element++)\n {\n if (mCache[element].type == attribute.mType &&\n mCache[element].size == attribute.mSize &&\n mCache[element].stride == attribute.stride() &&\n mCache[element].normalized == attribute.mNormalized &&\n mCache[element].pureInteger == attribute.mPureInteger)\n {\n if (mCache[element].attributeOffset == attribute.mOffset % attribute.stride())\n {\n if (outStreamOffset)\n {\n *outStreamOffset = mCache[element].streamOffset;\n }\n return true;\n }\n }\n }\n\n return false;\n}\n\nbool StaticVertexBufferInterface::reserveSpace(unsigned int size)\n{\n unsigned int curSize = getBufferSize();\n if (curSize == 0)\n {\n setBufferSize(size);\n return true;\n }\n else if (curSize >= size)\n {\n return true;\n }\n else\n {\n UNREACHABLE(); \/\/ Static vertex buffers can't be resized\n return false;\n }\n}\n\nbool StaticVertexBufferInterface::storeVertexAttributes(const gl::VertexAttribute &attrib, const gl::VertexAttribCurrentValueData ¤tValue,\n GLint start, GLsizei count, GLsizei instances, unsigned int *outStreamOffset)\n{\n unsigned int streamOffset;\n if (VertexBufferInterface::storeVertexAttributes(attrib, currentValue, start, count, instances, &streamOffset))\n {\n int attributeOffset = attrib.mOffset % attrib.stride();\n VertexElement element = { attrib.mType, attrib.mSize, attrib.stride(), attrib.mNormalized, attrib.mPureInteger, attributeOffset, streamOffset };\n mCache.push_back(element);\n\n if (outStreamOffset)\n {\n *outStreamOffset = streamOffset;\n }\n\n return true;\n }\n else\n {\n return false;\n }\n}\n\n}\n<commit_msg>Early out when direct binding not supported.<commit_after>#include \"precompiled.h\"\n\/\/\n\/\/ Copyright (c) 2002-2012 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\/\/ VertexBuffer.cpp: Defines the abstract VertexBuffer class and VertexBufferInterface\n\/\/ class with derivations, classes that perform graphics API agnostic vertex buffer operations.\n\n#include \"libGLESv2\/renderer\/VertexBuffer.h\"\n#include \"libGLESv2\/renderer\/Renderer.h\"\n#include \"libGLESv2\/VertexAttribute.h\"\n#include \"libGLESv2\/renderer\/BufferStorage.h\"\n#include \"common\/mathutil.h\"\n\nnamespace rx\n{\n\nunsigned int VertexBuffer::mNextSerial = 1;\n\nVertexBuffer::VertexBuffer()\n{\n updateSerial();\n}\n\nVertexBuffer::~VertexBuffer()\n{\n}\n\nvoid VertexBuffer::updateSerial()\n{\n mSerial = mNextSerial++;\n}\n\nunsigned int VertexBuffer::getSerial() const\n{\n return mSerial;\n}\n\nVertexBufferInterface::VertexBufferInterface(rx::Renderer *renderer, bool dynamic) : mRenderer(renderer)\n{\n mDynamic = dynamic;\n mWritePosition = 0;\n mReservedSpace = 0;\n\n mVertexBuffer = renderer->createVertexBuffer();\n}\n\nVertexBufferInterface::~VertexBufferInterface()\n{\n delete mVertexBuffer;\n}\n\nunsigned int VertexBufferInterface::getSerial() const\n{\n return mVertexBuffer->getSerial();\n}\n\nunsigned int VertexBufferInterface::getBufferSize() const\n{\n return mVertexBuffer->getBufferSize();\n}\n\nbool VertexBufferInterface::setBufferSize(unsigned int size)\n{\n if (mVertexBuffer->getBufferSize() == 0)\n {\n return mVertexBuffer->initialize(size, mDynamic);\n }\n else\n {\n return mVertexBuffer->setBufferSize(size);\n }\n}\n\nunsigned int VertexBufferInterface::getWritePosition() const\n{\n return mWritePosition;\n}\n\nvoid VertexBufferInterface::setWritePosition(unsigned int writePosition)\n{\n mWritePosition = writePosition;\n}\n\nbool VertexBufferInterface::discard()\n{\n return mVertexBuffer->discard();\n}\n\nbool VertexBufferInterface::storeVertexAttributes(const gl::VertexAttribute &attrib, const gl::VertexAttribCurrentValueData ¤tValue,\n GLint start, GLsizei count, GLsizei instances, unsigned int *outStreamOffset)\n{\n unsigned int spaceRequired;\n if (!mVertexBuffer->getSpaceRequired(attrib, count, instances, &spaceRequired))\n {\n return false;\n }\n\n if (mWritePosition + spaceRequired < mWritePosition)\n {\n return false;\n }\n\n if (!reserveSpace(mReservedSpace))\n {\n return false;\n }\n mReservedSpace = 0;\n\n if (!mVertexBuffer->storeVertexAttributes(attrib, currentValue, start, count, instances, mWritePosition))\n {\n return false;\n }\n\n if (outStreamOffset)\n {\n *outStreamOffset = mWritePosition;\n }\n\n mWritePosition += spaceRequired;\n\n \/\/ Align to 16-byte boundary\n mWritePosition = rx::roundUp(mWritePosition, 16u);\n\n return true;\n}\n\nbool VertexBufferInterface::reserveVertexSpace(const gl::VertexAttribute &attribute, GLsizei count, GLsizei instances)\n{\n unsigned int requiredSpace;\n if (!mVertexBuffer->getSpaceRequired(attribute, count, instances, &requiredSpace))\n {\n return false;\n }\n\n \/\/ Protect against integer overflow\n if (mReservedSpace + requiredSpace < mReservedSpace)\n {\n return false;\n }\n\n mReservedSpace += requiredSpace;\n\n \/\/ Align to 16-byte boundary\n mReservedSpace = rx::roundUp(mReservedSpace, 16u);\n\n return true;\n}\n\nVertexBuffer* VertexBufferInterface::getVertexBuffer() const\n{\n return mVertexBuffer;\n}\n\nbool VertexBufferInterface::directStoragePossible(const gl::VertexAttribute &attrib,\n const gl::VertexAttribCurrentValueData ¤tValue) const\n{\n gl::Buffer *buffer = attrib.mBoundBuffer.get();\n BufferStorage *storage = buffer ? buffer->getStorage() : NULL;\n\n if (!storage || !storage->supportsDirectBinding())\n {\n return false;\n }\n\n gl::VertexFormat vertexFormat(attrib, currentValue.Type);\n\n \/\/ Alignment restrictions: In D3D, vertex data must be aligned to\n \/\/ the format stride, or to a 4-byte boundary, whichever is smaller.\n \/\/ (Undocumented, and experimentally confirmed)\n unsigned int outputElementSize;\n getVertexBuffer()->getSpaceRequired(attrib, 1, 0, &outputElementSize);\n size_t alignment = std::min(static_cast<size_t>(outputElementSize), 4u);\n\n bool isAligned = (static_cast<size_t>(attrib.stride()) % alignment == 0) &&\n (static_cast<size_t>(attrib.mOffset) % alignment == 0);\n bool requiresConversion = (mRenderer->getVertexConversionType(vertexFormat) & VERTEX_CONVERT_CPU) > 0;\n\n return !requiresConversion && isAligned;\n}\n\nStreamingVertexBufferInterface::StreamingVertexBufferInterface(rx::Renderer *renderer, std::size_t initialSize) : VertexBufferInterface(renderer, true)\n{\n setBufferSize(initialSize);\n}\n\nStreamingVertexBufferInterface::~StreamingVertexBufferInterface()\n{\n}\n\nbool StreamingVertexBufferInterface::reserveSpace(unsigned int size)\n{\n bool result = true;\n unsigned int curBufferSize = getBufferSize();\n if (size > curBufferSize)\n {\n result = setBufferSize(std::max(size, 3 * curBufferSize \/ 2));\n setWritePosition(0);\n }\n else if (getWritePosition() + size > curBufferSize)\n {\n if (!discard())\n {\n return false;\n }\n setWritePosition(0);\n }\n\n return result;\n}\n\nStaticVertexBufferInterface::StaticVertexBufferInterface(rx::Renderer *renderer) : VertexBufferInterface(renderer, false)\n{\n}\n\nStaticVertexBufferInterface::~StaticVertexBufferInterface()\n{\n}\n\nbool StaticVertexBufferInterface::lookupAttribute(const gl::VertexAttribute &attribute, unsigned int *outStreamOffset)\n{\n for (unsigned int element = 0; element < mCache.size(); element++)\n {\n if (mCache[element].type == attribute.mType &&\n mCache[element].size == attribute.mSize &&\n mCache[element].stride == attribute.stride() &&\n mCache[element].normalized == attribute.mNormalized &&\n mCache[element].pureInteger == attribute.mPureInteger)\n {\n if (mCache[element].attributeOffset == attribute.mOffset % attribute.stride())\n {\n if (outStreamOffset)\n {\n *outStreamOffset = mCache[element].streamOffset;\n }\n return true;\n }\n }\n }\n\n return false;\n}\n\nbool StaticVertexBufferInterface::reserveSpace(unsigned int size)\n{\n unsigned int curSize = getBufferSize();\n if (curSize == 0)\n {\n setBufferSize(size);\n return true;\n }\n else if (curSize >= size)\n {\n return true;\n }\n else\n {\n UNREACHABLE(); \/\/ Static vertex buffers can't be resized\n return false;\n }\n}\n\nbool StaticVertexBufferInterface::storeVertexAttributes(const gl::VertexAttribute &attrib, const gl::VertexAttribCurrentValueData ¤tValue,\n GLint start, GLsizei count, GLsizei instances, unsigned int *outStreamOffset)\n{\n unsigned int streamOffset;\n if (VertexBufferInterface::storeVertexAttributes(attrib, currentValue, start, count, instances, &streamOffset))\n {\n int attributeOffset = attrib.mOffset % attrib.stride();\n VertexElement element = { attrib.mType, attrib.mSize, attrib.stride(), attrib.mNormalized, attrib.mPureInteger, attributeOffset, streamOffset };\n mCache.push_back(element);\n\n if (outStreamOffset)\n {\n *outStreamOffset = streamOffset;\n }\n\n return true;\n }\n else\n {\n return false;\n }\n}\n\n}\n<|endoftext|>"} {"text":"<commit_before>\/*\nCopyright (c) 2016 Microsoft Corporation. All rights reserved.\nReleased under Apache 2.0 license as described in the file LICENSE.\n\nAuthor: Leonardo de Moura\n*\/\n#include \"kernel\/instantiate.h\"\n#include \"kernel\/abstract.h\"\n#include \"library\/constants.h\"\n#include \"library\/trace.h\"\n#include \"library\/app_builder.h\"\n#include \"library\/type_context.h\"\n#include \"library\/locals.h\"\n#include \"library\/replace_visitor_with_tc.h\"\n#include \"library\/equations_compiler\/equations.h\"\n#include \"library\/equations_compiler\/util.h\"\n\nnamespace lean {\n[[ noreturn ]] static void throw_ill_formed_eqns() {\n throw exception(\"ill-formed match\/equations expression\");\n}\n\nstatic optional<pair<expr, unsigned>> get_eqn_fn_and_arity(expr e) {\n while (is_lambda(e))\n e = binding_body(e);\n if (!is_equation(e) && !is_no_equation(e)) throw_ill_formed_eqns();\n if (is_no_equation(e)) {\n return optional<pair<expr, unsigned>>();\n } else {\n expr const & lhs = equation_lhs(e);\n expr const & fn = get_app_fn(lhs);\n lean_assert(is_local(fn));\n return optional<pair<expr, unsigned>>(fn, get_app_num_args(lhs));\n }\n}\n\nstatic expr consume_fn_prefix(expr eq, buffer<expr> const & fns) {\n for (unsigned i = 0; i < fns.size(); i++) {\n if (!is_lambda(eq)) throw_ill_formed_eqns();\n eq = binding_body(eq);\n }\n return instantiate_rev(eq, fns);\n}\n\nvoid equations_editor::unpack(expr const & e) {\n m_fns.clear();\n m_arity.clear();\n m_eqs.clear();\n lean_assert(is_equations(e));\n m_src = e;\n buffer<expr> eqs;\n unsigned num_fns = equations_num_fns(e);\n to_equations(e, eqs);\n \/* Extract functions. *\/\n lean_assert(eqs.size() > 0);\n expr eq = eqs[0];\n for (unsigned i = 0; i < num_fns; i++) {\n lean_assert(is_lambda(eq));\n m_fns.push_back(mk_local(binding_name(eq), binding_domain(eq)));\n eq = binding_body(eq);\n }\n \/* Extract equations *\/\n unsigned eqidx = 0;\n for (unsigned fidx = 0; fidx < num_fns; fidx++) {\n m_eqs.push_back(buffer<expr>());\n buffer<expr> & fn_eqs = m_eqs.back();\n if (eqidx >= eqs.size()) throw_ill_formed_eqns();\n expr eq = consume_fn_prefix(eqs[eqidx], m_fns);\n fn_eqs.push_back(eq);\n eqidx++;\n if (auto p = get_eqn_fn_and_arity(eq)) {\n if (p->first != m_fns[fidx]) throw_ill_formed_eqns();\n unsigned arity = p->second;\n m_arity.push_back(arity);\n while (eqidx < eqs.size()) {\n expr eq = consume_fn_prefix(eqs[eqidx], m_fns);\n if (auto p = get_eqn_fn_and_arity(eq)) {\n if (p->first == m_fns[fidx]) {\n if (p->second != arity) throw_ill_formed_eqns();\n fn_eqs.push_back(eq);\n eqidx++;\n } else {\n break;\n }\n } else {\n break;\n }\n }\n } else {\n \/* noequation, guess arity using type of function *\/\n expr type = mlocal_type(m_fns[fidx]);\n unsigned arity = 0;\n while (is_pi(type))\n type = binding_body(type);\n if (arity == 0) throw_ill_formed_eqns();\n m_arity.push_back(arity);\n }\n }\n if (eqs.size() != eqidx) throw_ill_formed_eqns();\n lean_assert(m_arity.size() == m_fns.size());\n lean_assert(m_eqs.size() == m_fns.size());\n}\n\nexpr equations_editor::repack() {\n buffer<expr> new_eqs;\n for (buffer<expr> const & fn_eqs : m_eqs) {\n for (expr const & eq : fn_eqs) {\n new_eqs.push_back(Fun(m_fns, eq));\n }\n }\n return update_equations(m_src, new_eqs);\n}\n\nstruct sigma_packer_fn {\n type_context & m_ctx;\n sigma_packer_fn(type_context & ctx):m_ctx(ctx) {}\n\n expr_pair mk_sigma_domain(expr const & pi_type, buffer<expr> & out_locals, unsigned n) {\n if (n == 0) return mk_pair(mk_constant(get_unit_name()), pi_type);\n expr type = pi_type;\n if (!is_pi(type)) type = m_ctx.relaxed_whnf(type);\n if (!is_pi(type)) throw_ill_formed_eqns();\n expr const & A = binding_domain(type);\n type_context::tmp_locals locals(m_ctx);\n expr a = locals.push_local_from_binding(type);\n out_locals.push_back(a);\n expr B, codomain;\n std::tie(B, codomain) = mk_sigma_domain(instantiate(binding_body(type), a), out_locals, n-1);\n B = locals.mk_lambda(B);\n return mk_pair(mk_app(m_ctx, get_sigma_name(), A, B), codomain);\n }\n\n expr mk_codomain(expr const & codomain, expr p, buffer<expr> const & locals, unsigned n) {\n buffer<expr> terms;\n for (unsigned i = 0; i < n; i++) {\n terms.push_back(mk_app(m_ctx, get_sigma_pr1_name(), p));\n p = mk_app(m_ctx, get_sigma_pr2_name(), p);\n }\n return replace_locals(codomain, locals, terms);\n }\n\n expr pack_as_unary(expr const & pi_type, unsigned n) {\n buffer<expr> locals;\n expr domain, pre_codomain;\n std::tie(domain, pre_codomain) = mk_sigma_domain(pi_type, locals, n);\n type_context::tmp_locals plocal(m_ctx);\n expr p = plocal.push_local(\"_p\", domain);\n expr codomain = mk_codomain(pre_codomain, p, locals, n);\n return plocal.mk_pi(codomain);\n }\n\n class update_apps_fn : public replace_visitor_with_tc {\n buffer<expr> const & m_old_fns;\n equations_editor const & m_editor;\n\n optional<unsigned> get_fn_idx(expr const & fn) {\n if (!is_local(fn)) return optional<unsigned>();\n for (unsigned fnidx = 0; fnidx < m_old_fns.size(); fnidx++) {\n if (mlocal_name(fn) == mlocal_name(m_old_fns[fnidx]))\n return optional<unsigned>(fnidx);\n }\n return optional<unsigned>();\n }\n\n expr pack(unsigned i, unsigned arity, buffer<expr> const & args, expr const & type) {\n if (i == arity) {\n lean_assert(is_constant(type, get_unit_name()));\n return mk_constant(get_unit_star_name());\n } else {\n lean_assert(is_constant(get_app_fn(type), get_sigma_name()));\n expr a = args[i];\n expr A = app_arg(app_fn(type));\n expr B = app_arg(type);\n lean_assert(is_lambda(B));\n expr new_type = instantiate(binding_body(B), a);\n expr b = pack(i+1, arity, args, new_type);\n bool mask[2] = {true, true};\n expr AB[2] = {A, B};\n return mk_app(mk_app(m_ctx, get_sigma_mk_name(), 2, mask, AB), a, b);\n }\n }\n\n virtual expr visit_app(expr const & e) override {\n buffer<expr> args;\n expr const & fn = get_app_args(e, args);\n auto fnidx = get_fn_idx(fn);\n if (!fnidx) return replace_visitor_with_tc::visit_app(e);\n unsigned arity = m_editor.get_arity(*fnidx);\n if (args.size() < arity) {\n expr new_e = m_ctx.eta_expand(e);\n if (!is_lambda(new_e)) throw_ill_formed_eqns();\n return visit(new_e);\n }\n expr new_fn = m_editor.get_fn(*fnidx);\n expr new_fn_type = m_ctx.infer(new_fn);\n expr sigma_type = binding_domain(new_fn_type);\n expr arg = pack(0, arity, args, sigma_type);\n expr r = mk_app(new_fn, arg);\n return mk_app(r, args.size() - arity, args.data() + arity);\n }\n\n public:\n update_apps_fn(type_context & ctx, buffer<expr> const & old_fns, equations_editor const & editor):\n replace_visitor_with_tc(ctx), m_old_fns(old_fns), m_editor(editor) {}\n };\n\n expr operator()(expr const & e) {\n equations_editor editor;\n editor.unpack(e);\n buffer<expr> old_fns;\n for (unsigned fidx = 0; fidx < editor.get_num_fns(); fidx++) {\n expr & fn = editor.get_fn(fidx);\n old_fns.push_back(fn);\n expr new_type = pack_as_unary(mlocal_type(fn), editor.get_arity(fidx));\n fn = update_mlocal(fn, new_type);\n }\n update_apps_fn updt(m_ctx, old_fns, editor);\n for (unsigned fidx = 0; fidx < editor.get_num_fns(); fidx++) {\n buffer<expr> & eqs = editor.get_eqs_of(fidx);\n for (expr & eq : eqs)\n eq = updt(eq);\n }\n return editor.repack();\n }\n};\n\nexpr pack_equations_domain(type_context & ctx, expr const & e) {\n return sigma_packer_fn(ctx)(e);\n}\n}\n<commit_msg>feat(library\/equations_compiler\/util): pack_equations_domain does nothing if function is already unary<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\/instantiate.h\"\n#include \"kernel\/abstract.h\"\n#include \"library\/constants.h\"\n#include \"library\/trace.h\"\n#include \"library\/app_builder.h\"\n#include \"library\/type_context.h\"\n#include \"library\/locals.h\"\n#include \"library\/replace_visitor_with_tc.h\"\n#include \"library\/equations_compiler\/equations.h\"\n#include \"library\/equations_compiler\/util.h\"\n\nnamespace lean {\n[[ noreturn ]] static void throw_ill_formed_eqns() {\n throw exception(\"ill-formed match\/equations expression\");\n}\n\nstatic optional<pair<expr, unsigned>> get_eqn_fn_and_arity(expr e) {\n while (is_lambda(e))\n e = binding_body(e);\n if (!is_equation(e) && !is_no_equation(e)) throw_ill_formed_eqns();\n if (is_no_equation(e)) {\n return optional<pair<expr, unsigned>>();\n } else {\n expr const & lhs = equation_lhs(e);\n expr const & fn = get_app_fn(lhs);\n lean_assert(is_local(fn));\n return optional<pair<expr, unsigned>>(fn, get_app_num_args(lhs));\n }\n}\n\nstatic expr consume_fn_prefix(expr eq, buffer<expr> const & fns) {\n for (unsigned i = 0; i < fns.size(); i++) {\n if (!is_lambda(eq)) throw_ill_formed_eqns();\n eq = binding_body(eq);\n }\n return instantiate_rev(eq, fns);\n}\n\nvoid equations_editor::unpack(expr const & e) {\n m_fns.clear();\n m_arity.clear();\n m_eqs.clear();\n lean_assert(is_equations(e));\n m_src = e;\n buffer<expr> eqs;\n unsigned num_fns = equations_num_fns(e);\n to_equations(e, eqs);\n \/* Extract functions. *\/\n lean_assert(eqs.size() > 0);\n expr eq = eqs[0];\n for (unsigned i = 0; i < num_fns; i++) {\n lean_assert(is_lambda(eq));\n m_fns.push_back(mk_local(binding_name(eq), binding_domain(eq)));\n eq = binding_body(eq);\n }\n \/* Extract equations *\/\n unsigned eqidx = 0;\n for (unsigned fidx = 0; fidx < num_fns; fidx++) {\n m_eqs.push_back(buffer<expr>());\n buffer<expr> & fn_eqs = m_eqs.back();\n if (eqidx >= eqs.size()) throw_ill_formed_eqns();\n expr eq = consume_fn_prefix(eqs[eqidx], m_fns);\n fn_eqs.push_back(eq);\n eqidx++;\n if (auto p = get_eqn_fn_and_arity(eq)) {\n if (p->first != m_fns[fidx]) throw_ill_formed_eqns();\n unsigned arity = p->second;\n m_arity.push_back(arity);\n while (eqidx < eqs.size()) {\n expr eq = consume_fn_prefix(eqs[eqidx], m_fns);\n if (auto p = get_eqn_fn_and_arity(eq)) {\n if (p->first == m_fns[fidx]) {\n if (p->second != arity) throw_ill_formed_eqns();\n fn_eqs.push_back(eq);\n eqidx++;\n } else {\n break;\n }\n } else {\n break;\n }\n }\n } else {\n \/* noequation, guess arity using type of function *\/\n expr type = mlocal_type(m_fns[fidx]);\n unsigned arity = 0;\n while (is_pi(type))\n type = binding_body(type);\n if (arity == 0) throw_ill_formed_eqns();\n m_arity.push_back(arity);\n }\n }\n if (eqs.size() != eqidx) throw_ill_formed_eqns();\n lean_assert(m_arity.size() == m_fns.size());\n lean_assert(m_eqs.size() == m_fns.size());\n}\n\nexpr equations_editor::repack() {\n buffer<expr> new_eqs;\n for (buffer<expr> const & fn_eqs : m_eqs) {\n for (expr const & eq : fn_eqs) {\n new_eqs.push_back(Fun(m_fns, eq));\n }\n }\n return update_equations(m_src, new_eqs);\n}\n\nstruct sigma_packer_fn {\n type_context & m_ctx;\n sigma_packer_fn(type_context & ctx):m_ctx(ctx) {}\n\n expr_pair mk_sigma_domain(expr const & pi_type, buffer<expr> & out_locals, unsigned n) {\n if (n == 0) return mk_pair(mk_constant(get_unit_name()), pi_type);\n expr type = pi_type;\n if (!is_pi(type)) type = m_ctx.relaxed_whnf(type);\n if (!is_pi(type)) throw_ill_formed_eqns();\n expr const & A = binding_domain(type);\n type_context::tmp_locals locals(m_ctx);\n expr a = locals.push_local_from_binding(type);\n out_locals.push_back(a);\n expr B, codomain;\n std::tie(B, codomain) = mk_sigma_domain(instantiate(binding_body(type), a), out_locals, n-1);\n B = locals.mk_lambda(B);\n return mk_pair(mk_app(m_ctx, get_sigma_name(), A, B), codomain);\n }\n\n expr mk_codomain(expr const & codomain, expr p, buffer<expr> const & locals, unsigned n) {\n buffer<expr> terms;\n for (unsigned i = 0; i < n; i++) {\n terms.push_back(mk_app(m_ctx, get_sigma_pr1_name(), p));\n p = mk_app(m_ctx, get_sigma_pr2_name(), p);\n }\n return replace_locals(codomain, locals, terms);\n }\n\n expr pack_as_unary(expr const & pi_type, unsigned n) {\n buffer<expr> locals;\n expr domain, pre_codomain;\n std::tie(domain, pre_codomain) = mk_sigma_domain(pi_type, locals, n);\n type_context::tmp_locals plocal(m_ctx);\n expr p = plocal.push_local(\"_p\", domain);\n expr codomain = mk_codomain(pre_codomain, p, locals, n);\n return plocal.mk_pi(codomain);\n }\n\n class update_apps_fn : public replace_visitor_with_tc {\n buffer<expr> const & m_old_fns;\n equations_editor const & m_editor;\n\n optional<unsigned> get_fn_idx(expr const & fn) {\n if (!is_local(fn)) return optional<unsigned>();\n for (unsigned fnidx = 0; fnidx < m_old_fns.size(); fnidx++) {\n if (mlocal_name(fn) == mlocal_name(m_old_fns[fnidx]))\n return optional<unsigned>(fnidx);\n }\n return optional<unsigned>();\n }\n\n expr pack(unsigned i, unsigned arity, buffer<expr> const & args, expr const & type) {\n if (i == arity) {\n lean_assert(is_constant(type, get_unit_name()));\n return mk_constant(get_unit_star_name());\n } else {\n lean_assert(is_constant(get_app_fn(type), get_sigma_name()));\n expr a = args[i];\n expr A = app_arg(app_fn(type));\n expr B = app_arg(type);\n lean_assert(is_lambda(B));\n expr new_type = instantiate(binding_body(B), a);\n expr b = pack(i+1, arity, args, new_type);\n bool mask[2] = {true, true};\n expr AB[2] = {A, B};\n return mk_app(mk_app(m_ctx, get_sigma_mk_name(), 2, mask, AB), a, b);\n }\n }\n\n virtual expr visit_app(expr const & e) override {\n buffer<expr> args;\n expr const & fn = get_app_args(e, args);\n auto fnidx = get_fn_idx(fn);\n if (!fnidx) return replace_visitor_with_tc::visit_app(e);\n expr new_fn = m_editor.get_fn(*fnidx);\n if (fn == new_fn) return replace_visitor_with_tc::visit_app(e);\n unsigned arity = m_editor.get_arity(*fnidx);\n if (args.size() < arity) {\n expr new_e = m_ctx.eta_expand(e);\n if (!is_lambda(new_e)) throw_ill_formed_eqns();\n return visit(new_e);\n }\n expr new_fn_type = m_ctx.infer(new_fn);\n expr sigma_type = binding_domain(new_fn_type);\n expr arg = pack(0, arity, args, sigma_type);\n expr r = mk_app(new_fn, arg);\n return mk_app(r, args.size() - arity, args.data() + arity);\n }\n\n public:\n update_apps_fn(type_context & ctx, buffer<expr> const & old_fns, equations_editor const & editor):\n replace_visitor_with_tc(ctx), m_old_fns(old_fns), m_editor(editor) {}\n };\n\n expr operator()(expr const & e) {\n equations_editor editor;\n editor.unpack(e);\n buffer<expr> old_fns;\n bool modified = false;\n for (unsigned fidx = 0; fidx < editor.get_num_fns(); fidx++) {\n expr & fn = editor.get_fn(fidx);\n old_fns.push_back(fn);\n unsigned arity = editor.get_arity(fidx);\n if (arity > 1) {\n expr new_type = pack_as_unary(mlocal_type(fn), arity);\n fn = update_mlocal(fn, new_type);\n modified = true;\n }\n }\n if (!modified) return e;\n update_apps_fn updt(m_ctx, old_fns, editor);\n for (unsigned fidx = 0; fidx < editor.get_num_fns(); fidx++) {\n buffer<expr> & eqs = editor.get_eqs_of(fidx);\n for (expr & eq : eqs)\n eq = updt(eq);\n }\n return editor.repack();\n }\n};\n\nexpr pack_equations_domain(type_context & ctx, expr const & e) {\n return sigma_packer_fn(ctx)(e);\n}\n}\n<|endoftext|>"} {"text":"<commit_before>\/*\n * LicenseVerifier.cpp\n *\n * Created on: Nov 17, 2019\n * Author: GC\n *\/\n#include <cmath>\n#include <algorithm>\n#include <licensecc_properties.h>\n\n#include \"license_verifier.hpp\"\n#include \"..\/pc_identifier\/pc_identifier_facade.hpp\"\n#include \"..\/base\/StringUtils.h\"\n#include \"..\/os\/signature_verifier.hpp\"\n\nnamespace license {\nusing namespace std;\n\nLicenseVerifier::LicenseVerifier(EventRegistry& er) : m_event_registry(er) {}\n\nLicenseVerifier::~LicenseVerifier() {}\n\nFUNCTION_RETURN LicenseVerifier::verify_signature(const FullLicenseInfo& licInfo) {\n\tconst string licInfoData(licInfo.printForSign());\n\n\tFUNCTION_RETURN ret = license::os::verify_signature(licInfoData, licInfo.license_signature);\n\n\tif (ret == FUNC_RET_OK) {\n\t\tm_event_registry.addEvent(SIGNATURE_VERIFIED, licInfo.source);\n\t} else {\n\t\tm_event_registry.addEvent(LICENSE_CORRUPTED, licInfo.source);\n\t}\n\treturn ret;\n}\n\n\/\/ TODO: split in different classes\nFUNCTION_RETURN LicenseVerifier::verify_limits(const FullLicenseInfo& licInfo) {\n\tbool is_valid = LCC_VERIFY_MAGIC(licInfo);\n\tif (!is_valid) {\n\t\tm_event_registry.addEvent(LICENSE_CORRUPTED, licInfo.source.c_str());\n\t}\n\tconst time_t now = time(nullptr);\n\tauto expiry = licInfo.m_limits.find(PARAM_EXPIRY_DATE);\n\tif (is_valid && expiry != licInfo.m_limits.end()) {\n\t\tif (seconds_from_epoch(expiry->second) < now) {\n\t\t\tm_event_registry.addEvent(PRODUCT_EXPIRED, licInfo.source.c_str(), (\"Expired \" + expiry->second).c_str());\n\t\t\tis_valid = false;\n\t\t}\n\t}\n\tconst auto start_date = licInfo.m_limits.find(PARAM_BEGIN_DATE);\n\tif (is_valid && start_date != licInfo.m_limits.end()) {\n\t\tif (seconds_from_epoch(start_date->second) > now) {\n\t\t\tm_event_registry.addEvent(PRODUCT_EXPIRED, licInfo.source.c_str(),\n\t\t\t\t\t\t\t\t\t (\"Valid from \" + start_date->second).c_str());\n\t\t\tis_valid = false;\n\t\t}\n\t}\n\tconst auto client_sig = licInfo.m_limits.find(PARAM_CLIENT_SIGNATURE);\n\tif (is_valid && client_sig != licInfo.m_limits.end()) {\n\t\tconst LCC_EVENT_TYPE event = pc_identifier::PcIdentifierFacade::validate_pc_signature(client_sig->second);\n\t\tm_event_registry.addEvent(event, licInfo.source);\n\t\tis_valid = is_valid && (event == LICENSE_OK);\n\t}\n\treturn is_valid ? FUNC_RET_OK : FUNC_RET_ERROR;\n}\n\nLicenseInfo LicenseVerifier::toLicenseInfo(const FullLicenseInfo& fullLicInfo) const {\n\tLicenseInfo info;\n\tinfo.license_type = LCC_LOCAL;\n\n\tconst auto expiry = fullLicInfo.m_limits.find(PARAM_EXPIRY_DATE);\n\tif (expiry != fullLicInfo.m_limits.end()) {\n\t\tstrncpy(info.expiry_date, expiry->second.c_str(), sizeof(info.expiry_date));\n\t\tinfo.has_expiry = true;\n\t\tconst double secs = difftime(seconds_from_epoch(expiry->second), time(nullptr));\n\t\tinfo.days_left = max((int)round(secs \/ (60 * 60 * 24)), 0);\n\t} else {\n\t\tinfo.has_expiry = false;\n\t\tinfo.days_left = 9999;\n\t\tinfo.expiry_date[0] = '\\0';\n\t}\n\n\tconst auto start_date = fullLicInfo.m_limits.find(PARAM_BEGIN_DATE);\n\tif (start_date != fullLicInfo.m_limits.end()) {\n\t}\n\n\tconst auto client_sig = fullLicInfo.m_limits.find(PARAM_CLIENT_SIGNATURE);\n\tinfo.linked_to_pc = (client_sig != fullLicInfo.m_limits.end());\n\n\tconst auto proprietary_data = fullLicInfo.m_limits.find(PARAM_EXTRA_DATA);\n\tif (proprietary_data != fullLicInfo.m_limits.end()) {\n\t\tstrncpy(info.proprietary_data, proprietary_data->second.c_str(), LCC_API_PROPRIETARY_DATA_SIZE);\n\t}\n\treturn info;\n}\n\n} \/* namespace license *\/\n<commit_msg>minor fix<commit_after>\/*\n * LicenseVerifier.cpp\n *\n * Created on: Nov 17, 2019\n * Author: GC\n *\/\n#include <cmath>\n#include <algorithm>\n#include <licensecc_properties.h>\n\n#include \"license_verifier.hpp\"\n#include \"..\/pc_identifier\/pc_identifier_facade.hpp\"\n#include \"..\/base\/StringUtils.h\"\n#include \"..\/os\/signature_verifier.hpp\"\n\nnamespace license {\nusing namespace std;\n\nLicenseVerifier::LicenseVerifier(EventRegistry& er) : m_event_registry(er) {}\n\nLicenseVerifier::~LicenseVerifier() {}\n\nFUNCTION_RETURN LicenseVerifier::verify_signature(const FullLicenseInfo& licInfo) {\n\tconst string licInfoData(licInfo.printForSign());\n\n\tFUNCTION_RETURN ret = license::os::verify_signature(licInfoData, licInfo.license_signature);\n\n\tif (ret == FUNC_RET_OK) {\n\t\tm_event_registry.addEvent(SIGNATURE_VERIFIED, licInfo.source);\n\t} else {\n\t\tm_event_registry.addEvent(LICENSE_CORRUPTED, licInfo.source);\n\t}\n\treturn ret;\n}\n\n\/\/ TODO: split in different classes\nFUNCTION_RETURN LicenseVerifier::verify_limits(const FullLicenseInfo& lic_info) {\n\tbool is_valid = LCC_VERIFY_MAGIC;\n\tif (!is_valid) {\n\t\tm_event_registry.addEvent(LICENSE_CORRUPTED, lic_info.source.c_str());\n\t}\n\tconst time_t now = time(nullptr);\n\tauto expiry = lic_info.m_limits.find(PARAM_EXPIRY_DATE);\n\tif (is_valid && expiry != lic_info.m_limits.end()) {\n\t\tif (seconds_from_epoch(expiry->second) < now) {\n\t\t\tm_event_registry.addEvent(PRODUCT_EXPIRED, lic_info.source.c_str(), (\"Expired \" + expiry->second).c_str());\n\t\t\tis_valid = false;\n\t\t}\n\t}\n\tconst auto start_date = lic_info.m_limits.find(PARAM_BEGIN_DATE);\n\tif (is_valid && start_date != lic_info.m_limits.end()) {\n\t\tif (seconds_from_epoch(start_date->second) > now) {\n\t\t\tm_event_registry.addEvent(PRODUCT_EXPIRED, lic_info.source.c_str(),\n\t\t\t\t\t\t\t\t\t (\"Valid from \" + start_date->second).c_str());\n\t\t\tis_valid = false;\n\t\t}\n\t}\n\tconst auto client_sig = lic_info.m_limits.find(PARAM_CLIENT_SIGNATURE);\n\tif (is_valid && client_sig != lic_info.m_limits.end()) {\n\t\tconst LCC_EVENT_TYPE event = pc_identifier::PcIdentifierFacade::validate_pc_signature(client_sig->second);\n\t\tm_event_registry.addEvent(event, lic_info.source);\n\t\tis_valid = is_valid && (event == LICENSE_OK);\n\t}\n\treturn is_valid ? FUNC_RET_OK : FUNC_RET_ERROR;\n}\n\nLicenseInfo LicenseVerifier::toLicenseInfo(const FullLicenseInfo& fullLicInfo) const {\n\tLicenseInfo info;\n\tinfo.license_type = LCC_LOCAL;\n\n\tconst auto expiry = fullLicInfo.m_limits.find(PARAM_EXPIRY_DATE);\n\tif (expiry != fullLicInfo.m_limits.end()) {\n\t\tstrncpy(info.expiry_date, expiry->second.c_str(), sizeof(info.expiry_date));\n\t\tinfo.has_expiry = true;\n\t\tconst double secs = difftime(seconds_from_epoch(expiry->second), time(nullptr));\n\t\tinfo.days_left = max((int)round(secs \/ (60 * 60 * 24)), 0);\n\t} else {\n\t\tinfo.has_expiry = false;\n\t\tinfo.days_left = 9999;\n\t\tinfo.expiry_date[0] = '\\0';\n\t}\n\n\tconst auto start_date = fullLicInfo.m_limits.find(PARAM_BEGIN_DATE);\n\tif (start_date != fullLicInfo.m_limits.end()) {\n\t}\n\n\tconst auto client_sig = fullLicInfo.m_limits.find(PARAM_CLIENT_SIGNATURE);\n\tinfo.linked_to_pc = (client_sig != fullLicInfo.m_limits.end());\n\n\tconst auto proprietary_data = fullLicInfo.m_limits.find(PARAM_EXTRA_DATA);\n\tif (proprietary_data != fullLicInfo.m_limits.end()) {\n\t\tstrncpy(info.proprietary_data, proprietary_data->second.c_str(), LCC_API_PROPRIETARY_DATA_SIZE);\n\t}\n\treturn info;\n}\n\n} \/* namespace license *\/\n<|endoftext|>"} {"text":"<commit_before>#include <memory>\n#include <vector>\n#include \"auto-wrap.h\"\n#include \"patch.h\"\n#include <emscripten\/bind.h>\n#include <emscripten\/val.h>\n\nusing std::vector;\n\ntemplate <>\ninline Patch const *emscripten::val::as<Patch const *>(void) const {\n using namespace emscripten;\n using namespace internal;\n\n EM_DESTRUCTORS destructors;\n EM_GENERIC_WIRE_TYPE result = _emval_as(\n handle,\n TypeID<AllowedRawPointer<Patch const>>::get(),\n &destructors\n );\n DestructorsRunner destructors_runner(destructors);\n\n return fromGenericWireType<Patch *>(result);\n}\n\nPatch *constructor(emscripten::val value) {\n bool merge_adjacent_hunks = false;\n if (value.as<bool>() && value[\"mergeAdjacentHunks\"].as<bool>()) {\n merge_adjacent_hunks = true;\n }\n return new Patch(merge_adjacent_hunks);\n}\n\nvector<uint8_t> serialize(Patch const &patch) {\n vector<uint8_t> output;\n Serializer serializer(output);\n patch.serialize(serializer);\n return output;\n}\n\nPatch *compose(vector<Patch const *> const &patches) {\n return new Patch(patches);\n}\n\nPatch *deserialize(const vector<uint8_t> &bytes) {\n Deserializer deserializer(bytes);\n return new Patch(deserializer);\n}\n\ntemplate <typename T>\nvoid hunk_set_noop(Patch::Hunk & hunk, T const &) {}\n\nEMSCRIPTEN_BINDINGS(Patch) {\n emscripten::class_<Patch>(\"Patch\")\n .constructor<>()\n .constructor<emscripten::val>(WRAP_STATIC(&constructor), emscripten::allow_raw_pointers())\n .function(\"splice\", WRAP_OVERLOAD(&Patch::splice, bool (Patch::*)(Point, Point, Point)))\n .function(\"splice\", WRAP_OVERLOAD(&Patch::splice, bool (Patch::*)(Point, Point, Point, std::unique_ptr<Text>, std::unique_ptr<Text>)))\n .function(\"spliceOld\", WRAP(&Patch::splice_old))\n .function(\"copy\", WRAP(&Patch::copy))\n .function(\"invert\", WRAP(&Patch::invert))\n .function(\"getHunks\", WRAP(&Patch::get_hunks))\n .function(\"getHunksInNewRange\", WRAP_OVERLOAD(&Patch::get_hunks_in_new_range, std::vector<Patch::Hunk> (Patch::*)(Point, Point)))\n .function(\"getHunksInNewRange\", WRAP_OVERLOAD(&Patch::get_hunks_in_new_range, std::vector<Patch::Hunk> (Patch::*)(Point, Point, bool)))\n .function(\"getHunksInOldRange\", WRAP(&Patch::get_hunks_in_old_range))\n .function(\"getHunkCount\", WRAP(&Patch::get_hunk_count))\n .function(\"hunkForOldPosition\", WRAP(&Patch::hunk_for_old_position))\n .function(\"hunkForNewPosition\", WRAP(&Patch::hunk_for_new_position))\n .function(\"rebalance\", WRAP(&Patch::rebalance))\n .function(\"serialize\", WRAP(&serialize))\n .class_function(\"compose\", WRAP_STATIC(&compose), emscripten::allow_raw_pointers())\n .class_function(\"deserialize\", WRAP_STATIC(&deserialize), emscripten::allow_raw_pointers());\n\n emscripten::value_object<Patch::Hunk>(\"Hunk\")\n .field(\"oldStart\", WRAP_FIELD(Patch::Hunk, old_start))\n .field(\"oldEnd\", WRAP_FIELD(Patch::Hunk, old_end))\n .field(\"newStart\", WRAP_FIELD(Patch::Hunk, new_start))\n .field(\"newEnd\", WRAP_FIELD(Patch::Hunk, new_end))\n .field(\"oldText\", WRAP_FIELD(Patch::Hunk, old_text))\n .field(\"newText\", WRAP_FIELD(Patch::Hunk, new_text));\n}\n<commit_msg>Get emscripten patch binding compiling again<commit_after>#include <memory>\n#include <vector>\n#include \"auto-wrap.h\"\n#include \"patch.h\"\n#include <emscripten\/bind.h>\n#include <emscripten\/val.h>\n\nusing std::runtime_error;\nusing std::string;\nusing std::vector;\n\ntemplate <>\ninline Patch const *emscripten::val::as<Patch const *>(void) const {\n using namespace emscripten;\n using namespace internal;\n\n EM_DESTRUCTORS destructors;\n EM_GENERIC_WIRE_TYPE result = _emval_as(\n handle,\n TypeID<AllowedRawPointer<Patch const>>::get(),\n &destructors\n );\n DestructorsRunner destructors_runner(destructors);\n\n return fromGenericWireType<Patch *>(result);\n}\n\nPatch *constructor(emscripten::val value) {\n bool merge_adjacent_changes = false;\n if (value.as<bool>() && value[\"mergeAdjacentChanges\"].as<bool>()) {\n merge_adjacent_changes = true;\n }\n return new Patch(merge_adjacent_changes);\n}\n\nvector<uint8_t> serialize(Patch const &patch) {\n vector<uint8_t> output;\n Serializer serializer(output);\n patch.serialize(serializer);\n return output;\n}\n\nPatch *compose(vector<Patch const *> const &patches) {\n return new Patch(patches);\n}\n\nPatch *deserialize(const vector<uint8_t> &bytes) {\n Deserializer deserializer(bytes);\n return new Patch(deserializer);\n}\n\nvoid splice(Patch &patch, PointWrapper start, PointWrapper deleted_extent, PointWrapper inserted_extent) {\n bool result = patch.splice(\n start,\n deleted_extent,\n inserted_extent\n );\n if (!result) throw runtime_error(\"Can't splice into a frozen patch\");\n}\n\nvoid splice_with_text(Patch &patch, PointWrapper start, PointWrapper deleted_extent, PointWrapper inserted_extent,\n const string &deleted_text, const string &inserted_text) {\n bool result = patch.splice(\n start,\n deleted_extent,\n inserted_extent,\n Text(deleted_text.begin(), deleted_text.end()),\n Text(inserted_text.begin(), inserted_text.end())\n );\n if (!result) throw runtime_error(\"Can't splice into a frozen patch\");\n}\n\ntemplate <typename T>\nvoid change_set_noop(Patch::Change &change, T const &) {}\n\nEMSCRIPTEN_BINDINGS(Patch) {\n emscripten::class_<Patch>(\"Patch\")\n .constructor<>()\n .constructor<emscripten::val>(WRAP_STATIC(&constructor), emscripten::allow_raw_pointers())\n .function(\"splice\", splice)\n .function(\"splice\", splice_with_text)\n .function(\"spliceOld\", WRAP(&Patch::splice_old))\n .function(\"copy\", WRAP(&Patch::copy))\n .function(\"invert\", WRAP(&Patch::invert))\n .function(\"getChanges\", WRAP(&Patch::get_changes))\n .function(\"getChangesInNewRange\", WRAP_OVERLOAD(&Patch::get_changes_in_new_range, std::vector<Patch::Change> (Patch::*)(Point, Point, bool)))\n .function(\"getChangesInOldRange\", WRAP(&Patch::get_changes_in_old_range))\n .function(\"getChangeCount\", WRAP(&Patch::get_change_count))\n .function(\"changeForOldPosition\", WRAP(&Patch::change_for_old_position))\n .function(\"changeForNewPosition\", WRAP(&Patch::change_for_new_position))\n .function(\"rebalance\", WRAP(&Patch::rebalance))\n .function(\"serialize\", WRAP(&serialize))\n .class_function(\"compose\", WRAP_STATIC(&compose), emscripten::allow_raw_pointers())\n .class_function(\"deserialize\", WRAP_STATIC(&deserialize), emscripten::allow_raw_pointers());\n\n emscripten::value_object<Patch::Change>(\"Change\")\n .field(\"oldStart\", WRAP_FIELD(Patch::Change, old_start))\n .field(\"oldEnd\", WRAP_FIELD(Patch::Change, old_end))\n .field(\"newStart\", WRAP_FIELD(Patch::Change, new_start))\n .field(\"newEnd\", WRAP_FIELD(Patch::Change, new_end))\n .field(\"oldText\", WRAP_FIELD(Patch::Change, old_text))\n .field(\"newText\", WRAP_FIELD(Patch::Change, new_text));\n}\n<|endoftext|>"} {"text":"<commit_before>#include <iostream>\n#include <fstream>\n#include <string>\n#include <set>\n\nusing namespace std;\n\nint main(int argc, char** argv) {\n\n ifstream file;\n file.open(argv[1]);\n\n\n string line;\n vector<vector <string> > source;\n set<string> dict;\n\n bool split = false;\n count i = 0;\n\n while(getline(file, line)) {\n\n if (line.compare(\"END OF INPUT\") == 0) {\n split = true;\n }\n\n if (split) {\n dict.push(line);\n }\n\n else {\n source.push_back(vector <string>);\n sorce[i].push_back(line);\n i++;\n }\n }\n\n for (int j = 0; j < i; j++) {\n\n\n }\n\n\n\n return 0;\n}\n<commit_msg>fixes, read errything right, now 4 logic<commit_after>#include <iostream>\n#include <fstream>\n#include <string>\n#include <set>\n#include <vector>\n\nusing namespace std;\n\nint main(int argc, char** argv) {\n\n ifstream file;\n file.open(argv[1]);\n\n\n string line;\n vector<vector <string> > source;\n set<string> dict;\n\n bool split = false;\n int i = 0;\n\n while(getline(file, line)) {\n\n if (line.compare(\"END OF INPUT\") == 0) {\n split = true;\n }\n\n if (split) {\n dict.insert(line);\n }\n\n else {\n source.push_back(vector<string>());\n source[i].push_back(line);\n i++;\n }\n }\n\n for(int row = 0; row < i; row++) {\n\n for(int col = 0; col < source[row].size(); col++) {\n\n \n }\n\n \/\/substitute\n\n\n \/\/add\n\n \/\/subtract\n\n\n cout << source[row].size() - 1 << endl;\n }\n\n\n\n\n\n return 0;\n}\n<|endoftext|>"} {"text":"<commit_before>#include \"Math\/Polynomial.h\"\n#include \"Math\/Derivator.h\"\n#include \"Math\/IFunction.h\"\n#include \"Math\/Functor.h\"\n#include \"Math\/WrappedFunction.h\"\n#include \"Math\/WrappedParamFunction.h\"\n#include <iostream>\n#include <vector>\n#include <cassert>\n#include <cmath>\n\n#ifdef HAVE_ROOTLIBS\n\n#include \"TStopwatch.h\"\n#include \"TF1.h\"\n#include \"Math\/WrappedTF1.h\"\n#include \"Math\/WrappedMultiTF1.h\"\n#include \"Math\/DistFunc.h\"\n\n#endif\n\nconst double ERRORLIMIT = 1E-5;\n\ntypedef double ( * FP ) ( double, void * ); \ntypedef double ( * FP2 ) ( double ); \n\n\ndouble myfunc ( double x, void * ) { \n \n return std::pow( x, 1.5); \n}\n\ndouble myfunc2 ( double x) { \n return std::pow( x, 1.5); \n}\n\nint testDerivation() {\n\n int status = 0;\n\n\n \/\/ Derivative of an IGenFunction\n \/\/ Works when compiled c++, compiled ACLiC, interpreted by CINT\n ROOT::Math::Polynomial *f1 = new ROOT::Math::Polynomial(2);\n\n std::vector<double> p(3);\n p[0] = 2;\n p[1] = 3;\n p[2] = 4;\n f1->SetParameters(&p[0]);\n\n ROOT::Math::Derivator *der = new ROOT::Math::Derivator(*f1);\n\n double step = 1E-8;\n double x0 = 2;\n\n der->SetFunction(*f1);\n double result = der->Eval(x0);\n std::cout << \"Derivative of function inheriting from IGenFunction f(x) = 2 + 3x + 4x^2 at x = 2\" << std::endl;\n std::cout << \"Return code: \" << der->Status() << std::endl;\n std::cout << \"Result: \" << result << \" +\/- \" << der->Error() << std::endl;\n std::cout << \"Exact result: \" << f1->Derivative(x0) << std::endl;\n std::cout << \"EvalForward: \" << der->EvalForward(*f1, x0) << std::endl;\n std::cout << \"EvalBackward: \" << der->EvalBackward(x0, step) << std::endl << std::endl;;\n status += fabs(result-f1->Derivative(x0)) > ERRORLIMIT;\n \n \n \/\/ Derivative of a free function\n \/\/ Works when compiled c++, compiled ACLiC, does not work when interpreted by CINT \n FP f2 = &myfunc;\n der->SetFunction(f2);\n\n std::cout << \"Derivative of a free function f(x) = x^(3\/2) at x = 2\" << std::endl;\n std::cout << \"EvalCentral: \" << der->EvalCentral(x0) << std::endl;\n std::cout << \"EvalForward: \" << der->EvalForward(x0) << std::endl;\n std::cout << \"EvalBackward: \" << der->EvalBackward(x0) << std::endl;\n\n std::cout << \"Exact result: \" << 1.5*sqrt(x0) << std::endl << std::endl;\n\n status += fabs(der->EvalCentral(x0)-1.5*sqrt(x0)) > ERRORLIMIT;\n status += fabs(der->EvalForward(x0)-1.5*sqrt(x0)) > ERRORLIMIT;\n status += fabs(der->EvalBackward(x0)-1.5*sqrt(x0)) > ERRORLIMIT;\n\n \n \n \/\/ Derivative of a free function wrapped in an IGenFunction\n \/\/ Works when compiled c++, compiled ACLiC, does not work when interpreted by CINT \n ROOT::Math::Functor1D *f3 = new ROOT::Math::Functor1D (&myfunc2);\n\n std::cout << \"Derivative of a free function wrapped in a Functor f(x) = x^(3\/2) at x = 2\" << std::endl;\n std::cout << \"EvalCentral: \" << der->Eval( *f3, x0) << std::endl;\n der->SetFunction(*f3);\n std::cout << \"EvalForward: \" << der->EvalForward(x0) << std::endl;\n std::cout << \"EvalBackward: \" << der->EvalBackward(x0) << std::endl;\n std::cout << \"Exact result: \" << 1.5*sqrt(x0) << std::endl << std::endl;\n\n status += fabs(der->Eval( *f3, x0)-1.5*sqrt(x0)) > ERRORLIMIT;\n status += fabs(der->EvalForward(x0)-1.5*sqrt(x0)) > ERRORLIMIT;\n status += fabs(der->EvalBackward(x0)-1.5*sqrt(x0)) > ERRORLIMIT;\n\n\n \/\/ tets case when an empty Derivator is used \n\n ROOT::Math::Derivator der2;\n std::cout << \"Tes a derivator without a function\" << std::endl;\n std::cout << der2.Eval(1.0) << std::endl; \n \n \/\/ Derivative of a multidim TF1 function\n \n\/\/ #ifdef LATER\n\/\/ TF2 * f2d = new TF2(\"f2d\",\"x*x + y*y\",-10,10,-10,10);\n\/\/ \/\/ find gradient at x={1,1}\n\/\/ double vx[2] = {1.,2.}; \n\/\/ ROOT::Math::WrappedTF1 fx(*f2d); \n\n\/\/ std::cout << \"Derivative of a f(x,y) = x^2 + y^2 at x = 1,y=2\" << std::endl;\n\/\/ std::cout << \"df\/dx = \" << der->EvalCentral(fx,1.) << std::endl;\n\/\/ WrappedFunc fy(*f2d,0,vx); \n\/\/ std::cout << \"df\/dy = \" << der->EvalCentral(fy,2.) << std::endl;\n\/\/ #endif\n\n return status;\n}\n\n\n#ifdef HAVE_ROOTLIBS\n\nvoid testDerivPerf() { \n\n\n std::cout << \"\\n\\n***************************************************************\\n\";\n std::cout << \"Test derivation performances....\\n\\n\";\n\n ROOT::Math::Polynomial f1(2); \n double p[3] = {2,3,4};\n f1.SetParameters(p);\n \n TStopwatch timer; \n int n = 1000000; \n double x1 = 0; double x2 = 10; \n double dx = (x2-x1)\/double(n); \n\n timer.Start(); \n double s1 = 0; \n ROOT::Math::Derivator der(f1);\n for (int i = 0; i < n; ++i) { \n double x = x1 + dx*i; \n s1+= der.EvalCentral(x);\n }\n timer.Stop(); \n std::cout << \"Time using ROOT::Math::Derivator :\\t\" << timer.RealTime() << std::endl; \n int pr = std::cout.precision(18); std::cout << s1 << std::endl; std::cout.precision(pr);\n\n timer.Start(); \n s1 = 0; \n for (int i = 0; i < n; ++i) { \n ROOT::Math::Derivator der2(f1);\n double x = x1 + dx*i; \n s1+= der2.EvalForward(x);\n }\n timer.Stop(); \n std::cout << \"Time using ROOT::Math::Derivator(2):\\t\" << timer.RealTime() << std::endl; \n pr = std::cout.precision(18); std::cout << s1 << std::endl; std::cout.precision(pr);\n\n timer.Start(); \n s1 = 0; \n for (int i = 0; i < n; ++i) { \n double x = x1 + dx*i; \n s1+= ROOT::Math::Derivator::Eval(f1,x);\n }\n timer.Stop(); \n std::cout << \"Time using ROOT::Math::Derivator(3):\\t\" << timer.RealTime() << std::endl; \n pr = std::cout.precision(18); std::cout << s1 << std::endl; std::cout.precision(pr);\n\n\n TF1 f2(\"pol\",\"pol2\",0,10);\n f2.SetParameters(p);\n \n timer.Start(); \n double s2 = 0; \n for (int i = 0; i < n; ++i) { \n double x = x1 + dx*i; \n s2+= f2.Derivative(x);\n }\n timer.Stop(); \n std::cout << \"Time using TF1::Derivative :\\t\\t\" << timer.RealTime() << std::endl; \n pr = std::cout.precision(18);\n std::cout << s2 << std::endl;\n std::cout.precision(pr);\n\n\n\n}\n\ndouble userFunc(const double *x, const double *y) {\n return std::exp(-x[0]); \n}\ndouble userFunc1(double x) { return userFunc(&x, 0); }\n\ndouble userFunc2(const double * x) { return userFunc(x, 0); }\n\nvoid testDerivPerfUser() { \n\n\n std::cout << \"\\n\\n***************************************************************\\n\";\n std::cout << \"Test derivation performances - using a User function\\n\\n\";\n\n ROOT::Math::WrappedFunction<> f1(userFunc1); \n \n TStopwatch timer; \n int n = 1000000; \n double x1 = 0; double x2 = 10; \n double dx = (x2-x1)\/double(n); \n\n timer.Start(); \n double s1 = 0; \n ROOT::Math::Derivator der(f1);\n for (int i = 0; i < n; ++i) { \n double x = x1 + dx*i; \n s1+= der.EvalCentral(x);\n }\n timer.Stop(); \n std::cout << \"Time using ROOT::Math::Derivator :\\t\" << timer.RealTime() << std::endl; \n int pr = std::cout.precision(18); std::cout << s1 << std::endl; std::cout.precision(pr);\n\n timer.Start(); \n s1 = 0; \n for (int i = 0; i < n; ++i) { \n ROOT::Math::Derivator der2(f1);\n double x = x1 + dx*i; \n s1+= der2.EvalForward(x);\n }\n timer.Stop(); \n std::cout << \"Time using ROOT::Math::Derivator(2):\\t\" << timer.RealTime() << std::endl; \n pr = std::cout.precision(18); std::cout << s1 << std::endl; std::cout.precision(pr);\n\n timer.Start(); \n s1 = 0; \n for (int i = 0; i < n; ++i) { \n double x = x1 + dx*i; \n s1+= ROOT::Math::Derivator::Eval(f1,x);\n }\n timer.Stop(); \n std::cout << \"Time using ROOT::Math::Derivator(3):\\t\" << timer.RealTime() << std::endl; \n pr = std::cout.precision(18); std::cout << s1 << std::endl; std::cout.precision(pr);\n\n\n TF1 f2(\"uf\",userFunc,0,10,0);\n \n timer.Start(); \n double s2 = 0; \n for (int i = 0; i < n; ++i) { \n double x = x1 + dx*i; \n s2+= f2.Derivative(x);\n }\n timer.Stop(); \n std::cout << \"Time using TF1::Derivative :\\t\\t\" << timer.RealTime() << std::endl; \n pr = std::cout.precision(18);\n std::cout << s2 << std::endl;\n std::cout.precision(pr);\n\n \/\/typedef double( * FN ) (const double *, const double * ); \n ROOT::Math::WrappedMultiFunction<> f3(userFunc2,1); \n timer.Start(); \n s1 = 0; \n double xx[1]; \n for (int i = 0; i < n; ++i) { \n xx[0] = x1 + dx*i; \n s1+= ROOT::Math::Derivator::Eval(f3,xx,0);\n }\n timer.Stop(); \n std::cout << \"Time using ROOT::Math::Derivator Multi:\\t\" << timer.RealTime() << std::endl; \n pr = std::cout.precision(18); std::cout << s1 << std::endl; std::cout.precision(pr);\n\n\n\n}\n\n\ndouble gausFunc( const double * x, const double * p) { \n return p[0] * ROOT::Math::normal_pdf(x[0], p[2], p[1] ); \n}\n\n\nvoid testDerivPerfParam() { \n\n\n std::cout << \"\\n\\n***************************************************************\\n\";\n std::cout << \"Test derivation performances - using a Gaussian Param function\\n\\n\";\n\n \/\/TF1 gaus(\"gaus\",\"gaus\",-10,10);\n TF1 gaus(\"gaus\",gausFunc,-10,10,3);\n double params[3] = {10,1.,1.};\n gaus.SetParameters(params);\n\n ROOT::Math::WrappedTF1 f1(gaus); \n \n TStopwatch timer; \n int n = 300000; \n double x1 = 0; double x2 = 10; \n double dx = (x2-x1)\/double(n); \n\n timer.Start(); \n double s1 = 0; \n for (int i = 0; i < n; ++i) { \n double x = x1 + dx*i; \n \/\/ param derivatives\n s1 += ROOT::Math::Derivator::Eval(f1,x,params,0);\n s1 += ROOT::Math::Derivator::Eval(f1,x,params,1);\n s1 += ROOT::Math::Derivator::Eval(f1,x,params,2);\n }\n timer.Stop(); \n std::cout << \"Time using ROOT::Math::Derivator (1D) :\\t\" << timer.RealTime() << std::endl; \n int pr = std::cout.precision(18); std::cout << s1 << std::endl; std::cout.precision(pr);\n\n ROOT::Math::WrappedParamFunction<> f2(&gausFunc,1,params,params+3); \n double xx[1]; \n\n timer.Start(); \n s1 = 0; \n for (int i = 0; i < n; ++i) { \n xx[0] = x1 + dx*i; \n s1 += ROOT::Math::Derivator::Eval(f2,xx,params,0);\n s1 += ROOT::Math::Derivator::Eval(f2,xx,params,1);\n s1 += ROOT::Math::Derivator::Eval(f2,xx,params,2);\n }\n timer.Stop(); \n std::cout << \"Time using ROOT::Math::Derivator(ND):\\t\" << timer.RealTime() << std::endl; \n pr = std::cout.precision(18); std::cout << s1 << std::endl; std::cout.precision(pr);\n\n \/\/ test that func parameters have not been changed \n assert( std::fabs(params[0] - gaus.GetParameter(0)) < 1.E-15); \n assert( std::fabs(params[1] - gaus.GetParameter(1)) < 1.E-15); \n assert( std::fabs(params[2] - gaus.GetParameter(2)) < 1.E-15); \n\n timer.Start(); \n s1 = 0; \n double g[3];\n for (int i = 0; i < n; ++i) { \n xx[0] = x1 + dx*i; \n gaus.GradientPar(xx,g,1E-8);\n s1 += g[0];\n s1 += g[1];\n s1 += g[2];\n }\n timer.Stop(); \n std::cout << \"Time using TF1::ParamGradient:\\t\\t\" << timer.RealTime() << std::endl; \n pr = std::cout.precision(18); std::cout << s1 << std::endl; std::cout.precision(pr);\n\n}\n\n#endif\n\nint main() {\n\n int status = 0;\n\n status += testDerivation();\n\n#ifdef HAVE_ROOTLIBS\n testDerivPerf();\n testDerivPerfUser();\n testDerivPerfParam();\n#endif\n\n return status;\n\n}\n<commit_msg>Fix a warning<commit_after>#include \"Math\/Polynomial.h\"\n#include \"Math\/Derivator.h\"\n#include \"Math\/IFunction.h\"\n#include \"Math\/Functor.h\"\n#include \"Math\/WrappedFunction.h\"\n#include \"Math\/WrappedParamFunction.h\"\n#include <iostream>\n#include <vector>\n#include <cassert>\n#include <cmath>\n\n#ifdef HAVE_ROOTLIBS\n\n#include \"TStopwatch.h\"\n#include \"TF1.h\"\n#include \"Math\/WrappedTF1.h\"\n#include \"Math\/WrappedMultiTF1.h\"\n#include \"Math\/DistFunc.h\"\n\n#endif\n\nconst double ERRORLIMIT = 1E-5;\n\ntypedef double ( * FP ) ( double, void * ); \ntypedef double ( * FP2 ) ( double ); \n\n\ndouble myfunc ( double x, void * ) { \n \n return std::pow( x, 1.5); \n}\n\ndouble myfunc2 ( double x) { \n return std::pow( x, 1.5); \n}\n\nint testDerivation() {\n\n int status = 0;\n\n\n \/\/ Derivative of an IGenFunction\n \/\/ Works when compiled c++, compiled ACLiC, interpreted by CINT\n ROOT::Math::Polynomial *f1 = new ROOT::Math::Polynomial(2);\n\n std::vector<double> p(3);\n p[0] = 2;\n p[1] = 3;\n p[2] = 4;\n f1->SetParameters(&p[0]);\n\n ROOT::Math::Derivator *der = new ROOT::Math::Derivator(*f1);\n\n double step = 1E-8;\n double x0 = 2;\n\n der->SetFunction(*f1);\n double result = der->Eval(x0);\n std::cout << \"Derivative of function inheriting from IGenFunction f(x) = 2 + 3x + 4x^2 at x = 2\" << std::endl;\n std::cout << \"Return code: \" << der->Status() << std::endl;\n std::cout << \"Result: \" << result << \" +\/- \" << der->Error() << std::endl;\n std::cout << \"Exact result: \" << f1->Derivative(x0) << std::endl;\n std::cout << \"EvalForward: \" << der->EvalForward(*f1, x0) << std::endl;\n std::cout << \"EvalBackward: \" << der->EvalBackward(x0, step) << std::endl << std::endl;;\n status += fabs(result-f1->Derivative(x0)) > ERRORLIMIT;\n \n \n \/\/ Derivative of a free function\n \/\/ Works when compiled c++, compiled ACLiC, does not work when interpreted by CINT \n FP f2 = &myfunc;\n der->SetFunction(f2);\n\n std::cout << \"Derivative of a free function f(x) = x^(3\/2) at x = 2\" << std::endl;\n std::cout << \"EvalCentral: \" << der->EvalCentral(x0) << std::endl;\n std::cout << \"EvalForward: \" << der->EvalForward(x0) << std::endl;\n std::cout << \"EvalBackward: \" << der->EvalBackward(x0) << std::endl;\n\n std::cout << \"Exact result: \" << 1.5*sqrt(x0) << std::endl << std::endl;\n\n status += fabs(der->EvalCentral(x0)-1.5*sqrt(x0)) > ERRORLIMIT;\n status += fabs(der->EvalForward(x0)-1.5*sqrt(x0)) > ERRORLIMIT;\n status += fabs(der->EvalBackward(x0)-1.5*sqrt(x0)) > ERRORLIMIT;\n\n \n \n \/\/ Derivative of a free function wrapped in an IGenFunction\n \/\/ Works when compiled c++, compiled ACLiC, does not work when interpreted by CINT \n ROOT::Math::Functor1D *f3 = new ROOT::Math::Functor1D (&myfunc2);\n\n std::cout << \"Derivative of a free function wrapped in a Functor f(x) = x^(3\/2) at x = 2\" << std::endl;\n std::cout << \"EvalCentral: \" << der->Eval( *f3, x0) << std::endl;\n der->SetFunction(*f3);\n std::cout << \"EvalForward: \" << der->EvalForward(x0) << std::endl;\n std::cout << \"EvalBackward: \" << der->EvalBackward(x0) << std::endl;\n std::cout << \"Exact result: \" << 1.5*sqrt(x0) << std::endl << std::endl;\n\n status += fabs(der->Eval( *f3, x0)-1.5*sqrt(x0)) > ERRORLIMIT;\n status += fabs(der->EvalForward(x0)-1.5*sqrt(x0)) > ERRORLIMIT;\n status += fabs(der->EvalBackward(x0)-1.5*sqrt(x0)) > ERRORLIMIT;\n\n\n \/\/ tets case when an empty Derivator is used \n\n ROOT::Math::Derivator der2;\n std::cout << \"Tes a derivator without a function\" << std::endl;\n std::cout << der2.Eval(1.0) << std::endl; \n \n \/\/ Derivative of a multidim TF1 function\n \n\/\/ #ifdef LATER\n\/\/ TF2 * f2d = new TF2(\"f2d\",\"x*x + y*y\",-10,10,-10,10);\n\/\/ \/\/ find gradient at x={1,1}\n\/\/ double vx[2] = {1.,2.}; \n\/\/ ROOT::Math::WrappedTF1 fx(*f2d); \n\n\/\/ std::cout << \"Derivative of a f(x,y) = x^2 + y^2 at x = 1,y=2\" << std::endl;\n\/\/ std::cout << \"df\/dx = \" << der->EvalCentral(fx,1.) << std::endl;\n\/\/ WrappedFunc fy(*f2d,0,vx); \n\/\/ std::cout << \"df\/dy = \" << der->EvalCentral(fy,2.) << std::endl;\n\/\/ #endif\n\n return status;\n}\n\n\n#ifdef HAVE_ROOTLIBS\n\nvoid testDerivPerf() { \n\n\n std::cout << \"\\n\\n***************************************************************\\n\";\n std::cout << \"Test derivation performances....\\n\\n\";\n\n ROOT::Math::Polynomial f1(2); \n double p[3] = {2,3,4};\n f1.SetParameters(p);\n \n TStopwatch timer; \n int n = 1000000; \n double x1 = 0; double x2 = 10; \n double dx = (x2-x1)\/double(n); \n\n timer.Start(); \n double s1 = 0; \n ROOT::Math::Derivator der(f1);\n for (int i = 0; i < n; ++i) { \n double x = x1 + dx*i; \n s1+= der.EvalCentral(x);\n }\n timer.Stop(); \n std::cout << \"Time using ROOT::Math::Derivator :\\t\" << timer.RealTime() << std::endl; \n int pr = std::cout.precision(18); std::cout << s1 << std::endl; std::cout.precision(pr);\n\n timer.Start(); \n s1 = 0; \n for (int i = 0; i < n; ++i) { \n ROOT::Math::Derivator der2(f1);\n double x = x1 + dx*i; \n s1+= der2.EvalForward(x);\n }\n timer.Stop(); \n std::cout << \"Time using ROOT::Math::Derivator(2):\\t\" << timer.RealTime() << std::endl; \n pr = std::cout.precision(18); std::cout << s1 << std::endl; std::cout.precision(pr);\n\n timer.Start(); \n s1 = 0; \n for (int i = 0; i < n; ++i) { \n double x = x1 + dx*i; \n s1+= ROOT::Math::Derivator::Eval(f1,x);\n }\n timer.Stop(); \n std::cout << \"Time using ROOT::Math::Derivator(3):\\t\" << timer.RealTime() << std::endl; \n pr = std::cout.precision(18); std::cout << s1 << std::endl; std::cout.precision(pr);\n\n\n TF1 f2(\"pol\",\"pol2\",0,10);\n f2.SetParameters(p);\n \n timer.Start(); \n double s2 = 0; \n for (int i = 0; i < n; ++i) { \n double x = x1 + dx*i; \n s2+= f2.Derivative(x);\n }\n timer.Stop(); \n std::cout << \"Time using TF1::Derivative :\\t\\t\" << timer.RealTime() << std::endl; \n pr = std::cout.precision(18);\n std::cout << s2 << std::endl;\n std::cout.precision(pr);\n\n\n\n}\n\ndouble userFunc(const double *x, const double *) {\n return std::exp(-x[0]); \n}\ndouble userFunc1(double x) { return userFunc(&x, 0); }\n\ndouble userFunc2(const double * x) { return userFunc(x, 0); }\n\nvoid testDerivPerfUser() { \n\n\n std::cout << \"\\n\\n***************************************************************\\n\";\n std::cout << \"Test derivation performances - using a User function\\n\\n\";\n\n ROOT::Math::WrappedFunction<> f1(userFunc1); \n \n TStopwatch timer; \n int n = 1000000; \n double x1 = 0; double x2 = 10; \n double dx = (x2-x1)\/double(n); \n\n timer.Start(); \n double s1 = 0; \n ROOT::Math::Derivator der(f1);\n for (int i = 0; i < n; ++i) { \n double x = x1 + dx*i; \n s1+= der.EvalCentral(x);\n }\n timer.Stop(); \n std::cout << \"Time using ROOT::Math::Derivator :\\t\" << timer.RealTime() << std::endl; \n int pr = std::cout.precision(18); std::cout << s1 << std::endl; std::cout.precision(pr);\n\n timer.Start(); \n s1 = 0; \n for (int i = 0; i < n; ++i) { \n ROOT::Math::Derivator der2(f1);\n double x = x1 + dx*i; \n s1+= der2.EvalForward(x);\n }\n timer.Stop(); \n std::cout << \"Time using ROOT::Math::Derivator(2):\\t\" << timer.RealTime() << std::endl; \n pr = std::cout.precision(18); std::cout << s1 << std::endl; std::cout.precision(pr);\n\n timer.Start(); \n s1 = 0; \n for (int i = 0; i < n; ++i) { \n double x = x1 + dx*i; \n s1+= ROOT::Math::Derivator::Eval(f1,x);\n }\n timer.Stop(); \n std::cout << \"Time using ROOT::Math::Derivator(3):\\t\" << timer.RealTime() << std::endl; \n pr = std::cout.precision(18); std::cout << s1 << std::endl; std::cout.precision(pr);\n\n\n TF1 f2(\"uf\",userFunc,0,10,0);\n \n timer.Start(); \n double s2 = 0; \n for (int i = 0; i < n; ++i) { \n double x = x1 + dx*i; \n s2+= f2.Derivative(x);\n }\n timer.Stop(); \n std::cout << \"Time using TF1::Derivative :\\t\\t\" << timer.RealTime() << std::endl; \n pr = std::cout.precision(18);\n std::cout << s2 << std::endl;\n std::cout.precision(pr);\n\n \/\/typedef double( * FN ) (const double *, const double * ); \n ROOT::Math::WrappedMultiFunction<> f3(userFunc2,1); \n timer.Start(); \n s1 = 0; \n double xx[1]; \n for (int i = 0; i < n; ++i) { \n xx[0] = x1 + dx*i; \n s1+= ROOT::Math::Derivator::Eval(f3,xx,0);\n }\n timer.Stop(); \n std::cout << \"Time using ROOT::Math::Derivator Multi:\\t\" << timer.RealTime() << std::endl; \n pr = std::cout.precision(18); std::cout << s1 << std::endl; std::cout.precision(pr);\n\n\n\n}\n\n\ndouble gausFunc( const double * x, const double * p) { \n return p[0] * ROOT::Math::normal_pdf(x[0], p[2], p[1] ); \n}\n\n\nvoid testDerivPerfParam() { \n\n\n std::cout << \"\\n\\n***************************************************************\\n\";\n std::cout << \"Test derivation performances - using a Gaussian Param function\\n\\n\";\n\n \/\/TF1 gaus(\"gaus\",\"gaus\",-10,10);\n TF1 gaus(\"gaus\",gausFunc,-10,10,3);\n double params[3] = {10,1.,1.};\n gaus.SetParameters(params);\n\n ROOT::Math::WrappedTF1 f1(gaus); \n \n TStopwatch timer; \n int n = 300000; \n double x1 = 0; double x2 = 10; \n double dx = (x2-x1)\/double(n); \n\n timer.Start(); \n double s1 = 0; \n for (int i = 0; i < n; ++i) { \n double x = x1 + dx*i; \n \/\/ param derivatives\n s1 += ROOT::Math::Derivator::Eval(f1,x,params,0);\n s1 += ROOT::Math::Derivator::Eval(f1,x,params,1);\n s1 += ROOT::Math::Derivator::Eval(f1,x,params,2);\n }\n timer.Stop(); \n std::cout << \"Time using ROOT::Math::Derivator (1D) :\\t\" << timer.RealTime() << std::endl; \n int pr = std::cout.precision(18); std::cout << s1 << std::endl; std::cout.precision(pr);\n\n ROOT::Math::WrappedParamFunction<> f2(&gausFunc,1,params,params+3); \n double xx[1]; \n\n timer.Start(); \n s1 = 0; \n for (int i = 0; i < n; ++i) { \n xx[0] = x1 + dx*i; \n s1 += ROOT::Math::Derivator::Eval(f2,xx,params,0);\n s1 += ROOT::Math::Derivator::Eval(f2,xx,params,1);\n s1 += ROOT::Math::Derivator::Eval(f2,xx,params,2);\n }\n timer.Stop(); \n std::cout << \"Time using ROOT::Math::Derivator(ND):\\t\" << timer.RealTime() << std::endl; \n pr = std::cout.precision(18); std::cout << s1 << std::endl; std::cout.precision(pr);\n\n \/\/ test that func parameters have not been changed \n assert( std::fabs(params[0] - gaus.GetParameter(0)) < 1.E-15); \n assert( std::fabs(params[1] - gaus.GetParameter(1)) < 1.E-15); \n assert( std::fabs(params[2] - gaus.GetParameter(2)) < 1.E-15); \n\n timer.Start(); \n s1 = 0; \n double g[3];\n for (int i = 0; i < n; ++i) { \n xx[0] = x1 + dx*i; \n gaus.GradientPar(xx,g,1E-8);\n s1 += g[0];\n s1 += g[1];\n s1 += g[2];\n }\n timer.Stop(); \n std::cout << \"Time using TF1::ParamGradient:\\t\\t\" << timer.RealTime() << std::endl; \n pr = std::cout.precision(18); std::cout << s1 << std::endl; std::cout.precision(pr);\n\n}\n\n#endif\n\nint main() {\n\n int status = 0;\n\n status += testDerivation();\n\n#ifdef HAVE_ROOTLIBS\n testDerivPerf();\n testDerivPerfUser();\n testDerivPerfParam();\n#endif\n\n return status;\n\n}\n<|endoftext|>"} {"text":"<commit_before>#include \"Lifter.h\"\n#include \"..\/RobotMap.h\"\n#include \"..\/Commands\/ControlLifter.h\"\n\nLifter::Lifter()\n\t: Subsystem(\"Lifter\")\n{\n\tm_cLiftMotorL = new Talon(LIFTERL);\n\tm_cLiftMotorR = new Talon(LIFTERR);\n\tm_cLimitSwitch = new DigitalInput(LIFTERSWITCH);\n\tm_cEncoderL = new Encoder(ENCODERL_A, ENCODERL_B, false);\n\tm_cEncoderR = new Encoder(ENCODERR_A, ENCODERR_B, false);\n\tm_dLifterPosition = 0;\n}\n\nLifter::~Lifter(){\n\tdelete m_cEncoderL;\n\tdelete m_cEncoderR;\n\tdelete m_cLimitSwitch;\n\tdelete m_cLiftMotorL;\n\tdelete m_cLiftMotorR;\n}\n\nvoid Lifter::InitDefaultCommand()\n{\n\t\/\/ Set the default command for a subsystem here.\n\tSetDefaultCommand(new ControlLifter());\n}\n\n\/\/ Put methods for controlling this subsystem\n\/\/ here. Call these from Commands.\n\ndouble Lifter::getLeftSpeed(){\n\treturn m_cLiftMotorL->Get();\n}\n\ndouble Lifter::getRightSpeed(){\n\treturn m_cLiftMotorR->Get();\n}\n\/\/Keeps motors level\nvoid Lifter::Balance(float fDirection)\n{\n\tm_dEncoderLeftValue = m_cEncoderL->Get();\n\tm_dEncoderRightValue = m_cEncoderR->Get();\n\t\/\/Get fraction from difference in encoder values\n\t\/\/fDirection ensures that difference will be same proportion for all axis values\n\t\/\/Code will only do something if fDirection is not 0, aka stick is not neutral\n\tif(fDirection != 0){\n\t\tdouble dRateDifference;\n\t\t\/\/prevents divide-by-zero errors in case of encoders at 0\n\t\tif((m_dEncoderLeftValue+m_dEncoderRightValue) != 0){\n\t\t\tdRateDifference = fDirection*(m_dEncoderLeftValue-m_dEncoderRightValue)\/(m_dEncoderLeftValue+m_dEncoderRightValue);\n\t\t}else{\n\t\t\tdRateDifference = 0;\n\t\t}\n\n\t\t\/\/compensates for difference in motors using encoder rate difference\n\t\tif(fDirection > 0)\n\t\t{\n\t\t\tm_cLiftMotorL->SetSpeed(fDirection-dRateDifference);\n\t\t\tm_cLiftMotorR->SetSpeed(fDirection+dRateDifference);\n\t\t}\n\t\telse if(not m_cLimitSwitch->Get())\n\t\t{\n\t\t\tm_cLiftMotorL->SetSpeed(fDirection+dRateDifference);\n\t\t\tm_cLiftMotorR->SetSpeed(fDirection-dRateDifference);\n\t\t}\n\t\t\/\/reset encoders when lifter is at the bottom\n\t\tif(m_cLimitSwitch->Get()){\n\t\t\tm_cEncoderL->Reset();\n\t\t\tm_cEncoderR->Reset();\n\t\t}\n\t}\n}\n<commit_msg>making a warning go away<commit_after>#include \"Lifter.h\"\n#include \"..\/RobotMap.h\"\n#include \"..\/Commands\/ControlLifter.h\"\n\nLifter::Lifter()\n\t: Subsystem(\"Lifter\")\n{\n\tm_cLiftMotorL = new Talon(LIFTERL);\n\tm_cLiftMotorR = new Talon(LIFTERR);\n\tm_cLimitSwitch = new DigitalInput(LIFTERSWITCH);\n\tm_cEncoderL = new Encoder(ENCODERL_A, ENCODERL_B, false);\n\tm_cEncoderR = new Encoder(ENCODERR_A, ENCODERR_B, false);\n\tm_dLifterPosition = 0;\n\tm_dEncoderLeftValue=0;\n\tm_dEncoderRightValue=0;\n}\n\nLifter::~Lifter(){\n\tdelete m_cEncoderL;\n\tdelete m_cEncoderR;\n\tdelete m_cLimitSwitch;\n\tdelete m_cLiftMotorL;\n\tdelete m_cLiftMotorR;\n}\n\nvoid Lifter::InitDefaultCommand()\n{\n\t\/\/ Set the default command for a subsystem here.\n\tSetDefaultCommand(new ControlLifter());\n}\n\n\/\/ Put methods for controlling this subsystem\n\/\/ here. Call these from Commands.\n\ndouble Lifter::getLeftSpeed(){\n\treturn m_cLiftMotorL->Get();\n}\n\ndouble Lifter::getRightSpeed(){\n\treturn m_cLiftMotorR->Get();\n}\n\/\/Keeps motors level\nvoid Lifter::Balance(float fDirection)\n{\n\tm_dEncoderLeftValue = m_cEncoderL->Get();\n\tm_dEncoderRightValue = m_cEncoderR->Get();\n\t\/\/Get fraction from difference in encoder values\n\t\/\/fDirection ensures that difference will be same proportion for all axis values\n\t\/\/Code will only do something if fDirection is not 0, aka stick is not neutral\n\tif(fDirection != 0){\n\t\tdouble dRateDifference;\n\t\t\/\/prevents divide-by-zero errors in case of encoders at 0\n\t\tif((m_dEncoderLeftValue+m_dEncoderRightValue) != 0){\n\t\t\tdRateDifference = fDirection*(m_dEncoderLeftValue-m_dEncoderRightValue)\/(m_dEncoderLeftValue+m_dEncoderRightValue);\n\t\t}else{\n\t\t\tdRateDifference = 0;\n\t\t}\n\n\t\t\/\/compensates for difference in motors using encoder rate difference\n\t\tif(fDirection > 0)\n\t\t{\n\t\t\tm_cLiftMotorL->SetSpeed(fDirection-dRateDifference);\n\t\t\tm_cLiftMotorR->SetSpeed(fDirection+dRateDifference);\n\t\t}\n\t\telse if(not m_cLimitSwitch->Get())\n\t\t{\n\t\t\tm_cLiftMotorL->SetSpeed(fDirection+dRateDifference);\n\t\t\tm_cLiftMotorR->SetSpeed(fDirection-dRateDifference);\n\t\t}\n\t\t\/\/reset encoders when lifter is at the bottom\n\t\tif(m_cLimitSwitch->Get()){\n\t\t\tm_cEncoderL->Reset();\n\t\t\tm_cEncoderR->Reset();\n\t\t}\n\t}\n}\n<|endoftext|>"} {"text":"<commit_before>#include \"WidgetContainer.h\"\r\n#include \"BasisManager.h\"\r\n\r\nconst std::string LogSection = \"LayoutEditor\";\r\n\r\nINSTANCE_IMPLEMENT(EditorWidgets);\r\n\r\nvoid EditorWidgets::initialise()\r\n{\r\n\tglobal_counter = 0;\r\n}\r\n\r\nvoid EditorWidgets::shutdown()\r\n{\r\n\tfor (std::vector<WidgetContainer*>::iterator iter = widgets.begin(); iter != widgets.end(); ++iter) delete *iter;\r\n\twidgets.clear();\r\n}\r\n\r\nbool EditorWidgets::load(std::string _fileName)\r\n{\r\n\tstd::string _instance = \"Editor\";\r\n\r\n\tMyGUI::xml::xmlDocument doc;\r\n\tstd::string file(MyGUI::helper::getResourcePath(_fileName, Ogre::ResourceGroupManager::DEFAULT_RESOURCE_GROUP_NAME));\r\n\tif (file.empty())\r\n\t{\r\n\t\tif (false == doc.open(_fileName)) {\r\n\t\t\tLOGGING(LogSection, Error, _instance << \" : '\" << _fileName << \"' not found\");\r\n\t\t\treturn false;\r\n\t\t}\r\n\t}\r\n\telse if (false == doc.open(file))\r\n\t{\r\n\t\tLOGGING(LogSection, Error, _instance << \" : \" << doc.getLastError());\r\n\t\treturn false;\r\n\t}\r\n\r\n\tMyGUI::xml::xmlNodePtr root = doc.getRoot();\r\n\tif ( (null == root) || (root->getName() != \"MyGUI\") ) {\r\n\t\tLOGGING(LogSection, Error, _instance << \" : '\" << _fileName << \"', tag 'MyGUI' not found\");\r\n\t\treturn false;\r\n\t}\r\n\r\n\tstd::string type;\r\n\tif (root->findAttribute(\"type\", type)) {\r\n\t\tif (type == \"Layout\")\r\n\t\t{\r\n\t\t\t\/\/ \r\n\t\t\tMyGUI::xml::xmlNodeIterator widget = root->getNodeIterator();\r\n\t\t\twhile (widget.nextNode(\"Widget\")) parseWidget(widget, 0);\r\n\t\t}\r\n\t\t\r\n\t}\r\n\treturn true;\r\n}\r\n\r\nbool EditorWidgets::save(std::string _fileName)\r\n{\r\n\tstd::string _instance = \"Editor\";\r\n\r\n\tMyGUI::xml::xmlDocument doc;\r\n\tstd::string file(MyGUI::helper::getResourcePath(_fileName, Ogre::ResourceGroupManager::DEFAULT_RESOURCE_GROUP_NAME));\r\n\tif (file.empty()) {\r\n\t\tfile = _fileName;\r\n\t}\r\n\r\n\tdoc.createInfo();\r\n\tMyGUI::xml::xmlNodePtr root = doc.createRoot(\"MyGUI\");\r\n\troot->addAttributes(\"type\", \"Layout\");\r\n\r\n\tfor (std::vector<WidgetContainer*>::iterator iter = widgets.begin(); iter != widgets.end(); ++iter)\r\n\t{\r\n\t\t\/\/ \r\n\t\tif (null == (*iter)->widget->getParent()) serialiseWidget(*iter, root);\r\n\t}\r\n\r\n\tif (false == doc.save(file)) {\r\n\t\tLOGGING(LogSection, Error, _instance << \" : \" << doc.getLastError());\r\n\t\treturn false;\r\n\t}\r\n\r\n\treturn true;\r\n}\r\n\r\nvoid EditorWidgets::loadxmlDocument(MyGUI::xml::xmlDocument * doc, bool _test)\r\n{\r\n\tMyGUI::xml::xmlNodePtr root = doc->getRoot();\r\n\r\n\tstd::string type;\r\n\tif (root->findAttribute(\"type\", type)) {\r\n\t\tif (type == \"Layout\")\r\n\t\t{\r\n\t\t\t\/\/ \r\n\t\t\tMyGUI::xml::xmlNodeIterator widget = root->getNodeIterator();\r\n\t\t\twhile (widget.nextNode(\"Widget\")) parseWidget(widget, 0, _test);\r\n\t\t}\r\n\t}\r\n}\r\n\r\nMyGUI::xml::xmlDocument * EditorWidgets::savexmlDocument()\r\n{\r\n\tMyGUI::xml::xmlDocument * doc = new MyGUI::xml::xmlDocument();\r\n\r\n\tdoc->createInfo();\r\n\tMyGUI::xml::xmlNodePtr root = doc->createRoot(\"MyGUI\");\r\n\troot->addAttributes(\"type\", \"Layout\");\r\n\r\n\tfor (std::vector<WidgetContainer*>::iterator iter = widgets.begin(); iter != widgets.end(); ++iter)\r\n\t{\r\n\t\t\/\/ \r\n\t\tif (null == (*iter)->widget->getParent()) serialiseWidget(*iter, root);\r\n\t}\r\n\r\n\treturn doc;\r\n}\r\n\r\nvoid EditorWidgets::add(WidgetContainer * _container)\r\n{\r\n\twidgets.push_back(_container);\r\n}\r\n\r\nvoid EditorWidgets::remove(MyGUI::WidgetPtr _widget)\r\n{\r\n\t\/\/ \r\n\tMyGUI::VectorWidgetPtr childs = _widget->getChilds();\r\n\tfor (MyGUI::VectorWidgetPtr::iterator iter = childs.begin(); iter != childs.end(); ++iter)\r\n\t{\r\n\t\tif (null != find(*iter)) remove(*iter);\r\n\t}\r\n\tWidgetContainer * _container = find(_widget);\r\n\r\n\tMyGUI::Gui::getInstance().destroyWidget(_widget);\r\n\r\n\tif (null != _container)\r\n\t{\r\n\t\twidgets.erase(std::find(widgets.begin(), widgets.end(), _container));\r\n\t\tdelete _container;\r\n\t}\r\n}\r\n\r\nvoid EditorWidgets::clear()\r\n{\r\n\twhile (!widgets.empty())\r\n\t{\r\n\t\tremove(widgets[widgets.size()-1]->widget);\r\n\t}\r\n\tglobal_counter = 0;\r\n}\r\n\r\nWidgetContainer * EditorWidgets::find(MyGUI::WidgetPtr _widget)\r\n{\r\n\tfor (std::vector<WidgetContainer*>::iterator iter = widgets.begin(); iter != widgets.end(); ++iter)\r\n\t{\r\n\t\tif ((*iter)->widget == _widget)\r\n\t\t{\r\n\t\t\treturn *iter;\r\n\t\t}\r\n\t}\r\n\treturn null;\r\n}\r\nWidgetContainer * EditorWidgets::find(std::string _name)\r\n{\r\n\tif (_name.empty()) return null;\r\n\tfor (std::vector<WidgetContainer*>::iterator iter = widgets.begin(); iter != widgets.end(); ++iter)\r\n\t{\r\n\t\tif ((*iter)->name == _name)\r\n\t\t{\r\n\t\t\treturn *iter;\r\n\t\t}\r\n\t}\r\n\treturn null;\r\n}\r\n\r\nvoid EditorWidgets::parseWidget(MyGUI::xml::xmlNodeIterator & _widget, MyGUI::WidgetPtr _parent, bool _test)\r\n{\r\n\tWidgetContainer * container = new WidgetContainer();\r\n\t\/\/ \r\n\tMyGUI::IntCoord coord;\r\n\tMyGUI::Align align = MyGUI::ALIGN_DEFAULT;\r\n\tstd::string position;\r\n\tstd::string layer;\r\n\r\n\t_widget->findAttribute(\"name\", container->name);\r\n\t_widget->findAttribute(\"type\", container->type);\r\n\t_widget->findAttribute(\"skin\", container->skin);\r\n\t_widget->findAttribute(\"layer\", layer);\r\n\tif (_widget->findAttribute(\"align\", container->align)) align = MyGUI::SkinManager::parseAlign(container->align);\r\n\tif (_widget->findAttribute(\"position\", position)) coord = MyGUI::IntCoord::parse(position);\r\n\tif (_widget->findAttribute(\"position_real\", position))\r\n\t{\r\n\t\tcontainer->relative_mode = true;\r\n\t\tcoord = MyGUI::Gui::getInstance().convertRelativeToInt(MyGUI::FloatCoord::parse(position), _parent);\r\n\t}\r\n\r\n\t\/\/ 2 , \r\n\tif (false == container->name.empty())\r\n\t{\r\n\t\tWidgetContainer * iter = find(container->name);\r\n\t\tif (null != iter)\r\n\t\t{\r\n\t\t\tstatic long renameN=0;\r\n\t\t\tstd::string mess = MyGUI::utility::toString(\"widget with same name name '\", container->name, \"'. Renamed to '\", container->name, renameN, \"'.\");\r\n\t\t\tLOGGING(LogSection, Warning, mess);\r\n\t\t\tMyGUI::Message::_createMessage(\"Warning\", mess, \"\", \"LayoutEditor_Overlapped\", true, null, MyGUI::Message::IconWarning | MyGUI::Message::Ok);\r\n\t\t\tcontainer->name = MyGUI::utility::toString(container->name, renameN++);\r\n\t\t}\r\n\t}\r\n\r\n\tstd::string tmpname = container->name;\r\n\tif (tmpname.empty()) \r\n\t{\r\n\t\ttmpname = MyGUI::utility::toString(container->type, global_counter);\r\n\t\tglobal_counter++;\r\n\t}\r\n\r\n\t\/\/ \r\n\ttmpname = \"LayoutEditorWidget_\" + tmpname;\r\n\r\n\tif (null == _parent) {\r\n\t\tcontainer->widget = MyGUI::Gui::getInstance().createWidgetT(container->type, container->skin, coord, align, layer, tmpname);\r\n\t\tadd(container);\r\n\t}\r\n\telse\r\n\t{\r\n\t\tcontainer->widget = _parent->createWidgetT(container->type, container->skin, coord, align, tmpname);\r\n\t\tadd(container);\r\n\t}\r\n\r\n\t\/\/ \r\n\tMyGUI::xml::xmlNodeIterator widget = _widget->getNodeIterator();\r\n\twhile (widget.nextNode()) {\r\n\r\n\t\tstd::string key, value;\r\n\r\n\t\tif (widget->getName() == \"Widget\") parseWidget(widget, container->widget);\r\n\t\telse if (widget->getName() == \"Property\") {\r\n\r\n\t\t\t\/\/ \r\n\t\t\tif (false == widget->findAttribute(\"key\", key)) continue;\r\n\t\t\tif (false == widget->findAttribute(\"value\", value)) continue;\r\n\r\n\t\t\t\/\/ \r\n\t\t\ttry{\r\n\t\t\t\tif (_test || \r\n\t\t\t\t\t ((\"Message_Modal\" != key) && (\"Window_AutoAlpha\" != key) && (\"Window_Snap\" != key)))\r\n\t\t\t\t\tMyGUI::WidgetManager::getInstance().parse(container->widget, key, value);\r\n\t\t\t\tOgre::Root::getSingleton().renderOneFrame();\r\n\t\t\t}\r\n\t\t\tcatch(...)\r\n\t\t\t{\r\n\t\t\t\tMyGUI::Message::_createMessage(\"Warning\", \"No such \" + key + \": '\" + value + \"'\", \"\", \"LayoutEditor_Overlapped\", true, null, MyGUI::Message::IconWarning | MyGUI::Message::Ok);\r\n\t\t\t\tif (key == \"Image_Texture\") MyGUI::WidgetManager::getInstance().parse(container->widget, key, \"\");\r\n\t\t\t}\/\/ for incorrect meshes or textures\r\n\r\n\t\t\tcontainer->mProperty.push_back(std::make_pair(key, value));\r\n\t\t}\r\n\t\telse if (widget->getName() == \"UserString\") {\r\n\t\t\t\/\/ \r\n\t\t\tif (false == widget->findAttribute(\"key\", key)) continue;\r\n\t\t\tif (false == widget->findAttribute(\"value\", value)) continue;\r\n\t\t\t\/\/container->mUserString.insert(std::make_pair(key, value));\r\n\t\t\tcontainer->mUserString.push_back(std::make_pair(key, value));\r\n\t\t}\r\n\r\n\t};\r\n}\r\n\r\nvoid EditorWidgets::serialiseWidget(WidgetContainer * _container, MyGUI::xml::xmlNodePtr _node)\r\n{\r\n\tMyGUI::xml::xmlNodePtr node = _node->createChild(\"Widget\");\r\n\r\n\tnode->addAttributes(\"type\", _container->type);\r\n\tnode->addAttributes(\"skin\", _container->skin);\r\n\tif (!_container->relative_mode) node->addAttributes(\"position\", _container->position());\r\n\telse node->addAttributes(\"position_real\", _container->position(false));\r\n\tif (\"\" != _container->align) node->addAttributes(\"align\", _container->align);\r\n\tif (\"\" != _container->layer()) node->addAttributes(\"layer\", _container->layer());\r\n\tif (\"\" != _container->name) node->addAttributes(\"name\", _container->name);\r\n\r\n\tfor (StringPairs::iterator iter = _container->mProperty.begin(); iter != _container->mProperty.end(); ++iter)\r\n\t{\r\n\t\tMyGUI::xml::xmlNodePtr nodeProp = node->createChild(\"Property\");\r\n\t\tnodeProp->addAttributes(\"key\", iter->first);\r\n\t\tnodeProp->addAttributes(\"value\", iter->second);\r\n\t}\r\n\r\n\tfor (StringPairs::iterator iter = _container->mUserString.begin(); iter != _container->mUserString.end(); ++iter)\r\n\t{\r\n\t\tMyGUI::xml::xmlNodePtr nodeProp = node->createChild(\"UserString\");\r\n\t\tnodeProp->addAttributes(\"key\", iter->first);\r\n\t\tnodeProp->addAttributes(\"value\", iter->second);\r\n\t}\r\n\r\n\t\/\/ , .. \r\n\tfor (std::vector<WidgetContainer*>::iterator iter = widgets.begin(); iter != widgets.end(); ++iter)\r\n\t{\r\n\t\tMyGUI::WidgetPtr parent = (*iter)->widget->getParent();\r\n\r\n\t\t\/\/ - ?\r\n\t\tif ((_container->widget->getWidgetType() == \"Window\") && (_container->widget->getClientWidget() != null)) {\r\n\t\t\tif (null != parent) {\r\n\t\t\t\tif (_container->widget == parent->getParent()) serialiseWidget(*iter, node);\r\n\t\t\t}\r\n\t\t}\r\n\t\telse if (_container->widget == parent) {\r\n\t\t\tserialiseWidget(*iter, node);\r\n\t\t}\r\n\t}\r\n}\r\n<commit_msg>fix log<commit_after>#include \"WidgetContainer.h\"\r\n#include \"BasisManager.h\"\r\n\r\nconst std::string LogSection = \"LayoutEditor\";\r\n\r\nINSTANCE_IMPLEMENT(EditorWidgets);\r\n\r\nvoid EditorWidgets::initialise()\r\n{\r\n\tglobal_counter = 0;\r\n}\r\n\r\nvoid EditorWidgets::shutdown()\r\n{\r\n\tfor (std::vector<WidgetContainer*>::iterator iter = widgets.begin(); iter != widgets.end(); ++iter) delete *iter;\r\n\twidgets.clear();\r\n}\r\n\r\nbool EditorWidgets::load(std::string _fileName)\r\n{\r\n\tstd::string _instance = \"Editor\";\r\n\r\n\tMyGUI::xml::xmlDocument doc;\r\n\tstd::string file(MyGUI::helper::getResourcePath(_fileName, Ogre::ResourceGroupManager::DEFAULT_RESOURCE_GROUP_NAME));\r\n\tif (file.empty())\r\n\t{\r\n\t\tif (false == doc.open(_fileName)) {\r\n\t\t\tLOGGING(LogSection, Error, _instance << \" : \" << doc.getLastError());\r\n\t\t\treturn false;\r\n\t\t}\r\n\t}\r\n\telse if (false == doc.open(file))\r\n\t{\r\n\t\tLOGGING(LogSection, Error, _instance << \" : \" << doc.getLastError());\r\n\t\treturn false;\r\n\t}\r\n\r\n\tMyGUI::xml::xmlNodePtr root = doc.getRoot();\r\n\tif ( (null == root) || (root->getName() != \"MyGUI\") ) {\r\n\t\tLOGGING(LogSection, Error, _instance << \" : '\" << _fileName << \"', tag 'MyGUI' not found\");\r\n\t\treturn false;\r\n\t}\r\n\r\n\tstd::string type;\r\n\tif (root->findAttribute(\"type\", type)) {\r\n\t\tif (type == \"Layout\")\r\n\t\t{\r\n\t\t\t\/\/ \r\n\t\t\tMyGUI::xml::xmlNodeIterator widget = root->getNodeIterator();\r\n\t\t\twhile (widget.nextNode(\"Widget\")) parseWidget(widget, 0);\r\n\t\t}\r\n\t\t\r\n\t}\r\n\treturn true;\r\n}\r\n\r\nbool EditorWidgets::save(std::string _fileName)\r\n{\r\n\tstd::string _instance = \"Editor\";\r\n\r\n\tMyGUI::xml::xmlDocument doc;\r\n\tstd::string file(MyGUI::helper::getResourcePath(_fileName, Ogre::ResourceGroupManager::DEFAULT_RESOURCE_GROUP_NAME));\r\n\tif (file.empty()) {\r\n\t\tfile = _fileName;\r\n\t}\r\n\r\n\tdoc.createInfo();\r\n\tMyGUI::xml::xmlNodePtr root = doc.createRoot(\"MyGUI\");\r\n\troot->addAttributes(\"type\", \"Layout\");\r\n\r\n\tfor (std::vector<WidgetContainer*>::iterator iter = widgets.begin(); iter != widgets.end(); ++iter)\r\n\t{\r\n\t\t\/\/ \r\n\t\tif (null == (*iter)->widget->getParent()) serialiseWidget(*iter, root);\r\n\t}\r\n\r\n\tif (false == doc.save(file)) {\r\n\t\tLOGGING(LogSection, Error, _instance << \" : \" << doc.getLastError());\r\n\t\treturn false;\r\n\t}\r\n\r\n\treturn true;\r\n}\r\n\r\nvoid EditorWidgets::loadxmlDocument(MyGUI::xml::xmlDocument * doc, bool _test)\r\n{\r\n\tMyGUI::xml::xmlNodePtr root = doc->getRoot();\r\n\r\n\tstd::string type;\r\n\tif (root->findAttribute(\"type\", type)) {\r\n\t\tif (type == \"Layout\")\r\n\t\t{\r\n\t\t\t\/\/ \r\n\t\t\tMyGUI::xml::xmlNodeIterator widget = root->getNodeIterator();\r\n\t\t\twhile (widget.nextNode(\"Widget\")) parseWidget(widget, 0, _test);\r\n\t\t}\r\n\t}\r\n}\r\n\r\nMyGUI::xml::xmlDocument * EditorWidgets::savexmlDocument()\r\n{\r\n\tMyGUI::xml::xmlDocument * doc = new MyGUI::xml::xmlDocument();\r\n\r\n\tdoc->createInfo();\r\n\tMyGUI::xml::xmlNodePtr root = doc->createRoot(\"MyGUI\");\r\n\troot->addAttributes(\"type\", \"Layout\");\r\n\r\n\tfor (std::vector<WidgetContainer*>::iterator iter = widgets.begin(); iter != widgets.end(); ++iter)\r\n\t{\r\n\t\t\/\/ \r\n\t\tif (null == (*iter)->widget->getParent()) serialiseWidget(*iter, root);\r\n\t}\r\n\r\n\treturn doc;\r\n}\r\n\r\nvoid EditorWidgets::add(WidgetContainer * _container)\r\n{\r\n\twidgets.push_back(_container);\r\n}\r\n\r\nvoid EditorWidgets::remove(MyGUI::WidgetPtr _widget)\r\n{\r\n\t\/\/ \r\n\tMyGUI::VectorWidgetPtr childs = _widget->getChilds();\r\n\tfor (MyGUI::VectorWidgetPtr::iterator iter = childs.begin(); iter != childs.end(); ++iter)\r\n\t{\r\n\t\tif (null != find(*iter)) remove(*iter);\r\n\t}\r\n\tWidgetContainer * _container = find(_widget);\r\n\r\n\tMyGUI::Gui::getInstance().destroyWidget(_widget);\r\n\r\n\tif (null != _container)\r\n\t{\r\n\t\twidgets.erase(std::find(widgets.begin(), widgets.end(), _container));\r\n\t\tdelete _container;\r\n\t}\r\n}\r\n\r\nvoid EditorWidgets::clear()\r\n{\r\n\twhile (!widgets.empty())\r\n\t{\r\n\t\tremove(widgets[widgets.size()-1]->widget);\r\n\t}\r\n\tglobal_counter = 0;\r\n}\r\n\r\nWidgetContainer * EditorWidgets::find(MyGUI::WidgetPtr _widget)\r\n{\r\n\tfor (std::vector<WidgetContainer*>::iterator iter = widgets.begin(); iter != widgets.end(); ++iter)\r\n\t{\r\n\t\tif ((*iter)->widget == _widget)\r\n\t\t{\r\n\t\t\treturn *iter;\r\n\t\t}\r\n\t}\r\n\treturn null;\r\n}\r\nWidgetContainer * EditorWidgets::find(std::string _name)\r\n{\r\n\tif (_name.empty()) return null;\r\n\tfor (std::vector<WidgetContainer*>::iterator iter = widgets.begin(); iter != widgets.end(); ++iter)\r\n\t{\r\n\t\tif ((*iter)->name == _name)\r\n\t\t{\r\n\t\t\treturn *iter;\r\n\t\t}\r\n\t}\r\n\treturn null;\r\n}\r\n\r\nvoid EditorWidgets::parseWidget(MyGUI::xml::xmlNodeIterator & _widget, MyGUI::WidgetPtr _parent, bool _test)\r\n{\r\n\tWidgetContainer * container = new WidgetContainer();\r\n\t\/\/ \r\n\tMyGUI::IntCoord coord;\r\n\tMyGUI::Align align = MyGUI::ALIGN_DEFAULT;\r\n\tstd::string position;\r\n\tstd::string layer;\r\n\r\n\t_widget->findAttribute(\"name\", container->name);\r\n\t_widget->findAttribute(\"type\", container->type);\r\n\t_widget->findAttribute(\"skin\", container->skin);\r\n\t_widget->findAttribute(\"layer\", layer);\r\n\tif (_widget->findAttribute(\"align\", container->align)) align = MyGUI::SkinManager::parseAlign(container->align);\r\n\tif (_widget->findAttribute(\"position\", position)) coord = MyGUI::IntCoord::parse(position);\r\n\tif (_widget->findAttribute(\"position_real\", position))\r\n\t{\r\n\t\tcontainer->relative_mode = true;\r\n\t\tcoord = MyGUI::Gui::getInstance().convertRelativeToInt(MyGUI::FloatCoord::parse(position), _parent);\r\n\t}\r\n\r\n\t\/\/ 2 , \r\n\tif (false == container->name.empty())\r\n\t{\r\n\t\tWidgetContainer * iter = find(container->name);\r\n\t\tif (null != iter)\r\n\t\t{\r\n\t\t\tstatic long renameN=0;\r\n\t\t\tstd::string mess = MyGUI::utility::toString(\"widget with same name name '\", container->name, \"'. Renamed to '\", container->name, renameN, \"'.\");\r\n\t\t\tLOGGING(LogSection, Warning, mess);\r\n\t\t\tMyGUI::Message::_createMessage(\"Warning\", mess, \"\", \"LayoutEditor_Overlapped\", true, null, MyGUI::Message::IconWarning | MyGUI::Message::Ok);\r\n\t\t\tcontainer->name = MyGUI::utility::toString(container->name, renameN++);\r\n\t\t}\r\n\t}\r\n\r\n\tstd::string tmpname = container->name;\r\n\tif (tmpname.empty()) \r\n\t{\r\n\t\ttmpname = MyGUI::utility::toString(container->type, global_counter);\r\n\t\tglobal_counter++;\r\n\t}\r\n\r\n\t\/\/ \r\n\ttmpname = \"LayoutEditorWidget_\" + tmpname;\r\n\r\n\tif (null == _parent) {\r\n\t\tcontainer->widget = MyGUI::Gui::getInstance().createWidgetT(container->type, container->skin, coord, align, layer, tmpname);\r\n\t\tadd(container);\r\n\t}\r\n\telse\r\n\t{\r\n\t\tcontainer->widget = _parent->createWidgetT(container->type, container->skin, coord, align, tmpname);\r\n\t\tadd(container);\r\n\t}\r\n\r\n\t\/\/ \r\n\tMyGUI::xml::xmlNodeIterator widget = _widget->getNodeIterator();\r\n\twhile (widget.nextNode()) {\r\n\r\n\t\tstd::string key, value;\r\n\r\n\t\tif (widget->getName() == \"Widget\") parseWidget(widget, container->widget);\r\n\t\telse if (widget->getName() == \"Property\") {\r\n\r\n\t\t\t\/\/ \r\n\t\t\tif (false == widget->findAttribute(\"key\", key)) continue;\r\n\t\t\tif (false == widget->findAttribute(\"value\", value)) continue;\r\n\r\n\t\t\t\/\/ \r\n\t\t\ttry{\r\n\t\t\t\tif (_test || \r\n\t\t\t\t\t ((\"Message_Modal\" != key) && (\"Window_AutoAlpha\" != key) && (\"Window_Snap\" != key)))\r\n\t\t\t\t\tMyGUI::WidgetManager::getInstance().parse(container->widget, key, value);\r\n\t\t\t\tOgre::Root::getSingleton().renderOneFrame();\r\n\t\t\t}\r\n\t\t\tcatch(...)\r\n\t\t\t{\r\n\t\t\t\tMyGUI::Message::_createMessage(\"Warning\", \"No such \" + key + \": '\" + value + \"'\", \"\", \"LayoutEditor_Overlapped\", true, null, MyGUI::Message::IconWarning | MyGUI::Message::Ok);\r\n\t\t\t\tif (key == \"Image_Texture\") MyGUI::WidgetManager::getInstance().parse(container->widget, key, \"\");\r\n\t\t\t}\/\/ for incorrect meshes or textures\r\n\r\n\t\t\tcontainer->mProperty.push_back(std::make_pair(key, value));\r\n\t\t}\r\n\t\telse if (widget->getName() == \"UserString\") {\r\n\t\t\t\/\/ \r\n\t\t\tif (false == widget->findAttribute(\"key\", key)) continue;\r\n\t\t\tif (false == widget->findAttribute(\"value\", value)) continue;\r\n\t\t\t\/\/container->mUserString.insert(std::make_pair(key, value));\r\n\t\t\tcontainer->mUserString.push_back(std::make_pair(key, value));\r\n\t\t}\r\n\r\n\t};\r\n}\r\n\r\nvoid EditorWidgets::serialiseWidget(WidgetContainer * _container, MyGUI::xml::xmlNodePtr _node)\r\n{\r\n\tMyGUI::xml::xmlNodePtr node = _node->createChild(\"Widget\");\r\n\r\n\tnode->addAttributes(\"type\", _container->type);\r\n\tnode->addAttributes(\"skin\", _container->skin);\r\n\tif (!_container->relative_mode) node->addAttributes(\"position\", _container->position());\r\n\telse node->addAttributes(\"position_real\", _container->position(false));\r\n\tif (\"\" != _container->align) node->addAttributes(\"align\", _container->align);\r\n\tif (\"\" != _container->layer()) node->addAttributes(\"layer\", _container->layer());\r\n\tif (\"\" != _container->name) node->addAttributes(\"name\", _container->name);\r\n\r\n\tfor (StringPairs::iterator iter = _container->mProperty.begin(); iter != _container->mProperty.end(); ++iter)\r\n\t{\r\n\t\tMyGUI::xml::xmlNodePtr nodeProp = node->createChild(\"Property\");\r\n\t\tnodeProp->addAttributes(\"key\", iter->first);\r\n\t\tnodeProp->addAttributes(\"value\", iter->second);\r\n\t}\r\n\r\n\tfor (StringPairs::iterator iter = _container->mUserString.begin(); iter != _container->mUserString.end(); ++iter)\r\n\t{\r\n\t\tMyGUI::xml::xmlNodePtr nodeProp = node->createChild(\"UserString\");\r\n\t\tnodeProp->addAttributes(\"key\", iter->first);\r\n\t\tnodeProp->addAttributes(\"value\", iter->second);\r\n\t}\r\n\r\n\t\/\/ , .. \r\n\tfor (std::vector<WidgetContainer*>::iterator iter = widgets.begin(); iter != widgets.end(); ++iter)\r\n\t{\r\n\t\tMyGUI::WidgetPtr parent = (*iter)->widget->getParent();\r\n\r\n\t\t\/\/ - ?\r\n\t\tif ((_container->widget->getWidgetType() == \"Window\") && (_container->widget->getClientWidget() != null)) {\r\n\t\t\tif (null != parent) {\r\n\t\t\t\tif (_container->widget == parent->getParent()) serialiseWidget(*iter, node);\r\n\t\t\t}\r\n\t\t}\r\n\t\telse if (_container->widget == parent) {\r\n\t\t\tserialiseWidget(*iter, node);\r\n\t\t}\r\n\t}\r\n}\r\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#include <qsysteminfo.h>\n#include <qsysteminfo_maemo_p.h>\n\n#include <QStringList>\n#include <QSize>\n#include <QFile>\n#include <QTextStream>\n#include <QLocale>\n#include <QLibraryInfo>\n\/\/#include <QtGui>\n#include <QDesktopWidget>\n#include <QDebug>\n#include <QTimer>\n#include <QDir>\n#include <QTimer>\n#include <QMapIterator>\n\n#if !defined(QT_NO_DBUS)\n#include \"gconfitem.h\" \/\/ Temporarily here.\n#endif\n\n#ifdef Q_WS_X11\n#include <QX11Info>\n#include <X11\/Xlib.h>\n\n#endif\n\n#include <QDBusInterface>\n\nQTM_BEGIN_NAMESPACE\n\nQSystemInfoPrivate::QSystemInfoPrivate(QSystemInfoLinuxCommonPrivate *parent)\n : QSystemInfoLinuxCommonPrivate(parent)\n{\n}\n\nQSystemInfoPrivate::~QSystemInfoPrivate()\n{\n}\n\n\/\/ 2 letter ISO 639-1\nQStringList QSystemInfoPrivate::availableLanguages() const\n{\n QStringList languages;\n\n GConfItem languagesItem(\"\/apps\/osso\/inputmethod\/available_languages\");\n QStringList locales = languagesItem.value().toStringList();\n\n foreach(QString locale, locales) {\n languages << locale.mid(0,2);\n }\n languages << currentLanguage();\n languages.removeDuplicates();\n\n return languages;\n}\n\n\/\/ \"major.minor.build\" format.\nQString QSystemInfoPrivate::version(QSystemInfo::Version type,\n const QString ¶meter)\n{\n QString errorStr = \"Not Available\";\n\n switch(type) {\n case QSystemInfo::Firmware :\n {\n QDBusInterface connectionInterface(\"com.nokia.SystemInfo\",\n \"\/com\/nokia\/SystemInfo\",\n \"com.nokia.SystemInfo\",\n QDBusConnection::systemBus());\n if(!connectionInterface.isValid()) {\n qWarning() << \"interfacenot valid\";\n } else {\n QDBusReply< QByteArray > reply =\n connectionInterface.call(\"GetConfigValue\",\n \"\/device\/sw-release-ver\");\n if(reply.isValid())\n return reply.value();\n }\n break;\n }\n default:\n return QSystemInfoLinuxCommonPrivate::version(type, parameter);\n break;\n };\n return errorStr;\n}\n\nbool QSystemInfoPrivate::hasFeatureSupported(QSystemInfo::Feature feature)\n{\n bool featureSupported = false;\n switch (feature) {\n case QSystemInfo::SimFeature :\n {\n GConfItem locationValues(\"\/system\/nokia\/location\");\n QStringList locationKeys = locationValues.listEntries();\n\n foreach (QString str, locationKeys) {\n if (str.contains(\"sim_imsi\"))\n featureSupported = true;\n break;\n }\n }\n break;\n case QSystemInfo::LocationFeature :\n {\n GConfItem locationValues(\"\/system\/nokia\/location\");\n QStringList locationKeys = locationValues.listEntries();\n if(locationKeys.count()) {\n featureSupported = true;\n }\n }\n break;\n case QSystemInfo::VideoOutFeature :\n {\n QString sysPath = \"\/sys\/class\/video4linux\/\";\n QDir sysDir(sysPath);\n QStringList filters;\n filters << \"*\";\n QStringList sysList = sysDir.entryList( filters ,QDir::Dirs, QDir::Name);\n if(sysList.contains(\"video0\")) {\n featureSupported = true;\n }\n }\n break;\n case QSystemInfo::HapticsFeature:\n {\n \/\/ if(halIsAvailable) {\n QHalInterface iface;\n QStringList touchSupport =\n iface.findDeviceByCapability(\"input.touchpad\");\n if(touchSupport.count()) {\n featureSupported = true;\n } else {\n featureSupported = false;\n }\n }\n \/\/ }\n break;\n default:\n featureSupported = QSystemInfoLinuxCommonPrivate::hasFeatureSupported(feature);\n break;\n };\n return featureSupported;\n}\n\nQSystemNetworkInfoPrivate::QSystemNetworkInfoPrivate(QSystemNetworkInfoLinuxCommonPrivate *parent)\n : QSystemNetworkInfoLinuxCommonPrivate(parent)\n{\n}\n\nQSystemNetworkInfoPrivate::~QSystemNetworkInfoPrivate()\n{\n}\n\n\nQSystemNetworkInfo::NetworkStatus QSystemNetworkInfoPrivate::networkStatus(QSystemNetworkInfo::NetworkMode mode)\n{\n switch(mode) {\n case QSystemNetworkInfo::GsmMode:\n {\n#if 0\n#if !defined(QT_NO_DBUS)\n QDBusInterface connectionInterface(\"com.nokia.phone.net\",\n \"\/com\/nokia\/phone\/net\",\n \"com.nokia.SystemInfo\",\n QDBusConnection::systemBus());\n if(!connectionInterface.isValid()) {\n qWarning() << \"interfacenot valid\";\n }\n QDBusReply< QByteArray > reply = connectionInterface.call(\"GetConfigValue\", \"\/device\/sw-release-ver\");\n return reply.value();\n#endif\n#endif\n }\n break;\n default:\n return QSystemNetworkInfoLinuxCommonPrivate::networkStatus(mode);\n break;\n };\n return QSystemNetworkInfo::UndefinedStatus;\n}\n\nint QSystemNetworkInfoPrivate::networkSignalStrength(QSystemNetworkInfo::NetworkMode mode)\n{\n switch(mode) {\n case QSystemNetworkInfo::GsmMode:\n case QSystemNetworkInfo::CdmaMode:\n case QSystemNetworkInfo::WcdmaMode:\n break;\n return QSystemNetworkInfoLinuxCommonPrivate::networkSignalStrength(mode);\n default:\n break;\n };\n\n return -1;\n}\n\nint QSystemNetworkInfoPrivate::cellId()\n{\n return -1;\n}\n\nint QSystemNetworkInfoPrivate::locationAreaCode()\n{\n return -1;\n}\n\n\/\/ Mobile Country Code\nQString QSystemNetworkInfoPrivate::currentMobileCountryCode()\n{\n return QString();\n}\n\n\/\/ Mobile Network Code\nQString QSystemNetworkInfoPrivate::currentMobileNetworkCode()\n{\n return QString();\n}\n\nQString QSystemNetworkInfoPrivate::homeMobileCountryCode()\n{\n return QString();\n}\n\nQString QSystemNetworkInfoPrivate::homeMobileNetworkCode()\n{\n return QString();\n}\n\nQString QSystemNetworkInfoPrivate::networkName(QSystemNetworkInfo::NetworkMode mode)\n{\n QString netname = \"\";\n\n switch(mode) {\n\n case QSystemNetworkInfo::CdmaMode:\n case QSystemNetworkInfo::GsmMode:\n case QSystemNetworkInfo::WcdmaMode:\n case QSystemNetworkInfo::WimaxMode:\n break;\n break;\n default:\n return QSystemNetworkInfoLinuxCommonPrivate::networkName(mode);\n break;\n };\n return netname;\n}\n\nQString QSystemNetworkInfoPrivate::macAddress(QSystemNetworkInfo::NetworkMode mode)\n{\n switch(mode) {\n\n case QSystemNetworkInfo::CdmaMode:\n case QSystemNetworkInfo::GsmMode:\n case QSystemNetworkInfo::WcdmaMode:\n case QSystemNetworkInfo::WimaxMode:\n break;\n default:\n return QSystemNetworkInfoLinuxCommonPrivate::networkName(mode);\n break;\n };\n return QString();\n}\n\nQNetworkInterface QSystemNetworkInfoPrivate::interfaceForMode(QSystemNetworkInfo::NetworkMode mode)\n{\n#if !defined(QT_NO_DBUS)\n switch(mode) {\n case QSystemNetworkInfo::CdmaMode:\n case QSystemNetworkInfo::GsmMode:\n case QSystemNetworkInfo::WcdmaMode:\n case QSystemNetworkInfo::WimaxMode:\n break;\n default:\n return QSystemNetworkInfoLinuxCommonPrivate::interfaceForMode(mode);\n break;\n };\n#endif\n return QNetworkInterface();\n}\n\nQSystemDisplayInfoPrivate::QSystemDisplayInfoPrivate(QSystemDisplayInfoLinuxCommonPrivate *parent)\n : QSystemDisplayInfoLinuxCommonPrivate(parent)\n{\n}\n\nQSystemDisplayInfoPrivate::~QSystemDisplayInfoPrivate()\n{\n}\n\nint QSystemDisplayInfoPrivate::displayBrightness(int screen)\n{\n Q_UNUSED(screen);\n GConfItem currentBrightness(\"\/system\/osso\/dsm\/display\/display_brightness\");\n GConfItem maxBrightness(\"\/system\/osso\/dsm\/display\/max_display_brightness_levels\");\n if(maxBrightness.value().toInt()) {\n float retVal = 100 * (currentBrightness.value().toFloat() \/\n maxBrightness.value().toFloat());\n return retVal;\n }\n\n return -1;\n}\n\n\nQSystemDeviceInfoPrivate::QSystemDeviceInfoPrivate(QSystemDeviceInfoLinuxCommonPrivate *parent)\n : QSystemDeviceInfoLinuxCommonPrivate(parent)\n{\n}\n\nQSystemDeviceInfoPrivate::~QSystemDeviceInfoPrivate()\n{\n}\n\nQSystemDeviceInfo::Profile QSystemDeviceInfoPrivate::currentProfile()\n{\n return QSystemDeviceInfo::UnknownProfile;\n}\n\nQString QSystemDeviceInfoPrivate::imei()\n{\n #if !defined(QT_NO_DBUS)\n QDBusInterface connectionInterface(\"com.nokia.phone.SIM\",\n \"\/com\/nokia\/csd\/info\",\n \"com.nokia.csd.Info\",\n QDBusConnection::systemBus());\n if(!connectionInterface.isValid()) {\n qWarning() << \"interfacenot valid\";\n }\n\n QDBusReply< QString > reply = connectionInterface.call(\"GetIMEINumber\");\n return reply.value();\n\n#endif\n return \"Not Available\";\n}\n\nQString QSystemDeviceInfoPrivate::imsi()\n{\n QString retVal = \"Not Available\";\n GConfItem locationValues(\"\/system\/nokia\/location\");\n QStringList locationKeys = locationValues.listEntries();\n\n QStringList result;\n foreach (QString str, locationKeys) {\n if (str.contains(\"sim_imsi\"))\n retVal = \"Available\";\n break;\n }\n return retVal;\n}\n\nQSystemDeviceInfo::SimStatus QSystemDeviceInfoPrivate::simStatus()\n{\n GConfItem locationValues(\"\/system\/nokia\/location\");\n QStringList locationKeys = locationValues.listEntries();\n QStringList result;\n int count = 0;\n foreach (QString str, locationKeys) {\n if (str.contains(\"sim_imsi\"))\n count++;\n }\n\n if(count == 1) {\n return QSystemDeviceInfo::SingleSimAvailable;\n } else if (count == 2) {\n return QSystemDeviceInfo::DualSimAvailable;\n }\n return QSystemDeviceInfo::SimNotAvailable;\n}\n\nbool QSystemDeviceInfoPrivate::isDeviceLocked()\n{\n QSystemScreenSaverPrivate priv;\n\n if(priv.isScreenLockEnabled()\n && priv.isScreenSaverActive()) {\n return true;\n }\n\n return false;\n}\n\n QSystemScreenSaverPrivate::QSystemScreenSaverPrivate(QSystemScreenSaverLinuxCommonPrivate *parent)\n : QSystemScreenSaverLinuxCommonPrivate(parent)\n {\n }\n\n QSystemScreenSaverPrivate::~QSystemScreenSaverPrivate()\n {\n }\n\n bool QSystemScreenSaverPrivate::setScreenSaverInhibit()\n {\n return false;\n}\n\n\nbool QSystemScreenSaverPrivate::screenSaverInhibited()\n{\n\n return false;\n}\n\nbool QSystemScreenSaverPrivate::isScreenLockEnabled()\n{\n return false;\n}\n\nbool QSystemScreenSaverPrivate::isScreenSaverActive()\n{\n return false;\n}\n\n#include \"moc_qsysteminfo_maemo_p.cpp\"\n\nQTM_END_NAMESPACE\n<commit_msg>remove comments<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#include <qsysteminfo.h>\n#include <qsysteminfo_maemo_p.h>\n\n#include <QStringList>\n#include <QSize>\n#include <QFile>\n#include <QTextStream>\n#include <QLocale>\n#include <QLibraryInfo>\n\/\/#include <QtGui>\n#include <QDesktopWidget>\n#include <QDebug>\n#include <QTimer>\n#include <QDir>\n#include <QTimer>\n#include <QMapIterator>\n\n#if !defined(QT_NO_DBUS)\n#include \"gconfitem.h\" \/\/ Temporarily here.\n#endif\n\n#ifdef Q_WS_X11\n#include <QX11Info>\n#include <X11\/Xlib.h>\n\n#endif\n\n#include <QDBusInterface>\n\nQTM_BEGIN_NAMESPACE\n\nQSystemInfoPrivate::QSystemInfoPrivate(QSystemInfoLinuxCommonPrivate *parent)\n : QSystemInfoLinuxCommonPrivate(parent)\n{\n}\n\nQSystemInfoPrivate::~QSystemInfoPrivate()\n{\n}\n\nQStringList QSystemInfoPrivate::availableLanguages() const\n{\n QStringList languages;\n\n GConfItem languagesItem(\"\/apps\/osso\/inputmethod\/available_languages\");\n QStringList locales = languagesItem.value().toStringList();\n\n foreach(QString locale, locales) {\n languages << locale.mid(0,2);\n }\n languages << currentLanguage();\n languages.removeDuplicates();\n\n return languages;\n}\n\nQString QSystemInfoPrivate::version(QSystemInfo::Version type,\n const QString ¶meter)\n{\n QString errorStr = \"Not Available\";\n\n switch(type) {\n case QSystemInfo::Firmware :\n {\n QDBusInterface connectionInterface(\"com.nokia.SystemInfo\",\n \"\/com\/nokia\/SystemInfo\",\n \"com.nokia.SystemInfo\",\n QDBusConnection::systemBus());\n if(!connectionInterface.isValid()) {\n qWarning() << \"interfacenot valid\";\n } else {\n QDBusReply< QByteArray > reply =\n connectionInterface.call(\"GetConfigValue\",\n \"\/device\/sw-release-ver\");\n if(reply.isValid())\n return reply.value();\n }\n break;\n }\n default:\n return QSystemInfoLinuxCommonPrivate::version(type, parameter);\n break;\n };\n return errorStr;\n}\n\nbool QSystemInfoPrivate::hasFeatureSupported(QSystemInfo::Feature feature)\n{\n bool featureSupported = false;\n switch (feature) {\n case QSystemInfo::SimFeature :\n {\n GConfItem locationValues(\"\/system\/nokia\/location\");\n QStringList locationKeys = locationValues.listEntries();\n\n foreach (QString str, locationKeys) {\n if (str.contains(\"sim_imsi\"))\n featureSupported = true;\n break;\n }\n }\n break;\n case QSystemInfo::LocationFeature :\n {\n GConfItem locationValues(\"\/system\/nokia\/location\");\n QStringList locationKeys = locationValues.listEntries();\n if(locationKeys.count()) {\n featureSupported = true;\n }\n }\n break;\n case QSystemInfo::VideoOutFeature :\n {\n QString sysPath = \"\/sys\/class\/video4linux\/\";\n QDir sysDir(sysPath);\n QStringList filters;\n filters << \"*\";\n QStringList sysList = sysDir.entryList( filters ,QDir::Dirs, QDir::Name);\n if(sysList.contains(\"video0\")) {\n featureSupported = true;\n }\n }\n break;\n case QSystemInfo::HapticsFeature:\n {\n \/\/ if(halIsAvailable) {\n QHalInterface iface;\n QStringList touchSupport =\n iface.findDeviceByCapability(\"input.touchpad\");\n if(touchSupport.count()) {\n featureSupported = true;\n } else {\n featureSupported = false;\n }\n }\n \/\/ }\n break;\n default:\n featureSupported = QSystemInfoLinuxCommonPrivate::hasFeatureSupported(feature);\n break;\n };\n return featureSupported;\n}\n\nQSystemNetworkInfoPrivate::QSystemNetworkInfoPrivate(QSystemNetworkInfoLinuxCommonPrivate *parent)\n : QSystemNetworkInfoLinuxCommonPrivate(parent)\n{\n}\n\nQSystemNetworkInfoPrivate::~QSystemNetworkInfoPrivate()\n{\n}\n\n\nQSystemNetworkInfo::NetworkStatus QSystemNetworkInfoPrivate::networkStatus(QSystemNetworkInfo::NetworkMode mode)\n{\n switch(mode) {\n case QSystemNetworkInfo::GsmMode:\n {\n#if 0\n#if !defined(QT_NO_DBUS)\n QDBusInterface connectionInterface(\"com.nokia.phone.net\",\n \"\/com\/nokia\/phone\/net\",\n \"com.nokia.SystemInfo\",\n QDBusConnection::systemBus());\n if(!connectionInterface.isValid()) {\n qWarning() << \"interfacenot valid\";\n }\n QDBusReply< QByteArray > reply = connectionInterface.call(\"GetConfigValue\", \"\/device\/sw-release-ver\");\n return reply.value();\n#endif\n#endif\n }\n break;\n default:\n return QSystemNetworkInfoLinuxCommonPrivate::networkStatus(mode);\n break;\n };\n return QSystemNetworkInfo::UndefinedStatus;\n}\n\nint QSystemNetworkInfoPrivate::networkSignalStrength(QSystemNetworkInfo::NetworkMode mode)\n{\n switch(mode) {\n case QSystemNetworkInfo::GsmMode:\n case QSystemNetworkInfo::CdmaMode:\n case QSystemNetworkInfo::WcdmaMode:\n break;\n return QSystemNetworkInfoLinuxCommonPrivate::networkSignalStrength(mode);\n default:\n break;\n };\n\n return -1;\n}\n\nint QSystemNetworkInfoPrivate::cellId()\n{\n return -1;\n}\n\nint QSystemNetworkInfoPrivate::locationAreaCode()\n{\n return -1;\n}\n\nQString QSystemNetworkInfoPrivate::currentMobileCountryCode()\n{\n return QString();\n}\n\nQString QSystemNetworkInfoPrivate::currentMobileNetworkCode()\n{\n return QString();\n}\n\nQString QSystemNetworkInfoPrivate::homeMobileCountryCode()\n{\n return QString();\n}\n\nQString QSystemNetworkInfoPrivate::homeMobileNetworkCode()\n{\n return QString();\n}\n\nQString QSystemNetworkInfoPrivate::networkName(QSystemNetworkInfo::NetworkMode mode)\n{\n QString netname = \"\";\n\n switch(mode) {\n\n case QSystemNetworkInfo::CdmaMode:\n case QSystemNetworkInfo::GsmMode:\n case QSystemNetworkInfo::WcdmaMode:\n case QSystemNetworkInfo::WimaxMode:\n break;\n break;\n default:\n return QSystemNetworkInfoLinuxCommonPrivate::networkName(mode);\n break;\n };\n return netname;\n}\n\nQString QSystemNetworkInfoPrivate::macAddress(QSystemNetworkInfo::NetworkMode mode)\n{\n switch(mode) {\n\n case QSystemNetworkInfo::CdmaMode:\n case QSystemNetworkInfo::GsmMode:\n case QSystemNetworkInfo::WcdmaMode:\n case QSystemNetworkInfo::WimaxMode:\n break;\n default:\n return QSystemNetworkInfoLinuxCommonPrivate::networkName(mode);\n break;\n };\n return QString();\n}\n\nQNetworkInterface QSystemNetworkInfoPrivate::interfaceForMode(QSystemNetworkInfo::NetworkMode mode)\n{\n#if !defined(QT_NO_DBUS)\n switch(mode) {\n case QSystemNetworkInfo::CdmaMode:\n case QSystemNetworkInfo::GsmMode:\n case QSystemNetworkInfo::WcdmaMode:\n case QSystemNetworkInfo::WimaxMode:\n break;\n default:\n return QSystemNetworkInfoLinuxCommonPrivate::interfaceForMode(mode);\n break;\n };\n#endif\n return QNetworkInterface();\n}\n\nQSystemDisplayInfoPrivate::QSystemDisplayInfoPrivate(QSystemDisplayInfoLinuxCommonPrivate *parent)\n : QSystemDisplayInfoLinuxCommonPrivate(parent)\n{\n}\n\nQSystemDisplayInfoPrivate::~QSystemDisplayInfoPrivate()\n{\n}\n\nint QSystemDisplayInfoPrivate::displayBrightness(int screen)\n{\n Q_UNUSED(screen);\n GConfItem currentBrightness(\"\/system\/osso\/dsm\/display\/display_brightness\");\n GConfItem maxBrightness(\"\/system\/osso\/dsm\/display\/max_display_brightness_levels\");\n if(maxBrightness.value().toInt()) {\n float retVal = 100 * (currentBrightness.value().toFloat() \/\n maxBrightness.value().toFloat());\n return retVal;\n }\n\n return -1;\n}\n\n\nQSystemDeviceInfoPrivate::QSystemDeviceInfoPrivate(QSystemDeviceInfoLinuxCommonPrivate *parent)\n : QSystemDeviceInfoLinuxCommonPrivate(parent)\n{\n}\n\nQSystemDeviceInfoPrivate::~QSystemDeviceInfoPrivate()\n{\n}\n\nQSystemDeviceInfo::Profile QSystemDeviceInfoPrivate::currentProfile()\n{\n return QSystemDeviceInfo::UnknownProfile;\n}\n\nQString QSystemDeviceInfoPrivate::imei()\n{\n #if !defined(QT_NO_DBUS)\n QDBusInterface connectionInterface(\"com.nokia.phone.SIM\",\n \"\/com\/nokia\/csd\/info\",\n \"com.nokia.csd.Info\",\n QDBusConnection::systemBus());\n if(!connectionInterface.isValid()) {\n qWarning() << \"interfacenot valid\";\n }\n\n QDBusReply< QString > reply = connectionInterface.call(\"GetIMEINumber\");\n return reply.value();\n\n#endif\n return \"Not Available\";\n}\n\nQString QSystemDeviceInfoPrivate::imsi()\n{\n QString retVal = \"Not Available\";\n GConfItem locationValues(\"\/system\/nokia\/location\");\n QStringList locationKeys = locationValues.listEntries();\n\n QStringList result;\n foreach (QString str, locationKeys) {\n if (str.contains(\"sim_imsi\"))\n retVal = \"Available\";\n break;\n }\n return retVal;\n}\n\nQSystemDeviceInfo::SimStatus QSystemDeviceInfoPrivate::simStatus()\n{\n GConfItem locationValues(\"\/system\/nokia\/location\");\n QStringList locationKeys = locationValues.listEntries();\n QStringList result;\n int count = 0;\n foreach (QString str, locationKeys) {\n if (str.contains(\"sim_imsi\"))\n count++;\n }\n\n if(count == 1) {\n return QSystemDeviceInfo::SingleSimAvailable;\n } else if (count == 2) {\n return QSystemDeviceInfo::DualSimAvailable;\n }\n return QSystemDeviceInfo::SimNotAvailable;\n}\n\nbool QSystemDeviceInfoPrivate::isDeviceLocked()\n{\n QSystemScreenSaverPrivate priv;\n\n if(priv.isScreenLockEnabled()\n && priv.isScreenSaverActive()) {\n return true;\n }\n\n return false;\n}\n\n QSystemScreenSaverPrivate::QSystemScreenSaverPrivate(QSystemScreenSaverLinuxCommonPrivate *parent)\n : QSystemScreenSaverLinuxCommonPrivate(parent)\n {\n }\n\n QSystemScreenSaverPrivate::~QSystemScreenSaverPrivate()\n {\n }\n\n bool QSystemScreenSaverPrivate::setScreenSaverInhibit()\n {\n return false;\n}\n\n\nbool QSystemScreenSaverPrivate::screenSaverInhibited()\n{\n\n return false;\n}\n\nbool QSystemScreenSaverPrivate::isScreenLockEnabled()\n{\n return false;\n}\n\nbool QSystemScreenSaverPrivate::isScreenSaverActive()\n{\n return false;\n}\n\n#include \"moc_qsysteminfo_maemo_p.cpp\"\n\nQTM_END_NAMESPACE\n<|endoftext|>"} {"text":"<commit_before>\/*\n * Copyright (C) 2018 The Android Open Source Project\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n *\/\n\n#include \"src\/traced\/probes\/probes_producer.h\"\n\n#include <stdio.h>\n#include <sys\/stat.h>\n#include <queue>\n#include <string>\n\n#include \"perfetto\/base\/logging.h\"\n#include \"perfetto\/base\/weak_ptr.h\"\n#include \"perfetto\/traced\/traced.h\"\n#include \"perfetto\/tracing\/core\/data_source_config.h\"\n#include \"perfetto\/tracing\/core\/data_source_descriptor.h\"\n#include \"perfetto\/tracing\/core\/ftrace_config.h\"\n#include \"perfetto\/tracing\/core\/trace_config.h\"\n#include \"perfetto\/tracing\/core\/trace_packet.h\"\n#include \"src\/traced\/probes\/filesystem\/inode_file_data_source.h\"\n\n#include \"perfetto\/trace\/filesystem\/inode_file_map.pbzero.h\"\n#include \"perfetto\/trace\/ftrace\/ftrace_event_bundle.pbzero.h\"\n#include \"perfetto\/trace\/trace_packet.pbzero.h\"\n\nnamespace perfetto {\nnamespace {\n\nuint64_t kInitialConnectionBackoffMs = 100;\nuint64_t kMaxConnectionBackoffMs = 30 * 1000;\nconstexpr char kFtraceSourceName[] = \"linux.ftrace\";\nconstexpr char kProcessStatsSourceName[] = \"linux.process_stats\";\nconstexpr char kInodeMapSourceName[] = \"linux.inode_file_map\";\n\n} \/\/ namespace.\n\n\/\/ State transition diagram:\n\/\/ +----------------------------+\n\/\/ v +\n\/\/ NotStarted -> NotConnected -> Connecting -> Connected\n\/\/ ^ +\n\/\/ +--------------+\n\/\/\n\nProbesProducer::ProbesProducer() {}\nProbesProducer::~ProbesProducer() = default;\n\nvoid ProbesProducer::OnConnect() {\n PERFETTO_DCHECK(state_ == kConnecting);\n state_ = kConnected;\n ResetConnectionBackoff();\n PERFETTO_LOG(\"Connected to the service\");\n\n DataSourceDescriptor ftrace_descriptor;\n ftrace_descriptor.set_name(kFtraceSourceName);\n endpoint_->RegisterDataSource(ftrace_descriptor);\n\n DataSourceDescriptor process_stats_descriptor;\n process_stats_descriptor.set_name(kProcessStatsSourceName);\n endpoint_->RegisterDataSource(process_stats_descriptor);\n\n DataSourceDescriptor inode_map_descriptor;\n inode_map_descriptor.set_name(kInodeMapSourceName);\n endpoint_->RegisterDataSource(inode_map_descriptor);\n}\n\nvoid ProbesProducer::OnDisconnect() {\n PERFETTO_DCHECK(state_ == kConnected || state_ == kConnecting);\n state_ = kNotConnected;\n PERFETTO_LOG(\"Disconnected from tracing service\");\n IncreaseConnectionBackoff();\n\n \/\/ TODO(hjd): Erase all sinks and add e2e test for this.\n task_runner_->PostDelayedTask([this] { this->Connect(); },\n connection_backoff_ms_);\n}\n\nvoid ProbesProducer::CreateDataSourceInstance(DataSourceInstanceID instance_id,\n const DataSourceConfig& config) {\n \/\/ TODO(hjd): This a hack since we don't actually know the session id. For\n \/\/ now we'll assume anything wit hthe same target buffer is in the same\n \/\/ session.\n TracingSessionID session_id = config.target_buffer();\n\n if (config.name() == kFtraceSourceName) {\n if (!CreateFtraceDataSourceInstance(session_id, instance_id, config))\n failed_sources_.insert(instance_id);\n } else if (config.name() == kInodeMapSourceName) {\n CreateInodeFileDataSourceInstance(session_id, instance_id, config);\n } else if (config.name() == kProcessStatsSourceName) {\n CreateProcessStatsDataSourceInstance(session_id, instance_id, config);\n } else {\n PERFETTO_ELOG(\"Data source name: %s not recognised.\",\n config.name().c_str());\n return;\n }\n\n std::map<TracingSessionID, InodeFileDataSource*> file_sources;\n std::map<TracingSessionID, ProcessStatsDataSource*> ps_sources;\n for (const auto& pair : file_map_sources_)\n file_sources[pair.second->session_id()] = pair.second.get();\n for (const auto& pair : process_stats_sources_)\n ps_sources[pair.second->session_id()] = pair.second.get();\n\n for (const auto& id_to_source : delegates_) {\n const std::unique_ptr<SinkDelegate>& source = id_to_source.second;\n if (session_id != source->session_id())\n continue;\n if (!source->ps_source() && ps_sources.count(session_id))\n source->set_ps_source(ps_sources[session_id]->GetWeakPtr());\n if (!source->file_source() && file_sources.count(session_id))\n source->set_file_source(file_sources[session_id]->GetWeakPtr());\n }\n}\n\nvoid ProbesProducer::AddWatchdogsTimer(DataSourceInstanceID id,\n const DataSourceConfig& config) {\n if (config.trace_duration_ms() != 0)\n watchdogs_.emplace(id, base::Watchdog::GetInstance()->CreateFatalTimer(\n 5000 + 2 * config.trace_duration_ms()));\n}\n\nbool ProbesProducer::CreateFtraceDataSourceInstance(\n TracingSessionID session_id,\n DataSourceInstanceID id,\n const DataSourceConfig& config) {\n \/\/ Don't retry if FtraceController::Create() failed once.\n \/\/ This can legitimately happen on user builds where we cannot access the\n \/\/ debug paths, e.g., because of SELinux rules.\n if (ftrace_creation_failed_)\n return false;\n\n \/\/ Lazily create on the first instance.\n if (!ftrace_) {\n ftrace_ = FtraceController::Create(task_runner_);\n\n if (!ftrace_) {\n PERFETTO_ELOG(\"Failed to create FtraceController\");\n ftrace_creation_failed_ = true;\n return false;\n }\n\n ftrace_->DisableAllEvents();\n ftrace_->ClearTrace();\n }\n\n PERFETTO_LOG(\"Ftrace start (id=%\" PRIu64 \", target_buf=%\" PRIu32 \")\", id,\n config.target_buffer());\n\n FtraceConfig proto_config = config.ftrace_config();\n\n \/\/ TODO(hjd): Static cast is bad, target_buffer() should return a BufferID.\n auto trace_writer = endpoint_->CreateTraceWriter(\n static_cast<BufferID>(config.target_buffer()));\n auto delegate = std::unique_ptr<SinkDelegate>(\n new SinkDelegate(session_id, task_runner_, std::move(trace_writer)));\n auto sink = ftrace_->CreateSink(std::move(proto_config), delegate.get());\n if (!sink) {\n PERFETTO_ELOG(\"Failed to start tracing (maybe someone else is using it?)\");\n return false;\n }\n delegate->set_sink(std::move(sink));\n delegates_.emplace(id, std::move(delegate));\n AddWatchdogsTimer(id, config);\n return true;\n}\n\nvoid ProbesProducer::CreateInodeFileDataSourceInstance(\n TracingSessionID session_id,\n DataSourceInstanceID id,\n DataSourceConfig source_config) {\n PERFETTO_LOG(\"Inode file map start (id=%\" PRIu64 \", target_buf=%\" PRIu32 \")\",\n id, source_config.target_buffer());\n auto trace_writer = endpoint_->CreateTraceWriter(\n static_cast<BufferID>(source_config.target_buffer()));\n if (system_inodes_.empty())\n CreateStaticDeviceToInodeMap(\"\/system\", &system_inodes_);\n auto file_map_source =\n std::unique_ptr<InodeFileDataSource>(new InodeFileDataSource(\n std::move(source_config), task_runner_, session_id, &system_inodes_,\n &cache_, std::move(trace_writer)));\n file_map_sources_.emplace(id, std::move(file_map_source));\n AddWatchdogsTimer(id, source_config);\n}\n\nvoid ProbesProducer::CreateProcessStatsDataSourceInstance(\n TracingSessionID session_id,\n DataSourceInstanceID id,\n const DataSourceConfig& config) {\n PERFETTO_DCHECK(process_stats_sources_.count(id) == 0);\n auto trace_writer = endpoint_->CreateTraceWriter(\n static_cast<BufferID>(config.target_buffer()));\n auto source = std::unique_ptr<ProcessStatsDataSource>(\n new ProcessStatsDataSource(session_id, std::move(trace_writer)));\n auto it_and_inserted = process_stats_sources_.emplace(id, std::move(source));\n PERFETTO_DCHECK(it_and_inserted.second);\n if (std::find(config.process_stats_config().quirks().begin(),\n config.process_stats_config().quirks().end(),\n ProcessStatsConfig::DISABLE_INITIAL_DUMP) !=\n config.process_stats_config().quirks().end()) {\n PERFETTO_DLOG(\"Initial process tree dump is disabled.\");\n return;\n }\n it_and_inserted.first->second->WriteAllProcesses();\n}\n\nvoid ProbesProducer::TearDownDataSourceInstance(DataSourceInstanceID id) {\n PERFETTO_LOG(\"Producer stop (id=%\" PRIu64 \")\", id);\n \/\/ |id| could be the id of any of the datasources we handle:\n PERFETTO_DCHECK((failed_sources_.count(id) + delegates_.count(id) +\n process_stats_sources_.count(id) +\n file_map_sources_.count(id)) == 1);\n failed_sources_.erase(id);\n delegates_.erase(id);\n process_stats_sources_.erase(id);\n file_map_sources_.erase(id);\n watchdogs_.erase(id);\n}\n\nvoid ProbesProducer::OnTracingStart() {}\nvoid ProbesProducer::OnTracingStop() {}\n\nvoid ProbesProducer::ConnectWithRetries(const char* socket_name,\n base::TaskRunner* task_runner) {\n PERFETTO_DCHECK(state_ == kNotStarted);\n state_ = kNotConnected;\n\n ResetConnectionBackoff();\n socket_name_ = socket_name;\n task_runner_ = task_runner;\n Connect();\n}\n\nvoid ProbesProducer::Connect() {\n PERFETTO_DCHECK(state_ == kNotConnected);\n state_ = kConnecting;\n endpoint_ = ProducerIPCClient::Connect(\n socket_name_, this, \"perfetto.traced_probes\", task_runner_);\n}\n\nvoid ProbesProducer::IncreaseConnectionBackoff() {\n connection_backoff_ms_ *= 2;\n if (connection_backoff_ms_ > kMaxConnectionBackoffMs)\n connection_backoff_ms_ = kMaxConnectionBackoffMs;\n}\n\nvoid ProbesProducer::ResetConnectionBackoff() {\n connection_backoff_ms_ = kInitialConnectionBackoffMs;\n}\n\nProbesProducer::SinkDelegate::SinkDelegate(TracingSessionID id,\n base::TaskRunner* task_runner,\n std::unique_ptr<TraceWriter> writer)\n : session_id_(id),\n task_runner_(task_runner),\n writer_(std::move(writer)),\n weak_factory_(this) {}\n\nProbesProducer::SinkDelegate::~SinkDelegate() = default;\n\nProbesProducer::FtraceBundleHandle\nProbesProducer::SinkDelegate::GetBundleForCpu(size_t) {\n trace_packet_ = writer_->NewTracePacket();\n return FtraceBundleHandle(trace_packet_->set_ftrace_events());\n}\n\nvoid ProbesProducer::SinkDelegate::OnBundleComplete(\n size_t,\n FtraceBundleHandle,\n const FtraceMetadata& metadata) {\n trace_packet_->Finalize();\n\n if (ps_source_ && !metadata.pids.empty()) {\n const auto& pids = metadata.pids;\n auto weak_ps_source = ps_source_;\n task_runner_->PostTask([weak_ps_source, pids] {\n if (weak_ps_source)\n weak_ps_source->OnPids(pids);\n });\n }\n\n if (file_source_ && !metadata.inode_and_device.empty()) {\n auto inodes = metadata.inode_and_device;\n auto weak_file_source = file_source_;\n task_runner_->PostTask([weak_file_source, inodes] {\n if (weak_file_source)\n weak_file_source->OnInodes(inodes);\n });\n }\n}\n\n} \/\/ namespace perfetto\n<commit_msg>Fix GCC build (again)<commit_after>\/*\n * Copyright (C) 2018 The Android Open Source Project\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n *\/\n\n#include \"src\/traced\/probes\/probes_producer.h\"\n\n#include <stdio.h>\n#include <sys\/stat.h>\n\n#include <algorithm>\n#include <queue>\n#include <string>\n\n#include \"perfetto\/base\/logging.h\"\n#include \"perfetto\/base\/weak_ptr.h\"\n#include \"perfetto\/traced\/traced.h\"\n#include \"perfetto\/tracing\/core\/data_source_config.h\"\n#include \"perfetto\/tracing\/core\/data_source_descriptor.h\"\n#include \"perfetto\/tracing\/core\/ftrace_config.h\"\n#include \"perfetto\/tracing\/core\/trace_config.h\"\n#include \"perfetto\/tracing\/core\/trace_packet.h\"\n#include \"src\/traced\/probes\/filesystem\/inode_file_data_source.h\"\n\n#include \"perfetto\/trace\/filesystem\/inode_file_map.pbzero.h\"\n#include \"perfetto\/trace\/ftrace\/ftrace_event_bundle.pbzero.h\"\n#include \"perfetto\/trace\/trace_packet.pbzero.h\"\n\nnamespace perfetto {\nnamespace {\n\nuint64_t kInitialConnectionBackoffMs = 100;\nuint64_t kMaxConnectionBackoffMs = 30 * 1000;\nconstexpr char kFtraceSourceName[] = \"linux.ftrace\";\nconstexpr char kProcessStatsSourceName[] = \"linux.process_stats\";\nconstexpr char kInodeMapSourceName[] = \"linux.inode_file_map\";\n\n} \/\/ namespace.\n\n\/\/ State transition diagram:\n\/\/ +----------------------------+\n\/\/ v +\n\/\/ NotStarted -> NotConnected -> Connecting -> Connected\n\/\/ ^ +\n\/\/ +--------------+\n\/\/\n\nProbesProducer::ProbesProducer() {}\nProbesProducer::~ProbesProducer() = default;\n\nvoid ProbesProducer::OnConnect() {\n PERFETTO_DCHECK(state_ == kConnecting);\n state_ = kConnected;\n ResetConnectionBackoff();\n PERFETTO_LOG(\"Connected to the service\");\n\n DataSourceDescriptor ftrace_descriptor;\n ftrace_descriptor.set_name(kFtraceSourceName);\n endpoint_->RegisterDataSource(ftrace_descriptor);\n\n DataSourceDescriptor process_stats_descriptor;\n process_stats_descriptor.set_name(kProcessStatsSourceName);\n endpoint_->RegisterDataSource(process_stats_descriptor);\n\n DataSourceDescriptor inode_map_descriptor;\n inode_map_descriptor.set_name(kInodeMapSourceName);\n endpoint_->RegisterDataSource(inode_map_descriptor);\n}\n\nvoid ProbesProducer::OnDisconnect() {\n PERFETTO_DCHECK(state_ == kConnected || state_ == kConnecting);\n state_ = kNotConnected;\n PERFETTO_LOG(\"Disconnected from tracing service\");\n IncreaseConnectionBackoff();\n\n \/\/ TODO(hjd): Erase all sinks and add e2e test for this.\n task_runner_->PostDelayedTask([this] { this->Connect(); },\n connection_backoff_ms_);\n}\n\nvoid ProbesProducer::CreateDataSourceInstance(DataSourceInstanceID instance_id,\n const DataSourceConfig& config) {\n \/\/ TODO(hjd): This a hack since we don't actually know the session id. For\n \/\/ now we'll assume anything wit hthe same target buffer is in the same\n \/\/ session.\n TracingSessionID session_id = config.target_buffer();\n\n if (config.name() == kFtraceSourceName) {\n if (!CreateFtraceDataSourceInstance(session_id, instance_id, config))\n failed_sources_.insert(instance_id);\n } else if (config.name() == kInodeMapSourceName) {\n CreateInodeFileDataSourceInstance(session_id, instance_id, config);\n } else if (config.name() == kProcessStatsSourceName) {\n CreateProcessStatsDataSourceInstance(session_id, instance_id, config);\n } else {\n PERFETTO_ELOG(\"Data source name: %s not recognised.\",\n config.name().c_str());\n return;\n }\n\n std::map<TracingSessionID, InodeFileDataSource*> file_sources;\n std::map<TracingSessionID, ProcessStatsDataSource*> ps_sources;\n for (const auto& pair : file_map_sources_)\n file_sources[pair.second->session_id()] = pair.second.get();\n for (const auto& pair : process_stats_sources_)\n ps_sources[pair.second->session_id()] = pair.second.get();\n\n for (const auto& id_to_source : delegates_) {\n const std::unique_ptr<SinkDelegate>& source = id_to_source.second;\n if (session_id != source->session_id())\n continue;\n if (!source->ps_source() && ps_sources.count(session_id))\n source->set_ps_source(ps_sources[session_id]->GetWeakPtr());\n if (!source->file_source() && file_sources.count(session_id))\n source->set_file_source(file_sources[session_id]->GetWeakPtr());\n }\n}\n\nvoid ProbesProducer::AddWatchdogsTimer(DataSourceInstanceID id,\n const DataSourceConfig& config) {\n if (config.trace_duration_ms() != 0)\n watchdogs_.emplace(id, base::Watchdog::GetInstance()->CreateFatalTimer(\n 5000 + 2 * config.trace_duration_ms()));\n}\n\nbool ProbesProducer::CreateFtraceDataSourceInstance(\n TracingSessionID session_id,\n DataSourceInstanceID id,\n const DataSourceConfig& config) {\n \/\/ Don't retry if FtraceController::Create() failed once.\n \/\/ This can legitimately happen on user builds where we cannot access the\n \/\/ debug paths, e.g., because of SELinux rules.\n if (ftrace_creation_failed_)\n return false;\n\n \/\/ Lazily create on the first instance.\n if (!ftrace_) {\n ftrace_ = FtraceController::Create(task_runner_);\n\n if (!ftrace_) {\n PERFETTO_ELOG(\"Failed to create FtraceController\");\n ftrace_creation_failed_ = true;\n return false;\n }\n\n ftrace_->DisableAllEvents();\n ftrace_->ClearTrace();\n }\n\n PERFETTO_LOG(\"Ftrace start (id=%\" PRIu64 \", target_buf=%\" PRIu32 \")\", id,\n config.target_buffer());\n\n FtraceConfig proto_config = config.ftrace_config();\n\n \/\/ TODO(hjd): Static cast is bad, target_buffer() should return a BufferID.\n auto trace_writer = endpoint_->CreateTraceWriter(\n static_cast<BufferID>(config.target_buffer()));\n auto delegate = std::unique_ptr<SinkDelegate>(\n new SinkDelegate(session_id, task_runner_, std::move(trace_writer)));\n auto sink = ftrace_->CreateSink(std::move(proto_config), delegate.get());\n if (!sink) {\n PERFETTO_ELOG(\"Failed to start tracing (maybe someone else is using it?)\");\n return false;\n }\n delegate->set_sink(std::move(sink));\n delegates_.emplace(id, std::move(delegate));\n AddWatchdogsTimer(id, config);\n return true;\n}\n\nvoid ProbesProducer::CreateInodeFileDataSourceInstance(\n TracingSessionID session_id,\n DataSourceInstanceID id,\n DataSourceConfig source_config) {\n PERFETTO_LOG(\"Inode file map start (id=%\" PRIu64 \", target_buf=%\" PRIu32 \")\",\n id, source_config.target_buffer());\n auto trace_writer = endpoint_->CreateTraceWriter(\n static_cast<BufferID>(source_config.target_buffer()));\n if (system_inodes_.empty())\n CreateStaticDeviceToInodeMap(\"\/system\", &system_inodes_);\n auto file_map_source =\n std::unique_ptr<InodeFileDataSource>(new InodeFileDataSource(\n std::move(source_config), task_runner_, session_id, &system_inodes_,\n &cache_, std::move(trace_writer)));\n file_map_sources_.emplace(id, std::move(file_map_source));\n AddWatchdogsTimer(id, source_config);\n}\n\nvoid ProbesProducer::CreateProcessStatsDataSourceInstance(\n TracingSessionID session_id,\n DataSourceInstanceID id,\n const DataSourceConfig& config) {\n PERFETTO_DCHECK(process_stats_sources_.count(id) == 0);\n auto trace_writer = endpoint_->CreateTraceWriter(\n static_cast<BufferID>(config.target_buffer()));\n auto source = std::unique_ptr<ProcessStatsDataSource>(\n new ProcessStatsDataSource(session_id, std::move(trace_writer)));\n auto it_and_inserted = process_stats_sources_.emplace(id, std::move(source));\n PERFETTO_DCHECK(it_and_inserted.second);\n if (std::find(config.process_stats_config().quirks().begin(),\n config.process_stats_config().quirks().end(),\n ProcessStatsConfig::DISABLE_INITIAL_DUMP) !=\n config.process_stats_config().quirks().end()) {\n PERFETTO_DLOG(\"Initial process tree dump is disabled.\");\n return;\n }\n it_and_inserted.first->second->WriteAllProcesses();\n}\n\nvoid ProbesProducer::TearDownDataSourceInstance(DataSourceInstanceID id) {\n PERFETTO_LOG(\"Producer stop (id=%\" PRIu64 \")\", id);\n \/\/ |id| could be the id of any of the datasources we handle:\n PERFETTO_DCHECK((failed_sources_.count(id) + delegates_.count(id) +\n process_stats_sources_.count(id) +\n file_map_sources_.count(id)) == 1);\n failed_sources_.erase(id);\n delegates_.erase(id);\n process_stats_sources_.erase(id);\n file_map_sources_.erase(id);\n watchdogs_.erase(id);\n}\n\nvoid ProbesProducer::OnTracingStart() {}\nvoid ProbesProducer::OnTracingStop() {}\n\nvoid ProbesProducer::ConnectWithRetries(const char* socket_name,\n base::TaskRunner* task_runner) {\n PERFETTO_DCHECK(state_ == kNotStarted);\n state_ = kNotConnected;\n\n ResetConnectionBackoff();\n socket_name_ = socket_name;\n task_runner_ = task_runner;\n Connect();\n}\n\nvoid ProbesProducer::Connect() {\n PERFETTO_DCHECK(state_ == kNotConnected);\n state_ = kConnecting;\n endpoint_ = ProducerIPCClient::Connect(\n socket_name_, this, \"perfetto.traced_probes\", task_runner_);\n}\n\nvoid ProbesProducer::IncreaseConnectionBackoff() {\n connection_backoff_ms_ *= 2;\n if (connection_backoff_ms_ > kMaxConnectionBackoffMs)\n connection_backoff_ms_ = kMaxConnectionBackoffMs;\n}\n\nvoid ProbesProducer::ResetConnectionBackoff() {\n connection_backoff_ms_ = kInitialConnectionBackoffMs;\n}\n\nProbesProducer::SinkDelegate::SinkDelegate(TracingSessionID id,\n base::TaskRunner* task_runner,\n std::unique_ptr<TraceWriter> writer)\n : session_id_(id),\n task_runner_(task_runner),\n writer_(std::move(writer)),\n weak_factory_(this) {}\n\nProbesProducer::SinkDelegate::~SinkDelegate() = default;\n\nProbesProducer::FtraceBundleHandle\nProbesProducer::SinkDelegate::GetBundleForCpu(size_t) {\n trace_packet_ = writer_->NewTracePacket();\n return FtraceBundleHandle(trace_packet_->set_ftrace_events());\n}\n\nvoid ProbesProducer::SinkDelegate::OnBundleComplete(\n size_t,\n FtraceBundleHandle,\n const FtraceMetadata& metadata) {\n trace_packet_->Finalize();\n\n if (ps_source_ && !metadata.pids.empty()) {\n const auto& pids = metadata.pids;\n auto weak_ps_source = ps_source_;\n task_runner_->PostTask([weak_ps_source, pids] {\n if (weak_ps_source)\n weak_ps_source->OnPids(pids);\n });\n }\n\n if (file_source_ && !metadata.inode_and_device.empty()) {\n auto inodes = metadata.inode_and_device;\n auto weak_file_source = file_source_;\n task_runner_->PostTask([weak_file_source, inodes] {\n if (weak_file_source)\n weak_file_source->OnInodes(inodes);\n });\n }\n}\n\n} \/\/ namespace perfetto\n<|endoftext|>"} {"text":"<commit_before>\/**\n * Copyright (c) 2015 - The CM Authors <legal@clickmatcher.com>\n * All Rights Reserved.\n *\n * This file is CONFIDENTIAL -- Distribution or duplication of this material or\n * the information contained herein is strictly forbidden unless prior written\n * permission is obtained.\n *\/\n#include \"stx\/wallclock.h\"\n#include \"stx\/assets.h\"\n#include <stx\/fnv.h>\n#include \"stx\/protobuf\/msg.h\"\n#include \"stx\/io\/BufferedOutputStream.h\"\n#include \"zbase\/api\/MapReduceAPIServlet.h\"\n#include \"zbase\/mapreduce\/MapReduceTask.h\"\n#include \"sstable\/sstablereader.h\"\n\nusing namespace stx;\n\nnamespace zbase {\n\nMapReduceAPIServlet::MapReduceAPIServlet(\n MapReduceService* service,\n ConfigDirectory* cdir,\n const String& cachedir) :\n service_(service),\n cdir_(cdir),\n cachedir_(cachedir) {}\n\nstatic const String kResultPathPrefix = \"\/api\/v1\/mapreduce\/result\/\";\n\nvoid MapReduceAPIServlet::handle(\n const AnalyticsSession& session,\n RefPtr<stx::http::HTTPRequestStream> req_stream,\n RefPtr<stx::http::HTTPResponseStream> res_stream) {\n const auto& req = req_stream->request();\n URI uri(req.uri());\n\n http::HTTPResponse res;\n res.populateFromRequest(req);\n\n if (uri.path() == \"\/api\/v1\/mapreduce\/execute\") {\n executeMapReduceScript(session, uri, req_stream.get(), res_stream.get());\n return;\n }\n\n if (StringUtil::beginsWith(uri.path(), kResultPathPrefix)) {\n fetchResult(\n session,\n uri.path().substr(kResultPathPrefix.size()),\n req_stream.get(),\n res_stream.get());\n return;\n }\n\n if (uri.path() == \"\/api\/v1\/mapreduce\/tasks\/map_partition\") {\n executeMapPartitionTask(session, uri, req_stream.get(), res_stream.get());\n return;\n }\n\n if (uri.path() == \"\/api\/v1\/mapreduce\/tasks\/reduce\") {\n executeReduceTask(session, uri, req_stream.get(), res_stream.get());\n return;\n }\n\n if (uri.path() == \"\/api\/v1\/mapreduce\/tasks\/save_to_table\") {\n req_stream->readBody();\n catchAndReturnErrors(&res, [this, &session, &uri, &req, &res] {\n executeSaveToTableTask(session, uri, &req, &res);\n });\n res_stream->writeResponse(res);\n return;\n }\n\n if (uri.path() == \"\/api\/v1\/mapreduce\/tasks\/save_to_table_partition\") {\n req_stream->readBody();\n catchAndReturnErrors(&res, [this, &session, &uri, &req, &res] {\n executeSaveToTablePartitionTask(session, uri, &req, &res);\n });\n res_stream->writeResponse(res);\n return;\n }\n\n res.setStatus(http::kStatusNotFound);\n res.addHeader(\"Content-Type\", \"text\/html; charset=utf-8\");\n res.addBody(Assets::getAsset(\"zbase\/webui\/404.html\"));\n res_stream->writeResponse(res);\n}\n\nvoid MapReduceAPIServlet::executeMapPartitionTask(\n const AnalyticsSession& session,\n const URI& uri,\n http::HTTPRequestStream* req_stream,\n http::HTTPResponseStream* res_stream) {\n req_stream->readBody();\n\n URI::ParamList params;\n URI::parseQueryString(req_stream->request().body().toString(), ¶ms);\n\n String table_name;\n if (!URI::getParam(params, \"table\", &table_name)) {\n http::HTTPResponse res;\n res.populateFromRequest(req_stream->request());\n res.setStatus(http::kStatusBadRequest);\n res.addBody(\"missing ?table=... parameter\");\n res_stream->writeResponse(res);\n return;\n }\n\n String partition_key;\n if (!URI::getParam(params, \"partition\", &partition_key)) {\n http::HTTPResponse res;\n res.populateFromRequest(req_stream->request());\n res.setStatus(http::kStatusBadRequest);\n res.addBody(\"missing ?partition=... parameter\");\n res_stream->writeResponse(res);\n return;\n }\n\n String map_fn;\n if (!URI::getParam(params, \"map_function\", &map_fn)) {\n http::HTTPResponse res;\n res.populateFromRequest(req_stream->request());\n res.setStatus(http::kStatusBadRequest);\n res.addBody(\"missing ?map_function=... parameter\");\n res_stream->writeResponse(res);\n return;\n }\n\n auto sse_stream = mkRef(new http::HTTPSSEStream(req_stream, res_stream));\n sse_stream->start();\n\n auto job_spec = mkRef(new MapReduceJobSpec{});\n job_spec->onLogline([sse_stream] (const String& logline) {\n if (sse_stream->isClosed()) {\n return;\n }\n\n sse_stream->sendEvent(URI::urlEncode(logline), Some(String(\"log\")));\n });\n\n try {\n String js_globals = \"{}\";\n URI::getParam(params, \"globals\", &js_globals);\n\n String js_params = \"{}\";\n URI::getParam(params, \"params\", &js_params);\n\n auto shard_id = service_->mapPartition(\n session,\n job_spec,\n table_name,\n SHA1Hash::fromHexString(partition_key),\n map_fn,\n js_globals,\n js_params);\n\n String resid;\n if (!shard_id.isEmpty()) {\n resid = shard_id.get().toString();\n }\n\n sse_stream->sendEvent(resid, Some(String(\"result_id\")));\n } catch (const Exception& e) {\n sse_stream->sendEvent(e.what(), Some(String(\"error\")));\n }\n\n sse_stream->finish();\n}\n\nvoid MapReduceAPIServlet::executeReduceTask(\n const AnalyticsSession& session,\n const URI& uri,\n http::HTTPRequestStream* req_stream,\n http::HTTPResponseStream* res_stream) {\n req_stream->readBody();\n\n URI::ParamList params;\n URI::parseQueryString(req_stream->request().body().toString(), ¶ms);\n\n Vector<String> input_tables;\n for (const auto& p : params) {\n if (p.first == \"input_table\") {\n input_tables.emplace_back(p.second);\n }\n }\n\n String reduce_fn;\n if (!URI::getParam(params, \"reduce_fn\", &reduce_fn)) {\n http::HTTPResponse res;\n res.populateFromRequest(req_stream->request());\n res.setStatus(http::kStatusBadRequest);\n res.addBody(\"missing ?reduce_fn=... parameter\");\n res_stream->writeResponse(res);\n return;\n }\n\n String js_globals = \"{}\";\n URI::getParam(params, \"globals\", &js_globals);\n\n String js_params = \"{}\";\n URI::getParam(params, \"params\", &js_params);\n\n auto sse_stream = mkRef(new http::HTTPSSEStream(req_stream, res_stream));\n sse_stream->start();\n\n auto job_spec = mkRef(new MapReduceJobSpec{});\n job_spec->onLogline([this, sse_stream] (const String& logline) {\n if (sse_stream->isClosed()) {\n return;\n }\n\n sse_stream->sendEvent(URI::urlEncode(logline), Some(String(\"log\")));\n });\n\n try {\n auto shard_id = service_->reduceTables(\n session,\n job_spec,\n input_tables,\n reduce_fn,\n js_globals,\n js_params);\n\n String resid;\n if (!shard_id.isEmpty()) {\n resid = shard_id.get().toString();\n }\n\n sse_stream->sendEvent(resid, Some(String(\"result_id\")));\n } catch (const Exception& e) {\n sse_stream->sendEvent(e.what(), Some(String(\"error\")));\n }\n\n sse_stream->finish();\n}\n\nvoid MapReduceAPIServlet::executeSaveToTableTask(\n const AnalyticsSession& session,\n const URI& uri,\n const http::HTTPRequest* req,\n http::HTTPResponse* res) {\n URI::ParamList params;\n URI::parseQueryString(req->body().toString(), ¶ms);\n\n String result_id;\n if (!URI::getParam(params, \"result_id\", &result_id)) {\n res->setStatus(http::kStatusBadRequest);\n res->addBody(\"missing ?result_id=... parameter\");\n return;\n }\n\n String table_name;\n if (!URI::getParam(params, \"table_name\", &table_name)) {\n res->setStatus(http::kStatusBadRequest);\n res->addBody(\"missing ?table_name=... parameter\");\n return;\n }\n\n String partition;\n if (!URI::getParam(params, \"partition\", &partition)) {\n res->setStatus(http::kStatusBadRequest);\n res->addBody(\"missing ?partition=... parameter\");\n return;\n }\n\n bool saved = service_->saveLocalResultToTable(\n session,\n table_name,\n SHA1Hash::fromHexString(partition),\n SHA1Hash::fromHexString(result_id));\n\n if (saved) {\n res->setStatus(http::kStatusCreated);\n } else {\n res->setStatus(http::kStatusNoContent);\n }\n}\n\nvoid MapReduceAPIServlet::executeSaveToTablePartitionTask(\n const AnalyticsSession& session,\n const URI& uri,\n const http::HTTPRequest* req,\n http::HTTPResponse* res) {\n URI::ParamList params;\n URI::parseQueryString(req->body().toString(), ¶ms);\n\n Vector<String> input_tables;\n for (const auto& p : params) {\n if (p.first == \"input_table\") {\n input_tables.emplace_back(p.second);\n }\n }\n\n String table_name;\n if (!URI::getParam(params, \"table_name\", &table_name)) {\n res->setStatus(http::kStatusBadRequest);\n res->addBody(\"missing ?table_name=... parameter\");\n return;\n }\n\n String partition;\n if (!URI::getParam(params, \"partition\", &partition)) {\n res->setStatus(http::kStatusBadRequest);\n res->addBody(\"missing ?partition=... parameter\");\n return;\n }\n\n bool saved = service_->saveRemoteResultsToTable(\n session,\n table_name,\n SHA1Hash::fromHexString(partition),\n input_tables);\n\n if (saved) {\n res->setStatus(http::kStatusCreated);\n } else {\n res->setStatus(http::kStatusNoContent);\n }\n}\n\n\nvoid MapReduceAPIServlet::executeMapReduceScript(\n const AnalyticsSession& session,\n const URI& uri,\n http::HTTPRequestStream* req_stream,\n http::HTTPResponseStream* res_stream) {\n req_stream->readBody();\n\n auto sse_stream = mkRef(new http::HTTPSSEStream(req_stream, res_stream));\n sse_stream->start();\n\n {\n Buffer buf;\n json::JSONOutputStream json(BufferOutputStream::fromBuffer(&buf));\n json.beginObject();\n json.endObject();\n\n sse_stream->sendEvent(buf, Some(String(\"job_started\")));\n }\n\n auto program_source = req_stream->request().body().toString();\n auto job_spec = mkRef(new MapReduceJobSpec{});\n\n job_spec->onProgress([this, sse_stream] (const MapReduceJobStatus& s) {\n if (sse_stream->isClosed()) {\n return;\n }\n\n Buffer buf;\n json::JSONOutputStream json(BufferOutputStream::fromBuffer(&buf));\n json.beginObject();\n json.addObjectEntry(\"status\");\n json.addString(\"running\");\n json.addComma();\n json.addObjectEntry(\"progress\");\n json.addFloat(s.num_tasks_total > 0\n ? s.num_tasks_completed \/ (double) s.num_tasks_total\n : 0);\n json.addComma();\n json.addObjectEntry(\"num_tasks_total\");\n json.addInteger(s.num_tasks_total);\n json.addComma();\n json.addObjectEntry(\"num_tasks_completed\");\n json.addInteger(s.num_tasks_completed);\n json.addComma();\n json.addObjectEntry(\"num_tasks_running\");\n json.addInteger(s.num_tasks_running);\n json.endObject();\n\n sse_stream->sendEvent(buf, Some(String(\"status\")));\n });\n\n job_spec->onResult([this, sse_stream] (const String& value) {\n if (sse_stream->isClosed()) {\n return;\n }\n\n sse_stream->sendEvent(URI::urlEncode(value), Some(String(\"result\")));\n });\n\n job_spec->onLogline([this, sse_stream] (const String& logline) {\n if (sse_stream->isClosed()) {\n return;\n }\n\n sse_stream->sendEvent(URI::urlEncode(logline), Some(String(\"log\")));\n });\n\n bool error = false;\n try {\n service_->executeScript(session, job_spec, program_source);\n } catch (const StandardException& e) {\n Buffer buf;\n json::JSONOutputStream json(BufferOutputStream::fromBuffer(&buf));\n json.beginObject();\n json.addObjectEntry(\"status\");\n json.addString(\"error\");\n json.addComma();\n json.addObjectEntry(\"error\");\n json.addString(e.what());\n json.endObject();\n\n sse_stream->sendEvent(buf, Some(String(\"status\")));\n sse_stream->sendEvent(URI::urlEncode(e.what()), Some(String(\"error\")));\n\n error = true;\n }\n\n if (!error) {\n Buffer buf;\n json::JSONOutputStream json(BufferOutputStream::fromBuffer(&buf));\n json.beginObject();\n json.addObjectEntry(\"status\");\n json.addString(\"success\");\n json.endObject();\n\n sse_stream->sendEvent(buf, Some(String(\"status\")));\n }\n\n {\n Buffer buf;\n json::JSONOutputStream json(BufferOutputStream::fromBuffer(&buf));\n json.beginObject();\n json.endObject();\n\n sse_stream->sendEvent(buf, Some(String(\"job_finished\")));\n }\n\n sse_stream->finish();\n}\n\nvoid MapReduceAPIServlet::fetchResult(\n const AnalyticsSession& session,\n const String& result_id,\n http::HTTPRequestStream* req_stream,\n http::HTTPResponseStream* res_stream) {\n http::HTTPResponse res;\n res.populateFromRequest(req_stream->request());\n req_stream->readBody();\n\n URI uri(req_stream->request().uri());\n const auto& params = uri.queryParams();\n\n auto filename = service_->getResultFilename(\n SHA1Hash::fromHexString(result_id));\n\n if (filename.isEmpty()) {\n res.setStatus(http::kStatusNotFound);\n res_stream->writeResponse(res);\n return;\n }\n\n size_t sample_mod = 0;\n size_t sample_idx = 0;\n String sample_str;\n if (URI::getParam(params, \"sample\", &sample_str)) {\n auto parts = StringUtil::split(sample_str, \":\");\n\n if (parts.size() != 2) {\n res.setStatus(stx::http::kStatusBadRequest);\n res.addBody(\"invalid ?sample=... parameter, format is <mod>:<idx>\");\n res_stream->writeResponse(res);\n return;\n }\n\n sample_mod = std::stoull(parts[0]);\n sample_idx = std::stoull(parts[1]);\n }\n\n res.setStatus(http::kStatusOK);\n res.addHeader(\"Content-Type\", \"application\/octet-stream\");\n res.addHeader(\"Connection\", \"close\");\n res_stream->startResponse(res);\n\n sstable::SSTableReader reader(filename.get());\n auto cursor = reader.getCursor();\n\n while (cursor->valid()) {\n void* key;\n size_t key_size;\n cursor->getKey((void**) &key, &key_size);\n\n FNV<uint64_t> fnv;\n if (sample_mod == 0 ||\n (fnv.hash(key, key_size) % sample_mod) == sample_idx) {\n void* data;\n size_t data_size;\n cursor->getData(&data, &data_size);\n\n util::BinaryMessageWriter buf;\n buf.appendUInt32(key_size);\n buf.appendUInt32(data_size);\n buf.append(key, key_size);\n buf.append(data, data_size);\n res_stream->writeBodyChunk(Buffer(buf.data(), buf.size()));\n res_stream->waitForReader();\n }\n\n if (!cursor->next()) {\n break;\n }\n }\n\n util::BinaryMessageWriter buf;\n buf.appendUInt32(0);\n buf.appendUInt32(0);\n res_stream->writeBodyChunk(Buffer(buf.data(), buf.size()));\n\n res_stream->finishResponse();\n}\n\n}\n<commit_msg>cleaning up<commit_after>\/**\n * Copyright (c) 2015 - The CM Authors <legal@clickmatcher.com>\n * All Rights Reserved.\n *\n * This file is CONFIDENTIAL -- Distribution or duplication of this material or\n * the information contained herein is strictly forbidden unless prior written\n * permission is obtained.\n *\/\n#include \"stx\/wallclock.h\"\n#include \"stx\/assets.h\"\n#include <stx\/fnv.h>\n#include \"stx\/protobuf\/msg.h\"\n#include \"stx\/io\/BufferedOutputStream.h\"\n#include \"zbase\/api\/MapReduceAPIServlet.h\"\n#include \"zbase\/mapreduce\/MapReduceTask.h\"\n#include \"sstable\/sstablereader.h\"\n\nusing namespace stx;\n\nnamespace zbase {\n\nMapReduceAPIServlet::MapReduceAPIServlet(\n MapReduceService* service,\n ConfigDirectory* cdir,\n const String& cachedir) :\n service_(service),\n cdir_(cdir),\n cachedir_(cachedir) {}\n\nstatic const String kResultPathPrefix = \"\/api\/v1\/mapreduce\/result\/\";\n\nvoid MapReduceAPIServlet::handle(\n const AnalyticsSession& session,\n RefPtr<stx::http::HTTPRequestStream> req_stream,\n RefPtr<stx::http::HTTPResponseStream> res_stream) {\n const auto& req = req_stream->request();\n URI uri(req.uri());\n\n http::HTTPResponse res;\n res.populateFromRequest(req);\n\n if (uri.path() == \"\/api\/v1\/mapreduce\/execute\") {\n executeMapReduceScript(session, uri, req_stream.get(), res_stream.get());\n return;\n }\n\n if (StringUtil::beginsWith(uri.path(), kResultPathPrefix)) {\n fetchResult(\n session,\n uri.path().substr(kResultPathPrefix.size()),\n req_stream.get(),\n res_stream.get());\n return;\n }\n\n if (uri.path() == \"\/api\/v1\/mapreduce\/tasks\/map_partition\") {\n executeMapPartitionTask(session, uri, req_stream.get(), res_stream.get());\n return;\n }\n\n if (uri.path() == \"\/api\/v1\/mapreduce\/tasks\/reduce\") {\n executeReduceTask(session, uri, req_stream.get(), res_stream.get());\n return;\n }\n\n if (uri.path() == \"\/api\/v1\/mapreduce\/tasks\/save_to_table\") {\n req_stream->readBody();\n catchAndReturnErrors(&res, [this, &session, &uri, &req, &res] {\n executeSaveToTableTask(session, uri, &req, &res);\n });\n res_stream->writeResponse(res);\n return;\n }\n\n if (uri.path() == \"\/api\/v1\/mapreduce\/tasks\/save_to_table_partition\") {\n req_stream->readBody();\n catchAndReturnErrors(&res, [this, &session, &uri, &req, &res] {\n executeSaveToTablePartitionTask(session, uri, &req, &res);\n });\n res_stream->writeResponse(res);\n return;\n }\n\n res.setStatus(http::kStatusNotFound);\n res.addHeader(\"Connection\", \"close\");\n res.addHeader(\"Content-Type\", \"text\/html; charset=utf-8\");\n res.addBody(Assets::getAsset(\"zbase\/webui\/404.html\"));\n res_stream->writeResponse(res);\n}\n\nvoid MapReduceAPIServlet::executeMapPartitionTask(\n const AnalyticsSession& session,\n const URI& uri,\n http::HTTPRequestStream* req_stream,\n http::HTTPResponseStream* res_stream) {\n req_stream->readBody();\n\n URI::ParamList params;\n URI::parseQueryString(req_stream->request().body().toString(), ¶ms);\n\n String table_name;\n if (!URI::getParam(params, \"table\", &table_name)) {\n http::HTTPResponse res;\n res.populateFromRequest(req_stream->request());\n res.setStatus(http::kStatusBadRequest);\n res.addBody(\"missing ?table=... parameter\");\n res_stream->writeResponse(res);\n return;\n }\n\n String partition_key;\n if (!URI::getParam(params, \"partition\", &partition_key)) {\n http::HTTPResponse res;\n res.populateFromRequest(req_stream->request());\n res.setStatus(http::kStatusBadRequest);\n res.addBody(\"missing ?partition=... parameter\");\n res_stream->writeResponse(res);\n return;\n }\n\n String map_fn;\n if (!URI::getParam(params, \"map_function\", &map_fn)) {\n http::HTTPResponse res;\n res.populateFromRequest(req_stream->request());\n res.setStatus(http::kStatusBadRequest);\n res.addBody(\"missing ?map_function=... parameter\");\n res_stream->writeResponse(res);\n return;\n }\n\n auto sse_stream = mkRef(new http::HTTPSSEStream(req_stream, res_stream));\n sse_stream->start();\n\n auto job_spec = mkRef(new MapReduceJobSpec{});\n job_spec->onLogline([sse_stream] (const String& logline) {\n if (sse_stream->isClosed()) {\n return;\n }\n\n sse_stream->sendEvent(URI::urlEncode(logline), Some(String(\"log\")));\n });\n\n try {\n String js_globals = \"{}\";\n URI::getParam(params, \"globals\", &js_globals);\n\n String js_params = \"{}\";\n URI::getParam(params, \"params\", &js_params);\n\n auto shard_id = service_->mapPartition(\n session,\n job_spec,\n table_name,\n SHA1Hash::fromHexString(partition_key),\n map_fn,\n js_globals,\n js_params);\n\n String resid;\n if (!shard_id.isEmpty()) {\n resid = shard_id.get().toString();\n }\n\n sse_stream->sendEvent(resid, Some(String(\"result_id\")));\n } catch (const Exception& e) {\n sse_stream->sendEvent(e.what(), Some(String(\"error\")));\n }\n\n sse_stream->finish();\n}\n\nvoid MapReduceAPIServlet::executeReduceTask(\n const AnalyticsSession& session,\n const URI& uri,\n http::HTTPRequestStream* req_stream,\n http::HTTPResponseStream* res_stream) {\n req_stream->readBody();\n\n URI::ParamList params;\n URI::parseQueryString(req_stream->request().body().toString(), ¶ms);\n\n Vector<String> input_tables;\n for (const auto& p : params) {\n if (p.first == \"input_table\") {\n input_tables.emplace_back(p.second);\n }\n }\n\n String reduce_fn;\n if (!URI::getParam(params, \"reduce_fn\", &reduce_fn)) {\n http::HTTPResponse res;\n res.populateFromRequest(req_stream->request());\n res.setStatus(http::kStatusBadRequest);\n res.addBody(\"missing ?reduce_fn=... parameter\");\n res_stream->writeResponse(res);\n return;\n }\n\n String js_globals = \"{}\";\n URI::getParam(params, \"globals\", &js_globals);\n\n String js_params = \"{}\";\n URI::getParam(params, \"params\", &js_params);\n\n auto sse_stream = mkRef(new http::HTTPSSEStream(req_stream, res_stream));\n sse_stream->start();\n\n auto job_spec = mkRef(new MapReduceJobSpec{});\n job_spec->onLogline([this, sse_stream] (const String& logline) {\n if (sse_stream->isClosed()) {\n return;\n }\n\n sse_stream->sendEvent(URI::urlEncode(logline), Some(String(\"log\")));\n });\n\n try {\n auto shard_id = service_->reduceTables(\n session,\n job_spec,\n input_tables,\n reduce_fn,\n js_globals,\n js_params);\n\n String resid;\n if (!shard_id.isEmpty()) {\n resid = shard_id.get().toString();\n }\n\n sse_stream->sendEvent(resid, Some(String(\"result_id\")));\n } catch (const Exception& e) {\n sse_stream->sendEvent(e.what(), Some(String(\"error\")));\n }\n\n sse_stream->finish();\n}\n\nvoid MapReduceAPIServlet::executeSaveToTableTask(\n const AnalyticsSession& session,\n const URI& uri,\n const http::HTTPRequest* req,\n http::HTTPResponse* res) {\n URI::ParamList params;\n URI::parseQueryString(req->body().toString(), ¶ms);\n\n String result_id;\n if (!URI::getParam(params, \"result_id\", &result_id)) {\n res->setStatus(http::kStatusBadRequest);\n res->addBody(\"missing ?result_id=... parameter\");\n return;\n }\n\n String table_name;\n if (!URI::getParam(params, \"table_name\", &table_name)) {\n res->setStatus(http::kStatusBadRequest);\n res->addBody(\"missing ?table_name=... parameter\");\n return;\n }\n\n String partition;\n if (!URI::getParam(params, \"partition\", &partition)) {\n res->setStatus(http::kStatusBadRequest);\n res->addBody(\"missing ?partition=... parameter\");\n return;\n }\n\n bool saved = service_->saveLocalResultToTable(\n session,\n table_name,\n SHA1Hash::fromHexString(partition),\n SHA1Hash::fromHexString(result_id));\n\n if (saved) {\n res->setStatus(http::kStatusCreated);\n } else {\n res->setStatus(http::kStatusNoContent);\n }\n}\n\nvoid MapReduceAPIServlet::executeSaveToTablePartitionTask(\n const AnalyticsSession& session,\n const URI& uri,\n const http::HTTPRequest* req,\n http::HTTPResponse* res) {\n URI::ParamList params;\n URI::parseQueryString(req->body().toString(), ¶ms);\n\n Vector<String> input_tables;\n for (const auto& p : params) {\n if (p.first == \"input_table\") {\n input_tables.emplace_back(p.second);\n }\n }\n\n String table_name;\n if (!URI::getParam(params, \"table_name\", &table_name)) {\n res->setStatus(http::kStatusBadRequest);\n res->addBody(\"missing ?table_name=... parameter\");\n return;\n }\n\n String partition;\n if (!URI::getParam(params, \"partition\", &partition)) {\n res->setStatus(http::kStatusBadRequest);\n res->addBody(\"missing ?partition=... parameter\");\n return;\n }\n\n bool saved = service_->saveRemoteResultsToTable(\n session,\n table_name,\n SHA1Hash::fromHexString(partition),\n input_tables);\n\n if (saved) {\n res->setStatus(http::kStatusCreated);\n } else {\n res->setStatus(http::kStatusNoContent);\n }\n}\n\n\nvoid MapReduceAPIServlet::executeMapReduceScript(\n const AnalyticsSession& session,\n const URI& uri,\n http::HTTPRequestStream* req_stream,\n http::HTTPResponseStream* res_stream) {\n req_stream->readBody();\n\n auto sse_stream = mkRef(new http::HTTPSSEStream(req_stream, res_stream));\n sse_stream->start();\n\n {\n Buffer buf;\n json::JSONOutputStream json(BufferOutputStream::fromBuffer(&buf));\n json.beginObject();\n json.endObject();\n\n sse_stream->sendEvent(buf, Some(String(\"job_started\")));\n }\n\n auto program_source = req_stream->request().body().toString();\n auto job_spec = mkRef(new MapReduceJobSpec{});\n\n job_spec->onProgress([this, sse_stream] (const MapReduceJobStatus& s) {\n if (sse_stream->isClosed()) {\n return;\n }\n\n Buffer buf;\n json::JSONOutputStream json(BufferOutputStream::fromBuffer(&buf));\n json.beginObject();\n json.addObjectEntry(\"status\");\n json.addString(\"running\");\n json.addComma();\n json.addObjectEntry(\"progress\");\n json.addFloat(s.num_tasks_total > 0\n ? s.num_tasks_completed \/ (double) s.num_tasks_total\n : 0);\n json.addComma();\n json.addObjectEntry(\"num_tasks_total\");\n json.addInteger(s.num_tasks_total);\n json.addComma();\n json.addObjectEntry(\"num_tasks_completed\");\n json.addInteger(s.num_tasks_completed);\n json.addComma();\n json.addObjectEntry(\"num_tasks_running\");\n json.addInteger(s.num_tasks_running);\n json.endObject();\n\n sse_stream->sendEvent(buf, Some(String(\"status\")));\n });\n\n job_spec->onResult([this, sse_stream] (const String& value) {\n if (sse_stream->isClosed()) {\n return;\n }\n\n sse_stream->sendEvent(URI::urlEncode(value), Some(String(\"result\")));\n });\n\n job_spec->onLogline([this, sse_stream] (const String& logline) {\n if (sse_stream->isClosed()) {\n return;\n }\n\n sse_stream->sendEvent(URI::urlEncode(logline), Some(String(\"log\")));\n });\n\n bool error = false;\n try {\n service_->executeScript(session, job_spec, program_source);\n } catch (const StandardException& e) {\n Buffer buf;\n json::JSONOutputStream json(BufferOutputStream::fromBuffer(&buf));\n json.beginObject();\n json.addObjectEntry(\"status\");\n json.addString(\"error\");\n json.addComma();\n json.addObjectEntry(\"error\");\n json.addString(e.what());\n json.endObject();\n\n sse_stream->sendEvent(buf, Some(String(\"status\")));\n sse_stream->sendEvent(URI::urlEncode(e.what()), Some(String(\"error\")));\n\n error = true;\n }\n\n if (!error) {\n Buffer buf;\n json::JSONOutputStream json(BufferOutputStream::fromBuffer(&buf));\n json.beginObject();\n json.addObjectEntry(\"status\");\n json.addString(\"success\");\n json.endObject();\n\n sse_stream->sendEvent(buf, Some(String(\"status\")));\n }\n\n {\n Buffer buf;\n json::JSONOutputStream json(BufferOutputStream::fromBuffer(&buf));\n json.beginObject();\n json.endObject();\n\n sse_stream->sendEvent(buf, Some(String(\"job_finished\")));\n }\n\n sse_stream->finish();\n}\n\nvoid MapReduceAPIServlet::fetchResult(\n const AnalyticsSession& session,\n const String& result_id,\n http::HTTPRequestStream* req_stream,\n http::HTTPResponseStream* res_stream) {\n http::HTTPResponse res;\n res.populateFromRequest(req_stream->request());\n req_stream->readBody();\n\n URI uri(req_stream->request().uri());\n const auto& params = uri.queryParams();\n\n auto filename = service_->getResultFilename(\n SHA1Hash::fromHexString(result_id));\n\n if (filename.isEmpty()) {\n res.setStatus(http::kStatusNotFound);\n res.addHeader(\"Connection\", \"close\");\n res_stream->writeResponse(res);\n return;\n }\n\n size_t sample_mod = 0;\n size_t sample_idx = 0;\n String sample_str;\n if (URI::getParam(params, \"sample\", &sample_str)) {\n auto parts = StringUtil::split(sample_str, \":\");\n\n if (parts.size() != 2) {\n res.setStatus(stx::http::kStatusBadRequest);\n res.addBody(\"invalid ?sample=... parameter, format is <mod>:<idx>\");\n res_stream->writeResponse(res);\n return;\n }\n\n sample_mod = std::stoull(parts[0]);\n sample_idx = std::stoull(parts[1]);\n }\n\n res.setStatus(http::kStatusOK);\n res.addHeader(\"Content-Type\", \"application\/octet-stream\");\n res.addHeader(\"Connection\", \"close\");\n res_stream->startResponse(res);\n\n sstable::SSTableReader reader(filename.get());\n auto cursor = reader.getCursor();\n\n while (cursor->valid()) {\n void* key;\n size_t key_size;\n cursor->getKey((void**) &key, &key_size);\n\n FNV<uint64_t> fnv;\n if (sample_mod == 0 ||\n (fnv.hash(key, key_size) % sample_mod) == sample_idx) {\n void* data;\n size_t data_size;\n cursor->getData(&data, &data_size);\n\n util::BinaryMessageWriter buf;\n buf.appendUInt32(key_size);\n buf.appendUInt32(data_size);\n buf.append(key, key_size);\n buf.append(data, data_size);\n res_stream->writeBodyChunk(Buffer(buf.data(), buf.size()));\n res_stream->waitForReader();\n }\n\n if (!cursor->next()) {\n break;\n }\n }\n\n util::BinaryMessageWriter buf;\n buf.appendUInt32(0);\n buf.appendUInt32(0);\n res_stream->writeBodyChunk(Buffer(buf.data(), buf.size()));\n\n res_stream->finishResponse();\n}\n\n}\n<|endoftext|>"} {"text":"<commit_before>#ifndef STAN_MATH_PRIM_FUN_LUB_CONSTRAIN_HPP\n#define STAN_MATH_PRIM_FUN_LUB_CONSTRAIN_HPP\n\n#include <stan\/math\/prim\/fun\/Eigen.hpp>\n#include <stan\/math\/prim\/meta.hpp>\n#include <stan\/math\/prim\/err.hpp>\n#include <stan\/math\/prim\/fun\/add.hpp>\n#include <stan\/math\/prim\/fun\/exp.hpp>\n#include <stan\/math\/prim\/fun\/elt_multiply.hpp>\n#include <stan\/math\/prim\/fun\/inv_logit.hpp>\n#include <stan\/math\/prim\/fun\/log.hpp>\n#include <stan\/math\/prim\/fun\/log1p.hpp>\n#include <stan\/math\/prim\/fun\/multiply.hpp>\n#include <stan\/math\/prim\/fun\/subtract.hpp>\n#include <stan\/math\/prim\/fun\/sum.hpp>\n#include <cmath>\n\nnamespace stan {\nnamespace math {\n\n\/**\n * Return the lower- and upper-bounded scalar derived by\n * transforming the specified free scalar given the specified\n * lower and upper bounds.\n *\n * <p>The transform is the transformed and scaled inverse logit,\n *\n * <p>\\f$f(x) = L + (U - L) \\mbox{logit}^{-1}(x)\\f$\n *\n * @tparam T Type of scalar.\n * @tparam L Type of lower bound.\n * @tparam U Type of upper bound.\n * @param[in] x Free scalar to transform.\n * @param[in] lb Lower bound.\n * @param[in] ub Upper bound.\n * @return Lower- and upper-bounded scalar derived from transforming\n * the free scalar.\n * @throw std::domain_error if ub <= lb\n *\/\ntemplate <typename T, typename L, typename U>\ninline auto lub_constrain(T&& x, L&& lb, U&& ub) {\n check_less(\"lub_constrain\", \"lb\", value_of(lb_ref), value_of(ub_ref));\n check_finite(\"lub_constrain\", \"lb\", value_of(lb_ref));\n check_finite(\"lub_constrain\", \"ub\", value_of(ub_ref));\n return add(elt_multiply(subtract(ub_ref, lb_ref), inv_logit(x_ref)),\n lb_ref);\n}\n\n\/**\n * Return the lower- and upper-bounded scalar derived by\n * transforming the specified free scalar given the specified\n * lower and upper bounds and increment the specified log\n * density with the log absolute Jacobian determinant.\n *\n * <p>The transform is as defined in\n * <code>lub_constrain(T, double, double)<\/code>. The log absolute\n * Jacobian determinant is given by\n *\n * <p>\\f$\\log \\left| \\frac{d}{dx} \\left(\n * L + (U-L) \\mbox{logit}^{-1}(x) \\right)\n * \\right|\\f$\n *\n * <p>\\f$ {} = \\log |\n * (U-L)\n * \\, (\\mbox{logit}^{-1}(x))\n * \\, (1 - \\mbox{logit}^{-1}(x)) |\\f$\n *\n * <p>\\f$ {} = \\log (U - L) + \\log (\\mbox{logit}^{-1}(x))\n * + \\log (1 - \\mbox{logit}^{-1}(x))\\f$\n *\n * @tparam T Type of scalar.\n * @tparam L Type of lower bound.\n * @tparam U Type of upper bound.\n * @param[in] x Free scalar to transform.\n * @param[in] lb Lower bound.\n * @param[in] ub Upper bound.\n * @param[in,out] lp Log probability scalar reference.\n * @return Lower- and upper-bounded scalar derived from transforming\n * the free scalar.\n * @throw std::domain_error if ub <= lb\n *\/\ntemplate <typename T, typename L, typename U>\ninline auto lub_constrain(T&& x, L&& lb, U&& ub, return_type_t<T, L, U>& lp) {\n auto&& x_ref = to_ref(std::forward<T>(x));\n auto&& lb_ref = to_ref(std::forward<L>(lb));\n auto&& ub_ref = to_ref(std::forward<U>(ub));\n\n check_less(\"lub_constrain\", \"lb\", value_of(lb_ref), value_of(ub_ref));\n check_finite(\"lub_constrain\", \"lb\", value_of(lb_ref));\n check_finite(\"lub_constrain\", \"ub\", value_of(ub_ref));\n\n auto diff = eval(subtract(std::forward<decltype(ub_ref)>(ub_ref), lb_ref));\n\n lp += sum(\n add(log(diff), subtract(-abs(x_ref), multiply(static_cast<double>(2),\n log1p_exp(-abs(x_ref))))));\n\n return add(elt_multiply(diff, inv_logit(x_ref)), lb_ref);\n}\n\n} \/\/ namespace math\n} \/\/ namespace stan\n#endif\n<commit_msg>[Jenkins] auto-formatting by clang-format version 6.0.0-1ubuntu2~16.04.1 (tags\/RELEASE_600\/final)<commit_after>#ifndef STAN_MATH_PRIM_FUN_LUB_CONSTRAIN_HPP\n#define STAN_MATH_PRIM_FUN_LUB_CONSTRAIN_HPP\n\n#include <stan\/math\/prim\/fun\/Eigen.hpp>\n#include <stan\/math\/prim\/meta.hpp>\n#include <stan\/math\/prim\/err.hpp>\n#include <stan\/math\/prim\/fun\/add.hpp>\n#include <stan\/math\/prim\/fun\/exp.hpp>\n#include <stan\/math\/prim\/fun\/elt_multiply.hpp>\n#include <stan\/math\/prim\/fun\/inv_logit.hpp>\n#include <stan\/math\/prim\/fun\/log.hpp>\n#include <stan\/math\/prim\/fun\/log1p.hpp>\n#include <stan\/math\/prim\/fun\/multiply.hpp>\n#include <stan\/math\/prim\/fun\/subtract.hpp>\n#include <stan\/math\/prim\/fun\/sum.hpp>\n#include <cmath>\n\nnamespace stan {\nnamespace math {\n\n\/**\n * Return the lower- and upper-bounded scalar derived by\n * transforming the specified free scalar given the specified\n * lower and upper bounds.\n *\n * <p>The transform is the transformed and scaled inverse logit,\n *\n * <p>\\f$f(x) = L + (U - L) \\mbox{logit}^{-1}(x)\\f$\n *\n * @tparam T Type of scalar.\n * @tparam L Type of lower bound.\n * @tparam U Type of upper bound.\n * @param[in] x Free scalar to transform.\n * @param[in] lb Lower bound.\n * @param[in] ub Upper bound.\n * @return Lower- and upper-bounded scalar derived from transforming\n * the free scalar.\n * @throw std::domain_error if ub <= lb\n *\/\ntemplate <typename T, typename L, typename U>\ninline auto lub_constrain(T&& x, L&& lb, U&& ub) {\n check_less(\"lub_constrain\", \"lb\", value_of(lb_ref), value_of(ub_ref));\n check_finite(\"lub_constrain\", \"lb\", value_of(lb_ref));\n check_finite(\"lub_constrain\", \"ub\", value_of(ub_ref));\n return add(elt_multiply(subtract(ub_ref, lb_ref), inv_logit(x_ref)), lb_ref);\n}\n\n\/**\n * Return the lower- and upper-bounded scalar derived by\n * transforming the specified free scalar given the specified\n * lower and upper bounds and increment the specified log\n * density with the log absolute Jacobian determinant.\n *\n * <p>The transform is as defined in\n * <code>lub_constrain(T, double, double)<\/code>. The log absolute\n * Jacobian determinant is given by\n *\n * <p>\\f$\\log \\left| \\frac{d}{dx} \\left(\n * L + (U-L) \\mbox{logit}^{-1}(x) \\right)\n * \\right|\\f$\n *\n * <p>\\f$ {} = \\log |\n * (U-L)\n * \\, (\\mbox{logit}^{-1}(x))\n * \\, (1 - \\mbox{logit}^{-1}(x)) |\\f$\n *\n * <p>\\f$ {} = \\log (U - L) + \\log (\\mbox{logit}^{-1}(x))\n * + \\log (1 - \\mbox{logit}^{-1}(x))\\f$\n *\n * @tparam T Type of scalar.\n * @tparam L Type of lower bound.\n * @tparam U Type of upper bound.\n * @param[in] x Free scalar to transform.\n * @param[in] lb Lower bound.\n * @param[in] ub Upper bound.\n * @param[in,out] lp Log probability scalar reference.\n * @return Lower- and upper-bounded scalar derived from transforming\n * the free scalar.\n * @throw std::domain_error if ub <= lb\n *\/\ntemplate <typename T, typename L, typename U>\ninline auto lub_constrain(T&& x, L&& lb, U&& ub, return_type_t<T, L, U>& lp) {\n auto&& x_ref = to_ref(std::forward<T>(x));\n auto&& lb_ref = to_ref(std::forward<L>(lb));\n auto&& ub_ref = to_ref(std::forward<U>(ub));\n\n check_less(\"lub_constrain\", \"lb\", value_of(lb_ref), value_of(ub_ref));\n check_finite(\"lub_constrain\", \"lb\", value_of(lb_ref));\n check_finite(\"lub_constrain\", \"ub\", value_of(ub_ref));\n\n auto diff = eval(subtract(std::forward<decltype(ub_ref)>(ub_ref), lb_ref));\n\n lp += sum(\n add(log(diff), subtract(-abs(x_ref), multiply(static_cast<double>(2),\n log1p_exp(-abs(x_ref))))));\n\n return add(elt_multiply(diff, inv_logit(x_ref)), lb_ref);\n}\n\n} \/\/ namespace math\n} \/\/ namespace stan\n#endif\n<|endoftext|>"} {"text":"<commit_before>#ifndef STAN_MATH_PRIM_MAT_FUN_TO_MATRIX_HPP\n#define STAN_MATH_PRIM_MAT_FUN_TO_MATRIX_HPP\n\n#include <stan\/math\/prim\/mat\/fun\/Eigen.hpp>\n#include <Eigen\/Dense>\n#include <vector>\n\nnamespace stan {\n namespace math {\n \/**\n * Returns a matrix with dynamic dimensions constructed from\n * an Eigen matrix which is either\n * a row vector, column vector, or matrix.\n * The runtime dimensions will be the same as the input.\n *\n * @tparam T type of the scalar\n * @tparam R number of rows\n * @tparam C number of columns\n * @param x matrix\n * @return the matrix representation of the input\n *\/\n template <typename T, int R, int C>\n inline Eigen::Matrix<T, Eigen::Dynamic, Eigen::Dynamic>\n to_matrix(const Eigen::Matrix<T, R, C>& x) {\n return x;\n }\n\n \/**\n * Returns a matrix representation of a standard vector of Eigen\n * row vectors with the same dimensions and indexing order.\n *\n * @tparam T type of the scalar\n * @param x Eigen vector of vectors of scalar values\n * @return the matrix representation of the input\n *\/\n template <typename T>\n inline Eigen::Matrix<T, Eigen::Dynamic, Eigen::Dynamic>\n to_matrix(const\n std::vector<Eigen::Matrix<T, 1, Eigen::Dynamic> >& x) {\n size_t rows = x.size();\n if (rows != 0) {\n size_t cols = x[0].size();\n Eigen::Matrix<T, Eigen::Dynamic, Eigen::Dynamic>\n result(rows, cols);\n for (size_t i=0, ij=0; i < cols; i++)\n for (size_t j=0; j < rows; j++, ij++)\n result(ij) = x[j][i];\n return result;\n } else {\n return Eigen::Matrix<T, Eigen::Dynamic, Eigen::Dynamic> (0, 0);\n }\n }\n\n \/**\n * Returns a matrix representation of the standard vector of\n * standard vectors with the same dimensions and indexing order.\n *\n * @tparam T type of the scalar\n * @param x vector of vectors of scalar values\n * @return the matrix representation of the input\n *\/\n template <typename T>\n inline Eigen::Matrix<T, Eigen::Dynamic, Eigen::Dynamic>\n to_matrix(const std::vector< std::vector<T> >& x) {\n size_t rows = x.size();\n if (rows != 0) {\n size_t cols = x[0].size();\n Eigen::Matrix<T, Eigen::Dynamic, Eigen::Dynamic>\n result(rows, cols);\n for (size_t i=0, ij=0; i < cols; i++)\n for (size_t j=0; j < rows; j++, ij++)\n result(ij) = x[j][i];\n return result;\n } else {\n return Eigen::Matrix<T, Eigen::Dynamic, Eigen::Dynamic> (0, 0);\n }\n }\n\n \/**\n * Returns a matrix representation of a standard vector of\n * standard vectors of integers with the same dimensions and\n * indexing order.\n *\n * @param x vector of vectors of integer values\n * @return the matrix representation of the input,\n * ints promoted to doubles\n *\/\n inline Eigen::Matrix<double, Eigen::Dynamic, Eigen::Dynamic>\n to_matrix(const std::vector< std::vector<int> >& x) {\n size_t rows = x.size();\n if (rows != 0) {\n size_t cols = x[0].size();\n Eigen::Matrix<double, Eigen::Dynamic, Eigen::Dynamic>\n result(rows, cols);\n for (size_t i=0, ij=0; i < cols; i++)\n for (size_t j=0; j < rows; j++, ij++)\n result(ij) = x[j][i];\n return result;\n } else {\n return Eigen::Matrix<double, Eigen::Dynamic,\n Eigen::Dynamic> (0, 0);\n }\n }\n \n \/**\n * Returns a matrix representation of the vector in column-major\n * order with the specified number of rows and columns.\n *\n * @tparam T type of the scalar\n * @param x matrix\n * @param m rows\n * @param n columns\n * @return Reshaped inputted matrix\n * @throw <code>std::invalid_argument<\/code> if the sizes\n * do not match\n *\/\n template <typename T, int R, int C>\n inline Eigen::Matrix<T, Eigen::Dynamic, Eigen::Dynamic>\n to_matrix(const Eigen::Matrix<T, R, C>& x, int m, int n) {\n static const char* fun = \"to_matrix(matrix)\";\n check_size_match(fun, \"rows * columns\", m * n, \"vector size\",\n x.size());\n Eigen::Matrix<T, Eigen::Dynamic, Eigen::Dynamic> y = x;\n y.resize(m, n);\n return y;\n }\n\n \/**\n * Returns a matrix representation of the vector in column-major\n * order with the specified number of rows and columns.\n *\n * @tparam T type of the scalar\n * @param x vector of values\n * @param m rows\n * @param n columns\n * @return the matrix representation of the input\n * @throw <code>std::invalid_argument<\/code>\n * if the sizes do not match\n *\/\n template <typename T>\n inline Eigen::Matrix<T, Eigen::Dynamic, Eigen::Dynamic>\n to_matrix(const std::vector<T>& x, int m, int n) {\n static const char* fun = \"to_matrix(array)\";\n check_size_match(fun, \"rows * columns\", m * n, \"vector size\",\n x.size());\n return Eigen::Map<const\n Eigen::Matrix<T, Eigen::Dynamic,\n Eigen::Dynamic> >(&x[0], m, n);\n }\n \n \/**\n * Returns a matrix representation of the vector in column-major\n * order with the specified number of rows and columns.\n *\n * @param x vector of values\n * @param m rows\n * @param n columns\n * @return the matrix representation of the input\n * @throw <code>std::invalid_argument<\/code>\n * if the sizes do not match\n *\/\n inline Eigen::Matrix<double, Eigen::Dynamic, Eigen::Dynamic>\n to_matrix(const std::vector<int>& x, int m, int n) {\n static const char* fun = \"to_matrix(array)\";\n int size = x.size();\n check_size_match(fun, \"rows * columns\", m * n,\n \"vector size\", size);\n Eigen::Matrix<double,\n Eigen::Dynamic, Eigen::Dynamic> result(m, n);\n double* datap = result.data();\n for (int i=0; i < size; i++)\n datap[i] = x[i];\n return result;\n }\n\n \/**\n * Returns a matrix representation of the vector in column-major\n * order with the specified number of rows and columns.\n *\n * @tparam T type of the scalar\n * @param x matrix\n * @param m rows\n * @param n columns\n * @param cm column-major indicator:\n * if 1, output matrix is transversed in column-major order,\n * if 0, output matrix is transversed in row-major order,\n * otherwise function throws std::invalid_argument\n * @return Reshaped inputted matrix\n * @throw <code>std::invalid_argument<\/code>\n * if the sizes do not match\n *\/\n template <typename T, int R, int C>\n inline Eigen::Matrix<T, Eigen::Dynamic, Eigen::Dynamic>\n to_matrix(const Eigen::Matrix<T, R, C>& x, int m, int n, int cm) {\n if (cm == 1)\n return to_matrix(x, m, n);\n else if (cm == 0) {\n check_size_match(\"to_matrix\", \"rows * columns\", m * n,\n \"matrix size\", x.size());\n Eigen::Matrix<T, Eigen::Dynamic, Eigen::Dynamic>\n result(m, n);\n for (size_t i=0, ij=0; i < m; i++)\n for (size_t j=0; j < n; j++, ij++)\n result(i, j) = x(ij);\n return result;\n }\n else {\n invalid_argument(\"to_matrix\", \"cm\", cm,\n \"column-major indicator\",\n \"must equal 0 or 1\");\n return Eigen::Matrix<T, Eigen::Dynamic, Eigen::Dynamic> (0, 0);\n }\n }\n\n \/**\n * Returns a matrix representation of the vector in column-major\n * order with the specified number of rows and columns.\n *\n * @tparam T type of the scalar\n * @param x vector of values\n * @param m rows\n * @param n columns\n * @param cm column-major indicator:\n * if 1, output matrix is transversed in column-major order,\n * if 0, output matrix is transversed in row-major order,\n * otherwise function throws std::invalid_argument\n * @return the matrix representation of the input\n * @throw <code>std::invalid_argument<\/code>\n * if the sizes do not match\n *\/\n template <typename T>\n inline\n Eigen::Matrix<typename \n boost::math::tools::promote_args<T, double>::type,\n Eigen::Dynamic, Eigen::Dynamic>\n to_matrix(const std::vector<T>& x, int m, int n, int cm) {\n if (cm == 1)\n return to_matrix(x, m, n);\n else if (cm == 0) {\n check_size_match(\"to_matrix\", \"rows * columns\", m * n,\n \"matrix size\", x.size());\n Eigen::Matrix<typename\n boost::math::tools::promote_args<T, double>::type,\n Eigen::Dynamic, Eigen::Dynamic>\n result(m, n);\n for (size_t i=0, ij=0; i < m; i++)\n for (size_t j=0; j < n; j++, ij++)\n result(i, j) = x[ij];\n return result;\n }\n else {\n invalid_argument(\"to_matrix\", \"cm\", cm,\n \"column-major indicator\",\n \"must equal 0 or 1\");\n return Eigen::Matrix<typename\n boost::math::tools::promote_args<T, double>::type,\n Eigen::Dynamic, Eigen::Dynamic> (0, 0);\n }\n }\n\n }\n}\n#endif\n<commit_msg>trailing spaces and cpplint<commit_after>#ifndef STAN_MATH_PRIM_MAT_FUN_TO_MATRIX_HPP\n#define STAN_MATH_PRIM_MAT_FUN_TO_MATRIX_HPP\n\n#include <stan\/math\/prim\/mat\/fun\/Eigen.hpp>\n#include <Eigen\/Dense>\n#include <vector>\n\nnamespace stan {\n namespace math {\n \/**\n * Returns a matrix with dynamic dimensions constructed from\n * an Eigen matrix which is either\n * a row vector, column vector, or matrix.\n * The runtime dimensions will be the same as the input.\n *\n * @tparam T type of the scalar\n * @tparam R number of rows\n * @tparam C number of columns\n * @param x matrix\n * @return the matrix representation of the input\n *\/\n template <typename T, int R, int C>\n inline Eigen::Matrix<T, Eigen::Dynamic, Eigen::Dynamic>\n to_matrix(const Eigen::Matrix<T, R, C>& x) {\n return x;\n }\n\n \/**\n * Returns a matrix representation of a standard vector of Eigen\n * row vectors with the same dimensions and indexing order.\n *\n * @tparam T type of the scalar\n * @param x Eigen vector of vectors of scalar values\n * @return the matrix representation of the input\n *\/\n template <typename T>\n inline Eigen::Matrix<T, Eigen::Dynamic, Eigen::Dynamic>\n to_matrix(const\n std::vector<Eigen::Matrix<T, 1, Eigen::Dynamic> >& x) {\n size_t rows = x.size();\n if (rows != 0) {\n size_t cols = x[0].size();\n Eigen::Matrix<T, Eigen::Dynamic, Eigen::Dynamic>\n result(rows, cols);\n for (size_t i=0, ij=0; i < cols; i++)\n for (size_t j=0; j < rows; j++, ij++)\n result(ij) = x[j][i];\n return result;\n } else {\n return Eigen::Matrix<T, Eigen::Dynamic, Eigen::Dynamic> (0, 0);\n }\n }\n\n \/**\n * Returns a matrix representation of the standard vector of\n * standard vectors with the same dimensions and indexing order.\n *\n * @tparam T type of the scalar\n * @param x vector of vectors of scalar values\n * @return the matrix representation of the input\n *\/\n template <typename T>\n inline Eigen::Matrix<T, Eigen::Dynamic, Eigen::Dynamic>\n to_matrix(const std::vector< std::vector<T> >& x) {\n size_t rows = x.size();\n if (rows != 0) {\n size_t cols = x[0].size();\n Eigen::Matrix<T, Eigen::Dynamic, Eigen::Dynamic>\n result(rows, cols);\n for (size_t i=0, ij=0; i < cols; i++)\n for (size_t j=0; j < rows; j++, ij++)\n result(ij) = x[j][i];\n return result;\n } else {\n return Eigen::Matrix<T, Eigen::Dynamic, Eigen::Dynamic> (0, 0);\n }\n }\n\n \/**\n * Returns a matrix representation of a standard vector of\n * standard vectors of integers with the same dimensions and\n * indexing order.\n *\n * @param x vector of vectors of integer values\n * @return the matrix representation of the input,\n * ints promoted to doubles\n *\/\n inline Eigen::Matrix<double, Eigen::Dynamic, Eigen::Dynamic>\n to_matrix(const std::vector< std::vector<int> >& x) {\n size_t rows = x.size();\n if (rows != 0) {\n size_t cols = x[0].size();\n Eigen::Matrix<double, Eigen::Dynamic, Eigen::Dynamic>\n result(rows, cols);\n for (size_t i=0, ij=0; i < cols; i++)\n for (size_t j=0; j < rows; j++, ij++)\n result(ij) = x[j][i];\n return result;\n } else {\n return Eigen::Matrix<double, Eigen::Dynamic,\n Eigen::Dynamic> (0, 0);\n }\n }\n\n \/**\n * Returns a matrix representation of the vector in column-major\n * order with the specified number of rows and columns.\n *\n * @tparam T type of the scalar\n * @param x matrix\n * @param m rows\n * @param n columns\n * @return Reshaped inputted matrix\n * @throw <code>std::invalid_argument<\/code> if the sizes\n * do not match\n *\/\n template <typename T, int R, int C>\n inline Eigen::Matrix<T, Eigen::Dynamic, Eigen::Dynamic>\n to_matrix(const Eigen::Matrix<T, R, C>& x, int m, int n) {\n static const char* fun = \"to_matrix(matrix)\";\n check_size_match(fun, \"rows * columns\", m * n, \"vector size\",\n x.size());\n Eigen::Matrix<T, Eigen::Dynamic, Eigen::Dynamic> y = x;\n y.resize(m, n);\n return y;\n }\n\n \/**\n * Returns a matrix representation of the vector in column-major\n * order with the specified number of rows and columns.\n *\n * @tparam T type of the scalar\n * @param x vector of values\n * @param m rows\n * @param n columns\n * @return the matrix representation of the input\n * @throw <code>std::invalid_argument<\/code>\n * if the sizes do not match\n *\/\n template <typename T>\n inline Eigen::Matrix<T, Eigen::Dynamic, Eigen::Dynamic>\n to_matrix(const std::vector<T>& x, int m, int n) {\n static const char* fun = \"to_matrix(array)\";\n check_size_match(fun, \"rows * columns\", m * n, \"vector size\",\n x.size());\n return Eigen::Map<const\n Eigen::Matrix<T, Eigen::Dynamic,\n Eigen::Dynamic> >(&x[0], m, n);\n }\n\n \/**\n * Returns a matrix representation of the vector in column-major\n * order with the specified number of rows and columns.\n *\n * @param x vector of values\n * @param m rows\n * @param n columns\n * @return the matrix representation of the input\n * @throw <code>std::invalid_argument<\/code>\n * if the sizes do not match\n *\/\n inline Eigen::Matrix<double, Eigen::Dynamic, Eigen::Dynamic>\n to_matrix(const std::vector<int>& x, int m, int n) {\n static const char* fun = \"to_matrix(array)\";\n int size = x.size();\n check_size_match(fun, \"rows * columns\", m * n,\n \"vector size\", size);\n Eigen::Matrix<double,\n Eigen::Dynamic, Eigen::Dynamic> result(m, n);\n double* datap = result.data();\n for (int i=0; i < size; i++)\n datap[i] = x[i];\n return result;\n }\n\n \/**\n * Returns a matrix representation of the vector in column-major\n * order with the specified number of rows and columns.\n *\n * @tparam T type of the scalar\n * @param x matrix\n * @param m rows\n * @param n columns\n * @param cm column-major indicator:\n * if 1, output matrix is transversed in column-major order,\n * if 0, output matrix is transversed in row-major order,\n * otherwise function throws std::invalid_argument\n * @return Reshaped inputted matrix\n * @throw <code>std::invalid_argument<\/code>\n * if the sizes do not match\n *\/\n template <typename T, int R, int C>\n inline Eigen::Matrix<T, Eigen::Dynamic, Eigen::Dynamic>\n to_matrix(const Eigen::Matrix<T, R, C>& x, int m, int n, int cm) {\n if (cm == 1) {\n return to_matrix(x, m, n);\n } else if (cm == 0) {\n check_size_match(\"to_matrix\", \"rows * columns\", m * n,\n \"matrix size\", x.size());\n Eigen::Matrix<T, Eigen::Dynamic, Eigen::Dynamic>\n result(m, n);\n for (size_t i=0, ij=0; i < m; i++)\n for (size_t j=0; j < n; j++, ij++)\n result(i, j) = x(ij);\n return result;\n } else {\n invalid_argument(\"to_matrix\", \"cm\", cm,\n \"column-major indicator\",\n \"must equal 0 or 1\");\n return Eigen::Matrix<T, Eigen::Dynamic, Eigen::Dynamic> (0, 0);\n }\n }\n\n \/**\n * Returns a matrix representation of the vector in column-major\n * order with the specified number of rows and columns.\n *\n * @tparam T type of the scalar\n * @param x vector of values\n * @param m rows\n * @param n columns\n * @param cm column-major indicator:\n * if 1, output matrix is transversed in column-major order,\n * if 0, output matrix is transversed in row-major order,\n * otherwise function throws std::invalid_argument\n * @return the matrix representation of the input\n * @throw <code>std::invalid_argument<\/code>\n * if the sizes do not match\n *\/\n template <typename T>\n inline\n Eigen::Matrix<typename\n boost::math::tools::promote_args<T, double>::type,\n Eigen::Dynamic, Eigen::Dynamic>\n to_matrix(const std::vector<T>& x, int m, int n, int cm) {\n if (cm == 1) {\n return to_matrix(x, m, n);\n } else if (cm == 0) {\n check_size_match(\"to_matrix\", \"rows * columns\", m * n,\n \"matrix size\", x.size());\n Eigen::Matrix<typename\n boost::math::tools::promote_args<T, double>::type,\n Eigen::Dynamic, Eigen::Dynamic>\n result(m, n);\n for (size_t i=0, ij=0; i < m; i++)\n for (size_t j=0; j < n; j++, ij++)\n result(i, j) = x[ij];\n return result;\n } else {\n invalid_argument(\"to_matrix\", \"cm\", cm,\n \"column-major indicator\",\n \"must equal 0 or 1\");\n return Eigen::Matrix<typename\n boost::math::tools::promote_args<T, double>::type,\n Eigen::Dynamic, Eigen::Dynamic> (0, 0);\n }\n }\n\n }\n}\n#endif\n<|endoftext|>"} {"text":"<commit_before>\/\/ \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ Import section\n\/\/ \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ STL\n#include <iostream>\n#include <fstream>\n#include <string>\n\/\/ MPL\n#include <boost\/mpl\/push_back.hpp>\n#include <boost\/mpl\/vector.hpp>\n#include <boost\/mpl\/at.hpp>\n#include <boost\/mpl\/assert.hpp>\n#include <boost\/type_traits\/is_same.hpp>\n\/\/ StdAir\n#include <stdair\/STDAIR_Service.hpp>\n#include <stdair\/STDAIR_Types.hpp>\n#include <stdair\/bom\/BomList.hpp>\n#include <stdair\/bom\/BomSource.hpp>\n#include <stdair\/factory\/FacBomContent.hpp>\n#include <stdair\/service\/Logger.hpp>\n#include <test\/stdair\/StdairTestLib.hpp>\n\n\/**\n * Namespace gathering classes and structures for test purposes\n *\/\nnamespace stdair_test {\n \n \/** BookingClass *\/\n struct BookingClass {\n std::string _classCode;\n \/** Constructor. *\/\n BookingClass (const std::string& iClassCode)\n : _classCode (iClassCode) {\n }\n \n \/** Display .*\/\n std::string toString() const {\n std::ostringstream oStr;\n oStr << _classCode;\n return oStr.str();\n }\n };\n \n \/** Cabin *\/\n struct Cabin {\n BookingClass _bookingClass;\n Cabin (const BookingClass& iBkgClass)\n : _bookingClass (iBkgClass) {\n }\n \n \/** Display .*\/\n std::string toString() const {\n std::ostringstream oStr;\n oStr << _bookingClass._classCode;\n return oStr.str();\n }\n \n \/** Child type. *\/\n typedef BookingClass child;\n };\n}\n\n\/\/ \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nvoid StdairTestLib::testMPLStructure() {\n\n \/\/ Output log File\n const std::string lLogFilename (\"testMPLStructure.log\");\n \n \/\/ Set the log parameters\n std::ofstream logOutputFile;\n\n \/\/ Open and clean the log outputfile\n logOutputFile.open (lLogFilename.c_str());\n logOutputFile.clear();\n \n \/\/ Initialise the stdair BOM\n const stdair::BasLogParams lLogParams (stdair::LOG::DEBUG, logOutputFile);\n stdair::STDAIR_Service stdairService (lLogParams);\n \n \/\/ DEBUG\n STDAIR_LOG_DEBUG (\"StdAir service initialised\");\n \n typedef boost::mpl::vector<stdair_test::BookingClass> MPL_BookingClass;\n typedef boost::mpl::push_back<MPL_BookingClass,\n stdair_test::Cabin>::type types;\n\n const stdair_test::BookingClass lA (\"A\");\n const stdair_test::Cabin lCabin (lA);\n\n \/\/ lCabin::type\n if (boost::is_same<stdair_test::BookingClass,\n stdair_test::Cabin::child>::value) {\n STDAIR_LOG_DEBUG (\"The type of the child of a Cabin is a BookingClass\");\n\n } else {\n STDAIR_LOG_DEBUG (\"The type of \" << lCabin.toString()\n << \" is unknown\");\n }\n \n if (boost::is_same<boost::mpl::at_c<types, 1>::type,\n stdair_test::Cabin>::value) {\n STDAIR_LOG_DEBUG (\"The 2nd type is STDAIR::Cabin\");\n \n } else {\n STDAIR_LOG_ERROR (\"Problem!\");\n }\n\nBOOST_MPL_ASSERT ((boost::is_same<boost::mpl::at_c<types, 1>::type,\n stdair_test::Cabin>));\n}\n\n\/\/ \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nvoid StdairTestLib::testServiceInitialisation() {\n\n \/\/ Output log File\n const std::string lLogFilename (\"testServiceInitialisation.log\");\n \n \/\/ Set the log parameters\n std::ofstream logOutputFile;\n \n \/\/ Open and clean the log outputfile\n logOutputFile.open (lLogFilename.c_str());\n logOutputFile.clear();\n \n \/\/ Initialise the stdair BOM\n const stdair::BasLogParams lLogParams (stdair::LOG::DEBUG, logOutputFile);\n stdair::STDAIR_Service stdairService (lLogParams);\n\n \/\/ DEBUG\n STDAIR_LOG_DEBUG (\"StdAir service initialised\");\n}\n\n\/\/ \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nvoid StdairTestLib::testBomStructureInstantiation() {\n \n \/\/ Test create objects.\n \n \/\/ Output log File\n std::string lLogFilename (\"testBomStructureInstantiation.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 const stdair::BasLogParams lLogParams (stdair::LOG::DEBUG, logOutputFile);\n stdair::STDAIR_Service stdairService (lLogParams);\n \n \/\/ DEBUG\n STDAIR_LOG_DEBUG (\"StdAir service initialised\");\n\n \/\/ Step 0.0: initialisation\n \/\/ Create the root of the Bom tree (i.e., a BomRoot object)\n stdair::BomRoot& lBomRoot =\n stdair::FacBomContent::instance().create<stdair::BomRoot>();\n \n \n \/\/ Step 0.1: Inventory level\n \/\/ Create an Inventory (BA)\n const stdair::AirlineCode_T lAirlineCode (\"BA\");\n stdair::InventoryKey_T lInventoryKey (lAirlineCode);\n\n stdair::Inventory& lInventory =\n stdair::FacBomContent::instance().create<stdair::Inventory>(lInventoryKey);\n stdair::FacBomContent::linkWithParent (lInventory, lBomRoot);\n\n \/\/ Display the inventory\n STDAIR_LOG_DEBUG (\"Inventory: \" << lInventory.toString());\n \n \/\/ Step 0.2: Flight-date level\n \/\/ Create a FlightDate (BA15\/10-JUN-2010)\n const stdair::FlightNumber_T lFlightNumber = 15;\n const stdair::Date_T lDate (2010, 6, 10);\n stdair::FlightDateKey_T lFlightDateKey (lFlightNumber, lDate);\n\n stdair::FlightDate& lFlightDate = stdair::FacBomContent::\n instance().create<stdair::FlightDate> (lFlightDateKey);\n stdair::FacBomContent::linkWithParent (lFlightDate, lInventory);\n \n \/\/ Display the flight-date\n STDAIR_LOG_DEBUG (\"FlightDate: \" << lFlightDate.toString());\n \n \/\/ Step 0.3: Segment-date level\n \/\/ Create a first SegmentDate (LHR-SYD)\n const stdair::AirportCode_T lLHR (\"LHR\");\n const stdair::AirportCode_T lSYD (\"SYD\");\n stdair::SegmentDateKey_T lSegmentDateKey (lLHR, lSYD);\n\n stdair::SegmentDate& lLHRSYDSegment =\n stdair::FacBomContent::\n instance().create<stdair::SegmentDate> (lSegmentDateKey);\n stdair::FacBomContent::linkWithParent (lLHRSYDSegment, lFlightDate);\n\n \/\/ Display the segment-date\n STDAIR_LOG_DEBUG (\"SegmentDate: \" << lLHRSYDSegment.toString());\n\n\n \/\/ Create a second SegmentDate (LHR-BKK)\n const stdair::AirportCode_T lBKK (\"BKK\");\n lSegmentDateKey = stdair::SegmentDateKey_T (lLHR, lBKK);\n\n stdair::SegmentDate& lLHRBKKSegment =\n stdair::FacBomContent::\n instance().create<stdair::SegmentDate> (lSegmentDateKey);\n stdair::FacBomContent::linkWithParent (lLHRBKKSegment, lFlightDate);\n\n \/\/ Display the segment-date\n STDAIR_LOG_DEBUG (\"SegmentDate: \" << lLHRBKKSegment.toString());\n\n\n \/\/ Create a third SegmentDate (BKK-SYD)\n lSegmentDateKey = stdair::SegmentDateKey_T (lBKK, lSYD);\n\n stdair::SegmentDate& lBKKSYDSegment =\n stdair::FacBomContent::\n instance().create<stdair::SegmentDate> (lSegmentDateKey);\n stdair::FacBomContent::linkWithParent (lBKKSYDSegment, lFlightDate);\n\n \/\/ Display the segment-date\n STDAIR_LOG_DEBUG (\"SegmentDate: \" << lBKKSYDSegment.toString());\n\n \n \/\/ Step 0.4: Leg-date level\n \/\/ Create a first LegDate (LHR)\n stdair::LegDateKey_T lLegDateKey (lLHR);\n\n stdair::LegDate& lLHRLeg =\n stdair::FacBomContent::instance().create<stdair::LegDate> (lLegDateKey);\n stdair::FacBomContent::linkWithParent<stdair::LegDate>(lLHRLeg, lFlightDate);\n\n \/\/ Display the leg-date\n STDAIR_LOG_DEBUG (\"LegDate: \" << lLHRLeg.toString());\n \n \/\/ Create a second LegDate (BKK)\n lLegDateKey = stdair::LegDateKey_T (lBKK);\n\n stdair::LegDate& lBKKLeg =\n stdair::FacBomContent::instance().create<stdair::LegDate> (lLegDateKey);\n stdair::FacBomContent::linkWithParent (lBKKLeg, lFlightDate);\n\n \/\/ Display the leg-date\n STDAIR_LOG_DEBUG (\"LegDate: \" << lBKKLeg.toString());\n\n \/\/ Step 0.5: segment-cabin level\n \/\/ Create a SegmentCabin (Y) of the Segment LHR-BKK;\n const stdair::CabinCode_T lY (\"Y\");\n stdair::SegmentCabinKey_T lYSegmentCabinKey (lY);\n\n stdair::SegmentCabin& lLHRBKKSegmentYCabin =\n stdair::FacBomContent::\n instance().create<stdair::SegmentCabin> (lYSegmentCabinKey);\n stdair::FacBomContent::\n linkWithParent (lLHRBKKSegmentYCabin, lLHRBKKSegment);\n\n \/\/ Display the segment-cabin\n STDAIR_LOG_DEBUG (\"SegmentCabin: \" << lLHRBKKSegmentYCabin.toString());\n\n \/\/ Create a SegmentCabin (Y) of the Segment BKK-SYD;\n stdair::SegmentCabin& lBKKSYDSegmentYCabin =\n stdair::FacBomContent::\n instance().create<stdair::SegmentCabin> (lYSegmentCabinKey);\n stdair::FacBomContent::\n linkWithParent (lBKKSYDSegmentYCabin, lBKKSYDSegment);\n \n \/\/ Display the segment-cabin\n STDAIR_LOG_DEBUG (\"SegmentCabin: \" << lBKKSYDSegmentYCabin.toString());\n\n \/\/ Create a SegmentCabin (Y) of the Segment LHR-SYD;\n stdair::SegmentCabin& lLHRSYDSegmentYCabin =\n stdair::FacBomContent::\n instance().create<stdair::SegmentCabin> (lYSegmentCabinKey);\n stdair::FacBomContent::\n linkWithParent (lLHRSYDSegmentYCabin, lLHRSYDSegment);\n \n \/\/ Display the segment-cabin\n STDAIR_LOG_DEBUG (\"SegmentCabin: \" << lLHRSYDSegmentYCabin.toString());\n\n \n \/\/ Step 0.6: leg-cabin level\n \/\/ Create a LegCabin (Y) of the Leg LHR-BKK;\n stdair::LegCabinKey_T lYLegCabinKey (lY);\n\n stdair::LegCabin& lLHRLegYCabin =\n stdair::FacBomContent::instance().create<stdair::LegCabin> (lYLegCabinKey);\n stdair::FacBomContent::linkWithParent (lLHRLegYCabin, lLHRLeg);\n\n \/\/ Display the leg-cabin\n STDAIR_LOG_DEBUG (\"LegCabin: \" << lLHRLegYCabin.toString());\n\n \/\/ Create a LegCabin (Y) of the Leg BKK-SYD;\n stdair::LegCabin& lBKKLegYCabin =\n stdair::FacBomContent::instance().create<stdair::LegCabin> (lYLegCabinKey);\n stdair::FacBomContent::linkWithParent (lBKKLegYCabin, lBKKLeg);\n\n \/\/ Display the leg-cabin\n STDAIR_LOG_DEBUG (\"LegCabin: \" << lBKKLegYCabin.toString());\n\n \/\/ Step 0.7: booking class level\n \/\/ Create a BookingClass (Q) of the Segment LHR-BKK, cabin Y;\n const stdair::ClassCode_T lQ (\"Q\");\n stdair::BookingClassKey_T lQBookingClassKey (lQ);\n\n stdair::BookingClass& lLHRBKKSegmentYCabinQClass =\n stdair::FacBomContent::\n instance().create<stdair::BookingClass> (lQBookingClassKey);\n stdair::FacBomContent::\n linkWithParent (lLHRBKKSegmentYCabinQClass, lLHRBKKSegmentYCabin);\n\n \/\/ Display the booking class\n STDAIR_LOG_DEBUG (\"BookingClass: \"\n << lLHRBKKSegmentYCabinQClass.toString());\n\n \/\/ Browse the BomRoot and display the created objects.\n STDAIR_LOG_DEBUG (\"Browse the BomRoot\");\n \n const stdair::InventoryList_T& lInventoryList = lBomRoot.getInventoryList();\n for (stdair::InventoryList_T::iterator itInv = lInventoryList.begin();\n itInv != lInventoryList.end(); ++itInv) {\n const stdair::Inventory& lCurrentInventory = *itInv;\n STDAIR_LOG_DEBUG (\"Inventory: \" << lCurrentInventory.toString());\n \n const stdair::FlightDateMap_T& lFlightDateMap = \n lCurrentInventory.getFlightDateMap ();\n for (stdair::FlightDateMap_T::iterator itFlightDate = \n lFlightDateMap.begin();\n itFlightDate != lFlightDateMap.end(); ++itFlightDate) {\n const stdair::FlightDate* lCurrentFlightDate = itFlightDate->second;\n STDAIR_LOG_DEBUG (\"FlightDate: \" << lCurrentFlightDate->describeKey());\n }\n }\n \n \/\/ Close the Log outputFile\n logOutputFile.close();\n}\n\n\/\/ \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nbool StdairTestLib::testErrorCase() {\n return false;\n}\n<commit_msg>[dev] Adapted to the new stdair.<commit_after>\/\/ \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ Import section\n\/\/ \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ STL\n#include <iostream>\n#include <fstream>\n#include <string>\n\/\/ MPL\n#include <boost\/mpl\/push_back.hpp>\n#include <boost\/mpl\/vector.hpp>\n#include <boost\/mpl\/at.hpp>\n#include <boost\/mpl\/assert.hpp>\n#include <boost\/type_traits\/is_same.hpp>\n\/\/ StdAir\n#include <stdair\/STDAIR_Service.hpp>\n#include <stdair\/STDAIR_Types.hpp>\n#include <stdair\/service\/Logger.hpp>\n#include <test\/stdair\/StdairTestLib.hpp>\n\n\/**\n * Namespace gathering classes and structures for test purposes\n *\/\nnamespace stdair_test {\n \n \/** BookingClass *\/\n struct BookingClass {\n std::string _classCode;\n \/** Constructor. *\/\n BookingClass (const std::string& iClassCode)\n : _classCode (iClassCode) {\n }\n \n \/** Display .*\/\n std::string toString() const {\n std::ostringstream oStr;\n oStr << _classCode;\n return oStr.str();\n }\n };\n \n \/** Cabin *\/\n struct Cabin {\n BookingClass _bookingClass;\n Cabin (const BookingClass& iBkgClass)\n : _bookingClass (iBkgClass) {\n }\n \n \/** Display .*\/\n std::string toString() const {\n std::ostringstream oStr;\n oStr << _bookingClass._classCode;\n return oStr.str();\n }\n \n \/** Child type. *\/\n typedef BookingClass child;\n };\n}\n\n\/\/ \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nvoid StdairTestLib::testMPLStructure() {\n\n \/\/ Output log File\n const std::string lLogFilename (\"testMPLStructure.log\");\n \n \/\/ Set the log parameters\n std::ofstream logOutputFile;\n\n \/\/ Open and clean the log outputfile\n logOutputFile.open (lLogFilename.c_str());\n logOutputFile.clear();\n \n \/\/ Initialise the stdair BOM\n const stdair::BasLogParams lLogParams (stdair::LOG::DEBUG, logOutputFile);\n stdair::STDAIR_Service stdairService (lLogParams);\n \n \/\/ DEBUG\n STDAIR_LOG_DEBUG (\"StdAir service initialised\");\n \n typedef boost::mpl::vector<stdair_test::BookingClass> MPL_BookingClass;\n typedef boost::mpl::push_back<MPL_BookingClass,\n stdair_test::Cabin>::type types;\n\n const stdair_test::BookingClass lA (\"A\");\n const stdair_test::Cabin lCabin (lA);\n\n \/\/ lCabin::type\n if (boost::is_same<stdair_test::BookingClass,\n stdair_test::Cabin::child>::value) {\n STDAIR_LOG_DEBUG (\"The type of the child of a Cabin is a BookingClass\");\n\n } else {\n STDAIR_LOG_DEBUG (\"The type of \" << lCabin.toString()\n << \" is unknown\");\n }\n \n if (boost::is_same<boost::mpl::at_c<types, 1>::type,\n stdair_test::Cabin>::value) {\n STDAIR_LOG_DEBUG (\"The 2nd type is STDAIR::Cabin\");\n \n } else {\n STDAIR_LOG_ERROR (\"Problem!\");\n }\n\nBOOST_MPL_ASSERT ((boost::is_same<boost::mpl::at_c<types, 1>::type,\n stdair_test::Cabin>));\n}\n\n\/\/ \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nvoid StdairTestLib::testServiceInitialisation() {\n\n \/\/ Output log File\n const std::string lLogFilename (\"testServiceInitialisation.log\");\n \n \/\/ Set the log parameters\n std::ofstream logOutputFile;\n \n \/\/ Open and clean the log outputfile\n logOutputFile.open (lLogFilename.c_str());\n logOutputFile.clear();\n \n \/\/ Initialise the stdair BOM\n const stdair::BasLogParams lLogParams (stdair::LOG::DEBUG, logOutputFile);\n stdair::STDAIR_Service stdairService (lLogParams);\n\n \/\/ DEBUG\n STDAIR_LOG_DEBUG (\"StdAir service initialised\");\n}\n\n\/\/ \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nvoid StdairTestLib::testBomStructureInstantiation() {\n \n \/\/ Test create objects.\n \n \/\/ Output log File\n std::string lLogFilename (\"testBomStructureInstantiation.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 const stdair::BasLogParams lLogParams (stdair::LOG::DEBUG, logOutputFile);\n stdair::STDAIR_Service stdairService (lLogParams);\n \n \/\/ DEBUG\n STDAIR_LOG_DEBUG (\"StdAir service initialised\");\n \n \/\/ Close the Log outputFile\n logOutputFile.close();\n}\n\n\/\/ \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nbool StdairTestLib::testErrorCase() {\n return false;\n}\n<|endoftext|>"} {"text":"<commit_before>#include \"storage\/diff_scheme\/diff_manager.hpp\"\n#include \"storage\/diff_scheme\/diff_scheme_checker.hpp\"\n\n#include \"platform\/platform.hpp\"\n\n#include \"coding\/internal\/file_data.hpp\"\n\n#include \"base\/assert.hpp\"\n#include \"base\/cancellable.hpp\"\n\n#include <algorithm>\n\n#include \"3party\/Alohalytics\/src\/alohalytics.h\"\n\nnamespace\n{\nbool IsDiffsAvailable(storage::diffs::NameDiffInfoMap const & diffs)\n{\n return std::any_of(diffs.cbegin(), diffs.cend(),\n [](auto const & d) { return d.second.m_isApplied == false; });\n}\n} \/\/ namespace\n\nnamespace storage\n{\nnamespace diffs\n{\nvoid Manager::Load(LocalMapsInfo && info)\n{\n LocalMapsInfo localMapsInfo = info;\n {\n std::lock_guard<std::mutex> lock(m_mutex);\n m_localMapsInfo = std::move(info);\n }\n\n m_workerThread.Push([this, localMapsInfo] {\n NameDiffInfoMap diffs = Checker::Check(localMapsInfo);\n\n std::lock_guard<std::mutex> lock(m_mutex);\n\n m_diffs = std::move(diffs);\n if (m_diffs.empty())\n {\n m_status = Status::NotAvailable;\n\n alohalytics::Stats::Instance().LogEvent(\"Downloader_DiffScheme_OnStart_fallback\");\n }\n else\n {\n m_status = Status::Available;\n }\n\n auto & observers = m_observers;\n auto status = m_status;\n GetPlatform().RunTask(Platform::Thread::Gui, [observers, status]() mutable {\n observers.ForEach(&Observer::OnDiffStatusReceived, status);\n });\n });\n}\n\nvoid Manager::ApplyDiff(ApplyDiffParams && p, base::Cancellable const & cancellable,\n Manager::OnDiffApplicationFinished const & task)\n{\n using namespace generator::mwm_diff;\n\n m_workerThread.Push([this, p, &cancellable, task] {\n CHECK(p.m_diffFile, ());\n CHECK(p.m_oldMwmFile, ());\n\n auto & diffReadyPath = p.m_diffReadyPath;\n auto & diffFile = p.m_diffFile;\n auto const diffPath = diffFile->GetPath(MapOptions::Diff);\n auto result = DiffApplicationResult::Failed;\n\n diffFile->SyncWithDisk();\n\n auto const isOnDisk = diffFile->OnDisk(MapOptions::Diff);\n auto const isFilePrepared = isOnDisk || base::RenameFileX(diffReadyPath, diffPath);\n\n if (isFilePrepared)\n {\n \/\/ Sync with disk after renaming.\n if (!isOnDisk)\n diffFile->SyncWithDisk();\n\n string const oldMwmPath = p.m_oldMwmFile->GetPath(MapOptions::Map);\n string const newMwmPath = diffFile->GetPath(MapOptions::Map);\n string const diffApplyingInProgressPath = newMwmPath + DIFF_APPLYING_FILE_EXTENSION;\n\n result = generator::mwm_diff::ApplyDiff(oldMwmPath, diffApplyingInProgressPath, diffPath,\n cancellable);\n if (result == DiffApplicationResult::Ok &&\n !base::RenameFileX(diffApplyingInProgressPath, newMwmPath))\n {\n result = DiffApplicationResult::Failed;\n }\n\n base::DeleteFileX(diffApplyingInProgressPath);\n\n if (result != DiffApplicationResult::Ok)\n Platform::RemoveFileIfExists(newMwmPath);\n }\n\n switch (result)\n {\n case DiffApplicationResult::Ok:\n {\n diffFile->DeleteFromDisk(MapOptions::Diff);\n break;\n }\n case DiffApplicationResult::Cancelled:\n \/\/ The diff file will be deleted by storage.\n \/\/ Another way would be to leave it on disk but all consequences\n \/\/ of interacting with storage are much harder to be taken into account that way.\n break;\n case DiffApplicationResult::Failed:\n {\n diffFile->DeleteFromDisk(MapOptions::Diff);\n alohalytics::Stats::Instance().LogEvent(\n \"Downloader_DiffScheme_error\",\n {{\"type\", \"patching\"},\n {\"error\", isFilePrepared ? \"Cannot apply diff\" : \"Cannot prepare file\"}});\n\n std::lock_guard<std::mutex> lock(m_mutex);\n m_status = Status::NotAvailable;\n break;\n }\n }\n\n task(result);\n });\n}\n\nStatus Manager::GetStatus() const\n{\n std::lock_guard<std::mutex> lock(m_mutex);\n return m_status;\n}\n\nbool Manager::SizeFor(storage::CountryId const & countryId, uint64_t & size) const\n{\n std::lock_guard<std::mutex> lock(m_mutex);\n if (m_status != Status::Available)\n return false;\n\n auto const it = m_diffs.find(countryId);\n if (it == m_diffs.cend())\n return false;\n\n size = it->second.m_size;\n return true;\n}\n\nbool Manager::SizeToDownloadFor(storage::CountryId const & countryId, uint64_t & size) const\n{\n return WithNotAppliedDiff(countryId, [&size](DiffInfo const & info) { size = info.m_size; });\n}\n\nbool Manager::VersionFor(storage::CountryId const & countryId, uint64_t & v) const\n{\n return WithNotAppliedDiff(countryId, [&v](DiffInfo const & info) { v = info.m_version; });\n}\n\nbool Manager::HasDiffFor(storage::CountryId const & countryId) const\n{\n return WithNotAppliedDiff(countryId, [](DiffInfo const &) {});\n}\n\nvoid Manager::MarkAsApplied(storage::CountryId const & countryId)\n{\n std::lock_guard<std::mutex> lock(m_mutex);\n auto const it = m_diffs.find(countryId);\n if (it == m_diffs.end())\n return;\n\n it->second.m_isApplied = true;\n\n if (!IsDiffsAvailable(m_diffs))\n m_status = Status::NotAvailable;\n}\n\nvoid Manager::RemoveDiffForCountry(storage::CountryId const & countryId)\n{\n std::lock_guard<std::mutex> lock(m_mutex);\n m_diffs.erase(countryId);\n\n if (m_diffs.empty() || !IsDiffsAvailable(m_diffs))\n m_status = Status::NotAvailable;\n}\n\nvoid Manager::AbortDiffScheme()\n{\n std::lock_guard<std::mutex> lock(m_mutex);\n m_status = Status::NotAvailable;\n m_diffs.clear();\n}\n\nbool Manager::IsPossibleToAutoupdate() const\n{\n std::lock_guard<std::mutex> lock(m_mutex);\n\n if (m_status != Status::Available)\n return false;\n\n for (auto const & nameVersion : m_localMapsInfo.m_localMaps)\n {\n auto const it = m_diffs.find(nameVersion.first);\n if (it == m_diffs.end() || it->second.m_isApplied)\n return false;\n }\n return true;\n}\n} \/\/ namespace diffs\n} \/\/ namespace storage\n<commit_msg>[storage][android] review fixes<commit_after>#include \"storage\/diff_scheme\/diff_manager.hpp\"\n#include \"storage\/diff_scheme\/diff_scheme_checker.hpp\"\n\n#include \"platform\/platform.hpp\"\n\n#include \"coding\/internal\/file_data.hpp\"\n\n#include \"base\/assert.hpp\"\n#include \"base\/cancellable.hpp\"\n\n#include <algorithm>\n\n#include \"3party\/Alohalytics\/src\/alohalytics.h\"\n\nnamespace\n{\nbool IsDiffsAvailable(storage::diffs::NameDiffInfoMap const & diffs)\n{\n return std::any_of(diffs.cbegin(), diffs.cend(),\n [](auto const & d) { return d.second.m_isApplied == false; });\n}\n} \/\/ namespace\n\nnamespace storage\n{\nnamespace diffs\n{\nvoid Manager::Load(LocalMapsInfo && info)\n{\n LocalMapsInfo localMapsInfo = info;\n {\n std::lock_guard<std::mutex> lock(m_mutex);\n m_localMapsInfo = std::move(info);\n }\n\n m_workerThread.Push([this, localMapsInfo] {\n NameDiffInfoMap diffs = Checker::Check(localMapsInfo);\n\n std::lock_guard<std::mutex> lock(m_mutex);\n\n m_diffs = std::move(diffs);\n if (m_diffs.empty())\n {\n m_status = Status::NotAvailable;\n\n alohalytics::Stats::Instance().LogEvent(\"Downloader_DiffScheme_OnStart_fallback\");\n }\n else\n {\n m_status = Status::Available;\n }\n\n auto & observers = m_observers;\n auto status = m_status;\n GetPlatform().RunTask(Platform::Thread::Gui, [observers, status]() mutable {\n observers.ForEach(&Observer::OnDiffStatusReceived, status);\n });\n });\n}\n\nvoid Manager::ApplyDiff(ApplyDiffParams && p, base::Cancellable const & cancellable,\n Manager::OnDiffApplicationFinished const & task)\n{\n using namespace generator::mwm_diff;\n\n m_workerThread.Push([this, p, &cancellable, task] {\n CHECK(p.m_diffFile, ());\n CHECK(p.m_oldMwmFile, ());\n\n auto & diffReadyPath = p.m_diffReadyPath;\n auto & diffFile = p.m_diffFile;\n auto const diffPath = diffFile->GetPath(MapOptions::Diff);\n auto result = DiffApplicationResult::Failed;\n\n diffFile->SyncWithDisk();\n\n auto const isOnDisk = diffFile->OnDisk(MapOptions::Diff);\n auto const isFilePrepared = isOnDisk || base::RenameFileX(diffReadyPath, diffPath);\n\n if (isFilePrepared)\n {\n \/\/ Sync with disk after renaming.\n if (!isOnDisk)\n diffFile->SyncWithDisk();\n\n string const oldMwmPath = p.m_oldMwmFile->GetPath(MapOptions::Map);\n string const newMwmPath = diffFile->GetPath(MapOptions::Map);\n string const diffApplyingInProgressPath = newMwmPath + DIFF_APPLYING_FILE_EXTENSION;\n\n result = generator::mwm_diff::ApplyDiff(oldMwmPath, diffApplyingInProgressPath, diffPath,\n cancellable);\n if (result == DiffApplicationResult::Ok &&\n !base::RenameFileX(diffApplyingInProgressPath, newMwmPath))\n {\n result = DiffApplicationResult::Failed;\n }\n\n base::DeleteFileX(diffApplyingInProgressPath);\n\n if (result != DiffApplicationResult::Ok)\n Platform::RemoveFileIfExists(newMwmPath);\n }\n\n switch (result)\n {\n case DiffApplicationResult::Ok:\n {\n diffFile->DeleteFromDisk(MapOptions::Diff);\n break;\n }\n case DiffApplicationResult::Cancelled:\n \/\/ The diff file will be deleted by storage.\n \/\/ Another way would be to leave it on disk but all consequences\n \/\/ of interacting with storage are much harder to be taken into account that way.\n break;\n case DiffApplicationResult::Failed:\n {\n diffFile->DeleteFromDisk(MapOptions::Diff);\n alohalytics::Stats::Instance().LogEvent(\n \"Downloader_DiffScheme_error\",\n {{\"type\", \"patching\"},\n {\"error\", isFilePrepared ? \"Cannot apply diff\" : \"Cannot prepare file\"}});\n\n std::lock_guard<std::mutex> lock(m_mutex);\n m_status = Status::NotAvailable;\n break;\n }\n }\n\n task(result);\n });\n}\n\nStatus Manager::GetStatus() const\n{\n std::lock_guard<std::mutex> lock(m_mutex);\n return m_status;\n}\n\nbool Manager::SizeFor(storage::CountryId const & countryId, uint64_t & size) const\n{\n std::lock_guard<std::mutex> lock(m_mutex);\n if (m_status != Status::Available)\n return false;\n\n auto const it = m_diffs.find(countryId);\n if (it == m_diffs.cend())\n return false;\n\n size = it->second.m_size;\n return true;\n}\n\nbool Manager::SizeToDownloadFor(storage::CountryId const & countryId, uint64_t & size) const\n{\n return WithNotAppliedDiff(countryId, [&size](DiffInfo const & info) { size = info.m_size; });\n}\n\nbool Manager::VersionFor(storage::CountryId const & countryId, uint64_t & v) const\n{\n return WithNotAppliedDiff(countryId, [&v](DiffInfo const & info) { v = info.m_version; });\n}\n\nbool Manager::HasDiffFor(storage::CountryId const & countryId) const\n{\n return WithNotAppliedDiff(countryId, [](DiffInfo const &) {});\n}\n\nvoid Manager::MarkAsApplied(storage::CountryId const & countryId)\n{\n std::lock_guard<std::mutex> lock(m_mutex);\n auto it = m_diffs.find(countryId);\n if (it == m_diffs.end())\n return;\n\n it->second.m_isApplied = true;\n\n if (!IsDiffsAvailable(m_diffs))\n m_status = Status::NotAvailable;\n}\n\nvoid Manager::RemoveDiffForCountry(storage::CountryId const & countryId)\n{\n std::lock_guard<std::mutex> lock(m_mutex);\n m_diffs.erase(countryId);\n\n if (m_diffs.empty() || !IsDiffsAvailable(m_diffs))\n m_status = Status::NotAvailable;\n}\n\nvoid Manager::AbortDiffScheme()\n{\n std::lock_guard<std::mutex> lock(m_mutex);\n m_status = Status::NotAvailable;\n m_diffs.clear();\n}\n\nbool Manager::IsPossibleToAutoupdate() const\n{\n std::lock_guard<std::mutex> lock(m_mutex);\n\n if (m_status != Status::Available)\n return false;\n\n for (auto const & nameVersion : m_localMapsInfo.m_localMaps)\n {\n auto const it = m_diffs.find(nameVersion.first);\n if (it == m_diffs.cend() || it->second.m_isApplied)\n return false;\n }\n return true;\n}\n} \/\/ namespace diffs\n} \/\/ namespace storage\n<|endoftext|>"} {"text":"<commit_before>server {\n listen 80;\n server_name youth.cc;\n\n charset utf-8;\n root \/home\/work\/dev\/app\/youth\/public;\n\n access_log logs\/youth.app.access.log main;\n\n location \/ {\n index index.html index.htm index.php;\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 break;\n }\n\n # 静态文件设置过期时间\n location ~* \\.(ico|css|js|gif|jpe?g|png)(\\?[0-9]+)?$ {\n expires 100d;\n break;\n }\n\n # pass the PHP scripts to FastCGI server listening on 127.0.0.1:9000\n #location ~ \\.php$ {\n # 其他请求一律单一入口处理\n location ~ \/ {\n rewrite \"^(.*)$\" \/index.php break;\n fastcgi_pass 127.0.0.1:9000;\n fastcgi_index index.php;\n fastcgi_param SCRIPT_FILENAME $document_root\/$fastcgi_script_name;\n include fastcgi_params;\n }\n}\n<commit_msg>add 参考配置<commit_after>server {\n listen 80;\n server_name youth.cc;\n\n charset utf-8;\n root \/home\/work\/dev\/app\/youth\/public;\n\n access_log logs\/youth.app.access.log main;\n\n location \/ {\n index index.html index.htm index.php;\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 break;\n }\n\n # 静态文件设置过期时间\n location ~* \\.(ico|css|js|gif|jpe?g|png)(\\?[0-9]+)?$ {\n expires 100d;\n break;\n }\n\n location ~ \/chart.php {\n fastcgi_pass 127.0.0.1:9000;\n fastcgi_param SCRIPT_FILENAME \/home\/work\/rd\/analyze\/chart.php;\n include fastcgi_params;\n }\n\n # pass the PHP scripts to FastCGI server listening on 127.0.0.1:9000\n #location ~ \\.php$ {\n # 其他请求一律单一入口处理\n location ~ \/ {\n rewrite \"^(.*)$\" \/index.php break;\n fastcgi_pass 127.0.0.1:9000;\n fastcgi_index index.php;\n fastcgi_param SCRIPT_FILENAME $document_root\/$fastcgi_script_name;\n include fastcgi_params;\n }\n}\n<|endoftext|>"} {"text":"<commit_before>#include \"moduleProcessing.h\"\n#include <vector>\n\nusing namespace std;\n\nmoduleProcessing::moduleProcessing(){\n\t\t\tE = 0.49f;\n\t\t\tF = 0.45f;\n\t\t\tFsharp = 0.41f;\n\t\t\tG = 0.37f;\n\t\t\tGsharp = 0.33f;\n\t\t\tA = 0.29f;\n\t\t\tAsharp = 0.25f;\n\t\t\tB = 0.21f;\n\t\t\tC = 0.17f;\n\t\t\tCsharp = 0.13f;\n\t\t\tD = 0.9f;\n\t\t\tDsharp = 0.05f;\n\n\t\t\tboxSize = 0.05f;\n\t\t\tmaxDistance = 0.01f;\n}\n\n\nvoid moduleProcessing::calculateTone(HandsHip *handship){\n\tVector4 chordHand = handship->chordHandPosition;\n\tVector4 hip = handship->hipPosition;\n\n\tfloat distance = (chordHand.x-hip.x)*(chordHand.x-hip.x) + (chordHand.y-hip.y)*(chordHand.y-hip.y);\n\n\tif(distance>E){\n\t\tthis->tone = 0;\n\t}else if(distance>F){\n\t\tthis->tone = 1;\n\t}else if(distance>Fsharp){\n\t\tthis->tone = 2;\n\t}else if(distance>G){\n\t\tthis->tone = 3;\n\t}else if(distance>Gsharp){\n\t\tthis->tone = 4;\n\t}else if(distance>A){\n\t\tthis->tone = 5;\n\t}else if(distance>Asharp){\n\t\tthis->tone = 6;\n\t}else if(distance>B){\n\t\tthis->tone = 7;\n\t}else if(distance>C){\n\t\tthis->tone = 8;\n\t}else if(distance>Csharp){\n\t\tthis->tone = 9;\n\t}else if(distance>D){\n\t\tthis->tone = 10;\n\t}else if(distance>Dsharp){\n\t\tthis->tone = 11;\n\t}\n}\n\nvoid moduleProcessing::calculateVolume(HandsHip *handship){\n\tVector4 playingHand = handship->playingHandPosition;\n\n\tfloat distance = (playingHand.x-lastPlayingHand.x)*(playingHand.x-lastPlayingHand.x) + (playingHand.y-lastPlayingHand.y)*(playingHand.y-lastPlayingHand.y);\n\n\tif(distance>maxDistance){\n\t\tthis->volume = 1.0;\n\t}else{\n\t\tthis->volume = distance\/maxDistance;\n\t}\n\tlastPlayingHand = playingHand;\n}\n\nfloat moduleProcessing::distance(HandsHip *handship){\n\tVector4 chordHand = handship->chordHandPosition;\n\tVector4 hip = handship->hipPosition;\n\n\tfloat distance = (chordHand.x-hip.x)*(chordHand.x-hip.x) + (chordHand.y-hip.y)*(chordHand.y-hip.y);\n\n\treturn distance;\n}\n\nbool moduleProcessing::playedNote(HandsHip *handship){\n\tVector4 hip = handship->hipPosition;\n\tVector4 playingHand = handship->playingHandPosition;\n\n\tfloat ax = hip.x-boxSize,\n\t\tay = hip.y-boxSize,\n\t\tbx = hip.x+boxSize,\n\t\tby = hip.y-boxSize,\n\t\tdx = hip.x+boxSize,\n\t\tdy = hip.y+boxSize;\n\n\tfloat bax = bx - ax,\n\t\tbay = by - ay,\n\t\tdax = dx - ax,\n\t\tday = dy -ay;\n\n\n\tisOnPlayingArea = true;\n\n\tif ((playingHand.x - ax) * bax + (playingHand.y - ay) * bay < 0.0) this->isOnPlayingArea = false;\n\tif ((playingHand.x - bx) * bax + (playingHand.y - by) * bay > 0.0) this->isOnPlayingArea = false;\n\tif ((playingHand.x - ax) * dax + (playingHand.y - ay) * day < 0.0) this->isOnPlayingArea = false;\n\tif ((playingHand.x - dx) * dax + (playingHand.y - dy) * day > 0.0) this->isOnPlayingArea = false;\n\n\n\tif(isOnPlayingArea && !notePlayed){\n\t\tnotePlayed = true;\n\t\treturn true;\n\t}\n\t\n\tif(!isOnPlayingArea) notePlayed = false;\n\n\treturn false;\n}<commit_msg>Fixed conflict<commit_after>#include \"moduleProcessing.h\"\n#include <vector>\n\nusing namespace std;\n\nmoduleProcessing::moduleProcessing(){\n\t\t\tE = 0.49f;\n\t\t\tF = 0.45f;\n\t\t\tFsharp = 0.41f;\n\t\t\tG = 0.37f;\n\t\t\tGsharp = 0.33f;\n\t\t\tA = 0.29f;\n\t\t\tAsharp = 0.25f;\n\t\t\tB = 0.21f;\n\t\t\tC = 0.17f;\n\t\t\tCsharp = 0.13f;\n\t\t\tD = 0.9f;\n\t\t\tDsharp = 0.05f;\n\n\t\t\tboxSize = 0.05f;\n\t\t\tmaxDistance = 0.01f;\n\n}\n\n\nvoid moduleProcessing::calculateTone(HandsHip *handship){\n\tVector4 chordHand = handship->chordHandPosition;\n\tVector4 hip = handship->hipPosition;\n\n\tfloat distance = (chordHand.x-hip.x)*(chordHand.x-hip.x) + (chordHand.y-hip.y)*(chordHand.y-hip.y);\n\n\tif(distance>E){\n\t\tthis->tone = 0;\n\t}else if(distance>F){\n\t\tthis->tone = 1;\n\t}else if(distance>Fsharp){\n\t\tthis->tone = 2;\n\t}else if(distance>G){\n\t\tthis->tone = 3;\n\t}else if(distance>Gsharp){\n\t\tthis->tone = 4;\n\t}else if(distance>A){\n\t\tthis->tone = 5;\n\t}else if(distance>Asharp){\n\t\tthis->tone = 6;\n\t}else if(distance>B){\n\t\tthis->tone = 7;\n\t}else if(distance>C){\n\t\tthis->tone = 8;\n\t}else if(distance>Csharp){\n\t\tthis->tone = 9;\n\t}else if(distance>D){\n\t\tthis->tone = 10;\n\t}else if(distance>Dsharp){\n\t\tthis->tone = 11;\n\t}\n}\n\nvoid moduleProcessing::calculateVolume(HandsHip *handship){\n\tVector4 playingHand = handship->playingHandPosition;\n\n\tfloat distance = (playingHand.x-lastPlayingHand.x)*(playingHand.x-lastPlayingHand.x) + (playingHand.y-lastPlayingHand.y)*(playingHand.y-lastPlayingHand.y);\n\n\tif(distance>maxDistance){\n\t\tthis->volume = 1.0;\n\t}else{\n\t\tthis->volume = distance\/maxDistance;\n\t}\n\tlastPlayingHand = playingHand;\n}\n\nfloat moduleProcessing::distance(HandsHip *handship){\n\tVector4 chordHand = handship->chordHandPosition;\n\tVector4 hip = handship->hipPosition;\n\n\tfloat distance = (chordHand.x-hip.x)*(chordHand.x-hip.x) + (chordHand.y-hip.y)*(chordHand.y-hip.y);\n\n\treturn distance;\n}\n\nbool moduleProcessing::playedNote(HandsHip *handship){\n\tVector4 hip = handship->hipPosition;\n\tVector4 playingHand = handship->playingHandPosition;\n\n\tfloat ax = hip.x-boxSize,\n\t\tay = hip.y-boxSize,\n\t\tbx = hip.x+boxSize,\n\t\tby = hip.y-boxSize,\n\t\tdx = hip.x+boxSize,\n\t\tdy = hip.y+boxSize;\n\n\tfloat bax = bx - ax,\n\t\tbay = by - ay,\n\t\tdax = dx - ax,\n\t\tday = dy -ay;\n\n\n\tisOnPlayingArea = true;\n\n\tif ((playingHand.x - ax) * bax + (playingHand.y - ay) * bay < 0.0) this->isOnPlayingArea = false;\n\tif ((playingHand.x - bx) * bax + (playingHand.y - by) * bay > 0.0) this->isOnPlayingArea = false;\n\tif ((playingHand.x - ax) * dax + (playingHand.y - ay) * day < 0.0) this->isOnPlayingArea = false;\n\tif ((playingHand.x - dx) * dax + (playingHand.y - dy) * day > 0.0) this->isOnPlayingArea = false;\n\n\n\tif(isOnPlayingArea && !notePlayed){\n\t\tnotePlayed = true;\n\t\treturn true;\n\t}\n\t\n\tif(!isOnPlayingArea) notePlayed = false;\n\n\treturn false;\n}<|endoftext|>"} {"text":"<commit_before>#include \"util\/ocl_helper.h\"\n#include \"util\/x_error.h\"\n#include <algorithm>\n#include <iostream>\n\nusing x_engine::ocl_error;\n\nvoid show_platform_info(const cl::Platform &);\nvoid init_cl_devices(std::priority_queue<std::shared_ptr<device>> &);\n\nstd::priority_queue<std::shared_ptr<device>> get_dev_queue() {\n std::priority_queue<std::shared_ptr<device>> q;\n init_cl_devices(q);\n if (q.size() < 1) {\n throw ocl_error(\"No OpenCL devices were found\");\n }\n return q;\n}\n\nsize_t get_device_count(const cl::Platform &p) {\n std::vector<cl::Device> devices;\n p.getDevices(CL_DEVICE_TYPE_ALL, &devices);\n return devices.size();\n}\n\nvoid init_cl_devices(std::priority_queue<std::shared_ptr<device>> &q) {\n cl_int err;\n cl::Context context;\n std::vector<cl::Platform> platform_list;\n err = cl::Platform::get(\n &platform_list); \/\/ TODO make check that returned value isn't error\n if (platform_list.size() < 1 || err != CL_SUCCESS) {\n throw ocl_error(\"No OpenCL platforms were found\");\n }\n \/\/ std::for_each(platform_list.begin(), platform_list.end(),\n \/\/ show_platform_info);\n auto it =\n std::max_element(platform_list.begin(), platform_list.end(),\n [](const cl::Platform &p1, const cl::Platform &p2) {\n return get_device_count(p1) < get_device_count(p2);\n });\n std::cout << \"Use platform\" << std::endl;\n show_platform_info(*it);\n cl_context_properties cprops[3] = {CL_CONTEXT_PLATFORM,\n (cl_context_properties)(*it)(), 0};\n context = cl::Context(CL_DEVICE_TYPE_ALL, cprops, NULL, NULL, &err);\n std::vector<cl::Device> devices;\n devices = context.getInfo<CL_CONTEXT_DEVICES>();\n \/\/ std::distance(platform_list, it);\n for (size_t i = 0; i < devices.size(); ++i) {\n std::shared_ptr<device> d(new device(devices[i], 0, i));\n q.push(d);\n std::cout << \"Init device \" << d->name << std::endl;\n }\n}\n\nvoid show_platform_info(const cl::Platform &platform) {\n \/\/ Get OpenCL platform name and version\n std::cout << \"Platform Name: \" << platform.getInfo<CL_PLATFORM_NAME>()\n << std::endl;\n std::cout << \"Platform Vendor: \" << platform.getInfo<CL_PLATFORM_VENDOR>()\n << std::endl;\n std::cout << \"Platform Version: \" << platform.getInfo<CL_PLATFORM_VERSION>()\n << std::endl;\n std::cout << \"Devices: \" << get_device_count(platform) << std::endl;\n std::cout << \"===============================================\" << std::endl;\n}<commit_msg>little changes in ocl solver<commit_after>#include \"util\/ocl_helper.h\"\n#include \"util\/x_error.h\"\n#include <algorithm>\n#include <iostream>\n\nusing x_engine::ocl_error;\n\nvoid show_platform_info(const cl::Platform &);\nvoid init_cl_devices(std::priority_queue<std::shared_ptr<device>> &);\n\nstd::priority_queue<std::shared_ptr<device>> get_dev_queue() {\n std::priority_queue<std::shared_ptr<device>> q;\n init_cl_devices(q);\n if (q.size() < 1) {\n throw ocl_error(\"No OpenCL devices were found\");\n }\n return q;\n}\n\nsize_t get_device_count(const cl::Platform &p) {\n std::vector<cl::Device> devices;\n p.getDevices(CL_DEVICE_TYPE_ALL, &devices);\n return devices.size();\n}\n\nvoid init_cl_devices(std::priority_queue<std::shared_ptr<device>> &q) {\n cl_int err;\n std::vector<cl::Platform> platform_list;\n err = cl::Platform::get(\n &platform_list); \/\/ TODO make check that returned value isn't error\n if (platform_list.size() < 1 || err != CL_SUCCESS) {\n throw ocl_error(\"No OpenCL platforms were found\");\n }\n \/\/ std::for_each(platform_list.begin(), platform_list.end(),\n \/\/ show_platform_info);\n auto it =\n std::max_element(platform_list.begin(), platform_list.end(),\n [](const cl::Platform &p1, const cl::Platform &p2) {\n return get_device_count(p1) < get_device_count(p2);\n });\n std::cout << \"Use platform\" << std::endl;\n show_platform_info(*it);\n std::vector<cl::Device> devices;\n it->getDevices(CL_DEVICE_TYPE_ALL, &devices);\n for (size_t i = 0; i < devices.size(); ++i) {\n std::shared_ptr<device> d(new device(devices[i], 0, i));\n q.push(d);\n std::cout << \"Init device \" << d->name << std::endl;\n }\n}\n\nvoid show_platform_info(const cl::Platform &platform) {\n \/\/ Get OpenCL platform name and version\n std::cout << \"Platform Name: \" << platform.getInfo<CL_PLATFORM_NAME>()\n << std::endl;\n std::cout << \"Platform Vendor: \" << platform.getInfo<CL_PLATFORM_VENDOR>()\n << std::endl;\n std::cout << \"Platform Version: \" << platform.getInfo<CL_PLATFORM_VERSION>()\n << std::endl;\n std::cout << \"Devices: \" << get_device_count(platform) << std::endl;\n std::cout << \"===============================================\" << std::endl;\n}<|endoftext|>"} {"text":"<commit_before>\/\/ Copyright (c) 2011, Christian Rorvik\n\/\/ Distributed under the Simplified BSD License (See accompanying file LICENSE.txt)\n\n#ifndef CRUNCH_CONCURRENCY_WAITABLE_HPP\n#define CRUNCH_CONCURRENCY_WAITABLE_HPP\n\n#include \"crunch\/base\/override.hpp\"\n\n#include <utility>\n\nnamespace Crunch { namespace Concurrency {\n\nstruct Waiter\n{\n virtual void Notify() = 0;\n\n Waiter* next;\n};\n\ntemplate<typename F>\nstruct GenericWaiter : Waiter\n{\n GenericWaiter(F const& f) : f(f) {}\n GenericWaiter(F&& f) : f(std::move(f)) {}\n GenericWaiter(GenericWaiter const& rhs) : f(rhs.f) {}\n GenericWaiter& operator = (GenericWaiter const& rhs) { f = rhs.f; return *this; }\n\n virtual void Notify() CRUNCH_OVERRIDE\n {\n f();\n }\n\n F f;\n};\n\ntemplate<typename F>\nGenericWaiter<F> MakeWaiter(F const& f)\n{\n return GenericWaiter<F>(f);\n}\n\ntemplate<typename F>\nGenericWaiter<F> MakeWaiter(F&& f)\n{\n return GenericWaiter<F>(std::move(f));\n}\n\nstruct IWaitable\n{\n virtual void AddWaiter(Waiter* waiter) = 0;\n\n \/\/ Must not return until any callbacks on waiter has completed\n virtual void RemoveWaiter(Waiter* waiter) = 0;\n\n virtual bool IsOrderDependent() const = 0;\n\n virtual ~IWaitable() { }\n};\n\n\nenum WaitMode\n{\n WAIT_MODE_POLL,\n WAIT_MODE_YIELD_PREEMTIVE,\n WAIT_MODE_YIELD_COOPERATIVE\n};\n\nvoid WaitFor(IWaitable& waitable, WaitMode waitMode = WAIT_MODE_YIELD_COOPERATIVE);\nvoid WaitForAll(IWaitable** waitables, std::size_t count, WaitMode waitMode = WAIT_MODE_YIELD_COOPERATIVE);\nvoid WaitForAny(IWaitable** waitables, std::size_t count, WaitMode waitMode = WAIT_MODE_YIELD_COOPERATIVE);\n\n}}\n\n#endif\n<commit_msg>crunch_concurrency - Added RemoveWaitFromList utility function<commit_after>\/\/ Copyright (c) 2011, Christian Rorvik\n\/\/ Distributed under the Simplified BSD License (See accompanying file LICENSE.txt)\n\n#ifndef CRUNCH_CONCURRENCY_WAITABLE_HPP\n#define CRUNCH_CONCURRENCY_WAITABLE_HPP\n\n#include \"crunch\/base\/override.hpp\"\n\n#include <utility>\n\nnamespace Crunch { namespace Concurrency {\n\nstruct Waiter\n{\n virtual void Notify() = 0;\n\n Waiter* next;\n};\n\n\/\/\/ Remove waiter from list\n\/\/\/ \\param head Start of list\n\/\/\/ \\param waiter The waiter to remove\n\/\/\/ \\return New head\ninline Waiter* RemoveWaiterFromList(Waiter* head, Waiter* waiter)\n{\n if (head == waiter)\n return head->next;\n\n Waiter* current = head;\n while (current->next != nullptr)\n {\n if (current->next == waiter)\n {\n current->next = waiter->next;\n break;\n }\n\n current = current->next;\n }\n return head;\n}\n\ntemplate<typename F>\nstruct GenericWaiter : Waiter\n{\n GenericWaiter(F const& f) : f(f) {}\n GenericWaiter(F&& f) : f(std::move(f)) {}\n GenericWaiter(GenericWaiter const& rhs) : f(rhs.f) {}\n GenericWaiter& operator = (GenericWaiter const& rhs) { f = rhs.f; return *this; }\n\n virtual void Notify() CRUNCH_OVERRIDE\n {\n f();\n }\n\n F f;\n};\n\ntemplate<typename F>\nGenericWaiter<F> MakeWaiter(F const& f)\n{\n return GenericWaiter<F>(f);\n}\n\ntemplate<typename F>\nGenericWaiter<F> MakeWaiter(F&& f)\n{\n return GenericWaiter<F>(std::move(f));\n}\n\nstruct IWaitable\n{\n virtual void AddWaiter(Waiter* waiter) = 0;\n\n \/\/ Must not return until any callbacks on waiter has completed\n virtual void RemoveWaiter(Waiter* waiter) = 0;\n\n virtual bool IsOrderDependent() const = 0;\n\n virtual ~IWaitable() { }\n};\n\n\nenum WaitMode\n{\n WAIT_MODE_POLL,\n WAIT_MODE_YIELD_PREEMTIVE,\n WAIT_MODE_YIELD_COOPERATIVE\n};\n\nvoid WaitFor(IWaitable& waitable, WaitMode waitMode = WAIT_MODE_YIELD_COOPERATIVE);\nvoid WaitForAll(IWaitable** waitables, std::size_t count, WaitMode waitMode = WAIT_MODE_YIELD_COOPERATIVE);\nvoid WaitForAny(IWaitable** waitables, std::size_t count, WaitMode waitMode = WAIT_MODE_YIELD_COOPERATIVE);\n\n}}\n\n#endif\n<|endoftext|>"} {"text":"<commit_before>#include \"..\/ext\/Draw\/CDraw3DLine.h\"\n#include \"..\/ext\/Draw\/Draw3DLineShaders.h\"\n\nusing namespace irr;\nusing namespace video;\nusing namespace scene;\nusing namespace ext;\nusing namespace draw;\n\nCDraw3DLine* CDraw3DLine::create(IVideoDriver* _driver)\n{\n return new CDraw3DLine(_driver);\n}\n\nCDraw3DLine::CDraw3DLine(IVideoDriver* _driver)\n: m_driver(_driver),\n m_desc(_driver->createGPUMeshDataFormatDesc()),\n m_meshBuffer(new IGPUMeshBuffer())\n{\n auto callBack = new Draw3DLineCallBack();\n m_material.MaterialType = (E_MATERIAL_TYPE)\n m_driver->getGPUProgrammingServices()->addHighLevelShaderMaterial(\n Draw3DLineVertexShader,\n nullptr,nullptr,nullptr,\n Draw3DLineFragmentShader,\n 2,EMT_SOLID,\n callBack,\n 0);\n callBack->drop();\n\n m_meshBuffer->setPrimitiveType(EPT_LINES);\n m_meshBuffer->setMeshDataAndFormat(m_desc);\n m_meshBuffer->setIndexType(EIT_UNKNOWN);\n m_desc->drop();\n}\n\nvoid CDraw3DLine::draw(\n float fromX, float fromY, float fromZ,\n float toX, float toY, float toZ,\n float r, float g, float b, float a)\n{\n S3DLineVertex vertices[2] = {\n {{ fromX, fromY, fromZ }, { r, g, b, a }},\n {{ toX, toY, toZ }, { r, g, b, a }}\n };\n\n auto upStreamBuff = m_driver->getDefaultUpStreamingBuffer();\n void* lineData[1] = { vertices };\n\n upStreamBuff->multi_place(2u, (const void* const*)lineData, (uint32_t*)&m_offsets,(uint32_t*)&sizes,(uint32_t*)&alignments);\n if (upStreamBuff->needsManualFlushOrInvalidate())\n {\n auto upStreamMem = upStreamBuff->getBuffer()->getBoundMemory();\n m_driver->flushMappedMemoryRanges({{ upStreamMem,m_offsets[0],sizes[0] }});\n }\n\n auto buff = upStreamBuff->getBuffer();\n m_desc->mapVertexAttrBuffer(buff,EVAI_ATTR0,ECPA_THREE,ECT_FLOAT,sizeof(S3DLineVertex), offsetof(S3DLineVertex, Position[0]) + m_offsets[0]);\n m_desc->mapVertexAttrBuffer(buff,EVAI_ATTR1,ECPA_FOUR,ECT_FLOAT,sizeof(S3DLineVertex), offsetof(S3DLineVertex, Color[0]) + m_offsets[0]);\n\n m_driver->setTransform(E4X3TS_WORLD, core::matrix4x3());\n m_driver->setMaterial(m_material);\n m_driver->drawMeshBuffer(m_meshBuffer);\n\n upStreamBuff->multi_free(2u,(uint32_t*)&m_offsets,(uint32_t*)&sizes,m_driver->placeFence());\n}\n\nCDraw3DLine::~CDraw3DLine()\n{\n m_desc->drop();\n m_meshBuffer->drop();\n}\n<commit_msg>Set index count<commit_after>#include \"..\/ext\/Draw\/CDraw3DLine.h\"\n#include \"..\/ext\/Draw\/Draw3DLineShaders.h\"\n\nusing namespace irr;\nusing namespace video;\nusing namespace scene;\nusing namespace ext;\nusing namespace draw;\n\nCDraw3DLine* CDraw3DLine::create(IVideoDriver* _driver)\n{\n return new CDraw3DLine(_driver);\n}\n\nCDraw3DLine::CDraw3DLine(IVideoDriver* _driver)\n: m_driver(_driver),\n m_desc(_driver->createGPUMeshDataFormatDesc()),\n m_meshBuffer(new IGPUMeshBuffer())\n{\n auto callBack = new Draw3DLineCallBack();\n m_material.MaterialType = (E_MATERIAL_TYPE)\n m_driver->getGPUProgrammingServices()->addHighLevelShaderMaterial(\n Draw3DLineVertexShader,\n nullptr,nullptr,nullptr,\n Draw3DLineFragmentShader,\n 2,EMT_SOLID,\n callBack,\n 0);\n callBack->drop();\n\n m_meshBuffer->setPrimitiveType(EPT_LINES);\n m_meshBuffer->setMeshDataAndFormat(m_desc);\n m_meshBuffer->setIndexType(EIT_UNKNOWN);\n m_meshBuffer->setIndexCount(2);\n m_desc->drop();\n}\n\nvoid CDraw3DLine::draw(\n float fromX, float fromY, float fromZ,\n float toX, float toY, float toZ,\n float r, float g, float b, float a)\n{\n S3DLineVertex vertices[2] = {\n {{ fromX, fromY, fromZ }, { r, g, b, a }},\n {{ toX, toY, toZ }, { r, g, b, a }}\n };\n\n auto upStreamBuff = m_driver->getDefaultUpStreamingBuffer();\n void* lineData[1] = { vertices };\n\n upStreamBuff->multi_place(2u, (const void* const*)lineData, (uint32_t*)&m_offsets,(uint32_t*)&sizes,(uint32_t*)&alignments);\n if (upStreamBuff->needsManualFlushOrInvalidate())\n {\n auto upStreamMem = upStreamBuff->getBuffer()->getBoundMemory();\n m_driver->flushMappedMemoryRanges({{ upStreamMem,m_offsets[0],sizes[0] }});\n }\n\n auto buff = upStreamBuff->getBuffer();\n m_desc->mapVertexAttrBuffer(buff,EVAI_ATTR0,ECPA_THREE,ECT_FLOAT,sizeof(S3DLineVertex), offsetof(S3DLineVertex, Position[0]) + m_offsets[0]);\n m_desc->mapVertexAttrBuffer(buff,EVAI_ATTR1,ECPA_FOUR,ECT_FLOAT,sizeof(S3DLineVertex), offsetof(S3DLineVertex, Color[0]) + m_offsets[0]);\n\n m_driver->setTransform(E4X3TS_WORLD, core::matrix4x3());\n m_driver->setMaterial(m_material);\n m_driver->drawMeshBuffer(m_meshBuffer);\n\n upStreamBuff->multi_free(2u,(uint32_t*)&m_offsets,(uint32_t*)&sizes,m_driver->placeFence());\n}\n\nCDraw3DLine::~CDraw3DLine()\n{\n m_desc->drop();\n m_meshBuffer->drop();\n}\n<|endoftext|>"} {"text":"<commit_before>#include \"Test.h\"\n#include \"DataStore\/MemoryDataStore.h\"\n#include \"DataStore\/DataStoreWriteStream.h\"\n#include \"DataStore\/DataStoreReadStream.h\"\n\n#include <future>\n\nusing namespace Flourish;\n\n\nclass MemoryDataStoreTests : public ::testing::Test\n{\nprotected:\n MemoryDataStore dataStore;\n\n void SetUp() override\n {\n SetupCallWait();\n }\n\n void SetupCallWait()\n {\n promise = std::promise<void>();\n future = promise.get_future();\n }\n\n void TriggerCallComplete()\n {\n promise.set_value();\n }\n\n void ExpectCallToCompleteInTime()\n {\n auto result = future.wait_for(std::chrono::seconds(1));\n EXPECT_EQUAL(result, std::future_status::ready) << \"Callback was not called in time\";\n }\n\n void WriteDataToPath(const DataStorePath& path)\n {\n SetupCallWait();\n dataStore.OpenForWrite(path, [&](DataStoreWriteCallbackParam)\n {\n TriggerCallComplete();\n });\n ExpectCallToCompleteInTime();\n SetupCallWait();\n }\n\nprivate:\n std::promise<void> promise;\n std::future<void> future;\n};\n\nTEST_F(MemoryDataStoreTests, ExistsReturnsFalseWithNoDataOrDirectory)\n{\n EXPECT_FALSE(dataStore.Exists(DataStorePath(\"does\/not\/exist\")));\n}\n\nTEST_F(MemoryDataStoreTests, ExistsReturnsTrueAfterDataWrite)\n{\n DataStorePath path(\"will\/be\/written\/to\");\n\n dataStore.OpenForWrite(path, [&](DataStoreWriteCallbackParam result)\n {\n EXPECT_FALSE(result.HasError());\n EXPECT_TRUE(dataStore.Exists(path));\n TriggerCallComplete();\n });\n\n ExpectCallToCompleteInTime();\n}\n\nTEST_F(MemoryDataStoreTests, IsDirReturnsFalseForNonExistantPath)\n{\n EXPECT_FALSE(dataStore.IsDir(DataStorePath(\"does\/not\/exist\")));\n}\n\nTEST_F(MemoryDataStoreTests, IsDataReturnsFalseForNonExistantPath)\n{\n EXPECT_FALSE(dataStore.IsData(DataStorePath(\"does\/not\/exist\")));\n}\n\nTEST_F(MemoryDataStoreTests, IsDirReturnsFalseForData)\n{\n DataStorePath path(\"will\/be\/written\/to\");\n\n dataStore.OpenForWrite(path, [&](DataStoreWriteCallbackParam result)\n {\n EXPECT_FALSE(result.HasError());\n EXPECT_FALSE(dataStore.IsDir(path));\n TriggerCallComplete();\n });\n\n ExpectCallToCompleteInTime();\n}\n\nTEST_F(MemoryDataStoreTests, IsDataReturnsTrueForData)\n{\n DataStorePath path(\"will\/be\/written\/to\");\n\n dataStore.OpenForWrite(path, [&](DataStoreWriteCallbackParam result)\n {\n EXPECT_FALSE(result.HasError());\n EXPECT_TRUE(dataStore.IsData(path));\n TriggerCallComplete();\n });\n\n ExpectCallToCompleteInTime();\n}\n\nTEST_F(MemoryDataStoreTests, OpenForReadOnNonExistantPathCreatesError)\n{\n DataStorePath path(\"does\/not\/exist\");\n\n dataStore.OpenForRead(path, [&](DataStoreReadCallbackParam result)\n {\n EXPECT_TRUE(result.HasError());\n EXPECT_STRING_EQUAL(result.GetError(), \"Path 'does\/not\/exist' does not exist in data store\");\n TriggerCallComplete();\n });\n\n ExpectCallToCompleteInTime();\n}\n\nTEST_F(MemoryDataStoreTests, CanReadBackWrittenData)\n{\n DataStorePath path(\"will\/be\/written\/to\");\n\n dataStore.OpenForWrite(path, [&](DataStoreWriteCallbackParam openResult)\n {\n EXPECT_FALSE(openResult.HasError());\n auto dataToWrite = std::string(\"some data\");\n openResult.Value()->Write(dataToWrite.c_str(), dataToWrite.length());\n openResult.Value()->Flush(\n [&](DataStoreWriteCallbackParam writeResult)\n {\n EXPECT_FALSE(writeResult.HasError());\n TriggerCallComplete();\n });\n });\n\n ExpectCallToCompleteInTime();\n SetupCallWait();\n\n dataStore.OpenForRead(path, [&](DataStoreReadCallbackParam readResult)\n {\n EXPECT_STRING_EQUAL(static_cast<const char*>(readResult.Value()->Data()), \"some data\");\n TriggerCallComplete();\n });\n ExpectCallToCompleteInTime();\n}\n\nTEST_F(MemoryDataStoreTests, WritingDataCreatesParentDirectories)\n{\n DataStorePath path(\"will\/be\/written\/to\");\n\n dataStore.OpenForWrite(path, [&](DataStoreWriteCallbackParam result)\n {\n EXPECT_TRUE(dataStore.IsDir(DataStorePath(\"\")));\n EXPECT_TRUE(dataStore.IsDir(DataStorePath(\"will\")));\n EXPECT_TRUE(dataStore.IsDir(DataStorePath(\"will\/be\")));\n EXPECT_TRUE(dataStore.IsDir(DataStorePath(\"will\/be\/written\")));\n EXPECT_FALSE(result.HasError());\n EXPECT_FALSE(dataStore.IsDir(path));\n TriggerCallComplete();\n });\n\n ExpectCallToCompleteInTime();\n}\n\nTEST_F(MemoryDataStoreTests, EnumerateFindsDataAndDirectories)\n{\n WriteDataToPath(DataStorePath(\"some\/path\/to\/file.txt\"));\n WriteDataToPath(DataStorePath(\"some\/path\/to\/another_file.txt\"));\n WriteDataToPath(DataStorePath(\"some\/path\/to\/subdir\/with_file.txt\"));\n\n std::vector<DataStorePath> result;\n dataStore.Enumerate(DataStorePath(\"some\/path\/to\"), result);\n\n \/\/ We don't care what order things are in, so just assert that\n \/\/ all the expected elements (and only those) exist\n EXPECT_EQUAL(result.size(), 3);\n EXPECT_NOT_EQUAL(std::find(result.begin(), result.end(), DataStorePath(\"some\/path\/to\/file.txt\")), result.end());\n EXPECT_NOT_EQUAL(std::find(result.begin(), result.end(), DataStorePath(\"some\/path\/to\/another_file.txt\")), result.end());\n EXPECT_NOT_EQUAL(std::find(result.begin(), result.end(), DataStorePath(\"some\/path\/to\/subdir\")), result.end());\n}\n\nTEST_F(MemoryDataStoreTests, SequentialWritesAppend)\n{\n DataStorePath path(\"will\/be\/written\/to\");\n\n dataStore.OpenForWrite(path, [&](DataStoreWriteCallbackParam openResult)\n {\n std::string firstData(\"first data\");\n openResult.Value()->Write(firstData.c_str(), firstData.length());\n openResult.Value()->Flush([&](DataStoreWriteCallbackParam writeResult)\n {\n std::string secondData(\" second data\");\n writeResult.Value()->Write(secondData.c_str(), secondData.length());\n writeResult.Value()->Flush([&](DataStoreWriteCallbackParam secondWriteResult)\n {\n TriggerCallComplete();\n });\n });\n });\n\n ExpectCallToCompleteInTime();\n\n SetupCallWait();\n dataStore.OpenForRead(path, [&](DataStoreReadCallbackParam readResult)\n {\n EXPECT_STRING_EQUAL(\"first data second data\", static_cast<const char*>(readResult.Value()->Data()));\n TriggerCallComplete();\n });\n\n ExpectCallToCompleteInTime();\n}\n\nTEST_F(MemoryDataStoreTests, ConsecutiveWritesOverwrite)\n{\n DataStorePath path(\"will\/be\/written\/to\");\n\n dataStore.OpenForWrite(path, [&](DataStoreWriteCallbackParam openResult)\n {\n std::string firstData(\"first data\");\n openResult.Value()->Write(firstData.c_str(), firstData.length());\n openResult.Value()->Flush([&](DataStoreWriteCallbackParam writeResult)\n {\n TriggerCallComplete();\n });\n });\n\n ExpectCallToCompleteInTime();\n\n SetupCallWait();\n dataStore.OpenForWrite(path, [&](DataStoreWriteCallbackParam openResult)\n {\n std::string secondData(\"second data\");\n openResult.Value()->Write(secondData.c_str(), secondData.length());\n openResult.Value()->Flush([&](DataStoreWriteCallbackParam writeResult)\n {\n TriggerCallComplete();\n });\n });\n\n ExpectCallToCompleteInTime();\n\n SetupCallWait();\n dataStore.OpenForRead(path, [&](DataStoreReadCallbackParam readResult)\n {\n EXPECT_STRING_EQUAL(\"second data\", static_cast<const char*>(readResult.Value()->Data()));\n TriggerCallComplete();\n });\n\n ExpectCallToCompleteInTime();\n}\n\nTEST_F(MemoryDataStoreTests, ConsecutiveAppendsAppend)\n{\n DataStorePath path(\"will\/be\/written\/to\");\n\n dataStore.OpenForAppend(path, [&](DataStoreWriteCallbackParam openResult)\n {\n std::string firstData(\"first data\");\n openResult.Value()->Write(firstData.c_str(), firstData.length());\n openResult.Value()->Flush([&](DataStoreWriteCallbackParam writeResult)\n {\n TriggerCallComplete();\n });\n });\n\n ExpectCallToCompleteInTime();\n\n SetupCallWait();\n dataStore.OpenForAppend(path, [&](DataStoreWriteCallbackParam openResult)\n {\n std::string firstData(\" second data\");\n openResult.Value()->Write(firstData.c_str(), firstData.length());\n openResult.Value()->Flush([&](DataStoreWriteCallbackParam writeResult)\n {\n TriggerCallComplete();\n });\n });\n\n SetupCallWait();\n dataStore.OpenForRead(path, [&](DataStoreReadCallbackParam readResult)\n {\n EXPECT_STRING_EQUAL(\"first data second data\", static_cast<const char*>(readResult.Value()->Data()));\n TriggerCallComplete();\n });\n\n ExpectCallToCompleteInTime();\n}\n\nTEST_F(MemoryDataStoreTests, ConsecutiveReadsReadSameData)\n{\n \/\/ Note that this test will fail if a read buffer is smaller than\n \/\/ the write buffer\n DataStorePath path(\"will\/be\/written\/to\");\n\n dataStore.OpenForWrite(path, [&](DataStoreWriteCallbackParam openResult)\n {\n \/\/ Write a buffer full of 1's\n const auto openStream = openResult.Value();\n auto data = new uint8_t[openStream->Available()];\n std::fill_n(data, openStream->Available(), 1);\n openStream->Write(data, openStream->Available());\n delete[] data;\n openStream->Flush([&](DataStoreWriteCallbackParam writeResult)\n {\n \/\/ Write a buffer full of 2's\n const auto writeStream = writeResult.Value();\n auto data = new uint8_t[writeStream->Available()];\n std::fill_n(data, writeStream->Available(), 2);\n writeStream->Write(data, writeStream->Available());\n delete[] data;\n writeStream->Flush([&](DataStoreWriteCallbackParam)\n {\n TriggerCallComplete();\n });\n });\n });\n\n ExpectCallToCompleteInTime();\n\n SetupCallWait();\n dataStore.OpenForRead(path, [&](DataStoreReadCallbackParam openResult)\n {\n const auto openStream = openResult.Value();\n const auto openData = static_cast<const uint8_t*>(openStream->Data());\n EXPECT_EQUAL(openData[0], 1);\n TriggerCallComplete();\n });\n ExpectCallToCompleteInTime();\n\n SetupCallWait();\n dataStore.OpenForRead(path, [&](DataStoreReadCallbackParam openResult)\n {\n const auto openStream = openResult.Value();\n const auto openData = static_cast<const uint8_t*>(openStream->Data());\n EXPECT_EQUAL(openData[0], 1);\n TriggerCallComplete();\n });\n ExpectCallToCompleteInTime();\n}\n\n\nTEST_F(MemoryDataStoreTests, ReadToEndOfDataSetsFlag)\n{\n DataStorePath path(\"will\/be\/written\/to\");\n\n WriteDataToPath(path);\n\n dataStore.OpenForRead(path, [&](DataStoreReadCallbackParam openResult){\n EXPECT_TRUE(openResult.Value()->EndOfData());\n TriggerCallComplete();\n });\n\n ExpectCallToCompleteInTime();\n}\n\nTEST_F(MemoryDataStoreTests, RefreshOnEndOfDataStreamCreatesError)\n{\n DataStorePath path(\"will\/be\/written\/to\");\n\n WriteDataToPath(path);\n\n dataStore.OpenForRead(path, [&](DataStoreReadCallbackParam openResult){\n EXPECT_TRUE(openResult.Value()->EndOfData());\n openResult.Value()->Refresh([&](DataStoreReadCallbackParam readResult){\n EXPECT_TRUE(readResult.HasError());\n EXPECT_STRING_EQUAL(readResult.GetError(), \"Attempted to read past end of stream (Path: 'will\/be\/written\/to')\");\n TriggerCallComplete();\n });\n });\n\n ExpectCallToCompleteInTime();\n}\n\nTEST_F(MemoryDataStoreTests, OpenMultipleStreamsToSamePathCreatesError)\n{\n DataStorePath path(\"some\/path\");\n\n dataStore.OpenForWrite(path, [&](DataStoreWriteCallbackParam){\n dataStore.OpenForRead(path, [&](DataStoreReadCallbackParam read)\n {\n EXPECT_TRUE(read.HasError());\n EXPECT_STRING_EQUAL(read.GetError(), \"Path: 'some\/path' is already open in another stream\");\n\n dataStore.OpenForAppend(path, [&](DataStoreWriteCallbackParam append)\n {\n EXPECT_TRUE(append.HasError());\n EXPECT_STRING_EQUAL(append.GetError(), \"Path: 'some\/path' is already open in another stream\");\n\n dataStore.OpenForWrite(path, [&](DataStoreWriteCallbackParam secondWrite){\n EXPECT_TRUE(secondWrite.HasError());\n EXPECT_STRING_EQUAL(secondWrite.GetError(), \"Path: 'some\/path' is already open in another stream\");\n TriggerCallComplete();\n });\n });\n });\n });\n\n ExpectCallToCompleteInTime();\n}<commit_msg>MemoryDataStoreTests use a ptr, starting preperations testing all data stores<commit_after>#include \"Test.h\"\n#include \"DataStore\/MemoryDataStore.h\"\n#include \"DataStore\/DataStoreWriteStream.h\"\n#include \"DataStore\/DataStoreReadStream.h\"\n\n#include <future>\n\nusing namespace Flourish;\n\n\nclass MemoryDataStoreTests : public ::testing::Test\n{\npublic:\n MemoryDataStoreTests()\n : dataStore(new MemoryDataStore())\n {\n SetupCallWait();\n }\n\n virtual ~MemoryDataStoreTests()\n {\n delete dataStore;\n }\n\nprotected:\n MemoryDataStore* dataStore;\n \n void SetupCallWait()\n {\n promise = std::promise<void>();\n future = promise.get_future();\n }\n\n void TriggerCallComplete()\n {\n promise.set_value();\n }\n\n void ExpectCallToCompleteInTime()\n {\n auto result = future.wait_for(std::chrono::seconds(1));\n EXPECT_EQUAL(result, std::future_status::ready) << \"Callback was not called in time\";\n }\n\n void WriteDataToPath(const DataStorePath& path)\n {\n SetupCallWait();\n dataStore->OpenForWrite(path, [&](DataStoreWriteCallbackParam)\n {\n TriggerCallComplete();\n });\n ExpectCallToCompleteInTime();\n SetupCallWait();\n }\n\nprivate:\n std::promise<void> promise;\n std::future<void> future;\n};\n\nTEST_F(MemoryDataStoreTests, ExistsReturnsFalseWithNoDataOrDirectory)\n{\n EXPECT_FALSE(dataStore->Exists(DataStorePath(\"does\/not\/exist\")));\n}\n\nTEST_F(MemoryDataStoreTests, ExistsReturnsTrueAfterDataWrite)\n{\n DataStorePath path(\"will\/be\/written\/to\");\n\n dataStore->OpenForWrite(path, [&](DataStoreWriteCallbackParam result)\n {\n EXPECT_FALSE(result.HasError());\n EXPECT_TRUE(dataStore->Exists(path));\n TriggerCallComplete();\n });\n\n ExpectCallToCompleteInTime();\n}\n\nTEST_F(MemoryDataStoreTests, IsDirReturnsFalseForNonExistantPath)\n{\n EXPECT_FALSE(dataStore->IsDir(DataStorePath(\"does\/not\/exist\")));\n}\n\nTEST_F(MemoryDataStoreTests, IsDataReturnsFalseForNonExistantPath)\n{\n EXPECT_FALSE(dataStore->IsData(DataStorePath(\"does\/not\/exist\")));\n}\n\nTEST_F(MemoryDataStoreTests, IsDirReturnsFalseForData)\n{\n DataStorePath path(\"will\/be\/written\/to\");\n\n dataStore->OpenForWrite(path, [&](DataStoreWriteCallbackParam result)\n {\n EXPECT_FALSE(result.HasError());\n EXPECT_FALSE(dataStore->IsDir(path));\n TriggerCallComplete();\n });\n\n ExpectCallToCompleteInTime();\n}\n\nTEST_F(MemoryDataStoreTests, IsDataReturnsTrueForData)\n{\n DataStorePath path(\"will\/be\/written\/to\");\n\n dataStore->OpenForWrite(path, [&](DataStoreWriteCallbackParam result)\n {\n EXPECT_FALSE(result.HasError());\n EXPECT_TRUE(dataStore->IsData(path));\n TriggerCallComplete();\n });\n\n ExpectCallToCompleteInTime();\n}\n\nTEST_F(MemoryDataStoreTests, OpenForReadOnNonExistantPathCreatesError)\n{\n DataStorePath path(\"does\/not\/exist\");\n\n dataStore->OpenForRead(path, [&](DataStoreReadCallbackParam result)\n {\n EXPECT_TRUE(result.HasError());\n EXPECT_STRING_EQUAL(result.GetError(), \"Path 'does\/not\/exist' does not exist in data store\");\n TriggerCallComplete();\n });\n\n ExpectCallToCompleteInTime();\n}\n\nTEST_F(MemoryDataStoreTests, CanReadBackWrittenData)\n{\n DataStorePath path(\"will\/be\/written\/to\");\n\n dataStore->OpenForWrite(path, [&](DataStoreWriteCallbackParam openResult)\n {\n EXPECT_FALSE(openResult.HasError());\n auto dataToWrite = std::string(\"some data\");\n openResult.Value()->Write(dataToWrite.c_str(), dataToWrite.length());\n openResult.Value()->Flush(\n [&](DataStoreWriteCallbackParam writeResult)\n {\n EXPECT_FALSE(writeResult.HasError());\n TriggerCallComplete();\n });\n });\n\n ExpectCallToCompleteInTime();\n SetupCallWait();\n\n dataStore->OpenForRead(path, [&](DataStoreReadCallbackParam readResult)\n {\n EXPECT_STRING_EQUAL(static_cast<const char*>(readResult.Value()->Data()), \"some data\");\n TriggerCallComplete();\n });\n ExpectCallToCompleteInTime();\n}\n\nTEST_F(MemoryDataStoreTests, WritingDataCreatesParentDirectories)\n{\n DataStorePath path(\"will\/be\/written\/to\");\n\n dataStore->OpenForWrite(path, [&](DataStoreWriteCallbackParam result)\n {\n EXPECT_TRUE(dataStore->IsDir(DataStorePath(\"\")));\n EXPECT_TRUE(dataStore->IsDir(DataStorePath(\"will\")));\n EXPECT_TRUE(dataStore->IsDir(DataStorePath(\"will\/be\")));\n EXPECT_TRUE(dataStore->IsDir(DataStorePath(\"will\/be\/written\")));\n EXPECT_FALSE(result.HasError());\n EXPECT_FALSE(dataStore->IsDir(path));\n TriggerCallComplete();\n });\n\n ExpectCallToCompleteInTime();\n}\n\nTEST_F(MemoryDataStoreTests, EnumerateFindsDataAndDirectories)\n{\n WriteDataToPath(DataStorePath(\"some\/path\/to\/file.txt\"));\n WriteDataToPath(DataStorePath(\"some\/path\/to\/another_file.txt\"));\n WriteDataToPath(DataStorePath(\"some\/path\/to\/subdir\/with_file.txt\"));\n\n std::vector<DataStorePath> result;\n dataStore->Enumerate(DataStorePath(\"some\/path\/to\"), result);\n\n \/\/ We don't care what order things are in, so just assert that\n \/\/ all the expected elements (and only those) exist\n EXPECT_EQUAL(result.size(), 3);\n EXPECT_NOT_EQUAL(std::find(result.begin(), result.end(), DataStorePath(\"some\/path\/to\/file.txt\")), result.end());\n EXPECT_NOT_EQUAL(std::find(result.begin(), result.end(), DataStorePath(\"some\/path\/to\/another_file.txt\")), result.end());\n EXPECT_NOT_EQUAL(std::find(result.begin(), result.end(), DataStorePath(\"some\/path\/to\/subdir\")), result.end());\n}\n\nTEST_F(MemoryDataStoreTests, SequentialWritesAppend)\n{\n DataStorePath path(\"will\/be\/written\/to\");\n\n dataStore->OpenForWrite(path, [&](DataStoreWriteCallbackParam openResult)\n {\n std::string firstData(\"first data\");\n openResult.Value()->Write(firstData.c_str(), firstData.length());\n openResult.Value()->Flush([&](DataStoreWriteCallbackParam writeResult)\n {\n std::string secondData(\" second data\");\n writeResult.Value()->Write(secondData.c_str(), secondData.length());\n writeResult.Value()->Flush([&](DataStoreWriteCallbackParam secondWriteResult)\n {\n TriggerCallComplete();\n });\n });\n });\n\n ExpectCallToCompleteInTime();\n\n SetupCallWait();\n dataStore->OpenForRead(path, [&](DataStoreReadCallbackParam readResult)\n {\n EXPECT_STRING_EQUAL(\"first data second data\", static_cast<const char*>(readResult.Value()->Data()));\n TriggerCallComplete();\n });\n\n ExpectCallToCompleteInTime();\n}\n\nTEST_F(MemoryDataStoreTests, ConsecutiveWritesOverwrite)\n{\n DataStorePath path(\"will\/be\/written\/to\");\n\n dataStore->OpenForWrite(path, [&](DataStoreWriteCallbackParam openResult)\n {\n std::string firstData(\"first data\");\n openResult.Value()->Write(firstData.c_str(), firstData.length());\n openResult.Value()->Flush([&](DataStoreWriteCallbackParam writeResult)\n {\n TriggerCallComplete();\n });\n });\n\n ExpectCallToCompleteInTime();\n\n SetupCallWait();\n dataStore->OpenForWrite(path, [&](DataStoreWriteCallbackParam openResult)\n {\n std::string secondData(\"second data\");\n openResult.Value()->Write(secondData.c_str(), secondData.length());\n openResult.Value()->Flush([&](DataStoreWriteCallbackParam writeResult)\n {\n TriggerCallComplete();\n });\n });\n\n ExpectCallToCompleteInTime();\n\n SetupCallWait();\n dataStore->OpenForRead(path, [&](DataStoreReadCallbackParam readResult)\n {\n EXPECT_STRING_EQUAL(\"second data\", static_cast<const char*>(readResult.Value()->Data()));\n TriggerCallComplete();\n });\n\n ExpectCallToCompleteInTime();\n}\n\nTEST_F(MemoryDataStoreTests, ConsecutiveAppendsAppend)\n{\n DataStorePath path(\"will\/be\/written\/to\");\n\n dataStore->OpenForAppend(path, [&](DataStoreWriteCallbackParam openResult)\n {\n std::string firstData(\"first data\");\n openResult.Value()->Write(firstData.c_str(), firstData.length());\n openResult.Value()->Flush([&](DataStoreWriteCallbackParam writeResult)\n {\n TriggerCallComplete();\n });\n });\n\n ExpectCallToCompleteInTime();\n\n SetupCallWait();\n dataStore->OpenForAppend(path, [&](DataStoreWriteCallbackParam openResult)\n {\n std::string firstData(\" second data\");\n openResult.Value()->Write(firstData.c_str(), firstData.length());\n openResult.Value()->Flush([&](DataStoreWriteCallbackParam writeResult)\n {\n TriggerCallComplete();\n });\n });\n\n SetupCallWait();\n dataStore->OpenForRead(path, [&](DataStoreReadCallbackParam readResult)\n {\n EXPECT_STRING_EQUAL(\"first data second data\", static_cast<const char*>(readResult.Value()->Data()));\n TriggerCallComplete();\n });\n\n ExpectCallToCompleteInTime();\n}\n\nTEST_F(MemoryDataStoreTests, ConsecutiveReadsReadSameData)\n{\n \/\/ Note that this test will fail if a read buffer is smaller than\n \/\/ the write buffer\n DataStorePath path(\"will\/be\/written\/to\");\n\n dataStore->OpenForWrite(path, [&](DataStoreWriteCallbackParam openResult)\n {\n \/\/ Write a buffer full of 1's\n const auto openStream = openResult.Value();\n auto data = new uint8_t[openStream->Available()];\n std::fill_n(data, openStream->Available(), 1);\n openStream->Write(data, openStream->Available());\n delete[] data;\n openStream->Flush([&](DataStoreWriteCallbackParam writeResult)\n {\n \/\/ Write a buffer full of 2's\n const auto writeStream = writeResult.Value();\n auto data = new uint8_t[writeStream->Available()];\n std::fill_n(data, writeStream->Available(), 2);\n writeStream->Write(data, writeStream->Available());\n delete[] data;\n writeStream->Flush([&](DataStoreWriteCallbackParam)\n {\n TriggerCallComplete();\n });\n });\n });\n\n ExpectCallToCompleteInTime();\n\n SetupCallWait();\n dataStore->OpenForRead(path, [&](DataStoreReadCallbackParam openResult)\n {\n const auto openStream = openResult.Value();\n const auto openData = static_cast<const uint8_t*>(openStream->Data());\n EXPECT_EQUAL(openData[0], 1);\n TriggerCallComplete();\n });\n ExpectCallToCompleteInTime();\n\n SetupCallWait();\n dataStore->OpenForRead(path, [&](DataStoreReadCallbackParam openResult)\n {\n const auto openStream = openResult.Value();\n const auto openData = static_cast<const uint8_t*>(openStream->Data());\n EXPECT_EQUAL(openData[0], 1);\n TriggerCallComplete();\n });\n ExpectCallToCompleteInTime();\n}\n\n\nTEST_F(MemoryDataStoreTests, ReadToEndOfDataSetsFlag)\n{\n DataStorePath path(\"will\/be\/written\/to\");\n\n WriteDataToPath(path);\n\n dataStore->OpenForRead(path, [&](DataStoreReadCallbackParam openResult)\n {\n EXPECT_TRUE(openResult.Value()->EndOfData());\n TriggerCallComplete();\n });\n\n ExpectCallToCompleteInTime();\n}\n\nTEST_F(MemoryDataStoreTests, RefreshOnEndOfDataStreamCreatesError)\n{\n DataStorePath path(\"will\/be\/written\/to\");\n\n WriteDataToPath(path);\n\n dataStore->OpenForRead(path, [&](DataStoreReadCallbackParam openResult)\n {\n EXPECT_TRUE(openResult.Value()->EndOfData());\n openResult.Value()->Refresh([&](DataStoreReadCallbackParam readResult)\n {\n EXPECT_TRUE(readResult.HasError());\n EXPECT_STRING_EQUAL(readResult.GetError(), \"Attempted to read past end of stream (Path: 'will\/be\/written\/to')\");\n TriggerCallComplete();\n });\n });\n\n ExpectCallToCompleteInTime();\n}\n\nTEST_F(MemoryDataStoreTests, OpenMultipleStreamsToSamePathCreatesError)\n{\n DataStorePath path(\"some\/path\");\n\n dataStore->OpenForWrite(path, [&](DataStoreWriteCallbackParam)\n {\n dataStore->OpenForRead(path, [&](DataStoreReadCallbackParam read)\n {\n EXPECT_TRUE(read.HasError());\n EXPECT_STRING_EQUAL(read.GetError(), \"Path: 'some\/path' is already open in another stream\");\n\n dataStore->OpenForAppend(path, [&](DataStoreWriteCallbackParam append)\n {\n EXPECT_TRUE(append.HasError());\n EXPECT_STRING_EQUAL(append.GetError(), \"Path: 'some\/path' is already open in another stream\");\n\n dataStore->OpenForWrite(path, [&](DataStoreWriteCallbackParam secondWrite)\n {\n EXPECT_TRUE(secondWrite.HasError());\n EXPECT_STRING_EQUAL(secondWrite.GetError(), \"Path: 'some\/path' is already open in another stream\");\n TriggerCallComplete();\n });\n });\n });\n });\n\n ExpectCallToCompleteInTime();\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 <itkImage.h>\n#include <itkImageFileReader.h>\n#include <itkImageRegion.h>\n#include <itkRGBPixel.h>\n#include <itkTestingMacros.h>\n#include <fstream>\n#include <iostream>\n#include <string>\n\nnamespace\n{\nbool\nWriteSmallBmp(const std::string & filename)\n{\n const char bmp_raw[] = { 66, 77, 30, 0, 0, 0, 0, 0, 0, 0, 26, 0, 0, 0, 12,\n 0, 0, 0, 1, 0, 1, 0, 1, 0, 24, 0, 0, 0, -1, 0 };\n std::ofstream bmp_output(filename, std::ios::binary);\n if (!bmp_output)\n {\n std::cerr << \"Cannot open file for writing (\" << filename << \")\\n\";\n return false;\n }\n bmp_output.write(bmp_raw, sizeof(bmp_raw));\n bmp_output.close();\n if (!bmp_output)\n {\n std::cerr << \"Cannot write to file (\" << filename << \")\\n\";\n return false;\n }\n return true;\n}\n} \/\/ namespace\n\nint\nitkBMPImageIOTestExtension(int argc, char * argv[])\n{\n if (argc < 2)\n {\n std::cerr << \"Usage: \" << itkNameOfTestExecutableMacro(argv) << \" temporary_output_folder\\n\";\n return EXIT_FAILURE;\n }\n\n \/\/ filename shouldn't have bmp extension\n const std::string filename(std::string(argv[1]) + \"\/itkBMPImageIOTestExtension\");\n\n ITK_TEST_EXPECT_TRUE(WriteSmallBmp(filename));\n\n using ComponentType = unsigned char;\n using PixelType = itk::RGBPixel<ComponentType>;\n auto reader = itk::ImageFileReader<itk::Image<PixelType, 2>>::New();\n reader->SetFileName(filename);\n ITK_TRY_EXPECT_NO_EXCEPTION(reader->Update());\n\n const itk::ImageRegion<2> expected_region{ itk::Size<2>{ 1, 1 } };\n const ComponentType expected_rgb[] = { 255, 0, 0 };\n const PixelType expected_pixel{ expected_rgb };\n \/\/ check that data has been actually read\n auto image = reader->GetOutput();\n ITK_TEST_EXPECT_EQUAL(image->GetLargestPossibleRegion(), expected_region);\n ITK_TEST_EXPECT_EQUAL(image->GetPixel({ 0, 0 }), expected_pixel);\n std::cout << \"Test finished\\n\";\n return EXIT_SUCCESS;\n}\n<commit_msg>STYLE: Add additional braces around initialization of subobject<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 <itkImage.h>\n#include <itkImageFileReader.h>\n#include <itkImageRegion.h>\n#include <itkRGBPixel.h>\n#include <itkTestingMacros.h>\n#include <fstream>\n#include <iostream>\n#include <string>\n\nnamespace\n{\nbool\nWriteSmallBmp(const std::string & filename)\n{\n const char bmp_raw[] = { 66, 77, 30, 0, 0, 0, 0, 0, 0, 0, 26, 0, 0, 0, 12,\n 0, 0, 0, 1, 0, 1, 0, 1, 0, 24, 0, 0, 0, -1, 0 };\n std::ofstream bmp_output(filename, std::ios::binary);\n if (!bmp_output)\n {\n std::cerr << \"Cannot open file for writing (\" << filename << \")\\n\";\n return false;\n }\n bmp_output.write(bmp_raw, sizeof(bmp_raw));\n bmp_output.close();\n if (!bmp_output)\n {\n std::cerr << \"Cannot write to file (\" << filename << \")\\n\";\n return false;\n }\n return true;\n}\n} \/\/ namespace\n\nint\nitkBMPImageIOTestExtension(int argc, char * argv[])\n{\n if (argc < 2)\n {\n std::cerr << \"Usage: \" << itkNameOfTestExecutableMacro(argv) << \" temporary_output_folder\\n\";\n return EXIT_FAILURE;\n }\n\n \/\/ filename shouldn't have bmp extension\n const std::string filename(std::string(argv[1]) + \"\/itkBMPImageIOTestExtension\");\n\n ITK_TEST_EXPECT_TRUE(WriteSmallBmp(filename));\n\n using ComponentType = unsigned char;\n using PixelType = itk::RGBPixel<ComponentType>;\n auto reader = itk::ImageFileReader<itk::Image<PixelType, 2>>::New();\n reader->SetFileName(filename);\n ITK_TRY_EXPECT_NO_EXCEPTION(reader->Update());\n\n const itk::ImageRegion<2> expected_region{ itk::Size<2>{ { 1, 1 } } };\n const ComponentType expected_rgb[] = { 255, 0, 0 };\n const PixelType expected_pixel{ expected_rgb };\n \/\/ check that data has been actually read\n auto image = reader->GetOutput();\n ITK_TEST_EXPECT_EQUAL(image->GetLargestPossibleRegion(), expected_region);\n ITK_TEST_EXPECT_EQUAL(image->GetPixel({ { 0, 0 } }), expected_pixel);\n std::cout << \"Test finished\\n\";\n return EXIT_SUCCESS;\n}\n<|endoftext|>"} {"text":"<commit_before>\/*\n * Copyright (c) 2015, Facebook, Inc.\n * All rights reserved.\n *\n * This source code is licensed under the BSD-style license found in the\n * LICENSE file in the root directory of this source tree. An additional grant\n * of patent rights can be found in the PATENTS file in the same directory.\n *\n *\/\n\n#include <vector>\n\n#include <fblualib\/LuaUtils.h>\n#include <fblualib\/Reactor.h>\n#include <fblualib\/UserData.h>\n#include <folly\/io\/async\/EventBase.h>\n#include <folly\/MoveWrapper.h>\n\nnamespace fblualib {\n\nnamespace {\n\nclass Reactor : public folly::Executor {\n enum : int {\n kImmediateCallbacksTable = 1,\n kDelayedCallbacksTable = 2,\n };\n public:\n enum LookupCallback : int {\n kNotFound = 0,\n kRunnable = 1,\n kDelayed = 2,\n };\n\n explicit Reactor(lua_State* L);\n ~Reactor();\n\n void add(folly::Func func) override;\n\n int luaLoop(lua_State* L);\n int luaAddCallback(lua_State* L);\n int luaAddCallbackDelayed(lua_State* L);\n int luaLookupCallback(lua_State* L);\n int luaRemoveCallback(lua_State* L);\n\n \/\/ Return a lightuserdata object that is a pointer to the corresponding\n \/\/ folly::Executor.\n int luaGetExecutor(lua_State* L);\n int luaGetEventBase(lua_State* L);\n int luaGC(lua_State* L);\n\n private:\n int doLoop(lua_State* L);\n\n void pushTable(lua_State* L, int table);\n int doAddCallback(lua_State* L);\n bool doLookupOrRemoveCallback(lua_State* L, int key, bool remove);\n int doLuaLookupOrRemoveCallback(lua_State* L, bool remove);\n void doAddDelayedCallback(lua_State* L, int key);\n\n int seq_;\n std::unique_ptr<folly::EventBase> eb_;\n};\n\nReactor::Reactor(lua_State* L)\n : seq_(0),\n eb_(std::make_unique<folly::EventBase>()) {\n lua_pushlightuserdata(L, this);\n lua_createtable(L, 2, 0);\n lua_newtable(L);\n lua_rawseti(L, -2, kImmediateCallbacksTable);\n lua_newtable(L);\n lua_rawseti(L, -2, kDelayedCallbacksTable);\n lua_settable(L, LUA_REGISTRYINDEX);\n}\n\nReactor::~Reactor() {\n DCHECK(!eb_); \/\/ luaGC must have been called\n}\n\nint Reactor::luaGC(lua_State* L) {\n \/\/ This is fugly.\n \/\/\n \/\/ The EventBase has pointers to this (via callbacks added using add()),\n \/\/ and it can run callbacks during destruction. So we must make sure to\n \/\/ drain it explicitly.\n \/\/\n \/\/ Even more, we normally only execute callbacks once we get back to Lua\n \/\/ (via luaLoop), so even if we drained the EventBase here, those callbacks\n \/\/ would never get to run.\n \/\/\n \/\/ So we have to drain it with a real Lua state.\n \/\/\n \/\/ We'll first destroy the EventBase (running any callbacks that need to run\n \/\/ during destruction) then drain our callback tables.\n\n \/\/ First, make sure eb_ is nullptr, so that any attempt to use it (perhaps\n \/\/ by referring to this Reactor recursively) fails hard. Then, destroy the\n \/\/ EventBase.\n\n auto prevLoopingState = detail::gLoopingState;\n SCOPE_EXIT {\n detail::gLoopingState = prevLoopingState;\n };\n detail::gLoopingState = LoopingState(L, this);\n\n eb_.reset();\n\n \/\/ Now, run our callbacks.\n pushTable(L, kImmediateCallbacksTable);\n while (doLoop(L) != 0) { }\n lua_pop(L, 1);\n\n lua_pushlightuserdata(L, this);\n lua_pushnil(L);\n lua_settable(L, LUA_REGISTRYINDEX);\n\n return 0;\n}\n\nnamespace {\nint runFunc(lua_State* L) {\n auto fptr = static_cast<folly::Func*>(lua_touserdata(L, lua_upvalueindex(1)));\n SCOPE_EXIT {\n delete fptr;\n };\n (*fptr)();\n return 0;\n}\n} \/\/ namespace\n\nvoid Reactor::add(folly::Func func) {\n if (!eb_) {\n \/\/ We're trying to add callbacks recursively during destruction.\n \/\/ This all stems from the fact that EventBase lets you do such horrible\n \/\/ things. There's absolutely nothing good we can do here, so we'll\n \/\/ do exactly what EventBase does -- ignore.\n return;\n }\n\n \/\/ We can't run the callback directly from the EventBase, because we\n \/\/ want Reactor to be reentrant; func may call back into Lua, which\n \/\/ may call loop() again, and EventBase doesn't like that. So we'll\n \/\/ unwind the stack and call the callbacks from loop().\n auto fptr = new folly::Func(std::move(func));\n eb_->add(\n [this, fptr] () {\n auto& ls = loopingState();\n DCHECK(ls.L);\n DCHECK(ls.executor == this);\n auto L = ls.L;\n pushTable(L, kImmediateCallbacksTable);\n lua_pushlightuserdata(L, fptr);\n pushWrappedCClosure(L, &runFunc, 1);\n doAddCallback(L);\n lua_pop(L, 1);\n });\n}\n\nint Reactor::luaAddCallbackDelayed(lua_State* L) {\n if (!eb_) {\n luaL_error(\n L, \"Reactor being destroyed, delayed callbacks no longer allowed\");\n }\n pushTable(L, kDelayedCallbacksTable);\n lua_pushvalue(L, 3);\n int key = doAddCallback(L);\n lua_pop(L, 1);\n\n std::chrono::duration<double> seconds(luaGetChecked<double>(L, 2));\n auto millis =\n std::chrono::duration_cast<std::chrono::milliseconds>(seconds).count();\n\n eb_->runAfterDelay(\n [this, key] () {\n auto& ls = loopingState();\n DCHECK(ls.L);\n DCHECK(ls.executor == this);\n doAddDelayedCallback(ls.L, key);\n },\n millis);\n\n lua_pushinteger(L, key);\n return 1;\n}\n\nint Reactor::luaAddCallback(lua_State* L) {\n pushTable(L, kImmediateCallbacksTable);\n lua_pushvalue(L, 2);\n lua_pushinteger(L, doAddCallback(L));\n return 1;\n}\n\nbool Reactor::doLookupOrRemoveCallback(lua_State* L, int key, bool remove) {\n \/\/ table\n lua_rawgeti(L, -1, key);\n \/\/ table cb\n bool found = !lua_isnil(L, -1);\n lua_pop(L, 1);\n if (found && remove) {\n lua_pushnil(L);\n lua_rawseti(L, -2, key);\n }\n return found;\n}\n\nint Reactor::doLuaLookupOrRemoveCallback(lua_State* L, bool remove) {\n auto key = luaGetChecked<int>(L, 2);\n\n pushTable(L, kImmediateCallbacksTable);\n if (doLookupOrRemoveCallback(L, key, remove)) {\n lua_pushinteger(L, kRunnable);\n return 1;\n }\n lua_pop(L, 1);\n\n pushTable(L, kDelayedCallbacksTable);\n if (doLookupOrRemoveCallback(L, key, remove)) {\n lua_pushinteger(L, kDelayed);\n return 1;\n }\n lua_pop(L, 1);\n\n lua_pushinteger(L, kNotFound);\n return 1;\n}\n\nint Reactor::luaRemoveCallback(lua_State* L) {\n return doLuaLookupOrRemoveCallback(L, true);\n}\n\nint Reactor::luaLookupCallback(lua_State* L) {\n return doLuaLookupOrRemoveCallback(L, false);\n}\n\nvoid Reactor::pushTable(lua_State* L, int table) {\n lua_pushlightuserdata(L, this);\n lua_gettable(L, LUA_REGISTRYINDEX);\n lua_rawgeti(L, -1, table);\n lua_remove(L, -2);\n}\n\nint Reactor::doAddCallback(lua_State* L) {\n \/\/ run_table cb\n int key = ++seq_;\n lua_rawseti(L, -2, key);\n \/\/ run_table\n return key;\n}\n\nvoid Reactor::doAddDelayedCallback(lua_State* L, int key) {\n lua_pushlightuserdata(L, this);\n lua_gettable(L, LUA_REGISTRYINDEX);\n lua_rawgeti(L, -1, kImmediateCallbacksTable);\n lua_rawgeti(L, -2, kDelayedCallbacksTable);\n\n \/\/ move from delayed to immediate table\n\n \/\/ tables immediate delayed\n lua_rawgeti(L, -1, key);\n \/\/ tables immediate delayed cb\n lua_pushnil(L);\n \/\/ tables immediate delayed cb nil\n lua_rawseti(L, -3, key);\n \/\/ tables immediate delayed cb\n lua_rawseti(L, -3, key);\n \/\/ tables immediate delayed\n lua_pop(L, 3);\n}\n\nint Reactor::luaLoop(lua_State* L) {\n auto block = luaGetChecked<bool>(L, 2);\n int flags = block ? 0 : EVLOOP_NONBLOCK;\n\n pushTable(L, kImmediateCallbacksTable);\n int numCallbacks = 0;\n int top = lua_gettop(L);\n\n auto prevLoopingState = detail::gLoopingState;\n SCOPE_EXIT {\n detail::gLoopingState = prevLoopingState;\n };\n detail::gLoopingState = LoopingState(L, this);\n\n auto keepAlive = eb_->loopKeepAlive();\n do {\n if (!eb_->loopOnce(flags)) {\n luaL_error(L, \"EventBase loop returned error!\");\n }\n\n DCHECK_EQ(top, lua_gettop(L));\n numCallbacks += doLoop(L);\n } while (block && numCallbacks == 0);\n\n luaPush(L, numCallbacks);\n return 1;\n}\n\nint Reactor::doLoop(lua_State* L) {\n int numCallbacks = 0;\n for (;;) {\n \/\/ tab\n lua_pushnil(L);\n \/\/ tab nil\n if (!lua_next(L, -2)) {\n break;\n }\n \/\/ tab key value\n lua_insert(L, -2);\n \/\/ tab value key\n lua_pushnil(L);\n \/\/ tab value key nil\n lua_rawset(L, -4);\n \/\/ tab value\n lua_call(L, 0, 0);\n \/\/ tab\n ++numCallbacks;\n }\n\n return numCallbacks;\n}\n\nint Reactor::luaGetExecutor(lua_State* L) {\n lua_pushlightuserdata(L, static_cast<folly::Executor*>(this));\n return 1;\n}\n\nint Reactor::luaGetEventBase(lua_State* L) {\n lua_pushlightuserdata(L, eb_.get());\n return 1;\n}\n\nint luaNew(lua_State* L) {\n pushUserData<Reactor>(L, L);\n return 1;\n}\n\nconst luaL_Reg gModuleFuncs[] = {\n {\"new\", luaNew},\n {nullptr, nullptr},\n};\n\n} \/\/ namespace\n\ntemplate <>\nconst UserDataMethod<Reactor> Metatable<Reactor>::methods[] = {\n {\"add_callback\", &Reactor::luaAddCallback},\n {\"add_callback_delayed\", &Reactor::luaAddCallbackDelayed},\n {\"lookup_callback\", &Reactor::luaLookupCallback},\n {\"remove_callback\", &Reactor::luaRemoveCallback},\n {\"loop\", &Reactor::luaLoop},\n {\"get_executor\", &Reactor::luaGetExecutor},\n {\"get_event_base\", &Reactor::luaGetEventBase},\n {\"__gc\", &Reactor::luaGC},\n {nullptr, nullptr},\n};\n\n} \/\/ namespace fblualib\n\nusing namespace fblualib;\n\nextern \"C\" int LUAOPEN(lua_State* L) {\n lua_newtable(L);\n luaL_register(L, nullptr, gModuleFuncs);\n\n lua_pushinteger(L, Reactor::kNotFound);\n lua_setfield(L, -2, \"NOT_FOUND\");\n\n lua_pushinteger(L, Reactor::kRunnable);\n lua_setfield(L, -2, \"RUNNABLE\");\n\n lua_pushinteger(L, Reactor::kDelayed);\n lua_setfield(L, -2, \"DELAYED\");\n\n return 1;\n}\n<commit_msg>Add keepAlive() mechanism<commit_after>\/*\n * Copyright (c) 2015, Facebook, Inc.\n * All rights reserved.\n *\n * This source code is licensed under the BSD-style license found in the\n * LICENSE file in the root directory of this source tree. An additional grant\n * of patent rights can be found in the PATENTS file in the same directory.\n *\n *\/\n\n#include <vector>\n\n#include <fblualib\/LuaUtils.h>\n#include <fblualib\/Reactor.h>\n#include <fblualib\/UserData.h>\n#include <folly\/io\/async\/EventBase.h>\n#include <folly\/MoveWrapper.h>\n\nnamespace fblualib {\n\nnamespace {\n\nclass Reactor : public folly::Executor {\n enum : int {\n kImmediateCallbacksTable = 1,\n kDelayedCallbacksTable = 2,\n };\n public:\n enum LookupCallback : int {\n kNotFound = 0,\n kRunnable = 1,\n kDelayed = 2,\n };\n\n explicit Reactor(lua_State* L);\n ~Reactor();\n\n void add(folly::Func func) override;\n\n int luaLoop(lua_State* L);\n int luaAddCallback(lua_State* L);\n int luaAddCallbackDelayed(lua_State* L);\n int luaLookupCallback(lua_State* L);\n int luaRemoveCallback(lua_State* L);\n\n \/\/ Return a lightuserdata object that is a pointer to the corresponding\n \/\/ folly::Executor.\n int luaGetExecutor(lua_State* L);\n int luaGetEventBase(lua_State* L);\n int luaGC(lua_State* L);\n\n private:\n int doLoop(lua_State* L);\n\n void pushTable(lua_State* L, int table);\n int doAddCallback(lua_State* L);\n bool doLookupOrRemoveCallback(lua_State* L, int key, bool remove);\n int doLuaLookupOrRemoveCallback(lua_State* L, bool remove);\n void doAddDelayedCallback(lua_State* L, int key);\n\n int seq_;\n std::unique_ptr<folly::EventBase> eb_;\n};\n\nReactor::Reactor(lua_State* L)\n : seq_(0),\n eb_(std::make_unique<folly::EventBase>()) {\n lua_pushlightuserdata(L, this);\n lua_createtable(L, 2, 0);\n lua_newtable(L);\n lua_rawseti(L, -2, kImmediateCallbacksTable);\n lua_newtable(L);\n lua_rawseti(L, -2, kDelayedCallbacksTable);\n lua_settable(L, LUA_REGISTRYINDEX);\n}\n\nReactor::~Reactor() {\n DCHECK(!eb_); \/\/ luaGC must have been called\n}\n\nint Reactor::luaGC(lua_State* L) {\n \/\/ This is fugly.\n \/\/\n \/\/ The EventBase has pointers to this (via callbacks added using add()),\n \/\/ and it can run callbacks during destruction. So we must make sure to\n \/\/ drain it explicitly.\n \/\/\n \/\/ Even more, we normally only execute callbacks once we get back to Lua\n \/\/ (via luaLoop), so even if we drained the EventBase here, those callbacks\n \/\/ would never get to run.\n \/\/\n \/\/ So we have to drain it with a real Lua state.\n \/\/\n \/\/ We'll first destroy the EventBase (running any callbacks that need to run\n \/\/ during destruction) then drain our callback tables.\n\n \/\/ First, make sure eb_ is nullptr, so that any attempt to use it (perhaps\n \/\/ by referring to this Reactor recursively) fails hard. Then, destroy the\n \/\/ EventBase.\n\n auto prevLoopingState = detail::gLoopingState;\n SCOPE_EXIT {\n detail::gLoopingState = prevLoopingState;\n };\n detail::gLoopingState = LoopingState(L, this);\n\n eb_.reset();\n\n \/\/ Now, run our callbacks.\n pushTable(L, kImmediateCallbacksTable);\n while (doLoop(L) != 0) { }\n lua_pop(L, 1);\n\n lua_pushlightuserdata(L, this);\n lua_pushnil(L);\n lua_settable(L, LUA_REGISTRYINDEX);\n\n return 0;\n}\n\nnamespace {\nint runFunc(lua_State* L) {\n auto fptr = static_cast<folly::Func*>(lua_touserdata(L, lua_upvalueindex(1)));\n SCOPE_EXIT {\n delete fptr;\n };\n (*fptr)();\n return 0;\n}\n} \/\/ namespace\n\nvoid Reactor::add(folly::Func func) {\n if (!eb_) {\n \/\/ We're trying to add callbacks recursively during destruction.\n \/\/ This all stems from the fact that EventBase lets you do such horrible\n \/\/ things. There's absolutely nothing good we can do here, so we'll\n \/\/ do exactly what EventBase does -- ignore.\n return;\n }\n\n \/\/ We can't run the callback directly from the EventBase, because we\n \/\/ want Reactor to be reentrant; func may call back into Lua, which\n \/\/ may call loop() again, and EventBase doesn't like that. So we'll\n \/\/ unwind the stack and call the callbacks from loop().\n auto fptr = new folly::Func(std::move(func));\n eb_->add(\n [this, fptr] () {\n auto& ls = loopingState();\n DCHECK(ls.L);\n DCHECK(ls.executor == this);\n auto L = ls.L;\n pushTable(L, kImmediateCallbacksTable);\n lua_pushlightuserdata(L, fptr);\n pushWrappedCClosure(L, &runFunc, 1);\n doAddCallback(L);\n lua_pop(L, 1);\n });\n}\n\nint Reactor::luaAddCallbackDelayed(lua_State* L) {\n if (!eb_) {\n luaL_error(\n L, \"Reactor being destroyed, delayed callbacks no longer allowed\");\n }\n pushTable(L, kDelayedCallbacksTable);\n lua_pushvalue(L, 3);\n int key = doAddCallback(L);\n lua_pop(L, 1);\n\n std::chrono::duration<double> seconds(luaGetChecked<double>(L, 2));\n auto millis =\n std::chrono::duration_cast<std::chrono::milliseconds>(seconds).count();\n\n eb_->runAfterDelay(\n [this, key] () {\n auto& ls = loopingState();\n DCHECK(ls.L);\n DCHECK(ls.executor == this);\n doAddDelayedCallback(ls.L, key);\n },\n millis);\n\n lua_pushinteger(L, key);\n return 1;\n}\n\nint Reactor::luaAddCallback(lua_State* L) {\n pushTable(L, kImmediateCallbacksTable);\n lua_pushvalue(L, 2);\n lua_pushinteger(L, doAddCallback(L));\n return 1;\n}\n\nbool Reactor::doLookupOrRemoveCallback(lua_State* L, int key, bool remove) {\n \/\/ table\n lua_rawgeti(L, -1, key);\n \/\/ table cb\n bool found = !lua_isnil(L, -1);\n lua_pop(L, 1);\n if (found && remove) {\n lua_pushnil(L);\n lua_rawseti(L, -2, key);\n }\n return found;\n}\n\nint Reactor::doLuaLookupOrRemoveCallback(lua_State* L, bool remove) {\n auto key = luaGetChecked<int>(L, 2);\n\n pushTable(L, kImmediateCallbacksTable);\n if (doLookupOrRemoveCallback(L, key, remove)) {\n lua_pushinteger(L, kRunnable);\n return 1;\n }\n lua_pop(L, 1);\n\n pushTable(L, kDelayedCallbacksTable);\n if (doLookupOrRemoveCallback(L, key, remove)) {\n lua_pushinteger(L, kDelayed);\n return 1;\n }\n lua_pop(L, 1);\n\n lua_pushinteger(L, kNotFound);\n return 1;\n}\n\nint Reactor::luaRemoveCallback(lua_State* L) {\n return doLuaLookupOrRemoveCallback(L, true);\n}\n\nint Reactor::luaLookupCallback(lua_State* L) {\n return doLuaLookupOrRemoveCallback(L, false);\n}\n\nvoid Reactor::pushTable(lua_State* L, int table) {\n lua_pushlightuserdata(L, this);\n lua_gettable(L, LUA_REGISTRYINDEX);\n lua_rawgeti(L, -1, table);\n lua_remove(L, -2);\n}\n\nint Reactor::doAddCallback(lua_State* L) {\n \/\/ run_table cb\n int key = ++seq_;\n lua_rawseti(L, -2, key);\n \/\/ run_table\n return key;\n}\n\nvoid Reactor::doAddDelayedCallback(lua_State* L, int key) {\n lua_pushlightuserdata(L, this);\n lua_gettable(L, LUA_REGISTRYINDEX);\n lua_rawgeti(L, -1, kImmediateCallbacksTable);\n lua_rawgeti(L, -2, kDelayedCallbacksTable);\n\n \/\/ move from delayed to immediate table\n\n \/\/ tables immediate delayed\n lua_rawgeti(L, -1, key);\n \/\/ tables immediate delayed cb\n lua_pushnil(L);\n \/\/ tables immediate delayed cb nil\n lua_rawseti(L, -3, key);\n \/\/ tables immediate delayed cb\n lua_rawseti(L, -3, key);\n \/\/ tables immediate delayed\n lua_pop(L, 3);\n}\n\nint Reactor::luaLoop(lua_State* L) {\n auto block = luaGetChecked<bool>(L, 2);\n int flags = block ? 0 : EVLOOP_NONBLOCK;\n\n pushTable(L, kImmediateCallbacksTable);\n int numCallbacks = 0;\n int top = lua_gettop(L);\n\n auto prevLoopingState = detail::gLoopingState;\n SCOPE_EXIT {\n detail::gLoopingState = prevLoopingState;\n };\n detail::gLoopingState = LoopingState(L, this);\n\n auto keepAlive = eb_->getKeepAliveToken();\n do {\n if (!eb_->loopOnce(flags)) {\n luaL_error(L, \"EventBase loop returned error!\");\n }\n\n DCHECK_EQ(top, lua_gettop(L));\n numCallbacks += doLoop(L);\n } while (block && numCallbacks == 0);\n\n luaPush(L, numCallbacks);\n return 1;\n}\n\nint Reactor::doLoop(lua_State* L) {\n int numCallbacks = 0;\n for (;;) {\n \/\/ tab\n lua_pushnil(L);\n \/\/ tab nil\n if (!lua_next(L, -2)) {\n break;\n }\n \/\/ tab key value\n lua_insert(L, -2);\n \/\/ tab value key\n lua_pushnil(L);\n \/\/ tab value key nil\n lua_rawset(L, -4);\n \/\/ tab value\n lua_call(L, 0, 0);\n \/\/ tab\n ++numCallbacks;\n }\n\n return numCallbacks;\n}\n\nint Reactor::luaGetExecutor(lua_State* L) {\n lua_pushlightuserdata(L, static_cast<folly::Executor*>(this));\n return 1;\n}\n\nint Reactor::luaGetEventBase(lua_State* L) {\n lua_pushlightuserdata(L, eb_.get());\n return 1;\n}\n\nint luaNew(lua_State* L) {\n pushUserData<Reactor>(L, L);\n return 1;\n}\n\nconst luaL_Reg gModuleFuncs[] = {\n {\"new\", luaNew},\n {nullptr, nullptr},\n};\n\n} \/\/ namespace\n\ntemplate <>\nconst UserDataMethod<Reactor> Metatable<Reactor>::methods[] = {\n {\"add_callback\", &Reactor::luaAddCallback},\n {\"add_callback_delayed\", &Reactor::luaAddCallbackDelayed},\n {\"lookup_callback\", &Reactor::luaLookupCallback},\n {\"remove_callback\", &Reactor::luaRemoveCallback},\n {\"loop\", &Reactor::luaLoop},\n {\"get_executor\", &Reactor::luaGetExecutor},\n {\"get_event_base\", &Reactor::luaGetEventBase},\n {\"__gc\", &Reactor::luaGC},\n {nullptr, nullptr},\n};\n\n} \/\/ namespace fblualib\n\nusing namespace fblualib;\n\nextern \"C\" int LUAOPEN(lua_State* L) {\n lua_newtable(L);\n luaL_register(L, nullptr, gModuleFuncs);\n\n lua_pushinteger(L, Reactor::kNotFound);\n lua_setfield(L, -2, \"NOT_FOUND\");\n\n lua_pushinteger(L, Reactor::kRunnable);\n lua_setfield(L, -2, \"RUNNABLE\");\n\n lua_pushinteger(L, Reactor::kDelayed);\n lua_setfield(L, -2, \"DELAYED\");\n\n return 1;\n}\n<|endoftext|>"} {"text":"<commit_before>\/\/ @(#)root\/eve7:$Id$\n\/\/ Authors: Matevz Tadel & Alja Mrak-Tadel: 2006, 2007, 2018\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\/REveDataCollection.hxx>\n#include <ROOT\/REveUtil.hxx>\n#include <ROOT\/REveSelection.hxx>\n#include <ROOT\/REveManager.hxx>\n\n#include \"TROOT.h\"\n#include \"TMethod.h\"\n#include \"TMethodArg.h\"\n#include \"TColor.h\"\n#include \"TClass.h\"\n#include \"TList.h\"\n#include \"TBaseClass.h\"\n\n#include <sstream>\n#include <regex>\n\n#include <nlohmann\/json.hpp>\n\nusing namespace ROOT::Experimental;\n\n\nColor_t REveDataCollection::fgDefaultColor = kBlue;\n\n\/\/==============================================================================\n\/\/==============================================================================\n\nREveDataItemList::REveDataItemList(const std::string& n, const std::string& t):\n REveElement(n,t)\n{\n fAlwaysSecSelect = true;\n\n SetItemsChangeDelegate([&](REveDataItemList *collection, const REveDataCollection::Ids_t &ids) {\n REveDataItemList::DummyItemsChange(collection, ids);\n });\n\n SetFillImpliedSelectedDelegate([&](REveDataItemList *collection, REveElement::Set_t &impSelSet) {\n REveDataItemList::DummyFillImpliedSelected(collection, impSelSet);\n });\n\n SetupDefaultColorAndTransparency(REveDataCollection::fgDefaultColor, true, true);\n}\n\/\/______________________________________________________________________________\n\nvoid REveDataItemList::SetItemVisible(Int_t idx, Bool_t visible)\n{\n fItems[idx]->SetRnrSelf(visible);\n ItemChanged(idx);\n StampObjProps();\n}\n\n\/\/______________________________________________________________________________\n\nvoid REveDataItemList::SetItemColorRGB(Int_t idx, UChar_t r, UChar_t g, UChar_t b)\n{\n Color_t c = TColor::GetColor(r, g, b);\n fItems[idx]->SetMainColor(c);\n ItemChanged(idx);\n StampObjProps();\n}\n\/\/______________________________________________________________________________\n\nvoid REveDataItemList::ItemChanged(REveDataItem* iItem)\n{\n int idx = 0;\n std::vector<int> ids;\n for (auto & chld : fItems)\n {\n if (chld == iItem) {\n ids.push_back(idx);\n fHandlerItemsChange( this , ids);\n return;\n }\n idx++;\n }\n}\n\n\/\/______________________________________________________________________________\n\nvoid REveDataItemList::ItemChanged(Int_t idx)\n{\n std::vector<int> ids;\n ids.push_back(idx);\n fHandlerItemsChange( this , ids);\n}\n\n\/\/______________________________________________________________________________\n\nvoid REveDataItemList::FillImpliedSelectedSet( Set_t& impSelSet)\n{\n \/*\n printf(\"REveDataItemList::FillImpliedSelectedSet colecction setsize %zu\\n\", RefSelectedSet().size());\n for (auto x : RefSelectedSet())\n printf(\"%d \\n\", x);\n *\/\n fHandlerFillImplied( this , impSelSet);\n}\n\n\/\/______________________________________________________________________________\n\n\nInt_t REveDataItemList::WriteCoreJson(nlohmann::json &j, Int_t rnr_offset)\n{\n Int_t ret = REveElement::WriteCoreJson(j, rnr_offset);\n j[\"items\"] = nlohmann::json::array();\n for (auto & chld : fItems)\n {\n nlohmann::json i;\n i[\"fFiltered\"] = chld->GetFiltered();\n i[\"fRnrSelf\"] = chld->GetRnrSelf();\n i[\"fColor\"] = chld->GetMainColor();\n j[\"items\"].push_back(i);\n }\n\n return ret;\n}\n\n\/\/______________________________________________________________________________\n\nBool_t REveDataItemList::SetRnrState(Bool_t iRnrSelf)\n{\n Bool_t ret = REveElement::SetRnrState(iRnrSelf);\n std::vector<int> ids;\n\n for (size_t i = 0; i < fItems.size(); ++i ) {\n ids.push_back(i);\n fItems[i]->SetRnrSelf(fRnrSelf);\n }\n\n fHandlerItemsChange( this , ids);\n StampVisibility();\n StampObjProps();\n\n return ret;\n}\n\n\n\/\/______________________________________________________________________________\nvoid REveDataItemList::ProcessSelectionStr(ElementId_t id, bool multi, bool secondary, const char* secondary_idcs)\n{\n static const REveException eh(\"REveDataItemList::ProcessSelectionStr \");\n static const std::regex comma_re(\"\\\\s*,\\\\s*\", std::regex::optimize);\n std::string str(secondary_idcs);\n std::set<int> sis;\n std::sregex_token_iterator itr(str.begin(), str.end(), comma_re, -1);\n std::sregex_token_iterator end;\n\n try {\n while (itr != end) sis.insert(std::stoi(*itr++));\n }\n catch (const std::invalid_argument& ia) {\n throw eh + \"invalid secondary index argument '\" + *itr + \"' - must be int.\";\n }\n\n ProcessSelection(id, multi, secondary, sis);\n}\n\n\n\/\/______________________________________________________________________________\nvoid REveDataItemList::ProcessSelection(ElementId_t selectionId, bool multi, bool secondary, const std::set<int>& secondary_idcs)\n{\n RefSelectedSet() = secondary_idcs;\n REveSelection* selection = (REveSelection*) ROOT::Experimental::gEve->FindElementById(selectionId);\n selection->NewElementPicked(GetElementId(), multi, secondary, secondary_idcs);\n}\n\n\/\/______________________________________________________________________________\nstd::string REveDataItemList::GetHighlightTooltip(const std::set<int>& secondary_idcs) const\n{\n if (secondary_idcs.empty()) {\n return GetName();\n }\n\n \/\/ print info for first selected index\n int idx = *secondary_idcs.begin();\n auto col = dynamic_cast<REveDataCollection*>(fMother);\n void* data = col->GetDataPtr(idx);\n std::string name = col->GetName();\n auto li = name.size();\n if (li && name[li-1] == 's')\n {\n name = name.substr(0, li-1);\n }\n\n std::string res;\n for (auto &z : secondary_idcs)\n {\n idx = z;\n data = col->GetDataPtr(idx);\n res += std::string(TString::Format(\"%s %d\", name.c_str(), idx));\n for (auto &t : fTooltipExpressions) {\n std::string eval = t->fTooltipFunction.EvalExpr(data);\n res += std::string(TString::Format(\"\\n %s = %s\", t->fTooltipTitle.c_str(), eval.c_str()));\n }\n res += \"\\n\";\n }\n return res;\n}\n\n\/\/______________________________________________________________________________\nvoid REveDataItemList::AddTooltipExpression(const std::string &title, const std::string &expr, bool init)\n{\n fTooltipExpressions.push_back(std::unique_ptr<TTip>(new TTip()));\n TTip *tt = fTooltipExpressions.back().get();\n\n tt->fTooltipTitle = title;\n tt->fTooltipFunction.SetPrecision(2);\n auto col = dynamic_cast<REveDataCollection *>(fMother);\n auto icls = col->GetItemClass();\n tt->fTooltipFunction.SetExpressionAndType(expr, REveDataColumn::FT_Double, icls);\n\n if (init) {\n auto re = tt->fTooltipFunction.GetFunctionExpressionString();\n gROOT->ProcessLine(re.c_str());\n }\n}\n\n\/\/______________________________________________________________________________\nvoid REveDataItemList::SetItemsChangeDelegate (ItemsChangeFunc_t handler_func)\n{\n fHandlerItemsChange = handler_func;\n}\n\n\/\/______________________________________________________________________________\nvoid REveDataItemList::SetFillImpliedSelectedDelegate (FillImpliedSelectedFunc_t handler_func)\n{\n fHandlerFillImplied = handler_func;\n}\n\n\/\/______________________________________________________________________________\nvoid REveDataItemList::DummyItemsChange(REveDataItemList*, const std::vector<int>&)\n{\n if (gDebug) {\n printf(\"REveDataItemList::DummyItemsCahngeDelegate not implemented\\n\");\n }\n}\n\n\n\/\/______________________________________________________________________________\nvoid REveDataItemList::DummyFillImpliedSelected(REveDataItemList*, REveElement::Set_t&)\n{\n if (gDebug) {\n printf(\"REveDataItemList::DummyFillImpliedSelectedDelegate not implemented\\n\");\n }\n}\n\n\/\/==============================================================================\n\/\/ REveDataCollection\n\/\/==============================================================================\n\nREveDataCollection::REveDataCollection(const std::string& n, const std::string& t) :\n REveElement(n, t)\n{\n std::string lname = n + \"Items\";\n fItemList = new REveDataItemList(lname.c_str());\n AddElement(fItemList);\n\n SetupDefaultColorAndTransparency(fgDefaultColor, true, true);\n}\n\nvoid REveDataCollection::AddItem(void *data_ptr, const std::string& \/*n*\/, const std::string& \/*t*\/)\n{\n auto el = new REveDataItem(data_ptr, GetMainColor());\n fItemList->fItems.emplace_back(el);\n}\n\n\/\/------------------------------------------------------------------------------\n\nvoid REveDataCollection::SetFilterExpr(const char* filter)\n{\n static const REveException eh(\"REveDataCollection::SetFilterExpr \");\n\n if (!fItemClass)\n throw eh + \"item class has to be set before the filter expression.\";\n\n fFilterExpr = filter;\n if (fFilterExpr.Length())\n {\n std::stringstream s;\n s << \"*((std::function<bool(\" << fItemClass->GetName() << \"*)>*)\" << std::hex << std::showbase\n << (size_t)&fFilterFoo << \") = [](\" << fItemClass->GetName() << \"* p){\" << fItemClass->GetName()\n << \" &i=*p; return (\" << fFilterExpr.Data() << \"); };\";\n\n \/\/ printf(\"%s\\n\", s.Data());\n try {\n gROOT->ProcessLine(s.str().c_str());\n \/\/ AMT I don't know why ApplyFilter call is separated\n ApplyFilter();\n }\n catch (const std::exception &exc)\n {\n R__LOG_ERROR(REveLog()) << \"EveDataCollection::SetFilterExpr\" << exc.what();\n }\n }\n else \n {\n \/\/ Remove filter\n fFilterFoo = nullptr;\n Ids_t ids;\n int idx = 0;\n for (auto &ii : fItemList->fItems) {\n if (ii->GetFiltered()) {\n ii->SetFiltered(false);\n ids.push_back(idx);\n idx++;\n }\n }\n\n StampObjProps();\n fItemList->StampObjProps();\n fItemList->fHandlerItemsChange(fItemList, ids);\n }\n}\n\nvoid REveDataCollection::ApplyFilter()\n{\n if (!fFilterFoo)\n return;\n \n Ids_t ids;\n int idx = 0;\n for (auto &ii : fItemList->fItems)\n {\n bool res = fFilterFoo(ii->GetDataPtr());\n\n \/\/ printf(\"Item:%s -- filter result = %d\\n\", ii.fItemPtr->GetElementName(), res);\n\n ii->SetFiltered( ! res );\n\n ids.push_back(idx++);\n }\n StampObjProps();\n fItemList->StampObjProps();\n fItemList->fHandlerItemsChange( fItemList , ids);\n}\n\n\/\/______________________________________________________________________________\n\nvoid REveDataCollection::StreamPublicMethods(nlohmann::json &j) const\n{\n struct PubMethods\n {\n void FillJSON(TClass* c, nlohmann::json & arr)\n {\n TString ctor = c->GetName(), dtor = \"~\";\n {\n int i = ctor.Last(':');\n if (i != kNPOS)\n {\n ctor.Replace(0, i + 1, \"\");\n }\n dtor += ctor;\n }\n\n TMethod *meth;\n TIter next(c->GetListOfMethods());\n while ((meth = (TMethod*) next()))\n {\n \/\/ Filter out ctor, dtor, some ROOT stuff.\n {\n TString m(meth->GetName());\n if (m == ctor || m == dtor ||\n m == \"Class\" || m == \"Class_Name\" || m == \"Class_Version\" || m == \"Dictionary\" || m == \"IsA\" ||\n m == \"DeclFileName\" || m == \"ImplFileName\" || m == \"DeclFileLine\" || m == \"ImplFileLine\" ||\n m == \"Streamer\" || m == \"StreamerNVirtual\" || m == \"ShowMembers\" ||\n m == \"CheckTObjectHashConsistency\")\n {\n continue;\n }\n }\n\n TString ms;\n TMethodArg *ma;\n TIter next_ma(meth->GetListOfMethodArgs());\n while ((ma = (TMethodArg*) next_ma()))\n {\n if ( ! ms.IsNull()) ms += \", \";\n\n ms += ma->GetTypeName();\n ms += \" \";\n ms += ma->GetName();\n }\n std::string entry(TString::Format(\"i.%s(%s)\",meth->GetName(),ms.Data()).Data());\n nlohmann::json jm ;\n jm[\"f\"] = entry;\n jm[\"r\"] = meth->GetReturnTypeName();\n jm[\"c\"] = c->GetName();\n arr.push_back(jm);\n }\n {\n TBaseClass *base;\n TIter blnext(c->GetListOfBases());\n while ((base = (TBaseClass*) blnext()))\n {\n FillJSON(base->GetClassPointer(), arr);\n }\n }\n }\n };\n j[\"fPublicFunctions\"] = nlohmann::json::array();\n PubMethods pm;\n pm.FillJSON(fItemClass, j[\"fPublicFunctions\"]);\n}\n\n\/\/______________________________________________________________________________\n\nvoid REveDataCollection::SetMainColor(Color_t newv)\n{\n int idx = 0;\n Ids_t ids;\n for (auto & chld : fItemList->fItems)\n {\n chld->SetMainColor(newv);\n ids.push_back(idx);\n idx++;\n }\n\n REveElement::SetMainColor(newv);\n for (auto & chld : fItemList->fItems)\n {\n chld->SetMainColor(newv);\n }\n fItemList->StampObjProps();\n fItemList->SetMainColor(newv);\n fItemList->fHandlerItemsChange( fItemList , ids);\n}\n\n\/\/______________________________________________________________________________\n\nBool_t REveDataCollection::SetRnrState(Bool_t iRnrSelf)\n{\n Bool_t ret = REveElement::SetRnrState(iRnrSelf);\n Ids_t ids;\n for (int i = 0; i < GetNItems(); ++i ) {\n ids.push_back(i);\n fItemList->fItems[i]->SetRnrSelf(fRnrSelf);\n }\n\n fItemList->StampObjProps();\n fItemList->fHandlerItemsChange( fItemList , ids);\n\n return ret;\n}\n\n\n\/\/______________________________________________________________________________\n\nInt_t REveDataCollection::WriteCoreJson(nlohmann::json &j, Int_t rnr_offset)\n{\n Int_t ret = REveElement::WriteCoreJson(j, rnr_offset);\n j[\"fFilterExpr\"] = fFilterExpr.Data();\n return ret;\n}\n\n<commit_msg>Corrections in remove filter<commit_after>\/\/ @(#)root\/eve7:$Id$\n\/\/ Authors: Matevz Tadel & Alja Mrak-Tadel: 2006, 2007, 2018\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\/REveDataCollection.hxx>\n#include <ROOT\/REveUtil.hxx>\n#include <ROOT\/REveSelection.hxx>\n#include <ROOT\/REveManager.hxx>\n\n#include \"TROOT.h\"\n#include \"TMethod.h\"\n#include \"TMethodArg.h\"\n#include \"TColor.h\"\n#include \"TClass.h\"\n#include \"TList.h\"\n#include \"TBaseClass.h\"\n\n#include <sstream>\n#include <regex>\n\n#include <nlohmann\/json.hpp>\n\nusing namespace ROOT::Experimental;\n\n\nColor_t REveDataCollection::fgDefaultColor = kBlue;\n\n\/\/==============================================================================\n\/\/==============================================================================\n\nREveDataItemList::REveDataItemList(const std::string& n, const std::string& t):\n REveElement(n,t)\n{\n fAlwaysSecSelect = true;\n\n SetItemsChangeDelegate([&](REveDataItemList *collection, const REveDataCollection::Ids_t &ids) {\n REveDataItemList::DummyItemsChange(collection, ids);\n });\n\n SetFillImpliedSelectedDelegate([&](REveDataItemList *collection, REveElement::Set_t &impSelSet) {\n REveDataItemList::DummyFillImpliedSelected(collection, impSelSet);\n });\n\n SetupDefaultColorAndTransparency(REveDataCollection::fgDefaultColor, true, true);\n}\n\/\/______________________________________________________________________________\n\nvoid REveDataItemList::SetItemVisible(Int_t idx, Bool_t visible)\n{\n fItems[idx]->SetRnrSelf(visible);\n ItemChanged(idx);\n StampObjProps();\n}\n\n\/\/______________________________________________________________________________\n\nvoid REveDataItemList::SetItemColorRGB(Int_t idx, UChar_t r, UChar_t g, UChar_t b)\n{\n Color_t c = TColor::GetColor(r, g, b);\n fItems[idx]->SetMainColor(c);\n ItemChanged(idx);\n StampObjProps();\n}\n\/\/______________________________________________________________________________\n\nvoid REveDataItemList::ItemChanged(REveDataItem* iItem)\n{\n int idx = 0;\n std::vector<int> ids;\n for (auto & chld : fItems)\n {\n if (chld == iItem) {\n ids.push_back(idx);\n fHandlerItemsChange( this , ids);\n return;\n }\n idx++;\n }\n}\n\n\/\/______________________________________________________________________________\n\nvoid REveDataItemList::ItemChanged(Int_t idx)\n{\n std::vector<int> ids;\n ids.push_back(idx);\n fHandlerItemsChange( this , ids);\n}\n\n\/\/______________________________________________________________________________\n\nvoid REveDataItemList::FillImpliedSelectedSet( Set_t& impSelSet)\n{\n \/*\n printf(\"REveDataItemList::FillImpliedSelectedSet colecction setsize %zu\\n\", RefSelectedSet().size());\n for (auto x : RefSelectedSet())\n printf(\"%d \\n\", x);\n *\/\n fHandlerFillImplied( this , impSelSet);\n}\n\n\/\/______________________________________________________________________________\n\n\nInt_t REveDataItemList::WriteCoreJson(nlohmann::json &j, Int_t rnr_offset)\n{\n Int_t ret = REveElement::WriteCoreJson(j, rnr_offset);\n j[\"items\"] = nlohmann::json::array();\n for (auto & chld : fItems)\n {\n nlohmann::json i;\n i[\"fFiltered\"] = chld->GetFiltered();\n i[\"fRnrSelf\"] = chld->GetRnrSelf();\n i[\"fColor\"] = chld->GetMainColor();\n j[\"items\"].push_back(i);\n }\n\n return ret;\n}\n\n\/\/______________________________________________________________________________\n\nBool_t REveDataItemList::SetRnrState(Bool_t iRnrSelf)\n{\n Bool_t ret = REveElement::SetRnrState(iRnrSelf);\n std::vector<int> ids;\n\n for (size_t i = 0; i < fItems.size(); ++i ) {\n ids.push_back(i);\n fItems[i]->SetRnrSelf(fRnrSelf);\n }\n\n fHandlerItemsChange( this , ids);\n StampVisibility();\n StampObjProps();\n\n return ret;\n}\n\n\n\/\/______________________________________________________________________________\nvoid REveDataItemList::ProcessSelectionStr(ElementId_t id, bool multi, bool secondary, const char* secondary_idcs)\n{\n static const REveException eh(\"REveDataItemList::ProcessSelectionStr \");\n static const std::regex comma_re(\"\\\\s*,\\\\s*\", std::regex::optimize);\n std::string str(secondary_idcs);\n std::set<int> sis;\n std::sregex_token_iterator itr(str.begin(), str.end(), comma_re, -1);\n std::sregex_token_iterator end;\n\n try {\n while (itr != end) sis.insert(std::stoi(*itr++));\n }\n catch (const std::invalid_argument& ia) {\n throw eh + \"invalid secondary index argument '\" + *itr + \"' - must be int.\";\n }\n\n ProcessSelection(id, multi, secondary, sis);\n}\n\n\n\/\/______________________________________________________________________________\nvoid REveDataItemList::ProcessSelection(ElementId_t selectionId, bool multi, bool secondary, const std::set<int>& secondary_idcs)\n{\n RefSelectedSet() = secondary_idcs;\n REveSelection* selection = (REveSelection*) ROOT::Experimental::gEve->FindElementById(selectionId);\n selection->NewElementPicked(GetElementId(), multi, secondary, secondary_idcs);\n}\n\n\/\/______________________________________________________________________________\nstd::string REveDataItemList::GetHighlightTooltip(const std::set<int>& secondary_idcs) const\n{\n if (secondary_idcs.empty()) {\n return GetName();\n }\n\n \/\/ print info for first selected index\n int idx = *secondary_idcs.begin();\n auto col = dynamic_cast<REveDataCollection*>(fMother);\n void* data = col->GetDataPtr(idx);\n std::string name = col->GetName();\n auto li = name.size();\n if (li && name[li-1] == 's')\n {\n name = name.substr(0, li-1);\n }\n\n std::string res;\n for (auto &z : secondary_idcs)\n {\n idx = z;\n data = col->GetDataPtr(idx);\n res += std::string(TString::Format(\"%s %d\", name.c_str(), idx));\n for (auto &t : fTooltipExpressions) {\n std::string eval = t->fTooltipFunction.EvalExpr(data);\n res += std::string(TString::Format(\"\\n %s = %s\", t->fTooltipTitle.c_str(), eval.c_str()));\n }\n res += \"\\n\";\n }\n return res;\n}\n\n\/\/______________________________________________________________________________\nvoid REveDataItemList::AddTooltipExpression(const std::string &title, const std::string &expr, bool init)\n{\n fTooltipExpressions.push_back(std::unique_ptr<TTip>(new TTip()));\n TTip *tt = fTooltipExpressions.back().get();\n\n tt->fTooltipTitle = title;\n tt->fTooltipFunction.SetPrecision(2);\n auto col = dynamic_cast<REveDataCollection *>(fMother);\n auto icls = col->GetItemClass();\n tt->fTooltipFunction.SetExpressionAndType(expr, REveDataColumn::FT_Double, icls);\n\n if (init) {\n auto re = tt->fTooltipFunction.GetFunctionExpressionString();\n gROOT->ProcessLine(re.c_str());\n }\n}\n\n\/\/______________________________________________________________________________\nvoid REveDataItemList::SetItemsChangeDelegate (ItemsChangeFunc_t handler_func)\n{\n fHandlerItemsChange = handler_func;\n}\n\n\/\/______________________________________________________________________________\nvoid REveDataItemList::SetFillImpliedSelectedDelegate (FillImpliedSelectedFunc_t handler_func)\n{\n fHandlerFillImplied = handler_func;\n}\n\n\/\/______________________________________________________________________________\nvoid REveDataItemList::DummyItemsChange(REveDataItemList*, const std::vector<int>&)\n{\n if (gDebug) {\n printf(\"REveDataItemList::DummyItemsCahngeDelegate not implemented\\n\");\n }\n}\n\n\n\/\/______________________________________________________________________________\nvoid REveDataItemList::DummyFillImpliedSelected(REveDataItemList*, REveElement::Set_t&)\n{\n if (gDebug) {\n printf(\"REveDataItemList::DummyFillImpliedSelectedDelegate not implemented\\n\");\n }\n}\n\n\/\/==============================================================================\n\/\/ REveDataCollection\n\/\/==============================================================================\n\nREveDataCollection::REveDataCollection(const std::string& n, const std::string& t) :\n REveElement(n, t)\n{\n std::string lname = n + \"Items\";\n fItemList = new REveDataItemList(lname.c_str());\n AddElement(fItemList);\n\n SetupDefaultColorAndTransparency(fgDefaultColor, true, true);\n}\n\nvoid REveDataCollection::AddItem(void *data_ptr, const std::string& \/*n*\/, const std::string& \/*t*\/)\n{\n auto el = new REveDataItem(data_ptr, GetMainColor());\n fItemList->fItems.emplace_back(el);\n}\n\n\/\/------------------------------------------------------------------------------\n\nvoid REveDataCollection::SetFilterExpr(const char* filter)\n{\n static const REveException eh(\"REveDataCollection::SetFilterExpr \");\n\n if (!fItemClass)\n throw eh + \"item class has to be set before the filter expression.\";\n\n if (filter) {\n \/\/ printf(\"filter '%s'\\n\", filter);\n int ibeg = 0, iend = strlen(filter);\n while (ibeg < iend && isspace(filter[ibeg])) ++ibeg;\n while (iend > ibeg && isspace(filter[iend-1])) --iend;\n \/\/ printf(\"cleaned up beg=%d end=%d len =%d\\n\", ibeg, iend, (int)strlen(filter));\n fFilterExpr = TString(filter + ibeg, iend - ibeg);\n } else {\n fFilterExpr = \"\";\n }\n\n if (fFilterExpr.Length())\n {\n std::stringstream s;\n s << \"*((std::function<bool(\" << fItemClass->GetName() << \"*)>*)\" << std::hex << std::showbase\n << (size_t)&fFilterFoo << \") = [](\" << fItemClass->GetName() << \"* p){\" << fItemClass->GetName()\n << \" &i=*p; return (\" << fFilterExpr.Data() << \"); };\";\n\n \/\/ printf(\"%s\\n\", s.Data());\n try {\n gROOT->ProcessLine(s.str().c_str());\n \/\/ AMT I don't know why ApplyFilter call is separated\n ApplyFilter();\n }\n catch (const std::exception &exc)\n {\n R__LOG_ERROR(REveLog()) << \"EveDataCollection::SetFilterExpr\" << exc.what();\n }\n }\n else \n {\n \/\/ Remove filter\n fFilterFoo = nullptr;\n Ids_t ids;\n int idx = 0;\n for (auto &ii : fItemList->fItems) {\n if (ii->GetFiltered()) {\n ii->SetFiltered(false);\n ids.push_back(idx);\n }\n idx++;\n }\n\n StampObjProps();\n fItemList->StampObjProps();\n fItemList->fHandlerItemsChange(fItemList, ids);\n }\n}\n\nvoid REveDataCollection::ApplyFilter()\n{\n if (!fFilterFoo)\n return;\n \n Ids_t ids;\n int idx = 0;\n for (auto &ii : fItemList->fItems)\n {\n bool res = fFilterFoo(ii->GetDataPtr());\n\n \/\/ printf(\"Item:%s -- filter result = %d\\n\", ii.fItemPtr->GetElementName(), res);\n\n ii->SetFiltered( ! res );\n\n ids.push_back(idx++);\n }\n StampObjProps();\n fItemList->StampObjProps();\n fItemList->fHandlerItemsChange( fItemList , ids);\n}\n\n\/\/______________________________________________________________________________\n\nvoid REveDataCollection::StreamPublicMethods(nlohmann::json &j) const\n{\n struct PubMethods\n {\n void FillJSON(TClass* c, nlohmann::json & arr)\n {\n TString ctor = c->GetName(), dtor = \"~\";\n {\n int i = ctor.Last(':');\n if (i != kNPOS)\n {\n ctor.Replace(0, i + 1, \"\");\n }\n dtor += ctor;\n }\n\n TMethod *meth;\n TIter next(c->GetListOfMethods());\n while ((meth = (TMethod*) next()))\n {\n \/\/ Filter out ctor, dtor, some ROOT stuff.\n {\n TString m(meth->GetName());\n if (m == ctor || m == dtor ||\n m == \"Class\" || m == \"Class_Name\" || m == \"Class_Version\" || m == \"Dictionary\" || m == \"IsA\" ||\n m == \"DeclFileName\" || m == \"ImplFileName\" || m == \"DeclFileLine\" || m == \"ImplFileLine\" ||\n m == \"Streamer\" || m == \"StreamerNVirtual\" || m == \"ShowMembers\" ||\n m == \"CheckTObjectHashConsistency\")\n {\n continue;\n }\n }\n\n TString ms;\n TMethodArg *ma;\n TIter next_ma(meth->GetListOfMethodArgs());\n while ((ma = (TMethodArg*) next_ma()))\n {\n if ( ! ms.IsNull()) ms += \", \";\n\n ms += ma->GetTypeName();\n ms += \" \";\n ms += ma->GetName();\n }\n std::string entry(TString::Format(\"i.%s(%s)\",meth->GetName(),ms.Data()).Data());\n nlohmann::json jm ;\n jm[\"f\"] = entry;\n jm[\"r\"] = meth->GetReturnTypeName();\n jm[\"c\"] = c->GetName();\n arr.push_back(jm);\n }\n {\n TBaseClass *base;\n TIter blnext(c->GetListOfBases());\n while ((base = (TBaseClass*) blnext()))\n {\n FillJSON(base->GetClassPointer(), arr);\n }\n }\n }\n };\n j[\"fPublicFunctions\"] = nlohmann::json::array();\n PubMethods pm;\n pm.FillJSON(fItemClass, j[\"fPublicFunctions\"]);\n}\n\n\/\/______________________________________________________________________________\n\nvoid REveDataCollection::SetMainColor(Color_t newv)\n{\n int idx = 0;\n Ids_t ids;\n for (auto & chld : fItemList->fItems)\n {\n chld->SetMainColor(newv);\n ids.push_back(idx);\n idx++;\n }\n\n REveElement::SetMainColor(newv);\n for (auto & chld : fItemList->fItems)\n {\n chld->SetMainColor(newv);\n }\n fItemList->StampObjProps();\n fItemList->SetMainColor(newv);\n fItemList->fHandlerItemsChange( fItemList , ids);\n}\n\n\/\/______________________________________________________________________________\n\nBool_t REveDataCollection::SetRnrState(Bool_t iRnrSelf)\n{\n Bool_t ret = REveElement::SetRnrState(iRnrSelf);\n Ids_t ids;\n for (int i = 0; i < GetNItems(); ++i ) {\n ids.push_back(i);\n fItemList->fItems[i]->SetRnrSelf(fRnrSelf);\n }\n\n fItemList->StampObjProps();\n fItemList->fHandlerItemsChange( fItemList , ids);\n\n return ret;\n}\n\n\n\/\/______________________________________________________________________________\n\nInt_t REveDataCollection::WriteCoreJson(nlohmann::json &j, Int_t rnr_offset)\n{\n Int_t ret = REveElement::WriteCoreJson(j, rnr_offset);\n j[\"fFilterExpr\"] = fFilterExpr.Data();\n return ret;\n}\n\n<|endoftext|>"} {"text":"<commit_before>\/* OpenSceneGraph example, osgtext.\n*\n* Permission is hereby granted, free of charge, to any person obtaining a copy\n* of this software and associated documentation files (the \"Software\"), to deal\n* in the Software without restriction, including without limitation the rights\n* to use, copy, modify, merge, publish, distribute, sublicense, and\/or sell\n* copies of the Software, and to permit persons to whom the Software is\n* furnished to do so, subject to the following conditions:\n*\n* THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\n* IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\n* FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE\n* AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\n* LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,\n* OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN\n* THE SOFTWARE.\n*\/\n\n#include <osg\/ArgumentParser>\n#include <osg\/Material>\n#include <osg\/PositionAttitudeTransform>\n#include <osg\/io_utils>\n\n#include <osgDB\/ReadFile>\n#include <osgDB\/WriteFile>\n#include <osgGA\/StateSetManipulator>\n#include <osgViewer\/Viewer>\n#include <osgViewer\/ViewerEventHandlers>\n\n#include <osgText\/Text3D>\n\n#include \"TextNode.h\"\n\nclass Text3DAttributeHandler : public osgGA::GUIEventHandler\n{\npublic:\n Text3DAttributeHandler(osgText::Text3D* aText3D)\n : m_Text3D(aText3D)\n {\n }\n\n ~Text3DAttributeHandler()\n {\n }\n\n virtual bool handle(const osgGA::GUIEventAdapter& ea, osgGA::GUIActionAdapter&)\n {\n if (ea.getEventType() == osgGA::GUIEventAdapter::KEYUP)\n {\n if (ea.getKey() == osgGA::GUIEventAdapter::KEY_Up)\n {\n m_Text3D->setCharacterSize(m_Text3D->getCharacterHeight() + 0.1); \/\/ failed\n OSG_NOTICE<<\"m_Text3D->getCharacterHeight()=\"<<m_Text3D->getCharacterHeight()<<std::endl;\n }\n else if (ea.getKey() == osgGA::GUIEventAdapter::KEY_Down)\n {\n m_Text3D->setCharacterDepth(m_Text3D->getCharacterDepth() + 0.1); \/\/ ok\n OSG_NOTICE<<\"m_Text3D->getCharacterDepth()=\"<<m_Text3D->getCharacterDepth()<<std::endl;\n }\n else if (ea.getKey() == osgGA::GUIEventAdapter::KEY_Left)\n {\n m_Text3D->setText(\"setText\\nworks!\", osgText::String::ENCODING_UTF8); \/\/ ok\n OSG_NOTICE<<\"m_Text3D->getText()=\"<<m_Text3D->getText().size()<<std::endl;\n }\n else if (ea.getKey() == osgGA::GUIEventAdapter::KEY_Right)\n {\n m_Text3D->setLineSpacing(m_Text3D->getLineSpacing() + 0.1);\n OSG_NOTICE<<\"m_Text3D->getLineSpacing()=\"<<m_Text3D->getLineSpacing()<<std::endl;\n }\n }\n\n return false;\n }\n\nprivate:\n osgText::Text3D* m_Text3D;\n};\n\n\nint main(int argc, char** argv)\n{\n osg::ArgumentParser arguments(&argc, argv);\n\n osgViewer::Viewer viewer(arguments);\n\n std::string fontFile(\"arial.ttf\");\n while(arguments.read(\"-f\",fontFile)) {}\n\n osg::ref_ptr<osgText::Font> font = osgText::readRefFontFile(fontFile);\n if (!font) return 1;\n OSG_NOTICE<<\"Read font \"<<fontFile<<\" font=\"<<font.get()<<std::endl;\n\n std::string word(\"This is a new test.\");\n while (arguments.read(\"-w\",word)) {}\n\n osg::ref_ptr<osgText::Style> style = new osgText::Style;\n\n float thickness = 0.1f;\n while(arguments.read(\"--thickness\",thickness)) {}\n style->setThicknessRatio(thickness);\n\n \/\/ set up any bevel if required\n float r;\n osg::ref_ptr<osgText::Bevel> bevel;\n while(arguments.read(\"--rounded\",r)) { bevel = new osgText::Bevel; bevel->roundedBevel2(r); }\n while(arguments.read(\"--rounded\")) { bevel = new osgText::Bevel; bevel->roundedBevel2(0.25); }\n while(arguments.read(\"--flat\",r)) { bevel = new osgText::Bevel; bevel->flatBevel(r); }\n while(arguments.read(\"--flat\")) { bevel = new osgText::Bevel; bevel->flatBevel(0.25); }\n while(arguments.read(\"--bevel-thickness\",r)) { if (bevel.valid()) bevel->setBevelThickness(r); }\n\n\n if (bevel.valid())\n {\n while(arguments.read(\"--smooth-concave-Junctions\") || arguments.read(\"--scj\"))\n {\n bevel->setSmoothConcaveJunctions(true);\n }\n }\n\n\n style->setBevel(bevel.get());\n\n \/\/ set up outline.\n while(arguments.read(\"--outline\",r)) { style->setOutlineRatio(r); }\n\n\n viewer.addEventHandler( new osgGA::StateSetManipulator(viewer.getCamera()->getOrCreateStateSet()) );\n viewer.addEventHandler(new osgViewer::StatsHandler);\n\n#if 1\n osg::ref_ptr<osg::Group> group = new osg::Group;\n\n float characterSize = 1.0f;\n while(arguments.read(\"--size\",characterSize)) {}\n\n if (arguments.read(\"--2d\"))\n {\n osgText::Text* text2D = new osgText::Text;\n text2D->setFont(font.get());\n text2D->setCharacterSize(characterSize);\n text2D->setFontResolution(256,256);\n text2D->setDrawMode(osgText::Text::TEXT | osgText::Text::BOUNDINGBOX);\n text2D->setAxisAlignment(osgText::Text::XZ_PLANE);\n text2D->setText(word);\n osg::Geode* geode = new osg::Geode;\n geode->addDrawable(text2D);\n group->addChild(geode);\n }\n\n if (arguments.read(\"--TextNode\"))\n {\n \/\/ experimental text node\n osgText::TextNode* text = new osgText::TextNode;\n text->setFont(font.get());\n text->setStyle(style.get());\n text->setTextTechnique(new osgText::TextTechnique);\n text->setText(word);\n text->update();\n\n group->addChild(text);\n }\n else if (!arguments.read(\"--no-3d\"))\n {\n osgText::Text3D* text3D = new osgText::Text3D;\n\n \/\/ Does not help\n text3D->setDataVariance(osg::Object::DYNAMIC);\n\n text3D->setFont(font.get());\n text3D->setStyle(style.get());\n text3D->setCharacterSize(characterSize);\n text3D->setDrawMode(osgText::Text3D::TEXT | osgText::Text3D::BOUNDINGBOX);\n text3D->setAxisAlignment(osgText::Text3D::XZ_PLANE);\n text3D->setText(word);\n\n osg::Geode* geode = new osg::Geode;\n geode->addDrawable(text3D);\n group->addChild(geode);\n\n osg::Vec4 color(1.0f, 1.0f, 1.0f, 1.0f);\n while(arguments.read(\"--color\",color.r(),color.g(),color.b(),color.a()))\n {\n OSG_NOTICE<<\"--color \"<<color<<std::endl;\n text3D->setColor(color);\n }\n\n std::string imageFilename;\n while(arguments.read(\"--image\",imageFilename))\n {\n OSG_NOTICE<<\"--image \"<<imageFilename<<std::endl;\n osg::ref_ptr<osg::Image> image = osgDB::readRefImageFile(imageFilename);\n if (image.valid())\n {\n OSG_NOTICE<<\" loaded image \"<<imageFilename<<std::endl;\n osg::StateSet* stateset = text3D->getOrCreateStateSet();\n stateset->setTextureAttributeAndModes(0, new osg::Texture2D(image), osg::StateAttribute::ON);\n }\n }\n\n while(arguments.read(\"--wall-color\",color.r(),color.g(),color.b(),color.a()))\n {\n osg::StateSet* stateset = text3D->getOrCreateWallStateSet();\n osg::Material* material = new osg::Material;\n material->setDiffuse(osg::Material::FRONT_AND_BACK, color);\n stateset->setAttribute(material);\n }\n\n while(arguments.read(\"--wall-image\",imageFilename))\n {\n osg::ref_ptr<osg::Image> image = osgDB::readRefImageFile(imageFilename);\n if (image.valid())\n {\n osg::StateSet* stateset = text3D->getOrCreateWallStateSet();\n stateset->setTextureAttributeAndModes(0, new osg::Texture2D(image), osg::StateAttribute::ON);\n }\n }\n\n while(arguments.read(\"--back-color\",color.r(),color.g(),color.b(),color.a()))\n {\n osg::StateSet* stateset = text3D->getOrCreateBackStateSet();\n osg::Material* material = new osg::Material;\n material->setDiffuse(osg::Material::FRONT_AND_BACK, color);\n stateset->setAttribute(material);\n }\n\n while(arguments.read(\"--back-image\",imageFilename))\n {\n osg::ref_ptr<osg::Image> image = osgDB::readRefImageFile(imageFilename);\n if (image)\n {\n osg::StateSet* stateset = text3D->getOrCreateBackStateSet();\n stateset->setTextureAttributeAndModes(0, new osg::Texture2D(image), osg::StateAttribute::ON);\n }\n }\n\n if (arguments.read(\"--size-quad\"))\n {\n geode->addDrawable( osg::createTexturedQuadGeometry(osg::Vec3(0.0f,characterSize*thickness,0.0f),osg::Vec3(characterSize,0.0,0.0),osg::Vec3(0.0f,0.0,characterSize), 0.0, 0.0, 1.0, 1.0) );\n }\n\n\t\tif (arguments.read(\"--add-axes\"))\n\t\t\tgroup->addChild(osgDB::readNodeFile(\"axes.osgt\"));\n\n\t\tstd::string mode;\n\t\tif (arguments.read(\"--character-size-mode\", mode))\n\t\t{\n\t\t\tif (mode == \"screen_coords\")\n\t\t\t{\n\t\t\t\ttext3D->setCharacterSizeMode(osgText::TextBase::SCREEN_COORDS);\n\t\t\t\ttext3D->setCharacterSize(1080\/4);\n\t\t\t}\n\t\t}\n\n viewer.addEventHandler(new Text3DAttributeHandler(text3D));\n }\n\n viewer.setSceneData(group);\n\n#endif\n\n return viewer.run();\n}\n<commit_msg>example_osgtext3d: more options for testing<commit_after>\/* OpenSceneGraph example, osgtext.\n*\n* Permission is hereby granted, free of charge, to any person obtaining a copy\n* of this software and associated documentation files (the \"Software\"), to deal\n* in the Software without restriction, including without limitation the rights\n* to use, copy, modify, merge, publish, distribute, sublicense, and\/or sell\n* copies of the Software, and to permit persons to whom the Software is\n* furnished to do so, subject to the following conditions:\n*\n* THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\n* IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\n* FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE\n* AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\n* LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,\n* OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN\n* THE SOFTWARE.\n*\/\n\n#include <osg\/ArgumentParser>\n#include <osg\/Material>\n#include <osg\/PositionAttitudeTransform>\n#include <osg\/io_utils>\n\n#include <osgDB\/ReadFile>\n#include <osgDB\/WriteFile>\n#include <osgGA\/StateSetManipulator>\n#include <osgViewer\/Viewer>\n#include <osgViewer\/ViewerEventHandlers>\n\n#include <osgText\/Text3D>\n\n#include \"TextNode.h\"\n\nclass Text3DAttributeHandler : public osgGA::GUIEventHandler\n{\npublic:\n Text3DAttributeHandler(osgText::Text3D* aText3D)\n : m_Text3D(aText3D)\n {\n }\n\n ~Text3DAttributeHandler()\n {\n }\n\n virtual bool handle(const osgGA::GUIEventAdapter& ea, osgGA::GUIActionAdapter&)\n {\n if (ea.getEventType() == osgGA::GUIEventAdapter::KEYUP)\n {\n if (ea.getKey() == osgGA::GUIEventAdapter::KEY_Up)\n {\n m_Text3D->setCharacterSize(m_Text3D->getCharacterHeight() + 0.1);\n OSG_NOTICE<<\"m_Text3D->getCharacterHeight() = \" << m_Text3D->getCharacterHeight() << std::endl;\n }\n else if (ea.getKey() == osgGA::GUIEventAdapter::KEY_Down)\n {\n m_Text3D->setCharacterDepth(m_Text3D->getCharacterDepth() + 0.1);\n OSG_NOTICE<<\"m_Text3D->getCharacterDepth() = \" << m_Text3D->getCharacterDepth() << std::endl;\n }\n else if (ea.getKey() == osgGA::GUIEventAdapter::KEY_Left)\n {\n static int counter = 1;\n if (counter%3 == 0)\n m_Text3D->setText(\"Press arrow keys.\", osgText::String::ENCODING_UTF8);\n else if (counter%3 == 1)\n m_Text3D->setText(\"setText\\nworks!\", osgText::String::ENCODING_UTF8);\n else if (counter%3 == 2)\n m_Text3D->setText(\"setText really works?\", osgText::String::ENCODING_UTF8);\n else if (counter%3 == 3)\n m_Text3D->setText(\"setText works, really!\", osgText::String::ENCODING_UTF8);\n\n ++counter;\n\n OSG_NOTICE<<\"m_Text3D->getText().size() = \" << m_Text3D->getText().size() << std::endl;\n }\n else if (ea.getKey() == osgGA::GUIEventAdapter::KEY_Right)\n {\n m_Text3D->setLineSpacing(m_Text3D->getLineSpacing() + 0.1);\n OSG_NOTICE<<\"m_Text3D->getLineSpacing() = \" << m_Text3D->getLineSpacing() << std::endl;\n }\n }\n\n return false;\n }\n\nprivate:\n osgText::Text3D* m_Text3D;\n};\n\n\nint main(int argc, char** argv)\n{\n osg::ArgumentParser arguments(&argc, argv);\n\n osgViewer::Viewer viewer(arguments);\n\n std::string fontFile(\"arial.ttf\");\n while(arguments.read(\"-f\",fontFile)) {}\n\n osg::ref_ptr<osgText::Font> font = osgText::readRefFontFile(fontFile);\n if (!font) return 1;\n OSG_NOTICE<<\"Read font \"<<fontFile<<\" font=\"<<font.get()<<std::endl;\n\n std::string word(\"Press arrow keys.\");\n while (arguments.read(\"-w\",word)) {}\n\n osg::ref_ptr<osgText::Style> style = new osgText::Style;\n\n float thickness = 0.1f;\n while(arguments.read(\"--thickness\",thickness)) {}\n style->setThicknessRatio(thickness);\n\n \/\/ set up any bevel if required\n float r;\n osg::ref_ptr<osgText::Bevel> bevel;\n while(arguments.read(\"--rounded\",r)) { bevel = new osgText::Bevel; bevel->roundedBevel2(r); }\n while(arguments.read(\"--rounded\")) { bevel = new osgText::Bevel; bevel->roundedBevel2(0.25); }\n while(arguments.read(\"--flat\",r)) { bevel = new osgText::Bevel; bevel->flatBevel(r); }\n while(arguments.read(\"--flat\")) { bevel = new osgText::Bevel; bevel->flatBevel(0.25); }\n while(arguments.read(\"--bevel-thickness\",r)) { if (bevel.valid()) bevel->setBevelThickness(r); }\n\n\n if (bevel.valid())\n {\n while(arguments.read(\"--smooth-concave-Junctions\") || arguments.read(\"--scj\"))\n {\n bevel->setSmoothConcaveJunctions(true);\n }\n }\n\n\n style->setBevel(bevel.get());\n\n \/\/ set up outline.\n while(arguments.read(\"--outline\",r)) { style->setOutlineRatio(r); }\n\n\n viewer.addEventHandler( new osgGA::StateSetManipulator(viewer.getCamera()->getOrCreateStateSet()) );\n viewer.addEventHandler(new osgViewer::StatsHandler);\n\n#if 1\n osg::ref_ptr<osg::Group> group = new osg::Group;\n\n float characterSize = 1.0f;\n while(arguments.read(\"--size\",characterSize)) {}\n\n if (arguments.read(\"--2d\"))\n {\n osgText::Text* text2D = new osgText::Text;\n text2D->setFont(font.get());\n text2D->setCharacterSize(characterSize);\n text2D->setFontResolution(256,256);\n text2D->setDrawMode(osgText::Text::TEXT | osgText::Text::BOUNDINGBOX);\n text2D->setAxisAlignment(osgText::Text::XZ_PLANE);\n text2D->setText(word);\n osg::Geode* geode = new osg::Geode;\n geode->addDrawable(text2D);\n group->addChild(geode);\n }\n\n if (arguments.read(\"--TextNode\"))\n {\n \/\/ experimental text node\n osgText::TextNode* text = new osgText::TextNode;\n text->setFont(font.get());\n text->setStyle(style.get());\n text->setTextTechnique(new osgText::TextTechnique);\n text->setText(word);\n text->update();\n\n group->addChild(text);\n }\n else if (!arguments.read(\"--no-3d\"))\n {\n osgText::Text3D* text3D = new osgText::Text3D;\n\n \/\/ Does not help\n text3D->setDataVariance(osg::Object::DYNAMIC);\n\n text3D->setFont(font.get());\n text3D->setStyle(style.get());\n text3D->setCharacterSize(characterSize);\n text3D->setDrawMode(osgText::Text3D::TEXT | osgText::Text3D::BOUNDINGBOX);\n text3D->setAxisAlignment(osgText::Text3D::XZ_PLANE);\n text3D->setText(word);\n\n osg::Geode* geode = new osg::Geode;\n geode->addDrawable(text3D);\n group->addChild(geode);\n\n osg::Vec4 color(1.0f, 1.0f, 1.0f, 1.0f);\n while(arguments.read(\"--color\",color.r(),color.g(),color.b(),color.a()))\n {\n OSG_NOTICE<<\"--color \"<<color<<std::endl;\n text3D->setColor(color);\n }\n\n std::string imageFilename;\n while(arguments.read(\"--image\",imageFilename))\n {\n OSG_NOTICE<<\"--image \"<<imageFilename<<std::endl;\n osg::ref_ptr<osg::Image> image = osgDB::readRefImageFile(imageFilename);\n if (image.valid())\n {\n OSG_NOTICE<<\" loaded image \"<<imageFilename<<std::endl;\n osg::StateSet* stateset = text3D->getOrCreateStateSet();\n stateset->setTextureAttributeAndModes(0, new osg::Texture2D(image), osg::StateAttribute::ON);\n }\n }\n\n while(arguments.read(\"--wall-color\",color.r(),color.g(),color.b(),color.a()))\n {\n osg::StateSet* stateset = text3D->getOrCreateWallStateSet();\n osg::Material* material = new osg::Material;\n material->setDiffuse(osg::Material::FRONT_AND_BACK, color);\n stateset->setAttribute(material);\n }\n\n while(arguments.read(\"--wall-image\",imageFilename))\n {\n osg::ref_ptr<osg::Image> image = osgDB::readRefImageFile(imageFilename);\n if (image.valid())\n {\n osg::StateSet* stateset = text3D->getOrCreateWallStateSet();\n stateset->setTextureAttributeAndModes(0, new osg::Texture2D(image), osg::StateAttribute::ON);\n }\n }\n\n while(arguments.read(\"--back-color\",color.r(),color.g(),color.b(),color.a()))\n {\n osg::StateSet* stateset = text3D->getOrCreateBackStateSet();\n osg::Material* material = new osg::Material;\n material->setDiffuse(osg::Material::FRONT_AND_BACK, color);\n stateset->setAttribute(material);\n }\n\n while(arguments.read(\"--back-image\",imageFilename))\n {\n osg::ref_ptr<osg::Image> image = osgDB::readRefImageFile(imageFilename);\n if (image)\n {\n osg::StateSet* stateset = text3D->getOrCreateBackStateSet();\n stateset->setTextureAttributeAndModes(0, new osg::Texture2D(image), osg::StateAttribute::ON);\n }\n }\n\n if (arguments.read(\"--size-quad\"))\n {\n geode->addDrawable( osg::createTexturedQuadGeometry(osg::Vec3(0.0f,characterSize*thickness,0.0f),osg::Vec3(characterSize,0.0,0.0),osg::Vec3(0.0f,0.0,characterSize), 0.0, 0.0, 1.0, 1.0) );\n }\n\n if (arguments.read(\"--add-axes\"))\n group->addChild(osgDB::readNodeFile(\"axes.osgt\"));\n\n std::string mode;\n if (arguments.read(\"--character-size-mode\", mode))\n {\n if (mode == \"screen_coords\")\n {\n text3D->setCharacterSizeMode(osgText::TextBase::SCREEN_COORDS);\n text3D->setCharacterSize(1080\/4);\n }\n }\n\n viewer.addEventHandler(new Text3DAttributeHandler(text3D));\n }\n\n viewer.setSceneData(group);\n\n#endif\n\n return viewer.run();\n}\n<|endoftext|>"} {"text":"<commit_before>#include \"mirants\/core\/tcp_client.h\"\n#include \"mirants\/core\/eventloop.h\"\n#include \"mirants\/core\/sockaddr.h\"\n#include \"mirants\/core\/tcp_connection.h\"\n#include \"mirants\/core\/callback.h\"\n#include \"mirants\/core\/buffer.h\"\n#include \"mirants\/util\/logging.h\"\n#include \"mirants\/port\/atomic_sequence_num.h\"\n#include <vector>\n\nusing namespace std::placeholders;\n\nnamespace sudoku {\n\nclass SudokuClient {\n public:\n SudokuClient(const std::string& name, \n mirants::EventLoop* ev, \n const mirants::SockAddr& addr, \n const std::vector<std::string>& vec)\n : num_(0),\n client_(name, ev, addr),\n vec_(vec) {\n client_.SetConnectionCallback(\n std::bind(&SudokuClient::ConnectCallback,this, _1));\n client_.SetMessageCallback(\n std::bind(&SudokuClient::MessageCallback, this, _1, _2));\n }\n\n SudokuClient(const std::string& name, \n mirants::EventLoop* ev, \n const mirants::SockAddr& addr, \n std::vector<std::string>&& vec)\n : num_(0),\n client_(name, ev, addr),\n vec_(std::move(vec)) {\n client_.SetConnectionCallback(\n std::bind(&SudokuClient::ConnectCallback, this, _1));\n client_.SetMessageCallback(\n std::bind(&SudokuClient::MessageCallback, this, _1, _2));\n }\n\n void Connect() {\n client_.Connect();\n }\n\n private:\n void ConnectCallback(const mirants::TcpConnectionPtr& ptr) {\n MIRANTS_LOG(INFO) << \"Start solve sudoku...\";\n start_ = mirants::Timestamp::Now();\n for (size_t i = 0; i < vec_.size(); ++i) {\n ptr->SendMessage(vec_.at(i));\n }\n }\n\n void MessageCallback(const mirants::TcpConnectionPtr& ptr, mirants::Buffer* buf) {\n size_t size = buf->ReadableSize();\n while (size >= kCells + 2) {\n const char* crlf = buf->FindCRLF();\n if (crlf) {\n std::string res(buf->Peek(), crlf);\n buf->RetrieveUntil(crlf + 2);\n size = buf->ReadableSize();\n MIRANTS_LOG(INFO) << \"The result is: \" << res;\n ++num_;\n if (++num_ == static_cast<int64_t>(vec_.size())) {\n stop_ = mirants::Timestamp::Now();\n MIRANTS_LOG(INFO) << \"\\nStart time is: \" << start_.FormatTimestamp()\n << \"\\nFinish time is: \" << stop_.FormatTimestamp()\n << \"\\nTake MicroSeconds: \" \n << stop_.MicroSecondsSinceEpoch() - start_.MicroSecondsSinceEpoch();\n }\n } else {\n break;\n }\n }\n }\n\n static const int kCells = 81;\n int64_t num_;\n mirants::TcpClient client_;\n std::vector<std::string> vec_;\n mirants::Timestamp start_;\n mirants::Timestamp stop_;\n};\n\n} \/\/ namespace sudoku\n\nint main(int argc, char** argv) {\n if (argc != 3) {\n printf(\"Usage: %s server_ip dotimes\\n\", argv[0]);\n return 0;\n }\n int dotimes = atoi(argv[2]);\n if (dotimes <= 0) {\n return 0;\n }\n \n std::string message = \"53 7 6 195 98 6 8 6 34 8 3 17 2 6 6 28 419 5 8 79\\r\\n\";\n std::vector<std::string> vec(dotimes);\n for (int i = 0; i < dotimes; ++i) {\n vec.push_back(message);\n }\n mirants::EventLoop ev;\n mirants::SockAddr servaddr(argv[1], 5666);\n sudoku::SudokuClient client(\"SudokuClinet\", &ev, servaddr, std::move(vec));\n client.Connect();\n ev.Loop();\n}\n<commit_msg>Update sudoku_client.cc<commit_after>#include \"mirants\/core\/tcp_client.h\"\n#include \"mirants\/core\/eventloop.h\"\n#include \"mirants\/core\/sockaddr.h\"\n#include \"mirants\/core\/tcp_connection.h\"\n#include \"mirants\/core\/callback.h\"\n#include \"mirants\/core\/buffer.h\"\n#include \"mirants\/util\/logging.h\"\n#include <vector>\n\nusing namespace std::placeholders;\n\nnamespace sudoku {\n\nclass SudokuClient {\n public:\n SudokuClient(const std::string& name, \n mirants::EventLoop* ev, \n const mirants::SockAddr& addr, \n const std::vector<std::string>& vec)\n : num_(0),\n client_(name, ev, addr),\n vec_(vec) {\n client_.SetConnectionCallback(\n std::bind(&SudokuClient::ConnectCallback,this, _1));\n client_.SetMessageCallback(\n std::bind(&SudokuClient::MessageCallback, this, _1, _2));\n }\n\n SudokuClient(const std::string& name, \n mirants::EventLoop* ev, \n const mirants::SockAddr& addr, \n std::vector<std::string>&& vec)\n : num_(0),\n client_(name, ev, addr),\n vec_(std::move(vec)) {\n client_.SetConnectionCallback(\n std::bind(&SudokuClient::ConnectCallback, this, _1));\n client_.SetMessageCallback(\n std::bind(&SudokuClient::MessageCallback, this, _1, _2));\n }\n\n void Connect() {\n client_.Connect();\n }\n\n private:\n void ConnectCallback(const mirants::TcpConnectionPtr& ptr) {\n MIRANTS_LOG(INFO) << \"Start solve sudoku...\";\n start_ = mirants::Timestamp::Now();\n for (size_t i = 0; i < vec_.size(); ++i) {\n ptr->SendMessage(vec_.at(i));\n }\n }\n\n void MessageCallback(const mirants::TcpConnectionPtr& ptr, mirants::Buffer* buf) {\n size_t size = buf->ReadableSize();\n while (size >= kCells + 2) {\n const char* crlf = buf->FindCRLF();\n if (crlf) {\n std::string res(buf->Peek(), crlf);\n buf->RetrieveUntil(crlf + 2);\n size = buf->ReadableSize();\n MIRANTS_LOG(INFO) << \"The result is: \" << res;\n ++num_;\n if (++num_ == static_cast<int64_t>(vec_.size())) {\n stop_ = mirants::Timestamp::Now();\n MIRANTS_LOG(INFO) << \"\\nStart time is: \" << start_.FormatTimestamp()\n << \"\\nFinish time is: \" << stop_.FormatTimestamp()\n << \"\\nTake MicroSeconds: \" \n << stop_.MicroSecondsSinceEpoch() - start_.MicroSecondsSinceEpoch();\n }\n } else {\n break;\n }\n }\n }\n\n static const int kCells = 81;\n int64_t num_;\n mirants::TcpClient client_;\n std::vector<std::string> vec_;\n mirants::Timestamp start_;\n mirants::Timestamp stop_;\n};\n\n} \/\/ namespace sudoku\n\nint main(int argc, char** argv) {\n if (argc != 3) {\n printf(\"Usage: %s server_ip dotimes\\n\", argv[0]);\n return 0;\n }\n int dotimes = atoi(argv[2]);\n if (dotimes <= 0) {\n return 0;\n }\n \n std::string message = \"53 7 6 195 98 6 8 6 34 8 3 17 2 6 6 28 419 5 8 79\\r\\n\";\n std::vector<std::string> vec(dotimes);\n for (int i = 0; i < dotimes; ++i) {\n vec.push_back(message);\n }\n mirants::EventLoop ev;\n mirants::SockAddr servaddr(argv[1], 5666);\n sudoku::SudokuClient client(\"SudokuClinet\", &ev, servaddr, std::move(vec));\n client.Connect();\n ev.Loop();\n}\n<|endoftext|>"} {"text":"<commit_before>\/\/ Filename: INSProjectionBcCoef.C\n\/\/ Last modified: <09.Oct.2007 18:42:29 griffith@box221.cims.nyu.edu>\n\/\/ Created on 22 Feb 2007 by Boyce Griffith (boyce@trasnaform2.local)\n\n#include \"INSProjectionBcCoef.h\"\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/ INCLUDES \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n#ifndef included_IBAMR_config\n#include <IBAMR_config.h>\n#define included_IBAMR_config\n#endif\n\n#ifndef included_SAMRAI_config\n#include <SAMRAI_config.h>\n#define included_SAMRAI_config\n#endif\n\n\/\/ STOOLS INCLUDES\n#include <stools\/PhysicalBoundaryUtilities.h>\n\n\/\/ SAMRAI INCLUDES\n#include <CellData.h>\n#include <FaceData.h>\n#include <tbox\/Utilities.h>\n\n\/\/ C++ STDLIB INCLUDES\n#include <cassert>\n#include <limits>\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/ NAMESPACE \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nnamespace IBAMR\n{\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/ STATIC \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/ PUBLIC \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nINSProjectionBcCoef::INSProjectionBcCoef(\n const int P_idx,\n SAMRAI::solv::RobinBcCoefStrategy<NDIM>* const P_bc_coef,\n const std::string& projection_type,\n const int u_idx,\n const std::vector<SAMRAI::solv::RobinBcCoefStrategy<NDIM>*>& u_bc_coefs,\n const bool homogeneous_bc)\n : d_P_idx(-1),\n d_P_bc_coef(NULL),\n d_projection_type(),\n d_u_idx(-1),\n d_u_bc_coefs(NDIM,NULL),\n d_homo_patch_data_idxs(),\n d_inhomo_patch_data_idxs(),\n d_homogeneous_bc(false),\n d_rho(std::numeric_limits<double>::quiet_NaN()),\n d_dt(std::numeric_limits<double>::quiet_NaN())\n{\n setCurrentPressurePatchDataIndex(P_idx);\n setPressurePhysicalBcCoef(P_bc_coef);\n setProjectionType(projection_type);\n setIntermediateVelocityPatchDataIndex(u_idx);\n setVelocityPhysicalBcCoefs(u_bc_coefs);\n setHomogeneousBc(homogeneous_bc);\n return;\n}\/\/ INSProjectionBcCoef\n\nINSProjectionBcCoef::~INSProjectionBcCoef()\n{\n \/\/ intentionally blank\n return;\n}\/\/ ~INSProjectionBcCoef\n\nvoid\nINSProjectionBcCoef::setProblemCoefs(\n const double rho,\n const double dt)\n{\n d_rho = rho;\n d_dt = dt;\n return;\n}\/\/ setProblemCoefs\n\nvoid\nINSProjectionBcCoef::setCurrentPressurePatchDataIndex(\n const int P_idx)\n{\n d_P_idx = P_idx;\n d_inhomo_patch_data_idxs.clear();\n if (d_u_idx != -1) d_inhomo_patch_data_idxs.insert(d_u_idx);\n d_inhomo_patch_data_idxs.insert(d_P_idx);\n return;\n}\/\/ setCurrentPressurePatchDataIndex\n\nvoid\nINSProjectionBcCoef::setProjectionType(\n const std::string& projection_type)\n{\n if (projection_type != \"pressure_increment\" && projection_type != \"pressure_update\")\n {\n TBOX_ERROR(\"INSProjectionBcCoef::setProjectionType():\\n\"\n << \" invalid velocity projection type: \" << projection_type << \"\\n\"\n << \" valid choices are: ``pressure_increment'' or ``pressure_update''\" << endl);\n }\n d_projection_type = projection_type;\n return;\n}\/\/ setProjectionType\n\nvoid\nINSProjectionBcCoef::setPressurePhysicalBcCoef(\n SAMRAI::solv::RobinBcCoefStrategy<NDIM>* const P_bc_coef)\n{\n d_P_bc_coef = P_bc_coef;\n return;\n}\/\/ setPressurePhysicalBcCoef\n\nvoid\nINSProjectionBcCoef::setIntermediateVelocityPatchDataIndex(\n const int u_idx)\n{\n d_u_idx = u_idx;\n d_inhomo_patch_data_idxs.clear();\n d_inhomo_patch_data_idxs.insert(d_u_idx);\n if (d_P_idx != -1) d_inhomo_patch_data_idxs.insert(d_P_idx);\n return;\n}\/\/ setIntermediateVelocityPatchDataIndex\n\nvoid\nINSProjectionBcCoef::setVelocityPhysicalBcCoefs(\n const std::vector<SAMRAI::solv::RobinBcCoefStrategy<NDIM>*>& u_bc_coefs)\n{\n if (u_bc_coefs.size() != NDIM)\n {\n TBOX_ERROR(\"INSProjectionBcCoef::setVelocityPhysicalBcCoefs():\\n\"\n << \" precisely NDIM boundary condition objects must be provided.\" << endl);\n }\n d_u_bc_coefs = u_bc_coefs;\n return;\n}\/\/ setVelocityPhysicalBcCoefs\n\nvoid\nINSProjectionBcCoef::setTargetPatchDataIndex(\n const int target_idx)\n{\n \/\/ intentionally blank\n return;\n}\/\/ setTargetPatchDataIndex\n\nvoid\nINSProjectionBcCoef::setHomogeneousBc(\n const bool homogeneous_bc)\n{\n d_homogeneous_bc = homogeneous_bc;\n return;\n}\/\/ setHomogeneousBc\n\nconst std::set<int>&\nINSProjectionBcCoef::getHomogeneousBcFillDataIndices() const\n{\n return d_homo_patch_data_idxs;\n}\/\/ getHomogeneousBcFillDataIndices\n\nconst std::set<int>&\nINSProjectionBcCoef::getInhomogeneousBcFillDataIndices() const\n{\n return d_inhomo_patch_data_idxs;\n}\/\/ getInhomogeneousBcFillDataIndices\n\nvoid\nINSProjectionBcCoef::setBcCoefs(\n SAMRAI::tbox::Pointer<SAMRAI::pdat::ArrayData<NDIM,double> >& acoef_data,\n SAMRAI::tbox::Pointer<SAMRAI::pdat::ArrayData<NDIM,double> >& bcoef_data,\n SAMRAI::tbox::Pointer<SAMRAI::pdat::ArrayData<NDIM,double> >& gcoef_data,\n const SAMRAI::tbox::Pointer<SAMRAI::hier::Variable<NDIM> >& variable,\n const SAMRAI::hier::Patch<NDIM>& patch,\n const SAMRAI::hier::BoundaryBox<NDIM>& bdry_box,\n double fill_time) const\n{\n#if USING_OLD_ROBIN_BC_INTERFACE\n TBOX_ERROR(\"INSProjectionBcCoef::setBcCoefs():\\n\"\n << \" using incorrect SAMRAI::solv::RobinBcCoefStrategy interface.\" << endl);\n#else\n setBcCoefs_private(acoef_data, bcoef_data, gcoef_data, variable, patch, bdry_box, fill_time);\n#endif\n return;\n}\/\/ setBcCoefs\n\nvoid\nINSProjectionBcCoef::setBcCoefs(\n SAMRAI::tbox::Pointer<SAMRAI::pdat::ArrayData<NDIM,double> >& acoef_data,\n SAMRAI::tbox::Pointer<SAMRAI::pdat::ArrayData<NDIM,double> >& gcoef_data,\n const SAMRAI::tbox::Pointer<SAMRAI::hier::Variable<NDIM> >& variable,\n const SAMRAI::hier::Patch<NDIM>& patch,\n const SAMRAI::hier::BoundaryBox<NDIM>& bdry_box,\n double fill_time) const\n{\n#if USING_OLD_ROBIN_BC_INTERFACE\n SAMRAI::tbox::Pointer<SAMRAI::pdat::ArrayData<NDIM,double> > bcoef_data =\n (acoef_data.isNull()\n ? SAMRAI::tbox::Pointer<SAMRAI::pdat::ArrayData<NDIM,double> >(NULL)\n : new SAMRAI::pdat::ArrayData<NDIM,double>(acoef_data->getBox(), acoef_data->getDepth()));\n setBcCoefs_private(acoef_data, bcoef_data, gcoef_data, variable, patch, bdry_box, fill_time);\n#else\n TBOX_ERROR(\"INSProjectionBcCoef::setBcCoefs():\\n\"\n << \" using incorrect SAMRAI::solv::RobinBcCoefStrategy interface.\" << endl);\n#endif\n return;\n}\/\/ setBcCoefs\n\nSAMRAI::hier::IntVector<NDIM>\nINSProjectionBcCoef::numberOfExtensionsFillable() const\n{\n#ifdef DEBUG_CHECK_ASSERTIONS\n assert(d_u_bc_coefs.size() == NDIM);\n for (unsigned l = 0; l < d_u_bc_coefs.size(); ++l)\n {\n assert(d_u_bc_coefs[l] != NULL);\n }\n#endif\n SAMRAI::hier::IntVector<NDIM> ret_val(std::numeric_limits<int>::max());\n for (int d = 0; d < NDIM; ++d)\n {\n ret_val = SAMRAI::hier::IntVector<NDIM>::min(\n ret_val, d_u_bc_coefs[d]->numberOfExtensionsFillable());\n }\n return ret_val;\n}\/\/ numberOfExtensionsFillable\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/ PROTECTED \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/ PRIVATE \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nvoid\nINSProjectionBcCoef::setBcCoefs_private(\n SAMRAI::tbox::Pointer<SAMRAI::pdat::ArrayData<NDIM,double> >& acoef_data,\n SAMRAI::tbox::Pointer<SAMRAI::pdat::ArrayData<NDIM,double> >& bcoef_data,\n SAMRAI::tbox::Pointer<SAMRAI::pdat::ArrayData<NDIM,double> >& gcoef_data,\n const SAMRAI::tbox::Pointer<SAMRAI::hier::Variable<NDIM> >& variable,\n const SAMRAI::hier::Patch<NDIM>& patch,\n const SAMRAI::hier::BoundaryBox<NDIM>& bdry_box,\n double fill_time) const\n{\n#ifdef DEBUG_CHECK_ASSERTIONS\n assert(d_u_bc_coefs.size() == NDIM);\n for (unsigned l = 0; l < d_u_bc_coefs.size(); ++l)\n {\n assert(d_u_bc_coefs[l] != NULL);\n }\n#endif\n const int location_index = bdry_box.getLocationIndex();\n const int bdry_normal_axis = location_index\/2;\n const bool is_lower = location_index%2 == 0;\n\n const SAMRAI::hier::Box<NDIM> bc_coef_box =\n STOOLS::PhysicalBoundaryUtilities::makeSideBoundaryCodim1Box(bdry_box);\n\n const bool fill_acoef_data = !acoef_data.isNull();\n const bool fill_bcoef_data = !bcoef_data.isNull();\n const bool fill_gcoef_data = !gcoef_data.isNull();\n\n \/\/ Set the normal velocity bc coefs.\n#if USING_OLD_ROBIN_BC_INTERFACE\n d_u_bc_coefs[bdry_normal_axis]->setBcCoefs(\n acoef_data, gcoef_data, variable, patch, bdry_box, fill_time);\n#else\n d_u_bc_coefs[bdry_normal_axis]->setBcCoefs(\n acoef_data, bcoef_data, gcoef_data, variable, patch, bdry_box, fill_time);\n#endif\n\n \/\/ Loop over the boundary box and reset the homogeneous coefficients.\n for (SAMRAI::hier::Box<NDIM>::Iterator b(bc_coef_box); b; b++)\n {\n const SAMRAI::hier::Index<NDIM>& i = b();\n\n if (fill_acoef_data) (*acoef_data)(i,0) = 1.0-(*acoef_data)(i,0);\n if (fill_bcoef_data) (*bcoef_data)(i,0) = 1.0-(*bcoef_data)(i,0);\n if (fill_gcoef_data && d_homogeneous_bc) (*gcoef_data)(i,0) = 0.0;\n }\n\n \/\/ Loop over the boundary box and reset the inhomogeneous coefficients.\n if (!d_homogeneous_bc && fill_gcoef_data)\n {\n SAMRAI::tbox::Pointer<SAMRAI::pdat::FaceData<NDIM,double> > u_data = patch.getPatchData(d_u_idx);\n SAMRAI::tbox::Pointer<SAMRAI::pdat::CellData<NDIM,double> > P_data = patch.getPatchData(d_P_idx);\n#ifdef DEBUG_CHECK_ASSERTIONS\n assert(!u_data.isNull());\n assert(!P_data.isNull());\n assert(fill_acoef_data || fill_bcoef_data);\n#endif\n SAMRAI::tbox::Pointer<SAMRAI::pdat::ArrayData<NDIM,double> > pcoef_data =\n (acoef_data.isNull()\n ? new SAMRAI::pdat::ArrayData<NDIM,double>(bcoef_data->getBox(), bcoef_data->getDepth())\n : new SAMRAI::pdat::ArrayData<NDIM,double>(acoef_data->getBox(), acoef_data->getDepth()));\n\n if (d_P_bc_coef != NULL)\n {\n SAMRAI::tbox::Pointer<SAMRAI::pdat::ArrayData<NDIM,double> > null_data(NULL);\n#if USING_OLD_ROBIN_BC_INTERFACE\n d_P_bc_coef->setBcCoefs(\n null_data, pcoef_data, variable, patch, bdry_box, fill_time);\n#else\n d_P_bc_coef->setBcCoefs(\n null_data, null_data, pcoef_data, variable, patch, bdry_box, fill_time);\n#endif\n }\n else\n {\n pcoef_data->fillAll(0.0);\n }\n\n const bool using_pressure_increment = (d_projection_type == \"pressure_increment\");\n for (SAMRAI::hier::Box<NDIM>::Iterator b(bc_coef_box); b; b++)\n {\n const SAMRAI::hier::Index<NDIM>& i = b();\n const SAMRAI::pdat::FaceIndex<NDIM> i_f(\n i, bdry_normal_axis, SAMRAI::pdat::FaceIndex<NDIM>::Lower);\n\n if ((fill_acoef_data && SAMRAI::tbox::Utilities::deq((*acoef_data)(i,0),1.0)) ||\n (fill_bcoef_data && SAMRAI::tbox::Utilities::deq((*bcoef_data)(i,0),0.0)))\n {\n SAMRAI::hier::Index<NDIM> i_intr0(i), i_intr1(i);\n if (is_lower)\n {\n i_intr0(bdry_normal_axis) += 0;\n i_intr1(bdry_normal_axis) += 1;\n }\n else\n {\n i_intr0(bdry_normal_axis) -= 1;\n i_intr1(bdry_normal_axis) -= 2;\n }\n\n const double P_bdry =\n (using_pressure_increment\n ? 1.5*(*P_data)(i_intr0) - 0.5*(*P_data)(i_intr1)\n : 0.0);\n (*gcoef_data)(i,0) = (*pcoef_data)(i,0) - P_bdry;\n }\n else\n {\n (*gcoef_data)(i,0) = (is_lower ? -1.0 : +1.0)*(d_rho\/d_dt)*((*u_data)(i_f) - (*gcoef_data)(i,0));\n }\n }\n }\n return;\n}\/\/ setBcCoefs_private\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/ NAMESPACE \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n}\/\/ namespace IBAMR\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/ TEMPLATE INSTANTIATION \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n<commit_msg>interim commit.<commit_after>\/\/ Filename: INSProjectionBcCoef.C\n\/\/ Last modified: <09.Oct.2007 21:22:23 griffith@box221.cims.nyu.edu>\n\/\/ Created on 22 Feb 2007 by Boyce Griffith (boyce@trasnaform2.local)\n\n#include \"INSProjectionBcCoef.h\"\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/ INCLUDES \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n#ifndef included_IBAMR_config\n#include <IBAMR_config.h>\n#define included_IBAMR_config\n#endif\n\n#ifndef included_SAMRAI_config\n#include <SAMRAI_config.h>\n#define included_SAMRAI_config\n#endif\n\n\/\/ STOOLS INCLUDES\n#include <stools\/PhysicalBoundaryUtilities.h>\n\n\/\/ SAMRAI INCLUDES\n#include <CellData.h>\n#include <FaceData.h>\n#include <tbox\/Utilities.h>\n\n\/\/ C++ STDLIB INCLUDES\n#include <cassert>\n#include <limits>\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/ NAMESPACE \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nnamespace IBAMR\n{\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/ STATIC \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/ PUBLIC \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nINSProjectionBcCoef::INSProjectionBcCoef(\n const int P_idx,\n SAMRAI::solv::RobinBcCoefStrategy<NDIM>* const P_bc_coef,\n const std::string& projection_type,\n const int u_idx,\n const std::vector<SAMRAI::solv::RobinBcCoefStrategy<NDIM>*>& u_bc_coefs,\n const bool homogeneous_bc)\n : d_P_idx(-1),\n d_P_bc_coef(NULL),\n d_projection_type(),\n d_u_idx(-1),\n d_u_bc_coefs(NDIM,NULL),\n d_homo_patch_data_idxs(),\n d_inhomo_patch_data_idxs(),\n d_homogeneous_bc(false),\n d_rho(std::numeric_limits<double>::quiet_NaN()),\n d_dt(std::numeric_limits<double>::quiet_NaN())\n{\n setCurrentPressurePatchDataIndex(P_idx);\n setPressurePhysicalBcCoef(P_bc_coef);\n setProjectionType(projection_type);\n setIntermediateVelocityPatchDataIndex(u_idx);\n setVelocityPhysicalBcCoefs(u_bc_coefs);\n setHomogeneousBc(homogeneous_bc);\n return;\n}\/\/ INSProjectionBcCoef\n\nINSProjectionBcCoef::~INSProjectionBcCoef()\n{\n \/\/ intentionally blank\n return;\n}\/\/ ~INSProjectionBcCoef\n\nvoid\nINSProjectionBcCoef::setProblemCoefs(\n const double rho,\n const double dt)\n{\n d_rho = rho;\n d_dt = dt;\n return;\n}\/\/ setProblemCoefs\n\nvoid\nINSProjectionBcCoef::setCurrentPressurePatchDataIndex(\n const int P_idx)\n{\n d_P_idx = P_idx;\n d_inhomo_patch_data_idxs.clear();\n if (d_u_idx != -1) d_inhomo_patch_data_idxs.insert(d_u_idx);\n d_inhomo_patch_data_idxs.insert(d_P_idx);\n return;\n}\/\/ setCurrentPressurePatchDataIndex\n\nvoid\nINSProjectionBcCoef::setProjectionType(\n const std::string& projection_type)\n{\n if (projection_type != \"pressure_increment\" && projection_type != \"pressure_update\")\n {\n TBOX_ERROR(\"INSProjectionBcCoef::setProjectionType():\\n\"\n << \" invalid velocity projection type: \" << projection_type << \"\\n\"\n << \" valid choices are: ``pressure_increment'' or ``pressure_update''\" << endl);\n }\n d_projection_type = projection_type;\n return;\n}\/\/ setProjectionType\n\nvoid\nINSProjectionBcCoef::setPressurePhysicalBcCoef(\n SAMRAI::solv::RobinBcCoefStrategy<NDIM>* const P_bc_coef)\n{\n d_P_bc_coef = P_bc_coef;\n return;\n}\/\/ setPressurePhysicalBcCoef\n\nvoid\nINSProjectionBcCoef::setIntermediateVelocityPatchDataIndex(\n const int u_idx)\n{\n d_u_idx = u_idx;\n d_inhomo_patch_data_idxs.clear();\n d_inhomo_patch_data_idxs.insert(d_u_idx);\n if (d_P_idx != -1) d_inhomo_patch_data_idxs.insert(d_P_idx);\n return;\n}\/\/ setIntermediateVelocityPatchDataIndex\n\nvoid\nINSProjectionBcCoef::setVelocityPhysicalBcCoefs(\n const std::vector<SAMRAI::solv::RobinBcCoefStrategy<NDIM>*>& u_bc_coefs)\n{\n if (u_bc_coefs.size() != NDIM)\n {\n TBOX_ERROR(\"INSProjectionBcCoef::setVelocityPhysicalBcCoefs():\\n\"\n << \" precisely NDIM boundary condition objects must be provided.\" << endl);\n }\n d_u_bc_coefs = u_bc_coefs;\n return;\n}\/\/ setVelocityPhysicalBcCoefs\n\nvoid\nINSProjectionBcCoef::setTargetPatchDataIndex(\n const int target_idx)\n{\n \/\/ intentionally blank\n return;\n}\/\/ setTargetPatchDataIndex\n\nvoid\nINSProjectionBcCoef::setHomogeneousBc(\n const bool homogeneous_bc)\n{\n d_homogeneous_bc = homogeneous_bc;\n return;\n}\/\/ setHomogeneousBc\n\nconst std::set<int>&\nINSProjectionBcCoef::getHomogeneousBcFillDataIndices() const\n{\n return d_homo_patch_data_idxs;\n}\/\/ getHomogeneousBcFillDataIndices\n\nconst std::set<int>&\nINSProjectionBcCoef::getInhomogeneousBcFillDataIndices() const\n{\n return d_inhomo_patch_data_idxs;\n}\/\/ getInhomogeneousBcFillDataIndices\n\nvoid\nINSProjectionBcCoef::setBcCoefs(\n SAMRAI::tbox::Pointer<SAMRAI::pdat::ArrayData<NDIM,double> >& acoef_data,\n SAMRAI::tbox::Pointer<SAMRAI::pdat::ArrayData<NDIM,double> >& bcoef_data,\n SAMRAI::tbox::Pointer<SAMRAI::pdat::ArrayData<NDIM,double> >& gcoef_data,\n const SAMRAI::tbox::Pointer<SAMRAI::hier::Variable<NDIM> >& variable,\n const SAMRAI::hier::Patch<NDIM>& patch,\n const SAMRAI::hier::BoundaryBox<NDIM>& bdry_box,\n double fill_time) const\n{\n#if USING_OLD_ROBIN_BC_INTERFACE\n TBOX_ERROR(\"INSProjectionBcCoef::setBcCoefs():\\n\"\n << \" using incorrect SAMRAI::solv::RobinBcCoefStrategy interface.\" << endl);\n#else\n setBcCoefs_private(acoef_data, bcoef_data, gcoef_data, variable, patch, bdry_box, fill_time);\n#endif\n return;\n}\/\/ setBcCoefs\n\nvoid\nINSProjectionBcCoef::setBcCoefs(\n SAMRAI::tbox::Pointer<SAMRAI::pdat::ArrayData<NDIM,double> >& acoef_data,\n SAMRAI::tbox::Pointer<SAMRAI::pdat::ArrayData<NDIM,double> >& gcoef_data,\n const SAMRAI::tbox::Pointer<SAMRAI::hier::Variable<NDIM> >& variable,\n const SAMRAI::hier::Patch<NDIM>& patch,\n const SAMRAI::hier::BoundaryBox<NDIM>& bdry_box,\n double fill_time) const\n{\n#if USING_OLD_ROBIN_BC_INTERFACE\n SAMRAI::tbox::Pointer<SAMRAI::pdat::ArrayData<NDIM,double> > bcoef_data =\n (acoef_data.isNull()\n ? SAMRAI::tbox::Pointer<SAMRAI::pdat::ArrayData<NDIM,double> >(NULL)\n : new SAMRAI::pdat::ArrayData<NDIM,double>(acoef_data->getBox(), acoef_data->getDepth()));\n setBcCoefs_private(acoef_data, bcoef_data, gcoef_data, variable, patch, bdry_box, fill_time);\n#else\n TBOX_ERROR(\"INSProjectionBcCoef::setBcCoefs():\\n\"\n << \" using incorrect SAMRAI::solv::RobinBcCoefStrategy interface.\" << endl);\n#endif\n return;\n}\/\/ setBcCoefs\n\nSAMRAI::hier::IntVector<NDIM>\nINSProjectionBcCoef::numberOfExtensionsFillable() const\n{\n#ifdef DEBUG_CHECK_ASSERTIONS\n assert(d_u_bc_coefs.size() == NDIM);\n for (unsigned l = 0; l < d_u_bc_coefs.size(); ++l)\n {\n assert(d_u_bc_coefs[l] != NULL);\n }\n#endif\n SAMRAI::hier::IntVector<NDIM> ret_val(std::numeric_limits<int>::max());\n for (int d = 0; d < NDIM; ++d)\n {\n ret_val = SAMRAI::hier::IntVector<NDIM>::min(\n ret_val, d_u_bc_coefs[d]->numberOfExtensionsFillable());\n }\n return ret_val;\n}\/\/ numberOfExtensionsFillable\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/ PROTECTED \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/ PRIVATE \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nvoid\nINSProjectionBcCoef::setBcCoefs_private(\n SAMRAI::tbox::Pointer<SAMRAI::pdat::ArrayData<NDIM,double> >& acoef_data,\n SAMRAI::tbox::Pointer<SAMRAI::pdat::ArrayData<NDIM,double> >& bcoef_data,\n SAMRAI::tbox::Pointer<SAMRAI::pdat::ArrayData<NDIM,double> >& gcoef_data,\n const SAMRAI::tbox::Pointer<SAMRAI::hier::Variable<NDIM> >& variable,\n const SAMRAI::hier::Patch<NDIM>& patch,\n const SAMRAI::hier::BoundaryBox<NDIM>& bdry_box,\n double fill_time) const\n{\n#ifdef DEBUG_CHECK_ASSERTIONS\n assert(d_u_bc_coefs.size() == NDIM);\n for (unsigned l = 0; l < d_u_bc_coefs.size(); ++l)\n {\n assert(d_u_bc_coefs[l] != NULL);\n }\n#endif\n const int location_index = bdry_box.getLocationIndex();\n const int bdry_normal_axis = location_index\/2;\n const bool is_lower = location_index%2 == 0;\n\n const SAMRAI::hier::Box<NDIM> bc_coef_box =\n STOOLS::PhysicalBoundaryUtilities::makeSideBoundaryCodim1Box(bdry_box);\n\n const bool fill_acoef_data = !acoef_data.isNull();\n const bool fill_bcoef_data = !bcoef_data.isNull();\n const bool fill_gcoef_data = !gcoef_data.isNull();\n\n \/\/ Set the normal velocity bc coefs.\n#if USING_OLD_ROBIN_BC_INTERFACE\n d_u_bc_coefs[bdry_normal_axis]->setBcCoefs(\n acoef_data, gcoef_data, variable, patch, bdry_box, fill_time);\n#else\n d_u_bc_coefs[bdry_normal_axis]->setBcCoefs(\n acoef_data, bcoef_data, gcoef_data, variable, patch, bdry_box, fill_time);\n#endif\n\n \/\/ Loop over the boundary box and reset the homogeneous coefficients.\n for (SAMRAI::hier::Box<NDIM>::Iterator b(bc_coef_box); b; b++)\n {\n const SAMRAI::hier::Index<NDIM>& i = b();\n\n if (fill_acoef_data) (*acoef_data)(i,0) = 1.0-(*acoef_data)(i,0);\n if (fill_bcoef_data) (*bcoef_data)(i,0) = 1.0-(*bcoef_data)(i,0);\n if (fill_gcoef_data && d_homogeneous_bc) (*gcoef_data)(i,0) = 0.0;\n }\n\n \/\/ Loop over the boundary box and reset the inhomogeneous coefficients.\n if (!d_homogeneous_bc && fill_gcoef_data)\n {\n SAMRAI::tbox::Pointer<SAMRAI::pdat::FaceData<NDIM,double> > u_data = patch.getPatchData(d_u_idx);\n SAMRAI::tbox::Pointer<SAMRAI::pdat::CellData<NDIM,double> > P_data = patch.getPatchData(d_P_idx);\n#ifdef DEBUG_CHECK_ASSERTIONS\n assert(!u_data.isNull());\n assert(!P_data.isNull());\n assert(fill_acoef_data || fill_bcoef_data);\n#endif\n SAMRAI::tbox::Pointer<SAMRAI::pdat::ArrayData<NDIM,double> > pcoef_data =\n (acoef_data.isNull()\n ? new SAMRAI::pdat::ArrayData<NDIM,double>(bcoef_data->getBox(), bcoef_data->getDepth())\n : new SAMRAI::pdat::ArrayData<NDIM,double>(acoef_data->getBox(), acoef_data->getDepth()));\n\n if (d_P_bc_coef != NULL)\n {\n SAMRAI::tbox::Pointer<SAMRAI::pdat::ArrayData<NDIM,double> > null_data(NULL);\n#if USING_OLD_ROBIN_BC_INTERFACE\n d_P_bc_coef->setBcCoefs(\n null_data, pcoef_data, variable, patch, bdry_box, fill_time);\n#else\n d_P_bc_coef->setBcCoefs(\n null_data, null_data, pcoef_data, variable, patch, bdry_box, fill_time);\n#endif\n }\n else\n {\n pcoef_data->fillAll(0.0);\n }\n\n const bool using_pressure_increment = (d_projection_type == \"pressure_increment\");\n for (SAMRAI::hier::Box<NDIM>::Iterator b(bc_coef_box); b; b++)\n {\n const SAMRAI::hier::Index<NDIM>& i = b();\n const SAMRAI::pdat::FaceIndex<NDIM> i_f(\n i, bdry_normal_axis, SAMRAI::pdat::FaceIndex<NDIM>::Lower);\n\n if ((fill_acoef_data && SAMRAI::tbox::Utilities::deq((*acoef_data)(i,0),1.0)) ||\n (fill_bcoef_data && SAMRAI::tbox::Utilities::deq((*bcoef_data)(i,0),0.0)))\n {\n SAMRAI::hier::Index<NDIM> i_intr(i), i_bdry(i);\n if (is_lower)\n {\n i_bdry(bdry_normal_axis) -= 1;\n }\n else\n {\n i_intr(bdry_normal_axis) -= 1;\n }\n\n const double P_bdry = (using_pressure_increment ? 0.5*((*P_data)(i_intr) + (*P_data)(i_bdry)) : 0.0);\n (*gcoef_data)(i,0) = (*pcoef_data)(i,0) - P_bdry;\n }\n else\n {\n (*gcoef_data)(i,0) = (is_lower ? -1.0 : +1.0)*(d_rho\/d_dt)*((*u_data)(i_f) - (*gcoef_data)(i,0));\n }\n }\n }\n return;\n}\/\/ setBcCoefs_private\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/ NAMESPACE \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n}\/\/ namespace IBAMR\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/ TEMPLATE INSTANTIATION \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\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\n#include \"searchresultwindow.h\"\n#include \"searchresulttreemodel.h\"\n#include \"searchresulttreeitems.h\"\n\n#include <coreplugin\/icore.h>\n#include <utils\/qtcassert.h>\n\n#include <QtCore\/QFile>\n#include <QtCore\/QTextStream>\n#include <QtCore\/QSettings>\n#include <QtCore\/QDebug>\n#include <QtGui\/QListWidget>\n#include <QtGui\/QToolButton>\n#include <QtGui\/QLineEdit>\n#include <QtGui\/QStackedWidget>\n#include <QtGui\/QLabel>\n\nusing namespace Find;\nusing namespace Find::Internal;\n\nstatic const QString SETTINGSKEYSECTIONNAME(\"SearchResults\");\nstatic const QString SETTINGSKEYEXPANDRESULTS(\"ExpandResults\");\n\n\nSearchResultWindow::SearchResultWindow()\n : m_currentSearch(0),\n m_isShowingReplaceUI(false),\n m_focusReplaceEdit(false)\n{\n m_widget = new QStackedWidget;\n m_widget->setWindowTitle(name());\n\n m_searchResultTreeView = new SearchResultTreeView(m_widget);\n m_searchResultTreeView->setFrameStyle(QFrame::NoFrame);\n m_searchResultTreeView->setAttribute(Qt::WA_MacShowFocusRect, false);\n m_widget->addWidget(m_searchResultTreeView);\n\n m_noMatchesFoundDisplay = new QListWidget(m_widget);\n m_noMatchesFoundDisplay->addItem(tr(\"No matches found!\"));\n m_noMatchesFoundDisplay->setFrameStyle(QFrame::NoFrame);\n m_widget->addWidget(m_noMatchesFoundDisplay);\n\n m_expandCollapseToolButton = new QToolButton(m_widget);\n m_expandCollapseToolButton->setAutoRaise(true);\n m_expandCollapseToolButton->setCheckable(true);\n m_expandCollapseToolButton->setIcon(QIcon(\":\/find\/images\/expand.png\"));\n m_expandCollapseToolButton->setToolTip(tr(\"Expand All\"));\n\n m_replaceLabel = new QLabel(tr(\"Replace with:\"), m_widget);\n m_replaceLabel->setContentsMargins(12, 0, 5, 0);\n m_replaceTextEdit = new QLineEdit(m_widget);\n m_replaceButton = new QToolButton(m_widget);\n m_replaceButton->setToolTip(tr(\"Replace all occurrences\"));\n m_replaceButton->setText(tr(\"Replace\"));\n m_replaceButton->setToolButtonStyle(Qt::ToolButtonTextOnly);\n m_replaceButton->setAutoRaise(true);\n m_replaceTextEdit->setTabOrder(m_replaceTextEdit, m_searchResultTreeView);\n\n connect(m_searchResultTreeView, SIGNAL(jumpToSearchResult(int,bool)),\n this, SLOT(handleJumpToSearchResult(int,bool)));\n connect(m_expandCollapseToolButton, SIGNAL(toggled(bool)), this, SLOT(handleExpandCollapseToolButton(bool)));\n connect(m_replaceTextEdit, SIGNAL(returnPressed()), this, SLOT(handleReplaceButton()));\n connect(m_replaceButton, SIGNAL(clicked()), this, SLOT(handleReplaceButton()));\n\n readSettings();\n setShowReplaceUI(false);\n}\n\nSearchResultWindow::~SearchResultWindow()\n{\n writeSettings();\n delete m_currentSearch;\n m_currentSearch = 0;\n delete m_widget;\n m_widget = 0;\n m_items.clear();\n}\n\nvoid SearchResultWindow::setTextToReplace(const QString &textToReplace)\n{\n m_replaceTextEdit->setText(textToReplace);\n m_replaceTextEdit->selectAll();\n}\n\nQString SearchResultWindow::textToReplace() const\n{\n return m_replaceTextEdit->text();\n}\n\nvoid SearchResultWindow::setShowReplaceUI(bool show)\n{\n m_searchResultTreeView->model()->setShowReplaceUI(show);\n m_replaceLabel->setVisible(show);\n m_replaceTextEdit->setVisible(show);\n m_replaceButton->setVisible(show);\n m_isShowingReplaceUI = show;\n}\n\nvoid SearchResultWindow::handleReplaceButton()\n{\n QTC_ASSERT(m_currentSearch, return);\n \/\/ check if button is actually enabled, because this is also triggered\n \/\/ by pressing return in replace line edit\n if (m_replaceButton->isEnabled())\n m_currentSearch->replaceButtonClicked(m_replaceTextEdit->text(), checkedItems());\n}\n\nQList<SearchResultItem> SearchResultWindow::checkedItems() const\n{\n QList<SearchResultItem> result;\n SearchResultTreeModel *model = m_searchResultTreeView->model();\n const int fileCount = model->rowCount(QModelIndex());\n for (int i = 0; i < fileCount; ++i) {\n QModelIndex fileIndex = model->index(i, 0, QModelIndex());\n SearchResultFile *fileItem = static_cast<SearchResultFile *>(fileIndex.internalPointer());\n Q_ASSERT(fileItem != 0);\n for (int rowIndex = 0; rowIndex < fileItem->childrenCount(); ++rowIndex) {\n QModelIndex textIndex = model->index(rowIndex, 0, fileIndex);\n SearchResultTextRow *rowItem = static_cast<SearchResultTextRow *>(textIndex.internalPointer());\n if (rowItem->checkState())\n result << m_items.at(rowItem->index());\n }\n }\n return result;\n}\n\nvoid SearchResultWindow::visibilityChanged(bool \/*visible*\/)\n{\n}\n\nQWidget *SearchResultWindow::outputWidget(QWidget *)\n{\n return m_widget;\n}\n\nQList<QWidget*> SearchResultWindow::toolBarWidgets() const\n{\n return QList<QWidget*>() << m_expandCollapseToolButton << m_replaceLabel << m_replaceTextEdit << m_replaceButton;\n}\n\nSearchResult *SearchResultWindow::startNewSearch(SearchMode searchOrSearchAndReplace)\n{\n clearContents();\n setShowReplaceUI(searchOrSearchAndReplace != SearchOnly);\n delete m_currentSearch;\n m_currentSearch = new SearchResult;\n return m_currentSearch;\n}\n\nvoid SearchResultWindow::finishSearch()\n{\n if (m_items.count()) {\n m_replaceButton->setEnabled(true);\n } else {\n showNoMatchesFound();\n }\n}\n\nvoid SearchResultWindow::clearContents()\n{\n m_replaceTextEdit->setEnabled(false);\n m_replaceButton->setEnabled(false);\n m_replaceTextEdit->clear();\n m_searchResultTreeView->clear();\n m_items.clear();\n m_widget->setCurrentWidget(m_searchResultTreeView);\n navigateStateChanged();\n}\n\nvoid SearchResultWindow::showNoMatchesFound()\n{\n m_replaceTextEdit->setEnabled(false);\n m_replaceButton->setEnabled(false);\n m_widget->setCurrentWidget(m_noMatchesFoundDisplay);\n}\n\nbool SearchResultWindow::isEmpty() const\n{\n return (m_searchResultTreeView->model()->rowCount() < 1);\n}\n\nint SearchResultWindow::numberOfResults() const\n{\n return m_items.count();\n}\n\nbool SearchResultWindow::hasFocus()\n{\n return m_searchResultTreeView->hasFocus() || (m_isShowingReplaceUI && m_replaceTextEdit->hasFocus());\n}\n\nbool SearchResultWindow::canFocus()\n{\n return !m_items.isEmpty();\n}\n\nvoid SearchResultWindow::setFocus()\n{\n if (!m_items.isEmpty()) {\n if (!m_isShowingReplaceUI) {\n m_searchResultTreeView->setFocus();\n } else {\n if (!m_widget->focusWidget()\n || m_widget->focusWidget() == m_replaceTextEdit\n || m_focusReplaceEdit) {\n m_replaceTextEdit->setFocus();\n } else {\n m_searchResultTreeView->setFocus();\n }\n }\n }\n}\n\nvoid SearchResultWindow::setTextEditorFont(const QFont &font)\n{\n m_searchResultTreeView->setTextEditorFont(font);\n}\n\nvoid SearchResultWindow::handleJumpToSearchResult(int index, bool \/* checked *\/)\n{\n QTC_ASSERT(m_currentSearch, return);\n m_currentSearch->activated(m_items.at(index));\n}\n\nvoid SearchResultWindow::addResult(const QString &fileName, int lineNumber, const QString &rowText,\n int searchTermStart, int searchTermLength, const QVariant &userData)\n{\n \/\/qDebug()<<\"###\"<<fileName;\n m_widget->setCurrentWidget(m_searchResultTreeView);\n int index = m_items.size();\n SearchResultItem item;\n item.fileName = fileName;\n item.lineNumber = lineNumber;\n item.lineText = rowText;\n item.searchTermStart = searchTermStart;\n item.searchTermLength = searchTermLength;\n item.userData = userData;\n item.index = index;\n m_items.append(item);\n m_searchResultTreeView->appendResultLine(index, fileName, lineNumber, rowText, searchTermStart, searchTermLength);\n if (index == 0) {\n m_replaceTextEdit->setEnabled(true);\n \/\/ We didn't have an item before, set the focus to the search widget\n m_focusReplaceEdit = true;\n setFocus();\n m_focusReplaceEdit = false;\n m_searchResultTreeView->selectionModel()->select(m_searchResultTreeView->model()->index(0, 0, QModelIndex()), QItemSelectionModel::Select);\n emit navigateStateChanged();\n }\n}\n\nvoid SearchResultWindow::handleExpandCollapseToolButton(bool checked)\n{\n m_searchResultTreeView->setAutoExpandResults(checked);\n if (checked)\n m_searchResultTreeView->expandAll();\n else\n m_searchResultTreeView->collapseAll();\n}\n\nvoid SearchResultWindow::readSettings()\n{\n QSettings *s = Core::ICore::instance()->settings();\n if (s) {\n s->beginGroup(SETTINGSKEYSECTIONNAME);\n m_expandCollapseToolButton->setChecked(s->value(SETTINGSKEYEXPANDRESULTS, m_initiallyExpand).toBool());\n s->endGroup();\n }\n}\n\nvoid SearchResultWindow::writeSettings()\n{\n QSettings *s = Core::ICore::instance()->settings();\n if (s) {\n s->beginGroup(SETTINGSKEYSECTIONNAME);\n s->setValue(SETTINGSKEYEXPANDRESULTS, m_expandCollapseToolButton->isChecked());\n s->endGroup();\n }\n}\n\nint SearchResultWindow::priorityInStatusBar() const\n{\n return 80;\n}\n\nbool SearchResultWindow::canNext()\n{\n return m_items.count() > 0;\n}\n\nbool SearchResultWindow::canPrevious()\n{\n return m_items.count() > 0;\n}\n\nvoid SearchResultWindow::goToNext()\n{\n if (m_items.count() == 0)\n return;\n QModelIndex idx = m_searchResultTreeView->model()->next(m_searchResultTreeView->currentIndex());\n if (idx.isValid()) {\n m_searchResultTreeView->setCurrentIndex(idx);\n m_searchResultTreeView->emitJumpToSearchResult(idx);\n }\n}\nvoid SearchResultWindow::goToPrev()\n{\n if (!m_searchResultTreeView->model()->rowCount())\n return;\n QModelIndex idx = m_searchResultTreeView->model()->prev(m_searchResultTreeView->currentIndex());\n if (idx.isValid()) {\n m_searchResultTreeView->setCurrentIndex(idx);\n m_searchResultTreeView->emitJumpToSearchResult(idx);\n }\n}\n\nbool SearchResultWindow::canNavigate()\n{\n return true;\n}\n<commit_msg>Fixed a few focus issues we had in the search result window (in replace mode).<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\n#include \"searchresultwindow.h\"\n#include \"searchresulttreemodel.h\"\n#include \"searchresulttreeitems.h\"\n\n#include <coreplugin\/icore.h>\n#include <utils\/qtcassert.h>\n\n#include <QtCore\/QFile>\n#include <QtCore\/QTextStream>\n#include <QtCore\/QSettings>\n#include <QtCore\/QDebug>\n#include <QtGui\/QListWidget>\n#include <QtGui\/QToolButton>\n#include <QtGui\/QLineEdit>\n#include <QtGui\/QStackedWidget>\n#include <QtGui\/QLabel>\n\nusing namespace Find;\nusing namespace Find::Internal;\n\nstatic const QString SETTINGSKEYSECTIONNAME(\"SearchResults\");\nstatic const QString SETTINGSKEYEXPANDRESULTS(\"ExpandResults\");\n\n\nSearchResultWindow::SearchResultWindow()\n : m_currentSearch(0),\n m_isShowingReplaceUI(false),\n m_focusReplaceEdit(false)\n{\n m_widget = new QStackedWidget;\n m_widget->setWindowTitle(name());\n\n m_searchResultTreeView = new SearchResultTreeView(m_widget);\n m_searchResultTreeView->setFrameStyle(QFrame::NoFrame);\n m_searchResultTreeView->setAttribute(Qt::WA_MacShowFocusRect, false);\n m_widget->addWidget(m_searchResultTreeView);\n\n m_noMatchesFoundDisplay = new QListWidget(m_widget);\n m_noMatchesFoundDisplay->addItem(tr(\"No matches found!\"));\n m_noMatchesFoundDisplay->setFrameStyle(QFrame::NoFrame);\n m_widget->addWidget(m_noMatchesFoundDisplay);\n\n m_expandCollapseToolButton = new QToolButton(m_widget);\n m_expandCollapseToolButton->setAutoRaise(true);\n m_expandCollapseToolButton->setCheckable(true);\n m_expandCollapseToolButton->setIcon(QIcon(\":\/find\/images\/expand.png\"));\n m_expandCollapseToolButton->setToolTip(tr(\"Expand All\"));\n\n m_replaceLabel = new QLabel(tr(\"Replace with:\"), m_widget);\n m_replaceLabel->setContentsMargins(12, 0, 5, 0);\n m_replaceTextEdit = new QLineEdit(m_widget);\n m_replaceButton = new QToolButton(m_widget);\n m_replaceButton->setToolTip(tr(\"Replace all occurrences\"));\n m_replaceButton->setText(tr(\"Replace\"));\n m_replaceButton->setToolButtonStyle(Qt::ToolButtonTextOnly);\n m_replaceButton->setAutoRaise(true);\n m_replaceTextEdit->setTabOrder(m_replaceTextEdit, m_searchResultTreeView);\n\n connect(m_searchResultTreeView, SIGNAL(jumpToSearchResult(int,bool)),\n this, SLOT(handleJumpToSearchResult(int,bool)));\n connect(m_expandCollapseToolButton, SIGNAL(toggled(bool)), this, SLOT(handleExpandCollapseToolButton(bool)));\n connect(m_replaceTextEdit, SIGNAL(returnPressed()), this, SLOT(handleReplaceButton()));\n connect(m_replaceButton, SIGNAL(clicked()), this, SLOT(handleReplaceButton()));\n\n readSettings();\n setShowReplaceUI(false);\n}\n\nSearchResultWindow::~SearchResultWindow()\n{\n writeSettings();\n delete m_currentSearch;\n m_currentSearch = 0;\n delete m_widget;\n m_widget = 0;\n m_items.clear();\n}\n\nvoid SearchResultWindow::setTextToReplace(const QString &textToReplace)\n{\n m_replaceTextEdit->setText(textToReplace);\n}\n\nQString SearchResultWindow::textToReplace() const\n{\n return m_replaceTextEdit->text();\n}\n\nvoid SearchResultWindow::setShowReplaceUI(bool show)\n{\n m_searchResultTreeView->model()->setShowReplaceUI(show);\n m_replaceLabel->setVisible(show);\n m_replaceTextEdit->setVisible(show);\n m_replaceButton->setVisible(show);\n m_isShowingReplaceUI = show;\n}\n\nvoid SearchResultWindow::handleReplaceButton()\n{\n QTC_ASSERT(m_currentSearch, return);\n \/\/ check if button is actually enabled, because this is also triggered\n \/\/ by pressing return in replace line edit\n if (m_replaceButton->isEnabled())\n m_currentSearch->replaceButtonClicked(m_replaceTextEdit->text(), checkedItems());\n}\n\nQList<SearchResultItem> SearchResultWindow::checkedItems() const\n{\n QList<SearchResultItem> result;\n SearchResultTreeModel *model = m_searchResultTreeView->model();\n const int fileCount = model->rowCount(QModelIndex());\n for (int i = 0; i < fileCount; ++i) {\n QModelIndex fileIndex = model->index(i, 0, QModelIndex());\n SearchResultFile *fileItem = static_cast<SearchResultFile *>(fileIndex.internalPointer());\n Q_ASSERT(fileItem != 0);\n for (int rowIndex = 0; rowIndex < fileItem->childrenCount(); ++rowIndex) {\n QModelIndex textIndex = model->index(rowIndex, 0, fileIndex);\n SearchResultTextRow *rowItem = static_cast<SearchResultTextRow *>(textIndex.internalPointer());\n if (rowItem->checkState())\n result << m_items.at(rowItem->index());\n }\n }\n return result;\n}\n\nvoid SearchResultWindow::visibilityChanged(bool \/*visible*\/)\n{\n}\n\nQWidget *SearchResultWindow::outputWidget(QWidget *)\n{\n return m_widget;\n}\n\nQList<QWidget*> SearchResultWindow::toolBarWidgets() const\n{\n return QList<QWidget*>() << m_expandCollapseToolButton << m_replaceLabel << m_replaceTextEdit << m_replaceButton;\n}\n\nSearchResult *SearchResultWindow::startNewSearch(SearchMode searchOrSearchAndReplace)\n{\n clearContents();\n setShowReplaceUI(searchOrSearchAndReplace != SearchOnly);\n delete m_currentSearch;\n m_currentSearch = new SearchResult;\n return m_currentSearch;\n}\n\nvoid SearchResultWindow::finishSearch()\n{\n if (m_items.count()) {\n m_replaceButton->setEnabled(true);\n } else {\n showNoMatchesFound();\n }\n}\n\nvoid SearchResultWindow::clearContents()\n{\n m_replaceTextEdit->setEnabled(false);\n m_replaceButton->setEnabled(false);\n m_replaceTextEdit->clear();\n m_searchResultTreeView->clear();\n m_items.clear();\n m_widget->setCurrentWidget(m_searchResultTreeView);\n navigateStateChanged();\n}\n\nvoid SearchResultWindow::showNoMatchesFound()\n{\n m_replaceTextEdit->setEnabled(false);\n m_replaceButton->setEnabled(false);\n m_widget->setCurrentWidget(m_noMatchesFoundDisplay);\n}\n\nbool SearchResultWindow::isEmpty() const\n{\n return (m_searchResultTreeView->model()->rowCount() < 1);\n}\n\nint SearchResultWindow::numberOfResults() const\n{\n return m_items.count();\n}\n\nbool SearchResultWindow::hasFocus()\n{\n return m_searchResultTreeView->hasFocus() || (m_isShowingReplaceUI && m_replaceTextEdit->hasFocus());\n}\n\nbool SearchResultWindow::canFocus()\n{\n return !m_items.isEmpty();\n}\n\nvoid SearchResultWindow::setFocus()\n{\n if (!m_items.isEmpty()) {\n if (!m_isShowingReplaceUI) {\n m_searchResultTreeView->setFocus();\n } else {\n if (!m_widget->focusWidget()\n || m_widget->focusWidget() == m_replaceTextEdit\n || m_focusReplaceEdit) {\n m_replaceTextEdit->setFocus();\n m_replaceTextEdit->selectAll();\n } else {\n m_searchResultTreeView->setFocus();\n }\n }\n }\n}\n\nvoid SearchResultWindow::setTextEditorFont(const QFont &font)\n{\n m_searchResultTreeView->setTextEditorFont(font);\n}\n\nvoid SearchResultWindow::handleJumpToSearchResult(int index, bool \/* checked *\/)\n{\n QTC_ASSERT(m_currentSearch, return);\n m_currentSearch->activated(m_items.at(index));\n}\n\nvoid SearchResultWindow::addResult(const QString &fileName, int lineNumber, const QString &rowText,\n int searchTermStart, int searchTermLength, const QVariant &userData)\n{\n \/\/qDebug()<<\"###\"<<fileName;\n m_widget->setCurrentWidget(m_searchResultTreeView);\n int index = m_items.size();\n SearchResultItem item;\n item.fileName = fileName;\n item.lineNumber = lineNumber;\n item.lineText = rowText;\n item.searchTermStart = searchTermStart;\n item.searchTermLength = searchTermLength;\n item.userData = userData;\n item.index = index;\n m_items.append(item);\n m_searchResultTreeView->appendResultLine(index, fileName, lineNumber, rowText, searchTermStart, searchTermLength);\n if (index == 0) {\n m_replaceTextEdit->setEnabled(true);\n \/\/ We didn't have an item before, set the focus to the search widget\n m_focusReplaceEdit = true;\n setFocus();\n m_focusReplaceEdit = false;\n m_searchResultTreeView->selectionModel()->select(m_searchResultTreeView->model()->index(0, 0, QModelIndex()), QItemSelectionModel::Select);\n emit navigateStateChanged();\n }\n}\n\nvoid SearchResultWindow::handleExpandCollapseToolButton(bool checked)\n{\n m_searchResultTreeView->setAutoExpandResults(checked);\n if (checked)\n m_searchResultTreeView->expandAll();\n else\n m_searchResultTreeView->collapseAll();\n}\n\nvoid SearchResultWindow::readSettings()\n{\n QSettings *s = Core::ICore::instance()->settings();\n if (s) {\n s->beginGroup(SETTINGSKEYSECTIONNAME);\n m_expandCollapseToolButton->setChecked(s->value(SETTINGSKEYEXPANDRESULTS, m_initiallyExpand).toBool());\n s->endGroup();\n }\n}\n\nvoid SearchResultWindow::writeSettings()\n{\n QSettings *s = Core::ICore::instance()->settings();\n if (s) {\n s->beginGroup(SETTINGSKEYSECTIONNAME);\n s->setValue(SETTINGSKEYEXPANDRESULTS, m_expandCollapseToolButton->isChecked());\n s->endGroup();\n }\n}\n\nint SearchResultWindow::priorityInStatusBar() const\n{\n return 80;\n}\n\nbool SearchResultWindow::canNext()\n{\n return m_items.count() > 0;\n}\n\nbool SearchResultWindow::canPrevious()\n{\n return m_items.count() > 0;\n}\n\nvoid SearchResultWindow::goToNext()\n{\n if (m_items.count() == 0)\n return;\n QModelIndex idx = m_searchResultTreeView->model()->next(m_searchResultTreeView->currentIndex());\n if (idx.isValid()) {\n m_searchResultTreeView->setCurrentIndex(idx);\n m_searchResultTreeView->emitJumpToSearchResult(idx);\n }\n}\nvoid SearchResultWindow::goToPrev()\n{\n if (!m_searchResultTreeView->model()->rowCount())\n return;\n QModelIndex idx = m_searchResultTreeView->model()->prev(m_searchResultTreeView->currentIndex());\n if (idx.isValid()) {\n m_searchResultTreeView->setCurrentIndex(idx);\n m_searchResultTreeView->emitJumpToSearchResult(idx);\n }\n}\n\nbool SearchResultWindow::canNavigate()\n{\n return true;\n}\n<|endoftext|>"} {"text":"<commit_before>\/*\nCopyright (c) 2009 Stephen John Bush\n\nPermission is hereby granted, free of charge, to any person obtaining a copy\nof this software and associated documentation files (the \"Software\"), to deal\nin the Software without restriction, including without limitation the rights\nto use, copy, modify, merge, publish, distribute, sublicense, and\/or sell\ncopies of the Software, and to permit persons to whom the Software is\nfurnished to do so, subject to the following conditions:\n\nThe above copyright notice and this permission notice shall be included in\nall copies or substantial portions of the Software.\n\nTHE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\nIMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\nFITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE\nAUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\nLIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,\nOUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN\nTHE SOFTWARE.\n*\/\n\n#ifndef _MSC_VER\n#define _POSIX_SOURCE\n#endif\n\n\/\/#define TRACING\n\n#ifdef _POSIX_SOURCE\n\t#include <config.h>\n\n\t#include <cstdlib>\n\t#include <iostream>\n\t#include <string>\n\t#include <stdio.h>\n#ifdef HAVE_BACKTRACE\n\t#include <execinfo.h>\n#endif\n\n#endif\n\t\/\/for signal\n\t#include <signal.h>\n\n\/\/C4530: C++ exception handler used, but unwind semantics are not enabled. \n#pragma warning (disable: 4530)\n\n#include <exodus\/mvimpl.h>\n#include <exodus\/mv.h>\n\n\/\/Simple implementation of an additional output to the console:\n#ifdef _MSC_VER\n#include <exodus\/StackWalker.h>\nclass MyStackWalker : public StackWalker\n{\npublic:\n\n\texodus::var returnlines;\n\n\tMyStackWalker() : StackWalker(), returnlines(\"\")\n\t{}\n\n\tMyStackWalker(DWORD dwProcessId, HANDLE hProcess)\n\t: StackWalker(dwProcessId, hProcess), returnlines(\"\")\n\t{}\n\tvirtual void OnOutput(LPCSTR szText)\n\t{\n\t\t\/\/printf(szText);\n\n\t\t\/\/printf(\"fgets:%s\", path);\n\t\texodus::var line=exodus::var(szText).convert(\"\\x0d\\x0a\",\"\");\/\/.outputl(\"path=\");\n\t\texodus::var filename=line.field(\":\",1,2);\/\/.outputl(\"filename=\");\n\t\texodus::var lineno=filename.field2(\" \",-1);\/\/.outputl(\"lineno=\");\n\t\tfilename.splicer(-(lineno.length()+1),999999,\"\");\n\t\tlineno.substrer(2,lineno.length()-2);\n\t\tif (filename.index(\"stackwalker.cpp\")||filename.index(\"debug.cpp\")||filename.index(\"crtexe.c\"))\n\t\t\treturn;\n\t\tif (lineno.isnum()&&lineno)\n\t\t{\n\t\t\texodus::var linetext=filename.field2(exodus::SLASH,-1) ^ \":\" ^ lineno;\n\t\t\texodus::var filetext;\n\t\/\/ALN:NOTE: .osread could itself throw exception and we will have loop :(\n\t\/\/ Changed to read directly with default locale. If no locale specified (as it was in original version of the code)\n\t\t\tif (filetext.osread(filename))\n\/\/\t\t\tif (filetext.osread(filename, L\"\"))\t\t\/\/ avoid to read C++ source as UTF8\n\t\t\t{\n\t\t\t\tlinetext^=\": \" ^ filetext.field(\"\\x0A\",lineno).trimf(\" \\t\");\n\t\t\t\tif (linetext.index(\"backtrace(\"))\n\t\t\t\t\treturn;\n\t\t\t}\n\t\t\t\/\/outputl(linetext);\n\t\t\treturnlines^=exodus::FM^linetext;\n\t\t}\n\n\/\/\t\tStackWalker::OnOutput(szText);\n\t}\n};\n#endif\n\n#ifndef HAVE_BACKTRACE\n#define NOBACKTRACE\n#endif\n\nnamespace exodus {\n\nvoid addbacktraceline(const var& sourcefilename, const var& lineno, var& returnlines)\n{\n\n#ifdef TRACING\n\tsourcefilename.outputl(\"SOURCEFILENAME=\");\n\tlineno.outputl(\"LINENO=\");\n#endif\n\n\tif (not lineno || not lineno.isnum())\n\t\treturn;\n\n\tvar linetext=sourcefilename ^ \":\" ^ lineno;\n\n\t\/\/get the source file text\n\tvar filetext;\n\tif (filetext.osread(sourcefilename)) {\n\t}\n\n\t\/\/change DOS\/WIN and MAC line ends to lf only\n\tfiletext.swapper(\"\\x0D\\x0A\",\"\\x0A\").converter(\"\\x0D\",\"\\x0A\");\n\n\t\/\/extract the source line\n\tvar line=filetext.field(\"\\x0A\",lineno).trimf(\" \\t\");\n\n\t\/\/suppress confusing and unhelpful exodus macros\n\tif (\n\t\t(line == \"programexit()\" || line == \"libraryexit()\" || line == \"classexit()\")\n\tor\n\t\t(line == \"}\" && sourcefilename.substr(-2,2) == \".h\")\n\t)\n\t\treturn;\n\n\n\t\/\/outputl(linetext);\n\tlinetext^=\": \" ^ line;\n\n\treturnlines^=FM^linetext;\n\n\treturn;\n}\n\n\n\/\/http:\/\/www.delorie.com\/gnu\/docs\/glibc\/libc_665.html\nvar backtrace()\n{\n\n#ifdef _MSC_VER\n\t\/\/logputl(\"backtrace() not implemented on windows yet\");\n\t\/\/var().abort(\"\");\n\tMyStackWalker sw;\n\tsw.ShowCallstack();\n\treturn sw.returnlines;\n#elif !defined(HAVE_BACKTRACE)\n\tprintf(\"backtrace() not available\");\n\treturn L\"\";\n#else\n\n\tvar internaladdresses=\"\";\n\n#define BACKTRACE_MAXADDRESSES 500\n\tvoid *addresses[BACKTRACE_MAXADDRESSES];\n\n\n\/* example of TRACE from osx 64\nStack frames: 8\nBacktrace 0: 0x10000c313\n0 libexodus-11.5.0.dylib 0x000000010000c313 _ZN6exodus9backtraceEv + 99\nBacktrace 1: 0x10001ec51\n1 libexodus-11.5.0.dylib 0x000000010001ec51 _ZN6exodus11MVExceptionC2ERKNS_3varE + 129\nBacktrace 2: 0x10001f314\n2 libexodus-11.5.0.dylib 0x000000010001f314 _ZN6exodus12MVUnassignedC2ERKNS_3varE + 52\nBacktrace 3: 0x10000e193\n3 libexodus-11.5.0.dylib 0x000000010000e193 _ZNK6exodus3var3putERSo + 243\nBacktrace 4: 0x10000e322\n4 libexodus-11.5.0.dylib 0x000000010000e322 _ZNK6exodus3var7outputlEv + 34\nBacktrace 5: 0x10000143f\n5 steve 0x000000010000143f _ZN13ExodusProgram4mainEv + 77\nBacktrace 6: 0x1000010e6\n6 steve 0x00000001000010e6 main + 99\nBacktrace 7: 0x100000f64\n7 steve 0x0000000100000f64 start + 52\n*\/\n\n\t\/\/TODO autodetect if addr2line or dwalfdump\/dSYM is available\n\n\n\n#ifdef __APPLE__\n\tint size = ::backtrace(addresses, BACKTRACE_MAXADDRESSES);\n\tchar **strings = backtrace_symbols(addresses, size);\n\/\/printf(\"Stack frames: %d\\n\", size);\n\n\tvar returnlines=\"\";\n\n\tfor(int i = 0; i < size; i++) {\n\n#ifdef TRACING\n\t\t\/\/each string is like:\n\t\t\/\/6 steve 0x00000001000010e6 main + 99\n\t\t\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\t\tprintf(\"%s\\n\", strings[i]);\n#endif\n\t\t\/\/parse one string for object filename and offset\n\t\tvar onestring=var(strings[i]).trim();\n\t\tvar objectfilename=onestring.field(L\" \",2);\n\t\tvar objectoffset=onestring.field(L\" \",3);\n\n\t\t\/\/looking for a dwarfdump line like this:\n\t\t\/\/Line table file: 'steve.cpp' line 14, column 0 with start address 0x000000010000109e\n\t\t\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n\t\t\/\/get a dwarfdump line containing source filename and line number\n\t\tvar debugfilename=objectfilename^\".dSYM\";\n\t\tvar cmd=L\"dwarfdump \"^debugfilename^L\" --lookup \"^objectoffset^L\" |grep \\\"Line table file: \\\" 2> \/dev\/null\";\n\t\tvar result=cmd.osshellread();\n#ifdef TRACING\n\tcmd.outputl(\"CMD=\");\n\tresult.outputl(\"RESULT=\");\n#endif\n\t\tif (not result)\n\t\t\tcontinue;\n\n\t\t\/\/parse the dwarfdump line for source filename and line number\n\t\tvar sourcefilename=result.field(\"'\",2);\n\t\tvar lineno=result.field(\"'\",3).trim().field(\" \",2).field(\",\",1);\n\n\t\taddbacktraceline(sourcefilename,lineno,returnlines);\n\n\t}\n\n\tfree(strings);\n\treturn returnlines.substr(2);\n\n\n\n\/\/not __APPLE_\n#else\n\n\tint size = ::backtrace(addresses, BACKTRACE_MAXADDRESSES);\n#ifdef TRACING\n\tchar **strings = backtrace_symbols(addresses, size);\n\tprintf(\"Stack frames: %d\\n\", size);\n#endif\n\n\tfor(int i = 0; i < size; i++)\n\t{\n\t\t\/\/#pragma warning (disable: 4311)\n\t\tinternaladdresses^=\" \" ^ var((long long) addresses[i]).oconv(\"MX\");\n\n#ifdef TRACING\n\t\tif (sizeof addresses[i] == 4)\n\t\t\tprintf(\"Backtrace %d: %X\\n\", i, (unsigned int)(long long)addresses[i]);\n\t\telse\n\t\t\tprintf(\"Backtrace %d: %#llx\\n\", i, (long long)addresses[i]);\n\t\tprintf(\"%s\\n\", strings[i]);\n#endif\n\n\t}\n\n#ifdef TRACING\n\tfree(strings);\n#endif\n\n\tFILE *fp;\n\t\/\/int status;\n\tchar path[1024];\n\n\tvar binaryfilename=EXECPATH2.field(\" \",1);\n\tif (binaryfilename == binaryfilename.convert(\"\/\\\\:\",\"\"))\n\t\tbinaryfilename=\"`which \" ^ binaryfilename ^ \"`\";\n\n#ifdef __APPLE__\n\tvar oscmd=\"atos -o \" ^ binaryfilename.quote() ^ \" \" ^ internaladdresses;\n#else\n\tvar oscmd=\"addr2line -e \" ^ binaryfilename.quote() ^ \" \" ^ internaladdresses;\n#endif\n\t\/\/oscmd.outputl();\n\n#ifdef TRACING\n\tprintf(\"EXECPATH = %s\\n\",EXECPATH2.toString().c_str());\n\tprintf(\"executing %s\\n\",oscmd.toString().c_str());\n#endif\n\n\t\/* Open the command for reading. *\/\n\tfp = popen(oscmd.toString().c_str(), \"r\");\n\tif (fp == NULL)\n\t{\n\t\tprintf(\"Failed to run command\\n\" );\n\t\treturn L\"\";\n\t}\n\n#ifdef TRACING\n\tprintf(\"reading output of addr2line\\n\");\n#endif\n\n\tvar returnlines=\"\";\n\n\t\/* Read the output a line at a time - output it. *\/\n\twhile (fgets(path, sizeof(path)-1, fp) != NULL)\n\t{\n\n#ifdef TRACING\n\t\tprintf(\"fgets:%s\", path);\n#endif\n\n\t\tvar path2=var(path).convert(\"\\x0d\\x0a\",\"\");\/\/.outputl(\"path=\");\n\t\tvar sourcefilename=path2.field(\":\",1);\/\/.outputl(\"filename=\");\n\t\tvar lineno=path2.field(\":\",2);\/\/.outputl(\"lineno=\");\n\n\t\taddbacktraceline(sourcefilename,lineno,returnlines);\n\t}\n\n\t\/* close *\/\n\tpclose(fp);\n\t\n\treturn returnlines.substr(2);\n#endif\n\n#endif\n\t\n}\n\nvoid SIGINT_handler (int sig)\n{\n\t\/\/ignore more of this signal\n\t\/\/var().breakoff()\n\t\/\/faster\/safer\n\tsignal(sig, SIG_IGN);\n\n\t\/\/duplicated in init and B\n\tbacktrace().convert(FM,\"\\n\").outputl();\n\n\tfor (;;)\n\t{\n\n\t\tprintf (\"\\nInterrupted. (C)ontinue (E)nd (B)acktrace\\n\");\n\n\t\toutput(\"? \");\n\t\tvar cmd;\n\t\tif (! cmd.input())\n\t\tcontinue;\n\t\tvar cmd1=cmd[1].ucase();\n\n\t\tif (cmd1 == \"C\")\n\t\t\tbreak;\n\n\t\telse if (cmd1==\"E\")\n\n\t\t\tvar().abort(\"Aborted. User interrupt\");\n\n\t\telse if (cmd1==\"B\")\n\n\t\t\t\/\/duplicated in init and B\n\t\t\tbacktrace().convert(FM,\"\\n\").outputl();\n\n\t}\n\n\t\/\/stop ignoreing this signal\n\t\/\/var().breakon()\n\t\/\/faster\/safer\n\tsignal(SIGINT, SIGINT_handler);\n}\n\nvoid var::breakoff() const\n{\n\t\/\/ignore more of this signal\n\tsignal(SIGINT, SIG_IGN);\n}\n\nvoid var::breakon() const\n{\n\tsignal(SIGINT, SIGINT_handler); \/* this line will redirect ctrl+c signal*\/\n}\n\n}\/\/namespace exodus\n<commit_msg>fix \"addr2line: '\/home\/neosys\/testsort': No such file\" type messages<commit_after>\/*\nCopyright (c) 2009 Stephen John Bush\n\nPermission is hereby granted, free of charge, to any person obtaining a copy\nof this software and associated documentation files (the \"Software\"), to deal\nin the Software without restriction, including without limitation the rights\nto use, copy, modify, merge, publish, distribute, sublicense, and\/or sell\ncopies of the Software, and to permit persons to whom the Software is\nfurnished to do so, subject to the following conditions:\n\nThe above copyright notice and this permission notice shall be included in\nall copies or substantial portions of the Software.\n\nTHE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\nIMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\nFITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE\nAUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\nLIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,\nOUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN\nTHE SOFTWARE.\n*\/\n\n#ifndef _MSC_VER\n#define _POSIX_SOURCE\n#endif\n\n\/\/#define TRACING\n\n#ifdef _POSIX_SOURCE\n\t#include <config.h>\n\n\t#include <cstdlib>\n\t#include <iostream>\n\t#include <string>\n\t#include <stdio.h>\n#ifdef HAVE_BACKTRACE\n\t#include <execinfo.h>\n#endif\n\n#endif\n\t\/\/for signal\n\t#include <signal.h>\n\n\/\/C4530: C++ exception handler used, but unwind semantics are not enabled. \n#pragma warning (disable: 4530)\n\n#include <exodus\/mvimpl.h>\n#include <exodus\/mv.h>\n\n\/\/Simple implementation of an additional output to the console:\n#ifdef _MSC_VER\n#include <exodus\/StackWalker.h>\nclass MyStackWalker : public StackWalker\n{\npublic:\n\n\texodus::var returnlines;\n\n\tMyStackWalker() : StackWalker(), returnlines(\"\")\n\t{}\n\n\tMyStackWalker(DWORD dwProcessId, HANDLE hProcess)\n\t: StackWalker(dwProcessId, hProcess), returnlines(\"\")\n\t{}\n\tvirtual void OnOutput(LPCSTR szText)\n\t{\n\t\t\/\/printf(szText);\n\n\t\t\/\/printf(\"fgets:%s\", path);\n\t\texodus::var line=exodus::var(szText).convert(\"\\x0d\\x0a\",\"\");\/\/.outputl(\"path=\");\n\t\texodus::var filename=line.field(\":\",1,2);\/\/.outputl(\"filename=\");\n\t\texodus::var lineno=filename.field2(\" \",-1);\/\/.outputl(\"lineno=\");\n\t\tfilename.splicer(-(lineno.length()+1),999999,\"\");\n\t\tlineno.substrer(2,lineno.length()-2);\n\t\tif (filename.index(\"stackwalker.cpp\")||filename.index(\"debug.cpp\")||filename.index(\"crtexe.c\"))\n\t\t\treturn;\n\t\tif (lineno.isnum()&&lineno)\n\t\t{\n\t\t\texodus::var linetext=filename.field2(exodus::SLASH,-1) ^ \":\" ^ lineno;\n\t\t\texodus::var filetext;\n\t\/\/ALN:NOTE: .osread could itself throw exception and we will have loop :(\n\t\/\/ Changed to read directly with default locale. If no locale specified (as it was in original version of the code)\n\t\t\tif (filetext.osread(filename))\n\/\/\t\t\tif (filetext.osread(filename, L\"\"))\t\t\/\/ avoid to read C++ source as UTF8\n\t\t\t{\n\t\t\t\tlinetext^=\": \" ^ filetext.field(\"\\x0A\",lineno).trimf(\" \\t\");\n\t\t\t\tif (linetext.index(\"backtrace(\"))\n\t\t\t\t\treturn;\n\t\t\t}\n\t\t\t\/\/outputl(linetext);\n\t\t\treturnlines^=exodus::FM^linetext;\n\t\t}\n\n\/\/\t\tStackWalker::OnOutput(szText);\n\t}\n};\n#endif\n\n#ifndef HAVE_BACKTRACE\n#define NOBACKTRACE\n#endif\n\nnamespace exodus {\n\nvoid addbacktraceline(const var& sourcefilename, const var& lineno, var& returnlines)\n{\n\n#ifdef TRACING\n\tsourcefilename.outputl(\"SOURCEFILENAME=\");\n\tlineno.outputl(\"LINENO=\");\n#endif\n\n\tif (not lineno || not lineno.isnum())\n\t\treturn;\n\n\tvar linetext=sourcefilename ^ \":\" ^ lineno;\n\n\t\/\/get the source file text\n\tvar filetext;\n\tif (filetext.osread(sourcefilename)) {\n\t}\n\n\t\/\/change DOS\/WIN and MAC line ends to lf only\n\tfiletext.swapper(\"\\x0D\\x0A\",\"\\x0A\").converter(\"\\x0D\",\"\\x0A\");\n\n\t\/\/extract the source line\n\tvar line=filetext.field(\"\\x0A\",lineno).trimf(\" \\t\");\n\n\t\/\/suppress confusing and unhelpful exodus macros\n\tif (\n\t\t(line == \"programexit()\" || line == \"libraryexit()\" || line == \"classexit()\")\n\tor\n\t\t(line == \"}\" && sourcefilename.substr(-2,2) == \".h\")\n\t)\n\t\treturn;\n\n\n\t\/\/outputl(linetext);\n\tlinetext^=\": \" ^ line;\n\n\treturnlines^=FM^linetext;\n\n\treturn;\n}\n\n\n\/\/http:\/\/www.delorie.com\/gnu\/docs\/glibc\/libc_665.html\nvar backtrace()\n{\n\n#ifdef _MSC_VER\n\t\/\/logputl(\"backtrace() not implemented on windows yet\");\n\t\/\/var().abort(\"\");\n\tMyStackWalker sw;\n\tsw.ShowCallstack();\n\treturn sw.returnlines;\n#elif !defined(HAVE_BACKTRACE)\n\tprintf(\"backtrace() not available\");\n\treturn L\"\";\n#else\n\n\tvar internaladdresses=\"\";\n\n#define BACKTRACE_MAXADDRESSES 500\n\tvoid *addresses[BACKTRACE_MAXADDRESSES];\n\n\n\/* example of TRACE from osx 64\nStack frames: 8\nBacktrace 0: 0x10000c313\n0 libexodus-11.5.0.dylib 0x000000010000c313 _ZN6exodus9backtraceEv + 99\nBacktrace 1: 0x10001ec51\n1 libexodus-11.5.0.dylib 0x000000010001ec51 _ZN6exodus11MVExceptionC2ERKNS_3varE + 129\nBacktrace 2: 0x10001f314\n2 libexodus-11.5.0.dylib 0x000000010001f314 _ZN6exodus12MVUnassignedC2ERKNS_3varE + 52\nBacktrace 3: 0x10000e193\n3 libexodus-11.5.0.dylib 0x000000010000e193 _ZNK6exodus3var3putERSo + 243\nBacktrace 4: 0x10000e322\n4 libexodus-11.5.0.dylib 0x000000010000e322 _ZNK6exodus3var7outputlEv + 34\nBacktrace 5: 0x10000143f\n5 steve 0x000000010000143f _ZN13ExodusProgram4mainEv + 77\nBacktrace 6: 0x1000010e6\n6 steve 0x00000001000010e6 main + 99\nBacktrace 7: 0x100000f64\n7 steve 0x0000000100000f64 start + 52\n*\/\n\n\t\/\/TODO autodetect if addr2line or dwalfdump\/dSYM is available\n\n\n\n#ifdef __APPLE__\n\tint size = ::backtrace(addresses, BACKTRACE_MAXADDRESSES);\n\tchar **strings = backtrace_symbols(addresses, size);\n\/\/printf(\"Stack frames: %d\\n\", size);\n\n\tvar returnlines=\"\";\n\n\tfor(int i = 0; i < size; i++) {\n\n#ifdef TRACING\n\t\t\/\/each string is like:\n\t\t\/\/6 steve 0x00000001000010e6 main + 99\n\t\t\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\t\tprintf(\"%s\\n\", strings[i]);\n#endif\n\t\t\/\/parse one string for object filename and offset\n\t\tvar onestring=var(strings[i]).trim();\n\t\tvar objectfilename=onestring.field(L\" \",2);\n\t\tvar objectoffset=onestring.field(L\" \",3);\n\n\t\t\/\/looking for a dwarfdump line like this:\n\t\t\/\/Line table file: 'steve.cpp' line 14, column 0 with start address 0x000000010000109e\n\t\t\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n\t\t\/\/get a dwarfdump line containing source filename and line number\n\t\tvar debugfilename=objectfilename^\".dSYM\";\n\t\tvar cmd=L\"dwarfdump \"^debugfilename^L\" --lookup \"^objectoffset^L\" |grep \\\"Line table file: \\\" 2> \/dev\/null\";\n\t\tvar result=cmd.osshellread();\n#ifdef TRACING\n\tcmd.outputl(\"CMD=\");\n\tresult.outputl(\"RESULT=\");\n#endif\n\t\tif (not result)\n\t\t\tcontinue;\n\n\t\t\/\/parse the dwarfdump line for source filename and line number\n\t\tvar sourcefilename=result.field(\"'\",2);\n\t\tvar lineno=result.field(\"'\",3).trim().field(\" \",2).field(\",\",1);\n\n\t\taddbacktraceline(sourcefilename,lineno,returnlines);\n\n\t}\n\n\tfree(strings);\n\treturn returnlines.substr(2);\n\n\n\n\/\/not __APPLE_\n#else\n\n\tint size = ::backtrace(addresses, BACKTRACE_MAXADDRESSES);\n#ifdef TRACING\n\tchar **strings = backtrace_symbols(addresses, size);\n\tprintf(\"Stack frames: %d\\n\", size);\n#endif\n\n\tfor(int i = 0; i < size; i++)\n\t{\n\t\t\/\/#pragma warning (disable: 4311)\n\t\tinternaladdresses^=\" \" ^ var((long long) addresses[i]).oconv(\"MX\");\n\n#ifdef TRACING\n\t\tif (sizeof addresses[i] == 4)\n\t\t\tprintf(\"Backtrace %d: %X\\n\", i, (unsigned int)(long long)addresses[i]);\n\t\telse\n\t\t\tprintf(\"Backtrace %d: %#llx\\n\", i, (long long)addresses[i]);\n\t\tprintf(\"%s\\n\", strings[i]);\n#endif\n\n\t}\n\n#ifdef TRACING\n\tfree(strings);\n#endif\n\n\tFILE *fp;\n\t\/\/int status;\n\tchar path[1024];\n\n\tvar binaryfilename=EXECPATH2.field(\" \",1);\n\t\/\/if (binaryfilename == binaryfilename.convert(\"\/\\\\:\",\"\"))\n\tif (not binaryfilename.osdir())\n\t{\n\t\tvar temp=\"which \" ^ binaryfilename.field2(SLASH,-1);\n\t\ttemp=temp.osshellread().field(\"\\n\",1).field(\"\\r\",1);\n\t\tif (temp)\n\t\t\tbinaryfilename=temp;\n\t}\n#ifdef __APPLE__\n\tvar oscmd=\"atos -o \" ^ binaryfilename.quote() ^ \" \" ^ internaladdresses;\n#else\n\tvar oscmd=\"addr2line -e \" ^ binaryfilename.quote() ^ \" \" ^ internaladdresses;\n#endif\n\t\/\/oscmd.outputl();\n\n#ifdef TRACING\n\tprintf(\"EXECPATH = %s\\n\",EXECPATH2.toString().c_str());\n\tprintf(\"executing %s\\n\",oscmd.toString().c_str());\n#endif\n\n\t\/* Open the command for reading. *\/\n\tfp = popen(oscmd.toString().c_str(), \"r\");\n\tif (fp == NULL)\n\t{\n\t\tprintf(\"Failed to run command\\n\" );\n\t\treturn L\"\";\n\t}\n\n#ifdef TRACING\n\tprintf(\"reading output of addr2line\\n\");\n#endif\n\n\tvar returnlines=\"\";\n\n\t\/* Read the output a line at a time - output it. *\/\n\twhile (fgets(path, sizeof(path)-1, fp) != NULL)\n\t{\n\n#ifdef TRACING\n\t\tprintf(\"fgets:%s\", path);\n#endif\n\n\t\tvar path2=var(path).convert(\"\\x0d\\x0a\",\"\");\/\/.outputl(\"path=\");\n\t\tvar sourcefilename=path2.field(\":\",1);\/\/.outputl(\"filename=\");\n\t\tvar lineno=path2.field(\":\",2);\/\/.outputl(\"lineno=\");\n\n\t\taddbacktraceline(sourcefilename,lineno,returnlines);\n\t}\n\n\t\/* close *\/\n\tpclose(fp);\n\t\n\treturn returnlines.substr(2);\n#endif\n\n#endif\n\t\n}\n\nvoid SIGINT_handler (int sig)\n{\n\t\/\/ignore more of this signal\n\t\/\/var().breakoff()\n\t\/\/faster\/safer\n\tsignal(sig, SIG_IGN);\n\n\t\/\/duplicated in init and B\n\tbacktrace().convert(FM,\"\\n\").outputl();\n\n\tfor (;;)\n\t{\n\n\t\tprintf (\"\\nInterrupted. (C)ontinue (E)nd (B)acktrace\\n\");\n\n\t\toutput(\"? \");\n\t\tvar cmd;\n\t\tif (! cmd.input())\n\t\tcontinue;\n\t\tvar cmd1=cmd[1].ucase();\n\n\t\tif (cmd1 == \"C\")\n\t\t\tbreak;\n\n\t\telse if (cmd1==\"E\")\n\n\t\t\tvar().abort(\"Aborted. User interrupt\");\n\n\t\telse if (cmd1==\"B\")\n\n\t\t\t\/\/duplicated in init and B\n\t\t\tbacktrace().convert(FM,\"\\n\").outputl();\n\n\t}\n\n\t\/\/stop ignoreing this signal\n\t\/\/var().breakon()\n\t\/\/faster\/safer\n\tsignal(SIGINT, SIGINT_handler);\n}\n\nvoid var::breakoff() const\n{\n\t\/\/ignore more of this signal\n\tsignal(SIGINT, SIG_IGN);\n}\n\nvoid var::breakon() const\n{\n\tsignal(SIGINT, SIGINT_handler); \/* this line will redirect ctrl+c signal*\/\n}\n\n}\/\/namespace exodus\n<|endoftext|>"} {"text":"<commit_before>\/*\n * Copyright (c) 2012, Willow Garage, Inc.\n * All rights reserved.\n *\n * Redistribution and use in source and binary forms, with or without\n * modification, are permitted provided that the following conditions are met:\n *\n * * Redistributions of source code must retain the above copyright\n * notice, this list of conditions and the following disclaimer.\n * * Redistributions in binary form must reproduce the above copyright\n * notice, this list of conditions and the following disclaimer in the\n * documentation and\/or other materials provided with the distribution.\n * * Neither the name of the Willow Garage, Inc. nor the names of its\n * contributors may be used to endorse or promote products derived from\n * this software without specific prior written permission.\n *\n * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS \"AS IS\"\n * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE\n * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE\n * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE\n * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR\n * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF\n * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS\n * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN\n * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)\n * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE\n * POSSIBILITY OF SUCH DAMAGE.\n *\/\n\n#include <QEvent>\n#include <QMouseEvent>\n#include <QPaintEvent>\n#include <QPainter>\n#include <QTreeView>\n\n#include \"rviz\/properties\/splitter_handle.h\"\n\nnamespace rviz\n{\n\nSplitterHandle::SplitterHandle( QTreeView* parent )\n : QWidget( parent )\n , parent_( parent )\n , first_column_size_ratio_( 0.5f )\n , color_( 128, 128, 128, 64 )\n{\n setCursor( Qt::SplitHCursor );\n int w = 7;\n setGeometry( parent_->width() \/ 2 - w\/2, 0, w, parent_->height() );\n parent_->installEventFilter( this );\n}\n\nbool SplitterHandle::eventFilter( QObject* event_target, QEvent* event )\n{\n if( event_target == parent_ && event->type() == QEvent::Resize )\n {\n updateGeometry();\n }\n return false; \/\/ Return false regardless so resize event also does its normal job.\n}\n\nvoid SplitterHandle::updateGeometry()\n{\n int content_width = parent_->contentsRect().width();\n int new_column_width = int( first_column_size_ratio_ * content_width );\n parent_->setColumnWidth( 0, new_column_width );\n parent_->setColumnWidth( 1, content_width - new_column_width );\n setGeometry( new_column_width - width() \/ 2, 0, width(), parent_->height() );\n}\n\nvoid SplitterHandle::setRatio( float ratio )\n{\n first_column_size_ratio_ = ratio;\n updateGeometry();\n}\n\nfloat SplitterHandle::getRatio()\n{\n return first_column_size_ratio_;\n}\n\nvoid SplitterHandle::mousePressEvent( QMouseEvent* event )\n{\n if( event->button() == Qt::LeftButton )\n {\n x_press_offset_ = event->x();\n }\n}\n\nvoid SplitterHandle::mouseMoveEvent( QMouseEvent* event )\n{\n int padding = 55;\n\n if( event->buttons() & Qt::LeftButton )\n {\n QPoint pos_rel_parent = parent_->mapFromGlobal( event->globalPos() );\n\n int new_x = pos_rel_parent.x() - x_press_offset_;\n\n if( new_x > parent_->width() - width() - padding )\n {\n new_x = parent_->width() - width() - padding;\n }\n\n if( new_x < padding )\n {\n new_x = padding;\n }\n\n if( new_x != x() )\n {\n int new_column_width = new_x + width() \/ 2 - parent_->contentsRect().x();\n first_column_size_ratio_ = new_column_width \/ (float) parent_->contentsRect().width();\n updateGeometry();\n }\n }\n}\n\nvoid SplitterHandle::paintEvent( QPaintEvent* event )\n{\n QPainter painter( this );\n painter.setPen( color_ );\n painter.drawLine( width() \/ 2, 0, width() \/ 2, height() );\n}\n\n} \/\/ end namespace rviz\n<commit_msg>fixed update of SplitterHandle<commit_after>\/*\n * Copyright (c) 2012, Willow Garage, Inc.\n * All rights reserved.\n *\n * Redistribution and use in source and binary forms, with or without\n * modification, are permitted provided that the following conditions are met:\n *\n * * Redistributions of source code must retain the above copyright\n * notice, this list of conditions and the following disclaimer.\n * * Redistributions in binary form must reproduce the above copyright\n * notice, this list of conditions and the following disclaimer in the\n * documentation and\/or other materials provided with the distribution.\n * * Neither the name of the Willow Garage, Inc. nor the names of its\n * contributors may be used to endorse or promote products derived from\n * this software without specific prior written permission.\n *\n * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS \"AS IS\"\n * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE\n * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE\n * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE\n * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR\n * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF\n * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS\n * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN\n * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)\n * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE\n * POSSIBILITY OF SUCH DAMAGE.\n *\/\n\n#include <QEvent>\n#include <QMouseEvent>\n#include <QPaintEvent>\n#include <QPainter>\n#include <QTreeView>\n\n#include \"rviz\/properties\/splitter_handle.h\"\n\nnamespace rviz\n{\n\nSplitterHandle::SplitterHandle( QTreeView* parent )\n : QWidget( parent )\n , parent_( parent )\n , first_column_size_ratio_( 0.5f )\n , color_( 128, 128, 128, 64 )\n{\n setCursor( Qt::SplitHCursor );\n updateGeometry();\n parent_->installEventFilter( this );\n}\n\nbool SplitterHandle::eventFilter( QObject* event_target, QEvent* event )\n{\n if( event_target == parent_ && event->type() == QEvent::UpdateRequest )\n {\n updateGeometry();\n }\n return false; \/\/ Return false regardless so resize event also does its normal job.\n}\n\nvoid SplitterHandle::updateGeometry()\n{\n int w = 7;\n int content_width = parent_->contentsRect().width();\n int new_column_width = int( first_column_size_ratio_ * content_width );\n parent_->setColumnWidth( 0, new_column_width );\n parent_->setColumnWidth( 1, content_width - new_column_width );\n setGeometry( new_column_width - w \/ 2 + parent_->columnViewportPosition(0), 0, w, parent_->height() );\n}\n\nvoid SplitterHandle::setRatio( float ratio )\n{\n first_column_size_ratio_ = ratio;\n updateGeometry();\n}\n\nfloat SplitterHandle::getRatio()\n{\n return first_column_size_ratio_;\n}\n\nvoid SplitterHandle::mousePressEvent( QMouseEvent* event )\n{\n if( event->button() == Qt::LeftButton )\n {\n \/\/ position of mouse press inside this QWidget\n x_press_offset_ = event->x();\n }\n}\n\nvoid SplitterHandle::mouseMoveEvent( QMouseEvent* event )\n{\n int padding = 55;\n\n if( event->buttons() & Qt::LeftButton )\n {\n QPoint pos_rel_parent = parent_->mapFromGlobal( event->globalPos() );\n\n int new_x = pos_rel_parent.x() - x_press_offset_ - parent_->columnViewportPosition(0);\n\n if( new_x > parent_->width() - width() - padding )\n {\n new_x = parent_->width() - width() - padding;\n }\n\n if( new_x < padding )\n {\n new_x = padding;\n }\n\n if( new_x != x() )\n {\n int new_column_width = new_x + width() \/ 2 - parent_->contentsRect().x();\n first_column_size_ratio_ = new_column_width \/ (float) parent_->contentsRect().width();\n updateGeometry();\n }\n }\n}\n\nvoid SplitterHandle::paintEvent( QPaintEvent* event )\n{\n QPainter painter( this );\n painter.setPen( color_ );\n painter.drawLine( 1+width() \/ 2, 0, 1+width() \/ 2, height() );\n}\n\n} \/\/ end namespace rviz\n<|endoftext|>"} {"text":"<commit_before>\/******************************************************************************\n\n Ȩ (C), 2001-2011, IOT CopyRight\n\n ******************************************************************************\n : Server.cc\n : \n : ChenZhen\n : 2017217\n ޸ :\n : \n б :\n ޸ʷ :\n 1. : 2017217\n : ChenZhen\n ޸ : ļ\n\n******************************************************************************\/\n\n\/*----------------------------------------------*\n * ͷļ *\n *----------------------------------------------*\/\n#include <iostream>\n#include <unistd.h>\n\n#include \"Server.h\"\n\n\n\/*****************************************************************************\n : Server.Server\n : 캯\n : \n : \n ֵ : \n ú : \n : \n \n ޸ʷ :\n 1. : 2017217\n : ChenZhen\n ޸ : ɺ\n\n*****************************************************************************\/\nServer::Server()\n{\n this->m_InnerHandleThread = NULL;\n this->m_OuterHandleThread = NULL;\n this->m_OuterTimerThread = NULL;\n this->m_tag = 0;\n}\n\n\/*****************************************************************************\n : Server.~Server\n : \n : \n : \n ֵ : \n ú : \n : \n \n ޸ʷ :\n 1. : 2017217\n : ChenZhen\n ޸ : ɺ\n\n*****************************************************************************\/\nServer::~Server()\n{\n \n}\n\n\/*****************************************************************************\n : Server.GetTag\n : ȡTAG\n : \n : \n ֵ : int\n ú : \n : \n \n ޸ʷ :\n 1. : 2017217\n : ChenZhen\n ޸ : ɺ\n\n*****************************************************************************\/\nint Server::GetTag()\n{\n return this->m_tag;\n}\n\n\/*****************************************************************************\n : Server.Init\n : ʼ\n : \n : \n ֵ : int\n ú : \n : \n \n ޸ʷ :\n 1. : 2017217\n : ChenZhen\n ޸ : ɺ\n\n*****************************************************************************\/\nint Server::Init(string configPath)\n{\n m_configPath = configPath;\n \n return 0;\n}\n\n\/*****************************************************************************\n : Server.Run\n : з\n : \n : \n ֵ : int\n ú : \n : \n \n ޸ʷ :\n 1. : 2017217\n : ChenZhen\n ޸ : ɺ\n\n*****************************************************************************\/\nint Server::Run()\n{\n \/* Handle *\/\n this->m_OuterHandleThread = new OuterHandleThread(this);\n this->m_InnerHandleThread = new InnerHandleThread(this);\n this->m_OuterTimerThread = new OuterTimerThread(this);\n \n while(1)\n {\n \/\/sleep(1);\n }\n \n return 0;\n}\n\n<commit_msg>SV-19: modify some files for compile<commit_after>\/******************************************************************************\n\n Ȩ (C), 2001-2011, IOT CopyRight\n\n ******************************************************************************\n : Server.cc\n : \n : ChenZhen\n : 2017217\n ޸ :\n : \n б :\n ޸ʷ :\n 1. : 2017217\n : ChenZhen\n ޸ : ļ\n\n******************************************************************************\/\n\n\/*----------------------------------------------*\n * ͷļ *\n *----------------------------------------------*\/\n#include <iostream>\n#include <unistd.h>\n\n#include \"Server.h\"\n\n\n\/*****************************************************************************\n : Server.Server\n : 캯\n : \n : \n ֵ : \n ú : \n : \n \n ޸ʷ :\n 1. : 2017217\n : ChenZhen\n ޸ : ɺ\n\n*****************************************************************************\/\nServer::Server()\n{\n this->m_InnerHandleThread = NULL;\n this->m_OuterHandleThread = NULL;\n this->m_OuterTimerThread = NULL;\n this->m_tag = 0;\n}\n\n\/*****************************************************************************\n : Server.~Server\n : \n : \n : \n ֵ : \n ú : \n : \n \n ޸ʷ :\n 1. : 2017217\n : ChenZhen\n ޸ : ɺ\n\n*****************************************************************************\/\nServer::~Server()\n{\n \n}\n\n\/*****************************************************************************\n : Server.GetTag\n : ȡTAG\n : \n : \n ֵ : int\n ú : \n : \n \n ޸ʷ :\n 1. : 2017217\n : ChenZhen\n ޸ : ɺ\n\n*****************************************************************************\/\nint Server::GetTag()\n{\n return this->m_tag;\n}\n\n\/*****************************************************************************\n : Server.Init\n : ʼ\n : \n : \n ֵ : int\n ú : \n : \n \n ޸ʷ :\n 1. : 2017217\n : ChenZhen\n ޸ : ɺ\n\n*****************************************************************************\/\nint Server::Init(string configPath)\n{\n m_configPath = configPath;\n \n return 0;\n}\n\n\/*****************************************************************************\n : Server.Run\n : з\n : \n : \n ֵ : int\n ú : \n : \n \n ޸ʷ :\n 1. : 2017217\n : ChenZhen\n ޸ : ɺ\n\n*****************************************************************************\/\nint Server::Run()\n{\n \/* Handle *\/\n \/\/this->m_OuterHandleThread = new OuterHandleThread(this);\n \/\/this->m_InnerHandleThread = new InnerHandleThread(this);\n \/\/this->m_OuterTimerThread = new OuterTimerThread(this);\n \n while(1)\n {\n \/\/sleep(1);\n }\n \n return 0;\n}\n\n<|endoftext|>"} {"text":"<commit_before>#include \"NL_InputProcessor.h\"\n#include \"NL_InputEvents.h\"\n\n#include <assert.h>\n\nnamespace NLE\n{\n\tInputProcessor::InputProcessor() :\n\t\t_initialized(false)\n\t{\n\n\t}\n\n\tInputProcessor::~InputProcessor()\n\t{\n\n\t}\n\n\tbool InputProcessor::initialize(Core::IEngine& engine)\n\t{\n\n\t\t_procedure = [&](){\n\t\t};\n\n\t\t_initialized = true;\n\t\treturn _initialized;\n\t}\n\n\tvoid InputProcessor::release()\n\t{\n\n\t}\n\n\tbool InputProcessor::initialized()\n\t{\n\t\treturn _initialized;\n\t}\n\n\tstd::function<void()> const& InputProcessor::getExecutionProcedure()\n\t{\n\t\treturn _procedure;\n\t}\n\n\tCore::ISystem& InputProcessor::getInterface()\n\t{\n\t\treturn *this;\n\t}\n\n\tvoid InputProcessor::attachEventPollingOperation(std::function<void()> operation)\n\t{\n\t}\n\n\tvoid InputProcessor::processEvent(INPUT::Event& event)\n\t{\n\t}\n}\n\n<commit_msg>added InputProcessor<commit_after>#include \"NL_InputProcessor.h\"\n#include \"NL_InputEvents.h\"\n\n#include <assert.h>\n\nnamespace NLE\n{\n\tInputProcessor::InputProcessor() :\n\t\t_initialized(false)\n\t{\n\n\t}\n\n\tInputProcessor::~InputProcessor()\n\t{\n\n\t}\n\n\tbool InputProcessor::initialize(Core::IEngine& engine)\n\t{\n\t\tassert(!_initialized && _eventPoller);\n\n\t\t_procedure = [&](){\n\t\t\t_eventPoller();\n\t\t};\n\n\t\t_initialized = true;\n\t\treturn _initialized;\n\t}\n\n\tvoid InputProcessor::release()\n\t{\n\n\t}\n\n\tbool InputProcessor::initialized()\n\t{\n\t\treturn _initialized;\n\t}\n\n\tstd::function<void()> const& InputProcessor::getExecutionProcedure()\n\t{\n\t\treturn _procedure;\n\t}\n\n\tCore::ISystem& InputProcessor::getInterface()\n\t{\n\t\treturn *this;\n\t}\n\n\tvoid InputProcessor::attachEventPollingOperation(std::function<void()> operation)\n\t{\n\t\t_eventPoller = operation;\n\t}\n\n\tvoid InputProcessor::processEvent(INPUT::Event& event)\n\t{\n\t\tprintf(\"Processing event\\n\");\n\t}\n}\n<|endoftext|>"} {"text":"<commit_before>\/\/ For conditions of distribution and use, see copyright notice in license.txt\r\n\r\n#include \"StableHeaders.h\"\r\n#include \"Foundation.h\"\r\n#include \"Renderer.h\"\r\n#include \"OgreRenderingModule.h\"\r\n\r\n#include \"Ogre.h\"\r\n\r\nusing namespace Foundation;\r\n\r\nnamespace OgreRenderer\r\n{\r\n class EventListener : public Ogre::WindowEventListener\r\n {\r\n public:\r\n EventListener(Renderer* renderer) :\r\n renderer_(renderer)\r\n {\r\n }\r\n\r\n ~EventListener() \r\n {\r\n }\r\n \r\n void windowResized(Ogre::RenderWindow* rw)\r\n {\r\n if ((renderer_->camera_) && (rw == renderer_->renderwindow_))\r\n renderer_->camera_->setAspectRatio(Ogre::Real(rw->getWidth() \/ Ogre::Real(rw->getHeight())));\r\n }\r\n \r\n void windowClosed(Ogre::RenderWindow* rw)\r\n {\r\n if (rw == renderer_->renderwindow_)\r\n renderer_->framework_->Exit();\r\n }\r\n \r\n private:\r\n Renderer* renderer_;\r\n };\r\n\r\n Renderer::Renderer(Framework* framework) :\r\n initialized_(false),\r\n framework_(framework),\r\n scenemanager_(0),\r\n camera_(0),\r\n renderwindow_(0),\r\n listener_(EventListenerPtr(new EventListener(this)))\r\n {\r\n event_category_ = framework_->GetEventManager()->RegisterEventCategory(\"Renderer\");\r\n }\r\n \r\n Renderer::~Renderer()\r\n {\r\n if (initialized_)\r\n Ogre::WindowEventUtilities::removeWindowEventListener(renderwindow_, listener_.get());\r\n\r\n root_.reset();\r\n }\r\n \r\n void Renderer::Initialize()\r\n {\r\n if (initialized_)\r\n return;\r\n \r\n#ifdef _DEBUG\r\n std::string plugins_filename = \"pluginsd.cfg\";\r\n#else\r\n std::string plugins_filename = \"plugins.cfg\";\r\n#endif\r\n \r\n std::string logfilepath = framework_->GetPlatform()->GetUserDocumentsDirectory();\r\n logfilepath += \"\/Ogre.log\";\r\n\r\n root_ = OgreRootPtr(new Ogre::Root(\"\", \"ogre.cfg\", logfilepath));\r\n LoadPlugins(plugins_filename);\r\n \r\n#ifdef _WINDOWS\r\n std::string rendersystem_name = framework_->GetDefaultConfig().DeclareSetting(\"OgreRenderer\", \"RenderSystem\", \"Direct3D9 Rendering Subsystem\");\r\n#else\r\n std::string rendersystem_name = \"OpenGL Rendering Subsystem\";\r\n framework_->GetDefaultConfig().DeclareSetting(\"OgreRenderer\", \"RenderSystem\", rendersystem_name);\r\n#endif\r\n int width = framework_->GetDefaultConfig().DeclareSetting(\"OgreRenderer\", \"WindowWidth\", 800);\r\n int height = framework_->GetDefaultConfig().DeclareSetting(\"OgreRenderer\", \"WindowHeight\", 600);\r\n bool fullscreen = framework_->GetDefaultConfig().DeclareSetting(\"OgreRenderer\", \"Fullscreen\", false);\r\n \r\n Ogre::RenderSystem* rendersystem = root_->getRenderSystemByName(rendersystem_name);\r\n \r\n if (!rendersystem)\r\n {\r\n throw Core::Exception(\"Could not find Ogre rendersystem.\");\r\n }\r\n\r\n \/\/ GTK's pango\/cairo\/whatever's font rendering doesn't work if the floating point mode is not set to strict.\r\n \/\/ This however creates undefined behavior for D3D (refrast + D3DX), but we aren't using those anyway.\r\n rendersystem->setConfigOption(\"Floating-point mode\", \"Consistent\");\r\n \r\n root_->setRenderSystem(rendersystem);\r\n root_->initialise(false);\r\n\r\n Ogre::NameValuePairList params;\r\n std::string application_name = framework_->GetDefaultConfig().GetString(Foundation::Framework::ConfigurationGroup(), \"application_name\");\r\n\r\n try\r\n {\r\n renderwindow_ = root_->createRenderWindow(application_name, width, height, fullscreen, ¶ms);\r\n }\r\n catch (Ogre::Exception e) {}\r\n \r\n if (!renderwindow_)\r\n {\r\n throw Core::Exception(\"Could not create Ogre rendering window\");\r\n }\r\n\r\n SetupResources();\r\n SetupScene();\r\n \r\n Ogre::WindowEventUtilities::addWindowEventListener(renderwindow_, listener_.get());\r\n \r\n initialized_ = true;\r\n }\r\n\r\n void Renderer::LoadPlugins(const std::string& plugin_filename)\r\n {\r\n Ogre::ConfigFile file;\r\n try\r\n {\r\n file.load(plugin_filename);\r\n }\r\n catch (Ogre::Exception e)\r\n {\r\n OgreRenderingModule::LogError(\"Could not load Ogre plugins configuration file\");\r\n return;\r\n }\r\n\r\n Ogre::String plugin_dir = file.getSetting(\"PluginFolder\");\r\n Ogre::StringVector plugins = file.getMultiSetting(\"Plugin\");\r\n \r\n if (plugin_dir.length())\r\n {\r\n if ((plugin_dir[plugin_dir.length() - 1] != '\\\\') && (plugin_dir[plugin_dir.length() - 1] != '\/'))\r\n {\r\n#ifdef _WINDOWS\r\n plugin_dir += \"\\\\\";\r\n#else\r\n plugin_dir += \"\/\";\r\n#endif\r\n }\r\n }\r\n \r\n for (unsigned i = 0; i < plugins.size(); ++i)\r\n {\r\n try\r\n {\r\n root_->loadPlugin(plugin_dir + plugins[i]);\r\n }\r\n catch (Ogre::Exception e)\r\n {\r\n OgreRenderingModule::LogError(\"Plugin \" + plugins[i] + \" failed to load\");\r\n }\r\n }\r\n }\r\n \r\n void Renderer::SetupResources()\r\n {\r\n Ogre::ConfigFile cf;\r\n cf.load(\"resources.cfg\");\r\n\r\n Ogre::ConfigFile::SectionIterator seci = cf.getSectionIterator();\r\n Ogre::String sec_name, type_name, arch_name;\r\n \r\n while(seci.hasMoreElements())\r\n {\r\n sec_name = seci.peekNextKey();\r\n Ogre::ConfigFile::SettingsMultiMap* settings = seci.getNext();\r\n Ogre::ConfigFile::SettingsMultiMap::iterator i;\r\n for(i = settings->begin(); i != settings->end(); ++i)\r\n {\r\n type_name = i->first;\r\n arch_name = i->second;\r\n Ogre::ResourceGroupManager::getSingleton().addResourceLocation(arch_name, type_name, sec_name);\r\n }\r\n }\r\n \r\n Ogre::ResourceGroupManager::getSingleton().initialiseAllResourceGroups();\r\n }\r\n \r\n void Renderer::SetupScene()\r\n {\r\n scenemanager_ = root_->createSceneManager(Ogre::ST_GENERIC, \"SceneManager\");\r\n camera_ = scenemanager_->createCamera(\"Camera\");\r\n Ogre::Viewport* viewport = renderwindow_->addViewport(camera_);\r\n camera_->setAspectRatio(Ogre::Real(viewport->getActualWidth()) \/ Ogre::Real(viewport->getActualHeight()));\r\n }\r\n \r\n void Renderer::Update()\r\n {\r\n if (!initialized_) return;\r\n \r\n Ogre::WindowEventUtilities::messagePump();\r\n \r\n root_->_fireFrameStarted();\r\n \r\n \/\/ Render without swapping buffers first\n Ogre::RenderSystem* renderer = root_->getRenderSystem();\n renderer->_updateAllRenderTargets(false);\r\n \/\/ Send postrender event, so that custom rendering may be added\r\n framework_->GetEventManager()->SendEvent(event_category_, event_postrender, NULL);\r\n \/\/ Swap buffers now\n renderer->_swapAllRenderTargetBuffers(renderer->getWaitForVerticalBlank());\r\n\r\n root_->_fireFrameEnded();\r\n }\r\n}\r\n\r\n<commit_msg>Floating-point mode config option only set if it exists.<commit_after>\/\/ For conditions of distribution and use, see copyright notice in license.txt\r\n\r\n#include \"StableHeaders.h\"\r\n#include \"Foundation.h\"\r\n#include \"Renderer.h\"\r\n#include \"OgreRenderingModule.h\"\r\n\r\n#include \"Ogre.h\"\r\n\r\nusing namespace Foundation;\r\n\r\nnamespace OgreRenderer\r\n{\r\n class EventListener : public Ogre::WindowEventListener\r\n {\r\n public:\r\n EventListener(Renderer* renderer) :\r\n renderer_(renderer)\r\n {\r\n }\r\n\r\n ~EventListener() \r\n {\r\n }\r\n \r\n void windowResized(Ogre::RenderWindow* rw)\r\n {\r\n if ((renderer_->camera_) && (rw == renderer_->renderwindow_))\r\n renderer_->camera_->setAspectRatio(Ogre::Real(rw->getWidth() \/ Ogre::Real(rw->getHeight())));\r\n }\r\n \r\n void windowClosed(Ogre::RenderWindow* rw)\r\n {\r\n if (rw == renderer_->renderwindow_)\r\n renderer_->framework_->Exit();\r\n }\r\n \r\n private:\r\n Renderer* renderer_;\r\n };\r\n\r\n Renderer::Renderer(Framework* framework) :\r\n initialized_(false),\r\n framework_(framework),\r\n scenemanager_(0),\r\n camera_(0),\r\n renderwindow_(0),\r\n listener_(EventListenerPtr(new EventListener(this)))\r\n {\r\n event_category_ = framework_->GetEventManager()->RegisterEventCategory(\"Renderer\");\r\n }\r\n \r\n Renderer::~Renderer()\r\n {\r\n if (initialized_)\r\n Ogre::WindowEventUtilities::removeWindowEventListener(renderwindow_, listener_.get());\r\n\r\n root_.reset();\r\n }\r\n \r\n void Renderer::Initialize()\r\n {\r\n if (initialized_)\r\n return;\r\n \r\n#ifdef _DEBUG\r\n std::string plugins_filename = \"pluginsd.cfg\";\r\n#else\r\n std::string plugins_filename = \"plugins.cfg\";\r\n#endif\r\n \r\n std::string logfilepath = framework_->GetPlatform()->GetUserDocumentsDirectory();\r\n logfilepath += \"\/Ogre.log\";\r\n\r\n root_ = OgreRootPtr(new Ogre::Root(\"\", \"ogre.cfg\", logfilepath));\r\n LoadPlugins(plugins_filename);\r\n \r\n#ifdef _WINDOWS\r\n std::string rendersystem_name = framework_->GetDefaultConfig().DeclareSetting(\"OgreRenderer\", \"RenderSystem\", \"Direct3D9 Rendering Subsystem\");\r\n#else\r\n std::string rendersystem_name = \"OpenGL Rendering Subsystem\";\r\n framework_->GetDefaultConfig().DeclareSetting(\"OgreRenderer\", \"RenderSystem\", rendersystem_name);\r\n#endif\r\n int width = framework_->GetDefaultConfig().DeclareSetting(\"OgreRenderer\", \"WindowWidth\", 800);\r\n int height = framework_->GetDefaultConfig().DeclareSetting(\"OgreRenderer\", \"WindowHeight\", 600);\r\n bool fullscreen = framework_->GetDefaultConfig().DeclareSetting(\"OgreRenderer\", \"Fullscreen\", false);\r\n \r\n Ogre::RenderSystem* rendersystem = root_->getRenderSystemByName(rendersystem_name);\r\n \r\n if (!rendersystem)\r\n {\r\n throw Core::Exception(\"Could not find Ogre rendersystem.\");\r\n }\r\n\r\n \/\/ GTK's pango\/cairo\/whatever's font rendering doesn't work if the floating point mode is not set to strict.\r\n \/\/ This however creates undefined behavior for D3D (refrast + D3DX), but we aren't using those anyway.\r\n Ogre::ConfigOptionMap& map = rendersystem->getConfigOptions();\r\n if (map.find(\"Floating-point mode\") != map.end())\r\n rendersystem->setConfigOption(\"Floating-point mode\", \"Consistent\");\r\n \r\n root_->setRenderSystem(rendersystem);\r\n root_->initialise(false);\r\n\r\n Ogre::NameValuePairList params;\r\n std::string application_name = framework_->GetDefaultConfig().GetString(Foundation::Framework::ConfigurationGroup(), \"application_name\");\r\n\r\n try\r\n {\r\n renderwindow_ = root_->createRenderWindow(application_name, width, height, fullscreen, ¶ms);\r\n }\r\n catch (Ogre::Exception e) {}\r\n \r\n if (!renderwindow_)\r\n {\r\n throw Core::Exception(\"Could not create Ogre rendering window\");\r\n }\r\n\r\n SetupResources();\r\n SetupScene();\r\n \r\n Ogre::WindowEventUtilities::addWindowEventListener(renderwindow_, listener_.get());\r\n \r\n initialized_ = true;\r\n }\r\n\r\n void Renderer::LoadPlugins(const std::string& plugin_filename)\r\n {\r\n Ogre::ConfigFile file;\r\n try\r\n {\r\n file.load(plugin_filename);\r\n }\r\n catch (Ogre::Exception e)\r\n {\r\n OgreRenderingModule::LogError(\"Could not load Ogre plugins configuration file\");\r\n return;\r\n }\r\n\r\n Ogre::String plugin_dir = file.getSetting(\"PluginFolder\");\r\n Ogre::StringVector plugins = file.getMultiSetting(\"Plugin\");\r\n \r\n if (plugin_dir.length())\r\n {\r\n if ((plugin_dir[plugin_dir.length() - 1] != '\\\\') && (plugin_dir[plugin_dir.length() - 1] != '\/'))\r\n {\r\n#ifdef _WINDOWS\r\n plugin_dir += \"\\\\\";\r\n#else\r\n plugin_dir += \"\/\";\r\n#endif\r\n }\r\n }\r\n \r\n for (unsigned i = 0; i < plugins.size(); ++i)\r\n {\r\n try\r\n {\r\n root_->loadPlugin(plugin_dir + plugins[i]);\r\n }\r\n catch (Ogre::Exception e)\r\n {\r\n OgreRenderingModule::LogError(\"Plugin \" + plugins[i] + \" failed to load\");\r\n }\r\n }\r\n }\r\n \r\n void Renderer::SetupResources()\r\n {\r\n Ogre::ConfigFile cf;\r\n cf.load(\"resources.cfg\");\r\n\r\n Ogre::ConfigFile::SectionIterator seci = cf.getSectionIterator();\r\n Ogre::String sec_name, type_name, arch_name;\r\n \r\n while(seci.hasMoreElements())\r\n {\r\n sec_name = seci.peekNextKey();\r\n Ogre::ConfigFile::SettingsMultiMap* settings = seci.getNext();\r\n Ogre::ConfigFile::SettingsMultiMap::iterator i;\r\n for(i = settings->begin(); i != settings->end(); ++i)\r\n {\r\n type_name = i->first;\r\n arch_name = i->second;\r\n Ogre::ResourceGroupManager::getSingleton().addResourceLocation(arch_name, type_name, sec_name);\r\n }\r\n }\r\n \r\n Ogre::ResourceGroupManager::getSingleton().initialiseAllResourceGroups();\r\n }\r\n \r\n void Renderer::SetupScene()\r\n {\r\n scenemanager_ = root_->createSceneManager(Ogre::ST_GENERIC, \"SceneManager\");\r\n camera_ = scenemanager_->createCamera(\"Camera\");\r\n Ogre::Viewport* viewport = renderwindow_->addViewport(camera_);\r\n camera_->setAspectRatio(Ogre::Real(viewport->getActualWidth()) \/ Ogre::Real(viewport->getActualHeight()));\r\n }\r\n \r\n void Renderer::Update()\r\n {\r\n if (!initialized_) return;\r\n \r\n Ogre::WindowEventUtilities::messagePump();\r\n \r\n root_->_fireFrameStarted();\r\n \r\n \/\/ Render without swapping buffers first\n Ogre::RenderSystem* renderer = root_->getRenderSystem();\n renderer->_updateAllRenderTargets(false);\r\n \/\/ Send postrender event, so that custom rendering may be added\r\n framework_->GetEventManager()->SendEvent(event_category_, event_postrender, NULL);\r\n \/\/ Swap buffers now\n renderer->_swapAllRenderTargetBuffers(renderer->getWaitForVerticalBlank());\r\n\r\n root_->_fireFrameEnded();\r\n }\r\n}\r\n\r\n<|endoftext|>"} {"text":"<commit_before>\/* ------------------------------------------------------------------------- *\n* OpenSim: testPath.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): Carmichael Ong *\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 <OpenSim\/Common\/ComponentPath.h>\n#include <OpenSim\/Auxiliary\/auxiliaryTestFunctions.h>\n\n\/* The purpose of this test is strictly to check that classes derived from\n * the Path class work outside of the objects\/components they are meant to \n * service (i.e. check that the path logic works).\n *\/\n\nusing namespace OpenSim;\nusing namespace std;\n\nvoid testComponentPath() {\n \/* Test that creating ComponentPath with paths that should not be cleaned up *\/\n\n using CP = ComponentPath;\n using std::string;\n\n \/\/ Absolute paths\n ASSERT(CP{\"\/a\/b\/c\/d\"}.toString() == \"\/a\/b\/c\/d\");\n ASSERT(CP{\"\/a\/b\/e\/f\/g\/h\"}.toString() == \"\/a\/b\/e\/f\/g\/h\");\n ASSERT(CP{\"\/a\/b\"}.toString() == \"\/a\/b\");\n\n \/\/ Relative paths\n \/\/ note: relative path can start with \"..\"\n ASSERT(CP{\"c\/d\"}.toString() == \"c\/d\");\n ASSERT(CP{\"e\/f\/g\/h\"}.toString() == \"e\/f\/g\/h\");\n ASSERT(CP{\"..\/..\/..\/..\/c\/d\"}.toString() == \"..\/..\/..\/..\/c\/d\");\n\n \/\/ Empty paths\n ASSERT(CP{\"\"}.toString() == \"\");\n ASSERT(CP{\"\/\"}.toString() == \"\/\");\n\n \/* Test the equality operator *\/\n ASSERT(CP{\"\/a\/b\"} == CP{\"\/a\/b\"});\n ASSERT(CP{\"\/a\/b\"} != CP{\"\/a\/b\/c\/d\"});\n ASSERT(CP{\"\/c\/d\"} != CP{\"c\/d\"});\n\n \/\/ test vector ctor\n ASSERT_THROW(Exception, CP(std::vector<std::string>{\"in+valid\"}, true));\n ASSERT_THROW(Exception, CP(std::vector<std::string>{\"in+valid\"}, false));\n ASSERT_THROW(Exception, CP(std::vector<std::string>{\"a\", \"in+valid\"}, true));\n ASSERT_THROW(Exception, CP(std::vector<std::string>{\"b\", \"in+valid\"}, false));\n\n \/* Test formAbsolutePath(). Test a variety of paths. The argument \n * in formAbsolutePath() must be an absolute path itself. *\/\n \/\/ Test without any \"..\"\n ASSERT(CP{\"c\/d\"}.formAbsolutePath(CP{\"\/a\/b\"}).toString() == \"\/a\/b\/c\/d\");\n ASSERT(CP{\"e\/f\/g\/h\"}.formAbsolutePath(CP{\"\/a\/b\"}).toString() == \"\/a\/b\/e\/f\/g\/h\");\n \/\/ Any absolute path should return itself\n ASSERT(CP{\"\/a\/b\/c\/d\"}.formAbsolutePath(CP{\"\/a\/b\/e\/f\/g\/h\"}) == CP{\"\/a\/b\/c\/d\"});\n \/\/ Test if this works from root.\n ASSERT(CP{\"c\/d\"}.formAbsolutePath(CP{\"\/\"}).toString() == \"\/c\/d\");\n \/\/ Test with lots of \"..\"\n ASSERT(CP{\"..\/..\/..\/..\/c\/d\"}.formAbsolutePath(CP{\"\/a\/b\/e\/f\/g\/h\"}) == CP{\"\/a\/b\/c\/d\"});\n \/\/ argument can't be a relative path\n ASSERT_THROW(Exception, CP{\"c\/d\"}.formAbsolutePath(CP{\"e\/f\/g\/h\"}));\n\n \/* Test formRelativePath(). Both paths must be absolute *\/\n \/\/ Test path that go up and back down the tree\n ASSERT(CP{\"\/a\/b\/c\/d\"}.formRelativePath(CP{\"\/a\/b\/e\/f\/g\/h\"}).toString() == \"..\/..\/..\/..\/c\/d\");\n ASSERT(CP{\"\/a\/b\/e\/f\/g\/h\"}.formRelativePath(CP{\"\/a\/b\/c\/d\"}).toString() == \"..\/..\/e\/f\/g\/h\");\n \/\/ Test path that just goes down a tree\n ASSERT(CP{\"\/a\/b\/c\/d\"}.formRelativePath(CP{\"\/a\/b\"}).toString() == \"c\/d\");\n \/\/ Test path that only goes up the tree\n ASSERT(CP{\"\/a\/b\"}.formRelativePath(CP{\"\/a\/b\/e\/f\/g\/h\"}).toString() == \"..\/..\/..\/..\");\n \/\/ Throw exceptions if either or both paths are not absolute\n ASSERT_THROW(Exception, CP{\"c\/d\"}.formRelativePath(CP{\"\/a\/b\/e\/f\/g\/h\"}));\n ASSERT_THROW(Exception, CP{\"\/a\/b\/e\/f\/g\/h\"}.formRelativePath(CP{\"e\/f\/g\/h\"}));\n ASSERT_THROW(Exception, CP{\"e\/f\/g\/h\"}.formRelativePath(CP{\"c\/d\"}));\n\n \/* Test paths with \".\" and \"..\" *\/\n \/\/ Remove all \".\", clean up \"..\" and ignore \"\/\" at the end\n ASSERT(CP{\"\/a\/.\/.\/b\/c\/..\/\/d\/..\/.\/\"}.toString() == CP{\"\/a\/b\"}.toString());\n \/\/ Test \"..\" at the end of a path\n ASSERT(CP{\"\/a\/b\/c\/d\/..\/..\"} == CP{\"\/a\/b\"});\n \/\/ Test \"..\" at the beginning of an absolute path (should throw exception)\n ASSERT_THROW(Exception, CP{\"\/..\/b\/c\/d\"});\n \/\/ Test if there are so many \"..\" that it will end up at the front of\n \/\/ an absolute path, and thus should fail like the one above\n ASSERT_THROW(Exception, CP{\"\/a\/..\/..\/c\/d\"});\n\n \/* Test that invalid characters will throw an exception. This should throw\n * exceptions when \"\\\\\", \"+\", or \"*\" appear in the string that initializes\n * the ComponentPath. Although \"\/\" is also an invalid character, it should\n * NOT throw an exception here since it is read in as a separator. *\/\n ASSERT_THROW(Exception, CP{\"\/a\/b\\\\\/c\/\"});\n ASSERT_THROW(Exception, CP{\"\/a+b+c\/\"});\n ASSERT_THROW(Exception, CP{\"\/abc*\/def\/g\/\"});\n\n \/* Test the pushBack() function *\/\n {\n ComponentPath path1{\"\/a\/b\"};\n \/\/ can't add multiple levels at once\n ASSERT_THROW(Exception, path1.pushBack(\"c\/d\"));\n\n \/\/ add the levels separately\n path1.pushBack(\"c\");\n path1.pushBack(\"d\");\n ASSERT(path1 == CP{\"\/a\/b\/c\/d\"});\n\n \/* Test invalid characters in pushBack(). Unlike the invalid\n * character test above, \"\/\" should be considered invalid since\n * pushBack() cannot add multiple levels at once. It is also\n * invalid to attempt to add an empty pathElement.\n *\/\n ASSERT_THROW(Exception, path1.pushBack(\"a\\\\b\"));\n ASSERT_THROW(Exception, path1.pushBack(\"a+b*\"));\n ASSERT_THROW(Exception, path1.pushBack(\"test\/this\"));\n ASSERT_THROW(Exception, path1.pushBack(\"\"));\n\n CP cp2{\"\"};\n cp2.pushBack(\"a\");\n ASSERT(cp2.toString() == \"a\");\n\n CP cp3{\"\/\"};\n cp3.pushBack(\"a\");\n ASSERT(cp3.toString() == \"\/a\");\n }\n\n \/* Test functions for getting certain parts of ComponentPath. *\/\n \/\/ Create a path \"\/zero\/one\/two\/three\/four\"\n std::vector<std::string> levels = {\"zero\", \"one\", \"two\", \"three\", \"four\"};\n ComponentPath numberedAbsPath(levels, true);\n \/\/ Parent path is \"\/zero\/one\/two\/three\"\n std::string numberedAbsPathParentStr = \"\/zero\/one\/two\/three\";\n ComponentPath numberedAbsPathParent(numberedAbsPathParentStr);\n \/\/ Test if getParentPath() returns correct ComponentPath object\n ASSERT(numberedAbsPath.getParentPath() == numberedAbsPathParent);\n \/\/ Test if getParentPathStr() returns correct string\n ASSERT(numberedAbsPath.getParentPathString() == numberedAbsPathParentStr);\n\n \/\/ test number of path levels behaves sanely\n {\n static const std::pair<std::string, int> expectedNumPathLevels[] = {\n {\"\", 0},\n {\"\/\", 0},\n {\"a\", 1},\n {\"\/a\", 1},\n {\"\/a\/\", 1},\n {\"a\/b\", 2},\n {\"\/a\/b\", 2},\n {\"\/a\/b\/\", 2},\n {\"\/a\/b\/c\", 3},\n {\"..\/\", 1},\n {\"a\/..\", 0},\n {\"\/a\/..\", 0},\n };\n\n for (auto p : expectedNumPathLevels) {\n ASSERT(CP{p.first}.getNumPathLevels() == p.second);\n }\n }\n\n \/\/ Loop through all levels of the subtree and see if names match\n for (size_t ind = 0; ind < levels.size(); ++ind) {\n ASSERT(numberedAbsPath.getSubcomponentNameAtLevel(ind) == levels[ind]);\n }\n \/\/ Test getComponentName()\n ASSERT(numberedAbsPath.getComponentName() == levels[levels.size()-1]);\n ASSERT(CP{\"\"}.getComponentName() == \"\"); \/\/ empty ComponentPath should return empty string\n\n \/\/ Do the same as above but with a relative path instead\n ComponentPath numberedRelPath(levels, false);\n std::string numberedRelPathParentStr = \"zero\/one\/two\/three\";\n ComponentPath numberedRelPathParent(numberedRelPathParentStr);\n ASSERT(numberedRelPath.getParentPath() == numberedRelPathParent);\n ASSERT(numberedRelPath.getParentPathString() == numberedRelPathParentStr);\n for (size_t ind = 0; ind < levels.size(); ++ind) {\n ASSERT(numberedRelPath.getSubcomponentNameAtLevel(ind) == levels[ind]);\n }\n\n \/\/ ensure isAbsolute is sane for vector inputs\n ASSERT(CP{std::vector<std::string>{}, true}.isAbsolute());\n ASSERT(CP{std::vector<std::string>{\"\"}, true}.isAbsolute());\n ASSERT(CP{std::vector<std::string>{\"a\", \"b\"}, true}.isAbsolute());\n\n \/\/ general tests to ensure it normalizes a variety of paths correctly\n {\n static const std::pair<std::string, std::string> shouldPass[] = {\n { \"\", \"\" },\n { \"\/\", \"\/\" },\n { \"a\/b\/c\", \"a\/b\/c\" },\n { \"a\/..\", \"\" },\n { \"a\/..\/\", \"\" },\n { \"a\/..\/c\", \"c\" },\n { \"a\/..\/c\/\", \"c\" },\n { \"\/a\/..\/c\", \"\/c\" },\n { \"\/a\/b\/..\/..\/c\", \"\/c\" },\n { \"a\/b\/..\/..\/c\", \"c\" },\n { \"\/.\/.\/.\/c\", \"\/c\" },\n { \".\/.\/.\/c\", \"c\" },\n { \".\/\", \"\" },\n { \".\", \"\" },\n { \".\/.\", \"\" },\n { \".\/a\/.\", \"a\" },\n { \".\/a\/.\/\", \"a\" },\n { \"a\/\/b\/.\/\/\/\", \"a\/b\" },\n { \"\/\/\/\", \"\/\" },\n { \".\/\/\/\", \"\" },\n { \"a\/\/\/b\", \"a\/b\" },\n { \"a\/b\/c\/\", \"a\/b\/c\" },\n { \"a\/b\/c\/\/\", \"a\/b\/c\" },\n { \"..\/a\/b\", \"..\/a\/b\" },\n { \"..\/a\/b\/\", \"..\/a\/b\" },\n { \".\/..\/a\/..\/\", \"..\" },\n { \"\/a\/b\/c\/d\", \"\/a\/b\/c\/d\" },\n { \"\/a\/b\/e\/f\/g\/h\", \"\/a\/b\/e\/f\/g\/h\" },\n { \"\/a\/b\", \"\/a\/b\" },\n { \"c\/d\", \"c\/d\" },\n { \"e\/f\/g\/h\", \"e\/f\/g\/h\" },\n { \"\/a\/.\/.\/b\/c\/..\/\/d\/..\/.\/\", \"\/a\/b\" },\n { \"..\/..\/..\/..\/c\/d\", \"..\/..\/..\/..\/c\/d\" },\n { \"\/a\/b\/c\/d\/..\/..\", \"\/a\/b\" },\n };\n\n for (const auto& tc : shouldPass) {\n std::cerr << \"input = \" << tc.first << std::endl;\n std::string output = ComponentPath{tc.first}.toString();\n if (output != tc.second) {\n std::stringstream msg;\n msg << \"ComponentPath::resolveRelativeElements: invalid output:\" << std::endl;\n msg << \" input = \" << tc.first << std::endl;\n msg << \" output = \" << output << std::endl;\n msg << \" expected output = \" << tc.second << std::endl;\n throw std::runtime_error{msg.str()};\n }\n }\n\n static const std::string shouldThrow[] = {\n \"a\/..\/..\",\n \".\/a\/..\/..\",\n \"\/..\",\n \"\/.\/..\",\n \"\/a\/..\/..\",\n \"\/.\/..\/\",\n \"\/a\/.\/..\/.\/..\",\n \"\/..\/b\/c\/d\",\n \"\/a\/..\/..\/c\/d\",\n\n \/\/ contain invalid chars\n \"foo\\\\bar\",\n \"a\/foo\\\\bar\/c\",\n \"foo*bar\",\n \"a\/foo*bar*\/c\",\n \"foo+bar\",\n \"a\/foo+bar\",\n \"foo\\tbar\",\n \"a\/b\/c\/foo\\tbar\/d\",\n \"foo\\nbar\",\n \"\/a\/foo\\nbar\",\n };\n\n for (const std::string& tc : shouldThrow) {\n std::string maybeError;\n try {\n std::string p = ComponentPath{tc}.toString();\n std::stringstream msg;\n msg << tc << \": did not throw an exception: instead, it output: \" << p;\n maybeError = msg.str();\n } catch (...) {\n \/\/ good\n }\n if (!maybeError.empty()) {\n throw std::runtime_error{maybeError};\n }\n }\n }\n}\n\nint main()\n{\n SimTK_START_TEST(\"testPath\");\n SimTK_SUBTEST(testComponentPath);\n SimTK_END_TEST();\n\n return 0;\n}\n<commit_msg>Fixed unsigned vs. signed comparison in testPath.cpp<commit_after>\/* ------------------------------------------------------------------------- *\n* OpenSim: testPath.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): Carmichael Ong *\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 <OpenSim\/Common\/ComponentPath.h>\n#include <OpenSim\/Auxiliary\/auxiliaryTestFunctions.h>\n\n\/* The purpose of this test is strictly to check that classes derived from\n * the Path class work outside of the objects\/components they are meant to \n * service (i.e. check that the path logic works).\n *\/\n\nusing namespace OpenSim;\nusing namespace std;\n\nvoid testComponentPath() {\n \/* Test that creating ComponentPath with paths that should not be cleaned up *\/\n\n using CP = ComponentPath;\n using std::string;\n\n \/\/ Absolute paths\n ASSERT(CP{\"\/a\/b\/c\/d\"}.toString() == \"\/a\/b\/c\/d\");\n ASSERT(CP{\"\/a\/b\/e\/f\/g\/h\"}.toString() == \"\/a\/b\/e\/f\/g\/h\");\n ASSERT(CP{\"\/a\/b\"}.toString() == \"\/a\/b\");\n\n \/\/ Relative paths\n \/\/ note: relative path can start with \"..\"\n ASSERT(CP{\"c\/d\"}.toString() == \"c\/d\");\n ASSERT(CP{\"e\/f\/g\/h\"}.toString() == \"e\/f\/g\/h\");\n ASSERT(CP{\"..\/..\/..\/..\/c\/d\"}.toString() == \"..\/..\/..\/..\/c\/d\");\n\n \/\/ Empty paths\n ASSERT(CP{\"\"}.toString() == \"\");\n ASSERT(CP{\"\/\"}.toString() == \"\/\");\n\n \/* Test the equality operator *\/\n ASSERT(CP{\"\/a\/b\"} == CP{\"\/a\/b\"});\n ASSERT(CP{\"\/a\/b\"} != CP{\"\/a\/b\/c\/d\"});\n ASSERT(CP{\"\/c\/d\"} != CP{\"c\/d\"});\n\n \/\/ test vector ctor\n ASSERT_THROW(Exception, CP(std::vector<std::string>{\"in+valid\"}, true));\n ASSERT_THROW(Exception, CP(std::vector<std::string>{\"in+valid\"}, false));\n ASSERT_THROW(Exception, CP(std::vector<std::string>{\"a\", \"in+valid\"}, true));\n ASSERT_THROW(Exception, CP(std::vector<std::string>{\"b\", \"in+valid\"}, false));\n\n \/* Test formAbsolutePath(). Test a variety of paths. The argument \n * in formAbsolutePath() must be an absolute path itself. *\/\n \/\/ Test without any \"..\"\n ASSERT(CP{\"c\/d\"}.formAbsolutePath(CP{\"\/a\/b\"}).toString() == \"\/a\/b\/c\/d\");\n ASSERT(CP{\"e\/f\/g\/h\"}.formAbsolutePath(CP{\"\/a\/b\"}).toString() == \"\/a\/b\/e\/f\/g\/h\");\n \/\/ Any absolute path should return itself\n ASSERT(CP{\"\/a\/b\/c\/d\"}.formAbsolutePath(CP{\"\/a\/b\/e\/f\/g\/h\"}) == CP{\"\/a\/b\/c\/d\"});\n \/\/ Test if this works from root.\n ASSERT(CP{\"c\/d\"}.formAbsolutePath(CP{\"\/\"}).toString() == \"\/c\/d\");\n \/\/ Test with lots of \"..\"\n ASSERT(CP{\"..\/..\/..\/..\/c\/d\"}.formAbsolutePath(CP{\"\/a\/b\/e\/f\/g\/h\"}) == CP{\"\/a\/b\/c\/d\"});\n \/\/ argument can't be a relative path\n ASSERT_THROW(Exception, CP{\"c\/d\"}.formAbsolutePath(CP{\"e\/f\/g\/h\"}));\n\n \/* Test formRelativePath(). Both paths must be absolute *\/\n \/\/ Test path that go up and back down the tree\n ASSERT(CP{\"\/a\/b\/c\/d\"}.formRelativePath(CP{\"\/a\/b\/e\/f\/g\/h\"}).toString() == \"..\/..\/..\/..\/c\/d\");\n ASSERT(CP{\"\/a\/b\/e\/f\/g\/h\"}.formRelativePath(CP{\"\/a\/b\/c\/d\"}).toString() == \"..\/..\/e\/f\/g\/h\");\n \/\/ Test path that just goes down a tree\n ASSERT(CP{\"\/a\/b\/c\/d\"}.formRelativePath(CP{\"\/a\/b\"}).toString() == \"c\/d\");\n \/\/ Test path that only goes up the tree\n ASSERT(CP{\"\/a\/b\"}.formRelativePath(CP{\"\/a\/b\/e\/f\/g\/h\"}).toString() == \"..\/..\/..\/..\");\n \/\/ Throw exceptions if either or both paths are not absolute\n ASSERT_THROW(Exception, CP{\"c\/d\"}.formRelativePath(CP{\"\/a\/b\/e\/f\/g\/h\"}));\n ASSERT_THROW(Exception, CP{\"\/a\/b\/e\/f\/g\/h\"}.formRelativePath(CP{\"e\/f\/g\/h\"}));\n ASSERT_THROW(Exception, CP{\"e\/f\/g\/h\"}.formRelativePath(CP{\"c\/d\"}));\n\n \/* Test paths with \".\" and \"..\" *\/\n \/\/ Remove all \".\", clean up \"..\" and ignore \"\/\" at the end\n ASSERT(CP{\"\/a\/.\/.\/b\/c\/..\/\/d\/..\/.\/\"}.toString() == CP{\"\/a\/b\"}.toString());\n \/\/ Test \"..\" at the end of a path\n ASSERT(CP{\"\/a\/b\/c\/d\/..\/..\"} == CP{\"\/a\/b\"});\n \/\/ Test \"..\" at the beginning of an absolute path (should throw exception)\n ASSERT_THROW(Exception, CP{\"\/..\/b\/c\/d\"});\n \/\/ Test if there are so many \"..\" that it will end up at the front of\n \/\/ an absolute path, and thus should fail like the one above\n ASSERT_THROW(Exception, CP{\"\/a\/..\/..\/c\/d\"});\n\n \/* Test that invalid characters will throw an exception. This should throw\n * exceptions when \"\\\\\", \"+\", or \"*\" appear in the string that initializes\n * the ComponentPath. Although \"\/\" is also an invalid character, it should\n * NOT throw an exception here since it is read in as a separator. *\/\n ASSERT_THROW(Exception, CP{\"\/a\/b\\\\\/c\/\"});\n ASSERT_THROW(Exception, CP{\"\/a+b+c\/\"});\n ASSERT_THROW(Exception, CP{\"\/abc*\/def\/g\/\"});\n\n \/* Test the pushBack() function *\/\n {\n ComponentPath path1{\"\/a\/b\"};\n \/\/ can't add multiple levels at once\n ASSERT_THROW(Exception, path1.pushBack(\"c\/d\"));\n\n \/\/ add the levels separately\n path1.pushBack(\"c\");\n path1.pushBack(\"d\");\n ASSERT(path1 == CP{\"\/a\/b\/c\/d\"});\n\n \/* Test invalid characters in pushBack(). Unlike the invalid\n * character test above, \"\/\" should be considered invalid since\n * pushBack() cannot add multiple levels at once. It is also\n * invalid to attempt to add an empty pathElement.\n *\/\n ASSERT_THROW(Exception, path1.pushBack(\"a\\\\b\"));\n ASSERT_THROW(Exception, path1.pushBack(\"a+b*\"));\n ASSERT_THROW(Exception, path1.pushBack(\"test\/this\"));\n ASSERT_THROW(Exception, path1.pushBack(\"\"));\n\n CP cp2{\"\"};\n cp2.pushBack(\"a\");\n ASSERT(cp2.toString() == \"a\");\n\n CP cp3{\"\/\"};\n cp3.pushBack(\"a\");\n ASSERT(cp3.toString() == \"\/a\");\n }\n\n \/* Test functions for getting certain parts of ComponentPath. *\/\n \/\/ Create a path \"\/zero\/one\/two\/three\/four\"\n std::vector<std::string> levels = {\"zero\", \"one\", \"two\", \"three\", \"four\"};\n ComponentPath numberedAbsPath(levels, true);\n \/\/ Parent path is \"\/zero\/one\/two\/three\"\n std::string numberedAbsPathParentStr = \"\/zero\/one\/two\/three\";\n ComponentPath numberedAbsPathParent(numberedAbsPathParentStr);\n \/\/ Test if getParentPath() returns correct ComponentPath object\n ASSERT(numberedAbsPath.getParentPath() == numberedAbsPathParent);\n \/\/ Test if getParentPathStr() returns correct string\n ASSERT(numberedAbsPath.getParentPathString() == numberedAbsPathParentStr);\n\n \/\/ test number of path levels behaves sanely\n {\n static const std::pair<std::string, size_t> expectedNumPathLevels[] = {\n {\"\", 0},\n {\"\/\", 0},\n {\"a\", 1},\n {\"\/a\", 1},\n {\"\/a\/\", 1},\n {\"a\/b\", 2},\n {\"\/a\/b\", 2},\n {\"\/a\/b\/\", 2},\n {\"\/a\/b\/c\", 3},\n {\"..\/\", 1},\n {\"a\/..\", 0},\n {\"\/a\/..\", 0},\n };\n\n for (auto p : expectedNumPathLevels) {\n ASSERT(CP{p.first}.getNumPathLevels() == p.second);\n }\n }\n\n \/\/ Loop through all levels of the subtree and see if names match\n for (size_t ind = 0; ind < levels.size(); ++ind) {\n ASSERT(numberedAbsPath.getSubcomponentNameAtLevel(ind) == levels[ind]);\n }\n \/\/ Test getComponentName()\n ASSERT(numberedAbsPath.getComponentName() == levels[levels.size()-1]);\n ASSERT(CP{\"\"}.getComponentName() == \"\"); \/\/ empty ComponentPath should return empty string\n\n \/\/ Do the same as above but with a relative path instead\n ComponentPath numberedRelPath(levels, false);\n std::string numberedRelPathParentStr = \"zero\/one\/two\/three\";\n ComponentPath numberedRelPathParent(numberedRelPathParentStr);\n ASSERT(numberedRelPath.getParentPath() == numberedRelPathParent);\n ASSERT(numberedRelPath.getParentPathString() == numberedRelPathParentStr);\n for (size_t ind = 0; ind < levels.size(); ++ind) {\n ASSERT(numberedRelPath.getSubcomponentNameAtLevel(ind) == levels[ind]);\n }\n\n \/\/ ensure isAbsolute is sane for vector inputs\n ASSERT(CP{std::vector<std::string>{}, true}.isAbsolute());\n ASSERT(CP{std::vector<std::string>{\"\"}, true}.isAbsolute());\n ASSERT(CP{std::vector<std::string>{\"a\", \"b\"}, true}.isAbsolute());\n\n \/\/ general tests to ensure it normalizes a variety of paths correctly\n {\n static const std::pair<std::string, std::string> shouldPass[] = {\n { \"\", \"\" },\n { \"\/\", \"\/\" },\n { \"a\/b\/c\", \"a\/b\/c\" },\n { \"a\/..\", \"\" },\n { \"a\/..\/\", \"\" },\n { \"a\/..\/c\", \"c\" },\n { \"a\/..\/c\/\", \"c\" },\n { \"\/a\/..\/c\", \"\/c\" },\n { \"\/a\/b\/..\/..\/c\", \"\/c\" },\n { \"a\/b\/..\/..\/c\", \"c\" },\n { \"\/.\/.\/.\/c\", \"\/c\" },\n { \".\/.\/.\/c\", \"c\" },\n { \".\/\", \"\" },\n { \".\", \"\" },\n { \".\/.\", \"\" },\n { \".\/a\/.\", \"a\" },\n { \".\/a\/.\/\", \"a\" },\n { \"a\/\/b\/.\/\/\/\", \"a\/b\" },\n { \"\/\/\/\", \"\/\" },\n { \".\/\/\/\", \"\" },\n { \"a\/\/\/b\", \"a\/b\" },\n { \"a\/b\/c\/\", \"a\/b\/c\" },\n { \"a\/b\/c\/\/\", \"a\/b\/c\" },\n { \"..\/a\/b\", \"..\/a\/b\" },\n { \"..\/a\/b\/\", \"..\/a\/b\" },\n { \".\/..\/a\/..\/\", \"..\" },\n { \"\/a\/b\/c\/d\", \"\/a\/b\/c\/d\" },\n { \"\/a\/b\/e\/f\/g\/h\", \"\/a\/b\/e\/f\/g\/h\" },\n { \"\/a\/b\", \"\/a\/b\" },\n { \"c\/d\", \"c\/d\" },\n { \"e\/f\/g\/h\", \"e\/f\/g\/h\" },\n { \"\/a\/.\/.\/b\/c\/..\/\/d\/..\/.\/\", \"\/a\/b\" },\n { \"..\/..\/..\/..\/c\/d\", \"..\/..\/..\/..\/c\/d\" },\n { \"\/a\/b\/c\/d\/..\/..\", \"\/a\/b\" },\n };\n\n for (const auto& tc : shouldPass) {\n std::cerr << \"input = \" << tc.first << std::endl;\n std::string output = ComponentPath{tc.first}.toString();\n if (output != tc.second) {\n std::stringstream msg;\n msg << \"ComponentPath::resolveRelativeElements: invalid output:\" << std::endl;\n msg << \" input = \" << tc.first << std::endl;\n msg << \" output = \" << output << std::endl;\n msg << \" expected output = \" << tc.second << std::endl;\n throw std::runtime_error{msg.str()};\n }\n }\n\n static const std::string shouldThrow[] = {\n \"a\/..\/..\",\n \".\/a\/..\/..\",\n \"\/..\",\n \"\/.\/..\",\n \"\/a\/..\/..\",\n \"\/.\/..\/\",\n \"\/a\/.\/..\/.\/..\",\n \"\/..\/b\/c\/d\",\n \"\/a\/..\/..\/c\/d\",\n\n \/\/ contain invalid chars\n \"foo\\\\bar\",\n \"a\/foo\\\\bar\/c\",\n \"foo*bar\",\n \"a\/foo*bar*\/c\",\n \"foo+bar\",\n \"a\/foo+bar\",\n \"foo\\tbar\",\n \"a\/b\/c\/foo\\tbar\/d\",\n \"foo\\nbar\",\n \"\/a\/foo\\nbar\",\n };\n\n for (const std::string& tc : shouldThrow) {\n std::string maybeError;\n try {\n std::string p = ComponentPath{tc}.toString();\n std::stringstream msg;\n msg << tc << \": did not throw an exception: instead, it output: \" << p;\n maybeError = msg.str();\n } catch (...) {\n \/\/ good\n }\n if (!maybeError.empty()) {\n throw std::runtime_error{maybeError};\n }\n }\n }\n}\n\nint main()\n{\n SimTK_START_TEST(\"testPath\");\n SimTK_SUBTEST(testComponentPath);\n SimTK_END_TEST();\n\n return 0;\n}\n<|endoftext|>"} {"text":"<commit_before>\/*=========================================================================\n\n Program: ORFEO Toolbox\n Language: C++\n Date: $Date$\n Version: $Revision$\n\n\n Copyright (c) Centre National d'Etudes Spatiales. All rights reserved.\n See OTBCopyright.txt for details.\n\n\n This software is distributed WITHOUT ANY WARRANTY; without even\n the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR\n PURPOSE. See the above copyright notices for more information.\n\n=========================================================================*\/\n\n#include \"otbImage.h\"\n#include \"otbImageToEnvelopeVectorDataFilter.h\"\n#include \"otbVectorData.h\"\n#include \"otbImageFileReader.h\"\n#include \"otbVectorDataFileWriter.h\"\n\n#include \"otbCommandLineArgumentParser.h\"\n\ntypedef unsigned short PixelType;\ntypedef otb::Image<PixelType,2> ImageType;\ntypedef otb::ImageFileReader<ImageType> ReaderType;\ntypedef otb::VectorData<> VectorDataType;\ntypedef otb::VectorDataFileWriter<VectorDataType> WriterType;\ntypedef otb::ImageToEnvelopeVectorDataFilter\n <ImageType,VectorDataType> FilterType;\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(\"Write a vector file containing a polygon corresponding to the imate envelope.\");\n parser->AddInputImage();\n parser->AddOption(\"--OutputVectorData\",\"Vector Data file containg the envelope.\",\"-out\",1,true);\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 ReaderType::Pointer reader = ReaderType::New();\n reader->SetFileName(parseResult->GetInputImage());\n FilterType::Pointer filter = FilterType::New();\n filter->SetInput(reader->GetOutput());\n WriterType::Pointer writer = WriterType::New();\n writer->SetInput(filter->GetOutput());\n writer->SetFileName(parseResult->GetParameterString(\"--OutputVectorData\"));\n writer->Update();\n\n return EXIT_SUCCESS;\n}\n<commit_msg>STYLE<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 \"otbImageToEnvelopeVectorDataFilter.h\"\n#include \"otbVectorData.h\"\n#include \"otbImageFileReader.h\"\n#include \"otbVectorDataFileWriter.h\"\n\n#include \"otbCommandLineArgumentParser.h\"\n\ntypedef unsigned short PixelType;\ntypedef otb::Image<PixelType, 2> ImageType;\ntypedef otb::ImageFileReader<ImageType> ReaderType;\ntypedef otb::VectorData<> VectorDataType;\ntypedef otb::VectorDataFileWriter<VectorDataType> WriterType;\ntypedef otb::ImageToEnvelopeVectorDataFilter\n <ImageType, VectorDataType> FilterType;\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(\"Write a vector file containing a polygon corresponding to the imate envelope.\");\n parser->AddInputImage();\n parser->AddOption(\"--OutputVectorData\",\"Vector Data file containg the envelope.\",\"-out\", 1, true);\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 ReaderType::Pointer reader = ReaderType::New();\n reader->SetFileName(parseResult->GetInputImage());\n FilterType::Pointer filter = FilterType::New();\n filter->SetInput(reader->GetOutput());\n WriterType::Pointer writer = WriterType::New();\n writer->SetInput(filter->GetOutput());\n writer->SetFileName(parseResult->GetParameterString(\"--OutputVectorData\"));\n writer->Update();\n\n return EXIT_SUCCESS;\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\n#include \"..\/archivereader.h\"\n#include <sys\/types.h>\n#include <sys\/stat.h>\n#include <dirent.h>\n#include <unistd.h>\n\nusing namespace jstreams;\nusing namespace std;\n\nint errors;\n\nvoid\ntest1(const char* path) {\n FileStreamOpener opener;\n ArchiveReader r;\n r.addStreamOpener(&opener);\n StreamBase<char>* s = r.openStream(path);\n r.closeStream(s);\n}\nvoid\ntest2(const char* path) {\n FileStreamOpener opener;\n ArchiveReader r;\n r.addStreamOpener(&opener);\n DirLister dl = r.getDirEntries(path);\n EntryInfo e;\n while (dl.nextEntry(e)) {\n printf(\"%s\\n\", e.filename.c_str());\n }\n}\n\nvoid\nwalkdirectories(const char* path, void (*callback)(const char*)) {\n DIR* dir = opendir(path);\n if (dir == 0) return;\n string p(path);\n struct dirent* subdir = readdir(dir);\n struct stat dirstat;\n while (subdir) {\n if (subdir->d_name[0] == '.') {\n subdir = readdir(dir);\n continue;\n }\n string name = subdir->d_name;\n string filepath = p + name;\n if (lstat(filepath.c_str(), &dirstat) == 0) {\n if (S_ISREG(dirstat.st_mode)) {\n callback(filepath.c_str());\n } else if (S_ISDIR(dirstat.st_mode)) {\n filepath += \"\/\";\n walkdirectories(filepath.c_str(), callback);\n }\n }\n subdir = readdir(dir);\n }\n closedir(dir);\n}\n\n\/**\n * Test the class ArchiveReader by analyzing all files in the given\n * directory.\n **\/\nint\nArchiveReaderTest(int argc, char** argv) {\n if (argc < 2) return 1;\n errors = 0;\n printf(\"%s\\n\", argv[1]);\n walkdirectories(argv[1], test1);\n walkdirectories(argv[1], test2);\n return errors;\n}\n<commit_msg>More thorough test for ArchiveReader<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\n#include \"..\/archivereader.h\"\n#include <sys\/types.h>\n#include <sys\/stat.h>\n#include <dirent.h>\n#include <unistd.h>\n\nusing namespace jstreams;\nusing namespace std;\n\nint errors;\n\nvoid\ntest1(const char* path) {\n FileStreamOpener opener;\n ArchiveReader r;\n r.addStreamOpener(&opener);\n StreamBase<char>* s = r.openStream(path);\n if (s == 0) {\n fprintf(stderr, \"cannot open stream to %s\\n\", path);\n errors++;\n }\n r.closeStream(s);\n}\nvoid\ntest2(const char* path) {\n FileStreamOpener opener;\n ArchiveReader r;\n r.addStreamOpener(&opener);\n DirLister dl = r.getDirEntries(path);\n EntryInfo e;\n while (dl.nextEntry(e)) {\n string filepath(path);\n filepath += \"\/\";\n filepath += e.filename;\n if (e.type == EntryInfo::File) {\n test1(filepath.c_str());\n }\n test2(filepath.c_str());\n }\n}\n\nvoid\nwalkdirectories(const char* path, void (*callback)(const char*)) {\n DIR* dir = opendir(path);\n if (dir == 0) return;\n string p(path);\n struct dirent* subdir = readdir(dir);\n struct stat dirstat;\n while (subdir) {\n if (subdir->d_name[0] == '.') {\n subdir = readdir(dir);\n continue;\n }\n string name = subdir->d_name;\n string filepath = p + name;\n if (lstat(filepath.c_str(), &dirstat) == 0) {\n if (S_ISREG(dirstat.st_mode)) {\n callback(filepath.c_str());\n } else if (S_ISDIR(dirstat.st_mode)) {\n filepath += \"\/\";\n walkdirectories(filepath.c_str(), callback);\n }\n }\n subdir = readdir(dir);\n }\n closedir(dir);\n}\n\n\/**\n * Test the class ArchiveReader by analyzing all files in the given\n * directory.\n **\/\nint\nArchiveReaderTest(int argc, char** argv) {\n if (argc < 2) return 1;\n errors = 0;\n walkdirectories(argv[1], test1);\n walkdirectories(argv[1], test2);\n if (errors) {\n fprintf(stderr, \"%i errors\\n\", errors);\n }\n return errors;\n}\n<|endoftext|>"} {"text":"<commit_before>#pragma once\n\n#include <supermarx\/util\/cached_downloader.hpp>\n#include <supermarx\/util\/stubborn.hpp>\n\n#include <functional>\n#include <deque>\n\nnamespace supermarx\n{\n\nclass download_manager\n{\npublic:\n\ttypedef std::function<void(downloader::response)> f_t;\n\ttypedef std::function<void()> error_f_t;\n\n\tstruct job_t\n\t{\n\t\tstd::string uri;\n\t\tf_t f;\n\n\t\tjob_t(job_t const&) = delete;\n\t\tjob_t(job_t&&) = default;\n\t};\n\nprivate:\n\tcached_downloader& dl;\n\tstd::deque<job_t> queue;\n\terror_f_t error_f;\n\n\tstatic void nil() {}\n\npublic:\n\tdownload_manager(cached_downloader& _dl, error_f_t const& _error_f = nil)\n\t\t: dl(_dl)\n\t\t, queue()\n\t\t, error_f(_error_f)\n\t{}\n\n\tvoid schedule(std::string const& _uri, f_t&& _f)\n\t{\n\t\tjob_t j = {_uri, std::move(_f)};\n\t\tqueue.emplace_back(std::move(j));\n\t}\n\n\tvoid process_all()\n\t{\n\t\twhile(!queue.empty())\n\t\t{\n\t\t\tjob_t j = std::move(queue.front());\n\t\t\tqueue.pop_front();\n\n\t\t\ttry\n\t\t\t{\n\t\t\t\tj.f(stubborn::attempt<downloader::response, downloader::error>([&]() {\n\t\t\t\t\treturn dl.fetch(j.uri);\n\t\t\t\t}));\n\t\t\t} catch(std::runtime_error e)\n\t\t\t{\n\t\t\t\tstd::cerr << \"Failed \" << j.uri << std::endl\n\t\t\t\t\t<< '\\t' << e.what() << std::endl;\n\t\t\t\terror_f();\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t}\n\t}\n};\n\n}\n<commit_msg>Added missing iostream dependency<commit_after>#pragma once\n\n#include <supermarx\/util\/cached_downloader.hpp>\n#include <supermarx\/util\/stubborn.hpp>\n\n#include <iostream>\n#include <functional>\n#include <deque>\n\nnamespace supermarx\n{\n\nclass download_manager\n{\npublic:\n\ttypedef std::function<void(downloader::response)> f_t;\n\ttypedef std::function<void()> error_f_t;\n\n\tstruct job_t\n\t{\n\t\tstd::string uri;\n\t\tf_t f;\n\n\t\tjob_t(job_t const&) = delete;\n\t\tjob_t(job_t&&) = default;\n\t};\n\nprivate:\n\tcached_downloader& dl;\n\tstd::deque<job_t> queue;\n\terror_f_t error_f;\n\n\tstatic void nil() {}\n\npublic:\n\tdownload_manager(cached_downloader& _dl, error_f_t const& _error_f = nil)\n\t\t: dl(_dl)\n\t\t, queue()\n\t\t, error_f(_error_f)\n\t{}\n\n\tvoid schedule(std::string const& _uri, f_t&& _f)\n\t{\n\t\tjob_t j = {_uri, std::move(_f)};\n\t\tqueue.emplace_back(std::move(j));\n\t}\n\n\tvoid process_all()\n\t{\n\t\twhile(!queue.empty())\n\t\t{\n\t\t\tjob_t j = std::move(queue.front());\n\t\t\tqueue.pop_front();\n\n\t\t\ttry\n\t\t\t{\n\t\t\t\tj.f(stubborn::attempt<downloader::response, downloader::error>([&]() {\n\t\t\t\t\treturn dl.fetch(j.uri);\n\t\t\t\t}));\n\t\t\t} catch(std::runtime_error e)\n\t\t\t{\n\t\t\t\tstd::cerr << \"Failed \" << j.uri << std::endl\n\t\t\t\t\t<< '\\t' << e.what() << std::endl;\n\t\t\t\terror_f();\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t}\n\t}\n};\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 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 <QObject>\n#include <QTimer>\n\n#include <wlanmgmtclient.h>\n#include <wlanmgmtinterface.h>\n#include <wlanmgmtcommon.h>\n#include \"wlaninfo_s60.h\"\n\nconst int KWlanInfoSignalStrengthMax = 60;\nconst int KWlanInfoSignalStrengthMin = 100;\n\nCWlanInfo::CWlanInfo(QObject *parent) : QObject(parent)\n , m_wlanStatus(false)\n , m_wlanSsid()\n , m_wlanSignalStrength(-1)\n{\n#ifndef __WINSCW__ \n TRAP_IGNORE(\n m_wlanMgmtClient = CWlanMgmtClient::NewL();\n m_wlanMgmtClient->ActivateNotificationsL(*this);\n )\n\n m_timer = new QTimer(this);\n connect(m_timer, SIGNAL(timeout()), this, SLOT(checkWlanInfo()));\n m_timer->setInterval(1000);\n m_timer->start();\n#endif \n}\n\nCWlanInfo::~CWlanInfo()\n{\n m_wlanMgmtClient->CancelNotifications();\n delete m_wlanMgmtClient;\n}\n\nQString CWlanInfo::wlanNetworkName() const\n{\n return m_wlanSsid;\n}\n\nint CWlanInfo::wlanNetworkSignalStrength() const\n{\n return m_wlanSignalStrength;\n}\n\nbool CWlanInfo::wlanNetworkConnectionStatus() const\n{\n return m_wlanStatus;\n}\n\nvoid CWlanInfo::checkWlanInfo()\n{\n#ifndef __WINSCW__ \n TWlanConnectionMode connectionMode;\n TInt err = m_wlanMgmtClient->GetConnectionMode(connectionMode);\n if (err == KErrNone && connectionMode != EWlanConnectionModeNotConnected) {\n m_wlanStatus = true;\n emit wlanNetworkStatusChanged();\n } else {\n stopPolling();\n return;\n }\n\n TWlanSsid ssid;\n err = m_wlanMgmtClient->GetConnectionSsid(ssid);\n ssid.ZeroTerminate();\n if (err == KErrNone && m_wlanSsid != (char*)ssid.Ptr()) {\n m_wlanSsid = (char*)ssid.Ptr();\n emit wlanNetworkNameChanged();\n }\n\n TInt32 signalQuality;\n err = m_wlanMgmtClient->GetConnectionSignalQuality(signalQuality);\n\n if (err == KErrNone && m_wlanSignalStrength != signalQuality) {\n if (signalQuality <= KWlanInfoSignalStrengthMax && signalQuality >= 0)\n m_wlanSignalStrength = 100;\n else if (signalQuality >= KWlanInfoSignalStrengthMin)\n m_wlanSignalStrength = 0;\n else {\n m_wlanSignalStrength = (KWlanInfoSignalStrengthMin - signalQuality) * 100 \/\n (KWlanInfoSignalStrengthMin - KWlanInfoSignalStrengthMax);\n }\n emit wlanNetworkSignalStrengthChanged();\n }\n#endif\n}\n\nvoid CWlanInfo::ConnectionStateChanged(TWlanConnectionMode aNewState)\n{\n if (aNewState == EWlanConnectionModeNotConnected)\n stopPolling();\n else {\n m_timer->start();\n checkWlanInfo();\n }\n}\n\nvoid CWlanInfo::stopPolling()\n{\n m_timer->stop();\n m_wlanStatus = false;\n m_wlanSsid = \"\";\n m_wlanSignalStrength = 0;\n\n emit wlanNetworkStatusChanged();\n emit wlanNetworkNameChanged();\n emit wlanNetworkSignalStrengthChanged();\n}\n<commit_msg>MOBILITY-1499 : Fix for CWlanInfo crash ( added handle checks)<commit_after>\/****************************************************************************\n**\n** Copyright (C) 2009-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 <QObject>\n#include <QTimer>\n\n#include <wlanmgmtclient.h>\n#include <wlanmgmtinterface.h>\n#include <wlanmgmtcommon.h>\n#include \"wlaninfo_s60.h\"\n\nconst int KWlanInfoSignalStrengthMax = 60;\nconst int KWlanInfoSignalStrengthMin = 100;\n\nCWlanInfo::CWlanInfo(QObject *parent) : QObject(parent)\n , m_wlanMgmtClient(NULL)\n , m_wlanStatus(false)\n , m_wlanSsid()\n , m_wlanSignalStrength(-1)\n{\n#ifndef __WINSCW__ \n TRAP_IGNORE( m_wlanMgmtClient = CWlanMgmtClient::NewL();)\n \n\t\tif (m_wlanMgmtClient){\n\t\t\tm_wlanMgmtClient->ActivateNotificationsL(*this);\n\t m_timer = new QTimer(this);\n\t connect(m_timer, SIGNAL(timeout()), this, SLOT(checkWlanInfo()));\n\t m_timer->setInterval(1000);\n\t m_timer->start();\n\t \t}\n#endif \n}\n\nCWlanInfo::~CWlanInfo()\n{\n if (m_wlanMgmtClient)\n \tm_wlanMgmtClient->CancelNotifications();\n delete m_wlanMgmtClient;\n}\n\nQString CWlanInfo::wlanNetworkName() const\n{\n return m_wlanSsid;\n}\n\nint CWlanInfo::wlanNetworkSignalStrength() const\n{\n return m_wlanSignalStrength;\n}\n\nbool CWlanInfo::wlanNetworkConnectionStatus() const\n{\n return m_wlanStatus;\n}\n\nvoid CWlanInfo::checkWlanInfo()\n{\n#ifndef __WINSCW__ \n\t\tif(!m_wlanMgmtClient)\n\t\t\treturn;\n TWlanConnectionMode connectionMode;\n TInt err = m_wlanMgmtClient->GetConnectionMode(connectionMode);\n if (err == KErrNone && connectionMode != EWlanConnectionModeNotConnected) {\n m_wlanStatus = true;\n emit wlanNetworkStatusChanged();\n } else {\n stopPolling();\n return;\n }\n\n TWlanSsid ssid;\n err = m_wlanMgmtClient->GetConnectionSsid(ssid);\n ssid.ZeroTerminate();\n if (err == KErrNone && m_wlanSsid != (char*)ssid.Ptr()) {\n m_wlanSsid = (char*)ssid.Ptr();\n emit wlanNetworkNameChanged();\n }\n\n TInt32 signalQuality;\n err = m_wlanMgmtClient->GetConnectionSignalQuality(signalQuality);\n\n if (err == KErrNone && m_wlanSignalStrength != signalQuality) {\n if (signalQuality <= KWlanInfoSignalStrengthMax && signalQuality >= 0)\n m_wlanSignalStrength = 100;\n else if (signalQuality >= KWlanInfoSignalStrengthMin)\n m_wlanSignalStrength = 0;\n else {\n m_wlanSignalStrength = (KWlanInfoSignalStrengthMin - signalQuality) * 100 \/\n (KWlanInfoSignalStrengthMin - KWlanInfoSignalStrengthMax);\n }\n emit wlanNetworkSignalStrengthChanged();\n }\n#endif\n}\n\nvoid CWlanInfo::ConnectionStateChanged(TWlanConnectionMode aNewState)\n{\n if (aNewState == EWlanConnectionModeNotConnected)\n stopPolling();\n else {\n m_timer->start();\n checkWlanInfo();\n }\n}\n\nvoid CWlanInfo::stopPolling()\n{\n m_timer->stop();\n m_wlanStatus = false;\n m_wlanSsid = \"\";\n m_wlanSignalStrength = 0;\n\n emit wlanNetworkStatusChanged();\n emit wlanNetworkNameChanged();\n emit wlanNetworkSignalStrengthChanged();\n}\n<|endoftext|>"} {"text":"<commit_before>#include \"stdafx.h\"\n\n#include <string>\n#include <map>\n#include <vector>\n#include \"..\/Application.h\"\n#include \"..\/ModuleScripting.h\"\n#include \"..\/ModuleInput.h\"\n#include \"..\/ModuleWindow.h\"\n#include \"..\/ComponentTransform.h\"\n#include \"..\/ModuleGOManager.h\"\n#include \"..\/GameObject.h\"\n#include \"..\/Component.h\"\n#include \"..\/ComponentScript.h\"\n#include \"..\/ComponentRectTransform.h\"\n#include \"..\/SDL\/include\/SDL_scancode.h\"\n#include \"..\/Globals.h\"\n#include \"..\/ComponentUiButton.h\"\n#include \"..\/ComponentCanvas.h\"\n#include \"..\/ModuleResourceManager.h\"\n#include \"..\/Random.h\"\n#include \"..\/Time.h\"\n\n#include \"..\/ComponentAudioSource.h\"\n\nnamespace MapSelectUI\n{\n\n\tGameObject* map_fields = nullptr;\n\tGameObject* map_umi = nullptr;\n\tGameObject* map_ricing = nullptr;\n\t\n\tGameObject* players_vote[4];\n\tGameObject* right_arrow = nullptr;\n\tGameObject* left_arrow = nullptr;\n\n\tComponentUiButton* c_players_vote[4];\n\t\/\/ 0 - P1 Red, 1 - P2 Red, 2 - P1 Blue, 2 - P2 Blue,\n\tComponentUiButton* c_right_arrow = nullptr;\n\tComponentUiButton* c_left_arrow = nullptr;\n\n\tstring path_map1 = \"\";\n\tstring path_map2 = \"\";\n\tstring path_map3 = \"\";\n\n\tbool players_ready[4] = { false, false, false, false };\n\n\tbool a_pressed = false;\n\tbool b_pressed = false;\n\tbool dpad_left_pressed = false;\n\tbool dpad_right_pressed = false;\n\tint current_level = 0;\n\tint current_map = 0; \/\/ 1 - , 2 - , 3 - ,\n\tint votes[4] = { 0, 0, 0, 0 };\n\n\tint arrow_counter_left = 30;\n\tint arrow_counter_right = 30;\n\tint time = 30;\n\tint player_order[4];\n\tvoid MapSelectUI_GetPublics(map<const char*, string>* public_chars, map<const char*, int>* public_ints, map<const char*, float>* public_float, map<const char*, bool>* public_bools, map<const char*, GameObject*>* public_gos)\n\t{\n\t\tpublic_gos->insert(std::pair<const char*, GameObject*>(\"Map Fields\", map_fields));\n\t\tpublic_gos->insert(std::pair<const char*, GameObject*>(\"Map Umi\", map_umi));\n\t\tpublic_gos->insert(std::pair<const char*, GameObject*>(\"Map Ricing\", map_ricing));\n\t\tpublic_gos->insert(std::pair<const char*, GameObject*>(\"P1-Red Vote\", players_vote[2]));\n\t\tpublic_gos->insert(std::pair<const char*, GameObject*>(\"P2-Red Vote\", players_vote[3]));\n\t\tpublic_gos->insert(std::pair<const char*, GameObject*>(\"P1-Blue Vote\", players_vote[0]));\n\t\tpublic_gos->insert(std::pair<const char*, GameObject*>(\"P2-Blue Vote\", players_vote[1]));\n\t\tpublic_gos->insert(std::pair<const char*, GameObject*>(\"R-Arrow\", right_arrow));\n\t\tpublic_gos->insert(std::pair<const char*, GameObject*>(\"L-Arrow\", left_arrow));\n\n\t\tpublic_ints->insert(std::pair<const char*, int>(\"Button Cooldown\", time));\n\t}\n\n\tvoid MapSelectUI_UpdatePublics(GameObject* game_object)\n\t{\n\t\tComponentScript* test_script = (ComponentScript*)game_object->GetComponent(ComponentType::C_SCRIPT);\n\n\t\tmap_fields = test_script->public_gos.at(\"Map Fields\");\n\t\tmap_umi = test_script->public_gos.at(\"Map Umi\");\n\t\tmap_ricing = test_script->public_gos.at(\"Map Ricing\");\n\t\tplayers_vote[0] = test_script->public_gos.at(\"P1-Blue Vote\");\n\t\tplayers_vote[1] = test_script->public_gos.at(\"P2-Blue Vote\");\n\t\tplayers_vote[2] = test_script->public_gos.at(\"P1-Red Vote\");\n\t\tplayers_vote[3] = test_script->public_gos.at(\"P2-Red Vote\");\n\t\t\n\t\tright_arrow = test_script->public_gos.at(\"R-Arrow\");\n\t\tleft_arrow = test_script->public_gos.at(\"L-Arrow\");\n\t\ttime = test_script->public_ints.at(\"Button Cooldown\");\n\n\t\tc_players_vote[0] = (ComponentUiButton*)players_vote[0]->GetComponent(C_UI_BUTTON);\n\t\tc_players_vote[1] = (ComponentUiButton*)players_vote[1]->GetComponent(C_UI_BUTTON);\n\t\tc_players_vote[2] = (ComponentUiButton*)players_vote[2]->GetComponent(C_UI_BUTTON);\n\t\tc_players_vote[3] = (ComponentUiButton*)players_vote[3]->GetComponent(C_UI_BUTTON);\n\t\tc_right_arrow = (ComponentUiButton*)right_arrow->GetComponent(C_UI_BUTTON);\n\t\tc_left_arrow = (ComponentUiButton*)left_arrow->GetComponent(C_UI_BUTTON);\n\t}\n\n\tvoid MapSelectUI_ActualizePublics(GameObject* game_object)\n\t{\n\t\tComponentScript* this_script = (ComponentScript*)game_object->GetComponent(ComponentType::C_SCRIPT);\n\n\t\tthis_script->public_gos.at(\"Map Fields\") = map_fields;\n\t\tthis_script->public_gos.at(\"Map Umi\") = map_umi;\n\t\tthis_script->public_gos.at(\"Map Ricing\") = map_ricing;\n\t\tthis_script->public_gos.at(\"P1-Blue Vote\") = players_vote[0];\n\t\tthis_script->public_gos.at(\"P2-Blue Vote\") = players_vote[1];\n\t\tthis_script->public_gos.at(\"P1-Red Vote\") = players_vote[2];\n\t\tthis_script->public_gos.at(\"P2-Red Vote\") = players_vote[3];\n\t\t\n\t\tthis_script->public_gos.at(\"R-Arrow\") = right_arrow;\n\t\tthis_script->public_gos.at(\"L-Arrow\") = left_arrow;\n\t\tthis_script->public_ints.at(\"Button Cooldown\") = time;\n\t\tc_players_vote[0] = (ComponentUiButton*)players_vote[0]->GetComponent(C_UI_BUTTON);\n\t\tc_players_vote[1] = (ComponentUiButton*)players_vote[1]->GetComponent(C_UI_BUTTON);\n\t\tc_players_vote[2] = (ComponentUiButton*)players_vote[2]->GetComponent(C_UI_BUTTON);\n\t\tc_players_vote[3] = (ComponentUiButton*)players_vote[3]->GetComponent(C_UI_BUTTON);\n\t\tc_right_arrow = (ComponentUiButton*)right_arrow->GetComponent(C_UI_BUTTON);\n\t\tc_left_arrow = (ComponentUiButton*)left_arrow->GetComponent(C_UI_BUTTON);\n\t}\n\n\tvoid MapSelectUI_UpdatePublics(GameObject* game_object);\n\n\tvoid MapSelectUI_Start(GameObject* game_object)\n\t{\n\t\t\/\/ Play Move Selection\n\t\tComponentAudioSource *a_comp = (ComponentAudioSource*)game_object->GetComponent(ComponentType::C_AUDIO_SOURCE);\n\t\tif (a_comp) a_comp->PlayAudio(0);\n\n\t\tarrow_counter_left = time;\n\t\tarrow_counter_right = time;\n\t\tcurrent_map = 0;\n\t\tcurrent_level = 0;\n\t\tplayer_order[0] = App->go_manager->team1_front;\n\t\tplayer_order[1] = App->go_manager->team1_back;\n\t\tplayer_order[2] = App->go_manager->team2_front;\n\t\tplayer_order[3] = App->go_manager->team2_back;\n\t}\n\n\tvoid MapSelectUI_Update(GameObject* game_object)\n\t{\n\t\tfor (int playerID = 0; playerID < 4; playerID++)\n\t\t{\n\t\t\tint id = 0;\n\t\t\tfor (int j = 0; j < 4; j++)\n\t\t\t{\n\t\t\t\tif (player_order[j] == playerID)\n\t\t\t\t{\n\t\t\t\t\tid = j;\n\t\t\t\t}\n\t\t\t}\n\t\t\tif (App->input->GetJoystickButton(playerID, JOY_BUTTON::A) == KEY_DOWN || App->input->GetKey(SDL_SCANCODE_A) == KEY_DOWN)\n\t\t\t{\n\t\t\t\tc_players_vote[id]->OnPressId(current_level); \/\/ TO BE TESTED\n\t\t\t\t\n\n\t\t\t\tvotes[id] = current_level;\n\t\t\t\tplayers_ready[id] = true;\n\t\t\t}\n\n\t\t\tif (App->input->GetJoystickButton(playerID, JOY_BUTTON::B) == KEY_DOWN || App->input->GetKey(SDL_SCANCODE_B) == KEY_DOWN)\n\t\t\t{\n\t\t\t\tif (players_ready[id])\n\t\t\t\t{\n\t\t\t\t\tc_players_vote[id]->OnPressId(votes[id]); \/\/ TO BE TESTED\n\n\t\t\t\t\tplayers_ready[id] = false;\n\t\t\t\t}\n\t\t\t}\n\n\t\t\tif (App->input->GetJoystickButton(playerID, JOY_BUTTON::DPAD_LEFT) == KEY_DOWN || App->input->GetKey(SDL_SCANCODE_LEFT) == KEY_DOWN)\n\t\t\t{\n\t\t\t\t\/\/ Play Move Selection\n\t\t\t\tComponentAudioSource *a_comp = (ComponentAudioSource*)game_object->GetComponent(ComponentType::C_AUDIO_SOURCE);\n\t\t\t\tif (a_comp) a_comp->PlayAudio(1);\n\n\t\t\t\tcurrent_level--;\n\t\t\t\tif (current_level < 0)\n\t\t\t\t\tcurrent_level = 2;\n\n\t\t\t\tswitch (current_level)\n\t\t\t\t{\n\t\t\t\tcase 0:\n\t\t\t\t\tmap_fields->SetActive(true);\n\t\t\t\t\tmap_umi->SetActive(false);\n\t\t\t\t\tmap_ricing->SetActive(false);\n\t\t\t\t\tbreak;\n\t\t\t\tcase 1:\n\t\t\t\t\tmap_fields->SetActive(false);\n\t\t\t\t\tmap_umi->SetActive(true);\n\t\t\t\t\tmap_ricing->SetActive(false);\n\t\t\t\t\tbreak;\n\t\t\t\tcase 2:\n\t\t\t\t\tmap_fields->SetActive(false);\n\t\t\t\t\tmap_umi->SetActive(false);\n\t\t\t\t\tmap_ricing->SetActive(true);\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\n\t\t\t\tif (arrow_counter_left >= time)\n\t\t\t\t{\n\t\t\t\t\tc_left_arrow->OnPress();\n\t\t\t\t}\n\t\t\t\tarrow_counter_left = 0;\n\t\t\t}\n\n\t\t\tif (App->input->GetJoystickButton(playerID, JOY_BUTTON::DPAD_RIGHT) == KEY_DOWN || App->input->GetKey(SDL_SCANCODE_RIGHT) == KEY_DOWN)\n\t\t\t{\n\t\t\t\t\/\/ Play Move Selection\n\t\t\t\tComponentAudioSource *a_comp = (ComponentAudioSource*)game_object->GetComponent(ComponentType::C_AUDIO_SOURCE);\n\t\t\t\tif (a_comp) a_comp->PlayAudio(1);\n\n\t\t\t\tcurrent_level++;\n\t\t\t\tif (current_level > 2)\n\t\t\t\t\tcurrent_level = 0;\n\t\t\t\tswitch (current_level)\n\t\t\t\t{\n\t\t\t\tcase 0:\n\t\t\t\t\tmap_fields->SetActive(true);\n\t\t\t\t\tmap_umi->SetActive(false);\n\t\t\t\t\tmap_ricing->SetActive(false);\n\t\t\t\t\tbreak;\n\t\t\t\tcase 1:\n\t\t\t\t\tmap_fields->SetActive(false);\n\t\t\t\t\tmap_umi->SetActive(true);\n\t\t\t\t\tmap_ricing->SetActive(false);\n\t\t\t\t\tbreak;\n\t\t\t\tcase 2:\n\t\t\t\t\tmap_fields->SetActive(false);\n\t\t\t\t\tmap_umi->SetActive(false);\n\t\t\t\t\tmap_ricing->SetActive(true);\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t\n\n\t\t\t\tif (arrow_counter_right >= time)\n\t\t\t\t{\n\t\t\t\t\tc_right_arrow->OnPress();\n\t\t\t\t}\n\t\t\t\tarrow_counter_right = 0;\n\t\t\t}\n\t\t}\n\n\t\tif (arrow_counter_left < time)\n\t\t{\n\t\t\tarrow_counter_left++;\n\n\t\t\tif (arrow_counter_left == time)\n\t\t\t\tc_left_arrow->OnPress();\n\t\t}\n\n\t\tif (arrow_counter_right < time)\n\t\t{\n\t\t\tarrow_counter_right++;\n\n\t\t\tif (arrow_counter_right == time)\n\t\t\t\tc_right_arrow->OnPress();\n\t\t}\n\n\t\tint total = 0;\n\t\tfor (int j = 0; j < 4; j++)\n\t\t{\n\t\t\tif (players_ready[j])\n\t\t\t\ttotal++;\n\n\t\t\tif (total == 4)\n\t\t\t{\n\t\t\t\tunsigned int k = App->rnd->RandomInt(1, 4);\n\n\t\t\t\tswitch (votes[k])\n\t\t\t\t{\n\t\t\t\tcase 1:\n\t\t\t\t\tApp->resource_manager->LoadSceneFromAssets(path_map1.data());\n\t\t\t\t\tbreak;\n\t\t\t\tcase 2:\n\t\t\t\t\tApp->resource_manager->LoadSceneFromAssets(path_map2.data());\n\t\t\t\t\tbreak;\n\t\t\t\tcase 3:\n\t\t\t\t\tApp->resource_manager->LoadSceneFromAssets(path_map3.data());\n\t\t\t\t\tbreak;\n\t\t\t\tdefault:\n\t\t\t\t\t\/\/ Error Reset, but loads map 1 instead (because we need to cover bugs lol lmao pls don't kill me)\n\t\t\t\t\tApp->resource_manager->LoadSceneFromAssets(path_map1.data());\n\t\t\t\t\tbreak;\n\n\t\t\t\t}\n\t\t\t}\n\t\t\telse\n\t\t\t\ttotal = 0; \/\/ Redundancy\n\t\t}\n\t}\n\n\tvoid MapSelectUI_OnFocus()\n\t{\n\n\t}\n}\n<commit_msg>Fixed Issue in map selection<commit_after>#include \"stdafx.h\"\n\n#include <string>\n#include <map>\n#include <vector>\n#include \"..\/Application.h\"\n#include \"..\/ModuleScripting.h\"\n#include \"..\/ModuleInput.h\"\n#include \"..\/ModuleWindow.h\"\n#include \"..\/ComponentTransform.h\"\n#include \"..\/ModuleGOManager.h\"\n#include \"..\/GameObject.h\"\n#include \"..\/Component.h\"\n#include \"..\/ComponentScript.h\"\n#include \"..\/ComponentRectTransform.h\"\n#include \"..\/SDL\/include\/SDL_scancode.h\"\n#include \"..\/Globals.h\"\n#include \"..\/ComponentUiButton.h\"\n#include \"..\/ComponentCanvas.h\"\n#include \"..\/ModuleResourceManager.h\"\n#include \"..\/Random.h\"\n#include \"..\/Time.h\"\n\n#include \"..\/ComponentAudioSource.h\"\n\nnamespace MapSelectUI\n{\n\n\tGameObject* map_fields = nullptr;\n\tGameObject* map_umi = nullptr;\n\tGameObject* map_ricing = nullptr;\n\t\n\tGameObject* players_vote[4];\n\tGameObject* right_arrow = nullptr;\n\tGameObject* left_arrow = nullptr;\n\n\tComponentUiButton* c_players_vote[4];\n\t\/\/ 0 - P1 Red, 1 - P2 Red, 2 - P1 Blue, 2 - P2 Blue,\n\tComponentUiButton* c_right_arrow = nullptr;\n\tComponentUiButton* c_left_arrow = nullptr;\n\n\tstring path_map1 = \"\";\n\tstring path_map2 = \"\";\n\tstring path_map3 = \"\";\n\n\tbool players_ready[4] = { false, false, false, false };\n\n\tbool a_pressed = false;\n\tbool b_pressed = false;\n\tbool dpad_left_pressed = false;\n\tbool dpad_right_pressed = false;\n\tint current_level = 0;\n\tint current_map = 0; \/\/ 1 - , 2 - , 3 - ,\n\tint votes[4] = { 0, 0, 0, 0 };\n\n\tint arrow_counter_left = 30;\n\tint arrow_counter_right = 30;\n\tint time = 30;\n\tint player_order[4];\n\tvoid MapSelectUI_GetPublics(map<const char*, string>* public_chars, map<const char*, int>* public_ints, map<const char*, float>* public_float, map<const char*, bool>* public_bools, map<const char*, GameObject*>* public_gos)\n\t{\n\t\tpublic_gos->insert(std::pair<const char*, GameObject*>(\"Map Fields\", map_fields));\n\t\tpublic_gos->insert(std::pair<const char*, GameObject*>(\"Map Umi\", map_umi));\n\t\tpublic_gos->insert(std::pair<const char*, GameObject*>(\"Map Ricing\", map_ricing));\n\t\tpublic_gos->insert(std::pair<const char*, GameObject*>(\"P1-Red Vote\", players_vote[2]));\n\t\tpublic_gos->insert(std::pair<const char*, GameObject*>(\"P2-Red Vote\", players_vote[3]));\n\t\tpublic_gos->insert(std::pair<const char*, GameObject*>(\"P1-Blue Vote\", players_vote[0]));\n\t\tpublic_gos->insert(std::pair<const char*, GameObject*>(\"P2-Blue Vote\", players_vote[1]));\n\t\tpublic_gos->insert(std::pair<const char*, GameObject*>(\"R-Arrow\", right_arrow));\n\t\tpublic_gos->insert(std::pair<const char*, GameObject*>(\"L-Arrow\", left_arrow));\n\n\t\tpublic_ints->insert(std::pair<const char*, int>(\"Button Cooldown\", time));\n\t}\n\n\tvoid MapSelectUI_UpdatePublics(GameObject* game_object)\n\t{\n\t\tComponentScript* test_script = (ComponentScript*)game_object->GetComponent(ComponentType::C_SCRIPT);\n\n\t\tmap_fields = test_script->public_gos.at(\"Map Fields\");\n\t\tmap_umi = test_script->public_gos.at(\"Map Umi\");\n\t\tmap_ricing = test_script->public_gos.at(\"Map Ricing\");\n\t\tplayers_vote[0] = test_script->public_gos.at(\"P1-Blue Vote\");\n\t\tplayers_vote[1] = test_script->public_gos.at(\"P2-Blue Vote\");\n\t\tplayers_vote[2] = test_script->public_gos.at(\"P1-Red Vote\");\n\t\tplayers_vote[3] = test_script->public_gos.at(\"P2-Red Vote\");\n\t\t\n\t\tright_arrow = test_script->public_gos.at(\"R-Arrow\");\n\t\tleft_arrow = test_script->public_gos.at(\"L-Arrow\");\n\t\ttime = test_script->public_ints.at(\"Button Cooldown\");\n\n\t\tc_players_vote[0] = (ComponentUiButton*)players_vote[0]->GetComponent(C_UI_BUTTON);\n\t\tc_players_vote[1] = (ComponentUiButton*)players_vote[1]->GetComponent(C_UI_BUTTON);\n\t\tc_players_vote[2] = (ComponentUiButton*)players_vote[2]->GetComponent(C_UI_BUTTON);\n\t\tc_players_vote[3] = (ComponentUiButton*)players_vote[3]->GetComponent(C_UI_BUTTON);\n\t\tc_right_arrow = (ComponentUiButton*)right_arrow->GetComponent(C_UI_BUTTON);\n\t\tc_left_arrow = (ComponentUiButton*)left_arrow->GetComponent(C_UI_BUTTON);\n\t}\n\n\tvoid MapSelectUI_ActualizePublics(GameObject* game_object)\n\t{\n\t\tComponentScript* this_script = (ComponentScript*)game_object->GetComponent(ComponentType::C_SCRIPT);\n\n\t\tthis_script->public_gos.at(\"Map Fields\") = map_fields;\n\t\tthis_script->public_gos.at(\"Map Umi\") = map_umi;\n\t\tthis_script->public_gos.at(\"Map Ricing\") = map_ricing;\n\t\tthis_script->public_gos.at(\"P1-Blue Vote\") = players_vote[0];\n\t\tthis_script->public_gos.at(\"P2-Blue Vote\") = players_vote[1];\n\t\tthis_script->public_gos.at(\"P1-Red Vote\") = players_vote[2];\n\t\tthis_script->public_gos.at(\"P2-Red Vote\") = players_vote[3];\n\t\t\n\t\tthis_script->public_gos.at(\"R-Arrow\") = right_arrow;\n\t\tthis_script->public_gos.at(\"L-Arrow\") = left_arrow;\n\t\tthis_script->public_ints.at(\"Button Cooldown\") = time;\n\t\tc_players_vote[0] = (ComponentUiButton*)players_vote[0]->GetComponent(C_UI_BUTTON);\n\t\tc_players_vote[1] = (ComponentUiButton*)players_vote[1]->GetComponent(C_UI_BUTTON);\n\t\tc_players_vote[2] = (ComponentUiButton*)players_vote[2]->GetComponent(C_UI_BUTTON);\n\t\tc_players_vote[3] = (ComponentUiButton*)players_vote[3]->GetComponent(C_UI_BUTTON);\n\t\tc_right_arrow = (ComponentUiButton*)right_arrow->GetComponent(C_UI_BUTTON);\n\t\tc_left_arrow = (ComponentUiButton*)left_arrow->GetComponent(C_UI_BUTTON);\n\t}\n\n\tvoid MapSelectUI_UpdatePublics(GameObject* game_object);\n\n\tvoid MapSelectUI_Start(GameObject* game_object)\n\t{\n\t\t\/\/ Play Move Selection\n\t\tComponentAudioSource *a_comp = (ComponentAudioSource*)game_object->GetComponent(ComponentType::C_AUDIO_SOURCE);\n\t\tif (a_comp) a_comp->PlayAudio(0);\n\n\t\tarrow_counter_left = time;\n\t\tarrow_counter_right = time;\n\t\tcurrent_map = 0;\n\t\tcurrent_level = 0;\n\t\tplayer_order[0] = App->go_manager->team1_front;\n\t\tplayer_order[1] = App->go_manager->team1_back;\n\t\tplayer_order[2] = App->go_manager->team2_front;\n\t\tplayer_order[3] = App->go_manager->team2_back;\n\t}\n\n\tvoid MapSelectUI_Update(GameObject* game_object)\n\t{\n\t\tfor (int playerID = 0; playerID < 4; playerID++)\n\t\t{\n\t\t\tint id = 0;\n\t\t\tfor (int j = 0; j < 4; j++)\n\t\t\t{\n\t\t\t\tif (player_order[j] == playerID)\n\t\t\t\t{\n\t\t\t\t\tid = j;\n\t\t\t\t}\n\t\t\t}\n\t\t\tif (App->input->GetJoystickButton(playerID, JOY_BUTTON::A) == KEY_DOWN || App->input->GetKey(SDL_SCANCODE_A) == KEY_DOWN)\n\t\t\t{\n\t\t\t\tif (!players_ready[id])\n\t\t\t\t{\n\t\t\t\t\tc_players_vote[id]->OnPressId(current_level); \/\/ TO BE TESTED\n\n\n\t\t\t\t\tvotes[id] = current_level;\n\t\t\t\t\tplayers_ready[id] = true;\n\t\t\t\t}\n\t\t\t\t\n\t\t\t}\n\n\t\t\tif (App->input->GetJoystickButton(playerID, JOY_BUTTON::B) == KEY_DOWN || App->input->GetKey(SDL_SCANCODE_B) == KEY_DOWN)\n\t\t\t{\n\t\t\t\tif (players_ready[id])\n\t\t\t\t{\n\t\t\t\t\tc_players_vote[id]->OnPressId(votes[id]); \/\/ TO BE TESTED\n\n\t\t\t\t\tplayers_ready[id] = false;\n\t\t\t\t}\n\t\t\t}\n\n\t\t\tif (App->input->GetJoystickButton(playerID, JOY_BUTTON::DPAD_LEFT) == KEY_DOWN || App->input->GetKey(SDL_SCANCODE_LEFT) == KEY_DOWN)\n\t\t\t{\n\t\t\t\t\/\/ Play Move Selection\n\t\t\t\tComponentAudioSource *a_comp = (ComponentAudioSource*)game_object->GetComponent(ComponentType::C_AUDIO_SOURCE);\n\t\t\t\tif (a_comp) a_comp->PlayAudio(1);\n\n\t\t\t\tcurrent_level--;\n\t\t\t\tif (current_level < 0)\n\t\t\t\t\tcurrent_level = 2;\n\n\t\t\t\tswitch (current_level)\n\t\t\t\t{\n\t\t\t\tcase 0:\n\t\t\t\t\tmap_fields->SetActive(true);\n\t\t\t\t\tmap_umi->SetActive(false);\n\t\t\t\t\tmap_ricing->SetActive(false);\n\t\t\t\t\tbreak;\n\t\t\t\tcase 1:\n\t\t\t\t\tmap_fields->SetActive(false);\n\t\t\t\t\tmap_umi->SetActive(true);\n\t\t\t\t\tmap_ricing->SetActive(false);\n\t\t\t\t\tbreak;\n\t\t\t\tcase 2:\n\t\t\t\t\tmap_fields->SetActive(false);\n\t\t\t\t\tmap_umi->SetActive(false);\n\t\t\t\t\tmap_ricing->SetActive(true);\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\n\t\t\t\tif (arrow_counter_left >= time)\n\t\t\t\t{\n\t\t\t\t\tc_left_arrow->OnPress();\n\t\t\t\t}\n\t\t\t\tarrow_counter_left = 0;\n\t\t\t}\n\n\t\t\tif (App->input->GetJoystickButton(playerID, JOY_BUTTON::DPAD_RIGHT) == KEY_DOWN || App->input->GetKey(SDL_SCANCODE_RIGHT) == KEY_DOWN)\n\t\t\t{\n\t\t\t\t\/\/ Play Move Selection\n\t\t\t\tComponentAudioSource *a_comp = (ComponentAudioSource*)game_object->GetComponent(ComponentType::C_AUDIO_SOURCE);\n\t\t\t\tif (a_comp) a_comp->PlayAudio(1);\n\n\t\t\t\tcurrent_level++;\n\t\t\t\tif (current_level > 2)\n\t\t\t\t\tcurrent_level = 0;\n\t\t\t\tswitch (current_level)\n\t\t\t\t{\n\t\t\t\tcase 0:\n\t\t\t\t\tmap_fields->SetActive(true);\n\t\t\t\t\tmap_umi->SetActive(false);\n\t\t\t\t\tmap_ricing->SetActive(false);\n\t\t\t\t\tbreak;\n\t\t\t\tcase 1:\n\t\t\t\t\tmap_fields->SetActive(false);\n\t\t\t\t\tmap_umi->SetActive(true);\n\t\t\t\t\tmap_ricing->SetActive(false);\n\t\t\t\t\tbreak;\n\t\t\t\tcase 2:\n\t\t\t\t\tmap_fields->SetActive(false);\n\t\t\t\t\tmap_umi->SetActive(false);\n\t\t\t\t\tmap_ricing->SetActive(true);\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t\n\n\t\t\t\tif (arrow_counter_right >= time)\n\t\t\t\t{\n\t\t\t\t\tc_right_arrow->OnPress();\n\t\t\t\t}\n\t\t\t\tarrow_counter_right = 0;\n\t\t\t}\n\t\t}\n\n\t\tif (arrow_counter_left < time)\n\t\t{\n\t\t\tarrow_counter_left++;\n\n\t\t\tif (arrow_counter_left == time)\n\t\t\t\tc_left_arrow->OnPress();\n\t\t}\n\n\t\tif (arrow_counter_right < time)\n\t\t{\n\t\t\tarrow_counter_right++;\n\n\t\t\tif (arrow_counter_right == time)\n\t\t\t\tc_right_arrow->OnPress();\n\t\t}\n\n\t\tint total = 0;\n\t\tfor (int j = 0; j < 4; j++)\n\t\t{\n\t\t\tif (players_ready[j])\n\t\t\t\ttotal++;\n\n\t\t\tif (total == 4)\n\t\t\t{\n\t\t\t\tunsigned int k = App->rnd->RandomInt(1, 4);\n\n\t\t\t\tswitch (votes[k])\n\t\t\t\t{\n\t\t\t\tcase 1:\n\t\t\t\t\tApp->resource_manager->LoadSceneFromAssets(path_map1.data());\n\t\t\t\t\tbreak;\n\t\t\t\tcase 2:\n\t\t\t\t\tApp->resource_manager->LoadSceneFromAssets(path_map2.data());\n\t\t\t\t\tbreak;\n\t\t\t\tcase 3:\n\t\t\t\t\tApp->resource_manager->LoadSceneFromAssets(path_map3.data());\n\t\t\t\t\tbreak;\n\t\t\t\tdefault:\n\t\t\t\t\t\/\/ Error Reset, but loads map 1 instead (because we need to cover bugs lol lmao pls don't kill me)\n\t\t\t\t\tApp->resource_manager->LoadSceneFromAssets(path_map1.data());\n\t\t\t\t\tbreak;\n\n\t\t\t\t}\n\t\t\t}\n\t\t\telse\n\t\t\t\ttotal = 0; \/\/ Redundancy\n\t\t}\n\t}\n\n\tvoid MapSelectUI_OnFocus()\n\t{\n\n\t}\n}\n<|endoftext|>"} {"text":"<commit_before>#include \"stdafx.h\"\n#include \"Unit.h\"\n#include \"Scheduler.h\"\n#include \"GameManager.h\"\n#include \"Player.h\"\n#include \"ClientSession.h\"\n\nUnit::Unit()\n{\n static int makeId = 0;\n m_UnitID = ++makeId;\n\n m_Owner = nullptr;\n m_Hp = m_MaxHp = -1;\n m_Damage = 0;\n m_Speed = -1;\n m_Contacting = false;\n m_TargetPos = { -1, -1 };\n m_Body = nullptr;\n\n m_State = m_StandbyState = new StandbyState;\n m_MovingState = new MovingState;\n m_CrashedState = new CrashedState;\n}\n\nUnit::~Unit()\n{\n delete m_StandbyState;\n delete m_MovingState;\n delete m_CrashedState;\n}\n\n\nvoid Unit::Moving()\n{\n auto curPos = m_Body->GetPosition();\n auto distance = m_TargetPos - curPos;\n if (distance.Length() < 0.5f)\n {\n EndMove();\n printf(\" - Reach: UnitID: %d, \\t\\t\\t x : %.f \\t y : %.f\\n\", INIT_TYPE(m_UnitID),\n EXTEND(curPos.x), EXTEND(curPos.y));\n }\n}\n\nvoid Unit::Crashing(bool isCrashing)\n{\n switch (GET_MAIN_TYPE(m_UnitID))\n {\n case UNIT_HERO:\n if (m_Hp <= 0) IamDead();\n break;\n case UNIT_MISSILE:\n isCrashing = false;\n Extinction();\n break;\n case UNIT_OBSTRUCT:\n break;\n\n };\n\n auto client = m_Owner->GetClient();\n if (client == nullptr)\n {\n\t\tEndCrash();\n\t\tprintf(\" - Crashing Failed ! : client is invalid \\n\");\n return;\n }\n\n auto curPos = m_Body->GetPosition();\n auto expectPos = curPos;\n\n if (isCrashing)\n {\n auto velocity = m_Body->GetLinearVelocity();\n velocity *= 1.0f \/ DAMPING;\n expectPos += velocity;\n printf(\" - Crashing: UnitID: %d, \\t expectPos: x : %.f \\t y : %.f\\n\", INIT_TYPE(m_UnitID),\n EXTEND(expectPos.x), EXTEND(expectPos.y));\n } \n else\n {\n EndCrash();\n }\n\n client->CrashedBroadCast(m_UnitID, curPos, expectPos, isCrashing);\n}\n\n\nvoid Unit::TryMove(b2Vec2 currentPos, b2Vec2 targetPos)\n{\n auto client = m_Owner->GetClient();\n if (client == nullptr)\n {\n printf(\" - TryMove Failed ! : client is invalid \\n\");\n return;\n }\n\n auto displacement = targetPos - m_Body->GetPosition();\n if (displacement.Normalize() < 0.5f)\n {\n m_Body->SetLinearVelocity(b2Vec2(0, 0));\n return;\n }\n displacement *= m_Speed;\n m_Body->SetLinearVelocity(displacement);\n\n m_TargetPos = targetPos;\n m_State->TryMove(this);\n\n client->SendHeroInfo(m_UnitID, currentPos, m_TargetPos);\n}\n\nvoid Unit::Damaged(int damage)\n{\n m_Hp -= damage;\n m_Owner->GetClient()->HpBroadCast(m_Owner->GetPlayerID(), m_UnitID, m_Hp);\n\n switch (GET_MAIN_TYPE(m_UnitID))\n {\n case UNIT_HERO:\n if (m_Hp <= 0)\n {\n CallFuncAfter(MANAGER_UPDATE_INTERVAL, GGameManager, &GameManager::GameOver, m_Owner);\n }\n break;\n case UNIT_OBSTRUCT:\n if (m_Hp <= 0)\n {\n\n }\n break;\n default:\n break;\n }\n}\n\nvoid Unit::IamDead()\n{\n\n}\n<commit_msg>[S]공백 커밋<commit_after>#include \"stdafx.h\"\n#include \"Unit.h\"\n#include \"Scheduler.h\"\n#include \"GameManager.h\"\n#include \"Player.h\"\n#include \"ClientSession.h\"\n\nUnit::Unit()\n{\n static int makeId = 0;\n m_UnitID = ++makeId;\n\n m_Owner = nullptr;\n m_Hp = m_MaxHp = -1;\n m_Damage = 0;\n m_Speed = -1;\n m_Contacting = false;\n m_TargetPos = { -1, -1 };\n m_Body = nullptr;\n\n m_State = m_StandbyState = new StandbyState;\n m_MovingState = new MovingState;\n m_CrashedState = new CrashedState;\n}\n\nUnit::~Unit()\n{\n delete m_StandbyState;\n delete m_MovingState;\n delete m_CrashedState;\n}\n\n\nvoid Unit::Moving()\n{\n auto curPos = m_Body->GetPosition();\n auto distance = m_TargetPos - curPos;\n if (distance.Length() < 0.5f)\n {\n EndMove();\n printf(\" - Reach: UnitID: %d, \\t\\t\\t x : %.f \\t y : %.f\\n\", INIT_TYPE(m_UnitID),\n EXTEND(curPos.x), EXTEND(curPos.y));\n }\n}\n\nvoid Unit::Crashing(bool isCrashing)\n{\n switch (GET_MAIN_TYPE(m_UnitID))\n {\n case UNIT_HERO:\n if (m_Hp <= 0) IamDead();\n break;\n case UNIT_MISSILE:\n isCrashing = false;\n Extinction();\n break;\n case UNIT_OBSTRUCT:\n break;\n\n };\n\n auto client = m_Owner->GetClient();\n if (client == nullptr)\n {\n\t\tEndCrash();\n\t\tprintf(\" - Crashing Failed ! : client is invalid \\n\");\n return;\n }\n\n auto curPos = m_Body->GetPosition();\n auto expectPos = curPos;\n\n if (isCrashing)\n {\n auto velocity = m_Body->GetLinearVelocity();\n velocity *= 1.0f \/ DAMPING;\n expectPos += velocity;\n printf(\" - Crashing: UnitID: %d, \\t expectPos: x : %.f \\t y : %.f\\n\", INIT_TYPE(m_UnitID),\n EXTEND(expectPos.x), EXTEND(expectPos.y));\n } \n else\n {\n EndCrash();\n }\n\n client->CrashedBroadCast(m_UnitID, curPos, expectPos, isCrashing);\n}\n\n\nvoid Unit::TryMove(b2Vec2 currentPos, b2Vec2 targetPos)\n{\n auto client = m_Owner->GetClient();\n if (client == nullptr)\n {\n printf(\" - TryMove Failed ! : client is invalid \\n\");\n return;\n }\n\n auto displacement = targetPos - m_Body->GetPosition();\n if (displacement.Normalize() < 0.5f)\n {\n m_Body->SetLinearVelocity(b2Vec2(0, 0));\n return;\n }\n displacement *= m_Speed;\n m_Body->SetLinearVelocity(displacement);\n\n m_TargetPos = targetPos;\n m_State->TryMove(this);\n\n client->SendHeroInfo(m_UnitID, currentPos, m_TargetPos);\n}\n\nvoid Unit::Damaged(int damage)\n{\n m_Hp -= damage;\n m_Owner->GetClient()->HpBroadCast(m_Owner->GetPlayerID(), m_UnitID, m_Hp);\n\n switch (GET_MAIN_TYPE(m_UnitID))\n {\n case UNIT_HERO:\n if (m_Hp <= 0)\n {\n CallFuncAfter(MANAGER_UPDATE_INTERVAL, GGameManager, &GameManager::GameOver, m_Owner);\n }\n break;\n case UNIT_OBSTRUCT:\n if (m_Hp <= 0)\n {\n\n \n }\n break;\n default:\n break;\n }\n}\n\nvoid Unit::IamDead()\n{\n\n}\n<|endoftext|>"} {"text":"<commit_before>\/\/\n\/\/ Copyright (c) 2014-2015, THUNDERBEAST GAMES LLC All rights reserved\n\/\/\n\/\/ Permission is hereby granted, free of charge, to any person obtaining a copy\n\/\/ of this software and associated documentation files (the \"Software\"), to deal\n\/\/ in the Software without restriction, including without limitation the rights\n\/\/ to use, copy, modify, merge, publish, distribute, sublicense, and\/or sell\n\/\/ copies of the Software, and to permit persons to whom the Software is\n\/\/ furnished to do so, subject to the following conditions:\n\/\/\n\/\/ The above copyright notice and this permission notice shall be included in\n\/\/ all copies or substantial portions of the Software.\n\/\/\n\/\/ THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\n\/\/ IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\n\/\/ FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE\n\/\/ AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\n\/\/ LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,\n\/\/ OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN\n\/\/ THE SOFTWARE.\n\/\/\n\n#include \"..\/Precompiled.h\"\n\n#include \"..\/Core\/Profiler.h\"\n#include \"..\/Container\/HashMap.h\"\n#include \"..\/IO\/BufferQueue.h\"\n#include \"..\/IO\/Log.h\"\n#include \"..\/Web\/WebRequest.h\"\n\n#ifdef EMSCRIPTEN\n\n#include \"..\/DebugNew.h\"\n\/\/ Add code to use an XMLHttpRequest or ActiveX XMLHttpRequest here.\n\n#else\n\n#include \"..\/Web\/WebInternalConfig.h\"\n#include <asio.hpp>\n#include <functional>\n#include <curl\/curl.h>\n\n#include \"..\/DebugNew.h\"\n\nnamespace Atomic\n{\n\nstruct WebRequestInternalState\n{\n \/\/\/ The WebRequest external state.\n WebRequest& es;\n \/\/\/ The WebRequest external state to force it to stay around.\n SharedPtr<WebRequest> es_hold;\n \/\/\/ The work queue.\n asio::io_service* service;\n \/\/\/ URL.\n String url;\n \/\/\/ Verb.\n String verb;\n \/\/\/ Response headers.\n HashMap<StringHash, Pair<String, String>> responseHeaders;\n \/\/\/ Upload stream.\n SharedPtr<Object> upload;\n \/\/\/ Download stream.\n SharedPtr<Object> download;\n \/\/\/ Request Headers.\n curl_slist* headers = NULL;\n \/\/\/ Connection state.\n WebRequestState state;\n \/\/\/ cURL multi handle.\n CURLM* curlm;\n \/\/\/ cURL easy handle.\n CURL* curl;\n \/\/\/ A flag to know if the request has contents (has data to upload).\n curl_off_t requestContentSize;\n \/\/\/ A flag to know if the operation has been aborted.\n bool isAborted;\n \/\/\/ A flag to know if the easy handle has been added to the Web class's multi handle.\n bool isAddedToMulti;\n \/\/\/ Error string. Empty if no error.\n char error[CURL_ERROR_SIZE];\n\n WebRequestInternalState(WebRequest &es_) :\n es(es_)\n {\n LOGDEBUG(\"Create WebRequestInternalState\");\n }\n\n ~WebRequestInternalState()\n {\n LOGDEBUG(\"Destroy WebRequestInternalState\");\n }\n\n static int onProgress(void *clientp, curl_off_t dltotal, curl_off_t dlnow, curl_off_t ultotal, curl_off_t ulnow)\n {\n WebRequestInternalState *is_(reinterpret_cast<WebRequestInternalState*>(clientp));\n if (is_->isAborted)\n {\n \/\/ This should probably be CURL_XFERINFO_ABORT, but that doesn't\n \/\/ exist. It probably would be the same numeric value, if it did.\n \/\/ The docs say that it just has to be a nonzero to abort.\n return CURL_READFUNC_ABORT;\n }\n\n VariantMap eventData;\n eventData.Insert(MakePair(StringHash(\"down_total\"), Variant((double)dltotal)));\n eventData.Insert(MakePair(StringHash(\"down_loaded\"), Variant((double)dlnow)));\n eventData.Insert(MakePair(StringHash(\"up_total\"), Variant((double)ultotal)));\n eventData.Insert(MakePair(StringHash(\"up_loaded\"), Variant((double)ulnow)));\n is_->es.SendEvent(\"progress\", eventData);\n return 0;\n }\n\n static size_t onHeader(char *ptr, size_t size, size_t nmemb, void *userdata)\n {\n WebRequestInternalState *is_(reinterpret_cast<WebRequestInternalState*>(userdata));\n if (is_->isAborted)\n {\n is_->state = HTTP_CLOSED;\n \/\/ This should probably be CURL_HEADERFUNC_ABORT, but that doesn't\n \/\/ exist. It probably would be the same numeric value, if it did.\n \/\/ The docs say that it just has to be a number of bytes that is\n \/\/ not \"size * nmemb\" to abort.\n return CURL_READFUNC_ABORT;\n }\n\n \/\/ Find the size in bytes.\n size_t real_size(size * nmemb);\n\n \/\/ Check for some known values.\n if (real_size == 2 && ptr[0] == '\\r' && ptr[1] == '\\n')\n {\n return real_size;\n }\n if (real_size > 5 && !strncmp(ptr, \"HTTP\/\", 5))\n {\n return real_size;\n }\n\n \/\/ Get the header key and value, and add them to the map.\n unsigned int key_end = 0;\n unsigned int value_begin = 2;\n while (value_begin < real_size)\n {\n if (ptr[key_end] == ':' && ptr[key_end + 1] == ' ')\n {\n break;\n }\n ++key_end;\n ++value_begin;\n }\n if (value_begin == real_size)\n {\n String key(ptr, (unsigned int)real_size);\n is_->responseHeaders.InsertNew(key.ToUpper(), MakePair(key, String()));\n }\n else\n {\n String key(ptr, (unsigned int)key_end);\n is_->responseHeaders.InsertNew(key.ToUpper(), MakePair(key, String(ptr + value_begin, (unsigned int)real_size - value_begin - 2)));\n }\n\n return real_size;\n }\n\n static size_t onWrite(char *ptr, size_t size, size_t nmemb, void *userdata)\n {\n WebRequestInternalState *is_(reinterpret_cast<WebRequestInternalState*>(userdata));\n is_->state = HTTP_OPEN;\n if (is_->isAborted)\n {\n is_->state = HTTP_CLOSED;\n \/\/ This should probably be CURL_WRITEFUNC_ABORT, but that doesn't\n \/\/ exist. It probably would be the same numeric value, if it did.\n \/\/ The docs say that it just has to be a number of bytes that is\n \/\/ not \"size * nmemb\" to abort.\n return CURL_READFUNC_ABORT;\n }\n\n \/\/ Find the size in bytes.\n size_t real_size(size * nmemb);\n\n \/\/ Write the date into the download buffer queue.\n Serializer* download(dynamic_cast<Serializer*>(is_->download.Get()));\n download->Write(ptr, (unsigned int)real_size);\n\n \/\/ Emit a \"download_chunk\" event.\n VariantMap eventData;\n eventData.Insert(MakePair(StringHash(\"download\"), Variant(is_->download)));\n eventData.Insert(MakePair(StringHash(\"size\"), Variant((unsigned int)real_size)));\n is_->es.SendEvent(\"download_chunk\", eventData);\n\n return real_size;\n }\n\n static size_t onRead(char *buffer, size_t size, size_t nitems, void *instream)\n {\n WebRequestInternalState *is_(reinterpret_cast<WebRequestInternalState*>(instream));\n is_->state = HTTP_OPEN;\n if (is_->isAborted)\n {\n is_->state = HTTP_CLOSED;\n return CURL_READFUNC_ABORT;\n }\n\n \/\/ Find the size in bytes.\n size_t real_size(size * nitems);\n\n \/\/ Read as much as we can from the upload buffer queue.\n Deserializer* upload(dynamic_cast<Deserializer*>(is_->upload.Get()));\n size_t size_queued(upload->GetSize());\n size_t size_left(real_size);\n if ((size_left > 0) && (size_queued > 0))\n {\n size_t read_size(std::min(size_queued, size_left));\n upload->Read(buffer, (unsigned int)read_size);\n size_left -= read_size;\n }\n\n \/\/ If we still have bytes to fill, then emit a \"upload_chunk\" event.\n if (size_left > 0)\n {\n VariantMap eventData;\n eventData.Insert(MakePair(StringHash(\"upload\"), Variant(is_->upload)));\n eventData.Insert(MakePair(StringHash(\"size\"), Variant((unsigned int)size_left)));\n is_->es.SendEvent(\"upload_chunk\", eventData);\n }\n\n \/\/ Read as much as we can from the upload buffer queue (again).\n size_queued = upload->GetSize();\n size_left = real_size;\n if ((size_left > 0) && (size_queued > 0))\n {\n size_t read_size(std::min(size_queued, size_left));\n upload->Read(buffer, (unsigned int)read_size);\n size_left -= read_size;\n }\n\n \/\/ If we still have bytes to fill, then something went wrong, so we should abort.\n if (size_left > 0)\n {\n is_->isAborted = true;\n return CURL_READFUNC_ABORT;\n }\n\n return real_size;\n }\n\n void onEnd(int code)\n {\n VariantMap eventData;\n if (code != CURLE_OK)\n {\n state = HTTP_ERROR;\n eventData.Insert(MakePair(StringHash(\"error\"), Variant(String(error, (unsigned int)strnlen(error, sizeof(error))))));\n }\n else\n {\n state = HTTP_CLOSED;\n eventData.Insert(MakePair(StringHash(\"download\"), Variant(download)));\n eventData.Insert(MakePair(StringHash(\"upload\"), Variant(upload)));\n }\n es.SendEvent(\"complete\", eventData);\n }\n};\n\nWebRequest::WebRequest(Context* context, const String& verb, const String& url, double requestContentSize) :\n Object(context),\n is_(new WebRequestInternalState(*this))\n{\n is_->url = url.Trimmed();\n is_->verb = verb;\n is_->upload = new BufferQueue(context);\n is_->download = new BufferQueue(context);\n is_->state = HTTP_INITIALIZING;\n is_->curlm = NULL;\n is_->curl = NULL;\n is_->requestContentSize = curl_off_t(std::floor(requestContentSize));\n is_->isAborted = false;\n is_->isAddedToMulti = false;\n\n}\n\nWebRequest::~WebRequest()\n{\n LOGDEBUG(\"Destroy WebRequest\");\n\n curl_slist_free_all(is_->headers);\n if (is_->curlm == NULL)\n {\n return;\n }\n curl_easy_cleanup(is_->curl);\n delete is_;\n}\n\nvoid WebRequest::setup(asio::io_service *service, CURLM *curlm)\n{\n LOGDEBUG(\"Create WebRequest\");\n\n is_->service = service;\n is_->curlm = curlm;\n is_->curl = curl_easy_init();\n\n LOGDEBUG(\"HTTP \" + is_->verb + \" request to URL \" + is_->url);\n\n curl_easy_setopt(is_->curl, CURLOPT_ERRORBUFFER, is_->error);\n is_->error[0] = '\\0';\n\n \/\/ This line will eventually go away with a CA bundle in place, or other TLS options.\n curl_easy_setopt(is_->curl, CURLOPT_SSL_VERIFYPEER, FALSE);\n\n curl_easy_setopt(is_->curl, CURLOPT_URL, is_->url.CString());\n\n \/\/ All callbacks must look at is_->isAborted flag!\n\n curl_easy_setopt(is_->curl, CURLOPT_HEADERFUNCTION, &WebRequestInternalState::onHeader);\n curl_easy_setopt(is_->curl, CURLOPT_HEADERDATA, is_);\n\n curl_easy_setopt(is_->curl, CURLOPT_WRITEFUNCTION, &WebRequestInternalState::onWrite);\n curl_easy_setopt(is_->curl, CURLOPT_WRITEDATA, is_);\n\n curl_easy_setopt(is_->curl, CURLOPT_NOPROGRESS, 0L);\n curl_easy_setopt(is_->curl, CURLOPT_XFERINFOFUNCTION, &WebRequestInternalState::onProgress);\n curl_easy_setopt(is_->curl, CURLOPT_XFERINFODATA, is_);\n\n curl_easy_setopt(is_->curl, CURLOPT_CUSTOMREQUEST, is_->verb.CString());\n\n curl_easy_setopt(is_->curl, CURLOPT_PRIVATE, this);\n\n curl_easy_setopt(is_->curl, CURLOPT_READFUNCTION, &WebRequestInternalState::onRead);\n curl_easy_setopt(is_->curl, CURLOPT_READDATA, is_);\n\n if (is_->requestContentSize)\n {\n curl_easy_setopt(is_->curl, CURLOPT_UPLOAD, 1L);\n curl_easy_setopt(is_->curl, CURLOPT_INFILESIZE_LARGE, is_->requestContentSize);\n }\n}\n\nvoid WebRequest::internalNotify(WebRequest *wr, int code)\n{\n wr->is_->onEnd(code);\n if (wr->is_->isAddedToMulti)\n {\n curl_multi_remove_handle(wr->is_->curlm, wr->is_->curl);\n wr->is_->isAddedToMulti = false;\n wr->is_->es_hold.Reset();\n }\n}\n\nvoid WebRequest::Abort()\n{\n is_->isAborted = true;\n}\n\nconst String& WebRequest::GetURL() const\n{\n return is_->url;\n}\n\nString WebRequest::GetError() const\n{\n return String(is_->error);\n}\n\nWebRequestState WebRequest::GetState() const\n{\n return is_->state;\n}\n\nString WebRequest::GetVerb() const\n{\n return is_->verb;\n}\n\nbool WebRequest::HasDownloadChunkEvent()\n{\n return true; \/\/ cURL based implementations always support the \"download_chunk\" event.\n}\n\nvoid WebRequest::SetRequestHeader(const String& key, const String& value)\n{\n \/\/ Trim and only add non-empty header strings.\n String header;\n header += key.Trimmed();\n header += \": \";\n header += value;\n if (header.Length())\n {\n is_->headers = curl_slist_append(is_->headers, header.CString());\n }\n}\n\nvoid WebRequest::Send()\n{\n if (!is_->isAddedToMulti && !is_->isAborted)\n {\n is_->es_hold = this;\n curl_easy_setopt(is_->curl, CURLOPT_HTTPHEADER, is_->headers);\n curl_multi_add_handle(is_->curlm, is_->curl);\n is_->isAddedToMulti = true;\n }\n}\n\nStringVector WebRequest::GetResponseHeaderKeys()\n{\n StringVector keys;\n for (auto it(is_->responseHeaders.Begin()),\n itEnd(is_->responseHeaders.End()); it != itEnd; ++it)\n {\n keys.Push(it->second_.first_);\n }\n return keys;\n}\n\nString WebRequest::GetResponseHeader(const String& header)\n{\n auto it(is_->responseHeaders.Find(header.ToUpper()));\n if (it == is_->responseHeaders.End())\n {\n return \"\";\n }\n return it->second_.second_;\n}\n\nString WebRequest::GetAllResponseHeaders()\n{\n String allHeaders;\n for (auto it(is_->responseHeaders.Begin()),\n itEnd(is_->responseHeaders.End()); it != itEnd; ++it)\n {\n allHeaders += it->second_.first_;\n allHeaders += \": \";\n allHeaders += it->second_.second_;\n allHeaders += \"\\r\\n\";\n }\n return allHeaders;\n}\n\n}\n\n#endif\n<commit_msg>Not using FALSE, which may not be defined.<commit_after>\/\/\n\/\/ Copyright (c) 2014-2015, THUNDERBEAST GAMES LLC All rights reserved\n\/\/\n\/\/ Permission is hereby granted, free of charge, to any person obtaining a copy\n\/\/ of this software and associated documentation files (the \"Software\"), to deal\n\/\/ in the Software without restriction, including without limitation the rights\n\/\/ to use, copy, modify, merge, publish, distribute, sublicense, and\/or sell\n\/\/ copies of the Software, and to permit persons to whom the Software is\n\/\/ furnished to do so, subject to the following conditions:\n\/\/\n\/\/ The above copyright notice and this permission notice shall be included in\n\/\/ all copies or substantial portions of the Software.\n\/\/\n\/\/ THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\n\/\/ IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\n\/\/ FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE\n\/\/ AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\n\/\/ LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,\n\/\/ OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN\n\/\/ THE SOFTWARE.\n\/\/\n\n#include \"..\/Precompiled.h\"\n\n#include \"..\/Core\/Profiler.h\"\n#include \"..\/Container\/HashMap.h\"\n#include \"..\/IO\/BufferQueue.h\"\n#include \"..\/IO\/Log.h\"\n#include \"..\/Web\/WebRequest.h\"\n\n#ifdef EMSCRIPTEN\n\n#include \"..\/DebugNew.h\"\n\/\/ Add code to use an XMLHttpRequest or ActiveX XMLHttpRequest here.\n\n#else\n\n#include \"..\/Web\/WebInternalConfig.h\"\n#include <asio.hpp>\n#include <functional>\n#include <curl\/curl.h>\n\n#include \"..\/DebugNew.h\"\n\nnamespace Atomic\n{\n\nstruct WebRequestInternalState\n{\n \/\/\/ The WebRequest external state.\n WebRequest& es;\n \/\/\/ The WebRequest external state to force it to stay around.\n SharedPtr<WebRequest> es_hold;\n \/\/\/ The work queue.\n asio::io_service* service;\n \/\/\/ URL.\n String url;\n \/\/\/ Verb.\n String verb;\n \/\/\/ Response headers.\n HashMap<StringHash, Pair<String, String>> responseHeaders;\n \/\/\/ Upload stream.\n SharedPtr<Object> upload;\n \/\/\/ Download stream.\n SharedPtr<Object> download;\n \/\/\/ Request Headers.\n curl_slist* headers = NULL;\n \/\/\/ Connection state.\n WebRequestState state;\n \/\/\/ cURL multi handle.\n CURLM* curlm;\n \/\/\/ cURL easy handle.\n CURL* curl;\n \/\/\/ A flag to know if the request has contents (has data to upload).\n curl_off_t requestContentSize;\n \/\/\/ A flag to know if the operation has been aborted.\n bool isAborted;\n \/\/\/ A flag to know if the easy handle has been added to the Web class's multi handle.\n bool isAddedToMulti;\n \/\/\/ Error string. Empty if no error.\n char error[CURL_ERROR_SIZE];\n\n WebRequestInternalState(WebRequest &es_) :\n es(es_)\n {\n LOGDEBUG(\"Create WebRequestInternalState\");\n }\n\n ~WebRequestInternalState()\n {\n LOGDEBUG(\"Destroy WebRequestInternalState\");\n }\n\n static int onProgress(void *clientp, curl_off_t dltotal, curl_off_t dlnow, curl_off_t ultotal, curl_off_t ulnow)\n {\n WebRequestInternalState *is_(reinterpret_cast<WebRequestInternalState*>(clientp));\n if (is_->isAborted)\n {\n \/\/ This should probably be CURL_XFERINFO_ABORT, but that doesn't\n \/\/ exist. It probably would be the same numeric value, if it did.\n \/\/ The docs say that it just has to be a nonzero to abort.\n return CURL_READFUNC_ABORT;\n }\n\n VariantMap eventData;\n eventData.Insert(MakePair(StringHash(\"down_total\"), Variant((double)dltotal)));\n eventData.Insert(MakePair(StringHash(\"down_loaded\"), Variant((double)dlnow)));\n eventData.Insert(MakePair(StringHash(\"up_total\"), Variant((double)ultotal)));\n eventData.Insert(MakePair(StringHash(\"up_loaded\"), Variant((double)ulnow)));\n is_->es.SendEvent(\"progress\", eventData);\n return 0;\n }\n\n static size_t onHeader(char *ptr, size_t size, size_t nmemb, void *userdata)\n {\n WebRequestInternalState *is_(reinterpret_cast<WebRequestInternalState*>(userdata));\n if (is_->isAborted)\n {\n is_->state = HTTP_CLOSED;\n \/\/ This should probably be CURL_HEADERFUNC_ABORT, but that doesn't\n \/\/ exist. It probably would be the same numeric value, if it did.\n \/\/ The docs say that it just has to be a number of bytes that is\n \/\/ not \"size * nmemb\" to abort.\n return CURL_READFUNC_ABORT;\n }\n\n \/\/ Find the size in bytes.\n size_t real_size(size * nmemb);\n\n \/\/ Check for some known values.\n if (real_size == 2 && ptr[0] == '\\r' && ptr[1] == '\\n')\n {\n return real_size;\n }\n if (real_size > 5 && !strncmp(ptr, \"HTTP\/\", 5))\n {\n return real_size;\n }\n\n \/\/ Get the header key and value, and add them to the map.\n unsigned int key_end = 0;\n unsigned int value_begin = 2;\n while (value_begin < real_size)\n {\n if (ptr[key_end] == ':' && ptr[key_end + 1] == ' ')\n {\n break;\n }\n ++key_end;\n ++value_begin;\n }\n if (value_begin == real_size)\n {\n String key(ptr, (unsigned int)real_size);\n is_->responseHeaders.InsertNew(key.ToUpper(), MakePair(key, String()));\n }\n else\n {\n String key(ptr, (unsigned int)key_end);\n is_->responseHeaders.InsertNew(key.ToUpper(), MakePair(key, String(ptr + value_begin, (unsigned int)real_size - value_begin - 2)));\n }\n\n return real_size;\n }\n\n static size_t onWrite(char *ptr, size_t size, size_t nmemb, void *userdata)\n {\n WebRequestInternalState *is_(reinterpret_cast<WebRequestInternalState*>(userdata));\n is_->state = HTTP_OPEN;\n if (is_->isAborted)\n {\n is_->state = HTTP_CLOSED;\n \/\/ This should probably be CURL_WRITEFUNC_ABORT, but that doesn't\n \/\/ exist. It probably would be the same numeric value, if it did.\n \/\/ The docs say that it just has to be a number of bytes that is\n \/\/ not \"size * nmemb\" to abort.\n return CURL_READFUNC_ABORT;\n }\n\n \/\/ Find the size in bytes.\n size_t real_size(size * nmemb);\n\n \/\/ Write the date into the download buffer queue.\n Serializer* download(dynamic_cast<Serializer*>(is_->download.Get()));\n download->Write(ptr, (unsigned int)real_size);\n\n \/\/ Emit a \"download_chunk\" event.\n VariantMap eventData;\n eventData.Insert(MakePair(StringHash(\"download\"), Variant(is_->download)));\n eventData.Insert(MakePair(StringHash(\"size\"), Variant((unsigned int)real_size)));\n is_->es.SendEvent(\"download_chunk\", eventData);\n\n return real_size;\n }\n\n static size_t onRead(char *buffer, size_t size, size_t nitems, void *instream)\n {\n WebRequestInternalState *is_(reinterpret_cast<WebRequestInternalState*>(instream));\n is_->state = HTTP_OPEN;\n if (is_->isAborted)\n {\n is_->state = HTTP_CLOSED;\n return CURL_READFUNC_ABORT;\n }\n\n \/\/ Find the size in bytes.\n size_t real_size(size * nitems);\n\n \/\/ Read as much as we can from the upload buffer queue.\n Deserializer* upload(dynamic_cast<Deserializer*>(is_->upload.Get()));\n size_t size_queued(upload->GetSize());\n size_t size_left(real_size);\n if ((size_left > 0) && (size_queued > 0))\n {\n size_t read_size(std::min(size_queued, size_left));\n upload->Read(buffer, (unsigned int)read_size);\n size_left -= read_size;\n }\n\n \/\/ If we still have bytes to fill, then emit a \"upload_chunk\" event.\n if (size_left > 0)\n {\n VariantMap eventData;\n eventData.Insert(MakePair(StringHash(\"upload\"), Variant(is_->upload)));\n eventData.Insert(MakePair(StringHash(\"size\"), Variant((unsigned int)size_left)));\n is_->es.SendEvent(\"upload_chunk\", eventData);\n }\n\n \/\/ Read as much as we can from the upload buffer queue (again).\n size_queued = upload->GetSize();\n size_left = real_size;\n if ((size_left > 0) && (size_queued > 0))\n {\n size_t read_size(std::min(size_queued, size_left));\n upload->Read(buffer, (unsigned int)read_size);\n size_left -= read_size;\n }\n\n \/\/ If we still have bytes to fill, then something went wrong, so we should abort.\n if (size_left > 0)\n {\n is_->isAborted = true;\n return CURL_READFUNC_ABORT;\n }\n\n return real_size;\n }\n\n void onEnd(int code)\n {\n VariantMap eventData;\n if (code != CURLE_OK)\n {\n state = HTTP_ERROR;\n eventData.Insert(MakePair(StringHash(\"error\"), Variant(String(error, (unsigned int)strnlen(error, sizeof(error))))));\n }\n else\n {\n state = HTTP_CLOSED;\n eventData.Insert(MakePair(StringHash(\"download\"), Variant(download)));\n eventData.Insert(MakePair(StringHash(\"upload\"), Variant(upload)));\n }\n es.SendEvent(\"complete\", eventData);\n }\n};\n\nWebRequest::WebRequest(Context* context, const String& verb, const String& url, double requestContentSize) :\n Object(context),\n is_(new WebRequestInternalState(*this))\n{\n is_->url = url.Trimmed();\n is_->verb = verb;\n is_->upload = new BufferQueue(context);\n is_->download = new BufferQueue(context);\n is_->state = HTTP_INITIALIZING;\n is_->curlm = NULL;\n is_->curl = NULL;\n is_->requestContentSize = curl_off_t(std::floor(requestContentSize));\n is_->isAborted = false;\n is_->isAddedToMulti = false;\n\n}\n\nWebRequest::~WebRequest()\n{\n LOGDEBUG(\"Destroy WebRequest\");\n\n curl_slist_free_all(is_->headers);\n if (is_->curlm == NULL)\n {\n return;\n }\n curl_easy_cleanup(is_->curl);\n delete is_;\n}\n\nvoid WebRequest::setup(asio::io_service *service, CURLM *curlm)\n{\n LOGDEBUG(\"Create WebRequest\");\n\n is_->service = service;\n is_->curlm = curlm;\n is_->curl = curl_easy_init();\n\n LOGDEBUG(\"HTTP \" + is_->verb + \" request to URL \" + is_->url);\n\n curl_easy_setopt(is_->curl, CURLOPT_ERRORBUFFER, is_->error);\n is_->error[0] = '\\0';\n\n \/\/ This line will eventually go away with a CA bundle in place, or other TLS options.\n curl_easy_setopt(is_->curl, CURLOPT_SSL_VERIFYPEER, 0);\n\n curl_easy_setopt(is_->curl, CURLOPT_URL, is_->url.CString());\n\n \/\/ All callbacks must look at is_->isAborted flag!\n\n curl_easy_setopt(is_->curl, CURLOPT_HEADERFUNCTION, &WebRequestInternalState::onHeader);\n curl_easy_setopt(is_->curl, CURLOPT_HEADERDATA, is_);\n\n curl_easy_setopt(is_->curl, CURLOPT_WRITEFUNCTION, &WebRequestInternalState::onWrite);\n curl_easy_setopt(is_->curl, CURLOPT_WRITEDATA, is_);\n\n curl_easy_setopt(is_->curl, CURLOPT_NOPROGRESS, 0L);\n curl_easy_setopt(is_->curl, CURLOPT_XFERINFOFUNCTION, &WebRequestInternalState::onProgress);\n curl_easy_setopt(is_->curl, CURLOPT_XFERINFODATA, is_);\n\n curl_easy_setopt(is_->curl, CURLOPT_CUSTOMREQUEST, is_->verb.CString());\n\n curl_easy_setopt(is_->curl, CURLOPT_PRIVATE, this);\n\n curl_easy_setopt(is_->curl, CURLOPT_READFUNCTION, &WebRequestInternalState::onRead);\n curl_easy_setopt(is_->curl, CURLOPT_READDATA, is_);\n\n if (is_->requestContentSize)\n {\n curl_easy_setopt(is_->curl, CURLOPT_UPLOAD, 1L);\n curl_easy_setopt(is_->curl, CURLOPT_INFILESIZE_LARGE, is_->requestContentSize);\n }\n}\n\nvoid WebRequest::internalNotify(WebRequest *wr, int code)\n{\n wr->is_->onEnd(code);\n if (wr->is_->isAddedToMulti)\n {\n curl_multi_remove_handle(wr->is_->curlm, wr->is_->curl);\n wr->is_->isAddedToMulti = false;\n wr->is_->es_hold.Reset();\n }\n}\n\nvoid WebRequest::Abort()\n{\n is_->isAborted = true;\n}\n\nconst String& WebRequest::GetURL() const\n{\n return is_->url;\n}\n\nString WebRequest::GetError() const\n{\n return String(is_->error);\n}\n\nWebRequestState WebRequest::GetState() const\n{\n return is_->state;\n}\n\nString WebRequest::GetVerb() const\n{\n return is_->verb;\n}\n\nbool WebRequest::HasDownloadChunkEvent()\n{\n return true; \/\/ cURL based implementations always support the \"download_chunk\" event.\n}\n\nvoid WebRequest::SetRequestHeader(const String& key, const String& value)\n{\n \/\/ Trim and only add non-empty header strings.\n String header;\n header += key.Trimmed();\n header += \": \";\n header += value;\n if (header.Length())\n {\n is_->headers = curl_slist_append(is_->headers, header.CString());\n }\n}\n\nvoid WebRequest::Send()\n{\n if (!is_->isAddedToMulti && !is_->isAborted)\n {\n is_->es_hold = this;\n curl_easy_setopt(is_->curl, CURLOPT_HTTPHEADER, is_->headers);\n curl_multi_add_handle(is_->curlm, is_->curl);\n is_->isAddedToMulti = true;\n }\n}\n\nStringVector WebRequest::GetResponseHeaderKeys()\n{\n StringVector keys;\n for (auto it(is_->responseHeaders.Begin()),\n itEnd(is_->responseHeaders.End()); it != itEnd; ++it)\n {\n keys.Push(it->second_.first_);\n }\n return keys;\n}\n\nString WebRequest::GetResponseHeader(const String& header)\n{\n auto it(is_->responseHeaders.Find(header.ToUpper()));\n if (it == is_->responseHeaders.End())\n {\n return \"\";\n }\n return it->second_.second_;\n}\n\nString WebRequest::GetAllResponseHeaders()\n{\n String allHeaders;\n for (auto it(is_->responseHeaders.Begin()),\n itEnd(is_->responseHeaders.End()); it != itEnd; ++it)\n {\n allHeaders += it->second_.first_;\n allHeaders += \": \";\n allHeaders += it->second_.second_;\n allHeaders += \"\\r\\n\";\n }\n return allHeaders;\n}\n\n}\n\n#endif\n<|endoftext|>"} {"text":"<commit_before>\/\/\n\/\/ Copyright (c) 2008-2019 the Urho3D project.\n\/\/\n\/\/ Permission is hereby granted, free of charge, to any person obtaining a copy\n\/\/ of this software and associated documentation files (the \"Software\"), to deal\n\/\/ in the Software without restriction, including without limitation the rights\n\/\/ to use, copy, modify, merge, publish, distribute, sublicense, and\/or sell\n\/\/ copies of the Software, and to permit persons to whom the Software is\n\/\/ furnished to do so, subject to the following conditions:\n\/\/\n\/\/ The above copyright notice and this permission notice shall be included in\n\/\/ all copies or substantial portions of the Software.\n\/\/\n\/\/ THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\n\/\/ IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\n\/\/ FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE\n\/\/ AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\n\/\/ LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,\n\/\/ OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN\n\/\/ THE SOFTWARE.\n\/\/\n\n#include \"..\/Precompiled.h\"\n\n#include \"..\/IO\/File.h\"\n#include \"..\/IO\/Log.h\"\n#include \"..\/IO\/PackageFile.h\"\n#include \"..\/IO\/FileSystem.h\"\n\nnamespace Urho3D\n{\n\nPackageFile::PackageFile(Context* context) :\n Object(context),\n totalSize_(0),\n totalDataSize_(0),\n checksum_(0),\n compressed_(false)\n{\n}\n\nPackageFile::PackageFile(Context* context, const ea::string& fileName, unsigned startOffset) :\n Object(context),\n totalSize_(0),\n totalDataSize_(0),\n checksum_(0),\n compressed_(false)\n{\n Open(fileName, startOffset);\n}\n\nPackageFile::~PackageFile() = default;\n\nbool PackageFile::Open(const ea::string& fileName, unsigned startOffset)\n{\n SharedPtr<File> file(new File(context_, fileName));\n if (!file->IsOpen())\n return false;\n\n \/\/ Check ID, then read the directory\n file->Seek(startOffset);\n ea::string id = file->ReadFileID();\n if (id != \"UPAK\" && id != \"ULZ4\")\n {\n \/\/ If start offset has not been explicitly specified, also try to read package size from the end of file\n \/\/ to know how much we must rewind to find the package start\n if (!startOffset)\n {\n unsigned fileSize = file->GetSize();\n file->Seek((unsigned)(fileSize - sizeof(unsigned)));\n unsigned newStartOffset = fileSize - file->ReadUInt();\n if (newStartOffset < fileSize)\n {\n startOffset = newStartOffset;\n file->Seek(startOffset);\n id = file->ReadFileID();\n }\n }\n\n if (id != \"UPAK\" && id != \"ULZ4\")\n {\n URHO3D_LOGERROR(fileName + \" is not a valid package file\");\n return false;\n }\n }\n\n fileName_ = fileName;\n nameHash_ = fileName_;\n totalSize_ = file->GetSize();\n compressed_ = id == \"ULZ4\";\n\n unsigned numFiles = file->ReadUInt();\n checksum_ = file->ReadUInt();\n\n for (unsigned i = 0; i < numFiles; ++i)\n {\n ea::string entryName = file->ReadString();\n PackageEntry newEntry{};\n newEntry.offset_ = file->ReadUInt() + startOffset;\n totalDataSize_ += (newEntry.size_ = file->ReadUInt());\n newEntry.checksum_ = file->ReadUInt();\n if (!compressed_ && newEntry.offset_ + newEntry.size_ > totalSize_)\n {\n URHO3D_LOGERROR(\"File entry \" + entryName + \" outside package file\");\n return false;\n }\n else\n entries_[entryName] = newEntry;\n }\n\n return true;\n}\n\nbool PackageFile::Exists(const ea::string& fileName) const\n{\n bool found = entries_.find(fileName) != entries_.end();\n\n#ifdef _WIN32\n \/\/ On Windows perform a fallback case-insensitive search\n if (!found)\n {\n for (auto i = entries_.begin(); i != entries_.end(); ++i)\n {\n if (!i->first.comparei(fileName))\n {\n found = true;\n break;\n }\n }\n }\n#endif\n\n return found;\n}\n\nconst PackageEntry* PackageFile::GetEntry(const ea::string& fileName) const\n{\n auto i = entries_.find(fileName);\n if (i != entries_.end())\n return &i->second;\n\n#ifdef _WIN32\n \/\/ On Windows perform a fallback case-insensitive search\n else\n {\n for (auto j = entries_.begin(); j != entries_.end(); ++j)\n {\n if (!j->first.comparei(fileName))\n return &j->second;\n }\n }\n#endif\n\n return nullptr;\n}\n\nvoid PackageFile::Scan(ea::vector<ea::string>& result, const ea::string& pathName, const ea::string& filter, bool recursive) const\n{\n result.clear();\n\n ea::string sanitizedPath = GetSanitizedPath(pathName);\n ea::string filterExtension = filter.substr(filter.find_last_of('.'));\n if (filterExtension.contains('*'))\n filterExtension.clear();\n\n bool caseSensitive = true;\n#ifdef _WIN32\n \/\/ On Windows ignore case in string comparisons\n caseSensitive = false;\n#endif\n\n const StringVector& entryNames = GetEntryNames();\n for (auto i = entryNames.begin(); i != entryNames.end(); ++i)\n {\n ea::string entryName = GetSanitizedPath(*i);\n if ((filterExtension.empty() || entryName.ends_with(filterExtension, caseSensitive)) &&\n entryName.starts_with(sanitizedPath, caseSensitive))\n {\n ea::string fileName = entryName.substr(sanitizedPath.length());\n if (fileName.starts_with(\"\\\\\") || fileName.starts_with(\"\/\"))\n fileName = fileName.substr(1, fileName.length() - 1);\n if (!recursive && (fileName.contains(\"\\\\\") || fileName.contains(\"\/\")))\n continue;\n\n result.push_back(fileName);\n }\n }\n}\n\n}\n<commit_msg>IO: Implement support for new rbfx pak format.<commit_after>\/\/\n\/\/ Copyright (c) 2008-2019 the Urho3D project.\n\/\/\n\/\/ Permission is hereby granted, free of charge, to any person obtaining a copy\n\/\/ of this software and associated documentation files (the \"Software\"), to deal\n\/\/ in the Software without restriction, including without limitation the rights\n\/\/ to use, copy, modify, merge, publish, distribute, sublicense, and\/or sell\n\/\/ copies of the Software, and to permit persons to whom the Software is\n\/\/ furnished to do so, subject to the following conditions:\n\/\/\n\/\/ The above copyright notice and this permission notice shall be included in\n\/\/ all copies or substantial portions of the Software.\n\/\/\n\/\/ THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\n\/\/ IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\n\/\/ FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE\n\/\/ AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\n\/\/ LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,\n\/\/ OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN\n\/\/ THE SOFTWARE.\n\/\/\n\n#include \"..\/Precompiled.h\"\n\n#include \"..\/IO\/File.h\"\n#include \"..\/IO\/Log.h\"\n#include \"..\/IO\/PackageFile.h\"\n#include \"..\/IO\/FileSystem.h\"\n\nnamespace Urho3D\n{\n\nPackageFile::PackageFile(Context* context) :\n Object(context),\n totalSize_(0),\n totalDataSize_(0),\n checksum_(0),\n compressed_(false)\n{\n}\n\nPackageFile::PackageFile(Context* context, const ea::string& fileName, unsigned startOffset) :\n Object(context),\n totalSize_(0),\n totalDataSize_(0),\n checksum_(0),\n compressed_(false)\n{\n Open(fileName, startOffset);\n}\n\nPackageFile::~PackageFile() = default;\n\nbool PackageFile::Open(const ea::string& fileName, unsigned startOffset)\n{\n SharedPtr<File> file(new File(context_, fileName));\n if (!file->IsOpen())\n return false;\n\n \/\/ Check ID, then read the directory\n file->Seek(startOffset);\n ea::string id = file->ReadFileID();\n if (id != \"UPAK\" && id != \"ULZ4\" && id != \"RPAK\" && id != \"RLZ4\")\n {\n \/\/ If start offset has not been explicitly specified, also try to read package size from the end of file\n \/\/ to know how much we must rewind to find the package start\n if (!startOffset)\n {\n unsigned fileSize = file->GetSize();\n file->Seek((unsigned)(fileSize - sizeof(unsigned)));\n unsigned newStartOffset = fileSize - file->ReadUInt();\n if (newStartOffset < fileSize)\n {\n startOffset = newStartOffset;\n file->Seek(startOffset);\n id = file->ReadFileID();\n }\n }\n\n if (id != \"UPAK\" && id != \"ULZ4\" && id != \"RPAK\" && id != \"RLZ4\")\n {\n URHO3D_LOGERROR(fileName + \" is not a valid package file\");\n return false;\n }\n }\n\n fileName_ = fileName;\n nameHash_ = fileName_;\n totalSize_ = file->GetSize();\n compressed_ = id == \"ULZ4\" || id == \"RLZ4\";\n unsigned numFiles = file->ReadUInt();\n checksum_ = file->ReadUInt();\n\n if (id == \"RPAK\" || id == \"RLZ4\")\n {\n \/\/ New PAK file format includes two extra PAK header fields:\n \/\/ * Version. At this time this field is unused and is always 0. It will be used in the future if PAK format needs to be extended.\n \/\/ * File list offset. New format writes file list in the end of the file. This allows PAK creation without knowing entire file list\n \/\/ beforehand.\n unsigned version = file->ReadUInt(); \/\/ Reserved for future use.\n assert(version == 0);\n int64_t fileListOffset = file->ReadInt64(); \/\/ New format has file list at the end of the file.\n file->Seek(fileListOffset); \/\/ TODO: Serializer\/Deserializer do not support files bigger than 4 GB\n }\n\n for (unsigned i = 0; i < numFiles; ++i)\n {\n ea::string entryName = file->ReadString();\n PackageEntry newEntry{};\n newEntry.offset_ = file->ReadUInt() + startOffset;\n totalDataSize_ += (newEntry.size_ = file->ReadUInt());\n newEntry.checksum_ = file->ReadUInt();\n if (!compressed_ && newEntry.offset_ + newEntry.size_ > totalSize_)\n {\n URHO3D_LOGERROR(\"File entry \" + entryName + \" outside package file\");\n return false;\n }\n else\n entries_[entryName] = newEntry;\n }\n\n return true;\n}\n\nbool PackageFile::Exists(const ea::string& fileName) const\n{\n bool found = entries_.find(fileName) != entries_.end();\n\n#ifdef _WIN32\n \/\/ On Windows perform a fallback case-insensitive search\n if (!found)\n {\n for (auto i = entries_.begin(); i != entries_.end(); ++i)\n {\n if (!i->first.comparei(fileName))\n {\n found = true;\n break;\n }\n }\n }\n#endif\n\n return found;\n}\n\nconst PackageEntry* PackageFile::GetEntry(const ea::string& fileName) const\n{\n auto i = entries_.find(fileName);\n if (i != entries_.end())\n return &i->second;\n\n#ifdef _WIN32\n \/\/ On Windows perform a fallback case-insensitive search\n else\n {\n for (auto j = entries_.begin(); j != entries_.end(); ++j)\n {\n if (!j->first.comparei(fileName))\n return &j->second;\n }\n }\n#endif\n\n return nullptr;\n}\n\nvoid PackageFile::Scan(ea::vector<ea::string>& result, const ea::string& pathName, const ea::string& filter, bool recursive) const\n{\n result.clear();\n\n ea::string sanitizedPath = GetSanitizedPath(pathName);\n ea::string filterExtension = filter.substr(filter.find_last_of('.'));\n if (filterExtension.contains('*'))\n filterExtension.clear();\n\n bool caseSensitive = true;\n#ifdef _WIN32\n \/\/ On Windows ignore case in string comparisons\n caseSensitive = false;\n#endif\n\n const StringVector& entryNames = GetEntryNames();\n for (auto i = entryNames.begin(); i != entryNames.end(); ++i)\n {\n ea::string entryName = GetSanitizedPath(*i);\n if ((filterExtension.empty() || entryName.ends_with(filterExtension, caseSensitive)) &&\n entryName.starts_with(sanitizedPath, caseSensitive))\n {\n ea::string fileName = entryName.substr(sanitizedPath.length());\n if (fileName.starts_with(\"\\\\\") || fileName.starts_with(\"\/\"))\n fileName = fileName.substr(1, fileName.length() - 1);\n if (!recursive && (fileName.contains(\"\\\\\") || fileName.contains(\"\/\")))\n continue;\n\n result.push_back(fileName);\n }\n }\n}\n\n}\n<|endoftext|>"} {"text":"<commit_before>#include <string>\n#include <fstream>\n#include <errno.h>\n#include <math.h>\n#include <stdio.h>\n#include <string.h>\n#include <unistd.h>\n#ifdef DARWIN\n# include <sys\/param.h>\n# include <sys\/sysctl.h>\n#endif\n#include <sys\/time.h>\n#include <sys\/stat.h>\n#include <limits.h>\n#include <sstream>\n#include <stdlib.h>\n#include <libgen.h>\n#ifdef LINUX\n# include <sched.h>\n# ifdef HAS_LIBNUMA\n# include <numaif.h>\n# endif\n#endif\n\n#include \"tools.h\"\n#include \"failure.h\"\n#include \"log.h\"\n\nusing std::string;\nusing std::vector;\n\n\/* purpose: formats ISO 8601 timestamp into given buffer (simplified)\n * paramtr: seconds (IN): time stamp\n * buffer (OUT): where to put the results\n * size (IN): capacity of buffer\n * returns: pointer to start of buffer for convenience. \n *\/\nchar * isodate( time_t seconds, char* buffer, size_t size ) {\n struct tm zulu = *gmtime(&seconds);\n struct tm local = *localtime(&seconds);\n zulu.tm_isdst = local.tm_isdst;\n {\n time_t distance = (seconds - mktime(&zulu)) \/ 60;\n int hours = distance \/ 60;\n int minutes = distance < 0 ? -distance % 60 : distance % 60;\n size_t len = strftime( buffer, size, \"%Y-%m-%dT%H:%M:%S\", &local );\n snprintf( buffer+len, size-len, \"%+03d:%02d\", hours, minutes );\n }\n return buffer;\n}\n\n\n\/* purpose: formats ISO 8601 timestamp into given buffer (simplified)\n * paramtr: seconds_wf (IN): time stamp with fractional seconds (millis)\n * buffer (OUT): where to put the results\n * size (IN): capacity of buffer\n * returns: pointer to start of buffer for convenience. \n *\/\nchar * iso2date( double seconds_wf, char* buffer, size_t size ) {\n char millis[8]; \n double integral, fractional = modf(seconds_wf,&integral); \n time_t seconds = (time_t) integral; \n struct tm zulu = *gmtime(&seconds);\n struct tm local = *localtime(&seconds);\n zulu.tm_isdst = local.tm_isdst;\n snprintf( millis, sizeof(millis), \"%.3f\", fractional ); \n {\n time_t distance = (seconds - mktime(&zulu)) \/ 60;\n int hours = distance \/ 60;\n int minutes = distance < 0 ? -distance % 60 : distance % 60;\n size_t len = strftime( buffer, size, \"%Y-%m-%dT%H:%M:%S\", &local );\n snprintf( buffer+len, size-len, \"%s%+03d:%02d\", millis+1, hours, minutes );\n }\n return buffer;\n}\n\n\n\/* Get the local host name *\/\nvoid get_host_name(std::string &hostname) {\n char name[HOST_NAME_MAX];\n if (gethostname(name, HOST_NAME_MAX) < 0) {\n myfailures(\"Unable to get host name\");\n }\n hostname = name;\n}\n\n\n\/* Get the current time as the number of seconds since the epoch *\/\ndouble current_time() {\n struct timeval now;\n gettimeofday(&now, NULL);\n double ts = now.tv_sec + (now.tv_usec\/1000000.0);\n return ts;\n}\n\n\n\/* Get the total amount of physical memory in bytes *\/\nunsigned long get_host_memory() {\n unsigned long memory;\n#ifdef DARWIN\n size_t size = sizeof(memory);\n if (sysctlbyname(\"hw.memsize\", &memory, &size, NULL, 0) < 0) {\n myfailures(\"Unable to get host physical memory size\");\n }\n#else\n long pages = sysconf(_SC_PHYS_PAGES);\n if (pages < 0) {\n myfailures(\"Unable to get number of host physical memory pages\");\n }\n long pagesize = sysconf(_SC_PAGE_SIZE);\n if (pagesize < 0) {\n myfailures(\"Unable to get physical page size\");\n }\n memory = pages * pagesize;\n#endif\n if (memory == 0) {\n myfailure(\"Invalid memory size: %lu bytes\", memory);\n }\n return memory;\n}\n\nstruct cpuinfo get_host_cpuinfo() {\n struct cpuinfo c;\n c.threads = 0;\n c.cores = 0;\n c.sockets = 0;\n#ifdef __MACH__\n unsigned int temp;\n size_t size = sizeof(temp);\n if (sysctlbyname(\"hw.logicalcpu\", &temp, &size, NULL, 0) < 0) {\n myfailures(\"Unable to get number of CPUs (logical CPUs)\");\n }\n c.threads = temp;\n if (sysctlbyname(\"hw.physicalcpu\", &temp, &size, NULL, 0) < 0) {\n myfailures(\"Unable to get number of cores (physical CPUs)\");\n }\n c.cores = temp;\n if (sysctlbyname(\"hw.packages\", &temp, &size, NULL, 0) < 0) {\n myfailures(\"Unable to get number of CPU sockets\");\n }\n c.threads = temp;\n#else\n std::ifstream infile;\n infile.open(\"\/proc\/cpuinfo\");\n if (!infile.good()) {\n myfailures(\"Error opening \/proc\/cpuinfo\");\n }\n\n int last_physical_id = -1;\n bool new_socket = false;\n string rec;\n while (getline(infile, rec)) {\n if (rec.find(\"processor\\t:\", 0, 11) == 0) {\n \/\/ Each time we encounter a processor field, we increment the\n \/\/ number of cpus\/threads\n c.threads += 1;\n } else if (rec.find(\"physical id\\t:\", 0, 13) == 0) {\n \/\/ Each time we encounter a new physical id, we increment the\n \/\/ number of sockets\n int new_physical_id;\n if (sscanf(rec.c_str(), \"physical id\\t: %d\", &new_physical_id) != 1) {\n myfailures(\"Error reading 'physical id' field from \/proc\/cpuinfo\");\n }\n if (new_physical_id > last_physical_id) {\n c.sockets += 1;\n last_physical_id = new_physical_id;\n new_socket = true;\n }\n } else if (rec.find(\"cpu cores\\t:\", 0, 11) == 0) {\n \/\/ Each time we encounter a new socket, we count the number of\n \/\/ cores it has\n if (new_socket) {\n cpu_t cores;\n if (sscanf(rec.c_str(), \"cpu cores\\t: %\" SCNcpu_t, &cores) != 1) {\n myfailures(\"Error reading 'cpu cores' field from \/proc\/cpuinfo\");\n }\n c.cores += cores;\n new_socket = false;\n }\n }\n }\n\n if (infile.bad() || !infile.eof()) {\n myfailures(\"Error reading \/proc\/cpuinfo\");\n }\n\n infile.close();\n#endif\n if (c.threads == 0 || c.cores == 0 || c.sockets == 0 ||\n c.cores > c.threads || c.sockets > c.cores ||\n c.threads % c.cores > 0 || c.cores % c.sockets > 0) {\n myfailure(\"Invalid cpuinfo: %\" PRIcpu_t \" %\" PRIcpu_t \" %\" PRIcpu_t, c.threads, c.cores, c.sockets);\n }\n return c;\n}\n\nint mkdirs(const char *path) {\n if (path == NULL || strlen(path) == 0) {\n return 0;\n }\n \n \/\/ No need to create cwd\n if (path[0] == '.' && path[1] == '\\0') {\n return 0;\n }\n \n if (strlen(path) > PATH_MAX) {\n errno = ENAMETOOLONG;\n return -1;\n }\n \n char mypath[PATH_MAX];\n char *p = mypath;\n \n if (path[0] == '.' && path[1] == '.') {\n if (getcwd(mypath, PATH_MAX) == NULL) {\n return -1;\n }\n \n char *parent = strrchr(mypath, '\/');\n if (parent) *parent = '\\0';\n \n int off = strlen(mypath);\n strcpy(mypath+off, path+2);\n \n \/\/ In this case we don't need to go back to the root\n p = mypath + off; \n } else if (path[0] == '.' && path[1] == '\/') {\n strcpy(mypath, path+2);\n } else {\n strcpy(mypath, path);\n }\n \n while (*p == '\/') p++;\n \n int created = 0;\n struct stat st;\n while ((p = strchr(p, '\/'))) {\n *p = '\\0';\n \n if (stat(mypath, &st)) {\n if (errno == ENOENT) {\n if (mkdir(mypath, 0777)) {\n return -1;\n }\n created++;\n } else {\n return -1;\n }\n } else {\n \/\/ If it exists, make sure it is a dir\n if (S_ISDIR(st.st_mode) == 0) {\n errno = ENOTDIR;\n return -1;\n }\n }\n \n *p = '\/';\n while (*p == '\/') p++;\n }\n \n \/\/ Last element of path\n if (stat(mypath, &st)) {\n if (errno == ENOENT) { \n if (mkdir(mypath, 0777)) {\n return -1;\n }\n created++;\n } else {\n return -1;\n }\n } else {\n if (S_ISDIR(st.st_mode) == 0) {\n errno = ENOTDIR;\n return -1;\n }\n }\n \n return created;\n}\n\nbool is_executable(const string &file) {\n \/\/ Invalid path\n if (file.size() == 0) {\n return false;\n }\n \n struct stat st;\n if (stat(file.c_str(), &st) == 0) {\n if (S_ISREG(st.st_mode)) {\n if ((st.st_uid == geteuid() && (S_IXUSR & st.st_mode) == S_IXUSR) ||\n (st.st_gid == getegid() && (S_IXGRP & st.st_mode) == S_IXGRP) ||\n ((S_IXOTH & st.st_mode) == S_IXOTH)) {\n \/\/ It is a regular file and we can execute it\n return true;\n }\n }\n }\n \n \/\/ In all other cases, the file is not executable\n return false;\n}\n\nint read_file(const string &file, char *buf, size_t size) {\n \/\/ Invalid path\n if (file.size() == 0) {\n errno = ENOENT;\n return -1;\n }\n \n FILE *f = fopen(file.c_str(), \"r\");\n if (f == NULL) {\n return -1;\n }\n \n size_t read = fread(buf, 1, size, f);\n\n if (fclose(f)) {\n return -1;\n }\n \n return read;\n}\n\nstring pathfind(const string &file) {\n if (file.size() == 0) {\n return file;\n }\n \n \/\/ files that have a \/ should be returned as-is\n if (file.find('\/') != string::npos) {\n return file;\n }\n \n \/\/ normally we wouldn't allow this\n if (is_executable(file)) {\n return file;\n }\n \n string path;\n char *env = getenv(\"PATH\");\n if (env == NULL) {\n#ifdef _PATH_DEFPATH\n path = _PATH_DEFPATH;\n#else\n return file;\n#endif\n } else {\n \/* yes, there is a PATH variable *\/ \n path = env;\n }\n \n string element;\n std::istringstream split(path);\n while(std::getline(split, element, ':')) {\n if (element.size() == 0) {\n continue;\n }\n string myfile = element + \"\/\" + file;\n if (is_executable(myfile)) {\n return myfile;\n }\n }\n \n return file;\n}\n\n\/* Return the directory part of a path *\/\nstring dirname(const string &path) {\n char *temp = strdup(path.c_str());\n string result = ::dirname(temp);\n free(temp);\n return result;\n}\n\n\/* Return the last part of a path *\/\nstring filename(const string &path) {\n char *temp = strdup(path.c_str());\n string result = ::basename(temp);\n free(temp);\n return result;\n}\n\n\/* Set the cpu affinity to values in bindings *\/\nint set_cpu_affinity(vector<cpu_t> &bindings) {\n#ifdef LINUX\n struct cpuinfo c = get_host_cpuinfo();\n cpu_set_t *cpuset = CPU_ALLOC(c.threads);\n if (cpuset == NULL) {\n return -1;\n }\n size_t cpusetsize = CPU_ALLOC_SIZE(c.threads);\n CPU_ZERO_S(cpusetsize, cpuset);\n\n for (vector<cpu_t>::iterator i = bindings.begin(); i != bindings.end(); i++) {\n cpu_t j = *i;\n if (j >= c.threads) {\n CPU_FREE(cpuset);\n errno = ERANGE;\n return -1;\n }\n CPU_SET_S(j, cpusetsize, cpuset);\n }\n\n int rc = sched_setaffinity(0, cpusetsize, cpuset);\n CPU_FREE(cpuset);\n if (rc < 0) {\n return -1;\n }\n#endif\n return 0;\n}\n\nint clear_cpu_affinity() {\n#ifdef LINUX\n struct cpuinfo c = get_host_cpuinfo();\n cpu_set_t *cpuset = CPU_ALLOC(c.threads);\n if (cpuset == NULL) {\n return -1;\n }\n size_t cpusetsize = CPU_ALLOC_SIZE(c.threads);\n CPU_ZERO_S(cpusetsize, cpuset);\n\n for (unsigned i=0; i<c.threads; i++) {\n CPU_SET_S(i, cpusetsize, cpuset);\n }\n\n int rc = sched_setaffinity(0, cpusetsize, cpuset);\n CPU_FREE(cpuset);\n if (rc < 0) {\n return -1;\n }\n#endif\n return 0;\n}\n\nint clear_memory_affinity() {\n#ifdef HAS_LIBNUMA\n int rc = set_mempolicy(MPOL_DEFAULT, NULL, 0);\n if (rc < 0) {\n return -1;\n }\n#endif\n return 0;\n}\n<commit_msg>PM-1403: POWER9 cpuinfo fix<commit_after>#include <string>\n#include <fstream>\n#include <errno.h>\n#include <math.h>\n#include <stdio.h>\n#include <string.h>\n#include <unistd.h>\n#ifdef DARWIN\n# include <sys\/param.h>\n# include <sys\/sysctl.h>\n#endif\n#include <sys\/time.h>\n#include <sys\/stat.h>\n#include <limits.h>\n#include <sstream>\n#include <stdlib.h>\n#include <libgen.h>\n#ifdef LINUX\n# include <sched.h>\n# ifdef HAS_LIBNUMA\n# include <numaif.h>\n# endif\n#endif\n\n#include \"tools.h\"\n#include \"failure.h\"\n#include \"log.h\"\n\nusing std::string;\nusing std::vector;\n\n\/* purpose: formats ISO 8601 timestamp into given buffer (simplified)\n * paramtr: seconds (IN): time stamp\n * buffer (OUT): where to put the results\n * size (IN): capacity of buffer\n * returns: pointer to start of buffer for convenience. \n *\/\nchar * isodate( time_t seconds, char* buffer, size_t size ) {\n struct tm zulu = *gmtime(&seconds);\n struct tm local = *localtime(&seconds);\n zulu.tm_isdst = local.tm_isdst;\n {\n time_t distance = (seconds - mktime(&zulu)) \/ 60;\n int hours = distance \/ 60;\n int minutes = distance < 0 ? -distance % 60 : distance % 60;\n size_t len = strftime( buffer, size, \"%Y-%m-%dT%H:%M:%S\", &local );\n snprintf( buffer+len, size-len, \"%+03d:%02d\", hours, minutes );\n }\n return buffer;\n}\n\n\n\/* purpose: formats ISO 8601 timestamp into given buffer (simplified)\n * paramtr: seconds_wf (IN): time stamp with fractional seconds (millis)\n * buffer (OUT): where to put the results\n * size (IN): capacity of buffer\n * returns: pointer to start of buffer for convenience. \n *\/\nchar * iso2date( double seconds_wf, char* buffer, size_t size ) {\n char millis[8]; \n double integral, fractional = modf(seconds_wf,&integral); \n time_t seconds = (time_t) integral; \n struct tm zulu = *gmtime(&seconds);\n struct tm local = *localtime(&seconds);\n zulu.tm_isdst = local.tm_isdst;\n snprintf( millis, sizeof(millis), \"%.3f\", fractional ); \n {\n time_t distance = (seconds - mktime(&zulu)) \/ 60;\n int hours = distance \/ 60;\n int minutes = distance < 0 ? -distance % 60 : distance % 60;\n size_t len = strftime( buffer, size, \"%Y-%m-%dT%H:%M:%S\", &local );\n snprintf( buffer+len, size-len, \"%s%+03d:%02d\", millis+1, hours, minutes );\n }\n return buffer;\n}\n\n\n\/* Get the local host name *\/\nvoid get_host_name(std::string &hostname) {\n char name[HOST_NAME_MAX];\n if (gethostname(name, HOST_NAME_MAX) < 0) {\n myfailures(\"Unable to get host name\");\n }\n hostname = name;\n}\n\n\n\/* Get the current time as the number of seconds since the epoch *\/\ndouble current_time() {\n struct timeval now;\n gettimeofday(&now, NULL);\n double ts = now.tv_sec + (now.tv_usec\/1000000.0);\n return ts;\n}\n\n\n\/* Get the total amount of physical memory in bytes *\/\nunsigned long get_host_memory() {\n unsigned long memory;\n#ifdef DARWIN\n size_t size = sizeof(memory);\n if (sysctlbyname(\"hw.memsize\", &memory, &size, NULL, 0) < 0) {\n myfailures(\"Unable to get host physical memory size\");\n }\n#else\n long pages = sysconf(_SC_PHYS_PAGES);\n if (pages < 0) {\n myfailures(\"Unable to get number of host physical memory pages\");\n }\n long pagesize = sysconf(_SC_PAGE_SIZE);\n if (pagesize < 0) {\n myfailures(\"Unable to get physical page size\");\n }\n memory = pages * pagesize;\n#endif\n if (memory == 0) {\n myfailure(\"Invalid memory size: %lu bytes\", memory);\n }\n return memory;\n}\n\nstruct cpuinfo get_host_cpuinfo() {\n struct cpuinfo c;\n c.threads = 0;\n c.cores = 0;\n c.sockets = 0;\n#ifdef __MACH__\n unsigned int temp;\n size_t size = sizeof(temp);\n if (sysctlbyname(\"hw.logicalcpu\", &temp, &size, NULL, 0) < 0) {\n myfailures(\"Unable to get number of CPUs (logical CPUs)\");\n }\n c.threads = temp;\n if (sysctlbyname(\"hw.physicalcpu\", &temp, &size, NULL, 0) < 0) {\n myfailures(\"Unable to get number of cores (physical CPUs)\");\n }\n c.cores = temp;\n if (sysctlbyname(\"hw.packages\", &temp, &size, NULL, 0) < 0) {\n myfailures(\"Unable to get number of CPU sockets\");\n }\n c.threads = temp;\n#else\n std::ifstream infile;\n infile.open(\"\/proc\/cpuinfo\");\n if (!infile.good()) {\n myfailures(\"Error opening \/proc\/cpuinfo\");\n }\n\n int last_physical_id = -1;\n bool new_socket = false;\n string rec;\n while (getline(infile, rec)) {\n if (rec.find(\"processor\\t:\", 0, 11) == 0) {\n \/\/ Each time we encounter a processor field, we increment the\n \/\/ number of cpus\/threads\n c.threads += 1;\n } else if (rec.find(\"physical id\\t:\", 0, 13) == 0) {\n \/\/ Each time we encounter a new physical id, we increment the\n \/\/ number of sockets\n int new_physical_id;\n if (sscanf(rec.c_str(), \"physical id\\t: %d\", &new_physical_id) != 1) {\n myfailures(\"Error reading 'physical id' field from \/proc\/cpuinfo\");\n }\n if (new_physical_id > last_physical_id) {\n c.sockets += 1;\n last_physical_id = new_physical_id;\n new_socket = true;\n }\n } else if (rec.find(\"cpu cores\\t:\", 0, 11) == 0) {\n \/\/ Each time we encounter a new socket, we count the number of\n \/\/ cores it has\n if (new_socket) {\n cpu_t cores;\n if (sscanf(rec.c_str(), \"cpu cores\\t: %\" SCNcpu_t, &cores) != 1) {\n myfailures(\"Error reading 'cpu cores' field from \/proc\/cpuinfo\");\n }\n c.cores += cores;\n new_socket = false;\n }\n }\n }\n\n if (infile.bad() || !infile.eof()) {\n myfailures(\"Error reading \/proc\/cpuinfo\");\n }\n\n infile.close();\n\n \/\/ On some platforms, we can only detect the number of virtual cores\n \/\/ https:\/\/jira.isi.edu\/browse\/PM-1403\n if (c.threads > 0 && c.cores == 0) {\n log_warn(\"Unable to determine the number of cores from \/proc\/cpuinfo - using the threads value\");\n c.cores = c.threads;\n }\n if (c.threads > 0 && c.sockets == 0) {\n log_warn(\"Unable to determine the number of sockets from \/proc\/cpuinfo - setting it to 1\");\n c.sockets = 1;\n }\n\n\n#endif\n if (c.threads == 0 || c.cores == 0 || c.sockets == 0 ||\n c.cores > c.threads || c.sockets > c.cores ||\n c.threads % c.cores > 0 || c.cores % c.sockets > 0) {\n myfailure(\"Invalid cpuinfo: %\" PRIcpu_t \" %\" PRIcpu_t \" %\" PRIcpu_t, c.threads, c.cores, c.sockets);\n }\n return c;\n}\n\nint mkdirs(const char *path) {\n if (path == NULL || strlen(path) == 0) {\n return 0;\n }\n \n \/\/ No need to create cwd\n if (path[0] == '.' && path[1] == '\\0') {\n return 0;\n }\n \n if (strlen(path) > PATH_MAX) {\n errno = ENAMETOOLONG;\n return -1;\n }\n \n char mypath[PATH_MAX];\n char *p = mypath;\n \n if (path[0] == '.' && path[1] == '.') {\n if (getcwd(mypath, PATH_MAX) == NULL) {\n return -1;\n }\n \n char *parent = strrchr(mypath, '\/');\n if (parent) *parent = '\\0';\n \n int off = strlen(mypath);\n strcpy(mypath+off, path+2);\n \n \/\/ In this case we don't need to go back to the root\n p = mypath + off; \n } else if (path[0] == '.' && path[1] == '\/') {\n strcpy(mypath, path+2);\n } else {\n strcpy(mypath, path);\n }\n \n while (*p == '\/') p++;\n \n int created = 0;\n struct stat st;\n while ((p = strchr(p, '\/'))) {\n *p = '\\0';\n \n if (stat(mypath, &st)) {\n if (errno == ENOENT) {\n if (mkdir(mypath, 0777)) {\n return -1;\n }\n created++;\n } else {\n return -1;\n }\n } else {\n \/\/ If it exists, make sure it is a dir\n if (S_ISDIR(st.st_mode) == 0) {\n errno = ENOTDIR;\n return -1;\n }\n }\n \n *p = '\/';\n while (*p == '\/') p++;\n }\n \n \/\/ Last element of path\n if (stat(mypath, &st)) {\n if (errno == ENOENT) { \n if (mkdir(mypath, 0777)) {\n return -1;\n }\n created++;\n } else {\n return -1;\n }\n } else {\n if (S_ISDIR(st.st_mode) == 0) {\n errno = ENOTDIR;\n return -1;\n }\n }\n \n return created;\n}\n\nbool is_executable(const string &file) {\n \/\/ Invalid path\n if (file.size() == 0) {\n return false;\n }\n \n struct stat st;\n if (stat(file.c_str(), &st) == 0) {\n if (S_ISREG(st.st_mode)) {\n if ((st.st_uid == geteuid() && (S_IXUSR & st.st_mode) == S_IXUSR) ||\n (st.st_gid == getegid() && (S_IXGRP & st.st_mode) == S_IXGRP) ||\n ((S_IXOTH & st.st_mode) == S_IXOTH)) {\n \/\/ It is a regular file and we can execute it\n return true;\n }\n }\n }\n \n \/\/ In all other cases, the file is not executable\n return false;\n}\n\nint read_file(const string &file, char *buf, size_t size) {\n \/\/ Invalid path\n if (file.size() == 0) {\n errno = ENOENT;\n return -1;\n }\n \n FILE *f = fopen(file.c_str(), \"r\");\n if (f == NULL) {\n return -1;\n }\n \n size_t read = fread(buf, 1, size, f);\n\n if (fclose(f)) {\n return -1;\n }\n \n return read;\n}\n\nstring pathfind(const string &file) {\n if (file.size() == 0) {\n return file;\n }\n \n \/\/ files that have a \/ should be returned as-is\n if (file.find('\/') != string::npos) {\n return file;\n }\n \n \/\/ normally we wouldn't allow this\n if (is_executable(file)) {\n return file;\n }\n \n string path;\n char *env = getenv(\"PATH\");\n if (env == NULL) {\n#ifdef _PATH_DEFPATH\n path = _PATH_DEFPATH;\n#else\n return file;\n#endif\n } else {\n \/* yes, there is a PATH variable *\/ \n path = env;\n }\n \n string element;\n std::istringstream split(path);\n while(std::getline(split, element, ':')) {\n if (element.size() == 0) {\n continue;\n }\n string myfile = element + \"\/\" + file;\n if (is_executable(myfile)) {\n return myfile;\n }\n }\n \n return file;\n}\n\n\/* Return the directory part of a path *\/\nstring dirname(const string &path) {\n char *temp = strdup(path.c_str());\n string result = ::dirname(temp);\n free(temp);\n return result;\n}\n\n\/* Return the last part of a path *\/\nstring filename(const string &path) {\n char *temp = strdup(path.c_str());\n string result = ::basename(temp);\n free(temp);\n return result;\n}\n\n\/* Set the cpu affinity to values in bindings *\/\nint set_cpu_affinity(vector<cpu_t> &bindings) {\n#ifdef LINUX\n struct cpuinfo c = get_host_cpuinfo();\n cpu_set_t *cpuset = CPU_ALLOC(c.threads);\n if (cpuset == NULL) {\n return -1;\n }\n size_t cpusetsize = CPU_ALLOC_SIZE(c.threads);\n CPU_ZERO_S(cpusetsize, cpuset);\n\n for (vector<cpu_t>::iterator i = bindings.begin(); i != bindings.end(); i++) {\n cpu_t j = *i;\n if (j >= c.threads) {\n CPU_FREE(cpuset);\n errno = ERANGE;\n return -1;\n }\n CPU_SET_S(j, cpusetsize, cpuset);\n }\n\n int rc = sched_setaffinity(0, cpusetsize, cpuset);\n CPU_FREE(cpuset);\n if (rc < 0) {\n return -1;\n }\n#endif\n return 0;\n}\n\nint clear_cpu_affinity() {\n#ifdef LINUX\n struct cpuinfo c = get_host_cpuinfo();\n cpu_set_t *cpuset = CPU_ALLOC(c.threads);\n if (cpuset == NULL) {\n return -1;\n }\n size_t cpusetsize = CPU_ALLOC_SIZE(c.threads);\n CPU_ZERO_S(cpusetsize, cpuset);\n\n for (unsigned i=0; i<c.threads; i++) {\n CPU_SET_S(i, cpusetsize, cpuset);\n }\n\n int rc = sched_setaffinity(0, cpusetsize, cpuset);\n CPU_FREE(cpuset);\n if (rc < 0) {\n return -1;\n }\n#endif\n return 0;\n}\n\nint clear_memory_affinity() {\n#ifdef HAS_LIBNUMA\n int rc = set_mempolicy(MPOL_DEFAULT, NULL, 0);\n if (rc < 0) {\n return -1;\n }\n#endif\n return 0;\n}\n<|endoftext|>"} {"text":"<commit_before>#include <chrono>\n#include <cstdint>\n#include <exception>\n#include <fstream>\n#include <iomanip>\n#include <iostream>\n#include <stdexcept>\n#include <string>\n#include <vector>\n\n#include <gflags\/gflags.h>\n#include <glog\/logging.h>\n\n#include <tudocomp\/Compressor.hpp>\n#include <tudocomp\/io.hpp>\n#include <tudocomp\/io\/IOUtil.hpp>\n#include <tudocomp\/util\/Json.hpp>\n#include <tudocomp_driver\/Registry.hpp>\n\n\/*namespace validate {\n static bool algorithm(const char* flagname, int32 value) {\n if (value > 0 && value < 32768) \/\/ value is ok\n return true;\n printf(\"Invalid value for --%s: %d\\n\", flagname, (int)value);\n return false;\n }\n static const bool algorithm_dummy = RegisterFlagValidator(&FLAGS_algorithm, &algorithm);\n}*\/\n\nDEFINE_string(algorithm, \"\", \"Algorithm to use for (de)compression. See --list for a complete list of them.\");\nDEFINE_bool(decompress, false, \"Decompress input instead of compressing it.\");\nDEFINE_string(output, \"\", \"Choose output filename instead the the default generated one of <input>.tdc or stdout.\");\nDEFINE_bool(stats, false, \"Print statistics to stdout.\");\nDEFINE_bool(force, false, \"Overwrite output even if it exists.\");\nDEFINE_bool(list, false, \"List all compression algorithms supported by this tool.\");\nDEFINE_bool(raw, false, \"Do not emit an header into the output file when compressing.\");\nDEFINE_bool(usestdin, false, \"Read from stdin instead of trying to open a file.\");\nDEFINE_bool(usestdout, false, \"Output to stdout instead of writing to a file\");\n\nnamespace tdc_driver {\n\nusing namespace tdc;\nusing namespace tdc_algorithms;\n\nconst std::string COMPRESSED_FILE_ENDING = \"tdc\";\n\nstatic void exit(std::string msg) {\n \/\/ TODO: Replace with more specific logic-error-exception\n throw std::runtime_error(msg);\n}\n\nstatic void validate_flag_combination() {\n auto err = [](std::string s) {\n exit(s);\n };\n\n if (!FLAGS_list) {\n if (!FLAGS_decompress && (std::string(FLAGS_algorithm) == \"\")) {\n err(\"Need to give an algorithm for compression\");\n }\n if (FLAGS_decompress && FLAGS_raw && (std::string(FLAGS_algorithm) == \"\")) {\n err(\"Need to give an algorithm for raw decompression\");\n }\n }\n}\n\nstatic bool fexists(std::string filename)\n{\n std::ifstream ifile(filename);\n return bool(ifile);\n}\n\nstatic bool check_for_file_already_exist(std::string& ofile,\n bool allow_overwrite) {\n \/\/ Don't accidentially overwrite files\n if (!allow_overwrite && fexists(ofile)) {\n std::cerr << \"Outputfile already exists\\n\";\n return false;\n }\n return true;\n}\n\n} \/\/ namespace tdc_driver\n\n#include <iomanip>\n\nint main(int argc, char** argv)\n{\n using namespace tdc_driver;\n using namespace tdc_algorithms;\n\n google::InitGoogleLogging(argv[0]);\n google::SetUsageMessage(\"This tool compresses and decompresses files\");\n if(argc == 1 || strcmp(argv[1],\"-h\") == 0 || strcmp(argv[1],\"--help\") == 0 || strcmp(argv[1],\"-help\") == 0) {\n\/\/ google::ShowUsageWithFlagsRestrict(argv[0], __FILE__); \/\/shortcut\n std::vector<google::CommandLineFlagInfo> info;\n google::GetAllFlags(&info);\n\n std::cout << argv[0] << \" [options] {file to compress\/decompress}\" << std::endl;\n std::cout << \"You need to provide at least an algorithm and a source (a file) to compress\/decompress.\" << std::endl << std::endl;\n std::cout\n << std::setw(20) << std::setiosflags(std::ios::left) << \"Parameter\"\n << std::setw(10) << \"Type\"\n << std::setw(20) << \"Default\"\n << \"Description\" << std::endl;\n std::cout << std::endl;\n for(auto it = info.cbegin(); it != info.cend(); ++it) {\n if(it->filename != __FILE__) continue;\n std::cout\n << std::setw(20) << std::setiosflags(std::ios::left)<< (std::string(\"--\")+ it->name)\n << std::setw(10) << it->type\n << std::setw(20) << (std::string(\"(\") + it->default_value + \")\")\n << it->description << std::endl;\n }\n return 0;\n }\n\n int first_cmd_arg = google::ParseCommandLineFlags(&argc, &argv, true);\n\n try {\n validate_flag_combination();\n\n \/\/ Set up algorithms\n Registry& registry = REGISTRY;\n\n if (FLAGS_list) {\n std::cout << \"This build supports the following algorithms:\\n\";\n std::cout << std::endl;\n std::cout << registry.generate_doc_string();\n\n return 0;\n }\n\n bool print_stats = FLAGS_stats;\n bool do_compress = !FLAGS_decompress;\n bool do_raw = FLAGS_raw;\n\n \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n \/\/ Select algorithm\n\n class Selection {\n std::string m_id_string;\n std::unique_ptr<Compressor> m_compressor;\n bool m_needs_sentinel_terminator;\n std::shared_ptr<EnvRoot> m_algorithm_env;\n public:\n Selection():\n m_id_string(),\n m_compressor(),\n m_needs_sentinel_terminator(false),\n m_algorithm_env() {}\n Selection(std::string&& id_string,\n std::unique_ptr<Compressor>&& compressor,\n bool needs_sentinel_terminator,\n std::shared_ptr<EnvRoot>&& algorithm_env):\n m_id_string(std::move(id_string)),\n m_compressor(std::move(compressor)),\n m_needs_sentinel_terminator(needs_sentinel_terminator),\n m_algorithm_env(std::move(algorithm_env)) {}\n const std::string& id_string() const {\n return m_id_string;\n }\n Compressor& compressor() {\n return *m_compressor;\n }\n bool needs_sentinel_terminator() const {\n return m_needs_sentinel_terminator;\n }\n const std::shared_ptr<EnvRoot>& algorithm_env() const {\n return m_algorithm_env;\n }\n };\n Selection selection;\n\n if (!FLAGS_algorithm.empty()) {\n auto id_string = FLAGS_algorithm;\n\n auto av = registry.parse_algorithm_id(id_string);\n auto needs_sentinel_terminator = av.needs_sentinel_terminator();\n auto compressor = registry.select_algorithm_or_exit(av);\n auto algorithm_env = compressor->env().root();\n\n selection = Selection {\n std::move(id_string),\n std::move(compressor),\n needs_sentinel_terminator,\n std::move(algorithm_env),\n };\n }\n\n \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n \/\/ Select where the input comes from\n\n std::string file;\n\n if ((!FLAGS_usestdin) && (first_cmd_arg < argc)) {\n file = argv[first_cmd_arg];\n if (!fexists(file)) {\n std::cerr << \"input file \" << file << \" does not exist\\n\";\n return 1;\n }\n } else if (!FLAGS_usestdin) {\n std::cerr << \"No input file given\\n\";\n return 1;\n }\n\n bool use_stdin = FLAGS_usestdin;\n\n \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n \/\/ Select where the output goes to\n\n std::string ofile;\n bool use_stdout = FLAGS_usestdout;\n bool use_explict_output = std::string(FLAGS_output) != \"\" ;\n\n if (use_explict_output) {\n \/\/ Output to manually specifed file\n ofile = FLAGS_output;\n } else if (!use_stdin && do_compress) {\n \/\/ Output to a automatically determined file\n ofile = file + \".\" + COMPRESSED_FILE_ENDING;\n } else if (!use_stdin && !do_compress && !use_stdout) {\n std::cerr << \"Need to specify a output filename\\n\";\n return 1;\n }\n\n \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n \/\/ open streams\n\n using clk = std::chrono::high_resolution_clock;\n\n clk::time_point start_time = clk::now();\n clk::time_point setup_time;\n clk::time_point comp_time;\n clk::time_point end_time;\n\n {\n std::vector<uint8_t> stream_buffer;\n Input inp;\n\n if (use_stdin) {\n \/\/ Input from stdin\n inp = Input(std::cin);\n } else {\n \/\/ Input from specified file\n inp = Input::from_path(file);\n }\n\n Output out;\n if (use_stdout) {\n \/\/ Output to stdout\n out = Output::from_stream(std::cout);\n } else {\n \/\/ Output to specified file\n bool force = FLAGS_force;\n if (!check_for_file_already_exist(ofile, force)) {\n return 1;\n } else {\n out = Output::from_path(ofile, true);\n }\n }\n\n \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n \/\/ call into actual library\n\n if (do_compress) {\n if (!do_raw) {\n CHECK(selection.id_string().find('%') == std::string::npos);\n\n auto o_stream = out.as_stream();\n o_stream << selection.id_string() << '%';\n }\n\n if (selection.needs_sentinel_terminator()) {\n inp.escape_and_terminate();\n }\n\n selection.algorithm_env()->restart_stats(\"Compress\");\n setup_time = clk::now();\n selection.compressor().compress(inp, out);\n comp_time = clk::now();\n } else {\n \/\/ 3 cases\n \/\/ --decompress : read and use header\n \/\/ --decompress --algorithm : read but ignore header\n \/\/ --decompress --raw --algorithm : no header\n\n std::string algorithm_header;\n\n if (!do_raw) {\n \/\/ read header\n auto i_stream = inp.as_stream();\n\n char c;\n size_t sanity_size_check = 0;\n bool err = false;\n while (i_stream.get(c)) {\n err = false;\n if (sanity_size_check > 1023) {\n err = true;\n break;\n } else if (c == '%') {\n break;\n } else {\n algorithm_header.push_back(c);\n }\n sanity_size_check++;\n err = true;\n }\n if (err) {\n exit(\"Input did not have an algorithm header!\");\n }\n }\n\n if (!do_raw && !selection.id_string().empty()) {\n DLOG(INFO) << \"Ignoring header \" << algorithm_header\n << \" and using manually given \" << selection.id_string();\n } else if (!do_raw) {\n DLOG(INFO) << \"Using header id string \" << algorithm_header;\n\n auto id_string = std::move(algorithm_header);\n auto av = registry.parse_algorithm_id(id_string);\n auto compressor = registry.select_algorithm_or_exit(av);\n auto needs_sentinel_terminator = av.needs_sentinel_terminator();\n auto algorithm_env = compressor->env().root();\n\n selection = Selection {\n std::move(id_string),\n std::move(compressor),\n needs_sentinel_terminator,\n std::move(algorithm_env),\n };\n } else {\n DLOG(INFO) << \"Using manually given \" << selection.id_string();\n }\n\n if (selection.needs_sentinel_terminator()) {\n out.unescape_and_trim();\n }\n\n selection.algorithm_env()->restart_stats(\"Decompress\");\n setup_time = clk::now();\n selection.compressor().decompress(inp, out);\n comp_time = clk::now();\n }\n }\n\n auto algo_stats = selection.algorithm_env()->finish_stats();\n end_time = clk::now();\n\n if (print_stats) {\n auto setup_duration = setup_time - start_time;\n auto comp_duration = comp_time - setup_time;\n auto end_duration = end_time - comp_time;\n\n size_t in_size = use_stdin ? 0 : io::read_file_size(file);\n size_t out_size = use_stdout ? 0 : io::read_file_size(ofile);\n\n json::Object meta;\n meta.set(\"startTime\",\n std::chrono::duration_cast<std::chrono::seconds>(\n start_time.time_since_epoch()).count());\n\n meta.set(\"config\", selection.id_string());\n meta.set(\"input\", use_stdin ? \"<stdin>\" : file);\n meta.set(\"inputSize\", in_size);\n meta.set(\"output\", use_stdout ? \"<stdin>\" : file);\n meta.set(\"outputSize\", out_size);\n meta.set(\"rate\", (use_stdin || use_stdout) ? 0.0 :\n double(out_size) \/ double(in_size));\n\n json::Object stats;\n stats.set(\"meta\", meta);\n stats.set(\"data\", algo_stats.to_json());\n\n stats.str(std::cout);\n std::cout << std::endl;\n }\n } catch (std::exception& e) {\n std::cout << \"Error: \" << e.what() << '\\n';\n return 1;\n }\n\n return 0;\n}\n<commit_msg>Fix cnp mistake in stat JSON building. Fixes #18379<commit_after>#include <chrono>\n#include <cstdint>\n#include <exception>\n#include <fstream>\n#include <iomanip>\n#include <iostream>\n#include <stdexcept>\n#include <string>\n#include <vector>\n\n#include <gflags\/gflags.h>\n#include <glog\/logging.h>\n\n#include <tudocomp\/Compressor.hpp>\n#include <tudocomp\/io.hpp>\n#include <tudocomp\/io\/IOUtil.hpp>\n#include <tudocomp\/util\/Json.hpp>\n#include <tudocomp_driver\/Registry.hpp>\n\n\/*namespace validate {\n static bool algorithm(const char* flagname, int32 value) {\n if (value > 0 && value < 32768) \/\/ value is ok\n return true;\n printf(\"Invalid value for --%s: %d\\n\", flagname, (int)value);\n return false;\n }\n static const bool algorithm_dummy = RegisterFlagValidator(&FLAGS_algorithm, &algorithm);\n}*\/\n\nDEFINE_string(algorithm, \"\", \"Algorithm to use for (de)compression. See --list for a complete list of them.\");\nDEFINE_bool(decompress, false, \"Decompress input instead of compressing it.\");\nDEFINE_string(output, \"\", \"Choose output filename instead the the default generated one of <input>.tdc or stdout.\");\nDEFINE_bool(stats, false, \"Print statistics to stdout.\");\nDEFINE_bool(force, false, \"Overwrite output even if it exists.\");\nDEFINE_bool(list, false, \"List all compression algorithms supported by this tool.\");\nDEFINE_bool(raw, false, \"Do not emit an header into the output file when compressing.\");\nDEFINE_bool(usestdin, false, \"Read from stdin instead of trying to open a file.\");\nDEFINE_bool(usestdout, false, \"Output to stdout instead of writing to a file\");\n\nnamespace tdc_driver {\n\nusing namespace tdc;\nusing namespace tdc_algorithms;\n\nconst std::string COMPRESSED_FILE_ENDING = \"tdc\";\n\nstatic void exit(std::string msg) {\n \/\/ TODO: Replace with more specific logic-error-exception\n throw std::runtime_error(msg);\n}\n\nstatic void validate_flag_combination() {\n auto err = [](std::string s) {\n exit(s);\n };\n\n if (!FLAGS_list) {\n if (!FLAGS_decompress && (std::string(FLAGS_algorithm) == \"\")) {\n err(\"Need to give an algorithm for compression\");\n }\n if (FLAGS_decompress && FLAGS_raw && (std::string(FLAGS_algorithm) == \"\")) {\n err(\"Need to give an algorithm for raw decompression\");\n }\n }\n}\n\nstatic bool fexists(std::string filename)\n{\n std::ifstream ifile(filename);\n return bool(ifile);\n}\n\nstatic bool check_for_file_already_exist(std::string& ofile,\n bool allow_overwrite) {\n \/\/ Don't accidentially overwrite files\n if (!allow_overwrite && fexists(ofile)) {\n std::cerr << \"Outputfile already exists\\n\";\n return false;\n }\n return true;\n}\n\n} \/\/ namespace tdc_driver\n\n#include <iomanip>\n\nint main(int argc, char** argv)\n{\n using namespace tdc_driver;\n using namespace tdc_algorithms;\n\n google::InitGoogleLogging(argv[0]);\n google::SetUsageMessage(\"This tool compresses and decompresses files\");\n if(argc == 1 || strcmp(argv[1],\"-h\") == 0 || strcmp(argv[1],\"--help\") == 0 || strcmp(argv[1],\"-help\") == 0) {\n\/\/ google::ShowUsageWithFlagsRestrict(argv[0], __FILE__); \/\/shortcut\n std::vector<google::CommandLineFlagInfo> info;\n google::GetAllFlags(&info);\n\n std::cout << argv[0] << \" [options] {file to compress\/decompress}\" << std::endl;\n std::cout << \"You need to provide at least an algorithm and a source (a file) to compress\/decompress.\" << std::endl << std::endl;\n std::cout\n << std::setw(20) << std::setiosflags(std::ios::left) << \"Parameter\"\n << std::setw(10) << \"Type\"\n << std::setw(20) << \"Default\"\n << \"Description\" << std::endl;\n std::cout << std::endl;\n for(auto it = info.cbegin(); it != info.cend(); ++it) {\n if(it->filename != __FILE__) continue;\n std::cout\n << std::setw(20) << std::setiosflags(std::ios::left)<< (std::string(\"--\")+ it->name)\n << std::setw(10) << it->type\n << std::setw(20) << (std::string(\"(\") + it->default_value + \")\")\n << it->description << std::endl;\n }\n return 0;\n }\n\n int first_cmd_arg = google::ParseCommandLineFlags(&argc, &argv, true);\n\n try {\n validate_flag_combination();\n\n \/\/ Set up algorithms\n Registry& registry = REGISTRY;\n\n if (FLAGS_list) {\n std::cout << \"This build supports the following algorithms:\\n\";\n std::cout << std::endl;\n std::cout << registry.generate_doc_string();\n\n return 0;\n }\n\n bool print_stats = FLAGS_stats;\n bool do_compress = !FLAGS_decompress;\n bool do_raw = FLAGS_raw;\n\n \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n \/\/ Select algorithm\n\n class Selection {\n std::string m_id_string;\n std::unique_ptr<Compressor> m_compressor;\n bool m_needs_sentinel_terminator;\n std::shared_ptr<EnvRoot> m_algorithm_env;\n public:\n Selection():\n m_id_string(),\n m_compressor(),\n m_needs_sentinel_terminator(false),\n m_algorithm_env() {}\n Selection(std::string&& id_string,\n std::unique_ptr<Compressor>&& compressor,\n bool needs_sentinel_terminator,\n std::shared_ptr<EnvRoot>&& algorithm_env):\n m_id_string(std::move(id_string)),\n m_compressor(std::move(compressor)),\n m_needs_sentinel_terminator(needs_sentinel_terminator),\n m_algorithm_env(std::move(algorithm_env)) {}\n const std::string& id_string() const {\n return m_id_string;\n }\n Compressor& compressor() {\n return *m_compressor;\n }\n bool needs_sentinel_terminator() const {\n return m_needs_sentinel_terminator;\n }\n const std::shared_ptr<EnvRoot>& algorithm_env() const {\n return m_algorithm_env;\n }\n };\n Selection selection;\n\n if (!FLAGS_algorithm.empty()) {\n auto id_string = FLAGS_algorithm;\n\n auto av = registry.parse_algorithm_id(id_string);\n auto needs_sentinel_terminator = av.needs_sentinel_terminator();\n auto compressor = registry.select_algorithm_or_exit(av);\n auto algorithm_env = compressor->env().root();\n\n selection = Selection {\n std::move(id_string),\n std::move(compressor),\n needs_sentinel_terminator,\n std::move(algorithm_env),\n };\n }\n\n \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n \/\/ Select where the input comes from\n\n std::string file;\n\n if ((!FLAGS_usestdin) && (first_cmd_arg < argc)) {\n file = argv[first_cmd_arg];\n if (!fexists(file)) {\n std::cerr << \"input file \" << file << \" does not exist\\n\";\n return 1;\n }\n } else if (!FLAGS_usestdin) {\n std::cerr << \"No input file given\\n\";\n return 1;\n }\n\n bool use_stdin = FLAGS_usestdin;\n\n \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n \/\/ Select where the output goes to\n\n std::string ofile;\n bool use_stdout = FLAGS_usestdout;\n bool use_explict_output = std::string(FLAGS_output) != \"\" ;\n\n if (use_explict_output) {\n \/\/ Output to manually specifed file\n ofile = FLAGS_output;\n } else if (!use_stdin && do_compress) {\n \/\/ Output to a automatically determined file\n ofile = file + \".\" + COMPRESSED_FILE_ENDING;\n } else if (!use_stdin && !do_compress && !use_stdout) {\n std::cerr << \"Need to specify a output filename\\n\";\n return 1;\n }\n\n \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n \/\/ open streams\n\n using clk = std::chrono::high_resolution_clock;\n\n clk::time_point start_time = clk::now();\n clk::time_point setup_time;\n clk::time_point comp_time;\n clk::time_point end_time;\n\n {\n std::vector<uint8_t> stream_buffer;\n Input inp;\n\n if (use_stdin) {\n \/\/ Input from stdin\n inp = Input(std::cin);\n } else {\n \/\/ Input from specified file\n inp = Input::from_path(file);\n }\n\n Output out;\n if (use_stdout) {\n \/\/ Output to stdout\n out = Output::from_stream(std::cout);\n } else {\n \/\/ Output to specified file\n bool force = FLAGS_force;\n if (!check_for_file_already_exist(ofile, force)) {\n return 1;\n } else {\n out = Output::from_path(ofile, true);\n }\n }\n\n \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n \/\/ call into actual library\n\n if (do_compress) {\n if (!do_raw) {\n CHECK(selection.id_string().find('%') == std::string::npos);\n\n auto o_stream = out.as_stream();\n o_stream << selection.id_string() << '%';\n }\n\n if (selection.needs_sentinel_terminator()) {\n inp.escape_and_terminate();\n }\n\n selection.algorithm_env()->restart_stats(\"Compress\");\n setup_time = clk::now();\n selection.compressor().compress(inp, out);\n comp_time = clk::now();\n } else {\n \/\/ 3 cases\n \/\/ --decompress : read and use header\n \/\/ --decompress --algorithm : read but ignore header\n \/\/ --decompress --raw --algorithm : no header\n\n std::string algorithm_header;\n\n if (!do_raw) {\n \/\/ read header\n auto i_stream = inp.as_stream();\n\n char c;\n size_t sanity_size_check = 0;\n bool err = false;\n while (i_stream.get(c)) {\n err = false;\n if (sanity_size_check > 1023) {\n err = true;\n break;\n } else if (c == '%') {\n break;\n } else {\n algorithm_header.push_back(c);\n }\n sanity_size_check++;\n err = true;\n }\n if (err) {\n exit(\"Input did not have an algorithm header!\");\n }\n }\n\n if (!do_raw && !selection.id_string().empty()) {\n DLOG(INFO) << \"Ignoring header \" << algorithm_header\n << \" and using manually given \" << selection.id_string();\n } else if (!do_raw) {\n DLOG(INFO) << \"Using header id string \" << algorithm_header;\n\n auto id_string = std::move(algorithm_header);\n auto av = registry.parse_algorithm_id(id_string);\n auto compressor = registry.select_algorithm_or_exit(av);\n auto needs_sentinel_terminator = av.needs_sentinel_terminator();\n auto algorithm_env = compressor->env().root();\n\n selection = Selection {\n std::move(id_string),\n std::move(compressor),\n needs_sentinel_terminator,\n std::move(algorithm_env),\n };\n } else {\n DLOG(INFO) << \"Using manually given \" << selection.id_string();\n }\n\n if (selection.needs_sentinel_terminator()) {\n out.unescape_and_trim();\n }\n\n selection.algorithm_env()->restart_stats(\"Decompress\");\n setup_time = clk::now();\n selection.compressor().decompress(inp, out);\n comp_time = clk::now();\n }\n }\n\n auto algo_stats = selection.algorithm_env()->finish_stats();\n end_time = clk::now();\n\n if (print_stats) {\n auto setup_duration = setup_time - start_time;\n auto comp_duration = comp_time - setup_time;\n auto end_duration = end_time - comp_time;\n\n size_t in_size = use_stdin ? 0 : io::read_file_size(file);\n size_t out_size = use_stdout ? 0 : io::read_file_size(ofile);\n\n json::Object meta;\n meta.set(\"startTime\",\n std::chrono::duration_cast<std::chrono::seconds>(\n start_time.time_since_epoch()).count());\n\n meta.set(\"config\", selection.id_string());\n meta.set(\"input\", use_stdin ? \"<stdin>\" : file);\n meta.set(\"inputSize\", in_size);\n meta.set(\"output\", use_stdout ? \"<stdin>\" : ofile);\n meta.set(\"outputSize\", out_size);\n meta.set(\"rate\", (use_stdin || use_stdout) ? 0.0 :\n double(out_size) \/ double(in_size));\n\n json::Object stats;\n stats.set(\"meta\", meta);\n stats.set(\"data\", algo_stats.to_json());\n\n stats.str(std::cout);\n std::cout << std::endl;\n }\n } catch (std::exception& e) {\n std::cout << \"Error: \" << e.what() << '\\n';\n return 1;\n }\n\n return 0;\n}\n<|endoftext|>"} {"text":"<commit_before>\/\/ =============================================================================\n\/\/ PROJECT CHRONO - http:\/\/projectchrono.org\n\/\/\n\/\/ Copyright (c) 2014 projectchrono.org\n\/\/ All right reserved.\n\/\/\n\/\/ Use of this source code is governed by a BSD-style license that can be found\n\/\/ in the LICENSE file at the top level of the distribution and at\n\/\/ http:\/\/projectchrono.org\/license-chrono.txt.\n\/\/\n\/\/ =============================================================================\n\/\/ Authors: Hammad Mazhar\n\/\/ =============================================================================\n\/\/\n\/\/ ChronoParallel unit test for MPR collision detection\n\/\/ =============================================================================\n\n#include <stdio.h>\n#include <vector>\n#include <cmath>\n\n#include \"unit_testing.h\"\n#include \"chrono_parallel\/math\/mat33.h\"\n\nusing namespace chrono;\nint main(int argc, char* argv[]) {\n real3 n = Normalize(real3(rand(), rand(), rand()));\n quaternion R1 = Normalize(quaternion(rand(), rand(), rand(), rand()));\n quaternion R2 = Normalize(quaternion(rand(), rand(), rand(), rand()));\n\n const Mat33 A1(1, 2, 4, 5, 6, 7, 8, 9, 10);\n const Mat33 A2(10, 2, 4, 7, 2, 5, 8, 3, 1);\n const Mat33 A3(1, 0, 5, 2, 1, 6, 3, 4, 0);\n const Mat33 A4(-24, 20, -5, 18, -15, 4, 5, -4, 1);\n const Mat33 A4_T(-24, 18, 5, 20, -15, -4, -5, 4, 1);\n const Mat33 A5(0.0, 6.4, 3.2, 4.0, -0.8, 3.2, 6.4, 3.2, 5.6);\n ChMatrix33<real> B1 = ChMatrix33<real>(ToChMatrix33(A1));\n ChMatrix33<real> B2 = ChMatrix33<real>(ToChMatrix33(A2));\n real3 a1(1, 2, 3);\n real3 a2(6, 7, 8);\n ChVector<> b1(1, 2, 3);\n ChVector<> b2(6, 7, 8);\n std::cout << \"3x3 Matrix Tests ============\\n\";\n std::cout << \"A Matrix\\n\";\n WeakEqual(Mat33(R1), ToMat33(ToChQuaternion(R1)), C_EPSILON * 3);\n\n std::cout << \"Multiply Matrix\\n\";\n WeakEqual(A1 * A2, ToMat33(B1 * B2));\n\n std::cout << \"Multiply Matrix Vector\\n\";\n WeakEqual(A1 * a1, ToReal3(B1 * b1));\n\n std::cout << \"Add Matrix\\n\";\n WeakEqual(A1 + A2, ToMat33(B1 + B2));\n\n std::cout << \"Subtract Matrix\\n\";\n WeakEqual(A1 - A2, ToMat33(B1 - B2));\n\n std::cout << \"Post Scale Matrix\\n\";\n WeakEqual(A1 * 3.1, ToMat33(B1 * 3.1));\n\n std::cout << \"Pre Scale Matrix\\n\";\n WeakEqual(3.1 * A1, ToMat33(B1 * 3.1));\n {\n std::cout << \"Cross Matrix\\n\";\n Mat33 cross_m1 = SkewSymmetric(n);\n ChMatrix33<real> cross_m2;\n cross_m2.Set_X_matrix(ToChVector(n));\n WeakEqual(cross_m1, ToMat33(cross_m2));\n }\n {\n std::cout << \"Multiply T Matrix \\n\";\n Mat33 Res1 = TransposeMult(A1, A2);\n ChMatrix33<real> Res2;\n Res2.MatrTMultiply(B1, B2);\n WeakEqual(Res1, ToMat33(Res2), C_EPSILON * 2);\n }\n\n {\n std::cout << \"Multiply Matrix T\\n\";\n ChMatrix33<real> Res2;\n Res2.MatrMultiplyT(B1, B2);\n WeakEqual(MultTranspose(A1, A2), ToMat33(Res2), C_EPSILON * 2);\n }\n\n {\n std::cout << \"Outer Product\\n\";\n Mat33 Res1 = OuterProduct(a1, a2);\n Mat33 Res2(6, 12, 18, 7, 14, 21, 8, 16, 24);\n WeakEqual(Res1, Res2, C_EPSILON);\n }\n std::cout << \"Transpose\\n\";\n WeakEqual(Transpose(A4), A4_T, C_EPSILON);\n\n std::cout << \"Determinant\\n\";\n WeakEqual(Determinant(A5), 45.056, C_EPSILON * 400);\n\n std::cout << \"Trace\\n\";\n WeakEqual(Trace(A5), 4.8, C_EPSILON);\n\n std::cout << \"Adjoint\\n\";\n WeakEqual(Adjoint(A3), A4, C_EPSILON);\n\n std::cout << \"Adjoint Transpose\\n\";\n WeakEqual(AdjointTranspose(A4), Transpose(A3), C_EPSILON);\n\n std::cout << \"Inverse\\n\";\n WeakEqual(Inverse(A3), A4, C_EPSILON);\n\n std::cout << \"Inverse Transpose\\n\";\n WeakEqual(InverseTranspose(A3), Transpose(Inverse(A3)), C_EPSILON);\n\n std::cout << \"Frobenius Norm\\n\";\n WeakEqual(Norm(A5), 12.674383614203887588, C_EPSILON);\n\n std::cout << \"Largest Column Normalized\\n\";\n WeakEqual(LargestColumnNormalized(A4), real3(-.75856744948921676267,0.63213954124101396889, -.15803488531025349222), C_EPSILON);\n\n std::cout << \"Symm3x3 Matrix Tests ============\\n\";\n std::cout << \"Normal Equations Matrix\\n\";\n WeakEqual(NormalEquationsMatrix(A3), Transpose(A3)*A3, C_EPSILON);\n WeakEqual(NormalEquationsMatrix(A3), Mat33(26,32,3,32,41,10,3,10,25), C_EPSILON);\n\n\n return 0;\n}\n<commit_msg>Add more matrix tests<commit_after>\/\/ =============================================================================\n\/\/ PROJECT CHRONO - http:\/\/projectchrono.org\n\/\/\n\/\/ Copyright (c) 2014 projectchrono.org\n\/\/ All right reserved.\n\/\/\n\/\/ Use of this source code is governed by a BSD-style license that can be found\n\/\/ in the LICENSE file at the top level of the distribution and at\n\/\/ http:\/\/projectchrono.org\/license-chrono.txt.\n\/\/\n\/\/ =============================================================================\n\/\/ Authors: Hammad Mazhar\n\/\/ =============================================================================\n\/\/\n\/\/ ChronoParallel unit test for MPR collision detection\n\/\/ =============================================================================\n\n#include <stdio.h>\n#include <vector>\n#include <cmath>\n\n#include \"unit_testing.h\"\n#include \"chrono_parallel\/math\/mat33.h\"\n\nusing namespace chrono;\nint main(int argc, char* argv[]) {\n real3 n = Normalize(real3(rand(), rand(), rand()));\n quaternion R1 = Normalize(quaternion(rand(), rand(), rand(), rand()));\n quaternion R2 = Normalize(quaternion(rand(), rand(), rand(), rand()));\n const Mat33 AOne(1, 1, 1, 1, 1, 1, 1, 1, 1);\n const Mat33 A1(1, 2, 4, 5, 6, 7, 8, 9, 10);\n const Mat33 A2(10, 2, 4, 7, 2, 5, 8, 3, 1);\n const Mat33 A3(1, 0, 5, 2, 1, 6, 3, 4, 0);\n const Mat33 A4(-24, 20, -5, 18, -15, 4, 5, -4, 1);\n const Mat33 A4_T(-24, 18, 5, 20, -15, -4, -5, 4, 1);\n const Mat33 A5(0.0, 6.4, 3.2, 4.0, -0.8, 3.2, 6.4, 3.2, 5.6);\n ChMatrix33<real> BOne = ChMatrix33<real>(ToChMatrix33(AOne));\n ChMatrix33<real> B1 = ChMatrix33<real>(ToChMatrix33(A1));\n ChMatrix33<real> B2 = ChMatrix33<real>(ToChMatrix33(A2));\n\n real3 a1(1, 2, 3);\n real3 a2(6, 7, 8);\n ChVector<> b1(1, 2, 3);\n ChVector<> b2(6, 7, 8);\n std::cout << \"3x3 Matrix Tests ============\\n\";\n std::cout << \"0 Matrix\\n\";\n WeakEqual(Mat33(0), ToMat33(ChMatrix33<real>(0)));\n\n std::cout << \"Diag Matrix\\n\";\n WeakEqual(Mat33(1), Mat33(1, 0, 0, 0, 1, 0, 0, 0, 1));\n\n std::cout << \"Diag 3 Matrix\\n\";\n WeakEqual(Mat33(real3(1, 2, 3)), Mat33(1, 0, 0, 0, 2, 0, 0, 0, 3));\n\n std::cout << \"Copy Constructor\\n\";\n WeakEqual(Mat33(A1), A1);\n {\n std::cout << \"= Operator\\n\";\n Mat33 T = A1;\n WeakEqual(T, A1);\n }\n\n std::cout << \"A Matrix\\n\";\n WeakEqual(Mat33(R1), ToMat33(ToChQuaternion(R1)), C_EPSILON * 3);\n\n std::cout << \"Multiply Matrix\\n\";\n WeakEqual(AOne * AOne, ToMat33(BOne * BOne));\n\n std::cout << \"Multiply Matrix\\n\";\n WeakEqual(A1 * A2, ToMat33(B1 * B2));\n\n std::cout << \"Multiply Matrix Vector\\n\";\n WeakEqual(A1 * a1, ToReal3(B1 * b1));\n\n std::cout << \"Add Matrix\\n\";\n WeakEqual(A1 + A2, ToMat33(B1 + B2));\n\n std::cout << \"Subtract Matrix\\n\";\n WeakEqual(A1 - A2, ToMat33(B1 - B2));\n\n std::cout << \"Post Scale Matrix\\n\";\n WeakEqual(A1 * 3.1, ToMat33(B1 * 3.1));\n\n std::cout << \"Pre Scale Matrix\\n\";\n WeakEqual(3.1 * A1, ToMat33(B1 * 3.1));\n {\n std::cout << \"Cross Matrix\\n\";\n Mat33 cross_m1 = SkewSymmetric(n);\n ChMatrix33<real> cross_m2;\n cross_m2.Set_X_matrix(ToChVector(n));\n WeakEqual(cross_m1, ToMat33(cross_m2));\n }\n {\n std::cout << \"Multiply T Matrix \\n\";\n Mat33 Res1 = TransposeMult(A1, A2);\n ChMatrix33<real> Res2;\n Res2.MatrTMultiply(B1, B2);\n WeakEqual(Res1, ToMat33(Res2), C_EPSILON * 2);\n }\n\n {\n std::cout << \"Multiply Matrix T\\n\";\n ChMatrix33<real> Res2;\n Res2.MatrMultiplyT(B1, B2);\n WeakEqual(MultTranspose(A1, A2), ToMat33(Res2), C_EPSILON * 2);\n }\n\n {\n std::cout << \"Outer Product\\n\";\n Mat33 Res1 = OuterProduct(a1, a2);\n Mat33 Res2(6, 12, 18, 7, 14, 21, 8, 16, 24);\n WeakEqual(Res1, Res2, C_EPSILON);\n }\n std::cout << \"Transpose\\n\";\n WeakEqual(Transpose(A4), A4_T, C_EPSILON);\n\n std::cout << \"Determinant\\n\";\n WeakEqual(Determinant(A5), 45.056, C_EPSILON * 400);\n\n std::cout << \"Trace\\n\";\n WeakEqual(Trace(A5), 4.8, C_EPSILON);\n\n std::cout << \"Adjoint\\n\";\n WeakEqual(Adjoint(A3), A4, C_EPSILON);\n\n std::cout << \"Adjoint Transpose\\n\";\n WeakEqual(AdjointTranspose(A4), Transpose(A3), C_EPSILON);\n\n std::cout << \"Inverse\\n\";\n WeakEqual(Inverse(A3), A4, C_EPSILON);\n\n std::cout << \"Inverse Transpose\\n\";\n WeakEqual(InverseTranspose(A3), Transpose(Inverse(A3)), C_EPSILON);\n\n std::cout << \"Frobenius Norm\\n\";\n WeakEqual(Norm(A5), 12.674383614203887588, C_EPSILON);\n\n std::cout << \"Largest Column Normalized\\n\";\n WeakEqual(LargestColumnNormalized(A4),\n real3(-.75856744948921676267, 0.63213954124101396889, -.15803488531025349222), C_EPSILON);\n\n std::cout << \"Normal Equations Matrix\\n\";\n WeakEqual(NormalEquationsMatrix(A3), Transpose(A3) * A3, C_EPSILON);\n WeakEqual(NormalEquationsMatrix(A3), Mat33(26, 32, 3, 32, 41, 10, 3, 10, 25), C_EPSILON);\n\n std::cout << \"Symm2x2 Matrix Tests ============\\n\";\n {\n std::cout << \"A^T*B With Symmetric Result\\n\";\n\n Mat32 C1(real3(1, 2, 3), real3(3, 2, 6));\n Mat32 C2(real3(2, 3, 1), real3(2, 2, 4));\n\n SymMat22 RES = TransposeTimesWithSymmetricResult(C1, C2);\n WeakEqual(RES, SymMat22(11, 18, 34));\n }\n\n return 0;\n}\n<|endoftext|>"} {"text":"<commit_before>\/\/ Copyright 2020 Oath Inc. Licensed under the terms of the Apache 2.0 license. See LICENSE in the project root.\n\n#include \"dense_matmul_function.h\"\n#include \"dense_tensor_view.h\"\n#include <vespa\/vespalib\/objects\/objectvisitor.h>\n#include <vespa\/eval\/eval\/value.h>\n#include <vespa\/eval\/eval\/operation.h>\n#include <cassert>\n\n#include <cblas.h>\n\nnamespace vespalib::tensor {\n\nusing eval::ValueType;\nusing eval::TensorFunction;\nusing eval::TensorEngine;\nusing eval::as;\nusing eval::Aggr;\nusing namespace eval::tensor_function;\nusing namespace eval::operation;\n\nnamespace {\n\ntemplate <typename LCT, typename RCT, bool lhs_common_inner, bool rhs_common_inner>\ndouble my_dot_product(const LCT *lhs, const RCT *rhs, size_t lhs_size, size_t common_size, size_t rhs_size) {\n double result = 0.0;\n for (size_t i = 0; i < common_size; ++i) {\n result += ((*lhs) * (*rhs));\n lhs += (lhs_common_inner ? 1 : lhs_size);\n rhs += (rhs_common_inner ? 1 : rhs_size);\n }\n return result;\n}\n\ntemplate <typename LCT, typename RCT, bool lhs_common_inner, bool rhs_common_inner>\nvoid my_matmul_op(eval::InterpretedFunction::State &state, uint64_t param) {\n const DenseMatMulFunction::Self &self = *((const DenseMatMulFunction::Self *)(param));\n using OCT = typename eval::UnifyCellTypes<LCT,RCT>::type;\n auto lhs_cells = DenseTensorView::typify_cells<LCT>(state.peek(1));\n auto rhs_cells = DenseTensorView::typify_cells<RCT>(state.peek(0));\n auto dst_cells = state.stash.create_array<OCT>(self.lhs_size * self.rhs_size);\n OCT *dst = dst_cells.begin();\n const LCT *lhs = lhs_cells.cbegin();\n for (size_t i = 0; i < self.lhs_size; ++i) {\n const RCT *rhs = rhs_cells.cbegin();\n for (size_t j = 0; j < self.rhs_size; ++j) {\n *dst++ = my_dot_product<LCT,RCT,lhs_common_inner,rhs_common_inner>(lhs, rhs, self.lhs_size, self.common_size, self.rhs_size);\n rhs += (rhs_common_inner ? self.common_size : 1);\n }\n lhs += (lhs_common_inner ? self.common_size : 1);\n }\n state.pop_pop_push(state.stash.create<DenseTensorView>(self.result_type, TypedCells(dst_cells)));\n}\n\ntemplate <bool lhs_common_inner, bool rhs_common_inner>\nvoid my_cblas_double_matmul_op(eval::InterpretedFunction::State &state, uint64_t param) {\n const DenseMatMulFunction::Self &self = *((const DenseMatMulFunction::Self *)(param));\n auto lhs_cells = DenseTensorView::typify_cells<double>(state.peek(1));\n auto rhs_cells = DenseTensorView::typify_cells<double>(state.peek(0));\n auto dst_cells = state.stash.create_array<double>(self.lhs_size * self.rhs_size);\n cblas_dgemm(CblasRowMajor, lhs_common_inner ? CblasNoTrans : CblasTrans, rhs_common_inner ? CblasTrans : CblasNoTrans,\n self.lhs_size, self.rhs_size, self.common_size, 1.0,\n lhs_cells.cbegin(), lhs_common_inner ? self.common_size : self.lhs_size,\n rhs_cells.cbegin(), rhs_common_inner ? self.common_size : self.rhs_size,\n 0.0, dst_cells.begin(), self.rhs_size);\n state.pop_pop_push(state.stash.create<DenseTensorView>(self.result_type, TypedCells(dst_cells)));\n}\n\ntemplate <bool lhs_common_inner, bool rhs_common_inner>\nvoid my_cblas_float_matmul_op(eval::InterpretedFunction::State &state, uint64_t param) {\n const DenseMatMulFunction::Self &self = *((const DenseMatMulFunction::Self *)(param));\n auto lhs_cells = DenseTensorView::typify_cells<float>(state.peek(1));\n auto rhs_cells = DenseTensorView::typify_cells<float>(state.peek(0));\n auto dst_cells = state.stash.create_array<float>(self.lhs_size * self.rhs_size);\n cblas_sgemm(CblasRowMajor, lhs_common_inner ? CblasNoTrans : CblasTrans, rhs_common_inner ? CblasTrans : CblasNoTrans,\n self.lhs_size, self.rhs_size, self.common_size, 1.0,\n lhs_cells.cbegin(), lhs_common_inner ? self.common_size : self.lhs_size,\n rhs_cells.cbegin(), rhs_common_inner ? self.common_size : self.rhs_size,\n 0.0, dst_cells.begin(), self.rhs_size);\n state.pop_pop_push(state.stash.create<DenseTensorView>(self.result_type, TypedCells(dst_cells)));\n}\n\nbool is_matrix(const ValueType &type) {\n return (type.is_dense() && (type.dimensions().size() == 2));\n}\n\nbool is_matmul(const eval::ValueType &a, const eval::ValueType &b,\n const vespalib::string &reduce_dim, const eval::ValueType &result_type)\n{\n size_t npos = ValueType::Dimension::npos;\n return (is_matrix(a) && is_matrix(b) && is_matrix(result_type) &&\n (a.dimension_index(reduce_dim) != npos) &&\n (b.dimension_index(reduce_dim) != npos));\n}\n\nconst ValueType::Dimension &dim(const TensorFunction &expr, size_t idx) {\n return expr.result_type().dimensions()[idx];\n}\n\nsize_t inv(size_t idx) { return (1 - idx); }\n\nconst TensorFunction &create_matmul(const TensorFunction &a, const TensorFunction &b,\n const vespalib::string &reduce_dim, const ValueType &result_type, Stash &stash) {\n size_t a_idx = a.result_type().dimension_index(reduce_dim);\n size_t b_idx = b.result_type().dimension_index(reduce_dim);\n assert(a_idx != ValueType::Dimension::npos);\n assert(b_idx != ValueType::Dimension::npos);\n assert(dim(a, a_idx).size == dim(b, b_idx).size);\n bool a_common_inner = (a_idx == 1);\n bool b_common_inner = (b_idx == 1);\n size_t a_size = dim(a, inv(a_idx)).size;\n size_t b_size = dim(b, inv(b_idx)).size;\n size_t common_size = dim(a, a_idx).size;\n bool a_is_lhs = (dim(a, inv(a_idx)).name < dim(b, inv(b_idx)).name);\n if (a_is_lhs) {\n return stash.create<DenseMatMulFunction>(result_type, a, b, a_size, common_size, b_size, a_common_inner, b_common_inner);\n } else {\n return stash.create<DenseMatMulFunction>(result_type, b, a, b_size, common_size, a_size, b_common_inner, a_common_inner);\n }\n}\n\ntemplate <typename LCT, typename RCT, bool lhs_common_inner, bool rhs_common_inner>\nstruct MyMatMulOp {\n static auto get_fun() {\n return my_matmul_op<LCT, RCT, lhs_common_inner, rhs_common_inner>;\n }\n};\n\ntemplate <bool lhs_common_inner, bool rhs_common_inner>\nstruct MyMatMulOp<double, double, lhs_common_inner, rhs_common_inner> {\n static auto get_fun() {\n return my_cblas_double_matmul_op<lhs_common_inner, rhs_common_inner>;\n }\n};\n\ntemplate <bool lhs_common_inner, bool rhs_common_inner>\nstruct MyMatMulOp<float, float, lhs_common_inner, rhs_common_inner> {\n static auto get_fun() {\n return my_cblas_float_matmul_op<lhs_common_inner, rhs_common_inner>;\n }\n};\n\nstruct MyTarget {\n template<typename R1, typename R2, typename R3, typename R4>\n static auto invoke() {\n using MyOp = MyMatMulOp<R1, R2, R3::value, R4::value>;\n return MyOp::get_fun();\n }\n};\n\n} \/\/ namespace vespalib::tensor::<unnamed>\n\nDenseMatMulFunction::Self::Self(const eval::ValueType &result_type_in,\n size_t lhs_size_in,\n size_t common_size_in,\n size_t rhs_size_in)\n : result_type(result_type_in),\n lhs_size(lhs_size_in),\n common_size(common_size_in),\n rhs_size(rhs_size_in)\n{\n}\n\nDenseMatMulFunction::Self::~Self() = default;\n\nDenseMatMulFunction::DenseMatMulFunction(const eval::ValueType &result_type,\n const eval::TensorFunction &lhs_in,\n const eval::TensorFunction &rhs_in,\n size_t lhs_size,\n size_t common_size,\n size_t rhs_size,\n bool lhs_common_inner,\n bool rhs_common_inner)\n : Super(result_type, lhs_in, rhs_in),\n _lhs_size(lhs_size),\n _common_size(common_size),\n _rhs_size(rhs_size),\n _lhs_common_inner(lhs_common_inner),\n _rhs_common_inner(rhs_common_inner)\n{\n}\n\nDenseMatMulFunction::~DenseMatMulFunction() = default;\n\neval::InterpretedFunction::Instruction\nDenseMatMulFunction::compile_self(const TensorEngine &, Stash &stash) const\n{\n using MyTypify = TypifyValue<eval::TypifyCellType,vespalib::TypifyBool>;\n Self &self = stash.create<Self>(result_type(), _lhs_size, _common_size, _rhs_size);\n auto op = typify_invoke<4,MyTypify,MyTarget>(\n lhs().result_type().cell_type(), rhs().result_type().cell_type(),\n _lhs_common_inner, _rhs_common_inner);\n return eval::InterpretedFunction::Instruction(op, (uint64_t)(&self));\n}\n\nvoid\nDenseMatMulFunction::visit_self(vespalib::ObjectVisitor &visitor) const\n{\n Super::visit_self(visitor);\n visitor.visitInt(\"lhs_size\", _lhs_size);\n visitor.visitInt(\"common_size\", _common_size);\n visitor.visitInt(\"rhs_size\", _rhs_size);\n visitor.visitBool(\"lhs_common_inner\", _lhs_common_inner);\n visitor.visitBool(\"rhs_common_inner\", _rhs_common_inner);\n}\n\nconst TensorFunction &\nDenseMatMulFunction::optimize(const eval::TensorFunction &expr, Stash &stash)\n{\n auto reduce = as<Reduce>(expr);\n if (reduce && (reduce->aggr() == Aggr::SUM) && (reduce->dimensions().size() == 1)) {\n auto join = as<Join>(reduce->child());\n if (join && (join->function() == Mul::f)) {\n const TensorFunction &a = join->lhs();\n const TensorFunction &b = join->rhs();\n if (is_matmul(a.result_type(), b.result_type(), reduce->dimensions()[0], expr.result_type())) {\n return create_matmul(a, b, reduce->dimensions()[0], expr.result_type(), stash);\n }\n }\n }\n return expr;\n}\n\n} \/\/ namespace vespalib::tensor\n<commit_msg>replace template magic with if statement<commit_after>\/\/ Copyright 2020 Oath Inc. Licensed under the terms of the Apache 2.0 license. See LICENSE in the project root.\n\n#include \"dense_matmul_function.h\"\n#include \"dense_tensor_view.h\"\n#include <vespa\/vespalib\/objects\/objectvisitor.h>\n#include <vespa\/eval\/eval\/value.h>\n#include <vespa\/eval\/eval\/operation.h>\n#include <cassert>\n\n#include <cblas.h>\n\nnamespace vespalib::tensor {\n\nusing eval::ValueType;\nusing eval::TensorFunction;\nusing eval::TensorEngine;\nusing eval::as;\nusing eval::Aggr;\nusing namespace eval::tensor_function;\nusing namespace eval::operation;\n\nnamespace {\n\ntemplate <typename LCT, typename RCT, bool lhs_common_inner, bool rhs_common_inner>\ndouble my_dot_product(const LCT *lhs, const RCT *rhs, size_t lhs_size, size_t common_size, size_t rhs_size) {\n double result = 0.0;\n for (size_t i = 0; i < common_size; ++i) {\n result += ((*lhs) * (*rhs));\n lhs += (lhs_common_inner ? 1 : lhs_size);\n rhs += (rhs_common_inner ? 1 : rhs_size);\n }\n return result;\n}\n\ntemplate <typename LCT, typename RCT, bool lhs_common_inner, bool rhs_common_inner>\nvoid my_matmul_op(eval::InterpretedFunction::State &state, uint64_t param) {\n const DenseMatMulFunction::Self &self = *((const DenseMatMulFunction::Self *)(param));\n using OCT = typename eval::UnifyCellTypes<LCT,RCT>::type;\n auto lhs_cells = DenseTensorView::typify_cells<LCT>(state.peek(1));\n auto rhs_cells = DenseTensorView::typify_cells<RCT>(state.peek(0));\n auto dst_cells = state.stash.create_array<OCT>(self.lhs_size * self.rhs_size);\n OCT *dst = dst_cells.begin();\n const LCT *lhs = lhs_cells.cbegin();\n for (size_t i = 0; i < self.lhs_size; ++i) {\n const RCT *rhs = rhs_cells.cbegin();\n for (size_t j = 0; j < self.rhs_size; ++j) {\n *dst++ = my_dot_product<LCT,RCT,lhs_common_inner,rhs_common_inner>(lhs, rhs, self.lhs_size, self.common_size, self.rhs_size);\n rhs += (rhs_common_inner ? self.common_size : 1);\n }\n lhs += (lhs_common_inner ? self.common_size : 1);\n }\n state.pop_pop_push(state.stash.create<DenseTensorView>(self.result_type, TypedCells(dst_cells)));\n}\n\ntemplate <bool lhs_common_inner, bool rhs_common_inner>\nvoid my_cblas_double_matmul_op(eval::InterpretedFunction::State &state, uint64_t param) {\n const DenseMatMulFunction::Self &self = *((const DenseMatMulFunction::Self *)(param));\n auto lhs_cells = DenseTensorView::typify_cells<double>(state.peek(1));\n auto rhs_cells = DenseTensorView::typify_cells<double>(state.peek(0));\n auto dst_cells = state.stash.create_array<double>(self.lhs_size * self.rhs_size);\n cblas_dgemm(CblasRowMajor, lhs_common_inner ? CblasNoTrans : CblasTrans, rhs_common_inner ? CblasTrans : CblasNoTrans,\n self.lhs_size, self.rhs_size, self.common_size, 1.0,\n lhs_cells.cbegin(), lhs_common_inner ? self.common_size : self.lhs_size,\n rhs_cells.cbegin(), rhs_common_inner ? self.common_size : self.rhs_size,\n 0.0, dst_cells.begin(), self.rhs_size);\n state.pop_pop_push(state.stash.create<DenseTensorView>(self.result_type, TypedCells(dst_cells)));\n}\n\ntemplate <bool lhs_common_inner, bool rhs_common_inner>\nvoid my_cblas_float_matmul_op(eval::InterpretedFunction::State &state, uint64_t param) {\n const DenseMatMulFunction::Self &self = *((const DenseMatMulFunction::Self *)(param));\n auto lhs_cells = DenseTensorView::typify_cells<float>(state.peek(1));\n auto rhs_cells = DenseTensorView::typify_cells<float>(state.peek(0));\n auto dst_cells = state.stash.create_array<float>(self.lhs_size * self.rhs_size);\n cblas_sgemm(CblasRowMajor, lhs_common_inner ? CblasNoTrans : CblasTrans, rhs_common_inner ? CblasTrans : CblasNoTrans,\n self.lhs_size, self.rhs_size, self.common_size, 1.0,\n lhs_cells.cbegin(), lhs_common_inner ? self.common_size : self.lhs_size,\n rhs_cells.cbegin(), rhs_common_inner ? self.common_size : self.rhs_size,\n 0.0, dst_cells.begin(), self.rhs_size);\n state.pop_pop_push(state.stash.create<DenseTensorView>(self.result_type, TypedCells(dst_cells)));\n}\n\nbool is_matrix(const ValueType &type) {\n return (type.is_dense() && (type.dimensions().size() == 2));\n}\n\nbool is_matmul(const eval::ValueType &a, const eval::ValueType &b,\n const vespalib::string &reduce_dim, const eval::ValueType &result_type)\n{\n size_t npos = ValueType::Dimension::npos;\n return (is_matrix(a) && is_matrix(b) && is_matrix(result_type) &&\n (a.dimension_index(reduce_dim) != npos) &&\n (b.dimension_index(reduce_dim) != npos));\n}\n\nconst ValueType::Dimension &dim(const TensorFunction &expr, size_t idx) {\n return expr.result_type().dimensions()[idx];\n}\n\nsize_t inv(size_t idx) { return (1 - idx); }\n\nconst TensorFunction &create_matmul(const TensorFunction &a, const TensorFunction &b,\n const vespalib::string &reduce_dim, const ValueType &result_type, Stash &stash) {\n size_t a_idx = a.result_type().dimension_index(reduce_dim);\n size_t b_idx = b.result_type().dimension_index(reduce_dim);\n assert(a_idx != ValueType::Dimension::npos);\n assert(b_idx != ValueType::Dimension::npos);\n assert(dim(a, a_idx).size == dim(b, b_idx).size);\n bool a_common_inner = (a_idx == 1);\n bool b_common_inner = (b_idx == 1);\n size_t a_size = dim(a, inv(a_idx)).size;\n size_t b_size = dim(b, inv(b_idx)).size;\n size_t common_size = dim(a, a_idx).size;\n bool a_is_lhs = (dim(a, inv(a_idx)).name < dim(b, inv(b_idx)).name);\n if (a_is_lhs) {\n return stash.create<DenseMatMulFunction>(result_type, a, b, a_size, common_size, b_size, a_common_inner, b_common_inner);\n } else {\n return stash.create<DenseMatMulFunction>(result_type, b, a, b_size, common_size, a_size, b_common_inner, a_common_inner);\n }\n}\n\nstruct MyGetFun {\n template<typename R1, typename R2, typename R3, typename R4> static auto invoke() {\n if (std::is_same_v<R1,double> && std::is_same_v<R2,double>) {\n return my_cblas_double_matmul_op<R3::value, R4::value>;\n } else if (std::is_same_v<R1,float> && std::is_same_v<R2,float>) {\n return my_cblas_float_matmul_op<R3::value, R4::value>;\n } else {\n return my_matmul_op<R1, R2, R3::value, R4::value>;\n }\n }\n};\n\n} \/\/ namespace vespalib::tensor::<unnamed>\n\nDenseMatMulFunction::Self::Self(const eval::ValueType &result_type_in,\n size_t lhs_size_in,\n size_t common_size_in,\n size_t rhs_size_in)\n : result_type(result_type_in),\n lhs_size(lhs_size_in),\n common_size(common_size_in),\n rhs_size(rhs_size_in)\n{\n}\n\nDenseMatMulFunction::Self::~Self() = default;\n\nDenseMatMulFunction::DenseMatMulFunction(const eval::ValueType &result_type,\n const eval::TensorFunction &lhs_in,\n const eval::TensorFunction &rhs_in,\n size_t lhs_size,\n size_t common_size,\n size_t rhs_size,\n bool lhs_common_inner,\n bool rhs_common_inner)\n : Super(result_type, lhs_in, rhs_in),\n _lhs_size(lhs_size),\n _common_size(common_size),\n _rhs_size(rhs_size),\n _lhs_common_inner(lhs_common_inner),\n _rhs_common_inner(rhs_common_inner)\n{\n}\n\nDenseMatMulFunction::~DenseMatMulFunction() = default;\n\neval::InterpretedFunction::Instruction\nDenseMatMulFunction::compile_self(const TensorEngine &, Stash &stash) const\n{\n using MyTypify = TypifyValue<eval::TypifyCellType,TypifyBool>;\n Self &self = stash.create<Self>(result_type(), _lhs_size, _common_size, _rhs_size);\n auto op = typify_invoke<4,MyTypify,MyGetFun>(\n lhs().result_type().cell_type(), rhs().result_type().cell_type(),\n _lhs_common_inner, _rhs_common_inner);\n return eval::InterpretedFunction::Instruction(op, (uint64_t)(&self));\n}\n\nvoid\nDenseMatMulFunction::visit_self(vespalib::ObjectVisitor &visitor) const\n{\n Super::visit_self(visitor);\n visitor.visitInt(\"lhs_size\", _lhs_size);\n visitor.visitInt(\"common_size\", _common_size);\n visitor.visitInt(\"rhs_size\", _rhs_size);\n visitor.visitBool(\"lhs_common_inner\", _lhs_common_inner);\n visitor.visitBool(\"rhs_common_inner\", _rhs_common_inner);\n}\n\nconst TensorFunction &\nDenseMatMulFunction::optimize(const eval::TensorFunction &expr, Stash &stash)\n{\n auto reduce = as<Reduce>(expr);\n if (reduce && (reduce->aggr() == Aggr::SUM) && (reduce->dimensions().size() == 1)) {\n auto join = as<Join>(reduce->child());\n if (join && (join->function() == Mul::f)) {\n const TensorFunction &a = join->lhs();\n const TensorFunction &b = join->rhs();\n if (is_matmul(a.result_type(), b.result_type(), reduce->dimensions()[0], expr.result_type())) {\n return create_matmul(a, b, reduce->dimensions()[0], expr.result_type(), stash);\n }\n }\n }\n return expr;\n}\n\n} \/\/ namespace vespalib::tensor\n<|endoftext|>"} {"text":"<commit_before>\/* Siconos is a program dedicated to modeling, simulation and control\n * of non smooth dynamical systems.\n *\n * Copyright 2016 INRIA.\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n*\/\n\n\/*!\\file BouncingBallTS.cpp\n \\brief \\ref EMBouncingBall - C++ input file, Time-Stepping version -\n V. Acary, F. Perignon.\n\n A Ball bouncing on the ground.\n Direct description of the model.\n Simulation with a Time-Stepping scheme.\n*\/\n\n#include \"SiconosKernel.hpp\"\n\nusing namespace std;\n\nint main(int argc, char* argv[])\n{\n try\n {\n\n \/\/ ================= Creation of the model =======================\n\n \/\/ User-defined main parameters\n unsigned int nDof = 3; \/\/ degrees of freedom for the ball\n double t0 = 0; \/\/ initial computation time\n double T = 10; \/\/ final computation time\n double h = 0.005; \/\/ time step\n double position_init = 1.0; \/\/ initial position for lowest bead.\n double velocity_init = 0.0; \/\/ initial velocity for lowest bead.\n double theta = 0.5; \/\/ theta for MoreauJeanOSI integrator\n double R = 0.1; \/\/ Ball radius\n double m = 1; \/\/ Ball mass\n double g = 9.81; \/\/ Gravity\n \/\/ -------------------------\n \/\/ --- Dynamical systems ---\n \/\/ -------------------------\n\n cout << \"====> Model loading ...\" << endl;\n\n SP::SiconosMatrix Mass(new SimpleMatrix(nDof, nDof));\n (*Mass)(0, 0) = m;\n (*Mass)(1, 1) = m;\n (*Mass)(2, 2) = 2. \/ 5 * m * R * R;\n\n \/\/ -- Initial positions and velocities --\n SP::SiconosVector q0(new SiconosVector(nDof));\n SP::SiconosVector v0(new SiconosVector(nDof));\n (*q0)(0) = position_init;\n (*v0)(0) = velocity_init;\n\n \/\/ -- The dynamical system --\n SP::LagrangianLinearTIDS ball(new LagrangianLinearTIDS(q0, v0, Mass));\n\n \/\/ -- Set external forces (weight) --\n SP::SiconosVector weight(new SiconosVector(nDof));\n (*weight)(0) = -m * g;\n ball->setFExtPtr(weight);\n\n \/\/ --------------------\n \/\/ --- Interactions ---\n \/\/ --------------------\n\n \/\/ -- nslaw --\n double e = 0.9;\n\n \/\/ Interaction ball-floor\n \/\/\n SP::SimpleMatrix H(new SimpleMatrix(1, nDof));\n (*H)(0, 0) = 1.0;\n\n SP::NonSmoothLaw nslaw(new NewtonImpactNSL(e));\n SP::Relation relation(new LagrangianLinearTIR(H));\n\n SP::Interaction inter;\n\n \/\/ -------------\n \/\/ --- Model ---\n \/\/ -------------\n SP::NonSmoothDynamicalSystem bouncingBall(new NonSmoothDynamicalSystem(t0, T));\n\n \/\/ add the dynamical system in the non smooth dynamical system\n bouncingBall->insertDynamicalSystem(ball);\n\n \/\/ ------------------\n \/\/ --- Simulation ---\n \/\/ ------------------\n\n \/\/ -- (1) OneStepIntegrators --\n SP::MoreauJeanOSI OSI(new MoreauJeanOSI(theta));\n\n \/\/ -- (2) Time discretisation --\n SP::TimeDiscretisation t(new TimeDiscretisation(t0, h));\n\n \/\/ -- (3) one step non smooth problem\n SP::OneStepNSProblem osnspb(new LCP());\n\n \/\/ -- (4) Simulation setup with (1) (2) (3)\n SP::TimeStepping s(new TimeStepping(bouncingBall, t, OSI, osnspb));\n\n \/\/ =========================== End of model definition ===========================\n\n \/\/ ================================= Computation =================================\n\n \/\/ --- Simulation ---\n\n int N = ceil((T - t0) \/ h); \/\/ Number of time steps\n\n \/\/ --- Get the values to be plotted ---\n \/\/ -> saved in a matrix dataPlot\n unsigned int outputSize = 5;\n SimpleMatrix dataPlot(N + 1, outputSize);\n\n SP::SiconosVector q = ball->q();\n SP::SiconosVector v = ball->velocity();\n SP::SiconosVector p = ball->p(1);\n\n \/\/ lambda is zero until we create the Interaction\n SP::SiconosVector lambda(new SiconosVector(1));\n lambda->zero();\n\n dataPlot(0, 0) = bouncingBall->t0();\n dataPlot(0, 1) = (*q)(0);\n dataPlot(0, 2) = (*v)(0);\n dataPlot(0, 3) = (*p)(0);\n dataPlot(0, 4) = (*lambda)(0);\n \/\/ --- Time loop ---\n cout << \"====> Start computation ... \" << endl;\n \/\/ ==== Simulation loop - Writing without explicit event handling =====\n int k = 1;\n boost::progress_display show_progress(N);\n\n boost::timer time;\n time.restart();\n\n while (s->hasNextEvent())\n {\n if (k==200) {\n inter.reset(new Interaction(nslaw, relation));\n\n \/\/ link the interaction and the dynamical system\n bouncingBall->link(inter, ball);\n\n \/\/ new \"lambda\" pointer\n lambda = inter->lambda(1);\n }\n\n s->computeOneStep();\n\n s->clearNSDSChangeLog();\n\n \/\/ --- Get values to be plotted ---\n dataPlot(k, 0) = s->nextTime();\n dataPlot(k, 1) = (*q)(0);\n dataPlot(k, 2) = (*v)(0);\n dataPlot(k, 3) = (*p)(0);\n dataPlot(k, 4) = (*lambda)(0);\n s->nextStep();\n ++show_progress;\n k++;\n }\n cout << \"End of computation - Number of iterations done: \" << k - 1 << endl;\n cout << \"Computation Time \" << time.elapsed() << endl;\n\n \/\/ --- Output files ---\n cout << \"====> Output file writing ...\" << endl;\n dataPlot.resize(k, outputSize);\n ioMatrix::write(\"result.dat\", \"ascii\", dataPlot, \"noDim\");\n\n\n double error=0.0, eps=1e-12;\n if (ioMatrix::compareRefFile(dataPlot, \"BouncingBallTS-Dynamic.ref\", eps, error)\n && error > eps)\n return 1;\n\n }\n\n catch (SiconosException e)\n {\n cout << e.report() << endl;\n }\n catch (...)\n {\n cout << \"Exception caught in BouncingBallTS.cpp\" << endl;\n }\n\n\n\n}\n<commit_msg>[examples] with the new initialization process the insertion of a new interaction is taken into acount at the good time step<commit_after>\/* Siconos is a program dedicated to modeling, simulation and control\n * of non smooth dynamical systems.\n *\n * Copyright 2016 INRIA.\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n*\/\n\n\/*!\\file BouncingBallTS.cpp\n \\brief \\ref EMBouncingBall - C++ input file, Time-Stepping version -\n V. Acary, F. Perignon.\n\n A Ball bouncing on the ground.\n Direct description of the model.\n Simulation with a Time-Stepping scheme.\n*\/\n\n#include \"SiconosKernel.hpp\"\n\nusing namespace std;\n\nint main(int argc, char* argv[])\n{\n try\n {\n\n \/\/ ================= Creation of the model =======================\n\n \/\/ User-defined main parameters\n unsigned int nDof = 3; \/\/ degrees of freedom for the ball\n double t0 = 0; \/\/ initial computation time\n double T = 10; \/\/ final computation time\n double h = 0.005; \/\/ time step\n double position_init = 1.0; \/\/ initial position for lowest bead.\n double velocity_init = 0.0; \/\/ initial velocity for lowest bead.\n double theta = 0.5; \/\/ theta for MoreauJeanOSI integrator\n double R = 0.1; \/\/ Ball radius\n double m = 1; \/\/ Ball mass\n double g = 9.81; \/\/ Gravity\n \/\/ -------------------------\n \/\/ --- Dynamical systems ---\n \/\/ -------------------------\n\n cout << \"====> Model loading ...\" << endl;\n\n SP::SiconosMatrix Mass(new SimpleMatrix(nDof, nDof));\n (*Mass)(0, 0) = m;\n (*Mass)(1, 1) = m;\n (*Mass)(2, 2) = 2. \/ 5 * m * R * R;\n\n \/\/ -- Initial positions and velocities --\n SP::SiconosVector q0(new SiconosVector(nDof));\n SP::SiconosVector v0(new SiconosVector(nDof));\n (*q0)(0) = position_init;\n (*v0)(0) = velocity_init;\n\n \/\/ -- The dynamical system --\n SP::LagrangianLinearTIDS ball(new LagrangianLinearTIDS(q0, v0, Mass));\n\n \/\/ -- Set external forces (weight) --\n SP::SiconosVector weight(new SiconosVector(nDof));\n (*weight)(0) = -m * g;\n ball->setFExtPtr(weight);\n\n \/\/ --------------------\n \/\/ --- Interactions ---\n \/\/ --------------------\n\n \/\/ -- nslaw --\n double e = 0.9;\n\n \/\/ Interaction ball-floor\n \/\/\n SP::SimpleMatrix H(new SimpleMatrix(1, nDof));\n (*H)(0, 0) = 1.0;\n\n SP::NonSmoothLaw nslaw(new NewtonImpactNSL(e));\n SP::Relation relation(new LagrangianLinearTIR(H));\n\n SP::Interaction inter;\n\n \/\/ -------------\n \/\/ --- Model ---\n \/\/ -------------\n SP::NonSmoothDynamicalSystem bouncingBall(new NonSmoothDynamicalSystem(t0, T));\n\n \/\/ add the dynamical system in the non smooth dynamical system\n bouncingBall->insertDynamicalSystem(ball);\n\n \/\/ ------------------\n \/\/ --- Simulation ---\n \/\/ ------------------\n\n \/\/ -- (1) OneStepIntegrators --\n SP::MoreauJeanOSI OSI(new MoreauJeanOSI(theta));\n\n \/\/ -- (2) Time discretisation --\n SP::TimeDiscretisation t(new TimeDiscretisation(t0, h));\n\n \/\/ -- (3) one step non smooth problem\n SP::OneStepNSProblem osnspb(new LCP());\n\n \/\/ -- (4) Simulation setup with (1) (2) (3)\n SP::TimeStepping s(new TimeStepping(bouncingBall, t, OSI, osnspb));\n\n \/\/ =========================== End of model definition ===========================\n\n \/\/ ================================= Computation =================================\n\n \/\/ --- Simulation ---\n\n int N = ceil((T - t0) \/ h); \/\/ Number of time steps\n\n \/\/ --- Get the values to be plotted ---\n \/\/ -> saved in a matrix dataPlot\n unsigned int outputSize = 5;\n SimpleMatrix dataPlot(N + 1, outputSize);\n\n SP::SiconosVector q = ball->q();\n SP::SiconosVector v = ball->velocity();\n SP::SiconosVector p = ball->p(1);\n\n \/\/ lambda is zero until we create the Interaction\n SP::SiconosVector lambda(new SiconosVector(1));\n lambda->zero();\n\n dataPlot(0, 0) = bouncingBall->t0();\n dataPlot(0, 1) = (*q)(0);\n dataPlot(0, 2) = (*v)(0);\n dataPlot(0, 3) = (*p)(0);\n dataPlot(0, 4) = (*lambda)(0);\n \/\/ --- Time loop ---\n cout << \"====> Start computation ... \" << endl;\n \/\/ ==== Simulation loop - Writing without explicit event handling =====\n int k = 1;\n boost::progress_display show_progress(N);\n\n boost::timer time;\n time.restart();\n\n while (s->hasNextEvent())\n {\n if (k==201) {\n inter.reset(new Interaction(nslaw, relation));\n\n \/\/ link the interaction and the dynamical system\n bouncingBall->link(inter, ball);\n\n \/\/ new \"lambda\" pointer\n lambda = inter->lambda(1);\n }\n\n s->computeOneStep();\n\n s->clearNSDSChangeLog();\n\n \/\/ --- Get values to be plotted ---\n dataPlot(k, 0) = s->nextTime();\n dataPlot(k, 1) = (*q)(0);\n dataPlot(k, 2) = (*v)(0);\n dataPlot(k, 3) = (*p)(0);\n dataPlot(k, 4) = (*lambda)(0);\n s->nextStep();\n ++show_progress;\n k++;\n }\n cout << \"End of computation - Number of iterations done: \" << k - 1 << endl;\n cout << \"Computation Time \" << time.elapsed() << endl;\n\n \/\/ --- Output files ---\n cout << \"====> Output file writing ...\" << endl;\n dataPlot.resize(k, outputSize);\n ioMatrix::write(\"result.dat\", \"ascii\", dataPlot, \"noDim\");\n\n\n double error=0.0, eps=1e-12;\n if (ioMatrix::compareRefFile(dataPlot, \"BouncingBallTS-Dynamic.ref\", eps, error)\n && error > eps)\n return 1;\n\n }\n\n catch (SiconosException e)\n {\n cout << e.report() << endl;\n }\n catch (...)\n {\n cout << \"Exception caught in BouncingBallTS.cpp\" << endl;\n }\n\n\n\n}\n<|endoftext|>"} {"text":"<commit_before>\/\/\r\n\/\/ ban.hpp\r\n\/\/ ********\r\n\/\/\r\n\/\/ Copyright (c) 2020 Sharon Fox (sharon at xandium dot io)\r\n\/\/\r\n\/\/ Distributed under the MIT License. (See accompanying file LICENSE)\r\n\/\/\r\n\r\n#pragma once\r\n\r\n#include \"aegis\/config.hpp\"\r\n#include \"aegis\/snowflake.hpp\"\r\n#include \"aegis\/permission.hpp\"\r\n#include \"aegis\/user.hpp\"\r\n#include \"ban.hpp\"\r\n#include <nlohmann\/json.hpp>\r\n#include <vector>\r\n\r\nnamespace aegis\r\n{\r\n\r\n namespace gateway\r\n {\r\n\r\n namespace objects\r\n {\r\n\r\n struct bans;\r\n\r\n \/\/\/ \\cond TEMPLATES\r\n void from_json(const nlohmann::json& j, bans& m);\r\n void to_json(nlohmann::json& j, const bans& m);\r\n \/\/\/ \\endcond\r\n\r\n \/\/\/ Stores info pertaining to guild bans\r\n struct bans\r\n {\r\n bans(const std::string& _json, aegis::core* bot) noexcept\r\n {\r\n from_json(nlohmann::json::parse(_json), *this);\r\n }\r\n\r\n bans(const nlohmann::json& _json, aegis::core* bot) noexcept\r\n {\r\n from_json(_json, *this);\r\n }\r\n\r\n bans(aegis::core* bot) noexcept {}\r\n\r\n bans() noexcept {}\r\n\r\n std::vector<aegis::gateway::objects::ban>::iterator begin()\r\n {\r\n return _bans.begin();\r\n }\r\n\r\n std::vector<aegis::gateway::objects::ban>::iterator end()\r\n {\r\n return _bans.end();\r\n }\r\n\r\n std::vector<aegis::gateway::objects::ban>::reverse_iterator rbegin()\r\n {\r\n return _bans.rbegin();\r\n }\r\n\r\n std::vector<aegis::gateway::objects::ban>::reverse_iterator rend()\r\n {\r\n return _bans.rend();\r\n }\r\n\r\n std::vector<aegis::gateway::objects::ban> _bans; \/**< array of messages *\/\r\n\r\n };\r\n\r\n \/\/\/ \\cond TEMPLATES\r\n inline void from_json(const nlohmann::json& j, bans& m)\r\n {\r\n if (j.size())\r\n for (const auto& _ban : j)\r\n m._bans.push_back(_ban);\r\n }\r\n\r\n inline void to_json(nlohmann::json& j, const bans& m)\r\n {\r\n if (!m._bans.empty())\r\n for (const auto& _ban : m._bans)\r\n j.push_back(_ban);\r\n }\r\n \/\/\/ \\endcond\r\n\r\n }\r\n\r\n }\r\n\r\n}\r\n<commit_msg>Fix comment<commit_after>\/\/\r\n\/\/ ban.hpp\r\n\/\/ ********\r\n\/\/\r\n\/\/ Copyright (c) 2020 Sharon Fox (sharon at xandium dot io)\r\n\/\/\r\n\/\/ Distributed under the MIT License. (See accompanying file LICENSE)\r\n\/\/\r\n\r\n#pragma once\r\n\r\n#include \"aegis\/config.hpp\"\r\n#include \"aegis\/snowflake.hpp\"\r\n#include \"aegis\/permission.hpp\"\r\n#include \"aegis\/user.hpp\"\r\n#include \"ban.hpp\"\r\n#include <nlohmann\/json.hpp>\r\n#include <vector>\r\n\r\nnamespace aegis\r\n{\r\n\r\n namespace gateway\r\n {\r\n\r\n namespace objects\r\n {\r\n\r\n struct bans;\r\n\r\n \/\/\/ \\cond TEMPLATES\r\n void from_json(const nlohmann::json& j, bans& m);\r\n void to_json(nlohmann::json& j, const bans& m);\r\n \/\/\/ \\endcond\r\n\r\n \/\/\/ Stores info pertaining to guild bans\r\n struct bans\r\n {\r\n bans(const std::string& _json, aegis::core* bot) noexcept\r\n {\r\n from_json(nlohmann::json::parse(_json), *this);\r\n }\r\n\r\n bans(const nlohmann::json& _json, aegis::core* bot) noexcept\r\n {\r\n from_json(_json, *this);\r\n }\r\n\r\n bans(aegis::core* bot) noexcept {}\r\n\r\n bans() noexcept {}\r\n\r\n std::vector<aegis::gateway::objects::ban>::iterator begin()\r\n {\r\n return _bans.begin();\r\n }\r\n\r\n std::vector<aegis::gateway::objects::ban>::iterator end()\r\n {\r\n return _bans.end();\r\n }\r\n\r\n std::vector<aegis::gateway::objects::ban>::reverse_iterator rbegin()\r\n {\r\n return _bans.rbegin();\r\n }\r\n\r\n std::vector<aegis::gateway::objects::ban>::reverse_iterator rend()\r\n {\r\n return _bans.rend();\r\n }\r\n\r\n std::vector<aegis::gateway::objects::ban> _bans; \/**< array of bans *\/\r\n\r\n };\r\n\r\n \/\/\/ \\cond TEMPLATES\r\n inline void from_json(const nlohmann::json& j, bans& m)\r\n {\r\n if (j.size())\r\n for (const auto& _ban : j)\r\n m._bans.push_back(_ban);\r\n }\r\n\r\n inline void to_json(nlohmann::json& j, const bans& m)\r\n {\r\n if (!m._bans.empty())\r\n for (const auto& _ban : m._bans)\r\n j.push_back(_ban);\r\n }\r\n \/\/\/ \\endcond\r\n\r\n }\r\n\r\n }\r\n\r\n}\r\n<|endoftext|>"} {"text":"<commit_before>#ifndef LIBBITCOIN_UTILITY_SUBSCRIBER_H\n#define LIBBITCOIN_UTILITY_SUBSCRIBER_H\n\n#include <stack>\n\n#include <bitcoin\/types.hpp>\n#include <bitcoin\/utility\/assert.hpp>\n\nnamespace libbitcoin {\n\ntemplate <typename... Args>\nclass subscriber\n : public std::enable_shared_from_this<subscriber<Args...>>\n{\npublic:\n typedef std::function<void (Args...)> handler_type;\n typedef std::shared_ptr<subscriber<Args...>> ptr;\n\n subscriber(io_service::strand& async_strand)\n : strand_(async_strand)\n {\n }\n\n void subscribe(handler_type handle)\n {\n strand_.dispatch(\n std::bind(&subscriber<Args...>::do_subscribe,\n this->shared_from_this(), handle));\n }\n\n void relay(Args... params)\n {\n strand_.dispatch(\n std::bind(&subscriber<Args...>::do_relay,\n this->shared_from_this(), std::forward<Args>(params)...));\n }\n\nprivate:\n typedef std::stack<handler_type> registry_stack;\n\n void do_subscribe(handler_type handle)\n {\n registry_.push(handle);\n }\n\n void do_relay(Args... params)\n {\n registry_stack notify_copy = registry_;\n registry_ = registry_stack();\n while (!notify_copy.empty())\n {\n notify_copy.top()(std::forward<Args>(params)...);\n notify_copy.pop();\n }\n BITCOIN_ASSERT(notify_copy.empty());\n }\n\n io_service::strand& strand_;\n registry_stack registry_;\n};\n\n\/\/ C++11 - not in g++ yet!\n\/\/template <typename Handler>\n\/\/using subscriber_ptr = std::shared_ptr<subscribe<Handler>>;\n\n} \/\/ libbitcoin\n\n#endif\n\n<commit_msg>copy not forward arguments in subscriber.<commit_after>#ifndef LIBBITCOIN_UTILITY_SUBSCRIBER_H\n#define LIBBITCOIN_UTILITY_SUBSCRIBER_H\n\n#include <stack>\n\n#include <bitcoin\/types.hpp>\n#include <bitcoin\/utility\/assert.hpp>\n\nnamespace libbitcoin {\n\ntemplate <typename... Args>\nclass subscriber\n : public std::enable_shared_from_this<subscriber<Args...>>\n{\npublic:\n typedef std::function<void (Args...)> handler_type;\n typedef std::shared_ptr<subscriber<Args...>> ptr;\n\n subscriber(io_service::strand& async_strand)\n : strand_(async_strand)\n {\n }\n\n void subscribe(handler_type handle)\n {\n strand_.dispatch(\n std::bind(&subscriber<Args...>::do_subscribe,\n this->shared_from_this(), handle));\n }\n\n void relay(Args... params)\n {\n strand_.dispatch(\n std::bind(&subscriber<Args...>::do_relay,\n this->shared_from_this(), std::forward<Args>(params)...));\n }\n\nprivate:\n typedef std::stack<handler_type> registry_stack;\n\n void do_subscribe(handler_type handle)\n {\n registry_.push(handle);\n }\n\n void do_relay(Args... params)\n {\n registry_stack notify_copy = registry_;\n registry_ = registry_stack();\n while (!notify_copy.empty())\n {\n notify_copy.top()(params...);\n notify_copy.pop();\n }\n BITCOIN_ASSERT(notify_copy.empty());\n }\n\n io_service::strand& strand_;\n registry_stack registry_;\n};\n\n\/\/ C++11 - not in g++ yet!\n\/\/template <typename Handler>\n\/\/using subscriber_ptr = std::shared_ptr<subscribe<Handler>>;\n\n} \/\/ libbitcoin\n\n#endif\n\n<|endoftext|>"} {"text":"<commit_before>\/*\nCopyright (c) <2014>, <BenHJ>\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\nThe views and conclusions contained in the software and documentation are those\nof the authors and should not be interpreted as representing official policies,\neither expressed or implied, of the FreeBSD Project.\n*\/\n\n\/\/ an implementation of XTEA\n\n#ifndef BFS_CIPHER_XTEA_BYTE_TRANSFORMER_HPP__\n#define BFS_CIPHER_XTEA_BYTE_TRANSFORMER_HPP__\n\n#include \"cipher\/IByteTransformer.hpp\"\n\nnamespace bfs { namespace cipher\n{\n\n namespace detail\n {\n \/\/ the xtea encipher algorithm as found on wikipedia\n void encipher(unsigned int num_rounds, uint32_t v[2], uint32_t const key[4])\n {\n unsigned int i;\n uint32_t v0=v[0], v1=v[1], sum=0, delta=0x9E3779B9;\n for (i=0; i < num_rounds; i++) {\n v0 += ((v1 << 4 ^ v1 >> 5) + v1) ^ (sum + key[sum & 3]);\n sum += delta;\n v1 += ((v0 << 4 ^ v0 >> 5) + v0) ^ (sum + key[(sum>>11) & 3]);\n }\n v[0]=v0; v[1]=v1;\n }\n\n \/\/ the xtea encipher algorithm as found on wikipedia\n void decipher(unsigned int num_rounds, uint32_t v[2], uint32_t const key[4])\n {\n unsigned int i;\n uint32_t v0=v[0], v1=v[1], delta=0x9E3779B9, sum=delta*num_rounds;\n for (i=0; i < num_rounds; i++) {\n v1 -= ((v0 << 4 ^ v0 >> 5) + v0) ^ (sum + key[(sum>>11) & 3]);\n sum -= delta;\n v0 -= ((v1 << 4 ^ v1 >> 5) + v1) ^ (sum + key[sum & 3]);\n }\n v[0]=v0; v[1]=v1;\n }\n\n \/\/ helper code found here:\n \/\/ http:\/\/codereview.stackexchange.com\/questions\/2050\/codereview-tiny-encryption-algorithm-for-arbitrary-sized-data\n void convertBytesAndEncipher(unsigned int num_rounds, unsigned char * buffer, uint32_t const key[4])\n {\n uint32_t datablock[2];\n\n datablock[0] = (buffer[0] << 24) | (buffer[1] << 16) | (buffer[2] << 8) | (buffer[3]);\n datablock[1] = (buffer[4] << 24) | (buffer[5] << 16) | (buffer[6] << 8) | (buffer[7]);\n\n encipher(num_rounds, datablock, key);\n\n buffer[0] = static_cast<unsigned char>((datablock[0] >> 24) & 0xFF);\n buffer[1] = static_cast<unsigned char>((datablock[0] >> 16) & 0xFF);\n buffer[2] = static_cast<unsigned char>((datablock[0] >> 8) & 0xFF);\n buffer[3] = static_cast<unsigned char>((datablock[0]) & 0xFF);\n buffer[4] = static_cast<unsigned char>((datablock[1] >> 24) & 0xFF);\n buffer[5] = static_cast<unsigned char>((datablock[1] >> 16) & 0xFF);\n buffer[6] = static_cast<unsigned char>((datablock[1] >> 8) & 0xFF);\n buffer[7] = static_cast<unsigned char>((datablock[1]) & 0xFF);\n }\n }\n\n\n class XTEAByteTransformer : public IByteTransformer\n {\n public:\n explicit XTEAByteTransformer(std::string const &password)\n : IByteTransformer(password)\n {\n\n }\n\n ~XTEAByteTransformer()\n {\n\n }\n\n private:\n\n XTEAByteTransformer(); \/\/ not required\n\n void doTransform(char *in, char *out, std::ios_base::streamoff startPosition, long length,\n bool encrypt) const\n {\n\n }\n\n private:\n long m_key[256];\n };\n\n}\n}\n\n\n#endif \/\/ BFS_CIPHER_BASIC_TRANSFORMER_CIPHER_HPP__\n<commit_msg>Bare bones of xtea implementation finished<commit_after>\/*\nCopyright (c) <2014>, <BenHJ>\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\nThe views and conclusions contained in the software and documentation are those\nof the authors and should not be interpreted as representing official policies,\neither expressed or implied, of the FreeBSD Project.\n*\/\n\n\/\/ an implementation of XTEA\n\n#ifndef BFS_CIPHER_XTEA_BYTE_TRANSFORMER_HPP__\n#define BFS_CIPHER_XTEA_BYTE_TRANSFORMER_HPP__\n\n#include \"cipher\/IByteTransformer.hpp\"\n\nnamespace bfs { namespace cipher\n{\n\n namespace detail\n {\n \/\/ the xtea encipher algorithm as found on wikipedia\n void encipher(unsigned int num_rounds, uint32_t v[2], uint32_t const key[4])\n {\n unsigned int i;\n uint32_t v0=v[0], v1=v[1], sum=0, delta=0x9E3779B9;\n for (i=0; i < num_rounds; i++) {\n v0 += ((v1 << 4 ^ v1 >> 5) + v1) ^ (sum + key[sum & 3]);\n sum += delta;\n v1 += ((v0 << 4 ^ v0 >> 5) + v0) ^ (sum + key[(sum>>11) & 3]);\n }\n v[0]=v0; v[1]=v1;\n }\n\n \/\/ helper code found here:\n \/\/ http:\/\/codereview.stackexchange.com\/questions\/2050\/codereview-tiny-encryption-algorithm-for-arbitrary-sized-data\n void convertBytesAndEncipher(unsigned int num_rounds, unsigned char * buffer, uint32_t const key[4])\n {\n uint32_t datablock[2];\n\n datablock[0] = (buffer[0] << 24) | (buffer[1] << 16) | (buffer[2] << 8) | (buffer[3]);\n datablock[1] = (buffer[4] << 24) | (buffer[5] << 16) | (buffer[6] << 8) | (buffer[7]);\n\n encipher(num_rounds, datablock, key);\n\n buffer[0] = static_cast<unsigned char>((datablock[0] >> 24) & 0xFF);\n buffer[1] = static_cast<unsigned char>((datablock[0] >> 16) & 0xFF);\n buffer[2] = static_cast<unsigned char>((datablock[0] >> 8) & 0xFF);\n buffer[3] = static_cast<unsigned char>((datablock[0]) & 0xFF);\n buffer[4] = static_cast<unsigned char>((datablock[1] >> 24) & 0xFF);\n buffer[5] = static_cast<unsigned char>((datablock[1] >> 16) & 0xFF);\n buffer[6] = static_cast<unsigned char>((datablock[1] >> 8) & 0xFF);\n buffer[7] = static_cast<unsigned char>((datablock[1]) & 0xFF);\n }\n }\n\n\n class XTEAByteTransformer : public IByteTransformer\n {\n public:\n explicit XTEAByteTransformer(std::string const &password)\n : IByteTransformer(password)\n {\n\n }\n\n ~XTEAByteTransformer()\n {\n\n }\n\n private:\n\n XTEAByteTransformer(); \/\/ not required\n\n void doTransform(char *in, char *out, std::ios_base::streamoff startPosition, long length,\n bool encrypt) const\n {\n\n \/\/ how many blocks required? defaults to 1, if length greater\n \/\/ than 8 bytes then more blocks are needed\n long blocksRequired = 0;\n if(length > 8) {\n long remainder = length % 8;\n long roundedDown = length - remainder;\n blocksRequired += (roundedDown \/ 8);\n\n long c = 0;\n for(long i = 0;i < blocksRequired; ++i) {\n uint8_t cipherStream[8];\n for(int j = 0; j < 8; ++j) {\n cipherStream[j] = startPosition + c;\n ++c;\n }\n c -= 8;\n \/\/ todo: encipher here!\n \/\/ now xor plain with key stream\n for(int j = 0; j < 8; ++j) {\n out[c] = in[c] ^ cipherStream[j];\n ++c;\n }\n }\n\n if(remainder > 0) {\n\n uint8_t cipherStream[8];\n for(int j = 0; j < 8; ++j) {\n cipherStream[j] = startPosition + c;\n ++c;\n }\n\n c -= 8;\n\n \/\/ todo: encipher here!\n\n \/\/ xor rest of stream\n for(int j = 0; j < remainder; ++j) {\n out[c] = in[c] ^ cipherStream[j];\n ++c;\n }\n\n }\n } else {\n uint8_t cipherStream[8];\n for(int j = 0; j < 8; ++j) {\n cipherStream[j] = startPosition + j;\n }\n\n \/\/ todo: encipher here!\n\n \/\/ xor rest of stream\n for(int j = 0; j < length; ++j) {\n out[j] = in[j] ^ cipherStream[j];\n }\n }\n }\n\n private:\n long m_key[256];\n };\n\n}\n}\n\n\n#endif \/\/ BFS_CIPHER_BASIC_TRANSFORMER_CIPHER_HPP__\n<|endoftext|>"} {"text":"<commit_before>\/\/ Copyright (c) 2016, Joseph Mirabel\n\/\/ Authors: Joseph Mirabel (joseph.mirabel@laas.fr)\n\/\/\n\/\/ This file is part of hpp-corbaserver.\n\/\/ hpp-corbaserver 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-corbaserver 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-corbaserver. If not, see <http:\/\/www.gnu.org\/licenses\/>.\n\n#ifndef HPP_CORBASERVER_CONVERSIONS_HH\n#define HPP_CORBASERVER_CONVERSIONS_HH\n\n# include <hpp\/util\/exception-factory.hh>\n\n# include <hpp\/corbaserver\/fwd.hh>\n# include <hpp\/core\/parameter.hh>\n# include <hpp\/common-idl.hh>\n\nnamespace hpp {\n namespace corbaServer {\n typedef Eigen::Matrix<CORBA::Long, Eigen::Dynamic, Eigen::Dynamic> IntMatrix_t;\n\n void toTransform3f (const Transform_ in, Transform3f& out);\n\n Transform3f toTransform3f (const Transform_ in);\n\n std::vector<Transform3f> toTransform3f (const TransformSeq in);\n\n void toHppTransform (const Transform3f& in, Transform_ out);\n\n Transform__slice* toHppTransform (const Transform3f& in);\n\n floatSeq* vectorToFloatSeq (core::vectorIn_t input);\n\n void vectorToFloatSeq (core::vectorIn_t input, floatSeq& output);\n\n inline floatSeq* vectorToFloatSeq (core::ConfigurationPtr_t input)\n {\n if (!input) return NULL;\n return vectorToFloatSeq (*input);\n }\n\n \/\/\/ Returns a sequence of the rows of the input matrix.\n \/\/ Return [ [input.row(0)], [input.row(1)], ...]\n floatSeqSeq* matrixToFloatSeqSeq (core::matrixIn_t input);\n\n intSeqSeq* matrixToIntSeqSeq (Eigen::Ref<const IntMatrix_t > input);\n\n vector3_t floatSeqToVector3 (const floatSeq& dofArray);\n\n vector_t floatSeqToVector (const floatSeq& dofArray, const size_type expectedSize = -1);\n\n Configuration_t floatSeqToConfig (const DevicePtr_t& robot, const floatSeq& dofArray, bool throwIfNotNormalized);\n\n ConfigurationPtr_t floatSeqToConfigPtr (const DevicePtr_t& robot, const floatSeq& dofArray, bool throwIfNotNormalized);\n\n core::matrix_t floatSeqSeqToMatrix (const floatSeqSeq& input, const size_type expectedRows = -1, const size_type expectedCols = -1);\n\n IntMatrix_t intSeqSeqToMatrix (const intSeqSeq& input, const size_type expectedRows = -1, const size_type expectedCols = -1);\n\n std::vector<bool> boolSeqToVector (const hpp::boolSeq& mask,\n unsigned int length = 3);\n\n inline char* c_str (const std::string& in)\n {\n char* out = new char[in.length()+1];\n strcpy (out, in.c_str());\n return out;\n }\n\n template <typename InputIt> inline Names_t* toNames_t (InputIt begin, InputIt end)\n {\n std::size_t len = std::distance (begin, end);\n char** nameList = Names_t::allocbuf((CORBA::ULong) len);\n Names_t *ret = new Names_t ((CORBA::ULong) len, (CORBA::ULong) len, nameList);\n\n std::size_t i = 0;\n while (begin != end) {\n nameList[i] = c_str (*begin);\n ++begin;\n ++i;\n }\n return ret;\n }\n\n template <typename Iterable> inline Names_t* toNames_t (const Iterable& iterable)\n {\n return toNames_t(iterable.begin(), iterable.end());\n }\n\n template <typename InputIt> inline intSeq* toIntSeq (InputIt begin, InputIt end)\n {\n std::size_t len = std::distance (begin, end);\n intSeq* indexes = new intSeq ();\n indexes->length ((CORBA::ULong) len);\n\n std::size_t i = 0;\n while (begin != end) {\n (*indexes)[i] = *begin;\n ++begin;\n ++i;\n }\n return indexes;\n }\n\n template <typename InputIt> inline boolSeq* toBoolSeq (InputIt begin, InputIt end)\n {\n std::size_t len = std::distance (begin, end);\n boolSeq* indexes = new boolSeq ();\n indexes->length ((CORBA::ULong) len);\n\n std::size_t i = 0;\n while (begin != end) {\n (*indexes)[(CORBA::ULong)i] = *begin;\n ++begin;\n ++i;\n }\n return indexes;\n }\n\n template <typename OutputType> inline OutputType toStrings (const Names_t& names)\n {\n OutputType ret;\n for (CORBA::ULong i = 0; i < names.length(); ++i)\n ret.push_back (std::string(names[i]));\n return ret;\n }\n\n \/\/\/ Convert CORBA comparison types to C++ comparison type.\n constraints::ComparisonTypes_t convertComparison (ComparisonTypes_t comp);\n\n \/\/\/ Convert C++ comparison type to CORBA comparison types.\n ComparisonTypes_t* convertComparison (constraints::ComparisonTypes_t comp);\n\n core::Parameter toParameter (const CORBA::Any& any);\n\n CORBA::Any toCorbaAny (const core::Parameter& parameter);\n\n inline CORBA::Any* toCorbaAnyPtr (const core::Parameter& parameter)\n {\n CORBA::Any* ap = new CORBA::Any;\n *ap = toCorbaAny(parameter);\n return ap;\n }\n\n } \/\/ namespace corbaServer\n} \/\/ namespace hpp\n\n#endif \/\/ HPP_CORBASERVER_CONVERSIONS_HH\n<commit_msg>disambiguate ComparisonTypes_t<commit_after>\/\/ Copyright (c) 2016, Joseph Mirabel\n\/\/ Authors: Joseph Mirabel (joseph.mirabel@laas.fr)\n\/\/\n\/\/ This file is part of hpp-corbaserver.\n\/\/ hpp-corbaserver 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-corbaserver 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-corbaserver. If not, see <http:\/\/www.gnu.org\/licenses\/>.\n\n#ifndef HPP_CORBASERVER_CONVERSIONS_HH\n#define HPP_CORBASERVER_CONVERSIONS_HH\n\n# include <hpp\/util\/exception-factory.hh>\n\n# include <hpp\/corbaserver\/fwd.hh>\n# include <hpp\/core\/parameter.hh>\n# include <hpp\/common-idl.hh>\n\nnamespace hpp {\n namespace corbaServer {\n typedef Eigen::Matrix<CORBA::Long, Eigen::Dynamic, Eigen::Dynamic> IntMatrix_t;\n\n void toTransform3f (const Transform_ in, Transform3f& out);\n\n Transform3f toTransform3f (const Transform_ in);\n\n std::vector<Transform3f> toTransform3f (const TransformSeq in);\n\n void toHppTransform (const Transform3f& in, Transform_ out);\n\n Transform__slice* toHppTransform (const Transform3f& in);\n\n floatSeq* vectorToFloatSeq (core::vectorIn_t input);\n\n void vectorToFloatSeq (core::vectorIn_t input, floatSeq& output);\n\n inline floatSeq* vectorToFloatSeq (core::ConfigurationPtr_t input)\n {\n if (!input) return NULL;\n return vectorToFloatSeq (*input);\n }\n\n \/\/\/ Returns a sequence of the rows of the input matrix.\n \/\/ Return [ [input.row(0)], [input.row(1)], ...]\n floatSeqSeq* matrixToFloatSeqSeq (core::matrixIn_t input);\n\n intSeqSeq* matrixToIntSeqSeq (Eigen::Ref<const IntMatrix_t > input);\n\n vector3_t floatSeqToVector3 (const floatSeq& dofArray);\n\n vector_t floatSeqToVector (const floatSeq& dofArray, const size_type expectedSize = -1);\n\n Configuration_t floatSeqToConfig (const DevicePtr_t& robot, const floatSeq& dofArray, bool throwIfNotNormalized);\n\n ConfigurationPtr_t floatSeqToConfigPtr (const DevicePtr_t& robot, const floatSeq& dofArray, bool throwIfNotNormalized);\n\n core::matrix_t floatSeqSeqToMatrix (const floatSeqSeq& input, const size_type expectedRows = -1, const size_type expectedCols = -1);\n\n IntMatrix_t intSeqSeqToMatrix (const intSeqSeq& input, const size_type expectedRows = -1, const size_type expectedCols = -1);\n\n std::vector<bool> boolSeqToVector (const hpp::boolSeq& mask,\n unsigned int length = 3);\n\n inline char* c_str (const std::string& in)\n {\n char* out = new char[in.length()+1];\n strcpy (out, in.c_str());\n return out;\n }\n\n template <typename InputIt> inline Names_t* toNames_t (InputIt begin, InputIt end)\n {\n std::size_t len = std::distance (begin, end);\n char** nameList = Names_t::allocbuf((CORBA::ULong) len);\n Names_t *ret = new Names_t ((CORBA::ULong) len, (CORBA::ULong) len, nameList);\n\n std::size_t i = 0;\n while (begin != end) {\n nameList[i] = c_str (*begin);\n ++begin;\n ++i;\n }\n return ret;\n }\n\n template <typename Iterable> inline Names_t* toNames_t (const Iterable& iterable)\n {\n return toNames_t(iterable.begin(), iterable.end());\n }\n\n template <typename InputIt> inline intSeq* toIntSeq (InputIt begin, InputIt end)\n {\n std::size_t len = std::distance (begin, end);\n intSeq* indexes = new intSeq ();\n indexes->length ((CORBA::ULong) len);\n\n std::size_t i = 0;\n while (begin != end) {\n (*indexes)[i] = *begin;\n ++begin;\n ++i;\n }\n return indexes;\n }\n\n template <typename InputIt> inline boolSeq* toBoolSeq (InputIt begin, InputIt end)\n {\n std::size_t len = std::distance (begin, end);\n boolSeq* indexes = new boolSeq ();\n indexes->length ((CORBA::ULong) len);\n\n std::size_t i = 0;\n while (begin != end) {\n (*indexes)[(CORBA::ULong)i] = *begin;\n ++begin;\n ++i;\n }\n return indexes;\n }\n\n template <typename OutputType> inline OutputType toStrings (const Names_t& names)\n {\n OutputType ret;\n for (CORBA::ULong i = 0; i < names.length(); ++i)\n ret.push_back (std::string(names[i]));\n return ret;\n }\n\n \/\/\/ Convert CORBA comparison types to C++ comparison type.\n constraints::ComparisonTypes_t convertComparison (hpp::ComparisonTypes_t comp);\n\n \/\/\/ Convert C++ comparison type to CORBA comparison types.\n hpp::ComparisonTypes_t* convertComparison (constraints::ComparisonTypes_t comp);\n\n core::Parameter toParameter (const CORBA::Any& any);\n\n CORBA::Any toCorbaAny (const core::Parameter& parameter);\n\n inline CORBA::Any* toCorbaAnyPtr (const core::Parameter& parameter)\n {\n CORBA::Any* ap = new CORBA::Any;\n *ap = toCorbaAny(parameter);\n return ap;\n }\n\n } \/\/ namespace corbaServer\n} \/\/ namespace hpp\n\n#endif \/\/ HPP_CORBASERVER_CONVERSIONS_HH\n<|endoftext|>"} {"text":"<commit_before>\/******************************************************************************\n* Copyright (c) 2012, Howard Butler, hobu.inc@gmail.com\n*\n* All rights reserved.\n*\n* Redistribution and use in source and binary forms, with or without\n* modification, are permitted provided that the following\n* conditions are met:\n*\n* * Redistributions of source code must retain the above copyright\n* notice, this list of conditions and the following disclaimer.\n* * Redistributions in binary form must reproduce the above copyright\n* notice, this list of conditions and the following disclaimer in\n* the documentation and\/or other materials provided\n* with the distribution.\n* * Neither the name of Hobu, Inc. or Flaxen Geo Consulting nor the\n* names of its contributors may be used to endorse or promote\n* products derived from this software without specific prior\n* written permission.\n*\n* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS\n* \"AS IS\" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT\n* LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS\n* FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE\n* COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT,\n* INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING,\n* BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS\n* OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED\n* AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,\n* OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT\n* OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY\n* OF SUCH DAMAGE.\n****************************************************************************\/\n\n#ifndef INCLUDED_DRIVER_SOCI_COMMON_HPP\n#define INCLUDED_DRIVER_SOCI_COMMON_HPP\n\n#ifdef PDAL_HAVE_SOCI\n#include <boost-optional.h>\n#include <boost-tuple.h>\n#include <boost-fusion.h>\n#include <boost-gregorian-date.h>\n#include <soci\/soci.h>\n#include <soci\/sqlite3\/soci-sqlite3.h>\n#include <soci\/error.h>\n#include <soci\/use.h>\n#endif\n\n#include <pdal\/pdal_error.hpp>\n#include <pdal\/Options.hpp>\n\nnamespace pdal\n{\nnamespace drivers\n{\nnamespace sqlite\n{\n\n class sqlite_driver_error : public pdal_error\n {\n public:\n sqlite_driver_error(std::string const& msg)\n : pdal_error(msg)\n {}\n };\n\n class connection_failed : public sqlite_driver_error\n {\n public:\n connection_failed(std::string const& msg)\n : sqlite_driver_error(msg)\n {}\n };\n\n class buffer_too_small : public sqlite_driver_error\n {\n public:\n buffer_too_small(std::string const& msg)\n : sqlite_driver_error(msg)\n {}\n };\n\n\n\n enum QueryType\n {\n QUERY_CLOUD = 0,\n QUERY_BLOCKS_PLUS_CLOUD_VIEW,\n QUERY_UNKNOWN = 512\n };\n\n\n\n\n\n}\n}\n} \/\/ namespace pdal::driver::soci\n\n\n#endif\n<commit_msg>remove unnecessary includes<commit_after>\/******************************************************************************\n* Copyright (c) 2012, Howard Butler, hobu.inc@gmail.com\n*\n* All rights reserved.\n*\n* Redistribution and use in source and binary forms, with or without\n* modification, are permitted provided that the following\n* conditions are met:\n*\n* * Redistributions of source code must retain the above copyright\n* notice, this list of conditions and the following disclaimer.\n* * Redistributions in binary form must reproduce the above copyright\n* notice, this list of conditions and the following disclaimer in\n* the documentation and\/or other materials provided\n* with the distribution.\n* * Neither the name of Hobu, Inc. or Flaxen Geo Consulting nor the\n* names of its contributors may be used to endorse or promote\n* products derived from this software without specific prior\n* written permission.\n*\n* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS\n* \"AS IS\" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT\n* LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS\n* FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE\n* COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT,\n* INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING,\n* BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS\n* OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED\n* AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,\n* OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT\n* OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY\n* OF SUCH DAMAGE.\n****************************************************************************\/\n\n#ifndef INCLUDED_DRIVER_SOCI_COMMON_HPP\n#define INCLUDED_DRIVER_SOCI_COMMON_HPP\n\n#ifdef PDAL_HAVE_SOCI\n#include <soci\/soci.h>\n#include <soci\/sqlite3\/soci-sqlite3.h>\n#include <soci\/error.h>\n#include <soci\/use.h>\n#endif\n\n#include <pdal\/pdal_error.hpp>\n#include <pdal\/Options.hpp>\n\nnamespace pdal\n{\nnamespace drivers\n{\nnamespace sqlite\n{\n\n class sqlite_driver_error : public pdal_error\n {\n public:\n sqlite_driver_error(std::string const& msg)\n : pdal_error(msg)\n {}\n };\n\n class connection_failed : public sqlite_driver_error\n {\n public:\n connection_failed(std::string const& msg)\n : sqlite_driver_error(msg)\n {}\n };\n\n class buffer_too_small : public sqlite_driver_error\n {\n public:\n buffer_too_small(std::string const& msg)\n : sqlite_driver_error(msg)\n {}\n };\n\n\n\n enum QueryType\n {\n QUERY_CLOUD = 0,\n QUERY_BLOCKS_PLUS_CLOUD_VIEW,\n QUERY_UNKNOWN = 512\n };\n\n\n\n\n\n}\n}\n} \/\/ namespace pdal::driver::soci\n\n\n#endif\n<|endoftext|>"} {"text":"<commit_before>\/**************************************************************************\n * Copyright(c) 1998-1999, ALICE Experiment at CERN, All rights reserved. *\n * *\n * Author: The ALICE Off-line Project. *\n * Contributors are mentioned in the code where appropriate. *\n * *\n * Permission to use, copy, modify and distribute this software and its *\n * documentation strictly for non-commercial purposes is hereby granted *\n * without fee, provided that the above copyright notice appears in all *\n * copies and that both the copyright notice and this permission notice *\n * appear in the supporting documentation. The authors make no claims *\n * about the suitability of this software for any purpose. It is *\n * provided \"as is\" without express or implied warranty. *\n **************************************************************************\/\n\n\/\/\n\/\/ xx\n\/\/ xx\n\/\/ xx\n\/\/ xx\n\/\/ xx\n\/\/\n\/\/ Xianguo Lu \n\/\/ lu@physi.uni-heidelberg.de\n\/\/ Xianguo.Lu@cern.ch\n\/\/ \n\/\/\n#include \"THnBase.h\"\n#include \"THnSparse.h\"\n#include \"TCollection.h\"\n\n#include \"AliTRDdEdxBaseUtils.h\"\n#include \"AliTRDdEdxCalibHistArray.h\"\n\nClassImp(AliTRDdEdxCalibHistArray);\n\nAliTRDdEdxCalibHistArray::AliTRDdEdxCalibHistArray(const Bool_t kNoInv): \n TObjArray(kNoInv ? 4: 8)\n{\n \/\/\n \/\/constructor\n \/\/\n SetName(GetArrayName());\n SetOwner(kTRUE);\n\n const Int_t nbin[2]={AliTRDdEdxBaseUtils::NTRDtimebin(), 11250};\n const Double_t xmin[2]={0, 0};\n const Double_t xmax[2]={nbin[0], 20};\n\n for(Int_t iter=0; iter<GetSize(); iter++){\n THnBase *hi = new THnSparseS(GetNameAt(iter), \"\", 2, nbin, xmin, xmax);\n AddAt(hi, iter);\n }\n}\n\nAliTRDdEdxCalibHistArray::AliTRDdEdxCalibHistArray(const AliTRDdEdxCalibHistArray &obj): \n TObjArray(obj)\n{\n \/\/\n \/\/copy constructor\n \/\/\n}\n\nAliTRDdEdxCalibHistArray & AliTRDdEdxCalibHistArray::operator=(const AliTRDdEdxCalibHistArray &obj)\n{\n \/\/\n \/\/assignment operator\n \/\/\n\n if(&obj == this) return *this;\n\n TObjArray::operator=(obj);\n\n return *this;\n}\n\nLong64_t AliTRDdEdxCalibHistArray::Merge(const TCollection* list) \n{\n \/\/\n \/\/ Merge list of objects (needed by PROOF)\n \/\/\n\n if(!list)\n return 0;\n \n if(list->IsEmpty())\n return 1;\n \n TIterator* iter = list->MakeIterator();\n TObject* obj = 0;\n \n Int_t count=0;\n while((obj = iter->Next()) != 0) \n {\n AliTRDdEdxCalibHistArray * entry = dynamic_cast<AliTRDdEdxCalibHistArray*>(obj);\n if (entry == 0) continue; \n \n if(GetSize()!= entry->GetSize()){\n printf(\"AliTRDdEdxCalibHistArray::Merge GetSize()!= entry->GetSize() %d %d\\n\", GetSize(), entry->GetSize()); exit(1);\n }\n\n for(Int_t ii=0; ii<GetSize(); ii++){\n THnBase *h0 = (THnBase*) At(ii);\n THnBase *h1 = (THnBase*) entry->At(ii);\n h0->Add(h1);\n }\n \n count++;\n }\n \n return count;\n\n}\n<commit_msg>Change THnSparseS to THnSparseF (Xianguo)<commit_after>\/**************************************************************************\n * Copyright(c) 1998-1999, ALICE Experiment at CERN, All rights reserved. *\n * *\n * Author: The ALICE Off-line Project. *\n * Contributors are mentioned in the code where appropriate. *\n * *\n * Permission to use, copy, modify and distribute this software and its *\n * documentation strictly for non-commercial purposes is hereby granted *\n * without fee, provided that the above copyright notice appears in all *\n * copies and that both the copyright notice and this permission notice *\n * appear in the supporting documentation. The authors make no claims *\n * about the suitability of this software for any purpose. It is *\n * provided \"as is\" without express or implied warranty. *\n **************************************************************************\/\n\n\/\/\n\/\/ xx\n\/\/ xx\n\/\/ xx\n\/\/ xx\n\/\/ xx\n\/\/\n\/\/ Xianguo Lu \n\/\/ lu@physi.uni-heidelberg.de\n\/\/ Xianguo.Lu@cern.ch\n\/\/ \n\/\/\n#include \"THnBase.h\"\n#include \"THnSparse.h\"\n#include \"TCollection.h\"\n\n#include \"AliTRDdEdxBaseUtils.h\"\n#include \"AliTRDdEdxCalibHistArray.h\"\n\nClassImp(AliTRDdEdxCalibHistArray);\n\nAliTRDdEdxCalibHistArray::AliTRDdEdxCalibHistArray(const Bool_t kNoInv): \n TObjArray(kNoInv ? 4: 8)\n{\n \/\/\n \/\/constructor\n \/\/\n SetName(GetArrayName());\n SetOwner(kTRUE);\n\n const Int_t nbin[2]={AliTRDdEdxBaseUtils::NTRDtimebin(), 11250};\n const Double_t xmin[2]={0, 0};\n const Double_t xmax[2]={nbin[0], 20};\n\n for(Int_t iter=0; iter<GetSize(); iter++){\n THnBase *hi = new THnSparseF(GetNameAt(iter), \"\", 2, nbin, xmin, xmax);\n AddAt(hi, iter);\n }\n}\n\nAliTRDdEdxCalibHistArray::AliTRDdEdxCalibHistArray(const AliTRDdEdxCalibHistArray &obj): \n TObjArray(obj)\n{\n \/\/\n \/\/copy constructor\n \/\/\n}\n\nAliTRDdEdxCalibHistArray & AliTRDdEdxCalibHistArray::operator=(const AliTRDdEdxCalibHistArray &obj)\n{\n \/\/\n \/\/assignment operator\n \/\/\n\n if(&obj == this) return *this;\n\n TObjArray::operator=(obj);\n\n return *this;\n}\n\nLong64_t AliTRDdEdxCalibHistArray::Merge(const TCollection* list) \n{\n \/\/\n \/\/ Merge list of objects (needed by PROOF)\n \/\/\n\n if(!list)\n return 0;\n \n if(list->IsEmpty())\n return 1;\n \n TIterator* iter = list->MakeIterator();\n TObject* obj = 0;\n \n Int_t count=0;\n while((obj = iter->Next()) != 0) \n {\n AliTRDdEdxCalibHistArray * entry = dynamic_cast<AliTRDdEdxCalibHistArray*>(obj);\n if (entry == 0) continue; \n \n if(GetSize()!= entry->GetSize()){\n printf(\"AliTRDdEdxCalibHistArray::Merge GetSize()!= entry->GetSize() %d %d\\n\", GetSize(), entry->GetSize()); exit(1);\n }\n\n for(Int_t ii=0; ii<GetSize(); ii++){\n THnBase *h0 = (THnBase*) At(ii);\n THnBase *h1 = (THnBase*) entry->At(ii);\n h0->Add(h1);\n }\n \n count++;\n }\n \n return count;\n\n}\n<|endoftext|>"} {"text":"<commit_before>\/*************************************************************************\n *\n * OpenOffice.org - a multi-platform office productivity suite\n *\n * $RCSfile: options.hxx,v $\n *\n * $Revision: 1.8 $\n *\n * last change: $Author: hr $ $Date: 2006-06-20 02:22:39 $\n *\n * The Contents of this file are made available subject to\n * the terms of GNU Lesser General Public License Version 2.1.\n *\n *\n * GNU Lesser General Public License Version 2.1\n * =============================================\n * Copyright 2005 by Sun Microsystems, Inc.\n * 901 San Antonio Road, Palo Alto, CA 94303, USA\n *\n * This library is free software; you can redistribute it and\/or\n * modify it under the terms of the GNU Lesser General Public\n * License version 2.1, as published by the Free Software Foundation.\n *\n * This library is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU\n * Lesser General Public License for more details.\n *\n * You should have received a copy of the GNU Lesser General Public\n * License along with this library; if not, write to the Free Software\n * Foundation, Inc., 59 Temple Place, Suite 330, Boston,\n * MA 02111-1307 USA\n *\n ************************************************************************\/\n\n#ifndef INCLUDED_CODEMAKER_OPTIONS_HXX\n#define INCLUDED_CODEMAKER_OPTIONS_HXX\n\n#include <hash_map>\n\n#ifndef INCLUDED_CODEMAKER_GLOBAL_HXX\n#include <codemaker\/global.hxx>\n#endif\n\n#if defined( _MSC_VER ) && ( _MSC_VER < 1200 )\ntypedef ::std::__hash_map__\n<\n ::rtl::OString,\n ::rtl::OString,\n HashString,\n EqualString,\n NewAlloc\n> OptionMap;\n#else\ntypedef ::std::hash_map\n<\n ::rtl::OString,\n ::rtl::OString,\n HashString,\n EqualString\n> OptionMap;\n#endif\n\nclass IllegalArgument\n{\npublic:\n IllegalArgument(const ::rtl::OString& msg)\n : m_message(msg) {}\n\n ::rtl::OString m_message;\n};\n\nclass Options\n{\npublic:\n Options();\n virtual ~Options();\n\n virtual sal_Bool initOptions(int ac, char* av[], sal_Bool bCmdFile=sal_False)\n throw( IllegalArgument ) = 0;\n\n virtual ::rtl::OString prepareHelp() = 0;\n\n const ::rtl::OString& getProgramName() const;\n sal_Bool isValid(const ::rtl::OString& option);\n const ::rtl::OString getOption(const ::rtl::OString& option)\n throw( IllegalArgument );\n const OptionMap& getOptions();\n\n const ::rtl::OString getInputFile(sal_uInt16 index)\n throw( IllegalArgument );\n\n const StringVector& getInputFiles();\n\n ::rtl::OString getExtraInputFile(sal_uInt16 index) const throw( IllegalArgument );\n inline sal_uInt16 getNumberOfExtraInputFiles() const\n { return (sal_uInt16)m_extra_input_files.size(); }\n inline const StringVector& getExtraInputFiles() const\n { return m_extra_input_files; }\nprotected:\n ::rtl::OString m_program;\n StringVector m_inputFiles;\n StringVector m_extra_input_files;\n OptionMap m_options;\n};\n\n#endif \/\/ INCLUDED_CODEMAKER_OPTIONS_HXX\n\n<commit_msg>INTEGRATION: CWS changefileheader (1.8.48); FILE MERGED 2008\/04\/01 12:26:07 thb 1.8.48.2: #i85898# Stripping all external header guards 2008\/03\/31 07:22:51 rt 1.8.48.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: options.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 INCLUDED_CODEMAKER_OPTIONS_HXX\n#define INCLUDED_CODEMAKER_OPTIONS_HXX\n\n#include <hash_map>\n#include <codemaker\/global.hxx>\n\n#if defined( _MSC_VER ) && ( _MSC_VER < 1200 )\ntypedef ::std::__hash_map__\n<\n ::rtl::OString,\n ::rtl::OString,\n HashString,\n EqualString,\n NewAlloc\n> OptionMap;\n#else\ntypedef ::std::hash_map\n<\n ::rtl::OString,\n ::rtl::OString,\n HashString,\n EqualString\n> OptionMap;\n#endif\n\nclass IllegalArgument\n{\npublic:\n IllegalArgument(const ::rtl::OString& msg)\n : m_message(msg) {}\n\n ::rtl::OString m_message;\n};\n\nclass Options\n{\npublic:\n Options();\n virtual ~Options();\n\n virtual sal_Bool initOptions(int ac, char* av[], sal_Bool bCmdFile=sal_False)\n throw( IllegalArgument ) = 0;\n\n virtual ::rtl::OString prepareHelp() = 0;\n\n const ::rtl::OString& getProgramName() const;\n sal_Bool isValid(const ::rtl::OString& option);\n const ::rtl::OString getOption(const ::rtl::OString& option)\n throw( IllegalArgument );\n const OptionMap& getOptions();\n\n const ::rtl::OString getInputFile(sal_uInt16 index)\n throw( IllegalArgument );\n\n const StringVector& getInputFiles();\n\n ::rtl::OString getExtraInputFile(sal_uInt16 index) const throw( IllegalArgument );\n inline sal_uInt16 getNumberOfExtraInputFiles() const\n { return (sal_uInt16)m_extra_input_files.size(); }\n inline const StringVector& getExtraInputFiles() const\n { return m_extra_input_files; }\nprotected:\n ::rtl::OString m_program;\n StringVector m_inputFiles;\n StringVector m_extra_input_files;\n OptionMap m_options;\n};\n\n#endif \/\/ INCLUDED_CODEMAKER_OPTIONS_HXX\n\n<|endoftext|>"} {"text":"<commit_before>\/\/\n\/\/ Name:\t canvas.cpp\n\/\/ Purpose: Implements the canvas class for the Enviro wxWidgets application.\n\/\/\n\/\/ Copyright (c) 2001-2006 Virtual Terrain Project\n\/\/ Free for all uses, see license.txt for details.\n\/\/\n\n\/\/ For compilers that support precompilation, includes \"wx.h\".\n#include \"wx\/wxprec.h\"\n\n#ifndef WX_PRECOMP\n#include \"wx\/wx.h\"\n#endif\n\n#include \"vtlib\/vtlib.h\"\n#include \"vtlib\/core\/Event.h\"\n#include \"vtdata\/vtLog.h\"\n#include \"EnviroGUI.h\"\t\t\t\/\/ for g_App, GetTerrainScene\n#include \"canvas.h\"\n#include \"EnviroFrame.h\"\t\t\/\/ for UpdateStatus and OnChar\n#include \"EnviroApp.h\"\n\nDECLARE_APP(EnviroApp)\n\n\/*\n * vtGLCanvas implementation\n *\/\nBEGIN_EVENT_TABLE(vtGLCanvas, wxGLCanvas)\nEVT_CLOSE(vtGLCanvas::OnClose)\nEVT_SIZE(vtGLCanvas::OnSize)\nEVT_PAINT(vtGLCanvas::OnPaint)\nEVT_CHAR(vtGLCanvas::OnChar)\nEVT_KEY_DOWN(vtGLCanvas::OnKeyDown)\nEVT_KEY_UP(vtGLCanvas::OnKeyUp)\nEVT_MOUSE_EVENTS(vtGLCanvas::OnMouseEvent)\nEVT_ERASE_BACKGROUND(vtGLCanvas::OnEraseBackground)\nEVT_IDLE(vtGLCanvas::OnIdle)\nEND_EVENT_TABLE()\n\nstatic vtGLCanvas *s_canvas = NULL;\n\nvtGLCanvas::vtGLCanvas(wxWindow *parent, wxWindowID id, const wxPoint &pos,\n\tconst wxSize &size, long style, const wxString &name, int *gl_attrib):\n\t\twxGLCanvas(parent, id, gl_attrib, pos, size, style, name)\n{\n\tVTLOG1(\"vtGLCanvas constructor\\n\");\n\n\tVTLOG1(\"vtGLCanvas: calling Show on parent\\n\");\n\tparent->Show();\n\n\tm_glContext = new wxGLContext(this);\n\n#if __WXMSW__\n\tHGLRC hContext = m_glContext->GetGLRC();\n\tif (NULL == hContext)\n\t{\n\t\twxMessageBox(_(\"No OpenGL support found\") , _(\"Error\"), wxICON_ERROR | wxOK);\n\t\texit(-1);\n\t}\n\telse\n\t\tVTLOG(\"OpenGL context: %lx\\n\", hContext);\n#endif\n\n\t\/\/ Documentation says about SetCurrent:\n\t\/\/ \"Note that this function may only be called after the window has been shown.\"\n\tVTLOG1(\"vtGLCanvas: calling SetCurrent\\n\");\n\tSetCurrent();\n\n\tVTLOG1(\"OpenGL version: \");\n\tVTLOG1((const char *) glGetString(GL_VERSION));\n\tVTLOG1(\"\\n\");\n\tVTLOG1(\"OpenGL vendor: \");\n\tVTLOG1((const char *) glGetString(GL_VENDOR));\n\tVTLOG1(\"\\n\");\n\tVTLOG1(\"OpenGL renderer: \");\n\tVTLOG1((const char *) glGetString(GL_RENDERER));\n\tVTLOG1(\"\\n\");\n\n\tm_bPainting = false;\n\tm_bRunning = true;\n\tm_bShowFrameRateChart = false;\n\n\tfor (int i = 0; i < 512; i++)\n\t\tm_pbKeyState[i] = false;\n\tvtGetScene()->SetKeyStates(m_pbKeyState);\n\tm_iConsecutiveMousemoves = 0;\n\n\t\/\/ On RTL (right-to-left) system, the canvas should still be always LTR\n\tSetLayoutDirection(wxLayout_LeftToRight);\n\n\ts_canvas = this;\n\tVTLOG1(\"vtGLCanvas, leaving constructor\\n\");\n}\n\nvtGLCanvas::~vtGLCanvas(void)\n{\n\tVTLOG1(\"Deleting Canvas\\n\");\n}\n\n\nvoid EnableContinuousRendering(bool bTrue)\n{\n\tVTLOG(\"EnableContinuousRendering %d\\n\", bTrue);\n\tif (!s_canvas)\n\t\treturn;\n\n\tbool bNeedRefresh = (s_canvas->m_bRunning == false && bTrue == true);\n\ts_canvas->m_bRunning = bTrue;\n\tif (bNeedRefresh)\n\t\ts_canvas->Refresh(FALSE);\n\n\tvtGetScene()->TimerRunning(bTrue);\n}\n\nvoid vtGLCanvas::OnPaint( wxPaintEvent& event )\n{\n\tstatic bool bFirstPaint = true;\n\tif (bFirstPaint) VTLOG1(\"vtGLCanvas: first OnPaint\\n\");\n\n\t\/\/ place the dc inside a scope, to delete it before the end of function\n\tif (1)\n\t{\n\t\t\/\/ This is a dummy, to avoid an endless succession of paint messages.\n\t\t\/\/ OnPaint handlers must always create a wxPaintDC.\n\t\tif (bFirstPaint) VTLOG1(\"vtGLCanvas: creating a wxPaintDC on the stack\\n\");\n\t\twxPaintDC dc(this);\n\n\t\t\/\/ Safety checks\n\t\tif (!s_canvas)\n\t\t{\n\t\t\tVTLOG1(\"OnPaint: Canvas not yet constructed, returning\\n\");\n\t\t\treturn;\n\t\t}\n\n\t\t\/\/ Avoid reentrance\n\t\tif (m_bPainting) return;\n\n\t\tm_bPainting = true;\n\n\t\t\/\/ Make sure the Graphics context of this thread is this window\n\t\tSetCurrent();\n\n\t\t\/\/ Render the Scene Graph\n\t\tif (bFirstPaint) VTLOG1(\"vtGLCanvas: DoUpdate\\n\");\n\t\tvtGetScene()->DoUpdate();\n\n\t\tif (m_bShowFrameRateChart)\n\t\t\tvtGetScene()->DrawFrameRateChart();\n\n\t\tif (bFirstPaint) VTLOG1(\"vtGLCanvas: SwapBuffers\\n\");\n\t\tSwapBuffers();\n\n\t\tif (bFirstPaint) VTLOG1(\"vtGLCanvas: update status bar\\n\");\n\t\tEnviroFrame *frame = (EnviroFrame*) GetParent();\n\n\t\t\/\/ update the status bar every 1\/10 of a second\n\t\tstatic float last_stat = 0.0f;\n\t\tstatic vtString last_msg;\n\t\tfloat cur = vtGetTime();\n\t\tif (cur - last_stat > 0.1f || g_App.GetMessage() != last_msg)\n\t\t{\n\t\t\tlast_msg = g_App.GetMessage();\n\t\t\tlast_stat = cur;\n\t\t\tframe->UpdateStatus();\n\t\t}\n\n\t\tframe->UpdateLODInfo();\n\n\t\tm_bPainting = false;\n\t}\n\n\t\/\/ Reset the number of mousemoves we've gotten since last redraw\n\tm_iConsecutiveMousemoves = 0;\n\n\tif (bFirstPaint)\n\t\tbFirstPaint = false;\n}\n\nvoid vtGLCanvas::OnClose(wxCloseEvent& event)\n{\n\tm_bRunning = false;\n}\n\nvoid vtGLCanvas::OnSize(wxSizeEvent& event)\n{\n\tstatic int count = 0;\n\tif (count < 3)\n\t{\n\t\tVTLOG(\"Canvas OnSize: %d %d\\n\", event.GetSize().x, event.GetSize().y);\n\t\tcount++;\n\t}\n\tSetCurrent();\n\tint width, height;\n\tGetClientSize(& width, & height);\n\n\tvtGetScene()->SetWindowSize(width, height);\n\n\twxGLCanvas::OnSize(event);\n}\n\nvoid vtGLCanvas::OnChar(wxKeyEvent& event)\n{\n\tlong key = event.GetKeyCode();\n\n\t\/\/ pass the char to the frame for it to do \"accelerator\" shortcuts\n\tEnviroFrame *frame = (EnviroFrame*) GetParent();\n\tframe->OnChar(event);\n\n\tint flags = 0;\n\n\tif (event.ControlDown())\n\t\tflags |= VT_CONTROL;\n\n\tif (event.ShiftDown())\n\t\tflags |= VT_SHIFT;\n\n\tif (event.AltDown())\n\t\tflags |= VT_ALT;\n\n\t\/\/ pass the char to the vtlib Scene\n\tvtGetScene()->OnKey(key, flags);\n\n\t\/\/ Allow wxWindows to pass the event along to other code\n\tevent.Skip();\n}\n\nvoid vtGLCanvas::OnKeyDown(wxKeyEvent& event)\n{\n\tm_pbKeyState[event.m_keyCode] = true;\n\tevent.Skip();\n}\n\nvoid vtGLCanvas::OnKeyUp(wxKeyEvent& event)\n{\n\tm_pbKeyState[event.m_keyCode] = false;\n\tevent.Skip();\n}\n\nvoid vtGLCanvas::OnMouseEvent(wxMouseEvent& event1)\n{\n\tstatic bool bCapture = false;\n\n\t\/\/ turn WX mouse event into a VT mouse event\n\tvtMouseEvent event;\n\twxEventType ev = event1.GetEventType();\n\tif (ev == wxEVT_LEFT_DOWN) {\n\t\tevent.type = VT_DOWN;\n\t\tevent.button = VT_LEFT;\n\t} else if (ev == wxEVT_LEFT_UP) {\n\t\tevent.type = VT_UP;\n\t\tevent.button = VT_LEFT;\n\t} else if (ev == wxEVT_MIDDLE_DOWN) {\n\t\tevent.type = VT_DOWN;\n\t\tevent.button = VT_MIDDLE;\n\t} else if (ev == wxEVT_MIDDLE_UP) {\n\t\tevent.type = VT_UP;\n\t\tevent.button = VT_MIDDLE;\n\t} else if (ev == wxEVT_RIGHT_DOWN) {\n\t\tevent.type = VT_DOWN;\n\t\tevent.button = VT_RIGHT;\n\t} else if (ev == wxEVT_RIGHT_UP) {\n\t\tevent.type = VT_UP;\n\t\tevent.button = VT_RIGHT;\n\t} else if (ev == wxEVT_MOTION) {\n\t\tevent.type = VT_MOVE;\n\t\tevent.button = VT_NONE;\n\t\tm_iConsecutiveMousemoves++;\t\t\/\/ Increment\n\t} else if (ev == wxEVT_MOUSEWHEEL) {\n\t\tevent.type = VT_WHEEL;\n\t\tevent.button = event1.GetWheelRotation() \/ event1.GetWheelDelta();\n\t} else {\n\t\t\/\/ ignored mouse events, such as wxEVT_LEAVE_WINDOW\n\t\treturn;\n\t}\n\n\tif (ev == wxEVT_LEFT_DOWN || ev == wxEVT_MIDDLE_DOWN || ev == wxEVT_RIGHT_DOWN)\n\t{\n\/\/\t\tVTLOG(\"DOWN: capture %d\", bCapture);\n\t\tif (!bCapture)\n\t\t{\n\t\t\tCaptureMouse();\n\t\t\tbCapture = true;\n\/\/\t\t\tVTLOG(\" -> true\");\n\t\t}\n\/\/\t\tVTLOG(\"\\n\");\n\t}\n\tif (ev == wxEVT_LEFT_UP || ev == wxEVT_MIDDLE_UP || ev == wxEVT_RIGHT_UP)\n\t{\n\/\/\t\tVTLOG(\" UP: capture %d\", bCapture);\n\t\tif (bCapture)\n\t\t{\n\t\t\tReleaseMouse();\n\t\t\tbCapture = false;\n\/\/\t\t\tVTLOG(\" -> false\");\n\t\t}\n\/\/\t\tVTLOG(\"\\n\");\n\t}\n\n\t\/\/ Because of the way the event pump works, if it takes too long to\n\t\/\/ handle a MouseMove event, then we might get the next MouseMove\n\t\/\/ event without ever seeing a Redraw or Idle. That's because the\n\t\/\/ MouseMove events are considered higher priority in the queue.\n\t\/\/ So, to keep Enviro response smooth, we effectively ignore all but\n\t\/\/ one MouseMove event per Draw event.\n\tif (ev == wxEVT_MOTION && m_iConsecutiveMousemoves > 1)\n\t\treturn;\n\n\tevent.flags = 0;\n\twxCoord xpos, ypos;\n\tevent1.GetPosition(&xpos, &ypos);\n\tevent.pos.Set(xpos, ypos);\n\n\tif (event1.ControlDown())\n\t\tevent.flags |= VT_CONTROL;\n\n\tif (event1.ShiftDown())\n\t\tevent.flags |= VT_SHIFT;\n\n\tif (event1.AltDown())\n\t\tevent.flags |= VT_ALT;\n\n\t\/\/ inform vtlib scene, which informs the engines\n\tvtGetScene()->OnMouse(event);\n\n\t\/\/ inform Enviro app\n\tg_App.OnMouse(event);\n}\n\nvoid vtGLCanvas::OnEraseBackground(wxEraseEvent& event)\n{\n\t\/\/ Do nothing, to avoid flashing.\n}\n\nvoid vtGLCanvas::OnIdle(wxIdleEvent &event)\n{\n\t\/\/ We use the \"Refresh on Idle\" approach to continuous rendering.\n\tif (m_bRunning)\n\t\tRefresh(FALSE);\n}\n\n<commit_msg>used older wx API for __WXMAC__<commit_after>\/\/\n\/\/ Name:\t canvas.cpp\n\/\/ Purpose: Implements the canvas class for the Enviro wxWidgets application.\n\/\/\n\/\/ Copyright (c) 2001-2006 Virtual Terrain Project\n\/\/ Free for all uses, see license.txt for details.\n\/\/\n\n\/\/ For compilers that support precompilation, includes \"wx.h\".\n#include \"wx\/wxprec.h\"\n\n#ifndef WX_PRECOMP\n#include \"wx\/wx.h\"\n#endif\n\n#include \"vtlib\/vtlib.h\"\n#include \"vtlib\/core\/Event.h\"\n#include \"vtdata\/vtLog.h\"\n#include \"EnviroGUI.h\"\t\t\t\/\/ for g_App, GetTerrainScene\n#include \"canvas.h\"\n#include \"EnviroFrame.h\"\t\t\/\/ for UpdateStatus and OnChar\n#include \"EnviroApp.h\"\n\nDECLARE_APP(EnviroApp)\n\n\/*\n * vtGLCanvas implementation\n *\/\nBEGIN_EVENT_TABLE(vtGLCanvas, wxGLCanvas)\nEVT_CLOSE(vtGLCanvas::OnClose)\nEVT_SIZE(vtGLCanvas::OnSize)\nEVT_PAINT(vtGLCanvas::OnPaint)\nEVT_CHAR(vtGLCanvas::OnChar)\nEVT_KEY_DOWN(vtGLCanvas::OnKeyDown)\nEVT_KEY_UP(vtGLCanvas::OnKeyUp)\nEVT_MOUSE_EVENTS(vtGLCanvas::OnMouseEvent)\nEVT_ERASE_BACKGROUND(vtGLCanvas::OnEraseBackground)\nEVT_IDLE(vtGLCanvas::OnIdle)\nEND_EVENT_TABLE()\n\nstatic vtGLCanvas *s_canvas = NULL;\n\nvtGLCanvas::vtGLCanvas(wxWindow *parent, wxWindowID id, const wxPoint &pos,\n\tconst wxSize &size, long style, const wxString &name, int *gl_attrib):\n#ifdef __WXMAC__\n\t\twxGLCanvas(parent, id, pos, size, style, name, gl_attrib)\n#else\n\t\twxGLCanvas(parent, id, gl_attrib, pos, size, style, name)\n#endif\n{\n\tVTLOG1(\"vtGLCanvas constructor\\n\");\n\n\tVTLOG1(\"vtGLCanvas: calling Show on parent\\n\");\n\tparent->Show();\n\n#ifndef __WXMAC__\n\tm_glContext = new wxGLContext(this);\n#endif\n\n#if __WXMSW__\n\tHGLRC hContext = m_glContext->GetGLRC();\n\tif (NULL == hContext)\n\t{\n\t\twxMessageBox(_(\"No OpenGL support found\") , _(\"Error\"), wxICON_ERROR | wxOK);\n\t\texit(-1);\n\t}\n\telse\n\t\tVTLOG(\"OpenGL context: %lx\\n\", hContext);\n#endif\n\n\t\/\/ Documentation says about SetCurrent:\n\t\/\/ \"Note that this function may only be called after the window has been shown.\"\n\tVTLOG1(\"vtGLCanvas: calling SetCurrent\\n\");\n\tSetCurrent();\n\n\tVTLOG1(\"OpenGL version: \");\n\tVTLOG1((const char *) glGetString(GL_VERSION));\n\tVTLOG1(\"\\n\");\n\tVTLOG1(\"OpenGL vendor: \");\n\tVTLOG1((const char *) glGetString(GL_VENDOR));\n\tVTLOG1(\"\\n\");\n\tVTLOG1(\"OpenGL renderer: \");\n\tVTLOG1((const char *) glGetString(GL_RENDERER));\n\tVTLOG1(\"\\n\");\n\n\tm_bPainting = false;\n\tm_bRunning = true;\n\tm_bShowFrameRateChart = false;\n\n\tfor (int i = 0; i < 512; i++)\n\t\tm_pbKeyState[i] = false;\n\tvtGetScene()->SetKeyStates(m_pbKeyState);\n\tm_iConsecutiveMousemoves = 0;\n\n\t\/\/ On RTL (right-to-left) system, the canvas should still be always LTR\n\tSetLayoutDirection(wxLayout_LeftToRight);\n\n\ts_canvas = this;\n\tVTLOG1(\"vtGLCanvas, leaving constructor\\n\");\n}\n\nvtGLCanvas::~vtGLCanvas(void)\n{\n\tVTLOG1(\"Deleting Canvas\\n\");\n}\n\n\nvoid EnableContinuousRendering(bool bTrue)\n{\n\tVTLOG(\"EnableContinuousRendering %d\\n\", bTrue);\n\tif (!s_canvas)\n\t\treturn;\n\n\tbool bNeedRefresh = (s_canvas->m_bRunning == false && bTrue == true);\n\ts_canvas->m_bRunning = bTrue;\n\tif (bNeedRefresh)\n\t\ts_canvas->Refresh(FALSE);\n\n\tvtGetScene()->TimerRunning(bTrue);\n}\n\nvoid vtGLCanvas::OnPaint( wxPaintEvent& event )\n{\n\tstatic bool bFirstPaint = true;\n\tif (bFirstPaint) VTLOG1(\"vtGLCanvas: first OnPaint\\n\");\n\n\t\/\/ place the dc inside a scope, to delete it before the end of function\n\tif (1)\n\t{\n\t\t\/\/ This is a dummy, to avoid an endless succession of paint messages.\n\t\t\/\/ OnPaint handlers must always create a wxPaintDC.\n\t\tif (bFirstPaint) VTLOG1(\"vtGLCanvas: creating a wxPaintDC on the stack\\n\");\n\t\twxPaintDC dc(this);\n\n\t\t\/\/ Safety checks\n\t\tif (!s_canvas)\n\t\t{\n\t\t\tVTLOG1(\"OnPaint: Canvas not yet constructed, returning\\n\");\n\t\t\treturn;\n\t\t}\n\n\t\t\/\/ Avoid reentrance\n\t\tif (m_bPainting) return;\n\n\t\tm_bPainting = true;\n\n\t\t\/\/ Make sure the Graphics context of this thread is this window\n\t\tSetCurrent();\n\n\t\t\/\/ Render the Scene Graph\n\t\tif (bFirstPaint) VTLOG1(\"vtGLCanvas: DoUpdate\\n\");\n\t\tvtGetScene()->DoUpdate();\n\n\t\tif (m_bShowFrameRateChart)\n\t\t\tvtGetScene()->DrawFrameRateChart();\n\n\t\tif (bFirstPaint) VTLOG1(\"vtGLCanvas: SwapBuffers\\n\");\n\t\tSwapBuffers();\n\n\t\tif (bFirstPaint) VTLOG1(\"vtGLCanvas: update status bar\\n\");\n\t\tEnviroFrame *frame = (EnviroFrame*) GetParent();\n\n\t\t\/\/ update the status bar every 1\/10 of a second\n\t\tstatic float last_stat = 0.0f;\n\t\tstatic vtString last_msg;\n\t\tfloat cur = vtGetTime();\n\t\tif (cur - last_stat > 0.1f || g_App.GetMessage() != last_msg)\n\t\t{\n\t\t\tlast_msg = g_App.GetMessage();\n\t\t\tlast_stat = cur;\n\t\t\tframe->UpdateStatus();\n\t\t}\n\n\t\tframe->UpdateLODInfo();\n\n\t\tm_bPainting = false;\n\t}\n\n\t\/\/ Reset the number of mousemoves we've gotten since last redraw\n\tm_iConsecutiveMousemoves = 0;\n\n\tif (bFirstPaint)\n\t\tbFirstPaint = false;\n}\n\nvoid vtGLCanvas::OnClose(wxCloseEvent& event)\n{\n\tm_bRunning = false;\n}\n\nvoid vtGLCanvas::OnSize(wxSizeEvent& event)\n{\n\tstatic int count = 0;\n\tif (count < 3)\n\t{\n\t\tVTLOG(\"Canvas OnSize: %d %d\\n\", event.GetSize().x, event.GetSize().y);\n\t\tcount++;\n\t}\n\tSetCurrent();\n\tint width, height;\n\tGetClientSize(& width, & height);\n\n\tvtGetScene()->SetWindowSize(width, height);\n\n\twxGLCanvas::OnSize(event);\n}\n\nvoid vtGLCanvas::OnChar(wxKeyEvent& event)\n{\n\tlong key = event.GetKeyCode();\n\n\t\/\/ pass the char to the frame for it to do \"accelerator\" shortcuts\n\tEnviroFrame *frame = (EnviroFrame*) GetParent();\n\tframe->OnChar(event);\n\n\tint flags = 0;\n\n\tif (event.ControlDown())\n\t\tflags |= VT_CONTROL;\n\n\tif (event.ShiftDown())\n\t\tflags |= VT_SHIFT;\n\n\tif (event.AltDown())\n\t\tflags |= VT_ALT;\n\n\t\/\/ pass the char to the vtlib Scene\n\tvtGetScene()->OnKey(key, flags);\n\n\t\/\/ Allow wxWindows to pass the event along to other code\n\tevent.Skip();\n}\n\nvoid vtGLCanvas::OnKeyDown(wxKeyEvent& event)\n{\n\tm_pbKeyState[event.m_keyCode] = true;\n\tevent.Skip();\n}\n\nvoid vtGLCanvas::OnKeyUp(wxKeyEvent& event)\n{\n\tm_pbKeyState[event.m_keyCode] = false;\n\tevent.Skip();\n}\n\nvoid vtGLCanvas::OnMouseEvent(wxMouseEvent& event1)\n{\n\tstatic bool bCapture = false;\n\n\t\/\/ turn WX mouse event into a VT mouse event\n\tvtMouseEvent event;\n\twxEventType ev = event1.GetEventType();\n\tif (ev == wxEVT_LEFT_DOWN) {\n\t\tevent.type = VT_DOWN;\n\t\tevent.button = VT_LEFT;\n\t} else if (ev == wxEVT_LEFT_UP) {\n\t\tevent.type = VT_UP;\n\t\tevent.button = VT_LEFT;\n\t} else if (ev == wxEVT_MIDDLE_DOWN) {\n\t\tevent.type = VT_DOWN;\n\t\tevent.button = VT_MIDDLE;\n\t} else if (ev == wxEVT_MIDDLE_UP) {\n\t\tevent.type = VT_UP;\n\t\tevent.button = VT_MIDDLE;\n\t} else if (ev == wxEVT_RIGHT_DOWN) {\n\t\tevent.type = VT_DOWN;\n\t\tevent.button = VT_RIGHT;\n\t} else if (ev == wxEVT_RIGHT_UP) {\n\t\tevent.type = VT_UP;\n\t\tevent.button = VT_RIGHT;\n\t} else if (ev == wxEVT_MOTION) {\n\t\tevent.type = VT_MOVE;\n\t\tevent.button = VT_NONE;\n\t\tm_iConsecutiveMousemoves++;\t\t\/\/ Increment\n\t} else if (ev == wxEVT_MOUSEWHEEL) {\n\t\tevent.type = VT_WHEEL;\n\t\tevent.button = event1.GetWheelRotation() \/ event1.GetWheelDelta();\n\t} else {\n\t\t\/\/ ignored mouse events, such as wxEVT_LEAVE_WINDOW\n\t\treturn;\n\t}\n\n\tif (ev == wxEVT_LEFT_DOWN || ev == wxEVT_MIDDLE_DOWN || ev == wxEVT_RIGHT_DOWN)\n\t{\n\/\/\t\tVTLOG(\"DOWN: capture %d\", bCapture);\n\t\tif (!bCapture)\n\t\t{\n\t\t\tCaptureMouse();\n\t\t\tbCapture = true;\n\/\/\t\t\tVTLOG(\" -> true\");\n\t\t}\n\/\/\t\tVTLOG(\"\\n\");\n\t}\n\tif (ev == wxEVT_LEFT_UP || ev == wxEVT_MIDDLE_UP || ev == wxEVT_RIGHT_UP)\n\t{\n\/\/\t\tVTLOG(\" UP: capture %d\", bCapture);\n\t\tif (bCapture)\n\t\t{\n\t\t\tReleaseMouse();\n\t\t\tbCapture = false;\n\/\/\t\t\tVTLOG(\" -> false\");\n\t\t}\n\/\/\t\tVTLOG(\"\\n\");\n\t}\n\n\t\/\/ Because of the way the event pump works, if it takes too long to\n\t\/\/ handle a MouseMove event, then we might get the next MouseMove\n\t\/\/ event without ever seeing a Redraw or Idle. That's because the\n\t\/\/ MouseMove events are considered higher priority in the queue.\n\t\/\/ So, to keep Enviro response smooth, we effectively ignore all but\n\t\/\/ one MouseMove event per Draw event.\n\tif (ev == wxEVT_MOTION && m_iConsecutiveMousemoves > 1)\n\t\treturn;\n\n\tevent.flags = 0;\n\twxCoord xpos, ypos;\n\tevent1.GetPosition(&xpos, &ypos);\n\tevent.pos.Set(xpos, ypos);\n\n\tif (event1.ControlDown())\n\t\tevent.flags |= VT_CONTROL;\n\n\tif (event1.ShiftDown())\n\t\tevent.flags |= VT_SHIFT;\n\n\tif (event1.AltDown())\n\t\tevent.flags |= VT_ALT;\n\n\t\/\/ inform vtlib scene, which informs the engines\n\tvtGetScene()->OnMouse(event);\n\n\t\/\/ inform Enviro app\n\tg_App.OnMouse(event);\n}\n\nvoid vtGLCanvas::OnEraseBackground(wxEraseEvent& event)\n{\n\t\/\/ Do nothing, to avoid flashing.\n}\n\nvoid vtGLCanvas::OnIdle(wxIdleEvent &event)\n{\n\t\/\/ We use the \"Refresh on Idle\" approach to continuous rendering.\n\tif (m_bRunning)\n\t\tRefresh(FALSE);\n}\n\n<|endoftext|>"} {"text":"<commit_before>#include <cppunit\/BriefTestProgressListener.h>\n#include <cppunit\/CompilerOutputter.h>\n#include <cppunit\/extensions\/TestFactoryRegistry.h>\n#include <cppunit\/TestResult.h>\n#include <cppunit\/TestResultCollector.h>\n#include <cppunit\/TestRunner.h>\n#include <cppunit\/XmlOutputter.h>\n\n#include <OgrePlatform.h>\n\n#include \"Suite.h\"\n\n#if OGRE_PLATFORM == OGRE_PLATFORM_WIN32\n#define WIN32_LEAN_AND_MEAN\n#include \"windows.h\"\n\nINT WINAPI WinMain( HINSTANCE hInst, HINSTANCE, LPSTR strCmdLine, INT )\n#else\nint main(int argc, char *argv[])\n#endif\n{\n\n setUpSuite();\n\n \/\/ Create the event manager and test controller\n CPPUNIT_NS::TestResult controller;\n\n \/\/ Add a listener that colllects test result\n CPPUNIT_NS::TestResultCollector result;\n controller.addListener( &result );\n\n \/\/ Add a listener that print dots as test run.\n CPPUNIT_NS::BriefTestProgressListener progress;\n controller.addListener( &progress );\n\n \/\/ Add the top suite to the test runner\n CPPUNIT_NS::TestRunner runner;\n runner.addTest( CPPUNIT_NS::TestFactoryRegistry::getRegistry().makeTest() );\n runner.run( controller );\n\n \/\/ Print test results to a file\n\tstd::ofstream ofile(\"OgreTestResults.xml\");\n\t\n CPPUNIT_NS::XmlOutputter xmlOut(&result, ofile);\n xmlOut.write();\n\n tearDownSuite();\n\n return result.wasSuccessful() ? 0 : 1;\n\n}\n<commit_msg>Always return 0 from the tests. Success will be determined by the output.<commit_after>#include <cppunit\/BriefTestProgressListener.h>\n#include <cppunit\/CompilerOutputter.h>\n#include <cppunit\/extensions\/TestFactoryRegistry.h>\n#include <cppunit\/TestResult.h>\n#include <cppunit\/TestResultCollector.h>\n#include <cppunit\/TestRunner.h>\n#include <cppunit\/XmlOutputter.h>\n\n#include <OgrePlatform.h>\n\n#include \"Suite.h\"\n\n#if OGRE_PLATFORM == OGRE_PLATFORM_WIN32\n#define WIN32_LEAN_AND_MEAN\n#include \"windows.h\"\n\nINT WINAPI WinMain( HINSTANCE hInst, HINSTANCE, LPSTR strCmdLine, INT )\n#else\nint main(int argc, char *argv[])\n#endif\n{\n\n setUpSuite();\n\n \/\/ Create the event manager and test controller\n CPPUNIT_NS::TestResult controller;\n\n \/\/ Add a listener that colllects test result\n CPPUNIT_NS::TestResultCollector result;\n controller.addListener( &result );\n\n \/\/ Add a listener that print dots as test run.\n CPPUNIT_NS::BriefTestProgressListener progress;\n controller.addListener( &progress );\n\n \/\/ Add the top suite to the test runner\n CPPUNIT_NS::TestRunner runner;\n runner.addTest( CPPUNIT_NS::TestFactoryRegistry::getRegistry().makeTest() );\n runner.run( controller );\n\n \/\/ Print test results to a file\n\tstd::ofstream ofile(\"OgreTestResults.xml\");\n\t\n CPPUNIT_NS::XmlOutputter xmlOut(&result, ofile);\n xmlOut.write();\n\n tearDownSuite();\n\n return 0;\n}\n<|endoftext|>"} {"text":"<commit_before>#include \"ssdt.h\"\r\n#include \"undocumented.h\"\r\n#include \"pe.h\"\r\n#include \"log.h\"\r\n#include \"ntdll.h\"\r\n\r\n\/\/structures\r\nstruct SSDTStruct\r\n{\r\n\tLONG* pServiceTable;\r\n\tPVOID pCounterTable;\r\n#ifdef _WIN64\r\n\tULONGLONG NumberOfServices;\r\n#else\r\n\tULONG NumberOfServices;\r\n#endif\r\n\tPCHAR pArgumentTable;\r\n};\r\n\r\n\/\/Based on: https:\/\/code.google.com\/p\/volatility\/issues\/detail?id=189#c2\r\nstatic SSDTStruct* SSDTfind()\r\n{\r\n\tstatic SSDTStruct* SSDT = 0;\r\n\tif (!SSDT)\r\n\t{\r\n\t\tUNICODE_STRING routineName;\r\n#ifndef _WIN64\r\n\t\t\/\/x86 code\r\n\t\tRtlInitUnicodeString(&routineName, L\"KeServiceDescriptorTable\");\r\n\t\tSSDT = MmGetSystemRoutineAddress(&routineName);\r\n#else\r\n\t\t\/\/x64 code\r\n\t\tRtlInitUnicodeString(&routineName, L\"KeAddSystemServiceTable\");\r\n\t\tPVOID KeASST = MmGetSystemRoutineAddress(&routineName);\r\n\t\tif (!KeASST)\r\n\t\t{\r\n\t\t\tLog(\"[TITANHIDE] Failed to find KeAddSystemServiceTable!\\n\");\r\n\t\t\treturn 0;\r\n\t\t}\r\n\t\tunsigned char function[1024];\r\n\t\tunsigned int function_size = 0;\r\n\t\tRtlCopyMemory(function, KeASST, sizeof(function));\r\n\t\tfor (unsigned int i = 0; i < sizeof(function); i++)\r\n\t\t{\r\n\t\t\tif (function[i] == 0xC3) \/\/ret\r\n\t\t\t{\r\n\t\t\t\tfunction_size = i + 1;\r\n\t\t\t\tbreak;\r\n\t\t\t}\r\n\t\t}\r\n\t\tif (!function_size)\r\n\t\t{\r\n\t\t\tLog(\"[TITANHIDE] Failed to get function size of KeAddSystemServiceTable!\\n\");\r\n\t\t\treturn 0;\r\n\t\t}\r\n\r\n\t\t\/*\r\n\t\t000000014050EA4A 48 C1 E0 05 shl rax, 5\r\n\t\t000000014050EA4E 48 83 BC 18 80 3A 36 00 00 cmp qword ptr [rax+rbx+363A80h], 0 <- we are looking for this instruction\r\n\t\t000000014050EA57 0F 85 B2 5C 0A 00 jnz loc_1405B470F\r\n\t\t000000014050EA5D 48 8D 8B C0 3A 36 00 lea rcx, rva KeServiceDescriptorTableShadow[rbx]\r\n\t\t000000014050EA64 48 03 C8 add rcx, rax\r\n\t\t000000014050EA67 48 83 39 00 cmp qword ptr [rcx], 0\r\n\t\t*\/\r\n\t\tint rvaSSDT = 0;\r\n\t\tfor (unsigned int i = 0; i < function_size; i++)\r\n\t\t{\r\n\t\t\tif (((*(unsigned int*)(function + i)) & 0x00FFFFF0) == 0xBC8340 &&\r\n\t\t\t\t!*(unsigned char*)(function + i + 8)) \/\/4?83bc?? ???????? 00 cmp qword ptr [r?+r?+????????h],0\r\n\t\t\t{\r\n\t\t\t\trvaSSDT = *(unsigned int*)(function + i + 4);\r\n\t\t\t\tbreak;\r\n\t\t\t}\r\n\t\t}\r\n\t\tif (rvaSSDT) \/\/this method worked\r\n\t\t{\r\n\t\t\tLog(\"[TITANHIDE] SSDT RVA: 0x%X\\n\", rvaSSDT);\r\n\t\t\tPVOID base = Undocumented::GetKernelBase();\r\n\t\t\tif (!base)\r\n\t\t\t{\r\n\t\t\t\tLog(\"[TITANHIDE] GetKernelBase() failed!\\n\");\r\n\t\t\t\treturn 0;\r\n\t\t\t}\r\n\t\t\tLog(\"[TITANHIDE] GetKernelBase()->0x%p\\n\", base);\r\n\t\t\tSSDT = (SSDTStruct*)((unsigned char*)base + rvaSSDT);\r\n\t\t}\r\n\r\n\t\t\/*\r\n\t\tWindows 10 Technical Preview:\r\n\t\tfffff800e21b30ec 757f jne nt!KeAddSystemServiceTable+0x91 (fffff800e21b316d)\r\n\t\tfffff800e21b30ee 48833deafee4ff00 cmp qword ptr [nt!KeServiceDescriptorTable+0x20 (fffff800e2002fe0)],0 <- we are looking for this instruction\r\n\t\tfffff800e21b30f6 7575 jne nt!KeAddSystemServiceTable+0x91 (fffff800e21b316d)\r\n\t\tfffff800e21b30f8 48833da0fee4ff00 cmp qword ptr [nt!KeServiceDescriptorTableShadow+0x20 (fffff800e2002fa0)],0\r\n\t\tfffff800e21b3100 756b jne nt!KeAddSystemServiceTable+0x91 (fffff800e21b316d)\r\n\t\t*\/\r\n\t\tint rvaFound = -1;\r\n\t\tfor (unsigned int i = 0; i < function_size; i++)\r\n\t\t{\r\n\t\t\tif (((*(unsigned int*)(function + i)) & 0x00FFFFFF) == 0x3D8348 &&\r\n\t\t\t\t!*(unsigned char*)(function + i + 7)) \/\/48833d ???????? 00 cmp qword ptr [X],0\r\n\t\t\t{\r\n\t\t\t\trvaFound = i;\r\n\t\t\t\trvaSSDT = *(unsigned int*)(function + i + 3);\r\n\t\t\t\tbreak;\r\n\t\t\t}\r\n\t\t}\r\n\t\tif (rvaFound == -1)\r\n\t\t{\r\n\t\t\tLog(\"[TITANHIDE] Failed to find pattern...\\n\");\r\n\t\t\treturn 0;\r\n\t\t}\r\n\t\t\/\/Sanity check SSDT & contents\r\n\t\t__try\r\n\t\t{\r\n\t\t\tSSDT = (SSDTStruct*)((ULONG_PTR)KeASST + rvaFound + rvaSSDT + 8 - 0x20);\r\n\t\t\tULONG_PTR check = (ULONG_PTR)KeASST & 0xFFFFFFFF00000000;\r\n\t\t\tif (((ULONG_PTR)SSDT & 0xFFFFFFFF00000000 != check) ||\r\n\t\t\t\t((ULONG_PTR)SSDT->pServiceTable & 0xFFFFFFFF00000000) != check ||\r\n\t\t\t\t(SSDT->NumberOfServices & 0xFFFFFFFFFFFF0000) != 0 ||\r\n\t\t\t\t((ULONG_PTR)SSDT->pArgumentTable & 0xFFFFFFFF00000000) != check)\r\n\t\t\t{\r\n\t\t\t\tLog(\"[TITANHIDE] Found SSDT didn't pass all checks...\\n\");\r\n\t\t\t\treturn 0;\r\n\t\t\t}\r\n\t\t}\r\n\t\t__except (EXCEPTION_EXECUTE_HANDLER)\r\n\t\t{\r\n\t\t\tLog(\"[TITANHIDE] An exception was thrown while accessing the SSDT...\\n\");\r\n\t\t\treturn 0;\r\n\t\t}\r\n#endif\r\n\t}\r\n\treturn SSDT;\r\n}\r\n\r\nPVOID SSDT::GetFunctionAddress(const char* apiname)\r\n{\r\n\t\/\/read address from SSDT\r\n\tSSDTStruct* SSDT = SSDTfind();\r\n\tif (!SSDT)\r\n\t{\r\n\t\tLog(\"[TITANHIDE] SSDT not found...\\n\");\r\n\t\treturn 0;\r\n\t}\r\n\tULONG_PTR SSDTbase = (ULONG_PTR)SSDT->pServiceTable;\r\n\tif (!SSDTbase)\r\n\t{\r\n\t\tLog(\"[TITANHIDE] ServiceTable not found...\\n\");\r\n\t\treturn 0;\r\n\t}\r\n\tULONG readOffset = NTDLL::GetExportSsdtIndex(apiname);\r\n\tif (readOffset == -1)\r\n\t\treturn 0;\r\n\tif (readOffset >= SSDT->NumberOfServices)\r\n\t{\r\n\t\tLog(\"[TITANHIDE] Invalid read offset...\\n\");\r\n\t\treturn 0;\r\n}\r\n#ifdef _WIN64\r\n\treturn (PVOID)((SSDT->pServiceTable[readOffset] >> 4) + SSDTbase);\r\n#else\r\n\treturn (PVOID)SSDT->pServiceTable[readOffset];\r\n#endif\r\n}\r\n\r\nstatic void InterlockedSet(LONG* Destination, LONG Source)\r\n{\r\n\t\/\/Change memory properties.\r\n\tPMDL g_pmdl = IoAllocateMdl(Destination, sizeof(LONG), 0, 0, NULL);\r\n\tif (!g_pmdl)\r\n\t\treturn;\r\n\tMmBuildMdlForNonPagedPool(g_pmdl);\r\n\tLONG* Mapped = (LONG*)MmMapLockedPages(g_pmdl, KernelMode);\r\n\tif (!Mapped)\r\n\t{\r\n\t\tIoFreeMdl(g_pmdl);\r\n\t\treturn;\r\n\t}\r\n\tInterlockedExchange(Mapped, Source);\r\n\t\/\/Restore memory properties.\r\n\tMmUnmapLockedPages((PVOID)Mapped, g_pmdl);\r\n\tIoFreeMdl(g_pmdl);\r\n}\r\n\r\n#ifdef _WIN64\r\nstatic PVOID FindCaveAddress(PVOID CodeStart, ULONG CodeSize, ULONG CaveSize)\r\n{\r\n\tunsigned char* Code = (unsigned char*)CodeStart;\r\n\r\n\tfor (unsigned int i = 0, j = 0; i < CodeSize; i++)\r\n\t{\r\n\t\tif (Code[i] == 0x90 || Code[i] == 0xCC) \/\/NOP or INT3\r\n\t\t\tj++;\r\n\t\telse\r\n\t\t\tj = 0;\r\n\t\tif (j == CaveSize)\r\n\t\t\treturn (PVOID)((ULONG_PTR)CodeStart + i - CaveSize + 1);\r\n\t}\r\n\treturn 0;\r\n}\r\n#endif \/\/_WIN64\r\n\r\nHOOK SSDT::Hook(const char* apiname, void* newfunc)\r\n{\r\n\tSSDTStruct* SSDT = SSDTfind();\r\n\tif (!SSDT)\r\n\t{\r\n\t\tLog(\"[TITANHIDE] SSDT not found...\\n\");\r\n\t\treturn 0;\r\n\t}\r\n\tULONG_PTR SSDTbase = (ULONG_PTR)SSDT->pServiceTable;\r\n\tif (!SSDTbase)\r\n\t{\r\n\t\tLog(\"[TITANHIDE] ServiceTable not found...\\n\");\r\n\t\treturn 0;\r\n\t}\r\n\tULONG FunctionIndex = NTDLL::GetExportSsdtIndex(apiname);\r\n\tif (FunctionIndex == -1)\r\n\t\treturn 0;\r\n\tif (FunctionIndex >= SSDT->NumberOfServices)\r\n\t{\r\n\t\tLog(\"[TITANHIDE] Invalid API offset...\\n\");\r\n\t\treturn 0;\r\n\t}\r\n\r\n\tHOOK hHook = 0;\r\n\tULONG oldValue = SSDT->pServiceTable[FunctionIndex];\r\n\tULONG newValue;\r\n\r\n#ifdef _WIN64\r\n\t\/*\r\n\tx64 SSDT Hook;\r\n\t1) find API addr\r\n\t2) get code page+size\r\n\t3) find cave address\r\n\t4) hook cave address (using hooklib)\r\n\t5) change SSDT value\r\n\t*\/\r\n\r\n\tstatic ULONG CodeSize = 0;\r\n\tstatic PVOID CodeStart = 0;\r\n\tif (!CodeStart)\r\n\t{\r\n\t\tULONG_PTR Lowest = SSDTbase;\r\n\t\tULONG_PTR Highest = Lowest + 0x0FFFFFFF;\r\n\t\tLog(\"[TITANHIDE] Range: 0x%p-0x%p\\n\", Lowest, Highest);\r\n\t\tCodeSize = 0;\r\n\t\tCodeStart = PE::GetPageBase(Undocumented::GetKernelBase(), &CodeSize, (PVOID)((oldValue >> 4) + SSDTbase));\r\n\t\tif (!CodeStart || !CodeSize)\r\n\t\t{\r\n\t\t\tLog(\"[TITANHIDE] PeGetPageBase failed...\\n\");\r\n\t\t\treturn 0;\r\n\t\t}\r\n\t\tLog(\"[TITANHIDE] CodeStart: 0x%p, CodeSize: 0x%X\\n\", CodeStart, CodeSize);\r\n\t\tif ((ULONG_PTR)CodeStart < Lowest) \/\/start of the page is out of range (impossible, but whatever)\r\n\t\t{\r\n\t\t\tCodeSize -= (ULONG)(Lowest - (ULONG_PTR)CodeStart);\r\n\t\t\tCodeStart = (PVOID)Lowest;\r\n\t\t\tLog(\"[TITANHIDE] CodeStart: 0x%p, CodeSize: 0x%X\\n\", CodeStart, CodeSize);\r\n\t\t}\r\n\t\tLog(\"[TITANHIDE] Range: 0x%p-0x%p\\n\", CodeStart, (ULONG_PTR)CodeStart + CodeSize);\r\n\t}\r\n\r\n\tPVOID CaveAddress = FindCaveAddress(CodeStart, CodeSize, sizeof(HOOKOPCODES));\r\n\tif (!CaveAddress)\r\n\t{\r\n\t\tLog(\"[TITANHIDE] FindCaveAddress failed...\\n\");\r\n\t\treturn 0;\r\n\t}\r\n\tLog(\"[TITANHIDE] CaveAddress: 0x%p\\n\", CaveAddress);\r\n\r\n\thHook = Hooklib::Hook(CaveAddress, (void*)newfunc);\r\n\tif (!hHook)\r\n\t\treturn 0;\r\n\r\n\tnewValue = (ULONG)((ULONG_PTR)CaveAddress - SSDTbase);\r\n\tnewValue = (newValue << 4) | oldValue & 0xF;\r\n\r\n\t\/\/update HOOK structure\r\n\thHook->SSDTindex = FunctionIndex;\r\n\thHook->SSDTold = oldValue;\r\n\thHook->SSDTnew = newValue;\r\n\thHook->SSDTaddress = (oldValue >> 4) + SSDTbase;\r\n\r\n#else\r\n\t\/*\r\n\tx86 SSDT Hook:\r\n\t1) change SSDT value\r\n\t*\/\r\n\tnewValue = (ULONG)newfunc;\r\n\r\n\thHook = (HOOK)RtlAllocateMemory(true, sizeof(HOOKSTRUCT));\r\n\r\n\t\/\/update HOOK structure\r\n\thHook->SSDTindex = FunctionIndex;\r\n\thHook->SSDTold = oldValue;\r\n\thHook->SSDTnew = newValue;\r\n\thHook->SSDTaddress = oldValue;\r\n\r\n#endif\r\n\r\n\tInterlockedSet(&SSDT->pServiceTable[FunctionIndex], newValue);\r\n\r\n\tLog(\"[TITANHIDE] SSDThook(%s:0x%p, 0x%p)\\n\", apiname, hHook->SSDTold, hHook->SSDTnew);\r\n\r\n\treturn hHook;\r\n}\r\n\r\nvoid SSDT::Hook(HOOK hHook)\r\n{\r\n\tif (!hHook)\r\n\t\treturn;\r\n\tSSDTStruct* SSDT = SSDTfind();\r\n\tif (!SSDT)\r\n\t{\r\n\t\tLog(\"[TITANHIDE] SSDT not found...\\n\");\r\n\t\treturn;\r\n\t}\r\n\tLONG* SSDT_Table = SSDT->pServiceTable;\r\n\tif (!SSDT_Table)\r\n\t{\r\n\t\tLog(\"[TITANHIDE] ServiceTable not found...\\n\");\r\n\t\treturn;\r\n\t}\r\n\tInterlockedSet(&SSDT_Table[hHook->SSDTindex], hHook->SSDTnew);\r\n}\r\n\r\nvoid SSDT::Unhook(HOOK hHook, bool free)\r\n{\r\n\tif (!hHook)\r\n\t\treturn;\r\n\tSSDTStruct* SSDT = SSDTfind();\r\n\tif (!SSDT)\r\n\t{\r\n\t\tLog(\"[TITANHIDE] SSDT not found...\\n\");\r\n\t\treturn;\r\n\t}\r\n\tLONG* SSDT_Table = SSDT->pServiceTable;\r\n\tif (!SSDT_Table)\r\n\t{\r\n\t\tLog(\"[TITANHIDE] ServiceTable not found...\\n\");\r\n\t\treturn;\r\n\t}\r\n\tInterlockedSet(&SSDT_Table[hHook->SSDTindex], hHook->SSDTold);\r\n#ifdef _WIN64\r\n\tif (free)\r\n\t\tHooklib::Unhook(hHook, true);\r\n#else\r\n\tUNREFERENCED_PARAMETER(free);\r\n#endif\r\n\t}<commit_msg>fixed type<commit_after>#include \"ssdt.h\"\r\n#include \"undocumented.h\"\r\n#include \"pe.h\"\r\n#include \"log.h\"\r\n#include \"ntdll.h\"\r\n\r\n\/\/structures\r\nstruct SSDTStruct\r\n{\r\n\tLONG* pServiceTable;\r\n\tPVOID pCounterTable;\r\n#ifdef _WIN64\r\n\tULONGLONG NumberOfServices;\r\n#else\r\n\tULONG NumberOfServices;\r\n#endif\r\n\tPCHAR pArgumentTable;\r\n};\r\n\r\n\/\/Based on: https:\/\/code.google.com\/p\/volatility\/issues\/detail?id=189#c2\r\nstatic SSDTStruct* SSDTfind()\r\n{\r\n\tstatic SSDTStruct* SSDT = 0;\r\n\tif (!SSDT)\r\n\t{\r\n\t\tUNICODE_STRING routineName;\r\n#ifndef _WIN64\r\n\t\t\/\/x86 code\r\n\t\tRtlInitUnicodeString(&routineName, L\"KeServiceDescriptorTable\");\r\n\t\tSSDT = MmGetSystemRoutineAddress(&routineName);\r\n#else\r\n\t\t\/\/x64 code\r\n\t\tRtlInitUnicodeString(&routineName, L\"KeAddSystemServiceTable\");\r\n\t\tPVOID KeASST = MmGetSystemRoutineAddress(&routineName);\r\n\t\tif (!KeASST)\r\n\t\t{\r\n\t\t\tLog(\"[TITANHIDE] Failed to find KeAddSystemServiceTable!\\n\");\r\n\t\t\treturn 0;\r\n\t\t}\r\n\t\tunsigned char function[1024];\r\n\t\tunsigned int function_size = 0;\r\n\t\tRtlCopyMemory(function, KeASST, sizeof(function));\r\n\t\tfor (unsigned int i = 0; i < sizeof(function); i++)\r\n\t\t{\r\n\t\t\tif (function[i] == 0xC3) \/\/ret\r\n\t\t\t{\r\n\t\t\t\tfunction_size = i + 1;\r\n\t\t\t\tbreak;\r\n\t\t\t}\r\n\t\t}\r\n\t\tif (!function_size)\r\n\t\t{\r\n\t\t\tLog(\"[TITANHIDE] Failed to get function size of KeAddSystemServiceTable!\\n\");\r\n\t\t\treturn 0;\r\n\t\t}\r\n\r\n\t\t\/*\r\n\t\t000000014050EA4A 48 C1 E0 05 shl rax, 5\r\n\t\t000000014050EA4E 48 83 BC 18 80 3A 36 00 00 cmp qword ptr [rax+rbx+363A80h], 0 <- we are looking for this instruction\r\n\t\t000000014050EA57 0F 85 B2 5C 0A 00 jnz loc_1405B470F\r\n\t\t000000014050EA5D 48 8D 8B C0 3A 36 00 lea rcx, rva KeServiceDescriptorTableShadow[rbx]\r\n\t\t000000014050EA64 48 03 C8 add rcx, rax\r\n\t\t000000014050EA67 48 83 39 00 cmp qword ptr [rcx], 0\r\n\t\t*\/\r\n\t\tint rvaSSDT = 0;\r\n\t\tfor (unsigned int i = 0; i < function_size; i++)\r\n\t\t{\r\n\t\t\tif (((*(unsigned int*)(function + i)) & 0x00FFFFF0) == 0xBC8340 &&\r\n\t\t\t\t!*(unsigned char*)(function + i + 8)) \/\/4?83bc?? ???????? 00 cmp qword ptr [r?+r?+????????h],0\r\n\t\t\t{\r\n\t\t\t\trvaSSDT = *(int*)(function + i + 4);\r\n\t\t\t\tbreak;\r\n\t\t\t}\r\n\t\t}\r\n\t\tif (rvaSSDT) \/\/this method worked\r\n\t\t{\r\n\t\t\tLog(\"[TITANHIDE] SSDT RVA: 0x%X\\n\", rvaSSDT);\r\n\t\t\tPVOID base = Undocumented::GetKernelBase();\r\n\t\t\tif (!base)\r\n\t\t\t{\r\n\t\t\t\tLog(\"[TITANHIDE] GetKernelBase() failed!\\n\");\r\n\t\t\t\treturn 0;\r\n\t\t\t}\r\n\t\t\tLog(\"[TITANHIDE] GetKernelBase()->0x%p\\n\", base);\r\n\t\t\tSSDT = (SSDTStruct*)((unsigned char*)base + rvaSSDT);\r\n\t\t}\r\n\r\n\t\t\/*\r\n\t\tWindows 10 Technical Preview:\r\n\t\tfffff800e21b30ec 757f jne nt!KeAddSystemServiceTable+0x91 (fffff800e21b316d)\r\n\t\tfffff800e21b30ee 48833deafee4ff00 cmp qword ptr [nt!KeServiceDescriptorTable+0x20 (fffff800e2002fe0)],0 <- we are looking for this instruction\r\n\t\tfffff800e21b30f6 7575 jne nt!KeAddSystemServiceTable+0x91 (fffff800e21b316d)\r\n\t\tfffff800e21b30f8 48833da0fee4ff00 cmp qword ptr [nt!KeServiceDescriptorTableShadow+0x20 (fffff800e2002fa0)],0\r\n\t\tfffff800e21b3100 756b jne nt!KeAddSystemServiceTable+0x91 (fffff800e21b316d)\r\n\t\t*\/\r\n\t\tint rvaFound = -1;\r\n\t\tfor (unsigned int i = 0; i < function_size; i++)\r\n\t\t{\r\n\t\t\tif (((*(unsigned int*)(function + i)) & 0x00FFFFFF) == 0x3D8348 &&\r\n\t\t\t\t!*(unsigned char*)(function + i + 7)) \/\/48833d ???????? 00 cmp qword ptr [X],0\r\n\t\t\t{\r\n\t\t\t\trvaFound = i;\r\n\t\t\t\trvaSSDT = *(int*)(function + i + 3);\r\n\t\t\t\tbreak;\r\n\t\t\t}\r\n\t\t}\r\n\t\tif (rvaFound == -1)\r\n\t\t{\r\n\t\t\tLog(\"[TITANHIDE] Failed to find pattern...\\n\");\r\n\t\t\treturn 0;\r\n\t\t}\r\n\t\t\/\/Sanity check SSDT & contents\r\n\t\t__try\r\n\t\t{\r\n\t\t\tSSDT = (SSDTStruct*)((ULONG_PTR)KeASST + rvaFound + rvaSSDT + 8 - 0x20);\r\n\t\t\tULONG_PTR check = (ULONG_PTR)KeASST & 0xFFFFFFFF00000000;\r\n\t\t\tif (((ULONG_PTR)SSDT & 0xFFFFFFFF00000000 != check) ||\r\n\t\t\t\t((ULONG_PTR)SSDT->pServiceTable & 0xFFFFFFFF00000000) != check ||\r\n\t\t\t\t(SSDT->NumberOfServices & 0xFFFFFFFFFFFF0000) != 0 ||\r\n\t\t\t\t((ULONG_PTR)SSDT->pArgumentTable & 0xFFFFFFFF00000000) != check)\r\n\t\t\t{\r\n\t\t\t\tLog(\"[TITANHIDE] Found SSDT didn't pass all checks...\\n\");\r\n\t\t\t\treturn 0;\r\n\t\t\t}\r\n\t\t}\r\n\t\t__except (EXCEPTION_EXECUTE_HANDLER)\r\n\t\t{\r\n\t\t\tLog(\"[TITANHIDE] An exception was thrown while accessing the SSDT...\\n\");\r\n\t\t\treturn 0;\r\n\t\t}\r\n#endif\r\n\t}\r\n\treturn SSDT;\r\n}\r\n\r\nPVOID SSDT::GetFunctionAddress(const char* apiname)\r\n{\r\n\t\/\/read address from SSDT\r\n\tSSDTStruct* SSDT = SSDTfind();\r\n\tif (!SSDT)\r\n\t{\r\n\t\tLog(\"[TITANHIDE] SSDT not found...\\n\");\r\n\t\treturn 0;\r\n\t}\r\n\tULONG_PTR SSDTbase = (ULONG_PTR)SSDT->pServiceTable;\r\n\tif (!SSDTbase)\r\n\t{\r\n\t\tLog(\"[TITANHIDE] ServiceTable not found...\\n\");\r\n\t\treturn 0;\r\n\t}\r\n\tULONG readOffset = NTDLL::GetExportSsdtIndex(apiname);\r\n\tif (readOffset == -1)\r\n\t\treturn 0;\r\n\tif (readOffset >= SSDT->NumberOfServices)\r\n\t{\r\n\t\tLog(\"[TITANHIDE] Invalid read offset...\\n\");\r\n\t\treturn 0;\r\n}\r\n#ifdef _WIN64\r\n\treturn (PVOID)((SSDT->pServiceTable[readOffset] >> 4) + SSDTbase);\r\n#else\r\n\treturn (PVOID)SSDT->pServiceTable[readOffset];\r\n#endif\r\n}\r\n\r\nstatic void InterlockedSet(LONG* Destination, LONG Source)\r\n{\r\n\t\/\/Change memory properties.\r\n\tPMDL g_pmdl = IoAllocateMdl(Destination, sizeof(LONG), 0, 0, NULL);\r\n\tif (!g_pmdl)\r\n\t\treturn;\r\n\tMmBuildMdlForNonPagedPool(g_pmdl);\r\n\tLONG* Mapped = (LONG*)MmMapLockedPages(g_pmdl, KernelMode);\r\n\tif (!Mapped)\r\n\t{\r\n\t\tIoFreeMdl(g_pmdl);\r\n\t\treturn;\r\n\t}\r\n\tInterlockedExchange(Mapped, Source);\r\n\t\/\/Restore memory properties.\r\n\tMmUnmapLockedPages((PVOID)Mapped, g_pmdl);\r\n\tIoFreeMdl(g_pmdl);\r\n}\r\n\r\n#ifdef _WIN64\r\nstatic PVOID FindCaveAddress(PVOID CodeStart, ULONG CodeSize, ULONG CaveSize)\r\n{\r\n\tunsigned char* Code = (unsigned char*)CodeStart;\r\n\r\n\tfor (unsigned int i = 0, j = 0; i < CodeSize; i++)\r\n\t{\r\n\t\tif (Code[i] == 0x90 || Code[i] == 0xCC) \/\/NOP or INT3\r\n\t\t\tj++;\r\n\t\telse\r\n\t\t\tj = 0;\r\n\t\tif (j == CaveSize)\r\n\t\t\treturn (PVOID)((ULONG_PTR)CodeStart + i - CaveSize + 1);\r\n\t}\r\n\treturn 0;\r\n}\r\n#endif \/\/_WIN64\r\n\r\nHOOK SSDT::Hook(const char* apiname, void* newfunc)\r\n{\r\n\tSSDTStruct* SSDT = SSDTfind();\r\n\tif (!SSDT)\r\n\t{\r\n\t\tLog(\"[TITANHIDE] SSDT not found...\\n\");\r\n\t\treturn 0;\r\n\t}\r\n\tULONG_PTR SSDTbase = (ULONG_PTR)SSDT->pServiceTable;\r\n\tif (!SSDTbase)\r\n\t{\r\n\t\tLog(\"[TITANHIDE] ServiceTable not found...\\n\");\r\n\t\treturn 0;\r\n\t}\r\n\tULONG FunctionIndex = NTDLL::GetExportSsdtIndex(apiname);\r\n\tif (FunctionIndex == -1)\r\n\t\treturn 0;\r\n\tif (FunctionIndex >= SSDT->NumberOfServices)\r\n\t{\r\n\t\tLog(\"[TITANHIDE] Invalid API offset...\\n\");\r\n\t\treturn 0;\r\n\t}\r\n\r\n\tHOOK hHook = 0;\r\n\tULONG oldValue = SSDT->pServiceTable[FunctionIndex];\r\n\tULONG newValue;\r\n\r\n#ifdef _WIN64\r\n\t\/*\r\n\tx64 SSDT Hook;\r\n\t1) find API addr\r\n\t2) get code page+size\r\n\t3) find cave address\r\n\t4) hook cave address (using hooklib)\r\n\t5) change SSDT value\r\n\t*\/\r\n\r\n\tstatic ULONG CodeSize = 0;\r\n\tstatic PVOID CodeStart = 0;\r\n\tif (!CodeStart)\r\n\t{\r\n\t\tULONG_PTR Lowest = SSDTbase;\r\n\t\tULONG_PTR Highest = Lowest + 0x0FFFFFFF;\r\n\t\tLog(\"[TITANHIDE] Range: 0x%p-0x%p\\n\", Lowest, Highest);\r\n\t\tCodeSize = 0;\r\n\t\tCodeStart = PE::GetPageBase(Undocumented::GetKernelBase(), &CodeSize, (PVOID)((oldValue >> 4) + SSDTbase));\r\n\t\tif (!CodeStart || !CodeSize)\r\n\t\t{\r\n\t\t\tLog(\"[TITANHIDE] PeGetPageBase failed...\\n\");\r\n\t\t\treturn 0;\r\n\t\t}\r\n\t\tLog(\"[TITANHIDE] CodeStart: 0x%p, CodeSize: 0x%X\\n\", CodeStart, CodeSize);\r\n\t\tif ((ULONG_PTR)CodeStart < Lowest) \/\/start of the page is out of range (impossible, but whatever)\r\n\t\t{\r\n\t\t\tCodeSize -= (ULONG)(Lowest - (ULONG_PTR)CodeStart);\r\n\t\t\tCodeStart = (PVOID)Lowest;\r\n\t\t\tLog(\"[TITANHIDE] CodeStart: 0x%p, CodeSize: 0x%X\\n\", CodeStart, CodeSize);\r\n\t\t}\r\n\t\tLog(\"[TITANHIDE] Range: 0x%p-0x%p\\n\", CodeStart, (ULONG_PTR)CodeStart + CodeSize);\r\n\t}\r\n\r\n\tPVOID CaveAddress = FindCaveAddress(CodeStart, CodeSize, sizeof(HOOKOPCODES));\r\n\tif (!CaveAddress)\r\n\t{\r\n\t\tLog(\"[TITANHIDE] FindCaveAddress failed...\\n\");\r\n\t\treturn 0;\r\n\t}\r\n\tLog(\"[TITANHIDE] CaveAddress: 0x%p\\n\", CaveAddress);\r\n\r\n\thHook = Hooklib::Hook(CaveAddress, (void*)newfunc);\r\n\tif (!hHook)\r\n\t\treturn 0;\r\n\r\n\tnewValue = (ULONG)((ULONG_PTR)CaveAddress - SSDTbase);\r\n\tnewValue = (newValue << 4) | oldValue & 0xF;\r\n\r\n\t\/\/update HOOK structure\r\n\thHook->SSDTindex = FunctionIndex;\r\n\thHook->SSDTold = oldValue;\r\n\thHook->SSDTnew = newValue;\r\n\thHook->SSDTaddress = (oldValue >> 4) + SSDTbase;\r\n\r\n#else\r\n\t\/*\r\n\tx86 SSDT Hook:\r\n\t1) change SSDT value\r\n\t*\/\r\n\tnewValue = (ULONG)newfunc;\r\n\r\n\thHook = (HOOK)RtlAllocateMemory(true, sizeof(HOOKSTRUCT));\r\n\r\n\t\/\/update HOOK structure\r\n\thHook->SSDTindex = FunctionIndex;\r\n\thHook->SSDTold = oldValue;\r\n\thHook->SSDTnew = newValue;\r\n\thHook->SSDTaddress = oldValue;\r\n\r\n#endif\r\n\r\n\tInterlockedSet(&SSDT->pServiceTable[FunctionIndex], newValue);\r\n\r\n\tLog(\"[TITANHIDE] SSDThook(%s:0x%p, 0x%p)\\n\", apiname, hHook->SSDTold, hHook->SSDTnew);\r\n\r\n\treturn hHook;\r\n}\r\n\r\nvoid SSDT::Hook(HOOK hHook)\r\n{\r\n\tif (!hHook)\r\n\t\treturn;\r\n\tSSDTStruct* SSDT = SSDTfind();\r\n\tif (!SSDT)\r\n\t{\r\n\t\tLog(\"[TITANHIDE] SSDT not found...\\n\");\r\n\t\treturn;\r\n\t}\r\n\tLONG* SSDT_Table = SSDT->pServiceTable;\r\n\tif (!SSDT_Table)\r\n\t{\r\n\t\tLog(\"[TITANHIDE] ServiceTable not found...\\n\");\r\n\t\treturn;\r\n\t}\r\n\tInterlockedSet(&SSDT_Table[hHook->SSDTindex], hHook->SSDTnew);\r\n}\r\n\r\nvoid SSDT::Unhook(HOOK hHook, bool free)\r\n{\r\n\tif (!hHook)\r\n\t\treturn;\r\n\tSSDTStruct* SSDT = SSDTfind();\r\n\tif (!SSDT)\r\n\t{\r\n\t\tLog(\"[TITANHIDE] SSDT not found...\\n\");\r\n\t\treturn;\r\n\t}\r\n\tLONG* SSDT_Table = SSDT->pServiceTable;\r\n\tif (!SSDT_Table)\r\n\t{\r\n\t\tLog(\"[TITANHIDE] ServiceTable not found...\\n\");\r\n\t\treturn;\r\n\t}\r\n\tInterlockedSet(&SSDT_Table[hHook->SSDTindex], hHook->SSDTold);\r\n#ifdef _WIN64\r\n\tif (free)\r\n\t\tHooklib::Unhook(hHook, true);\r\n#else\r\n\tUNREFERENCED_PARAMETER(free);\r\n#endif\r\n\t}<|endoftext|>"} {"text":"<commit_before>\/\/ Copyright (c) 2012 The Chromium Authors. All rights reserved.\n\/\/ Use of this source code is governed by a BSD-style license that can be\n\/\/ found in the LICENSE file.\n\n#include \"chrome\/browser\/ui\/webui\/task_manager_handler.h\"\n\n#include <algorithm>\n#include <functional>\n\n#include \"base\/bind.h\"\n#include \"base\/bind_helpers.h\"\n#include \"base\/string_number_conversions.h\"\n#include \"base\/values.h\"\n#include \"chrome\/browser\/profiles\/profile.h\"\n#include \"chrome\/browser\/task_manager\/task_manager.h\"\n#include \"chrome\/browser\/ui\/webui\/web_ui_util.h\"\n#include \"chrome\/common\/chrome_notification_types.h\"\n#include \"content\/browser\/renderer_host\/render_view_host.h\"\n#include \"content\/public\/browser\/notification_service.h\"\n#include \"content\/public\/browser\/notification_source.h\"\n#include \"content\/public\/browser\/render_view_host_delegate.h\"\n#include \"content\/public\/browser\/web_contents.h\"\n#include \"content\/public\/browser\/web_ui.h\"\n#include \"third_party\/skia\/include\/core\/SkBitmap.h\"\n#include \"webkit\/glue\/webpreferences.h\"\n\nnamespace {\n\nValue* CreateColumnValue(const TaskManagerModel* tm,\n const std::string& column_name,\n const int i) {\n if (column_name == \"uniqueId\")\n return Value::CreateIntegerValue(tm->GetResourceUniqueId(i));\n if (column_name == \"type\")\n return Value::CreateStringValue(\n TaskManager::Resource::GetResourceTypeAsString(\n tm->GetResourceType(i)));\n if (column_name == \"processId\")\n return Value::CreateStringValue(tm->GetResourceProcessId(i));\n if (column_name == \"processIdValue\")\n return Value::CreateIntegerValue(tm->GetProcessId(i));\n if (column_name == \"cpuUsage\")\n return Value::CreateStringValue(tm->GetResourceCPUUsage(i));\n if (column_name == \"cpuUsageValue\")\n return Value::CreateDoubleValue(tm->GetCPUUsage(i));\n if (column_name == \"privateMemory\")\n return Value::CreateStringValue(tm->GetResourcePrivateMemory(i));\n if (column_name == \"privateMemoryValue\") {\n size_t private_memory;\n tm->GetPrivateMemory(i, &private_memory);\n return Value::CreateDoubleValue(private_memory);\n }\n if (column_name == \"sharedMemory\")\n return Value::CreateStringValue(tm->GetResourceSharedMemory(i));\n if (column_name == \"sharedMemoryValue\") {\n size_t shared_memory;\n tm->GetSharedMemory(i, &shared_memory);\n return Value::CreateDoubleValue(shared_memory);\n }\n if (column_name == \"physicalMemory\")\n return Value::CreateStringValue(tm->GetResourcePhysicalMemory(i));\n if (column_name == \"physicalMemoryValue\") {\n size_t physical_memory;\n tm->GetPhysicalMemory(i, &physical_memory);\n return Value::CreateDoubleValue(physical_memory);\n }\n if (column_name == \"icon\")\n return Value::CreateStringValue(\n web_ui_util::GetImageDataUrl(tm->GetResourceIcon(i)));\n if (column_name == \"title\")\n return Value::CreateStringValue(tm->GetResourceTitle(i));\n if (column_name == \"profileName\")\n return Value::CreateStringValue(tm->GetResourceProfileName(i));\n if (column_name == \"networkUsage\")\n return Value::CreateStringValue(tm->GetResourceNetworkUsage(i));\n if (column_name == \"networkUsageValue\")\n return Value::CreateDoubleValue(tm->GetNetworkUsage(i));\n if (column_name == \"webCoreImageCacheSize\")\n return Value::CreateStringValue(tm->GetResourceWebCoreImageCacheSize(i));\n if (column_name == \"webCoreImageCacheSizeValue\") {\n WebKit::WebCache::ResourceTypeStats resource_stats;\n tm->GetWebCoreCacheStats(i, &resource_stats);\n return Value::CreateDoubleValue(resource_stats.images.size);\n }\n if (column_name == \"webCoreScriptsCacheSize\")\n return Value::CreateStringValue(tm->GetResourceWebCoreScriptsCacheSize(i));\n if (column_name == \"webCoreScriptsCacheSizeValue\") {\n WebKit::WebCache::ResourceTypeStats resource_stats;\n tm->GetWebCoreCacheStats(i, &resource_stats);\n return Value::CreateDoubleValue(resource_stats.scripts.size);\n }\n if (column_name == \"webCoreCSSCacheSize\")\n return Value::CreateStringValue(tm->GetResourceWebCoreCSSCacheSize(i));\n if (column_name == \"webCoreCSSCacheSizeValue\") {\n WebKit::WebCache::ResourceTypeStats resource_stats;\n tm->GetWebCoreCacheStats(i, &resource_stats);\n return Value::CreateDoubleValue(resource_stats.cssStyleSheets.size);\n }\n if (column_name == \"fps\")\n return Value::CreateStringValue(tm->GetResourceFPS(i));\n if (column_name == \"fpsValue\") {\n float fps;\n tm->GetFPS(i, &fps);\n return Value::CreateDoubleValue(fps);\n }\n if (column_name == \"sqliteMemoryUsed\")\n return Value::CreateStringValue(tm->GetResourceSqliteMemoryUsed(i));\n if (column_name == \"sqliteMemoryUsedValue\") {\n size_t sqlite_memory;\n tm->GetSqliteMemoryUsedBytes(i, &sqlite_memory);\n return Value::CreateDoubleValue(sqlite_memory);\n }\n if (column_name == \"goatsTeleported\")\n return Value::CreateStringValue(tm->GetResourceGoatsTeleported(i));\n if (column_name == \"goatsTeleportedValue\")\n return Value::CreateIntegerValue(tm->GetGoatsTeleported(i));\n if (column_name == \"v8MemoryAllocatedSize\")\n return Value::CreateStringValue(tm->GetResourceV8MemoryAllocatedSize(i));\n if (column_name == \"v8MemoryAllocatedSizeValue\") {\n size_t v8_memory;\n tm->GetV8Memory(i, &v8_memory);\n return Value::CreateDoubleValue(v8_memory);\n }\n if (column_name == \"canInspect\")\n return Value::CreateBooleanValue(tm->CanInspect(i));\n if (column_name == \"canActivate\")\n return Value::CreateBooleanValue(tm->CanActivate(i));\n\n NOTREACHED();\n return NULL;\n}\n\nvoid CreateGroupColumnList(const TaskManagerModel* tm,\n const std::string& column_name,\n const int index,\n const int length,\n DictionaryValue* val) {\n ListValue* list = new ListValue();\n for (int i = index; i < (index + length); ++i) {\n list->Append(CreateColumnValue(tm, column_name, i));\n }\n val->Set(column_name, list);\n}\n\nstruct ColumnType {\n const char* column_id;\n \/\/ Whether the column has the real value separately or not, instead of the\n \/\/ formatted value to display.\n const bool has_real_value;\n \/\/ Whether the column has single datum or multiple data in each group.\n const bool has_multiple_data;\n};\n\nconst ColumnType kColumnsList[] = {\n {\"type\", false, false},\n {\"processId\", true, false},\n {\"cpuUsage\", true, false},\n {\"physicalMemory\", true, false},\n {\"sharedMemory\", true, false},\n {\"privateMemory\", true, false},\n {\"webCoreImageCacheSize\", true, false},\n {\"webCoreImageCacheSize\", true, false},\n {\"webCoreScriptsCacheSize\", true, false},\n {\"webCoreCSSCacheSize\", true, false},\n {\"sqliteMemoryUsed\", true, false},\n {\"v8MemoryAllocatedSize\", true, false},\n {\"icon\", false, true},\n {\"title\", false, true},\n {\"profileName\", false, true},\n {\"networkUsage\", true, true},\n {\"fps\", true, true},\n {\"goatsTeleported\", true, true},\n {\"canInspect\", false, true},\n {\"canActivate\", false, true}\n};\n\nDictionaryValue* CreateTaskGroupValue(\n const TaskManagerModel* tm,\n const int group_index,\n const std::set<std::string>& columns) {\n DictionaryValue* val = new DictionaryValue();\n\n const int group_count = tm->GroupCount();\n if (group_index >= group_count)\n return val;\n\n int index = tm->GetResourceIndexForGroup(group_index, 0);\n int length = tm->GetGroupRangeForResource(index).second;\n\n \/\/ Forces to set following 3 columns regardless of |enable_columns|.\n val->SetInteger(\"index\", index);\n val->SetBoolean(\"isBackgroundResource\",\n tm->IsBackgroundResource(index));\n CreateGroupColumnList(tm, \"uniqueId\", index, length, val);\n CreateGroupColumnList(tm, \"processId\", index, 1, val);\n\n for (size_t i = 0; i < arraysize(kColumnsList); ++i) {\n const std::string column_id = kColumnsList[i].column_id;\n\n if (columns.find(column_id) == columns.end())\n continue;\n\n int column_length = kColumnsList[i].has_multiple_data ? length : 1;\n CreateGroupColumnList(tm, column_id, index, column_length, val);\n\n if (kColumnsList[i].has_real_value)\n CreateGroupColumnList(tm, column_id + \"Value\", index, column_length, val);\n }\n\n return val;\n}\n\n} \/\/ namespace\n\nTaskManagerHandler::TaskManagerHandler(TaskManager* tm)\n : task_manager_(tm),\n model_(tm->model()),\n is_enabled_(false) {\n}\n\nTaskManagerHandler::~TaskManagerHandler() {\n DisableTaskManager(NULL);\n}\n\n\/\/ TaskManagerHandler, public: -----------------------------------------------\n\nvoid TaskManagerHandler::OnModelChanged() {\n OnGroupChanged(0, model_->GroupCount());\n}\n\nvoid TaskManagerHandler::OnItemsChanged(const int start, const int length) {\n OnGroupChanged(0, model_->GroupCount());\n}\n\nvoid TaskManagerHandler::OnItemsAdded(const int start, const int length) {\n}\n\nvoid TaskManagerHandler::OnItemsRemoved(const int start, const int length) {\n}\n\nvoid TaskManagerHandler::RegisterMessages() {\n web_ui()->RegisterMessageCallback(\"killProcesses\",\n base::Bind(&TaskManagerHandler::HandleKillProcesses,\n base::Unretained(this)));\n web_ui()->RegisterMessageCallback(\"inspect\",\n base::Bind(&TaskManagerHandler::HandleInspect,\n base::Unretained(this)));\n web_ui()->RegisterMessageCallback(\"activatePage\",\n base::Bind(&TaskManagerHandler::HandleActivatePage,\n base::Unretained(this)));\n web_ui()->RegisterMessageCallback(\"openAboutMemory\",\n base::Bind(&TaskManagerHandler::OpenAboutMemory,\n base::Unretained(this)));\n web_ui()->RegisterMessageCallback(\"enableTaskManager\",\n base::Bind(&TaskManagerHandler::EnableTaskManager,\n base::Unretained(this)));\n web_ui()->RegisterMessageCallback(\"disableTaskManager\",\n base::Bind(&TaskManagerHandler::DisableTaskManager,\n base::Unretained(this)));\n web_ui()->RegisterMessageCallback(\"setUpdateColumn\",\n base::Bind(&TaskManagerHandler::HandleSetUpdateColumn,\n base::Unretained(this)));\n}\n\nstatic int parseIndex(const Value* value) {\n int index = -1;\n string16 string16_index;\n double double_index;\n if (value->GetAsString(&string16_index)) {\n bool converted = base::StringToInt(string16_index, &index);\n DCHECK(converted);\n } else if (value->GetAsDouble(&double_index)) {\n index = static_cast<int>(double_index);\n } else {\n value->GetAsInteger(&index);\n }\n return index;\n}\n\nvoid TaskManagerHandler::HandleKillProcesses(const ListValue* unique_ids) {\n for (ListValue::const_iterator i = unique_ids->begin();\n i != unique_ids->end(); ++i) {\n int unique_id = parseIndex(*i);\n int resource_index = model_->GetResourceIndexByUniqueId(unique_id);\n if (resource_index == -1)\n continue;\n\n task_manager_->KillProcess(resource_index);\n }\n}\n\nvoid TaskManagerHandler::HandleActivatePage(const ListValue* unique_ids) {\n for (ListValue::const_iterator i = unique_ids->begin();\n i != unique_ids->end(); ++i) {\n int unique_id = parseIndex(*i);\n int resource_index = model_->GetResourceIndexByUniqueId(unique_id);\n if (resource_index == -1)\n continue;\n\n task_manager_->ActivateProcess(resource_index);\n break;\n }\n}\n\nvoid TaskManagerHandler::HandleInspect(const ListValue* unique_ids) {\n for (ListValue::const_iterator i = unique_ids->begin();\n i != unique_ids->end(); ++i) {\n int unique_id = parseIndex(*i);\n int resource_index = model_->GetResourceIndexByUniqueId(unique_id);\n if (resource_index == -1)\n continue;\n\n if (model_->CanInspect(resource_index))\n model_->Inspect(resource_index);\n break;\n }\n}\n\nvoid TaskManagerHandler::DisableTaskManager(const ListValue* indexes) {\n if (!is_enabled_)\n return;\n\n is_enabled_ = false;\n model_->StopUpdating();\n model_->RemoveObserver(this);\n}\n\nvoid TaskManagerHandler::EnableTaskManager(const ListValue* indexes) {\n if (is_enabled_)\n return;\n\n is_enabled_ = true;\n\n OnGroupChanged(0, model_->GroupCount());\n\n model_->AddObserver(this);\n model_->StartUpdating();\n\n content::NotificationService::current()->Notify(\n chrome::NOTIFICATION_TASK_MANAGER_WINDOW_READY,\n content::Source<TaskManagerModel>(model_),\n content::NotificationService::NoDetails());\n}\n\nvoid TaskManagerHandler::OpenAboutMemory(const ListValue* indexes) {\n RenderViewHost* rvh = web_ui()->GetWebContents()->GetRenderViewHost();\n if (rvh && rvh->delegate()) {\n WebPreferences webkit_prefs = rvh->delegate()->GetWebkitPrefs();\n webkit_prefs.allow_scripts_to_close_windows = true;\n rvh->UpdateWebkitPreferences(webkit_prefs);\n } else {\n DCHECK(false);\n }\n\n task_manager_->OpenAboutMemory();\n}\n\nvoid TaskManagerHandler::HandleSetUpdateColumn(const ListValue* args) {\n DCHECK_EQ(2U, args->GetSize());\n\n bool ret = true;\n std::string column_id;\n ret &= args->GetString(0, &column_id);\n bool is_enabled;\n ret &= args->GetBoolean(1, &is_enabled);\n DCHECK(ret);\n\n if (is_enabled)\n enabled_columns_.insert(column_id);\n else\n enabled_columns_.erase(column_id);\n}\n\n\/\/ TaskManagerHandler, private: -----------------------------------------------\n\nbool TaskManagerHandler::is_alive() {\n return web_ui()->GetWebContents()->GetRenderViewHost() != NULL;\n}\n\nvoid TaskManagerHandler::OnGroupChanged(const int group_start,\n const int group_length) {\n base::FundamentalValue start_value(group_start);\n base::FundamentalValue length_value(group_length);\n base::ListValue tasks_value;\n\n for (int i = 0; i < group_length; ++i)\n tasks_value.Append(\n CreateTaskGroupValue(model_, group_start + i, enabled_columns_));\n\n if (is_enabled_ && is_alive()) {\n web_ui()->CallJavascriptFunction(\"taskChanged\",\n start_value, length_value, tasks_value);\n }\n}\n\nvoid TaskManagerHandler::OnGroupAdded(const int group_start,\n const int group_length) {\n}\n\nvoid TaskManagerHandler::OnGroupRemoved(const int group_start,\n const int group_length) {\n}\n\nvoid TaskManagerHandler::OnReadyPeriodicalUpdate() {\n}\n<commit_msg>WebUI TaskManager: Make the button \"End process\" grayed on selecting the browser process.<commit_after>\/\/ Copyright (c) 2012 The Chromium Authors. All rights reserved.\n\/\/ Use of this source code is governed by a BSD-style license that can be\n\/\/ found in the LICENSE file.\n\n#include \"chrome\/browser\/ui\/webui\/task_manager_handler.h\"\n\n#include <algorithm>\n#include <functional>\n\n#include \"base\/bind.h\"\n#include \"base\/bind_helpers.h\"\n#include \"base\/string_number_conversions.h\"\n#include \"base\/values.h\"\n#include \"chrome\/browser\/profiles\/profile.h\"\n#include \"chrome\/browser\/task_manager\/task_manager.h\"\n#include \"chrome\/browser\/ui\/webui\/web_ui_util.h\"\n#include \"chrome\/common\/chrome_notification_types.h\"\n#include \"content\/browser\/renderer_host\/render_view_host.h\"\n#include \"content\/public\/browser\/notification_service.h\"\n#include \"content\/public\/browser\/notification_source.h\"\n#include \"content\/public\/browser\/render_view_host_delegate.h\"\n#include \"content\/public\/browser\/web_contents.h\"\n#include \"content\/public\/browser\/web_ui.h\"\n#include \"third_party\/skia\/include\/core\/SkBitmap.h\"\n#include \"webkit\/glue\/webpreferences.h\"\n\nnamespace {\n\nValue* CreateColumnValue(const TaskManagerModel* tm,\n const std::string& column_name,\n const int i) {\n if (column_name == \"uniqueId\")\n return Value::CreateIntegerValue(tm->GetResourceUniqueId(i));\n if (column_name == \"type\")\n return Value::CreateStringValue(\n TaskManager::Resource::GetResourceTypeAsString(\n tm->GetResourceType(i)));\n if (column_name == \"processId\")\n return Value::CreateStringValue(tm->GetResourceProcessId(i));\n if (column_name == \"processIdValue\")\n return Value::CreateIntegerValue(tm->GetProcessId(i));\n if (column_name == \"cpuUsage\")\n return Value::CreateStringValue(tm->GetResourceCPUUsage(i));\n if (column_name == \"cpuUsageValue\")\n return Value::CreateDoubleValue(tm->GetCPUUsage(i));\n if (column_name == \"privateMemory\")\n return Value::CreateStringValue(tm->GetResourcePrivateMemory(i));\n if (column_name == \"privateMemoryValue\") {\n size_t private_memory;\n tm->GetPrivateMemory(i, &private_memory);\n return Value::CreateDoubleValue(private_memory);\n }\n if (column_name == \"sharedMemory\")\n return Value::CreateStringValue(tm->GetResourceSharedMemory(i));\n if (column_name == \"sharedMemoryValue\") {\n size_t shared_memory;\n tm->GetSharedMemory(i, &shared_memory);\n return Value::CreateDoubleValue(shared_memory);\n }\n if (column_name == \"physicalMemory\")\n return Value::CreateStringValue(tm->GetResourcePhysicalMemory(i));\n if (column_name == \"physicalMemoryValue\") {\n size_t physical_memory;\n tm->GetPhysicalMemory(i, &physical_memory);\n return Value::CreateDoubleValue(physical_memory);\n }\n if (column_name == \"icon\")\n return Value::CreateStringValue(\n web_ui_util::GetImageDataUrl(tm->GetResourceIcon(i)));\n if (column_name == \"title\")\n return Value::CreateStringValue(tm->GetResourceTitle(i));\n if (column_name == \"profileName\")\n return Value::CreateStringValue(tm->GetResourceProfileName(i));\n if (column_name == \"networkUsage\")\n return Value::CreateStringValue(tm->GetResourceNetworkUsage(i));\n if (column_name == \"networkUsageValue\")\n return Value::CreateDoubleValue(tm->GetNetworkUsage(i));\n if (column_name == \"webCoreImageCacheSize\")\n return Value::CreateStringValue(tm->GetResourceWebCoreImageCacheSize(i));\n if (column_name == \"webCoreImageCacheSizeValue\") {\n WebKit::WebCache::ResourceTypeStats resource_stats;\n tm->GetWebCoreCacheStats(i, &resource_stats);\n return Value::CreateDoubleValue(resource_stats.images.size);\n }\n if (column_name == \"webCoreScriptsCacheSize\")\n return Value::CreateStringValue(tm->GetResourceWebCoreScriptsCacheSize(i));\n if (column_name == \"webCoreScriptsCacheSizeValue\") {\n WebKit::WebCache::ResourceTypeStats resource_stats;\n tm->GetWebCoreCacheStats(i, &resource_stats);\n return Value::CreateDoubleValue(resource_stats.scripts.size);\n }\n if (column_name == \"webCoreCSSCacheSize\")\n return Value::CreateStringValue(tm->GetResourceWebCoreCSSCacheSize(i));\n if (column_name == \"webCoreCSSCacheSizeValue\") {\n WebKit::WebCache::ResourceTypeStats resource_stats;\n tm->GetWebCoreCacheStats(i, &resource_stats);\n return Value::CreateDoubleValue(resource_stats.cssStyleSheets.size);\n }\n if (column_name == \"fps\")\n return Value::CreateStringValue(tm->GetResourceFPS(i));\n if (column_name == \"fpsValue\") {\n float fps;\n tm->GetFPS(i, &fps);\n return Value::CreateDoubleValue(fps);\n }\n if (column_name == \"sqliteMemoryUsed\")\n return Value::CreateStringValue(tm->GetResourceSqliteMemoryUsed(i));\n if (column_name == \"sqliteMemoryUsedValue\") {\n size_t sqlite_memory;\n tm->GetSqliteMemoryUsedBytes(i, &sqlite_memory);\n return Value::CreateDoubleValue(sqlite_memory);\n }\n if (column_name == \"goatsTeleported\")\n return Value::CreateStringValue(tm->GetResourceGoatsTeleported(i));\n if (column_name == \"goatsTeleportedValue\")\n return Value::CreateIntegerValue(tm->GetGoatsTeleported(i));\n if (column_name == \"v8MemoryAllocatedSize\")\n return Value::CreateStringValue(tm->GetResourceV8MemoryAllocatedSize(i));\n if (column_name == \"v8MemoryAllocatedSizeValue\") {\n size_t v8_memory;\n tm->GetV8Memory(i, &v8_memory);\n return Value::CreateDoubleValue(v8_memory);\n }\n if (column_name == \"canInspect\")\n return Value::CreateBooleanValue(tm->CanInspect(i));\n if (column_name == \"canActivate\")\n return Value::CreateBooleanValue(tm->CanActivate(i));\n\n NOTREACHED();\n return NULL;\n}\n\nvoid CreateGroupColumnList(const TaskManagerModel* tm,\n const std::string& column_name,\n const int index,\n const int length,\n DictionaryValue* val) {\n ListValue* list = new ListValue();\n for (int i = index; i < (index + length); ++i) {\n list->Append(CreateColumnValue(tm, column_name, i));\n }\n val->Set(column_name, list);\n}\n\nstruct ColumnType {\n const char* column_id;\n \/\/ Whether the column has the real value separately or not, instead of the\n \/\/ formatted value to display.\n const bool has_real_value;\n \/\/ Whether the column has single datum or multiple data in each group.\n const bool has_multiple_data;\n};\n\nconst ColumnType kColumnsList[] = {\n {\"type\", false, false},\n {\"processId\", true, false},\n {\"cpuUsage\", true, false},\n {\"physicalMemory\", true, false},\n {\"sharedMemory\", true, false},\n {\"privateMemory\", true, false},\n {\"webCoreImageCacheSize\", true, false},\n {\"webCoreImageCacheSize\", true, false},\n {\"webCoreScriptsCacheSize\", true, false},\n {\"webCoreCSSCacheSize\", true, false},\n {\"sqliteMemoryUsed\", true, false},\n {\"v8MemoryAllocatedSize\", true, false},\n {\"icon\", false, true},\n {\"title\", false, true},\n {\"profileName\", false, true},\n {\"networkUsage\", true, true},\n {\"fps\", true, true},\n {\"goatsTeleported\", true, true},\n {\"canInspect\", false, true},\n {\"canActivate\", false, true}\n};\n\nDictionaryValue* CreateTaskGroupValue(\n const TaskManagerModel* tm,\n const int group_index,\n const std::set<std::string>& columns) {\n DictionaryValue* val = new DictionaryValue();\n\n const int group_count = tm->GroupCount();\n if (group_index >= group_count)\n return val;\n\n int index = tm->GetResourceIndexForGroup(group_index, 0);\n int length = tm->GetGroupRangeForResource(index).second;\n\n \/\/ Forces to set following 3 columns regardless of |enable_columns|.\n val->SetInteger(\"index\", index);\n val->SetBoolean(\"isBackgroundResource\",\n tm->IsBackgroundResource(index));\n CreateGroupColumnList(tm, \"processId\", index, 1, val);\n CreateGroupColumnList(tm, \"type\", index, length, val);\n CreateGroupColumnList(tm, \"uniqueId\", index, length, val);\n\n for (size_t i = 0; i < arraysize(kColumnsList); ++i) {\n const std::string column_id = kColumnsList[i].column_id;\n\n if (columns.find(column_id) == columns.end())\n continue;\n\n int column_length = kColumnsList[i].has_multiple_data ? length : 1;\n CreateGroupColumnList(tm, column_id, index, column_length, val);\n\n if (kColumnsList[i].has_real_value)\n CreateGroupColumnList(tm, column_id + \"Value\", index, column_length, val);\n }\n\n return val;\n}\n\n} \/\/ namespace\n\nTaskManagerHandler::TaskManagerHandler(TaskManager* tm)\n : task_manager_(tm),\n model_(tm->model()),\n is_enabled_(false) {\n}\n\nTaskManagerHandler::~TaskManagerHandler() {\n DisableTaskManager(NULL);\n}\n\n\/\/ TaskManagerHandler, public: -----------------------------------------------\n\nvoid TaskManagerHandler::OnModelChanged() {\n OnGroupChanged(0, model_->GroupCount());\n}\n\nvoid TaskManagerHandler::OnItemsChanged(const int start, const int length) {\n OnGroupChanged(0, model_->GroupCount());\n}\n\nvoid TaskManagerHandler::OnItemsAdded(const int start, const int length) {\n}\n\nvoid TaskManagerHandler::OnItemsRemoved(const int start, const int length) {\n}\n\nvoid TaskManagerHandler::RegisterMessages() {\n web_ui()->RegisterMessageCallback(\"killProcesses\",\n base::Bind(&TaskManagerHandler::HandleKillProcesses,\n base::Unretained(this)));\n web_ui()->RegisterMessageCallback(\"inspect\",\n base::Bind(&TaskManagerHandler::HandleInspect,\n base::Unretained(this)));\n web_ui()->RegisterMessageCallback(\"activatePage\",\n base::Bind(&TaskManagerHandler::HandleActivatePage,\n base::Unretained(this)));\n web_ui()->RegisterMessageCallback(\"openAboutMemory\",\n base::Bind(&TaskManagerHandler::OpenAboutMemory,\n base::Unretained(this)));\n web_ui()->RegisterMessageCallback(\"enableTaskManager\",\n base::Bind(&TaskManagerHandler::EnableTaskManager,\n base::Unretained(this)));\n web_ui()->RegisterMessageCallback(\"disableTaskManager\",\n base::Bind(&TaskManagerHandler::DisableTaskManager,\n base::Unretained(this)));\n web_ui()->RegisterMessageCallback(\"setUpdateColumn\",\n base::Bind(&TaskManagerHandler::HandleSetUpdateColumn,\n base::Unretained(this)));\n}\n\nstatic int parseIndex(const Value* value) {\n int index = -1;\n string16 string16_index;\n double double_index;\n if (value->GetAsString(&string16_index)) {\n bool converted = base::StringToInt(string16_index, &index);\n DCHECK(converted);\n } else if (value->GetAsDouble(&double_index)) {\n index = static_cast<int>(double_index);\n } else {\n value->GetAsInteger(&index);\n }\n return index;\n}\n\nvoid TaskManagerHandler::HandleKillProcesses(const ListValue* unique_ids) {\n for (ListValue::const_iterator i = unique_ids->begin();\n i != unique_ids->end(); ++i) {\n int unique_id = parseIndex(*i);\n int resource_index = model_->GetResourceIndexByUniqueId(unique_id);\n if (resource_index == -1)\n continue;\n\n task_manager_->KillProcess(resource_index);\n }\n}\n\nvoid TaskManagerHandler::HandleActivatePage(const ListValue* unique_ids) {\n for (ListValue::const_iterator i = unique_ids->begin();\n i != unique_ids->end(); ++i) {\n int unique_id = parseIndex(*i);\n int resource_index = model_->GetResourceIndexByUniqueId(unique_id);\n if (resource_index == -1)\n continue;\n\n task_manager_->ActivateProcess(resource_index);\n break;\n }\n}\n\nvoid TaskManagerHandler::HandleInspect(const ListValue* unique_ids) {\n for (ListValue::const_iterator i = unique_ids->begin();\n i != unique_ids->end(); ++i) {\n int unique_id = parseIndex(*i);\n int resource_index = model_->GetResourceIndexByUniqueId(unique_id);\n if (resource_index == -1)\n continue;\n\n if (model_->CanInspect(resource_index))\n model_->Inspect(resource_index);\n break;\n }\n}\n\nvoid TaskManagerHandler::DisableTaskManager(const ListValue* indexes) {\n if (!is_enabled_)\n return;\n\n is_enabled_ = false;\n model_->StopUpdating();\n model_->RemoveObserver(this);\n}\n\nvoid TaskManagerHandler::EnableTaskManager(const ListValue* indexes) {\n if (is_enabled_)\n return;\n\n is_enabled_ = true;\n\n OnGroupChanged(0, model_->GroupCount());\n\n model_->AddObserver(this);\n model_->StartUpdating();\n\n content::NotificationService::current()->Notify(\n chrome::NOTIFICATION_TASK_MANAGER_WINDOW_READY,\n content::Source<TaskManagerModel>(model_),\n content::NotificationService::NoDetails());\n}\n\nvoid TaskManagerHandler::OpenAboutMemory(const ListValue* indexes) {\n RenderViewHost* rvh = web_ui()->GetWebContents()->GetRenderViewHost();\n if (rvh && rvh->delegate()) {\n WebPreferences webkit_prefs = rvh->delegate()->GetWebkitPrefs();\n webkit_prefs.allow_scripts_to_close_windows = true;\n rvh->UpdateWebkitPreferences(webkit_prefs);\n } else {\n DCHECK(false);\n }\n\n task_manager_->OpenAboutMemory();\n}\n\nvoid TaskManagerHandler::HandleSetUpdateColumn(const ListValue* args) {\n DCHECK_EQ(2U, args->GetSize());\n\n bool ret = true;\n std::string column_id;\n ret &= args->GetString(0, &column_id);\n bool is_enabled;\n ret &= args->GetBoolean(1, &is_enabled);\n DCHECK(ret);\n\n if (is_enabled)\n enabled_columns_.insert(column_id);\n else\n enabled_columns_.erase(column_id);\n}\n\n\/\/ TaskManagerHandler, private: -----------------------------------------------\n\nbool TaskManagerHandler::is_alive() {\n return web_ui()->GetWebContents()->GetRenderViewHost() != NULL;\n}\n\nvoid TaskManagerHandler::OnGroupChanged(const int group_start,\n const int group_length) {\n base::FundamentalValue start_value(group_start);\n base::FundamentalValue length_value(group_length);\n base::ListValue tasks_value;\n\n for (int i = 0; i < group_length; ++i)\n tasks_value.Append(\n CreateTaskGroupValue(model_, group_start + i, enabled_columns_));\n\n if (is_enabled_ && is_alive()) {\n web_ui()->CallJavascriptFunction(\"taskChanged\",\n start_value, length_value, tasks_value);\n }\n}\n\nvoid TaskManagerHandler::OnGroupAdded(const int group_start,\n const int group_length) {\n}\n\nvoid TaskManagerHandler::OnGroupRemoved(const int group_start,\n const int group_length) {\n}\n\nvoid TaskManagerHandler::OnReadyPeriodicalUpdate() {\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 \"chromeos\/network\/network_device_handler_impl.h\"\n\n#include \"base\/bind.h\"\n#include \"base\/location.h\"\n#include \"base\/values.h\"\n#include \"chromeos\/dbus\/dbus_thread_manager.h\"\n#include \"chromeos\/dbus\/shill_device_client.h\"\n#include \"chromeos\/dbus\/shill_ipconfig_client.h\"\n#include \"chromeos\/network\/device_state.h\"\n#include \"chromeos\/network\/network_event_log.h\"\n#include \"chromeos\/network\/network_handler_callbacks.h\"\n#include \"chromeos\/network\/network_state_handler.h\"\n#include \"chromeos\/network\/shill_property_util.h\"\n#include \"dbus\/object_path.h\"\n#include \"third_party\/cros_system_api\/dbus\/service_constants.h\"\n\nnamespace chromeos {\n\nnamespace {\n\n\/\/ TODO(armansito): Add bindings for these to service_constants.h\n\/\/ (crbug.com\/256889)\nconst char kShillErrorFailure[] = \"org.chromium.flimflam.Error.Failure\";\nconst char kShillErrorNotSupported[] =\n \"org.chromium.flimflam.Error.NotSupported\";\n\nstd::string GetErrorNameForShillError(const std::string& shill_error_name) {\n \/\/ TODO(armansito): Use the new SIM error names once the ones below get\n \/\/ deprecated (crbug.com\/256855)\n if (shill_error_name == kShillErrorFailure)\n return NetworkDeviceHandler::kErrorFailure;\n if (shill_error_name == kShillErrorNotSupported)\n return NetworkDeviceHandler::kErrorNotSupported;\n if (shill_error_name == shill::kErrorIncorrectPinMsg)\n return NetworkDeviceHandler::kErrorIncorrectPin;\n if (shill_error_name == shill::kErrorPinBlockedMsg)\n return NetworkDeviceHandler::kErrorPinBlocked;\n if (shill_error_name == shill::kErrorPinRequiredMsg)\n return NetworkDeviceHandler::kErrorPinRequired;\n return NetworkDeviceHandler::kErrorUnknown;\n}\n\nvoid InvokeErrorCallback(const std::string& service_path,\n const network_handler::ErrorCallback& error_callback,\n const std::string& error_name) {\n std::string error_msg = \"Device Error: \" + error_name;\n NET_LOG_ERROR(error_msg, service_path);\n network_handler::RunErrorCallback(\n error_callback, service_path, error_name, error_msg);\n}\n\nvoid HandleShillCallFailure(\n const std::string& device_path,\n const network_handler::ErrorCallback& error_callback,\n const std::string& shill_error_name,\n const std::string& shill_error_message) {\n network_handler::ShillErrorCallbackFunction(\n GetErrorNameForShillError(shill_error_name),\n device_path,\n error_callback,\n shill_error_name,\n shill_error_message);\n}\n\nvoid IPConfigRefreshCallback(const std::string& ipconfig_path,\n DBusMethodCallStatus call_status) {\n if (call_status != DBUS_METHOD_CALL_SUCCESS) {\n NET_LOG_ERROR(\n base::StringPrintf(\"IPConfigs.Refresh Failed: %d\", call_status),\n ipconfig_path);\n } else {\n NET_LOG_EVENT(\"IPConfigs.Refresh Succeeded\", ipconfig_path);\n }\n}\n\nvoid RefreshIPConfigsCallback(\n const base::Closure& callback,\n const network_handler::ErrorCallback& error_callback,\n const std::string& device_path,\n const base::DictionaryValue& properties) {\n const base::ListValue* ip_configs;\n if (!properties.GetListWithoutPathExpansion(\n shill::kIPConfigsProperty, &ip_configs)) {\n NET_LOG_ERROR(\"RequestRefreshIPConfigs Failed\", device_path);\n network_handler::ShillErrorCallbackFunction(\n \"RequestRefreshIPConfigs Failed\",\n device_path,\n error_callback,\n std::string(\"Missing \") + shill::kIPConfigsProperty, \"\");\n return;\n }\n\n for (size_t i = 0; i < ip_configs->GetSize(); i++) {\n std::string ipconfig_path;\n if (!ip_configs->GetString(i, &ipconfig_path))\n continue;\n DBusThreadManager::Get()->GetShillIPConfigClient()->Refresh(\n dbus::ObjectPath(ipconfig_path),\n base::Bind(&IPConfigRefreshCallback, ipconfig_path));\n }\n \/\/ It is safe to invoke |callback| here instead of waiting for the\n \/\/ IPConfig.Refresh callbacks to complete because the Refresh DBus calls will\n \/\/ be executed in order and thus before any further DBus requests that\n \/\/ |callback| may issue.\n if (!callback.is_null())\n callback.Run();\n}\n\nvoid ProposeScanCallback(\n const std::string& device_path,\n const base::Closure& callback,\n const network_handler::ErrorCallback& error_callback,\n DBusMethodCallStatus call_status) {\n if (call_status != DBUS_METHOD_CALL_SUCCESS) {\n network_handler::ShillErrorCallbackFunction(\n \"Device.ProposeScan Failed\",\n device_path,\n error_callback,\n base::StringPrintf(\"DBus call failed: %d\", call_status), \"\");\n return;\n }\n NET_LOG_EVENT(\"Device.ProposeScan succeeded.\", device_path);\n if (!callback.is_null())\n callback.Run();\n}\n\nvoid SetDevicePropertyInternal(\n const std::string& device_path,\n const std::string& property_name,\n const base::Value& value,\n const base::Closure& callback,\n const network_handler::ErrorCallback& error_callback) {\n DBusThreadManager::Get()->GetShillDeviceClient()->SetProperty(\n dbus::ObjectPath(device_path),\n property_name,\n value,\n callback,\n base::Bind(&HandleShillCallFailure, device_path, error_callback));\n}\n\n} \/\/ namespace\n\nNetworkDeviceHandlerImpl::~NetworkDeviceHandlerImpl() {\n network_state_handler_->RemoveObserver(this, FROM_HERE);\n}\n\nvoid NetworkDeviceHandlerImpl::GetDeviceProperties(\n const std::string& device_path,\n const network_handler::DictionaryResultCallback& callback,\n const network_handler::ErrorCallback& error_callback) const {\n DBusThreadManager::Get()->GetShillDeviceClient()->GetProperties(\n dbus::ObjectPath(device_path),\n base::Bind(&network_handler::GetPropertiesCallback,\n callback, error_callback, device_path));\n}\n\nvoid NetworkDeviceHandlerImpl::SetDeviceProperty(\n const std::string& device_path,\n const std::string& property_name,\n const base::Value& value,\n const base::Closure& callback,\n const network_handler::ErrorCallback& error_callback) {\n const char* const property_blacklist[] = {\n \/\/ Must only be changed by policy\/owner through.\n shill::kCellularAllowRoamingProperty\n };\n\n for (size_t i = 0; i < arraysize(property_blacklist); ++i) {\n if (property_name == property_blacklist[i]) {\n InvokeErrorCallback(\n device_path,\n error_callback,\n \"SetDeviceProperty called on blacklisted property \" + property_name);\n return;\n }\n }\n\n SetDevicePropertyInternal(\n device_path, property_name, value, callback, error_callback);\n}\n\nvoid NetworkDeviceHandlerImpl::RequestRefreshIPConfigs(\n const std::string& device_path,\n const base::Closure& callback,\n const network_handler::ErrorCallback& error_callback) {\n GetDeviceProperties(device_path,\n base::Bind(&RefreshIPConfigsCallback,\n callback, error_callback),\n error_callback);\n}\n\nvoid NetworkDeviceHandlerImpl::ProposeScan(\n const std::string& device_path,\n const base::Closure& callback,\n const network_handler::ErrorCallback& error_callback) {\n DBusThreadManager::Get()->GetShillDeviceClient()->ProposeScan(\n dbus::ObjectPath(device_path),\n base::Bind(&ProposeScanCallback, device_path, callback, error_callback));\n}\n\nvoid NetworkDeviceHandlerImpl::RegisterCellularNetwork(\n const std::string& device_path,\n const std::string& network_id,\n const base::Closure& callback,\n const network_handler::ErrorCallback& error_callback) {\n DBusThreadManager::Get()->GetShillDeviceClient()->Register(\n dbus::ObjectPath(device_path),\n network_id,\n callback,\n base::Bind(&HandleShillCallFailure, device_path, error_callback));\n}\n\nvoid NetworkDeviceHandlerImpl::SetCarrier(\n const std::string& device_path,\n const std::string& carrier,\n const base::Closure& callback,\n const network_handler::ErrorCallback& error_callback) {\n DBusThreadManager::Get()->GetShillDeviceClient()->SetCarrier(\n dbus::ObjectPath(device_path),\n carrier,\n callback,\n base::Bind(&HandleShillCallFailure, device_path, error_callback));\n}\n\nvoid NetworkDeviceHandlerImpl::RequirePin(\n const std::string& device_path,\n bool require_pin,\n const std::string& pin,\n const base::Closure& callback,\n const network_handler::ErrorCallback& error_callback) {\n DBusThreadManager::Get()->GetShillDeviceClient()->RequirePin(\n dbus::ObjectPath(device_path),\n pin,\n require_pin,\n callback,\n base::Bind(&HandleShillCallFailure, device_path, error_callback));\n}\n\nvoid NetworkDeviceHandlerImpl::EnterPin(\n const std::string& device_path,\n const std::string& pin,\n const base::Closure& callback,\n const network_handler::ErrorCallback& error_callback) {\n DBusThreadManager::Get()->GetShillDeviceClient()->EnterPin(\n dbus::ObjectPath(device_path),\n pin,\n callback,\n base::Bind(&HandleShillCallFailure, device_path, error_callback));\n}\n\nvoid NetworkDeviceHandlerImpl::UnblockPin(\n const std::string& device_path,\n const std::string& puk,\n const std::string& new_pin,\n const base::Closure& callback,\n const network_handler::ErrorCallback& error_callback) {\n DBusThreadManager::Get()->GetShillDeviceClient()->UnblockPin(\n dbus::ObjectPath(device_path),\n puk,\n new_pin,\n callback,\n base::Bind(&HandleShillCallFailure, device_path, error_callback));\n}\n\nvoid NetworkDeviceHandlerImpl::ChangePin(\n const std::string& device_path,\n const std::string& old_pin,\n const std::string& new_pin,\n const base::Closure& callback,\n const network_handler::ErrorCallback& error_callback) {\n DBusThreadManager::Get()->GetShillDeviceClient()->ChangePin(\n dbus::ObjectPath(device_path),\n old_pin,\n new_pin,\n callback,\n base::Bind(&HandleShillCallFailure, device_path, error_callback));\n}\n\nvoid NetworkDeviceHandlerImpl::SetCellularAllowRoaming(\n const bool allow_roaming) {\n cellular_allow_roaming_ = allow_roaming;\n ApplyCellularAllowRoamingToShill();\n}\n\nvoid NetworkDeviceHandlerImpl::DeviceListChanged() {\n ApplyCellularAllowRoamingToShill();\n}\n\nNetworkDeviceHandlerImpl::NetworkDeviceHandlerImpl()\n : network_state_handler_(NULL),\n cellular_allow_roaming_(false) {}\n\nvoid NetworkDeviceHandlerImpl::Init(\n NetworkStateHandler* network_state_handler) {\n DCHECK(network_state_handler);\n network_state_handler_ = network_state_handler;\n network_state_handler_->AddObserver(this, FROM_HERE);\n}\n\nvoid NetworkDeviceHandlerImpl::ApplyCellularAllowRoamingToShill() {\n NetworkStateHandler::DeviceStateList list;\n network_state_handler_->GetDeviceListByType(NetworkTypePattern::Cellular(),\n &list);\n if (list.empty()) {\n NET_LOG_DEBUG(\"No cellular device is available\",\n \"Roaming is only supported by cellular devices.\");\n return;\n }\n for (NetworkStateHandler::DeviceStateList::const_iterator it = list.begin();\n it != list.end(); ++it) {\n const DeviceState* device_state = *it;\n bool current_device_value;\n if (!device_state->properties().GetBooleanWithoutPathExpansion(\n shill::kCellularAllowRoamingProperty, ¤t_device_value)) {\n NET_LOG_ERROR(\n \"Could not get \\\"allow roaming\\\" property from cellular \"\n \"device.\",\n device_state->path());\n continue;\n }\n\n \/\/ If roaming is required by the provider, always try to set to true.\n bool new_device_value =\n device_state->provider_requires_roaming() || cellular_allow_roaming_;\n\n \/\/ Only set the value if the current value is different from\n \/\/ |new_device_value|.\n if (new_device_value == current_device_value)\n continue;\n\n SetDevicePropertyInternal(device_state->path(),\n shill::kCellularAllowRoamingProperty,\n base::FundamentalValue(new_device_value),\n base::Bind(&base::DoNothing),\n network_handler::ErrorCallback());\n }\n}\n\n} \/\/ namespace chromeos\n<commit_msg>Use shill::kErrorResult* constants.<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 \"chromeos\/network\/network_device_handler_impl.h\"\n\n#include \"base\/bind.h\"\n#include \"base\/location.h\"\n#include \"base\/values.h\"\n#include \"chromeos\/dbus\/dbus_thread_manager.h\"\n#include \"chromeos\/dbus\/shill_device_client.h\"\n#include \"chromeos\/dbus\/shill_ipconfig_client.h\"\n#include \"chromeos\/network\/device_state.h\"\n#include \"chromeos\/network\/network_event_log.h\"\n#include \"chromeos\/network\/network_handler_callbacks.h\"\n#include \"chromeos\/network\/network_state_handler.h\"\n#include \"chromeos\/network\/shill_property_util.h\"\n#include \"dbus\/object_path.h\"\n#include \"third_party\/cros_system_api\/dbus\/service_constants.h\"\n\nnamespace chromeos {\n\nnamespace {\n\nstd::string GetErrorNameForShillError(const std::string& shill_error_name) {\n if (shill_error_name == shill::kErrorResultFailure)\n return NetworkDeviceHandler::kErrorFailure;\n if (shill_error_name == shill::kErrorResultNotSupported)\n return NetworkDeviceHandler::kErrorNotSupported;\n if (shill_error_name == shill::kErrorResultIncorrectPin)\n return NetworkDeviceHandler::kErrorIncorrectPin;\n if (shill_error_name == shill::kErrorResultPinBlocked)\n return NetworkDeviceHandler::kErrorPinBlocked;\n if (shill_error_name == shill::kErrorResultPinRequired)\n return NetworkDeviceHandler::kErrorPinRequired;\n return NetworkDeviceHandler::kErrorUnknown;\n}\n\nvoid InvokeErrorCallback(const std::string& service_path,\n const network_handler::ErrorCallback& error_callback,\n const std::string& error_name) {\n std::string error_msg = \"Device Error: \" + error_name;\n NET_LOG_ERROR(error_msg, service_path);\n network_handler::RunErrorCallback(\n error_callback, service_path, error_name, error_msg);\n}\n\nvoid HandleShillCallFailure(\n const std::string& device_path,\n const network_handler::ErrorCallback& error_callback,\n const std::string& shill_error_name,\n const std::string& shill_error_message) {\n network_handler::ShillErrorCallbackFunction(\n GetErrorNameForShillError(shill_error_name),\n device_path,\n error_callback,\n shill_error_name,\n shill_error_message);\n}\n\nvoid IPConfigRefreshCallback(const std::string& ipconfig_path,\n DBusMethodCallStatus call_status) {\n if (call_status != DBUS_METHOD_CALL_SUCCESS) {\n NET_LOG_ERROR(\n base::StringPrintf(\"IPConfigs.Refresh Failed: %d\", call_status),\n ipconfig_path);\n } else {\n NET_LOG_EVENT(\"IPConfigs.Refresh Succeeded\", ipconfig_path);\n }\n}\n\nvoid RefreshIPConfigsCallback(\n const base::Closure& callback,\n const network_handler::ErrorCallback& error_callback,\n const std::string& device_path,\n const base::DictionaryValue& properties) {\n const base::ListValue* ip_configs;\n if (!properties.GetListWithoutPathExpansion(\n shill::kIPConfigsProperty, &ip_configs)) {\n NET_LOG_ERROR(\"RequestRefreshIPConfigs Failed\", device_path);\n network_handler::ShillErrorCallbackFunction(\n \"RequestRefreshIPConfigs Failed\",\n device_path,\n error_callback,\n std::string(\"Missing \") + shill::kIPConfigsProperty, \"\");\n return;\n }\n\n for (size_t i = 0; i < ip_configs->GetSize(); i++) {\n std::string ipconfig_path;\n if (!ip_configs->GetString(i, &ipconfig_path))\n continue;\n DBusThreadManager::Get()->GetShillIPConfigClient()->Refresh(\n dbus::ObjectPath(ipconfig_path),\n base::Bind(&IPConfigRefreshCallback, ipconfig_path));\n }\n \/\/ It is safe to invoke |callback| here instead of waiting for the\n \/\/ IPConfig.Refresh callbacks to complete because the Refresh DBus calls will\n \/\/ be executed in order and thus before any further DBus requests that\n \/\/ |callback| may issue.\n if (!callback.is_null())\n callback.Run();\n}\n\nvoid ProposeScanCallback(\n const std::string& device_path,\n const base::Closure& callback,\n const network_handler::ErrorCallback& error_callback,\n DBusMethodCallStatus call_status) {\n if (call_status != DBUS_METHOD_CALL_SUCCESS) {\n network_handler::ShillErrorCallbackFunction(\n \"Device.ProposeScan Failed\",\n device_path,\n error_callback,\n base::StringPrintf(\"DBus call failed: %d\", call_status), \"\");\n return;\n }\n NET_LOG_EVENT(\"Device.ProposeScan succeeded.\", device_path);\n if (!callback.is_null())\n callback.Run();\n}\n\nvoid SetDevicePropertyInternal(\n const std::string& device_path,\n const std::string& property_name,\n const base::Value& value,\n const base::Closure& callback,\n const network_handler::ErrorCallback& error_callback) {\n DBusThreadManager::Get()->GetShillDeviceClient()->SetProperty(\n dbus::ObjectPath(device_path),\n property_name,\n value,\n callback,\n base::Bind(&HandleShillCallFailure, device_path, error_callback));\n}\n\n} \/\/ namespace\n\nNetworkDeviceHandlerImpl::~NetworkDeviceHandlerImpl() {\n network_state_handler_->RemoveObserver(this, FROM_HERE);\n}\n\nvoid NetworkDeviceHandlerImpl::GetDeviceProperties(\n const std::string& device_path,\n const network_handler::DictionaryResultCallback& callback,\n const network_handler::ErrorCallback& error_callback) const {\n DBusThreadManager::Get()->GetShillDeviceClient()->GetProperties(\n dbus::ObjectPath(device_path),\n base::Bind(&network_handler::GetPropertiesCallback,\n callback, error_callback, device_path));\n}\n\nvoid NetworkDeviceHandlerImpl::SetDeviceProperty(\n const std::string& device_path,\n const std::string& property_name,\n const base::Value& value,\n const base::Closure& callback,\n const network_handler::ErrorCallback& error_callback) {\n const char* const property_blacklist[] = {\n \/\/ Must only be changed by policy\/owner through.\n shill::kCellularAllowRoamingProperty\n };\n\n for (size_t i = 0; i < arraysize(property_blacklist); ++i) {\n if (property_name == property_blacklist[i]) {\n InvokeErrorCallback(\n device_path,\n error_callback,\n \"SetDeviceProperty called on blacklisted property \" + property_name);\n return;\n }\n }\n\n SetDevicePropertyInternal(\n device_path, property_name, value, callback, error_callback);\n}\n\nvoid NetworkDeviceHandlerImpl::RequestRefreshIPConfigs(\n const std::string& device_path,\n const base::Closure& callback,\n const network_handler::ErrorCallback& error_callback) {\n GetDeviceProperties(device_path,\n base::Bind(&RefreshIPConfigsCallback,\n callback, error_callback),\n error_callback);\n}\n\nvoid NetworkDeviceHandlerImpl::ProposeScan(\n const std::string& device_path,\n const base::Closure& callback,\n const network_handler::ErrorCallback& error_callback) {\n DBusThreadManager::Get()->GetShillDeviceClient()->ProposeScan(\n dbus::ObjectPath(device_path),\n base::Bind(&ProposeScanCallback, device_path, callback, error_callback));\n}\n\nvoid NetworkDeviceHandlerImpl::RegisterCellularNetwork(\n const std::string& device_path,\n const std::string& network_id,\n const base::Closure& callback,\n const network_handler::ErrorCallback& error_callback) {\n DBusThreadManager::Get()->GetShillDeviceClient()->Register(\n dbus::ObjectPath(device_path),\n network_id,\n callback,\n base::Bind(&HandleShillCallFailure, device_path, error_callback));\n}\n\nvoid NetworkDeviceHandlerImpl::SetCarrier(\n const std::string& device_path,\n const std::string& carrier,\n const base::Closure& callback,\n const network_handler::ErrorCallback& error_callback) {\n DBusThreadManager::Get()->GetShillDeviceClient()->SetCarrier(\n dbus::ObjectPath(device_path),\n carrier,\n callback,\n base::Bind(&HandleShillCallFailure, device_path, error_callback));\n}\n\nvoid NetworkDeviceHandlerImpl::RequirePin(\n const std::string& device_path,\n bool require_pin,\n const std::string& pin,\n const base::Closure& callback,\n const network_handler::ErrorCallback& error_callback) {\n DBusThreadManager::Get()->GetShillDeviceClient()->RequirePin(\n dbus::ObjectPath(device_path),\n pin,\n require_pin,\n callback,\n base::Bind(&HandleShillCallFailure, device_path, error_callback));\n}\n\nvoid NetworkDeviceHandlerImpl::EnterPin(\n const std::string& device_path,\n const std::string& pin,\n const base::Closure& callback,\n const network_handler::ErrorCallback& error_callback) {\n DBusThreadManager::Get()->GetShillDeviceClient()->EnterPin(\n dbus::ObjectPath(device_path),\n pin,\n callback,\n base::Bind(&HandleShillCallFailure, device_path, error_callback));\n}\n\nvoid NetworkDeviceHandlerImpl::UnblockPin(\n const std::string& device_path,\n const std::string& puk,\n const std::string& new_pin,\n const base::Closure& callback,\n const network_handler::ErrorCallback& error_callback) {\n DBusThreadManager::Get()->GetShillDeviceClient()->UnblockPin(\n dbus::ObjectPath(device_path),\n puk,\n new_pin,\n callback,\n base::Bind(&HandleShillCallFailure, device_path, error_callback));\n}\n\nvoid NetworkDeviceHandlerImpl::ChangePin(\n const std::string& device_path,\n const std::string& old_pin,\n const std::string& new_pin,\n const base::Closure& callback,\n const network_handler::ErrorCallback& error_callback) {\n DBusThreadManager::Get()->GetShillDeviceClient()->ChangePin(\n dbus::ObjectPath(device_path),\n old_pin,\n new_pin,\n callback,\n base::Bind(&HandleShillCallFailure, device_path, error_callback));\n}\n\nvoid NetworkDeviceHandlerImpl::SetCellularAllowRoaming(\n const bool allow_roaming) {\n cellular_allow_roaming_ = allow_roaming;\n ApplyCellularAllowRoamingToShill();\n}\n\nvoid NetworkDeviceHandlerImpl::DeviceListChanged() {\n ApplyCellularAllowRoamingToShill();\n}\n\nNetworkDeviceHandlerImpl::NetworkDeviceHandlerImpl()\n : network_state_handler_(NULL),\n cellular_allow_roaming_(false) {}\n\nvoid NetworkDeviceHandlerImpl::Init(\n NetworkStateHandler* network_state_handler) {\n DCHECK(network_state_handler);\n network_state_handler_ = network_state_handler;\n network_state_handler_->AddObserver(this, FROM_HERE);\n}\n\nvoid NetworkDeviceHandlerImpl::ApplyCellularAllowRoamingToShill() {\n NetworkStateHandler::DeviceStateList list;\n network_state_handler_->GetDeviceListByType(NetworkTypePattern::Cellular(),\n &list);\n if (list.empty()) {\n NET_LOG_DEBUG(\"No cellular device is available\",\n \"Roaming is only supported by cellular devices.\");\n return;\n }\n for (NetworkStateHandler::DeviceStateList::const_iterator it = list.begin();\n it != list.end(); ++it) {\n const DeviceState* device_state = *it;\n bool current_device_value;\n if (!device_state->properties().GetBooleanWithoutPathExpansion(\n shill::kCellularAllowRoamingProperty, ¤t_device_value)) {\n NET_LOG_ERROR(\n \"Could not get \\\"allow roaming\\\" property from cellular \"\n \"device.\",\n device_state->path());\n continue;\n }\n\n \/\/ If roaming is required by the provider, always try to set to true.\n bool new_device_value =\n device_state->provider_requires_roaming() || cellular_allow_roaming_;\n\n \/\/ Only set the value if the current value is different from\n \/\/ |new_device_value|.\n if (new_device_value == current_device_value)\n continue;\n\n SetDevicePropertyInternal(device_state->path(),\n shill::kCellularAllowRoamingProperty,\n base::FundamentalValue(new_device_value),\n base::Bind(&base::DoNothing),\n network_handler::ErrorCallback());\n }\n}\n\n} \/\/ namespace chromeos\n<|endoftext|>"} {"text":"<commit_before>#include <mex.h>\n\n#include <cmath>\n#include <iostream>\n#include \"drake\/systems\/plants\/RigidBodyTree.h\"\n#include \"drake\/util\/drakeMexUtil.h\"\n#include \"drake\/util\/eigen_matrix_compare.h\"\n#include \"drake\/util\/testUtil.h\"\n\nusing namespace Eigen;\nusing namespace std;\nusing drake::util::MatrixCompareType;\n\n\/*\n * compares C++ robots generated via the matlab constructModelmex with the same\n * robot generated via the c++ parser\n *\/\n\nvoid mexFunction(int nlhs, mxArray *plhs[], int nrhs, const mxArray *prhs[]) {\n if (nrhs < 1) {\n mexErrMsgIdAndTxt(\n \"Drake:compareParsersmex:NotEnoughInputs\",\n \"Usage compareParsersmex(model_ptr, urdf_file, floating_base_type)\");\n }\n\n \/\/ first get the model_ptr back from matlab\n RigidBodyTree *matlab_model = (RigidBodyTree *)getDrakeMexPointer(prhs[0]);\n\n char urdf_file[1000];\n mxGetString(prhs[1], urdf_file, 1000);\n char floating_base_type_str[100] = \"rpy\";\n if (nrhs > 2) mxGetString(prhs[2], floating_base_type_str, 100);\n DrakeJoint::FloatingBaseType floating_base_type = DrakeJoint::QUATERNION;\n if (strcmp(floating_base_type_str, \"fixed\") == 0)\n floating_base_type = DrakeJoint::FIXED;\n else if (strcmp(floating_base_type_str, \"rpy\") == 0)\n floating_base_type = DrakeJoint::ROLLPITCHYAW;\n else if (strcmp(floating_base_type_str, \"quat\") == 0)\n floating_base_type = DrakeJoint::QUATERNION;\n else\n mexErrMsgIdAndTxt(\n \"Drake:compareParsersmex:BadInputs\",\n \"Unknown floating base type. must be 'fixed', 'rpy', or 'quat'\");\n\n RigidBodyTree *cpp_model = new RigidBodyTree(urdf_file, floating_base_type);\n\n \/\/ Compute coordinate transform between the two models (in case they are not\n \/\/ identical)\n MatrixXd P = MatrixXd::Zero(cpp_model->num_positions,\n matlab_model->num_positions); \/\/ projection from\n \/\/ the coordinates\n \/\/ of matlab_model\n \/\/ to cpp_model\n for (int i = 0; i < cpp_model->bodies.size(); i++) {\n if (cpp_model->bodies[i]->hasParent() &&\n cpp_model->bodies[i]->getJoint().getNumPositions() > 0) {\n RigidBody *b =\n matlab_model->findJoint(cpp_model->bodies[i]->getJoint().getName());\n if (b == nullptr) continue;\n for (int j = 0; j < b->getJoint().getNumPositions(); j++) {\n P(cpp_model->bodies[i]->position_num_start + j,\n b->position_num_start + j) = 1.0;\n }\n }\n }\n if (!P.isApprox(MatrixXd::Identity(matlab_model->num_positions,\n matlab_model->num_positions))) {\n cout << \"P = \\n\" << P << endl;\n mexErrMsgTxt(\"ERROR: coordinates don't match\");\n }\n\n std::default_random_engine generator; \/\/ note: gets the same seed every time,\n \/\/ would have to seed it manually\n std::normal_distribution<double> distribution(0.0, 1.0);\n for (int trial = 0; trial < 1; trial++) {\n \/\/ generate random q\n VectorXd matlab_q = matlab_model->getRandomConfiguration(generator);\n VectorXd cpp_q(cpp_model->num_positions);\n cpp_q.noalias() = P * matlab_q;\n\n if ((matlab_model->num_positions != matlab_model->num_velocities) ||\n (cpp_model->num_positions != cpp_model->num_velocities)) {\n mexErrMsgTxt(\n \"ERROR: num_positions!=num_velocities have to generate another P for \"\n \"this case\");\n }\n\n \/\/ generate random v\n VectorXd matlab_v(matlab_model->num_velocities),\n cpp_v(cpp_model->num_velocities);\n for (int i = 0; i < matlab_model->num_velocities; i++)\n matlab_v[i] = distribution(generator);\n cpp_v.noalias() = P * matlab_v;\n\n \/\/ run kinematics\n KinematicsCache<double> matlab_cache =\n matlab_model->doKinematics(matlab_q, matlab_v, true);\n KinematicsCache<double> cpp_cache =\n cpp_model->doKinematics(cpp_q, cpp_v, true);\n\n { \/\/ compare H, C, and B\n eigen_aligned_unordered_map<RigidBody const *,\n Matrix<double, TWIST_SIZE, 1> > f_ext;\n\n auto matlab_H = matlab_model->massMatrix(matlab_cache);\n auto cpp_H = cpp_model->massMatrix(cpp_cache);\n\n std::string explanation;\n if (!CompareMatrices(matlab_H, cpp_H, 1e-8, MatrixCompareType::absolute,\n &explanation)) {\n throw std::runtime_error(\n \"Drake: CompareParserMex: ERROR: H doesn't match: \" + explanation);\n }\n\n auto matlab_C = matlab_model->dynamicsBiasTerm(matlab_cache, f_ext);\n auto cpp_C = cpp_model->dynamicsBiasTerm(cpp_cache, f_ext);\n\n if (!CompareMatrices(matlab_C, cpp_C, 1e-8, MatrixCompareType::absolute,\n &explanation)) {\n throw std::runtime_error(\n \"Drake: CompareParserMex: ERROR: C doesn't match: \" + explanation);\n }\n\n if (!CompareMatrices(matlab_model->B, cpp_model->B, 1e-8,\n MatrixCompareType::absolute, &explanation)) {\n throw std::runtime_error(\n \"Drake: CompareParserMex: ERROR: B doesn't match: \" + explanation);\n }\n }\n\n { \/\/ compare joint limits\n std::string explanation;\n if (!CompareMatrices(matlab_model->joint_limit_min,\n cpp_model->joint_limit_min, 1e-8,\n MatrixCompareType::absolute, &explanation)) {\n throw std::runtime_error(\n \"Drake: CompareParserMex: ERROR: joint_limit_min doesn't match: \" +\n explanation);\n }\n\n if (!CompareMatrices(matlab_model->joint_limit_max,\n cpp_model->joint_limit_max, 1e-8,\n MatrixCompareType::absolute, &explanation)) {\n throw std::runtime_error(\n \"Drake: CompareParserMex: ERROR: joint_limit_max doesn't match: \" +\n explanation);\n }\n }\n\n { \/\/ compare position constraints\n auto matlab_phi = matlab_model->positionConstraints(matlab_cache);\n auto cpp_phi = cpp_model->positionConstraints(cpp_cache);\n\n std::string explanation;\n if (!CompareMatrices(matlab_phi, cpp_phi, 1e-8,\n MatrixCompareType::absolute, &explanation)) {\n throw std::runtime_error(\n \"Drake: CompareParserMex: ERROR: phi doesn't match doesn't \"\n \"match: \" +\n explanation);\n }\n\n auto matlab_dphi =\n matlab_model->positionConstraintsJacobian(matlab_cache);\n auto cpp_dphi = cpp_model->positionConstraintsJacobian(cpp_cache);\n if (!CompareMatrices(matlab_dphi, cpp_dphi, 1e-8,\n MatrixCompareType::absolute, &explanation)) {\n throw std::runtime_error(\n \"Drake: CompareParserMex: ERROR: dphi doesn't match: \" +\n explanation);\n }\n }\n }\n\n delete cpp_model;\n}\n<commit_msg>clang-format on drake\/systems\/plants\/test\/compareParsersmex.cpp<commit_after>#include <mex.h>\n\n#include <cmath>\n#include <iostream>\n#include \"drake\/systems\/plants\/RigidBodyTree.h\"\n#include \"drake\/util\/drakeMexUtil.h\"\n#include \"drake\/util\/eigen_matrix_compare.h\"\n#include \"drake\/util\/testUtil.h\"\n\nusing namespace Eigen;\nusing namespace std;\nusing drake::util::MatrixCompareType;\n\n\/*\n * compares C++ robots generated via the matlab constructModelmex with the same\n * robot generated via the c++ parser\n *\/\n\nvoid mexFunction(int nlhs, mxArray* plhs[], int nrhs, const mxArray* prhs[]) {\n if (nrhs < 1) {\n mexErrMsgIdAndTxt(\n \"Drake:compareParsersmex:NotEnoughInputs\",\n \"Usage compareParsersmex(model_ptr, urdf_file, floating_base_type)\");\n }\n\n \/\/ first get the model_ptr back from matlab\n RigidBodyTree* matlab_model = (RigidBodyTree*)getDrakeMexPointer(prhs[0]);\n\n char urdf_file[1000];\n mxGetString(prhs[1], urdf_file, 1000);\n char floating_base_type_str[100] = \"rpy\";\n if (nrhs > 2) mxGetString(prhs[2], floating_base_type_str, 100);\n DrakeJoint::FloatingBaseType floating_base_type = DrakeJoint::QUATERNION;\n if (strcmp(floating_base_type_str, \"fixed\") == 0)\n floating_base_type = DrakeJoint::FIXED;\n else if (strcmp(floating_base_type_str, \"rpy\") == 0)\n floating_base_type = DrakeJoint::ROLLPITCHYAW;\n else if (strcmp(floating_base_type_str, \"quat\") == 0)\n floating_base_type = DrakeJoint::QUATERNION;\n else\n mexErrMsgIdAndTxt(\n \"Drake:compareParsersmex:BadInputs\",\n \"Unknown floating base type. must be 'fixed', 'rpy', or 'quat'\");\n\n RigidBodyTree* cpp_model = new RigidBodyTree(urdf_file, floating_base_type);\n\n \/\/ Compute coordinate transform between the two models (in case they are not\n \/\/ identical)\n MatrixXd P = MatrixXd::Zero(cpp_model->num_positions,\n matlab_model->num_positions); \/\/ projection from\n \/\/ the coordinates\n \/\/ of matlab_model\n \/\/ to cpp_model\n for (int i = 0; i < cpp_model->bodies.size(); i++) {\n if (cpp_model->bodies[i]->hasParent() &&\n cpp_model->bodies[i]->getJoint().getNumPositions() > 0) {\n RigidBody* b =\n matlab_model->findJoint(cpp_model->bodies[i]->getJoint().getName());\n if (b == nullptr) continue;\n for (int j = 0; j < b->getJoint().getNumPositions(); j++) {\n P(cpp_model->bodies[i]->position_num_start + j,\n b->position_num_start + j) = 1.0;\n }\n }\n }\n if (!P.isApprox(MatrixXd::Identity(matlab_model->num_positions,\n matlab_model->num_positions))) {\n cout << \"P = \\n\" << P << endl;\n mexErrMsgTxt(\"ERROR: coordinates don't match\");\n }\n\n std::default_random_engine generator; \/\/ note: gets the same seed every time,\n \/\/ would have to seed it manually\n std::normal_distribution<double> distribution(0.0, 1.0);\n for (int trial = 0; trial < 1; trial++) {\n \/\/ generate random q\n VectorXd matlab_q = matlab_model->getRandomConfiguration(generator);\n VectorXd cpp_q(cpp_model->num_positions);\n cpp_q.noalias() = P * matlab_q;\n\n if ((matlab_model->num_positions != matlab_model->num_velocities) ||\n (cpp_model->num_positions != cpp_model->num_velocities)) {\n mexErrMsgTxt(\n \"ERROR: num_positions!=num_velocities have to generate another P for \"\n \"this case\");\n }\n\n \/\/ generate random v\n VectorXd matlab_v(matlab_model->num_velocities),\n cpp_v(cpp_model->num_velocities);\n for (int i = 0; i < matlab_model->num_velocities; i++)\n matlab_v[i] = distribution(generator);\n cpp_v.noalias() = P * matlab_v;\n\n \/\/ run kinematics\n KinematicsCache<double> matlab_cache =\n matlab_model->doKinematics(matlab_q, matlab_v, true);\n KinematicsCache<double> cpp_cache =\n cpp_model->doKinematics(cpp_q, cpp_v, true);\n\n { \/\/ compare H, C, and B\n eigen_aligned_unordered_map<RigidBody const*,\n Matrix<double, TWIST_SIZE, 1>> f_ext;\n\n auto matlab_H = matlab_model->massMatrix(matlab_cache);\n auto cpp_H = cpp_model->massMatrix(cpp_cache);\n\n std::string explanation;\n if (!CompareMatrices(matlab_H, cpp_H, 1e-8, MatrixCompareType::absolute,\n &explanation)) {\n throw std::runtime_error(\n \"Drake: CompareParserMex: ERROR: H doesn't match: \" + explanation);\n }\n\n auto matlab_C = matlab_model->dynamicsBiasTerm(matlab_cache, f_ext);\n auto cpp_C = cpp_model->dynamicsBiasTerm(cpp_cache, f_ext);\n\n if (!CompareMatrices(matlab_C, cpp_C, 1e-8, MatrixCompareType::absolute,\n &explanation)) {\n throw std::runtime_error(\n \"Drake: CompareParserMex: ERROR: C doesn't match: \" + explanation);\n }\n\n if (!CompareMatrices(matlab_model->B, cpp_model->B, 1e-8,\n MatrixCompareType::absolute, &explanation)) {\n throw std::runtime_error(\n \"Drake: CompareParserMex: ERROR: B doesn't match: \" + explanation);\n }\n }\n\n { \/\/ compare joint limits\n std::string explanation;\n if (!CompareMatrices(matlab_model->joint_limit_min,\n cpp_model->joint_limit_min, 1e-8,\n MatrixCompareType::absolute, &explanation)) {\n throw std::runtime_error(\n \"Drake: CompareParserMex: ERROR: joint_limit_min doesn't match: \" +\n explanation);\n }\n\n if (!CompareMatrices(matlab_model->joint_limit_max,\n cpp_model->joint_limit_max, 1e-8,\n MatrixCompareType::absolute, &explanation)) {\n throw std::runtime_error(\n \"Drake: CompareParserMex: ERROR: joint_limit_max doesn't match: \" +\n explanation);\n }\n }\n\n { \/\/ compare position constraints\n auto matlab_phi = matlab_model->positionConstraints(matlab_cache);\n auto cpp_phi = cpp_model->positionConstraints(cpp_cache);\n\n std::string explanation;\n if (!CompareMatrices(matlab_phi, cpp_phi, 1e-8,\n MatrixCompareType::absolute, &explanation)) {\n throw std::runtime_error(\n \"Drake: CompareParserMex: ERROR: phi doesn't match doesn't \"\n \"match: \" +\n explanation);\n }\n\n auto matlab_dphi =\n matlab_model->positionConstraintsJacobian(matlab_cache);\n auto cpp_dphi = cpp_model->positionConstraintsJacobian(cpp_cache);\n if (!CompareMatrices(matlab_dphi, cpp_dphi, 1e-8,\n MatrixCompareType::absolute, &explanation)) {\n throw std::runtime_error(\n \"Drake: CompareParserMex: ERROR: dphi doesn't match: \" +\n explanation);\n }\n }\n }\n\n delete cpp_model;\n}\n<|endoftext|>"} {"text":"<commit_before><commit_msg>show the control geometric propertis correctly (bnc#610921)<commit_after><|endoftext|>"} {"text":"<commit_before>\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\n\/\/ Copyright 2015 Realm Inc.\n\/\/\n\/\/ Licensed under the Apache License, Version 2.0 (the \"License\");\n\/\/ you may not use this file except in compliance with the License.\n\/\/ You may obtain a copy of the License at\n\/\/\n\/\/ http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n\/\/\n\/\/ Unless required by applicable law or agreed to in writing, software\n\/\/ distributed under the License is distributed on an \"AS IS\" BASIS,\n\/\/ WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n\/\/ See the License for the specific language governing permissions and\n\/\/ limitations under the License.\n\/\/\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n#include \"parser.hpp\"\n\n#include <iostream>\n\n#include <pegtl.hh>\n#include <pegtl\/analyze.hh>\n#include <pegtl\/trace.hh>\n\nusing namespace pegtl;\n\nnamespace realm {\nnamespace parser {\n\n\/\/ strings\nstruct unicode : list< seq< one< 'u' >, rep< 4, must< xdigit > > >, one< '\\\\' > > {};\nstruct escaped_char : one< '\"', '\\'', '\\\\', '\/', 'b', 'f', 'n', 'r', 't', '0' > {};\nstruct escaped : sor< escaped_char, unicode > {};\nstruct unescaped : utf8::range< 0x20, 0x10FFFF > {};\nstruct chars : if_then_else< one< '\\\\' >, must< escaped >, unescaped > {};\nstruct dq_string_content : until< at< one< '\"' > >, must< chars > > {};\nstruct dq_string : seq< one< '\"' >, must< dq_string_content >, any > {};\n\nstruct sq_string_content : until< at< one< '\\'' > >, must< chars > > {};\nstruct sq_string : seq< one< '\\'' >, must< sq_string_content >, any > {};\n\n\/\/ numbers\nstruct minus : opt< one< '-' > > {};\nstruct dot : one< '.' > {};\n\nstruct float_num : sor<\n seq< plus< digit >, dot, star< digit > >,\n seq< star< digit >, dot, plus< digit > >\n> {};\nstruct hex_num : seq< one< '0' >, one< 'x', 'X' >, plus< xdigit > > {};\nstruct int_num : plus< digit > {};\n\nstruct number : seq< minus, sor< float_num, hex_num, int_num > > {};\n\nstruct true_value : pegtl_istring_t(\"true\") {};\nstruct false_value : pegtl_istring_t(\"false\") {};\n\n\/\/ key paths\nstruct key_path : list< seq< sor< alpha, one< '_' > >, star< sor< alnum, one< '_', '-' > > > >, one< '.' > > {};\n\n\/\/ argument\nstruct argument_index : plus< digit > {};\nstruct argument : seq< one< '$' >, must< argument_index > > {};\n\n\/\/ expressions and operators\nstruct expr : sor< dq_string, sq_string, number, argument, true_value, false_value, key_path > {};\n\nstruct eq : sor< two< '=' >, one< '=' > > {};\nstruct noteq : pegtl::string< '!', '=' > {};\nstruct lteq : pegtl::string< '<', '=' > {};\nstruct lt : one< '<' > {};\nstruct gteq : pegtl::string< '>', '=' > {};\nstruct gt : one< '>' > {};\nstruct contains : pegtl_istring_t(\"contains\") {};\nstruct begins : pegtl_istring_t(\"beginswith\") {};\nstruct ends : pegtl_istring_t(\"endswith\") {};\n\ntemplate<typename A, typename B>\nstruct pad_plus : seq< plus< B >, A, plus< B > > {};\n\nstruct padded_oper : pad_plus< sor< contains, begins, ends >, blank > {};\nstruct symbolic_oper : pad< sor< eq, noteq, lteq, lt, gteq, gt >, blank > {};\n\n\/\/ predicates\nstruct comparison_pred : seq< expr, sor< padded_oper, symbolic_oper >, expr > {};\n\nstruct pred;\nstruct group_pred : if_must< one< '(' >, pad< pred, blank >, one< ')' > > {};\nstruct true_pred : pegtl_istring_t(\"truepredicate\") {};\nstruct false_pred : pegtl_istring_t(\"falsepredicate\") {};\n\nstruct not_pre : seq< sor< one< '!' >, pegtl_istring_t(\"not\") > > {};\nstruct atom_pred : seq< opt< not_pre >, pad< sor< group_pred, true_pred, false_pred, comparison_pred >, blank > > {};\n\nstruct and_op : pad< sor< two< '&' >, pegtl_istring_t(\"and\") >, blank > {};\nstruct or_op : pad< sor< two< '|' >, pegtl_istring_t(\"or\") >, blank > {};\n\nstruct or_ext : if_must< or_op, pred > {};\nstruct and_ext : if_must< and_op, pred > {};\nstruct and_pred : seq< atom_pred, star< and_ext > > {};\n\nstruct pred : seq< and_pred, star< or_ext > > {};\n\n\/\/ state\nstruct ParserState\n{\n std::vector<Predicate *> predicate_stack;\n Predicate ¤t() {\n return *predicate_stack.back();\n }\n\n bool negate_next = false;\n\n void addExpression(Expression && exp)\n {\n if (current().type == Predicate::Type::Comparison) {\n current().cmpr.expr[1] = std::move(exp);\n predicate_stack.pop_back();\n }\n else {\n Predicate p(Predicate::Type::Comparison);\n p.cmpr.expr[0] = std::move(exp);\n if (negate_next) {\n p.negate = true;\n negate_next = false;\n }\n current().cpnd.sub_predicates.emplace_back(std::move(p));\n predicate_stack.push_back(¤t().cpnd.sub_predicates.back());\n }\n }\n};\n\n\/\/ rules\ntemplate< typename Rule >\nstruct action : nothing< Rule > {};\n\n#ifdef REALM_PARSER_PRINT_TOKENS\n #define DEBUG_PRINT_TOKEN(string) std::cout << string << std::endl\n#else\n #define DEBUG_PRINT_TOKEN(string)\n#endif\n\ntemplate<> struct action< and_ext >\n{\n static void apply( const input & in, ParserState & state )\n {\n DEBUG_PRINT_TOKEN(\"<and>\");\n\n \/\/ if we were put into an OR group we need to rearrange\n auto ¤t = state.current();\n if (current.type == Predicate::Type::Or) {\n auto &sub_preds = current.cpnd.sub_predicates;\n auto &second_last = sub_preds[sub_preds.size()-2];\n if (second_last.type == Predicate::Type::And) {\n \/\/ if we are in an OR group and second to last predicate group is\n \/\/ an AND group then move the last predicate inside\n second_last.cpnd.sub_predicates.push_back(std::move(sub_preds.back()));\n sub_preds.pop_back();\n }\n else {\n \/\/ otherwise combine last two into a new AND group\n Predicate pred(Predicate::Type::And);\n pred.cpnd.sub_predicates.emplace_back(std::move(second_last));\n pred.cpnd.sub_predicates.emplace_back(std::move(sub_preds.back()));\n sub_preds.pop_back();\n sub_preds.pop_back();\n sub_preds.push_back(std::move(pred));\n }\n }\n }\n};\n\ntemplate<> struct action< or_ext >\n{\n static void apply( const input & in, ParserState & state )\n {\n DEBUG_PRINT_TOKEN(\"<or>\");\n\n \/\/ if already an OR group do nothing\n auto ¤t = state.current();\n if (current.type == Predicate::Type::Or) {\n return;\n }\n\n \/\/ if only two predicates in the group, then convert to OR\n auto &sub_preds = state.current().cpnd.sub_predicates;\n if (sub_preds.size()) {\n current.type = Predicate::Type::Or;\n return;\n }\n\n \/\/ split the current group into to groups which are ORed together\n Predicate pred1(Predicate::Type::And), pred2(Predicate::Type::And);\n pred1.cpnd.sub_predicates.insert(sub_preds.begin(), sub_preds.back());\n pred2.cpnd.sub_predicates.push_back(std::move(sub_preds.back()));\n\n current.type = Predicate::Type::Or;\n sub_preds.clear();\n sub_preds.emplace_back(std::move(pred1));\n sub_preds.emplace_back(std::move(pred2));\n }\n};\n\n\n#define EXPRESSION_ACTION(rule, type) \\\ntemplate<> struct action< rule > { \\\n static void apply( const input & in, ParserState & state ) { \\\n DEBUG_PRINT_TOKEN(in.string()); \\\n state.addExpression(Expression(type, in.string())); }};\n\nEXPRESSION_ACTION(dq_string_content, Expression::Type::String)\nEXPRESSION_ACTION(sq_string_content, Expression::Type::String)\nEXPRESSION_ACTION(key_path, Expression::Type::KeyPath)\nEXPRESSION_ACTION(number, Expression::Type::Number)\nEXPRESSION_ACTION(true_value, Expression::Type::True)\nEXPRESSION_ACTION(false_value, Expression::Type::False)\nEXPRESSION_ACTION(argument_index, Expression::Type::Argument)\n\n\ntemplate<> struct action< true_pred >\n{\n static void apply( const input & in, ParserState & state )\n {\n DEBUG_PRINT_TOKEN(in.string());\n state.current().cpnd.sub_predicates.emplace_back(Predicate::Type::True);\n }\n};\n\ntemplate<> struct action< false_pred >\n{\n static void apply( const input & in, ParserState & state )\n {\n DEBUG_PRINT_TOKEN(in.string());\n state.current().cpnd.sub_predicates.emplace_back(Predicate::Type::False);\n }\n};\n\n#define OPERATOR_ACTION(rule, oper) \\\ntemplate<> struct action< rule > { \\\n static void apply( const input & in, ParserState & state ) { \\\n DEBUG_PRINT_TOKEN(in.string()); \\\n state.current().cmpr.op = oper; }};\n\nOPERATOR_ACTION(eq, Predicate::Operator::Equal)\nOPERATOR_ACTION(noteq, Predicate::Operator::NotEqual)\nOPERATOR_ACTION(gteq, Predicate::Operator::GreaterThanOrEqual)\nOPERATOR_ACTION(gt, Predicate::Operator::GreaterThan)\nOPERATOR_ACTION(lteq, Predicate::Operator::LessThanOrEqual)\nOPERATOR_ACTION(lt, Predicate::Operator::LessThan)\nOPERATOR_ACTION(begins, Predicate::Operator::BeginsWith)\nOPERATOR_ACTION(ends, Predicate::Operator::EndsWith)\nOPERATOR_ACTION(contains, Predicate::Operator::Contains)\n\ntemplate<> struct action< one< '(' > >\n{\n static void apply( const input & in, ParserState & state )\n {\n DEBUG_PRINT_TOKEN(\"<begin_group>\");\n\n Predicate group(Predicate::Type::And);\n if (state.negate_next) {\n group.negate = true;\n state.negate_next = false;\n }\n\n state.current().cpnd.sub_predicates.emplace_back(std::move(group));\n state.predicate_stack.push_back(&state.current().cpnd.sub_predicates.back());\n }\n};\n\ntemplate<> struct action< group_pred >\n{\n static void apply( const input & in, ParserState & state )\n {\n DEBUG_PRINT_TOKEN(\"<end_group>\");\n state.predicate_stack.pop_back();\n }\n};\n\ntemplate<> struct action< not_pre >\n{\n static void apply( const input & in, ParserState & state )\n {\n DEBUG_PRINT_TOKEN(\"<not>\");\n state.negate_next = true;\n }\n};\n\ntemplate< typename Rule >\nstruct error_message_control : pegtl::normal< Rule >\n{\n static const std::string error_message;\n\n template< typename Input, typename ... States >\n static void raise( const Input & in, States && ... )\n {\n throw pegtl::parse_error( error_message, in );\n }\n};\n\ntemplate<>\nconst std::string error_message_control< chars >::error_message = \"Invalid characters in string constant.\";\n\ntemplate< typename Rule>\nconst std::string error_message_control< Rule >::error_message = \"Invalid predicate.\";\n\nPredicate parse(const std::string &query)\n{\n Predicate out_predicate(Predicate::Type::And);\n\n ParserState state;\n state.predicate_stack.push_back(&out_predicate);\n\n pegtl::parse< must< pred, eof >, action, error_message_control >(query, query, state);\n if (out_predicate.type == Predicate::Type::And && out_predicate.cpnd.sub_predicates.size() == 1) {\n return std::move(out_predicate.cpnd.sub_predicates.back());\n }\n return std::move(out_predicate);\n}\n\nvoid analyzeGrammar()\n{\n analyze<pred>();\n}\n\n}}\n\n\n<commit_msg>fix for mixed && and || queries<commit_after>\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\n\/\/ Copyright 2015 Realm Inc.\n\/\/\n\/\/ Licensed under the Apache License, Version 2.0 (the \"License\");\n\/\/ you may not use this file except in compliance with the License.\n\/\/ You may obtain a copy of the License at\n\/\/\n\/\/ http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n\/\/\n\/\/ Unless required by applicable law or agreed to in writing, software\n\/\/ distributed under the License is distributed on an \"AS IS\" BASIS,\n\/\/ WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n\/\/ See the License for the specific language governing permissions and\n\/\/ limitations under the License.\n\/\/\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n#include \"parser.hpp\"\n\n#include <iostream>\n\n#include <pegtl.hh>\n#include <pegtl\/analyze.hh>\n#include <pegtl\/trace.hh>\n\nusing namespace pegtl;\n\nnamespace realm {\nnamespace parser {\n\n\/\/ strings\nstruct unicode : list< seq< one< 'u' >, rep< 4, must< xdigit > > >, one< '\\\\' > > {};\nstruct escaped_char : one< '\"', '\\'', '\\\\', '\/', 'b', 'f', 'n', 'r', 't', '0' > {};\nstruct escaped : sor< escaped_char, unicode > {};\nstruct unescaped : utf8::range< 0x20, 0x10FFFF > {};\nstruct chars : if_then_else< one< '\\\\' >, must< escaped >, unescaped > {};\nstruct dq_string_content : until< at< one< '\"' > >, must< chars > > {};\nstruct dq_string : seq< one< '\"' >, must< dq_string_content >, any > {};\n\nstruct sq_string_content : until< at< one< '\\'' > >, must< chars > > {};\nstruct sq_string : seq< one< '\\'' >, must< sq_string_content >, any > {};\n\n\/\/ numbers\nstruct minus : opt< one< '-' > > {};\nstruct dot : one< '.' > {};\n\nstruct float_num : sor<\n seq< plus< digit >, dot, star< digit > >,\n seq< star< digit >, dot, plus< digit > >\n> {};\nstruct hex_num : seq< one< '0' >, one< 'x', 'X' >, plus< xdigit > > {};\nstruct int_num : plus< digit > {};\n\nstruct number : seq< minus, sor< float_num, hex_num, int_num > > {};\n\nstruct true_value : pegtl_istring_t(\"true\") {};\nstruct false_value : pegtl_istring_t(\"false\") {};\n\n\/\/ key paths\nstruct key_path : list< seq< sor< alpha, one< '_' > >, star< sor< alnum, one< '_', '-' > > > >, one< '.' > > {};\n\n\/\/ argument\nstruct argument_index : plus< digit > {};\nstruct argument : seq< one< '$' >, must< argument_index > > {};\n\n\/\/ expressions and operators\nstruct expr : sor< dq_string, sq_string, number, argument, true_value, false_value, key_path > {};\n\nstruct eq : sor< two< '=' >, one< '=' > > {};\nstruct noteq : pegtl::string< '!', '=' > {};\nstruct lteq : pegtl::string< '<', '=' > {};\nstruct lt : one< '<' > {};\nstruct gteq : pegtl::string< '>', '=' > {};\nstruct gt : one< '>' > {};\nstruct contains : pegtl_istring_t(\"contains\") {};\nstruct begins : pegtl_istring_t(\"beginswith\") {};\nstruct ends : pegtl_istring_t(\"endswith\") {};\n\ntemplate<typename A, typename B>\nstruct pad_plus : seq< plus< B >, A, plus< B > > {};\n\nstruct padded_oper : pad_plus< sor< contains, begins, ends >, blank > {};\nstruct symbolic_oper : pad< sor< eq, noteq, lteq, lt, gteq, gt >, blank > {};\n\n\/\/ predicates\nstruct comparison_pred : seq< expr, sor< padded_oper, symbolic_oper >, expr > {};\n\nstruct pred;\nstruct group_pred : if_must< one< '(' >, pad< pred, blank >, one< ')' > > {};\nstruct true_pred : pegtl_istring_t(\"truepredicate\") {};\nstruct false_pred : pegtl_istring_t(\"falsepredicate\") {};\n\nstruct not_pre : seq< sor< one< '!' >, pegtl_istring_t(\"not\") > > {};\nstruct atom_pred : seq< opt< not_pre >, pad< sor< group_pred, true_pred, false_pred, comparison_pred >, blank > > {};\n\nstruct and_op : pad< sor< two< '&' >, pegtl_istring_t(\"and\") >, blank > {};\nstruct or_op : pad< sor< two< '|' >, pegtl_istring_t(\"or\") >, blank > {};\n\nstruct or_ext : if_must< or_op, pred > {};\nstruct and_ext : if_must< and_op, pred > {};\nstruct and_pred : seq< atom_pred, star< and_ext > > {};\n\nstruct pred : seq< and_pred, star< or_ext > > {};\n\n\/\/ state\nstruct ParserState\n{\n std::vector<Predicate *> predicate_stack;\n Predicate ¤t()\n {\n return *predicate_stack.back();\n }\n \n bool current_is_compound()\n {\n return current().type == Predicate::Type::And || current().type == Predicate::Type::Or;\n }\n \n bool negate_next = false;\n \n void addExpression(Expression && exp)\n {\n Predicate &cur = current();\n if (cur.type == Predicate::Type::Comparison) {\n cur.cmpr.expr[1] = std::move(exp);\n predicate_stack.pop_back();\n }\n else {\n assert(current_is_compound());\n\n Predicate p(Predicate::Type::Comparison);\n p.cmpr.expr[0] = std::move(exp);\n if (negate_next) {\n p.negate = true;\n negate_next = false;\n }\n \n cur.cpnd.sub_predicates.emplace_back(std::move(p));\n predicate_stack.push_back(&cur.cpnd.sub_predicates.back());\n }\n }\n};\n\n\/\/ rules\ntemplate< typename Rule >\nstruct action : nothing< Rule > {};\n\n#ifdef REALM_PARSER_PRINT_TOKENS\n #define DEBUG_PRINT_TOKEN(string) std::cout << string << std::endl\n#else\n #define DEBUG_PRINT_TOKEN(string)\n#endif\n\ntemplate<> struct action< and_ext >\n{\n static void apply( const input & in, ParserState & state )\n {\n DEBUG_PRINT_TOKEN(\"<and>\");\n assert(state.current_is_compound());\n\n \/\/ if we were put into an OR group we need to rearrange\n auto ¤t = state.current();\n if (current.type == Predicate::Type::Or) {\n auto &sub_preds = current.cpnd.sub_predicates;\n auto &second_last = sub_preds[sub_preds.size()-2];\n if (second_last.type == Predicate::Type::And) {\n \/\/ if we are in an OR group and second to last predicate group is\n \/\/ an AND group then move the last predicate inside\n second_last.cpnd.sub_predicates.push_back(std::move(sub_preds.back()));\n sub_preds.pop_back();\n }\n else {\n \/\/ otherwise combine last two into a new AND group\n Predicate pred(Predicate::Type::And);\n pred.cpnd.sub_predicates.emplace_back(std::move(second_last));\n pred.cpnd.sub_predicates.emplace_back(std::move(sub_preds.back()));\n sub_preds.pop_back();\n sub_preds.pop_back();\n sub_preds.push_back(std::move(pred));\n }\n }\n }\n};\n\ntemplate<> struct action< or_ext >\n{\n static void apply( const input & in, ParserState & state )\n {\n DEBUG_PRINT_TOKEN(\"<or>\");\n assert(state.current_is_compound());\n\n \/\/ if already an OR group do nothing\n auto ¤t = state.current();\n if (current.type == Predicate::Type::Or) {\n return;\n }\n\n \/\/ if only two predicates in the group, then convert to OR\n auto &sub_preds = state.current().cpnd.sub_predicates;\n assert(sub_preds.size() > 1);\n if (sub_preds.size() == 2) {\n current.type = Predicate::Type::Or;\n return;\n }\n\n \/\/ split the current group into to groups which are ORed together\n Predicate pred1(Predicate::Type::And), pred2(Predicate::Type::And);\n std::vector<Predicate>::iterator second_last = sub_preds.end() - 2;\n pred1.cpnd.sub_predicates.insert(pred1.cpnd.sub_predicates.begin(), sub_preds.begin(), second_last);\n pred2.cpnd.sub_predicates.insert(pred2.cpnd.sub_predicates.begin(), second_last, sub_preds.end());\n\n current.type = Predicate::Type::Or;\n sub_preds.clear();\n sub_preds.emplace_back(std::move(pred1));\n sub_preds.emplace_back(std::move(pred2));\n }\n};\n\n\n#define EXPRESSION_ACTION(rule, type) \\\ntemplate<> struct action< rule > { \\\n static void apply( const input & in, ParserState & state ) { \\\n DEBUG_PRINT_TOKEN(in.string()); \\\n state.addExpression(Expression(type, in.string())); }};\n\nEXPRESSION_ACTION(dq_string_content, Expression::Type::String)\nEXPRESSION_ACTION(sq_string_content, Expression::Type::String)\nEXPRESSION_ACTION(key_path, Expression::Type::KeyPath)\nEXPRESSION_ACTION(number, Expression::Type::Number)\nEXPRESSION_ACTION(true_value, Expression::Type::True)\nEXPRESSION_ACTION(false_value, Expression::Type::False)\nEXPRESSION_ACTION(argument_index, Expression::Type::Argument)\n\n\ntemplate<> struct action< true_pred >\n{\n static void apply( const input & in, ParserState & state )\n {\n DEBUG_PRINT_TOKEN(in.string());\n state.current().cpnd.sub_predicates.emplace_back(Predicate::Type::True);\n }\n};\n\ntemplate<> struct action< false_pred >\n{\n static void apply( const input & in, ParserState & state )\n {\n DEBUG_PRINT_TOKEN(in.string());\n state.current().cpnd.sub_predicates.emplace_back(Predicate::Type::False);\n }\n};\n\n#define OPERATOR_ACTION(rule, oper) \\\ntemplate<> struct action< rule > { \\\n static void apply( const input & in, ParserState & state ) { \\\n DEBUG_PRINT_TOKEN(in.string()); \\\n state.current().cmpr.op = oper; }};\n\nOPERATOR_ACTION(eq, Predicate::Operator::Equal)\nOPERATOR_ACTION(noteq, Predicate::Operator::NotEqual)\nOPERATOR_ACTION(gteq, Predicate::Operator::GreaterThanOrEqual)\nOPERATOR_ACTION(gt, Predicate::Operator::GreaterThan)\nOPERATOR_ACTION(lteq, Predicate::Operator::LessThanOrEqual)\nOPERATOR_ACTION(lt, Predicate::Operator::LessThan)\nOPERATOR_ACTION(begins, Predicate::Operator::BeginsWith)\nOPERATOR_ACTION(ends, Predicate::Operator::EndsWith)\nOPERATOR_ACTION(contains, Predicate::Operator::Contains)\n\ntemplate<> struct action< one< '(' > >\n{\n static void apply( const input & in, ParserState & state )\n {\n DEBUG_PRINT_TOKEN(\"<begin_group>\");\n\n Predicate group(Predicate::Type::And);\n if (state.negate_next) {\n group.negate = true;\n state.negate_next = false;\n }\n\n state.current().cpnd.sub_predicates.emplace_back(std::move(group));\n state.predicate_stack.push_back(&state.current().cpnd.sub_predicates.back());\n }\n};\n\ntemplate<> struct action< group_pred >\n{\n static void apply( const input & in, ParserState & state )\n {\n DEBUG_PRINT_TOKEN(\"<end_group>\");\n state.predicate_stack.pop_back();\n }\n};\n\ntemplate<> struct action< not_pre >\n{\n static void apply( const input & in, ParserState & state )\n {\n DEBUG_PRINT_TOKEN(\"<not>\");\n state.negate_next = true;\n }\n};\n\ntemplate< typename Rule >\nstruct error_message_control : pegtl::normal< Rule >\n{\n static const std::string error_message;\n\n template< typename Input, typename ... States >\n static void raise( const Input & in, States && ... )\n {\n throw pegtl::parse_error( error_message, in );\n }\n};\n\ntemplate<>\nconst std::string error_message_control< chars >::error_message = \"Invalid characters in string constant.\";\n\ntemplate< typename Rule>\nconst std::string error_message_control< Rule >::error_message = \"Invalid predicate.\";\n\nPredicate parse(const std::string &query)\n{\n Predicate out_predicate(Predicate::Type::And);\n\n ParserState state;\n state.predicate_stack.push_back(&out_predicate);\n\n pegtl::parse< must< pred, eof >, action, error_message_control >(query, query, state);\n if (out_predicate.type == Predicate::Type::And && out_predicate.cpnd.sub_predicates.size() == 1) {\n return std::move(out_predicate.cpnd.sub_predicates.back());\n }\n return std::move(out_predicate);\n}\n\nvoid analyzeGrammar()\n{\n analyze<pred>();\n}\n\n}}\n\n\n<|endoftext|>"} {"text":"<commit_before>\/* Copyright 2013 Paulo Roberto Urio <paulourio@gmail.com> *\/\n#include \".\/acs.h\"\n\nnamespace acs {\n\nACSEdgeDetection::ACSEdgeDetection(cv::Mat input, GUIController controller) :\n\t\tinput_(input), pheromone_(input.rows, input.cols, CV_8UC1), controller_(\n\t\t\t\tcontroller) {\n}\n\nACSEdgeDetection::~ACSEdgeDetection() {\n}\n\nvoid ACSEdgeDetection::Compute() {\n}\n\n} \/\/ namespace acs\n<commit_msg>Inicializando a matriz de feromônio com 0.0001<commit_after>\/* Copyright 2013 Paulo Roberto Urio <paulourio@gmail.com> *\/\n#include \".\/acs.h\"\n\nnamespace acs {\n\nACSEdgeDetection::ACSEdgeDetection(cv::Mat input, GUIController controller) :\n\t\tinput_(input), pheromone_(input.rows, input.cols, CV_32FC1), controller_(\n\t\t\t\tcontroller) {\n\tpheromone_ = 0.0001f;\n}\n\nACSEdgeDetection::~ACSEdgeDetection() {\n}\n\nvoid ACSEdgeDetection::Compute() {\n}\n\n} \/\/ namespace acs\n<|endoftext|>"} {"text":"<commit_before>\/*-\n * Copyright (c) 2012, Achilleas Margaritis\n * Copyright (c) 2014, David T. Chisnall\n * All rights 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#ifndef PEGMATITE_AST_HPP\n#define PEGMATITE_AST_HPP\n\n\n#include <cassert>\n#include <list>\n#include <unordered_map>\n#include <memory>\n#include \"parser.hh\"\n\n\nnamespace pegmatite {\n\n\nclass ASTNode;\ntemplate <class T, bool OPT> class ASTPtr;\ntemplate <class T> class ASTList;\ntemplate <class T> class BindAST;\n\n\n\/** type of AST node stack.\n *\/\ntypedef std::vector<std::unique_ptr<ASTNode>> ASTStack;\n\n#ifdef USE_RTTI\n#define PEGMATITE_RTTI(thisclass, superclass)\n#else\n\/**\n * Define the methods required for pegmatite's lightweight RTTI replacement to\n * work. This should be used at the end of the class definition and will\n * provide support for safe downcasting.\n *\/\n#define PEGMATITE_RTTI(thisclass, superclass) \\\n\tfriend ASTNode; \\\nprotected: \\\n\tvirtual char *kind() \\\n\t{ \\\n\t\treturn thisclass::classKind(); \\\n\t} \\\n\tstatic char *classKind() \\\n\t{ \\\n\t\tstatic char thisclass ## id; \\\n\t\treturn &thisclass ## id; \\\n\t} \\\npublic: \\\n\tvirtual bool isa(char *x) \\\n\t{ \\\n\t\treturn (x == kind()) || \\\n\t\t\t\t(superclass::isa(x)); \\\n\t}\n#endif\n\n\n\/**\n * Base class for AST nodes.\n *\/\nclass ASTNode\n{\npublic:\n\t\/**\n\t * Constructs the AST node, with a null parent.\n\t *\/\n\tASTNode() : parent_node(0) {}\n\t\/**\n\t * Copying AST nodes is not supported.\n\t *\/\n\tASTNode(const ASTNode&) = delete;\n\t\n\t\/**\n\t * Destructor does nothing, virtual for subclasses to use.\n\t *\/\n\tvirtual ~ASTNode() {}\n\t\n\t\/**\n\t * Returns the parent of this AST node, or `nullptr` if there isn't one\n\t * (either if this is the root, or if it is still in the stack waiting to\n\t * be added to the tree).\n\t *\/\n\tASTNode *parent() const { return parent_node; }\n\t\n\t\/** \n\t * Interface for constructing the AST node. The input range `r` is the\n\t * range within the source.\n\t *\/\n\tvirtual void construct(const InputRange &r, ASTStack &st) {}\n\t\nprivate:\n\t\/**\n\t * The parent AST node.\n\t *\/\n\tASTNode *parent_node;\n\t\n\ttemplate <class T, bool OPT> friend class ASTPtr;\n\ttemplate <class T> friend class ASTList;\n\ttemplate <class T> friend class BindAST;\n\n#ifndef USE_RTTI\nprotected:\n\t\/**\n\t * Returns the kind of object class. This is a unique pointer that can be\n\t * tested against pointers returned by classKind() to determine whether\n\t * they can be safely compared.\n\t *\/\n\tvirtual char *kind() { return classKind(); }\n\t\/**\n\t * Returns the unique identifier for this class.\n\t *\/\n\tstatic char *classKind()\n\t{\n\t\tstatic char ASTNodeid;\n\t\treturn &ASTNodeid;\n\t}\npublic:\n\t\/**\n\t * Root implementation of the RTTI-replacement for builds not wishing to\n\t * use RTTI. This returns true if `x` is the value returned from\n\t * `classKind()`, or false otherwise.\n\t *\/\n\tvirtual bool isa(char *x)\n\t{\n\t\treturn x == classKind();\n\t}\n\t\/**\n\t * Returns true if this object is an instance of `T`. Note that this\n\t * *only* works with single-inheritance hierarchies. If you wish to use\n\t * multiple inheritance in your AST classes, then you must define\n\t * `USE_RTTI` and use the C++ RTTI mechanism.\n\t *\/\n\ttemplate <class T> bool isa()\n\t{\n\t\treturn isa(T::classKind());\n\t}\n\t\/**\n\t * Returns a pointer to this object as a pointer to a child class, or\n\t * `nullptr` if the cast would be unsafe. \n\t *\n\t * Note that AST nodes are intended to be always used as unique pointers\n\t * and so the returned object is *only* valid as long as the unique pointer\n\t * is valid.\n\t *\/\n\ttemplate <class T> T* get_as()\n\t{\n\t\treturn this ? (isa<T>() ? static_cast<T*>(this) : nullptr) : nullptr;\n\t}\n#else\npublic:\n\ttemplate <class T> T* get_as()\n\t{\n\t\treturn dynamic_cast<T*>(this);\n\t}\n#endif\n};\n\n\nclass ASTMember;\n\n\n\/** type of ast member vector.\n *\/\n\n\n\/** \n * The base class for non-leaf AST nodes. Subclasses can have instances of\n * `ASTMember` subclasses as fields and will automatically construct them.\n *\/\nclass ASTContainer : public ASTNode\n{\npublic:\n\t\/**\n\t * Constructs the container, setting a thread-local value to point to it\n\t * allowing constructors in fields of the subclass to register themselves\n\t * in the members vector.\n\t *\/\n\tASTContainer();\n\n\t\/** \n\t * Asks all members to construct themselves from the stack. The members are\n\t * asked to construct themselves in reverse order from a node stack (`st`). \n\t *\n\t * The input range (`r`) is unused, because the leaf nodes have already\n\t * constructed themselves at this point.\n\t *\/\n\tvirtual void construct(const InputRange &r, ASTStack &st);\n\nprivate:\n\t\/**\n\t * The type used for tracking the fields of subclasses.\n\t *\/\n\ttypedef std::vector<ASTMember *> ASTMember_vector;\n\t\/**\n\t * References to all of the fields of the subclass that will be\n\t * automatically constructed.\n\t *\/\n\tASTMember_vector members;\n\n\tfriend class ASTMember;\n\tPEGMATITE_RTTI(ASTContainer, ASTNode)\n};\n\n\n\/**\n * Base class for children of `ASTContainer`.\n *\/\nclass ASTMember\n{\npublic:\n\t\/**\n\t * On construction, `ASTMember` sets its `container_node` field to the\n\t * `ASTContainer` currently under construction and registers itself with\n\t * the container, to be notified during the construction phase.\n\t *\/\n\tASTMember();\n\n\t\/** \n\t * Returns the container of which this object is a field.\n\t *\/\n\tASTContainer *container() const { return container_node; }\n\n\t\/**\n\t * Interface for constructing references to AST objects from the stack.\n\t *\/\n\tvirtual void construct(ASTStack &st) = 0;\nprotected:\n\t\/**\n\t * The container that owns this object.\n\t *\/\n\tASTContainer *container_node;\n};\n\n\n\/**\n * An `ASTPtr` is a wrapper around a pointer to an AST object. It is intended\n * to be a member of an `ASTContainer` and will automatically pop the top item\n * from the stack and claim it when building the AST..\n *\/\ntemplate <class T, bool OPT = false> class ASTPtr : public ASTMember\n{\npublic:\n\t\/** \n\t * Constructs the object in the \n\t *\/\n\tASTPtr() : ptr(nullptr) {}\n\n\t\/** gets the underlying ptr value.\n\t\t@return the underlying ptr value.\n\t *\/\n\tT *get() const\n\t{\n\t\treturn ptr.get();\n\t}\n\n\t\/** auto conversion to the underlying object ptr.\n\t\t@return the underlying ptr value.\n\t *\/\n\tconst std::unique_ptr<T> &operator *() const\n\t{\n\t\treturn ptr;\n\t}\n\n\t\/** member access.\n\t\t@return the underlying ptr value.\n\t *\/\n\tconst std::unique_ptr<T> &operator ->() const\n\t{\n\t\tassert(ptr);\n\t\treturn ptr;\n\t}\n\n\t\/**\n\t * Pops the next matching object from the AST stack `st` and claims it.\n\t *\/\n\tvirtual void construct(ASTStack &st)\n\t{\n\t\tassert(!st.empty() && \"Stack must not be empty\");\n\t\t\/\/get the node\n\t\tASTNode *node = st.back().get();\n\t\t\n\t\t\/\/get the object\n\t\tT *obj = node->get_as<T>();\n\t\t\n\t\tassert((obj || OPT) && \"Required objects must exist!\");\n\t\t\/\/if the object is optional, simply return\n\t\tif (OPT && !obj)\n\t\t{\n\t\t\treturn;\n\t\t}\n\t\t\/\/set the new object\n\t\tptr.reset(obj);\n\t\t\/\/pop the node from the stack\n\t\tst.back().release();\n\t\tst.pop_back();\n\t\tptr->parent_node = container_node;\n\t}\n\nprivate:\n\t\/**\n\t * The node that we are pointing to.\n\t *\/\n\tstd::unique_ptr<T> ptr;\n};\n\n\n\/** A list of objects.\n\tIt pops objects of the given type from the ast stack, until no more objects can be popped.\n\tIt assumes ownership of objects.\n\t@param T type of object to control.\n *\/\ntemplate <class T> class ASTList : public ASTMember\n{\npublic:\n\t\/\/\/list type.\n\ttypedef std::list<std::unique_ptr<T>> container;\n\n\t\/\/\/the default constructor.\n\tASTList() {}\n\n\t\/** duplicates the objects of the given list.\n\t\t@param src source object.\n\t *\/\n\tASTList(const ASTList<T> &src)\n\t{\n\t\t_dup(src);\n\t}\n\n\t\/** returns the container of objects.\n\t\t@return the container of objects.\n\t *\/\n\tconst container &objects() const\n\t{\n\t\treturn child_objects;\n\t}\n\n\t\/** \n\t * Pops objects of type T from the stack (`st`) until no more objects can\n\t * be popped.\n\t *\/\n\tvirtual void construct(ASTStack &st)\n\t{\n\t\tfor(;;)\n\t\t{\n\t\t\t\/\/if the stack is empty\n\t\t\tif (st.empty()) break;\n\t\t\t\n\t\t\t\/\/get the node\n\t\t\tASTNode *node = st.back().get();\n\t\t\t\n\t\t\t\/\/get the object\n\t\t\tT *obj = node->get_as<T>();\n\t\t\t\n\t\t\t\/\/if the object was not not of the appropriate type,\n\t\t\t\/\/end the list parsing\n\t\t\tif (!obj) return;\n\t\t\t\n\t\t\t\/\/remove the node from the stack\n\t\t\tst.back().release();\n\t\t\tst.pop_back();\n\t\t\t\n\t\t\t\/\/insert the object in the list, in reverse order\n\t\t\tchild_objects.push_front(std::unique_ptr<T>(obj));\n\t\t\t\n\t\t\t\/\/set the object's parent\n\t\t\tobj->parent_node = ASTMember::container();\n\t\t}\n\t}\n\nprivate:\n\t\/\/objects\n\tcontainer child_objects;\n\n\t\/\/duplicate the given list.\n\tvoid _dup(const ASTList<T> &src)\n\t{\n\t\tfor (auto child : src.child_objects)\n\t\t{\n\t\t\tT *obj = new T(child.get());\n\t\t\tchild_objects.push_back(obj);\n\t\t\tobj->parent_node = ASTMember::container();\n\t\t}\n\t}\n};\n\n\/** parses the given input.\n\t@param i input.\n\t@param g root rule of grammar.\n\t@param ws whitespace rule.\n\t@param el list of errors.\n\t@param d user data, passed to the parse procedures.\n\t@return pointer to ast node created, or null if there was an error.\n\t\tThe return object must be deleted by the caller.\n *\/\nstd::unique_ptr<ASTNode> parse(Input &i, const Rule &g, const Rule &ws,\n ErrorList &el, const ParserDelegate &d);\n\n\/**\n * A parser delegate that is responsible for creating AST nodes from the input.\n *\n * This class manages a mapping from rules in some grammar to AST nodes.\n * Instances of the `BindAST` class that are fields of a subclass of this will\n * automatically register rules on creation.\n *\n * The recommended use for this class is to only register rules on construction\n * (either explicitly in the constructor or implicitly via `BindAST` members).\n * This will give a completely reentrant delegate, which can be used by\n * multiple threads to parse multiple inputs safely.\n *\/\nclass ASTParserDelegate : ParserDelegate\n{\n\t\/**\n\t * BindAST is a friend so that it can call the `set_parse_proc()` function,\n\t * which should never be called from anything else.\n\t *\/\n\ttemplate <class T> friend class BindAST;\n\tprivate:\n\t\/**\n\t * The map from rules to parsing handlers.\n\t *\/\n\tstd::unordered_map<const Rule*, parse_proc> handlers;\n\t\/**\n\t * Registers a callback in this delegate. This should only be called from\n\t * the `static` version of this function.\n\t *\/\n\tvoid set_parse_proc(const Rule &r, parse_proc p);\n\t\/**\n\t * Registers a callback for a specific rule in the instance of this class\n\t * currently under construction in this thread. This should only ever be\n\t * called by `BindAST` instances.\n\t *\/\n\tstatic void bind_parse_proc(const Rule &r, parse_proc p);\n\tpublic:\n\t\/**\n\t * Default constructor, registers this class in thread-local storage so\n\t * that it can be referenced by BindAST fields in subclasses when their\n\t * constructors are run.\n\t *\/\n\tASTParserDelegate();\n\tvirtual parse_proc get_parse_proc(const Rule &) const;\n\t\/**\n\t * Parse an input `i`, starting from rule `g` in the grammar for which\n\t * this is a delegate. The rule `ws` is used as whitespace. Errors are\n\t * returned via the `el` parameter and the root of the AST via the `ast`\n\t * parameter.\n\t *\n\t * This function returns true on a successful parse, or false otherwise.\n\t *\/\n\ttemplate <class T> bool parse(Input &i, const Rule &g, const Rule &ws,\n\t ErrorList &el, std::unique_ptr<T> &ast) const\n\t{\n\t\tstd::unique_ptr<ASTNode> node = pegmatite::parse(i, g, ws, el, *this);\n\t\tT *n = node->get_as<T>();\n\t\tif (n)\n\t\t{\n\t\t\tnode.release();\n\t\t\tast.reset(n);\n\t\t\treturn true;\n\t\t}\n\t\treturn false;\n\t}\n};\n\n\/**\n * The `BindAST` class is responsible for \n *\/\ntemplate <class T> class BindAST\n{\npublic:\n\t\/**\n\t * Bind the AST class described in the\n\t *\/\n\tBindAST(const Rule &r)\n\t{\n\t\tASTParserDelegate::bind_parse_proc(r, [](const ParserPosition &b,\n\t\t const ParserPosition &e, void *d)\n\t\t\t{\n\t\t\t\tASTStack *st = reinterpret_cast<ASTStack *>(d);\n\t\t\t\tT *obj = new T();\n\t\t\t\tobj->construct(InputRange(b, e), *st);\n\t\t\t\tst->push_back(std::unique_ptr<ASTNode>(obj));\n\t\t\t});\n\t}\n};\n\n\n} \/\/namespace pegmatite\n\n\n#endif \/\/PEGMATITE_AST_HPP\n<commit_msg>Improve some more comments.<commit_after>\/*-\n * Copyright (c) 2012, Achilleas Margaritis\n * Copyright (c) 2014, David T. Chisnall\n * All rights 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#ifndef PEGMATITE_AST_HPP\n#define PEGMATITE_AST_HPP\n\n\n#include <cassert>\n#include <list>\n#include <unordered_map>\n#include <memory>\n#include \"parser.hh\"\n\n\nnamespace pegmatite {\n\n\nclass ASTNode;\ntemplate <class T, bool OPT> class ASTPtr;\ntemplate <class T> class ASTList;\ntemplate <class T> class BindAST;\n\n\n\/** type of AST node stack.\n *\/\ntypedef std::vector<std::unique_ptr<ASTNode>> ASTStack;\n\n#ifdef USE_RTTI\n#define PEGMATITE_RTTI(thisclass, superclass)\n#else\n\/**\n * Define the methods required for pegmatite's lightweight RTTI replacement to\n * work. This should be used at the end of the class definition and will\n * provide support for safe downcasting.\n *\/\n#define PEGMATITE_RTTI(thisclass, superclass) \\\n\tfriend ASTNode; \\\nprotected: \\\n\tvirtual char *kind() \\\n\t{ \\\n\t\treturn thisclass::classKind(); \\\n\t} \\\n\tstatic char *classKind() \\\n\t{ \\\n\t\tstatic char thisclass ## id; \\\n\t\treturn &thisclass ## id; \\\n\t} \\\npublic: \\\n\tvirtual bool isa(char *x) \\\n\t{ \\\n\t\treturn (x == kind()) || \\\n\t\t\t\t(superclass::isa(x)); \\\n\t}\n#endif\n\n\n\/**\n * Base class for AST nodes.\n *\/\nclass ASTNode\n{\npublic:\n\t\/**\n\t * Constructs the AST node, with a null parent.\n\t *\/\n\tASTNode() : parent_node(0) {}\n\t\/**\n\t * Copying AST nodes is not supported.\n\t *\/\n\tASTNode(const ASTNode&) = delete;\n\t\n\t\/**\n\t * Destructor does nothing, virtual for subclasses to use.\n\t *\/\n\tvirtual ~ASTNode() {}\n\t\n\t\/**\n\t * Returns the parent of this AST node, or `nullptr` if there isn't one\n\t * (either if this is the root, or if it is still in the stack waiting to\n\t * be added to the tree).\n\t *\/\n\tASTNode *parent() const { return parent_node; }\n\t\n\t\/** \n\t * Interface for constructing the AST node. The input range `r` is the\n\t * range within the source.\n\t *\/\n\tvirtual void construct(const InputRange &r, ASTStack &st) {}\n\t\nprivate:\n\t\/**\n\t * The parent AST node.\n\t *\/\n\tASTNode *parent_node;\n\t\n\ttemplate <class T, bool OPT> friend class ASTPtr;\n\ttemplate <class T> friend class ASTList;\n\ttemplate <class T> friend class BindAST;\n\n#ifndef USE_RTTI\nprotected:\n\t\/**\n\t * Returns the kind of object class. This is a unique pointer that can be\n\t * tested against pointers returned by classKind() to determine whether\n\t * they can be safely compared.\n\t *\/\n\tvirtual char *kind() { return classKind(); }\n\t\/**\n\t * Returns the unique identifier for this class.\n\t *\/\n\tstatic char *classKind()\n\t{\n\t\tstatic char ASTNodeid;\n\t\treturn &ASTNodeid;\n\t}\npublic:\n\t\/**\n\t * Root implementation of the RTTI-replacement for builds not wishing to\n\t * use RTTI. This returns true if `x` is the value returned from\n\t * `classKind()`, or false otherwise.\n\t *\/\n\tvirtual bool isa(char *x)\n\t{\n\t\treturn x == classKind();\n\t}\n\t\/**\n\t * Returns true if this object is an instance of `T`. Note that this\n\t * *only* works with single-inheritance hierarchies. If you wish to use\n\t * multiple inheritance in your AST classes, then you must define\n\t * `USE_RTTI` and use the C++ RTTI mechanism.\n\t *\/\n\ttemplate <class T> bool isa()\n\t{\n\t\treturn isa(T::classKind());\n\t}\n\t\/**\n\t * Returns a pointer to this object as a pointer to a child class, or\n\t * `nullptr` if the cast would be unsafe. \n\t *\n\t * Note that AST nodes are intended to be always used as unique pointers\n\t * and so the returned object is *only* valid as long as the unique pointer\n\t * is valid.\n\t *\/\n\ttemplate <class T> T* get_as()\n\t{\n\t\treturn this ? (isa<T>() ? static_cast<T*>(this) : nullptr) : nullptr;\n\t}\n#else\npublic:\n\ttemplate <class T> T* get_as()\n\t{\n\t\treturn dynamic_cast<T*>(this);\n\t}\n#endif\n};\n\n\nclass ASTMember;\n\n\n\/** type of ast member vector.\n *\/\n\n\n\/** \n * The base class for non-leaf AST nodes. Subclasses can have instances of\n * `ASTMember` subclasses as fields and will automatically construct them.\n *\/\nclass ASTContainer : public ASTNode\n{\npublic:\n\t\/**\n\t * Constructs the container, setting a thread-local value to point to it\n\t * allowing constructors in fields of the subclass to register themselves\n\t * in the members vector.\n\t *\/\n\tASTContainer();\n\n\t\/** \n\t * Asks all members to construct themselves from the stack. The members are\n\t * asked to construct themselves in reverse order from a node stack (`st`). \n\t *\n\t * The input range (`r`) is unused, because the leaf nodes have already\n\t * constructed themselves at this point.\n\t *\/\n\tvirtual void construct(const InputRange &r, ASTStack &st);\n\nprivate:\n\t\/**\n\t * The type used for tracking the fields of subclasses.\n\t *\/\n\ttypedef std::vector<ASTMember *> ASTMember_vector;\n\t\/**\n\t * References to all of the fields of the subclass that will be\n\t * automatically constructed.\n\t *\/\n\tASTMember_vector members;\n\n\tfriend class ASTMember;\n\tPEGMATITE_RTTI(ASTContainer, ASTNode)\n};\n\n\n\/**\n * Base class for children of `ASTContainer`.\n *\/\nclass ASTMember\n{\npublic:\n\t\/**\n\t * On construction, `ASTMember` sets its `container_node` field to the\n\t * `ASTContainer` currently under construction and registers itself with\n\t * the container, to be notified during the construction phase.\n\t *\/\n\tASTMember();\n\n\t\/** \n\t * Returns the container of which this object is a field.\n\t *\/\n\tASTContainer *container() const { return container_node; }\n\n\t\/**\n\t * Interface for constructing references to AST objects from the stack.\n\t *\/\n\tvirtual void construct(ASTStack &st) = 0;\nprotected:\n\t\/**\n\t * The container that owns this object.\n\t *\/\n\tASTContainer *container_node;\n};\n\n\n\/**\n * An `ASTPtr` is a wrapper around a pointer to an AST object. It is intended\n * to be a member of an `ASTContainer` and will automatically pop the top item\n * from the stack and claim it when building the AST..\n *\/\ntemplate <class T, bool OPT = false> class ASTPtr : public ASTMember\n{\npublic:\n\t\/** \n\t * Constructs the object in the \n\t *\/\n\tASTPtr() : ptr(nullptr) {}\n\n\t\/** gets the underlying ptr value.\n\t\t@return the underlying ptr value.\n\t *\/\n\tT *get() const\n\t{\n\t\treturn ptr.get();\n\t}\n\n\t\/** auto conversion to the underlying object ptr.\n\t\t@return the underlying ptr value.\n\t *\/\n\tconst std::unique_ptr<T> &operator *() const\n\t{\n\t\treturn ptr;\n\t}\n\n\t\/** member access.\n\t\t@return the underlying ptr value.\n\t *\/\n\tconst std::unique_ptr<T> &operator ->() const\n\t{\n\t\tassert(ptr);\n\t\treturn ptr;\n\t}\n\n\t\/**\n\t * Pops the next matching object from the AST stack `st` and claims it.\n\t *\/\n\tvirtual void construct(ASTStack &st)\n\t{\n\t\tassert(!st.empty() && \"Stack must not be empty\");\n\t\t\/\/get the node\n\t\tASTNode *node = st.back().get();\n\t\t\n\t\t\/\/get the object\n\t\tT *obj = node->get_as<T>();\n\t\t\n\t\tassert((obj || OPT) && \"Required objects must exist!\");\n\t\t\/\/if the object is optional, simply return\n\t\tif (OPT && !obj)\n\t\t{\n\t\t\treturn;\n\t\t}\n\t\t\/\/set the new object\n\t\tptr.reset(obj);\n\t\t\/\/pop the node from the stack\n\t\tst.back().release();\n\t\tst.pop_back();\n\t\tptr->parent_node = container_node;\n\t}\n\nprivate:\n\t\/**\n\t * The node that we are pointing to.\n\t *\/\n\tstd::unique_ptr<T> ptr;\n};\n\n\n\/** A list of objects.\n\tIt pops objects of the given type from the ast stack, until no more objects can be popped.\n\tIt assumes ownership of objects.\n\t@param T type of object to control.\n *\/\ntemplate <class T> class ASTList : public ASTMember\n{\npublic:\n\t\/\/\/list type.\n\ttypedef std::list<std::unique_ptr<T>> container;\n\n\t\/\/\/the default constructor.\n\tASTList() {}\n\n\t\/** duplicates the objects of the given list.\n\t\t@param src source object.\n\t *\/\n\tASTList(const ASTList<T> &src)\n\t{\n\t\t_dup(src);\n\t}\n\n\t\/** returns the container of objects.\n\t\t@return the container of objects.\n\t *\/\n\tconst container &objects() const\n\t{\n\t\treturn child_objects;\n\t}\n\n\t\/** \n\t * Pops objects of type T from the stack (`st`) until no more objects can\n\t * be popped.\n\t *\/\n\tvirtual void construct(ASTStack &st)\n\t{\n\t\tfor(;;)\n\t\t{\n\t\t\t\/\/if the stack is empty\n\t\t\tif (st.empty()) break;\n\t\t\t\n\t\t\t\/\/get the node\n\t\t\tASTNode *node = st.back().get();\n\t\t\t\n\t\t\t\/\/get the object\n\t\t\tT *obj = node->get_as<T>();\n\t\t\t\n\t\t\t\/\/if the object was not not of the appropriate type,\n\t\t\t\/\/end the list parsing\n\t\t\tif (!obj) return;\n\t\t\t\n\t\t\t\/\/remove the node from the stack\n\t\t\tst.back().release();\n\t\t\tst.pop_back();\n\t\t\t\n\t\t\t\/\/insert the object in the list, in reverse order\n\t\t\tchild_objects.push_front(std::unique_ptr<T>(obj));\n\t\t\t\n\t\t\t\/\/set the object's parent\n\t\t\tobj->parent_node = ASTMember::container();\n\t\t}\n\t}\n\nprivate:\n\t\/\/objects\n\tcontainer child_objects;\n\n\t\/\/duplicate the given list.\n\tvoid _dup(const ASTList<T> &src)\n\t{\n\t\tfor (auto child : src.child_objects)\n\t\t{\n\t\t\tT *obj = new T(child.get());\n\t\t\tchild_objects.push_back(obj);\n\t\t\tobj->parent_node = ASTMember::container();\n\t\t}\n\t}\n};\n\n\/** parses the given input.\n\t@param i input.\n\t@param g root rule of grammar.\n\t@param ws whitespace rule.\n\t@param el list of errors.\n\t@param d user data, passed to the parse procedures.\n\t@return pointer to ast node created, or null if there was an error.\n\t\tThe return object must be deleted by the caller.\n *\/\nstd::unique_ptr<ASTNode> parse(Input &i, const Rule &g, const Rule &ws,\n ErrorList &el, const ParserDelegate &d);\n\n\/**\n * A parser delegate that is responsible for creating AST nodes from the input.\n *\n * This class manages a mapping from rules in some grammar to AST nodes.\n * Instances of the `BindAST` class that are fields of a subclass of this will\n * automatically register rules on creation.\n *\n * The recommended use for this class is to only register rules on construction\n * (either explicitly in the constructor or implicitly via `BindAST` members).\n * This will give a completely reentrant delegate, which can be used by\n * multiple threads to parse multiple inputs safely.\n *\/\nclass ASTParserDelegate : ParserDelegate\n{\n\t\/**\n\t * BindAST is a friend so that it can call the `set_parse_proc()` function,\n\t * which should never be called from anything else.\n\t *\/\n\ttemplate <class T> friend class BindAST;\n\tprivate:\n\t\/**\n\t * The map from rules to parsing handlers.\n\t *\/\n\tstd::unordered_map<const Rule*, parse_proc> handlers;\n\t\/**\n\t * Registers a callback in this delegate. This should only be called from\n\t * the `static` version of this function.\n\t *\/\n\tvoid set_parse_proc(const Rule &r, parse_proc p);\n\t\/**\n\t * Registers a callback for a specific rule in the instance of this class\n\t * currently under construction in this thread. This should only ever be\n\t * called by `BindAST` instances.\n\t *\/\n\tstatic void bind_parse_proc(const Rule &r, parse_proc p);\n\tpublic:\n\t\/**\n\t * Default constructor, registers this class in thread-local storage so\n\t * that it can be referenced by BindAST fields in subclasses when their\n\t * constructors are run.\n\t *\/\n\tASTParserDelegate();\n\tvirtual parse_proc get_parse_proc(const Rule &) const;\n\t\/**\n\t * Parse an input `i`, starting from rule `g` in the grammar for which\n\t * this is a delegate. The rule `ws` is used as whitespace. Errors are\n\t * returned via the `el` parameter and the root of the AST via the `ast`\n\t * parameter.\n\t *\n\t * This function returns true on a successful parse, or false otherwise.\n\t *\/\n\ttemplate <class T> bool parse(Input &i, const Rule &g, const Rule &ws,\n\t ErrorList &el, std::unique_ptr<T> &ast) const\n\t{\n\t\tstd::unique_ptr<ASTNode> node = pegmatite::parse(i, g, ws, el, *this);\n\t\tT *n = node->get_as<T>();\n\t\tif (n)\n\t\t{\n\t\t\tnode.release();\n\t\t\tast.reset(n);\n\t\t\treturn true;\n\t\t}\n\t\treturn false;\n\t}\n};\n\n\/**\n * The `BindAST` class is responsible for \n * The `BindAST` class is responsible for binding an action to a rule. The\n * template argument is the `ASTNode` subclass representing the action. Its\n * `construct()` method will be called when the rule is matched.\n *\/\ntemplate <class T> class BindAST\n{\npublic:\n\t\/**\n\t * Bind the AST class described in the grammar to the rule specified.\n\t *\/\n\tBindAST(const Rule &r)\n\t{\n\t\tASTParserDelegate::bind_parse_proc(r, [](const ParserPosition &b,\n\t\t const ParserPosition &e, void *d)\n\t\t\t{\n\t\t\t\tASTStack *st = reinterpret_cast<ASTStack *>(d);\n\t\t\t\tT *obj = new T();\n\t\t\t\tobj->construct(InputRange(b, e), *st);\n\t\t\t\tst->push_back(std::unique_ptr<ASTNode>(obj));\n\t\t\t});\n\t}\n};\n\n\n} \/\/namespace pegmatite\n\n\n#endif \/\/PEGMATITE_AST_HPP\n<|endoftext|>"} {"text":"<commit_before><commit_msg>passing by reference<commit_after><|endoftext|>"} {"text":"<commit_before>#include \"config.h\"\n#include <cstdlib>\n#include <iostream>\n#include <string>\n#include <fstream>\n#include <sstream>\n#include <cstring>\n\nusing namespace std;\n\n\/\/\/\/ parameters\n\n\/\/ for bam file\nint min_flank_length = 5;\nint min_clip_length = 5;\nint32_t average_read_length = 100;\nint32_t min_bundle_gap = 50;\nint min_num_hits_in_bundle = 20;\nint32_t min_splice_boundary_hits = 1;\nuint32_t min_mapping_quality = 1;\ndouble max_indel_ratio = 0.2;\nint32_t min_subregion_gap = 3;\nint32_t min_subregion_length = 15;\ndouble min_subregion_overlap = 2;\ndouble min_average_overlap = 3.0;\nint min_max_region_overlap = 5;\ndouble min_region_coverage = 0.5;\nint max_num_bundles = -1;\nint tail_coverage = 8;\nint slope_bin_size = 10;\nint slope_bin_num = 30;\nint slope_min_score = 1000;\ndouble slope_min_sigma = 5.0;\nint pseudo_length_count = 10;\nbool use_paired_end = false;\nint max_equations_each_iteration = 50;\ndouble max_ignorable_edge_weight = 10.0;\ndouble max_removable_edge_weight = 5.5;\ndouble min_edge_weight = 1.9;\ndouble min_coverage = 10.0;\nint min_boundary_length = 80;\nint min_boundary_score = 1000;\ndouble min_boundary_sigma = 4.0;\nint32_t partial_exon_length = 100;\n\n\/\/ for algorithm\ndouble join_min_reliability = 0.6;\ndouble infer_min_reliability = 0.6;\ndouble infer_root_reliability = 0.4;\nint max_dp_table_size = 10000;\nint max_num_subsetsum_solutions = 10;\ndouble max_equation_error_ratio = 0.1;\ndouble max_split_error_ratio = 0.1;\ndouble max_router_error_ratio = 0.3;\nint min_router_count = 1;\ndouble min_boundary_edge_weight_ratio = 0.05;\ndouble transcript_min_expression = 1.0;\nint min_hyper_edges_count = 20;\nbool strand_reverse = false;\nbool ignore_single_exon_transcripts = false;\n\n\/\/ for simulation\nint simulation_num_vertices = 0;\nint simulation_num_edges = 0;\nint simulation_max_edge_weight = 0;\n\n\/\/\/\/ from command line\nstring algo = \"shao\";\nstring input_file;\nstring ref_file;\nstring ref_file1;\nstring ref_file2;\nstring output_file;\n\nbool output_tex_files = false;\nstring fixed_gene_name = \"\";\nint min_gtf_transcripts_num = 0;\nbool fast_mode = true;\n\nint print_parameters()\n{\n\t\/\/ for bam file\n\tprintf(\"parameters:\\n\");\n\tprintf(\"min_flank_length = %d\\n\", min_flank_length);\n\tprintf(\"min_clip_length = %d\\n\", min_clip_length);\n\tprintf(\"min_bundle_gap = %d\\n\", min_bundle_gap);\n\tprintf(\"min_subregion_gap = %d\\n\", min_subregion_gap);\n\tprintf(\"min_num_hits_in_bundle = %d\\n\", min_num_hits_in_bundle);\n\tprintf(\"min_splice_boundary_hits = %d\\n\", min_splice_boundary_hits);\n\tprintf(\"min_mapping_quality = %d\\n\", min_mapping_quality);\n\tprintf(\"min_average_overlap = %.2lf\\n\", min_average_overlap);\n\tprintf(\"min_subregion_overlap = %.2lf\\n\", min_subregion_overlap);\n\tprintf(\"max_indel_ratio = %.2lf\\n\", max_indel_ratio);\n\tprintf(\"min_subregion_length = %d\\n\", min_subregion_length);\n\tprintf(\"min_max_region_overlap = %d\\n\", min_max_region_overlap);\n\tprintf(\"min_region_coverage = %.2lf\\n\", min_region_coverage);\n\tprintf(\"max_num_bundles = %d\\n\", max_num_bundles);\n\tprintf(\"tail_coverage = %d\\n\", tail_coverage);\n\tprintf(\"use_paired_end = %c\\n\", use_paired_end ? 'T' : 'F');\n\tprintf(\"slope_bin_size = %d\\n\", slope_bin_size);\n\tprintf(\"slope_bin_num = %d\\n\", slope_bin_num);\n\tprintf(\"slope_min_score = %d\\n\", slope_min_score);\n\tprintf(\"slope_min_sigma = %.2lf\\n\", slope_min_sigma);\n\tprintf(\"average_read_length = %d\\n\", average_read_length);\n\tprintf(\"pseudo_length_count = %d\\n\", pseudo_length_count);\n\tprintf(\"strand_reverse = %c\\n\", strand_reverse ? 'T' : 'F');\n\tprintf(\"ignore_single_exon_transcripts = %c\\n\", ignore_single_exon_transcripts ? 'T' : 'F');\n\tprintf(\"max_ignorable_edge_weight = %.2lf\\n\", max_ignorable_edge_weight);\n\tprintf(\"max_removable_edge_weight = %.2lf\\n\", max_removable_edge_weight);\n\tprintf(\"min_edge_weight = %.2lf\\n\", min_edge_weight);\n\tprintf(\"min_coverage = %.2lf\\n\", min_coverage);\n\tprintf(\"min_boundary_length = %d\\n\", min_boundary_length);\n\tprintf(\"min_boundary_score = %d\\n\", min_boundary_score);\n\tprintf(\"min_boundary_signma = %.2lf\\n\", min_boundary_sigma);\n\tprintf(\"partial_exon_length = %d\\n\", partial_exon_length);\n\n\t\/\/ for algorithm\n\tprintf(\"join_min_reliability = %.2lf\\n\", join_min_reliability);\n\tprintf(\"infer_min_reliability = %.2lf\\n\", infer_min_reliability);\n\tprintf(\"infer_root_reliability = %.2lf\\n\", infer_root_reliability);\n\tprintf(\"max_dp_table_size = %d\\n\", max_dp_table_size);\n\tprintf(\"max_num_subsetsum_solutions = %d\\n\", max_num_subsetsum_solutions);\n\tprintf(\"max_equation_error_ratio = %.2lf\\n\", max_equation_error_ratio);\n\tprintf(\"max_split_error_ratio = %.2lf\\n\", max_split_error_ratio);\n\tprintf(\"max_router_error_ratio = %.2lf\\n\", max_router_error_ratio);\n\tprintf(\"min_router_count = %d\\n\", min_router_count);\n\tprintf(\"min_boundary_edge_weight_ratio = %.2lf\\n\", min_boundary_edge_weight_ratio);\n\tprintf(\"transcript_min_expression = %.2lf\\n\", transcript_min_expression);\n\tprintf(\"min_hyper_edges_count = %d\\n\", min_hyper_edges_count);\n\tprintf(\"max_equations_each_iteration = %d\\n\", max_equations_each_iteration);\n\n\t\/\/ for simulation\n\tprintf(\"simulation_num_vertices = %d\\n\", simulation_num_vertices);\n\tprintf(\"simulation_num_edges = %d\\n\", simulation_num_edges);\n\tprintf(\"simulation_max_edge_weight = %d\\n\", simulation_max_edge_weight);\n\n\t\/\/ for command\n\tprintf(\"algo = %s\\n\", algo.c_str());\n\tprintf(\"input_file = %s\\n\", input_file.c_str());\n\tprintf(\"ref_file = %s\\n\", ref_file.c_str());\n\tprintf(\"ref_file1 = %s\\n\", ref_file1.c_str());\n\tprintf(\"ref_file2 = %s\\n\", ref_file2.c_str());\n\tprintf(\"output_file = %s\\n\", output_file.c_str());\n\tprintf(\"output_tex_files = %c\\n\", output_tex_files ? 'T' : 'F');\n\tprintf(\"fixed_gene_name = %s\\n\", fixed_gene_name.c_str());\n\tprintf(\"min_gtf_transcripts_num = %d\\n\", min_gtf_transcripts_num);\n\tprintf(\"fast_mode = %c\\n\", fast_mode ? 'T' : 'F');\n\tprintf(\"\\n\");\n\n\treturn 0;\n}\n\nbool parse_arguments(int argc, const char ** argv)\n{\n\toutput_tex_files = false;\n\tbool b = false;\n\tfor(int i = 1; i < argc; i++)\n\t{\n\t\tif(string(argv[i]) == \"-a\")\n\t\t{\n\t\t\talgo = string(argv[i + 1]);\n\t\t\ti++;\n\t\t}\n\t\telse if(string(argv[i]) == \"-i\")\n\t\t{\n\t\t\tinput_file = string(argv[i + 1]);\n\t\t\ti++;\n\t\t}\n\t\telse if(string(argv[i]) == \"-o\")\n\t\t{\n\t\t\toutput_file = string(argv[i + 1]);\n\t\t\ti++;\n\t\t}\n\t\telse if(string(argv[i]) == \"-r\")\n\t\t{\n\t\t\tref_file = string(argv[i + 1]);\n\t\t\ti++;\n\t\t}\n\t\telse if(string(argv[i]) == \"-r1\")\n\t\t{\n\t\t\tref_file1 = string(argv[i + 1]);\n\t\t\ti++;\n\t\t}\n\t\telse if(string(argv[i]) == \"-r2\")\n\t\t{\n\t\t\tref_file2 = string(argv[i + 1]);\n\t\t\ti++;\n\t\t}\n\t\telse if(string(argv[i]) == \"-g\")\n\t\t{\n\t\t\tfixed_gene_name = string(argv[i + 1]);\n\t\t\ti++;\n\t\t}\n\t\telse if(string(argv[i]) == \"-t\")\n\t\t{\n\t\t\toutput_tex_files = true;\n\t\t}\n\t\telse if(string(argv[i]) == \"-p\")\n\t\t{\n\t\t\tuse_paired_end = true;\n\t\t}\n\t\telse if(string(argv[i]) == \"-RF\")\n\t\t{\n\t\t\tstrand_reverse = true;\n\t\t}\n\t\telse if(string(argv[i]) == \"-m\")\n\t\t{\n\t\t\tignore_single_exon_transcripts = true;\n\t\t}\n\t\telse if(string(argv[i]) == \"-x\")\n\t\t{\n\t\t\tmin_edge_weight = atof(argv[i + 1]);\n\t\t\ti++;\n\t\t}\n\t}\n\n\treturn b;\n}\n<commit_msg>set default min_edeg_weight to 2.9<commit_after>#include \"config.h\"\n#include <cstdlib>\n#include <iostream>\n#include <string>\n#include <fstream>\n#include <sstream>\n#include <cstring>\n\nusing namespace std;\n\n\/\/\/\/ parameters\n\n\/\/ for bam file\nint min_flank_length = 5;\nint min_clip_length = 5;\nint32_t average_read_length = 100;\nint32_t min_bundle_gap = 50;\nint min_num_hits_in_bundle = 20;\nint32_t min_splice_boundary_hits = 1;\nuint32_t min_mapping_quality = 1;\ndouble max_indel_ratio = 0.2;\nint32_t min_subregion_gap = 3;\nint32_t min_subregion_length = 15;\ndouble min_subregion_overlap = 2;\ndouble min_average_overlap = 3.0;\nint min_max_region_overlap = 5;\ndouble min_region_coverage = 0.5;\nint max_num_bundles = -1;\nint tail_coverage = 8;\nint slope_bin_size = 10;\nint slope_bin_num = 30;\nint slope_min_score = 1000;\ndouble slope_min_sigma = 5.0;\nint pseudo_length_count = 10;\nbool use_paired_end = false;\nint max_equations_each_iteration = 50;\ndouble max_ignorable_edge_weight = 10.0;\ndouble max_removable_edge_weight = 5.5;\ndouble min_edge_weight = 2.9;\ndouble min_coverage = 10.0;\nint min_boundary_length = 80;\nint min_boundary_score = 1000;\ndouble min_boundary_sigma = 4.0;\nint32_t partial_exon_length = 100;\n\n\/\/ for algorithm\ndouble join_min_reliability = 0.6;\ndouble infer_min_reliability = 0.6;\ndouble infer_root_reliability = 0.4;\nint max_dp_table_size = 10000;\nint max_num_subsetsum_solutions = 10;\ndouble max_equation_error_ratio = 0.1;\ndouble max_split_error_ratio = 0.1;\ndouble max_router_error_ratio = 0.3;\nint min_router_count = 1;\ndouble min_boundary_edge_weight_ratio = 0.05;\ndouble transcript_min_expression = 1.0;\nint min_hyper_edges_count = 20;\nbool strand_reverse = false;\nbool ignore_single_exon_transcripts = false;\n\n\/\/ for simulation\nint simulation_num_vertices = 0;\nint simulation_num_edges = 0;\nint simulation_max_edge_weight = 0;\n\n\/\/\/\/ from command line\nstring algo = \"shao\";\nstring input_file;\nstring ref_file;\nstring ref_file1;\nstring ref_file2;\nstring output_file;\n\nbool output_tex_files = false;\nstring fixed_gene_name = \"\";\nint min_gtf_transcripts_num = 0;\nbool fast_mode = true;\n\nint print_parameters()\n{\n\t\/\/ for bam file\n\tprintf(\"parameters:\\n\");\n\tprintf(\"min_flank_length = %d\\n\", min_flank_length);\n\tprintf(\"min_clip_length = %d\\n\", min_clip_length);\n\tprintf(\"min_bundle_gap = %d\\n\", min_bundle_gap);\n\tprintf(\"min_subregion_gap = %d\\n\", min_subregion_gap);\n\tprintf(\"min_num_hits_in_bundle = %d\\n\", min_num_hits_in_bundle);\n\tprintf(\"min_splice_boundary_hits = %d\\n\", min_splice_boundary_hits);\n\tprintf(\"min_mapping_quality = %d\\n\", min_mapping_quality);\n\tprintf(\"min_average_overlap = %.2lf\\n\", min_average_overlap);\n\tprintf(\"min_subregion_overlap = %.2lf\\n\", min_subregion_overlap);\n\tprintf(\"max_indel_ratio = %.2lf\\n\", max_indel_ratio);\n\tprintf(\"min_subregion_length = %d\\n\", min_subregion_length);\n\tprintf(\"min_max_region_overlap = %d\\n\", min_max_region_overlap);\n\tprintf(\"min_region_coverage = %.2lf\\n\", min_region_coverage);\n\tprintf(\"max_num_bundles = %d\\n\", max_num_bundles);\n\tprintf(\"tail_coverage = %d\\n\", tail_coverage);\n\tprintf(\"use_paired_end = %c\\n\", use_paired_end ? 'T' : 'F');\n\tprintf(\"slope_bin_size = %d\\n\", slope_bin_size);\n\tprintf(\"slope_bin_num = %d\\n\", slope_bin_num);\n\tprintf(\"slope_min_score = %d\\n\", slope_min_score);\n\tprintf(\"slope_min_sigma = %.2lf\\n\", slope_min_sigma);\n\tprintf(\"average_read_length = %d\\n\", average_read_length);\n\tprintf(\"pseudo_length_count = %d\\n\", pseudo_length_count);\n\tprintf(\"strand_reverse = %c\\n\", strand_reverse ? 'T' : 'F');\n\tprintf(\"ignore_single_exon_transcripts = %c\\n\", ignore_single_exon_transcripts ? 'T' : 'F');\n\tprintf(\"max_ignorable_edge_weight = %.2lf\\n\", max_ignorable_edge_weight);\n\tprintf(\"max_removable_edge_weight = %.2lf\\n\", max_removable_edge_weight);\n\tprintf(\"min_edge_weight = %.2lf\\n\", min_edge_weight);\n\tprintf(\"min_coverage = %.2lf\\n\", min_coverage);\n\tprintf(\"min_boundary_length = %d\\n\", min_boundary_length);\n\tprintf(\"min_boundary_score = %d\\n\", min_boundary_score);\n\tprintf(\"min_boundary_signma = %.2lf\\n\", min_boundary_sigma);\n\tprintf(\"partial_exon_length = %d\\n\", partial_exon_length);\n\n\t\/\/ for algorithm\n\tprintf(\"join_min_reliability = %.2lf\\n\", join_min_reliability);\n\tprintf(\"infer_min_reliability = %.2lf\\n\", infer_min_reliability);\n\tprintf(\"infer_root_reliability = %.2lf\\n\", infer_root_reliability);\n\tprintf(\"max_dp_table_size = %d\\n\", max_dp_table_size);\n\tprintf(\"max_num_subsetsum_solutions = %d\\n\", max_num_subsetsum_solutions);\n\tprintf(\"max_equation_error_ratio = %.2lf\\n\", max_equation_error_ratio);\n\tprintf(\"max_split_error_ratio = %.2lf\\n\", max_split_error_ratio);\n\tprintf(\"max_router_error_ratio = %.2lf\\n\", max_router_error_ratio);\n\tprintf(\"min_router_count = %d\\n\", min_router_count);\n\tprintf(\"min_boundary_edge_weight_ratio = %.2lf\\n\", min_boundary_edge_weight_ratio);\n\tprintf(\"transcript_min_expression = %.2lf\\n\", transcript_min_expression);\n\tprintf(\"min_hyper_edges_count = %d\\n\", min_hyper_edges_count);\n\tprintf(\"max_equations_each_iteration = %d\\n\", max_equations_each_iteration);\n\n\t\/\/ for simulation\n\tprintf(\"simulation_num_vertices = %d\\n\", simulation_num_vertices);\n\tprintf(\"simulation_num_edges = %d\\n\", simulation_num_edges);\n\tprintf(\"simulation_max_edge_weight = %d\\n\", simulation_max_edge_weight);\n\n\t\/\/ for command\n\tprintf(\"algo = %s\\n\", algo.c_str());\n\tprintf(\"input_file = %s\\n\", input_file.c_str());\n\tprintf(\"ref_file = %s\\n\", ref_file.c_str());\n\tprintf(\"ref_file1 = %s\\n\", ref_file1.c_str());\n\tprintf(\"ref_file2 = %s\\n\", ref_file2.c_str());\n\tprintf(\"output_file = %s\\n\", output_file.c_str());\n\tprintf(\"output_tex_files = %c\\n\", output_tex_files ? 'T' : 'F');\n\tprintf(\"fixed_gene_name = %s\\n\", fixed_gene_name.c_str());\n\tprintf(\"min_gtf_transcripts_num = %d\\n\", min_gtf_transcripts_num);\n\tprintf(\"fast_mode = %c\\n\", fast_mode ? 'T' : 'F');\n\tprintf(\"\\n\");\n\n\treturn 0;\n}\n\nbool parse_arguments(int argc, const char ** argv)\n{\n\toutput_tex_files = false;\n\tbool b = false;\n\tfor(int i = 1; i < argc; i++)\n\t{\n\t\tif(string(argv[i]) == \"-a\")\n\t\t{\n\t\t\talgo = string(argv[i + 1]);\n\t\t\ti++;\n\t\t}\n\t\telse if(string(argv[i]) == \"-i\")\n\t\t{\n\t\t\tinput_file = string(argv[i + 1]);\n\t\t\ti++;\n\t\t}\n\t\telse if(string(argv[i]) == \"-o\")\n\t\t{\n\t\t\toutput_file = string(argv[i + 1]);\n\t\t\ti++;\n\t\t}\n\t\telse if(string(argv[i]) == \"-r\")\n\t\t{\n\t\t\tref_file = string(argv[i + 1]);\n\t\t\ti++;\n\t\t}\n\t\telse if(string(argv[i]) == \"-r1\")\n\t\t{\n\t\t\tref_file1 = string(argv[i + 1]);\n\t\t\ti++;\n\t\t}\n\t\telse if(string(argv[i]) == \"-r2\")\n\t\t{\n\t\t\tref_file2 = string(argv[i + 1]);\n\t\t\ti++;\n\t\t}\n\t\telse if(string(argv[i]) == \"-g\")\n\t\t{\n\t\t\tfixed_gene_name = string(argv[i + 1]);\n\t\t\ti++;\n\t\t}\n\t\telse if(string(argv[i]) == \"-t\")\n\t\t{\n\t\t\toutput_tex_files = true;\n\t\t}\n\t\telse if(string(argv[i]) == \"-p\")\n\t\t{\n\t\t\tuse_paired_end = true;\n\t\t}\n\t\telse if(string(argv[i]) == \"-RF\")\n\t\t{\n\t\t\tstrand_reverse = true;\n\t\t}\n\t\telse if(string(argv[i]) == \"-m\")\n\t\t{\n\t\t\tignore_single_exon_transcripts = true;\n\t\t}\n\t\telse if(string(argv[i]) == \"-x\")\n\t\t{\n\t\t\tmin_edge_weight = atof(argv[i + 1]);\n\t\t\ti++;\n\t\t}\n\t}\n\n\treturn b;\n}\n<|endoftext|>"} {"text":"<commit_before>\/**\n* Client Key Exchange Message \n* (C) 2004-2008 Jack Lloyd\n*\n* Released under the terms of the Botan license\n*\/\n\n#include <botan\/tls_messages.h>\n#include <botan\/dh.h>\n#include <botan\/rsa.h>\n#include <botan\/rng.h>\n#include <botan\/look_pk.h>\n#include <botan\/loadstor.h>\n#include <memory>\n\nnamespace Botan {\n\n\/**\n* Create a new Client Key Exchange message\n*\/\nClient_Key_Exchange::Client_Key_Exchange(RandomNumberGenerator& rng,\n Record_Writer& writer,\n HandshakeHash& hash,\n const Public_Key* pub_key,\n Version_Code using_version,\n Version_Code pref_version)\n {\n const DH_PublicKey* dh_pub = dynamic_cast<const DH_PublicKey*>(pub_key);\n const RSA_PublicKey* rsa_pub = dynamic_cast<const RSA_PublicKey*>(pub_key);\n\n include_length = true;\n\n if(dh_pub)\n {\n DH_PrivateKey priv_key(rng, dh_pub->get_domain());\n pre_master = priv_key.derive_key(dh_pub->get_y());\n key_material = priv_key.public_value();\n }\n else if(rsa_pub)\n {\n pre_master.resize(48);\n rng.randomize(pre_master, 48);\n pre_master[0] = (pref_version >> 8) & 0xFF;\n pre_master[1] = (pref_version ) & 0xFF;\n\n std::auto_ptr<PK_Encryptor> encryptor(get_pk_encryptor(*rsa_pub,\n \"PKCS1v15\"));\n\n key_material = encryptor->encrypt(pre_master, rng);\n\n if(using_version == SSL_V3)\n include_length = false;\n }\n else\n throw Invalid_Argument(\"Client_Key_Exchange: Key not RSA or DH\");\n\n send(writer, hash);\n }\n\n\/**\n* Read a Client Key Exchange message\n*\/\nClient_Key_Exchange::Client_Key_Exchange(const MemoryRegion<byte>& contents,\n const CipherSuite& suite,\n Version_Code using_version)\n {\n include_length = true;\n\n if(using_version == SSL_V3 &&\n (suite.kex_type() == CipherSuite::NO_KEX ||\n suite.kex_type() == CipherSuite::RSA_KEX))\n include_length = false;\n\n deserialize(contents);\n }\n\n\/**\n* Serialize a Client Key Exchange message\n*\/\nSecureVector<byte> Client_Key_Exchange::serialize() const\n {\n SecureVector<byte> buf;\n\n if(include_length)\n {\n u16bit key_size = key_material.size();\n buf.append(get_byte(0, key_size));\n buf.append(get_byte(1, key_size));\n }\n buf.append(key_material);\n\n return buf;\n }\n\n\/**\n* Deserialize a Client Key Exchange message\n*\/\nvoid Client_Key_Exchange::deserialize(const MemoryRegion<byte>& buf)\n {\n if(include_length)\n {\n if(buf.size() < 2)\n throw Decoding_Error(\"Client_Key_Exchange: Packet corrupted\");\n\n u32bit size = make_u16bit(buf[0], buf[1]);\n if(size + 2 != buf.size())\n throw Decoding_Error(\"Client_Key_Exchange: Packet corrupted\");\n\n key_material.set(buf + 2, size);\n }\n else\n key_material = buf;\n }\n\n\/**\n* Return the pre_master_secret\n*\/\nSecureVector<byte>\nClient_Key_Exchange::pre_master_secret(RandomNumberGenerator& rng,\n const Private_Key* priv_key,\n Version_Code version)\n {\n const DH_PrivateKey* dh_priv = dynamic_cast<const DH_PrivateKey*>(priv_key);\n const RSA_PrivateKey* rsa_priv =\n dynamic_cast<const RSA_PrivateKey*>(priv_key);\n\n if(dh_priv)\n {\n try {\n pre_master = dh_priv->derive_key(key_material, key_material.size());\n }\n catch(...)\n {\n pre_master.resize(dh_priv->public_value().size());\n rng.randomize(pre_master, pre_master.size());\n }\n\n return pre_master;\n }\n else if(rsa_priv)\n {\n std::auto_ptr<PK_Decryptor> decryptor(get_pk_decryptor(*rsa_priv,\n \"PKCS1v15\"));\n\n try {\n pre_master = decryptor->decrypt(key_material);\n\n if(pre_master.size() != 48 ||\n make_u16bit(pre_master[0], pre_master[1]) != version)\n throw Decoding_Error(\"Client_Key_Exchange: Secret corrupted\");\n }\n catch(std::exception)\n {\n pre_master.resize(48);\n rng.randomize(pre_master, pre_master.size());\n pre_master[0] = (version >> 8) & 0xFF;\n pre_master[1] = (version ) & 0xFF;\n }\n\n return pre_master;\n }\n else\n throw Invalid_Argument(\"Client_Key_Exchange: Bad key for decrypt\");\n }\n\n\/**\n* Return the pre_master_secret\n*\/\nSecureVector<byte> Client_Key_Exchange::pre_master_secret() const\n {\n return pre_master;\n }\n\n}\n<commit_msg>Client_Key_Exchange needs modification for DH changes<commit_after>\/**\n* Client Key Exchange Message\n* (C) 2004-2010 Jack Lloyd\n*\n* Released under the terms of the Botan license\n*\/\n\n#include <botan\/tls_messages.h>\n#include <botan\/dh.h>\n#include <botan\/rsa.h>\n#include <botan\/rng.h>\n#include <botan\/look_pk.h>\n#include <botan\/loadstor.h>\n#include <memory>\n\nnamespace Botan {\n\n\/**\n* Create a new Client Key Exchange message\n*\/\nClient_Key_Exchange::Client_Key_Exchange(RandomNumberGenerator& rng,\n Record_Writer& writer,\n HandshakeHash& hash,\n const Public_Key* pub_key,\n Version_Code using_version,\n Version_Code pref_version)\n {\n include_length = true;\n\n if(const DH_PublicKey* dh_pub = dynamic_cast<const DH_PublicKey*>(pub_key))\n {\n DH_PrivateKey priv_key(rng, dh_pub->get_domain());\n\n std::auto_ptr<PK_Key_Agreement> ka(get_pk_kas(priv_key, \"Raw\"));\n\n pre_master = ka->derive_key(0, dh_pub->public_value()).bits_of();\n\n key_material = priv_key.public_value();\n }\n else if(const RSA_PublicKey* rsa_pub = dynamic_cast<const RSA_PublicKey*>(pub_key))\n {\n pre_master.resize(48);\n rng.randomize(pre_master, 48);\n pre_master[0] = (pref_version >> 8) & 0xFF;\n pre_master[1] = (pref_version ) & 0xFF;\n\n std::auto_ptr<PK_Encryptor> encryptor(get_pk_encryptor(*rsa_pub,\n \"PKCS1v15\"));\n\n key_material = encryptor->encrypt(pre_master, rng);\n\n if(using_version == SSL_V3)\n include_length = false;\n }\n else\n throw Invalid_Argument(\"Client_Key_Exchange: Key not RSA or DH\");\n\n send(writer, hash);\n }\n\n\/**\n* Read a Client Key Exchange message\n*\/\nClient_Key_Exchange::Client_Key_Exchange(const MemoryRegion<byte>& contents,\n const CipherSuite& suite,\n Version_Code using_version)\n {\n include_length = true;\n\n if(using_version == SSL_V3 &&\n (suite.kex_type() == CipherSuite::NO_KEX ||\n suite.kex_type() == CipherSuite::RSA_KEX))\n include_length = false;\n\n deserialize(contents);\n }\n\n\/**\n* Serialize a Client Key Exchange message\n*\/\nSecureVector<byte> Client_Key_Exchange::serialize() const\n {\n SecureVector<byte> buf;\n\n if(include_length)\n {\n u16bit key_size = key_material.size();\n buf.append(get_byte(0, key_size));\n buf.append(get_byte(1, key_size));\n }\n buf.append(key_material);\n\n return buf;\n }\n\n\/**\n* Deserialize a Client Key Exchange message\n*\/\nvoid Client_Key_Exchange::deserialize(const MemoryRegion<byte>& buf)\n {\n if(include_length)\n {\n if(buf.size() < 2)\n throw Decoding_Error(\"Client_Key_Exchange: Packet corrupted\");\n\n u32bit size = make_u16bit(buf[0], buf[1]);\n if(size + 2 != buf.size())\n throw Decoding_Error(\"Client_Key_Exchange: Packet corrupted\");\n\n key_material.set(buf + 2, size);\n }\n else\n key_material = buf;\n }\n\n\/**\n* Return the pre_master_secret\n*\/\nSecureVector<byte>\nClient_Key_Exchange::pre_master_secret(RandomNumberGenerator& rng,\n const Private_Key* priv_key,\n Version_Code version)\n {\n\n if(const DH_PrivateKey* dh_priv = dynamic_cast<const DH_PrivateKey*>(priv_key))\n {\n try {\n std::auto_ptr<PK_Key_Agreement> ka(get_pk_kas(*dh_priv, \"Raw\"));\n\n pre_master = ka->derive_key(0, key_material).bits_of();\n }\n catch(...)\n {\n pre_master.resize(dh_priv->public_value().size());\n rng.randomize(pre_master, pre_master.size());\n }\n\n return pre_master;\n }\n else if(const RSA_PrivateKey* rsa_priv = dynamic_cast<const RSA_PrivateKey*>(priv_key))\n {\n std::auto_ptr<PK_Decryptor> decryptor(get_pk_decryptor(*rsa_priv,\n \"PKCS1v15\"));\n\n try {\n pre_master = decryptor->decrypt(key_material);\n\n if(pre_master.size() != 48 ||\n make_u16bit(pre_master[0], pre_master[1]) != version)\n throw Decoding_Error(\"Client_Key_Exchange: Secret corrupted\");\n }\n catch(std::exception)\n {\n pre_master.resize(48);\n rng.randomize(pre_master, pre_master.size());\n pre_master[0] = (version >> 8) & 0xFF;\n pre_master[1] = (version ) & 0xFF;\n }\n\n return pre_master;\n }\n else\n throw Invalid_Argument(\"Client_Key_Exchange: Bad key for decrypt\");\n }\n\n\/**\n* Return the pre_master_secret\n*\/\nSecureVector<byte> Client_Key_Exchange::pre_master_secret() const\n {\n return pre_master;\n }\n\n}\n<|endoftext|>"} {"text":"<commit_before>\/*\n starfield.cpp\n Classic Invaders\n\n Copyright (c) 2013, Todd Steinackle, Simon Que\n All rights reserved.\n\n Redistribution and use in source and binary forms, with or without modification, are permitted\n provided that the following conditions are met:\n\n * Redistributions of source code must retain the above copyright notice, this list of conditions\n 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 documentation and\/or other\n materials provided with the distribution.\n\n * Neither the name of The No Quarter Arcade (http:\/\/www.noquarterarcade.com\/) nor the names of\n its contributors 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 ANY EXPRESS OR\n IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND\n FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR\n CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL\n DAMAGES (INCLUDING, 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 LIABILITY, WHETHER\n IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF\n THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.\n\n*\/\n\n#include \"starfield.h\"\n\n#include <stdio.h>\n#include <stdlib.h>\n#include <string.h>\n\n#ifdef __AVR__\n#include \"cc_core.h\"\n#include \"cc_tile_layer.h\"\n#endif\n\n#include \"screen.h\"\n\n#define MAX_LINE_SIZE 64\n#define TILEMAP_WIDTH 32\n#define TILEMAP_HEIGHT 32\n\n\/\/ Generates randomized starfield tiles and tilemap.\nvoid generate_starfield(Graphics::Screen* screen,\n uint8_t layer, uint8_t palette,\n uint8_t tile_width, uint8_t tile_height,\n uint8_t num_tiles, uint16_t num_stars,\n uint8_t min_brightness, uint8_t max_brightness) {\n if (tile_width > MAX_LINE_SIZE) {\n fprintf(stderr, \"Starfield tiles cannot be wider than %u pixels.\\n\",\n MAX_LINE_SIZE);\n return;\n }\n if (max_brightness < min_brightness) {\n fprintf(stderr, \" Min brightness must be lower than max brightness.\\n\");\n return;\n }\n\n#ifdef __AVR__\n \/\/ Allocate space in VRAM.\n uint16_t vram_base;\n uint16_t tile_size = tile_width * tile_height;\n if (!screen->allocate_vram(tile_size * num_tiles, &vram_base)) {\n fprintf(stderr, \"Could not allocate %u bytes in VRAM\\n\",\n tile_size * num_tiles);\n return;\n }\n\n \/\/ Generate the tiles.\n uint16_t offset = 0;\n for (uint8_t i = 0; i < num_tiles; ++i) {\n uint8_t buffer[MAX_LINE_SIZE];\n for (uint8_t y = 0; y < tile_height; ++y, offset += tile_width) {\n memset(buffer, 0, tile_width);\n for (uint8_t x = 0; x < tile_width; ++x) {\n uint16_t rand_num = rand() % (tile_width * tile_height);\n if (rand_num >= num_stars) {\n continue;\n }\n uint8_t brightness = min_brightness +\n (uint8_t)rand() % (max_brightness - min_brightness + 1);\n buffer[x] = brightness;\n }\n CC_SetVRAMData(buffer, vram_base + offset, tile_width);\n }\n }\n\n for (uint8_t y = 0; y < TILEMAP_HEIGHT; ++y) {\n uint16_t buffer[TILEMAP_WIDTH];\n for (uint8_t x = 0; x < TILEMAP_WIDTH; ++x)\n buffer[x] = rand() % num_tiles;\n screen->set_tilemap_data(layer, 0, y, buffer, sizeof(buffer));\n }\n\n \/\/ Set up grayscale palette.\n for (uint8_t color = 0; true ; ++color) {\n screen->set_palette_entry(palette, color, color, color, color);\n if (color == 0xff)\n break;\n }\n\n \/\/ Set up and enable the tile layer and tile map.\n screen->setup_tile_layer(layer, true, palette, vram_base, 0);\n#endif \/\/ defined (__AVR__)\n}\n<commit_msg>Convert starfield to Arduino<commit_after>\/*\n starfield.cpp\n Classic Invaders\n\n Copyright (c) 2013, Todd Steinackle, Simon Que\n All rights reserved.\n\n Redistribution and use in source and binary forms, with or without modification, are permitted\n provided that the following conditions are met:\n\n * Redistributions of source code must retain the above copyright notice, this list of conditions\n 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 documentation and\/or other\n materials provided with the distribution.\n\n * Neither the name of The No Quarter Arcade (http:\/\/www.noquarterarcade.com\/) nor the names of\n its contributors 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 ANY EXPRESS OR\n IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND\n FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR\n CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL\n DAMAGES (INCLUDING, 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 LIABILITY, WHETHER\n IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF\n THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.\n\n*\/\n\n#include \"starfield.h\"\n\n#include <stdio.h>\n#include <stdlib.h>\n#include <string.h>\n\n#include <DuinoCube.h>\n\n#include \"screen.h\"\n\n#define MAX_LINE_SIZE 64\n#define TILEMAP_WIDTH 32\n#define TILEMAP_HEIGHT 32\n\n\/\/ Generates randomized starfield tiles and tilemap.\nvoid generate_starfield(Graphics::Screen* screen,\n uint8_t layer, uint8_t palette,\n uint8_t tile_width, uint8_t tile_height,\n uint8_t num_tiles, uint16_t num_stars,\n uint8_t min_brightness, uint8_t max_brightness) {\n if (tile_width > MAX_LINE_SIZE) {\n fprintf(stderr, \"Starfield tiles cannot be wider than %u pixels.\\n\",\n MAX_LINE_SIZE);\n return;\n }\n if (max_brightness < min_brightness) {\n fprintf(stderr, \" Min brightness must be lower than max brightness.\\n\");\n return;\n }\n\n \/\/ Allocate space in VRAM.\n uint16_t vram_base;\n uint16_t tile_size = tile_width * tile_height;\n if (!screen->allocate_vram(tile_size * num_tiles, &vram_base)) {\n fprintf(stderr, \"Could not allocate %u bytes in VRAM\\n\",\n tile_size * num_tiles);\n return;\n }\n DC.Core.writeWord(REG_SYS_CTRL, (1 << REG_SYS_CTRL_VRAM_ACCESS));\n DC.Core.writeWord(REG_MEM_BANK,\n VRAM_BANK_BEGIN + vram_base \/ VRAM_BANK_SIZE);\n\n \/\/ Generate the tiles.\n uint16_t offset = 0;\n for (uint8_t i = 0; i < num_tiles; ++i) {\n uint8_t buffer[MAX_LINE_SIZE];\n for (uint8_t y = 0; y < tile_height; ++y, offset += tile_width) {\n memset(buffer, 0, tile_width);\n for (uint8_t x = 0; x < tile_width; ++x) {\n uint16_t rand_num = rand() % (tile_width * tile_height);\n if (rand_num >= num_stars) {\n continue;\n }\n uint8_t brightness = min_brightness +\n (uint8_t)rand() % (max_brightness - min_brightness + 1);\n buffer[x] = brightness;\n }\n printf(\"Writing %d bytes of starfield data to 0x%04x\\n\",\n vram_base + offset);\n DC.Core.writeData(vram_base + offset, buffer, tile_width);\n }\n }\n DC.Core.writeWord(REG_SYS_CTRL, (0 << REG_SYS_CTRL_VRAM_ACCESS));\n\n DC.Core.writeWord(REG_MEM_BANK, TILEMAP_BANK);\n\n for (uint8_t y = 0; y < TILEMAP_HEIGHT; ++y) {\n uint16_t buffer[TILEMAP_WIDTH];\n for (uint8_t x = 0; x < TILEMAP_WIDTH; ++x)\n buffer[x] = rand() % num_tiles;\n screen->set_tilemap_data(layer, 0, y, buffer, sizeof(buffer));\n }\n\n \/\/ Set up grayscale palette.\n for (uint8_t color = 0; true ; ++color) {\n screen->set_palette_entry(palette, color, color, color, color);\n if (color == 0xff)\n break;\n }\n\n \/\/ Set up and enable the tile layer and tile map.\n screen->setup_tile_layer(layer, true, palette, vram_base, 0);\n}\n<|endoftext|>"} {"text":"<commit_before>#include \"system\/env.h\"\n#include \"system\/van.h\"\n#include \"base\/common.h\"\n#include \"base\/local_machine.h\"\n#include \"base\/file.h\"\n\/\/ #include \"data\/common.h\"\n#include \"proto\/node.pb.h\"\nnamespace ps {\n\nDEFINE_int32(num_servers, 0, \"number of servers\");\nDEFINE_int32(num_workers, 0, \"number of clients\");\nDEFINE_int32(num_threads, 2, \"number of computational threads\");\nDEFINE_int32(num_replicas, 0, \"number of replicas per server node\");\n\nDEFINE_string(my_node, \"role:SCHEDULER,hostname:'127.0.0.1',port:8000,id:'H'\", \"my node\");\nDEFINE_string(scheduler, \"role:SCHEDULER,hostname:'127.0.0.1',port:8000,id:'H'\", \"the scheduler node\");\nDEFINE_int32(my_rank, -1, \"my rank among MPI peers\");\nDEFINE_string(interface, \"\", \"network interface\");\n\nvoid Env::Init(char* argv0) {\n if (getenv(\"DMLC_PS_ROOT_URI\")) {\n InitDMLC();\n }\n\n InitGlog(argv0);\n}\n\nvoid Env::InitGlog(char* argv0) {\n if (FLAGS_log_dir.empty()) FLAGS_log_dir = \"\/tmp\";\n if (!dirExists(FLAGS_log_dir)) { createDir(FLAGS_log_dir); }\n \/\/ change the hostname in default log filename to node id\n string logfile = FLAGS_log_dir + \"\/\" + string(basename(argv0)) + \".\"\n + Van::ParseNode(FLAGS_my_node).id() + \".log.\";\n google::SetLogDestination(google::INFO, (logfile+\"INFO.\").c_str());\n google::SetLogDestination(google::WARNING, (logfile+\"WARNING.\").c_str());\n google::SetLogDestination(google::ERROR, (logfile+\"ERROR.\").c_str());\n google::SetLogDestination(google::FATAL, (logfile+\"FATAL.\").c_str());\n google::SetLogSymlink(google::INFO, \"\");\n google::SetLogSymlink(google::WARNING, \"\");\n google::SetLogSymlink(google::ERROR, \"\");\n google::SetLogSymlink(google::FATAL, \"\");\n FLAGS_logbuflevel = -1;\n}\n\nvoid Env::InitDMLC() {\n Node scheduler;\n scheduler.set_hostname(std::string(CHECK_NOTNULL(getenv(\"DMLC_PS_ROOT_URI\"))));\n scheduler.set_port(atoi(CHECK_NOTNULL(getenv(\"DMLC_PS_ROOT_PORT\"))));\n scheduler.set_role(Node::SCHEDULER);\n scheduler.set_id(\"H\");\n CHECK(google::protobuf::TextFormat::PrintToString(scheduler, &FLAGS_scheduler));\n\n FLAGS_num_workers = atoi(CHECK_NOTNULL(getenv(\"DMLC_NUM_WORKER\")));\n FLAGS_num_servers = atoi(CHECK_NOTNULL(getenv(\"DMLC_NUM_SERVER\")));\n\n AssembleMyNode();\n}\n\nvoid Env::AssembleMyNode() {\n \/\/ get my role\n char* role_str = getenv(\"DMLC_ROLE\");\n Node::Role role;\n string id;\n if (role_str != NULL) {\n if (!strcmp(role_str, \"scheduler\")) {\n FLAGS_my_node = FLAGS_scheduler;\n return;\n } else if (!strcmp(role_str, \"worker\")) {\n role = Node::WORKER;\n } else if (!strcmp(role_str, \"server\")) {\n role = Node::SERVER;\n } else {\n LOG(FATAL) << \"unknown role: \" << *role_str;\n }\n } else {\n int my_rank;\n char* rank_str = getenv(\"PMI_RANK\");\n if (!rank_str) {\n rank_str = getenv(\"OMPI_COMM_WORLD_RANK\");\n }\n CHECK(rank_str != NULL) << \"fail to get rank size\";\n my_rank = atoi(rank_str);\n\n \/\/ role and id\n CHECK_LT(my_rank, FLAGS_num_workers + FLAGS_num_servers);\n if (my_rank < FLAGS_num_workers) {\n role = Node::WORKER;\n id = \"W\" + std::to_string(my_rank);\n } else { \/\/ if (my_rank < FLAGS_num_workers + FLAGS_num_servers) {\n role = Node::SERVER;\n id = \"S\" + std::to_string(FLAGS_my_rank - FLAGS_num_workers);\n }\n }\n\n Node node; node.set_role(role);\n if (!id.empty()) node.set_id(id);\n\n \/\/ IP, port and interface\n string ip;\n string interface = FLAGS_interface;\n unsigned short port;\n\n if (interface.empty()) {\n LocalMachine::pickupAvailableInterfaceAndIP(interface, ip);\n } else {\n ip = LocalMachine::IP(interface);\n }\n CHECK(!ip.empty()) << \"failed to got ip\";\n CHECK(!interface.empty()) << \"failed to got the interface\";\n port = LocalMachine::pickupAvailablePort();\n CHECK_NE(port, 0) << \"failed to get port\";\n node.set_hostname(ip);\n node.set_port(static_cast<int32>(port));\n\n CHECK(google::protobuf::TextFormat::PrintToString(node, &FLAGS_my_node));\n}\n\n\n\n} \/\/ namespace ps\n<commit_msg>fix bug in env when launching using dmlc-*.py with multiple servers<commit_after>#include \"system\/env.h\"\n#include \"system\/van.h\"\n#include \"base\/common.h\"\n#include \"base\/local_machine.h\"\n#include \"base\/file.h\"\n\/\/ #include \"data\/common.h\"\n#include \"proto\/node.pb.h\"\nnamespace ps {\n\nDEFINE_int32(num_servers, 0, \"number of servers\");\nDEFINE_int32(num_workers, 0, \"number of clients\");\nDEFINE_int32(num_threads, 2, \"number of computational threads\");\nDEFINE_int32(num_replicas, 0, \"number of replicas per server node\");\n\nDEFINE_string(my_node, \"role:SCHEDULER,hostname:'127.0.0.1',port:8000,id:'H'\", \"my node\");\nDEFINE_string(scheduler, \"role:SCHEDULER,hostname:'127.0.0.1',port:8000,id:'H'\", \"the scheduler node\");\nDEFINE_int32(my_rank, -1, \"my rank among MPI peers\");\nDEFINE_string(interface, \"\", \"network interface\");\n\nvoid Env::Init(char* argv0) {\n if (getenv(\"DMLC_PS_ROOT_URI\")) {\n InitDMLC();\n }\n\n InitGlog(argv0);\n}\n\nvoid Env::InitGlog(char* argv0) {\n if (FLAGS_log_dir.empty()) FLAGS_log_dir = \"\/tmp\";\n if (!dirExists(FLAGS_log_dir)) { createDir(FLAGS_log_dir); }\n \/\/ change the hostname in default log filename to node id\n string logfile = FLAGS_log_dir + \"\/\" + string(basename(argv0)) + \".\"\n + Van::ParseNode(FLAGS_my_node).id() + \".log.\";\n google::SetLogDestination(google::INFO, (logfile+\"INFO.\").c_str());\n google::SetLogDestination(google::WARNING, (logfile+\"WARNING.\").c_str());\n google::SetLogDestination(google::ERROR, (logfile+\"ERROR.\").c_str());\n google::SetLogDestination(google::FATAL, (logfile+\"FATAL.\").c_str());\n google::SetLogSymlink(google::INFO, \"\");\n google::SetLogSymlink(google::WARNING, \"\");\n google::SetLogSymlink(google::ERROR, \"\");\n google::SetLogSymlink(google::FATAL, \"\");\n FLAGS_logbuflevel = -1;\n}\n\nvoid Env::InitDMLC() {\n Node scheduler;\n scheduler.set_hostname(std::string(CHECK_NOTNULL(getenv(\"DMLC_PS_ROOT_URI\"))));\n scheduler.set_port(atoi(CHECK_NOTNULL(getenv(\"DMLC_PS_ROOT_PORT\"))));\n scheduler.set_role(Node::SCHEDULER);\n scheduler.set_id(\"H\");\n CHECK(google::protobuf::TextFormat::PrintToString(scheduler, &FLAGS_scheduler));\n\n FLAGS_num_workers = atoi(CHECK_NOTNULL(getenv(\"DMLC_NUM_WORKER\")));\n FLAGS_num_servers = atoi(CHECK_NOTNULL(getenv(\"DMLC_NUM_SERVER\")));\n\n AssembleMyNode();\n}\n\nvoid Env::AssembleMyNode() {\n \/\/ get my role\n char* role_str = getenv(\"DMLC_ROLE\");\n Node::Role role;\n string id;\n if (role_str != NULL) {\n if (!strcmp(role_str, \"scheduler\")) {\n FLAGS_my_node = FLAGS_scheduler;\n return;\n } else if (!strcmp(role_str, \"worker\")) {\n role = Node::WORKER;\n } else if (!strcmp(role_str, \"server\")) {\n role = Node::SERVER;\n } else {\n LOG(FATAL) << \"unknown role: \" << *role_str;\n }\n } else {\n int my_rank;\n char* rank_str = getenv(\"PMI_RANK\");\n if (!rank_str) {\n rank_str = getenv(\"OMPI_COMM_WORLD_RANK\");\n }\n CHECK(rank_str != NULL) << \"fail to get rank size\";\n my_rank = atoi(rank_str);\n\n \/\/ role and id\n CHECK_LT(my_rank, FLAGS_num_workers + FLAGS_num_servers);\n if (my_rank < FLAGS_num_workers) {\n role = Node::WORKER;\n id = \"W\" + std::to_string(my_rank);\n } else { \/\/ if (my_rank < FLAGS_num_workers + FLAGS_num_servers) {\n role = Node::SERVER;\n id = \"S\" + std::to_string(my_rank - FLAGS_num_workers);\n }\n }\n\n Node node; node.set_role(role);\n if (!id.empty()) node.set_id(id);\n\n \/\/ IP, port and interface\n string ip;\n string interface = FLAGS_interface;\n unsigned short port;\n\n if (interface.empty()) {\n LocalMachine::pickupAvailableInterfaceAndIP(interface, ip);\n } else {\n ip = LocalMachine::IP(interface);\n }\n CHECK(!ip.empty()) << \"failed to got ip\";\n CHECK(!interface.empty()) << \"failed to got the interface\";\n port = LocalMachine::pickupAvailablePort();\n CHECK_NE(port, 0) << \"failed to get port\";\n node.set_hostname(ip);\n node.set_port(static_cast<int32>(port));\n\n CHECK(google::protobuf::TextFormat::PrintToString(node, &FLAGS_my_node));\n}\n\n\n\n} \/\/ namespace ps\n<|endoftext|>"} {"text":"<commit_before>\/*\n * TCP client connection pooling.\n *\n * author: Max Kellermann <mk@cm4all.com>\n *\/\n\n#ifndef BENG_PROXY_TCP_STOCK_HXX\n#define BENG_PROXY_TCP_STOCK_HXX\n\nstruct pool;\nstruct balancer;\nstruct StockMap;\nstruct StockItem;\nstruct StockGetHandler;\nstruct async_operation_ref;\nclass SocketAddress;\n\n\/**\n * Creates a new TCP connection stock.\n *\n * @param pool the memory pool\n * @param limit the maximum number of connections per host\n * @return the new TCP connections stock (this function cannot fail)\n *\/\nStockMap *\ntcp_stock_new(struct pool *pool, unsigned limit);\n\n\/**\n * @param name the hstock name; it is auto-generated from the\n * #address_list if NULL is passed here\n * @param timeout the connect timeout in seconds\n *\/\nvoid\ntcp_stock_get(StockMap *tcp_stock, struct pool *pool, const char *name,\n bool ip_transparent,\n SocketAddress bind_address,\n SocketAddress address,\n unsigned timeout,\n const StockGetHandler *handler, void *handler_ctx,\n struct async_operation_ref *async_ref);\n\nvoid\ntcp_stock_put(StockMap *tcp_stock, StockItem &item, bool destroy);\n\nint\ntcp_stock_item_get(const StockItem &item);\n\nint\ntcp_stock_item_get_domain(const StockItem &item);\n\n#endif\n<commit_msg>tcp_stock: add \"pure\" attributes<commit_after>\/*\n * TCP client connection pooling.\n *\n * author: Max Kellermann <mk@cm4all.com>\n *\/\n\n#ifndef BENG_PROXY_TCP_STOCK_HXX\n#define BENG_PROXY_TCP_STOCK_HXX\n\n#include <inline\/compiler.h>\n\nstruct pool;\nstruct balancer;\nstruct StockMap;\nstruct StockItem;\nstruct StockGetHandler;\nstruct async_operation_ref;\nclass SocketAddress;\n\n\/**\n * Creates a new TCP connection stock.\n *\n * @param pool the memory pool\n * @param limit the maximum number of connections per host\n * @return the new TCP connections stock (this function cannot fail)\n *\/\nStockMap *\ntcp_stock_new(struct pool *pool, unsigned limit);\n\n\/**\n * @param name the hstock name; it is auto-generated from the\n * #address_list if NULL is passed here\n * @param timeout the connect timeout in seconds\n *\/\nvoid\ntcp_stock_get(StockMap *tcp_stock, struct pool *pool, const char *name,\n bool ip_transparent,\n SocketAddress bind_address,\n SocketAddress address,\n unsigned timeout,\n const StockGetHandler *handler, void *handler_ctx,\n struct async_operation_ref *async_ref);\n\nvoid\ntcp_stock_put(StockMap *tcp_stock, StockItem &item, bool destroy);\n\ngcc_pure\nint\ntcp_stock_item_get(const StockItem &item);\n\ngcc_pure\nint\ntcp_stock_item_get_domain(const StockItem &item);\n\n#endif\n<|endoftext|>"} {"text":"<commit_before>\/\/ (C) 2016 Marvin Sielenkemper\n\n#include \"db.hpp\"\n\n#include <mariadb\/mysql.h>\n#include <iostream>\n\n\nstruct Db::Impl : boost::noncopyable {\n MYSQL mysql;\n\n Impl() : mysql() {\n mysql_init(&mysql);\n }\n};\n\n\nDb::Db(char* passwd) : m_implPtr(new Impl()) {\n auto& mysql(m_implPtr->mysql);\n auto const p(mysql_real_connect(&mysql, \"192.168.2.51\", \"furnace\",\n passwd, \"furnace\", 3306, nullptr,\n CLIENT_COMPRESS));\n\n std::cout << p << \" \" << &mysql << std::endl << mysql_errno(&mysql)\n << std::endl << mysql_error(&mysql) << std::endl;\n}\n\nDb::~Db() {\n}\n<commit_msg>moved the inline constants into named constants, updated the error handling<commit_after>\/\/ (C) 2016 Marvin Sielenkemper\n\n#include \"db.hpp\"\n\n#include <mariadb\/mysql.h>\n#include <sstream>\n\n\nnamespace\n{\n const char* const db_host(\"192.168.2.51\");\n const char* const db_user(\"furnace\");\n const char* const db_name(\"furnace\");\n unsigned int db_port(3306);\n}\n\n\nstruct Db::Impl : boost::noncopyable {\n MYSQL mysql;\n\n Impl() : mysql() {\n mysql_init(&mysql);\n }\n};\n\n\nDb::Db(char* passwd) : m_implPtr(new Impl()) {\n auto& mysql(m_implPtr->mysql);\n\n if (!mysql_real_connect(&mysql, db_host, db_user, passwd, db_name,\n db_port, nullptr, CLIENT_COMPRESS)) {\n std::ostringstream buffer;\n\n buffer << \"failed to connect to database: '\"\n << mysql_error(&mysql) << '\\'';\n\n throw std::runtime_error(buffer.str());\n }\n}\n\nDb::~Db() {\n}\n<|endoftext|>"} {"text":"<commit_before>#include \"chainerx\/python\/chainer_interop.h\"\n\n#include <algorithm>\n#include <cstdint>\n#include <iterator>\n#include <memory>\n#include <string>\n#include <utility>\n#include <vector>\n\n#include <gsl\/gsl>\n#include <nonstd\/optional.hpp>\n\n#include \"chainerx\/array.h\"\n#include \"chainerx\/array_body.h\"\n#include \"chainerx\/array_fwd.h\"\n#include \"chainerx\/backward.h\"\n#include \"chainerx\/backward_builder.h\"\n#include \"chainerx\/backward_context.h\"\n\n#include \"chainerx\/python\/common.h\"\n\nnamespace chainerx {\nnamespace python {\nnamespace python_internal {\n\nnamespace py = pybind11;\n\nusing ArrayBodyPtr = std::shared_ptr<internal::ArrayBody>;\n\nnamespace {\n\ninline bool IsUniqueAndIncreasingIndexes(const std::vector<size_t>& vec, size_t upper) {\n for (size_t i = 0; i < vec.size(); ++i) {\n if (i > 0 && vec[i] <= vec[i - 1]) {\n return false;\n }\n if (upper <= vec[i]) {\n return false;\n }\n }\n return true;\n}\n\n} \/\/ namespace\n\nvoid InitChainerxChainerInterop(pybind11::module& m) {\n m.def(\"_function_node_forward\",\n [](py::object function_node,\n const std::vector<ArrayBodyPtr>& inputs,\n const std::vector<ArrayBodyPtr>& outputs,\n const std::vector<size_t>& input_indexes_to_retain,\n const std::vector<size_t>& output_indexes_to_retain) {\n \/\/ Implementation note:\n \/\/ There are two kinds of indices:\n \/\/ o: Original indices. This is the indices used in Python world. It includes None arrays.\n \/\/ r: Reduced indices. This is the indices that ChainerX C++ impl handles. None arrays are omitted.\n \/\/ o and r are used as abbreviations of these.\n \/\/ i and j are used as variables of respective kinds of indices.\n CHAINERX_ASSERT(IsUniqueAndIncreasingIndexes(input_indexes_to_retain, inputs.size()));\n CHAINERX_ASSERT(IsUniqueAndIncreasingIndexes(output_indexes_to_retain, outputs.size()));\n CHAINERX_ASSERT(std::all_of(outputs.begin(), outputs.end(), [](const ArrayBodyPtr& array_body) {\n return array_body == nullptr || array_body->nodes().empty();\n }));\n const size_t chainer_output_count = outputs.size();\n\n \/\/ Prepare input\/output arrays for BackwardBuilder\n \/\/ {in,out}put_index_map maps original input\/output indices to reduced indices where None outputs are omitted\n\n auto get_reduced_arrays = [](const std::vector<ArrayBodyPtr>& array_bodies) {\n \/\/ Given the input\/output array bodies, construct an index mapping between original <o> indices and\n \/\/ reduced <r> indices where None arrays are omitted.\n std::vector<Array> reduced_arrays;\n std::vector<size_t> index_r2o_map;\n std::vector<nonstd::optional<size_t>> index_o2r_map(array_bodies.size());\n reduced_arrays.reserve(array_bodies.size());\n index_r2o_map.reserve(array_bodies.size());\n for (size_t i = 0; i < array_bodies.size(); ++i) {\n const ArrayBodyPtr& array_body = array_bodies[i];\n if (array_body != nullptr) {\n gsl::at(index_o2r_map, i) = index_r2o_map.size();\n index_r2o_map.emplace_back(i);\n reduced_arrays.emplace_back(array_body);\n }\n }\n return std::make_tuple(std::move(reduced_arrays), std::move(index_r2o_map), std::move(index_o2r_map));\n };\n\n \/\/ Inputs\n std::vector<Array> reduced_input_arrays;\n std::vector<size_t> input_index_r2o_map;\n std::vector<nonstd::optional<size_t>> input_index_o2r_map;\n std::vector<ConstArrayRef> reduced_input_array_refs;\n std::tie(reduced_input_arrays, input_index_r2o_map, input_index_o2r_map) = get_reduced_arrays(inputs);\n CHAINERX_ASSERT(IsUniqueAndIncreasingIndexes(input_index_r2o_map, inputs.size()));\n CHAINERX_ASSERT(!reduced_input_arrays.empty());\n CHAINERX_ASSERT(std::all_of(reduced_input_arrays.begin(), reduced_input_arrays.end(), [](const Array& arr) {\n return internal::GetArrayBody(arr) != nullptr;\n }));\n reduced_input_array_refs.insert(reduced_input_array_refs.begin(), reduced_input_arrays.begin(), reduced_input_arrays.end());\n\n \/\/ Outputs\n std::vector<Array> reduced_output_arrays;\n std::vector<size_t> output_index_r2o_map;\n std::vector<nonstd::optional<size_t>> output_index_o2r_map;\n std::vector<ConstArrayRef> reduced_output_array_refs;\n std::tie(reduced_output_arrays, output_index_r2o_map, output_index_o2r_map) = get_reduced_arrays(outputs);\n CHAINERX_ASSERT(IsUniqueAndIncreasingIndexes(output_index_r2o_map, outputs.size()));\n CHAINERX_ASSERT(!reduced_output_arrays.empty());\n CHAINERX_ASSERT(std::all_of(reduced_output_arrays.begin(), reduced_output_arrays.end(), [](const Array& arr) {\n return internal::GetArrayBody(arr) != nullptr;\n }));\n reduced_output_array_refs.insert(\n reduced_output_array_refs.begin(), reduced_output_arrays.begin(), reduced_output_arrays.end());\n\n \/\/ Insert backward function\n BackwardBuilder bb{\"chainer_function\", std::move(reduced_input_array_refs), std::move(reduced_output_array_refs)};\n if (BackwardBuilder::Target bt = bb.CreateTarget()) {\n auto function_node_ptr = std::make_shared<py::object>(std::move(function_node), [](gsl::owner<py::object*> ptr) {\n py::gil_scoped_acquire acquire;\n delete ptr;\n });\n\n \/\/ Retain inputs\/outputs\n auto retain_arrays = [](auto retain,\n const std::vector<nonstd::optional<size_t>>& index_o2r_map,\n const std::vector<size_t>& indexes_to_retain) {\n \/\/ Given the original indices to retain, retain the corresponding arrays and return the retain tokens. If the\n \/\/ corresponding array was None, the token is nullopt.\n using RetainedToken = decltype(retain(size_t{}));\n std::vector<nonstd::optional<RetainedToken>> retained_tokens;\n retained_tokens.reserve(indexes_to_retain.size());\n for (size_t i : indexes_to_retain) {\n if (auto j = index_o2r_map[i]) {\n retained_tokens.emplace_back(retain(*j));\n } else {\n \/\/ Array to retain was None\n retained_tokens.emplace_back(nonstd::nullopt);\n }\n }\n return retained_tokens;\n };\n\n std::vector<nonstd::optional<RetainedInputToken>> retained_input_tokens =\n retain_arrays([&bb](size_t j) { return bb.RetainInput(j); }, input_index_o2r_map, input_indexes_to_retain);\n std::vector<nonstd::optional<RetainedOutputToken>> retained_output_tokens =\n retain_arrays([&bb](size_t j) { return bb.RetainOutput(j); }, output_index_o2r_map, output_indexes_to_retain);\n\n \/\/ Define backward function\n bt.Define([chainer_output_count,\n function_node_ptr = std::move(function_node_ptr),\n input_index_r2o_map = std::move(input_index_r2o_map),\n output_index_r2o_map = std::move(output_index_r2o_map),\n in_toks = std::move(retained_input_tokens),\n out_toks = std::move(retained_output_tokens)](BackwardContext& bctx) {\n \/\/ Target input indices\n \/\/ This is reduced <r> indices of grad-required inputs.\n std::vector<size_t> target_input_indexes;\n target_input_indexes.reserve(bctx.input_count());\n\n for (size_t j = 0; j < bctx.input_count(); ++j) {\n if (bctx.is_input_grad_required(j)) {\n target_input_indexes.emplace_back(j);\n }\n }\n\n CHAINERX_ASSERT(IsUniqueAndIncreasingIndexes(target_input_indexes, bctx.input_count()));\n\n \/\/ Collect incoming output gradients\n std::vector<ArrayBodyPtr> chainer_grad_outputs{chainer_output_count};\n for (size_t j = 0; j < bctx.output_count(); ++j) {\n if (auto& gy = bctx.output_grad(j)) {\n size_t chainer_output_index = output_index_r2o_map[j];\n chainer_grad_outputs[chainer_output_index] = internal::GetArrayBody(*gy);\n }\n }\n\n \/\/ Get retained inputs and outputs\n auto get_retained_arrays = [](auto get_retained, const auto& tokens) {\n std::vector<ArrayBodyPtr> retained_arrays;\n retained_arrays.reserve(tokens.size());\n for (const auto& tok : tokens) {\n if (tok.has_value()) {\n \/\/ Retrieve the retained array.\n retained_arrays.emplace_back(internal::GetArrayBody(get_retained(*tok)));\n } else {\n \/\/ Array to retain was None.\n retained_arrays.emplace_back(nullptr);\n }\n }\n return retained_arrays;\n };\n\n std::vector<ArrayBodyPtr> retained_inputs =\n get_retained_arrays([&bctx](const RetainedInputToken& tok) { return bctx.GetRetainedInput(tok); }, in_toks);\n std::vector<ArrayBodyPtr> retained_outputs = get_retained_arrays(\n [&bctx](const RetainedOutputToken& tok) { return bctx.GetRetainedOutput(tok); }, out_toks);\n\n \/\/ Call FunctionNode._backward_chainerx()\n std::vector<ArrayBodyPtr> chainer_grad_inputs;\n\n {\n \/\/ Target input indices that are passed to backward() of Chainer.\n \/\/ This is indices of <grad-required> inputs among <all> of the inputs.\n std::vector<size_t> chainer_target_input_indexes{};\n chainer_target_input_indexes.reserve(target_input_indexes.size());\n for (size_t j : target_input_indexes) {\n chainer_target_input_indexes.emplace_back(input_index_r2o_map[j]);\n }\n\n py::gil_scoped_acquire acquire;\n py::object func_backward = function_node_ptr->attr(\"_backward_chainerx\");\n py::object py_grad_inputs =\n func_backward(chainer_target_input_indexes, chainer_grad_outputs, retained_inputs, retained_outputs);\n chainer_grad_inputs = py::cast<std::vector<ArrayBodyPtr>>(py_grad_inputs);\n }\n CHAINERX_ASSERT(chainer_grad_inputs.size() == target_input_indexes.size());\n\n \/\/ Store computed input gradients\n for (size_t k = 0; k < target_input_indexes.size(); ++k) {\n size_t j = gsl::at(target_input_indexes, k);\n ArrayBodyPtr& gx = gsl::at(chainer_grad_inputs, k);\n CHAINERX_ASSERT(gx != nullptr);\n\n bctx.input_grad(j) = Array{gx};\n }\n });\n }\n bb.Finalize();\n },\n py::arg(\"function_node\"),\n py::arg(\"inputs\"),\n py::arg(\"outputs\"),\n py::arg(\"input_indexes_to_retain\"),\n py::arg(\"output_indexes_to_retain\"));\n}\n\n} \/\/ namespace python_internal\n} \/\/ namespace python\n} \/\/ namespace chainerx\n<commit_msg>Fix construction of std::shared_ptr with custom deleter<commit_after>#include \"chainerx\/python\/chainer_interop.h\"\n\n#include <algorithm>\n#include <cstdint>\n#include <iterator>\n#include <memory>\n#include <string>\n#include <utility>\n#include <vector>\n\n#include <gsl\/gsl>\n#include <nonstd\/optional.hpp>\n\n#include \"chainerx\/array.h\"\n#include \"chainerx\/array_body.h\"\n#include \"chainerx\/array_fwd.h\"\n#include \"chainerx\/backward.h\"\n#include \"chainerx\/backward_builder.h\"\n#include \"chainerx\/backward_context.h\"\n\n#include \"chainerx\/python\/common.h\"\n\nnamespace chainerx {\nnamespace python {\nnamespace python_internal {\n\nnamespace py = pybind11;\n\nusing ArrayBodyPtr = std::shared_ptr<internal::ArrayBody>;\n\nnamespace {\n\ninline bool IsUniqueAndIncreasingIndexes(const std::vector<size_t>& vec, size_t upper) {\n for (size_t i = 0; i < vec.size(); ++i) {\n if (i > 0 && vec[i] <= vec[i - 1]) {\n return false;\n }\n if (upper <= vec[i]) {\n return false;\n }\n }\n return true;\n}\n\n} \/\/ namespace\n\nvoid InitChainerxChainerInterop(pybind11::module& m) {\n m.def(\"_function_node_forward\",\n [](py::object function_node,\n const std::vector<ArrayBodyPtr>& inputs,\n const std::vector<ArrayBodyPtr>& outputs,\n const std::vector<size_t>& input_indexes_to_retain,\n const std::vector<size_t>& output_indexes_to_retain) {\n \/\/ Implementation note:\n \/\/ There are two kinds of indices:\n \/\/ o: Original indices. This is the indices used in Python world. It includes None arrays.\n \/\/ r: Reduced indices. This is the indices that ChainerX C++ impl handles. None arrays are omitted.\n \/\/ o and r are used as abbreviations of these.\n \/\/ i and j are used as variables of respective kinds of indices.\n CHAINERX_ASSERT(IsUniqueAndIncreasingIndexes(input_indexes_to_retain, inputs.size()));\n CHAINERX_ASSERT(IsUniqueAndIncreasingIndexes(output_indexes_to_retain, outputs.size()));\n CHAINERX_ASSERT(std::all_of(outputs.begin(), outputs.end(), [](const ArrayBodyPtr& array_body) {\n return array_body == nullptr || array_body->nodes().empty();\n }));\n const size_t chainer_output_count = outputs.size();\n\n \/\/ Prepare input\/output arrays for BackwardBuilder\n \/\/ {in,out}put_index_map maps original input\/output indices to reduced indices where None outputs are omitted\n\n auto get_reduced_arrays = [](const std::vector<ArrayBodyPtr>& array_bodies) {\n \/\/ Given the input\/output array bodies, construct an index mapping between original <o> indices and\n \/\/ reduced <r> indices where None arrays are omitted.\n std::vector<Array> reduced_arrays;\n std::vector<size_t> index_r2o_map;\n std::vector<nonstd::optional<size_t>> index_o2r_map(array_bodies.size());\n reduced_arrays.reserve(array_bodies.size());\n index_r2o_map.reserve(array_bodies.size());\n for (size_t i = 0; i < array_bodies.size(); ++i) {\n const ArrayBodyPtr& array_body = array_bodies[i];\n if (array_body != nullptr) {\n gsl::at(index_o2r_map, i) = index_r2o_map.size();\n index_r2o_map.emplace_back(i);\n reduced_arrays.emplace_back(array_body);\n }\n }\n return std::make_tuple(std::move(reduced_arrays), std::move(index_r2o_map), std::move(index_o2r_map));\n };\n\n \/\/ Inputs\n std::vector<Array> reduced_input_arrays;\n std::vector<size_t> input_index_r2o_map;\n std::vector<nonstd::optional<size_t>> input_index_o2r_map;\n std::vector<ConstArrayRef> reduced_input_array_refs;\n std::tie(reduced_input_arrays, input_index_r2o_map, input_index_o2r_map) = get_reduced_arrays(inputs);\n CHAINERX_ASSERT(IsUniqueAndIncreasingIndexes(input_index_r2o_map, inputs.size()));\n CHAINERX_ASSERT(!reduced_input_arrays.empty());\n CHAINERX_ASSERT(std::all_of(reduced_input_arrays.begin(), reduced_input_arrays.end(), [](const Array& arr) {\n return internal::GetArrayBody(arr) != nullptr;\n }));\n reduced_input_array_refs.insert(reduced_input_array_refs.begin(), reduced_input_arrays.begin(), reduced_input_arrays.end());\n\n \/\/ Outputs\n std::vector<Array> reduced_output_arrays;\n std::vector<size_t> output_index_r2o_map;\n std::vector<nonstd::optional<size_t>> output_index_o2r_map;\n std::vector<ConstArrayRef> reduced_output_array_refs;\n std::tie(reduced_output_arrays, output_index_r2o_map, output_index_o2r_map) = get_reduced_arrays(outputs);\n CHAINERX_ASSERT(IsUniqueAndIncreasingIndexes(output_index_r2o_map, outputs.size()));\n CHAINERX_ASSERT(!reduced_output_arrays.empty());\n CHAINERX_ASSERT(std::all_of(reduced_output_arrays.begin(), reduced_output_arrays.end(), [](const Array& arr) {\n return internal::GetArrayBody(arr) != nullptr;\n }));\n reduced_output_array_refs.insert(\n reduced_output_array_refs.begin(), reduced_output_arrays.begin(), reduced_output_arrays.end());\n\n \/\/ Insert backward function\n BackwardBuilder bb{\"chainer_function\", std::move(reduced_input_array_refs), std::move(reduced_output_array_refs)};\n if (BackwardBuilder::Target bt = bb.CreateTarget()) {\n \/\/ Need to reallocate the function node in order to specify a custom deleter (that acquires the GIL before deletion).\n auto function_node_ptr =\n std::shared_ptr<py::object>{new py::object{std::move(function_node)}, [](gsl::owner<py::object*> ptr) {\n py::gil_scoped_acquire acquire;\n delete ptr;\n }};\n\n \/\/ Retain inputs\/outputs\n auto retain_arrays = [](auto retain,\n const std::vector<nonstd::optional<size_t>>& index_o2r_map,\n const std::vector<size_t>& indexes_to_retain) {\n \/\/ Given the original indices to retain, retain the corresponding arrays and return the retain tokens. If the\n \/\/ corresponding array was None, the token is nullopt.\n using RetainedToken = decltype(retain(size_t{}));\n std::vector<nonstd::optional<RetainedToken>> retained_tokens;\n retained_tokens.reserve(indexes_to_retain.size());\n for (size_t i : indexes_to_retain) {\n if (auto j = index_o2r_map[i]) {\n retained_tokens.emplace_back(retain(*j));\n } else {\n \/\/ Array to retain was None\n retained_tokens.emplace_back(nonstd::nullopt);\n }\n }\n return retained_tokens;\n };\n\n std::vector<nonstd::optional<RetainedInputToken>> retained_input_tokens =\n retain_arrays([&bb](size_t j) { return bb.RetainInput(j); }, input_index_o2r_map, input_indexes_to_retain);\n std::vector<nonstd::optional<RetainedOutputToken>> retained_output_tokens =\n retain_arrays([&bb](size_t j) { return bb.RetainOutput(j); }, output_index_o2r_map, output_indexes_to_retain);\n\n \/\/ Define backward function\n bt.Define([chainer_output_count,\n function_node_ptr = std::move(function_node_ptr),\n input_index_r2o_map = std::move(input_index_r2o_map),\n output_index_r2o_map = std::move(output_index_r2o_map),\n in_toks = std::move(retained_input_tokens),\n out_toks = std::move(retained_output_tokens)](BackwardContext& bctx) {\n \/\/ Target input indices\n \/\/ This is reduced <r> indices of grad-required inputs.\n std::vector<size_t> target_input_indexes;\n target_input_indexes.reserve(bctx.input_count());\n\n for (size_t j = 0; j < bctx.input_count(); ++j) {\n if (bctx.is_input_grad_required(j)) {\n target_input_indexes.emplace_back(j);\n }\n }\n\n CHAINERX_ASSERT(IsUniqueAndIncreasingIndexes(target_input_indexes, bctx.input_count()));\n\n \/\/ Collect incoming output gradients\n std::vector<ArrayBodyPtr> chainer_grad_outputs{chainer_output_count};\n for (size_t j = 0; j < bctx.output_count(); ++j) {\n if (auto& gy = bctx.output_grad(j)) {\n size_t chainer_output_index = output_index_r2o_map[j];\n chainer_grad_outputs[chainer_output_index] = internal::GetArrayBody(*gy);\n }\n }\n\n \/\/ Get retained inputs and outputs\n auto get_retained_arrays = [](auto get_retained, const auto& tokens) {\n std::vector<ArrayBodyPtr> retained_arrays;\n retained_arrays.reserve(tokens.size());\n for (const auto& tok : tokens) {\n if (tok.has_value()) {\n \/\/ Retrieve the retained array.\n retained_arrays.emplace_back(internal::GetArrayBody(get_retained(*tok)));\n } else {\n \/\/ Array to retain was None.\n retained_arrays.emplace_back(nullptr);\n }\n }\n return retained_arrays;\n };\n\n std::vector<ArrayBodyPtr> retained_inputs =\n get_retained_arrays([&bctx](const RetainedInputToken& tok) { return bctx.GetRetainedInput(tok); }, in_toks);\n std::vector<ArrayBodyPtr> retained_outputs = get_retained_arrays(\n [&bctx](const RetainedOutputToken& tok) { return bctx.GetRetainedOutput(tok); }, out_toks);\n\n \/\/ Call FunctionNode._backward_chainerx()\n std::vector<ArrayBodyPtr> chainer_grad_inputs;\n\n {\n \/\/ Target input indices that are passed to backward() of Chainer.\n \/\/ This is indices of <grad-required> inputs among <all> of the inputs.\n std::vector<size_t> chainer_target_input_indexes{};\n chainer_target_input_indexes.reserve(target_input_indexes.size());\n for (size_t j : target_input_indexes) {\n chainer_target_input_indexes.emplace_back(input_index_r2o_map[j]);\n }\n\n py::gil_scoped_acquire acquire;\n py::object func_backward = function_node_ptr->attr(\"_backward_chainerx\");\n py::object py_grad_inputs =\n func_backward(chainer_target_input_indexes, chainer_grad_outputs, retained_inputs, retained_outputs);\n chainer_grad_inputs = py::cast<std::vector<ArrayBodyPtr>>(py_grad_inputs);\n }\n CHAINERX_ASSERT(chainer_grad_inputs.size() == target_input_indexes.size());\n\n \/\/ Store computed input gradients\n for (size_t k = 0; k < target_input_indexes.size(); ++k) {\n size_t j = gsl::at(target_input_indexes, k);\n ArrayBodyPtr& gx = gsl::at(chainer_grad_inputs, k);\n CHAINERX_ASSERT(gx != nullptr);\n\n bctx.input_grad(j) = Array{gx};\n }\n });\n }\n bb.Finalize();\n },\n py::arg(\"function_node\"),\n py::arg(\"inputs\"),\n py::arg(\"outputs\"),\n py::arg(\"input_indexes_to_retain\"),\n py::arg(\"output_indexes_to_retain\"));\n}\n\n} \/\/ namespace python_internal\n} \/\/ namespace python\n} \/\/ namespace chainerx\n<|endoftext|>"} {"text":"<commit_before>#include \"chainerx\/python\/chainer_interop.h\"\n\n#include <algorithm>\n#include <cstdint>\n#include <iterator>\n#include <memory>\n#include <string>\n#include <vector>\n\n#include \"chainerx\/array.h\"\n#include \"chainerx\/array_body.h\"\n#include \"chainerx\/array_fwd.h\"\n#include \"chainerx\/backward.h\"\n#include \"chainerx\/backward_builder.h\"\n#include \"chainerx\/backward_context.h\"\n\n#include \"chainerx\/python\/common.h\"\n\nnamespace chainerx {\nnamespace python {\nnamespace python_internal {\n\nnamespace py = pybind11;\n\nusing ArrayBodyPtr = std::shared_ptr<internal::ArrayBody>;\n\nvoid InitChainerxChainerInterop(pybind11::module& m) {\n m.def(\"_function_node_forward\",\n [](py::object function_node,\n const std::vector<ArrayBodyPtr>& inputs,\n const std::vector<ArrayBodyPtr>& outputs,\n const std::vector<size_t>& input_indexes_to_retain,\n const std::vector<size_t>& output_indexes_to_retain) {\n CHAINERX_ASSERT(std::all_of(outputs.begin(), outputs.end(), [](const ArrayBodyPtr& array_body) {\n return array_body == nullptr || array_body->nodes().empty();\n }));\n\n \/\/ Prepare input arrays for BackwardBuilder\n std::vector<Array> input_arrays;\n std::vector<ConstArrayRef> input_array_refs;\n input_arrays.reserve(inputs.size());\n input_array_refs.reserve(inputs.size());\n for (const ArrayBodyPtr& array_body : inputs) {\n input_arrays.emplace_back(array_body);\n input_array_refs.emplace_back(input_arrays.back());\n }\n\n \/\/ Prepare output arrays for BackwardBuilder\n std::vector<Array> output_arrays;\n std::vector<ConstArrayRef> output_array_refs;\n std::vector<nonstd::optional<size_t>> output_index_map; \/\/ maps original output index to reduced index\n output_arrays.reserve(outputs.size());\n output_array_refs.reserve(outputs.size());\n output_index_map.reserve(outputs.size());\n for (const ArrayBodyPtr& array_body : outputs) {\n if (array_body != nullptr) {\n output_index_map.emplace_back(output_array_refs.size());\n output_arrays.emplace_back(array_body);\n output_array_refs.emplace_back(output_arrays.back());\n } else {\n output_index_map.emplace_back(nonstd::nullopt);\n }\n }\n\n \/\/ Insert backward function\n BackwardBuilder bb{\"chainer_function\", std::move(input_array_refs), std::move(output_array_refs)};\n if (BackwardBuilder::Target bt = bb.CreateTarget()) {\n auto function_node_ptr = std::make_shared<py::object>(std::move(function_node), [](py::object* ptr) {\n py::gil_scoped_acquire acquire;\n delete ptr;\n });\n\n std::vector<RetainedInputToken> retained_input_tokens;\n std::transform(\n input_indexes_to_retain.begin(),\n input_indexes_to_retain.end(),\n std::back_inserter(retained_input_tokens),\n [&bb](size_t i) { return bb.RetainInput(i); });\n std::vector<nonstd::optional<RetainedOutputToken>> retained_output_tokens;\n retained_output_tokens.reserve(output_indexes_to_retain.size());\n for (size_t i : output_indexes_to_retain) {\n if (nonstd::optional<size_t> i_out_reduced = gsl::at(output_index_map, i)) {\n retained_output_tokens.emplace_back(bb.RetainOutput(*i_out_reduced));\n } else {\n retained_output_tokens.emplace_back(nonstd::nullopt);\n }\n }\n\n bt.Define([function_node_ptr = std::move(function_node_ptr),\n output_index_map = std::move(output_index_map),\n in_toks = std::move(retained_input_tokens),\n out_toks = std::move(retained_output_tokens)](BackwardContext& bctx) {\n \/\/ Target input indexes\n std::vector<size_t> target_input_indexes;\n target_input_indexes.reserve(bctx.input_count());\n\n for (size_t i_in = 0; i_in < bctx.input_count(); ++i_in) {\n if (bctx.is_input_grad_required(i_in)) {\n target_input_indexes.emplace_back(i_in);\n }\n }\n\n \/\/ Collect incoming output gradients\n std::vector<ArrayBodyPtr> grad_outputs;\n grad_outputs.reserve(output_index_map.size());\n for (const nonstd::optional<size_t>& i_out : output_index_map) {\n if (i_out.has_value()) {\n CHAINERX_ASSERT(*i_out < bctx.output_count());\n if (auto gy = bctx.output_grad(*i_out)) {\n grad_outputs.emplace_back(internal::GetArrayBody(*gy));\n } else {\n grad_outputs.emplace_back(nullptr);\n }\n } else {\n grad_outputs.emplace_back(nullptr);\n }\n }\n\n \/\/ Get retained inputs and outputs\n std::vector<ArrayBodyPtr> retained_inputs;\n std::transform(\n in_toks.begin(), in_toks.end(), std::back_inserter(retained_inputs), [&bctx](const RetainedInputToken& tok) {\n return internal::GetArrayBody(bctx.GetRetainedInput(tok));\n });\n std::vector<ArrayBodyPtr> retained_outputs;\n retained_outputs.reserve(out_toks.size());\n for (const nonstd::optional<RetainedOutputToken>& tok : out_toks) {\n if (tok.has_value()) {\n retained_outputs.emplace_back(internal::GetArrayBody(bctx.GetRetainedOutput(*tok)));\n } else {\n retained_outputs.emplace_back(nullptr);\n }\n }\n\n \/\/ Call FunctionNode._backward_chainerx()\n std::vector<ArrayBodyPtr> grad_inputs;\n {\n py::gil_scoped_acquire acquire;\n py::object func_backward = function_node_ptr->attr(\"_backward_chainerx\");\n py::object py_grad_inputs = func_backward(target_input_indexes, grad_outputs, retained_inputs, retained_outputs);\n grad_inputs = py::cast<std::vector<ArrayBodyPtr>>(py_grad_inputs);\n }\n CHAINERX_ASSERT(grad_inputs.size() == target_input_indexes.size());\n\n \/\/ Store computed input gradients\n for (size_t i = 0; i < target_input_indexes.size(); ++i) {\n size_t i_in = gsl::at(target_input_indexes, i);\n ArrayBodyPtr& gx = gsl::at(grad_inputs, i);\n\n bctx.input_grad(i_in) = Array{gx};\n }\n });\n }\n bb.Finalize();\n },\n py::arg(\"function_node\"),\n py::arg(\"inputs\"),\n py::arg(\"outputs\"),\n py::arg(\"input_indexes_to_retain\"),\n py::arg(\"output_indexes_to_retain\"));\n}\n\n} \/\/ namespace python_internal\n} \/\/ namespace python\n} \/\/ namespace chainerx\n<commit_msg>Add missing include<commit_after>#include \"chainerx\/python\/chainer_interop.h\"\n\n#include <algorithm>\n#include <cstdint>\n#include <iterator>\n#include <memory>\n#include <string>\n#include <vector>\n\n#include <nonstd\/optional.hpp>\n\n#include \"chainerx\/array.h\"\n#include \"chainerx\/array_body.h\"\n#include \"chainerx\/array_fwd.h\"\n#include \"chainerx\/backward.h\"\n#include \"chainerx\/backward_builder.h\"\n#include \"chainerx\/backward_context.h\"\n\n#include \"chainerx\/python\/common.h\"\n\nnamespace chainerx {\nnamespace python {\nnamespace python_internal {\n\nnamespace py = pybind11;\n\nusing ArrayBodyPtr = std::shared_ptr<internal::ArrayBody>;\n\nvoid InitChainerxChainerInterop(pybind11::module& m) {\n m.def(\"_function_node_forward\",\n [](py::object function_node,\n const std::vector<ArrayBodyPtr>& inputs,\n const std::vector<ArrayBodyPtr>& outputs,\n const std::vector<size_t>& input_indexes_to_retain,\n const std::vector<size_t>& output_indexes_to_retain) {\n CHAINERX_ASSERT(std::all_of(outputs.begin(), outputs.end(), [](const ArrayBodyPtr& array_body) {\n return array_body == nullptr || array_body->nodes().empty();\n }));\n\n \/\/ Prepare input arrays for BackwardBuilder\n std::vector<Array> input_arrays;\n std::vector<ConstArrayRef> input_array_refs;\n input_arrays.reserve(inputs.size());\n input_array_refs.reserve(inputs.size());\n for (const ArrayBodyPtr& array_body : inputs) {\n input_arrays.emplace_back(array_body);\n input_array_refs.emplace_back(input_arrays.back());\n }\n\n \/\/ Prepare output arrays for BackwardBuilder\n std::vector<Array> output_arrays;\n std::vector<ConstArrayRef> output_array_refs;\n std::vector<nonstd::optional<size_t>> output_index_map; \/\/ maps original output index to reduced index\n output_arrays.reserve(outputs.size());\n output_array_refs.reserve(outputs.size());\n output_index_map.reserve(outputs.size());\n for (const ArrayBodyPtr& array_body : outputs) {\n if (array_body != nullptr) {\n output_index_map.emplace_back(output_array_refs.size());\n output_arrays.emplace_back(array_body);\n output_array_refs.emplace_back(output_arrays.back());\n } else {\n output_index_map.emplace_back(nonstd::nullopt);\n }\n }\n\n \/\/ Insert backward function\n BackwardBuilder bb{\"chainer_function\", std::move(input_array_refs), std::move(output_array_refs)};\n if (BackwardBuilder::Target bt = bb.CreateTarget()) {\n auto function_node_ptr = std::make_shared<py::object>(std::move(function_node), [](py::object* ptr) {\n py::gil_scoped_acquire acquire;\n delete ptr;\n });\n\n std::vector<RetainedInputToken> retained_input_tokens;\n std::transform(\n input_indexes_to_retain.begin(),\n input_indexes_to_retain.end(),\n std::back_inserter(retained_input_tokens),\n [&bb](size_t i) { return bb.RetainInput(i); });\n std::vector<nonstd::optional<RetainedOutputToken>> retained_output_tokens;\n retained_output_tokens.reserve(output_indexes_to_retain.size());\n for (size_t i : output_indexes_to_retain) {\n if (nonstd::optional<size_t> i_out_reduced = gsl::at(output_index_map, i)) {\n retained_output_tokens.emplace_back(bb.RetainOutput(*i_out_reduced));\n } else {\n retained_output_tokens.emplace_back(nonstd::nullopt);\n }\n }\n\n bt.Define([function_node_ptr = std::move(function_node_ptr),\n output_index_map = std::move(output_index_map),\n in_toks = std::move(retained_input_tokens),\n out_toks = std::move(retained_output_tokens)](BackwardContext& bctx) {\n \/\/ Target input indexes\n std::vector<size_t> target_input_indexes;\n target_input_indexes.reserve(bctx.input_count());\n\n for (size_t i_in = 0; i_in < bctx.input_count(); ++i_in) {\n if (bctx.is_input_grad_required(i_in)) {\n target_input_indexes.emplace_back(i_in);\n }\n }\n\n \/\/ Collect incoming output gradients\n std::vector<ArrayBodyPtr> grad_outputs;\n grad_outputs.reserve(output_index_map.size());\n for (const nonstd::optional<size_t>& i_out : output_index_map) {\n if (i_out.has_value()) {\n CHAINERX_ASSERT(*i_out < bctx.output_count());\n if (auto gy = bctx.output_grad(*i_out)) {\n grad_outputs.emplace_back(internal::GetArrayBody(*gy));\n } else {\n grad_outputs.emplace_back(nullptr);\n }\n } else {\n grad_outputs.emplace_back(nullptr);\n }\n }\n\n \/\/ Get retained inputs and outputs\n std::vector<ArrayBodyPtr> retained_inputs;\n std::transform(\n in_toks.begin(), in_toks.end(), std::back_inserter(retained_inputs), [&bctx](const RetainedInputToken& tok) {\n return internal::GetArrayBody(bctx.GetRetainedInput(tok));\n });\n std::vector<ArrayBodyPtr> retained_outputs;\n retained_outputs.reserve(out_toks.size());\n for (const nonstd::optional<RetainedOutputToken>& tok : out_toks) {\n if (tok.has_value()) {\n retained_outputs.emplace_back(internal::GetArrayBody(bctx.GetRetainedOutput(*tok)));\n } else {\n retained_outputs.emplace_back(nullptr);\n }\n }\n\n \/\/ Call FunctionNode._backward_chainerx()\n std::vector<ArrayBodyPtr> grad_inputs;\n {\n py::gil_scoped_acquire acquire;\n py::object func_backward = function_node_ptr->attr(\"_backward_chainerx\");\n py::object py_grad_inputs = func_backward(target_input_indexes, grad_outputs, retained_inputs, retained_outputs);\n grad_inputs = py::cast<std::vector<ArrayBodyPtr>>(py_grad_inputs);\n }\n CHAINERX_ASSERT(grad_inputs.size() == target_input_indexes.size());\n\n \/\/ Store computed input gradients\n for (size_t i = 0; i < target_input_indexes.size(); ++i) {\n size_t i_in = gsl::at(target_input_indexes, i);\n ArrayBodyPtr& gx = gsl::at(grad_inputs, i);\n\n bctx.input_grad(i_in) = Array{gx};\n }\n });\n }\n bb.Finalize();\n },\n py::arg(\"function_node\"),\n py::arg(\"inputs\"),\n py::arg(\"outputs\"),\n py::arg(\"input_indexes_to_retain\"),\n py::arg(\"output_indexes_to_retain\"));\n}\n\n} \/\/ namespace python_internal\n} \/\/ namespace python\n} \/\/ namespace chainerx\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 <GL3DBarChart.hxx>\n\n#include <GL\/glew.h>\n\n#include <glm\/glm.hpp>\n#include <glm\/gtx\/transform.hpp>\n\n#include \"3DChartObjects.hxx\"\n#include \"GL3DRenderer.hxx\"\n#include <ExplicitCategoriesProvider.hxx>\n#include <DataSeriesHelper.hxx>\n\nusing namespace com::sun::star;\n\nnamespace chart {\n\nGL3DBarChart::GL3DBarChart(\n const css::uno::Reference<css::chart2::XChartType>& xChartType,\n OpenGLWindow& rWindow) :\n mxChartType(xChartType),\n mpRenderer(new opengl3D::OpenGL3DRenderer()),\n mrWindow(rWindow),\n mpCamera(NULL)\n{\n mrWindow.setRenderer(this);\n mpRenderer->init();\n}\n\nGL3DBarChart::~GL3DBarChart()\n{\n mrWindow.setRenderer(NULL);\n}\n\nvoid GL3DBarChart::create3DShapes(const boost::ptr_vector<VDataSeries>& rDataSeriesContainer,\n ExplicitCategoriesProvider& rCatProvider)\n{\n \/\/ Each series of data flows from left to right, and multiple series are\n \/\/ stacked vertically along y axis.\n\n \/\/ NOTE: These objects are created and positioned in a totally blind\n \/\/ fashion since we don't even have a way to see them on screen. So, no\n \/\/ guarantee they are positioned correctly. In fact, they are guaranteed\n \/\/ to be positioned incorrectly.\n\n const float nBarSizeX = 10;\n const float nBarSizeY = 10;\n const float nBarDistanceX = nBarSizeX \/ 2;\n const float nBarDistanceY = nBarSizeY \/ 2;\n\n sal_uInt32 nId = 1;\n float nXEnd = 0.0;\n float nYPos = 0.0;\n\n const Color aSeriesColor[] = {\n COL_RED, COL_GREEN, COL_YELLOW, COL_BROWN, COL_GRAY\n };\n\n maShapes.clear();\n maShapes.push_back(new opengl3D::Camera(mpRenderer.get()));\n mpCamera = static_cast<opengl3D::Camera*>(&maShapes.back());\n\n sal_Int32 nSeriesIndex = 0;\n for (boost::ptr_vector<VDataSeries>::const_iterator itr = rDataSeriesContainer.begin(),\n itrEnd = rDataSeriesContainer.end(); itr != itrEnd; ++itr)\n {\n nYPos = nSeriesIndex * (nBarSizeY + nBarDistanceY);\n\n const VDataSeries& rDataSeries = *itr;\n sal_Int32 nPointCount = rDataSeries.getTotalPointCount();\n\n bool bMappedFillProperty = rDataSeries.hasPropertyMapping(\"FillColor\");\n\n \/\/ Create series name text object.\n OUString aSeriesName =\n DataSeriesHelper::getDataSeriesLabel(\n rDataSeries.getModel(), mxChartType->getRoleOfSequenceForSeriesLabel());\n\n maShapes.push_back(new opengl3D::Text(mpRenderer.get(), aSeriesName, nId++));\n opengl3D::Text* p = static_cast<opengl3D::Text*>(&maShapes.back());\n Size aTextSize = p->getSize();\n glm::vec3 aTopLeft, aTopRight, aBottomRight;\n aTopLeft.x = aTextSize.getWidth() * -1.0;\n aTopLeft.y = nYPos;\n aTopRight.y = nYPos;\n aBottomRight = aTopRight;\n aBottomRight.y += aTextSize.getHeight();\n p->setPosition(aTopLeft, aTopRight, aBottomRight);\n\n sal_Int32 nColor = aSeriesColor[nSeriesIndex % SAL_N_ELEMENTS(aSeriesColor)].GetColor();\n for(sal_Int32 nIndex = 0; nIndex < nPointCount; ++nIndex)\n {\n if(bMappedFillProperty)\n {\n nColor = static_cast<sal_uInt32>(rDataSeries.getValueByProperty(nIndex, \"FillColor\"));\n }\n\n float nVal = rDataSeries.getYValue(nIndex);\n float nXPos = nIndex * (nBarSizeX + nBarDistanceX);\n\n\n glm::mat4 aScaleMatrix = glm::scale(nBarSizeX, nBarSizeY, nVal);\n glm::mat4 aTranslationMatrix = glm::translate(nXPos, nYPos, 0.0f);\n glm::mat4 aBarPosition = aTranslationMatrix * aScaleMatrix;\n\n maShapes.push_back(new opengl3D::Bar(mpRenderer.get(), aBarPosition, nColor, nId++));\n }\n\n float nThisXEnd = nPointCount * (nBarSizeX + nBarDistanceX);\n if (nXEnd < nThisXEnd)\n nXEnd = nThisXEnd;\n\n ++nSeriesIndex;\n }\n\n nYPos += nBarSizeY + nBarDistanceY;\n\n \/\/ X axis\n maShapes.push_back(new opengl3D::Line(mpRenderer.get(), nId++));\n opengl3D::Line* pAxis = static_cast<opengl3D::Line*>(&maShapes.back());\n glm::vec3 aBegin;\n aBegin.y = nYPos;\n glm::vec3 aEnd = aBegin;\n aEnd.x = nXEnd;\n pAxis->setPosition(aBegin, aEnd);\n pAxis->setLineColor(COL_BLUE);\n\n \/\/ Y axis\n maShapes.push_back(new opengl3D::Line(mpRenderer.get(), nId++));\n pAxis = static_cast<opengl3D::Line*>(&maShapes.back());\n aBegin.x = aBegin.y = 0;\n aEnd = aBegin;\n aEnd.y = nYPos;\n pAxis->setPosition(aBegin, aEnd);\n pAxis->setLineColor(COL_BLUE);\n\n \/\/ Chart background.\n maShapes.push_back(new opengl3D::Rectangle(mpRenderer.get(), nId++));\n opengl3D::Rectangle* pRect = static_cast<opengl3D::Rectangle*>(&maShapes.back());\n glm::vec3 aTopLeft;\n glm::vec3 aTopRight = aTopLeft;\n aTopRight.x = nXEnd;\n glm::vec3 aBottomRight = aTopRight;\n aBottomRight.y = nYPos;\n pRect->setPosition(aTopLeft, aTopRight, aBottomRight);\n pRect->setFillColor(COL_BLACK);\n pRect->setLineColor(COL_BLUE);\n\n \/\/ Create category texts along X-axis at the bottom.\n uno::Sequence<OUString> aCats = rCatProvider.getSimpleCategories();\n for (sal_Int32 i = 0; i < aCats.getLength(); ++i)\n {\n float nXPos = i * (nBarSizeX + nBarDistanceX);\n\n maShapes.push_back(new opengl3D::Text(mpRenderer.get(), aCats[i], nId++));\n opengl3D::Text* p = static_cast<opengl3D::Text*>(&maShapes.back());\n Size aTextSize = p->getSize();\n aTopLeft.x = nXPos;\n aTopLeft.y = nYPos;\n aTopRight = aTopLeft;\n aTopRight.x += aTextSize.getWidth();\n aBottomRight = aTopRight;\n aBottomRight.y += aTextSize.getHeight();\n p->setPosition(aTopLeft, aTopRight, aBottomRight);\n }\n}\n\nvoid GL3DBarChart::render()\n{\n mrWindow.getContext()->makeCurrent();\n Size aSize = mrWindow.GetSizePixel();\n mpRenderer->SetSize(aSize);\n mrWindow.getContext()->setWinSize(aSize);\n for(boost::ptr_vector<opengl3D::Renderable3DObject>::iterator itr = maShapes.begin(),\n itrEnd = maShapes.end(); itr != itrEnd; ++itr)\n {\n itr->render();\n }\n mpRenderer->ProcessUnrenderedShape();\n mrWindow.getContext()->swapBuffers();\n}\n\nvoid GL3DBarChart::update()\n{\n render();\n}\n\nnamespace {\n\nclass PickingModeSetter\n{\nprivate:\n opengl3D::OpenGL3DRenderer* mpRenderer;\n\npublic:\n PickingModeSetter(opengl3D::OpenGL3DRenderer* pRenderer):\n mpRenderer(pRenderer)\n {\n mpRenderer->SetPickingMode(true);\n }\n\n ~PickingModeSetter()\n {\n mpRenderer->SetPickingMode(false);\n }\n};\n\n}\n\nvoid GL3DBarChart::clickedAt(const Point& )\n{\n {\n PickingModeSetter(mpRenderer.get());\n render();\n }\n if (mpCamera)\n mpCamera->zoom(1);\n}\n\n}\n\n\/* vim:set shiftwidth=4 softtabstop=4 expandtab: *\/\n<commit_msg>prevent access to uninitialized variables<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 <GL3DBarChart.hxx>\n\n#include <GL\/glew.h>\n\n#include <glm\/glm.hpp>\n#include <glm\/gtx\/transform.hpp>\n\n#include \"3DChartObjects.hxx\"\n#include \"GL3DRenderer.hxx\"\n#include <ExplicitCategoriesProvider.hxx>\n#include <DataSeriesHelper.hxx>\n\nusing namespace com::sun::star;\n\nnamespace chart {\n\nGL3DBarChart::GL3DBarChart(\n const css::uno::Reference<css::chart2::XChartType>& xChartType,\n OpenGLWindow& rWindow) :\n mxChartType(xChartType),\n mpRenderer(new opengl3D::OpenGL3DRenderer()),\n mrWindow(rWindow),\n mpCamera(NULL)\n{\n Size aSize = mrWindow.GetSizePixel();\n mpRenderer->SetSize(aSize);\n mrWindow.setRenderer(this);\n mpRenderer->init();\n}\n\nGL3DBarChart::~GL3DBarChart()\n{\n mrWindow.setRenderer(NULL);\n}\n\nvoid GL3DBarChart::create3DShapes(const boost::ptr_vector<VDataSeries>& rDataSeriesContainer,\n ExplicitCategoriesProvider& rCatProvider)\n{\n \/\/ Each series of data flows from left to right, and multiple series are\n \/\/ stacked vertically along y axis.\n\n \/\/ NOTE: These objects are created and positioned in a totally blind\n \/\/ fashion since we don't even have a way to see them on screen. So, no\n \/\/ guarantee they are positioned correctly. In fact, they are guaranteed\n \/\/ to be positioned incorrectly.\n\n const float nBarSizeX = 10;\n const float nBarSizeY = 10;\n const float nBarDistanceX = nBarSizeX \/ 2;\n const float nBarDistanceY = nBarSizeY \/ 2;\n\n sal_uInt32 nId = 1;\n float nXEnd = 0.0;\n float nYPos = 0.0;\n\n const Color aSeriesColor[] = {\n COL_RED, COL_GREEN, COL_YELLOW, COL_BROWN, COL_GRAY\n };\n\n maShapes.clear();\n maShapes.push_back(new opengl3D::Camera(mpRenderer.get()));\n mpCamera = static_cast<opengl3D::Camera*>(&maShapes.back());\n\n sal_Int32 nSeriesIndex = 0;\n for (boost::ptr_vector<VDataSeries>::const_iterator itr = rDataSeriesContainer.begin(),\n itrEnd = rDataSeriesContainer.end(); itr != itrEnd; ++itr)\n {\n nYPos = nSeriesIndex * (nBarSizeY + nBarDistanceY);\n\n const VDataSeries& rDataSeries = *itr;\n sal_Int32 nPointCount = rDataSeries.getTotalPointCount();\n\n bool bMappedFillProperty = rDataSeries.hasPropertyMapping(\"FillColor\");\n\n \/\/ Create series name text object.\n OUString aSeriesName =\n DataSeriesHelper::getDataSeriesLabel(\n rDataSeries.getModel(), mxChartType->getRoleOfSequenceForSeriesLabel());\n\n maShapes.push_back(new opengl3D::Text(mpRenderer.get(), aSeriesName, nId++));\n opengl3D::Text* p = static_cast<opengl3D::Text*>(&maShapes.back());\n Size aTextSize = p->getSize();\n glm::vec3 aTopLeft, aTopRight, aBottomRight;\n aTopLeft.x = aTextSize.getWidth() * -1.0;\n aTopLeft.y = nYPos;\n aTopRight.y = nYPos;\n aBottomRight = aTopRight;\n aBottomRight.y += aTextSize.getHeight();\n p->setPosition(aTopLeft, aTopRight, aBottomRight);\n\n sal_Int32 nColor = aSeriesColor[nSeriesIndex % SAL_N_ELEMENTS(aSeriesColor)].GetColor();\n for(sal_Int32 nIndex = 0; nIndex < nPointCount; ++nIndex)\n {\n if(bMappedFillProperty)\n {\n nColor = static_cast<sal_uInt32>(rDataSeries.getValueByProperty(nIndex, \"FillColor\"));\n }\n\n float nVal = rDataSeries.getYValue(nIndex);\n float nXPos = nIndex * (nBarSizeX + nBarDistanceX);\n\n\n glm::mat4 aScaleMatrix = glm::scale(nBarSizeX, nBarSizeY, nVal);\n glm::mat4 aTranslationMatrix = glm::translate(nXPos, nYPos, 0.0f);\n glm::mat4 aBarPosition = aTranslationMatrix * aScaleMatrix;\n\n maShapes.push_back(new opengl3D::Bar(mpRenderer.get(), aBarPosition, nColor, nId++));\n }\n\n float nThisXEnd = nPointCount * (nBarSizeX + nBarDistanceX);\n if (nXEnd < nThisXEnd)\n nXEnd = nThisXEnd;\n\n ++nSeriesIndex;\n }\n\n nYPos += nBarSizeY + nBarDistanceY;\n\n \/\/ X axis\n maShapes.push_back(new opengl3D::Line(mpRenderer.get(), nId++));\n opengl3D::Line* pAxis = static_cast<opengl3D::Line*>(&maShapes.back());\n glm::vec3 aBegin;\n aBegin.y = nYPos;\n glm::vec3 aEnd = aBegin;\n aEnd.x = nXEnd;\n pAxis->setPosition(aBegin, aEnd);\n pAxis->setLineColor(COL_BLUE);\n\n \/\/ Y axis\n maShapes.push_back(new opengl3D::Line(mpRenderer.get(), nId++));\n pAxis = static_cast<opengl3D::Line*>(&maShapes.back());\n aBegin.x = aBegin.y = 0;\n aEnd = aBegin;\n aEnd.y = nYPos;\n pAxis->setPosition(aBegin, aEnd);\n pAxis->setLineColor(COL_BLUE);\n\n \/\/ Chart background.\n maShapes.push_back(new opengl3D::Rectangle(mpRenderer.get(), nId++));\n opengl3D::Rectangle* pRect = static_cast<opengl3D::Rectangle*>(&maShapes.back());\n glm::vec3 aTopLeft;\n glm::vec3 aTopRight = aTopLeft;\n aTopRight.x = nXEnd;\n glm::vec3 aBottomRight = aTopRight;\n aBottomRight.y = nYPos;\n pRect->setPosition(aTopLeft, aTopRight, aBottomRight);\n pRect->setFillColor(COL_BLACK);\n pRect->setLineColor(COL_BLUE);\n\n \/\/ Create category texts along X-axis at the bottom.\n uno::Sequence<OUString> aCats = rCatProvider.getSimpleCategories();\n for (sal_Int32 i = 0; i < aCats.getLength(); ++i)\n {\n float nXPos = i * (nBarSizeX + nBarDistanceX);\n\n maShapes.push_back(new opengl3D::Text(mpRenderer.get(), aCats[i], nId++));\n opengl3D::Text* p = static_cast<opengl3D::Text*>(&maShapes.back());\n Size aTextSize = p->getSize();\n aTopLeft.x = nXPos;\n aTopLeft.y = nYPos;\n aTopRight = aTopLeft;\n aTopRight.x += aTextSize.getWidth();\n aBottomRight = aTopRight;\n aBottomRight.y += aTextSize.getHeight();\n p->setPosition(aTopLeft, aTopRight, aBottomRight);\n }\n}\n\nvoid GL3DBarChart::render()\n{\n mrWindow.getContext()->makeCurrent();\n Size aSize = mrWindow.GetSizePixel();\n mpRenderer->SetSize(aSize);\n mrWindow.getContext()->setWinSize(aSize);\n for(boost::ptr_vector<opengl3D::Renderable3DObject>::iterator itr = maShapes.begin(),\n itrEnd = maShapes.end(); itr != itrEnd; ++itr)\n {\n itr->render();\n }\n mpRenderer->ProcessUnrenderedShape();\n mrWindow.getContext()->swapBuffers();\n}\n\nvoid GL3DBarChart::update()\n{\n render();\n}\n\nnamespace {\n\nclass PickingModeSetter\n{\nprivate:\n opengl3D::OpenGL3DRenderer* mpRenderer;\n\npublic:\n PickingModeSetter(opengl3D::OpenGL3DRenderer* pRenderer):\n mpRenderer(pRenderer)\n {\n mpRenderer->SetPickingMode(true);\n }\n\n ~PickingModeSetter()\n {\n mpRenderer->SetPickingMode(false);\n }\n};\n\n}\n\nvoid GL3DBarChart::clickedAt(const Point& )\n{\n {\n PickingModeSetter(mpRenderer.get());\n render();\n }\n if (mpCamera)\n mpCamera->zoom(1);\n}\n\n}\n\n\/* vim:set shiftwidth=4 softtabstop=4 expandtab: *\/\n<|endoftext|>"} {"text":"<commit_before>#include \"Thread.hpp\"\n\n#include <Windows.h>\n\nnamespace Util\n{\n namespace Thread\n {\n uintmax_t GetCurrentThreadId()\n {\n#ifdef _WIN64\n \/*\n mov rax,qword ptr gs:[30h]\n mov eax,dword ptr [rax+48h]\n *\/\n return Pointer(__readgsqword(0x30))(0x48).Read<uint64_t>();\n#else\n \/*\n mov eax,dword ptr fs:[18h]\n mov eax,dword ptr [eax+24h]\n *\/\n return Pointer(__readfsdword(0x18))(0x24).Read<uint32_t>();\n#endif\n }\n\n Pointer GetThreadLocalStorage(size_t Index)\n {\n \/\/#ifdef _WIN64\n \/\/ return Pointer(\n \/\/ __readgsqword(0x1480 + static_cast<uint32_t>(Index) * 8)\n \/\/ );\n \/\/#else\n \/\/ return Pointer(\n \/\/ __readfsdword(0x18)\n \/\/ )(0xE10 + static_cast<uint32_t>(Index) * 4).Read<uintptr_t>();\n \/\/#endif\n return TlsGetValue(Index);\n }\n }\n}<commit_msg>TLS slot downcasted to dword<commit_after>#include \"Thread.hpp\"\n\n#include <Windows.h>\n\nnamespace Util\n{\n namespace Thread\n {\n uintmax_t GetCurrentThreadId()\n {\n#ifdef _WIN64\n \/*\n mov rax,qword ptr gs:[30h]\n mov eax,dword ptr [rax+48h]\n *\/\n return Pointer(__readgsqword(0x30))(0x48).Read<uint64_t>();\n#else\n \/*\n mov eax,dword ptr fs:[18h]\n mov eax,dword ptr [eax+24h]\n *\/\n return Pointer(__readfsdword(0x18))(0x24).Read<uint32_t>();\n#endif\n }\n\n Pointer GetThreadLocalStorage(size_t Index)\n {\n \/\/#ifdef _WIN64\n \/\/ return Pointer(\n \/\/ __readgsqword(0x1480 + static_cast<uint32_t>(Index) * 8)\n \/\/ );\n \/\/#else\n \/\/ return Pointer(\n \/\/ __readfsdword(0x18)\n \/\/ )(0xE10 + static_cast<uint32_t>(Index) * 4).Read<uintptr_t>();\n \/\/#endif\n return TlsGetValue(static_cast<uint32_t>(Index));\n }\n }\n}<|endoftext|>"} {"text":"<commit_before>\/\/ Copyright (c) 2009 The Chromium Authors. All rights reserved.\n\/\/ Use of this source code is governed by a BSD-style license that can be\n\/\/ found in the LICENSE file.\n\n#include \"chrome\/browser\/extensions\/extension_creator.h\"\n\n#include <vector>\n#include <string>\n\n#include \"base\/crypto\/rsa_private_key.h\"\n#include \"base\/crypto\/signature_creator.h\"\n#include \"base\/file_util.h\"\n#include \"base\/scoped_handle.h\"\n#include \"base\/string_util.h\"\n#include \"chrome\/browser\/extensions\/sandboxed_extension_unpacker.h\"\n#include \"chrome\/common\/extensions\/extension.h\"\n#include \"chrome\/common\/zip.h\"\n#include \"net\/base\/base64.h\"\n\nnamespace {\n const int kRSAKeySize = 1024;\n};\n\nbool ExtensionCreator::InitializeInput(\n const FilePath& extension_dir,\n const FilePath& private_key_path,\n const FilePath& private_key_output_path) {\n \/\/ Validate input |extension_dir|.\n if (extension_dir.value().empty() ||\n !file_util::DirectoryExists(extension_dir)) {\n error_message_ = \"Input directory must exist.\";\n return false;\n }\n\n \/\/ Validate input |private_key| (if provided).\n if (!private_key_path.value().empty() &&\n !file_util::PathExists(private_key_path)) {\n error_message_ = \"Input value for private key must be a valid path.\";\n return false;\n }\n\n \/\/ If an |output_private_key| path is given, make sure it doesn't over-write\n \/\/ an existing private key.\n if (private_key_path.value().empty() &&\n !private_key_output_path.value().empty() &&\n file_util::PathExists(private_key_output_path)) {\n error_message_ = \"A private key for specified extension already exists. \"\n \"Reuse that key or delete it first.\";\n return false;\n }\n\n return true;\n}\n\nbase::RSAPrivateKey* ExtensionCreator::ReadInputKey(const FilePath&\n private_key_path) {\n if (!file_util::PathExists(private_key_path)) {\n error_message_ = \"Input value for private key must exist.\";\n return false;\n }\n\n std::string private_key_contents;\n if (!file_util::ReadFileToString(private_key_path,\n &private_key_contents)) {\n error_message_ = \"Failed to read private key.\";\n return false;\n }\n\n std::string private_key_bytes;\n if (!Extension::ParsePEMKeyBytes(private_key_contents,\n &private_key_bytes)) {\n error_message_ = \"Invalid private key.\";\n return false;\n }\n\n return base::RSAPrivateKey::CreateFromPrivateKeyInfo(\n std::vector<uint8>(private_key_bytes.begin(), private_key_bytes.end()));\n}\n\nbase::RSAPrivateKey* ExtensionCreator::GenerateKey(const FilePath&\n output_private_key_path) {\n scoped_ptr<base::RSAPrivateKey> key_pair(\n base::RSAPrivateKey::Create(kRSAKeySize));\n if (!key_pair.get()) {\n error_message_ = \"Yikes! Failed to generate random RSA private key.\";\n return NULL;\n }\n\n std::vector<uint8> private_key_vector;\n if (!key_pair->ExportPrivateKey(&private_key_vector)) {\n error_message_ = \"Failed to export private key.\";\n return NULL;\n }\n std::string private_key_bytes(\n reinterpret_cast<char*>(&private_key_vector.front()),\n private_key_vector.size());\n\n std::string private_key;\n if (!Extension::ProducePEM(private_key_bytes, &private_key)) {\n error_message_ = \"Failed to output private key.\";\n return NULL;\n }\n std::string pem_output;\n if (!Extension::FormatPEMForFileOutput(private_key, &pem_output,\n false)) {\n error_message_ = \"Failed to output private key.\";\n return NULL;\n }\n\n if (!output_private_key_path.empty()) {\n if (-1 == file_util::WriteFile(output_private_key_path,\n pem_output.c_str(), pem_output.size())) {\n error_message_ = \"Failed to write private key.\";\n return NULL;\n }\n }\n\n return key_pair.release();\n}\n\nbool ExtensionCreator::CreateZip(const FilePath& extension_dir,\n FilePath* zip_path) {\n file_util::CreateNewTempDirectory(FILE_PATH_LITERAL(\"chrome_\"), zip_path);\n *zip_path = zip_path->Append(FILE_PATH_LITERAL(\"extension.zip\"));\n\n if (!Zip(extension_dir, *zip_path)) {\n error_message_ = \"Failed to create temporary zip file during packaging.\";\n return false;\n }\n\n return true;\n}\n\nbool ExtensionCreator::SignZip(const FilePath& zip_path,\n base::RSAPrivateKey* private_key,\n std::vector<uint8>* signature) {\n scoped_ptr<base::SignatureCreator> signature_creator(\n base::SignatureCreator::Create(private_key));\n ScopedStdioHandle zip_handle(file_util::OpenFile(zip_path, \"rb\"));\n uint8 buffer[1 << 16];\n int bytes_read = -1;\n while ((bytes_read = fread(buffer, 1, sizeof(buffer),\n zip_handle.get())) > 0) {\n if (!signature_creator->Update(buffer, bytes_read)) {\n error_message_ = \"Error while signing extension.\";\n return false;\n }\n }\n zip_handle.Close();\n\n signature_creator->Final(signature);\n return true;\n}\n\nbool ExtensionCreator::WriteCRX(const FilePath& zip_path,\n base::RSAPrivateKey* private_key,\n const std::vector<uint8>& signature,\n const FilePath& crx_path) {\n if (file_util::PathExists(crx_path))\n file_util::Delete(crx_path, false);\n ScopedStdioHandle crx_handle(file_util::OpenFile(crx_path, \"wb\"));\n\n std::vector<uint8> public_key;\n if (!private_key->ExportPublicKey(&public_key)) {\n error_message_ = \"Failed to export public key.\";\n return false;\n }\n\n SandboxedExtensionUnpacker::ExtensionHeader header;\n memcpy(&header.magic, SandboxedExtensionUnpacker::kExtensionHeaderMagic,\n SandboxedExtensionUnpacker::kExtensionHeaderMagicSize);\n header.version = SandboxedExtensionUnpacker::kCurrentVersion;\n header.key_size = public_key.size();\n header.signature_size = signature.size();\n\n fwrite(&header, sizeof(SandboxedExtensionUnpacker::ExtensionHeader), 1,\n crx_handle.get());\n fwrite(&public_key.front(), sizeof(uint8), public_key.size(),\n crx_handle.get());\n fwrite(&signature.front(), sizeof(uint8), signature.size(),\n crx_handle.get());\n\n uint8 buffer[1 << 16];\n int bytes_read = -1;\n ScopedStdioHandle zip_handle(file_util::OpenFile(zip_path, \"rb\"));\n while ((bytes_read = fread(buffer, 1, sizeof(buffer),\n zip_handle.get())) > 0) {\n fwrite(buffer, sizeof(char), bytes_read, crx_handle.get());\n }\n\n return true;\n}\n\nbool ExtensionCreator::Run(const FilePath& extension_dir,\n const FilePath& crx_path,\n const FilePath& private_key_path,\n const FilePath& output_private_key_path) {\n \/\/ Check input diretory and read manifest.\n if (!InitializeInput(extension_dir, private_key_path,\n output_private_key_path)) {\n return false;\n }\n\n \/\/ Initialize Key Pair\n scoped_ptr<base::RSAPrivateKey> key_pair;\n if (!private_key_path.value().empty())\n key_pair.reset(ReadInputKey(private_key_path));\n else\n key_pair.reset(GenerateKey(output_private_key_path));\n if (!key_pair.get())\n return false;\n\n \/\/ Zip up the extension.\n FilePath zip_path;\n std::vector<uint8> signature;\n bool result = false;\n if (CreateZip(extension_dir, &zip_path) &&\n SignZip(zip_path, key_pair.get(), &signature) &&\n WriteCRX(zip_path, key_pair.get(), signature, crx_path)) {\n result = true;\n }\n\n file_util::Delete(zip_path, false);\n return result;\n}\n<commit_msg>Use heap memory intead of stack memory to avoid having to grow the stack.<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_creator.h\"\n\n#include <vector>\n#include <string>\n\n#include \"base\/crypto\/rsa_private_key.h\"\n#include \"base\/crypto\/signature_creator.h\"\n#include \"base\/file_util.h\"\n#include \"base\/scoped_handle.h\"\n#include \"base\/string_util.h\"\n#include \"chrome\/browser\/extensions\/sandboxed_extension_unpacker.h\"\n#include \"chrome\/common\/extensions\/extension.h\"\n#include \"chrome\/common\/zip.h\"\n#include \"net\/base\/base64.h\"\n\nnamespace {\n const int kRSAKeySize = 1024;\n};\n\nbool ExtensionCreator::InitializeInput(\n const FilePath& extension_dir,\n const FilePath& private_key_path,\n const FilePath& private_key_output_path) {\n \/\/ Validate input |extension_dir|.\n if (extension_dir.value().empty() ||\n !file_util::DirectoryExists(extension_dir)) {\n error_message_ = \"Input directory must exist.\";\n return false;\n }\n\n \/\/ Validate input |private_key| (if provided).\n if (!private_key_path.value().empty() &&\n !file_util::PathExists(private_key_path)) {\n error_message_ = \"Input value for private key must be a valid path.\";\n return false;\n }\n\n \/\/ If an |output_private_key| path is given, make sure it doesn't over-write\n \/\/ an existing private key.\n if (private_key_path.value().empty() &&\n !private_key_output_path.value().empty() &&\n file_util::PathExists(private_key_output_path)) {\n error_message_ = \"A private key for specified extension already exists. \"\n \"Reuse that key or delete it first.\";\n return false;\n }\n\n return true;\n}\n\nbase::RSAPrivateKey* ExtensionCreator::ReadInputKey(const FilePath&\n private_key_path) {\n if (!file_util::PathExists(private_key_path)) {\n error_message_ = \"Input value for private key must exist.\";\n return false;\n }\n\n std::string private_key_contents;\n if (!file_util::ReadFileToString(private_key_path,\n &private_key_contents)) {\n error_message_ = \"Failed to read private key.\";\n return false;\n }\n\n std::string private_key_bytes;\n if (!Extension::ParsePEMKeyBytes(private_key_contents,\n &private_key_bytes)) {\n error_message_ = \"Invalid private key.\";\n return false;\n }\n\n return base::RSAPrivateKey::CreateFromPrivateKeyInfo(\n std::vector<uint8>(private_key_bytes.begin(), private_key_bytes.end()));\n}\n\nbase::RSAPrivateKey* ExtensionCreator::GenerateKey(const FilePath&\n output_private_key_path) {\n scoped_ptr<base::RSAPrivateKey> key_pair(\n base::RSAPrivateKey::Create(kRSAKeySize));\n if (!key_pair.get()) {\n error_message_ = \"Yikes! Failed to generate random RSA private key.\";\n return NULL;\n }\n\n std::vector<uint8> private_key_vector;\n if (!key_pair->ExportPrivateKey(&private_key_vector)) {\n error_message_ = \"Failed to export private key.\";\n return NULL;\n }\n std::string private_key_bytes(\n reinterpret_cast<char*>(&private_key_vector.front()),\n private_key_vector.size());\n\n std::string private_key;\n if (!Extension::ProducePEM(private_key_bytes, &private_key)) {\n error_message_ = \"Failed to output private key.\";\n return NULL;\n }\n std::string pem_output;\n if (!Extension::FormatPEMForFileOutput(private_key, &pem_output,\n false)) {\n error_message_ = \"Failed to output private key.\";\n return NULL;\n }\n\n if (!output_private_key_path.empty()) {\n if (-1 == file_util::WriteFile(output_private_key_path,\n pem_output.c_str(), pem_output.size())) {\n error_message_ = \"Failed to write private key.\";\n return NULL;\n }\n }\n\n return key_pair.release();\n}\n\nbool ExtensionCreator::CreateZip(const FilePath& extension_dir,\n FilePath* zip_path) {\n file_util::CreateNewTempDirectory(FILE_PATH_LITERAL(\"chrome_\"), zip_path);\n *zip_path = zip_path->Append(FILE_PATH_LITERAL(\"extension.zip\"));\n\n if (!Zip(extension_dir, *zip_path)) {\n error_message_ = \"Failed to create temporary zip file during packaging.\";\n return false;\n }\n\n return true;\n}\n\nbool ExtensionCreator::SignZip(const FilePath& zip_path,\n base::RSAPrivateKey* private_key,\n std::vector<uint8>* signature) {\n scoped_ptr<base::SignatureCreator> signature_creator(\n base::SignatureCreator::Create(private_key));\n ScopedStdioHandle zip_handle(file_util::OpenFile(zip_path, \"rb\"));\n size_t buffer_size = 1 << 16;\n scoped_array<uint8> buffer(new uint8[buffer_size]);\n int bytes_read = -1;\n while ((bytes_read = fread(buffer.get(), 1, buffer_size,\n zip_handle.get())) > 0) {\n if (!signature_creator->Update(buffer.get(), bytes_read)) {\n error_message_ = \"Error while signing extension.\";\n return false;\n }\n }\n zip_handle.Close();\n\n signature_creator->Final(signature);\n return true;\n}\n\nbool ExtensionCreator::WriteCRX(const FilePath& zip_path,\n base::RSAPrivateKey* private_key,\n const std::vector<uint8>& signature,\n const FilePath& crx_path) {\n if (file_util::PathExists(crx_path))\n file_util::Delete(crx_path, false);\n ScopedStdioHandle crx_handle(file_util::OpenFile(crx_path, \"wb\"));\n\n std::vector<uint8> public_key;\n if (!private_key->ExportPublicKey(&public_key)) {\n error_message_ = \"Failed to export public key.\";\n return false;\n }\n\n SandboxedExtensionUnpacker::ExtensionHeader header;\n memcpy(&header.magic, SandboxedExtensionUnpacker::kExtensionHeaderMagic,\n SandboxedExtensionUnpacker::kExtensionHeaderMagicSize);\n header.version = SandboxedExtensionUnpacker::kCurrentVersion;\n header.key_size = public_key.size();\n header.signature_size = signature.size();\n\n fwrite(&header, sizeof(SandboxedExtensionUnpacker::ExtensionHeader), 1,\n crx_handle.get());\n fwrite(&public_key.front(), sizeof(uint8), public_key.size(),\n crx_handle.get());\n fwrite(&signature.front(), sizeof(uint8), signature.size(),\n crx_handle.get());\n\n size_t buffer_size = 1 << 16;\n scoped_array<uint8> buffer(new uint8[buffer_size]);\n int bytes_read = -1;\n ScopedStdioHandle zip_handle(file_util::OpenFile(zip_path, \"rb\"));\n while ((bytes_read = fread(buffer.get(), 1, buffer_size,\n zip_handle.get())) > 0) {\n fwrite(buffer.get(), sizeof(char), bytes_read, crx_handle.get());\n }\n\n return true;\n}\n\nbool ExtensionCreator::Run(const FilePath& extension_dir,\n const FilePath& crx_path,\n const FilePath& private_key_path,\n const FilePath& output_private_key_path) {\n \/\/ Check input diretory and read manifest.\n if (!InitializeInput(extension_dir, private_key_path,\n output_private_key_path)) {\n return false;\n }\n\n \/\/ Initialize Key Pair\n scoped_ptr<base::RSAPrivateKey> key_pair;\n if (!private_key_path.value().empty())\n key_pair.reset(ReadInputKey(private_key_path));\n else\n key_pair.reset(GenerateKey(output_private_key_path));\n if (!key_pair.get())\n return false;\n\n \/\/ Zip up the extension.\n FilePath zip_path;\n std::vector<uint8> signature;\n bool result = false;\n if (CreateZip(extension_dir, &zip_path) &&\n SignZip(zip_path, key_pair.get(), &signature) &&\n WriteCRX(zip_path, key_pair.get(), signature, crx_path)) {\n result = true;\n }\n\n file_util::Delete(zip_path, false);\n return result;\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\/browser.h\"\n#include \"chrome\/browser\/browser_window.h\"\n#include \"chrome\/browser\/gtk\/view_id_util.h\"\n#include \"chrome\/common\/url_constants.h\"\n#include \"chrome\/test\/in_process_browser_test.h\"\n\nclass ViewIDTest : public InProcessBrowserTest {\n public:\n ViewIDTest() : root_window_(NULL) {}\n\n void CheckViewID(ViewID id, bool should_have) {\n if (!root_window_)\n root_window_ = GTK_WIDGET(browser()->window()->GetNativeHandle());\n\n ASSERT_TRUE(root_window_);\n EXPECT_EQ(should_have, !!ViewIDUtil::GetWidget(root_window_, id));\n }\n\n private:\n GtkWidget* root_window_;\n};\n\nIN_PROC_BROWSER_TEST_F(ViewIDTest, Basic) {\n for (int i = VIEW_ID_TOOLBAR; i < VIEW_ID_PREDEFINED_COUNT; ++i) {\n CheckViewID(static_cast<ViewID>(i), true);\n }\n\n CheckViewID(VIEW_ID_PREDEFINED_COUNT, false);\n}\n\nIN_PROC_BROWSER_TEST_F(ViewIDTest, Delegate) {\n CheckViewID(VIEW_ID_TAB_0, true);\n CheckViewID(VIEW_ID_TAB_1, false);\n\n browser()->OpenURL(GURL(chrome::kAboutBlankURL), GURL(),\n NEW_BACKGROUND_TAB, PageTransition::TYPED);\n\n CheckViewID(VIEW_ID_TAB_0, true);\n CheckViewID(VIEW_ID_TAB_1, true);\n}\n<commit_msg>Fix my view id util browsertest breakage.<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\/browser.h\"\n#include \"chrome\/browser\/browser_window.h\"\n#include \"chrome\/browser\/gtk\/view_id_util.h\"\n#include \"chrome\/common\/url_constants.h\"\n#include \"chrome\/test\/in_process_browser_test.h\"\n\nclass ViewIDTest : public InProcessBrowserTest {\n public:\n ViewIDTest() : root_window_(NULL) {}\n\n void CheckViewID(ViewID id, bool should_have) {\n if (!root_window_)\n root_window_ = GTK_WIDGET(browser()->window()->GetNativeHandle());\n\n ASSERT_TRUE(root_window_);\n EXPECT_EQ(should_have, !!ViewIDUtil::GetWidget(root_window_, id));\n }\n\n private:\n GtkWidget* root_window_;\n};\n\nIN_PROC_BROWSER_TEST_F(ViewIDTest, Basic) {\n for (int i = VIEW_ID_TOOLBAR; i < VIEW_ID_PREDEFINED_COUNT; ++i) {\n \/\/ http:\/\/crbug.com\/21152\n if (i == VIEW_ID_BOOKMARK_MENU)\n continue;\n\n CheckViewID(static_cast<ViewID>(i), true);\n }\n\n CheckViewID(VIEW_ID_PREDEFINED_COUNT, false);\n}\n\nIN_PROC_BROWSER_TEST_F(ViewIDTest, Delegate) {\n CheckViewID(VIEW_ID_TAB_0, true);\n CheckViewID(VIEW_ID_TAB_1, false);\n\n browser()->OpenURL(GURL(chrome::kAboutBlankURL), GURL(),\n NEW_BACKGROUND_TAB, PageTransition::TYPED);\n\n CheckViewID(VIEW_ID_TAB_0, true);\n CheckViewID(VIEW_ID_TAB_1, true);\n}\n<|endoftext|>"} {"text":"<commit_before>AliAnalysisTask *AddTaskHFECal()\n{\n AliAnalysisManager *mgr = AliAnalysisManager::GetAnalysisManager();\n if (!mgr) {\n Error(\"AddTaskHFEECal\", \"No analysis manager found.\");\n return NULL;\n }\n\n if (!mgr->GetInputEventHandler()) {\n ::Error(\"AddTaskHFECal\", \"This task requires an input event handler\");\n return NULL;\n }\n TString type = mgr->GetInputEventHandler()->GetDataType(); \/\/ can be \"ESD\" or \"AOD\"\n if (type==\"AOD\"){\n ::Error(\"AddTaskHFECal\", \"The tasks exits because AODs are in input\");\n return NULL;\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 \n \/\/analysis task \n gROOT->LoadMacro(\"$ALICE_ROOT\/PWGHF\/hfe\/macros\/configs\/PbPb\/ConfigHFECal.C\");\n\n AliAnalysisTaskHFECal *hfetaskCent = ConfigHFECal(MCthere);\n AliAnalysisTaskHFECal *hfetaskTrig= ConfigHFECal(MCthere);\n \n mgr->AddTask(hfetaskCent);\n mgr->AddTask(hfetaskTrig);\n \n \/\/ Semi-central trigger\n hfetaskCent->SelectCollisionCandidates(AliVEvent::kCentral);\n \n TString containerName = mgr->GetCommonFileName();\n containerName += \":PWGHF_hfeCalCentral\";\n \n AliAnalysisDataContainer *cinput = mgr->GetCommonInputContainer();\n AliAnalysisDataContainer *coutput1 = mgr->CreateContainer(\"HFE_Results_EMCalCentral\", TList::Class(),AliAnalysisManager::kOutputContainer, containerName.Data());\n mgr->ConnectInput(hfetaskCent, 0, cinput);\n mgr->ConnectOutput(hfetaskCent, 1, coutput1);\n \n \/\/L1 gamma trigger\n hfetaskTrig->SelectCollisionCandidates(AliVEvent::kEMCEGA);\n \n TString containerName2 = mgr->GetCommonFileName();\n containerName2 += \":PWGHF_hfeCalTrigEGA\";\n \n AliAnalysisDataContainer *cinput = mgr->GetCommonInputContainer();\n AliAnalysisDataContainer *coutput1 = mgr->CreateContainer(\"HFE_Results_EMCalTrigEGA\", TList::Class(),AliAnalysisManager::kOutputContainer, containerName2.Data());\n mgr->ConnectInput(hfetaskTrig, 0, cinput);\n mgr->ConnectOutput(hfetaskTrig, 1, coutput1);\n \n return NULL;\n}\n<commit_msg>upadted for MC<commit_after>AliAnalysisTask *AddTaskHFECal()\n{\n AliAnalysisManager *mgr = AliAnalysisManager::GetAnalysisManager();\n if (!mgr) {\n Error(\"AddTaskHFEECal\", \"No analysis manager found.\");\n return NULL;\n }\n\n if (!mgr->GetInputEventHandler()) {\n ::Error(\"AddTaskHFECal\", \"This task requires an input event handler\");\n return NULL;\n }\n TString type = mgr->GetInputEventHandler()->GetDataType(); \/\/ can be \"ESD\" or \"AOD\"\n if (type==\"AOD\"){\n ::Error(\"AddTaskHFECal\", \"The tasks exits because AODs are in input\");\n return NULL;\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 \n \/\/analysis task \n gROOT->LoadMacro(\"$ALICE_ROOT\/PWGHF\/hfe\/macros\/configs\/PbPb\/ConfigHFECal.C\");\n\n AliAnalysisTaskHFECal *hfetaskCent = ConfigHFECal(MCthere);\n AliAnalysisTaskHFECal *hfetaskTrig= ConfigHFECal(MCthere);\n \n mgr->AddTask(hfetaskCent);\n mgr->AddTask(hfetaskTrig);\n \n \/\/ Semi-central trigger\n hfetaskCent->SelectCollisionCandidates(AliVEvent::kCentral);\n \n TString containerName = mgr->GetCommonFileName();\n containerName += \":PWGHF_hfeCalCentral\";\n \n AliAnalysisDataContainer *cinput = mgr->GetCommonInputContainer();\n AliAnalysisDataContainer *coutput1 = mgr->CreateContainer(\"HFE_Results_EMCalCentral\", TList::Class(),AliAnalysisManager::kOutputContainer, containerName.Data());\n mgr->ConnectInput(hfetaskCent, 0, cinput);\n mgr->ConnectOutput(hfetaskCent, 1, coutput1);\n \n \/\/L1 gamma trigger\n hfetaskTrig->SelectCollisionCandidates(AliVEvent::kEMCEGA);\n \n TString containerName2 = mgr->GetCommonFileName();\n containerName2 += \":PWGHF_hfeCalTrigEGA\";\n \n AliAnalysisDataContainer *cinput = mgr->GetCommonInputContainer();\n AliAnalysisDataContainer *coutput1 = mgr->CreateContainer(\"HFE_Results_EMCalTrigEGA\", TList::Class(),AliAnalysisManager::kOutputContainer, containerName2.Data());\n mgr->ConnectInput(hfetaskTrig, 0, cinput);\n mgr->ConnectOutput(hfetaskTrig, 1, coutput1);\n \n if(MCthere)\n {\n \/\/MB trigger\n AliAnalysisTaskHFECal *hfetaskMB = ConfigHFECal(MCthere);\n mgr->AddTask(hfetaskMB);\n hfetaskMB->SelectCollisionCandidates(AliVEvent::kMB);\n\n TString containerName3 = mgr->GetCommonFileName();\n containerName3 += \":PWGHF_hfeCalkMB\";\n\n AliAnalysisDataContainer *cinput = mgr->GetCommonInputContainer();\n AliAnalysisDataContainer *coutput1 = mgr->CreateContainer(\"HFE_Results_EMCalMB\", TList::Class(),AliAnalysisManager::kOutputContainer, containerName3.Data());\n mgr->ConnectInput(hfetaskMB, 0, cinput);\n mgr->ConnectOutput(hfetaskMB, 1, coutput1);\n }\n \n\n return NULL;\n}\n<|endoftext|>"} {"text":"<commit_before>\/*************************************************************************\n *\n * OpenOffice.org - a multi-platform office productivity suite\n *\n * $RCSfile: setaccess.hxx,v $\n *\n * $Revision: 1.3 $\n *\n * last change: $Author: rt $ $Date: 2005-09-08 03:20: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 CONFIGMGR_API_SETACCESS_HXX_\n#define CONFIGMGR_API_SETACCESS_HXX_\n\n#ifndef _COM_SUN_STAR_CONTAINER_XHIERARCHICALNAME_HPP_\n#include <com\/sun\/star\/container\/XHierarchicalName.hpp>\n#endif\n#ifndef _COM_SUN_STAR_CONTAINER_XNAMEACCESS_HPP_\n#include <com\/sun\/star\/container\/XNameAccess.hpp>\n#endif\n#ifndef _COM_SUN_STAR_CONTAINER_XHIERARCHICALNAMEACCESS_HPP_\n#include <com\/sun\/star\/container\/XHierarchicalNameAccess.hpp>\n#endif\n#ifndef _COM_SUN_STAR_CONTAINER_XCONTAINER_HPP_\n#include <com\/sun\/star\/container\/XContainer.hpp>\n#endif\n#ifndef _COM_SUN_STAR_CONFIGURATION_XTEMPLATECONTAINER_HPP_\n#include <com\/sun\/star\/configuration\/XTemplateContainer.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_XPROPERTY_HPP_\n#include <com\/sun\/star\/beans\/XProperty.hpp>\n#endif\n#ifndef _COM_SUN_STAR_BEANS_XPROPERTYSETINFO_HPP_\n#include <com\/sun\/star\/beans\/XPropertySetInfo.hpp>\n#endif\n#ifndef _COM_SUN_STAR_UTIL_XSTRINGESCAPE_HPP_\n#include <com\/sun\/star\/util\/XStringEscape.hpp>\n#endif\n\n#ifndef _CPPUHELPER_IMPLBASE9_HXX_\n#include <cppuhelper\/implbase9.hxx>\n#endif\n\nnamespace configmgr\n{\n namespace css = ::com::sun::star;\n namespace uno = ::com::sun::star::uno;\n using rtl::OUString;\n\n namespace configapi { class NodeSetInfoAccess; }\n\n \/** implements the (read-only) interfaces supported by a set node\n within the configuration tree.\n <p> Is an interface adapter around <type scope='configmgr::configapi'>NodeAccess<\/type>.<\/p>\n *\/\n class BasicSetAccess\n : public ::cppu::ImplHelper9\n < css::container::XNameAccess\n , css::container::XHierarchicalName\n , css::container::XHierarchicalNameAccess\n , css::container::XContainer\n , css::beans::XExactName\n , css::beans::XProperty\n , css::beans::XPropertySetInfo\n , css::configuration::XTemplateContainer\n , css::util::XStringEscape\n >\n {\n protected:\n \/\/ Destructors\n virtual ~BasicSetAccess() {}\n\n public:\n \/\/ Interface methods\n \/\/ XHierarchicalName\n virtual OUString SAL_CALL\n getHierarchicalName( )\n throw(uno::RuntimeException);\n\n virtual OUString SAL_CALL\n composeHierarchicalName( const OUString& aRelativeName )\n throw(css::lang::IllegalArgumentException, css::lang::NoSupportException,\n uno::RuntimeException);\n\n \/\/ XElementAccess, base class of XNameAccess\n virtual uno::Type SAL_CALL\n getElementType( )\n throw(uno::RuntimeException);\n\n virtual sal_Bool SAL_CALL\n hasElements( )\n throw(uno::RuntimeException);\n\n \/\/ XNameAccess\n virtual uno::Any SAL_CALL\n getByName( const OUString& aName )\n throw(css::container::NoSuchElementException, css::lang::WrappedTargetException,\n uno::RuntimeException);\n\n virtual uno::Sequence< OUString > SAL_CALL\n getElementNames( )\n throw( uno::RuntimeException);\n\n virtual sal_Bool SAL_CALL\n hasByName( const OUString& aName )\n throw(uno::RuntimeException);\n\n \/\/ XHierarchicalNameAccess\n virtual uno::Any SAL_CALL\n getByHierarchicalName( const OUString& aName )\n throw(css::container::NoSuchElementException, uno::RuntimeException);\n\n virtual sal_Bool SAL_CALL\n hasByHierarchicalName( const OUString& aName )\n throw(uno::RuntimeException);\n\n \/\/ XContainer\n virtual void SAL_CALL\n addContainerListener( const uno::Reference< css::container::XContainerListener >& xListener )\n throw(uno::RuntimeException);\n\n virtual void SAL_CALL\n removeContainerListener( const uno::Reference< css::container::XContainerListener >& xListener )\n throw(uno::RuntimeException);\n\n \/\/ XExactName\n virtual OUString SAL_CALL\n getExactName( const OUString& aApproximateName )\n throw(uno::RuntimeException);\n\n \/\/ XProperty\n virtual css::beans::Property SAL_CALL\n getAsProperty( )\n throw(uno::RuntimeException);\n\n \/\/ XPropertySetInfo\n virtual uno::Sequence< css::beans::Property > SAL_CALL\n getProperties( )\n throw (uno::RuntimeException);\n\n virtual css::beans::Property SAL_CALL\n getPropertyByName( const OUString& aName )\n throw (css::beans::UnknownPropertyException, uno::RuntimeException);\n\n virtual sal_Bool SAL_CALL\n hasPropertyByName( const OUString& Name )\n throw (uno::RuntimeException);\n\n \/\/ XTemplateContainer\n OUString SAL_CALL\n getElementTemplateName( )\n throw(uno::RuntimeException);\n\n \/\/ XStringEscape\n OUString SAL_CALL\n escapeString( const OUString& aString )\n throw(css::lang::IllegalArgumentException, uno::RuntimeException);\n\n OUString SAL_CALL\n unescapeString( const OUString& aEscapedString )\n throw(css::lang::IllegalArgumentException, uno::RuntimeException);\n\n protected:\n virtual configapi::NodeSetInfoAccess& getNode() = 0;\n };\n\n}\n#endif \/\/ CONFIGMGR_API_SETACCESS_HXX_\n\n\n<commit_msg>INTEGRATION: CWS changefileheader (1.3.130); FILE MERGED 2008\/04\/01 15:06:33 thb 1.3.130.3: #i85898# Stripping all external header guards 2008\/04\/01 12:27:14 thb 1.3.130.2: #i85898# Stripping all external header guards 2008\/03\/31 12:22:38 rt 1.3.130.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: setaccess.hxx,v $\n * $Revision: 1.4 $\n *\n * This file is part of OpenOffice.org.\n *\n * OpenOffice.org is free software: you can redistribute it and\/or modify\n * it under the terms of the GNU Lesser General Public License version 3\n * only, as published by the Free Software Foundation.\n *\n * OpenOffice.org is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the\n * GNU Lesser General Public License version 3 for more details\n * (a copy is included in the LICENSE file that accompanied this code).\n *\n * You should have received a copy of the GNU Lesser General Public License\n * version 3 along with OpenOffice.org. If not, see\n * <http:\/\/www.openoffice.org\/license.html>\n * for a copy of the LGPLv3 License.\n *\n ************************************************************************\/\n\n#ifndef CONFIGMGR_API_SETACCESS_HXX_\n#define CONFIGMGR_API_SETACCESS_HXX_\n\n#include <com\/sun\/star\/container\/XHierarchicalName.hpp>\n#include <com\/sun\/star\/container\/XNameAccess.hpp>\n#include <com\/sun\/star\/container\/XHierarchicalNameAccess.hpp>\n#include <com\/sun\/star\/container\/XContainer.hpp>\n#include <com\/sun\/star\/configuration\/XTemplateContainer.hpp>\n#include <com\/sun\/star\/beans\/XExactName.hpp>\n#include <com\/sun\/star\/beans\/XProperty.hpp>\n#include <com\/sun\/star\/beans\/XPropertySetInfo.hpp>\n#include <com\/sun\/star\/util\/XStringEscape.hpp>\n#include <cppuhelper\/implbase9.hxx>\n\nnamespace configmgr\n{\n namespace css = ::com::sun::star;\n namespace uno = ::com::sun::star::uno;\n using rtl::OUString;\n\n namespace configapi { class NodeSetInfoAccess; }\n\n \/** implements the (read-only) interfaces supported by a set node\n within the configuration tree.\n <p> Is an interface adapter around <type scope='configmgr::configapi'>NodeAccess<\/type>.<\/p>\n *\/\n class BasicSetAccess\n : public ::cppu::ImplHelper9\n < css::container::XNameAccess\n , css::container::XHierarchicalName\n , css::container::XHierarchicalNameAccess\n , css::container::XContainer\n , css::beans::XExactName\n , css::beans::XProperty\n , css::beans::XPropertySetInfo\n , css::configuration::XTemplateContainer\n , css::util::XStringEscape\n >\n {\n protected:\n \/\/ Destructors\n virtual ~BasicSetAccess() {}\n\n public:\n \/\/ Interface methods\n \/\/ XHierarchicalName\n virtual OUString SAL_CALL\n getHierarchicalName( )\n throw(uno::RuntimeException);\n\n virtual OUString SAL_CALL\n composeHierarchicalName( const OUString& aRelativeName )\n throw(css::lang::IllegalArgumentException, css::lang::NoSupportException,\n uno::RuntimeException);\n\n \/\/ XElementAccess, base class of XNameAccess\n virtual uno::Type SAL_CALL\n getElementType( )\n throw(uno::RuntimeException);\n\n virtual sal_Bool SAL_CALL\n hasElements( )\n throw(uno::RuntimeException);\n\n \/\/ XNameAccess\n virtual uno::Any SAL_CALL\n getByName( const OUString& aName )\n throw(css::container::NoSuchElementException, css::lang::WrappedTargetException,\n uno::RuntimeException);\n\n virtual uno::Sequence< OUString > SAL_CALL\n getElementNames( )\n throw( uno::RuntimeException);\n\n virtual sal_Bool SAL_CALL\n hasByName( const OUString& aName )\n throw(uno::RuntimeException);\n\n \/\/ XHierarchicalNameAccess\n virtual uno::Any SAL_CALL\n getByHierarchicalName( const OUString& aName )\n throw(css::container::NoSuchElementException, uno::RuntimeException);\n\n virtual sal_Bool SAL_CALL\n hasByHierarchicalName( const OUString& aName )\n throw(uno::RuntimeException);\n\n \/\/ XContainer\n virtual void SAL_CALL\n addContainerListener( const uno::Reference< css::container::XContainerListener >& xListener )\n throw(uno::RuntimeException);\n\n virtual void SAL_CALL\n removeContainerListener( const uno::Reference< css::container::XContainerListener >& xListener )\n throw(uno::RuntimeException);\n\n \/\/ XExactName\n virtual OUString SAL_CALL\n getExactName( const OUString& aApproximateName )\n throw(uno::RuntimeException);\n\n \/\/ XProperty\n virtual css::beans::Property SAL_CALL\n getAsProperty( )\n throw(uno::RuntimeException);\n\n \/\/ XPropertySetInfo\n virtual uno::Sequence< css::beans::Property > SAL_CALL\n getProperties( )\n throw (uno::RuntimeException);\n\n virtual css::beans::Property SAL_CALL\n getPropertyByName( const OUString& aName )\n throw (css::beans::UnknownPropertyException, uno::RuntimeException);\n\n virtual sal_Bool SAL_CALL\n hasPropertyByName( const OUString& Name )\n throw (uno::RuntimeException);\n\n \/\/ XTemplateContainer\n OUString SAL_CALL\n getElementTemplateName( )\n throw(uno::RuntimeException);\n\n \/\/ XStringEscape\n OUString SAL_CALL\n escapeString( const OUString& aString )\n throw(css::lang::IllegalArgumentException, uno::RuntimeException);\n\n OUString SAL_CALL\n unescapeString( const OUString& aEscapedString )\n throw(css::lang::IllegalArgumentException, uno::RuntimeException);\n\n protected:\n virtual configapi::NodeSetInfoAccess& getNode() = 0;\n };\n\n}\n#endif \/\/ CONFIGMGR_API_SETACCESS_HXX_\n\n\n<|endoftext|>"} {"text":"<commit_before>\/**\n* C S O U N D V S T \n*\n* A VST plugin version of Csound, with Python scripting.\n*\n* L I C E N S E\n*\n* This software is free software; you can redistribute it and\/or\n* modify it under the terms of the GNU Lesser General Public\n* License as published by the Free Software Foundation; either\n* version 2.1 of 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 Software\n* Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA\n*\/\n#ifndef MIDIFILE_H\n#define MIDIFILE_H\n#ifdef SWIG\n%module CsoundVST\n%{\n#include <algorithm>\n#include <fstream>\n#include <iostream>\n#include <map>\n#include <string>\n#include <vector>\n%}\n%template(IntToDoubleMap) std::map<int, double>;\n#else\n#include <algorithm>\n#include <fstream>\n#include <iostream>\n#include <map>\n#include <string>\n#include <vector>\n#endif\n\nnamespace csound \n{\n\tclass MidiFile;\n\n\tclass Chunk\n\t{\n\tpublic:\n\t\tint id;\n\t\tint chunkSize;\n\t\tint chunkSizePosition;\n\t\tint chunkStart;\n\t\tint chunkEnd;\n\t\tChunk(const char *_id);\n\t\tvirtual ~Chunk(void);\n\t\tvirtual void read(std::istream &stream);\n\t\tvirtual void write(std::ostream &stream);\n\t\tvirtual void markChunkSize(std::ostream &stream);\n\t\tvirtual void markChunkStart(std::ostream &stream);\n\t\tvirtual void markChunkEnd(std::ostream &stream);\n\t};\n\n\tclass MidiHeader : public Chunk\n\t{\n\tpublic:\n\t\tshort type;\n\t\tshort trackCount;\n\t\tshort timeFormat;\n\t\tMidiHeader(void);\n\t\tvirtual ~MidiHeader(void);\n\t\tvirtual void clear(void);\n\t\tvirtual void read(std::istream &stream);\n\t\tvirtual void write(std::ostream &stream);\n\t};\n\t\n\t\/**\n\t* This class is used to store ALL Midi messages.\n\t*\/\n\tclass MidiEvent : public std::vector<unsigned char>\n\t{\n\tpublic:\n\t\tint ticks;\n\t\tdouble time;\n\t\tMidiEvent(void);\n\t\tvirtual ~MidiEvent(void);\n\t\tvirtual void read(std::istream &stream, MidiFile &midiFile);\n\t\tvirtual void write(std::ostream &stream, MidiFile &midiFile, int lastTick);\n\t\tvirtual int getStatus(void);\n\t\tvirtual int getStatusNybble(void);\n\t\tvirtual int getChannelNybble(void);\n\t\tvirtual int getKey(void);\n\t\tvirtual int getVelocity(void);\n\t\tvirtual int getMetaType(void);\n\t\tvirtual unsigned char getMetaData(int i);\n\t\tvirtual size_t getMetaSize(void);\n\t\tvirtual unsigned char read(std::istream &stream);\n\t\tvirtual bool isChannelVoiceMessage();\n\t\tvirtual bool isNoteOn(void);\n\t\tvirtual bool isNoteOff(void);\n\t\tvirtual bool isMatchingNoteOff(MidiEvent &offEvent);\n\t\tfriend bool operator < (const MidiEvent &a, MidiEvent &b);\n\t};\n\t\n\tclass MidiTrack : public Chunk, public std::vector<MidiEvent>\n\t{\n\tpublic:\n\t\tMidiTrack(void);\n\t\tvirtual ~MidiTrack(void);\n\t\tvirtual void read(std::istream &stream, MidiFile &midiFile);\n\t\tvirtual void write(std::ostream &stream, MidiFile &midiFile);\n\t\tvirtual void sort(void);\n\t};\n\t\n\tclass TempoMap : public std::map<int, double>\n\t{\n\tpublic:\n\t\tdouble getCurrentSecondsPerTick(int tick);\n\t};\n\n\t\/**\n\t* Reads and writes format 0 and format 1 standard MIDI files.\n\t*\/\n\tclass MidiFile\n\t{\n\tpublic:\n\t\ttypedef enum {\n\t\t\tCHANNEL_NOTE_OFF = 0x80,\n\t\t\tCHANNEL_NOTE_ON = 0x90,\n\t\t\tCHANNEL_KEY_PRESSURE = 0xa0,\n\t\t\tCHANNEL_CONTROL_CHANGE = 0xb0,\n\t\t\tCHANNEL_PROGRAM_CHANGE = 0xc0,\n\t\t\tCHANNEL_AFTER_TOUCH = 0xd0,\n\t\t\tCHANNEL_PITCH_BEND = 0xe0,\n\t\t\tSYSTEM_EXCLUSIVE = 0xf0,\n\t\t\tSYSTEM_MIDI_TIME_CODE = 0xf1,\n\t\t\tSYSTEM_SONG_POSITION_POINTER = 0xf2,\n\t\t\tSYSTEM_SONG_SELECT = 0xf3,\n\t\t\tSYSTEM_TUNE_REQUEST = 0xf6,\n\t\t\tSYSTEM_END_OF_EXCLUSIVE = 0xf7,\n\t\t\tSYSTEM_TIMING_CLOCK = 0xf8,\n\t\t\tSYSTEM_START = 0xfa,\n\t\t\tSYSTEM_CONTINUE = 0xfb,\n\t\t\tSYSTEM_STOP = 0xfc,\n\t\t\tSYSTEM_ACTIVE_SENSING = 0xfe,\n\t\t\tMETA_EVENT = 0xff,\n\t\t} MidiEventTypes;\n\t\ttypedef enum {\n\t\t\tMETA_SEQUENCE_NUMBER = 0x00,\n\t\t\tMETA_TEXT_EVENT = 0x01,\n\t\t\tMETA_COPYRIGHT_NOTICE = 0x02,\n\t\t\tMETA_SEQUENCE_NAME = 0x03,\n\t\t\tMETA_INSTRUMENT_NAME = 0x04,\n\t\t\tMETA_LYRIC = 0x05,\n\t\t\tMETA_MARKER = 0x06,\n\t\t\tMETA_CUE_POINT = 0x07,\n\t\t\tMETA_CHANNEL_PREFIX = 0x20,\n\t\t\tMETA_END_OF_TRACK = 0x2f,\n\t\t\tMETA_SET_TEMPO = 0x51,\n\t\t\tMETA_SMPTE_OFFSET = 0x54,\n\t\t\tMETA_TIME_SIGNATURE = 0x58,\n\t\t\tMETA_KEY_SIGNATURE = 0x59,\n\t\t\tMETA_SEQUENCER_SPECIFIC = 0x74,\n\t\t} MetaEventTypes;\n\t\ttypedef enum {\n\t\t\tCONTROLLER_MOD_WHEEL = 1,\n\t\t\tCONTROLLER_BREATH = 2,\n\t\t\tCONTROLLER_FOOT = 4,\n\t\t\tCONTROLLER_BALANCE = 8,\n\t\t\tCONTROLLER_PAN = 10,\n\t\t\tCONTROLLER_EXPRESSION = 11,\n\t\t\t\/* 7 bit controllers *\/\n\t\t\tCONTROLLER_DAMPER_PEDAL = 0x40,\n\t\t\tCONTROLLER_PORTAMENTO = 0x41, \n\t\t\tCONTROLLER_SOSTENUTO = 0x42,\n\t\t\tCONTROLLER_SOFT_PEDAL = 0x43,\n\t\t\tCONTROLLER_GENERAL_4 = 0x44,\n\t\t\tCONTROLLER_HOLD_2 = 0x45,\n\t\t\tCONTROLLER_7GENERAL_5 = 0x50,\n\t\t\tCONTROLLER_GENERAL_6 = 0x51,\n\t\t\tCONTROLLER_GENERAL_7 = 0x52,\n\t\t\tCONTROLLER_GENERAL_8 = 0x53,\n\t\t\tCONTROLLER_TREMOLO_DEPTH = 0x5c,\n\t\t\tCONTROLLER_CHORUS_DEPTH = 0x5d,\n\t\t\tCONTROLLER_DETUNE = 0x5e,\n\t\t\tCONTROLLER_PHASER_DEPTH = 0x5f,\n\t\t\t\/* parameter values *\/\n\t\t\tCONTROLLER_DATA_INC = 0x60,\n\t\t\tCONTROLLER_DATA_DEC = 0x61,\n\t\t\t\/* parameter selection *\/\n\t\t\tCONTROLLER_NON_REG_LSB = 0x62,\n\t\t\tCONTROLLER_NON_REG_MSB = 0x63,\n\t\t\tCONTROLLER_REG_LSB = 0x64,\n\t\t\tCONTROLLER_REG_MSG = 0x65,\n\t\t\tCONTROLLER_CONTINUOUS_AFTERTOUCH = 128,\n\t\t} MidiControllers;\n\t\tstatic int readVariableLength(std::istream &stream);\n\t\tstatic void writeVariableLength(std::ostream &stream, int value);\n\t\tstatic int toInt(int c1, int c2, int c3, int c4);\n\t\tstatic short toShort(int c1, int c2);\n\t\tstatic int readInt(std::istream &stream);\n\t\tstatic void writeInt(std::ostream &stream, int value);\n\t\tstatic short readShort(std::istream &stream);\n\t\tstatic void writeShort(std::ostream &stream, short value);\n\t\tstatic int chunkName(int a, int b, int c, int d);\n\t\tvoid computeTimes(void);\n\t\tint currentTick;\n\t\tdouble currentTime;\n\t\tdouble currentSecondsPerTick;\n\t\tdouble microsecondsPerQuarterNote;\n\t\tunsigned char lastStatus;\n\t\tMidiHeader midiHeader;\n\t\tTempoMap tempoMap;\n\t\tstd::vector<MidiTrack> midiTracks;\n\t\tMidiFile(void);\n\t\tvirtual ~MidiFile(void);\n\t\tvirtual void clear(void);\n\t\tvirtual void read(std::istream &stream);\n\t\tvirtual void write(std::ostream &stream);\n\t\tvirtual void load(std::string filename);\n\t\tvirtual void save(std::string filename);\n\t\tvirtual void dump(std::ostream &stream);\n\t\tvirtual void sort(void);\n\t};\n\n\tbool operator < (const MidiEvent &a, MidiEvent &b);\t\n}\n#endif\n<commit_msg>Fixed typedefs and template declarations for MinGW.<commit_after>\/**\n* C S O U N D V S T \n*\n* A VST plugin version of Csound, with Python scripting.\n*\n* L I C E N S E\n*\n* This software is free software; you can redistribute it and\/or\n* modify it under the terms of the GNU Lesser General Public\n* License as published by the Free Software Foundation; either\n* version 2.1 of 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 Software\n* Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA\n*\/\n#ifndef MIDIFILE_H\n#define MIDIFILE_H\n#ifdef SWIG\n%module CsoundVST\n%{\n#include <algorithm>\n#include <fstream>\n#include <iostream>\n#include <map>\n#include <string>\n#include <vector>\n%}\n%template(IntToDoubleMap) std::map<int, double>;\n%template(MidiByteVector) std::vector<unsigned char>;\n#else\n#include <algorithm>\n#include <fstream>\n#include <iostream>\n#include <map>\n#include <string>\n#include <vector>\n#endif\n\nnamespace csound \n{\n typedef unsigned char csound_u_char;\n\tclass MidiFile;\n\n\tclass Chunk\n\t{\n\tpublic:\n\t\tint id;\n\t\tint chunkSize;\n\t\tint chunkSizePosition;\n\t\tint chunkStart;\n\t\tint chunkEnd;\n\t\tChunk(const char *_id);\n\t\tvirtual ~Chunk(void);\n\t\tvirtual void read(std::istream &stream);\n\t\tvirtual void write(std::ostream &stream);\n\t\tvirtual void markChunkSize(std::ostream &stream);\n\t\tvirtual void markChunkStart(std::ostream &stream);\n\t\tvirtual void markChunkEnd(std::ostream &stream);\n\t};\n\n\tclass MidiHeader : public Chunk\n\t{\n\tpublic:\n\t\tshort type;\n\t\tshort trackCount;\n\t\tshort timeFormat;\n\t\tMidiHeader(void);\n\t\tvirtual ~MidiHeader(void);\n\t\tvirtual void clear(void);\n\t\tvirtual void read(std::istream &stream);\n\t\tvirtual void write(std::ostream &stream);\n\t};\n\t\n\t\/**\n\t* This class is used to store ALL Midi messages.\n\t*\/\n\tclass MidiEvent : public std::vector<csound_u_char>\n\t{\n\tpublic:\n\t\tint ticks;\n\t\tdouble time;\n\t\tMidiEvent(void);\n\t\tvirtual ~MidiEvent(void);\n\t\tvirtual void read(std::istream &stream, MidiFile &midiFile);\n\t\tvirtual void write(std::ostream &stream, MidiFile &midiFile, int lastTick);\n\t\tvirtual int getStatus(void);\n\t\tvirtual int getStatusNybble(void);\n\t\tvirtual int getChannelNybble(void);\n\t\tvirtual int getKey(void);\n\t\tvirtual int getVelocity(void);\n\t\tvirtual int getMetaType(void);\n\t\tvirtual unsigned char getMetaData(int i);\n\t\tvirtual size_t getMetaSize(void);\n\t\tvirtual unsigned char read(std::istream &stream);\n\t\tvirtual bool isChannelVoiceMessage();\n\t\tvirtual bool isNoteOn(void);\n\t\tvirtual bool isNoteOff(void);\n\t\tvirtual bool isMatchingNoteOff(MidiEvent &offEvent);\n\t\tfriend bool operator < (const MidiEvent &a, MidiEvent &b);\n\t};\n\t\n\tclass MidiTrack : public Chunk, public std::vector<MidiEvent>\n\t{\n\tpublic:\n\t\tMidiTrack(void);\n\t\tvirtual ~MidiTrack(void);\n\t\tvirtual void read(std::istream &stream, MidiFile &midiFile);\n\t\tvirtual void write(std::ostream &stream, MidiFile &midiFile);\n\t\tvirtual void sort(void);\n\t};\n\t\n\tclass TempoMap : public std::map<int, double>\n\t{\n\tpublic:\n\t\tdouble getCurrentSecondsPerTick(int tick);\n\t};\n\n\t\/**\n\t* Reads and writes format 0 and format 1 standard MIDI files.\n\t*\/\n\tclass MidiFile\n\t{\n\tpublic:\n\t\ttypedef enum {\n\t\t\tCHANNEL_NOTE_OFF = 0x80,\n\t\t\tCHANNEL_NOTE_ON = 0x90,\n\t\t\tCHANNEL_KEY_PRESSURE = 0xa0,\n\t\t\tCHANNEL_CONTROL_CHANGE = 0xb0,\n\t\t\tCHANNEL_PROGRAM_CHANGE = 0xc0,\n\t\t\tCHANNEL_AFTER_TOUCH = 0xd0,\n\t\t\tCHANNEL_PITCH_BEND = 0xe0,\n\t\t\tSYSTEM_EXCLUSIVE = 0xf0,\n\t\t\tSYSTEM_MIDI_TIME_CODE = 0xf1,\n\t\t\tSYSTEM_SONG_POSITION_POINTER = 0xf2,\n\t\t\tSYSTEM_SONG_SELECT = 0xf3,\n\t\t\tSYSTEM_TUNE_REQUEST = 0xf6,\n\t\t\tSYSTEM_END_OF_EXCLUSIVE = 0xf7,\n\t\t\tSYSTEM_TIMING_CLOCK = 0xf8,\n\t\t\tSYSTEM_START = 0xfa,\n\t\t\tSYSTEM_CONTINUE = 0xfb,\n\t\t\tSYSTEM_STOP = 0xfc,\n\t\t\tSYSTEM_ACTIVE_SENSING = 0xfe,\n\t\t\tMETA_EVENT = 0xff,\n\t\t} MidiEventTypes;\n\t\ttypedef enum {\n\t\t\tMETA_SEQUENCE_NUMBER = 0x00,\n\t\t\tMETA_TEXT_EVENT = 0x01,\n\t\t\tMETA_COPYRIGHT_NOTICE = 0x02,\n\t\t\tMETA_SEQUENCE_NAME = 0x03,\n\t\t\tMETA_INSTRUMENT_NAME = 0x04,\n\t\t\tMETA_LYRIC = 0x05,\n\t\t\tMETA_MARKER = 0x06,\n\t\t\tMETA_CUE_POINT = 0x07,\n\t\t\tMETA_CHANNEL_PREFIX = 0x20,\n\t\t\tMETA_END_OF_TRACK = 0x2f,\n\t\t\tMETA_SET_TEMPO = 0x51,\n\t\t\tMETA_SMPTE_OFFSET = 0x54,\n\t\t\tMETA_TIME_SIGNATURE = 0x58,\n\t\t\tMETA_KEY_SIGNATURE = 0x59,\n\t\t\tMETA_SEQUENCER_SPECIFIC = 0x74,\n\t\t} MetaEventTypes;\n\t\ttypedef enum {\n\t\t\tCONTROLLER_MOD_WHEEL = 1,\n\t\t\tCONTROLLER_BREATH = 2,\n\t\t\tCONTROLLER_FOOT = 4,\n\t\t\tCONTROLLER_BALANCE = 8,\n\t\t\tCONTROLLER_PAN = 10,\n\t\t\tCONTROLLER_EXPRESSION = 11,\n\t\t\t\/* 7 bit controllers *\/\n\t\t\tCONTROLLER_DAMPER_PEDAL = 0x40,\n\t\t\tCONTROLLER_PORTAMENTO = 0x41, \n\t\t\tCONTROLLER_SOSTENUTO = 0x42,\n\t\t\tCONTROLLER_SOFT_PEDAL = 0x43,\n\t\t\tCONTROLLER_GENERAL_4 = 0x44,\n\t\t\tCONTROLLER_HOLD_2 = 0x45,\n\t\t\tCONTROLLER_7GENERAL_5 = 0x50,\n\t\t\tCONTROLLER_GENERAL_6 = 0x51,\n\t\t\tCONTROLLER_GENERAL_7 = 0x52,\n\t\t\tCONTROLLER_GENERAL_8 = 0x53,\n\t\t\tCONTROLLER_TREMOLO_DEPTH = 0x5c,\n\t\t\tCONTROLLER_CHORUS_DEPTH = 0x5d,\n\t\t\tCONTROLLER_DETUNE = 0x5e,\n\t\t\tCONTROLLER_PHASER_DEPTH = 0x5f,\n\t\t\t\/* parameter values *\/\n\t\t\tCONTROLLER_DATA_INC = 0x60,\n\t\t\tCONTROLLER_DATA_DEC = 0x61,\n\t\t\t\/* parameter selection *\/\n\t\t\tCONTROLLER_NON_REG_LSB = 0x62,\n\t\t\tCONTROLLER_NON_REG_MSB = 0x63,\n\t\t\tCONTROLLER_REG_LSB = 0x64,\n\t\t\tCONTROLLER_REG_MSG = 0x65,\n\t\t\tCONTROLLER_CONTINUOUS_AFTERTOUCH = 128,\n\t\t} MidiControllers;\n\t\tstatic int readVariableLength(std::istream &stream);\n\t\tstatic void writeVariableLength(std::ostream &stream, int value);\n\t\tstatic int toInt(int c1, int c2, int c3, int c4);\n\t\tstatic short toShort(int c1, int c2);\n\t\tstatic int readInt(std::istream &stream);\n\t\tstatic void writeInt(std::ostream &stream, int value);\n\t\tstatic short readShort(std::istream &stream);\n\t\tstatic void writeShort(std::ostream &stream, short value);\n\t\tstatic int chunkName(int a, int b, int c, int d);\n\t\tvoid computeTimes(void);\n\t\tint currentTick;\n\t\tdouble currentTime;\n\t\tdouble currentSecondsPerTick;\n\t\tdouble microsecondsPerQuarterNote;\n\t\tunsigned char lastStatus;\n\t\tMidiHeader midiHeader;\n\t\tTempoMap tempoMap;\n\t\tstd::vector<MidiTrack> midiTracks;\n\t\tMidiFile(void);\n\t\tvirtual ~MidiFile(void);\n\t\tvirtual void clear(void);\n\t\tvirtual void read(std::istream &stream);\n\t\tvirtual void write(std::ostream &stream);\n\t\tvirtual void load(std::string filename);\n\t\tvirtual void save(std::string filename);\n\t\tvirtual void dump(std::ostream &stream);\n\t\tvirtual void sort(void);\n\t};\n\n\tbool operator < (const MidiEvent &a, MidiEvent &b);\t\n}\n#endif\n<|endoftext|>"} {"text":"<commit_before>#include \"SimObservable.h\"\n#include \"SimObserver.h\"\n#include \"json\/json.h\"\n#include \"schema.h\"\n#include \"..\/Validator\/ObjectRequirement.h\"\n#include \"..\/Validator\/ArrayRequirement.h\"\n#include \"SimException.h\"\n#include \"..\/Observers\/DLMFileObserver.h\"\n#include \"..\/Observers\/JSONObserver.h\"\n#include \"..\/Observers\/XYZObserver.h\"\n\nusing namespace Json;\n\nnamespace SAPHRON\n{\n\t\/\/ Initialized SimFlags based on (pre-validated) JSON.\n\tSimFlags InitFlags(const Value& json)\n\t{\n\t\tSimFlags flags;\n\n\t\tflags.iteration = json.get(\"iteration\", 0).asUInt();\n\t\tflags.move_acceptances = json.get(\"move_acceptances\", 0).asUInt();\n\t\tflags.dos_factor = json.get(\"dos_factor\", 0).asUInt();\n\t\tflags.dos_flatness = json.get(\"dos_flatness\", 0).asUInt();\n\t\tflags.world_pressure = json.get(\"world_pressure\", 0).asUInt();\n\t\tflags.world_volume = json.get(\"world_volume\", 0).asUInt();\n\t\tflags.world_density = json.get(\"world_density\", 0).asUInt();\n\t\tflags.world_temperature = json.get(\"world_temperature\", 0).asUInt();\n\t\tflags.world_composition = json.get(\"world_composition\", 0).asUInt();\n\t\tflags.world_energy = json.get(\"world_energy\", 0).asUInt();\n\t\tflags.world_chem_pot = json.get(\"world_chem_pot\", 0).asUInt();\n\t\tflags.eintervdw = json.get(\"energy_intervdw\", 0).asUInt();\n\t\tflags.eintravdw = json.get(\"energy_intravdw\", 0).asUInt();\n\t\tflags.einterelect = json.get(\"energy_interelect\", 0).asUInt();\n\t\tflags.eintraelect = json.get(\"energy_intraelect\", 0).asUInt();\n\t\tflags.ebonded = json.get(\"energy_bonded\", 0).asUInt();\n\t\tflags.econnectivity = json.get(\"energy_connectivity\", 0).asUInt();\n\t\tflags.pideal = json.get(\"pressure_ideal\", 0).asUInt();\n\t\tflags.pxx = json.get(\"pressure_pxx\", 0).asUInt();\n\t\tflags.pxy = json.get(\"pressure_pxy\", 0).asUInt();\n\t\tflags.pxz = json.get(\"pressure_pxz\", 0).asUInt();\n\t\tflags.pyy = json.get(\"pressure_pyy\", 0).asUInt();\n\t\tflags.pyz = json.get(\"pressure_pyz\", 0).asUInt();\n\t\tflags.pzz = json.get(\"pressure_pzz\", 0).asUInt();\n\t\tflags.ptail = json.get(\"pressure_tail\", 0).asUInt();\n\t\tflags.hist_interval = json.get(\"hist_interval\", 0).asUInt();\n\t\tflags.hist_bin_count = json.get(\"hist_bin_count\", 0).asUInt();\n\t\tflags.hist_lower_outliers = json.get(\"hist_lower_outliers\", 0).asUInt();\n\t\tflags.hist_upper_outliers = json.get(\"hist_upper_outliers\", 0).asUInt();\n\t\tflags.hist_values = json.get(\"hist_values\", 0).asUInt();\n\t\tflags.hist_counts = json.get(\"hist_counts\", 0).asUInt();\n\t\tflags.particle_id = json.get(\"particle_id\", 0).asUInt();\n\t\tflags.particle_species = json.get(\"particle_species\", 0).asUInt();\n\t\tflags.particle_parent_id = json.get(\"particle_parent_id\", 0).asUInt();\n\t\tflags.particle_parent_species = json.get(\"particle_parent_species\", 0).asUInt();\n\t\tflags.particle_position = json.get(\"particle_position\", 0).asUInt();\n\t\tflags.particle_director = json.get(\"particle_director\", 0).asUInt();\n\t\tflags.particle_neighbors = json.get(\"particles_neighbors\", 0).asUInt();\n\n\t\t\/\/ Masks.\n\t\tint simulation = json.get(\"simulation\", 0).asInt();\n\t\tint world = json.get(\"world\", 0).asInt();\n\t\tint energy_components = json.get(\"energy_components\", 0).asInt();\n\t\tint pressure_tensor = json.get(\"pressure_tensor\", 0).asInt();\n\t\tint histogram = json.get(\"histogram\", 0).asInt();\n\t\tint particle = json.get(\"particle\", 0).asInt();\n\n\t\tif(simulation)\n\t\t\tflags.simulation_on();\n\t\tif(world)\n\t\t\tflags.world_on();\n\t\tif(energy_components)\n\t\t\tflags.energy_on();\n\t\tif(pressure_tensor)\n\t\t\tflags.pressure_on();\n\t\tif(histogram)\n\t\t\tflags.histogram_on();\n\t\tif(particle)\n\t\t\tflags.particle_on();\n\n\t\treturn flags;\n\t}\n\n\tvoid SimObserver::Update(const SimEvent& e)\n\t{\n\t\t\/\/ Only lock and proceed if we have to.\n\t\tif(e.GetIteration() % _frequency == 0 || e.ForceObserve())\n\t\t{\n\t\t\t_mutex.lock();\n\t\t\t_event = e;\n\t\t\tPreVisit();\n\t\t\t_event.GetObservable()->AcceptVisitor(*this);\n\t\t\tPostVisit();\n\t\t\t_mutex.unlock();\n\t\t}\n\t};\n\n\tSimObserver* SimObserver::BuildObserver(const Value &json)\n\t{\n\t\treturn BuildObserver(json, \"#\/observers\");\n\t}\n\tSimObserver* SimObserver::BuildObserver(const Value &json, const std::string& path)\n\t{\n\t\tObjectRequirement validator; \n\t\tValue schema;\n\t\tReader reader;\n\n\t\tSimObserver* obs = nullptr;\n\n\t\tauto type = json.get(\"type\", \"none\").asString();\n\n\t\tif(type == \"DLMFile\")\n\t\t{\n\t\t\treader.parse(JsonSchema::DLMFileObserver, schema);\n\t\t\tvalidator.Parse(schema, path);\n\n\t\t\t\/\/ Validate inputs. \n\t\t\tvalidator.Validate(json, path);\n\t\t\tif(validator.HasErrors())\n\t\t\t\tthrow BuildException(validator.GetErrors());\n\n\t\t\t\/\/ Initialize flags.\n\t\t\tSimFlags flags = InitFlags(json[\"flags\"]);\n\n\t\t\t\/\/ Initialize DLM specific options.\n\t\t\tauto prefix = json.get(\"prefix\", \"unnamed\").asString();\n\t\t\tauto frequency = json.get(\"frequency\", 1).asInt();\n\t\t\tauto colwidth = json.get(\"colwidth\", 15).asInt();\n\t\t\tauto fixedw = json.get(\"fixedwmode\", true).asBool();\n\t\t\tauto delimiter = json.get(\"delimiter\", \" \").asString();\n\t\t\tauto extension = json.get(\"extension\", \".dat\").asString();\n\n\t\t\tauto* dlm = new DLMFileObserver(prefix, flags, frequency);\n\t\t\tdlm->SetWidth(colwidth);\n\t\t\tdlm->SetFixedWidthMode(fixedw);\n\t\t\tdlm->SetDelimiter(delimiter);\n\t\t\tdlm->SetExtension(extension);\n\t\t\tobs = static_cast<SimObserver*>(dlm);\n\t\t}\n\t\telse if(type == \"JSON\")\n\t\t{\n\t\t\treader.parse(JsonSchema::JSONObserver, schema);\n\t\t\tvalidator.Parse(schema, path);\n\n\t\t\t\/\/ Validate inputs. \n\t\t\tvalidator.Validate(json, path);\n\t\t\tif(validator.HasErrors())\n\t\t\t\tthrow BuildException(validator.GetErrors());\n\n\t\t\t\/\/ Initialize flags.\n\t\t\tSimFlags flags;\n\n\t\t\t\/\/ Initialize JSON specific options.\n\t\t\tauto prefix = json.get(\"prefix\", \"unnamed\").asString();\n\t\t\tauto frequency = json.get(\"frequency\", 1).asInt();\n\n\t\t\tauto* dlm = new JSONObserver(prefix, flags, frequency);\n\t\t\tobs = static_cast<SimObserver*>(dlm);\n\t\t}\n\t\telse if(type == \"XYZ\")\n\t\t{\n\t\t\treader.parse(JsonSchema::XYZObserver, schema);\n\t\t\tvalidator.Parse(schema, path);\n\n\t\t\t\/\/ Validate inputs.\n\t\t\tif(validator.HasErrors())\n\t\t\t\tthrow BuildException(validator.GetErrors());\n\n\t\t\t\/\/ Initialize flags.\n\t\t\tSimFlags flags;\n\n\t\t\t\/\/ Initialize JSON specific options.\n\t\t\tauto prefix = json.get(\"prefix\", \"unnamed\").asString();\n\t\t\tauto frequency = json.get(\"frequency\", 1).asInt();\n\n\t\t\tauto* dlm = new XYZObserver(prefix, flags, frequency);\n\t\t\tobs = static_cast<SimObserver*>(dlm);\n\t\t}\n\t\telse\n\t\t{\n\t\t\tthrow BuildException({path + \": Unknown observer type specified.\"});\n\t\t}\n\n\t\treturn obs;\n\t}\n\n\tvoid SimObserver::BuildObservers(const Json::Value &json, ObserverList &ol)\n\t{\n\t\tArrayRequirement validator;\n\t\tValue schema;\n\t\tReader reader;\n\n\t\treader.parse(JsonSchema::Observers, schema);\n\t\tvalidator.Parse(schema, \"#\/observers\");\n\n\t\t\/\/ Validate high level schema.\n\t\tvalidator.Validate(json, \"#\/observers\");\n\t\tif(validator.HasErrors())\n\t\t\tthrow BuildException(validator.GetErrors());\n\n\t\t\/\/ Loop through observers.\n\t\tint i = 0;\n\t\tfor(auto& obs : json)\n\t\t{\n\t\t\tol.push_back(BuildObserver(obs, \"#\/observers\/\" + std::to_string(i)));\n\t\t\t++i;\n\t\t}\n\t}\n}\n<commit_msg>Minor adjustments to flags in SimObserver<commit_after>#include \"SimObservable.h\"\n#include \"SimObserver.h\"\n#include \"json\/json.h\"\n#include \"schema.h\"\n#include \"..\/Validator\/ObjectRequirement.h\"\n#include \"..\/Validator\/ArrayRequirement.h\"\n#include \"SimException.h\"\n#include \"..\/Observers\/DLMFileObserver.h\"\n#include \"..\/Observers\/JSONObserver.h\"\n#include \"..\/Observers\/XYZObserver.h\"\n\nusing namespace Json;\n\nnamespace SAPHRON\n{\n\t\/\/ Initialized SimFlags based on (pre-validated) JSON.\n\tSimFlags InitFlags(const Value& json)\n\t{\n\t\tSimFlags flags;\n\n\t\tflags.iteration = json.get(\"iteration\", 0).asUInt();\n\t\tflags.move_acceptances = json.get(\"move_acceptances\", 0).asUInt();\n\t\tflags.dos_factor = json.get(\"dos_factor\", 0).asUInt();\n\t\tflags.dos_flatness = json.get(\"dos_flatness\", 0).asUInt();\n\t\tflags.world_pressure = json.get(\"world_pressure\", 0).asUInt();\n\t\tflags.world_volume = json.get(\"world_volume\", 0).asUInt();\n\t\tflags.world_density = json.get(\"world_density\", 0).asUInt();\n\t\tflags.world_temperature = json.get(\"world_temperature\", 0).asUInt();\n\t\tflags.world_composition = json.get(\"world_composition\", 0).asUInt();\n\t\tflags.world_energy = json.get(\"world_energy\", 0).asUInt();\n\t\tflags.world_chem_pot = json.get(\"world_chem_pot\", 0).asUInt();\n\t\tflags.eintervdw = json.get(\"energy_intervdw\", 0).asUInt();\n\t\tflags.eintravdw = json.get(\"energy_intravdw\", 0).asUInt();\n\t\tflags.einterelect = json.get(\"energy_interelect\", 0).asUInt();\n\t\tflags.eintraelect = json.get(\"energy_intraelect\", 0).asUInt();\n\t\tflags.ebonded = json.get(\"energy_bonded\", 0).asUInt();\n\t\tflags.econnectivity = json.get(\"energy_connectivity\", 0).asUInt();\n\t\tflags.pideal = json.get(\"pressure_ideal\", 0).asUInt();\n\t\tflags.pxx = json.get(\"pressure_pxx\", 0).asUInt();\n\t\tflags.pxy = json.get(\"pressure_pxy\", 0).asUInt();\n\t\tflags.pxz = json.get(\"pressure_pxz\", 0).asUInt();\n\t\tflags.pyy = json.get(\"pressure_pyy\", 0).asUInt();\n\t\tflags.pyz = json.get(\"pressure_pyz\", 0).asUInt();\n\t\tflags.pzz = json.get(\"pressure_pzz\", 0).asUInt();\n\t\tflags.ptail = json.get(\"pressure_tail\", 0).asUInt();\n\t\tflags.hist_interval = json.get(\"hist_interval\", 0).asUInt();\n\t\tflags.hist_bin_count = json.get(\"hist_bin_count\", 0).asUInt();\n\t\tflags.hist_lower_outliers = json.get(\"hist_lower_outliers\", 0).asUInt();\n\t\tflags.hist_upper_outliers = json.get(\"hist_upper_outliers\", 0).asUInt();\n\t\tflags.hist_values = json.get(\"hist_values\", 0).asUInt();\n\t\tflags.hist_counts = json.get(\"hist_counts\", 0).asUInt();\n\t\tflags.particle_id = json.get(\"particle_id\", 0).asUInt();\n\t\tflags.particle_species = json.get(\"particle_species\", 0).asUInt();\n\t\tflags.particle_parent_id = json.get(\"particle_parent_id\", 0).asUInt();\n\t\tflags.particle_parent_species = json.get(\"particle_parent_species\", 0).asUInt();\n\t\tflags.particle_position = json.get(\"particle_position\", 0).asUInt();\n\t\tflags.particle_director = json.get(\"particle_director\", 0).asUInt();\n\t\tflags.particle_charge = json.get(\"particle_charge\", 0).asUInt();\n\n\t\t\/\/ Masks.\n\t\tint simulation = json.get(\"simulation\", 0).asInt();\n\t\tint world = json.get(\"world\", 0).asInt();\n\t\tint energy_components = json.get(\"energy_components\", 0).asInt();\n\t\tint pressure_tensor = json.get(\"pressure_tensor\", 0).asInt();\n\t\tint histogram = json.get(\"histogram\", 0).asInt();\n\t\tint particle = json.get(\"particle\", 0).asInt();\n\n\t\tif(simulation)\n\t\t\tflags.simulation_on();\n\t\tif(world)\n\t\t\tflags.world_on();\n\t\tif(energy_components)\n\t\t\tflags.energy_on();\n\t\tif(pressure_tensor)\n\t\t\tflags.pressure_on();\n\t\tif(histogram)\n\t\t\tflags.histogram_on();\n\t\tif(particle)\n\t\t\tflags.particle_on();\n\n\t\tflags.particle_neighbors = json.get(\"particles_neighbors\", 0).asUInt();\n\t\t\n\t\treturn flags;\n\t}\n\n\tvoid SimObserver::Update(const SimEvent& e)\n\t{\n\t\t\/\/ Only lock and proceed if we have to.\n\t\tif(e.GetIteration() % _frequency == 0 || e.ForceObserve())\n\t\t{\n\t\t\t_mutex.lock();\n\t\t\t_event = e;\n\t\t\tPreVisit();\n\t\t\t_event.GetObservable()->AcceptVisitor(*this);\n\t\t\tPostVisit();\n\t\t\t_mutex.unlock();\n\t\t}\n\t};\n\n\tSimObserver* SimObserver::BuildObserver(const Value &json)\n\t{\n\t\treturn BuildObserver(json, \"#\/observers\");\n\t}\n\tSimObserver* SimObserver::BuildObserver(const Value &json, const std::string& path)\n\t{\n\t\tObjectRequirement validator; \n\t\tValue schema;\n\t\tReader reader;\n\n\t\tSimObserver* obs = nullptr;\n\n\t\tauto type = json.get(\"type\", \"none\").asString();\n\n\t\tif(type == \"DLMFile\")\n\t\t{\n\t\t\treader.parse(JsonSchema::DLMFileObserver, schema);\n\t\t\tvalidator.Parse(schema, path);\n\n\t\t\t\/\/ Validate inputs. \n\t\t\tvalidator.Validate(json, path);\n\t\t\tif(validator.HasErrors())\n\t\t\t\tthrow BuildException(validator.GetErrors());\n\n\t\t\t\/\/ Initialize flags.\n\t\t\tSimFlags flags = InitFlags(json[\"flags\"]);\n\n\t\t\t\/\/ Initialize DLM specific options.\n\t\t\tauto prefix = json.get(\"prefix\", \"unnamed\").asString();\n\t\t\tauto frequency = json.get(\"frequency\", 1).asInt();\n\t\t\tauto colwidth = json.get(\"colwidth\", 15).asInt();\n\t\t\tauto fixedw = json.get(\"fixedwmode\", true).asBool();\n\t\t\tauto delimiter = json.get(\"delimiter\", \" \").asString();\n\t\t\tauto extension = json.get(\"extension\", \".dat\").asString();\n\n\t\t\tauto* dlm = new DLMFileObserver(prefix, flags, frequency);\n\t\t\tdlm->SetWidth(colwidth);\n\t\t\tdlm->SetFixedWidthMode(fixedw);\n\t\t\tdlm->SetDelimiter(delimiter);\n\t\t\tdlm->SetExtension(extension);\n\t\t\tobs = static_cast<SimObserver*>(dlm);\n\t\t}\n\t\telse if(type == \"JSON\")\n\t\t{\n\t\t\treader.parse(JsonSchema::JSONObserver, schema);\n\t\t\tvalidator.Parse(schema, path);\n\n\t\t\t\/\/ Validate inputs. \n\t\t\tvalidator.Validate(json, path);\n\t\t\tif(validator.HasErrors())\n\t\t\t\tthrow BuildException(validator.GetErrors());\n\n\t\t\t\/\/ Initialize flags.\n\t\t\tSimFlags flags;\n\n\t\t\t\/\/ Initialize JSON specific options.\n\t\t\tauto prefix = json.get(\"prefix\", \"unnamed\").asString();\n\t\t\tauto frequency = json.get(\"frequency\", 1).asInt();\n\n\t\t\tauto* dlm = new JSONObserver(prefix, flags, frequency);\n\t\t\tobs = static_cast<SimObserver*>(dlm);\n\t\t}\n\t\telse if(type == \"XYZ\")\n\t\t{\n\t\t\treader.parse(JsonSchema::XYZObserver, schema);\n\t\t\tvalidator.Parse(schema, path);\n\n\t\t\t\/\/ Validate inputs.\n\t\t\tif(validator.HasErrors())\n\t\t\t\tthrow BuildException(validator.GetErrors());\n\n\t\t\t\/\/ Initialize flags.\n\t\t\tSimFlags flags;\n\n\t\t\t\/\/ Initialize JSON specific options.\n\t\t\tauto prefix = json.get(\"prefix\", \"unnamed\").asString();\n\t\t\tauto frequency = json.get(\"frequency\", 1).asInt();\n\n\t\t\tauto* dlm = new XYZObserver(prefix, flags, frequency);\n\t\t\tobs = static_cast<SimObserver*>(dlm);\n\t\t}\n\t\telse\n\t\t{\n\t\t\tthrow BuildException({path + \": Unknown observer type specified.\"});\n\t\t}\n\n\t\treturn obs;\n\t}\n\n\tvoid SimObserver::BuildObservers(const Json::Value &json, ObserverList &ol)\n\t{\n\t\tArrayRequirement validator;\n\t\tValue schema;\n\t\tReader reader;\n\n\t\treader.parse(JsonSchema::Observers, schema);\n\t\tvalidator.Parse(schema, \"#\/observers\");\n\n\t\t\/\/ Validate high level schema.\n\t\tvalidator.Validate(json, \"#\/observers\");\n\t\tif(validator.HasErrors())\n\t\t\tthrow BuildException(validator.GetErrors());\n\n\t\t\/\/ Loop through observers.\n\t\tint i = 0;\n\t\tfor(auto& obs : json)\n\t\t{\n\t\t\tol.push_back(BuildObserver(obs, \"#\/observers\/\" + std::to_string(i)));\n\t\t\t++i;\n\t\t}\n\t}\n}\n<|endoftext|>"} {"text":"<commit_before>\/\/ Copyright (c) 2010-2022, Lawrence Livermore National Security, LLC. Produced\n\/\/ at the Lawrence Livermore National Laboratory. All Rights reserved. See files\n\/\/ LICENSE and NOTICE for details. LLNL-CODE-806117.\n\/\/\n\/\/ This file is part of the MFEM library. For more information and source code\n\/\/ availability visit https:\/\/mfem.org.\n\/\/\n\/\/ MFEM is free software; you can redistribute it and\/or modify it under the\n\/\/ terms of the BSD-3 license. We welcome feedback and contributions, see file\n\/\/ CONTRIBUTING.md for details.\n\n#ifndef MFEM_LIBCEED_INTERFACE\n#define MFEM_LIBCEED_INTERFACE\n\n\/\/ Object wrapping a CeedOperator in a mfem::Operator.\n#include \"operator.hpp\"\n\/\/ Functions to initialize CeedBasis objects.\n#include \"basis.hpp\"\n\/\/ Functions to initialize CeedRestriction objects.\n#include \"restriction.hpp\"\n\/\/ Functions to initialize coefficients.\n#include \"coefficient.hpp\"\n\/\/ PA or MF Operator using libCEED.\n#include \"integrator.hpp\"\n\/\/ Utility functions\n#include \"util.hpp\"\n\/\/ Wrapper to include <ceed.h>\n#include \"ceed.hpp\"\n\nnamespace mfem\n{\n\nnamespace ceed\n{\n\n\n} \/\/ namespace ceed\n\n} \/\/ namespace mfem\n\n#endif \/\/ MFEM_LIBCEED_INTERFACE\n<commit_msg>Remove unused namespace.<commit_after>\/\/ Copyright (c) 2010-2022, Lawrence Livermore National Security, LLC. Produced\n\/\/ at the Lawrence Livermore National Laboratory. All Rights reserved. See files\n\/\/ LICENSE and NOTICE for details. LLNL-CODE-806117.\n\/\/\n\/\/ This file is part of the MFEM library. For more information and source code\n\/\/ availability visit https:\/\/mfem.org.\n\/\/\n\/\/ MFEM is free software; you can redistribute it and\/or modify it under the\n\/\/ terms of the BSD-3 license. We welcome feedback and contributions, see file\n\/\/ CONTRIBUTING.md for details.\n\n#ifndef MFEM_LIBCEED_INTERFACE\n#define MFEM_LIBCEED_INTERFACE\n\n\/\/ Object wrapping a CeedOperator in a mfem::Operator.\n#include \"operator.hpp\"\n\/\/ Functions to initialize CeedBasis objects.\n#include \"basis.hpp\"\n\/\/ Functions to initialize CeedRestriction objects.\n#include \"restriction.hpp\"\n\/\/ Functions to initialize coefficients.\n#include \"coefficient.hpp\"\n\/\/ PA or MF Operator using libCEED.\n#include \"integrator.hpp\"\n\/\/ Utility functions\n#include \"util.hpp\"\n\/\/ Wrapper to include <ceed.h>\n#include \"ceed.hpp\"\n\n#endif \/\/ MFEM_LIBCEED_INTERFACE\n<|endoftext|>"} {"text":"<commit_before>#include \"tangram_bam.h\"\n#include <stdio.h>\n#include <limits.h>\n#include <getopt.h>\n\n#include <vector>\n#include <string>\n#include <iostream>\n\n#include \"api\/BamReader.h\"\n#include \"api\/BamWriter.h\"\n#include \"..\/OutSources\/fasta\/Fasta.h\"\n#include \"..\/OutSources\/stripedSW\/ssw_cpp.h\"\n\nusing namespace std;\n\nvoid ShowHelp() {\n fprintf(stderr, \"Usage: tangram_bam <in_bam> <ref_fa> <out_bam>\\n\\n\");\n fprintf(stderr, \"tangram_bam will generate ZA tags for bams\");\n fprintf(stderr, \" that are not generated by MOSAIK.\\n\");\n\n fprintf(stderr, \"<ref_fa> is a fasta file containing insertion sequences\\n\");\n fprintf(stderr, \" that we are going to detect them.\\n\");\n}\n\nbool OpenBams(\n const string& infilename,\n const string& outfilename,\n const string& command_line,\n BamTools::BamReader* reader,\n BamTools::BamWriter* writer) {\n \n reader->Open(infilename);\n if (!reader->IsOpen()) {\n fprintf(stderr, \"ERROR: The bam file, %s, cannot be open\\n\", infilename.c_str());\n return false;\n }\n\n \/\/ Load header and ref\n string header = reader->GetHeaderText();\n size_t pos1 = header.find(\"SO:\");\n if (pos1 != string::npos) {\n size_t pos2 = header.find(\"SO:queryname\");\n if (pos2 != string::npos) header.replace(pos2, 12, \"SO:unsorted\");\n pos2 = header.find(\"SO:coordinate\");\n if (pos2 != string::npos) header.replace(pos2, 13, \"SO:unsorted\");\n }\n header += \"@PG\\tID:tangram_bam\\tCL:\";\n header += (command_line + '\\n');\n BamTools::RefVector ref = reader->GetReferenceData();\n\n if (!writer->Open(outfilename, header, ref)) {\n fprintf(stderr, \"ERROR: The bam file, %s, cannot be open\\n\", outfilename.c_str());\n reader->Close();\n return false;\n }\n\n return true;\n}\n\ninline bool LoadReference(const char* fa, FastaReference* fasta) {\n string filename = fa;\n fasta->open(filename);\n\n return true;\n}\n\nbool ConcatenateSpecialReference(\n FastaReference* fasta, \n SpecialReference* s_ref) {\n int total_len = 0;\n for (vector<string>::const_iterator ite = fasta->index->sequenceNames.begin();\n ite != fasta->index->sequenceNames.end(); ++ite) {\n s_ref->concatnated += fasta->getSequence(*ite).c_str();\n s_ref->ref_lens.push_back(fasta->sequenceLength(*ite));\n s_ref->ref_names.push_back(*ite);\n total_len += fasta->sequenceLength(*ite);\n }\n\n s_ref->concatnated_len = total_len;\n\n return true;\n}\n\nvoid GetReverseComplement(const string& query, string* reverse) {\n reverse->clear();\n\n for (string::const_reverse_iterator ite = query.rbegin(); ite != query.rend(); ++ite) {\n switch(*ite) {\n case 'A': *reverse += 'T'; break;\n case 'C': *reverse += 'G'; break;\n case 'G': *reverse += 'C'; break;\n case 'T': *reverse += 'A'; break;\n default: *reverse += 'N';\n }\n }\n}\n\nvoid Align(\n const string& query,\n const StripedSmithWaterman::Aligner& aligner,\n StripedSmithWaterman::Alignment* alignment) {\n \n alignment->Clear();\n aligner.Align(query.c_str(), kFilter, alignment);\n}\n\nvoid GetZa(const Alignment& al, const Alignment& mate, string* za) {\n const bool mate1 = al.bam_alignment.IsFirstMate();\n Alignment const *mate1_ptr, *mate2_ptr;\n\n if (mate1) {\n *za = \"<@;\";\n mate1_ptr = &al;\n mate2_ptr = &mate;\n } else {\n *za = \"<&;\";\n mate1_ptr = &mate;\n mate2_ptr = &al;\n }\n\n *za += (std::to_string(mate1_ptr->bam_alignment.MapQuality) + \";;\" \n + (mate1_ptr->hit_insertion ? mate1_ptr->ins_prefix : \"\") \n\t + \";1;\");\n \n if (mate1) {\n *za += \";><&;\";\n } else {\n *za += \";><@;\";\n }\n\n *za += (std::to_string(mate2_ptr->bam_alignment.MapQuality) + \";;\" \n + (mate2_ptr->hit_insertion ? mate2_ptr->ins_prefix : \"\") \n\t + \";1;;>\");\n\n}\n\nvoid WriteAlignment(\n const bool& add_za,\n const Alignment& mate,\n Alignment* al,\n BamTools::BamWriter* writer) {\n \n if (add_za) {\n string za;\n GetZa(*al, mate, &za);\n al->bam_alignment.AddTag(\"ZA\",\"Z\",za);\n }\n\n writer->SaveAlignment(al->bam_alignment);\n}\n\nvoid WriteAlignment(const bool& add_za,\n map<string, Alignment>* al_map_ite, \n BamTools::BamWriter* writer) {\n\t\t \n for (map<string, Alignment>::iterator ite = al_map_ite->begin();\n ite != al_map_ite->end(); ++ite) {\n Alignment* al = &(ite->second);\n if (add_za) {\n string za;\n if (al->bam_alignment.IsPaired()) { \/\/ paired-end read\n if (al->bam_alignment.IsFirstMate()) {\n za = \"<@;\" + std::to_string(al->bam_alignment.MapQuality) + \";;\"\n + (al->hit_insertion ? al->ins_prefix : \"\") + \";1;;>\"\n\t + \"<&;0;;;0;;>\";\n } else {\n za = \"<&;0;;;0;;><@;\" + std::to_string(al->bam_alignment.MapQuality) + \";;\"\n + (al->hit_insertion ? al->ins_prefix : \"\") + \";1;;>\";\n }\n } else { \/\/ sinle-end read\n za = \"<@;\" + std::to_string(al->bam_alignment.MapQuality) + \";;\"\n + (al->hit_insertion ? al->ins_prefix : \"\") + \";1;;>\";\n }\n\n al->bam_alignment.AddTag(\"ZA\",\"Z\",za);\n }\n\n writer->SaveAlignment(al->bam_alignment);\n }\n}\n\n\/\/ Return true if an alignment contains too many soft clips\ninline bool IsTooManyClips (const BamTools::BamAlignment& al) {\n if (al.CigarData.empty()) return true;\n\n int clip = 0;\n if ((al.CigarData.begin())->Type == 'S') clip += (al.CigarData.begin())->Length;\n if ((al.CigarData.rbegin())->Type == 'S') clip += (al.CigarData.rbegin())->Length;\n\n if (clip > (al.Length * kSoftClipRate)) return true;\n else return false;\n}\n\ninline void MarkAsUnmapped (BamTools::BamAlignment* al, BamTools::BamAlignment* mate) {\n const bool al_unmapped = IsTooManyClips(*al);\n const bool mate_unmapped = IsTooManyClips(*mate);\n\n if (!al_unmapped && !mate_unmapped) {\n \/\/ nothing\n } else {\n al->SetIsMapped(!al_unmapped);\n mate->SetIsMapped(!mate_unmapped);\n al->SetIsMateMapped(!mate_unmapped);\n mate->SetIsMateMapped(!al_unmapped);\n }\n}\n\nvoid StoreAlignment(\n const bool& add_za,\n Alignment* al,\n map<string, Alignment> *al_map_cur,\n map<string, Alignment> *al_map_pre,\n BamTools::BamWriter* writer) {\n \/\/ Clear up the buffers once the al_map_cur buffer is full\n \/\/ 1. Clear up al_map_pre\n \/\/ 2. move al_map_cur to al_map_pre\n if ((static_cast<int>(al_map_cur->size()) > kAlignmentMapSize)) {\n WriteAlignment(add_za, al_map_pre, writer);\n al_map_pre->clear();\n map<string, Alignment> *tmp = al_map_pre;\n al_map_pre = al_map_cur;\n al_map_cur = tmp;\n }\n\n map<string, Alignment>::iterator ite_cur = al_map_cur->find(al->bam_alignment.Name);\n if (ite_cur == al_map_cur->end()) {\n if (!al_map_pre) {\n map<string, Alignment>::iterator ite_pre = al_map_pre->find(al->bam_alignment.Name);\n if (ite_pre == al_map_pre->end()) { \/\/ al is not found in cur or pre either\n (*al_map_cur)[al->bam_alignment.Name] = *al;\n } else { \/\/ find the mate in al_map_pre\n MarkAsUnmapped(&(al->bam_alignment), &(ite_pre->second.bam_alignment));\n\tWriteAlignment(add_za, ite_pre->second, al, writer);\n WriteAlignment(add_za, *al, &(ite_pre->second), writer);\n al_map_pre->erase(ite_pre);\n }\n } else { \/\/ al is not found in cur and pre is NULL\n (*al_map_cur)[al->bam_alignment.Name] = *al;\n }\n } else { \/\/ find the mate in al_map_cur\n MarkAsUnmapped(&(al->bam_alignment), &(ite_cur->second.bam_alignment));\n WriteAlignment(add_za, ite_cur->second, al, writer);\n WriteAlignment(add_za, *al, &(ite_cur->second), writer);\n al_map_cur->erase(ite_cur);\n }\n \n}\n\nbool ParseArguments(const int argc, char* const * argv, Param* param) {\n if (argc == 1) { \/\/ no argument\n ShowHelp();\n return false;\n }\n\n \/\/ record command line\n param->command_line = argv[0];\n for ( int i = 1; i < argc; ++i ) {\n param->command_line += \" \";\n param->command_line += argv[i];\n }\n\n const char *short_option = \"hi:o:r:z\";\n const struct option long_option[] = {\n {\"help\", no_argument, NULL, 'h'},\n {\"input\", required_argument, NULL, 'i'},\n {\"output\", required_argument, NULL, 'o'},\n {\"ref\", required_argument, NULL, 'r'},\n {\"no-za-add\", no_argument, NULL, 'z'},\n\n {0, 0, 0, 0}\n };\n\n int c = 0;\n bool show_help = false;\n while (true) {\n int option_index = 0;\n c = getopt_long(argc, argv, short_option, long_option, &option_index);\n\n if (c == -1) \/\/ end of options\n break;\n\n switch (c) {\n case 'h': show_help = true; break;\n case 'i': param->in_bam = optarg; break;\n case 'o': param->out_bam = optarg; break;\n case 'r': param->ref_fasta = optarg; break;\n case 'z': param->za_add = false; break;\n }\n }\n\n if (show_help || param->in_bam.empty() \n || param->out_bam.empty() || param->ref_fasta.empty()) {\n ShowHelp();\n return false;\n }\n\n return true;\n}\n\nint PickBestAlignment(const int& request_score, \n const StripedSmithWaterman::Alignment& alignment, \n\t\t const SpecialReference& s_ref) {\n if (alignment.sw_score < request_score) {\n return -1; \/\/ no proper alignment is found\n } else {\n int accu_len = 0;\n for (unsigned int i = 0; i < s_ref.ref_lens.size(); ++i) {\n accu_len += s_ref.ref_lens[i];\n if (alignment.ref_begin < accu_len) {\n if (alignment.ref_end < accu_len) return i;\n\telse return -1;\n }\n }\n }\n\n return -1;\n}\n\nint main(int argc, char** argv) {\n Param param;\n \n if (!ParseArguments(argc, argv, ¶m)) return 1;\n\n \/\/ Open input bam\n string infilename = param.in_bam;\n string outfilename = param.out_bam;\n BamTools::BamReader reader;\n BamTools::BamWriter writer;\n if (!OpenBams(infilename, outfilename, param.command_line, &reader, &writer)) return 1;\n\n \/\/ Open fasta\n FastaReference fasta;\n LoadReference(param.ref_fasta.c_str(), &fasta);\n\n \/\/ Build SSW aligners for every reference in fasta\n SpecialReference s_ref;\n ConcatenateSpecialReference(&fasta, &s_ref);\n\n \/\/ Build SSW aligner\n StripedSmithWaterman::Aligner aligner;\n aligner.SetReferenceSequence(s_ref.concatnated.c_str(), s_ref.concatnated_len);\n\n \/\/ CORE ALGORITHM\n BamTools::BamAlignment bam_alignment;\n map<string, Alignment> al_map1, al_map2;\n map<string, Alignment> *al_map_cur = &al_map1, *al_map_pre = &al_map2;\n StripedSmithWaterman::Alignment alignment;\n Alignment al;\n while (reader.GetNextAlignment(bam_alignment)) {\n int index = -1;\n if (param.za_add) {\n Align(bam_alignment.QueryBases, aligner, &alignment);\n index = PickBestAlignment(bam_alignment.Length, alignment, s_ref);\n if (index == -1) { \/\/ try the reverse complement sequences\n string reverse;\n GetReverseComplement(bam_alignment.QueryBases, &reverse);\n Align(reverse, aligner, &alignment);\n index = PickBestAlignment(bam_alignment.Length, alignment, s_ref);\n }\n }\n al.Clear();\n al.bam_alignment = bam_alignment;\n al.hit_insertion = (index == -1) ? false: true;\n al.ins_prefix = (index == -1) ? \"\" : s_ref.ref_names[index].substr(8,2);\n StoreAlignment(param.za_add, &al, al_map_cur, al_map_pre, &writer);\n }\n\n \/\/ Close\n WriteAlignment(param.za_add, &al_map1, &writer);\n WriteAlignment(param.za_add, &al_map2, &writer);\n al_map1.clear();\n al_map2.clear();\n reader.Close();\n writer.Close();\n}\n<commit_msg>Shrink tangram_bam pool; decrease the number of reads for SSW<commit_after>#include \"tangram_bam.h\"\n#include <stdio.h>\n#include <limits.h>\n#include <getopt.h>\n\n#include <vector>\n#include <string>\n#include <iostream>\n\n#include \"api\/BamReader.h\"\n#include \"api\/BamWriter.h\"\n#include \"..\/OutSources\/fasta\/Fasta.h\"\n#include \"..\/OutSources\/stripedSW\/ssw_cpp.h\"\n\nusing namespace std;\n\nvoid ShowHelp() {\n fprintf(stderr, \"Usage: tangram_bam <in_bam> <ref_fa> <out_bam>\\n\\n\");\n fprintf(stderr, \"tangram_bam will generate ZA tags for bams\");\n fprintf(stderr, \" that are not generated by MOSAIK.\\n\");\n\n fprintf(stderr, \"<ref_fa> is a fasta file containing insertion sequences\\n\");\n fprintf(stderr, \" that we are going to detect them.\\n\");\n}\n\nbool OpenBams(\n const string& infilename,\n const string& outfilename,\n const string& command_line,\n BamTools::BamReader* reader,\n BamTools::BamWriter* writer) {\n \n reader->Open(infilename);\n if (!reader->IsOpen()) {\n fprintf(stderr, \"ERROR: The bam file, %s, cannot be open\\n\", infilename.c_str());\n return false;\n }\n\n \/\/ Load header and ref\n string header = reader->GetHeaderText();\n size_t pos1 = header.find(\"SO:\");\n if (pos1 != string::npos) {\n size_t pos2 = header.find(\"SO:queryname\");\n if (pos2 != string::npos) header.replace(pos2, 12, \"SO:unsorted\");\n pos2 = header.find(\"SO:coordinate\");\n if (pos2 != string::npos) header.replace(pos2, 13, \"SO:unsorted\");\n }\n header += \"@PG\\tID:tangram_bam\\tCL:\";\n header += (command_line + '\\n');\n BamTools::RefVector ref = reader->GetReferenceData();\n\n if (!writer->Open(outfilename, header, ref)) {\n fprintf(stderr, \"ERROR: The bam file, %s, cannot be open\\n\", outfilename.c_str());\n reader->Close();\n return false;\n }\n\n return true;\n}\n\ninline bool LoadReference(const char* fa, FastaReference* fasta) {\n string filename = fa;\n fasta->open(filename);\n\n return true;\n}\n\nbool ConcatenateSpecialReference(\n FastaReference* fasta, \n SpecialReference* s_ref) {\n int total_len = 0;\n for (vector<string>::const_iterator ite = fasta->index->sequenceNames.begin();\n ite != fasta->index->sequenceNames.end(); ++ite) {\n s_ref->concatnated += fasta->getSequence(*ite).c_str();\n s_ref->ref_lens.push_back(fasta->sequenceLength(*ite));\n s_ref->ref_names.push_back(*ite);\n total_len += fasta->sequenceLength(*ite);\n }\n\n s_ref->concatnated_len = total_len;\n\n return true;\n}\n\nvoid GetReverseComplement(const string& query, string* reverse) {\n reverse->clear();\n\n for (string::const_reverse_iterator ite = query.rbegin(); ite != query.rend(); ++ite) {\n switch(*ite) {\n case 'A': *reverse += 'T'; break;\n case 'C': *reverse += 'G'; break;\n case 'G': *reverse += 'C'; break;\n case 'T': *reverse += 'A'; break;\n default: *reverse += 'N';\n }\n }\n}\n\nvoid Align(\n const string& query,\n const StripedSmithWaterman::Aligner& aligner,\n StripedSmithWaterman::Alignment* alignment) {\n \n alignment->Clear();\n aligner.Align(query.c_str(), kFilter, alignment);\n}\n\nvoid GetZa(const Alignment& al, const Alignment& mate, string* za) {\n const bool mate1 = al.bam_alignment.IsFirstMate();\n Alignment const *mate1_ptr, *mate2_ptr;\n\n if (mate1) {\n *za = \"<@;\";\n mate1_ptr = &al;\n mate2_ptr = &mate;\n } else {\n *za = \"<&;\";\n mate1_ptr = &mate;\n mate2_ptr = &al;\n }\n\n *za += (std::to_string(mate1_ptr->bam_alignment.MapQuality) + \";;\" \n + (mate1_ptr->hit_insertion ? mate1_ptr->ins_prefix : \"\") \n\t + \";1;\");\n \n if (mate1) {\n *za += \";><&;\";\n } else {\n *za += \";><@;\";\n }\n\n *za += (std::to_string(mate2_ptr->bam_alignment.MapQuality) + \";;\" \n + (mate2_ptr->hit_insertion ? mate2_ptr->ins_prefix : \"\") \n\t + \";1;;>\");\n\n}\n\nvoid WriteAlignment(\n const bool& add_za,\n const Alignment& mate,\n Alignment* al,\n BamTools::BamWriter* writer) {\n \n if (add_za) {\n string za;\n GetZa(*al, mate, &za);\n al->bam_alignment.AddTag(\"ZA\",\"Z\",za);\n }\n\n writer->SaveAlignment(al->bam_alignment);\n}\n\nvoid WriteAlignment(const bool& add_za,\n map<string, Alignment>* al_map_ite, \n BamTools::BamWriter* writer) {\n\t\t \n for (map<string, Alignment>::iterator ite = al_map_ite->begin();\n ite != al_map_ite->end(); ++ite) {\n Alignment* al = &(ite->second);\n if (add_za) {\n string za;\n if (al->bam_alignment.IsPaired()) { \/\/ paired-end read\n if (al->bam_alignment.IsFirstMate()) {\n za = \"<@;\" + std::to_string(al->bam_alignment.MapQuality) + \";;\"\n + (al->hit_insertion ? al->ins_prefix : \"\") + \";1;;>\"\n\t + \"<&;0;;;0;;>\";\n } else {\n za = \"<&;0;;;0;;><@;\" + std::to_string(al->bam_alignment.MapQuality) + \";;\"\n + (al->hit_insertion ? al->ins_prefix : \"\") + \";1;;>\";\n }\n } else { \/\/ sinle-end read\n za = \"<@;\" + std::to_string(al->bam_alignment.MapQuality) + \";;\"\n + (al->hit_insertion ? al->ins_prefix : \"\") + \";1;;>\";\n }\n\n al->bam_alignment.AddTag(\"ZA\",\"Z\",za);\n }\n\n writer->SaveAlignment(al->bam_alignment);\n }\n}\n\n\/\/ Return true if an alignment contains too many soft clips\ninline bool IsTooManyClips (const BamTools::BamAlignment& al) {\n if (al.CigarData.empty()) return true;\n\n int clip = 0;\n if ((al.CigarData.begin())->Type == 'S') clip += (al.CigarData.begin())->Length;\n if ((al.CigarData.rbegin())->Type == 'S') clip += (al.CigarData.rbegin())->Length;\n\n if (clip > (al.Length * kSoftClipRate)) return true;\n else return false;\n}\n\ninline void MarkAsUnmapped (BamTools::BamAlignment* al, BamTools::BamAlignment* mate) {\n const bool al_unmapped = IsTooManyClips(*al);\n const bool mate_unmapped = IsTooManyClips(*mate);\n\n if (!al_unmapped && !mate_unmapped) {\n \/\/ nothing\n } else {\n al->SetIsMapped(!al_unmapped);\n mate->SetIsMapped(!mate_unmapped);\n al->SetIsMateMapped(!mate_unmapped);\n mate->SetIsMateMapped(!al_unmapped);\n }\n}\n\nvoid StoreAlignment(\n const bool& add_za,\n Alignment* al,\n map<string, Alignment> *al_map_cur,\n map<string, Alignment> *al_map_pre,\n BamTools::BamWriter* writer) {\n \/\/ Clear up the buffers once the al_map_cur buffer is full\n \/\/ 1. Clear up al_map_pre\n \/\/ 2. move al_map_cur to al_map_pre\n if ((static_cast<int>(al_map_cur->size()) > kAlignmentMapSize)) {\n WriteAlignment(add_za, al_map_pre, writer);\n al_map_pre->clear();\n map<string, Alignment> *tmp = al_map_pre;\n al_map_pre = al_map_cur;\n al_map_cur = tmp;\n }\n\n map<string, Alignment>::iterator ite_cur = al_map_cur->find(al->bam_alignment.Name);\n if (ite_cur == al_map_cur->end()) {\n if (!al_map_pre) {\n map<string, Alignment>::iterator ite_pre = al_map_pre->find(al->bam_alignment.Name);\n if (ite_pre == al_map_pre->end()) { \/\/ al is not found in cur or pre either\n (*al_map_cur)[al->bam_alignment.Name] = *al;\n } else { \/\/ find the mate in al_map_pre\n MarkAsUnmapped(&(al->bam_alignment), &(ite_pre->second.bam_alignment));\n\tWriteAlignment(add_za, ite_pre->second, al, writer);\n WriteAlignment(add_za, *al, &(ite_pre->second), writer);\n al_map_pre->erase(ite_pre);\n }\n } else { \/\/ al is not found in cur and pre is NULL\n (*al_map_cur)[al->bam_alignment.Name] = *al;\n }\n } else { \/\/ find the mate in al_map_cur\n MarkAsUnmapped(&(al->bam_alignment), &(ite_cur->second.bam_alignment));\n WriteAlignment(add_za, ite_cur->second, al, writer);\n WriteAlignment(add_za, *al, &(ite_cur->second), writer);\n al_map_cur->erase(ite_cur);\n }\n \n}\n\nbool ParseArguments(const int argc, char* const * argv, Param* param) {\n if (argc == 1) { \/\/ no argument\n ShowHelp();\n return false;\n }\n\n \/\/ record command line\n param->command_line = argv[0];\n for ( int i = 1; i < argc; ++i ) {\n param->command_line += \" \";\n param->command_line += argv[i];\n }\n\n const char *short_option = \"hi:o:r:z\";\n const struct option long_option[] = {\n {\"help\", no_argument, NULL, 'h'},\n {\"input\", required_argument, NULL, 'i'},\n {\"output\", required_argument, NULL, 'o'},\n {\"ref\", required_argument, NULL, 'r'},\n {\"no-za-add\", no_argument, NULL, 'z'},\n\n {0, 0, 0, 0}\n };\n\n int c = 0;\n bool show_help = false;\n while (true) {\n int option_index = 0;\n c = getopt_long(argc, argv, short_option, long_option, &option_index);\n\n if (c == -1) \/\/ end of options\n break;\n\n switch (c) {\n case 'h': show_help = true; break;\n case 'i': param->in_bam = optarg; break;\n case 'o': param->out_bam = optarg; break;\n case 'r': param->ref_fasta = optarg; break;\n case 'z': param->za_add = false; break;\n }\n }\n\n if (show_help || param->in_bam.empty() \n || param->out_bam.empty() || param->ref_fasta.empty()) {\n ShowHelp();\n return false;\n }\n\n return true;\n}\n\nint PickBestAlignment(const int& request_score, \n const StripedSmithWaterman::Alignment& alignment, \n\t\t const SpecialReference& s_ref) {\n if (alignment.sw_score < request_score) {\n return -1; \/\/ no proper alignment is found\n } else {\n int accu_len = 0;\n for (unsigned int i = 0; i < s_ref.ref_lens.size(); ++i) {\n accu_len += s_ref.ref_lens[i];\n if (alignment.ref_begin < accu_len) {\n if (alignment.ref_end < accu_len) return i;\n\telse return -1;\n }\n }\n }\n\n return -1;\n}\n\nbool IsProblematicAlignment(const BamTools::BamAlignment& al) {\n if (!al.IsMapped()) return true;\n if (al.RefID != al.MateRefID) return true;\n if (al.CigarData.size() > 5) return true;\n if (IsTooManyClips(al)) return true;\n\n return false;\n}\n\nint main(int argc, char** argv) {\n Param param;\n \n if (!ParseArguments(argc, argv, ¶m)) return 1;\n\n \/\/ Open input bam\n string infilename = param.in_bam;\n string outfilename = param.out_bam;\n BamTools::BamReader reader;\n BamTools::BamWriter writer;\n if (!OpenBams(infilename, outfilename, param.command_line, &reader, &writer)) return 1;\n\n \/\/ Get the ID of target chromosome\n\n \/\/ Open fasta\n FastaReference fasta;\n LoadReference(param.ref_fasta.c_str(), &fasta);\n\n \/\/ Build SSW aligners for every reference in fasta\n SpecialReference s_ref;\n ConcatenateSpecialReference(&fasta, &s_ref);\n\n \/\/ Build SSW aligner\n StripedSmithWaterman::Aligner aligner;\n aligner.SetReferenceSequence(s_ref.concatnated.c_str(), s_ref.concatnated_len);\n\n \/\/ CORE ALGORITHM\n BamTools::BamAlignment bam_alignment;\n map<string, Alignment> al_map1, al_map2;\n map<string, Alignment> *al_map_cur = &al_map1, *al_map_pre = &al_map2;\n StripedSmithWaterman::Alignment alignment;\n Alignment al;\n while (reader.GetNextAlignment(bam_alignment)) {\n int index = -1;\n if (param.za_add && IsProblematicAlignment(bam_alignment)) {\n Align(bam_alignment.QueryBases, aligner, &alignment);\n index = PickBestAlignment(bam_alignment.Length, alignment, s_ref);\n if (index == -1) { \/\/ try the reverse complement sequences\n string reverse;\n GetReverseComplement(bam_alignment.QueryBases, &reverse);\n Align(reverse, aligner, &alignment);\n index = PickBestAlignment(bam_alignment.Length, alignment, s_ref);\n }\n }\n al.Clear();\n al.bam_alignment = bam_alignment;\n al.hit_insertion = (index == -1) ? false: true;\n al.ins_prefix = (index == -1) ? \"\" : s_ref.ref_names[index].substr(8,2);\n StoreAlignment(param.za_add, &al, al_map_cur, al_map_pre, &writer);\n }\n\n \/\/ Close\n WriteAlignment(param.za_add, &al_map1, &writer);\n WriteAlignment(param.za_add, &al_map2, &writer);\n al_map1.clear();\n al_map2.clear();\n reader.Close();\n writer.Close();\n}\n<|endoftext|>"} {"text":"<commit_before>\/\/! @file\n\/\/! @copyright See <a href=\"LICENSE.txt\">LICENSE.txt<\/a>.\n\n#pragma once\n\n#include \"bounded\/static.hpp\"\n#include \"quantities\/wall_time.hpp\"\n#include \"rsrc\/fonts.hpp\"\n#include \"utility\/reference.hpp\"\n#include \"utility\/simple_moving_average.hpp\"\n\n#include <SFML\/Graphics.hpp>\n\n#include <deque>\n\nnamespace ql {\n\tstruct widget;\n\n\t\/\/! Represents an instance of the game Questless.\n\tstruct game {\n\t\t\/\/! @param fullscreen Whether to run the game in fullscreen mode.\n\t\tgame(bool fullscreen);\n\n\t\t~game();\n\n\t\t\/\/! Runs a new game of Questless.\n\t\tauto run() -> void;\n\n\tprivate:\n\t\tsf::RenderWindow _window;\n\n\t\trsrc::fonts _fonts;\n\n\t\tuptr<widget> _root;\n\n\t\t\/\/ Timing\n\n\t\t\/\/! The last time the game updated.\n\t\tclock::time_point _last_update_time = clock::now();\n\n\t\t\/\/! Time debt is nonnegative.\n\t\tstatic constexpr sec min_time_debt = 0.0_s;\n\t\t\/\/! Capped to prevent too much \"fast-forwarding\".\n\t\tstatic constexpr sec max_time_debt = 1.0_s;\n\t\t\/\/! How far behind the target frame duration the scene is.\n\t\tstatic_bounded<sec, min_time_debt, max_time_debt> _time_debt = 0.0_s;\n\n\t\tstatic constexpr size_t _fps_buffer_size = 25;\n\t\tsimple_moving_average<per_sec, _fps_buffer_size> _avg_fps;\n\n\t\t\/\/! Tries to keep the scene running at the target frame rate.\n\t\t\/\/! @return The duration of the last frame.\n\t\tauto regulate_timing() -> sec;\n\n\t\t\/\/! Draws the FPS counter.\n\t\tauto draw_fps() -> void;\n\n\t\t\/\/! Inform the root element that the user is trying to quit.\n\t\tauto request_quit() -> void;\n\t};\n}\n<commit_msg>Seems redundant to give this template parameter a named value just because.<commit_after>\/\/! @file\n\/\/! @copyright See <a href=\"LICENSE.txt\">LICENSE.txt<\/a>.\n\n#pragma once\n\n#include \"bounded\/static.hpp\"\n#include \"quantities\/wall_time.hpp\"\n#include \"rsrc\/fonts.hpp\"\n#include \"utility\/reference.hpp\"\n#include \"utility\/simple_moving_average.hpp\"\n\n#include <SFML\/Graphics.hpp>\n\n#include <deque>\n\nnamespace ql {\n\tstruct widget;\n\n\t\/\/! Represents an instance of the game Questless.\n\tstruct game {\n\t\t\/\/! @param fullscreen Whether to run the game in fullscreen mode.\n\t\tgame(bool fullscreen);\n\n\t\t~game();\n\n\t\t\/\/! Runs a new game of Questless.\n\t\tauto run() -> void;\n\n\tprivate:\n\t\tsf::RenderWindow _window;\n\n\t\trsrc::fonts _fonts;\n\n\t\tuptr<widget> _root;\n\n\t\t\/\/ Timing\n\n\t\t\/\/! The last time the game updated.\n\t\tclock::time_point _last_update_time = clock::now();\n\n\t\t\/\/! Time debt is nonnegative.\n\t\tstatic constexpr sec min_time_debt = 0.0_s;\n\t\t\/\/! Capped to prevent too much \"fast-forwarding\".\n\t\tstatic constexpr sec max_time_debt = 1.0_s;\n\t\t\/\/! How far behind the target frame duration the scene is.\n\t\tstatic_bounded<sec, min_time_debt, max_time_debt> _time_debt = 0.0_s;\n\n\t\tsimple_moving_average<per_sec, 25> _avg_fps;\n\n\t\t\/\/! Tries to keep the scene running at the target frame rate.\n\t\t\/\/! @return The duration of the last frame.\n\t\tauto regulate_timing() -> sec;\n\n\t\t\/\/! Draws the FPS counter.\n\t\tauto draw_fps() -> void;\n\n\t\t\/\/! Inform the root element that the user is trying to quit.\n\t\tauto request_quit() -> void;\n\t};\n}\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\/\/\n\/\/ MainPage.xaml.cpp\n\/\/ Implementation of the MainPage class.\n\/\/\n\n#include \"pch.h\"\n#include \"MainPage.xaml.h\"\n#include <string>\n\nusing namespace BlinkyCpp;\n\nusing namespace Platform;\nusing namespace Windows::Foundation;\nusing namespace Windows::Foundation::Collections;\nusing namespace Windows::UI::Xaml;\nusing namespace Windows::UI::Xaml::Controls;\nusing namespace Windows::UI::Xaml::Controls::Primitives;\nusing namespace Windows::UI::Xaml::Data;\nusing namespace Windows::UI::Xaml::Input;\nusing namespace Windows::UI::Xaml::Media;\nusing namespace Windows::UI::Xaml::Navigation;\nusing namespace Windows::Devices::Enumeration;\nusing namespace Windows::Devices::Gpio;\nusing namespace concurrency;\n\nMainPage::MainPage()\n{\n InitializeComponent();\n\n InitGPIO();\n\n timer_ = ref new DispatcherTimer();\n TimeSpan interval;\n interval.Duration = 500 * 1000 * 10;\n timer_->Interval = interval;\n timer_->Tick += ref new EventHandler<Object ^>(this, &MainPage::OnTick);\n timer_->Start();\n}\n\nvoid MainPage::InitGPIO()\n{\n\tauto gpio = GpioController::GetDefault();\n\n\tif (gpio == nullptr)\n\t{\n\t\tpin_ = nullptr;\n\t\tGpioStatus->Text = \"There is no GPIO controller on this device.\";\n\t\treturn;\n\t}\n\n\tpin_ = gpio->OpenPin(LED_PIN);\n\tpin_->Write(GpioPinValue::High);\n\tpin_->SetDriveMode(GpioPinDriveMode::Output);\n\n\tGpioStatus->Text = \"GPIO pin initialized correctly.\";\n}\n\nvoid MainPage::FlipLED()\n{\n if (LEDStatus_ == 0)\n {\n LEDStatus_ = 1;\n if (pin_ != nullptr)\n {\n pin_->Write(GpioPinValue::High);\n }\n LED->Fill = redBrush_;\n }\n else\n {\n LEDStatus_ = 0;\n if (pin_ != nullptr)\n {\n pin_->Write(GpioPinValue::Low);\n }\n LED->Fill = grayBrush_;\n }\n}\n\nvoid MainPage::TurnOffLED()\n{\n if (LEDStatus_ == 1)\n {\n FlipLED();\n }\n}\n\nvoid MainPage::OnTick(Object ^sender, Object ^args)\n{\n FlipLED();\n}\n\n\nvoid MainPage::Delay_ValueChanged(Object^ sender, RangeBaseValueChangedEventArgs^ e)\n{\n if (timer_ == nullptr)\n {\n return;\n }\n if (e->NewValue == Delay->Minimum)\n {\n DelayText->Text = \"Stopped\";\n timer_->Stop();\n TurnOffLED();\n }\n else\n {\n long delay = static_cast<long>(e->NewValue);\n auto txt = std::to_wstring(delay) + L\"ms\";\n DelayText->Text = ref new String(txt.c_str());\n TimeSpan interval;\n interval.Duration = delay * 1000 * 10;\n timer_->Interval = interval;\n timer_->Start();\n }\n\n}\n<commit_msg>Blinky cpp gpio logic corrected. Matches correct CS code.<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\/\/\n\/\/ MainPage.xaml.cpp\n\/\/ Implementation of the MainPage class.\n\/\/\n\n#include \"pch.h\"\n#include \"MainPage.xaml.h\"\n#include <string>\n\nusing namespace BlinkyCpp;\n\nusing namespace Platform;\nusing namespace Windows::Foundation;\nusing namespace Windows::Foundation::Collections;\nusing namespace Windows::UI::Xaml;\nusing namespace Windows::UI::Xaml::Controls;\nusing namespace Windows::UI::Xaml::Controls::Primitives;\nusing namespace Windows::UI::Xaml::Data;\nusing namespace Windows::UI::Xaml::Input;\nusing namespace Windows::UI::Xaml::Media;\nusing namespace Windows::UI::Xaml::Navigation;\nusing namespace Windows::Devices::Enumeration;\nusing namespace Windows::Devices::Gpio;\nusing namespace concurrency;\n\nMainPage::MainPage()\n{\n InitializeComponent();\n\n InitGPIO();\n\n timer_ = ref new DispatcherTimer();\n TimeSpan interval;\n interval.Duration = 500 * 1000 * 10;\n timer_->Interval = interval;\n timer_->Tick += ref new EventHandler<Object ^>(this, &MainPage::OnTick);\n timer_->Start();\n}\n\nvoid MainPage::InitGPIO()\n{\n\tauto gpio = GpioController::GetDefault();\n\n\tif (gpio == nullptr)\n\t{\n\t\tpin_ = nullptr;\n\t\tGpioStatus->Text = \"There is no GPIO controller on this device.\";\n\t\treturn;\n\t}\n\n\tpin_ = gpio->OpenPin(LED_PIN);\n\tpin_->Write(GpioPinValue::High);\n\tpin_->SetDriveMode(GpioPinDriveMode::Output);\n\n\tGpioStatus->Text = \"GPIO pin initialized correctly.\";\n}\n\nvoid MainPage::FlipLED()\n{\n if (LEDStatus_ == 0)\n {\n LEDStatus_ = 1;\n if (pin_ != nullptr)\n {\n pin_->Write(GpioPinValue::Low);\n }\n LED->Fill = redBrush_;\n }\n else\n {\n LEDStatus_ = 0;\n if (pin_ != nullptr)\n {\n pin_->Write(GpioPinValue::High);\n }\n LED->Fill = grayBrush_;\n }\n}\n\nvoid MainPage::TurnOffLED()\n{\n if (LEDStatus_ == 1)\n {\n FlipLED();\n }\n}\n\nvoid MainPage::OnTick(Object ^sender, Object ^args)\n{\n FlipLED();\n}\n\n\nvoid MainPage::Delay_ValueChanged(Object^ sender, RangeBaseValueChangedEventArgs^ e)\n{\n if (timer_ == nullptr)\n {\n return;\n }\n if (e->NewValue == Delay->Minimum)\n {\n DelayText->Text = \"Stopped\";\n timer_->Stop();\n TurnOffLED();\n }\n else\n {\n long delay = static_cast<long>(e->NewValue);\n auto txt = std::to_wstring(delay) + L\"ms\";\n DelayText->Text = ref new String(txt.c_str());\n TimeSpan interval;\n interval.Duration = delay * 1000 * 10;\n timer_->Interval = interval;\n timer_->Start();\n }\n\n}\n<|endoftext|>"} {"text":"<commit_before>\/*\n * The Apache Software License, Version 1.1\n *\n *\n * Copyright (c) 2000-2002 The Apache Software Foundation. All rights \n * reserved.\n *\n * Redistribution and use in source and binary forms, with or without\n * modification, are permitted provided that the following conditions\n * are met:\n *\n * 1. Redistributions of source code must retain the above copyright\n *\t notice, this list of conditions and the following disclaimer. \n *\n * 2. Redistributions in binary form must reproduce the above copyright\n *\t notice, this list of conditions and the following disclaimer in\n *\t the documentation and\/or other materials provided with the\n *\t distribution.\n *\n * 3. The end-user documentation included with the redistribution,\n *\t if any, must include the following acknowledgment: \n *\t\t \"This product includes software developed by the\n *\t\t Apache Software Foundation (http:\/\/www.apache.org\/).\"\n *\t Alternately, this acknowledgment may appear in the software itself,\n *\t if and wherever such third-party acknowledgments normally appear.\n *\n * 4. The names \"Xalan\" and \"Apache Software Foundation\" must\n *\t not be used to endorse or promote products derived from this\n *\t software without prior written permission. For written \n *\t permission, please contact apache@apache.org.\n *\n * 5. Products derived from this software may not be called \"Apache\",\n *\t nor may \"Apache\" appear in their name, without prior written\n *\t 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.\tIN NO EVENT SHALL THE APACHE SOFTWARE FOUNDATION OR\n * ITS CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,\n * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT\n * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF\n * USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND\n * ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,\n * OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT\n * OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF\n * SUCH DAMAGE.\n * ====================================================================\n *\n * This software consists of voluntary contributions made by many\n * individuals on behalf of the Apache Software Foundation and was\n * originally based on software copyright (c) 1999, International\n * Business Machines, Inc., http:\/\/www.ibm.com. For more\n * information on the Apache Software Foundation, please see\n * <http:\/\/www.apache.org\/>.\n *\n * $ Id: $\n *\n *\/\n\n#if !defined(XALAN_NAMESPACESHANDLER_HEADER_GUARD)\n#define XALAN_NAMESPACESHANDLER_HEADER_GUARD\n\n\n\n\/\/ Base include file. Must be first.\n#include <XSLT\/XSLTDefinitions.hpp>\n\n\n\n#include <map>\n#include <set>\n#include <vector>\n\n\n\n#include <PlatformSupport\/DOMStringHelper.hpp>\n\n\n\n#include <XPath\/NameSpace.hpp>\n#include <XPath\/XalanQName.hpp>\n\n\n\nXALAN_CPP_NAMESPACE_BEGIN\n\n\n\nclass StylesheetConstructionContext;\nclass StylesheetExecutionContext;\n\n\n\nclass XALAN_XSLT_EXPORT NamespacesHandler\n{\npublic:\n\n\tclass PrefixChecker\n\t{\n\tpublic:\n\n\t\tPrefixChecker();\n\n\t\tvirtual\n\t\t~PrefixChecker();\n\n\t\tvirtual bool\n\t\tisActive(const XalanDOMString&\tthePrefix) const = 0;\n\t};\n\n\tclass XALAN_XSLT_EXPORT Namespace\n\t{\n\tpublic:\n\n\t\tNamespace() :\n\t\t\tm_prefix(&s_emptyString),\n\t\t\tm_uri(&s_emptyString)\n\t\t{\n\t\t}\n\n\t\tNamespace(\n\t\t\t\t\tconst XalanDOMString&\tprefix,\n\t\t\t\t\tconst XalanDOMString&\turi) :\n\t\t\tm_prefix(&prefix),\n\t\t\tm_uri(&uri)\n\t\t{\n\t\t}\n\n\t\t\/**\n\t\t * Retrieve the prefix for namespace\n\t\t * \n\t\t * @return prefix string\n\t\t *\/\n\t\tconst XalanDOMString&\n\t\tgetPrefix() const\n\t\t{\n\t\t\tassert(m_prefix != 0);\n\n\t\t\treturn *m_prefix;\n\t\t}\n\n\t\t\/**\n\t\t * Set the prefix for namespace\n\t\t * \n\t\t * @param prefix The new prefix value\n\t\t *\/\n\t\tvoid\n\t\tsetPrefix(const XalanDOMString&\t\tprefix)\n\t\t{\n\t\t\tm_prefix = &prefix;\n\t\t}\n\n\t\t\/**\n\t\t * Retrieve the URI for namespace\n\t\t * \n\t\t * @return URI string\n\t\t *\/\n\t\tconst XalanDOMString&\n\t\tgetURI() const\n\t\t{\n\t\t\tassert(m_uri != 0);\n\n\t\t\treturn *m_uri;\n\t\t}\n\n\t\t\/**\n\t\t * Set the URI for namespace\n\t\t * \n\t\t * @param uri The new uri value\n\t\t *\/\n\t\tvoid\n\t\tsetURI(const XalanDOMString&\turi)\n\t\t{\n\t\t\tm_uri = &uri;\n\t\t}\n\n\tprotected:\n\n\t\tstatic const XalanDOMString\t\ts_emptyString;\n\n\tprivate:\n\n\t\tconst XalanDOMString*\tm_prefix;\n\n\t\tconst XalanDOMString*\tm_uri;\n\t};\n\n\tclass XALAN_XSLT_EXPORT NamespaceExtended : public Namespace\n\t{\n\tpublic:\n\n\t\tNamespaceExtended() :\n\t\t\tNamespace(),\n\t\t\tm_resultAttributeName(&s_emptyString)\n\t\t{\n\t\t}\n\n\t\tNamespaceExtended(\n\t\t\t\t\tconst XalanDOMString&\tprefix,\n\t\t\t\t\tconst XalanDOMString&\turi) :\n\t\t\tNamespace(prefix, uri),\n\t\t\tm_resultAttributeName(&s_emptyString)\n\t\t{\n\t\t}\n\n\t\t\/**\n\t\t * Retrieve the name of the result attribute.\n\t\t * \n\t\t * @return name string\n\t\t *\/\n\t\tconst XalanDOMString&\n\t\tgetResultAttributeName() const\n\t\t{\n\t\t\tassert(m_resultAttributeName != 0);\n\n\t\t\treturn *m_resultAttributeName;\n\t\t}\n\n\t\t\/**\n\t\t * Set the name of the result attribute.\n\t\t * \n\t\t * @param name The new name value\n\t\t *\/\n\t\tvoid\n\t\tsetResultAttributeName(const XalanDOMString&\tname)\n\t\t{\n\t\t\tm_resultAttributeName = &name;\n\t\t}\n\n\tprivate:\n\n\t\tconst XalanDOMString*\tm_resultAttributeName;\n\t};\n\n\ttypedef XalanQName::NamespaceVectorType\t\t\t\tNamespaceVectorType;\n\ttypedef XalanQName::NamespacesStackType\t\t\t\tNamespacesStackType;\n\n#if defined(XALAN_NO_STD_NAMESPACE)\n\ttypedef vector<Namespace>\t\t\t\t\t\t\tNamespacesVectorType;\n\n\ttypedef vector<NamespaceExtended>\t\t\t\t\tNamespaceExtendedVectorType;\n\n\ttypedef map<const XalanDOMString*,\n\t\t\t\tconst XalanDOMString*,\n\t\t\t\tDOMStringPointerLessThanFunction>\t\tExcludedResultPrefixesMapType;\n\n\ttypedef map<const XalanDOMString*,\n\t\t\t\tNamespaceExtended,\n\t\t\t\tDOMStringPointerLessThanFunction>\t\tNamespacesMapType;\n\n\ttypedef map<const XalanDOMString*,\n\t\t\t\tconst XalanDOMString*,\n\t\t\t\tDOMStringPointerLessThanFunction>\t\tNamespaceAliasesMapType;\n\n\ttypedef vector<const XalanDOMString*>\t\t\t\tXalanDOMStringPointerVectorType;\n#else\n\ttypedef std::vector<Namespace>\t\t\t\t\t\tNamespacesVectorType;\n\n\ttypedef std::vector<NamespaceExtended>\t\t\t\tNamespaceExtendedVectorType;\n\n\ttypedef std::map<const XalanDOMString*,\n\t\t\t\t\t const XalanDOMString*,\n\t\t\t\t\t DOMStringPointerLessThanFunction>\tExcludedResultPrefixesMapType;\n\n\ttypedef std::map<const XalanDOMString*,\n\t\t\t\t\t NamespaceExtended,\n\t\t\t\t\t DOMStringPointerLessThanFunction>\tNamespacesMapType;\n\n\ttypedef std::map<const XalanDOMString*,\n\t\t\t\t\t const XalanDOMString*,\n\t\t\t\t\t DOMStringPointerLessThanFunction>\tNamespaceAliasesMapType;\n\n\ttypedef std::vector<const XalanDOMString*>\t\t\tXalanDOMStringPointerVectorType;\n#endif\n\n\t\/**\n\t * Create a default, empty instance.\n\t *\/\n\texplicit\n\tNamespacesHandler();\n\n\t\/**\n\t * Create an instance namespace handler using the\n\t * current namespaces in effect.\n\t *\n\t * @param theConstructionContext The current construction context.\n\t * @param stylesheetNamespacesHandler The stylesheet's handler.\n\t * @param theCurrentNamespaces The stack of active namespace declarations.\n\t * @param theXSLTNamespaceURI The namespace URI for XSLT.\n\t *\/\n\tNamespacesHandler(\n\t\t\tStylesheetConstructionContext&\ttheConstructionContext,\n\t\t\tconst NamespacesHandler&\t\tstylesheetNamespacesHandler,\n\t\t\tconst NamespacesStackType&\t\ttheCurrentNamespaces,\n\t\t\tconst XalanDOMString&\t\t\ttheXSLTNamespaceURI);\n\n\t~NamespacesHandler();\n\n\t\/**\n\t * Process an exclude-result-prefixes attribute.\n\t *\n\t * @param theConstructionContext The current construction context.\n\t * @param theValue The attribute's value.\n\t * @param theCurrentNamespaces The stack of active namespace declarations.\n\t *\/\n\tvoid\n\tprocessExcludeResultPrefixes(\n\t\t\tStylesheetConstructionContext&\ttheConstructionContext,\n\t\t\tconst XalanDOMChar*\t\t\t\ttheValue,\n\t\t\tconst NamespacesStackType&\t\ttheCurrentNamespaces);\n\n\t\/**\n\t * Process an extension-element-prefixes attribute.\n\t *\n\t * @param theConstructionContext The current construction context.\n\t * @param theValue The attribute's value.\n\t * @param theCurrentNamespaces The stack of active namespace declarations.\n\t *\/\n\tvoid\n\tprocessExtensionElementPrefixes(\n\t\t\tStylesheetConstructionContext&\ttheConstructionContext,\n\t\t\tconst XalanDOMChar*\t\t\t\ttheValue,\n\t\t\tconst NamespacesStackType&\t\ttheCurrentNamespaces);\n\n\t\/**\n\t * Notify the instance that the stylesheet is fully constructed.\n\t *\n\t * @param theConstructionContext The current construction context.\n\t * @param fProcessNamespaceAliases If true, process any namespace aliases\n\t * @param theElementName The name of the owning element.\n\t * @param parentNamespacesHandler The parent handler, if any.\n\t * @param prefixChecker A pointer to a PrefixChecker instance to use, if any.\n\t *\/\n\tvoid\n\tpostConstruction(\n\t\t\tStylesheetConstructionContext&\ttheConstructionContext,\n\t\t\tbool\t\t\t\t\t\t\tfProcessNamespaceAliases = true,\n\t\t\tconst XalanDOMString&\t\t\ttheElementName = XalanDOMString(),\n\t\t\tconst NamespacesHandler*\t\tparentNamespacesHandler = 0,\n\t\t\tconst PrefixChecker*\t\t\tprefixChecker = 0);\n\n\tNamespacesHandler&\n\toperator=(const NamespacesHandler&\ttheRHS);\n\n\t\/**\n\t * Determine of a given namespace should be excluded.\n\t *\n\t * @param theXSLTNamespaceURI The namespace URI for XSLT.\n\t * @param theURI The namespace URI.\n\t * @return true of the namespace should be excluded, false if not.\n\t *\/\n\tbool\n\tshouldExcludeResultNamespaceNode(\n\t\t\tconst XalanDOMString&\ttheXSLTNamespaceURI,\n\t\t\tconst XalanDOMString&\ttheURI) const;\n\n\t\/**\n\t * Add a URI as an extension namespace prefixes.\n\t *\n\t * @param theConstructionContext The current construction context.\n\t * @param theURI The namespace URI.\n\t *\/\n\tvoid\n\taddExtensionNamespaceURI(\n\t\t\tStylesheetConstructionContext&\ttheConstructionContext,\n\t\t\tconst XalanDOMString&\ttheURI);\n\n\t\/**\n\t * Get the namespace URI for the given prefix.\n\t *\n\t * @param thePrefix The namespace prefix.\n\t * @return The namespace URI\n\t *\/\n\tconst XalanDOMString*\n\tgetNamespace(const XalanDOMString&\tthePrefix) const;\n\n\t\/**\n\t * Get the namespace alias URI for the given namespace.\n\t *\n\t * @param theStylesheetNamespace The namespace as declared in the stylesheet.\n\t * @return The namespace alias URI\n\t *\/\n\tconst XalanDOMString*\n\tgetNamespaceAlias(const XalanDOMString&\t\ttheStylesheetNamespace) const;\n\n\t\/**\n\t * Set the namespace alias URI for the given namespace.\n\t *\n\t * @param theConstructionContext The current construction context.\n\t * @param theStylesheetNamespace The namespace as declared in the stylesheet.\n\t * @param theResultNamespace The namespace as it should appear in the result tree.\n\t *\/\n\tvoid\n\tsetNamespaceAlias(\n\t\t\tStylesheetConstructionContext&\ttheConstructionContext,\n\t\t\tconst XalanDOMString&\t\t\ttheStylesheetNamespace,\n\t\t\tconst XalanDOMString&\t\t\ttheResultNamespace);\n\n\t\/**\n\t * Copy the aliases from the given NamespacesHandler.\n\t *\n\t * @param parentNamespacesHandler The parent handler.\n\t *\/\n\tvoid\n\tcopyNamespaceAliases(const NamespacesHandler&\tparentNamespacesHandler);\n\n\t\/**\n\t * Output the result tree namespace declarations.\n\t *\n\t * @param theExecutionContext The current execution context.\n\t * @param supressDefault If true, any default namespace declaration will not be output.\n\t *\/\n\tvoid\n\toutputResultNamespaces(\n\t\t\tStylesheetExecutionContext&\t\ttheExecutionContext,\n\t\t\tbool\t\t\t\t\t\t\tsupressDefault = false) const;\n\n\t\/**\n\t * Clear out the handler.\n\t *\/\n\tvoid\n\tclear();\n\n\t\/**\n\t * Swap the contents of this instance with another.\n\t *\n\t * @param theOther The other instance.\n\t *\/\n\tvoid\n\tswap(NamespacesHandler&\t\ttheOther);\n\n\tNamespacesMapType::size_type\n\tgetNamespaceDeclarationsCount() const\n\t{\n\t\treturn m_namespaceDeclarations.size();\n\t}\n\nprivate:\n\n\t\/**\n\t * Create all of the result attribute names.\n\t *\n\t * @param theConstructionContext The current construction context.\n\t *\/\n\tvoid\n\tcreateResultAttributeNames(StylesheetConstructionContext&\ttheConstructionContext);\n\n\t\/**\n\t * Process the exclude result prefix data.\n\t *\n\t * @param theConstructionContext The current construction context.\n\t * @param theElementPrefix The prefix of the owning element.\n\t * @param prefixChecker A pointer to a PrefixChecker instance to use, if any.\n\t *\/\n\tvoid\n\tprocessExcludeResultPrefixes(\n\t\t\tStylesheetConstructionContext&\ttheConstructionContext,\n\t\t\tconst XalanDOMString&\t\t\ttheElementPrefix,\n\t\t\tconst PrefixChecker*\t\t\tprefixChecker);\n\n\t\/**\n\t * Process the namespace aliases data.\n\t *\/\n\tvoid\n\tprocessNamespaceAliases();\n\n\t\/**\n\t * Copy the contents of the supplied map\n\t *\n\t * @param theNamespaceAliases The map to copy.\n\t *\/\n\tvoid\n\tcopyNamespaceAliases(const NamespaceAliasesMapType&\t\ttheNamespaceAliases);\n\n\t\/**\n\t * Copy the contents of the supplied vector\n\t *\n\t * @param theExtensionNamespaceURIs The set to copy.\n\t *\/\n\tvoid\n\tcopyExtensionNamespaceURIs(const XalanDOMStringPointerVectorType&\ttheExtensionNamespaceURIs);\n\n\t\/**\n\t * Copy the contents of the supplied vector\n\t *\n\t * @param theExcludeResultPrefixes The vector to copy.\n\t *\/\n\tvoid\n\tcopyExcludeResultPrefixes(const NamespacesVectorType&\ttheExcludeResultPrefixes);\n\n\t\/**\n\t * Determine if a given namespace should be excluded as a result of\n\t * an exclude-result-prefixes declaration.\n\t *\n\t * @param theNamespaceURI The namespace URI to check.\n\t * @return true if the namespace should be excluded, false if not.\n\t *\/\n\tbool\n\tisExcludedNamespaceURI(const XalanDOMString&\ttheNamespaceURI) const;\n\n\t\/**\n\t * Determine if a given URI is an extension namespace URI\n\t *\n\t * @param theNamespaceURI The namespace URI to check.\n\t * @return true if the namespace uri is an extension namespace URI, false if not.\n\t *\/\n\tbool\n\tisExtensionNamespaceURI(const XalanDOMString&\ttheNamespaceURI) const\n\t{\n\t\treturn findString(theNamespaceURI, m_extensionNamespaceURIs);\n\t}\n\n\t\/**\n\t * Determine if a given string is present in the vector\n\t *\n\t * @param theString The string to find.\n\t * @return true if the string is present, false if not.\n\t *\/\n\tstatic bool\n\tfindString(\n\t\t\tconst XalanDOMString&\t\t\t\t\ttheString,\n\t\t\tconst XalanDOMStringPointerVectorType&\ttheVector);\n\n\n\t\/\/ Not implemented...\n\tbool\n\toperator==(const NamespacesHandler&) const;\n\n\n\t\/\/ Data members...\n\tNamespacesVectorType\t\t\t\tm_excludedResultPrefixes;\n\n\tNamespaceExtendedVectorType\t\t\tm_namespaceDeclarations;\n\n\tXalanDOMStringPointerVectorType\t\tm_extensionNamespaceURIs;\n\n\tNamespaceAliasesMapType\t\t\t\tm_namespaceAliases;\n};\n\n\n\nXALAN_CPP_NAMESPACE_END\n\n\n\n#endif\t\/\/ XALAN_NAMESPACESHANDLER_HEADER_GUARD\n<commit_msg>Added missing export.<commit_after>\/*\n * The Apache Software License, Version 1.1\n *\n *\n * Copyright (c) 2000-2002 The Apache Software Foundation. All rights \n * reserved.\n *\n * Redistribution and use in source and binary forms, with or without\n * modification, are permitted provided that the following conditions\n * are met:\n *\n * 1. Redistributions of source code must retain the above copyright\n *\t notice, this list of conditions and the following disclaimer. \n *\n * 2. Redistributions in binary form must reproduce the above copyright\n *\t notice, this list of conditions and the following disclaimer in\n *\t the documentation and\/or other materials provided with the\n *\t distribution.\n *\n * 3. The end-user documentation included with the redistribution,\n *\t if any, must include the following acknowledgment: \n *\t\t \"This product includes software developed by the\n *\t\t Apache Software Foundation (http:\/\/www.apache.org\/).\"\n *\t Alternately, this acknowledgment may appear in the software itself,\n *\t if and wherever such third-party acknowledgments normally appear.\n *\n * 4. The names \"Xalan\" and \"Apache Software Foundation\" must\n *\t not be used to endorse or promote products derived from this\n *\t software without prior written permission. For written \n *\t permission, please contact apache@apache.org.\n *\n * 5. Products derived from this software may not be called \"Apache\",\n *\t nor may \"Apache\" appear in their name, without prior written\n *\t 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.\tIN NO EVENT SHALL THE APACHE SOFTWARE FOUNDATION OR\n * ITS CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,\n * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT\n * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF\n * USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND\n * ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,\n * OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT\n * OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF\n * SUCH DAMAGE.\n * ====================================================================\n *\n * This software consists of voluntary contributions made by many\n * individuals on behalf of the Apache Software Foundation and was\n * originally based on software copyright (c) 1999, International\n * Business Machines, Inc., http:\/\/www.ibm.com. For more\n * information on the Apache Software Foundation, please see\n * <http:\/\/www.apache.org\/>.\n *\n * $ Id: $\n *\n *\/\n\n#if !defined(XALAN_NAMESPACESHANDLER_HEADER_GUARD)\n#define XALAN_NAMESPACESHANDLER_HEADER_GUARD\n\n\n\n\/\/ Base include file. Must be first.\n#include <XSLT\/XSLTDefinitions.hpp>\n\n\n\n#include <map>\n#include <set>\n#include <vector>\n\n\n\n#include <PlatformSupport\/DOMStringHelper.hpp>\n\n\n\n#include <XPath\/NameSpace.hpp>\n#include <XPath\/XalanQName.hpp>\n\n\n\nXALAN_CPP_NAMESPACE_BEGIN\n\n\n\nclass StylesheetConstructionContext;\nclass StylesheetExecutionContext;\n\n\n\nclass XALAN_XSLT_EXPORT NamespacesHandler\n{\npublic:\n\n\tclass PrefixChecker\n\t{\n\tpublic:\n\n\t\tPrefixChecker();\n\n\t\tvirtual\n\t\t~PrefixChecker();\n\n\t\tvirtual bool\n\t\tisActive(const XalanDOMString&\tthePrefix) const = 0;\n\t};\n\n\tclass XALAN_XSLT_EXPORT Namespace\n\t{\n\tpublic:\n\n\t\tNamespace() :\n\t\t\tm_prefix(&s_emptyString),\n\t\t\tm_uri(&s_emptyString)\n\t\t{\n\t\t}\n\n\t\tNamespace(\n\t\t\t\t\tconst XalanDOMString&\tprefix,\n\t\t\t\t\tconst XalanDOMString&\turi) :\n\t\t\tm_prefix(&prefix),\n\t\t\tm_uri(&uri)\n\t\t{\n\t\t}\n\n\t\t\/**\n\t\t * Retrieve the prefix for namespace\n\t\t * \n\t\t * @return prefix string\n\t\t *\/\n\t\tconst XalanDOMString&\n\t\tgetPrefix() const\n\t\t{\n\t\t\tassert(m_prefix != 0);\n\n\t\t\treturn *m_prefix;\n\t\t}\n\n\t\t\/**\n\t\t * Set the prefix for namespace\n\t\t * \n\t\t * @param prefix The new prefix value\n\t\t *\/\n\t\tvoid\n\t\tsetPrefix(const XalanDOMString&\t\tprefix)\n\t\t{\n\t\t\tm_prefix = &prefix;\n\t\t}\n\n\t\t\/**\n\t\t * Retrieve the URI for namespace\n\t\t * \n\t\t * @return URI string\n\t\t *\/\n\t\tconst XalanDOMString&\n\t\tgetURI() const\n\t\t{\n\t\t\tassert(m_uri != 0);\n\n\t\t\treturn *m_uri;\n\t\t}\n\n\t\t\/**\n\t\t * Set the URI for namespace\n\t\t * \n\t\t * @param uri The new uri value\n\t\t *\/\n\t\tvoid\n\t\tsetURI(const XalanDOMString&\turi)\n\t\t{\n\t\t\tm_uri = &uri;\n\t\t}\n\n\tprotected:\n\n\t\tstatic const XalanDOMString\t\ts_emptyString;\n\n\tprivate:\n\n\t\tconst XalanDOMString*\tm_prefix;\n\n\t\tconst XalanDOMString*\tm_uri;\n\t};\n\n\tclass NamespaceExtended : public Namespace\n\t{\n\tpublic:\n\n\t\tNamespaceExtended() :\n\t\t\tNamespace(),\n\t\t\tm_resultAttributeName(&s_emptyString)\n\t\t{\n\t\t}\n\n\t\tNamespaceExtended(\n\t\t\t\t\tconst XalanDOMString&\tprefix,\n\t\t\t\t\tconst XalanDOMString&\turi) :\n\t\t\tNamespace(prefix, uri),\n\t\t\tm_resultAttributeName(&s_emptyString)\n\t\t{\n\t\t}\n\n\t\t\/**\n\t\t * Retrieve the name of the result attribute.\n\t\t * \n\t\t * @return name string\n\t\t *\/\n\t\tconst XalanDOMString&\n\t\tgetResultAttributeName() const\n\t\t{\n\t\t\tassert(m_resultAttributeName != 0);\n\n\t\t\treturn *m_resultAttributeName;\n\t\t}\n\n\t\t\/**\n\t\t * Set the name of the result attribute.\n\t\t * \n\t\t * @param name The new name value\n\t\t *\/\n\t\tvoid\n\t\tsetResultAttributeName(const XalanDOMString&\tname)\n\t\t{\n\t\t\tm_resultAttributeName = &name;\n\t\t}\n\n\tprivate:\n\n\t\tconst XalanDOMString*\tm_resultAttributeName;\n\t};\n\n\ttypedef XalanQName::NamespaceVectorType\t\t\t\tNamespaceVectorType;\n\ttypedef XalanQName::NamespacesStackType\t\t\t\tNamespacesStackType;\n\n#if defined(XALAN_NO_STD_NAMESPACE)\n\ttypedef vector<Namespace>\t\t\t\t\t\t\tNamespacesVectorType;\n\n\ttypedef vector<NamespaceExtended>\t\t\t\t\tNamespaceExtendedVectorType;\n\n\ttypedef map<const XalanDOMString*,\n\t\t\t\tconst XalanDOMString*,\n\t\t\t\tDOMStringPointerLessThanFunction>\t\tExcludedResultPrefixesMapType;\n\n\ttypedef map<const XalanDOMString*,\n\t\t\t\tNamespaceExtended,\n\t\t\t\tDOMStringPointerLessThanFunction>\t\tNamespacesMapType;\n\n\ttypedef map<const XalanDOMString*,\n\t\t\t\tconst XalanDOMString*,\n\t\t\t\tDOMStringPointerLessThanFunction>\t\tNamespaceAliasesMapType;\n\n\ttypedef vector<const XalanDOMString*>\t\t\t\tXalanDOMStringPointerVectorType;\n#else\n\ttypedef std::vector<Namespace>\t\t\t\t\t\tNamespacesVectorType;\n\n\ttypedef std::vector<NamespaceExtended>\t\t\t\tNamespaceExtendedVectorType;\n\n\ttypedef std::map<const XalanDOMString*,\n\t\t\t\t\t const XalanDOMString*,\n\t\t\t\t\t DOMStringPointerLessThanFunction>\tExcludedResultPrefixesMapType;\n\n\ttypedef std::map<const XalanDOMString*,\n\t\t\t\t\t NamespaceExtended,\n\t\t\t\t\t DOMStringPointerLessThanFunction>\tNamespacesMapType;\n\n\ttypedef std::map<const XalanDOMString*,\n\t\t\t\t\t const XalanDOMString*,\n\t\t\t\t\t DOMStringPointerLessThanFunction>\tNamespaceAliasesMapType;\n\n\ttypedef std::vector<const XalanDOMString*>\t\t\tXalanDOMStringPointerVectorType;\n#endif\n\n\t\/**\n\t * Create a default, empty instance.\n\t *\/\n\texplicit\n\tNamespacesHandler();\n\n\t\/**\n\t * Create an instance namespace handler using the\n\t * current namespaces in effect.\n\t *\n\t * @param theConstructionContext The current construction context.\n\t * @param stylesheetNamespacesHandler The stylesheet's handler.\n\t * @param theCurrentNamespaces The stack of active namespace declarations.\n\t * @param theXSLTNamespaceURI The namespace URI for XSLT.\n\t *\/\n\tNamespacesHandler(\n\t\t\tStylesheetConstructionContext&\ttheConstructionContext,\n\t\t\tconst NamespacesHandler&\t\tstylesheetNamespacesHandler,\n\t\t\tconst NamespacesStackType&\t\ttheCurrentNamespaces,\n\t\t\tconst XalanDOMString&\t\t\ttheXSLTNamespaceURI);\n\n\t~NamespacesHandler();\n\n\t\/**\n\t * Process an exclude-result-prefixes attribute.\n\t *\n\t * @param theConstructionContext The current construction context.\n\t * @param theValue The attribute's value.\n\t * @param theCurrentNamespaces The stack of active namespace declarations.\n\t *\/\n\tvoid\n\tprocessExcludeResultPrefixes(\n\t\t\tStylesheetConstructionContext&\ttheConstructionContext,\n\t\t\tconst XalanDOMChar*\t\t\t\ttheValue,\n\t\t\tconst NamespacesStackType&\t\ttheCurrentNamespaces);\n\n\t\/**\n\t * Process an extension-element-prefixes attribute.\n\t *\n\t * @param theConstructionContext The current construction context.\n\t * @param theValue The attribute's value.\n\t * @param theCurrentNamespaces The stack of active namespace declarations.\n\t *\/\n\tvoid\n\tprocessExtensionElementPrefixes(\n\t\t\tStylesheetConstructionContext&\ttheConstructionContext,\n\t\t\tconst XalanDOMChar*\t\t\t\ttheValue,\n\t\t\tconst NamespacesStackType&\t\ttheCurrentNamespaces);\n\n\t\/**\n\t * Notify the instance that the stylesheet is fully constructed.\n\t *\n\t * @param theConstructionContext The current construction context.\n\t * @param fProcessNamespaceAliases If true, process any namespace aliases\n\t * @param theElementName The name of the owning element.\n\t * @param parentNamespacesHandler The parent handler, if any.\n\t * @param prefixChecker A pointer to a PrefixChecker instance to use, if any.\n\t *\/\n\tvoid\n\tpostConstruction(\n\t\t\tStylesheetConstructionContext&\ttheConstructionContext,\n\t\t\tbool\t\t\t\t\t\t\tfProcessNamespaceAliases = true,\n\t\t\tconst XalanDOMString&\t\t\ttheElementName = XalanDOMString(),\n\t\t\tconst NamespacesHandler*\t\tparentNamespacesHandler = 0,\n\t\t\tconst PrefixChecker*\t\t\tprefixChecker = 0);\n\n\tNamespacesHandler&\n\toperator=(const NamespacesHandler&\ttheRHS);\n\n\t\/**\n\t * Determine of a given namespace should be excluded.\n\t *\n\t * @param theXSLTNamespaceURI The namespace URI for XSLT.\n\t * @param theURI The namespace URI.\n\t * @return true of the namespace should be excluded, false if not.\n\t *\/\n\tbool\n\tshouldExcludeResultNamespaceNode(\n\t\t\tconst XalanDOMString&\ttheXSLTNamespaceURI,\n\t\t\tconst XalanDOMString&\ttheURI) const;\n\n\t\/**\n\t * Add a URI as an extension namespace prefixes.\n\t *\n\t * @param theConstructionContext The current construction context.\n\t * @param theURI The namespace URI.\n\t *\/\n\tvoid\n\taddExtensionNamespaceURI(\n\t\t\tStylesheetConstructionContext&\ttheConstructionContext,\n\t\t\tconst XalanDOMString&\ttheURI);\n\n\t\/**\n\t * Get the namespace URI for the given prefix.\n\t *\n\t * @param thePrefix The namespace prefix.\n\t * @return The namespace URI\n\t *\/\n\tconst XalanDOMString*\n\tgetNamespace(const XalanDOMString&\tthePrefix) const;\n\n\t\/**\n\t * Get the namespace alias URI for the given namespace.\n\t *\n\t * @param theStylesheetNamespace The namespace as declared in the stylesheet.\n\t * @return The namespace alias URI\n\t *\/\n\tconst XalanDOMString*\n\tgetNamespaceAlias(const XalanDOMString&\t\ttheStylesheetNamespace) const;\n\n\t\/**\n\t * Set the namespace alias URI for the given namespace.\n\t *\n\t * @param theConstructionContext The current construction context.\n\t * @param theStylesheetNamespace The namespace as declared in the stylesheet.\n\t * @param theResultNamespace The namespace as it should appear in the result tree.\n\t *\/\n\tvoid\n\tsetNamespaceAlias(\n\t\t\tStylesheetConstructionContext&\ttheConstructionContext,\n\t\t\tconst XalanDOMString&\t\t\ttheStylesheetNamespace,\n\t\t\tconst XalanDOMString&\t\t\ttheResultNamespace);\n\n\t\/**\n\t * Copy the aliases from the given NamespacesHandler.\n\t *\n\t * @param parentNamespacesHandler The parent handler.\n\t *\/\n\tvoid\n\tcopyNamespaceAliases(const NamespacesHandler&\tparentNamespacesHandler);\n\n\t\/**\n\t * Output the result tree namespace declarations.\n\t *\n\t * @param theExecutionContext The current execution context.\n\t * @param supressDefault If true, any default namespace declaration will not be output.\n\t *\/\n\tvoid\n\toutputResultNamespaces(\n\t\t\tStylesheetExecutionContext&\t\ttheExecutionContext,\n\t\t\tbool\t\t\t\t\t\t\tsupressDefault = false) const;\n\n\t\/**\n\t * Clear out the handler.\n\t *\/\n\tvoid\n\tclear();\n\n\t\/**\n\t * Swap the contents of this instance with another.\n\t *\n\t * @param theOther The other instance.\n\t *\/\n\tvoid\n\tswap(NamespacesHandler&\t\ttheOther);\n\n\tNamespacesMapType::size_type\n\tgetNamespaceDeclarationsCount() const\n\t{\n\t\treturn m_namespaceDeclarations.size();\n\t}\n\nprivate:\n\n\t\/**\n\t * Create all of the result attribute names.\n\t *\n\t * @param theConstructionContext The current construction context.\n\t *\/\n\tvoid\n\tcreateResultAttributeNames(StylesheetConstructionContext&\ttheConstructionContext);\n\n\t\/**\n\t * Process the exclude result prefix data.\n\t *\n\t * @param theConstructionContext The current construction context.\n\t * @param theElementPrefix The prefix of the owning element.\n\t * @param prefixChecker A pointer to a PrefixChecker instance to use, if any.\n\t *\/\n\tvoid\n\tprocessExcludeResultPrefixes(\n\t\t\tStylesheetConstructionContext&\ttheConstructionContext,\n\t\t\tconst XalanDOMString&\t\t\ttheElementPrefix,\n\t\t\tconst PrefixChecker*\t\t\tprefixChecker);\n\n\t\/**\n\t * Process the namespace aliases data.\n\t *\/\n\tvoid\n\tprocessNamespaceAliases();\n\n\t\/**\n\t * Copy the contents of the supplied map\n\t *\n\t * @param theNamespaceAliases The map to copy.\n\t *\/\n\tvoid\n\tcopyNamespaceAliases(const NamespaceAliasesMapType&\t\ttheNamespaceAliases);\n\n\t\/**\n\t * Copy the contents of the supplied vector\n\t *\n\t * @param theExtensionNamespaceURIs The set to copy.\n\t *\/\n\tvoid\n\tcopyExtensionNamespaceURIs(const XalanDOMStringPointerVectorType&\ttheExtensionNamespaceURIs);\n\n\t\/**\n\t * Copy the contents of the supplied vector\n\t *\n\t * @param theExcludeResultPrefixes The vector to copy.\n\t *\/\n\tvoid\n\tcopyExcludeResultPrefixes(const NamespacesVectorType&\ttheExcludeResultPrefixes);\n\n\t\/**\n\t * Determine if a given namespace should be excluded as a result of\n\t * an exclude-result-prefixes declaration.\n\t *\n\t * @param theNamespaceURI The namespace URI to check.\n\t * @return true if the namespace should be excluded, false if not.\n\t *\/\n\tbool\n\tisExcludedNamespaceURI(const XalanDOMString&\ttheNamespaceURI) const;\n\n\t\/**\n\t * Determine if a given URI is an extension namespace URI\n\t *\n\t * @param theNamespaceURI The namespace URI to check.\n\t * @return true if the namespace uri is an extension namespace URI, false if not.\n\t *\/\n\tbool\n\tisExtensionNamespaceURI(const XalanDOMString&\ttheNamespaceURI) const\n\t{\n\t\treturn findString(theNamespaceURI, m_extensionNamespaceURIs);\n\t}\n\n\t\/**\n\t * Determine if a given string is present in the vector\n\t *\n\t * @param theString The string to find.\n\t * @return true if the string is present, false if not.\n\t *\/\n\tstatic bool\n\tfindString(\n\t\t\tconst XalanDOMString&\t\t\t\t\ttheString,\n\t\t\tconst XalanDOMStringPointerVectorType&\ttheVector);\n\n\n\t\/\/ Not implemented...\n\tbool\n\toperator==(const NamespacesHandler&) const;\n\n\n\t\/\/ Data members...\n\tNamespacesVectorType\t\t\t\tm_excludedResultPrefixes;\n\n\tNamespaceExtendedVectorType\t\t\tm_namespaceDeclarations;\n\n\tXalanDOMStringPointerVectorType\t\tm_extensionNamespaceURIs;\n\n\tNamespaceAliasesMapType\t\t\t\tm_namespaceAliases;\n};\n\n\n\nXALAN_CPP_NAMESPACE_END\n\n\n\n#endif\t\/\/ XALAN_NAMESPACESHANDLER_HEADER_GUARD\n<|endoftext|>"} {"text":"<commit_before>#include <algorithm>\n#include <cmath>\n#include <fstream>\n#include <iomanip>\n#include <iostream>\n#include <map>\n#include <sstream>\n#include <string>\n#include <vector>\n\n#include <popt.h>\n\n#include \"defs.hh\"\n#include \"StringSet.hh\"\n#include \"FactorEncoder.hh\"\n#include \"Unigrams.hh\"\n#include \"Bigrams.hh\"\n\nusing namespace std;\n\n\nvoid\nassert_single_chars(map<string, flt_type> &vocab,\n const map<string, flt_type> &chars,\n flt_type val)\n{\n for (auto it = chars.cbegin(); it != chars.cend(); ++it)\n if (vocab.find(it->first) == vocab.end())\n vocab[it->first] = val;\n}\n\n\nint main(int argc, char* argv[]) {\n\n int iter_amount = 10;\n int least_common = 0;\n int target_vocab_size = 30000;\n float cutoff_value = 0.0;\n flt_type one_char_min_lp = -25.0;\n string vocab_fname;\n string wordlist_fname;\n string msfg_fname;\n string transition_fname;\n\n \/\/ Popt documentation:\n \/\/ http:\/\/linux.die.net\/man\/3\/popt\n \/\/ http:\/\/privatemisc.blogspot.fi\/2012\/12\/popt-basic-example.html\n poptContext pc;\n struct poptOption po[] = {\n {\"iter\", 'i', POPT_ARG_INT, &iter_amount, 11001, NULL, \"How many iterations\"},\n {\"least-common\", 'l', POPT_ARG_INT, &least_common, 11001, NULL, \"Remove least common strings\"},\n {\"vocab_size\", 'g', POPT_ARG_INT, &target_vocab_size, 11007, NULL, \"Target vocabulary size (stopping criterion)\"},\n {\"cutoff\", 'u', POPT_ARG_FLOAT, &cutoff_value, 11001, NULL, \"Cutoff value for each iteration\"},\n POPT_AUTOHELP\n {NULL}\n };\n\n pc = poptGetContext(NULL, argc, (const char **)argv, po, 0);\n poptSetOtherOptionHelp(pc, \"[INITIAL VOCABULARY] [WORDLIST] [MSFG_IN] [TRANSITIONS]\");\n\n int val;\n while ((val = poptGetNextOpt(pc)) >= 0)\n continue;\n\n \/\/ poptGetNextOpt returns -1 when the final argument has been parsed\n \/\/ otherwise an error occured\n if (val != -1) {\n switch (val) {\n case POPT_ERROR_NOARG:\n cerr << \"Argument missing for an option\" << endl;\n exit(1);\n case POPT_ERROR_BADOPT:\n cerr << \"Option's argument could not be parsed\" << endl;\n exit(1);\n case POPT_ERROR_BADNUMBER:\n case POPT_ERROR_OVERFLOW:\n cerr << \"Option could not be converted to number\" << endl;\n exit(1);\n default:\n cerr << \"Unknown error in option processing\" << endl;\n exit(1);\n }\n }\n\n \/\/ Handle ARG part of command line\n if (poptPeekArg(pc) != NULL)\n vocab_fname.assign((char*)poptGetArg(pc));\n else {\n cerr << \"Initial vocabulary file not set\" << endl;\n exit(1);\n }\n\n if (poptPeekArg(pc) != NULL)\n wordlist_fname.assign((char*)poptGetArg(pc));\n else {\n cerr << \"Wordlist file not set\" << endl;\n exit(1);\n }\n\n if (poptPeekArg(pc) != NULL)\n msfg_fname.assign((char*)poptGetArg(pc));\n else {\n cerr << \"Input MSFG file not set\" << endl;\n exit(1);\n }\n\n if (poptPeekArg(pc) != NULL)\n transition_fname.assign((char*)poptGetArg(pc));\n else {\n cerr << \"Transition file not set\" << endl;\n exit(1);\n }\n\n cerr << \"parameters, initial vocabulary: \" << vocab_fname << endl;\n cerr << \"parameters, wordlist: \" << wordlist_fname << endl;\n cerr << \"parameters, msfg: \" << msfg_fname << endl;\n cerr << \"parameters, transitions: \" << transition_fname << endl;\n cerr << \"parameters, cutoff: \" << setprecision(15) << cutoff_value << endl;\n cerr << \"parameters, iterations: \" << iter_amount << endl;\n cerr << \"parameters, target vocab size: \" << target_vocab_size << endl;\n cerr << \"parameters, least common subwords to remove: \" << least_common << endl;\n\n int maxlen, word_maxlen;\n map<string, flt_type> all_chars;\n map<string, flt_type> vocab;\n map<string, flt_type> freqs;\n map<string, flt_type> words;\n\n cerr << \"Reading vocabulary \" << vocab_fname << endl;\n int retval = Unigrams::read_vocab(vocab_fname, vocab, maxlen);\n if (retval < 0) {\n cerr << \"something went wrong reading vocabulary\" << endl;\n exit(0);\n }\n cerr << \"\\t\" << \"size: \" << vocab.size() << endl;\n cerr << \"\\t\" << \"maximum string length: \" << maxlen << endl;\n for (auto it = vocab.cbegin(); it != vocab.end(); ++it)\n if (it->first.length() == 1)\n all_chars[it->first] = 0.0;\n\n cerr << \"Reading word list \" << wordlist_fname << endl;\n retval = Unigrams::read_vocab(wordlist_fname, words, word_maxlen);\n if (retval < 0) {\n cerr << \"something went wrong reading word list\" << endl;\n exit(0);\n }\n cerr << \"\\t\" << \"wordlist size: \" << words.size() << endl;\n cerr << \"\\t\" << \"maximum word length: \" << word_maxlen << endl;\n\n Unigrams ug;\n ug.set_segmentation_method(forward_backward);\n\n cerr << \"Initial cutoff\" << endl;\n ug.resegment_words(words, vocab, freqs);\n flt_type densum = ug.get_sum(freqs);\n flt_type cost = ug.get_cost(freqs, densum);\n cerr << \"unigram cost without word end symbols: \" << cost << endl;\n\n ug.cutoff(freqs, (flt_type)cutoff_value);\n cerr << \"\\tcutoff: \" << cutoff_value << \"\\t\" << \"vocabulary size: \" << freqs.size() << endl;\n vocab = freqs;\n densum = ug.get_sum(vocab);\n ug.freqs_to_logprobs(vocab, densum);\n assert_single_chars(vocab, all_chars, one_char_min_lp);\n\n string start_end_symbol(\"*\");\n StringSet ss_vocab(vocab);\n map<string, FactorGraph*> fg_words;\n MultiStringFactorGraph msfg(start_end_symbol);\n msfg.read(msfg_fname);\n transitions_t transitions;\n transitions_t trans_stats;\n map<string, flt_type> unigram_stats;\n vocab[start_end_symbol] = 0.0;\n flt_type lp = 0.0;\n\n \/\/ Initial segmentation using unigram model\n assign_scores(vocab, msfg);\n lp = Bigrams::collect_trans_stats(words, msfg, trans_stats, unigram_stats);\n\n \/\/ Unigram cost with word end markers\n densum = ug.get_sum(unigram_stats);\n cost = ug.get_cost(unigram_stats, densum);\n cerr << \"unigram cost with word end symbols: \" << cost << endl;\n\n \/\/ Initial bigram cost\n transitions = trans_stats;\n Bigrams::normalize(transitions);\n cerr << \"bigram cost: \" << lp << endl;\n cerr << \"\\tamount of transitions: \" << Bigrams::transition_count(transitions) << endl;\n cerr << \"\\tvocab size: \" << unigram_stats.size() << endl;\n int co_removed = Bigrams::cutoff(unigram_stats, cutoff_value, transitions, msfg);\n cerr << \"\\tremoved by cutoff: \" << co_removed << endl;\n\n assign_scores(transitions, msfg);\n\n \/\/ Re-estimate using bigram stats\n for (int i=0; i<iter_amount; i++) {\n\n flt_type lp = Bigrams::collect_trans_stats(words, msfg, trans_stats, unigram_stats);\n int vocab_size = unigram_stats.size();\n cerr << \"bigram cost: \" << lp << endl;\n cerr << \"\\tamount of transitions: \" << Bigrams::transition_count(transitions) << endl;\n cerr << \"\\tvocab size: \" << vocab_size << endl;\n\n Bigrams::copy_transitions(trans_stats, transitions);\n if (least_common > 0) {\n int curr_least_common = least_common + ((vocab_size-least_common) % 1000);\n int lc_removed = Bigrams::remove_least_common(unigram_stats, curr_least_common, transitions, msfg);\n cerr << \"\\tremoved \" << lc_removed << \" least common subwords\" << endl;\n }\n Bigrams::normalize(transitions);\n vocab_size = unigram_stats.size();\n\n \/\/ Write temp transitions\n ostringstream transitions_temp;\n transitions_temp << \"transitions.iter\" << i+1 << \".bz2\";\n cerr << \"\\twriting to: \" << transitions_temp.str() << endl;\n Bigrams::write_transitions(transitions, transitions_temp.str());\n\n if (vocab_size < target_vocab_size) break;\n }\n\n \/\/ Write transitions\n Bigrams::write_transitions(transitions, transition_fname);\n\n exit(1);\n}\n<commit_msg>First real version of g2g.<commit_after>#include <algorithm>\n#include <cmath>\n#include <fstream>\n#include <iomanip>\n#include <iostream>\n#include <map>\n#include <sstream>\n#include <string>\n#include <vector>\n\n#include <popt.h>\n\n#include \"defs.hh\"\n#include \"StringSet.hh\"\n#include \"FactorEncoder.hh\"\n#include \"Unigrams.hh\"\n#include \"Bigrams.hh\"\n\nusing namespace std;\n\n\nvoid\nassert_single_chars(map<string, flt_type> &vocab,\n const map<string, flt_type> &chars,\n flt_type val)\n{\n for (auto it = chars.cbegin(); it != chars.cend(); ++it)\n if (vocab.find(it->first) == vocab.end())\n vocab[it->first] = val;\n}\n\n\nint main(int argc, char* argv[]) {\n\n float cutoff_value = 0.0;\n int n_candidates_per_iter = 5000;\n int max_removals_per_iter = 5000;\n int target_vocab_size = 30000;\n flt_type one_char_min_lp = -25.0;\n string vocab_fname;\n string wordlist_fname;\n string msfg_fname;\n string transition_fname;\n\n \/\/ Popt documentation:\n \/\/ http:\/\/linux.die.net\/man\/3\/popt\n \/\/ http:\/\/privatemisc.blogspot.fi\/2012\/12\/popt-basic-example.html\n poptContext pc;\n struct poptOption po[] = {\n {\"candidates\", 'c', POPT_ARG_INT, &n_candidates_per_iter, 11002, NULL, \"Number of candidate subwords to try to remove per iteration\"},\n {\"max_removals\", 'a', POPT_ARG_INT, &max_removals_per_iter, 11003, NULL, \"Maximum number of removals per iteration\"},\n {\"cutoff\", 'u', POPT_ARG_FLOAT, &cutoff_value, 11001, NULL, \"Cutoff value for each iteration\"},\n {\"vocab_size\", 'g', POPT_ARG_INT, &target_vocab_size, 11007, NULL, \"Target vocabulary size (stopping criterion)\"},\n POPT_AUTOHELP\n {NULL}\n };\n\n pc = poptGetContext(NULL, argc, (const char **)argv, po, 0);\n poptSetOtherOptionHelp(pc, \"[INITIAL VOCABULARY] [WORDLIST] [MSFG_IN] [TRANSITIONS]\");\n\n int val;\n while ((val = poptGetNextOpt(pc)) >= 0)\n continue;\n\n \/\/ poptGetNextOpt returns -1 when the final argument has been parsed\n \/\/ otherwise an error occured\n if (val != -1) {\n switch (val) {\n case POPT_ERROR_NOARG:\n cerr << \"Argument missing for an option\" << endl;\n exit(1);\n case POPT_ERROR_BADOPT:\n cerr << \"Option's argument could not be parsed\" << endl;\n exit(1);\n case POPT_ERROR_BADNUMBER:\n case POPT_ERROR_OVERFLOW:\n cerr << \"Option could not be converted to number\" << endl;\n exit(1);\n default:\n cerr << \"Unknown error in option processing\" << endl;\n exit(1);\n }\n }\n\n \/\/ Handle ARG part of command line\n if (poptPeekArg(pc) != NULL)\n vocab_fname.assign((char*)poptGetArg(pc));\n else {\n cerr << \"Initial vocabulary file not set\" << endl;\n exit(1);\n }\n\n if (poptPeekArg(pc) != NULL)\n wordlist_fname.assign((char*)poptGetArg(pc));\n else {\n cerr << \"Wordlist file not set\" << endl;\n exit(1);\n }\n\n if (poptPeekArg(pc) != NULL)\n msfg_fname.assign((char*)poptGetArg(pc));\n else {\n cerr << \"Input MSFG file not set\" << endl;\n exit(1);\n }\n\n if (poptPeekArg(pc) != NULL)\n transition_fname.assign((char*)poptGetArg(pc));\n else {\n cerr << \"Transition file not set\" << endl;\n exit(1);\n }\n\n cerr << \"parameters, initial vocabulary: \" << vocab_fname << endl;\n cerr << \"parameters, wordlist: \" << wordlist_fname << endl;\n cerr << \"parameters, msfg: \" << msfg_fname << endl;\n cerr << \"parameters, transitions: \" << transition_fname << endl;\n cerr << \"parameters, candidates per iteration: \" << n_candidates_per_iter << endl;\n cerr << \"parameters, removals per iteration: \" << max_removals_per_iter << endl;\n cerr << \"parameters, cutoff: \" << setprecision(15) << cutoff_value << endl;\n cerr << \"parameters, target vocab size: \" << target_vocab_size << endl;\n\n int maxlen, word_maxlen;\n map<string, flt_type> all_chars;\n map<string, flt_type> vocab;\n map<string, flt_type> freqs;\n map<string, flt_type> words;\n\n cerr << \"Reading vocabulary \" << vocab_fname << endl;\n int retval = Unigrams::read_vocab(vocab_fname, vocab, maxlen);\n if (retval < 0) {\n cerr << \"something went wrong reading vocabulary\" << endl;\n exit(0);\n }\n cerr << \"\\t\" << \"size: \" << vocab.size() << endl;\n cerr << \"\\t\" << \"maximum string length: \" << maxlen << endl;\n for (auto it = vocab.cbegin(); it != vocab.end(); ++it)\n if (it->first.length() == 1)\n all_chars[it->first] = 0.0;\n\n cerr << \"Reading word list \" << wordlist_fname << endl;\n retval = Unigrams::read_vocab(wordlist_fname, words, word_maxlen);\n if (retval < 0) {\n cerr << \"something went wrong reading word list\" << endl;\n exit(0);\n }\n cerr << \"\\t\" << \"wordlist size: \" << words.size() << endl;\n cerr << \"\\t\" << \"maximum word length: \" << word_maxlen << endl;\n\n Unigrams ug;\n ug.set_segmentation_method(forward_backward);\n\n cerr << \"Initial cutoff\" << endl;\n ug.resegment_words(words, vocab, freqs);\n flt_type densum = ug.get_sum(freqs);\n flt_type cost = ug.get_cost(freqs, densum);\n cerr << \"unigram cost without word end symbols: \" << cost << endl;\n\n ug.cutoff(freqs, (flt_type)cutoff_value);\n cerr << \"\\tcutoff: \" << cutoff_value << \"\\t\" << \"vocabulary size: \" << freqs.size() << endl;\n vocab = freqs;\n densum = ug.get_sum(vocab);\n ug.freqs_to_logprobs(vocab, densum);\n assert_single_chars(vocab, all_chars, one_char_min_lp);\n\n string start_end_symbol(\"*\");\n StringSet ss_vocab(vocab);\n map<string, FactorGraph*> fg_words;\n MultiStringFactorGraph msfg(start_end_symbol);\n msfg.read(msfg_fname);\n transitions_t transitions;\n transitions_t trans_stats;\n map<string, flt_type> unigram_stats;\n vocab[start_end_symbol] = 0.0;\n flt_type lp = 0.0;\n\n \/\/ Initial segmentation using unigram model\n assign_scores(vocab, msfg);\n lp = Bigrams::collect_trans_stats(words, msfg, trans_stats, unigram_stats);\n\n \/\/ Unigram cost with word end markers\n densum = ug.get_sum(unigram_stats);\n cost = ug.get_cost(unigram_stats, densum);\n cerr << \"unigram cost with word end symbols: \" << cost << endl;\n\n \/\/ Initial bigram cost\n transitions = trans_stats;\n Bigrams::normalize(transitions);\n cerr << \"bigram cost: \" << lp << endl;\n cerr << \"\\tamount of transitions: \" << Bigrams::transition_count(transitions) << endl;\n cerr << \"\\tvocab size: \" << unigram_stats.size() << endl;\n int co_removed = Bigrams::cutoff(unigram_stats, cutoff_value, transitions, msfg);\n cerr << \"\\tremoved by cutoff: \" << co_removed << endl;\n\n assign_scores(transitions, msfg);\n\n \/\/ Re-estimate using bigram stats\n int iteration = 1;\n while (true) {\n\n cerr << \"Iteration \" << iteration << endl;\n\n flt_type lp = Bigrams::collect_trans_stats(words, msfg, trans_stats, unigram_stats);\n Bigrams::copy_transitions(trans_stats, transitions);\n Bigrams::normalize(transitions);\n\n cerr << \"\\tbigram cost: \" << lp << endl;\n cerr << \"\\tamount of transitions: \" << Bigrams::transition_count(transitions) << endl;\n cerr << \"\\tvocab size: \" << unigram_stats.size() << endl;\n\n \/\/ Get removal candidates based on unigram stats\n cerr << \"\\titializing removals ..\" << endl;\n vector<pair<string, flt_type> > sorted_stats;\n Unigrams::sort_vocab(unigram_stats, sorted_stats, false);\n map<string, flt_type> candidates;\n for (auto it = sorted_stats.begin(); it != sorted_stats.end(); ++it) {\n if (it->first.length() < 2) continue;\n candidates[it->first] = 0.0;\n if (candidates.size() >= n_candidates_per_iter) break;\n }\n\n \/\/ Score all candidates\n cerr << \"\\tranking removals ..\" << endl;\n map<string, set<string> > backpointers;\n Bigrams::get_backpointers(msfg, backpointers, 1);\n transitions_t reverse;\n Bigrams::reverse_transitions(transitions, reverse);\n int cidx = 0;\n for (auto it = candidates.begin(); it != candidates.end(); ++it) {\n transitions_t changes;\n set<string> words_to_resegment = backpointers.at(it->first);\n flt_type orig_score = likelihood(words, words_to_resegment, msfg);\n flt_type context_score = Bigrams::remove_string(reverse, it->first,\n unigram_stats, transitions, changes);\n flt_type hypo_score = likelihood(words, words_to_resegment, msfg);\n it->second = hypo_score-orig_score + context_score;\n Bigrams::restore_string(transitions, changes);\n if (cidx % 1000 == 0) cout << \"\\tcandidate \" << cidx << endl;\n cidx++;\n }\n\n \/\/ Remove least significant subwords\n vector<pair<string, flt_type> > sorted_scores;\n Unigrams::sort_vocab(candidates, sorted_scores, true);\n vector<string> to_remove;\n for (auto it = sorted_scores.begin(); it != sorted_scores.end(); ++it) {\n to_remove.push_back(it->first);\n if (to_remove.size() >= max_removals_per_iter) break;\n }\n Bigrams::remove_transitions(to_remove, transitions);\n for (int i=0; i<to_remove.size(); i++)\n msfg.remove_arcs(to_remove[i]);\n\n \/\/ Write temp transitions\n ostringstream transitions_temp;\n transitions_temp << \"transitions.iter\" << iteration << \".bz2\";\n cerr << \"\\twriting to: \" << transitions_temp.str() << endl;\n Bigrams::write_transitions(transitions, transitions_temp.str());\n\n if (unigram_stats.size() <= target_vocab_size) break;\n iteration++;\n }\n\n \/\/ Write transitions\n Bigrams::write_transitions(transitions, transition_fname);\n\n exit(1);\n}\n<|endoftext|>"} {"text":"<commit_before>#include <QAction>\n#include <QApplication>\n#include <QBoxLayout>\n#include <QTime>\n#include <QTimer>\n\n#include \"base.h\"\n#include \"dialog.h\"\n#include \"dlog.h\"\n#include \"menu.h\"\n#include \"note.h\"\n#include \"proj.h\"\n#include \"term.h\"\n#include \"tedit.h\"\n#include \"svr.h\"\n#include \"state.h\"\n#include \"recent.h\"\n\nusing namespace std;\n\nTerm *term;\nTedit *tedit;\nint idewin=0; \/\/ 0: term 1: note 2: note2\n\nQString LastLaunch;\nQTime LastLaunchTime;\nQTimer *timer=0;\n\nextern \"C\" void smact();\n\n\/\/ ---------------------------------------------------------------------\nOneWin::OneWin()\n{\n note = new Note();\n split=new QSplitter(Qt::Vertical);\n split->addWidget(makeframe((QWidget *)note));\n split->addWidget(makeframe((QWidget *)term));\n QList<int> n;\n n << 0 << 1;\n \/\/split->setSizes(n);\n QVBoxLayout *layout=new QVBoxLayout();\n layout->setContentsMargins(0,0,0,0);\n layout->addWidget(split);\n setLayout(layout);\n term->setFocus();\n show();\n}\n\n\/\/ ---------------------------------------------------------------------\nvoid OneWin::closeEvent(QCloseEvent *event)\n{\n term->filequit();\n event->ignore();\n}\n\n\/\/ ---------------------------------------------------------------------\nQFrame *OneWin::makeframe(QWidget *w)\n{\n QFrame *f=new QFrame();\n \/\/f->setFrameStyle(QFrame::Panel | QFrame::Raised);\n f->setFrameStyle(QFrame::StyledPanel);\n QVBoxLayout *b=new QVBoxLayout();\n b->setContentsMargins(0,0,0,0);\n b->addWidget(w);\n f->setLayout(b);\n return f;\n}\n\n\/\/ ---------------------------------------------------------------------\nTerm::Term()\n{\n QVBoxLayout *layout=new QVBoxLayout;\n layout->setContentsMargins(layout->contentsMargins());\n layout->setSpacing(0);\n menuBar = new Menu();\n tedit = new Tedit;\n layout->addWidget(menuBar);\n layout->addWidget(tedit);\n setWindowTitle(\"Term\");\n menuBar->createActions();\n menuBar->createMenus(\"term\");\n setLayout(layout);\n timer=new QTimer;\n connect(timer, SIGNAL(timeout()),this,SLOT(systimer()));\n QMetaObject::connectSlotsByName(this);\n}\n\n\/\/ ---------------------------------------------------------------------\nvoid Term::activate()\n{\n activateWindow();\n raise();\n tedit->setFocus();\n}\n\n\/\/ ---------------------------------------------------------------------\nvoid Term::closeEvent(QCloseEvent *event)\n{\n filequit();\n event->ignore();\n}\n\n\/\/ ---------------------------------------------------------------------\nbool Term::filequit()\n{\n dlog_write();\n#ifdef Q_OS_ANDROID\n state_quit();\n QApplication::quit();\n return true;\n#else\n if (note && (!note->saveall())) return false;\n if (note2 && (!note2->saveall())) return false;\n if ((!config.ConfirmClose) ||\n queryOK(\"Term\",\"OK to exit \" + config.Lang + \"?\")) {\n state_quit();\n QApplication::quit();\n return true;\n } else\n return false;\n#endif\n}\n\n\/\/ ---------------------------------------------------------------------\n\/\/ this run after configs read...\nvoid Term::fini()\n{\n menuBar->createMenus_fini(\"term\");\n move(config.TermPos[0],config.TermPos[1]);\n resize(config.TermPos[2],config.TermPos[3]);\n tedit->setFont(config.Font);\n QPalette p = palette();\n p.setColor(QPalette::Active, QPalette::Base, config.TermBack.color);\n p.setColor(QPalette::Inactive, QPalette::Base, config.TermBack.color);\n p.setColor(QPalette::Text, config.TermFore.color);\n tedit->setPalette(p);\n QString s=config.BinPath.filePath(\"icons\/jgreen.png\");\n setWindowIcon(QIcon(s));\n if (config.TermSyntaxHighlight)\n highlight(tedit->document());\n tedit->setprompt();\n if (config.SingleWin)\n new OneWin();\n else if (ShowIde)\n show();\n}\n\n\/\/ ---------------------------------------------------------------------\nvoid Term::keyPressEvent(QKeyEvent *event)\n{\n switch (event->key()) {\n#ifdef JQT\n#ifdef Q_OS_ANDROID\n case 16777220:\n event->accept();\n filequit();\n break;\n#endif\n case Qt::Key_Escape:\n if (config.EscClose) {\n if (!filequit())\n event->accept();\n }\n break;\n#endif\n default:\n QWidget::keyPressEvent(event);\n }\n}\n\n\/\/ ---------------------------------------------------------------------\n\/\/ bug in Qt - this gets called twice, so need to check time...\nvoid Term::launchpad_triggered(QAction *a)\n{\n QString s=a->objectName();\n\n s=s.mid(config.LaunchPadPrefix.size());\n QTime t=QTime::currentTime();\n if (LastLaunch==s && LastLaunchTime.secsTo(t)<2) return;\n LastLaunch=s;\n LastLaunchTime=t;\n int i=config.LaunchPadKeys.indexOf(s);\n\n if (i<0) return;\n tedit->loadscript(config.LaunchPadValues.at(i),false);\n}\n\n\/\/ ---------------------------------------------------------------------\nvoid Term::load(QString s, bool d)\n{\n tedit->docmdx(var_load(s,d));\n}\n\n\/\/ ---------------------------------------------------------------------\nvoid Term::pacman()\n{\n var_cmd(\"require 'pacman ~addons\/ide\/qt\/pacman.ijs'\");\n var_cmd(\"runpacman_jpacman_ 0\");\n}\n\n\/\/ ---------------------------------------------------------------------\nvoid Term::projectenable()\n{\n bool b=project.Id.size()>0;\n menuBar->runprojectAct->setEnabled(b);\n menuBar->projectcloseAct->setEnabled(b);\n}\n\n\/\/ ---------------------------------------------------------------------\nvoid Term::resizeEvent(QResizeEvent *event)\n{\n tedit->setresized(0);\n QWidget::resizeEvent(event);\n}\n\n\/\/ ---------------------------------------------------------------------\nvoid Term::systimer()\n{\n var_cmd(\"(i.0 0)\\\"_ sys_timer_z_$0\");\n}\n\n\/\/ ---------------------------------------------------------------------\nvoid Term::vieweditor()\n{\n if (note) {\n note->activate();\n#ifdef Q_OS_ANDROID\n term->setVisible(false);\n note->activateWindow();\n note->raise();\n note->repaint();\n#endif\n } else {\n note = new Note();\n if (recent.ProjectOpen)\n note->projectopen(true);\n note->show();\n#ifdef Q_OS_ANDROID\n term->setVisible(false);\n note->activateWindow();\n note->raise();\n note->repaint();\n#endif\n }\n idewin=1;\n}\n\n\/\/ ---------------------------------------------------------------------\nvoid smact()\n{\n if (!term->isVisible()) return;\n term->activateWindow();\n term->raise();\n term->repaint();\n idewin=0;\n}\n<commit_msg>fix for msvc<commit_after>#include <QAction>\n#include <QApplication>\n#include <QBoxLayout>\n#include <QTime>\n#include <QTimer>\n\n#include \"base.h\"\n#include \"dialog.h\"\n#include \"dlog.h\"\n#include \"menu.h\"\n#include \"note.h\"\n#include \"proj.h\"\n#include \"term.h\"\n#include \"tedit.h\"\n#include \"svr.h\"\n#include \"state.h\"\n#include \"recent.h\"\n\nusing namespace std;\n\nTerm *term;\nTedit *tedit;\nint idewin=0; \/\/ 0: term 1: note 2: note2\n\nQString LastLaunch;\nQTime LastLaunchTime;\nQTimer *timer=0;\n\nextern \"C\" Dllexport void smact();\n\n\/\/ ---------------------------------------------------------------------\nOneWin::OneWin()\n{\n note = new Note();\n split=new QSplitter(Qt::Vertical);\n split->addWidget(makeframe((QWidget *)note));\n split->addWidget(makeframe((QWidget *)term));\n QList<int> n;\n n << 0 << 1;\n \/\/split->setSizes(n);\n QVBoxLayout *layout=new QVBoxLayout();\n layout->setContentsMargins(0,0,0,0);\n layout->addWidget(split);\n setLayout(layout);\n term->setFocus();\n show();\n}\n\n\/\/ ---------------------------------------------------------------------\nvoid OneWin::closeEvent(QCloseEvent *event)\n{\n term->filequit();\n event->ignore();\n}\n\n\/\/ ---------------------------------------------------------------------\nQFrame *OneWin::makeframe(QWidget *w)\n{\n QFrame *f=new QFrame();\n \/\/f->setFrameStyle(QFrame::Panel | QFrame::Raised);\n f->setFrameStyle(QFrame::StyledPanel);\n QVBoxLayout *b=new QVBoxLayout();\n b->setContentsMargins(0,0,0,0);\n b->addWidget(w);\n f->setLayout(b);\n return f;\n}\n\n\/\/ ---------------------------------------------------------------------\nTerm::Term()\n{\n QVBoxLayout *layout=new QVBoxLayout;\n layout->setContentsMargins(layout->contentsMargins());\n layout->setSpacing(0);\n menuBar = new Menu();\n tedit = new Tedit;\n layout->addWidget(menuBar);\n layout->addWidget(tedit);\n setWindowTitle(\"Term\");\n menuBar->createActions();\n menuBar->createMenus(\"term\");\n setLayout(layout);\n timer=new QTimer;\n connect(timer, SIGNAL(timeout()),this,SLOT(systimer()));\n QMetaObject::connectSlotsByName(this);\n}\n\n\/\/ ---------------------------------------------------------------------\nvoid Term::activate()\n{\n activateWindow();\n raise();\n tedit->setFocus();\n}\n\n\/\/ ---------------------------------------------------------------------\nvoid Term::closeEvent(QCloseEvent *event)\n{\n filequit();\n event->ignore();\n}\n\n\/\/ ---------------------------------------------------------------------\nbool Term::filequit()\n{\n dlog_write();\n#ifdef Q_OS_ANDROID\n state_quit();\n QApplication::quit();\n return true;\n#else\n if (note && (!note->saveall())) return false;\n if (note2 && (!note2->saveall())) return false;\n if ((!config.ConfirmClose) ||\n queryOK(\"Term\",\"OK to exit \" + config.Lang + \"?\")) {\n state_quit();\n QApplication::quit();\n return true;\n } else\n return false;\n#endif\n}\n\n\/\/ ---------------------------------------------------------------------\n\/\/ this run after configs read...\nvoid Term::fini()\n{\n menuBar->createMenus_fini(\"term\");\n move(config.TermPos[0],config.TermPos[1]);\n resize(config.TermPos[2],config.TermPos[3]);\n tedit->setFont(config.Font);\n QPalette p = palette();\n p.setColor(QPalette::Active, QPalette::Base, config.TermBack.color);\n p.setColor(QPalette::Inactive, QPalette::Base, config.TermBack.color);\n p.setColor(QPalette::Text, config.TermFore.color);\n tedit->setPalette(p);\n QString s=config.BinPath.filePath(\"icons\/jgreen.png\");\n setWindowIcon(QIcon(s));\n if (config.TermSyntaxHighlight)\n highlight(tedit->document());\n tedit->setprompt();\n if (config.SingleWin)\n new OneWin();\n else if (ShowIde)\n show();\n}\n\n\/\/ ---------------------------------------------------------------------\nvoid Term::keyPressEvent(QKeyEvent *event)\n{\n switch (event->key()) {\n#ifdef JQT\n#ifdef Q_OS_ANDROID\n case 16777220:\n event->accept();\n filequit();\n break;\n#endif\n case Qt::Key_Escape:\n if (config.EscClose) {\n if (!filequit())\n event->accept();\n }\n break;\n#endif\n default:\n QWidget::keyPressEvent(event);\n }\n}\n\n\/\/ ---------------------------------------------------------------------\n\/\/ bug in Qt - this gets called twice, so need to check time...\nvoid Term::launchpad_triggered(QAction *a)\n{\n QString s=a->objectName();\n\n s=s.mid(config.LaunchPadPrefix.size());\n QTime t=QTime::currentTime();\n if (LastLaunch==s && LastLaunchTime.secsTo(t)<2) return;\n LastLaunch=s;\n LastLaunchTime=t;\n int i=config.LaunchPadKeys.indexOf(s);\n\n if (i<0) return;\n tedit->loadscript(config.LaunchPadValues.at(i),false);\n}\n\n\/\/ ---------------------------------------------------------------------\nvoid Term::load(QString s, bool d)\n{\n tedit->docmdx(var_load(s,d));\n}\n\n\/\/ ---------------------------------------------------------------------\nvoid Term::pacman()\n{\n var_cmd(\"require 'pacman ~addons\/ide\/qt\/pacman.ijs'\");\n var_cmd(\"runpacman_jpacman_ 0\");\n}\n\n\/\/ ---------------------------------------------------------------------\nvoid Term::projectenable()\n{\n bool b=project.Id.size()>0;\n menuBar->runprojectAct->setEnabled(b);\n menuBar->projectcloseAct->setEnabled(b);\n}\n\n\/\/ ---------------------------------------------------------------------\nvoid Term::resizeEvent(QResizeEvent *event)\n{\n tedit->setresized(0);\n QWidget::resizeEvent(event);\n}\n\n\/\/ ---------------------------------------------------------------------\nvoid Term::systimer()\n{\n var_cmd(\"(i.0 0)\\\"_ sys_timer_z_$0\");\n}\n\n\/\/ ---------------------------------------------------------------------\nvoid Term::vieweditor()\n{\n if (note) {\n note->activate();\n#ifdef Q_OS_ANDROID\n term->setVisible(false);\n note->activateWindow();\n note->raise();\n note->repaint();\n#endif\n } else {\n note = new Note();\n if (recent.ProjectOpen)\n note->projectopen(true);\n note->show();\n#ifdef Q_OS_ANDROID\n term->setVisible(false);\n note->activateWindow();\n note->raise();\n note->repaint();\n#endif\n }\n idewin=1;\n}\n\n\/\/ ---------------------------------------------------------------------\nvoid smact()\n{\n if (!term->isVisible()) return;\n term->activateWindow();\n term->raise();\n term->repaint();\n idewin=0;\n}\n<|endoftext|>"} {"text":"<commit_before>\n#include \"antsUtilities.h\"\n#include <algorithm>\n\n#include <stdio.h>\n\n#include \"itkImage.h\"\n#include \"itkImageFileReader.h\"\n#include \"itkImageFileWriter.h\"\n\n#include \"itkResampleImageFilter.h\"\n\n#include \"itkConstantBoundaryCondition.h\"\n#include \"itkIdentityTransform.h\"\n#include \"itkBSplineInterpolateImageFunction.h\"\n#include \"itkLinearInterpolateImageFunction.h\"\n#include \"itkGaussianInterpolateImageFunction.h\"\n#include \"itkNearestNeighborInterpolateImageFunction.h\"\n#include \"itkWindowedSincInterpolateImageFunction.h\"\n\n#include <string>\n#include <vector>\n\nnamespace ants\n{\n\ntemplate <unsigned int ImageDimension>\nint ResampleImage( int argc, char *argv[] )\n{\n typedef double RealType;\n typedef double PixelType;\n typedef itk::Image<PixelType, ImageDimension> ImageType;\n\n typedef itk::ImageFileReader<ImageType> ReaderType;\n typename ReaderType::Pointer reader = ReaderType::New();\n reader->SetFileName( argv[2] );\n reader->Update();\n\n typedef itk::IdentityTransform<RealType, ImageDimension> TransformType;\n typename TransformType::Pointer transform = TransformType::New();\n transform->SetIdentity();\n\n typedef itk::LinearInterpolateImageFunction<ImageType, RealType>\n LinearInterpolatorType;\n typename LinearInterpolatorType::Pointer interpolator\n = LinearInterpolatorType::New();\n interpolator->SetInputImage( reader->GetOutput() );\n\n typedef itk::NearestNeighborInterpolateImageFunction<ImageType, RealType>\n NearestNeighborInterpolatorType;\n typename NearestNeighborInterpolatorType::Pointer nn_interpolator\n = NearestNeighborInterpolatorType::New();\n nn_interpolator->SetInputImage( reader->GetOutput() );\n\n typedef itk::BSplineInterpolateImageFunction<ImageType, RealType>\n BSplineInterpolatorType;\n typename BSplineInterpolatorType::Pointer bs_interpolator\n = BSplineInterpolatorType::New();\n bs_interpolator->SetInputImage( reader->GetOutput() );\n\n typedef itk::GaussianInterpolateImageFunction<ImageType, RealType>\n GaussianInterpolatorType;\n typename GaussianInterpolatorType::Pointer g_interpolator\n = GaussianInterpolatorType::New();\n g_interpolator->SetInputImage( reader->GetOutput() );\n\n typedef itk::WindowedSincInterpolateImageFunction<ImageType, 3> HammingInterpolatorType;\n typename HammingInterpolatorType::Pointer sh_interpolator = HammingInterpolatorType::New();\n sh_interpolator->SetInputImage( reader->GetOutput() );\n\n typedef itk::WindowedSincInterpolateImageFunction<ImageType, 3,\n itk::Function::CosineWindowFunction<3> > Sinc1InterpolatorType;\n typename Sinc1InterpolatorType::Pointer sc_interpolator = Sinc1InterpolatorType::New();\n sc_interpolator->SetInputImage( reader->GetOutput() );\n\n typedef itk::WindowedSincInterpolateImageFunction<ImageType, 3,\n itk::Function::WelchWindowFunction<3> > Sinc2InterpolatorType;\n typename Sinc2InterpolatorType::Pointer sw_interpolator = Sinc2InterpolatorType::New();\n sw_interpolator->SetInputImage( reader->GetOutput() );\n\n typedef itk::WindowedSincInterpolateImageFunction<ImageType, 3,\n itk::Function::LanczosWindowFunction<3> > Sinc3InterpolatorType;\n typename Sinc3InterpolatorType::Pointer sl_interpolator = Sinc3InterpolatorType::New();\n sl_interpolator->SetInputImage( reader->GetOutput() );\n\n typename Sinc3InterpolatorType::Pointer sb_interpolator = Sinc3InterpolatorType::New();\n sb_interpolator->SetInputImage( reader->GetOutput() );\n\n typedef itk::ResampleImageFilter<ImageType, ImageType, RealType> ResamplerType;\n typename ResamplerType::Pointer resampler = ResamplerType::New();\n typename ResamplerType::SpacingType spacing;\n typename ResamplerType::SizeType size;\n\n std::vector<RealType> sp = ConvertVector<RealType>( std::string( argv[4] ) );\n\n if( argc <= 5 || atoi( argv[5] ) == 0 )\n {\n if( sp.size() == 1 )\n {\n spacing.Fill( sp[0] );\n }\n else if( sp.size() == ImageDimension )\n {\n for( unsigned int d = 0; d < ImageDimension; d++ )\n {\n spacing[d] = sp[d];\n }\n }\n else\n {\n std::cout << \"Invalid spacing.\" << std::endl;\n }\n for( unsigned int i = 0; i < ImageDimension; i++ )\n {\n RealType spacing_old = reader->GetOutput()->GetSpacing()[i];\n RealType size_old = reader->GetOutput()->GetLargestPossibleRegion().GetSize()[i];\n size[i] = static_cast<int>( ( spacing_old * size_old ) \/ spacing[i] + 0.5 );\n }\n }\n else\n {\n if( sp.size() == 1 )\n {\n size.Fill( static_cast<unsigned int>( sp[0] ) );\n }\n else if( sp.size() == ImageDimension )\n {\n for( unsigned int d = 0; d < ImageDimension; d++ )\n {\n size[d] = static_cast<unsigned int>( sp[d] );\n }\n }\n else\n {\n std::cout << \"Invalid size.\" << std::endl;\n }\n for( unsigned int i = 0; i < ImageDimension; i++ )\n {\n RealType spacing_old = reader->GetOutput()->GetSpacing()[i];\n RealType size_old = reader->GetOutput()->GetLargestPossibleRegion().GetSize()[i];\n spacing[i] = spacing_old * static_cast<float>( size_old - 1.0 )\n \/ static_cast<float>( size[i] - 1.0 );\n }\n }\n\n char arg7 = '\\0';\n if( argc > 7 )\n {\n arg7 = *argv[7];\n }\n\n resampler->SetTransform( transform );\n resampler->SetInterpolator( interpolator );\n if( argc > 6 && atoi( argv[6] ) )\n {\n switch( atoi( argv[6] ) )\n {\n case 0: default:\n {\n resampler->SetInterpolator( interpolator );\n }\n break;\n case 1:\n {\n resampler->SetInterpolator( nn_interpolator );\n }\n break;\n case 2:\n {\n double sigma[ImageDimension];\n for( unsigned int d = 0; d < ImageDimension; d++ )\n {\n sigma[d] = reader->GetOutput()->GetSpacing()[d];\n }\n double alpha = 1.0;\n\n if( argc > 7 )\n {\n std::vector<RealType> sg = ConvertVector<RealType>( std::string( argv[7] ) );\n for( unsigned int d = 0; d < ImageDimension; d++ )\n {\n sigma[d] = sg[d];\n }\n }\n if( argc > 8 )\n {\n alpha = static_cast<double>( atof( argv[8] ) );\n }\n g_interpolator->SetParameters( sigma, alpha );\n\n resampler->SetInterpolator( g_interpolator );\n }\n break;\n case 3:\n {\n switch( arg7 )\n {\n case 'h': default:\n {\n resampler->SetInterpolator( sh_interpolator );\n }\n break;\n case 'c':\n {\n resampler->SetInterpolator( sc_interpolator );\n }\n break;\n case 'l':\n {\n resampler->SetInterpolator( sl_interpolator );\n }\n break;\n case 'w':\n {\n resampler->SetInterpolator( sw_interpolator );\n }\n break;\n case 'b':\n {\n resampler->SetInterpolator( sb_interpolator );\n }\n break;\n }\n }\n case 4:\n {\n if( argc > 7 && atoi( argv[7] ) >= 0 && atoi( argv[7] ) <= 5 )\n {\n bs_interpolator->SetSplineOrder( atoi( argv[7] ) );\n }\n else\n {\n bs_interpolator->SetSplineOrder( 3 );\n }\n resampler->SetInterpolator( bs_interpolator );\n }\n break;\n }\n }\n resampler->SetInput( reader->GetOutput() );\n resampler->SetSize( size );\n resampler->SetOutputOrigin( reader->GetOutput()->GetOrigin() );\n resampler->SetOutputDirection( reader->GetOutput()->GetDirection() );\n resampler->SetOutputSpacing( spacing );\n resampler->SetDefaultPixelValue( 0 );\n resampler->Update();\n\n typedef itk::ImageFileWriter<ImageType> WriterType;\n typename WriterType::Pointer writer = WriterType::New();\n writer->SetFileName( argv[3] );\n writer->SetInput( resampler->GetOutput() );\n writer->Update();\n\n return EXIT_SUCCESS;\n}\n\n\/\/ entry point for the library; parameter 'args' is equivalent to 'argv' in (argc,argv) of commandline parameters to\n\/\/ 'main()'\nint ResampleImage( std::vector<std::string> args, std::ostream* \/*out_stream = NULL *\/ )\n{\n \/\/ put the arguments coming in as 'args' into standard (argc,argv) format;\n \/\/ 'args' doesn't have the command name as first, argument, so add it manually;\n \/\/ 'args' may have adjacent arguments concatenated into one argument,\n \/\/ which the parser should handle\n args.insert( args.begin(), \"ResampleImage\" );\n\n int argc = args.size();\n char* * argv = new char *[args.size() + 1];\n for( unsigned int i = 0; i < args.size(); ++i )\n {\n \/\/ allocate space for the string plus a null character\n argv[i] = new char[args[i].length() + 1];\n std::strncpy( argv[i], args[i].c_str(), args[i].length() );\n \/\/ place the null character in the end\n argv[i][args[i].length()] = '\\0';\n }\n argv[argc] = ITK_NULLPTR;\n \/\/ class to automatically cleanup argv upon destruction\n class Cleanup_argv\n {\npublic:\n Cleanup_argv( char* * argv_, int argc_plus_one_ ) : argv( argv_ ), argc_plus_one( argc_plus_one_ )\n {\n }\n\n ~Cleanup_argv()\n {\n for( unsigned int i = 0; i < argc_plus_one; ++i )\n {\n delete[] argv[i];\n }\n delete[] argv;\n }\n\nprivate:\n char* * argv;\n unsigned int argc_plus_one;\n };\n Cleanup_argv cleanup_argv( argv, argc + 1 );\n\n \/\/ antscout->set_stream( out_stream );\n\n if( argc < 5 )\n {\n std::cout << \"Usage: \" << argv[0] << \" imageDimension inputImage \"\n << \"outputImage MxNxO [size=1,spacing=0] [interpolate type]\" << std::endl;\n std::cout << \" Interpolation type: \" << std::endl;\n std::cout << \" 0. linear (default)\" << std::endl;\n std::cout << \" 1. nn \" << std::endl;\n std::cout << \" 2. gaussian [sigma=imageSpacing] [alpha=1.0]\" << std::endl;\n std::cout << \" 3. windowedSinc [type = 'c'osine, 'w'elch, 'b'lackman, 'l'anczos, 'h'amming]\" << std::endl;\n std::cout << \" 4. B-Spline [order=3]\" << std::endl;\n if( argc >= 2 &&\n ( std::string( argv[1] ) == std::string(\"--help\") || std::string( argv[1] ) == std::string(\"-h\") ) )\n {\n return EXIT_SUCCESS;\n }\n return EXIT_FAILURE;\n }\n\n switch( atoi( argv[1] ) )\n {\n case 2:\n {\n ResampleImage<2>( argc, argv );\n }\n break;\n case 3:\n {\n ResampleImage<3>( argc, argv );\n }\n break;\n case 4:\n {\n ResampleImage<4>( argc, argv );\n }\n break;\n default:\n std::cout << \"Unsupported dimension\" << std::endl;\n return EXIT_FAILURE;\n }\n return EXIT_SUCCESS;\n}\n} \/\/ namespace ants\n<commit_msg>ENH: ResampleImage.cxx for ANTsR<commit_after>\n#include \"antsUtilities.h\"\n#include <algorithm>\n\n#include <stdio.h>\n\n#include \"itkImage.h\"\n#include \"itkImageFileReader.h\"\n#include \"itkImageFileWriter.h\"\n\n#include \"itkResampleImageFilter.h\"\n\n#include \"itkConstantBoundaryCondition.h\"\n#include \"itkIdentityTransform.h\"\n#include \"itkBSplineInterpolateImageFunction.h\"\n#include \"itkLinearInterpolateImageFunction.h\"\n#include \"itkGaussianInterpolateImageFunction.h\"\n#include \"itkNearestNeighborInterpolateImageFunction.h\"\n#include \"itkWindowedSincInterpolateImageFunction.h\"\n#include \"ReadWriteData.h\"\n#include <string>\n#include <vector>\n\nnamespace ants\n{\n\ntemplate <unsigned int ImageDimension>\nint ResampleImage( int argc, char *argv[] )\n{\n typedef double RealType;\n typedef double PixelType;\n typedef itk::Image<PixelType, ImageDimension> ImageType;\n\n typename ImageType::Pointer image = ITK_NULLPTR;\n ReadImage<ImageType>( image, argv[2] );\n\n typedef itk::IdentityTransform<RealType, ImageDimension> TransformType;\n typename TransformType::Pointer transform = TransformType::New();\n transform->SetIdentity();\n\n typedef itk::LinearInterpolateImageFunction<ImageType, RealType>\n LinearInterpolatorType;\n typename LinearInterpolatorType::Pointer interpolator\n = LinearInterpolatorType::New();\n interpolator->SetInputImage( image );\n\n typedef itk::NearestNeighborInterpolateImageFunction<ImageType, RealType>\n NearestNeighborInterpolatorType;\n typename NearestNeighborInterpolatorType::Pointer nn_interpolator\n = NearestNeighborInterpolatorType::New();\n nn_interpolator->SetInputImage( image );\n\n typedef itk::BSplineInterpolateImageFunction<ImageType, RealType>\n BSplineInterpolatorType;\n typename BSplineInterpolatorType::Pointer bs_interpolator\n = BSplineInterpolatorType::New();\n bs_interpolator->SetInputImage( image );\n\n typedef itk::GaussianInterpolateImageFunction<ImageType, RealType>\n GaussianInterpolatorType;\n typename GaussianInterpolatorType::Pointer g_interpolator\n = GaussianInterpolatorType::New();\n g_interpolator->SetInputImage( image );\n\n typedef itk::WindowedSincInterpolateImageFunction<ImageType, 3> HammingInterpolatorType;\n typename HammingInterpolatorType::Pointer sh_interpolator = HammingInterpolatorType::New();\n sh_interpolator->SetInputImage( image );\n\n typedef itk::WindowedSincInterpolateImageFunction<ImageType, 3,\n itk::Function::CosineWindowFunction<3> > Sinc1InterpolatorType;\n typename Sinc1InterpolatorType::Pointer sc_interpolator = Sinc1InterpolatorType::New();\n sc_interpolator->SetInputImage( image );\n\n typedef itk::WindowedSincInterpolateImageFunction<ImageType, 3,\n itk::Function::WelchWindowFunction<3> > Sinc2InterpolatorType;\n typename Sinc2InterpolatorType::Pointer sw_interpolator = Sinc2InterpolatorType::New();\n sw_interpolator->SetInputImage( image );\n\n typedef itk::WindowedSincInterpolateImageFunction<ImageType, 3,\n itk::Function::LanczosWindowFunction<3> > Sinc3InterpolatorType;\n typename Sinc3InterpolatorType::Pointer sl_interpolator = Sinc3InterpolatorType::New();\n sl_interpolator->SetInputImage( image );\n\n typename Sinc3InterpolatorType::Pointer sb_interpolator = Sinc3InterpolatorType::New();\n sb_interpolator->SetInputImage( image );\n\n typedef itk::ResampleImageFilter<ImageType, ImageType, RealType> ResamplerType;\n typename ResamplerType::Pointer resampler = ResamplerType::New();\n typename ResamplerType::SpacingType spacing;\n typename ResamplerType::SizeType size;\n\n std::vector<RealType> sp = ConvertVector<RealType>( std::string( argv[4] ) );\n\n if( argc <= 5 || atoi( argv[5] ) == 0 )\n {\n if( sp.size() == 1 )\n {\n spacing.Fill( sp[0] );\n }\n else if( sp.size() == ImageDimension )\n {\n for( unsigned int d = 0; d < ImageDimension; d++ )\n {\n spacing[d] = sp[d];\n }\n }\n else\n {\n std::cout << \"Invalid spacing.\" << std::endl;\n }\n for( unsigned int i = 0; i < ImageDimension; i++ )\n {\n RealType spacing_old = image->GetSpacing()[i];\n RealType size_old = image->GetLargestPossibleRegion().GetSize()[i];\n size[i] = static_cast<int>( ( spacing_old * size_old ) \/ spacing[i] + 0.5 );\n }\n }\n else\n {\n if( sp.size() == 1 )\n {\n size.Fill( static_cast<unsigned int>( sp[0] ) );\n }\n else if( sp.size() == ImageDimension )\n {\n for( unsigned int d = 0; d < ImageDimension; d++ )\n {\n size[d] = static_cast<unsigned int>( sp[d] );\n }\n }\n else\n {\n std::cout << \"Invalid size.\" << std::endl;\n }\n for( unsigned int i = 0; i < ImageDimension; i++ )\n {\n RealType spacing_old = image->GetSpacing()[i];\n RealType size_old = image->GetLargestPossibleRegion().GetSize()[i];\n spacing[i] = spacing_old * static_cast<float>( size_old - 1.0 )\n \/ static_cast<float>( size[i] - 1.0 );\n }\n }\n\n char arg7 = '\\0';\n if( argc > 7 )\n {\n arg7 = *argv[7];\n }\n\n resampler->SetTransform( transform );\n resampler->SetInterpolator( interpolator );\n if( argc > 6 && atoi( argv[6] ) )\n {\n switch( atoi( argv[6] ) )\n {\n case 0: default:\n {\n resampler->SetInterpolator( interpolator );\n }\n break;\n case 1:\n {\n resampler->SetInterpolator( nn_interpolator );\n }\n break;\n case 2:\n {\n double sigma[ImageDimension];\n for( unsigned int d = 0; d < ImageDimension; d++ )\n {\n sigma[d] = image->GetSpacing()[d];\n }\n double alpha = 1.0;\n\n if( argc > 7 )\n {\n std::vector<RealType> sg = ConvertVector<RealType>( std::string( argv[7] ) );\n for( unsigned int d = 0; d < ImageDimension; d++ )\n {\n sigma[d] = sg[d];\n }\n }\n if( argc > 8 )\n {\n alpha = static_cast<double>( atof( argv[8] ) );\n }\n g_interpolator->SetParameters( sigma, alpha );\n\n resampler->SetInterpolator( g_interpolator );\n }\n break;\n case 3:\n {\n switch( arg7 )\n {\n case 'h': default:\n {\n resampler->SetInterpolator( sh_interpolator );\n }\n break;\n case 'c':\n {\n resampler->SetInterpolator( sc_interpolator );\n }\n break;\n case 'l':\n {\n resampler->SetInterpolator( sl_interpolator );\n }\n break;\n case 'w':\n {\n resampler->SetInterpolator( sw_interpolator );\n }\n break;\n case 'b':\n {\n resampler->SetInterpolator( sb_interpolator );\n }\n break;\n }\n }\n case 4:\n {\n if( argc > 7 && atoi( argv[7] ) >= 0 && atoi( argv[7] ) <= 5 )\n {\n bs_interpolator->SetSplineOrder( atoi( argv[7] ) );\n }\n else\n {\n bs_interpolator->SetSplineOrder( 3 );\n }\n resampler->SetInterpolator( bs_interpolator );\n }\n break;\n }\n }\n resampler->SetInput( image );\n resampler->SetSize( size );\n resampler->SetOutputOrigin( image->GetOrigin() );\n resampler->SetOutputDirection( image->GetDirection() );\n resampler->SetOutputSpacing( spacing );\n resampler->SetDefaultPixelValue( 0 );\n resampler->Update();\n\n WriteImage<ImageType>( resampler->GetOutput() , argv[3] );\n return EXIT_SUCCESS;\n}\n\n\/\/ entry point for the library; parameter 'args' is equivalent to 'argv' in (argc,argv) of commandline parameters to\n\/\/ 'main()'\nint ResampleImage( std::vector<std::string> args, std::ostream* \/*out_stream = NULL *\/ )\n{\n \/\/ put the arguments coming in as 'args' into standard (argc,argv) format;\n \/\/ 'args' doesn't have the command name as first, argument, so add it manually;\n \/\/ 'args' may have adjacent arguments concatenated into one argument,\n \/\/ which the parser should handle\n args.insert( args.begin(), \"ResampleImage\" );\n\n int argc = args.size();\n char* * argv = new char *[args.size() + 1];\n for( unsigned int i = 0; i < args.size(); ++i )\n {\n \/\/ allocate space for the string plus a null character\n argv[i] = new char[args[i].length() + 1];\n std::strncpy( argv[i], args[i].c_str(), args[i].length() );\n \/\/ place the null character in the end\n argv[i][args[i].length()] = '\\0';\n }\n argv[argc] = ITK_NULLPTR;\n \/\/ class to automatically cleanup argv upon destruction\n class Cleanup_argv\n {\npublic:\n Cleanup_argv( char* * argv_, int argc_plus_one_ ) : argv( argv_ ), argc_plus_one( argc_plus_one_ )\n {\n }\n\n ~Cleanup_argv()\n {\n for( unsigned int i = 0; i < argc_plus_one; ++i )\n {\n delete[] argv[i];\n }\n delete[] argv;\n }\n\nprivate:\n char* * argv;\n unsigned int argc_plus_one;\n };\n Cleanup_argv cleanup_argv( argv, argc + 1 );\n\n \/\/ antscout->set_stream( out_stream );\n\n if( argc < 5 )\n {\n std::cout << \"Usage: \" << argv[0] << \" imageDimension inputImage \"\n << \"outputImage MxNxO [size=1,spacing=0] [interpolate type]\" << std::endl;\n std::cout << \" Interpolation type: \" << std::endl;\n std::cout << \" 0. linear (default)\" << std::endl;\n std::cout << \" 1. nn \" << std::endl;\n std::cout << \" 2. gaussian [sigma=imageSpacing] [alpha=1.0]\" << std::endl;\n std::cout << \" 3. windowedSinc [type = 'c'osine, 'w'elch, 'b'lackman, 'l'anczos, 'h'amming]\" << std::endl;\n std::cout << \" 4. B-Spline [order=3]\" << std::endl;\n if( argc >= 2 &&\n ( std::string( argv[1] ) == std::string(\"--help\") || std::string( argv[1] ) == std::string(\"-h\") ) )\n {\n return EXIT_SUCCESS;\n }\n return EXIT_FAILURE;\n }\n\n switch( atoi( argv[1] ) )\n {\n case 2:\n {\n ResampleImage<2>( argc, argv );\n }\n break;\n case 3:\n {\n ResampleImage<3>( argc, argv );\n }\n break;\n case 4:\n {\n ResampleImage<4>( argc, argv );\n }\n break;\n default:\n std::cout << \"Unsupported dimension\" << std::endl;\n return EXIT_FAILURE;\n }\n return EXIT_SUCCESS;\n}\n} \/\/ namespace ants\n<|endoftext|>"} {"text":"<commit_before>\/\/---------------------------------------------------------------------------\n\/\/ $Id$\n\/\/ Version: $Name$\n\/\/\n\/\/ Copyright (C) 2005, 2006, 2008, 2009 by the deal.II authors\n\/\/\n\/\/ This file is subject to QPL and may not be distributed\n\/\/ without copyright and license information. Please refer\n\/\/ to the file deal.II\/doc\/license.html for the text and\n\/\/ further information on this license.\n\/\/\n\/\/---------------------------------------------------------------------------\n\n\n#include <base\/index_set.h>\n\n#ifdef DEAL_II_USE_TRILINOS\n# ifdef DEAL_II_COMPILER_SUPPORTS_MPI\n# include <Epetra_MpiComm.h>\n# endif\n# include <Epetra_SerialComm.h>\n#endif\n\nDEAL_II_NAMESPACE_OPEN\n\nvoid\nIndexSet::compress () const\n{\n if (is_compressed == true)\n return;\n\t\t\t\t \/\/ see if any of the\n\t\t\t\t \/\/ contiguous ranges can be\n\t\t\t\t \/\/ merged. since they are sorted by\n\t\t\t\t \/\/ their first index, determining\n\t\t\t\t \/\/ overlap isn't all that hard\n for (std::vector<Range>::iterator\n\t i = ranges.begin();\n i != ranges.end(); )\n {\n std::vector<Range>::iterator\n\tnext = i;\n ++next;\n\n unsigned int first_index = i->begin;\n unsigned int last_index = i->end;\n\n\t\t\t\t \/\/ see if we can merge any of\n\t\t\t\t \/\/ the following ranges\n bool can_merge = false;\n while (next != ranges.end() &&\n\t (next->begin <= last_index))\n\t{\n\t last_index = std::max (last_index, next->end);\n\t ++next;\n\t can_merge = true;\n\t}\n\n if (can_merge == true)\n\t{\n\t\t\t\t\t \/\/ delete the old ranges\n\t\t\t\t\t \/\/ and insert the new range\n\t\t\t\t\t \/\/ in place of the previous\n\t\t\t\t\t \/\/ one\n\t *i = Range(first_index, last_index);\n\t i = ranges.erase (i+1, next);\n\t}\n else\n\t++i;\n }\n\n\n\t\t\t\t \/\/ now compute indices within set\n unsigned int next_index = 0;\n for (std::vector<Range>::iterator\n\t i = ranges.begin();\n i != ranges.end();\n ++i)\n {\n i->nth_index_in_set = next_index;\n next_index += (i->end - i->begin);\n }\n is_compressed = true;\n\n\t\t\t\t \/\/ check that next_index is\n\t\t\t\t \/\/ correct. needs to be after the\n\t\t\t\t \/\/ previous statement because we\n\t\t\t\t \/\/ otherwise will get into an\n\t\t\t\t \/\/ endless loop\n Assert (next_index == n_elements(), ExcInternalError());\n}\n\n\n\n#ifdef DEAL_II_USE_TRILINOS\n\nEpetra_Map\nIndexSet::make_trilinos_map (const MPI_Comm &communicator,\n\t\t\t const bool overlapping) const\n{\n compress ();\n\n if ((is_contiguous() == true) && (!overlapping))\n return Epetra_Map (size(),\n\t\t n_elements(),\n\t\t 0,\n#ifdef DEAL_II_COMPILER_SUPPORTS_MPI\n\t\t Epetra_MpiComm(communicator));\n#else\n\t\t Epetra_SerialComm());\n#endif\n else\n {\n std::vector<int> indices;\n indices.reserve(n_elements());\n for (std::vector<Range>::iterator\n\t i = ranges.begin();\n\t i != ranges.end();\n\t ++i)\n\tfor (unsigned int j=i->begin; j<i->end; ++j)\n\t indices.push_back (j);\n Assert (indices.size() == n_elements(), ExcInternalError());\n \n return Epetra_Map (-1,\n\t\t\t n_elements(),\n\t\t\t &indices[0],\n\t\t\t 0,\n#ifdef DEAL_II_COMPILER_SUPPORTS_MPI\n\t\t\t Epetra_MpiComm(communicator));\n#else\n\t\t\t Epetra_SerialComm());\n#endif\n }\n}\n\n \n#endif\n\n\nDEAL_II_NAMESPACE_CLOSE\n<commit_msg>Add missing include file.<commit_after>\/\/---------------------------------------------------------------------------\n\/\/ $Id$\n\/\/ Version: $Name$\n\/\/\n\/\/ Copyright (C) 2005, 2006, 2008, 2009 by the deal.II authors\n\/\/\n\/\/ This file is subject to QPL and may not be distributed\n\/\/ without copyright and license information. Please refer\n\/\/ to the file deal.II\/doc\/license.html for the text and\n\/\/ further information on this license.\n\/\/\n\/\/---------------------------------------------------------------------------\n\n\n#include <base\/index_set.h>\n\n#ifdef DEAL_II_USE_TRILINOS\n# ifdef DEAL_II_COMPILER_SUPPORTS_MPI\n# include <Epetra_MpiComm.h>\n# endif\n# include <Epetra_SerialComm.h>\n# include <Epetra_Map.h>\n#endif\n\nDEAL_II_NAMESPACE_OPEN\n\nvoid\nIndexSet::compress () const\n{\n if (is_compressed == true)\n return;\n\t\t\t\t \/\/ see if any of the\n\t\t\t\t \/\/ contiguous ranges can be\n\t\t\t\t \/\/ merged. since they are sorted by\n\t\t\t\t \/\/ their first index, determining\n\t\t\t\t \/\/ overlap isn't all that hard\n for (std::vector<Range>::iterator\n\t i = ranges.begin();\n i != ranges.end(); )\n {\n std::vector<Range>::iterator\n\tnext = i;\n ++next;\n\n unsigned int first_index = i->begin;\n unsigned int last_index = i->end;\n\n\t\t\t\t \/\/ see if we can merge any of\n\t\t\t\t \/\/ the following ranges\n bool can_merge = false;\n while (next != ranges.end() &&\n\t (next->begin <= last_index))\n\t{\n\t last_index = std::max (last_index, next->end);\n\t ++next;\n\t can_merge = true;\n\t}\n\n if (can_merge == true)\n\t{\n\t\t\t\t\t \/\/ delete the old ranges\n\t\t\t\t\t \/\/ and insert the new range\n\t\t\t\t\t \/\/ in place of the previous\n\t\t\t\t\t \/\/ one\n\t *i = Range(first_index, last_index);\n\t i = ranges.erase (i+1, next);\n\t}\n else\n\t++i;\n }\n\n\n\t\t\t\t \/\/ now compute indices within set\n unsigned int next_index = 0;\n for (std::vector<Range>::iterator\n\t i = ranges.begin();\n i != ranges.end();\n ++i)\n {\n i->nth_index_in_set = next_index;\n next_index += (i->end - i->begin);\n }\n is_compressed = true;\n\n\t\t\t\t \/\/ check that next_index is\n\t\t\t\t \/\/ correct. needs to be after the\n\t\t\t\t \/\/ previous statement because we\n\t\t\t\t \/\/ otherwise will get into an\n\t\t\t\t \/\/ endless loop\n Assert (next_index == n_elements(), ExcInternalError());\n}\n\n\n\n#ifdef DEAL_II_USE_TRILINOS\n\nEpetra_Map\nIndexSet::make_trilinos_map (const MPI_Comm &communicator,\n\t\t\t const bool overlapping) const\n{\n compress ();\n\n if ((is_contiguous() == true) && (!overlapping))\n return Epetra_Map (size(),\n\t\t n_elements(),\n\t\t 0,\n#ifdef DEAL_II_COMPILER_SUPPORTS_MPI\n\t\t Epetra_MpiComm(communicator));\n#else\n\t\t Epetra_SerialComm());\n#endif\n else\n {\n std::vector<int> indices;\n indices.reserve(n_elements());\n for (std::vector<Range>::iterator\n\t i = ranges.begin();\n\t i != ranges.end();\n\t ++i)\n\tfor (unsigned int j=i->begin; j<i->end; ++j)\n\t indices.push_back (j);\n Assert (indices.size() == n_elements(), ExcInternalError());\n \n return Epetra_Map (-1,\n\t\t\t n_elements(),\n\t\t\t &indices[0],\n\t\t\t 0,\n#ifdef DEAL_II_COMPILER_SUPPORTS_MPI\n\t\t\t Epetra_MpiComm(communicator));\n#else\n\t\t\t Epetra_SerialComm());\n#endif\n }\n}\n\n \n#endif\n\n\nDEAL_II_NAMESPACE_CLOSE\n<|endoftext|>"} {"text":"<commit_before>#include \"WavTapDevice.hpp\"\n#include \"WavTapEngine.hpp\"\n#include <IOKit\/audio\/IOAudioControl.h>\n#include <IOKit\/audio\/IOAudioLevelControl.h>\n#include <IOKit\/audio\/IOAudioToggleControl.h>\n#include <IOKit\/audio\/IOAudioDefines.h>\n#include <IOKit\/IOLib.h>\n\n#define super IOAudioDevice\n\nOSDefineMetaClassAndStructors(WavTapDevice, IOAudioDevice)\n\nconst SInt32 WavTapDevice::kVolumeMax = 99;\nconst SInt32 WavTapDevice::kGainMax = 99;\n\nbool WavTapDevice::initHardware(IOService *provider) {\n if (!super::initHardware(provider)) {\n return false;\n }\n setDeviceName(\"WavTap\");\n setDeviceShortName(\"WavTap\");\n setManufacturerName(\"WavTap\");\n if (!createAudioEngines()){\n return false;\n }\n return true;\n}\n\nbool WavTapDevice::createAudioEngines() {\n OSArray *audioEngineArray = OSDynamicCast(OSArray, getProperty(AUDIO_ENGINES_KEY));\n OSCollectionIterator *audioEngineIterator;\n OSDictionary *audioEngineDict;\n if (!audioEngineArray) {\n IOLog(\"WavTapDevice[%p]::createAudioEngine() - Error: no AudioEngine array in personality.\\n\", this);\n return false;\n }\n audioEngineIterator = OSCollectionIterator::withCollection(audioEngineArray);\n if (!audioEngineIterator) {\n IOLog(\"WavTapDevice: no audio engines available.\\n\");\n return true;\n }\n while ((audioEngineDict = (OSDictionary*)audioEngineIterator->getNextObject())) {\n WavTapEngine *audioEngine = NULL;\n if (OSDynamicCast(OSDictionary, audioEngineDict) == NULL)\n continue;\n audioEngine = new WavTapEngine;\n if (!audioEngine)\n continue;\n if (!audioEngine->init(audioEngineDict))\n continue;\n initControls(audioEngine);\n activateAudioEngine(audioEngine);\n audioEngine->release();\n }\n audioEngineIterator->release();\n return true;\n}\n\n#define addControl(control, handler) \\\n if (!control) {\\\n IOLog(\"WavTap failed to add control.\\n\"); \\\n return false; \\\n } \\\n control->setValueChangeHandler(handler, this); \\\n audioEngine->addDefaultAudioControl(control); \\\n control->release();\n\nbool WavTapDevice::initControls(WavTapEngine* audioEngine) {\n IOAudioControl *control = NULL;\n for (UInt32 channel=0; channel <= NUM_CHANS; channel++) {\n mVolume[channel] = mGain[channel] = kVolumeMax;\n mMuteOut[channel] = mMuteIn[channel] = false;\n }\n const char *channelNameMap[NUM_CHANS+1] = {\n kIOAudioControlChannelNameAll,\n kIOAudioControlChannelNameLeft,\n kIOAudioControlChannelNameRight,\n kIOAudioControlChannelNameCenter,\n kIOAudioControlChannelNameLeftRear,\n kIOAudioControlChannelNameRightRear,\n kIOAudioControlChannelNameSub\n };\n for (UInt32 channel=7; channel <= NUM_CHANS; channel++)\n channelNameMap[channel] = \"Unknown Channel\";\n for (unsigned channel=0; channel <= NUM_CHANS; channel++) {\n control = IOAudioLevelControl::createVolumeControl(WavTapDevice::kVolumeMax, 0, WavTapDevice::kVolumeMax, (-40 << 16) + (32768), 0, channel, channelNameMap[channel], channel, kIOAudioControlUsageOutput);\n addControl(control, (IOAudioControl::IntValueChangeHandler)volumeChangeHandler);\n control = IOAudioLevelControl::createVolumeControl(WavTapDevice::kGainMax, 0, WavTapDevice::kGainMax, 0, (40 << 16) + (32768), channel, channelNameMap[channel], channel, kIOAudioControlUsageInput);\n addControl(control, (IOAudioControl::IntValueChangeHandler)gainChangeHandler);\n }\n control = IOAudioToggleControl::createMuteControl(false, kIOAudioControlChannelIDAll, kIOAudioControlChannelNameAll, 0, kIOAudioControlUsageOutput);\n addControl(control, (IOAudioControl::IntValueChangeHandler)outputMuteChangeHandler);\n control = IOAudioToggleControl::createMuteControl(false, kIOAudioControlChannelIDAll, kIOAudioControlChannelNameAll, 0, kIOAudioControlUsageInput);\n addControl(control, (IOAudioControl::IntValueChangeHandler)inputMuteChangeHandler);\n return true;\n}\n\nIOReturn WavTapDevice::volumeChangeHandler(IOService *target, IOAudioControl *volumeControl, SInt32 oldValue, SInt32 newValue) {\n IOReturn result = kIOReturnBadArgument;\n WavTapDevice *audioDevice = (WavTapDevice *)target;\n if (audioDevice)\n result = audioDevice->volumeChanged(volumeControl, oldValue, newValue);\n return result;\n}\n\nIOReturn WavTapDevice::volumeChanged(IOAudioControl *volumeControl, SInt32 oldValue, SInt32 newValue) {\n if (volumeControl)\n mVolume[volumeControl->getChannelID()] = newValue;\n return kIOReturnSuccess;\n}\n\nIOReturn WavTapDevice::outputMuteChangeHandler(IOService *target, IOAudioControl *muteControl, SInt32 oldValue, SInt32 newValue) {\n IOReturn result = kIOReturnBadArgument;\n WavTapDevice *audioDevice = (WavTapDevice*)target;\n if (audioDevice)\n result = audioDevice->outputMuteChanged(muteControl, oldValue, newValue);\n return result;\n}\n\nIOReturn WavTapDevice::outputMuteChanged(IOAudioControl *muteControl, SInt32 oldValue, SInt32 newValue) {\n if (muteControl)\n mMuteOut[muteControl->getChannelID()] = newValue;\n return kIOReturnSuccess;\n}\n\nIOReturn WavTapDevice::gainChangeHandler(IOService *target, IOAudioControl *gainControl, SInt32 oldValue, SInt32 newValue) {\n IOReturn result = kIOReturnBadArgument;\n WavTapDevice *audioDevice = (WavTapDevice *)target;\n if (audioDevice)\n result = audioDevice->gainChanged(gainControl, oldValue, newValue);\n return result;\n}\n\nIOReturn WavTapDevice::gainChanged(IOAudioControl *gainControl, SInt32 oldValue, SInt32 newValue) {\n if (gainControl)\n mGain[gainControl->getChannelID()] = newValue;\n return kIOReturnSuccess;\n}\n\nIOReturn WavTapDevice::inputMuteChangeHandler(IOService *target, IOAudioControl *muteControl, SInt32 oldValue, SInt32 newValue) {\n IOReturn result = kIOReturnBadArgument;\n WavTapDevice *audioDevice = (WavTapDevice*)target;\n if (audioDevice)\n result = audioDevice->inputMuteChanged(muteControl, oldValue, newValue);\n return result;\n}\n\nIOReturn WavTapDevice::inputMuteChanged(IOAudioControl *muteControl, SInt32 oldValue, SInt32 newValue) {\n if (muteControl)\n mMuteIn[muteControl->getChannelID()] = newValue;\n return kIOReturnSuccess;\n}\n<commit_msg>[formatting] I just like when assignments have their own line<commit_after>#include \"WavTapDevice.hpp\"\n#include \"WavTapEngine.hpp\"\n#include <IOKit\/audio\/IOAudioControl.h>\n#include <IOKit\/audio\/IOAudioLevelControl.h>\n#include <IOKit\/audio\/IOAudioToggleControl.h>\n#include <IOKit\/audio\/IOAudioDefines.h>\n#include <IOKit\/IOLib.h>\n\n#define super IOAudioDevice\n\nOSDefineMetaClassAndStructors(WavTapDevice, IOAudioDevice)\n\nconst SInt32 WavTapDevice::kVolumeMax = 99;\nconst SInt32 WavTapDevice::kGainMax = 99;\n\nbool WavTapDevice::initHardware(IOService *provider) {\n if (!super::initHardware(provider)) {\n return false;\n }\n setDeviceName(\"WavTap\");\n setDeviceShortName(\"WavTap\");\n setManufacturerName(\"WavTap\");\n if (!createAudioEngines()){\n return false;\n }\n return true;\n}\n\nbool WavTapDevice::createAudioEngines() {\n OSArray *audioEngineArray = OSDynamicCast(OSArray, getProperty(AUDIO_ENGINES_KEY));\n OSCollectionIterator *audioEngineIterator;\n OSDictionary *audioEngineDict;\n if (!audioEngineArray) {\n IOLog(\"WavTapDevice[%p]::createAudioEngine() - Error: no AudioEngine array in personality.\\n\", this);\n return false;\n }\n audioEngineIterator = OSCollectionIterator::withCollection(audioEngineArray);\n if (!audioEngineIterator) {\n IOLog(\"WavTapDevice: no audio engines available.\\n\");\n return true;\n }\n while ((audioEngineDict = (OSDictionary*)audioEngineIterator->getNextObject())) {\n WavTapEngine *audioEngine = NULL;\n if (OSDynamicCast(OSDictionary, audioEngineDict) == NULL)\n continue;\n audioEngine = new WavTapEngine;\n if (!audioEngine)\n continue;\n if (!audioEngine->init(audioEngineDict))\n continue;\n initControls(audioEngine);\n activateAudioEngine(audioEngine);\n audioEngine->release();\n }\n audioEngineIterator->release();\n return true;\n}\n\n#define addControl(control, handler) \\\n if (!control) {\\\n IOLog(\"WavTap failed to add control.\\n\"); \\\n return false; \\\n } \\\n control->setValueChangeHandler(handler, this); \\\n audioEngine->addDefaultAudioControl(control); \\\n control->release();\n\nbool WavTapDevice::initControls(WavTapEngine* audioEngine) {\n IOAudioControl *control = NULL;\n for (UInt32 channel = 0; channel <= NUM_CHANS; channel++) {\n mGain[channel] = kVolumeMax;\n mVolume[channel] = kVolumeMax;\n mMuteIn[channel] = false;\n mMuteOut[channel] = false;\n }\n const char *channelNameMap[NUM_CHANS+1] = {\n kIOAudioControlChannelNameAll,\n kIOAudioControlChannelNameLeft,\n kIOAudioControlChannelNameRight,\n kIOAudioControlChannelNameCenter,\n kIOAudioControlChannelNameLeftRear,\n kIOAudioControlChannelNameRightRear,\n kIOAudioControlChannelNameSub\n };\n for (UInt32 channel=7; channel <= NUM_CHANS; channel++)\n channelNameMap[channel] = \"Unknown Channel\";\n for (unsigned channel=0; channel <= NUM_CHANS; channel++) {\n control = IOAudioLevelControl::createVolumeControl(WavTapDevice::kVolumeMax, 0, WavTapDevice::kVolumeMax, (-40 << 16) + (32768), 0, channel, channelNameMap[channel], channel, kIOAudioControlUsageOutput);\n addControl(control, (IOAudioControl::IntValueChangeHandler)volumeChangeHandler);\n control = IOAudioLevelControl::createVolumeControl(WavTapDevice::kGainMax, 0, WavTapDevice::kGainMax, 0, (40 << 16) + (32768), channel, channelNameMap[channel], channel, kIOAudioControlUsageInput);\n addControl(control, (IOAudioControl::IntValueChangeHandler)gainChangeHandler);\n }\n control = IOAudioToggleControl::createMuteControl(false, kIOAudioControlChannelIDAll, kIOAudioControlChannelNameAll, 0, kIOAudioControlUsageOutput);\n addControl(control, (IOAudioControl::IntValueChangeHandler)outputMuteChangeHandler);\n control = IOAudioToggleControl::createMuteControl(false, kIOAudioControlChannelIDAll, kIOAudioControlChannelNameAll, 0, kIOAudioControlUsageInput);\n addControl(control, (IOAudioControl::IntValueChangeHandler)inputMuteChangeHandler);\n return true;\n}\n\nIOReturn WavTapDevice::volumeChangeHandler(IOService *target, IOAudioControl *volumeControl, SInt32 oldValue, SInt32 newValue) {\n IOReturn result = kIOReturnBadArgument;\n WavTapDevice *audioDevice = (WavTapDevice *)target;\n if (audioDevice)\n result = audioDevice->volumeChanged(volumeControl, oldValue, newValue);\n return result;\n}\n\nIOReturn WavTapDevice::volumeChanged(IOAudioControl *volumeControl, SInt32 oldValue, SInt32 newValue) {\n if (volumeControl)\n mVolume[volumeControl->getChannelID()] = newValue;\n return kIOReturnSuccess;\n}\n\nIOReturn WavTapDevice::outputMuteChangeHandler(IOService *target, IOAudioControl *muteControl, SInt32 oldValue, SInt32 newValue) {\n IOReturn result = kIOReturnBadArgument;\n WavTapDevice *audioDevice = (WavTapDevice*)target;\n if (audioDevice)\n result = audioDevice->outputMuteChanged(muteControl, oldValue, newValue);\n return result;\n}\n\nIOReturn WavTapDevice::outputMuteChanged(IOAudioControl *muteControl, SInt32 oldValue, SInt32 newValue) {\n if (muteControl)\n mMuteOut[muteControl->getChannelID()] = newValue;\n return kIOReturnSuccess;\n}\n\nIOReturn WavTapDevice::gainChangeHandler(IOService *target, IOAudioControl *gainControl, SInt32 oldValue, SInt32 newValue) {\n IOReturn result = kIOReturnBadArgument;\n WavTapDevice *audioDevice = (WavTapDevice *)target;\n if (audioDevice)\n result = audioDevice->gainChanged(gainControl, oldValue, newValue);\n return result;\n}\n\nIOReturn WavTapDevice::gainChanged(IOAudioControl *gainControl, SInt32 oldValue, SInt32 newValue) {\n if (gainControl)\n mGain[gainControl->getChannelID()] = newValue;\n return kIOReturnSuccess;\n}\n\nIOReturn WavTapDevice::inputMuteChangeHandler(IOService *target, IOAudioControl *muteControl, SInt32 oldValue, SInt32 newValue) {\n IOReturn result = kIOReturnBadArgument;\n WavTapDevice *audioDevice = (WavTapDevice*)target;\n if (audioDevice)\n result = audioDevice->inputMuteChanged(muteControl, oldValue, newValue);\n return result;\n}\n\nIOReturn WavTapDevice::inputMuteChanged(IOAudioControl *muteControl, SInt32 oldValue, SInt32 newValue) {\n if (muteControl)\n mMuteIn[muteControl->getChannelID()] = newValue;\n return kIOReturnSuccess;\n}\n<|endoftext|>"} {"text":"<commit_before>\/*\n\n Copyright 2014 The pydevs Developers\n\n Licensed under the Apache License, Version 2.0 (the \"License\");\n you may not use this file except in compliance with the License.\n You may obtain a copy of the License at\n\n http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n\n Unless required by applicable law or agreed to in writing, software\n distributed under the License is distributed on an \"AS IS\" BASIS,\n WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n See the License for the specific language governing permissions and\n limitations under the License.\n\n*\/\n\n#ifndef ADEVS_PYTHON_HPP\n#define ADEVS_PYTHON_HPP\n\n#include <functional>\n\n#include <Python.h>\n\n#include \"adevs.h\"\n#include<iostream>\n\n\nnamespace pydevs {\n\n\n\ntypedef PyObject* Value;\ntypedef int Port;\ntypedef adevs::PortValue<Value, Port> PortValue;\ntypedef adevs::Bag<PortValue> IOBag;\ntypedef double Time;\ntypedef adevs::Atomic<PortValue, Time> AtomicBase;\ntypedef adevs::Digraph<Value, Port, Time> DigraphBase;\ntypedef adevs::Devs<PortValue, Time> Devs;\ntypedef adevs::Simulator<PortValue, Time> SimulatorBase;\n\ntypedef void (*DeltaIntFunc)(PyObject*);\ntypedef void (*DeltaExtFunc)(PyObject*, Time, const IOBag&);\ntypedef void (*DeltaConfFunc)(PyObject*, const IOBag&);\ntypedef void (*OutputFunc)(PyObject*, IOBag&);\ntypedef Time (*TaFunc)(PyObject*);\n\n\n\n\/**\n *\tC++ wrapper class which implements the virtual functions\n *\tof the adevs Atomic model\n*\/\nclass Atomic: public AtomicBase {\n\npublic:\n\n\texplicit Atomic(\n\t\tPyObject* pythonObject,\n\t\tDeltaIntFunc deltaIntFunc,\n\t\tDeltaExtFunc deltaExtFunc,\n\t\tDeltaConfFunc deltaConfFunc,\n\t\tOutputFunc outputFunc,\n\t\tTaFunc taFunc\n\t)\n\t: \tAtomicBase(),\n\t\tpythonObject_ (pythonObject),\n\t\tdeltaIntFunc_ (deltaIntFunc),\n\t\tdeltaExtFunc_ (deltaExtFunc),\n\t\tdeltaConfFunc_ (deltaConfFunc),\n\t\toutputFunc_ (outputFunc),\n\t\ttaFunc_ (taFunc)\n\t{ }\t\n\n\n\n\t\/**\n\t * Destructor\n\t *\/\n\tvirtual ~Atomic() { }\n\n\n\n\tvirtual void delta_int() {\n\n\t\tbool isDefined = this->pythonObject_ && this->deltaIntFunc_;\n\t\tif (isDefined){\n\t\t\tthis->deltaIntFunc_ (this->pythonObject_);\n\t\t\tif (PyErr_Occurred())\n\t\t\t{\n\t\t\t\tstd::string error_message = get_PyExceptionAsString();\n\t\t\t\tthrow std::runtime_error(error_message);\n\t\t\t}\n\t\t}\n\t\telse\n\t\t\tthrow std::bad_function_call();\n\n\t}\n\n\n\n\tvirtual void delta_ext (Time e, const IOBag& xb) {\n\n\t\tbool isDefined = this->pythonObject_ && this->deltaExtFunc_;\n\t\tif (isDefined){\n\t\t\tthis->deltaExtFunc_ (this->pythonObject_, e, xb);\n\t\t\tif (PyErr_Occurred())\n\t\t\t{\n\t\t\t\tstd::string error_message = get_PyExceptionAsString();\n\t\t\t\tthrow std::runtime_error(error_message);\n\t\t\t}\n\t\t}\n\t\telse\n\t\t\tthrow std::bad_function_call();\n\n\t}\n\n\n\n\tvirtual void delta_conf (const IOBag& xb) {\n\n\t\tbool isDefined = this->pythonObject_ && this->deltaConfFunc_;\n\t\tif (isDefined){\n\t\t\tthis->deltaConfFunc_ (this->pythonObject_, xb);\n\t\t\tif (PyErr_Occurred())\n\t\t\t{\n\t\t\t\tstd::string error_message = get_PyExceptionAsString();\n\t\t\t\tthrow std::runtime_error(error_message);\n\t\t\t}\n\t\t}\n\t\telse\n\t\t\tthrow std::bad_function_call();\n\t}\n\n\n\n\tvirtual void output_func (IOBag& yb) {\n\n\t\tbool isDefined = this->pythonObject_ && this->outputFunc_;\n\t\tif (isDefined)\n\t\t{\n\t\t\tthis->outputFunc_ (this->pythonObject_, yb);\n\t\t\tif (PyErr_Occurred())\n\t\t\t{\n\t\t\t\tstd::string error_message = get_PyExceptionAsString();\n\t\t\t\tthrow std::runtime_error(error_message);\n\t\t\t}\n\t\t}\n\t\telse\n\t\t{\n\t\t\tthrow std::bad_function_call();\n\t\t}\n\n\t}\n\n\n\n\tvirtual Time ta() {\n\n\t\tbool isDefined = this->pythonObject_ && this->taFunc_;\n\t\tif (isDefined)\n\t\t\treturn this->taFunc_ (this->pythonObject_);\n\t\telse\n\t\t\tthrow std::bad_function_call();\n\n\t}\n\n\n\n\t\/*\n\t\tgarbage collection\n\t\t\n\t\tDecrease reference counters of all Python objects\n\t*\/\n\tvirtual void gc_output (IOBag& g) {\n\n\t\tfor (auto& portValue : g) {\n\t\t\tPy_CLEAR (portValue.value);\n\t\t}\n\n\t}\n\n\n\n\tPyObject* getPythonObject() const {\n\n\t\treturn this->pythonObject_;\n\n\t}\n\n\n\tstd::string get_PyExceptionAsString()\n\t{\n\t\t\/\/ now we will try to get the python traceback.\n\t\t\/\/ see https:\/\/stackoverflow.com\/questions\/1796510\/accessing-a-python-traceback-from-the-c-api\n\t\t\/\/ for longer discussion on how to do it.\n\t\tPyObject *ptype, *pvalue, *ptraceback;\n\t\tPyObject *pystr, *pystr_unic;\n\n std::string error_desc;\n\t\tPyErr_Fetch(&ptype, &pvalue, &ptraceback);\n if (pvalue == NULL){\n error_desc = {\"No information on the occured exception available\"};\n }\n else {\n \t\tpystr = PyObject_Str(pvalue);\n\t \tpystr_unic = PyUnicode_AsEncodedString(pystr, \"utf-8\", \"ignore\");\n\t\t error_desc = {PyBytes_AsString(pystr_unic)};\n\n Py_XDECREF(pystr);\n\t \tPy_XDECREF(pystr_unic);\n }\n\t\tPy_XDECREF(ptype);\n\t\tPy_XDECREF(pvalue);\n\t\tPy_XDECREF(ptraceback);\n\n\t\treturn \"Python traceback follows:\\n\" + error_desc;\n\t}\n\nprivate:\n\n\tPyObject* const pythonObject_;\n\tconst DeltaIntFunc deltaIntFunc_;\n\tconst DeltaExtFunc deltaExtFunc_;\n\tconst DeltaConfFunc deltaConfFunc_;\n\tconst OutputFunc outputFunc_;\n\tconst TaFunc taFunc_;\n};\n\n\n\n\/**\n * C++ wrapper class for Digraph\n *\/\nclass Digraph {\n\npublic:\n\n\ttypedef adevs::Set<Devs*> Components;\n\n\n\n\t\/*\n\t\tConstructor\n\t*\/\n\texplicit Digraph() : base_() {}\n\n\n\n\tDigraphBase& getBase() {\n\n\t\treturn this->base_;\n\n\t}\n\n\n\n\t\/**\n\t * Add a DEVS model to the Digraph\n\t *\n\t * Currently, only atomic models are implemented.\n\t *\/\n\tvoid add (Atomic* model) {\n\n\t\tthis->base_.add (model);\n\n\t}\n\n\n\n\t\/**\n\t * Couple components\n\t *\n\t * Currently, only atomic models are implemented.\n\t *\/\n\tvoid couple(\n\t\tAtomic* source, Port source_port, \n\t\tAtomic* destination, Port destination_port\n\t)\n\t{\n\n\t\tthis->base_.couple(\n\t\t\tsource, source_port,\n\t\t\tdestination, destination_port\n\t\t);\n\n\t}\n\n\n\n\tvoid getComponents (Components& components) {\n\n\t\tthis->base_.getComponents (components);\n\n\t}\n\t\n\n\nprivate:\n\n\tDigraphBase base_;\n\n};\n\n\n\n\/**\n * C++ wrapper class for Simulator\n *\/\nclass Simulator {\n\npublic:\n\n\t\/**\n\t * Constructors\n\t *\/\n\texplicit Simulator (Devs* model) : base_(model) {}\n\n\n\n\texplicit Simulator (Atomic* model) : base_(model) {}\n\n\n\n\texplicit Simulator (Digraph* digraph)\n\t: base_ (&digraph->getBase())\n\t{}\n\n\n\n\tSimulatorBase& getBase() {\n\n\t\treturn this->base_;\n\n\t}\n\n\n\n\tTime nextEventTime() {\n\n\t\treturn this->base_.nextEventTime();\n\n\t}\n\n\n\n\tvoid executeNextEvent() {\n\n\t\tthis->base_.execNextEvent();\n\n\t}\n\n\n\n\tvoid executeUntil (Time tEnd) {\n\n\t\tthis->base_.execUntil (tEnd);\n\n\t}\n\n\n\nprivate:\n\n\tSimulatorBase base_;\n\n};\n\n\n\n} \/\/ namespace pydevs\n\n\n\n# endif \/\/ ADEVS_PYTHON_HPP\n<commit_msg>tab\/space problems again<commit_after>\/*\n\n Copyright 2014 The pydevs Developers\n\n Licensed under the Apache License, Version 2.0 (the \"License\");\n you may not use this file except in compliance with the License.\n You may obtain a copy of the License at\n\n http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n\n Unless required by applicable law or agreed to in writing, software\n distributed under the License is distributed on an \"AS IS\" BASIS,\n WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n See the License for the specific language governing permissions and\n limitations under the License.\n\n*\/\n\n#ifndef ADEVS_PYTHON_HPP\n#define ADEVS_PYTHON_HPP\n\n#include <functional>\n\n#include <Python.h>\n\n#include \"adevs.h\"\n#include<iostream>\n\n\nnamespace pydevs {\n\n\n\ntypedef PyObject* Value;\ntypedef int Port;\ntypedef adevs::PortValue<Value, Port> PortValue;\ntypedef adevs::Bag<PortValue> IOBag;\ntypedef double Time;\ntypedef adevs::Atomic<PortValue, Time> AtomicBase;\ntypedef adevs::Digraph<Value, Port, Time> DigraphBase;\ntypedef adevs::Devs<PortValue, Time> Devs;\ntypedef adevs::Simulator<PortValue, Time> SimulatorBase;\n\ntypedef void (*DeltaIntFunc)(PyObject*);\ntypedef void (*DeltaExtFunc)(PyObject*, Time, const IOBag&);\ntypedef void (*DeltaConfFunc)(PyObject*, const IOBag&);\ntypedef void (*OutputFunc)(PyObject*, IOBag&);\ntypedef Time (*TaFunc)(PyObject*);\n\n\n\n\/**\n *\tC++ wrapper class which implements the virtual functions\n *\tof the adevs Atomic model\n*\/\nclass Atomic: public AtomicBase {\n\npublic:\n\n\texplicit Atomic(\n\t\tPyObject* pythonObject,\n\t\tDeltaIntFunc deltaIntFunc,\n\t\tDeltaExtFunc deltaExtFunc,\n\t\tDeltaConfFunc deltaConfFunc,\n\t\tOutputFunc outputFunc,\n\t\tTaFunc taFunc\n\t)\n\t: \tAtomicBase(),\n\t\tpythonObject_ (pythonObject),\n\t\tdeltaIntFunc_ (deltaIntFunc),\n\t\tdeltaExtFunc_ (deltaExtFunc),\n\t\tdeltaConfFunc_ (deltaConfFunc),\n\t\toutputFunc_ (outputFunc),\n\t\ttaFunc_ (taFunc)\n\t{ }\t\n\n\n\n\t\/**\n\t * Destructor\n\t *\/\n\tvirtual ~Atomic() { }\n\n\n\n\tvirtual void delta_int() {\n\n\t\tbool isDefined = this->pythonObject_ && this->deltaIntFunc_;\n\t\tif (isDefined){\n\t\t\tthis->deltaIntFunc_ (this->pythonObject_);\n\t\t\tif (PyErr_Occurred())\n\t\t\t{\n\t\t\t\tstd::string error_message = get_PyExceptionAsString();\n\t\t\t\tthrow std::runtime_error(error_message);\n\t\t\t}\n\t\t}\n\t\telse\n\t\t\tthrow std::bad_function_call();\n\n\t}\n\n\n\n\tvirtual void delta_ext (Time e, const IOBag& xb) {\n\n\t\tbool isDefined = this->pythonObject_ && this->deltaExtFunc_;\n\t\tif (isDefined){\n\t\t\tthis->deltaExtFunc_ (this->pythonObject_, e, xb);\n\t\t\tif (PyErr_Occurred())\n\t\t\t{\n\t\t\t\tstd::string error_message = get_PyExceptionAsString();\n\t\t\t\tthrow std::runtime_error(error_message);\n\t\t\t}\n\t\t}\n\t\telse\n\t\t\tthrow std::bad_function_call();\n\n\t}\n\n\n\n\tvirtual void delta_conf (const IOBag& xb) {\n\n\t\tbool isDefined = this->pythonObject_ && this->deltaConfFunc_;\n\t\tif (isDefined){\n\t\t\tthis->deltaConfFunc_ (this->pythonObject_, xb);\n\t\t\tif (PyErr_Occurred())\n\t\t\t{\n\t\t\t\tstd::string error_message = get_PyExceptionAsString();\n\t\t\t\tthrow std::runtime_error(error_message);\n\t\t\t}\n\t\t}\n\t\telse\n\t\t\tthrow std::bad_function_call();\n\t}\n\n\n\n\tvirtual void output_func (IOBag& yb) {\n\n\t\tbool isDefined = this->pythonObject_ && this->outputFunc_;\n\t\tif (isDefined)\n\t\t{\n\t\t\tthis->outputFunc_ (this->pythonObject_, yb);\n\t\t\tif (PyErr_Occurred())\n\t\t\t{\n\t\t\t\tstd::string error_message = get_PyExceptionAsString();\n\t\t\t\tthrow std::runtime_error(error_message);\n\t\t\t}\n\t\t}\n\t\telse\n\t\t{\n\t\t\tthrow std::bad_function_call();\n\t\t}\n\n\t}\n\n\n\n\tvirtual Time ta() {\n\n\t\tbool isDefined = this->pythonObject_ && this->taFunc_;\n\t\tif (isDefined)\n\t\t\treturn this->taFunc_ (this->pythonObject_);\n\t\telse\n\t\t\tthrow std::bad_function_call();\n\n\t}\n\n\n\n\t\/*\n\t\tgarbage collection\n\t\t\n\t\tDecrease reference counters of all Python objects\n\t*\/\n\tvirtual void gc_output (IOBag& g) {\n\n\t\tfor (auto& portValue : g) {\n\t\t\tPy_CLEAR (portValue.value);\n\t\t}\n\n\t}\n\n\n\n\tPyObject* getPythonObject() const {\n\n\t\treturn this->pythonObject_;\n\n\t}\n\n\n\tstd::string get_PyExceptionAsString()\n\t{\n\t\t\/\/ now we will try to get the python traceback.\n\t\t\/\/ see https:\/\/stackoverflow.com\/questions\/1796510\/accessing-a-python-traceback-from-the-c-api\n\t\t\/\/ for longer discussion on how to do it.\n\t\tPyObject *ptype, *pvalue, *ptraceback;\n\t\tPyObject *pystr, *pystr_unic;\n\n\t\tstd::string error_desc;\n\t\tPyErr_Fetch(&ptype, &pvalue, &ptraceback);\n\t\tif (pvalue == NULL){\n\t\t\terror_desc = {\"No information on the occured exception available\"};\n\t\t}\n\t\telse {\n\t\t\tpystr = PyObject_Str(pvalue);\n\t\t\tpystr_unic = PyUnicode_AsEncodedString(pystr, \"utf-8\", \"ignore\");\n\t\t\terror_desc = {PyBytes_AsString(pystr_unic)};\n\n\t\t\tPy_XDECREF(pystr);\n\t\t\tPy_XDECREF(pystr_unic);\n\t\t}\n\t\tPy_XDECREF(ptype);\n\t\tPy_XDECREF(pvalue);\n\t\tPy_XDECREF(ptraceback);\n\n\t\treturn \"Python traceback follows:\\n\" + error_desc;\n\t}\n\nprivate:\n\n\tPyObject* const pythonObject_;\n\tconst DeltaIntFunc deltaIntFunc_;\n\tconst DeltaExtFunc deltaExtFunc_;\n\tconst DeltaConfFunc deltaConfFunc_;\n\tconst OutputFunc outputFunc_;\n\tconst TaFunc taFunc_;\n};\n\n\n\n\/**\n * C++ wrapper class for Digraph\n *\/\nclass Digraph {\n\npublic:\n\n\ttypedef adevs::Set<Devs*> Components;\n\n\n\n\t\/*\n\t\tConstructor\n\t*\/\n\texplicit Digraph() : base_() {}\n\n\n\n\tDigraphBase& getBase() {\n\n\t\treturn this->base_;\n\n\t}\n\n\n\n\t\/**\n\t * Add a DEVS model to the Digraph\n\t *\n\t * Currently, only atomic models are implemented.\n\t *\/\n\tvoid add (Atomic* model) {\n\n\t\tthis->base_.add (model);\n\n\t}\n\n\n\n\t\/**\n\t * Couple components\n\t *\n\t * Currently, only atomic models are implemented.\n\t *\/\n\tvoid couple(\n\t\tAtomic* source, Port source_port, \n\t\tAtomic* destination, Port destination_port\n\t)\n\t{\n\n\t\tthis->base_.couple(\n\t\t\tsource, source_port,\n\t\t\tdestination, destination_port\n\t\t);\n\n\t}\n\n\n\n\tvoid getComponents (Components& components) {\n\n\t\tthis->base_.getComponents (components);\n\n\t}\n\t\n\n\nprivate:\n\n\tDigraphBase base_;\n\n};\n\n\n\n\/**\n * C++ wrapper class for Simulator\n *\/\nclass Simulator {\n\npublic:\n\n\t\/**\n\t * Constructors\n\t *\/\n\texplicit Simulator (Devs* model) : base_(model) {}\n\n\n\n\texplicit Simulator (Atomic* model) : base_(model) {}\n\n\n\n\texplicit Simulator (Digraph* digraph)\n\t: base_ (&digraph->getBase())\n\t{}\n\n\n\n\tSimulatorBase& getBase() {\n\n\t\treturn this->base_;\n\n\t}\n\n\n\n\tTime nextEventTime() {\n\n\t\treturn this->base_.nextEventTime();\n\n\t}\n\n\n\n\tvoid executeNextEvent() {\n\n\t\tthis->base_.execNextEvent();\n\n\t}\n\n\n\n\tvoid executeUntil (Time tEnd) {\n\n\t\tthis->base_.execUntil (tEnd);\n\n\t}\n\n\n\nprivate:\n\n\tSimulatorBase base_;\n\n};\n\n\n\n} \/\/ namespace pydevs\n\n\n\n# endif \/\/ ADEVS_PYTHON_HPP\n<|endoftext|>"} {"text":"<commit_before>#include \"testApp.h\"\n\n\/\/--------------------------------------------------------------\nvoid testApp::setup(){\n ofEnableAntiAliasing();\n ofSetVerticalSync( true );\n ofSetFrameRate( 30 );\n \n #ifdef DISABLE_STREAMING\n cout << \"Disabled streaming: compile with 'Release' to enable\" << endl;\n #else\n cout << \"Enabled streaming: compile with 'Release NoStream' to disable\" << endl;\n #endif\n\n ofSetLogLevel( OF_LOG_WARNING );\n w = 640;\n h = 480;\n int flowW = w\/4;\n int flowH = h\/4;\n \n videoFeedController.init();\n \n vfx1.init();\n vfx1.setVideoSource( videoFeedController.videoSource );\n \n vfx1.setColor( colors[colorIndex] );\n \n big = &vfx1;\n \n videoFXExporter.setVideoFX( &vfx1 );\n \n overlay.init();\n \n websystemController.setVideoFX( &vfx1 );\n websystemController.setOverlay( &overlay );\n websystemController.init();\n \n\n#ifndef DISABLE_STREAMING\n \/\/ MULTI STREAMER\n \/\/ --------------------------------------------------\n int fps = 15;\n if(!streamer.setup(\"streamer.xml\", ofGetWidth(), ofGetHeight(), fps)) {\n printf(\"error: cannot setup the streamer.\\n\");\n ::exit(EXIT_FAILURE);\n }\n\n if(!streamer.start()) {\n printf(\"error: cannot start the streamer.\\n\");\n ::exit(EXIT_FAILURE);\n }\n\n sound_stream.listDevices();\n sound_stream.setup(this, 0, 2, 44100, 1024, 4);\n#endif\n \n}\n\nvoid testApp::audioIn(float* input, int nsize, int nchannels) {\n \n#ifndef DISABLE_STREAMING\n size_t nsamples = nsize * nchannels;\n for(size_t i = 0; i < nsamples; ++i) {\n input[i] *= 32768.0f;\n }\n\n \/\/streamer.addAudio(input, nsize, nchannels);\n#endif\n}\n\n\/\/--------------------------------------------------------------\nvoid testApp::update(){\n if (ofGetElapsedTimef() < 2.0f) { return; }\n \n#ifndef DISABLE_STREAMING\n streamer.update();\n#endif\n \n websystemController.update();\n \n videoFeedController.update();\n \n vfx1.setVideoSource( videoFeedController.videoSource );\n vfx1.update( videoFeedController.videoSource->isFrameNew() );\n \n overlay.update();\n}\n\n\/\/--------------------------------------------------------------\nvoid testApp::draw(){\n if (ofGetElapsedTimef() < 2.0f) { return; }\n \n#ifndef DISABLE_STREAMING\n if(streamer.wantsNewFrame()) {\n streamer.beginGrab();\n drawInternal();\n streamer.endGrab();\n }\n#endif\n\n drawInternal();\n cout << \"framerate \" << ofGetFrameRate() << endl;\n}\n\nvoid testApp::drawInternal() {\n \n big->draw( ofGetWidth(), 0, -ofGetWidth(), ofGetHeight() );\n \n overlay.draw();\n \n \/\/ Screen shot saving\n string nextScreenshotName = websystemController.getNextScreenShotFilename();\n if ( nextScreenshotName != \"\" ) {\n glBindFramebuffer(GL_FRAMEBUFFER, 0);\n glReadBuffer(GL_BACK);\n glPixelStorei(GL_PACK_ALIGNMENT, 4);\n \/\/Saving\n ofSaveViewport(\"screenshots\/\" + nextScreenshotName + \".png\");\n \/\/ofSaveScreen( \"screenshots\/\" + nextScreenshotName + \".png\");\n }\n}\n\n\/\/--------------------------------------------------------------\nvoid testApp::keyPressed(int key) {\n \n cout << key << endl;\n \n if ( key == 'a' ) {\n overlay.voteDisplay.addVote( overlay.voteDisplay.topic1 );\n }\n else if ( key == 'b' ) {\n overlay.voteDisplay.addVote( overlay.voteDisplay.topic2 );\n }\n \n if ( key == 'k' ) {\n vfx1.reloadShaders();\n }\n else if ( key == 161 ) { \/\/ tilda key\n big->hideGUI();\n videoFXExporter.exporterGUI->setVisible( false );\n overlay.overlayGUI->setVisible( false );\n }\n else if ( key == '1' ) {\n big = &vfx1;\n big->showGUI();\n videoFXExporter.exporterGUI->setVisible( true );\n overlay.overlayGUI->setVisible( true );\n }\n else if ( key == 45 ) {\n if ( --colorIndex < 0 )\n colorIndex = 6;\n vfx1.setColor( colors[colorIndex] );\n }\n else if ( key == 61 ) {\n if ( ++colorIndex > 6 )\n colorIndex = 0;\n vfx1.setColor( colors[colorIndex] );\n }\n}\n\n\/\/--------------------------------------------------------------\nvoid testApp::keyReleased(int key){\n\n}\n\n\/\/--------------------------------------------------------------\nvoid testApp::windowResized(int w, int h){\n\n}\n\n\/\/--------------------------------------------------------------\nvoid testApp::gotMessage(ofMessage msg){\n\n}\n\n\/\/--------------------------------------------------------------\nvoid testApp::dragEvent(ofDragInfo dragInfo){\n \n}\n\nvoid testApp::exit() {\n vfx1.exit();\n videoFXExporter.exporterGUI->saveSettings(\"GUI\/exporter.xml\");\n overlay.overlayGUI->saveSettings( \"GUI\/overlay.xml\" );\n}\n<commit_msg>Removed legacy<commit_after>#include \"testApp.h\"\n\n\/\/--------------------------------------------------------------\nvoid testApp::setup(){\n ofEnableAntiAliasing();\n ofSetVerticalSync( true );\n ofSetFrameRate( 30 );\n \n #ifdef DISABLE_STREAMING\n cout << \"Disabled streaming: compile with 'Release' to enable\" << endl;\n #else\n cout << \"Enabled streaming: compile with 'Release NoStream' to disable\" << endl;\n #endif\n\n ofSetLogLevel( OF_LOG_WARNING );\n \n videoFeedController.init();\n \n vfx1.init();\n vfx1.setVideoSource( videoFeedController.videoSource );\n \n vfx1.setColor( colors[colorIndex] );\n \n big = &vfx1;\n \n videoFXExporter.setVideoFX( &vfx1 );\n \n overlay.init();\n \n websystemController.setVideoFX( &vfx1 );\n websystemController.setOverlay( &overlay );\n websystemController.init();\n \n\n#ifndef DISABLE_STREAMING\n \/\/ MULTI STREAMER\n \/\/ --------------------------------------------------\n int fps = 15;\n if(!streamer.setup(\"streamer.xml\", ofGetWidth(), ofGetHeight(), fps)) {\n printf(\"error: cannot setup the streamer.\\n\");\n ::exit(EXIT_FAILURE);\n }\n\n if(!streamer.start()) {\n printf(\"error: cannot start the streamer.\\n\");\n ::exit(EXIT_FAILURE);\n }\n\n sound_stream.listDevices();\n sound_stream.setup(this, 0, 2, 44100, 1024, 4);\n#endif\n \n}\n\nvoid testApp::audioIn(float* input, int nsize, int nchannels) {\n \n#ifndef DISABLE_STREAMING\n size_t nsamples = nsize * nchannels;\n for(size_t i = 0; i < nsamples; ++i) {\n input[i] *= 32768.0f;\n }\n\n \/\/streamer.addAudio(input, nsize, nchannels);\n#endif\n}\n\n\/\/--------------------------------------------------------------\nvoid testApp::update(){\n if (ofGetElapsedTimef() < 2.0f) { return; }\n \n#ifndef DISABLE_STREAMING\n streamer.update();\n#endif\n \n websystemController.update();\n \n videoFeedController.update();\n \n vfx1.setVideoSource( videoFeedController.videoSource );\n vfx1.update( videoFeedController.videoSource->isFrameNew() );\n \n overlay.update();\n}\n\n\/\/--------------------------------------------------------------\nvoid testApp::draw(){\n if (ofGetElapsedTimef() < 2.0f) { return; }\n \n#ifndef DISABLE_STREAMING\n if(streamer.wantsNewFrame()) {\n streamer.beginGrab();\n drawInternal();\n streamer.endGrab();\n }\n#endif\n\n drawInternal();\n cout << \"framerate \" << ofGetFrameRate() << endl;\n}\n\nvoid testApp::drawInternal() {\n \n big->draw( ofGetWidth(), 0, -ofGetWidth(), ofGetHeight() );\n \n overlay.draw();\n \n \/\/ Screen shot saving\n string nextScreenshotName = websystemController.getNextScreenShotFilename();\n if ( nextScreenshotName != \"\" ) {\n glBindFramebuffer(GL_FRAMEBUFFER, 0);\n glReadBuffer(GL_BACK);\n glPixelStorei(GL_PACK_ALIGNMENT, 4);\n \/\/Saving\n ofSaveViewport(\"screenshots\/\" + nextScreenshotName + \".png\");\n \/\/ofSaveScreen( \"screenshots\/\" + nextScreenshotName + \".png\");\n }\n}\n\n\/\/--------------------------------------------------------------\nvoid testApp::keyPressed(int key) {\n \n cout << key << endl;\n \n if ( key == 'a' ) {\n overlay.voteDisplay.addVote( overlay.voteDisplay.topic1 );\n }\n else if ( key == 'b' ) {\n overlay.voteDisplay.addVote( overlay.voteDisplay.topic2 );\n }\n \n if ( key == 'k' ) {\n vfx1.reloadShaders();\n }\n else if ( key == 161 ) { \/\/ tilda key\n big->hideGUI();\n videoFXExporter.exporterGUI->setVisible( false );\n overlay.overlayGUI->setVisible( false );\n }\n else if ( key == '1' ) {\n big = &vfx1;\n big->showGUI();\n videoFXExporter.exporterGUI->setVisible( true );\n overlay.overlayGUI->setVisible( true );\n }\n else if ( key == 45 ) {\n if ( --colorIndex < 0 )\n colorIndex = 6;\n vfx1.setColor( colors[colorIndex] );\n }\n else if ( key == 61 ) {\n if ( ++colorIndex > 6 )\n colorIndex = 0;\n vfx1.setColor( colors[colorIndex] );\n }\n}\n\n\/\/--------------------------------------------------------------\nvoid testApp::keyReleased(int key){\n\n}\n\n\/\/--------------------------------------------------------------\nvoid testApp::windowResized(int w, int h){\n\n}\n\n\/\/--------------------------------------------------------------\nvoid testApp::gotMessage(ofMessage msg){\n\n}\n\n\/\/--------------------------------------------------------------\nvoid testApp::dragEvent(ofDragInfo dragInfo){\n \n}\n\nvoid testApp::exit() {\n vfx1.exit();\n videoFXExporter.exporterGUI->saveSettings(\"GUI\/exporter.xml\");\n overlay.overlayGUI->saveSettings( \"GUI\/overlay.xml\" );\n}\n<|endoftext|>"} {"text":"<commit_before>\/* ========================================\n\n ID: mathema6\n TASK: B2\n LANG: C++14\n\n * File Name : B2.cpp\n * Creation Date : 15-07-2021\n * Last Modified : Thu 15 Jul 2021 12:45:26 AM CEST\n * Created By : Karel Ha <mathemage@gmail.com>\n * URL : https:\/\/codingcompetitions.withgoogle.com\/kickstart\/round\/00000000004361e3\/000000000082b933\n * Points\/Time :\n * +16m\n * +\n *\n * Total\/ETA : 17m\n * Status :\n *\n ==========================================*\/\n\n#define PROBLEMNAME \"B2\"\n\n#include <bits\/stdc++.h>\n\nusing namespace std;\n\n#define endl \"\\n\"\n#define REP(i,n) for(ll i=0;i<(n);i++)\n#define FOR(i,a,b) for(ll i=(a);i<=(b);i++)\n#define FORD(i,a,b) for(ll i=(a);i>=(b);i--)\n#define REPi(i,n) for(int i=0;i<(n);i++)\n#define FORi(i,a,b) for(int i=(a);i<=(b);i++)\n#define FORDi(i,a,b) for(int i=(a);i>=(b);i--)\n#define ALL(A) (A).begin(), (A).end()\n#define REVALL(A) (A).rbegin(), (A).rend()\n#define F first\n#define S second\n#define PB push_back\n#define MP make_pair\n#define MTP make_tuple\n#define SGN(X) ((X) ? ( (X)>0?1:-1 ) : 0)\n#define CONTAINS(S,E) ((S).find(E) != (S).end())\n#define SZ(x) ((int) (x).size())\n#define YES cout << \"YES\" << endl;\n#define NO cout << \"NO\" << endl;\n#define YN(b) cout << ((b)?\"YES\":\"NO\") << endl;\n#define Yes cout << \"Yes\" << endl;\n#define No cout << \"No\" << endl;\n#define Yn(b) cout << ((b)?\"Yes\":\"No\") << endl;\n\nusing ll = long long;\nusing ul = unsigned long long;\nusing llll = pair<ll, ll>;\nusing ulul = pair<ul, ul>;\nusing ld = long double;\n\n#ifdef ONLINE_JUDGE\n #undef MATHEMAGE_DEBUG\n#endif\n\n#ifdef MATHEMAGE_DEBUG\n #define MSG(a) cerr << \"> \" << (#a) << \": \" << (a) << endl;\n #define MSG_VEC_VEC(v) cerr << \"> \" << (#v) << \":\\n\" << (v) << endl;\n #define LINESEP1 cerr << \"----------------------------------------------- \" << endl;\n #define LINESEP2 cerr << \"_________________________________________________________________\" << endl;\n#else\n #define MSG(a)\n #define MSG_VEC_VEC(v)\n #define LINESEP1\n #define LINESEP2\n#endif\n\nostream& operator<<(ostream& os, const vector<string> & vec) { os << endl; for (const auto & s: vec) os << s << endl; return os; }\n\ntemplate<typename T> \nostream& operator<<(ostream& os, const vector<T> & vec) { for (const auto & x: vec) os << x << \" \"; return os; } \n\ntemplate<typename T> \nostream& operator<<(ostream& os, const vector<vector<T>> & vec) { for (const auto & v: vec) os << v << endl; return os; } \n\ntemplate<typename T>\ninline ostream& operator<<(ostream& os, const vector<vector<vector<T>>> & vec) {\n for (const auto & row: vec) {\n for (const auto & col: row) {\n os << \"[ \" << col << \"] \";\n }\n os << endl;\n }\n return os;\n}\n\ntemplate<typename T, class Compare>\nostream& operator<<(ostream& os, const set<T, Compare>& vec) { for (const auto & x: vec) os << x << \" \"; os << endl; return os; } \n\ntemplate<typename T, class Compare>\nostream& operator<<(ostream& os, const multiset<T, Compare>& vec) { for (const auto & x: vec) os << x << \" \"; os << endl; return os; }\n\ntemplate<typename T1, typename T2> \nostream& operator<<(ostream& os, const map<T1, T2>& vec) { for (const auto & x: vec) os << x.F << \":\" << x.S << \" | \"; return os; }\n\ntemplate<typename T1, typename T2> \nostream& operator<<(ostream& os, const map<T1, T2, greater<T1>>& vec) { for (const auto & x: vec) os << x.F << \":\" << x.S << \" | \"; return os; }\n\ntemplate<typename T1, typename T2>\nostream& operator<<(ostream& os, const unordered_map<T1, T2>& vec) { for (const auto & x: vec) os << x.F << \":\" << x.S << \" | \"; return os; }\n\ntemplate<typename T1, typename T2> \nostream& operator<<(ostream& os, const pair<T1, T2>& p) { return os << \"(\" << p.F << \", \" << p.S << \")\"; }\n\ntemplate<typename T>\nistream& operator>>(istream& is, vector<T> & vec) { for (auto & x: vec) is >> x; return is; }\n\ntemplate<typename T>\ninline bool bounded(const T & x, const T & u, const T & l=0) { return min(l,u)<=x && x<max(l,u); }\n\ntemplate<class T> bool umin(T& a, const T& b) { return b < a ? a = b, 1 : 0; }\ntemplate<class T> bool umax(T& a, const T& b) { return a < b ? a = b, 1 : 0; }\n\ninline bool eqDouble(double a, double b) { return fabs(a-b) < 1e-9; }\n\nconst int CLEAN = -1;\nconst int UNDEF = -42;\nconst long long MOD = 1000000007;\nconst double EPS = 1e-8;\n\nconst int INF = INT_MAX;\nconst long long INF_LL = LLONG_MAX;\nconst long long INF_ULL = ULLONG_MAX;\n\nconst vector<int> DX4 = {0, 1, 0, -1};\nconst vector<int> DY4 = {1, 0, -1, 0};\nconst vector<pair<int,int>> DXY4 = { {0,1}, {1,0}, {0,-1}, {-1,0} };\nconst string dues=\"NESW\";\n\nconst vector<int> DX8 = {-1, -1, -1, 0, 0, 1, 1, 1};\nconst vector<int> DY8 = {-1, 0, 1, -1, 1, -1, 0, 1};\nconst vector<pair<int,int>> DXY8 = {\n {-1,-1}, {-1,0}, {-1,1},\n { 0,-1}, { 0,1},\n { 1,-1}, { 1,0}, { 1,1}\n};\n\n\n#ifndef MATHEMAGE_LOCAL\nvoid setIO(string filename) { \/\/ the argument is the filename without the extension\n\tfreopen((filename+\".in\").c_str(), \"r\", stdin);\n\tfreopen((filename+\".out\").c_str(), \"w\", stdout);\n MSG(filename);\n}\n#endif\n\nvoid solve() {\n ll N,C; cin >> N >> C;\n MSG(N); MSG(C); LINESEP1;\n\n ll Li,Ri;\n map<ll, ll> balance;\n map<ll, ll> boundary2count;\n REP(_,N) {\n cin >> Li >> Ri;\n balance[Li]++;\n balance[Ri]--;\n\n boundary2count[Li]++;\n boundary2count[Ri]++;\n }\n MSG(balance); MSG(boundary2count); LINESEP1;\n\n map<ll, ll, greater<ll>> thick2count;\n ll prvPt=balance.begin()->F;\n ll curThickness=0;\n for (auto & ptBal: balance) {\n MSG(prvPt); MSG(curThickness);\n\n ll span=ptBal.F-prvPt-2;\n if (span>0 && curThickness>0) {\n thick2count[curThickness]+=span;\n }\n\n ll boundaryThickness = curThickness - boundary2count[ptBal.F];\n if (boundaryThickness>0) {\n thick2count[boundaryThickness]++;\n }\n\n prvPt=ptBal.F;\n curThickness+=ptBal.S;\n MSG(prvPt); MSG(curThickness);\n LINESEP1;\n }\n MSG(thick2count);\n assert(curThickness==0);\n LINESEP1;\n\n ll result = N;\n cout << result << endl;\n}\n\nint main() {\n ios_base::sync_with_stdio(0);\n cin.tie(0);\n cout << std::setprecision(10) << std::fixed;\n\n#ifndef MATHEMAGE_LOCAL\n\/\/ setIO(PROBLEMNAME);\n#endif\n\n int cases = 1;\n cin >> cases;\n FOR(tt,1,cases) {\n cout << \"Case #\" << tt << \": \";\n solve();\n LINESEP2;\n }\n return 0;\n}\n<commit_msg>Upsolve GKickStart '21D, B. Cutting Intervals<commit_after>\/* ========================================\n\n ID: mathema6\n TASK: B2\n LANG: C++14\n\n * File Name : B2.cpp\n * Creation Date : 15-07-2021\n * Last Modified : Thu 15 Jul 2021 05:51:01 PM CEST\n * Created By : Karel Ha <mathemage@gmail.com>\n * URL : https:\/\/codingcompetitions.withgoogle.com\/kickstart\/round\/00000000004361e3\/000000000082b933\n * Points\/Time :\n * +16m\n * +10m ~ 26m\n *\n * Total\/ETA : 17m\n * Status :\n * [redesign algo]\n * S AC AC !!! yes!\n *\n ==========================================*\/\n\n#define PROBLEMNAME \"B2\"\n\n#include <bits\/stdc++.h>\n\nusing namespace std;\n\n#define endl \"\\n\"\n#define REP(i,n) for(ll i=0;i<(n);i++)\n#define FOR(i,a,b) for(ll i=(a);i<=(b);i++)\n#define FORD(i,a,b) for(ll i=(a);i>=(b);i--)\n#define REPi(i,n) for(int i=0;i<(n);i++)\n#define FORi(i,a,b) for(int i=(a);i<=(b);i++)\n#define FORDi(i,a,b) for(int i=(a);i>=(b);i--)\n#define ALL(A) (A).begin(), (A).end()\n#define REVALL(A) (A).rbegin(), (A).rend()\n#define F first\n#define S second\n#define PB push_back\n#define MP make_pair\n#define MTP make_tuple\n#define SGN(X) ((X) ? ( (X)>0?1:-1 ) : 0)\n#define CONTAINS(S,E) ((S).find(E) != (S).end())\n#define SZ(x) ((int) (x).size())\n#define YES cout << \"YES\" << endl;\n#define NO cout << \"NO\" << endl;\n#define YN(b) cout << ((b)?\"YES\":\"NO\") << endl;\n#define Yes cout << \"Yes\" << endl;\n#define No cout << \"No\" << endl;\n#define Yn(b) cout << ((b)?\"Yes\":\"No\") << endl;\n\nusing ll = long long;\nusing ul = unsigned long long;\nusing llll = pair<ll, ll>;\nusing ulul = pair<ul, ul>;\nusing ld = long double;\n\n#ifdef ONLINE_JUDGE\n #undef MATHEMAGE_DEBUG\n#endif\n\n#ifdef MATHEMAGE_DEBUG\n #define MSG(a) cerr << \"> \" << (#a) << \": \" << (a) << endl;\n #define MSG_VEC_VEC(v) cerr << \"> \" << (#v) << \":\\n\" << (v) << endl;\n #define LINESEP1 cerr << \"----------------------------------------------- \" << endl;\n #define LINESEP2 cerr << \"_________________________________________________________________\" << endl;\n#else\n #define MSG(a)\n #define MSG_VEC_VEC(v)\n #define LINESEP1\n #define LINESEP2\n#endif\n\nostream& operator<<(ostream& os, const vector<string> & vec) { os << endl; for (const auto & s: vec) os << s << endl; return os; }\n\ntemplate<typename T> \nostream& operator<<(ostream& os, const vector<T> & vec) { for (const auto & x: vec) os << x << \" \"; return os; } \n\ntemplate<typename T> \nostream& operator<<(ostream& os, const vector<vector<T>> & vec) { for (const auto & v: vec) os << v << endl; return os; } \n\ntemplate<typename T>\ninline ostream& operator<<(ostream& os, const vector<vector<vector<T>>> & vec) {\n for (const auto & row: vec) {\n for (const auto & col: row) {\n os << \"[ \" << col << \"] \";\n }\n os << endl;\n }\n return os;\n}\n\ntemplate<typename T, class Compare>\nostream& operator<<(ostream& os, const set<T, Compare>& vec) { for (const auto & x: vec) os << x << \" \"; os << endl; return os; } \n\ntemplate<typename T, class Compare>\nostream& operator<<(ostream& os, const multiset<T, Compare>& vec) { for (const auto & x: vec) os << x << \" \"; os << endl; return os; }\n\ntemplate<typename T1, typename T2> \nostream& operator<<(ostream& os, const map<T1, T2>& vec) { for (const auto & x: vec) os << x.F << \":\" << x.S << \" | \"; return os; }\n\ntemplate<typename T1, typename T2> \nostream& operator<<(ostream& os, const map<T1, T2, greater<T1>>& vec) { for (const auto & x: vec) os << x.F << \":\" << x.S << \" | \"; return os; }\n\ntemplate<typename T1, typename T2>\nostream& operator<<(ostream& os, const unordered_map<T1, T2>& vec) { for (const auto & x: vec) os << x.F << \":\" << x.S << \" | \"; return os; }\n\ntemplate<typename T1, typename T2> \nostream& operator<<(ostream& os, const pair<T1, T2>& p) { return os << \"(\" << p.F << \", \" << p.S << \")\"; }\n\ntemplate<typename T>\nistream& operator>>(istream& is, vector<T> & vec) { for (auto & x: vec) is >> x; return is; }\n\ntemplate<typename T>\ninline bool bounded(const T & x, const T & u, const T & l=0) { return min(l,u)<=x && x<max(l,u); }\n\ntemplate<class T> bool umin(T& a, const T& b) { return b < a ? a = b, 1 : 0; }\ntemplate<class T> bool umax(T& a, const T& b) { return a < b ? a = b, 1 : 0; }\n\ninline bool eqDouble(double a, double b) { return fabs(a-b) < 1e-9; }\n\nconst int CLEAN = -1;\nconst int UNDEF = -42;\nconst long long MOD = 1000000007;\nconst double EPS = 1e-8;\n\nconst int INF = INT_MAX;\nconst long long INF_LL = LLONG_MAX;\nconst long long INF_ULL = ULLONG_MAX;\n\nconst vector<int> DX4 = {0, 1, 0, -1};\nconst vector<int> DY4 = {1, 0, -1, 0};\nconst vector<pair<int,int>> DXY4 = { {0,1}, {1,0}, {0,-1}, {-1,0} };\nconst string dues=\"NESW\";\n\nconst vector<int> DX8 = {-1, -1, -1, 0, 0, 1, 1, 1};\nconst vector<int> DY8 = {-1, 0, 1, -1, 1, -1, 0, 1};\nconst vector<pair<int,int>> DXY8 = {\n {-1,-1}, {-1,0}, {-1,1},\n { 0,-1}, { 0,1},\n { 1,-1}, { 1,0}, { 1,1}\n};\n\n\n#ifndef MATHEMAGE_LOCAL\nvoid setIO(string filename) { \/\/ the argument is the filename without the extension\n\tfreopen((filename+\".in\").c_str(), \"r\", stdin);\n\tfreopen((filename+\".out\").c_str(), \"w\", stdout);\n MSG(filename);\n}\n#endif\n\n#define OP first\n#define CL second\n\nvoid solve() {\n ll N,C; cin >> N >> C;\n MSG(N); MSG(C); LINESEP1;\n\n ll Li,Ri;\n map<ll, llll> balance;\n set<long long> pts;\n REP(_,N) {\n cin >> Li >> Ri;\n balance[Li].OP++;\n balance[Ri].CL++;\n\n pts.insert(Li);\n pts.insert(Ri);\n }\n MSG(balance); MSG(pts); LINESEP1;\n\n map<ll, ll, greater<ll>> thick2count;\n ll prvPt=UNDEF;\n ll curThickness=0;\n for (auto & pt: pts) {\n MSG(prvPt); MSG(curThickness);\n\n \/\/ interior\n ll span=pt-prvPt-1;\n if (span>0 && curThickness>0) {\n thick2count[curThickness]+=span;\n }\n\n \/\/ boundary\n curThickness-=balance[pt].CL;\n if (curThickness>0) {\n thick2count[curThickness]++;\n }\n\n prvPt=pt;\n curThickness+=balance[pt].OP;\n MSG(prvPt); MSG(curThickness);\n LINESEP1;\n }\n MSG(thick2count);\n assert(curThickness==0);\n LINESEP1;\n\n ll result = N;\n for (auto & thickCnt: thick2count) {\n ll delta=min(C, thickCnt.S);\n\n result+=delta*thickCnt.F;\n\n C-=delta;\n if (C<=0) {\n break;\n }\n }\n\n cout << result << endl;\n}\n\nint main() {\n ios_base::sync_with_stdio(0);\n cin.tie(0);\n cout << std::setprecision(10) << std::fixed;\n\n#ifndef MATHEMAGE_LOCAL\n\/\/ setIO(PROBLEMNAME);\n#endif\n\n int cases = 1;\n cin >> cases;\n FOR(tt,1,cases) {\n cout << \"Case #\" << tt << \": \";\n solve();\n LINESEP2;\n }\n return 0;\n}\n<|endoftext|>"} {"text":"<commit_before>#include \"ncd_gateway.h\"\n#include \"S3B.h\"\n#include \"spark_wiring_eeprom.h\"\n\nS3B sModule;\nString eventReturns[5];\nunsigned long tOut = 3000;\n\n\/\/int s3b(JsonObject& root);\n\nvoid init_gateway(){\n Particle.function(\"deviceComm\", gatewayCommand);\n Particle.subscribe(\"ncd_deviceCom\", commandHandler, MY_DEVICES);\n Serial1.begin(115200);\n Wire.begin();\n}\n\nint gatewayCommand(String arg){\n int length = arg.length();\n \n byte bytes[length+1];\n \n arg.getBytes(bytes, length+1);\n \n int newLen = (length\/2)+1;\n \n byte newBytes[newLen];\n \n int ind = 0;\n \n for(int i=0;i<length;i+=2){\n if(i>0){\n ind=i\/2;\n }\n int b1=(bytes[i]-32) << 4;\n int b2=bytes[i+1]-32;\n newBytes[ind]=b1+b2;\n }\n \/\/send int pointer for setting to allow me to test how to return results?\n return ncdApi(newBytes);\n}\n\nvoid commandHandler(const char *event, const char *data){\n Serial.println(\"Got Event \"+String(event));\n String newCommand = String(data);\n gatewayCommand(newCommand);\n}\nint ncdApi(byte packetBytes[]){\n int buffLen = 1;\n Serial.println(String(packetBytes[0]));\n switch(packetBytes[0]){\n case 187:\n {\n \/\/packet of packets\n int i=2;\n int max;\n for(int pn = 0; pn<packetBytes[1]; pn++){\n \n max=i+packetBytes[i];\n Serial.println(max);\n byte intPacket[packetBytes[i]];\n i++;\n int ni=0;\n for(i;i<=max;i++){\n intPacket[ni]=packetBytes[i];\n ni++;\n }\n ncdApi(intPacket);\n }\n break;\n }\n case 188:\n {\n \/\/plain i2c w\/r command\n if(packetBytes[3] > 0){\n buffLen = packetBytes[3];\n }\n byte buff[buffLen];\n i2c_command(packetBytes, buff);\n break;\n }\n case 189:\n {\n \/\/masking command\n int addr = packetBytes[1];\n int maskOp = packetBytes[2];\n int maskedOffsets = packetBytes[3];\n int readCommandLen = packetBytes[4];\n int readLen = packetBytes[5];\n int readCommand[readCommandLen];\n \n array_slice(packetBytes, 6, readCommandLen, readCommand);\n \n int writeCommandLen = packetBytes[6+readCommandLen];\n int writeCommand[writeCommandLen];\n \n array_slice(packetBytes, 7+readCommandLen, writeCommandLen, writeCommand);\n \n \n int writeVals[writeCommandLen];\n int wi=0;\n for(wi; wi<maskedOffsets; wi++){\n writeVals[wi]=writeCommand[wi];\n Serial.println(writeVals[wi]);\n }\n \n writeCommandsI2C(addr, readCommand, readCommandLen);\n Wire.requestFrom(addr, readLen);\n for(int i=0;i<readLen;i++){\n int current = Wire.read();\n writeVals[wi] = mask(current, writeCommand[wi], maskOp);\n Serial.println(current);\n Serial.println(writeVals[wi]);\n wi++;\n }\n \n writeCommandsI2C(addr, writeVals, writeCommandLen);\n break;\n }\n }\n return 1;\n}\nint mask(int val, int mask, int type){\n switch(type){\n case 0:\n val |= mask;\n break;\n case 1:\n val ^= mask;\n break;\n case 2:\n val &= ~mask;\n break;\n case 3:\n val &= mask;\n break;\n case 4:\n val = val << mask;\n break;\n case 5:\n val = val >> mask;\n }\n return val;\n}\nvoid i2c_command(byte bytes[], byte *buff){\n if(bytes[0] == 188){\n int commands[bytes[2]];\n array_slice(bytes, 4, bytes[2], commands);\n int addr = bytes[1];\n if(bytes[3] == 0){\n \/\/write command\n buff[0]=writeCommandsI2C(addr, commands, bytes[2]);\n }else{\n \/\/read command\n writeCommandsI2C(addr, commands, bytes[2]);\n Wire.requestFrom(addr, bytes[3]);\n for(int i=0;i<bytes[3];i++){\n buff[i] = Wire.read();\n }\n }\n }\n}\nvoid array_slice(byte bytes[], int start, int len, byte *buff){\n int ni = 0;\n int end = start+len;\n for(int i=start; i<=end; i++){\n buff[ni] = bytes[i];\n ni++;\n }\n}\nvoid array_slice(byte bytes[], int start, int len, int *buff){\n int ni=0;\n int end = start+len;\n for(int i=start; i<=end; i++){\n buff[ni] = bytes[i];\n ni++;\n }\n}\nint sendEvent(String key){\n int i = key.toInt();\n String eventName = \"\";\n eventName = \"eventReturn_\"+key;\n Particle.publish(eventName, eventReturns[i], 60, PRIVATE);\n eventReturns[i] = \"\";\n return 1;\n};\nint setEventReturn(String value){\n int index = 0;\n while(eventReturns[index].length() > 1){\n index++;\n }\n eventReturns[index] = value;\n return index;\n};\nint writeCommandsI2C(int addr, int* commands, int commandsLen){\n Serial.printf(\"Running I2C Command, address: %i data: \",addr);\n Wire.beginTransmission(addr);\n for(int i = 0; i < commandsLen; i++){\n Wire.write(commands[i]);\n Serial.printf(\"%i, \",commands[i]);\n }\n int status = Wire.endTransmission();\n Serial.printf(\" Status: %i \\n\", status);\n return status;\n};\n\n<commit_msg>Update ncd_gateway.cpp<commit_after>#include \"ncd_gateway.h\"\n#include \"S3B.h\"\n#include \"spark_wiring_eeprom.h\"\n\nS3B sModule;\nString eventReturns[5];\nunsigned long tOut = 3000;\n\n\/\/int s3b(JsonObject& root);\n\nvoid init_gateway(){\n Particle.function(\"deviceComm\", gatewayCommand);\n Particle.subscribe(\"ncd_deviceCom\", commandHandler, MY_DEVICES);\n Serial1.begin(115200);\n Wire.begin();\n}\n\nint gatewayCommand(String arg){\n int length = arg.length();\n \n byte bytes[length+1];\n \n arg.getBytes(bytes, length+1);\n \n int newLen = (length\/2)+1;\n \n byte newBytes[newLen];\n \n int ind = 0;\n \n for(int i=0;i<length;i+=2){\n if(i>0){\n ind=i\/2;\n }\n int b1=(bytes[i]-32) << 4;\n int b2=bytes[i+1]-32;\n newBytes[ind]=b1+b2;\n }\n \/\/send int pointer for setting to allow me to test how to return results?\n return ncdApi(newBytes);\n}\n\nvoid commandHandler(const char *event, const char *data){\n Serial.println(\"Got Event \"+String(event));\n String newCommand = String(data);\n gatewayCommand(newCommand);\n}\nint ncdApi(byte packetBytes[]){\n int buffLen = 1;\n Serial.println(String(packetBytes[0]));\n switch(packetBytes[0]){\n case 187:\n {\n \/\/packet of packets\n int i=2;\n int max;\n for(int pn = 0; pn<packetBytes[1]; pn++){\n \n max=i+packetBytes[i];\n Serial.println(max);\n byte intPacket[packetBytes[i]];\n i++;\n int ni=0;\n for(i;i<=max;i++){\n intPacket[ni]=packetBytes[i];\n ni++;\n }\n ncdApi(intPacket);\n }\n break;\n }\n case 188:\n {\n \/\/plain i2c w\/r command\n if(packetBytes[3] > 0){\n buffLen = packetBytes[3];\n byte buff[buffLen];\n i2c_command(packetBytes, buff);\n }\n return bytesToInt(buff, buffLen);\n }\n case 189:\n {\n \/\/masking command\n int addr = packetBytes[1];\n int maskOp = packetBytes[2];\n int maskedOffsets = packetBytes[3];\n int readCommandLen = packetBytes[4];\n int readLen = packetBytes[5];\n int readCommand[readCommandLen];\n \n array_slice(packetBytes, 6, readCommandLen, readCommand);\n \n int writeCommandLen = packetBytes[6+readCommandLen];\n int writeCommand[writeCommandLen];\n \n array_slice(packetBytes, 7+readCommandLen, writeCommandLen, writeCommand);\n \n \n int writeVals[writeCommandLen];\n int wi=0;\n for(wi; wi<maskedOffsets; wi++){\n writeVals[wi]=writeCommand[wi];\n Serial.println(writeVals[wi]);\n }\n \n writeCommandsI2C(addr, readCommand, readCommandLen);\n Wire.requestFrom(addr, readLen);\n for(int i=0;i<readLen;i++){\n int current = Wire.read();\n writeVals[wi] = mask(current, writeCommand[wi], maskOp);\n Serial.println(current);\n Serial.println(writeVals[wi]);\n wi++;\n }\n \n writeCommandsI2C(addr, writeVals, writeCommandLen);\n break;\n }\n }\n return 1;\n}\nint mask(int val, int mask, int type){\n switch(type){\n case 0:\n val |= mask;\n break;\n case 1:\n val ^= mask;\n break;\n case 2:\n val &= ~mask;\n break;\n case 3:\n val &= mask;\n break;\n case 4:\n val = val << mask;\n break;\n case 5:\n val = val >> mask;\n }\n return val;\n}\nvoid i2c_command(byte bytes[], byte *buff){\n if(bytes[0] == 188){\n int commands[bytes[2]];\n array_slice(bytes, 4, bytes[2], commands);\n int addr = bytes[1];\n if(bytes[3] == 0){\n \/\/write command\n buff[0]=writeCommandsI2C(addr, commands, bytes[2]);\n }else{\n \/\/read command\n writeCommandsI2C(addr, commands, bytes[2]);\n Wire.requestFrom(addr, bytes[3]);\n for(int i=0;i<bytes[3];i++){\n buff[i] = Wire.read();\n }\n }\n }\n}\nvoid array_slice(byte bytes[], int start, int len, byte *buff){\n int ni = 0;\n int end = start+len;\n for(int i=start; i<=end; i++){\n buff[ni] = bytes[i];\n ni++;\n }\n}\nvoid array_slice(byte bytes[], int start, int len, int *buff){\n int ni=0;\n int end = start+len;\n for(int i=start; i<=end; i++){\n buff[ni] = bytes[i];\n ni++;\n }\n}\nint sendEvent(String key){\n int i = key.toInt();\n String eventName = \"\";\n eventName = \"eventReturn_\"+key;\n Particle.publish(eventName, eventReturns[i], 60, PRIVATE);\n eventReturns[i] = \"\";\n return 1;\n};\nint setEventReturn(String value){\n int index = 0;\n while(eventReturns[index].length() > 1){\n index++;\n }\n eventReturns[index] = value;\n return index;\n};\nint writeCommandsI2C(int addr, int* commands, int commandsLen){\n Serial.printf(\"Running I2C Command, address: %i data: \",addr);\n Wire.beginTransmission(addr);\n for(int i = 0; i < commandsLen; i++){\n Wire.write(commands[i]);\n Serial.printf(\"%i, \",commands[i]);\n }\n int status = Wire.endTransmission();\n Serial.printf(\" Status: %i \\n\", status);\n return status;\n};\nint bytesToInt(byte bytes[], int length){\n int ret = bytes[0];\n for(int i=1; i<length; i++){\n ret = ret << 8;\n ret += bytes[i];\n }\n return ret;\n}\n<|endoftext|>"} {"text":"<commit_before>#include <ros.h>\n#include <string.h>\n\n#include \"std_msgs\/String.h\"\n#include \"maelstrom_msgs\/PwmRequests.h\"\n#include \"maelstrom_msgs\/ThrusterForces.h\"\n#include \"maelstrom_msgs\/LightInput.h\"\n\n#include \"ForceToPwmLookup.h\"\n\n\n\/\/incleder for IMU og trykksensor\n#include \"MPU6050\/MPU6050.h\"\n#include \"MS5803_14BA.h\"\n#include <Wire.h>\n#include <geometry_msgs\/Vector3.h>\n#include \"sensor_msgs\/Imu.h\"\n#include \"sensor_msgs\/MagneticField.h\"\n#include \"sensor_msgs\/Temperature.h\"\n#include \"sensor_msgs\/FluidPressure.h\"\n\n#define STANDARD_GRAVITY 9.08665 \/\/ [m\/s^2]\n#define RAD_PER_DEG 0.01745329252 \/\/ [1\/deg]\n#define PASCAL_PER_MILLIBAR 0.01 \/\/ [Pa\/mbar]\n\n#define MPU9150_I2C_ADDR 0x69\nMPU6050 accelgyro(MPU9150_I2C_ADDR);\n\nMS5803_14BA depthSensor;\n\nros::NodeHandle nh;\n\nsensor_msgs::Imu imu_raw_msg;\nsensor_msgs::MagneticField compass_msg;\nsensor_msgs::Temperature temperature_msg;\nsensor_msgs::FluidPressure pressure_msg;\n\nros::Publisher pub_imu(\"imu\/data_raw\", &imu_raw_msg);\nros::Publisher pub_pressure(\"imu\/pressure\", &pressure_msg);\n\nconst int SensorReadDelay = 83;\nunsigned long PrevoiusSensorReadMillis = 0;\n\nint dbg_count = 0;\n\n\/\/Hold orden på pwm-pins til motor og lys\nconst int PwmCount = 7;\nconst int PwmPins[PwmCount] = { 7, 8, 12, 13, 44, 45, 10};\nconst int LigthPwmPin = PwmPins[PwmCount-1]; \/\/pin 10 er på Timer \/ Counter 2\nint PwmValue[PwmCount];\n\n\n\/\/Sett opp topics til debugmeldinger\nmaelstrom_msgs::PwmRequests pwm_status_msg;\nstd_msgs::String arduino_dbg_msg;\n\nros::Publisher pwm_status_pub(\"pwm_status\", &pwm_status_msg);\nros::Publisher arduino_dbg_pub(\"arduino_dbg\", &arduino_dbg_msg);\n\n\nvoid WritePwm(int pin, uint8_t value) {\n switch(pin) {\n \/\/LYS\n case 10:\n analogWrite(pin, value);\n break;\n\n \/\/MOTOR\n case 7:\n OCR4BH = 0;\n OCR4BL = value;\n break;\n case 8:\n OCR4CH = 0;\n OCR4CL = value;\n break;\n case 12:\n OCR1BH = 0;\n OCR1BL = value;\n break;\n case 13:\n OCR1CH = 0;\n OCR1CL = value;\n break;\n case 44:\n OCR5BH = 0;\n OCR5BL = value;\n break;\n case 45:\n OCR5CH = 0;\n OCR5CL = value;\n break;\n };\n}\n\nvoid InitPwm() {\n\n \/\/sett alle pwmpinnene som utputt\n for(int i = 0; i < PwmCount; i++)\n pinMode(PwmPins[i], OUTPUT);\n\n \/\/initialiser Timer\/Counter 3, 4 og 5\n TCCR1A |= (1<<COM1B1) | (1<<COM1C1) | (1<<WGM11) | (1<<WGM10);\n TCCR4A |= (1<<COM4B1) | (1<<COM4C1) | (1<<WGM41) | (1<<WGM40);\n TCCR5A |= (1<<COM5B1) | (1<<COM5C1) | (1<<WGM51) | (1<<WGM50);\n\n \/\/sett Clock select\n \/\/på Timer\/Counter 1\n TCCR1B |= (1<<CS11) | (1<<CS10);\n TCCR1B &= ~(1<<CS12);\n \/\/På Timer\/Counter 4\n TCCR4B |= (1<<CS41) | (1<<CS40);\n TCCR4B &= ~(1<<CS42);\n \/\/på Timer\/Counter 5\n TCCR5B |= (1<<CS51) | (1<<CS50);\n TCCR5B &= ~(1<<CS52);\n\n\n \/\/sett alle motorer til 0 Newton\n for(int i = 0; i < PwmCount; i++) {\n PwmValue[i] = ForceToPwm(0);\n WritePwm(PwmPins[i], PwmValue[i]);\n }\n \/\/og så av lys\n PwmValue[LigthPwmPin] = 0;\n WritePwm(LigthPwmPin, 0);\n \n}\n\nvoid publishPwmStatus() {\n \/\/Send PWM-verdiene tilbake som debugoutput\n pwm_status_msg.pwm1 = PwmValue[0];\n pwm_status_msg.pwm2 = PwmValue[1];\n pwm_status_msg.pwm3 = PwmValue[2];\n pwm_status_msg.pwm4 = PwmValue[3];\n pwm_status_msg.pwm5 = PwmValue[4];\n pwm_status_msg.pwm6 = PwmValue[5];\n pwm_status_msg.pwm7 = PwmValue[6];\n\n pwm_status_pub.publish( &pwm_status_msg );\n}\n\nvoid pwm_update( const maelstrom_msgs::ThrusterForces& force_input ){\n \n PwmValue[0] = ForceToPwm(force_input.F1);\n PwmValue[1] = ForceToPwm(force_input.F2);\n PwmValue[2] = ForceToPwm(force_input.F3);\n PwmValue[3] = ForceToPwm(force_input.F4);\n PwmValue[4] = ForceToPwm(force_input.F5);\n PwmValue[5] = ForceToPwm(force_input.F6);\n\n for(int i = 0; i < PwmCount; i++) {\n WritePwm(PwmPins[i], PwmValue[i]);\n }\n \n dbg_count = 0;\n\n publishPwmStatus();\n}\n\nros::Subscriber<maelstrom_msgs::ThrusterForces> pwm_input_sub(\"thruster_forces\", &pwm_update );\n\nvoid LightPwmUpdate( const maelstrom_msgs::LightInput &light_msg) {\n PwmValue[6] = light_msg.light_intensity;\n\n WritePwm(LigthPwmPin, PwmValue[6]);\n\n publishPwmStatus();\n}\n\nros::Subscriber<maelstrom_msgs::LightInput> light_pwm_input_sub(\"LightPwm\", &LightPwmUpdate );\n\n\ndouble GyroLsbSens, AccelLsbSens;\nvoid getFsRangeAndSetLsbSensisivity() {\n \n uint8_t GyroFsRange, AccelFsRange;\n \n GyroFsRange = accelgyro.getFullScaleGyroRange();\n \/* Gyro\n * FS_SEL | Full Scale Range | LSB Sensitivity\n * -------+--------------------+----------------\n * 0 | +\/- 250 degrees\/s | 131 LSB\/deg\/s\n * 1 | +\/- 500 degrees\/s | 65.5 LSB\/deg\/s\n * 2 | +\/- 1000 degrees\/s | 32.8 LSB\/deg\/s\n * 3 | +\/- 2000 degrees\/s | 16.4 LSB\/deg\/s\n *\/\n switch(GyroFsRange) {\n case 0:\n GyroLsbSens = 131.0;\n break;\n case 1:\n GyroLsbSens = 65.5;\n break;\n case 2:\n GyroLsbSens = 32.8;\n break;\n case 3:\n GyroLsbSens = 16.4;\n break; \n };\n\n \n AccelFsRange = accelgyro.getFullScaleAccelRange();\n \/*Accelerometer\n * AFS_SEL | Full Scale Range | LSB Sensitivity\n * --------+------------------+----------------\n * 0 | +\/- 2g | 16384 LSB\/g\n * 1 | +\/- 4g | 8192 LSB\/g\n * 2 | +\/- 8g | 4096 LSB\/g\n * 3 | +\/- 16g | 2048 LSB\/g\n *\/\n switch(AccelFsRange) {\n case 0:\n AccelLsbSens = 16384.0;\n break;\n case 1:\n AccelLsbSens = 8192.0;\n break;\n case 2:\n AccelLsbSens = 4096.0;\n break;\n case 3:\n AccelLsbSens = 2048.0;\n break; \n };\n\n \n}\n\nvoid setup() {\n \n InitPwm();\n\n \/\/start ROS-node\n nh.initNode();\n\n nh.advertise(pwm_status_pub);\n nh.advertise(arduino_dbg_pub);\n \n nh.advertise(pub_imu); \n nh.subscribe(pwm_input_sub);\n nh.subscribe(light_pwm_input_sub);\n nh.spinOnce();\n \n \/\/ Initialize the 'Wire' class for the I2C-bus.\n \/\/ I2C pins: 20 (SDA) og 21 (SCL) (Mega2560)\n Wire.begin();\n accelgyro.initialize();\n getFsRangeAndSetLsbSensisivity();\n\n depthSensor.initialize(false);\n\n\n nh.spinOnce();\n String dbg_msg = String(\"init:\\n\") + \n (accelgyro.testConnection() ? \"MPU6050 connection successful\" : \"MPU6050 connection failed\");\n arduino_dbg_msg.data = dbg_msg.c_str();\n arduino_dbg_pub.publish( &arduino_dbg_msg );\n\n nh.spinOnce();\n\n\n}\n\n\nvoid lesSensorer() {\n\n int16_t ax, ay, az;\n int16_t gx, gy, gz;\n int16_t mx, my, mz;\n\n accelgyro.getMotion9(&ax, &ay, &az, &gx, &gy, &gz, &mx, &my, &mz);\n\n \/\/Accelerometerdata enhet: [m\/s^2]\n imu_raw_msg.linear_acceleration.x = (ax * STANDARD_GRAVITY) \/ AccelLsbSens; \/\/ OBS! MÅ VÆRE m\/s^2!\n imu_raw_msg.linear_acceleration.y = (ay * STANDARD_GRAVITY) \/ AccelLsbSens; \/\/ OBS! MÅ VÆRE m\/s^2!\n imu_raw_msg.linear_acceleration.z = (az * STANDARD_GRAVITY) \/ AccelLsbSens; \/\/ OBS! MÅ VÆRE m\/s^2!\n\n \/\/Gyrodata: enhet [rad\/s]\n imu_raw_msg.angular_velocity.x = (gx * RAD_PER_DEG) \/ GyroLsbSens; \/\/ OBS! MÅ VÆRE RAD\/SEC\n imu_raw_msg.angular_velocity.y = (gy * RAD_PER_DEG) \/ GyroLsbSens; \/\/ OBS! MÅ VÆRE RAD\/SEC\n imu_raw_msg.angular_velocity.z = (gz * RAD_PER_DEG) \/ GyroLsbSens; \/\/ OBS! MÅ VÆRE RAD\/SEC\n\n \/\/ Kompass, enhet [T]\n \/\/ TODO finn ut om 0.3 er riktig skaleringsfaktor\n compass_msg.magnetic_field.x = mx * 0.3; \/\/ OBS! MÅ VÆRE TESLA! (IKKE MILLI\/MICRO)\n compass_msg.magnetic_field.y = my * 0.3; \/\/ OBS! MÅ VÆRE TESLA! (IKKE MILLI\/MICRO)\n compass_msg.magnetic_field.z = mz * 0.3; \/\/ OBS! MÅ VÆRE TESLA! (IKKE MILLI\/MICRO)\n\n temperature_msg.temperature = ( (double)accelgyro.getTemperature() + 12412.0) \/ 340.0;\n\n depthSensor.read();\n pressure_msg.fluid_pressure = depthSensor.getPreassure() * PASCAL_PER_MILLIBAR; \/\/ OBS! MÅ VÆRE I PASCAL\n}\n\nvoid loop(){\n\n\n nh.spinOnce();\n\n\n if( millis() - PrevoiusSensorReadMillis >= SensorReadDelay ) {\n PrevoiusSensorReadMillis = millis();\n\n lesSensorer();\n \/\/nh.spinOnce();\n pub_imu.publish(&imu_raw_msg);\n pub_pressure.publish(&pressure_msg);\n }\n \n \n \n \/*\n \/\/String dbg_msg = \"pwm updated after \" + String(dbg_count) + \" cycles\";\n \/\/String dbg_msg = \"accelX = \" ;\/\/+ String(imu.read(MPU9150_ACCEL_XOUT_L, MPU9150_ACCEL_XOUT_H));\n String dbg_msg = String(\"GyroFsRange = \") + String(GyroFsRange) +\n String(\"\\nAccelFsRange = \") + String(AccelFsRange);\n arduino_dbg_msg.data = dbg_msg.c_str();\n arduino_dbg_pub.publish( &arduino_dbg_msg ); \n nh.spinOnce();\n *\/\n\n\n}\n<commit_msg>stillt inn lavpassfilter<commit_after>#include <ros.h>\n#include <string.h>\n\n#include \"std_msgs\/String.h\"\n#include \"maelstrom_msgs\/PwmRequests.h\"\n#include \"maelstrom_msgs\/ThrusterForces.h\"\n#include \"maelstrom_msgs\/LightInput.h\"\n\n#include \"ForceToPwmLookup.h\"\n\n\n\/\/incleder for IMU og trykksensor\n#include \"MPU6050\/MPU6050.h\"\n#include \"MS5803_14BA.h\"\n#include <Wire.h>\n#include <geometry_msgs\/Vector3.h>\n#include \"sensor_msgs\/Imu.h\"\n#include \"sensor_msgs\/MagneticField.h\"\n#include \"sensor_msgs\/Temperature.h\"\n#include \"sensor_msgs\/FluidPressure.h\"\n\n#define STANDARD_GRAVITY 9.08665 \/\/ [m\/s^2]\n#define RAD_PER_DEG 0.01745329252 \/\/ [1\/deg]\n#define PASCAL_PER_MILLIBAR 0.01 \/\/ [Pa\/mbar]\n\n#define MPU9150_I2C_ADDR 0x69\nMPU6050 accelgyro(MPU9150_I2C_ADDR);\n\nMS5803_14BA depthSensor;\n\nros::NodeHandle nh;\n\nsensor_msgs::Imu imu_raw_msg;\nsensor_msgs::MagneticField compass_msg;\nsensor_msgs::Temperature temperature_msg;\nsensor_msgs::FluidPressure pressure_msg;\n\nros::Publisher pub_imu(\"imu\/data_raw\", &imu_raw_msg);\nros::Publisher pub_pressure(\"imu\/pressure\", &pressure_msg);\n\nconst int SensorReadDelay = 83;\nunsigned long PrevoiusSensorReadMillis = 0;\n\nint dbg_count = 0;\n\n\/\/Hold orden på pwm-pins til motor og lys\nconst int PwmCount = 7;\nconst int PwmPins[PwmCount] = { 7, 8, 12, 13, 44, 45, 10};\nconst int LigthPwmPin = PwmPins[PwmCount-1]; \/\/pin 10 er på Timer \/ Counter 2\nint PwmValue[PwmCount];\n\n\n\/\/Sett opp topics til debugmeldinger\nmaelstrom_msgs::PwmRequests pwm_status_msg;\nstd_msgs::String arduino_dbg_msg;\n\nros::Publisher pwm_status_pub(\"pwm_status\", &pwm_status_msg);\nros::Publisher arduino_dbg_pub(\"arduino_dbg\", &arduino_dbg_msg);\n\n\nvoid WritePwm(int pin, uint8_t value) {\n switch(pin) {\n \/\/LYS\n case 10:\n analogWrite(pin, value);\n break;\n\n \/\/MOTOR\n case 7:\n OCR4BH = 0;\n OCR4BL = value;\n break;\n case 8:\n OCR4CH = 0;\n OCR4CL = value;\n break;\n case 12:\n OCR1BH = 0;\n OCR1BL = value;\n break;\n case 13:\n OCR1CH = 0;\n OCR1CL = value;\n break;\n case 44:\n OCR5BH = 0;\n OCR5BL = value;\n break;\n case 45:\n OCR5CH = 0;\n OCR5CL = value;\n break;\n };\n}\n\nvoid InitPwm() {\n\n \/\/sett alle pwmpinnene som utputt\n for(int i = 0; i < PwmCount; i++)\n pinMode(PwmPins[i], OUTPUT);\n\n \/\/initialiser Timer\/Counter 3, 4 og 5\n TCCR1A |= (1<<COM1B1) | (1<<COM1C1) | (1<<WGM11) | (1<<WGM10);\n TCCR4A |= (1<<COM4B1) | (1<<COM4C1) | (1<<WGM41) | (1<<WGM40);\n TCCR5A |= (1<<COM5B1) | (1<<COM5C1) | (1<<WGM51) | (1<<WGM50);\n\n \/\/sett Clock select\n \/\/på Timer\/Counter 1\n TCCR1B |= (1<<CS11) | (1<<CS10);\n TCCR1B &= ~(1<<CS12);\n \/\/På Timer\/Counter 4\n TCCR4B |= (1<<CS41) | (1<<CS40);\n TCCR4B &= ~(1<<CS42);\n \/\/på Timer\/Counter 5\n TCCR5B |= (1<<CS51) | (1<<CS50);\n TCCR5B &= ~(1<<CS52);\n\n\n \/\/sett alle motorer til 0 Newton\n for(int i = 0; i < PwmCount; i++) {\n PwmValue[i] = ForceToPwm(0);\n WritePwm(PwmPins[i], PwmValue[i]);\n }\n \/\/og så av lys\n PwmValue[LigthPwmPin] = 0;\n WritePwm(LigthPwmPin, 0);\n \n}\n\nvoid publishPwmStatus() {\n \/\/Send PWM-verdiene tilbake som debugoutput\n pwm_status_msg.pwm1 = PwmValue[0];\n pwm_status_msg.pwm2 = PwmValue[1];\n pwm_status_msg.pwm3 = PwmValue[2];\n pwm_status_msg.pwm4 = PwmValue[3];\n pwm_status_msg.pwm5 = PwmValue[4];\n pwm_status_msg.pwm6 = PwmValue[5];\n pwm_status_msg.pwm7 = PwmValue[6];\n\n pwm_status_pub.publish( &pwm_status_msg );\n}\n\nvoid pwm_update( const maelstrom_msgs::ThrusterForces& force_input ){\n \n PwmValue[0] = ForceToPwm(force_input.F1);\n PwmValue[1] = ForceToPwm(force_input.F2);\n PwmValue[2] = ForceToPwm(force_input.F3);\n PwmValue[3] = ForceToPwm(force_input.F4);\n PwmValue[4] = ForceToPwm(force_input.F5);\n PwmValue[5] = ForceToPwm(force_input.F6);\n\n for(int i = 0; i < PwmCount; i++) {\n WritePwm(PwmPins[i], PwmValue[i]);\n }\n \n dbg_count = 0;\n\n publishPwmStatus();\n}\n\nvoid LightPwmUpdate( const maelstrom_msgs::LightInput &light_msg) {\n PwmValue[6] = light_msg.light_intensity;\n\n WritePwm(LigthPwmPin, PwmValue[6]);\n\n publishPwmStatus();\n}\n\nros::Subscriber<maelstrom_msgs::ThrusterForces> pwm_input_sub(\"thruster_forces\", &pwm_update );\nros::Subscriber<maelstrom_msgs::LightInput> light_pwm_input_sub(\"LightPwm\", &LightPwmUpdate );\n\n\ndouble GyroLsbSens, AccelLsbSens;\nvoid getFsRangeAndSetLsbSensisivity() {\n \n uint8_t GyroFsRange, AccelFsRange;\n \n GyroFsRange = accelgyro.getFullScaleGyroRange();\n \/* Gyro\n * FS_SEL | Full Scale Range | LSB Sensitivity\n * -------+--------------------+----------------\n * 0 | +\/- 250 degrees\/s | 131 LSB\/deg\/s\n * 1 | +\/- 500 degrees\/s | 65.5 LSB\/deg\/s\n * 2 | +\/- 1000 degrees\/s | 32.8 LSB\/deg\/s\n * 3 | +\/- 2000 degrees\/s | 16.4 LSB\/deg\/s\n *\/\n switch(GyroFsRange) {\n case 0:\n GyroLsbSens = 131.0;\n break;\n case 1:\n GyroLsbSens = 65.5;\n break;\n case 2:\n GyroLsbSens = 32.8;\n break;\n case 3:\n GyroLsbSens = 16.4;\n break; \n };\n\n \n AccelFsRange = accelgyro.getFullScaleAccelRange();\n \/*Accelerometer\n * AFS_SEL | Full Scale Range | LSB Sensitivity\n * --------+------------------+----------------\n * 0 | +\/- 2g | 16384 LSB\/g\n * 1 | +\/- 4g | 8192 LSB\/g\n * 2 | +\/- 8g | 4096 LSB\/g\n * 3 | +\/- 16g | 2048 LSB\/g\n *\/\n switch(AccelFsRange) {\n case 0:\n AccelLsbSens = 16384.0;\n break;\n case 1:\n AccelLsbSens = 8192.0;\n break;\n case 2:\n AccelLsbSens = 4096.0;\n break;\n case 3:\n AccelLsbSens = 2048.0;\n break; \n };\n\n \n}\n\nvoid setup() {\n \n InitPwm();\n\n \/\/start ROS-node\n nh.initNode();\n\n nh.advertise(pwm_status_pub);\n nh.advertise(arduino_dbg_pub);\n \n nh.advertise(pub_imu); \n nh.subscribe(pwm_input_sub);\n nh.subscribe(light_pwm_input_sub);\n nh.spinOnce();\n \n \/\/ Initialize the 'Wire' class for the I2C-bus.\n \/\/ I2C pins: 20 (SDA) og 21 (SCL) (Mega2560)\n Wire.begin();\n accelgyro.initialize();\n getFsRangeAndSetLsbSensisivity();\n \/\/Sett lavpassfilter se http:\/\/www.i2cdevlib.com\/docs\/html\/class_m_p_u6050.html#a9f2737fe22955fd85b2575ba8da874c6\n accelgyro.setDHPFMode(3); \/\/acc 44Hz 4.9ms, gyro 42Hz 4.8ms\n\n depthSensor.initialize(false);\n\n\n nh.spinOnce();\n String dbg_msg = String(\"init:\\n\") + \n (accelgyro.testConnection() ? \"MPU6050 connection successful\" : \"MPU6050 connection failed\");\n arduino_dbg_msg.data = dbg_msg.c_str();\n arduino_dbg_pub.publish( &arduino_dbg_msg );\n\n nh.spinOnce();\n\n\n}\n\n\nvoid lesSensorer() {\n\n int16_t ax, ay, az;\n int16_t gx, gy, gz;\n int16_t mx, my, mz;\n\n accelgyro.getMotion9(&ax, &ay, &az, &gx, &gy, &gz, &mx, &my, &mz);\n\n \/\/Accelerometerdata enhet: [m\/s^2]\n imu_raw_msg.linear_acceleration.x = (ax * STANDARD_GRAVITY) \/ AccelLsbSens; \/\/ OBS! MÅ VÆRE m\/s^2!\n imu_raw_msg.linear_acceleration.y = (ay * STANDARD_GRAVITY) \/ AccelLsbSens; \/\/ OBS! MÅ VÆRE m\/s^2!\n imu_raw_msg.linear_acceleration.z = (az * STANDARD_GRAVITY) \/ AccelLsbSens; \/\/ OBS! MÅ VÆRE m\/s^2!\n\n \/\/Gyrodata: enhet [rad\/s]\n imu_raw_msg.angular_velocity.x = (gx * RAD_PER_DEG) \/ GyroLsbSens; \/\/ OBS! MÅ VÆRE RAD\/SEC\n imu_raw_msg.angular_velocity.y = (gy * RAD_PER_DEG) \/ GyroLsbSens; \/\/ OBS! MÅ VÆRE RAD\/SEC\n imu_raw_msg.angular_velocity.z = (gz * RAD_PER_DEG) \/ GyroLsbSens; \/\/ OBS! MÅ VÆRE RAD\/SEC\n\n \/\/ Kompass, enhet [T]\n \/\/ TODO finn ut om 0.3 er riktig skaleringsfaktor\n compass_msg.magnetic_field.x = mx * 0.3; \/\/ OBS! MÅ VÆRE TESLA! (IKKE MILLI\/MICRO)\n compass_msg.magnetic_field.y = my * 0.3; \/\/ OBS! MÅ VÆRE TESLA! (IKKE MILLI\/MICRO)\n compass_msg.magnetic_field.z = mz * 0.3; \/\/ OBS! MÅ VÆRE TESLA! (IKKE MILLI\/MICRO)\n\n temperature_msg.temperature = ( (double)accelgyro.getTemperature() + 12412.0) \/ 340.0;\n\n depthSensor.read();\n pressure_msg.fluid_pressure = depthSensor.getPreassure() * PASCAL_PER_MILLIBAR; \/\/ OBS! MÅ VÆRE I PASCAL\n}\n\nvoid loop(){\n\n\n nh.spinOnce();\n\n\n if( millis() - PrevoiusSensorReadMillis >= SensorReadDelay ) {\n PrevoiusSensorReadMillis = millis();\n\n lesSensorer();\n \/\/nh.spinOnce();\n pub_imu.publish(&imu_raw_msg);\n pub_pressure.publish(&pressure_msg);\n }\n \n \n \n \/*\n \/\/String dbg_msg = \"pwm updated after \" + String(dbg_count) + \" cycles\";\n \/\/String dbg_msg = \"accelX = \" ;\/\/+ String(imu.read(MPU9150_ACCEL_XOUT_L, MPU9150_ACCEL_XOUT_H));\n String dbg_msg = String(\"GyroFsRange = \") + String(GyroFsRange) +\n String(\"\\nAccelFsRange = \") + String(AccelFsRange);\n arduino_dbg_msg.data = dbg_msg.c_str();\n arduino_dbg_pub.publish( &arduino_dbg_msg ); \n nh.spinOnce();\n *\/\n\n\n}\n<|endoftext|>"} {"text":"<commit_before>#ifndef MJOLNIR_OMP_UNLIMITED_GRID_CELL_LIST_HPP\n#define MJOLNIR_OMP_UNLIMITED_GRID_CELL_LIST_HPP\n#include <mjolnir\/omp\/OpenMPSimulatorTraits.hpp>\n#include <mjolnir\/omp\/sort.hpp>\n#include <mjolnir\/core\/UnlimitedGridCellList.hpp>\n\nnamespace mjolnir\n{\n\ntemplate<typename realT, template<typename, typename> class boundaryT, typename potentialT>\nclass UnlimitedGridCellList<OpenMPSimulatorTraits<realT, boundaryT>, potentialT>\n final : public SpatialPartitionBase<OpenMPSimulatorTraits<realT, boundaryT>, potentialT>\n{\n public:\n using traits_type = OpenMPSimulatorTraits<realT, boundaryT>;\n using potential_type = potentialT;\n using base_type = SpatialPartitionBase<traits_type, potential_type>;\n\n using system_type = typename base_type::system_type;\n using boundary_type = typename base_type::boundary_type;\n using real_type = typename base_type::real_type;\n using coordinate_type = typename base_type::coordinate_type;\n using neighbor_list_type = typename base_type::neighbor_list_type;\n using neighbor_type = typename base_type::neighbor_type;\n using range_type = typename base_type::range_type;\n\n static constexpr std::size_t dim_size () {return 8;}\n static constexpr std::int64_t dim () {return 8;}\n static constexpr real_type mesh_epsilon() {return 1e-6;}\n\n using particle_cell_idx_pair = std::pair<std::size_t, std::size_t>;\n using cell_index_container_type = std::vector<particle_cell_idx_pair>;\n using cell_index_const_iterator = typename cell_index_container_type::const_iterator;\n using adjacent_cell_idx = std::array<std::size_t, 27>;\n using cell_type = std::pair<range<cell_index_const_iterator>, adjacent_cell_idx>;\n using cell_list_type = std::array<cell_type, dim_size() * dim_size() * dim_size()>;\n\n public:\n\n UnlimitedGridCellList()\n : margin_(0.5), current_margin_(-1.0), r_cell_size_(-1.0)\n {}\n\n ~UnlimitedGridCellList() = default;\n UnlimitedGridCellList(UnlimitedGridCellList const&) = default;\n UnlimitedGridCellList(UnlimitedGridCellList &&) = default;\n UnlimitedGridCellList& operator=(UnlimitedGridCellList const&) = default;\n UnlimitedGridCellList& operator=(UnlimitedGridCellList &&) = default;\n\n explicit UnlimitedGridCellList(const real_type margin)\n : margin_(margin), current_margin_(-1.0), r_cell_size_(-1.0)\n {}\n\n bool valid() const noexcept override\n {\n return current_margin_ >= 0.;\n }\n\n \/\/XXX do NOT call this from parallel region.\n void initialize(neighbor_list_type& neighbors,\n const system_type& sys, const potential_type& pot) override\n {\n MJOLNIR_GET_DEFAULT_LOGGER();\n MJOLNIR_LOG_FUNCTION();\n\n constexpr std::int64_t d = dim();\n\n MJOLNIR_LOG_INFO(pot.name(), \" cutoff = \", pot.max_cutoff_length());\n MJOLNIR_LOG_INFO(\"dimension = \", d, 'x', d, 'x', d);\n this->set_cutoff(pot.max_cutoff_length());\n\n \/\/ initialize cell list\n#pragma omp parallel for\n for(int x = 0; x < d; ++x)\n {\n for(int y = 0; y < d; ++y)\n {\n for(int z = 0; z < d; ++z)\n {\n auto& cell = this->cell_list_[calc_index(x, y, z)];\n\n const std::size_t x_prev = (x == 0) ? d-1 : x-1;\n const std::size_t x_next = (x == d-1) ? 0 : x+1;\n const std::size_t y_prev = (y == 0) ? d-1 : y-1;\n const std::size_t y_next = (y == d-1) ? 0 : y+1;\n const std::size_t z_prev = (z == 0) ? d-1 : z-1;\n const std::size_t z_next = (z == d-1) ? 0 : z+1;\n\n cell.second[ 0] = calc_index(x_prev, y_prev, z_prev);\n cell.second[ 1] = calc_index(x, y_prev, z_prev);\n cell.second[ 2] = calc_index(x_next, y_prev, z_prev);\n cell.second[ 3] = calc_index(x_prev, y, z_prev);\n cell.second[ 4] = calc_index(x, y, z_prev);\n cell.second[ 5] = calc_index(x_next, y, z_prev);\n cell.second[ 6] = calc_index(x_prev, y_next, z_prev);\n cell.second[ 7] = calc_index(x, y_next, z_prev);\n cell.second[ 8] = calc_index(x_next, y_next, z_prev);\n\n cell.second[ 9] = calc_index(x_prev, y_prev, z);\n cell.second[10] = calc_index(x, y_prev, z);\n cell.second[11] = calc_index(x_next, y_prev, z);\n cell.second[12] = calc_index(x_prev, y, z);\n cell.second[13] = calc_index(x, y, z);\n cell.second[14] = calc_index(x_next, y, z);\n cell.second[15] = calc_index(x_prev, y_next, z);\n cell.second[16] = calc_index(x, y_next, z);\n cell.second[17] = calc_index(x_next, y_next, z);\n\n cell.second[18] = calc_index(x_prev, y_prev, z_next);\n cell.second[19] = calc_index(x, y_prev, z_next);\n cell.second[20] = calc_index(x_next, y_prev, z_next);\n cell.second[21] = calc_index(x_prev, y, z_next);\n cell.second[22] = calc_index(x, y, z_next);\n cell.second[23] = calc_index(x_next, y, z_next);\n cell.second[24] = calc_index(x_prev, y_next, z_next);\n cell.second[25] = calc_index(x, y_next, z_next);\n cell.second[26] = calc_index(x_next, y_next, z_next);\n } \/\/ for z\n } \/\/ for y\n } \/\/ for x (in parallel)\n\n this->make(neighbors, sys, pot);\n return;\n }\n\n \/\/XXX do NOT call this from parallel region\n void make(neighbor_list_type& neighbors,\n const system_type& sys, const potential_type& pot) override\n {\n \/\/ `participants` is a list that contains indices of particles that are\n \/\/ related to the potential.\n const auto& participants = pot.participants();\n\n neighbors.clear();\n if(index_by_cell_ .size() != sys.size() ||\n index_by_cell_buf_.size() != sys.size())\n {\n index_by_cell_ .resize(sys.size());\n index_by_cell_buf_.resize(sys.size());\n }\n\n#pragma omp parallel for\n for(std::size_t i=0; i<participants.size(); ++i)\n {\n const auto idx = participants[i];\n index_by_cell_[i] =\n std::make_pair(idx, this->calc_index(sys.position(idx)));\n }\n\n omp::sort(this->index_by_cell_, this->index_by_cell_buf_,\n [](const particle_cell_idx_pair& lhs,\n const particle_cell_idx_pair& rhs) noexcept -> bool {\n return lhs.second < rhs.second;\n });\n\n \/\/ assign first and last iterator for each cells\n#pragma omp parallel for\n for(std::size_t cell_idx=0; cell_idx<cell_list_.size(); ++cell_idx)\n {\n auto iter = std::find_if(index_by_cell_.cbegin(), index_by_cell_.cend(),\n [cell_idx](const particle_cell_idx_pair& item) noexcept -> bool {\n return item.second == cell_idx;\n });\n if(iter == index_by_cell_.cend())\n {\n cell_list_[cell_idx].first = make_range(iter, iter);\n continue;\n }\n const auto first = iter; \/\/ the first iter of the range\n while(iter != index_by_cell_.cend() && iter->second == cell_idx)\n {\n ++iter;\n }\n cell_list_[cell_idx].first = make_range(first, iter);\n }\n\n const real_type r_c = cutoff_ * (1 + margin_);\n const real_type r_c2 = r_c * r_c;\n\n\/\/XXX ParallelNeighborList consumes quite a lot of memory resources and makes\n\/\/XXX both construction and access slower (especially when system has a small\n\/\/XXX number of particles). Because of this, after some benchmarking, I found\n\/\/XXX that normal NeighborList works good for most of the cases. Some part of\n\/\/XXX neighbor-list construction cannot be parallelized, but it becomes still\n\/\/XXX faster.\n\n std::vector<neighbor_type> partner;\n for(std::size_t idx=0; idx<participants.size(); ++idx)\n {\n partner.clear();\n const auto i = participants[idx];\n const auto& ri = sys.position(i);\n const auto& cell = cell_list_[this->calc_index(ri)];\n\n MJOLNIR_LOG_DEBUG(\"particle position \", sys.position(i));\n MJOLNIR_LOG_DEBUG(\"cell index \", calc_index(ri));\n MJOLNIR_LOG_DEBUG(\"making verlet list for index \", i);\n\n for(std::size_t cidx : cell.second) \/\/ for all adjacent cells...\n {\n MJOLNIR_LOG_DEBUG(\"neighbor cell index \", cidx);\n for(auto pici : cell_list_[cidx].first)\n {\n const auto j = pici.first;\n MJOLNIR_LOG_DEBUG(\"looking particle \", j);\n if(j <= i || !pot.has_interaction(i, j))\n {\n continue;\n }\n \/\/ here we don't need to search `participants` because\n \/\/ cell list contains only participants. non-related\n \/\/ particles are already filtered.\n\n const auto& rj = sys.position(j);\n if(math::length_sq(sys.adjust_direction(rj - ri)) < r_c2)\n {\n MJOLNIR_LOG_DEBUG(\"add index \", j, \" to list \", i);\n partner.emplace_back(j, pot.prepare_params(i, j));\n }\n }\n }\n \/\/ make the result consistent with NaivePairCalculation...\n std::sort(partner.begin(), partner.end());\n neighbors.add_list_for(i, partner.begin(), partner.end());\n }\n\n this->current_margin_ = cutoff_ * margin_;\n return ;\n }\n\n \/\/XXX do NOT call this from `parallel` region.\n void update(neighbor_list_type& neighbors, const real_type dmargin,\n const system_type& sys, const potential_type& pot) override\n {\n this->current_margin_ -= dmargin;\n\n if(this->current_margin_ < 0.)\n {\n this->make(neighbors, sys, pot);\n }\n return ;\n }\n\n real_type cutoff() const noexcept override {return this->cutoff_;}\n real_type margin() const noexcept override {return this->margin_;}\n\n private:\n\n \/\/ calc cell index of the position\n std::size_t calc_index(const coordinate_type& pos) const noexcept\n {\n constexpr std::int64_t d = dim();\n const auto x = std::int64_t(std::floor(math::X(pos) * r_cell_size_)) % d;\n const auto y = std::int64_t(std::floor(math::Y(pos) * r_cell_size_)) % d;\n const auto z = std::int64_t(std::floor(math::Z(pos) * r_cell_size_)) % d;\n\n return this->calc_index((x<0) ? x+d : x, (y<0) ? y+d : y, (z<0) ? z+d : z);\n }\n\n std::size_t calc_index(const std::size_t x, const std::size_t y,\n const std::size_t z) const noexcept\n {\n return x + dim_size() * y + dim_size() * dim_size() * z;\n }\n\n void set_cutoff(const real_type c) noexcept\n {\n this->cutoff_ = c;\n this->r_cell_size_ = 1 \/ (cutoff_ * (1 + margin_) * (1+mesh_epsilon()));\n }\n void set_margin(const real_type m) noexcept\n {\n this->margin_ = m;\n this->r_cell_size_ = 1 \/ (cutoff_ * (1 + margin_) * (1+mesh_epsilon()));\n }\n\n private:\n\n real_type cutoff_;\n real_type margin_;\n real_type current_margin_;\n real_type r_cell_size_;\n\n neighbor_list_type neighbors_;\n cell_list_type cell_list_;\n cell_index_container_type index_by_cell_;\n cell_index_container_type index_by_cell_buf_; \/\/ buffer for sort\n \/\/ index_by_cell_ has {particle idx, cell idx} and sorted by cell idx\n \/\/ first term of cell list contains first and last idx of index_by_cell\n};\n} \/\/ mjolnir\n\n#ifdef MJOLNIR_SEPARATE_BUILD\n#include <mjolnir\/potential\/global\/DebyeHuckelPotential.hpp>\n#include <mjolnir\/potential\/global\/ExcludedVolumePotential.hpp>\n#include <mjolnir\/potential\/global\/LennardJonesPotential.hpp>\n#include <mjolnir\/potential\/global\/UniformLennardJonesPotential.hpp>\n\nnamespace mjolnir\n{\nextern template class UnlimitedGridCellList<OpenMPSimulatorTraits<double, UnlimitedBoundary>, DebyeHuckelPotential<double>>;\nextern template class UnlimitedGridCellList<OpenMPSimulatorTraits<float, UnlimitedBoundary>, DebyeHuckelPotential<float >>;\n\nextern template class UnlimitedGridCellList<OpenMPSimulatorTraits<double, UnlimitedBoundary>, ExcludedVolumePotential<double>>;\nextern template class UnlimitedGridCellList<OpenMPSimulatorTraits<float, UnlimitedBoundary>, ExcludedVolumePotential<float >>;\n\nextern template class UnlimitedGridCellList<OpenMPSimulatorTraits<double, UnlimitedBoundary>, LennardJonesPotential<double>>;\nextern template class UnlimitedGridCellList<OpenMPSimulatorTraits<float, UnlimitedBoundary>, LennardJonesPotential<float >>;\n\nextern template class UnlimitedGridCellList<OpenMPSimulatorTraits<double, UnlimitedBoundary>, UniformLennardJonesPotential<double>>;\nextern template class UnlimitedGridCellList<OpenMPSimulatorTraits<float, UnlimitedBoundary>, UniformLennardJonesPotential<float >>;\n}\n#endif \/\/ MJOLNIR_SEPARATE_BUILD\n#endif\/* MJOLNIR_UNLIMITED_GRID_CELL_LIST *\/\n<commit_msg>fix: lack of logger declaration in debug mode<commit_after>#ifndef MJOLNIR_OMP_UNLIMITED_GRID_CELL_LIST_HPP\n#define MJOLNIR_OMP_UNLIMITED_GRID_CELL_LIST_HPP\n#include <mjolnir\/omp\/OpenMPSimulatorTraits.hpp>\n#include <mjolnir\/omp\/sort.hpp>\n#include <mjolnir\/core\/UnlimitedGridCellList.hpp>\n\nnamespace mjolnir\n{\n\ntemplate<typename realT, template<typename, typename> class boundaryT, typename potentialT>\nclass UnlimitedGridCellList<OpenMPSimulatorTraits<realT, boundaryT>, potentialT>\n final : public SpatialPartitionBase<OpenMPSimulatorTraits<realT, boundaryT>, potentialT>\n{\n public:\n using traits_type = OpenMPSimulatorTraits<realT, boundaryT>;\n using potential_type = potentialT;\n using base_type = SpatialPartitionBase<traits_type, potential_type>;\n\n using system_type = typename base_type::system_type;\n using boundary_type = typename base_type::boundary_type;\n using real_type = typename base_type::real_type;\n using coordinate_type = typename base_type::coordinate_type;\n using neighbor_list_type = typename base_type::neighbor_list_type;\n using neighbor_type = typename base_type::neighbor_type;\n using range_type = typename base_type::range_type;\n\n static constexpr std::size_t dim_size () {return 8;}\n static constexpr std::int64_t dim () {return 8;}\n static constexpr real_type mesh_epsilon() {return 1e-6;}\n\n using particle_cell_idx_pair = std::pair<std::size_t, std::size_t>;\n using cell_index_container_type = std::vector<particle_cell_idx_pair>;\n using cell_index_const_iterator = typename cell_index_container_type::const_iterator;\n using adjacent_cell_idx = std::array<std::size_t, 27>;\n using cell_type = std::pair<range<cell_index_const_iterator>, adjacent_cell_idx>;\n using cell_list_type = std::array<cell_type, dim_size() * dim_size() * dim_size()>;\n\n public:\n\n UnlimitedGridCellList()\n : margin_(0.5), current_margin_(-1.0), r_cell_size_(-1.0)\n {}\n\n ~UnlimitedGridCellList() = default;\n UnlimitedGridCellList(UnlimitedGridCellList const&) = default;\n UnlimitedGridCellList(UnlimitedGridCellList &&) = default;\n UnlimitedGridCellList& operator=(UnlimitedGridCellList const&) = default;\n UnlimitedGridCellList& operator=(UnlimitedGridCellList &&) = default;\n\n explicit UnlimitedGridCellList(const real_type margin)\n : margin_(margin), current_margin_(-1.0), r_cell_size_(-1.0)\n {}\n\n bool valid() const noexcept override\n {\n return current_margin_ >= 0.;\n }\n\n \/\/XXX do NOT call this from parallel region.\n void initialize(neighbor_list_type& neighbors,\n const system_type& sys, const potential_type& pot) override\n {\n MJOLNIR_GET_DEFAULT_LOGGER();\n MJOLNIR_LOG_FUNCTION();\n\n constexpr std::int64_t d = dim();\n\n MJOLNIR_LOG_INFO(pot.name(), \" cutoff = \", pot.max_cutoff_length());\n MJOLNIR_LOG_INFO(\"dimension = \", d, 'x', d, 'x', d);\n this->set_cutoff(pot.max_cutoff_length());\n\n \/\/ initialize cell list\n#pragma omp parallel for\n for(int x = 0; x < d; ++x)\n {\n for(int y = 0; y < d; ++y)\n {\n for(int z = 0; z < d; ++z)\n {\n auto& cell = this->cell_list_[calc_index(x, y, z)];\n\n const std::size_t x_prev = (x == 0) ? d-1 : x-1;\n const std::size_t x_next = (x == d-1) ? 0 : x+1;\n const std::size_t y_prev = (y == 0) ? d-1 : y-1;\n const std::size_t y_next = (y == d-1) ? 0 : y+1;\n const std::size_t z_prev = (z == 0) ? d-1 : z-1;\n const std::size_t z_next = (z == d-1) ? 0 : z+1;\n\n cell.second[ 0] = calc_index(x_prev, y_prev, z_prev);\n cell.second[ 1] = calc_index(x, y_prev, z_prev);\n cell.second[ 2] = calc_index(x_next, y_prev, z_prev);\n cell.second[ 3] = calc_index(x_prev, y, z_prev);\n cell.second[ 4] = calc_index(x, y, z_prev);\n cell.second[ 5] = calc_index(x_next, y, z_prev);\n cell.second[ 6] = calc_index(x_prev, y_next, z_prev);\n cell.second[ 7] = calc_index(x, y_next, z_prev);\n cell.second[ 8] = calc_index(x_next, y_next, z_prev);\n\n cell.second[ 9] = calc_index(x_prev, y_prev, z);\n cell.second[10] = calc_index(x, y_prev, z);\n cell.second[11] = calc_index(x_next, y_prev, z);\n cell.second[12] = calc_index(x_prev, y, z);\n cell.second[13] = calc_index(x, y, z);\n cell.second[14] = calc_index(x_next, y, z);\n cell.second[15] = calc_index(x_prev, y_next, z);\n cell.second[16] = calc_index(x, y_next, z);\n cell.second[17] = calc_index(x_next, y_next, z);\n\n cell.second[18] = calc_index(x_prev, y_prev, z_next);\n cell.second[19] = calc_index(x, y_prev, z_next);\n cell.second[20] = calc_index(x_next, y_prev, z_next);\n cell.second[21] = calc_index(x_prev, y, z_next);\n cell.second[22] = calc_index(x, y, z_next);\n cell.second[23] = calc_index(x_next, y, z_next);\n cell.second[24] = calc_index(x_prev, y_next, z_next);\n cell.second[25] = calc_index(x, y_next, z_next);\n cell.second[26] = calc_index(x_next, y_next, z_next);\n } \/\/ for z\n } \/\/ for y\n } \/\/ for x (in parallel)\n\n this->make(neighbors, sys, pot);\n return;\n }\n\n \/\/XXX do NOT call this from parallel region\n void make(neighbor_list_type& neighbors,\n const system_type& sys, const potential_type& pot) override\n {\n\tMJOLNIR_GET_DEFAULT_LOGGER_DEBUG();\n\tMJOLNIR_LOG_FUNCTION_DEBUG();\n\n \/\/ `participants` is a list that contains indices of particles that are\n \/\/ related to the potential.\n const auto& participants = pot.participants();\n\n neighbors.clear();\n if(index_by_cell_ .size() != sys.size() ||\n index_by_cell_buf_.size() != sys.size())\n {\n index_by_cell_ .resize(sys.size());\n index_by_cell_buf_.resize(sys.size());\n }\n\n#pragma omp parallel for\n for(std::size_t i=0; i<participants.size(); ++i)\n {\n const auto idx = participants[i];\n index_by_cell_[i] =\n std::make_pair(idx, this->calc_index(sys.position(idx)));\n }\n\n omp::sort(this->index_by_cell_, this->index_by_cell_buf_,\n [](const particle_cell_idx_pair& lhs,\n const particle_cell_idx_pair& rhs) noexcept -> bool {\n return lhs.second < rhs.second;\n });\n\n \/\/ assign first and last iterator for each cells\n#pragma omp parallel for\n for(std::size_t cell_idx=0; cell_idx<cell_list_.size(); ++cell_idx)\n {\n auto iter = std::find_if(index_by_cell_.cbegin(), index_by_cell_.cend(),\n [cell_idx](const particle_cell_idx_pair& item) noexcept -> bool {\n return item.second == cell_idx;\n });\n if(iter == index_by_cell_.cend())\n {\n cell_list_[cell_idx].first = make_range(iter, iter);\n continue;\n }\n const auto first = iter; \/\/ the first iter of the range\n while(iter != index_by_cell_.cend() && iter->second == cell_idx)\n {\n ++iter;\n }\n cell_list_[cell_idx].first = make_range(first, iter);\n }\n\n const real_type r_c = cutoff_ * (1 + margin_);\n const real_type r_c2 = r_c * r_c;\n\n\/\/XXX ParallelNeighborList consumes quite a lot of memory resources and makes\n\/\/XXX both construction and access slower (especially when system has a small\n\/\/XXX number of particles). Because of this, after some benchmarking, I found\n\/\/XXX that normal NeighborList works good for most of the cases. Some part of\n\/\/XXX neighbor-list construction cannot be parallelized, but it becomes still\n\/\/XXX faster.\n\n std::vector<neighbor_type> partner;\n for(std::size_t idx=0; idx<participants.size(); ++idx)\n {\n partner.clear();\n const auto i = participants[idx];\n const auto& ri = sys.position(i);\n const auto& cell = cell_list_[this->calc_index(ri)];\n\n MJOLNIR_LOG_DEBUG(\"particle position \", sys.position(i));\n MJOLNIR_LOG_DEBUG(\"cell index \", calc_index(ri));\n MJOLNIR_LOG_DEBUG(\"making verlet list for index \", i);\n\n for(std::size_t cidx : cell.second) \/\/ for all adjacent cells...\n {\n MJOLNIR_LOG_DEBUG(\"neighbor cell index \", cidx);\n for(auto pici : cell_list_[cidx].first)\n {\n const auto j = pici.first;\n MJOLNIR_LOG_DEBUG(\"looking particle \", j);\n if(j <= i || !pot.has_interaction(i, j))\n {\n continue;\n }\n \/\/ here we don't need to search `participants` because\n \/\/ cell list contains only participants. non-related\n \/\/ particles are already filtered.\n\n const auto& rj = sys.position(j);\n if(math::length_sq(sys.adjust_direction(rj - ri)) < r_c2)\n {\n MJOLNIR_LOG_DEBUG(\"add index \", j, \" to list \", i);\n partner.emplace_back(j, pot.prepare_params(i, j));\n }\n }\n }\n \/\/ make the result consistent with NaivePairCalculation...\n std::sort(partner.begin(), partner.end());\n neighbors.add_list_for(i, partner.begin(), partner.end());\n }\n\n this->current_margin_ = cutoff_ * margin_;\n return ;\n }\n\n \/\/XXX do NOT call this from `parallel` region.\n void update(neighbor_list_type& neighbors, const real_type dmargin,\n const system_type& sys, const potential_type& pot) override\n {\n this->current_margin_ -= dmargin;\n\n if(this->current_margin_ < 0.)\n {\n this->make(neighbors, sys, pot);\n }\n return ;\n }\n\n real_type cutoff() const noexcept override {return this->cutoff_;}\n real_type margin() const noexcept override {return this->margin_;}\n\n private:\n\n \/\/ calc cell index of the position\n std::size_t calc_index(const coordinate_type& pos) const noexcept\n {\n constexpr std::int64_t d = dim();\n const auto x = std::int64_t(std::floor(math::X(pos) * r_cell_size_)) % d;\n const auto y = std::int64_t(std::floor(math::Y(pos) * r_cell_size_)) % d;\n const auto z = std::int64_t(std::floor(math::Z(pos) * r_cell_size_)) % d;\n\n return this->calc_index((x<0) ? x+d : x, (y<0) ? y+d : y, (z<0) ? z+d : z);\n }\n\n std::size_t calc_index(const std::size_t x, const std::size_t y,\n const std::size_t z) const noexcept\n {\n return x + dim_size() * y + dim_size() * dim_size() * z;\n }\n\n void set_cutoff(const real_type c) noexcept\n {\n this->cutoff_ = c;\n this->r_cell_size_ = 1 \/ (cutoff_ * (1 + margin_) * (1+mesh_epsilon()));\n }\n void set_margin(const real_type m) noexcept\n {\n this->margin_ = m;\n this->r_cell_size_ = 1 \/ (cutoff_ * (1 + margin_) * (1+mesh_epsilon()));\n }\n\n private:\n\n real_type cutoff_;\n real_type margin_;\n real_type current_margin_;\n real_type r_cell_size_;\n\n neighbor_list_type neighbors_;\n cell_list_type cell_list_;\n cell_index_container_type index_by_cell_;\n cell_index_container_type index_by_cell_buf_; \/\/ buffer for sort\n \/\/ index_by_cell_ has {particle idx, cell idx} and sorted by cell idx\n \/\/ first term of cell list contains first and last idx of index_by_cell\n};\n} \/\/ mjolnir\n\n#ifdef MJOLNIR_SEPARATE_BUILD\n#include <mjolnir\/potential\/global\/DebyeHuckelPotential.hpp>\n#include <mjolnir\/potential\/global\/ExcludedVolumePotential.hpp>\n#include <mjolnir\/potential\/global\/LennardJonesPotential.hpp>\n#include <mjolnir\/potential\/global\/UniformLennardJonesPotential.hpp>\n\nnamespace mjolnir\n{\nextern template class UnlimitedGridCellList<OpenMPSimulatorTraits<double, UnlimitedBoundary>, DebyeHuckelPotential<double>>;\nextern template class UnlimitedGridCellList<OpenMPSimulatorTraits<float, UnlimitedBoundary>, DebyeHuckelPotential<float >>;\n\nextern template class UnlimitedGridCellList<OpenMPSimulatorTraits<double, UnlimitedBoundary>, ExcludedVolumePotential<double>>;\nextern template class UnlimitedGridCellList<OpenMPSimulatorTraits<float, UnlimitedBoundary>, ExcludedVolumePotential<float >>;\n\nextern template class UnlimitedGridCellList<OpenMPSimulatorTraits<double, UnlimitedBoundary>, LennardJonesPotential<double>>;\nextern template class UnlimitedGridCellList<OpenMPSimulatorTraits<float, UnlimitedBoundary>, LennardJonesPotential<float >>;\n\nextern template class UnlimitedGridCellList<OpenMPSimulatorTraits<double, UnlimitedBoundary>, UniformLennardJonesPotential<double>>;\nextern template class UnlimitedGridCellList<OpenMPSimulatorTraits<float, UnlimitedBoundary>, UniformLennardJonesPotential<float >>;\n}\n#endif \/\/ MJOLNIR_SEPARATE_BUILD\n#endif\/* MJOLNIR_UNLIMITED_GRID_CELL_LIST *\/\n<|endoftext|>"} {"text":"<commit_before>#pragma once\n#define PY_SSIZE_T_CLEAN\n#include <Python.h>\n#include <structmember.h>\n\n#define _mgl_str(x) #x\n#define _mgl_xstr(x) _mgl_str(x)\n#define mgl_mod _mgl_xstr(MODERNGL_MODULE)\n#define mgl_ext mgl_mod \".mgl\"\n\n\/* Wrapper classes for internal objects are defined in python. They must have __slots__ defined.\n * A slot can be accessed in O(1) once detect_class(...) and slot_offset(...) is called.\n *\/\n\n#define SLOT(obj, type, offset) (*(type **)((char *)obj + offset))\n\n\/* Shortcuts *\/\n\n#define NEW_REF(obj) (Py_INCREF(obj), obj)\n\n#ifndef Py_SETREF\n#define Py_SETREF(op, op2) \\\n do { \\\n PyObject *_py_tmp = (PyObject *)(op); \\\n (op) = (op2); \\\n Py_DECREF(_py_tmp); \\\n } while (0)\n#endif\n\n#ifndef Py_XSETREF\n#define Py_XSETREF(op, op2) \\\n do { \\\n PyObject *_py_tmp = (PyObject *)(op); \\\n (op) = (op2); \\\n Py_XDECREF(_py_tmp); \\\n } while (0)\n#endif\n\n\/* Classes defined in python must be instantiated using new_object(...)\n * The allocated memory is initialized to zero.\n * Slots can be set using the SLOT(...) macro.\n *\/\ninline PyObject * _new_object(PyTypeObject * type) {\n PyObject * res = 0;\n Py_INCREF(type);\n if (type->tp_flags & Py_TPFLAGS_HAVE_GC) {\n res = PyObject_GC_New(PyObject, type);\n } else {\n res = PyObject_New(PyObject, type);\n }\n return res;\n}\n\n#define new_object(type, typeobj) (type *)_new_object(typeobj)\n#define call_function(function, ...) PyObject_CallFunctionObjArgs(function, __VA_ARGS__, (void *)0)\n\ninline void replace_object(PyObject *& src, PyObject * dst) {\n Py_INCREF(dst);\n Py_DECREF(src);\n src = dst;\n}\n<commit_msg>clear slots on new<commit_after>#pragma once\n#define PY_SSIZE_T_CLEAN\n#include <Python.h>\n#include <structmember.h>\n\n#define _mgl_str(x) #x\n#define _mgl_xstr(x) _mgl_str(x)\n#define mgl_mod _mgl_xstr(MODERNGL_MODULE)\n#define mgl_ext mgl_mod \".mgl\"\n\n\/* Wrapper classes for internal objects are defined in python. They must have __slots__ defined.\n * A slot can be accessed in O(1) once detect_class(...) and slot_offset(...) is called.\n *\/\n\n#define SLOT(obj, type, offset) (*(type **)((char *)obj + offset))\n\n\/* Shortcuts *\/\n\n#define NEW_REF(obj) (Py_INCREF(obj), obj)\n\n#ifndef Py_SETREF\n#define Py_SETREF(op, op2) \\\n do { \\\n PyObject *_py_tmp = (PyObject *)(op); \\\n (op) = (op2); \\\n Py_DECREF(_py_tmp); \\\n } while (0)\n#endif\n\n#ifndef Py_XSETREF\n#define Py_XSETREF(op, op2) \\\n do { \\\n PyObject *_py_tmp = (PyObject *)(op); \\\n (op) = (op2); \\\n Py_XDECREF(_py_tmp); \\\n } while (0)\n#endif\n\n\/* Classes defined in python must be instantiated using new_object(...)\n * The allocated memory is initialized to zero.\n * Slots can be set using the SLOT(...) macro.\n *\/\ninline PyObject * _new_object(PyTypeObject * type) {\n PyObject * res = 0;\n Py_INCREF(type);\n if (type->tp_flags & Py_TPFLAGS_HAVE_GC) {\n res = PyObject_GC_New(PyObject, type);\n for (int i = 0; res->ob_type->tp_members[i].name; ++i) {\n SLOT(res, PyObject, (int)res->ob_type->tp_members[i].offset) = 0;\n }\n } else {\n res = PyObject_New(PyObject, type);\n }\n return res;\n}\n\n#define new_object(type, typeobj) (type *)_new_object(typeobj)\n#define call_function(function, ...) PyObject_CallFunctionObjArgs(function, __VA_ARGS__, (void *)0)\n\ninline void replace_object(PyObject *& src, PyObject * dst) {\n Py_INCREF(dst);\n Py_DECREF(src);\n src = dst;\n}\n<|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\/Accounts\/Player.h>\n#include <hspp\/Cards\/Character.h>\n\n#include <algorithm>\n\nnamespace Hearthstonepp\n{\nCharacter::Character(Card& card) : Entity(card)\n{\n if (!card.id.empty())\n {\n#ifndef HEARTHSTONEPP_MACOSX\n m_attack = card.attack.has_value() ? card.attack.value() : 0;\n health = card.health.has_value() ? card.health.value() : 0;\n#else\n m_attack = card.attack.value_or(0);\n health = card.health.value_or(0);\n#endif\n maxHealth = health;\n }\n}\n\nCharacter* Character::Clone() const\n{\n return new Character(*this);\n}\n\nsize_t Character::GetAttack() const\n{\n return m_attack;\n}\n\nvoid Character::SetAttack(size_t attack)\n{\n m_attack = attack;\n}\n\nbool Character::CanAttack() const\n{\n \/\/ If the value of attack is 0, returns false\n if (GetAttack() == 0)\n {\n return false;\n }\n\n \/\/ If the character is frozen, returns false\n if (GetGameTag(GameTag::FROZEN) == 1)\n {\n return false;\n }\n\n \/\/ If attack count is 0, returns false\n if (attackableCount == 0)\n {\n return false;\n }\n\n return true;\n}\n\nbool Character::IsValidAttackTarget(Player& opponent, Character* target) const\n{\n auto validTargets = GetValidAttackTargets(opponent);\n if (std::find(validTargets.begin(), validTargets.end(), target) ==\n validTargets.end())\n {\n return false;\n }\n\n const Hero* hero = dynamic_cast<Hero*>(target);\n return (hero == nullptr) ||\n (hero->GetGameTag(GameTag::CANNOT_ATTACK_HEROES) == 1);\n}\n\nstd::vector<Character*> Character::GetValidAttackTargets(Player& opponent)\n{\n bool isExistTauntInField = false;\n std::vector<Character*> targets;\n std::vector<Character*> targetsHaveTaunt;\n\n for (auto& minion : opponent.field)\n {\n if (minion->GetGameTag(GameTag::STEALTH) == 0)\n {\n if (minion->GetGameTag(GameTag::TAUNT) == 1)\n {\n isExistTauntInField = true;\n targetsHaveTaunt.emplace_back(minion);\n continue;\n }\n\n if (!isExistTauntInField)\n {\n targets.emplace_back(minion);\n }\n }\n }\n\n if (isExistTauntInField)\n {\n return targetsHaveTaunt;\n }\n\n if (opponent.hero->GetGameTag(GameTag::CANNOT_ATTACK_HEROES) == 0 &&\n opponent.hero->GetGameTag(GameTag::IMMUNE) == 0 &&\n opponent.hero->GetGameTag(GameTag::STEALTH) == 0)\n {\n targets.emplace_back(opponent.hero);\n }\n\n return targets;\n}\n\nsize_t Character::TakeDamage(Character& source, size_t damage)\n{\n (void)source;\n\n if (GetGameTag(GameTag::DIVINE_SHIELD) == 1)\n {\n SetGameTag(GameTag::DIVINE_SHIELD, 0);\n return 0;\n }\n\n if (GetGameTag(GameTag::IMMUNE) == 1)\n {\n return 0;\n }\n\n health = (health <= damage) ? 0 : health - damage;\n\n return damage;\n}\n} \/\/ namespace Hearthstonepp<commit_msg>fix: Unit test fail (Incorrect condition)<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\/Accounts\/Player.h>\n#include <hspp\/Cards\/Character.h>\n\n#include <algorithm>\n\nnamespace Hearthstonepp\n{\nCharacter::Character(Card& card) : Entity(card)\n{\n if (!card.id.empty())\n {\n#ifndef HEARTHSTONEPP_MACOSX\n m_attack = card.attack.has_value() ? card.attack.value() : 0;\n health = card.health.has_value() ? card.health.value() : 0;\n#else\n m_attack = card.attack.value_or(0);\n health = card.health.value_or(0);\n#endif\n maxHealth = health;\n }\n}\n\nCharacter* Character::Clone() const\n{\n return new Character(*this);\n}\n\nsize_t Character::GetAttack() const\n{\n return m_attack;\n}\n\nvoid Character::SetAttack(size_t attack)\n{\n m_attack = attack;\n}\n\nbool Character::CanAttack() const\n{\n \/\/ If the value of attack is 0, returns false\n if (GetAttack() == 0)\n {\n return false;\n }\n\n \/\/ If the character is frozen, returns false\n if (GetGameTag(GameTag::FROZEN) == 1)\n {\n return false;\n }\n\n \/\/ If attack count is 0, returns false\n if (attackableCount == 0)\n {\n return false;\n }\n\n return true;\n}\n\nbool Character::IsValidAttackTarget(Player& opponent, Character* target) const\n{\n auto validTargets = GetValidAttackTargets(opponent);\n if (std::find(validTargets.begin(), validTargets.end(), target) ==\n validTargets.end())\n {\n return false;\n }\n\n const Hero* hero = dynamic_cast<Hero*>(target);\n return !(hero != nullptr &&\n hero->GetGameTag(GameTag::CANNOT_ATTACK_HEROES) == 1);\n}\n\nstd::vector<Character*> Character::GetValidAttackTargets(Player& opponent)\n{\n bool isExistTauntInField = false;\n std::vector<Character*> targets;\n std::vector<Character*> targetsHaveTaunt;\n\n for (auto& minion : opponent.field)\n {\n if (minion->GetGameTag(GameTag::STEALTH) == 0)\n {\n if (minion->GetGameTag(GameTag::TAUNT) == 1)\n {\n isExistTauntInField = true;\n targetsHaveTaunt.emplace_back(minion);\n continue;\n }\n\n if (!isExistTauntInField)\n {\n targets.emplace_back(minion);\n }\n }\n }\n\n if (isExistTauntInField)\n {\n return targetsHaveTaunt;\n }\n\n if (opponent.hero->GetGameTag(GameTag::CANNOT_ATTACK_HEROES) == 0 &&\n opponent.hero->GetGameTag(GameTag::IMMUNE) == 0 &&\n opponent.hero->GetGameTag(GameTag::STEALTH) == 0)\n {\n targets.emplace_back(opponent.hero);\n }\n\n return targets;\n}\n\nsize_t Character::TakeDamage(Character& source, size_t damage)\n{\n (void)source;\n\n if (GetGameTag(GameTag::DIVINE_SHIELD) == 1)\n {\n SetGameTag(GameTag::DIVINE_SHIELD, 0);\n return 0;\n }\n\n if (GetGameTag(GameTag::IMMUNE) == 1)\n {\n return 0;\n }\n\n health = (health <= damage) ? 0 : health - damage;\n\n return damage;\n}\n} \/\/ namespace Hearthstonepp<|endoftext|>"} {"text":"<commit_before>#ifndef STAN_MATH_REV_FUN_DIAG_PRE_MULTIPLY_HPP\n#define STAN_MATH_REV_FUN_DIAG_PRE_MULTIPLY_HPP\n\n#include <stan\/math\/prim\/fun\/Eigen.hpp>\n#include <stan\/math\/prim\/meta.hpp>\n#include <stan\/math\/prim\/err.hpp>\n#include <stan\/math\/prim\/fun\/eval.hpp>\n#include <stan\/math\/rev\/core.hpp>\n#include <stan\/math\/rev\/fun\/multiply.hpp>\n\n#include <iostream>\n\n\nnamespace stan {\nnamespace math {\n\n\/**\n * Return the elementwise multiplication of the specified\n * matrices.\n *\n * @tparam Mat1 type of the first matrix or expression\n * @tparam Mat2 type of the second matrix or expression\n *\n * @param m1 First matrix or expression\n * @param m2 Second matrix or expression\n * @return Elementwise product of matrices.\n *\/\ntemplate <typename Mat1, typename Mat2,\n require_all_matrix_t<Mat1, Mat2>* = nullptr,\n require_any_rev_matrix_t<Mat1, Mat2>* = nullptr>\n\/* template <typename Mat1, typename Mat2, \n\t\t\t\t\trequire_eigen_vector_t<Mat1>* = nullptr,\n require_eigen_t<Mat2>* = nullptr> *\/\n\/\/ template <typename Mat1, typename Mat2>\nauto diag_pre_multiply(const Mat1& m1, const Mat2& m2) {\n\tstd::cout << \"I am using rev.\" << std::endl;\n \/\/ check_matching_dims(\"elt_multiply\", \"m1\", m1, \"m2\", m2);\n\t\n\t\n\t\n\tcheck_size_match(\"diag_pre_multiply\", \"m1.size()\", m1.size(), \"m2.rows()\",\n m2.rows());\n using inner_ret_type = decltype(value_of(m1).asDiagonal() * value_of(m2));\n using ret_type = return_var_matrix_t<inner_ret_type, Mat1, Mat2>;\n if (!is_constant<Mat1>::value && !is_constant<Mat2>::value) {\n arena_t<promote_scalar_t<var, Mat1>> arena_m1 = m1;\n arena_t<promote_scalar_t<var, Mat2>> arena_m2 = m2;\n arena_t<ret_type> ret(arena_m1.val().asDiagonal() * arena_m2.val());\n reverse_pass_callback([ret, arena_m1, arena_m2]() mutable {\n for (int i = 0; i < arena_m2.cols(); ++i) {\n for (int j = 0; j < arena_m2.rows(); ++j) {\n const auto ret_adj = ret.adj().coeffRef(i, j);\n arena_m1.adj().coeffRef(i) += arena_m2.val().coeff(i, j) * ret_adj;\n arena_m2.adj().coeffRef(i, j) += arena_m1.val().coeff(i) * ret_adj;\n }\n }\n });\n return ret_type(ret);\n } else if (!is_constant<Mat1>::value) {\n\t\tstd::cout << \"Inside else if.\" << std::endl;\n arena_t<promote_scalar_t<var, Mat1>> arena_m1 = m1;\n arena_t<promote_scalar_t<double, Mat2>> arena_m2 = value_of(m2);\n arena_t<ret_type> ret(arena_m1.val().asDiagonal() * arena_m2);\n\t\tstd::cout << ret << std::endl;\n\t\tstd::cout << \"ret.adj(): \" << std::endl << ret.adj() << std::endl \n\t\t\t<< \"---------------\" << std::endl;\n reverse_pass_callback([ret, arena_m1, arena_m2]() mutable {\n\t\t\tfor (int i = 0; i < arena_m1.size(); ++i) {\n\t\t\t\tfor (int j = 0; j < arena_m1.size(); ++j) {\n\t\t\t\t\tarena_m1.adj().coeffRef(i) += arena_m2.val().coeff(i, j) *\n\t\t\t\t\t\tret.adj().coeffRef(i, j);\n\t\t\t\t}\n\t\t\t}\n\t\t\tstd::cout << \"ret.adj(): \" << std::endl << ret.adj() << std::endl \n\t\t\t<< \"---------------\" << std::endl;\n\t\t\tstd::cout << \"ret.adj().array(): \" << std::endl << ret.adj().array() << std::endl \n\t\t\t<< \"---------------\" << std::endl;\n\t\t\t\/\/ arena.m1.adj().coeffRef(i) += \n \/\/ arena_m1.adj().array() += arena_m2.array() * ret.adj().array(); \/\/ CHANGE HERE!\n });\n return ret_type(ret);\n } else if (!is_constant<Mat2>::value) {\n arena_t<promote_scalar_t<double, Mat1>> arena_m1 = value_of(m1);\n arena_t<promote_scalar_t<var, Mat2>> arena_m2 = m2;\n\t\tarena_t<ret_type> ret(arena_m1.asDiagonal() * arena_m2.val());\n\t\tstd::cout << \"Initialized adj():\" << std::endl << arena_m2.adj()\n\t\t\t<< std::endl << \"-------------------\" << std::endl;\n\t\tstd::cout << \"Initialized adj().coeffRef:\" << std::endl << arena_m2.adj().coeffRef(0, 0)\n\t\t\t<< std::endl << \"-------------------\" << std::endl;\n\t\tstd::cout << \"arena_m1.val():\" << std::endl << arena_m1.val()\n\t\t\t<< std::endl << \"-------------------\" << std::endl;\n\t\tstd::cout << \"ret.adj():\" << std::endl << ret.adj()\n\t\t\t<< std::endl << \"-------------------\" << std::endl;\n\t\tstd::cout << \"m1.size():\" << std::endl << arena_m1.size()\n\t\t\t<< std::endl << \"-------------------\" << std::endl;\n\t\tstd::cout << \"ret:\" << std::endl << ret\n\t\t\t<< std::endl << \"-------------------\" << std::endl;\n reverse_pass_callback([ret, arena_m1, arena_m2]() mutable {\n\t\t\tstd::cout << \"hh\" << std::endl;\n\t\t\t\/* for (int i = 0; i < arena_m1.size(); ++i) {\n\t\t\t\tfor (int j = 0; j < arena_m1.size(); ++j) {\n\t\t\t\t\tstd::cout << \"oo\" << std::endl;\n\t\t\t\t\t\/\/ arena_m2.adj().coeffRef(i,j) += 2;\n\t\t\t\t\t\/\/arena_m2.adj().coeffRef(i,j) += arena_m1.val().coeff(i); *\n\t\t\t\t\t\/\/\tret.adj().coeffRef(i, j);\n\t\t\t\t}\n\t\t\t} *\/\n });\n\t\tstd::cout << \"Works here.\" << std::endl;\n return ret_type(ret);\n }\n}\n\n} \/\/ namespace math\n} \/\/ namespace stan\n\n\n#endif\n<commit_msg>Cleaned up couts.<commit_after>#ifndef STAN_MATH_REV_FUN_DIAG_PRE_MULTIPLY_HPP\n#define STAN_MATH_REV_FUN_DIAG_PRE_MULTIPLY_HPP\n\n#include <stan\/math\/prim\/fun\/Eigen.hpp>\n#include <stan\/math\/prim\/meta.hpp>\n#include <stan\/math\/prim\/err.hpp>\n#include <stan\/math\/prim\/fun\/eval.hpp>\n#include <stan\/math\/rev\/core.hpp>\n#include <stan\/math\/rev\/fun\/multiply.hpp>\n\n#include <iostream>\n\n\nnamespace stan {\nnamespace math {\n\n\/**\n * Return the elementwise multiplication of the specified\n * matrices.\n *\n * @tparam Mat1 type of the first matrix or expression\n * @tparam Mat2 type of the second matrix or expression\n *\n * @param m1 First matrix or expression\n * @param m2 Second matrix or expression\n * @return Elementwise product of matrices.\n *\/\ntemplate <typename Mat1, typename Mat2,\n require_all_matrix_t<Mat1, Mat2>* = nullptr,\n require_any_rev_matrix_t<Mat1, Mat2>* = nullptr>\n\/* template <typename Mat1, typename Mat2, \n\t\t\t\t\trequire_eigen_vector_t<Mat1>* = nullptr,\n require_eigen_t<Mat2>* = nullptr> *\/\n\/\/ template <typename Mat1, typename Mat2>\nauto diag_pre_multiply(const Mat1& m1, const Mat2& m2) {\n\tstd::cout << \"I am using rev.\" << std::endl;\n \/\/ check_matching_dims(\"elt_multiply\", \"m1\", m1, \"m2\", m2);\n\t\n\t\n\t\n\tcheck_size_match(\"diag_pre_multiply\", \"m1.size()\", m1.size(), \"m2.rows()\",\n m2.rows());\n using inner_ret_type = decltype(value_of(m1).asDiagonal() * value_of(m2));\n using ret_type = return_var_matrix_t<inner_ret_type, Mat1, Mat2>;\n if (!is_constant<Mat1>::value && !is_constant<Mat2>::value) {\n arena_t<promote_scalar_t<var, Mat1>> arena_m1 = m1;\n arena_t<promote_scalar_t<var, Mat2>> arena_m2 = m2;\n arena_t<ret_type> ret(arena_m1.val().asDiagonal() * arena_m2.val());\n reverse_pass_callback([ret, arena_m1, arena_m2]() mutable {\n for (int i = 0; i < arena_m2.cols(); ++i) {\n for (int j = 0; j < arena_m2.rows(); ++j) {\n const auto ret_adj = ret.adj().coeffRef(i, j);\n arena_m1.adj().coeffRef(i) += arena_m2.val().coeff(i, j) * ret_adj;\n arena_m2.adj().coeffRef(i, j) += arena_m1.val().coeff(i) * ret_adj;\n }\n }\n });\n return ret_type(ret);\n } else if (!is_constant<Mat1>::value) {\n arena_t<promote_scalar_t<var, Mat1>> arena_m1 = m1;\n arena_t<promote_scalar_t<double, Mat2>> arena_m2 = value_of(m2);\n arena_t<ret_type> ret(arena_m1.val().asDiagonal() * arena_m2);\n reverse_pass_callback([ret, arena_m1, arena_m2]() mutable {\n\t\t\tfor (int i = 0; i < arena_m1.size(); ++i) {\n\t\t\t\tfor (int j = 0; j < arena_m1.size(); ++j) {\n\t\t\t\t\tarena_m1.adj().coeffRef(i) += arena_m2.val().coeff(i, j) *\n\t\t\t\t\t\tret.adj().coeffRef(i, j);\n\t\t\t\t}\n\t\t\t}\n });\n return ret_type(ret);\n } else if (!is_constant<Mat2>::value) {\n arena_t<promote_scalar_t<double, Mat1>> arena_m1 = value_of(m1);\n arena_t<promote_scalar_t<var, Mat2>> arena_m2 = m2;\n\t\tarena_t<ret_type> ret(arena_m1.asDiagonal() * arena_m2.val());\n\t\tstd::cout << \"Initialized adj():\" << std::endl << arena_m2.adj()\n\t\t\t<< std::endl << \"-------------------\" << std::endl;\n\t\tstd::cout << \"Initialized adj().coeffRef:\" << std::endl << arena_m2.adj().coeffRef(0, 0)\n\t\t\t<< std::endl << \"-------------------\" << std::endl;\n\t\tstd::cout << \"arena_m1.val():\" << std::endl << arena_m1.val()\n\t\t\t<< std::endl << \"-------------------\" << std::endl;\n\t\tstd::cout << \"ret.adj():\" << std::endl << ret.adj()\n\t\t\t<< std::endl << \"-------------------\" << std::endl;\n\t\tstd::cout << \"m1.size():\" << std::endl << arena_m1.size()\n\t\t\t<< std::endl << \"-------------------\" << std::endl;\n\t\tstd::cout << \"ret:\" << std::endl << ret\n\t\t\t<< std::endl << \"-------------------\" << std::endl;\n reverse_pass_callback([ret, arena_m1, arena_m2]() mutable {\n\t\t\tstd::cout << \"hh\" << std::endl;\n\t\t\t\/* for (int i = 0; i < arena_m1.size(); ++i) {\n\t\t\t\tfor (int j = 0; j < arena_m1.size(); ++j) {\n\t\t\t\t\tstd::cout << \"oo\" << std::endl;\n\t\t\t\t\t\/\/ arena_m2.adj().coeffRef(i,j) += 2;\n\t\t\t\t\t\/\/arena_m2.adj().coeffRef(i,j) += arena_m1.val().coeff(i); *\n\t\t\t\t\t\/\/\tret.adj().coeffRef(i, j);\n\t\t\t\t}\n\t\t\t} *\/\n });\n\t\tstd::cout << \"Works here.\" << std::endl;\n return ret_type(ret);\n }\n}\n\n} \/\/ namespace math\n} \/\/ namespace stan\n\n\n#endif\n<|endoftext|>"} {"text":"<commit_before>#ifndef STAN_MATH_REV_FUN_ORDERED_CONSTRAIN_HPP\n#define STAN_MATH_REV_FUN_ORDERED_CONSTRAIN_HPP\n\n#include <stan\/math\/rev\/meta.hpp>\n#include <stan\/math\/rev\/functor\/reverse_pass_callback.hpp>\n#include <stan\/math\/rev\/core\/arena_matrix.hpp>\n#include <stan\/math\/rev\/fun\/value_of.hpp>\n#include <stan\/math\/prim\/fun\/Eigen.hpp>\n#include <cmath>\n#include <tuple>\n#include <vector>\n\nnamespace stan {\nnamespace math {\n\n\/**\n * Return an increasing ordered vector derived from the specified\n * free vector. The returned constrained vector will have the\n * same dimensionality as the specified free vector.\n *\n * @param x Free vector of scalars\n * @return Increasing ordered vector\n *\/\ntemplate <typename T, require_rev_matrix_t<T>* = nullptr>\ninline auto ordered_constrain(const T& x) {\n using ret_type = plain_type_t<T>;\n\n using std::exp;\n\n size_t N = x.size();\n if (N == 0) {\n return ret_type(x);\n }\n\n Eigen::VectorXd y_val(N);\n arena_t<T> arena_x = x;\n arena_t<Eigen::VectorXd> exp_x(N - 1);\n\n y_val.coeffRef(0) = value_of(x)(0);\n for (int n = 1; n < N; ++n) {\n exp_x.coeffRef(n - 1) = exp(value_of(arena_x)(n));\n y_val.coeffRef(n) = y_val.coeff(n - 1) + exp_x.coeff(n - 1);\n }\n\n arena_t<ret_type> y = y_val;\n\n reverse_pass_callback([arena_x, y, exp_x]() mutable {\n double rolling_adjoint_sum = 0.0;\n\n for (int n = arena_x.size() - 1; n > 0; --n) {\n rolling_adjoint_sum += y.adj().coeff(n);\n arena_x.adj().coeffRef(n) += exp_x.coeff(n - 1) * rolling_adjoint_sum;\n }\n arena_x.adj().coeffRef(0) += rolling_adjoint_sum + y.adj().coeff(0);\n });\n\n return ret_type(y);\n}\n\n} \/\/ namespace math\n} \/\/ namespace stan\n#endif\n<commit_msg>ordered_constrain not tested for `var<mat>` (Issue #2101)<commit_after>#ifndef STAN_MATH_REV_FUN_ORDERED_CONSTRAIN_HPP\n#define STAN_MATH_REV_FUN_ORDERED_CONSTRAIN_HPP\n\n#include <stan\/math\/rev\/meta.hpp>\n#include <stan\/math\/rev\/functor\/reverse_pass_callback.hpp>\n#include <stan\/math\/rev\/core\/arena_matrix.hpp>\n#include <stan\/math\/rev\/fun\/value_of.hpp>\n#include <stan\/math\/prim\/fun\/Eigen.hpp>\n#include <cmath>\n#include <tuple>\n#include <vector>\n\nnamespace stan {\nnamespace math {\n\n\/**\n * Return an increasing ordered vector derived from the specified\n * free vector. The returned constrained vector will have the\n * same dimensionality as the specified free vector.\n *\n * @param x Free vector of scalars\n * @return Increasing ordered vector\n *\/\ntemplate <typename T, require_eigen_col_vector_vt<is_var, T>* = nullptr>\ninline auto ordered_constrain(const T& x) {\n using ret_type = plain_type_t<T>;\n\n using std::exp;\n\n size_t N = x.size();\n if (N == 0) {\n return ret_type(x);\n }\n\n Eigen::VectorXd y_val(N);\n arena_t<T> arena_x = x;\n arena_t<Eigen::VectorXd> exp_x(N - 1);\n\n y_val.coeffRef(0) = value_of(x)(0);\n for (int n = 1; n < N; ++n) {\n exp_x.coeffRef(n - 1) = exp(value_of(arena_x)(n));\n y_val.coeffRef(n) = y_val.coeff(n - 1) + exp_x.coeff(n - 1);\n }\n\n arena_t<ret_type> y = y_val;\n\n reverse_pass_callback([arena_x, y, exp_x]() mutable {\n double rolling_adjoint_sum = 0.0;\n\n for (int n = arena_x.size() - 1; n > 0; --n) {\n rolling_adjoint_sum += y.adj().coeff(n);\n arena_x.adj().coeffRef(n) += exp_x.coeff(n - 1) * rolling_adjoint_sum;\n }\n arena_x.adj().coeffRef(0) += rolling_adjoint_sum + y.adj().coeff(0);\n });\n\n return ret_type(y);\n}\n\n} \/\/ namespace math\n} \/\/ namespace stan\n#endif\n<|endoftext|>"} {"text":"<commit_before><commit_msg>Activated an aditional unit test on windows.<commit_after><|endoftext|>"} {"text":"<commit_before>#include \"queryconfig.h\"\n\n#include <thread>\n\nannis::QueryConfig::QueryConfig()\n : optimize(true), forceFallback(false), avoidNestedBySwitch(true) ,\n numOfBackgroundTasks(0), threadPool(nullptr)\n\n{\n size_t numOfCPUs = std::thread::hardware_concurrency();\n if(numOfCPUs > 0)\n {\n numOfBackgroundTasks = numOfCPUs-1;\n threadPool = std::make_shared<ThreadPool>(numOfBackgroundTasks);\n }\n}\n<commit_msg>Default to non parallel QueryConfig.<commit_after>#include \"queryconfig.h\"\n\n#include <thread>\n\nannis::QueryConfig::QueryConfig()\n : optimize(true), forceFallback(false), avoidNestedBySwitch(true) ,\n numOfBackgroundTasks(0), threadPool(nullptr)\n\n{\n\/\/ size_t numOfCPUs = std::thread::hardware_concurrency();\n\/\/ if(numOfCPUs > 0)\n\/\/ {\n\/\/ numOfBackgroundTasks = numOfCPUs-1;\n\/\/ threadPool = std::make_shared<ThreadPool>(numOfBackgroundTasks);\n\/\/ }\n}\n<|endoftext|>"} {"text":"<commit_before>#ifndef MPACK_AVLITERATOR_IMPL_HPP\n#define MPACK_AVLITERATOR_IMPL_HPP\n\nnamespace MPACK\n{\n\tnamespace Algorithm\n\t{\n\t\ttemplate<class T> AVL<T>::Iterator::Iterator()\n\t\t{\n\t\t}\n\n\t\ttemplate<class T> AVL<T>::Iterator::Iterator(const Iterator& other)\n\t\t\t: m_avl(other.m_avl), m_node(other.m_node), m_count(other.m_count)\n\t\t{\n\t\t}\n\n\t\ttemplate<class T> const typename AVL<T>::Iterator& AVL<T>::Iterator::operator= (const typename AVL<T>::Iterator& other)\n\t\t{\n\t\t\tm_avl = other.m_avl;\n\t\t\tm_node = other.m_node;\n\t\t\tm_count = other.m_count;\n\t\t\treturn other;\n\t\t}\n\n\t\ttemplate<class T> T AVL<T>::Iterator::operator* () const\n\t\t{\n\t\t\treturn m_node->m_value;\n\t\t}\n\n\t\ttemplate<class T> const T* AVL<T>::Iterator::operator-> () const\n\t\t{\n\t\t\treturn &m_node->m_value;\n\t\t}\n\n\t\ttemplate<class T> typename AVL<T>::Iterator& AVL<T>::Iterator::operator++ ()\n\t\t{\n\t\t\tNext();\n\t\t\treturn *this;\n\t\t}\n\n\t\ttemplate<class T> typename AVL<T>::Iterator AVL<T>::Iterator::operator++ (int)\n\t\t{\n\t\t\tIterator tempIt=*this;\n\t\t\tNext();\n\t\t\treturn tempIt;\n\t\t}\n\n\t\ttemplate<class T> typename AVL<T>::Iterator& AVL<T>::Iterator::operator-- ()\n\t\t{\n\t\t\tPrev();\n\t\t\treturn *this;\n\t\t}\n\n\t\ttemplate<class T> typename AVL<T>::Iterator AVL<T>::Iterator::operator-- (int)\n\t\t{\n\t\t\tIterator tempIt=*this;\n\t\t\tPrev();\n\t\t\treturn tempIt;\n\t\t}\n\n\t\ttemplate<class T> bool AVL<T>::Iterator::operator!= (const Iterator &other) const\n\t\t{\n\t\t\treturn this->m_node!=other.m_node || this->m_count!=other.m_count;\n\t\t}\n\n\t\ttemplate<class T> bool AVL<T>::Iterator::operator== (const Iterator &other) const\n\t\t{\n\t\t\treturn this->m_node==other.m_node && this->m_count==other.m_count;\n\t\t}\n\n\t\ttemplate<class T> AVL<T>::Iterator::Iterator(AVL<T> *avl, AVLNode<T> *node, int count)\n\t\t\t: m_avl(avl), m_node(node), m_count(count)\n\t\t{\n\t\t}\n\n\t\ttemplate<class T> void AVL<T>::Iterator::Next()\n\t\t{\n\t\t\t++m_count;\n\t\t\tif(m_count > m_node->m_count)\n\t\t\t{\n\t\t\t\tm_avl->m_param1 = m_node->m_value;\n\t\t\t\tm_node = m_avl->Next(m_avl->m_root);\n\t\t\t\tif(m_node)\n\t\t\t\t{\n\t\t\t\t\tm_count = 1;\n\t\t\t\t}\n\t\t\t\telse\n\t\t\t\t{\n\t\t\t\t\tm_count = 0;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\ttemplate<class T> void AVL<T>::Iterator::Prev()\n\t\t{\n\t\t\t--m_count;\n\t\t\tif(m_count <= 0)\n\t\t\t{\n\t\t\t\tm_avl->m_param1 = m_node->m_value;\n\t\t\t\tm_node = m_avl->Prev(m_avl->m_root);\n\t\t\t\tif(m_node)\n\t\t\t\t{\n\t\t\t\t\tm_count = m_node->m_count;\n\t\t\t\t}\n\t\t\t\telse\n\t\t\t\t{\n\t\t\t\t\tm_count=0;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n}\n\n#endif\n<commit_msg>Fix AVLIterator warning<commit_after>#ifndef MPACK_AVLITERATOR_IMPL_HPP\n#define MPACK_AVLITERATOR_IMPL_HPP\n\nnamespace MPACK\n{\n\tnamespace Algorithm\n\t{\n\t\ttemplate<class T> AVL<T>::Iterator::Iterator()\n\t\t\t: m_avl(NULL), m_node(NULL), m_count(0)\n\t\t{\n\t\t}\n\n\t\ttemplate<class T> AVL<T>::Iterator::Iterator(const Iterator& other)\n\t\t\t: m_avl(other.m_avl), m_node(other.m_node), m_count(other.m_count)\n\t\t{\n\t\t}\n\n\t\ttemplate<class T> const typename AVL<T>::Iterator& AVL<T>::Iterator::operator= (const typename AVL<T>::Iterator& other)\n\t\t{\n\t\t\tm_avl = other.m_avl;\n\t\t\tm_node = other.m_node;\n\t\t\tm_count = other.m_count;\n\t\t\treturn other;\n\t\t}\n\n\t\ttemplate<class T> T AVL<T>::Iterator::operator* () const\n\t\t{\n\t\t\treturn m_node->m_value;\n\t\t}\n\n\t\ttemplate<class T> const T* AVL<T>::Iterator::operator-> () const\n\t\t{\n\t\t\treturn &m_node->m_value;\n\t\t}\n\n\t\ttemplate<class T> typename AVL<T>::Iterator& AVL<T>::Iterator::operator++ ()\n\t\t{\n\t\t\tNext();\n\t\t\treturn *this;\n\t\t}\n\n\t\ttemplate<class T> typename AVL<T>::Iterator AVL<T>::Iterator::operator++ (int)\n\t\t{\n\t\t\tIterator tempIt=*this;\n\t\t\tNext();\n\t\t\treturn tempIt;\n\t\t}\n\n\t\ttemplate<class T> typename AVL<T>::Iterator& AVL<T>::Iterator::operator-- ()\n\t\t{\n\t\t\tPrev();\n\t\t\treturn *this;\n\t\t}\n\n\t\ttemplate<class T> typename AVL<T>::Iterator AVL<T>::Iterator::operator-- (int)\n\t\t{\n\t\t\tIterator tempIt=*this;\n\t\t\tPrev();\n\t\t\treturn tempIt;\n\t\t}\n\n\t\ttemplate<class T> bool AVL<T>::Iterator::operator!= (const Iterator &other) const\n\t\t{\n\t\t\treturn this->m_node!=other.m_node || this->m_count!=other.m_count;\n\t\t}\n\n\t\ttemplate<class T> bool AVL<T>::Iterator::operator== (const Iterator &other) const\n\t\t{\n\t\t\treturn this->m_node==other.m_node && this->m_count==other.m_count;\n\t\t}\n\n\t\ttemplate<class T> AVL<T>::Iterator::Iterator(AVL<T> *avl, AVLNode<T> *node, int count)\n\t\t\t: m_avl(avl), m_node(node), m_count(count)\n\t\t{\n\t\t}\n\n\t\ttemplate<class T> void AVL<T>::Iterator::Next()\n\t\t{\n\t\t\t++m_count;\n\t\t\tif(m_count > m_node->m_count)\n\t\t\t{\n\t\t\t\tm_avl->m_param1 = m_node->m_value;\n\t\t\t\tm_node = m_avl->Next(m_avl->m_root);\n\t\t\t\tif(m_node)\n\t\t\t\t{\n\t\t\t\t\tm_count = 1;\n\t\t\t\t}\n\t\t\t\telse\n\t\t\t\t{\n\t\t\t\t\tm_count = 0;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\ttemplate<class T> void AVL<T>::Iterator::Prev()\n\t\t{\n\t\t\t--m_count;\n\t\t\tif(m_count <= 0)\n\t\t\t{\n\t\t\t\tm_avl->m_param1 = m_node->m_value;\n\t\t\t\tm_node = m_avl->Prev(m_avl->m_root);\n\t\t\t\tif(m_node)\n\t\t\t\t{\n\t\t\t\t\tm_count = m_node->m_count;\n\t\t\t\t}\n\t\t\t\telse\n\t\t\t\t{\n\t\t\t\t\tm_count=0;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n}\n\n#endif\n<|endoftext|>"} {"text":"<commit_before>\/*************************************************************************\n *\n * OpenOffice.org - a multi-platform office productivity suite\n *\n * $RCSfile: opcodes.hxx,v $\n *\n * $Revision: 1.10 $\n *\n * last change: $Author: hr $ $Date: 2005-09-29 16:31: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#ifndef _OPCODES_HXX\n#define _OPCODES_HXX\n\n#include \"sbintern.hxx\"\n\n#ifdef MTW\n#undef _NUMBER\n#endif\n\n\/\/ Ein Opcode ist entweder 1, 3 oder 5 Bytes lang, je nach numerischen\n\/\/ Wert des Opcodes (s.u.).\n\nenum SbiOpcode {\n \/\/ Alle Opcodes ohne Operanden\n _NOP = 0,\n\n SbOP0_START = _NOP,\n\n \/\/ Operatoren\n \/\/ die folgenden Operatoren sind genauso angeordnet\n \/\/ wie der enum SbxVarOp\n _EXP, _MUL, _DIV, _MOD, _PLUS, _MINUS, _NEG,\n _EQ, _NE, _LT, _GT, _LE, _GE,\n _IDIV, _AND, _OR, _XOR, _EQV, _IMP, _NOT,\n _CAT,\n \/\/ Ende enum SbxVarOp\n _LIKE, _IS,\n \/\/ Laden\/speichern\n _ARGC, \/\/ neuen Argv einrichten\n _ARGV, \/\/ TOS ==> aktueller Argv\n _INPUT, \/\/ Input ==> TOS\n _LINPUT, \/\/ Line Input ==> TOS\n _GET, \/\/ TOS anfassen\n _SET, \/\/ Speichern Objekt TOS ==> TOS-1\n _PUT, \/\/ TOS ==> TOS-1\n _PUTC, \/\/ TOS ==> TOS-1, dann ReadOnly\n _DIM, \/\/ DIM\n _REDIM, \/\/ REDIM\n _REDIMP, \/\/ REDIM PRESERVE\n _ERASE, \/\/ TOS loeschen\n \/\/ Verzweigen\n _STOP, \/\/ Programmende\n _INITFOR, \/\/ FOR-Variable initialisieren\n _NEXT, \/\/ FOR-Variable inkrementieren\n _CASE, \/\/ Anfang CASE\n _ENDCASE, \/\/ Ende CASE\n _STDERROR, \/\/ Standard-Fehlerbehandlung\n _NOERROR, \/\/ keine Fehlerbehandlung\n _LEAVE, \/\/ UP verlassen\n \/\/ E\/A\n _CHANNEL, \/\/ TOS = Kanalnummer\n _BPRINT, \/\/ print TOS\n _PRINTF, \/\/ print TOS in field\n _BWRITE, \/\/ write TOS\n _RENAME, \/\/ Rename Tos+1 to Tos\n _PROMPT, \/\/ TOS = Prompt for Input\n _RESTART, \/\/ Restartpunkt definieren\n _CHAN0, \/\/ I\/O-Kanal 0\n \/\/ Sonstiges\n _EMPTY, \/\/ Leeren Ausdruck auf Stack\n _ERROR, \/\/ TOS = Fehlercode\n _LSET, \/\/ Speichern Objekt TOS ==> TOS-1\n _RSET, \/\/ Speichern Objekt TOS ==> TOS-1\n _REDIMP_ERASE, \/\/ Copies array to be later used by REDIM PRESERVE before erasing it\n _INITFOREACH,\n SbOP0_END,\n\n \/\/ Alle Opcodes mit einem Operanden\n\n _NUMBER = 0x40, \/\/ Laden einer numerischen Konstanten (+ID)\n\n SbOP1_START = _NUMBER,\n\n _SCONST, \/\/ Laden einer Stringkonstanten (+ID)\n _CONST, \/\/ Immediate Load (+Wert)\n _ARGN, \/\/ Speichern eines named Args in Argv (+StringID)\n _PAD, \/\/ String auf feste Laenge bringen (+Laenge)\n \/\/ Verzweigungen\n _JUMP, \/\/ Sprung (+Target)\n _JUMPT, \/\/ TOS auswerten, bedingter Sprung (+Target)\n _JUMPF, \/\/ TOS auswerten, bedingter Sprung (+Target)\n _ONJUMP, \/\/ TOS auswerten, Sprung in JUMP-Tabelle (+MaxVal)\n _GOSUB, \/\/ UP-Aufruf (+Target)\n _RETURN, \/\/ UP-Return (+0 oder Target)\n _TESTFOR, \/\/ FOR-Variable testen, inkrementieren (+Endlabel)\n _CASETO, \/\/ Tos+1 <= Case <= Tos, 2xremove (+Target)\n _ERRHDL, \/\/ Fehler-Handler (+Offset)\n _RESUME, \/\/ Resume nach Fehlern (+0 or 1 or Label)\n \/\/ E\/A\n _CLOSE, \/\/ (+Kanal\/0)\n _PRCHAR, \/\/ (+char)\n \/\/ Verwaltung\n _SETCLASS, \/\/ Set + Klassennamen testen (+StringId)\n _TESTCLASS, \/\/ Check TOS class (+StringId)\n _LIB, \/\/ Libnamen fuer Declare-Procs setzen (+StringId)\n _BASED, \/\/ TOS wird um BASE erhoeht, BASE davor gepusht (+base)\n \/\/ Typanpassung im Argv\n _ARGTYP, \/\/ Letzten Parameter in Argv konvertieren (+Typ)\n\n SbOP1_END,\n\n \/\/ Alle Opcodes mit zwei Operanden\n\n _RTL = 0x80, \/\/ Laden aus RTL (+StringID+Typ)\n\n SbOP2_START = _RTL,\n\n _FIND, \/\/ Laden (+StringID+Typ)\n _ELEM, \/\/ Laden Element (+StringID+Typ)\n _PARAM, \/\/ Parameter (+Offset+Typ)\n \/\/ Verzweigen\n _CALL, \/\/ DECLARE-Methode rufen (+StringID+Typ)\n _CALLC, \/\/ Cdecl-DECLARE-Methode rufen (+StringID+Typ)\n _CASEIS, \/\/ Case-Test (+Test-Opcode+True-Target)\n \/\/ Verwaltung\n _STMNT, \/\/ Beginn eines Statements (+Line+Col)\n \/\/ E\/A\n _OPEN, \/\/ (+SvStreamFlags+Flags)\n \/\/ Objekte\n _LOCAL, \/\/ Lokale Variable definieren (+StringID+Typ)\n _PUBLIC, \/\/ Modulglobale Variable (+StringID+Typ)\n _GLOBAL, \/\/ Globale Variable definieren, public-Anweisung (+StringID+Typ)\n _CREATE, \/\/ Objekt kreieren (+StringId+StringID)\n _STATIC, \/\/ Statische Variabl (+StringID+Typ) JSM\n _TCREATE, \/\/ User Defined Objekt kreieren\n _DCREATE, \/\/ Objekt-Array kreieren (+StringId+StringID)\n _GLOBAL_P, \/\/ Globale Variable definieren, die beim Neustart von Basic\n \/\/ nicht ueberschrieben wird, P=PERSIST (+StringID+Typ)\n _FIND_G, \/\/ Sucht globale Variable mit Spezialbehandlung wegen _GLOBAL_P\n _DCREATE_REDIMP, \/\/ Objekt-Array redimensionieren (+StringId+StringID)\n _FIND_CM, \/\/ Search inside a class module (CM) to enable global search in time\n SbOP2_END\n\n};\n\n\n\n#endif\n<commit_msg>INTEGRATION: CWS npower4 (1.10.78); FILE MERGED 2006\/10\/18 20:29:17 npower 1.10.78.1: #i64884# changes for default properties<commit_after>\/*************************************************************************\n *\n * OpenOffice.org - a multi-platform office productivity suite\n *\n * $RCSfile: opcodes.hxx,v $\n *\n * $Revision: 1.11 $\n *\n * last change: $Author: vg $ $Date: 2006-11-02 16:32:24 $\n *\n * The Contents of this file are made available subject to\n * the terms of GNU Lesser General Public License Version 2.1.\n *\n *\n * GNU Lesser General Public License Version 2.1\n * =============================================\n * Copyright 2005 by Sun Microsystems, Inc.\n * 901 San Antonio Road, Palo Alto, CA 94303, USA\n *\n * This library is free software; you can redistribute it and\/or\n * modify it under the terms of the GNU Lesser General Public\n * License version 2.1, as published by the Free Software Foundation.\n *\n * This library is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU\n * Lesser General Public License for more details.\n *\n * You should have received a copy of the GNU Lesser General Public\n * License along with this library; if not, write to the Free Software\n * Foundation, Inc., 59 Temple Place, Suite 330, Boston,\n * MA 02111-1307 USA\n *\n ************************************************************************\/\n\n#ifndef _OPCODES_HXX\n#define _OPCODES_HXX\n\n#include \"sbintern.hxx\"\n\n#ifdef MTW\n#undef _NUMBER\n#endif\n\n\/\/ Ein Opcode ist entweder 1, 3 oder 5 Bytes lang, je nach numerischen\n\/\/ Wert des Opcodes (s.u.).\n\nenum SbiOpcode {\n \/\/ Alle Opcodes ohne Operanden\n _NOP = 0,\n\n SbOP0_START = _NOP,\n\n \/\/ Operatoren\n \/\/ die folgenden Operatoren sind genauso angeordnet\n \/\/ wie der enum SbxVarOp\n _EXP, _MUL, _DIV, _MOD, _PLUS, _MINUS, _NEG,\n _EQ, _NE, _LT, _GT, _LE, _GE,\n _IDIV, _AND, _OR, _XOR, _EQV, _IMP, _NOT,\n _CAT,\n \/\/ Ende enum SbxVarOp\n _LIKE, _IS,\n \/\/ Laden\/speichern\n _ARGC, \/\/ neuen Argv einrichten\n _ARGV, \/\/ TOS ==> aktueller Argv\n _INPUT, \/\/ Input ==> TOS\n _LINPUT, \/\/ Line Input ==> TOS\n _GET, \/\/ TOS anfassen\n _SET, \/\/ Speichern Objekt TOS ==> TOS-1\n _PUT, \/\/ TOS ==> TOS-1\n _PUTC, \/\/ TOS ==> TOS-1, dann ReadOnly\n _DIM, \/\/ DIM\n _REDIM, \/\/ REDIM\n _REDIMP, \/\/ REDIM PRESERVE\n _ERASE, \/\/ TOS loeschen\n \/\/ Verzweigen\n _STOP, \/\/ Programmende\n _INITFOR, \/\/ FOR-Variable initialisieren\n _NEXT, \/\/ FOR-Variable inkrementieren\n _CASE, \/\/ Anfang CASE\n _ENDCASE, \/\/ Ende CASE\n _STDERROR, \/\/ Standard-Fehlerbehandlung\n _NOERROR, \/\/ keine Fehlerbehandlung\n _LEAVE, \/\/ UP verlassen\n \/\/ E\/A\n _CHANNEL, \/\/ TOS = Kanalnummer\n _BPRINT, \/\/ print TOS\n _PRINTF, \/\/ print TOS in field\n _BWRITE, \/\/ write TOS\n _RENAME, \/\/ Rename Tos+1 to Tos\n _PROMPT, \/\/ TOS = Prompt for Input\n _RESTART, \/\/ Restartpunkt definieren\n _CHAN0, \/\/ I\/O-Kanal 0\n \/\/ Sonstiges\n _EMPTY, \/\/ Leeren Ausdruck auf Stack\n _ERROR, \/\/ TOS = Fehlercode\n _LSET, \/\/ Speichern Objekt TOS ==> TOS-1\n _RSET, \/\/ Speichern Objekt TOS ==> TOS-1\n _REDIMP_ERASE, \/\/ Copies array to be later used by REDIM PRESERVE before erasing it\n _INITFOREACH,\n _VBASET, \/\/ VBA-like Set\n SbOP0_END,\n\n \/\/ Alle Opcodes mit einem Operanden\n\n _NUMBER = 0x40, \/\/ Laden einer numerischen Konstanten (+ID)\n\n SbOP1_START = _NUMBER,\n\n _SCONST, \/\/ Laden einer Stringkonstanten (+ID)\n _CONST, \/\/ Immediate Load (+Wert)\n _ARGN, \/\/ Speichern eines named Args in Argv (+StringID)\n _PAD, \/\/ String auf feste Laenge bringen (+Laenge)\n \/\/ Verzweigungen\n _JUMP, \/\/ Sprung (+Target)\n _JUMPT, \/\/ TOS auswerten, bedingter Sprung (+Target)\n _JUMPF, \/\/ TOS auswerten, bedingter Sprung (+Target)\n _ONJUMP, \/\/ TOS auswerten, Sprung in JUMP-Tabelle (+MaxVal)\n _GOSUB, \/\/ UP-Aufruf (+Target)\n _RETURN, \/\/ UP-Return (+0 oder Target)\n _TESTFOR, \/\/ FOR-Variable testen, inkrementieren (+Endlabel)\n _CASETO, \/\/ Tos+1 <= Case <= Tos, 2xremove (+Target)\n _ERRHDL, \/\/ Fehler-Handler (+Offset)\n _RESUME, \/\/ Resume nach Fehlern (+0 or 1 or Label)\n \/\/ E\/A\n _CLOSE, \/\/ (+Kanal\/0)\n _PRCHAR, \/\/ (+char)\n \/\/ Verwaltung\n _SETCLASS, \/\/ Set + Klassennamen testen (+StringId)\n _TESTCLASS, \/\/ Check TOS class (+StringId)\n _LIB, \/\/ Libnamen fuer Declare-Procs setzen (+StringId)\n _BASED, \/\/ TOS wird um BASE erhoeht, BASE davor gepusht (+base)\n \/\/ Typanpassung im Argv\n _ARGTYP, \/\/ Letzten Parameter in Argv konvertieren (+Typ)\n SbOP1_END,\n\n \/\/ Alle Opcodes mit zwei Operanden\n\n _RTL = 0x80, \/\/ Laden aus RTL (+StringID+Typ)\n\n SbOP2_START = _RTL,\n\n _FIND, \/\/ Laden (+StringID+Typ)\n _ELEM, \/\/ Laden Element (+StringID+Typ)\n _PARAM, \/\/ Parameter (+Offset+Typ)\n \/\/ Verzweigen\n _CALL, \/\/ DECLARE-Methode rufen (+StringID+Typ)\n _CALLC, \/\/ Cdecl-DECLARE-Methode rufen (+StringID+Typ)\n _CASEIS, \/\/ Case-Test (+Test-Opcode+True-Target)\n \/\/ Verwaltung\n _STMNT, \/\/ Beginn eines Statements (+Line+Col)\n \/\/ E\/A\n _OPEN, \/\/ (+SvStreamFlags+Flags)\n \/\/ Objekte\n _LOCAL, \/\/ Lokale Variable definieren (+StringID+Typ)\n _PUBLIC, \/\/ Modulglobale Variable (+StringID+Typ)\n _GLOBAL, \/\/ Globale Variable definieren, public-Anweisung (+StringID+Typ)\n _CREATE, \/\/ Objekt kreieren (+StringId+StringID)\n _STATIC, \/\/ Statische Variabl (+StringID+Typ) JSM\n _TCREATE, \/\/ User Defined Objekt kreieren\n _DCREATE, \/\/ Objekt-Array kreieren (+StringId+StringID)\n _GLOBAL_P, \/\/ Globale Variable definieren, die beim Neustart von Basic\n \/\/ nicht ueberschrieben wird, P=PERSIST (+StringID+Typ)\n _FIND_G, \/\/ Sucht globale Variable mit Spezialbehandlung wegen _GLOBAL_P\n _DCREATE_REDIMP, \/\/ Objekt-Array redimensionieren (+StringId+StringID)\n _FIND_CM, \/\/ Search inside a class module (CM) to enable global search in time\n SbOP2_END\n\n};\n\n\n\n#endif\n<|endoftext|>"} {"text":"<commit_before>\/\/ Copyright (c) 2016, Baidu.com, Inc. All Rights Reserved\n\/\/ Use of this source code is governed by a BSD-style license that can be\n\/\/ found in the LICENSE file.\n\n#include \"volum_group.h\"\n#include \"volum.h\"\n#include \"mounter.h\"\n\n#include \"protocol\/galaxy.pb.h\"\n#include \"agent\/volum\/volum.h\"\n#include \"boost\/algorithm\/string\/split.hpp\"\n#include \"boost\/algorithm\/string\/classification.hpp\"\n#include \"boost\/filesystem\/path.hpp\"\n#include \"boost\/filesystem\/operations.hpp\"\n#include \"util\/error_code.h\"\n#include \"util\/path_tree.h\"\n#include \"boost\/lexical_cast\/lexical_cast_old.hpp\"\n\n#include <glog\/logging.h>\n#include <gflags\/gflags.h>\n#include <iostream>\n\nDECLARE_string(mount_templat);\n\nnamespace baidu {\nnamespace galaxy {\nnamespace volum {\nVolumGroup::VolumGroup() :\n gc_index_(-1)\n{\n}\n\nVolumGroup::~VolumGroup()\n{\n}\n\nvoid VolumGroup::SetGcIndex(int gc_index)\n{\n assert(gc_index >= 0);\n gc_index_ = gc_index;\n}\n\nvoid VolumGroup::AddDataVolum(const baidu::galaxy::proto::VolumRequired& data_volum)\n{\n boost::shared_ptr<baidu::galaxy::proto::VolumRequired> volum(new baidu::galaxy::proto::VolumRequired());\n volum->CopyFrom(data_volum);\n dv_description_.push_back(volum);\n}\n\nvoid VolumGroup::SetWorkspaceVolum(const baidu::galaxy::proto::VolumRequired& ws_volum)\n{\n ws_description_.reset(new baidu::galaxy::proto::VolumRequired);\n ws_description_->CopyFrom(ws_volum);\n}\n\nvoid VolumGroup::SetContainerId(const std::string& container_id)\n{\n container_id_ = container_id;\n}\n\nbaidu::galaxy::util::ErrorCode VolumGroup::Construct()\n{\n workspace_volum_ = Construct(this->ws_description_);\n\n if (NULL == workspace_volum_.get()) {\n return ERRORCODE(-1, \"workspace volum is empty\");\n }\n\n baidu::galaxy::util::ErrorCode ec;\n for (size_t i = 0; i < dv_description_.size(); i++) {\n boost::shared_ptr<Volum> v = Construct(dv_description_[i]);\n\n if (v.get() == NULL) {\n ec = ERRORCODE(-1,\n \"construct volum(%s->%s) failed\",\n dv_description_[i]->source_path().c_str(),\n dv_description_[i]->dest_path().c_str());\n\n break;\n }\n\n data_volum_.push_back(v);\n }\n\n if (data_volum_.size() != dv_description_.size()) {\n for (size_t i = 0; i < data_volum_.size(); i++) {\n data_volum_[i]->Destroy();\n }\n\n return ec;\n }\n\n return ERRORCODE_OK;\n}\n\nbaidu::galaxy::util::ErrorCode VolumGroup::Destroy()\n{\n int ret = 0;\n\n for (size_t i = 0; i < data_volum_.size(); i++) {\n if (0 != data_volum_[i]->Destroy()) {\n return ERRORCODE(-1,\n \"failed in destroying data volum(%s->%s)\",\n data_volum_[i]->SourcePath().c_str(),\n data_volum_[i]->TargetPath().c_str());\n }\n }\n\n if (0 != workspace_volum_->Destroy()) {\n return ERRORCODE(-1,\n \"failed in destroying workspace volum\");\n }\n\n return ERRORCODE_OK;\n}\n\nint VolumGroup::ExportEnv(std::map<std::string, std::string>& env)\n{\n env[\"baidu_galaxy_container_workspace_path\"] = workspace_volum_->Description()->dest_path();\n env[\"baidu_galaxy_container_workspace_abstargetpath\"] = workspace_volum_->TargetPath();\n env[\"baidu_galaxy_container_workspace_abssourcepath\"] = workspace_volum_->SourcePath();\n env[\"baidu_galaxy_container_workspace_datavolum_size\"] = boost::lexical_cast<std::string>(data_volum_.size());\n return 0;\n}\n\nboost::shared_ptr<google::protobuf::Message> VolumGroup::Report()\n{\n boost::shared_ptr<google::protobuf::Message> ret;\n return ret;\n}\n\nboost::shared_ptr<Volum> VolumGroup::Construct(boost::shared_ptr<baidu::galaxy::proto::VolumRequired> dp)\n{\n assert(NULL != dp.get());\n assert(gc_index_ >= 0);\n boost::shared_ptr<Volum> volum = Volum::CreateVolum(dp);\n\n if (NULL == volum.get()) {\n return volum;\n }\n\n volum->SetDescription(dp);\n volum->SetContainerId(this->container_id_);\n volum->SetGcIndex(gc_index_);\n\n if (0 != volum->Construct()) {\n volum.reset();\n }\n\n return volum;\n}\n\n\/\/ FIX: a single class\nint VolumGroup::MountRootfs()\n{\n std::vector<std::string> vm;\n boost::split(vm, FLAGS_mount_templat, boost::is_any_of(\",\"));\n\n std::string container_path = baidu::galaxy::path::ContainerRootPath(container_id_);\n\n for (size_t i = 0; i < vm.size(); i++) {\n if (vm[i].empty()) {\n continue;\n }\n\n boost::system::error_code ec;\n boost::filesystem::path path(container_path);\n path.append(vm[i]);\n\n if (!boost::filesystem::exists(path, ec) && !boost::filesystem::create_directories(path, ec)) {\n LOG(WARNING) << \"create_directories failed: \" << path.string() << \": \" << ec.message();\n return -1;\n }\n\n if (boost::filesystem::is_directory(path, ec)) {\n LOG(INFO) << \"create_directories sucessfully: \" << path.string();\n }\n\n if (\"\/proc\" == vm[i]) {\n baidu::galaxy::util::ErrorCode errc = MountProc(path.string());\n\n if (0 != errc.Code()) {\n LOG(WARNING) << \"mount \" << vm[i] << \"for container \" << container_id_ << \" failed \" << errc.Message();\n return -1;\n }\n\n LOG(INFO) << \"mount successfully: \" << vm[i] << \" -> \" << path.string();\n } else {\n baidu::galaxy::util::ErrorCode errc = MountDir(vm[i], path.string());\n\n if (0 != errc.Code()) {\n LOG(WARNING) << \"mount \" << vm[i] << \"for container \" << container_id_ << \" failed \" << errc.Message();\n return -1;\n }\n\n LOG(INFO) << \"mount successfully: \" << vm[i] << \" -> \" << path.string();\n }\n }\n\n return 0;\n}\n\n}\n}\n}\n<commit_msg>rm unused var<commit_after>\/\/ Copyright (c) 2016, Baidu.com, Inc. All Rights Reserved\n\/\/ Use of this source code is governed by a BSD-style license that can be\n\/\/ found in the LICENSE file.\n\n#include \"volum_group.h\"\n#include \"volum.h\"\n#include \"mounter.h\"\n\n#include \"protocol\/galaxy.pb.h\"\n#include \"agent\/volum\/volum.h\"\n#include \"boost\/algorithm\/string\/split.hpp\"\n#include \"boost\/algorithm\/string\/classification.hpp\"\n#include \"boost\/filesystem\/path.hpp\"\n#include \"boost\/filesystem\/operations.hpp\"\n#include \"util\/error_code.h\"\n#include \"util\/path_tree.h\"\n#include \"boost\/lexical_cast\/lexical_cast_old.hpp\"\n\n#include <glog\/logging.h>\n#include <gflags\/gflags.h>\n#include <iostream>\n\nDECLARE_string(mount_templat);\n\nnamespace baidu {\nnamespace galaxy {\nnamespace volum {\nVolumGroup::VolumGroup() :\n gc_index_(-1)\n{\n}\n\nVolumGroup::~VolumGroup()\n{\n}\n\nvoid VolumGroup::SetGcIndex(int gc_index)\n{\n assert(gc_index >= 0);\n gc_index_ = gc_index;\n}\n\nvoid VolumGroup::AddDataVolum(const baidu::galaxy::proto::VolumRequired& data_volum)\n{\n boost::shared_ptr<baidu::galaxy::proto::VolumRequired> volum(new baidu::galaxy::proto::VolumRequired());\n volum->CopyFrom(data_volum);\n dv_description_.push_back(volum);\n}\n\nvoid VolumGroup::SetWorkspaceVolum(const baidu::galaxy::proto::VolumRequired& ws_volum)\n{\n ws_description_.reset(new baidu::galaxy::proto::VolumRequired);\n ws_description_->CopyFrom(ws_volum);\n}\n\nvoid VolumGroup::SetContainerId(const std::string& container_id)\n{\n container_id_ = container_id;\n}\n\nbaidu::galaxy::util::ErrorCode VolumGroup::Construct()\n{\n workspace_volum_ = Construct(this->ws_description_);\n\n if (NULL == workspace_volum_.get()) {\n return ERRORCODE(-1, \"workspace volum is empty\");\n }\n\n baidu::galaxy::util::ErrorCode ec;\n for (size_t i = 0; i < dv_description_.size(); i++) {\n boost::shared_ptr<Volum> v = Construct(dv_description_[i]);\n\n if (v.get() == NULL) {\n ec = ERRORCODE(-1,\n \"construct volum(%s->%s) failed\",\n dv_description_[i]->source_path().c_str(),\n dv_description_[i]->dest_path().c_str());\n\n break;\n }\n\n data_volum_.push_back(v);\n }\n\n if (data_volum_.size() != dv_description_.size()) {\n for (size_t i = 0; i < data_volum_.size(); i++) {\n data_volum_[i]->Destroy();\n }\n\n return ec;\n }\n\n return ERRORCODE_OK;\n}\n\nbaidu::galaxy::util::ErrorCode VolumGroup::Destroy()\n{\n for (size_t i = 0; i < data_volum_.size(); i++) {\n if (0 != data_volum_[i]->Destroy()) {\n return ERRORCODE(-1,\n \"failed in destroying data volum(%s->%s)\",\n data_volum_[i]->SourcePath().c_str(),\n data_volum_[i]->TargetPath().c_str());\n }\n }\n\n if (0 != workspace_volum_->Destroy()) {\n return ERRORCODE(-1,\n \"failed in destroying workspace volum\");\n }\n\n return ERRORCODE_OK;\n}\n\nint VolumGroup::ExportEnv(std::map<std::string, std::string>& env)\n{\n env[\"baidu_galaxy_container_workspace_path\"] = workspace_volum_->Description()->dest_path();\n env[\"baidu_galaxy_container_workspace_abstargetpath\"] = workspace_volum_->TargetPath();\n env[\"baidu_galaxy_container_workspace_abssourcepath\"] = workspace_volum_->SourcePath();\n env[\"baidu_galaxy_container_workspace_datavolum_size\"] = boost::lexical_cast<std::string>(data_volum_.size());\n return 0;\n}\n\nboost::shared_ptr<google::protobuf::Message> VolumGroup::Report()\n{\n boost::shared_ptr<google::protobuf::Message> ret;\n return ret;\n}\n\nboost::shared_ptr<Volum> VolumGroup::Construct(boost::shared_ptr<baidu::galaxy::proto::VolumRequired> dp)\n{\n assert(NULL != dp.get());\n assert(gc_index_ >= 0);\n boost::shared_ptr<Volum> volum = Volum::CreateVolum(dp);\n\n if (NULL == volum.get()) {\n return volum;\n }\n\n volum->SetDescription(dp);\n volum->SetContainerId(this->container_id_);\n volum->SetGcIndex(gc_index_);\n\n if (0 != volum->Construct()) {\n volum.reset();\n }\n\n return volum;\n}\n\n\/\/ FIX: a single class\nint VolumGroup::MountRootfs()\n{\n std::vector<std::string> vm;\n boost::split(vm, FLAGS_mount_templat, boost::is_any_of(\",\"));\n\n std::string container_path = baidu::galaxy::path::ContainerRootPath(container_id_);\n\n for (size_t i = 0; i < vm.size(); i++) {\n if (vm[i].empty()) {\n continue;\n }\n\n boost::system::error_code ec;\n boost::filesystem::path path(container_path);\n path.append(vm[i]);\n\n if (!boost::filesystem::exists(path, ec) && !boost::filesystem::create_directories(path, ec)) {\n LOG(WARNING) << \"create_directories failed: \" << path.string() << \": \" << ec.message();\n return -1;\n }\n\n if (boost::filesystem::is_directory(path, ec)) {\n LOG(INFO) << \"create_directories sucessfully: \" << path.string();\n }\n\n if (\"\/proc\" == vm[i]) {\n baidu::galaxy::util::ErrorCode errc = MountProc(path.string());\n\n if (0 != errc.Code()) {\n LOG(WARNING) << \"mount \" << vm[i] << \"for container \" << container_id_ << \" failed \" << errc.Message();\n return -1;\n }\n\n LOG(INFO) << \"mount successfully: \" << vm[i] << \" -> \" << path.string();\n } else {\n baidu::galaxy::util::ErrorCode errc = MountDir(vm[i], path.string());\n\n if (0 != errc.Code()) {\n LOG(WARNING) << \"mount \" << vm[i] << \"for container \" << container_id_ << \" failed \" << errc.Message();\n return -1;\n }\n\n LOG(INFO) << \"mount successfully: \" << vm[i] << \" -> \" << path.string();\n }\n }\n\n return 0;\n}\n\n}\n}\n}\n<|endoftext|>"} {"text":"<commit_before>\/\/----------------------------------------------------------------------------\n\/\/ Copyright( c ) 2016, Robert Kimball\n\/\/ All rights 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\n\/\/ notice, this list of conditions and the following disclaimer in the\n\/\/ documentation and\/or other materials provided with the distribution.\n\/\/\n\/\/ 3. Neither the name of the copyright holder nor the names of its\n\/\/ contributors may be used to endorse or promote products derived from\n\/\/ this software without specific prior written permission.\n\/\/\n\/\/ THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS \"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\/\/ DHCP Info https:\/\/en.wikipedia.org\/wiki\/Dynamic_Host_Configuration_Protocol\n\/\/ DHCP Options http:\/\/www.faqs.org\/rfcs\/rfc1533.html\n\n#include <stdio.h>\n#include <string.h>\n#include \"ProtocolDHCP.h\"\n#include \"ProtocolUDP.h\"\n#include \"ProtocolIP.h\"\n#include \"NetworkInterface.h\"\n#include \"Utility.h\"\n#include \"osTime.h\"\n\nextern AddressConfiguration Config;\nint32_t ProtocolDHCP::PendingXID = -1;\nstatic const uint32_t DHCP_MAGIC = 0x63825363;\n\nconst char* inet_ntoa( uint32_t addr )\n{\n static char rc[ 20 ];\n sprintf( rc, \"%d.%d.%d.%d\",\n (addr >> 24) & 0xFF,\n (addr >> 16) & 0xFF,\n (addr >> 8) & 0xFF,\n (addr >> 0) & 0xFF\n );\n return rc;\n}\n\nuint8_t Unpack8( const uint8_t* p, size_t size )\n{\n return *p;\n}\n\nuint16_t Unpack16( const uint8_t* p, size_t size )\n{\n uint16_t rc = 0;\n for( int i = 0; i < size; i++ )\n {\n rc <<= 8;\n rc |= *p;\n p++;\n }\n return rc;\n}\n\nuint32_t Unpack32( const uint8_t* p, size_t size )\n{\n uint32_t rc = 0;\n for( int i = 0; i < size; i++ )\n {\n rc <<= 8;\n rc |= *p;\n p++;\n }\n return rc;\n}\n\nvoid ProtocolDHCP::test()\n{\n printf( \"sending discover\\n\" );\n Discover();\n printf( \"discover sent\\n\" );\n}\n\nvoid ProtocolDHCP::ProcessRx( DataBuffer* buffer )\n{\n printf( \"ProtocolDHCP::ProcessRx\\n\" );\n\n\n uint8_t op = Unpack8( &buffer->Packet[ 0 ], 1 );\n uint8_t htype = Unpack8( &buffer->Packet[ 1 ], 1 );\n uint8_t hlen = Unpack8( &buffer->Packet[ 2 ], 1 );\n uint8_t hops = Unpack8( &buffer->Packet[ 3 ], 1 );\n uint32_t xid = Unpack32( &buffer->Packet[ 4 ], 4 );\n uint16_t secs = Unpack16( &buffer->Packet[ 8 ], 2 );\n uint16_t flags = Unpack16( &buffer->Packet[ 10 ], 2 );\n uint32_t ciaddr = Unpack32( &buffer->Packet[ 12 ], 4 ); \/\/ (Client IP address)\n uint32_t yiaddr = Unpack32( &buffer->Packet[ 16 ], 4 ); \/\/ (Your IP address)\n uint32_t siaddr = Unpack32( &buffer->Packet[ 20 ], 4 ); \/\/ (Server IP address)\n uint32_t giaddr = Unpack32( &buffer->Packet[ 24 ], 4 ); \/\/ (Gateway IP address)\n\n \/\/uint8_t chaddr[ 16 ]; \/\/ (Client hardware address)\n \/\/uint8_t sname[ 64 ];\n \/\/uint8_t file[ 128 ];\n\n uint32_t magic = Unpack32( &buffer->Packet[ 236 ], 4 );\n\n printf( \"op = %d\\n\", op );\n printf( \"htype = %d\\n\", htype );\n printf( \"hlen = %d\\n\", hlen );\n printf( \"hops = %d\\n\", hops );\n printf( \"xid = 0x%0X\\n\", xid );\n printf( \"secs = %d\\n\", secs );\n printf( \"flags = %d\\n\", flags );\n printf( \"ciaddr = %s\\n\", inet_ntoa( ciaddr ) ); \/\/ (Client IP address)\n printf( \"yiaddr = %s\\n\", inet_ntoa( yiaddr ) ); \/\/ (Your IP address)\n printf( \"siaddr = %s\\n\", inet_ntoa( siaddr ) ); \/\/ (Server IP address)\n printf( \"giaddr = %s\\n\", inet_ntoa( giaddr ) ); \/\/ (Gateway IP address)\n if( xid == PendingXID )\n {\n printf( \"*********** this is for me ************\\n\" );\n }\n printf( \"magic = 0x%0X\\n\", magic );\n}\n\n\/\/9.4.DHCP Message Type\n\/\/\n\/\/This option is used to convey the type of the DHCP message.The code\n\/\/for this option is 53, and its length is 1. Legal values for this\n\/\/option are :\n\/\/\n\/\/Value Message Type\n\/\/---- - ------------\n\/\/1 DHCPDISCOVER\n\/\/2 DHCPOFFER\n\/\/3 DHCPREQUEST\n\/\/4 DHCPDECLINE\n\/\/5 DHCPACK\n\/\/6 DHCPNAK\n\/\/7 DHCPRELEASE\n\/\/\n\/\/Code Len Type\n\/\/+ ---- - +---- - +---- - +\n\/\/| 53 | 1 | 1 - 7 |\n\/\/+---- - +---- - +---- - +\n\nvoid ProtocolDHCP::Discover()\n{\n DataBuffer* buffer = ProtocolUDP::GetTxBuffer();\n if( buffer )\n {\n DHCPDISCOVER* packet = (DHCPDISCOVER*)(buffer->Packet);\n for( int i = 0; i < sizeof( DHCPDISCOVER ); i++ ) buffer->Packet[ i ] = 0;\n PendingXID = (uint32_t)osTime::GetProcessorTime();\n\n packet->op = 0x01;\n packet->htype = 0x01;\n packet->hlen = 0x06;\n packet->hops = 0x00;\n packet->xid = hton32( PendingXID );\n packet->secs = hton16( 0x0000 );\n packet->flags = hton16( 0x8000 );\n packet->ciaddr = hton32( 0x00000000 ); \/\/ (Client IP address)\n packet->yiaddr = hton32( 0x00000000 ); \/\/ (Your IP address)\n packet->siaddr = hton32( 0x00000000 ); \/\/ (Server IP address)\n packet->giaddr = hton32( 0x00000000 ); \/\/ (Gateway IP address)\n\n for( int i = 0; i < 6; i++ )\n {\n packet->chaddr[ i ] = Config.Address.Hardware[ i ];\n }\n packet->magic = hton32( DHCP_MAGIC );\n\n buffer->Length = sizeof( DHCPDISCOVER );\n\n \/\/ Add options\n buffer->Packet[ buffer->Length++ ] = 53;\n buffer->Packet[ buffer->Length++ ] = 1;\n buffer->Packet[ buffer->Length++ ] = 1; \/\/ DHCP Discover\n\n \/\/ client id\n buffer->Packet[ buffer->Length++ ] = 61;\n buffer->Packet[ buffer->Length++ ] = 7; \/\/ length\n buffer->Packet[ buffer->Length++ ] = 1; \/\/ type is hardware address\n for( int i = 0; i < 6; i++ ) buffer->Packet[ buffer->Length++ ] = Config.Address.Hardware[ i ];\n\n \/\/ requested address\n buffer->Packet[ buffer->Length++ ] = 0x32;\n buffer->Packet[ buffer->Length++ ] = 0x04;\n buffer->Packet[ buffer->Length++ ] = 0xC0;\n buffer->Packet[ buffer->Length++ ] = 0xA8;\n buffer->Packet[ buffer->Length++ ] = 0x01;\n buffer->Packet[ buffer->Length++ ] = 0x03;\n\n \/\/ host name\n const char* name = \"tinytcp\";\n buffer->Packet[ buffer->Length++ ] = 12;\n buffer->Packet[ buffer->Length++ ] = strlen( name );\n for( int i = 0; i < strlen( name ); i++ ) buffer->Packet[ buffer->Length++ ] = name[ i ];\n\n \/\/ vendor class ident\n buffer->Packet[ buffer->Length++ ] = 0x3C;\n buffer->Packet[ buffer->Length++ ] = 0x08;\n buffer->Packet[ buffer->Length++ ] = 0x4D;\n buffer->Packet[ buffer->Length++ ] = 0x53;\n buffer->Packet[ buffer->Length++ ] = 0x46;\n buffer->Packet[ buffer->Length++ ] = 0x54;\n buffer->Packet[ buffer->Length++ ] = 0x20;\n buffer->Packet[ buffer->Length++ ] = 0x35;\n buffer->Packet[ buffer->Length++ ] = 0x2E;\n buffer->Packet[ buffer->Length++ ] = 0x30;\n\n \/\/ parameter request list\n buffer->Packet[ buffer->Length++ ] = 55;\n buffer->Packet[ buffer->Length++ ] = 13; \/\/ length\n buffer->Packet[ buffer->Length++ ] = 1; \/\/ subnet mask\n buffer->Packet[ buffer->Length++ ] = 3; \/\/ router\n buffer->Packet[ buffer->Length++ ] = 6; \/\/ dns\n buffer->Packet[ buffer->Length++ ] = 15; \/\/ domain name\n buffer->Packet[ buffer->Length++ ] = 31; \/\/ domain name\n buffer->Packet[ buffer->Length++ ] = 33; \/\/ domain name\n buffer->Packet[ buffer->Length++ ] = 43; \/\/ domain name\n buffer->Packet[ buffer->Length++ ] = 44; \/\/ domain name\n buffer->Packet[ buffer->Length++ ] = 46; \/\/ domain name\n buffer->Packet[ buffer->Length++ ] = 47; \/\/ domain name\n buffer->Packet[ buffer->Length++ ] = 121; \/\/ domain name\n buffer->Packet[ buffer->Length++ ] = 249; \/\/ domain name\n buffer->Packet[ buffer->Length++ ] = 252; \/\/ domain name\n\n buffer->Packet[ buffer->Length++ ] = 255; \/\/ End options\n\n int pad = 8;\n for( int i = 0; i < pad; i++ ) buffer->Packet[ buffer->Length++ ] = 0;\n\n uint8_t sourceIP[] = { 0, 0, 0, 0 };\n uint8_t targetIP[] = { 255, 255, 255, 255 };\n ProtocolUDP::Transmit( buffer, targetIP, 67, sourceIP, 68 );\n }\n}\n<commit_msg>remove unused DHCP fields<commit_after>\/\/----------------------------------------------------------------------------\n\/\/ Copyright( c ) 2016, Robert Kimball\n\/\/ All rights 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\n\/\/ notice, this list of conditions and the following disclaimer in the\n\/\/ documentation and\/or other materials provided with the distribution.\n\/\/\n\/\/ 3. Neither the name of the copyright holder nor the names of its\n\/\/ contributors may be used to endorse or promote products derived from\n\/\/ this software without specific prior written permission.\n\/\/\n\/\/ THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS \"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\/\/ DHCP Info https:\/\/en.wikipedia.org\/wiki\/Dynamic_Host_Configuration_Protocol\n\/\/ DHCP Options http:\/\/www.faqs.org\/rfcs\/rfc1533.html\n\n#include <stdio.h>\n#include <string.h>\n#include \"ProtocolDHCP.h\"\n#include \"ProtocolUDP.h\"\n#include \"ProtocolIP.h\"\n#include \"NetworkInterface.h\"\n#include \"Utility.h\"\n#include \"osTime.h\"\n\nextern AddressConfiguration Config;\nint32_t ProtocolDHCP::PendingXID = -1;\nstatic const uint32_t DHCP_MAGIC = 0x63825363;\n\nconst char* inet_ntoa( uint32_t addr )\n{\n static char rc[ 20 ];\n sprintf( rc, \"%d.%d.%d.%d\",\n (addr >> 24) & 0xFF,\n (addr >> 16) & 0xFF,\n (addr >> 8) & 0xFF,\n (addr >> 0) & 0xFF\n );\n return rc;\n}\n\nuint8_t Unpack8( const uint8_t* p, size_t size )\n{\n return *p;\n}\n\nuint16_t Unpack16( const uint8_t* p, size_t size )\n{\n uint16_t rc = 0;\n for( int i = 0; i < size; i++ )\n {\n rc <<= 8;\n rc |= *p;\n p++;\n }\n return rc;\n}\n\nuint32_t Unpack32( const uint8_t* p, size_t size )\n{\n uint32_t rc = 0;\n for( int i = 0; i < size; i++ )\n {\n rc <<= 8;\n rc |= *p;\n p++;\n }\n return rc;\n}\n\nvoid ProtocolDHCP::test()\n{\n printf( \"sending discover\\n\" );\n Discover();\n printf( \"discover sent\\n\" );\n}\n\nvoid ProtocolDHCP::ProcessRx( DataBuffer* buffer )\n{\n printf( \"ProtocolDHCP::ProcessRx\\n\" );\n\n\n uint8_t op = Unpack8( &buffer->Packet[ 0 ], 1 );\n uint8_t htype = Unpack8( &buffer->Packet[ 1 ], 1 );\n uint8_t hlen = Unpack8( &buffer->Packet[ 2 ], 1 );\n uint8_t hops = Unpack8( &buffer->Packet[ 3 ], 1 );\n uint32_t xid = Unpack32( &buffer->Packet[ 4 ], 4 );\n uint16_t secs = Unpack16( &buffer->Packet[ 8 ], 2 );\n uint16_t flags = Unpack16( &buffer->Packet[ 10 ], 2 );\n uint32_t ciaddr = Unpack32( &buffer->Packet[ 12 ], 4 ); \/\/ (Client IP address)\n uint32_t yiaddr = Unpack32( &buffer->Packet[ 16 ], 4 ); \/\/ (Your IP address)\n uint32_t siaddr = Unpack32( &buffer->Packet[ 20 ], 4 ); \/\/ (Server IP address)\n uint32_t giaddr = Unpack32( &buffer->Packet[ 24 ], 4 ); \/\/ (Gateway IP address)\n\n \/\/uint8_t chaddr[ 16 ]; \/\/ (Client hardware address)\n \/\/uint8_t sname[ 64 ];\n \/\/uint8_t file[ 128 ];\n\n uint32_t magic = Unpack32( &buffer->Packet[ 236 ], 4 );\n\n printf( \"op = %d\\n\", op );\n printf( \"htype = %d\\n\", htype );\n printf( \"hlen = %d\\n\", hlen );\n printf( \"hops = %d\\n\", hops );\n printf( \"xid = 0x%0X\\n\", xid );\n printf( \"secs = %d\\n\", secs );\n printf( \"flags = %d\\n\", flags );\n printf( \"ciaddr = %s\\n\", inet_ntoa( ciaddr ) ); \/\/ (Client IP address)\n printf( \"yiaddr = %s\\n\", inet_ntoa( yiaddr ) ); \/\/ (Your IP address)\n printf( \"siaddr = %s\\n\", inet_ntoa( siaddr ) ); \/\/ (Server IP address)\n printf( \"giaddr = %s\\n\", inet_ntoa( giaddr ) ); \/\/ (Gateway IP address)\n if( xid == PendingXID )\n {\n printf( \"*********** this is for me ************\\n\" );\n }\n printf( \"magic = 0x%0X\\n\", magic );\n}\n\n\/\/9.4.DHCP Message Type\n\/\/\n\/\/This option is used to convey the type of the DHCP message.The code\n\/\/for this option is 53, and its length is 1. Legal values for this\n\/\/option are :\n\/\/\n\/\/Value Message Type\n\/\/---- - ------------\n\/\/1 DHCPDISCOVER\n\/\/2 DHCPOFFER\n\/\/3 DHCPREQUEST\n\/\/4 DHCPDECLINE\n\/\/5 DHCPACK\n\/\/6 DHCPNAK\n\/\/7 DHCPRELEASE\n\/\/\n\/\/Code Len Type\n\/\/+ ---- - +---- - +---- - +\n\/\/| 53 | 1 | 1 - 7 |\n\/\/+---- - +---- - +---- - +\n\nvoid ProtocolDHCP::Discover()\n{\n DataBuffer* buffer = ProtocolUDP::GetTxBuffer();\n if( buffer )\n {\n DHCPDISCOVER* packet = (DHCPDISCOVER*)(buffer->Packet);\n for( int i = 0; i < sizeof( DHCPDISCOVER ); i++ ) buffer->Packet[ i ] = 0;\n PendingXID = (uint32_t)osTime::GetProcessorTime();\n\n packet->op = 0x01;\n packet->htype = 0x01;\n packet->hlen = 0x06;\n packet->hops = 0x00;\n packet->xid = hton32( PendingXID );\n packet->secs = hton16( 0x0000 );\n packet->flags = hton16( 0x8000 );\n packet->ciaddr = hton32( 0x00000000 ); \/\/ (Client IP address)\n packet->yiaddr = hton32( 0x00000000 ); \/\/ (Your IP address)\n packet->siaddr = hton32( 0x00000000 ); \/\/ (Server IP address)\n packet->giaddr = hton32( 0x00000000 ); \/\/ (Gateway IP address)\n\n for( int i = 0; i < 6; i++ )\n {\n packet->chaddr[ i ] = Config.Address.Hardware[ i ];\n }\n packet->magic = hton32( DHCP_MAGIC );\n\n buffer->Length = sizeof( DHCPDISCOVER );\n\n \/\/ Add options\n buffer->Packet[ buffer->Length++ ] = 53;\n buffer->Packet[ buffer->Length++ ] = 1;\n buffer->Packet[ buffer->Length++ ] = 1; \/\/ DHCP Discover\n\n \/\/ client id\n buffer->Packet[ buffer->Length++ ] = 61;\n buffer->Packet[ buffer->Length++ ] = 7; \/\/ length\n buffer->Packet[ buffer->Length++ ] = 1; \/\/ type is hardware address\n for( int i = 0; i < 6; i++ ) buffer->Packet[ buffer->Length++ ] = Config.Address.Hardware[ i ];\n\n \/\/ host name\n const char* name = \"tinytcp\";\n buffer->Packet[ buffer->Length++ ] = 12;\n buffer->Packet[ buffer->Length++ ] = strlen( name );\n for( int i = 0; i < strlen( name ); i++ ) buffer->Packet[ buffer->Length++ ] = name[ i ];\n\n \/\/ parameter request list\n buffer->Packet[ buffer->Length++ ] = 55;\n buffer->Packet[ buffer->Length++ ] = 13; \/\/ length\n buffer->Packet[ buffer->Length++ ] = 1; \/\/ subnet mask\n buffer->Packet[ buffer->Length++ ] = 3; \/\/ router\n buffer->Packet[ buffer->Length++ ] = 6; \/\/ dns\n buffer->Packet[ buffer->Length++ ] = 15; \/\/ domain name\n\n buffer->Packet[ buffer->Length++ ] = 255; \/\/ End options\n\n int pad = 8;\n for( int i = 0; i < pad; i++ ) buffer->Packet[ buffer->Length++ ] = 0;\n\n uint8_t sourceIP[] = { 0, 0, 0, 0 };\n uint8_t targetIP[] = { 255, 255, 255, 255 };\n ProtocolUDP::Transmit( buffer, targetIP, 67, sourceIP, 68 );\n }\n}\n<|endoftext|>"} {"text":"<commit_before>#ifndef MPACK_GROUPCONTROLLERS_HPP\n#define MPACK_GROUPCONTROLLERS_HPP\n\n#include \"GroupController.hpp\"\n#include \"PlayGroupController.hpp\"\n#include \"VolumeGroupController.hpp\"\n\n#endif\n<commit_msg>Updated GroupControllers.hpp<commit_after>#ifndef MPACK_GROUPCONTROLLERS_HPP\n#define MPACK_GROUPCONTROLLERS_HPP\n\n#include \"GroupController.hpp\"\n#include \"PlayGroupController.hpp\"\n#include \"VolumeGroupController.hpp\"\n#include \"StereoGroupController.hpp\"\n\n#endif\n<|endoftext|>"} {"text":"<commit_before>\/**\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\/consensus\/witness.hpp>\n#include <metaverse\/node\/p2p_node.hpp>\n#include <metaverse\/blockchain\/settings.hpp>\n#include <mutex>\n\n\n#define LOG_HEADER \"witness\"\n\nnamespace libbitcoin {\nnamespace consensus {\n\nwitness* witness::instance_ = nullptr;\n\nwitness::witness(p2p_node& node)\n : node_(node)\n , setting_(node_.chain_impl().chain_settings())\n , epoch_height_(0)\n , witness_list_()\n , candidate_list_()\n , mutex_()\n{\n}\n\nwitness::~witness()\n{\n}\n\nvoid witness::init(p2p_node& node)\n{\n static witness s_instance(node);\n instance_ = &s_instance;\n}\n\nwitness& witness::create(p2p_node& node)\n{\n static std::once_flag s_flag;\n std::call_once(s_flag, witness::init, node);\n return *instance_;\n}\n\nwitness& witness::get()\n{\n BITCOIN_ASSERT_MSG(instance_, \"use witness::create() before witness::get()\");\n return *instance_;\n}\n\nwitness::iterator witness::finds(list& l, const witness_id& id)\n{\n auto cmp = [&id](const witness_id& item){return id == item;};\n return std::find_if(std::begin(l), std::end(l), cmp);\n}\n\nwitness::const_iterator witness::finds(const list& l, const witness_id& id)\n{\n auto cmp = [&id](const witness_id& item){return id == item;};\n return std::find_if(std::begin(l), std::end(l), cmp);\n}\n\nbool witness::exists(const list& l, const witness_id& id)\n{\n return finds(l, id) != l.end();\n}\n\nwitness::list witness::get_witness_list() const\n{\n shared_lock lock(mutex_);\n return witness_list_;\n}\n\nwitness::list witness::get_candidate_list() const\n{\n shared_lock lock(mutex_);\n return candidate_list_;\n}\n\nbool witness::is_witness(const witness_id& id) const\n{\n shared_lock lock(mutex_);\n return (!id.empty()) && exists(witness_list_, id);\n}\n\nbool witness::register_witness(const witness_id& id)\n{\n upgrade_lock lock(mutex_);\n\n if (exists(witness_list_, id) || exists(candidate_list_, id)) {\n log::debug(LOG_HEADER) << \"In register_witness, \" << id << \" is already registered.\";\n return false;\n }\n\n upgrade_to_unique_lock ulock(lock);\n candidate_list_.push_back(id);\n return true;\n}\n\nbool witness::unregister_witness(const witness_id& id)\n{\n upgrade_lock lock(mutex_);\n\n auto witness_pos = finds(witness_list_, id);\n auto candidate_pos = finds(candidate_list_, id);\n\n if (witness_pos == witness_list_.end() && candidate_pos == candidate_list_.end()) {\n log::debug(LOG_HEADER) << \"In unregister_witness, \" << id << \" is not registered.\";\n return false;\n }\n\n upgrade_to_unique_lock ulock(lock);\n if (witness_pos != witness_list_.end()) {\n \/\/ clear data instead of remove, as a stub\n *witness_pos = witness_id();\n }\n if (candidate_pos != candidate_list_.end()) {\n candidate_list_.erase(candidate_pos);\n }\n return true;\n}\n\n\/\/ DPOS_TODO: add algorithm to generate the witness list of each epoch\nbool witness::update_witness_list(uint64_t height)\n{\n return true;\n}\n\nvoid witness::set_epoch_height(uint64_t block_height)\n{\n unique_lock lock(mutex_);\n epoch_height_ = block_height;\n}\n\nuint32_t witness::get_slot_num(const witness_id& id) const\n{\n shared_lock lock(mutex_);\n auto pos = finds(witness_list_, id);\n if (pos != witness_list_.end()) {\n return pos - witness_list_.cbegin();\n }\n return max_uint32;\n}\n\nbool witness::sign(endorsement& out, const ec_secret& secret, const chain::header& h)\n{\n const auto sighash = h.hash();\n\n ec_signature signature;\n if (!bc::sign(signature, secret, sighash) || !bc::encode_signature(out, signature)) {\n return false;\n }\n\n out.push_back(h.number & 0xff);\n return true;\n}\n\nbool witness::verify_sign(const endorsement& out, const public_key_t& public_key, const chain::header& h)\n{\n if (public_key.empty()) {\n return false;\n }\n\n if (out.back() != (h.number & 0xff)) {\n return false;\n }\n\n auto distinguished = out;\n distinguished.pop_back();\n\n ec_signature signature;\n\n if (!parse_signature(signature, distinguished, true)) {\n return false;\n }\n\n const auto sighash = h.hash();\n\n return bc::verify_signature(public_key, sighash, signature);\n}\n\nbool witness::verify_signer(const public_key_t& public_key, const chain::block& block, const chain::header& prev_header) const\n{\n shared_lock lock(mutex_);\n auto witness_slot_num = get_slot_num(public_key);\n return verify_signer(witness_slot_num, block, prev_header);\n}\n\nbool witness::verify_signer(uint32_t witness_slot_num, const chain::block& block, const chain::header& prev_header) const\n{\n if (witness_slot_num >= witess_number) {\n return false;\n }\n\n const auto& header = block.header;\n auto block_height = header.number;\n auto calced_slot_num = ((block_height - epoch_height_) % witess_number);\n if (calced_slot_num == witness_slot_num) {\n return true;\n }\n static uint32_t time_config{24}; \/\/ same as HeaderAux::calculateDifficulty\n if (header.timestamp > prev_header.timestamp + time_config*2) {\n return true;\n }\n return false;\n}\n\n} \/\/ consensus\n} \/\/ libbitcoin\n<commit_msg>fix std::call_once can not pass building<commit_after>\/**\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\/consensus\/witness.hpp>\n#include <metaverse\/node\/p2p_node.hpp>\n#include <metaverse\/blockchain\/settings.hpp>\n\n\n#define LOG_HEADER \"witness\"\n\nnamespace libbitcoin {\nnamespace consensus {\n\nwitness* witness::instance_ = nullptr;\n\nwitness::witness(p2p_node& node)\n : node_(node)\n , setting_(node_.chain_impl().chain_settings())\n , epoch_height_(0)\n , witness_list_()\n , candidate_list_()\n , mutex_()\n{\n}\n\nwitness::~witness()\n{\n}\n\nvoid witness::init(p2p_node& node)\n{\n static witness s_instance(node);\n instance_ = &s_instance;\n}\n\nwitness& witness::create(p2p_node& node)\n{\n static unique_mutex umutex;\n if (!instance_) {\n scoped_lock l(umutex);\n init(node);\n }\n return *instance_;\n}\n\nwitness& witness::get()\n{\n BITCOIN_ASSERT_MSG(instance_, \"use witness::create() before witness::get()\");\n return *instance_;\n}\n\nwitness::iterator witness::finds(list& l, const witness_id& id)\n{\n auto cmp = [&id](const witness_id& item){return id == item;};\n return std::find_if(std::begin(l), std::end(l), cmp);\n}\n\nwitness::const_iterator witness::finds(const list& l, const witness_id& id)\n{\n auto cmp = [&id](const witness_id& item){return id == item;};\n return std::find_if(std::begin(l), std::end(l), cmp);\n}\n\nbool witness::exists(const list& l, const witness_id& id)\n{\n return finds(l, id) != l.end();\n}\n\nwitness::list witness::get_witness_list() const\n{\n shared_lock lock(mutex_);\n return witness_list_;\n}\n\nwitness::list witness::get_candidate_list() const\n{\n shared_lock lock(mutex_);\n return candidate_list_;\n}\n\nbool witness::is_witness(const witness_id& id) const\n{\n shared_lock lock(mutex_);\n return (!id.empty()) && exists(witness_list_, id);\n}\n\nbool witness::register_witness(const witness_id& id)\n{\n upgrade_lock lock(mutex_);\n\n if (exists(witness_list_, id) || exists(candidate_list_, id)) {\n log::debug(LOG_HEADER) << \"In register_witness, \" << id << \" is already registered.\";\n return false;\n }\n\n upgrade_to_unique_lock ulock(lock);\n candidate_list_.push_back(id);\n return true;\n}\n\nbool witness::unregister_witness(const witness_id& id)\n{\n upgrade_lock lock(mutex_);\n\n auto witness_pos = finds(witness_list_, id);\n auto candidate_pos = finds(candidate_list_, id);\n\n if (witness_pos == witness_list_.end() && candidate_pos == candidate_list_.end()) {\n log::debug(LOG_HEADER) << \"In unregister_witness, \" << id << \" is not registered.\";\n return false;\n }\n\n upgrade_to_unique_lock ulock(lock);\n if (witness_pos != witness_list_.end()) {\n \/\/ clear data instead of remove, as a stub\n *witness_pos = witness_id();\n }\n if (candidate_pos != candidate_list_.end()) {\n candidate_list_.erase(candidate_pos);\n }\n return true;\n}\n\n\/\/ DPOS_TODO: add algorithm to generate the witness list of each epoch\nbool witness::update_witness_list(uint64_t height)\n{\n return true;\n}\n\nvoid witness::set_epoch_height(uint64_t block_height)\n{\n unique_lock lock(mutex_);\n epoch_height_ = block_height;\n}\n\nuint32_t witness::get_slot_num(const witness_id& id) const\n{\n shared_lock lock(mutex_);\n auto pos = finds(witness_list_, id);\n if (pos != witness_list_.end()) {\n return pos - witness_list_.cbegin();\n }\n return max_uint32;\n}\n\nbool witness::sign(endorsement& out, const ec_secret& secret, const chain::header& h)\n{\n const auto sighash = h.hash();\n\n ec_signature signature;\n if (!bc::sign(signature, secret, sighash) || !bc::encode_signature(out, signature)) {\n return false;\n }\n\n out.push_back(h.number & 0xff);\n return true;\n}\n\nbool witness::verify_sign(const endorsement& out, const public_key_t& public_key, const chain::header& h)\n{\n if (public_key.empty()) {\n return false;\n }\n\n if (out.back() != (h.number & 0xff)) {\n return false;\n }\n\n auto distinguished = out;\n distinguished.pop_back();\n\n ec_signature signature;\n\n if (!parse_signature(signature, distinguished, true)) {\n return false;\n }\n\n const auto sighash = h.hash();\n\n return bc::verify_signature(public_key, sighash, signature);\n}\n\nbool witness::verify_signer(const public_key_t& public_key, const chain::block& block, const chain::header& prev_header) const\n{\n shared_lock lock(mutex_);\n auto witness_slot_num = get_slot_num(public_key);\n return verify_signer(witness_slot_num, block, prev_header);\n}\n\nbool witness::verify_signer(uint32_t witness_slot_num, const chain::block& block, const chain::header& prev_header) const\n{\n if (witness_slot_num >= witess_number) {\n return false;\n }\n\n const auto& header = block.header;\n auto block_height = header.number;\n auto calced_slot_num = ((block_height - epoch_height_) % witess_number);\n if (calced_slot_num == witness_slot_num) {\n return true;\n }\n static uint32_t time_config{24}; \/\/ same as HeaderAux::calculateDifficulty\n if (header.timestamp > prev_header.timestamp + time_config*2) {\n return true;\n }\n return false;\n}\n\n} \/\/ consensus\n} \/\/ libbitcoin\n<|endoftext|>"} {"text":"<commit_before>\/******************************************************************************\n * Copyright 2017 The Apollo Authors. All Rights Reserved.\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n *****************************************************************************\/\n\n\/**\n * @file\n **\/\n#include \"modules\/planning\/math\/smoothing_spline\/piecewise_linear_kernel.h\"\n\n#include \"gtest\/gtest.h\"\n\nnamespace apollo {\nnamespace planning {\n\nusing Eigen::MatrixXd;\n\nTEST(TestPiecewiseLinearKernel, add_regularization) {\n PiecewiseLinearKernel kernel(10, 0.1);\n\n kernel.AddRegularization(0.2);\n\n const auto mat = kernel.kernel_matrix();\n const auto offset = kernel.offset_matrix();\n\n std::cout << mat << std::endl;\n std::cout << offset << std::endl;\n\n MatrixXd mat_golden(10, 10);\n \/\/ clang-format off\n mat_golden <<\n 0.2, 0, 0, 0, 0, 0, 0, 0, 0, 0,\n 0, 0.2, 0, 0, 0, 0, 0, 0, 0, 0,\n 0, 0, 0.2, 0, 0, 0, 0, 0, 0, 0,\n 0, 0, 0, 0.2, 0, 0, 0, 0, 0, 0,\n 0, 0, 0, 0, 0.2, 0, 0, 0, 0, 0,\n 0, 0, 0, 0, 0, 0.2, 0, 0, 0, 0,\n 0, 0, 0, 0, 0, 0, 0.2, 0, 0, 0,\n 0, 0, 0, 0, 0, 0, 0, 0.2, 0, 0,\n 0, 0, 0, 0, 0, 0, 0, 0, 0.2, 0,\n 0, 0, 0, 0, 0, 0, 0, 0, 0, 0.2;\n \/\/ clang-format on\n EXPECT_EQ(mat, mat_golden);\n\n MatrixXd offset_golden(10, 1);\n offset_golden << 0, 0, 0, 0, 0, 0, 0, 0, 0, 0;\n EXPECT_EQ(offset, offset_golden);\n\n kernel.AddRegularization(0.3);\n mat_golden = MatrixXd::Identity(10, 10) * 0.5;\n EXPECT_EQ(kernel.kernel_matrix(), mat_golden);\n}\n\nTEST(TestPiecewiseLinearKernel, add_reference_line_kernel_matrix) {\n PiecewiseLinearKernel kernel(10, 0.1);\n\n std::vector<uint32_t> index_list;\n std::vector<double> pos_list;\n for (int i = 0; i < 10; ++i) {\n index_list.push_back(i);\n pos_list.push_back(i * 2);\n }\n\n kernel.AddReferenceLineKernelMatrix(index_list, pos_list, 10.0);\n\n const auto mat = kernel.kernel_matrix();\n const auto offset = kernel.offset_matrix();\n\n std::cout << mat << std::endl;\n std::cout << offset << std::endl;\n\n MatrixXd mat_golden = MatrixXd::Identity(10, 10) * 10.0;\n EXPECT_EQ(mat, mat_golden);\n\n MatrixXd offset_golden(10, 1);\n offset_golden << 0, -40, -80, -120, -160, -200, -240, -280, -320, -360;\n\n EXPECT_EQ(offset, offset_golden);\n}\n\n} \/\/ namespace planning\n} \/\/ namespace apollo\n<commit_msg>Planning: added TestPiecewiseLinearKernel - add_second_derivative_kernel_matrix. (#484)<commit_after>\/******************************************************************************\n * Copyright 2017 The Apollo Authors. All Rights Reserved.\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n *****************************************************************************\/\n\n\/**\n * @file\n **\/\n#include \"modules\/planning\/math\/smoothing_spline\/piecewise_linear_kernel.h\"\n\n#include \"gtest\/gtest.h\"\n\nnamespace apollo {\nnamespace planning {\n\nusing Eigen::MatrixXd;\n\nTEST(TestPiecewiseLinearKernel, add_regularization) {\n PiecewiseLinearKernel kernel(10, 0.1);\n\n kernel.AddRegularization(0.2);\n\n const auto mat = kernel.kernel_matrix();\n const auto offset = kernel.offset_matrix();\n\n std::cout << mat << std::endl;\n std::cout << offset << std::endl;\n\n MatrixXd mat_golden(10, 10);\n \/\/ clang-format off\n mat_golden <<\n 0.2, 0, 0, 0, 0, 0, 0, 0, 0, 0,\n 0, 0.2, 0, 0, 0, 0, 0, 0, 0, 0,\n 0, 0, 0.2, 0, 0, 0, 0, 0, 0, 0,\n 0, 0, 0, 0.2, 0, 0, 0, 0, 0, 0,\n 0, 0, 0, 0, 0.2, 0, 0, 0, 0, 0,\n 0, 0, 0, 0, 0, 0.2, 0, 0, 0, 0,\n 0, 0, 0, 0, 0, 0, 0.2, 0, 0, 0,\n 0, 0, 0, 0, 0, 0, 0, 0.2, 0, 0,\n 0, 0, 0, 0, 0, 0, 0, 0, 0.2, 0,\n 0, 0, 0, 0, 0, 0, 0, 0, 0, 0.2;\n \/\/ clang-format on\n EXPECT_EQ(mat, mat_golden);\n\n MatrixXd offset_golden(10, 1);\n offset_golden << 0, 0, 0, 0, 0, 0, 0, 0, 0, 0;\n EXPECT_EQ(offset, offset_golden);\n\n kernel.AddRegularization(0.3);\n mat_golden = MatrixXd::Identity(10, 10) * 0.5;\n EXPECT_EQ(kernel.kernel_matrix(), mat_golden);\n}\n\nTEST(TestPiecewiseLinearKernel, add_reference_line_kernel_matrix) {\n PiecewiseLinearKernel kernel(10, 0.1);\n\n std::vector<uint32_t> index_list;\n std::vector<double> pos_list;\n for (int i = 0; i < 10; ++i) {\n index_list.push_back(i);\n pos_list.push_back(i * 2);\n }\n\n kernel.AddReferenceLineKernelMatrix(index_list, pos_list, 10.0);\n\n const auto mat = kernel.kernel_matrix();\n const auto offset = kernel.offset_matrix();\n\n std::cout << mat << std::endl;\n std::cout << offset << std::endl;\n\n MatrixXd mat_golden = MatrixXd::Identity(10, 10) * 10.0;\n EXPECT_EQ(mat, mat_golden);\n\n MatrixXd offset_golden(10, 1);\n offset_golden << 0, -40, -80, -120, -160, -200, -240, -280, -320, -360;\n\n EXPECT_EQ(offset, offset_golden);\n}\n\nTEST(TestPiecewiseLinearKernel, add_second_order_derivative_matrix) {\n PiecewiseLinearKernel kernel(10, 0.1);\n const double init_derivative = 5.0;\n\n kernel.AddSecondOrderDerivativeMatrix(init_derivative, 1.0);\n\n const auto mat = kernel.kernel_matrix() \/ (2.0 * 1.0 \/ std::pow(0.1, 4));\n const auto offset = kernel.offset_matrix();\n\n std::cout << mat << std::endl;\n std::cout << offset << std::endl;\n\n MatrixXd mat_golden(10, 10);\n \/\/ clang-format off\n mat_golden <<\n 6, -4, 1, 0, 0, 0, 0, 0, 0, 0,\n -4, 6, -4, 1, 0, 0, 0, 0, 0, 0,\n 1, -4, 6, -4, 1, 0, 0, 0, 0, 0,\n 0, 1, -4, 6, -4, 1, 0, 0, 0, 0,\n 0, 0, 1, -4, 6, -4, 1, 0, 0, 0,\n 0, 0, 0, 1, -4, 6, -4, 1, 0, 0,\n 0, 0, 0, 0, 1, -4, 6, -4, 1, 0,\n 0, 0, 0, 0, 0, 1, -4, 6, -4, 1,\n 0, 0, 0, 0, 0, 0, 1, -4, 5, -2,\n 0, 0, 0, 0, 0, 0, 0, 1, -2, 1;\n \/\/ clang-format on\n EXPECT_EQ(mat, mat_golden);\n\n MatrixXd offset_golden = MatrixXd::Zero(10, 1);\n offset_golden(0, 0) = -10000.0;\n\n for (int i = 0; i < 10; ++i) {\n EXPECT_DOUBLE_EQ(offset(i, 0), offset_golden(i, 0));\n }\n}\n\n} \/\/ namespace planning\n} \/\/ namespace apollo\n<|endoftext|>"} {"text":"<commit_before>#include <cstdio>\n#include <cstring>\n#include <cassert>\nconst int shift = 32;\nconst unsigned long long BASE = (unsigned long long)1 << shift;\nconst int LEN = 10000000;\n\nvoid add(unsigned dest[], unsigned src[]) {\n\tfor (int i = LEN - 1; i >= 0; i--)\n\t\tif (dest[i] >= BASE - src[i]) {\n\t\t\tassert(i && \"Oh carry overflow!\");\n\t\t\tdest[i] = (long long)dest[i] + src[i] - BASE;\n\t\t\tdest[i - 1]++;\n\t\t} else {\n\t\t\tdest[i] += src[i];\n\t\t}\n}\n\nvoid minus(unsigned dest[], unsigned src[]) {\n\tbool borrow = false;\n\tfor (int i = LEN - 1; i >= 0; i--)\n\t\tif (dest[i] < src[i] + (borrow? 1: 0)) {\n\t\t\tassert(i && \"Oh borrow overflow!\");\n\t\t\tdest[i] = (unsigned long long)dest[i] + BASE - src[i] - (borrow? 1: 0);\n\t\t\tborrow = true;\n\t\t} else {\n\t\t\tdest[i] = dest[i] - src[i] - (borrow? 1: 0);\n\t\t\tborrow = false;\n\t\t}\n}\n\nvoid multiply(unsigned dest[], unsigned num) {\n\tunsigned carry = 0;\n\tfor (int i = LEN - 1; i >= 0; i--) {\n\t\tunsigned long long tmp = (unsigned long long)num * dest[i] + carry;\n\t\tassert((tmp & (BASE - 1)) < BASE && \"multiply truncation\");\n\t\tdest[i] = (tmp & (BASE - 1));\n\t\tcarry = tmp >> shift;\n\t\tassert((i || !carry) && \"Oh multiply overflow!\");\n\t}\n}\n\nvoid divide(unsigned dest[], unsigned num) {\n\tunsigned long long s = 0;\n\tfor (int i = 0; i < LEN; i++) {\n\t\ts <<= shift;\n\t\ts += dest[i];\n\t\tif (s >= num) {\n\t\t\tassert(s \/ num < BASE && \"divide truncation\");\n\t\t\tdest[i] = s \/ num;\n\t\t\ts %= num;\n\t\t} else {\n\t\t\tdest[i] = 0;\n\t\t}\n\t}\n}\n\nvoid test_multiply_divide() {\n\tunsigned *ptr = new unsigned[LEN];\n\tfor (int i = 0; i < LEN; i++)\n\t\tptr[i] = i;\n\tunsigned num = 123454321;\n\tmultiply(ptr, num);\n\tdivide(ptr, num);\n\tfor (size_t i = 0; i < LEN; i++)\n\t\tassert(ptr[i] == i && \"multiply or divide error.\");\n\tdelete[] ptr;\n}\n\nvoid test_add_minus() {\n\tunsigned *ptr = new unsigned[LEN], *ptr2 = new unsigned[LEN];\n\tfor (size_t i = 0; i < LEN; i++) {\n\t\tptr[i] = LEN - i;\n\t\tptr2[i] = ptr[i] + 1;\n\t}\n\tptr[0] = 1, ptr2[0] = 0;\n\n\tminus(ptr, ptr2);\n\tassert(ptr[0] == 0 && \"ptr[0] minus error.\");\n\tassert(ptr[LEN - 1] == BASE - 1 && \"ptr[LEN - 1] minus error.\");\n\tfor (int i = 1; i < LEN - 1; i++)\n\t\tassert(ptr[i] == BASE - 2 && \"substraction error.\");\n\n\tadd(ptr, ptr2);\n\tassert(ptr[0] == 1 && \"ptr[0] add error.\");\n\tfor (size_t i = 1; i < LEN; i++)\n\t\tassert(ptr[i] == LEN - i && \"addition error.\");\n\tdelete[] ptr;\n\tdelete[] ptr2;\n}\n\n\ninline void print(unsigned num) {\n\tfor (int pos = 28; pos >= 0; pos -= 4)\n\t\tprintf(\"%01X\", (num >> pos) & 0xF);\n}\n\nvoid test_print() {\n\tunsigned tmp = 180150013;\n\tprint(tmp);\n}\n\ninline void output(unsigned array[]) {\n\tprintf(\"3.\\n\");\n\tfor (int i = 1; i < LEN; i++)\n\t\tprint(array[i]);\n\tprintf(\"\\n\");\n}\n\nvoid shift_right(unsigned sub[], int num) {\n\tfor (int i = LEN - 1; i >= 0; i++) {\n\t}\n}\n\nvoid cal_sub_Pi(unsigned Pi[], unsigned k) {\n\tunsigned *sub = new unsigned[LEN];\n\tmemset(sub, 0, sizeof(unsigned) * LEN);\n\n\tsub[0] = 4;\n\tdelete[] sub;\n}\n\nint main(int argc, char *argv[]) {\n\ttest_add_minus();\n\ttest_multiply_divide();\n\ttest_print();\n\treturn 0;\n}\n<commit_msg>formula sum{ (-1)^(k-1) * 1\/(2k-1) } (k = 1, 2, ... )<commit_after>#include <cstdio>\n#include <cstring>\n#include <cassert>\nconst int SHIFT = 32;\nconst unsigned long long BASE = (unsigned long long)1 << SHIFT;\nconst int LEN\t=\t1000;\nconst int LOOP\t=\t5000000;\n\nvoid add(unsigned dest[], unsigned src[]) {\n\tfor (int i = LEN - 1; i >= 0; i--)\n\t\tif (dest[i] >= BASE - src[i]) {\n\t\t\tassert(i && \"Oh carry overflow!\");\n\t\t\tdest[i] = (long long)dest[i] + src[i] - BASE;\n\t\t\tdest[i - 1]++;\n\t\t} else {\n\t\t\tdest[i] += src[i];\n\t\t}\n}\n\nvoid minus(unsigned dest[], unsigned src[]) {\n\tbool borrow = false;\n\tfor (int i = LEN - 1; i >= 0; i--)\n\t\tif (dest[i] < src[i] + (borrow? 1: 0)) {\n\t\t\tassert(i && \"Oh borrow overflow!\");\n\t\t\tdest[i] = (unsigned long long)dest[i] + BASE - src[i] - (borrow? 1: 0);\n\t\t\tborrow = true;\n\t\t} else {\n\t\t\tdest[i] = dest[i] - src[i] - (borrow? 1: 0);\n\t\t\tborrow = false;\n\t\t}\n}\n\nvoid multiply(unsigned dest[], unsigned num) {\n\tunsigned carry = 0;\n\tfor (int i = LEN - 1; i >= 0; i--) {\n\t\tunsigned long long tmp = (unsigned long long)num * dest[i] + carry;\n\t\tassert((tmp & (BASE - 1)) < BASE && \"multiply truncation\");\n\t\tdest[i] = (tmp & (BASE - 1));\n\t\tcarry = tmp >> SHIFT;\n\t\tassert((i || !carry) && \"Oh multiply overflow!\");\n\t}\n}\n\nvoid divide(unsigned dest[], unsigned num) {\n\tunsigned long long s = 0;\n\tfor (int i = 0; i < LEN; i++) {\n\t\ts <<= SHIFT;\n\t\ts += dest[i];\n\t\tif (s >= num) {\n\t\t\tassert(s \/ num < BASE && \"divide truncation\");\n\t\t\tdest[i] = s \/ num;\n\t\t\ts %= num;\n\t\t} else {\n\t\t\tdest[i] = 0;\n\t\t}\n\t}\n}\n\nvoid test_multiply_divide() {\n\tunsigned *ptr = new unsigned[LEN];\n\tfor (int i = 0; i < LEN; i++)\n\t\tptr[i] = i;\n\tunsigned num = 123454321;\n\tmultiply(ptr, num);\n\tdivide(ptr, num);\n\tfor (size_t i = 0; i < LEN; i++)\n\t\tassert(ptr[i] == i && \"multiply or divide error.\");\n\tdelete[] ptr;\n}\n\nvoid test_add_minus() {\n\tunsigned *ptr = new unsigned[LEN], *ptr2 = new unsigned[LEN];\n\tfor (size_t i = 0; i < LEN; i++) {\n\t\tptr[i] = LEN - i;\n\t\tptr2[i] = ptr[i] + 1;\n\t}\n\tptr[0] = 1, ptr2[0] = 0;\n\n\tminus(ptr, ptr2);\n\tassert(ptr[0] == 0 && \"ptr[0] minus error.\");\n\tassert(ptr[LEN - 1] == BASE - 1 && \"ptr[LEN - 1] minus error.\");\n\tfor (int i = 1; i < LEN - 1; i++)\n\t\tassert(ptr[i] == BASE - 2 && \"substraction error.\");\n\n\tadd(ptr, ptr2);\n\tassert(ptr[0] == 1 && \"ptr[0] add error.\");\n\tfor (size_t i = 1; i < LEN; i++)\n\t\tassert(ptr[i] == LEN - i && \"addition error.\");\n\tdelete[] ptr;\n\tdelete[] ptr2;\n}\n\n\ninline void print(unsigned num) {\n\tfor (int pos = SHIFT - 4; pos >= 0; pos -= 4)\n\t\tprintf(\"%01X\", (num >> pos) & 0xF);\n}\n\nvoid test_print() {\n\tunsigned tmp = 180150013;\n\tprint(tmp);\n}\n\ninline void output(unsigned array[]) {\n\tprintf(\"%d.\\n\", array[0]);\n\tunsigned digit = 0;\n\tfor (int i = 1; i < LEN; i++)\n\t\tfor (int pos = SHIFT - 4; pos >= 0; pos -= 4) {\n\t\t\tprintf(\"%01X\", (array[i] >> pos) & 0xF);\n\t\t\tif (++digit == 64) {\n\t\t\t\tprintf(\"\\n\");\n\t\t\t\tdigit = 0;\n\t\t\t}\n\t\t}\n\tprintf(\"\\n\");\n}\n\n\/*\nvoid shift_right(unsigned sub[], int num) {\n\tmemmove((void *)sub + num, sub, sizeof(unsigned) * LEN - num);\n\tmemset(sub, 0, num);\n}\n\nvoid test_shift_right() {\n\tunsigned *sub = new unsigned[LEN];\n\tsub[0] = 0xF0;\n\tshift_right(sub, sizeof(unsigned) * (LEN - 1));\n\tassert(\n\tdelete[] sub;\n}\n*\/\n\nvoid cal_Pi(unsigned Pi[]) {\n\tunsigned *sub = new unsigned[LEN];\n\n\tfor (unsigned i = 1; i < LOOP; i++) {\n\t\tmemset(sub, 0, sizeof(unsigned) * LEN);\n\t\tsub[0] = 4;\n\t\tdivide(sub, 2 * i - 1);\n\t\tif (i % 2)\n\t\t\tadd(Pi, sub);\n\t\telse\n\t\t\tminus(Pi, sub);\n\t}\n\tdelete[] sub;\n}\n\nint main(int argc, char *argv[]) {\n\t\/*\n\ttest_add_minus();\n\ttest_multiply_divide();\n\ttest_print();\n\t*\/\n\tunsigned *Pi = new unsigned[LEN];\n\tcal_Pi(Pi);\n\toutput(Pi);\n\tdelete[] Pi;\n\treturn 0;\n}\n<|endoftext|>"} {"text":"<commit_before>\/* vim:set ts=4 sw=4 sts=4 et: *\/\n\n#include <set>\n#include <stdexcept>\n#include <igraph\/cpp\/edge.h>\n#include <igraph\/cpp\/generators\/line_graph.h>\n#include <netctrl\/model\/liu.h>\n#include <netctrl\/model\/switchboard.h>\n\nnamespace netctrl {\n\nusing namespace igraph;\n\nSwitchboardControllabilityModel::~SwitchboardControllabilityModel() {\n clearControlPaths();\n}\n\nvoid SwitchboardControllabilityModel::calculate() {\n \/\/ Construct the line graph first\n Graph lg(line_graph(*m_pGraph));\n\n \/\/ Find the driver nodes in the line graph; these are the driver edges\n \/\/ in our model\n LiuControllabilityModel model(&lg);\n model.calculate();\n \n \/\/ Loop through the stems and buds of the line graph. The root of each\n \/\/ stem represents an edge in the original graph and its tail will\n \/\/ become a driver node.\n std::vector<ControlPath*> controlPaths = model.controlPaths();\n std::set<long int> driverNodeSet;\n\n for (std::vector<ControlPath*>::const_iterator it = controlPaths.begin();\n it != controlPaths.end(); it++) {\n ControlPath* path = *it;\n Stem* stem = dynamic_cast<Stem*>(path);\n if (stem != 0) {\n \/\/ Store the source vertex of the root of the stem\n driverNodeSet.insert(m_pGraph->edge(stem->root()).tail());\n }\n }\n\n m_driverNodes = Vector(driverNodeSet.begin(), driverNodeSet.end());\n}\n\nvoid SwitchboardControllabilityModel::clearControlPaths() {\n for (std::vector<ControlPath*>::const_iterator it = m_controlPaths.begin();\n it != m_controlPaths.end(); it++) {\n delete *it;\n }\n}\n\nstd::vector<ControlPath*> SwitchboardControllabilityModel::controlPaths() const {\n return m_controlPaths;\n}\n\nigraph::Vector SwitchboardControllabilityModel::driverNodes() const {\n return m_driverNodes;\n}\n\n} \/\/ end of namespaces\n\n<commit_msg>fixed an edge case in the switchboard dynamics<commit_after>\/* vim:set ts=4 sw=4 sts=4 et: *\/\n\n#include <set>\n#include <stdexcept>\n#include <igraph\/cpp\/edge.h>\n#include <igraph\/cpp\/generators\/line_graph.h>\n#include <netctrl\/model\/liu.h>\n#include <netctrl\/model\/switchboard.h>\n\nnamespace netctrl {\n\nusing namespace igraph;\n\nSwitchboardControllabilityModel::~SwitchboardControllabilityModel() {\n clearControlPaths();\n}\n\nvoid SwitchboardControllabilityModel::calculate() {\n \/\/ Construct the line graph first\n Graph lg(line_graph(*m_pGraph));\n\n \/\/ Find the driver nodes in the line graph; these are the driver edges\n \/\/ in our model\n LiuControllabilityModel model(&lg);\n model.calculate();\n \n \/\/ Loop through the stems and buds of the line graph. The root of each\n \/\/ stem represents an edge in the original graph and its tail will\n \/\/ become a driver node.\n std::vector<ControlPath*> controlPaths = model.controlPaths();\n std::set<long int> driverNodeSet;\n\n for (std::vector<ControlPath*>::const_iterator it = controlPaths.begin();\n it != controlPaths.end(); it++) {\n ControlPath* path = *it;\n Stem* stem = dynamic_cast<Stem*>(path);\n if (stem != 0) {\n \/\/ Store the source vertex of the root of the stem\n driverNodeSet.insert(m_pGraph->edge(stem->root()).tail());\n }\n }\n \n \/\/ Now, check the buds. Each bud that is not attached to a stem in the line\n \/\/ graph is problematic. For such buds, we have to iterate over its edges,\n \/\/ map the endpoints of the edges back to the original graph, and see if\n \/\/ any of these is already a driver node. If so, we are okay. If not, we\n \/\/ have to make one of the nodes a driver node.\n for (std::vector<ControlPath*>::const_iterator it = controlPaths.begin();\n it != controlPaths.end(); it++) {\n ControlPath* path = *it;\n Bud* bud = dynamic_cast<Bud*>(path);\n if (bud != 0 && bud->stem() == 0) {\n Vector::const_iterator it, end = bud->nodes().end();\n bool foundDriverNode = false;\n\n for (it = bud->nodes().begin(); it != end && !foundDriverNode; it++) {\n if (driverNodeSet.find(*it) != driverNodeSet.end())\n foundDriverNode = true;\n }\n\n if (!foundDriverNode) {\n \/\/ TODO: better strategy; what if there is another node which\n \/\/ could control more than one bud? Is it possible?\n driverNodeSet.insert(bud->nodes().front());\n }\n }\n }\n\n m_driverNodes = Vector(driverNodeSet.begin(), driverNodeSet.end());\n}\n\nvoid SwitchboardControllabilityModel::clearControlPaths() {\n for (std::vector<ControlPath*>::const_iterator it = m_controlPaths.begin();\n it != m_controlPaths.end(); it++) {\n delete *it;\n }\n}\n\nstd::vector<ControlPath*> SwitchboardControllabilityModel::controlPaths() const {\n return m_controlPaths;\n}\n\nigraph::Vector SwitchboardControllabilityModel::driverNodes() const {\n return m_driverNodes;\n}\n\n} \/\/ end of namespaces\n\n<|endoftext|>"} {"text":"<commit_before>\/\/ ==========================================================================\n\/\/ ANISE\n\/\/ ==========================================================================\n\/\/ Copyright (c) 2006-2014, Knut Reinert, FU Berlin\n\/\/ All rights reserved.\n\/\/\n\/\/ Redistribution and use in source and binary forms, with or without\n\/\/ modification, are permitted provided that the following conditions are met:\n\/\/\n\/\/ * Redistributions of source code must retain the above copyright\n\/\/ notice, this list of conditions and the following disclaimer.\n\/\/ * Redistributions in binary form must reproduce the above copyright\n\/\/ notice, this list of conditions and the following disclaimer in the\n\/\/ documentation and\/or other materials provided with the distribution.\n\/\/ * Neither the name of Knut Reinert or the FU Berlin nor the names of\n\/\/ its contributors may be used to endorse or promote products derived\n\/\/ from this software without specific prior written permission.\n\/\/\n\/\/ THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS \"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 KNUT REINERT OR THE FU BERLIN BE LIABLE\n\/\/ FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL\n\/\/ DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR\n\/\/ SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER\n\/\/ CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT\n\/\/ LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY\n\/\/ OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH\n\/\/ DAMAGE.\n\/\/\n\/\/ ==========================================================================\n\/\/ Author: Manuel Holtgrewe <manuel.holtgrewe@fu-berlin.de>\n\/\/ ==========================================================================\n\n#include \"file_name_tokens.h\"\n\nchar const * GLOBAL_STATE_TOKEN = \"global_state\";\nchar const * GLOBAL_STATE_EXT = \".txt\";\n\n\/\/ Token and extension for site state files.\nchar const * SITE_STATE_TOKEN = \"site_state\";\nchar const * SITE_STATE_EXT = \".txt\";\n\n\/\/ Token and extension for orphans FASTQ file.\nchar const * ORPHANS_TOKEN = \"orphans\";\nchar const * ORPHANS_EXT = \".fq\";\n\n\/\/ Token and extension for orphans active map.\nchar const * ORPHANS_ACTIVE_TOKEN = \"orphans_active\";\nchar const * ORPHANS_ACTIVE_EXT = \".bin\";\n\n\/\/ Token and extension for reads SAM files.\nchar const * READS_TOKEN = \"reads\";\nchar const * READS_EXT = \".sam\";\n\n\/\/ Token and extension for orphans active map.\nchar const * SCAFFOLD_SEQS_TOKEN = \"scaffold_seqs\";\nchar const * SCAFFOLD_SEQS_EXT = \".fa\";\n\n\/\/ Token and extension for time log.\nchar const * TIME_LOG_TOKEN = \"time_log\";\nchar const * TIME_LOG_EXT = \".tsv\";\n<commit_msg>Using compressed file for orphans.<commit_after>\/\/ ==========================================================================\n\/\/ ANISE\n\/\/ ==========================================================================\n\/\/ Copyright (c) 2006-2014, Knut Reinert, FU Berlin\n\/\/ All rights reserved.\n\/\/\n\/\/ Redistribution and use in source and binary forms, with or without\n\/\/ modification, are permitted provided that the following conditions are met:\n\/\/\n\/\/ * Redistributions of source code must retain the above copyright\n\/\/ notice, this list of conditions and the following disclaimer.\n\/\/ * Redistributions in binary form must reproduce the above copyright\n\/\/ notice, this list of conditions and the following disclaimer in the\n\/\/ documentation and\/or other materials provided with the distribution.\n\/\/ * Neither the name of Knut Reinert or the FU Berlin nor the names of\n\/\/ its contributors may be used to endorse or promote products derived\n\/\/ from this software without specific prior written permission.\n\/\/\n\/\/ THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS \"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 KNUT REINERT OR THE FU BERLIN BE LIABLE\n\/\/ FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL\n\/\/ DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR\n\/\/ SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER\n\/\/ CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT\n\/\/ LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY\n\/\/ OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH\n\/\/ DAMAGE.\n\/\/\n\/\/ ==========================================================================\n\/\/ Author: Manuel Holtgrewe <manuel.holtgrewe@fu-berlin.de>\n\/\/ ==========================================================================\n\n#include \"file_name_tokens.h\"\n\nchar const * GLOBAL_STATE_TOKEN = \"global_state\";\nchar const * GLOBAL_STATE_EXT = \".txt\";\n\n\/\/ Token and extension for site state files.\nchar const * SITE_STATE_TOKEN = \"site_state\";\nchar const * SITE_STATE_EXT = \".txt\";\n\n\/\/ Token and extension for orphans FASTQ file.\nchar const * ORPHANS_TOKEN = \"orphans\";\nchar const * ORPHANS_EXT = \".fq.gz\";\n\n\/\/ Token and extension for orphans active map.\nchar const * ORPHANS_ACTIVE_TOKEN = \"orphans_active\";\nchar const * ORPHANS_ACTIVE_EXT = \".bin\";\n\n\/\/ Token and extension for reads SAM files.\nchar const * READS_TOKEN = \"reads\";\nchar const * READS_EXT = \".sam\";\n\n\/\/ Token and extension for orphans active map.\nchar const * SCAFFOLD_SEQS_TOKEN = \"scaffold_seqs\";\nchar const * SCAFFOLD_SEQS_EXT = \".fa\";\n\n\/\/ Token and extension for time log.\nchar const * TIME_LOG_TOKEN = \"time_log\";\nchar const * TIME_LOG_EXT = \".tsv\";\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\/win\/cursor.h\"\n\n#include <algorithm>\n\n#include \"webrtc\/modules\/desktop_capture\/win\/scoped_gdi_object.h\"\n#include \"webrtc\/modules\/desktop_capture\/desktop_frame.h\"\n#include \"webrtc\/modules\/desktop_capture\/desktop_geometry.h\"\n#include \"webrtc\/system_wrappers\/interface\/compile_assert.h\"\n#include \"webrtc\/system_wrappers\/interface\/logging.h\"\n#include \"webrtc\/system_wrappers\/interface\/scoped_ptr.h\"\n#include \"webrtc\/typedefs.h\"\n\nnamespace webrtc {\n\nnamespace {\n\n#if defined(WEBRTC_ARCH_LITTLE_ENDIAN)\n\n#define RGBA(r, g, b, a) \\\n ((((a) << 24) & 0xff000000) | \\\n (((b) << 16) & 0xff0000) | \\\n (((g) << 8) & 0xff00) | \\\n ((r) & 0xff))\n\n#else \/\/ !defined(WEBRTC_ARCH_LITTLE_ENDIAN)\n\n#define RGBA(r, g, b, a) \\\n ((((r) << 24) & 0xff000000) | \\\n (((g) << 16) & 0xff0000) | \\\n (((b) << 8) & 0xff00) | \\\n ((a) & 0xff))\n\n#endif \/\/ !defined(WEBRTC_ARCH_LITTLE_ENDIAN)\n\nconst int kBytesPerPixel = DesktopFrame::kBytesPerPixel;\n\n\/\/ Pixel colors used when generating cursor outlines.\nconst uint32_t kPixelRgbaBlack = RGBA(0, 0, 0, 0xff);\nconst uint32_t kPixelRgbaWhite = RGBA(0xff, 0xff, 0xff, 0xff);\nconst uint32_t kPixelRgbaTransparent = RGBA(0, 0, 0, 0);\n\nconst uint32_t kPixelRgbWhite = RGB(0xff, 0xff, 0xff);\nconst uint32_t kPixelRgbBlack = RGB(0, 0, 0);\n\n\/\/ Expands the cursor shape to add a white outline for visibility against\n\/\/ dark backgrounds.\nvoid AddCursorOutline(int width, int height, uint32_t* data) {\n for (int y = 0; y < height; y++) {\n for (int x = 0; x < width; x++) {\n \/\/ If this is a transparent pixel (bgr == 0 and alpha = 0), check the\n \/\/ neighbor pixels to see if this should be changed to an outline pixel.\n if (*data == kPixelRgbaTransparent) {\n \/\/ Change to white pixel if any neighbors (top, bottom, left, right)\n \/\/ are black.\n if ((y > 0 && data[-width] == kPixelRgbaBlack) ||\n (y < height - 1 && data[width] == kPixelRgbaBlack) ||\n (x > 0 && data[-1] == kPixelRgbaBlack) ||\n (x < width - 1 && data[1] == kPixelRgbaBlack)) {\n *data = kPixelRgbaWhite;\n }\n }\n data++;\n }\n }\n}\n\n\/\/ Premultiplies RGB components of a pixel by its alpha component.\nuint32_t AlphaMul(uint32_t pixel) {\n COMPILE_ASSERT(sizeof(uint32_t) == kBytesPerPixel);\n\n RGBQUAD from = *reinterpret_cast<RGBQUAD*>(&pixel);\n RGBQUAD to = {\n (static_cast<uint16_t>(from.rgbBlue) * from.rgbReserved) \/ 0xff,\n (static_cast<uint16_t>(from.rgbGreen) * from.rgbReserved) \/ 0xff,\n (static_cast<uint16_t>(from.rgbRed) * from.rgbReserved) \/ 0xff,\n from.rgbReserved\n };\n\n return *reinterpret_cast<uint32_t*>(&to);\n}\n\n\/\/ Scans a 32bpp bitmap looking for any pixels with non-zero alpha component.\n\/\/ |*has_alpha| is set to true if non-zero alpha is found. |stride| is expressed\n\/\/ in pixels.\nbool HasAlphaChannel(const uint32_t* data, int stride, int width, int height,\n bool* has_alpha) {\n const RGBQUAD* plane = reinterpret_cast<const RGBQUAD*>(data);\n for (int y = 0; y < height; ++y) {\n for (int x = 0; x < width; ++x) {\n if (plane->rgbReserved != 0) {\n *has_alpha = true;\n return true;\n }\n plane += 1;\n }\n plane += stride - width;\n }\n\n *has_alpha = false;\n return true;\n}\n\n} \/\/ namespace\n\nMouseCursorShape* CreateMouseCursorShapeFromCursor(HDC dc, HCURSOR cursor) {\n ICONINFO iinfo;\n if (!GetIconInfo(cursor, &iinfo)) {\n LOG_F(LS_ERROR) << \"Unable to get cursor icon info. Error = \"\n << GetLastError();\n return NULL;\n }\n\n int hotspot_x = iinfo.xHotspot;\n int hotspot_y = iinfo.yHotspot;\n\n \/\/ Make sure the bitmaps will be freed.\n win::ScopedBitmap scoped_mask(iinfo.hbmMask);\n win::ScopedBitmap scoped_color(iinfo.hbmColor);\n bool is_color = iinfo.hbmColor != NULL;\n\n \/\/ Get |scoped_mask| dimensions.\n BITMAP bitmap_info;\n if (!GetObject(scoped_mask, sizeof(bitmap_info), &bitmap_info)) {\n LOG_F(LS_ERROR) << \"Unable to get bitmap info. Error = \"\n << GetLastError();\n return NULL;\n }\n\n int width = bitmap_info.bmWidth;\n int height = bitmap_info.bmHeight;\n scoped_array<uint32_t> mask_data(new uint32_t[width * height]);\n\n \/\/ Get pixel data from |scoped_mask| converting it to 32bpp along the way.\n \/\/ GetDIBits() sets the alpha component of every pixel to 0.\n BITMAPV5HEADER bmi = {0};\n bmi.bV5Size = sizeof(bmi);\n bmi.bV5Width = width;\n bmi.bV5Height = -height; \/\/ request a top-down bitmap.\n bmi.bV5Planes = 1;\n bmi.bV5BitCount = kBytesPerPixel * 8;\n bmi.bV5Compression = BI_RGB;\n bmi.bV5AlphaMask = 0xff000000;\n bmi.bV5CSType = LCS_WINDOWS_COLOR_SPACE;\n bmi.bV5Intent = LCS_GM_BUSINESS;\n if (!GetDIBits(dc,\n scoped_mask,\n 0,\n height,\n mask_data.get(),\n reinterpret_cast<BITMAPINFO*>(&bmi),\n DIB_RGB_COLORS)) {\n LOG_F(LS_ERROR) << \"Unable to get bitmap bits. Error = \"\n << GetLastError();\n return NULL;\n }\n\n uint32_t* mask_plane = mask_data.get();\n\n scoped_array<uint32_t> color_data;\n uint32_t* color_plane = NULL;\n int color_stride = 0;\n bool has_alpha = false;\n\n if (is_color) {\n \/\/ Get the pixels from the color bitmap.\n color_data.reset(new uint32_t[width * height]);\n if (!GetDIBits(dc,\n scoped_color,\n 0,\n height,\n color_data.get(),\n reinterpret_cast<BITMAPINFO*>(&bmi),\n DIB_RGB_COLORS)) {\n LOG_F(LS_ERROR) << \"Unable to get bitmap bits. Error = \"\n << GetLastError();\n return NULL;\n }\n\n color_plane = color_data.get();\n color_stride = width;\n\n \/\/ GetDIBits() does not provide any indication whether the bitmap has alpha\n \/\/ channel, so we use HasAlphaChannel() below to find it out.\n if (!HasAlphaChannel(color_plane, color_stride, width, height, &has_alpha))\n return NULL;\n } else {\n \/\/ For non-color cursors, the mask contains both an AND and an XOR mask and\n \/\/ the height includes both. Thus, the width is correct, but we need to\n \/\/ divide by 2 to get the correct mask height.\n height \/= 2;\n\n \/\/ The XOR mask becomes the color bitmap.\n color_plane = mask_plane + (width * height);\n color_stride = width;\n }\n\n \/\/ Reconstruct transparency from the mask if the color image does not has\n \/\/ alpha channel.\n if (!has_alpha) {\n bool add_outline = false;\n uint32_t* color = color_plane;\n uint32_t* dst = color_plane;\n uint32_t* mask = mask_plane;\n for (int y = 0; y < height; y++) {\n for (int x = 0; x < width; x++) {\n \/\/ The two bitmaps combine as follows:\n \/\/ mask color Windows Result Our result RGB Alpha\n \/\/ 0 00 Black Black 00 ff\n \/\/ 0 ff White White ff ff\n \/\/ 1 00 Screen Transparent 00 00\n \/\/ 1 ff Reverse-screen Black 00 ff\n \/\/\n \/\/ Since we don't support XOR cursors, we replace the \"Reverse Screen\"\n \/\/ with black. In this case, we also add an outline around the cursor\n \/\/ so that it is visible against a dark background.\n if (*mask == kPixelRgbWhite) {\n if (*color != 0) {\n add_outline = true;\n *dst = kPixelRgbaBlack;\n } else {\n *dst = kPixelRgbaTransparent;\n }\n } else {\n *dst = kPixelRgbaBlack ^ *color;\n }\n\n ++color;\n ++dst;\n ++mask;\n }\n }\n if (add_outline) {\n AddCursorOutline(width, height, color_plane);\n }\n }\n\n scoped_ptr<MouseCursorShape> result(new MouseCursorShape());\n result->data.assign(reinterpret_cast<char*>(color_plane),\n height * width * kBytesPerPixel);\n result->size.set(width, height);\n result->hotspot.set(hotspot_x, hotspot_y);\n return result.release();\n}\n\n} \/\/ namespace webrtc\n<commit_msg>Pre-multiply images for MouseCursorShape.<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\/win\/cursor.h\"\n\n#include <algorithm>\n\n#include \"webrtc\/modules\/desktop_capture\/win\/scoped_gdi_object.h\"\n#include \"webrtc\/modules\/desktop_capture\/desktop_frame.h\"\n#include \"webrtc\/modules\/desktop_capture\/desktop_geometry.h\"\n#include \"webrtc\/system_wrappers\/interface\/compile_assert.h\"\n#include \"webrtc\/system_wrappers\/interface\/logging.h\"\n#include \"webrtc\/system_wrappers\/interface\/scoped_ptr.h\"\n#include \"webrtc\/typedefs.h\"\n\nnamespace webrtc {\n\nnamespace {\n\n#if defined(WEBRTC_ARCH_LITTLE_ENDIAN)\n\n#define RGBA(r, g, b, a) \\\n ((((a) << 24) & 0xff000000) | \\\n (((b) << 16) & 0xff0000) | \\\n (((g) << 8) & 0xff00) | \\\n ((r) & 0xff))\n\n#else \/\/ !defined(WEBRTC_ARCH_LITTLE_ENDIAN)\n\n#define RGBA(r, g, b, a) \\\n ((((r) << 24) & 0xff000000) | \\\n (((g) << 16) & 0xff0000) | \\\n (((b) << 8) & 0xff00) | \\\n ((a) & 0xff))\n\n#endif \/\/ !defined(WEBRTC_ARCH_LITTLE_ENDIAN)\n\nconst int kBytesPerPixel = DesktopFrame::kBytesPerPixel;\n\n\/\/ Pixel colors used when generating cursor outlines.\nconst uint32_t kPixelRgbaBlack = RGBA(0, 0, 0, 0xff);\nconst uint32_t kPixelRgbaWhite = RGBA(0xff, 0xff, 0xff, 0xff);\nconst uint32_t kPixelRgbaTransparent = RGBA(0, 0, 0, 0);\n\nconst uint32_t kPixelRgbWhite = RGB(0xff, 0xff, 0xff);\nconst uint32_t kPixelRgbBlack = RGB(0, 0, 0);\n\n\/\/ Expands the cursor shape to add a white outline for visibility against\n\/\/ dark backgrounds.\nvoid AddCursorOutline(int width, int height, uint32_t* data) {\n for (int y = 0; y < height; y++) {\n for (int x = 0; x < width; x++) {\n \/\/ If this is a transparent pixel (bgr == 0 and alpha = 0), check the\n \/\/ neighbor pixels to see if this should be changed to an outline pixel.\n if (*data == kPixelRgbaTransparent) {\n \/\/ Change to white pixel if any neighbors (top, bottom, left, right)\n \/\/ are black.\n if ((y > 0 && data[-width] == kPixelRgbaBlack) ||\n (y < height - 1 && data[width] == kPixelRgbaBlack) ||\n (x > 0 && data[-1] == kPixelRgbaBlack) ||\n (x < width - 1 && data[1] == kPixelRgbaBlack)) {\n *data = kPixelRgbaWhite;\n }\n }\n data++;\n }\n }\n}\n\n\/\/ Premultiplies RGB components of the pixel data in the given image by\n\/\/ the corresponding alpha components.\nvoid AlphaMul(uint32_t* data, int width, int height) {\n COMPILE_ASSERT(sizeof(uint32_t) == kBytesPerPixel);\n\n for (uint32_t* data_end = data + width * height; data != data_end; ++data) {\n RGBQUAD* from = reinterpret_cast<RGBQUAD*>(data);\n RGBQUAD* to = reinterpret_cast<RGBQUAD*>(data);\n to->rgbBlue =\n (static_cast<uint16_t>(from->rgbBlue) * from->rgbReserved) \/ 0xff;\n to->rgbGreen =\n (static_cast<uint16_t>(from->rgbGreen) * from->rgbReserved) \/ 0xff;\n to->rgbRed =\n (static_cast<uint16_t>(from->rgbRed) * from->rgbReserved) \/ 0xff;\n }\n}\n\n\/\/ Scans a 32bpp bitmap looking for any pixels with non-zero alpha component.\n\/\/ |*has_alpha| is set to true if non-zero alpha is found. |stride| is expressed\n\/\/ in pixels.\nbool HasAlphaChannel(const uint32_t* data, int stride, int width, int height,\n bool* has_alpha) {\n const RGBQUAD* plane = reinterpret_cast<const RGBQUAD*>(data);\n for (int y = 0; y < height; ++y) {\n for (int x = 0; x < width; ++x) {\n if (plane->rgbReserved != 0) {\n *has_alpha = true;\n return true;\n }\n plane += 1;\n }\n plane += stride - width;\n }\n\n *has_alpha = false;\n return true;\n}\n\n} \/\/ namespace\n\nMouseCursorShape* CreateMouseCursorShapeFromCursor(HDC dc, HCURSOR cursor) {\n ICONINFO iinfo;\n if (!GetIconInfo(cursor, &iinfo)) {\n LOG_F(LS_ERROR) << \"Unable to get cursor icon info. Error = \"\n << GetLastError();\n return NULL;\n }\n\n int hotspot_x = iinfo.xHotspot;\n int hotspot_y = iinfo.yHotspot;\n\n \/\/ Make sure the bitmaps will be freed.\n win::ScopedBitmap scoped_mask(iinfo.hbmMask);\n win::ScopedBitmap scoped_color(iinfo.hbmColor);\n bool is_color = iinfo.hbmColor != NULL;\n\n \/\/ Get |scoped_mask| dimensions.\n BITMAP bitmap_info;\n if (!GetObject(scoped_mask, sizeof(bitmap_info), &bitmap_info)) {\n LOG_F(LS_ERROR) << \"Unable to get bitmap info. Error = \"\n << GetLastError();\n return NULL;\n }\n\n int width = bitmap_info.bmWidth;\n int height = bitmap_info.bmHeight;\n scoped_array<uint32_t> mask_data(new uint32_t[width * height]);\n\n \/\/ Get pixel data from |scoped_mask| converting it to 32bpp along the way.\n \/\/ GetDIBits() sets the alpha component of every pixel to 0.\n BITMAPV5HEADER bmi = {0};\n bmi.bV5Size = sizeof(bmi);\n bmi.bV5Width = width;\n bmi.bV5Height = -height; \/\/ request a top-down bitmap.\n bmi.bV5Planes = 1;\n bmi.bV5BitCount = kBytesPerPixel * 8;\n bmi.bV5Compression = BI_RGB;\n bmi.bV5AlphaMask = 0xff000000;\n bmi.bV5CSType = LCS_WINDOWS_COLOR_SPACE;\n bmi.bV5Intent = LCS_GM_BUSINESS;\n if (!GetDIBits(dc,\n scoped_mask,\n 0,\n height,\n mask_data.get(),\n reinterpret_cast<BITMAPINFO*>(&bmi),\n DIB_RGB_COLORS)) {\n LOG_F(LS_ERROR) << \"Unable to get bitmap bits. Error = \"\n << GetLastError();\n return NULL;\n }\n\n uint32_t* mask_plane = mask_data.get();\n\n scoped_array<uint32_t> color_data;\n uint32_t* color_plane = NULL;\n int color_stride = 0;\n bool has_alpha = false;\n\n if (is_color) {\n \/\/ Get the pixels from the color bitmap.\n color_data.reset(new uint32_t[width * height]);\n if (!GetDIBits(dc,\n scoped_color,\n 0,\n height,\n color_data.get(),\n reinterpret_cast<BITMAPINFO*>(&bmi),\n DIB_RGB_COLORS)) {\n LOG_F(LS_ERROR) << \"Unable to get bitmap bits. Error = \"\n << GetLastError();\n return NULL;\n }\n\n color_plane = color_data.get();\n color_stride = width;\n\n \/\/ GetDIBits() does not provide any indication whether the bitmap has alpha\n \/\/ channel, so we use HasAlphaChannel() below to find it out.\n if (!HasAlphaChannel(color_plane, color_stride, width, height, &has_alpha))\n return NULL;\n } else {\n \/\/ For non-color cursors, the mask contains both an AND and an XOR mask and\n \/\/ the height includes both. Thus, the width is correct, but we need to\n \/\/ divide by 2 to get the correct mask height.\n height \/= 2;\n\n \/\/ The XOR mask becomes the color bitmap.\n color_plane = mask_plane + (width * height);\n color_stride = width;\n }\n\n \/\/ Reconstruct transparency from the mask if the color image does not has\n \/\/ alpha channel.\n if (!has_alpha) {\n bool add_outline = false;\n uint32_t* color = color_plane;\n uint32_t* dst = color_plane;\n uint32_t* mask = mask_plane;\n for (int y = 0; y < height; y++) {\n for (int x = 0; x < width; x++) {\n \/\/ The two bitmaps combine as follows:\n \/\/ mask color Windows Result Our result RGB Alpha\n \/\/ 0 00 Black Black 00 ff\n \/\/ 0 ff White White ff ff\n \/\/ 1 00 Screen Transparent 00 00\n \/\/ 1 ff Reverse-screen Black 00 ff\n \/\/\n \/\/ Since we don't support XOR cursors, we replace the \"Reverse Screen\"\n \/\/ with black. In this case, we also add an outline around the cursor\n \/\/ so that it is visible against a dark background.\n if (*mask == kPixelRgbWhite) {\n if (*color != 0) {\n add_outline = true;\n *dst = kPixelRgbaBlack;\n } else {\n *dst = kPixelRgbaTransparent;\n }\n } else {\n *dst = kPixelRgbaBlack ^ *color;\n }\n\n ++color;\n ++dst;\n ++mask;\n }\n }\n if (add_outline) {\n AddCursorOutline(width, height, color_plane);\n }\n }\n\n \/\/ Pre-multiply the resulting pixels since MouseCursorShape uses premultiplied\n \/\/ images.\n AlphaMul(color_plane, width, height);\n\n scoped_ptr<MouseCursorShape> result(new MouseCursorShape());\n result->data.assign(reinterpret_cast<char*>(color_plane),\n height * width * kBytesPerPixel);\n result->size.set(width, height);\n result->hotspot.set(hotspot_x, hotspot_y);\n return result.release();\n}\n\n} \/\/ namespace webrtc\n<|endoftext|>"} {"text":"<commit_before>#include <stdio.h>\n#include <stdlib.h>\n#include <fstream>\n#include <limits.h>\n#include <random>\n\n#include \"transpose.h\"\n\n#define BIT(x) ((unsigned long long) 1 << x)\n\ntemplate <typename T>\nunion container {\n\tT native;\n\tunsigned char bytes[sizeof(T)];\n};\n\ntemplate <typename T>\nvoid\nassign_bit(T *in_ptr, T *out_ptr, size_t elem_index_out, size_t sig_bit, size_t out_bit)\n{\n\t\/*\n\t * Part of the transpose operation. Take the (sig_bit) bit of the (out_bit)\n\t * element of (in_ptr), and move it to the (out_bit) bit of the (sig_bit)\n\t * block of (out_ptr), at index elem_index_out. See README for explanation.\n\t *\/\n\tcontainer<T> in, out;\n\tin.native = in_ptr[out_bit];\n\tout.native = out_ptr[elem_index_out];\n\n\t\/* Each elem has sizeof(T) \"bytes\". We only need one of them. *\/\n\tsize_t bits_per_elem = sizeof(T)*CHAR_BIT;\n\tsize_t in_byte_index = sig_bit\/CHAR_BIT; \/* Verified. *\/\n\tsize_t out_byte_index = (out_bit % bits_per_elem) \/ CHAR_BIT; \/* Verified. *\/\n\tsize_t sig_bit_byte_index = sig_bit % CHAR_BIT; \/* Verified. *\/\n\tsize_t out_bit_byte_index = out_bit % CHAR_BIT; \/* Verified. *\/\n\n\tout.bytes[out_byte_index] |=\n\t\tBIT(out_bit_byte_index) * !!(BIT(sig_bit_byte_index) & in.bytes[in_byte_index]);\n\n\tout_ptr[elem_index_out] = out.native;\n}\n\ntemplate <typename T>\nvoid\ntranspose(T *data_in, T *data_out, size_t len)\n{\n\t\/*\n\t * Bitwise transpose elements of type T such that the n-th significant bits\n\t * are stored contiguously in memory.\n\t *\/\n\tsize_t sig_bit, out_bit, sigbit_start, elem_index_out, bits_per_elem;\n\tbits_per_elem = sizeof(T)*CHAR_BIT;\n\n\tfor (sig_bit=0; sig_bit<bits_per_elem; sig_bit++){\n\t\tsigbit_start = sig_bit*len\/bits_per_elem;\n\t\tfor (out_bit=0; out_bit<len; out_bit++){\n\t\t\telem_index_out = sigbit_start + out_bit\/bits_per_elem;\n\t\t\tassign_bit(data_in, data_out, elem_index_out, sig_bit, out_bit);\n\t\t}\n\t}\n}\n\ntemplate <typename T>\nvoid\ncreate_test_files(size_t elems, double mean, double stddev, const char *typestr)\n{\n\tsize_t i;\n\n\tT *in = (T*) calloc(elems, sizeof(T));\n\tif (!in){\n\t\tprintf(\"Could not alloc memory\\n\");\n\t\texit(1);\n\t}\n\tT *out = (T*) calloc(elems, sizeof(T));\n\tif (!out){\n\t\tprintf(\"Could not alloc memory\\n\");\n\t\texit(1);\n\t}\n\n\tusing namespace std;\n\n\tdefault_random_engine rng;\n\tnormal_distribution<double> gaussian(mean, stddev);\n\tfor (i=0; i<elems; i++){\n\t\tin[i] = (T) gaussian(rng)+(i*0.01);\n\t}\n\n\ttranspose(in, out, elems);\n\n\tofstream out_stream;\n\tchar out_name[50];\n\n\tsprintf(out_name, \"raw_%s_%.2f_pm_%.2f.bin\", typestr, mean, stddev);\n\tout_stream.open(out_name, ios::out | ios::binary);\n\tout_stream.write((char*)in, elems*sizeof(T));\n\tout_stream.close();\n\n\tsprintf(out_name, \"transposed_%s_%.2f_pm_%.2f.bin\", typestr, mean, stddev);\n\tout_stream.open(out_name, ios::out | ios::binary);\n\tout_stream.write((char*)out, elems*sizeof(T));\n\tout_stream.close();\n\n\tfree(in);\n\tfree(out);\n}\n\ntemplate <typename T>\nvoid\ncreate_test_files_from_arr(T *arr, size_t elems)\n{\n\tT *out = (T*) calloc(elems, sizeof(T));\n\tif (!out){\n\t\tprintf(\"Could not alloc memory\\n\");\n\t\texit(1);\n\t}\n\n\tusing namespace std;\n\n\ttranspose(arr, out, elems);\n\n\tofstream out_stream;\n\tchar out_name[50];\n\n\tout_stream.open(\"raw_from_dat.bin\", ios::out | ios::binary);\n\tout_stream.write((char*)arr, elems*sizeof(T));\n\tout_stream.close();\n\n\tout_stream.open(\"transposed_from_dat.bin\", ios::out | ios::binary);\n\tout_stream.write((char*)out, elems*sizeof(T));\n\tout_stream.close();\n\n\tfree(out);\n}\n\nvoid\n_register_types(void)\n{\n\t\/* Hack to prevent execution of any called functions *\/\n\tint j = 1;\n\tif (j)\n\t\texit(1);\n\n\tfloat *f;\n\tint *i;\n\tdouble *d;\n\tlong *l;\n\tconst char *str;\n\n\tcreate_test_files_from_arr(f, (size_t) 0);\n\tcreate_test_files_from_arr(i, (size_t) 0);\n\tcreate_test_files_from_arr(d, (size_t) 0);\n\tcreate_test_files_from_arr(l, (size_t) 0);\n\n\tcreate_test_files<int>(size_t (0), 0.0, 0.0, str);\n\tcreate_test_files<float>(size_t (0), 0.0, 0.0, str);\n\tcreate_test_files<double>(size_t (0), 0.0, 0.0, str);\n\tcreate_test_files<long>(size_t (0), 0.0, 0.0, str);\n}\n<commit_msg>Remove trend in default transpose test data<commit_after>#include <stdio.h>\n#include <stdlib.h>\n#include <fstream>\n#include <limits.h>\n#include <random>\n\n#include \"transpose.h\"\n\n#define BIT(x) ((unsigned long long) 1 << x)\n\ntemplate <typename T>\nunion container {\n\tT native;\n\tunsigned char bytes[sizeof(T)];\n};\n\ntemplate <typename T>\nvoid\nassign_bit(T *in_ptr, T *out_ptr, size_t elem_index_out, size_t sig_bit, size_t out_bit)\n{\n\t\/*\n\t * Part of the transpose operation. Take the (sig_bit) bit of the (out_bit)\n\t * element of (in_ptr), and move it to the (out_bit) bit of the (sig_bit)\n\t * block of (out_ptr), at index elem_index_out. See README for explanation.\n\t *\/\n\tcontainer<T> in, out;\n\tin.native = in_ptr[out_bit];\n\tout.native = out_ptr[elem_index_out];\n\n\t\/* Each elem has sizeof(T) \"bytes\". We only need one of them. *\/\n\tsize_t bits_per_elem = sizeof(T)*CHAR_BIT;\n\tsize_t in_byte_index = sig_bit\/CHAR_BIT; \/* Verified. *\/\n\tsize_t out_byte_index = (out_bit % bits_per_elem) \/ CHAR_BIT; \/* Verified. *\/\n\tsize_t sig_bit_byte_index = sig_bit % CHAR_BIT; \/* Verified. *\/\n\tsize_t out_bit_byte_index = out_bit % CHAR_BIT; \/* Verified. *\/\n\n\tout.bytes[out_byte_index] |=\n\t\tBIT(out_bit_byte_index) * !!(BIT(sig_bit_byte_index) & in.bytes[in_byte_index]);\n\n\tout_ptr[elem_index_out] = out.native;\n}\n\ntemplate <typename T>\nvoid\ntranspose(T *data_in, T *data_out, size_t len)\n{\n\t\/*\n\t * Bitwise transpose elements of type T such that the n-th significant bits\n\t * are stored contiguously in memory.\n\t *\/\n\tsize_t sig_bit, out_bit, sigbit_start, elem_index_out, bits_per_elem;\n\tbits_per_elem = sizeof(T)*CHAR_BIT;\n\n\tfor (sig_bit=0; sig_bit<bits_per_elem; sig_bit++){\n\t\tsigbit_start = sig_bit*len\/bits_per_elem;\n\t\tfor (out_bit=0; out_bit<len; out_bit++){\n\t\t\telem_index_out = sigbit_start + out_bit\/bits_per_elem;\n\t\t\tassign_bit(data_in, data_out, elem_index_out, sig_bit, out_bit);\n\t\t}\n\t}\n}\n\ntemplate <typename T>\nvoid\ncreate_test_files(size_t elems, double mean, double stddev, const char *typestr)\n{\n\tsize_t i;\n\n\tT *in = (T*) calloc(elems, sizeof(T));\n\tif (!in){\n\t\tprintf(\"Could not alloc memory\\n\");\n\t\texit(1);\n\t}\n\tT *out = (T*) calloc(elems, sizeof(T));\n\tif (!out){\n\t\tprintf(\"Could not alloc memory\\n\");\n\t\texit(1);\n\t}\n\n\tusing namespace std;\n\n\tdefault_random_engine rng;\n\tnormal_distribution<double> gaussian(mean, stddev);\n\tfor (i=0; i<elems; i++){\n\t\tin[i] = (T) gaussian(rng);\n\t}\n\n\ttranspose(in, out, elems);\n\n\tofstream out_stream;\n\tchar out_name[50];\n\n\tsprintf(out_name, \"raw_%s_%.2f_pm_%.2f.bin\", typestr, mean, stddev);\n\tout_stream.open(out_name, ios::out | ios::binary);\n\tout_stream.write((char*)in, elems*sizeof(T));\n\tout_stream.close();\n\n\tsprintf(out_name, \"transposed_%s_%.2f_pm_%.2f.bin\", typestr, mean, stddev);\n\tout_stream.open(out_name, ios::out | ios::binary);\n\tout_stream.write((char*)out, elems*sizeof(T));\n\tout_stream.close();\n\n\tfree(in);\n\tfree(out);\n}\n\ntemplate <typename T>\nvoid\ncreate_test_files_from_arr(T *arr, size_t elems)\n{\n\tT *out = (T*) calloc(elems, sizeof(T));\n\tif (!out){\n\t\tprintf(\"Could not alloc memory\\n\");\n\t\texit(1);\n\t}\n\n\tusing namespace std;\n\n\ttranspose(arr, out, elems);\n\n\tofstream out_stream;\n\tchar out_name[50];\n\n\tout_stream.open(\"raw_from_dat.bin\", ios::out | ios::binary);\n\tout_stream.write((char*)arr, elems*sizeof(T));\n\tout_stream.close();\n\n\tout_stream.open(\"transposed_from_dat.bin\", ios::out | ios::binary);\n\tout_stream.write((char*)out, elems*sizeof(T));\n\tout_stream.close();\n\n\tfree(out);\n}\n\nvoid\n_register_types(void)\n{\n\t\/* Hack to prevent execution of any called functions *\/\n\tint j = 1;\n\tif (j)\n\t\texit(1);\n\n\tfloat *f;\n\tint *i;\n\tdouble *d;\n\tlong *l;\n\tconst char *str;\n\n\tcreate_test_files_from_arr(f, (size_t) 0);\n\tcreate_test_files_from_arr(i, (size_t) 0);\n\tcreate_test_files_from_arr(d, (size_t) 0);\n\tcreate_test_files_from_arr(l, (size_t) 0);\n\n\tcreate_test_files<int>(size_t (0), 0.0, 0.0, str);\n\tcreate_test_files<float>(size_t (0), 0.0, 0.0, str);\n\tcreate_test_files<double>(size_t (0), 0.0, 0.0, str);\n\tcreate_test_files<long>(size_t (0), 0.0, 0.0, str);\n}\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\/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 \"Global graph\";\n case 1: return \"Function \" + G->getReturnNodes().begin()->first->getName();\n default:\n std::string Return = \"Functions: \";\n for (DSGraph::ReturnNodesTy::const_iterator I=G->getReturnNodes().begin();\n I != G->getReturnNodes().end(); ++I)\n Return += I->first->getName() + \" \";\n return Return;\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)) {\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>Use the getFunctionNames method<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\/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)) {\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 \"nuclear_burn.hpp\"\n#include \"source\/misc\/vector_initialiser.hpp\"\n#include \"safe_retrieve.hpp\"\n#include <fstream>\n\nextern \"C\" {\n\n void initnet_(const char* rfile);\n\n void burn_step_(int* indexeos,\n\t\t double* density,\n\t\t double* energy,\n\t\t double* tburn,\n\t\t double* xn,\n\t\t double* atomw,\n\t\t double* atomn,\n\t\t double* dedtmp,\n\t\t int* matters,\n\t\t double* dt,\n\t\t double* qrec,\n\t\t int* nse,\n\t\t double* tmp_nse,\n\t\t int* key_done,\n\t\t char* screen_type);\n}\n\nnamespace {\n\n pair<double,vector<double> > burn_step_wrapper(double density,\n\t\t\t\t\t\t double energy,\n\t\t\t\t\t\t double tburn,\n\t\t\t\t\t\t vector<double> xn,\n\t\t\t\t\t\t pair<double,double> az,\n\t\t\t\t\t\t double dt)\n {\n int indexeos = 0;\n double dedtmp = 0;\n int matters = static_cast<int>(xn.size());\n double qrec = 0;\n int nse = 0;\n double tmp_nse = 1e10;\n char screen_type[80] = \"default\";\n int key_done = 0;\n burn_step_(&indexeos,\n\t &density,\n\t &energy,\n\t &tburn,\n\t &xn[0],\n\t &az.first,\n\t &az.second,\n\t &dedtmp,\n\t &matters,\n\t &dt,\n\t &qrec,\n\t &nse,\n\t &tmp_nse,\n\t &key_done,\n\t screen_type);\n if(key_done!=1){\n std::ofstream f(\"burn_step_error_report.txt\");\n f << \"density = \" << density << \"\\n\";\n f << \"energy = \" << energy << \"\\n\";\n f << \"temperature = \" << tburn << \"\\n\";\n f << \"atomic weight = \" << az.first << \"\\n\";\n f << \"atomic number = \" << az.second << \"\\n\";\n f << \"dt = \" << dt << \"\\n\";\n f.close();\n assert(key_done==1);\n }\n return pair<double,vector<double> >(qrec,xn);\n }\n\n vector<double> serialize_tracers(const map<string,double>& tracers,\n\t\t\t\t const vector<string>& isotope_list)\n {\n vector<double> res;\n for(size_t i=0;i<isotope_list.size();++i){\n res.push_back(safe_retrieve(tracers,isotope_list.at(i)));\n }\n return res;\n }\n\n map<string,double> reassemble_tracers(const vector<double>& compositions,\n\t\t\t\t\tconst vector<string>& isotope_list)\n {\n assert(compositions.size()==isotope_list.size());\n map<string,double> res;\n for(size_t i=0;i<compositions.size();++i)\n res[isotope_list[i]] = compositions[i];\n return res;\n }\n}\n\nNuclearBurn::NuclearBurn\n(const string& rfile,\n const string& ignore_label,\n const FermiTable& eos):\n t_prev_(0),\n ignore_label_(ignore_label),\n eos_(eos),\n isotope_list_(VectorInitialiser<string>(\"He4\")\n\t\t(\"C12\")\n\t\t(\"O16\")\n\t\t(\"Ne20\")\n\t\t(\"Mg24\")\n\t\t(\"Si28\")\n\t\t(\"S32\")\n\t\t(\"Ar36\")\n\t\t(\"Ca40\")\n\t\t(\"Ti44\")\n\t\t(\"Cr48\")\n\t\t(\"Fe52\")\n\t\t(\"Ni56\")())\n{\n initnet_(rfile.c_str());\n}\n\nvoid NuclearBurn::operator()(hdsim& sim)\n{\n const double dt = sim.getTime() - t_prev_;\n vector<ComputationalCell>& cells = sim.getAllCells();\n for(size_t i=0;i<cells.size();++i){\n ComputationalCell& cell = cells[i];\n if(safe_retrieve(cell.stickers,ignore_label_))\n continue;\n const double temperature = eos_.dp2t(cell.density,\n\t\t\t\t\t cell.pressure,\n\t\t\t\t\t cell.tracers);\n const double energy = eos_.dp2e(cell.density,\n\t\t\t\t cell.pressure,\n\t\t\t\t cell.tracers);\n const pair<double,vector<double> > qrec_tracers =\n burn_step_wrapper(cell.density,energy,temperature,\n\t\t\tserialize_tracers(cell.tracers,\n\t\t\t\t\t isotope_list_),\n\t\t\teos_.calcAverageAtomicProperties(cell.tracers),\n\t\t\tdt);\n const double new_energy = energy + dt*qrec_tracers.first;\n cell.tracers = reassemble_tracers(qrec_tracers.second,isotope_list_);\n cell.pressure = eos_.de2p(cell.density, new_energy, cell.tracers);\n }\n sim.recalculateExtensives();\n}\n<commit_msg>fix bug<commit_after>#include \"nuclear_burn.hpp\"\n#include \"source\/misc\/vector_initialiser.hpp\"\n#include \"safe_retrieve.hpp\"\n#include <fstream>\n\nextern \"C\" {\n\n void initnet_(const char* rfile);\n\n void burn_step_(int* indexeos,\n\t\t double* density,\n\t\t double* energy,\n\t\t double* tburn,\n\t\t double* xn,\n\t\t double* atomw,\n\t\t double* atomn,\n\t\t double* dedtmp,\n\t\t int* matters,\n\t\t double* dt,\n\t\t double* qrec,\n\t\t int* nse,\n\t\t double* tmp_nse,\n\t\t int* key_done,\n\t\t char* screen_type);\n}\n\nnamespace {\n\n pair<double,vector<double> > burn_step_wrapper(double density,\n\t\t\t\t\t\t double energy,\n\t\t\t\t\t\t double tburn,\n\t\t\t\t\t\t vector<double> xn,\n\t\t\t\t\t\t pair<double,double> az,\n\t\t\t\t\t\t double dt)\n {\n int indexeos = 0;\n double dedtmp = 0;\n int matters = static_cast<int>(xn.size());\n double qrec = 0;\n int nse = 0;\n double tmp_nse = 1e10;\n char screen_type[80] = \"default\";\n int key_done = 0;\n burn_step_(&indexeos,\n\t &density,\n\t &energy,\n\t &tburn,\n\t &xn[0],\n\t &az.first,\n\t &az.second,\n\t &dedtmp,\n\t &matters,\n\t &dt,\n\t &qrec,\n\t &nse,\n\t &tmp_nse,\n\t &key_done,\n\t screen_type);\n if(key_done!=1){\n std::ofstream f(\"burn_step_error_report.txt\");\n f << \"density = \" << density << \"\\n\";\n f << \"energy = \" << energy << \"\\n\";\n f << \"temperature = \" << tburn << \"\\n\";\n f << \"atomic weight = \" << az.first << \"\\n\";\n f << \"atomic number = \" << az.second << \"\\n\";\n f << \"dt = \" << dt << \"\\n\";\n f.close();\n assert(key_done==1);\n }\n return pair<double,vector<double> >(qrec,xn);\n }\n\n vector<double> serialize_tracers(const map<string,double>& tracers,\n\t\t\t\t const vector<string>& isotope_list)\n {\n vector<double> res;\n for(size_t i=0;i<isotope_list.size();++i){\n res.push_back(safe_retrieve(tracers,isotope_list.at(i)));\n }\n return res;\n }\n\n map<string,double> reassemble_tracers(const vector<double>& compositions,\n\t\t\t\t\tconst vector<string>& isotope_list)\n {\n assert(compositions.size()==isotope_list.size());\n map<string,double> res;\n for(size_t i=0;i<compositions.size();++i)\n res[isotope_list[i]] = compositions[i];\n return res;\n }\n}\n\nNuclearBurn::NuclearBurn\n(const string& rfile,\n const string& ignore_label,\n const FermiTable& eos):\n t_prev_(0),\n ignore_label_(ignore_label),\n eos_(eos),\n isotope_list_(VectorInitialiser<string>(\"He4\")\n\t\t(\"C12\")\n\t\t(\"O16\")\n\t\t(\"Ne20\")\n\t\t(\"Mg24\")\n\t\t(\"Si28\")\n\t\t(\"S32\")\n\t\t(\"Ar36\")\n\t\t(\"Ca40\")\n\t\t(\"Ti44\")\n\t\t(\"Cr48\")\n\t\t(\"Fe52\")\n\t\t(\"Ni56\")())\n{\n initnet_(rfile.c_str());\n}\n\nvoid NuclearBurn::operator()(hdsim& sim)\n{\n const double dt = sim.getTime() - t_prev_;\n t_prev_ = sim.getTime();\n vector<ComputationalCell>& cells = sim.getAllCells();\n for(size_t i=0;i<cells.size();++i){\n ComputationalCell& cell = cells[i];\n if(safe_retrieve(cell.stickers,ignore_label_))\n continue;\n const double temperature = eos_.dp2t(cell.density,\n\t\t\t\t\t cell.pressure,\n\t\t\t\t\t cell.tracers);\n const double energy = eos_.dp2e(cell.density,\n\t\t\t\t cell.pressure,\n\t\t\t\t cell.tracers);\n const pair<double,vector<double> > qrec_tracers =\n burn_step_wrapper(cell.density,energy,temperature,\n\t\t\tserialize_tracers(cell.tracers,\n\t\t\t\t\t isotope_list_),\n\t\t\teos_.calcAverageAtomicProperties(cell.tracers),\n\t\t\tdt);\n const double new_energy = energy + dt*qrec_tracers.first;\n cell.tracers = reassemble_tracers(qrec_tracers.second,isotope_list_);\n cell.pressure = eos_.de2p(cell.density, new_energy, cell.tracers);\n }\n sim.recalculateExtensives();\n}\n<|endoftext|>"} {"text":"<commit_before>\/*\n * Gives the idc's friendly names.\n *\/\n\n#define vehicle_store 24233\n#define main_screen 24234\n#define vehicle_list 24235\n#define buy_vehicle_button 24236\n#define spawn_locations_button 1803\n<commit_msg>added idc definitions<commit_after>\/*\n * Gives the idc's friendly names.\n *\/\n\n#define vehicle_store 24233\n#define main_screen 24234\n#define vehicle_list 24235\n #define vehicle_list_filter 24240\n#define buy_vehicle_button 24236\n#define vehicle_picture 24237\n#define color_selection_text 24238\n#define color_selection 24239\n<|endoftext|>"} {"text":"<commit_before>\/*\n * This file is part of SmartLamp application.\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, 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 * Built for Attiny84 8Mhz, using AVR USBasp programmer.\n * VERSION 0.2\n *\/\n\n#include <avr\/io.h>\n#include <avr\/sleep.h>\n#include <time.h>\n\n#include <Arduino.h>\n\n#include <USIWire.h>\n#include <DS3232RTC.h>\n\n\/\/ Input\/output defines\n#define LED_BLUE 5\n#define LED_GR 3\n#define LED_RED 2\n\n#define BLU_STATE 1\n#define BLU_RESET 0\n\n#define RTC_INT_SQW 10\n\n\/\/ Serial defines\n#define SERIAL_BAUD 9600 \/\/ For at mode and for data mode (CC41, HM-10 and MLT-BT05)\n\n\/\/ I2C defines\n#define SDA 4\n#define SCL 6\n\n#define SLEEP_TIMEOUT 5000L \/\/ Timeout before sleep\n#define LENGTH 80 \/\/ Command buffer length\n\n\n\/\/ Global variables\nUSIWire bus; \/\/ USIWire instance (I2C bus)\nDS3232RTC RTC(bus); \/\/ DS3232 RTC instance (I2C bus)\n\nboolean data = false;\nunsigned long prevMillis = 0; \/\/ Millis counter to sleep\nbool rtcInitOk = false; \/\/ Communication OK with RTC\n\n\/\/ Put the micro to sleep\nvoid system_sleep() {\n set_sleep_mode(SLEEP_MODE_PWR_DOWN);\n sleep_enable();\n sleep_mode();\n\n \/\/ sleeping ...\n sleep_disable(); \/\/ wake up fully\n}\n\n\/*\n * Converts the date\/time to standard Unix epoch format, using time.h library (avr-libc)\n *\n * Param:\n * - int16_t YYYY: year (Gregorian format: ex. 2017)\n * - int8_t MM: month\n * - int8_t DD: day of the month\n * - int8_t hh: hour\n * - int8_t mm: minute\n * - int8_t ss: second\n *\/\ntime_t tmConvert_t(int16_t YYYY, int8_t MM, int8_t DD, int8_t hh, int8_t mm, int8_t ss) {\n struct tm tm;\n tm.tm_year = YYYY - 1900 + 30; \/\/ avr-libc time.h: years since 1900 + y2k epoch difference (2000 - 1970)\n tm.tm_mon = MM - 1; \/\/ avr-libc time.h: months in [0, 11]\n tm.tm_mday = DD;\n tm.tm_hour = hh;\n tm.tm_min = mm;\n tm.tm_sec = ss;\n return mk_gmtime(&tm);\n}\n\nvoid printDigits(int digits) {\n Serial.print(':');\n if (digits < 10)\n Serial.print('0');\n Serial.print(digits);\n}\n\n\/*\n * Prints the time in time_t, using the standard Unix epoch format, even if the time_t type is from\n * time.h (avr-libc) and is in Y2K epoch format.\n *\n * Param:\n * - time_t time: time since Unix epoch\n *\/\nvoid digitalClockDisplay(time_t time) {\n struct tm tm;\n\n gmtime_r(&time, &tm);\n\n \/\/ Digital clock display of the time\n Serial.print(tm.tm_hour);\n printDigits(tm.tm_min);\n printDigits(tm.tm_sec);\n Serial.print(' ');\n Serial.print(tm.tm_mday);\n Serial.print('\/');\n Serial.print(tm.tm_mon + 1); \/\/ avr-libc time.h: months in [0, 11]\n Serial.print('\/');\n Serial.println(tm.tm_year + 1900 - 30); \/\/ avr-libc time.h: years since 1900 + y2k epoch difference (2000 - 1970)\n}\n\n\/\/ PCINT Interrupt Service Routine (unused)\nISR(PCINT0_vect) {\n \/\/ Don't do anything here but we must include this\n \/\/ block of code otherwise the interrupt calls an\n \/\/ uninitialized interrupt handler.\n}\n\nvoid setup() {\n byte retcode;\n time_t ts;\n\n OSCCAL = 0x86; \/\/ Calibrated OSSCAL value with TinyTuner\n\n Serial.begin(SERIAL_BAUD);\n bus.begin();\n\n \/\/ Pinmode set\n pinMode(LED_BLUE, OUTPUT);\n pinMode(LED_GR, OUTPUT);\n pinMode(LED_RED, OUTPUT);\n pinMode(BLU_STATE, INPUT);\n pinMode(BLU_RESET, OUTPUT);\n pinMode(RTC_INT_SQW, INPUT);\n\n Serial.print(F(\"Initial value of OSCCAL is 0x\"));\n Serial.println(OSCCAL, HEX);\n\n ts = tmConvert_t(2032, 10, 20, 23, 05, 00);\n\n if ((retcode = RTC.set(ts)) == 0)\n rtcInitOk = true;\n else {\n Serial.print(F(\"RTC Set error: \"));\n Serial.print(retcode);\n }\n\n Serial.print(F(\"TS: \"));\n Serial.println(ts);\n digitalClockDisplay(ts);\n\n Serial.print(F(\"RTC set to: \"));\n Serial.println(RTC.get());\n digitalClockDisplay(RTC.get());\n\n ADCSRA = 0; \/\/ Disable ADC to save power\n MCUCR |= _BV(BODS); \/\/ BOD disabled\n\n PCMSK0 |= _BV(PCINT0); \/\/ Pin change mask: listen to portA bit 0 (D10)\n PCMSK0 |= _BV(PCINT2); \/\/ Pin change mask: listen to portA bit 2 (D8)\n GIMSK |= _BV(PCIE0); \/\/ Enable PCINT interrupt on portA\n}\n\nvoid loop() {\n size_t count = 0;\n char buffer[LENGTH];\n\n \/\/ FIXME Wake from sleep with new CORE can't read first serial bytes....\n\n if (millis() - prevMillis >= SLEEP_TIMEOUT) {\n prevMillis = millis();\n Serial.println(F(\"Sleeping...\"));\n system_sleep();\n Serial.println(F(\"Waking up...\"));\n digitalClockDisplay(RTC.get());\n\n \/\/ Necessary to reset the alarm flag on RTC!\n if (RTC.alarm(ALARM_1)) {\n Serial.println(F(\"From alarm...\"));\n }\n }\n\n while (Serial.available() && count < LENGTH - 1) {\n delay(2);\n char c = (char) Serial.read();\n\n prevMillis = millis(); \/\/ Update prevMillis to reset sleep timeout\n\n if (c == '\\r' || c == '\\n') {\n if (c == '\\n') {\n data = true;\n Serial.flush();\n break;\n }\n continue;\n }\n\n buffer[count] = c;\n count++;\n }\n\n if (data) {\n buffer[count] = '\\0';\n \/\/Serial.print(\"COUNT = \");\n \/\/Serial.println(count);\n Serial.println(buffer);\n\n count = 0;\n data = false;\n\n if (strcmp(buffer, \"ON\") == 0) {\n digitalWrite(LED_BLUE, HIGH);\n\n RTC.setAlarm(ALM1_MATCH_MINUTES, 00, 10, 23, 0);\n RTC.alarmInterrupt(ALARM_1, true);\n\n\/\/ for(int fadeValue = 0 ; fadeValue <= 255; fadeValue +=5) {\n\/\/ analogWrite(LED_BLUE, fadeValue);\n\/\/ delay(100);\n\/\/ }\n\/\/ delay(1000);\n\/\/ digitalWrite(LED_BLUE, LOW);\n\/\/\n\/\/ for(int fadeValue = 0 ; fadeValue <= 255; fadeValue +=5) {\n\/\/ analogWrite(LED_RED, fadeValue);\n\/\/ delay(100);\n\/\/ }\n\/\/ delay(1000);\n\/\/ digitalWrite(LED_RED, LOW);\n\/\/\n\/\/ for(int fadeValue = 0 ; fadeValue <= 255; fadeValue +=5) {\n\/\/ analogWrite(LED_GR, fadeValue);\n\/\/ delay(100);\n\/\/ }\n\/\/ delay(1000);\n\/\/ digitalWrite(LED_GR, LOW);\n }\n\n if (strcmp(buffer, \"OFF\") == 0) {\n digitalWrite(LED_BLUE, LOW);\n digitalWrite(LED_RED, LOW);\n digitalWrite(LED_GR, LOW);\n }\n\n digitalClockDisplay(RTC.get());\n }\n}\n<commit_msg>Year..<commit_after>\/*\n * This file is part of SmartLamp application.\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, 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 * Built for Attiny84 8Mhz, using AVR USBasp programmer.\n * VERSION 0.2\n *\/\n\n#include <avr\/io.h>\n#include <avr\/sleep.h>\n#include <time.h>\n\n#include <Arduino.h>\n\n#include <USIWire.h>\n#include <DS3232RTC.h>\n\n\/\/ Input\/output defines\n#define LED_BLUE 5\n#define LED_GR 3\n#define LED_RED 2\n\n#define BLU_STATE 1\n#define BLU_RESET 0\n\n#define RTC_INT_SQW 10\n\n\/\/ Serial defines\n#define SERIAL_BAUD 9600 \/\/ For at mode and for data mode (CC41, HM-10 and MLT-BT05)\n\n\/\/ I2C defines\n#define SDA 4\n#define SCL 6\n\n#define SLEEP_TIMEOUT 5000L \/\/ Timeout before sleep\n#define LENGTH 80 \/\/ Command buffer length\n\n\n\/\/ Global variables\nUSIWire bus; \/\/ USIWire instance (I2C bus)\nDS3232RTC RTC(bus); \/\/ DS3232 RTC instance (I2C bus)\n\nboolean data = false;\nunsigned long prevMillis = 0; \/\/ Millis counter to sleep\nbool rtcInitOk = false; \/\/ Communication OK with RTC\n\n\/\/ Put the micro to sleep\nvoid system_sleep() {\n set_sleep_mode(SLEEP_MODE_PWR_DOWN);\n sleep_enable();\n sleep_mode();\n\n \/\/ sleeping ...\n sleep_disable(); \/\/ wake up fully\n}\n\n\/*\n * Converts the date\/time to standard Unix epoch format, using time.h library (avr-libc)\n *\n * Param:\n * - int16_t YYYY: year (Gregorian format: ex. 2017)\n * - int8_t MM: month\n * - int8_t DD: day of the month\n * - int8_t hh: hour\n * - int8_t mm: minute\n * - int8_t ss: second\n *\/\ntime_t tmConvert_t(int16_t YYYY, int8_t MM, int8_t DD, int8_t hh, int8_t mm, int8_t ss) {\n struct tm tm;\n tm.tm_year = YYYY - 1900 + 30; \/\/ avr-libc time.h: years since 1900 + y2k epoch difference (2000 - 1970)\n tm.tm_mon = MM - 1; \/\/ avr-libc time.h: months in [0, 11]\n tm.tm_mday = DD;\n tm.tm_hour = hh;\n tm.tm_min = mm;\n tm.tm_sec = ss;\n return mk_gmtime(&tm);\n}\n\nvoid printDigits(int digits) {\n Serial.print(':');\n if (digits < 10)\n Serial.print('0');\n Serial.print(digits);\n}\n\n\/*\n * Prints the time in time_t, using the standard Unix epoch format, even if the time_t type is from\n * time.h (avr-libc) and is in Y2K epoch format.\n *\n * Param:\n * - time_t time: time since Unix epoch\n *\/\nvoid digitalClockDisplay(time_t time) {\n struct tm tm;\n\n gmtime_r(&time, &tm);\n\n \/\/ Digital clock display of the time\n Serial.print(tm.tm_hour);\n printDigits(tm.tm_min);\n printDigits(tm.tm_sec);\n Serial.print(' ');\n Serial.print(tm.tm_mday);\n Serial.print('\/');\n Serial.print(tm.tm_mon + 1); \/\/ avr-libc time.h: months in [0, 11]\n Serial.print('\/');\n Serial.println(tm.tm_year + 1900 - 30); \/\/ avr-libc time.h: years since 1900 + y2k epoch difference (2000 - 1970)\n}\n\n\/\/ PCINT Interrupt Service Routine (unused)\nISR(PCINT0_vect) {\n \/\/ Don't do anything here but we must include this\n \/\/ block of code otherwise the interrupt calls an\n \/\/ uninitialized interrupt handler.\n}\n\nvoid setup() {\n byte retcode;\n time_t ts;\n\n OSCCAL = 0x86; \/\/ Calibrated OSSCAL value with TinyTuner\n\n Serial.begin(SERIAL_BAUD);\n bus.begin();\n\n \/\/ Pinmode set\n pinMode(LED_BLUE, OUTPUT);\n pinMode(LED_GR, OUTPUT);\n pinMode(LED_RED, OUTPUT);\n pinMode(BLU_STATE, INPUT);\n pinMode(BLU_RESET, OUTPUT);\n pinMode(RTC_INT_SQW, INPUT);\n\n Serial.print(F(\"Initial value of OSCCAL is 0x\"));\n Serial.println(OSCCAL, HEX);\n\n ts = tmConvert_t(2017, 10, 20, 23, 05, 00);\n\n if ((retcode = RTC.set(ts)) == 0)\n rtcInitOk = true;\n else {\n Serial.print(F(\"RTC Set error: \"));\n Serial.print(retcode);\n }\n\n Serial.print(F(\"TS: \"));\n Serial.println(ts);\n digitalClockDisplay(ts);\n\n Serial.print(F(\"RTC set to: \"));\n Serial.println(RTC.get());\n digitalClockDisplay(RTC.get());\n\n ADCSRA = 0; \/\/ Disable ADC to save power\n MCUCR |= _BV(BODS); \/\/ BOD disabled\n\n PCMSK0 |= _BV(PCINT0); \/\/ Pin change mask: listen to portA bit 0 (D10)\n PCMSK0 |= _BV(PCINT2); \/\/ Pin change mask: listen to portA bit 2 (D8)\n GIMSK |= _BV(PCIE0); \/\/ Enable PCINT interrupt on portA\n}\n\nvoid loop() {\n size_t count = 0;\n char buffer[LENGTH];\n\n \/\/ FIXME Wake from sleep with new CORE can't read first serial bytes....\n\n if (millis() - prevMillis >= SLEEP_TIMEOUT) {\n prevMillis = millis();\n Serial.println(F(\"Sleeping...\"));\n system_sleep();\n Serial.println(F(\"Waking up...\"));\n digitalClockDisplay(RTC.get());\n\n \/\/ Necessary to reset the alarm flag on RTC!\n if (RTC.alarm(ALARM_1)) {\n Serial.println(F(\"From alarm...\"));\n }\n }\n\n while (Serial.available() && count < LENGTH - 1) {\n delay(2);\n char c = (char) Serial.read();\n\n prevMillis = millis(); \/\/ Update prevMillis to reset sleep timeout\n\n if (c == '\\r' || c == '\\n') {\n if (c == '\\n') {\n data = true;\n Serial.flush();\n break;\n }\n continue;\n }\n\n buffer[count] = c;\n count++;\n }\n\n if (data) {\n buffer[count] = '\\0';\n \/\/Serial.print(\"COUNT = \");\n \/\/Serial.println(count);\n Serial.println(buffer);\n\n count = 0;\n data = false;\n\n if (strcmp(buffer, \"ON\") == 0) {\n digitalWrite(LED_BLUE, HIGH);\n\n RTC.setAlarm(ALM1_MATCH_MINUTES, 00, 10, 23, 0);\n RTC.alarmInterrupt(ALARM_1, true);\n\n\/\/ for(int fadeValue = 0 ; fadeValue <= 255; fadeValue +=5) {\n\/\/ analogWrite(LED_BLUE, fadeValue);\n\/\/ delay(100);\n\/\/ }\n\/\/ delay(1000);\n\/\/ digitalWrite(LED_BLUE, LOW);\n\/\/\n\/\/ for(int fadeValue = 0 ; fadeValue <= 255; fadeValue +=5) {\n\/\/ analogWrite(LED_RED, fadeValue);\n\/\/ delay(100);\n\/\/ }\n\/\/ delay(1000);\n\/\/ digitalWrite(LED_RED, LOW);\n\/\/\n\/\/ for(int fadeValue = 0 ; fadeValue <= 255; fadeValue +=5) {\n\/\/ analogWrite(LED_GR, fadeValue);\n\/\/ delay(100);\n\/\/ }\n\/\/ delay(1000);\n\/\/ digitalWrite(LED_GR, LOW);\n }\n\n if (strcmp(buffer, \"OFF\") == 0) {\n digitalWrite(LED_BLUE, LOW);\n digitalWrite(LED_RED, LOW);\n digitalWrite(LED_GR, LOW);\n }\n\n digitalClockDisplay(RTC.get());\n }\n}\n<|endoftext|>"} {"text":"<commit_before>\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\/ @file ai.cpp\n\/\/\/ @author Connor McBride\n\/\/\/ @brief Contains definition information for the AI class.\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n#include \"ai.h\"\n\n\/\/ @public_functions\n\/\/ @constructors\nAI::AI(int player_id) {\n m_player_id = player_id;\n\n return;\n}\n\n\/\/ @game_runners\nvoid AI::init() {\n\n return;\n}\n\nbool AI::run() {\n \/\/ Spawn something\n if (!Occupied(1, 1)) {\n spawn(1, 1);\n }\n\n \/\/ Cycle through units\n for (Unit &u : units) {\n \/\/ If they're ours\n if (u.player_id() == PlayerID()) {\n \/\/ Move them to the right one\n if (!Occupied(u.x() + 1, u.y())) {\n move(u, u.x() + 1, u.y());\n }\n }\n }\n return true;\n}\n\nvoid AI::end() {\n for (Unit &u : units) {\n if (PlayerID() == u.player_id())\n std::cout << u.DebugString() << std::endl;\n }\n return;\n}\n\n\/\/ @game_state_getters\nint AI::PlayerID() {\n return m_player_id;\n}\n\nint AI::TurnNumber() {\n return BaseAI::m_turn_number;\n}\n\n\/\/ @game_state_booleans\nbool AI::InMapBounds(int x, int y) {\n return (x >= 0 && x < kMapWidth && y >= 0 && y < kMapHeight);\n}\n\nbool AI::Occupied(int x, int y) {\n if (m_unit_coordinate_index_map.find(Coordinate(x, y)) != m_unit_coordinate_index_map.end()) {\n return true;\n }\n\n return false;\n}\n\n\/\/ @game_unique\nvoid AI::spawn(int x, int y, int type) {\n if (InMapBounds(x, y)) {\n if (!Occupied(x, y)) {\n Unit u = Unit(x, y, type, AI::m_player_id);\n units.push_back(u);\n m_unit_id_index_map[u.id()] = units.size() - 1;\n m_unit_coordinate_index_map[u.coordinate()] = units.size() - 1;\n } else {\n std::cout << \"--Spawn denied at X: \" << x << \", Y: \" << y << \" (Occupied)\" << std::endl;\n }\n } else {\n std::cout << \"-- Spawn denied at X: \" << x << \", Y: \" << y << \" (Out of Map)\" << std::endl;\n }\n return;\n}\n\n\nbool AI::move(Unit &u, int x, int y) {\n if (!Occupied(x, y)) {\n Coordinate temp_coordinate = u.coordinate();\n int index = m_unit_coordinate_index_map[temp_coordinate];\n m_unit_coordinate_index_map.erase(temp_coordinate);\n u.move(x, y);\n m_unit_coordinate_index_map[u.coordinate()] = index;\n return true;\n }\n std::cout << \"Move denied X: \" << x << \", Y: \" << y << \" (Occupied).\" << std::endl;\n return false;\n}\n\n\/\/ @static_game_unique\nvoid AI::PrintGameMap() {\n for (int j = 0; j < board.width(); j++) {\n std::cout << \"==\";\n }\n std::cout << std::endl;\n for (int y = board.height() - 1; y >= 0; y--) {\n for (int x = 0; x < board.width(); x++) {\n if (!Occupied(x, y)) {\n std::cout << ' ' << board.GetTileAt(x, y)->get_char();\n } else {\n std::cout << ' ' << 'x';\n }\n }\n std::cout << std::endl;\n }\n for (int j = 0; j < board.width(); j++) {\n std::cout << \"==\";\n }\n std::cout << std::endl;\n}<commit_msg>Added formatting thing.<commit_after>\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\/ @file ai.cpp\n\/\/\/ @author Connor McBride\n\/\/\/ @brief Contains definition information for the AI class.\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n#include \"ai.h\"\n\n\/\/ @public_functions\n\/\/ @constructors\nAI::AI(int player_id) {\n m_player_id = player_id;\n\n return;\n}\n\n\/\/ @game_runners\nvoid AI::init() {\n\n return;\n}\n\nbool AI::run() {\n \/\/ Spawn something\n if (!Occupied(1, 1)) {\n spawn(1, 1);\n }\n\n \/\/ Cycle through units\n for (Unit &u : units) {\n \/\/ If they're ours\n if (u.player_id() == PlayerID()) {\n \/\/ Move them to the right one\n if (!Occupied(u.x() + 1, u.y())) {\n move(u, u.x() + 1, u.y());\n }\n }\n }\n return true;\n}\n\nvoid AI::end() {\n for (Unit &u : units) {\n if (PlayerID() == u.player_id())\n std::cout << u.DebugString() << std::endl;\n }\n return;\n}\n\n\/\/ @game_state_getters\nint AI::PlayerID() {\n return m_player_id;\n}\n\nint AI::TurnNumber() {\n return BaseAI::m_turn_number;\n}\n\n\/\/ @game_state_booleans\nbool AI::InMapBounds(int x, int y) {\n return (x >= 0 && x < kMapWidth && y >= 0 && y < kMapHeight);\n}\n\nbool AI::Occupied(int x, int y) {\n if (m_unit_coordinate_index_map.find(Coordinate(x, y)) != m_unit_coordinate_index_map.end()) {\n return true;\n }\n\n return false;\n}\n\n\/\/ @game_unique\nvoid AI::spawn(int x, int y, int type) {\n if (InMapBounds(x, y)) {\n if (!Occupied(x, y)) {\n Unit u = Unit(x, y, type, AI::m_player_id);\n units.push_back(u);\n m_unit_id_index_map[u.id()] = units.size() - 1;\n m_unit_coordinate_index_map[u.coordinate()] = units.size() - 1;\n } else {\n std::cout << \"--Spawn denied at X: \" << x << \", Y: \" << y << \" (Occupied)\" << std::endl;\n }\n } else {\n std::cout << \"-- Spawn denied at X: \" << x << \", Y: \" << y << \" (Out of Map)\" << std::endl;\n }\n return;\n}\n\n\nbool AI::move(Unit &u, int x, int y) {\n if (!Occupied(x, y)) {\n Coordinate temp_coordinate = u.coordinate();\n int index = m_unit_coordinate_index_map[temp_coordinate];\n m_unit_coordinate_index_map.erase(temp_coordinate);\n u.move(x, y);\n m_unit_coordinate_index_map[u.coordinate()] = index;\n return true;\n }\n std::cout << \"--Move denied X: \" << x << \", Y: \" << y << \" (Occupied).\" << std::endl;\n return false;\n}\n\n\/\/ @static_game_unique\nvoid AI::PrintGameMap() {\n for (int j = 0; j < board.width(); j++) {\n std::cout << \"==\";\n }\n std::cout << std::endl;\n for (int y = board.height() - 1; y >= 0; y--) {\n for (int x = 0; x < board.width(); x++) {\n if (!Occupied(x, y)) {\n std::cout << ' ' << board.GetTileAt(x, y)->get_char();\n } else {\n std::cout << ' ' << 'x';\n }\n }\n std::cout << std::endl;\n }\n for (int j = 0; j < board.width(); j++) {\n std::cout << \"==\";\n }\n std::cout << std::endl;\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#include <deque>\n\n#include \"dll_test.hpp\"\n\n#include \"dll\/neural\/conv_layer.hpp\"\n#include \"dll\/neural\/dense_layer.hpp\"\n#include \"dll\/dbn.hpp\"\n#include \"dll\/pooling\/mp_layer.hpp\"\n#include \"dll\/pooling\/avgp_layer.hpp\"\n\n#include \"mnist\/mnist_reader.hpp\"\n#include \"mnist\/mnist_utils.hpp\"\n\nTEST_CASE(\"unit\/conv\/sgd\/6\", \"[unit][conv][dbn][mnist][sgd]\") {\n typedef dll::dbn_desc<\n dll::dbn_layers<\n dll::conv_layer_desc<1, 28, 28, 6, 5, 5, dll::activation<dll::function::RELU>, dll::initializer<dll::initializer_type::HE>>::layer_t,\n dll::conv_layer_desc<6, 24, 24, 6, 5, 5, dll::activation<dll::function::RELU>, dll::initializer<dll::initializer_type::HE>>::layer_t,\n dll::dense_layer_desc<6 * 20 * 20, 200, dll::activation<dll::function::RELU>, dll::initializer<dll::initializer_type::HE>>::layer_t,\n dll::dense_layer_desc<200, 10, dll::activation<dll::function::SOFTMAX>>::layer_t>,\n dll::updater<dll::updater_type::MOMENTUM>, dll::trainer<dll::sgd_trainer>, dll::batch_size<20>>::dbn_t dbn_t;\n\n auto dataset = mnist::read_dataset_direct<std::vector, etl::fast_dyn_matrix<float, 1, 28, 28>>(600);\n REQUIRE(!dataset.training_images.empty());\n\n dll_test::mnist_scale(dataset);\n\n auto dbn = std::make_unique<dbn_t>();\n\n dbn->learning_rate = 0.001;\n dbn->initial_momentum = 0.9;\n dbn->final_momentum = 0.9;\n\n FT_CHECK(50, 6e-2);\n TEST_CHECK(0.25);\n}\n\nTEST_CASE(\"unit\/conv\/sgd\/7\", \"[unit][conv][dbn][mnist][sgd]\") {\n typedef dll::dbn_desc<\n dll::dbn_layers<\n dll::conv_layer_desc<1, 28, 28, 6, 5, 5, dll::activation<dll::function::RELU>>::layer_t,\n dll::mp_2d_layer_desc<6, 24, 24, 2, 2>::layer_t,\n dll::conv_layer_desc<6, 12, 12, 5, 5, 5, dll::activation<dll::function::RELU>>::layer_t,\n dll::dense_layer_desc<5 * 8 * 8, 100, dll::activation<dll::function::RELU>>::layer_t,\n dll::dense_layer_desc<100, 10, dll::activation<dll::function::SOFTMAX>>::layer_t>,\n dll::updater<dll::updater_type::MOMENTUM>, dll::trainer<dll::sgd_trainer>, dll::batch_size<20>>::dbn_t dbn_t;\n\n auto dataset = mnist::read_dataset_direct<std::vector, etl::fast_dyn_matrix<float, 1, 28, 28>>(600);\n REQUIRE(!dataset.training_images.empty());\n\n dll_test::mnist_scale(dataset);\n\n auto dbn = std::make_unique<dbn_t>();\n\n dbn->learning_rate = 0.005;\n\n FT_CHECK(50, 6e-2);\n TEST_CHECK(0.25);\n}\n\nTEST_CASE(\"unit\/conv\/sgd\/8\", \"[unit][conv][dbn][mnist][sgd]\") {\n typedef dll::dbn_desc<\n dll::dbn_layers<\n dll::conv_layer_desc<1, 28, 28, 6, 5, 5, dll::activation<dll::function::RELU>>::layer_t,\n dll::avgp_3d_layer_desc<6, 24, 24, 1, 2, 2>::layer_t,\n dll::conv_layer_desc<6, 12, 12, 6, 5, 5, dll::activation<dll::function::RELU>>::layer_t,\n dll::dense_layer_desc<6 * 8 * 8, 100, dll::activation<dll::function::RELU>>::layer_t,\n dll::dense_layer_desc<100, 10, dll::activation<dll::function::SOFTMAX>>::layer_t>,\n dll::trainer<dll::sgd_trainer>, dll::updater<dll::updater_type::ADAM>, dll::batch_size<20>>::dbn_t dbn_t;\n\n auto dataset = mnist::read_dataset_direct<std::vector, etl::fast_dyn_matrix<float, 1, 28, 28>>(1000);\n REQUIRE(!dataset.training_images.empty());\n\n dll_test::mnist_scale(dataset);\n\n auto dbn = std::make_unique<dbn_t>();\n\n dbn->display();\n\n dbn->learning_rate = 0.001;\n\n FT_CHECK(25, 6e-2);\n TEST_CHECK(0.25);\n}\n<commit_msg>Cleanup test<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#include <deque>\n\n#include \"dll_test.hpp\"\n\n#include \"dll\/neural\/conv_layer.hpp\"\n#include \"dll\/neural\/dense_layer.hpp\"\n#include \"dll\/dbn.hpp\"\n#include \"dll\/pooling\/mp_layer.hpp\"\n#include \"dll\/pooling\/avgp_layer.hpp\"\n\n#include \"mnist\/mnist_reader.hpp\"\n#include \"mnist\/mnist_utils.hpp\"\n\nTEST_CASE(\"unit\/conv\/sgd\/6\", \"[unit][conv][dbn][mnist][sgd]\") {\n typedef dll::dbn_desc<\n dll::dbn_layers<\n dll::conv_layer_desc<1, 28, 28, 6, 5, 5, dll::activation<dll::function::RELU>, dll::initializer<dll::initializer_type::HE>>::layer_t,\n dll::conv_layer_desc<6, 24, 24, 6, 5, 5, dll::activation<dll::function::RELU>, dll::initializer<dll::initializer_type::HE>>::layer_t,\n dll::dense_layer_desc<6 * 20 * 20, 200, dll::activation<dll::function::RELU>, dll::initializer<dll::initializer_type::HE>>::layer_t,\n dll::dense_layer_desc<200, 10, dll::activation<dll::function::SOFTMAX>>::layer_t>,\n dll::updater<dll::updater_type::MOMENTUM>, dll::trainer<dll::sgd_trainer>, dll::batch_size<20>>::dbn_t dbn_t;\n\n auto dataset = mnist::read_dataset_direct<std::vector, etl::fast_dyn_matrix<float, 1, 28, 28>>(600);\n REQUIRE(!dataset.training_images.empty());\n\n dll_test::mnist_scale(dataset);\n\n auto dbn = std::make_unique<dbn_t>();\n\n dbn->learning_rate = 0.001;\n dbn->initial_momentum = 0.9;\n dbn->final_momentum = 0.9;\n\n FT_CHECK(50, 6e-2);\n TEST_CHECK(0.25);\n}\n\nTEST_CASE(\"unit\/conv\/sgd\/7\", \"[unit][conv][dbn][mnist][sgd]\") {\n typedef dll::dbn_desc<\n dll::dbn_layers<\n dll::conv_layer_desc<1, 28, 28, 6, 5, 5, dll::activation<dll::function::RELU>>::layer_t,\n dll::mp_2d_layer_desc<6, 24, 24, 2, 2>::layer_t,\n dll::conv_layer_desc<6, 12, 12, 5, 5, 5, dll::activation<dll::function::RELU>>::layer_t,\n dll::dense_layer_desc<5 * 8 * 8, 100, dll::activation<dll::function::RELU>>::layer_t,\n dll::dense_layer_desc<100, 10, dll::activation<dll::function::SOFTMAX>>::layer_t>,\n dll::updater<dll::updater_type::MOMENTUM>, dll::trainer<dll::sgd_trainer>, dll::batch_size<20>>::dbn_t dbn_t;\n\n auto dataset = mnist::read_dataset_direct<std::vector, etl::fast_dyn_matrix<float, 1, 28, 28>>(600);\n REQUIRE(!dataset.training_images.empty());\n\n dll_test::mnist_scale(dataset);\n\n auto dbn = std::make_unique<dbn_t>();\n\n dbn->learning_rate = 0.005;\n\n FT_CHECK(50, 6e-2);\n TEST_CHECK(0.25);\n}\n\nTEST_CASE(\"unit\/conv\/sgd\/8\", \"[unit][conv][dbn][mnist][sgd]\") {\n typedef dll::dbn_desc<\n dll::dbn_layers<\n dll::conv_layer<1, 28, 28, 6, 5, 5, dll::relu>,\n dll::avgp_3d_layer<6, 24, 24, 1, 2, 2>,\n dll::conv_layer<6, 12, 12, 6, 5, 5, dll::relu>,\n dll::dense_layer<6 * 8 * 8, 100, dll::relu>,\n dll::dense_layer<100, 10, dll::softmax>\n >,\n dll::updater<dll::updater_type::ADAM>,\n dll::batch_size<20>\n >::dbn_t dbn_t;\n\n auto dataset = mnist::read_dataset_direct<std::vector, etl::fast_dyn_matrix<float, 1, 28, 28>>(1000);\n REQUIRE(!dataset.training_images.empty());\n\n dll_test::mnist_scale(dataset);\n\n auto dbn = std::make_unique<dbn_t>();\n\n dbn->display();\n\n dbn->learning_rate = 0.001;\n\n FT_CHECK(25, 6e-2);\n TEST_CHECK(0.25);\n}\n<|endoftext|>"} {"text":"<commit_before>\/\/\n\/\/ Copyright (c) 2017-2020 the rbfx project.\n\/\/\n\/\/ Permission is hereby granted, free of charge, to any person obtaining a copy\n\/\/ of this software and associated documentation files (the \"Software\"), to deal\n\/\/ in the Software without restriction, including without limitation the rights\n\/\/ to use, copy, modify, merge, publish, distribute, sublicense, and\/or sell\n\/\/ copies of the Software, and to permit persons to whom the Software is\n\/\/ furnished to do so, subject to the following conditions:\n\/\/\n\/\/ The above copyright notice and this permission notice shall be included in\n\/\/ all copies or substantial portions of the Software.\n\/\/\n\/\/ THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\n\/\/ IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\n\/\/ FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE\n\/\/ AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\n\/\/ LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,\n\/\/ OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN\n\/\/ THE SOFTWARE.\n\/\/\n#include <Urho3D\/Graphics\/Viewport.h>\n#include <Urho3D\/Graphics\/RenderPath.h>\n#include <Urho3D\/Graphics\/Light.h>\n#include <Urho3D\/Graphics\/Camera.h>\n#include <Urho3D\/Graphics\/Model.h>\n#include <Urho3D\/Input\/Input.h>\n#include <Urho3D\/Resource\/ResourceCache.h>\n#include <Urho3D\/SystemUI\/SystemUI.h>\n#include <Urho3D\/Graphics\/StaticModel.h>\n#include \"Tabs\/Scene\/SceneTab.h\"\n#include \"PreviewInspector.h\"\n#include \"Editor.h\"\n\n\nnamespace Urho3D\n{\n\nPreviewInspector::PreviewInspector(Context* context)\n : InspectorProvider(context)\n , view_(context, {0, 0, 200, 200})\n{\n \/\/ Workaround: for some reason this overriden method of our class does not get called by SceneView constructor.\n CreateObjects();\n\n if (SceneTab* sceneTab = GetSubsystem<Editor>()->GetTab<SceneTab>())\n SetEffectSource(sceneTab->GetViewport()->GetRenderPath());\n}\n\nvoid PreviewInspector::SetModel(Model* model)\n{\n auto staticModel = node_->GetOrCreateComponent<StaticModel>();\n\n staticModel->SetModel(model);\n auto bb = model->GetBoundingBox();\n auto scale = 1.f \/ Max(bb.Size().x_, Max(bb.Size().y_, bb.Size().z_)) * 0.8f;\n node_->SetScale(scale);\n node_->SetWorldPosition(node_->GetWorldPosition() - staticModel->GetWorldBoundingBox().Center());\n}\n\nvoid PreviewInspector::SetModel(const ea::string& resourceName)\n{\n SetModel(context_->GetCache()->GetResource<Model>(resourceName));\n}\n\nvoid PreviewInspector::CreateObjects()\n{\n view_.CreateObjects();\n node_ = view_.GetScene()->CreateChild(\"Preview\");\n view_.GetCamera()->GetNode()->CreateComponent<Light>();\n view_.GetCamera()->GetNode()->SetPosition(Vector3::BACK * distance_);\n view_.GetCamera()->GetNode()->LookAt(Vector3::ZERO);\n}\n\nvoid PreviewInspector::RenderPreview()\n{\n auto* input = GetSubsystem<Input>();\n auto size = static_cast<int>(ui::GetWindowWidth() - ui::GetCursorPosX());\n view_.SetSize({0, 0, size, size});\n ui::ImageItem(view_.GetTexture(), ImVec2(size, size));\n bool wasActive = mouseGrabbed_;\n mouseGrabbed_ = ui::ItemMouseActivation(MOUSEB_RIGHT) && ui::IsMouseDragging(MOUSEB_RIGHT);\n if (wasActive != mouseGrabbed_)\n input->SetMouseVisible(!mouseGrabbed_);\n\n if (mouseGrabbed_)\n {\n ui::SetMouseCursor(ImGuiMouseCursor_None);\n Node* node = view_.GetCamera()->GetNode();\n if (input->GetKeyPress(KEY_ESCAPE))\n {\n node->SetPosition(Vector3::BACK * distance_);\n node->LookAt(Vector3::ZERO);\n }\n else\n {\n Vector2 delta(input->GetMouseMove());\n Quaternion rotateDelta = Quaternion(delta.x_ * 0.1f, node->GetUp()) *\n Quaternion(delta.y_ * 0.1f, node->GetRight());\n node->RotateAround(Vector3::ZERO, rotateDelta, TS_WORLD);\n }\n }\n}\n\nvoid PreviewInspector::SetEffectSource(RenderPath* renderPath)\n{\n if (renderPath == nullptr)\n return;\n\n view_.GetViewport()->SetRenderPath(renderPath);\n auto* light = view_.GetCamera()->GetComponent<Light>();\n for (auto& command: renderPath->commands_)\n {\n if (command.pixelShaderName_.starts_with(\"PBR\"))\n {\n \/\/ Lights in PBR scenes need modifications, otherwise obects in material preview look very dark\n light->SetUsePhysicalValues(true);\n light->SetBrightness(5000);\n light->SetShadowCascade(CascadeParameters(10, 20, 30, 40, 10));\n return;\n }\n }\n\n light->SetUsePhysicalValues(false);\n light->SetBrightness(DEFAULT_BRIGHTNESS);\n light->SetShadowCascade(CascadeParameters(DEFAULT_SHADOWSPLIT, 0.0f, 0.0f, 0.0f, DEFAULT_SHADOWFADESTART));\n}\n\n}\n<commit_msg>Editor: Fix artefacts in model and material previews.<commit_after>\/\/\n\/\/ Copyright (c) 2017-2020 the rbfx project.\n\/\/\n\/\/ Permission is hereby granted, free of charge, to any person obtaining a copy\n\/\/ of this software and associated documentation files (the \"Software\"), to deal\n\/\/ in the Software without restriction, including without limitation the rights\n\/\/ to use, copy, modify, merge, publish, distribute, sublicense, and\/or sell\n\/\/ copies of the Software, and to permit persons to whom the Software is\n\/\/ furnished to do so, subject to the following conditions:\n\/\/\n\/\/ The above copyright notice and this permission notice shall be included in\n\/\/ all copies or substantial portions of the Software.\n\/\/\n\/\/ THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\n\/\/ IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\n\/\/ FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE\n\/\/ AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\n\/\/ LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,\n\/\/ OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN\n\/\/ THE SOFTWARE.\n\/\/\n#include <Urho3D\/Graphics\/Viewport.h>\n#include <Urho3D\/Graphics\/RenderPath.h>\n#include <Urho3D\/Graphics\/Light.h>\n#include <Urho3D\/Graphics\/Camera.h>\n#include <Urho3D\/Graphics\/Model.h>\n#include <Urho3D\/Input\/Input.h>\n#include <Urho3D\/Resource\/ResourceCache.h>\n#include <Urho3D\/SystemUI\/SystemUI.h>\n#include <Urho3D\/Graphics\/StaticModel.h>\n#include \"Tabs\/Scene\/SceneTab.h\"\n#include \"PreviewInspector.h\"\n#include \"Editor.h\"\n\n\nnamespace Urho3D\n{\n\nPreviewInspector::PreviewInspector(Context* context)\n : InspectorProvider(context)\n , view_(context, {0, 0, 200, 200})\n{\n \/\/ Workaround: for some reason this overriden method of our class does not get called by SceneView constructor.\n CreateObjects();\n\n if (SceneTab* sceneTab = GetSubsystem<Editor>()->GetTab<SceneTab>())\n SetEffectSource(sceneTab->GetViewport()->GetRenderPath());\n}\n\nvoid PreviewInspector::SetModel(Model* model)\n{\n auto staticModel = node_->GetOrCreateComponent<StaticModel>();\n\n staticModel->SetModel(model);\n auto bb = model->GetBoundingBox();\n auto scale = 1.f \/ Max(bb.Size().x_, Max(bb.Size().y_, bb.Size().z_)) * 0.8f;\n node_->SetScale(scale);\n node_->SetWorldPosition(node_->GetWorldPosition() - staticModel->GetWorldBoundingBox().Center());\n}\n\nvoid PreviewInspector::SetModel(const ea::string& resourceName)\n{\n SetModel(context_->GetCache()->GetResource<Model>(resourceName));\n}\n\nvoid PreviewInspector::CreateObjects()\n{\n view_.CreateObjects();\n node_ = view_.GetScene()->CreateChild(\"Preview\");\n Node* node = view_.GetCamera()->GetNode();\n node->CreateComponent<Light>();\n node->SetPosition(Vector3::BACK * distance_);\n node->LookAt(Vector3::ZERO);\n}\n\nvoid PreviewInspector::RenderPreview()\n{\n auto* input = GetSubsystem<Input>();\n float dpi = ui::GetCurrentWindow()->Viewport->DpiScale;\n float size = ui::GetWindowWidth() - ui::GetCursorPosX();\n view_.SetSize({0, 0, static_cast<int>(size * dpi), static_cast<int>(size * dpi)});\n ui::ImageItem(view_.GetTexture(), ImVec2(size, size));\n bool wasActive = mouseGrabbed_;\n mouseGrabbed_ = ui::ItemMouseActivation(MOUSEB_RIGHT) && ui::IsMouseDragging(MOUSEB_RIGHT);\n if (wasActive != mouseGrabbed_)\n input->SetMouseVisible(!mouseGrabbed_);\n\n if (mouseGrabbed_)\n {\n ui::SetMouseCursor(ImGuiMouseCursor_None);\n Node* node = view_.GetCamera()->GetNode();\n if (input->GetKeyPress(KEY_ESCAPE))\n {\n node->SetPosition(Vector3::BACK * distance_);\n node->LookAt(Vector3::ZERO);\n }\n else\n {\n Vector2 delta(input->GetMouseMove());\n Quaternion rotateDelta = Quaternion(delta.x_ * 0.1f, node->GetUp()) *\n Quaternion(delta.y_ * 0.1f, node->GetRight());\n node->RotateAround(Vector3::ZERO, rotateDelta, TS_WORLD);\n }\n }\n}\n\nvoid PreviewInspector::SetEffectSource(RenderPath* renderPath)\n{\n if (renderPath == nullptr)\n return;\n\n view_.GetViewport()->SetRenderPath(renderPath);\n auto* light = view_.GetCamera()->GetComponent<Light>();\n for (auto& command: renderPath->commands_)\n {\n if (command.pixelShaderName_.starts_with(\"PBR\"))\n {\n \/\/ Lights in PBR scenes need modifications, otherwise obects in material preview look very dark\n light->SetUsePhysicalValues(true);\n light->SetBrightness(5000);\n light->SetShadowCascade(CascadeParameters(10, 20, 30, 40, 10));\n return;\n }\n }\n\n light->SetUsePhysicalValues(false);\n light->SetBrightness(DEFAULT_BRIGHTNESS);\n light->SetShadowCascade(CascadeParameters(DEFAULT_SHADOWSPLIT, 0.0f, 0.0f, 0.0f, DEFAULT_SHADOWFADESTART));\n}\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 is distributed under the University of Illinois Open Source\n\/\/ 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#define DEBUG_TYPE \"profile-loader\"\n#include \"llvm\/BasicBlock.h\"\n#include \"llvm\/InstrTypes.h\"\n#include \"llvm\/Module.h\"\n#include \"llvm\/Pass.h\"\n#include \"llvm\/Analysis\/Passes.h\"\n#include \"llvm\/Analysis\/ProfileInfo.h\"\n#include \"llvm\/Analysis\/ProfileInfoLoader.h\"\n#include \"llvm\/Support\/CommandLine.h\"\n#include \"llvm\/Support\/Compiler.h\"\n#include \"llvm\/Support\/CFG.h\"\n#include \"llvm\/Support\/Debug.h\"\n#include \"llvm\/Support\/raw_ostream.h\"\n#include \"llvm\/Support\/Format.h\"\n#include \"llvm\/ADT\/Statistic.h\"\n#include \"llvm\/ADT\/SmallSet.h\"\n#include <set>\nusing namespace llvm;\n\nSTATISTIC(NumEdgesRead, \"The # of edges read.\");\n\nstatic cl::opt<std::string>\nProfileInfoFilename(\"profile-info-file\", cl::init(\"llvmprof.out\"),\n cl::value_desc(\"filename\"),\n cl::desc(\"Profile file loaded by -profile-loader\"));\n\nnamespace {\n class VISIBILITY_HIDDEN LoaderPass : public ModulePass, public ProfileInfo {\n std::string Filename;\n std::set<Edge> SpanningTree;\n std::set<const BasicBlock*> BBisUnvisited;\n public:\n static char ID; \/\/ Class identification, replacement for typeinfo\n explicit LoaderPass(const std::string &filename = \"\")\n : ModulePass(&ID), 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 \/\/ recurseBasicBlock() - Calculates the edge weights for as much basic\n \/\/ blocks as possbile.\n virtual void recurseBasicBlock(const BasicBlock *BB);\n virtual void readEdgeOrRemember(Edge, Edge&, unsigned &, unsigned &);\n virtual void readOrRememberEdge(ProfileInfo::Edge, unsigned,\n unsigned, Function*);\n\n \/\/\/ run - Load the profile information from the specified file.\n virtual bool runOnModule(Module &M);\n };\n} \/\/ End of anonymous namespace\n\nchar LoaderPass::ID = 0;\nstatic RegisterPass<LoaderPass>\nX(\"profile-loader\", \"Load profile information from llvmprof.out\", false, true);\n\nstatic RegisterAnalysisGroup<ProfileInfo> Y(X);\n\nModulePass *llvm::createProfileLoaderPass() { return new LoaderPass(); }\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\nvoid LoaderPass::readEdgeOrRemember(Edge edge, Edge &tocalc, \n unsigned &uncalc, unsigned &count) {\n double w;\n if ((w = getEdgeWeight(edge)) == MissingValue) {\n tocalc = edge;\n uncalc++;\n } else {\n count+=w;\n }\n}\n\n\/\/ recurseBasicBlock - Visits all neighbours of a block and then tries to\n\/\/ calculate the missing edge values.\nvoid LoaderPass::recurseBasicBlock(const BasicBlock *BB) {\n\n \/\/ break recursion if already visited\n if (BBisUnvisited.find(BB) == BBisUnvisited.end()) return;\n BBisUnvisited.erase(BB);\n if (!BB) return;\n\n for (succ_const_iterator bbi = succ_begin(BB), bbe = succ_end(BB);\n bbi != bbe; ++bbi) {\n recurseBasicBlock(*bbi);\n }\n for (pred_const_iterator bbi = pred_begin(BB), bbe = pred_end(BB);\n bbi != bbe; ++bbi) {\n recurseBasicBlock(*bbi);\n }\n\n Edge edgetocalc;\n unsigned uncalculated = 0;\n\n \/\/ collect weights of all incoming and outgoing edges, rememer edges that\n \/\/ have no value\n unsigned incount = 0;\n SmallSet<const BasicBlock*,8> pred_visited;\n pred_const_iterator bbi = pred_begin(BB), bbe = pred_end(BB);\n if (bbi==bbe) {\n readEdgeOrRemember(getEdge(0, BB),edgetocalc,uncalculated,incount);\n }\n for (;bbi != bbe; ++bbi) {\n if (pred_visited.insert(*bbi)) {\n readEdgeOrRemember(getEdge(*bbi, BB),edgetocalc,uncalculated,incount);\n }\n }\n\n unsigned outcount = 0;\n SmallSet<const BasicBlock*,8> succ_visited;\n succ_const_iterator sbbi = succ_begin(BB), sbbe = succ_end(BB);\n if (sbbi==sbbe) {\n readEdgeOrRemember(getEdge(BB, 0),edgetocalc,uncalculated,outcount);\n }\n for (;sbbi != sbbe; ++sbbi) {\n if (succ_visited.insert(*sbbi)) {\n readEdgeOrRemember(getEdge(BB, *sbbi),edgetocalc,uncalculated,outcount);\n }\n }\n\n \/\/ if exactly one edge weight was missing, calculate it and remove it from\n \/\/ spanning tree\n if (uncalculated == 1) {\n if (incount < outcount) {\n EdgeInformation[BB->getParent()][edgetocalc] = outcount-incount;\n } else {\n EdgeInformation[BB->getParent()][edgetocalc] = incount-outcount;\n }\n DEBUG(errs() << \"--Calc Edge Counter for \" << edgetocalc << \": \"\n << format(\"%g\", getEdgeWeight(edgetocalc)) << \"\\n\");\n SpanningTree.erase(edgetocalc);\n }\n}\n\nvoid LoaderPass::readOrRememberEdge(ProfileInfo::Edge e,\n unsigned weight, unsigned ei,\n Function *F) {\n if (weight != ~0U) {\n EdgeInformation[F][e] += weight;\n DEBUG(errs()<<\"--Read Edge Counter for \" << e \n <<\" (# \"<<ei<<\"): \"<<(unsigned)getEdgeWeight(e)<<\"\\n\");\n } else {\n SpanningTree.insert(e);\n }\n}\n\nbool LoaderPass::runOnModule(Module &M) {\n ProfileInfoLoader PIL(\"profile-loader\", Filename, M);\n\n EdgeInformation.clear();\n std::vector<unsigned> ECs = PIL.getRawEdgeCounts();\n if (ECs.size() > 0) {\n unsigned ei = 0;\n for (Module::iterator F = M.begin(), E = M.end(); F != E; ++F) {\n if (F->isDeclaration()) continue;\n if (ei < ECs.size())\n EdgeInformation[F][ProfileInfo::getEdge(0, &F->getEntryBlock())] +=\n ECs[ei++];\n for (Function::iterator BB = F->begin(), E = F->end(); BB != E; ++BB) {\n \/\/ Okay, we have to add a counter of each outgoing edge. If the\n \/\/ outgoing edge is not critical don't split it, just insert the counter\n \/\/ in the source or destination of the edge.\n TerminatorInst *TI = BB->getTerminator();\n for (unsigned s = 0, e = TI->getNumSuccessors(); s != e; ++s) {\n if (ei < ECs.size())\n EdgeInformation[F][ProfileInfo::getEdge(BB, TI->getSuccessor(s))] +=\n ECs[ei++];\n }\n }\n }\n if (ei != ECs.size()) {\n errs() << \"WARNING: profile information is inconsistent with \"\n << \"the current program!\\n\";\n }\n NumEdgesRead = ei;\n }\n\n ECs = PIL.getRawOptimalEdgeCounts();\n if (ECs.size() > 0) {\n unsigned ei = 0;\n for (Module::iterator F = M.begin(), E = M.end(); F != E; ++F) {\n if (F->isDeclaration()) continue;\n DEBUG(errs()<<\"Working on \"<<F->getNameStr()<<\"\\n\");\n if (ei < ECs.size()) {\n readOrRememberEdge(getEdge(0,&F->getEntryBlock()), ECs[ei], ei, F); \n ei++;\n }\n for (Function::iterator BB = F->begin(), E = F->end(); BB != E; ++BB) {\n TerminatorInst *TI = BB->getTerminator();\n if (TI->getNumSuccessors() == 0) {\n if (ei < ECs.size()) {\n readOrRememberEdge(getEdge(BB,0), ECs[ei], ei, F); ei++;\n }\n }\n for (unsigned s = 0, e = TI->getNumSuccessors(); s != e; ++s) {\n if (ei < ECs.size()) {\n readOrRememberEdge(getEdge(BB,TI->getSuccessor(s)), ECs[ei], ei, F);\n ei++;\n }\n }\n }\n while (SpanningTree.size() > 0) {\n#if 0\n unsigned size = SpanningTree.size();\n#endif\n BBisUnvisited.clear();\n for (std::set<Edge>::iterator ei = SpanningTree.begin(),\n ee = SpanningTree.end(); ei != ee; ++ei) {\n BBisUnvisited.insert(ei->first);\n BBisUnvisited.insert(ei->second);\n }\n while (BBisUnvisited.size() > 0) {\n recurseBasicBlock(*BBisUnvisited.begin());\n }\n#if 0\n if (SpanningTree.size() == size) {\n DEBUG(errs()<<\"{\");\n for (std::set<Edge>::iterator ei = SpanningTree.begin(),\n ee = SpanningTree.end(); ei != ee; ++ei) {\n DEBUG(errs()<<\"(\"<<(ei->first?ei->first->getName():\"0\")<<\",\"\n <<(ei->second?ei->second->getName():\"0\")<<\"),\");\n }\n assert(0 && \"No edge calculated!\");\n }\n#endif\n }\n }\n if (ei != ECs.size()) {\n errs() << \"WARNING: profile information is inconsistent with \"\n << \"the current program!\\n\";\n }\n NumEdgesRead = ei;\n }\n\n BlockInformation.clear();\n std::vector<unsigned> BCs = PIL.getRawBlockCounts();\n if (BCs.size() > 0) {\n unsigned bi = 0;\n for (Module::iterator F = M.begin(), E = M.end(); F != E; ++F) {\n if (F->isDeclaration()) continue;\n for (Function::iterator BB = F->begin(), E = F->end(); BB != E; ++BB)\n if (bi < BCs.size())\n BlockInformation[F][BB] = BCs[bi++];\n }\n if (bi != BCs.size()) {\n errs() << \"WARNING: profile information is inconsistent with \"\n << \"the current program!\\n\";\n }\n }\n\n FunctionInformation.clear();\n std::vector<unsigned> FCs = PIL.getRawFunctionCounts();\n if (FCs.size() > 0) {\n unsigned fi = 0;\n for (Module::iterator F = M.begin(), E = M.end(); F != E; ++F) {\n if (F->isDeclaration()) continue;\n if (fi < FCs.size())\n FunctionInformation[F] = FCs[fi++];\n }\n if (fi != FCs.size()) {\n errs() << \"WARNING: profile information is inconsistent with \"\n << \"the current program!\\n\";\n }\n }\n\n return false;\n}\n<commit_msg>Cleaned up code by factoring out common portions of edge loading into function.<commit_after>\/\/===- ProfileInfoLoaderPass.cpp - LLVM Pass to load profile info ---------===\/\/\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 a concrete implementation of profiling information that\n\/\/ loads the information from a profile dump file.\n\/\/\n\/\/===----------------------------------------------------------------------===\/\/\n#define DEBUG_TYPE \"profile-loader\"\n#include \"llvm\/BasicBlock.h\"\n#include \"llvm\/InstrTypes.h\"\n#include \"llvm\/Module.h\"\n#include \"llvm\/Pass.h\"\n#include \"llvm\/Analysis\/Passes.h\"\n#include \"llvm\/Analysis\/ProfileInfo.h\"\n#include \"llvm\/Analysis\/ProfileInfoLoader.h\"\n#include \"llvm\/Support\/CommandLine.h\"\n#include \"llvm\/Support\/Compiler.h\"\n#include \"llvm\/Support\/CFG.h\"\n#include \"llvm\/Support\/Debug.h\"\n#include \"llvm\/Support\/raw_ostream.h\"\n#include \"llvm\/Support\/Format.h\"\n#include \"llvm\/ADT\/Statistic.h\"\n#include \"llvm\/ADT\/SmallSet.h\"\n#include <set>\nusing namespace llvm;\n\nSTATISTIC(NumEdgesRead, \"The # of edges read.\");\n\nstatic cl::opt<std::string>\nProfileInfoFilename(\"profile-info-file\", cl::init(\"llvmprof.out\"),\n cl::value_desc(\"filename\"),\n cl::desc(\"Profile file loaded by -profile-loader\"));\n\nnamespace {\n class VISIBILITY_HIDDEN LoaderPass : public ModulePass, public ProfileInfo {\n std::string Filename;\n std::set<Edge> SpanningTree;\n std::set<const BasicBlock*> BBisUnvisited;\n unsigned ReadCount;\n public:\n static char ID; \/\/ Class identification, replacement for typeinfo\n explicit LoaderPass(const std::string &filename = \"\")\n : ModulePass(&ID), 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 \/\/ recurseBasicBlock() - Calculates the edge weights for as much basic\n \/\/ blocks as possbile.\n virtual void recurseBasicBlock(const BasicBlock *BB);\n virtual void readEdgeOrRemember(Edge, Edge&, unsigned &, unsigned &);\n virtual void readEdge(ProfileInfo::Edge, std::vector<unsigned>&);\n\n \/\/\/ run - Load the profile information from the specified file.\n virtual bool runOnModule(Module &M);\n };\n} \/\/ End of anonymous namespace\n\nchar LoaderPass::ID = 0;\nstatic RegisterPass<LoaderPass>\nX(\"profile-loader\", \"Load profile information from llvmprof.out\", false, true);\n\nstatic RegisterAnalysisGroup<ProfileInfo> Y(X);\n\nModulePass *llvm::createProfileLoaderPass() { return new LoaderPass(); }\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\nvoid LoaderPass::readEdgeOrRemember(Edge edge, Edge &tocalc, \n unsigned &uncalc, unsigned &count) {\n double w;\n if ((w = getEdgeWeight(edge)) == MissingValue) {\n tocalc = edge;\n uncalc++;\n } else {\n count+=w;\n }\n}\n\n\/\/ recurseBasicBlock - Visits all neighbours of a block and then tries to\n\/\/ calculate the missing edge values.\nvoid LoaderPass::recurseBasicBlock(const BasicBlock *BB) {\n\n \/\/ break recursion if already visited\n if (BBisUnvisited.find(BB) == BBisUnvisited.end()) return;\n BBisUnvisited.erase(BB);\n if (!BB) return;\n\n for (succ_const_iterator bbi = succ_begin(BB), bbe = succ_end(BB);\n bbi != bbe; ++bbi) {\n recurseBasicBlock(*bbi);\n }\n for (pred_const_iterator bbi = pred_begin(BB), bbe = pred_end(BB);\n bbi != bbe; ++bbi) {\n recurseBasicBlock(*bbi);\n }\n\n Edge edgetocalc;\n unsigned uncalculated = 0;\n\n \/\/ collect weights of all incoming and outgoing edges, rememer edges that\n \/\/ have no value\n unsigned incount = 0;\n SmallSet<const BasicBlock*,8> pred_visited;\n pred_const_iterator bbi = pred_begin(BB), bbe = pred_end(BB);\n if (bbi==bbe) {\n readEdgeOrRemember(getEdge(0, BB),edgetocalc,uncalculated,incount);\n }\n for (;bbi != bbe; ++bbi) {\n if (pred_visited.insert(*bbi)) {\n readEdgeOrRemember(getEdge(*bbi, BB),edgetocalc,uncalculated,incount);\n }\n }\n\n unsigned outcount = 0;\n SmallSet<const BasicBlock*,8> succ_visited;\n succ_const_iterator sbbi = succ_begin(BB), sbbe = succ_end(BB);\n if (sbbi==sbbe) {\n readEdgeOrRemember(getEdge(BB, 0),edgetocalc,uncalculated,outcount);\n }\n for (;sbbi != sbbe; ++sbbi) {\n if (succ_visited.insert(*sbbi)) {\n readEdgeOrRemember(getEdge(BB, *sbbi),edgetocalc,uncalculated,outcount);\n }\n }\n\n \/\/ if exactly one edge weight was missing, calculate it and remove it from\n \/\/ spanning tree\n if (uncalculated == 1) {\n if (incount < outcount) {\n EdgeInformation[BB->getParent()][edgetocalc] = outcount-incount;\n } else {\n EdgeInformation[BB->getParent()][edgetocalc] = incount-outcount;\n }\n DEBUG(errs() << \"--Calc Edge Counter for \" << edgetocalc << \": \"\n << format(\"%g\", getEdgeWeight(edgetocalc)) << \"\\n\");\n SpanningTree.erase(edgetocalc);\n }\n}\n\nvoid LoaderPass::readEdge(ProfileInfo::Edge e,\n std::vector<unsigned> &ECs) {\n if (ReadCount < ECs.size()) {\n double weight = ECs[ReadCount++];\n if (weight != ~0U) {\n EdgeInformation[getFunction(e)][e] += weight;\n DEBUG(errs() << \"--Read Edge Counter for \" << e\n << \" (# \"<< (ReadCount-1) << \"): \"\n << (unsigned)getEdgeWeight(e) << \"\\n\");\n } else {\n \/\/ This happens only if reading optimal profiling information, not when\n \/\/ reading regular profiling information.\n SpanningTree.insert(e);\n }\n }\n}\n\nbool LoaderPass::runOnModule(Module &M) {\n ProfileInfoLoader PIL(\"profile-loader\", Filename, M);\n\n EdgeInformation.clear();\n std::vector<unsigned> Counters = PIL.getRawEdgeCounts();\n if (Counters.size() > 0) {\n ReadCount = 0;\n for (Module::iterator F = M.begin(), E = M.end(); F != E; ++F) {\n if (F->isDeclaration()) continue;\n DEBUG(errs()<<\"Working on \"<<F->getNameStr()<<\"\\n\");\n readEdge(getEdge(0,&F->getEntryBlock()), Counters);\n for (Function::iterator BB = F->begin(), E = F->end(); BB != E; ++BB) {\n \/\/ Okay, we have to add a counter of each outgoing edge. If the\n \/\/ outgoing edge is not critical don't split it, just insert the counter\n \/\/ in the source or destination of the edge.\n TerminatorInst *TI = BB->getTerminator();\n for (unsigned s = 0, e = TI->getNumSuccessors(); s != e; ++s) {\n readEdge(getEdge(BB,TI->getSuccessor(s)), Counters);\n }\n }\n }\n if (ReadCount != Counters.size()) {\n errs() << \"WARNING: profile information is inconsistent with \"\n << \"the current program!\\n\";\n }\n NumEdgesRead = ReadCount;\n }\n\n Counters = PIL.getRawOptimalEdgeCounts();\n if (Counters.size() > 0) {\n ReadCount = 0;\n for (Module::iterator F = M.begin(), E = M.end(); F != E; ++F) {\n if (F->isDeclaration()) continue;\n DEBUG(errs()<<\"Working on \"<<F->getNameStr()<<\"\\n\");\n readEdge(getEdge(0,&F->getEntryBlock()), Counters);\n for (Function::iterator BB = F->begin(), E = F->end(); BB != E; ++BB) {\n TerminatorInst *TI = BB->getTerminator();\n if (TI->getNumSuccessors() == 0) {\n readEdge(getEdge(BB,0), Counters);\n }\n for (unsigned s = 0, e = TI->getNumSuccessors(); s != e; ++s) {\n readEdge(getEdge(BB,TI->getSuccessor(s)), Counters);\n }\n }\n while (SpanningTree.size() > 0) {\n#if 0\n unsigned size = SpanningTree.size();\n#endif\n BBisUnvisited.clear();\n for (std::set<Edge>::iterator ei = SpanningTree.begin(),\n ee = SpanningTree.end(); ei != ee; ++ei) {\n BBisUnvisited.insert(ei->first);\n BBisUnvisited.insert(ei->second);\n }\n while (BBisUnvisited.size() > 0) {\n recurseBasicBlock(*BBisUnvisited.begin());\n }\n#if 0\n if (SpanningTree.size() == size) {\n DEBUG(errs()<<\"{\");\n for (std::set<Edge>::iterator ei = SpanningTree.begin(),\n ee = SpanningTree.end(); ei != ee; ++ei) {\n DEBUG(errs()<<\"(\"<<(ei->first?ei->first->getName():\"0\")<<\",\"\n <<(ei->second?ei->second->getName():\"0\")<<\"),\");\n }\n assert(0 && \"No edge calculated!\");\n }\n#endif\n }\n }\n if (ReadCount != Counters.size()) {\n errs() << \"WARNING: profile information is inconsistent with \"\n << \"the current program!\\n\";\n }\n NumEdgesRead = ReadCount;\n }\n\n BlockInformation.clear();\n Counters = PIL.getRawBlockCounts();\n if (Counters.size() > 0) {\n ReadCount = 0;\n for (Module::iterator F = M.begin(), E = M.end(); F != E; ++F) {\n if (F->isDeclaration()) continue;\n for (Function::iterator BB = F->begin(), E = F->end(); BB != E; ++BB)\n if (ReadCount < Counters.size())\n BlockInformation[F][BB] = Counters[ReadCount++];\n }\n if (ReadCount != Counters.size()) {\n errs() << \"WARNING: profile information is inconsistent with \"\n << \"the current program!\\n\";\n }\n }\n\n FunctionInformation.clear();\n Counters = PIL.getRawFunctionCounts();\n if (Counters.size() > 0) {\n ReadCount = 0;\n for (Module::iterator F = M.begin(), E = M.end(); F != E; ++F) {\n if (F->isDeclaration()) continue;\n if (ReadCount < Counters.size())\n FunctionInformation[F] = Counters[ReadCount++];\n }\n if (ReadCount != Counters.size()) {\n errs() << \"WARNING: profile information is inconsistent with \"\n << \"the current program!\\n\";\n }\n }\n\n return false;\n}\n<|endoftext|>"} {"text":"<commit_before><commit_msg>[mdns] remove stale, empty multicast_dns source file (#122)<commit_after><|endoftext|>"} {"text":"<commit_before>\/\/ This file is a part of the OpenSurgSim project.\n\/\/ Copyright 2013-2016, SimQuest Solutions Inc.\n\/\/\n\/\/ Licensed under the Apache License, Version 2.0 (the \"License\");\n\/\/ you may not use this file except in compliance with the License.\n\/\/ You may obtain a copy of the License at\n\/\/\n\/\/ http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n\/\/\n\/\/ Unless required by applicable law or agreed to in writing, software\n\/\/ distributed under the License is distributed on an \"AS IS\" BASIS,\n\/\/ WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n\/\/ See the License for the specific language governing permissions and\n\/\/ limitations under the License.\n\n\n#include <gmock\/gmock.h>\n\n#include \"SurgSim\/Collision\/CollisionPair.h\"\n#include \"SurgSim\/Collision\/ContactFilter.h\"\n#include \"SurgSim\/Framework\/Runtime.h\"\n#include \"SurgSim\/Physics\/ContactFiltering.h\"\n#include \"SurgSim\/Physics\/PhysicsManagerState.h\"\n#include \"SurgSim\/Physics\/RigidCollisionRepresentation.h\"\n\nusing ::testing::_;\n\nnamespace SurgSim\n{\n\nclass MockContactFilter : public Collision::ContactFilter\n{\npublic:\n\tMockContactFilter(const std::string& name) : Collision::ContactFilter(name) {}\n\tMOCK_METHOD0(doWakeUp, bool());\n\tMOCK_METHOD0(doInitialize, bool());\n\tMOCK_METHOD2(doFilterContacts, void(const std::shared_ptr<Physics::PhysicsManagerState>& state,\n\t\t\t\t\t\t\t\t\t\tconst std::shared_ptr<Collision::CollisionPair>& pair));\n\n\n};\n\nvoid removeOne(const std::shared_ptr<Physics::PhysicsManagerState>& state,\n\t\t\t const std::shared_ptr<Collision::CollisionPair>& pair)\n{\n\tpair->getContacts().pop_back();\n}\n\nnamespace Physics\n{\n\n\nstruct ContactFilteringTest : public ::testing::Test\n{\n\tvirtual void SetUp()\n\t{\n\t\t\/\/ Setup Framework\n\t\truntime = std::make_shared<Framework::Runtime>();\n\t\tstate = std::make_shared<PhysicsManagerState>();\n\t\tcontactFiltering = std::make_shared<ContactFiltering>(false);\n\n\t\tstd::vector<std::shared_ptr<Collision::ContactFilter>> filters;\n\t\tfilter = std::make_shared<MockContactFilter>(\"Filter\");\n\t\tfilters.push_back(filter);\n\t\tstate->setContactFilters(filters);\n\n\t\tcollision0 = std::make_shared<Physics::RigidCollisionRepresentation>(\"Collision0\");\n\n\n\t\tpairWithContacts = std::make_shared<Collision::CollisionPair>(collision0, collision0);\n\t\tauto contact = std::make_shared<Collision::Contact>(Collision::COLLISION_DETECTION_TYPE_NONE,\n\t\t\t\t\t 0.0, 0.0, Math::Vector3d::Zero(), Math::Vector3d::Zero(),\n\t\t\t\t\t std::make_pair(DataStructures::Location(), DataStructures::Location()));\n\t\tpairWithContacts->addContact(contact);\n\t\tpairWithContacts->addContact(contact);\n\t\tpairWithoutContacts = std::make_shared<Collision::CollisionPair>(collision0, collision0);\n\n\t}\n\n\tstd::shared_ptr<PhysicsManagerState> state;\n\tstd::shared_ptr<ContactFiltering> contactFiltering;\n\tstd::shared_ptr<Framework::Runtime> runtime;\n\tstd::shared_ptr<MockContactFilter> filter;\n\n\tstd::shared_ptr<Physics::RigidCollisionRepresentation> collision0;\n\n\tstd::shared_ptr<Collision::CollisionPair> pairWithContacts;\n\tstd::shared_ptr<Collision::CollisionPair> pairWithoutContacts;\n\n\tstd::vector<std::shared_ptr<Collision::CollisionPair>> pairs;\n\n};\n\nTEST_F(ContactFilteringTest, DontProcessWithoutPairs)\n{\n\tEXPECT_CALL(*filter, doFilterContacts(_, _)).Times(0);\n\tcontactFiltering->update(1.0, state);\n}\n\n\nTEST_F(ContactFilteringTest, ProcessAllPairsWithContacts)\n{\n\tpairs.push_back(pairWithContacts);\n\tpairs.push_back(pairWithContacts);\n\tpairs.push_back(pairWithoutContacts);\n\tstate->setCollisionPairs(pairs);\n\n\tEXPECT_CALL(*filter, doFilterContacts(_, _)).Times(2);\n\tcontactFiltering->update(1.0, state);\n}\n\n\nTEST_F(ContactFilteringTest, ModifyContacts)\n{\n\tpairs.push_back(pairWithContacts);\n\n\tstate->setCollisionPairs(pairs);\n\n\tEXPECT_CALL(*filter, doFilterContacts(_, _)).WillOnce(testing::Invoke(removeOne));\n\tcontactFiltering->update(1.0, state);\n\tEXPECT_EQ(1u, pairWithContacts->getContacts().size());\n}\n\nTEST_F(ContactFilteringTest, ProcessAllFilters)\n{\n\t\/\/ Gmock is might not be threadsafe on windows, need separate instances\n\tstd::vector<std::shared_ptr<Collision::ContactFilter>> filters;\n\tauto filter1 = std::make_shared<MockContactFilter>(\"Filter1\");\n\tfilters.push_back(filter1);\n\tauto filter2 = std::make_shared<MockContactFilter>(\"Filter2\");\n\tfilters.push_back(filter2);\n\tstate->setContactFilters(filters);\n\n\n\tpairs.push_back(pairWithContacts);\n\tpairs.push_back(pairWithContacts);\n\tpairs.push_back(pairWithContacts);\n\tstate->setCollisionPairs(pairs);\n\n\tEXPECT_CALL(*filter1, doFilterContacts(_, _)).Times(3);\n\tEXPECT_CALL(*filter2, doFilterContacts(_, _)).Times(3);\n\tcontactFiltering->update(1.0, state);\n}\n\n}\n\n}<commit_msg>Remove threading issue in test<commit_after>\/\/ This file is a part of the OpenSurgSim project.\n\/\/ Copyright 2013-2016, SimQuest Solutions Inc.\n\/\/\n\/\/ Licensed under the Apache License, Version 2.0 (the \"License\");\n\/\/ you may not use this file except in compliance with the License.\n\/\/ You may obtain a copy of the License at\n\/\/\n\/\/ http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n\/\/\n\/\/ Unless required by applicable law or agreed to in writing, software\n\/\/ distributed under the License is distributed on an \"AS IS\" BASIS,\n\/\/ WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n\/\/ See the License for the specific language governing permissions and\n\/\/ limitations under the License.\n\n\n#include <gmock\/gmock.h>\n\n#include \"SurgSim\/Collision\/CollisionPair.h\"\n#include \"SurgSim\/Collision\/ContactFilter.h\"\n#include \"SurgSim\/Framework\/Runtime.h\"\n#include \"SurgSim\/Physics\/ContactFiltering.h\"\n#include \"SurgSim\/Physics\/PhysicsManagerState.h\"\n#include \"SurgSim\/Physics\/RigidCollisionRepresentation.h\"\n\nusing ::testing::_;\n\nnamespace SurgSim\n{\n\nclass MockContactFilter : public Collision::ContactFilter\n{\npublic:\n\tMockContactFilter(const std::string& name) : Collision::ContactFilter(name) {}\n\tMOCK_METHOD0(doWakeUp, bool());\n\tMOCK_METHOD0(doInitialize, bool());\n\tMOCK_METHOD2(doFilterContacts, void(const std::shared_ptr<Physics::PhysicsManagerState>& state,\n\t\t\t\t\t\t\t\t\t\tconst std::shared_ptr<Collision::CollisionPair>& pair));\n\n\n};\n\nvoid removeOne(const std::shared_ptr<Physics::PhysicsManagerState>& state,\n\t\t\t const std::shared_ptr<Collision::CollisionPair>& pair)\n{\n\tpair->getContacts().pop_back();\n}\n\nnamespace Physics\n{\n\n\nstruct ContactFilteringTest : public ::testing::Test\n{\n\tvirtual void SetUp()\n\t{\n\t\t\/\/ Setup Framework\n\t\truntime = std::make_shared<Framework::Runtime>();\n\t\tstate = std::make_shared<PhysicsManagerState>();\n\t\tcontactFiltering = std::make_shared<ContactFiltering>(false);\n\n\t\tstd::vector<std::shared_ptr<Collision::ContactFilter>> filters;\n\t\tfilter = std::make_shared<MockContactFilter>(\"Filter\");\n\t\tfilters.push_back(filter);\n\t\tstate->setContactFilters(filters);\n\n\t\tcollision0 = std::make_shared<Physics::RigidCollisionRepresentation>(\"Collision0\");\n\n\n\t\tpairWithContacts = std::make_shared<Collision::CollisionPair>(collision0, collision0);\n\t\tauto contact = std::make_shared<Collision::Contact>(Collision::COLLISION_DETECTION_TYPE_NONE,\n\t\t\t\t\t 0.0, 0.0, Math::Vector3d::Zero(), Math::Vector3d::Zero(),\n\t\t\t\t\t std::make_pair(DataStructures::Location(), DataStructures::Location()));\n\t\tpairWithContacts->addContact(contact);\n\t\tpairWithContacts->addContact(contact);\n\t\tpairWithoutContacts = std::make_shared<Collision::CollisionPair>(collision0, collision0);\n\n\t}\n\n\tstd::shared_ptr<PhysicsManagerState> state;\n\tstd::shared_ptr<ContactFiltering> contactFiltering;\n\tstd::shared_ptr<Framework::Runtime> runtime;\n\tstd::shared_ptr<MockContactFilter> filter;\n\n\tstd::shared_ptr<Physics::RigidCollisionRepresentation> collision0;\n\n\tstd::shared_ptr<Collision::CollisionPair> pairWithContacts;\n\tstd::shared_ptr<Collision::CollisionPair> pairWithoutContacts;\n\n\tstd::vector<std::shared_ptr<Collision::CollisionPair>> pairs;\n\n};\n\nTEST_F(ContactFilteringTest, DontProcessWithoutPairs)\n{\n\tEXPECT_CALL(*filter, doFilterContacts(_, _)).Times(0);\n\tcontactFiltering->update(1.0, state);\n}\n\n\nTEST_F(ContactFilteringTest, ProcessAllPairsWithContacts)\n{\n\tpairs.push_back(pairWithContacts);\n\tpairs.push_back(pairWithContacts);\n\tpairs.push_back(pairWithoutContacts);\n\tstate->setCollisionPairs(pairs);\n\n\tEXPECT_CALL(*filter, doFilterContacts(_, _)).Times(2);\n\tcontactFiltering->update(1.0, state);\n}\n\n\nTEST_F(ContactFilteringTest, ModifyContacts)\n{\n\tpairs.push_back(pairWithContacts);\n\n\tstate->setCollisionPairs(pairs);\n\n\tEXPECT_CALL(*filter, doFilterContacts(_, _)).WillOnce(testing::Invoke(removeOne));\n\tcontactFiltering->update(1.0, state);\n\tEXPECT_EQ(1u, pairWithContacts->getContacts().size());\n}\n\nTEST_F(ContactFilteringTest, ProcessAllFilters)\n{\n\t\/\/ Gmock is might not be threadsafe on windows, need separate instances\n\tstd::vector<std::shared_ptr<Collision::ContactFilter>> filters;\n\tauto filter1 = std::make_shared<MockContactFilter>(\"Filter1\");\n\tfilters.push_back(filter1);\n\tauto filter2 = std::make_shared<MockContactFilter>(\"Filter2\");\n\tfilters.push_back(filter2);\n\tstate->setContactFilters(filters);\n\n\tpairs.push_back(pairWithContacts);\n\tstate->setCollisionPairs(pairs);\n\n\tEXPECT_CALL(*filter1, doFilterContacts(_, _)).Times(1);\n\tEXPECT_CALL(*filter2, doFilterContacts(_, _)).Times(1);\n\tcontactFiltering->update(1.0, state);\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 \"cloud_print\/service\/win\/cloud_print_service.h\"\n\n#include <iomanip>\n#include <iostream>\n\n#include \"base\/at_exit.h\"\n#include \"base\/command_line.h\"\n#include \"base\/file_path.h\"\n#include \"base\/file_util.h\"\n#include \"base\/path_service.h\"\n#include \"base\/string_util.h\"\n#include \"base\/win\/scoped_handle.h\"\n#include \"cloud_print\/service\/win\/chrome_launcher.h\"\n#include \"cloud_print\/service\/win\/resource.h\"\n#include \"cloud_print\/service\/win\/service_state.h\"\n#include \"cloud_print\/service\/win\/service_switches.h\"\n\nnamespace {\n\nconst wchar_t kServiceStateFileName[] = L\"Service State\";\n\n\/\/ The traits class for Windows Service.\nclass ServiceHandleTraits {\n public:\n typedef SC_HANDLE Handle;\n\n \/\/ Closes the handle.\n static bool CloseHandle(Handle handle) {\n return ::CloseServiceHandle(handle) != FALSE;\n }\n\n static bool IsHandleValid(Handle handle) {\n return handle != NULL;\n }\n\n static Handle NullHandle() {\n return NULL;\n }\n\n private:\n DISALLOW_IMPLICIT_CONSTRUCTORS(ServiceHandleTraits);\n};\n\ntypedef base::win::GenericScopedHandle<\n ServiceHandleTraits, base::win::DummyVerifierTraits> ServiceHandle;\n\nHRESULT HResultFromLastError() {\n HRESULT hr = HRESULT_FROM_WIN32(GetLastError());\n \/\/ Something already failed if function called.\n if (SUCCEEDED(hr))\n hr = E_FAIL;\n return hr;\n}\n\nvoid InvalidUsage() {\n FilePath service_path;\n CHECK(PathService::Get(base::FILE_EXE, &service_path));\n\n std::cout << \"Usage: \";\n std::cout << service_path.BaseName().value();\n std::cout << \" [\";\n std::cout << \"[\";\n std::cout << \"[\";\n std::cout << \" -\" << kInstallSwitch;\n std::cout << \" -\" << kUserDataDirSwitch << \"=DIRECTORY\";\n std::cout << \" [ -\" << kQuietSwitch << \" ]\";\n std::cout << \"]\";\n std::cout << \"]\";\n std::cout << \" | -\" << kUninstallSwitch;\n std::cout << \" | -\" << kStartSwitch;\n std::cout << \" | -\" << kStopSwitch;\n std::cout << \" ]\\n\";\n std::cout << \"Manages cloud print windows service.\\n\\n\";\n\n static const struct {\n const char* name;\n const char* description;\n } kSwitchHelp[] = {\n { kInstallSwitch, \"Installs cloud print as service.\" },\n { kUserDataDirSwitch, \"User data directory with \\\"Service State\\\" file.\" },\n { kQuietSwitch, \"Fails without questions if something wrong.\" },\n { kUninstallSwitch, \"Uninstalls service.\" },\n { kStartSwitch, \"Starts service. May be combined with installation.\" },\n { kStopSwitch, \"Stops service.\" },\n };\n\n for (size_t i = 0; i < arraysize(kSwitchHelp); ++i) {\n std::cout << std::setiosflags(std::ios::left);\n std::cout << \" -\" << std::setw(15) << kSwitchHelp[i].name;\n std::cout << kSwitchHelp[i].description << \"\\n\";\n }\n std::cout << \"\\n\";\n}\n\nstd::string GetOption(const std::string& name, const std::string& default,\n bool secure) {\n std::cout << \"Input \\'\" << name << \"\\'\";\n if (!default.empty()) {\n std::cout << \", press [ENTER] to keep '\";\n std::cout << default;\n std::cout << \"'\";\n }\n std::cout << \":\";\n std::string tmp;\n\n if (secure) {\n DWORD saved_mode = 0;\n \/\/ Don't close.\n HANDLE stdin_handle = ::GetStdHandle(STD_INPUT_HANDLE);\n ::GetConsoleMode(stdin_handle, &saved_mode);\n ::SetConsoleMode(stdin_handle, saved_mode & ~ENABLE_ECHO_INPUT);\n std::getline(std::cin, tmp);\n ::SetConsoleMode(stdin_handle, saved_mode);\n std::cout << \"\\n\";\n } else {\n std::getline(std::cin, tmp);\n }\n if (tmp.empty())\n return default;\n return tmp;\n}\n\n} \/\/ namespace\n\nclass CloudPrintServiceModule\n : public ATL::CAtlServiceModuleT<CloudPrintServiceModule, IDS_SERVICENAME> {\n public:\n typedef ATL::CAtlServiceModuleT<CloudPrintServiceModule,\n IDS_SERVICENAME> Base;\n\n DECLARE_REGISTRY_APPID_RESOURCEID(IDR_CLOUDPRINTSERVICE,\n \"{8013FB7C-2E3E-4992-B8BD-05C0C4AB0627}\")\n\n HRESULT InitializeSecurity() {\n \/\/ TODO(gene): Check if we need to call CoInitializeSecurity and provide\n \/\/ the appropriate security settings for service.\n return S_OK;\n }\n\n HRESULT InstallService(const FilePath& user_data_dir) {\n \/\/ TODO(vitalybuka): consider \"lite\" version if we don't want unregister\n \/\/ printers here.\n HRESULT hr = UninstallService();\n if (FAILED(hr))\n return hr;\n\n if (ChromeLauncher::GetChromePath(HKEY_LOCAL_MACHINE).empty()) {\n LOG(ERROR) << \"Found no Chrome installed for all users.\";\n return HRESULT_FROM_WIN32(ERROR_FILE_NOT_FOUND);\n }\n\n hr = UpdateRegistryAppId(true);\n if (FAILED(hr))\n return hr;\n\n FilePath service_path;\n CHECK(PathService::Get(base::FILE_EXE, &service_path));\n CommandLine command_line(service_path);\n command_line.AppendSwitch(kServiceSwitch);\n command_line.AppendSwitchPath(kUserDataDirSwitch, user_data_dir);\n\n ServiceHandle scm;\n hr = OpenServiceManager(&scm);\n if (FAILED(hr))\n return hr;\n\n ServiceHandle service(\n ::CreateService(\n scm, m_szServiceName, m_szServiceName, SERVICE_ALL_ACCESS,\n SERVICE_WIN32_OWN_PROCESS, SERVICE_AUTO_START, SERVICE_ERROR_NORMAL,\n command_line.GetCommandLineString().c_str(), NULL, NULL, NULL,\n L\"NT AUTHORITY\\\\LocalService\", NULL));\n\n if (!service.IsValid())\n return HResultFromLastError();\n\n return S_OK;\n }\n\n HRESULT UninstallService() {\n if (!Uninstall())\n return E_FAIL;\n return UpdateRegistryAppId(false);\n }\n\n bool ParseCommandLine(LPCTSTR lpCmdLine, HRESULT* pnRetCode) {\n CHECK(pnRetCode);\n CommandLine command_line(CommandLine::NO_PROGRAM);\n command_line.ParseFromString(lpCmdLine);\n bool is_service = false;\n *pnRetCode = ParseCommandLine(command_line, &is_service);\n if (FAILED(*pnRetCode)) {\n LOG(ERROR) << \"Operation failed. 0x\" << std::setw(8) <<\n std::setbase(16) << *pnRetCode;\n }\n return is_service;\n }\n\n HRESULT PreMessageLoop(int nShowCmd) {\n HRESULT hr = Base::PreMessageLoop(nShowCmd);\n if (FAILED(hr))\n return hr;\n\n hr = StartConnector();\n if (FAILED(hr))\n return hr;\n\n LogEvent(_T(\"Service started\/resumed\"));\n SetServiceStatus(SERVICE_RUNNING);\n\n return hr;\n }\n\n HRESULT PostMessageLoop() {\n StopConnector();\n return Base::PostMessageLoop();\n }\n\n private:\n HRESULT ParseCommandLine(const CommandLine& command_line, bool* is_service) {\n if (!is_service)\n return E_INVALIDARG;\n *is_service = false;\n\n user_data_dir_ = command_line.GetSwitchValuePath(kUserDataDirSwitch);\n if (command_line.HasSwitch(kStopSwitch))\n return StopService();\n\n if (command_line.HasSwitch(kUninstallSwitch))\n return UninstallService();\n\n if (command_line.HasSwitch(kInstallSwitch)) {\n if (!command_line.HasSwitch(kUserDataDirSwitch)) {\n InvalidUsage();\n return S_FALSE;\n }\n\n HRESULT hr = ProcessServiceState(user_data_dir_,\n command_line.HasSwitch(kQuietSwitch));\n if (FAILED(hr))\n return hr;\n\n hr = InstallService(user_data_dir_);\n if (SUCCEEDED(hr) && command_line.HasSwitch(kStartSwitch))\n return StartService();\n\n return hr;\n }\n\n if (command_line.HasSwitch(kStartSwitch))\n return StartService();\n\n if (command_line.HasSwitch(kServiceSwitch)) {\n *is_service = true;\n return S_OK;\n }\n\n if (command_line.HasSwitch(kConsoleSwitch)) {\n ::SetConsoleCtrlHandler(&ConsoleCtrlHandler, TRUE);\n HRESULT hr = Run();\n ::SetConsoleCtrlHandler(NULL, FALSE);\n return hr;\n }\n\n InvalidUsage();\n return S_FALSE;\n }\n\n HRESULT ProcessServiceState(const FilePath& user_data_dir, bool quiet) {\n FilePath file = user_data_dir.Append(kServiceStateFileName);\n\n for (;;) {\n std::string contents;\n ServiceState service_state;\n\n bool is_valid = file_util::ReadFileToString(file, &contents) &&\n service_state.FromString(contents);\n\n if (!quiet) {\n std::cout << file.value() << \":\\n\";\n std::cout << contents << \"\\n\";\n }\n\n if (!is_valid)\n LOG(ERROR) << \"Invalid file: \" << file.value();\n\n if (quiet)\n return is_valid ? S_OK : HRESULT_FROM_WIN32(ERROR_FILE_INVALID);\n\n if (!contents.empty()) {\n std::cout << \"Do you want to use this file [y\/n]:\";\n for (;;) {\n std::string input;\n std::getline(std::cin, input);\n StringToLowerASCII(&input);\n if (input == \"y\") {\n return S_OK;\n } else if (input == \"n\") {\n is_valid = false;\n break;\n }\n }\n }\n\n while (!is_valid) {\n std::string email = GetOption(\"email\", service_state.email(), false);\n std::string password = GetOption(\"password\", \"\", true);\n std::string proxy_id = GetOption(\"connector_id\",\n service_state.proxy_id(), false);\n is_valid = service_state.Configure(email, password, proxy_id);\n if (is_valid) {\n std::string new_contents = service_state.ToString();\n if (new_contents != contents) {\n if (file_util::WriteFile(file, new_contents.c_str(),\n new_contents.size()) <= 0) {\n return HResultFromLastError();\n }\n }\n }\n }\n }\n\n return S_OK;\n }\n\n HRESULT OpenServiceManager(ServiceHandle* service_manager) {\n if (!service_manager)\n return E_POINTER;\n\n service_manager->Set(::OpenSCManager(NULL, NULL, SC_MANAGER_ALL_ACCESS));\n if (!service_manager->IsValid())\n return HResultFromLastError();\n\n return S_OK;\n }\n\n HRESULT OpenService(DWORD access, ServiceHandle* service) {\n if (!service)\n return E_POINTER;\n\n ServiceHandle scm;\n HRESULT hr = OpenServiceManager(&scm);\n if (FAILED(hr))\n return hr;\n\n service->Set(::OpenService(scm, m_szServiceName, access));\n\n if (!service->IsValid())\n return HResultFromLastError();\n\n return S_OK;\n }\n\n HRESULT StartService() {\n ServiceHandle service;\n HRESULT hr = OpenService(SERVICE_START, &service);\n if (FAILED(hr))\n return hr;\n if (!::StartService(service, 0, NULL))\n return HResultFromLastError();\n return S_OK;\n }\n\n HRESULT StopService() {\n ServiceHandle service;\n HRESULT hr = OpenService(SERVICE_STOP, &service);\n if (FAILED(hr))\n return hr;\n SERVICE_STATUS status = {0};\n if (!::ControlService(service, SERVICE_CONTROL_STOP, &status))\n return HResultFromLastError();\n return S_OK;\n }\n\n HRESULT StartConnector() {\n chrome_.reset(new ChromeLauncher(user_data_dir_));\n return chrome_->Start() ? S_OK : E_FAIL;\n }\n\n void StopConnector() {\n chrome_->Stop();\n chrome_.reset();\n }\n\n static BOOL WINAPI ConsoleCtrlHandler(DWORD type);\n\n FilePath user_data_dir_;\n scoped_ptr<ChromeLauncher> chrome_;\n};\n\nCloudPrintServiceModule _AtlModule;\n\nBOOL CloudPrintServiceModule::ConsoleCtrlHandler(DWORD type) {\n PostThreadMessage(_AtlModule.m_dwThreadID, WM_QUIT, 0, 0);\n return TRUE;\n}\n\nint main() {\n base::AtExitManager at_exit;\n return _AtlModule.WinMain(0);\n}\n<commit_msg>Validation of write access to chrome profile.<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 \"cloud_print\/service\/win\/cloud_print_service.h\"\n\n#include <atlsecurity.h>\n#include <iomanip>\n#include <iostream>\n\n#include \"base\/at_exit.h\"\n#include \"base\/command_line.h\"\n#include \"base\/file_path.h\"\n#include \"base\/file_util.h\"\n#include \"base\/path_service.h\"\n#include \"base\/string_util.h\"\n#include \"base\/win\/scoped_handle.h\"\n#include \"cloud_print\/service\/win\/chrome_launcher.h\"\n#include \"cloud_print\/service\/win\/resource.h\"\n#include \"cloud_print\/service\/win\/service_state.h\"\n#include \"cloud_print\/service\/win\/service_switches.h\"\n\nnamespace {\n\nconst wchar_t kServiceStateFileName[] = L\"Service State\";\n\nconst wchar_t kUserToRunService[] = L\"NT AUTHORITY\\\\LocalService\";\n\n\/\/ The traits class for Windows Service.\nclass ServiceHandleTraits {\n public:\n typedef SC_HANDLE Handle;\n\n \/\/ Closes the handle.\n static bool CloseHandle(Handle handle) {\n return ::CloseServiceHandle(handle) != FALSE;\n }\n\n static bool IsHandleValid(Handle handle) {\n return handle != NULL;\n }\n\n static Handle NullHandle() {\n return NULL;\n }\n\n private:\n DISALLOW_IMPLICIT_CONSTRUCTORS(ServiceHandleTraits);\n};\n\ntypedef base::win::GenericScopedHandle<\n ServiceHandleTraits, base::win::DummyVerifierTraits> ServiceHandle;\n\nHRESULT HResultFromLastError() {\n HRESULT hr = HRESULT_FROM_WIN32(GetLastError());\n \/\/ Something already failed if function called.\n if (SUCCEEDED(hr))\n hr = E_FAIL;\n return hr;\n}\n\nvoid InvalidUsage() {\n FilePath service_path;\n CHECK(PathService::Get(base::FILE_EXE, &service_path));\n\n std::cout << \"Usage: \";\n std::cout << service_path.BaseName().value();\n std::cout << \" [\";\n std::cout << \"[\";\n std::cout << \"[\";\n std::cout << \" -\" << kInstallSwitch;\n std::cout << \" -\" << kUserDataDirSwitch << \"=DIRECTORY\";\n std::cout << \" [ -\" << kQuietSwitch << \" ]\";\n std::cout << \"]\";\n std::cout << \"]\";\n std::cout << \" | -\" << kUninstallSwitch;\n std::cout << \" | -\" << kStartSwitch;\n std::cout << \" | -\" << kStopSwitch;\n std::cout << \" ]\\n\";\n std::cout << \"Manages cloud print windows service.\\n\\n\";\n\n static const struct {\n const char* name;\n const char* description;\n } kSwitchHelp[] = {\n { kInstallSwitch, \"Installs cloud print as service.\" },\n { kUserDataDirSwitch, \"User data directory with \\\"Service State\\\" file.\" },\n { kQuietSwitch, \"Fails without questions if something wrong.\" },\n { kUninstallSwitch, \"Uninstalls service.\" },\n { kStartSwitch, \"Starts service. May be combined with installation.\" },\n { kStopSwitch, \"Stops service.\" },\n };\n\n for (size_t i = 0; i < arraysize(kSwitchHelp); ++i) {\n std::cout << std::setiosflags(std::ios::left);\n std::cout << \" -\" << std::setw(15) << kSwitchHelp[i].name;\n std::cout << kSwitchHelp[i].description << \"\\n\";\n }\n std::cout << \"\\n\";\n}\n\nstd::string GetOption(const std::string& name, const std::string& default,\n bool secure) {\n std::cout << \"Input \\'\" << name << \"\\'\";\n if (!default.empty()) {\n std::cout << \", press [ENTER] to keep '\";\n std::cout << default;\n std::cout << \"'\";\n }\n std::cout << \":\";\n std::string tmp;\n\n if (secure) {\n DWORD saved_mode = 0;\n \/\/ Don't close.\n HANDLE stdin_handle = ::GetStdHandle(STD_INPUT_HANDLE);\n ::GetConsoleMode(stdin_handle, &saved_mode);\n ::SetConsoleMode(stdin_handle, saved_mode & ~ENABLE_ECHO_INPUT);\n std::getline(std::cin, tmp);\n ::SetConsoleMode(stdin_handle, saved_mode);\n std::cout << \"\\n\";\n } else {\n std::getline(std::cin, tmp);\n }\n if (tmp.empty())\n return default;\n return tmp;\n}\n\nHRESULT WriteFileAsUser(const FilePath& path, const wchar_t* user,\n const char* data, int size) {\n ATL::CAccessToken thread_token;\n if (!thread_token.OpenThreadToken(TOKEN_DUPLICATE | TOKEN_IMPERSONATE)) {\n LOG(ERROR) << \"Failed to open thread token.\";\n return HResultFromLastError();\n }\n\n ATL::CSid local_service;\n if (!local_service.LoadAccount(user)) {\n LOG(ERROR) << \"Failed create SID.\";\n return HResultFromLastError();\n }\n\n ATL::CAccessToken token;\n ATL::CTokenGroups group;\n group.Add(local_service, 0);\n\n const ATL::CTokenGroups empty_group;\n if (!thread_token.CreateRestrictedToken(&token, empty_group, group)) {\n LOG(ERROR) << \"Failed to create restricted token for \" << user << \".\";\n return HResultFromLastError();\n }\n\n if (!token.Impersonate()) {\n LOG(ERROR) << \"Failed to impersonate \" << user << \".\";\n return HResultFromLastError();\n }\n\n ATL::CAutoRevertImpersonation auto_revert(&token);\n if (file_util::WriteFile(path, data, size) != size) {\n LOG(ERROR) << \"Failed to write file \" << path.value() << \".\";\n return HResultFromLastError();\n }\n return S_OK;\n}\n\n} \/\/ namespace\n\nclass CloudPrintServiceModule\n : public ATL::CAtlServiceModuleT<CloudPrintServiceModule, IDS_SERVICENAME> {\n public:\n typedef ATL::CAtlServiceModuleT<CloudPrintServiceModule,\n IDS_SERVICENAME> Base;\n\n DECLARE_REGISTRY_APPID_RESOURCEID(IDR_CLOUDPRINTSERVICE,\n \"{8013FB7C-2E3E-4992-B8BD-05C0C4AB0627}\")\n\n HRESULT InitializeSecurity() {\n \/\/ TODO(gene): Check if we need to call CoInitializeSecurity and provide\n \/\/ the appropriate security settings for service.\n return S_OK;\n }\n\n HRESULT InstallService() {\n \/\/ TODO(vitalybuka): consider \"lite\" version if we don't want unregister\n \/\/ printers here.\n HRESULT hr = UninstallService();\n if (FAILED(hr))\n return hr;\n\n if (ChromeLauncher::GetChromePath(HKEY_LOCAL_MACHINE).empty()) {\n LOG(ERROR) << \"Found no Chrome installed for all users.\";\n return HRESULT_FROM_WIN32(ERROR_FILE_NOT_FOUND);\n }\n\n hr = UpdateRegistryAppId(true);\n if (FAILED(hr))\n return hr;\n\n FilePath service_path;\n CHECK(PathService::Get(base::FILE_EXE, &service_path));\n CommandLine command_line(service_path);\n command_line.AppendSwitch(kServiceSwitch);\n command_line.AppendSwitchPath(kUserDataDirSwitch, user_data_dir_);\n\n ServiceHandle scm;\n hr = OpenServiceManager(&scm);\n if (FAILED(hr))\n return hr;\n\n ServiceHandle service(\n ::CreateService(\n scm, m_szServiceName, m_szServiceName, SERVICE_ALL_ACCESS,\n SERVICE_WIN32_OWN_PROCESS, SERVICE_AUTO_START, SERVICE_ERROR_NORMAL,\n command_line.GetCommandLineString().c_str(), NULL, NULL, NULL,\n kUserToRunService, NULL));\n\n if (!service.IsValid())\n return HResultFromLastError();\n\n return S_OK;\n }\n\n HRESULT UninstallService() {\n if (!Uninstall())\n return E_FAIL;\n return UpdateRegistryAppId(false);\n }\n\n bool ParseCommandLine(LPCTSTR lpCmdLine, HRESULT* pnRetCode) {\n CHECK(pnRetCode);\n CommandLine command_line(CommandLine::NO_PROGRAM);\n command_line.ParseFromString(lpCmdLine);\n bool is_service = false;\n *pnRetCode = ParseCommandLine(command_line, &is_service);\n if (FAILED(*pnRetCode)) {\n LOG(ERROR) << \"Operation failed. 0x\" << std::setw(8) <<\n std::setbase(16) << *pnRetCode;\n }\n return is_service;\n }\n\n HRESULT PreMessageLoop(int nShowCmd) {\n HRESULT hr = Base::PreMessageLoop(nShowCmd);\n if (FAILED(hr))\n return hr;\n\n hr = StartConnector();\n if (FAILED(hr))\n return hr;\n\n LogEvent(_T(\"Service started\/resumed\"));\n SetServiceStatus(SERVICE_RUNNING);\n\n return hr;\n }\n\n HRESULT PostMessageLoop() {\n StopConnector();\n return Base::PostMessageLoop();\n }\n\n private:\n HRESULT ParseCommandLine(const CommandLine& command_line, bool* is_service) {\n if (!is_service)\n return E_INVALIDARG;\n *is_service = false;\n\n user_data_dir_ = command_line.GetSwitchValuePath(kUserDataDirSwitch);\n if (command_line.HasSwitch(kStopSwitch))\n return StopService();\n\n if (command_line.HasSwitch(kUninstallSwitch))\n return UninstallService();\n\n if (command_line.HasSwitch(kInstallSwitch)) {\n if (!command_line.HasSwitch(kUserDataDirSwitch)) {\n InvalidUsage();\n return S_FALSE;\n }\n\n HRESULT hr = ValidateUserDataDir();\n if (FAILED(hr))\n return hr;\n\n hr = ProcessServiceState(command_line.HasSwitch(kQuietSwitch));\n if (FAILED(hr))\n return hr;\n\n hr = InstallService();\n if (SUCCEEDED(hr) && command_line.HasSwitch(kStartSwitch))\n return StartService();\n\n return hr;\n }\n\n if (command_line.HasSwitch(kStartSwitch))\n return StartService();\n\n if (command_line.HasSwitch(kServiceSwitch)) {\n *is_service = true;\n return S_OK;\n }\n\n if (command_line.HasSwitch(kConsoleSwitch)) {\n ::SetConsoleCtrlHandler(&ConsoleCtrlHandler, TRUE);\n HRESULT hr = Run();\n ::SetConsoleCtrlHandler(NULL, FALSE);\n return hr;\n }\n\n InvalidUsage();\n return S_FALSE;\n }\n\n HRESULT ValidateUserDataDir() {\n FilePath temp_file;\n const char some_data[] = \"1234\";\n if (!file_util::CreateTemporaryFileInDir(user_data_dir_, &temp_file))\n return E_FAIL;\n HRESULT hr = WriteFileAsUser(temp_file, kUserToRunService, some_data,\n sizeof(some_data));\n if (FAILED(hr)) {\n LOG(ERROR) << \"Failed to write user data. Make sure that account \\'\" <<\n kUserToRunService << \"\\'has full access to \\'\" <<\n user_data_dir_.value() << \"\\'.\";\n }\n file_util::Delete(temp_file, false);\n return hr;\n }\n\n HRESULT ProcessServiceState(bool quiet) {\n FilePath file = user_data_dir_.Append(kServiceStateFileName);\n\n for (;;) {\n std::string contents;\n ServiceState service_state;\n\n bool is_valid = file_util::ReadFileToString(file, &contents) &&\n service_state.FromString(contents);\n\n if (!quiet) {\n std::cout << file.value() << \":\\n\";\n std::cout << contents << \"\\n\";\n }\n\n if (!is_valid)\n LOG(ERROR) << \"Invalid file: \" << file.value();\n\n if (quiet)\n return is_valid ? S_OK : HRESULT_FROM_WIN32(ERROR_FILE_INVALID);\n\n if (!contents.empty()) {\n std::cout << \"Do you want to use this file [y\/n]:\";\n for (;;) {\n std::string input;\n std::getline(std::cin, input);\n StringToLowerASCII(&input);\n if (input == \"y\") {\n return S_OK;\n } else if (input == \"n\") {\n is_valid = false;\n break;\n }\n }\n }\n\n while (!is_valid) {\n std::string email = GetOption(\"email\", service_state.email(), false);\n std::string password = GetOption(\"password\", \"\", true);\n std::string proxy_id = GetOption(\"connector_id\",\n service_state.proxy_id(), false);\n is_valid = service_state.Configure(email, password, proxy_id);\n if (is_valid) {\n std::string new_contents = service_state.ToString();\n if (new_contents != contents) {\n HRESULT hr = WriteFileAsUser(file, kUserToRunService,\n new_contents.c_str(),\n new_contents.size());\n if (FAILED(hr))\n return hr;\n }\n }\n }\n }\n\n return S_OK;\n }\n\n HRESULT OpenServiceManager(ServiceHandle* service_manager) {\n if (!service_manager)\n return E_POINTER;\n\n service_manager->Set(::OpenSCManager(NULL, NULL, SC_MANAGER_ALL_ACCESS));\n if (!service_manager->IsValid())\n return HResultFromLastError();\n\n return S_OK;\n }\n\n HRESULT OpenService(DWORD access, ServiceHandle* service) {\n if (!service)\n return E_POINTER;\n\n ServiceHandle scm;\n HRESULT hr = OpenServiceManager(&scm);\n if (FAILED(hr))\n return hr;\n\n service->Set(::OpenService(scm, m_szServiceName, access));\n\n if (!service->IsValid())\n return HResultFromLastError();\n\n return S_OK;\n }\n\n HRESULT StartService() {\n ServiceHandle service;\n HRESULT hr = OpenService(SERVICE_START, &service);\n if (FAILED(hr))\n return hr;\n if (!::StartService(service, 0, NULL))\n return HResultFromLastError();\n return S_OK;\n }\n\n HRESULT StopService() {\n ServiceHandle service;\n HRESULT hr = OpenService(SERVICE_STOP, &service);\n if (FAILED(hr))\n return hr;\n SERVICE_STATUS status = {0};\n if (!::ControlService(service, SERVICE_CONTROL_STOP, &status))\n return HResultFromLastError();\n return S_OK;\n }\n\n HRESULT StartConnector() {\n chrome_.reset(new ChromeLauncher(user_data_dir_));\n return chrome_->Start() ? S_OK : E_FAIL;\n }\n\n void StopConnector() {\n chrome_->Stop();\n chrome_.reset();\n }\n\n static BOOL WINAPI ConsoleCtrlHandler(DWORD type);\n\n FilePath user_data_dir_;\n scoped_ptr<ChromeLauncher> chrome_;\n};\n\nCloudPrintServiceModule _AtlModule;\n\nBOOL CloudPrintServiceModule::ConsoleCtrlHandler(DWORD type) {\n PostThreadMessage(_AtlModule.m_dwThreadID, WM_QUIT, 0, 0);\n return TRUE;\n}\n\nint main() {\n base::AtExitManager at_exit;\n return _AtlModule.WinMain(0);\n}\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\n#include \"qmljscheck.h\"\n#include \"qmljsbind.h\"\n#include \"qmljsinterpreter.h\"\n#include \"qmljsevaluate.h\"\n#include \"parser\/qmljsast_p.h\"\n\n#include <QtGui\/QApplication>\n#include <QtCore\/QDebug>\n\nnamespace QmlJS {\nnamespace Messages {\nstatic const char *invalidPropertyName = QT_TRANSLATE_NOOP(\"QmlJS::Check\", \"'%1' is not a valid property name\");\nstatic const char *unknownType = QT_TRANSLATE_NOOP(\"QmlJS::Check\", \"unknown type\");\n} \/\/ namespace Messages\n\nstatic inline QString tr(const char *msg)\n{ return qApp->translate(\"QmlJS::Check\", msg); }\n\n} \/\/ namespace QmlJS\n\nusing namespace QmlJS;\nusing namespace QmlJS::AST;\nusing namespace QmlJS::Interpreter;\n\nCheck::Check(Document::Ptr doc, const Snapshot &snapshot)\n : _doc(doc)\n , _snapshot(snapshot)\n , _context(&_engine)\n , _link(&_context, doc, snapshot)\n , _extraScope(0)\n , _allowAnyProperty(false)\n{\n}\n\nCheck::~Check()\n{\n}\n\nQList<DiagnosticMessage> Check::operator()()\n{\n _messages.clear();\n Node::accept(_doc->ast(), this);\n return _messages;\n}\n\nbool Check::visit(UiProgram *ast)\n{\n \/\/ build the initial scope chain\n if (ast->members && ast->members->member)\n _link.scopeChainAt(_doc, ast->members->member);\n\n return true;\n}\n\nbool Check::visit(UiObjectDefinition *ast)\n{\n visitQmlObject(ast, ast->qualifiedTypeNameId, ast->initializer);\n return false;\n}\n\nbool Check::visit(UiObjectBinding *ast)\n{\n checkScopeObjectMember(ast->qualifiedId);\n\n visitQmlObject(ast, ast->qualifiedTypeNameId, ast->initializer);\n return false;\n}\n\nvoid Check::visitQmlObject(Node *ast, UiQualifiedId *typeId,\n UiObjectInitializer *initializer)\n{\n \/\/ If the 'typeId' starts with a lower-case letter, it doesn't define\n \/\/ a new object instance. For instance: anchors { ... }\n if (typeId->name->asString().at(0).isLower() && ! typeId->next) {\n checkScopeObjectMember(typeId);\n \/\/ ### don't give up!\n return;\n }\n\n const bool oldAllowAnyProperty = _allowAnyProperty;\n\n if (! _context.lookupType(_doc.data(), typeId)) {\n warning(typeId->identifierToken, tr(Messages::unknownType));\n _allowAnyProperty = true; \/\/ suppress subsequent \"unknown property\" errors\n }\n\n const ObjectValue *oldScopeObject = _context.qmlScopeObject();\n const ObjectValue *oldExtraScope = _extraScope;\n const ObjectValue *scopeObject = _doc->bind()->findQmlObject(ast);\n _context.setQmlScopeObject(scopeObject);\n\n#ifndef NO_DECLARATIVE_BACKEND\n \/\/ check if the object has a Qt.ListElement ancestor\n const ObjectValue *prototype = scopeObject->prototype(&_context);\n while (prototype) {\n if (const QmlObjectValue *qmlMetaObject = dynamic_cast<const QmlObjectValue *>(prototype)) {\n \/\/ ### Also check for Qt package. Involves changes in QmlObjectValue.\n if (qmlMetaObject->qmlTypeName() == QLatin1String(\"ListElement\")) {\n _allowAnyProperty = true;\n break;\n }\n }\n prototype = prototype->prototype(&_context);\n }\n\n \/\/ check if the object has a Qt.PropertyChanges ancestor\n prototype = scopeObject->prototype(&_context);\n while (prototype) {\n if (const QmlObjectValue *qmlMetaObject = dynamic_cast<const QmlObjectValue *>(prototype)) {\n \/\/ ### Also check for Qt package. Involves changes in QmlObjectValue.\n if (qmlMetaObject->qmlTypeName() == QLatin1String(\"PropertyChanges\"))\n break;\n }\n prototype = prototype->prototype(&_context);\n }\n \/\/ find the target script binding\n if (prototype && initializer) {\n for (UiObjectMemberList *m = initializer->members; m; m = m->next) {\n if (UiScriptBinding *scriptBinding = cast<UiScriptBinding *>(m->member)) {\n if (scriptBinding->qualifiedId\n && scriptBinding->qualifiedId->name->asString() == QLatin1String(\"target\")\n && ! scriptBinding->qualifiedId->next) {\n if (ExpressionStatement *expStmt = cast<ExpressionStatement *>(scriptBinding->statement)) {\n Evaluate evaluator(&_context);\n const Value *targetValue = evaluator(expStmt->expression);\n\n if (const ObjectValue *target = value_cast<const ObjectValue *>(targetValue)) {\n _extraScope = target;\n } else {\n _allowAnyProperty = true;\n }\n }\n }\n }\n }\n }\n#endif\n\n Node::accept(initializer, this);\n\n _context.setQmlScopeObject(oldScopeObject);\n _extraScope = oldExtraScope;\n _allowAnyProperty = oldAllowAnyProperty;\n}\n\nbool Check::visit(UiScriptBinding *ast)\n{\n checkScopeObjectMember(ast->qualifiedId);\n\n return true;\n}\n\nbool Check::visit(UiArrayBinding *ast)\n{\n checkScopeObjectMember(ast->qualifiedId);\n\n return true;\n}\n\nvoid Check::checkScopeObjectMember(const UiQualifiedId *id)\n{\n if (_allowAnyProperty)\n return;\n\n const ObjectValue *scopeObject = _context.qmlScopeObject();\n\n if (! id)\n return; \/\/ ### error?\n\n QString propertyName = id->name->asString();\n\n if (propertyName == QLatin1String(\"id\") && ! id->next)\n return;\n\n \/\/ attached properties\n bool isAttachedProperty = false;\n if (! propertyName.isEmpty() && propertyName[0].isUpper()) {\n isAttachedProperty = true;\n scopeObject = _context.typeEnvironment(_doc.data());\n }\n\n if (! scopeObject)\n return;\n\n \/\/ global lookup for first part of id\n const Value *value = scopeObject->lookupMember(propertyName, &_context);\n if (_extraScope && !value)\n value = _extraScope->lookupMember(propertyName, &_context);\n if (!value) {\n error(id->identifierToken,\n tr(Messages::invalidPropertyName).arg(propertyName));\n }\n\n \/\/ can't look up members for attached properties\n if (isAttachedProperty)\n return;\n\n \/\/ member lookup\n const UiQualifiedId *idPart = id;\n while (idPart->next) {\n const ObjectValue *objectValue = value_cast<const ObjectValue *>(value);\n if (! objectValue) {\n error(idPart->identifierToken,\n QString(\"'%1' does not have members\").arg(propertyName));\n return;\n }\n\n idPart = idPart->next;\n propertyName = idPart->name->asString();\n\n value = objectValue->lookupMember(propertyName, &_context);\n if (! value) {\n error(idPart->identifierToken,\n QString(\"'%1' is not a member of '%2'\").arg(propertyName, objectValue->className()));\n return;\n }\n }\n}\n\nvoid Check::error(const AST::SourceLocation &loc, const QString &message)\n{\n _messages.append(DiagnosticMessage(DiagnosticMessage::Error, loc, message));\n}\n\nvoid Check::warning(const AST::SourceLocation &loc, const QString &message)\n{\n _messages.append(DiagnosticMessage(DiagnosticMessage::Warning, loc, message));\n}\n<commit_msg>Made the warnings\/errors translatable.<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\n#include \"qmljscheck.h\"\n#include \"qmljsbind.h\"\n#include \"qmljsinterpreter.h\"\n#include \"qmljsevaluate.h\"\n#include \"parser\/qmljsast_p.h\"\n\n#include <QtGui\/QApplication>\n#include <QtCore\/QDebug>\n\nnamespace QmlJS {\nnamespace Messages {\nstatic const char *invalid_property_name = QT_TRANSLATE_NOOP(\"QmlJS::Check\", \"'%1' is not a valid property name\");\nstatic const char *unknown_type = QT_TRANSLATE_NOOP(\"QmlJS::Check\", \"unknown type\");\nstatic const char *has_no_members = QT_TRANSLATE_NOOP(\"QmlJS::Check\", \"'%1' does not have members\");\nstatic const char *is_not_a_member = QT_TRANSLATE_NOOP(\"QmlJS::Check\", \"'%1' is not a member of '%2'\");\n} \/\/ namespace Messages\n\nstatic inline QString tr(const char *msg)\n{ return qApp->translate(\"QmlJS::Check\", msg); }\n\n} \/\/ namespace QmlJS\n\nusing namespace QmlJS;\nusing namespace QmlJS::AST;\nusing namespace QmlJS::Interpreter;\n\nCheck::Check(Document::Ptr doc, const Snapshot &snapshot)\n : _doc(doc)\n , _snapshot(snapshot)\n , _context(&_engine)\n , _link(&_context, doc, snapshot)\n , _extraScope(0)\n , _allowAnyProperty(false)\n{\n}\n\nCheck::~Check()\n{\n}\n\nQList<DiagnosticMessage> Check::operator()()\n{\n _messages.clear();\n Node::accept(_doc->ast(), this);\n return _messages;\n}\n\nbool Check::visit(UiProgram *ast)\n{\n \/\/ build the initial scope chain\n if (ast->members && ast->members->member)\n _link.scopeChainAt(_doc, ast->members->member);\n\n return true;\n}\n\nbool Check::visit(UiObjectDefinition *ast)\n{\n visitQmlObject(ast, ast->qualifiedTypeNameId, ast->initializer);\n return false;\n}\n\nbool Check::visit(UiObjectBinding *ast)\n{\n checkScopeObjectMember(ast->qualifiedId);\n\n visitQmlObject(ast, ast->qualifiedTypeNameId, ast->initializer);\n return false;\n}\n\nvoid Check::visitQmlObject(Node *ast, UiQualifiedId *typeId,\n UiObjectInitializer *initializer)\n{\n \/\/ If the 'typeId' starts with a lower-case letter, it doesn't define\n \/\/ a new object instance. For instance: anchors { ... }\n if (typeId->name->asString().at(0).isLower() && ! typeId->next) {\n checkScopeObjectMember(typeId);\n \/\/ ### don't give up!\n return;\n }\n\n const bool oldAllowAnyProperty = _allowAnyProperty;\n\n if (! _context.lookupType(_doc.data(), typeId)) {\n warning(typeId->identifierToken, tr(Messages::unknown_type));\n _allowAnyProperty = true; \/\/ suppress subsequent \"unknown property\" errors\n }\n\n const ObjectValue *oldScopeObject = _context.qmlScopeObject();\n const ObjectValue *oldExtraScope = _extraScope;\n const ObjectValue *scopeObject = _doc->bind()->findQmlObject(ast);\n _context.setQmlScopeObject(scopeObject);\n\n#ifndef NO_DECLARATIVE_BACKEND\n \/\/ check if the object has a Qt.ListElement ancestor\n const ObjectValue *prototype = scopeObject->prototype(&_context);\n while (prototype) {\n if (const QmlObjectValue *qmlMetaObject = dynamic_cast<const QmlObjectValue *>(prototype)) {\n \/\/ ### Also check for Qt package. Involves changes in QmlObjectValue.\n if (qmlMetaObject->qmlTypeName() == QLatin1String(\"ListElement\")) {\n _allowAnyProperty = true;\n break;\n }\n }\n prototype = prototype->prototype(&_context);\n }\n\n \/\/ check if the object has a Qt.PropertyChanges ancestor\n prototype = scopeObject->prototype(&_context);\n while (prototype) {\n if (const QmlObjectValue *qmlMetaObject = dynamic_cast<const QmlObjectValue *>(prototype)) {\n \/\/ ### Also check for Qt package. Involves changes in QmlObjectValue.\n if (qmlMetaObject->qmlTypeName() == QLatin1String(\"PropertyChanges\"))\n break;\n }\n prototype = prototype->prototype(&_context);\n }\n \/\/ find the target script binding\n if (prototype && initializer) {\n for (UiObjectMemberList *m = initializer->members; m; m = m->next) {\n if (UiScriptBinding *scriptBinding = cast<UiScriptBinding *>(m->member)) {\n if (scriptBinding->qualifiedId\n && scriptBinding->qualifiedId->name->asString() == QLatin1String(\"target\")\n && ! scriptBinding->qualifiedId->next) {\n if (ExpressionStatement *expStmt = cast<ExpressionStatement *>(scriptBinding->statement)) {\n Evaluate evaluator(&_context);\n const Value *targetValue = evaluator(expStmt->expression);\n\n if (const ObjectValue *target = value_cast<const ObjectValue *>(targetValue)) {\n _extraScope = target;\n } else {\n _allowAnyProperty = true;\n }\n }\n }\n }\n }\n }\n#endif\n\n Node::accept(initializer, this);\n\n _context.setQmlScopeObject(oldScopeObject);\n _extraScope = oldExtraScope;\n _allowAnyProperty = oldAllowAnyProperty;\n}\n\nbool Check::visit(UiScriptBinding *ast)\n{\n checkScopeObjectMember(ast->qualifiedId);\n\n return true;\n}\n\nbool Check::visit(UiArrayBinding *ast)\n{\n checkScopeObjectMember(ast->qualifiedId);\n\n return true;\n}\n\nvoid Check::checkScopeObjectMember(const UiQualifiedId *id)\n{\n if (_allowAnyProperty)\n return;\n\n const ObjectValue *scopeObject = _context.qmlScopeObject();\n\n if (! id)\n return; \/\/ ### error?\n\n QString propertyName = id->name->asString();\n\n if (propertyName == QLatin1String(\"id\") && ! id->next)\n return;\n\n \/\/ attached properties\n bool isAttachedProperty = false;\n if (! propertyName.isEmpty() && propertyName[0].isUpper()) {\n isAttachedProperty = true;\n scopeObject = _context.typeEnvironment(_doc.data());\n }\n\n if (! scopeObject)\n return;\n\n \/\/ global lookup for first part of id\n const Value *value = scopeObject->lookupMember(propertyName, &_context);\n if (_extraScope && !value)\n value = _extraScope->lookupMember(propertyName, &_context);\n if (!value) {\n error(id->identifierToken,\n tr(Messages::invalid_property_name).arg(propertyName));\n }\n\n \/\/ can't look up members for attached properties\n if (isAttachedProperty)\n return;\n\n \/\/ member lookup\n const UiQualifiedId *idPart = id;\n while (idPart->next) {\n const ObjectValue *objectValue = value_cast<const ObjectValue *>(value);\n if (! objectValue) {\n error(idPart->identifierToken,\n tr(Messages::has_no_members).arg(propertyName));\n return;\n }\n\n idPart = idPart->next;\n propertyName = idPart->name->asString();\n\n value = objectValue->lookupMember(propertyName, &_context);\n if (! value) {\n error(idPart->identifierToken,\n tr(Messages::is_not_a_member).arg(propertyName,\n objectValue->className()));\n return;\n }\n }\n}\n\nvoid Check::error(const AST::SourceLocation &loc, const QString &message)\n{\n _messages.append(DiagnosticMessage(DiagnosticMessage::Error, loc, message));\n}\n\nvoid Check::warning(const AST::SourceLocation &loc, const QString &message)\n{\n _messages.append(DiagnosticMessage(DiagnosticMessage::Warning, loc, message));\n}\n<|endoftext|>"} {"text":"<commit_before>\/* The Next Great Finite Element Library. *\/\n\/* Copyright (C) 2003 Benjamin S. Kirk *\/\n\n\/* This library is free software; you can redistribute it and\/or *\/\n\/* modify it under the terms of the GNU Lesser General Public *\/\n\/* License as published by the Free Software Foundation; either *\/\n\/* version 2.1 of the License, or (at your option) any later version. *\/\n\n\/* This library is distributed in the hope that it will be useful, *\/\n\/* but WITHOUT ANY WARRANTY; without even the implied warranty of *\/\n\/* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU *\/\n\/* Lesser General Public License for more details. *\/\n\n\/* You should have received a copy of the GNU Lesser General Public *\/\n\/* License along with this library; if not, write to the Free Software *\/\n\/* Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA *\/\n\n\n\n\/\/ <h1>Miscellaneous Example 7 - Can use the PetscDMNonlinearSolver (available in PETSc-3.3.0 or above) to solve a VI version of the problem.<\/h1>\n\/\/\n\/\/ LibMesh interfaces directly with PETSc's variational inequality solver,\n\/\/ this example shows how to do it.\n\/\/ Author: Dmitry Karpeev, 2012\n\n\/\/ Example include files\n#include \"biharmonic.h\"\n\n\n\/\/ Bring in everything from the libMesh namespace\nusing namespace libMesh;\n\n\/\/ Print usage information if requested on command line\nvoid print_help(int argc, char** argv);\n\nint main(int argc, char** argv)\n{\n \/\/ Initialize libMesh.\n LibMeshInit init (argc, argv);\n if (on_command_line(\"--help\"))\n print_help(argc, argv);\n else\n {\n#if !defined(LIBMESH_ENABLE_SECOND_DERIVATIVES)\n libmesh_example_assert(false, \"--enable-second\");\n#elif !defined(LIBMESH_ENABLE_PERIODIC)\n libmesh_example_assert(false, \"--enable-periodic\");\n#endif\n\n \/\/ This is a PETSc-specific solver\n libmesh_example_assert(libMesh::default_solver_package() == PETSC_SOLVERS, \"--enable-petsc\");\n\n const int dim = command_line_value(\"dim\",1);\n\n \/\/ Skip higher-dimensional examples on a lower-dimensional libMesh build\n libmesh_example_assert(dim <= LIBMESH_DIM, \"2D\/3D support\");\n\n Biharmonic* biharmonic;\n Biharmonic::Create(&biharmonic);\n biharmonic->viewParameters();\n biharmonic->init();\n biharmonic->run();\n Biharmonic::Destroy(&biharmonic);\n }\n return 0;\n}\n\n\n\n\n\nvoid print_help(int, char** argv)\n{\n libMesh::out << \"This example solves the Cahn-Hillard equation with chemical potential f:\\n\"\n\t << \" u_t = \\\\div(M(u)\\\\grad f(u))\\n\"\n\t << \"Here we have\\n\"\n\t << \" u, -1 <= u <= 1 -- relative concentration (difference of two concentrations in a binary mixture) \\n\"\n\t << \" M, M >= 0 -- mobility of the mixture\\n\"\n\t << \" f = \\\\delta E\/\\\\delta u -- variational derivative of the free energy functional E\\n\"\n\t << \" E = \\\\int[\\\\kappa\/2 |\\\\grac u|^ + g(u)]\\n\"\n\t << \"where the gradient term is the interfacial energy density with \\\\kappa quantifying the energy of the interface,\\n\"\n\t << \"and g(u) is the bulk energy density\\n\"\n\t << \" g(u) = \\\\theta L(u) + \\\\theta_c W(u),\\n\"\n\t << \"L(u) is the (optional, in this model) logarithmic term corresponding to the entropy of the mixture:\\n\"\n\t << \" L(u) = (\\\\theta\/2)[(1+u)\\\\ln((1+u)\/2) + (1-u)\\\\ln((1-u)\/2)],\\n\"\n\t << \"where \\\\theta is related to the Boltzmann factor k_B T - a proxy for the absolute temperature T.\\n\"\n\t << \"L can be optionally approximated ('truncated') using a quadratic or a cubic polynomial on [-1,1]\\n\"\n\t << \"W(u) is the (optional, in this model) potential promoting demixing. It can take the form of \\n\"\n\t << \"a 'double well' potential\\n\"\n\t << \" W(u) = \\\\theta_c (u^4\/4 - u^2\/2),\\n\"\n\t << \" or \\n\"\n\t << \"a 'double obstacle' potential\\n\"\n\t << \" W(u) = (\\\\theta_c\/2)(1-u^2),\\n\"\n\t << \"where \\\\theta_c is the critical 'temperature'.\\n\"\n\t << \"Finally, mobility M can be constant of 'degenerate', by which we mean that M is varying with u and \\n\"\n\t << \"vanishing (degenerating) whenever u reaches critical values +1 or -1:\\n\"\n\t << \" M(u) = 1.0\\n\"\n\t << \" or\\n\"\n\t << \" M(u) = (1.0 - u^2)\\n\"\n\t << \"Degenerate mobility should generally be used only in conjunction with logarithmic free energy terms.\\n\\n\"\n\t << \"The equation is solved on a periodic domain (in 1D, 2D or 3D)\\n\"\n\t << \"using a Galerkin formulation with C^1 elements approximating the H^2_{per} function space.\\n\\n\"\n\t << \"\\n-----------\\n\"\n\t << \"COMPILING: \"\n\t << \"\\n-----------\\n\"\n\t << \"Compile as follows (assuming libmesh has been built): \\n\"\n\t << \"METHOD=<method> make \\n\"\n\t << \"where <method> is dbg or opt.\\n\"\n\t << \"\\n-----------\\n\"\n\t << \"HELP: \"\n\t << \"\\n-----------\\n\"\n\t << \"Print this help message:\\n\"\n\t << argv[0] << \" --help\\n\"\n\t << \"\\n-----------\\n\"\n\t << \"RUNNING: \"\n\t << \"\\n-----------\\n\"\n\t << \"Run in serial with build METHOD <method> as follows:\\n\"\n\t << \"\\n\"\n\t << argv[0] << \"\\n\"\n\t << \" [--verbose] dim=<1|2|3> N=<number_of_linear_elements> \\n\"\n\t << \" kappa=<kappa_value> growth=<yes|no> degenerate=<yes|no> [--cahn-hillard] \\n\"\n\t << \" [--netforce] energy=<double_well|double_obstacle|log_double_well|log_double_obstacle> log_truncation_order=<2|3> \\n\"\n\t << \" theta=<theta_value> theta_c=<theta_c_value> \\n\"\n\t << \" initial_state=<ball|rod|strip> initial_center='x [y [z]]' initial_width=<width> \\n\"\n\t << \" min_time=<initial_time> max_time=<final_time> dt=<timestep_size> crank_nicholson_weight=<between_0_and_1> \\n\"\n\t << \" output_base=<base_filename> output_dt=<output_timestep_size> [--use-petsc-dm --vi] \\n\"\n\t << \"\\n\"\n\t << argv[0] << \" --verbose \\n\"\n\t << \"is a pretty good start.\\n\"\n\t << \"\\nModeling a 1D system with 2D or 3D (for a strip the second and third components of the center are immaterial):\\n\"\n\t << argv[0]<< \" --verbose dim=1 N=1024 initial_state=strip initial_center=0.5 initial_width=0.1 dt=1e-10 max_time=1e-6\\n\"\n\t << argv[0]<< \" --verbose dim=2 N=64 initial_state=strip initial_center=0.5 initial_width=0.1 dt=1e-10 max_time=1e-6 \\n\"\n\t << argv[0]<< \" --verbose dim=3 N=32 initial_state=strip initial_center=0.5 initial_width=0.1 dt=1e-10 max_time=1e-6 \\n\"\n\t << \"\\n\"\n\t << \"Modeling a 2D system with 3D (for a rod the third component of the center is immaterial) \\n\"\n\t << argv[0]<< \" --verbose dim=2 N=64 initial_state=rod initial_center='0.5 0.5' initial_width=0.1 dt=1e-10 max_time=1e-6 \\n\"\n\t << argv[0]<< \" --verbose dim=3 N=32 initial_state=rod initial_center='0.5 0.5' initial_width=0.1 dt=1e-10 max_time=1e-6 \\n\"\n\t << \"\\n\"\n\t << \"A 3D system with an initial ball in the center\\n\"\n\t << argv[0] << \" --verbose dim=3 N=32 initial_state=ball initial_center='0.5 0.5 0.5' initial_width=0.1 dt=1e-10 max_time=1e-6 \\n\"\n\t << \"\\n\"\n\t << \"Add --use-petsc-dm --vi to run the variational inequality version that ensures the solution is between -1.0 and 1.0 at all times.\\n\\n\"\n\t << std::endl;\n}\n\n\n<commit_msg>Fix help on how to run the VI version.<commit_after>\/* The Next Great Finite Element Library. *\/\n\/* Copyright (C) 2003 Benjamin S. Kirk *\/\n\n\/* This library is free software; you can redistribute it and\/or *\/\n\/* modify it under the terms of the GNU Lesser General Public *\/\n\/* License as published by the Free Software Foundation; either *\/\n\/* version 2.1 of the License, or (at your option) any later version. *\/\n\n\/* This library is distributed in the hope that it will be useful, *\/\n\/* but WITHOUT ANY WARRANTY; without even the implied warranty of *\/\n\/* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU *\/\n\/* Lesser General Public License for more details. *\/\n\n\/* You should have received a copy of the GNU Lesser General Public *\/\n\/* License along with this library; if not, write to the Free Software *\/\n\/* Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA *\/\n\n\n\n\/\/ <h1>Miscellaneous Example 7 - Can use the PetscDMNonlinearSolver (available in PETSc-3.3.0 or above) to solve a VI version of the problem.<\/h1>\n\/\/\n\/\/ LibMesh interfaces directly with PETSc's variational inequality solver,\n\/\/ this example shows how to do it.\n\/\/ Author: Dmitry Karpeev, 2012\n\n\/\/ Example include files\n#include \"biharmonic.h\"\n\n\n\/\/ Bring in everything from the libMesh namespace\nusing namespace libMesh;\n\n\/\/ Print usage information if requested on command line\nvoid print_help(int argc, char** argv);\n\nint main(int argc, char** argv)\n{\n \/\/ Initialize libMesh.\n LibMeshInit init (argc, argv);\n if (on_command_line(\"--help\"))\n print_help(argc, argv);\n else\n {\n#if !defined(LIBMESH_ENABLE_SECOND_DERIVATIVES)\n libmesh_example_assert(false, \"--enable-second\");\n#elif !defined(LIBMESH_ENABLE_PERIODIC)\n libmesh_example_assert(false, \"--enable-periodic\");\n#endif\n\n \/\/ This is a PETSc-specific solver\n libmesh_example_assert(libMesh::default_solver_package() == PETSC_SOLVERS, \"--enable-petsc\");\n\n const int dim = command_line_value(\"dim\",1);\n\n \/\/ Skip higher-dimensional examples on a lower-dimensional libMesh build\n libmesh_example_assert(dim <= LIBMESH_DIM, \"2D\/3D support\");\n\n Biharmonic* biharmonic;\n Biharmonic::Create(&biharmonic);\n biharmonic->viewParameters();\n biharmonic->init();\n biharmonic->run();\n Biharmonic::Destroy(&biharmonic);\n }\n return 0;\n}\n\n\n\n\n\nvoid print_help(int, char** argv)\n{\n libMesh::out << \"This example solves the Cahn-Hillard equation with chemical potential f:\\n\"\n\t << \" u_t = \\\\div(M(u)\\\\grad f(u))\\n\"\n\t << \"Here we have\\n\"\n\t << \" u, -1 <= u <= 1 -- relative concentration (difference of two concentrations in a binary mixture) \\n\"\n\t << \" M, M >= 0 -- mobility of the mixture\\n\"\n\t << \" f = \\\\delta E\/\\\\delta u -- variational derivative of the free energy functional E\\n\"\n\t << \" E = \\\\int[\\\\kappa\/2 |\\\\grac u|^ + g(u)]\\n\"\n\t << \"where the gradient term is the interfacial energy density with \\\\kappa quantifying the energy of the interface,\\n\"\n\t << \"and g(u) is the bulk energy density\\n\"\n\t << \" g(u) = \\\\theta L(u) + \\\\theta_c W(u),\\n\"\n\t << \"L(u) is the (optional, in this model) logarithmic term corresponding to the entropy of the mixture:\\n\"\n\t << \" L(u) = (\\\\theta\/2)[(1+u)\\\\ln((1+u)\/2) + (1-u)\\\\ln((1-u)\/2)],\\n\"\n\t << \"where \\\\theta is related to the Boltzmann factor k_B T - a proxy for the absolute temperature T.\\n\"\n\t << \"L can be optionally approximated ('truncated') using a quadratic or a cubic polynomial on [-1,1]\\n\"\n\t << \"W(u) is the (optional, in this model) potential promoting demixing. It can take the form of \\n\"\n\t << \"a 'double well' potential\\n\"\n\t << \" W(u) = \\\\theta_c (u^4\/4 - u^2\/2),\\n\"\n\t << \" or \\n\"\n\t << \"a 'double obstacle' potential\\n\"\n\t << \" W(u) = (\\\\theta_c\/2)(1-u^2),\\n\"\n\t << \"where \\\\theta_c is the critical 'temperature'.\\n\"\n\t << \"Finally, mobility M can be constant of 'degenerate', by which we mean that M is varying with u and \\n\"\n\t << \"vanishing (degenerating) whenever u reaches critical values +1 or -1:\\n\"\n\t << \" M(u) = 1.0\\n\"\n\t << \" or\\n\"\n\t << \" M(u) = (1.0 - u^2)\\n\"\n\t << \"Degenerate mobility should generally be used only in conjunction with logarithmic free energy terms.\\n\\n\"\n\t << \"The equation is solved on a periodic domain (in 1D, 2D or 3D)\\n\"\n\t << \"using a Galerkin formulation with C^1 elements approximating the H^2_{per} function space.\\n\\n\"\n\t << \"\\n-----------\\n\"\n\t << \"COMPILING: \"\n\t << \"\\n-----------\\n\"\n\t << \"Compile as follows (assuming libmesh has been built): \\n\"\n\t << \"METHOD=<method> make \\n\"\n\t << \"where <method> is dbg or opt.\\n\"\n\t << \"\\n-----------\\n\"\n\t << \"HELP: \"\n\t << \"\\n-----------\\n\"\n\t << \"Print this help message:\\n\"\n\t << argv[0] << \" --help\\n\"\n\t << \"\\n-----------\\n\"\n\t << \"RUNNING: \"\n\t << \"\\n-----------\\n\"\n\t << \"Run in serial with build METHOD <method> as follows:\\n\"\n\t << \"\\n\"\n\t << argv[0] << \"\\n\"\n\t << \" [--verbose] dim=<1|2|3> N=<number_of_linear_elements> \\n\"\n\t << \" kappa=<kappa_value> growth=<yes|no> degenerate=<yes|no> [--cahn-hillard] \\n\"\n\t << \" [--netforce] energy=<double_well|double_obstacle|log_double_well|log_double_obstacle> log_truncation_order=<2|3> \\n\"\n\t << \" theta=<theta_value> theta_c=<theta_c_value> \\n\"\n\t << \" initial_state=<ball|rod|strip> initial_center='x [y [z]]' initial_width=<width> \\n\"\n\t << \" min_time=<initial_time> max_time=<final_time> dt=<timestep_size> crank_nicholson_weight=<between_0_and_1> \\n\"\n\t << \" output_base=<base_filename> output_dt=<output_timestep_size> [--use-petsc-dm -snes_type virs] \\n\"\n\t << \"\\n\"\n\t << argv[0] << \" --verbose \\n\"\n\t << \"is a pretty good start.\\n\"\n\t << \"\\nModeling a 1D system with 2D or 3D (for a strip the second and third components of the center are immaterial):\\n\"\n\t << argv[0]<< \" --verbose dim=1 N=1024 initial_state=strip initial_center=0.5 initial_width=0.1 dt=1e-10 max_time=1e-6\\n\"\n\t << argv[0]<< \" --verbose dim=2 N=64 initial_state=strip initial_center=0.5 initial_width=0.1 dt=1e-10 max_time=1e-6 \\n\"\n\t << argv[0]<< \" --verbose dim=3 N=32 initial_state=strip initial_center=0.5 initial_width=0.1 dt=1e-10 max_time=1e-6 \\n\"\n\t << \"\\n\"\n\t << \"Modeling a 2D system with 3D (for a rod the third component of the center is immaterial) \\n\"\n\t << argv[0]<< \" --verbose dim=2 N=64 initial_state=rod initial_center='0.5 0.5' initial_width=0.1 dt=1e-10 max_time=1e-6 \\n\"\n\t << argv[0]<< \" --verbose dim=3 N=32 initial_state=rod initial_center='0.5 0.5' initial_width=0.1 dt=1e-10 max_time=1e-6 \\n\"\n\t << \"\\n\"\n\t << \"A 3D system with an initial ball in the center\\n\"\n\t << argv[0] << \" --verbose dim=3 N=32 initial_state=ball initial_center='0.5 0.5 0.5' initial_width=0.1 dt=1e-10 max_time=1e-6 \\n\"\n\t << \"\\n\"\n\t << \"Add --use-petsc-dm -snes_type virs to run the variational inequality version that ensures the solution is between -1.0 and 1.0 at all times.\\n\\n\"\n\t << std::endl;\n}\n\n\n<|endoftext|>"} {"text":"<commit_before>#include \"Window.h\"\n\n#include <QtGui>\n\n#include \"ui_MainWindow.h\"\n\n#if defined Q_OS_MAC\n#include \"..\/OSXLocal.h\"\n#endif\n\n#include \"..\/Settings.h\"\n\nWindow::Window()\n : mUI( new Ui::MainWindow )\n{\n mUI->setupUi( this );\n setWindowFlags( (Qt::Window | Qt::CustomizeWindowHint | Qt::WindowCloseButtonHint | Qt::MSWindowsFixedSizeDialogHint) );\n\n setWindowTitle( qApp->applicationName() );\n\n CreateActions();\n CreateTrayIcon();\n\n connect( mTrayIcon, SIGNAL( activated(QSystemTrayIcon::ActivationReason) ), this, SLOT( TrayIconActivated(QSystemTrayIcon::ActivationReason) ) );\n\n QActionGroup *group = new QActionGroup( this );\n group->setExclusive( true );\n\n mUI->actionSettings->setActionGroup( group );\n mUI->actionSettings->setProperty( \"pageIndex\", 0 );\n\n mUI->actionAccount->setActionGroup( group );\n mUI->actionAccount->setProperty( \"pageIndex\", 1 );\n\n mUI->actionLog->setActionGroup( group );\n mUI->actionLog->setProperty( \"pageIndex\", 2 );\n\n mUI->actionAbout->setActionGroup( group );\n mUI->actionAbout->setProperty( \"pageIndex\", 3 );\n\n mUI->pageWidget->setCurrentIndex( 0 );\n mUI->actionSettings->setChecked( true );\n TabChanged( 0 );\n\n connect( group, SIGNAL( triggered(QAction*) ), this, SLOT( ActionTriggered(QAction*) ) );\n connect( mUI->pageWidget, SIGNAL( currentChanged(int) ), this, SLOT( TabChanged( int ) ) );\n\n QTimer::singleShot( 1000, this, SLOT(HandleFirstStartCheck()) );\n}\n\nWindow::~Window() {\n delete mUI;\n}\n\nvoid Window::ActionTriggered( QAction *action ) {\n int page = action->property( \"pageIndex\" ).toInt();\n mUI->pageWidget->setCurrentIndex( page );\n}\n\nvoid Window::TabChanged( int index ) {\n QWidget *widget = mUI->pageWidget->widget( index );\n mUI->pageWidget->setFixedHeight( widget->minimumHeight() );\n adjustSize();\n}\n\nvoid Window::ShowNotification( const char *title, const char *message ) {\n#if defined Q_OS_WIN || defined Q_WS_X11 || defined Q_OS_LINUX\n mTrayIcon->showMessage( title, message );\n#elif defined Q_OS_MAC\n OSX_ShowNotification( title, message );\n#endif\n}\n\nvoid Window::HandleFirstStartCheck() {\n \/\/ Notify user the first time that the app runs in the taskbar\n QSettings settings;\n if( !settings.contains(\"taskbarHint\") ) {\n settings.setValue( \"taskbarHint\", true );\n#if defined Q_OS_WIN || defined Q_WS_X11 || defined Q_OS_LINUX\n ShowNotification( \"Heads up!\", \"Track-o-Bot runs in your taskbar! Right click the icon for more options.\" );\n#elif defined Q_OS_MAC\n ShowNotification( \"Track-o-Bot\", \"Track-o-Bot runs in your menu bar! Click the icon for more options.\" );\n#endif\n }\n}\n\nvoid Window::TrayIconActivated( QSystemTrayIcon::ActivationReason reason ) {\n#ifdef Q_OS_WIN\n if( reason == QSystemTrayIcon::ActivationReason::DoubleClick ) {\n OpenProfileRequested();\n }\n#elif defined Q_WS_X11 || defined Q_OS_LINUX \nif( reason == QSystemTrayIcon::DoubleClick ) {\n OpenProfileRequested();\n}\nelse if( reason == QSystemTrayIcon::Trigger ) {\n RiseAndShine();\n}\n#else\n UNUSED_ARG( reason );\n#endif\n}\n\nvoid Window::closeEvent( QCloseEvent *event ) {\n if( mTrayIcon->isVisible() ) {\n hide();\n event->ignore();\n }\n}\n\nvoid Window::CreateActions() {\n mOpenProfileAction = new QAction( tr( \"Open Profile...\" ), this );\n connect( mOpenProfileAction, SIGNAL( triggered() ), this, SLOT( OpenProfileRequested() ) );\n\n mShowAction = new QAction( tr( \"Settings...\" ), this );\n connect( mShowAction, SIGNAL( triggered() ), this, SLOT( RiseAndShine() ) );\n\n mQuitAction = new QAction( tr(\"Quit\"), this );\n connect( mQuitAction, SIGNAL( triggered() ), qApp, SLOT( quit() ) );\n\n mGameClientRestartRequiredAction = new QAction( tr(\"Please restart Hearthstone!\" ), this );\n mGameClientRestartRequiredAction->setEnabled( false );\n}\n\nvoid Window::CreateTrayIcon() {\n mTrayIconMenu = new QMenu( this);\n mTrayIconMenu->addAction( mOpenProfileAction );\n mTrayIconMenu->addSeparator();\n mTrayIconMenu->addAction( mShowAction );\n mTrayIconMenu->addSeparator();\n mTrayIconMenu->addAction( mQuitAction );\n\n mTrayIcon = new QSystemTrayIcon( this );\n mTrayIcon->setContextMenu (mTrayIconMenu );\n\n#if defined Q_OS_MAC\n QIcon::Mode blackMode = QIcon::Normal;\n QIcon::Mode whiteMode = QIcon::Selected;\n if( OSX_YosemiteDarkModeEnabled() ) {\n blackMode = QIcon::Disabled;\n whiteMode = QIcon::Normal;\n }\n\n QIcon icon;\n icon.addFile( \":\/icons\/mac_black@2x.png\", QSize(), blackMode );\n icon.addFile( \":\/icons\/mac_black.png\", QSize(), blackMode );\n icon.addFile( \":\/icons\/mac_white.png\", QSize(), whiteMode );\n icon.addFile( \":\/icons\/mac_white@2x.png\", QSize(), whiteMode );\n#elif defined Q_OS_WIN\n QIcon icon = QIcon( \":\/icons\/win.ico\" );\n#elif defined Q_WS_X11 || defined Q_OS_LINUX \n QIcon icon = QIcon( \":\/icons\/Track-o-Bot.png\" );\n icon.addFile( \":\/icons\/logo.png\", QSize(), QIcon::Active );\n#endif\n\n mTrayIcon->setIcon( icon );\n mTrayIcon->show();\n}\n\nvoid Window::RiseAndShine() {\n show();\n raise();\n}\n\nvoid Window::OpenProfileRequested() {\n emit OpenProfile();\n}\n\nvoid Window::HandleGameClientRestartRequired( bool restartRequired ) {\n static QAction *separator = NULL;\n\n if( restartRequired ) {\n separator = mTrayIconMenu->insertSeparator( mOpenProfileAction );\n mTrayIconMenu->insertAction( separator, mGameClientRestartRequiredAction );\n\n ShowNotification( \"Game log updated\", \"Please restart Hearthstone for changes to take effect!\" );\n } else {\n mTrayIconMenu->removeAction( mGameClientRestartRequiredAction );\n if( separator ) {\n mTrayIconMenu->removeAction( separator );\n }\n }\n}\n<commit_msg>tray icon for Linux<commit_after>#include \"Window.h\"\n\n#include <QtGui>\n\n#include \"ui_MainWindow.h\"\n\n#if defined Q_OS_MAC\n#include \"..\/OSXLocal.h\"\n#endif\n\n#include \"..\/Settings.h\"\n\nWindow::Window()\n : mUI( new Ui::MainWindow )\n{\n mUI->setupUi( this );\n setWindowFlags( (Qt::Window | Qt::CustomizeWindowHint | Qt::WindowCloseButtonHint | Qt::MSWindowsFixedSizeDialogHint) );\n\n setWindowTitle( qApp->applicationName() );\n\n CreateActions();\n CreateTrayIcon();\n\n connect( mTrayIcon, SIGNAL( activated(QSystemTrayIcon::ActivationReason) ), this, SLOT( TrayIconActivated(QSystemTrayIcon::ActivationReason) ) );\n\n QActionGroup *group = new QActionGroup( this );\n group->setExclusive( true );\n\n mUI->actionSettings->setActionGroup( group );\n mUI->actionSettings->setProperty( \"pageIndex\", 0 );\n\n mUI->actionAccount->setActionGroup( group );\n mUI->actionAccount->setProperty( \"pageIndex\", 1 );\n\n mUI->actionLog->setActionGroup( group );\n mUI->actionLog->setProperty( \"pageIndex\", 2 );\n\n mUI->actionAbout->setActionGroup( group );\n mUI->actionAbout->setProperty( \"pageIndex\", 3 );\n\n mUI->pageWidget->setCurrentIndex( 0 );\n mUI->actionSettings->setChecked( true );\n TabChanged( 0 );\n\n connect( group, SIGNAL( triggered(QAction*) ), this, SLOT( ActionTriggered(QAction*) ) );\n connect( mUI->pageWidget, SIGNAL( currentChanged(int) ), this, SLOT( TabChanged( int ) ) );\n\n QTimer::singleShot( 1000, this, SLOT(HandleFirstStartCheck()) );\n}\n\nWindow::~Window() {\n delete mUI;\n}\n\nvoid Window::ActionTriggered( QAction *action ) {\n int page = action->property( \"pageIndex\" ).toInt();\n mUI->pageWidget->setCurrentIndex( page );\n}\n\nvoid Window::TabChanged( int index ) {\n QWidget *widget = mUI->pageWidget->widget( index );\n mUI->pageWidget->setFixedHeight( widget->minimumHeight() );\n adjustSize();\n}\n\nvoid Window::ShowNotification( const char *title, const char *message ) {\n#if defined Q_OS_WIN || defined Q_WS_X11 || defined Q_OS_LINUX\n mTrayIcon->showMessage( title, message );\n#elif defined Q_OS_MAC\n OSX_ShowNotification( title, message );\n#endif\n}\n\nvoid Window::HandleFirstStartCheck() {\n \/\/ Notify user the first time that the app runs in the taskbar\n QSettings settings;\n if( !settings.contains(\"taskbarHint\") ) {\n settings.setValue( \"taskbarHint\", true );\n#if defined Q_OS_WIN || defined Q_WS_X11 || defined Q_OS_LINUX\n ShowNotification( \"Heads up!\", \"Track-o-Bot runs in your taskbar! Right click the icon for more options.\" );\n#elif defined Q_OS_MAC\n ShowNotification( \"Track-o-Bot\", \"Track-o-Bot runs in your menu bar! Click the icon for more options.\" );\n#endif\n }\n}\n\nvoid Window::TrayIconActivated( QSystemTrayIcon::ActivationReason reason ) {\n#ifdef Q_OS_WIN\n if( reason == QSystemTrayIcon::ActivationReason::DoubleClick ) {\n OpenProfileRequested();\n }\n#elif defined Q_WS_X11 || defined Q_OS_LINUX \nif( reason == QSystemTrayIcon::DoubleClick ) {\n OpenProfileRequested();\n}\nelse if( reason == QSystemTrayIcon::Trigger ) {\n RiseAndShine();\n}\n#else\n UNUSED_ARG( reason );\n#endif\n}\n\nvoid Window::closeEvent( QCloseEvent *event ) {\n if( mTrayIcon->isVisible() ) {\n hide();\n event->ignore();\n }\n}\n\nvoid Window::CreateActions() {\n mOpenProfileAction = new QAction( tr( \"Open Profile...\" ), this );\n connect( mOpenProfileAction, SIGNAL( triggered() ), this, SLOT( OpenProfileRequested() ) );\n\n mShowAction = new QAction( tr( \"Settings...\" ), this );\n connect( mShowAction, SIGNAL( triggered() ), this, SLOT( RiseAndShine() ) );\n\n mQuitAction = new QAction( tr(\"Quit\"), this );\n connect( mQuitAction, SIGNAL( triggered() ), qApp, SLOT( quit() ) );\n\n mGameClientRestartRequiredAction = new QAction( tr(\"Please restart Hearthstone!\" ), this );\n mGameClientRestartRequiredAction->setEnabled( false );\n}\n\nvoid Window::CreateTrayIcon() {\n mTrayIconMenu = new QMenu( this);\n mTrayIconMenu->addAction( mOpenProfileAction );\n mTrayIconMenu->addSeparator();\n mTrayIconMenu->addAction( mShowAction );\n mTrayIconMenu->addSeparator();\n mTrayIconMenu->addAction( mQuitAction );\n\n mTrayIcon = new QSystemTrayIcon( this );\n mTrayIcon->setContextMenu (mTrayIconMenu );\n\n#if defined Q_OS_MAC\n QIcon::Mode blackMode = QIcon::Normal;\n QIcon::Mode whiteMode = QIcon::Selected;\n if( OSX_YosemiteDarkModeEnabled() ) {\n blackMode = QIcon::Disabled;\n whiteMode = QIcon::Normal;\n }\n\n QIcon icon;\n icon.addFile( \":\/icons\/mac_black@2x.png\", QSize(), blackMode );\n icon.addFile( \":\/icons\/mac_black.png\", QSize(), blackMode );\n icon.addFile( \":\/icons\/mac_white.png\", QSize(), whiteMode );\n icon.addFile( \":\/icons\/mac_white@2x.png\", QSize(), whiteMode );\n#elif defined Q_OS_WIN\n QIcon icon = QIcon( \":\/icons\/win.ico\" );\n#elif defined Q_WS_X11 || defined Q_OS_LINUX \n QIcon icon = QIcon( \":\/icons\/Track-o-Bot.png\" );\n icon.addFile( \":\/icons\/logo.png\", QSize() );\n#endif\n\n mTrayIcon->setIcon( icon );\n mTrayIcon->show();\n}\n\nvoid Window::RiseAndShine() {\n show();\n raise();\n}\n\nvoid Window::OpenProfileRequested() {\n emit OpenProfile();\n}\n\nvoid Window::HandleGameClientRestartRequired( bool restartRequired ) {\n static QAction *separator = NULL;\n\n if( restartRequired ) {\n separator = mTrayIconMenu->insertSeparator( mOpenProfileAction );\n mTrayIconMenu->insertAction( separator, mGameClientRestartRequiredAction );\n\n ShowNotification( \"Game log updated\", \"Please restart Hearthstone for changes to take effect!\" );\n } else {\n mTrayIconMenu->removeAction( mGameClientRestartRequiredAction );\n if( separator ) {\n mTrayIconMenu->removeAction( separator );\n }\n }\n}\n<|endoftext|>"} {"text":"<commit_before>#pragma once\n\n#include \"generator\/osm2type.hpp\"\n#include \"generator\/xml_element.hpp\"\n#include \"generator\/feature_builder.hpp\"\n#include \"generator\/ways_merger.hpp\"\n\n#include \"indexer\/ftypes_matcher.hpp\"\n#include \"indexer\/feature_visibility.hpp\"\n#include \"indexer\/classificator.hpp\"\n\n#include \"geometry\/tree4d.hpp\"\n\n#include \"base\/string_utils.hpp\"\n#include \"base\/logging.hpp\"\n#include \"base\/stl_add.hpp\"\n#include \"base\/cache.hpp\"\n\n#include \"std\/unordered_set.hpp\"\n#include \"std\/list.hpp\"\n\n\n\/\/\/ @param TEmitter Feature accumulating policy\n\/\/\/ @param THolder Nodes, ways, relations holder\ntemplate <class TEmitter, class THolder>\nclass SecondPassParser : public BaseOSMParser\n{\n TEmitter & m_emitter;\n THolder & m_holder;\n\n\n bool GetPoint(uint64_t id, m2::PointD & pt) const\n {\n return m_holder.GetNode(id, pt.y, pt.x);\n }\n\n typedef vector<m2::PointD> pts_vec_t;\n typedef list<pts_vec_t> holes_list_t;\n\n class holes_accumulator\n {\n AreaWayMerger<THolder> m_merger;\n holes_list_t m_holes;\n\n public:\n holes_accumulator(SecondPassParser * pMain) : m_merger(pMain->m_holder) {}\n\n void operator() (uint64_t id)\n {\n m_merger.AddWay(id);\n }\n\n void operator() (pts_vec_t & v, vector<uint64_t> const &)\n {\n m_holes.push_back(pts_vec_t());\n m_holes.back().swap(v);\n }\n\n holes_list_t & GetHoles()\n {\n ASSERT ( m_holes.empty(), (\"Can call only once\") );\n m_merger.ForEachArea(*this, false);\n return m_holes;\n }\n };\n\n \/\/\/ Find holes for way with 'id' in first relation.\n class multipolygon_holes_processor\n {\n uint64_t m_id; \/\/\/< id of way to find it's holes\n holes_accumulator m_holes;\n\n public:\n multipolygon_holes_processor(uint64_t id, SecondPassParser * pMain)\n : m_id(id), m_holes(pMain)\n {\n }\n\n \/\/\/ 1. relations process function\n bool operator() (uint64_t \/*id*\/, RelationElement const & e)\n {\n if (e.GetType() == \"multipolygon\")\n {\n string role;\n if (e.FindWay(m_id, role) && (role == \"outer\"))\n {\n e.ForEachWay(*this);\n \/\/ stop processing (??? assume that \"outer way\" exists in one relation only ???)\n return true;\n }\n }\n return false;\n }\n\n \/\/\/ 2. \"ways in relation\" process function\n void operator() (uint64_t id, string const & role)\n {\n if (id != m_id && role == \"inner\")\n m_holes(id);\n }\n\n holes_list_t & GetHoles() { return m_holes.GetHoles(); }\n };\n\n \/\/\/ Generated features should include parent relation tags to make\n \/\/\/ full types matching and storing any additional info.\n class RelationTagsProcessor\n {\n uint64_t m_featureID;\n XMLElement * m_current;\n\n my::Cache<uint64_t, RelationElement> m_cache;\n\n bool IsAcceptBoundary(RelationElement const & e) const\n {\n string role;\n CHECK(e.FindWay(m_featureID, role), (m_featureID));\n\n \/\/ Do not accumulate boundary types (boundary=administrative) for inner polygons.\n \/\/ Example: Minsk city border (admin_level=8) is inner for Minsk area border (admin_level=4).\n return (role != \"inner\");\n }\n\n typedef unordered_set<string> NameKeysT;\n void GetNameKeys(NameKeysT & keys) const\n {\n for (auto const & p : m_current->childs)\n if (p.tagKey == XMLElement::ET_TAG)\n {\n if (strings::StartsWith(p.k, \"name\"))\n keys.insert(p.k);\n }\n }\n\n void Process(RelationElement const & e)\n {\n string const type = e.GetType();\n\n \/\/\/ @todo Skip special relation types.\n if (type == \"multipolygon\" ||\n type == \"route\" ||\n type == \"bridge\" ||\n type == \"restriction\")\n {\n return;\n }\n\n bool const isWay = (m_current->tagKey == XMLElement::ET_WAY);\n bool const isBoundary = isWay && (type == \"boundary\") && IsAcceptBoundary(e);\n\n NameKeysT nameKeys;\n GetNameKeys(nameKeys);\n\n for (auto const & p : e.tags)\n {\n \/\/\/ @todo Skip common key tags.\n if (p.first == \"type\" || p.first == \"route\")\n continue;\n\n \/\/\/ Skip already existing \"name\" tags.\n if (nameKeys.count(p.first) != 0)\n continue;\n\n if (!isBoundary && p.first == \"boundary\")\n continue;\n\n if (isWay && p.first == \"place\")\n continue;\n\n m_current->AddKV(p.first, p.second);\n }\n }\n\n public:\n RelationTagsProcessor()\n : m_cache(14)\n {\n }\n\n void Reset(uint64_t fID, XMLElement * p)\n {\n m_featureID = fID;\n m_current = p;\n }\n\n template <class ReaderT> bool operator() (uint64_t id, ReaderT & reader)\n {\n bool exists = false;\n RelationElement & e = m_cache.Find(id, exists);\n if (!exists)\n CHECK(reader.Read(id, e), (id));\n\n Process(e);\n return false;\n }\n\n } m_relationsProcess;\n\n bool ParseType(XMLElement * p, FeatureParams & params)\n {\n \/\/ Get tags from parent relations.\n m_relationsProcess.Reset(p->id, p);\n\n if (p->tagKey == XMLElement::ET_NODE)\n {\n \/\/ additional process of nodes ONLY if there is no native types\n FeatureParams fp;\n ftype::GetNameAndType(p, fp);\n if (!ftype::IsValidTypes(fp))\n m_holder.ForEachRelationByNodeCached(p->id, m_relationsProcess);\n }\n else if (p->tagKey == XMLElement::ET_WAY)\n {\n \/\/ always make additional process of ways\n m_holder.ForEachRelationByWayCached(p->id, m_relationsProcess);\n }\n\n \/\/ Get params from element tags.\n ftype::GetNameAndType(p, params);\n params.FinishAddingTypes();\n return ftype::IsValidTypes(params);\n }\n\n typedef FeatureBuilder1 FeatureBuilderT;\n\n class multipolygons_emitter\n {\n SecondPassParser * m_pMain;\n FeatureParams const & m_params;\n holes_list_t & m_holes;\n uint64_t m_relID;\n\n public:\n multipolygons_emitter(SecondPassParser * pMain,\n FeatureParams const & params,\n holes_list_t & holes,\n uint64_t relID)\n : m_pMain(pMain), m_params(params), m_holes(holes), m_relID(relID)\n {\n }\n\n void operator() (pts_vec_t const & pts, vector<uint64_t> const & ids)\n {\n FeatureBuilderT ft;\n\n for (size_t i = 0; i < ids.size(); ++i)\n ft.AddOsmId(osm::Id::Way(ids[i]));\n\n for (size_t i = 0; i < pts.size(); ++i)\n ft.AddPoint(pts[i]);\n\n ft.AddOsmId(osm::Id::Relation(m_relID));\n m_pMain->EmitArea(ft, m_params, [this] (FeatureBuilderT & ft)\n {\n ft.SetAreaAddHoles(m_holes);\n });\n }\n };\n\n uint32_t m_coastType;\n\n unique_ptr<FileWriter> m_addrWriter;\n bool NeedWriteAddress(FeatureParams const & params) const\n {\n return m_addrWriter && ftypes::IsBuildingChecker::Instance()(params.m_Types);\n }\n\n class Place\n {\n FeatureBuilderT m_ft;\n m2::PointD m_pt;\n uint32_t m_type;\n\n static constexpr double EQUAL_PLACE_SEARCH_RADIUS_M = 20000.0;\n\n bool IsPoint() const { return (m_ft.GetGeomType() == feature::GEOM_POINT); }\n\n public:\n Place(FeatureBuilderT const & ft, uint32_t type)\n : m_ft(ft), m_pt(ft.GetKeyPoint()), m_type(type)\n {\n }\n\n FeatureBuilderT const & GetFeature() const { return m_ft; }\n\n m2::RectD GetLimitRect() const\n {\n return MercatorBounds::RectByCenterXYAndSizeInMeters(m_pt, EQUAL_PLACE_SEARCH_RADIUS_M);\n }\n\n \/\/\/ @name Always replace point features and leave area features.\n \/\/@{\n bool IsEqual(Place const & r) const\n {\n return (m_type == r.m_type &&\n m_ft.GetName() == r.m_ft.GetName() &&\n (IsPoint() || r.IsPoint()) &&\n MercatorBounds::DistanceOnEarth(m_pt, r.m_pt) < EQUAL_PLACE_SEARCH_RADIUS_M);\n }\n\n bool NeedReplace(Place const & r) const\n {\n return (r.IsPoint() && (!IsPoint() || r.m_ft.GetRank() < m_ft.GetRank()));\n }\n \/\/@}\n };\n\n m4::Tree<Place> m_places;\n\n void EmitFeatureBase(FeatureBuilderT & ft, FeatureParams const & params)\n {\n ft.SetParams(params);\n if (ft.PreSerialize())\n {\n string addr;\n if (NeedWriteAddress(params) && ft.FormatFullAddress(addr))\n m_addrWriter->Write(addr.c_str(), addr.size());\n\n static uint32_t const placeType = classif().GetTypeByPath({\"place\"});\n uint32_t const type = params.FindType(placeType, 1);\n\n if (type != ftype::GetEmptyValue() && !ft.GetName().empty())\n {\n m_places.ReplaceEqualInRect(Place(ft, type),\n bind(&Place::IsEqual, _1, _2),\n bind(&Place::NeedReplace, _1, _2));\n }\n else\n m_emitter(ft);\n }\n }\n\n \/\/\/ @param[in] params Pass by value because it can be modified.\n \/\/@{\n void EmitPoint(m2::PointD const & pt, FeatureParams params, osm::Id id)\n {\n if (feature::RemoveNoDrawableTypes(params.m_Types, feature::GEOM_POINT))\n {\n FeatureBuilderT ft;\n ft.SetCenter(pt);\n ft.SetOsmId(id);\n EmitFeatureBase(ft, params);\n }\n }\n\n void EmitLine(FeatureBuilderT & ft, FeatureParams params, bool isCoastLine)\n {\n if (isCoastLine || feature::RemoveNoDrawableTypes(params.m_Types, feature::GEOM_LINE))\n {\n ft.SetLinear(params.m_reverseGeometry);\n EmitFeatureBase(ft, params);\n }\n }\n\n template <class MakeFnT>\n void EmitArea(FeatureBuilderT & ft, FeatureParams params, MakeFnT makeFn)\n {\n using namespace feature;\n\n \/\/ Ensure that we have closed area geometry.\n if (ft.IsGeometryClosed())\n {\n \/\/ Key point here is that IsDrawableLike and RemoveNoDrawableTypes\n \/\/ work a bit different for GEOM_AREA.\n\n if (IsDrawableLike(params.m_Types, GEOM_AREA))\n {\n \/\/ Make the area feature if it has unique area styles.\n VERIFY(RemoveNoDrawableTypes(params.m_Types, GEOM_AREA), (params));\n\n makeFn(ft);\n\n EmitFeatureBase(ft, params);\n }\n else\n {\n \/\/ Try to make the point feature if it has point styles.\n EmitPoint(ft.GetGeometryCenter(), params, ft.GetLastOsmId());\n }\n }\n }\n \/\/@}\n\npublic:\n \/\/\/ The main entry point for parsing process.\n virtual void EmitElement(XMLElement * p)\n {\n FeatureParams params;\n if (!ParseType(p, params))\n return;\n\n if (p->tagKey == XMLElement::ET_NODE)\n {\n m2::PointD pt;\n if (p->childs.empty() || !GetPoint(p->id, pt))\n return;\n\n EmitPoint(pt, params, osm::Id::Node(p->id));\n }\n else if (p->tagKey == XMLElement::ET_WAY)\n {\n FeatureBuilderT ft;\n\n \/\/ Parse geometry.\n for (auto const & e : p->childs)\n {\n if (e.tagKey == XMLElement::ET_ND)\n {\n m2::PointD pt;\n if (!GetPoint(e.ref, pt))\n return;\n\n ft.AddPoint(pt);\n }\n }\n\n if (ft.GetPointsCount() < 2)\n return;\n\n ft.SetOsmId(osm::Id::Way(p->id));\n bool isCoastLine = (m_coastType != 0 && params.IsTypeExist(m_coastType));\n\n EmitArea(ft, params, [&] (FeatureBuilderT & ft)\n {\n isCoastLine = false; \/\/ emit coastline feature only once\n multipolygon_holes_processor processor(p->id, this);\n m_holder.ForEachRelationByWay(p->id, processor);\n ft.SetAreaAddHoles(processor.GetHoles());\n });\n\n EmitLine(ft, params, isCoastLine);\n }\n else if (p->tagKey == XMLElement::ET_RELATION)\n {\n {\n \/\/ 1. Check, if this is our processable relation. Here we process only polygon relations.\n size_t i = 0;\n size_t const count = p->childs.size();\n for (; i < count; ++i)\n {\n if (p->childs[i].tagKey == XMLElement::ET_TAG &&\n p->childs[i].k == \"type\" &&\n p->childs[i].v == \"multipolygon\")\n {\n break;\n }\n }\n if (i == count)\n return;\n }\n\n holes_accumulator holes(this);\n AreaWayMerger<THolder> outer(m_holder);\n\n \/\/ 3. Iterate ways to get 'outer' and 'inner' geometries\n for (auto const & e : p->childs)\n {\n if (e.tagKey == XMLElement::ET_MEMBER && e.type == \"way\")\n {\n if (e.role == \"outer\")\n outer.AddWay(e.ref);\n else if (e.role == \"inner\")\n holes(e.ref);\n }\n }\n\n multipolygons_emitter emitter(this, params, holes.GetHoles(), p->id);\n outer.ForEachArea(emitter, true);\n }\n }\n\npublic:\n SecondPassParser(TEmitter & emitter, THolder & holder,\n uint32_t coastType, string const & addrFilePath)\n : m_emitter(emitter), m_holder(holder), m_coastType(coastType)\n {\n if (!addrFilePath.empty())\n m_addrWriter.reset(new FileWriter(addrFilePath));\n }\n\n void Finish()\n {\n m_places.ForEach([this] (Place const & p)\n {\n m_emitter(p.GetFeature());\n });\n }\n};\n<commit_msg>[generator] Better “place-XXX” filtering according to the classificator type.<commit_after>#pragma once\n\n#include \"generator\/osm2type.hpp\"\n#include \"generator\/xml_element.hpp\"\n#include \"generator\/feature_builder.hpp\"\n#include \"generator\/ways_merger.hpp\"\n\n#include \"indexer\/ftypes_matcher.hpp\"\n#include \"indexer\/feature_visibility.hpp\"\n#include \"indexer\/classificator.hpp\"\n\n#include \"geometry\/tree4d.hpp\"\n\n#include \"base\/string_utils.hpp\"\n#include \"base\/logging.hpp\"\n#include \"base\/stl_add.hpp\"\n#include \"base\/cache.hpp\"\n\n#include \"std\/unordered_set.hpp\"\n#include \"std\/list.hpp\"\n\n\n\/\/\/ @param TEmitter Feature accumulating policy\n\/\/\/ @param THolder Nodes, ways, relations holder\ntemplate <class TEmitter, class THolder>\nclass SecondPassParser : public BaseOSMParser\n{\n TEmitter & m_emitter;\n THolder & m_holder;\n\n\n bool GetPoint(uint64_t id, m2::PointD & pt) const\n {\n return m_holder.GetNode(id, pt.y, pt.x);\n }\n\n typedef vector<m2::PointD> pts_vec_t;\n typedef list<pts_vec_t> holes_list_t;\n\n class holes_accumulator\n {\n AreaWayMerger<THolder> m_merger;\n holes_list_t m_holes;\n\n public:\n holes_accumulator(SecondPassParser * pMain) : m_merger(pMain->m_holder) {}\n\n void operator() (uint64_t id)\n {\n m_merger.AddWay(id);\n }\n\n void operator() (pts_vec_t & v, vector<uint64_t> const &)\n {\n m_holes.push_back(pts_vec_t());\n m_holes.back().swap(v);\n }\n\n holes_list_t & GetHoles()\n {\n ASSERT ( m_holes.empty(), (\"Can call only once\") );\n m_merger.ForEachArea(*this, false);\n return m_holes;\n }\n };\n\n \/\/\/ Find holes for way with 'id' in first relation.\n class multipolygon_holes_processor\n {\n uint64_t m_id; \/\/\/< id of way to find it's holes\n holes_accumulator m_holes;\n\n public:\n multipolygon_holes_processor(uint64_t id, SecondPassParser * pMain)\n : m_id(id), m_holes(pMain)\n {\n }\n\n \/\/\/ 1. relations process function\n bool operator() (uint64_t \/*id*\/, RelationElement const & e)\n {\n if (e.GetType() == \"multipolygon\")\n {\n string role;\n if (e.FindWay(m_id, role) && (role == \"outer\"))\n {\n e.ForEachWay(*this);\n \/\/ stop processing (??? assume that \"outer way\" exists in one relation only ???)\n return true;\n }\n }\n return false;\n }\n\n \/\/\/ 2. \"ways in relation\" process function\n void operator() (uint64_t id, string const & role)\n {\n if (id != m_id && role == \"inner\")\n m_holes(id);\n }\n\n holes_list_t & GetHoles() { return m_holes.GetHoles(); }\n };\n\n \/\/\/ Generated features should include parent relation tags to make\n \/\/\/ full types matching and storing any additional info.\n class RelationTagsProcessor\n {\n uint64_t m_featureID;\n XMLElement * m_current;\n\n my::Cache<uint64_t, RelationElement> m_cache;\n\n bool IsAcceptBoundary(RelationElement const & e) const\n {\n string role;\n CHECK(e.FindWay(m_featureID, role), (m_featureID));\n\n \/\/ Do not accumulate boundary types (boundary=administrative) for inner polygons.\n \/\/ Example: Minsk city border (admin_level=8) is inner for Minsk area border (admin_level=4).\n return (role != \"inner\");\n }\n\n typedef unordered_set<string> NameKeysT;\n void GetNameKeys(NameKeysT & keys) const\n {\n for (auto const & p : m_current->childs)\n if (p.tagKey == XMLElement::ET_TAG)\n {\n if (strings::StartsWith(p.k, \"name\"))\n keys.insert(p.k);\n }\n }\n\n void Process(RelationElement const & e)\n {\n string const type = e.GetType();\n\n \/\/\/ @todo Skip special relation types.\n if (type == \"multipolygon\" ||\n type == \"route\" ||\n type == \"bridge\" ||\n type == \"restriction\")\n {\n return;\n }\n\n bool const isWay = (m_current->tagKey == XMLElement::ET_WAY);\n bool const isBoundary = isWay && (type == \"boundary\") && IsAcceptBoundary(e);\n\n NameKeysT nameKeys;\n GetNameKeys(nameKeys);\n\n for (auto const & p : e.tags)\n {\n \/\/\/ @todo Skip common key tags.\n if (p.first == \"type\" || p.first == \"route\")\n continue;\n\n \/\/\/ Skip already existing \"name\" tags.\n if (nameKeys.count(p.first) != 0)\n continue;\n\n if (!isBoundary && p.first == \"boundary\")\n continue;\n\n if (isWay && p.first == \"place\")\n continue;\n\n m_current->AddKV(p.first, p.second);\n }\n }\n\n public:\n RelationTagsProcessor()\n : m_cache(14)\n {\n }\n\n void Reset(uint64_t fID, XMLElement * p)\n {\n m_featureID = fID;\n m_current = p;\n }\n\n template <class ReaderT> bool operator() (uint64_t id, ReaderT & reader)\n {\n bool exists = false;\n RelationElement & e = m_cache.Find(id, exists);\n if (!exists)\n CHECK(reader.Read(id, e), (id));\n\n Process(e);\n return false;\n }\n\n } m_relationsProcess;\n\n bool ParseType(XMLElement * p, FeatureParams & params)\n {\n \/\/ Get tags from parent relations.\n m_relationsProcess.Reset(p->id, p);\n\n if (p->tagKey == XMLElement::ET_NODE)\n {\n \/\/ additional process of nodes ONLY if there is no native types\n FeatureParams fp;\n ftype::GetNameAndType(p, fp);\n if (!ftype::IsValidTypes(fp))\n m_holder.ForEachRelationByNodeCached(p->id, m_relationsProcess);\n }\n else if (p->tagKey == XMLElement::ET_WAY)\n {\n \/\/ always make additional process of ways\n m_holder.ForEachRelationByWayCached(p->id, m_relationsProcess);\n }\n\n \/\/ Get params from element tags.\n ftype::GetNameAndType(p, params);\n params.FinishAddingTypes();\n return ftype::IsValidTypes(params);\n }\n\n typedef FeatureBuilder1 FeatureBuilderT;\n\n class multipolygons_emitter\n {\n SecondPassParser * m_pMain;\n FeatureParams const & m_params;\n holes_list_t & m_holes;\n uint64_t m_relID;\n\n public:\n multipolygons_emitter(SecondPassParser * pMain,\n FeatureParams const & params,\n holes_list_t & holes,\n uint64_t relID)\n : m_pMain(pMain), m_params(params), m_holes(holes), m_relID(relID)\n {\n }\n\n void operator() (pts_vec_t const & pts, vector<uint64_t> const & ids)\n {\n FeatureBuilderT ft;\n\n for (size_t i = 0; i < ids.size(); ++i)\n ft.AddOsmId(osm::Id::Way(ids[i]));\n\n for (size_t i = 0; i < pts.size(); ++i)\n ft.AddPoint(pts[i]);\n\n ft.AddOsmId(osm::Id::Relation(m_relID));\n m_pMain->EmitArea(ft, m_params, [this] (FeatureBuilderT & ft)\n {\n ft.SetAreaAddHoles(m_holes);\n });\n }\n };\n\n uint32_t m_coastType;\n\n unique_ptr<FileWriter> m_addrWriter;\n bool NeedWriteAddress(FeatureParams const & params) const\n {\n return m_addrWriter && ftypes::IsBuildingChecker::Instance()(params.m_Types);\n }\n\n class Place\n {\n FeatureBuilderT m_ft;\n m2::PointD m_pt;\n uint32_t m_type;\n\n static constexpr double EQUAL_PLACE_SEARCH_RADIUS_M = 20000.0;\n\n bool IsPoint() const { return (m_ft.GetGeomType() == feature::GEOM_POINT); }\n static bool IsEqualTypes(uint32_t t1, uint32_t t2)\n {\n \/\/ Use 2-arity places comparison for filtering.\n \/\/ (\"place-city-capital-2\" is equal to \"place-city\")\n ftype::TruncValue(t1, 2);\n ftype::TruncValue(t2, 2);\n return (t1 == t2);\n }\n\n public:\n Place(FeatureBuilderT const & ft, uint32_t type)\n : m_ft(ft), m_pt(ft.GetKeyPoint()), m_type(type)\n {\n }\n\n FeatureBuilderT const & GetFeature() const { return m_ft; }\n\n m2::RectD GetLimitRect() const\n {\n return MercatorBounds::RectByCenterXYAndSizeInMeters(m_pt, EQUAL_PLACE_SEARCH_RADIUS_M);\n }\n\n bool IsEqual(Place const & r) const\n {\n return (IsEqualTypes(m_type, r.m_type) &&\n m_ft.GetName() == r.m_ft.GetName() &&\n (IsPoint() || r.IsPoint()) &&\n MercatorBounds::DistanceOnEarth(m_pt, r.m_pt) < EQUAL_PLACE_SEARCH_RADIUS_M);\n }\n\n \/\/\/ Check whether we need to replace place @r with place @this.\n bool IsBetterThan(Place const & r) const\n {\n \/\/ Area places has priority before point places.\n if (!r.IsPoint())\n return false;\n if (!IsPoint())\n return true;\n\n \/\/ Check types length.\n \/\/ (\"place-city-capital-2\" is better than \"place-city\").\n uint8_t const l1 = ftype::GetLevel(m_type);\n uint8_t const l2 = ftype::GetLevel(r.m_type);\n if (l1 != l2)\n return (l2 < l1);\n\n \/\/ Check ranks.\n return (r.m_ft.GetRank() < m_ft.GetRank());\n }\n };\n\n m4::Tree<Place> m_places;\n\n void EmitFeatureBase(FeatureBuilderT & ft, FeatureParams const & params)\n {\n ft.SetParams(params);\n if (ft.PreSerialize())\n {\n string addr;\n if (NeedWriteAddress(params) && ft.FormatFullAddress(addr))\n m_addrWriter->Write(addr.c_str(), addr.size());\n\n static uint32_t const placeType = classif().GetTypeByPath({\"place\"});\n uint32_t const type = params.FindType(placeType, 1);\n\n if (type != ftype::GetEmptyValue() && !ft.GetName().empty())\n {\n m_places.ReplaceEqualInRect(Place(ft, type),\n bind(&Place::IsEqual, _1, _2),\n bind(&Place::IsBetterThan, _1, _2));\n }\n else\n m_emitter(ft);\n }\n }\n\n \/\/\/ @param[in] params Pass by value because it can be modified.\n \/\/@{\n void EmitPoint(m2::PointD const & pt, FeatureParams params, osm::Id id)\n {\n if (feature::RemoveNoDrawableTypes(params.m_Types, feature::GEOM_POINT))\n {\n FeatureBuilderT ft;\n ft.SetCenter(pt);\n ft.SetOsmId(id);\n EmitFeatureBase(ft, params);\n }\n }\n\n void EmitLine(FeatureBuilderT & ft, FeatureParams params, bool isCoastLine)\n {\n if (isCoastLine || feature::RemoveNoDrawableTypes(params.m_Types, feature::GEOM_LINE))\n {\n ft.SetLinear(params.m_reverseGeometry);\n EmitFeatureBase(ft, params);\n }\n }\n\n template <class MakeFnT>\n void EmitArea(FeatureBuilderT & ft, FeatureParams params, MakeFnT makeFn)\n {\n using namespace feature;\n\n \/\/ Ensure that we have closed area geometry.\n if (ft.IsGeometryClosed())\n {\n \/\/ Key point here is that IsDrawableLike and RemoveNoDrawableTypes\n \/\/ work a bit different for GEOM_AREA.\n\n if (IsDrawableLike(params.m_Types, GEOM_AREA))\n {\n \/\/ Make the area feature if it has unique area styles.\n VERIFY(RemoveNoDrawableTypes(params.m_Types, GEOM_AREA), (params));\n\n makeFn(ft);\n\n EmitFeatureBase(ft, params);\n }\n else\n {\n \/\/ Try to make the point feature if it has point styles.\n EmitPoint(ft.GetGeometryCenter(), params, ft.GetLastOsmId());\n }\n }\n }\n \/\/@}\n\npublic:\n \/\/\/ The main entry point for parsing process.\n virtual void EmitElement(XMLElement * p)\n {\n FeatureParams params;\n if (!ParseType(p, params))\n return;\n\n if (p->tagKey == XMLElement::ET_NODE)\n {\n m2::PointD pt;\n if (p->childs.empty() || !GetPoint(p->id, pt))\n return;\n\n EmitPoint(pt, params, osm::Id::Node(p->id));\n }\n else if (p->tagKey == XMLElement::ET_WAY)\n {\n FeatureBuilderT ft;\n\n \/\/ Parse geometry.\n for (auto const & e : p->childs)\n {\n if (e.tagKey == XMLElement::ET_ND)\n {\n m2::PointD pt;\n if (!GetPoint(e.ref, pt))\n return;\n\n ft.AddPoint(pt);\n }\n }\n\n if (ft.GetPointsCount() < 2)\n return;\n\n ft.SetOsmId(osm::Id::Way(p->id));\n bool isCoastLine = (m_coastType != 0 && params.IsTypeExist(m_coastType));\n\n EmitArea(ft, params, [&] (FeatureBuilderT & ft)\n {\n isCoastLine = false; \/\/ emit coastline feature only once\n multipolygon_holes_processor processor(p->id, this);\n m_holder.ForEachRelationByWay(p->id, processor);\n ft.SetAreaAddHoles(processor.GetHoles());\n });\n\n EmitLine(ft, params, isCoastLine);\n }\n else if (p->tagKey == XMLElement::ET_RELATION)\n {\n {\n \/\/ 1. Check, if this is our processable relation. Here we process only polygon relations.\n size_t i = 0;\n size_t const count = p->childs.size();\n for (; i < count; ++i)\n {\n if (p->childs[i].tagKey == XMLElement::ET_TAG &&\n p->childs[i].k == \"type\" &&\n p->childs[i].v == \"multipolygon\")\n {\n break;\n }\n }\n if (i == count)\n return;\n }\n\n holes_accumulator holes(this);\n AreaWayMerger<THolder> outer(m_holder);\n\n \/\/ 3. Iterate ways to get 'outer' and 'inner' geometries\n for (auto const & e : p->childs)\n {\n if (e.tagKey == XMLElement::ET_MEMBER && e.type == \"way\")\n {\n if (e.role == \"outer\")\n outer.AddWay(e.ref);\n else if (e.role == \"inner\")\n holes(e.ref);\n }\n }\n\n multipolygons_emitter emitter(this, params, holes.GetHoles(), p->id);\n outer.ForEachArea(emitter, true);\n }\n }\n\npublic:\n SecondPassParser(TEmitter & emitter, THolder & holder,\n uint32_t coastType, string const & addrFilePath)\n : m_emitter(emitter), m_holder(holder), m_coastType(coastType)\n {\n if (!addrFilePath.empty())\n m_addrWriter.reset(new FileWriter(addrFilePath));\n }\n\n void Finish()\n {\n m_places.ForEach([this] (Place const & p)\n {\n m_emitter(p.GetFeature());\n });\n }\n};\n<|endoftext|>"} {"text":"<commit_before>#include \"http\/URLParser.hpp\"\n#include <cstring>\n\nusing std::string;\n\nchar hexToChar(char hex1, char hex2) {\n return (hex1 - '0') * 16 + (hex2 - '0');\n}\n\nbool decodeURLEntities(const char* in, size_t length, std::string& out) {\n out.clear();\n out.reserve(length);\n for (size_t i = 0; i < length; i++) {\n if (in[i] == '%') {\n if (i + 3 <= length) {\n int value = 0;\n out += hexToChar(in[i+1], in[i+2]);\n i += 2;\n } else {\n return false;\n }\n } else if (in[i] == '+') {\n out += ' ';\n } else {\n out += in[i];\n }\n }\n return true;\n}\n\nstd::string decodeURLEntities(const char* in, size_t length) {\n std::string ret;\n if(!decodeURLEntities(in, length, ret)) {\n return \"\"; \/\/On error\n }\n return ret;\n}\n \n\nbool decodeURLEntities(const std::string& in, std::string& out) {\n return decodeURLEntities(in.data(), in.size(), out);\n}\n\nvoid parseQueryPart(const char* query, std::map<std::string, std::string>& map) {\n \/\/Skip '?' at the beginning, if any\n if(query[0] == '?') {\n query++;\n }\n\n while(true) {\n char* kvSeparator = strchr(query, '=');\n if(kvSeparator == nullptr) {\n \/\/No separator -- no argument left\n \/\/This branch won't execute for correct inputs\n break;\n }\n char* argSeparator = strchr(kvSeparator, '&');\n string key = decodeURLEntities(query, (kvSeparator - query));\n if(argSeparator == nullptr) {\n \/\/last argument\n map[key] = decodeURLEntities(kvSeparator + 1, strlen(kvSeparator + 1));\n break;\n } else {\n map[key] = decodeURLEntities(kvSeparator + 1, argSeparator - kvSeparator - 1);\n }\n query = argSeparator + 1;\n }\n}<commit_msg>Fix const char problems<commit_after>#include \"http\/URLParser.hpp\"\n#include <cstring>\n\nusing std::string;\n\nchar hexToChar(char hex1, char hex2) {\n return (hex1 - '0') * 16 + (hex2 - '0');\n}\n\nbool decodeURLEntities(const char* in, size_t length, std::string& out) {\n out.clear();\n out.reserve(length);\n for (size_t i = 0; i < length; i++) {\n if (in[i] == '%') {\n if (i + 3 <= length) {\n int value = 0;\n out += hexToChar(in[i+1], in[i+2]);\n i += 2;\n } else {\n return false;\n }\n } else if (in[i] == '+') {\n out += ' ';\n } else {\n out += in[i];\n }\n }\n return true;\n}\n\nstd::string decodeURLEntities(const char* in, size_t length) {\n std::string ret;\n if(!decodeURLEntities(in, length, ret)) {\n return \"\"; \/\/On error\n }\n return ret;\n}\n \n\nbool decodeURLEntities(const std::string& in, std::string& out) {\n return decodeURLEntities(in.data(), in.size(), out);\n}\n\nvoid parseQueryPart(const char* query, std::map<std::string, std::string>& map) {\n \/\/Skip '?' at the beginning, if any\n if(query[0] == '?') {\n query++;\n }\n\n while(true) {\n const char* kvSeparator = strchr(query, '=');\n if(kvSeparator == nullptr) {\n \/\/No separator -- no argument left\n \/\/This branch won't execute for correct inputs\n break;\n }\n const char* argSeparator = strchr(kvSeparator, '&');\n string key = decodeURLEntities(query, (kvSeparator - query));\n if(argSeparator == nullptr) {\n \/\/last argument\n map[key] = decodeURLEntities(kvSeparator + 1, strlen(kvSeparator + 1));\n break;\n } else {\n map[key] = decodeURLEntities(kvSeparator + 1, argSeparator - kvSeparator - 1);\n }\n query = argSeparator + 1;\n }\n}<|endoftext|>"} {"text":"<commit_before>\/\/ Copyright 2016 AUV-IITK\n#include <ros.h>\n#include <Arduino.h>\n#include <std_msgs\/Int32.h>\n#include <std_msgs\/Float64.h>\n#include <math.h>\n\n#define pwmPinWest 3\n#define pwmPinEast 2\n#define directionPinWest1 30\n#define directionPinWest2 31\n#define directionPinEast1 33\n#define directionPinEast2 32\n\n#define pwmPinNorthSway 5\n#define pwmPinSouthSway 4\n#define directionPinNorthSway1 26\n#define directionPinNorthSway2 27\n#define directionPinSouthSway1 28\n#define directionPinSouthSway2 29\n\n#define pwmPinNorthUp 6\n#define pwmPinSouthUp 7\n#define directionPinNorthUp1 24\n#define directionPinNorthUp2 25\n#define directionPinSouthUp1 22\n#define directionPinSouthUp2 23\n\n#define analogPinPressureSensor A0\n\nconst float c092 = 506.22;\nconst float s092 = -2.65;\nconst float c093 = 448.62;\nconst float s093 = -2.92;\nconst float c099 = 397.65; \/\/ reference as their graph is at lowest\nconst float s099 = -2.71; \/\/ reference as their graph is at lowest\nconst float c113 = 539.85;\nconst float s113 = -3.38;\nconst float c117 = 441.32;\nconst float s117 = -3.03;\nconst float c122 = 547.39;\nconst float s122 = -2.93;\n\nfloat k092 = 0;\nfloat k093 = 0;\nfloat k099 = 0;\nfloat k113 = 0;\nfloat k117 = 0;\nfloat k122 = 0;\n\nint count, sum;\nbool isMovingForward = true;\nfloat v;\nstd_msgs::Float64 voltage;\nros::NodeHandle nh;\n\nint NormalizePWM(int pwm)\n{\n return pwm * 53 \/ 255 + 147;\n}\n\nint NormalizeUpwardPWM(int pwm)\n{\n return pwm * 73 \/ 255 + 147;\n}\n\nint btd092(int pwm)\n{\n pwm = NormalizePWM(pwm);\n if (pwm <= 147)\n {\n return 0;\n }\n pwm = (c099 + k092 + s099 * pwm - c092) \/ (s092);\n return pwm;\n}\n\nint btd093(int pwm)\n{\n pwm = NormalizeUpwardPWM(pwm);\n if (pwm <= 147)\n {\n return 0;\n }\n pwm = (c099 + k093 + s099 * pwm - c093) \/ (s093);\n return pwm;\n}\n\nint btd099(int pwm)\n{\n pwm = NormalizePWM(pwm);\n if (pwm <= 147)\n {\n return 0;\n }\n return pwm;\n}\n\nint btd113(int pwm)\n{\n pwm = NormalizePWM(pwm);\n if (pwm <= 147)\n {\n return 0;\n }\n pwm = (c099 + k113 + s099 * pwm - c113) \/ (s113);\n return pwm;\n}\n\nint btd117(int pwm)\n{\n pwm = NormalizeUpwardPWM(pwm);\n if (pwm <= 147)\n {\n return 0;\n }\n pwm = (c099 + k117 + s099 * pwm - c117) \/ (s117);\n return pwm;\n}\n\nint btd122(int pwm)\n{\n pwm = NormalizePWM(pwm);\n if (pwm <= 147)\n {\n return 0;\n }\n pwm = (c099 + k122 + s099 * pwm - c122) \/ (s122);\n return pwm;\n}\n\nvoid thrusterNorthUp(int pwm, int isUpward)\n{\n pwm = abs(pwm);\n pwm = btd117(pwm);\n analogWrite(pwmPinNorthUp, 255 - pwm);\n if (isUpward)\n {\n digitalWrite(directionPinNorthUp1, HIGH);\n digitalWrite(directionPinNorthUp2, LOW);\n }\n else\n {\n digitalWrite(directionPinNorthUp1, LOW);\n digitalWrite(directionPinNorthUp2, HIGH);\n }\n}\n\nvoid thrusterSouthUp(int pwm, int isUpward)\n{\n pwm = abs(pwm);\n pwm = btd093(pwm);\n analogWrite(pwmPinSouthUp, 255 - pwm);\n if (isUpward)\n {\n digitalWrite(directionPinSouthUp1, HIGH);\n digitalWrite(directionPinSouthUp2, LOW);\n }\n else\n {\n digitalWrite(directionPinSouthUp1, LOW);\n digitalWrite(directionPinSouthUp2, HIGH);\n }\n}\n\nvoid thrusterNorthSway(int pwm, int isRight)\n{\n pwm = abs(pwm);\n pwm = btd113(pwm);\n analogWrite(pwmPinNorthSway, 255 - pwm);\n if (isRight)\n {\n digitalWrite(directionPinNorthSway1, HIGH);\n digitalWrite(directionPinNorthSway2, LOW);\n }\n else\n {\n digitalWrite(directionPinNorthSway1, LOW);\n digitalWrite(directionPinNorthSway2, HIGH);\n }\n}\n\nvoid thrusterSouthSway(int pwm, int isRight)\n{\n pwm = abs(pwm);\n pwm = btd122(pwm);\n analogWrite(pwmPinSouthSway, 255 - pwm);\n if (isRight)\n {\n digitalWrite(directionPinSouthSway1, HIGH);\n digitalWrite(directionPinSouthSway2, LOW);\n }\n else\n {\n digitalWrite(directionPinSouthSway1, LOW);\n digitalWrite(directionPinSouthSway2, HIGH);\n }\n}\n\nvoid thrusterEast(int pwm, int isForward)\n{\n pwm = abs(pwm);\n pwm = btd092(pwm);\n analogWrite(pwmPinEast, 255 - pwm);\n if (isForward)\n {\n digitalWrite(directionPinEast1, HIGH);\n digitalWrite(directionPinEast2, LOW);\n }\n else\n {\n digitalWrite(directionPinEast1, LOW);\n digitalWrite(directionPinEast2, HIGH);\n }\n}\n\nvoid thrusterWest(int pwm, int isForward)\n{\n pwm = abs(pwm);\n pwm = btd099(pwm);\n analogWrite(pwmPinWest, 255 - pwm);\n if (isForward)\n {\n digitalWrite(directionPinWest1, HIGH);\n digitalWrite(directionPinWest2, LOW);\n }\n else\n {\n digitalWrite(directionPinWest1, LOW);\n digitalWrite(directionPinWest2, HIGH);\n }\n}\n\nvoid PWMCbForward(const std_msgs::Int32& msg)\n{\n if (msg.data > 0)\n {\n thrusterEast(msg.data, true);\n thrusterWest(msg.data, true);\n }\n else\n {\n thrusterEast(msg.data, false);\n thrusterWest(msg.data, false);\n }\n isMovingForward = true;\n}\n\nvoid PWMCbSideward(const std_msgs::Int32& msg)\n{\n if (msg.data > 0)\n {\n thrusterNorthSway(msg.data, true);\n thrusterSouthSway(msg.data, true);\n }\n else\n {\n thrusterNorthSway(msg.data, false);\n thrusterSouthSway(msg.data, false);\n }\n isMovingForward = false;\n}\n\nvoid PWMCbUpward(const std_msgs::Int32& msg)\n{\n if (msg.data > 0)\n {\n thrusterNorthUp(msg.data, true);\n thrusterSouthUp(msg.data, true);\n }\n else\n {\n thrusterNorthUp(msg.data, false);\n thrusterSouthUp(msg.data, false);\n }\n}\n\nvoid PWMCbTurn(const std_msgs::Int32& msg)\n{\n if (!isMovingForward)\n {\n if (msg.data > 0)\n {\n thrusterEast(msg.data, true);\n thrusterWest(msg.data, false);\n }\n else\n {\n thrusterEast(msg.data, false);\n thrusterWest(msg.data, true);\n }\n }\n else\n {\n if (msg.data > 0)\n {\n thrusterNorthSway(msg.data, false);\n thrusterSouthSway(msg.data, true);\n }\n else\n {\n thrusterNorthSway(msg.data, true);\n thrusterSouthSway(msg.data, false);\n }\n }\n}\n\nvoid thrust092(const std_msgs::Float64& msg)\n{\n k092 = msg.data;\n}\n\nvoid thrust093(const std_msgs::Float64& msg)\n{\n k093 = msg.data;\n}\n\nvoid thrust099(const std_msgs::Float64& msg)\n{\n k099 = msg.data;\n}\n\nvoid thrust113(const std_msgs::Float64& msg)\n{\n k113 = msg.data;\n}\n\nvoid thrust117(const std_msgs::Float64& msg)\n{\n k117 = msg.data;\n}\n\nvoid thrust122(const std_msgs::Float64& msg)\n{\n k122 = msg.data;\n}\n\nros::Subscriber<std_msgs::Int32> subPwmForward(\"\/pwm\/forward\", &PWMCbForward);\nros::Subscriber<std_msgs::Int32> subPwmSideward(\"\/pwm\/sideward\", &PWMCbSideward);\nros::Subscriber<std_msgs::Int32> subPwmUpward(\"\/pwm\/upward\", &PWMCbUpward);\nros::Subscriber<std_msgs::Int32> subPwmTurn(\"\/pwm\/turn\", &PWMCbTurn);\nros::Publisher ps_voltage(\"\/varun\/sensors\/pressure_sensor\/depth\", &voltage);\n\nros::Subscriber<std_msgs::Float64> thruster092(\"\/thrust\/092\", &thrust092);\nros::Subscriber<std_msgs::Float64> thruster093(\"\/thrust\/093\", &thrust093);\nros::Subscriber<std_msgs::Float64> thruster099(\"\/thrust\/099\", &thrust099);\nros::Subscriber<std_msgs::Float64> thruster113(\"\/thrust\/113\", &thrust113);\nros::Subscriber<std_msgs::Float64> thruster117(\"\/thrust\/117\", &thrust117);\nros::Subscriber<std_msgs::Float64> thruster122(\"\/thrust\/122\", &thrust122);\n\nvoid setup()\n{\n nh.initNode();\n\n pinMode(pwmPinEast, OUTPUT);\n pinMode(directionPinEast1, OUTPUT);\n pinMode(directionPinEast2, OUTPUT);\n pinMode(pwmPinWest, OUTPUT);\n pinMode(directionPinWest1, OUTPUT);\n pinMode(directionPinWest2, OUTPUT);\n\n pinMode(directionPinSouthSway1, OUTPUT);\n pinMode(directionPinSouthSway2, OUTPUT);\n pinMode(pwmPinNorthSway, OUTPUT);\n pinMode(directionPinNorthSway2, OUTPUT);\n pinMode(pwmPinSouthSway, OUTPUT);\n pinMode(directionPinNorthSway1, OUTPUT);\n\n pinMode(directionPinSouthUp1, OUTPUT);\n pinMode(directionPinSouthUp2, OUTPUT);\n pinMode(pwmPinNorthUp, OUTPUT);\n pinMode(directionPinNorthUp2, OUTPUT);\n pinMode(pwmPinSouthUp, OUTPUT);\n pinMode(directionPinNorthUp1, OUTPUT);\n\n nh.subscribe(subPwmForward);\n nh.subscribe(subPwmSideward);\n nh.subscribe(subPwmUpward);\n nh.subscribe(subPwmTurn);\n nh.advertise(ps_voltage);\n Serial.begin(57600);\n std_msgs::Int32 msg;\n msg.data = 0;\n PWMCbForward(msg);\n PWMCbSideward(msg);\n PWMCbUpward(msg);\n PWMCbTurn(msg);\n count = 0;\n sum = 0;\n\n nh.subscribe(thruster092);\n nh.subscribe(thruster093);\n nh.subscribe(thruster099);\n nh.subscribe(thruster113);\n nh.subscribe(thruster117);\n nh.subscribe(thruster122);\n}\n\nvoid loop()\n{\n if (count == 100)\n {\n sum \/= count;\n voltage.data = -sum; \/\/ negative because convention is to take upward direction as positive\n ps_voltage.publish(&voltage);\n sum = 0;\n count = 0;\n }\n else\n {\n v = analogRead(analogPinPressureSensor);\n sum += v;\n count++;\n delay(1);\n }\n nh.spinOnce();\n}\n<commit_msg>made anticlockwise positive<commit_after>\/\/ Copyright 2016 AUV-IITK\n#include <ros.h>\n#include <Arduino.h>\n#include <std_msgs\/Int32.h>\n#include <std_msgs\/Float64.h>\n#include <math.h>\n\n#define pwmPinWest 3\n#define pwmPinEast 2\n#define directionPinWest1 30\n#define directionPinWest2 31\n#define directionPinEast1 33\n#define directionPinEast2 32\n\n#define pwmPinNorthSway 5\n#define pwmPinSouthSway 4\n#define directionPinNorthSway1 26\n#define directionPinNorthSway2 27\n#define directionPinSouthSway1 28\n#define directionPinSouthSway2 29\n\n#define pwmPinNorthUp 6\n#define pwmPinSouthUp 7\n#define directionPinNorthUp1 24\n#define directionPinNorthUp2 25\n#define directionPinSouthUp1 22\n#define directionPinSouthUp2 23\n\n#define analogPinPressureSensor A0\n\nconst float c092 = 506.22;\nconst float s092 = -2.65;\nconst float c093 = 448.62;\nconst float s093 = -2.92;\nconst float c099 = 397.65; \/\/ reference as their graph is at lowest\nconst float s099 = -2.71; \/\/ reference as their graph is at lowest\nconst float c113 = 539.85;\nconst float s113 = -3.38;\nconst float c117 = 441.32;\nconst float s117 = -3.03;\nconst float c122 = 547.39;\nconst float s122 = -2.93;\n\nfloat k092 = 0;\nfloat k093 = 0;\nfloat k099 = 0;\nfloat k113 = 0;\nfloat k117 = 0;\nfloat k122 = 0;\n\nint count, sum;\nbool isMovingForward = true;\nfloat v;\nstd_msgs::Float64 voltage;\nros::NodeHandle nh;\n\nint NormalizePWM(int pwm)\n{\n return pwm * 53 \/ 255 + 147;\n}\n\nint NormalizeUpwardPWM(int pwm)\n{\n return pwm * 73 \/ 255 + 147;\n}\n\nint btd092(int pwm)\n{\n pwm = NormalizePWM(pwm);\n if (pwm <= 147)\n {\n return 0;\n }\n pwm = (c099 + k092 + s099 * pwm - c092) \/ (s092);\n return pwm;\n}\n\nint btd093(int pwm)\n{\n pwm = NormalizeUpwardPWM(pwm);\n if (pwm <= 147)\n {\n return 0;\n }\n pwm = (c099 + k093 + s099 * pwm - c093) \/ (s093);\n return pwm;\n}\n\nint btd099(int pwm)\n{\n pwm = NormalizePWM(pwm);\n if (pwm <= 147)\n {\n return 0;\n }\n return pwm;\n}\n\nint btd113(int pwm)\n{\n pwm = NormalizePWM(pwm);\n if (pwm <= 147)\n {\n return 0;\n }\n pwm = (c099 + k113 + s099 * pwm - c113) \/ (s113);\n return pwm;\n}\n\nint btd117(int pwm)\n{\n pwm = NormalizeUpwardPWM(pwm);\n if (pwm <= 147)\n {\n return 0;\n }\n pwm = (c099 + k117 + s099 * pwm - c117) \/ (s117);\n return pwm;\n}\n\nint btd122(int pwm)\n{\n pwm = NormalizePWM(pwm);\n if (pwm <= 147)\n {\n return 0;\n }\n pwm = (c099 + k122 + s099 * pwm - c122) \/ (s122);\n return pwm;\n}\n\nvoid thrusterNorthUp(int pwm, int isUpward)\n{\n pwm = abs(pwm);\n pwm = btd117(pwm);\n analogWrite(pwmPinNorthUp, 255 - pwm);\n if (isUpward)\n {\n digitalWrite(directionPinNorthUp1, HIGH);\n digitalWrite(directionPinNorthUp2, LOW);\n }\n else\n {\n digitalWrite(directionPinNorthUp1, LOW);\n digitalWrite(directionPinNorthUp2, HIGH);\n }\n}\n\nvoid thrusterSouthUp(int pwm, int isUpward)\n{\n pwm = abs(pwm);\n pwm = btd093(pwm);\n analogWrite(pwmPinSouthUp, 255 - pwm);\n if (isUpward)\n {\n digitalWrite(directionPinSouthUp1, HIGH);\n digitalWrite(directionPinSouthUp2, LOW);\n }\n else\n {\n digitalWrite(directionPinSouthUp1, LOW);\n digitalWrite(directionPinSouthUp2, HIGH);\n }\n}\n\nvoid thrusterNorthSway(int pwm, int isRight)\n{\n pwm = abs(pwm);\n pwm = btd113(pwm);\n analogWrite(pwmPinNorthSway, 255 - pwm);\n if (isRight)\n {\n digitalWrite(directionPinNorthSway1, HIGH);\n digitalWrite(directionPinNorthSway2, LOW);\n }\n else\n {\n digitalWrite(directionPinNorthSway1, LOW);\n digitalWrite(directionPinNorthSway2, HIGH);\n }\n}\n\nvoid thrusterSouthSway(int pwm, int isRight)\n{\n pwm = abs(pwm);\n pwm = btd122(pwm);\n analogWrite(pwmPinSouthSway, 255 - pwm);\n if (isRight)\n {\n digitalWrite(directionPinSouthSway1, HIGH);\n digitalWrite(directionPinSouthSway2, LOW);\n }\n else\n {\n digitalWrite(directionPinSouthSway1, LOW);\n digitalWrite(directionPinSouthSway2, HIGH);\n }\n}\n\nvoid thrusterEast(int pwm, int isForward)\n{\n pwm = abs(pwm);\n pwm = btd092(pwm);\n analogWrite(pwmPinEast, 255 - pwm);\n if (isForward)\n {\n digitalWrite(directionPinEast1, HIGH);\n digitalWrite(directionPinEast2, LOW);\n }\n else\n {\n digitalWrite(directionPinEast1, LOW);\n digitalWrite(directionPinEast2, HIGH);\n }\n}\n\nvoid thrusterWest(int pwm, int isForward)\n{\n pwm = abs(pwm);\n pwm = btd099(pwm);\n analogWrite(pwmPinWest, 255 - pwm);\n if (isForward)\n {\n digitalWrite(directionPinWest1, HIGH);\n digitalWrite(directionPinWest2, LOW);\n }\n else\n {\n digitalWrite(directionPinWest1, LOW);\n digitalWrite(directionPinWest2, HIGH);\n }\n}\n\nvoid PWMCbForward(const std_msgs::Int32& msg)\n{\n if (msg.data > 0)\n {\n thrusterEast(msg.data, true);\n thrusterWest(msg.data, true);\n }\n else\n {\n thrusterEast(msg.data, false);\n thrusterWest(msg.data, false);\n }\n isMovingForward = true;\n}\n\nvoid PWMCbSideward(const std_msgs::Int32& msg)\n{\n if (msg.data > 0)\n {\n thrusterNorthSway(msg.data, true);\n thrusterSouthSway(msg.data, true);\n }\n else\n {\n thrusterNorthSway(msg.data, false);\n thrusterSouthSway(msg.data, false);\n }\n isMovingForward = false;\n}\n\nvoid PWMCbUpward(const std_msgs::Int32& msg)\n{\n if (msg.data > 0)\n {\n thrusterNorthUp(msg.data, true);\n thrusterSouthUp(msg.data, true);\n }\n else\n {\n thrusterNorthUp(msg.data, false);\n thrusterSouthUp(msg.data, false);\n }\n}\n\nvoid PWMCbTurn(const std_msgs::Int32& msg)\n{\n if (!isMovingForward)\n {\n if (msg.data < 0)\n {\n thrusterEast(msg.data, true);\n thrusterWest(msg.data, false);\n }\n else\n {\n thrusterEast(msg.data, false);\n thrusterWest(msg.data, true);\n }\n }\n else\n {\n if (msg.data > 0)\n {\n thrusterNorthSway(msg.data, false);\n thrusterSouthSway(msg.data, true);\n }\n else\n {\n thrusterNorthSway(msg.data, true);\n thrusterSouthSway(msg.data, false);\n }\n }\n}\n\nvoid thrust092(const std_msgs::Float64& msg)\n{\n k092 = msg.data;\n}\n\nvoid thrust093(const std_msgs::Float64& msg)\n{\n k093 = msg.data;\n}\n\nvoid thrust099(const std_msgs::Float64& msg)\n{\n k099 = msg.data;\n}\n\nvoid thrust113(const std_msgs::Float64& msg)\n{\n k113 = msg.data;\n}\n\nvoid thrust117(const std_msgs::Float64& msg)\n{\n k117 = msg.data;\n}\n\nvoid thrust122(const std_msgs::Float64& msg)\n{\n k122 = msg.data;\n}\n\nros::Subscriber<std_msgs::Int32> subPwmForward(\"\/pwm\/forward\", &PWMCbForward);\nros::Subscriber<std_msgs::Int32> subPwmSideward(\"\/pwm\/sideward\", &PWMCbSideward);\nros::Subscriber<std_msgs::Int32> subPwmUpward(\"\/pwm\/upward\", &PWMCbUpward);\nros::Subscriber<std_msgs::Int32> subPwmTurn(\"\/pwm\/turn\", &PWMCbTurn);\nros::Publisher ps_voltage(\"\/varun\/sensors\/pressure_sensor\/depth\", &voltage);\n\nros::Subscriber<std_msgs::Float64> thruster092(\"\/thrust\/092\", &thrust092);\nros::Subscriber<std_msgs::Float64> thruster093(\"\/thrust\/093\", &thrust093);\nros::Subscriber<std_msgs::Float64> thruster099(\"\/thrust\/099\", &thrust099);\nros::Subscriber<std_msgs::Float64> thruster113(\"\/thrust\/113\", &thrust113);\nros::Subscriber<std_msgs::Float64> thruster117(\"\/thrust\/117\", &thrust117);\nros::Subscriber<std_msgs::Float64> thruster122(\"\/thrust\/122\", &thrust122);\n\nvoid setup()\n{\n nh.initNode();\n\n pinMode(pwmPinEast, OUTPUT);\n pinMode(directionPinEast1, OUTPUT);\n pinMode(directionPinEast2, OUTPUT);\n pinMode(pwmPinWest, OUTPUT);\n pinMode(directionPinWest1, OUTPUT);\n pinMode(directionPinWest2, OUTPUT);\n\n pinMode(directionPinSouthSway1, OUTPUT);\n pinMode(directionPinSouthSway2, OUTPUT);\n pinMode(pwmPinNorthSway, OUTPUT);\n pinMode(directionPinNorthSway2, OUTPUT);\n pinMode(pwmPinSouthSway, OUTPUT);\n pinMode(directionPinNorthSway1, OUTPUT);\n\n pinMode(directionPinSouthUp1, OUTPUT);\n pinMode(directionPinSouthUp2, OUTPUT);\n pinMode(pwmPinNorthUp, OUTPUT);\n pinMode(directionPinNorthUp2, OUTPUT);\n pinMode(pwmPinSouthUp, OUTPUT);\n pinMode(directionPinNorthUp1, OUTPUT);\n\n nh.subscribe(subPwmForward);\n nh.subscribe(subPwmSideward);\n nh.subscribe(subPwmUpward);\n nh.subscribe(subPwmTurn);\n nh.advertise(ps_voltage);\n Serial.begin(57600);\n std_msgs::Int32 msg;\n msg.data = 0;\n PWMCbForward(msg);\n PWMCbSideward(msg);\n PWMCbUpward(msg);\n PWMCbTurn(msg);\n count = 0;\n sum = 0;\n\n nh.subscribe(thruster092);\n nh.subscribe(thruster093);\n nh.subscribe(thruster099);\n nh.subscribe(thruster113);\n nh.subscribe(thruster117);\n nh.subscribe(thruster122);\n}\n\nvoid loop()\n{\n if (count == 100)\n {\n sum \/= count;\n voltage.data = -sum; \/\/ negative because convention is to take upward direction as positive\n ps_voltage.publish(&voltage);\n sum = 0;\n count = 0;\n }\n else\n {\n v = analogRead(analogPinPressureSensor);\n sum += v;\n count++;\n delay(1);\n }\n nh.spinOnce();\n}\n<|endoftext|>"} {"text":"<commit_before>\/*\n * Copyright 2009-2018 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 <set>\n#include <vector>\n#include <exception>\n#include <votca\/tools\/edge.h>\n#include <votca\/tools\/edgecontainer.h>\n#include <algorithm>\n\nusing namespace votca::tools;\nusing namespace std;\n\nEdgeContainer::EdgeContainer(Edge ed) { addEdge(ed); }\n\nEdgeContainer::EdgeContainer(vector<Edge> eds) {\n for (auto ed : eds) {\n addEdge(ed);\n }\n}\n\nint EdgeContainer::getMaxDegree(void) const{\n int max = 0;\n for(auto const& it : adj_list_) {\n if(it.second.size()>static_cast<size_t>(max)) {\n max = static_cast<int>(it.second.size());\n }\n }\n return max;\n}\n\nint EdgeContainer::getDegree(const int vert) const{\n if(!adj_list_.count(vert)) throw invalid_argument(\"vertex is not defined\");\n return static_cast<int>(adj_list_.at(vert).size());\n}\n\nvector<int> EdgeContainer::getVerticesDegree(int degree) const{\n vector<int> verts;\n for(auto v_list : adj_list_){\n if(static_cast<int>(v_list.second.size())==degree){\n verts.push_back(v_list.first);\n }\n }\n return verts;\n}\n\nbool EdgeContainer::edgeExist(Edge ed) {\n return (find(adj_list_[ed.getV1()].begin(), adj_list_[ed.getV1()].end(),\n ed.getV2()) != adj_list_[ed.getV1()].end());\n}\n\nbool EdgeContainer::vertexExist(int vert) { return adj_list_.count(vert); }\n\nvoid EdgeContainer::addEdge(Edge ed) {\n adj_list_[ed.getV1()].insert(ed.getV2());\n adj_list_[ed.getV2()].insert(ed.getV1());\n return;\n}\n\nvector<int> EdgeContainer::getVertices() {\n vector<int> vertices;\n for (auto const& it : adj_list_) vertices.push_back(it.first);\n return vertices;\n}\n\nvector<int> EdgeContainer::getNeighVertices(int vert) {\n vector<int> neigh_verts;\n for (auto const& neigh_vert : adj_list_[vert]) {\n neigh_verts.push_back(neigh_vert);\n }\n return neigh_verts;\n}\n\nvector<Edge> EdgeContainer::getNeighEdges(int vert) {\n vector<Edge> neigh_edges;\n for (auto const& neigh_vert : adj_list_[vert]) {\n neigh_edges.push_back(Edge(vert, neigh_vert));\n }\n return neigh_edges;\n}\n\nvector<Edge> EdgeContainer::getEdges() {\n set<Edge> edgs;\n for (auto const& it : adj_list_) {\n for (auto const& vert : it.second) edgs.insert(Edge(it.first, vert));\n }\n vector<Edge> vec_edgs(edgs.begin(), edgs.end());\n return vec_edgs;\n}\n<commit_msg>Added output functionality for edge container<commit_after>\/*\n * Copyright 2009-2018 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 <set>\n#include <vector>\n#include <exception>\n#include <votca\/tools\/edge.h>\n#include <votca\/tools\/edgecontainer.h>\n#include <algorithm>\n\nnamespace votca {\n namespace tools {\n\nusing namespace std;\n\nEdgeContainer::EdgeContainer(Edge ed) { addEdge(ed); }\n\nEdgeContainer::EdgeContainer(vector<Edge> eds) {\n for (auto ed : eds) {\n addEdge(ed);\n }\n}\n\nint EdgeContainer::getMaxDegree(void) const{\n int max = 0;\n for(auto const& it : adj_list_) {\n if(it.second.size()>static_cast<size_t>(max)) {\n max = static_cast<int>(it.second.size());\n }\n }\n return max;\n}\n\nint EdgeContainer::getDegree(const int vert) const{\n if(!adj_list_.count(vert)) throw invalid_argument(\"vertex is not defined\");\n return static_cast<int>(adj_list_.at(vert).size());\n}\n\nvector<int> EdgeContainer::getVerticesDegree(int degree) const{\n vector<int> verts;\n for(auto v_list : adj_list_){\n if(static_cast<int>(v_list.second.size())==degree){\n verts.push_back(v_list.first);\n }\n }\n return verts;\n}\n\nbool EdgeContainer::edgeExist(Edge ed) {\n return (find(adj_list_[ed.getV1()].begin(), adj_list_[ed.getV1()].end(),\n ed.getV2()) != adj_list_[ed.getV1()].end());\n}\n\nbool EdgeContainer::vertexExist(int vert) { return adj_list_.count(vert); }\n\nvoid EdgeContainer::addEdge(Edge ed) {\n adj_list_[ed.getV1()].insert(ed.getV2());\n adj_list_[ed.getV2()].insert(ed.getV1());\n return;\n}\n\nvector<int> EdgeContainer::getVertices() {\n vector<int> vertices;\n for (auto const& it : adj_list_) vertices.push_back(it.first);\n return vertices;\n}\n\nvector<int> EdgeContainer::getNeighVertices(int vert) {\n vector<int> neigh_verts;\n for (auto const& neigh_vert : adj_list_[vert]) {\n neigh_verts.push_back(neigh_vert);\n }\n return neigh_verts;\n}\n\nvector<Edge> EdgeContainer::getNeighEdges(int vert) {\n vector<Edge> neigh_edges;\n for (auto const& neigh_vert : adj_list_[vert]) {\n neigh_edges.push_back(Edge(vert, neigh_vert));\n }\n return neigh_edges;\n}\n\nvector<Edge> EdgeContainer::getEdges() {\n set<Edge> edgs;\n for (auto const& it : adj_list_) {\n for (auto const& vert : it.second) edgs.insert(Edge(it.first, vert));\n }\n vector<Edge> vec_edgs(edgs.begin(), edgs.end());\n return vec_edgs;\n}\n\nostream& operator<<(ostream& os, const EdgeContainer edgecontainer){\n edges = edgecontainer.getEdges();\n for(auto edge : edges){\n os << edge << endl;\n }\n return os;\n}\n\n}\n}\n<|endoftext|>"} {"text":"<commit_before>\/*\n\n Copyright (c) 2013, Ford Motor Company\n All rights reserved.\n\n Redistribution and use in source and binary forms, with or without\n modification, are permitted provided that the following conditions are met:\n\n Redistributions of source code must retain the above copyright notice, this\n list of conditions and the following disclaimer.\n\n Redistributions in binary form must reproduce the above copyright notice,\n this list of conditions and the following\n disclaimer in the documentation and\/or other materials provided with the\n distribution.\n\n Neither the name of the Ford Motor Company nor the names of its contributors\n may be used to endorse or promote products derived from this software\n without specific prior written permission.\n\n THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS \"AS IS\"\n AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE\n IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE\n ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE\n LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR\n CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF\n SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS\n INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN\n CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)\n ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE\n POSSIBILITY OF SUCH DAMAGE.\n *\/\n\n#include \"application_manager\/commands\/mobile\/unsubscribe_vehicle_data_request.h\"\n#include \"application_manager\/commands\/command_impl.h\"\n#include \"application_manager\/application_manager_impl.h\"\n#include \"application_manager\/application_impl.h\"\n#include \"application_manager\/message_helper.h\"\n#include \"interfaces\/MOBILE_API.h\"\n#include \"interfaces\/HMI_API.h\"\n#include \"application_manager\/smart_object_keys.h\"\n\nnamespace application_manager {\nnamespace commands {\n\nUnsubscribeVehicleDataRequest::UnsubscribeVehicleDataRequest(\n const MessageSharedPtr& message)\n : CommandRequestImpl(message) {\n}\n\nUnsubscribeVehicleDataRequest::~UnsubscribeVehicleDataRequest() {\n}\n\n#ifdef HMI_DBUS_API\nnamespace {\n struct Subrequest {\n hmi_apis::FunctionID::eType func_id;\n const char* str;\n };\n Subrequest subrequests[] = {\n { hmi_apis::FunctionID::VehicleInfo_UnsubscribeGps, strings::gps},\n { hmi_apis::FunctionID::VehicleInfo_UnsubscribeSpeed, strings::speed},\n { hmi_apis::FunctionID::VehicleInfo_UnsubscribeRpm, strings::rpm},\n { hmi_apis::FunctionID::VehicleInfo_UnsubscribeFuelLevel, strings::fuel_level},\n { hmi_apis::FunctionID::VehicleInfo_UnsubscribeFuelLevel_State, strings::fuel_level_state},\n { hmi_apis::FunctionID::VehicleInfo_UnsubscribeInstantFuelConsumption, strings::instant_fuel_consumption},\n { hmi_apis::FunctionID::VehicleInfo_UnsubscribeExternalTemperature, strings::external_temp},\n { hmi_apis::FunctionID::VehicleInfo_UnsubscribeVin, strings::vin},\n { hmi_apis::FunctionID::VehicleInfo_UnsubscribePrndl, strings::prndl},\n { hmi_apis::FunctionID::VehicleInfo_UnsubscribeTirePressure, strings::tire_pressure},\n { hmi_apis::FunctionID::VehicleInfo_UnsubscribeOdometer, strings::odometer},\n { hmi_apis::FunctionID::VehicleInfo_UnsubscribeBeltStatus, strings::belt_status},\n { hmi_apis::FunctionID::VehicleInfo_UnsubscribeBodyInformation, strings::body_information},\n { hmi_apis::FunctionID::VehicleInfo_UnsubscribeDeviceStatus, strings::device_status},\n { hmi_apis::FunctionID::VehicleInfo_UnsubscribeDriverBraking, strings::driver_braking},\n { hmi_apis::FunctionID::VehicleInfo_UnsubscribeWiperStatus, strings::wiper_status},\n { hmi_apis::FunctionID::VehicleInfo_UnsubscribeHeadLampStatus, strings::head_lamp_status},\n { hmi_apis::FunctionID::VehicleInfo_UnsubscribeEngineTorque, strings::engine_torque},\n { hmi_apis::FunctionID::VehicleInfo_UnsubscribeAccPedalPosition, strings::acc_pedal_pos},\n { hmi_apis::FunctionID::VehicleInfo_UnsubscribeSteeringWheelAngle, strings::steering_wheel_angle},\n { hmi_apis::FunctionID::VehicleInfo_UnsubscribeECallInfo, strings::e_call_info},\n { hmi_apis::FunctionID::VehicleInfo_UnsubscribeAirbagStatus, strings::airbag_status},\n { hmi_apis::FunctionID::VehicleInfo_UnsubscribeEmergencyEvent, strings::emergency_event},\n { hmi_apis::FunctionID::VehicleInfo_UnsubscribeClusterModeStatus, strings::cluster_mode_status},\n { hmi_apis::FunctionID::VehicleInfo_UnsubscribeMyKey, strings::my_key},\n };\n}\n#endif \/\/ #ifdef HMI_DBUS_API\n\nvoid UnsubscribeVehicleDataRequest::Run() {\n LOG4CXX_AUTO_TRACE(logger_);\n\n ApplicationSharedPtr app = ApplicationManagerImpl::instance()->application(\n CommandRequestImpl::connection_key());\n\n if (!app) {\n LOG4CXX_ERROR(logger_, \"NULL pointer\");\n SendResponse(false, mobile_apis::Result::APPLICATION_NOT_REGISTERED);\n return;\n }\n\n \/\/ counter for items to subscribe\n int32_t items_to_unsubscribe = 0;\n \/\/ counter for subscribed items by application\n int32_t unsubscribed_items = 0;\n\n const VehicleData& vehicle_data = MessageHelper::vehicle_data();\n VehicleData::const_iterator it = vehicle_data.begin();\n\n smart_objects::SmartObject msg_params = smart_objects::SmartObject(\n smart_objects::SmartType_Map);\n\n smart_objects::SmartObject response_params = smart_objects::SmartObject(\n smart_objects::SmartType_Map);\n\n msg_params[strings::app_id] = app->app_id();\n\n for (; vehicle_data.end() != it; ++it) {\n std::string key_name = it->first;\n if ((*message_)[strings::msg_params].keyExists(key_name)) {\n bool is_key_enabled = (*message_)[strings::msg_params][key_name].asBool();\n if (is_key_enabled) {\n ++items_to_unsubscribe;\n msg_params[key_name] = is_key_enabled;\n\n VehicleDataType key_type = it->second;\n if (app->UnsubscribeFromIVI(static_cast<uint32_t>(key_type))) {\n ++unsubscribed_items;\n } else {\n response_params[key_name][strings::data_type] = key_type;\n response_params[key_name][strings::result_code] =\n mobile_apis::VehicleDataResultCode::VDRC_DATA_NOT_SUBSCRIBED;\n }\n }\n }\n }\n\n if (0 == items_to_unsubscribe) {\n if (HasDisallowedParams()) {\n SendResponse(false, mobile_apis::Result::DISALLOWED);\n } else {\n SendResponse(false, mobile_apis::Result::INVALID_DATA,\n \"No data in the request.\");\n }\n return;\n } else if (0 == unsubscribed_items) {\n SendResponse(false, mobile_apis::Result::IGNORED,\n \"Was not subscribed on any VehicleData.\", &response_params);\n return;\n }\n\n#ifdef HMI_DBUS_API\n \/\/Generate list of subrequests\n for (size_t i = 0; i < sizeof(subrequests) \/ sizeof(subrequests[0]); ++i) {\n const Subrequest& sr = subrequests[i];\n if (true == (*message_)[strings::msg_params].keyExists(sr.str)\n && true == (*message_)[strings::msg_params][sr.str].asBool()) {\n HmiRequest hmi_request;\n hmi_request.str = sr.str;\n hmi_request.func_id = sr.func_id;\n hmi_request.complete = false;\n hmi_requests_.push_back(hmi_request);\n }\n }\n LOG4CXX_INFO(logger_,\n hmi_requests_.size() << \" requests are going to be sent to HMI\");\n\n \/\/Send subrequests\n for (HmiRequests::const_iterator it = hmi_requests_.begin();\n it != hmi_requests_.end(); ++it)\n SendHMIRequest(it->func_id, &msg_params, true);\n#else\n SendHMIRequest(hmi_apis::FunctionID::VehicleInfo_UnsubscribeVehicleData,\n &msg_params, true);\n#endif \/\/ #ifdef HMI_DBUS_API\n}\n\nvoid UnsubscribeVehicleDataRequest::on_event(const event_engine::Event& event) {\n LOG4CXX_AUTO_TRACE(logger_);\n\n const smart_objects::SmartObject& message = event.smart_object();\n\n#ifdef HMI_DBUS_API\n for (HmiRequests::iterator it = hmi_requests_.begin();\n it != hmi_requests_.end(); ++it) {\n HmiRequest & hmi_request = *it;\n if (hmi_request.func_id == event.id()) {\n hmi_request.status =\n static_cast<hmi_apis::Common_Result::eType>(message[strings::params][hmi_response::code]\n .asInt());\n if (hmi_apis::Common_Result::SUCCESS == hmi_request.status)\n hmi_request.value = message[strings::msg_params][hmi_request.str];\n hmi_request.complete = true;\n break;\n }\n }\n bool all_complete = true;\n bool any_arg_success = false;\n mobile_api::Result::eType status = mobile_api::Result::eType::SUCCESS;\n for (HmiRequests::const_iterator it = hmi_requests_.begin();\n it != hmi_requests_.end(); ++it) {\n if (!it->complete) {\n all_complete = false;\n break;\n }\n if (hmi_apis::Common_Result::SUCCESS != it->status) {\n if (mobile_api::Result::SUCCESS == status) {\n status = static_cast<mobile_apis::Result::eType>(it->status);\n } else if (status\n != static_cast<mobile_apis::Result::eType>(it->status)) {\n status = mobile_api::Result::eType::GENERIC_ERROR;\n } LOG4CXX_TRACE(logger_, \"Status from HMI: \" << it->status <<\n \", so response status become \" << status);\n } else {\n any_arg_success = true;\n }\n }\n if (all_complete) {\n smart_objects::SmartObject response_params(smart_objects::SmartType_Map);\n if (any_arg_success) {\n for (HmiRequests::const_iterator it = hmi_requests_.begin();\n it != hmi_requests_.end(); ++it) {\n response_params[it->str] = it->value;\n }\n }\n\n LOG4CXX_INFO(logger_, \"All HMI requests are complete\");\n if (true == any_arg_success) {\n SetAllowedToTerminate(false);\n }\n SendResponse(any_arg_success, status, NULL, &response_params);\n if (true == any_arg_success) {\n UpdateHash();\n }\n#else\n hmi_apis::Common_Result::eType hmi_result =\n static_cast<hmi_apis::Common_Result::eType>(\n message[strings::params][hmi_response::code].asInt());\n\n bool result =\n hmi_result == hmi_apis::Common_Result::SUCCESS;\n\n mobile_apis::Result::eType result_code =\n hmi_result == hmi_apis::Common_Result::SUCCESS\n ? mobile_apis::Result::SUCCESS\n : static_cast<mobile_apis::Result::eType>(\n message[strings::params][hmi_response::code].asInt());\n\n const char* return_info = NULL;\n\n if (result) {\n if (IsAnythingAlreadyUnsubscribed(message[strings::msg_params])) {\n result_code = mobile_apis::Result::IGNORED;\n return_info =\n std::string(\"Some provided VehicleData was not subscribed.\").c_str();\n }\n }\n\n if (true == result) {\n SetAllowedToTerminate(false);\n }\n SendResponse(result, result_code, return_info,\n &(message[strings::msg_params]));\n if (true == result) {\n UpdateHash();\n }\n#endif \/\/ #ifdef HMI_DBUS_API\n}\n\nbool UnsubscribeVehicleDataRequest::IsAnythingAlreadyUnsubscribed(\n const smart_objects::SmartObject& msg_params) const {\n LOG4CXX_INFO(logger_, \"IsAnythingAlreadyUnsubscribed\");\n\n const VehicleData& vehicle_data = MessageHelper::vehicle_data();\n VehicleData::const_iterator it = vehicle_data.begin();\n\n for (; vehicle_data.end() != it; ++it) {\n if (msg_params.keyExists(it->first)) {\n if (msg_params[it->first][strings::result_code].asInt() ==\n hmi_apis::Common_VehicleDataResultCode::VDRC_DATA_NOT_SUBSCRIBED) {\n return true;\n }\n }\n }\n\n return false;\n}\n\nvoid UnsubscribeVehicleDataRequest::UpdateHash() const {\n LOG4CXX_AUTO_TRACE(logger_);\n ApplicationSharedPtr application =\n ApplicationManagerImpl::instance()->application(connection_key());\n if (application) {\n application->UpdateHash();\n } else {\n LOG4CXX_ERROR(logger_, \"NULL pointer\");\n }\n ApplicationManagerImpl::instance()->TerminateRequest(connection_key(),\n correlation_id());\n}\n\n\n} \/\/ namespace commands\n} \/\/ namespace application_manager\n<commit_msg>Fixed comments after review<commit_after>\/*\n\n Copyright (c) 2013, Ford Motor Company\n All rights reserved.\n\n Redistribution and use in source and binary forms, with or without\n modification, are permitted provided that the following conditions are met:\n\n Redistributions of source code must retain the above copyright notice, this\n list of conditions and the following disclaimer.\n\n Redistributions in binary form must reproduce the above copyright notice,\n this list of conditions and the following\n disclaimer in the documentation and\/or other materials provided with the\n distribution.\n\n Neither the name of the Ford Motor Company nor the names of its contributors\n may be used to endorse or promote products derived from this software\n without specific prior written permission.\n\n THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS \"AS IS\"\n AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE\n IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE\n ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE\n LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR\n CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF\n SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS\n INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN\n CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)\n ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE\n POSSIBILITY OF SUCH DAMAGE.\n *\/\n\n#include \"application_manager\/commands\/mobile\/unsubscribe_vehicle_data_request.h\"\n#include \"application_manager\/commands\/command_impl.h\"\n#include \"application_manager\/application_manager_impl.h\"\n#include \"application_manager\/application_impl.h\"\n#include \"application_manager\/message_helper.h\"\n#include \"interfaces\/MOBILE_API.h\"\n#include \"interfaces\/HMI_API.h\"\n#include \"application_manager\/smart_object_keys.h\"\n\nnamespace application_manager {\nnamespace commands {\n\nUnsubscribeVehicleDataRequest::UnsubscribeVehicleDataRequest(\n const MessageSharedPtr& message)\n : CommandRequestImpl(message) {\n}\n\nUnsubscribeVehicleDataRequest::~UnsubscribeVehicleDataRequest() {\n}\n\n#ifdef HMI_DBUS_API\nnamespace {\n struct Subrequest {\n hmi_apis::FunctionID::eType func_id;\n const char* str;\n };\n Subrequest subrequests[] = {\n { hmi_apis::FunctionID::VehicleInfo_UnsubscribeGps, strings::gps},\n { hmi_apis::FunctionID::VehicleInfo_UnsubscribeSpeed, strings::speed},\n { hmi_apis::FunctionID::VehicleInfo_UnsubscribeRpm, strings::rpm},\n { hmi_apis::FunctionID::VehicleInfo_UnsubscribeFuelLevel, strings::fuel_level},\n { hmi_apis::FunctionID::VehicleInfo_UnsubscribeFuelLevel_State, strings::fuel_level_state},\n { hmi_apis::FunctionID::VehicleInfo_UnsubscribeInstantFuelConsumption, strings::instant_fuel_consumption},\n { hmi_apis::FunctionID::VehicleInfo_UnsubscribeExternalTemperature, strings::external_temp},\n { hmi_apis::FunctionID::VehicleInfo_UnsubscribeVin, strings::vin},\n { hmi_apis::FunctionID::VehicleInfo_UnsubscribePrndl, strings::prndl},\n { hmi_apis::FunctionID::VehicleInfo_UnsubscribeTirePressure, strings::tire_pressure},\n { hmi_apis::FunctionID::VehicleInfo_UnsubscribeOdometer, strings::odometer},\n { hmi_apis::FunctionID::VehicleInfo_UnsubscribeBeltStatus, strings::belt_status},\n { hmi_apis::FunctionID::VehicleInfo_UnsubscribeBodyInformation, strings::body_information},\n { hmi_apis::FunctionID::VehicleInfo_UnsubscribeDeviceStatus, strings::device_status},\n { hmi_apis::FunctionID::VehicleInfo_UnsubscribeDriverBraking, strings::driver_braking},\n { hmi_apis::FunctionID::VehicleInfo_UnsubscribeWiperStatus, strings::wiper_status},\n { hmi_apis::FunctionID::VehicleInfo_UnsubscribeHeadLampStatus, strings::head_lamp_status},\n { hmi_apis::FunctionID::VehicleInfo_UnsubscribeEngineTorque, strings::engine_torque},\n { hmi_apis::FunctionID::VehicleInfo_UnsubscribeAccPedalPosition, strings::acc_pedal_pos},\n { hmi_apis::FunctionID::VehicleInfo_UnsubscribeSteeringWheelAngle, strings::steering_wheel_angle},\n { hmi_apis::FunctionID::VehicleInfo_UnsubscribeECallInfo, strings::e_call_info},\n { hmi_apis::FunctionID::VehicleInfo_UnsubscribeAirbagStatus, strings::airbag_status},\n { hmi_apis::FunctionID::VehicleInfo_UnsubscribeEmergencyEvent, strings::emergency_event},\n { hmi_apis::FunctionID::VehicleInfo_UnsubscribeClusterModeStatus, strings::cluster_mode_status},\n { hmi_apis::FunctionID::VehicleInfo_UnsubscribeMyKey, strings::my_key},\n };\n}\n#endif \/\/ #ifdef HMI_DBUS_API\n\nvoid UnsubscribeVehicleDataRequest::Run() {\n LOG4CXX_AUTO_TRACE(logger_);\n\n ApplicationSharedPtr app = ApplicationManagerImpl::instance()->application(\n CommandRequestImpl::connection_key());\n\n if (!app) {\n LOG4CXX_ERROR(logger_, \"NULL pointer\");\n SendResponse(false, mobile_apis::Result::APPLICATION_NOT_REGISTERED);\n return;\n }\n\n \/\/ counter for items to subscribe\n int32_t items_to_unsubscribe = 0;\n \/\/ counter for subscribed items by application\n int32_t unsubscribed_items = 0;\n\n const VehicleData& vehicle_data = MessageHelper::vehicle_data();\n VehicleData::const_iterator it = vehicle_data.begin();\n\n smart_objects::SmartObject msg_params = smart_objects::SmartObject(\n smart_objects::SmartType_Map);\n\n smart_objects::SmartObject response_params = smart_objects::SmartObject(\n smart_objects::SmartType_Map);\n\n msg_params[strings::app_id] = app->app_id();\n\n for (; vehicle_data.end() != it; ++it) {\n std::string key_name = it->first;\n if ((*message_)[strings::msg_params].keyExists(key_name)) {\n bool is_key_enabled = (*message_)[strings::msg_params][key_name].asBool();\n if (is_key_enabled) {\n ++items_to_unsubscribe;\n msg_params[key_name] = is_key_enabled;\n\n VehicleDataType key_type = it->second;\n if (app->UnsubscribeFromIVI(static_cast<uint32_t>(key_type))) {\n ++unsubscribed_items;\n } else {\n response_params[key_name][strings::data_type] = key_type;\n response_params[key_name][strings::result_code] =\n mobile_apis::VehicleDataResultCode::VDRC_DATA_NOT_SUBSCRIBED;\n }\n }\n }\n }\n\n if (0 == items_to_unsubscribe) {\n if (HasDisallowedParams()) {\n SendResponse(false, mobile_apis::Result::DISALLOWED);\n } else {\n SendResponse(false, mobile_apis::Result::INVALID_DATA,\n \"No data in the request.\");\n }\n return;\n } else if (0 == unsubscribed_items) {\n SendResponse(false, mobile_apis::Result::IGNORED,\n \"Was not subscribed on any VehicleData.\", &response_params);\n return;\n }\n\n#ifdef HMI_DBUS_API\n \/\/Generate list of subrequests\n for (size_t i = 0; i < sizeof(subrequests) \/ sizeof(subrequests[0]); ++i) {\n const Subrequest& sr = subrequests[i];\n if (true == (*message_)[strings::msg_params].keyExists(sr.str)\n && true == (*message_)[strings::msg_params][sr.str].asBool()) {\n HmiRequest hmi_request;\n hmi_request.str = sr.str;\n hmi_request.func_id = sr.func_id;\n hmi_request.complete = false;\n hmi_requests_.push_back(hmi_request);\n }\n }\n LOG4CXX_INFO(logger_,\n hmi_requests_.size() << \" requests are going to be sent to HMI\");\n\n \/\/Send subrequests\n for (HmiRequests::const_iterator it = hmi_requests_.begin();\n it != hmi_requests_.end(); ++it)\n SendHMIRequest(it->func_id, &msg_params, true);\n#else\n SendHMIRequest(hmi_apis::FunctionID::VehicleInfo_UnsubscribeVehicleData,\n &msg_params, true);\n#endif \/\/ #ifdef HMI_DBUS_API\n}\n\nvoid UnsubscribeVehicleDataRequest::on_event(const event_engine::Event& event) {\n LOG4CXX_AUTO_TRACE(logger_);\n\n const smart_objects::SmartObject& message = event.smart_object();\n\n#ifdef HMI_DBUS_API\n for (HmiRequests::iterator it = hmi_requests_.begin();\n it != hmi_requests_.end(); ++it) {\n HmiRequest & hmi_request = *it;\n if (hmi_request.func_id == event.id()) {\n hmi_request.status =\n static_cast<hmi_apis::Common_Result::eType>(message[strings::params][hmi_response::code]\n .asInt());\n if (hmi_apis::Common_Result::SUCCESS == hmi_request.status)\n hmi_request.value = message[strings::msg_params][hmi_request.str];\n hmi_request.complete = true;\n break;\n }\n }\n bool all_complete = true;\n bool any_arg_success = false;\n mobile_api::Result::eType status = mobile_api::Result::eType::SUCCESS;\n for (HmiRequests::const_iterator it = hmi_requests_.begin();\n it != hmi_requests_.end(); ++it) {\n if (!it->complete) {\n all_complete = false;\n break;\n }\n if (hmi_apis::Common_Result::SUCCESS != it->status) {\n if (mobile_api::Result::SUCCESS == status) {\n status = static_cast<mobile_apis::Result::eType>(it->status);\n } else if (status\n != static_cast<mobile_apis::Result::eType>(it->status)) {\n status = mobile_api::Result::eType::GENERIC_ERROR;\n } LOG4CXX_TRACE(logger_, \"Status from HMI: \" << it->status <<\n \", so response status become \" << status);\n } else {\n any_arg_success = true;\n }\n }\n if (all_complete) {\n smart_objects::SmartObject response_params(smart_objects::SmartType_Map);\n if (any_arg_success) {\n for (HmiRequests::const_iterator it = hmi_requests_.begin();\n it != hmi_requests_.end(); ++it) {\n response_params[it->str] = it->value;\n }\n }\n\n LOG4CXX_INFO(logger_, \"All HMI requests are complete\");\n if (true == any_arg_success) {\n SetAllowedToTerminate(false);\n }\n SendResponse(any_arg_success, status, NULL, &response_params);\n if (true == any_arg_success) {\n UpdateHash();\n }\n#else\n hmi_apis::Common_Result::eType hmi_result =\n static_cast<hmi_apis::Common_Result::eType>(\n message[strings::params][hmi_response::code].asInt());\n\n bool result =\n hmi_result == hmi_apis::Common_Result::SUCCESS;\n\n mobile_apis::Result::eType result_code =\n hmi_result == hmi_apis::Common_Result::SUCCESS\n ? mobile_apis::Result::SUCCESS\n : static_cast<mobile_apis::Result::eType>(\n message[strings::params][hmi_response::code].asInt());\n\n const char* return_info = NULL;\n\n if (result) {\n if (IsAnythingAlreadyUnsubscribed(message[strings::msg_params])) {\n result_code = mobile_apis::Result::IGNORED;\n return_info =\n std::string(\"Some provided VehicleData was not subscribed.\").c_str();\n }\n }\n\n if (true == result) {\n SetAllowedToTerminate(false);\n }\n SendResponse(result, result_code, return_info,\n &(message[strings::msg_params]));\n if (true == result) {\n UpdateHash();\n }\n#endif \/\/ #ifdef HMI_DBUS_API\n}\n\nbool UnsubscribeVehicleDataRequest::IsAnythingAlreadyUnsubscribed(\n const smart_objects::SmartObject& msg_params) const {\n LOG4CXX_INFO(logger_, \"IsAnythingAlreadyUnsubscribed\");\n\n const VehicleData& vehicle_data = MessageHelper::vehicle_data();\n VehicleData::const_iterator it = vehicle_data.begin();\n\n for (; vehicle_data.end() != it; ++it) {\n if (msg_params.keyExists(it->first)) {\n if (msg_params[it->first][strings::result_code].asInt() ==\n hmi_apis::Common_VehicleDataResultCode::VDRC_DATA_NOT_SUBSCRIBED) {\n return true;\n }\n }\n }\n\n return false;\n}\n\nvoid UnsubscribeVehicleDataRequest::UpdateHash() const {\n LOG4CXX_AUTO_TRACE(logger_);\n ApplicationSharedPtr application =\n ApplicationManagerImpl::instance()->application(connection_key());\n if (application) {\n application->UpdateHash();\n } else {\n LOG4CXX_ERROR(logger_, \"Application with connection_key = \"<<connection_key()\n <<\"doesn't exists\");\n }\n ApplicationManagerImpl::instance()->TerminateRequest(connection_key(),\n correlation_id());\n}\n\n\n} \/\/ namespace commands\n} \/\/ namespace application_manager\n<|endoftext|>"} {"text":"<commit_before>#include \"videosourcefactory.h\"\n\nnamespace gg\n{\n\nVideoSourceFactory VideoSourceFactory::_factory_singleton;\n\nVideoSourceFactory::VideoSourceFactory()\n{\n for (size_t i = 0; i < NUM_DEVICES; i++)\n _devices[i] = nullptr;\n}\n\nVideoSourceFactory::~VideoSourceFactory()\n{\n free_device(DVI2PCIeDuo_DVI);\n free_device(DVI2PCIeDuo_SDI);\n}\n\nVideoSourceFactory & VideoSourceFactory::get_instance()\n{\n return _factory_singleton;\n}\n\nIVideoSource * VideoSourceFactory::get_device(Device device,\n ColourSpace colour)\n{\n \/\/ TODO\n}\n\nvoid VideoSourceFactory::free_device(Device device)\n{\n if (_devices[(int) device] != nullptr)\n delete _devices[(int) device];\n _devices[(int) device] = nullptr;\n}\n\n}\n<commit_msg>Issue #121: amended free_device with device check as in Factory::disconnect<commit_after>#include \"videosourcefactory.h\"\n\nnamespace gg\n{\n\nVideoSourceFactory VideoSourceFactory::_factory_singleton;\n\nVideoSourceFactory::VideoSourceFactory()\n{\n for (size_t i = 0; i < NUM_DEVICES; i++)\n _devices[i] = nullptr;\n}\n\nVideoSourceFactory::~VideoSourceFactory()\n{\n free_device(DVI2PCIeDuo_DVI);\n free_device(DVI2PCIeDuo_SDI);\n}\n\nVideoSourceFactory & VideoSourceFactory::get_instance()\n{\n return _factory_singleton;\n}\n\nIVideoSource * VideoSourceFactory::get_device(Device device,\n ColourSpace colour)\n{\n \/\/ TODO\n if (_devices[(int) device] == nullptr)\n {\n _devices[(int) device] = new DummyVideoSource;\n _device_colours[(int) device] = colour;\n }\n else if (_device_colours[(int) device] != colour)\n throw DeviceAlreadyConnected(\n \"Device already connected using another colour space\"\n );\n return _devices[(int) device];\n}\n\nvoid VideoSourceFactory::free_device(Device device)\n{\n switch (device)\n {\n case DVI2PCIeDuo_DVI:\n case DVI2PCIeDuo_SDI:\n break; \/\/ everything up to here is recognised\n default:\n std::string msg;\n msg.append(\"Device \")\n .append(std::to_string(device))\n .append(\" not recognised\");\n throw DeviceNotFound(msg);\n }\n\n if (_devices[(int) device] != nullptr)\n delete _devices[(int) device];\n _devices[(int) device] = nullptr;\n}\n\n}\n<|endoftext|>"} {"text":"<commit_before>\/\/****************************************************************************\n\/\/ Copyright © 2015 Jan Erik Breimo. All rights reserved.\n\/\/ Created by Jan Erik Breimo on 2015-10-23.\n\/\/\n\/\/ This file is distributed under the BSD License.\n\/\/ License text is included with the source distribution.\n\/\/****************************************************************************\n#include \"Converter.hpp\"\n\n#include <vector>\n#include \"..\/EncodingInfo.hpp\"\n#include \"..\/PrivatePlatformDetails.hpp\"\n#include \"..\/YstringException.hpp\"\n#include \"Utf8Decoder.hpp\"\n#include \"Utf8Encoder.hpp\"\n#include \"Utf16Decoder.hpp\"\n#include \"Utf16Encoder.hpp\"\n#include \"Utf32Decoder.hpp\"\n#include \"Utf32Encoder.hpp\"\n\nnamespace Ystring { namespace Conversion {\n\n namespace {\n\n const size_t DEFAULT_BUFFER_SIZE = 256;\n\n std::unique_ptr<AbstractDecoder> makeDecoder(Encoding_t encoding);\n\n std::unique_ptr<AbstractEncoder> makeEncoder(Encoding_t encoding);\n\n template<typename CharT, typename StringT>\n size_t copy(const CharT* src,\n size_t srcLength,\n StringT& dst,\n size_t charSize);\n\n template <typename T>\n void swapEndianness(T* str, size_t length);\n\n }\n\n Converter::Converter(Encoding_t srcEncoding, Encoding_t dstEncoding)\n : m_Decoder(makeDecoder(srcEncoding)),\n m_Encoder(makeEncoder(dstEncoding)),\n m_ConversionType(getConversionType(srcEncoding, dstEncoding)),\n m_BufferSize(DEFAULT_BUFFER_SIZE)\n {}\n\n Converter::~Converter()\n {}\n\n size_t Converter::bufferSize() const\n {\n return m_BufferSize;\n }\n\n void Converter::setBufferSize(size_t value)\n {\n m_BufferSize = value;\n }\n\n void Converter::setErrorHandlingPolicy(ErrorHandlingPolicy_t value)\n {\n setDecoderErrorHandlingPolicy(value);\n setEncoderErrorHandlingPolicy(value);\n }\n\n ErrorHandlingPolicy_t Converter::decoderErrorHandlingPolicy() const\n {\n return m_Decoder->errorHandlingPolicy();\n }\n\n void Converter::setDecoderErrorHandlingPolicy(ErrorHandlingPolicy_t value)\n {\n m_Decoder->setErrorHandlingPolicy(value);\n }\n\n ErrorHandlingPolicy_t Converter::encoderErrorHandlingPolicy() const\n {\n return m_Encoder->errorHandlingPolicy();\n }\n\n void Converter::setEncoderErrorHandlingPolicy(ErrorHandlingPolicy_t value)\n {\n m_Encoder->setErrorHandlingPolicy(value);\n }\n\n void Converter::setReplacementCharacter(char32_t value)\n {\n setDecoderReplacementCharacter(value);\n setEncoderReplacementCharacter(value);\n }\n\n char32_t Converter::decoderReplacementCharacter() const\n {\n return m_Decoder->replacementCharacter();\n }\n\n void Converter::setDecoderReplacementCharacter(char32_t value)\n {\n m_Decoder->setReplacementCharacter(value);\n }\n\n char32_t Converter::encoderReplacementCharacter() const\n {\n return m_Encoder->replacementCharacter();\n }\n\n void Converter::setEncoderReplacementCharacter(char32_t value)\n {\n m_Encoder->setReplacementCharacter(value);\n }\n\n Encoding_t Converter::decoderEncoding() const\n {\n if (!m_Decoder)\n return Encoding::UNKNOWN;\n return m_Decoder->encoding();\n }\n\n Encoding_t Converter::encoderEncoding() const\n {\n if (!m_Encoder)\n return Encoding::UNKNOWN;\n return m_Encoder->encoding();\n }\n\n size_t Converter::convert(const char* source,\n size_t sourceLength,\n std::string& destination,\n bool sourceIsIncomplete)\n {\n return convertImpl(internal_char_type_cast(source),\n sourceLength,\n destination,\n sourceIsIncomplete);\n }\n\n size_t Converter::convert(const char* source,\n size_t sourceLength,\n std::u16string& destination,\n bool sourceIsIncomplete)\n {\n return convertImpl(internal_char_type_cast(source),\n sourceLength,\n destination,\n sourceIsIncomplete);\n }\n\n size_t Converter::convert(const char* source,\n size_t sourceLength,\n std::u32string& destination,\n bool sourceIsIncomplete)\n {\n return convertImpl(internal_char_type_cast(source),\n sourceLength,\n destination,\n sourceIsIncomplete);\n }\n\n size_t Converter::convert(const char* source,\n size_t sourceLength,\n std::wstring& destination,\n bool sourceIsIncomplete)\n {\n return convertImpl(internal_char_type_cast(source),\n sourceLength,\n destination,\n sourceIsIncomplete);\n }\n\n size_t Converter::convert(const char16_t* source,\n size_t sourceLength,\n std::string& destination,\n bool sourceIsIncomplete)\n {\n return convertImpl(internal_char_type_cast(source),\n sourceLength,\n destination,\n sourceIsIncomplete);\n }\n\n size_t Converter::convert(const char16_t* source,\n size_t sourceLength,\n std::u16string& destination,\n bool sourceIsIncomplete)\n {\n return convertImpl(internal_char_type_cast(source),\n sourceLength,\n destination,\n sourceIsIncomplete);\n }\n\n size_t Converter::convert(const char16_t* source,\n size_t sourceLength,\n std::u32string& destination,\n bool sourceIsIncomplete)\n {\n return convertImpl(internal_char_type_cast(source),\n sourceLength,\n destination,\n sourceIsIncomplete);\n }\n\n size_t Converter::convert(const char16_t* source,\n size_t sourceLength,\n std::wstring& destination,\n bool sourceIsIncomplete)\n {\n return convertImpl(internal_char_type_cast(source),\n sourceLength,\n destination,\n sourceIsIncomplete);\n }\n\n size_t Converter::convert(const char32_t* source,\n size_t sourceLength,\n std::string& destination,\n bool sourceIsIncomplete)\n {\n return convertImpl(internal_char_type_cast(source),\n sourceLength,\n destination,\n sourceIsIncomplete);\n }\n\n size_t Converter::convert(const char32_t* source,\n size_t sourceLength,\n std::u16string& destination,\n bool sourceIsIncomplete)\n {\n return convertImpl(internal_char_type_cast(source),\n sourceLength,\n destination,\n sourceIsIncomplete);\n }\n\n size_t Converter::convert(const char32_t* source,\n size_t sourceLength,\n std::u32string& destination,\n bool sourceIsIncomplete)\n {\n return convertImpl(internal_char_type_cast(source),\n sourceLength,\n destination,\n sourceIsIncomplete);\n }\n\n size_t Converter::convert(const char32_t* source,\n size_t sourceLength,\n std::wstring& destination,\n bool sourceIsIncomplete)\n {\n return convertImpl(internal_char_type_cast(source),\n sourceLength,\n destination,\n sourceIsIncomplete);\n }\n\n size_t Converter::convert(const wchar_t* source,\n size_t sourceLength,\n std::string& destination,\n bool sourceIsIncomplete)\n {\n return convertImpl(internal_char_type_cast(source),\n sourceLength,\n destination,\n sourceIsIncomplete);\n }\n\n size_t Converter::convert(const wchar_t* source,\n size_t sourceLength,\n std::u16string& destination,\n bool sourceIsIncomplete)\n {\n return convertImpl(internal_char_type_cast(source),\n sourceLength,\n destination,\n sourceIsIncomplete);\n }\n\n size_t Converter::convert(const wchar_t* source,\n size_t sourceLength,\n std::u32string& destination,\n bool sourceIsIncomplete)\n {\n return convertImpl(internal_char_type_cast(source),\n sourceLength,\n destination,\n sourceIsIncomplete);\n }\n\n size_t Converter::convert(const wchar_t* source,\n size_t sourceLength,\n std::wstring& destination,\n bool sourceIsIncomplete)\n {\n return convertImpl(internal_char_type_cast(source),\n sourceLength,\n destination,\n sourceIsIncomplete);\n }\n\n Converter::ConversionType Converter::getConversionType(\n Encoding_t src, Encoding_t dst)\n {\n if (src == dst)\n return COPY;\n if ((src == Encoding::UTF_16_LE && dst == Encoding::UTF_16_BE)\n || (src == Encoding::UTF_16_BE && dst == Encoding::UTF_16_LE)\n || (src == Encoding::UTF_32_LE && dst == Encoding::UTF_32_BE)\n || (src == Encoding::UTF_32_BE && dst == Encoding::UTF_32_LE))\n {\n return SWAP_ENDIANNESS;\n }\n return CONVERT;\n }\n\n template<typename CharT, typename StringT>\n size_t Converter::convertImpl(const CharT* src,\n size_t srcLength,\n StringT& dst,\n bool sourceIsIncomplete)\n {\n switch (m_ConversionType)\n {\n case SWAP_ENDIANNESS:\n return doCopyAndSwapBytes(src, srcLength, dst, sourceIsIncomplete);\n case COPY:\n return doCopy(src, srcLength, dst, sourceIsIncomplete);\n case CONVERT:\n return doConvert(src, srcLength, dst, sourceIsIncomplete);\n }\n return 0;\n }\n\n template<typename CharT, typename StringT>\n size_t Converter::doConvert(const CharT* src,\n size_t srcLength,\n StringT& dst,\n bool sourceIsIncomplete)\n {\n auto srcBeg = src;\n auto srcEnd = src + srcLength;\n auto bufSize = std::min(srcLength, m_BufferSize);\n std::vector<char32_t> buffer(bufSize);\n auto bufEnd = buffer.data() + bufSize;\n while (srcBeg != srcEnd)\n {\n auto bufIt = buffer.data();\n auto result = m_Decoder->decode(srcBeg, srcEnd, bufIt, bufEnd,\n sourceIsIncomplete);\n auto bufBeg = static_cast<const char32_t*>(buffer.data());\n m_Encoder->encode(bufBeg, bufIt, dst);\n if (result != DecoderResult::OK)\n break;\n }\n return srcBeg - src;\n }\n\n template<typename CharT, typename StringT>\n size_t Converter::doCopy(const CharT* src,\n size_t srcLength,\n StringT& dst,\n bool sourceIsIncomplete)\n {\n typedef typename StringT::value_type StringChar;\n auto unitSize = m_Decoder->characterUnitSize();\n auto checkResult = m_Decoder->checkString(src, src + srcLength,\n sourceIsIncomplete);\n if (checkResult.first\n && (sizeof(CharT) == 1 || sizeof(CharT) == unitSize)\n && (sizeof(StringChar) == 1 || sizeof(StringChar) == unitSize))\n {\n srcLength = checkResult.second - src;\n return copy(src, srcLength, dst, unitSize);\n }\n else\n {\n return doConvert(src, srcLength, dst, sourceIsIncomplete);\n }\n }\n\n template<typename CharT, typename StringT>\n size_t Converter::doCopyAndSwapBytes(const CharT* src,\n size_t srcLength,\n StringT& dst,\n bool sourceIsIncomplete)\n {\n typedef typename StringT::value_type StringChar;\n auto unitSize = m_Decoder->characterUnitSize();\n auto checkResult = m_Decoder->checkString(src, src + srcLength,\n sourceIsIncomplete);\n if (checkResult.first\n && (sizeof(CharT) == 1 || sizeof(CharT) == unitSize)\n && sizeof(StringChar) == unitSize)\n {\n auto initialSize = dst.size();\n srcLength = checkResult.second - src;\n auto result = copy(src, srcLength, dst, unitSize);\n swapEndianness(&dst[initialSize], dst.size() - initialSize);\n return result;\n }\n else\n {\n return doConvert(src, srcLength, dst, sourceIsIncomplete);\n }\n }\n\n namespace {\n\n std::unique_ptr<AbstractDecoder> makeDecoder(Encoding_t encoding)\n {\n switch (encoding)\n {\n case Encoding::UTF_8:\n return std::unique_ptr<AbstractDecoder>(new Utf8Decoder);\n case Encoding::UTF_16_BE:\n return std::unique_ptr<AbstractDecoder>(new Utf16BEDecoder);\n case Encoding::UTF_16_LE:\n return std::unique_ptr<AbstractDecoder>(new Utf16LEDecoder);\n case Encoding::UTF_32_BE:\n return std::unique_ptr<AbstractDecoder>(new Utf32BEDecoder);\n case Encoding::UTF_32_LE:\n return std::unique_ptr<AbstractDecoder>(new Utf32LEDecoder);\n default:\n break;\n }\n\n auto info = getEncodingInfo(encoding);\n auto name = info ? info->name()\n : std::to_string(int64_t(encoding));\n YSTRING_THROW(\"Unsupported source-encoding: \" + name);\n }\n\n std::unique_ptr<AbstractEncoder> makeEncoder(Encoding_t encoding)\n {\n switch (encoding)\n {\n case Encoding::ASCII:\n break;\n case Encoding::UTF_8:\n return std::unique_ptr<AbstractEncoder>(new Utf8Encoder);\n case Encoding::UTF_16_BE:\n return std::unique_ptr<AbstractEncoder>(new Utf16BEEncoder);\n case Encoding::UTF_16_LE:\n return std::unique_ptr<AbstractEncoder>(new Utf16LEEncoder);\n case Encoding::UTF_32_BE:\n return std::unique_ptr<AbstractEncoder>(new Utf32BEEncoder);\n case Encoding::UTF_32_LE:\n return std::unique_ptr<AbstractEncoder>(new Utf32LEEncoder);\n default:\n break;\n }\n\n auto info = getEncodingInfo(encoding);\n auto name = info ? info->name()\n : std::to_string(int64_t(encoding));\n YSTRING_THROW(\"Unsupported source-encoding: \" + name);\n }\n\n template<typename CharT, typename StringT>\n size_t copy(const CharT* src,\n size_t srcLength,\n StringT& dst,\n size_t charSize)\n {\n typedef typename StringT::value_type DstChar;\n auto srcMemLength = srcLength * sizeof(CharT);\n srcMemLength -= srcMemLength % charSize;\n auto dstLength = srcMemLength \/ sizeof(DstChar);\n auto initialDstSize = dst.size();\n dst.resize(initialDstSize + dstLength);\n std::memcpy(&dst[initialDstSize], src, srcMemLength);\n return srcMemLength \/ sizeof(CharT);\n }\n\n template <typename T>\n void swapEndianness(T* str, size_t length)\n {\n for (size_t i = 0; i < length; ++i)\n str[i] = Utilities::reverseBytes(str[i]);\n }\n\n }\n}}\n<commit_msg>Fixing things g++ doesn’t like.<commit_after>\/\/****************************************************************************\n\/\/ Copyright © 2015 Jan Erik Breimo. All rights reserved.\n\/\/ Created by Jan Erik Breimo on 2015-10-23.\n\/\/\n\/\/ This file is distributed under the BSD License.\n\/\/ License text is included with the source distribution.\n\/\/****************************************************************************\n#include \"Converter.hpp\"\n\n#include <vector>\n#include \"..\/EncodingInfo.hpp\"\n#include \"..\/PrivatePlatformDetails.hpp\"\n#include \"..\/YstringException.hpp\"\n#include \"Utf8Decoder.hpp\"\n#include \"Utf8Encoder.hpp\"\n#include \"Utf16Decoder.hpp\"\n#include \"Utf16Encoder.hpp\"\n#include \"Utf32Decoder.hpp\"\n#include \"Utf32Encoder.hpp\"\n\nnamespace Ystring { namespace Conversion {\n\n namespace {\n\n const size_t DEFAULT_BUFFER_SIZE = 256;\n\n std::unique_ptr<AbstractDecoder> makeDecoder(Encoding_t encoding);\n\n std::unique_ptr<AbstractEncoder> makeEncoder(Encoding_t encoding);\n\n template<typename CharT, typename StringT>\n size_t copy(const CharT* src,\n size_t srcLength,\n StringT& dst,\n size_t charSize);\n\n template <typename T>\n void swapEndianness(T* str, size_t length);\n\n }\n\n Converter::Converter(Encoding_t srcEncoding, Encoding_t dstEncoding)\n : m_Decoder(makeDecoder(srcEncoding)),\n m_Encoder(makeEncoder(dstEncoding)),\n m_ConversionType(getConversionType(srcEncoding, dstEncoding)),\n m_BufferSize(DEFAULT_BUFFER_SIZE)\n {}\n\n Converter::~Converter()\n {}\n\n size_t Converter::bufferSize() const\n {\n return m_BufferSize;\n }\n\n void Converter::setBufferSize(size_t value)\n {\n m_BufferSize = value;\n }\n\n void Converter::setErrorHandlingPolicy(ErrorHandlingPolicy_t value)\n {\n setDecoderErrorHandlingPolicy(value);\n setEncoderErrorHandlingPolicy(value);\n }\n\n ErrorHandlingPolicy_t Converter::decoderErrorHandlingPolicy() const\n {\n return m_Decoder->errorHandlingPolicy();\n }\n\n void Converter::setDecoderErrorHandlingPolicy(ErrorHandlingPolicy_t value)\n {\n m_Decoder->setErrorHandlingPolicy(value);\n }\n\n ErrorHandlingPolicy_t Converter::encoderErrorHandlingPolicy() const\n {\n return m_Encoder->errorHandlingPolicy();\n }\n\n void Converter::setEncoderErrorHandlingPolicy(ErrorHandlingPolicy_t value)\n {\n m_Encoder->setErrorHandlingPolicy(value);\n }\n\n void Converter::setReplacementCharacter(char32_t value)\n {\n setDecoderReplacementCharacter(value);\n setEncoderReplacementCharacter(value);\n }\n\n char32_t Converter::decoderReplacementCharacter() const\n {\n return m_Decoder->replacementCharacter();\n }\n\n void Converter::setDecoderReplacementCharacter(char32_t value)\n {\n m_Decoder->setReplacementCharacter(value);\n }\n\n char32_t Converter::encoderReplacementCharacter() const\n {\n return m_Encoder->replacementCharacter();\n }\n\n void Converter::setEncoderReplacementCharacter(char32_t value)\n {\n m_Encoder->setReplacementCharacter(value);\n }\n\n Encoding_t Converter::decoderEncoding() const\n {\n if (!m_Decoder)\n return Encoding::UNKNOWN;\n return m_Decoder->encoding();\n }\n\n Encoding_t Converter::encoderEncoding() const\n {\n if (!m_Encoder)\n return Encoding::UNKNOWN;\n return m_Encoder->encoding();\n }\n\n size_t Converter::convert(const char* source,\n size_t sourceLength,\n std::string& destination,\n bool sourceIsIncomplete)\n {\n return convertImpl(internal_char_type_cast(source),\n sourceLength,\n destination,\n sourceIsIncomplete);\n }\n\n size_t Converter::convert(const char* source,\n size_t sourceLength,\n std::u16string& destination,\n bool sourceIsIncomplete)\n {\n return convertImpl(internal_char_type_cast(source),\n sourceLength,\n destination,\n sourceIsIncomplete);\n }\n\n size_t Converter::convert(const char* source,\n size_t sourceLength,\n std::u32string& destination,\n bool sourceIsIncomplete)\n {\n return convertImpl(internal_char_type_cast(source),\n sourceLength,\n destination,\n sourceIsIncomplete);\n }\n\n size_t Converter::convert(const char* source,\n size_t sourceLength,\n std::wstring& destination,\n bool sourceIsIncomplete)\n {\n return convertImpl(internal_char_type_cast(source),\n sourceLength,\n destination,\n sourceIsIncomplete);\n }\n\n size_t Converter::convert(const char16_t* source,\n size_t sourceLength,\n std::string& destination,\n bool sourceIsIncomplete)\n {\n return convertImpl(internal_char_type_cast(source),\n sourceLength,\n destination,\n sourceIsIncomplete);\n }\n\n size_t Converter::convert(const char16_t* source,\n size_t sourceLength,\n std::u16string& destination,\n bool sourceIsIncomplete)\n {\n return convertImpl(internal_char_type_cast(source),\n sourceLength,\n destination,\n sourceIsIncomplete);\n }\n\n size_t Converter::convert(const char16_t* source,\n size_t sourceLength,\n std::u32string& destination,\n bool sourceIsIncomplete)\n {\n return convertImpl(internal_char_type_cast(source),\n sourceLength,\n destination,\n sourceIsIncomplete);\n }\n\n size_t Converter::convert(const char16_t* source,\n size_t sourceLength,\n std::wstring& destination,\n bool sourceIsIncomplete)\n {\n return convertImpl(internal_char_type_cast(source),\n sourceLength,\n destination,\n sourceIsIncomplete);\n }\n\n size_t Converter::convert(const char32_t* source,\n size_t sourceLength,\n std::string& destination,\n bool sourceIsIncomplete)\n {\n return convertImpl(internal_char_type_cast(source),\n sourceLength,\n destination,\n sourceIsIncomplete);\n }\n\n size_t Converter::convert(const char32_t* source,\n size_t sourceLength,\n std::u16string& destination,\n bool sourceIsIncomplete)\n {\n return convertImpl(internal_char_type_cast(source),\n sourceLength,\n destination,\n sourceIsIncomplete);\n }\n\n size_t Converter::convert(const char32_t* source,\n size_t sourceLength,\n std::u32string& destination,\n bool sourceIsIncomplete)\n {\n return convertImpl(internal_char_type_cast(source),\n sourceLength,\n destination,\n sourceIsIncomplete);\n }\n\n size_t Converter::convert(const char32_t* source,\n size_t sourceLength,\n std::wstring& destination,\n bool sourceIsIncomplete)\n {\n return convertImpl(internal_char_type_cast(source),\n sourceLength,\n destination,\n sourceIsIncomplete);\n }\n\n size_t Converter::convert(const wchar_t* source,\n size_t sourceLength,\n std::string& destination,\n bool sourceIsIncomplete)\n {\n return convertImpl(internal_char_type_cast(source),\n sourceLength,\n destination,\n sourceIsIncomplete);\n }\n\n size_t Converter::convert(const wchar_t* source,\n size_t sourceLength,\n std::u16string& destination,\n bool sourceIsIncomplete)\n {\n return convertImpl(internal_char_type_cast(source),\n sourceLength,\n destination,\n sourceIsIncomplete);\n }\n\n size_t Converter::convert(const wchar_t* source,\n size_t sourceLength,\n std::u32string& destination,\n bool sourceIsIncomplete)\n {\n return convertImpl(internal_char_type_cast(source),\n sourceLength,\n destination,\n sourceIsIncomplete);\n }\n\n size_t Converter::convert(const wchar_t* source,\n size_t sourceLength,\n std::wstring& destination,\n bool sourceIsIncomplete)\n {\n return convertImpl(internal_char_type_cast(source),\n sourceLength,\n destination,\n sourceIsIncomplete);\n }\n\n Converter::ConversionType Converter::getConversionType(\n Encoding_t src, Encoding_t dst)\n {\n if (src == dst)\n return COPY;\n if ((src == Encoding::UTF_16_LE && dst == Encoding::UTF_16_BE)\n || (src == Encoding::UTF_16_BE && dst == Encoding::UTF_16_LE)\n || (src == Encoding::UTF_32_LE && dst == Encoding::UTF_32_BE)\n || (src == Encoding::UTF_32_BE && dst == Encoding::UTF_32_LE))\n {\n return SWAP_ENDIANNESS;\n }\n return CONVERT;\n }\n\n template<typename CharT, typename StringT>\n size_t Converter::convertImpl(const CharT* src,\n size_t srcLength,\n StringT& dst,\n bool sourceIsIncomplete)\n {\n switch (m_ConversionType)\n {\n case SWAP_ENDIANNESS:\n return doCopyAndSwapBytes(src, srcLength, dst, sourceIsIncomplete);\n case COPY:\n return doCopy(src, srcLength, dst, sourceIsIncomplete);\n case CONVERT:\n return doConvert(src, srcLength, dst, sourceIsIncomplete);\n }\n return 0;\n }\n\n template<typename CharT, typename StringT>\n size_t Converter::doConvert(const CharT* src,\n size_t srcLength,\n StringT& dst,\n bool sourceIsIncomplete)\n {\n auto srcBeg = src;\n auto srcEnd = src + srcLength;\n auto bufSize = std::min(srcLength, m_BufferSize);\n std::vector<char32_t> buffer(bufSize);\n auto bufEnd = buffer.data() + bufSize;\n while (srcBeg != srcEnd)\n {\n auto bufIt = buffer.data();\n auto result = m_Decoder->decode(srcBeg, srcEnd, bufIt, bufEnd,\n sourceIsIncomplete);\n auto bufBeg = static_cast<const char32_t*>(buffer.data());\n m_Encoder->encode(bufBeg, bufIt, dst);\n if (result != DecoderResult::OK)\n break;\n }\n return srcBeg - src;\n }\n\n template<typename CharT, typename StringT>\n size_t Converter::doCopy(const CharT* src,\n size_t srcLength,\n StringT& dst,\n bool sourceIsIncomplete)\n {\n typedef typename StringT::value_type StringChar;\n auto unitSize = m_Decoder->characterUnitSize();\n auto checkResult = m_Decoder->checkString(src, src + srcLength,\n sourceIsIncomplete);\n if (checkResult.first\n && (sizeof(CharT) == 1 || sizeof(CharT) == unitSize)\n && (sizeof(StringChar) == 1 || sizeof(StringChar) == unitSize))\n {\n srcLength = checkResult.second - src;\n return copy(src, srcLength, dst, unitSize);\n }\n else\n {\n return doConvert(src, srcLength, dst, sourceIsIncomplete);\n }\n }\n\n template<typename CharT, typename StringT>\n size_t Converter::doCopyAndSwapBytes(const CharT* src,\n size_t srcLength,\n StringT& dst,\n bool sourceIsIncomplete)\n {\n typedef typename StringT::value_type StringChar;\n auto unitSize = m_Decoder->characterUnitSize();\n auto checkResult = m_Decoder->checkString(src, src + srcLength,\n sourceIsIncomplete);\n if (checkResult.first\n && (sizeof(CharT) == 1 || sizeof(CharT) == unitSize)\n && sizeof(StringChar) == unitSize)\n {\n auto initialSize = dst.size();\n srcLength = checkResult.second - src;\n auto result = copy(src, srcLength, dst, unitSize);\n swapEndianness(&dst[initialSize], dst.size() - initialSize);\n return result;\n }\n else\n {\n return doConvert(src, srcLength, dst, sourceIsIncomplete);\n }\n }\n\n namespace {\n\n std::unique_ptr<AbstractDecoder> makeDecoder(Encoding_t encoding)\n {\n switch (encoding)\n {\n case Encoding::UTF_8:\n return std::unique_ptr<AbstractDecoder>(new Utf8Decoder);\n case Encoding::UTF_16_BE:\n return std::unique_ptr<AbstractDecoder>(new Utf16BEDecoder);\n case Encoding::UTF_16_LE:\n return std::unique_ptr<AbstractDecoder>(new Utf16LEDecoder);\n case Encoding::UTF_32_BE:\n return std::unique_ptr<AbstractDecoder>(new Utf32BEDecoder);\n case Encoding::UTF_32_LE:\n return std::unique_ptr<AbstractDecoder>(new Utf32LEDecoder);\n default:\n break;\n }\n\n auto info = getEncodingInfo(encoding);\n auto name = info ? info->name()\n : std::to_string(int64_t(encoding));\n YSTRING_THROW(\"Unsupported source-encoding: \" + name);\n }\n\n std::unique_ptr<AbstractEncoder> makeEncoder(Encoding_t encoding)\n {\n switch (encoding)\n {\n case Encoding::ASCII:\n break;\n case Encoding::UTF_8:\n return std::unique_ptr<AbstractEncoder>(new Utf8Encoder);\n case Encoding::UTF_16_BE:\n return std::unique_ptr<AbstractEncoder>(new Utf16BEEncoder);\n case Encoding::UTF_16_LE:\n return std::unique_ptr<AbstractEncoder>(new Utf16LEEncoder);\n case Encoding::UTF_32_BE:\n return std::unique_ptr<AbstractEncoder>(new Utf32BEEncoder);\n case Encoding::UTF_32_LE:\n return std::unique_ptr<AbstractEncoder>(new Utf32LEEncoder);\n default:\n break;\n }\n\n auto info = getEncodingInfo(encoding);\n auto name = info ? info->name()\n : std::to_string(int64_t(encoding));\n YSTRING_THROW(\"Unsupported source-encoding: \" + name);\n }\n\n template<typename CharT, typename StringT>\n size_t copy(const CharT* src,\n size_t srcLength,\n StringT& dst,\n size_t charSize)\n {\n typedef typename StringT::value_type DstChar;\n auto srcMemLength = srcLength * sizeof(CharT);\n srcMemLength -= srcMemLength % charSize;\n auto dstLength = srcMemLength \/ sizeof(DstChar);\n auto initialDstSize = dst.size();\n dst.resize(initialDstSize + dstLength);\n memcpy(&dst[initialDstSize], src, srcMemLength);\n return srcMemLength \/ sizeof(CharT);\n }\n\n template <typename T>\n void swapEndianness(T* str, size_t length)\n {\n for (size_t i = 0; i < length; ++i)\n str[i] = Utilities::reverseBytes(str[i]);\n }\n\n }\n}}\n<|endoftext|>"} {"text":"<commit_before>\/\/==============================================================================\r\n\/\/ Single cell simulation view simulation\r\n\/\/==============================================================================\r\n\r\n#include \"singlecellsimulationviewcontentswidget.h\"\r\n#include \"singlecellsimulationviewinformationsimulationwidget.h\"\r\n#include \"singlecellsimulationviewinformationwidget.h\"\r\n#include \"singlecellsimulationviewsimulation.h\"\r\n#include \"singlecellsimulationviewwidget.h\"\r\n#include \"thread.h\"\r\n\r\n\/\/==============================================================================\r\n\r\n#include \"qwt_slider.h\"\r\n\r\n\/\/==============================================================================\r\n\r\nnamespace OpenCOR {\r\nnamespace SingleCellSimulationView {\r\n\r\n\/\/==============================================================================\r\n\r\nSingleCellSimulationViewSimulationData::SingleCellSimulationViewSimulationData() :\r\n mDelay(0),\r\n mStartingPoint(0.0),\r\n mEndingPoint(1000.0),\r\n mPointInterval(1.0)\r\n{\r\n}\r\n\r\n\/\/==============================================================================\r\n\r\nint SingleCellSimulationViewSimulationData::delay() const\r\n{\r\n \/\/ Return our delay\r\n\r\n return mDelay;\r\n}\r\n\r\n\/\/==============================================================================\r\n\r\nvoid SingleCellSimulationViewSimulationData::setDelay(const int &pDelay)\r\n{\r\n \/\/ Set our delay\r\n\r\n mDelay = pDelay;\r\n}\r\n\r\n\/\/==============================================================================\r\n\r\ndouble SingleCellSimulationViewSimulationData::startingPoint() const\r\n{\r\n \/\/ Return our starting point\r\n\r\n return mStartingPoint;\r\n}\r\n\r\n\/\/==============================================================================\r\n\r\nvoid SingleCellSimulationViewSimulationData::setStartingPoint(const double &pStartingPoint)\r\n{\r\n \/\/ Set our starting point\r\n\r\n mStartingPoint = pStartingPoint;\r\n}\r\n\r\n\/\/==============================================================================\r\n\r\ndouble SingleCellSimulationViewSimulationData::endingPoint() const\r\n{\r\n \/\/ Return our ending point\r\n\r\n return mEndingPoint;\r\n}\r\n\r\n\/\/==============================================================================\r\n\r\nvoid SingleCellSimulationViewSimulationData::setEndingPoint(const double &pEndingPoint)\r\n{\r\n \/\/ Set our ending point\r\n\r\n mEndingPoint = pEndingPoint;\r\n}\r\n\r\n\/\/==============================================================================\r\n\r\ndouble SingleCellSimulationViewSimulationData::pointInterval() const\r\n{\r\n \/\/ Return our point interval\r\n\r\n return mPointInterval;\r\n}\r\n\r\n\/\/==============================================================================\r\n\r\nvoid SingleCellSimulationViewSimulationData::setPointInterval(const double &pPointInterval)\r\n{\r\n \/\/ Set our point interval\r\n\r\n mPointInterval = pPointInterval;\r\n}\r\n\r\n\/\/==============================================================================\r\n\r\nSingleCellSimulationViewSimulation::SingleCellSimulationViewSimulation(const QString &pFileName) :\r\n mWorkerThread(0),\r\n mWorker(0),\r\n mFileName(pFileName),\r\n mData(new SingleCellSimulationViewSimulationData())\r\n{\r\n}\r\n\r\n\/\/==============================================================================\r\n\r\nSingleCellSimulationViewSimulation::~SingleCellSimulationViewSimulation()\r\n{\r\n \/\/ Stop our worker (just in case...)\r\n\r\n stop();\r\n}\r\n\r\n\/\/==============================================================================\r\n\r\nQString SingleCellSimulationViewSimulation::fileName() const\r\n{\r\n \/\/ Retrieve and return our file name\r\n\r\n return mFileName;\r\n}\r\n\r\n\/\/==============================================================================\r\n\r\nSingleCellSimulationViewSimulationWorker::Status SingleCellSimulationViewSimulation::workerStatus() const\r\n{\r\n \/\/ Return the status of our worker, if active\r\n\r\n return (mWorkerThread && mWorker)?\r\n mWorker->status():\r\n SingleCellSimulationViewSimulationWorker::Unknown;\r\n}\r\n\r\n\/\/==============================================================================\r\n\r\ndouble SingleCellSimulationViewSimulation::workerProgress() const\r\n{\r\n \/\/ Return the progress of our worker, if active\r\n\r\n return (mWorkerThread && mWorker)?\r\n mWorker->progress():\r\n 0.0;\r\n}\r\n\r\n\/\/==============================================================================\r\n\r\nvoid SingleCellSimulationViewSimulation::setData(SingleCellSimulationViewWidget *pGui)\r\n{\r\n \/\/ Set our data using information from the GUI\r\n\r\n \/\/ Set our delay\r\n\r\n setDelay(pGui->delayValue());\r\n\r\n \/\/ Update some of our data from our GUI's simulation widget\r\n\r\n SingleCellSimulationViewInformationSimulationWidget *simulationWidget = pGui->contentsWidget()->informationWidget()->simulationWidget();\r\n\r\n mData->setStartingPoint(simulationWidget->startingPoint());\r\n mData->setEndingPoint(simulationWidget->endingPoint());\r\n mData->setPointInterval(simulationWidget->pointInterval());\r\n}\r\n\r\n\/\/==============================================================================\r\n\r\nvoid SingleCellSimulationViewSimulation::setDelay(const int &pDelay)\r\n{\r\n \/\/ Set our delay\r\n\r\n mData->setDelay(pDelay);\r\n}\r\n\r\n\/\/==============================================================================\r\n\r\nvoid SingleCellSimulationViewSimulation::run()\r\n{\r\n \/\/ Initialise our worker, if not active\r\n\r\n if (!mWorkerThread && !mWorker) {\r\n \/\/ First, check that our simulation settings we were given are sound\r\n\r\n bool simulationSettingsOk = false;\r\n\r\n if (mData->startingPoint() == mData->endingPoint())\r\n emit error(tr(\"the starting and ending points cannot have the same value\"));\r\n else if (mData->pointInterval() == 0)\r\n emit error(tr(\"the point interval cannot be equal to zero\"));\r\n else if ( (mData->startingPoint() < mData->endingPoint())\r\n && (mData->pointInterval() < 0))\r\n emit error(tr(\"the ending point is greater than the starting point, so the point interval should be greater than zero\"));\r\n else if ( (mData->startingPoint() > mData->endingPoint())\r\n && (mData->pointInterval() > 0))\r\n emit error(tr(\"the ending point is smaller than the starting point, so the point interval should be smaller than zero\"));\r\n else\r\n simulationSettingsOk = true;\r\n\r\n if (!simulationSettingsOk)\r\n \/\/ Something wrong with our simulation settings, so...\r\n\r\n return;\r\n\r\n \/\/ Create our worker and the thread in which it will work\r\n\r\n mWorkerThread = new Core::Thread();\r\n mWorker = new SingleCellSimulationViewSimulationWorker(mData);\r\n\r\n \/\/ Check that the worker and its thread have been properly created\r\n\r\n if (!mWorkerThread || !mWorker) {\r\n delete mWorkerThread;\r\n delete mWorker;\r\n\r\n mWorkerThread = 0;\r\n mWorker = 0;\r\n\r\n emit error(tr(\"the simulation worker and\/or its thread could not be initialised\"));\r\n\r\n return;\r\n }\r\n\r\n \/\/ Move our worker to its thread\r\n\r\n mWorker->moveToThread(mWorkerThread);\r\n\r\n \/\/ Create a few connections\r\n\r\n connect(mWorkerThread, SIGNAL(started()),\r\n mWorker, SLOT(run()));\r\n\r\n connect(mWorker, SIGNAL(running()),\r\n this, SIGNAL(running()));\r\n connect(mWorker, SIGNAL(pausing()),\r\n this, SIGNAL(pausing()));\r\n\r\n connect(mWorker, SIGNAL(progress(const double &)),\r\n this, SIGNAL(progress(const double &)));\r\n\r\n connect(mWorker, SIGNAL(finished(const int &)),\r\n this, SLOT(finished(const int &)));\r\n\r\n connect(mWorker, SIGNAL(finished(const int &)),\r\n mWorkerThread, SLOT(quit()));\r\n connect(mWorker, SIGNAL(finished(const int &)),\r\n mWorker, SLOT(deleteLater()));\r\n\r\n connect(mWorkerThread, SIGNAL(finished()),\r\n mWorkerThread, SLOT(deleteLater()));\r\n\r\n \/\/ Start our worker thread\r\n\r\n mWorkerThread->start();\r\n } else {\r\n \/\/ Our worker is already active, so just run it\r\n \/\/ Note: it might have been paused in between, in which case it will\r\n \/\/ automatically resume itself...\r\n\r\n mWorker->run();\r\n }\r\n}\r\n\r\n\/\/==============================================================================\r\n\r\nvoid SingleCellSimulationViewSimulation::pause()\r\n{\r\n \/\/ Ask our worker to pause, if active\r\n\r\n if (mWorkerThread && mWorker)\r\n mWorker->pause();\r\n}\r\n\r\n\/\/==============================================================================\r\n\r\nvoid SingleCellSimulationViewSimulation::stop()\r\n{\r\n \/\/ Ask our worker to stop, if active\r\n\r\n if (mWorkerThread && mWorker)\r\n mWorker->stop();\r\n}\r\n\r\n\/\/==============================================================================\r\n\r\nvoid SingleCellSimulationViewSimulation::finished(const int &pElapsedTime)\r\n{\r\n \/\/ Our worker is done (and it will get deleted and everything), so...\r\n\r\n mWorkerThread = 0;\r\n mWorker = 0;\r\n\r\n \/\/ Let people know that we have stopped\r\n\r\n emit stopped(pElapsedTime);\r\n}\r\n\r\n\/\/==============================================================================\r\n\r\n} \/\/ namespace SingleCellSimulationView\r\n} \/\/ namespace OpenCOR\r\n\r\n\/\/==============================================================================\r\n\/\/ End of file\r\n\/\/==============================================================================\r\n<commit_msg>Fixed a memory leak.<commit_after>\/\/==============================================================================\r\n\/\/ Single cell simulation view simulation\r\n\/\/==============================================================================\r\n\r\n#include \"singlecellsimulationviewcontentswidget.h\"\r\n#include \"singlecellsimulationviewinformationsimulationwidget.h\"\r\n#include \"singlecellsimulationviewinformationwidget.h\"\r\n#include \"singlecellsimulationviewsimulation.h\"\r\n#include \"singlecellsimulationviewwidget.h\"\r\n#include \"thread.h\"\r\n\r\n\/\/==============================================================================\r\n\r\n#include \"qwt_slider.h\"\r\n\r\n\/\/==============================================================================\r\n\r\nnamespace OpenCOR {\r\nnamespace SingleCellSimulationView {\r\n\r\n\/\/==============================================================================\r\n\r\nSingleCellSimulationViewSimulationData::SingleCellSimulationViewSimulationData() :\r\n mDelay(0),\r\n mStartingPoint(0.0),\r\n mEndingPoint(1000.0),\r\n mPointInterval(1.0)\r\n{\r\n}\r\n\r\n\/\/==============================================================================\r\n\r\nint SingleCellSimulationViewSimulationData::delay() const\r\n{\r\n \/\/ Return our delay\r\n\r\n return mDelay;\r\n}\r\n\r\n\/\/==============================================================================\r\n\r\nvoid SingleCellSimulationViewSimulationData::setDelay(const int &pDelay)\r\n{\r\n \/\/ Set our delay\r\n\r\n mDelay = pDelay;\r\n}\r\n\r\n\/\/==============================================================================\r\n\r\ndouble SingleCellSimulationViewSimulationData::startingPoint() const\r\n{\r\n \/\/ Return our starting point\r\n\r\n return mStartingPoint;\r\n}\r\n\r\n\/\/==============================================================================\r\n\r\nvoid SingleCellSimulationViewSimulationData::setStartingPoint(const double &pStartingPoint)\r\n{\r\n \/\/ Set our starting point\r\n\r\n mStartingPoint = pStartingPoint;\r\n}\r\n\r\n\/\/==============================================================================\r\n\r\ndouble SingleCellSimulationViewSimulationData::endingPoint() const\r\n{\r\n \/\/ Return our ending point\r\n\r\n return mEndingPoint;\r\n}\r\n\r\n\/\/==============================================================================\r\n\r\nvoid SingleCellSimulationViewSimulationData::setEndingPoint(const double &pEndingPoint)\r\n{\r\n \/\/ Set our ending point\r\n\r\n mEndingPoint = pEndingPoint;\r\n}\r\n\r\n\/\/==============================================================================\r\n\r\ndouble SingleCellSimulationViewSimulationData::pointInterval() const\r\n{\r\n \/\/ Return our point interval\r\n\r\n return mPointInterval;\r\n}\r\n\r\n\/\/==============================================================================\r\n\r\nvoid SingleCellSimulationViewSimulationData::setPointInterval(const double &pPointInterval)\r\n{\r\n \/\/ Set our point interval\r\n\r\n mPointInterval = pPointInterval;\r\n}\r\n\r\n\/\/==============================================================================\r\n\r\nSingleCellSimulationViewSimulation::SingleCellSimulationViewSimulation(const QString &pFileName) :\r\n mWorkerThread(0),\r\n mWorker(0),\r\n mFileName(pFileName),\r\n mData(new SingleCellSimulationViewSimulationData())\r\n{\r\n}\r\n\r\n\/\/==============================================================================\r\n\r\nSingleCellSimulationViewSimulation::~SingleCellSimulationViewSimulation()\r\n{\r\n \/\/ Stop our worker (just in case...)\r\n\r\n stop();\r\n\r\n \/\/ Delete some internal objects\r\n\r\n delete mData;\r\n}\r\n\r\n\/\/==============================================================================\r\n\r\nQString SingleCellSimulationViewSimulation::fileName() const\r\n{\r\n \/\/ Retrieve and return our file name\r\n\r\n return mFileName;\r\n}\r\n\r\n\/\/==============================================================================\r\n\r\nSingleCellSimulationViewSimulationWorker::Status SingleCellSimulationViewSimulation::workerStatus() const\r\n{\r\n \/\/ Return the status of our worker, if active\r\n\r\n return (mWorkerThread && mWorker)?\r\n mWorker->status():\r\n SingleCellSimulationViewSimulationWorker::Unknown;\r\n}\r\n\r\n\/\/==============================================================================\r\n\r\ndouble SingleCellSimulationViewSimulation::workerProgress() const\r\n{\r\n \/\/ Return the progress of our worker, if active\r\n\r\n return (mWorkerThread && mWorker)?\r\n mWorker->progress():\r\n 0.0;\r\n}\r\n\r\n\/\/==============================================================================\r\n\r\nvoid SingleCellSimulationViewSimulation::setData(SingleCellSimulationViewWidget *pGui)\r\n{\r\n \/\/ Set our data using information from the GUI\r\n\r\n \/\/ Set our delay\r\n\r\n setDelay(pGui->delayValue());\r\n\r\n \/\/ Update some of our data from our GUI's simulation widget\r\n\r\n SingleCellSimulationViewInformationSimulationWidget *simulationWidget = pGui->contentsWidget()->informationWidget()->simulationWidget();\r\n\r\n mData->setStartingPoint(simulationWidget->startingPoint());\r\n mData->setEndingPoint(simulationWidget->endingPoint());\r\n mData->setPointInterval(simulationWidget->pointInterval());\r\n}\r\n\r\n\/\/==============================================================================\r\n\r\nvoid SingleCellSimulationViewSimulation::setDelay(const int &pDelay)\r\n{\r\n \/\/ Set our delay\r\n\r\n mData->setDelay(pDelay);\r\n}\r\n\r\n\/\/==============================================================================\r\n\r\nvoid SingleCellSimulationViewSimulation::run()\r\n{\r\n \/\/ Initialise our worker, if not active\r\n\r\n if (!mWorkerThread && !mWorker) {\r\n \/\/ First, check that our simulation settings we were given are sound\r\n\r\n bool simulationSettingsOk = false;\r\n\r\n if (mData->startingPoint() == mData->endingPoint())\r\n emit error(tr(\"the starting and ending points cannot have the same value\"));\r\n else if (mData->pointInterval() == 0)\r\n emit error(tr(\"the point interval cannot be equal to zero\"));\r\n else if ( (mData->startingPoint() < mData->endingPoint())\r\n && (mData->pointInterval() < 0))\r\n emit error(tr(\"the ending point is greater than the starting point, so the point interval should be greater than zero\"));\r\n else if ( (mData->startingPoint() > mData->endingPoint())\r\n && (mData->pointInterval() > 0))\r\n emit error(tr(\"the ending point is smaller than the starting point, so the point interval should be smaller than zero\"));\r\n else\r\n simulationSettingsOk = true;\r\n\r\n if (!simulationSettingsOk)\r\n \/\/ Something wrong with our simulation settings, so...\r\n\r\n return;\r\n\r\n \/\/ Create our worker and the thread in which it will work\r\n\r\n mWorkerThread = new Core::Thread();\r\n mWorker = new SingleCellSimulationViewSimulationWorker(mData);\r\n\r\n \/\/ Check that the worker and its thread have been properly created\r\n\r\n if (!mWorkerThread || !mWorker) {\r\n delete mWorkerThread;\r\n delete mWorker;\r\n\r\n mWorkerThread = 0;\r\n mWorker = 0;\r\n\r\n emit error(tr(\"the simulation worker and\/or its thread could not be initialised\"));\r\n\r\n return;\r\n }\r\n\r\n \/\/ Move our worker to its thread\r\n\r\n mWorker->moveToThread(mWorkerThread);\r\n\r\n \/\/ Create a few connections\r\n\r\n connect(mWorkerThread, SIGNAL(started()),\r\n mWorker, SLOT(run()));\r\n\r\n connect(mWorker, SIGNAL(running()),\r\n this, SIGNAL(running()));\r\n connect(mWorker, SIGNAL(pausing()),\r\n this, SIGNAL(pausing()));\r\n\r\n connect(mWorker, SIGNAL(progress(const double &)),\r\n this, SIGNAL(progress(const double &)));\r\n\r\n connect(mWorker, SIGNAL(finished(const int &)),\r\n this, SLOT(finished(const int &)));\r\n\r\n connect(mWorker, SIGNAL(finished(const int &)),\r\n mWorkerThread, SLOT(quit()));\r\n connect(mWorker, SIGNAL(finished(const int &)),\r\n mWorker, SLOT(deleteLater()));\r\n\r\n connect(mWorkerThread, SIGNAL(finished()),\r\n mWorkerThread, SLOT(deleteLater()));\r\n\r\n \/\/ Start our worker thread\r\n\r\n mWorkerThread->start();\r\n } else {\r\n \/\/ Our worker is already active, so just run it\r\n \/\/ Note: it might have been paused in between, in which case it will\r\n \/\/ automatically resume itself...\r\n\r\n mWorker->run();\r\n }\r\n}\r\n\r\n\/\/==============================================================================\r\n\r\nvoid SingleCellSimulationViewSimulation::pause()\r\n{\r\n \/\/ Ask our worker to pause, if active\r\n\r\n if (mWorkerThread && mWorker)\r\n mWorker->pause();\r\n}\r\n\r\n\/\/==============================================================================\r\n\r\nvoid SingleCellSimulationViewSimulation::stop()\r\n{\r\n \/\/ Ask our worker to stop, if active\r\n\r\n if (mWorkerThread && mWorker)\r\n mWorker->stop();\r\n}\r\n\r\n\/\/==============================================================================\r\n\r\nvoid SingleCellSimulationViewSimulation::finished(const int &pElapsedTime)\r\n{\r\n \/\/ Our worker is done (and it will get deleted and everything), so...\r\n\r\n mWorkerThread = 0;\r\n mWorker = 0;\r\n\r\n \/\/ Let people know that we have stopped\r\n\r\n emit stopped(pElapsedTime);\r\n}\r\n\r\n\/\/==============================================================================\r\n\r\n} \/\/ namespace SingleCellSimulationView\r\n} \/\/ namespace OpenCOR\r\n\r\n\/\/==============================================================================\r\n\/\/ End of file\r\n\/\/==============================================================================\r\n<|endoftext|>"} {"text":"<commit_before>#include <stdio.h>\n\n#include <Halide.h>\n\n#include <algorithm>\n#include <iostream>\n\nusing namespace Halide;\nusing namespace Halide::Internal;\n\nScope<Expr> scope;\nScope<int> linearity;\n\nExpr x = Variable::make(Int(32), \"x\");\nExpr y = Variable::make(Int(32), \"y\");\n\nconstexpr int N = 100;\nExpr v[N];\n\nvoid fill_scope() {\n \/\/ e.g. let y = 4*x\n scope.push(\"y\", 4*x);\n linearity.push(\"y\", Linearity::Linear);\n\n for (int i = 0; i < N; ++i) {\n \/\/ e.g. let x0 = x*x\n \/\/ let x1 = x0*x0\n \/\/ let x2 = x1*x1\n \/\/ ...\n std::string vi = \"v\" + int_to_string(i);\n v[i] = Variable::make(Int(32), vi);\n if (i == 0) {\n scope.push(vi, x*x);\n } else {\n scope.push(vi, v[i-1]*v[i-1]);\n }\n linearity.push(vi, Linearity::NonLinear);\n }\n}\n\nbool test_branches_in_var() {\n \/\/ Test basic functionality of branches_in_var\n Stmt s1 = IfThenElse::make(x < 0, Evaluate::make(0));\n Expr e1 = Select::make(x < 0, 0, x);\n Expr e2 = clamp(x, 0, 100);\n\n if (!branches_linearly_in_var(s1, \"x\", linearity)) {\n std::cout << \"Expected to branch in x:\\n\" << s1;\n return false;\n }\n\n if (!branches_linearly_in_var(e1, \"x\", linearity)) {\n std::cout << \"Expected to branch in x: \" << e1 << \"\\n\";\n return false;\n }\n\n if (branches_linearly_in_var(e2, \"x\", linearity)) {\n std::cout << \"Expected not to branch in x: \" << e2 << \"\\n\";\n return false;\n }\n\n if (!branches_linearly_in_var(e2, \"x\", linearity, true)) {\n std::cout << \"Expected to branch in x: \" << e2 << \"\\n\";\n return false;\n }\n\n \/\/ Test branches_in_var uses linearity correctly.\n Stmt s2 = IfThenElse::make(y < 0, Evaluate::make(0));\n Expr e3 = Select::make(y < 0, 0, x);\n\n if (!branches_linearly_in_var(s2, \"x\", linearity)) {\n std::cout << \"Expected to branch in x:\\n\" << s2;\n return false;\n }\n\n if (!branches_linearly_in_var(e3, \"x\", linearity)) {\n std::cout << \"Expected to branch in x: \" << e3 << \"\\n\";\n return false;\n }\n\n \/\/ Test branches_in_var doesn't explode with deeply nested linearitys.\n Expr vN = v[N-1];\n Stmt s3 = IfThenElse::make(vN < 0, Evaluate::make(0));\n\n if (branches_linearly_in_var(s3, \"x\", linearity)) {\n std::cout << \"Expected not to branch in x:\\n\" << s3;\n return false;\n }\n\n return true;\n}\n\nbool test_normalize_branches() {\n Scope<Interval> bounds;\n Scope<int> free_vars;\n free_vars.push(\"x\", 0);\n\n Stmt then_case = Evaluate::make(0);\n Stmt else_case = Evaluate::make(1);\n\n Stmt s1 = IfThenElse::make(x != 0 && x != 1, then_case, else_case);\n Stmt s1_ans1 = IfThenElse::make(x < 1, then_case, IfThenElse::make(1 < x, then_case, else_case));\n Stmt s1_nrm = normalize_branch_conditions(s1, \"x\", scope, bounds, free_vars);\n Stmt s1_ans = IfThenElse::make(\n x < 0, then_case, IfThenElse::make(\n 0 < x, IfThenElse::make(1 < x, then_case, else_case), else_case));\n\n if (!equal(s1_nrm, s1_ans)) {\n std::cout << \"Normalized:\\n\" << s1_nrm\n << \"Expected:\\n\" << s1_ans;\n return false;\n }\n\n Expr e1 = select(x != 0 && x != 1, 0, 1);\n Expr e1_ans1 = select(x < 1, 0, select(1 < x, 0, 1));\n Expr e1_nrm = normalize_branch_conditions(e1, \"x\", scope, bounds, free_vars);\n Expr e1_ans = select(x < 0, 0, select(0 < x, select(1 < x, 0, 1), 1));\n\n if (!equal(e1_nrm, e1_ans)) {\n std::cout << \"Normalized: \" << e1_nrm << \"\\n\"\n << \"Expected: \" << e1_ans << \"\\n\";\n return false;\n }\n\n return true;\n}\n\nint main() {\n fill_scope();\n\n if (!test_branches_in_var()) {\n std::cout << \"Failure.\\n\";\n return -1;\n }\n\n if (!test_normalize_branches()) {\n std::cout << \"Failure.\\n\";\n return -1;\n }\n\n std::cout << \"Success!\\n\";\n return 0;\n}\n<commit_msg>Added test to check the results of branches_linearly_in_vars to demonstrate the correctness of the changes in the last commit.<commit_after>#include <stdio.h>\n\n#include <Halide.h>\n\n#include <algorithm>\n#include <iostream>\n\nusing namespace Halide;\nusing namespace Halide::Internal;\n\nScope<Expr> scope;\nScope<int> linearity;\n\nExpr x = Variable::make(Int(32), \"x\");\nExpr y = Variable::make(Int(32), \"y\");\nExpr z = Variable::make(Int(32), \"z\");\n\nconstexpr int N = 100;\nExpr v[N];\n\nvoid fill_scope() {\n \/\/ e.g. let y = 4*x\n scope.push(\"y\", 4*x);\n linearity.push(\"y\", Linearity::Linear);\n\n for (int i = 0; i < N; ++i) {\n \/\/ e.g. let x0 = x*x\n \/\/ let x1 = x0*x0\n \/\/ let x2 = x1*x1\n \/\/ ...\n std::string vi = \"v\" + int_to_string(i);\n v[i] = Variable::make(Int(32), vi);\n if (i == 0) {\n scope.push(vi, x*x);\n } else {\n scope.push(vi, v[i-1]*v[i-1]);\n }\n linearity.push(vi, Linearity::NonLinear);\n }\n}\n\nbool test_branches_in_var() {\n \/\/ Test basic functionality of branches_in_var\n Stmt s1 = IfThenElse::make(x < 0, Evaluate::make(0));\n Expr e1 = Select::make(x < 0, 0, x);\n Expr e2 = clamp(x, 0, 100);\n\n if (!branches_linearly_in_var(s1, \"x\", linearity)) {\n std::cout << \"Expected to branch in x:\\n\" << s1;\n return false;\n }\n\n if (!branches_linearly_in_var(e1, \"x\", linearity)) {\n std::cout << \"Expected to branch in x: \" << e1 << \"\\n\";\n return false;\n }\n\n if (branches_linearly_in_var(e2, \"x\", linearity)) {\n std::cout << \"Expected not to branch in x: \" << e2 << \"\\n\";\n return false;\n }\n\n if (!branches_linearly_in_var(e2, \"x\", linearity, true)) {\n std::cout << \"Expected to branch in x: \" << e2 << \"\\n\";\n return false;\n }\n\n \/\/ Test branches_in_var uses linearity correctly.\n Stmt s2 = IfThenElse::make(y < 0, Evaluate::make(0));\n Expr e3 = Select::make(y < 0, 0, x);\n\n if (!branches_linearly_in_var(s2, \"x\", linearity)) {\n std::cout << \"Expected to branch in x:\\n\" << s2;\n return false;\n }\n\n if (!branches_linearly_in_var(e3, \"x\", linearity)) {\n std::cout << \"Expected to branch in x: \" << e3 << \"\\n\";\n return false;\n }\n\n \/\/ Test branches_in_var doesn't explode with deeply nested linearitys.\n Expr vN = v[N-1];\n Stmt s3 = IfThenElse::make(vN < 0, Evaluate::make(0));\n\n if (branches_linearly_in_var(s3, \"x\", linearity)) {\n std::cout << \"Expected not to branch in x:\\n\" << s3;\n return false;\n }\n\n Stmt s4 = LetStmt::make(\"z\", e3, For::make(\"w\", 0, 10, For::Serial, Store::make(\"s\", 0, z)));\n\n if (!branches_linearly_in_var(s4, \"x\", linearity)) {\n std::cout << \"Expected to branch in x: \" << s4 << \"\\n\";\n return false;\n }\n\n return true;\n}\n\nbool test_normalize_branches() {\n Scope<Interval> bounds;\n Scope<int> free_vars;\n free_vars.push(\"x\", 0);\n\n Stmt then_case = Evaluate::make(0);\n Stmt else_case = Evaluate::make(1);\n\n Stmt s1 = IfThenElse::make(x != 0 && x != 1, then_case, else_case);\n Stmt s1_ans1 = IfThenElse::make(x < 1, then_case, IfThenElse::make(1 < x, then_case, else_case));\n Stmt s1_nrm = normalize_branch_conditions(s1, \"x\", scope, bounds, free_vars);\n Stmt s1_ans = IfThenElse::make(\n x < 0, then_case, IfThenElse::make(\n 0 < x, IfThenElse::make(1 < x, then_case, else_case), else_case));\n\n if (!equal(s1_nrm, s1_ans)) {\n std::cout << \"Normalized:\\n\" << s1_nrm\n << \"Expected:\\n\" << s1_ans;\n return false;\n }\n\n Expr e1 = select(x != 0 && x != 1, 0, 1);\n Expr e1_ans1 = select(x < 1, 0, select(1 < x, 0, 1));\n Expr e1_nrm = normalize_branch_conditions(e1, \"x\", scope, bounds, free_vars);\n Expr e1_ans = select(x < 0, 0, select(0 < x, select(1 < x, 0, 1), 1));\n\n if (!equal(e1_nrm, e1_ans)) {\n std::cout << \"Normalized: \" << e1_nrm << \"\\n\"\n << \"Expected: \" << e1_ans << \"\\n\";\n return false;\n }\n\n return true;\n}\n\nint main() {\n fill_scope();\n\n if (!test_branches_in_var()) {\n std::cout << \"Failure.\\n\";\n return -1;\n }\n\n if (!test_normalize_branches()) {\n std::cout << \"Failure.\\n\";\n return -1;\n }\n\n std::cout << \"Success!\\n\";\n return 0;\n}\n<|endoftext|>"} {"text":"<commit_before>\/*\n *\n * Copyright 2016 gRPC authors.\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n *\n *\/\n\n#include <fstream>\n#include <sstream>\n\n#include <gflags\/gflags.h>\n#include <gtest\/gtest.h>\n\nDEFINE_string(\n generated_file_path, \"\",\n \"path to the directory containing generated files compiler_test.grpc.pb.h\"\n \"and compiler_test_mock.grpc.pb.h\");\n\nconst char kGoldenFilePath[] = \"test\/cpp\/codegen\/compiler_test_golden\";\nconst char kMockGoldenFilePath[] = \"test\/cpp\/codegen\/compiler_test_mock_golden\";\n\nvoid run_test(std::basic_string<char> generated_file,\n std::basic_string<char> golden_file) {\n std::ifstream generated(generated_file);\n std::ifstream golden(golden_file);\n\n ASSERT_TRUE(generated.good());\n ASSERT_TRUE(golden.good());\n\n std::ostringstream gen_oss;\n std::ostringstream gold_oss;\n gen_oss << generated.rdbuf();\n gold_oss << golden.rdbuf();\n EXPECT_EQ(gold_oss.str(), gen_oss.str());\n\n generated.close();\n golden.close();\n}\n\nTEST(GoldenFileTest, TestGeneratedFile) {\n run_test(FLAGS_generated_file_path + \"compiler_test.grpc.pb.h\",\n kGoldenFilePath);\n}\n\nTEST(GoldenMockFileTest, TestGeneratedMockFile) {\n run_test(FLAGS_generated_file_path + \"compiler_test_mock.grpc.pb.h\",\n kMockGoldenFilePath);\n}\n\nint main(int argc, char** argv) {\n ::testing::InitGoogleTest(&argc, argv);\n ::google::ParseCommandLineFlags(&argc, &argv, true);\n if (FLAGS_generated_file_path.empty()) {\n FLAGS_generated_file_path = \"gens\/src\/proto\/grpc\/testing\/\";\n }\n if (FLAGS_generated_file_path.back() != '\/')\n FLAGS_generated_file_path.append(\"\/\");\n return RUN_ALL_TESTS();\n}\n<commit_msg>Use the same ParseCommandLineFlags for golden file test that is used in other test binaries<commit_after>\/*\n *\n * Copyright 2016 gRPC authors.\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n *\n *\/\n\n#include <fstream>\n#include <sstream>\n\n#include <gflags\/gflags.h>\n#include <gtest\/gtest.h>\n\n\/\/ In some distros, gflags is in the namespace google, and in some others,\n\/\/ in gflags. This hack is enabling us to find both.\nnamespace google {}\nnamespace gflags {}\nusing namespace google;\nusing namespace gflags;\n\nDEFINE_string(\n generated_file_path, \"\",\n \"path to the directory containing generated files compiler_test.grpc.pb.h\"\n \"and compiler_test_mock.grpc.pb.h\");\n\nconst char kGoldenFilePath[] = \"test\/cpp\/codegen\/compiler_test_golden\";\nconst char kMockGoldenFilePath[] = \"test\/cpp\/codegen\/compiler_test_mock_golden\";\n\nvoid run_test(std::basic_string<char> generated_file,\n std::basic_string<char> golden_file) {\n std::ifstream generated(generated_file);\n std::ifstream golden(golden_file);\n\n ASSERT_TRUE(generated.good());\n ASSERT_TRUE(golden.good());\n\n std::ostringstream gen_oss;\n std::ostringstream gold_oss;\n gen_oss << generated.rdbuf();\n gold_oss << golden.rdbuf();\n EXPECT_EQ(gold_oss.str(), gen_oss.str());\n\n generated.close();\n golden.close();\n}\n\nTEST(GoldenFileTest, TestGeneratedFile) {\n run_test(FLAGS_generated_file_path + \"compiler_test.grpc.pb.h\",\n kGoldenFilePath);\n}\n\nTEST(GoldenMockFileTest, TestGeneratedMockFile) {\n run_test(FLAGS_generated_file_path + \"compiler_test_mock.grpc.pb.h\",\n kMockGoldenFilePath);\n}\n\nint main(int argc, char** argv) {\n ::testing::InitGoogleTest(&argc, argv);\n ParseCommandLineFlags(&argc, &argv, true);\n if (FLAGS_generated_file_path.empty()) {\n FLAGS_generated_file_path = \"gens\/src\/proto\/grpc\/testing\/\";\n }\n if (FLAGS_generated_file_path.back() != '\/')\n FLAGS_generated_file_path.append(\"\/\");\n return RUN_ALL_TESTS();\n}\n<|endoftext|>"} {"text":"<commit_before>\/*****************************************************************************\n * Media Library\n *****************************************************************************\n * Copyright (C) 2017-2019 Hugo Beauzée-Luyssen, Videolabs, VideoLAN\n *\n * Authors: Hugo Beauzée-Luyssen <hugo@beauzee.fr>\n *\n * This program is free software; you can redistribute it and\/or modify it\n * under the terms of the GNU Lesser General Public License as published by\n * the Free Software Foundation; either version 2.1 of the License, or\n * (at your option) any later version.\n *\n * This program is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the\n * GNU Lesser General Public License for more details.\n *\n * You should have received a copy of the GNU Lesser General Public License\n * along with this program; if not, write to the Free Software Foundation,\n * Inc., 51 Franklin Street, Fifth Floor, Boston MA 02110-1301, USA.\n *****************************************************************************\/\n\n#if HAVE_CONFIG_H\n# include \"config.h\"\n#endif\n\n#include \"Url.h\"\n#include \"Filename.h\"\n#include \"medialibrary\/filesystem\/Errors.h\"\n\n#include <stdexcept>\n#include <cstring>\n#include <algorithm>\n\nnamespace\n{\ninline bool isSafe( char c )\n{\n return strchr( \".-_~\/\"\n#ifdef _WIN32\n \"\\\\\"\n#endif\n , c ) != nullptr;\n}\n\nstd::string::const_iterator encodeSegment( std::string& res,\n std::string::const_iterator begin,\n std::string::const_iterator end,\n const char* extraChars )\n{\n for ( auto i = begin; i < end; ++i )\n {\n \/\/ This must be an unsigned char for the bits operations below to work.\n \/\/ auto will yield a signed char here.\n const unsigned char c = *i;\n if ( ( c >= 32 && c <= 126 ) && (\n ( c >= 'a' && c <= 'z' ) ||\n ( c >= 'A' && c <= 'Z' ) ||\n ( c >= '0' && c <= '9' ) ||\n isSafe( c ) == true ||\n ( extraChars != nullptr && strchr( extraChars, c ) != nullptr ) )\n )\n {\n res.push_back( c );\n }\n else\n res.append({ '%', \"0123456789ABCDEF\"[c >> 4], \"0123456789ABCDEF\"[c & 0xF] });\n }\n return end;\n}\n\ninline uint16_t charToVal( char c )\n{\n if ( c >= '0' && c <= '9' )\n return c - '0';\n if ( c >= 'a' && c <= 'f' )\n return c - 'a' + 10;\n if ( c >= 'A' && c <= 'F' )\n return c - 'A' + 10;\n throw std::runtime_error( \"Incomplete\/invalid character sequence\" );\n}\n\n}\n\nnamespace medialibrary\n{\nnamespace utils\n{\nnamespace url\n{\n\nparts split( const std::string& url )\n{\n parts res{};\n auto schemePos = url.find( \":\/\/\" );\n if ( schemePos == std::string::npos )\n {\n res.path = url;\n return res;\n }\n std::copy( url.cbegin(), url.cbegin() + schemePos,\n std::back_inserter( res.scheme ) );\n\n\n if ( res.scheme == \"file\" )\n {\n std::copy( url.cbegin() + schemePos + 3, url.cend(),\n std::back_inserter( res.path ) );\n return res;\n }\n\n const auto authorityBegin = url.cbegin() + schemePos + 3;\n auto authorityEnd = std::find( authorityBegin, url.cend(), '\/' );\n auto queryBegin = std::find( authorityBegin, url.cend(), '?' );\n const auto fragmentBegin = std::find( authorityBegin, url.cend(), '#' );\n\n \/*\n * The fragment must come after the query parameters. Since we use both\n * values at a later point, sanitize them now.\n *\/\n if ( fragmentBegin != url.cend() && queryBegin != url.cend() &&\n fragmentBegin < queryBegin )\n {\n queryBegin = url.cend();\n }\n\n \/* RFC 3986 §3.2:\n * The authority component is preceded by a double slash (\"\/\/\") and is\n * terminated by the next slash (\"\/\"), question mark (\"?\"), or number\n * sign (\"#\") character, or by the end of the URI.\n *\/\n if ( authorityEnd == url.cend() )\n {\n if ( queryBegin != url.cend() )\n authorityEnd = queryBegin;\n else\n authorityEnd = fragmentBegin;\n }\n else\n {\n if ( queryBegin != url.cend() && queryBegin < authorityEnd )\n authorityEnd = queryBegin;\n if ( fragmentBegin != url.cend() && fragmentBegin < authorityEnd )\n authorityEnd = fragmentBegin;\n }\n\n {\n \/* Split the authority into its actual components *\/\n auto userInfoEnd = std::find( authorityBegin, authorityEnd, '@' );\n if ( userInfoEnd != authorityEnd )\n {\n std::copy( authorityBegin, userInfoEnd,\n std::back_inserter( res.userInfo ) );\n \/* Skip the '@' when copying the host *\/\n ++userInfoEnd;\n res.hostMarker = true;\n }\n else\n userInfoEnd = authorityBegin;\n\n auto portBegin = std::find( userInfoEnd, authorityEnd, ':' );\n if ( portBegin != authorityEnd )\n std::copy( portBegin + 1, authorityEnd, std::back_inserter( res.port ) );\n else\n portBegin = authorityEnd;\n std::copy( userInfoEnd, portBegin, std::back_inserter( res.host ) );\n\n }\n if ( authorityEnd == url.cend() )\n {\n \/*\n * If we don't have a clear end for the authority segment, it means the\n * end is the url end, so we don't have anything else to split\n *\/\n return res;\n }\n\n auto pathEnd = queryBegin != url.cend() ? queryBegin : fragmentBegin;\n std::copy( authorityEnd, pathEnd,\n std::back_inserter( res.path ) );\n if ( queryBegin != url.cend() )\n {\n std::copy( queryBegin + 1,\n fragmentBegin != url.cend() ? fragmentBegin : url.cend(),\n std::back_inserter( res.query ) );\n }\n if ( fragmentBegin != url.cend() )\n {\n std::copy( fragmentBegin + 1, url.cend(),\n std::back_inserter( res.fragments ) );\n }\n return res;\n}\n\nstd::string decode( const std::string& str )\n{\n std::string res;\n res.reserve( str.size() );\n auto it = str.cbegin();\n auto ite = str.cend();\n for ( ; it != ite; ++it )\n {\n if ( *it == '%' )\n {\n ++it;\n const auto c1 = charToVal( *it );\n const auto c2 = charToVal( *( it + 1 ) );\n auto val = c1 * 16 + c2;\n res.push_back( static_cast<std::string::value_type>( val ) );\n ++it;\n }\n else\n res.push_back( *it );\n }\n return res;\n}\n\nstd::string encode( const std::string& str )\n{\n auto parts = split( str );\n std::string res{};\n res.reserve( str.length() );\n \/*\n * If the file is a local path, we need to encode everything as the\n * characters won't have any URL related meaning\n *\/\n if ( parts.scheme == \"file\" || parts.scheme.empty() == true )\n {\n if ( parts.scheme.empty() == false )\n res += \"file:\/\/\";\n auto pathBegin = parts.path.cbegin();\n#ifdef _WIN32\n if ( *pathBegin == '\/' && isalpha( *(pathBegin + 1) ) && *(pathBegin + 2) == ':' )\n {\n \/\/ Don't encode the ':' after the drive letter.\n \/\/ All other ':' need to be encoded, there are not allowed in a file path\n \/\/ on windows, but they might appear in urls\n std::copy( pathBegin, pathBegin + 3, std::back_inserter( res ) );\n pathBegin += 3;\n }\n#endif\n encodeSegment( res, pathBegin, parts.path.cend(), nullptr );\n return res;\n }\n \/*\n * We already accept any character in \".-_~\/\" through isSafe(), but we need\n * to accept more depending on the URL segments:\n *\/\n encodeSegment( res, parts.scheme.cbegin(), parts.scheme.cend(), \"+\" );\n res += \":\/\/\";\n if ( parts.userInfo.empty() == false )\n {\n encodeSegment( res, parts.userInfo.cbegin(), parts.userInfo.cend(),\n \"!$&'()*+,;=:\" );\n }\n if ( parts.hostMarker == true )\n res += '@';\n encodeSegment( res, parts.host.cbegin(), parts.host.cend(), \"[]\" );\n if ( parts.port.empty() == false )\n {\n res += ':';\n res += parts.port;\n }\n\n encodeSegment( res, parts.path.cbegin(), parts.path.cend(), \"!$&'()*+,;=:@\" );\n\n if ( parts.query.empty() == false )\n {\n res += '?';\n encodeSegment( res, parts.query.cbegin(), parts.query.cend(),\n \"!$&'()*+,;=:@?\" );\n }\n if ( parts.fragments.empty() == false )\n {\n res += '#';\n encodeSegment( res, parts.query.cbegin(), parts.query.cend(),\n \"!$&'()*+,;=:@?\" );\n }\n return res;\n}\n\nstd::string stripScheme( const std::string& mrl )\n{\n auto pos = mrl.find( \":\/\/\" );\n if ( pos == std::string::npos )\n throw fs::errors::UnhandledScheme( \"<empty scheme>\" );\n return mrl.substr( pos + 3 );\n}\n\nstd::string scheme( const std::string& mrl )\n{\n auto pos = mrl.find( \":\/\/\" );\n if ( pos == std::string::npos )\n throw fs::errors::UnhandledScheme( \"<empty scheme>\" );\n return mrl.substr( 0, pos + 3 );\n}\n\n#ifndef _WIN32\n\nstd::string toLocalPath( const std::string& mrl )\n{\n if ( mrl.compare( 0, 7, \"file:\/\/\" ) != 0 )\n throw fs::errors::UnhandledScheme( scheme( mrl ) );\n return utils::url::decode( mrl.substr( 7 ) );\n}\n\n#else\n\nstd::string toLocalPath( const std::string& mrl )\n{\n if ( mrl.compare( 0, 7, \"file:\/\/\" ) != 0 )\n throw fs::errors::UnhandledScheme( utils::url::scheme( mrl ) );\n auto path = mrl.substr( 7 );\n \/\/ If the path is a local path (ie. X:\\path\\to and not \\\\path\\to) skip the\n \/\/ initial backslash, as it is only part of our representation, and not\n \/\/ understood by the win32 API functions\n \/\/ Note that the initial '\/' (after the 2 forward slashes from the scheme)\n \/\/ is not a backslash, as it is not a path separator, so do not use\n \/\/ DIR_SEPARATOR_CHAR here.\n if ( path[0] == '\/' && isalpha( path[1] ) )\n path.erase( 0, 1 );\n std::replace( begin( path ), end( path ), '\/', '\\\\' );\n return utils::url::decode( path );\n}\n\n#endif\n\nbool schemeIs( const std::string& scheme, const std::string& mrl )\n{\n return mrl.compare( 0, scheme.size(), scheme ) == 0;\n}\n\nstd::string path( const std::string &mrl )\n{\n auto schemelessMrl = stripScheme( mrl );\n auto host = utils::file::firstFolder( schemelessMrl );\n return utils::file::removePath( schemelessMrl, host );\n}\n\n}\n}\n}\n<commit_msg>utils: Fix variable shawoding outer function<commit_after>\/*****************************************************************************\n * Media Library\n *****************************************************************************\n * Copyright (C) 2017-2019 Hugo Beauzée-Luyssen, Videolabs, VideoLAN\n *\n * Authors: Hugo Beauzée-Luyssen <hugo@beauzee.fr>\n *\n * This program is free software; you can redistribute it and\/or modify it\n * under the terms of the GNU Lesser General Public License as published by\n * the Free Software Foundation; either version 2.1 of the License, or\n * (at your option) any later version.\n *\n * This program is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the\n * GNU Lesser General Public License for more details.\n *\n * You should have received a copy of the GNU Lesser General Public License\n * along with this program; if not, write to the Free Software Foundation,\n * Inc., 51 Franklin Street, Fifth Floor, Boston MA 02110-1301, USA.\n *****************************************************************************\/\n\n#if HAVE_CONFIG_H\n# include \"config.h\"\n#endif\n\n#include \"Url.h\"\n#include \"Filename.h\"\n#include \"medialibrary\/filesystem\/Errors.h\"\n\n#include <stdexcept>\n#include <cstring>\n#include <algorithm>\n\nnamespace\n{\ninline bool isSafe( char c )\n{\n return strchr( \".-_~\/\"\n#ifdef _WIN32\n \"\\\\\"\n#endif\n , c ) != nullptr;\n}\n\nstd::string::const_iterator encodeSegment( std::string& res,\n std::string::const_iterator begin,\n std::string::const_iterator end,\n const char* extraChars )\n{\n for ( auto i = begin; i < end; ++i )\n {\n \/\/ This must be an unsigned char for the bits operations below to work.\n \/\/ auto will yield a signed char here.\n const unsigned char c = *i;\n if ( ( c >= 32 && c <= 126 ) && (\n ( c >= 'a' && c <= 'z' ) ||\n ( c >= 'A' && c <= 'Z' ) ||\n ( c >= '0' && c <= '9' ) ||\n isSafe( c ) == true ||\n ( extraChars != nullptr && strchr( extraChars, c ) != nullptr ) )\n )\n {\n res.push_back( c );\n }\n else\n res.append({ '%', \"0123456789ABCDEF\"[c >> 4], \"0123456789ABCDEF\"[c & 0xF] });\n }\n return end;\n}\n\ninline uint16_t charToVal( char c )\n{\n if ( c >= '0' && c <= '9' )\n return c - '0';\n if ( c >= 'a' && c <= 'f' )\n return c - 'a' + 10;\n if ( c >= 'A' && c <= 'F' )\n return c - 'A' + 10;\n throw std::runtime_error( \"Incomplete\/invalid character sequence\" );\n}\n\n}\n\nnamespace medialibrary\n{\nnamespace utils\n{\nnamespace url\n{\n\nparts split( const std::string& url )\n{\n parts res{};\n auto schemePos = url.find( \":\/\/\" );\n if ( schemePos == std::string::npos )\n {\n res.path = url;\n return res;\n }\n std::copy( url.cbegin(), url.cbegin() + schemePos,\n std::back_inserter( res.scheme ) );\n\n\n if ( res.scheme == \"file\" )\n {\n std::copy( url.cbegin() + schemePos + 3, url.cend(),\n std::back_inserter( res.path ) );\n return res;\n }\n\n const auto authorityBegin = url.cbegin() + schemePos + 3;\n auto authorityEnd = std::find( authorityBegin, url.cend(), '\/' );\n auto queryBegin = std::find( authorityBegin, url.cend(), '?' );\n const auto fragmentBegin = std::find( authorityBegin, url.cend(), '#' );\n\n \/*\n * The fragment must come after the query parameters. Since we use both\n * values at a later point, sanitize them now.\n *\/\n if ( fragmentBegin != url.cend() && queryBegin != url.cend() &&\n fragmentBegin < queryBegin )\n {\n queryBegin = url.cend();\n }\n\n \/* RFC 3986 §3.2:\n * The authority component is preceded by a double slash (\"\/\/\") and is\n * terminated by the next slash (\"\/\"), question mark (\"?\"), or number\n * sign (\"#\") character, or by the end of the URI.\n *\/\n if ( authorityEnd == url.cend() )\n {\n if ( queryBegin != url.cend() )\n authorityEnd = queryBegin;\n else\n authorityEnd = fragmentBegin;\n }\n else\n {\n if ( queryBegin != url.cend() && queryBegin < authorityEnd )\n authorityEnd = queryBegin;\n if ( fragmentBegin != url.cend() && fragmentBegin < authorityEnd )\n authorityEnd = fragmentBegin;\n }\n\n {\n \/* Split the authority into its actual components *\/\n auto userInfoEnd = std::find( authorityBegin, authorityEnd, '@' );\n if ( userInfoEnd != authorityEnd )\n {\n std::copy( authorityBegin, userInfoEnd,\n std::back_inserter( res.userInfo ) );\n \/* Skip the '@' when copying the host *\/\n ++userInfoEnd;\n res.hostMarker = true;\n }\n else\n userInfoEnd = authorityBegin;\n\n auto portBegin = std::find( userInfoEnd, authorityEnd, ':' );\n if ( portBegin != authorityEnd )\n std::copy( portBegin + 1, authorityEnd, std::back_inserter( res.port ) );\n else\n portBegin = authorityEnd;\n std::copy( userInfoEnd, portBegin, std::back_inserter( res.host ) );\n\n }\n if ( authorityEnd == url.cend() )\n {\n \/*\n * If we don't have a clear end for the authority segment, it means the\n * end is the url end, so we don't have anything else to split\n *\/\n return res;\n }\n\n auto pathEnd = queryBegin != url.cend() ? queryBegin : fragmentBegin;\n std::copy( authorityEnd, pathEnd,\n std::back_inserter( res.path ) );\n if ( queryBegin != url.cend() )\n {\n std::copy( queryBegin + 1,\n fragmentBegin != url.cend() ? fragmentBegin : url.cend(),\n std::back_inserter( res.query ) );\n }\n if ( fragmentBegin != url.cend() )\n {\n std::copy( fragmentBegin + 1, url.cend(),\n std::back_inserter( res.fragments ) );\n }\n return res;\n}\n\nstd::string decode( const std::string& str )\n{\n std::string res;\n res.reserve( str.size() );\n auto it = str.cbegin();\n auto ite = str.cend();\n for ( ; it != ite; ++it )\n {\n if ( *it == '%' )\n {\n ++it;\n const auto c1 = charToVal( *it );\n const auto c2 = charToVal( *( it + 1 ) );\n auto val = c1 * 16 + c2;\n res.push_back( static_cast<std::string::value_type>( val ) );\n ++it;\n }\n else\n res.push_back( *it );\n }\n return res;\n}\n\nstd::string encode( const std::string& str )\n{\n auto parts = split( str );\n std::string res{};\n res.reserve( str.length() );\n \/*\n * If the file is a local path, we need to encode everything as the\n * characters won't have any URL related meaning\n *\/\n if ( parts.scheme == \"file\" || parts.scheme.empty() == true )\n {\n if ( parts.scheme.empty() == false )\n res += \"file:\/\/\";\n auto pathBegin = parts.path.cbegin();\n#ifdef _WIN32\n if ( *pathBegin == '\/' && isalpha( *(pathBegin + 1) ) && *(pathBegin + 2) == ':' )\n {\n \/\/ Don't encode the ':' after the drive letter.\n \/\/ All other ':' need to be encoded, there are not allowed in a file path\n \/\/ on windows, but they might appear in urls\n std::copy( pathBegin, pathBegin + 3, std::back_inserter( res ) );\n pathBegin += 3;\n }\n#endif\n encodeSegment( res, pathBegin, parts.path.cend(), nullptr );\n return res;\n }\n \/*\n * We already accept any character in \".-_~\/\" through isSafe(), but we need\n * to accept more depending on the URL segments:\n *\/\n encodeSegment( res, parts.scheme.cbegin(), parts.scheme.cend(), \"+\" );\n res += \":\/\/\";\n if ( parts.userInfo.empty() == false )\n {\n encodeSegment( res, parts.userInfo.cbegin(), parts.userInfo.cend(),\n \"!$&'()*+,;=:\" );\n }\n if ( parts.hostMarker == true )\n res += '@';\n encodeSegment( res, parts.host.cbegin(), parts.host.cend(), \"[]\" );\n if ( parts.port.empty() == false )\n {\n res += ':';\n res += parts.port;\n }\n\n encodeSegment( res, parts.path.cbegin(), parts.path.cend(), \"!$&'()*+,;=:@\" );\n\n if ( parts.query.empty() == false )\n {\n res += '?';\n encodeSegment( res, parts.query.cbegin(), parts.query.cend(),\n \"!$&'()*+,;=:@?\" );\n }\n if ( parts.fragments.empty() == false )\n {\n res += '#';\n encodeSegment( res, parts.query.cbegin(), parts.query.cend(),\n \"!$&'()*+,;=:@?\" );\n }\n return res;\n}\n\nstd::string stripScheme( const std::string& mrl )\n{\n auto pos = mrl.find( \":\/\/\" );\n if ( pos == std::string::npos )\n throw fs::errors::UnhandledScheme( \"<empty scheme>\" );\n return mrl.substr( pos + 3 );\n}\n\nstd::string scheme( const std::string& mrl )\n{\n auto pos = mrl.find( \":\/\/\" );\n if ( pos == std::string::npos )\n throw fs::errors::UnhandledScheme( \"<empty scheme>\" );\n return mrl.substr( 0, pos + 3 );\n}\n\n#ifndef _WIN32\n\nstd::string toLocalPath( const std::string& mrl )\n{\n if ( mrl.compare( 0, 7, \"file:\/\/\" ) != 0 )\n throw fs::errors::UnhandledScheme( scheme( mrl ) );\n return utils::url::decode( mrl.substr( 7 ) );\n}\n\n#else\n\nstd::string toLocalPath( const std::string& mrl )\n{\n if ( mrl.compare( 0, 7, \"file:\/\/\" ) != 0 )\n throw fs::errors::UnhandledScheme( utils::url::scheme( mrl ) );\n auto localPath = mrl.substr( 7 );\n \/\/ If the path is a local path (ie. X:\\path\\to and not \\\\path\\to) skip the\n \/\/ initial backslash, as it is only part of our representation, and not\n \/\/ understood by the win32 API functions\n \/\/ Note that the initial '\/' (after the 2 forward slashes from the scheme)\n \/\/ is not a backslash, as it is not a path separator, so do not use\n \/\/ DIR_SEPARATOR_CHAR here.\n if ( localPath[0] == '\/' && isalpha( localPath[1] ) )\n localPath.erase( 0, 1 );\n std::replace( begin( localPath ), end( localPath ), '\/', '\\\\' );\n return utils::url::decode( localPath );\n}\n\n#endif\n\nbool schemeIs( const std::string& scheme, const std::string& mrl )\n{\n return mrl.compare( 0, scheme.size(), scheme ) == 0;\n}\n\nstd::string path( const std::string &mrl )\n{\n auto schemelessMrl = stripScheme( mrl );\n auto host = utils::file::firstFolder( schemelessMrl );\n return utils::file::removePath( schemelessMrl, host );\n}\n\n}\n}\n}\n<|endoftext|>"} {"text":"<commit_before>\/\/ Copyright (c) 2011 - 2019, GS Group, https:\/\/github.com\/GSGroup\n\/\/ Permission to use, copy, modify, and\/or distribute this software for any purpose with or without fee is hereby granted,\n\/\/ provided that the above copyright notice and this permission notice appear in all copies.\n\/\/ THE SOFTWARE IS PROVIDED \"AS IS\" AND THE AUTHOR DISCLAIMS ALL WARRANTIES WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS.\n\/\/ IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS,\n\/\/ WHETHER IN AN ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE.\n\n#include <stingraykit\/string\/TranslatedString.h>\n\n#include <stingraykit\/collection\/CollectionBuilder.h>\n#include <stingraykit\/collection\/EnumerableHelpers.h>\n#include <stingraykit\/collection\/MapDictionary.h>\n#include <stingraykit\/serialization\/Serialization.h>\n\nnamespace stingray\n{\n\n\tTranslatedString::TranslatedString()\n\t\t: _dictionary(make_shared_ptr<MapDictionary<LangCode, std::string> >())\n\t{ }\n\n\n\tTranslatedString& TranslatedString::AddTranslation(LangCode lang, const std::string& str)\n\t{\n\t\t_dictionary->Set(lang, str);\n\t\treturn *this;\n\t}\n\n\n\tbool TranslatedString::HasTranslation(LangCode lang) const\n\t{\n\t\tif (lang == LangCode::Any)\n\t\t\treturn !_dictionary->IsEmpty();\n\n\t\treturn _dictionary->ContainsKey(lang);\n\t}\n\n\n\tstd::string TranslatedString::GetTranslation(LangCode lang) const\n\t{\n\t\tif (lang == LangCode::Any)\n\t\t\treturn _dictionary->GetEnumerator()->Get().Value;\n\n\t\treturn _dictionary->Get(lang);\n\t}\n\n\n\tstd::string TranslatedString::SelectTranslation(LangCode l0) const\n\t{ return DoSelectTranslation(VectorBuilder<LangCode>(l0, LangCode::Any)); }\n\n\n\tstd::string TranslatedString::SelectTranslation(LangCode l0, LangCode l1) const\n\t{ return DoSelectTranslation(VectorBuilder<LangCode>(l0, l1, LangCode::Any)); }\n\n\n\tstd::string TranslatedString::SelectTranslation(LangCode l0, LangCode l1, LangCode l2) const\n\t{ return DoSelectTranslation(VectorBuilder<LangCode>(l0, l1, l2, LangCode::Any)); }\n\n\n\tstd::string TranslatedString::DoSelectTranslation(const std::vector<LangCode>& langCodes) const\n\t{\n\t\tfor (std::vector<LangCode>::const_iterator it = langCodes.begin(); it != langCodes.end(); ++it)\n\t\t\tif (HasTranslation(*it))\n\t\t\t\treturn GetTranslation(*it);\n\t\treturn \"\";\n\t}\n\n\tstd::string TranslatedString::SelectTranslation(const std::vector<LangCode>& langCodes) const\n\t{\n\t\tfor (std::vector<LangCode>::const_iterator it = langCodes.begin(); it != langCodes.end(); ++it)\n\t\t\tif (HasTranslation(*it))\n\t\t\t\treturn GetTranslation(*it);\n\n\t\treturn GetTranslation(LangCode::Any);\n\t}\n\n\tint TranslatedString::DoCompare(const TranslatedString& other) const\n\t{ return Enumerable::MakeSequenceCmp(comparers::Cmp())(_dictionary, other._dictionary); }\n\n\n\tvoid TranslatedString::Serialize(ObjectOStream& ar) const\n\t{ ar.Serialize(\"translations\", *_dictionary); }\n\n\n\tvoid TranslatedString::Deserialize(ObjectIStream& ar)\n\t{ ar.Deserialize(\"translations\", *_dictionary); }\n\n\n\tstd::string TranslatedString::ToString() const\n\t{ return stingray::ToString(_dictionary); }\n\n}\n<commit_msg>TranslatedString: reorder methods in cpp with same order as in header<commit_after>\/\/ Copyright (c) 2011 - 2019, GS Group, https:\/\/github.com\/GSGroup\n\/\/ Permission to use, copy, modify, and\/or distribute this software for any purpose with or without fee is hereby granted,\n\/\/ provided that the above copyright notice and this permission notice appear in all copies.\n\/\/ THE SOFTWARE IS PROVIDED \"AS IS\" AND THE AUTHOR DISCLAIMS ALL WARRANTIES WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS.\n\/\/ IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS,\n\/\/ WHETHER IN AN ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE.\n\n#include <stingraykit\/string\/TranslatedString.h>\n\n#include <stingraykit\/collection\/CollectionBuilder.h>\n#include <stingraykit\/collection\/EnumerableHelpers.h>\n#include <stingraykit\/collection\/MapDictionary.h>\n#include <stingraykit\/serialization\/Serialization.h>\n\nnamespace stingray\n{\n\n\tTranslatedString::TranslatedString()\n\t\t: _dictionary(make_shared_ptr<MapDictionary<LangCode, std::string> >())\n\t{ }\n\n\n\tTranslatedString& TranslatedString::AddTranslation(LangCode lang, const std::string& str)\n\t{\n\t\t_dictionary->Set(lang, str);\n\t\treturn *this;\n\t}\n\n\n\tbool TranslatedString::HasTranslation(LangCode lang) const\n\t{\n\t\tif (lang == LangCode::Any)\n\t\t\treturn !_dictionary->IsEmpty();\n\n\t\treturn _dictionary->ContainsKey(lang);\n\t}\n\n\n\tstd::string TranslatedString::GetTranslation(LangCode lang) const\n\t{\n\t\tif (lang == LangCode::Any)\n\t\t\treturn _dictionary->GetEnumerator()->Get().Value;\n\n\t\treturn _dictionary->Get(lang);\n\t}\n\n\n\tvoid TranslatedString::Serialize(ObjectOStream& ar) const\n\t{ ar.Serialize(\"translations\", *_dictionary); }\n\n\n\tvoid TranslatedString::Deserialize(ObjectIStream& ar)\n\t{ ar.Deserialize(\"translations\", *_dictionary); }\n\n\n\tstd::string TranslatedString::ToString() const\n\t{ return stingray::ToString(_dictionary); }\n\n\n\tstd::string TranslatedString::SelectTranslation(LangCode l0) const\n\t{ return DoSelectTranslation(VectorBuilder<LangCode>(l0, LangCode::Any)); }\n\n\n\tstd::string TranslatedString::SelectTranslation(LangCode l0, LangCode l1) const\n\t{ return DoSelectTranslation(VectorBuilder<LangCode>(l0, l1, LangCode::Any)); }\n\n\n\tstd::string TranslatedString::SelectTranslation(LangCode l0, LangCode l1, LangCode l2) const\n\t{ return DoSelectTranslation(VectorBuilder<LangCode>(l0, l1, l2, LangCode::Any)); }\n\n\n\tstd::string TranslatedString::SelectTranslation(const std::vector<LangCode>& langCodes) const\n\t{\n\t\tfor (std::vector<LangCode>::const_iterator it = langCodes.begin(); it != langCodes.end(); ++it)\n\t\t\tif (HasTranslation(*it))\n\t\t\t\treturn GetTranslation(*it);\n\n\t\treturn GetTranslation(LangCode::Any);\n\t}\n\n\n\tstd::string TranslatedString::DoSelectTranslation(const std::vector<LangCode>& langCodes) const\n\t{\n\t\tfor (std::vector<LangCode>::const_iterator it = langCodes.begin(); it != langCodes.end(); ++it)\n\t\t\tif (HasTranslation(*it))\n\t\t\t\treturn GetTranslation(*it);\n\t\treturn \"\";\n\t}\n\n\n\tint TranslatedString::DoCompare(const TranslatedString& other) const\n\t{ return Enumerable::MakeSequenceCmp(comparers::Cmp())(_dictionary, other._dictionary); }\n\n}\n<|endoftext|>"} {"text":"<commit_before>#include <gflags\/gflags.h>\n#include <glog\/logging.h>\n#include <iostream>\n#include <fstream>\n#include \"utils\/cluster_rt.h\"\n#include \"proto\/singa.pb.h\"\n#include \"utils\/common.h\"\n#ifndef GFLAGS_GFLAGS_H_\n namespace gflags = google;\n#endif \/\/ GFLAGS_GFLAGS_H_\n\nDEFINE_string(global, \"conf\/singa.conf\", \"Global config file\");\n\nint main(int argc, char **argv) {\n google::InitGoogleLogging(argv[0]);\n gflags::ParseCommandLineFlags(&argc, &argv, true);\n\n singa::SingaProto global;\n singa::ReadProtoFromTextFile(FLAGS_global.c_str(), &global);\n singa::SetupLog(global.log_dir(), \"SingaTool\");\n\n LOG(INFO) << \"The global config is \\n\" << global.DebugString();\n\n singa::JobManager mng(global.zookeeper_host());\n std::string usage = \"singatool usage:\\n\"\n \".\/singatool create : generate a unique job id\\n\"\n \".\/singatool list : list running singa jobs\\n\"\n \".\/singatool view JOB_ID : view procs of a singa job\\n\"\n \".\/singatool clean JOB_ID : clean a job path in zookeeper\\n\"\n \".\/singatool cleanup : clean all singa data in zookeeper\\n\"\n \".\/singatool listall : list all singa jobs\\n\";\n if (argc <= 1) {\n LOG(ERROR) << usage;\n return 1;\n }\n if (!mng.Init()) return 1;\n if (!strcmp(argv[1], \"create\")) {\n int id = mng.GenerateJobID();\n printf(\"%d\\n\", id);\n } else if (!strcmp(argv[1], \"list\")) {\n std::vector<singa::JobInfo> jobs;\n if (!mng.ListJobs(&jobs)) return 1;\n printf(\"JOB ID |NUM PROCS \\n\");\n printf(\"----------|-----------\\n\");\n for (singa::JobInfo job : jobs) {\n if (!job.procs) continue;\n printf(\"job-%-6d|%-10d\\n\", job.id, job.procs);\n }\n } else if (!strcmp(argv[1], \"listall\")) {\n std::vector<singa::JobInfo> jobs;\n if (!mng.ListJobs(&jobs)) return 1;\n printf(\"JOB ID |NUM PROCS \\n\");\n printf(\"----------|-----------\\n\");\n for (singa::JobInfo job : jobs) {\n printf(\"job-%-6d|%-10d\\n\", job.id, job.procs);\n }\n } else if (!strcmp(argv[1], \"view\")) {\n if (argc <= 2) {\n LOG(ERROR) << usage;\n return 1;\n }\n int id = atoi(argv[2]);\n std::vector<std::string> procs;\n if (!mng.ListJobProcs(id, &procs)) return 1;\n for (std::string s : procs) {\n printf(\"%s\\n\", s.c_str());\n }\n } else if (!strcmp(argv[1], \"clean\")) {\n if (argc <= 2) {\n LOG(ERROR) << usage;\n return 1;\n }\n int id = atoi(argv[2]);\n if (!mng.Clean(id)) return 1;\n } else if (!strcmp(argv[1], \"cleanup\")) {\n if (!mng.Cleanup()) return 1;\n } else {\n LOG(ERROR) << usage;\n return 1;\n }\n\n return 0;\n}\n<commit_msg>SINGA-36 Clean ModelProto, ClusterProto, JobProto and driver program<commit_after>#include <gflags\/gflags.h>\n#include <glog\/logging.h>\n#include <iostream>\n#include <fstream>\n#include \"utils\/cluster_rt.h\"\n#include \"proto\/singa.pb.h\"\n#include \"utils\/common.h\"\n#ifndef GFLAGS_GFLAGS_H_\nnamespace gflags = google;\n#endif \/\/ GFLAGS_GFLAGS_H_\n\nDEFINE_string(global, \"conf\/singa.conf\", \"Global config file\");\n\nint main(int argc, char **argv) {\n google::InitGoogleLogging(argv[0]);\n \/\/ set logging level to ERROR and log to STDERR\n FLAGS_logtostderr = 1;\n FLAGS_minloglevel = 2;\n gflags::ParseCommandLineFlags(&argc, &argv, true);\n\n singa::SingaProto global;\n singa::ReadProtoFromTextFile(FLAGS_global.c_str(), &global);\n LOG(INFO) << \"The global config is \\n\" << global.DebugString();\n\n singa::JobManager mng(global.zookeeper_host());\n std::string usage = \"singatool usage:\\n\"\n \"# .\/singatool create : generate a unique job id\\n\"\n \"# .\/singatool list : list running singa jobs\\n\"\n \"# .\/singatool view JOB_ID : view procs of a singa job\\n\"\n \"# .\/singatool clean JOB_ID : clean a job path in zookeeper\\n\"\n \"# .\/singatool cleanup : clean all singa data in zookeeper\\n\"\n \"# .\/singatool listall : list all singa jobs\\n\";\n if (argc <= 1) {\n LOG(ERROR) << usage;\n return 1;\n }\n if (!mng.Init()) return 1;\n if (!strcmp(argv[1], \"create\")) {\n int id = mng.GenerateJobID();\n printf(\"%d\\n\", id);\n } else if (!strcmp(argv[1], \"list\")) {\n std::vector<singa::JobInfo> jobs;\n if (!mng.ListJobs(&jobs)) return 1;\n printf(\"JOB ID |NUM PROCS \\n\");\n printf(\"----------|-----------\\n\");\n for (singa::JobInfo job : jobs) {\n if (!job.procs) continue;\n printf(\"job-%-6d|%-10d\\n\", job.id, job.procs);\n }\n } else if (!strcmp(argv[1], \"listall\")) {\n std::vector<singa::JobInfo> jobs;\n if (!mng.ListJobs(&jobs)) return 1;\n printf(\"JOB ID |NUM PROCS \\n\");\n printf(\"----------|-----------\\n\");\n for (singa::JobInfo job : jobs) {\n printf(\"job-%-6d|%-10d\\n\", job.id, job.procs);\n }\n } else if (!strcmp(argv[1], \"view\")) {\n if (argc <= 2) {\n LOG(ERROR) << usage;\n return 1;\n }\n int id = atoi(argv[2]);\n std::vector<std::string> procs;\n if (!mng.ListJobProcs(id, &procs)) return 1;\n for (std::string s : procs) {\n printf(\"%s\\n\", s.c_str());\n }\n } else if (!strcmp(argv[1], \"clean\")) {\n if (argc <= 2) {\n LOG(ERROR) << usage;\n return 1;\n }\n int id = atoi(argv[2]);\n if (!mng.Clean(id)) return 1;\n } else if (!strcmp(argv[1], \"cleanup\")) {\n if (!mng.Cleanup()) return 1;\n } else {\n LOG(ERROR) << usage;\n return 1;\n }\n\n return 0;\n}\n<|endoftext|>"} {"text":"<commit_before>#pragma once\n\n#include <array>\n#include <vector>\n#include <ostream>\n#include <cstring>\n\n#ifdef DEBUG\n#\tinclude <iostream>\n#endif\n\n#include \"util.hpp\"\n#include \"debug.hpp\"\n\nnamespace utki{\n\n\/**\n * @brief span template class.\n * This class is a wrapper of continuous memory span, it encapsulates pointer to memory block and size of that memory block.\n * It does not own the memory.\n * This is a replacement of std::span when C++'20 is not available.\n *\/\ntemplate <class T> class span final{\npublic:\n\ttypedef T value_type;\n\ttypedef value_type* pointer;\n\ttypedef const value_type* const_pointer;\n\ttypedef value_type& reference;\n\ttypedef const value_type& const_reference;\n\ttypedef value_type* iterator;\n\ttypedef const value_type* const_iterator;\n\ttypedef std::size_t size_type;\n\ttypedef std::ptrdiff_t difference_type;\n\ttypedef std::reverse_iterator<iterator> reverse_iterator;\n\ttypedef std::reverse_iterator<const_iterator> const_reverse_iterator;\n\t\nprivate:\n\tpointer buf = nullptr;\n\tsize_type buf_size = 0;\n\t\npublic:\n\tspan(const span&) = default;\n\tspan& operator=(const span&) = default;\n\t\n\t\/**\n\t * @brief Create a span object.\n\t * Creates a span object which wraps given memory buffer of specified size.\n\t * Note, the memory will not be freed upon this Buffer object destruction,\n\t * Buffer does not own the memory.\n\t * @param p - pointer to the memory buffer.\n\t * @param s - size of the memory buffer.\n\t *\/\n\tspan(pointer p, size_type s)noexcept :\n\t\t\tbuf(p),\n\t\t\tbuf_size(s)\n\t{}\n\t\n\tspan()noexcept{}\n\t\n\t\/**\n\t * @brief Constructor for automatic conversion from nullptr.\n *\/\n\tspan(std::nullptr_t)noexcept :\n\t\t\tbuf(nullptr),\n\t\t\tbuf_size(0)\n\t{}\n\t\n\t\/**\n\t * @brief for internal use only.\n\t * This class is not supposed to be used by users.\n\t *\/\n\tclass dummy_span_class{\n\tpublic:\n\t\tT* data(){return nullptr;}\n\t\tsize_t size(){return 0;}\n\t};\n\n\t\/**\n\t * @brief Constructor for automatic conversion to span<const T>.\n\t * @param sp - span to convert.\n\t *\/\n\tspan(const span<\n\t\t\ttypename std::conditional<\n\t\t\t\t\tstd::is_const<T>::value,\n\t\t\t\t\ttypename std::remove_const<T>::type,\n\t\t\t\t\tdummy_span_class\n\t\t\t\t>::type\n\t\t>& sp) :\n\t\t\tbuf(sp.data()),\n\t\t\tbuf_size(sp.size())\n\t{}\n\n\t\/**\n\t * @brief get span size.\n\t * @return number of elements in the span.\n\t *\/\n\tsize_type size()const noexcept{\n\t\treturn this->buf_size;\n\t}\n\n\t\/**\n\t * @brief Check if span is empty.\n\t * @return true if the span is empty.\n\t * @return false if the span is not empty.\n\t *\/\n\tbool empty()const noexcept{\n\t\treturn this->size() == 0;\n\t}\n\n\t\/**\n\t * @brief get size of span in bytes.\n\t * @return size of array in bytes.\n\t *\/\n\tsize_type size_bytes()const noexcept{\n\t\treturn this->size() * sizeof(value_type);\n\t}\n\n\t\/**\n\t * @brief access specified element of the span.\n\t * Const version of operator[].\n\t * @param i - element index.\n\t * @return reference to i'th element of the span.\n\t *\/\n\tconst_reference operator[](size_type i)const noexcept{\n\t\tASSERT(i < this->size())\n\t\treturn this->buf[i];\n\t}\n\n\t\/**\n\t * @brief access specified element of the span.\n\t * @param i - element index.\n\t * @return reference to i'th element of the span.\n\t *\/\n\treference operator[](size_type i)noexcept{\n\t\tASSERT(i < this->size(), [&](auto&o){o << \"operator[](\" << i << \"): index out of bounds\";})\n\t\treturn this->buf[i];\n\t}\n\n\t\/**\n\t * @brief get iterator to first element of the span.\n\t * @return iterator to first element of the span.\n\t *\/\n\titerator begin()noexcept{\n\t\treturn this->buf;\n\t}\n\n\t\/**\n\t * @brief get iterator of the first element of the span.\n\t * @return iterator of the first element of the span.\n\t *\/\n\tconst_iterator begin()const noexcept{\n\t\treturn this->cbegin();\n\t}\n\n\t\/**\n\t * @brief get const iterator of the first element of the span.\n\t * @return const iterator of the first element of the span.\n\t *\/\n\tconst_iterator cbegin()const noexcept{\n\t\treturn this->buf;\n\t}\n\n\t\/**\n\t * @brief get iterator to \"after last\" element of the span.\n\t * @return iterator to \"after last\" element of the span.\n\t *\/\n\titerator end()noexcept{\n\t\treturn this->buf + this->buf_size;\n\t}\n\n\t\/**\n\t * @brief get const iterator to \"after last\" element of the span.\n\t * @return const iterator to \"after last\" element of the span.\n\t *\/\n\tconst_iterator end()const noexcept{\n\t\treturn this->cend();\n\t}\n\t\n\t\/**\n\t * @brief get const iterator to \"after last\" element of the span.\n\t * @return const iterator to \"after last\" element of the span.\n\t *\/\n\tconst_iterator cend()const noexcept{\n\t\treturn this->buf + this->buf_size;\n\t}\n\n\t\n\tconst_reverse_iterator crbegin()const noexcept{\n\t\treturn const_reverse_iterator(this->end());\n\t}\n\n\tconst_reverse_iterator crend()const noexcept{\n\t\treturn const_reverse_iterator(this->begin());\n\t}\n\t\n\treverse_iterator rbegin()noexcept{\n\t\treturn reverse_iterator(this->end());\n\t}\n\n\tconst_reverse_iterator rbegin()const noexcept{\n\t\treturn const_reverse_iterator(this->end());\n\t}\n\n\treverse_iterator rend()noexcept{\n\t\treturn reverse_iterator(this->begin());\n\t}\n\n\tconst_reverse_iterator rend()const noexcept{\n\t\treturn const_reverse_iterator(this->begin());\n\t}\n\t\n\tpointer data()noexcept{\n\t\treturn this->buf;\n\t}\n\n\tconst_pointer data()const noexcept{\n\t\treturn this->buf;\n\t}\n\n\tvalue_type& front()noexcept{\n\t\tASSERT(!this->empty())\n\t\treturn this->operator[](0);\n\t}\n\n\tconst value_type& front()const noexcept{\n\t\tASSERT(!this->empty())\n\t\treturn this->operator[](0);\n\t}\n\n\tvalue_type& back()noexcept{\n\t\tASSERT(!this->empty())\n\t\treturn this->operator[](this->size() - 1);\n\t}\n\n\tconst value_type& back()const noexcept{\n\t\tASSERT(!this->empty())\n\t\treturn this->operator[](this->size() - 1);\n\t}\n\n\tspan subspan(\n\t\t\tsize_type offset,\n\t\t\tsize_type count = std::numeric_limits<size_type>::max()\n\t\t)const noexcept\n\t{\n\t\tpointer new_p = offset > this->size() ? this->end() : this->data() + offset;\n\t\tASSERT(new_p <= this->end())\n\t\tsize_type max_new_s = this->end() - new_p;\n\t\tsize_type new_s = count > max_new_s ? max_new_s : count;\n\t\tASSERT(new_p + new_s <= this->end())\n\t\treturn span(new_p, new_s);\n\t}\n\n\t\/**\n\t * @brief Checks if pointer points somewhere within the span.\n\t * @param p - pointer to check.\n\t * @return true - if pointer passed as argument points somewhere within the span.\n\t * @return false otherwise.\n\t *\/\n\tbool overlaps(const_pointer p)const noexcept{\n\t\treturn this->begin() <= p && p <= (this->end() - 1);\n\t}\n\n\tfriend std::ostream& operator<<(std::ostream& s, const span<T>& buf){\n\t\tfor(auto& e : buf){\n\t\t\ts << e;\n\t\t}\n\t\treturn s;\n\t}\n};\n\ntemplate <class T> inline utki::span<T> make_span(std::nullptr_t){\n\treturn utki::span<T>(nullptr);\n}\n\ntemplate <class T> inline utki::span<T> make_span(T* buf, size_t size){\n\treturn utki::span<T>(buf, size);\n}\n\ntemplate <class T, std::size_t array_size> inline utki::span<T> make_span(std::array<T, array_size>& a){\n\treturn make_span(a.size() == 0 ? nullptr : a.data(), a.size());\n}\n\ntemplate <class T, std::size_t array_size> inline utki::span<const T> make_span(const std::array<T, array_size>& a){\n\treturn make_span(a.size() == 0 ? nullptr : a.data(), a.size());\n}\n\ntemplate <class T> inline utki::span<T> make_span(std::vector<T>& v){\n\treturn make_span(v.size() == 0 ? nullptr : v.data(), v.size());\n}\n\ntemplate <class T> inline utki::span<const T> make_span(const std::vector<T>& v){\n\treturn make_span(v.size() == 0 ? nullptr : v.data(), v.size());\n}\n\n\/**\n * @brief Make span representing contents of a basic_string.\n * @param s - string to make the span from.\n * @return span of the string contents.\n *\/\ntemplate <class T> inline utki::span<const T> make_span(const std::basic_string<T>& s){\n\treturn make_span(s.size() == 0 ? nullptr : s.data(), s.size());\n}\n\n\/**\n * @brief Make span from zero-terminated string.\n * @param str - zero-terminated string to make span from.\n * @return span representing contents of the string.\n *\/\ninline utki::span<const char> make_span(const char* str){\n\treturn make_span(str, strlen(str));\n}\n\n}\n<commit_msg>undefine the max macro<commit_after>#pragma once\n\n#include <array>\n#include <vector>\n#include <ostream>\n#include <cstring>\n\n#ifdef DEBUG\n#\tinclude <iostream>\n#endif\n\n#include \"util.hpp\"\n#include \"debug.hpp\"\n\n\/\/ undefine the max macro in case it is defined (e.g. by windows.h)\n#ifdef max\n#\tundef max\n#endif\n\nnamespace utki{\n\n\/**\n * @brief span template class.\n * This class is a wrapper of continuous memory span, it encapsulates pointer to memory block and size of that memory block.\n * It does not own the memory.\n * This is a replacement of std::span when C++'20 is not available.\n *\/\ntemplate <class T> class span final{\npublic:\n\ttypedef T value_type;\n\ttypedef value_type* pointer;\n\ttypedef const value_type* const_pointer;\n\ttypedef value_type& reference;\n\ttypedef const value_type& const_reference;\n\ttypedef value_type* iterator;\n\ttypedef const value_type* const_iterator;\n\ttypedef std::size_t size_type;\n\ttypedef std::ptrdiff_t difference_type;\n\ttypedef std::reverse_iterator<iterator> reverse_iterator;\n\ttypedef std::reverse_iterator<const_iterator> const_reverse_iterator;\n\t\nprivate:\n\tpointer buf = nullptr;\n\tsize_type buf_size = 0;\n\t\npublic:\n\tspan(const span&) = default;\n\tspan& operator=(const span&) = default;\n\t\n\t\/**\n\t * @brief Create a span object.\n\t * Creates a span object which wraps given memory buffer of specified size.\n\t * Note, the memory will not be freed upon this Buffer object destruction,\n\t * Buffer does not own the memory.\n\t * @param p - pointer to the memory buffer.\n\t * @param s - size of the memory buffer.\n\t *\/\n\tspan(pointer p, size_type s)noexcept :\n\t\t\tbuf(p),\n\t\t\tbuf_size(s)\n\t{}\n\t\n\tspan()noexcept{}\n\t\n\t\/**\n\t * @brief Constructor for automatic conversion from nullptr.\n *\/\n\tspan(std::nullptr_t)noexcept :\n\t\t\tbuf(nullptr),\n\t\t\tbuf_size(0)\n\t{}\n\t\n\t\/**\n\t * @brief for internal use only.\n\t * This class is not supposed to be used by users.\n\t *\/\n\tclass dummy_span_class{\n\tpublic:\n\t\tT* data(){return nullptr;}\n\t\tsize_t size(){return 0;}\n\t};\n\n\t\/**\n\t * @brief Constructor for automatic conversion to span<const T>.\n\t * @param sp - span to convert.\n\t *\/\n\tspan(const span<\n\t\t\ttypename std::conditional<\n\t\t\t\t\tstd::is_const<T>::value,\n\t\t\t\t\ttypename std::remove_const<T>::type,\n\t\t\t\t\tdummy_span_class\n\t\t\t\t>::type\n\t\t>& sp) :\n\t\t\tbuf(sp.data()),\n\t\t\tbuf_size(sp.size())\n\t{}\n\n\t\/**\n\t * @brief get span size.\n\t * @return number of elements in the span.\n\t *\/\n\tsize_type size()const noexcept{\n\t\treturn this->buf_size;\n\t}\n\n\t\/**\n\t * @brief Check if span is empty.\n\t * @return true if the span is empty.\n\t * @return false if the span is not empty.\n\t *\/\n\tbool empty()const noexcept{\n\t\treturn this->size() == 0;\n\t}\n\n\t\/**\n\t * @brief get size of span in bytes.\n\t * @return size of array in bytes.\n\t *\/\n\tsize_type size_bytes()const noexcept{\n\t\treturn this->size() * sizeof(value_type);\n\t}\n\n\t\/**\n\t * @brief access specified element of the span.\n\t * Const version of operator[].\n\t * @param i - element index.\n\t * @return reference to i'th element of the span.\n\t *\/\n\tconst_reference operator[](size_type i)const noexcept{\n\t\tASSERT(i < this->size())\n\t\treturn this->buf[i];\n\t}\n\n\t\/**\n\t * @brief access specified element of the span.\n\t * @param i - element index.\n\t * @return reference to i'th element of the span.\n\t *\/\n\treference operator[](size_type i)noexcept{\n\t\tASSERT(i < this->size(), [&](auto&o){o << \"operator[](\" << i << \"): index out of bounds\";})\n\t\treturn this->buf[i];\n\t}\n\n\t\/**\n\t * @brief get iterator to first element of the span.\n\t * @return iterator to first element of the span.\n\t *\/\n\titerator begin()noexcept{\n\t\treturn this->buf;\n\t}\n\n\t\/**\n\t * @brief get iterator of the first element of the span.\n\t * @return iterator of the first element of the span.\n\t *\/\n\tconst_iterator begin()const noexcept{\n\t\treturn this->cbegin();\n\t}\n\n\t\/**\n\t * @brief get const iterator of the first element of the span.\n\t * @return const iterator of the first element of the span.\n\t *\/\n\tconst_iterator cbegin()const noexcept{\n\t\treturn this->buf;\n\t}\n\n\t\/**\n\t * @brief get iterator to \"after last\" element of the span.\n\t * @return iterator to \"after last\" element of the span.\n\t *\/\n\titerator end()noexcept{\n\t\treturn this->buf + this->buf_size;\n\t}\n\n\t\/**\n\t * @brief get const iterator to \"after last\" element of the span.\n\t * @return const iterator to \"after last\" element of the span.\n\t *\/\n\tconst_iterator end()const noexcept{\n\t\treturn this->cend();\n\t}\n\t\n\t\/**\n\t * @brief get const iterator to \"after last\" element of the span.\n\t * @return const iterator to \"after last\" element of the span.\n\t *\/\n\tconst_iterator cend()const noexcept{\n\t\treturn this->buf + this->buf_size;\n\t}\n\n\t\n\tconst_reverse_iterator crbegin()const noexcept{\n\t\treturn const_reverse_iterator(this->end());\n\t}\n\n\tconst_reverse_iterator crend()const noexcept{\n\t\treturn const_reverse_iterator(this->begin());\n\t}\n\t\n\treverse_iterator rbegin()noexcept{\n\t\treturn reverse_iterator(this->end());\n\t}\n\n\tconst_reverse_iterator rbegin()const noexcept{\n\t\treturn const_reverse_iterator(this->end());\n\t}\n\n\treverse_iterator rend()noexcept{\n\t\treturn reverse_iterator(this->begin());\n\t}\n\n\tconst_reverse_iterator rend()const noexcept{\n\t\treturn const_reverse_iterator(this->begin());\n\t}\n\t\n\tpointer data()noexcept{\n\t\treturn this->buf;\n\t}\n\n\tconst_pointer data()const noexcept{\n\t\treturn this->buf;\n\t}\n\n\tvalue_type& front()noexcept{\n\t\tASSERT(!this->empty())\n\t\treturn this->operator[](0);\n\t}\n\n\tconst value_type& front()const noexcept{\n\t\tASSERT(!this->empty())\n\t\treturn this->operator[](0);\n\t}\n\n\tvalue_type& back()noexcept{\n\t\tASSERT(!this->empty())\n\t\treturn this->operator[](this->size() - 1);\n\t}\n\n\tconst value_type& back()const noexcept{\n\t\tASSERT(!this->empty())\n\t\treturn this->operator[](this->size() - 1);\n\t}\n\n\tspan subspan(\n\t\t\tsize_type offset,\n\t\t\tsize_type count = std::numeric_limits<size_type>::max()\n\t\t)const noexcept\n\t{\n\t\tpointer new_p = offset > this->size() ? this->end() : this->data() + offset;\n\t\tASSERT(new_p <= this->end())\n\t\tsize_type max_new_s = this->end() - new_p;\n\t\tsize_type new_s = count > max_new_s ? max_new_s : count;\n\t\tASSERT(new_p + new_s <= this->end())\n\t\treturn span(new_p, new_s);\n\t}\n\n\t\/**\n\t * @brief Checks if pointer points somewhere within the span.\n\t * @param p - pointer to check.\n\t * @return true - if pointer passed as argument points somewhere within the span.\n\t * @return false otherwise.\n\t *\/\n\tbool overlaps(const_pointer p)const noexcept{\n\t\treturn this->begin() <= p && p <= (this->end() - 1);\n\t}\n\n\tfriend std::ostream& operator<<(std::ostream& s, const span<T>& buf){\n\t\tfor(auto& e : buf){\n\t\t\ts << e;\n\t\t}\n\t\treturn s;\n\t}\n};\n\ntemplate <class T> inline utki::span<T> make_span(std::nullptr_t){\n\treturn utki::span<T>(nullptr);\n}\n\ntemplate <class T> inline utki::span<T> make_span(T* buf, size_t size){\n\treturn utki::span<T>(buf, size);\n}\n\ntemplate <class T, std::size_t array_size> inline utki::span<T> make_span(std::array<T, array_size>& a){\n\treturn make_span(a.size() == 0 ? nullptr : a.data(), a.size());\n}\n\ntemplate <class T, std::size_t array_size> inline utki::span<const T> make_span(const std::array<T, array_size>& a){\n\treturn make_span(a.size() == 0 ? nullptr : a.data(), a.size());\n}\n\ntemplate <class T> inline utki::span<T> make_span(std::vector<T>& v){\n\treturn make_span(v.size() == 0 ? nullptr : v.data(), v.size());\n}\n\ntemplate <class T> inline utki::span<const T> make_span(const std::vector<T>& v){\n\treturn make_span(v.size() == 0 ? nullptr : v.data(), v.size());\n}\n\n\/**\n * @brief Make span representing contents of a basic_string.\n * @param s - string to make the span from.\n * @return span of the string contents.\n *\/\ntemplate <class T> inline utki::span<const T> make_span(const std::basic_string<T>& s){\n\treturn make_span(s.size() == 0 ? nullptr : s.data(), s.size());\n}\n\n\/**\n * @brief Make span from zero-terminated string.\n * @param str - zero-terminated string to make span from.\n * @return span representing contents of the string.\n *\/\ninline utki::span<const char> make_span(const char* str){\n\treturn make_span(str, strlen(str));\n}\n\n}\n<|endoftext|>"} {"text":"<commit_before><commit_msg>Make sure the output file is closed before committing<commit_after><|endoftext|>"} {"text":"<commit_before>\/\/ Copyright 2016 PDFium Authors. All rights reserved.\n\/\/ Use of this source code is governed by a BSD-style license that can be\n\/\/ found in the LICENSE file.\n\n\/\/ Original code copyright 2014 Foxit Software Inc. http:\/\/www.foxitsoftware.com\n\n#include \"core\/fpdfapi\/parser\/cpdf_object.h\"\n\n#include <algorithm>\n\n#include \"core\/fpdfapi\/parser\/cpdf_array.h\"\n#include \"core\/fpdfapi\/parser\/cpdf_dictionary.h\"\n#include \"core\/fpdfapi\/parser\/cpdf_indirect_object_holder.h\"\n#include \"core\/fpdfapi\/parser\/cpdf_parser.h\"\n#include \"core\/fpdfapi\/parser\/fpdf_parser_decode.h\"\n#include \"core\/fxcrt\/fx_string.h\"\n#include \"third_party\/base\/stl_util.h\"\n\nCPDF_Object::~CPDF_Object() {}\n\nCPDF_Object* CPDF_Object::GetDirect() const {\n return const_cast<CPDF_Object*>(this);\n}\n\nCPDF_Object* CPDF_Object::CloneObjectNonCyclic(bool bDirect) const {\n std::set<const CPDF_Object*> visited_objs;\n return CloneNonCyclic(bDirect, &visited_objs);\n}\n\nCPDF_Object* CPDF_Object::CloneDirectObject() const {\n return CloneObjectNonCyclic(true);\n}\n\nCPDF_Object* CPDF_Object::CloneNonCyclic(\n bool bDirect,\n std::set<const CPDF_Object*>* pVisited) const {\n return Clone();\n}\n\nvoid CPDF_Object::Release() {\n if (m_ObjNum)\n return;\n\n delete this;\n}\n\nCFX_ByteString CPDF_Object::GetString() const {\n return CFX_ByteString();\n}\n\nCFX_WideString CPDF_Object::GetUnicodeText() const {\n return CFX_WideString();\n}\n\nFX_FLOAT CPDF_Object::GetNumber() const {\n return 0;\n}\n\nint CPDF_Object::GetInteger() const {\n return 0;\n}\n\nCPDF_Dictionary* CPDF_Object::GetDict() const {\n return nullptr;\n}\n\nvoid CPDF_Object::SetString(const CFX_ByteString& str) {\n ASSERT(FALSE);\n}\n\nbool CPDF_Object::IsArray() const {\n return false;\n}\n\nbool CPDF_Object::IsBoolean() const {\n return false;\n}\n\nbool CPDF_Object::IsDictionary() const {\n return false;\n}\n\nbool CPDF_Object::IsName() const {\n return false;\n}\n\nbool CPDF_Object::IsNumber() const {\n return false;\n}\n\nbool CPDF_Object::IsReference() const {\n return false;\n}\n\nbool CPDF_Object::IsStream() const {\n return false;\n}\n\nbool CPDF_Object::IsString() const {\n return false;\n}\n\nCPDF_Array* CPDF_Object::AsArray() {\n return nullptr;\n}\n\nconst CPDF_Array* CPDF_Object::AsArray() const {\n return nullptr;\n}\n\nCPDF_Boolean* CPDF_Object::AsBoolean() {\n return nullptr;\n}\n\nconst CPDF_Boolean* CPDF_Object::AsBoolean() const {\n return nullptr;\n}\n\nCPDF_Dictionary* CPDF_Object::AsDictionary() {\n return nullptr;\n}\n\nconst CPDF_Dictionary* CPDF_Object::AsDictionary() const {\n return nullptr;\n}\n\nCPDF_Name* CPDF_Object::AsName() {\n return nullptr;\n}\n\nconst CPDF_Name* CPDF_Object::AsName() const {\n return nullptr;\n}\n\nCPDF_Number* CPDF_Object::AsNumber() {\n return nullptr;\n}\n\nconst CPDF_Number* CPDF_Object::AsNumber() const {\n return nullptr;\n}\n\nCPDF_Reference* CPDF_Object::AsReference() {\n return nullptr;\n}\n\nconst CPDF_Reference* CPDF_Object::AsReference() const {\n return nullptr;\n}\n\nCPDF_Stream* CPDF_Object::AsStream() {\n return nullptr;\n}\n\nconst CPDF_Stream* CPDF_Object::AsStream() const {\n return nullptr;\n}\n\nCPDF_String* CPDF_Object::AsString() {\n return nullptr;\n}\n\nconst CPDF_String* CPDF_Object::AsString() const {\n return nullptr;\n}\n<commit_msg>Re-enable CHECK() than only 0-numbered objects are released.<commit_after>\/\/ Copyright 2016 PDFium Authors. All rights reserved.\n\/\/ Use of this source code is governed by a BSD-style license that can be\n\/\/ found in the LICENSE file.\n\n\/\/ Original code copyright 2014 Foxit Software Inc. http:\/\/www.foxitsoftware.com\n\n#include \"core\/fpdfapi\/parser\/cpdf_object.h\"\n\n#include <algorithm>\n\n#include \"core\/fpdfapi\/parser\/cpdf_array.h\"\n#include \"core\/fpdfapi\/parser\/cpdf_dictionary.h\"\n#include \"core\/fpdfapi\/parser\/cpdf_indirect_object_holder.h\"\n#include \"core\/fpdfapi\/parser\/cpdf_parser.h\"\n#include \"core\/fpdfapi\/parser\/fpdf_parser_decode.h\"\n#include \"core\/fxcrt\/fx_string.h\"\n#include \"third_party\/base\/stl_util.h\"\n\nCPDF_Object::~CPDF_Object() {}\n\nCPDF_Object* CPDF_Object::GetDirect() const {\n return const_cast<CPDF_Object*>(this);\n}\n\nCPDF_Object* CPDF_Object::CloneObjectNonCyclic(bool bDirect) const {\n std::set<const CPDF_Object*> visited_objs;\n return CloneNonCyclic(bDirect, &visited_objs);\n}\n\nCPDF_Object* CPDF_Object::CloneDirectObject() const {\n return CloneObjectNonCyclic(true);\n}\n\nCPDF_Object* CPDF_Object::CloneNonCyclic(\n bool bDirect,\n std::set<const CPDF_Object*>* pVisited) const {\n return Clone();\n}\n\nvoid CPDF_Object::Release() {\n CHECK(!m_ObjNum);\n delete this;\n}\n\nCFX_ByteString CPDF_Object::GetString() const {\n return CFX_ByteString();\n}\n\nCFX_WideString CPDF_Object::GetUnicodeText() const {\n return CFX_WideString();\n}\n\nFX_FLOAT CPDF_Object::GetNumber() const {\n return 0;\n}\n\nint CPDF_Object::GetInteger() const {\n return 0;\n}\n\nCPDF_Dictionary* CPDF_Object::GetDict() const {\n return nullptr;\n}\n\nvoid CPDF_Object::SetString(const CFX_ByteString& str) {\n ASSERT(FALSE);\n}\n\nbool CPDF_Object::IsArray() const {\n return false;\n}\n\nbool CPDF_Object::IsBoolean() const {\n return false;\n}\n\nbool CPDF_Object::IsDictionary() const {\n return false;\n}\n\nbool CPDF_Object::IsName() const {\n return false;\n}\n\nbool CPDF_Object::IsNumber() const {\n return false;\n}\n\nbool CPDF_Object::IsReference() const {\n return false;\n}\n\nbool CPDF_Object::IsStream() const {\n return false;\n}\n\nbool CPDF_Object::IsString() const {\n return false;\n}\n\nCPDF_Array* CPDF_Object::AsArray() {\n return nullptr;\n}\n\nconst CPDF_Array* CPDF_Object::AsArray() const {\n return nullptr;\n}\n\nCPDF_Boolean* CPDF_Object::AsBoolean() {\n return nullptr;\n}\n\nconst CPDF_Boolean* CPDF_Object::AsBoolean() const {\n return nullptr;\n}\n\nCPDF_Dictionary* CPDF_Object::AsDictionary() {\n return nullptr;\n}\n\nconst CPDF_Dictionary* CPDF_Object::AsDictionary() const {\n return nullptr;\n}\n\nCPDF_Name* CPDF_Object::AsName() {\n return nullptr;\n}\n\nconst CPDF_Name* CPDF_Object::AsName() const {\n return nullptr;\n}\n\nCPDF_Number* CPDF_Object::AsNumber() {\n return nullptr;\n}\n\nconst CPDF_Number* CPDF_Object::AsNumber() const {\n return nullptr;\n}\n\nCPDF_Reference* CPDF_Object::AsReference() {\n return nullptr;\n}\n\nconst CPDF_Reference* CPDF_Object::AsReference() const {\n return nullptr;\n}\n\nCPDF_Stream* CPDF_Object::AsStream() {\n return nullptr;\n}\n\nconst CPDF_Stream* CPDF_Object::AsStream() const {\n return nullptr;\n}\n\nCPDF_String* CPDF_Object::AsString() {\n return nullptr;\n}\n\nconst CPDF_String* CPDF_Object::AsString() const {\n return nullptr;\n}\n<|endoftext|>"} {"text":"<commit_before>\/*\n This file is part of Magnum.\n\n Original authors — credit is appreciated but not required:\n\n 2010, 2011, 2012, 2013, 2014, 2015, 2016, 2017, 2018, 2019 —\n Vladimír Vondruš <mosra@centrum.cz>\n 2020 — Nghia Truong <nghiatruong.vn@gmail.com>\n\n This is free and unencumbered software released into the public domain.\n\n Anyone is free to copy, modify, publish, use, compile, sell, or distribute\n this software, either in source code form or as a compiled binary, for any\n purpose, commercial or non-commercial, and by any means.\n\n In jurisdictions that recognize copyright laws, the author or authors of\n this software dedicate any and all copyright interest in the software to\n the public domain. We make this dedication for the benefit of the public\n at large and to the detriment of our heirs and successors. We intend this\n dedication to be an overt act of relinquishment in perpetuity of all\n present and future rights to this software under copyright law.\n\n THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\n IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\n FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL\n THE AUTHORS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER\n IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN\n CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.\n *\/\n\n#include <Corrade\/Containers\/Array.h>\n#include <Corrade\/Containers\/Pointer.h>\n#include <Magnum\/Mesh.h>\n#include <Magnum\/GL\/Buffer.h>\n#include <Magnum\/GL\/DefaultFramebuffer.h>\n#include <Magnum\/GL\/Mesh.h>\n#include <Magnum\/GL\/Renderer.h>\n#include <Magnum\/Math\/Color.h>\n#include <Magnum\/Math\/Matrix4.h>\n#include <Magnum\/MeshTools\/Interleave.h>\n#include <Magnum\/Platform\/Sdl2Application.h>\n#include <Magnum\/SceneGraph\/Camera.h>\n#include <Magnum\/SceneGraph\/Drawable.h>\n#include <Magnum\/SceneGraph\/MatrixTransformation3D.h>\n#include <Magnum\/SceneGraph\/Object.h>\n#include <Magnum\/SceneGraph\/Scene.h>\n#include <Magnum\/Shaders\/VertexColor.h>\n\n#include \"ArcBall.h\"\n#include \"ArcBallCamera.h\"\n\nnamespace Magnum { namespace Examples {\n\nusing Object3D = SceneGraph::Object<SceneGraph::MatrixTransformation3D>;\nusing Scene3D = SceneGraph::Scene<SceneGraph::MatrixTransformation3D>;\n\nusing namespace Math::Literals;\n\nclass ArcBallExample: public Platform::Application {\n public:\n explicit ArcBallExample(const Arguments& arguments);\n\n private:\n void drawEvent() override;\n void viewportEvent(ViewportEvent& event) override;\n void keyPressEvent(KeyEvent& event) override;\n void mousePressEvent(MouseEvent& event) override;\n void mouseMoveEvent(MouseMoveEvent& event) override;\n void mouseScrollEvent(MouseScrollEvent& event) override;\n\n Scene3D _scene;\n SceneGraph::DrawableGroup3D _drawables;\n GL::Mesh _mesh{NoCreate};\n Shaders::VertexColor3D _shader{NoCreate};\n Containers::Pointer<ArcBallCamera> _arcballCamera;\n};\n\nclass VertexColorDrawable: public SceneGraph::Drawable3D {\n public:\n explicit VertexColorDrawable(Object3D& object,\n Shaders::VertexColor3D& shader, GL::Mesh& mesh,\n SceneGraph::DrawableGroup3D& drawables):\n SceneGraph::Drawable3D{object, &drawables},\n _shader(shader), _mesh(mesh) {}\n\n void draw(const Matrix4& transformation, SceneGraph::Camera3D& camera) {\n _shader.setTransformationProjectionMatrix(\n camera.projectionMatrix()*transformation);\n _mesh.draw(_shader);\n }\n\n private:\n Shaders::VertexColor3D& _shader;\n GL::Mesh& _mesh;\n};\n\nArcBallExample::ArcBallExample(const Arguments& arguments) :\n Platform::Application{arguments, NoCreate}\n{\n \/* Setup window *\/\n {\n const Vector2 dpiScaling = this->dpiScaling({});\n Configuration conf;\n conf.setTitle(\"Magnum ArcBall Camera Example\")\n .setSize(conf.size(), dpiScaling)\n .setWindowFlags(Configuration::WindowFlag::Resizable);\n GLConfiguration glConf;\n glConf.setSampleCount(dpiScaling.max() < 2.0f ? 8 : 2);\n if(!tryCreate(conf, glConf)) {\n create(conf, glConf.setSampleCount(0));\n }\n\n SDL_CaptureMouse(SDL_TRUE);\n }\n\n GL::Renderer::enable(GL::Renderer::Feature::DepthTest);\n GL::Renderer::enable(GL::Renderer::Feature::FaceCulling);\n\n \/* Setup the cube with vertex color *\/\n {\n const Containers::Array<Vector3> cubePositions{Containers::InPlaceInit, {\n \/* front *\/\n {-1.0f, -1.0f, 1.0f},\n { 1.0f, -1.0f, 1.0f},\n { 1.0f, 1.0f, 1.0f},\n {-1.0f, 1.0f, 1.0f},\n \/* back *\/\n {-1.0f, -1.0f, -1.0f},\n { 1.0f, -1.0f, -1.0f},\n { 1.0f, 1.0f, -1.0f},\n {-1.0f, 1.0f, -1.0f}\n }};\n\n const Containers::Array<Color3> cubeColors{Containers::InPlaceInit, {\n \/* front colors *\/\n 0x00ffff_rgbf,\n 0x0000ff_rgbf,\n 0x000000_rgbf,\n 0x00ff00_rgbf,\n \/* back colors *\/\n 0xffff00_rgbf,\n 0xffffff_rgbf,\n 0xff00ff_rgbf,\n 0xff0000_rgbf,\n }};\n\n const Containers::Array<char> cubeIndices{Containers::InPlaceInit, {\n \/* front *\/\n 0, 1, 2, 2, 3, 0,\n \/* right *\/\n 1, 5, 6, 6, 2, 1,\n \/* back *\/\n 7, 6, 5, 5, 4, 7,\n \/* left *\/\n 4, 0, 3, 3, 7, 4,\n \/* bottom *\/\n 4, 5, 1, 1, 0, 4,\n \/* top *\/\n 3, 2, 6, 6, 7, 3\n }};\n\n GL::Buffer vertexBuffer;\n GL::Buffer indexBuffer;\n vertexBuffer.setData(MeshTools::interleave(cubePositions, cubeColors));\n indexBuffer.setData(cubeIndices);\n\n _mesh = GL::Mesh{};\n _mesh.setCount(cubeIndices.size())\n .addVertexBuffer(std::move(vertexBuffer), 0,\n Shaders::VertexColor3D::Position{},\n Shaders::VertexColor3D::Color3{})\n .setIndexBuffer(std::move(indexBuffer), 0, MeshIndexType::UnsignedByte);\n\n _shader = Shaders::VertexColor3D{};\n new VertexColorDrawable{*(new Object3D{ &_scene }), _shader, _mesh, _drawables};\n }\n\n \/* Set up the camera *\/\n {\n \/* Setup the arcball after the camera objects *\/\n const Vector3 eye = Vector3::zAxis(-10.0f);\n const Vector3 center{};\n const Vector3 up = Vector3::yAxis();\n _arcballCamera.emplace(_scene, eye, center, up, 45.0_degf,\n windowSize(), framebufferSize());\n }\n\n \/* Start the timer, loop at 60 Hz max *\/\n setSwapInterval(1);\n setMinimalLoopPeriod(16);\n}\n\nvoid ArcBallExample::drawEvent() {\n GL::defaultFramebuffer.clear(\n GL::FramebufferClear::Color|GL::FramebufferClear::Depth);\n\n \/* Call arcball update in every frame. This will do nothing if the camera\n has not been changed. Otherwise, camera transformation will be\n propagated into the camera objects. *\/\n\n bool camChanged = _arcballCamera->update();\n _arcballCamera->draw(_drawables);\n swapBuffers();\n\n if(camChanged) redraw();\n}\n\nvoid ArcBallExample::viewportEvent(ViewportEvent& event) {\n GL::defaultFramebuffer.setViewport({{}, event.framebufferSize()});\n\n _arcballCamera->reshape(event.windowSize(), event.framebufferSize());\n}\n\nvoid ArcBallExample::keyPressEvent(KeyEvent& event) {\n switch(event.key()) {\n case KeyEvent::Key::Plus:\n case KeyEvent::Key::NumAdd:\n _arcballCamera->zoom(1.0f);\n break;\n case KeyEvent::Key::Minus:\n case KeyEvent::Key::NumSubtract:\n _arcballCamera->zoom(-1.0f);\n break;\n case KeyEvent::Key::Left:\n _arcballCamera->translateDelta(Vector2::xAxis(-0.1f));\n break;\n case KeyEvent::Key::Right:\n _arcballCamera->translateDelta(Vector2::xAxis(0.1f));\n break;\n case KeyEvent::Key::Up:\n _arcballCamera->translateDelta(Vector2::yAxis(0.1f));\n break;\n case KeyEvent::Key::Down:\n _arcballCamera->translateDelta(Vector2::yAxis(-0.1f));\n break;\n\n case KeyEvent::Key::L:\n _arcballCamera->setLagging(_arcballCamera->lagging() > 0.0f ?\n 0.0f : 0.85f);\n break;\n case KeyEvent::Key::R:\n _arcballCamera->reset();\n break;\n\n default: return;\n }\n\n event.setAccepted();\n redraw(); \/* camera has changed, redraw! *\/\n}\n\nvoid ArcBallExample::mousePressEvent(MouseEvent& event) {\n if(event.button() != MouseEvent::Button::Left &&\n event.button() != MouseEvent::Button::Right) return;\n\n _arcballCamera->initTransformation(event.position());\n\n event.setAccepted();\n redraw(); \/* camera has changed, redraw! *\/\n}\n\nvoid ArcBallExample::mouseMoveEvent(MouseMoveEvent& event) {\n if(event.buttons() & MouseMoveEvent::Button::Left)\n _arcballCamera->rotate(event.position());\n else if(event.buttons() & MouseMoveEvent::Button::Right)\n _arcballCamera->translate(event.position());\n else return;\n\n event.setAccepted();\n redraw(); \/* camera has changed, redraw! *\/\n}\n\nvoid ArcBallExample::mouseScrollEvent(MouseScrollEvent& event) {\n const Float delta = event.offset().y();\n if(Math::abs(delta) < 1.0e-2f) return;\n\n _arcballCamera->zoom(delta);\n\n event.setAccepted();\n redraw(); \/* camera has changed, redraw! *\/\n}\n\n}}\n\nMAGNUM_APPLICATION_MAIN(Magnum::Examples::ArcBallExample)\n<commit_msg>arcball: directly interleave the cube data w\/o any allocations.<commit_after>\/*\n This file is part of Magnum.\n\n Original authors — credit is appreciated but not required:\n\n 2010, 2011, 2012, 2013, 2014, 2015, 2016, 2017, 2018, 2019 —\n Vladimír Vondruš <mosra@centrum.cz>\n 2020 — Nghia Truong <nghiatruong.vn@gmail.com>\n\n This is free and unencumbered software released into the public domain.\n\n Anyone is free to copy, modify, publish, use, compile, sell, or distribute\n this software, either in source code form or as a compiled binary, for any\n purpose, commercial or non-commercial, and by any means.\n\n In jurisdictions that recognize copyright laws, the author or authors of\n this software dedicate any and all copyright interest in the software to\n the public domain. We make this dedication for the benefit of the public\n at large and to the detriment of our heirs and successors. We intend this\n dedication to be an overt act of relinquishment in perpetuity of all\n present and future rights to this software under copyright law.\n\n THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\n IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\n FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL\n THE AUTHORS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER\n IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN\n CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.\n *\/\n\n#include <Corrade\/Containers\/Pointer.h>\n#include <Magnum\/Mesh.h>\n#include <Magnum\/GL\/Buffer.h>\n#include <Magnum\/GL\/DefaultFramebuffer.h>\n#include <Magnum\/GL\/Mesh.h>\n#include <Magnum\/GL\/Renderer.h>\n#include <Magnum\/Math\/Color.h>\n#include <Magnum\/Math\/Matrix4.h>\n#include <Magnum\/Platform\/Sdl2Application.h>\n#include <Magnum\/SceneGraph\/Camera.h>\n#include <Magnum\/SceneGraph\/Drawable.h>\n#include <Magnum\/SceneGraph\/MatrixTransformation3D.h>\n#include <Magnum\/SceneGraph\/Object.h>\n#include <Magnum\/SceneGraph\/Scene.h>\n#include <Magnum\/Shaders\/VertexColor.h>\n\n#include \"ArcBall.h\"\n#include \"ArcBallCamera.h\"\n\nnamespace Magnum { namespace Examples {\n\nusing Object3D = SceneGraph::Object<SceneGraph::MatrixTransformation3D>;\nusing Scene3D = SceneGraph::Scene<SceneGraph::MatrixTransformation3D>;\n\nusing namespace Math::Literals;\n\nclass ArcBallExample: public Platform::Application {\n public:\n explicit ArcBallExample(const Arguments& arguments);\n\n private:\n void drawEvent() override;\n void viewportEvent(ViewportEvent& event) override;\n void keyPressEvent(KeyEvent& event) override;\n void mousePressEvent(MouseEvent& event) override;\n void mouseMoveEvent(MouseMoveEvent& event) override;\n void mouseScrollEvent(MouseScrollEvent& event) override;\n\n Scene3D _scene;\n SceneGraph::DrawableGroup3D _drawables;\n GL::Mesh _mesh{NoCreate};\n Shaders::VertexColor3D _shader{NoCreate};\n Containers::Pointer<ArcBallCamera> _arcballCamera;\n};\n\nclass VertexColorDrawable: public SceneGraph::Drawable3D {\n public:\n explicit VertexColorDrawable(Object3D& object,\n Shaders::VertexColor3D& shader, GL::Mesh& mesh,\n SceneGraph::DrawableGroup3D& drawables):\n SceneGraph::Drawable3D{object, &drawables},\n _shader(shader), _mesh(mesh) {}\n\n void draw(const Matrix4& transformation, SceneGraph::Camera3D& camera) {\n _shader.setTransformationProjectionMatrix(\n camera.projectionMatrix()*transformation);\n _mesh.draw(_shader);\n }\n\n private:\n Shaders::VertexColor3D& _shader;\n GL::Mesh& _mesh;\n};\n\nArcBallExample::ArcBallExample(const Arguments& arguments) :\n Platform::Application{arguments, NoCreate}\n{\n \/* Setup window *\/\n {\n const Vector2 dpiScaling = this->dpiScaling({});\n Configuration conf;\n conf.setTitle(\"Magnum ArcBall Camera Example\")\n .setSize(conf.size(), dpiScaling)\n .setWindowFlags(Configuration::WindowFlag::Resizable);\n GLConfiguration glConf;\n glConf.setSampleCount(dpiScaling.max() < 2.0f ? 8 : 2);\n if(!tryCreate(conf, glConf)) {\n create(conf, glConf.setSampleCount(0));\n }\n\n SDL_CaptureMouse(SDL_TRUE);\n }\n\n GL::Renderer::enable(GL::Renderer::Feature::DepthTest);\n GL::Renderer::enable(GL::Renderer::Feature::FaceCulling);\n\n \/* Setup the cube with vertex color *\/\n {\n const struct {\n Vector3 position;\n Color3 color;\n } cubeVertices[] {\n \/* front *\/\n {{-1.0f, -1.0f, 1.0f}, 0xffff00_rgbf},\n {{ 1.0f, -1.0f, 1.0f}, 0x0000ff_rgbf},\n {{ 1.0f, 1.0f, 1.0f}, 0x000000_rgbf},\n {{-1.0f, 1.0f, 1.0f}, 0x00ff00_rgbf},\n\n \/* back *\/\n {{-1.0f, -1.0f, -1.0f}, 0xffff00_rgbf},\n {{ 1.0f, -1.0f, -1.0f}, 0xffffff_rgbf},\n {{ 1.0f, 1.0f, -1.0f}, 0xff00ff_rgbf},\n {{-1.0f, 1.0f, -1.0f}, 0xff0000_rgbf}\n };\n\n UnsignedByte cubeIndices[]{\n \/* front *\/\n 0, 1, 2, 2, 3, 0,\n \/* right *\/\n 1, 5, 6, 6, 2, 1,\n \/* back *\/\n 7, 6, 5, 5, 4, 7,\n \/* left *\/\n 4, 0, 3, 3, 7, 4,\n \/* bottom *\/\n 4, 5, 1, 1, 0, 4,\n \/* top *\/\n 3, 2, 6, 6, 7, 3\n };\n\n _mesh = GL::Mesh{};\n _mesh.setCount(Containers::arraySize(cubeIndices))\n .addVertexBuffer(GL::Buffer{cubeVertices}, 0,\n Shaders::VertexColor3D::Position{},\n Shaders::VertexColor3D::Color3{})\n .setIndexBuffer(GL::Buffer{cubeIndices}, 0, MeshIndexType::UnsignedByte);\n\n _shader = Shaders::VertexColor3D{};\n new VertexColorDrawable{*(new Object3D{ &_scene }), _shader, _mesh, _drawables};\n }\n\n \/* Set up the camera *\/\n {\n \/* Setup the arcball after the camera objects *\/\n const Vector3 eye = Vector3::zAxis(-10.0f);\n const Vector3 center{};\n const Vector3 up = Vector3::yAxis();\n _arcballCamera.emplace(_scene, eye, center, up, 45.0_degf,\n windowSize(), framebufferSize());\n }\n\n \/* Start the timer, loop at 60 Hz max *\/\n setSwapInterval(1);\n setMinimalLoopPeriod(16);\n}\n\nvoid ArcBallExample::drawEvent() {\n GL::defaultFramebuffer.clear(\n GL::FramebufferClear::Color|GL::FramebufferClear::Depth);\n\n \/* Call arcball update in every frame. This will do nothing if the camera\n has not been changed. Otherwise, camera transformation will be\n propagated into the camera objects. *\/\n\n bool camChanged = _arcballCamera->update();\n _arcballCamera->draw(_drawables);\n swapBuffers();\n\n if(camChanged) redraw();\n}\n\nvoid ArcBallExample::viewportEvent(ViewportEvent& event) {\n GL::defaultFramebuffer.setViewport({{}, event.framebufferSize()});\n\n _arcballCamera->reshape(event.windowSize(), event.framebufferSize());\n}\n\nvoid ArcBallExample::keyPressEvent(KeyEvent& event) {\n switch(event.key()) {\n case KeyEvent::Key::Plus:\n case KeyEvent::Key::NumAdd:\n _arcballCamera->zoom(1.0f);\n break;\n case KeyEvent::Key::Minus:\n case KeyEvent::Key::NumSubtract:\n _arcballCamera->zoom(-1.0f);\n break;\n case KeyEvent::Key::Left:\n _arcballCamera->translateDelta(Vector2::xAxis(-0.1f));\n break;\n case KeyEvent::Key::Right:\n _arcballCamera->translateDelta(Vector2::xAxis(0.1f));\n break;\n case KeyEvent::Key::Up:\n _arcballCamera->translateDelta(Vector2::yAxis(0.1f));\n break;\n case KeyEvent::Key::Down:\n _arcballCamera->translateDelta(Vector2::yAxis(-0.1f));\n break;\n\n case KeyEvent::Key::L:\n _arcballCamera->setLagging(_arcballCamera->lagging() > 0.0f ?\n 0.0f : 0.85f);\n break;\n case KeyEvent::Key::R:\n _arcballCamera->reset();\n break;\n\n default: return;\n }\n\n event.setAccepted();\n redraw(); \/* camera has changed, redraw! *\/\n}\n\nvoid ArcBallExample::mousePressEvent(MouseEvent& event) {\n if(event.button() != MouseEvent::Button::Left &&\n event.button() != MouseEvent::Button::Right) return;\n\n _arcballCamera->initTransformation(event.position());\n\n event.setAccepted();\n redraw(); \/* camera has changed, redraw! *\/\n}\n\nvoid ArcBallExample::mouseMoveEvent(MouseMoveEvent& event) {\n if(event.buttons() & MouseMoveEvent::Button::Left)\n _arcballCamera->rotate(event.position());\n else if(event.buttons() & MouseMoveEvent::Button::Right)\n _arcballCamera->translate(event.position());\n else return;\n\n event.setAccepted();\n redraw(); \/* camera has changed, redraw! *\/\n}\n\nvoid ArcBallExample::mouseScrollEvent(MouseScrollEvent& event) {\n const Float delta = event.offset().y();\n if(Math::abs(delta) < 1.0e-2f) return;\n\n _arcballCamera->zoom(delta);\n\n event.setAccepted();\n redraw(); \/* camera has changed, redraw! *\/\n}\n\n}}\n\nMAGNUM_APPLICATION_MAIN(Magnum::Examples::ArcBallExample)\n<|endoftext|>"} {"text":"<commit_before>\/*\n * Copyright (c) 2003-2005 The Regents of The University of Michigan\n * All rights reserved.\n *\n * Redistribution and use in source and binary forms, with or without\n * modification, are permitted provided that the following conditions are\n * met: redistributions of source code must retain the above copyright\n * notice, this list of conditions and the following disclaimer;\n * redistributions in binary form must reproduce the above copyright\n * notice, this list of conditions and the following disclaimer in the\n * documentation and\/or other materials provided with the distribution;\n * neither the name of the copyright holders nor the names of its\n * contributors may be used to endorse or promote products derived from\n * this software without specific prior written permission.\n *\n * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS\n * \"AS IS\" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT\n * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR\n * A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT\n * OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,\n * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT\n * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,\n * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY\n * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT\n * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE\n * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.\n *\n * Authors: Gabe Black\n * Ali Saidi\n *\/\n\n#include \"arch\/sparc\/floatregfile.hh\"\n#include \"base\/trace.hh\"\n#include \"sim\/byteswap.hh\"\n#include \"sim\/serialize.hh\"\n\nusing namespace SparcISA;\nusing namespace std;\n\nclass Checkpoint;\n\nstring SparcISA::getFloatRegName(RegIndex index)\n{\n static std::string floatRegName[NumFloatRegs] =\n {\"f0\", \"f1\", \"f2\", \"f3\", \"f4\", \"f5\", \"f6\", \"f7\",\n \"f8\", \"f9\", \"f10\", \"f11\", \"f12\", \"f13\", \"f14\", \"f15\",\n \"f16\", \"f17\", \"f18\", \"f19\", \"f20\", \"f21\", \"f22\", \"f23\",\n \"f24\", \"f25\", \"f26\", \"f27\", \"f28\", \"f29\", \"f30\", \"f31\",\n \"f32\", \"f33\", \"f34\", \"f35\", \"f36\", \"f37\", \"f38\", \"f39\",\n \"f40\", \"f41\", \"f42\", \"f43\", \"f44\", \"f45\", \"f46\", \"f47\",\n \"f48\", \"f49\", \"f50\", \"f51\", \"f52\", \"f53\", \"f54\", \"f55\",\n \"f56\", \"f57\", \"f58\", \"f59\", \"f60\", \"f61\", \"f62\", \"f63\"};\n return floatRegName[index];\n}\n\nvoid FloatRegFile::clear()\n{\n bzero(regSpace, sizeof(regSpace));\n}\n\nFloatReg FloatRegFile::readReg(int floatReg, int width)\n{\n \/\/In each of these cases, we have to copy the value into a temporary\n \/\/variable. This is because we may otherwise try to access an\n \/\/unaligned portion of memory.\n switch(width)\n {\n case SingleWidth:\n float32_t result32;\n memcpy(&result32, regSpace + 4 * floatReg, sizeof(result32));\n return htog(result32);\n case DoubleWidth:\n float64_t result64;\n memcpy(&result64, regSpace + 4 * floatReg, sizeof(result64));\n return htog(result64);\n case QuadWidth:\n float128_t result128;\n memcpy(&result128, regSpace + 4 * floatReg, sizeof(result128));\n return htog(result128);\n default:\n panic(\"Attempted to read a %d bit floating point register!\", width);\n }\n}\n\nFloatRegBits FloatRegFile::readRegBits(int floatReg, int width)\n{\n \/\/In each of these cases, we have to copy the value into a temporary\n \/\/variable. This is because we may otherwise try to access an\n \/\/unaligned portion of memory.\n switch(width)\n {\n case SingleWidth:\n uint32_t result32;\n memcpy(&result32, regSpace + 4 * floatReg, sizeof(result32));\n return htog(result32);\n case DoubleWidth:\n uint64_t result64;\n memcpy(&result64, regSpace + 4 * floatReg, sizeof(result64));\n return htog(result64);\n case QuadWidth:\n uint64_t result128;\n memcpy(&result128, regSpace + 4 * floatReg, sizeof(result128));\n return htog(result128);\n default:\n panic(\"Attempted to read a %d bit floating point register!\", width);\n }\n}\n\nFault FloatRegFile::setReg(int floatReg, const FloatReg &val, int width)\n{\n \/\/In each of these cases, we have to copy the value into a temporary\n \/\/variable. This is because we may otherwise try to access an\n \/\/unaligned portion of memory.\n\n uint32_t result32;\n uint64_t result64;\n DPRINTF(Sparc, \"Setting floating point register %d\\n\", floatReg);\n switch(width)\n {\n case SingleWidth:\n result32 = gtoh((uint32_t)val);\n memcpy(regSpace + 4 * floatReg, &result32, sizeof(result32));\n break;\n case DoubleWidth:\n result64 = gtoh((uint64_t)val);\n memcpy(regSpace + 4 * floatReg, &result64, sizeof(result64));\n break;\n case QuadWidth:\n panic(\"Quad width FP not implemented.\");\n break;\n default:\n panic(\"Attempted to read a %d bit floating point register!\", width);\n }\n return NoFault;\n}\n\nFault FloatRegFile::setRegBits(int floatReg, const FloatRegBits &val, int width)\n{\n \/\/In each of these cases, we have to copy the value into a temporary\n \/\/variable. This is because we may otherwise try to access an\n \/\/unaligned portion of memory.\n uint32_t result32;\n uint64_t result64;\n switch(width)\n {\n case SingleWidth:\n result32 = gtoh((uint32_t)val);\n memcpy(regSpace + 4 * floatReg, &result32, sizeof(result32));\n break;\n case DoubleWidth:\n result64 = gtoh((uint64_t)val);\n memcpy(regSpace + 4 * floatReg, &result64, sizeof(result64));\n break;\n case QuadWidth:\n panic(\"Quad width FP not implemented.\");\n break;\n default:\n panic(\"Attempted to read a %d bit floating point register!\", width);\n }\n return NoFault;\n}\n\nvoid FloatRegFile::serialize(std::ostream &os)\n{\n SERIALIZE_ARRAY((unsigned char *)regSpace,\n SingleWidth \/ 8 * NumFloatRegs);\n}\n\nvoid FloatRegFile::unserialize(Checkpoint *cp, const std::string §ion)\n{\n UNSERIALIZE_ARRAY((unsigned char *)regSpace,\n SingleWidth \/ 8 * NumFloatRegs);\n}\n\n<commit_msg>Fiddled with the floating point accessors.<commit_after>\/*\n * Copyright (c) 2003-2005 The Regents of The University of Michigan\n * All rights reserved.\n *\n * Redistribution and use in source and binary forms, with or without\n * modification, are permitted provided that the following conditions are\n * met: redistributions of source code must retain the above copyright\n * notice, this list of conditions and the following disclaimer;\n * redistributions in binary form must reproduce the above copyright\n * notice, this list of conditions and the following disclaimer in the\n * documentation and\/or other materials provided with the distribution;\n * neither the name of the copyright holders nor the names of its\n * contributors may be used to endorse or promote products derived from\n * this software without specific prior written permission.\n *\n * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS\n * \"AS IS\" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT\n * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR\n * A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT\n * OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,\n * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT\n * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,\n * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY\n * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT\n * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE\n * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.\n *\n * Authors: Gabe Black\n * Ali Saidi\n *\/\n\n#include \"arch\/sparc\/floatregfile.hh\"\n#include \"base\/trace.hh\"\n#include \"sim\/byteswap.hh\"\n#include \"sim\/serialize.hh\"\n\nusing namespace SparcISA;\nusing namespace std;\n\nclass Checkpoint;\n\nstring SparcISA::getFloatRegName(RegIndex index)\n{\n static std::string floatRegName[NumFloatRegs] =\n {\"f0\", \"f1\", \"f2\", \"f3\", \"f4\", \"f5\", \"f6\", \"f7\",\n \"f8\", \"f9\", \"f10\", \"f11\", \"f12\", \"f13\", \"f14\", \"f15\",\n \"f16\", \"f17\", \"f18\", \"f19\", \"f20\", \"f21\", \"f22\", \"f23\",\n \"f24\", \"f25\", \"f26\", \"f27\", \"f28\", \"f29\", \"f30\", \"f31\",\n \"f32\", \"f33\", \"f34\", \"f35\", \"f36\", \"f37\", \"f38\", \"f39\",\n \"f40\", \"f41\", \"f42\", \"f43\", \"f44\", \"f45\", \"f46\", \"f47\",\n \"f48\", \"f49\", \"f50\", \"f51\", \"f52\", \"f53\", \"f54\", \"f55\",\n \"f56\", \"f57\", \"f58\", \"f59\", \"f60\", \"f61\", \"f62\", \"f63\"};\n return floatRegName[index];\n}\n\nvoid FloatRegFile::clear()\n{\n bzero(regSpace, sizeof(regSpace));\n}\n\nFloatReg FloatRegFile::readReg(int floatReg, int width)\n{\n \/\/In each of these cases, we have to copy the value into a temporary\n \/\/variable. This is because we may otherwise try to access an\n \/\/unaligned portion of memory.\n FloatReg result;\n switch(width)\n {\n case SingleWidth:\n float32_t result32;\n memcpy(&result32, regSpace + 4 * floatReg, sizeof(result32));\n result = htog(result32);\n break;\n case DoubleWidth:\n float64_t result64;\n memcpy(&result64, regSpace + 4 * floatReg, sizeof(result64));\n result = htog(result64);\n break;\n case QuadWidth:\n float128_t result128;\n memcpy(&result128, regSpace + 4 * floatReg, sizeof(result128));\n result = htog(result128);\n break;\n default:\n panic(\"Attempted to read a %d bit floating point register!\", width);\n }\n return result;\n}\n\nFloatRegBits FloatRegFile::readRegBits(int floatReg, int width)\n{\n \/\/In each of these cases, we have to copy the value into a temporary\n \/\/variable. This is because we may otherwise try to access an\n \/\/unaligned portion of memory.\n FloatRegBits result;\n switch(width)\n {\n case SingleWidth:\n uint32_t result32;\n memcpy(&result32, regSpace + 4 * floatReg, sizeof(result32));\n result = htog(result32);\n break;\n case DoubleWidth:\n uint64_t result64;\n memcpy(&result64, regSpace + 4 * floatReg, sizeof(result64));\n result = htog(result64);\n break;\n case QuadWidth:\n uint64_t result128;\n memcpy(&result128, regSpace + 4 * floatReg, sizeof(result128));\n result = htog(result128);\n break;\n default:\n panic(\"Attempted to read a %d bit floating point register!\", width);\n }\n return result;\n}\n\nFault FloatRegFile::setReg(int floatReg, const FloatReg &val, int width)\n{\n \/\/In each of these cases, we have to copy the value into a temporary\n \/\/variable. This is because we may otherwise try to access an\n \/\/unaligned portion of memory.\n\n uint32_t result32;\n uint64_t result64;\n switch(width)\n {\n case SingleWidth:\n result32 = gtoh((uint32_t)val);\n memcpy(regSpace + 4 * floatReg, &result32, sizeof(result32));\n break;\n case DoubleWidth:\n result64 = gtoh((uint64_t)val);\n memcpy(regSpace + 4 * floatReg, &result64, sizeof(result64));\n break;\n case QuadWidth:\n panic(\"Quad width FP not implemented.\");\n break;\n default:\n panic(\"Attempted to read a %d bit floating point register!\", width);\n }\n return NoFault;\n}\n\nFault FloatRegFile::setRegBits(int floatReg, const FloatRegBits &val, int width)\n{\n \/\/In each of these cases, we have to copy the value into a temporary\n \/\/variable. This is because we may otherwise try to access an\n \/\/unaligned portion of memory.\n uint32_t result32;\n uint64_t result64;\n switch(width)\n {\n case SingleWidth:\n result32 = gtoh((uint32_t)val);\n memcpy(regSpace + 4 * floatReg, &result32, sizeof(result32));\n break;\n case DoubleWidth:\n result64 = gtoh((uint64_t)val);\n memcpy(regSpace + 4 * floatReg, &result64, sizeof(result64));\n break;\n case QuadWidth:\n panic(\"Quad width FP not implemented.\");\n break;\n default:\n panic(\"Attempted to read a %d bit floating point register!\", width);\n }\n return NoFault;\n}\n\nvoid FloatRegFile::serialize(std::ostream &os)\n{\n SERIALIZE_ARRAY((unsigned char *)regSpace,\n SingleWidth \/ 8 * NumFloatRegs);\n}\n\nvoid FloatRegFile::unserialize(Checkpoint *cp, const std::string §ion)\n{\n UNSERIALIZE_ARRAY((unsigned char *)regSpace,\n SingleWidth \/ 8 * NumFloatRegs);\n}\n\n<|endoftext|>"} {"text":"<commit_before>\/*\nCopyright (c) 2013-2016 Ubidots.\n\nPermission is hereby granted, free of charge, to any person obtaining\na copy of this software and associated documentation files (the\n\"Software\"), to deal in the Software without restriction, including\nwithout limitation the rights to use, copy, modify, merge, publish,\ndistribute, sublicense, and\/or sell copies of the Software, and to\npermit persons to whom the Software is furnished to do so, subject to\nthe following conditions:\n\nThe above copyright notice and this permission notice shall be\nincluded in all copies or substantial portions of the Software.\n\nTHE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND,\nEXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF\nMERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND\nNONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE\nLIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION\nOF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION\nWITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.\n\nMade by Mateo Velez - Metavix for Ubidots Inc\n\n*\/\n#include <stdlib.h>\n#include <ctype.h>\n#include <string.h>\n#include \"UbidotsArduino.h\"\n\n\/**\n * Constructor.\n *\/\nUbidots::Ubidots(char* token, char* server) {\n _token = token;\n _server = server;\n currentValue = 0;\n val = (Value *)malloc(MAX_VALUES*sizeof(Value));\n}\n\/** \n * This function is to get value from the Ubidots API\n * @arg id the id where you will get the data\n * @return true uppon succes\n *\/\n\n\/** \n * This function is to get variable information from the Ubidots API\n * @arg dot is pointer to struct ubi_value\n * @return dot->value, the float value of the dot you get from the Ubidots API\n * The struct dot is updated, providing access to:\n * dot->value := (float) value of datadot\n * dot->count := number of datadots \n * dot->timestamp := timestamp in SECONDS\n * dot->valid := reading valid \n * Example Code for Arduino:\n ubi_value ubi_struct = {\"575e754d76254211xxxxxxxx\", 0.0, 0L, false}; \/\/ Ubidots struct for \"Switch\" \n float value;\n\n value=client.getValueInfo(&ubi_struct); \/\/ This is the important call\n\n if (ubi_struct.valid){ \/\/ Ubidot Value is valid\n Serial.print(\" Ubi_struct: \"+String(ubi_struct.value,DEC)+\" Count:\"+String(ubi_struct.count,DEC)+\" timestamp[s]:\"+String(ubi_struct.timestamp,DEC));\n } else {\n Serial.println(\"UBIDOTS: ERROR getDot(Dot_Switch) \");\n }\n*\n**\/\nvoid Ubidots::getValueInfo(ubi_value* dot) {\n String raw;\n char reply[500];\n int i = 0;\n int timeout = 3000;\n char* id = dot->id;\n uint8_t bodyPosinit;\n uint8_t bodyPosend;\n _client.connect(SERVER, PORT);\n if (_client.connected()) {\n Serial.println(F(\"Getting your dot\"));\n \/\/ Make a HTTP request:\n _client.print(F(\"GET \/api\/v1.6\/variables\/\"));\n _client.print(id);\n _client.println(F(\"\/values?page_size=1 HTTP\/1.1\"));\n _client.println(F(\"Host: things.ubidots.com\"));\n _client.println(F(\"User-Agent: Arduino-WiFi\/1.0\"));\n _client.print(F(\"X-Auth-Token: \"));\n _client.println(_token);\n _client.println(F(\"Connection: close\"));\n _client.println();\n } else {\n Serial.println(F(\"Connection failed\"));\n dot->valid = false;\n return;\n }\n while (!_client.available()) { \/\/ Allow Timeout in endless loop\n delay(100);\n timeout -= 100;\n if (timeout < 0) {\n Serial.println(F(\"ERROR: Wating for client timed out\"));\n break;\n }\n }\n while (_client.available()) {\n reply[i] = _client.read();\n i++;\n if(i >= 499) {\n i = 0;\n break;\n }\n \/\/Serial.write(c);\n }\n _client.stop();\n\/\/ Serial.println(reply);\n char* pch;\n char* rest;\n dot->valid = true;\n pch = strstr(reply,\"\\\"value\\\":\");\n raw = String(pch);\n bodyPosinit = 9 + raw.indexOf(\"\\\"value\\\":\");\n bodyPosend = raw.indexOf(\", \\\"timestamp\\\"\");\n raw.substring(bodyPosinit, bodyPosend);\n dot->value = raw.toFloat();\n\n bodyPosinit = 9 + raw.indexOf(\"\\\"count\\\": \");\n bodyPosend = raw.indexOf(\", \\\"next\\\"\");\n raw.substring(bodyPosinit, bodyPosend);\n dot->count = atof(raw.c_str());\n\n bodyPosinit = 13 + raw.indexOf(\"\\\"timestamp\\\": \");\n bodyPosend = raw.indexOf(\", \\\"context\\\"\");\n raw.substring(bodyPosinit, bodyPosend);\n dot->count = atof(raw.c_str());\n return;\n}\n\n\nfloat * Ubidots::getValue(char* id) {\n String raw;\n float arrayResponse[2];\n arrayResponse[0] = 0;\n arrayResponse[1] = 0;\n char reply[500];\n int i = 0;\n uint8_t bodyPosinit;\n uint8_t bodyPosend;\n _client.connect(_server, PORT);\n if (_client.connected()) {\n Serial.println(F(\"Geting your variable\"));\n \/\/ Make a HTTP request:\n _client.print(F(\"GET \/api\/v1.6\/variables\/\"));\n _client.print(id);\n _client.println(F(\"\/values?page_size=1 HTTP\/1.1\"));\n _client.println(F(\"Host: things.ubidots.com\"));\n _client.println(F(\"User-Agent: Arduino-WiFi\/1.0\"));\n _client.print(F(\"X-Auth-Token: \"));\n _client.println(_token);\n _client.println(F(\"Connection: close\"));\n _client.println();\n } else {\n Serial.println(F(\"Connection failed\"));\n return arrayResponse;\n }\n int timeout = 0;\n while (!_client.available() && timeout < 5000) {\n delay(1);\n timeout++;\n }\n while (_client.available()) {\n reply[i] = _client.read();\n i++;\n if (i >= 499) {\n i = 0;\n break;\n }\n }\n _client.stop();\n arrayResponse[0] = 1;\n Serial.println(reply);\n char* pch = strstr(reply, \"\\\"value\\\":\");\n raw = String(pch);\n bodyPosinit = 9 + raw.indexOf(\"\\\"value\\\":\");\n bodyPosend = raw.indexOf(\", \\\"timestamp\\\"\");\n raw.substring(bodyPosinit, bodyPosend).toCharArray(reply, 10);\n arrayResponse[1] = atof(reply);\n return arrayResponse;\n}\n\/**\n * Add a value of variable to save\n * @arg variable_id variable id to save in a struct\n * @arg value variable value to save in a struct\n *\/\nvoid Ubidots::add(char *variable_id, float value) {\n (val+currentValue)->id = variable_id;\n (val+currentValue)->value_id = value;\n currentValue++;\n if (currentValue > MAX_VALUES) {\n Serial.println(F(\"You are sending more than 5 consecutives variables, you just could send 5 variables. Then other variables will be deleted!\"));\n currentValue = MAX_VALUES;\n }\n}\n\/**\n * Send all data of all variables that you saved\n * @reutrn true upon success, false upon error.\n *\/\nbool Ubidots::sendAll() {\n String payload;\n String httpHeaders;\n String str;\n uint8_t size = 0;\n httpHeaders = \"POST \/api\/v1.6\/collections\/values\/?force=true HTTP\/1.1\\r\\n\";\n httpHeaders += \"Host: things.ubidots.com\\r\\n\";\n httpHeaders += \"User-Agent: Arduino-WiFi\/\" + VERSION +\"\\r\\n\";\n httpHeaders += \"X-Auth-Token: \" + _token + \"\\r\\n\";\n httpHeaders += \"Connection: close\\r\\n\";\n httpHeaders += \"Content-Type: application\/json\\r\\n\";\n payload = \"[\";\n for (int i = 0; i < currentValue; ) {\n str = String(((val+i)->value_id), 2);\n payload += \"{\\\"variable\\\": \\\"{\" + (val + i)->id +\"}\\\", \\\"value\\\":\"+ str +\"}\";\n i++;\n if (i < currentValue) {\n payload += \", \";\n }\n }\n payload += \"]\\r\\n\";\n size = payload.length();\n httpHeaders += \"Content-Length: \"+ String(size) +\"\\r\\n\\r\\n\";\n#ifdef META_DEBUG\n Serial.println(\"The full HTTP is: \");\n Serial.print(httpHeaders);\n Serial.println(payload);\n httpHeaders += payload;\n#endif\n\n if (_client.connect(_server, PORT)) {\n Serial.println(F(\"The TCP socket is opened\"));\n _client.println(httpHeaders)\n _client.flush();\n }\n int timeout = 0;\n delay(100);\n while (!_client.available() && timeout < 5000) {\n delay(1);\n timeout++;\n }\n while (_client.available()) {\n char c = _client.read();\n Serial.write(c);\n }\n currentValue = 0;\n _client.stop();\n return true;\n}\n<commit_msg>deleted braces<commit_after>\/*\nCopyright (c) 2013-2016 Ubidots.\n\nPermission is hereby granted, free of charge, to any person obtaining\na copy of this software and associated documentation files (the\n\"Software\"), to deal in the Software without restriction, including\nwithout limitation the rights to use, copy, modify, merge, publish,\ndistribute, sublicense, and\/or sell copies of the Software, and to\npermit persons to whom the Software is furnished to do so, subject to\nthe following conditions:\n\nThe above copyright notice and this permission notice shall be\nincluded in all copies or substantial portions of the Software.\n\nTHE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND,\nEXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF\nMERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND\nNONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE\nLIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION\nOF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION\nWITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.\n\nMade by Mateo Velez - Metavix for Ubidots Inc\n\n*\/\n#include <stdlib.h>\n#include <ctype.h>\n#include <string.h>\n#include \"UbidotsArduino.h\"\n\n\/**\n * Constructor.\n *\/\nUbidots::Ubidots(char* token, char* server) {\n _token = token;\n _server = server;\n currentValue = 0;\n val = (Value *)malloc(MAX_VALUES*sizeof(Value));\n}\n\/** \n * This function is to get value from the Ubidots API\n * @arg id the id where you will get the data\n * @return true uppon succes\n *\/\n\n\/** \n * This function is to get variable information from the Ubidots API\n * @arg dot is pointer to struct ubi_value\n * @return dot->value, the float value of the dot you get from the Ubidots API\n * The struct dot is updated, providing access to:\n * dot->value := (float) value of datadot\n * dot->count := number of datadots \n * dot->timestamp := timestamp in SECONDS\n * dot->valid := reading valid \n * Example Code for Arduino:\n ubi_value ubi_struct = {\"575e754d76254211xxxxxxxx\", 0.0, 0L, false}; \/\/ Ubidots struct for \"Switch\" \n float value;\n\n value=client.getValueInfo(&ubi_struct); \/\/ This is the important call\n\n if (ubi_struct.valid){ \/\/ Ubidot Value is valid\n Serial.print(\" Ubi_struct: \"+String(ubi_struct.value,DEC)+\" Count:\"+String(ubi_struct.count,DEC)+\" timestamp[s]:\"+String(ubi_struct.timestamp,DEC));\n } else {\n Serial.println(\"UBIDOTS: ERROR getDot(Dot_Switch) \");\n }\n*\n**\/\nvoid Ubidots::getValueInfo(ubi_value* dot) {\n String raw;\n char reply[500];\n int i = 0;\n int timeout = 3000;\n char* id = dot->id;\n uint8_t bodyPosinit;\n uint8_t bodyPosend;\n _client.connect(SERVER, PORT);\n if (_client.connected()) {\n Serial.println(F(\"Getting your dot\"));\n \/\/ Make a HTTP request:\n _client.print(F(\"GET \/api\/v1.6\/variables\/\"));\n _client.print(id);\n _client.println(F(\"\/values?page_size=1 HTTP\/1.1\"));\n _client.println(F(\"Host: things.ubidots.com\"));\n _client.println(F(\"User-Agent: Arduino-WiFi\/1.0\"));\n _client.print(F(\"X-Auth-Token: \"));\n _client.println(_token);\n _client.println(F(\"Connection: close\"));\n _client.println();\n } else {\n Serial.println(F(\"Connection failed\"));\n dot->valid = false;\n return;\n }\n while (!_client.available()) { \/\/ Allow Timeout in endless loop\n delay(100);\n timeout -= 100;\n if (timeout < 0) {\n Serial.println(F(\"ERROR: Wating for client timed out\"));\n break;\n }\n }\n while (_client.available()) {\n reply[i] = _client.read();\n i++;\n if(i >= 499) {\n i = 0;\n break;\n }\n \/\/Serial.write(c);\n }\n _client.stop();\n\/\/ Serial.println(reply);\n char* pch;\n char* rest;\n dot->valid = true;\n pch = strstr(reply,\"\\\"value\\\":\");\n raw = String(pch);\n bodyPosinit = 9 + raw.indexOf(\"\\\"value\\\":\");\n bodyPosend = raw.indexOf(\", \\\"timestamp\\\"\");\n raw.substring(bodyPosinit, bodyPosend);\n dot->value = raw.toFloat();\n\n bodyPosinit = 9 + raw.indexOf(\"\\\"count\\\": \");\n bodyPosend = raw.indexOf(\", \\\"next\\\"\");\n raw.substring(bodyPosinit, bodyPosend);\n dot->count = atof(raw.c_str());\n\n bodyPosinit = 13 + raw.indexOf(\"\\\"timestamp\\\": \");\n bodyPosend = raw.indexOf(\", \\\"context\\\"\");\n raw.substring(bodyPosinit, bodyPosend);\n dot->count = atof(raw.c_str());\n return;\n}\n\n\nfloat * Ubidots::getValue(char* id) {\n String raw;\n float arrayResponse[2];\n arrayResponse[0] = 0;\n arrayResponse[1] = 0;\n char reply[500];\n int i = 0;\n uint8_t bodyPosinit;\n uint8_t bodyPosend;\n _client.connect(_server, PORT);\n if (_client.connected()) {\n Serial.println(F(\"Geting your variable\"));\n \/\/ Make a HTTP request:\n _client.print(F(\"GET \/api\/v1.6\/variables\/\"));\n _client.print(id);\n _client.println(F(\"\/values?page_size=1 HTTP\/1.1\"));\n _client.println(F(\"Host: things.ubidots.com\"));\n _client.println(F(\"User-Agent: Arduino-WiFi\/1.0\"));\n _client.print(F(\"X-Auth-Token: \"));\n _client.println(_token);\n _client.println(F(\"Connection: close\"));\n _client.println();\n } else {\n Serial.println(F(\"Connection failed\"));\n return arrayResponse;\n }\n int timeout = 0;\n while (!_client.available() && timeout < 5000) {\n delay(1);\n timeout++;\n }\n while (_client.available()) {\n reply[i] = _client.read();\n i++;\n if (i >= 499) {\n i = 0;\n break;\n }\n }\n _client.stop();\n arrayResponse[0] = 1;\n Serial.println(reply);\n char* pch = strstr(reply, \"\\\"value\\\":\");\n raw = String(pch);\n bodyPosinit = 9 + raw.indexOf(\"\\\"value\\\":\");\n bodyPosend = raw.indexOf(\", \\\"timestamp\\\"\");\n raw.substring(bodyPosinit, bodyPosend).toCharArray(reply, 10);\n arrayResponse[1] = atof(reply);\n return arrayResponse;\n}\n\/**\n * Add a value of variable to save\n * @arg variable_id variable id to save in a struct\n * @arg value variable value to save in a struct\n *\/\nvoid Ubidots::add(char *variable_id, float value) {\n (val+currentValue)->id = variable_id;\n (val+currentValue)->value_id = value;\n currentValue++;\n if (currentValue > MAX_VALUES) {\n Serial.println(F(\"You are sending more than 5 consecutives variables, you just could send 5 variables. Then other variables will be deleted!\"));\n currentValue = MAX_VALUES;\n }\n}\n\/**\n * Send all data of all variables that you saved\n * @reutrn true upon success, false upon error.\n *\/\nbool Ubidots::sendAll() {\n String payload;\n String httpHeaders;\n String str;\n uint8_t size = 0;\n httpHeaders = \"POST \/api\/v1.6\/collections\/values\/?force=true HTTP\/1.1\\r\\n\";\n httpHeaders += \"Host: things.ubidots.com\\r\\n\";\n httpHeaders += \"User-Agent: Arduino-WiFi\/\" + VERSION +\"\\r\\n\";\n httpHeaders += \"X-Auth-Token: \" + _token + \"\\r\\n\";\n httpHeaders += \"Connection: close\\r\\n\";\n httpHeaders += \"Content-Type: application\/json\\r\\n\";\n payload = \"[\";\n for (int i = 0; i < currentValue; ) {\n str = String(((val+i)->value_id), 2);\n payload += \"{\\\"variable\\\": \\\"\" + (val + i)->id +\"\\\", \\\"value\\\":\"+ str +\"}\";\n i++;\n if (i < currentValue) {\n payload += \", \";\n }\n }\n payload += \"]\\r\\n\";\n size = payload.length();\n httpHeaders += \"Content-Length: \"+ String(size) +\"\\r\\n\\r\\n\";\n#ifdef META_DEBUG\n Serial.println(\"The full HTTP is: \");\n Serial.print(httpHeaders);\n Serial.println(payload);\n httpHeaders += payload;\n#endif\n\n if (_client.connect(_server, PORT)) {\n Serial.println(F(\"The TCP socket is opened\"));\n _client.println(httpHeaders)\n _client.flush();\n }\n int timeout = 0;\n delay(100);\n while (!_client.available() && timeout < 5000) {\n delay(1);\n timeout++;\n }\n while (_client.available()) {\n char c = _client.read();\n Serial.write(c);\n }\n currentValue = 0;\n _client.stop();\n return true;\n}\n<|endoftext|>"} {"text":"<commit_before>#pragma once\n\n#include <agency\/detail\/config.hpp>\n#include <agency\/future.hpp>\n#include <agency\/new_executor_traits.hpp>\n#include <agency\/detail\/executor_traits\/shared_parameter_container.hpp>\n#include <agency\/detail\/executor_traits\/check_for_member_functions.hpp>\n#include <agency\/detail\/index_cast.hpp>\n#include <type_traits>\n#include <utility>\n#include <cassert>\n\nnamespace agency\n{\nnamespace detail\n{\nnamespace new_executor_traits_detail\n{\n\n\ntemplate<size_t... Indices, class Executor, class Function, class TupleOfFutures, class... Types>\ntypename new_executor_traits<Executor>::template future<\n detail::when_all_execute_and_select_result_t<\n detail::index_sequence<Indices...>,\n typename std::decay<TupleOfFutures>::type\n >\n>\n multi_agent_when_all_execute_and_select_with_shared_inits(std::true_type, Executor& ex, Function f, typename new_executor_traits<Executor>::shape_type shape, TupleOfFutures&& futures, Types&&... shared_inits)\n{\n return ex.template when_all_execute_and_select<Indices...>(f, shape, std::forward<TupleOfFutures>(futures), std::forward<Types>(shared_inits)...);\n} \/\/ end multi_agent_when_all_execute_and_select_with_shared_inits()\n\n\ntemplate<class Function, class Shape>\nstruct multi_agent_when_all_execute_and_select_with_shared_inits_functor\n{\n mutable Function f;\n Shape shape;\n\n template<size_t depth, class AgentIndex>\n __AGENCY_ANNOTATION\n size_t rank_in_group(const AgentIndex& idx) const\n {\n \/\/ to compute the rank of an index at a particular depth,\n \/\/ first prepend 0 (1) to idx (shape) to represent an index of the root group (it has none otherwise)\n \/\/ XXX seems like index_cast() should just do the right thing for empty indices\n \/\/ it would correspond to a single-agent task\n auto augmented_idx = detail::tuple_prepend(detail::wrap_scalar(idx), size_t{0});\n auto augmented_shape = detail::tuple_prepend(detail::wrap_scalar(shape), size_t{1});\n \n \/\/ take the first depth+1 (plus one because we prepended 1) indices of the index & shape and do an index_cast to size_t\n return detail::index_cast<size_t>(detail::tuple_take<depth+1>(augmented_idx),\n detail::tuple_take<depth+1>(augmented_shape),\n detail::shape_size(detail::tuple_take<depth+1>(augmented_shape)));\n }\n\n template<size_t... ContainerIndices, class AgentIndex, class TupleOfContainers, class... Types>\n __AGENCY_ANNOTATION\n void impl(detail::index_sequence<ContainerIndices...>, AgentIndex&& agent_idx, TupleOfContainers&& shared_arg_containers, Types&... past_args) const\n {\n f(std::forward<AgentIndex>(agent_idx), \/\/ pass the agent index\n past_args..., \/\/ pass the arguments coming in from futures\n std::get<ContainerIndices>(shared_arg_containers)[rank_in_group<ContainerIndices>(agent_idx)]... \/\/ pass the arguments coming in from shared parameters\n );\n }\n\n template<class Index, class TupleOfContainers, class... Types>\n __AGENCY_ANNOTATION\n void operator()(Index&& idx, TupleOfContainers& shared_arg_containers, Types&... past_args) const\n {\n static const size_t num_containers = std::tuple_size<TupleOfContainers>::value;\n impl(detail::make_index_sequence<num_containers>(), std::forward<Index>(idx), shared_arg_containers, past_args...);\n }\n};\n\n\ntemplate<size_t... Indices, class Executor, class Function, class TupleOfFutures, class... Types>\ntypename new_executor_traits<Executor>::template future<\n detail::when_all_execute_and_select_result_t<\n detail::index_sequence<Indices...>,\n typename std::decay<TupleOfFutures>::type\n >\n>\n multi_agent_when_all_execute_and_select_with_shared_inits(std::false_type, Executor& ex, Function f, typename new_executor_traits<Executor>::shape_type shape, TupleOfFutures&& futures, Types&&... shared_inits)\n{\n \/\/ create a tuple of containers holding a shared parameter for each group\n auto shared_param_containers_tuple = new_executor_traits_detail::make_tuple_of_shared_parameter_containers(ex, shape, std::forward<Types>(shared_inits)...);\n\n \/\/ turn it into a future\n auto shared_param_containers_tuple_fut = new_executor_traits<Executor>::template make_ready_future<decltype(shared_param_containers_tuple)>(ex, std::move(shared_param_containers_tuple));\n\n \/\/ combine the shared parameters with the incoming futures\n \/\/ the tuple of containers goes in front of the incoming futures\n auto shared_and_futures = detail::tuple_prepend(std::move(futures), std::move(shared_param_containers_tuple_fut));\n\n \/\/ wrap f with a functor to map container elements to shared parameters\n auto g = multi_agent_when_all_execute_and_select_with_shared_inits_functor<Function, typename new_executor_traits<Executor>::shape_type>{f, shape};\n\n \/\/ add one to the indices to skip the tuple of containers which was prepended to the tuple of futures\n return new_executor_traits<Executor>::template when_all_execute_and_select<(Indices+1)...>(ex, g, shape, std::move(shared_and_futures));\n} \/\/ end multi_agent_when_all_execute_and_select_with_shared_inits()\n\n\n} \/\/ end detail\n} \/\/ end new_executor_traits_detail\n\n\ntemplate<class Executor>\ntemplate<size_t... Indices, class Function, class TupleOfFutures, class T1, class... Types>\n typename new_executor_traits<Executor>::template future<\n detail::when_all_execute_and_select_result_t<\n detail::index_sequence<Indices...>,\n typename std::decay<TupleOfFutures>::type\n >\n >\n new_executor_traits<Executor>\n ::when_all_execute_and_select(typename new_executor_traits<Executor>::executor_type& ex,\n Function f,\n typename new_executor_traits<Executor>::shape_type shape,\n TupleOfFutures&& futures,\n T1&& outer_shared_init,\n Types&&... inner_shared_inits)\n{\n static_assert(new_executor_traits<Executor>::execution_depth == 1 + sizeof...(Types), \"The number of shared initializers must be equal to the executor's execution_depth.\");\n \n using check_for_member_function = detail::new_executor_traits_detail::has_multi_agent_when_all_execute_and_select_with_shared_inits<\n detail::index_sequence<Indices...>,\n Executor,\n Function,\n typename std::decay<TupleOfFutures>::type,\n detail::type_list<T1,Types...>\n >;\n\n return detail::new_executor_traits_detail::multi_agent_when_all_execute_and_select_with_shared_inits<Indices...>(check_for_member_function(), ex, f, shape, std::forward<TupleOfFutures>(futures), std::forward<T1>(outer_shared_init), std::forward<Types>(inner_shared_inits)...);\n} \/\/ end new_executor_traits::when_all_execute_and_select()\n\n\n} \/\/ end agency\n\n<commit_msg>Implement multi-agent when_all_execute_and_select() with shared inits with single-agent when_all_execute_and_select() with nested multi-agent execute() with shared inits<commit_after>#pragma once\n\n#include <agency\/detail\/config.hpp>\n#include <agency\/future.hpp>\n#include <agency\/new_executor_traits.hpp>\n#include <agency\/detail\/executor_traits\/shared_parameter_container.hpp>\n#include <agency\/detail\/executor_traits\/check_for_member_functions.hpp>\n#include <agency\/detail\/index_cast.hpp>\n#include <type_traits>\n#include <utility>\n#include <cassert>\n\nnamespace agency\n{\nnamespace detail\n{\nnamespace new_executor_traits_detail\n{\nnamespace multi_agent_when_all_execute_and_select_with_shared_inits_implementation_strategies\n{\n\n\nstruct use_multi_agent_when_all_execute_and_select_with_shared_inits_member_function {};\n\nstruct use_multi_agent_when_all_execute_and_select_member_function {};\n\nstruct use_single_agent_when_all_execute_and_select_with_nested_terminal_multi_agent_execute_with_shared_inits {};\n\n\ntemplate<class Function, class Shape>\nstruct multi_agent_when_all_execute_and_select_with_shared_inits_functor\n{\n mutable Function f;\n Shape shape;\n\n template<size_t depth, class AgentIndex>\n __AGENCY_ANNOTATION\n size_t rank_in_group(const AgentIndex& idx) const\n {\n \/\/ to compute the rank of an index at a particular depth,\n \/\/ first prepend 0 (1) to idx (shape) to represent an index of the root group (it has none otherwise)\n \/\/ XXX seems like index_cast() should just do the right thing for empty indices\n \/\/ it would correspond to a single-agent task\n auto augmented_idx = detail::tuple_prepend(detail::wrap_scalar(idx), size_t{0});\n auto augmented_shape = detail::tuple_prepend(detail::wrap_scalar(shape), size_t{1});\n \n \/\/ take the first depth+1 (plus one because we prepended 1) indices of the index & shape and do an index_cast to size_t\n return detail::index_cast<size_t>(detail::tuple_take<depth+1>(augmented_idx),\n detail::tuple_take<depth+1>(augmented_shape),\n detail::shape_size(detail::tuple_take<depth+1>(augmented_shape)));\n }\n\n template<size_t... ContainerIndices, class AgentIndex, class TupleOfContainers, class... Types>\n __AGENCY_ANNOTATION\n void impl(detail::index_sequence<ContainerIndices...>, AgentIndex&& agent_idx, TupleOfContainers&& shared_arg_containers, Types&... past_args) const\n {\n f(std::forward<AgentIndex>(agent_idx), \/\/ pass the agent index\n past_args..., \/\/ pass the arguments coming in from futures\n std::get<ContainerIndices>(shared_arg_containers)[rank_in_group<ContainerIndices>(agent_idx)]... \/\/ pass the arguments coming in from shared parameters\n );\n }\n\n template<class Index, class TupleOfContainers, class... Types>\n __AGENCY_ANNOTATION\n void operator()(Index&& idx, TupleOfContainers& shared_arg_containers, Types&... past_args) const\n {\n static const size_t num_containers = std::tuple_size<TupleOfContainers>::value;\n impl(detail::make_index_sequence<num_containers>(), std::forward<Index>(idx), shared_arg_containers, past_args...);\n }\n};\n\n\ntemplate<class IndexSequence, class Executor, class Function, class TupleOfFutures, class TypeList>\nstruct has_multi_agent_when_all_execute_and_select_member_function_impl;\n\ntemplate<size_t... Indices, class Executor, class Function, class TupleOfFutures, class... Types>\nstruct has_multi_agent_when_all_execute_and_select_member_function_impl<detail::index_sequence<Indices...>,Executor,Function,TupleOfFutures,detail::type_list<Types...>>\n{\n using tuple_of_shared_parameter_containers_type = tuple_of_shared_parameter_containers<Executor, typename std::decay<Types>::type...>;\n\n using future_tuple_of_shared_parameter_containers_type = typename new_executor_traits<Executor>::template future<tuple_of_shared_parameter_containers_type>;\n\n using prepended_tuple_of_futures_type = tuple_prepend_result_t<TupleOfFutures, future_tuple_of_shared_parameter_containers_type>;\n\n using shape_type = typename new_executor_traits<Executor>::shape_type;\n\n using wrapped_function_type = multi_agent_when_all_execute_and_select_with_shared_inits_functor<Function, shape_type>;\n\n using type = typename new_executor_traits_detail::has_multi_agent_when_all_execute_and_select<\n Executor, wrapped_function_type, prepended_tuple_of_futures_type, (Indices+1)...\n >::type;\n};\n\n\ntemplate<class IndexSequence, class Executor, class Function, class TupleOfFutures, class TypeList>\nstruct select_multi_agent_when_all_execute_and_select_with_shared_inits_implementation_impl;\n\ntemplate<size_t... Indices, class Executor, class Function, class TupleOfFutures, class... Types>\nstruct select_multi_agent_when_all_execute_and_select_with_shared_inits_implementation_impl<\n detail::index_sequence<Indices...>, Executor, Function, TupleOfFutures, type_list<Types...>\n>\n{\n using type = typename std::conditional<\n has_multi_agent_when_all_execute_and_select_with_shared_inits<\n detail::index_sequence<Indices...>, Executor, Function, TupleOfFutures, type_list<Types...>\n >::value,\n use_multi_agent_when_all_execute_and_select_with_shared_inits_member_function,\n typename std::conditional<\n has_multi_agent_when_all_execute_and_select<Executor, Function, TupleOfFutures, Indices...>::value,\n use_multi_agent_when_all_execute_and_select_member_function,\n use_single_agent_when_all_execute_and_select_with_nested_terminal_multi_agent_execute_with_shared_inits\n >::type\n >::type;\n};\n\ntemplate<class IndexSequence, class Executor, class Function, class TupleOfFutures, class TypeList>\nusing select_multi_agent_when_all_execute_and_select_with_shared_inits_implementation = typename select_multi_agent_when_all_execute_and_select_with_shared_inits_implementation_impl<IndexSequence,Executor,Function,TupleOfFutures,TypeList>::type;\n\n\ntemplate<size_t... Indices, class Executor, class Function, class TupleOfFutures, class... Types>\ntypename new_executor_traits<Executor>::template future<\n detail::when_all_execute_and_select_result_t<\n detail::index_sequence<Indices...>,\n typename std::decay<TupleOfFutures>::type\n >\n>\n multi_agent_when_all_execute_and_select_with_shared_inits(use_multi_agent_when_all_execute_and_select_with_shared_inits_member_function,\n Executor& ex, Function f, typename new_executor_traits<Executor>::shape_type shape, TupleOfFutures&& futures, Types&&... shared_inits)\n{\n return ex.template when_all_execute_and_select<Indices...>(f, shape, std::forward<TupleOfFutures>(futures), std::forward<Types>(shared_inits)...);\n} \/\/ end multi_agent_when_all_execute_and_select_with_shared_inits()\n\n\ntemplate<size_t... Indices, class Executor, class Function, class TupleOfFutures, class... Types>\ntypename new_executor_traits<Executor>::template future<\n detail::when_all_execute_and_select_result_t<\n detail::index_sequence<Indices...>,\n typename std::decay<TupleOfFutures>::type\n >\n>\n multi_agent_when_all_execute_and_select_with_shared_inits(use_multi_agent_when_all_execute_and_select_member_function,\n Executor& ex, Function f, typename new_executor_traits<Executor>::shape_type shape, TupleOfFutures&& futures, Types&&... shared_inits)\n{\n \/\/ create a tuple of containers holding a shared parameter for each group\n auto shared_param_containers_tuple = new_executor_traits_detail::make_tuple_of_shared_parameter_containers(ex, shape, std::forward<Types>(shared_inits)...);\n\n \/\/ turn it into a future\n auto shared_param_containers_tuple_fut = new_executor_traits<Executor>::template make_ready_future<decltype(shared_param_containers_tuple)>(ex, std::move(shared_param_containers_tuple));\n\n \/\/ combine the shared parameters with the incoming futures\n \/\/ the tuple of containers goes in front of the incoming futures\n auto shared_and_futures = detail::tuple_prepend(std::move(futures), std::move(shared_param_containers_tuple_fut));\n\n \/\/ wrap f with a functor to map container elements to shared parameters\n auto g = multi_agent_when_all_execute_and_select_with_shared_inits_functor<Function, typename new_executor_traits<Executor>::shape_type>{f, shape};\n\n \/\/ add one to the indices to skip the tuple of containers which was prepended to the tuple of futures\n return ex.template when_all_execute_and_select<(Indices+1)...>(g, shape, std::move(shared_and_futures));\n} \/\/ end multi_agent_when_all_execute_and_select_with_shared_inits()\n\n\n\/\/ this functor is passed to single-agent when_all_execute_and_select below\n\/\/ it makes a nested call to terminal multi-agent execute()\ntemplate<class Executor, class Function, class... Types>\nstruct terminal_execute_with_shared_inits_functor\n{\n Executor& ex;\n mutable Function f;\n typename new_executor_traits<Executor>::shape_type shape;\n detail::tuple<Types...> shared_inits;\n\n \/\/ this is the functor we pass to new_executor_traits::execute() below\n template<class... FutureValueTypes>\n struct nested_functor\n {\n mutable Function f;\n mutable detail::tuple<FutureValueTypes&...> args_from_futures;\n\n template<size_t... TupleIndices, class Index, class... Args>\n __AGENCY_ANNOTATION\n void impl(detail::index_sequence<TupleIndices...>, const Index& idx, Args&... shared_args) const\n {\n \/\/ XXX should use std::invoke()\n f(idx, std::get<TupleIndices>(args_from_futures)..., shared_args...);\n }\n\n template<class Index, class... Args>\n __AGENCY_ANNOTATION\n void operator()(const Index& idx, Args&... shared_args) const\n {\n impl(detail::make_index_sequence<sizeof...(FutureValueTypes)>(), idx, shared_args...);\n }\n };\n\n template<size_t... TupleIndices, class... Args>\n __AGENCY_ANNOTATION\n void impl(detail::index_sequence<TupleIndices...>, Args&... future_args) const\n {\n \/\/\/\/ XXX with polymorphic lambda we'd write something like this:\n \/\/new_executor_traits<Executor>::execute(ex, [=,&args...](const auto& idx, auto&... shared_args)\n \/\/{\n \/\/ \/\/ XXX should use std::invoke()\n \/\/ f(idx, args..., shared_args...);\n \/\/},\n \/\/shape,\n \/\/std::get<Indices>(shared_inits)...\n \/\/);\n\n auto g = nested_functor<Args...>{f, detail::tie(future_args...)};\n\n new_executor_traits<Executor>::execute(ex, g, shape, std::get<TupleIndices>(shared_inits)...);\n }\n\n template<class... Args>\n __AGENCY_ANNOTATION\n void operator()(Args&... future_args) const\n {\n impl(detail::make_index_sequence<sizeof...(Types)>(), future_args...);\n }\n};\n\n\ntemplate<size_t... Indices, class Executor, class Function, class TupleOfFutures, class... Types>\ntypename new_executor_traits<Executor>::template future<\n detail::when_all_execute_and_select_result_t<\n detail::index_sequence<Indices...>,\n typename std::decay<TupleOfFutures>::type\n >\n>\n multi_agent_when_all_execute_and_select_with_shared_inits(use_single_agent_when_all_execute_and_select_with_nested_terminal_multi_agent_execute_with_shared_inits,\n Executor& ex, Function f, typename new_executor_traits<Executor>::shape_type shape, TupleOfFutures&& futures, Types&&... shared_inits)\n{\n \/\/ XXX with polymorphic lambda we'd write something like this:\n \/\/return new_executor_traits<Executor>::template when_all_execute_and_select<Indices...>(ex, [=,&ex](auto&... args)\n \/\/{\n \/\/ new_executor_traits<Executor>::execute(ex, [=,&args](const auto& idx)\n \/\/ {\n \/\/ f(idx, args...);\n \/\/ },\n \/\/ shape,\n \/\/ shared_inits...);\n \/\/},\n \/\/std::forward<TupleOfFutures>(futures),\n \/\/std::forward<Types>(shared_inits)...\n \/\/);\n\n using functor_type = terminal_execute_with_shared_inits_functor<Executor,Function,typename std::decay<Types>::type...>;\n functor_type g{ex, f, shape, detail::make_tuple(std::forward<Types>(shared_inits)...)};\n\n return new_executor_traits<Executor>::template when_all_execute_and_select<Indices...>(ex, g, std::forward<TupleOfFutures>(futures));\n} \/\/ end multi_agent_when_all_execute_and_select_with_shared_inits()\n\n\n} \/\/ end multi_agent_when_all_execute_and_select_with_shared_inits_implementation_strategies\n} \/\/ end detail\n} \/\/ end new_executor_traits_detail\n\n\ntemplate<class Executor>\ntemplate<size_t... Indices, class Function, class TupleOfFutures, class T1, class... Types>\n typename new_executor_traits<Executor>::template future<\n detail::when_all_execute_and_select_result_t<\n detail::index_sequence<Indices...>,\n typename std::decay<TupleOfFutures>::type\n >\n >\n new_executor_traits<Executor>\n ::when_all_execute_and_select(typename new_executor_traits<Executor>::executor_type& ex,\n Function f,\n typename new_executor_traits<Executor>::shape_type shape,\n TupleOfFutures&& futures,\n T1&& outer_shared_init,\n Types&&... inner_shared_inits)\n{\n static_assert(new_executor_traits<Executor>::execution_depth == 1 + sizeof...(Types), \"The number of shared initializers must be equal to the executor's execution_depth.\");\n\n namespace ns = detail::new_executor_traits_detail::multi_agent_when_all_execute_and_select_with_shared_inits_implementation_strategies;\n\n using implementation_strategy = ns::select_multi_agent_when_all_execute_and_select_with_shared_inits_implementation<\n detail::index_sequence<Indices...>,\n Executor,\n Function,\n typename std::decay<TupleOfFutures>::type,\n detail::type_list<T1,Types...>\n >;\n\n return ns::multi_agent_when_all_execute_and_select_with_shared_inits<Indices...>(implementation_strategy(), ex, f, shape, std::forward<TupleOfFutures>(futures), std::forward<T1>(outer_shared_init), std::forward<Types>(inner_shared_inits)...);\n} \/\/ end new_executor_traits::when_all_execute_and_select()\n\n\n} \/\/ end agency\n\n<|endoftext|>"} {"text":"<commit_before>\/\/\n\/\/ main.cpp\n\/\/ Unit Tests\n\/\/\n\/\/ Created by Evan McCartney-Melstad on 12\/31\/14.\n\/\/ Copyright (c) 2014 Evan McCartney-Melstad. All rights reserved.\n\/\/\n\n#define CATCH_CONFIG_MAIN \/\/ This tells Catch to provide a main() - only do this in one cpp file\n#include \"..\/cPWP\/generateSimulatedData.h\"\n#include \"..\/cPWP\/bamsToBin.h\"\n#include \"..\/cPWP\/calcPWP.h\"\n#include \"catch.hpp\"\n#include <string>\n#include <iostream>\n#include <fstream>\n\n\n\/*\nTEST_CASE( \"Simulated reads are generated\", \"[generateReads]\" ) {\n \/\/ Make sure that the read simulation finishes\n REQUIRE( generateReadsAndMap(1, 0.01, \"0.0\", \"300\", \"50\", \"1000000\", \"100\", \"1234\", \"scaffold_0.fasta\") == 0);\n}\n *\/\n\nTEST_CASE( \"Generate reference genome for simulation tests\", \"[generateReference]\") {\n REQUIRE( createReferenceGenome(1000000, 0.42668722, \"simulatedReferenceGenome.fasta\") == 0 );\n}\n\nTEST_CASE ( \"Mutate a reference genome\", \"[mutateRefGenome]\") {\n REQUIRE( createMutatedGenome(\"simulatedReferenceGenome.fasta\", \"simulatedReferenceGenomeMutated.fasta\", 0.01) == 0);\n}\n\n\nTEST_CASE( \"Generate sequence reads\", \"[perfectReads]\") {\n REQUIRE( generatePerfectReads (\"simulatedReferenceGenome.fasta\", 1, 100, 300, \"normalRef\") == 0);\n \/\/generatePerfectReads (std::string reference, unsigned int stagger, unsigned int readLengths, unsigned int fragmentLengths, std::string readPrefix);\n}\n\n\nTEST_CASE( \" Mapping first set of reads\", \"[mapReads]\") {\n REQUIRE( mapReads(\"simulatedReferenceGenome.fasta\", \"normalRef_R1.fastq\", \"normalRef_R2.fastq\", \"normal.bam\", \"25\") == 0);\n}\n\n\/*\nTEST_CASE( \"Generate sequence reads 2\", \"[perfectReads2]\") {\n REQUIRE( generatePerfectReads (\"simulatedReferenceGenomeMutated.fasta\", 1, 100, 300, \"mutatedRef\") == 0);\n}\n\n\nTEST_CASE( \" Mapping second set of reads\", \"[mapReads2]\") {\n REQUIRE( mapReads(\"simulatedReferenceGenome.fasta\", \"mutatedRef_R1.fastq\", \"mutatedRef_R2.fastq\", \"mutated.bam\", \"25\") == 0);\n}\n*\/\n \nTEST_CASE( \"Create heterozygous R1\", \"[createHet]\") {\n REQUIRE( createHeterozygousGenome(\"normalRef_R1.fastq\", \"mutatedRef_R1.fastq\", \"hetRef_R1.fastq\") == 0);\n}\n\nTEST_CASE( \"Create heterozygous R2\", \"[createHet]\") {\n REQUIRE( createHeterozygousGenome(\"normalRef_R2.fastq\", \"mutatedRef_R2.fastq\", \"hetRef_R2.fastq\") == 0);\n}\n\n\nTEST_CASE( \" Mapping het reads\", \"[mapReads2]\") {\n REQUIRE( mapReads(\"simulatedReferenceGenome.fasta\", \"hetRef_R1.fastq\", \"hetRef_R2.fastq\", \"het.bam\", \"25\") == 0);\n}\n\n\n\n\nTEST_CASE( \"Run ANGSD on simulated reads\", \"[runANGSD]\" ) {\n REQUIRE( runANGSDforReadCounts(\"bamlist.txt\", \"angsdOut\", \"25\", \"angsdOutLog.txt\") == 0);\n}\n\n\/*\n\nTEST_CASE( \"Generate mutated reference genomes and simulate reads\", \"[genomeAndReadSim]\") {\n REQUIRE( generateReadsAndMap(3, 0.01, \"300\", \"25\", \"10000\", \"100\", \"1234\", \"simulatedReferenceGenome.fasta\", \"25\") == 0);\n}\n\nTEST_CASE( \"Run ANGSD on simulated reads\", \"[runANGSD]\" ) {\n REQUIRE( runANGSDforReadCounts(\"bamlist.txt\", \"angsdOut\", \"25\", \"angsdOutLog.txt\") == 0);\n}\n \n *\/\n\nTEST_CASE( \"Convert ANGSD read counts to unsigned chars for major and minor counts\", \"[convertCountsToBinary]\") {\n REQUIRE( convertANGSDcountsToBinary(\"angsdOut\", \"angsdOut.readCounts.binary\", 2, 5000) == 0); \/\/ 5000 as a max because we don't want to exclude any loci for this test\n}\n\nTEST_CASE( \"Calculate PWP from the binary representations of the ANGSD readcounts\", \"[calcPWP]\") {\n REQUIRE( calcPWPfromBinaryFile (\"angsdOut.readCounts.binary\", 0, 2, \"testingOut.pwp\", 30) == 0);\n}\n\n\n<commit_msg>Minor changes<commit_after>\/\/\n\/\/ main.cpp\n\/\/ Unit Tests\n\/\/\n\/\/ Created by Evan McCartney-Melstad on 12\/31\/14.\n\/\/ Copyright (c) 2014 Evan McCartney-Melstad. All rights reserved.\n\/\/\n\n#define CATCH_CONFIG_MAIN \/\/ This tells Catch to provide a main() - only do this in one cpp file\n#include \"..\/cPWP\/generateSimulatedData.h\"\n#include \"..\/cPWP\/bamsToBin.h\"\n#include \"..\/cPWP\/calcPWP.h\"\n#include \"catch.hpp\"\n#include <string>\n#include <iostream>\n#include <fstream>\n\n\n\/*\nTEST_CASE( \"Simulated reads are generated\", \"[generateReads]\" ) {\n \/\/ Make sure that the read simulation finishes\n REQUIRE( generateReadsAndMap(1, 0.01, \"0.0\", \"300\", \"50\", \"1000000\", \"100\", \"1234\", \"scaffold_0.fasta\") == 0);\n}\n *\/\n\nTEST_CASE( \"Generate reference genome for simulation tests\", \"[generateReference]\") {\n REQUIRE( createReferenceGenome(1000000, 0.42668722, \"simulatedReferenceGenome.fasta\") == 0 );\n}\n\nTEST_CASE ( \"Mutate a reference genome\", \"[mutateRefGenome]\") {\n REQUIRE( createMutatedGenome(\"simulatedReferenceGenome.fasta\", \"simulatedReferenceGenomeMutated.fasta\", 0.01) == 0);\n}\n\n\nTEST_CASE( \"Generate sequence reads\", \"[perfectReads]\") {\n REQUIRE( generatePerfectReads (\"simulatedReferenceGenome.fasta\", 1, 100, 300, \"normalRef\") == 0);\n \/\/generatePerfectReads (std::string reference, unsigned int stagger, unsigned int readLengths, unsigned int fragmentLengths, std::string readPrefix);\n}\n\n\nTEST_CASE( \" Mapping first set of reads\", \"[mapReads]\") {\n REQUIRE( mapReads(\"simulatedReferenceGenome.fasta\", \"normalRef_R1.fastq\", \"normalRef_R2.fastq\", \"normal.bam\", \"25\") == 0);\n}\n\n\/*\nTEST_CASE( \"Generate sequence reads 2\", \"[perfectReads2]\") {\n REQUIRE( generatePerfectReads (\"simulatedReferenceGenomeMutated.fasta\", 1, 100, 300, \"mutatedRef\") == 0);\n}\n\n*\/\n\nTEST_CASE( \" Mapping second set of reads\", \"[mapReads2]\") {\n REQUIRE( mapReads(\"simulatedReferenceGenome.fasta\", \"mutatedRef_R1.fastq\", \"mutatedRef_R2.fastq\", \"mutated.bam\", \"25\") == 0);\n}\n\n \nTEST_CASE( \"Create heterozygous R1\", \"[createHet]\") {\n REQUIRE( createHeterozygousGenome(\"normalRef_R1.fastq\", \"mutatedRef_R1.fastq\", \"hetRef_R1.fastq\") == 0);\n}\n\nTEST_CASE( \"Create heterozygous R2\", \"[createHet]\") {\n REQUIRE( createHeterozygousGenome(\"normalRef_R2.fastq\", \"mutatedRef_R2.fastq\", \"hetRef_R2.fastq\") == 0);\n}\n\n\nTEST_CASE( \" Mapping het reads\", \"[mapReads2]\") {\n REQUIRE( mapReads(\"simulatedReferenceGenome.fasta\", \"hetRef_R1.fastq\", \"hetRef_R2.fastq\", \"het.bam\", \"25\") == 0);\n}\n\n\n\n\nTEST_CASE( \"Run ANGSD on simulated reads\", \"[runANGSD]\" ) {\n REQUIRE( runANGSDforReadCounts(\"bamlist.txt\", \"angsdOut\", \"25\", \"angsdOutLog.txt\") == 0);\n}\n\n\/*\n\nTEST_CASE( \"Generate mutated reference genomes and simulate reads\", \"[genomeAndReadSim]\") {\n REQUIRE( generateReadsAndMap(3, 0.01, \"300\", \"25\", \"10000\", \"100\", \"1234\", \"simulatedReferenceGenome.fasta\", \"25\") == 0);\n}\n\nTEST_CASE( \"Run ANGSD on simulated reads\", \"[runANGSD]\" ) {\n REQUIRE( runANGSDforReadCounts(\"bamlist.txt\", \"angsdOut\", \"25\", \"angsdOutLog.txt\") == 0);\n}\n \n *\/\n\nTEST_CASE( \"Convert ANGSD read counts to unsigned chars for major and minor counts\", \"[convertCountsToBinary]\") {\n REQUIRE( convertANGSDcountsToBinary(\"angsdOut\", \"angsdOut.readCounts.binary\", 2, 5000) == 0); \/\/ 5000 as a max because we don't want to exclude any loci for this test\n}\n\nTEST_CASE( \"Calculate PWP from the binary representations of the ANGSD readcounts\", \"[calcPWP]\") {\n REQUIRE( calcPWPfromBinaryFile (\"angsdOut.readCounts.binary\", 0, 2, \"testingOut.pwp\", 30) == 0);\n}\n\n\n<|endoftext|>"} {"text":"<commit_before>#include \"ovasCPluginExternalStimulations.h\"\n\n#include <boost\/interprocess\/ipc\/message_queue.hpp>\n\n#include <vector>\n#include <ctime>\n#include <iostream>\n\n#include <openvibe\/ovITimeArithmetics.h>\n\n#define boolean OpenViBE::boolean\n\nusing namespace OpenViBE;\nusing namespace OpenViBE::Kernel;\nusing namespace OpenViBEAcquisitionServer;\nusing namespace OpenViBEAcquisitionServerPlugins;\nusing namespace std;\n\nCPluginExternalStimulations::CPluginExternalStimulations(const IKernelContext& rKernelContext) :\n\tIAcquisitionServerPlugin(rKernelContext),\n\tm_bIsExternalStimulationsEnabled(false)\n{\n\tm_rKernelContext.getLogManager() << LogLevel_Info << \"Loading plugin: Software Tagging\\n\";\n\n\tm_oProperties.name = \"Software Tagging\";\n\n\taddSetting<boolean>(\"Enable External Stimulations\", true);\n\taddSetting<OpenViBE::CString>(\"External Stimulation Queue Name\", \"openvibeExternalStimulations\");\n\n}\n\nCPluginExternalStimulations::~CPluginExternalStimulations()\n{\n}\n\n\/\/ Hooks\n\nvoid CPluginExternalStimulations::startHook()\n{\n\tm_bIsExternalStimulationsEnabled = getSetting<boolean>(\"Enable External Stimulations\");\n\n\tif (m_bIsExternalStimulationsEnabled)\n\t{\n\t\tm_sExternalStimulationsQueueName = getSetting<OpenViBE::CString>(\"External Stimulation Queue Name\");\n\t\tftime(&m_CTStartTime);\n\t\tm_bIsESThreadRunning = true;\n\t\tm_ESthreadPtr.reset(new boost::thread( boost::bind(&CPluginExternalStimulations::readExternalStimulations , this )));\n\t\tm_rKernelContext.getLogManager() << LogLevel_Info << \"Software tagging activated...\\n\";\n\t}\n\tm_vExternalStimulations.clear();\n\n\tm_iDebugExternalStimulationsSent=0;\n\tm_iDebugCurrentReadIPCStimulations = 0;\n\tm_iDebugStimulationsLost = 0;\n\tm_iDebugStimulationsReceivedEarlier = 0;\n\tm_iDebugStimulationsReceivedLate = 0;\n\tm_iDebugStimulationsReceivedWrongSize = 0;\n\tm_iDebugStimulationsBuffered = 0;\n\n}\n\nvoid CPluginExternalStimulations::loopHook(CStimulationSet &stimulationSet, uint64 start, uint64 end)\n{\n\tif (m_bIsExternalStimulationsEnabled)\n\t{\n\t\t\/\/m_rKernelContext.getLogManager() << LogLevel_Error << \"Checking for external stimulations:\" << p << \"\\n\";\n\t\taddExternalStimulations(&stimulationSet,m_rKernelContext.getLogManager(),start,end);\n\t}\n\n}\n\nvoid CPluginExternalStimulations::stopHook()\n{\n\tif (m_bIsExternalStimulationsEnabled)\n\t{\n\t\tm_bIsESThreadRunning = false;\n\t\tm_ESthreadPtr->join();\n\t}\n\n\n\t\/\/software tagging diagnosting\n\tm_rKernelContext.getLogManager() << LogLevel_Debug << \" Total external ones received through IPC: \" << m_iDebugCurrentReadIPCStimulations << \"\\n\";\n\tm_rKernelContext.getLogManager() << LogLevel_Debug << \" Sent to Designer: \" << m_iDebugExternalStimulationsSent << \"\\n\";\n\tm_rKernelContext.getLogManager() << LogLevel_Debug << \" Lost because of invalid timestamp: \" << m_iDebugStimulationsLost << \"\\n\";\n\tm_rKernelContext.getLogManager() << LogLevel_Debug << \" Stimulations that came earlier: \" << m_iDebugStimulationsReceivedEarlier << \"\\n\";\n\tm_rKernelContext.getLogManager() << LogLevel_Debug << \" Stimulations that came later: \" << \tm_iDebugStimulationsReceivedLate << \"\\n\";\n\tm_rKernelContext.getLogManager() << LogLevel_Debug << \" Stimulations that had wrong size: \" << \tm_iDebugStimulationsReceivedWrongSize << \"\\n\";\n\tm_rKernelContext.getLogManager() << LogLevel_Debug << \" Buffered: \" << \tm_iDebugStimulationsBuffered << \"\\n\";\n\n\tint processed=0;\n\tvector<SExternalStimulation>::iterator cii;\n\tfor(cii=m_vExternalStimulations.begin(); cii!=m_vExternalStimulations.end(); cii++)\n\t{\n\t\tif (cii->isProcessed)\n\t\t\tprocessed++;\n\t}\n\tm_rKernelContext.getLogManager() << LogLevel_Debug << \" processed: \" << processed << \"\\n\";\n\t\/\/end software tagging diagnosting\n}\n\nvoid CPluginExternalStimulations::acceptNewConnectionHook()\n{\n\tm_vExternalStimulations.clear();\n}\n\n\/\/ Plugin specific methods\n\nvoid CPluginExternalStimulations::readExternalStimulations()\n{\n\tusing namespace boost::interprocess;\n\n\t\/\/std::cout << \"Creating External Stimulations thread\" << std::endl;\n\t\/\/std::cout << \"Queue Name : \" << m_sExternalStimulationsQueueName << std::endl;\n\t\/\/char mq_name[255];\n\t\/\/std::strcpy(mq_name, m_sExternalStimulationsQueueName.toASCIIString());\n\tconst int chunk_length=3;\n\tconst int pause_time=5;\n\n\tunsigned int priority;\n\tsize_t recvd_size;\n\n\tuint64 chunk[chunk_length];\n\n\twhile (m_bIsESThreadRunning)\n\t{\n\t\tbool success = false;\n\t\ttry\n\t\t{\n\t\t\t\/\/Open a message queue.\n\t\t\tmessage_queue mq\n\t\t\t\t\t(open_only \/\/only open\n\t\t\t\t\t ,m_sExternalStimulationsQueueName.toASCIIString() \/\/name\n\t\t\t\t\t \/\/,mq_name \/\/name\n\t\t\t\t\t );\n\n\t\t\tsuccess = mq.try_receive(&chunk, sizeof(chunk), recvd_size, priority);\n\t\t}\n\t\tcatch(interprocess_exception & \/* ex *\/)\n\t\t{\n\t\t\t\/\/m_bIsESThreadRunning = false;\n\t\t\t\/\/m_rKernelContext.getLogManager() << LogLevel_Error << \"Problem with message queue in external stimulations:\" << ex.what() << \"\\n\";\n\t\t\tboost::this_thread::sleep(boost::posix_time::milliseconds(pause_time));\n\t\t\tcontinue;\n\t\t}\n\n\t\tif (!success)\n\t\t{\n\t\t\tboost::this_thread::sleep(boost::posix_time::milliseconds(pause_time));\n\t\t\tcontinue;\n\t\t}\n\n\t\tm_iDebugCurrentReadIPCStimulations++;\n\n\t\tif(recvd_size != sizeof(chunk))\n\t\t{\n\t\t\t\/\/m_rKernelContext.getLogManager() << LogLevel_Error << \"Problem with type of received data when reqding external stimulation!\\n\";\n\t\t\tm_iDebugStimulationsReceivedWrongSize++;\n\t\t}\n\t\telse\n\t\t{\n\t\t\t\/\/m_rKernelContext.getLogManager() << LogLevel_Warning << \"received\\n\";\n\n\t\t\tSExternalStimulation stim;\n\n\t\t\tstim.identifier = chunk[1];\n\t\t\tuint64 received_time = chunk[2];\n\n\t\t\t\/\/1. calculate time\n\t\t\tuint64 ct_start_time_ms = (m_CTStartTime.time * 1000 + m_CTStartTime.millitm);\n\n\t\t\tint64 time_test = received_time - ct_start_time_ms;\n\n\t\t\tif (time_test<0)\n\t\t\t{\n\t\t\t\tm_iDebugStimulationsLost++;\n\t\t\t\t\/\/m_rKernelContext.getLogManager() << LogLevel_Warning << \"AS: external stimulation time is invalid, probably stimulation is before reference point, total invalid so far: \" << m_i32FlashesLost << \"\\n\";\n\t\t\t\tboost::this_thread::sleep(boost::posix_time::milliseconds(pause_time));\n\t\t\t\tcontinue; \/\/we skip this stimulation\n\t\t\t}\n\t\t\t\/\/2. Convert to OpenVibe time\n\t\t\tuint64 ct_event_time = received_time - ct_start_time_ms;\n\n\t\t\tfloat64 time = (float64)ct_event_time \/ (float64)1000;\n\n\t\t\tuint64 ov_time = ITimeArithmetics::secondsToTime(time);\n\t\t\tstim.timestamp = ov_time;\n\n\t\t\tstim.alreadyCountedAsEarlier = false;\n\n\t\t\t\/\/3. Store, the main thread will process it\n\t\t\t{\n\t\t\t\t\/\/lock\n\t\t\t\tboost::mutex::scoped_lock lock(m_es_mutex);\n\n\t\t\t\tm_vExternalStimulations.push_back(stim);\n\t\t\t\tm_iDebugStimulationsBuffered++;\n\t\t\t\tm_esAvailable.notify_one();\n\t\t\t\t\/\/unlock\n\t\t\t}\n\n\t\t\tboost::this_thread::sleep(boost::posix_time::milliseconds(pause_time));\n\n\t\t}\n\t}\n}\n\nvoid CPluginExternalStimulations::addExternalStimulations(OpenViBE::CStimulationSet* ss, OpenViBE::Kernel::ILogManager& logm,uint64 start,uint64 end)\n{\n\tuint64 duration_ms = 40;\n\t{\n\t\t\/\/lock\n\t\tboost::mutex::scoped_lock lock(m_es_mutex);\n\n\t\tvector<SExternalStimulation>::iterator cii;\n\n\t\tfor(cii=m_vExternalStimulations.begin(); cii!=m_vExternalStimulations.end(); cii++)\n\t\t{\n\t\t\tif (cii->isProcessed==true) continue;\n\n\t\t\t\/\/ if time matches current chunk being processed - send it\n\t\t\tif (cii->timestamp >= start && cii->timestamp < end)\n\t\t\t{\n\t\t\t\t\/\/flashes_in_this_time_chunk++;\n\t\t\t\t\/\/logm << LogLevel_Error << \"Stimulation added.\" << \"\\n\";\n\t\t\t\tss->appendStimulation(cii->identifier, cii->timestamp, duration_ms);\n\t\t\t\tm_iDebugExternalStimulationsSent++;\n\t\t\t\t\/\/m_vExternalStimulations.erase(cii);\n\t\t\t\tcii->isProcessed = true;\n\t\t\t}\n\t\t\telse\n\t\t\t\t\/\/the stimulation is coming too late - after the current block being processed\n\t\t\t\t\/\/we correct the timestamp to the current block and we send it\n\t\t\t\tif (cii->timestamp < start)\n\t\t\t\t{\n\t\t\t\t\tm_iDebugStimulationsReceivedLate++;\n\t\t\t\t\tss->appendStimulation(cii->identifier, start, duration_ms);\n\t\t\t\t\tm_iDebugExternalStimulationsSent++;\n\t\t\t\t\t\/\/m_vExternalStimulations.erase(cii);\n\t\t\t\t\tcii->isProcessed = true;\n\t\t\t\t}\n\t\t\t\telse \/\/stim.timestamp > end - coming before the currently processed block, so we still can put in the right place\n\t\t\t\t{\n\t\t\t\t\t\/\/save the stimulation for later\n\t\t\t\t\tif (!cii->alreadyCountedAsEarlier)\n\t\t\t\t\t{\n\t\t\t\t\t\tm_iDebugStimulationsReceivedEarlier++;\n\t\t\t\t\t\tcii->alreadyCountedAsEarlier = true;\n\t\t\t\t\t}\n\t\t\t\t\tcontinue;\n\t\t\t\t}\n\t\t}\n\n\t\tm_esAvailable.notify_one();\n\t\t\/\/unlock\n\t}\n}\n\n\nboolean CPluginExternalStimulations::setExternalStimulationsEnabled(boolean bActive)\n{\n\tm_bIsExternalStimulationsEnabled=bActive;\n\treturn true;\n}\n\nboolean CPluginExternalStimulations::isExternalStimulationsEnabled(void)\n{\n\treturn m_bIsExternalStimulationsEnabled;\n}\n<commit_msg>contrib\/plugins\/external-stimulations: * fixed bug #135, settings in external stimulations are now loaded from the configuration manager<commit_after>#include \"ovasCPluginExternalStimulations.h\"\n\n#include <boost\/interprocess\/ipc\/message_queue.hpp>\n\n#include <vector>\n#include <ctime>\n#include <iostream>\n\n#include <openvibe\/ovITimeArithmetics.h>\n\n#define boolean OpenViBE::boolean\n\nusing namespace OpenViBE;\nusing namespace OpenViBE::Kernel;\nusing namespace OpenViBEAcquisitionServer;\nusing namespace OpenViBEAcquisitionServerPlugins;\nusing namespace std;\n\nCPluginExternalStimulations::CPluginExternalStimulations(const IKernelContext& rKernelContext) :\n\tIAcquisitionServerPlugin(rKernelContext),\n\tm_bIsExternalStimulationsEnabled(false)\n{\n\tm_rKernelContext.getLogManager() << LogLevel_Info << \"Loading plugin: Software Tagging\\n\";\n\n\tm_oProperties.name = \"Software Tagging\";\n\n IConfigurationManager& l_pConfigurationManager = m_rKernelContext.getConfigurationManager();\n\n addSetting<boolean>(\"Enable External Stimulations\", l_pConfigurationManager.expandAsBoolean(\"${AcquisitionServer_ExternalStimulations}\", false));\n addSetting<OpenViBE::CString>(\"External Stimulation Queue Name\", l_pConfigurationManager.expand(\"${AcquisitionServer_ExternalStimulationsQueueName}\"));\n\n}\n\nCPluginExternalStimulations::~CPluginExternalStimulations()\n{\n}\n\n\/\/ Hooks\n\nvoid CPluginExternalStimulations::startHook()\n{\n\tm_bIsExternalStimulationsEnabled = getSetting<boolean>(\"Enable External Stimulations\");\n\n\tif (m_bIsExternalStimulationsEnabled)\n\t{\n\t\tm_sExternalStimulationsQueueName = getSetting<OpenViBE::CString>(\"External Stimulation Queue Name\");\n\t\tftime(&m_CTStartTime);\n\t\tm_bIsESThreadRunning = true;\n\t\tm_ESthreadPtr.reset(new boost::thread( boost::bind(&CPluginExternalStimulations::readExternalStimulations , this )));\n\t\tm_rKernelContext.getLogManager() << LogLevel_Info << \"Software tagging activated...\\n\";\n\t}\n\tm_vExternalStimulations.clear();\n\n\tm_iDebugExternalStimulationsSent=0;\n\tm_iDebugCurrentReadIPCStimulations = 0;\n\tm_iDebugStimulationsLost = 0;\n\tm_iDebugStimulationsReceivedEarlier = 0;\n\tm_iDebugStimulationsReceivedLate = 0;\n\tm_iDebugStimulationsReceivedWrongSize = 0;\n\tm_iDebugStimulationsBuffered = 0;\n\n}\n\nvoid CPluginExternalStimulations::loopHook(CStimulationSet &stimulationSet, uint64 start, uint64 end)\n{\n\tif (m_bIsExternalStimulationsEnabled)\n\t{\n\t\t\/\/m_rKernelContext.getLogManager() << LogLevel_Error << \"Checking for external stimulations:\" << p << \"\\n\";\n\t\taddExternalStimulations(&stimulationSet,m_rKernelContext.getLogManager(),start,end);\n\t}\n\n}\n\nvoid CPluginExternalStimulations::stopHook()\n{\n\tif (m_bIsExternalStimulationsEnabled)\n\t{\n\t\tm_bIsESThreadRunning = false;\n\t\tm_ESthreadPtr->join();\n\t}\n\n\n\t\/\/software tagging diagnosting\n\tm_rKernelContext.getLogManager() << LogLevel_Debug << \" Total external ones received through IPC: \" << m_iDebugCurrentReadIPCStimulations << \"\\n\";\n\tm_rKernelContext.getLogManager() << LogLevel_Debug << \" Sent to Designer: \" << m_iDebugExternalStimulationsSent << \"\\n\";\n\tm_rKernelContext.getLogManager() << LogLevel_Debug << \" Lost because of invalid timestamp: \" << m_iDebugStimulationsLost << \"\\n\";\n\tm_rKernelContext.getLogManager() << LogLevel_Debug << \" Stimulations that came earlier: \" << m_iDebugStimulationsReceivedEarlier << \"\\n\";\n\tm_rKernelContext.getLogManager() << LogLevel_Debug << \" Stimulations that came later: \" << \tm_iDebugStimulationsReceivedLate << \"\\n\";\n\tm_rKernelContext.getLogManager() << LogLevel_Debug << \" Stimulations that had wrong size: \" << \tm_iDebugStimulationsReceivedWrongSize << \"\\n\";\n\tm_rKernelContext.getLogManager() << LogLevel_Debug << \" Buffered: \" << \tm_iDebugStimulationsBuffered << \"\\n\";\n\n\tint processed=0;\n\tvector<SExternalStimulation>::iterator cii;\n\tfor(cii=m_vExternalStimulations.begin(); cii!=m_vExternalStimulations.end(); cii++)\n\t{\n\t\tif (cii->isProcessed)\n\t\t\tprocessed++;\n\t}\n\tm_rKernelContext.getLogManager() << LogLevel_Debug << \" processed: \" << processed << \"\\n\";\n\t\/\/end software tagging diagnosting\n}\n\nvoid CPluginExternalStimulations::acceptNewConnectionHook()\n{\n\tm_vExternalStimulations.clear();\n}\n\n\/\/ Plugin specific methods\n\nvoid CPluginExternalStimulations::readExternalStimulations()\n{\n\tusing namespace boost::interprocess;\n\n\t\/\/std::cout << \"Creating External Stimulations thread\" << std::endl;\n\t\/\/std::cout << \"Queue Name : \" << m_sExternalStimulationsQueueName << std::endl;\n\t\/\/char mq_name[255];\n\t\/\/std::strcpy(mq_name, m_sExternalStimulationsQueueName.toASCIIString());\n\tconst int chunk_length=3;\n\tconst int pause_time=5;\n\n\tunsigned int priority;\n\tsize_t recvd_size;\n\n\tuint64 chunk[chunk_length];\n\n\twhile (m_bIsESThreadRunning)\n\t{\n\t\tbool success = false;\n\t\ttry\n\t\t{\n\t\t\t\/\/Open a message queue.\n\t\t\tmessage_queue mq\n\t\t\t\t\t(open_only \/\/only open\n\t\t\t\t\t ,m_sExternalStimulationsQueueName.toASCIIString() \/\/name\n\t\t\t\t\t \/\/,mq_name \/\/name\n\t\t\t\t\t );\n\n\t\t\tsuccess = mq.try_receive(&chunk, sizeof(chunk), recvd_size, priority);\n\t\t}\n\t\tcatch(interprocess_exception & \/* ex *\/)\n\t\t{\n\t\t\t\/\/m_bIsESThreadRunning = false;\n\t\t\t\/\/m_rKernelContext.getLogManager() << LogLevel_Error << \"Problem with message queue in external stimulations:\" << ex.what() << \"\\n\";\n\t\t\tboost::this_thread::sleep(boost::posix_time::milliseconds(pause_time));\n\t\t\tcontinue;\n\t\t}\n\n\t\tif (!success)\n\t\t{\n\t\t\tboost::this_thread::sleep(boost::posix_time::milliseconds(pause_time));\n\t\t\tcontinue;\n\t\t}\n\n\t\tm_iDebugCurrentReadIPCStimulations++;\n\n\t\tif(recvd_size != sizeof(chunk))\n\t\t{\n\t\t\t\/\/m_rKernelContext.getLogManager() << LogLevel_Error << \"Problem with type of received data when reqding external stimulation!\\n\";\n\t\t\tm_iDebugStimulationsReceivedWrongSize++;\n\t\t}\n\t\telse\n\t\t{\n\t\t\t\/\/m_rKernelContext.getLogManager() << LogLevel_Warning << \"received\\n\";\n\n\t\t\tSExternalStimulation stim;\n\n\t\t\tstim.identifier = chunk[1];\n\t\t\tuint64 received_time = chunk[2];\n\n\t\t\t\/\/1. calculate time\n\t\t\tuint64 ct_start_time_ms = (m_CTStartTime.time * 1000 + m_CTStartTime.millitm);\n\n\t\t\tint64 time_test = received_time - ct_start_time_ms;\n\n\t\t\tif (time_test<0)\n\t\t\t{\n\t\t\t\tm_iDebugStimulationsLost++;\n\t\t\t\t\/\/m_rKernelContext.getLogManager() << LogLevel_Warning << \"AS: external stimulation time is invalid, probably stimulation is before reference point, total invalid so far: \" << m_i32FlashesLost << \"\\n\";\n\t\t\t\tboost::this_thread::sleep(boost::posix_time::milliseconds(pause_time));\n\t\t\t\tcontinue; \/\/we skip this stimulation\n\t\t\t}\n\t\t\t\/\/2. Convert to OpenVibe time\n\t\t\tuint64 ct_event_time = received_time - ct_start_time_ms;\n\n\t\t\tfloat64 time = (float64)ct_event_time \/ (float64)1000;\n\n\t\t\tuint64 ov_time = ITimeArithmetics::secondsToTime(time);\n\t\t\tstim.timestamp = ov_time;\n\n\t\t\tstim.alreadyCountedAsEarlier = false;\n\n\t\t\t\/\/3. Store, the main thread will process it\n\t\t\t{\n\t\t\t\t\/\/lock\n\t\t\t\tboost::mutex::scoped_lock lock(m_es_mutex);\n\n\t\t\t\tm_vExternalStimulations.push_back(stim);\n\t\t\t\tm_iDebugStimulationsBuffered++;\n\t\t\t\tm_esAvailable.notify_one();\n\t\t\t\t\/\/unlock\n\t\t\t}\n\n\t\t\tboost::this_thread::sleep(boost::posix_time::milliseconds(pause_time));\n\n\t\t}\n\t}\n}\n\nvoid CPluginExternalStimulations::addExternalStimulations(OpenViBE::CStimulationSet* ss, OpenViBE::Kernel::ILogManager& logm,uint64 start,uint64 end)\n{\n\tuint64 duration_ms = 40;\n\t{\n\t\t\/\/lock\n\t\tboost::mutex::scoped_lock lock(m_es_mutex);\n\n\t\tvector<SExternalStimulation>::iterator cii;\n\n\t\tfor(cii=m_vExternalStimulations.begin(); cii!=m_vExternalStimulations.end(); cii++)\n\t\t{\n\t\t\tif (cii->isProcessed==true) continue;\n\n\t\t\t\/\/ if time matches current chunk being processed - send it\n\t\t\tif (cii->timestamp >= start && cii->timestamp < end)\n\t\t\t{\n\t\t\t\t\/\/flashes_in_this_time_chunk++;\n\t\t\t\t\/\/logm << LogLevel_Error << \"Stimulation added.\" << \"\\n\";\n\t\t\t\tss->appendStimulation(cii->identifier, cii->timestamp, duration_ms);\n\t\t\t\tm_iDebugExternalStimulationsSent++;\n\t\t\t\t\/\/m_vExternalStimulations.erase(cii);\n\t\t\t\tcii->isProcessed = true;\n\t\t\t}\n\t\t\telse\n\t\t\t\t\/\/the stimulation is coming too late - after the current block being processed\n\t\t\t\t\/\/we correct the timestamp to the current block and we send it\n\t\t\t\tif (cii->timestamp < start)\n\t\t\t\t{\n\t\t\t\t\tm_iDebugStimulationsReceivedLate++;\n\t\t\t\t\tss->appendStimulation(cii->identifier, start, duration_ms);\n\t\t\t\t\tm_iDebugExternalStimulationsSent++;\n\t\t\t\t\t\/\/m_vExternalStimulations.erase(cii);\n\t\t\t\t\tcii->isProcessed = true;\n\t\t\t\t}\n\t\t\t\telse \/\/stim.timestamp > end - coming before the currently processed block, so we still can put in the right place\n\t\t\t\t{\n\t\t\t\t\t\/\/save the stimulation for later\n\t\t\t\t\tif (!cii->alreadyCountedAsEarlier)\n\t\t\t\t\t{\n\t\t\t\t\t\tm_iDebugStimulationsReceivedEarlier++;\n\t\t\t\t\t\tcii->alreadyCountedAsEarlier = true;\n\t\t\t\t\t}\n\t\t\t\t\tcontinue;\n\t\t\t\t}\n\t\t}\n\n\t\tm_esAvailable.notify_one();\n\t\t\/\/unlock\n\t}\n}\n\n\nboolean CPluginExternalStimulations::setExternalStimulationsEnabled(boolean bActive)\n{\n\tm_bIsExternalStimulationsEnabled=bActive;\n\treturn true;\n}\n\nboolean CPluginExternalStimulations::isExternalStimulationsEnabled(void)\n{\n\treturn m_bIsExternalStimulationsEnabled;\n}\n<|endoftext|>"} {"text":"<commit_before>\/*-------------------------------------------------------------------------\n *\n * logger.cpp\n * file description\n *\n * Copyright(c) 2015, CMU\n *\n * \/peloton\/src\/backend\/logging\/logger.cpp\n *\n *-------------------------------------------------------------------------\n *\/\n\n#include \"backend\/logging\/logger.h\"\n\nnamespace peloton {\nnamespace logging {\n\n\/**\n * @brief Run logging_MainLoop to receive log record and flush\n *\/\nvoid Logger::logging_MainLoop(void){\n proxy->logging_MainLoop();\n}\n\n\/**\n * @brief Run logging_MainLoop to receive log record and flush\n *\/\nvoid Logger::log(LogRecord record){\n proxy->log(record);\n}\n\n\/**\n * @brief Run logging_MainLoop to receive log record and flush\n *\/\nvoid Logger::flush(void){\n proxy->flush();\n}\n\n\n\n} \/\/ namespace logging\n} \/\/ namespace peloton\n\n\n<commit_msg>Minor refactoring<commit_after>\/*-------------------------------------------------------------------------\n *\n * logger.cpp\n * file description\n *\n * Copyright(c) 2015, CMU\n *\n * \/peloton\/src\/backend\/logging\/logger.cpp\n *\n *-------------------------------------------------------------------------\n *\/\n\n#include \"backend\/logging\/logger.h\"\n\nnamespace peloton {\nnamespace logging {\n\n\/**\n * @brief Run logging_MainLoop\n *\/\nvoid Logger::logging_MainLoop(void){\n proxy->logging_MainLoop();\n}\n\n\/**\n * @brief Run log\n * @param record \n *\/\nvoid Logger::log(LogRecord record){\n proxy->log(record);\n}\n\n\/**\n * @brief Run flush\n *\/\nvoid Logger::flush(void){\n proxy->flush();\n}\n\n} \/\/ namespace logging\n} \/\/ namespace peloton\n\n\n<|endoftext|>"} {"text":"<commit_before>\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ \t\/\/\n\/\/ Ludic Game Library \t\/\/\n\/\/ Copyright (C)2014 - Michell Stuttgart Faria \t\/\/\n\/\/ Paulo Vicente Gomes dos Santos\t\t\t\t \/\/\n\/\/ Alfredo José de Paula Barbosa \/\/\n\/\/ \t\/\/\n\/\/ Ludic is a FREE SOFTWARE released under the BSD License. \t\/\/\n\/\/ \t\/\/\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n\n#pragma once\n\n#include \"ludic.hpp\"\n\nnamespace Ludic {\n\n\/**\n * @file AllegroStarter.hpp\n * @author Michell Stuttgart\n * @date 01\/09\/14\n * @class AllegroStarter\n * @brief Class responsible for initializing the basic modules \n * of the Allegro, Allegro_Image, Allegro_Font, Allegro_Audio \n * and Allegro_Primitives. \n * It is called automatically by Ludic Library \n * in early in the program. This is a class for the exclusive \n * use of the library.\n *\/\nclass AllegroStarter {\n\nprivate:\n\n\tstatic AllegroStarter instance;\n\n\t\/**\n\t* @brief Default Constructor.\n\t*\/\n\tAllegroStarter();\n\n\npublic:\n\n\t\/**\n\t * @brief Default Destructor\n\t *\/\n\tvirtual ~AllegroStarter();\n\n};\n\n} \/* sgl namespace *\/\n<commit_msg>Doxygen comment updated<commit_after>\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ \t\/\/\n\/\/ Ludic Game Library \t\/\/\n\/\/ Copyright (C)2014 - Michell Stuttgart Faria \t\/\/\n\/\/ Paulo Vicente Gomes dos Santos\t\t\t\t \/\/\n\/\/ Alfredo José de Paula Barbosa \/\/\n\/\/ \t\/\/\n\/\/ Ludic is a FREE SOFTWARE released under the BSD License. \t\/\/\n\/\/ \t\/\/\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n\n#pragma once\n\n#include \"ludic.hpp\"\n\nnamespace Ludic {\n\n\/**\n * @file AllegroStarter.hpp\n * @author Michell Stuttgart\n * @date 01\/09\/14\n * @class AllegroStarter\n * @brief Class responsible for initializing the basic modules of the Allegro.\n * \n * The basic modules are: Allegro_Image, Allegro_Font, Allegro_Audio \n * and Allegro_Primitives. \n * It is called automatically by Ludic Library \n * in early in the program. This is a class for the exclusive \n * use of the library.\n *\/\nclass AllegroStarter {\n\nprivate:\n\n\tstatic AllegroStarter instance;\n\n\t\/**\n\t* @brief Default Constructor.\n\t*\/\n\tAllegroStarter();\n\n\npublic:\n\n\t\/**\n\t * @brief Default Destructor\n\t *\/\n\tvirtual ~AllegroStarter();\n\n};\n\n} \/* sgl namespace *\/\n<|endoftext|>"} {"text":"<commit_before>\/***************************************************************************\/\/**\n * FILE : timekeeper.hpp\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 libZinc.\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) 2012\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#ifndef __ZN_TIME_KEEPER_HPP__\n#define __ZN_TIME_KEEPER_HPP__\n\n#include \"zinc\/timekeeper.h\"\n#include \"zinc\/timenotifier.hpp\"\n\nnamespace zinc\n{\n\nclass TimeKeeper\n{\nprotected:\n\tCmiss_time_keeper_id id;\n\npublic:\n\n\tTimeKeeper() : id(0)\n\t{ }\n\n\t\/\/ takes ownership of C handle, responsibility for destroying it\n\texplicit TimeKeeper(Cmiss_time_keeper_id in_time_keeper_id) :\n\t\tid(in_time_keeper_id)\n\t{ }\n\n\tTimeKeeper(const TimeKeeper& timeKeeper) :\n\t\tid(Cmiss_time_keeper_access(timeKeeper.id))\n\t{ }\n\n\tTimeKeeper& operator=(const TimeKeeper& timeKeeper)\n\t{\n\t\tCmiss_time_keeper_id temp_id = Cmiss_time_keeper_access(timeKeeper.id);\n\t\tif (0 != id)\n\t\t{\n\t\t\tCmiss_time_keeper_destroy(&id);\n\t\t}\n\t\tid = temp_id;\n\t\treturn *this;\n\t}\n\n\t~TimeKeeper()\n\t{\n\t\tif (0 != id)\n\t\t{\n\t\t\tCmiss_time_keeper_destroy(&id);\n\t\t}\n\t}\n\n\tbool isValid()\n\t{\n\t\treturn (0 != id);\n\t}\n\n\tCmiss_time_keeper_id getId()\n\t{\n\t\treturn id;\n\t}\n\n\tenum Attribute\n\t{\n\t\tATTRIBUTE_INVALID = CMISS_TIME_KEEPER_ATTRIBUTE_INVALID,\n\t\tATTRIBUTE_TIME = CMISS_TIME_KEEPER_ATTRIBUTE_TIME,\n\t\tATTRIBUTE_MINIMUM_TIME = CMISS_TIME_KEEPER_ATTRIBUTE_MINIMUM_TIME,\n\t\tATTRIBUTE_MAXIMUM_TIME = CMISS_TIME_KEEPER_ATTRIBUTE_MAXIMUM_TIME,\n\t\tATTRIBUTE_SPEED = CMISS_TIME_KEEPER_ATTRIBUTE_SPEED\n\t};\n\n\tint getAttributeReal(Attribute attribute)\n\t{\n\t\treturn Cmiss_time_keeper_get_attribute_real(id,\n\t\t\tstatic_cast<Cmiss_time_keeper_attribute>(attribute));\n\t}\n\n\tint setAttributeReal(Attribute attribute, double value)\n\t{\n\t\treturn Cmiss_time_keeper_set_attribute_real(id,\n\t\t\tstatic_cast<Cmiss_time_keeper_attribute>(attribute), value);\n\t}\n\n\tTimeNotifier createNotifierRegular(double updateFrequency, double timeOffset)\n\t{\n\t\treturn TimeNotifier(Cmiss_time_keeper_create_notifier_regular(\n\t\t\tid, updateFrequency, timeOffset));\n\t}\n\n\tint addTimeNotifier(TimeNotifier timeNotifier)\n\t{\n\t\treturn Cmiss_time_keeper_add_time_notifier(id, timeNotifier.getId());\n\t}\n\n\tint removeTimeNotifier(TimeNotifier timeNotifier)\n\t{\n\t\treturn Cmiss_time_keeper_remove_time_notifier(id, timeNotifier.getId());\n\t}\n\n};\n\n} \/\/ namespace zinc\n\n#endif \/* __ZN_TIME_KEEPER_HPP__ *\/\n<commit_msg>Removing CMISS_TIME_KEEPER_ATTRIBUTE_SPEED from the C++ API. https:\/\/tracker.physiomeproject.org\/show_bug.cgi?id=3528<commit_after>\/***************************************************************************\/\/**\n * FILE : timekeeper.hpp\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 libZinc.\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) 2012\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#ifndef __ZN_TIME_KEEPER_HPP__\n#define __ZN_TIME_KEEPER_HPP__\n\n#include \"zinc\/timekeeper.h\"\n#include \"zinc\/timenotifier.hpp\"\n\nnamespace zinc\n{\n\nclass TimeKeeper\n{\nprotected:\n\tCmiss_time_keeper_id id;\n\npublic:\n\n\tTimeKeeper() : id(0)\n\t{ }\n\n\t\/\/ takes ownership of C handle, responsibility for destroying it\n\texplicit TimeKeeper(Cmiss_time_keeper_id in_time_keeper_id) :\n\t\tid(in_time_keeper_id)\n\t{ }\n\n\tTimeKeeper(const TimeKeeper& timeKeeper) :\n\t\tid(Cmiss_time_keeper_access(timeKeeper.id))\n\t{ }\n\n\tTimeKeeper& operator=(const TimeKeeper& timeKeeper)\n\t{\n\t\tCmiss_time_keeper_id temp_id = Cmiss_time_keeper_access(timeKeeper.id);\n\t\tif (0 != id)\n\t\t{\n\t\t\tCmiss_time_keeper_destroy(&id);\n\t\t}\n\t\tid = temp_id;\n\t\treturn *this;\n\t}\n\n\t~TimeKeeper()\n\t{\n\t\tif (0 != id)\n\t\t{\n\t\t\tCmiss_time_keeper_destroy(&id);\n\t\t}\n\t}\n\n\tbool isValid()\n\t{\n\t\treturn (0 != id);\n\t}\n\n\tCmiss_time_keeper_id getId()\n\t{\n\t\treturn id;\n\t}\n\n\tenum Attribute\n\t{\n\t\tATTRIBUTE_INVALID = CMISS_TIME_KEEPER_ATTRIBUTE_INVALID,\n\t\tATTRIBUTE_TIME = CMISS_TIME_KEEPER_ATTRIBUTE_TIME,\n\t\tATTRIBUTE_MINIMUM_TIME = CMISS_TIME_KEEPER_ATTRIBUTE_MINIMUM_TIME,\n\t\tATTRIBUTE_MAXIMUM_TIME = CMISS_TIME_KEEPER_ATTRIBUTE_MAXIMUM_TIME\n\t};\n\n\tint getAttributeReal(Attribute attribute)\n\t{\n\t\treturn Cmiss_time_keeper_get_attribute_real(id,\n\t\t\tstatic_cast<Cmiss_time_keeper_attribute>(attribute));\n\t}\n\n\tint setAttributeReal(Attribute attribute, double value)\n\t{\n\t\treturn Cmiss_time_keeper_set_attribute_real(id,\n\t\t\tstatic_cast<Cmiss_time_keeper_attribute>(attribute), value);\n\t}\n\n\tTimeNotifier createNotifierRegular(double updateFrequency, double timeOffset)\n\t{\n\t\treturn TimeNotifier(Cmiss_time_keeper_create_notifier_regular(\n\t\t\tid, updateFrequency, timeOffset));\n\t}\n\n\tint addTimeNotifier(TimeNotifier timeNotifier)\n\t{\n\t\treturn Cmiss_time_keeper_add_time_notifier(id, timeNotifier.getId());\n\t}\n\n\tint removeTimeNotifier(TimeNotifier timeNotifier)\n\t{\n\t\treturn Cmiss_time_keeper_remove_time_notifier(id, timeNotifier.getId());\n\t}\n\n};\n\n} \/\/ namespace zinc\n\n#endif \/* __ZN_TIME_KEEPER_HPP__ *\/\n<|endoftext|>"} {"text":"<commit_before>\/*\n * SliderWithLabel.cpp\n * iPhoneEmptyExample\n *\n * Created by hansi on 29.01.11.\n * Copyright 2011 __MyCompanyName__. All rights reserved.\n * \n * ------------------------------\n * PLEASE READ BEFORE YOU CODE:\n * \n * This is a simple container thingie. \n * You can use it exactly like an OF main app, there are only small differences in how touch events work. \n * 1. If you don't want an event to propagate to other containers just do a \"return true;\" at then end. \n * 2. A container will only be notified of events that happen within it's bounds\n * 3. If you do a \"return true\" at the end of touchDown() your container will be remembered and will then \n * receive all moved(), doubleTap() and touchUp() events, even if they happen outside the container. \n * 4. The coordinates touch.x and touch.y are modified to match the drawing coordinate system, so 0\/0 is at the \n * left top corner of your container, not top left corner of your application. \n *\/\n\n#include \"MUI.h\"\n\nmui::SliderWithLabel::SliderWithLabel( float x_, float y_, float width_, float height_, float min_, float max_, float value_, int decimalPlaces_ ) : Container( x_, y_, width_, height_ ), decimalPlaces(decimalPlaces_), oldValue(-9999) {\n\tslider = new Slider( 0, 0, width_ - 40, height_, min_, max_, value_ );\n\tlabel = new Label( ofToString(max_), width_ - 35, 0, 35, height_ );\n\tlabel->width = label->boundingBox.width + 5;\n\tofColor col;\n\tcol.r = col.g = col.b = 0;\n\tlabel->fg = col;\n\tlabel->horizontalAlign = Right;\n\tdefaultValue = value_;\n\t\n\tadd( slider );\n\tadd( label );\n}\n\n\/\/--------------------------------------------------------------\nvoid mui::SliderWithLabel::update(){\n\tslider->width = width - 5 - label->width;\n\tslider->height = height; \n\tlabel->x = width - label->width;\n\tif( oldValue != slider->value ){\n\t\tlabel->text = ofToString( slider->value, decimalPlaces ); \n\t\tlabel->commit(); \n\t\toldValue = slider->value; \n\t}\n}\n\n\n\/\/--------------------------------------------------------------\nvoid mui::SliderWithLabel::draw(){\n}\n\n\n\/\/--------------------------------------------------------------\nvoid mui::SliderWithLabel::drawBackground(){\n}<commit_msg>fixed layout bug in sliderwithlabel (width of decimal places wasn't calculated correctly)<commit_after>\/*\n * SliderWithLabel.cpp\n * iPhoneEmptyExample\n *\n * Created by hansi on 29.01.11.\n * Copyright 2011 __MyCompanyName__. All rights reserved.\n * \n * ------------------------------\n * PLEASE READ BEFORE YOU CODE:\n * \n * This is a simple container thingie. \n * You can use it exactly like an OF main app, there are only small differences in how touch events work. \n * 1. If you don't want an event to propagate to other containers just do a \"return true;\" at then end. \n * 2. A container will only be notified of events that happen within it's bounds\n * 3. If you do a \"return true\" at the end of touchDown() your container will be remembered and will then \n * receive all moved(), doubleTap() and touchUp() events, even if they happen outside the container. \n * 4. The coordinates touch.x and touch.y are modified to match the drawing coordinate system, so 0\/0 is at the \n * left top corner of your container, not top left corner of your application. \n *\/\n\n#include \"MUI.h\"\n\nmui::SliderWithLabel::SliderWithLabel( float x_, float y_, float width_, float height_, float min_, float max_, float value_, int decimalPlaces_ ) : Container( x_, y_, width_, height_ ), decimalPlaces(decimalPlaces_), oldValue(-9999) {\n\tslider = new Slider( 0, 0, width_ - 40, height_, min_, max_, value_ );\n\tlabel = new Label( ofToString(max_,decimalPlaces), width_ - 35, 0, 35, height_ );\n\tlabel->width = label->boundingBox.width + 5;\n\tofColor col;\n\tcol.r = col.g = col.b = 0;\n\tlabel->fg = col;\n\tlabel->horizontalAlign = Right;\n\tdefaultValue = value_;\n\t\n\tadd( slider );\n\tadd( label );\n}\n\n\/\/--------------------------------------------------------------\nvoid mui::SliderWithLabel::update(){\n\tslider->width = width - 5 - label->width;\n\tslider->height = height; \n\tlabel->x = width - label->width;\n\tif( oldValue != slider->value ){\n\t\tlabel->text = ofToString( slider->value, decimalPlaces ); \n\t\tlabel->commit(); \n\t\toldValue = slider->value; \n\t}\n}\n\n\n\/\/--------------------------------------------------------------\nvoid mui::SliderWithLabel::draw(){\n}\n\n\n\/\/--------------------------------------------------------------\nvoid mui::SliderWithLabel::drawBackground(){\n}<|endoftext|>"} {"text":"<commit_before>#if defined(WINVER)\n#include <windows.h>\n#endif\n\n#ifdef __DJGPP__\n#else\nconst long UCLOCKS_PER_SEC = 1000;\n\nlong uclock();\n\n#endif\n\n#include <string>\n#include <cstring>\n#include <cstdlib>\n#include <cstdio>\n#include <cmath>\n#include <functional>\n#include <unordered_map>\n#include <memory>\n#include <utility>\n#include <map>\n#include <algorithm>\n#include <chrono>\n\n#ifdef __EMSCRIPTEN__\n#include <emscripten\/html5.h>\n#include <emscripten\/emscripten.h>\n#endif\n\nenum class ESoundDriver {\n kNone, kPcSpeaker, kOpl2Lpt, kAdlib, kTandy, kCovox\n};\n\nESoundDriver soundDriver = ESoundDriver::kNone;\nvoid initOPL2(int port);\nvoid playTune(const std::string &);\n\n\/\/\/game interface\nvoid init();\nvoid loopTick(long ms);\nvoid shutdown();\nbool isPlaying();\n\/\/\/\n#ifdef __EMSCRIPTEN__\nvoid emscriptenLoopTick() {\n loopTick(50);\n}\n#endif\n\n#ifdef __APPLE__\nint main(int argc, char **argv) {\n#else\n\n#if defined(WINVER)\n\nnamespace odb {\n LRESULT CALLBACK WindProcedure(HWND hWnd, UINT Msg, WPARAM wParam, LPARAM lParam);\n}\n\n\n\nint WINAPI WinMain(HINSTANCE hInstance, HINSTANCE hPrevInstance,\n LPSTR lpCmdLine, int nCmdShow)\n{\n\n HINSTANCE hInst;\n\n WNDCLASSEX WndCls;\n static char szAppName[] = \"DungeonsOfNoudar95\";\n MSG Msg;\n\n hInst = hInstance;\n WndCls.cbSize = sizeof(WndCls);\n WndCls.style = CS_OWNDC | CS_VREDRAW | CS_HREDRAW;\n WndCls.lpfnWndProc = odb::WindProcedure;\n WndCls.cbClsExtra = 0;\n WndCls.cbWndExtra = 0;\n WndCls.hInstance = hInst;\n WndCls.hIcon = LoadIcon(NULL, IDI_APPLICATION);\n WndCls.hCursor = LoadCursor(NULL, IDC_ARROW);\n WndCls.hbrBackground = (HBRUSH) GetStockObject(WHITE_BRUSH);\n WndCls.lpszMenuName = NULL;\n WndCls.lpszClassName = szAppName;\n WndCls.hIconSm = LoadIcon(hInstance, IDI_APPLICATION);\n RegisterClassEx(&WndCls);\n\n CreateWindowEx(WS_EX_OVERLAPPEDWINDOW,\n szAppName,\n \"Dungeons of Noudar 95\",\n WS_OVERLAPPEDWINDOW | WS_VISIBLE,\n CW_USEDEFAULT,\n CW_USEDEFAULT,\n 320,\n 240,\n NULL,\n NULL,\n hInstance,\n NULL);\n\n#else\n\nint main(int argc, char **argv) {\n puts(\"Dungeons of Noudar 3D startup.\\nCopyright 2016-2020 Brotherhood of 13h.\");\n\n if (argc >= 2) {\n if (!std::strcmp(argv[1], \"opl2lpt\")) {\n soundDriver = ESoundDriver::kOpl2Lpt;\n initOPL2(-1);\n playTune(\"t200i101o1a\");\n } else if (!std::strcmp(argv[1], \"adlib\")) {\n soundDriver = ESoundDriver::kAdlib;\n initOPL2(0x0388);\n playTune(\"t200i101o1a\");\n } else if (!std::strcmp(argv[1], \"pcspeaker\")) {\n soundDriver = ESoundDriver::kPcSpeaker;\n }\n }\n#endif\n\n#endif\n\n init();\n\n#ifdef __EMSCRIPTEN__\n emscripten_set_main_loop(emscriptenLoopTick, 20, 1);\n#else\n clock_t diff = 0;\n\n while (isPlaying()) {\n clock_t t0 = 0;\n clock_t t1 = 0;\n\n t0 = uclock();\n\n loopTick(diff);\n\n t1 = uclock();\n\n diff = (1000 * (t1 - t0)) \/ UCLOCKS_PER_SEC;\n\n if (diff == 0) {\n diff = 1;\n }\n }\n#endif\n\n shutdown();\n\n return 0;\n}\n<commit_msg>Add a very simply sound driver selection menu to DOS versions startup<commit_after>#if defined(WINVER)\n#include <windows.h>\n#endif\n\n#ifdef __DJGPP__\n#include <conio.h>\n#include <dpmi.h>\n#include <go32.h>\n#include <pc.h>\n#include <bios.h>\n#else\nconst long UCLOCKS_PER_SEC = 1000;\n\nlong uclock();\n\n#endif\n\n#include <string>\n#include <cstring>\n#include <cstdlib>\n#include <cstdio>\n#include <cmath>\n#include <functional>\n#include <unordered_map>\n#include <memory>\n#include <utility>\n#include <map>\n#include <algorithm>\n#include <chrono>\n\n#ifdef __EMSCRIPTEN__\n#include <emscripten\/html5.h>\n#include <emscripten\/emscripten.h>\n#endif\n\nenum class ESoundDriver {\n kNone, kPcSpeaker, kOpl2Lpt, kAdlib, kTandy, kCovox\n};\n\nESoundDriver soundDriver = ESoundDriver::kNone;\nvoid initOPL2(int port);\nvoid playTune(const std::string &);\n\n\/\/\/game interface\nvoid init();\nvoid loopTick(long ms);\nvoid shutdown();\nbool isPlaying();\n\/\/\/\n#ifdef __EMSCRIPTEN__\nvoid emscriptenLoopTick() {\n loopTick(50);\n}\n#endif\n\n#ifdef __APPLE__\nint main(int argc, char **argv) {\n#else\n\n#if defined(WINVER)\n\nnamespace odb {\n LRESULT CALLBACK WindProcedure(HWND hWnd, UINT Msg, WPARAM wParam, LPARAM lParam);\n}\n\n\n\nint WINAPI WinMain(HINSTANCE hInstance, HINSTANCE hPrevInstance,\n LPSTR lpCmdLine, int nCmdShow)\n{\n\n HINSTANCE hInst;\n\n WNDCLASSEX WndCls;\n static char szAppName[] = \"DungeonsOfNoudar95\";\n MSG Msg;\n\n hInst = hInstance;\n WndCls.cbSize = sizeof(WndCls);\n WndCls.style = CS_OWNDC | CS_VREDRAW | CS_HREDRAW;\n WndCls.lpfnWndProc = odb::WindProcedure;\n WndCls.cbClsExtra = 0;\n WndCls.cbWndExtra = 0;\n WndCls.hInstance = hInst;\n WndCls.hIcon = LoadIcon(NULL, IDI_APPLICATION);\n WndCls.hCursor = LoadCursor(NULL, IDC_ARROW);\n WndCls.hbrBackground = (HBRUSH) GetStockObject(WHITE_BRUSH);\n WndCls.lpszMenuName = NULL;\n WndCls.lpszClassName = szAppName;\n WndCls.hIconSm = LoadIcon(hInstance, IDI_APPLICATION);\n RegisterClassEx(&WndCls);\n\n CreateWindowEx(WS_EX_OVERLAPPEDWINDOW,\n szAppName,\n \"Dungeons of Noudar 95\",\n WS_OVERLAPPEDWINDOW | WS_VISIBLE,\n CW_USEDEFAULT,\n CW_USEDEFAULT,\n 320,\n 240,\n NULL,\n NULL,\n hInstance,\n NULL);\n\n#else\n\nint main(int argc, char **argv) {\n puts(\"\\n\\nDungeons of Noudar 3D startup.\\nCopyright 2016-2022 Brotherhood of 13h.\");\n\n if (argc >= 2) {\n if (!std::strcmp(argv[1], \"opl2lpt\")) {\n soundDriver = ESoundDriver::kOpl2Lpt;\n initOPL2(-1);\n playTune(\"t200i101o1a\");\n } else if (!std::strcmp(argv[1], \"adlib\")) {\n soundDriver = ESoundDriver::kAdlib;\n initOPL2(0x0388);\n playTune(\"t200i101o1a\");\n } else if (!std::strcmp(argv[1], \"pcspeaker\")) {\n soundDriver = ESoundDriver::kPcSpeaker;\n }\n } else {\n puts(\"\\n\\nPlease select a sound driver:\");\n puts(\"1 - PC Speaker\");\n puts(\"2 - Adlib\");\n puts(\"3 - OPL2LPT on LPT1\");\n puts(\"4 - No sound\");\n puts(\"5 - Quit\");\n\n uint8_t selection = getch();\n\n switch( selection ) {\n case '1':\n soundDriver = ESoundDriver::kPcSpeaker;\n break;\n\n case '2':\n soundDriver = ESoundDriver::kAdlib;\n initOPL2(0x0388);\n playTune(\"t200i101o1a\");\n break;\n\n case '3':\n soundDriver = ESoundDriver::kOpl2Lpt;\n initOPL2(-1);\n playTune(\"t200i101o1a\");\n break;\n\n case '4':\n break;\n case '5':\n exit(0);\n return 0;\n }\n }\n#endif\n\n#endif\n\n init();\n\n#ifdef __EMSCRIPTEN__\n emscripten_set_main_loop(emscriptenLoopTick, 20, 1);\n#else\n clock_t diff = 0;\n\n while (isPlaying()) {\n clock_t t0 = 0;\n clock_t t1 = 0;\n\n t0 = uclock();\n\n loopTick(diff);\n\n t1 = uclock();\n\n diff = (1000 * (t1 - t0)) \/ UCLOCKS_PER_SEC;\n\n if (diff == 0) {\n diff = 1;\n }\n }\n#endif\n\n shutdown();\n\n return 0;\n}\n<|endoftext|>"} {"text":"<commit_before>#include <gtest\/gtest.h>\n#include <fstream>\n#include <vector>\n#include <string>\n#include <sstream>\n#include <stego-crypt-lib\/stego-crypt-lib.hh>\n\nTEST(StegStub, oneEqualsone) {\n int one = 1;\n EXPECT_EQ(1, one);\n}\n\nTEST(BmpTests, Validation) {\n std::ifstream ifs(\"test\/stego-crypt\/test.bmp\", std::ios::binary);\n std::ostringstream ost;\n ost << ifs.rdbuf();\n std::string bmp(ost.str());\n EXPECT_EQ(true, is_bmp_valid(bmp));\n}\n\nTEST(BmpTests, Open) {\n bmp_t bmp = open_bmp(\"test\/stego-crypt\/test.bmp\");\n EXPECT_EQ(true, is_bmp_valid(bmp));\n}\n\nTEST(BmpTests, BitsPerPixel) {\n bmp_t bmp = open_bmp(\"test\/stego-crypt\/test.bmp\");\n EXPECT_EQ(8, bmp_bits_per_pixel(bmp));\n}\n\nTEST(BmpTests, ImageOffset) {\n bmp_t bmp = open_bmp(\"test\/stego-crypt\/test.bmp\");\n unsigned offset = bmp_image_offset(bmp);\n \/\/ test.bmp is 8-bit and is 512*512\n EXPECT_EQ(512*512, bmp.size() - offset);\n}\n<commit_msg>Wrote failing tests for bmp height and width<commit_after>#include <gtest\/gtest.h>\n#include <fstream>\n#include <vector>\n#include <string>\n#include <sstream>\n#include <stego-crypt-lib\/stego-crypt-lib.hh>\n\nTEST(StegStub, oneEqualsone) {\n int one = 1;\n EXPECT_EQ(1, one);\n}\n\nTEST(BmpTests, Validation) {\n std::ifstream ifs(\"test\/stego-crypt\/test.bmp\", std::ios::binary);\n std::ostringstream ost;\n ost << ifs.rdbuf();\n std::string bmp(ost.str());\n EXPECT_EQ(true, is_bmp_valid(bmp));\n}\n\nTEST(BmpTests, Open) {\n bmp_t bmp = open_bmp(\"test\/stego-crypt\/test.bmp\");\n EXPECT_EQ(true, is_bmp_valid(bmp));\n}\n\nTEST(BmpTests, BitsPerPixel) {\n bmp_t bmp = open_bmp(\"test\/stego-crypt\/test.bmp\");\n EXPECT_EQ(8, bmp_bits_per_pixel(bmp));\n}\n\nTEST(BmpTests, Dimensions) {\n bmp_t bmp = open_bmp(\"test\/stego-crypt\/test.bmp\");\n EXPECT_EQ(512, bmp_width(bmp));\n EXPECT_EQ(512, bmp_height(bmp));\n}\n\nTEST(BmpTests, ImageOffset) {\n bmp_t bmp = open_bmp(\"test\/stego-crypt\/test.bmp\");\n unsigned offset = bmp_image_offset(bmp);\n \/\/ test.bmp is 8-bit and is 512*512\n EXPECT_EQ(512*512, bmp.size() - offset);\n}\n<|endoftext|>"} {"text":"<commit_before>\/* +---------------------------------------------------------------------------+\n | The Mobile Robot Programming Toolkit (MRPT) |\n | |\n | http:\/\/www.mrpt.org\/ |\n | |\n | Copyright (c) 2005-2013, Individual contributors, see AUTHORS file |\n | Copyright (c) 2005-2013, MAPIR group, University of Malaga |\n | Copyright (c) 2012-2013, University of Almeria |\n | All rights 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 copyright holders 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 LIMITED |\n | TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR|\n | PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDERS 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) |\n | HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, |\n | STRICT 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 <mrpt\/hwdrivers\/CSickLaserSerial.h>\n#include <mrpt\/gui.h>\n#include <mrpt\/maps.h>\n\nusing namespace mrpt;\nusing namespace mrpt::utils;\nusing namespace mrpt::slam;\nusing namespace mrpt::gui;\nusing namespace mrpt::opengl;\nusing namespace mrpt::hwdrivers;\nusing namespace std;\n\n\nstring SERIAL_NAME;\t\/\/ Name of the serial port to open\n\n\/\/ ------------------------------------------------------\n\/\/\t\t\t\tTest_PLS\n\/\/ ------------------------------------------------------\nvoid TestPLS()\n{\n\tCSickLaserSerial\tlaser;\n\n\tcout << \"SICK LMS thru serial port test application.\" << endl << endl;\n\n\tif (SERIAL_NAME.empty())\n\t{\n cout << \"Enter the serial port name (e.g. COM1, ttyS0, ttyUSB0, ttyACM0): \";\n getline(cin,SERIAL_NAME);\n\t}\n\telse\n\t{\n cout << \"Using serial port: \" << SERIAL_NAME << endl;\n\t}\n\n\tlaser.setSerialPort(SERIAL_NAME);\n\n#if 1\n\tlaser.setBaudRate(500000);\n\t\/\/laser.setBaudRate(38400);\n\tlaser.setScanFOV(180);\n\tlaser.setScanResolution(50); \/\/ 25=0.25deg, 50=0.5deg, 100=1deg\n\t\/\/laser.setMillimeterMode(true);\n#endif\n\n\n#if MRPT_HAS_WXWIDGETS\n\tCDisplayWindowPlots\t\twin(\"Laser scans\");\n#endif\n\n\t\/\/ Load config:\n\t\/\/laser.loadConfig( CConfigFile( \".\/LASER_SCAN_TEST.ini\") ,\"PLS#1\" );\n\n\tcout << \"Trying to initialize the laser...\" << endl;\n\tlaser.initialize(); \/\/ This will raise an exception on error\n\tcout << \"Initialized OK!\" << endl;\n\n\twhile (!mrpt::system::os::kbhit())\n\t{\n\t\tbool\t\t\t\t\t\tthereIsObservation,hardError;\n\t\tCObservation2DRangeScan\t\tobs;\n\n\t\ttry\n\t\t{\n\t\t\tlaser.doProcessSimple( thereIsObservation, obs, hardError );\n\t\t}\n\t\tcatch (std::exception &e)\n\t\t{\n\t\t\tcerr << e.what() << endl;\n\t\t\thardError = true;\n\t\t}\n\n\t\tif (hardError)\n\t\t\tprintf(\"[TEST] Hardware error=true!!\\n\");\n\n\t\tif (thereIsObservation)\n\t\t{\n\t\t\tprintf(\"[TEST] Observation received (%u ranges over %.02fdeg, mid=%.03f)!!\\n\",\n\t\t\t\t(unsigned int)obs.scan.size(),\n\t\t\t\tRAD2DEG(obs.aperture),\n\t\t\t\tobs.scan[obs.scan.size()\/2]);\n\n\t\t\tobs.sensorPose = CPose3D(0,0,0);\n\t\t\tmrpt::slam::CSimplePointsMap\t\ttheMap;\n\t\t\ttheMap.insertionOptions.minDistBetweenLaserPoints\t= 0;\n\t\t\ttheMap.insertObservation( &obs );\n\n#if MRPT_HAS_WXWIDGETS\n\t\t\tvector_float\txs,ys,zs;\n\t\t\ttheMap.getAllPoints(xs,ys,zs);\n\t\t\twin.plot(xs,ys,\".b3\");\n\t\t\twin.axis_equal();\n#endif\n\t\t}\n\t\tmrpt::system::sleep(15);\n\t};\n\n\tlaser.turnOff();\n}\n\nint main(int argc, char **argv)\n{\n\ttry\n\t{\n\t if (argc>1)\n {\n SERIAL_NAME = string(argv[1]);\n }\n\n\t\tTestPLS();\n\t\treturn 0;\n\n\t} catch (std::exception &e)\n\t{\n\t\tstd::cout << \"EXCEPCION: \" << e.what() << std::endl;\n\t\treturn -1;\n\t}\n\tcatch (...)\n\t{\n\t\tprintf(\"Another exception!!\");\n\t\treturn -1;\n\t}\n\n}\n\n<commit_msg>SICK laser example: more common parameters by default<commit_after>\/* +---------------------------------------------------------------------------+\n | The Mobile Robot Programming Toolkit (MRPT) |\n | |\n | http:\/\/www.mrpt.org\/ |\n | |\n | Copyright (c) 2005-2013, Individual contributors, see AUTHORS file |\n | Copyright (c) 2005-2013, MAPIR group, University of Malaga |\n | Copyright (c) 2012-2013, University of Almeria |\n | All rights 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 copyright holders 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 LIMITED |\n | TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR|\n | PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDERS 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) |\n | HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, |\n | STRICT 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 <mrpt\/hwdrivers\/CSickLaserSerial.h>\n#include <mrpt\/gui.h>\n#include <mrpt\/maps.h>\n\nusing namespace mrpt;\nusing namespace mrpt::utils;\nusing namespace mrpt::slam;\nusing namespace mrpt::gui;\nusing namespace mrpt::opengl;\nusing namespace mrpt::hwdrivers;\nusing namespace std;\n\n\nstring SERIAL_NAME;\t\/\/ Name of the serial port to open\n\n\/\/ ------------------------------------------------------\n\/\/\t\t\t\tTest_PLS\n\/\/ ------------------------------------------------------\nvoid TestPLS()\n{\n\tCSickLaserSerial\tlaser;\n\n\tcout << \"SICK LMS thru serial port test application.\" << endl << endl;\n\n\tif (SERIAL_NAME.empty())\n\t{\n cout << \"Enter the serial port name (e.g. COM1, ttyS0, ttyUSB0, ttyACM0): \";\n getline(cin,SERIAL_NAME);\n\t}\n\telse\n\t{\n cout << \"Using serial port: \" << SERIAL_NAME << endl;\n\t}\n\n\tlaser.setSerialPort(SERIAL_NAME);\n\n#if 1\n\t\/\/laser.setBaudRate(500000);\n\tlaser.setBaudRate(9600);\n\tlaser.setScanFOV(180);\n\tlaser.setScanResolution(50); \/\/ 25=0.25deg, 50=0.5deg, 100=1deg\n\t\/\/laser.setMillimeterMode(true);\n#endif\n\n\n#if MRPT_HAS_WXWIDGETS\n\tCDisplayWindowPlots\t\twin(\"Laser scans\");\n#endif\n\n\t\/\/ Load config:\n\t\/\/laser.loadConfig( CConfigFile( \".\/LASER_SCAN_TEST.ini\") ,\"PLS#1\" );\n\n\tcout << \"Trying to initialize the laser...\" << endl;\n\tlaser.initialize(); \/\/ This will raise an exception on error\n\tcout << \"Initialized OK!\" << endl;\n\n\twhile (!mrpt::system::os::kbhit())\n\t{\n\t\tbool\t\t\t\t\t\tthereIsObservation,hardError;\n\t\tCObservation2DRangeScan\t\tobs;\n\n\t\ttry\n\t\t{\n\t\t\tlaser.doProcessSimple( thereIsObservation, obs, hardError );\n\t\t}\n\t\tcatch (std::exception &e)\n\t\t{\n\t\t\tcerr << e.what() << endl;\n\t\t\thardError = true;\n\t\t}\n\n\t\tif (hardError)\n\t\t\tprintf(\"[TEST] Hardware error=true!!\\n\");\n\n\t\tif (thereIsObservation)\n\t\t{\n\t\t\tprintf(\"[TEST] Observation received (%u ranges over %.02fdeg, mid=%.03f)!!\\n\",\n\t\t\t\t(unsigned int)obs.scan.size(),\n\t\t\t\tRAD2DEG(obs.aperture),\n\t\t\t\tobs.scan[obs.scan.size()\/2]);\n\n\t\t\tobs.sensorPose = CPose3D(0,0,0);\n\t\t\tmrpt::slam::CSimplePointsMap\t\ttheMap;\n\t\t\ttheMap.insertionOptions.minDistBetweenLaserPoints\t= 0;\n\t\t\ttheMap.insertObservation( &obs );\n\n#if MRPT_HAS_WXWIDGETS\n\t\t\tvector_float\txs,ys,zs;\n\t\t\ttheMap.getAllPoints(xs,ys,zs);\n\t\t\twin.plot(xs,ys,\".b3\");\n\t\t\twin.axis_equal();\n#endif\n\t\t}\n\t\tmrpt::system::sleep(15);\n\t};\n\n\tlaser.turnOff();\n}\n\nint main(int argc, char **argv)\n{\n\ttry\n\t{\n\t if (argc>1)\n {\n SERIAL_NAME = string(argv[1]);\n }\n\n\t\tTestPLS();\n\t\treturn 0;\n\n\t} catch (std::exception &e)\n\t{\n\t\tstd::cout << \"EXCEPCION: \" << e.what() << std::endl;\n\t\treturn -1;\n\t}\n\tcatch (...)\n\t{\n\t\tprintf(\"Another exception!!\");\n\t\treturn -1;\n\t}\n\n}\n\n<|endoftext|>"} {"text":"<commit_before>\/*\n * Copyright (c) 2016, Alliance for Open Media. All rights reserved\n *\n * This source code is subject to the terms of the BSD 2 Clause License and\n * the Alliance for Open Media Patent License 1.0. If the BSD 2 Clause License\n * was not distributed with this source code in the LICENSE file, you can\n * obtain it at www.aomedia.org\/license\/software. If the Alliance for Open\n * Media Patent License 1.0 was not distributed with this source code in the\n * PATENTS file, you can obtain it at www.aomedia.org\/license\/patent.\n*\/\n\n#include <math.h>\n#include <stdlib.h>\n#include <string.h>\n\n#include \"third_party\/googletest\/src\/include\/gtest\/gtest.h\"\n\n#include \".\/av1_rtcd.h\"\n#include \".\/aom_dsp_rtcd.h\"\n#include \"test\/acm_random.h\"\n#include \"test\/clear_system_state.h\"\n#include \"test\/register_state_check.h\"\n#include \"test\/util.h\"\n#include \"av1\/common\/blockd.h\"\n#include \"av1\/common\/scan.h\"\n#include \"aom\/aom_integer.h\"\n#include \"av1\/common\/av1_inv_txfm.h\"\n\nusing libaom_test::ACMRandom;\n\nnamespace {\nconst double PI = 3.141592653589793238462643383279502884;\nconst double kInvSqrt2 = 0.707106781186547524400844362104;\n\nvoid reference_idct_1d(const double *in, double *out, int size) {\n for (int n = 0; n < size; ++n) {\n out[n] = 0;\n for (int k = 0; k < size; ++k) {\n if (k == 0)\n out[n] += kInvSqrt2 * in[k] * cos(PI * (2 * n + 1) * k \/ (2 * size));\n else\n out[n] += in[k] * cos(PI * (2 * n + 1) * k \/ (2 * size));\n }\n }\n}\n\ntypedef void (*IdctFuncRef)(const double *in, double *out, int size);\ntypedef void (*IdctFunc)(const tran_low_t *in, tran_low_t *out);\n\nclass TransTestBase {\n public:\n virtual ~TransTestBase() {}\n\n protected:\n void RunInvAccuracyCheck() {\n tran_low_t *input = new tran_low_t[txfm_size_];\n tran_low_t *output = new tran_low_t[txfm_size_];\n double *ref_input = new double[txfm_size_];\n double *ref_output = new double[txfm_size_];\n\n ACMRandom rnd(ACMRandom::DeterministicSeed());\n const int count_test_block = 5000;\n for (int ti = 0; ti < count_test_block; ++ti) {\n for (int ni = 0; ni < txfm_size_; ++ni) {\n input[ni] = rnd.Rand8() - rnd.Rand8();\n ref_input[ni] = static_cast<double>(input[ni]);\n }\n\n fwd_txfm_(input, output);\n fwd_txfm_ref_(ref_input, ref_output, txfm_size_);\n\n for (int ni = 0; ni < txfm_size_; ++ni) {\n EXPECT_LE(\n abs(output[ni] - static_cast<tran_low_t>(round(ref_output[ni]))),\n max_error_);\n }\n }\n\n delete[] input;\n delete[] output;\n delete[] ref_input;\n delete[] ref_output;\n }\n\n double max_error_;\n int txfm_size_;\n IdctFunc fwd_txfm_;\n IdctFuncRef fwd_txfm_ref_;\n};\n\ntypedef std::tr1::tuple<IdctFunc, IdctFuncRef, int, int> IdctParam;\nclass AV1InvTxfm : public TransTestBase,\n public ::testing::TestWithParam<IdctParam> {\n public:\n virtual void SetUp() {\n fwd_txfm_ = GET_PARAM(0);\n fwd_txfm_ref_ = GET_PARAM(1);\n txfm_size_ = GET_PARAM(2);\n max_error_ = GET_PARAM(3);\n }\n virtual void TearDown() {}\n};\n\nTEST_P(AV1InvTxfm, RunInvAccuracyCheck) { RunInvAccuracyCheck(); }\n\nINSTANTIATE_TEST_CASE_P(\n C, AV1InvTxfm,\n ::testing::Values(IdctParam(&av1_idct4_c, &reference_idct_1d, 4, 1),\n IdctParam(&av1_idct8_c, &reference_idct_1d, 8, 2),\n IdctParam(&av1_idct16_c, &reference_idct_1d, 16, 4),\n IdctParam(&av1_idct32_c, &reference_idct_1d, 32, 6)));\n\ntypedef void (*FwdTxfmFunc)(const int16_t *in, tran_low_t *out, int stride);\ntypedef void (*InvTxfmFunc)(const tran_low_t *in, uint8_t *out, int stride);\ntypedef std::tr1::tuple<FwdTxfmFunc, InvTxfmFunc, InvTxfmFunc, TX_SIZE, int>\n PartialInvTxfmParam;\nconst int kMaxNumCoeffs = 1024;\nclass AV1PartialIDctTest\n : public ::testing::TestWithParam<PartialInvTxfmParam> {\n public:\n virtual ~AV1PartialIDctTest() {}\n virtual void SetUp() {\n ftxfm_ = GET_PARAM(0);\n full_itxfm_ = GET_PARAM(1);\n partial_itxfm_ = GET_PARAM(2);\n tx_size_ = GET_PARAM(3);\n last_nonzero_ = GET_PARAM(4);\n }\n\n virtual void TearDown() { libaom_test::ClearSystemState(); }\n\n protected:\n int last_nonzero_;\n TX_SIZE tx_size_;\n FwdTxfmFunc ftxfm_;\n InvTxfmFunc full_itxfm_;\n InvTxfmFunc partial_itxfm_;\n};\n\nTEST_P(AV1PartialIDctTest, RunQuantCheck) {\n ACMRandom rnd(ACMRandom::DeterministicSeed());\n int size;\n switch (tx_size_) {\n case TX_4X4: size = 4; break;\n case TX_8X8: size = 8; break;\n case TX_16X16: size = 16; break;\n case TX_32X32: size = 32; break;\n default: FAIL() << \"Wrong Size!\"; break;\n }\n DECLARE_ALIGNED(16, tran_low_t, test_coef_block1[kMaxNumCoeffs]);\n DECLARE_ALIGNED(16, tran_low_t, test_coef_block2[kMaxNumCoeffs]);\n DECLARE_ALIGNED(16, uint8_t, dst1[kMaxNumCoeffs]);\n DECLARE_ALIGNED(16, uint8_t, dst2[kMaxNumCoeffs]);\n\n const int count_test_block = 1000;\n const int block_size = size * size;\n\n DECLARE_ALIGNED(16, int16_t, input_extreme_block[kMaxNumCoeffs]);\n DECLARE_ALIGNED(16, tran_low_t, output_ref_block[kMaxNumCoeffs]);\n\n int max_error = 0;\n for (int i = 0; i < count_test_block; ++i) {\n \/\/ clear out destination buffer\n memset(dst1, 0, sizeof(*dst1) * block_size);\n memset(dst2, 0, sizeof(*dst2) * block_size);\n memset(test_coef_block1, 0, sizeof(*test_coef_block1) * block_size);\n memset(test_coef_block2, 0, sizeof(*test_coef_block2) * block_size);\n\n ACMRandom rnd(ACMRandom::DeterministicSeed());\n\n for (int i = 0; i < count_test_block; ++i) {\n \/\/ Initialize a test block with input range [-255, 255].\n if (i == 0) {\n for (int j = 0; j < block_size; ++j) input_extreme_block[j] = 255;\n } else if (i == 1) {\n for (int j = 0; j < block_size; ++j) input_extreme_block[j] = -255;\n } else {\n for (int j = 0; j < block_size; ++j) {\n input_extreme_block[j] = rnd.Rand8() % 2 ? 255 : -255;\n }\n }\n\n ftxfm_(input_extreme_block, output_ref_block, size);\n\n \/\/ quantization with maximum allowed step sizes\n test_coef_block1[0] = (output_ref_block[0] \/ 1336) * 1336;\n for (int j = 1; j < last_nonzero_; ++j)\n test_coef_block1[av1_default_scan_orders[tx_size_].scan[j]] =\n (output_ref_block[j] \/ 1828) * 1828;\n }\n\n ASM_REGISTER_STATE_CHECK(full_itxfm_(test_coef_block1, dst1, size));\n ASM_REGISTER_STATE_CHECK(partial_itxfm_(test_coef_block1, dst2, size));\n\n for (int j = 0; j < block_size; ++j) {\n const int diff = dst1[j] - dst2[j];\n const int error = diff * diff;\n if (max_error < error) max_error = error;\n }\n }\n\n EXPECT_EQ(0, max_error)\n << \"Error: partial inverse transform produces different results\";\n}\n\nTEST_P(AV1PartialIDctTest, ResultsMatch) {\n ACMRandom rnd(ACMRandom::DeterministicSeed());\n int size;\n switch (tx_size_) {\n case TX_4X4: size = 4; break;\n case TX_8X8: size = 8; break;\n case TX_16X16: size = 16; break;\n case TX_32X32: size = 32; break;\n default: FAIL() << \"Wrong Size!\"; break;\n }\n DECLARE_ALIGNED(16, tran_low_t, test_coef_block1[kMaxNumCoeffs]);\n DECLARE_ALIGNED(16, tran_low_t, test_coef_block2[kMaxNumCoeffs]);\n DECLARE_ALIGNED(16, uint8_t, dst1[kMaxNumCoeffs]);\n DECLARE_ALIGNED(16, uint8_t, dst2[kMaxNumCoeffs]);\n const int count_test_block = 1000;\n const int max_coeff = 32766 \/ 4;\n const int block_size = size * size;\n int max_error = 0;\n for (int i = 0; i < count_test_block; ++i) {\n \/\/ clear out destination buffer\n memset(dst1, 0, sizeof(*dst1) * block_size);\n memset(dst2, 0, sizeof(*dst2) * block_size);\n memset(test_coef_block1, 0, sizeof(*test_coef_block1) * block_size);\n memset(test_coef_block2, 0, sizeof(*test_coef_block2) * block_size);\n int max_energy_leftover = max_coeff * max_coeff;\n for (int j = 0; j < last_nonzero_; ++j) {\n int16_t coef = static_cast<int16_t>(sqrt(1.0 * max_energy_leftover) *\n (rnd.Rand16() - 32768) \/ 65536);\n max_energy_leftover -= coef * coef;\n if (max_energy_leftover < 0) {\n max_energy_leftover = 0;\n coef = 0;\n }\n test_coef_block1[av1_default_scan_orders[tx_size_].scan[j]] = coef;\n }\n\n memcpy(test_coef_block2, test_coef_block1,\n sizeof(*test_coef_block2) * block_size);\n\n ASM_REGISTER_STATE_CHECK(full_itxfm_(test_coef_block1, dst1, size));\n ASM_REGISTER_STATE_CHECK(partial_itxfm_(test_coef_block2, dst2, size));\n\n for (int j = 0; j < block_size; ++j) {\n const int diff = dst1[j] - dst2[j];\n const int error = diff * diff;\n if (max_error < error) max_error = error;\n }\n }\n\n EXPECT_EQ(0, max_error)\n << \"Error: partial inverse transform produces different results\";\n}\nusing std::tr1::make_tuple;\n\nINSTANTIATE_TEST_CASE_P(\n C, AV1PartialIDctTest,\n ::testing::Values(make_tuple(&aom_fdct32x32_c, &av1_idct32x32_1024_add_c,\n &av1_idct32x32_34_add_c, TX_32X32, 34),\n make_tuple(&aom_fdct32x32_c, &av1_idct32x32_1024_add_c,\n &av1_idct32x32_1_add_c, TX_32X32, 1),\n make_tuple(&aom_fdct16x16_c, &av1_idct16x16_256_add_c,\n &av1_idct16x16_10_add_c, TX_16X16, 10),\n make_tuple(&aom_fdct16x16_c, &av1_idct16x16_256_add_c,\n &av1_idct16x16_1_add_c, TX_16X16, 1),\n make_tuple(&aom_fdct8x8_c, &av1_idct8x8_64_add_c,\n &av1_idct8x8_12_add_c, TX_8X8, 12),\n make_tuple(&aom_fdct8x8_c, &av1_idct8x8_64_add_c,\n &av1_idct8x8_1_add_c, TX_8X8, 1),\n make_tuple(&aom_fdct4x4_c, &av1_idct4x4_16_add_c,\n &av1_idct4x4_1_add_c, TX_4X4, 1)));\n} \/\/ namespace\n<commit_msg>av1_inv_txfm_test: fix decode-only build<commit_after>\/*\n * Copyright (c) 2016, Alliance for Open Media. All rights reserved\n *\n * This source code is subject to the terms of the BSD 2 Clause License and\n * the Alliance for Open Media Patent License 1.0. If the BSD 2 Clause License\n * was not distributed with this source code in the LICENSE file, you can\n * obtain it at www.aomedia.org\/license\/software. If the Alliance for Open\n * Media Patent License 1.0 was not distributed with this source code in the\n * PATENTS file, you can obtain it at www.aomedia.org\/license\/patent.\n*\/\n\n#include <math.h>\n#include <stdlib.h>\n#include <string.h>\n\n#include \"third_party\/googletest\/src\/include\/gtest\/gtest.h\"\n\n#include \".\/av1_rtcd.h\"\n#include \".\/aom_dsp_rtcd.h\"\n#include \"test\/acm_random.h\"\n#include \"test\/clear_system_state.h\"\n#include \"test\/register_state_check.h\"\n#include \"test\/util.h\"\n#include \"av1\/common\/blockd.h\"\n#include \"av1\/common\/scan.h\"\n#include \"aom\/aom_integer.h\"\n#include \"av1\/common\/av1_inv_txfm.h\"\n\nusing libaom_test::ACMRandom;\n\nnamespace {\nconst double PI = 3.141592653589793238462643383279502884;\nconst double kInvSqrt2 = 0.707106781186547524400844362104;\n\nvoid reference_idct_1d(const double *in, double *out, int size) {\n for (int n = 0; n < size; ++n) {\n out[n] = 0;\n for (int k = 0; k < size; ++k) {\n if (k == 0)\n out[n] += kInvSqrt2 * in[k] * cos(PI * (2 * n + 1) * k \/ (2 * size));\n else\n out[n] += in[k] * cos(PI * (2 * n + 1) * k \/ (2 * size));\n }\n }\n}\n\ntypedef void (*IdctFuncRef)(const double *in, double *out, int size);\ntypedef void (*IdctFunc)(const tran_low_t *in, tran_low_t *out);\n\nclass TransTestBase {\n public:\n virtual ~TransTestBase() {}\n\n protected:\n void RunInvAccuracyCheck() {\n tran_low_t *input = new tran_low_t[txfm_size_];\n tran_low_t *output = new tran_low_t[txfm_size_];\n double *ref_input = new double[txfm_size_];\n double *ref_output = new double[txfm_size_];\n\n ACMRandom rnd(ACMRandom::DeterministicSeed());\n const int count_test_block = 5000;\n for (int ti = 0; ti < count_test_block; ++ti) {\n for (int ni = 0; ni < txfm_size_; ++ni) {\n input[ni] = rnd.Rand8() - rnd.Rand8();\n ref_input[ni] = static_cast<double>(input[ni]);\n }\n\n fwd_txfm_(input, output);\n fwd_txfm_ref_(ref_input, ref_output, txfm_size_);\n\n for (int ni = 0; ni < txfm_size_; ++ni) {\n EXPECT_LE(\n abs(output[ni] - static_cast<tran_low_t>(round(ref_output[ni]))),\n max_error_);\n }\n }\n\n delete[] input;\n delete[] output;\n delete[] ref_input;\n delete[] ref_output;\n }\n\n double max_error_;\n int txfm_size_;\n IdctFunc fwd_txfm_;\n IdctFuncRef fwd_txfm_ref_;\n};\n\ntypedef std::tr1::tuple<IdctFunc, IdctFuncRef, int, int> IdctParam;\nclass AV1InvTxfm : public TransTestBase,\n public ::testing::TestWithParam<IdctParam> {\n public:\n virtual void SetUp() {\n fwd_txfm_ = GET_PARAM(0);\n fwd_txfm_ref_ = GET_PARAM(1);\n txfm_size_ = GET_PARAM(2);\n max_error_ = GET_PARAM(3);\n }\n virtual void TearDown() {}\n};\n\nTEST_P(AV1InvTxfm, RunInvAccuracyCheck) { RunInvAccuracyCheck(); }\n\nINSTANTIATE_TEST_CASE_P(\n C, AV1InvTxfm,\n ::testing::Values(IdctParam(&av1_idct4_c, &reference_idct_1d, 4, 1),\n IdctParam(&av1_idct8_c, &reference_idct_1d, 8, 2),\n IdctParam(&av1_idct16_c, &reference_idct_1d, 16, 4),\n IdctParam(&av1_idct32_c, &reference_idct_1d, 32, 6)));\n\n#if CONFIG_AV1_ENCODER\ntypedef void (*FwdTxfmFunc)(const int16_t *in, tran_low_t *out, int stride);\ntypedef void (*InvTxfmFunc)(const tran_low_t *in, uint8_t *out, int stride);\ntypedef std::tr1::tuple<FwdTxfmFunc, InvTxfmFunc, InvTxfmFunc, TX_SIZE, int>\n PartialInvTxfmParam;\nconst int kMaxNumCoeffs = 1024;\nclass AV1PartialIDctTest\n : public ::testing::TestWithParam<PartialInvTxfmParam> {\n public:\n virtual ~AV1PartialIDctTest() {}\n virtual void SetUp() {\n ftxfm_ = GET_PARAM(0);\n full_itxfm_ = GET_PARAM(1);\n partial_itxfm_ = GET_PARAM(2);\n tx_size_ = GET_PARAM(3);\n last_nonzero_ = GET_PARAM(4);\n }\n\n virtual void TearDown() { libaom_test::ClearSystemState(); }\n\n protected:\n int last_nonzero_;\n TX_SIZE tx_size_;\n FwdTxfmFunc ftxfm_;\n InvTxfmFunc full_itxfm_;\n InvTxfmFunc partial_itxfm_;\n};\n\nTEST_P(AV1PartialIDctTest, RunQuantCheck) {\n ACMRandom rnd(ACMRandom::DeterministicSeed());\n int size;\n switch (tx_size_) {\n case TX_4X4: size = 4; break;\n case TX_8X8: size = 8; break;\n case TX_16X16: size = 16; break;\n case TX_32X32: size = 32; break;\n default: FAIL() << \"Wrong Size!\"; break;\n }\n DECLARE_ALIGNED(16, tran_low_t, test_coef_block1[kMaxNumCoeffs]);\n DECLARE_ALIGNED(16, tran_low_t, test_coef_block2[kMaxNumCoeffs]);\n DECLARE_ALIGNED(16, uint8_t, dst1[kMaxNumCoeffs]);\n DECLARE_ALIGNED(16, uint8_t, dst2[kMaxNumCoeffs]);\n\n const int count_test_block = 1000;\n const int block_size = size * size;\n\n DECLARE_ALIGNED(16, int16_t, input_extreme_block[kMaxNumCoeffs]);\n DECLARE_ALIGNED(16, tran_low_t, output_ref_block[kMaxNumCoeffs]);\n\n int max_error = 0;\n for (int i = 0; i < count_test_block; ++i) {\n \/\/ clear out destination buffer\n memset(dst1, 0, sizeof(*dst1) * block_size);\n memset(dst2, 0, sizeof(*dst2) * block_size);\n memset(test_coef_block1, 0, sizeof(*test_coef_block1) * block_size);\n memset(test_coef_block2, 0, sizeof(*test_coef_block2) * block_size);\n\n ACMRandom rnd(ACMRandom::DeterministicSeed());\n\n for (int i = 0; i < count_test_block; ++i) {\n \/\/ Initialize a test block with input range [-255, 255].\n if (i == 0) {\n for (int j = 0; j < block_size; ++j) input_extreme_block[j] = 255;\n } else if (i == 1) {\n for (int j = 0; j < block_size; ++j) input_extreme_block[j] = -255;\n } else {\n for (int j = 0; j < block_size; ++j) {\n input_extreme_block[j] = rnd.Rand8() % 2 ? 255 : -255;\n }\n }\n\n ftxfm_(input_extreme_block, output_ref_block, size);\n\n \/\/ quantization with maximum allowed step sizes\n test_coef_block1[0] = (output_ref_block[0] \/ 1336) * 1336;\n for (int j = 1; j < last_nonzero_; ++j)\n test_coef_block1[av1_default_scan_orders[tx_size_].scan[j]] =\n (output_ref_block[j] \/ 1828) * 1828;\n }\n\n ASM_REGISTER_STATE_CHECK(full_itxfm_(test_coef_block1, dst1, size));\n ASM_REGISTER_STATE_CHECK(partial_itxfm_(test_coef_block1, dst2, size));\n\n for (int j = 0; j < block_size; ++j) {\n const int diff = dst1[j] - dst2[j];\n const int error = diff * diff;\n if (max_error < error) max_error = error;\n }\n }\n\n EXPECT_EQ(0, max_error)\n << \"Error: partial inverse transform produces different results\";\n}\n\nTEST_P(AV1PartialIDctTest, ResultsMatch) {\n ACMRandom rnd(ACMRandom::DeterministicSeed());\n int size;\n switch (tx_size_) {\n case TX_4X4: size = 4; break;\n case TX_8X8: size = 8; break;\n case TX_16X16: size = 16; break;\n case TX_32X32: size = 32; break;\n default: FAIL() << \"Wrong Size!\"; break;\n }\n DECLARE_ALIGNED(16, tran_low_t, test_coef_block1[kMaxNumCoeffs]);\n DECLARE_ALIGNED(16, tran_low_t, test_coef_block2[kMaxNumCoeffs]);\n DECLARE_ALIGNED(16, uint8_t, dst1[kMaxNumCoeffs]);\n DECLARE_ALIGNED(16, uint8_t, dst2[kMaxNumCoeffs]);\n const int count_test_block = 1000;\n const int max_coeff = 32766 \/ 4;\n const int block_size = size * size;\n int max_error = 0;\n for (int i = 0; i < count_test_block; ++i) {\n \/\/ clear out destination buffer\n memset(dst1, 0, sizeof(*dst1) * block_size);\n memset(dst2, 0, sizeof(*dst2) * block_size);\n memset(test_coef_block1, 0, sizeof(*test_coef_block1) * block_size);\n memset(test_coef_block2, 0, sizeof(*test_coef_block2) * block_size);\n int max_energy_leftover = max_coeff * max_coeff;\n for (int j = 0; j < last_nonzero_; ++j) {\n int16_t coef = static_cast<int16_t>(sqrt(1.0 * max_energy_leftover) *\n (rnd.Rand16() - 32768) \/ 65536);\n max_energy_leftover -= coef * coef;\n if (max_energy_leftover < 0) {\n max_energy_leftover = 0;\n coef = 0;\n }\n test_coef_block1[av1_default_scan_orders[tx_size_].scan[j]] = coef;\n }\n\n memcpy(test_coef_block2, test_coef_block1,\n sizeof(*test_coef_block2) * block_size);\n\n ASM_REGISTER_STATE_CHECK(full_itxfm_(test_coef_block1, dst1, size));\n ASM_REGISTER_STATE_CHECK(partial_itxfm_(test_coef_block2, dst2, size));\n\n for (int j = 0; j < block_size; ++j) {\n const int diff = dst1[j] - dst2[j];\n const int error = diff * diff;\n if (max_error < error) max_error = error;\n }\n }\n\n EXPECT_EQ(0, max_error)\n << \"Error: partial inverse transform produces different results\";\n}\nusing std::tr1::make_tuple;\n\nINSTANTIATE_TEST_CASE_P(\n C, AV1PartialIDctTest,\n ::testing::Values(make_tuple(&aom_fdct32x32_c, &av1_idct32x32_1024_add_c,\n &av1_idct32x32_34_add_c, TX_32X32, 34),\n make_tuple(&aom_fdct32x32_c, &av1_idct32x32_1024_add_c,\n &av1_idct32x32_1_add_c, TX_32X32, 1),\n make_tuple(&aom_fdct16x16_c, &av1_idct16x16_256_add_c,\n &av1_idct16x16_10_add_c, TX_16X16, 10),\n make_tuple(&aom_fdct16x16_c, &av1_idct16x16_256_add_c,\n &av1_idct16x16_1_add_c, TX_16X16, 1),\n make_tuple(&aom_fdct8x8_c, &av1_idct8x8_64_add_c,\n &av1_idct8x8_12_add_c, TX_8X8, 12),\n make_tuple(&aom_fdct8x8_c, &av1_idct8x8_64_add_c,\n &av1_idct8x8_1_add_c, TX_8X8, 1),\n make_tuple(&aom_fdct4x4_c, &av1_idct4x4_16_add_c,\n &av1_idct4x4_1_add_c, TX_4X4, 1)));\n#endif \/\/ CONFIG_AV1_ENCODER\n} \/\/ namespace\n<|endoftext|>"} {"text":"<commit_before><commit_msg>找出缺失的数<commit_after><|endoftext|>"} {"text":"<commit_before>\/\/\n\/\/ main.cpp\n\/\/ simulate\n\/\/\n\/\/ Created by Lucy Li on 3\/16\/20.\n\/\/ Copyright © 2020 Lucy M Li. All rights reserved.\n\/\/\n\n#include <iostream>\n\nint main(int argc, const char * argv[]) {\n \/\/ insert code here...\n std::cout << \"Hello, World!\\n\";\n return 0;\n}\n<commit_msg>remove extraneous file<commit_after><|endoftext|>"} {"text":"<commit_before>\n\/\/Implementation of the parallel statement execution manager\n\n#include \"parContextManager.h\"\n\nStatementContext::StatementContext() {\n \/\/Do nothing\n}\n\nStatementContext::StatementContext(StatementContext&& sc) {\n this->int_future_id_map = std::move(sc.int_future_id_map);\n this->float_future_id_map = std::move(sc.float_future_id_map);\n this->intptr_future_id_map = std::move(sc.intptr_future_id_map);\n this->floatptr_future_id_map = std::move(sc.floatptr_future_id_map);\n this->void_future_id_map = std::move(sc.void_future_id_map);\n}\n\n\/*=================================StatementContext=================================*\/\nvoid StatementContext::addIntFuture(std::future<int64_t>& f, const int64_t id) {\n std::lock_guard<std::mutex> section_monitor(map_mutex);\n assert(int_future_id_map.count(id)==0 && \"Statement id already exists\");\n int_future_id_map.insert(std::pair<int64_t,std::future<int64_t>>(id,std::move(f)));\n}\n\nvoid StatementContext::addFloatFuture(std::future<double>& f, const int64_t id) {\n std::lock_guard<std::mutex> section_monitor(map_mutex);\n assert(float_future_id_map.count(id)==0 && \"Statement id already exists\");\n float_future_id_map.insert(std::pair<int64_t,std::future<double>>(id,std::move(f)));\n}\n\nvoid StatementContext::addIntptrFuture(std::future<int64_t*>& f, const int64_t id) {\n std::lock_guard<std::mutex> section_monitor(map_mutex);\n assert(intptr_future_id_map.count(id)==0 && \"Statement id already exists\");\n intptr_future_id_map.insert(std::pair<int64_t,std::future<int64_t*>>(id,std::move(f)));\n}\n\nvoid StatementContext::addFloatptrFuture(std::future<double*>& f, const int64_t id) {\n std::lock_guard<std::mutex> section_monitor(map_mutex);\n assert(floatptr_future_id_map.count(id)==0 && \"Statement id already exists\");\n floatptr_future_id_map.insert(std::pair<int64_t,std::future<double*>>(id,std::move(f)));\n}\n\nvoid StatementContext::addVoidFuture(std::future<void>& f, const int64_t id) {\n std::lock_guard<std::mutex> section_monitor(map_mutex);\n assert(void_future_id_map.count(id)==0 && \"Statement id already exists\");\n void_future_id_map.insert(std::pair<int64_t,std::future<void>>(id,std::move(f)));\n}\n\nstd::future<int64_t> StatementContext::getIntFuture(const int64_t id) {\n std::lock_guard<std::mutex> section_monitor(map_mutex);\n auto f = std::move(int_future_id_map.at(id));\n int_future_id_map.erase(id);\n return f;\n}\n\nstd::future<double> StatementContext::getFloatFuture(const int64_t id) {\n std::lock_guard<std::mutex> section_monitor(map_mutex);\n auto f = std::move(float_future_id_map.at(id));\n float_future_id_map.erase(id);\n return f;\n}\n\nstd::future<int64_t*> StatementContext::getIntptrFuture(const int64_t id) {\n std::lock_guard<std::mutex> section_monitor(map_mutex);\n auto f = std::move(intptr_future_id_map.at(id));\n intptr_future_id_map.erase(id);\n return f;\n}\n\nstd::future<double*> StatementContext::getFloatptrFuture(const int64_t id) {\n std::lock_guard<std::mutex> section_monitor(map_mutex);\n auto f = std::move(floatptr_future_id_map.at(id));\n floatptr_future_id_map.erase(id);\n return f;\n}\n\nstd::future<void> StatementContext::getVoidFuture(const int64_t id) {\n std::lock_guard<std::mutex> section_monitor(map_mutex);\n auto f = std::move(void_future_id_map.at(id));\n void_future_id_map.erase(id);\n return f;\n}\n\n\/*=================================ParContextManager=================================*\/\nParContextManager::ParContextManager() {\n set_max_threads();\n thread_count = 0;\n next_cid = 0;\n}\n\nint64_t ParContextManager::make_context() {\n std::lock_guard<std::mutex> section_monitor(mutex);\n int64_t cid = next_cid++;\n context_map.insert(std::pair<int64_t,StatementContext>(cid,std::move(StatementContext())));\n return cid;\n}\n\nvoid ParContextManager::destroy_context(const int64_t cid) {\n std::lock_guard<std::mutex> section_monitor(mutex);\n assert(context_map.count(cid)==1);\n context_map.erase(cid);\n}\n\nvoid ParContextManager::sched_int(int64_t (*statement)(void),const int64_t id,const int64_t cid) {\n std::lock_guard<std::mutex> section_monitor(mutex);\n std::future<int64_t> promise;\n if (thread_count >= max_threads) {\n promise = std::async(std::launch::deferred,statement);\n } else {\n promise = std::async(std::launch::async,statement);\n thread_count++;\n }\n context_map.at(cid).addIntFuture(promise,id);\n}\n\nvoid ParContextManager::sched_float(double (*statement)(void),const int64_t id,const int64_t cid) {\n std::lock_guard<std::mutex> section_monitor(mutex);\n std::future<double> promise;\n if (thread_count >= max_threads) {\n promise = std::async(std::launch::deferred,statement);\n } else {\n promise = std::async(std::launch::async,statement);\n thread_count++;\n }\n context_map.at(cid).addFloatFuture(promise,id);\n}\n\nvoid ParContextManager::sched_intptr(int64_t* (*statement)(void),int64_t id,const int64_t cid) {\n std::lock_guard<std::mutex> section_monitor(mutex);\n std::future<int64_t*> promise;\n if (thread_count >= max_threads) {\n promise = std::async(std::launch::deferred,statement);\n } else {\n promise = std::async(std::launch::async,statement);\n thread_count++;\n }\n context_map.at(cid).addIntptrFuture(promise,id);\n}\n\nvoid ParContextManager::sched_floatptr(double* (*statement)(void),int64_t id,const int64_t cid) {\n std::lock_guard<std::mutex> section_monitor(mutex);\n std::future<double*> promise;\n if (thread_count >= max_threads) {\n promise = std::async(std::launch::deferred,statement);\n } else {\n promise = std::async(std::launch::async,statement);\n thread_count++;\n }\n context_map.at(cid).addFloatptrFuture(promise,id);\n}\n\nvoid ParContextManager::sched_void(void (*statement)(void),int64_t id,const int64_t cid) {\n std::lock_guard<std::mutex> section_monitor(mutex);\n std::future<void> promise;\n if (thread_count >= max_threads) {\n promise = std::async(std::launch::deferred,statement);\n } else {\n promise = std::async(std::launch::async,statement);\n thread_count++;\n }\n context_map.at(cid).addVoidFuture(promise,id);\n}\n\nint64_t ParContextManager::recon_int(const int64_t original,const int64_t known,const int64_t update,\n const int64_t id,const int64_t max,const int64_t cid) {\n mutex.lock();\n std::chrono::milliseconds span(0);\n std::future<int64_t> fv = context_map.at(cid).getIntFuture(id);\n int64_t v;\n mutex.unlock();\n if (fv.wait_for(span)==std::future_status::deferred) {\n v = fv.get();\n } else {\n v = fv.get();\n mutex.lock();\n thread_count--;\n mutex.unlock();\n }\n return v;\n}\n\ndouble ParContextManager::recon_float(const double original,const int64_t known,const double update,\n const int64_t id,const int64_t max,const int64_t cid) {\n mutex.lock();\n std::chrono::milliseconds span(0);\n std::future<double> fv = context_map.at(cid).getFloatFuture(id);\n double v;\n mutex.unlock();\n if (fv.wait_for(span)==std::future_status::deferred) {\n v = fv.get();\n } else {\n v = fv.get();\n mutex.lock();\n thread_count--;\n mutex.unlock();\n }\n return v;\n}\n\nint64_t* ParContextManager::recon_intptr(const int64_t* original,const int64_t known,const int64_t* update,\n const int64_t id,const int64_t max,const int64_t cid) {\n mutex.lock();\n std::chrono::milliseconds span(0);\n std::future<int64_t*> fv = context_map.at(cid).getIntptrFuture(id);\n int64_t* v;\n mutex.unlock();\n if (fv.wait_for(span)==std::future_status::deferred) {\n v = fv.get();\n } else {\n v = fv.get();\n mutex.lock();\n thread_count--;\n mutex.unlock();\n }\n return v;\n}\n\ndouble* ParContextManager::recon_floatptr(const double* original,const int64_t known,const double* update,\n const int64_t id,const int64_t max,const int64_t cid) {\n mutex.lock();\n std::chrono::milliseconds span(0);\n std::future<double*> fv = context_map.at(cid).getFloatptrFuture(id);\n double* v;\n mutex.unlock();\n if (fv.wait_for(span)==std::future_status::deferred) {\n v = fv.get();\n } else {\n v = fv.get();\n mutex.lock();\n thread_count--;\n mutex.unlock();\n }\n return v;\n}\n\nvoid ParContextManager::recon_void(const int64_t id,const int64_t max,const int64_t cid) {\n mutex.lock();\n std::chrono::milliseconds span(0);\n std::future<void> fv = context_map.at(cid).getVoidFuture(id);\n mutex.unlock();\n if (fv.wait_for(span)==std::future_status::deferred) {\n fv.get();\n } else {\n fv.get();\n mutex.lock();\n thread_count--;\n mutex.unlock();\n }\n}\n\nvoid ParContextManager::set_max_threads() {\n unsigned long dth = std::thread::hardware_concurrency();\n printf(\"Detected %d compute elements.\\n\",(int)dth);\n if (dth < 2) max_threads = 2;\n else if (dth > 4) max_threads = 4;\n else max_threads = dth;\n printf(\"Setting max execution threads to: %d\\n\",(int)max_threads);\n}\n\n<commit_msg>Added small assertion text<commit_after>\n\/\/Implementation of the parallel statement execution manager\n\n#include \"parContextManager.h\"\n\nStatementContext::StatementContext() {\n \/\/Do nothing\n}\n\nStatementContext::StatementContext(StatementContext&& sc) {\n this->int_future_id_map = std::move(sc.int_future_id_map);\n this->float_future_id_map = std::move(sc.float_future_id_map);\n this->intptr_future_id_map = std::move(sc.intptr_future_id_map);\n this->floatptr_future_id_map = std::move(sc.floatptr_future_id_map);\n this->void_future_id_map = std::move(sc.void_future_id_map);\n}\n\n\/*=================================StatementContext=================================*\/\nvoid StatementContext::addIntFuture(std::future<int64_t>& f, const int64_t id) {\n std::lock_guard<std::mutex> section_monitor(map_mutex);\n assert(int_future_id_map.count(id)==0 && \"Statement id already exists\");\n int_future_id_map.insert(std::pair<int64_t,std::future<int64_t>>(id,std::move(f)));\n}\n\nvoid StatementContext::addFloatFuture(std::future<double>& f, const int64_t id) {\n std::lock_guard<std::mutex> section_monitor(map_mutex);\n assert(float_future_id_map.count(id)==0 && \"Statement id already exists\");\n float_future_id_map.insert(std::pair<int64_t,std::future<double>>(id,std::move(f)));\n}\n\nvoid StatementContext::addIntptrFuture(std::future<int64_t*>& f, const int64_t id) {\n std::lock_guard<std::mutex> section_monitor(map_mutex);\n assert(intptr_future_id_map.count(id)==0 && \"Statement id already exists\");\n intptr_future_id_map.insert(std::pair<int64_t,std::future<int64_t*>>(id,std::move(f)));\n}\n\nvoid StatementContext::addFloatptrFuture(std::future<double*>& f, const int64_t id) {\n std::lock_guard<std::mutex> section_monitor(map_mutex);\n assert(floatptr_future_id_map.count(id)==0 && \"Statement id already exists\");\n floatptr_future_id_map.insert(std::pair<int64_t,std::future<double*>>(id,std::move(f)));\n}\n\nvoid StatementContext::addVoidFuture(std::future<void>& f, const int64_t id) {\n std::lock_guard<std::mutex> section_monitor(map_mutex);\n assert(void_future_id_map.count(id)==0 && \"Statement id already exists\");\n void_future_id_map.insert(std::pair<int64_t,std::future<void>>(id,std::move(f)));\n}\n\nstd::future<int64_t> StatementContext::getIntFuture(const int64_t id) {\n std::lock_guard<std::mutex> section_monitor(map_mutex);\n auto f = std::move(int_future_id_map.at(id));\n int_future_id_map.erase(id);\n return f;\n}\n\nstd::future<double> StatementContext::getFloatFuture(const int64_t id) {\n std::lock_guard<std::mutex> section_monitor(map_mutex);\n auto f = std::move(float_future_id_map.at(id));\n float_future_id_map.erase(id);\n return f;\n}\n\nstd::future<int64_t*> StatementContext::getIntptrFuture(const int64_t id) {\n std::lock_guard<std::mutex> section_monitor(map_mutex);\n auto f = std::move(intptr_future_id_map.at(id));\n intptr_future_id_map.erase(id);\n return f;\n}\n\nstd::future<double*> StatementContext::getFloatptrFuture(const int64_t id) {\n std::lock_guard<std::mutex> section_monitor(map_mutex);\n auto f = std::move(floatptr_future_id_map.at(id));\n floatptr_future_id_map.erase(id);\n return f;\n}\n\nstd::future<void> StatementContext::getVoidFuture(const int64_t id) {\n std::lock_guard<std::mutex> section_monitor(map_mutex);\n auto f = std::move(void_future_id_map.at(id));\n void_future_id_map.erase(id);\n return f;\n}\n\n\/*=================================ParContextManager=================================*\/\nParContextManager::ParContextManager() {\n set_max_threads();\n thread_count = 0;\n next_cid = 0;\n}\n\nint64_t ParContextManager::make_context() {\n std::lock_guard<std::mutex> section_monitor(mutex);\n int64_t cid = next_cid++;\n context_map.insert(std::pair<int64_t,StatementContext>(cid,std::move(StatementContext())));\n return cid;\n}\n\nvoid ParContextManager::destroy_context(const int64_t cid) {\n std::lock_guard<std::mutex> section_monitor(mutex);\n assert(context_map.count(cid)==1 && \"Couldnt find context to destroy\");\n context_map.erase(cid);\n}\n\nvoid ParContextManager::sched_int(int64_t (*statement)(void),const int64_t id,const int64_t cid) {\n std::lock_guard<std::mutex> section_monitor(mutex);\n std::future<int64_t> promise;\n if (thread_count >= max_threads) {\n promise = std::async(std::launch::deferred,statement);\n } else {\n promise = std::async(std::launch::async,statement);\n thread_count++;\n }\n context_map.at(cid).addIntFuture(promise,id);\n}\n\nvoid ParContextManager::sched_float(double (*statement)(void),const int64_t id,const int64_t cid) {\n std::lock_guard<std::mutex> section_monitor(mutex);\n std::future<double> promise;\n if (thread_count >= max_threads) {\n promise = std::async(std::launch::deferred,statement);\n } else {\n promise = std::async(std::launch::async,statement);\n thread_count++;\n }\n context_map.at(cid).addFloatFuture(promise,id);\n}\n\nvoid ParContextManager::sched_intptr(int64_t* (*statement)(void),int64_t id,const int64_t cid) {\n std::lock_guard<std::mutex> section_monitor(mutex);\n std::future<int64_t*> promise;\n if (thread_count >= max_threads) {\n promise = std::async(std::launch::deferred,statement);\n } else {\n promise = std::async(std::launch::async,statement);\n thread_count++;\n }\n context_map.at(cid).addIntptrFuture(promise,id);\n}\n\nvoid ParContextManager::sched_floatptr(double* (*statement)(void),int64_t id,const int64_t cid) {\n std::lock_guard<std::mutex> section_monitor(mutex);\n std::future<double*> promise;\n if (thread_count >= max_threads) {\n promise = std::async(std::launch::deferred,statement);\n } else {\n promise = std::async(std::launch::async,statement);\n thread_count++;\n }\n context_map.at(cid).addFloatptrFuture(promise,id);\n}\n\nvoid ParContextManager::sched_void(void (*statement)(void),int64_t id,const int64_t cid) {\n std::lock_guard<std::mutex> section_monitor(mutex);\n std::future<void> promise;\n if (thread_count >= max_threads) {\n promise = std::async(std::launch::deferred,statement);\n } else {\n promise = std::async(std::launch::async,statement);\n thread_count++;\n }\n context_map.at(cid).addVoidFuture(promise,id);\n}\n\nint64_t ParContextManager::recon_int(const int64_t original,const int64_t known,const int64_t update,\n const int64_t id,const int64_t max,const int64_t cid) {\n mutex.lock();\n std::chrono::milliseconds span(0);\n std::future<int64_t> fv = context_map.at(cid).getIntFuture(id);\n int64_t v;\n mutex.unlock();\n if (fv.wait_for(span)==std::future_status::deferred) {\n v = fv.get();\n } else {\n v = fv.get();\n mutex.lock();\n thread_count--;\n mutex.unlock();\n }\n return v;\n}\n\ndouble ParContextManager::recon_float(const double original,const int64_t known,const double update,\n const int64_t id,const int64_t max,const int64_t cid) {\n mutex.lock();\n std::chrono::milliseconds span(0);\n std::future<double> fv = context_map.at(cid).getFloatFuture(id);\n double v;\n mutex.unlock();\n if (fv.wait_for(span)==std::future_status::deferred) {\n v = fv.get();\n } else {\n v = fv.get();\n mutex.lock();\n thread_count--;\n mutex.unlock();\n }\n return v;\n}\n\nint64_t* ParContextManager::recon_intptr(const int64_t* original,const int64_t known,const int64_t* update,\n const int64_t id,const int64_t max,const int64_t cid) {\n mutex.lock();\n std::chrono::milliseconds span(0);\n std::future<int64_t*> fv = context_map.at(cid).getIntptrFuture(id);\n int64_t* v;\n mutex.unlock();\n if (fv.wait_for(span)==std::future_status::deferred) {\n v = fv.get();\n } else {\n v = fv.get();\n mutex.lock();\n thread_count--;\n mutex.unlock();\n }\n return v;\n}\n\ndouble* ParContextManager::recon_floatptr(const double* original,const int64_t known,const double* update,\n const int64_t id,const int64_t max,const int64_t cid) {\n mutex.lock();\n std::chrono::milliseconds span(0);\n std::future<double*> fv = context_map.at(cid).getFloatptrFuture(id);\n double* v;\n mutex.unlock();\n if (fv.wait_for(span)==std::future_status::deferred) {\n v = fv.get();\n } else {\n v = fv.get();\n mutex.lock();\n thread_count--;\n mutex.unlock();\n }\n return v;\n}\n\nvoid ParContextManager::recon_void(const int64_t id,const int64_t max,const int64_t cid) {\n mutex.lock();\n std::chrono::milliseconds span(0);\n std::future<void> fv = context_map.at(cid).getVoidFuture(id);\n mutex.unlock();\n if (fv.wait_for(span)==std::future_status::deferred) {\n fv.get();\n } else {\n fv.get();\n mutex.lock();\n thread_count--;\n mutex.unlock();\n }\n}\n\nvoid ParContextManager::set_max_threads() {\n unsigned long dth = std::thread::hardware_concurrency();\n printf(\"Detected %d compute elements.\\n\",(int)dth);\n if (dth < 2) max_threads = 2;\n else if (dth > 4) max_threads = 4;\n else max_threads = dth;\n printf(\"Setting max execution threads to: %d\\n\",(int)max_threads);\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#ifndef _SDR_ANIMATION_SCHEDULER_HXX\n#define _SDR_ANIMATION_SCHEDULER_HXX\n\n#include <sal\/types.h>\n#include <vcl\/timer.hxx>\n#include <svx\/svxdllapi.h>\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ event class\n\nnamespace sdr\n{\n namespace animation\n {\n class Event\n {\n \/\/ time of event in ms\n sal_uInt32 mnTime;\n\n \/\/ pointer for simply linked list\n Event* mpNext;\n\n public:\n \/\/ constructor\/destructor\n Event(sal_uInt32 nTime);\n SVX_DLLPUBLIC virtual ~Event();\n\n \/\/ access to mpNext\n Event* GetNext() const;\n void SetNext(Event* pNew);\n\n \/\/ get\/set time\n sal_uInt32 GetTime() const;\n void SetTime(sal_uInt32 nNew);\n\n \/\/ execute event\n virtual void Trigger(sal_uInt32 nTime) = 0;\n };\n } \/\/ end of namespace animation\n} \/\/ end of namespace sdr\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ eventlist class\n\nnamespace sdr\n{\n namespace animation\n {\n class EventList\n {\n \/\/ pointer to first entry\n Event* mpHead;\n\n public:\n \/\/ constructor\/destructor\n EventList();\n SVX_DLLPUBLIC virtual ~EventList();\n\n \/\/ insert\/remove time dependent\n void Insert(Event* pNew);\n void Remove(Event* pOld);\n\n \/\/ clear list\n void Clear();\n\n \/\/ get first\n Event* GetFirst();\n };\n } \/\/ end of namespace animation\n} \/\/ end of namespace sdr\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ scheduler class\n\nnamespace sdr\n{\n namespace animation\n {\n class Scheduler : public Timer\n {\n \/\/ time in ms\n sal_uInt32 mnTime;\n\n \/\/ next delta time\n sal_uInt32 mnDeltaTime;\n\n \/\/ list of events\n EventList maList;\n\n \/\/ Flag which remembers if this timer is paused. Default\n \/\/ is false.\n bool mbIsPaused;\n\n public:\n \/\/ constructor\/destructor\n Scheduler();\n SVX_DLLPUBLIC virtual ~Scheduler();\n\n \/\/ From baseclass Timer, the timeout call\n SVX_DLLPUBLIC virtual void Timeout();\n\n \/\/ get time\n sal_uInt32 GetTime();\n\n \/\/ #i38135#\n void SetTime(sal_uInt32 nTime);\n\n \/\/ reset\n void Reset(sal_uInt32 nTime);\n\n \/\/ execute all ripe events, removes executed ones from the scheduler\n void triggerEvents();\n\n \/\/ re-start or stop timer according to event list\n void checkTimeout();\n\n \/\/ insert\/remove events, wrapper to EventList methods\n void InsertEvent(Event* pNew);\n void RemoveEvent(Event* pOld);\n\n \/\/ get\/set pause\n bool IsPaused() const { return mbIsPaused; }\n void SetPaused(bool bNew);\n };\n } \/\/ end of namespace animation\n} \/\/ end of namespace sdr\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n#endif \/\/_SDR_ANIMATION_SCHEDULER_HXX\n\n\/\/ eof\n<commit_msg>Port cws-koheicopyborder-svx.diff from ooo-build.<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#ifndef _SDR_ANIMATION_SCHEDULER_HXX\n#define _SDR_ANIMATION_SCHEDULER_HXX\n\n#include <sal\/types.h>\n#include <vcl\/timer.hxx>\n#include <svx\/svxdllapi.h>\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ event class\n\nnamespace sdr\n{\n namespace animation\n {\n class Event\n {\n \/\/ time of event in ms\n sal_uInt32 mnTime;\n\n \/\/ pointer for simply linked list\n Event* mpNext;\n\n public:\n \/\/ constructor\/destructor\n Event(sal_uInt32 nTime);\n SVX_DLLPUBLIC virtual ~Event();\n\n \/\/ access to mpNext\n Event* GetNext() const;\n void SetNext(Event* pNew);\n\n \/\/ get\/set time\n sal_uInt32 GetTime() const;\n void SVX_DLLPUBLIC SetTime(sal_uInt32 nNew);\n\n \/\/ execute event\n virtual void Trigger(sal_uInt32 nTime) = 0;\n };\n } \/\/ end of namespace animation\n} \/\/ end of namespace sdr\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ eventlist class\n\nnamespace sdr\n{\n namespace animation\n {\n class EventList\n {\n \/\/ pointer to first entry\n Event* mpHead;\n\n public:\n \/\/ constructor\/destructor\n EventList();\n SVX_DLLPUBLIC virtual ~EventList();\n\n \/\/ insert\/remove time dependent\n void Insert(Event* pNew);\n void Remove(Event* pOld);\n\n \/\/ clear list\n void Clear();\n\n \/\/ get first\n Event* GetFirst();\n };\n } \/\/ end of namespace animation\n} \/\/ end of namespace sdr\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ scheduler class\n\nnamespace sdr\n{\n namespace animation\n {\n class Scheduler : public Timer\n {\n \/\/ time in ms\n sal_uInt32 mnTime;\n\n \/\/ next delta time\n sal_uInt32 mnDeltaTime;\n\n \/\/ list of events\n EventList maList;\n\n \/\/ Flag which remembers if this timer is paused. Default\n \/\/ is false.\n bool mbIsPaused;\n\n public:\n \/\/ constructor\/destructor\n Scheduler();\n SVX_DLLPUBLIC virtual ~Scheduler();\n\n \/\/ From baseclass Timer, the timeout call\n SVX_DLLPUBLIC virtual void Timeout();\n\n \/\/ get time\n sal_uInt32 GetTime();\n\n \/\/ #i38135#\n void SetTime(sal_uInt32 nTime);\n\n \/\/ reset\n void Reset(sal_uInt32 nTime);\n\n \/\/ execute all ripe events, removes executed ones from the scheduler\n void triggerEvents();\n\n \/\/ re-start or stop timer according to event list\n void checkTimeout();\n\n \/\/ insert\/remove events, wrapper to EventList methods\n void SVX_DLLPUBLIC InsertEvent(Event* pNew);\n void RemoveEvent(Event* pOld);\n\n \/\/ get\/set pause\n bool IsPaused() const { return mbIsPaused; }\n void SetPaused(bool bNew);\n };\n } \/\/ end of namespace animation\n} \/\/ end of namespace sdr\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n#endif \/\/_SDR_ANIMATION_SCHEDULER_HXX\n\n\/\/ eof\n<|endoftext|>"} {"text":"<commit_before>\/******************************************************************\n *\n * Copyright 2015 Samsung Electronics All Rights Reserved.\n *\n *\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n *\n ******************************************************************\/\n\n#include \"RCSResourceObject.h\"\n#include \"OCPlatform.h\"\n\nusing namespace OC::OCPlatform;\nusing namespace OIC::Service;\n\nstruct CloseApp{};\n\nconstexpr int RESOURCE_TEMP = 1;\nconstexpr int RESOURCE_LIGHT = 2;\n\nconstexpr int DEFALUT_SERVER = 1;\nconstexpr int CUSTOM_SERVER = 2;\n\nconstexpr int INCREASE = 1;\nconstexpr int DECREASE = 2;\n\nconst std::string BASELINE_INTERFACE = \"oic.if.baseline\";\nconst std::string ACTUATOR_INTERFACE = \"oic.if.a\";\nconst std::string SENSOR_INTERFACE = \"oic.if.s\";\nconst std::string CUSTOM_INTERFACE = \"test.custom\";\n\ntypedef void (*DisplayControlMenuFunc)();\ntypedef std::function<void()> Run;\n\nRun g_currentRun;\n\nbool g_isPresenceStarted = false;\n\nRCSResourceObject::Ptr g_resource;\n\nint processUserInput(int min, int max)\n{\n assert(min <= max);\n\n int input;\n\n std::cin >> input;\n\n if (!std::cin.fail())\n {\n if(input == max + 1) throw CloseApp();\n if(min <= input && input <= max) return input;\n }\n\n std::cin.clear();\n std::cin.ignore(std::numeric_limits<std::streamsize>::max(), '\\n');\n\n throw std::runtime_error(\"Invalid Input, please try again\");\n}\n\nvoid displayControlTemperatureMenu()\n{\n std::cout << \"========================================================\\n\";\n std::cout << INCREASE << \". Increase Temperature by 1 degree \\n\";\n std::cout << DECREASE << \". Decrease Temperature by 1 degree \\n\";\n std::cout << DECREASE + 1 << \". Quit \\n\";\n std::cout << \"========================================================\\n\";\n}\n\nvoid displayControlLightMenu()\n{\n std::cout << \"========================================================\\n\";\n std::cout << INCREASE << \". Increase Brightness by 1 stage \\n\";\n std::cout << DECREASE << \". Decrease Brightness by 1 stage \\n\";\n std::cout << DECREASE + 1 << \". Quit \\n\";\n std::cout << \"========================================================\\n\";\n}\n\nvoid printAttributes(const RCSResourceAttributes& attrs)\n{\n for(const auto& attr : attrs)\n {\n std::cout << \"\\tkey : \" << attr.key() << \"\\n\\tvalue : \"\n << attr.value().toString() << std::endl;\n }\n}\n\nRCSGetResponse requestHandlerForGet(const RCSRequest&, RCSResourceAttributes& attrs)\n{\n std::cout << \"Received a Get request from Client\" << std::endl;\n printAttributes(attrs);\n\n {\n RCSResourceObject::LockGuard lock(g_resource);\n std::cout << \"\\nSending response to Client : \" << std::endl;\n printAttributes(g_resource->getAttributes());\n }\n\n return RCSGetResponse::defaultAction();\n}\n\nRCSSetResponse requestHandlerForSet(const RCSRequest&, RCSResourceAttributes& attrs)\n{\n std::cout << \"Received a Set request from Client\" << std::endl;\n printAttributes(attrs);\n\n return RCSSetResponse::defaultAction();\n}\n\nvoid initServer(const std::string& resourceUri, const std::string& resourceType,\n const std::string& attrKey)\n{\n g_resource = RCSResourceObject::Builder(resourceUri, resourceType, ACTUATOR_INTERFACE)\n .addInterface(CUSTOM_INTERFACE)\n .addInterface(SENSOR_INTERFACE)\n .setDefaultInterface(BASELINE_INTERFACE)\n .setDiscoverable(true)\n .setObservable(true)\n .build();\n\n g_resource->setAutoNotifyPolicy(RCSResourceObject::AutoNotifyPolicy::UPDATED);\n g_resource->setSetRequestHandlerPolicy(RCSResourceObject::SetRequestHandlerPolicy::NEVER);\n g_resource->setAttribute(attrKey, 0);\n}\n\nvoid updateAttribute(const std::string& attrKey, int control)\n{\n const int diff = control == INCREASE ? 1 : - 1;\n\n {\n RCSResourceObject::LockGuard lock(g_resource);\n auto& attrs = g_resource->getAttributes();\n attrs[attrKey] = attrs[attrKey].get<int>() + diff;\n }\n\n if(control == INCREASE)\n {\n std::cout << attrKey << \" increased.\" << std::endl;\n }\n else\n {\n std::cout << attrKey << \" decreased.\" << std::endl;\n }\n std::cout << \"\\nCurrent \" << attrKey << \": \"\n << g_resource->getAttributeValue(attrKey).get<int>() << std::endl;\n}\n\nvoid runResourceControl(DisplayControlMenuFunc displayMenuFunc, const std::string& attrKey)\n{\n displayMenuFunc();\n updateAttribute(attrKey, processUserInput(INCREASE, DECREASE));\n}\n\nvoid runResourceTypeSelection(int resourceMode)\n{\n std::cout << \"========================================================\\n\";\n std::cout << \"Select Resource Type \\n\";\n std::cout << RESOURCE_TEMP << \". Temperature \\n\";\n std::cout << RESOURCE_LIGHT << \". Light \\n\";\n std::cout << RESOURCE_LIGHT + 1 << \". Quit \\n\";\n std::cout << \"========================================================\\n\";\n\n int resourceType = processUserInput(RESOURCE_TEMP, RESOURCE_LIGHT);\n DisplayControlMenuFunc displayMenuFunc;\n std::string attrKey;\n\n switch (resourceType)\n {\n case RESOURCE_TEMP:\n attrKey = \"Temperature\";\n initServer(\"\/a\/TempSensor\", \"oic.r.temperaturesensor\", attrKey);\n\n displayMenuFunc = displayControlTemperatureMenu;\n break;\n\n case RESOURCE_LIGHT:\n attrKey = \"Brightness\";\n initServer(\"\/a\/light\", \"oic.r.light\", attrKey);\n\n displayMenuFunc = displayControlLightMenu;\n break;\n }\n\n if (resourceMode == CUSTOM_SERVER)\n {\n g_resource->setGetRequestHandler(requestHandlerForGet);\n g_resource->setSetRequestHandler(requestHandlerForSet);\n }\n\n g_currentRun = std::bind(runResourceControl, displayMenuFunc, std::move(attrKey));\n}\n\nvoid runResourceModeSelection()\n{\n std::cout << \"======================================================== \\n\";\n std::cout << DEFALUT_SERVER << \". Creation of Simple Resource Without Handlers \\n\";\n std::cout << CUSTOM_SERVER << \". Creation of Resource With Set and Get Handlers \\n\";\n std::cout << CUSTOM_SERVER + 1 << \". Quit \\n\";\n std::cout << \"======================================================== \\n\";\n\n g_currentRun = std::bind(runResourceTypeSelection,\n processUserInput(DEFALUT_SERVER, CUSTOM_SERVER));\n}\n\nvoid runPresenceSelection()\n{\n constexpr int PRESENCE_ON = 1;\n constexpr int PRESENCE_OFF = 2;\n\n std::cout << \"========================================================\\n\";\n std::cout << PRESENCE_ON << \". Presence On \\n\";\n std::cout << PRESENCE_OFF << \". Presence Off \\n\";\n std::cout << PRESENCE_OFF + 1 << \". Quit \\n\";\n std::cout << \"========================================================\\n\";\n\n if (processUserInput(PRESENCE_ON, PRESENCE_OFF) == PRESENCE_ON)\n {\n g_isPresenceStarted = true;\n startPresence(3);\n }\n\n g_currentRun = runResourceModeSelection;\n}\n\nint main(void)\n{\n g_currentRun = runPresenceSelection;\n\n while(true)\n {\n try\n {\n g_currentRun();\n }\n catch(const std::exception& e)\n {\n std::cout << e.what() << std::endl;\n }\n catch(const CloseApp&)\n {\n break;\n }\n }\n std::cout << \"Stopping the server\" << std::endl;\n\n g_resource.reset();\n\n if(g_isPresenceStarted)\n {\n stopPresence();\n }\n}\n\n<commit_msg>resource-container: Change file permission of SampleResource sources<commit_after>\/******************************************************************\n *\n * Copyright 2015 Samsung Electronics All Rights Reserved.\n *\n *\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n *\n ******************************************************************\/\n\n#include \"RCSResourceObject.h\"\n#include \"OCPlatform.h\"\n\nusing namespace OC::OCPlatform;\nusing namespace OIC::Service;\n\nstruct CloseApp{};\n\nconstexpr int RESOURCE_TEMP = 1;\nconstexpr int RESOURCE_LIGHT = 2;\n\nconstexpr int DEFALUT_SERVER = 1;\nconstexpr int CUSTOM_SERVER = 2;\n\nconstexpr int INCREASE = 1;\nconstexpr int DECREASE = 2;\n\nconst std::string BASELINE_INTERFACE = \"oic.if.baseline\";\nconst std::string ACTUATOR_INTERFACE = \"oic.if.a\";\nconst std::string SENSOR_INTERFACE = \"oic.if.s\";\nconst std::string CUSTOM_INTERFACE = \"test.custom\";\n\ntypedef void (*DisplayControlMenuFunc)();\ntypedef std::function<void()> Run;\n\nRun g_currentRun;\n\nbool g_isPresenceStarted = false;\n\nRCSResourceObject::Ptr g_resource;\n\nint processUserInput(int min, int max)\n{\n assert(min <= max);\n\n int input;\n\n std::cin >> input;\n\n if (!std::cin.fail())\n {\n if(input == max + 1) throw CloseApp();\n if(min <= input && input <= max) return input;\n }\n\n std::cin.clear();\n std::cin.ignore(std::numeric_limits<std::streamsize>::max(), '\\n');\n\n throw std::runtime_error(\"Invalid Input, please try again\");\n}\n\nvoid displayControlTemperatureMenu()\n{\n std::cout << \"========================================================\\n\";\n std::cout << INCREASE << \". Increase Temperature by 1 degree \\n\";\n std::cout << DECREASE << \". Decrease Temperature by 1 degree \\n\";\n std::cout << DECREASE + 1 << \". Quit \\n\";\n std::cout << \"========================================================\\n\";\n}\n\nvoid displayControlLightMenu()\n{\n std::cout << \"========================================================\\n\";\n std::cout << INCREASE << \". Increase Brightness by 1 stage \\n\";\n std::cout << DECREASE << \". Decrease Brightness by 1 stage \\n\";\n std::cout << DECREASE + 1 << \". Quit \\n\";\n std::cout << \"========================================================\\n\";\n}\n\nvoid printAttributes(const RCSResourceAttributes& attrs)\n{\n for(const auto& attr : attrs)\n {\n std::cout << \"\\tkey : \" << attr.key() << \"\\n\\tvalue : \"\n << attr.value().toString() << std::endl;\n }\n}\n\nRCSGetResponse requestHandlerForGet(const RCSRequest&, RCSResourceAttributes& attrs)\n{\n std::cout << \"Received a Get request from Client\" << std::endl;\n printAttributes(attrs);\n\n {\n RCSResourceObject::LockGuard lock(g_resource);\n std::cout << \"\\nSending response to Client : \" << std::endl;\n printAttributes(g_resource->getAttributes());\n }\n\n return RCSGetResponse::defaultAction();\n}\n\nRCSSetResponse requestHandlerForSet(const RCSRequest&, RCSResourceAttributes& attrs)\n{\n std::cout << \"Received a Set request from Client\" << std::endl;\n printAttributes(attrs);\n\n return RCSSetResponse::defaultAction();\n}\n\nvoid initServer(const std::string& resourceUri, const std::string& resourceType,\n const std::string& attrKey)\n{\n g_resource = RCSResourceObject::Builder(resourceUri, resourceType, ACTUATOR_INTERFACE)\n .addInterface(CUSTOM_INTERFACE)\n .addInterface(SENSOR_INTERFACE)\n .setDefaultInterface(BASELINE_INTERFACE)\n .setDiscoverable(true)\n .setObservable(true)\n .build();\n\n g_resource->setAutoNotifyPolicy(RCSResourceObject::AutoNotifyPolicy::UPDATED);\n g_resource->setSetRequestHandlerPolicy(RCSResourceObject::SetRequestHandlerPolicy::NEVER);\n g_resource->setAttribute(attrKey, 0);\n}\n\nvoid updateAttribute(const std::string& attrKey, int control)\n{\n const int diff = control == INCREASE ? 1 : - 1;\n\n {\n RCSResourceObject::LockGuard lock(g_resource);\n auto& attrs = g_resource->getAttributes();\n attrs[attrKey] = attrs[attrKey].get<int>() + diff;\n }\n\n if(control == INCREASE)\n {\n std::cout << attrKey << \" increased.\" << std::endl;\n }\n else\n {\n std::cout << attrKey << \" decreased.\" << std::endl;\n }\n std::cout << \"\\nCurrent \" << attrKey << \": \"\n << g_resource->getAttributeValue(attrKey).get<int>() << std::endl;\n}\n\nvoid runResourceControl(DisplayControlMenuFunc displayMenuFunc, const std::string& attrKey)\n{\n displayMenuFunc();\n updateAttribute(attrKey, processUserInput(INCREASE, DECREASE));\n}\n\nvoid runResourceTypeSelection(int resourceMode)\n{\n std::cout << \"========================================================\\n\";\n std::cout << \"Select Resource Type \\n\";\n std::cout << RESOURCE_TEMP << \". Temperature \\n\";\n std::cout << RESOURCE_LIGHT << \". Light \\n\";\n std::cout << RESOURCE_LIGHT + 1 << \". Quit \\n\";\n std::cout << \"========================================================\\n\";\n\n int resourceType = processUserInput(RESOURCE_TEMP, RESOURCE_LIGHT);\n DisplayControlMenuFunc displayMenuFunc;\n std::string attrKey;\n\n switch (resourceType)\n {\n case RESOURCE_TEMP:\n attrKey = \"Temperature\";\n initServer(\"\/a\/TempSensor\", \"oic.r.temperaturesensor\", attrKey);\n\n displayMenuFunc = displayControlTemperatureMenu;\n break;\n\n case RESOURCE_LIGHT:\n attrKey = \"Brightness\";\n initServer(\"\/a\/light\", \"oic.r.light\", attrKey);\n\n displayMenuFunc = displayControlLightMenu;\n break;\n }\n\n if (resourceMode == CUSTOM_SERVER)\n {\n g_resource->setGetRequestHandler(requestHandlerForGet);\n g_resource->setSetRequestHandler(requestHandlerForSet);\n }\n\n g_currentRun = std::bind(runResourceControl, displayMenuFunc, std::move(attrKey));\n}\n\nvoid runResourceModeSelection()\n{\n std::cout << \"======================================================== \\n\";\n std::cout << DEFALUT_SERVER << \". Creation of Simple Resource Without Handlers \\n\";\n std::cout << CUSTOM_SERVER << \". Creation of Resource With Set and Get Handlers \\n\";\n std::cout << CUSTOM_SERVER + 1 << \". Quit \\n\";\n std::cout << \"======================================================== \\n\";\n\n g_currentRun = std::bind(runResourceTypeSelection,\n processUserInput(DEFALUT_SERVER, CUSTOM_SERVER));\n}\n\nvoid runPresenceSelection()\n{\n constexpr int PRESENCE_ON = 1;\n constexpr int PRESENCE_OFF = 2;\n\n std::cout << \"========================================================\\n\";\n std::cout << PRESENCE_ON << \". Presence On \\n\";\n std::cout << PRESENCE_OFF << \". Presence Off \\n\";\n std::cout << PRESENCE_OFF + 1 << \". Quit \\n\";\n std::cout << \"========================================================\\n\";\n\n if (processUserInput(PRESENCE_ON, PRESENCE_OFF) == PRESENCE_ON)\n {\n g_isPresenceStarted = true;\n startPresence(3);\n }\n\n g_currentRun = runResourceModeSelection;\n}\n\nint main(void)\n{\n g_currentRun = runPresenceSelection;\n\n while(true)\n {\n try\n {\n g_currentRun();\n }\n catch(const std::exception& e)\n {\n std::cout << e.what() << std::endl;\n }\n catch(const CloseApp&)\n {\n break;\n }\n }\n std::cout << \"Stopping the server\" << std::endl;\n\n g_resource.reset();\n\n if(g_isPresenceStarted)\n {\n stopPresence();\n }\n}\n\n<|endoftext|>"} {"text":"<commit_before>\/**\n * Filter Traffic DPDK example application\n * =======================================\n * An application that listens to one or more DPDK ports (a.k.a DPDK devices), captures all traffic\n * and matches packets by user-defined matching criteria. Matching criteria is given on startup and can contain one or more of the following:\n * source IP, destination IP, source TCP\/UDP port, destination TCP\/UDP port and TCP or UDP protocol. Matching is done per flow, meaning the first packet\n * received on a flow is matched against the matching criteria and if it's matched then all packets of the same flow will be matched too.\n * Packets that are matched can be send to a DPDK port and\/or be save to a pcap file.\n * In addition the application collect statistics on received and matched packets: number of packets per protocol, number of matched flows and number\n * of matched packets.\n *\n * The application uses the concept of worker threads. Number of cores can be set by the user or set to default (default is all machine cores minus one\n * management core). Each core is assigned with one worker thread. The application divides the DPDK ports and RX queues equally between worker threads.\n * For example: if there are 2 DPDK ports to listen to, each one with 6 RX queues and there are 3 worker threads, then worker #1 will get RX queues\n * 1-4 of port 1, worker #2 will get RX queues 5-6 of port 1 and RX queues 1-2 of port 2, and worker #3 will get RX queues 3-6 of port 2.\n * Each worker thread does exactly the same work: receiving packets, collecting packet statistics, matching flows and sending\/saving matched packets\n *\n * __Important__: this application (like all applications using DPDK) should be run as 'sudo'\n *\/\n\n#include \"Common.h\"\n#include \"AppWorkerThread.h\"\n\n#include \"DpdkDeviceList.h\"\n#include \"IPv4Layer.h\"\n#include \"TcpLayer.h\"\n#include \"UdpLayer.h\"\n#include \"SystemUtils.h\"\n#include \"PcapPlusPlusVersion.h\"\n#include \"TablePrinter.h\"\n\n#include <vector>\n#include <iostream>\n#include <iomanip>\n#include <stdlib.h>\n#include <signal.h>\n#include <getopt.h>\n#include <string>\n#include <sstream>\n#include <unistd.h>\n\nusing namespace pcpp;\n\n#define DEFAULT_MBUF_POOL_SIZE 4095\n\n\nstatic struct option FilterTrafficOptions[] =\n{\n\t{\"dpdk-ports\", required_argument, 0, 'd'},\n\t{\"core-mask\", optional_argument, 0, 'c'},\n\t{\"mbuf-pool-size\", optional_argument, 0, 'm'},\n\t{\"help\", optional_argument, 0, 'h'},\n\t{\"version\", optional_argument, 0, 'v'},\n\t{\"list\", optional_argument, 0, 'l'},\n\t{0, 0, 0, 0}\n};\n\n\n\/**\n * Print application usage\n *\/\nvoid printUsage()\n{\n\tprintf(\"\\nUsage:\\n\"\n \"------\\n\"\n \"%s [-hvl] [-c CORE_MASK] [-m POOL_SIZE] -d PORT_1,PORT_2\\n\"\n\t\t\t\"\\nOptions:\\n\\n\"\n\t\t\t\" -h|--help : Displays this help message and exits\\n\"\n \" -v|--version : Displays the current version and exits\\n\"\n\t\t\t\" -l|--list : Print the list of DPDK ports and exists\\n\"\n\t\t\t\" -d|--dpdk-ports PORT_1,PORT_2 : A comma-separated list of two DPDK port numbers to be bridged.\\n\"\n\t\t\t\" To see all available DPDK ports use the -l switch\\n\"\n\t\t\t\" -c|--core-mask CORE_MASK : Core mask of cores to use. For example: use 7 (binary 0111) to use cores 0,1,2.\\n\"\n\t\t\t\" Default is using all cores except management core\\n\"\n\t\t\t\" -m|--mbuf-pool-size POOL_SIZE : DPDK mBuf pool size to initialize DPDK with. Default value is 4095\\n\\n\", AppName::get().c_str());\n}\n\n\n\/**\n * Print application version\n *\/\nvoid printAppVersion()\n{\n\tprintf(\"%s %s\\n\", AppName::get().c_str(), getPcapPlusPlusVersionFull().c_str());\n\tprintf(\"Built: %s\\n\", getBuildDateTime().c_str());\n\tprintf(\"Built from: %s\\n\", getGitInfo().c_str());\n\texit(0);\n}\n\n\n\/**\n * Print to console all available DPDK ports. Used by the -l switch\n *\/\nvoid listDpdkPorts()\n{\n\tCoreMask coreMaskToUse = getCoreMaskForAllMachineCores();\n\n\t\/\/ initialize DPDK\n\tif (!DpdkDeviceList::initDpdk(coreMaskToUse, DEFAULT_MBUF_POOL_SIZE))\n\t{\n\t\tEXIT_WITH_ERROR(\"couldn't initialize DPDK\");\n\t}\n\n\tprintf(\"DPDK port list:\\n\");\n\n\t\/\/ go over all available DPDK devices and print info for each one\n\tvector<DpdkDevice*> deviceList = DpdkDeviceList::getInstance().getDpdkDeviceList();\n\tfor (vector<DpdkDevice*>::iterator iter = deviceList.begin(); iter != deviceList.end(); iter++)\n\t{\n\t\tDpdkDevice* dev = *iter;\n\t\tprintf(\" Port #%d: MAC address='%s'; PCI address='%s'; PMD='%s'\\n\",\n\t\t\t\tdev->getDeviceId(),\n\t\t\t\tdev->getMacAddress().toString().c_str(),\n\t\t\t\tdev->getPciAddress().toString().c_str(),\n\t\t\t\tdev->getPMDName().c_str());\n\t}\n}\n\nstruct DpdkBridgeArgs\n{\n\tbool shouldStop;\n\tstd::vector<DpdkWorkerThread*>* workerThreadsVector;\n\n\tDpdkBridgeArgs() : shouldStop(false), workerThreadsVector(NULL) {}\n};\n\n\/**\n * The callback to be called when application is terminated by ctrl-c. Do cleanup and print summary stats\n *\/\nvoid onApplicationInterrupted(void* cookie)\n{\n\tDpdkBridgeArgs* args = (DpdkBridgeArgs*)cookie;\n\n\tprintf(\"\\n\\nApplication stopped\\n\");\n\n\t\/\/ stop worker threads\n\tDpdkDeviceList::getInstance().stopDpdkWorkerThreads();\n\n\t\/\/ create table printer\n\tstd::vector<std::string> columnNames;\n\tstd::vector<int> columnWidths;\n\tPacketStats::getStatsColumns(columnNames, columnWidths);\n\tTablePrinter printer(columnNames, columnWidths);\n\n\t\/\/ print final stats for every worker thread plus sum of all threads and free worker threads memory\n\tPacketStats aggregatedStats;\n\tfor (std::vector<DpdkWorkerThread*>::iterator iter = args->workerThreadsVector->begin(); iter != args->workerThreadsVector->end(); iter++)\n\t{\n\t\tAppWorkerThread* thread = (AppWorkerThread*)(*iter);\n\t\tPacketStats threadStats = thread->getStats();\n\t\taggregatedStats.collectStats(threadStats);\n\t\tprinter.printRow(threadStats.getStatValuesAsString(\"|\"), '|');\n\t\tdelete thread;\n\t}\n\n\tprinter.printSeparator();\n\tprinter.printRow(aggregatedStats.getStatValuesAsString(\"|\"), '|');\n\n\targs->shouldStop = true;\n}\n\n\n\/**\n * main method of the application. Responsible for parsing user args, preparing worker thread configuration, creating the worker threads and activate them.\n * At program termination worker threads are stopped, statistics are collected from them and printed to console\n *\/\nint main(int argc, char* argv[])\n{\n\tAppName::init(argc, argv);\n\n\tstd::vector<int> dpdkPortVec;\n\n\tCoreMask coreMaskToUse = getCoreMaskForAllMachineCores();\n\n\tint sendPacketsToPort = -1;\n\n\tint optionIndex = 0;\n\tchar opt = 0;\n\n\tuint32_t mBufPoolSize = DEFAULT_MBUF_POOL_SIZE;\n\n\twhile((opt = getopt_long (argc, argv, \"d:c:m:hvl\", FilterTrafficOptions, &optionIndex)) != -1)\n\t{\n\t\tswitch (opt)\n\t\t{\n\t\t\tcase 0:\n\t\t\t{\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\tcase 'd':\n\t\t\t{\n\t\t\t\tstring portListAsString = string(optarg);\n\t\t\t\tstringstream stream(portListAsString);\n\t\t\t\tstring portAsString;\n\t\t\t\tint port;\n\t\t\t\t\/\/ break comma-separated string into string list\n\t\t\t\twhile(getline(stream, portAsString, ','))\n\t\t\t\t{\n\t\t\t\t\tchar c;\n\t\t\t\t\tstd::stringstream stream2(portAsString);\n\t\t\t\t\tstream2 >> port;\n\t\t\t\t\tif (stream2.fail() || stream2.get(c))\n\t\t\t\t\t{\n\t\t\t\t\t\t\/\/ not an integer\n\t\t\t\t\t\tEXIT_WITH_ERROR_AND_PRINT_USAGE(\"DPDK ports list is invalid\");\n\t\t\t\t\t}\n\t\t\t\t\tdpdkPortVec.push_back(port);\n\t\t\t\t}\n\t\t\t\t\/\/ verify list contains two ports\n\t\t\t\tif(dpdkPortVec.size()!=2)\n\t\t\t\t{\n\t\t\t\t\tEXIT_WITH_ERROR_AND_PRINT_USAGE(\"DPDK list must contain two values\");\n\t\t\t\t}\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\tcase 'c':\n\t\t\t{\n\t\t\t\tcoreMaskToUse = atoi(optarg);\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\tcase 'm':\n\t\t\t{\n\t\t\t\tmBufPoolSize = atoi(optarg);\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\tcase 'h':\n\t\t\t{\n\t\t\t\tprintUsage();\n\t\t\t\texit(0);\n\t\t\t}\n\t\t\tcase 'v':\n\t\t\t{\n\t\t\t\tprintAppVersion();\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\tcase 'l':\n\t\t\t{\n\t\t\t\tlistDpdkPorts();\n\t\t\t\texit(0);\n\t\t\t}\n\t\t\tdefault:\n\t\t\t{\n\t\t\t\tprintUsage();\n\t\t\t\texit(0);\n\t\t\t}\n\t\t}\n\t}\n\n\t\/\/ verify list is not empty\n\tif (dpdkPortVec.empty())\n\t{\n\t\tEXIT_WITH_ERROR_AND_PRINT_USAGE(\"DPDK ports list is empty. Please use the -d switch\");\n\t}\n\n\t\/\/ extract core vector from core mask\n\tvector<SystemCore> coresToUse;\n\tcreateCoreVectorFromCoreMask(coreMaskToUse, coresToUse);\n\n\t\/\/ need minimum of 2 cores to start - 1 management core + 1 (or more) worker thread(s)\n\tif (coresToUse.size() < 2)\n\t{\n\t\tEXIT_WITH_ERROR(\"Needed minimum of 2 cores to start the application\");\n\t}\n\n\t\/\/ initialize DPDK\n\tif (!DpdkDeviceList::initDpdk(coreMaskToUse, mBufPoolSize))\n\t{\n\t\tEXIT_WITH_ERROR(\"Couldn't initialize DPDK\");\n\t}\n\n\t\/\/ removing DPDK master core from core mask because DPDK worker threads cannot run on master core\n\tcoreMaskToUse = coreMaskToUse & ~(DpdkDeviceList::getInstance().getDpdkMasterCore().Mask);\n\n\t\/\/ re-calculate cores to use after removing master core\n\tcoresToUse.clear();\n\tcreateCoreVectorFromCoreMask(coreMaskToUse, coresToUse);\n\n\t\/\/ collect the list of DPDK devices\n\tvector<DpdkDevice*> dpdkDevicesToUse;\n\tfor (vector<int>::iterator iter = dpdkPortVec.begin(); iter != dpdkPortVec.end(); iter++)\n\t{\n\t\tDpdkDevice* dev = DpdkDeviceList::getInstance().getDeviceByPort(*iter);\n\t\tif (dev == NULL)\n\t\t{\n\t\t\tEXIT_WITH_ERROR(\"DPDK device for port %d doesn't exist\", *iter);\n\t\t}\n\t\tdpdkDevicesToUse.push_back(dev);\n\t}\n\n\t\/\/ go over all devices and open them\n\tfor (vector<DpdkDevice*>::iterator iter = dpdkDevicesToUse.begin(); iter != dpdkDevicesToUse.end(); iter++)\n\t{\n\t\tif (!(*iter)->openMultiQueues(1,1))\n\t\t{\n\t\t\tEXIT_WITH_ERROR(\"Couldn't open DPDK device #%d, PMD '%s'\", (*iter)->getDeviceId(), (*iter)->getPMDName().c_str());\n\t\t}\n\t}\n\n\t\/\/ get DPDK device to send packets to (or NULL if doesn't exist)\n\tDpdkDevice* sendPacketsTo = DpdkDeviceList::getInstance().getDeviceByPort(sendPacketsToPort);\n\tif (sendPacketsTo != NULL && !sendPacketsTo->isOpened() && !sendPacketsTo->open())\n\t{\n\t\tEXIT_WITH_ERROR(\"Could not open port#%d for sending matched packets\", sendPacketsToPort);\n\t}\n\n\t\/\/ prepare configuration for every core\n\tAppWorkerConfig workerConfigArr[2];\n\tworkerConfigArr[0].CoreId = coresToUse.at(0).Id;\n\tworkerConfigArr[0].RxDevice = dpdkDevicesToUse.at(0);\n\tworkerConfigArr[0].TxDevice = dpdkDevicesToUse.at(1);\n\tworkerConfigArr[1].CoreId = coresToUse.at(1).Id;\n\tworkerConfigArr[1].RxDevice = dpdkDevicesToUse.at(1);\n\tworkerConfigArr[1].TxDevice = dpdkDevicesToUse.at(0);\n\n\t\/\/ create worker thread for every core\n\tvector<DpdkWorkerThread*> workerThreadVec;\n\tworkerThreadVec.push_back(new AppWorkerThread(workerConfigArr[0]));\n\tworkerThreadVec.push_back(new AppWorkerThread(workerConfigArr[1]));\n\n\t\/\/ start all worker threads\n\tif (!DpdkDeviceList::getInstance().startDpdkWorkerThreads(coreMaskToUse, workerThreadVec))\n\t{\n\t\tEXIT_WITH_ERROR(\"Couldn't start worker threads\");\n\t}\n\n\t\/\/ register the on app close event to print summary stats on app termination\n\tDpdkBridgeArgs args;\n\targs.workerThreadsVector = &workerThreadVec;\n\tApplicationEventHandler::getInstance().onApplicationInterrupted(onApplicationInterrupted, &args);\n\n\t\/\/ infinite loop (until program is terminated)\n\twhile (!args.shouldStop)\n\t{\n\t\tsleep(5);\n\t}\n}\n<commit_msg>Fix minimun core quantity validation<commit_after>\/**\n * Filter Traffic DPDK example application\n * =======================================\n * An application that listens to one or more DPDK ports (a.k.a DPDK devices), captures all traffic\n * and matches packets by user-defined matching criteria. Matching criteria is given on startup and can contain one or more of the following:\n * source IP, destination IP, source TCP\/UDP port, destination TCP\/UDP port and TCP or UDP protocol. Matching is done per flow, meaning the first packet\n * received on a flow is matched against the matching criteria and if it's matched then all packets of the same flow will be matched too.\n * Packets that are matched can be send to a DPDK port and\/or be save to a pcap file.\n * In addition the application collect statistics on received and matched packets: number of packets per protocol, number of matched flows and number\n * of matched packets.\n *\n * The application uses the concept of worker threads. Number of cores can be set by the user or set to default (default is all machine cores minus one\n * management core). Each core is assigned with one worker thread. The application divides the DPDK ports and RX queues equally between worker threads.\n * For example: if there are 2 DPDK ports to listen to, each one with 6 RX queues and there are 3 worker threads, then worker #1 will get RX queues\n * 1-4 of port 1, worker #2 will get RX queues 5-6 of port 1 and RX queues 1-2 of port 2, and worker #3 will get RX queues 3-6 of port 2.\n * Each worker thread does exactly the same work: receiving packets, collecting packet statistics, matching flows and sending\/saving matched packets\n *\n * __Important__: this application (like all applications using DPDK) should be run as 'sudo'\n *\/\n\n#include \"Common.h\"\n#include \"AppWorkerThread.h\"\n\n#include \"DpdkDeviceList.h\"\n#include \"IPv4Layer.h\"\n#include \"TcpLayer.h\"\n#include \"UdpLayer.h\"\n#include \"SystemUtils.h\"\n#include \"PcapPlusPlusVersion.h\"\n#include \"TablePrinter.h\"\n\n#include <vector>\n#include <iostream>\n#include <iomanip>\n#include <stdlib.h>\n#include <signal.h>\n#include <getopt.h>\n#include <string>\n#include <sstream>\n#include <unistd.h>\n\nusing namespace pcpp;\n\n#define DEFAULT_MBUF_POOL_SIZE 4095\n\n\nstatic struct option FilterTrafficOptions[] =\n{\n\t{\"dpdk-ports\", required_argument, 0, 'd'},\n\t{\"core-mask\", optional_argument, 0, 'c'},\n\t{\"mbuf-pool-size\", optional_argument, 0, 'm'},\n\t{\"help\", optional_argument, 0, 'h'},\n\t{\"version\", optional_argument, 0, 'v'},\n\t{\"list\", optional_argument, 0, 'l'},\n\t{0, 0, 0, 0}\n};\n\n\n\/**\n * Print application usage\n *\/\nvoid printUsage()\n{\n\tprintf(\"\\nUsage:\\n\"\n \"------\\n\"\n \"%s [-hvl] [-c CORE_MASK] [-m POOL_SIZE] -d PORT_1,PORT_2\\n\"\n\t\t\t\"\\nOptions:\\n\\n\"\n\t\t\t\" -h|--help : Displays this help message and exits\\n\"\n \" -v|--version : Displays the current version and exits\\n\"\n\t\t\t\" -l|--list : Print the list of DPDK ports and exists\\n\"\n\t\t\t\" -d|--dpdk-ports PORT_1,PORT_2 : A comma-separated list of two DPDK port numbers to be bridged.\\n\"\n\t\t\t\" To see all available DPDK ports use the -l switch\\n\"\n\t\t\t\" -c|--core-mask CORE_MASK : Core mask of cores to use. For example: use 7 (binary 0111) to use cores 0,1,2.\\n\"\n\t\t\t\" Default is using all cores except management core\\n\"\n\t\t\t\" -m|--mbuf-pool-size POOL_SIZE : DPDK mBuf pool size to initialize DPDK with. Default value is 4095\\n\\n\", AppName::get().c_str());\n}\n\n\n\/**\n * Print application version\n *\/\nvoid printAppVersion()\n{\n\tprintf(\"%s %s\\n\", AppName::get().c_str(), getPcapPlusPlusVersionFull().c_str());\n\tprintf(\"Built: %s\\n\", getBuildDateTime().c_str());\n\tprintf(\"Built from: %s\\n\", getGitInfo().c_str());\n\texit(0);\n}\n\n\n\/**\n * Print to console all available DPDK ports. Used by the -l switch\n *\/\nvoid listDpdkPorts()\n{\n\tCoreMask coreMaskToUse = getCoreMaskForAllMachineCores();\n\n\t\/\/ initialize DPDK\n\tif (!DpdkDeviceList::initDpdk(coreMaskToUse, DEFAULT_MBUF_POOL_SIZE))\n\t{\n\t\tEXIT_WITH_ERROR(\"couldn't initialize DPDK\");\n\t}\n\n\tprintf(\"DPDK port list:\\n\");\n\n\t\/\/ go over all available DPDK devices and print info for each one\n\tvector<DpdkDevice*> deviceList = DpdkDeviceList::getInstance().getDpdkDeviceList();\n\tfor (vector<DpdkDevice*>::iterator iter = deviceList.begin(); iter != deviceList.end(); iter++)\n\t{\n\t\tDpdkDevice* dev = *iter;\n\t\tprintf(\" Port #%d: MAC address='%s'; PCI address='%s'; PMD='%s'\\n\",\n\t\t\t\tdev->getDeviceId(),\n\t\t\t\tdev->getMacAddress().toString().c_str(),\n\t\t\t\tdev->getPciAddress().toString().c_str(),\n\t\t\t\tdev->getPMDName().c_str());\n\t}\n}\n\nstruct DpdkBridgeArgs\n{\n\tbool shouldStop;\n\tstd::vector<DpdkWorkerThread*>* workerThreadsVector;\n\n\tDpdkBridgeArgs() : shouldStop(false), workerThreadsVector(NULL) {}\n};\n\n\/**\n * The callback to be called when application is terminated by ctrl-c. Do cleanup and print summary stats\n *\/\nvoid onApplicationInterrupted(void* cookie)\n{\n\tDpdkBridgeArgs* args = (DpdkBridgeArgs*)cookie;\n\n\tprintf(\"\\n\\nApplication stopped\\n\");\n\n\t\/\/ stop worker threads\n\tDpdkDeviceList::getInstance().stopDpdkWorkerThreads();\n\n\t\/\/ create table printer\n\tstd::vector<std::string> columnNames;\n\tstd::vector<int> columnWidths;\n\tPacketStats::getStatsColumns(columnNames, columnWidths);\n\tTablePrinter printer(columnNames, columnWidths);\n\n\t\/\/ print final stats for every worker thread plus sum of all threads and free worker threads memory\n\tPacketStats aggregatedStats;\n\tfor (std::vector<DpdkWorkerThread*>::iterator iter = args->workerThreadsVector->begin(); iter != args->workerThreadsVector->end(); iter++)\n\t{\n\t\tAppWorkerThread* thread = (AppWorkerThread*)(*iter);\n\t\tPacketStats threadStats = thread->getStats();\n\t\taggregatedStats.collectStats(threadStats);\n\t\tprinter.printRow(threadStats.getStatValuesAsString(\"|\"), '|');\n\t\tdelete thread;\n\t}\n\n\tprinter.printSeparator();\n\tprinter.printRow(aggregatedStats.getStatValuesAsString(\"|\"), '|');\n\n\targs->shouldStop = true;\n}\n\n\n\/**\n * main method of the application. Responsible for parsing user args, preparing worker thread configuration, creating the worker threads and activate them.\n * At program termination worker threads are stopped, statistics are collected from them and printed to console\n *\/\nint main(int argc, char* argv[])\n{\n\tAppName::init(argc, argv);\n\n\tstd::vector<int> dpdkPortVec;\n\n\tCoreMask coreMaskToUse = getCoreMaskForAllMachineCores();\n\n\tint sendPacketsToPort = -1;\n\n\tint optionIndex = 0;\n\tchar opt = 0;\n\n\tuint32_t mBufPoolSize = DEFAULT_MBUF_POOL_SIZE;\n\n\twhile((opt = getopt_long (argc, argv, \"d:c:m:hvl\", FilterTrafficOptions, &optionIndex)) != -1)\n\t{\n\t\tswitch (opt)\n\t\t{\n\t\t\tcase 0:\n\t\t\t{\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\tcase 'd':\n\t\t\t{\n\t\t\t\tstring portListAsString = string(optarg);\n\t\t\t\tstringstream stream(portListAsString);\n\t\t\t\tstring portAsString;\n\t\t\t\tint port;\n\t\t\t\t\/\/ break comma-separated string into string list\n\t\t\t\twhile(getline(stream, portAsString, ','))\n\t\t\t\t{\n\t\t\t\t\tchar c;\n\t\t\t\t\tstd::stringstream stream2(portAsString);\n\t\t\t\t\tstream2 >> port;\n\t\t\t\t\tif (stream2.fail() || stream2.get(c))\n\t\t\t\t\t{\n\t\t\t\t\t\t\/\/ not an integer\n\t\t\t\t\t\tEXIT_WITH_ERROR_AND_PRINT_USAGE(\"DPDK ports list is invalid\");\n\t\t\t\t\t}\n\t\t\t\t\tdpdkPortVec.push_back(port);\n\t\t\t\t}\n\t\t\t\t\/\/ verify list contains two ports\n\t\t\t\tif(dpdkPortVec.size()!=2)\n\t\t\t\t{\n\t\t\t\t\tEXIT_WITH_ERROR_AND_PRINT_USAGE(\"DPDK list must contain two values\");\n\t\t\t\t}\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\tcase 'c':\n\t\t\t{\n\t\t\t\tcoreMaskToUse = atoi(optarg);\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\tcase 'm':\n\t\t\t{\n\t\t\t\tmBufPoolSize = atoi(optarg);\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\tcase 'h':\n\t\t\t{\n\t\t\t\tprintUsage();\n\t\t\t\texit(0);\n\t\t\t}\n\t\t\tcase 'v':\n\t\t\t{\n\t\t\t\tprintAppVersion();\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\tcase 'l':\n\t\t\t{\n\t\t\t\tlistDpdkPorts();\n\t\t\t\texit(0);\n\t\t\t}\n\t\t\tdefault:\n\t\t\t{\n\t\t\t\tprintUsage();\n\t\t\t\texit(0);\n\t\t\t}\n\t\t}\n\t}\n\n\t\/\/ verify list is not empty\n\tif (dpdkPortVec.empty())\n\t{\n\t\tEXIT_WITH_ERROR_AND_PRINT_USAGE(\"DPDK ports list is empty. Please use the -d switch\");\n\t}\n\n\t\/\/ extract core vector from core mask\n\tvector<SystemCore> coresToUse;\n\tcreateCoreVectorFromCoreMask(coreMaskToUse, coresToUse);\n\n\t\/\/ need minimum of 3 cores to start - 1 management core + 1 (or more) worker thread(s)\n\tif (coresToUse.size() < 3)\n\t{\n\t\tEXIT_WITH_ERROR(\"Needed minimum of 3 cores to start the application\");\n\t}\n\n\t\/\/ initialize DPDK\n\tif (!DpdkDeviceList::initDpdk(coreMaskToUse, mBufPoolSize))\n\t{\n\t\tEXIT_WITH_ERROR(\"Couldn't initialize DPDK\");\n\t}\n\n\t\/\/ removing DPDK master core from core mask because DPDK worker threads cannot run on master core\n\tcoreMaskToUse = coreMaskToUse & ~(DpdkDeviceList::getInstance().getDpdkMasterCore().Mask);\n\n\t\/\/ re-calculate cores to use after removing master core\n\tcoresToUse.clear();\n\tcreateCoreVectorFromCoreMask(coreMaskToUse, coresToUse);\n\n\t\/\/ collect the list of DPDK devices\n\tvector<DpdkDevice*> dpdkDevicesToUse;\n\tfor (vector<int>::iterator iter = dpdkPortVec.begin(); iter != dpdkPortVec.end(); iter++)\n\t{\n\t\tDpdkDevice* dev = DpdkDeviceList::getInstance().getDeviceByPort(*iter);\n\t\tif (dev == NULL)\n\t\t{\n\t\t\tEXIT_WITH_ERROR(\"DPDK device for port %d doesn't exist\", *iter);\n\t\t}\n\t\tdpdkDevicesToUse.push_back(dev);\n\t}\n\n\t\/\/ go over all devices and open them\n\tfor (vector<DpdkDevice*>::iterator iter = dpdkDevicesToUse.begin(); iter != dpdkDevicesToUse.end(); iter++)\n\t{\n\t\tif (!(*iter)->openMultiQueues(1,1))\n\t\t{\n\t\t\tEXIT_WITH_ERROR(\"Couldn't open DPDK device #%d, PMD '%s'\", (*iter)->getDeviceId(), (*iter)->getPMDName().c_str());\n\t\t}\n\t}\n\n\t\/\/ get DPDK device to send packets to (or NULL if doesn't exist)\n\tDpdkDevice* sendPacketsTo = DpdkDeviceList::getInstance().getDeviceByPort(sendPacketsToPort);\n\tif (sendPacketsTo != NULL && !sendPacketsTo->isOpened() && !sendPacketsTo->open())\n\t{\n\t\tEXIT_WITH_ERROR(\"Could not open port#%d for sending matched packets\", sendPacketsToPort);\n\t}\n\n\t\/\/ prepare configuration for every core\n\tAppWorkerConfig workerConfigArr[2];\n\tworkerConfigArr[0].CoreId = coresToUse.at(0).Id;\n\tworkerConfigArr[0].RxDevice = dpdkDevicesToUse.at(0);\n\tworkerConfigArr[0].TxDevice = dpdkDevicesToUse.at(1);\n\tworkerConfigArr[1].CoreId = coresToUse.at(1).Id;\n\tworkerConfigArr[1].RxDevice = dpdkDevicesToUse.at(1);\n\tworkerConfigArr[1].TxDevice = dpdkDevicesToUse.at(0);\n\n\t\/\/ create worker thread for every core\n\tvector<DpdkWorkerThread*> workerThreadVec;\n\tworkerThreadVec.push_back(new AppWorkerThread(workerConfigArr[0]));\n\tworkerThreadVec.push_back(new AppWorkerThread(workerConfigArr[1]));\n\n\t\/\/ start all worker threads\n\tif (!DpdkDeviceList::getInstance().startDpdkWorkerThreads(coreMaskToUse, workerThreadVec))\n\t{\n\t\tEXIT_WITH_ERROR(\"Couldn't start worker threads\");\n\t}\n\n\t\/\/ register the on app close event to print summary stats on app termination\n\tDpdkBridgeArgs args;\n\targs.workerThreadsVector = &workerThreadVec;\n\tApplicationEventHandler::getInstance().onApplicationInterrupted(onApplicationInterrupted, &args);\n\n\t\/\/ infinite loop (until program is terminated)\n\twhile (!args.shouldStop)\n\t{\n\t\tsleep(5);\n\t}\n}\n<|endoftext|>"} {"text":"<commit_before>\/\/ -*- mode: c++; c-basic-offset:4 -*-\n\n\/\/ This file is part of libdap, A C++ implementation of the OPeNDAP Data\n\/\/ Access Protocol.\n\n\/\/ Copyright (c) 2013 OPeNDAP, Inc.\n\/\/ Author: James Gallagher <jgallagher@opendap.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\/\/ You can contact OPeNDAP, Inc. at PO Box 112, Saunderstown, RI. 02874-0112.\n\n#include \"config.h\"\n\n#include <cppunit\/TestFixture.h>\n#include <cppunit\/TestAssert.h>\n#include <cppunit\/extensions\/TestFactoryRegistry.h>\n#include <cppunit\/ui\/text\/TestRunner.h>\n#include <cppunit\/extensions\/HelperMacros.h>\n#include <cppunit\/CompilerOutputter.h>\n\n#ifdef HAVE_UNISTD_H\n#include <unistd.h>\n#endif\n#include <fcntl.h>\n#include <stdint.h>\n\n#include <iostream>\n#include <fstream>\n#include <iomanip>\n#include <cstring>\n\n#include \"D4StreamUnMarshaller.h\"\n\n#include \"Type.h\"\n\n#include \"GetOpt.h\"\n#include \"debug.h\"\n#include \"test_config.h\"\n\nstatic bool debug = false;\n\n#undef DBG\n#define DBG(x) do { if (debug) (x); } while(false);\n\n#if WORDS_BIGENDIAN\nconst static string path = string(TEST_SRC_DIR) + \"\/D4-marshaller\/big-endian\";\n#else\nconst static string path = string(TEST_SRC_DIR) + \"\/D4-marshaller\/little-endian\";\n#endif\n\nusing namespace std;\nusing namespace libdap;\nusing namespace CppUnit;\n\nclass D4UnMarshallerTest: public CppUnit::TestFixture {\n\n CPPUNIT_TEST_SUITE (D4UnMarshallerTest);\n\n CPPUNIT_TEST (test_scalars);\n CPPUNIT_TEST (test_real_scalars);\n CPPUNIT_TEST (test_str);\n CPPUNIT_TEST (test_opaque);\n CPPUNIT_TEST (test_vector);\n\n CPPUNIT_TEST_SUITE_END( );\n\n static inline bool is_host_big_endian()\n {\n#ifdef COMPUTE_ENDIAN_AT_RUNTIME\n\n dods_int16 i = 0x0100;\n char *c = reinterpret_cast<char*>(&i);\n return *c;\n\n#else\n\n#ifdef __BIG_ENDIAN__\n return true;\n#else\n return false;\n#endif\n\n#endif\n }\n\npublic:\n D4UnMarshallerTest()\n {\n }\n\n void setUp()\n {\n }\n\n void tearDown()\n {\n }\n\n void test_scalars()\n {\n fstream in;\n in.exceptions(ostream::failbit | ostream::badbit);\n\n \/\/ computes checksums and writes data\n try {\n string file = path + \"\/test_scalars_1_bin.dat\";\n DBG(cerr << \"file: \" << file << endl);\n in.open(file.c_str(), fstream::binary | fstream::in);\n\n \/\/ Don't use is_host_big_endian() because these tests should\n \/\/ never 'twiddle bytes' They are always testing little to little\n \/\/ of big to big\n D4StreamUnMarshaller dsm(in, 0 \/*is_host_big_endian()*\/);\n\n dods_byte b;\n dsm.get_byte(b);\n CPPUNIT_ASSERT(b == 17);\n string ck = dsm.get_checksum_str();\n DBG(cerr << \"ck: \" << ck << endl);\n \/\/ Same checksum for both big- and little-endian\n CPPUNIT_ASSERT(ck == \"b8b2cf7f\");\n\n dods_int16 i1;\n dsm.get_int16(i1);\n CPPUNIT_ASSERT(i1 == 17);\n ck = dsm.get_checksum_str();\n DBG(cerr << \"ck: \" << ck << endl);\n \/\/ little-endian || big-endian checksum values\n CPPUNIT_ASSERT(ck == \"120031ef\" || ck == \"2b69320d\");\n\n dods_int32 i2;\n dsm.get_int32(i2);\n CPPUNIT_ASSERT(i2 == 17);\n ck = dsm.get_checksum_str();\n DBG(cerr << \"ck: \" << ck << endl);\n CPPUNIT_ASSERT(ck == \"c9e1efe6\" || ck == \"4bf4ffee\");\n\n dods_int64 i3;\n dsm.get_int64(i3);\n CPPUNIT_ASSERT(i3 == 17);\n ck = dsm.get_checksum_str();\n DBG(cerr << \"ck: \" << ck << endl);\n CPPUNIT_ASSERT(ck == \"d533eedc\" || ck == \"0f92ff9b\");\n\n dods_uint16 ui1;\n dsm.get_uint16(ui1);\n CPPUNIT_ASSERT(ui1 == 17);\n ck = dsm.get_checksum_str();\n DBG(cerr << \"ck: \" << ck << endl);\n CPPUNIT_ASSERT(ck == \"120031ef\" || ck == \"2b69320d\");\n\n dods_uint32 ui2;\n dsm.get_uint32(ui2);\n CPPUNIT_ASSERT(ui2 == 17);\n ck = dsm.get_checksum_str();\n DBG(cerr << \"ck: \" << ck << endl);\n CPPUNIT_ASSERT(ck == \"c9e1efe6\" || ck == \"4bf4ffee\");\n\n dods_uint64 ui3;\n dsm.get_uint64(ui3);\n CPPUNIT_ASSERT(ui3 == 17);\n ck = dsm.get_checksum_str();\n DBG(cerr << \"ck: \" << ck << endl);\n CPPUNIT_ASSERT(ck == \"d533eedc\" || ck == \"0f92ff9b\");\n }\n catch (Error &e) {\n cerr << \"Error: \" << e.get_error_message() << endl;\n CPPUNIT_FAIL(\"Caught an exception.\");\n }\n catch (istream::failure &e) {\n cerr << \"File error: \" << e.what() << endl;\n CPPUNIT_FAIL(\"Caught an exception.\");\n }\n }\n\n void test_real_scalars()\n {\n fstream in;\n in.exceptions(ostream::failbit | ostream::badbit);\n\n \/\/ computes checksums and writes data\n try {\n string file = path + \"\/test_scalars_2_bin.dat\";\n in.open(file.c_str(), fstream::binary | fstream::in);\n D4StreamUnMarshaller dsm(in, 0);\n\n dods_float32 r1;\n dsm.get_float32(r1);\n CPPUNIT_ASSERT(r1 == 17.0);\n string ck = dsm.get_checksum_str();\n DBG(cerr << \"ck: \" << ck << endl);\n CPPUNIT_ASSERT(ck == \"d3c5bc59\" || ck == \"edcaaa7c\");\n\n dods_float64 r2;\n dsm.get_float64(r2);\n CPPUNIT_ASSERT(r2 == 17.0);\n ck = dsm.get_checksum_str();\n DBG(cerr << \"ck: \" << ck << endl);\n CPPUNIT_ASSERT(ck == \"d5a3994b\" || ck == \"42abb362\");\n }\n catch (Error &e) {\n cerr << \"Error: \" << e.get_error_message() << endl;\n CPPUNIT_FAIL(\"Caught an exception.\");\n }\n catch (istream::failure &e) {\n cerr << \"File error: \" << e.what() << endl;\n CPPUNIT_FAIL(\"Caught an exception.\");\n }\n }\n\n void test_str()\n {\n fstream in;\n in.exceptions(ostream::failbit | ostream::badbit);\n\n \/\/ computes checksums and writes data\n try {\n string file = path + \"\/test_scalars_3_bin.dat\";\n in.open(file.c_str(), fstream::binary | fstream::in);\n D4StreamUnMarshaller dsm(in, 0);\n\n string s;\n dsm.get_str(s);\n CPPUNIT_ASSERT(s == \"This is a test string with 40 characters\");\n string ck = dsm.get_checksum_str();\n DBG(cerr << \"ck: \" << ck << endl);\n CPPUNIT_ASSERT(ck == \"af117544\");\n\n string u;\n dsm.get_url(u);\n CPPUNIT_ASSERT(u == \"http:\/\/www.opendap.org\/lame\/unit\/test\");\n ck = dsm.get_checksum_str();\n DBG(cerr << \"ck: \" << ck << endl);\n CPPUNIT_ASSERT(ck == \"41e10081\");\n }\n catch (Error &e) {\n cerr << \"Error: \" << e.get_error_message() << endl;\n CPPUNIT_FAIL(\"Caught an exception.\");\n }\n catch (istream::failure &e) {\n cerr << \"File error: \" << e.what() << endl;\n CPPUNIT_FAIL(\"Caught an exception.\");\n }\n }\n\n void test_opaque()\n {\n fstream in;\n in.exceptions(ostream::failbit | ostream::badbit);\n\n \/\/ computes checksums and writes data\n try {\n string file = path + \"\/test_opaque_1_bin.dat\";\n in.open(file.c_str(), fstream::binary | fstream::in);\n D4StreamUnMarshaller dsm(in, 0);\n\n char *buf2;\n int64_t len;\n dsm.get_opaque_dap4(&buf2, len);\n CPPUNIT_ASSERT(len == 32768);\n for (int i = 0; i < 32768; ++i)\n CPPUNIT_ASSERT(buf2[i] == i % (1 << 7));\n string ck = dsm.get_checksum_str();\n DBG(cerr << \"ck: \" << ck << endl);\n CPPUNIT_ASSERT(ck == \"199ad7f5\");\n\n delete buf2;\n }\n catch (Error &e) {\n cerr << \"Error: \" << e.get_error_message() << endl;\n CPPUNIT_FAIL(\"Caught an exception.\");\n }\n catch (istream::failure &e) {\n cerr << \"File error: \" << e.what() << endl;\n CPPUNIT_FAIL(\"Caught an exception.\");\n }\n }\n\n void test_vector()\n {\n fstream in;\n in.exceptions(ostream::failbit | ostream::badbit);\n\n \/\/ computes checksums and writes data\n try {\n string file = path + \"\/test_vector_1_bin.dat\";\n in.open(file.c_str(), fstream::binary | fstream::in);\n D4StreamUnMarshaller dsm(in, 0);\n\n vector<unsigned char> buf1(32768);\n dsm.get_vector(reinterpret_cast<char*>(&buf1[0]), 32768);\n for (int i = 0; i < 32768; ++i)\n CPPUNIT_ASSERT(buf1[i] == i % (1 << 7));\n string ck = dsm.get_checksum_str();\n DBG(cerr << \"ck: \" << ck << endl);\n CPPUNIT_ASSERT(ck == \"199ad7f5\" || ck == \"199ad7f5\");\n\n vector<dods_int32> buf2(32768);\n dsm.get_vector(reinterpret_cast<char*>(&buf2[0]), 32768, sizeof(dods_int32));\n for (int i = 0; i < 32768; ++i)\n CPPUNIT_ASSERT(buf2[i] == i % (1 << 9));\n ck = dsm.get_checksum_str();\n DBG(cerr << \"ck: \" << ck << endl);\n CPPUNIT_ASSERT(ck == \"5c1bf29f\" || ck == \"8efd2d3d\");\n\n vector<dods_float64> buf3(32768);\n dsm.get_vector_float64(reinterpret_cast<char*>(&buf3[0]), 32768);\n for (int i = 0; i < 32768; ++i) {\n if (buf3[i] != i % (1 << 9)) cerr << \"buf3[\" << i << \"]: \" << buf3[i] << endl;\n CPPUNIT_ASSERT(buf3[i] == i % (1 << 9));\n }\n ck = dsm.get_checksum_str();\n DBG(cerr << \"ck: \" << ck << endl);\n CPPUNIT_ASSERT(ck == \"aafc2a91\" || ck == \"7bdf9931\");\n }\n catch (Error &e) {\n cerr << \"Error: \" << e.get_error_message() << endl;\n CPPUNIT_FAIL(\"Caught an exception.\");\n }\n catch (istream::failure &e) {\n cerr << \"File error: \" << e.what() << endl;\n CPPUNIT_FAIL(\"Caught an exception.\");\n }\n }\n\n};\n\nCPPUNIT_TEST_SUITE_REGISTRATION (D4UnMarshallerTest);\n\nint main(int argc, char*argv[])\n{\n GetOpt getopt(argc, argv, \"dh\");\n int option_char;\n\n while ((option_char = getopt()) != -1)\n switch (option_char) {\n case 'd':\n debug = true; \/\/ debug is a static global\n break;\n case 'h': { \/\/ help - show test names\n cerr << \"Usage: D4UnMarshallerTest has the following tests:\" << endl;\n const std::vector<Test*> &tests = D4UnMarshallerTest::suite()->getTests();\n unsigned int prefix_len = D4UnMarshallerTest::suite()->getName().append(\"::\").length();\n for (std::vector<Test*>::const_iterator i = tests.begin(), e = tests.end(); i != e; ++i) {\n cerr << (*i)->getName().replace(0, prefix_len, \"\") << endl;\n }\n break;\n }\n default:\n break;\n }\n\n CppUnit::TextTestRunner runner;\n runner.addTest(CppUnit::TestFactoryRegistry::getRegistry().makeTest());\n\n bool wasSuccessful = true;\n string test = \"\";\n int i = getopt.optind;\n if (i == argc) {\n \/\/ run them all\n wasSuccessful = runner.run(\"\");\n }\n else {\n for (; i < argc; ++i) {\n if (debug) cerr << \"Running \" << argv[i] << endl;\n test = D4UnMarshallerTest::suite()->getName().append(\"::\").append(argv[i]);\n wasSuccessful = wasSuccessful && runner.run(test);\n }\n }\n\n return wasSuccessful ? 0 : 1;\n}\n<commit_msg>Fixed memory error in D4UnMarshallerTest.<commit_after>\/\/ -*- mode: c++; c-basic-offset:4 -*-\n\n\/\/ This file is part of libdap, A C++ implementation of the OPeNDAP Data\n\/\/ Access Protocol.\n\n\/\/ Copyright (c) 2013 OPeNDAP, Inc.\n\/\/ Author: James Gallagher <jgallagher@opendap.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\/\/ You can contact OPeNDAP, Inc. at PO Box 112, Saunderstown, RI. 02874-0112.\n\n#include \"config.h\"\n\n#include <cppunit\/TestFixture.h>\n#include <cppunit\/TestAssert.h>\n#include <cppunit\/extensions\/TestFactoryRegistry.h>\n#include <cppunit\/ui\/text\/TestRunner.h>\n#include <cppunit\/extensions\/HelperMacros.h>\n#include <cppunit\/CompilerOutputter.h>\n\n#ifdef HAVE_UNISTD_H\n#include <unistd.h>\n#endif\n#include <fcntl.h>\n#include <stdint.h>\n\n#include <iostream>\n#include <fstream>\n#include <iomanip>\n#include <cstring>\n\n#include \"D4StreamUnMarshaller.h\"\n\n#include \"Type.h\"\n\n#include \"GetOpt.h\"\n#include \"debug.h\"\n#include \"test_config.h\"\n\nstatic bool debug = false;\n\n#undef DBG\n#define DBG(x) do { if (debug) (x); } while(false);\n\n#if WORDS_BIGENDIAN\nconst static string path = string(TEST_SRC_DIR) + \"\/D4-marshaller\/big-endian\";\n#else\nconst static string path = string(TEST_SRC_DIR) + \"\/D4-marshaller\/little-endian\";\n#endif\n\nusing namespace std;\nusing namespace libdap;\nusing namespace CppUnit;\n\nclass D4UnMarshallerTest: public CppUnit::TestFixture {\n\n CPPUNIT_TEST_SUITE (D4UnMarshallerTest);\n\n CPPUNIT_TEST (test_scalars);\n CPPUNIT_TEST (test_real_scalars);\n CPPUNIT_TEST (test_str);\n CPPUNIT_TEST (test_opaque);\n CPPUNIT_TEST (test_vector);\n\n CPPUNIT_TEST_SUITE_END( );\n\n static inline bool is_host_big_endian()\n {\n#ifdef COMPUTE_ENDIAN_AT_RUNTIME\n\n dods_int16 i = 0x0100;\n char *c = reinterpret_cast<char*>(&i);\n return *c;\n\n#else\n\n#ifdef __BIG_ENDIAN__\n return true;\n#else\n return false;\n#endif\n\n#endif\n }\n\npublic:\n D4UnMarshallerTest()\n {\n }\n\n void setUp()\n {\n }\n\n void tearDown()\n {\n }\n\n void test_scalars()\n {\n fstream in;\n in.exceptions(ostream::failbit | ostream::badbit);\n\n \/\/ computes checksums and writes data\n try {\n string file = path + \"\/test_scalars_1_bin.dat\";\n DBG(cerr << \"file: \" << file << endl);\n in.open(file.c_str(), fstream::binary | fstream::in);\n\n \/\/ Don't use is_host_big_endian() because these tests should\n \/\/ never 'twiddle bytes' They are always testing little to little\n \/\/ of big to big\n D4StreamUnMarshaller dsm(in, 0 \/*is_host_big_endian()*\/);\n\n dods_byte b;\n dsm.get_byte(b);\n CPPUNIT_ASSERT(b == 17);\n string ck = dsm.get_checksum_str();\n DBG(cerr << \"ck: \" << ck << endl);\n \/\/ Same checksum for both big- and little-endian\n CPPUNIT_ASSERT(ck == \"b8b2cf7f\");\n\n dods_int16 i1;\n dsm.get_int16(i1);\n CPPUNIT_ASSERT(i1 == 17);\n ck = dsm.get_checksum_str();\n DBG(cerr << \"ck: \" << ck << endl);\n \/\/ little-endian || big-endian checksum values\n CPPUNIT_ASSERT(ck == \"120031ef\" || ck == \"2b69320d\");\n\n dods_int32 i2;\n dsm.get_int32(i2);\n CPPUNIT_ASSERT(i2 == 17);\n ck = dsm.get_checksum_str();\n DBG(cerr << \"ck: \" << ck << endl);\n CPPUNIT_ASSERT(ck == \"c9e1efe6\" || ck == \"4bf4ffee\");\n\n dods_int64 i3;\n dsm.get_int64(i3);\n CPPUNIT_ASSERT(i3 == 17);\n ck = dsm.get_checksum_str();\n DBG(cerr << \"ck: \" << ck << endl);\n CPPUNIT_ASSERT(ck == \"d533eedc\" || ck == \"0f92ff9b\");\n\n dods_uint16 ui1;\n dsm.get_uint16(ui1);\n CPPUNIT_ASSERT(ui1 == 17);\n ck = dsm.get_checksum_str();\n DBG(cerr << \"ck: \" << ck << endl);\n CPPUNIT_ASSERT(ck == \"120031ef\" || ck == \"2b69320d\");\n\n dods_uint32 ui2;\n dsm.get_uint32(ui2);\n CPPUNIT_ASSERT(ui2 == 17);\n ck = dsm.get_checksum_str();\n DBG(cerr << \"ck: \" << ck << endl);\n CPPUNIT_ASSERT(ck == \"c9e1efe6\" || ck == \"4bf4ffee\");\n\n dods_uint64 ui3;\n dsm.get_uint64(ui3);\n CPPUNIT_ASSERT(ui3 == 17);\n ck = dsm.get_checksum_str();\n DBG(cerr << \"ck: \" << ck << endl);\n CPPUNIT_ASSERT(ck == \"d533eedc\" || ck == \"0f92ff9b\");\n }\n catch (Error &e) {\n cerr << \"Error: \" << e.get_error_message() << endl;\n CPPUNIT_FAIL(\"Caught an exception.\");\n }\n catch (istream::failure &e) {\n cerr << \"File error: \" << e.what() << endl;\n CPPUNIT_FAIL(\"Caught an exception.\");\n }\n }\n\n void test_real_scalars()\n {\n fstream in;\n in.exceptions(ostream::failbit | ostream::badbit);\n\n \/\/ computes checksums and writes data\n try {\n string file = path + \"\/test_scalars_2_bin.dat\";\n in.open(file.c_str(), fstream::binary | fstream::in);\n D4StreamUnMarshaller dsm(in, 0);\n\n dods_float32 r1;\n dsm.get_float32(r1);\n CPPUNIT_ASSERT(r1 == 17.0);\n string ck = dsm.get_checksum_str();\n DBG(cerr << \"ck: \" << ck << endl);\n CPPUNIT_ASSERT(ck == \"d3c5bc59\" || ck == \"edcaaa7c\");\n\n dods_float64 r2;\n dsm.get_float64(r2);\n CPPUNIT_ASSERT(r2 == 17.0);\n ck = dsm.get_checksum_str();\n DBG(cerr << \"ck: \" << ck << endl);\n CPPUNIT_ASSERT(ck == \"d5a3994b\" || ck == \"42abb362\");\n }\n catch (Error &e) {\n cerr << \"Error: \" << e.get_error_message() << endl;\n CPPUNIT_FAIL(\"Caught an exception.\");\n }\n catch (istream::failure &e) {\n cerr << \"File error: \" << e.what() << endl;\n CPPUNIT_FAIL(\"Caught an exception.\");\n }\n }\n\n void test_str()\n {\n fstream in;\n in.exceptions(ostream::failbit | ostream::badbit);\n\n \/\/ computes checksums and writes data\n try {\n string file = path + \"\/test_scalars_3_bin.dat\";\n in.open(file.c_str(), fstream::binary | fstream::in);\n D4StreamUnMarshaller dsm(in, 0);\n\n string s;\n dsm.get_str(s);\n CPPUNIT_ASSERT(s == \"This is a test string with 40 characters\");\n string ck = dsm.get_checksum_str();\n DBG(cerr << \"ck: \" << ck << endl);\n CPPUNIT_ASSERT(ck == \"af117544\");\n\n string u;\n dsm.get_url(u);\n CPPUNIT_ASSERT(u == \"http:\/\/www.opendap.org\/lame\/unit\/test\");\n ck = dsm.get_checksum_str();\n DBG(cerr << \"ck: \" << ck << endl);\n CPPUNIT_ASSERT(ck == \"41e10081\");\n }\n catch (Error &e) {\n cerr << \"Error: \" << e.get_error_message() << endl;\n CPPUNIT_FAIL(\"Caught an exception.\");\n }\n catch (istream::failure &e) {\n cerr << \"File error: \" << e.what() << endl;\n CPPUNIT_FAIL(\"Caught an exception.\");\n }\n }\n\n void test_opaque()\n {\n fstream in;\n in.exceptions(ostream::failbit | ostream::badbit);\n\n \/\/ computes checksums and writes data\n try {\n string file = path + \"\/test_opaque_1_bin.dat\";\n in.open(file.c_str(), fstream::binary | fstream::in);\n D4StreamUnMarshaller dsm(in, 0);\n\n char *buf2;\n int64_t len;\n dsm.get_opaque_dap4(&buf2, len);\n CPPUNIT_ASSERT(len == 32768);\n for (int i = 0; i < 32768; ++i)\n CPPUNIT_ASSERT(buf2[i] == i % (1 << 7));\n string ck = dsm.get_checksum_str();\n DBG(cerr << \"ck: \" << ck << endl);\n CPPUNIT_ASSERT(ck == \"199ad7f5\");\n\n delete[] buf2;\n }\n catch (Error &e) {\n cerr << \"Error: \" << e.get_error_message() << endl;\n CPPUNIT_FAIL(\"Caught an exception.\");\n }\n catch (istream::failure &e) {\n cerr << \"File error: \" << e.what() << endl;\n CPPUNIT_FAIL(\"Caught an exception.\");\n }\n }\n\n void test_vector()\n {\n fstream in;\n in.exceptions(ostream::failbit | ostream::badbit);\n\n \/\/ computes checksums and writes data\n try {\n string file = path + \"\/test_vector_1_bin.dat\";\n in.open(file.c_str(), fstream::binary | fstream::in);\n D4StreamUnMarshaller dsm(in, 0);\n\n vector<unsigned char> buf1(32768);\n dsm.get_vector(reinterpret_cast<char*>(&buf1[0]), 32768);\n for (int i = 0; i < 32768; ++i)\n CPPUNIT_ASSERT(buf1[i] == i % (1 << 7));\n string ck = dsm.get_checksum_str();\n DBG(cerr << \"ck: \" << ck << endl);\n CPPUNIT_ASSERT(ck == \"199ad7f5\" || ck == \"199ad7f5\");\n\n vector<dods_int32> buf2(32768);\n dsm.get_vector(reinterpret_cast<char*>(&buf2[0]), 32768, sizeof(dods_int32));\n for (int i = 0; i < 32768; ++i)\n CPPUNIT_ASSERT(buf2[i] == i % (1 << 9));\n ck = dsm.get_checksum_str();\n DBG(cerr << \"ck: \" << ck << endl);\n CPPUNIT_ASSERT(ck == \"5c1bf29f\" || ck == \"8efd2d3d\");\n\n vector<dods_float64> buf3(32768);\n dsm.get_vector_float64(reinterpret_cast<char*>(&buf3[0]), 32768);\n for (int i = 0; i < 32768; ++i) {\n if (buf3[i] != i % (1 << 9)) cerr << \"buf3[\" << i << \"]: \" << buf3[i] << endl;\n CPPUNIT_ASSERT(buf3[i] == i % (1 << 9));\n }\n ck = dsm.get_checksum_str();\n DBG(cerr << \"ck: \" << ck << endl);\n CPPUNIT_ASSERT(ck == \"aafc2a91\" || ck == \"7bdf9931\");\n }\n catch (Error &e) {\n cerr << \"Error: \" << e.get_error_message() << endl;\n CPPUNIT_FAIL(\"Caught an exception.\");\n }\n catch (istream::failure &e) {\n cerr << \"File error: \" << e.what() << endl;\n CPPUNIT_FAIL(\"Caught an exception.\");\n }\n }\n\n};\n\nCPPUNIT_TEST_SUITE_REGISTRATION (D4UnMarshallerTest);\n\nint main(int argc, char*argv[])\n{\n GetOpt getopt(argc, argv, \"dh\");\n int option_char;\n\n while ((option_char = getopt()) != -1)\n switch (option_char) {\n case 'd':\n debug = true; \/\/ debug is a static global\n break;\n case 'h': { \/\/ help - show test names\n cerr << \"Usage: D4UnMarshallerTest has the following tests:\" << endl;\n const std::vector<Test*> &tests = D4UnMarshallerTest::suite()->getTests();\n unsigned int prefix_len = D4UnMarshallerTest::suite()->getName().append(\"::\").length();\n for (std::vector<Test*>::const_iterator i = tests.begin(), e = tests.end(); i != e; ++i) {\n cerr << (*i)->getName().replace(0, prefix_len, \"\") << endl;\n }\n break;\n }\n default:\n break;\n }\n\n CppUnit::TextTestRunner runner;\n runner.addTest(CppUnit::TestFactoryRegistry::getRegistry().makeTest());\n\n bool wasSuccessful = true;\n string test = \"\";\n int i = getopt.optind;\n if (i == argc) {\n \/\/ run them all\n wasSuccessful = runner.run(\"\");\n }\n else {\n for (; i < argc; ++i) {\n if (debug) cerr << \"Running \" << argv[i] << endl;\n test = D4UnMarshallerTest::suite()->getName().append(\"::\").append(argv[i]);\n wasSuccessful = wasSuccessful && runner.run(test);\n }\n }\n\n return wasSuccessful ? 0 : 1;\n}\n<|endoftext|>"} {"text":"<commit_before>\/* This file is part of the Kate project.\n *\n * Copyright (C) 2012 Christoph Cullmann <cullmann@kde.org>\n *\n * This library is free software; you can redistribute it and\/or\n * modify it under the terms of the GNU Library General Public\n * License as published by the Free Software Foundation; either\n * version 2 of the License, or (at your option) any later version.\n *\n * This library is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU\n * Library General Public License for more details.\n *\n * You should have received a copy of the GNU Library General Public License\n * along with this library; see the file COPYING.LIB. If not, write to\n * the Free Software Foundation, Inc., 51 Franklin Street, Fifth Floor,\n * Boston, MA 02110-1301, USA.\n *\/\n\n#include \"kateprojectinfoviewcodeanalysis.h\"\n#include \"kateprojectpluginview.h\"\n\n#include <QVBoxLayout>\n#include <QHBoxLayout>\n#include <QFileInfo>\n\n#include <klocalizedstring.h>\n#include <kmessagewidget.h>\n\nKateProjectInfoViewCodeAnalysis::KateProjectInfoViewCodeAnalysis(KateProjectPluginView *pluginView, KateProject *project)\n : QWidget()\n , m_pluginView(pluginView)\n , m_project(project)\n , m_messageWidget(0)\n , m_startStopAnalysis(new QPushButton(i18n(\"Start Analysis...\")))\n , m_treeView(new QTreeView())\n , m_model(new QStandardItemModel(m_treeView))\n , m_analyzer(0)\n{\n \/**\n * default style\n *\/\n m_treeView->setEditTriggers(QAbstractItemView::NoEditTriggers);\n m_treeView->setUniformRowHeights(true);\n m_treeView->setRootIsDecorated(false);\n m_model->setHorizontalHeaderLabels(QStringList() << QStringLiteral(\"File\") << QStringLiteral(\"Line\") << QStringLiteral(\"Severity\") << QStringLiteral(\"Message\"));\n\n \/**\n * attach model\n * kill selection model\n *\/\n QItemSelectionModel *m = m_treeView->selectionModel();\n m_treeView->setModel(m_model);\n delete m;\n\n m_treeView->setSortingEnabled(true);\n m_treeView->sortByColumn(1, Qt::AscendingOrder);\n m_treeView->sortByColumn(2, Qt::AscendingOrder);\n\n \/**\n * layout widget\n *\/\n QVBoxLayout *layout = new QVBoxLayout;\n layout->setSpacing(0);\n layout->addWidget(m_treeView);\n QHBoxLayout *hlayout = new QHBoxLayout;\n layout->addLayout(hlayout);\n hlayout->setSpacing(0);\n hlayout->addStretch();\n hlayout->addWidget(m_startStopAnalysis);\n setLayout(layout);\n\n \/**\n * connect needed signals\n *\/\n connect(m_startStopAnalysis, SIGNAL(clicked(bool)), this, SLOT(slotStartStopClicked()));\n connect(m_treeView, SIGNAL(clicked(const QModelIndex &)), this, SLOT(slotClicked(const QModelIndex &)));\n}\n\nKateProjectInfoViewCodeAnalysis::~KateProjectInfoViewCodeAnalysis()\n{\n}\n\nvoid KateProjectInfoViewCodeAnalysis::slotStartStopClicked()\n{\n \/**\n * get files for cppcheck\n *\/\n QStringList files = m_project->files().filter(QRegExp(QStringLiteral(\"\\\\.(cpp|cxx|cc|c\\\\+\\\\+|c|tpp|txx)$\")));\n\n \/**\n * clear existing entries\n *\/\n m_model->removeRows(0, m_model->rowCount(), QModelIndex());\n\n \/**\n * launch cppcheck\n *\/\n m_analyzer = new QProcess(this);\n m_analyzer->setProcessChannelMode(QProcess::MergedChannels);\n\n connect(m_analyzer, SIGNAL(readyRead()), this, SLOT(slotReadyRead()));\n connect(m_analyzer, SIGNAL(finished(int, QProcess::ExitStatus)),\n this, SLOT(finished(int, QProcess::ExitStatus)));\n\n QStringList args;\n args << QStringLiteral(\"-q\") << QStringLiteral(\"--inline-suppr\") << QStringLiteral(\"--enable=all\") << QStringLiteral(\"--template={file}\/\/\/\/{line}\/\/\/\/{severity}\/\/\/\/{message}\") << QStringLiteral(\"--file-list=-\");\n m_analyzer->start(QStringLiteral(\"cppcheck\"), args);\n\n if (m_messageWidget) {\n delete m_messageWidget;\n m_messageWidget = 0;\n }\n\n if (!m_analyzer->waitForStarted()) {\n m_messageWidget = new KMessageWidget();\n m_messageWidget->setCloseButtonVisible(true);\n m_messageWidget->setMessageType(KMessageWidget::Warning);\n m_messageWidget->setWordWrap(false);\n m_messageWidget->setText(i18n(\"Please install 'cppcheck'.\"));\n static_cast<QVBoxLayout *>(layout())->insertWidget(0, m_messageWidget);\n m_messageWidget->animatedShow();\n return;\n }\n \/**\n * write files list and close write channel\n *\/\n m_analyzer->write(files.join(QStringLiteral(\"\\n\")).toLocal8Bit());\n m_analyzer->closeWriteChannel();\n}\n\nvoid KateProjectInfoViewCodeAnalysis::slotReadyRead()\n{\n \/**\n * get results of analysis\n *\/\n while (m_analyzer->canReadLine()) {\n \/**\n * get one line, split it, skip it, if too few elements\n *\/\n QString line = QString::fromLocal8Bit(m_analyzer->readLine());\n QStringList elements = line.split(QRegExp(QStringLiteral(\"\/\/\/\/\")), QString::SkipEmptyParts);\n if (elements.size() < 4) {\n continue;\n }\n\n \/**\n * feed into model\n *\/\n QList<QStandardItem *> items;\n QStandardItem *fileNameItem = new QStandardItem(QFileInfo(elements[0]).fileName());\n fileNameItem->setToolTip(elements[0]);\n items << fileNameItem;\n items << new QStandardItem(elements[1]);\n items << new QStandardItem(elements[2]);\n const auto message = elements[3].simplified();\n auto messageItem = new QStandardItem(message);\n messageItem->setToolTip(message);\n items << messageItem;\n m_model->appendRow(items);\n }\n\n \/**\n * tree view polish ;)\n *\/\n m_treeView->resizeColumnToContents(2);\n m_treeView->resizeColumnToContents(1);\n m_treeView->resizeColumnToContents(0);\n}\n\nvoid KateProjectInfoViewCodeAnalysis::slotClicked(const QModelIndex &index)\n{\n \/**\n * get path\n *\/\n QString filePath = m_model->item(index.row(), 0)->toolTip();\n if (filePath.isEmpty()) {\n return;\n }\n\n \/**\n * create view\n *\/\n KTextEditor::View *view = m_pluginView->mainWindow()->openUrl(QUrl::fromLocalFile(filePath));\n if (!view) {\n return;\n }\n\n \/**\n * set cursor, if possible\n *\/\n int line = m_model->item(index.row(), 1)->text().toInt();\n if (line >= 1) {\n view->setCursorPosition(KTextEditor::Cursor(line - 1, 0));\n }\n}\n\nvoid KateProjectInfoViewCodeAnalysis::finished(int exitCode, QProcess::ExitStatus)\n{\n m_messageWidget = new KMessageWidget();\n m_messageWidget->setCloseButtonVisible(true);\n m_messageWidget->setWordWrap(false);\n\n if (exitCode == 0) {\n m_messageWidget->setMessageType(KMessageWidget::Information);\n m_messageWidget->setText(i18n(\"Analysis finished.\"));\n } else {\n \/\/ unfortunately, output was eaten by slotReadyRead()\n \/\/ TODO: get stderr output, show it here\n m_messageWidget->setMessageType(KMessageWidget::Warning);\n m_messageWidget->setText(i18n(\"Analysis failed!\"));\n }\n static_cast<QVBoxLayout*>(layout ())->insertWidget(0, m_messageWidget);\n m_messageWidget->animatedShow ();\n}\n<commit_msg>add i18n calls to make the strings translatable<commit_after>\/* This file is part of the Kate project.\n *\n * Copyright (C) 2012 Christoph Cullmann <cullmann@kde.org>\n *\n * This library is free software; you can redistribute it and\/or\n * modify it under the terms of the GNU Library General Public\n * License as published by the Free Software Foundation; either\n * version 2 of the License, or (at your option) any later version.\n *\n * This library is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU\n * Library General Public License for more details.\n *\n * You should have received a copy of the GNU Library General Public License\n * along with this library; see the file COPYING.LIB. If not, write to\n * the Free Software Foundation, Inc., 51 Franklin Street, Fifth Floor,\n * Boston, MA 02110-1301, USA.\n *\/\n\n#include \"kateprojectinfoviewcodeanalysis.h\"\n#include \"kateprojectpluginview.h\"\n\n#include <QVBoxLayout>\n#include <QHBoxLayout>\n#include <QFileInfo>\n\n#include <klocalizedstring.h>\n#include <kmessagewidget.h>\n\nKateProjectInfoViewCodeAnalysis::KateProjectInfoViewCodeAnalysis(KateProjectPluginView *pluginView, KateProject *project)\n : QWidget()\n , m_pluginView(pluginView)\n , m_project(project)\n , m_messageWidget(0)\n , m_startStopAnalysis(new QPushButton(i18n(\"Start Analysis...\")))\n , m_treeView(new QTreeView())\n , m_model(new QStandardItemModel(m_treeView))\n , m_analyzer(0)\n{\n \/**\n * default style\n *\/\n m_treeView->setEditTriggers(QAbstractItemView::NoEditTriggers);\n m_treeView->setUniformRowHeights(true);\n m_treeView->setRootIsDecorated(false);\n m_model->setHorizontalHeaderLabels(QStringList() << i18n(\"File\") << i18n(\"Line\") << i18n(\"Severity\") << i18n(\"Message\"));\n\n \/**\n * attach model\n * kill selection model\n *\/\n QItemSelectionModel *m = m_treeView->selectionModel();\n m_treeView->setModel(m_model);\n delete m;\n\n m_treeView->setSortingEnabled(true);\n m_treeView->sortByColumn(1, Qt::AscendingOrder);\n m_treeView->sortByColumn(2, Qt::AscendingOrder);\n\n \/**\n * layout widget\n *\/\n QVBoxLayout *layout = new QVBoxLayout;\n layout->setSpacing(0);\n layout->addWidget(m_treeView);\n QHBoxLayout *hlayout = new QHBoxLayout;\n layout->addLayout(hlayout);\n hlayout->setSpacing(0);\n hlayout->addStretch();\n hlayout->addWidget(m_startStopAnalysis);\n setLayout(layout);\n\n \/**\n * connect needed signals\n *\/\n connect(m_startStopAnalysis, SIGNAL(clicked(bool)), this, SLOT(slotStartStopClicked()));\n connect(m_treeView, SIGNAL(clicked(const QModelIndex &)), this, SLOT(slotClicked(const QModelIndex &)));\n}\n\nKateProjectInfoViewCodeAnalysis::~KateProjectInfoViewCodeAnalysis()\n{\n}\n\nvoid KateProjectInfoViewCodeAnalysis::slotStartStopClicked()\n{\n \/**\n * get files for cppcheck\n *\/\n QStringList files = m_project->files().filter(QRegExp(QStringLiteral(\"\\\\.(cpp|cxx|cc|c\\\\+\\\\+|c|tpp|txx)$\")));\n\n \/**\n * clear existing entries\n *\/\n m_model->removeRows(0, m_model->rowCount(), QModelIndex());\n\n \/**\n * launch cppcheck\n *\/\n m_analyzer = new QProcess(this);\n m_analyzer->setProcessChannelMode(QProcess::MergedChannels);\n\n connect(m_analyzer, SIGNAL(readyRead()), this, SLOT(slotReadyRead()));\n connect(m_analyzer, SIGNAL(finished(int, QProcess::ExitStatus)),\n this, SLOT(finished(int, QProcess::ExitStatus)));\n\n QStringList args;\n args << QStringLiteral(\"-q\") << QStringLiteral(\"--inline-suppr\") << QStringLiteral(\"--enable=all\") << QStringLiteral(\"--template={file}\/\/\/\/{line}\/\/\/\/{severity}\/\/\/\/{message}\") << QStringLiteral(\"--file-list=-\");\n m_analyzer->start(QStringLiteral(\"cppcheck\"), args);\n\n if (m_messageWidget) {\n delete m_messageWidget;\n m_messageWidget = 0;\n }\n\n if (!m_analyzer->waitForStarted()) {\n m_messageWidget = new KMessageWidget();\n m_messageWidget->setCloseButtonVisible(true);\n m_messageWidget->setMessageType(KMessageWidget::Warning);\n m_messageWidget->setWordWrap(false);\n m_messageWidget->setText(i18n(\"Please install 'cppcheck'.\"));\n static_cast<QVBoxLayout *>(layout())->insertWidget(0, m_messageWidget);\n m_messageWidget->animatedShow();\n return;\n }\n \/**\n * write files list and close write channel\n *\/\n m_analyzer->write(files.join(QStringLiteral(\"\\n\")).toLocal8Bit());\n m_analyzer->closeWriteChannel();\n}\n\nvoid KateProjectInfoViewCodeAnalysis::slotReadyRead()\n{\n \/**\n * get results of analysis\n *\/\n while (m_analyzer->canReadLine()) {\n \/**\n * get one line, split it, skip it, if too few elements\n *\/\n QString line = QString::fromLocal8Bit(m_analyzer->readLine());\n QStringList elements = line.split(QRegExp(QStringLiteral(\"\/\/\/\/\")), QString::SkipEmptyParts);\n if (elements.size() < 4) {\n continue;\n }\n\n \/**\n * feed into model\n *\/\n QList<QStandardItem *> items;\n QStandardItem *fileNameItem = new QStandardItem(QFileInfo(elements[0]).fileName());\n fileNameItem->setToolTip(elements[0]);\n items << fileNameItem;\n items << new QStandardItem(elements[1]);\n items << new QStandardItem(elements[2]);\n const auto message = elements[3].simplified();\n auto messageItem = new QStandardItem(message);\n messageItem->setToolTip(message);\n items << messageItem;\n m_model->appendRow(items);\n }\n\n \/**\n * tree view polish ;)\n *\/\n m_treeView->resizeColumnToContents(2);\n m_treeView->resizeColumnToContents(1);\n m_treeView->resizeColumnToContents(0);\n}\n\nvoid KateProjectInfoViewCodeAnalysis::slotClicked(const QModelIndex &index)\n{\n \/**\n * get path\n *\/\n QString filePath = m_model->item(index.row(), 0)->toolTip();\n if (filePath.isEmpty()) {\n return;\n }\n\n \/**\n * create view\n *\/\n KTextEditor::View *view = m_pluginView->mainWindow()->openUrl(QUrl::fromLocalFile(filePath));\n if (!view) {\n return;\n }\n\n \/**\n * set cursor, if possible\n *\/\n int line = m_model->item(index.row(), 1)->text().toInt();\n if (line >= 1) {\n view->setCursorPosition(KTextEditor::Cursor(line - 1, 0));\n }\n}\n\nvoid KateProjectInfoViewCodeAnalysis::finished(int exitCode, QProcess::ExitStatus)\n{\n m_messageWidget = new KMessageWidget();\n m_messageWidget->setCloseButtonVisible(true);\n m_messageWidget->setWordWrap(false);\n\n if (exitCode == 0) {\n m_messageWidget->setMessageType(KMessageWidget::Information);\n m_messageWidget->setText(i18n(\"Analysis finished.\"));\n } else {\n \/\/ unfortunately, output was eaten by slotReadyRead()\n \/\/ TODO: get stderr output, show it here\n m_messageWidget->setMessageType(KMessageWidget::Warning);\n m_messageWidget->setText(i18n(\"Analysis failed!\"));\n }\n static_cast<QVBoxLayout*>(layout ())->insertWidget(0, m_messageWidget);\n m_messageWidget->animatedShow ();\n}\n<|endoftext|>"} {"text":"<commit_before>\/\/ Copyright 2011 the V8 project authors. All rights reserved.\n\/\/ Redistribution and use in source and binary forms, with or without\n\/\/ modification, are permitted provided that the following conditions are\n\/\/ met:\n\/\/\n\/\/ * Redistributions of source code must retain the above copyright\n\/\/ notice, this list of conditions and the following disclaimer.\n\/\/ * Redistributions in binary form must reproduce the above\n\/\/ copyright notice, this list of conditions and the following\n\/\/ disclaimer in the documentation and\/or other materials provided\n\/\/ with the distribution.\n\/\/ * Neither the name of Google Inc. nor the names of its\n\/\/ contributors may be used to endorse or promote products derived\n\/\/ from this software without specific prior written permission.\n\/\/\n\/\/ THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS\n\/\/ \"AS IS\" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT\n\/\/ LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR\n\/\/ A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT\n\/\/ OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,\n\/\/ SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT\n\/\/ LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,\n\/\/ DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY\n\/\/ THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT\n\/\/ (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE\n\/\/ OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.\n\n#include <stdlib.h>\n\n#include <vector>\n\n#include \"src\/v8.h\"\n\n#include \"src\/base\/platform\/platform.h\"\n#include \"src\/utils-inl.h\"\n#include \"test\/cctest\/cctest.h\"\n\nusing namespace v8::internal;\n\n\nTEST(Utils1) {\n CHECK_EQ(-1000000, FastD2I(-1000000.0));\n CHECK_EQ(-1, FastD2I(-1.0));\n CHECK_EQ(0, FastD2I(0.0));\n CHECK_EQ(1, FastD2I(1.0));\n CHECK_EQ(1000000, FastD2I(1000000.0));\n\n CHECK_EQ(-1000000, FastD2I(-1000000.123));\n CHECK_EQ(-1, FastD2I(-1.234));\n CHECK_EQ(0, FastD2I(0.345));\n CHECK_EQ(1, FastD2I(1.234));\n CHECK_EQ(1000000, FastD2I(1000000.123));\n \/\/ Check that >> is implemented as arithmetic shift right.\n \/\/ If this is not true, then ArithmeticShiftRight() must be changed,\n \/\/ There are also documented right shifts in assembler.cc of\n \/\/ int8_t and intptr_t signed integers.\n CHECK_EQ(-2, -8 >> 2);\n CHECK_EQ(-2, static_cast<int8_t>(-8) >> 2);\n CHECK_EQ(-2, static_cast<int>(static_cast<intptr_t>(-8) >> 2));\n\n CHECK_EQ(-1000000, FastD2IChecked(-1000000.0));\n CHECK_EQ(-1, FastD2IChecked(-1.0));\n CHECK_EQ(0, FastD2IChecked(0.0));\n CHECK_EQ(1, FastD2IChecked(1.0));\n CHECK_EQ(1000000, FastD2IChecked(1000000.0));\n\n CHECK_EQ(-1000000, FastD2IChecked(-1000000.123));\n CHECK_EQ(-1, FastD2IChecked(-1.234));\n CHECK_EQ(0, FastD2IChecked(0.345));\n CHECK_EQ(1, FastD2IChecked(1.234));\n CHECK_EQ(1000000, FastD2IChecked(1000000.123));\n\n CHECK_EQ(INT_MAX, FastD2IChecked(1.0e100));\n CHECK_EQ(INT_MIN, FastD2IChecked(-1.0e100));\n CHECK_EQ(INT_MIN, FastD2IChecked(v8::base::OS::nan_value()));\n}\n\n\nTEST(SNPrintF) {\n \/\/ Make sure that strings that are truncated because of too small\n \/\/ buffers are zero-terminated anyway.\n const char* s = \"the quick lazy .... oh forget it!\";\n int length = StrLength(s);\n for (int i = 1; i < length * 2; i++) {\n static const char kMarker = static_cast<char>(42);\n Vector<char> buffer = Vector<char>::New(i + 1);\n buffer[i] = kMarker;\n int n = SNPrintF(Vector<char>(buffer.start(), i), \"%s\", s);\n CHECK(n <= i);\n CHECK(n == length || n == -1);\n CHECK_EQ(0, strncmp(buffer.start(), s, i - 1));\n CHECK_EQ(kMarker, buffer[i]);\n if (i <= length) {\n CHECK_EQ(i - 1, StrLength(buffer.start()));\n } else {\n CHECK_EQ(length, StrLength(buffer.start()));\n }\n buffer.Dispose();\n }\n}\n\n\nstatic const int kAreaSize = 512;\n\n\nvoid TestMemMove(byte* area1,\n byte* area2,\n int src_offset,\n int dest_offset,\n int length) {\n for (int i = 0; i < kAreaSize; i++) {\n area1[i] = i & 0xFF;\n area2[i] = i & 0xFF;\n }\n MemMove(area1 + dest_offset, area1 + src_offset, length);\n memmove(area2 + dest_offset, area2 + src_offset, length);\n if (memcmp(area1, area2, kAreaSize) != 0) {\n printf(\"MemMove(): src_offset: %d, dest_offset: %d, length: %d\\n\",\n src_offset, dest_offset, length);\n for (int i = 0; i < kAreaSize; i++) {\n if (area1[i] == area2[i]) continue;\n printf(\"diff at offset %d (%p): is %d, should be %d\\n\", i,\n reinterpret_cast<void*>(area1 + i), area1[i], area2[i]);\n }\n CHECK(false);\n }\n}\n\n\nTEST(MemMove) {\n v8::V8::Initialize();\n byte* area1 = new byte[kAreaSize];\n byte* area2 = new byte[kAreaSize];\n\n static const int kMinOffset = 32;\n static const int kMaxOffset = 64;\n static const int kMaxLength = 128;\n STATIC_ASSERT(kMaxOffset + kMaxLength < kAreaSize);\n\n for (int src_offset = kMinOffset; src_offset <= kMaxOffset; src_offset++) {\n for (int dst_offset = kMinOffset; dst_offset <= kMaxOffset; dst_offset++) {\n for (int length = 0; length <= kMaxLength; length++) {\n TestMemMove(area1, area2, src_offset, dst_offset, length);\n }\n }\n }\n delete[] area1;\n delete[] area2;\n}\n\n\nTEST(Collector) {\n Collector<int> collector(8);\n const int kLoops = 5;\n const int kSequentialSize = 1000;\n const int kBlockSize = 7;\n for (int loop = 0; loop < kLoops; loop++) {\n Vector<int> block = collector.AddBlock(7, 0xbadcafe);\n for (int i = 0; i < kSequentialSize; i++) {\n collector.Add(i);\n }\n for (int i = 0; i < kBlockSize - 1; i++) {\n block[i] = i * 7;\n }\n }\n Vector<int> result = collector.ToVector();\n CHECK_EQ(kLoops * (kBlockSize + kSequentialSize), result.length());\n for (int i = 0; i < kLoops; i++) {\n int offset = i * (kSequentialSize + kBlockSize);\n for (int j = 0; j < kBlockSize - 1; j++) {\n CHECK_EQ(j * 7, result[offset + j]);\n }\n CHECK_EQ(0xbadcafe, result[offset + kBlockSize - 1]);\n for (int j = 0; j < kSequentialSize; j++) {\n CHECK_EQ(j, result[offset + kBlockSize + j]);\n }\n }\n result.Dispose();\n}\n\n\nTEST(SequenceCollector) {\n SequenceCollector<int> collector(8);\n const int kLoops = 5000;\n const int kMaxSequenceSize = 13;\n int total_length = 0;\n for (int loop = 0; loop < kLoops; loop++) {\n int seq_length = loop % kMaxSequenceSize;\n collector.StartSequence();\n for (int j = 0; j < seq_length; j++) {\n collector.Add(j);\n }\n Vector<int> sequence = collector.EndSequence();\n for (int j = 0; j < seq_length; j++) {\n CHECK_EQ(j, sequence[j]);\n }\n total_length += seq_length;\n }\n Vector<int> result = collector.ToVector();\n CHECK_EQ(total_length, result.length());\n int offset = 0;\n for (int loop = 0; loop < kLoops; loop++) {\n int seq_length = loop % kMaxSequenceSize;\n for (int j = 0; j < seq_length; j++) {\n CHECK_EQ(j, result[offset]);\n offset++;\n }\n }\n result.Dispose();\n}\n\n\nTEST(SequenceCollectorRegression) {\n SequenceCollector<char> collector(16);\n collector.StartSequence();\n collector.Add('0');\n collector.AddBlock(\n i::Vector<const char>(\"12345678901234567890123456789012\", 32));\n i::Vector<char> seq = collector.EndSequence();\n CHECK_EQ(0, strncmp(\"0123456789012345678901234567890123\",\n seq.start(), seq.length()));\n}\n\n\n\/\/ TODO(svenpanne) Unconditionally test this when our infrastructure is fixed.\n#if 0 && !V8_CC_MSVC && !V8_OS_NACL\nTEST(CPlusPlus11Features) {\n struct S {\n bool x;\n struct T {\n double y;\n int z[3];\n } t;\n };\n S s{true, {3.1415, {1, 2, 3}}};\n CHECK_EQ(2, s.t.z[1]);\n\n\/\/ TODO(svenpanne) Remove the old-skool code when we ship the new C++ headers.\n#if 0\n std::vector<int> vec{11, 22, 33, 44};\n#else\n std::vector<int> vec;\n vec.push_back(11);\n vec.push_back(22);\n vec.push_back(33);\n vec.push_back(44);\n#endif\n vec.push_back(55);\n vec.push_back(66);\n for (auto& i : vec) {\n ++i;\n }\n int j = 12;\n for (auto i : vec) {\n CHECK_EQ(j, i);\n j += 11;\n }\n}\n#endif\n<commit_msg>Re-enable C++11 tests (still not on VS or NaCL).<commit_after>\/\/ Copyright 2011 the V8 project authors. All rights reserved.\n\/\/ Redistribution and use in source and binary forms, with or without\n\/\/ modification, are permitted provided that the following conditions are\n\/\/ met:\n\/\/\n\/\/ * Redistributions of source code must retain the above copyright\n\/\/ notice, this list of conditions and the following disclaimer.\n\/\/ * Redistributions in binary form must reproduce the above\n\/\/ copyright notice, this list of conditions and the following\n\/\/ disclaimer in the documentation and\/or other materials provided\n\/\/ with the distribution.\n\/\/ * Neither the name of Google Inc. nor the names of its\n\/\/ contributors may be used to endorse or promote products derived\n\/\/ from this software without specific prior written permission.\n\/\/\n\/\/ THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS\n\/\/ \"AS IS\" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT\n\/\/ LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR\n\/\/ A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT\n\/\/ OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,\n\/\/ SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT\n\/\/ LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,\n\/\/ DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY\n\/\/ THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT\n\/\/ (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE\n\/\/ OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.\n\n#include <stdlib.h>\n\n#include <vector>\n\n#include \"src\/v8.h\"\n\n#include \"src\/base\/platform\/platform.h\"\n#include \"src\/utils-inl.h\"\n#include \"test\/cctest\/cctest.h\"\n\nusing namespace v8::internal;\n\n\nTEST(Utils1) {\n CHECK_EQ(-1000000, FastD2I(-1000000.0));\n CHECK_EQ(-1, FastD2I(-1.0));\n CHECK_EQ(0, FastD2I(0.0));\n CHECK_EQ(1, FastD2I(1.0));\n CHECK_EQ(1000000, FastD2I(1000000.0));\n\n CHECK_EQ(-1000000, FastD2I(-1000000.123));\n CHECK_EQ(-1, FastD2I(-1.234));\n CHECK_EQ(0, FastD2I(0.345));\n CHECK_EQ(1, FastD2I(1.234));\n CHECK_EQ(1000000, FastD2I(1000000.123));\n \/\/ Check that >> is implemented as arithmetic shift right.\n \/\/ If this is not true, then ArithmeticShiftRight() must be changed,\n \/\/ There are also documented right shifts in assembler.cc of\n \/\/ int8_t and intptr_t signed integers.\n CHECK_EQ(-2, -8 >> 2);\n CHECK_EQ(-2, static_cast<int8_t>(-8) >> 2);\n CHECK_EQ(-2, static_cast<int>(static_cast<intptr_t>(-8) >> 2));\n\n CHECK_EQ(-1000000, FastD2IChecked(-1000000.0));\n CHECK_EQ(-1, FastD2IChecked(-1.0));\n CHECK_EQ(0, FastD2IChecked(0.0));\n CHECK_EQ(1, FastD2IChecked(1.0));\n CHECK_EQ(1000000, FastD2IChecked(1000000.0));\n\n CHECK_EQ(-1000000, FastD2IChecked(-1000000.123));\n CHECK_EQ(-1, FastD2IChecked(-1.234));\n CHECK_EQ(0, FastD2IChecked(0.345));\n CHECK_EQ(1, FastD2IChecked(1.234));\n CHECK_EQ(1000000, FastD2IChecked(1000000.123));\n\n CHECK_EQ(INT_MAX, FastD2IChecked(1.0e100));\n CHECK_EQ(INT_MIN, FastD2IChecked(-1.0e100));\n CHECK_EQ(INT_MIN, FastD2IChecked(v8::base::OS::nan_value()));\n}\n\n\nTEST(SNPrintF) {\n \/\/ Make sure that strings that are truncated because of too small\n \/\/ buffers are zero-terminated anyway.\n const char* s = \"the quick lazy .... oh forget it!\";\n int length = StrLength(s);\n for (int i = 1; i < length * 2; i++) {\n static const char kMarker = static_cast<char>(42);\n Vector<char> buffer = Vector<char>::New(i + 1);\n buffer[i] = kMarker;\n int n = SNPrintF(Vector<char>(buffer.start(), i), \"%s\", s);\n CHECK(n <= i);\n CHECK(n == length || n == -1);\n CHECK_EQ(0, strncmp(buffer.start(), s, i - 1));\n CHECK_EQ(kMarker, buffer[i]);\n if (i <= length) {\n CHECK_EQ(i - 1, StrLength(buffer.start()));\n } else {\n CHECK_EQ(length, StrLength(buffer.start()));\n }\n buffer.Dispose();\n }\n}\n\n\nstatic const int kAreaSize = 512;\n\n\nvoid TestMemMove(byte* area1,\n byte* area2,\n int src_offset,\n int dest_offset,\n int length) {\n for (int i = 0; i < kAreaSize; i++) {\n area1[i] = i & 0xFF;\n area2[i] = i & 0xFF;\n }\n MemMove(area1 + dest_offset, area1 + src_offset, length);\n memmove(area2 + dest_offset, area2 + src_offset, length);\n if (memcmp(area1, area2, kAreaSize) != 0) {\n printf(\"MemMove(): src_offset: %d, dest_offset: %d, length: %d\\n\",\n src_offset, dest_offset, length);\n for (int i = 0; i < kAreaSize; i++) {\n if (area1[i] == area2[i]) continue;\n printf(\"diff at offset %d (%p): is %d, should be %d\\n\", i,\n reinterpret_cast<void*>(area1 + i), area1[i], area2[i]);\n }\n CHECK(false);\n }\n}\n\n\nTEST(MemMove) {\n v8::V8::Initialize();\n byte* area1 = new byte[kAreaSize];\n byte* area2 = new byte[kAreaSize];\n\n static const int kMinOffset = 32;\n static const int kMaxOffset = 64;\n static const int kMaxLength = 128;\n STATIC_ASSERT(kMaxOffset + kMaxLength < kAreaSize);\n\n for (int src_offset = kMinOffset; src_offset <= kMaxOffset; src_offset++) {\n for (int dst_offset = kMinOffset; dst_offset <= kMaxOffset; dst_offset++) {\n for (int length = 0; length <= kMaxLength; length++) {\n TestMemMove(area1, area2, src_offset, dst_offset, length);\n }\n }\n }\n delete[] area1;\n delete[] area2;\n}\n\n\nTEST(Collector) {\n Collector<int> collector(8);\n const int kLoops = 5;\n const int kSequentialSize = 1000;\n const int kBlockSize = 7;\n for (int loop = 0; loop < kLoops; loop++) {\n Vector<int> block = collector.AddBlock(7, 0xbadcafe);\n for (int i = 0; i < kSequentialSize; i++) {\n collector.Add(i);\n }\n for (int i = 0; i < kBlockSize - 1; i++) {\n block[i] = i * 7;\n }\n }\n Vector<int> result = collector.ToVector();\n CHECK_EQ(kLoops * (kBlockSize + kSequentialSize), result.length());\n for (int i = 0; i < kLoops; i++) {\n int offset = i * (kSequentialSize + kBlockSize);\n for (int j = 0; j < kBlockSize - 1; j++) {\n CHECK_EQ(j * 7, result[offset + j]);\n }\n CHECK_EQ(0xbadcafe, result[offset + kBlockSize - 1]);\n for (int j = 0; j < kSequentialSize; j++) {\n CHECK_EQ(j, result[offset + kBlockSize + j]);\n }\n }\n result.Dispose();\n}\n\n\nTEST(SequenceCollector) {\n SequenceCollector<int> collector(8);\n const int kLoops = 5000;\n const int kMaxSequenceSize = 13;\n int total_length = 0;\n for (int loop = 0; loop < kLoops; loop++) {\n int seq_length = loop % kMaxSequenceSize;\n collector.StartSequence();\n for (int j = 0; j < seq_length; j++) {\n collector.Add(j);\n }\n Vector<int> sequence = collector.EndSequence();\n for (int j = 0; j < seq_length; j++) {\n CHECK_EQ(j, sequence[j]);\n }\n total_length += seq_length;\n }\n Vector<int> result = collector.ToVector();\n CHECK_EQ(total_length, result.length());\n int offset = 0;\n for (int loop = 0; loop < kLoops; loop++) {\n int seq_length = loop % kMaxSequenceSize;\n for (int j = 0; j < seq_length; j++) {\n CHECK_EQ(j, result[offset]);\n offset++;\n }\n }\n result.Dispose();\n}\n\n\nTEST(SequenceCollectorRegression) {\n SequenceCollector<char> collector(16);\n collector.StartSequence();\n collector.Add('0');\n collector.AddBlock(\n i::Vector<const char>(\"12345678901234567890123456789012\", 32));\n i::Vector<char> seq = collector.EndSequence();\n CHECK_EQ(0, strncmp(\"0123456789012345678901234567890123\",\n seq.start(), seq.length()));\n}\n\n\n\/\/ TODO(svenpanne) Unconditionally test this when our infrastructure is fixed.\n#if !V8_CC_MSVC && !V8_OS_NACL\nTEST(CPlusPlus11Features) {\n struct S {\n bool x;\n struct T {\n double y;\n int z[3];\n } t;\n };\n S s{true, {3.1415, {1, 2, 3}}};\n CHECK_EQ(2, s.t.z[1]);\n\n\/\/ TODO(svenpanne) Remove the old-skool code when we ship the new C++ headers.\n#if 0\n std::vector<int> vec{11, 22, 33, 44};\n#else\n std::vector<int> vec;\n vec.push_back(11);\n vec.push_back(22);\n vec.push_back(33);\n vec.push_back(44);\n#endif\n vec.push_back(55);\n vec.push_back(66);\n for (auto& i : vec) {\n ++i;\n }\n int j = 12;\n for (auto i : vec) {\n CHECK_EQ(j, i);\n j += 11;\n }\n}\n#endif\n<|endoftext|>"} {"text":"<commit_before>\/* Copyright 2017 The TensorFlow Authors. All Rights Reserved.\n\nLicensed under the Apache License, Version 2.0 (the \"License\");\nyou may not use this file except in compliance with the License.\nYou may obtain a copy of the License at\n\n http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n\nUnless required by applicable law or agreed to in writing, software\ndistributed under the License is distributed on an \"AS IS\" BASIS,\nWITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\nSee the License for the specific language governing permissions and\nlimitations under the License.\n==============================================================================*\/\n\n#include \"tensorflow\/compiler\/aot\/codegen.h\"\n\n#include <string>\n#include <vector>\n\n#include \"absl\/strings\/match.h\"\n#include \"absl\/strings\/string_view.h\"\n#include \"llvm\/Support\/TargetSelect.h\"\n#include \"tensorflow\/compiler\/xla\/cpu_function_runtime.h\"\n#include \"tensorflow\/compiler\/xla\/shape_util.h\"\n#include \"tensorflow\/core\/framework\/tensor_shape.pb.h\"\n#include \"tensorflow\/core\/framework\/types.pb.h\"\n#include \"tensorflow\/core\/lib\/core\/status.h\"\n#include \"tensorflow\/core\/lib\/core\/status_test_util.h\"\n#include \"tensorflow\/core\/lib\/io\/path.h\"\n#include \"tensorflow\/core\/platform\/env.h\"\n#include \"tensorflow\/core\/platform\/test.h\"\n\nnamespace tensorflow {\nnamespace tfcompile {\nnamespace {\n\nusing ::xla::cpu_function_runtime::BufferInfo;\n\nvoid ExpectErrorContains(const Status& status, absl::string_view str) {\n EXPECT_NE(Status::OK(), status);\n EXPECT_TRUE(absl::StrContains(status.error_message(), str))\n << \"expected error: \" << status.error_message() << \" to contain: \" << str;\n}\n\nTEST(ValidateCppIdent, Simple) {\n TF_EXPECT_OK(ValidateCppIdent(\"a\", \"\"));\n TF_EXPECT_OK(ValidateCppIdent(\"abc\", \"\"));\n TF_EXPECT_OK(ValidateCppIdent(\"_abc\", \"\"));\n TF_EXPECT_OK(ValidateCppIdent(\"_abc123\", \"\"));\n \/\/ Make sure we didn't skip a valid letter or digit\n string ident;\n for (char c = 'a'; c <= 'z'; c++) {\n ident.append(1, c);\n }\n for (char c = 'A'; c <= 'Z'; c++) {\n ident.append(1, c);\n }\n for (char c = '0'; c <= '9'; c++) {\n ident.append(1, c);\n }\n ident += \"_\";\n TF_EXPECT_OK(ValidateCppIdent(ident, \"\"));\n\n ExpectErrorContains(ValidateCppIdent(\"\", \"\"), \"empty identifier\");\n ExpectErrorContains(ValidateCppIdent(\" \", \"\"), \"illegal leading char\");\n ExpectErrorContains(ValidateCppIdent(\"0\", \"\"), \"illegal leading char\");\n ExpectErrorContains(ValidateCppIdent(\".\", \"\"), \"illegal leading char\");\n ExpectErrorContains(ValidateCppIdent(\":\", \"\"), \"illegal leading char\");\n ExpectErrorContains(ValidateCppIdent(\"a.\", \"\"), \"illegal char\");\n ExpectErrorContains(ValidateCppIdent(\"a:\", \"\"), \"illegal char\");\n ExpectErrorContains(ValidateCppIdent(\"a:\", \"\"), \"illegal char\");\n}\n\nclass ParseCppClassTest : public ::testing::Test {\n protected:\n void ExpectOK(const string& cpp_class, const string& want_class_name,\n const std::vector<string>& want_namespaces) {\n string class_name;\n std::vector<string> namespaces;\n TF_EXPECT_OK(ParseCppClass(cpp_class, &class_name, &namespaces));\n EXPECT_EQ(class_name, want_class_name);\n EXPECT_EQ(namespaces, want_namespaces);\n }\n\n void ExpectFail(const string& cpp_class) {\n string class_name;\n std::vector<string> namespaces;\n EXPECT_NE(ParseCppClass(cpp_class, &class_name, &namespaces), Status::OK())\n << cpp_class;\n }\n};\n\nTEST_F(ParseCppClassTest, ParseOK) {\n ExpectOK(\"MyClass\", \"MyClass\", {});\n ExpectOK(\"_MyClass\", \"_MyClass\", {});\n ExpectOK(\"a::MyClass\", \"MyClass\", {\"a\"});\n ExpectOK(\"a::foo::MyClass\", \"MyClass\", {\"a\", \"foo\"});\n ExpectOK(\"a::foo::b::MyClass\", \"MyClass\", {\"a\", \"foo\", \"b\"});\n ExpectOK(\"a::foo::b::bar::MyClass\", \"MyClass\", {\"a\", \"foo\", \"b\", \"bar\"});\n ExpectOK(\"foo::MyClass\", \"MyClass\", {\"foo\"});\n ExpectOK(\"_foo::MyClass\", \"MyClass\", {\"_foo\"});\n ExpectOK(\"_foo::_MyClass\", \"_MyClass\", {\"_foo\"});\n ExpectOK(\"::foo::bar::MyClass\", \"MyClass\", {\"foo\", \"bar\"});\n ExpectOK(\"::_foo::MyClass\", \"MyClass\", {\"_foo\"});\n ExpectOK(\"::_foo::_MyClass\", \"_MyClass\", {\"_foo\"});\n \/\/ Make sure we didn't skip a valid letter or digit\n string ident;\n for (char c = 'a'; c <= 'z'; c++) {\n ident.append(1, c);\n }\n for (char c = 'A'; c <= 'Z'; c++) {\n ident.append(1, c);\n }\n for (char c = '0'; c <= '9'; c++) {\n ident.append(1, c);\n }\n ident += \"_\";\n ExpectOK(ident, ident, {});\n ExpectOK(ident + \"::\" + ident, ident, {ident});\n ExpectOK(ident + \"::\" + ident + \"::\" + ident, ident, {ident, ident});\n}\n\nTEST_F(ParseCppClassTest, ParseFail) {\n ExpectFail(\"\");\n ExpectFail(\"::\");\n ExpectFail(\"0\");\n ExpectFail(\"a.b\");\n ExpectFail(\"a:b\");\n ExpectFail(\":foo::bar\");\n ExpectFail(\"good::.bad\");\n ExpectFail(\"good:::bad\");\n ExpectFail(\"good::bad::\");\n ExpectFail(\"good::::bad\");\n ExpectFail(\"::::bad\");\n ExpectFail(\"good:: bad\");\n ExpectFail(\"good::0bad\");\n}\n\nstatic void CompareWithGoldenFile(\n const string& tensorflow_relative_golden_file_name,\n const string& expected_contents) {\n \/\/ To update the golden file, flip update_golden to true and run the\n \/\/ following:\n \/\/ bazel test --test_strategy=local \\\n \/\/ third_party\/tensorflow\/compiler\/aot:codegen_test\n const bool update_golden = false;\n const string golden_file_name = io::JoinPath(\n testing::TensorFlowSrcRoot(), tensorflow_relative_golden_file_name);\n\n if (update_golden) {\n TF_EXPECT_OK(\n WriteStringToFile(Env::Default(), golden_file_name, expected_contents));\n }\n\n string golden_file_contents;\n TF_ASSERT_OK(ReadFileToString(Env::Default(), golden_file_name,\n &golden_file_contents));\n EXPECT_EQ(golden_file_contents, expected_contents);\n}\n\nTEST(CodegenTest, Golden) {\n \/\/ Normally CpuCompiler::CpuCompiler does this, but in this test we've\n \/\/ bypassed the Cpu compiler so we have to do this manually.\n llvm::InitializeNativeTarget();\n llvm::InitializeNativeTargetAsmPrinter();\n LLVMInitializeX86Target();\n LLVMInitializeX86TargetMC();\n\n CodegenOpts opts;\n opts.class_name = \"MyClass\";\n opts.target_triple = \"x86_64-pc-linux\";\n opts.namespaces = {\"foo\", \"bar\"};\n opts.gen_name_to_index = true;\n opts.gen_program_shape = true;\n tf2xla::Config config;\n tf2xla::Feed* feed = config.add_feed();\n feed->mutable_id()->set_node_name(\"feed0\");\n feed->set_name(\"myfeed\");\n feed = config.add_feed();\n feed->mutable_id()->set_node_name(\"feed1\");\n tf2xla::Fetch* fetch = config.add_fetch();\n fetch->mutable_id()->set_node_name(\"fetch0\");\n fetch->set_name(\"myfetch\");\n tf2xla::Variable* variable = config.add_variable();\n variable->set_node_name(\"myvar_readonly\");\n variable->mutable_shape()->add_dim()->set_size(1);\n variable->set_type(DT_FLOAT);\n variable->set_readonly(true);\n tf2xla::Variable* variable2 = config.add_variable();\n variable2->set_node_name(\"myvar\");\n variable2->mutable_shape()->add_dim()->set_size(1);\n variable2->set_type(DT_FLOAT);\n tf2xla::Variable* variable3 = config.add_variable();\n variable3->set_node_name(\"my\/var\");\n variable3->set_name(\"myvar2\");\n variable3->mutable_shape()->add_dim()->set_size(5);\n variable3->set_type(DT_INT32);\n CompileResult compile_result;\n compile_result.aot.reset(new xla::cpu::CpuAotCompilationResult(\n {},\n {BufferInfo::MakeTempBuffer(1),\n BufferInfo::MakeEntryParameter(\/*size=*\/8, \/*param_number=*\/0),\n BufferInfo::MakeTempBuffer(2),\n BufferInfo::MakeEntryParameter(\/*size=*\/96, \/*param_number=*\/1),\n BufferInfo::MakeTempBuffer(3), BufferInfo::MakeTempBuffer(120)},\n 5, {}));\n compile_result.program_shape =\n xla::ShapeUtil::MakeProgramShape(\n {\n xla::ShapeUtil::MakeShape(xla::F32, {1, 2}),\n xla::ShapeUtil::MakeShape(xla::S64, {3, 4}),\n xla::ShapeUtil::MakeShape(xla::F32, {1}),\n xla::ShapeUtil::MakeShape(xla::F32, {1}),\n xla::ShapeUtil::MakeShape(xla::S32, {5}),\n },\n xla::ShapeUtil::MakeTupleShape({\n xla::ShapeUtil::MakeShape(xla::U32, {5, 6}),\n xla::ShapeUtil::MakeShape(xla::F32, {1}),\n xla::ShapeUtil::MakeShape(xla::S32, {5}),\n }))\n .ToProto();\n compile_result.entry_point = \"entry_point\";\n compile_result.pointer_size = 8;\n\n MetadataResult metadata_result;\n TF_ASSERT_OK(GenerateMetadata(opts, compile_result, &metadata_result));\n\n \/\/ The other fields in metadata_result are tested as part of the generated\n \/\/ header test.\n\n CompareWithGoldenFile(\"compiler\/aot\/codegen_test_o.golden\",\n metadata_result.object_file_data);\n\n string header;\n TF_ASSERT_OK(\n GenerateHeader(opts, config, compile_result, metadata_result, &header));\n\n CompareWithGoldenFile(\"compiler\/aot\/codegen_test_h.golden\", header);\n}\n} \/\/ namespace\n} \/\/ namespace tfcompile\n} \/\/ namespace tensorflow\n<commit_msg>[XLA:CPU:AOT] Make test pass on non-x86<commit_after>\/* Copyright 2017 The TensorFlow Authors. All Rights Reserved.\n\nLicensed under the Apache License, Version 2.0 (the \"License\");\nyou may not use this file except in compliance with the License.\nYou may obtain a copy of the License at\n\n http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n\nUnless required by applicable law or agreed to in writing, software\ndistributed under the License is distributed on an \"AS IS\" BASIS,\nWITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\nSee the License for the specific language governing permissions and\nlimitations under the License.\n==============================================================================*\/\n\n#include \"tensorflow\/compiler\/aot\/codegen.h\"\n\n#include <string>\n#include <vector>\n\n#include \"absl\/strings\/match.h\"\n#include \"absl\/strings\/string_view.h\"\n#include \"llvm\/Support\/TargetSelect.h\"\n#include \"tensorflow\/compiler\/xla\/cpu_function_runtime.h\"\n#include \"tensorflow\/compiler\/xla\/shape_util.h\"\n#include \"tensorflow\/core\/framework\/tensor_shape.pb.h\"\n#include \"tensorflow\/core\/framework\/types.pb.h\"\n#include \"tensorflow\/core\/lib\/core\/status.h\"\n#include \"tensorflow\/core\/lib\/core\/status_test_util.h\"\n#include \"tensorflow\/core\/lib\/io\/path.h\"\n#include \"tensorflow\/core\/platform\/env.h\"\n#include \"tensorflow\/core\/platform\/test.h\"\n\nnamespace tensorflow {\nnamespace tfcompile {\nnamespace {\n\nusing ::xla::cpu_function_runtime::BufferInfo;\n\nvoid ExpectErrorContains(const Status& status, absl::string_view str) {\n EXPECT_NE(Status::OK(), status);\n EXPECT_TRUE(absl::StrContains(status.error_message(), str))\n << \"expected error: \" << status.error_message() << \" to contain: \" << str;\n}\n\nTEST(ValidateCppIdent, Simple) {\n TF_EXPECT_OK(ValidateCppIdent(\"a\", \"\"));\n TF_EXPECT_OK(ValidateCppIdent(\"abc\", \"\"));\n TF_EXPECT_OK(ValidateCppIdent(\"_abc\", \"\"));\n TF_EXPECT_OK(ValidateCppIdent(\"_abc123\", \"\"));\n \/\/ Make sure we didn't skip a valid letter or digit\n string ident;\n for (char c = 'a'; c <= 'z'; c++) {\n ident.append(1, c);\n }\n for (char c = 'A'; c <= 'Z'; c++) {\n ident.append(1, c);\n }\n for (char c = '0'; c <= '9'; c++) {\n ident.append(1, c);\n }\n ident += \"_\";\n TF_EXPECT_OK(ValidateCppIdent(ident, \"\"));\n\n ExpectErrorContains(ValidateCppIdent(\"\", \"\"), \"empty identifier\");\n ExpectErrorContains(ValidateCppIdent(\" \", \"\"), \"illegal leading char\");\n ExpectErrorContains(ValidateCppIdent(\"0\", \"\"), \"illegal leading char\");\n ExpectErrorContains(ValidateCppIdent(\".\", \"\"), \"illegal leading char\");\n ExpectErrorContains(ValidateCppIdent(\":\", \"\"), \"illegal leading char\");\n ExpectErrorContains(ValidateCppIdent(\"a.\", \"\"), \"illegal char\");\n ExpectErrorContains(ValidateCppIdent(\"a:\", \"\"), \"illegal char\");\n ExpectErrorContains(ValidateCppIdent(\"a:\", \"\"), \"illegal char\");\n}\n\nclass ParseCppClassTest : public ::testing::Test {\n protected:\n void ExpectOK(const string& cpp_class, const string& want_class_name,\n const std::vector<string>& want_namespaces) {\n string class_name;\n std::vector<string> namespaces;\n TF_EXPECT_OK(ParseCppClass(cpp_class, &class_name, &namespaces));\n EXPECT_EQ(class_name, want_class_name);\n EXPECT_EQ(namespaces, want_namespaces);\n }\n\n void ExpectFail(const string& cpp_class) {\n string class_name;\n std::vector<string> namespaces;\n EXPECT_NE(ParseCppClass(cpp_class, &class_name, &namespaces), Status::OK())\n << cpp_class;\n }\n};\n\nTEST_F(ParseCppClassTest, ParseOK) {\n ExpectOK(\"MyClass\", \"MyClass\", {});\n ExpectOK(\"_MyClass\", \"_MyClass\", {});\n ExpectOK(\"a::MyClass\", \"MyClass\", {\"a\"});\n ExpectOK(\"a::foo::MyClass\", \"MyClass\", {\"a\", \"foo\"});\n ExpectOK(\"a::foo::b::MyClass\", \"MyClass\", {\"a\", \"foo\", \"b\"});\n ExpectOK(\"a::foo::b::bar::MyClass\", \"MyClass\", {\"a\", \"foo\", \"b\", \"bar\"});\n ExpectOK(\"foo::MyClass\", \"MyClass\", {\"foo\"});\n ExpectOK(\"_foo::MyClass\", \"MyClass\", {\"_foo\"});\n ExpectOK(\"_foo::_MyClass\", \"_MyClass\", {\"_foo\"});\n ExpectOK(\"::foo::bar::MyClass\", \"MyClass\", {\"foo\", \"bar\"});\n ExpectOK(\"::_foo::MyClass\", \"MyClass\", {\"_foo\"});\n ExpectOK(\"::_foo::_MyClass\", \"_MyClass\", {\"_foo\"});\n \/\/ Make sure we didn't skip a valid letter or digit\n string ident;\n for (char c = 'a'; c <= 'z'; c++) {\n ident.append(1, c);\n }\n for (char c = 'A'; c <= 'Z'; c++) {\n ident.append(1, c);\n }\n for (char c = '0'; c <= '9'; c++) {\n ident.append(1, c);\n }\n ident += \"_\";\n ExpectOK(ident, ident, {});\n ExpectOK(ident + \"::\" + ident, ident, {ident});\n ExpectOK(ident + \"::\" + ident + \"::\" + ident, ident, {ident, ident});\n}\n\nTEST_F(ParseCppClassTest, ParseFail) {\n ExpectFail(\"\");\n ExpectFail(\"::\");\n ExpectFail(\"0\");\n ExpectFail(\"a.b\");\n ExpectFail(\"a:b\");\n ExpectFail(\":foo::bar\");\n ExpectFail(\"good::.bad\");\n ExpectFail(\"good:::bad\");\n ExpectFail(\"good::bad::\");\n ExpectFail(\"good::::bad\");\n ExpectFail(\"::::bad\");\n ExpectFail(\"good:: bad\");\n ExpectFail(\"good::0bad\");\n}\n\nstatic void CompareWithGoldenFile(\n const string& tensorflow_relative_golden_file_name,\n const string& expected_contents) {\n \/\/ To update the golden file, flip update_golden to true and run the\n \/\/ following:\n \/\/ bazel test --test_strategy=local \\\n \/\/ third_party\/tensorflow\/compiler\/aot:codegen_test\n const bool update_golden = false;\n const string golden_file_name = io::JoinPath(\n testing::TensorFlowSrcRoot(), tensorflow_relative_golden_file_name);\n\n if (update_golden) {\n TF_EXPECT_OK(\n WriteStringToFile(Env::Default(), golden_file_name, expected_contents));\n }\n\n string golden_file_contents;\n TF_ASSERT_OK(ReadFileToString(Env::Default(), golden_file_name,\n &golden_file_contents));\n EXPECT_EQ(golden_file_contents, expected_contents);\n}\n\nTEST(CodegenTest, Golden) {\n \/\/ Normally CpuCompiler::CpuCompiler does this, but in this test we've\n \/\/ bypassed the Cpu compiler so we have to do this manually.\n LLVMInitializeX86Target();\n LLVMInitializeX86TargetInfo();\n LLVMInitializeX86TargetMC();\n LLVMInitializeX86AsmPrinter();\n\n CodegenOpts opts;\n opts.class_name = \"MyClass\";\n opts.target_triple = \"x86_64-pc-linux\";\n opts.namespaces = {\"foo\", \"bar\"};\n opts.gen_name_to_index = true;\n opts.gen_program_shape = true;\n tf2xla::Config config;\n tf2xla::Feed* feed = config.add_feed();\n feed->mutable_id()->set_node_name(\"feed0\");\n feed->set_name(\"myfeed\");\n feed = config.add_feed();\n feed->mutable_id()->set_node_name(\"feed1\");\n tf2xla::Fetch* fetch = config.add_fetch();\n fetch->mutable_id()->set_node_name(\"fetch0\");\n fetch->set_name(\"myfetch\");\n tf2xla::Variable* variable = config.add_variable();\n variable->set_node_name(\"myvar_readonly\");\n variable->mutable_shape()->add_dim()->set_size(1);\n variable->set_type(DT_FLOAT);\n variable->set_readonly(true);\n tf2xla::Variable* variable2 = config.add_variable();\n variable2->set_node_name(\"myvar\");\n variable2->mutable_shape()->add_dim()->set_size(1);\n variable2->set_type(DT_FLOAT);\n tf2xla::Variable* variable3 = config.add_variable();\n variable3->set_node_name(\"my\/var\");\n variable3->set_name(\"myvar2\");\n variable3->mutable_shape()->add_dim()->set_size(5);\n variable3->set_type(DT_INT32);\n CompileResult compile_result;\n compile_result.aot.reset(new xla::cpu::CpuAotCompilationResult(\n {},\n {BufferInfo::MakeTempBuffer(1),\n BufferInfo::MakeEntryParameter(\/*size=*\/8, \/*param_number=*\/0),\n BufferInfo::MakeTempBuffer(2),\n BufferInfo::MakeEntryParameter(\/*size=*\/96, \/*param_number=*\/1),\n BufferInfo::MakeTempBuffer(3), BufferInfo::MakeTempBuffer(120)},\n 5, {}));\n compile_result.program_shape =\n xla::ShapeUtil::MakeProgramShape(\n {\n xla::ShapeUtil::MakeShape(xla::F32, {1, 2}),\n xla::ShapeUtil::MakeShape(xla::S64, {3, 4}),\n xla::ShapeUtil::MakeShape(xla::F32, {1}),\n xla::ShapeUtil::MakeShape(xla::F32, {1}),\n xla::ShapeUtil::MakeShape(xla::S32, {5}),\n },\n xla::ShapeUtil::MakeTupleShape({\n xla::ShapeUtil::MakeShape(xla::U32, {5, 6}),\n xla::ShapeUtil::MakeShape(xla::F32, {1}),\n xla::ShapeUtil::MakeShape(xla::S32, {5}),\n }))\n .ToProto();\n compile_result.entry_point = \"entry_point\";\n compile_result.pointer_size = 8;\n\n MetadataResult metadata_result;\n TF_ASSERT_OK(GenerateMetadata(opts, compile_result, &metadata_result));\n\n \/\/ The other fields in metadata_result are tested as part of the generated\n \/\/ header test.\n\n CompareWithGoldenFile(\"compiler\/aot\/codegen_test_o.golden\",\n metadata_result.object_file_data);\n\n string header;\n TF_ASSERT_OK(\n GenerateHeader(opts, config, compile_result, metadata_result, &header));\n\n CompareWithGoldenFile(\"compiler\/aot\/codegen_test_h.golden\", header);\n}\n} \/\/ namespace\n} \/\/ namespace tfcompile\n} \/\/ namespace tensorflow\n<|endoftext|>"} {"text":"<commit_before>#include <bits\/stdc++.h>\n\nusing namespace std;\n\n\/\/ https:\/\/en.wikipedia.org\/wiki\/Dinic%27s_algorithm in O(V^2 * E)\n\nconst int maxnodes = 5000;\n\nint nodes = maxnodes, src, dest;\nint dist[maxnodes], q[maxnodes], work[maxnodes];\n\nstruct Edge {\n int to, rev;\n int f, cap;\n};\n\nvector<Edge> g[maxnodes];\n\n\/\/ Adds bidirectional edge\nvoid add_edge(int s, int t, int cap) {\n Edge a = {t, g[t].size(), 0, cap};\n Edge b = {s, g[s].size(), 0, cap};\n g[s].emplace_back(a);\n g[t].emplace_back(b);\n}\n\nbool dinic_bfs() {\n fill(dist, dist + nodes, -1);\n dist[src] = 0;\n int qt = 0;\n q[qt++] = src;\n for (int qh = 0; qh < qt; qh++) {\n int u = q[qh];\n for (auto &e : g[u]) {\n int v = e.to;\n if (dist[v] < 0 && e.f < e.cap) {\n dist[v] = dist[u] + 1;\n q[qt++] = v;\n }\n }\n }\n return dist[dest] >= 0;\n}\n\nint dinic_dfs(int u, int f) {\n if (u == dest)\n return f;\n for (int &i = work[u]; i < g[u].size(); i++) {\n Edge &e = g[u][i];\n if (e.cap <= e.f) continue;\n int v = e.to;\n if (dist[v] == dist[u] + 1) {\n int df = dinic_dfs(v, min(f, e.cap - e.f));\n if (df > 0) {\n e.f += df;\n g[v][e.rev].f -= df;\n return df;\n }\n }\n }\n return 0;\n}\n\nint max_flow(int _src, int _dest) {\n src = _src;\n dest = _dest;\n int result = 0;\n while (dinic_bfs()) {\n fill(work, work + nodes, 0);\n while (int delta = dinic_dfs(src, INT_MAX))\n result += delta;\n }\n return result;\n}\n\nint main() {\n int capacity[][3] = {{0, 3, 2},\n {0, 0, 2},\n {0, 0, 0}};\n int n = 3;\n nodes = n;\n for (int i = 0; i < n; i++)\n for (int j = 0; j < n; j++)\n if (capacity[i][j] != 0)\n add_edge(i, j, capacity[i][j]);\n\n cout << (4 == max_flow(0, 2)) << endl;\n}\n<commit_msg>update<commit_after>#include <bits\/stdc++.h>\n\nusing namespace std;\n\n\/\/ https:\/\/en.wikipedia.org\/wiki\/Dinic%27s_algorithm in O(V^2 * E)\n\nconst int maxnodes = 5000;\n\nint nodes = maxnodes, src, dest;\nint dist[maxnodes], q[maxnodes], work[maxnodes];\n\nstruct Edge {\n int to, rev;\n int f, cap;\n};\n\nvector<Edge> g[maxnodes];\n\n\/\/ Adds bidirectional edge\nvoid add_edge(int s, int t, int cap) {\n Edge a = {t, (int) g[t].size(), 0, cap};\n Edge b = {s, (int) g[s].size(), 0, cap};\n g[s].emplace_back(a);\n g[t].emplace_back(b);\n}\n\nbool dinic_bfs() {\n fill(dist, dist + nodes, -1);\n dist[src] = 0;\n int qt = 0;\n q[qt++] = src;\n for (int qh = 0; qh < qt; qh++) {\n int u = q[qh];\n for (auto &e : g[u]) {\n int v = e.to;\n if (dist[v] < 0 && e.f < e.cap) {\n dist[v] = dist[u] + 1;\n q[qt++] = v;\n }\n }\n }\n return dist[dest] >= 0;\n}\n\nint dinic_dfs(int u, int f) {\n if (u == dest)\n return f;\n for (int &i = work[u]; i < g[u].size(); i++) {\n Edge &e = g[u][i];\n if (e.cap <= e.f) continue;\n int v = e.to;\n if (dist[v] == dist[u] + 1) {\n int df = dinic_dfs(v, min(f, e.cap - e.f));\n if (df > 0) {\n e.f += df;\n g[v][e.rev].f -= df;\n return df;\n }\n }\n }\n return 0;\n}\n\nint max_flow(int _src, int _dest) {\n src = _src;\n dest = _dest;\n int result = 0;\n while (dinic_bfs()) {\n fill(work, work + nodes, 0);\n while (int delta = dinic_dfs(src, INT_MAX))\n result += delta;\n }\n return result;\n}\n\nint main() {\n int capacity[][3] = {{0, 3, 2},\n {0, 0, 2},\n {0, 0, 0}};\n int n = 3;\n nodes = n;\n for (int i = 0; i < n; i++)\n for (int j = 0; j < n; j++)\n if (capacity[i][j] != 0)\n add_edge(i, j, capacity[i][j]);\n\n cout << (4 == max_flow(0, 2)) << endl;\n}\n<|endoftext|>"} {"text":"<commit_before>#include <toppra\/algorithm\/toppra.hpp>\n\n#include <memory>\n#include <toppra\/algorithm.hpp>\n#include <toppra\/toppra.hpp>\n\nnamespace toppra {\nnamespace algorithm {\n\nTOPPRA::TOPPRA(LinearConstraintPtrs constraints, const GeometricPathPtr &path)\n : PathParametrizationAlgorithm{std::move(constraints), path} {\n m_solver = Solver::createDefault();\n}\n\nReturnCode TOPPRA::computeForwardPass(value_type vel_start) {\n TOPPRA_LOG_DEBUG(\"computeForwardPass\");\n ReturnCode ret = ReturnCode::OK;\n bool solver_ret;\n Vector g_upper{2}, solution;\n Matrix H;\n auto deltas = m_solver->deltas();\n Bound x, x_next;\n m_data.parametrization(0) = vel_start;\n for (std::size_t i = 0; i < m_N; i++) {\n g_upper << -2 * deltas(i), -1;\n x.setConstant(m_data.parametrization(i));\n x_next = m_data.controllable_sets.row(i + 1);\n solver_ret = m_solver->solveStagewiseOptim(i, H, g_upper, x, x_next, solution);\n if (!solver_ret) {\n ret = ReturnCode::ERR_FAIL_FORWARD_PASS;\n TOPPRA_LOG_DEBUG(\"Fail: forward pass, idx: \" << i);\n break;\n }\n \/\/\/ \\todo This can be optimized further by solving a 1D problem instead of 2D\n m_data.parametrization(i + 1) =\n m_data.parametrization(i) + 2 * deltas(i) * solution(0);\n }\n\n return ret;\n};\n\n} \/\/ namespace algorithm\n} \/\/ namespace toppra\n<commit_msg>[cpp] Fix numerical issue (tiny negative sd^2)<commit_after>#include <toppra\/algorithm\/toppra.hpp>\n\n#include <memory>\n#include <toppra\/algorithm.hpp>\n#include <toppra\/toppra.hpp>\n\nnamespace toppra {\nnamespace algorithm {\n\nTOPPRA::TOPPRA(LinearConstraintPtrs constraints, const GeometricPathPtr &path)\n : PathParametrizationAlgorithm{std::move(constraints), path} {\n m_solver = Solver::createDefault();\n}\n\nReturnCode TOPPRA::computeForwardPass(value_type vel_start) {\n TOPPRA_LOG_DEBUG(\"computeForwardPass\");\n ReturnCode ret = ReturnCode::OK;\n bool solver_ret;\n Vector g_upper{2}, solution;\n Matrix H;\n auto deltas = m_solver->deltas();\n Bound x, x_next;\n m_data.parametrization(0) = vel_start;\n for (std::size_t i = 0; i < m_N; i++) {\n g_upper << -2 * deltas(i), -1;\n x.setConstant(m_data.parametrization(i));\n x_next = m_data.controllable_sets.row(i + 1);\n solver_ret = m_solver->solveStagewiseOptim(i, H, g_upper, x, x_next, solution);\n if (!solver_ret) {\n ret = ReturnCode::ERR_FAIL_FORWARD_PASS;\n TOPPRA_LOG_DEBUG(\"Fail: forward pass, idx: \" << i);\n break;\n }\n \/\/\/ \\todo This can be optimized further by solving a 1D problem instead of 2D\n m_data.parametrization(i + 1) =\n std::max(0., m_data.parametrization(i) + 2 * deltas(i) * solution(0));\n }\n\n return ret;\n};\n\n} \/\/ namespace algorithm\n} \/\/ namespace toppra\n<|endoftext|>"} {"text":"<commit_before>\/* <x0\/plugins\/proxy.cpp>\n *\n * This file is part of the x0 web server project and is released under LGPL-3.\n * http:\/\/www.xzero.io\/\n *\n * (c) 2009-2010 Christian Parpart <trapni@gentoo.org>\n *\/\n\n#include <x0\/http\/HttpPlugin.h>\n#include <x0\/http\/HttpServer.h>\n#include <x0\/http\/HttpRequest.h>\n#include <x0\/io\/BufferSource.h>\n#include <x0\/io\/BufferRefSource.h>\n#include <x0\/SocketSpec.h>\n#include <x0\/strutils.h>\n#include <x0\/Url.h>\n#include <x0\/Types.h>\n\n#include <sys\/types.h>\n#include <sys\/socket.h>\n#include <sys\/un.h>\n#include <unistd.h>\n#include <fcntl.h>\n#include <netdb.h>\n\n\/* {{{ -- configuration proposal:\n *\n * handler setup {\n * }\n *\n * handler main {\n * proxy.reverse 'http:\/\/127.0.0.1:3000';\n * }\n *\n * --------------------------------------------------------------------------\n * possible tweaks:\n * - bufsize (0 = unbuffered)\n * - timeout.connect\n * - timeout.write\n * - timeout.read\n * - ignore_clientabort\n * };\n *\n *\n *\/ \/\/ }}}\n\n#if 0\n#\tdefine TRACE(msg...) DEBUG(\"proxy: \" msg)\n#else\n#\tdefine TRACE(msg...) \/*!*\/\n#endif\n\n\/\/ {{{ ProxyConnection API\nclass ProxyConnection :\n\tpublic x0::HttpMessageProcessor\n{\nprivate:\n\tint refCount_;\n\n\tx0::HttpRequest *request_;\t\t\/\/!< client's request\n\tx0::Socket* backend_;\t\t\t\/\/!< connection to backend app\n\tbool cloak_;\t\t\t\t\t\/\/!< to cloak or not to cloak the \"Server\" response header\n\n\tint connectTimeout_;\n\tint readTimeout_;\n\tint writeTimeout_;\n\n\tx0::Buffer writeBuffer_;\n\tsize_t writeOffset_;\n\tsize_t writeProgress_;\n\n\tx0::Buffer readBuffer_;\n\tbool processingDone_;\n\nprivate:\n\tvoid ref();\n\tvoid unref();\n\tinline void close();\n\tinline void readSome();\n\tinline void writeSome();\n\n\tvoid onConnected(x0::Socket* s, int revents);\n\tvoid io(x0::Socket* s, int revents);\n\tvoid onRequestChunk(const x0::BufferRef& chunk);\n\n\tstatic void onAbort(void *p);\n\tvoid onWriteComplete();\n\n\t\/\/ response (HttpMessageProcessor)\n\tvirtual bool onMessageBegin(int versionMajor, int versionMinor, int code, const x0::BufferRef& text);\n\tvirtual bool onMessageHeader(const x0::BufferRef& name, const x0::BufferRef& value);\n\tvirtual bool onMessageContent(const x0::BufferRef& chunk);\n\tvirtual bool onMessageEnd();\n\npublic:\n\tinline ProxyConnection();\n\t~ProxyConnection();\n\n\tvoid start(x0::HttpRequest* in, x0::Socket* backend, bool cloak);\n};\n\/\/ }}}\n\n\/\/ {{{ ProxyConnection impl\nProxyConnection::ProxyConnection() :\n\tx0::HttpMessageProcessor(x0::HttpMessageProcessor::RESPONSE),\n\trefCount_(1),\n\trequest_(nullptr),\n\tbackend_(nullptr),\n\tcloak_(false),\n\n\tconnectTimeout_(0),\n\treadTimeout_(0),\n\twriteTimeout_(0),\n\twriteBuffer_(),\n\twriteOffset_(0),\n\twriteProgress_(0),\n\treadBuffer_(),\n\tprocessingDone_(false)\n{\n\tTRACE(\"ProxyConnection()\");\n}\n\nProxyConnection::~ProxyConnection()\n{\n\tTRACE(\"~ProxyConnection()\");\n\n\tif (backend_) {\n\t\tbackend_->close();\n\n\t\tdelete backend_;\n\t}\n\n\tif (request_) {\n\t\tif (request_->status == x0::HttpError::Undefined)\n\t\t\trequest_->status = x0::HttpError::ServiceUnavailable;\n\n\t\trequest_->finish();\n\t}\n}\n\nvoid ProxyConnection::ref()\n{\n\t++refCount_;\n}\n\nvoid ProxyConnection::unref()\n{\n\tassert(refCount_ > 0);\n\n\t--refCount_;\n\n\tif (refCount_ == 0) {\n\t\tdelete this;\n\t}\n}\n\nvoid ProxyConnection::close()\n{\n\tif (backend_)\n\t\t\/\/ stop watching on any backend I\/O events, if active\n\t\tbackend_->close();\n\n\tunref(); \/\/ the one from the constructor\n}\n\nvoid ProxyConnection::onAbort(void *p)\n{\n\tProxyConnection *self = reinterpret_cast<ProxyConnection *>(p);\n\tself->close();\n}\n\nvoid ProxyConnection::start(x0::HttpRequest* in, x0::Socket* backend, bool cloak)\n{\n\tTRACE(\"ProxyConnection.start(in, backend, cloak=%d)\", cloak);\n\n\trequest_ = in;\n\trequest_->setAbortHandler(&ProxyConnection::onAbort, this);\n\tbackend_ = backend;\n\tcloak_ = cloak;\n\n\t\/\/ request line\n\twriteBuffer_.push_back(request_->method);\n\twriteBuffer_.push_back(' ');\n\twriteBuffer_.push_back(request_->uri);\n\twriteBuffer_.push_back(\" HTTP\/1.1\\r\\n\");\n\n\t\/\/ request headers\n\tfor (auto& header: request_->requestHeaders) {\n\t\tif (iequals(header.name, \"Content-Transfer\")\n\t\t\t\t|| iequals(header.name, \"Expect\")\n\t\t\t\t|| iequals(header.name, \"Connection\")\n\t\t\t\/\/\t|| iequals(header.name, \"X-Forwarded-For\")\n\t\t\t\/\/\t|| iequals(header.name, \"X-Forwarded-Proto\")\n\t\t\t) {\n\t\t\tTRACE(\"skip requestHeader(%s: %s)\", header.name.str().c_str(), header.value.str().c_str());\n\t\t\tcontinue;\n\t\t}\n\n\t\tTRACE(\"pass requestHeader(%s: %s)\", header.name.str().c_str(), header.value.str().c_str());\n\t\twriteBuffer_.push_back(header.name);\n\t\twriteBuffer_.push_back(\": \");\n\t\twriteBuffer_.push_back(header.value);\n\t\twriteBuffer_.push_back(\"\\r\\n\");\n\t}\n\n\t\/\/ additional headers to add\n\twriteBuffer_.push_back(\"Connection: closed\\r\\n\");\n\n\twriteBuffer_.push_back(\"X-Forwarded-For: \");\n\twriteBuffer_.push_back(request_->connection.remoteIP());\n\twriteBuffer_.push_back(\"\\r\\n\");\n\n#if defined(WITH_SSL)\n\tif (!request_->requestHeader(\"X-Forwarded-Proto\").empty()) {\n\t\tif (request_->connection.isSecure())\n\t\t\twriteBuffer_.push_back(\"X-Forwarded-Proto: https\\r\\n\");\n\t\telse\n\t\t\twriteBuffer_.push_back(\"X-Forwarded-Proto: http\\r\\n\");\n\t}\n#endif\n\n\t\/\/ request headers terminator\n\twriteBuffer_.push_back(\"\\r\\n\");\n\n\tif (request_->contentAvailable()) {\n\t\tTRACE(\"start: request content available: reading.\");\n\t\trequest_->setBodyCallback<ProxyConnection, &ProxyConnection::onRequestChunk>(this);\n\t}\n\n\tif (backend_->state() == x0::Socket::Connecting) {\n\t\tTRACE(\"start: connect in progress\");\n\t\tbackend_->setReadyCallback<ProxyConnection, &ProxyConnection::onConnected>(this);\n\t} else { \/\/ connected\n\t\tTRACE(\"start: flushing\");\n\t\tbackend_->setReadyCallback<ProxyConnection, &ProxyConnection::io>(this);\n\t\tbackend_->setMode(x0::Socket::ReadWrite);\n\t}\n}\n\nvoid ProxyConnection::onConnected(x0::Socket* s, int revents)\n{\n\tTRACE(\"onConnected: content? %d\", request_->contentAvailable());\n\t\/\/TRACE(\"onConnected.pending:\\n%s\\n\", writeBuffer_.c_str());\n\n\tif (backend_->state() == x0::Socket::Operational) {\n\t\tTRACE(\"onConnected: flushing\");\n\t\tbackend_->setReadyCallback<ProxyConnection, &ProxyConnection::io>(this);\n\t\tbackend_->setMode(x0::Socket::ReadWrite); \/\/ flush already serialized request\n\t} else {\n\t\tclose();\n\t}\n}\n\n\/** transferres a request body chunk to the origin server. *\/\nvoid ProxyConnection::onRequestChunk(const x0::BufferRef& chunk)\n{\n\tTRACE(\"onRequestChunk(nb:%ld)\", chunk.size());\n\twriteBuffer_.push_back(chunk);\n\n\tif (backend_->state() == x0::Socket::Operational) {\n\t\tbackend_->setMode(x0::Socket::ReadWrite);\n\t}\n}\n\ninline bool validateResponseHeader(const x0::BufferRef& name)\n{\n\t\/\/ XXX do not allow origin's connection-level response headers to be passed to the client.\n\tif (iequals(name, \"Connection\"))\n\t\treturn false;\n\n\tif (iequals(name, \"Transfer-Encoding\"))\n\t\treturn false;\n\n\treturn true;\n}\n\n\/** callback, invoked when the origin server has passed us the response status line.\n *\n * We will use the status code only.\n * However, we could pass the text field, too - once x0 core supports it.\n *\/\nbool ProxyConnection::onMessageBegin(int major, int minor, int code, const x0::BufferRef& text)\n{\n\tTRACE(\"ProxyConnection(%p).status(HTTP\/%d.%d, %d, '%s')\", (void*)this, major, minor, code, text.str().c_str());\n\n\trequest_->status = static_cast<x0::HttpError>(code);\n\tTRACE(\"status: %d\", (int)request_->status);\n\treturn true;\n}\n\n\/** callback, invoked on every successfully parsed response header.\n *\n * We will pass this header directly to the client's response,\n * if that is NOT a connection-level header.\n *\/\nbool ProxyConnection::onMessageHeader(const x0::BufferRef& name, const x0::BufferRef& value)\n{\n\tTRACE(\"ProxyConnection(%p).onHeader('%s', '%s')\", (void*)this, name.str().c_str(), value.str().c_str());\n\n\tif (!validateResponseHeader(name)) {\n\t\tTRACE(\"skipping connection-level header\");\n\t\tgoto done;\n\t}\n\n\tif (cloak_ && iequals(name, \"Server\")) {\n\t\tTRACE(\"skipping \\\"Server\\\"-header\");\n\t\tgoto done;\n\t}\n\n\trequest_->responseHeaders.push_back(name.str(), value.str());\n\ndone:\n\treturn true;\n}\n\n\/** callback, invoked on a new response content chunk. *\/\nbool ProxyConnection::onMessageContent(const x0::BufferRef& chunk)\n{\n\tTRACE(\"messageContent(nb:%lu) state:%s\", chunk.size(), backend_->state_str());\n\n\t\/\/ stop watching for more input\n\tbackend_->setMode(x0::Socket::None);\n\n\t\/\/ transfer response-body chunk to client\n\trequest_->write<x0::BufferRefSource>(chunk);\n\n\t\/\/ start listening on backend I\/O when chunk has been fully transmitted\n\tref();\n\trequest_->writeCallback<ProxyConnection, &ProxyConnection::onWriteComplete>(this);\n\n\treturn true;\n}\n\nvoid ProxyConnection::onWriteComplete()\n{\n\tTRACE(\"chunk write complete: %s\", state_str());\n\tbackend_->setMode(x0::Socket::Read);\n\tunref();\n}\n\nbool ProxyConnection::onMessageEnd()\n{\n\tTRACE(\"messageEnd() backend-state:%s\", backend_->state_str());\n\tprocessingDone_ = true;\n\treturn false;\n}\n\nvoid ProxyConnection::io(x0::Socket* s, int revents)\n{\n\tTRACE(\"io(0x%04x)\", revents);\n\n\tif (revents & x0::Socket::Read)\n\t\treadSome();\n\n\tif (revents & x0::Socket::Write)\n\t\twriteSome();\n}\n\nvoid ProxyConnection::writeSome()\n{\n\tTRACE(\"writeSome() - %s (%d)\", state_str(), request_->contentAvailable());\n\n\tssize_t rv = backend_->write(writeBuffer_.data() + writeOffset_, writeBuffer_.size() - writeOffset_);\n\n\tif (rv > 0) {\n\t\tTRACE(\"write request: %ld (of %ld) bytes\", rv, writeBuffer_.size() - writeOffset_);\n\n\t\twriteOffset_ += rv;\n\t\twriteProgress_ += rv;\n\n\t\tif (writeOffset_ == writeBuffer_.size()) {\n\t\t\tTRACE(\"writeOffset == writeBuffser.size (%ld) p:%ld, ca: %d, clr:%ld\", writeOffset_,\n\t\t\t\twriteProgress_, request_->contentAvailable(), request_->connection.contentLength());\n\n\t\t\twriteOffset_ = 0;\n\t\t\twriteBuffer_.clear();\n\t\t\tbackend_->setMode(x0::Socket::Read);\n\t\t}\n\t} else {\n\t\tTRACE(\"write request failed(%ld): %s\", rv, strerror(errno));\n\t\tclose();\n\t}\n}\n\nvoid ProxyConnection::readSome()\n{\n\tTRACE(\"readSome() - %s\", state_str());\n\n\tstd::size_t lower_bound = readBuffer_.size();\n\n\tif (lower_bound == readBuffer_.capacity())\n\t\treadBuffer_.setCapacity(lower_bound + 4096);\n\n\tssize_t rv = backend_->read(readBuffer_);\n\n\tif (rv > 0) {\n\t\tTRACE(\"read response: %ld bytes\", rv);\n\t\tstd::size_t np = process(readBuffer_.ref(lower_bound, rv));\n\t\t(void) np;\n\t\tTRACE(\"readSome(): process(): %ld \/ %ld\", np, rv);\n\n\t\tif (processingDone_ || state() == SYNTAX_ERROR) {\n\t\t\tclose();\n\t\t} else {\n\t\t\tTRACE(\"resume with io:%d, state:%s\", backend_->mode(), backend_->state_str());\n\t\t\tbackend_->setMode(x0::Socket::Read);\n\t\t}\n\t} else if (rv == 0) {\n\t\tTRACE(\"http server connection closed\");\n\t\tclose();\n\t} else {\n\t\tTRACE(\"read response failed(%ld): %s\", rv, strerror(errno));\n\n\t\tswitch (errno) {\n#if defined(EWOULDBLOCK) && (EWOULDBLOCK != EAGAIN)\n\t\tcase EWOULDBLOCK:\n#endif\n\t\tcase EAGAIN:\n\t\tcase EINTR:\n\t\t\tbackend_->setMode(x0::Socket::Read);\n\t\t\tbreak;\n\t\tdefault:\n\t\t\tclose();\n\t\t\tbreak;\n\t\t}\n\t}\n}\n\n\/\/ }}}\n\n\/\/ {{{ plugin class\n\/**\n * \\ingroup plugins\n * \\brief proxy content generator plugin\n *\/\nclass proxy_plugin :\n\tpublic x0::HttpPlugin\n{\nprivate:\n\tbool cloak_;\n\npublic:\n\tproxy_plugin(x0::HttpServer& srv, const std::string& name) :\n\t\tx0::HttpPlugin(srv, name),\n\t\tcloak_(true)\n\t{\n\t\tregisterHandler<proxy_plugin, &proxy_plugin::proxy_reverse>(\"proxy.reverse\");\n\t\tregisterSetupProperty<proxy_plugin, &proxy_plugin::proxy_cloak>(\"proxy.cloak\", x0::FlowValue::BOOLEAN);\n\t}\n\n\t~proxy_plugin()\n\t{\n\t}\n\nprivate:\n\tvoid proxy_cloak(const x0::FlowParams& args, x0::FlowValue& result)\n\t{\n\t\tif (args.size() && (args[0].isBool() || args[0].isNumber())) {\n\t\t\tcloak_ = args[0].toBool();\n\t\t\tTRACE(\"proxy cloak: %s\", cloak_ ? \"true\" : \"false\");\n\t\t}\n\n\t\tresult.set(cloak_);\n\t}\n\n\tbool proxy_reverse(x0::HttpRequest *in, const x0::FlowParams& args)\n\t{\n\t\t\/\/ TODO: reuse already spawned proxy connections instead of recreating each time.\n\t\tx0::SocketSpec spec;\n\t\tspec << args;\n\t\tif (!spec.isValid() || spec.backlog >= 0) {\n\t\t\tin->log(x0::Severity::error, \"Invalid socket spec passed.\");\n\t\t\treturn false;\n\t\t}\n\n\t\tx0::Socket* backend = new x0::Socket(in->connection.worker().loop());\n\t\tbackend->open(spec, O_NONBLOCK | O_CLOEXEC);\n\n\t\tif (backend->isOpen()) {\n\t\t\tTRACE(\"in.content? %d\", in->contentAvailable());\n\t\t\tif (ProxyConnection* pc = new ProxyConnection()) {\n\t\t\t\tpc->start(in, backend, cloak_);\n\t\t\t\treturn true;\n\t\t\t}\n\t\t}\n\n\t\tin->status = x0::HttpError::ServiceUnavailable;\n\t\tin->finish();\n\n\t\treturn true;\n\t}\n};\n\/\/ }}}\n\nX0_EXPORT_PLUGIN(proxy)\n<commit_msg>[plugins] ssl: fixes negated condition wrt X-Forwarded-Proto<commit_after>\/* <x0\/plugins\/proxy.cpp>\n *\n * This file is part of the x0 web server project and is released under LGPL-3.\n * http:\/\/www.xzero.io\/\n *\n * (c) 2009-2010 Christian Parpart <trapni@gentoo.org>\n *\/\n\n#include <x0\/http\/HttpPlugin.h>\n#include <x0\/http\/HttpServer.h>\n#include <x0\/http\/HttpRequest.h>\n#include <x0\/io\/BufferSource.h>\n#include <x0\/io\/BufferRefSource.h>\n#include <x0\/SocketSpec.h>\n#include <x0\/strutils.h>\n#include <x0\/Url.h>\n#include <x0\/Types.h>\n\n#include <sys\/types.h>\n#include <sys\/socket.h>\n#include <sys\/un.h>\n#include <unistd.h>\n#include <fcntl.h>\n#include <netdb.h>\n\n\/* {{{ -- configuration proposal:\n *\n * handler setup {\n * }\n *\n * handler main {\n * proxy.reverse 'http:\/\/127.0.0.1:3000';\n * }\n *\n * --------------------------------------------------------------------------\n * possible tweaks:\n * - bufsize (0 = unbuffered)\n * - timeout.connect\n * - timeout.write\n * - timeout.read\n * - ignore_clientabort\n * };\n *\n *\n *\/ \/\/ }}}\n\n#if 0\n#\tdefine TRACE(msg...) DEBUG(\"proxy: \" msg)\n#else\n#\tdefine TRACE(msg...) \/*!*\/\n#endif\n\n\/\/ {{{ ProxyConnection API\nclass ProxyConnection :\n\tpublic x0::HttpMessageProcessor\n{\nprivate:\n\tint refCount_;\n\n\tx0::HttpRequest *request_;\t\t\/\/!< client's request\n\tx0::Socket* backend_;\t\t\t\/\/!< connection to backend app\n\tbool cloak_;\t\t\t\t\t\/\/!< to cloak or not to cloak the \"Server\" response header\n\n\tint connectTimeout_;\n\tint readTimeout_;\n\tint writeTimeout_;\n\n\tx0::Buffer writeBuffer_;\n\tsize_t writeOffset_;\n\tsize_t writeProgress_;\n\n\tx0::Buffer readBuffer_;\n\tbool processingDone_;\n\nprivate:\n\tvoid ref();\n\tvoid unref();\n\tinline void close();\n\tinline void readSome();\n\tinline void writeSome();\n\n\tvoid onConnected(x0::Socket* s, int revents);\n\tvoid io(x0::Socket* s, int revents);\n\tvoid onRequestChunk(const x0::BufferRef& chunk);\n\n\tstatic void onAbort(void *p);\n\tvoid onWriteComplete();\n\n\t\/\/ response (HttpMessageProcessor)\n\tvirtual bool onMessageBegin(int versionMajor, int versionMinor, int code, const x0::BufferRef& text);\n\tvirtual bool onMessageHeader(const x0::BufferRef& name, const x0::BufferRef& value);\n\tvirtual bool onMessageContent(const x0::BufferRef& chunk);\n\tvirtual bool onMessageEnd();\n\npublic:\n\tinline ProxyConnection();\n\t~ProxyConnection();\n\n\tvoid start(x0::HttpRequest* in, x0::Socket* backend, bool cloak);\n};\n\/\/ }}}\n\n\/\/ {{{ ProxyConnection impl\nProxyConnection::ProxyConnection() :\n\tx0::HttpMessageProcessor(x0::HttpMessageProcessor::RESPONSE),\n\trefCount_(1),\n\trequest_(nullptr),\n\tbackend_(nullptr),\n\tcloak_(false),\n\n\tconnectTimeout_(0),\n\treadTimeout_(0),\n\twriteTimeout_(0),\n\twriteBuffer_(),\n\twriteOffset_(0),\n\twriteProgress_(0),\n\treadBuffer_(),\n\tprocessingDone_(false)\n{\n\tTRACE(\"ProxyConnection()\");\n}\n\nProxyConnection::~ProxyConnection()\n{\n\tTRACE(\"~ProxyConnection()\");\n\n\tif (backend_) {\n\t\tbackend_->close();\n\n\t\tdelete backend_;\n\t}\n\n\tif (request_) {\n\t\tif (request_->status == x0::HttpError::Undefined)\n\t\t\trequest_->status = x0::HttpError::ServiceUnavailable;\n\n\t\trequest_->finish();\n\t}\n}\n\nvoid ProxyConnection::ref()\n{\n\t++refCount_;\n}\n\nvoid ProxyConnection::unref()\n{\n\tassert(refCount_ > 0);\n\n\t--refCount_;\n\n\tif (refCount_ == 0) {\n\t\tdelete this;\n\t}\n}\n\nvoid ProxyConnection::close()\n{\n\tif (backend_)\n\t\t\/\/ stop watching on any backend I\/O events, if active\n\t\tbackend_->close();\n\n\tunref(); \/\/ the one from the constructor\n}\n\nvoid ProxyConnection::onAbort(void *p)\n{\n\tProxyConnection *self = reinterpret_cast<ProxyConnection *>(p);\n\tself->close();\n}\n\nvoid ProxyConnection::start(x0::HttpRequest* in, x0::Socket* backend, bool cloak)\n{\n\tTRACE(\"ProxyConnection.start(in, backend, cloak=%d)\", cloak);\n\n\trequest_ = in;\n\trequest_->setAbortHandler(&ProxyConnection::onAbort, this);\n\tbackend_ = backend;\n\tcloak_ = cloak;\n\n\t\/\/ request line\n\twriteBuffer_.push_back(request_->method);\n\twriteBuffer_.push_back(' ');\n\twriteBuffer_.push_back(request_->uri);\n\twriteBuffer_.push_back(\" HTTP\/1.1\\r\\n\");\n\n\t\/\/ request headers\n\tfor (auto& header: request_->requestHeaders) {\n\t\tif (iequals(header.name, \"Content-Transfer\")\n\t\t\t\t|| iequals(header.name, \"Expect\")\n\t\t\t\t|| iequals(header.name, \"Connection\")\n\t\t\t\/\/\t|| iequals(header.name, \"X-Forwarded-For\")\n\t\t\t\/\/\t|| iequals(header.name, \"X-Forwarded-Proto\")\n\t\t\t) {\n\t\t\tTRACE(\"skip requestHeader(%s: %s)\", header.name.str().c_str(), header.value.str().c_str());\n\t\t\tcontinue;\n\t\t}\n\n\t\tTRACE(\"pass requestHeader(%s: %s)\", header.name.str().c_str(), header.value.str().c_str());\n\t\twriteBuffer_.push_back(header.name);\n\t\twriteBuffer_.push_back(\": \");\n\t\twriteBuffer_.push_back(header.value);\n\t\twriteBuffer_.push_back(\"\\r\\n\");\n\t}\n\n\t\/\/ additional headers to add\n\twriteBuffer_.push_back(\"Connection: closed\\r\\n\");\n\n\twriteBuffer_.push_back(\"X-Forwarded-For: \");\n\twriteBuffer_.push_back(request_->connection.remoteIP());\n\twriteBuffer_.push_back(\"\\r\\n\");\n\n#if defined(WITH_SSL)\n\tif (request_->requestHeader(\"X-Forwarded-Proto\").empty()) {\n\t\tif (request_->connection.isSecure())\n\t\t\twriteBuffer_.push_back(\"X-Forwarded-Proto: https\\r\\n\");\n\t\telse\n\t\t\twriteBuffer_.push_back(\"X-Forwarded-Proto: http\\r\\n\");\n\t}\n#endif\n\n\t\/\/ request headers terminator\n\twriteBuffer_.push_back(\"\\r\\n\");\n\n\tif (request_->contentAvailable()) {\n\t\tTRACE(\"start: request content available: reading.\");\n\t\trequest_->setBodyCallback<ProxyConnection, &ProxyConnection::onRequestChunk>(this);\n\t}\n\n\tif (backend_->state() == x0::Socket::Connecting) {\n\t\tTRACE(\"start: connect in progress\");\n\t\tbackend_->setReadyCallback<ProxyConnection, &ProxyConnection::onConnected>(this);\n\t} else { \/\/ connected\n\t\tTRACE(\"start: flushing\");\n\t\tbackend_->setReadyCallback<ProxyConnection, &ProxyConnection::io>(this);\n\t\tbackend_->setMode(x0::Socket::ReadWrite);\n\t}\n}\n\nvoid ProxyConnection::onConnected(x0::Socket* s, int revents)\n{\n\tTRACE(\"onConnected: content? %d\", request_->contentAvailable());\n\t\/\/TRACE(\"onConnected.pending:\\n%s\\n\", writeBuffer_.c_str());\n\n\tif (backend_->state() == x0::Socket::Operational) {\n\t\tTRACE(\"onConnected: flushing\");\n\t\tbackend_->setReadyCallback<ProxyConnection, &ProxyConnection::io>(this);\n\t\tbackend_->setMode(x0::Socket::ReadWrite); \/\/ flush already serialized request\n\t} else {\n\t\tclose();\n\t}\n}\n\n\/** transferres a request body chunk to the origin server. *\/\nvoid ProxyConnection::onRequestChunk(const x0::BufferRef& chunk)\n{\n\tTRACE(\"onRequestChunk(nb:%ld)\", chunk.size());\n\twriteBuffer_.push_back(chunk);\n\n\tif (backend_->state() == x0::Socket::Operational) {\n\t\tbackend_->setMode(x0::Socket::ReadWrite);\n\t}\n}\n\ninline bool validateResponseHeader(const x0::BufferRef& name)\n{\n\t\/\/ XXX do not allow origin's connection-level response headers to be passed to the client.\n\tif (iequals(name, \"Connection\"))\n\t\treturn false;\n\n\tif (iequals(name, \"Transfer-Encoding\"))\n\t\treturn false;\n\n\treturn true;\n}\n\n\/** callback, invoked when the origin server has passed us the response status line.\n *\n * We will use the status code only.\n * However, we could pass the text field, too - once x0 core supports it.\n *\/\nbool ProxyConnection::onMessageBegin(int major, int minor, int code, const x0::BufferRef& text)\n{\n\tTRACE(\"ProxyConnection(%p).status(HTTP\/%d.%d, %d, '%s')\", (void*)this, major, minor, code, text.str().c_str());\n\n\trequest_->status = static_cast<x0::HttpError>(code);\n\tTRACE(\"status: %d\", (int)request_->status);\n\treturn true;\n}\n\n\/** callback, invoked on every successfully parsed response header.\n *\n * We will pass this header directly to the client's response,\n * if that is NOT a connection-level header.\n *\/\nbool ProxyConnection::onMessageHeader(const x0::BufferRef& name, const x0::BufferRef& value)\n{\n\tTRACE(\"ProxyConnection(%p).onHeader('%s', '%s')\", (void*)this, name.str().c_str(), value.str().c_str());\n\n\tif (!validateResponseHeader(name)) {\n\t\tTRACE(\"skipping connection-level header\");\n\t\tgoto done;\n\t}\n\n\tif (cloak_ && iequals(name, \"Server\")) {\n\t\tTRACE(\"skipping \\\"Server\\\"-header\");\n\t\tgoto done;\n\t}\n\n\trequest_->responseHeaders.push_back(name.str(), value.str());\n\ndone:\n\treturn true;\n}\n\n\/** callback, invoked on a new response content chunk. *\/\nbool ProxyConnection::onMessageContent(const x0::BufferRef& chunk)\n{\n\tTRACE(\"messageContent(nb:%lu) state:%s\", chunk.size(), backend_->state_str());\n\n\t\/\/ stop watching for more input\n\tbackend_->setMode(x0::Socket::None);\n\n\t\/\/ transfer response-body chunk to client\n\trequest_->write<x0::BufferRefSource>(chunk);\n\n\t\/\/ start listening on backend I\/O when chunk has been fully transmitted\n\tref();\n\trequest_->writeCallback<ProxyConnection, &ProxyConnection::onWriteComplete>(this);\n\n\treturn true;\n}\n\nvoid ProxyConnection::onWriteComplete()\n{\n\tTRACE(\"chunk write complete: %s\", state_str());\n\tbackend_->setMode(x0::Socket::Read);\n\tunref();\n}\n\nbool ProxyConnection::onMessageEnd()\n{\n\tTRACE(\"messageEnd() backend-state:%s\", backend_->state_str());\n\tprocessingDone_ = true;\n\treturn false;\n}\n\nvoid ProxyConnection::io(x0::Socket* s, int revents)\n{\n\tTRACE(\"io(0x%04x)\", revents);\n\n\tif (revents & x0::Socket::Read)\n\t\treadSome();\n\n\tif (revents & x0::Socket::Write)\n\t\twriteSome();\n}\n\nvoid ProxyConnection::writeSome()\n{\n\tTRACE(\"writeSome() - %s (%d)\", state_str(), request_->contentAvailable());\n\n\tssize_t rv = backend_->write(writeBuffer_.data() + writeOffset_, writeBuffer_.size() - writeOffset_);\n\n\tif (rv > 0) {\n\t\tTRACE(\"write request: %ld (of %ld) bytes\", rv, writeBuffer_.size() - writeOffset_);\n\n\t\twriteOffset_ += rv;\n\t\twriteProgress_ += rv;\n\n\t\tif (writeOffset_ == writeBuffer_.size()) {\n\t\t\tTRACE(\"writeOffset == writeBuffser.size (%ld) p:%ld, ca: %d, clr:%ld\", writeOffset_,\n\t\t\t\twriteProgress_, request_->contentAvailable(), request_->connection.contentLength());\n\n\t\t\twriteOffset_ = 0;\n\t\t\twriteBuffer_.clear();\n\t\t\tbackend_->setMode(x0::Socket::Read);\n\t\t}\n\t} else {\n\t\tTRACE(\"write request failed(%ld): %s\", rv, strerror(errno));\n\t\tclose();\n\t}\n}\n\nvoid ProxyConnection::readSome()\n{\n\tTRACE(\"readSome() - %s\", state_str());\n\n\tstd::size_t lower_bound = readBuffer_.size();\n\n\tif (lower_bound == readBuffer_.capacity())\n\t\treadBuffer_.setCapacity(lower_bound + 4096);\n\n\tssize_t rv = backend_->read(readBuffer_);\n\n\tif (rv > 0) {\n\t\tTRACE(\"read response: %ld bytes\", rv);\n\t\tstd::size_t np = process(readBuffer_.ref(lower_bound, rv));\n\t\t(void) np;\n\t\tTRACE(\"readSome(): process(): %ld \/ %ld\", np, rv);\n\n\t\tif (processingDone_ || state() == SYNTAX_ERROR) {\n\t\t\tclose();\n\t\t} else {\n\t\t\tTRACE(\"resume with io:%d, state:%s\", backend_->mode(), backend_->state_str());\n\t\t\tbackend_->setMode(x0::Socket::Read);\n\t\t}\n\t} else if (rv == 0) {\n\t\tTRACE(\"http server connection closed\");\n\t\tclose();\n\t} else {\n\t\tTRACE(\"read response failed(%ld): %s\", rv, strerror(errno));\n\n\t\tswitch (errno) {\n#if defined(EWOULDBLOCK) && (EWOULDBLOCK != EAGAIN)\n\t\tcase EWOULDBLOCK:\n#endif\n\t\tcase EAGAIN:\n\t\tcase EINTR:\n\t\t\tbackend_->setMode(x0::Socket::Read);\n\t\t\tbreak;\n\t\tdefault:\n\t\t\tclose();\n\t\t\tbreak;\n\t\t}\n\t}\n}\n\n\/\/ }}}\n\n\/\/ {{{ plugin class\n\/**\n * \\ingroup plugins\n * \\brief proxy content generator plugin\n *\/\nclass proxy_plugin :\n\tpublic x0::HttpPlugin\n{\nprivate:\n\tbool cloak_;\n\npublic:\n\tproxy_plugin(x0::HttpServer& srv, const std::string& name) :\n\t\tx0::HttpPlugin(srv, name),\n\t\tcloak_(true)\n\t{\n\t\tregisterHandler<proxy_plugin, &proxy_plugin::proxy_reverse>(\"proxy.reverse\");\n\t\tregisterSetupProperty<proxy_plugin, &proxy_plugin::proxy_cloak>(\"proxy.cloak\", x0::FlowValue::BOOLEAN);\n\t}\n\n\t~proxy_plugin()\n\t{\n\t}\n\nprivate:\n\tvoid proxy_cloak(const x0::FlowParams& args, x0::FlowValue& result)\n\t{\n\t\tif (args.size() && (args[0].isBool() || args[0].isNumber())) {\n\t\t\tcloak_ = args[0].toBool();\n\t\t\tTRACE(\"proxy cloak: %s\", cloak_ ? \"true\" : \"false\");\n\t\t}\n\n\t\tresult.set(cloak_);\n\t}\n\n\tbool proxy_reverse(x0::HttpRequest *in, const x0::FlowParams& args)\n\t{\n\t\t\/\/ TODO: reuse already spawned proxy connections instead of recreating each time.\n\t\tx0::SocketSpec spec;\n\t\tspec << args;\n\t\tif (!spec.isValid() || spec.backlog >= 0) {\n\t\t\tin->log(x0::Severity::error, \"Invalid socket spec passed.\");\n\t\t\treturn false;\n\t\t}\n\n\t\tx0::Socket* backend = new x0::Socket(in->connection.worker().loop());\n\t\tbackend->open(spec, O_NONBLOCK | O_CLOEXEC);\n\n\t\tif (backend->isOpen()) {\n\t\t\tTRACE(\"in.content? %d\", in->contentAvailable());\n\t\t\tif (ProxyConnection* pc = new ProxyConnection()) {\n\t\t\t\tpc->start(in, backend, cloak_);\n\t\t\t\treturn true;\n\t\t\t}\n\t\t}\n\n\t\tin->status = x0::HttpError::ServiceUnavailable;\n\t\tin->finish();\n\n\t\treturn true;\n\t}\n};\n\/\/ }}}\n\nX0_EXPORT_PLUGIN(proxy)\n<|endoftext|>"} {"text":"<commit_before>#include \"loader.h\"\n\n#include<dlfcn.h>\n\n\n\nBVS::ModuleMap BVS::Loader::modules;\n\n\n\nBVS::ModuleVector BVS::Loader::masterModules;\n\n\n\nBVS::Loader::Loader(Control& control, const Info& info)\n\t: control(control)\n\t, logger(\"Loader\")\n\t, info(info)\n{\n\n}\n\n\n\nvoid BVS::Loader::registerModule(const std::string& id, Module* module)\n{\n\tmodules[id] = std::shared_ptr<ModuleData>(new ModuleData(\n\t\t\t id\n\t\t\t, std::string()\n\t\t\t, std::string()\n\t\t\t, module\n\t\t\t, nullptr\n\t\t\t, false\n\t\t\t, ModuleFlag::WAIT\n\t\t\t, Status::NONE\n\t\t\t, ConnectorMap()));\n}\n\n\n\nBVS::Loader& BVS::Loader::load(const std::string& moduleTraits, const bool asThread)\n{\n\t\/* algorithm:\n\t * SEPARATE id(library).options\n\t * CHECK for duplicate ids\n\t * LOAD the library and CHECK errors\n\t * LINK and execute register function, CHECK errors\n\t * SAVE metadata\n\t * MOVE connectors to metadata\n\t * START (un\/)threaded module\n\t *\/\n\tstd::string id;\n\tstd::string library;\n\tstd::string options;\n\n\t\/\/ search for '.' in id and separate id and options\n\tsize_t separator = moduleTraits.find_first_of('.');\n\tif (separator!=std::string::npos)\n\t{\n\t\tid = moduleTraits.substr(0, separator);\n\t\toptions = moduleTraits.substr(separator+1, std::string::npos);\n\t}\n\telse\n\t\tid = moduleTraits;\n\n\t\/\/ search for '(' in id and separate if necessary\n\tseparator = id.find_first_of('(');\n\tif (separator!=std::string::npos)\n\t{\n\t\tlibrary = id.substr(separator+1, std::string::npos);\n\t\tlibrary.erase(library.length()-1);\n\t\tid = id.erase(separator, std::string::npos);\n\t}\n\telse\n\t\tlibrary = id;\n\n\t\/\/ search for duplicate id in modules\n\tif (modules.find(id)!=modules.end())\n\t{\n\t\tLOG(0, \"Duplicate id for module: \" << id);\n\t\tLOG(0, \"If you try to load a module more than once, use unique ids and the id(library).options syntax!\");\n\t\texit(-1);\n\t}\n\n\t\/\/ prepare path and load the lib\n\tstd::string modulePath = \".\/lib\" + library + \".so\";\n\tLOG(3, \"Loading \" << id << \" from \" << modulePath << \"!\");\n\tvoid* dlib = dlopen(modulePath.c_str(), RTLD_NOW);\n\n\t\/\/ check for errors\n\tif (dlib == NULL)\n\t{\n\t\tLOG(0, \"Loading \" << modulePath << \", resulted in: \" << dlerror());\n\t\texit(-1);\n\t}\n\n\t\/\/ look for bvsRegisterModule in loaded lib, check for errors and execute register function\n\ttypedef void (*bvsRegisterModule_t)(const std::string& id, const Info& info);\n\tbvsRegisterModule_t bvsRegisterModule;\n\t*reinterpret_cast<void**>(&bvsRegisterModule)=dlsym(dlib, \"bvsRegisterModule\");\n\n\t\/\/ check for errors\n\tchar* dlerr = dlerror();\n\tif (dlerr)\n\t{\n\t\tLOG(0, \"Loading function bvsRegisterModule() in \" << modulePath << \" resulted in: \" << dlerr);\n\t\texit(-1);\n\t}\n\n\t\/\/ register\n\tbvsRegisterModule(id, info);\n\tLOG(2, \"Loading \" << id << \" successfull!\");\n\n\t\/\/ save handle,library name and option string for later use\n\tmodules[id]->dlib = dlib;\n\tmodules[id]->library = library;\n\tmodules[id]->options = options;\n\n\t\/\/ move connectors from temporary to metadata\n\tmodules[id]->connectors = std::move(ConnectorDataCollector::connectors);\n\n\t\/\/ set metadata and start as thread if needed\n\tif (asThread==true)\n\t{\n\t\tLOG(3, id << \" executed by dedicated thread!\");\n\t\tmodules[id]->asThread = true;\n\t\tmodules[id]->thread = std::thread(&Control::threadController, &control, modules[id]);\n\t\tControl::threadedModules++;\n\t}\n\telse\n\t{\n\t\tLOG(3, id << \" executed by controller!\");\n\t\tmodules[id]->asThread = false;\n\t\tmasterModules.push_back(modules[id]);\n\t}\n\n\treturn *this;\n}\n\n\n\nBVS::Loader& BVS::Loader::unload(const std::string& id, const bool eraseFromMap)\n{\n\t\/* algorithm:\n\t * CHECK thread, signal exit\n\t * DISCONNECT connectors\n\t * DELETE module instance and connectors\n\t * CHECK library handle\n\t * CLOSE library\n\t * CHECK errors\n\t *\/\n\t\/\/ wait for thread to join, first check if it is still running\n\tif (modules[id]->asThread == true)\n\t{\n\t\tif (modules[id]->thread.joinable())\n\t\t{\n\t\t\tmodules[id]->flag = ModuleFlag::QUIT;\n\t\t\tcontrol.threadCond.notify_all();\n\t\t\tLOG(3, \"Waiting for \" << id << \" to join!\");\n\t\t\tmodules[id]->thread.join();\n\t\t}\n\t}\n\n\t\/\/ disconnect connectors\n\tfor (auto& it: modules)\n\t{\n\t\tfor (auto& con: it.second->connectors)\n\t\t{\n\t\t\tif (con.second->type==ConnectorType::INPUT) continue;\n\n\t\t\t\/\/ find and reset all inputs connected to output\n\t\t\tfor (auto& mods: modules)\n\t\t\t{\n\t\t\t\tfor (auto& modCon: mods.second->connectors)\n\t\t\t\t{\n\t\t\t\t\tif (con.second->pointer==modCon.second->pointer)\n\t\t\t\t\t{\n\t\t\t\t\t\tmodCon.second->pointer = nullptr;\n\t\t\t\t\t\tmodCon.second->active = false;\n\t\t\t\t\t\tmodCon.second->mutex = nullptr;\n\t\t\t\t\t}\n\t\t\t\t}\n\n\t\t\t}\n\t\t}\n\t}\n\n\t\/\/ delete module and connectors\n\tmodules[id]->connectors.clear();\n\tdelete modules[id]->module;\n\tmodules[id]->module = nullptr;\n\n\t\/\/ close lib and check for errors\n\tstd::string modulePath = \".\/lib\" + modules[id]->library + \".so\";\n\tLOG(3, id << \" unloading from \" << modulePath << \"!\");\n\n\t\/\/ get handle from internals\n\tvoid* dlib = modules[id]->dlib;\n\tif (dlib==nullptr)\n\t{\n\t\tLOG(0, \"Requested module \" << id << \" not found!\");\n\t\texit(-1);\n\t}\n\n\t\/\/ close the module\n\tdlclose(dlib);\n\n\t\/\/ check for errors\n\tchar* dlerr = dlerror();\n\tif (dlerr)\n\t{\n\t\tLOG(0, \"While closing \" << modulePath << \" following error occured: \" << dlerror());\n\t\texit(-1);\n\t}\n\tLOG(2, id << \" unloaded!\");\n\n\tif (eraseFromMap)\n\t{\n\t\tmodules.erase(id);\n\t}\n\n\treturn *this;\n}\n\n\n\nBVS::Loader& BVS::Loader::unloadAll()\n{\n\tfor (auto& it: modules)\n\t\tunload(it.second->id, false);\n\n\tmodules.clear();\n\n\treturn *this;\n}\n\n\n\nBVS::Loader& BVS::Loader::connectAllModules(const bool connectorTypeMatching)\n{\n\tfor (auto& it: modules) connectModule(it.second->id, connectorTypeMatching);\n\n\treturn *this;\n}\n\n\n\nBVS::Loader& BVS::Loader::connectModule(const std::string& id, const bool connectorTypeMatching)\n{\n\t\/* algorithm:\n\t * WHILE option string not empty\n\t *\tSEPARATE selection\n\t * \tCHECK input and output\n\t * \tCHECK input typeid hash == output typeid hash\n\t * \tCONNECT\n\t * DONE\n\t *\/\n\n\tModuleData* module = modules[id].get();\n\tstd::string options = module->options;\n\tstd::string selection;\n\tstd::string input;\n\tstd::string targetModule;\n\tstd::string targetOutput;\n\tsize_t separator;\n\tsize_t separator2;\n\n\twhile (!options.empty())\n\t{\n\t\t\/\/ get input name and selection\n\t\tseparator = options.find_first_of('(');\n\t\tseparator2 = options.find_first_of(')');\n\t\tselection = options.substr(0, separator2+1);\n\t\tif (separator!=std::string::npos)\n\t\t{\n\t\t\tinput = options.substr(0, separator);\n\t\t\ttargetModule= options.substr(separator+1, separator2-separator-1);\n\t\t}\n\t\telse\n\t\t{\n\t\t\tLOG(0, \"No input selection found: \" << selection);\n\t\t\texit(1);\n\t\t}\n\n\t\t\/\/ remove parsed part\n\t\toptions.erase(0, separator2+1);\n\t\tif (options[0] == '.') options.erase(options.begin());\n\n\t\t\/\/ search for '.' in selection and separate module and output\n\t\tseparator = targetModule.find_first_of('.');\n\t\tif (separator!=std::string::npos)\n\t\t{\n\t\t\ttargetOutput = targetModule.substr(separator+1, std::string::npos);\n\t\t\ttargetModule = targetModule.substr(0, separator);\n\t\t}\n\t\telse\n\t\t{\n\t\t\tLOG(0, \"No module output selected: \" << module->id << \".\" << selection);\n\t\t\texit(1);\n\t\t}\n\n\t\t\/\/ check input and output\n\t\tcheckModuleInput(module, input);\n\t\tcheckModuleOutput(module, targetModule, targetOutput);\n\n\t\t\/\/ check input typeid hash == output typeid hash\n\t\tif (connectorTypeMatching && module->connectors[input]->typeIDHash != modules[targetModule]->connectors[targetOutput]->typeIDHash)\n\t\t{\n\t\t\tLOG(0, \"Selected input and output connector template instantiations are of different type: \"\n\t\t\t\t\t<< module->id << \".\" << selection << \" -> \"\n\t\t\t\t\t<< module->connectors[input]->typeIDName << \" != \" << modules[targetModule]->connectors[targetOutput]->typeIDName);\n\t\t\texit(1);\n\t\t}\n\n\t\t\/\/ connect\n\t\tmodule->connectors[input]->pointer = modules[targetModule]->connectors[targetOutput]->pointer;\n\t\tmodule->connectors[input]->mutex = modules[targetModule]->connectors[targetOutput]->mutex;\n\t\tLOG(3, \"Connected: \" << module->id << \".\" << module->connectors[input]->id << \" <- \" << modules[targetModule]->id << \".\" << modules[targetModule]->connectors[targetOutput]->id);\n\t}\n\n\treturn *this;\n}\n\n\n\nBVS::Loader& BVS::Loader::printModuleConnectors(const ModuleData* module)\n{\n\tif (module->connectors.size()==0)\n\t\tLOG(0, \"Module \" << module->id << \" does not define any connector!\");\n\telse\n\t{\n\t\tLOG(0, \"Module \" << module->id << \" defines the following connectors: \");\n\t\tfor (auto& it: module->connectors) LOG(0, it.second->type << \": \" << it.second->id);\n\t}\n\n\treturn *this;\n}\n\n\n\nBVS::Loader& BVS::Loader::checkModuleInput(const ModuleData* module, const std::string& inputName)\n{\n\tauto input = module->connectors.find(inputName);\n\n\t\/\/ check existence and type\n\tif (input == module->connectors.end() || input->second->type != ConnectorType::INPUT)\n\t{\n\t\tLOG(0, \"Input not found: \" << module->id << \".\" << inputName);\n\t\tprintModuleConnectors(module);\n\t\texit(1);\n\t}\n\n\t\/\/ check if input is already connected\n\tif (input->second->active)\n\t{\n\t\tLOG(0, \"Input already connected: \" << module->id << \".\" << inputName);\n\t\texit(1);\n\t}\n\n\treturn *this;\n}\n\n\n\nBVS::Loader& BVS::Loader::checkModuleOutput(const ModuleData* module, const std::string& targetModule, const std::string& targetOutput)\n{\n\tauto target = modules.find(targetModule);\n\n\t\/\/ check if desired module exists\n\tif (target == modules.end())\n\t{\n\t\tLOG(0, \"Module not found: \" << targetModule << \" in \" << module->id << \".\" << module->options);\n\t\texit(1);\n\t}\n\n\tauto output = target->second->connectors.find(targetOutput);\n\n\t\/\/ check output existence and type\n\tif (output == target->second->connectors.end() || output->second->type != ConnectorType::OUTPUT)\n\t{\n\t\tLOG(0, \"Output not found: \" << targetOutput << \" in \" << module->id << \".\" << module->options);\n\t\tprintModuleConnectors(target->second.get());\n\t\texit(1);\n\t}\n\n\treturn *this;\n}\n\n<commit_msg>loader: fix syntax error<commit_after>#include \"loader.h\"\n\n#include<dlfcn.h>\n\n\n\nBVS::ModuleMap BVS::Loader::modules;\n\n\n\nBVS::ModuleVector BVS::Loader::masterModules;\n\n\n\nBVS::Loader::Loader(Control& control, const Info& info)\n\t: control(control)\n\t, logger(\"Loader\")\n\t, info(info)\n{\n\n}\n\n\n\nvoid BVS::Loader::registerModule(const std::string& id, Module* module)\n{\n\tmodules[id] = std::shared_ptr<ModuleData>(new ModuleData(\n\t\t\t id\n\t\t\t, std::string()\n\t\t\t, std::string()\n\t\t\t, module\n\t\t\t, nullptr\n\t\t\t, false\n\t\t\t, ModuleFlag::WAIT\n\t\t\t, Status::NONE\n\t\t\t, ConnectorMap()));\n}\n\n\n\nBVS::Loader& BVS::Loader::load(const std::string& moduleTraits, const bool asThread)\n{\n\t\/* algorithm:\n\t * SEPARATE id(library).options\n\t * CHECK for duplicate ids\n\t * LOAD the library and CHECK errors\n\t * LINK and execute register function, CHECK errors\n\t * SAVE metadata\n\t * MOVE connectors to metadata\n\t * START (un\/)threaded module\n\t *\/\n\tstd::string id;\n\tstd::string library;\n\tstd::string options;\n\n\t\/\/ search for '.' in id and separate id and options\n\tsize_t separator = moduleTraits.find_first_of('.');\n\tif (separator!=std::string::npos)\n\t{\n\t\tid = moduleTraits.substr(0, separator);\n\t\toptions = moduleTraits.substr(separator+1, std::string::npos);\n\t}\n\telse\n\t\tid = moduleTraits;\n\n\t\/\/ search for '(' in id and separate if necessary\n\tseparator = id.find_first_of('(');\n\tif (separator!=std::string::npos)\n\t{\n\t\tlibrary = id.substr(separator+1, std::string::npos);\n\t\tlibrary.erase(library.length()-1);\n\t\tid = id.erase(separator, std::string::npos);\n\t}\n\telse\n\t\tlibrary = id;\n\n\t\/\/ search for duplicate id in modules\n\tif (modules.find(id)!=modules.end())\n\t{\n\t\tLOG(0, \"Duplicate id for module: \" << id);\n\t\tLOG(0, \"If you try to load a module more than once, use unique ids and the id(library).options syntax!\");\n\t\texit(-1);\n\t}\n\n\t\/\/ prepare path and load the lib\n\tstd::string modulePath = \".\/lib\" + library + \".so\";\n\tLOG(3, \"Loading \" << id << \" from \" << modulePath << \"!\");\n\tvoid* dlib = dlopen(modulePath.c_str(), RTLD_NOW);\n\n\t\/\/ check for errors\n\tif (dlib == NULL)\n\t{\n\t\tLOG(0, \"Loading \" << modulePath << \", resulted in: \" << dlerror());\n\t\texit(-1);\n\t}\n\n\t\/\/ look for bvsRegisterModule in loaded lib, check for errors and execute register function\n\ttypedef void (*bvsRegisterModule_t)(const std::string& id, const Info& info);\n\tbvsRegisterModule_t bvsRegisterModule;\n\t*reinterpret_cast<void**>(&bvsRegisterModule)=dlsym(dlib, \"bvsRegisterModule\");\n\n\t\/\/ check for errors\n\tchar* dlerr = dlerror();\n\tif (dlerr)\n\t{\n\t\tLOG(0, \"Loading function bvsRegisterModule() in \" << modulePath << \" resulted in: \" << dlerr);\n\t\texit(-1);\n\t}\n\n\t\/\/ register\n\tbvsRegisterModule(id, info);\n\tLOG(2, \"Loading \" << id << \" successfull!\");\n\n\t\/\/ save handle,library name and option string for later use\n\tmodules[id]->dlib = dlib;\n\tmodules[id]->library = library;\n\tmodules[id]->options = options;\n\n\t\/\/ move connectors from temporary to metadata\n\tmodules[id]->connectors = std::move(ConnectorDataCollector::connectors);\n\n\t\/\/ set metadata and start as thread if needed\n\tif (asThread==true)\n\t{\n\t\tLOG(3, id << \" executed by dedicated thread!\");\n\t\tmodules[id]->asThread = true;\n\t\tmodules[id]->thread = std::thread(&Control::threadController, &control, modules[id]);\n\t\tControl::threadedModules++;\n\t}\n\telse\n\t{\n\t\tLOG(3, id << \" executed by controller!\");\n\t\tmodules[id]->asThread = false;\n\t\tmasterModules.push_back(modules[id]);\n\t}\n\n\treturn *this;\n}\n\n\n\nBVS::Loader& BVS::Loader::unload(const std::string& id, const bool eraseFromMap)\n{\n\t\/* algorithm:\n\t * CHECK thread, signal exit\n\t * DISCONNECT connectors\n\t * DELETE module instance and connectors\n\t * CHECK library handle\n\t * CLOSE library\n\t * CHECK errors\n\t *\/\n\t\/\/ wait for thread to join, first check if it is still running\n\tif (modules[id]->asThread == true)\n\t{\n\t\tif (modules[id]->thread.joinable())\n\t\t{\n\t\t\tmodules[id]->flag = ModuleFlag::QUIT;\n\t\t\tcontrol.threadCond.notify_all();\n\t\t\tLOG(3, \"Waiting for \" << id << \" to join!\");\n\t\t\tmodules[id]->thread.join();\n\t\t}\n\t}\n\n\t\/\/ disconnect connectors\n\tfor (auto& it: modules)\n\t{\n\t\tfor (auto& con: it.second->connectors)\n\t\t{\n\t\t\tif (con.second->type==ConnectorType::INPUT) continue;\n\n\t\t\t\/\/ find and reset all inputs connected to output\n\t\t\tfor (auto& mods: modules)\n\t\t\t{\n\t\t\t\tfor (auto& modCon: mods.second->connectors)\n\t\t\t\t{\n\t\t\t\t\tif (con.second->pointer==modCon.second->pointer)\n\t\t\t\t\t{\n\t\t\t\t\t\tmodCon.second->pointer = nullptr;\n\t\t\t\t\t\tmodCon.second->active = false;\n\t\t\t\t\t\tmodCon.second->mutex = nullptr;\n\t\t\t\t\t}\n\t\t\t\t}\n\n\t\t\t}\n\t\t}\n\t}\n\n\t\/\/ delete module and connectors\n\tmodules[id]->connectors.clear();\n\tdelete modules[id]->module;\n\tmodules[id]->module = nullptr;\n\n\t\/\/ close lib and check for errors\n\tstd::string modulePath = \".\/lib\" + modules[id]->library + \".so\";\n\tLOG(3, id << \" unloading from \" << modulePath << \"!\");\n\n\t\/\/ get handle from internals\n\tvoid* dlib = modules[id]->dlib;\n\tif (dlib==nullptr)\n\t{\n\t\tLOG(0, \"Requested module \" << id << \" not found!\");\n\t\texit(-1);\n\t}\n\n\t\/\/ close the module\n\tdlclose(dlib);\n\n\t\/\/ check for errors\n\tchar* dlerr = dlerror();\n\tif (dlerr)\n\t{\n\t\tLOG(0, \"While closing \" << modulePath << \" following error occured: \" << dlerror());\n\t\texit(-1);\n\t}\n\tLOG(2, id << \" unloaded!\");\n\n\tif (eraseFromMap)\n\t{\n\t\tmodules.erase(id);\n\t}\n\n\treturn *this;\n}\n\n\n\nBVS::Loader& BVS::Loader::unloadAll()\n{\n\tfor (auto& it: modules)\n\t\tunload(it.second->id, false);\n\n\tmodules.clear();\n\n\treturn *this;\n}\n\n\n\nBVS::Loader& BVS::Loader::connectAllModules(const bool connectorTypeMatching)\n{\n\tfor (auto& it: modules) connectModule(it.second->id, connectorTypeMatching);\n\n\treturn *this;\n}\n\n\n\nBVS::Loader& BVS::Loader::connectModule(const std::string& id, const bool connectorTypeMatching)\n{\n\t\/* algorithm:\n\t * WHILE option string not empty\n\t *\tSEPARATE selection\n\t * \tCHECK input and output\n\t * \tCHECK input typeid hash == output typeid hash\n\t * \tCONNECT\n\t * DONE\n\t *\/\n\n\tModuleData* module = modules[id].get();\n\tstd::string options = module->options;\n\tstd::string selection;\n\tstd::string input;\n\tstd::string targetModule;\n\tstd::string targetOutput;\n\tsize_t separator;\n\tsize_t separator2;\n\n\twhile (!options.empty())\n\t{\n\t\t\/\/ get input name and selection\n\t\tseparator = options.find_first_of('(');\n\t\tseparator2 = options.find_first_of(')');\n\t\tselection = options.substr(0, separator2+1);\n\t\tif (separator!=std::string::npos)\n\t\t{\n\t\t\tinput = options.substr(0, separator);\n\t\t\ttargetModule= options.substr(separator+1, separator2-separator-1);\n\t\t}\n\t\telse\n\t\t{\n\t\t\tLOG(0, \"No input selection found: \" << selection);\n\t\t\texit(1);\n\t\t}\n\n\t\t\/\/ remove parsed part\n\t\toptions.erase(0, separator2+1);\n\t\tif (options[0] == '.') options.erase(options.begin());\n\n\t\t\/\/ search for '.' in selection and separate module and output\n\t\tseparator = targetModule.find_first_of('.');\n\t\tif (separator!=std::string::npos)\n\t\t{\n\t\t\ttargetOutput = targetModule.substr(separator+1, std::string::npos);\n\t\t\ttargetModule = targetModule.substr(0, separator);\n\t\t}\n\t\telse\n\t\t{\n\t\t\tLOG(0, \"No module output selected: \" << module->id << \".\" << selection);\n\t\t\texit(1);\n\t\t}\n\n\t\t\/\/ check input and output\n\t\tcheckModuleInput(module, input);\n\t\tcheckModuleOutput(module, targetModule, targetOutput);\n\n\t\t\/\/ check input typeid hash == output typeid hash\n\t\tif (connectorTypeMatching && module->connectors[input]->typeIDHash != modules[targetModule]->connectors[targetOutput]->typeIDHash)\n\t\t{\n\t\t\tLOG(0, \"Selected input and output connector template instantiations are of different type: \"\n\t\t\t\t\t<< module->id << \".\" << selection << \" -> \"\n\t\t\t\t\t<< module->connectors[input]->typeIDName << \" != \" << modules[targetModule]->connectors[targetOutput]->typeIDName);\n\t\t\texit(1);\n\t\t}\n\n\t\t\/\/ connect\n\t\tmodule->connectors[input]->pointer = modules[targetModule]->connectors[targetOutput]->pointer;\n\t\tmodule->connectors[input]->mutex = modules[targetModule]->connectors[targetOutput]->mutex;\n\t\tLOG(3, \"Connected: \" << module->id << \".\" << module->connectors[input]->id << \" <- \" << modules[targetModule]->id << \".\" << modules[targetModule]->connectors[targetOutput]->id);\n\t}\n\n\treturn *this;\n}\n\n\n\nBVS::Loader& BVS::Loader::printModuleConnectors(const ModuleData* module)\n{\n\tif (module->connectors.size()==0)\n\t{\n\t\tLOG(0, \"Module \" << module->id << \" does not define any connector!\");\n\t}\n\telse\n\t{\n\t\tLOG(0, \"Module \" << module->id << \" defines the following connectors: \");\n\t\tfor (auto& it: module->connectors) LOG(0, it.second->type << \": \" << it.second->id);\n\t}\n\n\treturn *this;\n}\n\n\n\nBVS::Loader& BVS::Loader::checkModuleInput(const ModuleData* module, const std::string& inputName)\n{\n\tauto input = module->connectors.find(inputName);\n\n\t\/\/ check existence and type\n\tif (input == module->connectors.end() || input->second->type != ConnectorType::INPUT)\n\t{\n\t\tLOG(0, \"Input not found: \" << module->id << \".\" << inputName);\n\t\tprintModuleConnectors(module);\n\t\texit(1);\n\t}\n\n\t\/\/ check if input is already connected\n\tif (input->second->active)\n\t{\n\t\tLOG(0, \"Input already connected: \" << module->id << \".\" << inputName);\n\t\texit(1);\n\t}\n\n\treturn *this;\n}\n\n\n\nBVS::Loader& BVS::Loader::checkModuleOutput(const ModuleData* module, const std::string& targetModule, const std::string& targetOutput)\n{\n\tauto target = modules.find(targetModule);\n\n\t\/\/ check if desired module exists\n\tif (target == modules.end())\n\t{\n\t\tLOG(0, \"Module not found: \" << targetModule << \" in \" << module->id << \".\" << module->options);\n\t\texit(1);\n\t}\n\n\tauto output = target->second->connectors.find(targetOutput);\n\n\t\/\/ check output existence and type\n\tif (output == target->second->connectors.end() || output->second->type != ConnectorType::OUTPUT)\n\t{\n\t\tLOG(0, \"Output not found: \" << targetOutput << \" in \" << module->id << \".\" << module->options);\n\t\tprintModuleConnectors(target->second.get());\n\t\texit(1);\n\t}\n\n\treturn *this;\n}\n\n<|endoftext|>"} {"text":"<commit_before>#include <SDL_thread.h>\n#include \"StdinCLISupport.h\"\n#include \"ThreadPool.h\"\n#include \"Mutex.h\"\n#include \"OLXCommand.h\"\n#include \"Debug.h\"\n#include \"InputEvents.h\"\n\n\nstatic bool hasStdinCLISupport = false;\n\nbool stdinCLIActive() { return hasStdinCLISupport; }\n\n#ifndef HAVE_LINENOISE\nResult initStdinCLISupport() {\n\treturn \"not implemented\";\n}\n\nvoid quitStdinCLISupport() {}\n\nStdinCLI_StdoutScope::StdinCLI_StdoutScope() {}\nStdinCLI_StdoutScope::~StdinCLI_StdoutScope() {}\n#else\n\n#include <unistd.h>\n#include <sys\/select.h>\n#include <linenoise.h>\n\nstruct StdinCmdLineIntf : CmdLineIntf {\n\tvoid pushReturnArg(const std::string& str) {\n\t\tnotes << \"CLI return: \" << str << endl;\n\t}\n\n\tvoid finalizeReturn() {\n\t\tnotes << \"CLI return.\" << endl;\n\t}\n\n\tvoid writeMsg(const std::string& str, CmdLineMsgType type) {\n\t\t\/\/ TODO: handle type\n\t\thints << \"CLI: \" << str << endl;\n\t}\n\n};\nStdinCmdLineIntf stdinCLI;\n\nstatic Mutex stdoutMutex;\nstatic bool stdoutInRawMode = false;\nstatic bool quit = false;\n\nstruct LinenoiseEnvCustom : LinenoiseEnv {\n\tLinenoiseEnvCustom() {\n\t\tprompt = \"OLX> \";\n\t}\n\tvirtual ssize_t read(void* d, size_t nbyte) {\n\t\tMutex::ScopedUnlock unlock(stdoutMutex);\n\n\t\twhile(true) {\n\t\t\tstruct timeval time;\n\t\t\ttime.tv_sec = 0;\n\t\t\ttime.tv_usec = 10 * 1000; \/\/ 10ms\n\t\t\tfd_set set;\n\t\t\tFD_ZERO(&set);\n\t\t\tFD_SET(fd, &set);\n\t\t\tint r = select(fd+1, &set, NULL, NULL, &time);\n\t\t\t{\n\t\t\t\tMutex::ScopedLock lock(stdoutMutex);\n\t\t\t\tif(r > 0)\n\t\t\t\t\treturn LinenoiseEnv::read(d, nbyte);\n\t\t\t\tif(r < 0)\n\t\t\t\t\treturn -1;\n\t\t\t\tif(quit) return 0;\n\t\t\t}\n\t\t}\n\t\treturn -1;\n\t}\n};\n\nLinenoiseEnvCustom linenoiseEnv;\n\nStdinCLI_StdoutScope::StdinCLI_StdoutScope() {\n\tstdoutMutex.lock();\n\tif(stdoutInRawMode) {\n\t\tlinenoiseEnv.eraseLine();\n\t\tlinenoiseDisableRawMode(linenoiseEnv.fd);\n\t}\n}\n\nStdinCLI_StdoutScope::~StdinCLI_StdoutScope() {\n\tif(stdoutInRawMode) {\n\t\tlinenoiseEnableRawMode(linenoiseEnv.fd);\n\t\tlinenoiseEnv.refreshLine();\n\t}\n\tstdoutMutex.unlock();\n}\n\nvoid linenoiseCompletionCallbackFunc(const std::string& buf, LinenoiseCompletions* lc) {\n\tMutex::ScopedUnlock unlock(stdoutMutex);\n\n}\n\nint handleStdin(void*) {\n\twhile(!linenoiseEnv.hadReadError) {\n\t\tstd::string buf;\n\t\t{\n\t\t\tMutex::ScopedLock lock(stdoutMutex);\n\t\t\tif(quit) break;\n\t\t\tstdoutInRawMode = true;\n\t\t\tbuf = linenoiseEnv.getNextInput();\n\t\t\tstdoutInRawMode = false;\n\t\t}\n\t\tif(!buf.empty()) {\n\t\t\tExecute( &stdinCLI, buf );\n\t\t\tWakeupIfNeeded();\n\t\t}\n\t}\n\tif(!quit)\n\t\tnotes << \"CLI read error. quit\" << endl;\n\treturn 0;\n}\n\nstatic SDL_Thread* stdinHandleThread = NULL;\n\nResult initStdinCLISupport() {\n\tif(!isatty(STDIN_FILENO))\n\t\treturn \"stdin is not a terminal type device\";\n\n\tif(linenoiseIsUnsupportedTerm())\n\t\treturn \"linenoise does not support this type of terminal\";\n\n\tlinenoiseSetCompletionCallback(linenoiseCompletionCallbackFunc);\n\n\tstdinHandleThread = SDL_CreateThread(handleStdin, NULL);\n\tif(stdinHandleThread == NULL)\n\t\treturn \"couldn't create thread\";\n\n\thasStdinCLISupport = true;\n\treturn true;\n}\n\nvoid quitStdinCLISupport() {\n\tif(!hasStdinCLISupport) return;\n\tif(!stdinHandleThread) return;\n\n\tnotes << \"wait for StdinCLI quit\" << endl;\n\t{\n\t\tMutex::ScopedLock lock(stdoutMutex);\n\t\tquit = true;\n\t}\n\tSDL_WaitThread(stdinHandleThread, NULL);\n\tstdinHandleThread = NULL;\n\thasStdinCLISupport = false;\n}\n\n#endif \/\/ HAVE_LINENOISE\n<commit_msg>StdinCLI support: autocompletion support<commit_after>#include <SDL_thread.h>\n#include \"StdinCLISupport.h\"\n#include \"ThreadPool.h\"\n#include \"Mutex.h\"\n#include \"OLXCommand.h\"\n#include \"Debug.h\"\n#include \"InputEvents.h\"\n#include \"Autocompletion.h\"\n\n\nstatic bool hasStdinCLISupport = false;\n\nbool stdinCLIActive() { return hasStdinCLISupport; }\n\n#ifndef HAVE_LINENOISE\nResult initStdinCLISupport() {\n\treturn \"not implemented\";\n}\n\nvoid quitStdinCLISupport() {}\n\nStdinCLI_StdoutScope::StdinCLI_StdoutScope() {}\nStdinCLI_StdoutScope::~StdinCLI_StdoutScope() {}\n#else\n\n#include <unistd.h>\n#include <sys\/select.h>\n#include <linenoise.h>\n\nstruct StdinCmdLineIntf : CmdLineIntf {\n\tvoid pushReturnArg(const std::string& str) {\n\t\tnotes << \"CLI return: \" << str << endl;\n\t}\n\n\tvoid finalizeReturn() {\n\t\tnotes << \"CLI return.\" << endl;\n\t}\n\n\tvoid writeMsg(const std::string& str, CmdLineMsgType type) {\n\t\t\/\/ TODO: handle type\n\t\thints << \"CLI: \" << str << endl;\n\t}\n\n};\nStdinCmdLineIntf stdinCLI;\n\nstatic Mutex stdoutMutex;\nstatic bool stdoutInRawMode = false;\nstatic bool quit = false;\n\nstruct LinenoiseEnvCustom : LinenoiseEnv {\n\tLinenoiseEnvCustom() {\n\t\tprompt = \"OLX> \";\n\t}\n\tvirtual ssize_t read(void* d, size_t nbyte) {\n\t\tMutex::ScopedUnlock unlock(stdoutMutex);\n\n\t\twhile(true) {\n\t\t\tstruct timeval time;\n\t\t\ttime.tv_sec = 0;\n\t\t\ttime.tv_usec = 10 * 1000; \/\/ 10ms\n\t\t\tfd_set set;\n\t\t\tFD_ZERO(&set);\n\t\t\tFD_SET(fd, &set);\n\t\t\tint r = select(fd+1, &set, NULL, NULL, &time);\n\t\t\t{\n\t\t\t\tMutex::ScopedLock lock(stdoutMutex);\n\t\t\t\tif(r > 0)\n\t\t\t\t\treturn LinenoiseEnv::read(d, nbyte);\n\t\t\t\tif(r < 0)\n\t\t\t\t\treturn -1;\n\t\t\t\tif(quit) return 0;\n\t\t\t}\n\t\t}\n\t\treturn -1;\n\t}\n};\n\nLinenoiseEnvCustom linenoiseEnv;\n\nStdinCLI_StdoutScope::StdinCLI_StdoutScope() {\n\tstdoutMutex.lock();\n\tif(stdoutInRawMode) {\n\t\tlinenoiseEnv.eraseLine();\n\t\tlinenoiseDisableRawMode(linenoiseEnv.fd);\n\t}\n}\n\nStdinCLI_StdoutScope::~StdinCLI_StdoutScope() {\n\tif(stdoutInRawMode) {\n\t\tlinenoiseEnableRawMode(linenoiseEnv.fd);\n\t\tlinenoiseEnv.refreshLine();\n\t}\n\tstdoutMutex.unlock();\n}\n\nbool linenoiseCompletionCallbackFunc(const std::string& buf, LinenoiseCompletions* lc) {\n\tMutex::ScopedUnlock unlock(stdoutMutex);\n\n\t\/\/ Auto-complete\n\tAutocompletionInfo autoCompleteInfo;\n\tAutoComplete(linenoiseEnv.buf, linenoiseEnv.pos, stdinCLI, autoCompleteInfo);\n\tbool fail = false;\n\tAutocompletionInfo::InputState oldState(linenoiseEnv.buf, linenoiseEnv.pos);\n\tAutocompletionInfo::InputState newState;\n\tautoCompleteInfo.popWait(oldState, newState, fail);\n\tif(!fail) {\n\t\tMutex::ScopedLock lock(stdoutMutex);\n\t\tlinenoiseEnv.buf = newState.text;\n\t\tlinenoiseEnv.pos = newState.pos;\n\t\tlinenoiseEnv.refreshLine();\n\t\treturn true;\n\t}\n\n\treturn false;\n}\n\nint handleStdin(void*) {\n\twhile(!linenoiseEnv.hadReadError) {\n\t\tstd::string buf;\n\t\t{\n\t\t\tMutex::ScopedLock lock(stdoutMutex);\n\t\t\tif(quit) break;\n\t\t\tstdoutInRawMode = true;\n\t\t\tbuf = linenoiseEnv.getNextInput();\n\t\t\tstdoutInRawMode = false;\n\t\t}\n\t\tif(!buf.empty()) {\n\t\t\tExecute( &stdinCLI, buf );\n\t\t\tWakeupIfNeeded();\n\t\t}\n\t}\n\tif(!quit)\n\t\tnotes << \"CLI read error. quit\" << endl;\n\treturn 0;\n}\n\nstatic SDL_Thread* stdinHandleThread = NULL;\n\nResult initStdinCLISupport() {\n\tif(!isatty(STDIN_FILENO))\n\t\treturn \"stdin is not a terminal type device\";\n\n\tif(linenoiseIsUnsupportedTerm())\n\t\treturn \"linenoise does not support this type of terminal\";\n\n\tlinenoiseSetCompletionCallback(linenoiseCompletionCallbackFunc);\n\n\tstdinHandleThread = SDL_CreateThread(handleStdin, NULL);\n\tif(stdinHandleThread == NULL)\n\t\treturn \"couldn't create thread\";\n\n\thasStdinCLISupport = true;\n\treturn true;\n}\n\nvoid quitStdinCLISupport() {\n\tif(!hasStdinCLISupport) return;\n\tif(!stdinHandleThread) return;\n\n\tnotes << \"wait for StdinCLI quit\" << endl;\n\t{\n\t\tMutex::ScopedLock lock(stdoutMutex);\n\t\tquit = true;\n\t}\n\tSDL_WaitThread(stdinHandleThread, NULL);\n\tstdinHandleThread = NULL;\n\thasStdinCLISupport = false;\n}\n\n#endif \/\/ HAVE_LINENOISE\n<|endoftext|>"} {"text":"<commit_before>\/*\n * Software License Agreement (BSD License)\n *\n * Point Cloud Library (PCL) - www.pointclouds.org\n * Copyright (c) 2010-2012, 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\n#include <pcl\/outofcore\/outofcore_base_data.h>\n\n#include <pcl\/pcl_macros.h>\n#include <pcl\/exceptions.h>\n#include <pcl\/console\/print.h>\n\n#include <fstream>\n\n#define __PCL_OUTOFCORE_VERSION__ 3\n\nnamespace pcl\n{\n namespace outofcore\n {\n OutofcoreOctreeBaseMetadata::OutofcoreOctreeBaseMetadata () \n : metadata_filename_ ()\n , outofcore_version_ ()\n , coordinate_system_ ()\n , tree_name_ ()\n , point_type_ (\"urp\")\n , levels_of_depth_ ()\n , LOD_num_points_ ()\n {\n }\n \n \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n OutofcoreOctreeBaseMetadata::OutofcoreOctreeBaseMetadata (const boost::filesystem::path& metadata_filename) \n : metadata_filename_ (metadata_filename)\n , outofcore_version_ ()\n , coordinate_system_ ()\n , tree_name_ ()\n , point_type_ (\"urp\")\n , levels_of_depth_ ()\n , LOD_num_points_ ()\n {\n \/\/read metadata from file and store in fields\n loadMetadataFromDisk ();\n }\n \n \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n \n OutofcoreOctreeBaseMetadata::~OutofcoreOctreeBaseMetadata ()\n {\n this->serializeMetadataToDisk ();\n }\n\n \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n OutofcoreOctreeBaseMetadata::OutofcoreOctreeBaseMetadata (const OutofcoreOctreeBaseMetadata& orig) \n : OutofcoreAbstractMetadata ()\n , metadata_filename_ (orig.metadata_filename_)\n , outofcore_version_ (orig.outofcore_version_)\n , coordinate_system_ (orig.coordinate_system_)\n , tree_name_ (orig.tree_name_)\n , point_type_ (orig.point_type_)\n , levels_of_depth_ (orig.levels_of_depth_)\n , LOD_num_points_ (orig.LOD_num_points_)\n {\n\n }\n\n \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n int\n OutofcoreOctreeBaseMetadata::getOutofcoreVersion () const\n {\n return (outofcore_version_);\n }\n \n \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n void \n OutofcoreOctreeBaseMetadata::setOutofcoreVersion (const int version)\n {\n outofcore_version_ = version;\n }\n \n \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n boost::filesystem::path\n OutofcoreOctreeBaseMetadata::getMetadataFilename () const\n {\n return (metadata_filename_);\n }\n \n \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n void\n OutofcoreOctreeBaseMetadata::setMetadataFilename (const boost::filesystem::path& path_to_metadata)\n {\n metadata_filename_ = path_to_metadata;\n }\n\n \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n void\n OutofcoreOctreeBaseMetadata::serializeMetadataToDisk ()\n {\n \/\/ Create JSON object\n boost::shared_ptr<cJSON> idx (cJSON_CreateObject (), cJSON_Delete);\n \n cJSON* name = cJSON_CreateString (tree_name_.c_str ());\n cJSON* version = cJSON_CreateNumber ( __PCL_OUTOFCORE_VERSION__ );\n cJSON* pointtype = cJSON_CreateString (point_type_.c_str ());\n cJSON* lod = cJSON_CreateNumber (static_cast<double> (levels_of_depth_));\n\n \/\/ cJSON does not allow 64 bit ints. Have to put the points in a double to\n \/\/ use this api, will allow counts up to 2^52 points to be stored correctly\n \/\/or split into LSB MSB?\n std::vector<double> lodPoints_db;\n lodPoints_db.insert (lodPoints_db.begin (), LOD_num_points_.begin (), LOD_num_points_.end ());\n\n cJSON* numpts = cJSON_CreateDoubleArray ( &(lodPoints_db.front ()), static_cast<int>(lodPoints_db.size ()));\n\n cJSON_AddItemToObject (idx.get (), \"name\", name);\n cJSON_AddItemToObject (idx.get (), \"version\", version);\n cJSON_AddItemToObject (idx.get (), \"pointtype\", pointtype);\n cJSON_AddItemToObject (idx.get (), \"lod\", lod);\n cJSON_AddItemToObject (idx.get (), \"numpts\", numpts);\n cJSON_AddStringToObject(idx.get(), \"coord_system\", coordinate_system_.c_str());\n\n char* idx_txt = cJSON_Print (idx.get ());\n\n std::ofstream f (metadata_filename_.string ().c_str (), std::ios::out | std::ios::trunc);\n f << idx_txt;\n f.close ();\n\n free (idx_txt);\n }\n\n \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n int\n OutofcoreOctreeBaseMetadata::loadMetadataFromDisk ()\n {\n \/\/ Open JSON\n std::vector<char> idx_input;\n boost::uintmax_t len = boost::filesystem::file_size (metadata_filename_);\n idx_input.resize (len + 1);\n\n std::ifstream f (metadata_filename_.string ().c_str (), std::ios::in);\n f.read (&(idx_input.front ()), len);\n idx_input.back () = '\\0';\n\n \/\/ Parse JSON\n boost::shared_ptr<cJSON> idx (cJSON_Parse (&(idx_input.front ())), cJSON_Delete);\n cJSON* name = cJSON_GetObjectItem (idx.get (), \"name\");\n cJSON* version = cJSON_GetObjectItem (idx.get (), \"version\");\n cJSON* pointtype = cJSON_GetObjectItem (idx.get (), \"pointtype\");\n cJSON* lod = cJSON_GetObjectItem (idx.get (), \"lod\");\n cJSON* numpts = cJSON_GetObjectItem (idx.get (), \"numpts\");\n cJSON* coord = cJSON_GetObjectItem (idx.get (), \"coord_system\");\n\n bool parse_failure = false;\n\n \/\/ Validate JSON\n if (!((name) && (version) && (pointtype) && (lod) && (numpts) && (coord)))\n {\n PCL_ERROR ( \"[pcl::outofcore::OutofcoreOctreeBaseMetadata::loadMetadataFromDisk] One of expected metadata fields does not exist in %s\\n\", metadata_filename_.c_str ());\n parse_failure = true;\n }\n if ((name->type != cJSON_String) || (version->type != cJSON_Number) || (pointtype->type != cJSON_String)\n || (lod->type != cJSON_Number) || (numpts->type != cJSON_Array) || (coord->type != cJSON_String))\n {\n PCL_ERROR ( \"[pcl::outofcore::OutofcoreOctreeBaseMetadata::loadMetadataFromDisk] One of metadata fields does not contain its expected type in %s\\n\",metadata_filename_.c_str ());\n parse_failure = true;\n }\n if (version->valuedouble != 2.0 && version->valuedouble != 3.0)\/\/only support version 2.0 and 3.0\n {\n PCL_ERROR ( \"[pcl::outofcore::OutofcoreOctreeBaseMetadata::loadMetadataFromDisk] Outofcore version field (just read version:number = %.1lf) in %s does not match the current supported versions\\n\",metadata_filename_.c_str (), version->valuedouble);\n parse_failure = true;\n }\n if ((lod->valueint + 1) != cJSON_GetArraySize (numpts))\n {\n PCL_ERROR ( \"[pcl::outofcore::OutofcoreOctreeBaseMetadata::loadMetadataFromDisk] lod:num+1=%d+1 (i.e. height of tree) does not match size of LOD array (%d) in %s\\n\", lod->valueint, cJSON_GetArraySize (numpts), metadata_filename_.c_str ());\n parse_failure = true;\n }\n\n if (parse_failure)\n {\n PCL_THROW_EXCEPTION (PCLException, \"[pcl::outofcore::OutofcoreOctreeBaseMetadata::loadMetadataFromDisk] Parse Failure\\n\");\n }\n \n\n \/\/ Get Data\n LOD_num_points_.resize (lod->valueint + 1);\n for (int i = 0; i < (lod->valueint + 1); i++)\n {\n \/\/cJSON doesn't have explicit 64bit int, have to use double, get up to 2^52\n LOD_num_points_[i] = static_cast<boost::uint64_t> (cJSON_GetArrayItem (numpts, i)->valuedouble );\n }\n levels_of_depth_ = lod->valueint;\n coordinate_system_ = coord->valuestring;\n\n \/\/return success\n return (1);\n }\n\n \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n int\n OutofcoreOctreeBaseMetadata::loadMetadataFromDisk (const boost::filesystem::path& path_to_metadata)\n {\n this->setMetadataFilename (path_to_metadata);\n return (this->loadMetadataFromDisk ());\n }\n \n \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n std::string\n OutofcoreOctreeBaseMetadata::getOctreeName ()\n {\n return (this->tree_name_);\n }\n\n \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n void\n OutofcoreOctreeBaseMetadata::setOctreeName (const std::string& name_arg)\n {\n this->tree_name_ = name_arg;\n }\n \n \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n std::string\n OutofcoreOctreeBaseMetadata::getPointType ()\n {\n return (this->point_type_);\n }\n\n \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n \n void\n OutofcoreOctreeBaseMetadata::setPointType (const std::string& point_type_arg)\n {\n this->point_type_ = point_type_arg;\n }\n \n \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n std::vector<boost::uint64_t>&\n OutofcoreOctreeBaseMetadata::getLODPoints ()\n {\n return (LOD_num_points_);\n }\n \n \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n std::vector<boost::uint64_t>\n OutofcoreOctreeBaseMetadata::getLODPoints () const\n {\n return (LOD_num_points_);\n }\n\n \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n boost::uint64_t\n OutofcoreOctreeBaseMetadata::getLODPoints (const boost::uint64_t& depth_index) const\n {\n return (LOD_num_points_[depth_index]);\n }\n\n \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n void\n OutofcoreOctreeBaseMetadata::setLODPoints (const boost::uint64_t& depth)\n {\n LOD_num_points_.clear ();\n LOD_num_points_.resize (depth);\n assert (LOD_num_points_.size () == this->levels_of_depth_+1);\n }\n\n \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n void\n OutofcoreOctreeBaseMetadata::setLODPoints (std::vector<boost::uint64_t>& lod_points_arg)\n {\n assert (this->LOD_num_points_.size () == lod_points_arg.size ());\n \n this->LOD_num_points_ = lod_points_arg;\n }\n \n \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n void\n OutofcoreOctreeBaseMetadata::setLODPoints (const boost::uint64_t& lod_index_arg, const boost::uint64_t& num_points_arg, const bool increment)\n {\n assert (lod_index_arg < LOD_num_points_.size ());\n\n if (increment)\n LOD_num_points_[lod_index_arg] += num_points_arg;\n else\n LOD_num_points_[lod_index_arg] = num_points_arg;\n }\n \n \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n \n void\n OutofcoreOctreeBaseMetadata::setCoordinateSystem (const std::string& coord_sys_arg)\n {\n this->coordinate_system_ = coord_sys_arg;\n }\n \n \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n std::string\n OutofcoreOctreeBaseMetadata::getCoordinateSystem () const\n {\n return (this->coordinate_system_);\n }\n\n \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n void\n OutofcoreOctreeBaseMetadata::setDepth (const boost::uint64_t& depth_arg)\n {\n this->levels_of_depth_ = depth_arg;\n }\n \n boost::uint64_t\n OutofcoreOctreeBaseMetadata::getDepth () const\n {\n return (levels_of_depth_);\n }\n \n \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n \/\/Protected Member Functions\n \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n void\n OutofcoreOctreeBaseMetadata::writeMetadataString (std::vector<char>& buf)\n {\n (void)buf;\n PCL_THROW_EXCEPTION (PCLException, \"Not implemented\\n\");\n }\n\n \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n std::ostream& \n operator<<(std::ostream& os, const OutofcoreOctreeBaseMetadata& metadata_arg)\n {\n (void) metadata_arg;\n return (os);\n }\n\n \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n }\/\/namespace outofcore\n}\/\/namespace pcl\n#undef __PCL_OUTOFCORE_VERSION__\n<commit_msg>Fix OutofcoreOctreeBaseMetadata::serializeMetadataToDisk()<commit_after>\/*\n * Software License Agreement (BSD License)\n *\n * Point Cloud Library (PCL) - www.pointclouds.org\n * Copyright (c) 2010-2012, 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\n#include <pcl\/outofcore\/outofcore_base_data.h>\n\n#include <pcl\/pcl_macros.h>\n#include <pcl\/exceptions.h>\n#include <pcl\/console\/print.h>\n\n#include <fstream>\n\n#define __PCL_OUTOFCORE_VERSION__ 3\n\nnamespace pcl\n{\n namespace outofcore\n {\n OutofcoreOctreeBaseMetadata::OutofcoreOctreeBaseMetadata () \n : metadata_filename_ ()\n , outofcore_version_ ()\n , coordinate_system_ ()\n , tree_name_ ()\n , point_type_ (\"urp\")\n , levels_of_depth_ ()\n , LOD_num_points_ ()\n {\n }\n \n \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n OutofcoreOctreeBaseMetadata::OutofcoreOctreeBaseMetadata (const boost::filesystem::path& metadata_filename) \n : metadata_filename_ (metadata_filename)\n , outofcore_version_ ()\n , coordinate_system_ ()\n , tree_name_ ()\n , point_type_ (\"urp\")\n , levels_of_depth_ ()\n , LOD_num_points_ ()\n {\n \/\/read metadata from file and store in fields\n loadMetadataFromDisk ();\n }\n \n \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n \n OutofcoreOctreeBaseMetadata::~OutofcoreOctreeBaseMetadata ()\n {\n this->serializeMetadataToDisk ();\n }\n\n \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n OutofcoreOctreeBaseMetadata::OutofcoreOctreeBaseMetadata (const OutofcoreOctreeBaseMetadata& orig) \n : OutofcoreAbstractMetadata ()\n , metadata_filename_ (orig.metadata_filename_)\n , outofcore_version_ (orig.outofcore_version_)\n , coordinate_system_ (orig.coordinate_system_)\n , tree_name_ (orig.tree_name_)\n , point_type_ (orig.point_type_)\n , levels_of_depth_ (orig.levels_of_depth_)\n , LOD_num_points_ (orig.LOD_num_points_)\n {\n\n }\n\n \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n int\n OutofcoreOctreeBaseMetadata::getOutofcoreVersion () const\n {\n return (outofcore_version_);\n }\n \n \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n void \n OutofcoreOctreeBaseMetadata::setOutofcoreVersion (const int version)\n {\n outofcore_version_ = version;\n }\n \n \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n boost::filesystem::path\n OutofcoreOctreeBaseMetadata::getMetadataFilename () const\n {\n return (metadata_filename_);\n }\n \n \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n void\n OutofcoreOctreeBaseMetadata::setMetadataFilename (const boost::filesystem::path& path_to_metadata)\n {\n metadata_filename_ = path_to_metadata;\n }\n\n \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n void\n OutofcoreOctreeBaseMetadata::serializeMetadataToDisk ()\n {\n if (LOD_num_points_.empty ())\n return;\n\n \/\/ Create JSON object\n boost::shared_ptr<cJSON> idx (cJSON_CreateObject (), cJSON_Delete);\n \n cJSON* name = cJSON_CreateString (tree_name_.c_str ());\n cJSON* version = cJSON_CreateNumber ( __PCL_OUTOFCORE_VERSION__ );\n cJSON* pointtype = cJSON_CreateString (point_type_.c_str ());\n cJSON* lod = cJSON_CreateNumber (static_cast<double> (levels_of_depth_));\n\n \/\/ cJSON does not allow 64 bit ints. Have to put the points in a double to\n \/\/ use this api, will allow counts up to 2^52 points to be stored correctly\n \/\/or split into LSB MSB?\n std::vector<double> lodPoints_db;\n lodPoints_db.insert (lodPoints_db.begin (), LOD_num_points_.begin (), LOD_num_points_.end ());\n\n cJSON* numpts = cJSON_CreateDoubleArray ( &(lodPoints_db.front ()), static_cast<int>(lodPoints_db.size ()));\n\n cJSON_AddItemToObject (idx.get (), \"name\", name);\n cJSON_AddItemToObject (idx.get (), \"version\", version);\n cJSON_AddItemToObject (idx.get (), \"pointtype\", pointtype);\n cJSON_AddItemToObject (idx.get (), \"lod\", lod);\n cJSON_AddItemToObject (idx.get (), \"numpts\", numpts);\n cJSON_AddStringToObject(idx.get(), \"coord_system\", coordinate_system_.c_str());\n\n char* idx_txt = cJSON_Print (idx.get ());\n\n std::ofstream f (metadata_filename_.string ().c_str (), std::ios::out | std::ios::trunc);\n f << idx_txt;\n f.close ();\n\n free (idx_txt);\n }\n\n \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n int\n OutofcoreOctreeBaseMetadata::loadMetadataFromDisk ()\n {\n \/\/ Open JSON\n std::vector<char> idx_input;\n boost::uintmax_t len = boost::filesystem::file_size (metadata_filename_);\n idx_input.resize (len + 1);\n\n std::ifstream f (metadata_filename_.string ().c_str (), std::ios::in);\n f.read (&(idx_input.front ()), len);\n idx_input.back () = '\\0';\n\n \/\/ Parse JSON\n boost::shared_ptr<cJSON> idx (cJSON_Parse (&(idx_input.front ())), cJSON_Delete);\n cJSON* name = cJSON_GetObjectItem (idx.get (), \"name\");\n cJSON* version = cJSON_GetObjectItem (idx.get (), \"version\");\n cJSON* pointtype = cJSON_GetObjectItem (idx.get (), \"pointtype\");\n cJSON* lod = cJSON_GetObjectItem (idx.get (), \"lod\");\n cJSON* numpts = cJSON_GetObjectItem (idx.get (), \"numpts\");\n cJSON* coord = cJSON_GetObjectItem (idx.get (), \"coord_system\");\n\n bool parse_failure = false;\n\n \/\/ Validate JSON\n if (!((name) && (version) && (pointtype) && (lod) && (numpts) && (coord)))\n {\n PCL_ERROR ( \"[pcl::outofcore::OutofcoreOctreeBaseMetadata::loadMetadataFromDisk] One of expected metadata fields does not exist in %s\\n\", metadata_filename_.c_str ());\n parse_failure = true;\n }\n if ((name->type != cJSON_String) || (version->type != cJSON_Number) || (pointtype->type != cJSON_String)\n || (lod->type != cJSON_Number) || (numpts->type != cJSON_Array) || (coord->type != cJSON_String))\n {\n PCL_ERROR ( \"[pcl::outofcore::OutofcoreOctreeBaseMetadata::loadMetadataFromDisk] One of metadata fields does not contain its expected type in %s\\n\",metadata_filename_.c_str ());\n parse_failure = true;\n }\n if (version->valuedouble != 2.0 && version->valuedouble != 3.0)\/\/only support version 2.0 and 3.0\n {\n PCL_ERROR ( \"[pcl::outofcore::OutofcoreOctreeBaseMetadata::loadMetadataFromDisk] Outofcore version field (just read version:number = %.1lf) in %s does not match the current supported versions\\n\",metadata_filename_.c_str (), version->valuedouble);\n parse_failure = true;\n }\n if ((lod->valueint + 1) != cJSON_GetArraySize (numpts))\n {\n PCL_ERROR ( \"[pcl::outofcore::OutofcoreOctreeBaseMetadata::loadMetadataFromDisk] lod:num+1=%d+1 (i.e. height of tree) does not match size of LOD array (%d) in %s\\n\", lod->valueint, cJSON_GetArraySize (numpts), metadata_filename_.c_str ());\n parse_failure = true;\n }\n\n if (parse_failure)\n {\n PCL_THROW_EXCEPTION (PCLException, \"[pcl::outofcore::OutofcoreOctreeBaseMetadata::loadMetadataFromDisk] Parse Failure\\n\");\n }\n \n\n \/\/ Get Data\n LOD_num_points_.resize (lod->valueint + 1);\n for (int i = 0; i < (lod->valueint + 1); i++)\n {\n \/\/cJSON doesn't have explicit 64bit int, have to use double, get up to 2^52\n LOD_num_points_[i] = static_cast<boost::uint64_t> (cJSON_GetArrayItem (numpts, i)->valuedouble );\n }\n levels_of_depth_ = lod->valueint;\n coordinate_system_ = coord->valuestring;\n\n \/\/return success\n return (1);\n }\n\n \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n int\n OutofcoreOctreeBaseMetadata::loadMetadataFromDisk (const boost::filesystem::path& path_to_metadata)\n {\n this->setMetadataFilename (path_to_metadata);\n return (this->loadMetadataFromDisk ());\n }\n \n \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n std::string\n OutofcoreOctreeBaseMetadata::getOctreeName ()\n {\n return (this->tree_name_);\n }\n\n \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n void\n OutofcoreOctreeBaseMetadata::setOctreeName (const std::string& name_arg)\n {\n this->tree_name_ = name_arg;\n }\n \n \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n std::string\n OutofcoreOctreeBaseMetadata::getPointType ()\n {\n return (this->point_type_);\n }\n\n \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n \n void\n OutofcoreOctreeBaseMetadata::setPointType (const std::string& point_type_arg)\n {\n this->point_type_ = point_type_arg;\n }\n \n \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n std::vector<boost::uint64_t>&\n OutofcoreOctreeBaseMetadata::getLODPoints ()\n {\n return (LOD_num_points_);\n }\n \n \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n std::vector<boost::uint64_t>\n OutofcoreOctreeBaseMetadata::getLODPoints () const\n {\n return (LOD_num_points_);\n }\n\n \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n boost::uint64_t\n OutofcoreOctreeBaseMetadata::getLODPoints (const boost::uint64_t& depth_index) const\n {\n return (LOD_num_points_[depth_index]);\n }\n\n \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n void\n OutofcoreOctreeBaseMetadata::setLODPoints (const boost::uint64_t& depth)\n {\n LOD_num_points_.clear ();\n LOD_num_points_.resize (depth);\n assert (LOD_num_points_.size () == this->levels_of_depth_+1);\n }\n\n \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n void\n OutofcoreOctreeBaseMetadata::setLODPoints (std::vector<boost::uint64_t>& lod_points_arg)\n {\n assert (this->LOD_num_points_.size () == lod_points_arg.size ());\n \n this->LOD_num_points_ = lod_points_arg;\n }\n \n \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n void\n OutofcoreOctreeBaseMetadata::setLODPoints (const boost::uint64_t& lod_index_arg, const boost::uint64_t& num_points_arg, const bool increment)\n {\n assert (lod_index_arg < LOD_num_points_.size ());\n\n if (increment)\n LOD_num_points_[lod_index_arg] += num_points_arg;\n else\n LOD_num_points_[lod_index_arg] = num_points_arg;\n }\n \n \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n \n void\n OutofcoreOctreeBaseMetadata::setCoordinateSystem (const std::string& coord_sys_arg)\n {\n this->coordinate_system_ = coord_sys_arg;\n }\n \n \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n std::string\n OutofcoreOctreeBaseMetadata::getCoordinateSystem () const\n {\n return (this->coordinate_system_);\n }\n\n \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n void\n OutofcoreOctreeBaseMetadata::setDepth (const boost::uint64_t& depth_arg)\n {\n this->levels_of_depth_ = depth_arg;\n }\n \n boost::uint64_t\n OutofcoreOctreeBaseMetadata::getDepth () const\n {\n return (levels_of_depth_);\n }\n \n \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n \/\/Protected Member Functions\n \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n void\n OutofcoreOctreeBaseMetadata::writeMetadataString (std::vector<char>& buf)\n {\n (void)buf;\n PCL_THROW_EXCEPTION (PCLException, \"Not implemented\\n\");\n }\n\n \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n std::ostream& \n operator<<(std::ostream& os, const OutofcoreOctreeBaseMetadata& metadata_arg)\n {\n (void) metadata_arg;\n return (os);\n }\n\n \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n }\/\/namespace outofcore\n}\/\/namespace pcl\n#undef __PCL_OUTOFCORE_VERSION__\n<|endoftext|>"} {"text":"<commit_before>\/* \n *\tinfo≈\n *\tExternal object for Max\/MSP to get information about TTAudioSignals from a Jamoma AudioGraph dsp chain.\n *\tCopyright © 2008 by Timothy Place\n * \n * License: This code is licensed under the terms of the \"New BSD License\"\n * http:\/\/creativecommons.org\/licenses\/BSD\/\n *\/\n\n#include \"maxAudioGraph.h\"\n\n\n\/\/ Data Structure for this object\nstruct Info {\n t_object\t\t\t\tobj;\n\tTTAudioGraphObjectPtr\taudioGraphObject;\t\/\/ we wrap a simple 'thru' audiograph object\n\tTTPtr\t\t\t\t\toutletSmartSignal;\t\/\/ outlet for passing the input to the output, and so we can be pulled\n\tTTPtr\t\t\t\t\toutletSampleRate;\n\tTTPtr\t\t\t\t\toutletVectorSize;\n\tTTPtr\t\t\t\t\toutletNumChannels;\n\tlong\t\t\t\t\taudioSourceOutlet;\t\/\/ number of the outlet connected to our inlet\n\tlong\t\t\t\t\tmaxNumChannels;\t\t\/\/ the number of inlets or outlets, which is an argument at instantiation\n\tlong\t\t\t\t\tnumChannels;\t\t\/\/ the actual number of channels to use, set by the dsp method\n\tlong\t\t\t\t\tvectorSize;\t\t\t\/\/ cached by the DSP method\n\tTTPtr\t\t\t\t\tqelem;\t\t\t\t\/\/ a queue for deferring 'bang' calls\n};\ntypedef Info* InfoPtr;\n\n\n\/\/ Prototypes for methods\nInfoPtr\tInfoNew(SymbolPtr msg, AtomCount argc, AtomPtr argv);\nvoid\tInfoFree(InfoPtr self);\nvoid\tInfoAssist(InfoPtr self, void* b, long msg, long arg, char* dst);\nvoid\tInfoBang(InfoPtr self);\nvoid\tInfoQfn(InfoPtr self);\nTTErr\tInfoConnect(InfoPtr self, TTAudioGraphObjectPtr audioSourceObject, long sourceOutletNumber);\n\n\n\/\/ Globals\nstatic ClassPtr sInfoClass;\n\n\n\/************************************************************************************\/\n\/\/ Main() Function\n\nint TTCLASSWRAPPERMAX_EXPORT main(void)\n{\n\tClassPtr c;\n\n\tTTAudioGraphInit();\t\n\tcommon_symbols_init();\n\n\tc = class_new(\"jcom.info≈\", (method)InfoNew, (method)InfoFree, sizeof(Info), (method)0L, A_GIMME, 0);\n\t\n\tclass_addmethod(c, (method)InfoBang,\t\t\t\"bang\",\t\t\t\t\t0);\n\tclass_addmethod(c, (method)MaxAudioGraphReset,\t\"graph.reset\",\t\tA_CANT, 0);\n\tclass_addmethod(c, (method)InfoConnect,\t\t\t\"audio.connect\",\tA_OBJ, A_LONG, 0);\n\tclass_addmethod(c, (method)MaxAudioGraphSetup,\t\"audio.setup\",\t\tA_CANT, 0);\n\tclass_addmethod(c, (method)MaxAudioGraphDrop,\t\"audio.drop\",\t\tA_CANT, 0);\n\tclass_addmethod(c, (method)MaxAudioGraphObject,\t\"audio.object\",\t\tA_CANT, 0);\n\tclass_addmethod(c, (method)InfoAssist,\t\t\t\"assist\",\t\t\t\tA_CANT, 0); \n class_addmethod(c, (method)object_obex_dumpout,\t\"dumpout\",\t\t\t\tA_CANT, 0); \n\t\n\tclass_register(_sym_box, c);\n\tsInfoClass = c;\n\treturn 0;\n}\n\n\n\/************************************************************************************\/\n\/\/ Object Creation Method\n\nInfoPtr InfoNew(SymbolPtr msg, AtomCount argc, AtomPtr argv)\n{\n InfoPtr\tself;\n\tTTValue\tv;\n\tTTErr\terr;\n \n self = InfoPtr(object_alloc(sInfoClass));\n if (self) {\n \tobject_obex_store((TTPtr)self, _sym_dumpout, (ObjectPtr)outlet_new(self, NULL));\n\t\tself->outletNumChannels = outlet_new((t_pxobject*)self, 0);\n\t\tself->outletVectorSize = outlet_new((t_pxobject*)self, 0);\n\t\tself->outletSampleRate = outlet_new((t_pxobject*)self, 0);\n\t\tself->outletSmartSignal = outlet_new((t_pxobject*)self, \"audio.connect\");\n\t\t\n\t\tself->qelem = qelem_new(self, (method)InfoQfn);\n\t\t\n\t\tv.setSize(2);\n\t\tv.set(0, TT(\"thru\"));\n\t\tv.set(1, TTUInt32(1));\t\/\/ we set it up with 1 inlet, and later modify to 2 inlets if the connection is made\n\t\terr = TTObjectInstantiate(TT(\"audio.object\"), (TTObjectPtr*)&self->audioGraphObject, v);\t\t\n\t\tif (!self->audioGraphObject->getUnitGenerator()) {\n\t\t\tobject_error(SELF, \"cannot load Jamoma DSP object\");\n\t\t\treturn NULL;\n\t\t}\n\n\t\tattr_args_process(self, argc, argv);\n\t}\n\treturn self;\n}\n\n\nvoid InfoFree(InfoPtr self)\n{\n\tTTObjectRelease((TTObjectPtr*)&self->audioGraphObject);\n\tqelem_free(self->qelem);\n}\n\n\n\/************************************************************************************\/\n\/\/ Methods bound to input\/inlets\n\n\/\/ Method for Assistance Messages\nvoid InfoAssist(InfoPtr self, void* b, long msg, long arg, char* dst)\n{\n\tif (msg==1)\t\t\t\/\/ Inlets\n\t\tstrcpy(dst, \"multichannel audio connection and control messages\");\t\t\n\telse if (msg==2) {\t\/\/ Outlets\n\t\tif (arg == 0)\n\t\t\tstrcpy(dst, \"multichannel audio connection, passing the input thru to the output\");\n\t\telse if (arg == 1)\n\t\t\tstrcpy(dst, \"sample rate of the input signal\");\n\t\telse if (arg == 2)\n\t\t\tstrcpy(dst, \"vector size of the input signal\");\n\t\telse if (arg == 3)\n\t\t\tstrcpy(dst, \"number of channels in the input signal\");\n\t\telse if (arg == 4)\n\t\t\tstrcpy(dst, \"dumpout\");\n\t}\n}\n\n\nvoid InfoBang(InfoPtr self)\n{\n\tqelem_set(self->qelem);\n}\n\n\nvoid InfoQfn(InfoPtr self)\n{\n\toutlet_int(self->outletNumChannels, self->audioGraphObject->getOutputNumChannels(self->audioSourceOutlet));\n\toutlet_int(self->outletVectorSize, self->audioGraphObject->getOutputVectorSize(self->audioSourceOutlet));\n\toutlet_int(self->outletSampleRate, self->audioGraphObject->getOutputSampleRate(self->audioSourceOutlet));\n}\n\n\nTTErr InfoConnect(InfoPtr self, TTAudioGraphObjectPtr newAudioSourceObject, long sourceOutletNumber)\n{\n\tTTErr err = MaxAudioGraphConnect(ObjectPtr(self), newAudioSourceObject, sourceOutletNumber);\n\t\n\tself->audioSourceOutlet = sourceOutletNumber;\n\tInfoBang(self);\n\treturn err;\n}\n\n<commit_msg>fixes #776<commit_after>\/* \n *\tinfo≈\n *\tExternal object for Max\/MSP to get information about TTAudioSignals from a Jamoma AudioGraph dsp chain.\n *\tCopyright © 2008 by Timothy Place\n * \n * License: This code is licensed under the terms of the \"New BSD License\"\n * http:\/\/creativecommons.org\/licenses\/BSD\/\n *\/\n\n#include \"maxAudioGraph.h\"\n\n\n\/\/ Data Structure for this object\nstruct Info {\n t_object\t\t\t\tobj;\n\tTTAudioGraphObjectPtr\taudioGraphObject;\t\/\/ we wrap a simple 'thru' audiograph object\n\tTTPtr\t\t\t\t\toutletSmartSignal;\t\/\/ outlet for passing the input to the output, and so we can be pulled\n\tTTPtr\t\t\t\t\tunused;\t\t\t\t\/\/ this is an unused ptr, always set to NULL, to signal the end of the JAG outlets\n\tTTPtr\t\t\t\t\toutletSampleRate;\n\tTTPtr\t\t\t\t\toutletVectorSize;\n\tTTPtr\t\t\t\t\toutletNumChannels;\n\tlong\t\t\t\t\taudioSourceOutlet;\t\/\/ number of the outlet connected to our inlet\n\tlong\t\t\t\t\tmaxNumChannels;\t\t\/\/ the number of inlets or outlets, which is an argument at instantiation\n\tlong\t\t\t\t\tnumChannels;\t\t\/\/ the actual number of channels to use, set by the dsp method\n\tlong\t\t\t\t\tvectorSize;\t\t\t\/\/ cached by the DSP method\n\tTTPtr\t\t\t\t\tqelem;\t\t\t\t\/\/ a queue for deferring 'bang' calls\n};\ntypedef Info* InfoPtr;\n\n\n\/\/ Prototypes for methods\nInfoPtr\tInfoNew(SymbolPtr msg, AtomCount argc, AtomPtr argv);\nvoid\tInfoFree(InfoPtr self);\nvoid\tInfoAssist(InfoPtr self, void* b, long msg, long arg, char* dst);\nvoid\tInfoBang(InfoPtr self);\nvoid\tInfoQfn(InfoPtr self);\nTTErr\tInfoConnect(InfoPtr self, TTAudioGraphObjectPtr audioSourceObject, long sourceOutletNumber);\n\n\n\/\/ Globals\nstatic ClassPtr sInfoClass;\n\n\n\/************************************************************************************\/\n\/\/ Main() Function\n\nint TTCLASSWRAPPERMAX_EXPORT main(void)\n{\n\tClassPtr c;\n\n\tTTAudioGraphInit();\t\n\tcommon_symbols_init();\n\n\tc = class_new(\"jcom.info≈\", (method)InfoNew, (method)InfoFree, sizeof(Info), (method)0L, A_GIMME, 0);\n\t\n\tclass_addmethod(c, (method)InfoBang,\t\t\t\"bang\",\t\t\t\t\t0);\n\tclass_addmethod(c, (method)MaxAudioGraphReset,\t\"graph.reset\",\t\tA_CANT, 0);\n\tclass_addmethod(c, (method)InfoConnect,\t\t\t\"audio.connect\",\tA_OBJ, A_LONG, 0);\n\tclass_addmethod(c, (method)MaxAudioGraphSetup,\t\"audio.setup\",\t\tA_CANT, 0);\n\tclass_addmethod(c, (method)MaxAudioGraphDrop,\t\"audio.drop\",\t\tA_CANT, 0);\n\tclass_addmethod(c, (method)MaxAudioGraphObject,\t\"audio.object\",\t\tA_CANT, 0);\n\tclass_addmethod(c, (method)InfoAssist,\t\t\t\"assist\",\t\t\t\tA_CANT, 0); \n class_addmethod(c, (method)object_obex_dumpout,\t\"dumpout\",\t\t\t\tA_CANT, 0); \n\t\n\tclass_register(_sym_box, c);\n\tsInfoClass = c;\n\treturn 0;\n}\n\n\n\/************************************************************************************\/\n\/\/ Object Creation Method\n\nInfoPtr InfoNew(SymbolPtr msg, AtomCount argc, AtomPtr argv)\n{\n InfoPtr\tself;\n\tTTValue\tv;\n\tTTErr\terr;\n \n self = InfoPtr(object_alloc(sInfoClass));\n if (self) {\n \tobject_obex_store((TTPtr)self, _sym_dumpout, (ObjectPtr)outlet_new(self, NULL));\n\t\tself->outletNumChannels = outlet_new((t_pxobject*)self, 0);\n\t\tself->outletVectorSize = outlet_new((t_pxobject*)self, 0);\n\t\tself->outletSampleRate = outlet_new((t_pxobject*)self, 0);\n\t\tself->outletSmartSignal = outlet_new((t_pxobject*)self, \"audio.connect\");\n\t\t\n\t\tself->qelem = qelem_new(self, (method)InfoQfn);\n\t\t\n\t\tv.setSize(2);\n\t\tv.set(0, TT(\"thru\"));\n\t\tv.set(1, TTUInt32(1));\t\/\/ we set it up with 1 inlet, and later modify to 2 inlets if the connection is made\n\t\terr = TTObjectInstantiate(TT(\"audio.object\"), (TTObjectPtr*)&self->audioGraphObject, v);\t\t\n\t\tif (!self->audioGraphObject->getUnitGenerator()) {\n\t\t\tobject_error(SELF, \"cannot load Jamoma DSP object\");\n\t\t\treturn NULL;\n\t\t}\n\n\t\tattr_args_process(self, argc, argv);\n\t}\n\treturn self;\n}\n\n\nvoid InfoFree(InfoPtr self)\n{\n\tTTObjectRelease((TTObjectPtr*)&self->audioGraphObject);\n\tqelem_free(self->qelem);\n}\n\n\n\/************************************************************************************\/\n\/\/ Methods bound to input\/inlets\n\n\/\/ Method for Assistance Messages\nvoid InfoAssist(InfoPtr self, void* b, long msg, long arg, char* dst)\n{\n\tif (msg==1)\t\t\t\/\/ Inlets\n\t\tstrcpy(dst, \"multichannel audio connection and control messages\");\t\t\n\telse if (msg==2) {\t\/\/ Outlets\n\t\tif (arg == 0)\n\t\t\tstrcpy(dst, \"multichannel audio connection, passing the input thru to the output\");\n\t\telse if (arg == 1)\n\t\t\tstrcpy(dst, \"sample rate of the input signal\");\n\t\telse if (arg == 2)\n\t\t\tstrcpy(dst, \"vector size of the input signal\");\n\t\telse if (arg == 3)\n\t\t\tstrcpy(dst, \"number of channels in the input signal\");\n\t\telse if (arg == 4)\n\t\t\tstrcpy(dst, \"dumpout\");\n\t}\n}\n\n\nvoid InfoBang(InfoPtr self)\n{\n\tqelem_set(self->qelem);\n}\n\n\nvoid InfoQfn(InfoPtr self)\n{\n\toutlet_int(self->outletNumChannels, self->audioGraphObject->getOutputNumChannels(self->audioSourceOutlet));\n\toutlet_int(self->outletVectorSize, self->audioGraphObject->getOutputVectorSize(self->audioSourceOutlet));\n\toutlet_int(self->outletSampleRate, self->audioGraphObject->getOutputSampleRate(self->audioSourceOutlet));\n}\n\n\nTTErr InfoConnect(InfoPtr self, TTAudioGraphObjectPtr newAudioSourceObject, long sourceOutletNumber)\n{\n\tTTErr err = MaxAudioGraphConnect(ObjectPtr(self), newAudioSourceObject, sourceOutletNumber);\n\t\n\tself->audioSourceOutlet = sourceOutletNumber;\n\tInfoBang(self);\n\treturn err;\n}\n\n<|endoftext|>"} {"text":"<commit_before>\/*******************************************************************************\n *\n * Generic implementation of non-relational domains.\n *\n * Author: Arnaud J. Venet (arnaud.j.venet@nasa.gov)\n *\n * Notices:\n *\n * Copyright (c) 2011 United States Government as represented by the\n * Administrator of the National Aeronautics and Space Administration.\n * All Rights Reserved.\n *\n * Disclaimers:\n *\n * No Warranty: THE SUBJECT SOFTWARE IS PROVIDED \"AS IS\" WITHOUT ANY WARRANTY OF\n * ANY KIND, EITHER EXPRESSED, IMPLIED, OR STATUTORY, INCLUDING, BUT NOT LIMITED\n * TO, ANY WARRANTY THAT THE SUBJECT SOFTWARE WILL CONFORM TO SPECIFICATIONS,\n * ANY IMPLIED WARRANTIES OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE,\n * OR FREEDOM FROM INFRINGEMENT, ANY WARRANTY THAT THE SUBJECT SOFTWARE WILL BE\n * ERROR FREE, OR ANY WARRANTY THAT DOCUMENTATION, IF PROVIDED, WILL CONFORM TO\n * THE SUBJECT SOFTWARE. THIS AGREEMENT DOES NOT, IN ANY MANNER, CONSTITUTE AN\n * ENDORSEMENT BY GOVERNMENT AGENCY OR ANY PRIOR RECIPIENT OF ANY RESULTS,\n * RESULTING DESIGNS, HARDWARE, SOFTWARE PRODUCTS OR ANY OTHER APPLICATIONS\n * RESULTING FROM USE OF THE SUBJECT SOFTWARE. FURTHER, GOVERNMENT AGENCY\n * DISCLAIMS ALL WARRANTIES AND LIABILITIES REGARDING THIRD-PARTY SOFTWARE,\n * IF PRESENT IN THE ORIGINAL SOFTWARE, AND DISTRIBUTES IT \"AS IS.\"\n *\n * Waiver and Indemnity: RECIPIENT AGREES TO WAIVE ANY AND ALL CLAIMS AGAINST\n * THE UNITED STATES GOVERNMENT, ITS CONTRACTORS AND SUBCONTRACTORS, AS WELL\n * AS ANY PRIOR RECIPIENT. IF RECIPIENT'S USE OF THE SUBJECT SOFTWARE RESULTS\n * IN ANY LIABILITIES, DEMANDS, DAMAGES, EXPENSES OR LOSSES ARISING FROM SUCH\n * USE, INCLUDING ANY DAMAGES FROM PRODUCTS BASED ON, OR RESULTING FROM,\n * RECIPIENT'S USE OF THE SUBJECT SOFTWARE, RECIPIENT SHALL INDEMNIFY AND HOLD\n * HARMLESS THE UNITED STATES GOVERNMENT, ITS CONTRACTORS AND SUBCONTRACTORS,\n * AS WELL AS ANY PRIOR RECIPIENT, TO THE EXTENT PERMITTED BY LAW.\n * RECIPIENT'S SOLE REMEDY FOR ANY SUCH MATTER SHALL BE THE IMMEDIATE,\n * UNILATERAL TERMINATION OF THIS AGREEMENT.\n *\n ******************************************************************************\/\n\n#pragma once\n\n#include <crab\/domains\/patricia_trees.hpp>\n#include <crab\/support\/debug.hpp>\n\n#include <boost\/optional.hpp>\n\n#include <set>\n#include <vector>\n\nnamespace ikos {\n\ntemplate <typename Key, typename Value> class separate_domain {\n\nprivate:\n using patricia_tree_t = patricia_tree<Key, Value>;\n using unary_op_t = typename patricia_tree_t::unary_op_t;\n using binary_op_t = typename patricia_tree_t::binary_op_t;\n using partial_order_t = typename patricia_tree_t::partial_order_t;\n\npublic:\n using separate_domain_t = separate_domain<Key, Value>;\n using iterator = typename patricia_tree_t::iterator;\n using key_type = Key;\n using value_type = Value;\n\nprivate:\n bool _is_bottom;\n patricia_tree_t _tree;\n\npublic:\n class join_op : public binary_op_t {\n std::pair<bool, boost::optional<Value>> apply(Value x, Value y) {\n Value z = x.operator|(y);\n if (z.is_top()) {\n return {false, boost::optional<Value>()};\n } else {\n return {false, boost::optional<Value>(z)};\n }\n };\n\n bool default_is_absorbing() { return true; }\n }; \/\/ class join_op\n\n class widening_op : public binary_op_t {\n std::pair<bool, boost::optional<Value>> apply(Value x, Value y) {\n Value z = x.operator||(y);\n if (z.is_top()) {\n return {false, boost::optional<Value>()};\n } else {\n return {false, boost::optional<Value>(z)};\n }\n };\n\n bool default_is_absorbing() { return true; }\n\n }; \/\/ class widening_op\n\n template <typename Thresholds>\n class widening_thresholds_op : public binary_op_t {\n const Thresholds &m_ts;\n\n public:\n widening_thresholds_op(const Thresholds &ts) : m_ts(ts) {}\n\n std::pair<bool, boost::optional<Value>> apply(Value x, Value y) {\n Value z = x.widening_thresholds(y, m_ts);\n if (z.is_top()) {\n return {false, boost::optional<Value>()};\n } else {\n return {false, boost::optional<Value>(z)};\n }\n };\n\n bool default_is_absorbing() { return true; }\n\n }; \/\/ class widening_thresholds_op\n\n class meet_op : public binary_op_t {\n std::pair<bool, boost::optional<Value>> apply(Value x, Value y) {\n Value z = x.operator&(y);\n if (z.is_bottom()) {\n return {true, boost::optional<Value>()};\n } else {\n return {false, boost::optional<Value>(z)};\n }\n };\n\n bool default_is_absorbing() { return false; }\n\n }; \/\/ class meet_op\n\n class narrowing_op : public binary_op_t {\n std::pair<bool, boost::optional<Value>> apply(Value x, Value y) {\n Value z = x.operator&&(y);\n if (z.is_bottom()) {\n return {true, boost::optional<Value>()};\n } else {\n return {false, boost::optional<Value>(z)};\n }\n };\n\n bool default_is_absorbing() { return false; }\n\n }; \/\/ class narrowing_op\n\n class domain_po : public partial_order_t {\n bool leq(Value x, Value y) { return x.operator<=(y); }\n\n bool default_is_top() { return true; }\n\n }; \/\/ class domain_po\n\npublic:\n static separate_domain_t top() { return separate_domain_t(); }\n\n static separate_domain_t bottom() { return separate_domain_t(false); }\n\nprivate:\n static patricia_tree_t apply_operation(binary_op_t &o, patricia_tree_t t1,\n const patricia_tree_t &t2,\n bool &is_bottom) {\n is_bottom = t1.merge_with(t2, o);\n return t1;\n }\n\n separate_domain(patricia_tree_t t) : _is_bottom(false), _tree(t) {}\n\n separate_domain(bool b) : _is_bottom(!b) {}\n\npublic:\n separate_domain() : _is_bottom(false) {}\n\n separate_domain(const separate_domain_t &e)\n : _is_bottom(e._is_bottom), _tree(e._tree) {}\n\n separate_domain(const separate_domain_t &&e)\n : _is_bottom(e._is_bottom), _tree(std::move(e._tree)) {}\n\n separate_domain_t &operator=(separate_domain_t e) {\n this->_is_bottom = e._is_bottom;\n this->_tree = e._tree;\n return *this;\n }\n\n iterator begin() const {\n if (this->is_bottom()) {\n CRAB_ERROR(\"Separate domain: trying to invoke iterator on bottom\");\n } else {\n return this->_tree.begin();\n }\n }\n\n iterator end() const {\n if (this->is_bottom()) {\n CRAB_ERROR(\"Separate domain: trying to invoke iterator on bottom\");\n } else {\n return this->_tree.end();\n }\n }\n\n bool is_bottom() const { return this->_is_bottom; }\n\n bool is_top() const {\n return (!this->is_bottom() && this->_tree.size() == 0);\n }\n\n bool operator<=(const separate_domain_t &e) const {\n if (this->is_bottom()) {\n return true;\n } else if (e.is_bottom()) {\n return false;\n } else {\n domain_po po;\n return this->_tree.leq(e._tree, po);\n }\n }\n\n bool operator==(const separate_domain_t &e) const {\n return (this->operator<=(e) && e.operator<=(*this));\n }\n\n \/\/ Join\n separate_domain_t operator|(const separate_domain_t &e) const {\n if (this->is_bottom()) {\n return e;\n } else if (e.is_bottom()) {\n return *this;\n } else {\n join_op o;\n bool is_bottom;\n patricia_tree_t res = apply_operation(o, this->_tree, e._tree, is_bottom);\n return separate_domain_t(std::move(res));\n }\n }\n\n \/\/ Meet\n separate_domain_t operator&(const separate_domain_t &e) const {\n if (this->is_bottom() || e.is_bottom()) {\n return this->bottom();\n } else {\n meet_op o;\n bool is_bottom;\n patricia_tree_t res = apply_operation(o, this->_tree, e._tree, is_bottom);\n if (is_bottom) {\n return this->bottom();\n } else {\n return separate_domain_t(std::move(res));\n }\n }\n }\n\n \/\/ Widening\n separate_domain_t operator||(const separate_domain_t &e) const {\n if (this->is_bottom()) {\n return e;\n } else if (e.is_bottom()) {\n return *this;\n } else {\n widening_op o;\n bool is_bottom;\n patricia_tree_t res = apply_operation(o, this->_tree, e._tree, is_bottom);\n return separate_domain_t(std::move(res));\n }\n }\n\n \/\/ Widening with thresholds\n template <typename Thresholds>\n separate_domain_t widening_thresholds(const separate_domain_t &e,\n const Thresholds &ts) const {\n if (this->is_bottom()) {\n return e;\n } else if (e.is_bottom()) {\n return *this;\n } else {\n widening_thresholds_op<Thresholds> o(ts);\n bool is_bottom;\n patricia_tree_t res = apply_operation(o, this->_tree, e._tree, is_bottom);\n return separate_domain_t(std::move(res));\n }\n }\n\n \/\/ Narrowing\n separate_domain_t operator&&(const separate_domain_t &e) const {\n if (this->is_bottom() || e.is_bottom()) {\n return separate_domain_t(false);\n } else {\n narrowing_op o;\n bool is_bottom;\n patricia_tree_t res = apply_operation(o, this->_tree, e._tree, is_bottom);\n if (is_bottom) {\n return this->bottom();\n } else {\n return separate_domain_t(std::move(res));\n }\n }\n }\n\n void set(Key k, Value v) {\n if (!this->is_bottom()) {\n if (v.is_bottom()) {\n this->_is_bottom = true;\n this->_tree = patricia_tree_t();\n } else if (v.is_top()) {\n this->_tree.remove(k);\n } else {\n this->_tree.insert(k, v);\n }\n }\n }\n\n void set_to_bottom() {\n this->_is_bottom = true;\n this->_tree = patricia_tree_t();\n }\n\n separate_domain_t &operator-=(const Key &k) {\n if (!this->is_bottom()) {\n this->_tree.remove(k);\n }\n return *this;\n }\n\n Value operator[](const Key &k) const {\n if (this->is_bottom()) {\n return Value::bottom();\n } else {\n boost::optional<Value> v = this->_tree.lookup(k);\n if (v) {\n return *v;\n } else {\n return Value::top();\n }\n }\n }\n\n std::size_t size() const {\n if (is_bottom()) {\n return 0;\n } else if (is_top()) {\n CRAB_ERROR(\"separate_domains::size() is undefined if top\");\n } else {\n return this->_tree.size();\n }\n }\n\n void write(crab::crab_os &o) const {\n if (this->is_bottom()) {\n o << \"_|_\";\n } else {\n o << \"{\";\n for (typename patricia_tree_t::iterator it = this->_tree.begin();\n it != this->_tree.end();) {\n Key k = it->first;\n k.write(o);\n o << \" -> \";\n Value v = it->second;\n v.write(o);\n ++it;\n if (it != this->_tree.end()) {\n o << \"; \";\n }\n }\n o << \"}\";\n }\n }\n\n \/\/ Assume that from does not have duplicates.\n void rename(const std::vector<Key> &from, const std::vector<Key> &to) {\n if (is_top() || is_bottom()) {\n \/\/ nothing to rename\n return;\n }\n if (from.size() != to.size()) {\n CRAB_ERROR(\n \"separate_domain::rename with input vectors of different sizes\");\n }\n\n if (::crab::CrabSanityCheckFlag) {\n std::set<Key> s1, s2;\n s1.insert(from.begin(), from.end());\n if (s1.size() != from.size()) {\n CRAB_ERROR(\"separate_domain::rename expects no duplicates\");\n }\n s2.insert(to.begin(), to.end());\n if (s2.size() != to.size()) {\n CRAB_ERROR(\"separate_domain::rename expects no duplicates\");\n }\n }\n\n for (unsigned i = 0, sz = from.size(); i < sz; ++i) {\n Key k = from[i];\n Key new_k = to[i];\n if (k == new_k) { \/\/ nothing to rename\n continue;\n }\n if (::crab::CrabSanityCheckFlag) {\n if (_tree.lookup(new_k)) {\n CRAB_ERROR(\"separate_domain::rename assumes that \", new_k,\n \" does not exist in \", *this);\n }\n }\n if (boost::optional<Value> k_val_opt = _tree.lookup(k)) {\n if (!(*k_val_opt).is_top()) {\n _tree.insert(new_k, *k_val_opt);\n }\n _tree.remove(k);\n }\n }\n }\n\n friend crab::crab_os &operator<<(crab::crab_os &o,\n const separate_domain<Key, Value> &d) {\n d.write(o);\n return o;\n }\n}; \/\/ class separate_domain\n\n} \/\/ namespace ikos\n<commit_msg>refactor(separate): minor refactoring<commit_after>\/*******************************************************************************\n *\n * Generic implementation of non-relational domains.\n *\n * Author: Arnaud J. Venet (arnaud.j.venet@nasa.gov)\n *\n * Notices:\n *\n * Copyright (c) 2011 United States Government as represented by the\n * Administrator of the National Aeronautics and Space Administration.\n * All Rights Reserved.\n *\n * Disclaimers:\n *\n * No Warranty: THE SUBJECT SOFTWARE IS PROVIDED \"AS IS\" WITHOUT ANY WARRANTY OF\n * ANY KIND, EITHER EXPRESSED, IMPLIED, OR STATUTORY, INCLUDING, BUT NOT LIMITED\n * TO, ANY WARRANTY THAT THE SUBJECT SOFTWARE WILL CONFORM TO SPECIFICATIONS,\n * ANY IMPLIED WARRANTIES OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE,\n * OR FREEDOM FROM INFRINGEMENT, ANY WARRANTY THAT THE SUBJECT SOFTWARE WILL BE\n * ERROR FREE, OR ANY WARRANTY THAT DOCUMENTATION, IF PROVIDED, WILL CONFORM TO\n * THE SUBJECT SOFTWARE. THIS AGREEMENT DOES NOT, IN ANY MANNER, CONSTITUTE AN\n * ENDORSEMENT BY GOVERNMENT AGENCY OR ANY PRIOR RECIPIENT OF ANY RESULTS,\n * RESULTING DESIGNS, HARDWARE, SOFTWARE PRODUCTS OR ANY OTHER APPLICATIONS\n * RESULTING FROM USE OF THE SUBJECT SOFTWARE. FURTHER, GOVERNMENT AGENCY\n * DISCLAIMS ALL WARRANTIES AND LIABILITIES REGARDING THIRD-PARTY SOFTWARE,\n * IF PRESENT IN THE ORIGINAL SOFTWARE, AND DISTRIBUTES IT \"AS IS.\"\n *\n * Waiver and Indemnity: RECIPIENT AGREES TO WAIVE ANY AND ALL CLAIMS AGAINST\n * THE UNITED STATES GOVERNMENT, ITS CONTRACTORS AND SUBCONTRACTORS, AS WELL\n * AS ANY PRIOR RECIPIENT. IF RECIPIENT'S USE OF THE SUBJECT SOFTWARE RESULTS\n * IN ANY LIABILITIES, DEMANDS, DAMAGES, EXPENSES OR LOSSES ARISING FROM SUCH\n * USE, INCLUDING ANY DAMAGES FROM PRODUCTS BASED ON, OR RESULTING FROM,\n * RECIPIENT'S USE OF THE SUBJECT SOFTWARE, RECIPIENT SHALL INDEMNIFY AND HOLD\n * HARMLESS THE UNITED STATES GOVERNMENT, ITS CONTRACTORS AND SUBCONTRACTORS,\n * AS WELL AS ANY PRIOR RECIPIENT, TO THE EXTENT PERMITTED BY LAW.\n * RECIPIENT'S SOLE REMEDY FOR ANY SUCH MATTER SHALL BE THE IMMEDIATE,\n * UNILATERAL TERMINATION OF THIS AGREEMENT.\n *\n ******************************************************************************\/\n\n#pragma once\n\n#include <crab\/domains\/patricia_trees.hpp>\n#include <crab\/support\/debug.hpp>\n\n#include <boost\/optional.hpp>\n\n#include <set>\n#include <vector>\n\nnamespace ikos {\n\ntemplate <typename Key, typename Value> class separate_domain {\n\nprivate:\n using patricia_tree_t = patricia_tree<Key, Value>;\n using unary_op_t = typename patricia_tree_t::unary_op_t;\n using binary_op_t = typename patricia_tree_t::binary_op_t;\n using partial_order_t = typename patricia_tree_t::partial_order_t;\n\npublic:\n using separate_domain_t = separate_domain<Key, Value>;\n using iterator = typename patricia_tree_t::iterator;\n using key_type = Key;\n using value_type = Value;\n\nprivate:\n bool _is_bottom;\n patricia_tree_t _tree;\n\npublic:\n class join_op : public binary_op_t {\n std::pair<bool, boost::optional<Value>> apply(Value x, Value y) {\n Value z = x.operator|(y);\n if (z.is_top()) {\n return {false, boost::optional<Value>()};\n } else {\n return {false, boost::optional<Value>(z)};\n }\n };\n\n bool default_is_absorbing() { return true; }\n }; \/\/ class join_op\n\n class widening_op : public binary_op_t {\n std::pair<bool, boost::optional<Value>> apply(Value x, Value y) {\n Value z = x.operator||(y);\n if (z.is_top()) {\n return {false, boost::optional<Value>()};\n } else {\n return {false, boost::optional<Value>(z)};\n }\n };\n\n bool default_is_absorbing() { return true; }\n\n }; \/\/ class widening_op\n\n template <typename Thresholds>\n class widening_thresholds_op : public binary_op_t {\n const Thresholds &m_ts;\n\n public:\n widening_thresholds_op(const Thresholds &ts) : m_ts(ts) {}\n\n std::pair<bool, boost::optional<Value>> apply(Value x, Value y) {\n Value z = x.widening_thresholds(y, m_ts);\n if (z.is_top()) {\n return {false, boost::optional<Value>()};\n } else {\n return {false, boost::optional<Value>(z)};\n }\n };\n\n bool default_is_absorbing() { return true; }\n\n }; \/\/ class widening_thresholds_op\n\n class meet_op : public binary_op_t {\n std::pair<bool, boost::optional<Value>> apply(Value x, Value y) {\n Value z = x.operator&(y);\n if (z.is_bottom()) {\n return {true, boost::optional<Value>()};\n } else {\n return {false, boost::optional<Value>(z)};\n }\n };\n\n bool default_is_absorbing() { return false; }\n\n }; \/\/ class meet_op\n\n class narrowing_op : public binary_op_t {\n std::pair<bool, boost::optional<Value>> apply(Value x, Value y) {\n Value z = x.operator&&(y);\n if (z.is_bottom()) {\n return {true, boost::optional<Value>()};\n } else {\n return {false, boost::optional<Value>(z)};\n }\n };\n\n bool default_is_absorbing() { return false; }\n\n }; \/\/ class narrowing_op\n\n class domain_po : public partial_order_t {\n bool leq(Value x, Value y) { return x.operator<=(y); }\n\n bool default_is_top() { return true; }\n\n }; \/\/ class domain_po\n\npublic:\n static separate_domain_t top() { return separate_domain_t(); }\n\n static separate_domain_t bottom() { return separate_domain_t(false); }\n\nprivate:\n static patricia_tree_t apply_operation(binary_op_t &o, patricia_tree_t t1,\n const patricia_tree_t &t2,\n bool &is_bottom) {\n is_bottom = t1.merge_with(t2, o);\n return t1;\n }\n\n separate_domain(patricia_tree_t t) : _is_bottom(false), _tree(t) {}\n\n separate_domain(bool b) : _is_bottom(!b) {}\n\npublic:\n separate_domain() : _is_bottom(false) {}\n\n separate_domain(const separate_domain_t &e)\n : _is_bottom(e._is_bottom), _tree(e._tree) {}\n\n separate_domain(const separate_domain_t &&e)\n : _is_bottom(e._is_bottom), _tree(std::move(e._tree)) {}\n\n separate_domain_t &operator=(separate_domain_t e) {\n this->_is_bottom = e._is_bottom;\n this->_tree = e._tree;\n return *this;\n }\n\n iterator begin() const {\n if (this->is_bottom()) {\n CRAB_ERROR(\"Separate domain: trying to invoke iterator on bottom\");\n } else {\n return this->_tree.begin();\n }\n }\n\n iterator end() const {\n if (this->is_bottom()) {\n CRAB_ERROR(\"Separate domain: trying to invoke iterator on bottom\");\n } else {\n return this->_tree.end();\n }\n }\n\n bool is_bottom() const { return this->_is_bottom; }\n\n bool is_top() const {\n return (!this->is_bottom() && this->_tree.size() == 0);\n }\n\n bool operator<=(const separate_domain_t &e) const {\n if (this->is_bottom()) {\n return true;\n } else if (e.is_bottom()) {\n return false;\n } else {\n domain_po po;\n return this->_tree.leq(e._tree, po);\n }\n }\n\n bool operator==(const separate_domain_t &e) const {\n return (this->operator<=(e) && e.operator<=(*this));\n }\n\n \/\/ Join\n separate_domain_t operator|(const separate_domain_t &e) const {\n if (this->is_bottom()) {\n return e;\n } else if (e.is_bottom()) {\n return *this;\n } else {\n join_op o;\n bool is_bottom;\n patricia_tree_t res = apply_operation(o, this->_tree, e._tree, is_bottom);\n return separate_domain_t(std::move(res));\n }\n }\n\n \/\/ Meet\n separate_domain_t operator&(const separate_domain_t &e) const {\n if (this->is_bottom() || e.is_bottom()) {\n return this->bottom();\n } else {\n meet_op o;\n bool is_bottom;\n patricia_tree_t res = apply_operation(o, this->_tree, e._tree, is_bottom);\n if (is_bottom) {\n return this->bottom();\n } else {\n return separate_domain_t(std::move(res));\n }\n }\n }\n\n \/\/ Widening\n separate_domain_t operator||(const separate_domain_t &e) const {\n if (this->is_bottom()) {\n return e;\n } else if (e.is_bottom()) {\n return *this;\n } else {\n widening_op o;\n bool is_bottom;\n patricia_tree_t res = apply_operation(o, this->_tree, e._tree, is_bottom);\n return separate_domain_t(std::move(res));\n }\n }\n\n \/\/ Widening with thresholds\n template <typename Thresholds>\n separate_domain_t widening_thresholds(const separate_domain_t &e,\n const Thresholds &ts) const {\n if (this->is_bottom()) {\n return e;\n } else if (e.is_bottom()) {\n return *this;\n } else {\n widening_thresholds_op<Thresholds> o(ts);\n bool is_bottom;\n patricia_tree_t res = apply_operation(o, this->_tree, e._tree, is_bottom);\n return separate_domain_t(std::move(res));\n }\n }\n\n \/\/ Narrowing\n separate_domain_t operator&&(const separate_domain_t &e) const {\n if (this->is_bottom() || e.is_bottom()) {\n return separate_domain_t(false);\n } else {\n narrowing_op o;\n bool is_bottom;\n patricia_tree_t res = apply_operation(o, this->_tree, e._tree, is_bottom);\n if (is_bottom) {\n return this->bottom();\n } else {\n return separate_domain_t(std::move(res));\n }\n }\n }\n\n void set(Key k, Value v) {\n if (!this->is_bottom()) {\n if (v.is_bottom()) {\n\tset_to_bottom();\n } else if (v.is_top()) {\n this->_tree.remove(k);\n } else {\n this->_tree.insert(k, v);\n }\n }\n }\n\n void set_to_bottom() {\n this->_is_bottom = true;\n this->_tree = patricia_tree_t();\n }\n\n separate_domain_t &operator-=(const Key &k) {\n if (!this->is_bottom()) {\n this->_tree.remove(k);\n }\n return *this;\n }\n\n Value operator[](const Key &k) const {\n if (this->is_bottom()) {\n return Value::bottom();\n } else {\n boost::optional<Value> v = this->_tree.lookup(k);\n if (v) {\n return *v;\n } else {\n return Value::top();\n }\n }\n }\n\n std::size_t size() const {\n if (is_bottom()) {\n return 0;\n } else if (is_top()) {\n CRAB_ERROR(\"separate_domains::size() is undefined if top\");\n } else {\n return this->_tree.size();\n }\n }\n\n void write(crab::crab_os &o) const {\n if (this->is_bottom()) {\n o << \"_|_\";\n } else {\n o << \"{\";\n for (typename patricia_tree_t::iterator it = this->_tree.begin();\n it != this->_tree.end();) {\n Key k = it->first;\n k.write(o);\n o << \" -> \";\n Value v = it->second;\n v.write(o);\n ++it;\n if (it != this->_tree.end()) {\n o << \"; \";\n }\n }\n o << \"}\";\n }\n }\n\n \/\/ Assume that from does not have duplicates.\n void rename(const std::vector<Key> &from, const std::vector<Key> &to) {\n if (is_top() || is_bottom()) {\n \/\/ nothing to rename\n return;\n }\n if (from.size() != to.size()) {\n CRAB_ERROR(\n \"separate_domain::rename with input vectors of different sizes\");\n }\n\n if (::crab::CrabSanityCheckFlag) {\n std::set<Key> s1, s2;\n s1.insert(from.begin(), from.end());\n if (s1.size() != from.size()) {\n CRAB_ERROR(\"separate_domain::rename expects no duplicates\");\n }\n s2.insert(to.begin(), to.end());\n if (s2.size() != to.size()) {\n CRAB_ERROR(\"separate_domain::rename expects no duplicates\");\n }\n }\n\n for (unsigned i = 0, sz = from.size(); i < sz; ++i) {\n Key k = from[i];\n Key new_k = to[i];\n if (k == new_k) { \/\/ nothing to rename\n continue;\n }\n if (::crab::CrabSanityCheckFlag) {\n if (_tree.lookup(new_k)) {\n CRAB_ERROR(\"separate_domain::rename assumes that \", new_k,\n \" does not exist in \", *this);\n }\n }\n if (boost::optional<Value> k_val_opt = _tree.lookup(k)) {\n if (!(*k_val_opt).is_top()) {\n _tree.insert(new_k, *k_val_opt);\n }\n _tree.remove(k);\n }\n }\n }\n\n friend crab::crab_os &operator<<(crab::crab_os &o,\n const separate_domain<Key, Value> &d) {\n d.write(o);\n return o;\n }\n}; \/\/ class separate_domain\n\n} \/\/ namespace ikos\n<|endoftext|>"} {"text":"<commit_before>\/**\r\n * \\file\r\n * \\brief Scheduler 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-08-28\r\n *\/\r\n\r\n#ifndef INCLUDE_DISTORTOS_SCHEDULER_SCHEDULER_HPP_\r\n#define INCLUDE_DISTORTOS_SCHEDULER_SCHEDULER_HPP_\r\n\r\n#include \"distortos\/scheduler\/ThreadControlBlockList.hpp\"\r\n#include \"distortos\/scheduler\/SoftwareTimerControlBlockSupervisor.hpp\"\r\n\r\n#include <chrono>\r\n\r\nnamespace distortos\r\n{\r\n\r\n\/\/\/ scheduler namespace has symbols related to scheduling\r\nnamespace scheduler\r\n{\r\n\r\ntemplate<typename Function, typename... Args>\r\nclass Thread;\r\nclass MainThreadControlBlock;\r\n\r\n\/\/\/ Scheduler class is a system's scheduler\r\nclass Scheduler\r\n{\r\npublic:\r\n\r\n\t\/\/\/ generic iterator for all variants of ThreadControlBlockList\r\n\tusing Iterator = containers::SortedContainerBase<std::list<ThreadControlBlockListValueType>>::iterator;\r\n\r\n\t\/**\r\n\t * \\brief Scheduler's constructor\r\n\t *\r\n\t * \\attention Priority of main thread must be higher than priority of idle thread.\r\n\t *\r\n\t * \\param [in] mainThreadControlBlock is a reference to main thread\r\n\t * \\param [in] idleThread is a reference to idle thread\r\n\t *\/\r\n\r\n\tScheduler(MainThreadControlBlock& mainThreadControlBlock, Thread<void (&)()>& idleThread);\r\n\r\n\t\/**\r\n\t * \\brief Adds new ThreadControlBlock to scheduler.\r\n\t *\r\n\t * ThreadControlBlock's state is changed to \"runnable\".\r\n\t *\r\n\t * \\param [in] thread_control_block is a reference to added ThreadControlBlock object\r\n\t *\/\r\n\r\n\tvoid add(ThreadControlBlock& thread_control_block);\r\n\r\n\t\/**\r\n\t * \\brief Blocks current thread, transferring it to provided container.\r\n\t *\r\n\t * \\param [in] container is a reference to destination container to which the thread will be transferred\r\n\t *\/\r\n\r\n\tvoid block(ThreadControlBlockList& container);\r\n\r\n\t\/**\r\n\t * \\brief Blocks thread, transferring it to provided container.\r\n\t *\r\n\t * The thread must be in \"runnable\" state - trying to block thread in other state is an error.\r\n\t *\r\n\t * \\param [in] container is a reference to destination container to which the thread will be transferred\r\n\t * \\param [in] iterator is the iterator to the thread that will be blocked\r\n\t *\r\n\t * \\return 0 on success, error code otherwise:\r\n\t * - EINVAL - provided thread is not in \"runnable\" state;\r\n\t *\/\r\n\r\n\tint block(ThreadControlBlockList& container, Iterator iterator);\r\n\r\n\t\/**\r\n\t * \\return reference to currently active ThreadControlBlock\r\n\t *\/\r\n\r\n\tThreadControlBlock& getCurrentThreadControlBlock() const { return *currentThreadControlBlock_; }\r\n\r\n\t\/**\r\n\t * \\return reference to internal SoftwareTimerControlBlockSupervisor object\r\n\t *\/\r\n\r\n\tSoftwareTimerControlBlockSupervisor& getSoftwareTimerSupervisor()\r\n\t{\r\n\t\treturn softwareTimerControlBlockSupervisor_;\r\n\t}\r\n\r\n\t\/**\r\n\t * \\return const reference to internal SoftwareTimerControlBlockSupervisor object\r\n\t *\/\r\n\r\n\tconst SoftwareTimerControlBlockSupervisor& getSoftwareTimerSupervisor() const\r\n\t{\r\n\t\treturn softwareTimerControlBlockSupervisor_;\r\n\t}\r\n\r\n\t\/**\r\n\t * \\return current value of tick count\r\n\t *\/\r\n\r\n\tuint64_t getTickCount() const;\r\n\r\n\t\/**\r\n\t * \\brief Removes current thread from Scheduler's control.\r\n\t *\r\n\t * Thread's state is changed to \"terminated\" and it's terminationHook() is called.\r\n\t *\r\n\t * \\note This function can be used only after thread's function returns an all cleanup is done.\r\n\t *\r\n\t * \\return 0 on success, error code otherwise:\r\n\t * - EINVAL - provided thread is not in \"runnable\" state and cannot be removed\/terminated;\r\n\t *\/\r\n\r\n\tint remove();\r\n\r\n\t\/**\r\n\t * \\brief Resumes suspended thread.\r\n\t *\r\n\t * The thread must be in \"suspended\" state - trying to resume thread that is not suspended is an error.\r\n\t *\r\n\t * \\param [in] iterator is the iterator to the thread that will be resumed\r\n\t *\r\n\t * \\return 0 on success, error code otherwise:\r\n\t * - EINVAL - provided thread is not in \"suspended\" state;\r\n\t *\/\r\n\r\n\tint resume(Iterator iterator);\r\n\r\n\t\/**\r\n\t * \\brief Makes the calling (current) thread sleep for at least given duration.\r\n\t *\r\n\t * Current thread's state is changed to \"sleeping\".\r\n\t *\r\n\t * \\note To fulfill the \"at least\" requirement, one additional tick is always added to the sleep duration.\r\n\t *\r\n\t * \\param [in] duration is the duration after which the thread will be woken\r\n\t *\/\r\n\r\n\tvoid sleepFor(TickClock::duration duration);\r\n\r\n\t\/**\r\n\t * \\brief Makes the calling (current) thread sleep until some time point is reached.\r\n\t *\r\n\t * Current thread's state is changed to \"sleeping\".\r\n\t *\r\n\t * \\param [in] time_point is the time point at which the thread will be woken\r\n\t *\/\r\n\r\n\tvoid sleepUntil(TickClock::time_point time_point);\r\n\r\n\t\/**\r\n\t * \\brief Suspends current thread.\r\n\t *\/\r\n\r\n\tvoid suspend();\r\n\r\n\t\/**\r\n\t * \\brief Suspends thread.\r\n\t *\r\n\t * The thread must be in \"runnable\" state - trying to suspend thread in other state is an error.\r\n\t *\r\n\t * \\param [in] iterator is the iterator to the thread that will be suspended\r\n\t *\r\n\t * \\return 0 on success, error code otherwise:\r\n\t * - EINVAL - provided thread is not in \"runnable\" state;\r\n\t *\/\r\n\r\n\tint suspend(Iterator iterator);\r\n\r\n\t\/**\r\n\t * \\brief Called by architecture-specific code to do final context switch.\r\n\t *\r\n\t * Current task is suspended and the next available task is started.\r\n\t *\r\n\t * \\param [in] stack_pointer is the current value of current thread's stack pointer\r\n\t *\r\n\t * \\return new thread's stack pointer\r\n\t *\/\r\n\r\n\tvoid* switchContext(void* stack_pointer);\r\n\r\n\t\/**\r\n\t * \\brief Handler of \"tick\" interrupt.\r\n\t *\r\n\t * \\note this must not be called by user code\r\n\t *\r\n\t * \\return true if context switch is required, false otherwise\r\n\t *\/\r\n\r\n\tbool tickInterruptHandler();\r\n\r\n\t\/**\r\n\t * \\brief Unblocks provided thread, transferring it from provided container to \"runnable\" container.\r\n\t *\r\n\t * \\param [in] container is a reference to source container from which the thread will be transferred\r\n\t * \\param [in] iterator is the iterator which points to unblocked thread\r\n\t *\/\r\n\r\n\tvoid unblock(ThreadControlBlockList& container, Iterator iterator);\r\n\r\n\t\/**\r\n\t * \\brief Yields time slot of the scheduler to next thread.\r\n\t *\/\r\n\r\n\tvoid yield() const;\r\n\r\nprivate:\r\n\r\n\t\/**\r\n\t * \\brief Blocks thread, transferring it to provided container.\r\n\t *\r\n\t * Internal version - without interrupt masking and forced context switch.\r\n\t *\r\n\t * \\param [in] container is a reference to destination container to which the thread will be transferred\r\n\t * \\param [in] iterator is the iterator to the thread that will be blocked\r\n\t *\r\n\t * \\return 0 on success, error code otherwise:\r\n\t * - EINVAL - provided thread is not in \"runnable\" state;\r\n\t *\/\r\n\r\n\tint blockInternal_(ThreadControlBlockList& container, Iterator iterator);\r\n\r\n\t\/**\r\n\t * \\brief Forces unconditional context switch.\r\n\t *\r\n\t * Temporarily disables any interrupt masking and requests unconditional context switch.\r\n\t *\/\r\n\r\n\tvoid forceContextSwitch_() const;\r\n\r\n\t\/**\r\n\t * \\brief Tests whether context switch is required or not.\r\n\t *\r\n\t * Context switch is required in following situations:\r\n\t * - current thread is no longer in \"runnable\" state,\r\n\t * - there is a higher-priority thread available,\r\n\t * - current thread used its round-robin quantum and same-priority thread is available.\r\n\t *\r\n\t * \\return true if context switch is required\r\n\t *\/\r\n\r\n\tbool isContextSwitchRequired_() const;\r\n\r\n\t\/**\r\n\t * \\brief Requests unconditional context switch.\r\n\t *\r\n\t * Wrapper for architecture::requestContextSwitch()\r\n\t *\/\r\n\r\n\tvoid requestContextSwitch_() const;\r\n\r\n\t\/**\r\n\t * \\brief Unblocks provided thread, transferring it from provided container to \"runnable\" container.\r\n\t *\r\n\t * Internal version - without interrupt masking and yield()\r\n\t *\r\n\t * \\param [in] container is a reference to source container from which the thread will be transferred\r\n\t * \\param [in] iterator is the iterator which points to unblocked thread\r\n\t *\/\r\n\r\n\tvoid unblockInternal_(ThreadControlBlockList& container, Iterator iterator);\r\n\r\n\t\/\/\/ iterator to the currently active ThreadControlBlock\r\n\tIterator currentThreadControlBlock_;\r\n\r\n\t\/\/\/ list of ThreadControlBlock elements in \"runnable\" state, sorted by priority in descending order\r\n\tThreadControlBlockList runnableList_;\r\n\r\n\t\/\/\/ list of ThreadControlBlock elements in \"suspended\" state, sorted by priority in descending order\r\n\tThreadControlBlockList suspendedList_;\r\n\r\n\t\/\/\/ internal SoftwareTimerControlBlockSupervisor object\r\n\tSoftwareTimerControlBlockSupervisor softwareTimerControlBlockSupervisor_;\r\n\r\n\t\/\/\/ tick count\r\n\tuint64_t tickCount_;\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_SCHEDULER_HPP_\r\n<commit_msg>Scheduler: add templated versions of Scheduler::sleepFor() and Scheduler::sleepUntil()<commit_after>\/**\r\n * \\file\r\n * \\brief Scheduler 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-08-28\r\n *\/\r\n\r\n#ifndef INCLUDE_DISTORTOS_SCHEDULER_SCHEDULER_HPP_\r\n#define INCLUDE_DISTORTOS_SCHEDULER_SCHEDULER_HPP_\r\n\r\n#include \"distortos\/scheduler\/ThreadControlBlockList.hpp\"\r\n#include \"distortos\/scheduler\/SoftwareTimerControlBlockSupervisor.hpp\"\r\n\r\n#include <chrono>\r\n\r\nnamespace distortos\r\n{\r\n\r\n\/\/\/ scheduler namespace has symbols related to scheduling\r\nnamespace scheduler\r\n{\r\n\r\ntemplate<typename Function, typename... Args>\r\nclass Thread;\r\nclass MainThreadControlBlock;\r\n\r\n\/\/\/ Scheduler class is a system's scheduler\r\nclass Scheduler\r\n{\r\npublic:\r\n\r\n\t\/\/\/ generic iterator for all variants of ThreadControlBlockList\r\n\tusing Iterator = containers::SortedContainerBase<std::list<ThreadControlBlockListValueType>>::iterator;\r\n\r\n\t\/**\r\n\t * \\brief Scheduler's constructor\r\n\t *\r\n\t * \\attention Priority of main thread must be higher than priority of idle thread.\r\n\t *\r\n\t * \\param [in] mainThreadControlBlock is a reference to main thread\r\n\t * \\param [in] idleThread is a reference to idle thread\r\n\t *\/\r\n\r\n\tScheduler(MainThreadControlBlock& mainThreadControlBlock, Thread<void (&)()>& idleThread);\r\n\r\n\t\/**\r\n\t * \\brief Adds new ThreadControlBlock to scheduler.\r\n\t *\r\n\t * ThreadControlBlock's state is changed to \"runnable\".\r\n\t *\r\n\t * \\param [in] thread_control_block is a reference to added ThreadControlBlock object\r\n\t *\/\r\n\r\n\tvoid add(ThreadControlBlock& thread_control_block);\r\n\r\n\t\/**\r\n\t * \\brief Blocks current thread, transferring it to provided container.\r\n\t *\r\n\t * \\param [in] container is a reference to destination container to which the thread will be transferred\r\n\t *\/\r\n\r\n\tvoid block(ThreadControlBlockList& container);\r\n\r\n\t\/**\r\n\t * \\brief Blocks thread, transferring it to provided container.\r\n\t *\r\n\t * The thread must be in \"runnable\" state - trying to block thread in other state is an error.\r\n\t *\r\n\t * \\param [in] container is a reference to destination container to which the thread will be transferred\r\n\t * \\param [in] iterator is the iterator to the thread that will be blocked\r\n\t *\r\n\t * \\return 0 on success, error code otherwise:\r\n\t * - EINVAL - provided thread is not in \"runnable\" state;\r\n\t *\/\r\n\r\n\tint block(ThreadControlBlockList& container, Iterator iterator);\r\n\r\n\t\/**\r\n\t * \\return reference to currently active ThreadControlBlock\r\n\t *\/\r\n\r\n\tThreadControlBlock& getCurrentThreadControlBlock() const { return *currentThreadControlBlock_; }\r\n\r\n\t\/**\r\n\t * \\return reference to internal SoftwareTimerControlBlockSupervisor object\r\n\t *\/\r\n\r\n\tSoftwareTimerControlBlockSupervisor& getSoftwareTimerSupervisor()\r\n\t{\r\n\t\treturn softwareTimerControlBlockSupervisor_;\r\n\t}\r\n\r\n\t\/**\r\n\t * \\return const reference to internal SoftwareTimerControlBlockSupervisor object\r\n\t *\/\r\n\r\n\tconst SoftwareTimerControlBlockSupervisor& getSoftwareTimerSupervisor() const\r\n\t{\r\n\t\treturn softwareTimerControlBlockSupervisor_;\r\n\t}\r\n\r\n\t\/**\r\n\t * \\return current value of tick count\r\n\t *\/\r\n\r\n\tuint64_t getTickCount() const;\r\n\r\n\t\/**\r\n\t * \\brief Removes current thread from Scheduler's control.\r\n\t *\r\n\t * Thread's state is changed to \"terminated\" and it's terminationHook() is called.\r\n\t *\r\n\t * \\note This function can be used only after thread's function returns an all cleanup is done.\r\n\t *\r\n\t * \\return 0 on success, error code otherwise:\r\n\t * - EINVAL - provided thread is not in \"runnable\" state and cannot be removed\/terminated;\r\n\t *\/\r\n\r\n\tint remove();\r\n\r\n\t\/**\r\n\t * \\brief Resumes suspended thread.\r\n\t *\r\n\t * The thread must be in \"suspended\" state - trying to resume thread that is not suspended is an error.\r\n\t *\r\n\t * \\param [in] iterator is the iterator to the thread that will be resumed\r\n\t *\r\n\t * \\return 0 on success, error code otherwise:\r\n\t * - EINVAL - provided thread is not in \"suspended\" state;\r\n\t *\/\r\n\r\n\tint resume(Iterator iterator);\r\n\r\n\t\/**\r\n\t * \\brief Makes the calling (current) thread sleep for at least given duration.\r\n\t *\r\n\t * Current thread's state is changed to \"sleeping\".\r\n\t *\r\n\t * \\note To fulfill the \"at least\" requirement, one additional tick is always added to the sleep duration.\r\n\t *\r\n\t * \\param [in] duration is the duration after which the thread will be woken\r\n\t *\/\r\n\r\n\tvoid sleepFor(TickClock::duration duration);\r\n\r\n\t\/**\r\n\t * \\brief Makes the calling (current) thread sleep for at least given duration.\r\n\t *\r\n\t * Current thread's state is changed to \"sleeping\".\r\n\t *\r\n\t * \\note To fulfill the \"at least\" requirement, one additional tick is always added to the sleep duration.\r\n\t *\r\n\t * \\param Rep is type of tick counter\r\n\t * \\param Period is std::ratio type representing the tick period of the clock, in seconds\r\n\t *\r\n\t * \\param [in] duration is the duration after which the thread will be woken\r\n\t *\/\r\n\r\n\ttemplate<typename Rep, typename Period>\r\n\tvoid sleepFor(const std::chrono::duration<Rep,Period> duration)\r\n\t{\r\n\t\tsleepFor(std::chrono::duration_cast<TickClock::duration>(duration));\r\n\t}\r\n\r\n\t\/**\r\n\t * \\brief Makes the calling (current) thread sleep until some time point is reached.\r\n\t *\r\n\t * Current thread's state is changed to \"sleeping\".\r\n\t *\r\n\t * \\param [in] time_point is the time point at which the thread will be woken\r\n\t *\/\r\n\r\n\tvoid sleepUntil(TickClock::time_point time_point);\r\n\r\n\t\/**\r\n\t * \\brief Makes the calling (current) thread sleep until some time point is reached.\r\n\t *\r\n\t * Current thread's state is changed to \"sleeping\".\r\n\t *\r\n\t * \\param Duration is a std::chrono::duration type used to measure duration\r\n\t *\r\n\t * \\param [in] time_point is the time point at which the thread will be woken\r\n\t *\/\r\n\r\n\ttemplate<typename Duration>\r\n\tvoid sleepUntil(std::chrono::time_point<TickClock, Duration> time_point)\r\n\t{\r\n\t\tsleepUntil(std::chrono::time_point_cast<TickClock::duration>(time_point));\r\n\t}\r\n\r\n\t\/**\r\n\t * \\brief Suspends current thread.\r\n\t *\/\r\n\r\n\tvoid suspend();\r\n\r\n\t\/**\r\n\t * \\brief Suspends thread.\r\n\t *\r\n\t * The thread must be in \"runnable\" state - trying to suspend thread in other state is an error.\r\n\t *\r\n\t * \\param [in] iterator is the iterator to the thread that will be suspended\r\n\t *\r\n\t * \\return 0 on success, error code otherwise:\r\n\t * - EINVAL - provided thread is not in \"runnable\" state;\r\n\t *\/\r\n\r\n\tint suspend(Iterator iterator);\r\n\r\n\t\/**\r\n\t * \\brief Called by architecture-specific code to do final context switch.\r\n\t *\r\n\t * Current task is suspended and the next available task is started.\r\n\t *\r\n\t * \\param [in] stack_pointer is the current value of current thread's stack pointer\r\n\t *\r\n\t * \\return new thread's stack pointer\r\n\t *\/\r\n\r\n\tvoid* switchContext(void* stack_pointer);\r\n\r\n\t\/**\r\n\t * \\brief Handler of \"tick\" interrupt.\r\n\t *\r\n\t * \\note this must not be called by user code\r\n\t *\r\n\t * \\return true if context switch is required, false otherwise\r\n\t *\/\r\n\r\n\tbool tickInterruptHandler();\r\n\r\n\t\/**\r\n\t * \\brief Unblocks provided thread, transferring it from provided container to \"runnable\" container.\r\n\t *\r\n\t * \\param [in] container is a reference to source container from which the thread will be transferred\r\n\t * \\param [in] iterator is the iterator which points to unblocked thread\r\n\t *\/\r\n\r\n\tvoid unblock(ThreadControlBlockList& container, Iterator iterator);\r\n\r\n\t\/**\r\n\t * \\brief Yields time slot of the scheduler to next thread.\r\n\t *\/\r\n\r\n\tvoid yield() const;\r\n\r\nprivate:\r\n\r\n\t\/**\r\n\t * \\brief Blocks thread, transferring it to provided container.\r\n\t *\r\n\t * Internal version - without interrupt masking and forced context switch.\r\n\t *\r\n\t * \\param [in] container is a reference to destination container to which the thread will be transferred\r\n\t * \\param [in] iterator is the iterator to the thread that will be blocked\r\n\t *\r\n\t * \\return 0 on success, error code otherwise:\r\n\t * - EINVAL - provided thread is not in \"runnable\" state;\r\n\t *\/\r\n\r\n\tint blockInternal_(ThreadControlBlockList& container, Iterator iterator);\r\n\r\n\t\/**\r\n\t * \\brief Forces unconditional context switch.\r\n\t *\r\n\t * Temporarily disables any interrupt masking and requests unconditional context switch.\r\n\t *\/\r\n\r\n\tvoid forceContextSwitch_() const;\r\n\r\n\t\/**\r\n\t * \\brief Tests whether context switch is required or not.\r\n\t *\r\n\t * Context switch is required in following situations:\r\n\t * - current thread is no longer in \"runnable\" state,\r\n\t * - there is a higher-priority thread available,\r\n\t * - current thread used its round-robin quantum and same-priority thread is available.\r\n\t *\r\n\t * \\return true if context switch is required\r\n\t *\/\r\n\r\n\tbool isContextSwitchRequired_() const;\r\n\r\n\t\/**\r\n\t * \\brief Requests unconditional context switch.\r\n\t *\r\n\t * Wrapper for architecture::requestContextSwitch()\r\n\t *\/\r\n\r\n\tvoid requestContextSwitch_() const;\r\n\r\n\t\/**\r\n\t * \\brief Unblocks provided thread, transferring it from provided container to \"runnable\" container.\r\n\t *\r\n\t * Internal version - without interrupt masking and yield()\r\n\t *\r\n\t * \\param [in] container is a reference to source container from which the thread will be transferred\r\n\t * \\param [in] iterator is the iterator which points to unblocked thread\r\n\t *\/\r\n\r\n\tvoid unblockInternal_(ThreadControlBlockList& container, Iterator iterator);\r\n\r\n\t\/\/\/ iterator to the currently active ThreadControlBlock\r\n\tIterator currentThreadControlBlock_;\r\n\r\n\t\/\/\/ list of ThreadControlBlock elements in \"runnable\" state, sorted by priority in descending order\r\n\tThreadControlBlockList runnableList_;\r\n\r\n\t\/\/\/ list of ThreadControlBlock elements in \"suspended\" state, sorted by priority in descending order\r\n\tThreadControlBlockList suspendedList_;\r\n\r\n\t\/\/\/ internal SoftwareTimerControlBlockSupervisor object\r\n\tSoftwareTimerControlBlockSupervisor softwareTimerControlBlockSupervisor_;\r\n\r\n\t\/\/\/ tick count\r\n\tuint64_t tickCount_;\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_SCHEDULER_HPP_\r\n<|endoftext|>"} {"text":"<commit_before><commit_msg>fixed some indexing issues<commit_after><|endoftext|>"} {"text":"<commit_before>#include \"vec3.h\"\n#include <pybind11\/pybind11.h>\n#include <pybind11\/operators.h>\n#include <pybind11\/stl.h>\n#include <pybind11\/numpy.h>\n\nnamespace py = pybind11;\nusing namespace pybind11::literals;\n\nnamespace jtrace {\n void pyExportVec3(py::module& m) {\n PYBIND11_NUMPY_DTYPE(Vec3, x, y, z);\n py::class_<Vec3>(m, \"Vec3\", R\"pbdoc(\n Simple python 3-vector\n\n Parameters\n ----------\n x\n x-coordinate\n y\n y-coordinate\n z\n z-coordinate\n\n Notes\n -----\n `x`, `y`, and `z` may also all be left blank, in which case the 0-vector is returned.\n\n Examples\n --------\n >>> v = jtrace.Vec3(1, 2, 3.4)\n >>> print(v)\n Vec3(1, 2, 3.4)\n\n >>> v2 = jtrace.Vec3()\n >>> print(v2)\n Vec3(0, 0, 0)\n )pbdoc\")\n .def(py::init<double,double,double>(), \"init\", \"x\"_a, \"y\"_a, \"z\"_a)\n .def(py::init<>())\n .def(py::init<std::array<double,3>>())\n .def(\"MagnitudeSquared\", &Vec3::MagnitudeSquared, \"Return square of vector magnitude.\")\n .def(\"Magnitude\", &Vec3::Magnitude, \"Return vector magnitude.\")\n .def(\"UnitVec3\", &Vec3::UnitVec3, \"Return unit vector pointing in same direction.\")\n .def(\"MagnitudeSquared\", &Vec3::MagnitudeSquared)\n .def(\"Magnitude\", &Vec3::Magnitude)\n .def(\"UnitVec3\", &Vec3::UnitVec3)\n .def(\"__repr__\", &Vec3::repr)\n .def_readonly(\"x\", &Vec3::x, \"x-coordinate of vector\")\n .def_readonly(\"y\", &Vec3::y, \"y-coordinate of vector\")\n .def_readonly(\"z\", &Vec3::z, \"z-coordinate of vector\")\n .def(py::self + py::self)\n .def(py::self += py::self)\n .def(py::self - py::self)\n .def(py::self -= py::self)\n .def(py::self * double())\n .def(py::self *= double())\n .def(py::self \/ double())\n .def(py::self \/= double())\n .def(py::self == py::self)\n .def(py::self != py::self)\n .def(-py::self);\n\n py::class_<Rot3>(m, \"Rot3\", py::buffer_protocol())\n .def_buffer([](Rot3& r) -> py::buffer_info {\n return py::buffer_info(\n r.data.data(),\n sizeof(double),\n py::format_descriptor<double>::format(),\n 2,\n {3, 3},\n {sizeof(double) * 3, sizeof(double)}\n );\n })\n .def(py::init<>())\n .def(py::init<std::array<double,9>>())\n .def(\"__repr__\", &Rot3::repr)\n .def(py::self * double())\n .def(py::self *= double())\n .def(py::self \/ double())\n .def(py::self \/= double())\n .def(\"determinant\", &Rot3::determinant);\n\n m.def(\"DotProduct\", &DotProduct, R\"pbdoc(\n Compute the dot-product of two Vec3 objects.\n\n Parameters\n ----------\n v1 : Vec3\n First vector\n v2 : Vec3\n Second vector\n\n Returns\n -------\n float\n The dot product.\n\n Notes\n -----\n The dot product is defined as the sum of the component-wise products of two vectors. It\n is useful for computing the magnitude of a vector, or the angle between two vectors as\n\n .. math::\n v1 \\dot v2 = \\cos(\\theta)\n\n where :math:`\\theta` is the angle in between the two vectors.\n\n Examples\n --------\n >>> v1 = jtrace.Vec3(0, 1, 0)\n >>> v2 = jtrace.Vec3(0, 0, 1)\n >>> print(jtrace.DotProduct(v1, v2))\n 0.0\n >>> v1 = jtrace.Vec3(0, 1, 2)\n >>> v2 = jtrace.Vec3(1, 2, 3)\n >>> assert jtrace.DotProduct(v1, v2) == v1.x*v2.x + v1.y*v2.y + v1.z*v2.z\n\n )pbdoc\");\n\n m.def(\"CrossProduct\", &CrossProduct, R\"pbdoc(\n Compute the cross-product of two Vec3 objects.\n\n Parameters\n ----------\n v1 : Vec3\n First vector\n v2 : Vec3\n Second vector\n\n Returns\n -------\n Vec3\n The vector cross-product v1 x v2.\n\n Notes\n -----\n The vector cross-product is useful for computing a vector that is perpendicular to both\n `v1` and `v2`. The magnitude of the cross-product is equal to\n\n .. math::\n |v1 \\cross v2| = |v1| |v2| \\sin(\\theta)\n\n where :math:`\\theta` is the angle in between `v1` and `v2`. jtrace Vec3 objects obey the\n right-hand-rule, where Vec3(1, 0, 0) x Vec3(0, 1, 0) = Vec3(0, 0, 1), and cyclic\n permutations thereof.\n\n Examples\n --------\n >>> v1 = jtrace.Vec3(0, 1, 2)\n >>> v2 = jtrace.Vec3(1, 2, 3)\n >>> jtrace.CrossProduct(v1, v2)\n Vec3(-1, 2, -1)\n\n )pbdoc\");\n m.def(\"RotVec\", &RotVec);\n m.def(\"UnRotVec\", &UnRotVec);\n }\n}\n<commit_msg>Remove duplicate pybind wrapper<commit_after>#include \"vec3.h\"\n#include <pybind11\/pybind11.h>\n#include <pybind11\/operators.h>\n#include <pybind11\/stl.h>\n#include <pybind11\/numpy.h>\n\nnamespace py = pybind11;\nusing namespace pybind11::literals;\n\nnamespace jtrace {\n void pyExportVec3(py::module& m) {\n PYBIND11_NUMPY_DTYPE(Vec3, x, y, z);\n py::class_<Vec3>(m, \"Vec3\", R\"pbdoc(\n Simple python 3-vector\n\n Parameters\n ----------\n x\n x-coordinate\n y\n y-coordinate\n z\n z-coordinate\n\n Notes\n -----\n `x`, `y`, and `z` may also all be left blank, in which case the 0-vector is returned.\n\n Examples\n --------\n >>> v = jtrace.Vec3(1, 2, 3.4)\n >>> print(v)\n Vec3(1, 2, 3.4)\n\n >>> v2 = jtrace.Vec3()\n >>> print(v2)\n Vec3(0, 0, 0)\n )pbdoc\")\n .def(py::init<double,double,double>(), \"init\", \"x\"_a, \"y\"_a, \"z\"_a)\n .def(py::init<>())\n .def(py::init<std::array<double,3>>())\n .def(\"MagnitudeSquared\", &Vec3::MagnitudeSquared, \"Return square of vector magnitude.\")\n .def(\"Magnitude\", &Vec3::Magnitude, \"Return vector magnitude.\")\n .def(\"UnitVec3\", &Vec3::UnitVec3, \"Return unit vector pointing in same direction.\")\n .def(\"__repr__\", &Vec3::repr)\n .def_readonly(\"x\", &Vec3::x, \"x-coordinate of vector\")\n .def_readonly(\"y\", &Vec3::y, \"y-coordinate of vector\")\n .def_readonly(\"z\", &Vec3::z, \"z-coordinate of vector\")\n .def(py::self + py::self)\n .def(py::self += py::self)\n .def(py::self - py::self)\n .def(py::self -= py::self)\n .def(py::self * double())\n .def(py::self *= double())\n .def(py::self \/ double())\n .def(py::self \/= double())\n .def(py::self == py::self)\n .def(py::self != py::self)\n .def(-py::self);\n\n py::class_<Rot3>(m, \"Rot3\", py::buffer_protocol())\n .def_buffer([](Rot3& r) -> py::buffer_info {\n return py::buffer_info(\n r.data.data(),\n sizeof(double),\n py::format_descriptor<double>::format(),\n 2,\n {3, 3},\n {sizeof(double) * 3, sizeof(double)}\n );\n })\n .def(py::init<>())\n .def(py::init<std::array<double,9>>())\n .def(\"__repr__\", &Rot3::repr)\n .def(py::self * double())\n .def(py::self *= double())\n .def(py::self \/ double())\n .def(py::self \/= double())\n .def(\"determinant\", &Rot3::determinant);\n\n m.def(\"DotProduct\", &DotProduct, R\"pbdoc(\n Compute the dot-product of two Vec3 objects.\n\n Parameters\n ----------\n v1 : Vec3\n First vector\n v2 : Vec3\n Second vector\n\n Returns\n -------\n float\n The dot product.\n\n Notes\n -----\n The dot product is defined as the sum of the component-wise products of two vectors. It\n is useful for computing the magnitude of a vector, or the angle between two vectors as\n\n .. math::\n v1 \\dot v2 = \\cos(\\theta)\n\n where :math:`\\theta` is the angle in between the two vectors.\n\n Examples\n --------\n >>> v1 = jtrace.Vec3(0, 1, 0)\n >>> v2 = jtrace.Vec3(0, 0, 1)\n >>> print(jtrace.DotProduct(v1, v2))\n 0.0\n >>> v1 = jtrace.Vec3(0, 1, 2)\n >>> v2 = jtrace.Vec3(1, 2, 3)\n >>> assert jtrace.DotProduct(v1, v2) == v1.x*v2.x + v1.y*v2.y + v1.z*v2.z\n\n )pbdoc\");\n\n m.def(\"CrossProduct\", &CrossProduct, R\"pbdoc(\n Compute the cross-product of two Vec3 objects.\n\n Parameters\n ----------\n v1 : Vec3\n First vector\n v2 : Vec3\n Second vector\n\n Returns\n -------\n Vec3\n The vector cross-product v1 x v2.\n\n Notes\n -----\n The vector cross-product is useful for computing a vector that is perpendicular to both\n `v1` and `v2`. The magnitude of the cross-product is equal to\n\n .. math::\n |v1 \\cross v2| = |v1| |v2| \\sin(\\theta)\n\n where :math:`\\theta` is the angle in between `v1` and `v2`. jtrace Vec3 objects obey the\n right-hand-rule, where Vec3(1, 0, 0) x Vec3(0, 1, 0) = Vec3(0, 0, 1), and cyclic\n permutations thereof.\n\n Examples\n --------\n >>> v1 = jtrace.Vec3(0, 1, 2)\n >>> v2 = jtrace.Vec3(1, 2, 3)\n >>> jtrace.CrossProduct(v1, v2)\n Vec3(-1, 2, -1)\n\n )pbdoc\");\n m.def(\"RotVec\", &RotVec);\n m.def(\"UnRotVec\", &UnRotVec);\n }\n}\n<|endoftext|>"} {"text":"<commit_before>\/**\n * @file svm_test.cpp\n *\n * Test for SVM.\n *\/\n#include <mlpack\/core.h>\n#include <mlpack\/methods\/svm\/svm.h>\n\n#include <boost\/test\/unit_test.hpp>\n\nusing std::string;\nusing namespace mlpack;\nusing namespace mlpack::svm;\n\nBOOST_AUTO_TEST_SUITE(SVMTest);\n\n\/\/ Create test data\narma::mat matrix(20, 3);\nbool first = true;\n\n\/**\n * Creates the data to train and test with and prints it to stdout. Should only\n * have any effect once.\n *\/\nvoid setup()\n{\n if(!first)\n return;\n first = false;\n\n CLI::GetParam<bool>(\"svm\/shrink\") = true;\n CLI::GetParam<double>(\"svm\/epsilon\") = .1;\n CLI::GetParam<double>(\"svm\/sigma\") = 1;\n \/\/ Protect the test from taking forever\n CLI::GetParam<size_t>(\"svm\/n_iter\") = 10000;\n\n matrix <<\n 7.19906628001437787e-01 << 1.83250823399634477e+00 << 0 << arma::endr <<\n 1.37899419263889733e+01 << 1.78198235122579263e+00 << 1 << arma::endr <<\n 6.68859485848275703e-01 << 2.14083320956715983e+00 << 0 << arma::endr <<\n 1.84729928795588165e+01 << 2.25024702760868101e+00 << 1 << arma::endr <<\n 9.22802773268335819e-01 << 1.61469358350834513e+00 << 0 << arma::endr <<\n 2.06209849662245204e-01 << 6.34699695340683490e-01 << 1 << arma::endr <<\n 4.01062068250524817e-01 << 1.65802752932441777e+00 << 0 << arma::endr <<\n 5.02985607135568635e+00 << 1.39976642741810831e+00 << 1 << arma::endr <<\n 3.66471199955079319e-01 << 1.62780588172739638e+00 << 0 << arma::endr <<\n 1.56912570240400999e+01 << 2.16941541650770953e+00 << 1 << arma::endr <<\n 9.98909584711729304e-01 << 2.00337906391517206e+00 << 0 << arma::endr <<\n 1.31430438780891912e+01 << 1.34410346059319719e+00 << 1 << arma::endr <<\n 3.41572957272442523e-01 << 1.16758463655951639e+00 << 0 << arma::endr <<\n 9.53941410851637528e-01 << 6.30271704462483373e-01 << 1 << arma::endr <<\n 7.07135529120981432e-01 << 2.17763537339756041e+00 << 0 << arma::endr <<\n 9.68899714280338742e+00 << 1.26922579378319256e+00 << 1 << arma::endr <<\n 9.82393905512240706e-01 << 2.36790583090293483e+00 << 0 << arma::endr <<\n 1.31583349281727973e+01 << 1.45115094722767868e+00 << 1 << arma::endr <<\n 3.80991188521027202e-01 << 9.05379134419085019e-01 << 0 << arma::endr <<\n 1.86057436180327755e+01 << 2.26941891469499968e+00 << 1 << arma::endr;\n matrix = trans(matrix);\n\n std::cout << matrix << std::endl;\n}\n\n\/**\n * Compares predicted values with known values to see if the prediction\/training\n * works.\n *\n * @param learner_typeid Magic number for selecting between classification and\n * regression.\n * @param data The dataset with the data to predict with.\n * @param svm The SVM class instance that has been trained for this data, et al.\n *\/\ntemplate<typename T>\nvoid verify(size_t learner_typeid, arma::mat& data, SVM<T>& svm)\n{\n for(size_t i = 0; i < data.n_cols; i++)\n {\n arma::vec testvec = data.col(i);\n\n double predictedvalue = svm.Predict(learner_typeid, testvec);\n BOOST_REQUIRE_CLOSE(predictedvalue, data(data.n_rows - 1, i), 1e-6);\n }\n}\n\n\/**\n * Trains a classifier with a linear kernel and checks predictions against\n * classes.\n *\/\n\/\/BOOST_AUTO_TEST_CASE(svm_classification_linear_kernel_test) {\n\/\/ setup();\n\/\/\n\/\/ arma::mat trainingdata;\n\/\/ trainingdata = matrix;\n\/\/ SVM<SVMLinearKernel> svm;\n\/\/ svm.InitTrain(0,trainingdata); \/\/ 0 for classification\n\/\/ verify(0,trainingdata,svm);\n\/\/}\n\n\/**\n * Trains a classifier with a gaussian kernel and checks predictions against\n * classes.\n *\/\nBOOST_AUTO_TEST_CASE(svm_classification_gaussian_kernel_test) {\n setup();\n\n arma::mat trainingdata;\n trainingdata = matrix;\n SVM<SVMRBFKernel> svm;\n svm.InitTrain(0,trainingdata); \/\/ 0 for classification\n verify(0,trainingdata,svm);\n}\n\n\/**\n * Trains a classifier with a linear kernel and checks predictions against\n * classes, using regression. TODO: BROKEN\n *\/\n\/\/BOOST_AUTO_TEST_CASE(svm_regression_linear_kernel_test) {\n\/\/ setup();\n\/\/\n\/\/ arma::mat trainingdata;\n\/\/ trainingdata = matrix;\n\/\/ SVM<SVMLinearKernel> svm;\n\/\/ svm.InitTrain(1,trainingdata); \/\/ 0 for classification\n\/\/ \/\/verify(1,trainingdata,svm);\n\/\/}\n\n\/**\n * Trains a classifier with a gaussian kernel and checks predictions against\n * classes, using regression. TODO: BROKEN\n *\/\n\/\/BOOST_AUTO_TEST_CASE(svm_regression_gaussian_kernel_test) {\n\/\/ setup();\n\/\/\n\/\/ arma::mat trainingdata;\n\/\/ trainingdata = matrix;\n\/\/ SVM<SVMRBFKernel> svm;\n\/\/ svm.InitTrain(1,trainingdata); \/\/ 0 for classification\n\/\/ \/\/verify(1,trainingdata,svm);\n\/\/}\n\nBOOST_AUTO_TEST_SUITE_END();\n<commit_msg>Fix formatting in tests\/ as per #153.<commit_after>\/**\n * @file svm_test.cpp\n *\n * Test for SVM.\n *\/\n#include <mlpack\/core.h>\n#include <mlpack\/methods\/svm\/svm.h>\n\n#include <boost\/test\/unit_test.hpp>\n\nusing std::string;\nusing namespace mlpack;\nusing namespace mlpack::svm;\n\nBOOST_AUTO_TEST_SUITE(SVMTest);\n\n\/\/ Create test data\narma::mat matrix(20, 3);\nbool first = true;\n\n\/**\n * Creates the data to train and test with and prints it to stdout. Should only\n * have any effect once.\n *\/\nvoid setup()\n{\n if (!first)\n return;\n first = false;\n\n CLI::GetParam<bool>(\"svm\/shrink\") = true;\n CLI::GetParam<double>(\"svm\/epsilon\") = .1;\n CLI::GetParam<double>(\"svm\/sigma\") = 1;\n \/\/ Protect the test from taking forever\n CLI::GetParam<size_t>(\"svm\/n_iter\") = 10000;\n\n matrix <<\n 7.19906628001437787e-01 << 1.83250823399634477e+00 << 0 << arma::endr <<\n 1.37899419263889733e+01 << 1.78198235122579263e+00 << 1 << arma::endr <<\n 6.68859485848275703e-01 << 2.14083320956715983e+00 << 0 << arma::endr <<\n 1.84729928795588165e+01 << 2.25024702760868101e+00 << 1 << arma::endr <<\n 9.22802773268335819e-01 << 1.61469358350834513e+00 << 0 << arma::endr <<\n 2.06209849662245204e-01 << 6.34699695340683490e-01 << 1 << arma::endr <<\n 4.01062068250524817e-01 << 1.65802752932441777e+00 << 0 << arma::endr <<\n 5.02985607135568635e+00 << 1.39976642741810831e+00 << 1 << arma::endr <<\n 3.66471199955079319e-01 << 1.62780588172739638e+00 << 0 << arma::endr <<\n 1.56912570240400999e+01 << 2.16941541650770953e+00 << 1 << arma::endr <<\n 9.98909584711729304e-01 << 2.00337906391517206e+00 << 0 << arma::endr <<\n 1.31430438780891912e+01 << 1.34410346059319719e+00 << 1 << arma::endr <<\n 3.41572957272442523e-01 << 1.16758463655951639e+00 << 0 << arma::endr <<\n 9.53941410851637528e-01 << 6.30271704462483373e-01 << 1 << arma::endr <<\n 7.07135529120981432e-01 << 2.17763537339756041e+00 << 0 << arma::endr <<\n 9.68899714280338742e+00 << 1.26922579378319256e+00 << 1 << arma::endr <<\n 9.82393905512240706e-01 << 2.36790583090293483e+00 << 0 << arma::endr <<\n 1.31583349281727973e+01 << 1.45115094722767868e+00 << 1 << arma::endr <<\n 3.80991188521027202e-01 << 9.05379134419085019e-01 << 0 << arma::endr <<\n 1.86057436180327755e+01 << 2.26941891469499968e+00 << 1 << arma::endr;\n matrix = trans(matrix);\n\n std::cout << matrix << std::endl;\n}\n\n\/**\n * Compares predicted values with known values to see if the prediction\/training\n * works.\n *\n * @param learner_typeid Magic number for selecting between classification and\n * regression.\n * @param data The dataset with the data to predict with.\n * @param svm The SVM class instance that has been trained for this data, et al.\n *\/\ntemplate<typename T>\nvoid verify(size_t learner_typeid, arma::mat& data, SVM<T>& svm)\n{\n for (size_t i = 0; i < data.n_cols; i++)\n {\n arma::vec testvec = data.col(i);\n\n double predictedvalue = svm.Predict(learner_typeid, testvec);\n BOOST_REQUIRE_CLOSE(predictedvalue, data(data.n_rows - 1, i), 1e-6);\n }\n}\n\n\/**\n * Trains a classifier with a linear kernel and checks predictions against\n * classes.\n *\/\n\/\/BOOST_AUTO_TEST_CASE(svm_classification_linear_kernel_test) {\n\/\/ setup();\n\/\/\n\/\/ arma::mat trainingdata;\n\/\/ trainingdata = matrix;\n\/\/ SVM<SVMLinearKernel> svm;\n\/\/ svm.InitTrain(0,trainingdata); \/\/ 0 for classification\n\/\/ verify(0,trainingdata,svm);\n\/\/}\n\n\/**\n * Trains a classifier with a gaussian kernel and checks predictions against\n * classes.\n *\/\nBOOST_AUTO_TEST_CASE(svm_classification_gaussian_kernel_test)\n{\n setup();\n\n arma::mat trainingdata;\n trainingdata = matrix;\n SVM<SVMRBFKernel> svm;\n svm.InitTrain(0,trainingdata); \/\/ 0 for classification\n verify(0,trainingdata,svm);\n}\n\n\/**\n * Trains a classifier with a linear kernel and checks predictions against\n * classes, using regression. TODO: BROKEN\n *\/\n\/\/BOOST_AUTO_TEST_CASE(svm_regression_linear_kernel_test) {\n\/\/ setup();\n\/\/\n\/\/ arma::mat trainingdata;\n\/\/ trainingdata = matrix;\n\/\/ SVM<SVMLinearKernel> svm;\n\/\/ svm.InitTrain(1,trainingdata); \/\/ 0 for classification\n\/\/ \/\/verify(1,trainingdata,svm);\n\/\/}\n\n\/**\n * Trains a classifier with a gaussian kernel and checks predictions against\n * classes, using regression. TODO: BROKEN\n *\/\n\/\/BOOST_AUTO_TEST_CASE(svm_regression_gaussian_kernel_test) {\n\/\/ setup();\n\/\/\n\/\/ arma::mat trainingdata;\n\/\/ trainingdata = matrix;\n\/\/ SVM<SVMRBFKernel> svm;\n\/\/ svm.InitTrain(1,trainingdata); \/\/ 0 for classification\n\/\/ \/\/verify(1,trainingdata,svm);\n\/\/}\n\nBOOST_AUTO_TEST_SUITE_END();\n<|endoftext|>"} {"text":"<commit_before>\/* Sirikata\n * main.cpp\n *\n * Copyright (c) 2008, Daniel Reiter Horn\n * All rights reserved.\n *\n * Redistribution and use in source and binary forms, with or without\n * modification, are permitted provided that the following conditions are\n * met:\n * * Redistributions of source code must retain the above copyright\n * notice, this list of conditions and the following disclaimer.\n * * Redistributions in binary form must reproduce the above copyright\n * notice, this list of conditions and the following disclaimer in\n * the documentation and\/or other materials provided with the\n * distribution.\n * * Neither the name of Sirikata nor the names of its contributors may\n * be used to endorse or promote products derived from this software\n * without specific prior written permission.\n *\n * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS \"AS\n * IS\" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED\n * TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A\n * PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER\n * OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,\n * EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,\n * PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR\n * PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF\n * LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING\n * NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS\n * SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.\n *\/\n\n#include <sirikata\/oh\/Platform.hpp>\n#include <sirikata\/core\/util\/PluginManager.hpp>\n#include <sirikata\/proxyobject\/SimulationFactory.hpp>\n\n#include <sirikata\/oh\/ObjectHost.hpp>\n#include <sirikata\/proxyobject\/LightInfo.hpp>\n#include <sirikata\/oh\/ObjectHostProxyManager.hpp>\n#include <sirikata\/oh\/HostedObject.hpp>\n#include <sirikata\/oh\/SpaceIDMap.hpp>\n#include <sirikata\/core\/network\/IOServiceFactory.hpp>\n#include <sirikata\/core\/network\/IOService.hpp>\n#include <sirikata\/core\/util\/KnownServices.hpp>\n#include <Protocol_Persistence.pbj.hpp>\n#include <time.h>\n#include <boost\/thread.hpp>\n\n#include <sirikata\/core\/options\/Options.hpp>\n#include <sirikata\/core\/options\/CommonOptions.hpp>\n#include \"Options.hpp\"\n#include <sirikata\/oh\/Trace.hpp>\n\n#include <sirikata\/core\/network\/ServerIDMap.hpp>\n#include <sirikata\/core\/network\/NTPTimeSync.hpp>\n\n#include <sirikata\/core\/network\/SSTImpl.hpp>\n\n#include <sirikata\/oh\/ObjectHostContext.hpp>\n\n#include <sirikata\/oh\/ObjectFactory.hpp>\n\n#ifdef __GNUC__\n#include <fenv.h>\n#endif\n\nint main (int argc, char** argv) {\n using namespace Sirikata;\n\n InitOptions();\n Trace::Trace::InitOptions();\n OHTrace::InitOptions();\n InitCPPOHOptions();\n\n ParseOptions(argc, argv);\n\n PluginManager plugins;\n plugins.loadList( GetOptionValue<String>(OPT_PLUGINS) );\n plugins.loadList( GetOptionValue<String>(OPT_OH_PLUGINS) );\n\n String time_server = GetOptionValue<String>(\"time-server\");\n NTPTimeSync sync;\n if (time_server.size() > 0)\n sync.start(time_server);\n\n#ifdef __GNUC__\n#ifndef __APPLE__\n if (GetOptionValue<bool>(OPT_SIGFPE)) {\n feenableexcept(FE_DIVBYZERO|FE_INVALID|FE_OVERFLOW|FE_UNDERFLOW);\n }\n#endif\n#endif\n\n\n ObjectHostID oh_id = GetOptionValue<ObjectHostID>(\"ohid\");\n String trace_file = GetPerServerFile(STATS_OH_TRACE_FILE, oh_id);\n Trace::Trace* trace = new Trace::Trace(trace_file);\n\n String servermap_type = GetOptionValue<String>(\"servermap\");\n String servermap_options = GetOptionValue<String>(\"servermap-options\");\n ServerIDMap * server_id_map =\n ServerIDMapFactory::getSingleton().getConstructor(servermap_type)(servermap_options);\n\n srand( GetOptionValue<uint32>(\"rand-seed\") );\n\n Network::IOService* ios = Network::IOServiceFactory::makeIOService();\n Network::IOStrand* mainStrand = ios->createStrand();\n\n Time start_time = Timer::now(); \/\/ Just for stats in ObjectHostContext.\n Duration duration = Duration::zero(); \/\/ Indicates to run forever.\n ObjectHostContext* ctx = new ObjectHostContext(oh_id, ios, mainStrand, trace, start_time, duration);\n\n\n SSTConnectionManager* sstConnMgr = new SSTConnectionManager(ctx);\n\n SpaceIDMap *spaceMap = new SpaceIDMap;\n SpaceID mainSpace(GetOptionValue<UUID>(OPT_MAIN_SPACE));\n typedef std::map<std::string,std::string> SimpleSpaceIDMap;\n SimpleSpaceIDMap spaceIdMap(GetOptionValue<SimpleSpaceIDMap>(OPT_SPACEID_MAP));\n for (SimpleSpaceIDMap::iterator i = spaceIdMap.begin(),\n ie=spaceIdMap.end();\n i!=ie;\n ++i) {\n SpaceID newSpace(UUID(i->first,UUID::HumanReadable()));\n spaceMap->insert(newSpace, Network::Address::lexical_cast(i->second).as<Network::Address>());\n }\n\n ObjectHost *oh = new ObjectHost(ctx, spaceMap, ios, \"\");\n\n \/\/ Add all the spaces to the ObjectHost.\n \/\/ FIXME we're adding all spaces and having them use the same ServerIDMap\n \/\/ because its difficult to encode this in the options.\n \/\/ FIXME once this is working, the above SpaceIDMap (spaceMap) shouldn't be\n \/\/ used the same way -- it was only mapping to a single address instead of\n \/\/ an entire ServerIDMap.\n for (SimpleSpaceIDMap::iterator i = spaceIdMap.begin(),\n ie=spaceIdMap.end();\n i!=ie;\n ++i) {\n SpaceID newSpace(UUID(i->first,UUID::HumanReadable()));\n oh->addServerIDMap(newSpace, server_id_map);\n }\n\n\n \/\/ FIXME simple test example\n \/\/ This is the camera. We need it early on because other things depend on\n \/\/ having its ObjectHostProxyManager.\n HostedObjectPtr obj = HostedObject::construct<HostedObject>(ctx, oh, UUID::random(), true);\n obj->init();\n \/\/ Note: We currently just use the proxy manager for the default space. Not\n \/\/ sure if we should do something about handling multiple spaces.\n ProxyManagerPtr proxy_manager = obj->getProxyManager( mainSpace );\n\n typedef std::vector<TimeSteppedSimulation*> SimList;\n SimList sims;\n\n typedef std::list<String> StringList;\n StringList oh_sims(GetOptionValue<StringList>(OPT_OH_SIMS));\n for(StringList::iterator it = oh_sims.begin(); it != oh_sims.end(); it++)\n SILOG(cppoh,error,*it);\n for(StringList::iterator it = oh_sims.begin(); it != oh_sims.end(); it++) {\n String simName = *it;\n SILOG(cppoh,info,String(\"Initializing \") + simName);\n TimeSteppedSimulation *sim =\n SimulationFactory::getSingleton()\n .getConstructor ( simName ) ( ctx, proxy_manager.get(), \"\" );\n if (!sim) {\n SILOG(cppoh,error,String(\"Unable to load \") + simName + String(\" plugin. The PATH environment variable is ignored, so make sure you have copied the DLLs from dependencies\/ogre\/bin\/ into the current directory. Sorry about this!\"));\n std::cerr << \"Press enter to continue\" << std::endl;\n fgetc(stdin);\n exit(0);\n }\n else {\n oh->addListener(sim);\n SILOG(cppoh,info,String(\"Successfully initialized \") + simName);\n sims.push_back(sim);\n }\n }\n\n \/\/ FIXME\n obj->connect(\n mainSpace,\n Location( Vector3d::nil(), Quaternion::identity(), Vector3f::nil(), Vector3f::nil(), 0),\n BoundingSphere3f(Vector3f::nil(), 1.f),\n \"\",\n SolidAngle(0.00000001f),\n UUID::null());\n\n String objfactory_type = GetOptionValue<String>(OPT_OBJECT_FACTORY);\n String objfactory_options = GetOptionValue<String>(OPT_OBJECT_FACTORY_OPTS);\n ObjectFactory* obj_factory = NULL;\n if (!objfactory_type.empty()) {\n obj_factory = ObjectFactoryFactory::getSingleton().getConstructor(objfactory_type)(ctx, oh, mainSpace, objfactory_options);\n obj_factory->generate();\n }\n\n \/\/\/\/\/\/\/\/\/\/\/Go go go!! start of simulation\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n ctx->add(ctx);\n ctx->add(oh);\n ctx->add(sstConnMgr);\n for(SimList::iterator it = sims.begin(); it != sims.end(); it++)\n ctx->add(*it);\n ctx->run(1);\n\n\n obj.reset();\n\n ctx->cleanup();\n trace->prepareShutdown();\n\n proxy_manager.reset();\n delete oh;\n\n for(SimList::reverse_iterator it = sims.rbegin(); it != sims.rend(); it++) {\n delete *it;\n }\n sims.clear();\n plugins.gc();\n SimulationFactory::destroy();\n\n delete spaceMap;\n\n delete ctx;\n\n trace->shutdown();\n delete trace;\n trace = NULL;\n\n delete mainStrand;\n Network::IOServiceFactory::destroyIOService(ios);\n\n sync.stop();\n\n return 0;\n}\n<commit_msg>Only generate 'camera' object in cppoh if at least one simulation is requested.<commit_after>\/* Sirikata\n * main.cpp\n *\n * Copyright (c) 2008, Daniel Reiter Horn\n * All rights reserved.\n *\n * Redistribution and use in source and binary forms, with or without\n * modification, are permitted provided that the following conditions are\n * met:\n * * Redistributions of source code must retain the above copyright\n * notice, this list of conditions and the following disclaimer.\n * * Redistributions in binary form must reproduce the above copyright\n * notice, this list of conditions and the following disclaimer in\n * the documentation and\/or other materials provided with the\n * distribution.\n * * Neither the name of Sirikata nor the names of its contributors may\n * be used to endorse or promote products derived from this software\n * without specific prior written permission.\n *\n * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS \"AS\n * IS\" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED\n * TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A\n * PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER\n * OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,\n * EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,\n * PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR\n * PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF\n * LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING\n * NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS\n * SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.\n *\/\n\n#include <sirikata\/oh\/Platform.hpp>\n#include <sirikata\/core\/util\/PluginManager.hpp>\n#include <sirikata\/proxyobject\/SimulationFactory.hpp>\n\n#include <sirikata\/oh\/ObjectHost.hpp>\n#include <sirikata\/proxyobject\/LightInfo.hpp>\n#include <sirikata\/oh\/ObjectHostProxyManager.hpp>\n#include <sirikata\/oh\/HostedObject.hpp>\n#include <sirikata\/oh\/SpaceIDMap.hpp>\n#include <sirikata\/core\/network\/IOServiceFactory.hpp>\n#include <sirikata\/core\/network\/IOService.hpp>\n#include <sirikata\/core\/util\/KnownServices.hpp>\n#include <Protocol_Persistence.pbj.hpp>\n#include <time.h>\n#include <boost\/thread.hpp>\n\n#include <sirikata\/core\/options\/Options.hpp>\n#include <sirikata\/core\/options\/CommonOptions.hpp>\n#include \"Options.hpp\"\n#include <sirikata\/oh\/Trace.hpp>\n\n#include <sirikata\/core\/network\/ServerIDMap.hpp>\n#include <sirikata\/core\/network\/NTPTimeSync.hpp>\n\n#include <sirikata\/core\/network\/SSTImpl.hpp>\n\n#include <sirikata\/oh\/ObjectHostContext.hpp>\n\n#include <sirikata\/oh\/ObjectFactory.hpp>\n\n#ifdef __GNUC__\n#include <fenv.h>\n#endif\n\nint main (int argc, char** argv) {\n using namespace Sirikata;\n\n InitOptions();\n Trace::Trace::InitOptions();\n OHTrace::InitOptions();\n InitCPPOHOptions();\n\n ParseOptions(argc, argv);\n\n PluginManager plugins;\n plugins.loadList( GetOptionValue<String>(OPT_PLUGINS) );\n plugins.loadList( GetOptionValue<String>(OPT_OH_PLUGINS) );\n\n String time_server = GetOptionValue<String>(\"time-server\");\n NTPTimeSync sync;\n if (time_server.size() > 0)\n sync.start(time_server);\n\n#ifdef __GNUC__\n#ifndef __APPLE__\n if (GetOptionValue<bool>(OPT_SIGFPE)) {\n feenableexcept(FE_DIVBYZERO|FE_INVALID|FE_OVERFLOW|FE_UNDERFLOW);\n }\n#endif\n#endif\n\n\n ObjectHostID oh_id = GetOptionValue<ObjectHostID>(\"ohid\");\n String trace_file = GetPerServerFile(STATS_OH_TRACE_FILE, oh_id);\n Trace::Trace* trace = new Trace::Trace(trace_file);\n\n String servermap_type = GetOptionValue<String>(\"servermap\");\n String servermap_options = GetOptionValue<String>(\"servermap-options\");\n ServerIDMap * server_id_map =\n ServerIDMapFactory::getSingleton().getConstructor(servermap_type)(servermap_options);\n\n srand( GetOptionValue<uint32>(\"rand-seed\") );\n\n Network::IOService* ios = Network::IOServiceFactory::makeIOService();\n Network::IOStrand* mainStrand = ios->createStrand();\n\n Time start_time = Timer::now(); \/\/ Just for stats in ObjectHostContext.\n Duration duration = Duration::zero(); \/\/ Indicates to run forever.\n ObjectHostContext* ctx = new ObjectHostContext(oh_id, ios, mainStrand, trace, start_time, duration);\n\n\n SSTConnectionManager* sstConnMgr = new SSTConnectionManager(ctx);\n\n SpaceIDMap *spaceMap = new SpaceIDMap;\n SpaceID mainSpace(GetOptionValue<UUID>(OPT_MAIN_SPACE));\n typedef std::map<std::string,std::string> SimpleSpaceIDMap;\n SimpleSpaceIDMap spaceIdMap(GetOptionValue<SimpleSpaceIDMap>(OPT_SPACEID_MAP));\n for (SimpleSpaceIDMap::iterator i = spaceIdMap.begin(),\n ie=spaceIdMap.end();\n i!=ie;\n ++i) {\n SpaceID newSpace(UUID(i->first,UUID::HumanReadable()));\n spaceMap->insert(newSpace, Network::Address::lexical_cast(i->second).as<Network::Address>());\n }\n\n ObjectHost *oh = new ObjectHost(ctx, spaceMap, ios, \"\");\n\n \/\/ Add all the spaces to the ObjectHost.\n \/\/ FIXME we're adding all spaces and having them use the same ServerIDMap\n \/\/ because its difficult to encode this in the options.\n \/\/ FIXME once this is working, the above SpaceIDMap (spaceMap) shouldn't be\n \/\/ used the same way -- it was only mapping to a single address instead of\n \/\/ an entire ServerIDMap.\n for (SimpleSpaceIDMap::iterator i = spaceIdMap.begin(),\n ie=spaceIdMap.end();\n i!=ie;\n ++i) {\n SpaceID newSpace(UUID(i->first,UUID::HumanReadable()));\n oh->addServerIDMap(newSpace, server_id_map);\n }\n\n\n typedef std::list<String> StringList;\n StringList oh_sims(GetOptionValue<StringList>(OPT_OH_SIMS));\n\n \/\/ Note: We currently just use the proxy manager for the default space. Not\n \/\/ sure if we should do something about handling multiple spaces.\n ProxyManagerPtr proxy_manager;\n\n \/\/ FIXME simple test example\n \/\/ This is the camera. We need it early on because other things depend on\n \/\/ having its ObjectHostProxyManager.\n \/\/ Currently, we only create the \"camera\" object if there's a simulation\n \/\/ that will want it\n HostedObjectPtr obj;\n if (!oh_sims.empty()) {\n obj = HostedObject::construct<HostedObject>(ctx, oh, UUID::random(), true);\n obj->init();\n proxy_manager = obj->getProxyManager( mainSpace );\n }\n\n typedef std::vector<TimeSteppedSimulation*> SimList;\n SimList sims;\n\n for(StringList::iterator it = oh_sims.begin(); it != oh_sims.end(); it++)\n SILOG(cppoh,error,*it);\n for(StringList::iterator it = oh_sims.begin(); it != oh_sims.end(); it++) {\n String simName = *it;\n SILOG(cppoh,info,String(\"Initializing \") + simName);\n TimeSteppedSimulation *sim =\n SimulationFactory::getSingleton()\n .getConstructor ( simName ) ( ctx, proxy_manager.get(), \"\" );\n if (!sim) {\n SILOG(cppoh,error,String(\"Unable to load \") + simName + String(\" plugin. The PATH environment variable is ignored, so make sure you have copied the DLLs from dependencies\/ogre\/bin\/ into the current directory. Sorry about this!\"));\n std::cerr << \"Press enter to continue\" << std::endl;\n fgetc(stdin);\n exit(0);\n }\n else {\n oh->addListener(sim);\n SILOG(cppoh,info,String(\"Successfully initialized \") + simName);\n sims.push_back(sim);\n }\n }\n\n \/\/ FIXME\n if (obj) {\n obj->connect(\n mainSpace,\n Location( Vector3d::nil(), Quaternion::identity(), Vector3f::nil(), Vector3f::nil(), 0),\n BoundingSphere3f(Vector3f::nil(), 1.f),\n \"\",\n SolidAngle(0.00000001f),\n UUID::null());\n }\n\n String objfactory_type = GetOptionValue<String>(OPT_OBJECT_FACTORY);\n String objfactory_options = GetOptionValue<String>(OPT_OBJECT_FACTORY_OPTS);\n ObjectFactory* obj_factory = NULL;\n if (!objfactory_type.empty()) {\n obj_factory = ObjectFactoryFactory::getSingleton().getConstructor(objfactory_type)(ctx, oh, mainSpace, objfactory_options);\n obj_factory->generate();\n }\n\n \/\/\/\/\/\/\/\/\/\/\/Go go go!! start of simulation\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n ctx->add(ctx);\n ctx->add(oh);\n ctx->add(sstConnMgr);\n for(SimList::iterator it = sims.begin(); it != sims.end(); it++)\n ctx->add(*it);\n ctx->run(1);\n\n\n obj.reset();\n\n ctx->cleanup();\n trace->prepareShutdown();\n\n proxy_manager.reset();\n delete oh;\n\n for(SimList::reverse_iterator it = sims.rbegin(); it != sims.rend(); it++) {\n delete *it;\n }\n sims.clear();\n plugins.gc();\n SimulationFactory::destroy();\n\n delete spaceMap;\n\n delete ctx;\n\n trace->shutdown();\n delete trace;\n trace = NULL;\n\n delete mainStrand;\n Network::IOServiceFactory::destroyIOService(ios);\n\n sync.stop();\n\n return 0;\n}\n<|endoftext|>"} {"text":"<commit_before>#pragma once\n\n#include <agency\/detail\/config.hpp>\n#include <agency\/execution_policy.hpp>\n#include <agency\/flattened_executor.hpp>\n#include <agency\/detail\/ignore.hpp>\n#include <type_traits>\n#include <agency\/cuda\/execution_agent.hpp>\n#include <agency\/cuda\/grid_executor.hpp>\n#include <agency\/cuda\/block_executor.hpp>\n#include <agency\/cuda\/parallel_executor.hpp>\n#include <agency\/cuda\/nested_executor.hpp>\n#include <agency\/cuda\/detail\/bind.hpp>\n\n\nnamespace agency\n{\nnamespace cuda\n{\nnamespace detail\n{\n\n\ntemplate<class Function, class ExecutionAgentTraits, class ExecutorShape, class AgentShape>\nstruct execute_agent_functor\n{\n __agency_hd_warning_disable__\n __host__ __device__\n execute_agent_functor(const Function& f,\n const typename ExecutionAgentTraits::param_type& param,\n const ExecutorShape& executor_shape,\n const AgentShape& agent_shape)\n : f_(f),\n param_(param),\n executor_shape_(executor_shape),\n agent_shape_(agent_shape)\n {}\n\n template<class ExecutorIndex, class SharedParam>\n __device__\n void operator()(ExecutorIndex executor_idx, SharedParam&& shared_params) const\n {\n using agent_index_type = typename ExecutionAgentTraits::index_type;\n auto agent_idx = agency::detail::index_cast<agent_index_type>(executor_idx, executor_shape_, agent_shape_);\n\n ExecutionAgentTraits::execute(f_, agent_idx, param_, shared_params);\n }\n\n template<class ExecutorIndex, class SharedParam>\n __device__\n void operator()(ExecutorIndex executor_idx, SharedParam&& shared_params)\n {\n using agent_index_type = typename ExecutionAgentTraits::index_type;\n auto agent_idx = agency::detail::index_cast<agent_index_type>(executor_idx, executor_shape_, agent_shape_);\n\n ExecutionAgentTraits::execute(f_, agent_idx, param_, shared_params);\n }\n\n\n template<class ExecutorIndex>\n __device__\n void operator()(ExecutorIndex executor_idx, decltype(agency::detail::ignore)) const\n {\n using agent_index_type = typename ExecutionAgentTraits::index_type;\n auto agent_idx = agency::detail::index_cast<agent_index_type>(executor_idx, executor_shape_, agent_shape_);\n\n ExecutionAgentTraits::execute(f_, agent_idx, param_);\n }\n\n template<class ExecutorIndex>\n __device__\n void operator()(ExecutorIndex executor_idx, decltype(agency::detail::ignore))\n {\n using agent_index_type = typename ExecutionAgentTraits::index_type;\n auto agent_idx = agency::detail::index_cast<agent_index_type>(executor_idx, executor_shape_, agent_shape_);\n\n ExecutionAgentTraits::execute(f_, agent_idx, param_);\n }\n\n\n template<class ExecutorIndex>\n __device__\n void operator()(ExecutorIndex executor_idx) const\n {\n using agent_index_type = typename ExecutionAgentTraits::index_type;\n auto agent_idx = agency::detail::index_cast<agent_index_type>(executor_idx, executor_shape_, agent_shape_);\n\n ExecutionAgentTraits::execute(f_, agent_idx, param_);\n }\n\n template<class ExecutorIndex>\n __device__\n void operator()(ExecutorIndex executor_idx)\n {\n using agent_index_type = typename ExecutionAgentTraits::index_type;\n auto agent_idx = agency::detail::index_cast<agent_index_type>(executor_idx, executor_shape_, agent_shape_);\n\n ExecutionAgentTraits::execute(f_, agent_idx, param_);\n }\n\n Function f_;\n typename ExecutionAgentTraits::param_type param_;\n ExecutorShape executor_shape_;\n AgentShape agent_shape_;\n};\n\n\ntemplate<class ExecutionAgentTraits, class Function, class ExecutorShape, class AgentShape>\n__host__ __device__\nexecute_agent_functor<Function, ExecutionAgentTraits, ExecutorShape, AgentShape>\n make_execute_agent_functor(const Function& f,const typename ExecutionAgentTraits::param_type& param, \n const ExecutorShape& executor_shape, const AgentShape& agent_shape)\n{\n return execute_agent_functor<Function,ExecutionAgentTraits,ExecutorShape,AgentShape>(f,param,executor_shape,agent_shape);\n}\n\n\ntemplate<class ExecutionPolicy, class Function>\nvoid bulk_invoke(const ExecutionPolicy& exec, Function&& f)\n{\n using execution_agent_type = typename ExecutionPolicy::execution_agent_type;\n using traits = execution_agent_traits<execution_agent_type>;\n\n auto param = exec.param();\n auto agent_shape = traits::domain(param).shape();\n auto shared_init = traits::make_shared_initializer(param);\n\n using executor_type = typename ExecutionPolicy::executor_type;\n using executor_index_type = typename executor_traits<executor_type>::index_type;\n\n \/\/ convert the shape of the agent into the type of the executor's shape\n using executor_shape_type = typename executor_traits<executor_type>::shape_type;\n executor_shape_type executor_shape = agency::detail::shape_cast<executor_shape_type>(agent_shape);\n\n auto execute_me = make_execute_agent_functor<traits>(f, param, executor_shape, agent_shape);\n\n return executor_traits<executor_type>::bulk_invoke(exec.executor(), execute_me, executor_shape, shared_init);\n}\n\n\n\/\/ add basic_execution_policy to allow us to catch its derivations as overloads of bulk_invoke, etc.\ntemplate<class ExecutionAgent,\n class BulkExecutor,\n class ExecutionCategory = typename execution_agent_traits<ExecutionAgent>::execution_category,\n class DerivedExecutionPolicy = void>\nclass basic_execution_policy : public agency::detail::basic_execution_policy<ExecutionAgent,BulkExecutor,ExecutionCategory,DerivedExecutionPolicy>\n{\n public:\n using agency::detail::basic_execution_policy<ExecutionAgent,BulkExecutor,ExecutionCategory,DerivedExecutionPolicy>::basic_execution_policy;\n}; \/\/ end basic_execution_policy\n\n\n} \/\/ end detail\n\n\nclass parallel_execution_policy : public detail::basic_execution_policy<cuda::parallel_agent, cuda::parallel_executor, parallel_execution_tag, parallel_execution_policy>\n{\n public:\n using detail::basic_execution_policy<cuda::parallel_agent, cuda::parallel_executor, parallel_execution_tag, parallel_execution_policy>::basic_execution_policy;\n};\n\n\nconst parallel_execution_policy par{};\n\n\nclass concurrent_execution_policy : public detail::basic_execution_policy<cuda::concurrent_agent, cuda::block_executor, concurrent_execution_tag, concurrent_execution_policy>\n{\n public:\n using detail::basic_execution_policy<cuda::concurrent_agent, cuda::block_executor, concurrent_execution_tag, concurrent_execution_policy>::basic_execution_policy;\n};\n\n\nconst concurrent_execution_policy con{};\n\n\ntemplate<class ExecutionPolicy, class Function, class... Args>\nvoid bulk_invoke(const ExecutionPolicy& exec, Function&& f, Args&&... args)\n{\n auto g = detail::bind(f, thrust::placeholders::_1, std::forward<Args>(args)...);\n detail::bulk_invoke(exec, g);\n}\n\n\ntemplate<class ExecutionPolicy, class Function, class... Args>\nstd::future<void> bulk_async(const ExecutionPolicy& exec, Function&& f, Args&&... args)\n{\n std::cout << \"cuda::bulk_async(ExecutionPolicy): implement me!\" << std::endl;\n return agency::detail::make_ready_future();\n}\n\n\nnamespace detail\n{\n\n\n\/\/ specialize rebind_executor for cuda's executor types\ntemplate<class ExecutionPolicy, class Enable = void>\nstruct rebind_executor_impl;\n\n\ntemplate<class ExecutionPolicy>\nstruct rebind_executor_impl<\n ExecutionPolicy,\n typename std::enable_if<\n std::is_same<\n typename ExecutionPolicy::execution_category,\n parallel_execution_tag\n >::value\n >::type\n>\n{\n using type = cuda::parallel_execution_policy;\n};\n\n\n\/\/ specialize rebind_executor for cuda::block_executor\ntemplate<class ExecutionPolicy>\nstruct rebind_executor_impl<\n ExecutionPolicy,\n typename std::enable_if<\n std::is_same<\n typename ExecutionPolicy::execution_category,\n concurrent_execution_tag\n >::value\n >::type\n>\n{\n using type = cuda::concurrent_execution_policy;\n};\n\n\n} \/\/ end detail\n} \/\/ end cuda\n\n\n\/\/ specialize is_execution_policy\ntemplate<>\nstruct is_execution_policy<cuda::parallel_execution_policy> : std::true_type {};\n\n\ntemplate<>\nstruct is_execution_policy<cuda::concurrent_execution_policy> : std::true_type {};\n\n\ntemplate<class ExecutionPolicy>\nstruct rebind_executor<ExecutionPolicy, cuda::grid_executor>\n{\n using type = typename cuda::detail::rebind_executor_impl<ExecutionPolicy>::type;\n};\n\n\ntemplate<class ExecutionPolicy>\nstruct rebind_executor<ExecutionPolicy, cuda::block_executor>\n{\n using type = typename cuda::detail::rebind_executor_impl<ExecutionPolicy>::type;\n};\n\n\n\/\/ the following functions are overloads of agency::bulk_invoke & agency::bulk_async\n\/\/ for cuda execution policies. they forward along the to cuda::bulk_invoke & cuda::bulk_async\n\/\/ we introduce these overloads to work around the use of lambdas in agency::bulk_invoke & agency::bulk_async\n\ntemplate<class ExecutionAgent, class BulkExecutor, class ExecutionCategory, class DerivedExecutionPolicy, class Function, class... Args>\nvoid bulk_invoke(cuda::detail::basic_execution_policy<ExecutionAgent,BulkExecutor,ExecutionCategory,DerivedExecutionPolicy>&& exec,\n Function&& f,\n Args&&... args)\n{\n return cuda::bulk_invoke(exec, std::forward<Function>(f), std::forward<Args>(args)...);\n}\n\ntemplate<class ExecutionAgent, class BulkExecutor, class ExecutionCategory, class DerivedExecutionPolicy, class Function, class... Args>\nvoid bulk_invoke(cuda::detail::basic_execution_policy<ExecutionAgent,BulkExecutor,ExecutionCategory,DerivedExecutionPolicy>& exec,\n Function&& f,\n Args&&... args)\n{\n return cuda::bulk_invoke(exec, std::forward<Function>(f), std::forward<Args>(args)...);\n}\n\ntemplate<class ExecutionAgent, class BulkExecutor, class ExecutionCategory, class DerivedExecutionPolicy, class Function, class... Args>\nvoid bulk_invoke(const cuda::detail::basic_execution_policy<ExecutionAgent,BulkExecutor,ExecutionCategory,DerivedExecutionPolicy>& exec,\n Function&& f,\n Args&&... args)\n{\n return cuda::bulk_invoke(exec, std::forward<Function>(f), std::forward<Args>(args)...);\n}\n\n\ntemplate<class Function, class... Args>\nvoid bulk_invoke(cuda::parallel_execution_policy&& exec,\n Function&& f,\n Args&&... args)\n{\n return cuda::bulk_invoke(exec, std::forward<Function>(f), std::forward<Args>(args)...);\n}\n\ntemplate<class Function, class... Args>\nvoid bulk_invoke(cuda::parallel_execution_policy& exec,\n Function&& f,\n Args&&... args)\n{\n return cuda::bulk_invoke(exec, std::forward<Function>(f), std::forward<Args>(args)...);\n}\n\ntemplate<class Function, class... Args>\nvoid bulk_invoke(const cuda::parallel_execution_policy& exec,\n Function&& f,\n Args&&... args)\n{\n return cuda::bulk_invoke(exec, std::forward<Function>(f), std::forward<Args>(args)...);\n}\n\n\ntemplate<class Function, class... Args>\nvoid bulk_invoke(cuda::concurrent_execution_policy&& exec,\n Function&& f,\n Args&&... args)\n{\n return cuda::bulk_invoke(exec, std::forward<Function>(f), std::forward<Args>(args)...);\n}\n\ntemplate<class Function, class... Args>\nvoid bulk_invoke(cuda::concurrent_execution_policy& exec,\n Function&& f,\n Args&&... args)\n{\n return cuda::bulk_invoke(exec, std::forward<Function>(f), std::forward<Args>(args)...);\n}\n\ntemplate<class Function, class... Args>\nvoid bulk_invoke(const cuda::concurrent_execution_policy& exec,\n Function&& f,\n Args&&... args)\n{\n return cuda::bulk_invoke(exec, std::forward<Function>(f), std::forward<Args>(args)...);\n}\n\n\ntemplate<class ExecutionAgent, class BulkExecutor, class ExecutionCategory, class DerivedExecutionPolicy, class Function, class... Args>\nstd::future<void> bulk_async(cuda::detail::basic_execution_policy<ExecutionAgent,BulkExecutor,ExecutionCategory,DerivedExecutionPolicy>&& exec, Function&& f, Args&&... args)\n{\n return cuda::bulk_async(exec, std::forward<Function>(f), std::forward<Args>(args)...);\n}\n\ntemplate<class ExecutionAgent, class BulkExecutor, class ExecutionCategory, class DerivedExecutionPolicy, class Function, class... Args>\nstd::future<void> bulk_async(cuda::detail::basic_execution_policy<ExecutionAgent,BulkExecutor,ExecutionCategory,DerivedExecutionPolicy>& exec, Function&& f, Args&&... args)\n{\n return cuda::bulk_async(exec, std::forward<Function>(f), std::forward<Args>(args)...);\n}\n\ntemplate<class ExecutionAgent, class BulkExecutor, class ExecutionCategory, class DerivedExecutionPolicy, class Function, class... Args>\nstd::future<void> bulk_async(const cuda::detail::basic_execution_policy<ExecutionAgent,BulkExecutor,ExecutionCategory,DerivedExecutionPolicy>& exec, Function&& f, Args&&... args)\n{\n return cuda::bulk_async(exec, std::forward<Function>(f), std::forward<Args>(args)...);\n}\n\n\ntemplate<class Function, class... Args>\nvoid bulk_async(cuda::parallel_execution_policy&& exec,\n Function&& f,\n Args&&... args)\n{\n return cuda::bulk_async(exec, std::forward<Function>(f), std::forward<Args>(args)...);\n}\n\ntemplate<class Function, class... Args>\nvoid bulk_async(cuda::parallel_execution_policy& exec,\n Function&& f,\n Args&&... args)\n{\n return cuda::bulk_async(exec, std::forward<Function>(f), std::forward<Args>(args)...);\n}\n\ntemplate<class Function, class... Args>\nvoid bulk_async(const cuda::parallel_execution_policy& exec,\n Function&& f,\n Args&&... args)\n{\n return cuda::bulk_async(exec, std::forward<Function>(f), std::forward<Args>(args)...);\n}\n\n\ntemplate<class Function, class... Args>\nvoid bulk_async(cuda::concurrent_execution_policy&& exec,\n Function&& f,\n Args&&... args)\n{\n return cuda::bulk_async(exec, std::forward<Function>(f), std::forward<Args>(args)...);\n}\n\ntemplate<class Function, class... Args>\nvoid bulk_async(cuda::concurrent_execution_policy& exec,\n Function&& f,\n Args&&... args)\n{\n return cuda::bulk_async(exec, std::forward<Function>(f), std::forward<Args>(args)...);\n}\n\ntemplate<class Function, class... Args>\nvoid bulk_async(const cuda::concurrent_execution_policy& exec,\n Function&& f,\n Args&&... args)\n{\n return cuda::bulk_async(exec, std::forward<Function>(f), std::forward<Args>(args)...);\n}\n\n\n} \/\/ end agency\n\n<commit_msg>Fix the type passed to the DerivedPolicy parameter of agency::detail::basic_execution_policy<commit_after>#pragma once\n\n#include <agency\/detail\/config.hpp>\n#include <agency\/execution_policy.hpp>\n#include <agency\/flattened_executor.hpp>\n#include <agency\/detail\/ignore.hpp>\n#include <type_traits>\n#include <agency\/cuda\/execution_agent.hpp>\n#include <agency\/cuda\/grid_executor.hpp>\n#include <agency\/cuda\/block_executor.hpp>\n#include <agency\/cuda\/parallel_executor.hpp>\n#include <agency\/cuda\/nested_executor.hpp>\n#include <agency\/cuda\/detail\/bind.hpp>\n\n\nnamespace agency\n{\nnamespace cuda\n{\nnamespace detail\n{\n\n\ntemplate<class Function, class ExecutionAgentTraits, class ExecutorShape, class AgentShape>\nstruct execute_agent_functor\n{\n __agency_hd_warning_disable__\n __host__ __device__\n execute_agent_functor(const Function& f,\n const typename ExecutionAgentTraits::param_type& param,\n const ExecutorShape& executor_shape,\n const AgentShape& agent_shape)\n : f_(f),\n param_(param),\n executor_shape_(executor_shape),\n agent_shape_(agent_shape)\n {}\n\n template<class ExecutorIndex, class SharedParam>\n __device__\n void operator()(ExecutorIndex executor_idx, SharedParam&& shared_params) const\n {\n using agent_index_type = typename ExecutionAgentTraits::index_type;\n auto agent_idx = agency::detail::index_cast<agent_index_type>(executor_idx, executor_shape_, agent_shape_);\n\n ExecutionAgentTraits::execute(f_, agent_idx, param_, shared_params);\n }\n\n template<class ExecutorIndex, class SharedParam>\n __device__\n void operator()(ExecutorIndex executor_idx, SharedParam&& shared_params)\n {\n using agent_index_type = typename ExecutionAgentTraits::index_type;\n auto agent_idx = agency::detail::index_cast<agent_index_type>(executor_idx, executor_shape_, agent_shape_);\n\n ExecutionAgentTraits::execute(f_, agent_idx, param_, shared_params);\n }\n\n\n template<class ExecutorIndex>\n __device__\n void operator()(ExecutorIndex executor_idx, decltype(agency::detail::ignore)) const\n {\n using agent_index_type = typename ExecutionAgentTraits::index_type;\n auto agent_idx = agency::detail::index_cast<agent_index_type>(executor_idx, executor_shape_, agent_shape_);\n\n ExecutionAgentTraits::execute(f_, agent_idx, param_);\n }\n\n template<class ExecutorIndex>\n __device__\n void operator()(ExecutorIndex executor_idx, decltype(agency::detail::ignore))\n {\n using agent_index_type = typename ExecutionAgentTraits::index_type;\n auto agent_idx = agency::detail::index_cast<agent_index_type>(executor_idx, executor_shape_, agent_shape_);\n\n ExecutionAgentTraits::execute(f_, agent_idx, param_);\n }\n\n\n template<class ExecutorIndex>\n __device__\n void operator()(ExecutorIndex executor_idx) const\n {\n using agent_index_type = typename ExecutionAgentTraits::index_type;\n auto agent_idx = agency::detail::index_cast<agent_index_type>(executor_idx, executor_shape_, agent_shape_);\n\n ExecutionAgentTraits::execute(f_, agent_idx, param_);\n }\n\n template<class ExecutorIndex>\n __device__\n void operator()(ExecutorIndex executor_idx)\n {\n using agent_index_type = typename ExecutionAgentTraits::index_type;\n auto agent_idx = agency::detail::index_cast<agent_index_type>(executor_idx, executor_shape_, agent_shape_);\n\n ExecutionAgentTraits::execute(f_, agent_idx, param_);\n }\n\n Function f_;\n typename ExecutionAgentTraits::param_type param_;\n ExecutorShape executor_shape_;\n AgentShape agent_shape_;\n};\n\n\ntemplate<class ExecutionAgentTraits, class Function, class ExecutorShape, class AgentShape>\n__host__ __device__\nexecute_agent_functor<Function, ExecutionAgentTraits, ExecutorShape, AgentShape>\n make_execute_agent_functor(const Function& f,const typename ExecutionAgentTraits::param_type& param, \n const ExecutorShape& executor_shape, const AgentShape& agent_shape)\n{\n return execute_agent_functor<Function,ExecutionAgentTraits,ExecutorShape,AgentShape>(f,param,executor_shape,agent_shape);\n}\n\n\ntemplate<class ExecutionPolicy, class Function>\nvoid bulk_invoke_impl(const ExecutionPolicy& exec, Function&& f)\n{\n using execution_agent_type = typename ExecutionPolicy::execution_agent_type;\n using traits = execution_agent_traits<execution_agent_type>;\n\n auto param = exec.param();\n auto agent_shape = traits::domain(param).shape();\n auto shared_init = traits::make_shared_initializer(param);\n\n using executor_type = typename ExecutionPolicy::executor_type;\n using executor_index_type = typename executor_traits<executor_type>::index_type;\n\n \/\/ convert the shape of the agent into the type of the executor's shape\n using executor_shape_type = typename executor_traits<executor_type>::shape_type;\n executor_shape_type executor_shape = agency::detail::shape_cast<executor_shape_type>(agent_shape);\n\n auto execute_me = make_execute_agent_functor<traits>(f, param, executor_shape, agent_shape);\n\n return executor_traits<executor_type>::bulk_invoke(exec.executor(), execute_me, executor_shape, shared_init);\n}\n\n\n\/\/ add basic_execution_policy to allow us to catch its derivations as overloads of bulk_invoke, etc.\ntemplate<class ExecutionAgent,\n class BulkExecutor,\n class ExecutionCategory = typename execution_agent_traits<ExecutionAgent>::execution_category,\n class DerivedExecutionPolicy = void>\nclass basic_execution_policy :\n public agency::detail::basic_execution_policy<\n ExecutionAgent,\n BulkExecutor,\n ExecutionCategory,\n typename std::conditional<\n std::is_void<DerivedExecutionPolicy>::value,\n basic_execution_policy<ExecutionAgent,BulkExecutor,ExecutionCategory,DerivedExecutionPolicy>,\n DerivedExecutionPolicy\n >::type\n>\n{\n public:\n \/\/ inherit the base class's constructors\n using agency::detail::basic_execution_policy<\n ExecutionAgent,\n BulkExecutor,\n ExecutionCategory,\n typename std::conditional<\n std::is_void<DerivedExecutionPolicy>::value,\n basic_execution_policy<ExecutionAgent,BulkExecutor,ExecutionCategory,DerivedExecutionPolicy>,\n DerivedExecutionPolicy\n >::type\n >::basic_execution_policy;\n}; \/\/ end basic_execution_policy\n\n\n} \/\/ end detail\n\n\nclass parallel_execution_policy : public detail::basic_execution_policy<cuda::parallel_agent, cuda::parallel_executor, parallel_execution_tag, parallel_execution_policy>\n{\n public:\n using detail::basic_execution_policy<cuda::parallel_agent, cuda::parallel_executor, parallel_execution_tag, parallel_execution_policy>::basic_execution_policy;\n};\n\n\nconst parallel_execution_policy par{};\n\n\nclass concurrent_execution_policy : public detail::basic_execution_policy<cuda::concurrent_agent, cuda::block_executor, concurrent_execution_tag, concurrent_execution_policy>\n{\n public:\n using detail::basic_execution_policy<cuda::concurrent_agent, cuda::block_executor, concurrent_execution_tag, concurrent_execution_policy>::basic_execution_policy;\n};\n\n\nconst concurrent_execution_policy con{};\n\n\ntemplate<class ExecutionPolicy, class Function, class... Args>\nvoid bulk_invoke(const ExecutionPolicy& exec, Function&& f, Args&&... args)\n{\n auto g = detail::bind(f, thrust::placeholders::_1, std::forward<Args>(args)...);\n detail::bulk_invoke_impl(exec, g);\n}\n\n\ntemplate<class ExecutionPolicy, class Function, class... Args>\nstd::future<void> bulk_async(const ExecutionPolicy& exec, Function&& f, Args&&... args)\n{\n std::cout << \"cuda::bulk_async(ExecutionPolicy): implement me!\" << std::endl;\n return agency::detail::make_ready_future();\n}\n\n\nnamespace detail\n{\n\n\n\/\/ specialize rebind_executor for cuda's executor types\ntemplate<class ExecutionPolicy, class Enable = void>\nstruct rebind_executor_impl;\n\n\ntemplate<class ExecutionPolicy>\nstruct rebind_executor_impl<\n ExecutionPolicy,\n typename std::enable_if<\n std::is_same<\n typename ExecutionPolicy::execution_category,\n parallel_execution_tag\n >::value\n >::type\n>\n{\n using type = cuda::parallel_execution_policy;\n};\n\n\n\/\/ specialize rebind_executor for cuda::block_executor\ntemplate<class ExecutionPolicy>\nstruct rebind_executor_impl<\n ExecutionPolicy,\n typename std::enable_if<\n std::is_same<\n typename ExecutionPolicy::execution_category,\n concurrent_execution_tag\n >::value\n >::type\n>\n{\n using type = cuda::concurrent_execution_policy;\n};\n\n\n} \/\/ end detail\n} \/\/ end cuda\n\n\n\/\/ specialize is_execution_policy\ntemplate<>\nstruct is_execution_policy<cuda::parallel_execution_policy> : std::true_type {};\n\n\ntemplate<>\nstruct is_execution_policy<cuda::concurrent_execution_policy> : std::true_type {};\n\n\ntemplate<class ExecutionPolicy>\nstruct rebind_executor<ExecutionPolicy, cuda::grid_executor>\n{\n using type = typename cuda::detail::rebind_executor_impl<ExecutionPolicy>::type;\n};\n\n\ntemplate<class ExecutionPolicy>\nstruct rebind_executor<ExecutionPolicy, cuda::block_executor>\n{\n using type = typename cuda::detail::rebind_executor_impl<ExecutionPolicy>::type;\n};\n\n\n\/\/ the following functions are overloads of agency::bulk_invoke & agency::bulk_async\n\/\/ for cuda execution policies. they forward along the to cuda::bulk_invoke & cuda::bulk_async\n\/\/ we introduce these overloads to work around the use of lambdas in agency::bulk_invoke & agency::bulk_async\n\ntemplate<class ExecutionAgent, class BulkExecutor, class ExecutionCategory, class DerivedExecutionPolicy, class Function, class... Args>\nvoid bulk_invoke(cuda::detail::basic_execution_policy<ExecutionAgent,BulkExecutor,ExecutionCategory,DerivedExecutionPolicy>&& exec,\n Function&& f,\n Args&&... args)\n{\n return cuda::bulk_invoke(exec, std::forward<Function>(f), std::forward<Args>(args)...);\n}\n\ntemplate<class ExecutionAgent, class BulkExecutor, class ExecutionCategory, class DerivedExecutionPolicy, class Function, class... Args>\nvoid bulk_invoke(cuda::detail::basic_execution_policy<ExecutionAgent,BulkExecutor,ExecutionCategory,DerivedExecutionPolicy>& exec,\n Function&& f,\n Args&&... args)\n{\n return cuda::bulk_invoke(exec, std::forward<Function>(f), std::forward<Args>(args)...);\n}\n\ntemplate<class ExecutionAgent, class BulkExecutor, class ExecutionCategory, class DerivedExecutionPolicy, class Function, class... Args>\nvoid bulk_invoke(const cuda::detail::basic_execution_policy<ExecutionAgent,BulkExecutor,ExecutionCategory,DerivedExecutionPolicy>& exec,\n Function&& f,\n Args&&... args)\n{\n return cuda::bulk_invoke(exec, std::forward<Function>(f), std::forward<Args>(args)...);\n}\n\n\ntemplate<class Function, class... Args>\nvoid bulk_invoke(cuda::parallel_execution_policy&& exec,\n Function&& f,\n Args&&... args)\n{\n return cuda::bulk_invoke(exec, std::forward<Function>(f), std::forward<Args>(args)...);\n}\n\ntemplate<class Function, class... Args>\nvoid bulk_invoke(cuda::parallel_execution_policy& exec,\n Function&& f,\n Args&&... args)\n{\n return cuda::bulk_invoke(exec, std::forward<Function>(f), std::forward<Args>(args)...);\n}\n\ntemplate<class Function, class... Args>\nvoid bulk_invoke(const cuda::parallel_execution_policy& exec,\n Function&& f,\n Args&&... args)\n{\n return cuda::bulk_invoke(exec, std::forward<Function>(f), std::forward<Args>(args)...);\n}\n\n\ntemplate<class Function, class... Args>\nvoid bulk_invoke(cuda::concurrent_execution_policy&& exec,\n Function&& f,\n Args&&... args)\n{\n return cuda::bulk_invoke(exec, std::forward<Function>(f), std::forward<Args>(args)...);\n}\n\ntemplate<class Function, class... Args>\nvoid bulk_invoke(cuda::concurrent_execution_policy& exec,\n Function&& f,\n Args&&... args)\n{\n return cuda::bulk_invoke(exec, std::forward<Function>(f), std::forward<Args>(args)...);\n}\n\ntemplate<class Function, class... Args>\nvoid bulk_invoke(const cuda::concurrent_execution_policy& exec,\n Function&& f,\n Args&&... args)\n{\n return cuda::bulk_invoke(exec, std::forward<Function>(f), std::forward<Args>(args)...);\n}\n\n\ntemplate<class ExecutionAgent, class BulkExecutor, class ExecutionCategory, class DerivedExecutionPolicy, class Function, class... Args>\nstd::future<void> bulk_async(cuda::detail::basic_execution_policy<ExecutionAgent,BulkExecutor,ExecutionCategory,DerivedExecutionPolicy>&& exec, Function&& f, Args&&... args)\n{\n return cuda::bulk_async(exec, std::forward<Function>(f), std::forward<Args>(args)...);\n}\n\ntemplate<class ExecutionAgent, class BulkExecutor, class ExecutionCategory, class DerivedExecutionPolicy, class Function, class... Args>\nstd::future<void> bulk_async(cuda::detail::basic_execution_policy<ExecutionAgent,BulkExecutor,ExecutionCategory,DerivedExecutionPolicy>& exec, Function&& f, Args&&... args)\n{\n return cuda::bulk_async(exec, std::forward<Function>(f), std::forward<Args>(args)...);\n}\n\ntemplate<class ExecutionAgent, class BulkExecutor, class ExecutionCategory, class DerivedExecutionPolicy, class Function, class... Args>\nstd::future<void> bulk_async(const cuda::detail::basic_execution_policy<ExecutionAgent,BulkExecutor,ExecutionCategory,DerivedExecutionPolicy>& exec, Function&& f, Args&&... args)\n{\n return cuda::bulk_async(exec, std::forward<Function>(f), std::forward<Args>(args)...);\n}\n\n\ntemplate<class Function, class... Args>\nvoid bulk_async(cuda::parallel_execution_policy&& exec,\n Function&& f,\n Args&&... args)\n{\n return cuda::bulk_async(exec, std::forward<Function>(f), std::forward<Args>(args)...);\n}\n\ntemplate<class Function, class... Args>\nvoid bulk_async(cuda::parallel_execution_policy& exec,\n Function&& f,\n Args&&... args)\n{\n return cuda::bulk_async(exec, std::forward<Function>(f), std::forward<Args>(args)...);\n}\n\ntemplate<class Function, class... Args>\nvoid bulk_async(const cuda::parallel_execution_policy& exec,\n Function&& f,\n Args&&... args)\n{\n return cuda::bulk_async(exec, std::forward<Function>(f), std::forward<Args>(args)...);\n}\n\n\ntemplate<class Function, class... Args>\nvoid bulk_async(cuda::concurrent_execution_policy&& exec,\n Function&& f,\n Args&&... args)\n{\n return cuda::bulk_async(exec, std::forward<Function>(f), std::forward<Args>(args)...);\n}\n\ntemplate<class Function, class... Args>\nvoid bulk_async(cuda::concurrent_execution_policy& exec,\n Function&& f,\n Args&&... args)\n{\n return cuda::bulk_async(exec, std::forward<Function>(f), std::forward<Args>(args)...);\n}\n\ntemplate<class Function, class... Args>\nvoid bulk_async(const cuda::concurrent_execution_policy& exec,\n Function&& f,\n Args&&... args)\n{\n return cuda::bulk_async(exec, std::forward<Function>(f), std::forward<Args>(args)...);\n}\n\n\n} \/\/ end agency\n\n<|endoftext|>"} {"text":"<commit_before>\/*************************************************************************\n *\n * OpenOffice.org - a multi-platform office productivity suite\n *\n * $RCSfile: gcach_ftyp.hxx,v $\n *\n * $Revision: 1.35 $\n *\n * last change: $Author: hr $ $Date: 2006-04-19 13:56: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 _SV_GCACHFTYP_HXX\n#define _SV_GCACHFTYP_HXX\n\n#include <glyphcache.hxx>\n#include <rtl\/textcvt.h>\n\n#include <ft2build.h>\n#include FT_FREETYPE_H\nclass FreetypeServerFont;\nstruct FT_GlyphRec_;\n\n\/\/ -----------------------------------------------------------------------\n\n\/\/ FtFontFile has the responsibility that a font file is only mapped once.\n\/\/ (#86621#) the old directly ft-managed solution caused it to be mapped\n\/\/ in up to nTTC*nSizes*nOrientation*nSynthetic times\nclass FtFontFile\n{\npublic:\n static FtFontFile* FindFontFile( const ::rtl::OString& rNativeFileName );\n\n bool Map();\n void Unmap();\n\n const unsigned char* GetBuffer() const { return mpFileMap; }\n int GetFileSize() const { return mnFileSize; }\n const ::rtl::OString* GetFileName() const { return &maNativeFileName; }\n int GetLangBoost() const { return mnLangBoost; }\n\nprivate:\n FtFontFile( const ::rtl::OString& rNativeFileName );\n\n const ::rtl::OString maNativeFileName;\n const unsigned char* mpFileMap;\n int mnFileSize;\n int mnRefCount;\n int mnLangBoost;\n};\n\n\/\/ -----------------------------------------------------------------------\n\n\/\/ FtFontInfo corresponds to an unscaled font face\nclass FtFontInfo\n{\npublic:\n FtFontInfo( const ImplDevFontAttributes&,\n const ::rtl::OString& rNativeFileName,\n int nFaceNum, sal_IntPtr nFontId, int nSynthetic,\n const ExtraKernInfo* );\n ~FtFontInfo();\n\n const unsigned char* GetTable( const char*, ULONG* pLength=0 ) const;\n\n FT_FaceRec_* GetFaceFT();\n void ReleaseFaceFT( FT_FaceRec_* );\n\n const ::rtl::OString* GetFontFileName() const { return mpFontFile->GetFileName(); }\n int GetFaceNum() const { return mnFaceNum; }\n int GetSynthetic() const { return mnSynthetic; }\n sal_IntPtr GetFontId() const { return mnFontId; }\n bool DontUseAntiAlias() const\n { return maDevFontAttributes.UseAntiAlias() == ANTIALIAS_FALSE; }\n bool DontUseEmbeddedBitmaps() const\n { return maDevFontAttributes.UseEmbeddedBitmap() == EMBEDDEDBITMAP_FALSE; }\n bool IsSymbolFont() const { return maDevFontAttributes.IsSymbolFont(); }\n const ImplFontAttributes& GetFontAttributes() const { return maDevFontAttributes; }\n\n void AnnounceFont( ImplDevFontList* );\n\n int GetGlyphIndex( sal_UCS4 cChar ) const;\n void CacheGlyphIndex( sal_UCS4 cChar, int nGI ) const;\n\n bool HasExtraKerning() const;\n int GetExtraKernPairs( ImplKernPairData** ) const;\n int GetExtraGlyphKernValue( int nLeftGlyph, int nRightGlyph ) const;\n\nprivate:\n FT_FaceRec_* maFaceFT;\n FtFontFile* mpFontFile;\n const int mnFaceNum;\n int mnRefCount;\n const int mnSynthetic;\n\n sal_IntPtr mnFontId;\n ImplDevFontAttributes maDevFontAttributes;\n\n \/\/ cache unicode->glyphid mapping because looking it up is expensive\n \/\/ TODO: change to hash_multimap when a use case requires a m:n mapping\n typedef ::std::hash_map<int,int> Int2IntMap;\n mutable Int2IntMap maChar2Glyph;\n mutable Int2IntMap maGlyph2Char;\n\n const ExtraKernInfo* mpExtraKernInfo;\n};\n\n\/\/ these two inlines are very important for performance\n\ninline int FtFontInfo::GetGlyphIndex( sal_UCS4 cChar ) const\n{\n Int2IntMap::const_iterator it = maChar2Glyph.find( cChar );\n if( it == maChar2Glyph.end() )\n return -1;\n return it->second;\n}\n\ninline void FtFontInfo::CacheGlyphIndex( sal_UCS4 cChar, int nIndex ) const\n{\n maChar2Glyph[ cChar ] = nIndex;\n maGlyph2Char[ nIndex ] = cChar;\n}\n\n\/\/ -----------------------------------------------------------------------\n\nclass FreetypeManager\n{\npublic:\n FreetypeManager();\n ~FreetypeManager();\n\n long AddFontDir( const String& rUrlName );\n void AddFontFile( const rtl::OString& rNormalizedName,\n int nFaceNum, sal_IntPtr nFontId, const ImplDevFontAttributes&,\n const ExtraKernInfo* );\n void AnnounceFonts( ImplDevFontList* ) const;\n void ClearFontList();\n\n FreetypeServerFont* CreateFont( const ImplFontSelectData& );\n\nprivate:\n typedef ::std::hash_map<sal_IntPtr,FtFontInfo*> FontList;\n FontList maFontList;\n\n sal_IntPtr mnMaxFontId;\n sal_IntPtr mnNextFontId;\n};\n\n\/\/ -----------------------------------------------------------------------\n\nclass FreetypeServerFont : public ServerFont\n{\npublic:\n FreetypeServerFont( const ImplFontSelectData&, FtFontInfo* );\n virtual ~FreetypeServerFont();\n\n virtual const ::rtl::OString* GetFontFileName() const { return mpFontInfo->GetFontFileName(); }\n virtual int GetFontFaceNum() const { return mpFontInfo->GetFaceNum(); }\n virtual bool TestFont() const;\n\n virtual void FetchFontMetric( ImplFontMetricData&, long& rFactor ) const;\n\n virtual int GetGlyphIndex( sal_UCS4 ) const;\n int GetRawGlyphIndex( sal_UCS4 ) const;\n int FixupGlyphIndex( int nGlyphIndex, sal_UCS4 ) const;\n\n virtual bool GetAntialiasAdvice( void ) const;\n virtual bool GetGlyphBitmap1( int nGlyphIndex, RawBitmap& ) const;\n virtual bool GetGlyphBitmap8( int nGlyphIndex, RawBitmap& ) const;\n virtual bool GetGlyphOutline( int nGlyphIndex, ::basegfx::B2DPolyPolygon& ) const;\n virtual int GetGlyphKernValue( int nLeftGlyph, int nRightGlyph ) const;\n virtual ULONG GetKernPairs( ImplKernPairData** ) const;\n\n const unsigned char* GetTable( const char* pName, ULONG* pLength )\n { return mpFontInfo->GetTable( pName, pLength ); }\n int GetEmUnits() const;\n const FT_Size_Metrics& GetMetricsFT() const { return maSizeFT->metrics; }\n\nprotected:\n friend class GlyphCache;\n\n int ApplyGlyphTransform( int nGlyphFlags, FT_GlyphRec_*, bool ) const;\n virtual void InitGlyphData( int nGlyphIndex, GlyphData& ) const;\n virtual ULONG GetFontCodeRanges( sal_uInt32* pCodes ) const;\n bool ApplyGSUB( const ImplFontSelectData& );\n virtual ServerFontLayoutEngine* GetLayoutEngine();\n\nprivate:\n int mnWidth;\n int mnPrioEmbedded;\n int mnPrioAntiAlias;\n FtFontInfo* mpFontInfo;\n FT_Int mnLoadFlags;\n double mfStretch;\n FT_FaceRec_* maFaceFT;\n FT_SizeRec_* maSizeFT;\n\n bool mbArtItalic;\n bool mbArtBold;\n bool mbUseGamma;\n\n typedef ::std::hash_map<int,int> GlyphSubstitution;\n GlyphSubstitution maGlyphSubstitution;\n rtl_UnicodeToTextConverter maRecodeConverter;\n\n ServerFontLayoutEngine* mpLayoutEngine;\n};\n\n\/\/ -----------------------------------------------------------------------\n\nclass ImplFTSFontData : public ImplFontData\n{\nprivate:\n FtFontInfo* mpFtFontInfo;\n enum { IFTSFONT_MAGIC = 0x1F150A1C };\n\npublic:\n ImplFTSFontData( FtFontInfo*, const ImplDevFontAttributes& );\n virtual ~ImplFTSFontData();\n\n FtFontInfo* GetFtFontInfo() const { return mpFtFontInfo; }\n\n virtual ImplFontEntry* CreateFontInstance( ImplFontSelectData& ) const;\n virtual ImplFontData* Clone() const { return new ImplFTSFontData( *this ); }\n virtual sal_IntPtr GetFontId() const { return mpFtFontInfo->GetFontId(); }\n\n static bool CheckFontData( const ImplFontData& r ) { return r.CheckMagic( IFTSFONT_MAGIC ); }\n};\n\n\/\/ -----------------------------------------------------------------------\n\n#endif \/\/ _SV_GCACHFTYP_HXX\n<commit_msg>INTEGRATION: CWS warnings01 (1.34.10); FILE MERGED 2006\/05\/23 19:52:07 sb 1.34.10.2: RESYNC: (1.34-1.35); FILE MERGED 2006\/04\/20 14:49:37 sb 1.34.10.1: #i53898# Made code compile and\/or warning-free again after resync to SRC680m162 (done by PL).<commit_after>\/*************************************************************************\n *\n * OpenOffice.org - a multi-platform office productivity suite\n *\n * $RCSfile: gcach_ftyp.hxx,v $\n *\n * $Revision: 1.36 $\n *\n * last change: $Author: hr $ $Date: 2006-06-19 19:32:37 $\n *\n * The Contents of this file are made available subject to\n * the terms of GNU Lesser General Public License Version 2.1.\n *\n *\n * GNU Lesser General Public License Version 2.1\n * =============================================\n * Copyright 2005 by Sun Microsystems, Inc.\n * 901 San Antonio Road, Palo Alto, CA 94303, USA\n *\n * This library is free software; you can redistribute it and\/or\n * modify it under the terms of the GNU Lesser General Public\n * License version 2.1, as published by the Free Software Foundation.\n *\n * This library is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU\n * Lesser General Public License for more details.\n *\n * You should have received a copy of the GNU Lesser General Public\n * License along with this library; if not, write to the Free Software\n * Foundation, Inc., 59 Temple Place, Suite 330, Boston,\n * MA 02111-1307 USA\n *\n ************************************************************************\/\n\n#ifndef _SV_GCACHFTYP_HXX\n#define _SV_GCACHFTYP_HXX\n\n#include <glyphcache.hxx>\n#include <rtl\/textcvt.h>\n\n#include <ft2build.h>\n#include FT_FREETYPE_H\nclass FreetypeServerFont;\nstruct FT_GlyphRec_;\n\n\/\/ -----------------------------------------------------------------------\n\n\/\/ FtFontFile has the responsibility that a font file is only mapped once.\n\/\/ (#86621#) the old directly ft-managed solution caused it to be mapped\n\/\/ in up to nTTC*nSizes*nOrientation*nSynthetic times\nclass FtFontFile\n{\npublic:\n static FtFontFile* FindFontFile( const ::rtl::OString& rNativeFileName );\n\n bool Map();\n void Unmap();\n\n const unsigned char* GetBuffer() const { return mpFileMap; }\n int GetFileSize() const { return mnFileSize; }\n const ::rtl::OString* GetFileName() const { return &maNativeFileName; }\n int GetLangBoost() const { return mnLangBoost; }\n\nprivate:\n FtFontFile( const ::rtl::OString& rNativeFileName );\n\n const ::rtl::OString maNativeFileName;\n const unsigned char* mpFileMap;\n int mnFileSize;\n int mnRefCount;\n int mnLangBoost;\n};\n\n\/\/ -----------------------------------------------------------------------\n\n\/\/ FtFontInfo corresponds to an unscaled font face\nclass FtFontInfo\n{\npublic:\n FtFontInfo( const ImplDevFontAttributes&,\n const ::rtl::OString& rNativeFileName,\n int nFaceNum, sal_IntPtr nFontId, int nSynthetic,\n const ExtraKernInfo* );\n ~FtFontInfo();\n\n const unsigned char* GetTable( const char*, ULONG* pLength=0 ) const;\n\n FT_FaceRec_* GetFaceFT();\n void ReleaseFaceFT( FT_FaceRec_* );\n\n const ::rtl::OString* GetFontFileName() const { return mpFontFile->GetFileName(); }\n int GetFaceNum() const { return mnFaceNum; }\n int GetSynthetic() const { return mnSynthetic; }\n sal_IntPtr GetFontId() const { return mnFontId; }\n bool DontUseAntiAlias() const\n { return maDevFontAttributes.UseAntiAlias() == ANTIALIAS_FALSE; }\n bool DontUseEmbeddedBitmaps() const\n { return maDevFontAttributes.UseEmbeddedBitmap() == EMBEDDEDBITMAP_FALSE; }\n bool IsSymbolFont() const { return maDevFontAttributes.IsSymbolFont(); }\n const ImplFontAttributes& GetFontAttributes() const { return maDevFontAttributes; }\n\n void AnnounceFont( ImplDevFontList* );\n\n int GetGlyphIndex( sal_UCS4 cChar ) const;\n void CacheGlyphIndex( sal_UCS4 cChar, int nGI ) const;\n\n bool HasExtraKerning() const;\n int GetExtraKernPairs( ImplKernPairData** ) const;\n int GetExtraGlyphKernValue( int nLeftGlyph, int nRightGlyph ) const;\n\nprivate:\n FT_FaceRec_* maFaceFT;\n FtFontFile* mpFontFile;\n const int mnFaceNum;\n int mnRefCount;\n const int mnSynthetic;\n\n sal_IntPtr mnFontId;\n ImplDevFontAttributes maDevFontAttributes;\n\n \/\/ cache unicode->glyphid mapping because looking it up is expensive\n \/\/ TODO: change to hash_multimap when a use case requires a m:n mapping\n typedef ::std::hash_map<int,int> Int2IntMap;\n mutable Int2IntMap maChar2Glyph;\n mutable Int2IntMap maGlyph2Char;\n\n const ExtraKernInfo* mpExtraKernInfo;\n};\n\n\/\/ these two inlines are very important for performance\n\ninline int FtFontInfo::GetGlyphIndex( sal_UCS4 cChar ) const\n{\n Int2IntMap::const_iterator it = maChar2Glyph.find( cChar );\n if( it == maChar2Glyph.end() )\n return -1;\n return it->second;\n}\n\ninline void FtFontInfo::CacheGlyphIndex( sal_UCS4 cChar, int nIndex ) const\n{\n maChar2Glyph[ cChar ] = nIndex;\n maGlyph2Char[ nIndex ] = cChar;\n}\n\n\/\/ -----------------------------------------------------------------------\n\nclass FreetypeManager\n{\npublic:\n FreetypeManager();\n ~FreetypeManager();\n\n long AddFontDir( const String& rUrlName );\n void AddFontFile( const rtl::OString& rNormalizedName,\n int nFaceNum, sal_IntPtr nFontId, const ImplDevFontAttributes&,\n const ExtraKernInfo* );\n void AnnounceFonts( ImplDevFontList* ) const;\n void ClearFontList();\n\n FreetypeServerFont* CreateFont( const ImplFontSelectData& );\n\nprivate:\n typedef ::std::hash_map<sal_IntPtr,FtFontInfo*> FontList;\n FontList maFontList;\n\n sal_IntPtr mnMaxFontId;\n sal_IntPtr mnNextFontId;\n};\n\n\/\/ -----------------------------------------------------------------------\n\nclass FreetypeServerFont : public ServerFont\n{\npublic:\n FreetypeServerFont( const ImplFontSelectData&, FtFontInfo* );\n virtual ~FreetypeServerFont();\n\n virtual const ::rtl::OString* GetFontFileName() const { return mpFontInfo->GetFontFileName(); }\n virtual int GetFontFaceNum() const { return mpFontInfo->GetFaceNum(); }\n virtual bool TestFont() const;\n\n virtual void FetchFontMetric( ImplFontMetricData&, long& rFactor ) const;\n\n virtual int GetGlyphIndex( sal_UCS4 ) const;\n int GetRawGlyphIndex( sal_UCS4 ) const;\n int FixupGlyphIndex( int nGlyphIndex, sal_UCS4 ) const;\n\n virtual bool GetAntialiasAdvice( void ) const;\n virtual bool GetGlyphBitmap1( int nGlyphIndex, RawBitmap& ) const;\n virtual bool GetGlyphBitmap8( int nGlyphIndex, RawBitmap& ) const;\n virtual bool GetGlyphOutline( int nGlyphIndex, ::basegfx::B2DPolyPolygon& ) const;\n virtual int GetGlyphKernValue( int nLeftGlyph, int nRightGlyph ) const;\n virtual ULONG GetKernPairs( ImplKernPairData** ) const;\n\n const unsigned char* GetTable( const char* pName, ULONG* pLength )\n { return mpFontInfo->GetTable( pName, pLength ); }\n int GetEmUnits() const;\n const FT_Size_Metrics& GetMetricsFT() const { return maSizeFT->metrics; }\n\nprotected:\n friend class GlyphCache;\n\n int ApplyGlyphTransform( int nGlyphFlags, FT_GlyphRec_*, bool ) const;\n virtual void InitGlyphData( int nGlyphIndex, GlyphData& ) const;\n virtual ULONG GetFontCodeRanges( sal_uInt32* pCodes ) const;\n bool ApplyGSUB( const ImplFontSelectData& );\n virtual ServerFontLayoutEngine* GetLayoutEngine();\n\nprivate:\n int mnWidth;\n int mnPrioEmbedded;\n int mnPrioAntiAlias;\n FtFontInfo* mpFontInfo;\n FT_Int mnLoadFlags;\n double mfStretch;\n FT_FaceRec_* maFaceFT;\n FT_SizeRec_* maSizeFT;\n\n bool mbArtItalic;\n bool mbArtBold;\n bool mbUseGamma;\n\n typedef ::std::hash_map<int,int> GlyphSubstitution;\n GlyphSubstitution maGlyphSubstitution;\n rtl_UnicodeToTextConverter maRecodeConverter;\n\n ServerFontLayoutEngine* mpLayoutEngine;\n};\n\n\/\/ -----------------------------------------------------------------------\n\nclass ImplFTSFontData : public ImplFontData\n{\nprivate:\n FtFontInfo* mpFtFontInfo;\n enum { IFTSFONT_MAGIC = 0x1F150A1C };\n\npublic:\n ImplFTSFontData( FtFontInfo*, const ImplDevFontAttributes& );\n\n FtFontInfo* GetFtFontInfo() const { return mpFtFontInfo; }\n\n virtual ImplFontEntry* CreateFontInstance( ImplFontSelectData& ) const;\n virtual ImplFontData* Clone() const { return new ImplFTSFontData( *this ); }\n virtual sal_IntPtr GetFontId() const { return mpFtFontInfo->GetFontId(); }\n\n static bool CheckFontData( const ImplFontData& r ) { return r.CheckMagic( IFTSFONT_MAGIC ); }\n};\n\n\/\/ -----------------------------------------------------------------------\n\n#endif \/\/ _SV_GCACHFTYP_HXX\n<|endoftext|>"} {"text":"<commit_before><commit_msg>vcl: WinSalGraphics: don't crash if there's no font<commit_after><|endoftext|>"} {"text":"<commit_before>\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ taskwarrior - a command line task list manager.\n\/\/\n\/\/ Copyright 2006-2013, Paul Beckingham, Federico Hernandez.\n\/\/\n\/\/ Permission is hereby granted, free of charge, to any person obtaining a copy\n\/\/ of this software and associated documentation files (the \"Software\"), to deal\n\/\/ in the Software without restriction, including without limitation the rights\n\/\/ to use, copy, modify, merge, publish, distribute, sublicense, and\/or sell\n\/\/ copies of the Software, and to permit persons to whom the Software is\n\/\/ furnished to do so, subject to the following conditions:\n\/\/\n\/\/ The above copyright notice and this permission notice shall be included\n\/\/ in all copies or substantial portions of the Software.\n\/\/\n\/\/ THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS\n\/\/ OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\n\/\/ FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL\n\/\/ THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\n\/\/ LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,\n\/\/ OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE\n\/\/ SOFTWARE.\n\/\/\n\/\/ http:\/\/www.opensource.org\/licenses\/mit-license.php\n\/\/\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n#define L10N \/\/ Localization complete.\n\n#include <stdlib.h>\n#include <Context.h>\n#include <Date.h>\n#include <ColDescription.h>\n#include <text.h>\n#include <utf8.h>\n#include <util.h>\n#include <i18n.h>\n\nextern Context context;\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nColumnDescription::ColumnDescription ()\n{\n _name = \"description\";\n _type = \"string\";\n _style = \"combined\";\n _label = STRING_COLUMN_LABEL_DESC;\n\n _styles.push_back (\"combined\");\n _styles.push_back (\"desc\");\n _styles.push_back (\"oneline\");\n _styles.push_back (\"truncated\");\n _styles.push_back (\"count\");\n\n _dateformat = context.config.get (\"dateformat.annotation\");\n if (_dateformat == \"\")\n _dateformat = context.config.get (\"dateformat\");\n\n std::string t = Date ().toString (_dateformat);\n std::string d = STRING_COLUMN_EXAMPLES_DESC;\n std::string a1 = STRING_COLUMN_EXAMPLES_ANNO1;\n std::string a2 = STRING_COLUMN_EXAMPLES_ANNO2;\n std::string a3 = STRING_COLUMN_EXAMPLES_ANNO3;\n std::string a4 = STRING_COLUMN_EXAMPLES_ANNO4;\n\n _examples.push_back (d\n + \"\\n \" + t + \" \" + a1\n + \"\\n \" + t + \" \" + a2\n + \"\\n \" + t + \" \" + a3\n + \"\\n \" + t + \" \" + a4);\n _examples.push_back (d);\n _examples.push_back (d\n + \" \" + t + \" \" + a1\n + \" \" + t + \" \" + a2\n + \" \" + t + \" \" + a3\n + \" \" + t + \" \" + a4);\n _examples.push_back (d.substr (0, 20) + \"...\");\n _examples.push_back (d + \" [4]\");\n\n _hyphenate = context.config.getBoolean (\"hyphenate\");\n\n _indent = context.config.getInteger (\"indent.annotation\");\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nColumnDescription::~ColumnDescription ()\n{\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nbool ColumnDescription::validate (std::string& value)\n{\n return true;\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ Set the minimum and maximum widths for the value.\nvoid ColumnDescription::measure (Task& task, unsigned int& minimum, unsigned int& maximum)\n{\n std::string description = task.get (_name);\n\n \/\/ The text\n \/\/ <indent> <date> <anno>\n \/\/ ...\n if (_style == \"default\" ||\n _style == \"combined\")\n {\n minimum = longestWord (description);\n maximum = utf8_width (description);\n\n if (task.annotation_count)\n {\n int min_anno = _indent + Date::length (_dateformat);\n if (min_anno > minimum)\n minimum = min_anno;\n\n std::map <std::string, std::string> annos;\n task.getAnnotations (annos);\n std::map <std::string, std::string>::iterator i;\n for (i = annos.begin (); i != annos.end (); i++)\n {\n unsigned int len = min_anno + 1 + utf8_width (i->second);\n if (len > maximum)\n maximum = len;\n }\n }\n }\n\n \/\/ Just the text\n else if (_style == \"desc\")\n {\n maximum = utf8_width (description);\n minimum = longestWord (description);\n }\n\n \/\/ The text <date> <anno> ...\n else if (_style == \"oneline\")\n {\n minimum = longestWord (description);\n maximum = utf8_width (description);\n\n if (task.annotation_count)\n {\n int min_anno = Date::length (_dateformat);\n std::map <std::string, std::string> annos;\n task.getAnnotations (annos);\n std::map <std::string, std::string>::iterator i;\n for (i = annos.begin (); i != annos.end (); i++)\n maximum += min_anno + 1 + utf8_width (i->second);\n }\n }\n\n \/\/ The te...\n else if (_style == \"truncated\")\n {\n minimum = 4;\n maximum = utf8_width (description);\n }\n\n \/\/ The text [2]\n else if (_style == \"count\")\n {\n \/\/ <description> + ' ' + '[' + <count> + ']'\n maximum = utf8_width (description) + 1 + 1 + format (task.annotation_count).length () + 1;\n minimum = longestWord (description);\n }\n\n else\n throw format (STRING_COLUMN_BAD_FORMAT, _name, _style);\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nvoid ColumnDescription::render (\n std::vector <std::string>& lines,\n Task& task,\n int width,\n Color& color)\n{\n std::string description = task.get (_name);\n\n \/\/ This is a description\n \/\/ <date> <anno>\n \/\/ ...\n if (_style == \"default\" ||\n _style == \"combined\")\n {\n std::map <std::string, std::string> annos;\n task.getAnnotations (annos);\n if (annos.size ())\n {\n std::map <std::string, std::string>::iterator i;\n for (i = annos.begin (); i != annos.end (); i++)\n {\n Date dt (strtol (i->first.substr (11).c_str (), NULL, 10));\n description += \"\\n\" + std::string (_indent, ' ') + dt.toString (_dateformat) + \" \" + i->second;\n }\n }\n\n std::vector <std::string> raw;\n wrapText (raw, description, width, _hyphenate);\n\n std::vector <std::string>::iterator i;\n for (i = raw.begin (); i != raw.end (); ++i)\n lines.push_back (color.colorize (leftJustify (*i, width)));\n }\n\n \/\/ This is a description\n else if (_style == \"desc\")\n {\n std::vector <std::string> raw;\n wrapText (raw, description, width, _hyphenate);\n\n std::vector <std::string>::iterator i;\n for (i = raw.begin (); i != raw.end (); ++i)\n lines.push_back (color.colorize (leftJustify (*i, width)));\n }\n\n \/\/ This is a description <date> <anno> ...\n else if (_style == \"oneline\")\n {\n std::map <std::string, std::string> annos;\n task.getAnnotations (annos);\n if (annos.size ())\n {\n std::map <std::string, std::string>::iterator i;\n for (i = annos.begin (); i != annos.end (); i++)\n {\n Date dt (atoi (i->first.substr (11).c_str ()));\n description += \" \" + dt.toString (_dateformat) + \" \" + i->second;\n }\n }\n\n std::vector <std::string> raw;\n wrapText (raw, description, width, _hyphenate);\n\n std::vector <std::string>::iterator i;\n for (i = raw.begin (); i != raw.end (); ++i)\n lines.push_back (color.colorize (leftJustify (*i, width)));\n }\n\n \/\/ This is a des...\n else if (_style == \"truncated\")\n {\n int len = utf8_width (description);\n if (len > width)\n lines.push_back (color.colorize (description.substr (0, width - 3) + \"...\"));\n else\n lines.push_back (color.colorize (leftJustify (description, width)));\n }\n\n \/\/ This is a description [2]\n else if (_style == \"count\")\n {\n std::map <std::string, std::string> annos;\n task.getAnnotations (annos);\n\n if (annos.size ())\n description += \" [\" + format ((int) annos.size ()) + \"]\";\n\n std::vector <std::string> raw;\n wrapText (raw, description, width, _hyphenate);\n\n std::vector <std::string>::iterator i;\n for (i = raw.begin (); i != raw.end (); ++i)\n lines.push_back (color.colorize (leftJustify (*i, width)));\n }\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n<commit_msg>Build Warnings<commit_after>\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ taskwarrior - a command line task list manager.\n\/\/\n\/\/ Copyright 2006-2013, Paul Beckingham, Federico Hernandez.\n\/\/\n\/\/ Permission is hereby granted, free of charge, to any person obtaining a copy\n\/\/ of this software and associated documentation files (the \"Software\"), to deal\n\/\/ in the Software without restriction, including without limitation the rights\n\/\/ to use, copy, modify, merge, publish, distribute, sublicense, and\/or sell\n\/\/ copies of the Software, and to permit persons to whom the Software is\n\/\/ furnished to do so, subject to the following conditions:\n\/\/\n\/\/ The above copyright notice and this permission notice shall be included\n\/\/ in all copies or substantial portions of the Software.\n\/\/\n\/\/ THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS\n\/\/ OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\n\/\/ FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL\n\/\/ THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\n\/\/ LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,\n\/\/ OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE\n\/\/ SOFTWARE.\n\/\/\n\/\/ http:\/\/www.opensource.org\/licenses\/mit-license.php\n\/\/\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n#define L10N \/\/ Localization complete.\n\n#include <stdlib.h>\n#include <Context.h>\n#include <Date.h>\n#include <ColDescription.h>\n#include <text.h>\n#include <utf8.h>\n#include <util.h>\n#include <i18n.h>\n\nextern Context context;\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nColumnDescription::ColumnDescription ()\n{\n _name = \"description\";\n _type = \"string\";\n _style = \"combined\";\n _label = STRING_COLUMN_LABEL_DESC;\n\n _styles.push_back (\"combined\");\n _styles.push_back (\"desc\");\n _styles.push_back (\"oneline\");\n _styles.push_back (\"truncated\");\n _styles.push_back (\"count\");\n\n _dateformat = context.config.get (\"dateformat.annotation\");\n if (_dateformat == \"\")\n _dateformat = context.config.get (\"dateformat\");\n\n std::string t = Date ().toString (_dateformat);\n std::string d = STRING_COLUMN_EXAMPLES_DESC;\n std::string a1 = STRING_COLUMN_EXAMPLES_ANNO1;\n std::string a2 = STRING_COLUMN_EXAMPLES_ANNO2;\n std::string a3 = STRING_COLUMN_EXAMPLES_ANNO3;\n std::string a4 = STRING_COLUMN_EXAMPLES_ANNO4;\n\n _examples.push_back (d\n + \"\\n \" + t + \" \" + a1\n + \"\\n \" + t + \" \" + a2\n + \"\\n \" + t + \" \" + a3\n + \"\\n \" + t + \" \" + a4);\n _examples.push_back (d);\n _examples.push_back (d\n + \" \" + t + \" \" + a1\n + \" \" + t + \" \" + a2\n + \" \" + t + \" \" + a3\n + \" \" + t + \" \" + a4);\n _examples.push_back (d.substr (0, 20) + \"...\");\n _examples.push_back (d + \" [4]\");\n\n _hyphenate = context.config.getBoolean (\"hyphenate\");\n\n _indent = context.config.getInteger (\"indent.annotation\");\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nColumnDescription::~ColumnDescription ()\n{\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nbool ColumnDescription::validate (std::string& value)\n{\n return true;\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ Set the minimum and maximum widths for the value.\nvoid ColumnDescription::measure (Task& task, unsigned int& minimum, unsigned int& maximum)\n{\n std::string description = task.get (_name);\n\n \/\/ The text\n \/\/ <indent> <date> <anno>\n \/\/ ...\n if (_style == \"default\" ||\n _style == \"combined\")\n {\n minimum = longestWord (description);\n maximum = utf8_width (description);\n\n if (task.annotation_count)\n {\n unsigned int min_anno = _indent + Date::length (_dateformat);\n if (min_anno > minimum)\n minimum = min_anno;\n\n std::map <std::string, std::string> annos;\n task.getAnnotations (annos);\n std::map <std::string, std::string>::iterator i;\n for (i = annos.begin (); i != annos.end (); i++)\n {\n unsigned int len = min_anno + 1 + utf8_width (i->second);\n if (len > maximum)\n maximum = len;\n }\n }\n }\n\n \/\/ Just the text\n else if (_style == \"desc\")\n {\n maximum = utf8_width (description);\n minimum = longestWord (description);\n }\n\n \/\/ The text <date> <anno> ...\n else if (_style == \"oneline\")\n {\n minimum = longestWord (description);\n maximum = utf8_width (description);\n\n if (task.annotation_count)\n {\n unsigned int min_anno = Date::length (_dateformat);\n std::map <std::string, std::string> annos;\n task.getAnnotations (annos);\n std::map <std::string, std::string>::iterator i;\n for (i = annos.begin (); i != annos.end (); i++)\n maximum += min_anno + 1 + utf8_width (i->second);\n }\n }\n\n \/\/ The te...\n else if (_style == \"truncated\")\n {\n minimum = 4;\n maximum = utf8_width (description);\n }\n\n \/\/ The text [2]\n else if (_style == \"count\")\n {\n \/\/ <description> + ' ' + '[' + <count> + ']'\n maximum = utf8_width (description) + 1 + 1 + format (task.annotation_count).length () + 1;\n minimum = longestWord (description);\n }\n\n else\n throw format (STRING_COLUMN_BAD_FORMAT, _name, _style);\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nvoid ColumnDescription::render (\n std::vector <std::string>& lines,\n Task& task,\n int width,\n Color& color)\n{\n std::string description = task.get (_name);\n\n \/\/ This is a description\n \/\/ <date> <anno>\n \/\/ ...\n if (_style == \"default\" ||\n _style == \"combined\")\n {\n std::map <std::string, std::string> annos;\n task.getAnnotations (annos);\n if (annos.size ())\n {\n std::map <std::string, std::string>::iterator i;\n for (i = annos.begin (); i != annos.end (); i++)\n {\n Date dt (strtol (i->first.substr (11).c_str (), NULL, 10));\n description += \"\\n\" + std::string (_indent, ' ') + dt.toString (_dateformat) + \" \" + i->second;\n }\n }\n\n std::vector <std::string> raw;\n wrapText (raw, description, width, _hyphenate);\n\n std::vector <std::string>::iterator i;\n for (i = raw.begin (); i != raw.end (); ++i)\n lines.push_back (color.colorize (leftJustify (*i, width)));\n }\n\n \/\/ This is a description\n else if (_style == \"desc\")\n {\n std::vector <std::string> raw;\n wrapText (raw, description, width, _hyphenate);\n\n std::vector <std::string>::iterator i;\n for (i = raw.begin (); i != raw.end (); ++i)\n lines.push_back (color.colorize (leftJustify (*i, width)));\n }\n\n \/\/ This is a description <date> <anno> ...\n else if (_style == \"oneline\")\n {\n std::map <std::string, std::string> annos;\n task.getAnnotations (annos);\n if (annos.size ())\n {\n std::map <std::string, std::string>::iterator i;\n for (i = annos.begin (); i != annos.end (); i++)\n {\n Date dt (atoi (i->first.substr (11).c_str ()));\n description += \" \" + dt.toString (_dateformat) + \" \" + i->second;\n }\n }\n\n std::vector <std::string> raw;\n wrapText (raw, description, width, _hyphenate);\n\n std::vector <std::string>::iterator i;\n for (i = raw.begin (); i != raw.end (); ++i)\n lines.push_back (color.colorize (leftJustify (*i, width)));\n }\n\n \/\/ This is a des...\n else if (_style == \"truncated\")\n {\n int len = utf8_width (description);\n if (len > width)\n lines.push_back (color.colorize (description.substr (0, width - 3) + \"...\"));\n else\n lines.push_back (color.colorize (leftJustify (description, width)));\n }\n\n \/\/ This is a description [2]\n else if (_style == \"count\")\n {\n std::map <std::string, std::string> annos;\n task.getAnnotations (annos);\n\n if (annos.size ())\n description += \" [\" + format ((int) annos.size ()) + \"]\";\n\n std::vector <std::string> raw;\n wrapText (raw, description, width, _hyphenate);\n\n std::vector <std::string>::iterator i;\n for (i = raw.begin (); i != raw.end (); ++i)\n lines.push_back (color.colorize (leftJustify (*i, width)));\n }\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n<|endoftext|>"} {"text":"<commit_before>\/*\n * Copyright (c) 2015 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#include \"common\/application_data.h\"\n\n#include <package_manager.h>\n#include <manifest_parser\/manifest_handler.h>\n#include <manifest_handlers\/widget_config_parser.h>\n#include <manifest_handlers\/application_manifest_constants.h>\n\n#include <vector>\n\n#include \"common\/logger.h\"\n#include \"common\/file_utils.h\"\n\nnamespace wrt {\n\nnamespace {\n\nconst char* kPathSeparator = \"\/\";\nconst char* kConfigXml = \"config.xml\";\n\nstatic std::string GetPackageIdByAppId(const std::string& appid) {\n char* pkgid = NULL;\n package_manager_get_package_id_by_app_id(appid.c_str(), &pkgid);\n\n std::unique_ptr<char, decltype(std::free)*>\n pkgid_ptr {pkgid, std::free};\n\n if (pkgid != NULL) {\n return std::string(pkgid_ptr.get());\n } else {\n return std::string();\n }\n}\n\nstatic std::string GetPackageRootPath(const std::string& pkgid) {\n package_info_h pkg_info = NULL;\n if (package_manager_get_package_info(\n pkgid.c_str(), &pkg_info) != PACKAGE_MANAGER_ERROR_NONE) {\n return std::string();\n }\n\n char* pkg_root_path = NULL;\n package_info_get_root_path(pkg_info, &pkg_root_path);\n\n std::unique_ptr<char, decltype(std::free)*>\n path_ptr {pkg_root_path, std::free};\n\n package_info_destroy(pkg_info);\n\n if (pkg_root_path != NULL) {\n return std::string(path_ptr.get());\n } else {\n return std::string();\n }\n}\n\n} \/\/ namespace\n\nApplicationData::ApplicationData(const std::string& appid) : app_id_(appid) {\n pkg_id_ = GetPackageIdByAppId(appid);\n\n if (!pkg_id_.empty()) {\n application_path_ = GetPackageRootPath(pkg_id_) + kPathSeparator +\n appid + kPathSeparator;\n }\n}\n\nApplicationData::~ApplicationData() {}\n\nstd::shared_ptr<const wgt::parse::AppControlInfoList>\n ApplicationData::app_control_info_list() const {\n return app_control_info_list_;\n}\n\nstd::shared_ptr<const wgt::parse::CategoryInfoList>\n ApplicationData::category_info_list() const {\n return category_info_list_;\n}\n\nstd::shared_ptr<const wgt::parse::MetaDataInfo>\n ApplicationData::meta_data_info() const {\n return meta_data_info_;\n}\n\nstd::shared_ptr<const wgt::parse::AllowedNavigationInfo>\n ApplicationData::allowed_navigation_info() const {\n return allowed_navigation_info_;\n}\n\nstd::shared_ptr<const wgt::parse::PermissionsInfo>\n ApplicationData::permissions_info() const {\n return permissions_info_;\n}\n\nstd::shared_ptr<const wgt::parse::SettingInfo>\n ApplicationData::setting_info() const {\n return setting_info_;\n}\n\nstd::shared_ptr<const wgt::parse::SplashScreenInfo>\n ApplicationData::splash_screen_info() const {\n return splash_screen_info_;\n}\n\nstd::shared_ptr<const wgt::parse::TizenApplicationInfo>\n ApplicationData::tizen_application_info() const {\n return tizen_application_info_;\n}\n\nstd::shared_ptr<const wgt::parse::WidgetInfo>\n ApplicationData::widget_info() const {\n return widget_info_;\n}\n\nstd::shared_ptr<const wgt::parse::ContentInfo>\n ApplicationData::content_info() const {\n return content_info_;\n}\n\nstd::shared_ptr<const wgt::parse::WarpInfo>\n ApplicationData::warp_info() const {\n return warp_info_;\n}\n\nstd::shared_ptr<const wgt::parse::CSPInfo>\n ApplicationData::csp_info() const {\n return csp_info_;\n}\n\nstd::shared_ptr<const wgt::parse::CSPInfo>\n ApplicationData::csp_report_info() const {\n return csp_report_info_;\n}\n\n\nbool ApplicationData::LoadManifestData() {\n std::string config_xml_path(application_path_ + kConfigXml);\n if (!utils::Exists(config_xml_path)) {\n LOGGER(ERROR) << \"Failed to load manifest data. : No such file '\"\n << config_xml_path << \"'.\";\n return false;\n }\n\n std::unique_ptr<wgt::parse::WidgetConfigParser> widget_config_parser;\n widget_config_parser.reset(new wgt::parse::WidgetConfigParser());\n if (!widget_config_parser->ParseManifest(config_xml_path)) {\n LOGGER(ERROR) << \"Failed to load widget config parser data: \"\n << widget_config_parser->GetErrorMessage();\n return false;\n }\n\n app_control_info_list_ =\n std::static_pointer_cast<const wgt::parse::AppControlInfoList>(\n widget_config_parser->GetManifestData(\n wgt::application_widget_keys::kTizenApplicationAppControlsKey));\n\n category_info_list_ =\n std::static_pointer_cast<const wgt::parse::CategoryInfoList>(\n widget_config_parser->GetManifestData(\n wgt::application_widget_keys::kTizenCategoryKey));\n\n meta_data_info_ =\n std::static_pointer_cast<const wgt::parse::MetaDataInfo>(\n widget_config_parser->GetManifestData(\n wgt::application_widget_keys::kTizenMetaDataKey));\n\n allowed_navigation_info_ =\n std::static_pointer_cast<const wgt::parse::AllowedNavigationInfo>(\n widget_config_parser->GetManifestData(\n wgt::application_widget_keys::kAllowNavigationKey));\n\n permissions_info_ =\n std::static_pointer_cast<const wgt::parse::PermissionsInfo>(\n widget_config_parser->GetManifestData(\n wgt::application_widget_keys::kTizenPermissionsKey));\n\n setting_info_ =\n std::static_pointer_cast<const wgt::parse::SettingInfo>(\n widget_config_parser->GetManifestData(\n wgt::application_widget_keys::kTizenSettingKey));\n\n splash_screen_info_ =\n std::static_pointer_cast<const wgt::parse::SplashScreenInfo>(\n widget_config_parser->GetManifestData(\n wgt::application_widget_keys::kTizenSplashScreenKey));\n\n tizen_application_info_ =\n std::static_pointer_cast<const wgt::parse::TizenApplicationInfo>(\n widget_config_parser->GetManifestData(\n wgt::application_widget_keys::kTizenApplicationKey));\n\n widget_info_ =\n std::static_pointer_cast<const wgt::parse::WidgetInfo>(\n widget_config_parser->GetManifestData(\n wgt::application_widget_keys::kTizenWidgetKey));\n\n content_info_ =\n std::static_pointer_cast<const wgt::parse::ContentInfo>(\n widget_config_parser->GetManifestData(\n wgt::application_widget_keys::kTizenContentKey));\n\n warp_info_ =\n std::static_pointer_cast<const wgt::parse::WarpInfo>(\n widget_config_parser->GetManifestData(\n wgt::application_widget_keys::kAccessKey));\n\n std::unique_ptr<parser::ManifestHandlerRegistry> csp_registry;\n csp_registry.reset(new parser::ManifestHandlerRegistry({\n new wgt::parse::CSPHandler(wgt::parse::CSPHandler::SecurityType::CSP),\n new wgt::parse::CSPHandler(\n wgt::parse::CSPHandler::SecurityType::CSP_REPORT_ONLY)\n }));\n\n parser::ManifestParser csp_parser(std::move(csp_registry));\n if (!csp_parser.ParseManifest(config_xml_path)) {\n LOGGER(ERROR) << \"Failed to load manifest data : \"\n << csp_parser.GetErrorMessage();\n return false;\n }\n\n csp_info_ =\n std::static_pointer_cast<const wgt::parse::CSPInfo>(\n csp_parser.GetManifestData(\n wgt::application_widget_keys::kCSPKey));\n\n csp_report_info_ =\n std::static_pointer_cast<const wgt::parse::CSPInfo>(\n csp_parser.GetManifestData(\n wgt::application_widget_keys::kCSPReportOnlyKey));\n\n \/\/ Set default empty object\n if (widget_info_.get() == NULL) {\n widget_info_.reset(new wgt::parse::WidgetInfo);\n }\n if (setting_info_.get() == NULL) {\n setting_info_.reset(new wgt::parse::SettingInfo);\n }\n\n return true;\n}\n\n} \/\/ namespace wrt\n<commit_msg>Apply application path to restore 2.x directory structure<commit_after>\/*\n * Copyright (c) 2015 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#include \"common\/application_data.h\"\n\n#include <package_manager.h>\n#include <manifest_parser\/manifest_handler.h>\n#include <manifest_handlers\/widget_config_parser.h>\n#include <manifest_handlers\/application_manifest_constants.h>\n\n#include <vector>\n\n#include \"common\/logger.h\"\n#include \"common\/file_utils.h\"\n\nnamespace wrt {\n\nnamespace {\n\nconst char* kPathSeparator = \"\/\";\nconst char* kConfigXml = \"config.xml\";\nconst char* kResWgtPath = \"res\/wgt\";\n\nstatic std::string GetPackageIdByAppId(const std::string& appid) {\n char* pkgid = NULL;\n package_manager_get_package_id_by_app_id(appid.c_str(), &pkgid);\n\n std::unique_ptr<char, decltype(std::free)*>\n pkgid_ptr {pkgid, std::free};\n\n if (pkgid != NULL) {\n return std::string(pkgid_ptr.get());\n } else {\n LOGGER(ERROR) << \"Failed to get package id\";\n return std::string();\n }\n}\n\nstatic std::string GetPackageRootPath(const std::string& pkgid) {\n package_info_h pkg_info = NULL;\n if (package_manager_get_package_info(\n pkgid.c_str(), &pkg_info) != PACKAGE_MANAGER_ERROR_NONE) {\n return std::string();\n }\n\n char* pkg_root_path = NULL;\n package_info_get_root_path(pkg_info, &pkg_root_path);\n\n std::unique_ptr<char, decltype(std::free)*>\n path_ptr {pkg_root_path, std::free};\n\n package_info_destroy(pkg_info);\n\n if (pkg_root_path != NULL) {\n return std::string(path_ptr.get());\n } else {\n LOGGER(ERROR) << \"Failed to get package root path\";\n return std::string();\n }\n}\n\n} \/\/ namespace\n\nApplicationData::ApplicationData(const std::string& appid) : app_id_(appid) {\n pkg_id_ = GetPackageIdByAppId(appid);\n if (!pkg_id_.empty())\n application_path_ = GetPackageRootPath(pkg_id_) + kPathSeparator\n + kResWgtPath + kPathSeparator;\n}\n\nApplicationData::~ApplicationData() {}\n\nstd::shared_ptr<const wgt::parse::AppControlInfoList>\n ApplicationData::app_control_info_list() const {\n return app_control_info_list_;\n}\n\nstd::shared_ptr<const wgt::parse::CategoryInfoList>\n ApplicationData::category_info_list() const {\n return category_info_list_;\n}\n\nstd::shared_ptr<const wgt::parse::MetaDataInfo>\n ApplicationData::meta_data_info() const {\n return meta_data_info_;\n}\n\nstd::shared_ptr<const wgt::parse::AllowedNavigationInfo>\n ApplicationData::allowed_navigation_info() const {\n return allowed_navigation_info_;\n}\n\nstd::shared_ptr<const wgt::parse::PermissionsInfo>\n ApplicationData::permissions_info() const {\n return permissions_info_;\n}\n\nstd::shared_ptr<const wgt::parse::SettingInfo>\n ApplicationData::setting_info() const {\n return setting_info_;\n}\n\nstd::shared_ptr<const wgt::parse::SplashScreenInfo>\n ApplicationData::splash_screen_info() const {\n return splash_screen_info_;\n}\n\nstd::shared_ptr<const wgt::parse::TizenApplicationInfo>\n ApplicationData::tizen_application_info() const {\n return tizen_application_info_;\n}\n\nstd::shared_ptr<const wgt::parse::WidgetInfo>\n ApplicationData::widget_info() const {\n return widget_info_;\n}\n\nstd::shared_ptr<const wgt::parse::ContentInfo>\n ApplicationData::content_info() const {\n return content_info_;\n}\n\nstd::shared_ptr<const wgt::parse::WarpInfo>\n ApplicationData::warp_info() const {\n return warp_info_;\n}\n\nstd::shared_ptr<const wgt::parse::CSPInfo>\n ApplicationData::csp_info() const {\n return csp_info_;\n}\n\nstd::shared_ptr<const wgt::parse::CSPInfo>\n ApplicationData::csp_report_info() const {\n return csp_report_info_;\n}\n\n\nbool ApplicationData::LoadManifestData() {\n std::string config_xml_path(application_path_ + kConfigXml);\n if (!utils::Exists(config_xml_path)) {\n LOGGER(ERROR) << \"Failed to load manifest data : No such file '\"\n << config_xml_path << \"'.\";\n return false;\n }\n\n std::unique_ptr<wgt::parse::WidgetConfigParser> widget_config_parser;\n widget_config_parser.reset(new wgt::parse::WidgetConfigParser());\n if (!widget_config_parser->ParseManifest(config_xml_path)) {\n LOGGER(ERROR) << \"Failed to load widget config parser data: \"\n << widget_config_parser->GetErrorMessage();\n return false;\n }\n\n app_control_info_list_ =\n std::static_pointer_cast<const wgt::parse::AppControlInfoList>(\n widget_config_parser->GetManifestData(\n wgt::application_widget_keys::kTizenApplicationAppControlsKey));\n\n category_info_list_ =\n std::static_pointer_cast<const wgt::parse::CategoryInfoList>(\n widget_config_parser->GetManifestData(\n wgt::application_widget_keys::kTizenCategoryKey));\n\n meta_data_info_ =\n std::static_pointer_cast<const wgt::parse::MetaDataInfo>(\n widget_config_parser->GetManifestData(\n wgt::application_widget_keys::kTizenMetaDataKey));\n\n allowed_navigation_info_ =\n std::static_pointer_cast<const wgt::parse::AllowedNavigationInfo>(\n widget_config_parser->GetManifestData(\n wgt::application_widget_keys::kAllowNavigationKey));\n\n permissions_info_ =\n std::static_pointer_cast<const wgt::parse::PermissionsInfo>(\n widget_config_parser->GetManifestData(\n wgt::application_widget_keys::kTizenPermissionsKey));\n\n setting_info_ =\n std::static_pointer_cast<const wgt::parse::SettingInfo>(\n widget_config_parser->GetManifestData(\n wgt::application_widget_keys::kTizenSettingKey));\n\n splash_screen_info_ =\n std::static_pointer_cast<const wgt::parse::SplashScreenInfo>(\n widget_config_parser->GetManifestData(\n wgt::application_widget_keys::kTizenSplashScreenKey));\n\n tizen_application_info_ =\n std::static_pointer_cast<const wgt::parse::TizenApplicationInfo>(\n widget_config_parser->GetManifestData(\n wgt::application_widget_keys::kTizenApplicationKey));\n\n widget_info_ =\n std::static_pointer_cast<const wgt::parse::WidgetInfo>(\n widget_config_parser->GetManifestData(\n wgt::application_widget_keys::kTizenWidgetKey));\n\n content_info_ =\n std::static_pointer_cast<const wgt::parse::ContentInfo>(\n widget_config_parser->GetManifestData(\n wgt::application_widget_keys::kTizenContentKey));\n\n warp_info_ =\n std::static_pointer_cast<const wgt::parse::WarpInfo>(\n widget_config_parser->GetManifestData(\n wgt::application_widget_keys::kAccessKey));\n\n std::unique_ptr<parser::ManifestHandlerRegistry> csp_registry;\n csp_registry.reset(new parser::ManifestHandlerRegistry({\n new wgt::parse::CSPHandler(wgt::parse::CSPHandler::SecurityType::CSP),\n new wgt::parse::CSPHandler(\n wgt::parse::CSPHandler::SecurityType::CSP_REPORT_ONLY)\n }));\n\n parser::ManifestParser csp_parser(std::move(csp_registry));\n if (!csp_parser.ParseManifest(config_xml_path)) {\n LOGGER(ERROR) << \"Failed to load manifest data : \"\n << csp_parser.GetErrorMessage();\n return false;\n }\n\n csp_info_ =\n std::static_pointer_cast<const wgt::parse::CSPInfo>(\n csp_parser.GetManifestData(\n wgt::application_widget_keys::kCSPKey));\n\n csp_report_info_ =\n std::static_pointer_cast<const wgt::parse::CSPInfo>(\n csp_parser.GetManifestData(\n wgt::application_widget_keys::kCSPReportOnlyKey));\n\n \/\/ Set default empty object\n if (widget_info_.get() == NULL) {\n widget_info_.reset(new wgt::parse::WidgetInfo);\n }\n if (setting_info_.get() == NULL) {\n setting_info_.reset(new wgt::parse::SettingInfo);\n }\n\n return true;\n}\n\n} \/\/ namespace wrt\n<|endoftext|>"} {"text":"<commit_before>\/\/=============================================================================================================\n\/**\n* @file babymeginfo.cpp\n* @author Limin Sun <liminsun@nmr.mgh.harvard.edu>;\n* Christoph Dinh <chdinh@nmr.mgh.harvard.edu>;\n* Matti Hamalainen <msh@nmr.mgh.harvard.edu>\n* @version 1.0\n* @date April, 2013\n*\n* @section LICENSE\n*\n* Copyright (C) 2013, Limin Sun, 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 implementation of the BabyMEGInfo Class.\n*\n*\/\n\n#include \"babymeginfo.h\"\n\n\n\n\/\/*************************************************************************************************************\n\nBabyMEGInfo::BabyMEGInfo()\n: g_maxlen(500)\n{\n}\n\/\/*************************************************************************************************************\n\nvoid BabyMEGInfo::MGH_LM_Send_CMDPackage(QByteArray DATA)\n{\n\/\/ qDebug()<<\"[BabyMEGInfo]CMD Size:\"<<DATA.size();\n emit SendCMDPackage(DATA);\n}\n\/\/*************************************************************************************************************\n\nvoid BabyMEGInfo::MGH_LM_Send_DataPackage(QByteArray DATA)\n{\n\/\/ qDebug()<<\"[BabyMEGInfo]Data Size:\"<<DATA.size();\n emit SendDataPackage(DATA);\n}\n\n\/\/*************************************************************************************************************\n\nQByteArray BabyMEGInfo::MGH_LM_Get_Field(QByteArray cmdstr)\n{\n bool Start = false;\n qint32 bPos = 0;\n qint32 ePos = 0;\n qint32 cn = 0;\n for(qint32 i=0;i<cmdstr.size();i++)\n {\n if (cmdstr[i] == ':')\n { \/\/ get channel number\n Start = !Start;\n if (Start)\n {\n bPos = i;\n }\n else\n {\n ePos = i;\n }\n cn ++;\n }\n if (cn == 2)\n { \/\/ find the first \":\" and the next \":\"\n break;\n }\n\n }\n\n return cmdstr.mid(bPos,ePos-bPos);\n\n}\n\n\/\/*************************************************************************************************************\n\nQStringList BabyMEGInfo::MGH_LM_Exact_Single_Channel_Info(QByteArray cmdstr)\n{\n QStringList sList;\n qint32 sp =0;\n qint32 ep =0;\n \/\/extract single channel information by char ';'\n for (qint32 i=0;i<cmdstr.size();i++)\n {\n if (cmdstr[i]==';')\n {\n ep = i;\n QString t = cmdstr.mid(sp,ep-sp);\n \/\/qDebug()<<\"[BabyMEGInfo] chan-name\"<<t;\n sList.append(t);\n sp = i+1;\n }\n }\n\n return sList;\n\n}\n\n\/\/*************************************************************************************************************\n\nvoid BabyMEGInfo::MGH_LM_Get_Channel_Info(QByteArray cmdstr)\n{\n \/\/operation about lm_ch_names\n if (cmdstr[0]==':')\n cmdstr.remove(0,1);\n\n QStringList sList = MGH_LM_Exact_Single_Channel_Info(cmdstr);\n\n lm_ch_names.clear();\n lm_ch_scales.clear();\n lm_ch_pos1.clear();\n lm_ch_pos2.clear();\n lm_ch_pos3.clear();\n lm_ch_pos4.clear();\n lm_ch_pos5.clear();\n lm_ch_pos6.clear();\n lm_ch_pos7.clear();\n lm_ch_pos8.clear();\n lm_ch_pos9.clear();\n lm_ch_pos10.clear();\n lm_ch_pos11.clear();\n lm_ch_pos12.clear();\n\n\n \/\/ parse the information for each channel\n for(qint32 k =0; k<sList.size(); k++)\n {\n QString t = sList.at(k);\n for (qint32 z=0;z<t.size();z++)\n {\n if (t[z]=='|')\n {\n lm_ch_names.append(t.left(z));\n \/\/qDebug()<<t.left(z);\n \/\/extract the substring contained channel information: scale and coil positions\n QString tt = t.mid(z);\n \/\/qDebug()<<tt;\n \/\/extract value array from tt by separated char \",\"\n QStringList schp = tt.split(\",\");\n\n \/\/ scale\n lm_ch_scales.append(schp.at(0));\n \/\/ positions : x,y,z and units of x,y,z\n lm_ch_pos1.append(schp.at(1));\n lm_ch_pos2.append(schp.at(2));\n lm_ch_pos3.append(schp.at(3));\n lm_ch_pos4.append(schp.at(4));\n lm_ch_pos5.append(schp.at(5));\n lm_ch_pos6.append(schp.at(6));\n lm_ch_pos7.append(schp.at(7));\n lm_ch_pos8.append(schp.at(8));\n lm_ch_pos9.append(schp.at(9));\n lm_ch_pos10.append(schp.at(10));\n lm_ch_pos11.append(schp.at(11));\n lm_ch_pos12.append(schp.at(12));\n\n\/\/ qDebug()<<lm_ch_scales;\n\/\/ qDebug()<<lm_ch_pos2;\n\n\n }\n }\n }\n return;\n}\n\n\/\/*************************************************************************************************************\n\nvoid BabyMEGInfo::MGH_LM_Parse_Para(QByteArray cmdstr)\n{\n\n QByteArray CMD = cmdstr.left(4);\n if (CMD == \"INFO\")\n {\n \/\/remove INFO\n cmdstr.remove(0,4);\n \/\/ACQ the number of channels\n QByteArray T = MGH_LM_Get_Field(cmdstr);\n cmdstr.remove(0,T.size());\n T.remove(0,1);\n chnNum = T.toInt();\n \/\/ACQ the length of data package\n T = MGH_LM_Get_Field(cmdstr);\n cmdstr.remove(0,T.size());\n T.remove(0,1);\n dataLength = T.toInt();\n \/\/ ACQ sampling rate\n T = MGH_LM_Get_Field(cmdstr);\n cmdstr.remove(0,T.size());\n T.remove(0,1);\n sfreq = T.toDouble();\n qDebug()<<\"[babyMEGinfo] chnNum:\" << chnNum << \"Data Length\" <<dataLength<<\"sampling rate\"<<sfreq;\n \/\/qDebug()<<\"cmdstr\"<<cmdstr;\n \/\/ Start to acquire the channel's name and channel's scale\n MGH_LM_Get_Channel_Info(cmdstr);\n\n }\n else\n {\n chnNum = 464;\n dataLength = 5000;\n sfreq = 10000;\n }\n\n \/\/ Parameters\n m_FiffInfo.file_id.version = 0; \/\/ToDo\n\n m_FiffInfo.meas_date[0] = 0;\n m_FiffInfo.meas_date[1] = 0;\n m_FiffInfo.sfreq = sfreq;\n m_FiffInfo.highpass = 0;\n m_FiffInfo.lowpass = m_FiffInfo.sfreq\/2;\n m_FiffInfo.acq_pars = QString(\"BabyMEG\");\n m_FiffInfo.acq_stim = QString(\"\");\n m_FiffInfo.filename = QString(\"\");\n m_FiffInfo.meas_id.version = 1;\n m_FiffInfo.nchan = chnNum; \/\/464;\n\n \/\/MEG\n for(qint32 i = 0; i < chnNum; i++)\n {\n FiffChInfo t_ch;\n\n t_ch.ch_name = lm_ch_names.at(i); \/\/QString(\"MEG%1\").arg(i);\n \/\/qDebug()<<t_ch.ch_name;\n t_ch.scanno = i;\n t_ch.logno = i+1;\n \/\/t_ch.cal = 1;\n t_ch.cal = lm_ch_scales.at(i).toFloat(); \/\/ set scale\n qDebug()<<t_ch.cal;\n t_ch.range = 1;\n t_ch.loc.setZero(12,1);\n\n \/\/set loc\n t_ch.loc(0,0) = lm_ch_pos1.at(i).toDouble();\n t_ch.loc(1,0) = lm_ch_pos2.at(i).toDouble();\n t_ch.loc(2,0) = lm_ch_pos3.at(i).toDouble();\n t_ch.loc(3,0) = lm_ch_pos4.at(i).toDouble();\n t_ch.loc(4,0) = lm_ch_pos5.at(i).toDouble();\n t_ch.loc(5,0) = lm_ch_pos6.at(i).toDouble();\n t_ch.loc(6,0) = lm_ch_pos7.at(i).toDouble();\n t_ch.loc(7,0) = lm_ch_pos8.at(i).toDouble();\n t_ch.loc(8,0) = lm_ch_pos9.at(i).toDouble();\n t_ch.loc(9,0) = lm_ch_pos10.at(i).toDouble();\n t_ch.loc(10,0) = lm_ch_pos11.at(i).toDouble();\n t_ch.loc(11,0) = lm_ch_pos12.at(i).toDouble();\n\n qDebug()<<t_ch.loc(0,0)<<t_ch.loc(1,0)<<t_ch.loc(2,0);\n\n QString type = t_ch.ch_name.left(3);\n int ntype = 0;\n if (type == \"MEG\")\n ntype = 1;\n else if (type == \"EEG\")\n ntype = 2;\n switch (ntype)\n {\n case 1:\n t_ch.kind = FIFFV_MEG_CH;\n t_ch.unit = FIFF_UNIT_T;\n t_ch.unit_mul = FIFF_UNITM_NONE;\n t_ch.coil_type = FIFFV_COIL_BABY_MAG;\/\/ ToDo FIFFV_COIL_BABY_REF_MAG\n break;\n case 2:\n t_ch.kind = FIFFV_EEG_CH;\n t_ch.unit = FIFF_UNIT_V;\n t_ch.unit_mul = FIFF_UNITM_NONE;\n t_ch.coil_type = FIFFV_COIL_EEG;\n break;\n default:\n t_ch.kind = FIFFV_MEG_CH;\n t_ch.unit = FIFF_UNIT_T;\n t_ch.unit_mul = FIFF_UNITM_NONE;\n t_ch.coil_type = FIFFV_COIL_BABY_MAG;\/\/ ToDo FIFFV_COIL_BABY_REF_MAG\n\n break;\n }\n m_FiffInfo.chs.append(t_ch);\n m_FiffInfo.ch_names.append(t_ch.ch_name);\n }\n\n emit fiffInfoAvailable(m_FiffInfo);\n\n return;\n}\n\n\/\/*************************************************************************************************************\n\nvoid BabyMEGInfo::EnQueue(QByteArray DataIn)\n{\n g_mutex.lock();\n if (g_queue.size() == g_maxlen) {\n qDebug() << \"g_queue is full, waiting!\";\n g_queueNotFull.wait(&g_mutex);\n }\n g_queue.enqueue(DataIn);\n g_queueNotEmpty.wakeAll();\n g_mutex.unlock();\n qDebug() << \"Data In...[size=\"<<g_queue.size()<<\"]\";\n}\n\/\/*************************************************************************************************************\n\nQByteArray BabyMEGInfo::DeQueue()\n{\n QMutexLocker locker(&g_mutex);\n if (g_queue.isEmpty()) {\n qDebug() << \"g_queue empty, waiting!\";\n g_queueNotEmpty.wait(&g_mutex);\n }\n QByteArray val = g_queue.dequeue();\n g_queueNotFull.wakeAll();\n qDebug() << \"Data Out...[size=\"<<g_queue.size()<<\"]\";\n return val;\n}\n<commit_msg>set scale value to unitmult in fiff structure<commit_after>\/\/=============================================================================================================\n\/**\n* @file babymeginfo.cpp\n* @author Limin Sun <liminsun@nmr.mgh.harvard.edu>;\n* Christoph Dinh <chdinh@nmr.mgh.harvard.edu>;\n* Matti Hamalainen <msh@nmr.mgh.harvard.edu>\n* @version 1.0\n* @date April, 2013\n*\n* @section LICENSE\n*\n* Copyright (C) 2013, Limin Sun, 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 implementation of the BabyMEGInfo Class.\n*\n*\/\n\n#include \"babymeginfo.h\"\n\n\n\n\/\/*************************************************************************************************************\n\nBabyMEGInfo::BabyMEGInfo()\n: g_maxlen(500)\n{\n}\n\/\/*************************************************************************************************************\n\nvoid BabyMEGInfo::MGH_LM_Send_CMDPackage(QByteArray DATA)\n{\n\/\/ qDebug()<<\"[BabyMEGInfo]CMD Size:\"<<DATA.size();\n emit SendCMDPackage(DATA);\n}\n\/\/*************************************************************************************************************\n\nvoid BabyMEGInfo::MGH_LM_Send_DataPackage(QByteArray DATA)\n{\n\/\/ qDebug()<<\"[BabyMEGInfo]Data Size:\"<<DATA.size();\n emit SendDataPackage(DATA);\n}\n\n\/\/*************************************************************************************************************\n\nQByteArray BabyMEGInfo::MGH_LM_Get_Field(QByteArray cmdstr)\n{\n bool Start = false;\n qint32 bPos = 0;\n qint32 ePos = 0;\n qint32 cn = 0;\n for(qint32 i=0;i<cmdstr.size();i++)\n {\n if (cmdstr[i] == ':')\n { \/\/ get channel number\n Start = !Start;\n if (Start)\n {\n bPos = i;\n }\n else\n {\n ePos = i;\n }\n cn ++;\n }\n if (cn == 2)\n { \/\/ find the first \":\" and the next \":\"\n break;\n }\n\n }\n\n return cmdstr.mid(bPos,ePos-bPos);\n\n}\n\n\/\/*************************************************************************************************************\n\nQStringList BabyMEGInfo::MGH_LM_Exact_Single_Channel_Info(QByteArray cmdstr)\n{\n QStringList sList;\n qint32 sp =0;\n qint32 ep =0;\n \/\/extract single channel information by char ';'\n for (qint32 i=0;i<cmdstr.size();i++)\n {\n if (cmdstr[i]==';')\n {\n ep = i;\n QString t = cmdstr.mid(sp,ep-sp);\n \/\/qDebug()<<\"[BabyMEGInfo] chan-name\"<<t;\n sList.append(t);\n sp = i+1;\n }\n }\n\n return sList;\n\n}\n\n\/\/*************************************************************************************************************\n\nvoid BabyMEGInfo::MGH_LM_Get_Channel_Info(QByteArray cmdstr)\n{\n \/\/operation about lm_ch_names\n if (cmdstr[0]==':')\n cmdstr.remove(0,1);\n\n QStringList sList = MGH_LM_Exact_Single_Channel_Info(cmdstr);\n\n lm_ch_names.clear();\n lm_ch_scales.clear();\n lm_ch_pos1.clear();\n lm_ch_pos2.clear();\n lm_ch_pos3.clear();\n lm_ch_pos4.clear();\n lm_ch_pos5.clear();\n lm_ch_pos6.clear();\n lm_ch_pos7.clear();\n lm_ch_pos8.clear();\n lm_ch_pos9.clear();\n lm_ch_pos10.clear();\n lm_ch_pos11.clear();\n lm_ch_pos12.clear();\n\n\n \/\/ parse the information for each channel\n for(qint32 k =0; k<sList.size(); k++)\n {\n QString t = sList.at(k);\n for (qint32 z=0;z<t.size();z++)\n {\n if (t[z]=='|')\n {\n lm_ch_names.append(t.left(z));\n \/\/qDebug()<<t.left(z);\n \/\/extract the substring contained channel information: scale and coil positions\n QString tt = t.mid(z);\n \/\/qDebug()<<tt;\n \/\/extract value array from tt by separated char \",\"\n QStringList schp = tt.split(\",\");\n\n \/\/ scale\n lm_ch_scales.append(schp.at(0));\n \/\/ positions : x,y,z and units of x,y,z\n lm_ch_pos1.append(schp.at(1));\n lm_ch_pos2.append(schp.at(2));\n lm_ch_pos3.append(schp.at(3));\n lm_ch_pos4.append(schp.at(4));\n lm_ch_pos5.append(schp.at(5));\n lm_ch_pos6.append(schp.at(6));\n lm_ch_pos7.append(schp.at(7));\n lm_ch_pos8.append(schp.at(8));\n lm_ch_pos9.append(schp.at(9));\n lm_ch_pos10.append(schp.at(10));\n lm_ch_pos11.append(schp.at(11));\n lm_ch_pos12.append(schp.at(12));\n\n\/\/ qDebug()<<lm_ch_scales;\n\/\/ qDebug()<<lm_ch_pos2;\n\n\n }\n }\n }\n return;\n}\n\n\/\/*************************************************************************************************************\n\nvoid BabyMEGInfo::MGH_LM_Parse_Para(QByteArray cmdstr)\n{\n\n QByteArray CMD = cmdstr.left(4);\n if (CMD == \"INFO\")\n {\n \/\/remove INFO\n cmdstr.remove(0,4);\n \/\/ACQ the number of channels\n QByteArray T = MGH_LM_Get_Field(cmdstr);\n cmdstr.remove(0,T.size());\n T.remove(0,1);\n chnNum = T.toInt();\n \/\/ACQ the length of data package\n T = MGH_LM_Get_Field(cmdstr);\n cmdstr.remove(0,T.size());\n T.remove(0,1);\n dataLength = T.toInt();\n \/\/ ACQ sampling rate\n T = MGH_LM_Get_Field(cmdstr);\n cmdstr.remove(0,T.size());\n T.remove(0,1);\n sfreq = T.toDouble();\n qDebug()<<\"[babyMEGinfo] chnNum:\" << chnNum << \"Data Length\" <<dataLength<<\"sampling rate\"<<sfreq;\n \/\/qDebug()<<\"cmdstr\"<<cmdstr;\n \/\/ Start to acquire the channel's name and channel's scale\n MGH_LM_Get_Channel_Info(cmdstr);\n\n }\n else\n {\n chnNum = 464;\n dataLength = 5000;\n sfreq = 10000;\n }\n\n \/\/ Parameters\n m_FiffInfo.file_id.version = 0; \/\/ToDo\n\n m_FiffInfo.meas_date[0] = 0;\n m_FiffInfo.meas_date[1] = 0;\n m_FiffInfo.sfreq = sfreq;\n m_FiffInfo.highpass = 0;\n m_FiffInfo.lowpass = m_FiffInfo.sfreq\/2;\n m_FiffInfo.acq_pars = QString(\"BabyMEG\");\n m_FiffInfo.acq_stim = QString(\"\");\n m_FiffInfo.filename = QString(\"\");\n m_FiffInfo.meas_id.version = 1;\n m_FiffInfo.nchan = chnNum; \/\/464;\n\n \/\/MEG\n for(qint32 i = 0; i < chnNum; i++)\n {\n FiffChInfo t_ch;\n\n t_ch.ch_name = lm_ch_names.at(i); \/\/QString(\"MEG%1\").arg(i);\n \/\/qDebug()<<t_ch.ch_name;\n t_ch.scanno = i;\n t_ch.logno = i+1;\n t_ch.cal = 1;\n t_ch.unit_mul = lm_ch_scales.at(i).toFloat(); \/\/ set scale\n \/\/qDebug()<<t_ch.cal;\n t_ch.range = 1;\n t_ch.loc.setZero(12,1);\n\n \/\/set loc\n t_ch.loc(0,0) = lm_ch_pos1.at(i).toDouble();\n t_ch.loc(1,0) = lm_ch_pos2.at(i).toDouble();\n t_ch.loc(2,0) = lm_ch_pos3.at(i).toDouble();\n t_ch.loc(3,0) = lm_ch_pos4.at(i).toDouble();\n t_ch.loc(4,0) = lm_ch_pos5.at(i).toDouble();\n t_ch.loc(5,0) = lm_ch_pos6.at(i).toDouble();\n t_ch.loc(6,0) = lm_ch_pos7.at(i).toDouble();\n t_ch.loc(7,0) = lm_ch_pos8.at(i).toDouble();\n t_ch.loc(8,0) = lm_ch_pos9.at(i).toDouble();\n t_ch.loc(9,0) = lm_ch_pos10.at(i).toDouble();\n t_ch.loc(10,0) = lm_ch_pos11.at(i).toDouble();\n t_ch.loc(11,0) = lm_ch_pos12.at(i).toDouble();\n\n \/\/qDebug()<<t_ch.loc(0,0)<<t_ch.loc(1,0)<<t_ch.loc(2,0);\n\n QString type = t_ch.ch_name.left(3);\n int ntype = 0;\n if (type == \"MEG\")\n ntype = 1;\n else if (type == \"EEG\")\n ntype = 2;\n switch (ntype)\n {\n case 1:\n t_ch.kind = FIFFV_MEG_CH;\n t_ch.unit = FIFF_UNIT_T;\n t_ch.unit_mul = FIFF_UNITM_NONE;\n t_ch.coil_type = FIFFV_COIL_BABY_MAG;\/\/ ToDo FIFFV_COIL_BABY_REF_MAG\n break;\n case 2:\n t_ch.kind = FIFFV_EEG_CH;\n t_ch.unit = FIFF_UNIT_V;\n t_ch.unit_mul = FIFF_UNITM_NONE;\n t_ch.coil_type = FIFFV_COIL_EEG;\n break;\n default:\n t_ch.kind = FIFFV_MEG_CH;\n t_ch.unit = FIFF_UNIT_T;\n t_ch.unit_mul = FIFF_UNITM_NONE;\n t_ch.coil_type = FIFFV_COIL_BABY_MAG;\/\/ ToDo FIFFV_COIL_BABY_REF_MAG\n\n break;\n }\n m_FiffInfo.chs.append(t_ch);\n m_FiffInfo.ch_names.append(t_ch.ch_name);\n }\n\n emit fiffInfoAvailable(m_FiffInfo);\n\n return;\n}\n\n\/\/*************************************************************************************************************\n\nvoid BabyMEGInfo::EnQueue(QByteArray DataIn)\n{\n g_mutex.lock();\n if (g_queue.size() == g_maxlen) {\n qDebug() << \"g_queue is full, waiting!\";\n g_queueNotFull.wait(&g_mutex);\n }\n g_queue.enqueue(DataIn);\n g_queueNotEmpty.wakeAll();\n g_mutex.unlock();\n qDebug() << \"Data In...[size=\"<<g_queue.size()<<\"]\";\n}\n\/\/*************************************************************************************************************\n\nQByteArray BabyMEGInfo::DeQueue()\n{\n QMutexLocker locker(&g_mutex);\n if (g_queue.isEmpty()) {\n qDebug() << \"g_queue empty, waiting!\";\n g_queueNotEmpty.wait(&g_mutex);\n }\n QByteArray val = g_queue.dequeue();\n g_queueNotFull.wakeAll();\n qDebug() << \"Data Out...[size=\"<<g_queue.size()<<\"]\";\n return val;\n}\n<|endoftext|>"} {"text":"<commit_before>#include <config.h>\n\n#include <chrono>\n#include <stdexcept>\n#include <thread>\n#include <vector>\n#include <gtest\/gtest.h>\n#include <primitiv\/naive_device.h>\n#include <primitiv\/shape.h>\n#include <primitiv\/tensor.h>\n#include <test_utils.h>\n\nusing std::vector;\nusing test_utils::vector_match;\n\nnamespace primitiv {\n\nclass NaiveDeviceTest : public testing::Test {};\n\nTEST_F(NaiveDeviceTest, CheckDeviceType) {\n devices::Naive dev;\n EXPECT_EQ(Device::DEVICE_TYPE_CPU, dev.type());\n}\n\nTEST_F(NaiveDeviceTest, CheckNewDelete) {\n {\n devices::Naive dev;\n {\n Tensor x1 = dev.new_tensor(Shape()); \/\/ 1 value\n Tensor x2 = dev.new_tensor(Shape({16, 16})); \/\/ 256 values\n Tensor x3 = dev.new_tensor(Shape({16, 16, 16}, 16)); \/\/ 65536 values\n }\n \/\/ All tensors are already deleted before arriving here.\n }\n SUCCEED();\n}\n\nTEST_F(NaiveDeviceTest, CheckDanglingTensor) {\n {\n Tensor x1;\n {\n devices::Naive dev;\n x1 = dev.new_tensor(Shape());\n }\n \/\/ x1 still has valid object,\n \/\/ but there is no guarantee that the memory is alive.\n \/\/ Our implementation only guarantees the safety to delete Tensors anytime.\n }\n SUCCEED();\n}\n\nTEST_F(NaiveDeviceTest, CheckRandomBernoulli) {\n vector<vector<float>> history;\n for (unsigned i = 0; i < 10; ++i) {\n devices::Naive dev;\n const Tensor x = dev.random_bernoulli(Shape({3, 3}, 3), 0.3);\n const vector<float> x_val = x.to_vector();\n\n std::cout << \"Epoch \" << i << ':';\n for (float x_i : x_val) {\n std::cout << ' ' << x_i;\n }\n std::cout << std::endl;\n\n for (const vector<float> &h_val : history) {\n EXPECT_FALSE(vector_match(x_val, h_val));\n }\n history.emplace_back(x_val);\n\n \/\/ Wait for updating the device randomizer.\n std::this_thread::sleep_for(std::chrono::milliseconds(20));\n }\n}\n\nTEST_F(NaiveDeviceTest, CheckRandomBernoulliWithSeed) {\n const vector<float> expected {\n 0, 1, 1, 0, 0, 0, 0, 0, 0, 1, 0, 1, 1, 0, 0, 0,\n 0, 0, 0, 1, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0,\n 0, 0, 0, 0, 0, 0, 0, 1, 1, 0, 0, 0, 0, 0, 0, 0,\n 0, 0, 1, 0, 0, 1, 1, 0, 0, 0, 0, 1, 1, 0, 0, 0,\n };\n devices::Naive dev(12345);\n const Tensor x = dev.random_bernoulli(Shape({4, 4}, 4), 0.3);\n EXPECT_TRUE(vector_match(expected, x.to_vector()));\n}\n\nTEST_F(NaiveDeviceTest, CheckRandomUniform) {\n vector<vector<float>> history;\n for (unsigned i = 0; i < 10; ++i) {\n devices::Naive dev;\n const Tensor x = dev.random_uniform(Shape({2, 2}, 2), -9, 9);\n const vector<float> x_val = x.to_vector();\n\n std::cout << \"Epoch \" << i << ':';\n for (float x_i : x_val) {\n std::cout << ' ' << x_i;\n }\n std::cout << std::endl;\n\n for (const vector<float> &h_val : history) {\n EXPECT_FALSE(vector_match(x_val, h_val));\n }\n history.emplace_back(x_val);\n\n \/\/ Wait for updating the device randomizer.\n std::this_thread::sleep_for(std::chrono::milliseconds(20));\n }\n}\n\nTEST_F(NaiveDeviceTest, CheckRandomUniformWithSeed) {\n const vector<float> expected {\n 7.7330894e+00, 7.0227852e+00, -3.3052402e+00, -6.6472688e+00,\n -5.6894612e+00, -8.2843294e+00, -5.3179150e+00, 5.8758497e+00,\n };\n devices::Naive dev(12345);\n const Tensor x = dev.random_uniform(Shape({2, 2}, 2), -9, 9);\n EXPECT_TRUE(vector_match(expected, x.to_vector()));\n}\n\nTEST_F(NaiveDeviceTest, CheckRandomNormal) {\n vector<vector<float>> history;\n for (unsigned i = 0; i < 10; ++i) {\n devices::Naive dev;\n const Tensor x = dev.random_normal(Shape({2, 2}, 2), 1, 3);\n const vector<float> x_val = x.to_vector();\n\n std::cout << \"Epoch \" << i << ':';\n for (float x_i : x_val) {\n std::cout << ' ' << x_i;\n }\n std::cout << std::endl;\n\n for (const vector<float> &h_val : history) {\n EXPECT_FALSE(vector_match(x_val, h_val));\n }\n history.emplace_back(x_val);\n\n \/\/ Wait for updating the device randomizer.\n std::this_thread::sleep_for(std::chrono::milliseconds(20));\n }\n}\n\nTEST_F(NaiveDeviceTest, CheckRandomNormalWithSeed) {\n const vector<float> expected {\n -1.3574908e+00, -1.7222166e-01, 2.5865970e+00, -4.3594337e-01,\n 4.5383353e+00, 8.4703674e+00, 2.5535507e+00, 1.3252910e+00,\n };\n devices::Naive dev(12345);\n const Tensor x = dev.random_normal(Shape({2, 2}, 2), 1, 3);\n EXPECT_TRUE(vector_match(expected, x.to_vector()));\n}\n\nTEST_F(NaiveDeviceTest, CheckRandomLogNormal) {\n vector<vector<float>> history;\n for (unsigned i = 0; i < 10; ++i) {\n devices::Naive dev;\n const Tensor x = dev.random_log_normal(Shape({2, 2}, 2), 1, 3);\n const vector<float> x_val = x.to_vector();\n\n std::cout << \"Epoch \" << i << ':';\n for (float x_i : x_val) {\n std::cout << ' ' << x_i;\n }\n std::cout << std::endl;\n\n for (const vector<float> &h_val : history) {\n EXPECT_FALSE(vector_match(x_val, h_val));\n }\n history.emplace_back(x_val);\n\n \/\/ Wait for updating the device randomizer.\n std::this_thread::sleep_for(std::chrono::milliseconds(20));\n }\n}\n\nTEST_F(NaiveDeviceTest, CheckRandomLogNormalWithSeed) {\n const vector<float> expected {\n 2.5730559e-01, 8.4179258e-01, 1.3284487e+01, 6.4665437e-01,\n 9.3534966e+01, 4.7712681e+03, 1.2852659e+01, 3.7632804e+00,\n };\n devices::Naive dev(12345);\n const Tensor x = dev.random_log_normal(Shape({2, 2}, 2), 1, 3);\n EXPECT_TRUE(vector_match(expected, x.to_vector()));\n}\n\n} \/\/ namespace primitiv\n<commit_msg>Add expected results of naive_device_test for libcpp<commit_after>#include <config.h>\n\n#include <chrono>\n#include <stdexcept>\n#include <thread>\n#include <vector>\n#include <gtest\/gtest.h>\n#include <primitiv\/naive_device.h>\n#include <primitiv\/shape.h>\n#include <primitiv\/tensor.h>\n#include <test_utils.h>\n\nusing std::vector;\nusing test_utils::vector_match;\n\nnamespace primitiv {\n\nclass NaiveDeviceTest : public testing::Test {};\n\nTEST_F(NaiveDeviceTest, CheckDeviceType) {\n devices::Naive dev;\n EXPECT_EQ(Device::DEVICE_TYPE_CPU, dev.type());\n}\n\nTEST_F(NaiveDeviceTest, CheckNewDelete) {\n {\n devices::Naive dev;\n {\n Tensor x1 = dev.new_tensor(Shape()); \/\/ 1 value\n Tensor x2 = dev.new_tensor(Shape({16, 16})); \/\/ 256 values\n Tensor x3 = dev.new_tensor(Shape({16, 16, 16}, 16)); \/\/ 65536 values\n }\n \/\/ All tensors are already deleted before arriving here.\n }\n SUCCEED();\n}\n\nTEST_F(NaiveDeviceTest, CheckDanglingTensor) {\n {\n Tensor x1;\n {\n devices::Naive dev;\n x1 = dev.new_tensor(Shape());\n }\n \/\/ x1 still has valid object,\n \/\/ but there is no guarantee that the memory is alive.\n \/\/ Our implementation only guarantees the safety to delete Tensors anytime.\n }\n SUCCEED();\n}\n\nTEST_F(NaiveDeviceTest, CheckRandomBernoulli) {\n vector<vector<float>> history;\n for (unsigned i = 0; i < 10; ++i) {\n devices::Naive dev;\n const Tensor x = dev.random_bernoulli(Shape({3, 3}, 3), 0.3);\n const vector<float> x_val = x.to_vector();\n\n std::cout << \"Epoch \" << i << ':';\n for (float x_i : x_val) {\n std::cout << ' ' << x_i;\n }\n std::cout << std::endl;\n\n for (const vector<float> &h_val : history) {\n EXPECT_FALSE(vector_match(x_val, h_val));\n }\n history.emplace_back(x_val);\n\n \/\/ Wait for updating the device randomizer.\n std::this_thread::sleep_for(std::chrono::milliseconds(20));\n }\n}\n\nTEST_F(NaiveDeviceTest, CheckRandomBernoulliWithSeed) {\n const vector<float> expected {\n 0, 1, 1, 0, 0, 0, 0, 0, 0, 1, 0, 1, 1, 0, 0, 0,\n 0, 0, 0, 1, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0,\n 0, 0, 0, 0, 0, 0, 0, 1, 1, 0, 0, 0, 0, 0, 0, 0,\n 0, 0, 1, 0, 0, 1, 1, 0, 0, 0, 0, 1, 1, 0, 0, 0,\n };\n devices::Naive dev(12345);\n const Tensor x = dev.random_bernoulli(Shape({4, 4}, 4), 0.3);\n EXPECT_TRUE(vector_match(expected, x.to_vector()));\n}\n\nTEST_F(NaiveDeviceTest, CheckRandomUniform) {\n vector<vector<float>> history;\n for (unsigned i = 0; i < 10; ++i) {\n devices::Naive dev;\n const Tensor x = dev.random_uniform(Shape({2, 2}, 2), -9, 9);\n const vector<float> x_val = x.to_vector();\n\n std::cout << \"Epoch \" << i << ':';\n for (float x_i : x_val) {\n std::cout << ' ' << x_i;\n }\n std::cout << std::endl;\n\n for (const vector<float> &h_val : history) {\n EXPECT_FALSE(vector_match(x_val, h_val));\n }\n history.emplace_back(x_val);\n\n \/\/ Wait for updating the device randomizer.\n std::this_thread::sleep_for(std::chrono::milliseconds(20));\n }\n}\n\nTEST_F(NaiveDeviceTest, CheckRandomUniformWithSeed) {\n const vector<float> expected {\n 7.7330894e+00, 7.0227852e+00, -3.3052402e+00, -6.6472688e+00,\n -5.6894612e+00, -8.2843294e+00, -5.3179150e+00, 5.8758497e+00,\n };\n devices::Naive dev(12345);\n const Tensor x = dev.random_uniform(Shape({2, 2}, 2), -9, 9);\n EXPECT_TRUE(vector_match(expected, x.to_vector()));\n}\n\nTEST_F(NaiveDeviceTest, CheckRandomNormal) {\n vector<vector<float>> history;\n for (unsigned i = 0; i < 10; ++i) {\n devices::Naive dev;\n const Tensor x = dev.random_normal(Shape({2, 2}, 2), 1, 3);\n const vector<float> x_val = x.to_vector();\n\n std::cout << \"Epoch \" << i << ':';\n for (float x_i : x_val) {\n std::cout << ' ' << x_i;\n }\n std::cout << std::endl;\n\n for (const vector<float> &h_val : history) {\n EXPECT_FALSE(vector_match(x_val, h_val));\n }\n history.emplace_back(x_val);\n\n \/\/ Wait for updating the device randomizer.\n std::this_thread::sleep_for(std::chrono::milliseconds(20));\n }\n}\n\nTEST_F(NaiveDeviceTest, CheckRandomNormalWithSeed) {\n#ifdef __GLIBCXX__\n const vector<float> expected {\n -1.3574908e+00, -1.7222166e-01, 2.5865970e+00, -4.3594337e-01,\n 4.5383353e+00, 8.4703674e+00, 2.5535507e+00, 1.3252910e+00,\n };\n#elif defined _LIBCPP_VERSION\n const vector<float> expected {\n -1.7222166e-01, -1.3574908e+00, -4.3594337e-01, 2.5865970e+00,\n 8.4703674e+00, 4.5383353e+00, 1.3252910e+00, 2.5535507e+00,\n };\n#else\n const vector<float> expected {};\n#endif\n devices::Naive dev(12345);\n const Tensor x = dev.random_normal(Shape({2, 2}, 2), 1, 3);\n EXPECT_TRUE(vector_match(expected, x.to_vector()));\n}\n\nTEST_F(NaiveDeviceTest, CheckRandomLogNormal) {\n vector<vector<float>> history;\n for (unsigned i = 0; i < 10; ++i) {\n devices::Naive dev;\n const Tensor x = dev.random_log_normal(Shape({2, 2}, 2), 1, 3);\n const vector<float> x_val = x.to_vector();\n\n std::cout << \"Epoch \" << i << ':';\n for (float x_i : x_val) {\n std::cout << ' ' << x_i;\n }\n std::cout << std::endl;\n\n for (const vector<float> &h_val : history) {\n EXPECT_FALSE(vector_match(x_val, h_val));\n }\n history.emplace_back(x_val);\n\n \/\/ Wait for updating the device randomizer.\n std::this_thread::sleep_for(std::chrono::milliseconds(20));\n }\n}\n\nTEST_F(NaiveDeviceTest, CheckRandomLogNormalWithSeed) {\n#ifdef __GLIBCXX__\n const vector<float> expected {\n 2.5730559e-01, 8.4179258e-01, 1.3284487e+01, 6.4665437e-01,\n 9.3534966e+01, 4.7712681e+03, 1.2852659e+01, 3.7632804e+00,\n };\n#elif defined _LIBCPP_VERSION\n const vector<float> expected {\n 8.4179258e-01, 2.5730559e-01, 6.4665437e-01, 1.3284487e+01,\n 4.7712681e+03, 9.3534966e+01, 3.7632804e+00, 1.2852659e+01,\n };\n#else\n const vector<float> expected {};\n#endif\n devices::Naive dev(12345);\n const Tensor x = dev.random_log_normal(Shape({2, 2}, 2), 1, 3);\n EXPECT_TRUE(vector_match(expected, x.to_vector()));\n}\n\n} \/\/ namespace primitiv\n<|endoftext|>"} {"text":"<commit_before>\/* A BlockEnvironment is created when a block is created. Its primary\n * operation is call, which activates the code associated with the block. *\/\n\n#include \"block_environment.hpp\"\n#include \"objectmemory.hpp\"\n\n#include \"builtin\/compiledmethod.hpp\"\n#include \"builtin\/contexts.hpp\"\n#include \"builtin\/fixnum.hpp\"\n#include \"builtin\/symbol.hpp\"\n#include \"builtin\/task.hpp\"\n#include \"builtin\/tuple.hpp\"\n\nnamespace rubinius {\n void BlockEnvironment::call(STATE, Task* task, size_t args) {\n OBJECT val;\n if(args > 0) {\n Tuple* tup = Tuple::create(state, args);\n for(int i = args - 1; i >= 0; i--) {\n tup->put(state, i, task->pop());\n }\n\n val = tup;\n } else {\n val = Qnil;\n }\n task->pop(); \/\/ Remove this from the stack.\n BlockContext* ctx = create_context(state, task->active);\n task->make_active(ctx);\n task->push(val);\n }\n\n void BlockEnvironment::call(STATE, Message& msg) {\n throw std::runtime_error(\"call2: not implemented\");\n }\n\n \/\/ TODO - Untested!!!!!!!!!!\n bool BlockEnvironment::call_prim(STATE, VMExecutable* exec, Task* task, Message& msg) {\n call(state, task, msg.args);\n return true;\n }\n\n \/*\n * Allocates a context, adjusting the initial stack pointer by the number of\n * locals the method requires.\n *\/\n BlockContext* BlockEnvironment::create_context(STATE, MethodContext* sender) {\n BlockContext* ctx = BlockContext::create(state, method->stack_size->to_native());\n SET(ctx, sender, sender);\n SET(ctx, name, (SYMBOL)this);\n SET(ctx, cm, method);\n SET(ctx, home, home);\n\n ctx->vmm = vmm;\n ctx->ip = 0;\n \/\/ HACK dup'd from MethodContext\n ctx->position_stack(method->number_of_locals() - 1);\n\n return ctx;\n }\n\n BlockEnvironment* BlockEnvironment::under_context(STATE, CompiledMethod* cm,\n MethodContext* parent, MethodContext* active, size_t index) {\n\n BlockEnvironment* be = (BlockEnvironment*)state->new_object(G(blokenv));\n\n\n VMMethod* vmm;\n if((vmm = active->vmm->blocks[index]) == NULL) {\n vmm = new VMMethod(state, cm);\n if(active->vmm->type) {\n vmm->specialize(active->vmm->type);\n }\n active->vmm->blocks[index] = vmm;\n }\n\n SET(be, home, parent);\n SET(be, home_block, active);\n SET(be, method, cm);\n SET(be, local_count, cm->local_count);\n be->vmm = vmm;\n\n return be;\n }\n}\n<commit_msg>Add HACK about non-Symbol cast<commit_after>\/* A BlockEnvironment is created when a block is created. Its primary\n * operation is call, which activates the code associated with the block. *\/\n\n#include \"block_environment.hpp\"\n#include \"objectmemory.hpp\"\n\n#include \"builtin\/compiledmethod.hpp\"\n#include \"builtin\/contexts.hpp\"\n#include \"builtin\/fixnum.hpp\"\n#include \"builtin\/symbol.hpp\"\n#include \"builtin\/task.hpp\"\n#include \"builtin\/tuple.hpp\"\n\nnamespace rubinius {\n void BlockEnvironment::call(STATE, Task* task, size_t args) {\n OBJECT val;\n if(args > 0) {\n Tuple* tup = Tuple::create(state, args);\n for(int i = args - 1; i >= 0; i--) {\n tup->put(state, i, task->pop());\n }\n\n val = tup;\n } else {\n val = Qnil;\n }\n task->pop(); \/\/ Remove this from the stack.\n BlockContext* ctx = create_context(state, task->active);\n task->make_active(ctx);\n task->push(val);\n }\n\n void BlockEnvironment::call(STATE, Message& msg) {\n throw std::runtime_error(\"call2: not implemented\");\n }\n\n \/\/ TODO - Untested!!!!!!!!!!\n bool BlockEnvironment::call_prim(STATE, VMExecutable* exec, Task* task, Message& msg) {\n call(state, task, msg.args);\n return true;\n }\n\n \/*\n * Allocates a context, adjusting the initial stack pointer by the number of\n * locals the method requires.\n *\/\n BlockContext* BlockEnvironment::create_context(STATE, MethodContext* sender) {\n BlockContext* ctx = BlockContext::create(state, method->stack_size->to_native());\n SET(ctx, sender, sender);\n SET(ctx, name, (SYMBOL)this); \/\/ HACK don't cast non-Symbol to Symbol\n SET(ctx, cm, method);\n SET(ctx, home, home);\n\n ctx->vmm = vmm;\n ctx->ip = 0;\n \/\/ HACK dup'd from MethodContext\n ctx->position_stack(method->number_of_locals() - 1);\n\n return ctx;\n }\n\n BlockEnvironment* BlockEnvironment::under_context(STATE, CompiledMethod* cm,\n MethodContext* parent, MethodContext* active, size_t index) {\n\n BlockEnvironment* be = (BlockEnvironment*)state->new_object(G(blokenv));\n\n\n VMMethod* vmm;\n if((vmm = active->vmm->blocks[index]) == NULL) {\n vmm = new VMMethod(state, cm);\n if(active->vmm->type) {\n vmm->specialize(active->vmm->type);\n }\n active->vmm->blocks[index] = vmm;\n }\n\n SET(be, home, parent);\n SET(be, home_block, active);\n SET(be, method, cm);\n SET(be, local_count, cm->local_count);\n be->vmm = vmm;\n\n return be;\n }\n}\n<|endoftext|>"} {"text":"<commit_before>\/\/===- FunctionResolution.cpp - Resolve declarations to implementations ---===\/\/\n\/\/\n\/\/ Loop over the functions that are in the module and look for functions that\n\/\/ have the same name. More often than not, there will be things like:\n\/\/\n\/\/ declare void %foo(...)\n\/\/ void %foo(int, int) { ... }\n\/\/\n\/\/ because of the way things are declared in C. If this is the case, patch\n\/\/ things up.\n\/\/\n\/\/===----------------------------------------------------------------------===\/\/\n\n#include \"llvm\/Transforms\/IPO.h\"\n#include \"llvm\/Module.h\"\n#include \"llvm\/SymbolTable.h\"\n#include \"llvm\/DerivedTypes.h\"\n#include \"llvm\/Pass.h\"\n#include \"llvm\/iOther.h\"\n#include \"llvm\/Constant.h\"\n#include \"Support\/StatisticReporter.h\"\n#include <iostream>\n#include <algorithm>\n\nusing std::vector;\nusing std::string;\nusing std::cerr;\n\nnamespace {\n Statistic<>NumResolved(\"funcresolve\\t- Number of varargs functions resolved\");\n\n struct FunctionResolvingPass : public Pass {\n bool run(Module &M);\n };\n RegisterOpt<FunctionResolvingPass> X(\"funcresolve\", \"Resolve Functions\");\n}\n\nPass *createFunctionResolvingPass() {\n return new FunctionResolvingPass();\n}\n\n\/\/ ConvertCallTo - Convert a call to a varargs function with no arg types\n\/\/ specified to a concrete nonvarargs function.\n\/\/\nstatic void ConvertCallTo(CallInst *CI, Function *Dest) {\n const FunctionType::ParamTypes &ParamTys =\n Dest->getFunctionType()->getParamTypes();\n BasicBlock *BB = CI->getParent();\n\n \/\/ Keep an iterator to where we want to insert cast instructions if the\n \/\/ argument types don't agree.\n \/\/\n BasicBlock::iterator BBI = CI;\n assert(CI->getNumOperands()-1 == ParamTys.size() &&\n \"Function calls resolved funny somehow, incompatible number of args\");\n\n vector<Value*> Params;\n\n \/\/ Convert all of the call arguments over... inserting cast instructions if\n \/\/ the types are not compatible.\n for (unsigned i = 1; i < CI->getNumOperands(); ++i) {\n Value *V = CI->getOperand(i);\n\n if (V->getType() != ParamTys[i-1]) { \/\/ Must insert a cast...\n Instruction *Cast = new CastInst(V, ParamTys[i-1]);\n BBI = ++BB->getInstList().insert(BBI, Cast);\n V = Cast;\n }\n\n Params.push_back(V);\n }\n\n Instruction *NewCall = new CallInst(Dest, Params);\n\n \/\/ Replace the old call instruction with a new call instruction that calls\n \/\/ the real function.\n \/\/\n BBI = ++BB->getInstList().insert(BBI, NewCall);\n\n \/\/ Remove the old call instruction from the program...\n BB->getInstList().remove(BBI);\n\n \/\/ Transfer the name over...\n NewCall->setName(CI->getName());\n\n \/\/ Replace uses of the old instruction with the appropriate values...\n \/\/\n if (NewCall->getType() == CI->getType()) {\n CI->replaceAllUsesWith(NewCall);\n NewCall->setName(CI->getName());\n\n } else if (NewCall->getType() == Type::VoidTy) {\n \/\/ Resolved function does not return a value but the prototype does. This\n \/\/ often occurs because undefined functions default to returning integers.\n \/\/ Just replace uses of the call (which are broken anyway) with dummy\n \/\/ values.\n CI->replaceAllUsesWith(Constant::getNullValue(CI->getType()));\n } else if (CI->getType() == Type::VoidTy) {\n \/\/ If we are gaining a new return value, we don't have to do anything\n \/\/ special here, because it will automatically be ignored.\n } else {\n \/\/ Insert a cast instruction to convert the return value of the function\n \/\/ into it's new type. Of course we only need to do this if the return\n \/\/ value of the function is actually USED.\n \/\/\n if (!CI->use_empty()) {\n CastInst *NewCast = new CastInst(NewCall, CI->getType(),\n NewCall->getName());\n CI->replaceAllUsesWith(NewCast);\n \/\/ Insert the new cast instruction...\n BB->getInstList().insert(BBI, NewCast);\n }\n }\n\n \/\/ The old instruction is no longer needed, destroy it!\n delete CI;\n}\n\n\nbool FunctionResolvingPass::run(Module &M) {\n SymbolTable *ST = M.getSymbolTable();\n if (!ST) return false;\n\n std::map<string, vector<Function*> > Functions;\n\n \/\/ Loop over the entries in the symbol table. If an entry is a func pointer,\n \/\/ then add it to the Functions map. We do a two pass algorithm here to avoid\n \/\/ problems with iterators getting invalidated if we did a one pass scheme.\n \/\/\n for (SymbolTable::iterator I = ST->begin(), E = ST->end(); I != E; ++I)\n if (const PointerType *PT = dyn_cast<PointerType>(I->first))\n if (isa<FunctionType>(PT->getElementType())) {\n SymbolTable::VarMap &Plane = I->second;\n for (SymbolTable::type_iterator PI = Plane.begin(), PE = Plane.end();\n PI != PE; ++PI) {\n Function *F = cast<Function>(PI->second);\n assert(PI->first == F->getName() &&\n \"Function name and symbol table do not agree!\");\n if (F->hasExternalLinkage()) \/\/ Only resolve decls to external fns\n Functions[PI->first].push_back(F);\n }\n }\n\n bool Changed = false;\n\n \/\/ Now we have a list of all functions with a particular name. If there is\n \/\/ more than one entry in a list, merge the functions together.\n \/\/\n for (std::map<string, vector<Function*> >::iterator I = Functions.begin(), \n E = Functions.end(); I != E; ++I) {\n vector<Function*> &Functions = I->second;\n Function *Implementation = 0; \/\/ Find the implementation\n Function *Concrete = 0;\n for (unsigned i = 0; i < Functions.size(); ) {\n if (!Functions[i]->isExternal()) { \/\/ Found an implementation\n if (Implementation != 0)\n assert(Implementation == 0 && \"Multiple definitions of the same\"\n \" function. Case not handled yet!\");\n Implementation = Functions[i];\n } else {\n \/\/ Ignore functions that are never used so they don't cause spurious\n \/\/ warnings... here we will actually DCE the function so that it isn't\n \/\/ used later.\n \/\/\n if (Functions[i]->use_empty()) {\n M.getFunctionList().erase(Functions[i]);\n Functions.erase(Functions.begin()+i);\n Changed = true;\n ++NumResolved;\n continue;\n }\n }\n \n if (Functions[i] && (!Functions[i]->getFunctionType()->isVarArg())) {\n if (Concrete) { \/\/ Found two different functions types. Can't choose\n Concrete = 0;\n break;\n }\n Concrete = Functions[i];\n }\n ++i;\n }\n\n if (Functions.size() > 1) { \/\/ Found a multiply defined function...\n \/\/ We should find exactly one non-vararg function definition, which is\n \/\/ probably the implementation. Change all of the function definitions\n \/\/ and uses to use it instead.\n \/\/\n if (!Concrete) {\n cerr << \"Warning: Found functions types that are not compatible:\\n\";\n for (unsigned i = 0; i < Functions.size(); ++i) {\n cerr << \"\\t\" << Functions[i]->getType()->getDescription() << \" %\"\n << Functions[i]->getName() << \"\\n\";\n }\n cerr << \" No linkage of functions named '\" << Functions[0]->getName()\n << \"' performed!\\n\";\n } else {\n for (unsigned i = 0; i < Functions.size(); ++i)\n if (Functions[i] != Concrete) {\n Function *Old = Functions[i];\n const FunctionType *OldMT = Old->getFunctionType();\n const FunctionType *ConcreteMT = Concrete->getFunctionType();\n bool Broken = false;\n\n assert(OldMT->getParamTypes().size() <=\n ConcreteMT->getParamTypes().size() &&\n \"Concrete type must have more specified parameters!\");\n\n \/\/ Check to make sure that if there are specified types, that they\n \/\/ match...\n \/\/\n for (unsigned i = 0; i < OldMT->getParamTypes().size(); ++i)\n if (OldMT->getParamTypes()[i] != ConcreteMT->getParamTypes()[i]) {\n cerr << \"Parameter types conflict for\" << OldMT\n << \" and \" << ConcreteMT;\n Broken = true;\n }\n if (Broken) break; \/\/ Can't process this one!\n\n\n \/\/ Attempt to convert all of the uses of the old function to the\n \/\/ concrete form of the function. If there is a use of the fn that\n \/\/ we don't understand here we punt to avoid making a bad\n \/\/ transformation.\n \/\/\n \/\/ At this point, we know that the return values are the same for\n \/\/ our two functions and that the Old function has no varargs fns\n \/\/ specified. In otherwords it's just <retty> (...)\n \/\/\n for (unsigned i = 0; i < Old->use_size(); ) {\n User *U = *(Old->use_begin()+i);\n if (CastInst *CI = dyn_cast<CastInst>(U)) {\n \/\/ Convert casts directly\n assert(CI->getOperand(0) == Old);\n CI->setOperand(0, Concrete);\n Changed = true;\n ++NumResolved;\n } else if (CallInst *CI = dyn_cast<CallInst>(U)) {\n \/\/ Can only fix up calls TO the argument, not args passed in.\n if (CI->getCalledValue() == Old) {\n ConvertCallTo(CI, Concrete);\n Changed = true;\n ++NumResolved;\n } else {\n cerr << \"Couldn't cleanup this function call, must be an\"\n << \" argument or something!\" << CI;\n ++i;\n }\n } else {\n cerr << \"Cannot convert use of function: \" << U << \"\\n\";\n ++i;\n }\n }\n }\n }\n }\n }\n\n return Changed;\n}\n<commit_msg>Fix bug with last patch which would occur when a call returned void and we attempted to assign it a name.<commit_after>\/\/===- FunctionResolution.cpp - Resolve declarations to implementations ---===\/\/\n\/\/\n\/\/ Loop over the functions that are in the module and look for functions that\n\/\/ have the same name. More often than not, there will be things like:\n\/\/\n\/\/ declare void %foo(...)\n\/\/ void %foo(int, int) { ... }\n\/\/\n\/\/ because of the way things are declared in C. If this is the case, patch\n\/\/ things up.\n\/\/\n\/\/===----------------------------------------------------------------------===\/\/\n\n#include \"llvm\/Transforms\/IPO.h\"\n#include \"llvm\/Module.h\"\n#include \"llvm\/SymbolTable.h\"\n#include \"llvm\/DerivedTypes.h\"\n#include \"llvm\/Pass.h\"\n#include \"llvm\/iOther.h\"\n#include \"llvm\/Constant.h\"\n#include \"Support\/StatisticReporter.h\"\n#include <iostream>\n#include <algorithm>\n\nusing std::vector;\nusing std::string;\nusing std::cerr;\n\nnamespace {\n Statistic<>NumResolved(\"funcresolve\\t- Number of varargs functions resolved\");\n\n struct FunctionResolvingPass : public Pass {\n bool run(Module &M);\n };\n RegisterOpt<FunctionResolvingPass> X(\"funcresolve\", \"Resolve Functions\");\n}\n\nPass *createFunctionResolvingPass() {\n return new FunctionResolvingPass();\n}\n\n\/\/ ConvertCallTo - Convert a call to a varargs function with no arg types\n\/\/ specified to a concrete nonvarargs function.\n\/\/\nstatic void ConvertCallTo(CallInst *CI, Function *Dest) {\n const FunctionType::ParamTypes &ParamTys =\n Dest->getFunctionType()->getParamTypes();\n BasicBlock *BB = CI->getParent();\n\n \/\/ Keep an iterator to where we want to insert cast instructions if the\n \/\/ argument types don't agree.\n \/\/\n BasicBlock::iterator BBI = CI;\n assert(CI->getNumOperands()-1 == ParamTys.size() &&\n \"Function calls resolved funny somehow, incompatible number of args\");\n\n vector<Value*> Params;\n\n \/\/ Convert all of the call arguments over... inserting cast instructions if\n \/\/ the types are not compatible.\n for (unsigned i = 1; i < CI->getNumOperands(); ++i) {\n Value *V = CI->getOperand(i);\n\n if (V->getType() != ParamTys[i-1]) { \/\/ Must insert a cast...\n Instruction *Cast = new CastInst(V, ParamTys[i-1]);\n BBI = ++BB->getInstList().insert(BBI, Cast);\n V = Cast;\n }\n\n Params.push_back(V);\n }\n\n Instruction *NewCall = new CallInst(Dest, Params);\n\n \/\/ Replace the old call instruction with a new call instruction that calls\n \/\/ the real function.\n \/\/\n BBI = ++BB->getInstList().insert(BBI, NewCall);\n\n \/\/ Remove the old call instruction from the program...\n BB->getInstList().remove(BBI);\n\n \/\/ Transfer the name over...\n if (NewCall->getType() != Type::VoidTy)\n NewCall->setName(CI->getName());\n\n \/\/ Replace uses of the old instruction with the appropriate values...\n \/\/\n if (NewCall->getType() == CI->getType()) {\n CI->replaceAllUsesWith(NewCall);\n NewCall->setName(CI->getName());\n\n } else if (NewCall->getType() == Type::VoidTy) {\n \/\/ Resolved function does not return a value but the prototype does. This\n \/\/ often occurs because undefined functions default to returning integers.\n \/\/ Just replace uses of the call (which are broken anyway) with dummy\n \/\/ values.\n CI->replaceAllUsesWith(Constant::getNullValue(CI->getType()));\n } else if (CI->getType() == Type::VoidTy) {\n \/\/ If we are gaining a new return value, we don't have to do anything\n \/\/ special here, because it will automatically be ignored.\n } else {\n \/\/ Insert a cast instruction to convert the return value of the function\n \/\/ into it's new type. Of course we only need to do this if the return\n \/\/ value of the function is actually USED.\n \/\/\n if (!CI->use_empty()) {\n CastInst *NewCast = new CastInst(NewCall, CI->getType(),\n NewCall->getName());\n CI->replaceAllUsesWith(NewCast);\n \/\/ Insert the new cast instruction...\n BB->getInstList().insert(BBI, NewCast);\n }\n }\n\n \/\/ The old instruction is no longer needed, destroy it!\n delete CI;\n}\n\n\nbool FunctionResolvingPass::run(Module &M) {\n SymbolTable *ST = M.getSymbolTable();\n if (!ST) return false;\n\n std::map<string, vector<Function*> > Functions;\n\n \/\/ Loop over the entries in the symbol table. If an entry is a func pointer,\n \/\/ then add it to the Functions map. We do a two pass algorithm here to avoid\n \/\/ problems with iterators getting invalidated if we did a one pass scheme.\n \/\/\n for (SymbolTable::iterator I = ST->begin(), E = ST->end(); I != E; ++I)\n if (const PointerType *PT = dyn_cast<PointerType>(I->first))\n if (isa<FunctionType>(PT->getElementType())) {\n SymbolTable::VarMap &Plane = I->second;\n for (SymbolTable::type_iterator PI = Plane.begin(), PE = Plane.end();\n PI != PE; ++PI) {\n Function *F = cast<Function>(PI->second);\n assert(PI->first == F->getName() &&\n \"Function name and symbol table do not agree!\");\n if (F->hasExternalLinkage()) \/\/ Only resolve decls to external fns\n Functions[PI->first].push_back(F);\n }\n }\n\n bool Changed = false;\n\n \/\/ Now we have a list of all functions with a particular name. If there is\n \/\/ more than one entry in a list, merge the functions together.\n \/\/\n for (std::map<string, vector<Function*> >::iterator I = Functions.begin(), \n E = Functions.end(); I != E; ++I) {\n vector<Function*> &Functions = I->second;\n Function *Implementation = 0; \/\/ Find the implementation\n Function *Concrete = 0;\n for (unsigned i = 0; i < Functions.size(); ) {\n if (!Functions[i]->isExternal()) { \/\/ Found an implementation\n if (Implementation != 0)\n assert(Implementation == 0 && \"Multiple definitions of the same\"\n \" function. Case not handled yet!\");\n Implementation = Functions[i];\n } else {\n \/\/ Ignore functions that are never used so they don't cause spurious\n \/\/ warnings... here we will actually DCE the function so that it isn't\n \/\/ used later.\n \/\/\n if (Functions[i]->use_empty()) {\n M.getFunctionList().erase(Functions[i]);\n Functions.erase(Functions.begin()+i);\n Changed = true;\n ++NumResolved;\n continue;\n }\n }\n \n if (Functions[i] && (!Functions[i]->getFunctionType()->isVarArg())) {\n if (Concrete) { \/\/ Found two different functions types. Can't choose\n Concrete = 0;\n break;\n }\n Concrete = Functions[i];\n }\n ++i;\n }\n\n if (Functions.size() > 1) { \/\/ Found a multiply defined function...\n \/\/ We should find exactly one non-vararg function definition, which is\n \/\/ probably the implementation. Change all of the function definitions\n \/\/ and uses to use it instead.\n \/\/\n if (!Concrete) {\n cerr << \"Warning: Found functions types that are not compatible:\\n\";\n for (unsigned i = 0; i < Functions.size(); ++i) {\n cerr << \"\\t\" << Functions[i]->getType()->getDescription() << \" %\"\n << Functions[i]->getName() << \"\\n\";\n }\n cerr << \" No linkage of functions named '\" << Functions[0]->getName()\n << \"' performed!\\n\";\n } else {\n for (unsigned i = 0; i < Functions.size(); ++i)\n if (Functions[i] != Concrete) {\n Function *Old = Functions[i];\n const FunctionType *OldMT = Old->getFunctionType();\n const FunctionType *ConcreteMT = Concrete->getFunctionType();\n bool Broken = false;\n\n assert(OldMT->getParamTypes().size() <=\n ConcreteMT->getParamTypes().size() &&\n \"Concrete type must have more specified parameters!\");\n\n \/\/ Check to make sure that if there are specified types, that they\n \/\/ match...\n \/\/\n for (unsigned i = 0; i < OldMT->getParamTypes().size(); ++i)\n if (OldMT->getParamTypes()[i] != ConcreteMT->getParamTypes()[i]) {\n cerr << \"Parameter types conflict for\" << OldMT\n << \" and \" << ConcreteMT;\n Broken = true;\n }\n if (Broken) break; \/\/ Can't process this one!\n\n\n \/\/ Attempt to convert all of the uses of the old function to the\n \/\/ concrete form of the function. If there is a use of the fn that\n \/\/ we don't understand here we punt to avoid making a bad\n \/\/ transformation.\n \/\/\n \/\/ At this point, we know that the return values are the same for\n \/\/ our two functions and that the Old function has no varargs fns\n \/\/ specified. In otherwords it's just <retty> (...)\n \/\/\n for (unsigned i = 0; i < Old->use_size(); ) {\n User *U = *(Old->use_begin()+i);\n if (CastInst *CI = dyn_cast<CastInst>(U)) {\n \/\/ Convert casts directly\n assert(CI->getOperand(0) == Old);\n CI->setOperand(0, Concrete);\n Changed = true;\n ++NumResolved;\n } else if (CallInst *CI = dyn_cast<CallInst>(U)) {\n \/\/ Can only fix up calls TO the argument, not args passed in.\n if (CI->getCalledValue() == Old) {\n ConvertCallTo(CI, Concrete);\n Changed = true;\n ++NumResolved;\n } else {\n cerr << \"Couldn't cleanup this function call, must be an\"\n << \" argument or something!\" << CI;\n ++i;\n }\n } else {\n cerr << \"Cannot convert use of function: \" << U << \"\\n\";\n ++i;\n }\n }\n }\n }\n }\n }\n\n return Changed;\n}\n<|endoftext|>"} {"text":"<commit_before><commit_msg>Add empty strings localized_strings to fix build breakage.<commit_after><|endoftext|>"} {"text":"<commit_before><commit_msg>AutoFill: Temporarily remove a NOTREACHED until WK is fixed to not send in empty strings.<commit_after><|endoftext|>"} {"text":"<commit_before>\/* -*- mode: c++; indent-tabs-mode: nil -*- *\/\n\n\/*\n The elevation evaluator gets the subsurface temperature and computes the thaw depth \n over time.\n\n Authors: Ahmad Jan (jana@ornl.gov)\n*\/\n\n#include \"thaw_depth_evaluator.hh\"\n\nnamespace Amanzi {\nnamespace Flow {\n\n\n\nThawDepthEvaluator::ThawDepthEvaluator(Teuchos::ParameterList& plist)\n : SecondaryVariableFieldEvaluator(plist)\n{\n std::string domain_name=Keys::getDomain(my_key_);\n my_key_ = plist_.get<std::string>(\"thaw depth key\", Keys::getKey(domain_name, \"thaw_depth\"));\n}\n \n\nThawDepthEvaluator::ThawDepthEvaluator(const ThawDepthEvaluator& other)\n : SecondaryVariableFieldEvaluator(other)\n{}\n \nTeuchos::RCP<FieldEvaluator>\nThawDepthEvaluator::Clone() const\n{\n return Teuchos::rcp(new ThawDepthEvaluator(*this));\n}\n\n\nvoid\nThawDepthEvaluator::EvaluateField_(const Teuchos::Ptr<State>& S,\n const Teuchos::Ptr<CompositeVector>& result)\n{ \n Epetra_MultiVector& res_c = *result->ViewComponent(\"cell\",false);\n \n int ncells = res_c.MyLength();\n for (int c=0; c!=ncells; c++){\n const auto& top_z_centroid = S->GetMesh(domain.str())->face_centroid(0);\n AmanziGeometry::Point z_centroid(top_z_centroid);\n\n int id = S->GetMesh(\"surface_star\")->cell_map(false).GID(c);\n std::stringstream domain;\n domain << \"column_\" << id;\n\n \/\/ search through the column and find the deepest unfrozen cell\n const auto& temp_c = *S->GetFieldData(Keys::getKey(domain.str(),\"temperature\"))\n ->ViewComponent(\"cell\", false);\n int col_cells = temp_c.MyLength();\n for (int i=0; i!=col_cells; ++i) {\n if (temp_c[0][i] >= 273.25) { \/\/ this hard codes in the transition width to 0.2 K\n z_centroid = S->GetMesh(domain.str())->face_centroid(i+1);\n }\n }\n \n res_c[0][c] = top_z_centroid[2] - z_centroid[2];\n }\n}\n \nvoid\nThawDepthEvaluator::EvaluateFieldPartialDerivative_(const Teuchos::Ptr<State>& S,\n Key wrt_key, const Teuchos::Ptr<CompositeVector>& result)\n{}\n\n \n\/\/ Custom EnsureCompatibility forces this to be updated once.\nbool\nThawDepthEvaluator::HasFieldChanged(const Teuchos::Ptr<State>& S,\n Key request)\n{\n bool changed = SecondaryVariableFieldEvaluator::HasFieldChanged(S,request);\n\n if (!updated_once_) {\n UpdateField_(S);\n updated_once_ = true;\n return true;\n }\n return changed;\n}\n\nvoid\nThawDepthEvaluator::EnsureCompatibility(const Teuchos::Ptr<State>& S)\n{ \n Key domain = Keys::getDomain(my_key_);\n AMANZI_ASSERT(domain == \"surface_star\");\n \n int ncells = S->GetMesh(\"surface_star\")->num_entities(AmanziMesh::CELL,\n AmanziMesh::Parallel_type::OWNED);\n \n if (domain == \"surface_star\") {\n for (int c =0; c < ncells; c++){\n std::stringstream name;\n int id = S->GetMesh(\"surface_star\")->cell_map(false).GID(c);\n name << \"column_\"<< id;\n Key temp_key = Keys::getKey(name.str(),\"temperature\");\n dependencies_.insert(temp_key);\n }\n } \n \n \/\/ Ensure my field exists. Requirements should be already set.\n AMANZI_ASSERT(my_key_ != std::string(\"\"));\n \n Teuchos::RCP<CompositeVectorSpace> my_fac = S->RequireField(my_key_, my_key_);\n \n \/\/ check plist for vis or checkpointing control\n bool io_my_key = plist_.get<bool>(std::string(\"visualize \")+my_key_, true);\n S->GetField(my_key_, my_key_)->set_io_vis(io_my_key);\n bool checkpoint_my_key = plist_.get<bool>(std::string(\"checkpoint \")+my_key_, false);\n S->GetField(my_key_, my_key_)->set_io_checkpoint(checkpoint_my_key);\n \n if (my_fac->Mesh() != Teuchos::null) {\n \/\/ Recurse into the tree to propagate info to leaves.\n for (KeySet::const_iterator key=dependencies_.begin();\n key!=dependencies_.end(); ++key) {\n S->RequireFieldEvaluator(*key)->EnsureCompatibility(S);\n }\n }\n}\n\n\n} \/\/namespace\n} \/\/namespace\n<commit_msg>fixes bug in thaw depth evaluator<commit_after>\/* -*- mode: c++; indent-tabs-mode: nil -*- *\/\n\n\/*\n The elevation evaluator gets the subsurface temperature and computes the thaw depth \n over time.\n\n Authors: Ahmad Jan (jana@ornl.gov)\n*\/\n\n#include \"thaw_depth_evaluator.hh\"\n\nnamespace Amanzi {\nnamespace Flow {\n\n\n\nThawDepthEvaluator::ThawDepthEvaluator(Teuchos::ParameterList& plist)\n : SecondaryVariableFieldEvaluator(plist)\n{\n std::string domain_name=Keys::getDomain(my_key_);\n my_key_ = plist_.get<std::string>(\"thaw depth key\", Keys::getKey(domain_name, \"thaw_depth\"));\n}\n \n\nThawDepthEvaluator::ThawDepthEvaluator(const ThawDepthEvaluator& other)\n : SecondaryVariableFieldEvaluator(other)\n{}\n \nTeuchos::RCP<FieldEvaluator>\nThawDepthEvaluator::Clone() const\n{\n return Teuchos::rcp(new ThawDepthEvaluator(*this));\n}\n\n\nvoid\nThawDepthEvaluator::EvaluateField_(const Teuchos::Ptr<State>& S,\n const Teuchos::Ptr<CompositeVector>& result)\n{ \n Epetra_MultiVector& res_c = *result->ViewComponent(\"cell\",false);\n \n int ncells = res_c.MyLength();\n for (int c=0; c!=ncells; c++){\n int id = S->GetMesh(\"surface_star\")->cell_map(false).GID(c);\n std::stringstream domain;\n domain << \"column_\" << id;\n\n const auto& top_z_centroid = S->GetMesh(domain.str())->face_centroid(0);\n AmanziGeometry::Point z_centroid(top_z_centroid);\n\n \/\/ search through the column and find the deepest unfrozen cell\n const auto& temp_c = *S->GetFieldData(Keys::getKey(domain.str(),\"temperature\"))\n ->ViewComponent(\"cell\", false);\n int col_cells = temp_c.MyLength();\n for (int i=0; i!=col_cells; ++i) {\n if (temp_c[0][i] >= 273.25) { \/\/ this hard codes in the transition width to 0.2 K\n z_centroid = S->GetMesh(domain.str())->face_centroid(i+1);\n }\n }\n \n res_c[0][c] = top_z_centroid[2] - z_centroid[2];\n }\n}\n \nvoid\nThawDepthEvaluator::EvaluateFieldPartialDerivative_(const Teuchos::Ptr<State>& S,\n Key wrt_key, const Teuchos::Ptr<CompositeVector>& result)\n{}\n\n \n\/\/ Custom EnsureCompatibility forces this to be updated once.\nbool\nThawDepthEvaluator::HasFieldChanged(const Teuchos::Ptr<State>& S,\n Key request)\n{\n bool changed = SecondaryVariableFieldEvaluator::HasFieldChanged(S,request);\n\n if (!updated_once_) {\n UpdateField_(S);\n updated_once_ = true;\n return true;\n }\n return changed;\n}\n\nvoid\nThawDepthEvaluator::EnsureCompatibility(const Teuchos::Ptr<State>& S)\n{ \n Key domain = Keys::getDomain(my_key_);\n AMANZI_ASSERT(domain == \"surface_star\");\n \n int ncells = S->GetMesh(\"surface_star\")->num_entities(AmanziMesh::CELL,\n AmanziMesh::Parallel_type::OWNED);\n \n if (domain == \"surface_star\") {\n for (int c =0; c < ncells; c++){\n std::stringstream name;\n int id = S->GetMesh(\"surface_star\")->cell_map(false).GID(c);\n name << \"column_\"<< id;\n Key temp_key = Keys::getKey(name.str(),\"temperature\");\n dependencies_.insert(temp_key);\n }\n } \n \n \/\/ Ensure my field exists. Requirements should be already set.\n AMANZI_ASSERT(my_key_ != std::string(\"\"));\n \n Teuchos::RCP<CompositeVectorSpace> my_fac = S->RequireField(my_key_, my_key_);\n \n \/\/ check plist for vis or checkpointing control\n bool io_my_key = plist_.get<bool>(std::string(\"visualize \")+my_key_, true);\n S->GetField(my_key_, my_key_)->set_io_vis(io_my_key);\n bool checkpoint_my_key = plist_.get<bool>(std::string(\"checkpoint \")+my_key_, false);\n S->GetField(my_key_, my_key_)->set_io_checkpoint(checkpoint_my_key);\n \n if (my_fac->Mesh() != Teuchos::null) {\n \/\/ Recurse into the tree to propagate info to leaves.\n for (KeySet::const_iterator key=dependencies_.begin();\n key!=dependencies_.end(); ++key) {\n S->RequireFieldEvaluator(*key)->EnsureCompatibility(S);\n }\n }\n}\n\n\n} \/\/namespace\n} \/\/namespace\n<|endoftext|>"} {"text":"<commit_before>\/**\n * Zillians MMO\n * Copyright (C) 2007-2010 Zillians.com, Inc.\n * For more information see http:\/\/www.zillians.com\n *\n * Zillians MMO is the library and runtime for massive multiplayer online game\n * development in utility computing model, which runs as a service for every\n * developer to build their virtual world running on our GPU-assisted machines.\n *\n * This is a close source library intended to be used solely within Zillians.com\n *\n * THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\n * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\n * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE\n * COPYRIGHT HOLDER(S) BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN\n * AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN\n * CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.\n *\/\n\n#include \"core\/Prerequisite.h\"\n#include \"language\/tree\/ASTNode.h\"\n#include \"language\/tree\/ASTNodeFactory.h\"\n#include \"language\/tree\/visitor\/check\/ErrorMessageAnnotationCheckVisitor.h\"\n#include \"..\/ASTNodeSamples.h\"\n#include <iostream>\n#include <string>\n#include <limits>\n\n#define BOOST_TEST_MODULE ThorScriptTreeTest_ErrorMessageAnnotationCheckVisitorTest\n#define BOOST_TEST_MAIN\n#include <boost\/test\/unit_test.hpp>\n\nusing namespace zillians;\nusing namespace zillians::language::tree;\nusing namespace zillians::language::tree::visitor;\n\nBOOST_AUTO_TEST_SUITE( ThorScriptTreeTest_ErrorMessageAnnotationCheckVisitorTestSuite )\n\nASTNode* createOKSample()\n{\n\tProgram* program = new Program();\n\t{\n\t\tPackage* com_package = new Package(new SimpleIdentifier(L\"com\"));\n\t\tprogram->root->addPackage(com_package);\n\t\t{\n\t\t\tPackage* zillians_package = new Package(new SimpleIdentifier(L\"zillians\"));\n\t\t\tcom_package->addPackage(zillians_package);\n\t\t\t{\n\t\t\t\tClassDecl* class_decl = new ClassDecl(new SimpleIdentifier(L\"some_class\"));\n\t\t\t\tzillians_package->addObject(class_decl);\n\t\t\t\t{\n\t\t\t\t\tFunctionDecl* some_member_function = new FunctionDecl(\n\t\t\t\t\t\t\tnew SimpleIdentifier(L\"some_member_function\"),\n\t\t\t\t\t\t\tNULL,\n\t\t\t\t\t\t\ttrue,\n\t\t\t\t\t\t\tDeclaration::VisibilitySpecifier::PUBLIC,\n\t\t\t\t\t\t\tDeclaration::StorageSpecifier::NONE);\n\t\t\t\t\tclass_decl->addFunction(some_member_function);\n\t\t\t\t\t{\n\t\t\t\t\t\tBlock* block = some_member_function->block;\n\n\t\t\t\t\t\t{\n\t\t\t\t\t\t\tDeclarativeStmt* stmt = new DeclarativeStmt(new VariableDecl(new SimpleIdentifier(L\"a\"), new TypeSpecifier(PrimitiveType::INT32), false, Declaration::VisibilitySpecifier::DEFAULT, Declaration::StorageSpecifier::NONE));\n\t\t\t\t\t\t\tblock->appendObject(stmt);\n\t\t\t\t\t\t}\n\n\t\t\t\t\t\t{\n\t\t\t\t\t\t\tDeclarativeStmt* stmt = new DeclarativeStmt(new VariableDecl(new SimpleIdentifier(L\"b\"), new TypeSpecifier(PrimitiveType::INT32), false, Declaration::VisibilitySpecifier::DEFAULT, Declaration::StorageSpecifier::NONE));\n\t\t\t\t\t\t\tblock->appendObject(stmt);\n\t\t\t\t\t\t}\n\n\t\t\t\t\t\t{\n\t\t\t\t\t\t\t\/\/ set error check annotation data\n\t\t\t\t\t\t\tAnnotation* msgParams = new Annotation(NULL);\n\t\t\t\t\t\t\tmsgParams->appendKeyValue(new SimpleIdentifier(L\"id\"), new StringLiteral(L\"mCount\"));\n\t\t\t\t\t\t\tmsgParams->appendKeyValue(new SimpleIdentifier(L\"type\"), new StringLiteral(L\"int\"));\n\t\t\t\t\t\t\tAnnotation* levelIdParams = new Annotation(NULL);\n\t\t\t\t\t\t\tlevelIdParams->appendKeyValue(new SimpleIdentifier(L\"level\"), new StringLiteral(L\"warning\"));\n\t\t\t\t\t\t\tlevelIdParams->appendKeyValue(new SimpleIdentifier(L\"id\"), new StringLiteral(L\"undeclared_variable\"));\n\t\t\t\t\t\t\tlevelIdParams->appendKeyValue(new SimpleIdentifier(L\"parameters\"), msgParams);\n\n\t\t\t\t\t\t\tAnnotation* anno = new Annotation(new SimpleIdentifier(L\"static_test\"));\n\t\t\t\t\t\t\tanno->appendKeyValue(new SimpleIdentifier(L\"expect_message\"), levelIdParams);\n\t\t\t\t\t\t\tAnnotations* annos = new Annotations();\n\t\t\t\t\t\t\tannos->appendAnnotation(anno);\n\n\t\t\t\t\t\t\t\/\/ set error message context data\n\t\t\t\t\t\t\tstd::map<std::wstring, std::wstring> m;\n\t\t\t\t\t\t\tm[L\"id\"] = L\"mCount\";\n\t\t\t\t\t\t\tm[L\"type\"] = L\"int\";\n\t\t\t\t\t\t\tauto errorContext = new zillians::language::stage::LogInfoContext(L\"warning\", L\"undeclared_variable\", m);\n\n\t\t\t\t\t\t\tExpressionStmt* stmt = new ExpressionStmt(new BinaryExpr(BinaryExpr::OpCode::ASSIGN, new PrimaryExpr(new SimpleIdentifier(L\"undeclared_variable_name\")), new PrimaryExpr(new SimpleIdentifier(L\"b\"))));\n\t\t\t\t\t\t\tstmt->setAnnotation(annos);\n\t\t\t\t\t\t\tstmt->set<zillians::language::stage::LogInfoContext>(errorContext);\n\n\t\t\t\t\t\t\tblock->appendObject(stmt);\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\treturn program;\n}\n\nASTNode* createFailSample()\n{\n\tProgram* program = new Program();\n\t{\n\t\tPackage* com_package = new Package(new SimpleIdentifier(L\"com\"));\n\t\tprogram->root->addPackage(com_package);\n\t\t{\n\t\t\tPackage* zillians_package = new Package(new SimpleIdentifier(L\"zillians\"));\n\t\t\tcom_package->addPackage(zillians_package);\n\t\t\t{\n\t\t\t\tClassDecl* class_decl = new ClassDecl(new SimpleIdentifier(L\"some_class\"));\n\t\t\t\tzillians_package->addObject(class_decl);\n\t\t\t\t{\n\t\t\t\t\tFunctionDecl* some_member_function = new FunctionDecl(\n\t\t\t\t\t\t\tnew SimpleIdentifier(L\"some_member_function\"),\n\t\t\t\t\t\t\tNULL,\n\t\t\t\t\t\t\ttrue,\n\t\t\t\t\t\t\tDeclaration::VisibilitySpecifier::PUBLIC,\n\t\t\t\t\t\t\tDeclaration::StorageSpecifier::NONE);\n\t\t\t\t\tclass_decl->addFunction(some_member_function);\n\t\t\t\t\t{\n\t\t\t\t\t\tBlock* block = some_member_function->block;\n\n\t\t\t\t\t\t{\n\t\t\t\t\t\t\tDeclarativeStmt* stmt = new DeclarativeStmt(new VariableDecl(new SimpleIdentifier(L\"a\"), new TypeSpecifier(PrimitiveType::INT32), false, Declaration::VisibilitySpecifier::DEFAULT, Declaration::StorageSpecifier::NONE));\n\t\t\t\t\t\t\tblock->appendObject(stmt);\n\t\t\t\t\t\t}\n\n\t\t\t\t\t\t{\n\t\t\t\t\t\t\tDeclarativeStmt* stmt = new DeclarativeStmt(new VariableDecl(new SimpleIdentifier(L\"b\"), new TypeSpecifier(PrimitiveType::INT32), false, Declaration::VisibilitySpecifier::DEFAULT, Declaration::StorageSpecifier::NONE));\n\t\t\t\t\t\t\tblock->appendObject(stmt);\n\t\t\t\t\t\t}\n\n\t\t\t\t\t\t{\n\t\t\t\t\t\t\t\/\/ set error check annotation data\n\t\t\t\t\t\t\tAnnotation* msgParams = new Annotation(NULL);\n\t\t\t\t\t\t\tmsgParams->appendKeyValue(new SimpleIdentifier(L\"id\"), new StringLiteral(L\"mCount\"));\n\t\t\t\t\t\t\tmsgParams->appendKeyValue(new SimpleIdentifier(L\"type\"), new StringLiteral(L\"int\"));\n\t\t\t\t\t\t\tAnnotation* levelIdParams = new Annotation(NULL);\n\t\t\t\t\t\t\tlevelIdParams->appendKeyValue(new SimpleIdentifier(L\"level\"), new StringLiteral(L\"warning\"));\n\t\t\t\t\t\t\tlevelIdParams->appendKeyValue(new SimpleIdentifier(L\"id\"), new StringLiteral(L\"undeclared_variable\"));\n\t\t\t\t\t\t\tlevelIdParams->appendKeyValue(new SimpleIdentifier(L\"parameters\"), msgParams);\n\n\t\t\t\t\t\t\tAnnotation* anno = new Annotation(new SimpleIdentifier(L\"static_test\"));\n\t\t\t\t\t\t\tanno->appendKeyValue(new SimpleIdentifier(L\"expect_message\"), levelIdParams);\n\t\t\t\t\t\t\tAnnotations* annos = new Annotations();\n\t\t\t\t\t\t\tannos->appendAnnotation(anno);\n\n\t\t\t\t\t\t\t\/\/ set error message context data\n\t\t\t\t\t\t\tstd::map<std::wstring, std::wstring> m;\n\t\t\t\t\t\t\tm[L\"id\"] = L\"mCount\";\n\t\t\t\t\t\t\tm[L\"type\"] = L\"int\";\n\t\t\t\t\t\t\tm[L\"extra_fail_key\"] = L\"extra_fail_value\";\n\t\t\t\t\t\t\tauto errorContext = new zillians::language::stage::LogInfoContext(L\"warning\", L\"undeclared_variable\", m);\n\n\t\t\t\t\t\t\tExpressionStmt* stmt = new ExpressionStmt(new BinaryExpr(BinaryExpr::OpCode::ASSIGN, new PrimaryExpr(new SimpleIdentifier(L\"undeclared_variable_name\")), new PrimaryExpr(new SimpleIdentifier(L\"b\"))));\n\t\t\t\t\t\t\tstmt->setAnnotation(annos);\n\t\t\t\t\t\t\tstmt->set<zillians::language::stage::LogInfoContext>(errorContext);\n\n\t\t\t\t\t\t\tblock->appendObject(stmt);\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\treturn program;\n}\n\nBOOST_AUTO_TEST_CASE( ThorScriptTreeTest_ErrorMessageAnnotationCheckVisitorTestCase1 )\n{\n\tErrorMessageAnnotationCheckVisitor checker;\n\tASTNode* okProgram = createOKSample();\n\tchecker.check(*okProgram);\n\tBOOST_CHECK(checker.isAllMatch());\n\n\tASTNode* failProgram = createFailSample();\n\tchecker.check(*failProgram);\n\tBOOST_CHECK(!checker.isAllMatch());\n}\n\nBOOST_AUTO_TEST_SUITE_END()\n<commit_msg>fix make fail<commit_after>\/**\n * Zillians MMO\n * Copyright (C) 2007-2010 Zillians.com, Inc.\n * For more information see http:\/\/www.zillians.com\n *\n * Zillians MMO is the library and runtime for massive multiplayer online game\n * development in utility computing model, which runs as a service for every\n * developer to build their virtual world running on our GPU-assisted machines.\n *\n * This is a close source library intended to be used solely within Zillians.com\n *\n * THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\n * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\n * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE\n * COPYRIGHT HOLDER(S) BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN\n * AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN\n * CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.\n *\/\n\n#include \"core\/Prerequisite.h\"\n#include \"language\/tree\/ASTNode.h\"\n#include \"language\/tree\/ASTNodeFactory.h\"\n#include \"language\/tree\/visitor\/check\/ErrorMessageAnnotationCheckVisitor.h\"\n#include \"..\/ASTNodeSamples.h\"\n#include <iostream>\n#include <string>\n#include <limits>\n\n#define BOOST_TEST_MODULE ThorScriptTreeTest_ErrorMessageAnnotationCheckVisitorTest\n#define BOOST_TEST_MAIN\n#include <boost\/test\/unit_test.hpp>\n\nusing namespace zillians;\nusing namespace zillians::language::tree;\nusing namespace zillians::language::tree::visitor;\n\nBOOST_AUTO_TEST_SUITE( ThorScriptTreeTest_ErrorMessageAnnotationCheckVisitorTestSuite )\n\nASTNode* createOKSample()\n{\n\tProgram* program = new Program();\n\t{\n\t\tPackage* com_package = new Package(new SimpleIdentifier(L\"com\"));\n\t\tprogram->root->addPackage(com_package);\n\t\t{\n\t\t\tPackage* zillians_package = new Package(new SimpleIdentifier(L\"zillians\"));\n\t\t\tcom_package->addPackage(zillians_package);\n\t\t\t{\n\t\t\t\tClassDecl* class_decl = new ClassDecl(new SimpleIdentifier(L\"some_class\"));\n\t\t\t\tzillians_package->addObject(class_decl);\n\t\t\t\t{\n\t\t\t\t\tFunctionDecl* some_member_function = new FunctionDecl(\n\t\t\t\t\t\t\tnew SimpleIdentifier(L\"some_member_function\"),\n\t\t\t\t\t\t\tNULL,\n\t\t\t\t\t\t\ttrue,\n\t\t\t\t\t\t\tfalse,\n\t\t\t\t\t\t\tDeclaration::VisibilitySpecifier::PUBLIC);\n\t\t\t\t\tclass_decl->addFunction(some_member_function);\n\t\t\t\t\t{\n\t\t\t\t\t\tBlock* block = some_member_function->block;\n\n\t\t\t\t\t\t{\n\t\t\t\t\t\t\tDeclarativeStmt* stmt = new DeclarativeStmt(new VariableDecl(new SimpleIdentifier(L\"a\"), new TypeSpecifier(PrimitiveType::INT32), false, false, false, Declaration::VisibilitySpecifier::DEFAULT));\n\t\t\t\t\t\t\tblock->appendObject(stmt);\n\t\t\t\t\t\t}\n\n\t\t\t\t\t\t{\n\t\t\t\t\t\t\tDeclarativeStmt* stmt = new DeclarativeStmt(new VariableDecl(new SimpleIdentifier(L\"b\"), new TypeSpecifier(PrimitiveType::INT32), false, false, false, Declaration::VisibilitySpecifier::DEFAULT));\n\t\t\t\t\t\t\tblock->appendObject(stmt);\n\t\t\t\t\t\t}\n\n\t\t\t\t\t\t{\n\t\t\t\t\t\t\t\/\/ set error check annotation data\n\t\t\t\t\t\t\tAnnotation* msgParams = new Annotation(NULL);\n\t\t\t\t\t\t\tmsgParams->appendKeyValue(new SimpleIdentifier(L\"id\"), new StringLiteral(L\"mCount\"));\n\t\t\t\t\t\t\tmsgParams->appendKeyValue(new SimpleIdentifier(L\"type\"), new StringLiteral(L\"int\"));\n\t\t\t\t\t\t\tAnnotation* levelIdParams = new Annotation(NULL);\n\t\t\t\t\t\t\tlevelIdParams->appendKeyValue(new SimpleIdentifier(L\"level\"), new StringLiteral(L\"warning\"));\n\t\t\t\t\t\t\tlevelIdParams->appendKeyValue(new SimpleIdentifier(L\"id\"), new StringLiteral(L\"undeclared_variable\"));\n\t\t\t\t\t\t\tlevelIdParams->appendKeyValue(new SimpleIdentifier(L\"parameters\"), msgParams);\n\n\t\t\t\t\t\t\tAnnotation* anno = new Annotation(new SimpleIdentifier(L\"static_test\"));\n\t\t\t\t\t\t\tanno->appendKeyValue(new SimpleIdentifier(L\"expect_message\"), levelIdParams);\n\t\t\t\t\t\t\tAnnotations* annos = new Annotations();\n\t\t\t\t\t\t\tannos->appendAnnotation(anno);\n\n\t\t\t\t\t\t\t\/\/ set error message context data\n\t\t\t\t\t\t\tstd::map<std::wstring, std::wstring> m;\n\t\t\t\t\t\t\tm[L\"id\"] = L\"mCount\";\n\t\t\t\t\t\t\tm[L\"type\"] = L\"int\";\n\t\t\t\t\t\t\tauto errorContext = new zillians::language::stage::LogInfoContext(L\"warning\", L\"undeclared_variable\", m);\n\n\t\t\t\t\t\t\tExpressionStmt* stmt = new ExpressionStmt(new BinaryExpr(BinaryExpr::OpCode::ASSIGN, new PrimaryExpr(new SimpleIdentifier(L\"undeclared_variable_name\")), new PrimaryExpr(new SimpleIdentifier(L\"b\"))));\n\t\t\t\t\t\t\tstmt->setAnnotation(annos);\n\t\t\t\t\t\t\tstmt->set<zillians::language::stage::LogInfoContext>(errorContext);\n\n\t\t\t\t\t\t\tblock->appendObject(stmt);\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\treturn program;\n}\n\nASTNode* createFailSample()\n{\n\tProgram* program = new Program();\n\t{\n\t\tPackage* com_package = new Package(new SimpleIdentifier(L\"com\"));\n\t\tprogram->root->addPackage(com_package);\n\t\t{\n\t\t\tPackage* zillians_package = new Package(new SimpleIdentifier(L\"zillians\"));\n\t\t\tcom_package->addPackage(zillians_package);\n\t\t\t{\n\t\t\t\tClassDecl* class_decl = new ClassDecl(new SimpleIdentifier(L\"some_class\"));\n\t\t\t\tzillians_package->addObject(class_decl);\n\t\t\t\t{\n\t\t\t\t\tFunctionDecl* some_member_function = new FunctionDecl(\n\t\t\t\t\t\t\tnew SimpleIdentifier(L\"some_member_function\"),\n\t\t\t\t\t\t\tNULL,\n\t\t\t\t\t\t\ttrue,\n\t\t\t\t\t\t\tfalse,\n\t\t\t\t\t\t\tDeclaration::VisibilitySpecifier::PUBLIC);\n\t\t\t\t\tclass_decl->addFunction(some_member_function);\n\t\t\t\t\t{\n\t\t\t\t\t\tBlock* block = some_member_function->block;\n\n\t\t\t\t\t\t{\n\t\t\t\t\t\t\tDeclarativeStmt* stmt = new DeclarativeStmt(new VariableDecl(new SimpleIdentifier(L\"a\"), new TypeSpecifier(PrimitiveType::INT32), false, false, false, Declaration::VisibilitySpecifier::DEFAULT));\n\t\t\t\t\t\t\tblock->appendObject(stmt);\n\t\t\t\t\t\t}\n\n\t\t\t\t\t\t{\n\t\t\t\t\t\t\tDeclarativeStmt* stmt = new DeclarativeStmt(new VariableDecl(new SimpleIdentifier(L\"b\"), new TypeSpecifier(PrimitiveType::INT32), false, false, false, Declaration::VisibilitySpecifier::DEFAULT));\n\t\t\t\t\t\t\tblock->appendObject(stmt);\n\t\t\t\t\t\t}\n\n\t\t\t\t\t\t{\n\t\t\t\t\t\t\t\/\/ set error check annotation data\n\t\t\t\t\t\t\tAnnotation* msgParams = new Annotation(NULL);\n\t\t\t\t\t\t\tmsgParams->appendKeyValue(new SimpleIdentifier(L\"id\"), new StringLiteral(L\"mCount\"));\n\t\t\t\t\t\t\tmsgParams->appendKeyValue(new SimpleIdentifier(L\"type\"), new StringLiteral(L\"int\"));\n\t\t\t\t\t\t\tAnnotation* levelIdParams = new Annotation(NULL);\n\t\t\t\t\t\t\tlevelIdParams->appendKeyValue(new SimpleIdentifier(L\"level\"), new StringLiteral(L\"warning\"));\n\t\t\t\t\t\t\tlevelIdParams->appendKeyValue(new SimpleIdentifier(L\"id\"), new StringLiteral(L\"undeclared_variable\"));\n\t\t\t\t\t\t\tlevelIdParams->appendKeyValue(new SimpleIdentifier(L\"parameters\"), msgParams);\n\n\t\t\t\t\t\t\tAnnotation* anno = new Annotation(new SimpleIdentifier(L\"static_test\"));\n\t\t\t\t\t\t\tanno->appendKeyValue(new SimpleIdentifier(L\"expect_message\"), levelIdParams);\n\t\t\t\t\t\t\tAnnotations* annos = new Annotations();\n\t\t\t\t\t\t\tannos->appendAnnotation(anno);\n\n\t\t\t\t\t\t\t\/\/ set error message context data\n\t\t\t\t\t\t\tstd::map<std::wstring, std::wstring> m;\n\t\t\t\t\t\t\tm[L\"id\"] = L\"mCount\";\n\t\t\t\t\t\t\tm[L\"type\"] = L\"int\";\n\t\t\t\t\t\t\tm[L\"extra_fail_key\"] = L\"extra_fail_value\";\n\t\t\t\t\t\t\tauto errorContext = new zillians::language::stage::LogInfoContext(L\"warning\", L\"undeclared_variable\", m);\n\n\t\t\t\t\t\t\tExpressionStmt* stmt = new ExpressionStmt(new BinaryExpr(BinaryExpr::OpCode::ASSIGN, new PrimaryExpr(new SimpleIdentifier(L\"undeclared_variable_name\")), new PrimaryExpr(new SimpleIdentifier(L\"b\"))));\n\t\t\t\t\t\t\tstmt->setAnnotation(annos);\n\t\t\t\t\t\t\tstmt->set<zillians::language::stage::LogInfoContext>(errorContext);\n\n\t\t\t\t\t\t\tblock->appendObject(stmt);\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\treturn program;\n}\n\nBOOST_AUTO_TEST_CASE( ThorScriptTreeTest_ErrorMessageAnnotationCheckVisitorTestCase1 )\n{\n\tErrorMessageAnnotationCheckVisitor checker;\n\tASTNode* okProgram = createOKSample();\n\tchecker.check(*okProgram);\n\tBOOST_CHECK(checker.isAllMatch());\n\n\tASTNode* failProgram = createFailSample();\n\tchecker.check(*failProgram);\n\tBOOST_CHECK(!checker.isAllMatch());\n}\n\nBOOST_AUTO_TEST_SUITE_END()\n<|endoftext|>"} {"text":"<commit_before>\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\/ @brief index\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 Dr. Frank Celler\n\/\/\/ @author Copyright 2014, ArangoDB GmbH, Cologne, Germany\n\/\/\/ @author Copyright 2011-2013, triAGENS GmbH, Cologne, Germany\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n#include \"Index.h\"\n#include \"Basics\/Exceptions.h\"\n#include \"Basics\/json-utilities.h\"\n#include \"VocBase\/server.h\"\n#include \"VocBase\/VocShaper.h\"\n\nusing namespace triagens::arango;\n\n\/\/ -----------------------------------------------------------------------------\n\/\/ --SECTION-- class Index\n\/\/ -----------------------------------------------------------------------------\n\n\/\/ -----------------------------------------------------------------------------\n\/\/ --SECTION-- constructors and destructors\n\/\/ -----------------------------------------------------------------------------\n\nIndex::Index (TRI_idx_iid_t iid,\n TRI_document_collection_t* collection,\n std::vector<std::vector<triagens::basics::AttributeName>> const& fields) \n : _iid(iid),\n _collection(collection),\n _fields(fields) {\n}\n\nIndex::~Index () {\n}\n\n\/\/ -----------------------------------------------------------------------------\n\/\/ --SECTION-- public methods\n\/\/ -----------------------------------------------------------------------------\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\/ @brief return the index type based on a type name\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nIndex::IndexType Index::type (char const* type) {\n if (::strcmp(type, \"primary\") == 0) {\n return TRI_IDX_TYPE_PRIMARY_INDEX;\n }\n if (::strcmp(type, \"edge\") == 0) {\n return TRI_IDX_TYPE_EDGE_INDEX;\n }\n if (::strcmp(type, \"hash\") == 0) {\n return TRI_IDX_TYPE_HASH_INDEX;\n }\n if (::strcmp(type, \"skiplist\") == 0) {\n return TRI_IDX_TYPE_SKIPLIST_INDEX;\n }\n if (::strcmp(type, \"fulltext\") == 0) {\n return TRI_IDX_TYPE_FULLTEXT_INDEX;\n }\n if (::strcmp(type, \"cap\") == 0) {\n return TRI_IDX_TYPE_CAP_CONSTRAINT;\n }\n if (::strcmp(type, \"geo1\") == 0) {\n return TRI_IDX_TYPE_GEO1_INDEX;\n }\n if (::strcmp(type, \"geo2\") == 0) {\n return TRI_IDX_TYPE_GEO2_INDEX;\n }\n\n return TRI_IDX_TYPE_UNKNOWN;\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\/ @brief return the name of an index type\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nchar const* Index::typeName (Index::IndexType type) {\n switch (type) {\n case TRI_IDX_TYPE_PRIMARY_INDEX:\n return \"primary\";\n case TRI_IDX_TYPE_EDGE_INDEX:\n return \"edge\";\n case TRI_IDX_TYPE_HASH_INDEX:\n return \"hash\";\n case TRI_IDX_TYPE_SKIPLIST_INDEX:\n return \"skiplist\";\n case TRI_IDX_TYPE_FULLTEXT_INDEX:\n return \"fulltext\";\n case TRI_IDX_TYPE_CAP_CONSTRAINT:\n return \"cap\";\n case TRI_IDX_TYPE_GEO1_INDEX:\n return \"geo1\";\n case TRI_IDX_TYPE_GEO2_INDEX:\n return \"geo2\";\n case TRI_IDX_TYPE_PRIORITY_QUEUE_INDEX:\n case TRI_IDX_TYPE_BITARRAY_INDEX:\n case TRI_IDX_TYPE_UNKNOWN: {\n }\n }\n\n return \"\";\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\/ @brief validate an index id\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nbool Index::validateId (char const* key) {\n char const* p = key;\n\n while (1) {\n const char c = *p;\n\n if (c == '\\0') {\n return (p - key) > 0;\n }\n if (c >= '0' && c <= '9') {\n ++p;\n continue;\n }\n\n return false;\n }\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\/ @brief validate an index handle (collection name + \/ + index id)\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nbool Index::validateHandle (char const* key,\n size_t* split) {\n char const* p = key;\n char c = *p;\n\n \/\/ extract collection name\n\n if (! (c == '_' || (c >= 'a' && c <= 'z') || (c >= 'A' && c <= 'Z'))) {\n return false;\n }\n\n ++p;\n\n while (1) {\n c = *p;\n\n if ((c == '_') || (c == '-') || (c >= '0' && c <= '9') || (c >= 'a' && c <= 'z') || (c >= 'A' && c <= 'Z')) {\n ++p;\n continue;\n }\n\n if (c == '\/') {\n break;\n }\n\n return false;\n }\n\n if (p - key > TRI_COL_NAME_LENGTH) {\n return false;\n }\n\n \/\/ store split position\n *split = p - key;\n ++p;\n\n \/\/ validate index id\n return validateId(p);\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\/ @brief generate a new index id\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nTRI_idx_iid_t Index::generateId () {\n return TRI_NewTickServer();\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\/ @brief index comparator, used by the coordinator to detect if two index\n\/\/\/ contents are the same\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nbool Index::Compare (TRI_json_t const* lhs,\n TRI_json_t const* rhs) {\n TRI_json_t* typeJson = TRI_LookupObjectJson(lhs, \"type\");\n TRI_ASSERT(TRI_IsStringJson(typeJson));\n\n \/\/ type must be identical\n if (! TRI_CheckSameValueJson(typeJson, TRI_LookupObjectJson(rhs, \"type\"))) {\n return false;\n }\n\n auto type = Index::type(typeJson->_value._string.data);\n\n \/\/ unique must be identical if present\n TRI_json_t* value = TRI_LookupObjectJson(lhs, \"unique\");\n if (TRI_IsBooleanJson(value)) {\n if (! TRI_CheckSameValueJson(value, TRI_LookupObjectJson(rhs, \"unique\"))) {\n return false;\n }\n }\n\n \/\/ sparse must be identical if present\n value = TRI_LookupObjectJson(lhs, \"sparse\");\n if (TRI_IsBooleanJson(value)) {\n if (! TRI_CheckSameValueJson(value, TRI_LookupObjectJson(rhs, \"sparse\"))) {\n return false;\n }\n }\n\n\n if (type == IndexType::TRI_IDX_TYPE_GEO1_INDEX) {\n \/\/ geoJson must be identical if present\n value = TRI_LookupObjectJson(lhs, \"geoJson\");\n if (TRI_IsBooleanJson(value)) {\n if (! TRI_CheckSameValueJson(value, TRI_LookupObjectJson(rhs, \"geoJson\"))) {\n return false;\n }\n }\n }\n else if (type == IndexType::TRI_IDX_TYPE_FULLTEXT_INDEX) {\n \/\/ minLength\n value = TRI_LookupObjectJson(lhs, \"minLength\");\n if (TRI_IsNumberJson(value)) {\n if (! TRI_CheckSameValueJson(value, TRI_LookupObjectJson(rhs, \"minLength\"))) {\n return false;\n }\n }\n }\n else if (type == IndexType::TRI_IDX_TYPE_CAP_CONSTRAINT) {\n \/\/ size, byteSize\n value = TRI_LookupObjectJson(lhs, \"size\");\n if (TRI_IsNumberJson(value)) {\n if (! TRI_CheckSameValueJson(value, TRI_LookupObjectJson(rhs, \"size\"))) {\n return false;\n }\n }\n\n value = TRI_LookupObjectJson(lhs, \"byteSize\");\n if (TRI_IsNumberJson(value)) {\n if (! TRI_CheckSameValueJson(value, TRI_LookupObjectJson(rhs, \"byteSize\"))) {\n return false;\n }\n }\n }\n\n \/\/ other index types: fields must be identical if present\n value = TRI_LookupObjectJson(lhs, \"fields\");\n\n if (TRI_IsArrayJson(value)) {\n if (type == IndexType::TRI_IDX_TYPE_HASH_INDEX) {\n size_t const nv = TRI_LengthArrayJson(value);\n \n \/\/ compare fields in arbitrary order\n TRI_json_t const* r = TRI_LookupObjectJson(rhs, \"fields\");\n\n if (! TRI_IsArrayJson(r) ||\n nv != TRI_LengthArrayJson(r)) {\n return false;\n }\n\n size_t const nr = TRI_LengthArrayJson(r);\n\n for (size_t i = 0; i < nv; ++i) {\n TRI_json_t const* v = TRI_LookupArrayJson(value, i);\n\n bool found = false;\n\n for (size_t j = 0; j < nr; ++j) {\n if (TRI_CheckSameValueJson(v, TRI_LookupArrayJson(r, j))) {\n found = true;\n break;\n }\n }\n\n if (! found) {\n return false;\n }\n }\n }\n else {\n if (! TRI_CheckSameValueJson(value, TRI_LookupObjectJson(rhs, \"fields\"))) {\n return false;\n }\n }\n\n }\n\n return true;\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\/ @brief return a contextual string for logging\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nstd::string Index::context () const {\n std::ostringstream result;\n\n result << \"index { id: \" << id() \n << \", type: \" << typeName() \n << \", collection: \" << _collection->_vocbase->_name \n << \"\/\" << _collection->_info._name << \" }\";\n\n return result.str();\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\/ @brief create a JSON representation of the index\n\/\/\/ base functionality (called from derived classes)\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\ntriagens::basics::Json Index::toJson (TRI_memory_zone_t* zone) const {\n triagens::basics::Json json(zone, triagens::basics::Json::Object, 4);\n\n json(\"id\", triagens::basics::Json(zone, std::to_string(_iid)))\n (\"type\", triagens::basics::Json(zone, typeName()));\n\n if (dumpFields()) {\n triagens::basics::Json f(zone, triagens::basics::Json::Array, fields().size());\n\n for (auto const& field : fields()) {\n std::string fieldString;\n TRI_AttributeNamesToString(field, fieldString);\n f.add(triagens::basics::Json(zone, fieldString));\n }\n\n json(\"fields\", f);\n }\n\n if (hasSelectivityEstimate()) {\n json(\"selectivityEstimate\", triagens::basics::Json(selectivityEstimate()));\n }\n\n return json;\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\/ @brief default implementation for selectivityEstimate\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\ndouble Index::selectivityEstimate () const {\n THROW_ARANGO_EXCEPTION(TRI_ERROR_NOT_IMPLEMENTED);\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\/ @brief default implementation for selectivityEstimate\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nint Index::batchInsert (std::vector<struct TRI_doc_mptr_t const*> const*, size_t) {\n THROW_ARANGO_EXCEPTION(TRI_ERROR_NOT_IMPLEMENTED);\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\/ @brief default implementation for postInsert\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nint Index::postInsert (struct TRI_transaction_collection_s*,\n struct TRI_doc_mptr_t const*) {\n \/\/ do nothing\n return TRI_ERROR_NO_ERROR;\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\/ @brief default implementation for cleanup\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nint Index::cleanup () {\n \/\/ do nothing\n return TRI_ERROR_NO_ERROR;\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\/ @brief default implementation for sizeHint\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nint Index::sizeHint (size_t) {\n \/\/ do nothing\n return TRI_ERROR_NO_ERROR;\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\/ @brief default implementation for hasBatchInsert\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nbool Index::hasBatchInsert () const {\n return false;\n}\n\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\/ @brief helper function to insert a document into any index type\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nint Index::fillElement(std::function<TRI_index_element_t* ()> allocate,\n std::vector<TRI_index_element_t*>& elements,\n TRI_doc_mptr_t const* document,\n std::vector<TRI_shape_pid_t> const& paths,\n bool const sparse) {\n TRI_ASSERT(document != nullptr);\n TRI_ASSERT_EXPENSIVE(document->getDataPtr() != nullptr); \/\/ ONLY IN INDEX, PROTECTED by RUNTIME\n\n TRI_shaped_json_t shapedJson;\n\n TRI_EXTRACT_SHAPED_JSON_MARKER(shapedJson, document->getDataPtr()); \/\/ ONLY IN INDEX, PROTECTED by RUNTIME\n\n if (shapedJson._sid == TRI_SHAPE_ILLEGAL) {\n LOG_WARNING(\"encountered invalid marker with shape id 0\");\n\n return TRI_ERROR_INTERNAL;\n }\n\n char const* ptr = document->getShapedJsonPtr(); \/\/ ONLY IN INDEX, PROTECTED by RUNTIME\n\n size_t const n = paths.size();\n\n TRI_index_element_t* element = allocate();\n if (element == nullptr) {\n return TRI_ERROR_OUT_OF_MEMORY;\n }\n element->document(const_cast<TRI_doc_mptr_t*>(document));\n TRI_shaped_sub_t* subObjects = element->subObjects();\n for (size_t j = 0; j < n; ++j) {\n TRI_shape_pid_t path = paths[j];\n\n \/\/ ..........................................................................\n \/\/ Determine if document has that particular shape\n \/\/ ..........................................................................\n\n TRI_shape_access_t const* acc = _collection->getShaper()->findAccessor(shapedJson._sid, path); \/\/ ONLY IN INDEX, PROTECTED by RUNTIME\n\n if (acc == nullptr || acc->_resultSid == TRI_SHAPE_ILLEGAL) {\n \/\/ OK, the document does not contain the attributed needed by \n \/\/ the index, are we sparse?\n subObjects[j]._sid = BasicShapes::TRI_SHAPE_SID_NULL;\n\n\n if (sparse) {\n \/\/ no need to continue\n \/\/ Free this element and return.\n TRI_index_element_t::free(element);\n return TRI_ERROR_ARANGO_INDEX_DOCUMENT_ATTRIBUTE_MISSING;\n }\n continue;\n }\n\n \/\/ ..........................................................................\n \/\/ Extract the field\n \/\/ ..........................................................................\n\n TRI_shaped_json_t shapedObject;\n if (! TRI_ExecuteShapeAccessor(acc, &shapedJson, &shapedObject)) {\n return TRI_ERROR_INTERNAL;\n }\n\n if (shapedObject._sid == BasicShapes::TRI_SHAPE_SID_NULL) {\n if (sparse) {\n \/\/ no need to continue\n \/\/ Free this element and return.\n TRI_index_element_t::free(element);\n return TRI_ERROR_ARANGO_INDEX_DOCUMENT_ATTRIBUTE_MISSING;\n }\n }\n\n \/\/ .........................................................................\n \/\/ Store the field\n \/\/ .........................................................................\n\n TRI_FillShapedSub(&subObjects[j], &shapedObject, ptr);\n }\n elements.push_back(element);\n\n return TRI_ERROR_NO_ERROR;\n}\n\nnamespace triagens {\n namespace arango {\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\/ @brief append the index description to an output stream\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n \n std::ostream& operator<< (std::ostream& stream,\n Index const* index) {\n stream << index->context();\n return stream;\n }\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\/ @brief append the index description to an output stream\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n std::ostream& operator<< (std::ostream& stream,\n Index const& index) {\n stream << index.context();\n return stream;\n }\n\n }\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>Attribtue missing will not be returned when inserting elements into the index any more.<commit_after>\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\/ @brief index\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 Dr. Frank Celler\n\/\/\/ @author Copyright 2014, ArangoDB GmbH, Cologne, Germany\n\/\/\/ @author Copyright 2011-2013, triAGENS GmbH, Cologne, Germany\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n#include \"Index.h\"\n#include \"Basics\/Exceptions.h\"\n#include \"Basics\/json-utilities.h\"\n#include \"VocBase\/server.h\"\n#include \"VocBase\/VocShaper.h\"\n\nusing namespace triagens::arango;\n\n\/\/ -----------------------------------------------------------------------------\n\/\/ --SECTION-- class Index\n\/\/ -----------------------------------------------------------------------------\n\n\/\/ -----------------------------------------------------------------------------\n\/\/ --SECTION-- constructors and destructors\n\/\/ -----------------------------------------------------------------------------\n\nIndex::Index (TRI_idx_iid_t iid,\n TRI_document_collection_t* collection,\n std::vector<std::vector<triagens::basics::AttributeName>> const& fields) \n : _iid(iid),\n _collection(collection),\n _fields(fields) {\n}\n\nIndex::~Index () {\n}\n\n\/\/ -----------------------------------------------------------------------------\n\/\/ --SECTION-- public methods\n\/\/ -----------------------------------------------------------------------------\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\/ @brief return the index type based on a type name\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nIndex::IndexType Index::type (char const* type) {\n if (::strcmp(type, \"primary\") == 0) {\n return TRI_IDX_TYPE_PRIMARY_INDEX;\n }\n if (::strcmp(type, \"edge\") == 0) {\n return TRI_IDX_TYPE_EDGE_INDEX;\n }\n if (::strcmp(type, \"hash\") == 0) {\n return TRI_IDX_TYPE_HASH_INDEX;\n }\n if (::strcmp(type, \"skiplist\") == 0) {\n return TRI_IDX_TYPE_SKIPLIST_INDEX;\n }\n if (::strcmp(type, \"fulltext\") == 0) {\n return TRI_IDX_TYPE_FULLTEXT_INDEX;\n }\n if (::strcmp(type, \"cap\") == 0) {\n return TRI_IDX_TYPE_CAP_CONSTRAINT;\n }\n if (::strcmp(type, \"geo1\") == 0) {\n return TRI_IDX_TYPE_GEO1_INDEX;\n }\n if (::strcmp(type, \"geo2\") == 0) {\n return TRI_IDX_TYPE_GEO2_INDEX;\n }\n\n return TRI_IDX_TYPE_UNKNOWN;\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\/ @brief return the name of an index type\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nchar const* Index::typeName (Index::IndexType type) {\n switch (type) {\n case TRI_IDX_TYPE_PRIMARY_INDEX:\n return \"primary\";\n case TRI_IDX_TYPE_EDGE_INDEX:\n return \"edge\";\n case TRI_IDX_TYPE_HASH_INDEX:\n return \"hash\";\n case TRI_IDX_TYPE_SKIPLIST_INDEX:\n return \"skiplist\";\n case TRI_IDX_TYPE_FULLTEXT_INDEX:\n return \"fulltext\";\n case TRI_IDX_TYPE_CAP_CONSTRAINT:\n return \"cap\";\n case TRI_IDX_TYPE_GEO1_INDEX:\n return \"geo1\";\n case TRI_IDX_TYPE_GEO2_INDEX:\n return \"geo2\";\n case TRI_IDX_TYPE_PRIORITY_QUEUE_INDEX:\n case TRI_IDX_TYPE_BITARRAY_INDEX:\n case TRI_IDX_TYPE_UNKNOWN: {\n }\n }\n\n return \"\";\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\/ @brief validate an index id\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nbool Index::validateId (char const* key) {\n char const* p = key;\n\n while (1) {\n const char c = *p;\n\n if (c == '\\0') {\n return (p - key) > 0;\n }\n if (c >= '0' && c <= '9') {\n ++p;\n continue;\n }\n\n return false;\n }\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\/ @brief validate an index handle (collection name + \/ + index id)\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nbool Index::validateHandle (char const* key,\n size_t* split) {\n char const* p = key;\n char c = *p;\n\n \/\/ extract collection name\n\n if (! (c == '_' || (c >= 'a' && c <= 'z') || (c >= 'A' && c <= 'Z'))) {\n return false;\n }\n\n ++p;\n\n while (1) {\n c = *p;\n\n if ((c == '_') || (c == '-') || (c >= '0' && c <= '9') || (c >= 'a' && c <= 'z') || (c >= 'A' && c <= 'Z')) {\n ++p;\n continue;\n }\n\n if (c == '\/') {\n break;\n }\n\n return false;\n }\n\n if (p - key > TRI_COL_NAME_LENGTH) {\n return false;\n }\n\n \/\/ store split position\n *split = p - key;\n ++p;\n\n \/\/ validate index id\n return validateId(p);\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\/ @brief generate a new index id\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nTRI_idx_iid_t Index::generateId () {\n return TRI_NewTickServer();\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\/ @brief index comparator, used by the coordinator to detect if two index\n\/\/\/ contents are the same\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nbool Index::Compare (TRI_json_t const* lhs,\n TRI_json_t const* rhs) {\n TRI_json_t* typeJson = TRI_LookupObjectJson(lhs, \"type\");\n TRI_ASSERT(TRI_IsStringJson(typeJson));\n\n \/\/ type must be identical\n if (! TRI_CheckSameValueJson(typeJson, TRI_LookupObjectJson(rhs, \"type\"))) {\n return false;\n }\n\n auto type = Index::type(typeJson->_value._string.data);\n\n \/\/ unique must be identical if present\n TRI_json_t* value = TRI_LookupObjectJson(lhs, \"unique\");\n if (TRI_IsBooleanJson(value)) {\n if (! TRI_CheckSameValueJson(value, TRI_LookupObjectJson(rhs, \"unique\"))) {\n return false;\n }\n }\n\n \/\/ sparse must be identical if present\n value = TRI_LookupObjectJson(lhs, \"sparse\");\n if (TRI_IsBooleanJson(value)) {\n if (! TRI_CheckSameValueJson(value, TRI_LookupObjectJson(rhs, \"sparse\"))) {\n return false;\n }\n }\n\n\n if (type == IndexType::TRI_IDX_TYPE_GEO1_INDEX) {\n \/\/ geoJson must be identical if present\n value = TRI_LookupObjectJson(lhs, \"geoJson\");\n if (TRI_IsBooleanJson(value)) {\n if (! TRI_CheckSameValueJson(value, TRI_LookupObjectJson(rhs, \"geoJson\"))) {\n return false;\n }\n }\n }\n else if (type == IndexType::TRI_IDX_TYPE_FULLTEXT_INDEX) {\n \/\/ minLength\n value = TRI_LookupObjectJson(lhs, \"minLength\");\n if (TRI_IsNumberJson(value)) {\n if (! TRI_CheckSameValueJson(value, TRI_LookupObjectJson(rhs, \"minLength\"))) {\n return false;\n }\n }\n }\n else if (type == IndexType::TRI_IDX_TYPE_CAP_CONSTRAINT) {\n \/\/ size, byteSize\n value = TRI_LookupObjectJson(lhs, \"size\");\n if (TRI_IsNumberJson(value)) {\n if (! TRI_CheckSameValueJson(value, TRI_LookupObjectJson(rhs, \"size\"))) {\n return false;\n }\n }\n\n value = TRI_LookupObjectJson(lhs, \"byteSize\");\n if (TRI_IsNumberJson(value)) {\n if (! TRI_CheckSameValueJson(value, TRI_LookupObjectJson(rhs, \"byteSize\"))) {\n return false;\n }\n }\n }\n\n \/\/ other index types: fields must be identical if present\n value = TRI_LookupObjectJson(lhs, \"fields\");\n\n if (TRI_IsArrayJson(value)) {\n if (type == IndexType::TRI_IDX_TYPE_HASH_INDEX) {\n size_t const nv = TRI_LengthArrayJson(value);\n \n \/\/ compare fields in arbitrary order\n TRI_json_t const* r = TRI_LookupObjectJson(rhs, \"fields\");\n\n if (! TRI_IsArrayJson(r) ||\n nv != TRI_LengthArrayJson(r)) {\n return false;\n }\n\n size_t const nr = TRI_LengthArrayJson(r);\n\n for (size_t i = 0; i < nv; ++i) {\n TRI_json_t const* v = TRI_LookupArrayJson(value, i);\n\n bool found = false;\n\n for (size_t j = 0; j < nr; ++j) {\n if (TRI_CheckSameValueJson(v, TRI_LookupArrayJson(r, j))) {\n found = true;\n break;\n }\n }\n\n if (! found) {\n return false;\n }\n }\n }\n else {\n if (! TRI_CheckSameValueJson(value, TRI_LookupObjectJson(rhs, \"fields\"))) {\n return false;\n }\n }\n\n }\n\n return true;\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\/ @brief return a contextual string for logging\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nstd::string Index::context () const {\n std::ostringstream result;\n\n result << \"index { id: \" << id() \n << \", type: \" << typeName() \n << \", collection: \" << _collection->_vocbase->_name \n << \"\/\" << _collection->_info._name << \" }\";\n\n return result.str();\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\/ @brief create a JSON representation of the index\n\/\/\/ base functionality (called from derived classes)\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\ntriagens::basics::Json Index::toJson (TRI_memory_zone_t* zone) const {\n triagens::basics::Json json(zone, triagens::basics::Json::Object, 4);\n\n json(\"id\", triagens::basics::Json(zone, std::to_string(_iid)))\n (\"type\", triagens::basics::Json(zone, typeName()));\n\n if (dumpFields()) {\n triagens::basics::Json f(zone, triagens::basics::Json::Array, fields().size());\n\n for (auto const& field : fields()) {\n std::string fieldString;\n TRI_AttributeNamesToString(field, fieldString);\n f.add(triagens::basics::Json(zone, fieldString));\n }\n\n json(\"fields\", f);\n }\n\n if (hasSelectivityEstimate()) {\n json(\"selectivityEstimate\", triagens::basics::Json(selectivityEstimate()));\n }\n\n return json;\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\/ @brief default implementation for selectivityEstimate\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\ndouble Index::selectivityEstimate () const {\n THROW_ARANGO_EXCEPTION(TRI_ERROR_NOT_IMPLEMENTED);\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\/ @brief default implementation for selectivityEstimate\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nint Index::batchInsert (std::vector<struct TRI_doc_mptr_t const*> const*, size_t) {\n THROW_ARANGO_EXCEPTION(TRI_ERROR_NOT_IMPLEMENTED);\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\/ @brief default implementation for postInsert\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nint Index::postInsert (struct TRI_transaction_collection_s*,\n struct TRI_doc_mptr_t const*) {\n \/\/ do nothing\n return TRI_ERROR_NO_ERROR;\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\/ @brief default implementation for cleanup\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nint Index::cleanup () {\n \/\/ do nothing\n return TRI_ERROR_NO_ERROR;\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\/ @brief default implementation for sizeHint\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nint Index::sizeHint (size_t) {\n \/\/ do nothing\n return TRI_ERROR_NO_ERROR;\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\/ @brief default implementation for hasBatchInsert\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nbool Index::hasBatchInsert () const {\n return false;\n}\n\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\/ @brief helper function to insert a document into any index type\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nint Index::fillElement(std::function<TRI_index_element_t* ()> allocate,\n std::vector<TRI_index_element_t*>& elements,\n TRI_doc_mptr_t const* document,\n std::vector<TRI_shape_pid_t> const& paths,\n bool const sparse) {\n TRI_ASSERT(document != nullptr);\n TRI_ASSERT_EXPENSIVE(document->getDataPtr() != nullptr); \/\/ ONLY IN INDEX, PROTECTED by RUNTIME\n\n TRI_shaped_json_t shapedJson;\n\n TRI_EXTRACT_SHAPED_JSON_MARKER(shapedJson, document->getDataPtr()); \/\/ ONLY IN INDEX, PROTECTED by RUNTIME\n\n if (shapedJson._sid == TRI_SHAPE_ILLEGAL) {\n LOG_WARNING(\"encountered invalid marker with shape id 0\");\n\n return TRI_ERROR_INTERNAL;\n }\n\n char const* ptr = document->getShapedJsonPtr(); \/\/ ONLY IN INDEX, PROTECTED by RUNTIME\n\n size_t const n = paths.size();\n\n TRI_index_element_t* element = allocate();\n if (element == nullptr) {\n return TRI_ERROR_OUT_OF_MEMORY;\n }\n element->document(const_cast<TRI_doc_mptr_t*>(document));\n TRI_shaped_sub_t* subObjects = element->subObjects();\n for (size_t j = 0; j < n; ++j) {\n TRI_shape_pid_t path = paths[j];\n\n \/\/ ..........................................................................\n \/\/ Determine if document has that particular shape\n \/\/ ..........................................................................\n\n TRI_shape_access_t const* acc = _collection->getShaper()->findAccessor(shapedJson._sid, path); \/\/ ONLY IN INDEX, PROTECTED by RUNTIME\n\n if (acc == nullptr || acc->_resultSid == TRI_SHAPE_ILLEGAL) {\n \/\/ OK, the document does not contain the attributed needed by \n \/\/ the index, are we sparse?\n subObjects[j]._sid = BasicShapes::TRI_SHAPE_SID_NULL;\n\n\n if (sparse) {\n \/\/ no need to continue\n \/\/ Free this element and return.\n TRI_index_element_t::free(element);\n return TRI_ERROR_NO_ERROR;\n \/\/ return TRI_ERROR_ARANGO_INDEX_DOCUMENT_ATTRIBUTE_MISSING;\n }\n continue;\n }\n\n \/\/ ..........................................................................\n \/\/ Extract the field\n \/\/ ..........................................................................\n\n TRI_shaped_json_t shapedObject;\n if (! TRI_ExecuteShapeAccessor(acc, &shapedJson, &shapedObject)) {\n return TRI_ERROR_INTERNAL;\n }\n\n if (shapedObject._sid == BasicShapes::TRI_SHAPE_SID_NULL) {\n if (sparse) {\n \/\/ no need to continue\n \/\/ Free this element and return.\n TRI_index_element_t::free(element);\n return TRI_ERROR_NO_ERROR;\n \/\/ return TRI_ERROR_ARANGO_INDEX_DOCUMENT_ATTRIBUTE_MISSING;\n }\n }\n\n \/\/ .........................................................................\n \/\/ Store the field\n \/\/ .........................................................................\n\n TRI_FillShapedSub(&subObjects[j], &shapedObject, ptr);\n }\n elements.push_back(element);\n\n return TRI_ERROR_NO_ERROR;\n}\n\nnamespace triagens {\n namespace arango {\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\/ @brief append the index description to an output stream\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n \n std::ostream& operator<< (std::ostream& stream,\n Index const* index) {\n stream << index->context();\n return stream;\n }\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\/ @brief append the index description to an output stream\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n std::ostream& operator<< (std::ostream& stream,\n Index const& index) {\n stream << index.context();\n return stream;\n }\n\n }\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>\/* Copyright 2017 The TensorFlow Authors. All Rights Reserved.\n\nLicensed under the Apache License, Version 2.0 (the \"License\");\nyou may not use this file except in compliance with the License.\nYou may obtain a copy of the License at\n\n http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n\nUnless required by applicable law or agreed to in writing, software\ndistributed under the License is distributed on an \"AS IS\" BASIS,\nWITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\nSee the License for the specific language governing permissions and\nlimitations under the License.\n==============================================================================*\/\n\n#include \"tensorflow\/compiler\/xla\/service\/cpu\/cpu_parallelization_preparation.h\"\n\n#include \"tensorflow\/compiler\/xla\/map_util.h\"\n#include \"tensorflow\/compiler\/xla\/service\/cpu\/ir_emission_utils.h\"\n#include \"tensorflow\/compiler\/xla\/service\/cpu\/shape_partition.h\"\n#include \"tensorflow\/compiler\/xla\/service\/hlo_computation.h\"\n#include \"tensorflow\/compiler\/xla\/service\/hlo_instruction.h\"\n#include \"tensorflow\/compiler\/xla\/service\/hlo_opcode.h\"\n#include \"tensorflow\/compiler\/xla\/service\/logical_buffer.h\"\n#include \"tensorflow\/compiler\/xla\/service\/tuple_points_to_analysis.h\"\n#include \"tensorflow\/compiler\/xla\/types.h\"\n#include \"tensorflow\/compiler\/xla\/util.h\"\n#include \"tensorflow\/core\/lib\/strings\/strcat.h\"\n\nnamespace xla {\nnamespace cpu {\n\nStatusOr<bool> ParallelizationPreparation::Run(HloModule* module) {\n XLA_VLOG_LINES(2, \"ParallelizationPreparation ENTRY\");\n XLA_VLOG_LINES(2, module->ToString());\n\n bool changed = false;\n TF_ASSIGN_OR_RETURN(changed, RunParallelTaskAssignment(module));\n\n HloComputation* entry_computation = module->entry_computation();\n std::unordered_set<HloInstruction*> outlined;\n std::vector<HloInstruction*> instructions_to_outline;\n for (HloInstruction* instruction :\n entry_computation->MakeInstructionPostOrder()) {\n \/\/ If the instruction has been outlined, it no longer exists and we must not\n \/\/ dereference it.\n if (outlined.count(instruction) > 0) {\n continue;\n }\n\n \/\/ Skip parameters and constants, there is nothing to parallelize.\n if (instruction->opcode() == HloOpcode::kParameter ||\n instruction->opcode() == HloOpcode::kConstant) {\n continue;\n }\n\n \/\/ Outline 'instruction' in isolation if it was assigned parallel tasks.\n if (OutlineParallelizableInstruction(instruction)) {\n outlined.insert(instruction);\n changed = true;\n continue;\n }\n\n instructions_to_outline.clear();\n HloInstruction* outline_candidate = instruction;\n instructions_to_outline.push_back(outline_candidate);\n bool all_bitcasts = outline_candidate->opcode() == HloOpcode::kBitcast;\n\n \/\/ Outline sole users with the current instruction.\n while (CanOutlineWithUser(outline_candidate)) {\n HloInstruction* prior_candidate = outline_candidate;\n outline_candidate = *outline_candidate->users().begin();\n all_bitcasts |= outline_candidate->opcode() == HloOpcode::kBitcast;\n if (std::any_of(outline_candidate->operands().begin(),\n outline_candidate->operands().end(),\n [&](const HloInstruction* operand) {\n \/\/ Do not consider any candidates which have operands\n \/\/ other than the prior candidate, constants or\n \/\/ parameters. Otherwise, we'd increase the fan-in which\n \/\/ would reduce parallelism.\n return operand->opcode() != HloOpcode::kParameter &&\n operand->opcode() != HloOpcode::kConstant &&\n operand != prior_candidate;\n })) {\n break;\n }\n instructions_to_outline.push_back(outline_candidate);\n }\n \/\/ If all instructions in the outline candidates are a bitcast, then create\n \/\/ a copy at the head of the bitcasts and include it in the outlined\n \/\/ instructions. The underlying problem is that a computation which forwards\n \/\/ a parameter buffer to the output is not properly handled by the backends\n \/\/ or analysis.\n \/\/\n \/\/ This would be better handled by being smarter about choosing outline\n \/\/ candidates in the first place.\n if (all_bitcasts) {\n \/\/ 'head' is the first instruction in the chain of bitcasts.\n HloInstruction* head = instructions_to_outline[0];\n HloInstruction* head_operand = head->mutable_operand(0);\n HloInstruction* copy =\n entry_computation->AddInstruction(HloInstruction::CreateUnary(\n head_operand->shape(), HloOpcode::kCopy, head_operand));\n TF_RETURN_IF_ERROR(head->ReplaceOperandWith(0, copy));\n instructions_to_outline.insert(instructions_to_outline.begin(), copy);\n }\n\n outlined.insert(instructions_to_outline.begin(),\n instructions_to_outline.end());\n\n \/\/ Optimization to avoid replacing a single existing kCall with another\n \/\/ kCall that just calls the first one.\n if (instructions_to_outline.size() == 1 &&\n instructions_to_outline[0]->opcode() == HloOpcode::kCall) {\n continue;\n }\n\n module->OutlineExpressionFromComputation(\n instructions_to_outline,\n tensorflow::strings::StrCat(\"pp_\", instruction->name()),\n entry_computation);\n changed = true;\n }\n\n TF_ASSIGN_OR_RETURN(auto points_to_analysis,\n TuplePointsToAnalysis::Run(module));\n for (auto& computation : module->computations()) {\n if (computation->IsFusionComputation()) {\n continue;\n }\n HloInstruction* root = computation->root_instruction();\n \/\/ Copy root instruction if it does not define its own top-level buffer.\n \/\/ TODO(b\/32885001) Remove these copies (at least for the unambiguous case).\n \/\/ TODO(b\/32885001) Perform shallow copy if root value is a tuple.\n if (!points_to_analysis->InstructionDefinesBufferAtIndex(root,\n \/*index=*\/{})) {\n HloInstruction* copy = computation->AddInstruction(\n HloInstruction::CreateUnary(root->shape(), HloOpcode::kCopy, root));\n computation->set_root_instruction(copy);\n changed = true;\n }\n }\n\n XLA_VLOG_LINES(2, \"ParallelizationPreparation EXIT\");\n XLA_VLOG_LINES(2, module->ToString());\n return changed;\n}\n\nStatusOr<bool> ParallelizationPreparation::RunParallelTaskAssignment(\n HloModule* module) {\n VLOG(1) << \"RunParallelTaskAssignment max_parallelism_: \" << max_parallelism_;\n bool changed = false;\n \/\/ Run cost analysis on entry computation.\n HloCostAnalysis cost_analysis(shape_size_);\n HloComputation* computation = module->entry_computation();\n Status cost_status = computation->root_instruction()->Accept(&cost_analysis);\n for (auto& instruction : computation->instructions()) {\n \/\/ Currently, we do not assign parallel tasks to instructions with at least\n \/\/ one of the following properties:\n \/\/ *) Internal threading (library calls to kConv, kDot, and kCustomCall).\n \/\/ *) Emit custom loops (kSelectAndScatter, FusionKind::kTransposeDot).\n \/\/ *) Tuple-shaped.\n \/\/ TODO(b\/27458679) Parallelize instructions which are skipped here.\n if (instruction->opcode() == HloOpcode::kParameter ||\n instruction->opcode() == HloOpcode::kConstant ||\n instruction->opcode() == HloOpcode::kCall ||\n instruction->opcode() == HloOpcode::kCustomCall ||\n instruction->opcode() == HloOpcode::kSelectAndScatter ||\n (instruction->opcode() == HloOpcode::kConvolution &&\n PotentiallyImplementedAsEigenConvolution(*instruction)) ||\n PotentiallyImplementedAsEigenDot(*instruction) ||\n (instruction->opcode() == HloOpcode::kFusion &&\n instruction->fusion_kind() != HloInstruction::FusionKind::kLoop) ||\n ShapeUtil::IsTuple(instruction->shape())) {\n continue;\n }\n\n \/\/ Calculate target parallel task count in [1, max_parallelism_].\n const int64 target_parallel_task_count = GetTargetParallelTaskCount(\n cost_status.ok() ? &cost_analysis : nullptr, instruction.get());\n if (target_parallel_task_count == 1) {\n continue;\n }\n\n \/\/ Assign feasible dimension partitions (based on actual dimension sizes).\n auto dim_partition_counts = ShapePartitionAssigner(instruction->shape())\n .Run(target_parallel_task_count);\n const int64 total_partition_count =\n ShapePartitionAssigner::GetTotalPartitionCount(dim_partition_counts);\n if (total_partition_count <= 1) {\n \/\/ Feasible partition calculation resulting in no partitioning, so skip.\n continue;\n }\n VLOG(2) << \"Assigning parallel task count: \" << total_partition_count\n << \" to instruction: \" << instruction->name();\n \/\/ Map 'instruction' to assigned dimension partitioning.\n instruction->set_outer_dimension_partitions(dim_partition_counts);\n }\n\n return changed;\n}\n\nint64 ParallelizationPreparation::GetTargetParallelTaskCount(\n const HloCostAnalysis* cost_analysis, HloInstruction* instruction) {\n \/\/ Default to a simple cost model based on hlo size and typical L2 cache size.\n \/\/ Note that 'cost_analysis' can be 'nullptr' if HloCostAnalysis returns an\n \/\/ error status (likely because HLOs like CustomCall are not yet implemented\n \/\/ in the HloCostAnalysis).\n int64 instruction_cost = shape_size_(instruction->shape());\n int64 min_cost_per_thread = 256LL << 10; \/\/ 256KB L2 Cache size.\n if (cost_analysis != nullptr) {\n \/\/ Calculate the instruction cost in cycles.\n \/\/ TODO(29630486) Improve on this linear cost model.\n \/\/ Consider making 'min_cost_per_thread' be a function of the target\n \/\/ bandwidth limit for instructions with low arithmetic complexity.\n instruction_cost = 1 * cost_analysis->flop_count(*instruction) +\n 2 * cost_analysis->transcendental_count(*instruction) +\n 10 * cost_analysis->bytes_accessed(*instruction);\n \/\/ Minimum per-thread cost is 100us of work on a 2GHz core.\n min_cost_per_thread = 100000;\n }\n \/\/ Return target parallel task count in [1, max_parallelism_].\n return std::min(max_parallelism_,\n std::max(1LL, instruction_cost \/ min_cost_per_thread));\n}\n\nbool ParallelizationPreparation::OutlineParallelizableInstruction(\n HloInstruction* instruction) {\n if (instruction->outer_dimension_partitions().empty()) {\n return false;\n }\n \/\/ Store dimension partition counts before outlining (which clones\n \/\/ 'instruction').\n std::vector<int64> dim_partition_counts =\n instruction->outer_dimension_partitions();\n \/\/ Outline 'instruction' in its own sub-computation.\n HloModule* module = instruction->parent()->parent();\n auto* call = module->OutlineExpressionFromComputation(\n {instruction}, tensorflow::strings::StrCat(\"pp_\", instruction->name()),\n module->entry_computation());\n \/\/ Map previously assigned 'dim_partition_counts' to cloned root instruction.\n VLOG(1) << \"Outlining parallelizable\"\n << \" caller: \" << call->name()\n << \" callee: \" << call->to_apply()->root_instruction()->name();\n call->to_apply()->root_instruction()->set_outer_dimension_partitions(\n dim_partition_counts);\n return true;\n}\n\nbool ParallelizationPreparation::CanOutlineWithUser(\n HloInstruction* instruction) {\n if (instruction->users().size() != 1) {\n \/\/ Do not outline 'instruction' with multiple users.\n return false;\n }\n if (AssignedParallelTasks(instruction) ||\n AssignedParallelTasks(*instruction->users().begin())) {\n \/\/ Do not outline if 'instruction' (or user) were assigned parallel tasks.\n return false;\n }\n return true;\n}\n\nbool ParallelizationPreparation::AssignedParallelTasks(\n HloInstruction* instruction) {\n return !instruction->outer_dimension_partitions().empty() ||\n (instruction->opcode() == HloOpcode::kCall &&\n !instruction->to_apply()\n ->root_instruction()\n ->outer_dimension_partitions()\n .empty());\n}\n\n} \/\/ namespace cpu\n} \/\/ namespace xla\n<commit_msg>[XLA:CPU] One character code review (Update 'all_bitcasts' variable correctly).<commit_after>\/* Copyright 2017 The TensorFlow Authors. All Rights Reserved.\n\nLicensed under the Apache License, Version 2.0 (the \"License\");\nyou may not use this file except in compliance with the License.\nYou may obtain a copy of the License at\n\n http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n\nUnless required by applicable law or agreed to in writing, software\ndistributed under the License is distributed on an \"AS IS\" BASIS,\nWITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\nSee the License for the specific language governing permissions and\nlimitations under the License.\n==============================================================================*\/\n\n#include \"tensorflow\/compiler\/xla\/service\/cpu\/cpu_parallelization_preparation.h\"\n\n#include \"tensorflow\/compiler\/xla\/map_util.h\"\n#include \"tensorflow\/compiler\/xla\/service\/cpu\/ir_emission_utils.h\"\n#include \"tensorflow\/compiler\/xla\/service\/cpu\/shape_partition.h\"\n#include \"tensorflow\/compiler\/xla\/service\/hlo_computation.h\"\n#include \"tensorflow\/compiler\/xla\/service\/hlo_instruction.h\"\n#include \"tensorflow\/compiler\/xla\/service\/hlo_opcode.h\"\n#include \"tensorflow\/compiler\/xla\/service\/logical_buffer.h\"\n#include \"tensorflow\/compiler\/xla\/service\/tuple_points_to_analysis.h\"\n#include \"tensorflow\/compiler\/xla\/types.h\"\n#include \"tensorflow\/compiler\/xla\/util.h\"\n#include \"tensorflow\/core\/lib\/strings\/strcat.h\"\n\nnamespace xla {\nnamespace cpu {\n\nStatusOr<bool> ParallelizationPreparation::Run(HloModule* module) {\n XLA_VLOG_LINES(2, \"ParallelizationPreparation ENTRY\");\n XLA_VLOG_LINES(2, module->ToString());\n\n bool changed = false;\n TF_ASSIGN_OR_RETURN(changed, RunParallelTaskAssignment(module));\n\n HloComputation* entry_computation = module->entry_computation();\n std::unordered_set<HloInstruction*> outlined;\n std::vector<HloInstruction*> instructions_to_outline;\n for (HloInstruction* instruction :\n entry_computation->MakeInstructionPostOrder()) {\n \/\/ If the instruction has been outlined, it no longer exists and we must not\n \/\/ dereference it.\n if (outlined.count(instruction) > 0) {\n continue;\n }\n\n \/\/ Skip parameters and constants, there is nothing to parallelize.\n if (instruction->opcode() == HloOpcode::kParameter ||\n instruction->opcode() == HloOpcode::kConstant) {\n continue;\n }\n\n \/\/ Outline 'instruction' in isolation if it was assigned parallel tasks.\n if (OutlineParallelizableInstruction(instruction)) {\n outlined.insert(instruction);\n changed = true;\n continue;\n }\n\n instructions_to_outline.clear();\n HloInstruction* outline_candidate = instruction;\n instructions_to_outline.push_back(outline_candidate);\n bool all_bitcasts = outline_candidate->opcode() == HloOpcode::kBitcast;\n\n \/\/ Outline sole users with the current instruction.\n while (CanOutlineWithUser(outline_candidate)) {\n HloInstruction* prior_candidate = outline_candidate;\n outline_candidate = *outline_candidate->users().begin();\n all_bitcasts &= outline_candidate->opcode() == HloOpcode::kBitcast;\n if (std::any_of(outline_candidate->operands().begin(),\n outline_candidate->operands().end(),\n [&](const HloInstruction* operand) {\n \/\/ Do not consider any candidates which have operands\n \/\/ other than the prior candidate, constants or\n \/\/ parameters. Otherwise, we'd increase the fan-in which\n \/\/ would reduce parallelism.\n return operand->opcode() != HloOpcode::kParameter &&\n operand->opcode() != HloOpcode::kConstant &&\n operand != prior_candidate;\n })) {\n break;\n }\n instructions_to_outline.push_back(outline_candidate);\n }\n \/\/ If all instructions in the outline candidates are a bitcast, then create\n \/\/ a copy at the head of the bitcasts and include it in the outlined\n \/\/ instructions. The underlying problem is that a computation which forwards\n \/\/ a parameter buffer to the output is not properly handled by the backends\n \/\/ or analysis.\n \/\/\n \/\/ This would be better handled by being smarter about choosing outline\n \/\/ candidates in the first place.\n if (all_bitcasts) {\n \/\/ 'head' is the first instruction in the chain of bitcasts.\n HloInstruction* head = instructions_to_outline[0];\n HloInstruction* head_operand = head->mutable_operand(0);\n HloInstruction* copy =\n entry_computation->AddInstruction(HloInstruction::CreateUnary(\n head_operand->shape(), HloOpcode::kCopy, head_operand));\n TF_RETURN_IF_ERROR(head->ReplaceOperandWith(0, copy));\n instructions_to_outline.insert(instructions_to_outline.begin(), copy);\n }\n\n outlined.insert(instructions_to_outline.begin(),\n instructions_to_outline.end());\n\n \/\/ Optimization to avoid replacing a single existing kCall with another\n \/\/ kCall that just calls the first one.\n if (instructions_to_outline.size() == 1 &&\n instructions_to_outline[0]->opcode() == HloOpcode::kCall) {\n continue;\n }\n\n module->OutlineExpressionFromComputation(\n instructions_to_outline,\n tensorflow::strings::StrCat(\"pp_\", instruction->name()),\n entry_computation);\n changed = true;\n }\n\n TF_ASSIGN_OR_RETURN(auto points_to_analysis,\n TuplePointsToAnalysis::Run(module));\n for (auto& computation : module->computations()) {\n if (computation->IsFusionComputation()) {\n continue;\n }\n HloInstruction* root = computation->root_instruction();\n \/\/ Copy root instruction if it does not define its own top-level buffer.\n \/\/ TODO(b\/32885001) Remove these copies (at least for the unambiguous case).\n \/\/ TODO(b\/32885001) Perform shallow copy if root value is a tuple.\n if (!points_to_analysis->InstructionDefinesBufferAtIndex(root,\n \/*index=*\/{})) {\n HloInstruction* copy = computation->AddInstruction(\n HloInstruction::CreateUnary(root->shape(), HloOpcode::kCopy, root));\n computation->set_root_instruction(copy);\n changed = true;\n }\n }\n\n XLA_VLOG_LINES(2, \"ParallelizationPreparation EXIT\");\n XLA_VLOG_LINES(2, module->ToString());\n return changed;\n}\n\nStatusOr<bool> ParallelizationPreparation::RunParallelTaskAssignment(\n HloModule* module) {\n VLOG(1) << \"RunParallelTaskAssignment max_parallelism_: \" << max_parallelism_;\n bool changed = false;\n \/\/ Run cost analysis on entry computation.\n HloCostAnalysis cost_analysis(shape_size_);\n HloComputation* computation = module->entry_computation();\n Status cost_status = computation->root_instruction()->Accept(&cost_analysis);\n for (auto& instruction : computation->instructions()) {\n \/\/ Currently, we do not assign parallel tasks to instructions with at least\n \/\/ one of the following properties:\n \/\/ *) Internal threading (library calls to kConv, kDot, and kCustomCall).\n \/\/ *) Emit custom loops (kSelectAndScatter, FusionKind::kTransposeDot).\n \/\/ *) Tuple-shaped.\n \/\/ TODO(b\/27458679) Parallelize instructions which are skipped here.\n if (instruction->opcode() == HloOpcode::kParameter ||\n instruction->opcode() == HloOpcode::kConstant ||\n instruction->opcode() == HloOpcode::kCall ||\n instruction->opcode() == HloOpcode::kCustomCall ||\n instruction->opcode() == HloOpcode::kSelectAndScatter ||\n (instruction->opcode() == HloOpcode::kConvolution &&\n PotentiallyImplementedAsEigenConvolution(*instruction)) ||\n PotentiallyImplementedAsEigenDot(*instruction) ||\n (instruction->opcode() == HloOpcode::kFusion &&\n instruction->fusion_kind() != HloInstruction::FusionKind::kLoop) ||\n ShapeUtil::IsTuple(instruction->shape())) {\n continue;\n }\n\n \/\/ Calculate target parallel task count in [1, max_parallelism_].\n const int64 target_parallel_task_count = GetTargetParallelTaskCount(\n cost_status.ok() ? &cost_analysis : nullptr, instruction.get());\n if (target_parallel_task_count == 1) {\n continue;\n }\n\n \/\/ Assign feasible dimension partitions (based on actual dimension sizes).\n auto dim_partition_counts = ShapePartitionAssigner(instruction->shape())\n .Run(target_parallel_task_count);\n const int64 total_partition_count =\n ShapePartitionAssigner::GetTotalPartitionCount(dim_partition_counts);\n if (total_partition_count <= 1) {\n \/\/ Feasible partition calculation resulting in no partitioning, so skip.\n continue;\n }\n VLOG(2) << \"Assigning parallel task count: \" << total_partition_count\n << \" to instruction: \" << instruction->name();\n \/\/ Map 'instruction' to assigned dimension partitioning.\n instruction->set_outer_dimension_partitions(dim_partition_counts);\n }\n\n return changed;\n}\n\nint64 ParallelizationPreparation::GetTargetParallelTaskCount(\n const HloCostAnalysis* cost_analysis, HloInstruction* instruction) {\n \/\/ Default to a simple cost model based on hlo size and typical L2 cache size.\n \/\/ Note that 'cost_analysis' can be 'nullptr' if HloCostAnalysis returns an\n \/\/ error status (likely because HLOs like CustomCall are not yet implemented\n \/\/ in the HloCostAnalysis).\n int64 instruction_cost = shape_size_(instruction->shape());\n int64 min_cost_per_thread = 256LL << 10; \/\/ 256KB L2 Cache size.\n if (cost_analysis != nullptr) {\n \/\/ Calculate the instruction cost in cycles.\n \/\/ TODO(29630486) Improve on this linear cost model.\n \/\/ Consider making 'min_cost_per_thread' be a function of the target\n \/\/ bandwidth limit for instructions with low arithmetic complexity.\n instruction_cost = 1 * cost_analysis->flop_count(*instruction) +\n 2 * cost_analysis->transcendental_count(*instruction) +\n 10 * cost_analysis->bytes_accessed(*instruction);\n \/\/ Minimum per-thread cost is 100us of work on a 2GHz core.\n min_cost_per_thread = 100000;\n }\n \/\/ Return target parallel task count in [1, max_parallelism_].\n return std::min(max_parallelism_,\n std::max(1LL, instruction_cost \/ min_cost_per_thread));\n}\n\nbool ParallelizationPreparation::OutlineParallelizableInstruction(\n HloInstruction* instruction) {\n if (instruction->outer_dimension_partitions().empty()) {\n return false;\n }\n \/\/ Store dimension partition counts before outlining (which clones\n \/\/ 'instruction').\n std::vector<int64> dim_partition_counts =\n instruction->outer_dimension_partitions();\n \/\/ Outline 'instruction' in its own sub-computation.\n HloModule* module = instruction->parent()->parent();\n auto* call = module->OutlineExpressionFromComputation(\n {instruction}, tensorflow::strings::StrCat(\"pp_\", instruction->name()),\n module->entry_computation());\n \/\/ Map previously assigned 'dim_partition_counts' to cloned root instruction.\n VLOG(1) << \"Outlining parallelizable\"\n << \" caller: \" << call->name()\n << \" callee: \" << call->to_apply()->root_instruction()->name();\n call->to_apply()->root_instruction()->set_outer_dimension_partitions(\n dim_partition_counts);\n return true;\n}\n\nbool ParallelizationPreparation::CanOutlineWithUser(\n HloInstruction* instruction) {\n if (instruction->users().size() != 1) {\n \/\/ Do not outline 'instruction' with multiple users.\n return false;\n }\n if (AssignedParallelTasks(instruction) ||\n AssignedParallelTasks(*instruction->users().begin())) {\n \/\/ Do not outline if 'instruction' (or user) were assigned parallel tasks.\n return false;\n }\n return true;\n}\n\nbool ParallelizationPreparation::AssignedParallelTasks(\n HloInstruction* instruction) {\n return !instruction->outer_dimension_partitions().empty() ||\n (instruction->opcode() == HloOpcode::kCall &&\n !instruction->to_apply()\n ->root_instruction()\n ->outer_dimension_partitions()\n .empty());\n}\n\n} \/\/ namespace cpu\n} \/\/ namespace xla\n<|endoftext|>"} {"text":"<commit_before>\/\/ RUN: %clangxx_tsan -O1 %s -o %t && %deflake %run %t | FileCheck %s\n#include <pthread.h>\n#include <stdlib.h>\n#include <stdio.h>\n#include \"test.h\"\n\nvoid *Thread1(void *p) {\n *(int*)p = 42;\n return 0;\n}\n\nvoid *Thread2(void *p) {\n *(int*)p = 44;\n return 0;\n}\n\nvoid *alloc() {\n return malloc(99);\n}\n\nvoid *AllocThread(void* arg) {\n return alloc();\n}\n\nint main() {\n void *p = 0;\n pthread_t t[2];\n pthread_create(&t[0], 0, AllocThread, 0);\n pthread_join(t[0], &p);\n print_address(\"addr=\", 1, p);\n pthread_create(&t[0], 0, Thread1, (char*)p + 16);\n pthread_create(&t[1], 0, Thread2, (char*)p + 16);\n pthread_join(t[0], 0);\n pthread_join(t[1], 0);\n return 0;\n}\n\n\/\/ CHECK: addr=[[ADDR:0x[0-9,a-f]+]]\n\/\/ CHECK: WARNING: ThreadSanitizer: data race\n\/\/ ...\n\/\/ CHECK: Location is heap block of size 99 at [[ADDR]] allocated by thread T1:\n\/\/ CHCEK: #0 malloc\n\/\/ CHECK: #{{1|2}} alloc\n\/\/ CHECK: #{{2|3}} AllocThread\n\/\/ ...\n\/\/ CHECK: Thread T1 (tid={{.*}}, finished) created by main thread at:\n\/\/ CHECK: #0 pthread_create\n\/\/ CHECK: #1 main\n<commit_msg>Fix typos in tests. NFC.<commit_after>\/\/ RUN: %clangxx_tsan -O1 %s -o %t && %deflake %run %t | FileCheck %s\n#include <pthread.h>\n#include <stdlib.h>\n#include <stdio.h>\n#include \"test.h\"\n\nvoid *Thread1(void *p) {\n *(int*)p = 42;\n return 0;\n}\n\nvoid *Thread2(void *p) {\n *(int*)p = 44;\n return 0;\n}\n\nvoid *alloc() {\n return malloc(99);\n}\n\nvoid *AllocThread(void* arg) {\n return alloc();\n}\n\nint main() {\n void *p = 0;\n pthread_t t[2];\n pthread_create(&t[0], 0, AllocThread, 0);\n pthread_join(t[0], &p);\n print_address(\"addr=\", 1, p);\n pthread_create(&t[0], 0, Thread1, (char*)p + 16);\n pthread_create(&t[1], 0, Thread2, (char*)p + 16);\n pthread_join(t[0], 0);\n pthread_join(t[1], 0);\n return 0;\n}\n\n\/\/ CHECK: addr=[[ADDR:0x[0-9,a-f]+]]\n\/\/ CHECK: WARNING: ThreadSanitizer: data race\n\/\/ ...\n\/\/ CHECK: Location is heap block of size 99 at [[ADDR]] allocated by thread T1:\n\/\/ CHECK: #0 malloc\n\/\/ CHECK: #{{1|2}} alloc\n\/\/ CHECK: #{{2|3}} AllocThread\n\/\/ ...\n\/\/ CHECK: Thread T1 (tid={{.*}}, finished) created by main thread at:\n\/\/ CHECK: #0 pthread_create\n\/\/ CHECK: #1 main\n<|endoftext|>"} {"text":"<commit_before>#include <babylon\/actions\/valueactions\/interpolate_value_action.h>\n\n#include <nlohmann\/json.hpp>\n\n#include <babylon\/actions\/action_manager.h>\n#include <babylon\/animations\/animation.h>\n#include <babylon\/animations\/animation_value.h>\n#include <babylon\/animations\/ianimatable.h>\n#include <babylon\/animations\/ianimation_key.h>\n#include <babylon\/audio\/sound.h>\n#include <babylon\/core\/logging.h>\n#include <babylon\/engines\/scene.h>\n\nnamespace BABYLON {\n\nInterpolateValueAction::InterpolateValueAction(unsigned int iTriggerOptions,\n const IAnimatablePtr& target,\n const std::string& iPropertyPath,\n AnimationValue* iValue, int iDuration,\n Condition* condition, bool iStopOtherAnimations,\n const std::function<void()>& iOnInterpolationDone)\n : Action(iTriggerOptions, condition)\n , propertyPath{iPropertyPath}\n , value{iValue}\n , duration{iDuration}\n , stopOtherAnimations{iStopOtherAnimations}\n , onInterpolationDone{iOnInterpolationDone}\n , _target{target}\n , _effectiveTarget{target}\n{\n}\n\nInterpolateValueAction::~InterpolateValueAction() = default;\n\nvoid InterpolateValueAction::_prepare()\n{\n _effectiveTarget = _getEffectiveTarget(_effectiveTarget, propertyPath);\n _property = _getProperty(propertyPath);\n}\n\nvoid InterpolateValueAction::execute(const IActionEventPtr& \/*evt*\/)\n{\n auto scene = _actionManager->getScene();\n std::vector<IAnimationKey> keys{IAnimationKey(0, _effectiveTarget->getProperty({_property})), \/\/\n IAnimationKey(100, *value)};\n\n auto dataType = value->animationType();\n if (!dataType.has_value()) {\n BABYLON_LOG_WARN(\"InterpolateValueAction\", \"InterpolateValueAction: Unsupported type\")\n }\n\n auto animation = Animation::New(\"InterpolateValueAction\", _property,\n static_cast<size_t>(100 * (1000.f \/ float(duration))),\n dataType.value(), Animation::ANIMATIONLOOPMODE_CONSTANT);\n\n animation->setKeys(keys);\n\n if (stopOtherAnimations) {\n scene->stopAnimation(_effectiveTarget);\n }\n\n const auto wrapper = [this]() {\n onInterpolationDoneObservable.notifyObservers(this);\n if (onInterpolationDone) {\n onInterpolationDone();\n }\n };\n\n scene->beginDirectAnimation(_effectiveTarget, {animation}, 0, 100, false, 1, wrapper);\n}\n\njson InterpolateValueAction::serialize(json& \/*parent*\/) const\n{\n return nullptr;\n}\n\n} \/\/ end of namespace BABYLON\n<commit_msg>const correctness<commit_after>#include <babylon\/actions\/valueactions\/interpolate_value_action.h>\n\n#include <nlohmann\/json.hpp>\n\n#include <babylon\/actions\/action_manager.h>\n#include <babylon\/animations\/animation.h>\n#include <babylon\/animations\/animation_value.h>\n#include <babylon\/animations\/ianimatable.h>\n#include <babylon\/animations\/ianimation_key.h>\n#include <babylon\/audio\/sound.h>\n#include <babylon\/core\/logging.h>\n#include <babylon\/engines\/scene.h>\n\nnamespace BABYLON {\n\nInterpolateValueAction::InterpolateValueAction(unsigned int iTriggerOptions,\n const IAnimatablePtr& target,\n const std::string& iPropertyPath,\n AnimationValue* iValue, int iDuration,\n Condition* condition, bool iStopOtherAnimations,\n const std::function<void()>& iOnInterpolationDone)\n : Action(iTriggerOptions, condition)\n , propertyPath{iPropertyPath}\n , value{iValue}\n , duration{iDuration}\n , stopOtherAnimations{iStopOtherAnimations}\n , onInterpolationDone{iOnInterpolationDone}\n , _target{target}\n , _effectiveTarget{target}\n{\n}\n\nInterpolateValueAction::~InterpolateValueAction() = default;\n\nvoid InterpolateValueAction::_prepare()\n{\n _effectiveTarget = _getEffectiveTarget(_effectiveTarget, propertyPath);\n _property = _getProperty(propertyPath);\n}\n\nvoid InterpolateValueAction::execute(const IActionEventPtr& \/*evt*\/)\n{\n const auto scene = _actionManager->getScene();\n std::vector<IAnimationKey> keys{IAnimationKey(0, _effectiveTarget->getProperty({_property})), \/\/\n IAnimationKey(100, *value)};\n\n const auto dataType = value->animationType();\n if (!dataType.has_value()) {\n BABYLON_LOG_WARN(\"InterpolateValueAction\", \"InterpolateValueAction: Unsupported type\")\n }\n\n const auto animation = Animation::New(\"InterpolateValueAction\", _property,\n static_cast<size_t>(100.f * (1000.f \/ float(duration))),\n dataType.value(), Animation::ANIMATIONLOOPMODE_CONSTANT);\n\n animation->setKeys(keys);\n\n if (stopOtherAnimations) {\n scene->stopAnimation(_effectiveTarget);\n }\n\n const auto wrapper = [this]() {\n onInterpolationDoneObservable.notifyObservers(this);\n if (onInterpolationDone) {\n onInterpolationDone();\n }\n };\n\n scene->beginDirectAnimation(_effectiveTarget, {animation}, 0, 100, false, 1, wrapper);\n}\n\njson InterpolateValueAction::serialize(json& \/*parent*\/) const\n{\n return nullptr;\n}\n\n} \/\/ end of namespace BABYLON\n<|endoftext|>"} {"text":"<commit_before>#include <agency\/future.hpp>\n#include <agency\/new_executor_traits.hpp>\n#include <iostream>\n#include <cassert>\n\n#include \"test_executors.hpp\"\n\ntemplate<class Executor>\nvoid test()\n{\n using executor_type = Executor;\n using traits = agency::new_executor_traits<executor_type>;\n\n {\n executor_type exec;\n\n auto void_future1 = traits::when_all(exec);\n auto void_future2 = traits::when_all(exec, void_future1);\n\n void_future2.get();\n assert(exec.valid());\n }\n\n {\n executor_type exec;\n\n auto int_ready = traits::template make_ready_future<int>(exec, 13);\n auto float_ready = traits::template make_ready_future<float>(exec, 7.f);\n\n auto int_float_fut = traits::when_all(exec, int_ready, float_ready);\n\n auto int_float = int_float_fut.get();\n\n assert(std::get<0>(int_float) == 13);\n assert(std::get<1>(int_float) == 7.f);\n assert(exec.valid());\n }\n\n {\n executor_type exec;\n\n auto int_ready = agency::detail::make_ready_future(13);\n auto void_ready = agency::detail::make_ready_future();\n auto float_ready = agency::detail::make_ready_future(7.f);\n\n auto int_float_fut = traits::when_all(exec, int_ready, void_ready, float_ready);\n\n auto int_float = int_float_fut.get();\n\n assert(std::get<0>(int_float) == 13);\n assert(std::get<1>(int_float) == 7.f);\n assert(exec.valid());\n }\n}\n\nint main()\n{\n using namespace test_executors;\n\n test<empty_executor>();\n test<single_agent_when_all_execute_and_select_executor>();\n test<multi_agent_when_all_execute_and_select_executor>();\n test<single_agent_then_execute_executor>();\n test<when_all_executor>();\n test<multi_agent_execute_returning_user_defined_container_executor>();\n test<multi_agent_execute_returning_default_container_executor>();\n\n std::cout << \"OK\" << std::endl;\n\n return 0;\n}\n\n<commit_msg>Test multi_agent_async_execute_executor_returning_user_specified_container_executor with test_when_all.cpp<commit_after>#include <agency\/future.hpp>\n#include <agency\/new_executor_traits.hpp>\n#include <iostream>\n#include <cassert>\n\n#include \"test_executors.hpp\"\n\ntemplate<class Executor>\nvoid test()\n{\n using executor_type = Executor;\n using traits = agency::new_executor_traits<executor_type>;\n\n {\n executor_type exec;\n\n auto void_future1 = traits::when_all(exec);\n auto void_future2 = traits::when_all(exec, void_future1);\n\n void_future2.get();\n assert(exec.valid());\n }\n\n {\n executor_type exec;\n\n auto int_ready = traits::template make_ready_future<int>(exec, 13);\n auto float_ready = traits::template make_ready_future<float>(exec, 7.f);\n\n auto int_float_fut = traits::when_all(exec, int_ready, float_ready);\n\n auto int_float = int_float_fut.get();\n\n assert(std::get<0>(int_float) == 13);\n assert(std::get<1>(int_float) == 7.f);\n assert(exec.valid());\n }\n\n {\n executor_type exec;\n\n auto int_ready = agency::detail::make_ready_future(13);\n auto void_ready = agency::detail::make_ready_future();\n auto float_ready = agency::detail::make_ready_future(7.f);\n\n auto int_float_fut = traits::when_all(exec, int_ready, void_ready, float_ready);\n\n auto int_float = int_float_fut.get();\n\n assert(std::get<0>(int_float) == 13);\n assert(std::get<1>(int_float) == 7.f);\n assert(exec.valid());\n }\n}\n\nint main()\n{\n using namespace test_executors;\n\n test<empty_executor>();\n test<single_agent_when_all_execute_and_select_executor>();\n test<multi_agent_when_all_execute_and_select_executor>();\n test<single_agent_then_execute_executor>();\n\n test<when_all_executor>();\n\n test<multi_agent_execute_returning_user_defined_container_executor>();\n test<multi_agent_execute_returning_default_container_executor>();\n test<multi_agent_execute_returning_void_executor>();\n\n test<multi_agent_async_execute_returning_user_defined_container_executor>();\n\n std::cout << \"OK\" << std::endl;\n\n return 0;\n}\n\n<|endoftext|>"} {"text":"<commit_before>\/\/ Filename: mayaToEgg.cxx\n\/\/ Created by: drose (15Feb00)\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 \"mayaToEgg.h\"\n#include \"mayaToEggConverter.h\"\n#include \"config_mayaegg.h\"\n#include \"config_maya.h\" \/\/ for maya_cat\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ Function: MayaToEgg::Constructor\n\/\/ Access: Public\n\/\/ Description:\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nMayaToEgg::\nMayaToEgg() :\n SomethingToEgg(\"Maya\", \".mb\")\n{\n add_path_replace_options();\n add_path_store_options();\n add_animation_options();\n add_units_options();\n add_normals_options();\n add_transform_options();\n\n set_program_description\n (\"This program converts Maya model files to egg. Nothing fancy yet.\");\n\n add_option\n (\"p\", \"\", 0,\n \"Generate polygon output only. Tesselate all NURBS surfaces to \"\n \"polygons via the built-in Maya tesselator. The tesselation will \"\n \"be based on the tolerance factor given by -ptol.\",\n &MayaToEgg::dispatch_none, &_polygon_output);\n\n add_option\n (\"ptol\", \"tolerance\", 0,\n \"Specify the fit tolerance for Maya polygon tesselation. The smaller \"\n \"the number, the more polygons will be generated. The default is \"\n \"0.01.\",\n &MayaToEgg::dispatch_double, NULL, &_polygon_tolerance);\n\n add_option\n (\"notrans\", \"\", 0,\n \"Don't convert explicit DAG transformations given in the Maya file. \"\n \"Instead, convert all vertices to world space and write the file as \"\n \"one big transform space. Using this option doesn't change the \"\n \"position of objects in the scene, just the number of explicit \"\n \"transforms appearing in the resulting egg file.\",\n &MayaToEgg::dispatch_none, &_ignore_transforms);\n\n add_option\n (\"v\", \"\", 0,\n \"Increase verbosity. More v's means more verbose.\",\n &MayaToEgg::dispatch_count, NULL, &_verbose);\n _verbose = 0;\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ Function: MayaToEgg::run\n\/\/ Access: Public\n\/\/ Description:\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nvoid MayaToEgg::\nrun() {\n \/\/ Set the verbose level by using Notify.\n if (_verbose >= 3) {\n maya_cat->set_severity(NS_spam);\n mayaegg_cat->set_severity(NS_spam);\n } else if (_verbose >= 2) {\n maya_cat->set_severity(NS_debug);\n mayaegg_cat->set_severity(NS_debug);\n } else if (_verbose >= 1) {\n maya_cat->set_severity(NS_info);\n mayaegg_cat->set_severity(NS_info);\n }\n\n \/\/ Let's open the output file before we initialize Maya, since Maya\n \/\/ now has a nasty habit of changing the current directory.\n get_output();\n\n nout << \"Initializing Maya.\\n\";\n MayaToEggConverter converter(_program_name);\n if (!converter.open_api()) {\n nout << \"Unable to initialize Maya.\\n\";\n exit(1);\n }\n\n \/\/ Copy in the command-line parameters.\n converter._polygon_output = _polygon_output;\n converter._polygon_tolerance = _polygon_tolerance;\n converter._ignore_transforms = _ignore_transforms;\n\n \/\/ Copy in the path and animation parameters.\n apply_parameters(converter);\n\n \/\/ Set the coordinate system to match Maya's.\n if (!_got_coordinate_system) {\n _coordinate_system = converter._maya->get_coordinate_system();\n }\n _data.set_coordinate_system(_coordinate_system);\n\n \/\/ Get the units from the Maya file, if the user didn't override.\n if (_input_units == DU_invalid) {\n _input_units = converter._maya->get_units();\n }\n\n converter.set_egg_data(&_data, false);\n apply_parameters(converter);\n\n if (!converter.convert_file(_input_filename)) {\n nout << \"Errors in conversion.\\n\";\n exit(1);\n }\n\n write_egg_file();\n nout << \"\\n\";\n}\n\n\nint main(int argc, char *argv[]) {\n MayaToEgg prog;\n prog.parse_command_line(argc, argv);\n prog.run();\n return 0;\n}\n<commit_msg>update comment<commit_after>\/\/ Filename: mayaToEgg.cxx\n\/\/ Created by: drose (15Feb00)\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 \"mayaToEgg.h\"\n#include \"mayaToEggConverter.h\"\n#include \"config_mayaegg.h\"\n#include \"config_maya.h\" \/\/ for maya_cat\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ Function: MayaToEgg::Constructor\n\/\/ Access: Public\n\/\/ Description:\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nMayaToEgg::\nMayaToEgg() :\n SomethingToEgg(\"Maya\", \".mb\")\n{\n add_path_replace_options();\n add_path_store_options();\n add_animation_options();\n add_units_options();\n add_normals_options();\n add_transform_options();\n\n set_program_description\n (\"This program converts Maya model files to egg. Nothing fancy yet.\");\n\n add_option\n (\"p\", \"\", 0,\n \"Generate polygon output only. Tesselate all NURBS surfaces to \"\n \"polygons via the built-in Maya tesselator. The tesselation will \"\n \"be based on the tolerance factor given by -ptol.\",\n &MayaToEgg::dispatch_none, &_polygon_output);\n\n add_option\n (\"ptol\", \"tolerance\", 0,\n \"Specify the fit tolerance for Maya polygon tesselation. The smaller \"\n \"the number, the more polygons will be generated. The default is \"\n \"0.01.\",\n &MayaToEgg::dispatch_double, NULL, &_polygon_tolerance);\n\n add_option\n (\"notrans\", \"\", 0,\n \"Don't convert explicit DAG transformations given in the Maya file. \"\n \"Instead, convert all vertices to world space and write the file as \"\n \"one big transform space. Using this option doesn't change the \"\n \"position of objects in the scene, just the number of explicit \"\n \"transforms appearing in the resulting egg file.\",\n &MayaToEgg::dispatch_none, &_ignore_transforms);\n\n add_option\n (\"v\", \"\", 0,\n \"Increase verbosity. More v's means more verbose.\",\n &MayaToEgg::dispatch_count, NULL, &_verbose);\n _verbose = 0;\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ Function: MayaToEgg::run\n\/\/ Access: Public\n\/\/ Description:\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nvoid MayaToEgg::\nrun() {\n \/\/ Set the verbose level by using Notify.\n if (_verbose >= 3) {\n maya_cat->set_severity(NS_spam);\n mayaegg_cat->set_severity(NS_spam);\n } else if (_verbose >= 2) {\n maya_cat->set_severity(NS_debug);\n mayaegg_cat->set_severity(NS_debug);\n } else if (_verbose >= 1) {\n maya_cat->set_severity(NS_info);\n mayaegg_cat->set_severity(NS_info);\n }\n\n \/\/ Let's open the output file before we initialize Maya, since Maya\n \/\/ now has a nasty habit of changing the current directory.\n get_output();\n\n nout << \"Initializing Maya.\\n\";\n MayaToEggConverter converter(_program_name);\n if (!converter.open_api()) {\n nout << \"Unable to initialize Maya.\\n\";\n exit(1);\n }\n\n \/\/ Copy in the command-line parameters.\n converter._polygon_output = _polygon_output;\n converter._polygon_tolerance = _polygon_tolerance;\n converter._ignore_transforms = _ignore_transforms;\n\n \/\/ Copy in the path and animation parameters.\n apply_parameters(converter);\n\n \/\/ Set the coordinate system to match Maya's.\n if (!_got_coordinate_system) {\n _coordinate_system = converter._maya->get_coordinate_system();\n }\n _data.set_coordinate_system(_coordinate_system);\n\n \/\/ Use the standard Maya units, if the user didn't specify\n \/\/ otherwise. This always returns centimeters, which is the way all\n \/\/ Maya files are stored internally (and is the units returned by\n \/\/ all of the API functions called here).\n if (_input_units == DU_invalid) {\n _input_units = converter._maya->get_units();\n }\n\n converter.set_egg_data(&_data, false);\n apply_parameters(converter);\n\n if (!converter.convert_file(_input_filename)) {\n nout << \"Errors in conversion.\\n\";\n exit(1);\n }\n\n write_egg_file();\n nout << \"\\n\";\n}\n\n\nint main(int argc, char *argv[]) {\n MayaToEgg prog;\n prog.parse_command_line(argc, argv);\n prog.run();\n return 0;\n}\n<|endoftext|>"} {"text":"<commit_before>#ifdef COSMOLOGY\n\n#include <iostream>\n#include <fstream>\n#include \"cosmology.h\"\n#include \"..\/io.h\"\n\nusing namespace std;\n\n\nvoid Cosmology::Load_Scale_Outputs( struct parameters *P ) {\n\n char filename_1[100];\n \/\/ create the filename to read from\n strcpy(filename_1, P->scale_outputs_file);\n chprintf( \" Loading Scale_Factor Outpus: %s\\n\", filename_1);\n \n ifstream file_out ( filename_1 );\n string line;\n Real a_value;\n if (file_out.is_open()){\n while ( getline (file_out,line) ){\n a_value = atof( line.c_str() );\n scale_outputs.push_back( a_value );\n n_outputs += 1;\n \/\/ chprintf(\"%f\\n\", a_value);\n }\n file_out.close();\n n_outputs = scale_outputs.size();\n next_output_indx = 0;\n chprintf(\" Loaded %d scale outputs \\n\", n_outputs);\n }\n else{\n chprintf(\" Error: Unable to open cosmology outputs file\\n\");\n exit(1);\n }\n \n chprintf(\" Setting next snapshot output\\n\");\n \n int scale_indx = next_output_indx;\n a_value = scale_outputs[scale_indx];\n \n while ( (current_a - a_value) > 1e-3 ){\n \/\/ chprintf( \"%f %f\\n\", a_value, current_a);\n scale_indx += 1;\n a_value = scale_outputs[scale_indx];\n }\n next_output_indx = scale_indx;\n next_output = a_value;\n chprintf(\" Next output index: %d \\n\", next_output_indx );\n chprintf(\" Next output z value: %f \\n\", 1.\/next_output - 1 );\n \n exit_now = false;\n \n}\n\nvoid Cosmology::Set_Scale_Outputs( struct parameters *P ){\n \n if ( P->scale_outputs_file[0] == '\\0' ){\n chprintf( \" Output every %d timesteps.\\n\", P->n_steps_output );\n Real scale_end = 1 \/ ( P->End_redshift + 1);\n scale_outputs.push_back( current_a );\n scale_outputs.push_back( scale_end ); \n n_outputs = scale_outputs.size();\n next_output_indx = 0;\n next_output = current_a;\n chprintf(\" Next output index: %d \\n\", next_output_indx );\n chprintf(\" Next output z value: %f \\n\", 1.\/next_output - 1 );\n }\n else Load_Scale_Outputs( P );\n \n\n \n}\n\n\nvoid Cosmology::Set_Next_Scale_Output( ){\n \n chprintf(\"Setting next output index. Current index: %d n_outputs: %d \", scale_indx, n_outputs);\n\n int scale_indx = next_output_indx;\n Real a_value = scale_outputs[scale_indx];\n if ( ( scale_indx == 0 ) && ( abs(a_value - current_a )<1e-5 ) )scale_indx = 1;\n else scale_indx += 1;\n if ( scale_indx < n_outputs ){\n a_value = scale_outputs[scale_indx];\n next_output_indx = scale_indx;\n next_output = a_value;\n }\n else{\n exit_now = true;\n }\n}\n\n\n#endif<commit_msg>fixed<commit_after>#ifdef COSMOLOGY\n\n#include <iostream>\n#include <fstream>\n#include \"cosmology.h\"\n#include \"..\/io.h\"\n\nusing namespace std;\n\n\nvoid Cosmology::Load_Scale_Outputs( struct parameters *P ) {\n\n char filename_1[100];\n \/\/ create the filename to read from\n strcpy(filename_1, P->scale_outputs_file);\n chprintf( \" Loading Scale_Factor Outpus: %s\\n\", filename_1);\n \n ifstream file_out ( filename_1 );\n string line;\n Real a_value;\n if (file_out.is_open()){\n while ( getline (file_out,line) ){\n a_value = atof( line.c_str() );\n scale_outputs.push_back( a_value );\n n_outputs += 1;\n \/\/ chprintf(\"%f\\n\", a_value);\n }\n file_out.close();\n n_outputs = scale_outputs.size();\n next_output_indx = 0;\n chprintf(\" Loaded %d scale outputs \\n\", n_outputs);\n }\n else{\n chprintf(\" Error: Unable to open cosmology outputs file\\n\");\n exit(1);\n }\n \n chprintf(\" Setting next snapshot output\\n\");\n \n int scale_indx = next_output_indx;\n a_value = scale_outputs[scale_indx];\n \n while ( (current_a - a_value) > 1e-3 ){\n \/\/ chprintf( \"%f %f\\n\", a_value, current_a);\n scale_indx += 1;\n a_value = scale_outputs[scale_indx];\n }\n next_output_indx = scale_indx;\n next_output = a_value;\n chprintf(\" Next output index: %d \\n\", next_output_indx );\n chprintf(\" Next output z value: %f \\n\", 1.\/next_output - 1 );\n \n exit_now = false;\n \n}\n\nvoid Cosmology::Set_Scale_Outputs( struct parameters *P ){\n \n if ( P->scale_outputs_file[0] == '\\0' ){\n chprintf( \" Output every %d timesteps.\\n\", P->n_steps_output );\n Real scale_end = 1 \/ ( P->End_redshift + 1);\n scale_outputs.push_back( current_a );\n scale_outputs.push_back( scale_end ); \n n_outputs = scale_outputs.size();\n next_output_indx = 0;\n next_output = current_a;\n chprintf(\" Next output index: %d \\n\", next_output_indx );\n chprintf(\" Next output z value: %f \\n\", 1.\/next_output - 1 );\n }\n else Load_Scale_Outputs( P );\n \n\n \n}\n\n\nvoid Cosmology::Set_Next_Scale_Output( ){\n \n\n int scale_indx = next_output_indx;\n Real a_value = scale_outputs[scale_indx];\n chprintf(\"Setting next output index. Current index: %d n_outputs: %d \", scale_indx, n_outputs);\n \n if ( ( scale_indx == 0 ) && ( abs(a_value - current_a )<1e-5 ) )scale_indx = 1;\n else scale_indx += 1;\n if ( scale_indx < n_outputs ){\n a_value = scale_outputs[scale_indx];\n next_output_indx = scale_indx;\n next_output = a_value;\n }\n else{\n exit_now = true;\n }\n}\n\n\n#endif<|endoftext|>"} {"text":"<commit_before>\/*! \\brief serial_controller_node.\n * Manages serial communications with AVR-Master.\n *\n * This node manages serial communications with the AVR-Master.\n * Therefore it first requests all data from AVR-Master and then sends all\n * commands to AVR-Master in a Loop. Data read is stored in md49_data.txt,\n * commands to be send are read from md49_commands.txt.\n *\n *\/\n\n\/\/ Includes\n\/\/ *********************************************************\n#include <iostream> \/* allows to perform standard input and output operations *\/\n#include <fstream> \/* Input\/output stream class to operate on files. *\/\n#include <stdio.h> \/* Standard input\/output definitions *\/\n#include <stdint.h> \/* Standard input\/output definitions *\/\n#include <stdlib.h> \/* defines several general purpose functions *\/\n#include <unistd.h> \/* UNIX standard function definitions *\/\n#include <fcntl.h> \/* File control definitions *\/\n#include <errno.h> \/* Error number definitions *\/\n#include <termios.h> \/* POSIX terminal control definitions *\/\n#include <ctype.h> \/* isxxx() *\/\n\/\/#include<ros\/ros.h>\n#include <sqlite3.h>\n\nstatic int callback(void *NotUsed, int argc, char **argv, char **azColName){\n int i;\n for(i=0; i<argc; i++){\n printf(\"%s = %s\\n\", azColName[i], argv[i] ? argv[i] : \"NULL\");\n }\n printf(\"\\n\");\n return 0;\n}\n\n\/\/ Global variables\nconst char* serialport_name=\"\/dev\/ttyS2\"; \/* defines used serialport on BPi. Use \"\/dev\/ttyAMA0\" for RPi*\/\nint serialport_bps=B38400; \/* defines used baudrate on serialport *\/\n\/\/int filedesc; \/* File descriptor of serial port we will talk to*\/\nint fd; \/* serial port file descriptor *\/\nint32_t EncoderL; \/* stores encoder value left read from md49 *\/\nint32_t EncoderR; \/* stores encoder value right read from md49 *\/\nunsigned char speed_l=128, speed_r=128; \/* speed to set for MD49 *\/\nunsigned char last_speed_l=128, last_speed_r=128; \/* speed to set for MD49 *\/\nunsigned char serialBuffer[16]; \/* Serial buffer to store uart data *\/\nunsigned char md49_data[18]; \/* keeps data from MD49, read from AVR-Master *\/\nstruct termios orig; \/\/ Port options\n\nusing namespace std;\n\n\/\/ Declare functions\n\/\/ *********************************************************\nint openSerialPort(const char * device, int bps);\nvoid writeBytes(int descriptor, int count);\nvoid readBytes(int descriptor, int count);\nvoid read_MD49_Data_serial (void);\nvoid read_md49_commands_txt(void);\nvoid set_MD49_speed (unsigned char speed_l, unsigned char speed_r);\nchar* itoa(int value, char* result, int base);\n\n\nint main( int argc, char* argv[] ){\n\n \/\/ Open database md49.db and\n \/\/ **************************\n sqlite3 *db;\n char *zErrMsg = 0;\n int rc;\n const char *sql;\n\n rc = sqlite3_open(\"md49data.db\", &db);\n if( rc ){\n fprintf(stderr, \"Can't open database: %s\\n\", sqlite3_errmsg(db));\n exit(0);\n }else{\n fprintf(stdout, \"Opened database successfully\\n\");\n }\n\n \/\/ Create table md49data\n \/\/ *********************\n sql = \"CREATE TABLE md49data(\" \\\n \"ID INT PRIMARY KEY NOT NULL,\" \\\n \"Encoderbyte1L INT,\" \\\n \"Encoderbyte2L INT,\" \\\n \"Encoderbyte3L INT,\" \\\n \"Encoderbyte4L INT,\" \\\n \"Encoderbyte1R INT,\" \\\n \"Encoderbyte2R INT,\" \\\n \"Encoderbyte3R INT,\" \\\n \"Encoderbyte4R INT,\" \\\n \"SpeedL INT,\" \\\n \"SpeedR INT,\" \\\n \"Volts INT,\" \\\n \"CurrentL INT,\" \\\n \"CurrentR INT,\" \\\n \"Error INT,\" \\\n \"Acceleration INT,\" \\\n \"Mode INT,\" \\\n \"Regulator INT,\" \\\n \"Timeout INT );\";\n\n \/* Execute SQL statement *\/\n rc = sqlite3_exec(db, sql, callback, 0, &zErrMsg);\n if( rc != SQLITE_OK ){\n fprintf(stderr, \"SQL error: %s\\n\", zErrMsg);\n sqlite3_free(zErrMsg);\n }else{\n fprintf(stdout, \"Table created successfully\\n\");\n }\n sqlite3_close(db);\n\n\n\n \/\/ Init as ROS node\n \/\/ ****************\n \/\/ros::init(argc, argv, \"serial_controller\");\n \/\/ros::NodeHandle n;\n\n \/\/ Open serial port\n \/\/ ****************\n fd = openSerialPort(serialport_name, serialport_bps);\n if (fd == -1) exit(1);\n \/\/ROS_INFO(\"Opend serial port at %s with %i Bps\",serialport_name,serialport_bps);\n usleep(10000); \/\/ Sleep for UART to power up and set options\n\n \/\/ROS_DEBUG(\"Starting Mainloop...\");\n \/\/ROS_DEBUG(\"reading data from MD49 and pushing commands to MD49 @ 5Hz...\");\n\n \/\/while( n.ok() ){\n while( 1 ){\n \/\/ Read encoder and other data from MD49\n \/\/ serial. Data ist stored in md49_data.txt\n \/\/ ****************************************\n read_MD49_Data_serial();\n usleep(100000);\n\n \/\/ Read commands from md49_commands.txt:\n \/\/ *************************************\n read_md49_commands_txt();\n\n \/\/ Set speed and other commands as\n \/\/ read from md49_commands.txt\n \/\/ *******************************\n set_MD49_speed(speed_l, speed_r);\n usleep(100000);\n\n }\/\/ end.mainloop\n return 1;\n} \/\/ end.main\n\nvoid read_MD49_Data_serial (void){\n \/\/ Read serial MD49 data from AVR-Master\n \/\/ *************************************\n serialBuffer[0] = 82; \/\/ 82=R Steuerbyte um alle Daten vom MD49 zu lesen\n writeBytes(fd, 1);\n readBytes(fd, 18); \n\n \/\/ Put toghether encoder values from their\n \/\/ corresponding bytes, read from MD49\n \/\/ ***************************************\n EncoderL = serialBuffer[0] << 24; \/\/ Put together first encoder value\n EncoderL |= (serialBuffer[1] << 16);\n EncoderL |= (serialBuffer[2] << 8);\n EncoderL |= (serialBuffer[3]);\n EncoderR = serialBuffer[4] << 24; \/\/ Put together second encoder value\n EncoderR |= (serialBuffer[5] << 16);\n EncoderR |= (serialBuffer[6] << 8);\n EncoderR |= (serialBuffer[7]);\n\n \/\/ Write data from MD49 into md49_data.txt\n \/\/ ***************************************\n int i=0;\n char buffer[33];\n ofstream myfile;\n myfile.open (\"md49_data.txt\");\n \/\/myfile << \"Writing this to a file.\\n\";\n for (i=0;i<18;i++){\n if (serialBuffer[i]==0){\n myfile << \"000\";\n }\n else if (serialBuffer[i]<10){\n myfile << \"00\";\n myfile << itoa(serialBuffer[i],buffer,10);\n }\n else if (serialBuffer[i]<100){\n myfile << \"0\";\n myfile << itoa(serialBuffer[i],buffer,10);\n }\n else{\n myfile << itoa(serialBuffer[i],buffer,10);\n }\n myfile << \"\\n\";\n }\n myfile.close();\n\n \/\/ Output MD49 data on screen\n \/\/ **************************\n printf(\"\\033[2J\"); \/* clear the screen *\/\n printf(\"\\033[H\"); \/* position cursor at top-left corner *\/\n printf (\"MD49-Data read from AVR-Master: \\n\");\n printf(\"========================================\\n\");\n printf(\"Encoder1 Byte1: %i \",serialBuffer[0]);\n printf(\"Byte2: %i \",serialBuffer[1]);\n printf(\"Byte3: % i \",serialBuffer[2]);\n printf(\"Byte4: %i \\n\",serialBuffer[3]);\n printf(\"Encoder2 Byte1: %i \",serialBuffer[4]);\n printf(\"Byte2: %i \",serialBuffer[5]);\n printf(\"Byte3: %i \",serialBuffer[6]);\n printf(\"Byte4: %i \\n\",serialBuffer[7]);\n printf(\"EncoderL: %i \",EncoderL);\n printf(\"EncoderR: %i \\n\",EncoderR);\n printf(\"========================================\\n\");\n printf(\"Speed1: %i \",serialBuffer[8]);\n printf(\"Speed2: %i \\n\",serialBuffer[9]);\n printf(\"Volts: %i \\n\",serialBuffer[10]);\n printf(\"Current1: %i \",serialBuffer[11]);\n printf(\"Current2: %i \\n\",serialBuffer[12]);\n printf(\"Error: %i \\n\",serialBuffer[13]);\n printf(\"Acceleration: %i \\n\",serialBuffer[14]);\n printf(\"Mode: %i \\n\",serialBuffer[15]);\n printf(\"Regulator: %i \\n\",serialBuffer[16]);\n printf(\"Timeout: %i \\n\",serialBuffer[17]);\n\n\n}\n\nvoid set_MD49_speed (unsigned char speed_l, unsigned char speed_r){\n serialBuffer[0] = 88; \/\/ 88 =X Steuerbyte um Commands an MD49 zu senden\n serialBuffer[1] = 115; \/\/ 115=s Steuerbyte setSpeed\n serialBuffer[2] = speed_l; \/\/ set speed1\n serialBuffer[3] = speed_r; \/\/ set speed2\n writeBytes(fd, 4);\n}\n\nvoid read_md49_commands_txt(void){\n string line;\n ifstream myfile (\"md49_commands.txt\");\n if (myfile.is_open())\n {\n int i=0;\n while ( getline (myfile,line) )\n {\n \/\/cout << line << '\\n';\n char data[10];\n std::copy(line.begin(), line.end(), data);\n md49_data[i]=atoi(data);\n i =i++;\n }\n myfile.close();\n speed_l=md49_data[0];\n speed_r=md49_data[1];\n }\n else cout << \"Unable to open file\";\n}\n\nint openSerialPort(const char * device, int bps){\n struct termios neu;\n char buf[128];\n\n \/\/fd = open(device, O_RDWR | O_NOCTTY | O_NDELAY | O_NONBLOCK);\n fd = open(device, O_RDWR | O_NOCTTY);\n\n if (fd == -1)\n {\n sprintf(buf, \"openSerialPort %s error\", device);\n perror(buf);\n }\n else\n {\n tcgetattr(fd, &orig); \/* save current serial settings *\/\n tcgetattr(fd, &neu);\n cfmakeraw(&neu);\n cfsetispeed(&neu, bps);\n cfsetospeed(&neu, bps);\n tcflush(fd, TCIFLUSH);\n tcsetattr(fd, TCSANOW, &neu); \/* set new serial settings *\/\n fcntl (fd, F_SETFL, O_RDWR);\n }\n return fd;\n}\n\nvoid writeBytes(int descriptor, int count) {\n if ((write(descriptor, serialBuffer, count)) == -1) { \/\/ Send data out\n perror(\"Error writing\");\n close(descriptor); \/\/ Close port if there is an error\n exit(1);\n }\n\n}\n\nvoid readBytes(int descriptor, int count) {\n if (read(descriptor, serialBuffer, count) == -1) { \/\/ Read back data into buf[]\n perror(\"Error reading \");\n close(descriptor); \/\/ Close port if there is an error\n exit(1);\n }\n}\n\nchar* itoa(int value, char* result, int base) {\n \/\/ check that the base if valid\n if (base < 2 || base > 36) { *result = '\\0'; return result; }\n\n char* ptr = result, *ptr1 = result, tmp_char;\n int tmp_value;\n\n do {\n tmp_value = value;\n value \/= base;\n *ptr++ = \"zyxwvutsrqponmlkjihgfedcba9876543210123456789abcdefghijklmnopqrstuvwxyz\" [35 + (tmp_value - value * base)];\n } while ( value );\n\n \/\/ Apply negative sign\n if (tmp_value < 0) *ptr++ = '-';\n *ptr-- = '\\0';\n while(ptr1 < ptr) {\n tmp_char = *ptr;\n *ptr--= *ptr1;\n *ptr1++ = tmp_char;\n }\n return result;\n }\n<commit_msg>Update code<commit_after>\/*! \\brief serial_controller_node.\n * Manages serial communications with AVR-Master.\n *\n * This node manages serial communications with the AVR-Master.\n * Therefore it first requests all data from AVR-Master and then sends all\n * commands to AVR-Master in a Loop. Data read is stored in md49_data.txt,\n * commands to be send are read from md49_commands.txt.\n *\n *\/\n\n\/\/ Includes\n\/\/ *********************************************************\n#include <iostream> \/* allows to perform standard input and output operations *\/\n#include <fstream> \/* Input\/output stream class to operate on files. *\/\n#include <stdio.h> \/* Standard input\/output definitions *\/\n#include <stdint.h> \/* Standard input\/output definitions *\/\n#include <stdlib.h> \/* defines several general purpose functions *\/\n#include <unistd.h> \/* UNIX standard function definitions *\/\n#include <fcntl.h> \/* File control definitions *\/\n#include <errno.h> \/* Error number definitions *\/\n#include <termios.h> \/* POSIX terminal control definitions *\/\n#include <ctype.h> \/* isxxx() *\/\n\/\/#include<ros\/ros.h>\n#include <sqlite3.h>\n\nstatic int callback(void *NotUsed, int argc, char **argv, char **azColName){\n int i;\n for(i=0; i<argc; i++){\n printf(\"%s = %s\\n\", azColName[i], argv[i] ? argv[i] : \"NULL\");\n }\n printf(\"\\n\");\n return 0;\n}\n\n\/\/ Global variables\nconst char* serialport_name=\"\/dev\/ttyS2\"; \/* defines used serialport on BPi. Use \"\/dev\/ttyAMA0\" for RPi*\/\nint serialport_bps=B38400; \/* defines used baudrate on serialport *\/\n\/\/int filedesc; \/* File descriptor of serial port we will talk to*\/\nint fd; \/* serial port file descriptor *\/\nint32_t EncoderL; \/* stores encoder value left read from md49 *\/\nint32_t EncoderR; \/* stores encoder value right read from md49 *\/\nunsigned char speed_l=128, speed_r=128; \/* speed to set for MD49 *\/\nunsigned char last_speed_l=128, last_speed_r=128; \/* speed to set for MD49 *\/\nunsigned char serialBuffer[16]; \/* Serial buffer to store uart data *\/\nunsigned char md49_data[18]; \/* keeps data from MD49, read from AVR-Master *\/\nstruct termios orig; \/\/ Port options\n\nusing namespace std;\n\n\/\/ Declare functions\n\/\/ *********************************************************\nint openSerialPort(const char * device, int bps);\nvoid writeBytes(int descriptor, int count);\nvoid readBytes(int descriptor, int count);\nvoid read_MD49_Data_serial (void);\nvoid read_md49_commands_txt(void);\nvoid set_MD49_speed (unsigned char speed_l, unsigned char speed_r);\nchar* itoa(int value, char* result, int base);\n\n\nint main( int argc, char* argv[] ){\n\n \/\/ Open database md49.db and\n \/\/ **************************\n sqlite3 *db;\n char *zErrMsg = 0;\n int rc;\n const char *sql;\n\n rc = sqlite3_open(\"md49data.db\", &db);\n if( rc ){\n fprintf(stderr, \"Can't open database: %s\\n\", sqlite3_errmsg(db));\n exit(0);\n }else{\n fprintf(stdout, \"Opened database successfully\\n\");\n }\n\n \/\/ Create table md49data\n \/\/ *********************\n sql = \"CREATE TABLE md49data(\" \\\n \"ID INT PRIMARY KEY NOT NULL,\" \\\n \"Encoderbyte1L INT DEFAULT 0,\" \\\n \"Encoderbyte2L INT DEFAULT 0,\" \\\n \"Encoderbyte3L INT DEFAULT 0,\" \\\n \"Encoderbyte4L INT DEFAULT 0,\" \\\n \"Encoderbyte1R INT DEFAULT 0,\" \\\n \"Encoderbyte2R INT DEFAULT 0,\" \\\n \"Encoderbyte3R INT DEFAULT 0,\" \\\n \"Encoderbyte4R INT DEFAULT 0,\" \\\n \"SpeedL INT DEFAULT 128,\" \\\n \"SpeedR INT DEFAULT 128,\" \\\n \"Volts INT DEFAULT 0,\" \\\n \"CurrentL INT DEFAULT 0,\" \\\n \"CurrentR INT DEFAULT 0,\" \\\n \"Error INT DEFAULT 0,\" \\\n \"Acceleration INT DEFAULT 5,\" \\\n \"Mode INT DEFAULT 0,\" \\\n \"Regulator INT DEFAULT 1,\" \\\n \"Timeout INT DEFAULT 1 );\";\n\n \/* Execute SQL statement *\/\n rc = sqlite3_exec(db, sql, callback, 0, &zErrMsg);\n if( rc != SQLITE_OK ){\n fprintf(stderr, \"SQL error: %s\\n\", zErrMsg);\n sqlite3_free(zErrMsg);\n }else{\n fprintf(stdout, \"Table created successfully\\n\");\n }\n sqlite3_close(db);\n\n\n\n \/\/ Init as ROS node\n \/\/ ****************\n \/\/ros::init(argc, argv, \"serial_controller\");\n \/\/ros::NodeHandle n;\n\n \/\/ Open serial port\n \/\/ ****************\n fd = openSerialPort(serialport_name, serialport_bps);\n if (fd == -1) exit(1);\n \/\/ROS_INFO(\"Opend serial port at %s with %i Bps\",serialport_name,serialport_bps);\n usleep(10000); \/\/ Sleep for UART to power up and set options\n\n \/\/ROS_DEBUG(\"Starting Mainloop...\");\n \/\/ROS_DEBUG(\"reading data from MD49 and pushing commands to MD49 @ 5Hz...\");\n\n \/\/while( n.ok() ){\n while( 1 ){\n \/\/ Read encoder and other data from MD49\n \/\/ serial. Data ist stored in md49_data.txt\n \/\/ ****************************************\n read_MD49_Data_serial();\n usleep(100000);\n\n \/\/ Read commands from md49_commands.txt:\n \/\/ *************************************\n read_md49_commands_txt();\n\n \/\/ Set speed and other commands as\n \/\/ read from md49_commands.txt\n \/\/ *******************************\n set_MD49_speed(speed_l, speed_r);\n usleep(100000);\n\n }\/\/ end.mainloop\n return 1;\n} \/\/ end.main\n\nvoid read_MD49_Data_serial (void){\n \/\/ Read serial MD49 data from AVR-Master\n \/\/ *************************************\n serialBuffer[0] = 82; \/\/ 82=R Steuerbyte um alle Daten vom MD49 zu lesen\n writeBytes(fd, 1);\n readBytes(fd, 18); \n\n \/\/ Put toghether encoder values from their\n \/\/ corresponding bytes, read from MD49\n \/\/ ***************************************\n EncoderL = serialBuffer[0] << 24; \/\/ Put together first encoder value\n EncoderL |= (serialBuffer[1] << 16);\n EncoderL |= (serialBuffer[2] << 8);\n EncoderL |= (serialBuffer[3]);\n EncoderR = serialBuffer[4] << 24; \/\/ Put together second encoder value\n EncoderR |= (serialBuffer[5] << 16);\n EncoderR |= (serialBuffer[6] << 8);\n EncoderR |= (serialBuffer[7]);\n\n \/\/ Write data from MD49 into md49_data.txt\n \/\/ ***************************************\n int i=0;\n char buffer[33];\n ofstream myfile;\n myfile.open (\"md49_data.txt\");\n \/\/myfile << \"Writing this to a file.\\n\";\n for (i=0;i<18;i++){\n if (serialBuffer[i]==0){\n myfile << \"000\";\n }\n else if (serialBuffer[i]<10){\n myfile << \"00\";\n myfile << itoa(serialBuffer[i],buffer,10);\n }\n else if (serialBuffer[i]<100){\n myfile << \"0\";\n myfile << itoa(serialBuffer[i],buffer,10);\n }\n else{\n myfile << itoa(serialBuffer[i],buffer,10);\n }\n myfile << \"\\n\";\n }\n myfile.close();\n\n \/\/ Output MD49 data on screen\n \/\/ **************************\n printf(\"\\033[2J\"); \/* clear the screen *\/\n printf(\"\\033[H\"); \/* position cursor at top-left corner *\/\n printf (\"MD49-Data read from AVR-Master: \\n\");\n printf(\"========================================\\n\");\n printf(\"Encoder1 Byte1: %i \",serialBuffer[0]);\n printf(\"Byte2: %i \",serialBuffer[1]);\n printf(\"Byte3: % i \",serialBuffer[2]);\n printf(\"Byte4: %i \\n\",serialBuffer[3]);\n printf(\"Encoder2 Byte1: %i \",serialBuffer[4]);\n printf(\"Byte2: %i \",serialBuffer[5]);\n printf(\"Byte3: %i \",serialBuffer[6]);\n printf(\"Byte4: %i \\n\",serialBuffer[7]);\n printf(\"EncoderL: %i \",EncoderL);\n printf(\"EncoderR: %i \\n\",EncoderR);\n printf(\"========================================\\n\");\n printf(\"Speed1: %i \",serialBuffer[8]);\n printf(\"Speed2: %i \\n\",serialBuffer[9]);\n printf(\"Volts: %i \\n\",serialBuffer[10]);\n printf(\"Current1: %i \",serialBuffer[11]);\n printf(\"Current2: %i \\n\",serialBuffer[12]);\n printf(\"Error: %i \\n\",serialBuffer[13]);\n printf(\"Acceleration: %i \\n\",serialBuffer[14]);\n printf(\"Mode: %i \\n\",serialBuffer[15]);\n printf(\"Regulator: %i \\n\",serialBuffer[16]);\n printf(\"Timeout: %i \\n\",serialBuffer[17]);\n\n\n}\n\nvoid set_MD49_speed (unsigned char speed_l, unsigned char speed_r){\n serialBuffer[0] = 88; \/\/ 88 =X Steuerbyte um Commands an MD49 zu senden\n serialBuffer[1] = 115; \/\/ 115=s Steuerbyte setSpeed\n serialBuffer[2] = speed_l; \/\/ set speed1\n serialBuffer[3] = speed_r; \/\/ set speed2\n writeBytes(fd, 4);\n}\n\nvoid read_md49_commands_txt(void){\n string line;\n ifstream myfile (\"md49_commands.txt\");\n if (myfile.is_open())\n {\n int i=0;\n while ( getline (myfile,line) )\n {\n \/\/cout << line << '\\n';\n char data[10];\n std::copy(line.begin(), line.end(), data);\n md49_data[i]=atoi(data);\n i =i++;\n }\n myfile.close();\n speed_l=md49_data[0];\n speed_r=md49_data[1];\n }\n else cout << \"Unable to open file\";\n}\n\nint openSerialPort(const char * device, int bps){\n struct termios neu;\n char buf[128];\n\n \/\/fd = open(device, O_RDWR | O_NOCTTY | O_NDELAY | O_NONBLOCK);\n fd = open(device, O_RDWR | O_NOCTTY);\n\n if (fd == -1)\n {\n sprintf(buf, \"openSerialPort %s error\", device);\n perror(buf);\n }\n else\n {\n tcgetattr(fd, &orig); \/* save current serial settings *\/\n tcgetattr(fd, &neu);\n cfmakeraw(&neu);\n cfsetispeed(&neu, bps);\n cfsetospeed(&neu, bps);\n tcflush(fd, TCIFLUSH);\n tcsetattr(fd, TCSANOW, &neu); \/* set new serial settings *\/\n fcntl (fd, F_SETFL, O_RDWR);\n }\n return fd;\n}\n\nvoid writeBytes(int descriptor, int count) {\n if ((write(descriptor, serialBuffer, count)) == -1) { \/\/ Send data out\n perror(\"Error writing\");\n close(descriptor); \/\/ Close port if there is an error\n exit(1);\n }\n\n}\n\nvoid readBytes(int descriptor, int count) {\n if (read(descriptor, serialBuffer, count) == -1) { \/\/ Read back data into buf[]\n perror(\"Error reading \");\n close(descriptor); \/\/ Close port if there is an error\n exit(1);\n }\n}\n\nchar* itoa(int value, char* result, int base) {\n \/\/ check that the base if valid\n if (base < 2 || base > 36) { *result = '\\0'; return result; }\n\n char* ptr = result, *ptr1 = result, tmp_char;\n int tmp_value;\n\n do {\n tmp_value = value;\n value \/= base;\n *ptr++ = \"zyxwvutsrqponmlkjihgfedcba9876543210123456789abcdefghijklmnopqrstuvwxyz\" [35 + (tmp_value - value * base)];\n } while ( value );\n\n \/\/ Apply negative sign\n if (tmp_value < 0) *ptr++ = '-';\n *ptr-- = '\\0';\n while(ptr1 < ptr) {\n tmp_char = *ptr;\n *ptr--= *ptr1;\n *ptr1++ = tmp_char;\n }\n return result;\n }\n<|endoftext|>"} {"text":"<commit_before>\n#pragma once\n\n#include <cinatra_http\/request.h>\n#include <cinatra_http\/response.h>\n#include <cinatra\/context_container.hpp>\n#include <cinatra\/middleware\/cookies.hpp>\n\n#include <boost\/any.hpp>\n#include <boost\/uuid\/uuid.hpp>\n#include <boost\/uuid\/uuid_io.hpp>\n#include <boost\/uuid\/uuid_generators.hpp>\n\n#include <unordered_map>\n#include <string>\n#include <thread>\n#include <atomic>\n#include <mutex>\n\n\n\nnamespace cinatra\n{\n\tclass session\n\t{\n\tpublic:\n\t\tvoid before(request const& req, response& res, context_container& ctx)\n\t\t{\n\t\t\tctx.add_req_ctx(context_t(sessions_, ctx));\n\t\t}\n\n\t\tvoid after(request const& req, response& res, context_container& ctx)\n\t\t{\n\n\t\t}\n\n\t\tstruct session_map_t\n\t\t{\n\t\t\tsession_map_t()\n\t\t\t\t:last_used_time(std::time(nullptr))\n\t\t\t{}\n\t\t\tstd::time_t last_used_time;\n\t\t\tstd::unordered_map<std::string, boost::any> m;\n\t\t};\n\n\t\tclass context_t\n\t\t{\n\t\tpublic:\n\t\t\tcontext_t(std::unordered_map<std::string, session_map_t>& sessions,context_container& ctx)\n\t\t\t\t:sessions_(sessions), ctx_(ctx)\n\t\t\t{\n\n\t\t\t}\n\n\t\t\ttemplate<typename T>\n\t\t\tT& get(std::string const& key)\n\t\t\t{\n\t\t\t\tauto sp = get_session_map_with_session_id();\n\t\t\t\tif (!sp)\n\t\t\t\t{\n\t\t\t\t\tthrow std::invalid_argument(\"key \" + key + \" not found\");\n\t\t\t\t}\n\n\t\t\t\tauto it = sp->m.find(key);\n\t\t\t\tif (it == sp->m.end())\n\t\t\t\t{\n\t\t\t\t\tthrow std::invalid_argument(\"key \" + key + \" not found\");\n\t\t\t\t}\n\n\t\t\t\treturn boost::any_cast<T&>(it->second);\n\t\t\t}\n\n\t\t\ttemplate<typename T>\n\t\t\tvoid add(std::string const& key, T const& val)\n\t\t\t{\n\t\t\t\tauto sp = get_session_map_with_add();\n\t\t\t\tsp->m.emplace(key, val);\n\t\t\t}\n\n\t\t\tbool has(std::string const& key)\n\t\t\t{\n\t\t\t\tauto sp = get_session_map_with_session_id();\n\t\t\t\tif (!sp)\n\t\t\t\t{\n\t\t\t\t\treturn false;\n\t\t\t\t}\n\n\t\t\t\treturn sp->m.find(key) != sp->m.end();\n\t\t\t}\n\n\t\t\tbool del(std::string const& key)\n\t\t\t{\n\t\t\t\tauto sp = get_session_map_with_session_id();\n\t\t\t\tif (!sp)\n\t\t\t\t{\n\t\t\t\t\treturn false;\n\t\t\t\t}\n\n\t\t\t\tauto it = sp->m.find(key);\n\t\t\t\tif (it == sp->m.end())\n\t\t\t\t{\n\t\t\t\t\treturn false;\n\t\t\t\t}\n\n\t\t\t\tsp->m.erase(it);\n\t\t\t\treturn true;\n\t\t\t}\n\t\tprivate:\n\t\t\tstd::string get_session_id()\n\t\t\t{\n\t\t\t\tauto& cookie = ctx_.get_req_ctx<cookies>();\n\t\t\t\treturn cookie.get(\"CSESSIONID\");\n\t\t\t}\n\n\t\t\tsession_map_t* get_session_map()\n\t\t\t{\n\t\t\t\treturn session_map_ptr_;\n\t\t\t}\n\n\t\t\tsession_map_t* get_session_map_with_session_id()\n\t\t\t{\n\t\t\t\tif (session_map_ptr_)\n\t\t\t\t{\n\t\t\t\t\treturn session_map_ptr_;\n\t\t\t\t}\n\t\t\t\tif (session_map_ptr_not_found_)\n\t\t\t\t{\n\t\t\t\t\treturn nullptr;\n\t\t\t\t}\n\n\t\t\t\tauto& cookie = ctx_.get_req_ctx<cookies>();\n\t\t\t\tauto session_id = cookie.get(\"CSESSIONID\");\n\t\t\t\tif (session_id.empty())\n\t\t\t\t{\n\t\t\t\t\tsession_map_ptr_not_found_ = true;\n\t\t\t\t\treturn nullptr;\n\t\t\t\t}\n\n\t\t\t\tauto it = sessions_.find(session_id);\n\t\t\t\tif (it == sessions_.end())\n\t\t\t\t{\n\t\t\t\t\tsession_map_ptr_not_found_ = true;\n\t\t\t\t\treturn nullptr;\n\t\t\t\t}\n\n\t\t\t\tsession_map_ptr_ = &it->second;\n\n\t\t\t\treturn session_map_ptr_;\n\t\t\t}\n\n\t\t\tinline void itoh(int c, char& out1, char& out2)\n\t\t\t{\n\t\t\t\tunsigned char hexchars[] = \"0123456789ABCDEF\";\n\t\t\t\tout1 = hexchars[c >> 4];\n\t\t\t\tout2 = hexchars[c & 15];\n\t\t\t}\n\n\t\t\tsession_map_t* get_session_map_with_add()\n\t\t\t{\n\t\t\t\tif (session_map_ptr_)\n\t\t\t\t{\n\t\t\t\t\treturn session_map_ptr_;\n\t\t\t\t}\n\n\t\t\t\tauto& cookie = ctx_.get_req_ctx<cookies>();\n\t\t\t\tauto session_id = cookie.get(\"CSESSIONID\");\n\t\t\t\tif (session_id.empty())\n\t\t\t\t{\n\t\t\t\t\tboost::uuids::uuid u = boost::uuids::random_generator()();\n\t\t\t\t\tfor (auto c : u)\n\t\t\t\t\t{\n\t\t\t\t\t\tchar out1, out2;\n\t\t\t\t\t\titoh(c, out1, out2);\n\t\t\t\t\t\tsession_id.push_back(out1);\n\t\t\t\t\t\tsession_id.push_back(out2);\n\t\t\t\t\t}\n\n\t\t\t\t\tcookies::cookie_t c;\n\t\t\t\t\tc.add(\"CSESSIONID\", session_id);\n\t\t\t\t\tcookie.add_cookie(c);\n\t\t\t\t}\n\n\/\/ \t\t\t\tsessions_.emplace(session_id_, session_map_t());\n\t\t\t\tsession_map_ptr_ = &sessions_[session_id];\n\t\t\t\treturn session_map_ptr_;\n\t\t\t}\n\n\n\t\t\tcontext_container& ctx_;\n\t\t\tsession_map_t* session_map_ptr_ = nullptr;\n\t\t\tbool session_map_ptr_not_found_ = false;\n\n\t\t\tstd::unordered_map<std::string, session_map_t>& sessions_;\n\t\t};\n\tprivate:\n\t\tstd::mutex mtx_;\n\t\tstd::unordered_map<std::string, session_map_t> sessions_;\n\t};\n\n\n\n\n\n\n\n}<commit_msg>session中访问全局的map需要加锁<commit_after>\n#pragma once\n\n#include <cinatra_http\/request.h>\n#include <cinatra_http\/response.h>\n#include <cinatra\/context_container.hpp>\n#include <cinatra\/middleware\/cookies.hpp>\n\n#include <boost\/any.hpp>\n#include <boost\/uuid\/uuid.hpp>\n#include <boost\/uuid\/uuid_io.hpp>\n#include <boost\/uuid\/uuid_generators.hpp>\n\n#include <unordered_map>\n#include <string>\n#include <thread>\n#include <atomic>\n#include <mutex>\n\n\n\nnamespace cinatra\n{\n\tclass session\n\t{\n\tpublic:\n\t\tvoid before(request const& req, response& res, context_container& ctx)\n\t\t{\n\t\t\tctx.add_req_ctx(context_t(sessions_, mtx_, ctx));\n\t\t}\n\n\t\tvoid after(request const& req, response& res, context_container& ctx)\n\t\t{\n\n\t\t}\n\n\t\tstruct session_map_t\n\t\t{\n\t\t\tsession_map_t()\n\t\t\t\t:last_used_time(std::time(nullptr))\n\t\t\t{}\n\t\t\tstd::time_t last_used_time;\n\t\t\tstd::unordered_map<std::string, boost::any> m;\n\t\t};\n\n\t\tclass context_t\n\t\t{\n\t\tpublic:\n\t\t\tcontext_t(std::unordered_map<std::string, session_map_t>& sessions, std::mutex& mtx, context_container& ctx)\n\t\t\t\t:sessions_(sessions), mtx_(mtx), ctx_(ctx)\n\t\t\t{\n\n\t\t\t}\n\n\t\t\ttemplate<typename T>\n\t\t\tT& get(std::string const& key)\n\t\t\t{\n\t\t\t\tauto sp = get_session_map_with_session_id();\n\t\t\t\tif (!sp)\n\t\t\t\t{\n\t\t\t\t\tthrow std::invalid_argument(\"key \" + key + \" not found\");\n\t\t\t\t}\n\n\t\t\t\tauto it = sp->m.find(key);\n\t\t\t\tif (it == sp->m.end())\n\t\t\t\t{\n\t\t\t\t\tthrow std::invalid_argument(\"key \" + key + \" not found\");\n\t\t\t\t}\n\n\t\t\t\treturn boost::any_cast<T&>(it->second);\n\t\t\t}\n\n\t\t\ttemplate<typename T>\n\t\t\tvoid add(std::string const& key, T const& val)\n\t\t\t{\n\t\t\t\tauto sp = get_session_map_with_add();\n\t\t\t\tsp->m.emplace(key, val);\n\t\t\t}\n\n\t\t\tbool has(std::string const& key)\n\t\t\t{\n\t\t\t\tauto sp = get_session_map_with_session_id();\n\t\t\t\tif (!sp)\n\t\t\t\t{\n\t\t\t\t\treturn false;\n\t\t\t\t}\n\n\t\t\t\treturn sp->m.find(key) != sp->m.end();\n\t\t\t}\n\n\t\t\tbool del(std::string const& key)\n\t\t\t{\n\t\t\t\tauto sp = get_session_map_with_session_id();\n\t\t\t\tif (!sp)\n\t\t\t\t{\n\t\t\t\t\treturn false;\n\t\t\t\t}\n\n\t\t\t\tauto it = sp->m.find(key);\n\t\t\t\tif (it == sp->m.end())\n\t\t\t\t{\n\t\t\t\t\treturn false;\n\t\t\t\t}\n\n\t\t\t\tsp->m.erase(it);\n\t\t\t\treturn true;\n\t\t\t}\n\t\tprivate:\n\t\t\tstd::string get_session_id()\n\t\t\t{\n\t\t\t\tauto& cookie = ctx_.get_req_ctx<cookies>();\n\t\t\t\treturn cookie.get(\"CSESSIONID\");\n\t\t\t}\n\n\t\t\tsession_map_t* get_session_map()\n\t\t\t{\n\t\t\t\treturn session_map_ptr_;\n\t\t\t}\n\n\t\t\tsession_map_t* get_session_map_with_session_id()\n\t\t\t{\n\t\t\t\tif (session_map_ptr_)\n\t\t\t\t{\n\t\t\t\t\treturn session_map_ptr_;\n\t\t\t\t}\n\t\t\t\tif (session_map_ptr_not_found_)\n\t\t\t\t{\n\t\t\t\t\treturn nullptr;\n\t\t\t\t}\n\n\t\t\t\tauto& cookie = ctx_.get_req_ctx<cookies>();\n\t\t\t\tauto session_id = cookie.get(\"CSESSIONID\");\n\t\t\t\tif (session_id.empty())\n\t\t\t\t{\n\t\t\t\t\tsession_map_ptr_not_found_ = true;\n\t\t\t\t\treturn nullptr;\n\t\t\t\t}\n\n\t\t\t\tstd::lock_guard<std::mutex> _(mtx_);\n\t\t\t\tauto it = sessions_.find(session_id);\n\t\t\t\tif (it == sessions_.end())\n\t\t\t\t{\n\t\t\t\t\tsession_map_ptr_not_found_ = true;\n\t\t\t\t\treturn nullptr;\n\t\t\t\t}\n\n\t\t\t\tsession_map_ptr_ = &it->second;\n\n\t\t\t\treturn session_map_ptr_;\n\t\t\t}\n\n\t\t\tinline void itoh(int c, char& out1, char& out2)\n\t\t\t{\n\t\t\t\tunsigned char hexchars[] = \"0123456789ABCDEF\";\n\t\t\t\tout1 = hexchars[c >> 4];\n\t\t\t\tout2 = hexchars[c & 15];\n\t\t\t}\n\n\t\t\tsession_map_t* get_session_map_with_add()\n\t\t\t{\n\t\t\t\tif (session_map_ptr_)\n\t\t\t\t{\n\t\t\t\t\treturn session_map_ptr_;\n\t\t\t\t}\n\n\t\t\t\tauto& cookie = ctx_.get_req_ctx<cookies>();\n\t\t\t\tauto session_id = cookie.get(\"CSESSIONID\");\n\t\t\t\tif (session_id.empty())\n\t\t\t\t{\n\t\t\t\t\tboost::uuids::uuid u = boost::uuids::random_generator()();\n\t\t\t\t\tfor (auto c : u)\n\t\t\t\t\t{\n\t\t\t\t\t\tchar out1, out2;\n\t\t\t\t\t\titoh(c, out1, out2);\n\t\t\t\t\t\tsession_id.push_back(out1);\n\t\t\t\t\t\tsession_id.push_back(out2);\n\t\t\t\t\t}\n\n\t\t\t\t\tcookies::cookie_t c;\n\t\t\t\t\tc.add(\"CSESSIONID\", session_id);\n\t\t\t\t\tcookie.add_cookie(c);\n\t\t\t\t}\n\n\t\t\t\tstd::lock_guard<std::mutex> _(mtx_);\n\/\/ \t\t\t\tsessions_.emplace(session_id_, session_map_t());\n\t\t\t\tsession_map_ptr_ = &sessions_[session_id];\n\t\t\t\treturn session_map_ptr_;\n\t\t\t}\n\n\n\t\t\tcontext_container& ctx_;\n\t\t\tsession_map_t* session_map_ptr_ = nullptr;\n\t\t\tbool session_map_ptr_not_found_ = false;\n\n\t\t\tstd::mutex& mtx_;\n\t\t\tstd::unordered_map<std::string, session_map_t>& sessions_;\n\t\t};\n\tprivate:\n\t\tstd::mutex mtx_;\n\t\tstd::unordered_map<std::string, session_map_t> sessions_;\n\t};\n\n\n\n\n\n\n\n}<|endoftext|>"} {"text":"<commit_before>\/*\n * Copyright (C) 2018 The Android Open Source Project\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n *\/\n\n#include \"private\/filament\/SamplerBindingMap.h\"\n\n#include \"private\/filament\/SamplerInterfaceBlock.h\"\n\n#include <private\/filament\/SibGenerator.h>\n\n#include <utils\/Log.h>\n\nnamespace filament {\n\nvoid SamplerBindingMap::populate(const SamplerInterfaceBlock* perMaterialSib,\n const char* materialName) {\n \/\/ We assume material variant 0 here, which is sufficient for calculating the binding map.\n \/\/ The material variant currently only affects sampler formats (for VSM), not offsets.\n const Variant dummyVariant{};\n uint8_t offset = 0;\n for (uint8_t blockIndex = 0; blockIndex < filament::BindingPoints::COUNT; blockIndex++) {\n mSamplerBlockOffsets[blockIndex] = offset;\n filament::SamplerInterfaceBlock const* sib;\n if (blockIndex == filament::BindingPoints::PER_MATERIAL_INSTANCE) {\n sib = perMaterialSib;\n } else {\n sib = filament::SibGenerator::getSib(blockIndex, dummyVariant);\n }\n if (sib) {\n auto sibFields = sib->getSamplerInfoList();\n for (const auto& sInfo : sibFields) {\n addSampler({\n .blockIndex = blockIndex,\n .localOffset = sInfo.offset,\n .globalOffset = offset++,\n });\n }\n }\n }\n\n auto isOverflow = [&perMaterialSib, &dummyVariant]() {\n size_t numVertexSampler = 0, numFragmentSampler = 0;\n for (uint8_t blockIndex = 0; blockIndex < filament::BindingPoints::COUNT; blockIndex++) {\n filament::SamplerInterfaceBlock const* sib;\n if (blockIndex == filament::BindingPoints::PER_MATERIAL_INSTANCE) {\n sib = perMaterialSib;\n } else {\n sib = filament::SibGenerator::getSib(blockIndex, dummyVariant);\n }\n if (sib) {\n \/\/ Shader stage flags is only needed to check if MAX_SAMPLER_COUNT is exceeded.\n \/\/ Somehow if we can get shader stage flags from Program then we can remove it in SamplerInterfaceBlock.\n const auto stageFlags = sib->getStageFlags();\n if (stageFlags.vertex) {\n numVertexSampler += sib->getSamplerInfoList().size();\n }\n if (stageFlags.fragment) {\n numFragmentSampler += sib->getSamplerInfoList().size();\n }\n if (numVertexSampler >= backend::MAX_VERTEX_SAMPLER_COUNT ||\n numFragmentSampler >= backend::MAX_FRAGMENT_SAMPLER_COUNT) {\n return true;\n }\n }\n }\n return false;\n };\n\n \/\/ If an overflow occurred, go back through and list all sampler names. This is helpful to\n \/\/ material authors who need to understand where the samplers are coming from.\n if (isOverflow()) {\n utils::slog.e << \"WARNING: Exceeded max sampler count of \" << backend::MAX_SAMPLER_COUNT;\n if (materialName) {\n utils::slog.e << \" (\" << materialName << \")\";\n }\n utils::slog.e << utils::io::endl;\n offset = 0;\n for (uint8_t blockIndex = 0; blockIndex < filament::BindingPoints::COUNT; blockIndex++) {\n filament::SamplerInterfaceBlock const* sib;\n if (blockIndex == filament::BindingPoints::PER_MATERIAL_INSTANCE) {\n sib = perMaterialSib;\n } else {\n sib = filament::SibGenerator::getSib(blockIndex, dummyVariant);\n }\n if (sib) {\n auto sibFields = sib->getSamplerInfoList();\n for (auto sInfo : sibFields) {\n utils::slog.e << \" \" << (int) offset << \" \" << sInfo.name.c_str()\n << \" \" << sib->getStageFlags() << utils::io::endl;\n offset++;\n }\n }\n }\n }\n}\n\nvoid SamplerBindingMap::addSampler(SamplerBindingInfo info) {\n if (info.globalOffset < mSamplerBlockOffsets[info.blockIndex]) {\n mSamplerBlockOffsets[info.blockIndex] = info.globalOffset;\n }\n mBindingMap[getBindingKey(info.blockIndex, info.localOffset)] = info;\n}\n\n} \/\/ namespace filament\n<commit_msg>Fix sampler overflow check in SamplerBindingMap (#5143)<commit_after>\/*\n * Copyright (C) 2018 The Android Open Source Project\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n *\/\n\n#include \"private\/filament\/SamplerBindingMap.h\"\n\n#include \"private\/filament\/SamplerInterfaceBlock.h\"\n\n#include <private\/filament\/SibGenerator.h>\n\n#include <utils\/Log.h>\n\nnamespace filament {\n\nvoid SamplerBindingMap::populate(const SamplerInterfaceBlock* perMaterialSib,\n const char* materialName) {\n \/\/ We assume material variant 0 here, which is sufficient for calculating the binding map.\n \/\/ The material variant currently only affects sampler formats (for VSM), not offsets.\n const Variant dummyVariant{};\n uint8_t offset = 0;\n for (uint8_t blockIndex = 0; blockIndex < filament::BindingPoints::COUNT; blockIndex++) {\n mSamplerBlockOffsets[blockIndex] = offset;\n filament::SamplerInterfaceBlock const* sib;\n if (blockIndex == filament::BindingPoints::PER_MATERIAL_INSTANCE) {\n sib = perMaterialSib;\n } else {\n sib = filament::SibGenerator::getSib(blockIndex, dummyVariant);\n }\n if (sib) {\n auto sibFields = sib->getSamplerInfoList();\n for (const auto& sInfo : sibFields) {\n addSampler({\n .blockIndex = blockIndex,\n .localOffset = sInfo.offset,\n .globalOffset = offset++,\n });\n }\n }\n }\n\n auto isOverflow = [&perMaterialSib, &dummyVariant]() {\n size_t numVertexSampler = 0, numFragmentSampler = 0;\n for (uint8_t blockIndex = 0; blockIndex < filament::BindingPoints::COUNT; blockIndex++) {\n filament::SamplerInterfaceBlock const* sib;\n if (blockIndex == filament::BindingPoints::PER_MATERIAL_INSTANCE) {\n sib = perMaterialSib;\n } else {\n sib = filament::SibGenerator::getSib(blockIndex, dummyVariant);\n }\n if (sib) {\n \/\/ Shader stage flags is only needed to check if MAX_SAMPLER_COUNT is exceeded.\n \/\/ Somehow if we can get shader stage flags from Program then we can remove it in SamplerInterfaceBlock.\n const auto stageFlags = sib->getStageFlags();\n if (stageFlags.vertex) {\n numVertexSampler += sib->getSamplerInfoList().size();\n }\n if (stageFlags.fragment) {\n numFragmentSampler += sib->getSamplerInfoList().size();\n }\n if (numVertexSampler > backend::MAX_VERTEX_SAMPLER_COUNT ||\n numFragmentSampler > backend::MAX_FRAGMENT_SAMPLER_COUNT) {\n return true;\n }\n }\n }\n return false;\n };\n\n \/\/ If an overflow occurred, go back through and list all sampler names. This is helpful to\n \/\/ material authors who need to understand where the samplers are coming from.\n if (isOverflow()) {\n utils::slog.e << \"WARNING: Exceeded max sampler count of \" << backend::MAX_SAMPLER_COUNT;\n if (materialName) {\n utils::slog.e << \" (\" << materialName << \")\";\n }\n utils::slog.e << utils::io::endl;\n offset = 0;\n for (uint8_t blockIndex = 0; blockIndex < filament::BindingPoints::COUNT; blockIndex++) {\n filament::SamplerInterfaceBlock const* sib;\n if (blockIndex == filament::BindingPoints::PER_MATERIAL_INSTANCE) {\n sib = perMaterialSib;\n } else {\n sib = filament::SibGenerator::getSib(blockIndex, dummyVariant);\n }\n if (sib) {\n auto sibFields = sib->getSamplerInfoList();\n for (auto sInfo : sibFields) {\n utils::slog.e << \" \" << (int) offset << \" \" << sInfo.name.c_str()\n << \" \" << sib->getStageFlags() << utils::io::endl;\n offset++;\n }\n }\n }\n }\n}\n\nvoid SamplerBindingMap::addSampler(SamplerBindingInfo info) {\n if (info.globalOffset < mSamplerBlockOffsets[info.blockIndex]) {\n mSamplerBlockOffsets[info.blockIndex] = info.globalOffset;\n }\n mBindingMap[getBindingKey(info.blockIndex, info.localOffset)] = info;\n}\n\n} \/\/ namespace filament\n<|endoftext|>"} {"text":"<commit_before>#include \"SIO\/LCIORecords.h\"\n\n#include <SIO\/SIORunHeaderHandler.h>\n#include <SIO\/SIOEventHandler.h>\n#include <SIO\/SIOCollectionHandler.h>\n#include <SIO\/SIORandomAccessHandler.h>\n#include <SIO\/SIOIndexHandler.h>\n#include <EVENT\/LCEvent.h>\n#include <Exceptions.h>\n\n\/\/ -- sio headers\n#include <sio\/exception.h>\n#include <sio\/api.h>\n\nnamespace SIO {\n\n void SIOEventHeaderRecord::readBlocks( const sio::buffer_span &buffer, EVENT::LCEvent *event, const std::vector<std::string> &readCol ) {\n sio::block_list blocks {} ;\n auto headerBlock = std::make_shared<SIOEventHandler>() ;\n headerBlock->setEvent( event ) ;\n headerBlock->setReadCollectionNames( readCol ) ;\n blocks.push_back( headerBlock ) ;\n sio::api::read_blocks( buffer, blocks ) ;\n }\n\n \/\/----------------------------------------------------------------------------\n\n void SIOEventHeaderRecord::writeRecord( sio::buffer &outbuf, EVENT::LCEvent *event, sio::record_info& rec_info, sio::options_type opts ) {\n sio::block_list blocks {} ;\n auto headerBlock = std::make_shared<SIOEventHandler>() ;\n headerBlock->setEvent( event ) ;\n blocks.push_back( headerBlock ) ;\n rec_info = sio::api::write_record( LCSIO::HeaderRecordName, outbuf, blocks, opts ) ;\n }\n\n \/\/----------------------------------------------------------------------------\n\n void SIOEventRecord::setupBlocks( EVENT::LCEvent *event, const SIOHandlerMgr &handlerMgr, sio::block_list &blocks ) {\n auto collectionNames = event->getCollectionNames();\n for( auto collectionName : *collectionNames ) {\n auto collection = event->getCollection( collectionName ) ;\n \/\/ this is never true while reading. Can only appear on writing\n if( collection->isTransient() ) {\n continue;\n }\n auto handler = handlerMgr.getHandler( collection->getTypeName() ) ;\n auto block = std::make_shared<SIOCollectionHandler>( collectionName, handler ) ;\n block->setCollection( collection );\n blocks.push_back( block ) ;\n }\n }\n\n \/\/----------------------------------------------------------------------------\n\n void SIOEventRecord::readBlocks( const sio::buffer_span &buffer, EVENT::LCEvent *event, const SIOHandlerMgr &handlerMgr ) {\n sio::block_list blocks {} ;\n SIOEventRecord::setupBlocks( event, handlerMgr, blocks ) ;\n sio::api::read_blocks( buffer, blocks ) ;\n }\n\n \/\/----------------------------------------------------------------------------\n\n void SIOEventRecord::writeRecord( sio::buffer &outbuf, EVENT::LCEvent *event, const SIOHandlerMgr &handlerMgr, sio::record_info& rec_info, sio::options_type opts ) {\n sio::block_list blocks {} ;\n SIOEventRecord::setupBlocks( event, handlerMgr, blocks ) ;\n rec_info = sio::api::write_record( LCSIO::HeaderRecordName, outbuf, blocks, opts ) ;\n }\n\n \/\/----------------------------------------------------------------------------\n \/\/----------------------------------------------------------------------------\n\n void SIORunHeaderRecord::readBlocks( const sio::buffer_span &buffer, EVENT::LCRunHeader *rhdr ) {\n sio::block_list blocks {} ;\n auto runBlock = std::make_shared<SIORunHeaderHandler>() ;\n runBlock->setRunHeader( rhdr ) ;\n blocks.push_back( runBlock ) ;\n sio::api::read_blocks( buffer, blocks ) ;\n }\n\n \/\/----------------------------------------------------------------------------\n\n void SIORunHeaderRecord::writeRecord( sio::buffer &outbuf, EVENT::LCRunHeader *rhdr, sio::record_info& rec_info, sio::options_type opts ) {\n sio::block_list blocks {} ;\n auto runBlock = std::make_shared<SIORunHeaderHandler>() ;\n runBlock->setRunHeader( rhdr ) ;\n blocks.push_back( runBlock ) ;\n rec_info = sio::api::write_record( LCSIO::RunRecordName, outbuf, blocks, opts ) ;\n }\n\n} \/\/ namespace\n<commit_msg>Fixed wrong record name<commit_after>#include \"SIO\/LCIORecords.h\"\n\n#include <SIO\/SIORunHeaderHandler.h>\n#include <SIO\/SIOEventHandler.h>\n#include <SIO\/SIOCollectionHandler.h>\n#include <SIO\/SIORandomAccessHandler.h>\n#include <SIO\/SIOIndexHandler.h>\n#include <EVENT\/LCEvent.h>\n#include <Exceptions.h>\n\n\/\/ -- sio headers\n#include <sio\/exception.h>\n#include <sio\/api.h>\n\nnamespace SIO {\n\n void SIOEventHeaderRecord::readBlocks( const sio::buffer_span &buffer, EVENT::LCEvent *event, const std::vector<std::string> &readCol ) {\n sio::block_list blocks {} ;\n auto headerBlock = std::make_shared<SIOEventHandler>() ;\n headerBlock->setEvent( event ) ;\n headerBlock->setReadCollectionNames( readCol ) ;\n blocks.push_back( headerBlock ) ;\n sio::api::read_blocks( buffer, blocks ) ;\n }\n\n \/\/----------------------------------------------------------------------------\n\n void SIOEventHeaderRecord::writeRecord( sio::buffer &outbuf, EVENT::LCEvent *event, sio::record_info& rec_info, sio::options_type opts ) {\n sio::block_list blocks {} ;\n auto headerBlock = std::make_shared<SIOEventHandler>() ;\n headerBlock->setEvent( event ) ;\n blocks.push_back( headerBlock ) ;\n rec_info = sio::api::write_record( LCSIO::HeaderRecordName, outbuf, blocks, opts ) ;\n }\n\n \/\/----------------------------------------------------------------------------\n\n void SIOEventRecord::setupBlocks( EVENT::LCEvent *event, const SIOHandlerMgr &handlerMgr, sio::block_list &blocks ) {\n auto collectionNames = event->getCollectionNames();\n for( auto collectionName : *collectionNames ) {\n auto collection = event->getCollection( collectionName ) ;\n \/\/ this is never true while reading. Can only appear on writing\n if( collection->isTransient() ) {\n continue;\n }\n auto handler = handlerMgr.getHandler( collection->getTypeName() ) ;\n auto block = std::make_shared<SIOCollectionHandler>( collectionName, handler ) ;\n block->setCollection( collection );\n blocks.push_back( block ) ;\n }\n }\n\n \/\/----------------------------------------------------------------------------\n\n void SIOEventRecord::readBlocks( const sio::buffer_span &buffer, EVENT::LCEvent *event, const SIOHandlerMgr &handlerMgr ) {\n sio::block_list blocks {} ;\n SIOEventRecord::setupBlocks( event, handlerMgr, blocks ) ;\n sio::api::read_blocks( buffer, blocks ) ;\n }\n\n \/\/----------------------------------------------------------------------------\n\n void SIOEventRecord::writeRecord( sio::buffer &outbuf, EVENT::LCEvent *event, const SIOHandlerMgr &handlerMgr, sio::record_info& rec_info, sio::options_type opts ) {\n sio::block_list blocks {} ;\n SIOEventRecord::setupBlocks( event, handlerMgr, blocks ) ;\n rec_info = sio::api::write_record( LCSIO::EventRecordName, outbuf, blocks, opts ) ;\n }\n\n \/\/----------------------------------------------------------------------------\n \/\/----------------------------------------------------------------------------\n\n void SIORunHeaderRecord::readBlocks( const sio::buffer_span &buffer, EVENT::LCRunHeader *rhdr ) {\n sio::block_list blocks {} ;\n auto runBlock = std::make_shared<SIORunHeaderHandler>() ;\n runBlock->setRunHeader( rhdr ) ;\n blocks.push_back( runBlock ) ;\n sio::api::read_blocks( buffer, blocks ) ;\n }\n\n \/\/----------------------------------------------------------------------------\n\n void SIORunHeaderRecord::writeRecord( sio::buffer &outbuf, EVENT::LCRunHeader *rhdr, sio::record_info& rec_info, sio::options_type opts ) {\n sio::block_list blocks {} ;\n auto runBlock = std::make_shared<SIORunHeaderHandler>() ;\n runBlock->setRunHeader( rhdr ) ;\n blocks.push_back( runBlock ) ;\n rec_info = sio::api::write_record( LCSIO::RunRecordName, outbuf, blocks, opts ) ;\n }\n\n} \/\/ namespace\n<|endoftext|>"} {"text":"<commit_before>#include \"SIO\/RunEventMap.h\"\n\n#include <iostream>\n\nnamespace SIO {\n\n bool operator < ( const RunEvent& r0, const RunEvent& other) {\n\n \/\/std::cout << r0 << \" < \" << other << \" : [\"\n \/\/<< ( r0.RunNum == other.RunNum ? r0.EvtNum < other.EvtNum : r0.RunNum < other.RunNum ) << \"]\" << std::endl;\n\n if( r0.EvtNum < 0 ) { \/\/ sort run records (evtNu == -1 ) first\n\n return ( other.EvtNum < 0 ? r0.RunNum < other.RunNum : true ) ;\n }\n else if( other.EvtNum < 0 ) return false ;\n\n return ( r0.RunNum == other.RunNum ? r0.EvtNum < other.EvtNum : r0.RunNum < other.RunNum ) ;\n }\n\n \/\/----------------------------------------------------------------------------\n\n std::ostream & operator<<(std::ostream& os, const RunEvent& re ) {\n\n os << \" run: \" << re.RunNum << \" - evt: \" << re.EvtNum ;\n\n return os ;\n }\n\n \/\/----------------------------------------------------------------------------\n\n void RunEventMap::add(const RunEvent& re, long64 pos ) {\n auto p = _map.insert( std::make_pair( (long64) re , pos ) ) ;\n \/\/ if event\/run exists don't count as new entry\n if( p.second ) {\n if( re.EvtNum > -1 ) {\n ++_nEvt ;\n }\n else {\n ++ _nRun ;\n }\n\n }\n \/\/ overwrite with new entry\n else {\n p.first->second = pos ;\n }\n }\n \n \/\/----------------------------------------------------------------------------\n\n \/\/----------------------------------------------------------------------------\n\n RunEventMap::long64 RunEventMap::getPosition( long64 re ) {\n auto it = _map.find( re ) ;\n return ( it != _map.end() ? it->second : npos ) ;\n }\n\n \/\/----------------------------------------------------------------------------\n\n RunEvent RunEventMap::minRunEvent() const {\n if( _map.empty() ) {\n return RunEvent( -1 , -1 ) ;\n }\n return _map.begin()->first ;\n }\n\n \/\/----------------------------------------------------------------------------\n\n RunEvent RunEventMap::maxRunEvent() const {\n if( _map.empty() ) {\n return RunEvent( -1 , -1 ) ;\n }\n auto it = _map.rbegin() ;\n return it->first ;\n }\n \n \/\/----------------------------------------------------------------------------\n\n \/\/----------------------------------------------------------------------------\n\n std::ostream & operator<<(std::ostream& os, const RunEventMap& rm ) {\n os << \" ------- RunEventMap : \" << std::endl ;\n for( auto it = rm.begin() ; it != rm.end() ; ++it ) {\n os << \" \" << RunEvent( it->first ).RunNum << \", \" << RunEvent( it->first ).EvtNum << \" : \" << it->second << std::endl;\n }\n return os ;\n }\n\n}\n<commit_msg>Missing const for getters<commit_after>#include \"SIO\/RunEventMap.h\"\n\n#include <iostream>\n\nnamespace SIO {\n\n bool operator < ( const RunEvent& r0, const RunEvent& other) {\n\n \/\/std::cout << r0 << \" < \" << other << \" : [\"\n \/\/<< ( r0.RunNum == other.RunNum ? r0.EvtNum < other.EvtNum : r0.RunNum < other.RunNum ) << \"]\" << std::endl;\n\n if( r0.EvtNum < 0 ) { \/\/ sort run records (evtNu == -1 ) first\n\n return ( other.EvtNum < 0 ? r0.RunNum < other.RunNum : true ) ;\n }\n else if( other.EvtNum < 0 ) return false ;\n\n return ( r0.RunNum == other.RunNum ? r0.EvtNum < other.EvtNum : r0.RunNum < other.RunNum ) ;\n }\n\n \/\/----------------------------------------------------------------------------\n\n std::ostream & operator<<(std::ostream& os, const RunEvent& re ) {\n\n os << \" run: \" << re.RunNum << \" - evt: \" << re.EvtNum ;\n\n return os ;\n }\n\n \/\/----------------------------------------------------------------------------\n\n void RunEventMap::add(const RunEvent& re, long64 pos ) {\n auto p = _map.insert( std::make_pair( (long64) re , pos ) ) ;\n \/\/ if event\/run exists don't count as new entry\n if( p.second ) {\n if( re.EvtNum > -1 ) {\n ++_nEvt ;\n }\n else {\n ++ _nRun ;\n }\n\n }\n \/\/ overwrite with new entry\n else {\n p.first->second = pos ;\n }\n }\n\n \/\/----------------------------------------------------------------------------\n\n \/\/----------------------------------------------------------------------------\n\n RunEventMap::long64 RunEventMap::getPosition( long64 re ) {\n auto it = _map.find( re ) ;\n return ( it != _map.end() ? it->second : npos ) ;\n }\n\n \/\/----------------------------------------------------------------------------\n\n RunEvent RunEventMap::minRunEvent() const {\n if( _map.empty() ) {\n return RunEvent( -1 , -1 ) ;\n }\n return _map.begin()->first ;\n }\n\n \/\/----------------------------------------------------------------------------\n\n RunEvent RunEventMap::maxRunEvent() const {\n if( _map.empty() ) {\n return RunEvent( -1 , -1 ) ;\n }\n auto it = _map.rbegin() ;\n return it->first ;\n }\n\n \/\/----------------------------------------------------------------------------\n\n \/\/----------------------------------------------------------------------------\n\n std::ostream & operator<<(std::ostream& os, const RunEventMap& rm ) {\n os << \" ------- RunEventMap : \" << std::endl ;\n for( auto it = rm.begin() ; it != rm.end() ; ++it ) {\n os << \" \" << RunEvent( it->first ).RunNum << \", \" << RunEvent( it->first ).EvtNum << \" : \" << it->second << std::endl;\n }\n return os ;\n }\n\n}\n<|endoftext|>"} {"text":"<commit_before>#include \"SparseVector.h\"\n#include \"Matrix.h\"\n#include \"..\/file_parser\/FileParser.h\"\n#include \"..\/file_parser\/MatrixElement.h\"\n#include \"..\/utils\/GapsAssert.h\"\n\n#include <iterator>\n\nMatrix::Matrix() : mNumRows(0), mNumCols(0) {}\n\nMatrix::Matrix(unsigned nrow, unsigned ncol)\n :\nmCols(ncol, Vector(nrow)),\nmNumRows(nrow),\nmNumCols(ncol)\n{}\n\nvoid Matrix::pad(float val)\n{\n for (unsigned j = 0; j < mNumCols; ++j)\n {\n mCols[j].pad(val);\n }\n}\n\n\/\/ constructor from data set read in as a matrix\nMatrix::Matrix(const Matrix &mat, bool genesInCols, bool subsetGenes,\nstd::vector<unsigned> indices)\n{\n#ifdef GAPS_DEBUG\n for (unsigned i = 0; i < indices.size(); ++i)\n {\n GAPS_ASSERT_MSG(indices[i] > 0,\n \"index 0 detected in subset: R indices should start at 1\\n\");\n }\n#endif\n\n bool subsetData = !indices.empty();\n\n unsigned nGenes = (subsetData && subsetGenes)\n ? indices.size()\n : genesInCols ? mat.nCol() : mat.nRow();\n unsigned nSamples = (subsetData && !subsetGenes)\n ? indices.size()\n : genesInCols ? mat.nRow() : mat.nCol();\n \n for (unsigned j = 0; j < nSamples; ++j)\n {\n mCols.push_back(Vector(nGenes));\n for (unsigned i = 0; i < nGenes; ++i)\n {\n unsigned dataRow = (subsetData && (subsetGenes != genesInCols))\n ? indices[genesInCols ? j : i] - 1\n : genesInCols ? j : i;\n\n unsigned dataCol = (subsetData && (subsetGenes == genesInCols))\n ? indices[genesInCols ? i : j] - 1\n : genesInCols ? i : j;\n\n mCols[j][i] = mat(dataRow, dataCol);\n }\n }\n mNumRows = nGenes;\n mNumCols = nSamples;\n}\n\n\/\/ constructor from data set given as a file path\nMatrix::Matrix(const std::string &path, bool genesInCols, bool subsetGenes,\nstd::vector<unsigned> indices)\n{\n#ifdef GAPS_DEBUG\n for (unsigned i = 0; i < indices.size(); ++i)\n {\n GAPS_ASSERT_MSG(indices[i] > 0,\n \"index 0 detected in subset: R indices should start at 1\\n\");\n }\n#endif\n\n FileParser fp(path);\n\n \/\/ calculate the number of rows and columns\n bool subsetData = !indices.empty();\n mNumRows = (subsetData && subsetGenes) \/\/ nGenes\n ? indices.size()\n : genesInCols ? fp.nCol() : fp.nRow();\n mNumCols = (subsetData && !subsetGenes) \/\/ nSamples\n ? indices.size()\n : genesInCols ? fp.nRow() : fp.nCol();\n\n \/\/ allocate space for the data\n for (unsigned j = 0; j < mNumCols; ++j)\n {\n mCols.push_back(Vector(mNumRows));\n }\n\n \/\/ read from file\n if (!subsetData)\n {\n while (fp.hasNext())\n {\n MatrixElement e(fp.getNext());\n unsigned row = genesInCols ? e.col : e.row;\n unsigned col = genesInCols ? e.row : e.col;\n mCols[col][row] = e.value;\n }\n }\n else\n {\n std::sort(indices.begin(), indices.end());\n while (fp.hasNext())\n {\n MatrixElement e(fp.getNext());\n unsigned searchIndex = 1 + ((subsetGenes != genesInCols) ? e.row : e.col);\n std::vector<unsigned>::iterator pos = \n std::lower_bound(indices.begin(), indices.end(), searchIndex);\n \n \/\/ this index is included in the subset\n if (pos != indices.end() && *pos == searchIndex)\n {\n unsigned row = subsetGenes\n ? std::distance(indices.begin(), pos)\n : genesInCols ? e.col : e.row;\n unsigned col = !subsetGenes\n ? std::distance(indices.begin(), pos)\n : genesInCols ? e.row : e.col;\n mCols[col][row] = e.value;\n }\n }\n }\n}\n\nunsigned Matrix::nRow() const\n{\n return mNumRows;\n}\n\nunsigned Matrix::nCol() const\n{\n return mNumCols;\n}\n\nfloat Matrix::operator()(unsigned i, unsigned j) const\n{\n GAPS_ASSERT_MSG(i < mNumRows, i << \" : \" << mNumRows);\n GAPS_ASSERT_MSG(j < mNumCols, j << \" : \" << mNumCols);\n return mCols[j][i];\n}\n\nfloat& Matrix::operator()(unsigned i, unsigned j)\n{\n GAPS_ASSERT_MSG(i < mNumRows, i << \" : \" << mNumRows);\n GAPS_ASSERT_MSG(j < mNumCols, j << \" : \" << mNumCols);\n return mCols[j][i];\n}\n\nVector& Matrix::getCol(unsigned col)\n{\n GAPS_ASSERT_MSG(col < mNumCols, col << \" : \" << mNumCols);\n return mCols[col];\n}\n\nconst Vector& Matrix::getCol(unsigned col) const\n{\n GAPS_ASSERT_MSG(col < mNumCols, col << \" : \" << mNumCols);\n return mCols[col];\n}\n\nbool Matrix::empty() const\n{\n return mNumRows == 0;\n}\n\nArchive& operator<<(Archive &ar, const Matrix &mat)\n{\n ar << mat.mNumRows << mat.mNumCols;\n for (unsigned j = 0; j < mat.mNumCols; ++j)\n {\n ar << mat.mCols[j];\n }\n return ar;\n}\n\nArchive& operator>>(Archive &ar, Matrix &mat)\n{\n unsigned nr = 0, nc = 0;\n ar >> nr >> nc;\n GAPS_ASSERT(nr == mat.mNumRows);\n GAPS_ASSERT(nc == mat.mNumCols);\n\n for (unsigned j = 0; j < mat.mNumCols; ++j)\n {\n ar >> mat.mCols[j];\n }\n return ar;\n}\n\nvoid ColMatrix::overwriteWith(const RowMatrix &mat, unsigned nCores)\n{\n GAPS_ASSERT_MSG(mat.nRow() == nRow(), mat.nRow() << \" \" << nRow());\n GAPS_ASSERT_MSG(mat.nCol() == nCol(), mat.nCol() << \" \" << nCol());\n\n #pragma omp parallel for num_threads(nCores)\n for (unsigned i = 0; i < mNumRows; ++i)\n {\n for (unsigned j = 0; j < mNumCols; ++j)\n {\n this->operator()(i,j) = mat(i,j);\n }\n }\n}\n<commit_msg>removed unneccesary function<commit_after>#include \"SparseVector.h\"\n#include \"Matrix.h\"\n#include \"..\/file_parser\/FileParser.h\"\n#include \"..\/file_parser\/MatrixElement.h\"\n#include \"..\/utils\/GapsAssert.h\"\n\n#include <iterator>\n\nMatrix::Matrix() : mNumRows(0), mNumCols(0) {}\n\nMatrix::Matrix(unsigned nrow, unsigned ncol)\n :\nmCols(ncol, Vector(nrow)),\nmNumRows(nrow),\nmNumCols(ncol)\n{}\n\nvoid Matrix::pad(float val)\n{\n for (unsigned j = 0; j < mNumCols; ++j)\n {\n mCols[j].pad(val);\n }\n}\n\n\/\/ constructor from data set read in as a matrix\nMatrix::Matrix(const Matrix &mat, bool genesInCols, bool subsetGenes,\nstd::vector<unsigned> indices)\n{\n#ifdef GAPS_DEBUG\n for (unsigned i = 0; i < indices.size(); ++i)\n {\n GAPS_ASSERT_MSG(indices[i] > 0,\n \"index 0 detected in subset: R indices should start at 1\\n\");\n }\n#endif\n\n bool subsetData = !indices.empty();\n\n unsigned nGenes = (subsetData && subsetGenes)\n ? indices.size()\n : genesInCols ? mat.nCol() : mat.nRow();\n unsigned nSamples = (subsetData && !subsetGenes)\n ? indices.size()\n : genesInCols ? mat.nRow() : mat.nCol();\n \n for (unsigned j = 0; j < nSamples; ++j)\n {\n mCols.push_back(Vector(nGenes));\n for (unsigned i = 0; i < nGenes; ++i)\n {\n unsigned dataRow = (subsetData && (subsetGenes != genesInCols))\n ? indices[genesInCols ? j : i] - 1\n : genesInCols ? j : i;\n\n unsigned dataCol = (subsetData && (subsetGenes == genesInCols))\n ? indices[genesInCols ? i : j] - 1\n : genesInCols ? i : j;\n\n mCols[j][i] = mat(dataRow, dataCol);\n }\n }\n mNumRows = nGenes;\n mNumCols = nSamples;\n}\n\n\/\/ constructor from data set given as a file path\nMatrix::Matrix(const std::string &path, bool genesInCols, bool subsetGenes,\nstd::vector<unsigned> indices)\n{\n#ifdef GAPS_DEBUG\n for (unsigned i = 0; i < indices.size(); ++i)\n {\n GAPS_ASSERT_MSG(indices[i] > 0,\n \"index 0 detected in subset: R indices should start at 1\\n\");\n }\n#endif\n\n FileParser fp(path);\n\n \/\/ calculate the number of rows and columns\n bool subsetData = !indices.empty();\n mNumRows = (subsetData && subsetGenes) \/\/ nGenes\n ? indices.size()\n : genesInCols ? fp.nCol() : fp.nRow();\n mNumCols = (subsetData && !subsetGenes) \/\/ nSamples\n ? indices.size()\n : genesInCols ? fp.nRow() : fp.nCol();\n\n \/\/ allocate space for the data\n for (unsigned j = 0; j < mNumCols; ++j)\n {\n mCols.push_back(Vector(mNumRows));\n }\n\n \/\/ read from file\n if (!subsetData)\n {\n while (fp.hasNext())\n {\n MatrixElement e(fp.getNext());\n unsigned row = genesInCols ? e.col : e.row;\n unsigned col = genesInCols ? e.row : e.col;\n mCols[col][row] = e.value;\n }\n }\n else\n {\n std::sort(indices.begin(), indices.end());\n while (fp.hasNext())\n {\n MatrixElement e(fp.getNext());\n unsigned searchIndex = 1 + ((subsetGenes != genesInCols) ? e.row : e.col);\n std::vector<unsigned>::iterator pos = \n std::lower_bound(indices.begin(), indices.end(), searchIndex);\n \n \/\/ this index is included in the subset\n if (pos != indices.end() && *pos == searchIndex)\n {\n unsigned row = subsetGenes\n ? std::distance(indices.begin(), pos)\n : genesInCols ? e.col : e.row;\n unsigned col = !subsetGenes\n ? std::distance(indices.begin(), pos)\n : genesInCols ? e.row : e.col;\n mCols[col][row] = e.value;\n }\n }\n }\n}\n\nunsigned Matrix::nRow() const\n{\n return mNumRows;\n}\n\nunsigned Matrix::nCol() const\n{\n return mNumCols;\n}\n\nfloat Matrix::operator()(unsigned i, unsigned j) const\n{\n GAPS_ASSERT_MSG(i < mNumRows, i << \" : \" << mNumRows);\n GAPS_ASSERT_MSG(j < mNumCols, j << \" : \" << mNumCols);\n return mCols[j][i];\n}\n\nfloat& Matrix::operator()(unsigned i, unsigned j)\n{\n GAPS_ASSERT_MSG(i < mNumRows, i << \" : \" << mNumRows);\n GAPS_ASSERT_MSG(j < mNumCols, j << \" : \" << mNumCols);\n return mCols[j][i];\n}\n\nVector& Matrix::getCol(unsigned col)\n{\n GAPS_ASSERT_MSG(col < mNumCols, col << \" : \" << mNumCols);\n return mCols[col];\n}\n\nconst Vector& Matrix::getCol(unsigned col) const\n{\n GAPS_ASSERT_MSG(col < mNumCols, col << \" : \" << mNumCols);\n return mCols[col];\n}\n\nbool Matrix::empty() const\n{\n return mNumRows == 0;\n}\n\nArchive& operator<<(Archive &ar, const Matrix &mat)\n{\n ar << mat.mNumRows << mat.mNumCols;\n for (unsigned j = 0; j < mat.mNumCols; ++j)\n {\n ar << mat.mCols[j];\n }\n return ar;\n}\n\nArchive& operator>>(Archive &ar, Matrix &mat)\n{\n unsigned nr = 0, nc = 0;\n ar >> nr >> nc;\n GAPS_ASSERT(nr == mat.mNumRows);\n GAPS_ASSERT(nc == mat.mNumCols);\n\n for (unsigned j = 0; j < mat.mNumCols; ++j)\n {\n ar >> mat.mCols[j];\n }\n return ar;\n}<|endoftext|>"} {"text":"<commit_before>\/*============================================================================\n Copyright 2017-2021 Koichi Murakami\n\n Distributed under the OSI-approved BSD License (the \"License\");\n see accompanying file License for details.\n\n This software is distributed WITHOUT ANY WARRANTY; without even the\n implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.\n See the License for more information.\n============================================================================*\/\n#include <getopt.h>\n#include \"jsonparser.h\"\n\nnamespace {\n\/\/ --------------------------------------------------------------------------\nvoid show_version()\n{\n std::cout << \"jparser version 1.0.0\" << std::endl;\n}\n\n\/\/ --------------------------------------------------------------------------\nvoid show_help()\n{\n std::cout << \"j5parser - JSON5 parser\" << std::endl;\n std::cout << \"usage:\" << std::endl;\n std::cout << \"j5parser [options] [JSON5 file]\"\n << std::endl << std::endl;\n std::cout << \" -h, --help show this message.\" << std::endl\n << \" -v --version show program name\/version.\" << std::endl\n << std::endl;\n std::cout << std::endl;\n}\n\n} \/\/ end of namespace\n\nusing namespace kut;\n\n\/\/ --------------------------------------------------------------------------\nint main(int argc, char** argv)\n{\n \/\/ optional parameters\n bool qhelp = false;\n bool qversion = false;\n\n struct option long_options[] = {\n {\"help\", no_argument, NULL, 'h'},\n {\"version\", no_argument, NULL, 'v'},\n {NULL, 0, NULL, 0}\n };\n\n int c;\n while (1) {\n int option_index = -1;\n\n c = getopt_long(argc, argv, \"hv\", long_options, &option_index);\n\n if (c == -1) break;\n\n switch (c) {\n case 'h' :\n qhelp = true;\n break;\n case 'v' :\n qversion = true;\n break;\n default:\n std::exit(EXIT_FAILURE);\n break;\n }\n }\n\n if ( qhelp ) {\n ::show_help();\n }\n\n if ( qversion ) {\n ::show_version();\n }\n\n if ( qhelp || qversion ) {\n std::exit(EXIT_SUCCESS);\n }\n\n \/\/ config file\n std::string config_file = \"\";\n if ( optind < argc ) {\n config_file = argv[optind];\n } else {\n ::show_help();\n std::exit(EXIT_FAILURE);\n }\n\n \/\/ ----------------------------------------------------------------------\n \/\/ parsing config JSON file...\n JsonParser* jparser = JsonParser::GetJsonParser();\n bool qload = jparser-> LoadFile(config_file);\n if ( ! qload ) {\n std::cout << \"[ERROR] failed on loading a config file. \"\n << config_file << std::endl;\n std::exit(EXIT_FAILURE);\n }\n\n qload = jparser-> LoadFile(config_file, \"JSON-B\");\n if ( ! qload ) {\n std::cout << \"[ERROR] failed on loading a config file. \"\n << config_file << std::endl;\n std::exit(EXIT_FAILURE);\n }\n\n jparser-> SelectJsonData(\"JSON-B\");\n\n \/\/ ----------------------------------------------------------------------\n std::cout << \"------------------------------\" << std::endl;\n std::cout << \"@@@ dump JSON data\" << std::endl;\n jparser-> DumpAll();\n std::cout << \"------------------------------\" << std::endl;\n\n std::cout << \"@@@ yes\/no = \"\n << jparser-> GetBoolValue(\"yesorno\") << std::endl;\n\n std::vector<bool> ynlist;\n jparser-> GetBoolArray(\"yesorno_list\", ynlist);\n std::cout << \"@@@ yes\/no list = [\"\n << ynlist[0] << \", \" << ynlist[1] << \"]\" << std::endl;\n\n std::cout << \"@@@ Primary\/type = \"\n << jparser-> GetStringValue(\"Primary\/type\") << std::endl;\n\n std::cout << \"@@@ Primary\/number = \"\n << jparser-> GetIntValue(\"Primary\/number\") << std::endl;\n\n std::vector<std::string> legend;\n jparser-> GetStringArray(\"Primary\/legend\", legend);\n std::cout << \"@@@ Primary\/legend = [\"\n << legend[0] << \", \" << legend[1] << \", \"\n << legend[2] << \"]\" << std::endl;\n\n std::cout << \"@@@ Geometry\/size = \"\n << jparser-> GetDoubleValue(\"Geometry\/size\") << std::endl;\n\n std::cout << \"@@@ Geometry\/type\/name = \"\n << jparser-> GetStringValue(\"Geometry\/type\/name\") << std::endl;\n\n std::vector<int> segment;\n jparser-> GetIntArray(\"Geometry\/segment\", segment);\n std::cout << \"@@@ Geometry\/segment = [\"\n << segment[0] << \", \" << segment[1] << \", \"\n << segment[2] << \"]\" << std::endl;\n\n std::vector<double> position;\n jparser-> GetDoubleArray(\"Geometry\/position\", position);\n std::cout << \"@@@ Geometry\/position = [\"\n << position[0] << \", \" << position[1] << \", \"\n << position[2] << \"]\" << std::endl;\n\n return EXIT_SUCCESS;\n}\n<commit_msg>modify for using c++11 features<commit_after>\/*============================================================================\n Copyright 2017-2021 Koichi Murakami\n\n Distributed under the OSI-approved BSD License (the \"License\");\n see accompanying file License for details.\n\n This software is distributed WITHOUT ANY WARRANTY; without even the\n implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.\n See the License for more information.\n============================================================================*\/\n#include <getopt.h>\n#include \"jsonparser.h\"\n\nnamespace {\n\/\/ --------------------------------------------------------------------------\nvoid show_version()\n{\n std::cout << \"jparser version 1.0.0\" << std::endl;\n}\n\n\/\/ --------------------------------------------------------------------------\nvoid show_help()\n{\n std::cout << \"j5parser - JSON5 parser\" << std::endl;\n std::cout << \"usage:\" << std::endl;\n std::cout << \"j5parser [options] [JSON5 file]\"\n << std::endl << std::endl;\n std::cout << \" -h, --help show this message.\" << std::endl\n << \" -v --version show program name\/version.\" << std::endl\n << std::endl;\n std::cout << std::endl;\n}\n\n} \/\/ end of namespace\n\nusing namespace kut;\n\n\/\/ --------------------------------------------------------------------------\nint main(int argc, char** argv)\n{\n \/\/ optional parameters\n bool qhelp {false};\n bool qversion {false};\n\n struct option long_options[] = {\n {\"help\", no_argument, NULL, 'h'},\n {\"version\", no_argument, NULL, 'v'},\n {NULL, 0, NULL, 0}\n };\n\n int c;\n while (1) {\n int option_index {-1};\n\n c = getopt_long(argc, argv, \"hv\", long_options, &option_index);\n\n if (c == -1) break;\n\n switch (c) {\n case 'h' :\n qhelp = true;\n break;\n case 'v' :\n qversion = true;\n break;\n default:\n std::exit(EXIT_FAILURE);\n break;\n }\n }\n\n if ( qhelp ) {\n ::show_help();\n }\n\n if ( qversion ) {\n ::show_version();\n }\n\n if ( qhelp || qversion ) {\n std::exit(EXIT_SUCCESS);\n }\n\n \/\/ config file\n std::string config_file = \"\";\n if ( optind < argc ) {\n config_file = argv[optind];\n } else {\n ::show_help();\n std::exit(EXIT_FAILURE);\n }\n\n \/\/ ----------------------------------------------------------------------\n \/\/ parsing config JSON file...\n JsonParser* jparser = JsonParser::GetJsonParser();\n bool qload = jparser-> LoadFile(config_file);\n if ( ! qload ) {\n std::cout << \"[ERROR] failed on loading a config file. \"\n << config_file << std::endl;\n std::exit(EXIT_FAILURE);\n }\n\n qload = jparser-> LoadFile(config_file, \"JSON-B\");\n if ( ! qload ) {\n std::cout << \"[ERROR] failed on loading a config file. \"\n << config_file << std::endl;\n std::exit(EXIT_FAILURE);\n }\n\n jparser-> SelectJsonData(\"JSON-B\");\n\n \/\/ ----------------------------------------------------------------------\n std::cout << \"------------------------------\" << std::endl;\n std::cout << \"@@@ dump JSON data\" << std::endl;\n jparser-> DumpAll();\n std::cout << \"------------------------------\" << std::endl;\n\n std::cout << \"@@@ yes\/no = \"\n << jparser-> GetBoolValue(\"yesorno\") << std::endl;\n\n std::vector<bool> ynlist;\n jparser-> GetBoolArray(\"yesorno_list\", ynlist);\n std::cout << \"@@@ yes\/no list = [\"\n << ynlist[0] << \", \" << ynlist[1] << \"]\" << std::endl;\n\n std::cout << \"@@@ Primary\/type = \"\n << jparser-> GetStringValue(\"Primary\/type\") << std::endl;\n\n std::cout << \"@@@ Primary\/number = \"\n << jparser-> GetIntValue(\"Primary\/number\") << std::endl;\n\n std::vector<std::string> legend;\n jparser-> GetStringArray(\"Primary\/legend\", legend);\n std::cout << \"@@@ Primary\/legend = [\"\n << legend[0] << \", \" << legend[1] << \", \"\n << legend[2] << \"]\" << std::endl;\n\n std::cout << \"@@@ Geometry\/size = \"\n << jparser-> GetDoubleValue(\"Geometry\/size\") << std::endl;\n\n std::cout << \"@@@ Geometry\/type\/name = \"\n << jparser-> GetStringValue(\"Geometry\/type\/name\") << std::endl;\n\n std::vector<int> segment;\n jparser-> GetIntArray(\"Geometry\/segment\", segment);\n std::cout << \"@@@ Geometry\/segment = [\"\n << segment[0] << \", \" << segment[1] << \", \"\n << segment[2] << \"]\" << std::endl;\n\n std::vector<double> position;\n jparser-> GetDoubleArray(\"Geometry\/position\", position);\n std::cout << \"@@@ Geometry\/position = [\"\n << position[0] << \", \" << position[1] << \", \"\n << position[2] << \"]\" << std::endl;\n\n return EXIT_SUCCESS;\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#ifndef IOX_HOOFS_CXX_STACK_INL\n#define IOX_HOOFS_CXX_STACK_INL\n\n#include \"iceoryx_hoofs\/cxx\/stack.hpp\"\n\nnamespace iox\n{\nnamespace cxx\n{\ntemplate <typename T, uint64_t Capacity>\ninline auto stack<T, Capacity>::pop() noexcept -> cxx::optional<T>\n{\n if (m_size == 0U)\n {\n return cxx::nullopt;\n }\n\n \/\/ low level memory management with access to the topmost element on the untyped buffer;\n \/\/ type safety is ensured by the template parameter\n \/\/ NOLINTNEXTLINE(cppcoreguidelines-pro-type-reinterpret-cast)\n return *reinterpret_cast<T*>(m_data[--m_size]);\n}\n\ntemplate <typename T, uint64_t Capacity>\ntemplate <typename... Targs>\ninline bool stack<T, Capacity>::push(Targs&&... args) noexcept\n{\n if (m_size >= Capacity)\n {\n return false;\n }\n\n \/\/ low level memory management with access to the topmost element on the untyped buffer;\n \/\/ type safety is ensured by the template parameter\n \/\/ NOLINTNEXTLINE(cppcoreguidelines-pro-type-reinterpret-cast)\n new (reinterpret_cast<T*>(m_data[m_size++])) T(std::forward<Targs>(args)...);\n return true;\n}\n\ntemplate <typename T, uint64_t Capacity>\ninline uint64_t stack<T, Capacity>::size() const noexcept\n{\n return m_size;\n}\n\ntemplate <typename T, uint64_t Capacity>\ninline constexpr uint64_t stack<T, Capacity>::capacity() noexcept\n{\n return Capacity;\n}\n\n\n} \/\/ namespace cxx\n} \/\/ namespace iox\n\n#endif \/\/ IOX_HOOFS_CXX_STACK_INL\n<commit_msg>iox-#1394 Suppress reinterpret_cast + placement new warnings<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#ifndef IOX_HOOFS_CXX_STACK_INL\n#define IOX_HOOFS_CXX_STACK_INL\n\n#include \"iceoryx_hoofs\/cxx\/stack.hpp\"\n\nnamespace iox\n{\nnamespace cxx\n{\ntemplate <typename T, uint64_t Capacity>\ninline auto stack<T, Capacity>::pop() noexcept -> cxx::optional<T>\n{\n if (m_size == 0U)\n {\n return cxx::nullopt;\n }\n\n \/\/ AXIVION Next Construct CertC++-EXP36 : every entry of m_data is aligned to alignof(T)\n \/\/ AXIVION Next Construct AutosarC++19_03-A5.2.4 : low level memory management with access to the topmost element on\n \/\/ the untyped buffer; type safety is ensured by the template parameter\n \/\/ NOLINTNEXTLINE(cppcoreguidelines-pro-type-reinterpret-cast)\n return *reinterpret_cast<T*>(m_data[--m_size]);\n}\n\ntemplate <typename T, uint64_t Capacity>\ntemplate <typename... Targs>\ninline bool stack<T, Capacity>::push(Targs&&... args) noexcept\n{\n if (m_size >= Capacity)\n {\n return false;\n }\n\n \/\/ AXIVION Next Construct CertC++-MEM54, CertC++-EXP36, AutosarC++19_03-A18.5.10 : every entry of m_data is aligned\n \/\/ to alignof(T)\n \/\/ AXIVION Next Construct AutosarC++19_03-A5.2.4 : low level memory management with access to the topmost element on\n \/\/ the untyped buffer; type safety is ensured by the template parameter\n \/\/ NOLINTNEXTLINE(cppcoreguidelines-pro-type-reinterpret-cast)\n new (reinterpret_cast<T*>(m_data[m_size++])) T(std::forward<Targs>(args)...);\n return true;\n}\n\ntemplate <typename T, uint64_t Capacity>\ninline uint64_t stack<T, Capacity>::size() const noexcept\n{\n return m_size;\n}\n\ntemplate <typename T, uint64_t Capacity>\ninline constexpr uint64_t stack<T, Capacity>::capacity() noexcept\n{\n return Capacity;\n}\n\n\n} \/\/ namespace cxx\n} \/\/ namespace iox\n\n#endif \/\/ IOX_HOOFS_CXX_STACK_INL\n<|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#include \"iceoryx_posh\/popo\/base_publisher.hpp\"\n#include \"mocks\/chunk_mock.hpp\"\n#include \"mocks\/publisher_mock.hpp\"\n\n#include \"test.hpp\"\n\nusing namespace ::testing;\nusing ::testing::_;\n\nstruct DummyData\n{\n uint64_t val = 42;\n};\n\ntemplate <typename T, typename port_t>\nclass StubbedBasePublisher : public iox::popo::BasePublisher<T, port_t>\n{\n public:\n StubbedBasePublisher(iox::capro::ServiceDescription)\n : iox::popo::BasePublisher<T, port_t>::BasePublisher(){};\n uid_t getUid() const noexcept\n {\n return iox::popo::BasePublisher<T, port_t>::getUid();\n }\n iox::capro::ServiceDescription getServiceDescription() const noexcept\n {\n return iox::popo::BasePublisher<T, port_t>::getServiceDescription();\n }\n iox::cxx::expected<iox::popo::Sample<T>, iox::popo::AllocationError> loanSample(uint64_t size) noexcept\n {\n return iox::popo::BasePublisher<T, port_t>::loanSample(size);\n }\n void release(iox::popo::Sample<T>& sample) noexcept\n {\n return iox::popo::BasePublisher<T, port_t>::release(sample);\n }\n void publish(iox::popo::Sample<T>&& sample) noexcept\n {\n return iox::popo::BasePublisher<T, port_t>::publish(std::move(sample));\n }\n iox::cxx::optional<iox::popo::Sample<T>> loanPreviousSample() noexcept\n {\n return iox::popo::BasePublisher<T, port_t>::loanPreviousSample();\n }\n void offer() noexcept\n {\n return iox::popo::BasePublisher<T, port_t>::offer();\n }\n void stopOffer() noexcept\n {\n return iox::popo::BasePublisher<T, port_t>::stopOffer();\n }\n bool isOffered() const noexcept\n {\n return iox::popo::BasePublisher<T, port_t>::isOffered();\n }\n bool hasSubscribers() const noexcept\n {\n return iox::popo::BasePublisher<T, port_t>::hasSubscribers();\n }\n port_t& getMockedPort()\n {\n return iox::popo::BasePublisher<T, port_t>::m_port;\n }\n};\n\nusing TestBasePublisher = StubbedBasePublisher<DummyData, MockPublisherPortUser>;\n\nclass BasePublisherTest : public Test\n{\n public:\n BasePublisherTest()\n {\n }\n\n void SetUp()\n {\n }\n\n void TearDown()\n {\n }\n\n protected:\n ChunkMock<DummyData> chunkMock;\n TestBasePublisher sut{{\"\", \"\", \"\"}};\n};\n\nTEST_F(BasePublisherTest, LoanForwardsAllocationErrorsToCaller)\n{\n \/\/ ===== Setup ===== \/\/\n ON_CALL(sut.getMockedPort(), tryAllocateChunk)\n .WillByDefault(Return(\n ByMove(iox::cxx::error<iox::popo::AllocationError>(iox::popo::AllocationError::RUNNING_OUT_OF_CHUNKS))));\n \/\/ ===== Test ===== \/\/\n auto result = sut.loanSample(sizeof(DummyData));\n \/\/ ===== Verify ===== \/\/\n EXPECT_EQ(true, result.has_error());\n EXPECT_EQ(iox::popo::AllocationError::RUNNING_OUT_OF_CHUNKS, result.get_error());\n \/\/ ===== Cleanup ===== \/\/\n}\n\nTEST_F(BasePublisherTest, LoanReturnsAllocatedTypedSampleOnSuccess)\n{\n \/\/ ===== Setup ===== \/\/\n ON_CALL(sut.getMockedPort(), tryAllocateChunk)\n .WillByDefault(Return(ByMove(iox::cxx::success<iox::mepoo::ChunkHeader*>(chunkMock.chunkHeader()))));\n \/\/ ===== Test ===== \/\/\n auto result = sut.loanSample(sizeof(DummyData));\n \/\/ ===== Verify ===== \/\/\n \/\/ The memory location of the sample should be the same as the chunk payload.\n EXPECT_EQ(chunkMock.chunkHeader()->payload(), result.value().get());\n \/\/ ===== Cleanup ===== \/\/\n}\n\nTEST_F(BasePublisherTest, LoanedSamplesContainPointerToChunkHeader)\n{\n \/\/ ===== Setup ===== \/\/\n ON_CALL(sut.getMockedPort(), tryAllocateChunk)\n .WillByDefault(Return(ByMove(iox::cxx::success<iox::mepoo::ChunkHeader*>(chunkMock.chunkHeader()))));\n \/\/ ===== Test ===== \/\/\n auto result = sut.loanSample(sizeof(DummyData));\n \/\/ ===== Verify ===== \/\/\n EXPECT_EQ(chunkMock.chunkHeader(), result.value().getHeader());\n \/\/ ===== Cleanup ===== \/\/\n}\n\nTEST_F(BasePublisherTest, LoanedSamplesAreAutomaticallyReleasedWhenOutOfScope)\n{\n \/\/ ===== Setup ===== \/\/\n ON_CALL(sut.getMockedPort(), tryAllocateChunk)\n .WillByDefault(Return(ByMove(iox::cxx::success<iox::mepoo::ChunkHeader*>(chunkMock.chunkHeader()))));\n\n EXPECT_CALL(sut.getMockedPort(), freeChunk(chunkMock.chunkHeader())).Times(AtLeast(1));\n\n \/\/ ===== Test ===== \/\/\n {\n auto result = sut.loanSample(sizeof(DummyData));\n }\n \/\/ ===== Verify ===== \/\/\n \/\/ ===== Cleanup ===== \/\/\n}\n\nTEST_F(BasePublisherTest, PublishingSendsUnderlyingMemoryChunkOnPublisherPort)\n{\n \/\/ ===== Setup ===== \/\/\n ON_CALL(sut.getMockedPort(), tryAllocateChunk)\n .WillByDefault(Return(ByMove(iox::cxx::success<iox::mepoo::ChunkHeader*>(chunkMock.chunkHeader()))));\n EXPECT_CALL(sut.getMockedPort(), sendChunk).Times(1);\n \/\/ ===== Test ===== \/\/\n sut.loanSample(sizeof(DummyData)).and_then([](auto& sample) { sample.publish(); });\n \/\/ ===== Verify ===== \/\/\n \/\/ ===== Cleanup ===== \/\/\n}\n\nTEST_F(BasePublisherTest, PreviousSampleReturnsSampleWhenPreviousChunkIsRetrievable)\n{\n \/\/ ===== Setup ===== \/\/\n EXPECT_CALL(sut.getMockedPort(), tryGetPreviousChunk)\n .WillOnce(Return(ByMove(iox::cxx::make_optional<iox::mepoo::ChunkHeader*>(chunkMock.chunkHeader()))));\n \/\/ ===== Test ===== \/\/\n auto result = sut.loanPreviousSample();\n \/\/ ===== Verify ===== \/\/\n EXPECT_EQ(true, result.has_value());\n \/\/ ===== Cleanup ===== \/\/\n}\n\nTEST_F(BasePublisherTest, PreviousSampleReturnsEmptyOptionalWhenChunkNotRetrievable)\n{\n \/\/ ===== Setup ===== \/\/\n EXPECT_CALL(sut.getMockedPort(), tryGetPreviousChunk).WillOnce(Return(ByMove(iox::cxx::nullopt)));\n \/\/ ===== Test ===== \/\/\n auto result = sut.loanPreviousSample();\n \/\/ ===== Verify ===== \/\/\n EXPECT_EQ(false, result.has_value());\n \/\/ ===== Cleanup ===== \/\/\n}\n\nTEST_F(BasePublisherTest, OfferDoesOfferServiceOnUnderlyingPort)\n{\n \/\/ ===== Setup ===== \/\/\n EXPECT_CALL(sut.getMockedPort(), offer).Times(1);\n \/\/ ===== Test ===== \/\/\n sut.offer();\n \/\/ ===== Verify ===== \/\/\n \/\/ ===== Cleanup ===== \/\/\n}\n\nTEST_F(BasePublisherTest, StopOfferDoesStopOfferServiceOnUnderlyingPort)\n{\n \/\/ ===== Setup ===== \/\/\n EXPECT_CALL(sut.getMockedPort(), stopOffer).Times(1);\n \/\/ ===== Test ===== \/\/\n sut.stopOffer();\n \/\/ ===== Verify ===== \/\/\n \/\/ ===== Cleanup ===== \/\/\n}\n\nTEST_F(BasePublisherTest, isOfferedDoesCheckIfPortIsOfferedOnUnderlyingPort)\n{\n \/\/ ===== Setup ===== \/\/\n EXPECT_CALL(sut.getMockedPort(), isOffered).Times(1);\n \/\/ ===== Test ===== \/\/\n sut.isOffered();\n \/\/ ===== Verify ===== \/\/\n \/\/ ===== Cleanup ===== \/\/\n}\n\nTEST_F(BasePublisherTest, isOfferedDoesCheckIfUnderylingPortHasSubscribers)\n{\n \/\/ ===== Setup ===== \/\/\n EXPECT_CALL(sut.getMockedPort(), hasSubscribers).Times(1);\n \/\/ ===== Test ===== \/\/\n sut.hasSubscribers();\n \/\/ ===== Verify ===== \/\/\n \/\/ ===== Cleanup ===== \/\/\n}\n\nTEST_F(BasePublisherTest, GetServiceDescriptionCallForwardedToUnderlyingPublisherPort)\n{\n \/\/ ===== Setup ===== \/\/\n EXPECT_CALL(sut.getMockedPort(), getServiceDescription).Times(1);\n \/\/ ===== Test ===== \/\/\n sut.getServiceDescription();\n \/\/ ===== Verify ===== \/\/\n \/\/ ===== Cleanup ===== \/\/\n}\n\nTEST_F(BasePublisherTest, DestroysUnderlyingPortOnDestruction)\n{\n EXPECT_CALL(sut.getMockedPort(), destroy).Times(1);\n}\n<commit_msg>iox-#408 adapted base publisher tests<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#include \"iceoryx_posh\/popo\/base_publisher.hpp\"\n#include \"mocks\/chunk_mock.hpp\"\n#include \"mocks\/publisher_mock.hpp\"\n\n#include \"test.hpp\"\n\nusing namespace ::testing;\nusing ::testing::_;\n\nstruct DummyData\n{\n uint64_t val = 42;\n};\n\ntemplate <typename T, typename port_t>\nclass StubbedBasePublisher : public iox::popo::BasePublisher<T, port_t>\n{\n public:\n StubbedBasePublisher(iox::capro::ServiceDescription)\n : iox::popo::BasePublisher<T, port_t>::BasePublisher(){};\n uid_t getUid() const noexcept\n {\n return iox::popo::BasePublisher<T, port_t>::getUid();\n }\n iox::capro::ServiceDescription getServiceDescription() const noexcept\n {\n return iox::popo::BasePublisher<T, port_t>::getServiceDescription();\n }\n iox::cxx::expected<iox::popo::Sample<T>, iox::popo::AllocationError> loanSample(uint64_t size) noexcept\n {\n return iox::popo::BasePublisher<T, port_t>::loanSample(size);\n }\n void release(iox::popo::Sample<T>& sample) noexcept\n {\n return iox::popo::BasePublisher<T, port_t>::release(sample);\n }\n void publish(iox::popo::Sample<T>&& sample) noexcept\n {\n return iox::popo::BasePublisher<T, port_t>::publish(std::move(sample));\n }\n iox::cxx::optional<iox::popo::Sample<T>> loanPreviousSample() noexcept\n {\n return iox::popo::BasePublisher<T, port_t>::loanPreviousSample();\n }\n void offer() noexcept\n {\n return iox::popo::BasePublisher<T, port_t>::offer();\n }\n void stopOffer() noexcept\n {\n return iox::popo::BasePublisher<T, port_t>::stopOffer();\n }\n bool isOffered() const noexcept\n {\n return iox::popo::BasePublisher<T, port_t>::isOffered();\n }\n bool hasSubscribers() const noexcept\n {\n return iox::popo::BasePublisher<T, port_t>::hasSubscribers();\n }\n port_t& getMockedPort()\n {\n return iox::popo::BasePublisher<T, port_t>::m_port;\n }\n};\n\nusing TestBasePublisher = StubbedBasePublisher<DummyData, MockPublisherPortUser>;\n\nclass BasePublisherTest : public Test\n{\n public:\n BasePublisherTest()\n {\n }\n\n void SetUp()\n {\n }\n\n void TearDown()\n {\n }\n\n protected:\n ChunkMock<DummyData> chunkMock;\n TestBasePublisher sut{{\"\", \"\", \"\"}};\n};\n\nTEST_F(BasePublisherTest, LoanForwardsAllocationErrorsToCaller)\n{\n \/\/ ===== Setup ===== \/\/\n ON_CALL(sut.getMockedPort(), tryAllocateChunk)\n .WillByDefault(Return(\n ByMove(iox::cxx::error<iox::popo::AllocationError>(iox::popo::AllocationError::RUNNING_OUT_OF_CHUNKS))));\n \/\/ ===== Test ===== \/\/\n auto result = sut.loanSample(sizeof(DummyData));\n \/\/ ===== Verify ===== \/\/\n EXPECT_EQ(true, result.has_error());\n EXPECT_EQ(iox::popo::AllocationError::RUNNING_OUT_OF_CHUNKS, result.get_error());\n \/\/ ===== Cleanup ===== \/\/\n}\n\nTEST_F(BasePublisherTest, LoanReturnsAllocatedTypedSampleOnSuccess)\n{\n \/\/ ===== Setup ===== \/\/\n ON_CALL(sut.getMockedPort(), tryAllocateChunk)\n .WillByDefault(Return(ByMove(iox::cxx::success<iox::mepoo::ChunkHeader*>(chunkMock.chunkHeader()))));\n \/\/ ===== Test ===== \/\/\n auto result = sut.loanSample(sizeof(DummyData));\n \/\/ ===== Verify ===== \/\/\n \/\/ The memory location of the sample should be the same as the chunk payload.\n EXPECT_EQ(chunkMock.chunkHeader()->payload(), result.value().get());\n \/\/ ===== Cleanup ===== \/\/\n}\n\nTEST_F(BasePublisherTest, LoanedSamplesContainPointerToChunkHeader)\n{\n \/\/ ===== Setup ===== \/\/\n ON_CALL(sut.getMockedPort(), tryAllocateChunk)\n .WillByDefault(Return(ByMove(iox::cxx::success<iox::mepoo::ChunkHeader*>(chunkMock.chunkHeader()))));\n \/\/ ===== Test ===== \/\/\n auto result = sut.loanSample(sizeof(DummyData));\n \/\/ ===== Verify ===== \/\/\n EXPECT_EQ(chunkMock.chunkHeader(), result.value().getHeader());\n \/\/ ===== Cleanup ===== \/\/\n}\n\nTEST_F(BasePublisherTest, LoanedSamplesAreAutomaticallyReleasedWhenOutOfScope)\n{\n \/\/ ===== Setup ===== \/\/\n ON_CALL(sut.getMockedPort(), tryAllocateChunk)\n .WillByDefault(Return(ByMove(iox::cxx::success<iox::mepoo::ChunkHeader*>(chunkMock.chunkHeader()))));\n\n EXPECT_CALL(sut.getMockedPort(), releaseChunk(chunkMock.chunkHeader())).Times(AtLeast(1));\n\n \/\/ ===== Test ===== \/\/\n {\n auto result = sut.loanSample(sizeof(DummyData));\n }\n \/\/ ===== Verify ===== \/\/\n \/\/ ===== Cleanup ===== \/\/\n}\n\nTEST_F(BasePublisherTest, PublishingSendsUnderlyingMemoryChunkOnPublisherPort)\n{\n \/\/ ===== Setup ===== \/\/\n ON_CALL(sut.getMockedPort(), tryAllocateChunk)\n .WillByDefault(Return(ByMove(iox::cxx::success<iox::mepoo::ChunkHeader*>(chunkMock.chunkHeader()))));\n EXPECT_CALL(sut.getMockedPort(), sendChunk).Times(1);\n \/\/ ===== Test ===== \/\/\n sut.loanSample(sizeof(DummyData)).and_then([](auto& sample) { sample.publish(); });\n \/\/ ===== Verify ===== \/\/\n \/\/ ===== Cleanup ===== \/\/\n}\n\nTEST_F(BasePublisherTest, PreviousSampleReturnsSampleWhenPreviousChunkIsRetrievable)\n{\n \/\/ ===== Setup ===== \/\/\n EXPECT_CALL(sut.getMockedPort(), tryGetPreviousChunk)\n .WillOnce(Return(ByMove(iox::cxx::make_optional<iox::mepoo::ChunkHeader*>(chunkMock.chunkHeader()))));\n \/\/ ===== Test ===== \/\/\n auto result = sut.loanPreviousSample();\n \/\/ ===== Verify ===== \/\/\n EXPECT_EQ(true, result.has_value());\n \/\/ ===== Cleanup ===== \/\/\n}\n\nTEST_F(BasePublisherTest, PreviousSampleReturnsEmptyOptionalWhenChunkNotRetrievable)\n{\n \/\/ ===== Setup ===== \/\/\n EXPECT_CALL(sut.getMockedPort(), tryGetPreviousChunk).WillOnce(Return(ByMove(iox::cxx::nullopt)));\n \/\/ ===== Test ===== \/\/\n auto result = sut.loanPreviousSample();\n \/\/ ===== Verify ===== \/\/\n EXPECT_EQ(false, result.has_value());\n \/\/ ===== Cleanup ===== \/\/\n}\n\nTEST_F(BasePublisherTest, OfferDoesOfferServiceOnUnderlyingPort)\n{\n \/\/ ===== Setup ===== \/\/\n EXPECT_CALL(sut.getMockedPort(), offer).Times(1);\n \/\/ ===== Test ===== \/\/\n sut.offer();\n \/\/ ===== Verify ===== \/\/\n \/\/ ===== Cleanup ===== \/\/\n}\n\nTEST_F(BasePublisherTest, StopOfferDoesStopOfferServiceOnUnderlyingPort)\n{\n \/\/ ===== Setup ===== \/\/\n EXPECT_CALL(sut.getMockedPort(), stopOffer).Times(1);\n \/\/ ===== Test ===== \/\/\n sut.stopOffer();\n \/\/ ===== Verify ===== \/\/\n \/\/ ===== Cleanup ===== \/\/\n}\n\nTEST_F(BasePublisherTest, isOfferedDoesCheckIfPortIsOfferedOnUnderlyingPort)\n{\n \/\/ ===== Setup ===== \/\/\n EXPECT_CALL(sut.getMockedPort(), isOffered).Times(1);\n \/\/ ===== Test ===== \/\/\n sut.isOffered();\n \/\/ ===== Verify ===== \/\/\n \/\/ ===== Cleanup ===== \/\/\n}\n\nTEST_F(BasePublisherTest, isOfferedDoesCheckIfUnderylingPortHasSubscribers)\n{\n \/\/ ===== Setup ===== \/\/\n EXPECT_CALL(sut.getMockedPort(), hasSubscribers).Times(1);\n \/\/ ===== Test ===== \/\/\n sut.hasSubscribers();\n \/\/ ===== Verify ===== \/\/\n \/\/ ===== Cleanup ===== \/\/\n}\n\nTEST_F(BasePublisherTest, GetServiceDescriptionCallForwardedToUnderlyingPublisherPort)\n{\n \/\/ ===== Setup ===== \/\/\n EXPECT_CALL(sut.getMockedPort(), getServiceDescription).Times(1);\n \/\/ ===== Test ===== \/\/\n sut.getServiceDescription();\n \/\/ ===== Verify ===== \/\/\n \/\/ ===== Cleanup ===== \/\/\n}\n\nTEST_F(BasePublisherTest, DestroysUnderlyingPortOnDestruction)\n{\n EXPECT_CALL(sut.getMockedPort(), destroy).Times(1);\n}\n<|endoftext|>"} {"text":"<commit_before>\/\/\n\/\/ main.cpp\n\/\/ Homework1\n\/\/\n\/\/ Created by James Savage on 9\/13\/13.\n\/\/ Copyright (c) 2013 James Savage <me@axiixc.com>. All rights reserved.\n\/\/\n\n#include \"BoardWriterConsole.h\"\n#include \"InputSourceKeyboard.h\"\n\nint main(int argc, const char * argv[])\n{\n BoardWriter& writer = BoardWriter::create<BoardWriterConsole>();\n InputSource& inputSource = InputSource::create<InputSourceKeyboard>(writer);\n inputSource.startRecievingInputEvents();\n \n return 0;\n}\n\n<commit_msg>Modifications to allow the program to be run in either GPIO (default) or keyboard (--keyboard) modes.<commit_after>\/\/\n\/\/ main.cpp\n\/\/ Homework1\n\/\/\n\/\/ Created by James Savage on 9\/13\/13.\n\/\/ Copyright (c) 2013 James Savage <me@axiixc.com>. All rights reserved.\n\/\/\n\n#include \"BoardWriterConsole.h\"\n#include \"BoardWriterGPIO.h\"\n#include \"InputSourceGPIO.h\"\n#include \"InputSourceKeyboard.h\"\n\n#include <stdio.h>\n#include <string.h>\n\nint main(int argc, const char **argv)\n{\n if (argc == 2 && strncmp(\"--keyboard\", argv[1], strlen(\"--keyboard\")) == 0)\n InputSource::create<InputSourceKeyboard>(BoardWriter::create<BoardWriterConsole>()).startRecievingInputEvents();\n else\n InputSource::create<InputSourceGPIO>(BoardWriter::create<BoardWriterGPIO>()).startRecievingInputEvents();\n \n return 0;\n}\n\n<|endoftext|>"} {"text":"<commit_before>\/*=========================================================================\n\n Program: Visualization Toolkit\n Module: vtkSTLWriter.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 \"vtkSTLWriter.h\"\n\n#include \"vtkByteSwap.h\"\n#include \"vtkCellArray.h\"\n#include \"vtkErrorCode.h\"\n#include \"vtkInformation.h\"\n#include \"vtkObjectFactory.h\"\n#include \"vtkPolyData.h\"\n#include \"vtkTriangle.h\"\n#include <vtksys\/SystemTools.hxx>\n\n#if !defined(_WIN32) || defined(__CYGWIN__)\n# include <unistd.h> \/* unlink *\/\n#else\n# include <io.h> \/* unlink *\/\n#endif\n\nvtkStandardNewMacro(vtkSTLWriter);\n\nstatic char header[]=\"Visualization Toolkit generated SLA File \";\n\nvtkSTLWriter::vtkSTLWriter()\n{\n this->FileType = VTK_ASCII;\n this->FileName = NULL;\n this->Header = new char[257];\n strcpy(this->Header, header);\n}\n\nvoid vtkSTLWriter::WriteData()\n{\n vtkPoints *pts;\n vtkCellArray *polys;\n vtkPolyData *input = this->GetInput();\n\n polys = input->GetPolys();\n pts = input->GetPoints();\n if (pts == NULL || polys == NULL )\n {\n vtkErrorMacro(<<\"No data to write!\");\n return;\n }\n\n if ( this->FileName == NULL)\n {\n vtkErrorMacro(<< \"Please specify FileName to write\");\n this->SetErrorCode(vtkErrorCode::NoFileNameError);\n return;\n }\n\n if ( this->FileType == VTK_BINARY )\n {\n this->WriteBinarySTL(pts,polys);\n if (this->ErrorCode == vtkErrorCode::OutOfDiskSpaceError)\n {\n vtkErrorMacro(\"Ran out of disk space; deleting file: \"\n << this->FileName);\n unlink(this->FileName);\n }\n }\n else\n {\n this->WriteAsciiSTL(pts,polys);\n if (this->ErrorCode == vtkErrorCode::OutOfDiskSpaceError)\n {\n vtkErrorMacro(\"Ran out of disk space; deleting file: \"\n << this->FileName);\n unlink(this->FileName);\n }\n }\n}\n\nvoid vtkSTLWriter::WriteAsciiSTL(vtkPoints *pts, vtkCellArray *polys)\n{\n FILE *fp;\n double n[3], v1[3], v2[3], v3[3];\n vtkIdType npts = 0;\n vtkIdType *indx = 0;\n\n if ((fp = fopen(this->FileName, \"w\")) == NULL)\n {\n vtkErrorMacro(<< \"Couldn't open file: \" << this->FileName);\n this->SetErrorCode(vtkErrorCode::CannotOpenFileError);\n return;\n }\n\/\/\n\/\/ Write header\n\/\/\n vtkDebugMacro(\"Writing ASCII sla file\");\n if (fprintf (fp, \"solid ascii\\n\") < 0)\n {\n fclose(fp);\n this->SetErrorCode(vtkErrorCode::OutOfDiskSpaceError);\n return;\n }\n\/\/\n\/\/ Write out triangle polygons. In not a triangle polygon, only first\n\/\/ three vertices are written.\n\/\/\n for (polys->InitTraversal(); polys->GetNextCell(npts,indx); )\n {\n pts->GetPoint(indx[0],v1);\n pts->GetPoint(indx[1],v2);\n pts->GetPoint(indx[2],v3);\n\n vtkTriangle::ComputeNormal(pts, npts, indx, n);\n\n if (fprintf (fp, \" facet normal %.6g %.6g %.6g\\n outer loop\\n\",\n n[0], n[1], n[2]) < 0)\n {\n fclose(fp);\n this->SetErrorCode(vtkErrorCode::OutOfDiskSpaceError);\n return;\n }\n\n if (fprintf (fp, \" vertex %.6g %.6g %.6g\\n\", v1[0], v1[1], v1[2]) < 0)\n {\n fclose(fp);\n this->SetErrorCode(vtkErrorCode::OutOfDiskSpaceError);\n return;\n }\n if (fprintf (fp, \" vertex %.6g %.6g %.6g\\n\", v2[0], v2[1], v2[2]) < 0)\n {\n fclose(fp);\n this->SetErrorCode(vtkErrorCode::OutOfDiskSpaceError);\n return;\n }\n if (fprintf (fp, \" vertex %.6g %.6g %.6g\\n\", v3[0], v3[1], v3[2]) < 0)\n {\n fclose(fp);\n this->SetErrorCode(vtkErrorCode::OutOfDiskSpaceError);\n return;\n }\n\n if (fprintf (fp, \" endloop\\n endfacet\\n\") < 0)\n {\n fclose(fp);\n this->SetErrorCode(vtkErrorCode::OutOfDiskSpaceError);\n return;\n }\n }\n if (fprintf (fp, \"endsolid\\n\") < 0)\n {\n this->SetErrorCode(vtkErrorCode::OutOfDiskSpaceError);\n }\n fclose (fp);\n}\n\nvoid vtkSTLWriter::WriteBinarySTL(vtkPoints *pts, vtkCellArray *polys)\n{\n FILE *fp;\n double dn[3], v1[3], v2[3], v3[3];\n vtkIdType npts = 0;\n vtkIdType *indx = 0;\n unsigned long ulint;\n unsigned short ibuff2=0;\n\n if ((fp = fopen(this->FileName, \"wb\")) == NULL)\n {\n vtkErrorMacro(<< \"Couldn't open file: \" << this->FileName);\n this->SetErrorCode(vtkErrorCode::CannotOpenFileError);\n return;\n }\n\n \/\/ Write header\n \/\/\n vtkDebugMacro(\"Writing Binary STL file\");\n\n char szHeader[80+1];\n\n \/\/ Check for STL ASCII format key word 'solid'. According to STL file format\n \/\/ only ASCII files can have 'solid' as start key word, so we ignore it and\n \/\/ use VTK string instead.\n if (vtksys::SystemTools::StringStartsWith(this->Header, \"solid\"))\n {\n vtkDebugMacro(\"Invalid header for Binary STL file\");\n strcpy(szHeader, header);\n }\n else\n {\n memset(szHeader, 32, 80); \/\/ fill with space (ASCII=>32)\n sprintf(szHeader, \"%s\", this->Header);\n }\n\n if (fwrite (szHeader, 1, 80, fp) < 80)\n {\n fclose(fp);\n this->SetErrorCode(vtkErrorCode::OutOfDiskSpaceError);\n return;\n }\n\n ulint = (unsigned long int) polys->GetNumberOfCells();\n vtkByteSwap::Swap4LE(&ulint);\n if (fwrite (&ulint, 1, 4, fp) < 4)\n {\n fclose(fp);\n this->SetErrorCode(vtkErrorCode::OutOfDiskSpaceError);\n return;\n }\n\n \/\/ Write out triangle polygons. In not a triangle polygon, only first\n \/\/ three vertices are written.\n \/\/\n for (polys->InitTraversal(); polys->GetNextCell(npts,indx); )\n {\n pts->GetPoint(indx[0],v1);\n pts->GetPoint(indx[1],v2);\n pts->GetPoint(indx[2],v3);\n\n vtkTriangle::ComputeNormal(pts, npts, indx, dn);\n float n[3];\n n[0] = (float)dn[0];\n n[1] = (float)dn[1];\n n[2] = (float)dn[2];\n vtkByteSwap::Swap4LE(n);\n vtkByteSwap::Swap4LE(n+1);\n vtkByteSwap::Swap4LE(n+2);\n if (fwrite (n, 4, 3, fp) < 3)\n {\n fclose(fp);\n this->SetErrorCode(vtkErrorCode::OutOfDiskSpaceError);\n return;\n }\n\n n[0] = (float)v1[0]; n[1] = (float)v1[1]; n[2] = (float)v1[2];\n vtkByteSwap::Swap4LE(n);\n vtkByteSwap::Swap4LE(n+1);\n vtkByteSwap::Swap4LE(n+2);\n if (fwrite (n, 4, 3, fp) < 3)\n {\n fclose(fp);\n this->SetErrorCode(vtkErrorCode::OutOfDiskSpaceError);\n return;\n }\n\n n[0] = (float)v2[0]; n[1] = (float)v2[1]; n[2] = (float)v2[2];\n vtkByteSwap::Swap4LE(n);\n vtkByteSwap::Swap4LE(n+1);\n vtkByteSwap::Swap4LE(n+2);\n if (fwrite (n, 4, 3, fp) < 3)\n {\n fclose(fp);\n this->SetErrorCode(vtkErrorCode::OutOfDiskSpaceError);\n return;\n }\n\n n[0] = (float)v3[0]; n[1] = (float)v3[1]; n[2] = (float)v3[2];\n vtkByteSwap::Swap4LE(n);\n vtkByteSwap::Swap4LE(n+1);\n vtkByteSwap::Swap4LE(n+2);\n if (fwrite (n, 4, 3, fp) < 3)\n {\n fclose(fp);\n this->SetErrorCode(vtkErrorCode::OutOfDiskSpaceError);\n return;\n }\n\n if (fwrite (&ibuff2, 2, 1, fp) < 1)\n {\n fclose(fp);\n this->SetErrorCode(vtkErrorCode::OutOfDiskSpaceError);\n return;\n }\n }\n fclose (fp);\n}\n\n\/\/----------------------------------------------------------------------------\nvoid vtkSTLWriter::PrintSelf(ostream& os, vtkIndent indent)\n{\n this->Superclass::PrintSelf(os,indent);\n}\n\n\/\/----------------------------------------------------------------------------\nvtkPolyData* vtkSTLWriter::GetInput()\n{\n return vtkPolyData::SafeDownCast(this->Superclass::GetInput());\n}\n\n\/\/----------------------------------------------------------------------------\nvtkPolyData* vtkSTLWriter::GetInput(int port)\n{\n return vtkPolyData::SafeDownCast(this->Superclass::GetInput(port));\n}\n\n\/\/----------------------------------------------------------------------------\nint vtkSTLWriter::FillInputPortInformation(int, vtkInformation *info)\n{\n info->Set(vtkAlgorithm::INPUT_REQUIRED_DATA_TYPE(), \"vtkPolyData\");\n return 1;\n}\n<commit_msg>STLWriter: Raise an error for non-triangles<commit_after>\/*=========================================================================\n\n Program: Visualization Toolkit\n Module: vtkSTLWriter.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 \"vtkSTLWriter.h\"\n\n#include \"vtkByteSwap.h\"\n#include \"vtkCellArray.h\"\n#include \"vtkErrorCode.h\"\n#include \"vtkInformation.h\"\n#include \"vtkObjectFactory.h\"\n#include \"vtkPolyData.h\"\n#include \"vtkTriangle.h\"\n#include <vtksys\/SystemTools.hxx>\n\n#if !defined(_WIN32) || defined(__CYGWIN__)\n# include <unistd.h> \/* unlink *\/\n#else\n# include <io.h> \/* unlink *\/\n#endif\n\nvtkStandardNewMacro(vtkSTLWriter);\n\nstatic char header[]=\"Visualization Toolkit generated SLA File \";\n\nvtkSTLWriter::vtkSTLWriter()\n{\n this->FileType = VTK_ASCII;\n this->FileName = NULL;\n this->Header = new char[257];\n strcpy(this->Header, header);\n}\n\nvoid vtkSTLWriter::WriteData()\n{\n vtkPoints *pts;\n vtkCellArray *polys;\n vtkPolyData *input = this->GetInput();\n\n polys = input->GetPolys();\n pts = input->GetPoints();\n if (pts == NULL || polys == NULL )\n {\n vtkErrorMacro(<<\"No data to write!\");\n return;\n }\n\n if ( this->FileName == NULL)\n {\n vtkErrorMacro(<< \"Please specify FileName to write\");\n this->SetErrorCode(vtkErrorCode::NoFileNameError);\n return;\n }\n\n if ( this->FileType == VTK_BINARY )\n {\n this->WriteBinarySTL(pts,polys);\n if (this->ErrorCode == vtkErrorCode::OutOfDiskSpaceError)\n {\n vtkErrorMacro(\"Ran out of disk space; deleting file: \"\n << this->FileName);\n unlink(this->FileName);\n }\n }\n else\n {\n this->WriteAsciiSTL(pts,polys);\n if (this->ErrorCode == vtkErrorCode::OutOfDiskSpaceError)\n {\n vtkErrorMacro(\"Ran out of disk space; deleting file: \"\n << this->FileName);\n unlink(this->FileName);\n }\n }\n}\n\nvoid vtkSTLWriter::WriteAsciiSTL(vtkPoints *pts, vtkCellArray *polys)\n{\n FILE *fp;\n double n[3], v1[3], v2[3], v3[3];\n vtkIdType npts = 0;\n vtkIdType *indx = 0;\n\n if ((fp = fopen(this->FileName, \"w\")) == NULL)\n {\n vtkErrorMacro(<< \"Couldn't open file: \" << this->FileName);\n this->SetErrorCode(vtkErrorCode::CannotOpenFileError);\n return;\n }\n\/\/\n\/\/ Write header\n\/\/\n vtkDebugMacro(\"Writing ASCII sla file\");\n if (fprintf (fp, \"solid ascii\\n\") < 0)\n {\n fclose(fp);\n this->SetErrorCode(vtkErrorCode::OutOfDiskSpaceError);\n return;\n }\n\/\/\n\/\/ Write out triangle polygons. In not a triangle polygon, only first\n\/\/ three vertices are written.\n\/\/\n for (polys->InitTraversal(); polys->GetNextCell(npts,indx); )\n {\n if (npts > 3)\n {\n fclose(fp);\n vtkErrorMacro(<<\"STL file only supports triangles\");\n this->SetErrorCode(vtkErrorCode::FileFormatError);\n return;\n }\n\n pts->GetPoint(indx[0],v1);\n pts->GetPoint(indx[1],v2);\n pts->GetPoint(indx[2],v3);\n\n vtkTriangle::ComputeNormal(pts, npts, indx, n);\n\n if (fprintf (fp, \" facet normal %.6g %.6g %.6g\\n outer loop\\n\",\n n[0], n[1], n[2]) < 0)\n {\n fclose(fp);\n this->SetErrorCode(vtkErrorCode::OutOfDiskSpaceError);\n return;\n }\n\n if (fprintf (fp, \" vertex %.6g %.6g %.6g\\n\", v1[0], v1[1], v1[2]) < 0)\n {\n fclose(fp);\n this->SetErrorCode(vtkErrorCode::OutOfDiskSpaceError);\n return;\n }\n if (fprintf (fp, \" vertex %.6g %.6g %.6g\\n\", v2[0], v2[1], v2[2]) < 0)\n {\n fclose(fp);\n this->SetErrorCode(vtkErrorCode::OutOfDiskSpaceError);\n return;\n }\n if (fprintf (fp, \" vertex %.6g %.6g %.6g\\n\", v3[0], v3[1], v3[2]) < 0)\n {\n fclose(fp);\n this->SetErrorCode(vtkErrorCode::OutOfDiskSpaceError);\n return;\n }\n\n if (fprintf (fp, \" endloop\\n endfacet\\n\") < 0)\n {\n fclose(fp);\n this->SetErrorCode(vtkErrorCode::OutOfDiskSpaceError);\n return;\n }\n }\n if (fprintf (fp, \"endsolid\\n\") < 0)\n {\n this->SetErrorCode(vtkErrorCode::OutOfDiskSpaceError);\n }\n fclose (fp);\n}\n\nvoid vtkSTLWriter::WriteBinarySTL(vtkPoints *pts, vtkCellArray *polys)\n{\n FILE *fp;\n double dn[3], v1[3], v2[3], v3[3];\n vtkIdType npts = 0;\n vtkIdType *indx = 0;\n unsigned long ulint;\n unsigned short ibuff2=0;\n\n if ((fp = fopen(this->FileName, \"wb\")) == NULL)\n {\n vtkErrorMacro(<< \"Couldn't open file: \" << this->FileName);\n this->SetErrorCode(vtkErrorCode::CannotOpenFileError);\n return;\n }\n\n \/\/ Write header\n \/\/\n vtkDebugMacro(\"Writing Binary STL file\");\n\n char szHeader[80+1];\n\n \/\/ Check for STL ASCII format key word 'solid'. According to STL file format\n \/\/ only ASCII files can have 'solid' as start key word, so we ignore it and\n \/\/ use VTK string instead.\n if (vtksys::SystemTools::StringStartsWith(this->Header, \"solid\"))\n {\n vtkDebugMacro(\"Invalid header for Binary STL file\");\n strcpy(szHeader, header);\n }\n else\n {\n memset(szHeader, 32, 80); \/\/ fill with space (ASCII=>32)\n sprintf(szHeader, \"%s\", this->Header);\n }\n\n if (fwrite (szHeader, 1, 80, fp) < 80)\n {\n fclose(fp);\n this->SetErrorCode(vtkErrorCode::OutOfDiskSpaceError);\n return;\n }\n\n ulint = (unsigned long int) polys->GetNumberOfCells();\n vtkByteSwap::Swap4LE(&ulint);\n if (fwrite (&ulint, 1, 4, fp) < 4)\n {\n fclose(fp);\n this->SetErrorCode(vtkErrorCode::OutOfDiskSpaceError);\n return;\n }\n\n \/\/ Write out triangle polygons. In not a triangle polygon, only first\n \/\/ three vertices are written.\n \/\/\n for (polys->InitTraversal(); polys->GetNextCell(npts,indx); )\n {\n if (npts > 3)\n {\n fclose(fp);\n vtkErrorMacro(<<\"STL file only supports triangles\");\n this->SetErrorCode(vtkErrorCode::FileFormatError);\n return;\n }\n\n pts->GetPoint(indx[0],v1);\n pts->GetPoint(indx[1],v2);\n pts->GetPoint(indx[2],v3);\n\n vtkTriangle::ComputeNormal(pts, npts, indx, dn);\n float n[3];\n n[0] = (float)dn[0];\n n[1] = (float)dn[1];\n n[2] = (float)dn[2];\n vtkByteSwap::Swap4LE(n);\n vtkByteSwap::Swap4LE(n+1);\n vtkByteSwap::Swap4LE(n+2);\n if (fwrite (n, 4, 3, fp) < 3)\n {\n fclose(fp);\n this->SetErrorCode(vtkErrorCode::OutOfDiskSpaceError);\n return;\n }\n\n n[0] = (float)v1[0]; n[1] = (float)v1[1]; n[2] = (float)v1[2];\n vtkByteSwap::Swap4LE(n);\n vtkByteSwap::Swap4LE(n+1);\n vtkByteSwap::Swap4LE(n+2);\n if (fwrite (n, 4, 3, fp) < 3)\n {\n fclose(fp);\n this->SetErrorCode(vtkErrorCode::OutOfDiskSpaceError);\n return;\n }\n\n n[0] = (float)v2[0]; n[1] = (float)v2[1]; n[2] = (float)v2[2];\n vtkByteSwap::Swap4LE(n);\n vtkByteSwap::Swap4LE(n+1);\n vtkByteSwap::Swap4LE(n+2);\n if (fwrite (n, 4, 3, fp) < 3)\n {\n fclose(fp);\n this->SetErrorCode(vtkErrorCode::OutOfDiskSpaceError);\n return;\n }\n\n n[0] = (float)v3[0]; n[1] = (float)v3[1]; n[2] = (float)v3[2];\n vtkByteSwap::Swap4LE(n);\n vtkByteSwap::Swap4LE(n+1);\n vtkByteSwap::Swap4LE(n+2);\n if (fwrite (n, 4, 3, fp) < 3)\n {\n fclose(fp);\n this->SetErrorCode(vtkErrorCode::OutOfDiskSpaceError);\n return;\n }\n\n if (fwrite (&ibuff2, 2, 1, fp) < 1)\n {\n fclose(fp);\n this->SetErrorCode(vtkErrorCode::OutOfDiskSpaceError);\n return;\n }\n }\n fclose (fp);\n}\n\n\/\/----------------------------------------------------------------------------\nvoid vtkSTLWriter::PrintSelf(ostream& os, vtkIndent indent)\n{\n this->Superclass::PrintSelf(os,indent);\n}\n\n\/\/----------------------------------------------------------------------------\nvtkPolyData* vtkSTLWriter::GetInput()\n{\n return vtkPolyData::SafeDownCast(this->Superclass::GetInput());\n}\n\n\/\/----------------------------------------------------------------------------\nvtkPolyData* vtkSTLWriter::GetInput(int port)\n{\n return vtkPolyData::SafeDownCast(this->Superclass::GetInput(port));\n}\n\n\/\/----------------------------------------------------------------------------\nint vtkSTLWriter::FillInputPortInformation(int, vtkInformation *info)\n{\n info->Set(vtkAlgorithm::INPUT_REQUIRED_DATA_TYPE(), \"vtkPolyData\");\n return 1;\n}\n<|endoftext|>"} {"text":"<commit_before>\/*\r\n * Copyright 2005, 2006, 2007 Florian Schmitz\r\n *\r\n * This file is part of CSSTidy.\r\n *\r\n * CSSTidy is free software; you can redistribute it and\/or modify\r\n * it under the terms of the GNU Lesser General Public License as published by\r\n * the Free Software Foundation; either version 2.1 of the License, or\r\n * (at your option) any later version.\r\n *\r\n * CSSTidy is distributed in the hope that it will be useful,\r\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\r\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the\r\n * GNU Lesser General Public License for more details.\r\n * \r\n * You should have received a copy of the GNU Lesser General Public License\r\n * along with this program. If not, see <http:\/\/www.gnu.org\/licenses\/>.\r\n*\/\r\n \r\n#include \"csspp_globals.hpp\"\r\nusing namespace std;\r\n\r\nextern vector<string> unit_values,color_values;\r\nextern map<string,string> replace_colors,all_properties;\r\n\r\nstring shorthand(string value)\r\n{\r\n\tstring important = \"\";\r\n\t\r\n\tif(is_important(value))\r\n\t{\r\n\t\tvalue = gvw_important(value);\r\n\t\timportant = \"!important\";\r\n\t}\r\n\t\r\n\tvector<string> values = explode(\" \",value);\r\n\tswitch(values.size())\r\n\t{\r\n\t\tcase 4:\r\n\t\tif(values[0] == values[1] && values[0] == values[2] && values[0] == values[3])\r\n\t\t{\r\n\t\t\treturn values[0] + important;\r\n\t\t}\r\n\t\telse if(values[1] == values[3] && values[0] == values[2])\r\n\t\t{\r\n\t\t\treturn values[0] + \" \" + values[1] + important;\r\n\t\t}\r\n\t\telse if(values[1] == values[3])\r\n\t\t{\r\n\t\t\treturn values[0] + \" \" + values[1] + \" \" + values[2] + important;\r\n\t\t}\r\n\t\telse return value + important;\r\n\t\tbreak;\r\n\t\t\r\n\t\tcase 3:\r\n\t\tif(values[0] == values[1] && values[0] == values[2])\r\n\t\t{\r\n\t\t\treturn values[0] + important;\r\n\t\t}\r\n\t\telse if(values[0] == values[2])\r\n\t\t{\r\n\t\t\treturn values[0] + \" \" + values[1] + important;\r\n\t\t}\r\n\t\telse return value + important;\r\n\t\tbreak;\r\n\t\t\r\n\t\tcase 2:\r\n\t\tif(values[0] == values[1])\r\n\t\t{\r\n\t\t\treturn values[0] + important;\r\n\t\t}\r\n\t\telse return value + important;\r\n\t\tbreak;\r\n\t\t\r\n\t\tdefault:\r\n\t\treturn value + important;\r\n\t}\r\n}\r\n\r\nstring compress_numbers(string subvalue, string property, string function)\r\n{\r\n\tstring units[] = {\"in\", \"cm\", \"mm\", \"pt\", \"pc\", \"px\", \"rem\", \"%\", \"ex\", \"gd\", \"em\", \"vw\", \"vh\",\r\n\t \"vm\", \"ch\", \"deg\", \"grad\", \"rad\", \"turn\", \"ms\", \"s\", \"khz\", \"hz\" }; \/\/ sync for loop\r\n\t \r\n\tvector<string> temp;\r\n\tif(property == \"font\")\r\n\t{\r\n\t\ttemp = explode(\"\/\",subvalue);\r\n\t}\r\n\telse\r\n\t{\r\n\t\ttemp.push_back(subvalue);\r\n\t}\r\n\t\t\r\n\tfor (int i = 0; i < temp.size(); ++i)\r\n\t{\r\n\t\tif(!(temp[i].length() > 0 && (ctype_digit(temp[i][0]) || temp[i][0] == '+' || temp[i][0] == '-' ) ))\r\n\t\t{\r\n\t\t\tcontinue;\r\n\t\t}\r\n\t\t\r\n\t\tif(function == \"\" && in_str_array(color_values,property))\r\n\t\t{\r\n\t\t\ttemp[i] = \"#\" + temp[i];\r\n\t\t\t\/\/csstidy::log(\"Inserting missing '#'\", Warning); \/\/ FIXME: Make log() a static method\r\n\t\t}\r\n\t\r\n\t\tif(str2f(temp[i]) == 0)\r\n\t\t{\r\n\t\t\ttemp[i] = \"0\";\r\n\t\t}\r\n\t\telse\r\n\t\t{\r\n\t\t\tbool unit_found = false;\r\n\t\t\ttemp[i] = strtolower(temp[i]);\r\n\t\t\tfor(int j = 0; j < 21; ++j )\r\n\t\t\t{\r\n\t\t\t\tif(temp[i].find(units[j]) != string::npos)\r\n\t\t\t\t{\r\n\t\t\t\t\ttemp[i] = f2str(str2f(temp[i])) + units[j];\r\n\t\t\t\t\tunit_found = true;\r\n\t\t\t\t\tbreak;\r\n\t\t\t\t}\r\n\t\t\t}\r\n\t\t\tif(function == \"\" && !unit_found && in_str_array(unit_values,property))\r\n\t\t\t{\r\n\t\t\t\ttemp[i] = f2str(str2f(temp[i]));\r\n\t\t\t\ttemp[i] += \"px\";\r\n\t\t\t\t\/\/csstidy::log(\"Unit required, inserting 'px'\", Warning); \/\/ FIXME: Make log() a static method\r\n\t\t\t}\r\n\t\t\telse if(!unit_found)\r\n\t\t\t{\r\n\t\t\t\ttemp[i] = f2str(str2f(temp[i]));\r\n\t\t\t}\r\n\t\t\t\/\/ Remove leading zero\r\n if (abs( (int) str2f(temp[i])) < 1) {\r\n if (str2f(temp[i]) < 0) {\r\n temp[i] = '-' + temp[i].substr(2);\r\n } else {\r\n temp[i] = temp[i].substr(1);\r\n }\r\n } \r\n\t\t}\r\n\t}\t\r\n\t\t\r\n\treturn (temp.size() > 1) ? temp[0] + \"\/\" + temp[1] : ((temp.size() > 0) ? temp[0] : \"\");\r\n}\r\n\r\nbool property_is_next(string istring, int pos)\r\n{\r\n\tistring = istring.substr(pos,istring.length()-pos);\r\n\tpos = istring.find_first_of(':',0);\r\n\tif(pos == string::npos)\r\n\t{\r\n\t\treturn false;\r\n\t}\r\n\tistring = strtolower(trim(istring.substr(0,pos)));\r\n\treturn (all_properties.count(istring) > 0);\r\n}\r\n\r\nstring cut_color(string color)\r\n{\r\n\tif(strtolower(color.substr(0,4)) == \"rgb(\")\r\n\t{\r\n\t\tvector<string> color_tmp = explode(\",\",color.substr(4,color.length()-5));\r\n\r\n\t\tfor (int i = 0; i < color_tmp.size(); ++i)\r\n\t\t{\r\n\t\t\tcolor_tmp[i] = trim(color_tmp[i]);\r\n\t\t\tif(color_tmp[i].at(color_tmp[i].length()-1) == '%')\r\n\t\t\t{\r\n\t\t\t\tcolor_tmp[i] = f2str(round(255 * atoi(color_tmp[i].c_str())\/100,0));\r\n\t\t\t}\r\n\t\t\tif(atoi(color_tmp[i].c_str()) > 255) color_tmp[i] = 255;\r\n\t\t}\r\n\t\t\r\n\t\tcolor = \"#\";\r\n\t\tfor (int i = 0; i < color_tmp.size(); ++i)\r\n\t\t{\r\n\t\t\tif(atoi(color_tmp[i].c_str()) < 16)\r\n\t\t\t{\r\n\t\t\t\tcolor += \"0\" + dechex(atoi(color_tmp[i].c_str()));\r\n\t\t\t}\r\n\t\t\telse\r\n\t\t\t{\r\n\t\t\t\tcolor += dechex(atoi(color_tmp[i].c_str()));\r\n\t\t\t}\r\n\t\t}\r\n\t}\r\n\r\n\t\/\/ Fix bad color names\r\n\tif(replace_colors.count(strtolower(color)) > 0)\r\n\t{\r\n\t\tcolor = replace_colors[strtolower(color)];\r\n\t}\r\n\r\n\tif(color.length() == 7)\r\n\t{\r\n\t\tstring color_temp = strtoupper(color);\r\n\r\n\t\tif(color_temp[0] == '#' && color_temp[1] == color_temp[2] && color_temp[3] == color_temp[4] && color_temp[5] == color_temp[6])\r\n\t\t{\r\n\t\t\tcolor = \"#\";\r\n\t\t\tcolor += color_temp[2];\r\n\t\t\tcolor += color_temp[3];\r\n\t\t\tcolor += color_temp[5];\r\n\t\t}\r\n\t}\r\n\r\n\tstring temp = strtolower(color);\r\n\t\/* color name -> hex code *\/\r\n\tif(temp == \"black\")\t\treturn \"#000\";\r\n\tif(temp == \"fuchsia\")\treturn \"#F0F\";\r\n\tif(temp == \"white\")\t\treturn \"#FFF\";\r\n\tif(temp == \"yellow\")\treturn \"#FF0\";\t\t\r\n\t\/* hex code -> color name *\/\r\n\tif(temp == \"#800000\")\treturn \"maroon\";\r\n\tif(temp == \"#ffa500\")\treturn \"orange\";\r\n\tif(temp == \"#808000\")\treturn \"olive\";\r\n\tif(temp == \"#800080\")\treturn \"purple\";\r\n\tif(temp == \"#008000\")\treturn \"green\";\r\n\tif(temp == \"#000080\")\treturn \"navy\";\r\n\tif(temp == \"#008080\")\treturn \"teal\";\r\n\tif(temp == \"#c0c0c0\")\treturn \"silver\";\r\n\tif(temp == \"#808080\")\treturn \"gray\";\r\n\tif(temp == \"#f00\")\t\treturn \"red\";\t\r\n\r\n\treturn color;\r\n}\r\n\r\nint c_font_weight(string& value)\r\n{\r\n\tstring important = \"\";\r\n\tif(is_important(value))\r\n\t{\r\n\t\timportant = \"!important\";\r\n\t\tvalue = gvw_important(value);\r\n\t}\r\n\tif(value == \"bold\")\r\n\t{\r\n\t\tvalue = \"700\"+important;\r\n\t\treturn 700;\r\n\t}\r\n\telse if(value == \"normal\")\r\n\t{\r\n\t\tvalue = \"400\"+important;\r\n\t\treturn 400;\r\n\t}\r\n\treturn 0;\r\n}\r\n\r\n\r\nvoid merge_selectors(sstore& input)\r\n{\r\n\tfor(sstore::iterator i = input.begin(), e = input.end(); i != e;)\r\n\t{\r\n\t\tstring newsel = \"\";\r\n\t\r\n\t\t\/\/ Check if properties also exist in another selector\r\n\t\tvector<string> keys;\r\n\t\tfor(sstore::iterator j = input.begin(); j != input.end(); j++ )\r\n\t\t{\r\n\t\t\tif(j->first == i->first)\r\n\t\t\t{\r\n\t\t\t\tcontinue;\r\n\t\t\t}\r\n\t\t\t\r\n\t\t\tif(input[j->first] == input[i->first])\r\n\t\t\t{\r\n\t\t\t\tkeys.push_back(j->first);\r\n\t\t\t}\r\n\t\t}\r\n\r\n\t\tif(keys.size() > 0)\r\n\t\t{\r\n\t\t\tnewsel = i->first;\r\n\r\n\t\t\tfor(int k = 0; k < keys.size(); ++k)\r\n\t\t\t{\r\n\t\t\t\tinput.erase(keys[k]);\r\n\t\t\t\tnewsel += \",\" + keys[k];\r\n\t\t\t}\r\n\r\n\t\t\tinput[newsel] = i->second;\r\n\t\t\t\r\n\t\t\tinput.erase(i);\r\n\t\t\te = input.end();\r\n\t\t} else {\r\n\t\t\ti++;\r\n\t\t}\r\n\t}\r\n}\r\n<commit_msg>Added new CSS 3 units (“ch” and “turn”). http:\/\/www.w3.org\/TR\/css3-values\/#relative0<commit_after>\/*\r\n * Copyright 2005, 2006, 2007 Florian Schmitz\r\n *\r\n * This file is part of CSSTidy.\r\n *\r\n * CSSTidy is free software; you can redistribute it and\/or modify\r\n * it under the terms of the GNU Lesser General Public License as published by\r\n * the Free Software Foundation; either version 2.1 of the License, or\r\n * (at your option) any later version.\r\n *\r\n * CSSTidy is distributed in the hope that it will be useful,\r\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\r\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the\r\n * GNU Lesser General Public License for more details.\r\n * \r\n * You should have received a copy of the GNU Lesser General Public License\r\n * along with this program. If not, see <http:\/\/www.gnu.org\/licenses\/>.\r\n*\/\r\n \r\n#include \"csspp_globals.hpp\"\r\nusing namespace std;\r\n\r\nextern vector<string> unit_values,color_values;\r\nextern map<string,string> replace_colors,all_properties;\r\n\r\nstring shorthand(string value)\r\n{\r\n\tstring important = \"\";\r\n\t\r\n\tif(is_important(value))\r\n\t{\r\n\t\tvalue = gvw_important(value);\r\n\t\timportant = \"!important\";\r\n\t}\r\n\t\r\n\tvector<string> values = explode(\" \",value);\r\n\tswitch(values.size())\r\n\t{\r\n\t\tcase 4:\r\n\t\tif(values[0] == values[1] && values[0] == values[2] && values[0] == values[3])\r\n\t\t{\r\n\t\t\treturn values[0] + important;\r\n\t\t}\r\n\t\telse if(values[1] == values[3] && values[0] == values[2])\r\n\t\t{\r\n\t\t\treturn values[0] + \" \" + values[1] + important;\r\n\t\t}\r\n\t\telse if(values[1] == values[3])\r\n\t\t{\r\n\t\t\treturn values[0] + \" \" + values[1] + \" \" + values[2] + important;\r\n\t\t}\r\n\t\telse return value + important;\r\n\t\tbreak;\r\n\t\t\r\n\t\tcase 3:\r\n\t\tif(values[0] == values[1] && values[0] == values[2])\r\n\t\t{\r\n\t\t\treturn values[0] + important;\r\n\t\t}\r\n\t\telse if(values[0] == values[2])\r\n\t\t{\r\n\t\t\treturn values[0] + \" \" + values[1] + important;\r\n\t\t}\r\n\t\telse return value + important;\r\n\t\tbreak;\r\n\t\t\r\n\t\tcase 2:\r\n\t\tif(values[0] == values[1])\r\n\t\t{\r\n\t\t\treturn values[0] + important;\r\n\t\t}\r\n\t\telse return value + important;\r\n\t\tbreak;\r\n\t\t\r\n\t\tdefault:\r\n\t\treturn value + important;\r\n\t}\r\n}\r\n\r\nstring compress_numbers(string subvalue, string property, string function)\r\n{\r\n\tstring units[] = {\"in\", \"cm\", \"mm\", \"pt\", \"pc\", \"px\", \"rem\", \"%\", \"ex\", \"gd\", \"em\", \"vw\", \"vh\",\r\n\t \"vm\", \"ch\", \"deg\", \"grad\", \"rad\", \"turn\", \"ms\", \"s\", \"khz\", \"hz\" }; \/\/ sync for loop\r\n\t \r\n\tvector<string> temp;\r\n\tif(property == \"font\")\r\n\t{\r\n\t\ttemp = explode(\"\/\",subvalue);\r\n\t}\r\n\telse\r\n\t{\r\n\t\ttemp.push_back(subvalue);\r\n\t}\r\n\t\t\r\n\tfor (int i = 0; i < temp.size(); ++i)\r\n\t{\r\n\t\tif(!(temp[i].length() > 0 && (ctype_digit(temp[i][0]) || temp[i][0] == '+' || temp[i][0] == '-' ) ))\r\n\t\t{\r\n\t\t\tcontinue;\r\n\t\t}\r\n\t\t\r\n\t\tif(function == \"\" && in_str_array(color_values,property))\r\n\t\t{\r\n\t\t\ttemp[i] = \"#\" + temp[i];\r\n\t\t\t\/\/csstidy::log(\"Inserting missing '#'\", Warning); \/\/ FIXME: Make log() a static method\r\n\t\t}\r\n\t\r\n\t\tif(str2f(temp[i]) == 0)\r\n\t\t{\r\n\t\t\ttemp[i] = \"0\";\r\n\t\t}\r\n\t\telse\r\n\t\t{\r\n\t\t\tbool unit_found = false;\r\n\t\t\ttemp[i] = strtolower(temp[i]);\r\n\t\t\tfor(int j = 0; j < 21; ++j )\r\n\t\t\t{\r\n\t\t\t\tif(temp[i].find(units[j]) != string::npos)\r\n\t\t\t\t{\r\n\t\t\t\t\ttemp[i] = f2str(str2f(temp[i])) + units[j];\r\n\t\t\t\t\tunit_found = true;\r\n\t\t\t\t\tbreak;\r\n\t\t\t\t}\r\n\t\t\t}\r\n\t\t\tif(function == \"\" && !unit_found && in_str_array(unit_values,property))\r\n\t\t\t{\r\n\t\t\t\ttemp[i] = f2str(str2f(temp[i]));\r\n\t\t\t\ttemp[i] += \"px\";\r\n\t\t\t\t\/\/csstidy::log(\"Unit required, inserting 'px'\", Warning); \/\/ FIXME: Make log() a static method\r\n\t\t\t}\r\n\t\t\telse if(!unit_found)\r\n\t\t\t{\r\n\t\t\t\ttemp[i] = f2str(str2f(temp[i]));\r\n\t\t\t}\r\n\t\t\t\/\/ Remove leading zero\r\n if (abs( (int) str2f(temp[i])) < 1) {\r\n if (str2f(temp[i]) < 0) {\r\n temp[i] = '-' + temp[i].substr(2);\r\n } else {\r\n temp[i] = temp[i].substr(1);\r\n }\r\n } \r\n\t\t}\r\n\t}\t\r\n\t\t\r\n\treturn (temp.size() > 1) ? temp[0] + \"\/\" + temp[1] : ((temp.size() > 0) ? temp[0] : \"\");\r\n}\r\n\r\nbool property_is_next(string istring, int pos)\r\n{\r\n\tistring = istring.substr(pos,istring.length()-pos);\r\n\tpos = istring.find_first_of(':',0);\r\n\tif(pos == string::npos)\r\n\t{\r\n\t\treturn false;\r\n\t}\r\n\tistring = strtolower(trim(istring.substr(0,pos)));\r\n\treturn (all_properties.count(istring) > 0);\r\n}\r\n\r\nstring cut_color(string color)\r\n{\r\n\tif(strtolower(color.substr(0,4)) == \"rgb(\")\r\n\t{\r\n\t\tvector<string> color_tmp = explode(\",\",color.substr(4,color.length()-5));\r\n\r\n\t\tfor (int i = 0; i < color_tmp.size(); ++i)\r\n\t\t{\r\n\t\t\tcolor_tmp[i] = trim(color_tmp[i]);\r\n\t\t\tif(color_tmp[i].at(color_tmp[i].length()-1) == '%')\r\n\t\t\t{\r\n\t\t\t\tcolor_tmp[i] = f2str(round(255 * atoi(color_tmp[i].c_str())\/100,0));\r\n\t\t\t}\r\n\t\t\tif(atoi(color_tmp[i].c_str()) > 255) color_tmp[i] = 255;\r\n\t\t}\r\n\t\t\r\n\t\tcolor = \"#\";\r\n\t\tfor (int i = 0; i < color_tmp.size(); ++i)\r\n\t\t{\r\n\t\t\tif(atoi(color_tmp[i].c_str()) < 16)\r\n\t\t\t{\r\n\t\t\t\tcolor += \"0\" + dechex(atoi(color_tmp[i].c_str()));\r\n\t\t\t}\r\n\t\t\telse\r\n\t\t\t{\r\n\t\t\t\tcolor += dechex(atoi(color_tmp[i].c_str()));\r\n\t\t\t}\r\n\t\t}\r\n\t}\r\n\r\n\t\/\/ Fix bad color names\r\n\tif(replace_colors.count(strtolower(color)) > 0)\r\n\t{\r\n\t\tcolor = replace_colors[strtolower(color)];\r\n\t}\r\n\r\n\tif(color.length() == 7)\r\n\t{\r\n\t\tstring color_temp = strtoupper(color);\r\n\r\n\t\tif(color_temp[0] == '#' && color_temp[1] == color_temp[2] && color_temp[3] == color_temp[4] && color_temp[5] == color_temp[6])\r\n\t\t{\r\n\t\t\tcolor = \"#\";\r\n\t\t\tcolor += color_temp[2];\r\n\t\t\tcolor += color_temp[3];\r\n\t\t\tcolor += color_temp[5];\r\n\t\t}\r\n\t}\r\n\r\n\tstring temp = strtolower(color);\r\n\t\/* color name -> hex code *\/\r\n\tif(temp == \"black\")\t\treturn \"#000\";\r\n\tif(temp == \"fuchsia\")\treturn \"#f0f\";\r\n\tif(temp == \"white\")\t\treturn \"#fff\";\r\n\tif(temp == \"yellow\")\treturn \"#ff0\";\t\t\r\n\t\/* hex code -> color name *\/\r\n\tif(temp == \"#800000\")\treturn \"maroon\";\r\n\tif(temp == \"#ffa500\")\treturn \"orange\";\r\n\tif(temp == \"#808000\")\treturn \"olive\";\r\n\tif(temp == \"#800080\")\treturn \"purple\";\r\n\tif(temp == \"#008000\")\treturn \"green\";\r\n\tif(temp == \"#000080\")\treturn \"navy\";\r\n\tif(temp == \"#008080\")\treturn \"teal\";\r\n\tif(temp == \"#c0c0c0\")\treturn \"silver\";\r\n\tif(temp == \"#808080\")\treturn \"gray\";\r\n\tif(temp == \"#f00\")\t\treturn \"red\";\t\r\n\r\n\treturn color;\r\n}\r\n\r\nint c_font_weight(string& value)\r\n{\r\n\tstring important = \"\";\r\n\tif(is_important(value))\r\n\t{\r\n\t\timportant = \"!important\";\r\n\t\tvalue = gvw_important(value);\r\n\t}\r\n\tif(value == \"bold\")\r\n\t{\r\n\t\tvalue = \"700\"+important;\r\n\t\treturn 700;\r\n\t}\r\n\telse if(value == \"normal\")\r\n\t{\r\n\t\tvalue = \"400\"+important;\r\n\t\treturn 400;\r\n\t}\r\n\treturn 0;\r\n}\r\n\r\n\r\nvoid merge_selectors(sstore& input)\r\n{\r\n\tfor(sstore::iterator i = input.begin(), e = input.end(); i != e;)\r\n\t{\r\n\t\tstring newsel = \"\";\r\n\t\r\n\t\t\/\/ Check if properties also exist in another selector\r\n\t\tvector<string> keys;\r\n\t\tfor(sstore::iterator j = input.begin(); j != input.end(); j++ )\r\n\t\t{\r\n\t\t\tif(j->first == i->first)\r\n\t\t\t{\r\n\t\t\t\tcontinue;\r\n\t\t\t}\r\n\t\t\t\r\n\t\t\tif(input[j->first] == input[i->first])\r\n\t\t\t{\r\n\t\t\t\tkeys.push_back(j->first);\r\n\t\t\t}\r\n\t\t}\r\n\r\n\t\tif(keys.size() > 0)\r\n\t\t{\r\n\t\t\tnewsel = i->first;\r\n\r\n\t\t\tfor(int k = 0; k < keys.size(); ++k)\r\n\t\t\t{\r\n\t\t\t\tinput.erase(keys[k]);\r\n\t\t\t\tnewsel += \",\" + keys[k];\r\n\t\t\t}\r\n\r\n\t\t\tinput[newsel] = i->second;\r\n\t\t\t\r\n\t\t\tinput.erase(i);\r\n\t\t\te = input.end();\r\n\t\t} else {\r\n\t\t\ti++;\r\n\t\t}\r\n\t}\r\n}\r\n<|endoftext|>"} {"text":"<commit_before>\/\/ LAF OS Library\n\/\/ Copyright (C) 2017 David Capello\n\/\/\n\/\/ This file is released under the terms of the MIT license.\n\/\/ Read LICENSE.txt for more information.\n\n#ifdef HAVE_CONFIG_H\n#include \"config.h\"\n#endif\n\n#include \"os\/draw_text.h\"\n\n#include \"ft\/algorithm.h\"\n#include \"ft\/hb_shaper.h\"\n#include \"gfx\/clip.h\"\n#include \"os\/common\/freetype_font.h\"\n#include \"os\/common\/generic_surface.h\"\n#include \"os\/common\/sprite_sheet_font.h\"\n\nnamespace os {\n\ngfx::Rect draw_text(Surface* surface, Font* font,\n const base::utf8_const_iterator& begin,\n const base::utf8_const_iterator& end,\n gfx::Color fg, gfx::Color bg,\n int x, int y,\n DrawTextDelegate* delegate)\n{\n base::utf8_const_iterator it = begin;\n gfx::Rect textBounds;\n\nretry:;\n \/\/ Check if this font is enough to draw the given string or we will\n \/\/ need the fallback for some special Unicode chars\n if (font->fallback()) {\n \/\/ TODO compose unicode characters and check those codepoints, the\n \/\/ same in the drawing code of sprite sheet font\n for (auto it=begin; it!=end; ++it) {\n uint32_t code = *it;\n if (code && !font->hasCodePoint(code)) {\n Font* newFont = font->fallback();\n\n \/\/ Search a valid fallback\n while (newFont && !newFont->hasCodePoint(code))\n newFont = newFont->fallback();\n if (!newFont)\n break;\n\n y += font->height()\/2 - newFont->height()\/2;\n\n font = newFont;\n goto retry;\n }\n }\n }\n\n switch (font->type()) {\n\n case FontType::kSpriteSheet: {\n SpriteSheetFont* ssFont = static_cast<SpriteSheetFont*>(font);\n Surface* sheet = ssFont->getSurfaceSheet();\n\n if (surface) {\n sheet->lock();\n surface->lock();\n }\n\n while (it != end) {\n int chr = *it;\n if (delegate) {\n int i = it-begin;\n delegate->preProcessChar(i, chr, fg, bg);\n }\n\n gfx::Rect charBounds = ssFont->getCharBounds(chr);\n gfx::Rect outCharBounds(x, y, charBounds.w, charBounds.h);\n if (delegate && !delegate->preDrawChar(outCharBounds))\n break;\n\n if (!charBounds.isEmpty()) {\n if (surface)\n surface->drawColoredRgbaSurface(sheet, fg, bg, gfx::Clip(x, y, charBounds));\n }\n\n textBounds |= outCharBounds;\n if (delegate)\n delegate->postDrawChar(outCharBounds);\n\n x += charBounds.w;\n ++it;\n }\n\n if (surface) {\n surface->unlock();\n sheet->unlock();\n }\n break;\n }\n\n case FontType::kTrueType: {\n FreeTypeFont* ttFont = static_cast<FreeTypeFont*>(font);\n bool antialias = ttFont->face().antialias();\n int fg_alpha = gfx::geta(fg);\n\n gfx::Rect clipBounds;\n os::SurfaceFormatData fd;\n if (surface) {\n clipBounds = surface->getClipBounds();\n surface->getFormat(&fd);\n surface->lock();\n }\n\n ft::ForEachGlyph<FreeTypeFont::Face> feg(ttFont->face());\n if (feg.initialize(it, end)) {\n do {\n if (delegate) {\n delegate->preProcessChar(feg.charIndex(),\n feg.unicodeChar(), fg, bg);\n }\n\n auto glyph = feg.glyph();\n if (!glyph)\n continue;\n\n gfx::Rect origDstBounds(\n x + int(glyph->startX),\n y + int(glyph->y),\n int(glyph->endX) - int(glyph->startX),\n int(glyph->bitmap->rows) ? int(glyph->bitmap->rows): 1);\n\n if (delegate && !delegate->preDrawChar(origDstBounds))\n break;\n\n origDstBounds.x = x + int(glyph->x);\n origDstBounds.w = int(glyph->bitmap->width);\n origDstBounds.h = int(glyph->bitmap->rows);\n\n gfx::Rect dstBounds = origDstBounds;\n if (surface)\n dstBounds &= clipBounds;\n\n if (surface && !dstBounds.isEmpty()) {\n int clippedRows = dstBounds.y - origDstBounds.y;\n int dst_y = dstBounds.y;\n int t;\n for (int v=0; v<dstBounds.h; ++v, ++dst_y) {\n int bit = 0;\n const uint8_t* p = glyph->bitmap->buffer\n + (v+clippedRows)*glyph->bitmap->pitch;\n int dst_x = dstBounds.x;\n uint32_t* dst_address =\n (uint32_t*)surface->getData(dst_x, dst_y);\n\n \/\/ Skip first clipped pixels\n for (int u=0; u<dstBounds.x-origDstBounds.x; ++u) {\n if (antialias) {\n ++p;\n }\n else {\n if (bit == 8) {\n bit = 0;\n ++p;\n }\n }\n }\n\n for (int u=0; u<dstBounds.w; ++u, ++dst_x) {\n ASSERT(clipBounds.contains(gfx::Point(dst_x, dst_y)));\n\n int alpha;\n if (antialias) {\n alpha = *(p++);\n }\n else {\n alpha = ((*p) & (1 << (7 - (bit++))) ? 255: 0);\n if (bit == 8) {\n bit = 0;\n ++p;\n }\n }\n\n uint32_t backdrop = *dst_address;\n gfx::Color backdropColor =\n gfx::rgba(\n ((backdrop & fd.redMask) >> fd.redShift),\n ((backdrop & fd.greenMask) >> fd.greenShift),\n ((backdrop & fd.blueMask) >> fd.blueShift),\n ((backdrop & fd.alphaMask) >> fd.alphaShift));\n\n gfx::Color output = gfx::rgba(gfx::getr(fg),\n gfx::getg(fg),\n gfx::getb(fg),\n MUL_UN8(fg_alpha, alpha, t));\n if (gfx::geta(bg) > 0)\n output = blend(blend(backdropColor, bg), output);\n else\n output = blend(backdropColor, output);\n\n *dst_address =\n ((gfx::getr(output) << fd.redShift ) & fd.redMask ) |\n ((gfx::getg(output) << fd.greenShift) & fd.greenMask) |\n ((gfx::getb(output) << fd.blueShift ) & fd.blueMask ) |\n ((gfx::geta(output) << fd.alphaShift) & fd.alphaMask);\n\n ++dst_address;\n }\n }\n }\n\n if (!origDstBounds.w) origDstBounds.w = 1;\n if (!origDstBounds.h) origDstBounds.h = 1;\n textBounds |= origDstBounds;\n if (delegate)\n delegate->postDrawChar(origDstBounds);\n } while (feg.nextChar());\n }\n\n if (surface)\n surface->unlock();\n break;\n }\n\n }\n\n return textBounds;\n}\n\n} \/\/ namespace os\n<commit_msg>Add missing case for kUnknown FontType in draw_text()<commit_after>\/\/ LAF OS Library\n\/\/ Copyright (C) 2017 David Capello\n\/\/\n\/\/ This file is released under the terms of the MIT license.\n\/\/ Read LICENSE.txt for more information.\n\n#ifdef HAVE_CONFIG_H\n#include \"config.h\"\n#endif\n\n#include \"os\/draw_text.h\"\n\n#include \"ft\/algorithm.h\"\n#include \"ft\/hb_shaper.h\"\n#include \"gfx\/clip.h\"\n#include \"os\/common\/freetype_font.h\"\n#include \"os\/common\/generic_surface.h\"\n#include \"os\/common\/sprite_sheet_font.h\"\n\nnamespace os {\n\ngfx::Rect draw_text(Surface* surface, Font* font,\n const base::utf8_const_iterator& begin,\n const base::utf8_const_iterator& end,\n gfx::Color fg, gfx::Color bg,\n int x, int y,\n DrawTextDelegate* delegate)\n{\n base::utf8_const_iterator it = begin;\n gfx::Rect textBounds;\n\nretry:;\n \/\/ Check if this font is enough to draw the given string or we will\n \/\/ need the fallback for some special Unicode chars\n if (font->fallback()) {\n \/\/ TODO compose unicode characters and check those codepoints, the\n \/\/ same in the drawing code of sprite sheet font\n for (auto it=begin; it!=end; ++it) {\n uint32_t code = *it;\n if (code && !font->hasCodePoint(code)) {\n Font* newFont = font->fallback();\n\n \/\/ Search a valid fallback\n while (newFont && !newFont->hasCodePoint(code))\n newFont = newFont->fallback();\n if (!newFont)\n break;\n\n y += font->height()\/2 - newFont->height()\/2;\n\n font = newFont;\n goto retry;\n }\n }\n }\n\n switch (font->type()) {\n\n case FontType::kUnknown:\n \/\/ Do nothing\n break;\n\n case FontType::kSpriteSheet: {\n SpriteSheetFont* ssFont = static_cast<SpriteSheetFont*>(font);\n Surface* sheet = ssFont->getSurfaceSheet();\n\n if (surface) {\n sheet->lock();\n surface->lock();\n }\n\n while (it != end) {\n int chr = *it;\n if (delegate) {\n int i = it-begin;\n delegate->preProcessChar(i, chr, fg, bg);\n }\n\n gfx::Rect charBounds = ssFont->getCharBounds(chr);\n gfx::Rect outCharBounds(x, y, charBounds.w, charBounds.h);\n if (delegate && !delegate->preDrawChar(outCharBounds))\n break;\n\n if (!charBounds.isEmpty()) {\n if (surface)\n surface->drawColoredRgbaSurface(sheet, fg, bg, gfx::Clip(x, y, charBounds));\n }\n\n textBounds |= outCharBounds;\n if (delegate)\n delegate->postDrawChar(outCharBounds);\n\n x += charBounds.w;\n ++it;\n }\n\n if (surface) {\n surface->unlock();\n sheet->unlock();\n }\n break;\n }\n\n case FontType::kTrueType: {\n FreeTypeFont* ttFont = static_cast<FreeTypeFont*>(font);\n bool antialias = ttFont->face().antialias();\n int fg_alpha = gfx::geta(fg);\n\n gfx::Rect clipBounds;\n os::SurfaceFormatData fd;\n if (surface) {\n clipBounds = surface->getClipBounds();\n surface->getFormat(&fd);\n surface->lock();\n }\n\n ft::ForEachGlyph<FreeTypeFont::Face> feg(ttFont->face());\n if (feg.initialize(it, end)) {\n do {\n if (delegate) {\n delegate->preProcessChar(feg.charIndex(),\n feg.unicodeChar(), fg, bg);\n }\n\n auto glyph = feg.glyph();\n if (!glyph)\n continue;\n\n gfx::Rect origDstBounds(\n x + int(glyph->startX),\n y + int(glyph->y),\n int(glyph->endX) - int(glyph->startX),\n int(glyph->bitmap->rows) ? int(glyph->bitmap->rows): 1);\n\n if (delegate && !delegate->preDrawChar(origDstBounds))\n break;\n\n origDstBounds.x = x + int(glyph->x);\n origDstBounds.w = int(glyph->bitmap->width);\n origDstBounds.h = int(glyph->bitmap->rows);\n\n gfx::Rect dstBounds = origDstBounds;\n if (surface)\n dstBounds &= clipBounds;\n\n if (surface && !dstBounds.isEmpty()) {\n int clippedRows = dstBounds.y - origDstBounds.y;\n int dst_y = dstBounds.y;\n int t;\n for (int v=0; v<dstBounds.h; ++v, ++dst_y) {\n int bit = 0;\n const uint8_t* p = glyph->bitmap->buffer\n + (v+clippedRows)*glyph->bitmap->pitch;\n int dst_x = dstBounds.x;\n uint32_t* dst_address =\n (uint32_t*)surface->getData(dst_x, dst_y);\n\n \/\/ Skip first clipped pixels\n for (int u=0; u<dstBounds.x-origDstBounds.x; ++u) {\n if (antialias) {\n ++p;\n }\n else {\n if (bit == 8) {\n bit = 0;\n ++p;\n }\n }\n }\n\n for (int u=0; u<dstBounds.w; ++u, ++dst_x) {\n ASSERT(clipBounds.contains(gfx::Point(dst_x, dst_y)));\n\n int alpha;\n if (antialias) {\n alpha = *(p++);\n }\n else {\n alpha = ((*p) & (1 << (7 - (bit++))) ? 255: 0);\n if (bit == 8) {\n bit = 0;\n ++p;\n }\n }\n\n uint32_t backdrop = *dst_address;\n gfx::Color backdropColor =\n gfx::rgba(\n ((backdrop & fd.redMask) >> fd.redShift),\n ((backdrop & fd.greenMask) >> fd.greenShift),\n ((backdrop & fd.blueMask) >> fd.blueShift),\n ((backdrop & fd.alphaMask) >> fd.alphaShift));\n\n gfx::Color output = gfx::rgba(gfx::getr(fg),\n gfx::getg(fg),\n gfx::getb(fg),\n MUL_UN8(fg_alpha, alpha, t));\n if (gfx::geta(bg) > 0)\n output = blend(blend(backdropColor, bg), output);\n else\n output = blend(backdropColor, output);\n\n *dst_address =\n ((gfx::getr(output) << fd.redShift ) & fd.redMask ) |\n ((gfx::getg(output) << fd.greenShift) & fd.greenMask) |\n ((gfx::getb(output) << fd.blueShift ) & fd.blueMask ) |\n ((gfx::geta(output) << fd.alphaShift) & fd.alphaMask);\n\n ++dst_address;\n }\n }\n }\n\n if (!origDstBounds.w) origDstBounds.w = 1;\n if (!origDstBounds.h) origDstBounds.h = 1;\n textBounds |= origDstBounds;\n if (delegate)\n delegate->postDrawChar(origDstBounds);\n } while (feg.nextChar());\n }\n\n if (surface)\n surface->unlock();\n break;\n }\n\n }\n\n return textBounds;\n}\n\n} \/\/ namespace os\n<|endoftext|>"} {"text":"<commit_before>#include <stdexcept>\n\n#include \"python_api.h\"\n\nstatic int python_count=0;\n\nPython::Python()\n{\n this->_init(-1, NULL);\n}\n\nPython::Python(int argc, char* argv[])\n{\n this->_init(argc, argv);\n}\n\nvoid Python::_init(int argc, char* argv[])\n{\n python_count++;\n if (python_count == 1) {\n \/\/ This is a hack:\n putenv((char *)\"PYTHONPATH=..\/..\");\n Py_Initialize();\n if (argc >= 0)\n PySys_SetArgv(argc, argv);\n if (import__hermes_common())\n throw std::runtime_error(\"hermes_common failed to import.\");\n }\n this->_namespace = namespace_create();\n}\n\nPython::~Python()\n{\n \/\/ free the namespace:\n Py_DECREF(this->_namespace);\n\n \/\/ Don't finalize the interpreter, because for some reason,\n \/\/ import__hermes_common() doesn't work when called again in the second\n \/\/ interpreter (segfaults). So for now we just keep one interpreter and\n \/\/ that's it.\n \/*\n python_count--;\n if (python_count == 0) {\n Py_Finalize();\n }\n *\/\n}\n\nvoid Python::print()\n{\n namespace_print(_namespace);\n}\n\nvoid Python::exec(const char *text)\n{\n run_cmd(text, this->_namespace);\n}\n\nvoid Python::push(const char *name, PyObject *o)\n{\n namespace_push(this->_namespace, name, o);\n Py_DECREF(o);\n}\n\nPyObject *Python::pull(const char *name)\n{\n return namespace_pull(this->_namespace, name);\n}\n<commit_msg>Free the interpreter automatically<commit_after>#include <stdexcept>\n\n#include \"python_api.h\"\n\nstatic int python_count=0;\n\nPython::Python()\n{\n this->_init(-1, NULL);\n}\n\nPython::Python(int argc, char* argv[])\n{\n this->_init(argc, argv);\n}\n\nvoid Python::_init(int argc, char* argv[])\n{\n python_count++;\n if (python_count == 1) {\n \/\/ This is a hack, so that we can load hermes_common below. Some better\n \/\/ mechanism should be used instead, once we figure out how to do it:\n putenv((char *)\"PYTHONPATH=..\/..\");\n Py_Initialize();\n if (argc >= 0)\n PySys_SetArgv(argc, argv);\n if (import__hermes_common())\n throw std::runtime_error(\"hermes_common failed to import.\");\n }\n this->_namespace = namespace_create();\n}\n\nPython::~Python()\n{\n \/\/ free the namespace:\n Py_DECREF(this->_namespace);\n\n \/\/ free the interpreter if this was the last instance using it:\n python_count--;\n if (python_count == 0) {\n Py_Finalize();\n }\n}\n\nvoid Python::print()\n{\n namespace_print(_namespace);\n}\n\nvoid Python::exec(const char *text)\n{\n run_cmd(text, this->_namespace);\n}\n\nvoid Python::push(const char *name, PyObject *o)\n{\n namespace_push(this->_namespace, name, o);\n Py_DECREF(o);\n}\n\nPyObject *Python::pull(const char *name)\n{\n return namespace_pull(this->_namespace, name);\n}\n<|endoftext|>"} {"text":"<commit_before>\/\/ ======================================================================== \/\/\n\/\/ Copyright 2009-2017 Intel Corporation \/\/\n\/\/ \/\/\n\/\/ Licensed under the Apache License, Version 2.0 (the \"License\"); \/\/\n\/\/ you may not use this file except in compliance with the License. \/\/\n\/\/ You may obtain a copy of the License at \/\/\n\/\/ \/\/\n\/\/ http:\/\/www.apache.org\/licenses\/LICENSE-2.0 \/\/\n\/\/ \/\/\n\/\/ Unless required by applicable law or agreed to in writing, software \/\/\n\/\/ distributed under the License is distributed on an \"AS IS\" BASIS, \/\/\n\/\/ WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. \/\/\n\/\/ See the License for the specific language governing permissions and \/\/\n\/\/ limitations under the License. \/\/\n\/\/ ======================================================================== \/\/\n\n\/\/ own\n#include \"Importer.h\"\n\/\/ ospcommon\n#include \"ospcommon\/FileName.h\"\n\n\/\/ scene graph\n#include \"sg\/module\/Module.h\"\n#include \"sg\/importer\/Importer.h\"\n#include \"sg\/Renderer.h\"\n\n#include <string>\n\nnamespace ospray {\n namespace importer {\n\n void importOSP(const FileName &fileName, Group *existingGroupToAddTo);\n void importRM(const FileName &fileName, Group *existingGroupToAddTo);\n\n Group *import(const std::string &fn, Group *existingGroupToAddTo)\n {\n FileName fileName = fn;\n Group *group = existingGroupToAddTo;\n if (!group) group = new Group;\n\n if (fileName.ext() == \"osp\" || fileName.ext() == \"osg\") {\n std::shared_ptr<sg::World> world;;\n std::cout << \"loading osp file: \\n\";\n world = sg::loadOSP(fn);\n std::shared_ptr<sg::Volume> volumeNode;\n for (auto node : world->getChildren()) {\n if (node->getType().find(\"Volume\") != std::string::npos)\n volumeNode = std::dynamic_pointer_cast<sg::Volume>(node.get());\n }\n if (!volumeNode) {\n throw std::runtime_error(\"#ospray:importer: no volume found \"\n \"in osp file\");\n }\n sg::RenderContext ctx;\n world->traverse(ctx, \"verify\");\n std::cout << \"scenegraph:\\n\";\n world->traverse(ctx, \"print\");\n std::cout << \"end scenegraph\\n\";\n world->traverse(ctx, \"commit\");\n\n OSPVolume volume = volumeNode->volume;\n\n Volume* msgVolume = new Volume;\n msgVolume->bounds = volumeNode->getBounds();\n msgVolume->handle = volumeNode->volume;\n assert(msgVolume->handle);\n msgVolume->voxelRange = volumeNode->getChild(\"voxelRange\")->getValue<vec2f>();\n group->volume.push_back(msgVolume);\n } else if (fileName.ext() == \"bob\") {\n importRM(fn, group);\n } else {\n throw std::runtime_error(\"#ospray:importer: do not know how to import file of type \"\n + fileName.ext());\n }\n\n return group;\n }\n\n } \/\/ ::ospray::importer\n} \/\/ ::ospray\n<commit_msg>removing output<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\/\/ own\n#include \"Importer.h\"\n\/\/ ospcommon\n#include \"ospcommon\/FileName.h\"\n\n\/\/ scene graph\n#include \"sg\/module\/Module.h\"\n#include \"sg\/importer\/Importer.h\"\n#include \"sg\/Renderer.h\"\n\n#include <string>\n\nnamespace ospray {\n namespace importer {\n\n void importOSP(const FileName &fileName, Group *existingGroupToAddTo);\n void importRM(const FileName &fileName, Group *existingGroupToAddTo);\n\n Group *import(const std::string &fn, Group *existingGroupToAddTo)\n {\n FileName fileName = fn;\n Group *group = existingGroupToAddTo;\n if (!group) group = new Group;\n\n if (fileName.ext() == \"osp\" || fileName.ext() == \"osg\") {\n std::shared_ptr<sg::World> world;;\n std::cout << \"loading osp file: \\n\";\n world = sg::loadOSP(fn);\n std::shared_ptr<sg::Volume> volumeNode;\n for (auto node : world->getChildren()) {\n if (node->getType().find(\"Volume\") != std::string::npos)\n volumeNode = std::dynamic_pointer_cast<sg::Volume>(node.get());\n }\n if (!volumeNode) {\n throw std::runtime_error(\"#ospray:importer: no volume found \"\n \"in osp file\");\n }\n sg::RenderContext ctx;\n world->traverse(ctx, \"verify\");\n world->traverse(ctx, \"print\");\n world->traverse(ctx, \"commit\");\n\n OSPVolume volume = volumeNode->volume;\n\n Volume* msgVolume = new Volume;\n msgVolume->bounds = volumeNode->getBounds();\n msgVolume->handle = volumeNode->volume;\n assert(msgVolume->handle);\n msgVolume->voxelRange = volumeNode->getChild(\"voxelRange\")->getValue<vec2f>();\n group->volume.push_back(msgVolume);\n } else if (fileName.ext() == \"bob\") {\n importRM(fn, group);\n } else {\n throw std::runtime_error(\"#ospray:importer: do not know how to import file of type \"\n + fileName.ext());\n }\n\n return group;\n }\n\n } \/\/ ::ospray::importer\n} \/\/ ::ospray\n<|endoftext|>"} {"text":"<commit_before>\n#include \"canvas.h\"\n#include \"font.h\"\n#include <draw\/path.h>\n#include <core\/contract.h>\n\nnamespace cairo\n{\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\ncanvas::canvas( void )\n{\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\ncanvas::~canvas( void )\n{\n\tif ( _context )\n\t\tcairo_destroy( _context );\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nvoid canvas::set_surface( cairo_surface_t *surf )\n{\n\t_surface = surf;\n\tprecondition( _surface, \"null surface\" );\n\n\t_context = cairo_create( _surface );\n\tcheck_error();\n\n\tpostcondition( _context, \"context could not be created\" );\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nvoid canvas::clear_surface( void )\n{\n\tif( _context )\n\t{\n\t\tcairo_surface_finish( _surface );\n\t\tcairo_destroy( _context );\n\t\t_context = nullptr;\n\t\t_surface = nullptr;\n\t\tcheck_error();\n\t}\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nvoid canvas::fill( const draw::paint &c )\n{\n\tif( !_context )\n\t\treturn;\n\n\tset_cairo( c );\n\tif ( !set_cairo_fill( c ) )\n\t\tset_cairo_stroke( c );\n\tcairo_paint( _context );\n\tcheck_error();\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nvoid canvas::fill( const draw::rect &r, const draw::paint &c )\n{\n\tcairo_rectangle( _context, r.x(), r.y(), r.width(), r.height() );\n\tif( !_context )\n\t\treturn;\n\n\tset_cairo( c );\n\tif ( !set_cairo_fill( c ) )\n\t\tset_cairo_stroke( c );\n\tcairo_fill( _context );\n\tcheck_error();\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nvoid canvas::draw_path( const draw::path &path, const draw::paint &c )\n{\n\tcairo_save( _context );\n\tif( !_context )\n\t\treturn;\n\n\tsize_t p = 0;\n\tfor ( auto v: path.get_actions() )\n\t{\n\t\tswitch ( v )\n\t\t{\n\t\t\tcase draw::path::action::MOVE:\n\t\t\t{\n\t\t\t\tauto &p1 = path.get_point( p++ );\n\t\t\t\tcairo_move_to( _context, p1.x(), p1.y() );\n\t\t\t\tbreak;\n\t\t\t}\n\n\t\t\tcase draw::path::action::LINE:\n\t\t\t{\n\t\t\t\tauto &p1 = path.get_point( p++ );\n\t\t\t\tcairo_line_to( _context, p1.x(), p1.y() );\n\t\t\t\tbreak;\n\t\t\t}\n\n\t\t\tcase draw::path::action::QUADRATIC:\n\t\t\t{\n\t\t\t\tp += 2;\n\t\t\t\tthrow std::runtime_error( \"not yet implemented\" );\n\/\/\t\t\t\tbreak;\n\t\t\t}\n\n\t\t\tcase draw::path::action::CUBIC:\n\t\t\t{\n\t\t\t\tauto &p1 = path.get_point( p++ );\n\t\t\t\tauto &p2 = path.get_point( p++ );\n\t\t\t\tauto &p3 = path.get_point( p++ );\n\t\t\t\tcairo_curve_to( _context, p1.x(), p1.y(), p2.x(), p2.y(), p3.x(), p3.y() );\n\t\t\t\tbreak;\n\t\t\t}\n\n\t\t\tcase draw::path::action::ARC:\n\t\t\t{\n\t\t\t\tauto &c = path.get_point( p++ );\n\t\t\t\tauto &r = path.get_point( p++ );\n\t\t\t\tauto &a = path.get_point( p++ );\n\t\t\t\tcairo_arc( _context, c.x(), c.y(), draw::point::distance( c, r ), a.x(), a.y() );\n\t\t\t\tbreak;\n\t\t\t}\n\n\t\t\tcase draw::path::action::CLOSE:\n\t\t\t{\n\t\t\t\tcairo_close_path( _context );\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t}\n\tpostcondition ( p == path.get_points().size(), \"too many points?\" );\n\n\tset_cairo( c );\n\tif ( set_cairo_fill( c ) )\n\t\tcairo_fill_preserve( _context );\n\tset_cairo_stroke( c );\n\tcairo_stroke( _context );\n\n\tcheck_error();\n\tcairo_restore( _context );\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nvoid canvas::draw_text( const std::shared_ptr<draw::font> &font, const draw::point &p, const std::string &utf8, const draw::paint &c )\n{\n\tcairo_save( _context );\n\n\tset_cairo_font( font );\n\n\tcairo_move_to( _context, p.x(), p.y() );\n\tcairo_text_path( _context, utf8.c_str() );\n\n\tset_cairo( c );\n\tif ( set_cairo_fill( c ) )\n\t\tcairo_fill_preserve( _context );\n\tset_cairo_stroke( c );\n\tcairo_stroke( _context );\n\n\tcheck_error();\n\tcairo_restore( _context );\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nvoid canvas::clip( const draw::rect &r )\n{\n\tcairo_rectangle( _context, r.x(), r.y(), r.width(), r.height() );\n\tcairo_clip( _context );\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nvoid canvas::translate( double x, double y )\n{\n\tcairo_translate( _context, x, y );\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nvoid canvas::present( void )\n{\n\tif ( !_surface )\n\t\treturn;\n\n\tcairo_surface_flush( _surface );\n\tcheck_error();\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nvoid canvas::save( void )\n{\n\tcairo_save( _context );\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nvoid canvas::restore( void )\n{\n\tcairo_restore( _context );\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nvoid canvas::screenshot_png( const char *filename )\n{\n\tif ( !_surface )\n\t\tthrow std::runtime_error( \"missing surface\" );\n\n\tcairo_surface_write_to_png( _surface, filename );\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nvoid canvas::set_cairo( const draw::paint &p )\n{\n\tcairo_set_antialias( _context, p.has_antialias() ? CAIRO_ANTIALIAS_SUBPIXEL : CAIRO_ANTIALIAS_NONE );\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nvoid canvas::set_cairo_stroke( const draw::paint &p )\n{\n\tconst draw::color &c = p.get_stroke_color();\n\tcairo_set_source_rgba( _context, c.red(), c.green(), c.blue(), c.alpha() );\n\tcairo_set_line_width( _context, p.get_stroke_width() );\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nbool canvas::set_cairo_fill( const draw::paint &p )\n{\n\tif ( p.has_fill_color() )\n\t{\n\t\tconst draw::color &c = p.get_fill_color();\n\t\tcairo_pattern_t *pat = cairo_pattern_create_rgba( c.red(), c.green(), c.blue(), c.alpha() );\n\t\tcairo_set_source( _context, pat );\n\t\tcairo_pattern_destroy( pat );\n\t\treturn true;\n\t}\n\telse if ( p.has_fill_linear() )\n\t{\n\t\tconst draw::point &p1 = p.get_fill_linear_p1();\n\t\tconst draw::point &p2 = p.get_fill_linear_p2();\n\t\tcairo_pattern_t *pat = cairo_pattern_create_linear( p1.x(), p1.y(), p2.x(), p2.y() );\n\t\tfor ( auto s: p.get_fill_linear_stops() )\n\t\t{\n\t\t\tconst draw::color &c = s.second;\n\t\t\tcairo_pattern_add_color_stop_rgba( pat, s.first, c.red(), c.green(), c.blue(), c.alpha() );\n\t\t}\n\t\tcairo_set_source( _context, pat );\n\t\tcairo_pattern_destroy( pat );\n\t\treturn true;\n\t}\n\telse if ( p.has_fill_radial() )\n\t{\n\t\tconst draw::point &p1 = p.get_fill_radial_p1();\n\t\tconst draw::point &p2 = p.get_fill_radial_p2();\n\t\tdouble r1 = p.get_fill_radial_r1();\n\t\tdouble r2 = p.get_fill_radial_r2();\n\n\t\tcairo_pattern_t *pat = cairo_pattern_create_radial( p1.x(), p1.y(), r1, p2.x(), p2.y(), r2 );\n\t\tfor ( auto s: p.get_fill_radial_stops() )\n\t\t{\n\t\t\tconst draw::color &c = s.second;\n\t\t\tcairo_pattern_add_color_stop_rgba( pat, s.first, c.red(), c.green(), c.blue(), c.alpha() );\n\t\t}\n\t\tcairo_set_source( _context, pat );\n\t\tcairo_pattern_destroy( pat );\n\t\treturn true;\n\t}\n\n\treturn false;\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nvoid canvas::set_cairo_font( const std::shared_ptr<draw::font> &bfont )\n{\n\tauto *font = dynamic_cast<cairo::font*>( bfont.get() );\n\tprecondition( font, \"draw_text with null font\" );\n\n\tcairo_set_scaled_font( _context, font->cairo_font() );\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nvoid canvas::check_error( void )\n{\n\tif ( _context )\n\t\tif ( cairo_status( _context ) )\n\t\t\tthrow std::runtime_error( cairo_status_to_string( cairo_status( _context ) ) );\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n}\n<commit_msg>Fixed negative arcs.<commit_after>\n#include \"canvas.h\"\n#include \"font.h\"\n#include <draw\/path.h>\n#include <core\/contract.h>\n\nnamespace cairo\n{\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\ncanvas::canvas( void )\n{\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\ncanvas::~canvas( void )\n{\n\tif ( _context )\n\t\tcairo_destroy( _context );\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nvoid canvas::set_surface( cairo_surface_t *surf )\n{\n\t_surface = surf;\n\tprecondition( _surface, \"null surface\" );\n\n\t_context = cairo_create( _surface );\n\tcheck_error();\n\n\tpostcondition( _context, \"context could not be created\" );\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nvoid canvas::clear_surface( void )\n{\n\tif( _context )\n\t{\n\t\tcairo_surface_finish( _surface );\n\t\tcairo_destroy( _context );\n\t\t_context = nullptr;\n\t\t_surface = nullptr;\n\t\tcheck_error();\n\t}\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nvoid canvas::fill( const draw::paint &c )\n{\n\tif( !_context )\n\t\treturn;\n\n\tset_cairo( c );\n\tif ( !set_cairo_fill( c ) )\n\t\tset_cairo_stroke( c );\n\tcairo_paint( _context );\n\tcheck_error();\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nvoid canvas::fill( const draw::rect &r, const draw::paint &c )\n{\n\tcairo_rectangle( _context, r.x(), r.y(), r.width(), r.height() );\n\tif( !_context )\n\t\treturn;\n\n\tset_cairo( c );\n\tif ( !set_cairo_fill( c ) )\n\t\tset_cairo_stroke( c );\n\tcairo_fill( _context );\n\tcheck_error();\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nvoid canvas::draw_path( const draw::path &path, const draw::paint &c )\n{\n\tcairo_save( _context );\n\tif( !_context )\n\t\treturn;\n\n\tsize_t p = 0;\n\tfor ( auto v: path.get_actions() )\n\t{\n\t\tswitch ( v )\n\t\t{\n\t\t\tcase draw::path::action::MOVE:\n\t\t\t{\n\t\t\t\tauto &p1 = path.get_point( p++ );\n\t\t\t\tcairo_move_to( _context, p1.x(), p1.y() );\n\t\t\t\tbreak;\n\t\t\t}\n\n\t\t\tcase draw::path::action::LINE:\n\t\t\t{\n\t\t\t\tauto &p1 = path.get_point( p++ );\n\t\t\t\tcairo_line_to( _context, p1.x(), p1.y() );\n\t\t\t\tbreak;\n\t\t\t}\n\n\t\t\tcase draw::path::action::QUADRATIC:\n\t\t\t{\n\t\t\t\tp += 2;\n\t\t\t\tthrow std::runtime_error( \"not yet implemented\" );\n\/\/\t\t\t\tbreak;\n\t\t\t}\n\n\t\t\tcase draw::path::action::CUBIC:\n\t\t\t{\n\t\t\t\tauto &p1 = path.get_point( p++ );\n\t\t\t\tauto &p2 = path.get_point( p++ );\n\t\t\t\tauto &p3 = path.get_point( p++ );\n\t\t\t\tcairo_curve_to( _context, p1.x(), p1.y(), p2.x(), p2.y(), p3.x(), p3.y() );\n\t\t\t\tbreak;\n\t\t\t}\n\n\t\t\tcase draw::path::action::ARC:\n\t\t\t{\n\t\t\t\tauto &c = path.get_point( p++ );\n\t\t\t\tauto &r = path.get_point( p++ );\n\t\t\t\tauto &a = path.get_point( p++ );\n\t\t\t\tif ( a.x() < a.y() )\n\t\t\t\t\tcairo_arc( _context, c.x(), c.y(), draw::point::distance( c, r ), a.x(), a.y() );\n\t\t\t\telse\n\t\t\t\t\tcairo_arc_negative( _context, c.x(), c.y(), draw::point::distance( c, r ), a.x(), a.y() );\n\t\t\t\tbreak;\n\t\t\t}\n\n\t\t\tcase draw::path::action::CLOSE:\n\t\t\t{\n\t\t\t\tcairo_close_path( _context );\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t}\n\tpostcondition ( p == path.get_points().size(), \"too many points?\" );\n\n\tset_cairo( c );\n\tif ( set_cairo_fill( c ) )\n\t\tcairo_fill_preserve( _context );\n\tset_cairo_stroke( c );\n\tcairo_stroke( _context );\n\n\tcheck_error();\n\tcairo_restore( _context );\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nvoid canvas::draw_text( const std::shared_ptr<draw::font> &font, const draw::point &p, const std::string &utf8, const draw::paint &c )\n{\n\tcairo_save( _context );\n\n\tset_cairo_font( font );\n\n\tcairo_move_to( _context, p.x(), p.y() );\n\tcairo_text_path( _context, utf8.c_str() );\n\n\tset_cairo( c );\n\tif ( set_cairo_fill( c ) )\n\t\tcairo_fill_preserve( _context );\n\tset_cairo_stroke( c );\n\tcairo_stroke( _context );\n\n\tcheck_error();\n\tcairo_restore( _context );\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nvoid canvas::clip( const draw::rect &r )\n{\n\tcairo_rectangle( _context, r.x(), r.y(), r.width(), r.height() );\n\tcairo_clip( _context );\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nvoid canvas::translate( double x, double y )\n{\n\tcairo_translate( _context, x, y );\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nvoid canvas::present( void )\n{\n\tif ( !_surface )\n\t\treturn;\n\n\tcairo_surface_flush( _surface );\n\tcheck_error();\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nvoid canvas::save( void )\n{\n\tcairo_save( _context );\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nvoid canvas::restore( void )\n{\n\tcairo_restore( _context );\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nvoid canvas::screenshot_png( const char *filename )\n{\n\tif ( !_surface )\n\t\tthrow std::runtime_error( \"missing surface\" );\n\n\tcairo_surface_write_to_png( _surface, filename );\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nvoid canvas::set_cairo( const draw::paint &p )\n{\n\tcairo_set_antialias( _context, p.has_antialias() ? CAIRO_ANTIALIAS_SUBPIXEL : CAIRO_ANTIALIAS_NONE );\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nvoid canvas::set_cairo_stroke( const draw::paint &p )\n{\n\tconst draw::color &c = p.get_stroke_color();\n\tcairo_set_source_rgba( _context, c.red(), c.green(), c.blue(), c.alpha() );\n\tcairo_set_line_width( _context, p.get_stroke_width() );\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nbool canvas::set_cairo_fill( const draw::paint &p )\n{\n\tif ( p.has_fill_color() )\n\t{\n\t\tconst draw::color &c = p.get_fill_color();\n\t\tcairo_pattern_t *pat = cairo_pattern_create_rgba( c.red(), c.green(), c.blue(), c.alpha() );\n\t\tcairo_set_source( _context, pat );\n\t\tcairo_pattern_destroy( pat );\n\t\treturn true;\n\t}\n\telse if ( p.has_fill_linear() )\n\t{\n\t\tconst draw::point &p1 = p.get_fill_linear_p1();\n\t\tconst draw::point &p2 = p.get_fill_linear_p2();\n\t\tcairo_pattern_t *pat = cairo_pattern_create_linear( p1.x(), p1.y(), p2.x(), p2.y() );\n\t\tfor ( auto s: p.get_fill_linear_stops() )\n\t\t{\n\t\t\tconst draw::color &c = s.second;\n\t\t\tcairo_pattern_add_color_stop_rgba( pat, s.first, c.red(), c.green(), c.blue(), c.alpha() );\n\t\t}\n\t\tcairo_set_source( _context, pat );\n\t\tcairo_pattern_destroy( pat );\n\t\treturn true;\n\t}\n\telse if ( p.has_fill_radial() )\n\t{\n\t\tconst draw::point &p1 = p.get_fill_radial_p1();\n\t\tconst draw::point &p2 = p.get_fill_radial_p2();\n\t\tdouble r1 = p.get_fill_radial_r1();\n\t\tdouble r2 = p.get_fill_radial_r2();\n\n\t\tcairo_pattern_t *pat = cairo_pattern_create_radial( p1.x(), p1.y(), r1, p2.x(), p2.y(), r2 );\n\t\tfor ( auto s: p.get_fill_radial_stops() )\n\t\t{\n\t\t\tconst draw::color &c = s.second;\n\t\t\tcairo_pattern_add_color_stop_rgba( pat, s.first, c.red(), c.green(), c.blue(), c.alpha() );\n\t\t}\n\t\tcairo_set_source( _context, pat );\n\t\tcairo_pattern_destroy( pat );\n\t\treturn true;\n\t}\n\n\treturn false;\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nvoid canvas::set_cairo_font( const std::shared_ptr<draw::font> &bfont )\n{\n\tauto *font = dynamic_cast<cairo::font*>( bfont.get() );\n\tprecondition( font, \"draw_text with null font\" );\n\n\tcairo_set_scaled_font( _context, font->cairo_font() );\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nvoid canvas::check_error( void )\n{\n\tif ( _context )\n\t\tif ( cairo_status( _context ) )\n\t\t\tthrow std::runtime_error( cairo_status_to_string( cairo_status( _context ) ) );\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n}\n<|endoftext|>"} {"text":"<commit_before>#include \"umundo\/core.h\"\n#include <iostream>\n\nusing namespace umundo;\n\nbool testRecursiveMutex() {\n\tMutex mutex;\n\tUMUNDO_LOCK(mutex);\n\tif(!mutex.tryLock()) {\n\t\tLOG_ERR(\"tryLock should be possible from within the same thread\");\n\t\tassert(false);\n\t}\n\tUMUNDO_LOCK(mutex);\n\t\/\/ can we unlock it as well?\n\tUMUNDO_UNLOCK(mutex);\n\tUMUNDO_UNLOCK(mutex);\n\treturn true;\n}\n\nstatic Mutex testMutex;\nbool testThreads() {\n\tclass Thread1 : public Thread {\n\t\tvoid run() {\n\t\t\tif(testMutex.tryLock()) {\n\t\t\t\tLOG_ERR(\"tryLock should return false with a mutex locked in another thread\");\n\t\t\t\tassert(false);\n\t\t\t}\n\t\t\tUMUNDO_LOCK(testMutex); \/\/ blocks\n\t\t\tThread::sleepMs(50);\n\t\t\tUMUNDO_UNLOCK(testMutex);\n\t\t\tThread::sleepMs(100);\n\t\t}\n\t};\n\n\t\/**\n\t * tl=tryLock, l=lock, u=unlock b=block, sN=sleep(N)\n\t * thread1: start tl l l s50 u\n\t * main: start l s50 u s20 tl l join\n\t * t-> 0 50 70 100\n\t *\/\n\n\tUMUNDO_LOCK(testMutex);\n\tThread1 thread1;\n\tthread1.start();\n\tThread::sleepMs(50); \/\/ thread1 will trylock and block on lock\n\tUMUNDO_UNLOCK(testMutex); \/\/ unlock\n\tThread::sleepMs(20); \/\/ yield cpu and sleep\n\t\/\/ thread1 sleeps with lock on mutex\n\tif(testMutex.tryLock()) {\n\t\tLOG_ERR(\"tryLock should return false with a mutex locked in another thread\");\n\t\tassert(false);\n\t}\n\tUMUNDO_LOCK(testMutex); \/\/ thread1 will unlock and sleep\n\tthread1.join(); \/\/ join with thread1\n\tif(thread1.isStarted()) {\n\t\tLOG_ERR(\"thread still running after join\");\n\t\tassert(false);\n\t}\n\treturn true;\n}\n\nstatic Monitor testMonitor;\nstatic int passedMonitor = 0;\nbool testMonitors() {\n\tstruct TestThread : public Thread {\n\t\tint _ms;\n\t\tTestThread(int ms) : _ms(ms) {}\n\t\tvoid run() {\n\t\t\ttestMonitor.wait();\n\t\t\tThread::sleepMs(10); \/\/ avoid clash with other threads\n\t\t\tpassedMonitor++;\n\t\t}\n\t};\n\n\tTestThread thread1(0);\n\tTestThread thread2(5);\n\tTestThread thread3(10);\n\n\tfor (int i = 0; i < 10; i++) {\n\t\tpassedMonitor = 0;\n\n\t\t\/\/ all will block on monitor\n\t\tthread1.start();\n\t\tthread2.start();\n\t\tthread3.start();\n\t\tThread::sleepMs(5); \/\/ give threads a chance to run into wait\n\t\tif(passedMonitor != 0) {\n\t\t\tLOG_ERR(\"%d threads already passed the monitor\", passedMonitor);\n\t\t\tassert(false);\n\t\t}\n\t\tUMUNDO_SIGNAL(testMonitor); \/\/ signal a single thread\n\t\tThread::sleepMs(15); \/\/ thread will increase passedMonitor\n\t\tif(passedMonitor != 1) {\n\t\t\tLOG_ERR(\"Expected 1 threads to pass the monitor, but %d did\", passedMonitor);\n\t\t\tassert(false);\n\t\t}\n\t\tUMUNDO_BROADCAST(testMonitor); \/\/ signal all other threads\n\t\tThread::sleepMs(15);\n\n\t\tif (thread1.isStarted() || thread2.isStarted() || thread3.isStarted()) {\n\t\t\tLOG_ERR(\"Threads ran to completion but still insist on being started\");\n\t\t\tassert(false);\n\t\t}\n\t}\n\treturn true;\n}\n\nstatic Monitor testTimedMonitor;\nstatic int passedTimedMonitor = 0;\nbool testTimedMonitors() {\n\tstruct TestThread : public Thread {\n\t\tint _ms;\n\t\tTestThread(int ms) : _ms(ms) {}\n\t\tvoid run() {\n\t\t\ttestTimedMonitor.wait(_ms);\n\t\t\tpassedTimedMonitor++;\n\t\t}\n\t};\n\n\tTestThread thread1(40);\n\tTestThread thread2(0); \/\/ waits forever\n\tTestThread thread3(0); \/\/ waits forever\n\tTestThread thread4(0); \/\/ waits forever\n\tTestThread thread5(0); \/\/ waits forever\n\n\tfor (int i = 0; i < 10; i++) {\n\t\t\/\/ test waiting for a given time\n\t\tpassedTimedMonitor = 0;\n\t\tthread1.start(); \/\/ wait for 15ms at mutex before resuming\n\t\tThread::sleepMs(10);\n\t\tassert(passedTimedMonitor == 0); \/\/ thread1 should not have passed\n\t\tThread::sleepMs(60);\n\t\tassert(passedTimedMonitor == 1); \/\/ thread1 should have passed\n\t\tassert(!thread1.isStarted());\n\n\t\t\/\/ test signalling a set of threads\n\t\tpassedTimedMonitor = 0;\n\t\tthread2.start();\n\t\tthread3.start();\n\t\tthread4.start();\n\t\tthread5.start();\n\t\tThread::sleepMs(5);\n\t\ttestTimedMonitor.signal(2); \/\/ signal 2 threads\n\t\tThread::sleepMs(20);\n\t\tassert(passedTimedMonitor == 2);\n\t\ttestTimedMonitor.signal(1); \/\/ signal another thread\n\t\tThread::sleepMs(20);\n\t\tassert(passedTimedMonitor == 3);\n\t\ttestTimedMonitor.broadcast(); \/\/ signal last thread\n\t\tThread::sleepMs(20);\n\t\tassert(passedTimedMonitor == 4);\n\t\tassert(!thread2.isStarted() && !thread3.isStarted() && !thread4.isStarted() && !thread5.isStarted());\n\n\t\t\/\/ test timed and unlimited waiting\n\t\tpassedTimedMonitor = 0;\n\t\tthread1.start();\n\t\tthread2.start(); \/\/ with another thread\n\t\tthread3.start(); \/\/ with another thread\n\t\tThread::sleepMs(5);\n\t\ttestTimedMonitor.signal(); \/\/ explicit signal\n\t\tThread::sleepMs(20);\n\t\tassert(passedTimedMonitor == 1);\n\t\t\/\/ wo do not know which thread passed\n\t\tassert(!thread1.isStarted() || !thread2.isStarted() || !thread3.isStarted());\n\t\tif (thread1.isStarted()) {\n\t\t\t\/\/ thread1 is still running, just wait\n\t\t\tThread::sleepMs(60);\n\t\t\tassert(passedTimedMonitor == 2);\n\t\t}\n\t\ttestTimedMonitor.broadcast(); \/\/ explicit signal\n\t\tThread::sleepMs(20);\n\t\tassert(passedTimedMonitor == 3);\n\t\tassert(!thread1.isStarted() && !thread2.isStarted() && !thread3.isStarted());\n\n\t\t\/\/ test signalling prior to waiting\n\t\tpassedTimedMonitor = 0;\n\t\ttestTimedMonitor.signal();\n\t\tthread1.start();\n\t\tThread::sleepMs(10);\n\t\tthread2.start();\n\t\tThread::sleepMs(10);\n\t\tassert(passedTimedMonitor == 1);\n\t\tassert(!thread1.isStarted());\n\t\tassert(thread2.isStarted());\n\t\ttestTimedMonitor.signal();\n\t\tThread::sleepMs(20);\n\t\tassert(passedTimedMonitor == 2);\n\n\t\tassert(!thread1.isStarted());\n\t\tassert(!thread2.isStarted());\n\t\tassert(!thread3.isStarted());\n\n\t}\n\treturn true;\n}\n\nclass FooTracer : public Traceable, public Thread {\n\tvoid run() {\n\t\twhile(isStarted()) {\n\t\t\ttrace(\"This is foo\");\n\t\t\tThread::sleepMs(20);\n\t\t}\n\t}\n \n void retrace(const std::string& msg, std::map<std::string, std::string> info) {\n };\n\n \n};\n\nbool testTracing() {\n\tFooTracer* tr1 = new FooTracer();\n\tFooTracer* tr2 = new FooTracer();\n\tFooTracer* tr3 = new FooTracer();\n\n\ttr1->setTraceFile(\"trace.txt\");\n\ttr2->setTraceFile(\"trace.txt\");\n\ttr3->setTraceFile(\"trace.txt\");\n\n\ttr1->start();\n\ttr2->start();\n\ttr3->start();\n\n\tThread::sleepMs(100);\n\tdelete tr1;\n\tdelete tr2;\n\tdelete tr3;\n\n Thread::sleepMs(100);\n\n FooTracer* tr4 = new FooTracer();\n tr4->replay(\"trace.txt\");\n \n\treturn true;\n}\n\nint main(int argc, char** argv) {\n\tif(!testTracing())\n\t\treturn EXIT_FAILURE;\n\tif(!testRecursiveMutex())\n\t\treturn EXIT_FAILURE;\n\tif(!testThreads())\n\t\treturn EXIT_FAILURE;\n\tif(!testMonitors())\n\t\treturn EXIT_FAILURE;\n\tif(!testTimedMonitors())\n\t\treturn EXIT_FAILURE;\n}\n<commit_msg>adapted timeouts once more<commit_after>#include \"umundo\/core.h\"\n#include <iostream>\n\nusing namespace umundo;\n\nbool testRecursiveMutex() {\n\tMutex mutex;\n\tUMUNDO_LOCK(mutex);\n\tif(!mutex.tryLock()) {\n\t\tLOG_ERR(\"tryLock should be possible from within the same thread\");\n\t\tassert(false);\n\t}\n\tUMUNDO_LOCK(mutex);\n\t\/\/ can we unlock it as well?\n\tUMUNDO_UNLOCK(mutex);\n\tUMUNDO_UNLOCK(mutex);\n\treturn true;\n}\n\nstatic Mutex testMutex;\nbool testThreads() {\n\tclass Thread1 : public Thread {\n\t\tvoid run() {\n\t\t\tif(testMutex.tryLock()) {\n\t\t\t\tLOG_ERR(\"tryLock should return false with a mutex locked in another thread\");\n\t\t\t\tassert(false);\n\t\t\t}\n\t\t\tUMUNDO_LOCK(testMutex); \/\/ blocks\n\t\t\tThread::sleepMs(50);\n\t\t\tUMUNDO_UNLOCK(testMutex);\n\t\t\tThread::sleepMs(100);\n\t\t}\n\t};\n\n\t\/**\n\t * tl=tryLock, l=lock, u=unlock b=block, sN=sleep(N)\n\t * thread1: start tl l l s50 u\n\t * main: start l s50 u s20 tl l join\n\t * t-> 0 50 70 100\n\t *\/\n\n\tUMUNDO_LOCK(testMutex);\n\tThread1 thread1;\n\tthread1.start();\n\tThread::sleepMs(50); \/\/ thread1 will trylock and block on lock\n\tUMUNDO_UNLOCK(testMutex); \/\/ unlock\n\tThread::sleepMs(20); \/\/ yield cpu and sleep\n\t\/\/ thread1 sleeps with lock on mutex\n\tif(testMutex.tryLock()) {\n\t\tLOG_ERR(\"tryLock should return false with a mutex locked in another thread\");\n\t\tassert(false);\n\t}\n\tUMUNDO_LOCK(testMutex); \/\/ thread1 will unlock and sleep\n\tthread1.join(); \/\/ join with thread1\n\tif(thread1.isStarted()) {\n\t\tLOG_ERR(\"thread still running after join\");\n\t\tassert(false);\n\t}\n\treturn true;\n}\n\nstatic Monitor testMonitor;\nstatic int passedMonitor = 0;\nbool testMonitors() {\n\tstruct TestThread : public Thread {\n\t\tint _ms;\n\t\tTestThread(int ms) : _ms(ms) {}\n\t\tvoid run() {\n\t\t\ttestMonitor.wait();\n\t\t\tThread::sleepMs(10); \/\/ avoid clash with other threads\n\t\t\tpassedMonitor++;\n\t\t}\n\t};\n\n\tTestThread thread1(0);\n\tTestThread thread2(5);\n\tTestThread thread3(10);\n\n\tfor (int i = 0; i < 10; i++) {\n\t\tpassedMonitor = 0;\n\n\t\t\/\/ all will block on monitor\n\t\tthread1.start();\n\t\tthread2.start();\n\t\tthread3.start();\n\t\tThread::sleepMs(5); \/\/ give threads a chance to run into wait\n\t\tif(passedMonitor != 0) {\n\t\t\tLOG_ERR(\"%d threads already passed the monitor\", passedMonitor);\n\t\t\tassert(false);\n\t\t}\n\t\tUMUNDO_SIGNAL(testMonitor); \/\/ signal a single thread\n\t\tThread::sleepMs(15); \/\/ thread will increase passedMonitor\n\t\tif(passedMonitor != 1) {\n\t\t\tLOG_ERR(\"Expected 1 threads to pass the monitor, but %d did\", passedMonitor);\n\t\t\tassert(false);\n\t\t}\n\t\tUMUNDO_BROADCAST(testMonitor); \/\/ signal all other threads\n\t\tThread::sleepMs(40);\n\n\t\tif (thread1.isStarted() || thread2.isStarted() || thread3.isStarted()) {\n\t\t\tLOG_ERR(\"Threads ran to completion but still insist on being started\");\n\t\t\tassert(false);\n\t\t}\n\t}\n\treturn true;\n}\n\nstatic Monitor testTimedMonitor;\nstatic int passedTimedMonitor = 0;\nbool testTimedMonitors() {\n\tstruct TestThread : public Thread {\n\t\tint _ms;\n\t\tTestThread(int ms) : _ms(ms) {}\n\t\tvoid run() {\n\t\t\ttestTimedMonitor.wait(_ms);\n\t\t\tpassedTimedMonitor++;\n\t\t}\n\t};\n\n\tTestThread thread1(40);\n\tTestThread thread2(0); \/\/ waits forever\n\tTestThread thread3(0); \/\/ waits forever\n\tTestThread thread4(0); \/\/ waits forever\n\tTestThread thread5(0); \/\/ waits forever\n\n\tfor (int i = 0; i < 10; i++) {\n\t\t\/\/ test waiting for a given time\n\t\tpassedTimedMonitor = 0;\n\t\tthread1.start(); \/\/ wait for 15ms at mutex before resuming\n\t\tThread::sleepMs(10);\n\t\tassert(passedTimedMonitor == 0); \/\/ thread1 should not have passed\n\t\tThread::sleepMs(60);\n\t\tassert(passedTimedMonitor == 1); \/\/ thread1 should have passed\n\t\tassert(!thread1.isStarted());\n\n\t\t\/\/ test signalling a set of threads\n\t\tpassedTimedMonitor = 0;\n\t\tthread2.start();\n\t\tthread3.start();\n\t\tthread4.start();\n\t\tthread5.start();\n\t\tThread::sleepMs(5);\n\t\ttestTimedMonitor.signal(2); \/\/ signal 2 threads\n\t\tThread::sleepMs(20);\n\t\tassert(passedTimedMonitor == 2);\n\t\ttestTimedMonitor.signal(1); \/\/ signal another thread\n\t\tThread::sleepMs(20);\n\t\tassert(passedTimedMonitor == 3);\n\t\ttestTimedMonitor.broadcast(); \/\/ signal last thread\n\t\tThread::sleepMs(20);\n\t\tassert(passedTimedMonitor == 4);\n\t\tassert(!thread2.isStarted() && !thread3.isStarted() && !thread4.isStarted() && !thread5.isStarted());\n\n\t\t\/\/ test timed and unlimited waiting\n\t\tpassedTimedMonitor = 0;\n\t\tthread1.start();\n\t\tthread2.start(); \/\/ with another thread\n\t\tthread3.start(); \/\/ with another thread\n\t\tThread::sleepMs(5);\n\t\ttestTimedMonitor.signal(); \/\/ explicit signal\n\t\tThread::sleepMs(20);\n\t\tassert(passedTimedMonitor == 1);\n\t\t\/\/ wo do not know which thread passed\n\t\tassert(!thread1.isStarted() || !thread2.isStarted() || !thread3.isStarted());\n\t\tif (thread1.isStarted()) {\n\t\t\t\/\/ thread1 is still running, just wait\n\t\t\tThread::sleepMs(60);\n\t\t\tassert(passedTimedMonitor == 2);\n\t\t}\n\t\ttestTimedMonitor.broadcast(); \/\/ explicit signal\n\t\tThread::sleepMs(20);\n\t\tassert(passedTimedMonitor == 3);\n\t\tassert(!thread1.isStarted() && !thread2.isStarted() && !thread3.isStarted());\n\n\t\t\/\/ test signalling prior to waiting\n\t\tpassedTimedMonitor = 0;\n\t\ttestTimedMonitor.signal();\n\t\tthread1.start();\n\t\tThread::sleepMs(10);\n\t\tthread2.start();\n\t\tThread::sleepMs(10);\n\t\tassert(passedTimedMonitor == 1);\n\t\tassert(!thread1.isStarted());\n\t\tassert(thread2.isStarted());\n\t\ttestTimedMonitor.signal();\n\t\tThread::sleepMs(20);\n\t\tassert(passedTimedMonitor == 2);\n\n\t\tassert(!thread1.isStarted());\n\t\tassert(!thread2.isStarted());\n\t\tassert(!thread3.isStarted());\n\n\t}\n\treturn true;\n}\n\nclass FooTracer : public Traceable, public Thread {\n\tvoid run() {\n\t\twhile(isStarted()) {\n\t\t\ttrace(\"This is foo\");\n\t\t\tThread::sleepMs(20);\n\t\t}\n\t}\n\n void retrace(const std::string& msg, std::map<std::string, std::string> info) {\n };\n\n\n};\n\nbool testTracing() {\n\tFooTracer* tr1 = new FooTracer();\n\tFooTracer* tr2 = new FooTracer();\n\tFooTracer* tr3 = new FooTracer();\n\n\ttr1->setTraceFile(\"trace.txt\");\n\ttr2->setTraceFile(\"trace.txt\");\n\ttr3->setTraceFile(\"trace.txt\");\n\n\ttr1->start();\n\ttr2->start();\n\ttr3->start();\n\n\tThread::sleepMs(100);\n\tdelete tr1;\n\tdelete tr2;\n\tdelete tr3;\n\n Thread::sleepMs(100);\n\n FooTracer* tr4 = new FooTracer();\n tr4->replay(\"trace.txt\");\n\n\treturn true;\n}\n\nint main(int argc, char** argv) {\n\tif(!testTracing())\n\t\treturn EXIT_FAILURE;\n\tif(!testRecursiveMutex())\n\t\treturn EXIT_FAILURE;\n\tif(!testThreads())\n\t\treturn EXIT_FAILURE;\n\tif(!testMonitors())\n\t\treturn EXIT_FAILURE;\n\tif(!testTimedMonitors())\n\t\treturn EXIT_FAILURE;\n}\n<|endoftext|>"} {"text":"<commit_before>\/*\n * Copyright 2017 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 \"pc\/rtp_transceiver.h\"\n\n#include <string>\n\n#include \"absl\/algorithm\/container.h\"\n#include \"pc\/channel_manager.h\"\n#include \"pc\/rtp_media_utils.h\"\n#include \"pc\/rtp_parameters_conversion.h\"\n#include \"rtc_base\/checks.h\"\n#include \"rtc_base\/logging.h\"\n\nnamespace webrtc {\n\nRtpTransceiver::RtpTransceiver(cricket::MediaType media_type)\n : unified_plan_(false), media_type_(media_type) {\n RTC_DCHECK(media_type == cricket::MEDIA_TYPE_AUDIO ||\n media_type == cricket::MEDIA_TYPE_VIDEO);\n}\n\nRtpTransceiver::RtpTransceiver(\n rtc::scoped_refptr<RtpSenderProxyWithInternal<RtpSenderInternal>> sender,\n rtc::scoped_refptr<RtpReceiverProxyWithInternal<RtpReceiverInternal>>\n receiver,\n cricket::ChannelManager* channel_manager)\n : unified_plan_(true),\n media_type_(sender->media_type()),\n channel_manager_(channel_manager) {\n RTC_DCHECK(media_type_ == cricket::MEDIA_TYPE_AUDIO ||\n media_type_ == cricket::MEDIA_TYPE_VIDEO);\n RTC_DCHECK_EQ(sender->media_type(), receiver->media_type());\n senders_.push_back(sender);\n receivers_.push_back(receiver);\n}\n\nRtpTransceiver::~RtpTransceiver() {\n Stop();\n}\n\nvoid RtpTransceiver::SetChannel(cricket::ChannelInterface* channel) {\n \/\/ Cannot set a non-null channel on a stopped transceiver.\n if (stopped_ && channel) {\n return;\n }\n\n if (channel) {\n RTC_DCHECK_EQ(media_type(), channel->media_type());\n }\n\n if (channel_) {\n channel_->SignalFirstPacketReceived().disconnect(this);\n }\n\n channel_ = channel;\n\n if (channel_) {\n channel_->SignalFirstPacketReceived().connect(\n this, &RtpTransceiver::OnFirstPacketReceived);\n }\n\n for (const auto& sender : senders_) {\n sender->internal()->SetMediaChannel(channel_ ? channel_->media_channel()\n : nullptr);\n }\n\n for (const auto& receiver : receivers_) {\n if (!channel_) {\n receiver->internal()->Stop();\n }\n\n receiver->internal()->SetMediaChannel(channel_ ? channel_->media_channel()\n : nullptr);\n }\n}\n\nvoid RtpTransceiver::AddSender(\n rtc::scoped_refptr<RtpSenderProxyWithInternal<RtpSenderInternal>> sender) {\n RTC_DCHECK(!stopped_);\n RTC_DCHECK(!unified_plan_);\n RTC_DCHECK(sender);\n RTC_DCHECK_EQ(media_type(), sender->media_type());\n RTC_DCHECK(!absl::c_linear_search(senders_, sender));\n senders_.push_back(sender);\n}\n\nbool RtpTransceiver::RemoveSender(RtpSenderInterface* sender) {\n RTC_DCHECK(!unified_plan_);\n if (sender) {\n RTC_DCHECK_EQ(media_type(), sender->media_type());\n }\n auto it = absl::c_find(senders_, sender);\n if (it == senders_.end()) {\n return false;\n }\n (*it)->internal()->Stop();\n senders_.erase(it);\n return true;\n}\n\nvoid RtpTransceiver::AddReceiver(\n rtc::scoped_refptr<RtpReceiverProxyWithInternal<RtpReceiverInternal>>\n receiver) {\n RTC_DCHECK(!stopped_);\n RTC_DCHECK(!unified_plan_);\n RTC_DCHECK(receiver);\n RTC_DCHECK_EQ(media_type(), receiver->media_type());\n RTC_DCHECK(!absl::c_linear_search(receivers_, receiver));\n receivers_.push_back(receiver);\n}\n\nbool RtpTransceiver::RemoveReceiver(RtpReceiverInterface* receiver) {\n RTC_DCHECK(!unified_plan_);\n if (receiver) {\n RTC_DCHECK_EQ(media_type(), receiver->media_type());\n }\n auto it = absl::c_find(receivers_, receiver);\n if (it == receivers_.end()) {\n return false;\n }\n (*it)->internal()->Stop();\n receivers_.erase(it);\n return true;\n}\n\nrtc::scoped_refptr<RtpSenderInternal> RtpTransceiver::sender_internal() const {\n RTC_DCHECK(unified_plan_);\n RTC_CHECK_EQ(1u, senders_.size());\n return senders_[0]->internal();\n}\n\nrtc::scoped_refptr<RtpReceiverInternal> RtpTransceiver::receiver_internal()\n const {\n RTC_DCHECK(unified_plan_);\n RTC_CHECK_EQ(1u, receivers_.size());\n return receivers_[0]->internal();\n}\n\ncricket::MediaType RtpTransceiver::media_type() const {\n return media_type_;\n}\n\nabsl::optional<std::string> RtpTransceiver::mid() const {\n return mid_;\n}\n\nvoid RtpTransceiver::OnFirstPacketReceived(cricket::ChannelInterface*) {\n for (const auto& receiver : receivers_) {\n receiver->internal()->NotifyFirstPacketReceived();\n }\n}\n\nrtc::scoped_refptr<RtpSenderInterface> RtpTransceiver::sender() const {\n RTC_DCHECK(unified_plan_);\n RTC_CHECK_EQ(1u, senders_.size());\n return senders_[0];\n}\n\nrtc::scoped_refptr<RtpReceiverInterface> RtpTransceiver::receiver() const {\n RTC_DCHECK(unified_plan_);\n RTC_CHECK_EQ(1u, receivers_.size());\n return receivers_[0];\n}\n\nvoid RtpTransceiver::set_current_direction(RtpTransceiverDirection direction) {\n RTC_LOG(LS_INFO) << \"Changing transceiver (MID=\" << mid_.value_or(\"<not set>\")\n << \") current direction from \"\n << (current_direction_ ? RtpTransceiverDirectionToString(\n *current_direction_)\n : \"<not set>\")\n << \" to \" << RtpTransceiverDirectionToString(direction)\n << \".\";\n current_direction_ = direction;\n if (RtpTransceiverDirectionHasSend(*current_direction_)) {\n has_ever_been_used_to_send_ = true;\n }\n}\n\nvoid RtpTransceiver::set_fired_direction(RtpTransceiverDirection direction) {\n fired_direction_ = direction;\n}\n\nbool RtpTransceiver::stopped() const {\n return stopped_;\n}\n\nRtpTransceiverDirection RtpTransceiver::direction() const {\n return direction_;\n}\n\nvoid RtpTransceiver::SetDirection(RtpTransceiverDirection new_direction) {\n if (stopped()) {\n return;\n }\n if (new_direction == direction_) {\n return;\n }\n direction_ = new_direction;\n SignalNegotiationNeeded();\n}\n\nabsl::optional<RtpTransceiverDirection> RtpTransceiver::current_direction()\n const {\n return current_direction_;\n}\n\nabsl::optional<RtpTransceiverDirection> RtpTransceiver::fired_direction()\n const {\n return fired_direction_;\n}\n\nvoid RtpTransceiver::Stop() {\n for (const auto& sender : senders_) {\n sender->internal()->Stop();\n }\n for (const auto& receiver : receivers_) {\n receiver->internal()->Stop();\n }\n stopped_ = true;\n current_direction_ = absl::nullopt;\n}\n\nRTCError RtpTransceiver::SetCodecPreferences(\n rtc::ArrayView<RtpCodecCapability> codec_capabilities) {\n RTC_DCHECK(unified_plan_);\n\n \/\/ 3. If codecs is an empty list, set transceiver's [[PreferredCodecs]] slot\n \/\/ to codecs and abort these steps.\n if (codec_capabilities.empty()) {\n codec_preferences_.clear();\n return RTCError::OK();\n }\n\n \/\/ 4. Remove any duplicate values in codecs.\n std::vector<RtpCodecCapability> codecs;\n absl::c_remove_copy_if(codec_capabilities, std::back_inserter(codecs),\n [&codecs](const RtpCodecCapability& codec) {\n return absl::c_linear_search(codecs, codec);\n });\n\n if (media_type_ == cricket::MEDIA_TYPE_AUDIO) {\n std::vector<cricket::AudioCodec> audio_codecs;\n\n std::vector<cricket::AudioCodec> recv_codecs, send_codecs;\n channel_manager_->GetSupportedAudioReceiveCodecs(&recv_codecs);\n channel_manager_->GetSupportedAudioSendCodecs(&send_codecs);\n\n \/\/ 6. If the intersection between codecs and\n \/\/ RTCRtpSender.getCapabilities(kind).codecs or the intersection between\n \/\/ codecs and RTCRtpReceiver.getCapabilities(kind).codecs only contains RTX,\n \/\/ RED or FEC codecs or is an empty set, throw InvalidModificationError.\n \/\/ This ensures that we always have something to offer, regardless of\n \/\/ transceiver.direction.\n\n if (!absl::c_any_of(\n codecs, [&recv_codecs](const RtpCodecCapability& codec) {\n return codec.name != cricket::kRtxCodecName &&\n codec.name != cricket::kRedCodecName &&\n codec.name != cricket::kFlexfecCodecName &&\n absl::c_any_of(\n recv_codecs,\n [&codec](const cricket::AudioCodec& recv_codec) {\n return recv_codec.MatchesCapability(codec);\n });\n })) {\n return RTCError(RTCErrorType::INVALID_MODIFICATION,\n \"Invalid codec preferences: Missing codec from recv \"\n \"codec capabilities.\");\n }\n\n if (!absl::c_any_of(\n codecs, [&send_codecs](const RtpCodecCapability& codec) {\n return codec.name != cricket::kRtxCodecName &&\n codec.name != cricket::kRedCodecName &&\n codec.name != cricket::kFlexfecCodecName &&\n absl::c_any_of(\n send_codecs,\n [&codec](const cricket::AudioCodec& send_codec) {\n return send_codec.MatchesCapability(codec);\n });\n })) {\n return RTCError(RTCErrorType::INVALID_MODIFICATION,\n \"Invalid codec preferences: Missing codec from send \"\n \"codec capabilities.\");\n }\n\n \/\/ 7. Let codecCapabilities be the union of\n \/\/ RTCRtpSender.getCapabilities(kind).codecs and\n \/\/ RTCRtpReceiver.getCapabilities(kind).codecs. 8.1 For each codec in\n \/\/ codecs, If codec is not in codecCapabilities, throw\n \/\/ InvalidModificationError.\n for (const auto& codec_preference : codecs) {\n bool is_recv_codec = absl::c_any_of(\n recv_codecs, [&codec_preference](const cricket::AudioCodec& codec) {\n return codec.MatchesCapability(codec_preference);\n });\n\n bool is_send_codec = absl::c_any_of(\n send_codecs, [&codec_preference](const cricket::AudioCodec& codec) {\n return codec.MatchesCapability(codec_preference);\n });\n\n if (!is_recv_codec && !is_send_codec) {\n return RTCError(\n RTCErrorType::INVALID_MODIFICATION,\n std::string(\n \"Invalid codec preferences: invalid codec with name \\\"\") +\n codec_preference.name + \"\\\".\");\n }\n }\n } else if (media_type_ == cricket::MEDIA_TYPE_VIDEO) {\n std::vector<cricket::VideoCodec> video_codecs;\n \/\/ Video codecs are both for the receive and send side, so the checks are\n \/\/ simpler than the audio ones.\n channel_manager_->GetSupportedVideoCodecs(&video_codecs);\n\n \/\/ Validate codecs\n for (const auto& codec_preference : codecs) {\n if (!absl::c_any_of(video_codecs, [&codec_preference](\n const cricket::VideoCodec& codec) {\n return codec.MatchesCapability(codec_preference);\n })) {\n return RTCError(\n RTCErrorType::INVALID_MODIFICATION,\n std::string(\n \"Invalid codec preferences: invalid codec with name \\\"\") +\n codec_preference.name + \"\\\".\");\n }\n }\n }\n\n \/\/ Check we have a real codec (not just rtx, red or fec)\n if (absl::c_all_of(codecs, [](const RtpCodecCapability& codec) {\n return codec.name == cricket::kRtxCodecName ||\n codec.name == cricket::kRedCodecName ||\n codec.name == cricket::kUlpfecCodecName;\n })) {\n return RTCError(RTCErrorType::INVALID_MODIFICATION,\n \"Invalid codec preferences: codec list must have a non \"\n \"RTX, RED or FEC entry.\");\n }\n\n codec_preferences_ = codecs;\n\n return RTCError::OK();\n}\n\n} \/\/ namespace webrtc\n<commit_msg>Fix Heap-use-after-free.<commit_after>\/*\n * Copyright 2017 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 \"pc\/rtp_transceiver.h\"\n\n#include <string>\n\n#include \"absl\/algorithm\/container.h\"\n#include \"pc\/channel_manager.h\"\n#include \"pc\/rtp_media_utils.h\"\n#include \"pc\/rtp_parameters_conversion.h\"\n#include \"rtc_base\/checks.h\"\n#include \"rtc_base\/logging.h\"\n\nnamespace webrtc {\n\nRtpTransceiver::RtpTransceiver(cricket::MediaType media_type)\n : unified_plan_(false), media_type_(media_type) {\n RTC_DCHECK(media_type == cricket::MEDIA_TYPE_AUDIO ||\n media_type == cricket::MEDIA_TYPE_VIDEO);\n}\n\nRtpTransceiver::RtpTransceiver(\n rtc::scoped_refptr<RtpSenderProxyWithInternal<RtpSenderInternal>> sender,\n rtc::scoped_refptr<RtpReceiverProxyWithInternal<RtpReceiverInternal>>\n receiver,\n cricket::ChannelManager* channel_manager)\n : unified_plan_(true),\n media_type_(sender->media_type()),\n channel_manager_(channel_manager) {\n RTC_DCHECK(media_type_ == cricket::MEDIA_TYPE_AUDIO ||\n media_type_ == cricket::MEDIA_TYPE_VIDEO);\n RTC_DCHECK_EQ(sender->media_type(), receiver->media_type());\n senders_.push_back(sender);\n receivers_.push_back(receiver);\n}\n\nRtpTransceiver::~RtpTransceiver() {\n Stop();\n}\n\nvoid RtpTransceiver::SetChannel(cricket::ChannelInterface* channel) {\n \/\/ Cannot set a non-null channel on a stopped transceiver.\n if (stopped_ && channel) {\n return;\n }\n\n if (channel) {\n RTC_DCHECK_EQ(media_type(), channel->media_type());\n }\n\n if (channel_) {\n channel_->SignalFirstPacketReceived().disconnect(this);\n }\n\n channel_ = channel;\n\n if (channel_) {\n channel_->SignalFirstPacketReceived().connect(\n this, &RtpTransceiver::OnFirstPacketReceived);\n }\n\n for (const auto& sender : senders_) {\n sender->internal()->SetMediaChannel(channel_ ? channel_->media_channel()\n : nullptr);\n }\n\n for (const auto& receiver : receivers_) {\n if (!channel_) {\n receiver->internal()->Stop();\n }\n\n receiver->internal()->SetMediaChannel(channel_ ? channel_->media_channel()\n : nullptr);\n }\n}\n\nvoid RtpTransceiver::AddSender(\n rtc::scoped_refptr<RtpSenderProxyWithInternal<RtpSenderInternal>> sender) {\n RTC_DCHECK(!stopped_);\n RTC_DCHECK(!unified_plan_);\n RTC_DCHECK(sender);\n RTC_DCHECK_EQ(media_type(), sender->media_type());\n RTC_DCHECK(!absl::c_linear_search(senders_, sender));\n senders_.push_back(sender);\n}\n\nbool RtpTransceiver::RemoveSender(RtpSenderInterface* sender) {\n RTC_DCHECK(!unified_plan_);\n if (sender) {\n RTC_DCHECK_EQ(media_type(), sender->media_type());\n }\n auto it = absl::c_find(senders_, sender);\n if (it == senders_.end()) {\n return false;\n }\n (*it)->internal()->Stop();\n senders_.erase(it);\n return true;\n}\n\nvoid RtpTransceiver::AddReceiver(\n rtc::scoped_refptr<RtpReceiverProxyWithInternal<RtpReceiverInternal>>\n receiver) {\n RTC_DCHECK(!stopped_);\n RTC_DCHECK(!unified_plan_);\n RTC_DCHECK(receiver);\n RTC_DCHECK_EQ(media_type(), receiver->media_type());\n RTC_DCHECK(!absl::c_linear_search(receivers_, receiver));\n receivers_.push_back(receiver);\n}\n\nbool RtpTransceiver::RemoveReceiver(RtpReceiverInterface* receiver) {\n RTC_DCHECK(!unified_plan_);\n if (receiver) {\n RTC_DCHECK_EQ(media_type(), receiver->media_type());\n }\n auto it = absl::c_find(receivers_, receiver);\n if (it == receivers_.end()) {\n return false;\n }\n (*it)->internal()->Stop();\n \/\/ After the receiver has been removed, there's no guarantee that the\n \/\/ contained media channel isn't deleted shortly after this. To make sure that\n \/\/ the receiver doesn't spontaneously try to use it's (potentially stale)\n \/\/ media channel reference, we clear it out.\n (*it)->internal()->SetMediaChannel(nullptr);\n receivers_.erase(it);\n return true;\n}\n\nrtc::scoped_refptr<RtpSenderInternal> RtpTransceiver::sender_internal() const {\n RTC_DCHECK(unified_plan_);\n RTC_CHECK_EQ(1u, senders_.size());\n return senders_[0]->internal();\n}\n\nrtc::scoped_refptr<RtpReceiverInternal> RtpTransceiver::receiver_internal()\n const {\n RTC_DCHECK(unified_plan_);\n RTC_CHECK_EQ(1u, receivers_.size());\n return receivers_[0]->internal();\n}\n\ncricket::MediaType RtpTransceiver::media_type() const {\n return media_type_;\n}\n\nabsl::optional<std::string> RtpTransceiver::mid() const {\n return mid_;\n}\n\nvoid RtpTransceiver::OnFirstPacketReceived(cricket::ChannelInterface*) {\n for (const auto& receiver : receivers_) {\n receiver->internal()->NotifyFirstPacketReceived();\n }\n}\n\nrtc::scoped_refptr<RtpSenderInterface> RtpTransceiver::sender() const {\n RTC_DCHECK(unified_plan_);\n RTC_CHECK_EQ(1u, senders_.size());\n return senders_[0];\n}\n\nrtc::scoped_refptr<RtpReceiverInterface> RtpTransceiver::receiver() const {\n RTC_DCHECK(unified_plan_);\n RTC_CHECK_EQ(1u, receivers_.size());\n return receivers_[0];\n}\n\nvoid RtpTransceiver::set_current_direction(RtpTransceiverDirection direction) {\n RTC_LOG(LS_INFO) << \"Changing transceiver (MID=\" << mid_.value_or(\"<not set>\")\n << \") current direction from \"\n << (current_direction_ ? RtpTransceiverDirectionToString(\n *current_direction_)\n : \"<not set>\")\n << \" to \" << RtpTransceiverDirectionToString(direction)\n << \".\";\n current_direction_ = direction;\n if (RtpTransceiverDirectionHasSend(*current_direction_)) {\n has_ever_been_used_to_send_ = true;\n }\n}\n\nvoid RtpTransceiver::set_fired_direction(RtpTransceiverDirection direction) {\n fired_direction_ = direction;\n}\n\nbool RtpTransceiver::stopped() const {\n return stopped_;\n}\n\nRtpTransceiverDirection RtpTransceiver::direction() const {\n return direction_;\n}\n\nvoid RtpTransceiver::SetDirection(RtpTransceiverDirection new_direction) {\n if (stopped()) {\n return;\n }\n if (new_direction == direction_) {\n return;\n }\n direction_ = new_direction;\n SignalNegotiationNeeded();\n}\n\nabsl::optional<RtpTransceiverDirection> RtpTransceiver::current_direction()\n const {\n return current_direction_;\n}\n\nabsl::optional<RtpTransceiverDirection> RtpTransceiver::fired_direction()\n const {\n return fired_direction_;\n}\n\nvoid RtpTransceiver::Stop() {\n for (const auto& sender : senders_) {\n sender->internal()->Stop();\n }\n for (const auto& receiver : receivers_) {\n receiver->internal()->Stop();\n }\n stopped_ = true;\n current_direction_ = absl::nullopt;\n}\n\nRTCError RtpTransceiver::SetCodecPreferences(\n rtc::ArrayView<RtpCodecCapability> codec_capabilities) {\n RTC_DCHECK(unified_plan_);\n\n \/\/ 3. If codecs is an empty list, set transceiver's [[PreferredCodecs]] slot\n \/\/ to codecs and abort these steps.\n if (codec_capabilities.empty()) {\n codec_preferences_.clear();\n return RTCError::OK();\n }\n\n \/\/ 4. Remove any duplicate values in codecs.\n std::vector<RtpCodecCapability> codecs;\n absl::c_remove_copy_if(codec_capabilities, std::back_inserter(codecs),\n [&codecs](const RtpCodecCapability& codec) {\n return absl::c_linear_search(codecs, codec);\n });\n\n if (media_type_ == cricket::MEDIA_TYPE_AUDIO) {\n std::vector<cricket::AudioCodec> audio_codecs;\n\n std::vector<cricket::AudioCodec> recv_codecs, send_codecs;\n channel_manager_->GetSupportedAudioReceiveCodecs(&recv_codecs);\n channel_manager_->GetSupportedAudioSendCodecs(&send_codecs);\n\n \/\/ 6. If the intersection between codecs and\n \/\/ RTCRtpSender.getCapabilities(kind).codecs or the intersection between\n \/\/ codecs and RTCRtpReceiver.getCapabilities(kind).codecs only contains RTX,\n \/\/ RED or FEC codecs or is an empty set, throw InvalidModificationError.\n \/\/ This ensures that we always have something to offer, regardless of\n \/\/ transceiver.direction.\n\n if (!absl::c_any_of(\n codecs, [&recv_codecs](const RtpCodecCapability& codec) {\n return codec.name != cricket::kRtxCodecName &&\n codec.name != cricket::kRedCodecName &&\n codec.name != cricket::kFlexfecCodecName &&\n absl::c_any_of(\n recv_codecs,\n [&codec](const cricket::AudioCodec& recv_codec) {\n return recv_codec.MatchesCapability(codec);\n });\n })) {\n return RTCError(RTCErrorType::INVALID_MODIFICATION,\n \"Invalid codec preferences: Missing codec from recv \"\n \"codec capabilities.\");\n }\n\n if (!absl::c_any_of(\n codecs, [&send_codecs](const RtpCodecCapability& codec) {\n return codec.name != cricket::kRtxCodecName &&\n codec.name != cricket::kRedCodecName &&\n codec.name != cricket::kFlexfecCodecName &&\n absl::c_any_of(\n send_codecs,\n [&codec](const cricket::AudioCodec& send_codec) {\n return send_codec.MatchesCapability(codec);\n });\n })) {\n return RTCError(RTCErrorType::INVALID_MODIFICATION,\n \"Invalid codec preferences: Missing codec from send \"\n \"codec capabilities.\");\n }\n\n \/\/ 7. Let codecCapabilities be the union of\n \/\/ RTCRtpSender.getCapabilities(kind).codecs and\n \/\/ RTCRtpReceiver.getCapabilities(kind).codecs. 8.1 For each codec in\n \/\/ codecs, If codec is not in codecCapabilities, throw\n \/\/ InvalidModificationError.\n for (const auto& codec_preference : codecs) {\n bool is_recv_codec = absl::c_any_of(\n recv_codecs, [&codec_preference](const cricket::AudioCodec& codec) {\n return codec.MatchesCapability(codec_preference);\n });\n\n bool is_send_codec = absl::c_any_of(\n send_codecs, [&codec_preference](const cricket::AudioCodec& codec) {\n return codec.MatchesCapability(codec_preference);\n });\n\n if (!is_recv_codec && !is_send_codec) {\n return RTCError(\n RTCErrorType::INVALID_MODIFICATION,\n std::string(\n \"Invalid codec preferences: invalid codec with name \\\"\") +\n codec_preference.name + \"\\\".\");\n }\n }\n } else if (media_type_ == cricket::MEDIA_TYPE_VIDEO) {\n std::vector<cricket::VideoCodec> video_codecs;\n \/\/ Video codecs are both for the receive and send side, so the checks are\n \/\/ simpler than the audio ones.\n channel_manager_->GetSupportedVideoCodecs(&video_codecs);\n\n \/\/ Validate codecs\n for (const auto& codec_preference : codecs) {\n if (!absl::c_any_of(video_codecs, [&codec_preference](\n const cricket::VideoCodec& codec) {\n return codec.MatchesCapability(codec_preference);\n })) {\n return RTCError(\n RTCErrorType::INVALID_MODIFICATION,\n std::string(\n \"Invalid codec preferences: invalid codec with name \\\"\") +\n codec_preference.name + \"\\\".\");\n }\n }\n }\n\n \/\/ Check we have a real codec (not just rtx, red or fec)\n if (absl::c_all_of(codecs, [](const RtpCodecCapability& codec) {\n return codec.name == cricket::kRtxCodecName ||\n codec.name == cricket::kRedCodecName ||\n codec.name == cricket::kUlpfecCodecName;\n })) {\n return RTCError(RTCErrorType::INVALID_MODIFICATION,\n \"Invalid codec preferences: codec list must have a non \"\n \"RTX, RED or FEC entry.\");\n }\n\n codec_preferences_ = codecs;\n\n return RTCError::OK();\n}\n\n} \/\/ namespace webrtc\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 \"QmitkMorphologicalOperationsWidget.h\"\n#include <mitkSliceNavigationController.h>\n#include <mitkMorphologicalOperations.h>\n#include \"mitkProgressBar.h\"\n\nstatic const char* const HelpText = \"Select a segmentation above\";\n\nQmitkMorphologicalOperationsWidget::QmitkMorphologicalOperationsWidget(mitk::SliceNavigationController* timeNavigationController, QWidget* parent)\n: QmitkSegmentationUtilityWidget(timeNavigationController, parent)\n{\n m_Controls.setupUi(this);\n\n m_Controls.dataSelectionWidget->AddDataStorageComboBox(QmitkDataSelectionWidget::SegmentationPredicate);\n m_Controls.dataSelectionWidget->SetHelpText(HelpText);\n\n connect(m_Controls.btnClosing, SIGNAL(clicked()), this, SLOT(OnbtnClosingClicked()) );\n connect(m_Controls.btnOpening, SIGNAL(clicked()), this, SLOT(OnbtnOpeningClicked()) );\n connect(m_Controls.btnDilatation, SIGNAL(clicked()), this, SLOT(OnbtnDilatationClicked()) );\n connect(m_Controls.btnErosion, SIGNAL(clicked()), this, SLOT(OnbtnErosionClicked()) );\n connect(m_Controls.btnFillHoles, SIGNAL(clicked()), this, SLOT(OnbtnFillHolesClicked()) );\n\n connect(m_Controls.radioButtonMorphoCross, SIGNAL(clicked()), this, SLOT(OnRadioButtonsClicked()) );\n connect(m_Controls.radioButtonMorphoBall, SIGNAL(clicked()), this, SLOT(OnRadioButtonsClicked()) );\n\n connect(m_Controls.dataSelectionWidget, SIGNAL(SelectionChanged(unsigned int, const mitk::DataNode*)), this, SLOT(OnSelectionChanged(unsigned int, const mitk::DataNode*)));\n}\n\nQmitkMorphologicalOperationsWidget::~QmitkMorphologicalOperationsWidget()\n{\n}\n\n\nvoid QmitkMorphologicalOperationsWidget::OnSelectionChanged(unsigned int index, const mitk::DataNode* selection)\n{\n QmitkDataSelectionWidget* dataSelectionWidget = m_Controls.dataSelectionWidget;\n mitk::DataNode::Pointer node = dataSelectionWidget->GetSelection(0);\n\n if (node.IsNotNull())\n {\n m_Controls.dataSelectionWidget->SetHelpText(\"\");\n this->EnableButtons(true);\n }\n else\n {\n m_Controls.dataSelectionWidget->SetHelpText(HelpText);\n this->EnableButtons(false);\n }\n}\n\n\nvoid QmitkMorphologicalOperationsWidget::EnableButtons(bool enable)\n{\n m_Controls.btnClosing->setEnabled(enable);\n m_Controls.btnDilatation->setEnabled(enable);\n m_Controls.btnErosion->setEnabled(enable);\n m_Controls.btnFillHoles->setEnabled(enable);\n m_Controls.btnOpening->setEnabled(enable);\n}\n\nvoid QmitkMorphologicalOperationsWidget::OnRadioButtonsClicked()\n{\n m_Controls.sliderMorphFactor->setEnabled(\n m_Controls.radioButtonMorphoBall->isChecked());\n\n m_Controls.spinBoxMorphFactor->setEnabled(\n m_Controls.radioButtonMorphoBall->isChecked());\n}\n\nvoid QmitkMorphologicalOperationsWidget::OnbtnClosingClicked()\n{\n QApplication::setOverrideCursor(QCursor(Qt::BusyCursor)); \/\/Enable Busy Cursor\n\n mitk::RenderingManager::GetInstance()->RequestUpdateAll();\n QmitkDataSelectionWidget* dataSelectionWidget = m_Controls.dataSelectionWidget;\n mitk::DataNode::Pointer node = dataSelectionWidget->GetSelection(0);\n mitk::Image::Pointer image = dynamic_cast< mitk::Image* >(node->GetData());\n mitk::MorphologicalOperations::StructuralElementType structuralElement;\n\n if (m_Controls.radioButtonMorphoBall->isChecked())\n structuralElement = mitk::MorphologicalOperations::BALL;\n else\n structuralElement = mitk::MorphologicalOperations::CUBE;\n\n try\n {\n mitk::MorphologicalOperations::Closing(image, m_Controls.spinBoxMorphFactor->value(), structuralElement);\n }\n catch ( itk::ExceptionObject* itkObj)\n {\n MITK_WARN << \"Exception caught: \" << itkObj->GetDescription();\n QApplication::restoreOverrideCursor(); \/\/Disable Busy Cursor\n }\n\n node->SetData(image);\n mitk::RenderingManager::GetInstance()->RequestUpdateAll();\n\n QApplication::restoreOverrideCursor(); \/\/Disable Busy Cursor\n}\n\nvoid QmitkMorphologicalOperationsWidget::OnbtnOpeningClicked()\n{\n QApplication::setOverrideCursor(QCursor(Qt::BusyCursor)); \/\/Enable Busy Cursor\n\n mitk::RenderingManager::GetInstance()->RequestUpdateAll();\n QmitkDataSelectionWidget* dataSelectionWidget = m_Controls.dataSelectionWidget;\n mitk::DataNode::Pointer node = dataSelectionWidget->GetSelection(0);\n mitk::Image::Pointer image = dynamic_cast< mitk::Image* >(node->GetData());\n mitk::MorphologicalOperations::StructuralElementType structuralElement;\n\n if (m_Controls.radioButtonMorphoBall->isChecked())\n structuralElement = mitk::MorphologicalOperations::BALL;\n else\n structuralElement = mitk::MorphologicalOperations::CUBE;\n\n try\n {\n mitk::MorphologicalOperations::Opening(image, m_Controls.spinBoxMorphFactor->value(), structuralElement);\n }\n catch ( itk::ExceptionObject* itkObj)\n {\n MITK_WARN << \"Exception caught: \" << itkObj->GetDescription();\n QApplication::restoreOverrideCursor(); \/\/Disable Busy Cursor\n }\n\n node->SetData(image);\n mitk::RenderingManager::GetInstance()->RequestUpdateAll();\n\n QApplication::restoreOverrideCursor(); \/\/Disable Busy Cursor\n}\n\nvoid QmitkMorphologicalOperationsWidget::OnbtnDilatationClicked()\n{\n QApplication::setOverrideCursor(QCursor(Qt::BusyCursor)); \/\/Enable Busy Cursor\n\n mitk::RenderingManager::GetInstance()->RequestUpdateAll();\n QmitkDataSelectionWidget* dataSelectionWidget = m_Controls.dataSelectionWidget;\n mitk::DataNode::Pointer node = dataSelectionWidget->GetSelection(0);\n mitk::Image::Pointer image = dynamic_cast< mitk::Image* >(node->GetData());\n mitk::MorphologicalOperations::StructuralElementType structuralElement;\n\n if (m_Controls.radioButtonMorphoBall->isChecked())\n structuralElement = mitk::MorphologicalOperations::BALL;\n else\n structuralElement = mitk::MorphologicalOperations::CUBE;\n\n try\n {\n mitk::MorphologicalOperations::Dilate(image, m_Controls.spinBoxMorphFactor->value(), structuralElement);\n }\n catch ( itk::ExceptionObject* itkObj)\n {\n MITK_WARN << \"Exception caught: \" << itkObj->GetDescription();\n QApplication::restoreOverrideCursor(); \/\/Disable Busy Cursor\n }\n\n node->SetData(image);\n mitk::RenderingManager::GetInstance()->RequestUpdateAll();\n\n QApplication::restoreOverrideCursor(); \/\/Disable Busy Cursor\n}\n\nvoid QmitkMorphologicalOperationsWidget::OnbtnErosionClicked()\n{\n QApplication::setOverrideCursor(QCursor(Qt::BusyCursor)); \/\/Enable Busy Cursor\n\n mitk::RenderingManager::GetInstance()->RequestUpdateAll();\n QmitkDataSelectionWidget* dataSelectionWidget = m_Controls.dataSelectionWidget;\n mitk::DataNode::Pointer node = dataSelectionWidget->GetSelection(0);\n mitk::Image::Pointer image = dynamic_cast< mitk::Image* >(node->GetData());\n mitk::MorphologicalOperations::StructuralElementType structuralElement;\n\n if (m_Controls.radioButtonMorphoBall->isChecked())\n structuralElement = mitk::MorphologicalOperations::BALL;\n else\n structuralElement = mitk::MorphologicalOperations::CUBE;\n\n try\n {\n mitk::MorphologicalOperations::Erode(image, m_Controls.spinBoxMorphFactor->value(), structuralElement);\n }\n catch ( itk::ExceptionObject* itkObj)\n {\n MITK_WARN << \"Exception caught: \" << itkObj->GetDescription();\n QApplication::restoreOverrideCursor(); \/\/Disable Busy Cursor\n }\n\n node->SetData(image);\n mitk::RenderingManager::GetInstance()->RequestUpdateAll();\n\n QApplication::restoreOverrideCursor(); \/\/Disable Busy Cursor\n}\n\nvoid QmitkMorphologicalOperationsWidget::OnbtnFillHolesClicked()\n{\n QApplication::setOverrideCursor(QCursor(Qt::BusyCursor)); \/\/Enable Busy Cursor\n\n mitk::RenderingManager::GetInstance()->RequestUpdateAll();\n QmitkDataSelectionWidget* dataSelectionWidget = m_Controls.dataSelectionWidget;\n mitk::DataNode::Pointer node = dataSelectionWidget->GetSelection(0);\n mitk::Image::Pointer image = dynamic_cast< mitk::Image* >(node->GetData());\n\n try\n {\n mitk::MorphologicalOperations::Fillhole(image);\n }\n catch ( itk::ExceptionObject* itkObj)\n {\n MITK_WARN << \"Exception caught: \" << itkObj->GetDescription();\n QApplication::restoreOverrideCursor(); \/\/Disable Busy Cursor\n }\n\n node->SetData(image);\n mitk::RenderingManager::GetInstance()->RequestUpdateAll();\n\n QApplication::restoreOverrideCursor(); \/\/Disable Busy Cursor\n}\n<commit_msg>Fixed wrong initialization. Now buttons are enabled correctly<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 \"QmitkMorphologicalOperationsWidget.h\"\n#include <mitkSliceNavigationController.h>\n#include <mitkMorphologicalOperations.h>\n#include \"mitkProgressBar.h\"\n\nstatic const char* const HelpText = \"Select a segmentation above\";\n\nQmitkMorphologicalOperationsWidget::QmitkMorphologicalOperationsWidget(mitk::SliceNavigationController* timeNavigationController, QWidget* parent)\n: QmitkSegmentationUtilityWidget(timeNavigationController, parent)\n{\n m_Controls.setupUi(this);\n\n m_Controls.dataSelectionWidget->AddDataStorageComboBox(QmitkDataSelectionWidget::SegmentationPredicate);\n m_Controls.dataSelectionWidget->SetHelpText(HelpText);\n\n connect(m_Controls.btnClosing, SIGNAL(clicked()), this, SLOT(OnbtnClosingClicked()) );\n connect(m_Controls.btnOpening, SIGNAL(clicked()), this, SLOT(OnbtnOpeningClicked()) );\n connect(m_Controls.btnDilatation, SIGNAL(clicked()), this, SLOT(OnbtnDilatationClicked()) );\n connect(m_Controls.btnErosion, SIGNAL(clicked()), this, SLOT(OnbtnErosionClicked()) );\n connect(m_Controls.btnFillHoles, SIGNAL(clicked()), this, SLOT(OnbtnFillHolesClicked()) );\n\n connect(m_Controls.radioButtonMorphoCross, SIGNAL(clicked()), this, SLOT(OnRadioButtonsClicked()) );\n connect(m_Controls.radioButtonMorphoBall, SIGNAL(clicked()), this, SLOT(OnRadioButtonsClicked()) );\n\n connect(m_Controls.dataSelectionWidget, SIGNAL(SelectionChanged(unsigned int, const mitk::DataNode*)),\n this, SLOT(OnSelectionChanged(unsigned int, const mitk::DataNode*)));\n\n if( m_Controls.dataSelectionWidget->GetSelection(0).IsNotNull())\n {\n this->OnSelectionChanged( 0, m_Controls.dataSelectionWidget->GetSelection(0));\n }\n}\n\nQmitkMorphologicalOperationsWidget::~QmitkMorphologicalOperationsWidget()\n{\n}\n\n\nvoid QmitkMorphologicalOperationsWidget::OnSelectionChanged(unsigned int index, const mitk::DataNode* selection)\n{\n QmitkDataSelectionWidget* dataSelectionWidget = m_Controls.dataSelectionWidget;\n mitk::DataNode::Pointer node = dataSelectionWidget->GetSelection(0);\n\n if (node.IsNotNull())\n {\n m_Controls.dataSelectionWidget->SetHelpText(\"\");\n this->EnableButtons(true);\n }\n else\n {\n m_Controls.dataSelectionWidget->SetHelpText(HelpText);\n this->EnableButtons(false);\n }\n}\n\n\nvoid QmitkMorphologicalOperationsWidget::EnableButtons(bool enable)\n{\n m_Controls.btnClosing->setEnabled(enable);\n m_Controls.btnDilatation->setEnabled(enable);\n m_Controls.btnErosion->setEnabled(enable);\n m_Controls.btnFillHoles->setEnabled(enable);\n m_Controls.btnOpening->setEnabled(enable);\n}\n\nvoid QmitkMorphologicalOperationsWidget::OnRadioButtonsClicked()\n{\n m_Controls.sliderMorphFactor->setEnabled(\n m_Controls.radioButtonMorphoBall->isChecked());\n\n m_Controls.spinBoxMorphFactor->setEnabled(\n m_Controls.radioButtonMorphoBall->isChecked());\n}\n\nvoid QmitkMorphologicalOperationsWidget::OnbtnClosingClicked()\n{\n QApplication::setOverrideCursor(QCursor(Qt::BusyCursor)); \/\/Enable Busy Cursor\n\n mitk::RenderingManager::GetInstance()->RequestUpdateAll();\n QmitkDataSelectionWidget* dataSelectionWidget = m_Controls.dataSelectionWidget;\n mitk::DataNode::Pointer node = dataSelectionWidget->GetSelection(0);\n mitk::Image::Pointer image = dynamic_cast< mitk::Image* >(node->GetData());\n mitk::MorphologicalOperations::StructuralElementType structuralElement;\n\n if (m_Controls.radioButtonMorphoBall->isChecked())\n structuralElement = mitk::MorphologicalOperations::BALL;\n else\n structuralElement = mitk::MorphologicalOperations::CUBE;\n\n try\n {\n mitk::MorphologicalOperations::Closing(image, m_Controls.spinBoxMorphFactor->value(), structuralElement);\n }\n catch ( itk::ExceptionObject* itkObj)\n {\n MITK_WARN << \"Exception caught: \" << itkObj->GetDescription();\n QApplication::restoreOverrideCursor(); \/\/Disable Busy Cursor\n }\n\n node->SetData(image);\n mitk::RenderingManager::GetInstance()->RequestUpdateAll();\n\n QApplication::restoreOverrideCursor(); \/\/Disable Busy Cursor\n}\n\nvoid QmitkMorphologicalOperationsWidget::OnbtnOpeningClicked()\n{\n QApplication::setOverrideCursor(QCursor(Qt::BusyCursor)); \/\/Enable Busy Cursor\n\n mitk::RenderingManager::GetInstance()->RequestUpdateAll();\n QmitkDataSelectionWidget* dataSelectionWidget = m_Controls.dataSelectionWidget;\n mitk::DataNode::Pointer node = dataSelectionWidget->GetSelection(0);\n mitk::Image::Pointer image = dynamic_cast< mitk::Image* >(node->GetData());\n mitk::MorphologicalOperations::StructuralElementType structuralElement;\n\n if (m_Controls.radioButtonMorphoBall->isChecked())\n structuralElement = mitk::MorphologicalOperations::BALL;\n else\n structuralElement = mitk::MorphologicalOperations::CUBE;\n\n try\n {\n mitk::MorphologicalOperations::Opening(image, m_Controls.spinBoxMorphFactor->value(), structuralElement);\n }\n catch ( itk::ExceptionObject* itkObj)\n {\n MITK_WARN << \"Exception caught: \" << itkObj->GetDescription();\n QApplication::restoreOverrideCursor(); \/\/Disable Busy Cursor\n }\n\n node->SetData(image);\n mitk::RenderingManager::GetInstance()->RequestUpdateAll();\n\n QApplication::restoreOverrideCursor(); \/\/Disable Busy Cursor\n}\n\nvoid QmitkMorphologicalOperationsWidget::OnbtnDilatationClicked()\n{\n QApplication::setOverrideCursor(QCursor(Qt::BusyCursor)); \/\/Enable Busy Cursor\n\n mitk::RenderingManager::GetInstance()->RequestUpdateAll();\n QmitkDataSelectionWidget* dataSelectionWidget = m_Controls.dataSelectionWidget;\n mitk::DataNode::Pointer node = dataSelectionWidget->GetSelection(0);\n mitk::Image::Pointer image = dynamic_cast< mitk::Image* >(node->GetData());\n mitk::MorphologicalOperations::StructuralElementType structuralElement;\n\n if (m_Controls.radioButtonMorphoBall->isChecked())\n structuralElement = mitk::MorphologicalOperations::BALL;\n else\n structuralElement = mitk::MorphologicalOperations::CUBE;\n\n try\n {\n mitk::MorphologicalOperations::Dilate(image, m_Controls.spinBoxMorphFactor->value(), structuralElement);\n }\n catch ( itk::ExceptionObject* itkObj)\n {\n MITK_WARN << \"Exception caught: \" << itkObj->GetDescription();\n QApplication::restoreOverrideCursor(); \/\/Disable Busy Cursor\n }\n\n node->SetData(image);\n mitk::RenderingManager::GetInstance()->RequestUpdateAll();\n\n QApplication::restoreOverrideCursor(); \/\/Disable Busy Cursor\n}\n\nvoid QmitkMorphologicalOperationsWidget::OnbtnErosionClicked()\n{\n QApplication::setOverrideCursor(QCursor(Qt::BusyCursor)); \/\/Enable Busy Cursor\n\n mitk::RenderingManager::GetInstance()->RequestUpdateAll();\n QmitkDataSelectionWidget* dataSelectionWidget = m_Controls.dataSelectionWidget;\n mitk::DataNode::Pointer node = dataSelectionWidget->GetSelection(0);\n mitk::Image::Pointer image = dynamic_cast< mitk::Image* >(node->GetData());\n mitk::MorphologicalOperations::StructuralElementType structuralElement;\n\n if (m_Controls.radioButtonMorphoBall->isChecked())\n structuralElement = mitk::MorphologicalOperations::BALL;\n else\n structuralElement = mitk::MorphologicalOperations::CUBE;\n\n try\n {\n mitk::MorphologicalOperations::Erode(image, m_Controls.spinBoxMorphFactor->value(), structuralElement);\n }\n catch ( itk::ExceptionObject* itkObj)\n {\n MITK_WARN << \"Exception caught: \" << itkObj->GetDescription();\n QApplication::restoreOverrideCursor(); \/\/Disable Busy Cursor\n }\n\n node->SetData(image);\n mitk::RenderingManager::GetInstance()->RequestUpdateAll();\n\n QApplication::restoreOverrideCursor(); \/\/Disable Busy Cursor\n}\n\nvoid QmitkMorphologicalOperationsWidget::OnbtnFillHolesClicked()\n{\n QApplication::setOverrideCursor(QCursor(Qt::BusyCursor)); \/\/Enable Busy Cursor\n\n mitk::RenderingManager::GetInstance()->RequestUpdateAll();\n QmitkDataSelectionWidget* dataSelectionWidget = m_Controls.dataSelectionWidget;\n mitk::DataNode::Pointer node = dataSelectionWidget->GetSelection(0);\n mitk::Image::Pointer image = dynamic_cast< mitk::Image* >(node->GetData());\n\n try\n {\n mitk::MorphologicalOperations::Fillhole(image);\n }\n catch ( itk::ExceptionObject* itkObj)\n {\n MITK_WARN << \"Exception caught: \" << itkObj->GetDescription();\n QApplication::restoreOverrideCursor(); \/\/Disable Busy Cursor\n }\n\n node->SetData(image);\n mitk::RenderingManager::GetInstance()->RequestUpdateAll();\n\n QApplication::restoreOverrideCursor(); \/\/Disable Busy Cursor\n}\n<|endoftext|>"} {"text":"<commit_before>\/****************************************************************************\n *\n * Copyright (c) 2013-2014 PX4 Development Team. All rights reserved.\n *\n * Redistribution and use in source and binary forms, with or without\n * modification, are permitted provided that the following conditions\n * are met:\n *\n * 1. Redistributions of source code must retain the above copyright\n * notice, this list of conditions and the following disclaimer.\n * 2. Redistributions in binary form must reproduce the above copyright\n * notice, this list of conditions and the following disclaimer in\n * the documentation and\/or other materials provided with the\n * distribution.\n * 3. Neither the name PX4 nor the names of its contributors may be\n * used to endorse or promote products derived from this software\n * without specific prior written permission.\n *\n * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS\n * \"AS IS\" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT\n * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS\n * FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE\n * COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT,\n * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING,\n * BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS\n * OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED\n * AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT\n * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN\n * ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE\n * POSSIBILITY OF SUCH DAMAGE.\n *\n ****************************************************************************\/\n\/**\n * @file navigator_rtl.cpp\n * Helper class to access RTL\n * @author Julian Oes <julian@oes.ch>\n * @author Anton Babushkin <anton.babushkin@me.com>\n *\/\n\n#include <string.h>\n#include <stdlib.h>\n#include <math.h>\n#include <fcntl.h>\n\n#include <mavlink\/mavlink_log.h>\n#include <systemlib\/err.h>\n#include <geo\/geo.h>\n\n#include <uORB\/uORB.h>\n#include <navigator\/navigation.h>\n#include <uORB\/topics\/home_position.h>\n\n#include \"navigator.h\"\n#include \"rtl.h\"\n\n#define DELAY_SIGMA\t0.01f\n\nRTL::RTL(Navigator *navigator, const char *name) :\n\tMissionBlock(navigator, name),\n\t_rtl_state(RTL_STATE_NONE),\n\t_param_return_alt(this, \"RTL_RETURN_ALT\", false),\n\t_param_descend_alt(this, \"RTL_DESCEND_ALT\", false),\n\t_param_land_delay(this, \"RTL_LAND_DELAY\", false)\n{\n\t\/* load initial params *\/\n\tupdateParams();\n\t\/* initial reset *\/\n\ton_inactive();\n}\n\nRTL::~RTL()\n{\n}\n\nvoid\nRTL::on_inactive()\n{\n\t\/* reset RTL state only if setpoint moved *\/\n\tif (!_navigator->get_can_loiter_at_sp()) {\n\t\t_rtl_state = RTL_STATE_NONE;\n\t}\n}\n\nvoid\nRTL::on_activation()\n{\n\t\/* decide where to enter the RTL procedure when we switch into it *\/\n\tif (_rtl_state == RTL_STATE_NONE) {\n\t\t\/* for safety reasons don't go into RTL if landed *\/\n\t\tif (_navigator->get_vstatus()->condition_landed) {\n\t\t\t_rtl_state = RTL_STATE_LANDED;\n\t\t\tmavlink_log_critical(_navigator->get_mavlink_fd(), \"no RTL when landed\");\n\n\t\t\/* if lower than return altitude, climb up first *\/\n\t\t} else if (_navigator->get_global_position()->alt < _navigator->get_home_position()->alt\n\t\t\t + _param_return_alt.get()) {\n\t\t\t_rtl_state = RTL_STATE_CLIMB;\n\n\t\t\/* otherwise go straight to return *\/\n\t\t} else {\n\t\t\t\/* set altitude setpoint to current altitude *\/\n\t\t\t_rtl_state = RTL_STATE_RETURN;\n\t\t\t_mission_item.altitude_is_relative = false;\n\t\t\t_mission_item.altitude = _navigator->get_global_position()->alt;\n\t\t}\n\n\t}\n\n\tset_rtl_item();\n}\n\nvoid\nRTL::on_active()\n{\n\tif (_rtl_state != RTL_STATE_LANDED && is_mission_item_reached()) {\n\t\tadvance_rtl();\n\t\tset_rtl_item();\n\t}\n}\n\nvoid\nRTL::set_rtl_item()\n{\n\tstruct position_setpoint_triplet_s *pos_sp_triplet = _navigator->get_position_setpoint_triplet();\n\n\t\/* make sure we have the latest params *\/\n\tupdateParams();\n\n\tset_previous_pos_setpoint();\n\t_navigator->set_can_loiter_at_sp(false);\n\n\tswitch (_rtl_state) {\n\tcase RTL_STATE_CLIMB: {\n\t\tfloat climb_alt = _navigator->get_home_position()->alt + _param_return_alt.get();\n\n\t\t_mission_item.lat = _navigator->get_global_position()->lat;\n\t\t_mission_item.lon = _navigator->get_global_position()->lon;\n\t\t_mission_item.altitude_is_relative = false;\n\t\t_mission_item.altitude = climb_alt;\n\t\t_mission_item.yaw = NAN;\n\t\t_mission_item.loiter_radius = _navigator->get_loiter_radius();\n\t\t_mission_item.loiter_direction = 1;\n\t\t_mission_item.nav_cmd = NAV_CMD_WAYPOINT;\n\t\t_mission_item.acceptance_radius = _navigator->get_acceptance_radius();\n\t\t_mission_item.time_inside = 0.0f;\n\t\t_mission_item.pitch_min = 0.0f;\n\t\t_mission_item.autocontinue = true;\n\t\t_mission_item.origin = ORIGIN_ONBOARD;\n\n\t\tmavlink_log_critical(_navigator->get_mavlink_fd(), \"RTL: climb to %d m (%d m above home)\",\n\t\t\t(int)(climb_alt),\n\t\t\t(int)(climb_alt - _navigator->get_home_position()->alt));\n\t\tbreak;\n\t}\n\n\tcase RTL_STATE_RETURN: {\n\t\t_mission_item.lat = _navigator->get_home_position()->lat;\n\t\t_mission_item.lon = _navigator->get_home_position()->lon;\n\t\t \/\/ don't change altitude\n\n\t\t if (pos_sp_triplet->previous.valid) {\n\t\t \t\/* if previous setpoint is valid then use it to calculate heading to home *\/\n\t\t \t_mission_item.yaw = get_bearing_to_next_waypoint(\n\t\t \t pos_sp_triplet->previous.lat, pos_sp_triplet->previous.lon,\n\t\t \t _mission_item.lat, _mission_item.lon);\n\n\t\t } else {\n\t\t \t\/* else use current position *\/\n\t\t \t_mission_item.yaw = get_bearing_to_next_waypoint(\n\t\t \t _navigator->get_global_position()->lat, _navigator->get_global_position()->lon,\n\t\t \t _mission_item.lat, _mission_item.lon);\n\t\t }\n\t\t_mission_item.loiter_radius = _navigator->get_loiter_radius();\n\t\t_mission_item.loiter_direction = 1;\n\t\t_mission_item.nav_cmd = NAV_CMD_WAYPOINT;\n\t\t_mission_item.acceptance_radius = _navigator->get_acceptance_radius();\n\t\t_mission_item.time_inside = 0.0f;\n\t\t_mission_item.pitch_min = 0.0f;\n\t\t_mission_item.autocontinue = true;\n\t\t_mission_item.origin = ORIGIN_ONBOARD;\n\n\t\tmavlink_log_critical(_navigator->get_mavlink_fd(), \"RTL: return at %d m (%d m above home)\",\n\t\t\t(int)(_mission_item.altitude),\n\t\t\t(int)(_mission_item.altitude - _navigator->get_home_position()->alt));\n\t\tbreak;\n\t}\n\n\tcase RTL_STATE_DESCEND: {\n\t\t_mission_item.lat = _navigator->get_home_position()->lat;\n\t\t_mission_item.lon = _navigator->get_home_position()->lon;\n\t\t_mission_item.altitude_is_relative = false;\n\t\t_mission_item.altitude = _navigator->get_home_position()->alt + _param_descend_alt.get();\n\t\t_mission_item.yaw = NAN;\n\t\t_mission_item.loiter_radius = _navigator->get_loiter_radius();\n\t\t_mission_item.loiter_direction = 1;\n\t\t_mission_item.nav_cmd = NAV_CMD_LOITER_TIME_LIMIT;\n\t\t_mission_item.acceptance_radius = _navigator->get_acceptance_radius();\n\t\t_mission_item.time_inside = 0.0f;\n\t\t_mission_item.pitch_min = 0.0f;\n\t\t_mission_item.autocontinue = false;\n\t\t_mission_item.origin = ORIGIN_ONBOARD;\n\n\t\tmavlink_log_critical(_navigator->get_mavlink_fd(), \"RTL: descend to %d m (%d m above home)\",\n\t\t\t(int)(_mission_item.altitude),\n\t\t\t(int)(_mission_item.altitude - _navigator->get_home_position()->alt));\n\t\tbreak;\n\t}\n\n\tcase RTL_STATE_LOITER: {\n\t\tbool autoland = _param_land_delay.get() > -DELAY_SIGMA;\n\n\t\t_mission_item.lat = _navigator->get_home_position()->lat;\n\t\t_mission_item.lon = _navigator->get_home_position()->lon;\n\t\t_mission_item.altitude_is_relative = false;\n\t\t_mission_item.altitude = _navigator->get_home_position()->alt + _param_descend_alt.get();\n\t\t_mission_item.yaw = NAN;\n\t\t_mission_item.loiter_radius = _navigator->get_loiter_radius();\n\t\t_mission_item.loiter_direction = 1;\n\t\t_mission_item.nav_cmd = autoland ? NAV_CMD_LOITER_TIME_LIMIT : NAV_CMD_LOITER_UNLIMITED;\n\t\t_mission_item.acceptance_radius = _navigator->get_acceptance_radius();\n\t\t_mission_item.time_inside = _param_land_delay.get() < 0.0f ? 0.0f : _param_land_delay.get();\n\t\t_mission_item.pitch_min = 0.0f;\n\t\t_mission_item.autocontinue = autoland;\n\t\t_mission_item.origin = ORIGIN_ONBOARD;\n\n\t\t_navigator->set_can_loiter_at_sp(true);\n\n\t\tif (autoland) {\n\t\t\tmavlink_log_critical(_navigator->get_mavlink_fd(), \"RTL: loiter %.1fs\", (double)_mission_item.time_inside);\n\n\t\t} else {\n\t\t\tmavlink_log_critical(_navigator->get_mavlink_fd(), \"RTL: completed, loiter\");\n\t\t}\n\t\tbreak;\n\t}\n\n\tcase RTL_STATE_LAND: {\n\t\t_mission_item.lat = _navigator->get_home_position()->lat;\n\t\t_mission_item.lon = _navigator->get_home_position()->lon;\n\t\t_mission_item.altitude_is_relative = false;\n\t\t_mission_item.altitude = _navigator->get_home_position()->alt;\n\t\t_mission_item.yaw = NAN;\n\t\t_mission_item.loiter_radius = _navigator->get_loiter_radius();\n\t\t_mission_item.loiter_direction = 1;\n\t\t_mission_item.nav_cmd = NAV_CMD_LAND;\n\t\t_mission_item.acceptance_radius = _navigator->get_acceptance_radius();\n\t\t_mission_item.time_inside = 0.0f;\n\t\t_mission_item.pitch_min = 0.0f;\n\t\t_mission_item.autocontinue = true;\n\t\t_mission_item.origin = ORIGIN_ONBOARD;\n\n\t\tmavlink_log_critical(_navigator->get_mavlink_fd(), \"RTL: land at home\");\n\t\tbreak;\n\t}\n\n\tcase RTL_STATE_LANDED: {\n\t\t_mission_item.lat = _navigator->get_home_position()->lat;\n\t\t_mission_item.lon = _navigator->get_home_position()->lon;\n\t\t_mission_item.altitude_is_relative = false;\n\t\t_mission_item.altitude = _navigator->get_home_position()->alt;\n\t\t_mission_item.yaw = NAN;\n\t\t_mission_item.loiter_radius = _navigator->get_loiter_radius();\n\t\t_mission_item.loiter_direction = 1;\n\t\t_mission_item.nav_cmd = NAV_CMD_IDLE;\n\t\t_mission_item.acceptance_radius = _navigator->get_acceptance_radius();\n\t\t_mission_item.time_inside = 0.0f;\n\t\t_mission_item.pitch_min = 0.0f;\n\t\t_mission_item.autocontinue = true;\n\t\t_mission_item.origin = ORIGIN_ONBOARD;\n\n\t\tmavlink_log_critical(_navigator->get_mavlink_fd(), \"RTL: completed, landed\");\n\t\tbreak;\n\t}\n\n\tdefault:\n\t\tbreak;\n\t}\n\n\treset_mission_item_reached();\n\n\t\/* convert mission item to current position setpoint and make it valid *\/\n\tmission_item_to_position_setpoint(&_mission_item, &pos_sp_triplet->current);\n\tpos_sp_triplet->next.valid = false;\n\n\t_navigator->set_position_setpoint_triplet_updated();\n}\n\nvoid\nRTL::advance_rtl()\n{\n\tswitch (_rtl_state) {\n\tcase RTL_STATE_CLIMB:\n\t\t_rtl_state = RTL_STATE_RETURN;\n\t\tbreak;\n\n\tcase RTL_STATE_RETURN:\n\t\t_rtl_state = RTL_STATE_DESCEND;\n\t\tbreak;\n\n\tcase RTL_STATE_DESCEND:\n\t\t\/* only go to land if autoland is enabled *\/\n\t\tif (_param_land_delay.get() < -DELAY_SIGMA || _param_land_delay.get() > DELAY_SIGMA) {\n\t\t\t_rtl_state = RTL_STATE_LOITER;\n\n\t\t} else {\n\t\t\t_rtl_state = RTL_STATE_LAND;\n\t\t}\n\t\tbreak;\n\n\tcase RTL_STATE_LOITER:\n\t\t_rtl_state = RTL_STATE_LAND;\n\t\tbreak;\n\n\tcase RTL_STATE_LAND:\n\t\t_rtl_state = RTL_STATE_LANDED;\n\t\tbreak;\n\n\tdefault:\n\t\tbreak;\n\t}\n}\n<commit_msg>Navigator: Use yaw of home position<commit_after>\/****************************************************************************\n *\n * Copyright (c) 2013-2014 PX4 Development Team. All rights reserved.\n *\n * Redistribution and use in source and binary forms, with or without\n * modification, are permitted provided that the following conditions\n * are met:\n *\n * 1. Redistributions of source code must retain the above copyright\n * notice, this list of conditions and the following disclaimer.\n * 2. Redistributions in binary form must reproduce the above copyright\n * notice, this list of conditions and the following disclaimer in\n * the documentation and\/or other materials provided with the\n * distribution.\n * 3. Neither the name PX4 nor the names of its contributors may be\n * used to endorse or promote products derived from this software\n * without specific prior written permission.\n *\n * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS\n * \"AS IS\" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT\n * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS\n * FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE\n * COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT,\n * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING,\n * BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS\n * OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED\n * AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT\n * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN\n * ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE\n * POSSIBILITY OF SUCH DAMAGE.\n *\n ****************************************************************************\/\n\/**\n * @file navigator_rtl.cpp\n * Helper class to access RTL\n * @author Julian Oes <julian@oes.ch>\n * @author Anton Babushkin <anton.babushkin@me.com>\n *\/\n\n#include <string.h>\n#include <stdlib.h>\n#include <math.h>\n#include <fcntl.h>\n\n#include <mavlink\/mavlink_log.h>\n#include <systemlib\/err.h>\n#include <geo\/geo.h>\n\n#include <uORB\/uORB.h>\n#include <navigator\/navigation.h>\n#include <uORB\/topics\/home_position.h>\n\n#include \"navigator.h\"\n#include \"rtl.h\"\n\n#define DELAY_SIGMA\t0.01f\n\nRTL::RTL(Navigator *navigator, const char *name) :\n\tMissionBlock(navigator, name),\n\t_rtl_state(RTL_STATE_NONE),\n\t_param_return_alt(this, \"RTL_RETURN_ALT\", false),\n\t_param_descend_alt(this, \"RTL_DESCEND_ALT\", false),\n\t_param_land_delay(this, \"RTL_LAND_DELAY\", false)\n{\n\t\/* load initial params *\/\n\tupdateParams();\n\t\/* initial reset *\/\n\ton_inactive();\n}\n\nRTL::~RTL()\n{\n}\n\nvoid\nRTL::on_inactive()\n{\n\t\/* reset RTL state only if setpoint moved *\/\n\tif (!_navigator->get_can_loiter_at_sp()) {\n\t\t_rtl_state = RTL_STATE_NONE;\n\t}\n}\n\nvoid\nRTL::on_activation()\n{\n\t\/* decide where to enter the RTL procedure when we switch into it *\/\n\tif (_rtl_state == RTL_STATE_NONE) {\n\t\t\/* for safety reasons don't go into RTL if landed *\/\n\t\tif (_navigator->get_vstatus()->condition_landed) {\n\t\t\t_rtl_state = RTL_STATE_LANDED;\n\t\t\tmavlink_log_critical(_navigator->get_mavlink_fd(), \"no RTL when landed\");\n\n\t\t\/* if lower than return altitude, climb up first *\/\n\t\t} else if (_navigator->get_global_position()->alt < _navigator->get_home_position()->alt\n\t\t\t + _param_return_alt.get()) {\n\t\t\t_rtl_state = RTL_STATE_CLIMB;\n\n\t\t\/* otherwise go straight to return *\/\n\t\t} else {\n\t\t\t\/* set altitude setpoint to current altitude *\/\n\t\t\t_rtl_state = RTL_STATE_RETURN;\n\t\t\t_mission_item.altitude_is_relative = false;\n\t\t\t_mission_item.altitude = _navigator->get_global_position()->alt;\n\t\t}\n\n\t}\n\n\tset_rtl_item();\n}\n\nvoid\nRTL::on_active()\n{\n\tif (_rtl_state != RTL_STATE_LANDED && is_mission_item_reached()) {\n\t\tadvance_rtl();\n\t\tset_rtl_item();\n\t}\n}\n\nvoid\nRTL::set_rtl_item()\n{\n\tstruct position_setpoint_triplet_s *pos_sp_triplet = _navigator->get_position_setpoint_triplet();\n\n\t\/* make sure we have the latest params *\/\n\tupdateParams();\n\n\tset_previous_pos_setpoint();\n\t_navigator->set_can_loiter_at_sp(false);\n\n\tswitch (_rtl_state) {\n\tcase RTL_STATE_CLIMB: {\n\t\tfloat climb_alt = _navigator->get_home_position()->alt + _param_return_alt.get();\n\n\t\t_mission_item.lat = _navigator->get_global_position()->lat;\n\t\t_mission_item.lon = _navigator->get_global_position()->lon;\n\t\t_mission_item.altitude_is_relative = false;\n\t\t_mission_item.altitude = climb_alt;\n\t\t_mission_item.yaw = NAN;\n\t\t_mission_item.loiter_radius = _navigator->get_loiter_radius();\n\t\t_mission_item.loiter_direction = 1;\n\t\t_mission_item.nav_cmd = NAV_CMD_WAYPOINT;\n\t\t_mission_item.acceptance_radius = _navigator->get_acceptance_radius();\n\t\t_mission_item.time_inside = 0.0f;\n\t\t_mission_item.pitch_min = 0.0f;\n\t\t_mission_item.autocontinue = true;\n\t\t_mission_item.origin = ORIGIN_ONBOARD;\n\n\t\tmavlink_log_critical(_navigator->get_mavlink_fd(), \"RTL: climb to %d m (%d m above home)\",\n\t\t\t(int)(climb_alt),\n\t\t\t(int)(climb_alt - _navigator->get_home_position()->alt));\n\t\tbreak;\n\t}\n\n\tcase RTL_STATE_RETURN: {\n\t\t_mission_item.lat = _navigator->get_home_position()->lat;\n\t\t_mission_item.lon = _navigator->get_home_position()->lon;\n\t\t \/\/ don't change altitude\n\n\t\t if (pos_sp_triplet->previous.valid) {\n\t\t \t\/* if previous setpoint is valid then use it to calculate heading to home *\/\n\t\t \t_mission_item.yaw = get_bearing_to_next_waypoint(\n\t\t \t pos_sp_triplet->previous.lat, pos_sp_triplet->previous.lon,\n\t\t \t _mission_item.lat, _mission_item.lon);\n\n\t\t } else {\n\t\t \t\/* else use current position *\/\n\t\t \t_mission_item.yaw = get_bearing_to_next_waypoint(\n\t\t \t _navigator->get_global_position()->lat, _navigator->get_global_position()->lon,\n\t\t \t _mission_item.lat, _mission_item.lon);\n\t\t }\n\t\t_mission_item.loiter_radius = _navigator->get_loiter_radius();\n\t\t_mission_item.loiter_direction = 1;\n\t\t_mission_item.nav_cmd = NAV_CMD_WAYPOINT;\n\t\t_mission_item.acceptance_radius = _navigator->get_acceptance_radius();\n\t\t_mission_item.time_inside = 0.0f;\n\t\t_mission_item.pitch_min = 0.0f;\n\t\t_mission_item.autocontinue = true;\n\t\t_mission_item.origin = ORIGIN_ONBOARD;\n\n\t\tmavlink_log_critical(_navigator->get_mavlink_fd(), \"RTL: return at %d m (%d m above home)\",\n\t\t\t(int)(_mission_item.altitude),\n\t\t\t(int)(_mission_item.altitude - _navigator->get_home_position()->alt));\n\t\tbreak;\n\t}\n\n\tcase RTL_STATE_DESCEND: {\n\t\t_mission_item.lat = _navigator->get_home_position()->lat;\n\t\t_mission_item.lon = _navigator->get_home_position()->lon;\n\t\t_mission_item.altitude_is_relative = false;\n\t\t_mission_item.altitude = _navigator->get_home_position()->alt + _param_descend_alt.get();\n\t\t_mission_item.yaw = _navigator->get_home_position()->yaw;\n\t\t_mission_item.loiter_radius = _navigator->get_loiter_radius();\n\t\t_mission_item.loiter_direction = 1;\n\t\t_mission_item.nav_cmd = NAV_CMD_LOITER_TIME_LIMIT;\n\t\t_mission_item.acceptance_radius = _navigator->get_acceptance_radius();\n\t\t_mission_item.time_inside = 0.0f;\n\t\t_mission_item.pitch_min = 0.0f;\n\t\t_mission_item.autocontinue = false;\n\t\t_mission_item.origin = ORIGIN_ONBOARD;\n\n\t\tmavlink_log_critical(_navigator->get_mavlink_fd(), \"RTL: descend to %d m (%d m above home)\",\n\t\t\t(int)(_mission_item.altitude),\n\t\t\t(int)(_mission_item.altitude - _navigator->get_home_position()->alt));\n\t\tbreak;\n\t}\n\n\tcase RTL_STATE_LOITER: {\n\t\tbool autoland = _param_land_delay.get() > -DELAY_SIGMA;\n\n\t\t_mission_item.lat = _navigator->get_home_position()->lat;\n\t\t_mission_item.lon = _navigator->get_home_position()->lon;\n\t\t_mission_item.altitude_is_relative = false;\n\t\t_mission_item.altitude = _navigator->get_home_position()->alt + _param_descend_alt.get();\n\t\t_mission_item.yaw = NAN;\n\t\t_mission_item.loiter_radius = _navigator->get_loiter_radius();\n\t\t_mission_item.loiter_direction = 1;\n\t\t_mission_item.nav_cmd = autoland ? NAV_CMD_LOITER_TIME_LIMIT : NAV_CMD_LOITER_UNLIMITED;\n\t\t_mission_item.acceptance_radius = _navigator->get_acceptance_radius();\n\t\t_mission_item.time_inside = _param_land_delay.get() < 0.0f ? 0.0f : _param_land_delay.get();\n\t\t_mission_item.pitch_min = 0.0f;\n\t\t_mission_item.autocontinue = autoland;\n\t\t_mission_item.origin = ORIGIN_ONBOARD;\n\n\t\t_navigator->set_can_loiter_at_sp(true);\n\n\t\tif (autoland) {\n\t\t\tmavlink_log_critical(_navigator->get_mavlink_fd(), \"RTL: loiter %.1fs\", (double)_mission_item.time_inside);\n\n\t\t} else {\n\t\t\tmavlink_log_critical(_navigator->get_mavlink_fd(), \"RTL: completed, loiter\");\n\t\t}\n\t\tbreak;\n\t}\n\n\tcase RTL_STATE_LAND: {\n\t\t_mission_item.lat = _navigator->get_home_position()->lat;\n\t\t_mission_item.lon = _navigator->get_home_position()->lon;\n\t\t_mission_item.altitude_is_relative = false;\n\t\t_mission_item.altitude = _navigator->get_home_position()->alt;\n\t\t_mission_item.yaw = NAN;\n\t\t_mission_item.loiter_radius = _navigator->get_loiter_radius();\n\t\t_mission_item.loiter_direction = 1;\n\t\t_mission_item.nav_cmd = NAV_CMD_LAND;\n\t\t_mission_item.acceptance_radius = _navigator->get_acceptance_radius();\n\t\t_mission_item.time_inside = 0.0f;\n\t\t_mission_item.pitch_min = 0.0f;\n\t\t_mission_item.autocontinue = true;\n\t\t_mission_item.origin = ORIGIN_ONBOARD;\n\n\t\tmavlink_log_critical(_navigator->get_mavlink_fd(), \"RTL: land at home\");\n\t\tbreak;\n\t}\n\n\tcase RTL_STATE_LANDED: {\n\t\t_mission_item.lat = _navigator->get_home_position()->lat;\n\t\t_mission_item.lon = _navigator->get_home_position()->lon;\n\t\t_mission_item.altitude_is_relative = false;\n\t\t_mission_item.altitude = _navigator->get_home_position()->alt;\n\t\t_mission_item.yaw = NAN;\n\t\t_mission_item.loiter_radius = _navigator->get_loiter_radius();\n\t\t_mission_item.loiter_direction = 1;\n\t\t_mission_item.nav_cmd = NAV_CMD_IDLE;\n\t\t_mission_item.acceptance_radius = _navigator->get_acceptance_radius();\n\t\t_mission_item.time_inside = 0.0f;\n\t\t_mission_item.pitch_min = 0.0f;\n\t\t_mission_item.autocontinue = true;\n\t\t_mission_item.origin = ORIGIN_ONBOARD;\n\n\t\tmavlink_log_critical(_navigator->get_mavlink_fd(), \"RTL: completed, landed\");\n\t\tbreak;\n\t}\n\n\tdefault:\n\t\tbreak;\n\t}\n\n\treset_mission_item_reached();\n\n\t\/* convert mission item to current position setpoint and make it valid *\/\n\tmission_item_to_position_setpoint(&_mission_item, &pos_sp_triplet->current);\n\tpos_sp_triplet->next.valid = false;\n\n\t_navigator->set_position_setpoint_triplet_updated();\n}\n\nvoid\nRTL::advance_rtl()\n{\n\tswitch (_rtl_state) {\n\tcase RTL_STATE_CLIMB:\n\t\t_rtl_state = RTL_STATE_RETURN;\n\t\tbreak;\n\n\tcase RTL_STATE_RETURN:\n\t\t_rtl_state = RTL_STATE_DESCEND;\n\t\tbreak;\n\n\tcase RTL_STATE_DESCEND:\n\t\t\/* only go to land if autoland is enabled *\/\n\t\tif (_param_land_delay.get() < -DELAY_SIGMA || _param_land_delay.get() > DELAY_SIGMA) {\n\t\t\t_rtl_state = RTL_STATE_LOITER;\n\n\t\t} else {\n\t\t\t_rtl_state = RTL_STATE_LAND;\n\t\t}\n\t\tbreak;\n\n\tcase RTL_STATE_LOITER:\n\t\t_rtl_state = RTL_STATE_LAND;\n\t\tbreak;\n\n\tcase RTL_STATE_LAND:\n\t\t_rtl_state = RTL_STATE_LANDED;\n\t\tbreak;\n\n\tdefault:\n\t\tbreak;\n\t}\n}\n<|endoftext|>"} {"text":"<commit_before>\/*************************************************************************\n *\n * OpenOffice.org - a multi-platform office productivity suite\n *\n * $RCSfile: layerupdatemerger.hxx,v $\n *\n * $Revision: 1.6 $\n *\n * last change: $Author: rt $ $Date: 2005-09-08 03:32:30 $\n *\n * The Contents of this file are made available subject to\n * the terms of GNU Lesser General Public License Version 2.1.\n *\n *\n * GNU Lesser General Public License Version 2.1\n * =============================================\n * Copyright 2005 by Sun Microsystems, Inc.\n * 901 San Antonio Road, Palo Alto, CA 94303, USA\n *\n * This library is free software; you can redistribute it and\/or\n * modify it under the terms of the GNU Lesser General Public\n * License version 2.1, as published by the Free Software Foundation.\n *\n * This library is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU\n * Lesser General Public License for more details.\n *\n * You should have received a copy of the GNU Lesser General Public\n * License along with this library; if not, write to the Free Software\n * Foundation, Inc., 59 Temple Place, Suite 330, Boston,\n * MA 02111-1307 USA\n *\n ************************************************************************\/\n\n#ifndef CONFIGMGR_BACKEND_LAYERUPDATEMERGER_HXX\n#define CONFIGMGR_BACKEND_LAYERUPDATEMERGER_HXX\n\n#ifndef CONFIGMGR_BACKEND_BASICUPDATEMERGER_HXX\n#include \"basicupdatemerger.hxx\"\n#endif\n\n#ifndef CONFIGMGR_BACKEND_LAYERUPDATE_HXX\n#include \"layerupdate.hxx\"\n#endif\n\n#ifndef _RTL_REF_HXX_\n#include <rtl\/ref.hxx>\n#endif\n\/\/ -----------------------------------------------------------------------------\n\nnamespace configmgr\n{\n\/\/ -----------------------------------------------------------------------------\n namespace backend\n {\n\/\/ -----------------------------------------------------------------------------\n using rtl::OUString;\n\/\/ -----------------------------------------------------------------------------\n class NodeUpdate;\n class PropertyUpdate;\n typedef rtl::Reference<NodeUpdate> NodeUpdateRef;\n typedef rtl::Reference<PropertyUpdate> PropertyUpdateRef;\n\n class LayerUpdateMerger : protected BasicUpdateMerger\n {\n public:\n static LayerSource getMergedLayer(LayerSource const & _xSourceLayer, LayerUpdate const & _aLayerUpdate)\n { return new LayerUpdateMerger(_xSourceLayer, _aLayerUpdate); }\n\n public:\n explicit\n LayerUpdateMerger( LayerSource const & _xSourceLayer, LayerUpdate const & _aLayerUpdate);\n\n ~LayerUpdateMerger();\n\n\n \/\/ XLayerHandler overrides\n protected:\n virtual void SAL_CALL\n startLayer( )\n throw (MalformedDataException, lang::WrappedTargetException, uno::RuntimeException);\n\n virtual void SAL_CALL\n endLayer( )\n throw (MalformedDataException, lang::WrappedTargetException, uno::RuntimeException);\n\n virtual void SAL_CALL\n overrideNode( const OUString& aName, sal_Int16 aAttributes, sal_Bool bClear )\n throw (MalformedDataException, lang::WrappedTargetException, uno::RuntimeException);\n\n virtual void SAL_CALL\n addOrReplaceNode( const OUString& aName, sal_Int16 aAttributes )\n throw (MalformedDataException, lang::WrappedTargetException, uno::RuntimeException);\n\n virtual void SAL_CALL\n addOrReplaceNodeFromTemplate( const OUString& aName, const TemplateIdentifier& aTemplate, sal_Int16 aAttributes )\n throw (MalformedDataException, lang::WrappedTargetException, uno::RuntimeException);\n\n virtual void SAL_CALL\n endNode( )\n throw (MalformedDataException, lang::WrappedTargetException, uno::RuntimeException);\n\n virtual void SAL_CALL\n dropNode( const OUString& aName )\n throw (MalformedDataException, lang::WrappedTargetException, uno::RuntimeException);\n\n virtual void SAL_CALL\n overrideProperty( const OUString& aName, sal_Int16 aAttributes, const uno::Type& aType, sal_Bool bClear )\n throw (MalformedDataException, lang::WrappedTargetException, uno::RuntimeException);\n\n virtual void SAL_CALL\n endProperty( )\n throw (MalformedDataException, lang::WrappedTargetException, uno::RuntimeException);\n\n virtual void SAL_CALL\n setPropertyValue( const uno::Any& aValue )\n throw (MalformedDataException, lang::WrappedTargetException, uno::RuntimeException);\n\n virtual void SAL_CALL\n setPropertyValueForLocale( const uno::Any& aValue, const OUString & aLocale )\n throw (MalformedDataException, lang::WrappedTargetException, uno::RuntimeException);\n\n virtual void SAL_CALL\n addProperty( const OUString& aName, sal_Int16 aAttributes, const uno::Type& aType )\n throw (MalformedDataException, lang::WrappedTargetException, uno::RuntimeException);\n\n virtual void SAL_CALL\n addPropertyWithValue( const OUString& aName, sal_Int16 aAttributes, const uno::Any& aValue )\n throw (MalformedDataException, lang::WrappedTargetException, uno::RuntimeException);\n\n \/\/ BasicUpdateMerger\n virtual void flushUpdate();\n private:\n void malformedUpdate(sal_Char const * pMsg);\n void illegalUpdate(sal_Char const * pMsg);\n private:\n LayerUpdate m_aLayerUpdate;\n NodeUpdateRef m_xCurrentNode;\n PropertyUpdateRef m_xCurrentProp;\n };\n\/\/ -----------------------------------------------------------------------------\n } \/\/ namespace xml\n\/\/ -----------------------------------------------------------------------------\n\n} \/\/ namespace configmgr\n#endif\n\n\n\n\n<commit_msg>INTEGRATION: CWS changefileheader (1.6.130); FILE MERGED 2008\/04\/01 15:06:38 thb 1.6.130.3: #i85898# Stripping all external header guards 2008\/04\/01 12:27:18 thb 1.6.130.2: #i85898# Stripping all external header guards 2008\/03\/31 12:22:40 rt 1.6.130.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: layerupdatemerger.hxx,v $\n * $Revision: 1.7 $\n *\n * This file is part of OpenOffice.org.\n *\n * OpenOffice.org is free software: you can redistribute it and\/or modify\n * it under the terms of the GNU Lesser General Public License version 3\n * only, as published by the Free Software Foundation.\n *\n * OpenOffice.org is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the\n * GNU Lesser General Public License version 3 for more details\n * (a copy is included in the LICENSE file that accompanied this code).\n *\n * You should have received a copy of the GNU Lesser General Public License\n * version 3 along with OpenOffice.org. If not, see\n * <http:\/\/www.openoffice.org\/license.html>\n * for a copy of the LGPLv3 License.\n *\n ************************************************************************\/\n\n#ifndef CONFIGMGR_BACKEND_LAYERUPDATEMERGER_HXX\n#define CONFIGMGR_BACKEND_LAYERUPDATEMERGER_HXX\n\n#include \"basicupdatemerger.hxx\"\n#include \"layerupdate.hxx\"\n#include <rtl\/ref.hxx>\n\/\/ -----------------------------------------------------------------------------\n\nnamespace configmgr\n{\n\/\/ -----------------------------------------------------------------------------\n namespace backend\n {\n\/\/ -----------------------------------------------------------------------------\n using rtl::OUString;\n\/\/ -----------------------------------------------------------------------------\n class NodeUpdate;\n class PropertyUpdate;\n typedef rtl::Reference<NodeUpdate> NodeUpdateRef;\n typedef rtl::Reference<PropertyUpdate> PropertyUpdateRef;\n\n class LayerUpdateMerger : protected BasicUpdateMerger\n {\n public:\n static LayerSource getMergedLayer(LayerSource const & _xSourceLayer, LayerUpdate const & _aLayerUpdate)\n { return new LayerUpdateMerger(_xSourceLayer, _aLayerUpdate); }\n\n public:\n explicit\n LayerUpdateMerger( LayerSource const & _xSourceLayer, LayerUpdate const & _aLayerUpdate);\n\n ~LayerUpdateMerger();\n\n\n \/\/ XLayerHandler overrides\n protected:\n virtual void SAL_CALL\n startLayer( )\n throw (MalformedDataException, lang::WrappedTargetException, uno::RuntimeException);\n\n virtual void SAL_CALL\n endLayer( )\n throw (MalformedDataException, lang::WrappedTargetException, uno::RuntimeException);\n\n virtual void SAL_CALL\n overrideNode( const OUString& aName, sal_Int16 aAttributes, sal_Bool bClear )\n throw (MalformedDataException, lang::WrappedTargetException, uno::RuntimeException);\n\n virtual void SAL_CALL\n addOrReplaceNode( const OUString& aName, sal_Int16 aAttributes )\n throw (MalformedDataException, lang::WrappedTargetException, uno::RuntimeException);\n\n virtual void SAL_CALL\n addOrReplaceNodeFromTemplate( const OUString& aName, const TemplateIdentifier& aTemplate, sal_Int16 aAttributes )\n throw (MalformedDataException, lang::WrappedTargetException, uno::RuntimeException);\n\n virtual void SAL_CALL\n endNode( )\n throw (MalformedDataException, lang::WrappedTargetException, uno::RuntimeException);\n\n virtual void SAL_CALL\n dropNode( const OUString& aName )\n throw (MalformedDataException, lang::WrappedTargetException, uno::RuntimeException);\n\n virtual void SAL_CALL\n overrideProperty( const OUString& aName, sal_Int16 aAttributes, const uno::Type& aType, sal_Bool bClear )\n throw (MalformedDataException, lang::WrappedTargetException, uno::RuntimeException);\n\n virtual void SAL_CALL\n endProperty( )\n throw (MalformedDataException, lang::WrappedTargetException, uno::RuntimeException);\n\n virtual void SAL_CALL\n setPropertyValue( const uno::Any& aValue )\n throw (MalformedDataException, lang::WrappedTargetException, uno::RuntimeException);\n\n virtual void SAL_CALL\n setPropertyValueForLocale( const uno::Any& aValue, const OUString & aLocale )\n throw (MalformedDataException, lang::WrappedTargetException, uno::RuntimeException);\n\n virtual void SAL_CALL\n addProperty( const OUString& aName, sal_Int16 aAttributes, const uno::Type& aType )\n throw (MalformedDataException, lang::WrappedTargetException, uno::RuntimeException);\n\n virtual void SAL_CALL\n addPropertyWithValue( const OUString& aName, sal_Int16 aAttributes, const uno::Any& aValue )\n throw (MalformedDataException, lang::WrappedTargetException, uno::RuntimeException);\n\n \/\/ BasicUpdateMerger\n virtual void flushUpdate();\n private:\n void malformedUpdate(sal_Char const * pMsg);\n void illegalUpdate(sal_Char const * pMsg);\n private:\n LayerUpdate m_aLayerUpdate;\n NodeUpdateRef m_xCurrentNode;\n PropertyUpdateRef m_xCurrentProp;\n };\n\/\/ -----------------------------------------------------------------------------\n } \/\/ namespace xml\n\/\/ -----------------------------------------------------------------------------\n\n} \/\/ namespace configmgr\n#endif\n\n\n\n\n<|endoftext|>"} {"text":"<commit_before><commit_msg>pr change<commit_after><|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 * net_interface_imp.cpp\n *\n * Network interface implementation class\n *\/\n\n#include <stdio.h>\n#include <stdlib.h>\n#include <errno.h>\n#include <string.h>\n#include <signal.h>\n#include <unistd.h>\n\n#include <sys\/socket.h>\n#include <sys\/ioctl.h>\n#include <linux\/if_packet.h>\n#include <linux\/if_ether.h>\n#include <linux\/if_arp.h>\n#include <linux\/filter.h>\n#include <linux\/if.h>\n#include <arpa\/inet.h>\n#include <netdb.h>\n#include <ifaddrs.h>\n\n#include \"util_imp.h\"\n#include \"enumeration.h\"\n#include \"log.h\"\n#include \"jdksavdecc_util.h\"\n#include \"net_interface_imp.h\"\n\n#include \"bpf.h\"\n\nnamespace avdecc_lib\n{\n\n\n\n struct etherII\n {\n uint8_t destmac[6];\n uint8_t srcmac[6];\n uint8_t type[2];\n };\n struct ipheader\n {\n uint8_t ver_len;\n uint8_t service;\n uint8_t len[2];\n uint8_t ident[2];\n uint8_t flags;\n uint8_t frag_offset[2];\n uint8_t ttl;\n uint8_t protocol;\n uint8_t chksum[2];\n uint8_t sourceip[4];\n uint8_t destip[4];\n };\n struct udpheader\n {\n uint8_t srcport[2];\n uint8_t destport[2];\n uint8_t len[2];\n uint8_t chksum[2];\n };\n\n net_interface_imp::net_interface_imp()\n {\n struct ifaddrs *ifaddr, *ifa;\n int family, s;\n char host[NI_MAXHOST];\n char ifname[256];\n\n interface_num = 0;\n total_devs = 0;\n\n ip_hdr_store = new ipheader;\n udp_hdr_store = new udpheader;\n\n if (getifaddrs(&ifaddr) == -1)\n {\n perror(\"getifaddrs\");\n exit(EXIT_FAILURE);\n }\n\n \/* Walk through linked list, maintaining head pointer so we\n can free list later *\/\n\n for (ifa = ifaddr; ifa != NULL; ifa = ifa->ifa_next)\n {\n if (ifa->ifa_addr == NULL)\n continue;\n\n family = ifa->ifa_addr->sa_family;\n\n \/* Display interface name and family (including symbolic\n form of the latter for the common families) *\/\n if (family == AF_INET)\n {\n s = getnameinfo(ifa->ifa_addr,\n (family == AF_INET) ? sizeof(struct sockaddr_in) :\n sizeof(struct sockaddr_in6),\n host, NI_MAXHOST, NULL, 0, NI_NUMERICHOST);\n\n\n\n snprintf(ifname, sizeof(ifname), \"%s, address: <%s>\",ifa->ifa_name, host);\n if (s != 0)\n {\n printf(\"getnameinfo() failed: %s\\n\", gai_strerror(s));\n exit(EXIT_FAILURE);\n }\n ifnames.push_back(ifname);\n total_devs++;\n }\n }\n\n freeifaddrs(ifaddr);\n }\n\n net_interface_imp::~net_interface_imp()\n {\n close(rawsock);\n }\n\n void STDCALL net_interface_imp::destroy()\n {\n delete this;\n }\n\n uint32_t STDCALL net_interface_imp::devs_count()\n {\n return total_devs;\n }\n\n uint64_t net_interface_imp::mac_addr()\n {\n return mac;\n }\n\n char * STDCALL net_interface_imp::get_dev_desc_by_index(uint32_t dev_index)\n {\n return (char *)ifnames[dev_index].c_str();\n }\n\n int net_interface_imp::get_fd()\n {\n return rawsock;\n }\n\n\n int STDCALL net_interface_imp::select_interface_by_num(uint32_t interface_num)\n {\n struct sockaddr_ll sll;\n struct ifreq if_mac;\n const char *ifname;\n char *s;\n\n ifname = ifnames[interface_num].c_str();\n s = (char *)ifname;\n while(*s != ',')\n {\n s++;\n }\n *s = 0;\n rawsock = socket(PF_PACKET, SOCK_RAW, htons(ETH_P_ALL));\n if (rawsock == -1)\n {\n fprintf(stderr, \"Socket open failed! %s\\nuse sudo?\\n\", strerror(errno));\n exit(EXIT_FAILURE);\n }\n\n ifindex = getifindex(rawsock, ifname);\n\n \/\/ get the mac address of the eth0 interface\n memset(&if_mac, 0, sizeof(struct ifreq));\n strncpy(if_mac.ifr_name, ifname, IFNAMSIZ-1);\n if (ioctl(rawsock, SIOCGIFHWADDR, &if_mac) < 0)\n {\n perror(\"SIOCGIFHWADDR\");\n exit(EXIT_FAILURE);\n }\n\n setpromiscuous(rawsock, ifindex);\n\n memset(&sll,0, sizeof(sll));\n sll.sll_family = AF_PACKET;\n sll.sll_ifindex = ifindex;\n sll.sll_protocol = htons(ETH_P_ALL);\n bind(rawsock, (struct sockaddr *)&sll, sizeof(sll));\n\n utility->convert_eui48_to_uint64((uint8_t *)if_mac.ifr_hwaddr.sa_data, mac);\n\n\n uint16_t etypes[1] = {0x22f0};\n set_capture_ether_type(etypes, 1);\n\n return 0;\n }\n\n int net_interface_imp::set_capture_ether_type(uint16_t *ether_type, uint32_t count)\n {\n struct sock_fprog Filter;\n\n Filter.len = sizeof(BPF_code) \/ 8;\n Filter.filter = BPF_code;\n\n for (unsigned int i = 0; i < count; i++)\n {\n if (ether_type[i] != (uint16_t)ethernet_proto_bpf[i])\n fprintf(stderr, \"NETIF - packet filter mismatch\\n\");\n }\n\n \/\/ attach filter to socket\n if(setsockopt(rawsock, SOL_SOCKET, SO_ATTACH_FILTER, &Filter, sizeof(Filter)) == -1)\n {\n fprintf(stderr, \"socket attach filter failed! %s\\n\", strerror(errno));\n close(rawsock);\n exit(EXIT_FAILURE);\n }\n\n return 0;\n }\n\n int STDCALL net_interface_imp::capture_frame(const uint8_t **frame, uint16_t *mem_buf_len)\n {\n int len;\n\n *frame = &rx_buf[0];\n len = read(rawsock, &rx_buf[0], sizeof(rx_buf));\n if (len < 0)\n {\n *mem_buf_len = 0;\n }\n else\n {\n *mem_buf_len = len;\n }\n return len;\n }\n\n int net_interface_imp::send_frame(uint8_t *frame, uint16_t mem_buf_len)\n {\n int send_result;\n\n \/*target address*\/\n struct sockaddr_ll socket_address;\n\n \/*prepare sockaddr_ll*\/\n\n \/*RAW communication*\/\n socket_address.sll_family = PF_PACKET;\n socket_address.sll_protocol = htons(ethertype);\n\n \/*index of the network device\n see full code later how to retrieve it*\/\n socket_address.sll_ifindex = ifindex;\n\n \/*ARP hardware identifier is ethernet*\/\n socket_address.sll_hatype = ARPHRD_ETHER;\n\n \/*target is another host*\/\n socket_address.sll_pkttype = PACKET_OTHERHOST;\n\n \/*address length*\/\n socket_address.sll_halen = ETH_ALEN;\n \/*MAC - begin*\/\n memcpy(&socket_address.sll_addr[0], &frame[0], 6);\n \/*MAC - end*\/\n socket_address.sll_addr[6] = 0x00;\/*not used*\/\n socket_address.sll_addr[7] = 0x00;\/*not used*\/\n\n \/*send the packet*\/\n send_result = sendto(rawsock, frame, mem_buf_len, 0,\n (struct sockaddr*)&socket_address, sizeof(socket_address));\n\n return send_result;\n }\n\n int net_interface_imp::getifindex(int rawsock, const char *iface)\n {\n struct ifreq ifr;\n int ret;\n\n memset(&ifr,0,sizeof(ifr));\n strncpy(ifr.ifr_name,iface,sizeof(ifr.ifr_name));\n\n ret=ioctl(rawsock,SIOCGIFINDEX,&ifr);\n\n if(ret<0)\n {\n return ret;\n }\n\n return ifr.ifr_ifindex;\n }\n\n int net_interface_imp::setpromiscuous(int rawsock, int ifindex)\n {\n struct packet_mreq mr;\n\n memset(&mr,0,sizeof(mr));\n mr.mr_ifindex=ifindex;\n mr.mr_type=PACKET_MR_ALLMULTI;\n\n return setsockopt(rawsock, SOL_PACKET,\n PACKET_ADD_MEMBERSHIP,&mr,sizeof(mr));\n }\n\n\n net_interface * create_net_interface()\n {\n return (new net_interface_imp());\n }\n\n}\n<commit_msg>linux: netif module, correct selected interface index<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 * net_interface_imp.cpp\n *\n * Network interface implementation class\n *\/\n\n#include <stdio.h>\n#include <stdlib.h>\n#include <errno.h>\n#include <string.h>\n#include <signal.h>\n#include <unistd.h>\n\n#include <sys\/socket.h>\n#include <sys\/ioctl.h>\n#include <linux\/if_packet.h>\n#include <linux\/if_ether.h>\n#include <linux\/if_arp.h>\n#include <linux\/filter.h>\n#include <linux\/if.h>\n#include <arpa\/inet.h>\n#include <netdb.h>\n#include <ifaddrs.h>\n\n#include \"util_imp.h\"\n#include \"enumeration.h\"\n#include \"log.h\"\n#include \"jdksavdecc_util.h\"\n#include \"net_interface_imp.h\"\n\n#include \"bpf.h\"\n\nnamespace avdecc_lib\n{\n\n\n\n struct etherII\n {\n uint8_t destmac[6];\n uint8_t srcmac[6];\n uint8_t type[2];\n };\n struct ipheader\n {\n uint8_t ver_len;\n uint8_t service;\n uint8_t len[2];\n uint8_t ident[2];\n uint8_t flags;\n uint8_t frag_offset[2];\n uint8_t ttl;\n uint8_t protocol;\n uint8_t chksum[2];\n uint8_t sourceip[4];\n uint8_t destip[4];\n };\n struct udpheader\n {\n uint8_t srcport[2];\n uint8_t destport[2];\n uint8_t len[2];\n uint8_t chksum[2];\n };\n\n net_interface_imp::net_interface_imp()\n {\n struct ifaddrs *ifaddr, *ifa;\n int family, s;\n char host[NI_MAXHOST];\n char ifname[256];\n\n interface_num = 0;\n total_devs = 0;\n\n ip_hdr_store = new ipheader;\n udp_hdr_store = new udpheader;\n\n if (getifaddrs(&ifaddr) == -1)\n {\n perror(\"getifaddrs\");\n exit(EXIT_FAILURE);\n }\n\n \/* Walk through linked list, maintaining head pointer so we\n can free list later *\/\n\n for (ifa = ifaddr; ifa != NULL; ifa = ifa->ifa_next)\n {\n if (ifa->ifa_addr == NULL)\n continue;\n\n family = ifa->ifa_addr->sa_family;\n\n \/* Display interface name and family (including symbolic\n form of the latter for the common families) *\/\n if (family == AF_INET)\n {\n s = getnameinfo(ifa->ifa_addr,\n (family == AF_INET) ? sizeof(struct sockaddr_in) :\n sizeof(struct sockaddr_in6),\n host, NI_MAXHOST, NULL, 0, NI_NUMERICHOST);\n\n\n\n snprintf(ifname, sizeof(ifname), \"%s, address: <%s>\",ifa->ifa_name, host);\n if (s != 0)\n {\n printf(\"getnameinfo() failed: %s\\n\", gai_strerror(s));\n exit(EXIT_FAILURE);\n }\n ifnames.push_back(ifname);\n total_devs++;\n }\n }\n\n freeifaddrs(ifaddr);\n }\n\n net_interface_imp::~net_interface_imp()\n {\n close(rawsock);\n }\n\n void STDCALL net_interface_imp::destroy()\n {\n delete this;\n }\n\n uint32_t STDCALL net_interface_imp::devs_count()\n {\n return total_devs;\n }\n\n uint64_t net_interface_imp::mac_addr()\n {\n return mac;\n }\n\n char * STDCALL net_interface_imp::get_dev_desc_by_index(uint32_t dev_index)\n {\n return (char *)ifnames[dev_index].c_str();\n }\n\n int net_interface_imp::get_fd()\n {\n return rawsock;\n }\n\n\n int STDCALL net_interface_imp::select_interface_by_num(uint32_t interface_num)\n {\n struct sockaddr_ll sll;\n struct ifreq if_mac;\n const char *ifname;\n char *s;\n\n \/* adjust interface numnber since count starts at 1 *\/\n interface_num--;\n\n ifname = ifnames[interface_num].c_str();\n s = (char *)ifname;\n while(*s != ',')\n {\n s++;\n }\n *s = 0;\n rawsock = socket(PF_PACKET, SOCK_RAW, htons(ETH_P_ALL));\n if (rawsock == -1)\n {\n fprintf(stderr, \"Socket open failed! %s\\nuse sudo?\\n\", strerror(errno));\n exit(EXIT_FAILURE);\n }\n\n ifindex = getifindex(rawsock, ifname);\n\n \/\/ get the mac address of the eth0 interface\n memset(&if_mac, 0, sizeof(struct ifreq));\n strncpy(if_mac.ifr_name, ifname, IFNAMSIZ-1);\n if (ioctl(rawsock, SIOCGIFHWADDR, &if_mac) < 0)\n {\n perror(\"SIOCGIFHWADDR\");\n exit(EXIT_FAILURE);\n }\n\n setpromiscuous(rawsock, ifindex);\n\n memset(&sll,0, sizeof(sll));\n sll.sll_family = AF_PACKET;\n sll.sll_ifindex = ifindex;\n sll.sll_protocol = htons(ETH_P_ALL);\n bind(rawsock, (struct sockaddr *)&sll, sizeof(sll));\n\n utility->convert_eui48_to_uint64((uint8_t *)if_mac.ifr_hwaddr.sa_data, mac);\n\n\n uint16_t etypes[1] = {0x22f0};\n set_capture_ether_type(etypes, 1);\n\n return 0;\n }\n\n int net_interface_imp::set_capture_ether_type(uint16_t *ether_type, uint32_t count)\n {\n struct sock_fprog Filter;\n\n Filter.len = sizeof(BPF_code) \/ 8;\n Filter.filter = BPF_code;\n\n for (unsigned int i = 0; i < count; i++)\n {\n if (ether_type[i] != (uint16_t)ethernet_proto_bpf[i])\n fprintf(stderr, \"NETIF - packet filter mismatch\\n\");\n }\n\n \/\/ attach filter to socket\n if(setsockopt(rawsock, SOL_SOCKET, SO_ATTACH_FILTER, &Filter, sizeof(Filter)) == -1)\n {\n fprintf(stderr, \"socket attach filter failed! %s\\n\", strerror(errno));\n close(rawsock);\n exit(EXIT_FAILURE);\n }\n\n return 0;\n }\n\n int STDCALL net_interface_imp::capture_frame(const uint8_t **frame, uint16_t *mem_buf_len)\n {\n int len;\n\n *frame = &rx_buf[0];\n len = read(rawsock, &rx_buf[0], sizeof(rx_buf));\n if (len < 0)\n {\n *mem_buf_len = 0;\n }\n else\n {\n *mem_buf_len = len;\n }\n return len;\n }\n\n int net_interface_imp::send_frame(uint8_t *frame, uint16_t mem_buf_len)\n {\n int send_result;\n\n \/*target address*\/\n struct sockaddr_ll socket_address;\n\n \/*prepare sockaddr_ll*\/\n\n \/*RAW communication*\/\n socket_address.sll_family = PF_PACKET;\n socket_address.sll_protocol = htons(ethertype);\n\n \/*index of the network device\n see full code later how to retrieve it*\/\n socket_address.sll_ifindex = ifindex;\n\n \/*ARP hardware identifier is ethernet*\/\n socket_address.sll_hatype = ARPHRD_ETHER;\n\n \/*target is another host*\/\n socket_address.sll_pkttype = PACKET_OTHERHOST;\n\n \/*address length*\/\n socket_address.sll_halen = ETH_ALEN;\n \/*MAC - begin*\/\n memcpy(&socket_address.sll_addr[0], &frame[0], 6);\n \/*MAC - end*\/\n socket_address.sll_addr[6] = 0x00;\/*not used*\/\n socket_address.sll_addr[7] = 0x00;\/*not used*\/\n\n \/*send the packet*\/\n send_result = sendto(rawsock, frame, mem_buf_len, 0,\n (struct sockaddr*)&socket_address, sizeof(socket_address));\n\n return send_result;\n }\n\n int net_interface_imp::getifindex(int rawsock, const char *iface)\n {\n struct ifreq ifr;\n int ret;\n\n memset(&ifr,0,sizeof(ifr));\n strncpy(ifr.ifr_name,iface,sizeof(ifr.ifr_name));\n\n ret=ioctl(rawsock,SIOCGIFINDEX,&ifr);\n\n if(ret<0)\n {\n return ret;\n }\n\n return ifr.ifr_ifindex;\n }\n\n int net_interface_imp::setpromiscuous(int rawsock, int ifindex)\n {\n struct packet_mreq mr;\n\n memset(&mr,0,sizeof(mr));\n mr.mr_ifindex=ifindex;\n mr.mr_type=PACKET_MR_ALLMULTI;\n\n return setsockopt(rawsock, SOL_PACKET,\n PACKET_ADD_MEMBERSHIP,&mr,sizeof(mr));\n }\n\n\n net_interface * create_net_interface()\n {\n return (new net_interface_imp());\n }\n\n}\n<|endoftext|>"} {"text":"<commit_before>\/\/ Copyright (c) 2016 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 <sys\/syscall.h>\n#include <unistd.h>\n#include <mach\/mach_time.h>\n#include \"..\/TPlatform.h\"\n\nnamespace tyr { namespace basic {\n\npid_t kern_gettid(void) {\n return static_cast<pid_t>(syscall(SYS_thread_selfid));\n}\n\nint kern_this_thread_setname(const char* name) {\n return pthread_setname_np(name);\n}\n\nint kern_gettime(struct timespec* timep) {\n mach_timebase_info_data_t info;\n if (KERN_SUCCESS != mach_timebase_info(&info))\n abort();\n uint64_t realtime = mach_absolute_time() * info.numer \/ info.denom;\n timep->tv_sec = realtime \/ NANOSEC;\n timep->tv_nsec = realtime % NANOSEC;\n return 0;\n}\n\n}}\n<commit_msg>fix(cond): fixed bug of kernel syscall of condition variable for darwin platform<commit_after>\/\/ Copyright (c) 2016 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 <mach\/mach_time.h>\n#include <sys\/syscall.h>\n#include <unistd.h>\n#include <stdlib.h>\n#include \"..\/TPlatform.h\"\n\nnamespace tyr { namespace basic {\n\npid_t kern_gettid(void) {\n return static_cast<pid_t>(syscall(SYS_thread_selfid));\n}\n\nint kern_this_thread_setname(const char* name) {\n return pthread_setname_np(name);\n}\n\nint kern_gettime(struct timespec* timep) {\n mach_timebase_info_data_t info;\n if (KERN_SUCCESS != mach_timebase_info(&info))\n abort();\n uint64_t realtime = mach_absolute_time() * info.numer \/ info.denom;\n timep->tv_sec = realtime \/ NANOSEC;\n timep->tv_nsec = realtime % NANOSEC;\n return 0;\n}\n\n}}\n<|endoftext|>"} {"text":"<commit_before>\/*\n Copyright Amazon.com, Inc. or its affiliates. All Rights Reserved.\n SPDX-License-Identifier: Apache-2.0\n*\/\n\n#include <aws\/core\/Aws.h>\n#include <aws\/core\/utils\/threading\/Semaphore.h>\n#include <aws\/core\/auth\/AWSCredentialsProviderChain.h>\n#include <aws\/transcribestreaming\/TranscribeStreamingServiceClient.h>\n#include <aws\/transcribestreaming\/model\/StartStreamTranscriptionHandler.h>\n#include <aws\/transcribestreaming\/model\/StartStreamTranscriptionRequest.h>\n#include <aws\/core\/platform\/FileSystem.h>\n#include <fstream>\n#include <chrono>\n#include <thread>\n#include <array>\n\nusing namespace Aws;\nusing namespace Aws::TranscribeStreamingService;\nusing namespace Aws::TranscribeStreamingService::Model;\n\n\/\/TODO(User): Update path to location of local .wav test file, if necessary.\nstatic const Aws::String FILE_NAME{MEDIA_DIR \"\/transcribe-test-file.wav\"};\nstatic const int BUFFER_SIZE = 1024;\nstatic const int END_OF_STREAM_SLEEP_SECONDS = 10;\n\n\/\/snippet-start:[transcribe.cpp.stream_transcription_async.code]\nint main() {\n Aws::SDKOptions options;\n options.loggingOptions.logLevel = Aws::Utils::Logging::LogLevel::Trace;\n Aws::InitAPI(options);\n {\n \/\/TODO(User): Set to the region of your AWS account.\n const Aws::String region = Aws::Region::US_WEST_2;\n\n Aws::Utils::Threading::Semaphore received(0 \/*initialCount*\/, 1 \/*maxCount*\/);\n\n \/\/Load a profile that has been granted AmazonTranscribeFullAccess AWS managed permission policy.\n Aws::Client::ClientConfiguration config;\n#ifdef _WIN32\n \/\/ ATTENTION: On Windows with AWS SDK version 1.9, this example only runs if the SDK is built\n \/\/ with the curl library. (9\/15\/2022)\n \/\/ For more information, see the accompanying ReadMe.\n \/\/ For more information, see \"Building the SDK for Windows with curl\".\n \/\/ https:\/\/docs.aws.amazon.com\/sdk-for-cpp\/v1\/developer-guide\/setup-windows.html\n \/\/TODO(User): Update to the location of your .crt file.\n config.caFile = \"C:\/curl\/bin\/curl-ca-bundle.crt\";\n#endif\n config.region = region;\n\n TranscribeStreamingServiceClient client(config);\n StartStreamTranscriptionHandler handler;\n handler.SetOnErrorCallback(\n [](const Aws::Client::AWSError<TranscribeStreamingServiceErrors> &error) {\n std::cerr << \"ERROR: \" + error.GetMessage() << std::endl;\n });\n \/\/SetTranscriptEventCallback called for every 'chunk' of file transcripted.\n \/\/ Partial results are returned in real time.\n handler.SetTranscriptEventCallback([&received](const TranscriptEvent &ev) {\n for (auto &&r: ev.GetTranscript().GetResults()) {\n if (r.GetIsPartial()) {\n std::cout << \"[partial] \";\n }\n else {\n std::cout << \"[Final] \";\n }\n for (auto &&alt: r.GetAlternatives()) {\n std::cout << alt.GetTranscript() << std::endl;\n }\n }\n received.Release();\n });\n\n StartStreamTranscriptionRequest request;\n request.SetMediaSampleRateHertz(8000);\n request.SetLanguageCode(LanguageCode::en_US);\n request.SetMediaEncoding(\n MediaEncoding::pcm); \/\/ wav and aiff files are PCM formats.\n request.SetEventStreamHandler(handler);\n\n auto OnStreamReady = [](AudioStream &stream) {\n Aws::FStream file(FILE_NAME, std::ios_base::in | std::ios_base::binary);\n if (!file.is_open()) {\n std::cerr << \"Failed to open \" << FILE_NAME << '\\n';\n }\n std::array<char, BUFFER_SIZE> buf;\n int i = 0;\n while (file) {\n file.read(&buf[0], buf.size());\n\n if (!file)\n std::cout << \"File: only \" << file.gcount() << \" could be read\"\n << std::endl;\n\n Aws::Vector<unsigned char> bits{buf.begin(), buf.end()};\n AudioEvent event(std::move(bits));\n if (!stream) {\n std::cerr << \"Failed to create a stream\" << std::endl;\n break;\n }\n \/\/The std::basic_istream::gcount() is used to count the characters in the given string. It returns\n \/\/the number of characters extracted by the last read() operation.\n if (file.gcount() > 0) {\n if (!stream.WriteAudioEvent(event)) {\n std::cerr << \"Failed to write an audio event\" << std::endl;\n break;\n }\n }\n else {\n break;\n }\n std::this_thread::sleep_for(std::chrono::milliseconds(\n 25)); \/\/ Slow down because we are streaming from a file.\n }\n if (!stream.WriteAudioEvent(\n AudioEvent())) {\n \/\/ Per the spec, we have to send an empty event (an event without a payload) at the end.\n std::cerr << \"Failed to send an empty frame\" << std::endl;\n }\n else {\n std::cout << \"Successfully sent the empty frame\" << std::endl;\n }\n stream.flush();\n \/\/ Workaround to prevent an error at the end of the stream for this contrived example.\n std::this_thread::sleep_for(std::chrono::seconds(\n END_OF_STREAM_SLEEP_SECONDS));\n stream.Close();\n };\n\n Aws::Utils::Threading::Semaphore signaling(0 \/*initialCount*\/, 1 \/*maxCount*\/);\n auto OnResponseCallback = [&signaling](\n const TranscribeStreamingServiceClient * \/*unused*\/,\n const Model::StartStreamTranscriptionRequest & \/*unused*\/,\n const Model::StartStreamTranscriptionOutcome & \/*unused*\/,\n const std::shared_ptr<const Aws::Client::AsyncCallerContext> & \/*unused*\/) {\n signaling.Release();\n };\n\n std::cout << \"Starting...\" << std::endl;\n client.StartStreamTranscriptionAsync(request, OnStreamReady, OnResponseCallback,\n nullptr \/*context*\/);\n signaling.WaitOne(); \/\/ Prevent the application from exiting until we're done.\n std::cout << \"Done\" << std::endl;\n }\n\n Aws::ShutdownAPI(options);\n\n return 0;\n}\n\/\/snippet-end:[transcribe.cpp.stream_transcription_async.code]\n<commit_msg>changes tow show sequence for closing stream<commit_after>\/*\n Copyright Amazon.com, Inc. or its affiliates. All Rights Reserved.\n SPDX-License-Identifier: Apache-2.0\n*\/\n\n#include <aws\/core\/Aws.h>\n#include <aws\/core\/utils\/threading\/Semaphore.h>\n#include <aws\/core\/auth\/AWSCredentialsProviderChain.h>\n#include <aws\/transcribestreaming\/TranscribeStreamingServiceClient.h>\n#include <aws\/transcribestreaming\/model\/StartStreamTranscriptionHandler.h>\n#include <aws\/transcribestreaming\/model\/StartStreamTranscriptionRequest.h>\n#include <aws\/core\/platform\/FileSystem.h>\n#include <fstream>\n#include <chrono>\n#include <thread>\n#include <array>\n\nusing namespace Aws;\nusing namespace Aws::TranscribeStreamingService;\nusing namespace Aws::TranscribeStreamingService::Model;\n\n\/\/TODO(User): Update path to location of local .wav test file, if necessary.\nstatic const Aws::String FILE_NAME{MEDIA_DIR \"\/transcribe-test-file.wav\"};\nstatic const int BUFFER_SIZE = 1024;\nstatic const int END_OF_STREAM_SLEEP_SECONDS = 10;\n\n\/\/snippet-start:[transcribe.cpp.stream_transcription_async.code]\nint main() {\n Aws::SDKOptions options;\n options.loggingOptions.logLevel = Aws::Utils::Logging::LogLevel::Trace;\n Aws::InitAPI(options);\n {\n \/\/TODO(User): Set to the region of your AWS account.\n const Aws::String region = Aws::Region::US_WEST_2;\n\n Aws::Utils::Threading::Semaphore canCloseStream(0 \/*initialCount*\/, 1 \/*maxCount*\/);\n\n \/\/Load a profile that has been granted AmazonTranscribeFullAccess AWS managed permission policy.\n Aws::Client::ClientConfiguration config;\n#ifdef _WIN32\n \/\/ ATTENTION: On Windows with AWS SDK version 1.9, this example only runs if the SDK is built\n \/\/ with the curl library. (9\/15\/2022)\n \/\/ For more information, see the accompanying ReadMe.\n \/\/ For more information, see \"Building the SDK for Windows with curl\".\n \/\/ https:\/\/docs.aws.amazon.com\/sdk-for-cpp\/v1\/developer-guide\/setup-windows.html\n \/\/TODO(User): Update to the location of your .crt file.\n config.caFile = \"C:\/curl\/bin\/curl-ca-bundle.crt\";\n#endif\n config.region = region;\n\n TranscribeStreamingServiceClient client(config);\n StartStreamTranscriptionHandler handler;\n handler.SetOnErrorCallback(\n [](const Aws::Client::AWSError<TranscribeStreamingServiceErrors> &error) {\n std::cerr << \"ERROR: \" + error.GetMessage() << std::endl;\n });\n \/\/SetTranscriptEventCallback called for every 'chunk' of file transcripted.\n \/\/ Partial results are returned in real time.\n handler.SetTranscriptEventCallback([&canCloseStream](const TranscriptEvent &ev) {\n bool isFinal = false;\n for (auto &&r: ev.GetTranscript().GetResults()) {\n if (r.GetIsPartial()) {\n std::cout << \"[partial] \";\n }\n else {\n std::cout << \"[Final] \";\n isFinal = true;\n }\n for (auto &&alt: r.GetAlternatives()) {\n std::cout << alt.GetTranscript() << std::endl;\n }\n }\n if (isFinal) {\n canCloseStream.Release();\n }\n });\n\n StartStreamTranscriptionRequest request;\n request.SetMediaSampleRateHertz(8000);\n request.SetLanguageCode(LanguageCode::en_US);\n request.SetMediaEncoding(\n MediaEncoding::pcm); \/\/ wav and aiff files are PCM formats.\n request.SetEventStreamHandler(handler);\n\n auto OnStreamReady = [&canCloseStream](AudioStream &stream) {\n Aws::FStream file(FILE_NAME, std::ios_base::in | std::ios_base::binary);\n if (!file.is_open()) {\n std::cerr << \"Failed to open \" << FILE_NAME << '\\n';\n }\n std::array<char, BUFFER_SIZE> buf;\n int i = 0;\n while (file) {\n file.read(&buf[0], buf.size());\n\n if (!file)\n std::cout << \"File: only \" << file.gcount() << \" could be read\"\n << std::endl;\n\n Aws::Vector<unsigned char> bits{buf.begin(), buf.end()};\n AudioEvent event(std::move(bits));\n if (!stream) {\n std::cerr << \"Failed to create a stream\" << std::endl;\n break;\n }\n \/\/The std::basic_istream::gcount() is used to count the characters in the given string. It returns\n \/\/the number of characters extracted by the last read() operation.\n if (file.gcount() > 0) {\n if (!stream.WriteAudioEvent(event)) {\n std::cerr << \"Failed to write an audio event\" << std::endl;\n break;\n }\n }\n else {\n break;\n }\n std::this_thread::sleep_for(std::chrono::milliseconds(\n 25)); \/\/ Slow down because we are streaming from a file.\n }\n if (!stream.WriteAudioEvent(\n AudioEvent())) {\n \/\/ Per the spec, we have to send an empty event (an event without a payload) at the end.\n std::cerr << \"Failed to send an empty frame\" << std::endl;\n }\n else {\n std::cout << \"Successfully sent the empty frame\" << std::endl;\n }\n stream.flush();\n \/\/ Wait until final transcript is received before closing the stream.\n canCloseStream.WaitOne();\n stream.Close();\n };\n\n Aws::Utils::Threading::Semaphore signaling(0 \/*initialCount*\/, 1 \/*maxCount*\/);\n auto OnResponseCallback = [&signaling, &canCloseStream](\n const TranscribeStreamingServiceClient * \/*unused*\/,\n const Model::StartStreamTranscriptionRequest & \/*unused*\/,\n const Model::StartStreamTranscriptionOutcome & outcome,\n const std::shared_ptr<const Aws::Client::AsyncCallerContext> & \/*unused*\/) {\n\n if (!outcome.IsSuccess())\n {\n std::cerr << \"Transcribe streaming error \" << outcome.GetError().GetMessage() << std::endl;\n }\n\n canCloseStream.Release(); \/\/ Just to be safe.\n signaling.Release();\n };\n\n std::cout << \"Starting...\" << std::endl;\n client.StartStreamTranscriptionAsync(request, OnStreamReady, OnResponseCallback,\n nullptr \/*context*\/);\n signaling.WaitOne(); \/\/ Prevent the application from exiting until we're done.\n std::cout << \"Done\" << std::endl;\n }\n\n Aws::ShutdownAPI(options);\n\n return 0;\n}\n\/\/snippet-end:[transcribe.cpp.stream_transcription_async.code]\n<|endoftext|>"} {"text":"<commit_before>\/\/ Copyright (C) 2011 The Libphonenumber 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\/\/ Author: Tao Huang\n\/\/\n\/\/ Basic test cases for PhoneNumberMatch.\n\n#include \"phonenumbers\/phonenumber.h\"\n#include \"phonenumbers\/phonenumbermatch.h\"\n\n#include <gtest\/gtest.h>\n\n#include \"phonenumbers\/phonenumber.pb.h\"\n\nnamespace i18n {\nnamespace phonenumbers {\n\nTEST(PhoneNumberMatch, TestGetterMethods) {\n PhoneNumber number;\n const int start_index = 10;\n const string raw_phone_number(\"1 800 234 45 67\");\n PhoneNumberMatch match1(start_index, raw_phone_number, number);\n\n EXPECT_EQ(start_index, match1.start());\n EXPECT_EQ(start_index + raw_phone_number.length(), match1.end());\n EXPECT_EQ(raw_phone_number.length(), match1.length());\n EXPECT_EQ(raw_phone_number, match1.raw_string());\n\n EXPECT_EQ(\"PhoneNumberMatch [10,25) 1 800 234 45 67\", match1.ToString());\n}\n\nTEST(PhoneNumberMatch, TestEquals) {\n PhoneNumber number;\n PhoneNumberMatch match1(10, \"1 800 234 45 67\", number);\n PhoneNumberMatch match2(10, \"1 800 234 45 67\", number);\n\n match2.set_start(11);\n ASSERT_FALSE(match1.Equals(match2));\n match2.set_start(match1.start());\n EXPECT_TRUE(match1.Equals(match2));\n\n PhoneNumber number2;\n number2.set_raw_input(\"123\");\n match2.set_number(number2);\n ASSERT_FALSE(match1.Equals(match2));\n match2.set_number(match1.number());\n EXPECT_TRUE(ExactlySameAs(match1.number(), match2.number()));\n EXPECT_TRUE(match1.Equals(match2));\n\n match2.set_raw_string(\"123\");\n ASSERT_FALSE(match1.Equals(match2));\n}\n\nTEST(PhoneNumberMatch, TestAssignmentOverload) {\n PhoneNumber number;\n PhoneNumberMatch match1(10, \"1 800 234 45 67\", number);\n PhoneNumberMatch match2;\n ASSERT_FALSE(match1.Equals(match2));\n\n match2.CopyFrom(match1);\n ASSERT_TRUE(match1.Equals(match2));\n\n PhoneNumberMatch match3;\n PhoneNumberMatch match4;\n match4.CopyFrom(match2);\n match3.CopyFrom(match2);\n ASSERT_TRUE(match3.Equals(match4));\n ASSERT_TRUE(match4.Equals(match2));\n}\n\nTEST(PhoneNumberMatch, TestCopyConstructor) {\n PhoneNumber number;\n PhoneNumberMatch match1(10, \"1 800 234 45 67\", number);\n PhoneNumberMatch match2;\n match2.CopyFrom(match1);\n ASSERT_TRUE(match1.Equals(match2));\n}\n\n} \/\/ namespace phonenumbers\n} \/\/ namespace i18n\n<commit_msg>CPP: Adjust phonenumbermatch_test.cc integer types.<commit_after>\/\/ Copyright (C) 2011 The Libphonenumber 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\/\/ Author: Tao Huang\n\/\/\n\/\/ Basic test cases for PhoneNumberMatch.\n\n#include \"phonenumbers\/phonenumber.h\"\n#include \"phonenumbers\/phonenumbermatch.h\"\n\n#include <gtest\/gtest.h>\n\n#include \"phonenumbers\/phonenumber.pb.h\"\n\nnamespace i18n {\nnamespace phonenumbers {\n\nTEST(PhoneNumberMatch, TestGetterMethods) {\n PhoneNumber number;\n const int start_index = 10;\n const string raw_phone_number(\"1 800 234 45 67\");\n PhoneNumberMatch match1(start_index, raw_phone_number, number);\n\n EXPECT_EQ(start_index, match1.start());\n EXPECT_EQ(start_index + static_cast<int>(raw_phone_number.length()),\n match1.end());\n EXPECT_EQ(static_cast<int>(raw_phone_number.length()), match1.length());\n EXPECT_EQ(raw_phone_number, match1.raw_string());\n\n EXPECT_EQ(\"PhoneNumberMatch [10,25) 1 800 234 45 67\", match1.ToString());\n}\n\nTEST(PhoneNumberMatch, TestEquals) {\n PhoneNumber number;\n PhoneNumberMatch match1(10, \"1 800 234 45 67\", number);\n PhoneNumberMatch match2(10, \"1 800 234 45 67\", number);\n\n match2.set_start(11);\n ASSERT_FALSE(match1.Equals(match2));\n match2.set_start(match1.start());\n EXPECT_TRUE(match1.Equals(match2));\n\n PhoneNumber number2;\n number2.set_raw_input(\"123\");\n match2.set_number(number2);\n ASSERT_FALSE(match1.Equals(match2));\n match2.set_number(match1.number());\n EXPECT_TRUE(ExactlySameAs(match1.number(), match2.number()));\n EXPECT_TRUE(match1.Equals(match2));\n\n match2.set_raw_string(\"123\");\n ASSERT_FALSE(match1.Equals(match2));\n}\n\nTEST(PhoneNumberMatch, TestAssignmentOverload) {\n PhoneNumber number;\n PhoneNumberMatch match1(10, \"1 800 234 45 67\", number);\n PhoneNumberMatch match2;\n ASSERT_FALSE(match1.Equals(match2));\n\n match2.CopyFrom(match1);\n ASSERT_TRUE(match1.Equals(match2));\n\n PhoneNumberMatch match3;\n PhoneNumberMatch match4;\n match4.CopyFrom(match2);\n match3.CopyFrom(match2);\n ASSERT_TRUE(match3.Equals(match4));\n ASSERT_TRUE(match4.Equals(match2));\n}\n\nTEST(PhoneNumberMatch, TestCopyConstructor) {\n PhoneNumber number;\n PhoneNumberMatch match1(10, \"1 800 234 45 67\", number);\n PhoneNumberMatch match2;\n match2.CopyFrom(match1);\n ASSERT_TRUE(match1.Equals(match2));\n}\n\n} \/\/ namespace phonenumbers\n} \/\/ namespace i18n\n<|endoftext|>"} {"text":"<commit_before>\/\/ Copyright (C) 2011 The Libphonenumber 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\/\/ Author: Tao Huang\n\/\/\n\/\/ Basic test cases for PhoneNumberMatch.\n\n#include \"phonenumbers\/phonenumber.h\"\n#include \"phonenumbers\/phonenumbermatch.h\"\n\n#include <gtest\/gtest.h>\n\n#include \"phonenumbers\/phonenumber.pb.h\"\n\nnamespace i18n {\nnamespace phonenumbers {\n\nTEST(PhoneNumberMatch, TestGetterMethods) {\n PhoneNumber number;\n const int start_index = 10;\n const string raw_phone_number(\"1 800 234 45 67\");\n PhoneNumberMatch match1(start_index, raw_phone_number, number);\n\n EXPECT_EQ(start_index, match1.start());\n EXPECT_EQ(start_index + raw_phone_number.length(), match1.end());\n EXPECT_EQ(raw_phone_number.length(), match1.length());\n EXPECT_EQ(raw_phone_number, match1.raw_string());\n\n EXPECT_EQ(\"PhoneNumberMatch [10,25) 1 800 234 45 67\", match1.ToString());\n}\n\nTEST(PhoneNumberMatch, TestEquals) {\n PhoneNumber number;\n PhoneNumberMatch match1(10, \"1 800 234 45 67\", number);\n PhoneNumberMatch match2(10, \"1 800 234 45 67\", number);\n\n match2.set_start(11);\n ASSERT_FALSE(match1.Equals(match2));\n match2.set_start(match1.start());\n EXPECT_TRUE(match1.Equals(match2));\n\n PhoneNumber number2;\n number2.set_raw_input(\"123\");\n match2.set_number(number2);\n ASSERT_FALSE(match1.Equals(match2));\n match2.set_number(match1.number());\n EXPECT_TRUE(ExactlySameAs(match1.number(), match2.number()));\n EXPECT_TRUE(match1.Equals(match2));\n\n match2.set_raw_string(\"123\");\n ASSERT_FALSE(match1.Equals(match2));\n}\n\nTEST(PhoneNumberMatch, TestAssignmentOverload) {\n PhoneNumber number;\n PhoneNumberMatch match1(10, \"1 800 234 45 67\", number);\n PhoneNumberMatch match2;\n ASSERT_FALSE(match1.Equals(match2));\n\n match2.CopyFrom(match1);\n ASSERT_TRUE(match1.Equals(match2));\n\n PhoneNumberMatch match3;\n PhoneNumberMatch match4;\n match4.CopyFrom(match2);\n match3.CopyFrom(match2);\n ASSERT_TRUE(match3.Equals(match4));\n ASSERT_TRUE(match4.Equals(match2));\n}\n\nTEST(PhoneNumberMatch, TestCopyConstructor) {\n PhoneNumber number;\n PhoneNumberMatch match1(10, \"1 800 234 45 67\", number);\n PhoneNumberMatch match2;\n match2.CopyFrom(match1);\n ASSERT_TRUE(match1.Equals(match2));\n}\n\n} \/\/ namespace phonenumbers\n} \/\/ namespace i18n\n<commit_msg>CPP: Adjust phonenumbermatch_test.cc integer types.<commit_after>\/\/ Copyright (C) 2011 The Libphonenumber 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\/\/ Author: Tao Huang\n\/\/\n\/\/ Basic test cases for PhoneNumberMatch.\n\n#include \"phonenumbers\/phonenumber.h\"\n#include \"phonenumbers\/phonenumbermatch.h\"\n\n#include <gtest\/gtest.h>\n\n#include \"phonenumbers\/phonenumber.pb.h\"\n\nnamespace i18n {\nnamespace phonenumbers {\n\nTEST(PhoneNumberMatch, TestGetterMethods) {\n PhoneNumber number;\n const int start_index = 10;\n const string raw_phone_number(\"1 800 234 45 67\");\n PhoneNumberMatch match1(start_index, raw_phone_number, number);\n\n EXPECT_EQ(start_index, match1.start());\n EXPECT_EQ(start_index + static_cast<int>(raw_phone_number.length()),\n match1.end());\n EXPECT_EQ(static_cast<int>(raw_phone_number.length()), match1.length());\n EXPECT_EQ(raw_phone_number, match1.raw_string());\n\n EXPECT_EQ(\"PhoneNumberMatch [10,25) 1 800 234 45 67\", match1.ToString());\n}\n\nTEST(PhoneNumberMatch, TestEquals) {\n PhoneNumber number;\n PhoneNumberMatch match1(10, \"1 800 234 45 67\", number);\n PhoneNumberMatch match2(10, \"1 800 234 45 67\", number);\n\n match2.set_start(11);\n ASSERT_FALSE(match1.Equals(match2));\n match2.set_start(match1.start());\n EXPECT_TRUE(match1.Equals(match2));\n\n PhoneNumber number2;\n number2.set_raw_input(\"123\");\n match2.set_number(number2);\n ASSERT_FALSE(match1.Equals(match2));\n match2.set_number(match1.number());\n EXPECT_TRUE(ExactlySameAs(match1.number(), match2.number()));\n EXPECT_TRUE(match1.Equals(match2));\n\n match2.set_raw_string(\"123\");\n ASSERT_FALSE(match1.Equals(match2));\n}\n\nTEST(PhoneNumberMatch, TestAssignmentOverload) {\n PhoneNumber number;\n PhoneNumberMatch match1(10, \"1 800 234 45 67\", number);\n PhoneNumberMatch match2;\n ASSERT_FALSE(match1.Equals(match2));\n\n match2.CopyFrom(match1);\n ASSERT_TRUE(match1.Equals(match2));\n\n PhoneNumberMatch match3;\n PhoneNumberMatch match4;\n match4.CopyFrom(match2);\n match3.CopyFrom(match2);\n ASSERT_TRUE(match3.Equals(match4));\n ASSERT_TRUE(match4.Equals(match2));\n}\n\nTEST(PhoneNumberMatch, TestCopyConstructor) {\n PhoneNumber number;\n PhoneNumberMatch match1(10, \"1 800 234 45 67\", number);\n PhoneNumberMatch match2;\n match2.CopyFrom(match1);\n ASSERT_TRUE(match1.Equals(match2));\n}\n\n} \/\/ namespace phonenumbers\n} \/\/ namespace i18n\n<|endoftext|>"} {"text":"<commit_before>\n#include \"nethandlers.h\"\n#include \"netmessages.h\"\n\n#define DECLARE_NET_HANDLER_ARRAY(funcname) \\\n { \\\n &NetHandlers::Net_NOP_##funcname, \\\n &NetHandlers::Net_Disconnect_##funcname, \\\n &NetHandlers::Net_File_##funcname, \\\n &NetHandlers::Net_Tick_##funcname, \\\n &NetHandlers::Net_StringCmd_##funcname, \\\n &NetHandlers::Net_SetConVar_##funcname, \\\n &NetHandlers::Net_SignonState_##funcname, \\\n &NetHandlers::SVC_Print_##funcname, \\\n &NetHandlers::SVC_ServerInfo_##funcname, \\\n &NetHandlers::SVC_SendTable_##funcname, \\\n &NetHandlers::SVC_ClassInfo_##funcname, \\\n &NetHandlers::SVC_SetPause_##funcname, \\\n &NetHandlers::SVC_CreateStringTable_##funcname, \\\n &NetHandlers::SVC_UpdateStringTable_##funcname, \\\n &NetHandlers::SVC_VoiceInit_##funcname, \\\n &NetHandlers::SVC_VoiceData_##funcname, \\\n &NetHandlers::SVC_HLTV_##funcname, \\\n &NetHandlers::SVC_Sounds_##funcname, \\\n &NetHandlers::SVC_SetView_##funcname, \\\n &NetHandlers::SVC_FixAngle_##funcname, \\\n &NetHandlers::SVC_CrosshairAngle_##funcname, \\\n &NetHandlers::SVC_BSPDecal_##funcname, \\\n &NetHandlers::SVC_TerrainMod_##funcname, \\\n &NetHandlers::SVC_UserMessage_##funcname, \\\n &NetHandlers::SVC_EntityMessage_##funcname, \\\n &NetHandlers::SVC_GameEvent_##funcname, \\\n &NetHandlers::SVC_PacketEntities_##funcname, \\\n &NetHandlers::SVC_TempEntities_##funcname, \\\n &NetHandlers::SVC_Prefetch_##funcname, \\\n &NetHandlers::SVC_Menu_##funcname, \\\n &NetHandlers::SVC_GameEventList_##funcname, \\\n &NetHandlers::SVC_GetCvarValue_##funcname \\\n }\n\ntypedef bool (*NetMsgBitReadFn)(bf_read& bitbuf, SourceGameContext& context, void* data);\ntypedef bool (*NetMsgBitWriteFn)(bf_write& bitbuf, const SourceGameContext& context, void* data);\ntypedef bool (*NetMsgJsonReadFn)(JsonRead& bitbuf, SourceGameContext& context, void* data);\ntypedef bool (*NetMsgJsonWriteFn)(JsonWrite& bitbuf, const SourceGameContext& context, void* data);\ntypedef void (*NetMsgToStringFn)(std::ostringstream& out, void* data);\n\nbool NetHandlers::NetMsg_BitRead(uint32_t type, bf_read& bitbuf, SourceGameContext& context, void* data)\n{\n static const NetMsgBitReadFn netHandlers[] = DECLARE_NET_HANDLER_ARRAY(BitRead);\n return netHandlers[type](bitbuf, context, data);\n}\n\nbool NetHandlers::NetMsg_BitWrite(uint32_t type, bf_write& bitbuf, const SourceGameContext& context, void* data)\n{\n static const NetMsgBitWriteFn netHandlers[] = DECLARE_NET_HANDLER_ARRAY(BitWrite);\n return netHandlers[type](bitbuf, context, data);\n}\n\nbool NetHandlers::NetMsg_JsonRead(uint32_t type, JsonRead& jsonbuf, SourceGameContext& context, void* data)\n{\n static const NetMsgJsonReadFn netHandlers[] = DECLARE_NET_HANDLER_ARRAY(JsonRead);\n return netHandlers[type](jsonbuf, context, data);\n}\n\nbool NetHandlers::NetMsg_JsonWrite(uint32_t type, JsonWrite& jsonbuf, const SourceGameContext& context, void* data)\n{\n static const NetMsgJsonWriteFn netHandlers[] = DECLARE_NET_HANDLER_ARRAY(JsonWrite);\n return netHandlers[type](jsonbuf, context, data);\n}\n\nvoid NetHandlers::NetMsg_ToString(uint32_t type, std::ostringstream& out, void* data)\n{\n static const NetMsgToStringFn netHandlers[] = DECLARE_NET_HANDLER_ARRAY(ToString);\n netHandlers[type](out, data);\n}\n<commit_msg>Fixed typo<commit_after>\n#include \"nethandlers.h\"\n#include \"netmessages.h\"\n\n#define DECLARE_NET_HANDLER_ARRAY(funcname) \\\n { \\\n &NetHandlers::Net_NOP_##funcname, \\\n &NetHandlers::Net_Disconnect_##funcname, \\\n &NetHandlers::Net_File_##funcname, \\\n &NetHandlers::Net_Tick_##funcname, \\\n &NetHandlers::Net_StringCmd_##funcname, \\\n &NetHandlers::Net_SetConVar_##funcname, \\\n &NetHandlers::Net_SignonState_##funcname, \\\n &NetHandlers::SVC_Print_##funcname, \\\n &NetHandlers::SVC_ServerInfo_##funcname, \\\n &NetHandlers::SVC_SendTable_##funcname, \\\n &NetHandlers::SVC_ClassInfo_##funcname, \\\n &NetHandlers::SVC_SetPause_##funcname, \\\n &NetHandlers::SVC_CreateStringTable_##funcname, \\\n &NetHandlers::SVC_UpdateStringTable_##funcname, \\\n &NetHandlers::SVC_VoiceInit_##funcname, \\\n &NetHandlers::SVC_VoiceData_##funcname, \\\n &NetHandlers::SVC_HLTV_##funcname, \\\n &NetHandlers::SVC_Sounds_##funcname, \\\n &NetHandlers::SVC_SetView_##funcname, \\\n &NetHandlers::SVC_FixAngle_##funcname, \\\n &NetHandlers::SVC_CrosshairAngle_##funcname, \\\n &NetHandlers::SVC_BSPDecal_##funcname, \\\n &NetHandlers::SVC_TerrainMod_##funcname, \\\n &NetHandlers::SVC_UserMessage_##funcname, \\\n &NetHandlers::SVC_EntityMessage_##funcname, \\\n &NetHandlers::SVC_GameEvent_##funcname, \\\n &NetHandlers::SVC_PacketEntities_##funcname, \\\n &NetHandlers::SVC_TempEntities_##funcname, \\\n &NetHandlers::SVC_Prefetch_##funcname, \\\n &NetHandlers::SVC_Menu_##funcname, \\\n &NetHandlers::SVC_GameEventList_##funcname, \\\n &NetHandlers::SVC_GetCvarValue_##funcname \\\n }\n\ntypedef bool (*NetMsgBitReadFn)(bf_read& bitbuf, SourceGameContext& context, void* data);\ntypedef bool (*NetMsgBitWriteFn)(bf_write& bitbuf, const SourceGameContext& context, void* data);\ntypedef bool (*NetMsgJsonReadFn)(JsonRead& jsonbuf, SourceGameContext& context, void* data);\ntypedef bool (*NetMsgJsonWriteFn)(JsonWrite& jsonbuf, const SourceGameContext& context, void* data);\ntypedef void (*NetMsgToStringFn)(std::ostringstream& out, void* data);\n\nbool NetHandlers::NetMsg_BitRead(uint32_t type, bf_read& bitbuf, SourceGameContext& context, void* data)\n{\n static const NetMsgBitReadFn netHandlers[] = DECLARE_NET_HANDLER_ARRAY(BitRead);\n return netHandlers[type](bitbuf, context, data);\n}\n\nbool NetHandlers::NetMsg_BitWrite(uint32_t type, bf_write& bitbuf, const SourceGameContext& context, void* data)\n{\n static const NetMsgBitWriteFn netHandlers[] = DECLARE_NET_HANDLER_ARRAY(BitWrite);\n return netHandlers[type](bitbuf, context, data);\n}\n\nbool NetHandlers::NetMsg_JsonRead(uint32_t type, JsonRead& jsonbuf, SourceGameContext& context, void* data)\n{\n static const NetMsgJsonReadFn netHandlers[] = DECLARE_NET_HANDLER_ARRAY(JsonRead);\n return netHandlers[type](jsonbuf, context, data);\n}\n\nbool NetHandlers::NetMsg_JsonWrite(uint32_t type, JsonWrite& jsonbuf, const SourceGameContext& context, void* data)\n{\n static const NetMsgJsonWriteFn netHandlers[] = DECLARE_NET_HANDLER_ARRAY(JsonWrite);\n return netHandlers[type](jsonbuf, context, data);\n}\n\nvoid NetHandlers::NetMsg_ToString(uint32_t type, std::ostringstream& out, void* data)\n{\n static const NetMsgToStringFn netHandlers[] = DECLARE_NET_HANDLER_ARRAY(ToString);\n netHandlers[type](out, data);\n}\n<|endoftext|>"} {"text":"<commit_before>#include \"powerSleep.h\"\n\n#include <avr\/sleep.h>\n#include <avr\/power.h>\n\nvoid enterSleep()\n{\n \/*** Setup Sleep options ***\/\n \n set_sleep_mode(SLEEP_MODE_PWR_DOWN); \/\/ Lowest powerdown mode\n sleep_enable(); \/\/ Enable sleep\n\n \/*** Put processor to sleep ***\/\n\n sleep_mode();\n\n \/*** Continue ***\/\n \n sleep_disable();\n\n \/*** Re-enable necessary peripherals ***\/\n if(\/*serialActive*\/)\n {\n power_usart0_enable();\n }\n power_spi_enable();\n\n return;\n}\nvoid disableUnneededPeripherals()\n{\n \/*** Disable Uneeded Peripherals ***\/\n ADCSRA = 0; \/\/ Disable ADC\n power_adc_disable();\n power_timer0_disable();\n power_timer1_disable();\n power_timer2_disable();\n power_twi_disable();\n\n \/*** Enable needed Peripherals ***\/ \/\/ May actually disable these too, and re-enable them later.\n power_usart0_enable();\n power_spi_enable();\n\n return;\n}\n<commit_msg>Update powerSleep.cpp<commit_after>#include \"powerSleep.h\"\n\n#include <avr\/sleep.h>\n#include <avr\/power.h>\n#include \"state.h\"\n\nvoid enterSleep(State_t* State)\n{\n \/*** Setup Sleep options ***\/\n \n set_sleep_mode(SLEEP_MODE_PWR_DOWN); \/\/ Lowest powerdown mode\n sleep_enable(); \/\/ Enable sleep\n\n \/*** Put processor to sleep ***\/\n\n sleep_mode();\n\n \/*** Continue ***\/\n \n sleep_disable();\n\n \/*** Re-enable necessary peripherals ***\/\n if(State->serialOn)\n {\n power_usart0_enable();\n }\n power_spi_enable();\n\n return;\n}\nvoid disableUnneededPeripherals()\n{\n \/*** Disable Uneeded Peripherals ***\/\n ADCSRA = 0; \/\/ Disable ADC\n power_adc_disable();\n power_timer0_disable();\n power_timer1_disable();\n power_timer2_disable();\n power_twi_disable();\n power_usart0_disable();\n\n \/*** Enable needed Peripherals ***\/ \/\/ May actually disable this too, and re-enable them later.\n power_spi_enable();\n\n return;\n}\n<|endoftext|>"} {"text":"<commit_before>\/*****************************************************************************\n * controller.hpp : Controller for the main interface\n ****************************************************************************\n * Copyright (C) 2006-2008 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\n * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston MA 02110-1301, USA.\n *****************************************************************************\/\n\n#ifndef QVLC_CONTROLLER_H_\n#define QVLC_CONTROLLER_H_\n\n#ifdef HAVE_CONFIG_H\n# include \"config.h\"\n#endif\n\n#include \"qt4.hpp\"\n\n#include <QFrame>\n#include <QString>\n#include <QSizeGrip>\n\n#define MAIN_TB1_DEFAULT \"64;39;64;38;65\"\n#define MAIN_TB2_DEFAULT \"0-2;64;3;1;4;64;7;9;64;10;20;19;64-4;37;65;35-4\"\n#define ADV_TB_DEFAULT \"12;11;13;14\"\n#define INPT_TB_DEFAULT \"43;33-4;44\"\n#define FSC_TB_DEFAULT \"0-2;64;3;1;4;64;37;64;38;64;8;65;25;35-4;34\"\n\n#define I_PLAY_TOOLTIP N_(\"Play\\nIf the playlist is empty, open a medium\")\n\nclass QPixmap;\nclass QLabel;\n\nclass QGridLayout;\nclass QBoxLayout;\nclass QHBoxLayout;\nclass QVBoxLayout;\n\nclass QAbstractSlider;\nclass QAbstractButton;\nclass SeekSlider;\nclass QToolButton;\n\nclass VolumeClickHandler;\nclass WidgetListing;\n\nclass QSignalMapper;\nclass QTimer;\n\ntypedef enum buttonType_e\n{\n PLAY_BUTTON,\n STOP_BUTTON,\n OPEN_BUTTON,\n PREV_SLOW_BUTTON,\n NEXT_FAST_BUTTON,\n SLOWER_BUTTON,\n FASTER_BUTTON,\n FULLSCREEN_BUTTON,\n DEFULLSCREEN_BUTTON,\n EXTENDED_BUTTON,\n PLAYLIST_BUTTON,\n SNAPSHOT_BUTTON,\n RECORD_BUTTON,\n ATOB_BUTTON,\n FRAME_BUTTON,\n REVERSE_BUTTON,\n SKIP_BACK_BUTTON,\n SKIP_FW_BUTTON,\n QUIT_BUTTON,\n RANDOM_BUTTON,\n LOOP_BUTTON,\n INFO_BUTTON,\n PREVIOUS_BUTTON,\n NEXT_BUTTON,\n OPEN_SUB_BUTTON,\n FULLWIDTH_BUTTON,\n BUTTON_MAX,\n\n SPLITTER = 0x20,\n INPUT_SLIDER,\n TIME_LABEL,\n VOLUME,\n VOLUME_SPECIAL,\n MENU_BUTTONS,\n TELETEXT_BUTTONS,\n ADVANCED_CONTROLLER,\n PLAYBACK_BUTTONS,\n ASPECT_RATIO_COMBOBOX,\n SPEED_LABEL,\n TIME_LABEL_ELAPSED,\n TIME_LABEL_REMAINING,\n SPECIAL_MAX,\n\n WIDGET_SPACER = 0x40,\n WIDGET_SPACER_EXTEND,\n WIDGET_MAX,\n} buttonType_e;\n\n\nstatic const char* const nameL[BUTTON_MAX] = { N_(\"Play\"), N_(\"Stop\"), N_(\"Open\"),\n N_(\"Previous \/ Backward\"), N_(\"Next \/ Forward\"), N_(\"Slower\"), N_(\"Faster\"), N_(\"Fullscreen\"),\n N_(\"De-Fullscreen\"), N_(\"Extended panel\"), N_(\"Playlist\"), N_(\"Snapshot\"),\n N_(\"Record\"), N_(\"A->B Loop\"), N_(\"Frame By Frame\"), N_(\"Trickplay Reverse\"),\n N_(\"Step backward\" ), N_(\"Step forward\"), N_(\"Quit\"), N_(\"Random\"),\n N_(\"Loop \/ Repeat\"), N_(\"Information\"), N_(\"Previous\"), N_(\"Next\"),\n N_(\"Open subtitles\"), N_(\"Dock fullscreen controller\")\n};\nstatic const char* const tooltipL[BUTTON_MAX] = { I_PLAY_TOOLTIP,\n N_(\"Stop playback\"), N_(\"Open a medium\"),\n N_(\"Previous media in the playlist, skip backward when keep-pressed\"),\n N_(\"Next media in the playlist, skip forward when keep-pressed\"), N_(\"Slower\"), N_(\"Faster\"),\n N_(\"Toggle the video in fullscreen\"), N_(\"Toggle the video out fullscreen\"),\n N_(\"Show extended settings\" ), N_( \"Toggle playlist\" ),\n N_( \"Take a snapshot\" ), N_( \"Record\" ),\n N_( \"Loop from point A to point B continuously.\" ), N_(\"Frame by frame\"),\n N_(\"Reverse\"), N_(\"Step backward\"), N_(\"Step forward\"), N_(\"Quit\"),\n N_(\"Random\"), N_(\"Change the loop and repeat modes\"), N_(\"Information\"),\n N_(\"Previous media in the playlist\"), N_(\"Next media in the playlist\"),\n N_(\"Open subtitles file\"),\n N_(\"Dock\/undock fullscreen controller to\/from bottom of screen\")\n};\nstatic const QString iconL[BUTTON_MAX] ={ \":\/toolbar\/play_b\", \":\/toolbar\/stop_b\",\n \":\/toolbar\/eject\", \":\/toolbar\/previous_b\", \":\/toolbar\/next_b\",\n \":\/toolbar\/slower\", \":\/toolbar\/faster\", \":\/toolbar\/fullscreen\",\n \":\/toolbar\/defullscreen\", \":\/toolbar\/extended\", \":\/toolbar\/playlist\",\n \":\/toolbar\/snapshot\", \":\/toolbar\/record\", \":\/toolbar\/atob_nob\",\n \":\/toolbar\/frame\", \":\/toolbar\/reverse\", \":\/toolbar\/skip_back\",\n \":\/toolbar\/skip_fw\", \":\/toolbar\/clear\", \":\/buttons\/playlist\/shuffle_on\",\n \":\/buttons\/playlist\/repeat_all\", \":\/menu\/info\",\n \":\/toolbar\/previous_b\", \":\/toolbar\/next_b\", \":\/toolbar\/eject\", \":\/toolbar\/space\"\n};\n\nenum\n{\n WIDGET_NORMAL = 0x0,\n WIDGET_FLAT = 0x1,\n WIDGET_BIG = 0x2,\n WIDGET_SHINY = 0x4,\n};\n\nclass AdvControlsWidget;\nclass AbstractController : public QFrame\n{\n friend class WidgetListing; \/* For ToolBar Edition HACKS *\/\n\n Q_OBJECT\npublic:\n AbstractController( intf_thread_t *_p_i, QWidget *_parent = 0 );\n\nprotected:\n intf_thread_t *p_intf;\n\n QSignalMapper *toolbarActionsMapper;\n QBoxLayout *controlLayout;\n \/* Change to BoxLayout if both dir are needed *\/\n\n AdvControlsWidget *advControls;\n\n void parseAndCreate( const QString& config, QBoxLayout *controlLayout );\n\n virtual void createAndAddWidget( QBoxLayout *controlLayout, int i_index,\n buttonType_e i_type, int i_option );\n\n QWidget *createWidget( buttonType_e, int options = WIDGET_NORMAL );\nprivate:\n static void setupButton( QAbstractButton * );\n QFrame *discFrame();\n QFrame *telexFrame();\n void applyAttributes( QToolButton *, bool b_flat, bool b_big );\n\n QHBoxLayout *buttonGroupLayout;\nprotected slots:\n virtual void setStatus( int );\n\nsignals:\n void inputExists( bool ); \/\/\/ This might be useful in the IM ?\n void inputPlaying( bool ); \/\/\/ This might be useful in the IM ?\n void inputIsRecordable( bool ); \/\/\/ same ?\n void inputIsTrickPlayable( bool ); \/\/\/ same ?\n};\n\n\/* Advanced Button Bar *\/\nclass AdvControlsWidget : public AbstractController\n{\n Q_OBJECT\npublic:\n AdvControlsWidget( intf_thread_t *, QWidget *_parent = 0 );\n};\n\n\/* Slider Bar *\/\nclass InputControlsWidget : public AbstractController\n{\n Q_OBJECT\npublic:\n InputControlsWidget( intf_thread_t * , QWidget *_parent = 0 );\n};\n\n\/* Button Bar *\/\nclass ControlsWidget : public AbstractController\n{\n Q_OBJECT\npublic:\n \/* p_intf, advanced control visible or not, blingbling or not *\/\n ControlsWidget( intf_thread_t *_p_i, bool b_advControls,\n QWidget *_parent = 0 );\n\n void setGripVisible( bool b_visible )\n { grip->setVisible( b_visible ); }\n\nprotected:\n friend class MainInterface;\n\n bool b_advancedVisible;\n\nprivate:\n QSizeGrip *grip;\n\nprotected slots:\n void toggleAdvanced();\n\nsignals:\n void advancedControlsToggled( bool );\n};\n\n\n\/* to trying transparency with fullscreen controller on windows enable that *\/\n\/* it can be enabled on-non windows systems,\n but it will be transparent only with composite manager *\/\n#define HAVE_TRANSPARENCY 1\n\n\/* Default value of opacity for FS controller *\/\n#define DEFAULT_OPACITY 0.70\n\n\/* Used to restore the minimum width after a full-width switch *\/\n#define FSC_WIDTH 800\n\n#define FSC_HEIGHT 72\n\n\/***********************************\n * Fullscreen controller\n ***********************************\/\nclass FullscreenControllerWidget : public AbstractController\n{\n Q_OBJECT\npublic:\n FullscreenControllerWidget( intf_thread_t *, QWidget *_parent = 0 );\n virtual ~FullscreenControllerWidget();\n\n \/* Vout *\/\n void fullscreenChanged( vout_thread_t *, bool b_fs, int i_timeout );\n void mouseChanged( vout_thread_t *, int i_mousex, int i_mousey );\n void toggleFullwidth();\n void updateFullwidthGeometry( int number );\n int targetScreen();\n\nsignals:\n void keyPressed( QKeyEvent * );\n\npublic slots:\n void setVoutList( vout_thread_t **, int );\n\nprotected:\n friend class MainInterface;\n\n virtual void mouseMoveEvent( QMouseEvent *event );\n virtual void mousePressEvent( QMouseEvent *event );\n virtual void mouseReleaseEvent( QMouseEvent *event );\n virtual void enterEvent( QEvent *event );\n virtual void leaveEvent( QEvent *event );\n virtual void keyPressEvent( QKeyEvent *event );\n\n virtual void customEvent( QEvent *event );\n\nprivate slots:\n void showFSC();\n void planHideFSC();\n void hideFSC() { hide(); }\n void slowHideFSC();\n void restoreFSC();\n void centerFSC( int );\n\nprivate:\n QTimer *p_hideTimer;\n#if HAVE_TRANSPARENCY\n QTimer *p_slowHideTimer;\n bool b_slow_hide_begin;\n int i_slow_hide_timeout;\n float f_opacity;\n#endif\n\n int i_mouse_last_x, i_mouse_last_y;\n bool b_mouse_over;\n int i_screennumber;\n QRect screenRes;\n QRect previousScreenRes;\n QPoint previousPosition;\n\n \/* List of vouts currently tracked *\/\n QList<vout_thread_t *> vout;\n\n \/* Shared variable between FSC and VLC (protected by a lock) *\/\n vlc_mutex_t lock;\n bool b_fullscreen;\n int i_hide_timeout; \/* FSC hiding timeout, same as mouse hiding timeout *\/\n int i_mouse_last_move_x;\n int i_mouse_last_move_y;\n\n bool isWideFSC;\n};\n\n#endif\n<commit_msg>Qt4: replace awkward word 'keep-pressed'<commit_after>\/*****************************************************************************\n * controller.hpp : Controller for the main interface\n ****************************************************************************\n * Copyright (C) 2006-2008 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\n * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston MA 02110-1301, USA.\n *****************************************************************************\/\n\n#ifndef QVLC_CONTROLLER_H_\n#define QVLC_CONTROLLER_H_\n\n#ifdef HAVE_CONFIG_H\n# include \"config.h\"\n#endif\n\n#include \"qt4.hpp\"\n\n#include <QFrame>\n#include <QString>\n#include <QSizeGrip>\n\n#define MAIN_TB1_DEFAULT \"64;39;64;38;65\"\n#define MAIN_TB2_DEFAULT \"0-2;64;3;1;4;64;7;9;64;10;20;19;64-4;37;65;35-4\"\n#define ADV_TB_DEFAULT \"12;11;13;14\"\n#define INPT_TB_DEFAULT \"43;33-4;44\"\n#define FSC_TB_DEFAULT \"0-2;64;3;1;4;64;37;64;38;64;8;65;25;35-4;34\"\n\n#define I_PLAY_TOOLTIP N_(\"Play\\nIf the playlist is empty, open a medium\")\n\nclass QPixmap;\nclass QLabel;\n\nclass QGridLayout;\nclass QBoxLayout;\nclass QHBoxLayout;\nclass QVBoxLayout;\n\nclass QAbstractSlider;\nclass QAbstractButton;\nclass SeekSlider;\nclass QToolButton;\n\nclass VolumeClickHandler;\nclass WidgetListing;\n\nclass QSignalMapper;\nclass QTimer;\n\ntypedef enum buttonType_e\n{\n PLAY_BUTTON,\n STOP_BUTTON,\n OPEN_BUTTON,\n PREV_SLOW_BUTTON,\n NEXT_FAST_BUTTON,\n SLOWER_BUTTON,\n FASTER_BUTTON,\n FULLSCREEN_BUTTON,\n DEFULLSCREEN_BUTTON,\n EXTENDED_BUTTON,\n PLAYLIST_BUTTON,\n SNAPSHOT_BUTTON,\n RECORD_BUTTON,\n ATOB_BUTTON,\n FRAME_BUTTON,\n REVERSE_BUTTON,\n SKIP_BACK_BUTTON,\n SKIP_FW_BUTTON,\n QUIT_BUTTON,\n RANDOM_BUTTON,\n LOOP_BUTTON,\n INFO_BUTTON,\n PREVIOUS_BUTTON,\n NEXT_BUTTON,\n OPEN_SUB_BUTTON,\n FULLWIDTH_BUTTON,\n BUTTON_MAX,\n\n SPLITTER = 0x20,\n INPUT_SLIDER,\n TIME_LABEL,\n VOLUME,\n VOLUME_SPECIAL,\n MENU_BUTTONS,\n TELETEXT_BUTTONS,\n ADVANCED_CONTROLLER,\n PLAYBACK_BUTTONS,\n ASPECT_RATIO_COMBOBOX,\n SPEED_LABEL,\n TIME_LABEL_ELAPSED,\n TIME_LABEL_REMAINING,\n SPECIAL_MAX,\n\n WIDGET_SPACER = 0x40,\n WIDGET_SPACER_EXTEND,\n WIDGET_MAX,\n} buttonType_e;\n\n\nstatic const char* const nameL[BUTTON_MAX] = { N_(\"Play\"), N_(\"Stop\"), N_(\"Open\"),\n N_(\"Previous \/ Backward\"), N_(\"Next \/ Forward\"), N_(\"Slower\"), N_(\"Faster\"), N_(\"Fullscreen\"),\n N_(\"De-Fullscreen\"), N_(\"Extended panel\"), N_(\"Playlist\"), N_(\"Snapshot\"),\n N_(\"Record\"), N_(\"A->B Loop\"), N_(\"Frame By Frame\"), N_(\"Trickplay Reverse\"),\n N_(\"Step backward\" ), N_(\"Step forward\"), N_(\"Quit\"), N_(\"Random\"),\n N_(\"Loop \/ Repeat\"), N_(\"Information\"), N_(\"Previous\"), N_(\"Next\"),\n N_(\"Open subtitles\"), N_(\"Dock fullscreen controller\")\n};\nstatic const char* const tooltipL[BUTTON_MAX] = { I_PLAY_TOOLTIP,\n N_(\"Stop playback\"), N_(\"Open a medium\"),\n N_(\"Previous media in the playlist, skip backward when held\"),\n N_(\"Next media in the playlist, skip forward when held\"), N_(\"Slower\"), N_(\"Faster\"),\n N_(\"Toggle the video in fullscreen\"), N_(\"Toggle the video out fullscreen\"),\n N_(\"Show extended settings\" ), N_( \"Toggle playlist\" ),\n N_( \"Take a snapshot\" ), N_( \"Record\" ),\n N_( \"Loop from point A to point B continuously.\" ), N_(\"Frame by frame\"),\n N_(\"Reverse\"), N_(\"Step backward\"), N_(\"Step forward\"), N_(\"Quit\"),\n N_(\"Random\"), N_(\"Change the loop and repeat modes\"), N_(\"Information\"),\n N_(\"Previous media in the playlist\"), N_(\"Next media in the playlist\"),\n N_(\"Open subtitles file\"),\n N_(\"Dock\/undock fullscreen controller to\/from bottom of screen\")\n};\nstatic const QString iconL[BUTTON_MAX] ={ \":\/toolbar\/play_b\", \":\/toolbar\/stop_b\",\n \":\/toolbar\/eject\", \":\/toolbar\/previous_b\", \":\/toolbar\/next_b\",\n \":\/toolbar\/slower\", \":\/toolbar\/faster\", \":\/toolbar\/fullscreen\",\n \":\/toolbar\/defullscreen\", \":\/toolbar\/extended\", \":\/toolbar\/playlist\",\n \":\/toolbar\/snapshot\", \":\/toolbar\/record\", \":\/toolbar\/atob_nob\",\n \":\/toolbar\/frame\", \":\/toolbar\/reverse\", \":\/toolbar\/skip_back\",\n \":\/toolbar\/skip_fw\", \":\/toolbar\/clear\", \":\/buttons\/playlist\/shuffle_on\",\n \":\/buttons\/playlist\/repeat_all\", \":\/menu\/info\",\n \":\/toolbar\/previous_b\", \":\/toolbar\/next_b\", \":\/toolbar\/eject\", \":\/toolbar\/space\"\n};\n\nenum\n{\n WIDGET_NORMAL = 0x0,\n WIDGET_FLAT = 0x1,\n WIDGET_BIG = 0x2,\n WIDGET_SHINY = 0x4,\n};\n\nclass AdvControlsWidget;\nclass AbstractController : public QFrame\n{\n friend class WidgetListing; \/* For ToolBar Edition HACKS *\/\n\n Q_OBJECT\npublic:\n AbstractController( intf_thread_t *_p_i, QWidget *_parent = 0 );\n\nprotected:\n intf_thread_t *p_intf;\n\n QSignalMapper *toolbarActionsMapper;\n QBoxLayout *controlLayout;\n \/* Change to BoxLayout if both dir are needed *\/\n\n AdvControlsWidget *advControls;\n\n void parseAndCreate( const QString& config, QBoxLayout *controlLayout );\n\n virtual void createAndAddWidget( QBoxLayout *controlLayout, int i_index,\n buttonType_e i_type, int i_option );\n\n QWidget *createWidget( buttonType_e, int options = WIDGET_NORMAL );\nprivate:\n static void setupButton( QAbstractButton * );\n QFrame *discFrame();\n QFrame *telexFrame();\n void applyAttributes( QToolButton *, bool b_flat, bool b_big );\n\n QHBoxLayout *buttonGroupLayout;\nprotected slots:\n virtual void setStatus( int );\n\nsignals:\n void inputExists( bool ); \/\/\/ This might be useful in the IM ?\n void inputPlaying( bool ); \/\/\/ This might be useful in the IM ?\n void inputIsRecordable( bool ); \/\/\/ same ?\n void inputIsTrickPlayable( bool ); \/\/\/ same ?\n};\n\n\/* Advanced Button Bar *\/\nclass AdvControlsWidget : public AbstractController\n{\n Q_OBJECT\npublic:\n AdvControlsWidget( intf_thread_t *, QWidget *_parent = 0 );\n};\n\n\/* Slider Bar *\/\nclass InputControlsWidget : public AbstractController\n{\n Q_OBJECT\npublic:\n InputControlsWidget( intf_thread_t * , QWidget *_parent = 0 );\n};\n\n\/* Button Bar *\/\nclass ControlsWidget : public AbstractController\n{\n Q_OBJECT\npublic:\n \/* p_intf, advanced control visible or not, blingbling or not *\/\n ControlsWidget( intf_thread_t *_p_i, bool b_advControls,\n QWidget *_parent = 0 );\n\n void setGripVisible( bool b_visible )\n { grip->setVisible( b_visible ); }\n\nprotected:\n friend class MainInterface;\n\n bool b_advancedVisible;\n\nprivate:\n QSizeGrip *grip;\n\nprotected slots:\n void toggleAdvanced();\n\nsignals:\n void advancedControlsToggled( bool );\n};\n\n\n\/* to trying transparency with fullscreen controller on windows enable that *\/\n\/* it can be enabled on-non windows systems,\n but it will be transparent only with composite manager *\/\n#define HAVE_TRANSPARENCY 1\n\n\/* Default value of opacity for FS controller *\/\n#define DEFAULT_OPACITY 0.70\n\n\/* Used to restore the minimum width after a full-width switch *\/\n#define FSC_WIDTH 800\n\n#define FSC_HEIGHT 72\n\n\/***********************************\n * Fullscreen controller\n ***********************************\/\nclass FullscreenControllerWidget : public AbstractController\n{\n Q_OBJECT\npublic:\n FullscreenControllerWidget( intf_thread_t *, QWidget *_parent = 0 );\n virtual ~FullscreenControllerWidget();\n\n \/* Vout *\/\n void fullscreenChanged( vout_thread_t *, bool b_fs, int i_timeout );\n void mouseChanged( vout_thread_t *, int i_mousex, int i_mousey );\n void toggleFullwidth();\n void updateFullwidthGeometry( int number );\n int targetScreen();\n\nsignals:\n void keyPressed( QKeyEvent * );\n\npublic slots:\n void setVoutList( vout_thread_t **, int );\n\nprotected:\n friend class MainInterface;\n\n virtual void mouseMoveEvent( QMouseEvent *event );\n virtual void mousePressEvent( QMouseEvent *event );\n virtual void mouseReleaseEvent( QMouseEvent *event );\n virtual void enterEvent( QEvent *event );\n virtual void leaveEvent( QEvent *event );\n virtual void keyPressEvent( QKeyEvent *event );\n\n virtual void customEvent( QEvent *event );\n\nprivate slots:\n void showFSC();\n void planHideFSC();\n void hideFSC() { hide(); }\n void slowHideFSC();\n void restoreFSC();\n void centerFSC( int );\n\nprivate:\n QTimer *p_hideTimer;\n#if HAVE_TRANSPARENCY\n QTimer *p_slowHideTimer;\n bool b_slow_hide_begin;\n int i_slow_hide_timeout;\n float f_opacity;\n#endif\n\n int i_mouse_last_x, i_mouse_last_y;\n bool b_mouse_over;\n int i_screennumber;\n QRect screenRes;\n QRect previousScreenRes;\n QPoint previousPosition;\n\n \/* List of vouts currently tracked *\/\n QList<vout_thread_t *> vout;\n\n \/* Shared variable between FSC and VLC (protected by a lock) *\/\n vlc_mutex_t lock;\n bool b_fullscreen;\n int i_hide_timeout; \/* FSC hiding timeout, same as mouse hiding timeout *\/\n int i_mouse_last_move_x;\n int i_mouse_last_move_y;\n\n bool isWideFSC;\n};\n\n#endif\n<|endoftext|>"} {"text":"<commit_before>\/******************************************************************************\n * Copyright 2019 The Apollo Authors. All Rights Reserved.\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n *****************************************************************************\/\n\n#include \"modules\/prediction\/common\/semantic_map.h\"\n\n#include <string>\n#include <vector>\n\n#include \"cyber\/common\/file.h\"\n#include \"cyber\/common\/log.h\"\n#include \"modules\/common\/configs\/config_gflags.h\"\n#include \"modules\/common\/util\/string_util.h\"\n#include \"modules\/prediction\/container\/container_manager.h\"\n#include \"modules\/prediction\/container\/pose\/pose_container.h\"\n\nnamespace apollo {\nnamespace prediction {\n\nSemanticMap::SemanticMap() {}\n\nvoid SemanticMap::Init() {\n const std::string file_path =\n apollo::common::util::StrCat(FLAGS_map_dir, \"\/base_map.png\");\n if (cyber::common::PathExists(file_path)) {\n base_img_ = cv::imread(file_path, CV_LOAD_IMAGE_COLOR);\n }\n curr_img_ = cv::Mat(2000, 2000, CV_8UC3, cv::Scalar(0, 0, 0));\n}\n\nvoid SemanticMap::RunCurrFrame(const FrameEnv& curr_frame_env) {\n \/\/ TODO(Hongyi): moving all these magic numbers to conf\n curr_timestamp_ = curr_frame_env.timestamp();\n curr_base_x_ = curr_frame_env.ego_history().feature(0).position().x() - 100.0;\n curr_base_y_ = curr_frame_env.ego_history().feature(0).position().y() - 100.0;\n cv::Rect rect(static_cast<int>((curr_base_x_ - 585950.0) \/ 0.1),\n static_cast<int>(18000 - (curr_base_y_ - 4140000.0) \/ 0.1) - 2000,\n 2000, 2000);\n base_img_(rect).copyTo(curr_img_);\n\n \/\/ Draw ego_vehicle_history\n DrawHistory(curr_frame_env.ego_history(), cv::Scalar(0, 255, 255));\n\n \/\/ Draw obstacles_history\n for (auto& history : curr_frame_env.obstacles_history()) {\n DrawHistory(history);\n }\n\n \/\/ For disaplay\n cv::namedWindow(\"Display window\", cv::WINDOW_NORMAL);\n cv::imshow(\"Display window\", curr_img_);\n cv::waitKey();\n}\n\nvoid SemanticMap::DrawRect(const Feature& feature, const cv::Scalar& color) {\n double obs_l = feature.length();\n double obs_w = feature.width();\n double obs_x = feature.position().x();\n double obs_y = feature.position().y();\n double theta = feature.theta();\n std::vector<cv::Point> polygon;\n \/\/ point 1 (head-right point)\n polygon.push_back(\n GetTransPoint(obs_x + (cos(theta) * obs_l - sin(theta) * obs_w) \/ 2,\n obs_y + (sin(theta) * obs_l + cos(theta) * obs_w) \/ 2));\n \/\/ point 2 (head-left point)\n polygon.push_back(\n GetTransPoint(obs_x + (cos(theta) * -obs_l - sin(theta) * obs_w) \/ 2,\n obs_y + (sin(theta) * -obs_l + cos(theta) * obs_w) \/ 2));\n \/\/ point 3 (head-left point)\n polygon.push_back(\n GetTransPoint(obs_x + (cos(theta) * -obs_l - sin(theta) * -obs_w) \/ 2,\n obs_y + (sin(theta) * -obs_l + cos(theta) * -obs_w) \/ 2));\n \/\/ point 4 (head-left point)\n polygon.push_back(\n GetTransPoint(obs_x + (cos(theta) * obs_l - sin(theta) * -obs_w) \/ 2,\n obs_y + (sin(theta) * obs_l + cos(theta) * -obs_w) \/ 2));\n cv::fillPoly(curr_img_, std::vector<std::vector<cv::Point>>({polygon}),\n color);\n}\n\nvoid SemanticMap::DrawPoly(const Feature& feature, const cv::Scalar& color) {\n std::vector<cv::Point> polygon;\n for (auto& polygon_point : feature.polygon_point()) {\n polygon.push_back(GetTransPoint(polygon_point.x(), polygon_point.y()));\n }\n cv::fillPoly(curr_img_, std::vector<std::vector<cv::Point>>({polygon}),\n color);\n}\n\nvoid SemanticMap::DrawHistory(const ObstacleHistory& history,\n const cv::Scalar& color) {\n for (int i = history.feature_size() - 1; i >= 0; --i) {\n const Feature& feature = history.feature(i);\n double time_decay = 1.0 - curr_timestamp_ + feature.timestamp();\n cv::Scalar decay_color = color * time_decay;\n if (feature.id() == -1) {\n DrawRect(feature, decay_color);\n } else {\n DrawPoly(feature, decay_color);\n }\n }\n}\n\n} \/\/ namespace prediction\n} \/\/ namespace apollo\n<commit_msg>Update semantic_map.cc<commit_after>\/******************************************************************************\n * Copyright 2019 The Apollo Authors. All Rights Reserved.\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n *****************************************************************************\/\n\n#include \"modules\/prediction\/common\/semantic_map.h\"\n\n#include <string>\n#include <vector>\n\n#include \"cyber\/common\/file.h\"\n#include \"cyber\/common\/log.h\"\n#include \"modules\/common\/configs\/config_gflags.h\"\n#include \"modules\/common\/util\/string_util.h\"\n#include \"modules\/prediction\/container\/container_manager.h\"\n#include \"modules\/prediction\/container\/pose\/pose_container.h\"\n\nnamespace apollo {\nnamespace prediction {\n\nSemanticMap::SemanticMap() {}\n\nvoid SemanticMap::Init() {\n const std::string file_path =\n apollo::common::util::StrCat(FLAGS_map_dir, \"\/base_map.png\");\n if (cyber::common::PathExists(file_path)) {\n base_img_ = cv::imread(file_path, CV_LOAD_IMAGE_COLOR);\n }\n curr_img_ = cv::Mat(2000, 2000, CV_8UC3, cv::Scalar(0, 0, 0));\n}\n\nvoid SemanticMap::RunCurrFrame(const FrameEnv& curr_frame_env) {\n \/\/ TODO(Hongyi): moving all these magic numbers to conf\n curr_timestamp_ = curr_frame_env.timestamp();\n curr_base_x_ = curr_frame_env.ego_history().feature(0).position().x() - 100.0;\n curr_base_y_ = curr_frame_env.ego_history().feature(0).position().y() - 100.0;\n cv::Rect rect(static_cast<int>((curr_base_x_ - 585950.0) \/ 0.1),\n static_cast<int>(18000 - (curr_base_y_ - 4140000.0) \/ 0.1) - 2000,\n 2000, 2000);\n base_img_(rect).copyTo(curr_img_);\n\n \/\/ Draw ego_vehicle_history\n DrawHistory(curr_frame_env.ego_history(), cv::Scalar(0, 255, 255));\n\n \/\/ Draw obstacles_history\n for (auto& history : curr_frame_env.obstacles_history()) {\n DrawHistory(history);\n }\n\n \/\/ For disaplay\n cv::namedWindow(\"Display window\", cv::WINDOW_NORMAL);\n cv::imshow(\"Display window\", curr_img_);\n cv::waitKey();\n}\n\nvoid SemanticMap::DrawRect(const Feature& feature, const cv::Scalar& color) {\n double obs_l = feature.length();\n double obs_w = feature.width();\n double obs_x = feature.position().x();\n double obs_y = feature.position().y();\n double theta = feature.theta();\n std::vector<cv::Point> polygon;\n \/\/ point 1 (head-right point)\n polygon.push_back(\n GetTransPoint(obs_x + (cos(theta) * obs_l - sin(theta) * obs_w) \/ 2,\n obs_y + (sin(theta) * obs_l + cos(theta) * obs_w) \/ 2));\n \/\/ point 2 (head-left point)\n polygon.push_back(\n GetTransPoint(obs_x + (cos(theta) * -obs_l - sin(theta) * obs_w) \/ 2,\n obs_y + (sin(theta) * -obs_l + cos(theta) * obs_w) \/ 2));\n \/\/ point 3 (back-left point)\n polygon.push_back(\n GetTransPoint(obs_x + (cos(theta) * -obs_l - sin(theta) * -obs_w) \/ 2,\n obs_y + (sin(theta) * -obs_l + cos(theta) * -obs_w) \/ 2));\n \/\/ point 4 (back-right point)\n polygon.push_back(\n GetTransPoint(obs_x + (cos(theta) * obs_l - sin(theta) * -obs_w) \/ 2,\n obs_y + (sin(theta) * obs_l + cos(theta) * -obs_w) \/ 2));\n cv::fillPoly(curr_img_, std::vector<std::vector<cv::Point>>({polygon}),\n color);\n}\n\nvoid SemanticMap::DrawPoly(const Feature& feature, const cv::Scalar& color) {\n std::vector<cv::Point> polygon;\n for (auto& polygon_point : feature.polygon_point()) {\n polygon.push_back(GetTransPoint(polygon_point.x(), polygon_point.y()));\n }\n cv::fillPoly(curr_img_, std::vector<std::vector<cv::Point>>({polygon}),\n color);\n}\n\nvoid SemanticMap::DrawHistory(const ObstacleHistory& history,\n const cv::Scalar& color) {\n for (int i = history.feature_size() - 1; i >= 0; --i) {\n const Feature& feature = history.feature(i);\n double time_decay = 1.0 - curr_timestamp_ + feature.timestamp();\n cv::Scalar decay_color = color * time_decay;\n if (feature.id() == -1) {\n DrawRect(feature, decay_color);\n } else {\n DrawPoly(feature, decay_color);\n }\n }\n}\n\n} \/\/ namespace prediction\n} \/\/ namespace apollo\n<|endoftext|>"} {"text":"<commit_before>\/****************** <SNX heading BEGIN do not edit this line> *****************\n *\n * sonix\n *\n * Original Authors:\n * Kevin Meinert, Carolina Cruz-Neira\n *\n ****************** <SNX heading END do not edit this line> ******************\/\n\n\/*************** <auto-copyright.pl BEGIN do not edit this line> **************\n *\n * VR Juggler is (C) Copyright 1998-2007 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 <snx\/snxConfig.h>\n\n#include <gmtl\/Math.h>\n#include <gmtl\/Vec.h>\n#include <gmtl\/MatrixOps.h>\n#include <gmtl\/VecOps.h>\n#include <gmtl\/Xforms.h>\n#include <vpr\/Util\/Assert.h>\n\n#include <snx\/SoundImplementation.h>\n\n\nnamespace snx\n{\n\nvoid SoundImplementation::copy( const SoundImplementation& si )\n{\n \/\/ copy over the current state\n mName = si.mName;\n mSounds = si.mSounds;\n mListenerPos = si.mListenerPos;\n mSoundAPIInfo = si.mSoundAPIInfo;\n}\n\nvoid SoundImplementation::configure( const std::string& alias, const snx::SoundInfo& description )\n{\n this->unbind( alias );\n snx::SoundInfo temp = mSounds[alias];\n mSounds[alias] = description; \/\/ TODO: put is_playing within the SoundInfo.\n\n \/\/ restore fields that should be preserved on a reconfigure...\n mSounds[alias].triggerOnNextBind = temp.triggerOnNextBind;\n \/\/std::cout<<\"DEBUG: triggerOnNextBind = \"<<mSounds[alias].triggerOnNextBind<<\"\\n\"<<std::flush;\n\n if (this->isStarted())\n {\n this->bind( alias );\n }\n}\n\nvoid SoundImplementation::remove(const std::string& alias)\n{\n if (this->isStarted())\n {\n this->unbind( alias );\n }\n mSounds.erase( alias );\n}\n\nvoid SoundImplementation::bindAll()\n{\n std::map< std::string, snx::SoundInfo >::iterator it;\n for( it = mSounds.begin(); it != mSounds.end(); ++it)\n {\n \/\/std::cout<<\"DEBUG: loading alias: \"<<(*it).first<<\"\\n\"<<std::flush;\n this->bind( (*it).first );\n }\n} \n\nvoid SoundImplementation::unbindAll()\n{\n std::map< std::string, snx::SoundInfo >::iterator it;\n for( it = mSounds.begin(); it != mSounds.end(); ++it)\n {\n \/\/std::cout<<\"DEBUG: loading alias: \"<<(*it).first<<\"\\n\"<<std::flush;\n this->unbind( (*it).first );\n }\n \/*\n std::map< std::string, AlSoundInfo >::iterator it;\n for( it = mBindLookup.begin(); it != mBindLookup.end(); ++it)\n {\n this->unbind( (*it).first );\n }\n\n vprASSERT(mBindLookup.size() == 0 && \"unbindAll failed\");\n *\/\n}\n\n} \/\/ End of snx namespace\n<commit_msg>Removed commented out code that has no obvious value.<commit_after>\/****************** <SNX heading BEGIN do not edit this line> *****************\n *\n * sonix\n *\n * Original Authors:\n * Kevin Meinert, Carolina Cruz-Neira\n *\n ****************** <SNX heading END do not edit this line> ******************\/\n\n\/*************** <auto-copyright.pl BEGIN do not edit this line> **************\n *\n * VR Juggler is (C) Copyright 1998-2007 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 <snx\/snxConfig.h>\n\n#include <gmtl\/Math.h>\n#include <gmtl\/Vec.h>\n#include <gmtl\/MatrixOps.h>\n#include <gmtl\/VecOps.h>\n#include <gmtl\/Xforms.h>\n#include <vpr\/Util\/Assert.h>\n\n#include <snx\/SoundImplementation.h>\n\n\nnamespace snx\n{\n\nvoid SoundImplementation::copy( const SoundImplementation& si )\n{\n \/\/ copy over the current state\n mName = si.mName;\n mSounds = si.mSounds;\n mListenerPos = si.mListenerPos;\n mSoundAPIInfo = si.mSoundAPIInfo;\n}\n\nvoid SoundImplementation::configure( const std::string& alias, const snx::SoundInfo& description )\n{\n this->unbind( alias );\n snx::SoundInfo temp = mSounds[alias];\n mSounds[alias] = description; \/\/ TODO: put is_playing within the SoundInfo.\n\n \/\/ restore fields that should be preserved on a reconfigure...\n mSounds[alias].triggerOnNextBind = temp.triggerOnNextBind;\n \/\/std::cout<<\"DEBUG: triggerOnNextBind = \"<<mSounds[alias].triggerOnNextBind<<\"\\n\"<<std::flush;\n\n if (this->isStarted())\n {\n this->bind( alias );\n }\n}\n\nvoid SoundImplementation::remove(const std::string& alias)\n{\n if (this->isStarted())\n {\n this->unbind( alias );\n }\n mSounds.erase( alias );\n}\n\nvoid SoundImplementation::bindAll()\n{\n std::map< std::string, snx::SoundInfo >::iterator it;\n for( it = mSounds.begin(); it != mSounds.end(); ++it)\n {\n \/\/std::cout<<\"DEBUG: loading alias: \"<<(*it).first<<\"\\n\"<<std::flush;\n this->bind( (*it).first );\n }\n} \n\nvoid SoundImplementation::unbindAll()\n{\n std::map< std::string, snx::SoundInfo >::iterator it;\n for( it = mSounds.begin(); it != mSounds.end(); ++it)\n {\n \/\/std::cout<<\"DEBUG: loading alias: \"<<(*it).first<<\"\\n\"<<std::flush;\n this->unbind( (*it).first );\n }\n}\n\n} \/\/ End of snx namespace\n<|endoftext|>"} {"text":"<commit_before>\/* ******************************************************************************\n *\n *\n * This program and the accompanying materials are made available under the\n * terms of the Apache License, Version 2.0 which is available at\n * https:\/\/www.apache.org\/licenses\/LICENSE-2.0.\n *\n * See the NOTICE file distributed with this work for additional\n * information regarding copyright ownership.\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 * SPDX-License-Identifier: Apache-2.0\n ******************************************************************************\/\n\n\/\/\n\/\/ @author Yurii Shyrma (iuriish@yahoo.com), created on 19.04.2018\n\/\/ @author raver119@gmail.com\n\/\/\n\n#include <ops\/declarable\/helpers\/activations.h>\n#include <helpers\/ShapeUtils.h>\n#include <numeric>\n#include <helpers\/ConstantTadHelper.h>\n#include <execution\/Threads.h>\n\nnamespace sd {\nnamespace ops {\nnamespace helpers {\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n template <typename T>\n void static _softMaxDerivForVector(sd::LaunchContext * context, const void *input, const Nd4jLong *inShapeInfo, void *output) {\n\n const T* inBuff = reinterpret_cast<const T *>(input);\n T* outBuff = reinterpret_cast<T *>(output);\n\n T max = -DataTypeUtils::max<T>();\n T sum = 0.;\n int length = shape::length(inShapeInfo);\n\n for (int i = 0; i < length; i++) {\n const Nd4jLong offset = shape::getIndexOffset(i, inShapeInfo);\n max = sd::math::nd4j_max<T>(max, inBuff[offset]);\n }\n\n for (int i = 0; i < length; i++) {\n const Nd4jLong offset = shape::getIndexOffset(i, inShapeInfo);\n outBuff[offset] = sd::math::nd4j_exp<T, T>(inBuff[offset] - max);\n sum += outBuff[offset];\n }\n\n for (int i = 0; i < length; i++) {\n const Nd4jLong offset = shape::getIndexOffset(i, inShapeInfo);\n outBuff[offset] \/= sum;\n outBuff[offset] *= (1.f - outBuff[offset]); \/\/ derivative\n }\n }\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n void softmaxDerivative(sd::LaunchContext * context, const NDArray& input, NDArray& output, const int dimension) {\n\n const int rank = input.rankOf();\n int temp;\n\n if(shape::isCommonVector(input.shapeInfo(), temp)) {\n\n BUILD_SINGLE_SELECTOR(input.dataType(), _softMaxDerivForVector, (context, input.buffer(), input.shapeInfo(), output.buffer()), FLOAT_TYPES);\n }\n else {\n auto maxAlongDim = const_cast<NDArray&>(input).reduceAlongDimension(reduce::Max, {dimension}, true);\n (input - maxAlongDim).applyTransform(transform::Exp, output); \/\/ output contains exponents temporarily\n auto sumAlongDim = output.reduceAlongDimension(reduce::Sum, {dimension}, true);\n output \/= sumAlongDim;\n output *= (1.f - output); \/\/ derivative\n }\n }\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n template <typename T>\n void logSoftMaxForVector_(void const* input, Nd4jLong const* inShapeInfo, void *output, Nd4jLong const* outShapeInfo) {\n auto inBuff = reinterpret_cast<T const*>(input);\n auto outBuff = reinterpret_cast<T *>(output);\n\n T max = -DataTypeUtils::max<T>();\n T sum = 0;\n\n auto inEWS = shape::elementWiseStride(inShapeInfo);\n auto length = shape::length(inShapeInfo);\n\n if (inEWS == 1) {\n for (Nd4jLong i = 0; i < length; i++)\n max = sd::math::nd4j_max<T>(max, inBuff[i]);\n\n PRAGMA_OMP_SIMD_SUM(sum)\n for (Nd4jLong i = 0; i < length; i++) {\n outBuff[i] = sd::math::nd4j_exp<T,T>(inBuff[i] - max);\n sum += outBuff[i];\n }\n\n PRAGMA_OMP_SIMD\n for (Nd4jLong i = 0; i < length; i++) {\n outBuff[i] \/= sum;\n outBuff[i] = sd::math::nd4j_log<T,T>(outBuff[i]);\n }\n }\n else if (inEWS > 1) {\n\n PRAGMA_OMP_SIMD_MAX(max)\n for (Nd4jLong i = 0; i < length; i++)\n max = sd::math::nd4j_max<T>(max, inBuff[i * inEWS]);\n\n PRAGMA_OMP_SIMD_SUM(sum)\n for (Nd4jLong i = 0; i < length; i++) {\n outBuff[i * inEWS] = sd::math::nd4j_exp<T,T>(inBuff[i * inEWS] - max);\n sum += outBuff[i * inEWS];\n }\n\n PRAGMA_OMP_SIMD\n for (Nd4jLong i = 0; i < length; i++) {\n outBuff[i * inEWS] \/= sum;\n outBuff[i * inEWS] = sd::math::nd4j_log<T, T>(outBuff[i * inEWS]);\n }\n }\n }\n\n \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n void logSoftMaxForVector(sd::LaunchContext* context, const NDArray& input, NDArray& output) {\n\n if(!input.isVector() || !output.isVector())\n throw std::runtime_error(\"ops::helpers::logSoftMaxForVector function input and output arrays must be vectors !\");\n\n auto xType = input.dataType();\n BUILD_SINGLE_SELECTOR(xType, logSoftMaxForVector_, (input.buffer(), input.shapeInfo(), output.buffer(), output.shapeInfo()), FLOAT_TYPES);\n }\n\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nvoid prelu(sd::LaunchContext * context, const NDArray& input, const NDArray& alpha, NDArray& output) {\n const Nd4jLong inputLen = input.lengthOf();\n const Nd4jLong* inputShapeInfo = input.shapeInfo();\n const Nd4jLong* alphaShapeInfo = alpha.shapeInfo();\n\n auto func = PRAGMA_THREADS_FOR {\n for (auto i = start; i < stop; i++) {\n \/\/ FIXME: double!\n double x = input.e<double>(i);\n if (x < 0.0) {\n \/\/ FIXME: double\n output.p(i, (x * alpha.e<double>(shape::subArrayIndex(i, inputShapeInfo, alphaShapeInfo))));\n } else\n output.p(i, x);\n }\n };\n\n samediff::Threads::parallel_for(func, 0, inputLen);\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nvoid preluBP(sd::LaunchContext * context, const NDArray& input, const NDArray& alpha, const NDArray& dLdO, NDArray& dLdI, NDArray& dLdA) {\n\n const Nd4jLong inputLen = input.lengthOf();\n const Nd4jLong* inputShapeInfo = input.shapeInfo();\n const Nd4jLong* alphaShapeInfo = alpha.shapeInfo();\n\n dLdA.assign(0.0f);\n\n for(Nd4jLong i = 0; i < inputLen; ++i) {\n \/\/ FIXME: double\n double x = input.e<double>(i);\n double grO = dLdO.e<double>(i);\n if(x < 0.0) {\n Nd4jLong alphaInd = shape::subArrayIndex(i, inputShapeInfo, alphaShapeInfo);\n dLdI.p(i, grO * alpha.e<double>(alphaInd));\n double prevVal = dLdA.e<double>(alphaInd);\n prevVal += (grO * x);\n dLdA.p(alphaInd, prevVal);\n }\n else\n dLdI.p(i, grO);\n }\n}\n\n\n bool checkAlphaShapeLen(std::vector<Nd4jLong> const& expectedShape, Nd4jLong shapeLen) {\n Nd4jLong expectedAlphaLen = std::accumulate(expectedShape.cbegin(), expectedShape.cend(), 1, std::multiplies<Nd4jLong>());\n return expectedAlphaLen == shapeLen;\n }\n template <typename T>\n static void thresholdRelu_(NDArray const& input, double threshold, NDArray& output) {\n auto routine = LAMBDA_T(_x, threshold) {\n return _x > (T)threshold? _x: (T)0.f;\n };\n const_cast<NDArray&>(input).applyLambda<T>(routine, output);\n }\n\n void thresholdRelu(sd::LaunchContext * context, NDArray const& input, double threshold, NDArray& output) {\n BUILD_SINGLE_SELECTOR(input.dataType(), thresholdRelu_, (input, threshold, output), FLOAT_TYPES);\n }\n\n template <typename T>\n static void thresholdReluDerivative_(sd::LaunchContext * context, NDArray* input, double theta, NDArray* dLdO, NDArray* output) {\n auto derivative = LAMBDA_TT(_x, grO, theta) {if (_x > theta) return grO; else return static_cast<T>(0); };\n\n input->applyPairwiseLambda<T>(*dLdO, derivative, *output);\n\n }\n\n void thresholdReluDerivative(sd::LaunchContext * context, NDArray* input, double threshold, NDArray* dLdO, NDArray* output) {\n BUILD_SINGLE_SELECTOR(input->dataType(), thresholdReluDerivative_, (context, input, threshold, dLdO, output), FLOAT_TYPES);\n }\n\n \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n void logSoftmax(sd::LaunchContext * context, const NDArray& input, NDArray& output, const int dimension) {\n\n const int rank = input.rankOf();\n\n if(input.isVector()) {\n\n if(rank == 1 || input.sizeAt(dimension) != 1) {\n BUILD_SINGLE_SELECTOR(input.dataType(), logSoftMaxForVector_, (input.buffer(), input.shapeInfo(), output.buffer(), output.shapeInfo()), FLOAT_TYPES);\n }\n else\n output = 0.;\n }\n else {\n\n auto maxAlongDim = const_cast<NDArray&>(input).reduceAlongDimension(reduce::Max, {dimension}, true);\n (input - maxAlongDim).applyTransform(transform::Exp, output); \/\/ output contains exponents temporarily\n auto sumAlongDim = output.reduceAlongDimension(reduce::Sum, {dimension}, true);\n output \/= sumAlongDim;\n output.applyTransform(transform::Log, output);\n }\n }\n\n BUILD_SINGLE_TEMPLATE(template void thresholdReluDerivative_, (sd::LaunchContext * context, NDArray* input, double threshold, NDArray* dLdO, NDArray* output), FLOAT_TYPES);\n BUILD_SINGLE_TEMPLATE(template void logSoftMaxForVector_, (void const* input, Nd4jLong const* inShapeInfo, void *output, Nd4jLong const* outShapeInfo), FLOAT_TYPES);\n BUILD_SINGLE_TEMPLATE(template void _softMaxDerivForVector, (sd::LaunchContext * context, const void *input, const Nd4jLong *inShapeInfo, void *output), FLOAT_TYPES);\n\n}\n}\n}\n\n<commit_msg>Update activations.cpp<commit_after>\/* ******************************************************************************\n *\n *\n * This program and the accompanying materials are made available under the\n * terms of the Apache License, Version 2.0 which is available at\n * https:\/\/www.apache.org\/licenses\/LICENSE-2.0.\n *\n * See the NOTICE file distributed with this work for additional\n * information regarding copyright ownership.\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 * SPDX-License-Identifier: Apache-2.0\n ******************************************************************************\/\n\n\/\/\n\/\/ @author Yurii Shyrma (iuriish@yahoo.com), created on 19.04.2018\n\/\/ @author raver119@gmail.com\n\/\/\n\n#include <ops\/declarable\/helpers\/activations.h>\n#include <helpers\/ShapeUtils.h>\n#include <numeric>\n#include <helpers\/ConstantTadHelper.h>\n#include <execution\/Threads.h>\n\nnamespace sd {\nnamespace ops {\nnamespace helpers {\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n template <typename T>\n void static _softMaxDerivForVector(sd::LaunchContext * context, const void *input, const Nd4jLong *inShapeInfo, void *output) {\n\n const T* inBuff = reinterpret_cast<const T *>(input);\n T* outBuff = reinterpret_cast<T *>(output);\n\n T max = -DataTypeUtils::max<T>();\n T sum = 0.;\n int length = shape::length(inShapeInfo);\n\n for (int i = 0; i < length; i++) {\n const Nd4jLong offset = shape::getIndexOffset(i, inShapeInfo);\n max = sd::math::nd4j_max<T>(max, inBuff[offset]);\n }\n\n for (int i = 0; i < length; i++) {\n const Nd4jLong offset = shape::getIndexOffset(i, inShapeInfo);\n outBuff[offset] = sd::math::nd4j_exp<T, T>(inBuff[offset] - max);\n sum += outBuff[offset];\n }\n\n for (int i = 0; i < length; i++) {\n const Nd4jLong offset = shape::getIndexOffset(i, inShapeInfo);\n outBuff[offset] \/= sum;\n outBuff[offset] *= (1.f - outBuff[offset]); \/\/ derivative\n }\n }\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n void softmaxDerivative(sd::LaunchContext * context, const NDArray& input, NDArray& output, const int dimension) {\n\n const int rank = input.rankOf();\n int temp;\n\n if(shape::isCommonVector(input.shapeInfo(), temp)) {\n\n BUILD_SINGLE_SELECTOR(input.dataType(), _softMaxDerivForVector, (context, input.buffer(), input.shapeInfo(), output.buffer()), FLOAT_TYPES);\n }\n else {\n auto maxAlongDim = const_cast<NDArray&>(input).reduceAlongDimension(reduce::Max, {dimension}, true);\n (input - maxAlongDim).applyTransform(transform::Exp, output); \/\/ output contains exponents temporarily\n auto sumAlongDim = output.reduceAlongDimension(reduce::Sum, {dimension}, true);\n output \/= sumAlongDim;\n output *= (1.f - output); \/\/ derivative\n }\n }\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n template <typename T>\n void logSoftMaxForVector_(void const* input, Nd4jLong const* inShapeInfo, void *output, Nd4jLong const* outShapeInfo) {\n auto inBuff = reinterpret_cast<T const*>(input);\n auto outBuff = reinterpret_cast<T *>(output);\n\n T max = -DataTypeUtils::max<T>();\n T sum = 0;\n\n auto inEWS = shape::elementWiseStride(inShapeInfo);\n auto length = shape::length(inShapeInfo);\n\n if (inEWS == 1) {\n for (Nd4jLong i = 0; i < length; i++)\n max = sd::math::nd4j_max<T>(max, inBuff[i]);\n#ifdef __NEC__\n PRAGMA_OMP_SIMD_SUM(sum)\n#endif\n for (Nd4jLong i = 0; i < length; i++) {\n outBuff[i] = sd::math::nd4j_exp<T,T>(inBuff[i] - max);\n sum += outBuff[i];\n }\n\n PRAGMA_OMP_SIMD\n for (Nd4jLong i = 0; i < length; i++) {\n outBuff[i] \/= sum;\n outBuff[i] = sd::math::nd4j_log<T,T>(outBuff[i]);\n }\n }\n else if (inEWS > 1) {\n#ifndef __NEC__\n PRAGMA_OMP_SIMD_MAX(max)\n#endif\n for (Nd4jLong i = 0; i < length; i++)\n max = sd::math::nd4j_max<T>(max, inBuff[i * inEWS]);\n#ifndef __NEC__\n PRAGMA_OMP_SIMD_SUM(sum)\n#endif\n for (Nd4jLong i = 0; i < length; i++) {\n outBuff[i * inEWS] = sd::math::nd4j_exp<T,T>(inBuff[i * inEWS] - max);\n sum += outBuff[i * inEWS];\n }\n\n PRAGMA_OMP_SIMD\n for (Nd4jLong i = 0; i < length; i++) {\n outBuff[i * inEWS] \/= sum;\n outBuff[i * inEWS] = sd::math::nd4j_log<T, T>(outBuff[i * inEWS]);\n }\n }\n }\n\n \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n void logSoftMaxForVector(sd::LaunchContext* context, const NDArray& input, NDArray& output) {\n\n if(!input.isVector() || !output.isVector())\n throw std::runtime_error(\"ops::helpers::logSoftMaxForVector function input and output arrays must be vectors !\");\n\n auto xType = input.dataType();\n BUILD_SINGLE_SELECTOR(xType, logSoftMaxForVector_, (input.buffer(), input.shapeInfo(), output.buffer(), output.shapeInfo()), FLOAT_TYPES);\n }\n\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nvoid prelu(sd::LaunchContext * context, const NDArray& input, const NDArray& alpha, NDArray& output) {\n const Nd4jLong inputLen = input.lengthOf();\n const Nd4jLong* inputShapeInfo = input.shapeInfo();\n const Nd4jLong* alphaShapeInfo = alpha.shapeInfo();\n\n auto func = PRAGMA_THREADS_FOR {\n for (auto i = start; i < stop; i++) {\n \/\/ FIXME: double!\n double x = input.e<double>(i);\n if (x < 0.0) {\n \/\/ FIXME: double\n output.p(i, (x * alpha.e<double>(shape::subArrayIndex(i, inputShapeInfo, alphaShapeInfo))));\n } else\n output.p(i, x);\n }\n };\n\n samediff::Threads::parallel_for(func, 0, inputLen);\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nvoid preluBP(sd::LaunchContext * context, const NDArray& input, const NDArray& alpha, const NDArray& dLdO, NDArray& dLdI, NDArray& dLdA) {\n\n const Nd4jLong inputLen = input.lengthOf();\n const Nd4jLong* inputShapeInfo = input.shapeInfo();\n const Nd4jLong* alphaShapeInfo = alpha.shapeInfo();\n\n dLdA.assign(0.0f);\n\n for(Nd4jLong i = 0; i < inputLen; ++i) {\n \/\/ FIXME: double\n double x = input.e<double>(i);\n double grO = dLdO.e<double>(i);\n if(x < 0.0) {\n Nd4jLong alphaInd = shape::subArrayIndex(i, inputShapeInfo, alphaShapeInfo);\n dLdI.p(i, grO * alpha.e<double>(alphaInd));\n double prevVal = dLdA.e<double>(alphaInd);\n prevVal += (grO * x);\n dLdA.p(alphaInd, prevVal);\n }\n else\n dLdI.p(i, grO);\n }\n}\n\n\n bool checkAlphaShapeLen(std::vector<Nd4jLong> const& expectedShape, Nd4jLong shapeLen) {\n Nd4jLong expectedAlphaLen = std::accumulate(expectedShape.cbegin(), expectedShape.cend(), 1, std::multiplies<Nd4jLong>());\n return expectedAlphaLen == shapeLen;\n }\n template <typename T>\n static void thresholdRelu_(NDArray const& input, double threshold, NDArray& output) {\n auto routine = LAMBDA_T(_x, threshold) {\n return _x > (T)threshold? _x: (T)0.f;\n };\n const_cast<NDArray&>(input).applyLambda<T>(routine, output);\n }\n\n void thresholdRelu(sd::LaunchContext * context, NDArray const& input, double threshold, NDArray& output) {\n BUILD_SINGLE_SELECTOR(input.dataType(), thresholdRelu_, (input, threshold, output), FLOAT_TYPES);\n }\n\n template <typename T>\n static void thresholdReluDerivative_(sd::LaunchContext * context, NDArray* input, double theta, NDArray* dLdO, NDArray* output) {\n auto derivative = LAMBDA_TT(_x, grO, theta) {if (_x > theta) return grO; else return static_cast<T>(0); };\n\n input->applyPairwiseLambda<T>(*dLdO, derivative, *output);\n\n }\n\n void thresholdReluDerivative(sd::LaunchContext * context, NDArray* input, double threshold, NDArray* dLdO, NDArray* output) {\n BUILD_SINGLE_SELECTOR(input->dataType(), thresholdReluDerivative_, (context, input, threshold, dLdO, output), FLOAT_TYPES);\n }\n\n \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n void logSoftmax(sd::LaunchContext * context, const NDArray& input, NDArray& output, const int dimension) {\n\n const int rank = input.rankOf();\n\n if(input.isVector()) {\n\n if(rank == 1 || input.sizeAt(dimension) != 1) {\n BUILD_SINGLE_SELECTOR(input.dataType(), logSoftMaxForVector_, (input.buffer(), input.shapeInfo(), output.buffer(), output.shapeInfo()), FLOAT_TYPES);\n }\n else\n output = 0.;\n }\n else {\n\n auto maxAlongDim = const_cast<NDArray&>(input).reduceAlongDimension(reduce::Max, {dimension}, true);\n (input - maxAlongDim).applyTransform(transform::Exp, output); \/\/ output contains exponents temporarily\n auto sumAlongDim = output.reduceAlongDimension(reduce::Sum, {dimension}, true);\n output \/= sumAlongDim;\n output.applyTransform(transform::Log, output);\n }\n }\n\n BUILD_SINGLE_TEMPLATE(template void thresholdReluDerivative_, (sd::LaunchContext * context, NDArray* input, double threshold, NDArray* dLdO, NDArray* output), FLOAT_TYPES);\n BUILD_SINGLE_TEMPLATE(template void logSoftMaxForVector_, (void const* input, Nd4jLong const* inShapeInfo, void *output, Nd4jLong const* outShapeInfo), FLOAT_TYPES);\n BUILD_SINGLE_TEMPLATE(template void _softMaxDerivForVector, (sd::LaunchContext * context, const void *input, const Nd4jLong *inShapeInfo, void *output), FLOAT_TYPES);\n\n}\n}\n}\n\n<|endoftext|>"} {"text":"<commit_before><commit_msg>Improving kmp<commit_after><|endoftext|>"} {"text":"<commit_before>\/\/ preliminary\n\/\/ Part of support library for djinni4python, handwritten\n\n#include <stdio.h> \/\/ for debugging\n#include \"wrapper_marshal.hpp\"\n#include \"thread_local.hpp\"\n#include \"..\/djinni_common.hpp\"\n#include <string>\n#include <iostream> \/\/ for debugging\n\nusing namespace djinni;\nusing namespace djinni::optionals;\nusing std::optional;\nusing std::nullopt;\n\n\/\/ Helpers to convert from a 'handle type' to a 'optional-handle type' or the other way around\n\/\/ Useful in generated code, when marshaling and unmarshaling optional structured types, as it helps differentiate\n\/\/ which overload of a toCpp, fromCpp function to be used\nHandle<DjinniOptionalObjectHandle> optionals::toOptionalHandle(Handle<DjinniObjectHandle> handle,\n DeleterFn<DjinniOptionalObjectHandle> deletefn) {\n return Handle<DjinniOptionalObjectHandle>((DjinniOptionalObjectHandle *) handle.release(), deletefn);\n}\n\nHandle<DjinniObjectHandle> optionals::fromOptionalHandle(Handle<DjinniOptionalObjectHandle> handle,\n DeleterFn<DjinniObjectHandle> deletefn) {\n return Handle<DjinniObjectHandle>((DjinniObjectHandle *) handle.release(), deletefn);\n}\n\nHandle<DjinniOptionalRecordHandle> optionals::toOptionalHandle(Handle<DjinniRecordHandle> handle,\n DeleterFn<DjinniOptionalRecordHandle> deletefn) {\n return Handle<DjinniOptionalRecordHandle>((DjinniOptionalRecordHandle *) handle.release(), deletefn);\n\n}\n\nHandle<DjinniRecordHandle> optionals::fromOptionalHandle(Handle<DjinniOptionalRecordHandle> handle,\n DeleterFn<DjinniRecordHandle> deletefn) {\n return Handle<DjinniRecordHandle>((DjinniRecordHandle *) handle.release(), deletefn);\n}\n\n\/\/ Support for Handling Exceptions\nstatic CreateExceptionFnPtr s_djinni_create_py_from_cpp_exception;\nstatic DeleteExceptionFnPtr s_djinni_exception___delete;\n\n\/\/ Structure holding current exception, if any\nstruct ExceptionState {\n static djinni::Handle<DjinniPythonExceptionHandle> newHandle(DjinniPythonExceptionHandle * c_ptr) {\n return djinni::Handle<DjinniPythonExceptionHandle>(c_ptr, s_djinni_exception___delete);\n }\n\n djinni::Handle<DjinniPythonExceptionHandle> takeException() {\n auto aux = std::move(handle);\n handle = nullptr;\n return aux;\n }\n\n djinni::Handle<DjinniPythonExceptionHandle> handle;\n};\n\n\/\/ Current exception state\nstatic djinni::support_lib::ThreadLocal<ExceptionState> s_exception_state;\n\n\/\/ to be called from Python\nvoid djinni_create_and_set_cpp_from_py_exception(DjinniPythonExceptionHandle * py_e_handle) {\n s_exception_state.get().handle = ExceptionState::newHandle(py_e_handle);\n}\n\nvoid _djinni_add_callback_create_py_from_cpp_exception(CreateExceptionFnPtr fct_ptr) {\n s_djinni_create_py_from_cpp_exception = fct_ptr;\n}\nvoid _djinni_add_callback_exception___delete(DeleteExceptionFnPtr fct_ptr) {\n s_djinni_exception___delete = fct_ptr;\n}\n\nvoid djinni::cw_default_throw_exception(djinni::Handle<DjinniPythonExceptionHandle> e_handle) {\n throw djinni::py_exception(std::move(e_handle));\n}\n\nDJINNI_WEAK_DEFINITION\nvoid djinni::cw_throw_exception(djinni::Handle<DjinniPythonExceptionHandle> e_handle) {\n cw_default_throw_exception(std::move(e_handle));\n}\n\n\/\/ to be called from cpp to allow cpp impl to know about pyhton exception\nvoid djinni::cw_throw_if_pending() {\n auto e_handle = s_exception_state.get().takeException();\n\n if (e_handle) {\n cw_throw_exception(std::move(e_handle));\n }\n}\n\ndjinni::Handle<DjinniPythonExceptionHandle> djinni::cw_default_get_py_exception(const std::exception_ptr & e_ptr) noexcept {\n try {\n if (e_ptr) {\n std::rethrow_exception(e_ptr);\n }\n } catch (djinni::py_exception & py_e) { \/\/ exception generated by user python code\n return py_e.takePyException();\n } catch (const std::exception & e) { \/\/ exception generated by user cpp code\n auto e_mesg = DjinniString::fromCpp(e.what());\n return ExceptionState::newHandle(s_djinni_create_py_from_cpp_exception(e_mesg.release()));\n }\n assert(false);\n}\n\n\/\/ The argument is an exception_ptr for either a std::exception or a subclass of std::exception called py_exception\n\/\/ Creates or retrieves a handle to a python exception from the exception_ptr\nDJINNI_WEAK_DEFINITION\ndjinni::Handle<DjinniPythonExceptionHandle> djinni::cw_get_py_exception(const std::exception_ptr & e_ptr) noexcept {\n return cw_default_get_py_exception(e_ptr);\n}\n\n\/\/ Create a python exception from the exception pointer, and set it in s_exception_state to allow Python to\n\/\/ notice an exception was thrown\n\/\/ The argument is an exception_ptr for either a std::exception or a subclass of std::exception called py_exception\nvoid djinni::cw_set_pending_exception(const std::exception_ptr & e_ptr) {\n s_exception_state.get().handle = cw_get_py_exception(e_ptr);\n}\n\nDjinniPythonExceptionHandle * djinni_from_python_check_and_clear_exception() {\n if (s_exception_state.get().handle) {\n return s_exception_state.get().takeException().release();\n }\n return nullptr;\n}\n\n\/\/ DJINNI PRIMITIVE OPTIONALS\n\/\/ OPTIONAL INTEGERS\nDjinniBoxedI8 * create_djinni_boxed_i8(int8_t pyopt) {\n return DjinniBoxedI8::newOptional(pyopt).release();\n}\nvoid delete_djinni_boxed_i8(DjinniBoxedI8 * dopt) {\n delete dopt;\n}\nint8_t get_djinni_boxed_i8_data(DjinniBoxedI8 * dopt) {\n return dopt->m_data;\n}\n\nDjinniBoxedI16 * create_djinni_boxed_i16(int16_t pyopt) {\n return DjinniBoxedI16::newOptional(pyopt).release();\n}\nvoid delete_djinni_boxed_i16(DjinniBoxedI16 * dopt) {\n delete dopt;\n}\nint16_t get_djinni_boxed_i16_data(DjinniBoxedI16 * dopt) {\n return dopt->m_data;\n}\n\nDjinniBoxedI32 * create_djinni_boxed_i32(int32_t pyopt) {\n return DjinniBoxedI32::newOptional(pyopt).release();\n}\nvoid delete_djinni_boxed_i32(DjinniBoxedI32 * dopt) {\n delete dopt;\n}\nint32_t get_djinni_boxed_i32_data(DjinniBoxedI32 * dopt) {\n return dopt->m_data;\n}\n\nDjinniBoxedI64 * create_djinni_boxed_i64(int64_t pyopt) {\n return DjinniBoxedI64::newOptional(pyopt).release();\n}\nvoid delete_djinni_boxed_i64(DjinniBoxedI64 * dopt) {\n delete dopt;\n}\nint64_t get_djinni_boxed_i64_data(DjinniBoxedI64 * dopt) {\n return dopt->m_data;\n}\n\n\/\/ OPTIONAL FLOATING POINTS\nDjinniBoxedF32 * create_djinni_boxed_f32(float pyopt) {\n return DjinniBoxedF32::newOptional(pyopt).release();\n}\nvoid delete_djinni_boxed_f32(DjinniBoxedF32 * dopt) {\n delete dopt;\n}\nfloat get_djinni_boxed_f32_data(DjinniBoxedF32 * dopt) {\n return dopt->m_data;\n}\n\nDjinniBoxedF64 * create_djinni_boxed_f64(double pyopt) {\n return DjinniBoxedF64::newOptional(pyopt).release();\n}\nvoid delete_djinni_boxed_f64(DjinniBoxedF64 * dopt) {\n delete dopt;\n}\ndouble get_djinni_boxed_f64_data(DjinniBoxedF64 * dopt) {\n return dopt->m_data;\n}\n\n\/\/ OPTIONAL BOOL\nDjinniBoxedBool * create_djinni_boxed_bool(bool pyopt) {\n return DjinniBoxedBool::newOptional(pyopt).release();\n}\nvoid delete_djinni_boxed_bool(DjinniBoxedBool * dopt) {\n delete dopt;\n}\nbool get_djinni_boxed_bool_data(DjinniBoxedBool * dopt) {\n return dopt->m_data;\n}\n\n\/\/ DJINNI STRING\nDjinniString::DjinniString(std::string s) {\n this->cppstr = std::move(s);\n}\n\nDjinniString * create_djinni_string(const char * s, size_t len) {\n return DjinniString::fromCpp(std::string(s,len)).release();\n}\n\nvoid delete_djinni_string(DjinniString * ss) {\n delete ss;\n}\n\nconst char * get_djinni_string_chars(const DjinniString * ds) {\n return ds->cppstr.c_str();\n}\n\nsize_t get_djinni_string_len(const DjinniString * ds) {\n return ds->cppstr.length();\n}\n\nstd::unique_ptr<DjinniString> DjinniString::fromCpp(std::string cppstr) {\n return std::unique_ptr<DjinniString>(new DjinniString(std::move(cppstr)));\n}\n\nstd::string DjinniString::toCpp(std::unique_ptr<DjinniString> ds) {\n return std::move(ds->cppstr);\n}\n\n\/\/ OPTIONAL DJINNI STRING\noptional<std::string> DjinniOptionalString::toCpp(std::unique_ptr<DjinniString> ds) {\n if (ds) {\n return std::move(ds->cppstr);\n }\n return nullopt;\n}\n\nstd::unique_ptr<DjinniString> DjinniOptionalString::fromCpp(optional<std::string> s) {\n if (s) {\n return DjinniString::fromCpp(std::move(* s));\n }\n return nullptr;\n}\n\n\/\/ DJINNI BINARY\nDjinniBinary::DjinniBinary(std::vector<uint8_t> b) {\n this->cppbinary = std::move(b);\n}\n\nDjinniBinary * create_djinni_binary(const uint8_t * b, size_t len) {\n return DjinniBinary::fromCpp(std::vector<uint8_t>(b, b+len)).release();\n}\n\nvoid delete_djinni_binary(DjinniBinary * db) {\n delete db;\n}\n\nconst uint8_t * get_djinni_binary_uint8s(const DjinniBinary * db) {\n return db->cppbinary.data();\n}\n\nsize_t get_djinni_binary_len(const DjinniBinary * db) {\n return db->cppbinary.size();\n}\n\nstd::unique_ptr<DjinniBinary> DjinniBinary::fromCpp(std::vector<uint8_t> cppbinary) {\n return std::unique_ptr<DjinniBinary>(new DjinniBinary(std::move(cppbinary)));\n}\n\nstd::vector<uint8_t> DjinniBinary::toCpp(std::unique_ptr<DjinniBinary> db) {\n return std::move(db->cppbinary);\n}\n\n\/\/ OPTIONAL DJINNI BINARY\nstd::unique_ptr<DjinniBinary> DjinniOptionalBinary::fromCpp(optional<std::vector<uint8_t>> cppbinary) {\n if (cppbinary) {\n return DjinniBinary::fromCpp(std::move(* cppbinary));\n }\n return nullptr;\n}\n\noptional<std::vector<uint8_t>> DjinniOptionalBinary::toCpp(std::unique_ptr<DjinniBinary> db) {\n if (db) {\n return std::move(db->cppbinary);\n }\n return nullopt;\n}\n\n\/\/ DJINNI DATE\nauto static const POSIX_EPOCH = std::chrono::system_clock::from_time_t(0);\nstd::chrono::system_clock::time_point DjinniDate::toCpp(uint64_t duration) {\n return POSIX_EPOCH + std::chrono::milliseconds{duration};\n}\n\nuint64_t DjinniDate::fromCpp(std::chrono::system_clock::time_point date) {\n return std::chrono::duration_cast<std::chrono::milliseconds>(date - POSIX_EPOCH).count();\n}\n\n\/\/ OPTIONAL DJINNI DATE\nstd::optional<std::chrono::system_clock::time_point>\nDjinniBoxedDate::toCpp(std::unique_ptr<DjinniBoxedDate> dopt) {\n if (!dopt) {\n return nullopt;\n }\n return DjinniDate::toCpp(dopt->m_data);\n}\n\nstd::unique_ptr<DjinniBoxedDate>\nDjinniBoxedDate::fromCpp(std::optional<std::chrono::system_clock::time_point> dopt) {\n if (!dopt) {\n return nullptr;\n }\n return newOptional(*dopt);\n}\n\nstd::unique_ptr<DjinniBoxedDate>\nDjinniBoxedDate::newOptional(std::chrono::system_clock::time_point data) {\n return std::unique_ptr<DjinniBoxedDate>(new DjinniBoxedDate(DjinniDate::fromCpp(data)));\n}\n\nDjinniBoxedDate * create_djinni_boxed_date(uint64_t pyopt) {\n return DjinniBoxedDate::newOptional(DjinniDate::toCpp(pyopt)).release();\n}\n\nvoid delete_djinni_boxed_date(DjinniBoxedDate * dopt) {\n delete dopt;\n}\n\nuint64_t get_djinni_boxed_date_data(DjinniBoxedDate * dopt) {\n return dopt->m_data;\n}\n<commit_msg>Avoid warning of non returning function (#34)<commit_after>\/\/ preliminary\n\/\/ Part of support library for djinni4python, handwritten\n\n#include <stdio.h> \/\/ for debugging\n#include \"wrapper_marshal.hpp\"\n#include \"thread_local.hpp\"\n#include \"..\/djinni_common.hpp\"\n#include <string>\n#include <iostream> \/\/ for debugging\n\nusing namespace djinni;\nusing namespace djinni::optionals;\nusing std::optional;\nusing std::nullopt;\n\n\/\/ Helpers to convert from a 'handle type' to a 'optional-handle type' or the other way around\n\/\/ Useful in generated code, when marshaling and unmarshaling optional structured types, as it helps differentiate\n\/\/ which overload of a toCpp, fromCpp function to be used\nHandle<DjinniOptionalObjectHandle> optionals::toOptionalHandle(Handle<DjinniObjectHandle> handle,\n DeleterFn<DjinniOptionalObjectHandle> deletefn) {\n return Handle<DjinniOptionalObjectHandle>((DjinniOptionalObjectHandle *) handle.release(), deletefn);\n}\n\nHandle<DjinniObjectHandle> optionals::fromOptionalHandle(Handle<DjinniOptionalObjectHandle> handle,\n DeleterFn<DjinniObjectHandle> deletefn) {\n return Handle<DjinniObjectHandle>((DjinniObjectHandle *) handle.release(), deletefn);\n}\n\nHandle<DjinniOptionalRecordHandle> optionals::toOptionalHandle(Handle<DjinniRecordHandle> handle,\n DeleterFn<DjinniOptionalRecordHandle> deletefn) {\n return Handle<DjinniOptionalRecordHandle>((DjinniOptionalRecordHandle *) handle.release(), deletefn);\n\n}\n\nHandle<DjinniRecordHandle> optionals::fromOptionalHandle(Handle<DjinniOptionalRecordHandle> handle,\n DeleterFn<DjinniRecordHandle> deletefn) {\n return Handle<DjinniRecordHandle>((DjinniRecordHandle *) handle.release(), deletefn);\n}\n\n\/\/ Support for Handling Exceptions\nstatic CreateExceptionFnPtr s_djinni_create_py_from_cpp_exception;\nstatic DeleteExceptionFnPtr s_djinni_exception___delete;\n\n\/\/ Structure holding current exception, if any\nstruct ExceptionState {\n static djinni::Handle<DjinniPythonExceptionHandle> newHandle(DjinniPythonExceptionHandle * c_ptr) {\n return djinni::Handle<DjinniPythonExceptionHandle>(c_ptr, s_djinni_exception___delete);\n }\n\n djinni::Handle<DjinniPythonExceptionHandle> takeException() {\n auto aux = std::move(handle);\n handle = nullptr;\n return aux;\n }\n\n djinni::Handle<DjinniPythonExceptionHandle> handle;\n};\n\n\/\/ Current exception state\nstatic djinni::support_lib::ThreadLocal<ExceptionState> s_exception_state;\n\n\/\/ to be called from Python\nvoid djinni_create_and_set_cpp_from_py_exception(DjinniPythonExceptionHandle * py_e_handle) {\n s_exception_state.get().handle = ExceptionState::newHandle(py_e_handle);\n}\n\nvoid _djinni_add_callback_create_py_from_cpp_exception(CreateExceptionFnPtr fct_ptr) {\n s_djinni_create_py_from_cpp_exception = fct_ptr;\n}\nvoid _djinni_add_callback_exception___delete(DeleteExceptionFnPtr fct_ptr) {\n s_djinni_exception___delete = fct_ptr;\n}\n\nvoid djinni::cw_default_throw_exception(djinni::Handle<DjinniPythonExceptionHandle> e_handle) {\n throw djinni::py_exception(std::move(e_handle));\n}\n\nDJINNI_WEAK_DEFINITION\nvoid djinni::cw_throw_exception(djinni::Handle<DjinniPythonExceptionHandle> e_handle) {\n cw_default_throw_exception(std::move(e_handle));\n}\n\n\/\/ to be called from cpp to allow cpp impl to know about pyhton exception\nvoid djinni::cw_throw_if_pending() {\n auto e_handle = s_exception_state.get().takeException();\n\n if (e_handle) {\n cw_throw_exception(std::move(e_handle));\n }\n}\n\ndjinni::Handle<DjinniPythonExceptionHandle> djinni::cw_default_get_py_exception(const std::exception_ptr & e_ptr) noexcept {\n try {\n if (e_ptr) {\n std::rethrow_exception(e_ptr);\n }\n } catch (djinni::py_exception & py_e) { \/\/ exception generated by user python code\n return py_e.takePyException();\n } catch (const std::exception & e) { \/\/ exception generated by user cpp code\n auto e_mesg = DjinniString::fromCpp(e.what());\n return ExceptionState::newHandle(s_djinni_create_py_from_cpp_exception(e_mesg.release()));\n }\n assert(false);\n return {}; \/\/avoid compiler warning not returning anything\n}\n\n\/\/ The argument is an exception_ptr for either a std::exception or a subclass of std::exception called py_exception\n\/\/ Creates or retrieves a handle to a python exception from the exception_ptr\nDJINNI_WEAK_DEFINITION\ndjinni::Handle<DjinniPythonExceptionHandle> djinni::cw_get_py_exception(const std::exception_ptr & e_ptr) noexcept {\n return cw_default_get_py_exception(e_ptr);\n}\n\n\/\/ Create a python exception from the exception pointer, and set it in s_exception_state to allow Python to\n\/\/ notice an exception was thrown\n\/\/ The argument is an exception_ptr for either a std::exception or a subclass of std::exception called py_exception\nvoid djinni::cw_set_pending_exception(const std::exception_ptr & e_ptr) {\n s_exception_state.get().handle = cw_get_py_exception(e_ptr);\n}\n\nDjinniPythonExceptionHandle * djinni_from_python_check_and_clear_exception() {\n if (s_exception_state.get().handle) {\n return s_exception_state.get().takeException().release();\n }\n return nullptr;\n}\n\n\/\/ DJINNI PRIMITIVE OPTIONALS\n\/\/ OPTIONAL INTEGERS\nDjinniBoxedI8 * create_djinni_boxed_i8(int8_t pyopt) {\n return DjinniBoxedI8::newOptional(pyopt).release();\n}\nvoid delete_djinni_boxed_i8(DjinniBoxedI8 * dopt) {\n delete dopt;\n}\nint8_t get_djinni_boxed_i8_data(DjinniBoxedI8 * dopt) {\n return dopt->m_data;\n}\n\nDjinniBoxedI16 * create_djinni_boxed_i16(int16_t pyopt) {\n return DjinniBoxedI16::newOptional(pyopt).release();\n}\nvoid delete_djinni_boxed_i16(DjinniBoxedI16 * dopt) {\n delete dopt;\n}\nint16_t get_djinni_boxed_i16_data(DjinniBoxedI16 * dopt) {\n return dopt->m_data;\n}\n\nDjinniBoxedI32 * create_djinni_boxed_i32(int32_t pyopt) {\n return DjinniBoxedI32::newOptional(pyopt).release();\n}\nvoid delete_djinni_boxed_i32(DjinniBoxedI32 * dopt) {\n delete dopt;\n}\nint32_t get_djinni_boxed_i32_data(DjinniBoxedI32 * dopt) {\n return dopt->m_data;\n}\n\nDjinniBoxedI64 * create_djinni_boxed_i64(int64_t pyopt) {\n return DjinniBoxedI64::newOptional(pyopt).release();\n}\nvoid delete_djinni_boxed_i64(DjinniBoxedI64 * dopt) {\n delete dopt;\n}\nint64_t get_djinni_boxed_i64_data(DjinniBoxedI64 * dopt) {\n return dopt->m_data;\n}\n\n\/\/ OPTIONAL FLOATING POINTS\nDjinniBoxedF32 * create_djinni_boxed_f32(float pyopt) {\n return DjinniBoxedF32::newOptional(pyopt).release();\n}\nvoid delete_djinni_boxed_f32(DjinniBoxedF32 * dopt) {\n delete dopt;\n}\nfloat get_djinni_boxed_f32_data(DjinniBoxedF32 * dopt) {\n return dopt->m_data;\n}\n\nDjinniBoxedF64 * create_djinni_boxed_f64(double pyopt) {\n return DjinniBoxedF64::newOptional(pyopt).release();\n}\nvoid delete_djinni_boxed_f64(DjinniBoxedF64 * dopt) {\n delete dopt;\n}\ndouble get_djinni_boxed_f64_data(DjinniBoxedF64 * dopt) {\n return dopt->m_data;\n}\n\n\/\/ OPTIONAL BOOL\nDjinniBoxedBool * create_djinni_boxed_bool(bool pyopt) {\n return DjinniBoxedBool::newOptional(pyopt).release();\n}\nvoid delete_djinni_boxed_bool(DjinniBoxedBool * dopt) {\n delete dopt;\n}\nbool get_djinni_boxed_bool_data(DjinniBoxedBool * dopt) {\n return dopt->m_data;\n}\n\n\/\/ DJINNI STRING\nDjinniString::DjinniString(std::string s) {\n this->cppstr = std::move(s);\n}\n\nDjinniString * create_djinni_string(const char * s, size_t len) {\n return DjinniString::fromCpp(std::string(s,len)).release();\n}\n\nvoid delete_djinni_string(DjinniString * ss) {\n delete ss;\n}\n\nconst char * get_djinni_string_chars(const DjinniString * ds) {\n return ds->cppstr.c_str();\n}\n\nsize_t get_djinni_string_len(const DjinniString * ds) {\n return ds->cppstr.length();\n}\n\nstd::unique_ptr<DjinniString> DjinniString::fromCpp(std::string cppstr) {\n return std::unique_ptr<DjinniString>(new DjinniString(std::move(cppstr)));\n}\n\nstd::string DjinniString::toCpp(std::unique_ptr<DjinniString> ds) {\n return std::move(ds->cppstr);\n}\n\n\/\/ OPTIONAL DJINNI STRING\noptional<std::string> DjinniOptionalString::toCpp(std::unique_ptr<DjinniString> ds) {\n if (ds) {\n return std::move(ds->cppstr);\n }\n return nullopt;\n}\n\nstd::unique_ptr<DjinniString> DjinniOptionalString::fromCpp(optional<std::string> s) {\n if (s) {\n return DjinniString::fromCpp(std::move(* s));\n }\n return nullptr;\n}\n\n\/\/ DJINNI BINARY\nDjinniBinary::DjinniBinary(std::vector<uint8_t> b) {\n this->cppbinary = std::move(b);\n}\n\nDjinniBinary * create_djinni_binary(const uint8_t * b, size_t len) {\n return DjinniBinary::fromCpp(std::vector<uint8_t>(b, b+len)).release();\n}\n\nvoid delete_djinni_binary(DjinniBinary * db) {\n delete db;\n}\n\nconst uint8_t * get_djinni_binary_uint8s(const DjinniBinary * db) {\n return db->cppbinary.data();\n}\n\nsize_t get_djinni_binary_len(const DjinniBinary * db) {\n return db->cppbinary.size();\n}\n\nstd::unique_ptr<DjinniBinary> DjinniBinary::fromCpp(std::vector<uint8_t> cppbinary) {\n return std::unique_ptr<DjinniBinary>(new DjinniBinary(std::move(cppbinary)));\n}\n\nstd::vector<uint8_t> DjinniBinary::toCpp(std::unique_ptr<DjinniBinary> db) {\n return std::move(db->cppbinary);\n}\n\n\/\/ OPTIONAL DJINNI BINARY\nstd::unique_ptr<DjinniBinary> DjinniOptionalBinary::fromCpp(optional<std::vector<uint8_t>> cppbinary) {\n if (cppbinary) {\n return DjinniBinary::fromCpp(std::move(* cppbinary));\n }\n return nullptr;\n}\n\noptional<std::vector<uint8_t>> DjinniOptionalBinary::toCpp(std::unique_ptr<DjinniBinary> db) {\n if (db) {\n return std::move(db->cppbinary);\n }\n return nullopt;\n}\n\n\/\/ DJINNI DATE\nauto static const POSIX_EPOCH = std::chrono::system_clock::from_time_t(0);\nstd::chrono::system_clock::time_point DjinniDate::toCpp(uint64_t duration) {\n return POSIX_EPOCH + std::chrono::milliseconds{duration};\n}\n\nuint64_t DjinniDate::fromCpp(std::chrono::system_clock::time_point date) {\n return std::chrono::duration_cast<std::chrono::milliseconds>(date - POSIX_EPOCH).count();\n}\n\n\/\/ OPTIONAL DJINNI DATE\nstd::optional<std::chrono::system_clock::time_point>\nDjinniBoxedDate::toCpp(std::unique_ptr<DjinniBoxedDate> dopt) {\n if (!dopt) {\n return nullopt;\n }\n return DjinniDate::toCpp(dopt->m_data);\n}\n\nstd::unique_ptr<DjinniBoxedDate>\nDjinniBoxedDate::fromCpp(std::optional<std::chrono::system_clock::time_point> dopt) {\n if (!dopt) {\n return nullptr;\n }\n return newOptional(*dopt);\n}\n\nstd::unique_ptr<DjinniBoxedDate>\nDjinniBoxedDate::newOptional(std::chrono::system_clock::time_point data) {\n return std::unique_ptr<DjinniBoxedDate>(new DjinniBoxedDate(DjinniDate::fromCpp(data)));\n}\n\nDjinniBoxedDate * create_djinni_boxed_date(uint64_t pyopt) {\n return DjinniBoxedDate::newOptional(DjinniDate::toCpp(pyopt)).release();\n}\n\nvoid delete_djinni_boxed_date(DjinniBoxedDate * dopt) {\n delete dopt;\n}\n\nuint64_t get_djinni_boxed_date_data(DjinniBoxedDate * dopt) {\n return dopt->m_data;\n}\n<|endoftext|>"} {"text":"<commit_before><commit_msg>Updating context-ls: listProviders -> providers.<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 <set>\n#include \"otbImage.h\"\n#include \"otbVectorImage.h\"\n\n#include \"itkImageRegionIterator.h\"\n#include \"itkImageRegionReverseIterator.h\"\n#include \"itkImageRandomIteratorWithIndex.h\"\n#include \"itkImageScanlineIterator.h\"\n#include \"itkImageRandomNonRepeatingIteratorWithIndex.h\"\n#include \"otbSubsampledImageRegionIterator.h\"\n\n#include \"otbMaskedIteratorDecorator.h\"\n\n\/\/ Generate a test image of specified size and value\ntemplate <typename ImageType>\ntypename ImageType::Pointer GetTestImage(itk::SizeValueType fillSize, const typename ImageType::PixelType& value, unsigned int nbBand=1)\n{\n typename ImageType::Pointer image = ImageType::New();\n typename ImageType::SizeType size;\n size.Fill(fillSize);\n\n typename ImageType::RegionType region;\n region.SetSize(size);\n\n image->SetNumberOfComponentsPerPixel(nbBand);\n image->SetRegions(region);\n image->Allocate();\n image->FillBuffer(value);\n return image;\n}\n\n\/\/ Fill half of the pixels with a value\n\/\/ Used for generating a test mask\ntemplate <typename ImageType>\nvoid FillHalf(typename ImageType::Pointer image, const typename ImageType::RegionType& region, const typename ImageType::PixelType& value)\n{\n itk::ImageRegionIterator<ImageType> it(image, region);\n unsigned int count = 0;\n for(it.GoToBegin(); !it.IsAtEnd(); ++it, ++count)\n {\n if (count % 2 == 0)\n {\n it.Set(value);\n }\n }\n}\n\n\/\/ Test template instanciation\nint otbMaskedIteratorDecoratorNew(int itkNotUsed(argc), char * itkNotUsed(argv) [])\n{\n typedef otb::Image<double, 2> ImageType;\n ImageType::Pointer image = GetTestImage<ImageType>(10, 10);\n ImageType::Pointer mask = GetTestImage<ImageType>(10, 0);\n ImageType::RegionType region(image->GetLargestPossibleRegion());\n\n otb::MaskedIteratorDecorator<itk::ImageRegionIterator<ImageType> > it(mask, image, region);\n return EXIT_SUCCESS;\n}\n\n\/\/ ---------------------- Initialization code ----------------------------------\ntemplate <typename IteratorType>\nvoid\nInitializeIterator(IteratorType&, typename IteratorType::RegionType)\n{\n \/\/ by default : nothing to do\n}\n\n\/\/ specialization for otb::SubsampledImageRegionIterator<otb::Image<double, 2> >\ntemplate <>\nvoid\nInitializeIterator< otb::SubsampledImageRegionIterator< otb::Image<double, 2> > >(\n otb::SubsampledImageRegionIterator< otb::Image<double, 2> >& it,\n typename otb::SubsampledImageRegionIterator<otb::Image<double, 2> >::RegionType)\n{\n it.SetSubsampleFactor(2);\n}\n\n\n\/\/ -------------------------- ForwardTest --------------------------------------\n\/\/ Function to test the forward iteration interface\ntemplate <typename IteratorType, typename MaskIteratorType>\nint ForwardTest(typename MaskIteratorType::ImageType::Pointer mask, typename IteratorType::ImageType::Pointer image, typename IteratorType::ImageType::RegionType region)\n{\n otb::MaskedIteratorDecorator<IteratorType,MaskIteratorType> it(mask, image, region);\n \n \/\/ specific initialization code\n InitializeIterator<IteratorType>(it.GetImageIterator(),region);\n if (it.HasMask())\n {\n InitializeIterator<MaskIteratorType>(it.GetMaskIterator(),region);\n }\n\n it.GoToBegin();\n if (!it.IsAtBegin()) {return 1;}\n\n unsigned int loopCount = 0;\n for(; !it.IsAtEnd(); ++it)\n {\n if (loopCount != 0 && it.IsAtBegin()) {return 2;}\n if (it.IsAtEnd()) {return 3;}\n\n \/\/it.Set(it.Value() * 0.42);\n\n loopCount += 1;\n }\n\n if(!it.IsAtEnd()) {return 4;}\n return 0;\n}\n\n\/\/ -------------------------- ReverseTest --------------------------------------\n\/\/ Test reverse iteration interface\ntemplate <typename IteratorType, typename MaskIteratorType>\nint ReverseTest(typename MaskIteratorType::ImageType::Pointer mask, typename IteratorType::ImageType::Pointer image, typename IteratorType::ImageType::RegionType region)\n{\n otb::MaskedIteratorDecorator<IteratorType,MaskIteratorType> it(mask, image, region);\n \n \/\/ specific initialization code\n InitializeIterator<IteratorType>(it.GetImageIterator(),region);\n if (it.HasMask())\n {\n InitializeIterator<MaskIteratorType>(it.GetMaskIterator(),region);\n }\n\n it.GoToEnd();\n if (!it.IsAtEnd()) {return 1;}\n\n bool beginReached = false;\n while (!it.IsAtBegin())\n {\n --it;\n if (it.IsAtEnd()) {return 2;}\n if (beginReached)\n {\n return 3;\n }\n if (it.IsAtBegin())\n {\n beginReached = true;\n }\n }\n\n if(!it.IsAtBegin()) {return 4;}\n return 0;\n}\n\n\/\/ -------------------------- BijectiveTest --------------------------------------\n\/\/ Check bijection between iterated and non masked\n\/\/ i.e all locations where mask value != 0 are in the iteration (injection)\n\/\/ and mask value != 0 at all iteration locations (surjection)\n\/\/ Templated to test decoration of different iterator types\ntemplate <typename IteratorType, typename MaskIteratorType>\nint BijectiveTest(typename MaskIteratorType::ImageType::Pointer mask, typename IteratorType::ImageType::Pointer image, typename IteratorType::ImageType::RegionType region)\n{\n otb::MaskedIteratorDecorator<IteratorType,MaskIteratorType> itDecorated(mask, image, region);\n IteratorType it(image, region);\n \n \/\/ specific initialization code\n InitializeIterator<IteratorType>(itDecorated.GetImageIterator(),region);\n InitializeIterator<IteratorType>(it,region);\n if (itDecorated.HasMask())\n {\n InitializeIterator<MaskIteratorType>(itDecorated.GetMaskIterator(),region);\n }\n \n\n it.GoToBegin();\n itDecorated.GoToBegin();\n\n \/\/ Find the non maked begin for the image iterator\n if (itDecorated.HasMask())\n {\n while (mask->GetPixel(it.GetIndex()) == 0 && !it.IsAtEnd())\n {\n ++it;\n }\n }\n\n \/\/ Begins are the same\n if (!(it.GetIndex() == itDecorated.GetIndex()\n && it.GetIndex() == itDecorated.GetImageIterator().GetIndex()))\n {\n return 1;\n }\n \n if (itDecorated.HasMask() && it.GetIndex() != itDecorated.GetMaskIterator().GetIndex())\n {\n return 1;\n }\n\n \/\/ Advance both and check\n while (!it.IsAtEnd() && !itDecorated.IsAtEnd())\n {\n \/\/ Iteration locations are the same\n if (!(it.GetIndex() == itDecorated.GetIndex()\n && it.GetIndex() == itDecorated.GetImageIterator().GetIndex()))\n {\n return 2;\n }\n if (itDecorated.HasMask() && it.GetIndex() != itDecorated.GetMaskIterator().GetIndex())\n {\n return 2;\n }\n\n ++itDecorated;\n if (itDecorated.HasMask())\n {\n do\n {\n ++it;\n } while (mask->GetPixel(it.GetIndex()) == 0 && !it.IsAtEnd());\n }\n else\n {\n ++it;\n }\n }\n\n \/\/ Check IsAtEnd\n if (!(it.IsAtEnd() && itDecorated.IsAtEnd()))\n {\n return 3;\n }\n\n return 0;\n}\n\n\/\/ Multiplex to forward, reverse and bijection test\ntemplate <typename IteratorType, typename MaskIteratorType>\nint TripleTest(typename IteratorType::ImageType::Pointer image,typename MaskIteratorType::ImageType::Pointer mask, typename IteratorType::ImageType::RegionType region)\n{\n int ret;\n int retGlobal = EXIT_SUCCESS;\n\n ret = ForwardTest<IteratorType,MaskIteratorType>(mask, image, region);\n if (ret>0)\n {\n std::cout << \"Forward(FAILED:\"<<ret<<\") \";\n retGlobal = EXIT_FAILURE;\n }\n\n ret = ReverseTest<IteratorType,MaskIteratorType>(mask, image, region);\n if (ret>0)\n {\n std::cout << \"Reverse(FAILED:\"<<ret<<\") \";\n retGlobal = EXIT_FAILURE;\n }\n\n ret = BijectiveTest<IteratorType,MaskIteratorType>(mask, image, region);\n if (ret>0)\n {\n std::cout << \"Bijective(FAILED:\"<<ret<<\") \";\n retGlobal = EXIT_FAILURE;\n }\n\n if (retGlobal == EXIT_SUCCESS)\n {\n std::cout << \"PASSED\";\n }\n return retGlobal;\n}\n\n\/\/ -------------------------- Nominal case -------------------------------------\nint otbMaskedIteratorDecoratorNominal(int itkNotUsed(argc), char * itkNotUsed(argv) [])\n{\n typedef otb::Image<double, 2> ImageType;\n ImageType::Pointer image = GetTestImage<ImageType>(10, 10);\n ImageType::Pointer mask = GetTestImage<ImageType>(10, 0);\n ImageType::RegionType region(image->GetLargestPossibleRegion());\n FillHalf<ImageType>(mask, region, 1);\n int ret;\n int retGlobal = EXIT_SUCCESS;\n\n std::cout << std::endl << \"itk::ImageRegionIterator : \";\n ret = TripleTest< itk::ImageRegionIterator<ImageType>,\n itk::ImageRegionIterator<ImageType> >(image, mask, region);\n retGlobal = (ret == EXIT_FAILURE ? EXIT_FAILURE : retGlobal);\n\n std::cout << std::endl << \"itk::ImageRegionConstIterator : \";\n ret = TripleTest< itk::ImageRegionConstIterator<ImageType>,\n itk::ImageRegionConstIterator<ImageType> >(image, mask, region);\n retGlobal = (ret == EXIT_FAILURE ? EXIT_FAILURE : retGlobal);\n \n \/\/ std::cout << std::endl << \"otb::SubsampledImageRegionIterator : \";\n \/\/ ret = TripleTest< otb::SubsampledImageRegionIterator<ImageType>,\n \/\/ otb::SubsampledImageRegionIterator<ImageType> >(image, mask, region);\n \/\/ retGlobal = (ret == EXIT_FAILURE ? EXIT_FAILURE : retGlobal);\n\n return retGlobal;\n}\n\n\/\/ ------------------------ Degenerate cases -----------------------------------\nint otbMaskedIteratorDecoratorDegenerate(int itkNotUsed(argc), char * itkNotUsed(argv) [])\n{\n \/\/ Fully masked (0 everywhere)\n typedef otb::Image<double, 2> ImageType;\n ImageType::Pointer image = GetTestImage<ImageType>(10, 10);\n ImageType::Pointer mask = GetTestImage<ImageType>(10, 0);\n ImageType::RegionType region(image->GetLargestPossibleRegion());\n\n return TripleTest<itk::ImageRegionIterator<ImageType>,\n itk::ImageRegionIterator<ImageType> >(image, mask, region);\n}\n\n\/\/ --------------------------- Extended cases ----------------------------------\nint otbMaskedIteratorDecoratorExtended(int itkNotUsed(argc), char * itkNotUsed(argv) [])\n{\n typedef otb::VectorImage<double, 2> ImageType;\n typedef otb::Image<unsigned char, 2> MaskType;\n otb::VectorImage<double, 2>::PixelType pixel(3);\n pixel.Fill(12);\n ImageType::Pointer image = GetTestImage<ImageType>(10,pixel ,3);\n MaskType::Pointer mask = GetTestImage<MaskType>(10, 0);\n ImageType::RegionType region(image->GetLargestPossibleRegion());\n FillHalf<MaskType>(mask, region, 1);\n int ret;\n int retGlobal = EXIT_SUCCESS;\n\n std::cout << std::endl << \"itk::ImageRegionIterator : \";\n ret = TripleTest< itk::ImageRegionIterator<ImageType>,\n itk::ImageRegionIterator<MaskType> >(image, mask, region);\n retGlobal = (ret == EXIT_FAILURE ? EXIT_FAILURE : retGlobal);\n\n std::cout << std::endl << \"itk::ImageRegionConstIterator : \";\n ret = TripleTest< itk::ImageRegionConstIterator<ImageType>,\n itk::ImageRegionConstIterator<MaskType> >(image, mask, region);\n retGlobal = (ret == EXIT_FAILURE ? EXIT_FAILURE : retGlobal);\n\n std::cout << std::endl << \"itk::ImageRegionIterator without mask: \";\n ret = TripleTest< itk::ImageRegionIterator<ImageType>,\n itk::ImageRegionIterator<MaskType> >(image, NULL, region);\n retGlobal = (ret == EXIT_FAILURE ? EXIT_FAILURE : retGlobal);\n\n std::cout << std::endl << \"itk::ImageRegionConstIterator without mask: \";\n ret = TripleTest< itk::ImageRegionConstIterator<ImageType>,\n itk::ImageRegionConstIterator<MaskType> >(image, NULL, region);\n retGlobal = (ret == EXIT_FAILURE ? EXIT_FAILURE : retGlobal);\n\n return retGlobal;\n}\n\n\n\n\/* Other iterators potentially compatible:\n\nDifferent constructor arguments than (image, region)\nitk::PathIterator\nitk::LineIterator\nitk::SliceIterator\nitk::NeighborhoodIterator\n\nNeeds initialization code:\nitk::ImageRandomConstIteratorWithIndex\nitk::ImageRandomIteratorWithIndex\nitk::ImageRandomNonRepeatingConstIteratorWithIndex\nitk::ImageRandomNonRepeatingIteratorWithIndex\n\notb::SubsampledImageRegionIterator : GoToEnd is buggy !\n\nDifferent iteration interface than normal iterators:\nitk::ImageScanlineIterator\nitk::ImageScanlineConstIterator\n\nGoToEnd is not implemented\nitk::ImageLinearIteratorWithIndex\nitk::ReflectiveImageRegionIterator\nitk::ImageRegionExclusionConstIteratorWithIndex\nitk::ImageRegionIteratorWithIndex\n\nOther problem:\nitk::ImageRegionReverseIterator>() \/\/ IsAtEnd not a const method\notb::PolyLineImageIterator>() \/\/ header not found\nitk::ImageRandomConstIteratorWithOnlyIndex>() \/\/ no Value method\n*\/\n<commit_msg>COMP: wrong place for a typename (gcc 4.1.2)<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 <set>\n#include \"otbImage.h\"\n#include \"otbVectorImage.h\"\n\n#include \"itkImageRegionIterator.h\"\n#include \"itkImageRegionReverseIterator.h\"\n#include \"itkImageRandomIteratorWithIndex.h\"\n#include \"itkImageScanlineIterator.h\"\n#include \"itkImageRandomNonRepeatingIteratorWithIndex.h\"\n#include \"otbSubsampledImageRegionIterator.h\"\n\n#include \"otbMaskedIteratorDecorator.h\"\n\n\/\/ Generate a test image of specified size and value\ntemplate <typename ImageType>\ntypename ImageType::Pointer GetTestImage(itk::SizeValueType fillSize, const typename ImageType::PixelType& value, unsigned int nbBand=1)\n{\n typename ImageType::Pointer image = ImageType::New();\n typename ImageType::SizeType size;\n size.Fill(fillSize);\n\n typename ImageType::RegionType region;\n region.SetSize(size);\n\n image->SetNumberOfComponentsPerPixel(nbBand);\n image->SetRegions(region);\n image->Allocate();\n image->FillBuffer(value);\n return image;\n}\n\n\/\/ Fill half of the pixels with a value\n\/\/ Used for generating a test mask\ntemplate <typename ImageType>\nvoid FillHalf(typename ImageType::Pointer image, const typename ImageType::RegionType& region, const typename ImageType::PixelType& value)\n{\n itk::ImageRegionIterator<ImageType> it(image, region);\n unsigned int count = 0;\n for(it.GoToBegin(); !it.IsAtEnd(); ++it, ++count)\n {\n if (count % 2 == 0)\n {\n it.Set(value);\n }\n }\n}\n\n\/\/ Test template instanciation\nint otbMaskedIteratorDecoratorNew(int itkNotUsed(argc), char * itkNotUsed(argv) [])\n{\n typedef otb::Image<double, 2> ImageType;\n ImageType::Pointer image = GetTestImage<ImageType>(10, 10);\n ImageType::Pointer mask = GetTestImage<ImageType>(10, 0);\n ImageType::RegionType region(image->GetLargestPossibleRegion());\n\n otb::MaskedIteratorDecorator<itk::ImageRegionIterator<ImageType> > it(mask, image, region);\n return EXIT_SUCCESS;\n}\n\n\/\/ ---------------------- Initialization code ----------------------------------\ntemplate <typename IteratorType>\nvoid\nInitializeIterator(IteratorType&, typename IteratorType::RegionType)\n{\n \/\/ by default : nothing to do\n}\n\n\/\/ specialization for otb::SubsampledImageRegionIterator<otb::Image<double, 2> >\ntemplate <>\nvoid\nInitializeIterator< otb::SubsampledImageRegionIterator< otb::Image<double, 2> > >(\n otb::SubsampledImageRegionIterator< otb::Image<double, 2> >& it,\n otb::SubsampledImageRegionIterator<otb::Image<double, 2> >::RegionType)\n{\n it.SetSubsampleFactor(2);\n}\n\n\n\/\/ -------------------------- ForwardTest --------------------------------------\n\/\/ Function to test the forward iteration interface\ntemplate <typename IteratorType, typename MaskIteratorType>\nint ForwardTest(typename MaskIteratorType::ImageType::Pointer mask, typename IteratorType::ImageType::Pointer image, typename IteratorType::ImageType::RegionType region)\n{\n otb::MaskedIteratorDecorator<IteratorType,MaskIteratorType> it(mask, image, region);\n \n \/\/ specific initialization code\n InitializeIterator<IteratorType>(it.GetImageIterator(),region);\n if (it.HasMask())\n {\n InitializeIterator<MaskIteratorType>(it.GetMaskIterator(),region);\n }\n\n it.GoToBegin();\n if (!it.IsAtBegin()) {return 1;}\n\n unsigned int loopCount = 0;\n for(; !it.IsAtEnd(); ++it)\n {\n if (loopCount != 0 && it.IsAtBegin()) {return 2;}\n if (it.IsAtEnd()) {return 3;}\n\n \/\/it.Set(it.Value() * 0.42);\n\n loopCount += 1;\n }\n\n if(!it.IsAtEnd()) {return 4;}\n return 0;\n}\n\n\/\/ -------------------------- ReverseTest --------------------------------------\n\/\/ Test reverse iteration interface\ntemplate <typename IteratorType, typename MaskIteratorType>\nint ReverseTest(typename MaskIteratorType::ImageType::Pointer mask, typename IteratorType::ImageType::Pointer image, typename IteratorType::ImageType::RegionType region)\n{\n otb::MaskedIteratorDecorator<IteratorType,MaskIteratorType> it(mask, image, region);\n \n \/\/ specific initialization code\n InitializeIterator<IteratorType>(it.GetImageIterator(),region);\n if (it.HasMask())\n {\n InitializeIterator<MaskIteratorType>(it.GetMaskIterator(),region);\n }\n\n it.GoToEnd();\n if (!it.IsAtEnd()) {return 1;}\n\n bool beginReached = false;\n while (!it.IsAtBegin())\n {\n --it;\n if (it.IsAtEnd()) {return 2;}\n if (beginReached)\n {\n return 3;\n }\n if (it.IsAtBegin())\n {\n beginReached = true;\n }\n }\n\n if(!it.IsAtBegin()) {return 4;}\n return 0;\n}\n\n\/\/ -------------------------- BijectiveTest --------------------------------------\n\/\/ Check bijection between iterated and non masked\n\/\/ i.e all locations where mask value != 0 are in the iteration (injection)\n\/\/ and mask value != 0 at all iteration locations (surjection)\n\/\/ Templated to test decoration of different iterator types\ntemplate <typename IteratorType, typename MaskIteratorType>\nint BijectiveTest(typename MaskIteratorType::ImageType::Pointer mask, typename IteratorType::ImageType::Pointer image, typename IteratorType::ImageType::RegionType region)\n{\n otb::MaskedIteratorDecorator<IteratorType,MaskIteratorType> itDecorated(mask, image, region);\n IteratorType it(image, region);\n \n \/\/ specific initialization code\n InitializeIterator<IteratorType>(itDecorated.GetImageIterator(),region);\n InitializeIterator<IteratorType>(it,region);\n if (itDecorated.HasMask())\n {\n InitializeIterator<MaskIteratorType>(itDecorated.GetMaskIterator(),region);\n }\n \n\n it.GoToBegin();\n itDecorated.GoToBegin();\n\n \/\/ Find the non maked begin for the image iterator\n if (itDecorated.HasMask())\n {\n while (mask->GetPixel(it.GetIndex()) == 0 && !it.IsAtEnd())\n {\n ++it;\n }\n }\n\n \/\/ Begins are the same\n if (!(it.GetIndex() == itDecorated.GetIndex()\n && it.GetIndex() == itDecorated.GetImageIterator().GetIndex()))\n {\n return 1;\n }\n \n if (itDecorated.HasMask() && it.GetIndex() != itDecorated.GetMaskIterator().GetIndex())\n {\n return 1;\n }\n\n \/\/ Advance both and check\n while (!it.IsAtEnd() && !itDecorated.IsAtEnd())\n {\n \/\/ Iteration locations are the same\n if (!(it.GetIndex() == itDecorated.GetIndex()\n && it.GetIndex() == itDecorated.GetImageIterator().GetIndex()))\n {\n return 2;\n }\n if (itDecorated.HasMask() && it.GetIndex() != itDecorated.GetMaskIterator().GetIndex())\n {\n return 2;\n }\n\n ++itDecorated;\n if (itDecorated.HasMask())\n {\n do\n {\n ++it;\n } while (mask->GetPixel(it.GetIndex()) == 0 && !it.IsAtEnd());\n }\n else\n {\n ++it;\n }\n }\n\n \/\/ Check IsAtEnd\n if (!(it.IsAtEnd() && itDecorated.IsAtEnd()))\n {\n return 3;\n }\n\n return 0;\n}\n\n\/\/ Multiplex to forward, reverse and bijection test\ntemplate <typename IteratorType, typename MaskIteratorType>\nint TripleTest(typename IteratorType::ImageType::Pointer image,typename MaskIteratorType::ImageType::Pointer mask, typename IteratorType::ImageType::RegionType region)\n{\n int ret;\n int retGlobal = EXIT_SUCCESS;\n\n ret = ForwardTest<IteratorType,MaskIteratorType>(mask, image, region);\n if (ret>0)\n {\n std::cout << \"Forward(FAILED:\"<<ret<<\") \";\n retGlobal = EXIT_FAILURE;\n }\n\n ret = ReverseTest<IteratorType,MaskIteratorType>(mask, image, region);\n if (ret>0)\n {\n std::cout << \"Reverse(FAILED:\"<<ret<<\") \";\n retGlobal = EXIT_FAILURE;\n }\n\n ret = BijectiveTest<IteratorType,MaskIteratorType>(mask, image, region);\n if (ret>0)\n {\n std::cout << \"Bijective(FAILED:\"<<ret<<\") \";\n retGlobal = EXIT_FAILURE;\n }\n\n if (retGlobal == EXIT_SUCCESS)\n {\n std::cout << \"PASSED\";\n }\n return retGlobal;\n}\n\n\/\/ -------------------------- Nominal case -------------------------------------\nint otbMaskedIteratorDecoratorNominal(int itkNotUsed(argc), char * itkNotUsed(argv) [])\n{\n typedef otb::Image<double, 2> ImageType;\n ImageType::Pointer image = GetTestImage<ImageType>(10, 10);\n ImageType::Pointer mask = GetTestImage<ImageType>(10, 0);\n ImageType::RegionType region(image->GetLargestPossibleRegion());\n FillHalf<ImageType>(mask, region, 1);\n int ret;\n int retGlobal = EXIT_SUCCESS;\n\n std::cout << std::endl << \"itk::ImageRegionIterator : \";\n ret = TripleTest< itk::ImageRegionIterator<ImageType>,\n itk::ImageRegionIterator<ImageType> >(image, mask, region);\n retGlobal = (ret == EXIT_FAILURE ? EXIT_FAILURE : retGlobal);\n\n std::cout << std::endl << \"itk::ImageRegionConstIterator : \";\n ret = TripleTest< itk::ImageRegionConstIterator<ImageType>,\n itk::ImageRegionConstIterator<ImageType> >(image, mask, region);\n retGlobal = (ret == EXIT_FAILURE ? EXIT_FAILURE : retGlobal);\n \n \/\/ std::cout << std::endl << \"otb::SubsampledImageRegionIterator : \";\n \/\/ ret = TripleTest< otb::SubsampledImageRegionIterator<ImageType>,\n \/\/ otb::SubsampledImageRegionIterator<ImageType> >(image, mask, region);\n \/\/ retGlobal = (ret == EXIT_FAILURE ? EXIT_FAILURE : retGlobal);\n\n return retGlobal;\n}\n\n\/\/ ------------------------ Degenerate cases -----------------------------------\nint otbMaskedIteratorDecoratorDegenerate(int itkNotUsed(argc), char * itkNotUsed(argv) [])\n{\n \/\/ Fully masked (0 everywhere)\n typedef otb::Image<double, 2> ImageType;\n ImageType::Pointer image = GetTestImage<ImageType>(10, 10);\n ImageType::Pointer mask = GetTestImage<ImageType>(10, 0);\n ImageType::RegionType region(image->GetLargestPossibleRegion());\n\n return TripleTest<itk::ImageRegionIterator<ImageType>,\n itk::ImageRegionIterator<ImageType> >(image, mask, region);\n}\n\n\/\/ --------------------------- Extended cases ----------------------------------\nint otbMaskedIteratorDecoratorExtended(int itkNotUsed(argc), char * itkNotUsed(argv) [])\n{\n typedef otb::VectorImage<double, 2> ImageType;\n typedef otb::Image<unsigned char, 2> MaskType;\n otb::VectorImage<double, 2>::PixelType pixel(3);\n pixel.Fill(12);\n ImageType::Pointer image = GetTestImage<ImageType>(10,pixel ,3);\n MaskType::Pointer mask = GetTestImage<MaskType>(10, 0);\n ImageType::RegionType region(image->GetLargestPossibleRegion());\n FillHalf<MaskType>(mask, region, 1);\n int ret;\n int retGlobal = EXIT_SUCCESS;\n\n std::cout << std::endl << \"itk::ImageRegionIterator : \";\n ret = TripleTest< itk::ImageRegionIterator<ImageType>,\n itk::ImageRegionIterator<MaskType> >(image, mask, region);\n retGlobal = (ret == EXIT_FAILURE ? EXIT_FAILURE : retGlobal);\n\n std::cout << std::endl << \"itk::ImageRegionConstIterator : \";\n ret = TripleTest< itk::ImageRegionConstIterator<ImageType>,\n itk::ImageRegionConstIterator<MaskType> >(image, mask, region);\n retGlobal = (ret == EXIT_FAILURE ? EXIT_FAILURE : retGlobal);\n\n std::cout << std::endl << \"itk::ImageRegionIterator without mask: \";\n ret = TripleTest< itk::ImageRegionIterator<ImageType>,\n itk::ImageRegionIterator<MaskType> >(image, NULL, region);\n retGlobal = (ret == EXIT_FAILURE ? EXIT_FAILURE : retGlobal);\n\n std::cout << std::endl << \"itk::ImageRegionConstIterator without mask: \";\n ret = TripleTest< itk::ImageRegionConstIterator<ImageType>,\n itk::ImageRegionConstIterator<MaskType> >(image, NULL, region);\n retGlobal = (ret == EXIT_FAILURE ? EXIT_FAILURE : retGlobal);\n\n return retGlobal;\n}\n\n\n\n\/* Other iterators potentially compatible:\n\nDifferent constructor arguments than (image, region)\nitk::PathIterator\nitk::LineIterator\nitk::SliceIterator\nitk::NeighborhoodIterator\n\nNeeds initialization code:\nitk::ImageRandomConstIteratorWithIndex\nitk::ImageRandomIteratorWithIndex\nitk::ImageRandomNonRepeatingConstIteratorWithIndex\nitk::ImageRandomNonRepeatingIteratorWithIndex\n\notb::SubsampledImageRegionIterator : GoToEnd is buggy !\n\nDifferent iteration interface than normal iterators:\nitk::ImageScanlineIterator\nitk::ImageScanlineConstIterator\n\nGoToEnd is not implemented\nitk::ImageLinearIteratorWithIndex\nitk::ReflectiveImageRegionIterator\nitk::ImageRegionExclusionConstIteratorWithIndex\nitk::ImageRegionIteratorWithIndex\n\nOther problem:\nitk::ImageRegionReverseIterator>() \/\/ IsAtEnd not a const method\notb::PolyLineImageIterator>() \/\/ header not found\nitk::ImageRandomConstIteratorWithOnlyIndex>() \/\/ no Value method\n*\/\n<|endoftext|>"} {"text":"<commit_before><commit_msg>re-enable OpenCL on Apple for development<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 <set>\n#include \"otbImage.h\"\n\n#include \"itkImageRegionIterator.h\"\n#include \"itkImageRegionReverseIterator.h\"\n#include \"itkImageRandomIteratorWithIndex.h\"\n#include \"itkImageScanlineIterator.h\"\n#include \"otbSubsampledImageRegionIterator.h\"\n\n#include \"otbMaskedIteratorDecorator.h\"\n\n\/\/ Generate a test image of specified size and value\ntemplate <typename ImageType>\ntypename ImageType::Pointer GetTestImage(itk::SizeValueType fillSize, const typename ImageType::PixelType& value)\n{\n typename ImageType::Pointer image = ImageType::New();\n typename ImageType::SizeType size;\n size.Fill(fillSize);\n\n typename ImageType::RegionType region;\n region.SetSize(size);\n\n image->SetRegions(region);\n image->Allocate();\n image->FillBuffer(value);\n return image;\n}\n\n\/\/ Fill half of the pixels with a value\n\/\/ Used for generating a test mask\ntemplate <typename ImageType>\nvoid FillHalf(typename ImageType::Pointer image, const typename ImageType::RegionType& region, const typename ImageType::PixelType& value)\n{\n itk::ImageRegionIterator<ImageType> it(image, region);\n unsigned int count = 0;\n for(it.GoToBegin(); !it.IsAtEnd(); ++it, ++count)\n {\n if (count % 2 == 0)\n {\n it.Set(value);\n }\n }\n}\n\n\/\/ Test template instanciation\nint otbMaskedIteratorDecoratorNew(int itkNotUsed(argc), char * itkNotUsed(argv) [])\n{\n typedef otb::Image<double, 2> ImageType;\n ImageType::Pointer image = GetTestImage<ImageType>(10, 10);\n ImageType::Pointer mask = GetTestImage<ImageType>(10, 0);\n ImageType::RegionType region(image->GetLargestPossibleRegion());\n\n otb::MaskedIteratorDecorator<itk::ImageRegionIterator<ImageType> > it(mask, image, region);\n return EXIT_SUCCESS;\n}\n\n\/\/ Test forward iteration interface\nint otbMaskedIteratorDecoratorForward(int itkNotUsed(argc), char * itkNotUsed(argv) [])\n{\n typedef otb::Image<double, 2> ImageType;\n ImageType::Pointer image = GetTestImage<ImageType>(10, 10);\n ImageType::Pointer mask = GetTestImage<ImageType>(10, 0);\n ImageType::RegionType region(image->GetLargestPossibleRegion());\n FillHalf<ImageType>(mask, region, 1);\n\n otb::MaskedIteratorDecorator<itk::ImageRegionIterator<ImageType> > it(mask, image, region);\n\n it.GoToBegin();\n if (!it.IsAtBegin()) {return EXIT_FAILURE;}\n\n unsigned int loopCount = 0;\n for(; !it.IsAtEnd(); ++it)\n {\n if (loopCount != 0 && it.IsAtBegin()) {return EXIT_FAILURE;}\n if (it.IsAtEnd()) {return EXIT_FAILURE;}\n\n it.Set(it.Value() * 0.42);\n\n loopCount += 1;\n }\n\n if(!it.IsAtEnd()) {return EXIT_FAILURE;}\n return EXIT_SUCCESS;\n}\n\n\/\/ Test reverse iteration interface\nint otbMaskedIteratorDecoratorReverse(int itkNotUsed(argc), char * itkNotUsed(argv) [])\n{\n typedef otb::Image<double, 2> ImageType;\n ImageType::Pointer image = GetTestImage<ImageType>(10, 10);\n ImageType::Pointer mask = GetTestImage<ImageType>(10, 0);\n ImageType::RegionType region(image->GetLargestPossibleRegion());\n FillHalf<ImageType>(mask, region, 1);\n\n otb::MaskedIteratorDecorator<itk::ImageRegionIterator<ImageType> > it(mask, image, region);\n\n it.GoToEnd();\n if (!it.IsAtEnd()) {return EXIT_FAILURE;}\n\n bool beginReached = false;\n do\n {\n --it;\n\n if (it.IsAtEnd()) {return EXIT_FAILURE;}\n if (it.IsAtBegin())\n {\n if (beginReached)\n {\n return EXIT_FAILURE;\n }\n else {\n beginReached = true;\n }\n }\n\n it.Set(it.Value() * 0.42);\n } while (!it.IsAtBegin());\n\n if(!it.IsAtBegin()) {return EXIT_FAILURE;}\n return EXIT_SUCCESS;\n}\n\n\/\/ Check bijection between iterated and non masked\n\/\/ i.e all locations where mask value != 0 are in the iteration (injection)\n\/\/ and mask value != 0 at all iteration locations (surjection)\n\/\/ Templated to test decoration of different iterator types\ntemplate <typename ImageType, template <typename ImageType> typename IteratorType>\nint BijectiveTest()\n{\n typename ImageType::Pointer image = GetTestImage<ImageType>(10, 10);\n typename ImageType::Pointer mask = GetTestImage<ImageType>(10, 0);\n typename ImageType::RegionType region(image->GetLargestPossibleRegion());\n FillHalf<ImageType>(mask, region, 1);\n\n otb::MaskedIteratorDecorator<IteratorType<ImageType> > itDecorated(mask, image, region);\n IteratorType<ImageType> it(image, region);\n\n it.GoToBegin();\n itDecorated.GoToBegin();\n while (!it.IsAtEnd() && itDecorated.IsAtEnd())\n {\n \/\/ Iteration locations are the same\n if (it.GetIndex() != itDecorated.GetIndex()) {return EXIT_FAILURE;}\n\n ++itDecorated;\n do\n {\n ++it;\n } while (mask->GetPixel(it.GetIndex()) == 0 && !it.IsAtEnd());\n }\n return EXIT_SUCCESS;\n}\n\nint otbMaskedIteratorDecoratorBijective(int itkNotUsed(argc), char * itkNotUsed(argv) [])\n{\n typedef otb::Image<double, 2> ImageType;\n return BijectiveTest<ImageType, itk::ImageRegionIterator>()\n && BijectiveTest<ImageType, itk::ImageRegionConstIterator>()\n && BijectiveTest<ImageType, itk::ImageRandomConstIteratorWithIndex>()\n \/\/&& BijectiveTest<ImageType, itk::ImageRegionReverseIterator>() \/\/ IsAtEnd not a const method\n \/\/&& BijectiveTest<ImageType, itk::ImageLinearIteratorWithIndex>(); \/\/ does not implement GoToEnd\n \/\/&& BijectiveTest<ImageType, otb::PolyLineImageIterator>() \/\/ header not found\n && BijectiveTest<ImageType, otb::SubsampledImageRegionIterator>()\n \/\/&& BijectiveTest<ImageType, itk::PathIterator>() \/\/ different template interface, testable but not with BijectiveTest\n \/\/&& BijectiveTest<ImageType, itk::ConditionalConstIterator>() \/\/ abstract class\n \/\/&& BijectiveTest<ImageType, itk::ReflectiveImageRegionIterator>() \/\/ GoToEnd not implemented\n && BijectiveTest<ImageType, itk::ImageRandomIteratorWithIndex>()\n \/\/&& BijectiveTest<ImageType, itk::NeighborhoodIterator>() \/\/ different template interface, testable but not with BijectiveTest\n && BijectiveTest<ImageType, itk::ImageScanlineIterator>()\n \/\/&& BijectiveTest<ImageType, itk::DataObjectIterator>() \/\/ different template interface, testable but not with BijectiveTest\n ;\n}\n\n\/*\nitkQuadEdgeMeshFrontIterator.h\nitkQuadEdgeMeshBaseIterator.h\nitkLineIterator.h\nitkShapedFloodFilledImageFunctionConditionalConstIterator.h\nitkImageConstIteratorWithOnlyIndex.h\nitkCorrespondenceDataStructureIterator.h\nitkChildTreeIterator.h\nitkImageSliceConstIteratorWithIndex.h\nitkImageRegionConstIterator.h\nitkLevelOrderTreeIterator.h\nitkSliceIterator.h\nitkImageRegionConstIteratorWithIndex.h\nitkConstSliceIterator.h\nitkImageRandomNonRepeatingConstIteratorWithIndex.h\nitkTreeIteratorClone.h\nitkImageLinearIteratorWithIndex.h\nitkImageRandomConstIteratorWithOnlyIndex.h\nitkShapedFloodFilledFunctionConditionalConstIterator.h\nitkFloodFilledImageFunctionConditionalConstIterator.h\nitkFloodFilledImageFunctionConditionalIterator.h\nitkImageRegionIteratorWithIndex.h\nitkImageRandomNonRepeatingIteratorWithIndex.h\nitkImageRegionExclusionIteratorWithIndex.h\nitkImageRegionConstIteratorWithOnlyIndex.h\nitkFloodFilledSpatialFunctionConditionalIterator.h\nitkTreeIteratorBase.h\nitkImageScanlineIterator.h\nitkPreOrderTreeIterator.h\nitkFloodFilledSpatialFunctionConditionalConstIterator.h\nitkThreadedIteratorRangePartitioner.h\nitkImageSliceIteratorWithIndex.h\nitkImageConstIteratorWithIndex.h\nitkLineConstIterator.h\nitkShapedFloodFilledImageFunctionConditionalIterator.h\nitkInOrderTreeIterator.h\nitkConditionalConstIterator.h\nitkConstNeighborhoodIteratorWithOnlyIndex.h\nitkImageRegionExclusionConstIteratorWithIndex.h\nitkFloodFilledFunctionConditionalConstIterator.h\nitkRootTreeIterator.h\nitkImageIteratorWithIndex.h\nitkPostOrderTreeIterator.h\nitkImageLinearConstIteratorWithIndex.h\nitkLeafTreeIterator.h\nitkImageScanlineConstIterator.h\n\notbRCC8VertexIterator.txx\notbRCC8EdgeIterator.h\notbRCC8InEdgeIterator.txx\notbRCC8EdgeIterator.txx\notbRCC8OutEdgeIterator.txx\notbRCC8OutEdgeIterator.h\notbRCC8VertexIterator.h\notbRCC8InEdgeIterator.h\n*\/\n<commit_msg>ENH: Improve MaskedIteratorDecorator test<commit_after>\/*=========================================================================\n\n Program: ORFEO Toolbox\n Language: C++\n Date: $Date$\n Version: $Revision$\n\n\n Copyright (c) Centre National d'Etudes Spatiales. All rights reserved.\n See OTBCopyright.txt for details.\n\n\n This software is distributed WITHOUT ANY WARRANTY; without even\n the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR\n PURPOSE. See the above copyright notices for more information.\n\n=========================================================================*\/\n#include <set>\n#include \"otbImage.h\"\n\n#include \"itkImageRegionIterator.h\"\n#include \"itkImageRegionReverseIterator.h\"\n#include \"itkImageRandomIteratorWithIndex.h\"\n#include \"itkImageScanlineIterator.h\"\n#include \"itkImageRandomNonRepeatingIteratorWithIndex.h\"\n#include \"otbSubsampledImageRegionIterator.h\"\n\n#include \"otbMaskedIteratorDecorator.h\"\n\n\/\/ Generate a test image of specified size and value\ntemplate <typename ImageType>\ntypename ImageType::Pointer GetTestImage(itk::SizeValueType fillSize, const typename ImageType::PixelType& value)\n{\n typename ImageType::Pointer image = ImageType::New();\n typename ImageType::SizeType size;\n size.Fill(fillSize);\n\n typename ImageType::RegionType region;\n region.SetSize(size);\n\n image->SetRegions(region);\n image->Allocate();\n image->FillBuffer(value);\n return image;\n}\n\n\/\/ Fill half of the pixels with a value\n\/\/ Used for generating a test mask\ntemplate <typename ImageType>\nvoid FillHalf(typename ImageType::Pointer image, const typename ImageType::RegionType& region, const typename ImageType::PixelType& value)\n{\n itk::ImageRegionIterator<ImageType> it(image, region);\n unsigned int count = 0;\n for(it.GoToBegin(); !it.IsAtEnd(); ++it, ++count)\n {\n if (count % 2 == 0)\n {\n it.Set(value);\n }\n }\n}\n\n\/\/ Test template instanciation\nint otbMaskedIteratorDecoratorNew(int itkNotUsed(argc), char * itkNotUsed(argv) [])\n{\n typedef otb::Image<double, 2> ImageType;\n ImageType::Pointer image = GetTestImage<ImageType>(10, 10);\n ImageType::Pointer mask = GetTestImage<ImageType>(10, 0);\n ImageType::RegionType region(image->GetLargestPossibleRegion());\n\n otb::MaskedIteratorDecorator<itk::ImageRegionIterator<ImageType> > it(mask, image, region);\n return EXIT_SUCCESS;\n}\n\n\/\/ Test forward iteration interface\nint otbMaskedIteratorDecoratorForward(int itkNotUsed(argc), char * itkNotUsed(argv) [])\n{\n typedef otb::Image<double, 2> ImageType;\n ImageType::Pointer image = GetTestImage<ImageType>(10, 10);\n ImageType::Pointer mask = GetTestImage<ImageType>(10, 0);\n ImageType::RegionType region(image->GetLargestPossibleRegion());\n FillHalf<ImageType>(mask, region, 1);\n\n otb::MaskedIteratorDecorator<itk::ImageRegionIterator<ImageType> > it(mask, image, region);\n\n it.GoToBegin();\n if (!it.IsAtBegin()) {return EXIT_FAILURE;}\n\n unsigned int loopCount = 0;\n for(; !it.IsAtEnd(); ++it)\n {\n if (loopCount != 0 && it.IsAtBegin()) {return EXIT_FAILURE;}\n if (it.IsAtEnd()) {return EXIT_FAILURE;}\n\n it.Set(it.Value() * 0.42);\n\n loopCount += 1;\n }\n\n if(!it.IsAtEnd()) {return EXIT_FAILURE;}\n return EXIT_SUCCESS;\n}\n\n\/\/ Test reverse iteration interface\nint otbMaskedIteratorDecoratorReverse(int itkNotUsed(argc), char * itkNotUsed(argv) [])\n{\n typedef otb::Image<double, 2> ImageType;\n ImageType::Pointer image = GetTestImage<ImageType>(10, 10);\n ImageType::Pointer mask = GetTestImage<ImageType>(10, 0);\n ImageType::RegionType region(image->GetLargestPossibleRegion());\n FillHalf<ImageType>(mask, region, 1);\n\n otb::MaskedIteratorDecorator<itk::ImageRegionIterator<ImageType> > it(mask, image, region);\n\n it.GoToEnd();\n if (!it.IsAtEnd()) {return EXIT_FAILURE;}\n\n bool beginReached = false;\n do\n {\n --it;\n\n if (it.IsAtEnd()) {return EXIT_FAILURE;}\n if (it.IsAtBegin())\n {\n if (beginReached)\n {\n return EXIT_FAILURE;\n }\n else {\n beginReached = true;\n }\n }\n\n it.Set(it.Value() * 0.42);\n } while (!it.IsAtBegin());\n\n if(!it.IsAtBegin()) {return EXIT_FAILURE;}\n return EXIT_SUCCESS;\n}\n\n\/\/ Check bijection between iterated and non masked\n\/\/ i.e all locations where mask value != 0 are in the iteration (injection)\n\/\/ and mask value != 0 at all iteration locations (surjection)\n\/\/ Templated to test decoration of different iterator types\ntemplate <typename ImageType, template <typename ImageType> typename IteratorType>\nint BijectiveTest()\n{\n typename ImageType::Pointer image = GetTestImage<ImageType>(10, 10);\n typename ImageType::Pointer mask = GetTestImage<ImageType>(10, 0);\n typename ImageType::RegionType region(image->GetLargestPossibleRegion());\n FillHalf<ImageType>(mask, region, 1);\n\n otb::MaskedIteratorDecorator<IteratorType<ImageType> > itDecorated(mask, image, region);\n IteratorType<ImageType> it(image, region);\n\n it.GoToBegin();\n itDecorated.GoToBegin();\n while (!it.IsAtEnd() && itDecorated.IsAtEnd())\n {\n \/\/ Iteration locations are the same\n if (it.GetIndex() != itDecorated.GetIndex()) {return EXIT_FAILURE;}\n\n ++itDecorated;\n do\n {\n ++it;\n } while (mask->GetPixel(it.GetIndex()) == 0 && !it.IsAtEnd());\n }\n return EXIT_SUCCESS;\n}\n\nint otbMaskedIteratorDecoratorBijective(int itkNotUsed(argc), char * itkNotUsed(argv) [])\n{\n typedef otb::Image<double, 2> ImageType;\n return BijectiveTest<ImageType, itk::ImageRegionIterator>()\n && BijectiveTest<ImageType, itk::ImageRegionConstIterator>()\n && BijectiveTest<ImageType, itk::ImageRandomConstIteratorWithIndex>()\n && BijectiveTest<ImageType, otb::SubsampledImageRegionIterator>()\n && BijectiveTest<ImageType, itk::ImageRandomIteratorWithIndex>()\n && BijectiveTest<ImageType, itk::ImageScanlineIterator>()\n && BijectiveTest<ImageType, itk::ImageScanlineConstIterator>()\n && BijectiveTest<ImageType, itk::ImageRandomNonRepeatingConstIteratorWithIndex>()\n && BijectiveTest<ImageType, itk::ImageRandomNonRepeatingIteratorWithIndex>()\n ;\n\n \/\/ Other iterators potentially compatible:\n\n \/\/ Different template interface, testable but not with BijectiveTest:\n \/\/ itk::PathIterator\n \/\/ itk::NeighborhoodIterator\n \/\/ itk::DataObjectIterator\n\n \/\/ Different constructor, testable but not with BijectiveTest\n \/\/ itk::LineIterator\n \/\/ itk::SliceIterator\n\n \/\/ GoToEnd is not implemented\n \/\/ itk::ImageLinearIteratorWithIndex\n \/\/ itk::ReflectiveImageRegionIterator\n \/\/ itk::ImageRegionExclusionConstIteratorWithIndex\n \/\/ itk::ImageRegionIteratorWithIndex\n\n \/\/ Other problem:\n \/\/ itk::ImageRegionReverseIterator>() \/\/ IsAtEnd not a const method\n \/\/ otb::PolyLineImageIterator>() \/\/ header not found\n \/\/ itk::ImageRandomConstIteratorWithOnlyIndex>() \/\/ no Value method\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 <vespa\/memfilepersistence\/device\/mountpointlist.h>\n#include <vespa\/vespalib\/io\/fileutil.h>\n#include <vespa\/storageframework\/defaultimplementation\/clock\/fakeclock.h>\n#include <vespa\/vdstestlib\/cppunit\/macros.h>\n\nusing vespalib::fileExists;\nusing vespalib::isDirectory;\nusing vespalib::isSymLink;\nusing vespalib::readLink;\n\nnamespace storage {\n\nnamespace memfile {\n\nclass MountPointList_Test : public CppUnit::TestFixture {\n CPPUNIT_TEST_SUITE(MountPointList_Test);\n CPPUNIT_TEST(testScanning);\n CPPUNIT_TEST(testStatusFile);\n CPPUNIT_TEST(testInitDisks);\n CPPUNIT_TEST_SUITE_END();\n\n static const std::string _prefix;\n\npublic:\n void testScanning();\n void testStatusFile();\n void testInitDisks();\n\n void init();\n void tearDown() override;\n\n framework::defaultimplementation::FakeClock _clock;\n\nprivate:\n DeviceManager::UP newDeviceManager() {\n return DeviceManager::UP(\n new DeviceManager(\n DeviceMapper::UP(new SimpleDeviceMapper),\n _clock));\n }\n};\n\nCPPUNIT_TEST_SUITE_REGISTRATION(MountPointList_Test);\n\nconst std::string MountPointList_Test::_prefix(\".\/vdsroot\");\n\nnamespace {\n void run(const std::string& cmd) {\n CPPUNIT_ASSERT_MESSAGE(cmd, system(cmd.c_str()) == 0);\n }\n}\n\nvoid MountPointList_Test::init()\n{\n tearDown();\n run(\"rm -rf \"+_prefix);\n run(\"mkdir -p \"+_prefix+\"\/disks\");\n\n run(\"mkdir \"+_prefix+\"\/disks\/d0\"); \/\/ Regular dir\n run(\"mkdir \"+_prefix+\"\/disks\/d1\"); \/\/ Inaccessible dir\n run(\"chmod 000 \"+_prefix+\"\/disks\/d1\");\n run(\"mkdir \"+_prefix+\"\/disks\/D2\"); \/\/ Wrongly named dir\n run(\"mkdir \"+_prefix+\"\/disks\/d3\"); \/\/ Regular non-empty dir\n run(\"touch \"+_prefix+\"\/disks\/d3\/foo\");\n run(\"touch \"+_prefix+\"\/disks\/d4\"); \/\/ Not a dir\n run(\"ln -s D2 \"+_prefix+\"\/disks\/d5\"); \/\/ Symlink to dir\n run(\"ln -s d4 \"+_prefix+\"\/disks\/d6\"); \/\/ Symlink to file\n}\n\nvoid MountPointList_Test::tearDown()\n{\n try{\n if (fileExists(_prefix+\"\/disks\/d1\")) {\n run(\"chmod 755 \"+_prefix+\"\/disks\/d1\");\n }\n } catch (std::exception& e) {\n std::cerr << \"Failed to clean up: \" << e.what() << \"\\n\";\n }\n}\n\nvoid MountPointList_Test::testScanning()\n{\n init();\n MountPointList list(_prefix,\n std::vector<vespalib::string>(),\n DeviceManager::UP(\n new DeviceManager(\n DeviceMapper::UP(new SimpleDeviceMapper),\n _clock)));\n list.scanForDisks();\n\n \/\/ Check that we got the expected entries.\n CPPUNIT_ASSERT_EQUAL(7u, list.getSize());\n\n for (uint32_t i=0; i<7u; ++i) {\n std::ostringstream ost;\n ost << _prefix << \"\/disks\/d\" << i;\n CPPUNIT_ASSERT_EQUAL(ost.str(), list[i].getPath());\n }\n\n \/\/ Note.. scanForDisks() should not in any circumstances access the\n \/\/ disks. Thus it should not know that d1 is inaccessible, or that d6\n \/\/ is actually a symlink to a file\n CPPUNIT_ASSERT_EQUAL(Device::OK, list[0].getState());\n CPPUNIT_ASSERT_EQUAL(Device::OK, list[1].getState());\n CPPUNIT_ASSERT_EQUAL(Device::NOT_FOUND, list[2].getState());\n CPPUNIT_ASSERT_EQUAL(Device::OK, list[3].getState());\n CPPUNIT_ASSERT_EQUAL(Device::PATH_FAILURE, list[4].getState());\n CPPUNIT_ASSERT_EQUAL(Device::OK, list[5].getState());\n CPPUNIT_ASSERT_EQUAL(Device::OK, list[6].getState());\n\n list.verifyHealthyDisks(-1);\n CPPUNIT_ASSERT_EQUAL(Device::OK, list[0].getState());\n CPPUNIT_ASSERT_EQUAL(Device::NO_PERMISSION, list[1].getState());\n CPPUNIT_ASSERT_EQUAL(Device::NOT_FOUND, list[2].getState());\n CPPUNIT_ASSERT_EQUAL(Device::INTERNAL_FAILURE, list[3].getState());\n CPPUNIT_ASSERT_EQUAL(Device::PATH_FAILURE, list[4].getState());\n CPPUNIT_ASSERT_EQUAL(Device::OK, list[5].getState());\n CPPUNIT_ASSERT_EQUAL(Device::PATH_FAILURE, list[6].getState());\n}\n\nvoid MountPointList_Test::testStatusFile()\n{\n init();\n std::string statusFileName(_prefix + \"\/disks.status\");\n\n \/\/ Try reading non-existing file, and writing a file\n {\n MountPointList list(_prefix,\n std::vector<vespalib::string>(),\n DeviceManager::UP(\n new DeviceManager(\n DeviceMapper::UP(new SimpleDeviceMapper),\n _clock)));\n\n _clock.setAbsoluteTimeInSeconds(5678);\n list.scanForDisks();\n\n \/\/ File does not currently exist, that should be ok though.\n list.readFromFile();\n list.verifyHealthyDisks(-1);\n CPPUNIT_ASSERT_EQUAL(7u, list.getSize());\n list[5].addEvent(IOEvent(1234, Device::IO_FAILURE, \"Argh\", \"Hmm\"));\n CPPUNIT_ASSERT_EQUAL(Device::IO_FAILURE, list[5].getState());\n\n \/\/ Write to file.\n list.writeToFile();\n }\n\n \/\/ Check contents of file.\n {\n std::ifstream in(statusFileName.c_str());\n std::string line;\n CPPUNIT_ASSERT(std::getline(in, line));\n\n CPPUNIT_ASSERT_PREFIX(\n std::string(_prefix + \"\/disks\/d1 3 5678 IoException: NO PERMISSION: \"\n \"open(.\/vdsroot\/disks\/d1\/chunkinfo, 0x1): Failed, \"\n \"errno(13): Permission denied\"),\n line);\n CPPUNIT_ASSERT(std::getline(in, line));\n CPPUNIT_ASSERT_PREFIX(\n std::string(_prefix +\"\/disks\/d2 1 5678 Disk not found during scanning of \"\n \"disks directory\"),\n line);\n CPPUNIT_ASSERT(std::getline(in, line));\n CPPUNIT_ASSERT_PREFIX(\n std::string(_prefix + \"\/disks\/d3 4 5678 Foreign data in mountpoint. New \"\n \"mountpoints added should be empty.\"),\n line);\n CPPUNIT_ASSERT(std::getline(in, line));\n CPPUNIT_ASSERT_PREFIX(\n std::string(_prefix + \"\/disks\/d4 2 5678 File d4 in disks directory is not \"\n \"a directory.\"),\n line);\n CPPUNIT_ASSERT(std::getline(in, line));\n CPPUNIT_ASSERT_PREFIX(std::string(_prefix + \"\/disks\/d5 5 1234 Argh\"),\n line);\n CPPUNIT_ASSERT(std::getline(in, line));\n CPPUNIT_ASSERT_PREFIX(\n std::string(_prefix + \"\/disks\/d6 2 5678 The path exist, but is not a \"\n \"directory.\"),\n line);\n CPPUNIT_ASSERT(std::getline(in, line));\n CPPUNIT_ASSERT_EQUAL(std::string(\"EOF\"), line);\n }\n\n \/\/ Starting over to get new device instances.\n \/\/ Scan disk, read file, and check that erronious disks are not used.\n {\n MountPointList list(_prefix,\n std::vector<vespalib::string>(),\n DeviceManager::UP(\n new DeviceManager(\n DeviceMapper::UP(new SimpleDeviceMapper),\n _clock)));\n list.scanForDisks();\n list.readFromFile();\n \/\/ Check that we got the expected entries.\n CPPUNIT_ASSERT_EQUAL(7u, list.getSize());\n\n \/\/ Note.. scanForDisks() should not under any circumstance access the\n \/\/ disks. Thus it should not know that d1 is inaccessible.\n CPPUNIT_ASSERT_EQUAL(Device::OK, list[0].getState());\n CPPUNIT_ASSERT_EQUAL(Device::NO_PERMISSION, list[1].getState());\n CPPUNIT_ASSERT_EQUAL(Device::NOT_FOUND, list[2].getState());\n CPPUNIT_ASSERT_EQUAL(Device::INTERNAL_FAILURE, list[3].getState());\n CPPUNIT_ASSERT_EQUAL(Device::PATH_FAILURE, list[4].getState());\n CPPUNIT_ASSERT_EQUAL(Device::IO_FAILURE, list[5].getState());\n CPPUNIT_ASSERT_EQUAL(Device::PATH_FAILURE, list[6].getState());\n }\n}\n\nvoid MountPointList_Test::testInitDisks()\n{\n vespalib::string d3target = \"d3target\";\n vespalib::string foodev = _prefix + \"\/foodev\";\n vespalib::string bardev = _prefix + \"\/bardev\";\n\n tearDown();\n run(\"rm -rf \" + _prefix);\n run(\"mkdir -p \" + _prefix + \"\/disks\/d2\");\n run(\"ln -s \" + d3target + \" \" + _prefix + \"\/disks\/d3\");\n\n std::vector<vespalib::string> diskPaths {\n \/\/ disks\/d0 should become a regular directory\n _prefix + \"\/disks\/d0\",\n \/\/ disks\/d1 should be a symlink to \/foo\n foodev,\n \/\/ disks\/d2 should already be a directory\n \"\/ignored\",\n \/\/ disks\/d3 should already be a symlink\n \"\/ignored2\"\n };\n\n MountPointList list(_prefix, diskPaths, newDeviceManager());\n list.initDisks();\n\n CPPUNIT_ASSERT(isDirectory(_prefix + \"\/disks\"));\n CPPUNIT_ASSERT(isDirectory(_prefix + \"\/disks\/d0\"));\n CPPUNIT_ASSERT(isSymLink(_prefix + \"\/disks\/d1\"));\n CPPUNIT_ASSERT_EQUAL(foodev, readLink(_prefix + \"\/disks\/d1\"));\n CPPUNIT_ASSERT(isDirectory(_prefix + \"\/disks\/d2\"));\n CPPUNIT_ASSERT(isSymLink(_prefix + \"\/disks\/d3\"));\n CPPUNIT_ASSERT_EQUAL(d3target, readLink(_prefix + \"\/disks\/d3\"));\n}\n\n} \/\/ memfile\n\n} \/\/ storage\n<commit_msg>Enable test to run as root<commit_after>\/\/ Copyright 2017 Yahoo Holdings. Licensed under the terms of the Apache 2.0 license. See LICENSE in the project root.\n\n#include <vespa\/memfilepersistence\/device\/mountpointlist.h>\n#include <vespa\/vespalib\/io\/fileutil.h>\n#include <vespa\/storageframework\/defaultimplementation\/clock\/fakeclock.h>\n#include <vespa\/vdstestlib\/cppunit\/macros.h>\n\nusing vespalib::fileExists;\nusing vespalib::isDirectory;\nusing vespalib::isSymLink;\nusing vespalib::readLink;\n\nnamespace storage {\n\nnamespace memfile {\n\nclass MountPointList_Test : public CppUnit::TestFixture {\n CPPUNIT_TEST_SUITE(MountPointList_Test);\n CPPUNIT_TEST(testScanning);\n CPPUNIT_TEST(testStatusFile);\n CPPUNIT_TEST(testInitDisks);\n CPPUNIT_TEST_SUITE_END();\n\n static const std::string _prefix;\n\npublic:\n void testScanning();\n void testStatusFile();\n void testInitDisks();\n\n void init();\n void tearDown() override;\n\n framework::defaultimplementation::FakeClock _clock;\n\nprivate:\n DeviceManager::UP newDeviceManager() {\n return DeviceManager::UP(\n new DeviceManager(\n DeviceMapper::UP(new SimpleDeviceMapper),\n _clock));\n }\n};\n\nCPPUNIT_TEST_SUITE_REGISTRATION(MountPointList_Test);\n\nconst std::string MountPointList_Test::_prefix(\".\/vdsroot\");\n\nnamespace {\n void run(const std::string& cmd) {\n CPPUNIT_ASSERT_MESSAGE(cmd, system(cmd.c_str()) == 0);\n }\n}\n\nvoid MountPointList_Test::init()\n{\n tearDown();\n run(\"rm -rf \"+_prefix);\n run(\"mkdir -p \"+_prefix+\"\/disks\");\n\n run(\"mkdir \"+_prefix+\"\/disks\/d0\"); \/\/ Regular dir\n \/\/ disks\/d1 intentionally missing\n run(\"mkdir \"+_prefix+\"\/disks\/D2\"); \/\/ Wrongly named dir\n run(\"mkdir \"+_prefix+\"\/disks\/d3\"); \/\/ Regular non-empty dir\n run(\"touch \"+_prefix+\"\/disks\/d3\/foo\");\n run(\"touch \"+_prefix+\"\/disks\/d4\"); \/\/ Not a dir\n run(\"ln -s D2 \"+_prefix+\"\/disks\/d5\"); \/\/ Symlink to dir\n run(\"ln -s d4 \"+_prefix+\"\/disks\/d6\"); \/\/ Symlink to file\n}\n\nvoid MountPointList_Test::tearDown() {}\n\nvoid MountPointList_Test::testScanning()\n{\n init();\n MountPointList list(_prefix,\n std::vector<vespalib::string>(),\n DeviceManager::UP(\n new DeviceManager(\n DeviceMapper::UP(new SimpleDeviceMapper),\n _clock)));\n list.scanForDisks();\n\n \/\/ Check that we got the expected entries.\n CPPUNIT_ASSERT_EQUAL(7u, list.getSize());\n\n for (uint32_t i=0; i<7u; ++i) {\n std::ostringstream ost;\n ost << _prefix << \"\/disks\/d\" << i;\n CPPUNIT_ASSERT_EQUAL(ost.str(), list[i].getPath());\n }\n\n \/\/ Note.. scanForDisks() should not in any circumstances access the\n \/\/ disks. Thus it should not know that d1 is inaccessible, or that d6\n \/\/ is actually a symlink to a file\n CPPUNIT_ASSERT_EQUAL(Device::OK, list[0].getState());\n CPPUNIT_ASSERT_EQUAL(Device::NOT_FOUND, list[1].getState());\n CPPUNIT_ASSERT_EQUAL(Device::NOT_FOUND, list[2].getState());\n CPPUNIT_ASSERT_EQUAL(Device::OK, list[3].getState());\n CPPUNIT_ASSERT_EQUAL(Device::PATH_FAILURE, list[4].getState());\n CPPUNIT_ASSERT_EQUAL(Device::OK, list[5].getState());\n CPPUNIT_ASSERT_EQUAL(Device::OK, list[6].getState());\n\n list.verifyHealthyDisks(-1);\n CPPUNIT_ASSERT_EQUAL(Device::OK, list[0].getState());\n CPPUNIT_ASSERT_EQUAL(Device::NOT_FOUND, list[1].getState());\n CPPUNIT_ASSERT_EQUAL(Device::NOT_FOUND, list[2].getState());\n CPPUNIT_ASSERT_EQUAL(Device::INTERNAL_FAILURE, list[3].getState());\n CPPUNIT_ASSERT_EQUAL(Device::PATH_FAILURE, list[4].getState());\n CPPUNIT_ASSERT_EQUAL(Device::OK, list[5].getState());\n CPPUNIT_ASSERT_EQUAL(Device::PATH_FAILURE, list[6].getState());\n}\n\nvoid MountPointList_Test::testStatusFile()\n{\n init();\n std::string statusFileName(_prefix + \"\/disks.status\");\n\n \/\/ Try reading non-existing file, and writing a file\n {\n MountPointList list(_prefix,\n std::vector<vespalib::string>(),\n DeviceManager::UP(\n new DeviceManager(\n DeviceMapper::UP(new SimpleDeviceMapper),\n _clock)));\n\n _clock.setAbsoluteTimeInSeconds(5678);\n list.scanForDisks();\n\n \/\/ File does not currently exist, that should be ok though.\n list.readFromFile();\n list.verifyHealthyDisks(-1);\n CPPUNIT_ASSERT_EQUAL(7u, list.getSize());\n list[5].addEvent(IOEvent(1234, Device::IO_FAILURE, \"Argh\", \"Hmm\"));\n CPPUNIT_ASSERT_EQUAL(Device::IO_FAILURE, list[5].getState());\n\n \/\/ Write to file.\n list.writeToFile();\n }\n\n \/\/ Check contents of file.\n {\n std::ifstream in(statusFileName.c_str());\n std::string line;\n CPPUNIT_ASSERT(std::getline(in, line));\n\n CPPUNIT_ASSERT_PREFIX(\n std::string(_prefix + \"\/disks\/d1 1 5678 Disk not found \"\n \"during scanning of disks directory\"),\n line);\n CPPUNIT_ASSERT(std::getline(in, line));\n CPPUNIT_ASSERT_PREFIX(\n std::string(_prefix +\"\/disks\/d2 1 5678 Disk not found during scanning of \"\n \"disks directory\"),\n line);\n CPPUNIT_ASSERT(std::getline(in, line));\n CPPUNIT_ASSERT_PREFIX(\n std::string(_prefix + \"\/disks\/d3 4 5678 Foreign data in mountpoint. New \"\n \"mountpoints added should be empty.\"),\n line);\n CPPUNIT_ASSERT(std::getline(in, line));\n CPPUNIT_ASSERT_PREFIX(\n std::string(_prefix + \"\/disks\/d4 2 5678 File d4 in disks directory is not \"\n \"a directory.\"),\n line);\n CPPUNIT_ASSERT(std::getline(in, line));\n CPPUNIT_ASSERT_PREFIX(std::string(_prefix + \"\/disks\/d5 5 1234 Argh\"),\n line);\n CPPUNIT_ASSERT(std::getline(in, line));\n CPPUNIT_ASSERT_PREFIX(\n std::string(_prefix + \"\/disks\/d6 2 5678 The path exist, but is not a \"\n \"directory.\"),\n line);\n CPPUNIT_ASSERT(std::getline(in, line));\n CPPUNIT_ASSERT_EQUAL(std::string(\"EOF\"), line);\n }\n\n \/\/ Starting over to get new device instances.\n \/\/ Scan disk, read file, and check that erronious disks are not used.\n {\n MountPointList list(_prefix,\n std::vector<vespalib::string>(),\n DeviceManager::UP(\n new DeviceManager(\n DeviceMapper::UP(new SimpleDeviceMapper),\n _clock)));\n list.scanForDisks();\n list.readFromFile();\n \/\/ Check that we got the expected entries.\n CPPUNIT_ASSERT_EQUAL(7u, list.getSize());\n\n \/\/ Note.. scanForDisks() should not under any circumstance access the\n \/\/ disks. Thus it should not know that d1 is inaccessible.\n CPPUNIT_ASSERT_EQUAL(Device::OK, list[0].getState());\n CPPUNIT_ASSERT_EQUAL(Device::NOT_FOUND, list[1].getState());\n CPPUNIT_ASSERT_EQUAL(Device::NOT_FOUND, list[2].getState());\n CPPUNIT_ASSERT_EQUAL(Device::INTERNAL_FAILURE, list[3].getState());\n CPPUNIT_ASSERT_EQUAL(Device::PATH_FAILURE, list[4].getState());\n CPPUNIT_ASSERT_EQUAL(Device::IO_FAILURE, list[5].getState());\n CPPUNIT_ASSERT_EQUAL(Device::PATH_FAILURE, list[6].getState());\n }\n}\n\nvoid MountPointList_Test::testInitDisks()\n{\n vespalib::string d3target = \"d3target\";\n vespalib::string foodev = _prefix + \"\/foodev\";\n vespalib::string bardev = _prefix + \"\/bardev\";\n\n tearDown();\n run(\"rm -rf \" + _prefix);\n run(\"mkdir -p \" + _prefix + \"\/disks\/d2\");\n run(\"ln -s \" + d3target + \" \" + _prefix + \"\/disks\/d3\");\n\n std::vector<vespalib::string> diskPaths {\n \/\/ disks\/d0 should become a regular directory\n _prefix + \"\/disks\/d0\",\n \/\/ disks\/d1 should be a symlink to \/foo\n foodev,\n \/\/ disks\/d2 should already be a directory\n \"\/ignored\",\n \/\/ disks\/d3 should already be a symlink\n \"\/ignored2\"\n };\n\n MountPointList list(_prefix, diskPaths, newDeviceManager());\n list.initDisks();\n\n CPPUNIT_ASSERT(isDirectory(_prefix + \"\/disks\"));\n CPPUNIT_ASSERT(isDirectory(_prefix + \"\/disks\/d0\"));\n CPPUNIT_ASSERT(isSymLink(_prefix + \"\/disks\/d1\"));\n CPPUNIT_ASSERT_EQUAL(foodev, readLink(_prefix + \"\/disks\/d1\"));\n CPPUNIT_ASSERT(isDirectory(_prefix + \"\/disks\/d2\"));\n CPPUNIT_ASSERT(isSymLink(_prefix + \"\/disks\/d3\"));\n CPPUNIT_ASSERT_EQUAL(d3target, readLink(_prefix + \"\/disks\/d3\"));\n}\n\n} \/\/ memfile\n\n} \/\/ storage\n\n<|endoftext|>"} {"text":"<commit_before>\/*=========================================================================\n\n Program: Insight Segmentation & Registration Toolkit\n Module: itkEllipsoidInteriorExteriorSpatialFunctionTest.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#if defined(_MSC_VER)\n#pragma warning ( disable : 4786 )\n#endif\n\n#include \"itkEllipsoidInteriorExteriorSpatialFunction.h\"\n#include \"vnl\/vnl_matrix.h\"\n\nint itkEllipsoidInteriorExteriorSpatialFunctionTest(int, char* [] )\n{\n std::cout << \"itkEllipsoidInteriorExteriorSpatialFunction test start\" << std::endl;\n\n \/\/ Test will create an ellipsoid (3-dimensional)\n const unsigned int dimension = 3;\n\n \/\/ Ellipsoid spatial function typedef\n typedef itk::EllipsoidInteriorExteriorSpatialFunction<3> TEllipsoidFunctionType;\n\n \/\/ Point position typedef\n typedef TEllipsoidFunctionType::InputType TEllipsoidFunctionVectorType;\n\n \/\/ Create an ellipsoid spatial function for the source image\n TEllipsoidFunctionType::Pointer spatialFunc = TEllipsoidFunctionType::New();\n \/\/ Define and set the axes lengths for the ellipsoid\n TEllipsoidFunctionVectorType axes;\n axes[0] = 40;\n axes[1] = 30;\n axes[2] = 20;\n spatialFunc->SetAxes(axes);\n\n \/\/ Define function doitkEllipsoidInteriorExteriorSpatialFunctionTest, which encapsulates ellipsoid.\n int xExtent = 50;\n int yExtent = 50;\n int zExtent = 50;\n\n \/\/ Define and set the center of the ellipsoid in the center of\n \/\/ the function doitkEllipsoidInteriorExteriorSpatialFunctionTest\n TEllipsoidFunctionVectorType center;\n center[0] = xExtent\/2;\n center[1] = yExtent\/2;\n center[2] = zExtent\/2;\n spatialFunc->SetCenter(center);\n\n \/\/ Define the orientations of the ellipsoid axes\n \/\/ (0,1,0) corresponds to the axes of length axes[0]\n \/\/ (1,0,0) corresponds to the axes of length axes[1]\n \/\/ (0,0,1) corresponds to the axes of lenght axes[2]\n double data[] = {0, 1, 0, 1, 0, 0, 0, 0, 1};\n vnl_matrix<double> orientations (data, 3, 3); \n \n \/\/ Set the orientations of the ellipsoids\n spatialFunc->SetOrientations(orientations);\n \n \/\/ Evaluate all points in the spatial function and count the number of\n \/\/ pixels that are inside the sphere.\n double testPosition[dimension]; \/\/ position of a pixel in the function doitkEllipsoidInteriorExteriorSpatialFunctionTest\n\n bool functionValue; \/\/ Value of pixel at a given position\n int interiorPixelCounter = 0; \/\/ Count pixels inside ellipsoid\n\n for(int x = 0; x < xExtent; x++)\n {\n for(int y = 0; y < yExtent; y++)\n {\n for(int z =0; z < zExtent; z++)\n {\n testPosition[0] = x;\n testPosition[1] = y;\n testPosition[2] = z;\n functionValue = spatialFunc->Evaluate(testPosition);\n if(functionValue == 1)\n interiorPixelCounter ++;\n }\n }\n }\n \n \/\/ Evaluate the center of the ellipsoid, which is inside the ellipsoid and \n \/\/ should equal 1.\n testPosition[0] = center[0];\n testPosition[1] = center[1];\n testPosition[2] = center[2];\n functionValue = spatialFunc->Evaluate(testPosition);\n \n \/\/ Volume of ellipsoid using V=(4\/3)*pi*(a\/2)*(b\/2)*(c\/2)\n double volume = 4.18879013333*(axes[0]\/2)*(axes[1]\/2)*(axes[2]\/2); \n \n \/\/ Percent difference in volume measurement and calculation\n double volumeError = (fabs(volume - interiorPixelCounter)\/volume)*100; \n\n std::cout << spatialFunc;\n \n \/\/ 5% error was randomly chosen as a successful ellipsoid fill.\n \/\/ This should actually be some function of the image\/ellipsoid size.\n if(volumeError <= 5 || functionValue == 1)\n {\n \n \/\/ With testing settings, results should yield:\n \/\/ calculated ellipsoid volume = 12566.4 pixels\n \/\/ measured ellipsoid volume = 12428 pixels\n \/\/ volume error = 1.10907%\n \/\/ function value = 1\n std::cout << \"calculated ellipsoid volume = \" << volume << std::endl\n << \"measured ellipsoid volume = \" << interiorPixelCounter << std::endl\n << \"volume error = \" << volumeError << \"%\" << std::endl\n << \"function value = \" << functionValue << std::endl\n << \"itkEllipsoidSpatialFunction ended successfully!\" << std::endl; \n return EXIT_SUCCESS;\n }\n else\n {\n std::cerr << \"calculated ellipsoid volume = \" << volume << std::endl\n << \"measured ellipsoid volume = \" << interiorPixelCounter << std::endl\n << \"volume error = \" << volumeError << \"%\" << std::endl\n << \"function value = \" << functionValue << std::endl\n << \"itkEllipsoidSpatialFunction failed :(\" << std::endl;\n return EXIT_FAILURE;\n }\n}\n<commit_msg>ENH: Call to Get Center and Get Axes to increase coverage<commit_after>\/*=========================================================================\n\n Program: Insight Segmentation & Registration Toolkit\n Module: itkEllipsoidInteriorExteriorSpatialFunctionTest.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#if defined(_MSC_VER)\n#pragma warning ( disable : 4786 )\n#endif\n\n#include \"itkEllipsoidInteriorExteriorSpatialFunction.h\"\n#include \"vnl\/vnl_matrix.h\"\n\nint itkEllipsoidInteriorExteriorSpatialFunctionTest(int, char* [] )\n{\n std::cout << \"itkEllipsoidInteriorExteriorSpatialFunction test start\" << std::endl;\n\n \/\/ Test will create an ellipsoid (3-dimensional)\n const unsigned int dimension = 3;\n\n \/\/ Ellipsoid spatial function typedef\n typedef itk::EllipsoidInteriorExteriorSpatialFunction<3> TEllipsoidFunctionType;\n\n \/\/ Point position typedef\n typedef TEllipsoidFunctionType::InputType TEllipsoidFunctionVectorType;\n\n \/\/ Create an ellipsoid spatial function for the source image\n TEllipsoidFunctionType::Pointer spatialFunc = TEllipsoidFunctionType::New();\n \/\/ Define and set the axes lengths for the ellipsoid\n TEllipsoidFunctionVectorType axes;\n axes[0] = 40;\n axes[1] = 30;\n axes[2] = 20;\n spatialFunc->SetAxes(axes);\n\n \/\/ Define function doitkEllipsoidInteriorExteriorSpatialFunctionTest, which encapsulates ellipsoid.\n int xExtent = 50;\n int yExtent = 50;\n int zExtent = 50;\n\n \/\/ Define and set the center of the ellipsoid in the center of\n \/\/ the function doitkEllipsoidInteriorExteriorSpatialFunctionTest\n TEllipsoidFunctionVectorType center;\n center[0] = xExtent\/2;\n center[1] = yExtent\/2;\n center[2] = zExtent\/2;\n spatialFunc->SetCenter(center);\n\n \/\/ Define the orientations of the ellipsoid axes\n \/\/ (0,1,0) corresponds to the axes of length axes[0]\n \/\/ (1,0,0) corresponds to the axes of length axes[1]\n \/\/ (0,0,1) corresponds to the axes of lenght axes[2]\n double data[] = {0, 1, 0, 1, 0, 0, 0, 0, 1};\n vnl_matrix<double> orientations (data, 3, 3); \n \n \/\/ Set the orientations of the ellipsoids\n spatialFunc->SetOrientations(orientations);\n \n \/\/ Evaluate all points in the spatial function and count the number of\n \/\/ pixels that are inside the sphere.\n double testPosition[dimension]; \/\/ position of a pixel in the function doitkEllipsoidInteriorExteriorSpatialFunctionTest\n\n bool functionValue; \/\/ Value of pixel at a given position\n int interiorPixelCounter = 0; \/\/ Count pixels inside ellipsoid\n\n for(int x = 0; x < xExtent; x++)\n {\n for(int y = 0; y < yExtent; y++)\n {\n for(int z =0; z < zExtent; z++)\n {\n testPosition[0] = x;\n testPosition[1] = y;\n testPosition[2] = z;\n functionValue = spatialFunc->Evaluate(testPosition);\n if(functionValue == 1)\n interiorPixelCounter ++;\n }\n }\n }\n \n \/\/ Evaluate the center of the ellipsoid, which is inside the ellipsoid and \n \/\/ should equal 1.\n testPosition[0] = center[0];\n testPosition[1] = center[1];\n testPosition[2] = center[2];\n functionValue = spatialFunc->Evaluate(testPosition);\n \n \/\/ Volume of ellipsoid using V=(4\/3)*pi*(a\/2)*(b\/2)*(c\/2)\n double volume = 4.18879013333*(axes[0]\/2)*(axes[1]\/2)*(axes[2]\/2); \n \n \/\/ Percent difference in volume measurement and calculation\n double volumeError = (fabs(volume - interiorPixelCounter)\/volume)*100; \n\n std::cout << spatialFunc;\n \n \/\/ 5% error was randomly chosen as a successful ellipsoid fill.\n \/\/ This should actually be some function of the image\/ellipsoid size.\n if(volumeError <= 5 || functionValue == 1)\n {\n \n \/\/ With testing settings, results should yield:\n \/\/ calculated ellipsoid volume = 12566.4 pixels\n \/\/ measured ellipsoid volume = 12428 pixels\n \/\/ volume error = 1.10907%\n \/\/ function value = 1\n std::cout << \"calculated ellipsoid volume = \" << volume << std::endl\n << \"measured ellipsoid volume = \" << interiorPixelCounter << std::endl\n << \"volume error = \" << volumeError << \"%\" << std::endl\n << \"function value = \" << functionValue << std::endl\n << \"center location = (\" << spatialFunc->GetCenter()[0] << \", \" << spatialFunc->GetCenter()[0]\n << \", \" << spatialFunc->GetCenter()[2] << \")\" << std::endl\n << \"major axis length = \" << spatialFunc->GetAxes()[0] << \" minor axis 1 length = \" \n << spatialFunc->GetAxes()[1] << \" minor axis 2 length = \" << spatialFunc->GetAxes()[2] << std::endl\n << \"itkEllipsoidSpatialFunction ended successfully!\" << std::endl; \n return EXIT_SUCCESS;\n }\n else\n {\n std::cerr << \"calculated ellipsoid volume = \" << volume << std::endl\n << \"measured ellipsoid volume = \" << interiorPixelCounter << std::endl\n << \"volume error = \" << volumeError << \"%\" << std::endl\n << \"function value = \" << functionValue << std::endl\n << \"center location = (\" << spatialFunc->GetCenter()[0] << \", \" << spatialFunc->GetCenter()[0]\n << \", \" << spatialFunc->GetCenter()[2] << \")\" << std::endl\n << \"major axis length = \" << spatialFunc->GetAxes()[0] << \" minor axis 1 length = \" \n << spatialFunc->GetAxes()[1] << \" minor axis 2 length = \" << spatialFunc->GetAxes()[2] << std::endl\n << \"itkEllipsoidSpatialFunction failed :(\" << std::endl;\n return EXIT_FAILURE;\n }\n}\n<|endoftext|>"} {"text":"<commit_before>\n#include \"GuiObject.hpp\"\n#include \"PythonHelpers.h\"\n\n\nint GuiObject::init(PyObject* args, PyObject* kwds) {\n\t\/\/ If the GuiObject type has no base set,\n\t\/\/ grab _GuiObject from the gui module and set it as the base.\n\tPyTypeObject* const selfType = &GuiObject_Type;\n\tif(selfType->tp_base == NULL || selfType->tp_base == &PyBaseObject_Type) {\n\t\tuninitTypeObject(selfType);\n\n\t\tPyObject* base = modAttrChain(\"gui\", \"_GuiObject\");\n\t\tif(!base || PyErr_Occurred()) {\n\t\t\tif(PyErr_Occurred())\n\t\t\t\tPyErr_Print();\n\t\t\tPy_FatalError(\"Did not found gui._GuiObject.\");\n\t\t}\n\t\tif(!PyClass_Check(base))\n\t\t\tPy_FatalError(\"gui._GuiObject is not a class.\");\n\t\tselfType->tp_bases = PyTuple_Pack(1, base);\n\t\tPy_DECREF(base);\n\t\t\n\t\tif(PyType_Ready(selfType) < 0)\n\t\t\tPy_FatalError(\"Was not able to reinit type GuiObject.\");\n\t}\n\t\n\tDefaultSpace = Vec(8,8);\n\tOuterSpace = Vec(8,8);\n\treturn 0;\n}\n\n\nPyObject* Vec::asPyObject() const {\n\tPyObject* t = PyTuple_New(2);\n\tif(!t) return NULL;\n\tPyTuple_SET_ITEM(t, 0, PyInt_FromLong(x));\n\tPyTuple_SET_ITEM(t, 1, PyInt_FromLong(y));\n\treturn t;\n}\n\nPyObject* Autoresize::asPyObject() const {\n\tPyObject* t = PyTuple_New(4);\n\tif(!t) return NULL;\n\tPyTuple_SET_ITEM(t, 0, PyBool_FromLong(x));\n\tPyTuple_SET_ITEM(t, 1, PyBool_FromLong(y));\n\tPyTuple_SET_ITEM(t, 2, PyBool_FromLong(w));\n\tPyTuple_SET_ITEM(t, 3, PyBool_FromLong(h));\n\treturn t;\n}\n\nbool Vec::initFromPyObject(PyObject* obj) {\n\tif(!PyTuple_Check(obj)) {\n\t\tPyErr_Format(PyExc_ValueError, \"Vec: We expect a tuple\");\n\t\treturn false;\n\t}\n\tif(PyTuple_GET_SIZE(obj) != 2) {\n\t\tPyErr_Format(PyExc_ValueError, \"Vec: We expect a tuple with 2 elements\");\n\t\treturn false;\n\t}\n\tx = (int)PyInt_AsLong(PyTuple_GET_ITEM(obj, 0));\n\ty = (int)PyInt_AsLong(PyTuple_GET_ITEM(obj, 1));\n\tif(PyErr_Occurred())\n\t\treturn false;\n\treturn true;\n}\n\nbool Autoresize::initFromPyObject(PyObject* obj) {\n\tif(!PyTuple_Check(obj)) {\n\t\tPyErr_Format(PyExc_ValueError, \"Autoresize: We expect a tuple\");\n\t\treturn false;\n\t}\n\tif(PyTuple_GET_SIZE(obj) != 4) {\n\t\tPyErr_Format(PyExc_ValueError, \"Autoresize: We expect a tuple with 4 elements\");\n\t\treturn false;\n\t}\n\tx = PyObject_IsTrue(PyTuple_GET_ITEM(obj, 0));\n\ty = PyObject_IsTrue(PyTuple_GET_ITEM(obj, 1));\n\tw = PyObject_IsTrue(PyTuple_GET_ITEM(obj, 2));\n\th = PyObject_IsTrue(PyTuple_GET_ITEM(obj, 3));\n\tif(PyErr_Occurred())\n\t\treturn false;\n\treturn true;\n}\n\n\n\nstatic\nPyObject* guiObject_method_addChild(PyObject* _self, PyObject* _arg) {\n\tGuiObject* self = (GuiObject*) _self;\n\tif(!PyType_IsSubtype(Py_TYPE(_arg), &GuiObject_Type)) {\n\t\tPyErr_Format(PyExc_ValueError, \"GuiObject.addChild: we expect a GuiObject\");\n\t\treturn NULL;\n\t}\n\tGuiObject* arg = (GuiObject*) _arg;\n\tauto func = self->meth_addChild;\n\tif(!func) {\n\t\tPyErr_Format(PyExc_AttributeError, \"GuiObject.addChild: must be specified in subclass\");\n\t\treturn NULL;\n\t}\n\tPy_BEGIN_ALLOW_THREADS\n\tfunc(self, arg);\n\tPy_END_ALLOW_THREADS\n\tPy_INCREF(Py_None);\n\treturn Py_None;\n}\n\nstatic PyMethodDef md_addChild = {\n\t\"addChild\",\n\tguiObject_method_addChild,\n\tMETH_O,\n\tNULL\n};\n\n\nstatic PyObject* returnObj(PyObject* obj) {\n\tif(!obj) obj = Py_None;\n\tPy_INCREF(obj);\n\treturn obj;\n}\n\n#define _ReturnAttr(attr) { if(strcmp(key, #attr) == 0) return returnObj(attr); }\n\n#define _ReturnAttrVec(attr) { if(strcmp(key, #attr) == 0) return attr.asPyObject(); }\n\n#define _ReturnCustomAttr(attr) { \\\n\tif(strcmp(key, #attr) == 0) { \\\n\t\tif(get_ ## attr == 0) { \\\n\t\t\tPyErr_Format(PyExc_AttributeError, \"GuiObject attribute '%.400s' must be specified in subclass\", key); \\\n\t\t\treturn NULL; \\\n\t\t} \\\n\t\tPyThreadState *_save = PyEval_SaveThread(); \\\n\t\tauto res = (* get_ ## attr)(this); \\\n\t\tPyEval_RestoreThread(_save); \\\n\t\treturn res.asPyObject(); \\\n\t} }\n\nPyObject* GuiObject::getattr(const char* key) {\n\t_ReturnAttr(root);\n\t_ReturnAttr(parent);\n\t_ReturnAttr(attr);\n\t_ReturnAttr(nativeGuiObject);\n\t_ReturnAttr(subjectObject);\n\t_ReturnAttrVec(DefaultSpace);\n\t_ReturnAttrVec(OuterSpace);\n\t\n\t_ReturnCustomAttr(pos);\n\t_ReturnCustomAttr(size);\n\t_ReturnCustomAttr(innerSize);\n\t_ReturnCustomAttr(autoresize);\n\t\n\tif(strcmp(key, \"addChild\") == 0) {\n\t\treturn PyCFunction_New(&md_addChild, (PyObject*) this);\n\t}\n\n\tif(strcmp(key, \"__dict__\") == 0) {\n\t\tif(!__dict__)\n\t\t\t__dict__ = PyDict_New();\n\t\tif(!__dict__)\n\t\t\treturn NULL;\n\t\treturn returnObj(__dict__);\n\t}\n\t\n\t\/\/ Fallthrough to generic getattr. In case we got another base type, this might work.\n\tPyObject* s = PyString_FromString(key);\n\tif(!s) return NULL;\n\treturn PyObject_GenericGetAttr((PyObject*) this, s);\n}\n\n\n\n#define _SetAttr(attr) { \\\n\tif(strcmp(key, #attr) == 0) { \\\n\t\tattr = value; \\\n\t\tPy_INCREF(value); \\\n\t\treturn 0; \\\n\t} }\n\n#define _SetAttrVec(attr) { \\\n\tif(strcmp(key, #attr) == 0) { \\\n\t\tVec v; \\\n\t\tif(!v.initFromPyObject(value)) \\\n\t\t\treturn -1; \\\n\t\tattr = v; \\\n\t\treturn 0; \\\n\t} }\n\n#define _SetCustomAttr(attr, ValueType) { \\\n\tif(strcmp(key, #attr) == 0) { \\\n\t\tif(set_ ## attr == 0) { \\\n\t\t\tPyErr_Format(PyExc_AttributeError, \"GuiObject attribute '%.400s' must be specified in subclass\", key); \\\n\t\t\treturn -1; \\\n\t\t} \\\n\t\tValueType v; \\\n\t\tif(!v.initFromPyObject(value)) \\\n\t\t\treturn -1; \\\n\t\tPy_BEGIN_ALLOW_THREADS \\\n\t\t(* set_ ## attr)(this, v); \\\n\t\tPy_END_ALLOW_THREADS \\\n\t\treturn 0; \\\n\t} }\n\n#define _SetAttr_ErrReadOnly(attr) { \\\n\tif(strcmp(key, #attr) == 0) { \\\n\t\tPyErr_Format(PyExc_AttributeError, \"GuiObject attribute '%.400s' is readonly\", key); \\\n\t\treturn -1; \\\n\t} }\n\nint GuiObject::setattr(const char* key, PyObject* value) {\n\t_SetAttr(root);\n\t_SetAttr(parent);\n\t_SetAttr(attr);\n\t_SetAttr(subjectObject);\n\t_SetAttr(nativeGuiObject);\n\t_SetAttrVec(DefaultSpace);\n\t_SetAttrVec(OuterSpace);\n\t\n\t_SetCustomAttr(pos, Vec);\n\t_SetCustomAttr(size, Vec);\n\t_SetCustomAttr(autoresize, Autoresize);\n\n\t_SetAttr_ErrReadOnly(innerSize);\n\t_SetAttr_ErrReadOnly(addChild);\n\t\n\t\/\/ Fallthrough to generic setattr. In case we got another base type, this might work.\n\tPyObject* s = PyString_FromString(key);\n\tif(!s) return -1;\n\tint ret = PyObject_GenericSetAttr((PyObject*) this, s, value);\n\tPy_XDECREF(s);\n\treturn ret;\n}\n\n<commit_msg>another readonly attr<commit_after>\n#include \"GuiObject.hpp\"\n#include \"PythonHelpers.h\"\n\n\nint GuiObject::init(PyObject* args, PyObject* kwds) {\n\t\/\/ If the GuiObject type has no base set,\n\t\/\/ grab _GuiObject from the gui module and set it as the base.\n\tPyTypeObject* const selfType = &GuiObject_Type;\n\tif(selfType->tp_base == NULL || selfType->tp_base == &PyBaseObject_Type) {\n\t\tuninitTypeObject(selfType);\n\n\t\tPyObject* base = modAttrChain(\"gui\", \"_GuiObject\");\n\t\tif(!base || PyErr_Occurred()) {\n\t\t\tif(PyErr_Occurred())\n\t\t\t\tPyErr_Print();\n\t\t\tPy_FatalError(\"Did not found gui._GuiObject.\");\n\t\t}\n\t\tif(!PyClass_Check(base))\n\t\t\tPy_FatalError(\"gui._GuiObject is not a class.\");\n\t\tselfType->tp_bases = PyTuple_Pack(1, base);\n\t\tPy_DECREF(base);\n\t\t\n\t\tif(PyType_Ready(selfType) < 0)\n\t\t\tPy_FatalError(\"Was not able to reinit type GuiObject.\");\n\t}\n\t\n\tDefaultSpace = Vec(8,8);\n\tOuterSpace = Vec(8,8);\n\treturn 0;\n}\n\n\nPyObject* Vec::asPyObject() const {\n\tPyObject* t = PyTuple_New(2);\n\tif(!t) return NULL;\n\tPyTuple_SET_ITEM(t, 0, PyInt_FromLong(x));\n\tPyTuple_SET_ITEM(t, 1, PyInt_FromLong(y));\n\treturn t;\n}\n\nPyObject* Autoresize::asPyObject() const {\n\tPyObject* t = PyTuple_New(4);\n\tif(!t) return NULL;\n\tPyTuple_SET_ITEM(t, 0, PyBool_FromLong(x));\n\tPyTuple_SET_ITEM(t, 1, PyBool_FromLong(y));\n\tPyTuple_SET_ITEM(t, 2, PyBool_FromLong(w));\n\tPyTuple_SET_ITEM(t, 3, PyBool_FromLong(h));\n\treturn t;\n}\n\nbool Vec::initFromPyObject(PyObject* obj) {\n\tif(!PyTuple_Check(obj)) {\n\t\tPyErr_Format(PyExc_ValueError, \"Vec: We expect a tuple\");\n\t\treturn false;\n\t}\n\tif(PyTuple_GET_SIZE(obj) != 2) {\n\t\tPyErr_Format(PyExc_ValueError, \"Vec: We expect a tuple with 2 elements\");\n\t\treturn false;\n\t}\n\tx = (int)PyInt_AsLong(PyTuple_GET_ITEM(obj, 0));\n\ty = (int)PyInt_AsLong(PyTuple_GET_ITEM(obj, 1));\n\tif(PyErr_Occurred())\n\t\treturn false;\n\treturn true;\n}\n\nbool Autoresize::initFromPyObject(PyObject* obj) {\n\tif(!PyTuple_Check(obj)) {\n\t\tPyErr_Format(PyExc_ValueError, \"Autoresize: We expect a tuple\");\n\t\treturn false;\n\t}\n\tif(PyTuple_GET_SIZE(obj) != 4) {\n\t\tPyErr_Format(PyExc_ValueError, \"Autoresize: We expect a tuple with 4 elements\");\n\t\treturn false;\n\t}\n\tx = PyObject_IsTrue(PyTuple_GET_ITEM(obj, 0));\n\ty = PyObject_IsTrue(PyTuple_GET_ITEM(obj, 1));\n\tw = PyObject_IsTrue(PyTuple_GET_ITEM(obj, 2));\n\th = PyObject_IsTrue(PyTuple_GET_ITEM(obj, 3));\n\tif(PyErr_Occurred())\n\t\treturn false;\n\treturn true;\n}\n\n\n\nstatic\nPyObject* guiObject_method_addChild(PyObject* _self, PyObject* _arg) {\n\tGuiObject* self = (GuiObject*) _self;\n\tif(!PyType_IsSubtype(Py_TYPE(_arg), &GuiObject_Type)) {\n\t\tPyErr_Format(PyExc_ValueError, \"GuiObject.addChild: we expect a GuiObject\");\n\t\treturn NULL;\n\t}\n\tGuiObject* arg = (GuiObject*) _arg;\n\tauto func = self->meth_addChild;\n\tif(!func) {\n\t\tPyErr_Format(PyExc_AttributeError, \"GuiObject.addChild: must be specified in subclass\");\n\t\treturn NULL;\n\t}\n\tPy_BEGIN_ALLOW_THREADS\n\tfunc(self, arg);\n\tPy_END_ALLOW_THREADS\n\tPy_INCREF(Py_None);\n\treturn Py_None;\n}\n\nstatic PyMethodDef md_addChild = {\n\t\"addChild\",\n\tguiObject_method_addChild,\n\tMETH_O,\n\tNULL\n};\n\n\nstatic PyObject* returnObj(PyObject* obj) {\n\tif(!obj) obj = Py_None;\n\tPy_INCREF(obj);\n\treturn obj;\n}\n\n#define _ReturnAttr(attr) { if(strcmp(key, #attr) == 0) return returnObj(attr); }\n\n#define _ReturnAttrVec(attr) { if(strcmp(key, #attr) == 0) return attr.asPyObject(); }\n\n#define _ReturnCustomAttr(attr) { \\\n\tif(strcmp(key, #attr) == 0) { \\\n\t\tif(get_ ## attr == 0) { \\\n\t\t\tPyErr_Format(PyExc_AttributeError, \"GuiObject attribute '%.400s' must be specified in subclass\", key); \\\n\t\t\treturn NULL; \\\n\t\t} \\\n\t\tPyThreadState *_save = PyEval_SaveThread(); \\\n\t\tauto res = (* get_ ## attr)(this); \\\n\t\tPyEval_RestoreThread(_save); \\\n\t\treturn res.asPyObject(); \\\n\t} }\n\nPyObject* GuiObject::getattr(const char* key) {\n\t_ReturnAttr(root);\n\t_ReturnAttr(parent);\n\t_ReturnAttr(attr);\n\t_ReturnAttr(nativeGuiObject);\n\t_ReturnAttr(subjectObject);\n\t_ReturnAttrVec(DefaultSpace);\n\t_ReturnAttrVec(OuterSpace);\n\t\n\t_ReturnCustomAttr(pos);\n\t_ReturnCustomAttr(size);\n\t_ReturnCustomAttr(innerSize);\n\t_ReturnCustomAttr(autoresize);\n\t\n\tif(strcmp(key, \"addChild\") == 0) {\n\t\treturn PyCFunction_New(&md_addChild, (PyObject*) this);\n\t}\n\n\tif(strcmp(key, \"__dict__\") == 0) {\n\t\tif(!__dict__)\n\t\t\t__dict__ = PyDict_New();\n\t\tif(!__dict__)\n\t\t\treturn NULL;\n\t\treturn returnObj(__dict__);\n\t}\n\t\n\t\/\/ Fallthrough to generic getattr. In case we got another base type, this might work.\n\tPyObject* s = PyString_FromString(key);\n\tif(!s) return NULL;\n\treturn PyObject_GenericGetAttr((PyObject*) this, s);\n}\n\n\n\n#define _SetAttr(attr) { \\\n\tif(strcmp(key, #attr) == 0) { \\\n\t\tattr = value; \\\n\t\tPy_INCREF(value); \\\n\t\treturn 0; \\\n\t} }\n\n#define _SetAttrVec(attr) { \\\n\tif(strcmp(key, #attr) == 0) { \\\n\t\tVec v; \\\n\t\tif(!v.initFromPyObject(value)) \\\n\t\t\treturn -1; \\\n\t\tattr = v; \\\n\t\treturn 0; \\\n\t} }\n\n#define _SetCustomAttr(attr, ValueType) { \\\n\tif(strcmp(key, #attr) == 0) { \\\n\t\tif(set_ ## attr == 0) { \\\n\t\t\tPyErr_Format(PyExc_AttributeError, \"GuiObject attribute '%.400s' must be specified in subclass\", key); \\\n\t\t\treturn -1; \\\n\t\t} \\\n\t\tValueType v; \\\n\t\tif(!v.initFromPyObject(value)) \\\n\t\t\treturn -1; \\\n\t\tPy_BEGIN_ALLOW_THREADS \\\n\t\t(* set_ ## attr)(this, v); \\\n\t\tPy_END_ALLOW_THREADS \\\n\t\treturn 0; \\\n\t} }\n\n#define _SetAttr_ErrReadOnly(attr) { \\\n\tif(strcmp(key, #attr) == 0) { \\\n\t\tPyErr_Format(PyExc_AttributeError, \"GuiObject attribute '%.400s' is readonly\", key); \\\n\t\treturn -1; \\\n\t} }\n\nint GuiObject::setattr(const char* key, PyObject* value) {\n\t_SetAttr(root);\n\t_SetAttr(parent);\n\t_SetAttr(attr);\n\t_SetAttr(subjectObject);\n\t_SetAttr(nativeGuiObject);\n\t_SetAttrVec(DefaultSpace);\n\t_SetAttrVec(OuterSpace);\n\t\n\t_SetCustomAttr(pos, Vec);\n\t_SetCustomAttr(size, Vec);\n\t_SetCustomAttr(autoresize, Autoresize);\n\n\t_SetAttr_ErrReadOnly(innerSize);\n\t_SetAttr_ErrReadOnly(addChild);\n\t_SetAttr_ErrReadOnly(__dict__);\n\t\n\t\/\/ Fallthrough to generic setattr. In case we got another base type, this might work.\n\tPyObject* s = PyString_FromString(key);\n\tif(!s) return -1;\n\tint ret = PyObject_GenericSetAttr((PyObject*) this, s, value);\n\tPy_XDECREF(s);\n\treturn ret;\n}\n\n<|endoftext|>"} {"text":"<commit_before>\/*\n * Copyright (C) 2016 deipi.com LLC and contributors. 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\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 \"aggregation.h\"\n\n#include <stdexcept> \/\/ for out_of_range\n\n#include \"aggregation_bucket.h\" \/\/ for FilterAggregation, Histog...\n#include \"aggregation_metric.h\" \/\/ for AGGREGATION_AVG, AGGREGAT...\n#include \"database_utils.h\" \/\/ for is_valid\n#include \"exception.h\" \/\/ for AggregationError, MSG_Agg...\n#include \"msgpack.h\" \/\/ for MsgPack, MsgPack::const_i...\n#include \"schema.h\" \/\/ for Schema\n#include \"stl_serialise.h\" \/\/ for StringList\n\n\nconst std::unordered_map<std::string, dispatch_aggregations> map_dispatch_aggregations({\n\t{ AGGREGATION_COUNT, &Aggregation::add_metric<AGGREGATION_COUNT, MetricCount> },\n\t\/\/ { AGGREGATION_CARDINALITY, &Aggregation::add_metric<AGGREGATION_CARDINALITY, MetricCardinality> },\n\t{ AGGREGATION_SUM, &Aggregation::add_metric<AGGREGATION_SUM, MetricSum> },\n\t{ AGGREGATION_AVG, &Aggregation::add_metric<AGGREGATION_AVG, MetricAvg> },\n\t{ AGGREGATION_MIN, &Aggregation::add_metric<AGGREGATION_MIN, MetricMin> },\n\t{ AGGREGATION_MAX, &Aggregation::add_metric<AGGREGATION_MAX, MetricMax> },\n\t{ AGGREGATION_VARIANCE, &Aggregation::add_metric<AGGREGATION_VARIANCE, MetricVariance> },\n\t{ AGGREGATION_STD, &Aggregation::add_metric<AGGREGATION_STD, MetricSTD> },\n\t{ AGGREGATION_MEDIAN, &Aggregation::add_metric<AGGREGATION_MEDIAN, MetricMedian> },\n\t{ AGGREGATION_MODE, &Aggregation::add_metric<AGGREGATION_MODE, MetricMode> },\n\t{ AGGREGATION_STATS, &Aggregation::add_metric<AGGREGATION_STATS, MetricStats> },\n\t{ AGGREGATION_EXT_STATS, &Aggregation::add_metric<AGGREGATION_EXT_STATS, MetricExtendedStats> },\n\t\/\/ { AGGREGATION_GEO_BOUNDS, &Aggregation::add_metric<AGGREGATION_GEO_BOUNDS, MetricGeoBounds> },\n\t\/\/ { AGGREGATION_GEO_CENTROID, &Aggregation::add_metric<AGGREGATION_GEO_CENTROID, MetricGeoCentroid> },\n\t\/\/ { AGGREGATION_PERCENTILES, &Aggregation::add_metric<AGGREGATION_PERCENTILES, MetricPercentiles> },\n\t\/\/ { AGGREGATION_PERCENTILES_RANK, &Aggregation::add_metric<AGGREGATION_PERCENTILES_RANK, MetricPercentilesRank> },\n\t\/\/ { AGGREGATION_SCRIPTED_METRIC, &Aggregation::add_metric<AGGREGATION_SCRIPTED_METRIC, MetricScripted> },\n\n\t{ AGGREGATION_FILTER, &Aggregation::add_bucket<FilterAggregation> },\n\t{ AGGREGATION_VALUE, &Aggregation::add_bucket<ValueAggregation> },\n\t\/\/ { AGGREGATION_DATE_HISTOGRAM, &Aggregation::add_bucket<DateHistogramAggregation> },\n\t\/\/ { AGGREGATION_DATE_RANGE, &Aggregation::add_bucket<DateRangeAggregation> },\n\t\/\/ { AGGREGATION_GEO_DISTANCE, &Aggregation::add_bucket<GeoDistanceAggregation> },\n\t\/\/ { AGGREGATION_GEO_TRIXELS, &Aggregation::add_bucket<GeoTrixelsAggregation> },\n\t{ AGGREGATION_HISTOGRAM, &Aggregation::add_bucket<HistogramAggregation> },\n\t\/\/ { AGGREGATION_MISSING, &Aggregation::add_bucket<MissingAggregation> },\n\t{ AGGREGATION_RANGE, &Aggregation::add_bucket<RangeAggregation> },\n\t\/\/ { AGGREGATION_IP_RANGE, &Aggregation::add_bucket<IPRangeAggregation> },\n\t\/\/ { AGGREGATION_GEO_IP, &Aggregation::add_bucket<GeoIPAggregation> },\n});\n\n\nAggregation::Aggregation(MsgPack& result)\n\t: _result(result),\n\t _doc_count(0)\n{\n\t_result[AGGREGATION_DOC_COUNT] = _doc_count; \/\/ Initialize here so it's at the start\n}\n\n\nAggregation::Aggregation(MsgPack& result, const MsgPack& conf, const std::shared_ptr<Schema>& schema)\n\t: _result(result),\n\t _doc_count(0)\n{\n\t_result[AGGREGATION_DOC_COUNT] = _doc_count; \/\/ Initialize here so it's at the start\n\n\ttry {\n\t\tconst auto& aggs = conf.at(AGGREGATION_AGGS);\n\t\tfor (const auto& agg : aggs) {\n\t\t\tauto sub_agg_name = agg.as_string();\n\t\t\tif (is_valid(sub_agg_name)) {\n\t\t\t\tconst auto& sub_agg = aggs.at(sub_agg_name);\n\t\t\t\tauto sub_agg_type = (*sub_agg.begin()).as_string();\n\t\t\t\ttry {\n\t\t\t\t\tauto func = map_dispatch_aggregations.at(sub_agg_type);\n\t\t\t\t\t(this->*func)(_result[sub_agg_name], sub_agg, schema);\n\t\t\t\t} catch (const std::out_of_range&) {\n\t\t\t\t\tTHROW(AggregationError, \"Aggregation type: %s is not valid\", sub_agg_name.c_str());\n\t\t\t\t}\n\t\t\t} else {\n\t\t\t\tTHROW(AggregationError, \"Aggregation sub_agg_name: %s is not valid\", sub_agg_name.c_str());\n\t\t\t}\n\t\t}\n\t} catch (const msgpack::type_error) {\n\t\tTHROW(AggregationError, \"Aggregations must be an object\");\n\t} catch (const std::out_of_range&) { }\n}\n\n\nvoid\nAggregation::operator()(const Xapian::Document& doc)\n{\n\t++_doc_count;\n\tfor (auto& sub_agg : _sub_aggregations) {\n\t\t(*sub_agg)(doc);\n\t}\n};\n\n\nvoid\nAggregation::update()\n{\n\tfor (auto& sub_agg : _sub_aggregations) {\n\t\tsub_agg->update();\n\t}\n\t_result[AGGREGATION_DOC_COUNT] = _doc_count;\n}\n\n\nvoid\nAggregationMatchSpy::operator()(const Xapian::Document& doc, double)\n{\n\t++_total;\n\t_aggregation(doc);\n}\n\n\nXapian::MatchSpy*\nAggregationMatchSpy::clone() const\n{\n\treturn new AggregationMatchSpy(_aggs, _schema);\n}\n\n\nstd::string\nAggregationMatchSpy::name() const\n{\n\treturn \"AggregationMatchSpy\";\n}\n\n\nstd::string\nAggregationMatchSpy::serialise() const\n{\n\tStringList l;\n\tl.push_back(_aggs.serialise());\n\tl.push_back(_schema->get_const_schema()->serialise());\n\treturn l.serialise();\n}\n\n\nXapian::MatchSpy*\nAggregationMatchSpy::unserialise(const std::string& s, const Xapian::Registry&) const\n{\n\tStringList l;\n\tl.unserialise(s);\n\tstd::shared_ptr<const MsgPack> internal_schema = std::make_shared<const MsgPack>(MsgPack::unserialise(l.at(1)));\n\treturn new AggregationMatchSpy(MsgPack::unserialise(l.at(0)), std::make_shared<Schema>(internal_schema));\n}\n\n\nstd::string\nAggregationMatchSpy::get_description() const\n{\n\tstd::string desc(\"AggregationMatchSpy(\");\n\tdesc.append(_aggs.to_string()).push_back(')');\n\treturn desc;\n}\n<commit_msg>Using Serialise::STLString and Unserialise::STLString in AggregationMatchSpy<commit_after>\/*\n * Copyright (C) 2016,2017 deipi.com LLC and contributors. 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\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 \"aggregation.h\"\n\n#include <stdexcept> \/\/ for out_of_range\n\n#include \"aggregation_bucket.h\" \/\/ for FilterAggregation, Histog...\n#include \"aggregation_metric.h\" \/\/ for AGGREGATION_AVG, AGGREGAT...\n#include \"database_utils.h\" \/\/ for is_valid\n#include \"exception.h\" \/\/ for AggregationError, MSG_Agg...\n#include \"msgpack.h\" \/\/ for MsgPack, MsgPack::const_i...\n#include \"schema.h\" \/\/ for Schema\n\n\nconst std::unordered_map<std::string, dispatch_aggregations> map_dispatch_aggregations({\n\t{ AGGREGATION_COUNT, &Aggregation::add_metric<AGGREGATION_COUNT, MetricCount> },\n\t\/\/ { AGGREGATION_CARDINALITY, &Aggregation::add_metric<AGGREGATION_CARDINALITY, MetricCardinality> },\n\t{ AGGREGATION_SUM, &Aggregation::add_metric<AGGREGATION_SUM, MetricSum> },\n\t{ AGGREGATION_AVG, &Aggregation::add_metric<AGGREGATION_AVG, MetricAvg> },\n\t{ AGGREGATION_MIN, &Aggregation::add_metric<AGGREGATION_MIN, MetricMin> },\n\t{ AGGREGATION_MAX, &Aggregation::add_metric<AGGREGATION_MAX, MetricMax> },\n\t{ AGGREGATION_VARIANCE, &Aggregation::add_metric<AGGREGATION_VARIANCE, MetricVariance> },\n\t{ AGGREGATION_STD, &Aggregation::add_metric<AGGREGATION_STD, MetricSTD> },\n\t{ AGGREGATION_MEDIAN, &Aggregation::add_metric<AGGREGATION_MEDIAN, MetricMedian> },\n\t{ AGGREGATION_MODE, &Aggregation::add_metric<AGGREGATION_MODE, MetricMode> },\n\t{ AGGREGATION_STATS, &Aggregation::add_metric<AGGREGATION_STATS, MetricStats> },\n\t{ AGGREGATION_EXT_STATS, &Aggregation::add_metric<AGGREGATION_EXT_STATS, MetricExtendedStats> },\n\t\/\/ { AGGREGATION_GEO_BOUNDS, &Aggregation::add_metric<AGGREGATION_GEO_BOUNDS, MetricGeoBounds> },\n\t\/\/ { AGGREGATION_GEO_CENTROID, &Aggregation::add_metric<AGGREGATION_GEO_CENTROID, MetricGeoCentroid> },\n\t\/\/ { AGGREGATION_PERCENTILES, &Aggregation::add_metric<AGGREGATION_PERCENTILES, MetricPercentiles> },\n\t\/\/ { AGGREGATION_PERCENTILES_RANK, &Aggregation::add_metric<AGGREGATION_PERCENTILES_RANK, MetricPercentilesRank> },\n\t\/\/ { AGGREGATION_SCRIPTED_METRIC, &Aggregation::add_metric<AGGREGATION_SCRIPTED_METRIC, MetricScripted> },\n\n\t{ AGGREGATION_FILTER, &Aggregation::add_bucket<FilterAggregation> },\n\t{ AGGREGATION_VALUE, &Aggregation::add_bucket<ValueAggregation> },\n\t\/\/ { AGGREGATION_DATE_HISTOGRAM, &Aggregation::add_bucket<DateHistogramAggregation> },\n\t\/\/ { AGGREGATION_DATE_RANGE, &Aggregation::add_bucket<DateRangeAggregation> },\n\t\/\/ { AGGREGATION_GEO_DISTANCE, &Aggregation::add_bucket<GeoDistanceAggregation> },\n\t\/\/ { AGGREGATION_GEO_TRIXELS, &Aggregation::add_bucket<GeoTrixelsAggregation> },\n\t{ AGGREGATION_HISTOGRAM, &Aggregation::add_bucket<HistogramAggregation> },\n\t\/\/ { AGGREGATION_MISSING, &Aggregation::add_bucket<MissingAggregation> },\n\t{ AGGREGATION_RANGE, &Aggregation::add_bucket<RangeAggregation> },\n\t\/\/ { AGGREGATION_IP_RANGE, &Aggregation::add_bucket<IPRangeAggregation> },\n\t\/\/ { AGGREGATION_GEO_IP, &Aggregation::add_bucket<GeoIPAggregation> },\n});\n\n\nAggregation::Aggregation(MsgPack& result)\n\t: _result(result),\n\t _doc_count(0)\n{\n\t_result[AGGREGATION_DOC_COUNT] = _doc_count; \/\/ Initialize here so it's at the start\n}\n\n\nAggregation::Aggregation(MsgPack& result, const MsgPack& conf, const std::shared_ptr<Schema>& schema)\n\t: _result(result),\n\t _doc_count(0)\n{\n\t_result[AGGREGATION_DOC_COUNT] = _doc_count; \/\/ Initialize here so it's at the start\n\n\ttry {\n\t\tconst auto& aggs = conf.at(AGGREGATION_AGGS);\n\t\tfor (const auto& agg : aggs) {\n\t\t\tauto sub_agg_name = agg.as_string();\n\t\t\tif (is_valid(sub_agg_name)) {\n\t\t\t\tconst auto& sub_agg = aggs.at(sub_agg_name);\n\t\t\t\tauto sub_agg_type = (*sub_agg.begin()).as_string();\n\t\t\t\ttry {\n\t\t\t\t\tauto func = map_dispatch_aggregations.at(sub_agg_type);\n\t\t\t\t\t(this->*func)(_result[sub_agg_name], sub_agg, schema);\n\t\t\t\t} catch (const std::out_of_range&) {\n\t\t\t\t\tTHROW(AggregationError, \"Aggregation type: %s is not valid\", sub_agg_name.c_str());\n\t\t\t\t}\n\t\t\t} else {\n\t\t\t\tTHROW(AggregationError, \"Aggregation sub_agg_name: %s is not valid\", sub_agg_name.c_str());\n\t\t\t}\n\t\t}\n\t} catch (const msgpack::type_error) {\n\t\tTHROW(AggregationError, \"Aggregations must be an object\");\n\t} catch (const std::out_of_range&) { }\n}\n\n\nvoid\nAggregation::operator()(const Xapian::Document& doc)\n{\n\t++_doc_count;\n\tfor (auto& sub_agg : _sub_aggregations) {\n\t\t(*sub_agg)(doc);\n\t}\n};\n\n\nvoid\nAggregation::update()\n{\n\tfor (auto& sub_agg : _sub_aggregations) {\n\t\tsub_agg->update();\n\t}\n\t_result[AGGREGATION_DOC_COUNT] = _doc_count;\n}\n\n\nvoid\nAggregationMatchSpy::operator()(const Xapian::Document& doc, double)\n{\n\t++_total;\n\t_aggregation(doc);\n}\n\n\nXapian::MatchSpy*\nAggregationMatchSpy::clone() const\n{\n\treturn new AggregationMatchSpy(_aggs, _schema);\n}\n\n\nstd::string\nAggregationMatchSpy::name() const\n{\n\treturn \"AggregationMatchSpy\";\n}\n\n\nstd::string\nAggregationMatchSpy::serialise() const\n{\n\tstd::vector<std::string> data = { _aggs.serialise(), _schema->get_const_schema()->serialise() };\n\treturn Serialise::STLString(data.begin(), data.end());\n}\n\n\nXapian::MatchSpy*\nAggregationMatchSpy::unserialise(const std::string& s, const Xapian::Registry&) const\n{\n\tstd::vector<std::string> data;\n\tUnserialise::STLString(s, std::back_inserter(data));\n\tauto internal_schema = std::make_shared<const MsgPack>(MsgPack::unserialise(data.at(1)));\n\treturn new AggregationMatchSpy(MsgPack::unserialise(data.at(0)), std::make_shared<Schema>(internal_schema));\n}\n\n\nstd::string\nAggregationMatchSpy::get_description() const\n{\n\tstd::string desc(\"AggregationMatchSpy(\");\n\tdesc.append(_aggs.to_string()).push_back(')');\n\treturn desc;\n}\n<|endoftext|>"} {"text":"<commit_before>\/*\n===========================================================================\n\nDaemon GPL Source Code\nCopyright (C) 1999-2010 id Software LLC, a ZeniMax Media company.\n\nThis file is part of the Daemon GPL Source Code (Daemon Source Code).\n\nDaemon Source Code is free software: you can redistribute it and\/or modify\nit under the terms of the GNU General Public License as published by\nthe Free Software Foundation, either version 3 of the License, or\n(at your option) any later version.\n\nDaemon Source Code is distributed in the hope that it will be useful,\nbut WITHOUT ANY WARRANTY; without even the implied warranty of\nMERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the\nGNU General Public License for more details.\n\nYou should have received a copy of the GNU General Public License\nalong with Daemon Source Code. If not, see <http:\/\/www.gnu.org\/licenses\/>.\n\nIn addition, the Daemon Source Code is also subject to certain additional terms.\nYou should have received a copy of these additional terms immediately following the\nterms and conditions of the GNU General Public License which accompanied the Daemon\nSource Code. If not, please request a copy in writing from id Software at the address\nbelow.\n\nIf you have questions concerning this license or the applicable additional terms, you\nmay contact in writing id Software LLC, c\/o ZeniMax Media Inc., Suite 120, Rockville,\nMaryland 20850 USA.\n\n===========================================================================\n*\/\n\n#include \"server.h\"\n#include \"framework\/CvarSystem.h\"\n\n\/*\n===============================================================================\n\nOPERATOR CONSOLE ONLY COMMANDS\n\nThese commands can only be entered from stdin or by a remote operator datagram\n===============================================================================\n*\/\n\nclass MapCmd: public Cmd::StaticCmd {\n public:\n MapCmd(Str::StringRef name, Str::StringRef description, bool cheat):\n Cmd::StaticCmd(name, Cmd::SYSTEM, description), cheat(cheat) {\n }\n\n void Run(const Cmd::Args& args) const override {\n if (args.Argc() < 2) {\n PrintUsage(args, \"<mapname> (layoutname)\", \"loads a new map\");\n return;\n }\n\n const std::string& mapName = args.Argv(1);\n\n \/\/Make sure the map exists to avoid typos that would kill the game\n FS::GetAvailableMaps();\n const auto loadedPakInfo = FS::PakPath::LocateFile(Str::Format(\"maps\/%s.bsp\", mapName));\n if (!loadedPakInfo) {\n Print(\"Can't find map %s\", mapName);\n return;\n }\n\n \/\/Gets the layout list from the command but do not override if there is nothing\n std::string layouts = args.ConcatArgs(2);\n if (not layouts.empty()) {\n Cvar::SetValue(\"g_layouts\", layouts);\n }\n\n Cvar::SetValueForce(\"sv_cheats\", cheat ? \"1\" : \"0\");\n SV_SpawnServer(loadedPakInfo->name, mapName);\n }\n\n Cmd::CompletionResult Complete(int argNum, const Cmd::Args& args, Str::StringRef prefix) const override {\n if (argNum == 1) {\n Cmd::CompletionResult out;\n for (auto& map: FS::GetAvailableMaps()) {\n if (Str::IsPrefix(prefix, map))\n out.push_back({map, \"\"});\n }\n return out;\n } else if (argNum > 1) {\n return FS::HomePath::CompleteFilename(prefix, \"game\/layouts\/\" + args.Argv(1), \".dat\", false, true);\n }\n\n return {};\n }\n\n private:\n bool cheat;\n};\nstatic MapCmd MapCmdRegistration(\"map\", \"starts a new map\", false);\nstatic MapCmd DevmapCmdRegistration(\"devmap\", \"starts a new map with cheats enabled\", true);\n\nvoid MSG_PrioritiseEntitystateFields();\nvoid MSG_PrioritisePlayerStateFields();\n\nstatic void SV_FieldInfo_f()\n{\n\tMSG_PrioritiseEntitystateFields();\n\tMSG_PrioritisePlayerStateFields();\n}\n\n\/*\n================\nSV_MapRestart_f\n\nCompletely restarts a level, but doesn't send a new gamestate to the clients.\nThis allows fair starts with variable load times.\n================\n*\/\nstatic void SV_MapRestart_f()\n{\n\tint i;\n\tclient_t *client;\n\tbool denied;\n\tchar reason[ MAX_STRING_CHARS ];\n\tbool isBot;\n\n\t\/\/ make sure we aren't restarting twice in the same frame\n\tif ( com_frameTime == sv.serverId )\n\t{\n\t\treturn;\n\t}\n\n\t\/\/ make sure server is running\n\tif ( !com_sv_running->integer )\n\t{\n\t\tLog::Notice( \"Server is not running.\\n\" );\n\t\treturn;\n\t}\n\n\t\/\/ check for changes in variables that can't just be restarted\n\t\/\/ check for maxclients change\n\tif ( sv_maxclients->modified )\n\t{\n\t\tchar mapname[ MAX_QPATH ];\n\t\tchar pakname[ MAX_OSPATH ];\n\n\t\tLog::Notice( \"sv_maxclients variable change — restarting.\\n\" );\n\t\t\/\/ restart the map the slow way\n\t\tQ_strncpyz( mapname, Cvar_VariableString( \"mapname\" ), sizeof( mapname ) );\n\t\tQ_strncpyz( pakname, Cvar_VariableString( \"pakname\" ), sizeof( pakname ) );\n\n\t\tSV_SpawnServer(pakname, mapname);\n\t\treturn;\n\t}\n\n\t\/\/ toggle the server bit so clients can detect that a\n\t\/\/ map_restart has happened\n\tsvs.snapFlagServerBit ^= SNAPFLAG_SERVERCOUNT;\n\n\t\/\/ generate a new serverid\n\t\/\/ TTimo - don't update restartedserverId there, otherwise we won't deal correctly with multiple map_restart\n\tsv.serverId = com_frameTime;\n\tCvar_Set( \"sv_serverid\", va( \"%i\", sv.serverId ) );\n\n\t\/\/ reset all the VM data in place without changing memory allocation\n\t\/\/ note that we do NOT set sv.state = SS_LOADING, so configstrings that\n\t\/\/ had been changed from their default values will generate broadcast updates\n\tsv.state = serverState_t::SS_LOADING;\n\tsv.restarting = true;\n\n\tSV_RestartGameProgs();\n\n\t\/\/ run a few frames to allow everything to settle\n\tfor ( i = 0; i < GAME_INIT_FRAMES; i++ )\n\t{\n\t\tgvm.GameRunFrame( sv.time );\n\t\tsvs.time += FRAMETIME;\n\t\tsv.time += FRAMETIME;\n\t}\n\n\t\/\/ create a baseline for more efficient communications\n\t\/\/ Gordon: meh, this won't work here as the client doesn't know it has happened\n\/\/ SV_CreateBaseline ();\n\n\tsv.state = serverState_t::SS_GAME;\n\tsv.restarting = false;\n\n\t\/\/ connect and begin all the clients\n\tfor ( i = 0; i < sv_maxclients->integer; i++ )\n\t{\n\t\tclient = &svs.clients[ i ];\n\n\t\t\/\/ send the new gamestate to all connected clients\n\t\tif ( client->state < clientState_t::CS_CONNECTED )\n\t\t{\n\t\t\tcontinue;\n\t\t}\n\n\t\tisBot = SV_IsBot(client);\n\n\t\t\/\/ add the map_restart command\n\t\tSV_AddServerCommand( client, \"map_restart\\n\" );\n\n\t\t\/\/ connect the client again, without the firstTime flag\n\t\tdenied = gvm.GameClientConnect( reason, sizeof( reason ), i, false, isBot );\n\n\t\tif ( denied )\n\t\t{\n\t\t\t\/\/ this generally shouldn't happen, because the client\n\t\t\t\/\/ was connected before the level change\n\t\t\tSV_DropClient( client, reason );\n\n\t\t\tif ( !isBot )\n\t\t\t{\n\t\t\t\tLog::Notice( \"SV_MapRestart_f: dropped client %i: denied!\\n\", i );\n\t\t\t}\n\n\t\t\tcontinue;\n\t\t}\n\n\t\tclient->state = clientState_t::CS_ACTIVE;\n\n\t\tSV_ClientEnterWorld( client, &client->lastUsercmd );\n\t}\n\n\t\/\/ run another frame to allow things to look at all the players\n\tgvm.GameRunFrame( sv.time );\n\tsvs.time += FRAMETIME;\n\tsv.time += FRAMETIME;\n}\n\nclass StatusCmd: public Cmd::StaticCmd\n{\npublic:\n\tStatusCmd():\n\t\tStaticCmd(\"status\", Cmd::SYSTEM, \"Shows a table with server and player information\")\n\t{}\n\n\tvoid Run(const Cmd::Args&) const override\n\t{\n\t\t\/\/ make sure server is running\n\t\tif ( !com_sv_running->integer )\n\t\t{\n\t\t\tLog::Notice( \"Server is not running.\\n\" );\n\t\t\treturn;\n\t\t}\n\n\t\tdouble cpu = ( svs.stats.latched_active + svs.stats.latched_idle );\n\n\t\tif ( cpu )\n\t\t{\n\t\t\tcpu = 100 * svs.stats.latched_active \/ cpu;\n\t\t}\n\n\t\tauto players = std::count_if(\n\t\t\tsvs.clients,\n\t\t\tsvs.clients+sv_maxclients->integer,\n\t\t\t[](const client_t& cl) {\n\t\t\t\treturn cl.state != clientState_t::CS_FREE;\n\t\t\t}\n\t\t);\n\n\t\tstd::string time_string;\n\t\tauto seconds = svs.time \/ 1000 % 60;\n\t\tauto minutes = svs.time \/ 1000 \/ 60 % 60;\n\t\tif ( auto hours = svs.time \/ 1000 \/ 60 \/ 60 \/ 60 )\n\t\t{\n\t\t\ttime_string = Str::Format(\"%02d:\", hours);\n\t\t}\n\t\ttime_string += Str::Format(\"%02d:%02d\", minutes, seconds);\n\n\t\tPrint(\n\t\t\t\"(begin server status)\\n\"\n\t\t\t\"hostname: %s\\n\"\n\t\t\t\"version: %s\\n\"\n\t\t\t\"protocol: %d\\n\"\n\t\t\t\"cpu: %.0f%%\\n\"\n\t\t\t\"time: %s\\n\"\n\t\t\t\"map: %s\\n\"\n\t\t\t\"players: %d \/ %d\\n\"\n\t\t\t\"num score connection address port name\\n\"\n\t\t\t\"--- ----- ---------- ---------------------- ------ ----\",\n\t\t\tsv_hostname->string,\n\t\t\tQ3_VERSION \" on \" Q3_ENGINE,\n\t\t\tPROTOCOL_VERSION,\n\t\t\tcpu,\n\t\t\ttime_string,\n\t\t\tsv_mapname->string,\n\t\t\tplayers,\n\t\t\tsv_maxclients->integer\n\t\t);\n\n\t\tfor ( int i = 0; i < sv_maxclients->integer; i++ )\n\t\t{\n\t\t\tconst client_t& cl = svs.clients[i];\n\t\t\tif ( cl.state == clientState_t::CS_FREE )\n\t\t\t{\n\t\t\t\tcontinue;\n\t\t\t}\n\n\t\t\tstd::string connection;\n\n\t\t\tif ( cl.state == clientState_t::CS_CONNECTED )\n\t\t\t{\n\t\t\t\tconnection = \"CONNECTED\";\n\t\t\t}\n\t\t\telse if ( cl.state == clientState_t::CS_ZOMBIE )\n\t\t\t{\n\t\t\t\tconnection = \"ZOMBIE\";\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\tconnection = std::to_string(cl.ping);\n\t\t\t\tif ( connection.size() > 10 )\n\t\t\t\t{\n\t\t\t\t\tconnection = \"ERROR\";\n\t\t\t\t}\n\t\t\t}\n\t\t\tOpaquePlayerState* ps = SV_GameClientNum( i );\n\n\t\t\tconst char *address = NET_AdrToString( cl.netchan.remoteAddress );\n\n\t\t\tPrint(\n\t\t\t\t\"%3i %5i %10s %-22s %-6i %s\",\n\t\t\t\ti,\n\t\t\t\tps->persistant[ PERS_SCORE ],\n\t\t\t\tconnection,\n\t\t\t\taddress,\n\t\t\t\tcl.netchan.qport,\n\t\t\t\tcl.name\n\t\t\t);\n\t\t}\n\n\t\tPrint( \"(end server status)\" );\n\t}\n};\nstatic StatusCmd StatusCmdRegistration;\n\n\/*\n===========\nSV_Serverinfo_f\n\nExamine the serverinfo string\n===========\n*\/\nstatic void SV_Serverinfo_f()\n{\n\t\/\/ make sure server is running\n\tif ( !com_sv_running->integer )\n\t{\n\t\tLog::Notice( \"Server is not running.\\n\" );\n\t\treturn;\n\t}\n\n\tLog::Notice( \"Server info settings:\\n\" );\n\tInfo_Print( Cvar_InfoString( CVAR_SERVERINFO, false ) );\n}\n\n\/*\n===========\nSV_Systeminfo_f\n\nExamine the systeminfo string\n===========\n*\/\nstatic void SV_Systeminfo_f()\n{\n\t\/\/ make sure server is running\n\tif ( !com_sv_running->integer )\n\t{\n\t\tLog::Notice( \"Server is not running.\\n\" );\n\t\treturn;\n\t}\n\n\tLog::Notice( \"System info settings:\\n\" );\n\tInfo_Print( Cvar_InfoString( CVAR_SYSTEMINFO, false ) );\n}\n\nclass ListMapsCmd: public Cmd::StaticCmd\n{\npublic:\n\tListMapsCmd():\n\t\tStaticCmd(\"listmaps\", Cmd::SYSTEM, \"Lists all maps available to the server\")\n\t{}\n\n\tvoid Run(const Cmd::Args&) const override\n\t{\n\t\tauto maps = FS::GetAvailableMaps();\n\n\t\tPrint(\"Listing %d maps:\", maps.size());\n\n\t\tfor ( const auto& map: maps )\n\t\t{\n\t\t\tPrint(map.c_str());\n\t\t}\n\t}\n};\n\n#if BUILD_SERVER\nstatic ListMapsCmd ListMapsCmdRegistration;\n#endif\n\n\/*\n==================\nSV_AddOperatorCommands\n==================\n*\/\nvoid SV_AddOperatorCommands()\n{\n\tif ( com_sv_running->integer )\n\t{\n\t\t\/\/ These commands should only be available while the server is running.\n\t\tCmd_AddCommand( \"fieldinfo\", SV_FieldInfo_f );\n\t\tCmd_AddCommand( \"heartbeat\", SV_Heartbeat_f );\n\t\tCmd_AddCommand( \"map_restart\", SV_MapRestart_f );\n\t\tCmd_AddCommand( \"serverinfo\", SV_Serverinfo_f );\n\t\tCmd_AddCommand( \"systeminfo\", SV_Systeminfo_f );\n\t}\n}\n\n\/*\n==================\nSV_RemoveOperatorCommands\n==================\n*\/\nvoid SV_RemoveOperatorCommands()\n{\n\tCmd_RemoveCommand( \"fieldinfo\" );\n\tCmd_RemoveCommand( \"heartbeat\" );\n\tCmd_RemoveCommand( \"map_restart\" );\n\tCmd_RemoveCommand( \"serverinfo\" );\n\tCmd_RemoveCommand( \"status\" );\n\tCmd_RemoveCommand( \"systeminfo\" );\n}\n<commit_msg>When loading map, assume pak name map-<mapname><commit_after>\/*\n===========================================================================\n\nDaemon GPL Source Code\nCopyright (C) 1999-2010 id Software LLC, a ZeniMax Media company.\n\nThis file is part of the Daemon GPL Source Code (Daemon Source Code).\n\nDaemon Source Code is free software: you can redistribute it and\/or modify\nit under the terms of the GNU General Public License as published by\nthe Free Software Foundation, either version 3 of the License, or\n(at your option) any later version.\n\nDaemon Source Code is distributed in the hope that it will be useful,\nbut WITHOUT ANY WARRANTY; without even the implied warranty of\nMERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the\nGNU General Public License for more details.\n\nYou should have received a copy of the GNU General Public License\nalong with Daemon Source Code. If not, see <http:\/\/www.gnu.org\/licenses\/>.\n\nIn addition, the Daemon Source Code is also subject to certain additional terms.\nYou should have received a copy of these additional terms immediately following the\nterms and conditions of the GNU General Public License which accompanied the Daemon\nSource Code. If not, please request a copy in writing from id Software at the address\nbelow.\n\nIf you have questions concerning this license or the applicable additional terms, you\nmay contact in writing id Software LLC, c\/o ZeniMax Media Inc., Suite 120, Rockville,\nMaryland 20850 USA.\n\n===========================================================================\n*\/\n\n#include \"server.h\"\n#include \"framework\/CvarSystem.h\"\n\n\/*\n===============================================================================\n\nOPERATOR CONSOLE ONLY COMMANDS\n\nThese commands can only be entered from stdin or by a remote operator datagram\n===============================================================================\n*\/\n\nclass MapCmd: public Cmd::StaticCmd {\n public:\n MapCmd(Str::StringRef name, Str::StringRef description, bool cheat):\n Cmd::StaticCmd(name, Cmd::SYSTEM, description), cheat(cheat) {\n }\n\n void Run(const Cmd::Args& args) const override {\n if (args.Argc() < 2) {\n PrintUsage(args, \"<mapname> (layoutname)\", \"loads a new map\");\n return;\n }\n\n const std::string& mapName = args.Argv(1);\n \/\/ For non-legacy paks, a map named \"foo\" must be in the pak \"map-foo\"\n std::string pakName;\n\n \/\/Make sure the map exists to avoid typos that would kill the game\n if (FS::FindPak(\"map-\" + mapName) != nullptr) {\n pakName = \"map-\" + mapName;\n } else if (FS::UseLegacyPaks()) {\n \/\/ Load all legacy paks\n for (const FS::PakInfo& pak : FS::GetAvailablePaks()) {\n if (pak.version.empty()) {\n std::error_code ignored;\n FS::PakPath::LoadPakPrefix(pak, \"maps\/\", ignored);\n }\n }\n if (const FS::PakInfo* pak = FS::PakPath::LocateFile(Str::Format(\"maps\/%s.bsp\", mapName))) {\n pakName = pak->name;\n }\n }\n\n if (pakName.empty()) {\n Print(\"Can't find map %s\", mapName);\n return;\n }\n\n \/\/Gets the layout list from the command but do not override if there is nothing\n std::string layouts = args.ConcatArgs(2);\n if (not layouts.empty()) {\n Cvar::SetValue(\"g_layouts\", layouts);\n }\n\n Cvar::SetValueForce(\"sv_cheats\", cheat ? \"1\" : \"0\");\n SV_SpawnServer(pakName, mapName);\n }\n\n Cmd::CompletionResult Complete(int argNum, const Cmd::Args& args, Str::StringRef prefix) const override {\n if (argNum == 1) {\n Cmd::CompletionResult out;\n for (auto& map: FS::GetAvailableMaps()) {\n if (Str::IsPrefix(prefix, map))\n out.push_back({map, \"\"});\n }\n return out;\n } else if (argNum > 1) {\n return FS::HomePath::CompleteFilename(prefix, \"game\/layouts\/\" + args.Argv(1), \".dat\", false, true);\n }\n\n return {};\n }\n\n private:\n bool cheat;\n};\nstatic MapCmd MapCmdRegistration(\"map\", \"starts a new map\", false);\nstatic MapCmd DevmapCmdRegistration(\"devmap\", \"starts a new map with cheats enabled\", true);\n\nvoid MSG_PrioritiseEntitystateFields();\nvoid MSG_PrioritisePlayerStateFields();\n\nstatic void SV_FieldInfo_f()\n{\n\tMSG_PrioritiseEntitystateFields();\n\tMSG_PrioritisePlayerStateFields();\n}\n\n\/*\n================\nSV_MapRestart_f\n\nCompletely restarts a level, but doesn't send a new gamestate to the clients.\nThis allows fair starts with variable load times.\n================\n*\/\nstatic void SV_MapRestart_f()\n{\n\tint i;\n\tclient_t *client;\n\tbool denied;\n\tchar reason[ MAX_STRING_CHARS ];\n\tbool isBot;\n\n\t\/\/ make sure we aren't restarting twice in the same frame\n\tif ( com_frameTime == sv.serverId )\n\t{\n\t\treturn;\n\t}\n\n\t\/\/ make sure server is running\n\tif ( !com_sv_running->integer )\n\t{\n\t\tLog::Notice( \"Server is not running.\\n\" );\n\t\treturn;\n\t}\n\n\t\/\/ check for changes in variables that can't just be restarted\n\t\/\/ check for maxclients change\n\tif ( sv_maxclients->modified )\n\t{\n\t\tchar mapname[ MAX_QPATH ];\n\t\tchar pakname[ MAX_OSPATH ];\n\n\t\tLog::Notice( \"sv_maxclients variable change — restarting.\\n\" );\n\t\t\/\/ restart the map the slow way\n\t\tQ_strncpyz( mapname, Cvar_VariableString( \"mapname\" ), sizeof( mapname ) );\n\t\tQ_strncpyz( pakname, Cvar_VariableString( \"pakname\" ), sizeof( pakname ) );\n\n\t\tSV_SpawnServer(pakname, mapname);\n\t\treturn;\n\t}\n\n\t\/\/ toggle the server bit so clients can detect that a\n\t\/\/ map_restart has happened\n\tsvs.snapFlagServerBit ^= SNAPFLAG_SERVERCOUNT;\n\n\t\/\/ generate a new serverid\n\t\/\/ TTimo - don't update restartedserverId there, otherwise we won't deal correctly with multiple map_restart\n\tsv.serverId = com_frameTime;\n\tCvar_Set( \"sv_serverid\", va( \"%i\", sv.serverId ) );\n\n\t\/\/ reset all the VM data in place without changing memory allocation\n\t\/\/ note that we do NOT set sv.state = SS_LOADING, so configstrings that\n\t\/\/ had been changed from their default values will generate broadcast updates\n\tsv.state = serverState_t::SS_LOADING;\n\tsv.restarting = true;\n\n\tSV_RestartGameProgs();\n\n\t\/\/ run a few frames to allow everything to settle\n\tfor ( i = 0; i < GAME_INIT_FRAMES; i++ )\n\t{\n\t\tgvm.GameRunFrame( sv.time );\n\t\tsvs.time += FRAMETIME;\n\t\tsv.time += FRAMETIME;\n\t}\n\n\t\/\/ create a baseline for more efficient communications\n\t\/\/ Gordon: meh, this won't work here as the client doesn't know it has happened\n\/\/ SV_CreateBaseline ();\n\n\tsv.state = serverState_t::SS_GAME;\n\tsv.restarting = false;\n\n\t\/\/ connect and begin all the clients\n\tfor ( i = 0; i < sv_maxclients->integer; i++ )\n\t{\n\t\tclient = &svs.clients[ i ];\n\n\t\t\/\/ send the new gamestate to all connected clients\n\t\tif ( client->state < clientState_t::CS_CONNECTED )\n\t\t{\n\t\t\tcontinue;\n\t\t}\n\n\t\tisBot = SV_IsBot(client);\n\n\t\t\/\/ add the map_restart command\n\t\tSV_AddServerCommand( client, \"map_restart\\n\" );\n\n\t\t\/\/ connect the client again, without the firstTime flag\n\t\tdenied = gvm.GameClientConnect( reason, sizeof( reason ), i, false, isBot );\n\n\t\tif ( denied )\n\t\t{\n\t\t\t\/\/ this generally shouldn't happen, because the client\n\t\t\t\/\/ was connected before the level change\n\t\t\tSV_DropClient( client, reason );\n\n\t\t\tif ( !isBot )\n\t\t\t{\n\t\t\t\tLog::Notice( \"SV_MapRestart_f: dropped client %i: denied!\\n\", i );\n\t\t\t}\n\n\t\t\tcontinue;\n\t\t}\n\n\t\tclient->state = clientState_t::CS_ACTIVE;\n\n\t\tSV_ClientEnterWorld( client, &client->lastUsercmd );\n\t}\n\n\t\/\/ run another frame to allow things to look at all the players\n\tgvm.GameRunFrame( sv.time );\n\tsvs.time += FRAMETIME;\n\tsv.time += FRAMETIME;\n}\n\nclass StatusCmd: public Cmd::StaticCmd\n{\npublic:\n\tStatusCmd():\n\t\tStaticCmd(\"status\", Cmd::SYSTEM, \"Shows a table with server and player information\")\n\t{}\n\n\tvoid Run(const Cmd::Args&) const override\n\t{\n\t\t\/\/ make sure server is running\n\t\tif ( !com_sv_running->integer )\n\t\t{\n\t\t\tLog::Notice( \"Server is not running.\\n\" );\n\t\t\treturn;\n\t\t}\n\n\t\tdouble cpu = ( svs.stats.latched_active + svs.stats.latched_idle );\n\n\t\tif ( cpu )\n\t\t{\n\t\t\tcpu = 100 * svs.stats.latched_active \/ cpu;\n\t\t}\n\n\t\tauto players = std::count_if(\n\t\t\tsvs.clients,\n\t\t\tsvs.clients+sv_maxclients->integer,\n\t\t\t[](const client_t& cl) {\n\t\t\t\treturn cl.state != clientState_t::CS_FREE;\n\t\t\t}\n\t\t);\n\n\t\tstd::string time_string;\n\t\tauto seconds = svs.time \/ 1000 % 60;\n\t\tauto minutes = svs.time \/ 1000 \/ 60 % 60;\n\t\tif ( auto hours = svs.time \/ 1000 \/ 60 \/ 60 \/ 60 )\n\t\t{\n\t\t\ttime_string = Str::Format(\"%02d:\", hours);\n\t\t}\n\t\ttime_string += Str::Format(\"%02d:%02d\", minutes, seconds);\n\n\t\tPrint(\n\t\t\t\"(begin server status)\\n\"\n\t\t\t\"hostname: %s\\n\"\n\t\t\t\"version: %s\\n\"\n\t\t\t\"protocol: %d\\n\"\n\t\t\t\"cpu: %.0f%%\\n\"\n\t\t\t\"time: %s\\n\"\n\t\t\t\"map: %s\\n\"\n\t\t\t\"players: %d \/ %d\\n\"\n\t\t\t\"num score connection address port name\\n\"\n\t\t\t\"--- ----- ---------- ---------------------- ------ ----\",\n\t\t\tsv_hostname->string,\n\t\t\tQ3_VERSION \" on \" Q3_ENGINE,\n\t\t\tPROTOCOL_VERSION,\n\t\t\tcpu,\n\t\t\ttime_string,\n\t\t\tsv_mapname->string,\n\t\t\tplayers,\n\t\t\tsv_maxclients->integer\n\t\t);\n\n\t\tfor ( int i = 0; i < sv_maxclients->integer; i++ )\n\t\t{\n\t\t\tconst client_t& cl = svs.clients[i];\n\t\t\tif ( cl.state == clientState_t::CS_FREE )\n\t\t\t{\n\t\t\t\tcontinue;\n\t\t\t}\n\n\t\t\tstd::string connection;\n\n\t\t\tif ( cl.state == clientState_t::CS_CONNECTED )\n\t\t\t{\n\t\t\t\tconnection = \"CONNECTED\";\n\t\t\t}\n\t\t\telse if ( cl.state == clientState_t::CS_ZOMBIE )\n\t\t\t{\n\t\t\t\tconnection = \"ZOMBIE\";\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\tconnection = std::to_string(cl.ping);\n\t\t\t\tif ( connection.size() > 10 )\n\t\t\t\t{\n\t\t\t\t\tconnection = \"ERROR\";\n\t\t\t\t}\n\t\t\t}\n\t\t\tOpaquePlayerState* ps = SV_GameClientNum( i );\n\n\t\t\tconst char *address = NET_AdrToString( cl.netchan.remoteAddress );\n\n\t\t\tPrint(\n\t\t\t\t\"%3i %5i %10s %-22s %-6i %s\",\n\t\t\t\ti,\n\t\t\t\tps->persistant[ PERS_SCORE ],\n\t\t\t\tconnection,\n\t\t\t\taddress,\n\t\t\t\tcl.netchan.qport,\n\t\t\t\tcl.name\n\t\t\t);\n\t\t}\n\n\t\tPrint( \"(end server status)\" );\n\t}\n};\nstatic StatusCmd StatusCmdRegistration;\n\n\/*\n===========\nSV_Serverinfo_f\n\nExamine the serverinfo string\n===========\n*\/\nstatic void SV_Serverinfo_f()\n{\n\t\/\/ make sure server is running\n\tif ( !com_sv_running->integer )\n\t{\n\t\tLog::Notice( \"Server is not running.\\n\" );\n\t\treturn;\n\t}\n\n\tLog::Notice( \"Server info settings:\\n\" );\n\tInfo_Print( Cvar_InfoString( CVAR_SERVERINFO, false ) );\n}\n\n\/*\n===========\nSV_Systeminfo_f\n\nExamine the systeminfo string\n===========\n*\/\nstatic void SV_Systeminfo_f()\n{\n\t\/\/ make sure server is running\n\tif ( !com_sv_running->integer )\n\t{\n\t\tLog::Notice( \"Server is not running.\\n\" );\n\t\treturn;\n\t}\n\n\tLog::Notice( \"System info settings:\\n\" );\n\tInfo_Print( Cvar_InfoString( CVAR_SYSTEMINFO, false ) );\n}\n\nclass ListMapsCmd: public Cmd::StaticCmd\n{\npublic:\n\tListMapsCmd():\n\t\tStaticCmd(\"listmaps\", Cmd::SYSTEM, \"Lists all maps available to the server\")\n\t{}\n\n\tvoid Run(const Cmd::Args&) const override\n\t{\n\t\tauto maps = FS::GetAvailableMaps();\n\n\t\tPrint(\"Listing %d maps:\", maps.size());\n\n\t\tfor ( const auto& map: maps )\n\t\t{\n\t\t\tPrint(map.c_str());\n\t\t}\n\t}\n};\n\n#if BUILD_SERVER\nstatic ListMapsCmd ListMapsCmdRegistration;\n#endif\n\n\/*\n==================\nSV_AddOperatorCommands\n==================\n*\/\nvoid SV_AddOperatorCommands()\n{\n\tif ( com_sv_running->integer )\n\t{\n\t\t\/\/ These commands should only be available while the server is running.\n\t\tCmd_AddCommand( \"fieldinfo\", SV_FieldInfo_f );\n\t\tCmd_AddCommand( \"heartbeat\", SV_Heartbeat_f );\n\t\tCmd_AddCommand( \"map_restart\", SV_MapRestart_f );\n\t\tCmd_AddCommand( \"serverinfo\", SV_Serverinfo_f );\n\t\tCmd_AddCommand( \"systeminfo\", SV_Systeminfo_f );\n\t}\n}\n\n\/*\n==================\nSV_RemoveOperatorCommands\n==================\n*\/\nvoid SV_RemoveOperatorCommands()\n{\n\tCmd_RemoveCommand( \"fieldinfo\" );\n\tCmd_RemoveCommand( \"heartbeat\" );\n\tCmd_RemoveCommand( \"map_restart\" );\n\tCmd_RemoveCommand( \"serverinfo\" );\n\tCmd_RemoveCommand( \"status\" );\n\tCmd_RemoveCommand( \"systeminfo\" );\n}\n<|endoftext|>"} {"text":"<commit_before>\/* Copyright 2017 Istio 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 \"src\/envoy\/http\/mixer\/filter.h\"\n\n#include \"common\/common\/base64.h\"\n#include \"common\/protobuf\/utility.h\"\n#include \"include\/istio\/utils\/status.h\"\n#include \"src\/envoy\/http\/mixer\/check_data.h\"\n#include \"src\/envoy\/http\/mixer\/report_data.h\"\n#include \"src\/envoy\/utils\/authn.h\"\n#include \"src\/envoy\/utils\/header_update.h\"\n\nusing ::google::protobuf::util::Status;\nusing ::istio::mixer::v1::config::client::ServiceConfig;\nusing ::istio::mixerclient::CheckResponseInfo;\n\nnamespace Envoy {\nnamespace Http {\nnamespace Mixer {\nnamespace {\n\n\/\/ Per route opaque data for \"destination.service\".\nconst std::string kPerRouteDestinationService(\"destination.service\");\n\/\/ Per route opaque data name \"mixer\" is base64(JSON(ServiceConfig))\nconst std::string kPerRouteMixer(\"mixer\");\n\/\/ Per route opaque data name \"mixer_sha\" is SHA(JSON(ServiceConfig))\nconst std::string kPerRouteMixerSha(\"mixer_sha\");\n\n\/\/ Read a string value from a string map.\nbool ReadStringMap(const std::multimap<std::string, std::string>& string_map,\n const std::string& name, std::string* value) {\n auto it = string_map.find(name);\n if (it != string_map.end()) {\n *value = it->second;\n return true;\n }\n return false;\n}\n\n} \/\/ namespace\n\nFilter::Filter(Control& control)\n : control_(control),\n state_(NotStarted),\n initiating_call_(false),\n headers_(nullptr) {\n ENVOY_LOG(debug, \"Called Mixer::Filter : {}\", __func__);\n}\n\nvoid Filter::ReadPerRouteConfig(\n const Router::RouteEntry* entry,\n ::istio::control::http::Controller::PerRouteConfig* config) {\n if (entry == nullptr) {\n return;\n }\n\n \/\/ Check v2 per-route config.\n auto route_cfg = entry->perFilterConfigTyped<PerRouteServiceConfig>(\"mixer\");\n if (route_cfg) {\n if (!control_.controller()->LookupServiceConfig(route_cfg->hash)) {\n control_.controller()->AddServiceConfig(route_cfg->hash,\n route_cfg->config);\n }\n config->service_config_id = route_cfg->hash;\n return;\n }\n\n const auto& string_map = entry->opaqueConfig();\n ReadStringMap(string_map, kPerRouteDestinationService,\n &config->destination_service);\n\n if (!ReadStringMap(string_map, kPerRouteMixerSha,\n &config->service_config_id) ||\n config->service_config_id.empty()) {\n return;\n }\n\n if (control_.controller()->LookupServiceConfig(config->service_config_id)) {\n return;\n }\n\n std::string config_base64;\n if (!ReadStringMap(string_map, kPerRouteMixer, &config_base64)) {\n ENVOY_LOG(warn, \"Service {} missing [mixer] per-route attribute\",\n config->destination_service);\n return;\n }\n std::string config_json = Base64::decode(config_base64);\n if (config_json.empty()) {\n ENVOY_LOG(warn, \"Service {} invalid base64 config data\",\n config->destination_service);\n return;\n }\n ServiceConfig config_pb;\n auto status = Utils::ParseJsonMessage(config_json, &config_pb);\n if (!status.ok()) {\n ENVOY_LOG(warn,\n \"Service {} failed to convert JSON config to protobuf, error: {}\",\n config->destination_service, status.ToString());\n return;\n }\n control_.controller()->AddServiceConfig(config->service_config_id, config_pb);\n ENVOY_LOG(info, \"Service {}, config_id {}, config: {}\",\n config->destination_service, config->service_config_id,\n MessageUtil::getJsonStringFromMessage(config_pb, true));\n}\n\nFilterHeadersStatus Filter::decodeHeaders(HeaderMap& headers, bool) {\n ENVOY_LOG(debug, \"Called Mixer::Filter : {}\", __func__);\n request_total_size_ += headers.byteSize();\n\n ::istio::control::http::Controller::PerRouteConfig config;\n auto route = decoder_callbacks_->route();\n if (route) {\n ReadPerRouteConfig(route->routeEntry(), &config);\n }\n handler_ = control_.controller()->CreateRequestHandler(config);\n\n state_ = Calling;\n initiating_call_ = true;\n CheckData check_data(headers,\n decoder_callbacks_->requestInfo().dynamicMetadata(),\n decoder_callbacks_->connection());\n Utils::HeaderUpdate header_update(&headers);\n headers_ = &headers;\n cancel_check_ = handler_->Check(\n &check_data, &header_update,\n control_.GetCheckTransport(decoder_callbacks_->activeSpan()),\n [this](const CheckResponseInfo& info) { completeCheck(info); });\n initiating_call_ = false;\n\n if (state_ == Complete) {\n return FilterHeadersStatus::Continue;\n }\n ENVOY_LOG(debug, \"Called Mixer::Filter : {} Stop\", __func__);\n return FilterHeadersStatus::StopIteration;\n}\n\nFilterDataStatus Filter::decodeData(Buffer::Instance& data, bool end_stream) {\n ENVOY_LOG(debug, \"Called Mixer::Filter : {} ({}, {})\", __func__,\n data.length(), end_stream);\n request_total_size_ += data.length();\n if (state_ == Calling) {\n return FilterDataStatus::StopIterationAndWatermark;\n }\n return FilterDataStatus::Continue;\n}\n\nFilterTrailersStatus Filter::decodeTrailers(HeaderMap& trailers) {\n ENVOY_LOG(debug, \"Called Mixer::Filter : {}\", __func__);\n request_total_size_ += trailers.byteSize();\n if (state_ == Calling) {\n return FilterTrailersStatus::StopIteration;\n }\n return FilterTrailersStatus::Continue;\n}\n\nvoid Filter::UpdateHeaders(\n HeaderMap& headers, const ::google::protobuf::RepeatedPtrField<\n ::istio::mixer::v1::HeaderOperation>& operations) {\n for (auto const iter : operations) {\n switch (iter.operation()) {\n case ::istio::mixer::v1::HeaderOperation_Operation_REPLACE:\n headers.remove(LowerCaseString(iter.name()));\n headers.addCopy(LowerCaseString(iter.name()), iter.value());\n break;\n case ::istio::mixer::v1::HeaderOperation_Operation_REMOVE:\n headers.remove(LowerCaseString(iter.name()));\n break;\n case ::istio::mixer::v1::HeaderOperation_Operation_APPEND:\n headers.addCopy(LowerCaseString(iter.name()), iter.value());\n break;\n default:\n PANIC(\"unreachable header operation\");\n }\n }\n}\n\nFilterHeadersStatus Filter::encodeHeaders(HeaderMap& headers, bool) {\n ENVOY_LOG(debug, \"Called Mixer::Filter : {} {}\", __func__, state_);\n \/\/ Init state is possible if a filter prior to mixerfilter interrupts the\n \/\/ filter chain\n ASSERT(state_ == NotStarted || state_ == Complete || state_ == Responded);\n if (state_ == Complete) {\n \/\/ handle response header operations\n UpdateHeaders(headers, route_directive_.response_header_operations());\n }\n return FilterHeadersStatus::Continue;\n}\n\nvoid Filter::setDecoderFilterCallbacks(\n StreamDecoderFilterCallbacks& callbacks) {\n ENVOY_LOG(debug, \"Called Mixer::Filter : {}\", __func__);\n decoder_callbacks_ = &callbacks;\n}\n\nvoid Filter::completeCheck(const CheckResponseInfo& info) {\n auto status = info.response_status;\n ENVOY_LOG(debug, \"Called Mixer::Filter : check complete {}\",\n status.ToString());\n \/\/ This stream has been reset, abort the callback.\n if (state_ == Responded) {\n return;\n }\n\n if (!status.ok()) {\n state_ = Responded;\n int status_code = ::istio::utils::StatusHttpCode(status.error_code());\n decoder_callbacks_->sendLocalReply(Code(status_code), status.ToString(),\n nullptr);\n decoder_callbacks_->requestInfo().setResponseFlag(\n RequestInfo::ResponseFlag::UnauthorizedExternalService);\n return;\n }\n\n state_ = Complete;\n route_directive_ = info.route_directive;\n\n \/\/ handle direct response from the route directive\n if (status.ok() && route_directive_.direct_response_code() != 0) {\n ENVOY_LOG(debug, \"Mixer::Filter direct response\");\n state_ = Responded;\n decoder_callbacks_->sendLocalReply(\n Code(route_directive_.direct_response_code()),\n route_directive_.direct_response_body(), [this](HeaderMap& headers) {\n UpdateHeaders(headers, route_directive_.response_header_operations());\n });\n return;\n }\n\n \/\/ handle request header operations\n if (nullptr != headers_) {\n UpdateHeaders(*headers_, route_directive_.request_header_operations());\n headers_ = nullptr;\n }\n\n if (!initiating_call_) {\n decoder_callbacks_->continueDecoding();\n }\n}\n\nvoid Filter::onDestroy() {\n ENVOY_LOG(debug, \"Called Mixer::Filter : {} state: {}\", __func__, state_);\n if (state_ != Calling) {\n cancel_check_ = nullptr;\n }\n state_ = Responded;\n if (cancel_check_) {\n ENVOY_LOG(debug, \"Cancelling check call\");\n cancel_check_();\n cancel_check_ = nullptr;\n }\n}\n\nvoid Filter::log(const HeaderMap* request_headers,\n const HeaderMap* response_headers,\n const HeaderMap* response_trailers,\n const RequestInfo::RequestInfo& request_info) {\n ENVOY_LOG(debug, \"Called Mixer::Filter : {}\", __func__);\n if (!handler_) {\n if (request_headers == nullptr) {\n return;\n }\n\n \/\/ Here Request is rejected by other filters, Mixer filter is not called.\n ::istio::control::http::Controller::PerRouteConfig config;\n ReadPerRouteConfig(request_info.routeEntry(), &config);\n handler_ = control_.controller()->CreateRequestHandler(config);\n\n CheckData check_data(*request_headers, request_info.dynamicMetadata(),\n nullptr);\n handler_->ExtractRequestAttributes(&check_data);\n }\n \/\/ response trailer header is not counted to response total size.\n ReportData report_data(response_headers, response_trailers, request_info,\n request_total_size_);\n handler_->Report(&report_data);\n}\n\n} \/\/ namespace Mixer\n} \/\/ namespace Http\n} \/\/ namespace Envoy\n<commit_msg>mixer: clear route cache on header update (#1946)<commit_after>\/* Copyright 2017 Istio 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 \"src\/envoy\/http\/mixer\/filter.h\"\n\n#include \"common\/common\/base64.h\"\n#include \"common\/protobuf\/utility.h\"\n#include \"include\/istio\/utils\/status.h\"\n#include \"src\/envoy\/http\/mixer\/check_data.h\"\n#include \"src\/envoy\/http\/mixer\/report_data.h\"\n#include \"src\/envoy\/utils\/authn.h\"\n#include \"src\/envoy\/utils\/header_update.h\"\n\nusing ::google::protobuf::util::Status;\nusing ::istio::mixer::v1::config::client::ServiceConfig;\nusing ::istio::mixerclient::CheckResponseInfo;\n\nnamespace Envoy {\nnamespace Http {\nnamespace Mixer {\nnamespace {\n\n\/\/ Per route opaque data for \"destination.service\".\nconst std::string kPerRouteDestinationService(\"destination.service\");\n\/\/ Per route opaque data name \"mixer\" is base64(JSON(ServiceConfig))\nconst std::string kPerRouteMixer(\"mixer\");\n\/\/ Per route opaque data name \"mixer_sha\" is SHA(JSON(ServiceConfig))\nconst std::string kPerRouteMixerSha(\"mixer_sha\");\n\n\/\/ Read a string value from a string map.\nbool ReadStringMap(const std::multimap<std::string, std::string>& string_map,\n const std::string& name, std::string* value) {\n auto it = string_map.find(name);\n if (it != string_map.end()) {\n *value = it->second;\n return true;\n }\n return false;\n}\n\n} \/\/ namespace\n\nFilter::Filter(Control& control)\n : control_(control),\n state_(NotStarted),\n initiating_call_(false),\n headers_(nullptr) {\n ENVOY_LOG(debug, \"Called Mixer::Filter : {}\", __func__);\n}\n\nvoid Filter::ReadPerRouteConfig(\n const Router::RouteEntry* entry,\n ::istio::control::http::Controller::PerRouteConfig* config) {\n if (entry == nullptr) {\n return;\n }\n\n \/\/ Check v2 per-route config.\n auto route_cfg = entry->perFilterConfigTyped<PerRouteServiceConfig>(\"mixer\");\n if (route_cfg) {\n if (!control_.controller()->LookupServiceConfig(route_cfg->hash)) {\n control_.controller()->AddServiceConfig(route_cfg->hash,\n route_cfg->config);\n }\n config->service_config_id = route_cfg->hash;\n return;\n }\n\n const auto& string_map = entry->opaqueConfig();\n ReadStringMap(string_map, kPerRouteDestinationService,\n &config->destination_service);\n\n if (!ReadStringMap(string_map, kPerRouteMixerSha,\n &config->service_config_id) ||\n config->service_config_id.empty()) {\n return;\n }\n\n if (control_.controller()->LookupServiceConfig(config->service_config_id)) {\n return;\n }\n\n std::string config_base64;\n if (!ReadStringMap(string_map, kPerRouteMixer, &config_base64)) {\n ENVOY_LOG(warn, \"Service {} missing [mixer] per-route attribute\",\n config->destination_service);\n return;\n }\n std::string config_json = Base64::decode(config_base64);\n if (config_json.empty()) {\n ENVOY_LOG(warn, \"Service {} invalid base64 config data\",\n config->destination_service);\n return;\n }\n ServiceConfig config_pb;\n auto status = Utils::ParseJsonMessage(config_json, &config_pb);\n if (!status.ok()) {\n ENVOY_LOG(warn,\n \"Service {} failed to convert JSON config to protobuf, error: {}\",\n config->destination_service, status.ToString());\n return;\n }\n control_.controller()->AddServiceConfig(config->service_config_id, config_pb);\n ENVOY_LOG(info, \"Service {}, config_id {}, config: {}\",\n config->destination_service, config->service_config_id,\n MessageUtil::getJsonStringFromMessage(config_pb, true));\n}\n\nFilterHeadersStatus Filter::decodeHeaders(HeaderMap& headers, bool) {\n ENVOY_LOG(debug, \"Called Mixer::Filter : {}\", __func__);\n request_total_size_ += headers.byteSize();\n\n ::istio::control::http::Controller::PerRouteConfig config;\n auto route = decoder_callbacks_->route();\n if (route) {\n ReadPerRouteConfig(route->routeEntry(), &config);\n }\n handler_ = control_.controller()->CreateRequestHandler(config);\n\n state_ = Calling;\n initiating_call_ = true;\n CheckData check_data(headers,\n decoder_callbacks_->requestInfo().dynamicMetadata(),\n decoder_callbacks_->connection());\n Utils::HeaderUpdate header_update(&headers);\n headers_ = &headers;\n cancel_check_ = handler_->Check(\n &check_data, &header_update,\n control_.GetCheckTransport(decoder_callbacks_->activeSpan()),\n [this](const CheckResponseInfo& info) { completeCheck(info); });\n initiating_call_ = false;\n\n if (state_ == Complete) {\n return FilterHeadersStatus::Continue;\n }\n ENVOY_LOG(debug, \"Called Mixer::Filter : {} Stop\", __func__);\n return FilterHeadersStatus::StopIteration;\n}\n\nFilterDataStatus Filter::decodeData(Buffer::Instance& data, bool end_stream) {\n ENVOY_LOG(debug, \"Called Mixer::Filter : {} ({}, {})\", __func__,\n data.length(), end_stream);\n request_total_size_ += data.length();\n if (state_ == Calling) {\n return FilterDataStatus::StopIterationAndWatermark;\n }\n return FilterDataStatus::Continue;\n}\n\nFilterTrailersStatus Filter::decodeTrailers(HeaderMap& trailers) {\n ENVOY_LOG(debug, \"Called Mixer::Filter : {}\", __func__);\n request_total_size_ += trailers.byteSize();\n if (state_ == Calling) {\n return FilterTrailersStatus::StopIteration;\n }\n return FilterTrailersStatus::Continue;\n}\n\nvoid Filter::UpdateHeaders(\n HeaderMap& headers, const ::google::protobuf::RepeatedPtrField<\n ::istio::mixer::v1::HeaderOperation>& operations) {\n for (auto const iter : operations) {\n switch (iter.operation()) {\n case ::istio::mixer::v1::HeaderOperation_Operation_REPLACE:\n headers.remove(LowerCaseString(iter.name()));\n headers.addCopy(LowerCaseString(iter.name()), iter.value());\n break;\n case ::istio::mixer::v1::HeaderOperation_Operation_REMOVE:\n headers.remove(LowerCaseString(iter.name()));\n break;\n case ::istio::mixer::v1::HeaderOperation_Operation_APPEND:\n headers.addCopy(LowerCaseString(iter.name()), iter.value());\n break;\n default:\n PANIC(\"unreachable header operation\");\n }\n }\n}\n\nFilterHeadersStatus Filter::encodeHeaders(HeaderMap& headers, bool) {\n ENVOY_LOG(debug, \"Called Mixer::Filter : {} {}\", __func__, state_);\n \/\/ Init state is possible if a filter prior to mixerfilter interrupts the\n \/\/ filter chain\n ASSERT(state_ == NotStarted || state_ == Complete || state_ == Responded);\n if (state_ == Complete) {\n \/\/ handle response header operations\n UpdateHeaders(headers, route_directive_.response_header_operations());\n }\n return FilterHeadersStatus::Continue;\n}\n\nvoid Filter::setDecoderFilterCallbacks(\n StreamDecoderFilterCallbacks& callbacks) {\n ENVOY_LOG(debug, \"Called Mixer::Filter : {}\", __func__);\n decoder_callbacks_ = &callbacks;\n}\n\nvoid Filter::completeCheck(const CheckResponseInfo& info) {\n auto status = info.response_status;\n ENVOY_LOG(debug, \"Called Mixer::Filter : check complete {}\",\n status.ToString());\n \/\/ This stream has been reset, abort the callback.\n if (state_ == Responded) {\n return;\n }\n\n if (!status.ok()) {\n state_ = Responded;\n int status_code = ::istio::utils::StatusHttpCode(status.error_code());\n decoder_callbacks_->sendLocalReply(Code(status_code), status.ToString(),\n nullptr);\n decoder_callbacks_->requestInfo().setResponseFlag(\n RequestInfo::ResponseFlag::UnauthorizedExternalService);\n return;\n }\n\n state_ = Complete;\n route_directive_ = info.route_directive;\n\n \/\/ handle direct response from the route directive\n if (status.ok() && route_directive_.direct_response_code() != 0) {\n ENVOY_LOG(debug, \"Mixer::Filter direct response\");\n state_ = Responded;\n decoder_callbacks_->sendLocalReply(\n Code(route_directive_.direct_response_code()),\n route_directive_.direct_response_body(), [this](HeaderMap& headers) {\n UpdateHeaders(headers, route_directive_.response_header_operations());\n });\n return;\n }\n\n \/\/ handle request header operations\n if (nullptr != headers_) {\n UpdateHeaders(*headers_, route_directive_.request_header_operations());\n headers_ = nullptr;\n if (route_directive_.request_header_operations().size() > 0) {\n decoder_callbacks_->clearRouteCache();\n }\n }\n\n if (!initiating_call_) {\n decoder_callbacks_->continueDecoding();\n }\n}\n\nvoid Filter::onDestroy() {\n ENVOY_LOG(debug, \"Called Mixer::Filter : {} state: {}\", __func__, state_);\n if (state_ != Calling) {\n cancel_check_ = nullptr;\n }\n state_ = Responded;\n if (cancel_check_) {\n ENVOY_LOG(debug, \"Cancelling check call\");\n cancel_check_();\n cancel_check_ = nullptr;\n }\n}\n\nvoid Filter::log(const HeaderMap* request_headers,\n const HeaderMap* response_headers,\n const HeaderMap* response_trailers,\n const RequestInfo::RequestInfo& request_info) {\n ENVOY_LOG(debug, \"Called Mixer::Filter : {}\", __func__);\n if (!handler_) {\n if (request_headers == nullptr) {\n return;\n }\n\n \/\/ Here Request is rejected by other filters, Mixer filter is not called.\n ::istio::control::http::Controller::PerRouteConfig config;\n ReadPerRouteConfig(request_info.routeEntry(), &config);\n handler_ = control_.controller()->CreateRequestHandler(config);\n\n CheckData check_data(*request_headers, request_info.dynamicMetadata(),\n nullptr);\n handler_->ExtractRequestAttributes(&check_data);\n }\n \/\/ response trailer header is not counted to response total size.\n ReportData report_data(response_headers, response_trailers, request_info,\n request_total_size_);\n handler_->Report(&report_data);\n}\n\n} \/\/ namespace Mixer\n} \/\/ namespace Http\n} \/\/ namespace Envoy\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 \"ThermalContactAction.h\"\n\n#include \"AddVariableAction.h\"\n#include \"FEProblem.h\"\n#include \"libmesh\/string_to_enum.h\"\n#include \"GapConductance.h\"\n#include \"NonlinearSystem.h\"\n\nregisterMooseAction(\"HeatConductionApp\", ThermalContactAction, \"add_aux_kernel\");\nregisterMooseAction(\"HeatConductionApp\", ThermalContactAction, \"add_aux_variable\");\nregisterMooseAction(\"HeatConductionApp\", ThermalContactAction, \"add_bc\");\nregisterMooseAction(\"HeatConductionApp\", ThermalContactAction, \"add_dirac_kernel\");\nregisterMooseAction(\"HeatConductionApp\", ThermalContactAction, \"add_material\");\nregisterMooseAction(\"HeatConductionApp\", ThermalContactAction, \"add_slave_flux_vector\");\n\ntemplate <>\nInputParameters\nvalidParams<ThermalContactAction>()\n{\n InputParameters params = validParams<Action>();\n params.addClassDescription(\n \"Action that controls the creation of all of the necessary objects for \"\n \"calculation of Thermal Contact\");\n\n params.addParam<std::string>(\n \"gap_aux_type\",\n \"GapValueAux\",\n \"A string representing the Moose object that will be used for computing the gap size\");\n params.addRequiredParam<NonlinearVariableName>(\"variable\", \"The variable for thermal contact\");\n params.addRequiredParam<BoundaryName>(\"master\", \"The master surface\");\n params.addRequiredParam<BoundaryName>(\"slave\", \"The slave surface\");\n params.addParam<Real>(\"tangential_tolerance\",\n \"Tangential distance to extend edges of contact surfaces\");\n params.addParam<Real>(\n \"normal_smoothing_distance\",\n \"Distance from edge in parametric coordinates over which to smooth contact normal\");\n params.addParam<std::string>(\"normal_smoothing_method\",\n \"Method to use to smooth normals (edge_based|nodal_normal_based)\");\n\n MooseEnum orders(AddVariableAction::getNonlinearVariableOrders());\n params.addParam<MooseEnum>(\"order\", orders, \"The finite element order\");\n\n params.addParam<bool>(\n \"warnings\", false, \"Whether to output warning messages concerning nodes not being found\");\n params.addParam<bool>(\n \"quadrature\", false, \"Whether or not to use quadrature point based gap heat transfer\");\n\n params.addParam<std::string>(\n \"appended_property_name\", \"\", \"Name appended to material properties to make them unique\");\n params.addRequiredParam<std::string>(\n \"type\",\n \"A string representing the Moose object that will be used for heat conduction over the gap\");\n\n params.addParam<std::vector<VariableName>>(\"disp_x\", \"The x displacement\");\n params.addParam<std::vector<VariableName>>(\"disp_y\", \"The y displacement\");\n params.addParam<std::vector<VariableName>>(\"disp_z\", \"The z displacement\");\n params.addParam<std::vector<VariableName>>(\n \"displacements\",\n \"The displacements appropriate for the simulation geometry and coordinate system\");\n\n params.addParam<std::vector<AuxVariableName>>(\n \"save_in\", \"The Auxiliary Variable to (optionally) save the boundary flux in\");\n params.addParam<Real>(\"gap_conductivity\", 1.0, \"The thermal conductivity of the gap material\");\n params.addParam<FunctionName>(\n \"gap_conductivity_function\",\n \"Thermal conductivity of the gap material as a function. Multiplied by gap_conductivity.\");\n params.addParam<std::vector<VariableName>>(\n \"gap_conductivity_function_variable\",\n \"Variable to be used in gap_conductivity_function in place of time\");\n\n params += GapConductance::actionParameters();\n\n return params;\n}\n\nThermalContactAction::ThermalContactAction(const InputParameters & params)\n : Action(params),\n _quadrature(getParam<bool>(\"quadrature\")),\n _order(getParam<MooseEnum>(\"order\")),\n _penetration_var_name(_quadrature ? \"qpoint_penetration\" : \"penetration\"),\n _gap_value_name(\"paired_\" + getParam<NonlinearVariableName>(\"variable\")),\n _gap_conductivity_name(\"paired_k_\" + getParam<NonlinearVariableName>(\"variable\"))\n{\n}\n\nvoid\nThermalContactAction::act()\n{\n if (_current_task == \"add_aux_kernel\")\n addAuxKernels();\n else if (_current_task == \"add_aux_variable\")\n addAuxVariables();\n else if (_current_task == \"add_bc\")\n addBCs();\n else if (_current_task == \"add_dirac_kernel\")\n addDiracKernels();\n else if (_current_task == \"add_material\")\n addMaterials();\n else if (_current_task == \"add_slave_flux_vector\")\n addSlaveFluxVector();\n}\n\nvoid\nThermalContactAction::addAuxKernels()\n{\n \/\/ Add gap aux kernel\n {\n InputParameters params = _factory.getValidParams(getParam<std::string>(\"gap_aux_type\"));\n\n params.applySpecificParameters(\n parameters(),\n {\"tangential_tolerance\", \"normal_smoothing_distance\", \"normal_smoothing_method\", \"order\"});\n params.set<AuxVariableName>(\"variable\") = _gap_value_name;\n params.set<ExecFlagEnum>(\"execute_on\", true) = {EXEC_INITIAL, EXEC_LINEAR};\n params.set<std::vector<BoundaryName>>(\"boundary\") = {getParam<BoundaryName>(\"slave\")};\n params.set<BoundaryName>(\"paired_boundary\") = getParam<BoundaryName>(\"master\");\n params.set<VariableName>(\"paired_variable\") = getParam<NonlinearVariableName>(\"variable\");\n\n _problem->addAuxKernel(getParam<std::string>(\"gap_aux_type\"), \"gap_value_\" + name(), params);\n\n if (_quadrature)\n {\n params.set<std::vector<BoundaryName>>(\"boundary\") = {getParam<BoundaryName>(\"master\")};\n params.set<BoundaryName>(\"paired_boundary\") = getParam<BoundaryName>(\"slave\");\n\n _problem->addAuxKernel(\n getParam<std::string>(\"gap_aux_type\"), \"gap_value_master_\" + name(), params);\n }\n }\n\n \/\/ Add penetration aux kernel\n {\n InputParameters params = _factory.getValidParams(\"PenetrationAux\");\n\n params.applySpecificParameters(\n parameters(),\n {\"tangential_tolerance\", \"normal_smoothing_distance\", \"normal_smoothing_method\", \"order\"});\n params.set<AuxVariableName>(\"variable\") = _penetration_var_name;\n params.set<ExecFlagEnum>(\"execute_on\", true) = {EXEC_INITIAL, EXEC_LINEAR};\n params.set<std::vector<BoundaryName>>(\"boundary\") = {getParam<BoundaryName>(\"slave\")};\n params.set<BoundaryName>(\"paired_boundary\") = getParam<BoundaryName>(\"master\");\n\n _problem->addAuxKernel(\"PenetrationAux\", \"penetration_\" + name(), params);\n }\n}\n\nvoid\nThermalContactAction::addAuxVariables()\n{\n \/\/ We need to add variables only once per variable name. However, we don't know how many unique\n \/\/ variable names we will have. So, we'll always add them.\n\n MooseEnum order = getParam<MooseEnum>(\"order\");\n std::string family = \"LAGRANGE\";\n\n if (_quadrature)\n {\n order = \"CONSTANT\";\n family = \"MONOMIAL\";\n }\n\n _problem->addAuxVariable(_penetration_var_name,\n FEType(order, Utility::string_to_enum<FEFamily>(family)));\n\n _problem->addAuxVariable(_gap_value_name,\n FEType(order, Utility::string_to_enum<FEFamily>(family)));\n}\n\nvoid\nThermalContactAction::addBCs()\n{\n const std::string object_name = getParam<std::string>(\"type\");\n InputParameters params = _factory.getValidParams(object_name);\n params.applyParameters(parameters());\n\n if (_quadrature)\n {\n params.set<BoundaryName>(\"paired_boundary\") = getParam<BoundaryName>(\"master\");\n params.set<bool>(\"use_displaced_mesh\") = true;\n }\n else\n {\n params.set<std::vector<VariableName>>(\"gap_distance\") = {\"penetration\"};\n params.set<std::vector<VariableName>>(\"gap_temp\") = {_gap_value_name};\n }\n\n params.set<std::vector<BoundaryName>>(\"boundary\") = {getParam<BoundaryName>(\"slave\")};\n\n _problem->addBoundaryCondition(object_name, \"gap_bc_\" + name(), params);\n\n if (_quadrature)\n {\n \/\/ Swap master and slave for this one\n params.set<std::vector<BoundaryName>>(\"boundary\") = {getParam<BoundaryName>(\"master\")};\n params.set<BoundaryName>(\"paired_boundary\") = getParam<BoundaryName>(\"slave\");\n\n _problem->addBoundaryCondition(object_name, \"gap_bc_master_\" + name(), params);\n }\n}\n\nvoid\nThermalContactAction::addDiracKernels()\n{\n if (_quadrature)\n return;\n\n const std::string object_name = \"GapHeatPointSourceMaster\";\n InputParameters params = _factory.getValidParams(object_name);\n params.applySpecificParameters(parameters(),\n {\"tangential_tolerance\",\n \"normal_smoothing_distance\",\n \"normal_smoothing_method\",\n \"order\",\n \"slave\",\n \"variable\"});\n params.set<BoundaryName>(\"boundary\") = getParam<BoundaryName>(\"master\");\n\n _problem->addDiracKernel(object_name, object_name + \"_\" + name(), params);\n}\n\nvoid\nThermalContactAction::addMaterials()\n{\n if (getParam<std::string>(\"type\") != \"GapHeatTransfer\")\n return;\n\n const std::string object_type = \"GapConductance\";\n\n InputParameters params = _factory.getValidParams(object_type);\n params.applyParameters(parameters(), {\"variable\"});\n\n params.set<std::vector<VariableName>>(\"variable\") = {getParam<NonlinearVariableName>(\"variable\")};\n params.set<std::vector<BoundaryName>>(\"boundary\") = {getParam<BoundaryName>(\"slave\")};\n\n if (_quadrature)\n {\n params.set<BoundaryName>(\"paired_boundary\") = getParam<BoundaryName>(\"master\");\n }\n else\n {\n params.set<std::vector<VariableName>>(\"gap_temp\") = {_gap_value_name};\n params.set<std::vector<VariableName>>(\"gap_distance\") = {\"penetration\"};\n }\n\n _problem->addMaterial(object_type, name() + \"_\" + \"gap_value\", params);\n\n if (_quadrature)\n {\n params.set<BoundaryName>(\"paired_boundary\") = getParam<BoundaryName>(\"slave\");\n params.set<std::vector<BoundaryName>>(\"boundary\") = {getParam<BoundaryName>(\"master\")};\n\n _problem->addMaterial(object_type, name() + \"_\" + \"gap_value_master\", params);\n }\n}\n\nvoid\nThermalContactAction::addSlaveFluxVector()\n{\n _problem->getNonlinearSystemBase().addVector(\"slave_flux\", false, GHOSTED);\n _problem->getNonlinearSystemBase().zeroVectorForResidual(\"slave_flux\");\n\n \/\/ It is risky to apply this optimization to contact problems\n \/\/ since the problem configuration may be changed during Jacobian\n \/\/ evaluation. We therefore turn it off for all contact problems so that\n \/\/ PETSc-3.8.4 or higher will have the same behavior as PETSc-3.8.3 or older.\n if (!_problem->isSNESMFReuseBaseSetbyUser())\n _problem->setSNESMFReuseBase(false, false);\n}\n<commit_msg>Passed warnings to GapValueAux (#12959)<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 \"ThermalContactAction.h\"\n\n#include \"AddVariableAction.h\"\n#include \"FEProblem.h\"\n#include \"libmesh\/string_to_enum.h\"\n#include \"GapConductance.h\"\n#include \"NonlinearSystem.h\"\n\nregisterMooseAction(\"HeatConductionApp\", ThermalContactAction, \"add_aux_kernel\");\nregisterMooseAction(\"HeatConductionApp\", ThermalContactAction, \"add_aux_variable\");\nregisterMooseAction(\"HeatConductionApp\", ThermalContactAction, \"add_bc\");\nregisterMooseAction(\"HeatConductionApp\", ThermalContactAction, \"add_dirac_kernel\");\nregisterMooseAction(\"HeatConductionApp\", ThermalContactAction, \"add_material\");\nregisterMooseAction(\"HeatConductionApp\", ThermalContactAction, \"add_slave_flux_vector\");\n\ntemplate <>\nInputParameters\nvalidParams<ThermalContactAction>()\n{\n InputParameters params = validParams<Action>();\n params.addClassDescription(\n \"Action that controls the creation of all of the necessary objects for \"\n \"calculation of Thermal Contact\");\n\n params.addParam<std::string>(\n \"gap_aux_type\",\n \"GapValueAux\",\n \"A string representing the Moose object that will be used for computing the gap size\");\n params.addRequiredParam<NonlinearVariableName>(\"variable\", \"The variable for thermal contact\");\n params.addRequiredParam<BoundaryName>(\"master\", \"The master surface\");\n params.addRequiredParam<BoundaryName>(\"slave\", \"The slave surface\");\n params.addParam<Real>(\"tangential_tolerance\",\n \"Tangential distance to extend edges of contact surfaces\");\n params.addParam<Real>(\n \"normal_smoothing_distance\",\n \"Distance from edge in parametric coordinates over which to smooth contact normal\");\n params.addParam<std::string>(\"normal_smoothing_method\",\n \"Method to use to smooth normals (edge_based|nodal_normal_based)\");\n\n MooseEnum orders(AddVariableAction::getNonlinearVariableOrders());\n params.addParam<MooseEnum>(\"order\", orders, \"The finite element order\");\n\n params.addParam<bool>(\n \"warnings\", false, \"Whether to output warning messages concerning nodes not being found\");\n params.addParam<bool>(\n \"quadrature\", false, \"Whether or not to use quadrature point based gap heat transfer\");\n\n params.addParam<std::string>(\n \"appended_property_name\", \"\", \"Name appended to material properties to make them unique\");\n params.addRequiredParam<std::string>(\n \"type\",\n \"A string representing the Moose object that will be used for heat conduction over the gap\");\n\n params.addParam<std::vector<VariableName>>(\"disp_x\", \"The x displacement\");\n params.addParam<std::vector<VariableName>>(\"disp_y\", \"The y displacement\");\n params.addParam<std::vector<VariableName>>(\"disp_z\", \"The z displacement\");\n params.addParam<std::vector<VariableName>>(\n \"displacements\",\n \"The displacements appropriate for the simulation geometry and coordinate system\");\n\n params.addParam<std::vector<AuxVariableName>>(\n \"save_in\", \"The Auxiliary Variable to (optionally) save the boundary flux in\");\n params.addParam<Real>(\"gap_conductivity\", 1.0, \"The thermal conductivity of the gap material\");\n params.addParam<FunctionName>(\n \"gap_conductivity_function\",\n \"Thermal conductivity of the gap material as a function. Multiplied by gap_conductivity.\");\n params.addParam<std::vector<VariableName>>(\n \"gap_conductivity_function_variable\",\n \"Variable to be used in gap_conductivity_function in place of time\");\n\n params += GapConductance::actionParameters();\n\n return params;\n}\n\nThermalContactAction::ThermalContactAction(const InputParameters & params)\n : Action(params),\n _quadrature(getParam<bool>(\"quadrature\")),\n _order(getParam<MooseEnum>(\"order\")),\n _penetration_var_name(_quadrature ? \"qpoint_penetration\" : \"penetration\"),\n _gap_value_name(\"paired_\" + getParam<NonlinearVariableName>(\"variable\")),\n _gap_conductivity_name(\"paired_k_\" + getParam<NonlinearVariableName>(\"variable\"))\n{\n}\n\nvoid\nThermalContactAction::act()\n{\n if (_current_task == \"add_aux_kernel\")\n addAuxKernels();\n else if (_current_task == \"add_aux_variable\")\n addAuxVariables();\n else if (_current_task == \"add_bc\")\n addBCs();\n else if (_current_task == \"add_dirac_kernel\")\n addDiracKernels();\n else if (_current_task == \"add_material\")\n addMaterials();\n else if (_current_task == \"add_slave_flux_vector\")\n addSlaveFluxVector();\n}\n\nvoid\nThermalContactAction::addAuxKernels()\n{\n \/\/ Add gap aux kernel\n {\n InputParameters params = _factory.getValidParams(getParam<std::string>(\"gap_aux_type\"));\n\n params.applySpecificParameters(parameters(),\n {\"tangential_tolerance\",\n \"normal_smoothing_distance\",\n \"normal_smoothing_method\",\n \"order\",\n \"warnings\"});\n params.set<AuxVariableName>(\"variable\") = _gap_value_name;\n params.set<ExecFlagEnum>(\"execute_on\", true) = {EXEC_INITIAL, EXEC_LINEAR};\n params.set<std::vector<BoundaryName>>(\"boundary\") = {getParam<BoundaryName>(\"slave\")};\n params.set<BoundaryName>(\"paired_boundary\") = getParam<BoundaryName>(\"master\");\n params.set<VariableName>(\"paired_variable\") = getParam<NonlinearVariableName>(\"variable\");\n\n _problem->addAuxKernel(getParam<std::string>(\"gap_aux_type\"), \"gap_value_\" + name(), params);\n\n if (_quadrature)\n {\n params.set<std::vector<BoundaryName>>(\"boundary\") = {getParam<BoundaryName>(\"master\")};\n params.set<BoundaryName>(\"paired_boundary\") = getParam<BoundaryName>(\"slave\");\n\n _problem->addAuxKernel(\n getParam<std::string>(\"gap_aux_type\"), \"gap_value_master_\" + name(), params);\n }\n }\n\n \/\/ Add penetration aux kernel\n {\n InputParameters params = _factory.getValidParams(\"PenetrationAux\");\n\n params.applySpecificParameters(\n parameters(),\n {\"tangential_tolerance\", \"normal_smoothing_distance\", \"normal_smoothing_method\", \"order\"});\n params.set<AuxVariableName>(\"variable\") = _penetration_var_name;\n params.set<ExecFlagEnum>(\"execute_on\", true) = {EXEC_INITIAL, EXEC_LINEAR};\n params.set<std::vector<BoundaryName>>(\"boundary\") = {getParam<BoundaryName>(\"slave\")};\n params.set<BoundaryName>(\"paired_boundary\") = getParam<BoundaryName>(\"master\");\n\n _problem->addAuxKernel(\"PenetrationAux\", \"penetration_\" + name(), params);\n }\n}\n\nvoid\nThermalContactAction::addAuxVariables()\n{\n \/\/ We need to add variables only once per variable name. However, we don't know how many unique\n \/\/ variable names we will have. So, we'll always add them.\n\n MooseEnum order = getParam<MooseEnum>(\"order\");\n std::string family = \"LAGRANGE\";\n\n if (_quadrature)\n {\n order = \"CONSTANT\";\n family = \"MONOMIAL\";\n }\n\n _problem->addAuxVariable(_penetration_var_name,\n FEType(order, Utility::string_to_enum<FEFamily>(family)));\n\n _problem->addAuxVariable(_gap_value_name,\n FEType(order, Utility::string_to_enum<FEFamily>(family)));\n}\n\nvoid\nThermalContactAction::addBCs()\n{\n const std::string object_name = getParam<std::string>(\"type\");\n InputParameters params = _factory.getValidParams(object_name);\n params.applyParameters(parameters());\n\n if (_quadrature)\n {\n params.set<BoundaryName>(\"paired_boundary\") = getParam<BoundaryName>(\"master\");\n params.set<bool>(\"use_displaced_mesh\") = true;\n }\n else\n {\n params.set<std::vector<VariableName>>(\"gap_distance\") = {\"penetration\"};\n params.set<std::vector<VariableName>>(\"gap_temp\") = {_gap_value_name};\n }\n\n params.set<std::vector<BoundaryName>>(\"boundary\") = {getParam<BoundaryName>(\"slave\")};\n\n _problem->addBoundaryCondition(object_name, \"gap_bc_\" + name(), params);\n\n if (_quadrature)\n {\n \/\/ Swap master and slave for this one\n params.set<std::vector<BoundaryName>>(\"boundary\") = {getParam<BoundaryName>(\"master\")};\n params.set<BoundaryName>(\"paired_boundary\") = getParam<BoundaryName>(\"slave\");\n\n _problem->addBoundaryCondition(object_name, \"gap_bc_master_\" + name(), params);\n }\n}\n\nvoid\nThermalContactAction::addDiracKernels()\n{\n if (_quadrature)\n return;\n\n const std::string object_name = \"GapHeatPointSourceMaster\";\n InputParameters params = _factory.getValidParams(object_name);\n params.applySpecificParameters(parameters(),\n {\"tangential_tolerance\",\n \"normal_smoothing_distance\",\n \"normal_smoothing_method\",\n \"order\",\n \"slave\",\n \"variable\"});\n params.set<BoundaryName>(\"boundary\") = getParam<BoundaryName>(\"master\");\n\n _problem->addDiracKernel(object_name, object_name + \"_\" + name(), params);\n}\n\nvoid\nThermalContactAction::addMaterials()\n{\n if (getParam<std::string>(\"type\") != \"GapHeatTransfer\")\n return;\n\n const std::string object_type = \"GapConductance\";\n\n InputParameters params = _factory.getValidParams(object_type);\n params.applyParameters(parameters(), {\"variable\"});\n\n params.set<std::vector<VariableName>>(\"variable\") = {getParam<NonlinearVariableName>(\"variable\")};\n params.set<std::vector<BoundaryName>>(\"boundary\") = {getParam<BoundaryName>(\"slave\")};\n\n if (_quadrature)\n {\n params.set<BoundaryName>(\"paired_boundary\") = getParam<BoundaryName>(\"master\");\n }\n else\n {\n params.set<std::vector<VariableName>>(\"gap_temp\") = {_gap_value_name};\n params.set<std::vector<VariableName>>(\"gap_distance\") = {\"penetration\"};\n }\n\n _problem->addMaterial(object_type, name() + \"_\" + \"gap_value\", params);\n\n if (_quadrature)\n {\n params.set<BoundaryName>(\"paired_boundary\") = getParam<BoundaryName>(\"slave\");\n params.set<std::vector<BoundaryName>>(\"boundary\") = {getParam<BoundaryName>(\"master\")};\n\n _problem->addMaterial(object_type, name() + \"_\" + \"gap_value_master\", params);\n }\n}\n\nvoid\nThermalContactAction::addSlaveFluxVector()\n{\n _problem->getNonlinearSystemBase().addVector(\"slave_flux\", false, GHOSTED);\n _problem->getNonlinearSystemBase().zeroVectorForResidual(\"slave_flux\");\n\n \/\/ It is risky to apply this optimization to contact problems\n \/\/ since the problem configuration may be changed during Jacobian\n \/\/ evaluation. We therefore turn it off for all contact problems so that\n \/\/ PETSc-3.8.4 or higher will have the same behavior as PETSc-3.8.3 or older.\n if (!_problem->isSNESMFReuseBaseSetbyUser())\n _problem->setSNESMFReuseBase(false, false);\n}\n<|endoftext|>"} {"text":"<commit_before>MatrixXi m = MatrixXi::Random(3,4);\ncout << \"Here is the matrix m:\" << endl << m << endl;\ncout << \"Here is the reverse of m:\" << endl << m.reverse() << endl;\ncout << \"Here is the coefficient (1,0) in the reverse of m:\" << endl\n << m.reverse()(1,0) << endl;\ncout << \"Let us overwrite this coefficient with the value 4.\" << endl;\n\/\/m.reverse()(1,0) = 4;\ncout << \"Now the matrix m is:\" << endl << m << endl;\n<commit_msg>I doubt this change was intented to be committed<commit_after>MatrixXi m = MatrixXi::Random(3,4);\ncout << \"Here is the matrix m:\" << endl << m << endl;\ncout << \"Here is the reverse of m:\" << endl << m.reverse() << endl;\ncout << \"Here is the coefficient (1,0) in the reverse of m:\" << endl\n << m.reverse()(1,0) << endl;\ncout << \"Let us overwrite this coefficient with the value 4.\" << endl;\nm.reverse()(1,0) = 4;\ncout << \"Now the matrix m is:\" << endl << m << endl;\n<|endoftext|>"} {"text":"<commit_before>\/*************************************************************************\n *\n * OpenOffice.org - a multi-platform office productivity suite\n *\n * $RCSfile: wakeupevent.cxx,v $\n *\n * $Revision: 1.7 $\n *\n * last change: $Author: kz $ $Date: 2006-12-13 15:23:54 $\n *\n * The Contents of this file are made available subject to\n * the terms of GNU Lesser General Public License Version 2.1.\n *\n *\n * GNU Lesser General Public License Version 2.1\n * =============================================\n * Copyright 2005 by Sun Microsystems, Inc.\n * 901 San Antonio Road, Palo Alto, CA 94303, USA\n *\n * This library is free software; you can redistribute it and\/or\n * modify it under the terms of the GNU Lesser General Public\n * License version 2.1, as published by the Free Software Foundation.\n *\n * This library is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU\n * Lesser General Public License for more details.\n *\n * You should have received a copy of the GNU Lesser General Public\n * License along with this library; if not, write to the Free Software\n * Foundation, Inc., 59 Temple Place, Suite 330, Boston,\n * MA 02111-1307 USA\n *\n ************************************************************************\/\n\n\/\/ MARKER(update_precomp.py): autogen include statement, do not remove\n#include \"precompiled_slideshow.hxx\"\n\n\/\/ must be first\n#include <canvas\/debug.hxx>\n#include <canvas\/verbosetrace.hxx>\n\n#include <wakeupevent.hxx>\n\n\nnamespace slideshow\n{\n namespace internal\n {\n WakeupEvent::WakeupEvent(\n boost::shared_ptr<canvas::tools::ElapsedTime> const & pTimeBase,\n ActivitiesQueue& rActivityQueue ) :\n maTimer(pTimeBase),\n mnNextTime(0.0),\n mpActivity(),\n mrActivityQueue( rActivityQueue )\n {\n }\n\n void WakeupEvent::dispose()\n {\n mpActivity.reset();\n }\n\n bool WakeupEvent::fire()\n {\n if( !mpActivity )\n return false;\n\n return mrActivityQueue.addActivity( mpActivity );\n }\n\n bool WakeupEvent::isCharged() const\n {\n \/\/ this event won't expire, we fire everytime we're\n \/\/ re-inserted into the event queue.\n return true;\n }\n\n double WakeupEvent::getActivationTime( double nCurrentTime ) const\n {\n const double nElapsedTime( maTimer.getElapsedTime() );\n\n return ::std::max( nCurrentTime,\n nCurrentTime - nElapsedTime + mnNextTime );\n }\n\n void WakeupEvent::start()\n {\n \/\/ start timer\n maTimer.reset();\n }\n\n void WakeupEvent::setNextTimeout( double rNextTime )\n {\n mnNextTime = rNextTime;\n }\n\n void WakeupEvent::setActivity( const ActivitySharedPtr& rActivity )\n {\n mpActivity = rActivity;\n }\n }\n}\n<commit_msg>INTEGRATION: CWS changefileheader (1.7.74); FILE MERGED 2008\/03\/31 14:00:15 rt 1.7.74.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: wakeupevent.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_slideshow.hxx\"\n\n\/\/ must be first\n#include <canvas\/debug.hxx>\n#include <canvas\/verbosetrace.hxx>\n\n#include <wakeupevent.hxx>\n\n\nnamespace slideshow\n{\n namespace internal\n {\n WakeupEvent::WakeupEvent(\n boost::shared_ptr<canvas::tools::ElapsedTime> const & pTimeBase,\n ActivitiesQueue& rActivityQueue ) :\n maTimer(pTimeBase),\n mnNextTime(0.0),\n mpActivity(),\n mrActivityQueue( rActivityQueue )\n {\n }\n\n void WakeupEvent::dispose()\n {\n mpActivity.reset();\n }\n\n bool WakeupEvent::fire()\n {\n if( !mpActivity )\n return false;\n\n return mrActivityQueue.addActivity( mpActivity );\n }\n\n bool WakeupEvent::isCharged() const\n {\n \/\/ this event won't expire, we fire everytime we're\n \/\/ re-inserted into the event queue.\n return true;\n }\n\n double WakeupEvent::getActivationTime( double nCurrentTime ) const\n {\n const double nElapsedTime( maTimer.getElapsedTime() );\n\n return ::std::max( nCurrentTime,\n nCurrentTime - nElapsedTime + mnNextTime );\n }\n\n void WakeupEvent::start()\n {\n \/\/ start timer\n maTimer.reset();\n }\n\n void WakeupEvent::setNextTimeout( double rNextTime )\n {\n mnNextTime = rNextTime;\n }\n\n void WakeupEvent::setActivity( const ActivitySharedPtr& rActivity )\n {\n mpActivity = rActivity;\n }\n }\n}\n<|endoftext|>"} {"text":"<commit_before>\/**\n * @file\n *\/\n#include \"libbirch\/Memo.hpp\"\n\n#include \"libbirch\/SwapClone.hpp\"\n#include \"libbirch\/SwapContext.hpp\"\n\nbi::Memo::Memo() :\n isForked(false) {\n \/\/\n}\n\nbi::Memo::Memo(Memo* parent, const bool isForwarding) :\n cloneParent(isForwarding ? nullptr : parent),\n forwardParent(isForwarding ? parent : nullptr),\n isForked(false) {\n \/\/\n}\n\nbi::Memo::~Memo() {\n \/\/\n}\n\nbool bi::Memo::hasAncestor(Memo* memo) const {\n SharedPtr<Memo> parent = getParent();\n return parent && (parent == memo || parent->hasAncestor(memo));\n}\n\nbi::Memo* bi::Memo::fork() {\n #if USE_LAZY_DEEP_CLONE\n isForked = true;\n #endif\n return create(this, false);\n}\n\nvoid bi::Memo::clean() {\n auto parent = getParent();\n if (parent) {\n parent->clean();\n }\n clones.clean();\n}\n\nbi::Memo* bi::Memo::forwardGet() {\n #if USE_LAZY_DEEP_CLONE\n \/\/\/@todo make this thread safe\n if (forwardChild) {\n return forwardChild->forwardGet();\n } else if (isForked) {\n forwardChild = create(this, true);\n clean();\n return forwardChild.get();\n } else {\n return this;\n }\n #else\n return this;\n #endif\n}\n\nbi::Memo* bi::Memo::forwardPull() {\n #if USE_LAZY_DEEP_CLONE\n return forwardChild ? forwardChild->forwardPull() : this;\n #else\n return this;\n #endif\n}\n\nbi::SharedPtr<bi::Memo> bi::Memo::getParent() const {\n return cloneParent ? cloneParent : SharedPtr<Memo>(forwardParent);\n}\n\nbi::Any* bi::Memo::get(Any* o) {\n if (!o || o->getContext() == this) {\n return o;\n } else {\n Any* result = clones.get(o);\n if (!result) {\n #if USE_LAZY_DEEP_CLONE\n \/* for a lazy deep clone there is no risk of infinite recursion, but\n * there may be thread contention if two threads access the same object\n * and both trigger a lazy clone simultaneously; in this case multiple\n * new objects may be made but only one thread can be successful in\n * inserting an object into the map; a shared pointer is used to\n * destroy any additional objects *\/\n SwapClone swapClone(true);\n SwapContext swapContext(this);\n SharedPtr<Any> cloned = o->clone();\n \/\/ ^ use shared to clean up if beaten by another thread\n result = clones.put(o, cloned.get());\n #else\n \/* for an eager deep clone we must be cautious to avoid infinite\n * recursion; memory for the new object is allocated first and put\n * in the map in case of deeper pointers back to the same object; then\n * the new object is constructed; there is no risk of another thread\n * accessing the uninitialized memory as the deep clone is not\n * accessible to other threads until completion; the new object will\n * at least have completed the Counted() constructor to initialize\n * reference counts before any recursive clones occur *\/\n Any* alloc = static_cast<Any*>(allocate(o->getSize()));\n assert(alloc);\n Any* uninit = m->clones.uninitialized_put(o, alloc);\n assert(uninit == alloc); \/\/ should be no thread contention here\n SwapClone swapClone(true);\n SwapContext swapContext(this);\n result = o->clone(uninit);\n assert(result == uninit); \/\/ clone should be in the allocation\n o->incMemo(); \/\/ uninitialized_put(), so responsible for ref counts\n result->incShared();\n #endif\n }\n return result;\n }\n}\n\nbi::Any* bi::Memo::pull(Any* o) {\n if (!o || o->getContext() == this) {\n return o;\n } else {\n return clones.get(o, o);\n }\n}\n\nbi::Any* bi::Memo::deep(Any* o) {\n if (!o || o->getContext() == this) {\n return o;\n } else {\n Any* result = clones.get(o);\n if (!result) {\n auto parent = getParent();\n if (parent) {\n result = parent->deep(o);\n if (result != o) {\n result = clones.get(result, result);\n }\n } else {\n result = o;\n }\n result = clones.put(o, result);\n }\n return result;\n }\n}\n<commit_msg>Made new sweep clean shallow rather than recursing all the way back to root memo. Won't generalise well, but sufficient for current use cases.<commit_after>\/**\n * @file\n *\/\n#include \"libbirch\/Memo.hpp\"\n\n#include \"libbirch\/SwapClone.hpp\"\n#include \"libbirch\/SwapContext.hpp\"\n\nbi::Memo::Memo() :\n isForked(false) {\n \/\/\n}\n\nbi::Memo::Memo(Memo* parent, const bool isForwarding) :\n cloneParent(isForwarding ? nullptr : parent),\n forwardParent(isForwarding ? parent : nullptr),\n isForked(false) {\n \/\/\n}\n\nbi::Memo::~Memo() {\n \/\/\n}\n\nbool bi::Memo::hasAncestor(Memo* memo) const {\n SharedPtr<Memo> parent = getParent();\n return parent && (parent == memo || parent->hasAncestor(memo));\n}\n\nbi::Memo* bi::Memo::fork() {\n #if USE_LAZY_DEEP_CLONE\n isForked = true;\n #endif\n return create(this, false);\n}\n\nvoid bi::Memo::clean() {\n \/* for current use cases, just clean the current memo, not parents *\/\n \/\/auto parent = getParent();\n \/\/if (parent) {\n \/\/ parent->clean();\n \/\/}\n clones.clean();\n}\n\nbi::Memo* bi::Memo::forwardGet() {\n #if USE_LAZY_DEEP_CLONE\n \/\/\/@todo make this thread safe\n if (forwardChild) {\n return forwardChild->forwardGet();\n } else if (isForked) {\n forwardChild = create(this, true);\n clean();\n return forwardChild.get();\n } else {\n return this;\n }\n #else\n return this;\n #endif\n}\n\nbi::Memo* bi::Memo::forwardPull() {\n #if USE_LAZY_DEEP_CLONE\n return forwardChild ? forwardChild->forwardPull() : this;\n #else\n return this;\n #endif\n}\n\nbi::SharedPtr<bi::Memo> bi::Memo::getParent() const {\n return cloneParent ? cloneParent : SharedPtr<Memo>(forwardParent);\n}\n\nbi::Any* bi::Memo::get(Any* o) {\n if (!o || o->getContext() == this) {\n return o;\n } else {\n Any* result = clones.get(o);\n if (!result) {\n #if USE_LAZY_DEEP_CLONE\n \/* for a lazy deep clone there is no risk of infinite recursion, but\n * there may be thread contention if two threads access the same object\n * and both trigger a lazy clone simultaneously; in this case multiple\n * new objects may be made but only one thread can be successful in\n * inserting an object into the map; a shared pointer is used to\n * destroy any additional objects *\/\n SwapClone swapClone(true);\n SwapContext swapContext(this);\n SharedPtr<Any> cloned = o->clone();\n \/\/ ^ use shared to clean up if beaten by another thread\n result = clones.put(o, cloned.get());\n #else\n \/* for an eager deep clone we must be cautious to avoid infinite\n * recursion; memory for the new object is allocated first and put\n * in the map in case of deeper pointers back to the same object; then\n * the new object is constructed; there is no risk of another thread\n * accessing the uninitialized memory as the deep clone is not\n * accessible to other threads until completion; the new object will\n * at least have completed the Counted() constructor to initialize\n * reference counts before any recursive clones occur *\/\n Any* alloc = static_cast<Any*>(allocate(o->getSize()));\n assert(alloc);\n Any* uninit = m->clones.uninitialized_put(o, alloc);\n assert(uninit == alloc); \/\/ should be no thread contention here\n SwapClone swapClone(true);\n SwapContext swapContext(this);\n result = o->clone(uninit);\n assert(result == uninit); \/\/ clone should be in the allocation\n o->incMemo(); \/\/ uninitialized_put(), so responsible for ref counts\n result->incShared();\n #endif\n }\n return result;\n }\n}\n\nbi::Any* bi::Memo::pull(Any* o) {\n if (!o || o->getContext() == this) {\n return o;\n } else {\n return clones.get(o, o);\n }\n}\n\nbi::Any* bi::Memo::deep(Any* o) {\n if (!o || o->getContext() == this) {\n return o;\n } else {\n Any* result = clones.get(o);\n if (!result) {\n auto parent = getParent();\n if (parent) {\n result = parent->deep(o);\n if (result != o) {\n result = clones.get(result, result);\n }\n } else {\n result = o;\n }\n result = clones.put(o, result);\n }\n return result;\n }\n}\n<|endoftext|>"} {"text":"<commit_before>\/*\n * Copyright 2016 - 2021 gary@drinkingtea.net\n *\n * This Source Code Form is subject to the terms of the Mozilla Public\n * License, v. 2.0. If a copy of the MPL was not distributed with this\n * file, You can obtain one at http:\/\/mozilla.org\/MPL\/2.0\/.\n *\/\n\n#pragma once\n\n#include <ox\/std\/types.hpp>\n#include <ox\/std\/vector.hpp>\n\nnamespace nostalgia::scene {\n\nstruct TileDoc {\n\n\tconstexpr static auto Fields = 2;\n\tconstexpr static auto Preloadable = true;\n\tconstexpr static auto TypeName = \"net.drinkingtea.nostalgia.scene.Tile\";\n\tconstexpr static auto TypeVersion = 1;\n\n\tuint16_t sheetIdx = 0;\n\tuint8_t type = 0;\n\n};\n\nstruct SceneDoc {\n\n\tusing TileMapRow = ox::Vector<TileDoc>;\n\tusing TileMapLayer = ox::Vector<TileMapRow>;\n\tusing TileMap = ox::Vector<TileMapLayer>;\n\n\tconstexpr static auto Fields = 1;\n\tconstexpr static auto Preloadable = true;\n\tconstexpr static auto TypeName = \"net.drinkingtea.nostalgia.scene.Scene\";\n\tconstexpr static auto TypeVersion = 1;\n\n\tTileMap tiles;\n\n};\n\nstruct SceneInstance {\n\n\tuint16_t layers = 0;\n\tuint16_t *columns = nullptr;\n\tuint16_t *rows = nullptr;\n\tuint16_t **tileMapIdx = nullptr;\n\tuint8_t **tileType = nullptr;\n\n};\n\n}\n<commit_msg>[nostalgia\/scene] Add models for Doc types<commit_after>\/*\n * Copyright 2016 - 2021 gary@drinkingtea.net\n *\n * This Source Code Form is subject to the terms of the Mozilla Public\n * License, v. 2.0. If a copy of the MPL was not distributed with this\n * file, You can obtain one at http:\/\/mozilla.org\/MPL\/2.0\/.\n *\/\n\n#pragma once\n\n#include <ox\/std\/error.hpp>\n#include <ox\/std\/types.hpp>\n#include <ox\/std\/vector.hpp>\n\nnamespace nostalgia::scene {\n\nstruct TileDoc {\n\n\tconstexpr static auto Fields = 2;\n\tconstexpr static auto Preloadable = true;\n\tconstexpr static auto TypeName = \"net.drinkingtea.nostalgia.scene.Tile\";\n\tconstexpr static auto TypeVersion = 1;\n\n\tuint16_t sheetIdx = 0;\n\tuint8_t type = 0;\n\n};\n\ntemplate<typename T>\nconstexpr ox::Error model(T *io, TileDoc *obj) {\n\tio->template setTypeInfo<TileDoc>();\n\toxReturnError(io->field(\"sheetIdx\", &obj->sheetIdx));\n\toxReturnError(io->field(\"type\", &obj->type));\n\treturn OxError(0);\n}\n\nstruct SceneDoc {\n\n\tusing TileMapRow = ox::Vector<TileDoc>;\n\tusing TileMapLayer = ox::Vector<TileMapRow>;\n\tusing TileMap = ox::Vector<TileMapLayer>;\n\n\tconstexpr static auto Fields = 1;\n\tconstexpr static auto Preloadable = true;\n\tconstexpr static auto TypeName = \"net.drinkingtea.nostalgia.scene.Scene\";\n\tconstexpr static auto TypeVersion = 1;\n\n\tTileMap tiles;\n\n};\n\ntemplate<typename T>\nconstexpr ox::Error model(T *io, SceneDoc *obj) {\n\tio->template setTypeInfo<SceneDoc>();\n\toxReturnError(io->field(\"tiles\", &obj->tiles));\n\treturn OxError(0);\n}\n\nstruct SceneInstance {\n\n\tuint16_t layers = 0;\n\tuint16_t *columns = nullptr;\n\tuint16_t *rows = nullptr;\n\tuint16_t **tileMapIdx = nullptr;\n\tuint8_t **tileType = nullptr;\n\n};\n\n}\n<|endoftext|>"} {"text":"<commit_before>\/\/===----------------------------------------------------------------------===\/\/\n\/\/\n\/\/ The LLVM Compiler Infrastructure\n\/\/\n\/\/ This file is dual licensed under the MIT and the University of Illinois Open\n\/\/ Source Licenses. See LICENSE.TXT for details.\n\/\/\n\/\/===----------------------------------------------------------------------===\/\/\n\n\/\/ <queue>\n\n\/\/ template <class T, class Container = vector<T>,\n\/\/ class Compare = less<typename Container::value_type>>\n\/\/ class priority_queue\n\/\/ {\n\/\/ public:\n\/\/ typedef Container container_type;\n\/\/ typedef Compare value_compare; \/\/ LWG#2684\n\/\/ typedef typename container_type::value_type value_type;\n\/\/ typedef typename container_type::reference reference;\n\/\/ typedef typename container_type::const_reference const_reference;\n\/\/ typedef typename container_type::size_type size_type;\n\/\/\n\/\/ protected:\n\/\/ container_type c;\n\/\/ Compare comp;\n\n#include <queue>\n#include <cassert>\n#include <type_traits>\n\nstruct test\n : private std::priority_queue<int>\n{\n test()\n {\n c.push_back(1);\n assert(comp(1, 2));\n }\n};\n\nstruct C\n{\n typedef int value_type;\n typedef int& reference;\n typedef const int& const_reference;\n typedef int size_type;\n};\n\nint main()\n{\n static_assert(( std::is_same<std::priority_queue<int>::container_type, std::vector<int> >::value), \"\");\n static_assert(( std::is_same<std::priority_queue<int, std::deque<int> >::container_type, std::deque<int> >::value), \"\");\n static_assert(( std::is_same<std::priority_queue<int, std::deque<int> >::value_type, int>::value), \"\");\n static_assert(( std::is_same<std::priority_queue<int>::reference, std::vector<int>::reference>::value), \"\");\n static_assert(( std::is_same<std::priority_queue<int>::const_reference, std::vector<int>::const_reference>::value), \"\");\n static_assert(( std::is_same<std::priority_queue<int>::size_type, std::vector<int>::size_type>::value), \"\");\n static_assert(( std::is_same<std::priority_queue<int>::value_compare, std::less<int> >::value), \"\");\n static_assert(( std::is_same<std::priority_queue<int, std::deque<int> >::value_compare, std::less<int> >::value), \"\");\n static_assert(( std::is_same<std::priority_queue<int, std::deque<int>, std::greater<int> >::value_compare, std::greater<int> >::value), \"\");\n static_assert(( std::uses_allocator<std::priority_queue<int>, std::allocator<int> >::value), \"\");\n static_assert((!std::uses_allocator<std::priority_queue<int, C>, std::allocator<int> >::value), \"\");\n test t;\n}\n<commit_msg>Add includes in test. Patch from STL@microsoft.com<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\/\/ <queue>\n\n\/\/ template <class T, class Container = vector<T>,\n\/\/ class Compare = less<typename Container::value_type>>\n\/\/ class priority_queue\n\/\/ {\n\/\/ public:\n\/\/ typedef Container container_type;\n\/\/ typedef Compare value_compare; \/\/ LWG#2684\n\/\/ typedef typename container_type::value_type value_type;\n\/\/ typedef typename container_type::reference reference;\n\/\/ typedef typename container_type::const_reference const_reference;\n\/\/ typedef typename container_type::size_type size_type;\n\/\/\n\/\/ protected:\n\/\/ container_type c;\n\/\/ Compare comp;\n\n#include <queue>\n#include <cassert>\n#include <deque>\n#include <functional>\n#include <memory>\n#include <type_traits>\n#include <vector>\n\nstruct test\n : private std::priority_queue<int>\n{\n test()\n {\n c.push_back(1);\n assert(comp(1, 2));\n }\n};\n\nstruct C\n{\n typedef int value_type;\n typedef int& reference;\n typedef const int& const_reference;\n typedef int size_type;\n};\n\nint main()\n{\n static_assert(( std::is_same<std::priority_queue<int>::container_type, std::vector<int> >::value), \"\");\n static_assert(( std::is_same<std::priority_queue<int, std::deque<int> >::container_type, std::deque<int> >::value), \"\");\n static_assert(( std::is_same<std::priority_queue<int, std::deque<int> >::value_type, int>::value), \"\");\n static_assert(( std::is_same<std::priority_queue<int>::reference, std::vector<int>::reference>::value), \"\");\n static_assert(( std::is_same<std::priority_queue<int>::const_reference, std::vector<int>::const_reference>::value), \"\");\n static_assert(( std::is_same<std::priority_queue<int>::size_type, std::vector<int>::size_type>::value), \"\");\n static_assert(( std::is_same<std::priority_queue<int>::value_compare, std::less<int> >::value), \"\");\n static_assert(( std::is_same<std::priority_queue<int, std::deque<int> >::value_compare, std::less<int> >::value), \"\");\n static_assert(( std::is_same<std::priority_queue<int, std::deque<int>, std::greater<int> >::value_compare, std::greater<int> >::value), \"\");\n static_assert(( std::uses_allocator<std::priority_queue<int>, std::allocator<int> >::value), \"\");\n static_assert((!std::uses_allocator<std::priority_queue<int, C>, std::allocator<int> >::value), \"\");\n test t;\n}\n<|endoftext|>"} {"text":"<commit_before>#include <test\/unit\/math\/test_ad.hpp>\n#include <test\/unit\/math\/mix\/fun\/offset_multiplier_constrain_matvar_helpers.hpp>\n\n\/\/ real[], real[], real[]\n\/\/ real[], real, real[]\n\/\/ real[], real[], real\nTEST(mathMixMatFun, offset_multiplier_constrain_matvar_stdvec_constrain) {\n std::vector<double> A{5.0, 2.0, 4.0, -2.0};\n std::vector<double> mum{-3.0, 3.0, -6.0, 6.0};\n std::vector<double> sigmam{-1.0, 5.0, 0.0, 38.0};\n offset_multiplier_constrain_tests::expect_vec_matvar(A, mum, sigmam);\n double mud = -6.0;\n offset_multiplier_constrain_tests::expect_vec_matvar(A, mud, sigmam);\n double sigmad = 8.0;\n offset_multiplier_constrain_tests::expect_vec_matvar(A, mud, sigmad);\n offset_multiplier_constrain_tests::expect_vec_matvar(A, mum, sigmad);\n}\n\n\/\/ array matrix[], array matrix[], array matrix[]\n\/\/ array matrix[], array matrix[], matrix[]\n\/\/ array matrix[], matrix[], array matrix[]\n\/\/ array matrix[], matrix[], matrix[]\n\/\/ array matrix[], array matrix[], real\n\/\/ array matrix[], real, array matrix[]\n\/\/ array matrix[], matrix[], real\n\/\/ array matrix[], real, matrix[]\n\/\/ array matrix[], real, real\nTEST(mathMixMatFun, offset_multiplier_matvar_stdvec_mat_scalar_constrain) {\n Eigen::MatrixXd A_inner(2, 3);\n \/\/ swapping 0.0000001 for 0 causes a failure for the hessian?\n A_inner << 5.0, 2.0, 4.0, -2.0, 0.0000001, 0.1;\n Eigen::MatrixXd mu_inner(2, 3);\n mu_inner << -1.0, 1.0, -6.0, 1.0, 0.0, 0.01;\n Eigen::MatrixXd sigma_inner(2, 3);\n sigma_inner << 6.0, 3.0, 12.0, 38.0, 0.1, 0.15;\n\n std::vector<Eigen::MatrixXd> A{A_inner, A_inner};\n std::vector<Eigen::MatrixXd> mu_vec{mu_inner, mu_inner};\n std::vector<Eigen::MatrixXd> sigma_vec{sigma_inner, sigma_inner};\n double mu_scal = -1.0;\n double sigma_scal = 7.0;\n offset_multiplier_constrain_tests::expect_vec_matvar(A, mu_scal, sigma_inner);\n offset_multiplier_constrain_tests::expect_vec_matvar(A, mu_inner, sigma_scal);\n offset_multiplier_constrain_tests::expect_vec_matvar(A, mu_scal, sigma_scal);\n}\n<commit_msg>breakup offset_mul tests more<commit_after>#include <test\/unit\/math\/test_ad.hpp>\n#include <test\/unit\/math\/mix\/fun\/offset_multiplier_constrain_matvar_helpers.hpp>\n\n\/\/ array matrix[], array matrix[], array matrix[]\n\/\/ array matrix[], array matrix[], matrix[]\n\/\/ array matrix[], matrix[], array matrix[]\n\/\/ array matrix[], matrix[], matrix[]\n\/\/ array matrix[], array matrix[], real\n\/\/ array matrix[], real, array matrix[]\n\/\/ array matrix[], matrix[], real\n\/\/ array matrix[], real, matrix[]\n\/\/ array matrix[], real, real\nTEST(mathMixMatFun, offset_multiplier_matvar_stdvec_mat_scalar_constrain) {\n Eigen::MatrixXd A_inner(2, 3);\n \/\/ swapping 0.0000001 for 0 causes a failure for the hessian?\n A_inner << 5.0, 2.0, 4.0, -2.0, 0.0000001, 0.1;\n Eigen::MatrixXd mu_inner(2, 3);\n mu_inner << -1.0, 1.0, -6.0, 1.0, 0.0, 0.01;\n Eigen::MatrixXd sigma_inner(2, 3);\n sigma_inner << 6.0, 3.0, 12.0, 38.0, 0.1, 0.15;\n\n std::vector<Eigen::MatrixXd> A{A_inner, A_inner};\n std::vector<Eigen::MatrixXd> mu_vec{mu_inner, mu_inner};\n std::vector<Eigen::MatrixXd> sigma_vec{sigma_inner, sigma_inner};\n double mu_scal = -1.0;\n double sigma_scal = 7.0;\n offset_multiplier_constrain_tests::expect_vec_matvar(A, mu_scal, sigma_inner);\n offset_multiplier_constrain_tests::expect_vec_matvar(A, mu_inner, sigma_scal);\n offset_multiplier_constrain_tests::expect_vec_matvar(A, mu_scal, sigma_scal);\n}\n<|endoftext|>"} {"text":"<commit_before>\/*\n*\n* Copyright 2013 Telefonica Investigacion y Desarrollo, S.A.U\n*\n* This file is part of Orion Context Broker.\n*\n* Orion Context Broker is free software: you can redistribute it and\/or\n* modify it under the terms of the GNU Affero General Public License as\n* published by the Free Software Foundation, either version 3 of the\n* License, or (at your option) any later version.\n*\n* Orion Context Broker is distributed in the hope that it will be useful,\n* but WITHOUT ANY WARRANTY; without even the implied warranty of\n* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU Affero\n* General Public License for more details.\n*\n* You should have received a copy of the GNU Affero General Public License\n* along with Orion Context Broker. If not, see http:\/\/www.gnu.org\/licenses\/.\n*\n* For those usages not covered by this license please contact with\n* fermin at tid dot es\n*\n* Author: Ken Zangelin\n*\/\n#include \"gtest\/gtest.h\"\n\n#include \"logMsg\/logMsg.h\"\n#include \"logMsg\/traceLevels.h\"\n#include \"common\/globals.h\"\n\n#include \"convenience\/RegisterProviderRequest.h\"\n#include \"convenience\/UpdateContextElementRequest.h\"\n#include \"convenience\/UpdateContextElementResponse.h\"\n#include \"convenienceMap\/mapPutIndividualContextEntity.h\"\n#include \"convenienceMap\/mapDeleteIndividualContextEntity.h\"\n#include \"mongoBackend\/mongoRegisterContext.h\"\n#include \"ngsi9\/RegisterContextResponse.h\"\n#include \"ngsi9\/DiscoverContextAvailabilityResponse.h\"\n#include \"testInit.h\"\n#include \"commonMocks.h\"\n\n\n\nusing ::testing::_;\nusing ::testing::Throw;\nusing ::testing::Return;\n\n\n\n\/* ****************************************************************************\n*\n* prepareDatabase -\n*\/\nstatic void prepareDatabase(std::string id, std::string type)\n{\n \/* Set database *\/\n setupDatabase();\n\n DBClientConnection* connection = getMongoConnection();\n\n \/* We create one entity:\n *\n * - 'id', 'type' with four attributes\n * A1: X\n * A1: Y\n * A2: Z\n * A3: W\n *\/\n\n BSONObj en1 = BSON(\"_id\" << BSON(\"id\" << id << \"type\" << type) <<\n \"attrs\" << BSON_ARRAY(\n BSON(\"name\" << \"A1\" << \"type\" << \"TA1\" << \"value\" << \"X\") <<\n BSON(\"name\" << \"A1\" << \"type\" << \"TA1bis\" << \"value\" << \"Y\") <<\n BSON(\"name\" << \"A2\" << \"type\" << \"TA2\" << \"value\" << \"Z\") <<\n BSON(\"name\" << \"A3\" << \"type\" << \"TA3\" << \"value\" << \"W\")\n )\n );\n\n connection->insert(ENTITIES_COLL, en1);\n}\n\n\n\n\/* ****************************************************************************\n*\n* notFoundThenFound - \n*\/\nTEST(mapPutIndividualContextEntity, notFoundThenFound)\n{\n HttpStatusCode ms;\n UpdateContextElementRequest request;\n UpdateContextElementResponse response;\n\n \/* Set timer *\/\n Timer* t = new Timer();\n setTimer(t);\n\n prepareDatabase(\"MPICE\", \"ttt\");\n request.attributeDomainName.set(\"ad\");\n\n ms = mapPutIndividualContextEntity(\"MPICE\", &request, &response);\n EXPECT_EQ(SccOk, ms);\n EXPECT_EQ(200, response.errorCode.code);\n\n ms = mapPutIndividualContextEntity(\"MPICE2\", &request, &response);\n EXPECT_EQ(SccOk, ms);\n \/\/ FIXME: next should be change 404 -> 200 in the case PUT is interpreted as POST in this case, but\n \/\/ not sure...\n EXPECT_EQ(404, response.errorCode.code);\n\n \/\/ Cleanup\n StatusCode sCode;\n mapDeleteIndividualContextEntity(\"MPICE\", &sCode);\n}\n<commit_msg>FIX unit test mapPutIndividualContextEntity.createTwoEntities<commit_after>\/*\n*\n* Copyright 2013 Telefonica Investigacion y Desarrollo, S.A.U\n*\n* This file is part of Orion Context Broker.\n*\n* Orion Context Broker is free software: you can redistribute it and\/or\n* modify it under the terms of the GNU Affero General Public License as\n* published by the Free Software Foundation, either version 3 of the\n* License, or (at your option) any later version.\n*\n* Orion Context Broker is distributed in the hope that it will be useful,\n* but WITHOUT ANY WARRANTY; without even the implied warranty of\n* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU Affero\n* General Public License for more details.\n*\n* You should have received a copy of the GNU Affero General Public License\n* along with Orion Context Broker. If not, see http:\/\/www.gnu.org\/licenses\/.\n*\n* For those usages not covered by this license please contact with\n* fermin at tid dot es\n*\n* Author: Ken Zangelin\n*\/\n#include \"gtest\/gtest.h\"\n\n#include \"logMsg\/logMsg.h\"\n#include \"logMsg\/traceLevels.h\"\n#include \"common\/globals.h\"\n\n#include \"convenience\/RegisterProviderRequest.h\"\n#include \"convenience\/UpdateContextElementRequest.h\"\n#include \"convenience\/UpdateContextElementResponse.h\"\n#include \"convenienceMap\/mapPutIndividualContextEntity.h\"\n#include \"convenienceMap\/mapDeleteIndividualContextEntity.h\"\n#include \"mongoBackend\/mongoRegisterContext.h\"\n#include \"ngsi9\/RegisterContextResponse.h\"\n#include \"ngsi9\/DiscoverContextAvailabilityResponse.h\"\n#include \"testInit.h\"\n#include \"commonMocks.h\"\n\n\n\nusing ::testing::_;\nusing ::testing::Throw;\nusing ::testing::Return;\n\n\n\n\/* ****************************************************************************\n*\n* prepareDatabase -\n*\/\nstatic void prepareDatabase(std::string id, std::string type)\n{\n \/* Set database *\/\n setupDatabase();\n\n DBClientConnection* connection = getMongoConnection();\n\n \/* We create one entity:\n *\n * - 'id', 'type' with four attributes\n * A1: X\n * A1: Y\n * A2: Z\n * A3: W\n *\/\n\n BSONObj en1 = BSON(\"_id\" << BSON(\"id\" << id << \"type\" << type) <<\n \"attrs\" << BSON_ARRAY(\n BSON(\"name\" << \"A1\" << \"type\" << \"TA1\" << \"value\" << \"X\") <<\n BSON(\"name\" << \"A1\" << \"type\" << \"TA1bis\" << \"value\" << \"Y\") <<\n BSON(\"name\" << \"A2\" << \"type\" << \"TA2\" << \"value\" << \"Z\") <<\n BSON(\"name\" << \"A3\" << \"type\" << \"TA3\" << \"value\" << \"W\")\n )\n );\n\n connection->insert(ENTITIES_COLL, en1);\n}\n\n\n\n\/* ****************************************************************************\n*\n* notFoundThenFound - \n*\/\nTEST(mapPutIndividualContextEntity, createTwoEntities)\n{\n HttpStatusCode ms;\n UpdateContextElementRequest request;\n UpdateContextElementResponse response;\n\n \/* Set timer *\/\n Timer* t = new Timer();\n setTimer(t);\n\n prepareDatabase(\"MPICE\", \"ttt\");\n request.attributeDomainName.set(\"ad\");\n\n ms = mapPutIndividualContextEntity(\"MPICE\", &request, &response);\n EXPECT_EQ(SccOk, ms);\n EXPECT_EQ(200, response.errorCode.code);\n\n ms = mapPutIndividualContextEntity(\"MPICE2\", &request, &response);\n EXPECT_EQ(SccOk, ms);\n EXPECT_EQ(200, response.errorCode.code);\n\n \/\/ Cleanup\n StatusCode sCode;\n mapDeleteIndividualContextEntity(\"MPICE\", &sCode);\n}\n<|endoftext|>"} {"text":"<commit_before>\/\/=============================================================================================================\n\/**\n* @file test_spectral_connectivity.cpp\n* @author Daniel Strohmeier <daniel.strohmeier@tu-ilmenau.de>;\n* Matti Hamalainen <msh@nmr.mgh.harvard.edu>\n* @version 1.0\n* @date May, 2018\n*\n* @section LICENSE\n*\n* Copyright (C) 2018, Daniel Strohmeier 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 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 The spectral connectivity test implementation\n*\n*\/\n\n\n\/\/*************************************************************************************************************\n\/\/=============================================================================================================\n\/\/ INCLUDES\n\/\/=============================================================================================================\n\n#include <iostream>\n#include <mne\/mne.h>\n#include <utils\/ioutils.h>\n#include \"connectivity\/metrics\/coherence.h\"\n#include \"connectivity\/metrics\/imagcoherence.h\"\n#include \"connectivity\/metrics\/phaselockingvalue.h\"\n#include \"connectivity\/metrics\/phaselagindex.h\"\n#include \"connectivity\/metrics\/unbiasedsquaredphaselagindex.h\"\n#include \"connectivity\/metrics\/weightedphaselagindex.h\"\n#include \"connectivity\/metrics\/debiasedsquaredweightedphaselagindex.h\"\n\n\n\/\/*************************************************************************************************************\n\/\/=============================================================================================================\n\/\/ QT INCLUDES\n\/\/=============================================================================================================\n\n#include <QtTest>\n\n\n\/\/*************************************************************************************************************\n\/\/=============================================================================================================\n\/\/ Eigen INCLUDES\n\/\/=============================================================================================================\n\n#include <Eigen\/Core>\n\n\n\/\/*************************************************************************************************************\n\/\/=============================================================================================================\n\/\/ USED NAMESPACES\n\/\/=============================================================================================================\n\nusing namespace Eigen;\nusing namespace CONNECTIVITYLIB;\nusing namespace UTILSLIB;\n\n\n\/\/=============================================================================================================\n\/**\n* DECLARE CLASS TestSpectralConnectivity\n*\n* @brief The TestSpectralConnectivity class provides spectral connectivity tests\n*\n*\/\nclass TestSpectralConnectivity: public QObject\n{\n Q_OBJECT\n\npublic:\n TestSpectralConnectivity();\n\nprivate slots:\n void initTestCase();\n void spectralConnectivityCoherence();\n void spectralConnectivityImagCoherence();\n void spectralConnectivityPLV();\n void spectralConnectivityPLI();\n void spectralConnectivityPLI2();\n void spectralConnectivityWPLI();\n void spectralConnectivityWPLI2();\n void cleanupTestCase();\n\nprivate:\n void compareConnectivity();\n double epsilon;\n RowVectorXd m_ConnectivityOutput;\n RowVectorXd m_RefConnectivityOutput;\n};\n\n\n\/\/*************************************************************************************************************\n\nTestSpectralConnectivity::TestSpectralConnectivity()\n: epsilon(0.000001)\n{\n}\n\n\n\/\/*************************************************************************************************************\n\nvoid TestSpectralConnectivity::TestSpectralConnectivity()\n{\n\n}\n\n\n\/\/*************************************************************************************************************\n\nvoid TestSpectralConnectivity::spectralConnectivityCoherence()\n{\n \/\/*********************************************************************************************************\n \/\/ Load Data\n \/\/*********************************************************************************************************\n\n inputTrials = MatrixXd();\n QString dataFileName(QDir::currentPath()+\"\/mne-cpp-test-data\/MEG\/sample\/data_spectral_connectivity.txt\");\n IOUtils::read_eigen_matrix(inputTrials, dataFileName);\n int iNTrials = inputTrials.rows() \/ 2;\n int iNfft = inputTrials.cols();\n QString sWindowType = \"hanning\";\n\n QList<MatrixXd> matDataList;\n for (int i = 0; i < iNTrials; ++i)\n {\n matDataList.append(inputTrials.middleRows(i * 2, 2));\n }\n\n \/\/*********************************************************************************************************\n \/\/ Compute Connectivity\n \/\/*********************************************************************************************************\n\n QVector<MatrixXd> Coh = Coherence::computeCoherence(matDataList, iNfft, sWindowType);\n m_ConnectivityOutput = Coh.at(0).row(1);\n\n \/\/*********************************************************************************************************\n \/\/ Load MNE-PYTHON Results As Reference\n \/\/*********************************************************************************************************\n\n refConnectivity = MatrixXd();\n QString refFileName(QDir::currentPath()+\"\/mne-cpp-test-data\/Result\/Connectivity\/ref_spectral_connectivity_coh.txt\");\n IOUtils::read_eigen_matrix(refConnectivity, refFileName);\n m_RefConnectivityOutput = refConnectivity.row(0);\n\n \/\/*********************************************************************************************************\n \/\/ Compare Connectivity\n \/\/*********************************************************************************************************\n\n compareConnectivity();\n}\n\n\n\/\/*************************************************************************************************************\n\nvoid TestSpectralConnectivity::spectralConnectivityImagCoherence()\n{\n \/\/*********************************************************************************************************\n \/\/ Load Data\n \/\/*********************************************************************************************************\n\n inputTrials = MatrixXd();\n QString dataFileName(QDir::currentPath()+\"\/mne-cpp-test-data\/MEG\/sample\/data_spectral_connectivity.txt\");\n IOUtils::read_eigen_matrix(inputTrials, dataFileName);\n int iNTrials = inputTrials.rows() \/ 2;\n int iNfft = inputTrials.cols();\n QString sWindowType = \"hanning\";\n\n QList<MatrixXd> matDataList;\n for (int i = 0; i < iNTrials; ++i)\n {\n matDataList.append(inputTrials.middleRows(i * 2, 2));\n }\n\n \/\/*********************************************************************************************************\n \/\/ Compute Connectivity\n \/\/*********************************************************************************************************\n\n QVector<MatrixXd> ImagCoh = ImagCoherence::computeImagCoherence(matDataList, iNfft, sWindowType);\n m_ConnectivityOutput = ImagCoh.at(0).row(1);\n\n \/\/*********************************************************************************************************\n \/\/ Load MNE-PYTHON Results As Reference\n \/\/*********************************************************************************************************\n\n refConnectivity = MatrixXd();\n QString refFileName(QDir::currentPath()+\"\/mne-cpp-test-data\/Result\/Connectivty\/ref_spectral_connectivity_icoh.txt\");\n IOUtils::read_eigen_matrix(refConnectivity, refFileName);\n m_RefConnectivityOutput = refConnectivity.row(0);\n\n \/\/*********************************************************************************************************\n \/\/ Compare Connectivity\n \/\/*********************************************************************************************************\n\n compareConnectivity();\n}\n\n\n\/\/*************************************************************************************************************\n\nvoid TestSpectralConnectivity::spectralConnectivityPLV()\n{\n \/\/*********************************************************************************************************\n \/\/ Load Data\n \/\/*********************************************************************************************************\n\n inputTrials = MatrixXd();\n QString dataFileName(QDir::currentPath()+\"\/mne-cpp-test-data\/MEG\/sample\/data_spectral_connectivity.txt\");\n IOUtils::read_eigen_matrix(inputTrials, dataFileName);\n int iNTrials = inputTrials.rows() \/ 2;\n int iNfft = inputTrials.cols();\n QString sWindowType = \"hanning\";\n\n QList<MatrixXd> matDataList;\n for (int i = 0; i < iNTrials; ++i)\n {\n matDataList.append(inputTrials.middleRows(i * 2, 2));\n }\n\n \/\/*********************************************************************************************************\n \/\/ Compute Connectivity\n \/\/*********************************************************************************************************\n\n QVector<MatrixXd> PLV = PhaseLockingValue::computePLV(matDataList, iNfft, sWindowType);\n m_ConnectivityOutput = PLV.at(0).row(1);\n\n \/\/*********************************************************************************************************\n \/\/ Load MNE-PYTHON Results As Reference\n \/\/*********************************************************************************************************\n\n refConnectivity = MatrixXd();\n QString refFileName(QDir::currentPath()+\"\/mne-cpp-test-data\/Result\/Connectivty\/ref_spectral_connectivity_plv.txt\");\n IOUtils::read_eigen_matrix(refConnectivity, refFileName);\n m_RefConnectivityOutput = refConnectivity.row(0);\n\n \/\/*********************************************************************************************************\n \/\/ Compare Connectivity\n \/\/*********************************************************************************************************\n\n compareConnectivity();\n}\n\n\n\/\/*************************************************************************************************************\n\nvoid TestSpectralConnectivity::spectralConnectivityPLI()\n{\n \/\/*********************************************************************************************************\n \/\/ Load Data\n \/\/*********************************************************************************************************\n\n inputTrials = MatrixXd();\n QString dataFileName(QDir::currentPath()+\"\/mne-cpp-test-data\/MEG\/sample\/data_spectral_connectivity.txt\");\n IOUtils::read_eigen_matrix(inputTrials, dataFileName);\n int iNTrials = inputTrials.rows() \/ 2;\n int iNfft = inputTrials.cols();\n QString sWindowType = \"hanning\";\n\n QList<MatrixXd> matDataList;\n for (int i = 0; i < iNTrials; ++i)\n {\n matDataList.append(inputTrials.middleRows(i * 2, 2));\n }\n\n \/\/*********************************************************************************************************\n \/\/ Compute Connectivity\n \/\/*********************************************************************************************************\n\n QVector<MatrixXd> PLI = PhaseLagIndex::computePLI(matDataList, iNfft, sWindowType);\n m_ConnectivityOutput = PLI.at(0).row(1);\n\n \/\/*********************************************************************************************************\n \/\/ Load MNE-PYTHON Results As Reference\n \/\/*********************************************************************************************************\n\n refConnectivity = MatrixXd();\n QString refFileName(QDir::currentPath()+\"\/mne-cpp-test-data\/Result\/Connectivty\/ref_spectral_connectivity_pli.txt\");\n IOUtils::read_eigen_matrix(refConnectivity, refFileName);\n m_RefConnectivityOutput = refConnectivity.row(0);\n\n \/\/*********************************************************************************************************\n \/\/ Compare Connectivity\n \/\/*********************************************************************************************************\n\n compareConnectivity();\n}\n\n\n\/\/*************************************************************************************************************\n\nvoid TestSpectralConnectivity::spectralConnectivityPLI2()\n{\n \/\/*********************************************************************************************************\n \/\/ Load Data\n \/\/*********************************************************************************************************\n\n inputTrials = MatrixXd();\n QString dataFileName(QDir::currentPath()+\"\/mne-cpp-test-data\/MEG\/sample\/data_spectral_connectivity.txt\");\n IOUtils::read_eigen_matrix(inputTrials, dataFileName);\n int iNTrials = inputTrials.rows() \/ 2;\n int iNfft = inputTrials.cols();\n QString sWindowType = \"hanning\";\n\n QList<MatrixXd> matDataList;\n for (int i = 0; i < iNTrials; ++i)\n {\n matDataList.append(inputTrials.middleRows(i * 2, 2));\n }\n\n \/\/*********************************************************************************************************\n \/\/ Compute Connectivity\n \/\/*********************************************************************************************************\n\n QVector<MatrixXd> PLI2 = UnbiasedSquaredPhaseLagIndex::computeUnbiasedSquaredPLI(matDataList, iNfft, sWindowType);\n m_ConnectivityOutput = PLI2.at(0).row(1);\n\n \/\/*********************************************************************************************************\n \/\/ Load MNE-PYTHON Results As Reference\n \/\/*********************************************************************************************************\n\n refConnectivity = MatrixXd();\n QString refFileName(QDir::currentPath()+\"\/mne-cpp-test-data\/Result\/Connectivty\/ref_spectral_connectivity_pli2.txt\");\n IOUtils::read_eigen_matrix(refConnectivity, refFileName);\n m_RefConnectivityOutput = refConnectivity.row(0);\n\n \/\/*********************************************************************************************************\n \/\/ Compare Connectivity\n \/\/*********************************************************************************************************\n\n compareConnectivity();\n}\n\n\n\/\/*************************************************************************************************************\n\nvoid TestSpectralConnectivity::spectralConnectivityWPLI()\n{\n \/\/*********************************************************************************************************\n \/\/ Load Data\n \/\/*********************************************************************************************************\n\n inputTrials = MatrixXd();\n QString dataFileName(QDir::currentPath()+\"\/mne-cpp-test-data\/MEG\/sample\/data_spectral_connectivity.txt\");\n IOUtils::read_eigen_matrix(inputTrials, dataFileName);\n int iNTrials = inputTrials.rows() \/ 2;\n int iNfft = inputTrials.cols();\n QString sWindowType = \"hanning\";\n\n QList<MatrixXd> matDataList;\n for (int i = 0; i < iNTrials; ++i)\n {\n matDataList.append(inputTrials.middleRows(i * 2, 2));\n }\n\n \/\/*********************************************************************************************************\n \/\/ Compute Connectivity\n \/\/*********************************************************************************************************\n\n QVector<MatrixXd> WPLI = WeightedPhaseLagIndex::computeWPLI(matDataList, iNfft, sWindowType);\n m_ConnectivityOutput = WPLI.at(0).row(1);\n\n \/\/*********************************************************************************************************\n \/\/ Load MNE-PYTHON Results As Reference\n \/\/*********************************************************************************************************\n\n refConnectivity = MatrixXd();\n QString refFileName(QDir::currentPath()+\"\/mne-cpp-test-data\/Result\/Connectivty\/ref_spectral_connectivity_wpli.txt\");\n IOUtils::read_eigen_matrix(refConnectivity, refFileName);\n m_RefConnectivityOutput = refConnectivity.row(0);\n\n \/\/*********************************************************************************************************\n \/\/ Compare Connectivity\n \/\/*********************************************************************************************************\n\n compareConnectivity();\n}\n\n\n\/\/*************************************************************************************************************\n\nvoid TestSpectralConnectivity::spectralConnectivityWPLI2()\n{\n \/\/*********************************************************************************************************\n \/\/ Load Data\n \/\/*********************************************************************************************************\n\n inputTrials = MatrixXd();\n QString dataFileName(QDir::currentPath()+\"\/mne-cpp-test-data\/MEG\/sample\/data_spectral_connectivity.txt\");\n IOUtils::read_eigen_matrix(inputTrials, dataFileName);\n int iNTrials = inputTrials.rows() \/ 2;\n int iNfft = inputTrials.cols();\n QString sWindowType = \"hanning\";\n\n QList<MatrixXd> matDataList;\n for (int i = 0; i < iNTrials; ++i)\n {\n matDataList.append(inputTrials.middleRows(i * 2, 2));\n }\n\n \/\/*********************************************************************************************************\n \/\/ Compute Connectivity\n \/\/*********************************************************************************************************\n\n QVector<MatrixXd> WPLI2 = DebiasedSquaredWeightedPhaseLagIndex::computeDebiasedSquaredWPLI(matDataList, iNfft, sWindowType);\n m_ConnectivityOutput = WPLI2.at(0).row(1);\n\n \/\/*********************************************************************************************************\n \/\/ Load MNE-PYTHON Results As Reference\n \/\/*********************************************************************************************************\n\n refConnectivity = MatrixXd();\n QString refFileName(QDir::currentPath()+\"\/mne-cpp-test-data\/Result\/Connectivty\/ref_spectral_connectivity_wpli2.txt\");\n IOUtils::read_eigen_matrix(refConnectivity, refFileName);\n m_RefConnectivityOutput = refConnectivity.row(0);\n\n \/\/*********************************************************************************************************\n \/\/ Compare Connectivity\n \/\/*********************************************************************************************************\n\n compareConnectivity();\n}\n\n\n\/\/*************************************************************************************************************\n\nvoid TestSpectralConnectivity::compareConnectivity()\n{\n \/\/*********************************************************************************************************\n \/\/ Compare Spectral Connectvitity Result to MNE-PYTHON\n \/\/*********************************************************************************************************\n\n printf(\">>>>>>>>>>>>>>>>>>>>>>>>> Compare Spectral Connectivities >>>>>>>>>>>>>>>>>>>>>>>>>\\n\");\n\n QVERIFY( m_ConnectivityOutput.cols() == m_RefConnectivityOutput.cols() );\n for (int i = 0; i < m_ConnectivityOutput.cols(); ++i)\n {\n QVERIFY( (m_ConnectivityOutput(i) - m_RefConnectivityOutput(i)) \/ m_RefConnectivityOutput(i) < epsilon );\n }\n\n printf(\"<<<<<<<<<<<<<<<<<<<<<<<<< Compare Spectral Connectivities Finished <<<<<<<<<<<<<<<<<<<<<<<<<\\n\");\n}\n\n\n\/\/*************************************************************************************************************\n\nvoid TestSpectralConnectivity::cleanupTestCase()\n{\n}\n\n\n\/\/*************************************************************************************************************\n\/\/=============================================================================================================\n\/\/ MAIN\n\/\/=============================================================================================================\n\nQTEST_APPLESS_MAIN(TestSpectralConnectivity)\n<commit_msg>remove imports<commit_after>\/\/=============================================================================================================\n\/**\n* @file test_spectral_connectivity.cpp\n* @author Daniel Strohmeier <daniel.strohmeier@tu-ilmenau.de>;\n* Matti Hamalainen <msh@nmr.mgh.harvard.edu>\n* @version 1.0\n* @date May, 2018\n*\n* @section LICENSE\n*\n* Copyright (C) 2018, Daniel Strohmeier 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 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 The spectral connectivity test implementation\n*\n*\/\n\n\n\/\/*************************************************************************************************************\n\/\/=============================================================================================================\n\/\/ INCLUDES\n\/\/=============================================================================================================\n\n#include <utils\/ioutils.h>\n#include \"connectivity\/metrics\/coherence.h\"\n#include \"connectivity\/metrics\/imagcoherence.h\"\n#include \"connectivity\/metrics\/phaselockingvalue.h\"\n#include \"connectivity\/metrics\/phaselagindex.h\"\n#include \"connectivity\/metrics\/unbiasedsquaredphaselagindex.h\"\n#include \"connectivity\/metrics\/weightedphaselagindex.h\"\n#include \"connectivity\/metrics\/debiasedsquaredweightedphaselagindex.h\"\n\n\n\/\/*************************************************************************************************************\n\/\/=============================================================================================================\n\/\/ QT INCLUDES\n\/\/=============================================================================================================\n\n#include <QtTest>\n\n\n\/\/*************************************************************************************************************\n\/\/=============================================================================================================\n\/\/ Eigen INCLUDES\n\/\/=============================================================================================================\n\n#include <Eigen\/Core>\n\n\n\/\/*************************************************************************************************************\n\/\/=============================================================================================================\n\/\/ USED NAMESPACES\n\/\/=============================================================================================================\n\nusing namespace Eigen;\nusing namespace CONNECTIVITYLIB;\nusing namespace UTILSLIB;\n\n\n\/\/=============================================================================================================\n\/**\n* DECLARE CLASS TestSpectralConnectivity\n*\n* @brief The TestSpectralConnectivity class provides spectral connectivity tests\n*\n*\/\nclass TestSpectralConnectivity: public QObject\n{\n Q_OBJECT\n\npublic:\n TestSpectralConnectivity();\n\nprivate slots:\n void initTestCase();\n void spectralConnectivityCoherence();\n void spectralConnectivityImagCoherence();\n void spectralConnectivityPLV();\n void spectralConnectivityPLI();\n void spectralConnectivityPLI2();\n void spectralConnectivityWPLI();\n void spectralConnectivityWPLI2();\n void cleanupTestCase();\n\nprivate:\n void compareConnectivity();\n double epsilon;\n RowVectorXd m_ConnectivityOutput;\n RowVectorXd m_RefConnectivityOutput;\n};\n\n\n\/\/*************************************************************************************************************\n\nTestSpectralConnectivity::TestSpectralConnectivity()\n: epsilon(0.000001)\n{\n}\n\n\n\/\/*************************************************************************************************************\n\nvoid TestSpectralConnectivity::initTestCase()\n{\n\n}\n\n\n\/\/*************************************************************************************************************\n\nvoid TestSpectralConnectivity::spectralConnectivityCoherence()\n{\n \/\/*********************************************************************************************************\n \/\/ Load Data\n \/\/*********************************************************************************************************\n\n MatrixXd inputTrials;\n QString dataFileName(QDir::currentPath()+\"\/mne-cpp-test-data\/MEG\/sample\/data_spectral_connectivity.txt\");\n IOUtils::read_eigen_matrix(inputTrials, dataFileName);\n int iNTrials = inputTrials.rows() \/ 2;\n int iNfft = inputTrials.cols();\n QString sWindowType = \"hanning\";\n\n QList<MatrixXd> matDataList;\n for (int i = 0; i < iNTrials; ++i)\n {\n matDataList.append(inputTrials.middleRows(i * 2, 2));\n }\n\n \/\/*********************************************************************************************************\n \/\/ Compute Connectivity\n \/\/*********************************************************************************************************\n\n QVector<MatrixXd> Coh = Coherence::computeCoherence(matDataList, iNfft, sWindowType);\n m_ConnectivityOutput = Coh.at(0).row(1);\n\n \/\/*********************************************************************************************************\n \/\/ Load MNE-PYTHON Results As Reference\n \/\/*********************************************************************************************************\n\n MatrixXd refConnectivity;\n QString refFileName(QDir::currentPath()+\"\/mne-cpp-test-data\/Result\/Connectivity\/ref_spectral_connectivity_coh.txt\");\n IOUtils::read_eigen_matrix(refConnectivity, refFileName);\n m_RefConnectivityOutput = refConnectivity.row(0);\n\n \/\/*********************************************************************************************************\n \/\/ Compare Connectivity\n \/\/*********************************************************************************************************\n\n compareConnectivity();\n}\n\n\n\/\/*************************************************************************************************************\n\nvoid TestSpectralConnectivity::spectralConnectivityImagCoherence()\n{\n \/\/*********************************************************************************************************\n \/\/ Load Data\n \/\/*********************************************************************************************************\n\n MatrixXd inputTrials;\n QString dataFileName(QDir::currentPath()+\"\/mne-cpp-test-data\/MEG\/sample\/data_spectral_connectivity.txt\");\n IOUtils::read_eigen_matrix(inputTrials, dataFileName);\n int iNTrials = inputTrials.rows() \/ 2;\n int iNfft = inputTrials.cols();\n QString sWindowType = \"hanning\";\n\n QList<MatrixXd> matDataList;\n for (int i = 0; i < iNTrials; ++i)\n {\n matDataList.append(inputTrials.middleRows(i * 2, 2));\n }\n\n \/\/*********************************************************************************************************\n \/\/ Compute Connectivity\n \/\/*********************************************************************************************************\n\n QVector<MatrixXd> ImagCoh = ImagCoherence::computeImagCoherence(matDataList, iNfft, sWindowType);\n m_ConnectivityOutput = ImagCoh.at(0).row(1);\n\n \/\/*********************************************************************************************************\n \/\/ Load MNE-PYTHON Results As Reference\n \/\/*********************************************************************************************************\n\n MatrixXd refConnectivity;\n QString refFileName(QDir::currentPath()+\"\/mne-cpp-test-data\/Result\/Connectivty\/ref_spectral_connectivity_icoh.txt\");\n IOUtils::read_eigen_matrix(refConnectivity, refFileName);\n m_RefConnectivityOutput = refConnectivity.row(0);\n\n \/\/*********************************************************************************************************\n \/\/ Compare Connectivity\n \/\/*********************************************************************************************************\n\n compareConnectivity();\n}\n\n\n\/\/*************************************************************************************************************\n\nvoid TestSpectralConnectivity::spectralConnectivityPLV()\n{\n \/\/*********************************************************************************************************\n \/\/ Load Data\n \/\/*********************************************************************************************************\n\n MatrixXd inputTrials;\n QString dataFileName(QDir::currentPath()+\"\/mne-cpp-test-data\/MEG\/sample\/data_spectral_connectivity.txt\");\n IOUtils::read_eigen_matrix(inputTrials, dataFileName);\n int iNTrials = inputTrials.rows() \/ 2;\n int iNfft = inputTrials.cols();\n QString sWindowType = \"hanning\";\n\n QList<MatrixXd> matDataList;\n for (int i = 0; i < iNTrials; ++i)\n {\n matDataList.append(inputTrials.middleRows(i * 2, 2));\n }\n\n \/\/*********************************************************************************************************\n \/\/ Compute Connectivity\n \/\/*********************************************************************************************************\n\n QVector<MatrixXd> PLV = PhaseLockingValue::computePLV(matDataList, iNfft, sWindowType);\n m_ConnectivityOutput = PLV.at(0).row(1);\n\n \/\/*********************************************************************************************************\n \/\/ Load MNE-PYTHON Results As Reference\n \/\/*********************************************************************************************************\n\n MatrixXd refConnectivity;\n QString refFileName(QDir::currentPath()+\"\/mne-cpp-test-data\/Result\/Connectivty\/ref_spectral_connectivity_plv.txt\");\n IOUtils::read_eigen_matrix(refConnectivity, refFileName);\n m_RefConnectivityOutput = refConnectivity.row(0);\n\n \/\/*********************************************************************************************************\n \/\/ Compare Connectivity\n \/\/*********************************************************************************************************\n\n compareConnectivity();\n}\n\n\n\/\/*************************************************************************************************************\n\nvoid TestSpectralConnectivity::spectralConnectivityPLI()\n{\n \/\/*********************************************************************************************************\n \/\/ Load Data\n \/\/*********************************************************************************************************\n\n MatrixXd inputTrials;\n QString dataFileName(QDir::currentPath()+\"\/mne-cpp-test-data\/MEG\/sample\/data_spectral_connectivity.txt\");\n IOUtils::read_eigen_matrix(inputTrials, dataFileName);\n int iNTrials = inputTrials.rows() \/ 2;\n int iNfft = inputTrials.cols();\n QString sWindowType = \"hanning\";\n\n QList<MatrixXd> matDataList;\n for (int i = 0; i < iNTrials; ++i)\n {\n matDataList.append(inputTrials.middleRows(i * 2, 2));\n }\n\n \/\/*********************************************************************************************************\n \/\/ Compute Connectivity\n \/\/*********************************************************************************************************\n\n QVector<MatrixXd> PLI = PhaseLagIndex::computePLI(matDataList, iNfft, sWindowType);\n m_ConnectivityOutput = PLI.at(0).row(1);\n\n \/\/*********************************************************************************************************\n \/\/ Load MNE-PYTHON Results As Reference\n \/\/*********************************************************************************************************\n\n MatrixXd refConnectivity;\n QString refFileName(QDir::currentPath()+\"\/mne-cpp-test-data\/Result\/Connectivty\/ref_spectral_connectivity_pli.txt\");\n IOUtils::read_eigen_matrix(refConnectivity, refFileName);\n m_RefConnectivityOutput = refConnectivity.row(0);\n\n \/\/*********************************************************************************************************\n \/\/ Compare Connectivity\n \/\/*********************************************************************************************************\n\n compareConnectivity();\n}\n\n\n\/\/*************************************************************************************************************\n\nvoid TestSpectralConnectivity::spectralConnectivityPLI2()\n{\n \/\/*********************************************************************************************************\n \/\/ Load Data\n \/\/*********************************************************************************************************\n\n MatrixXd inputTrials;\n QString dataFileName(QDir::currentPath()+\"\/mne-cpp-test-data\/MEG\/sample\/data_spectral_connectivity.txt\");\n IOUtils::read_eigen_matrix(inputTrials, dataFileName);\n int iNTrials = inputTrials.rows() \/ 2;\n int iNfft = inputTrials.cols();\n QString sWindowType = \"hanning\";\n\n QList<MatrixXd> matDataList;\n for (int i = 0; i < iNTrials; ++i)\n {\n matDataList.append(inputTrials.middleRows(i * 2, 2));\n }\n\n \/\/*********************************************************************************************************\n \/\/ Compute Connectivity\n \/\/*********************************************************************************************************\n\n QVector<MatrixXd> PLI2 = UnbiasedSquaredPhaseLagIndex::computeUnbiasedSquaredPLI(matDataList, iNfft, sWindowType);\n m_ConnectivityOutput = PLI2.at(0).row(1);\n\n \/\/*********************************************************************************************************\n \/\/ Load MNE-PYTHON Results As Reference\n \/\/*********************************************************************************************************\n\n MatrixXd refConnectivity;\n QString refFileName(QDir::currentPath()+\"\/mne-cpp-test-data\/Result\/Connectivty\/ref_spectral_connectivity_pli2.txt\");\n IOUtils::read_eigen_matrix(refConnectivity, refFileName);\n m_RefConnectivityOutput = refConnectivity.row(0);\n\n \/\/*********************************************************************************************************\n \/\/ Compare Connectivity\n \/\/*********************************************************************************************************\n\n compareConnectivity();\n}\n\n\n\/\/*************************************************************************************************************\n\nvoid TestSpectralConnectivity::spectralConnectivityWPLI()\n{\n \/\/*********************************************************************************************************\n \/\/ Load Data\n \/\/*********************************************************************************************************\n\n MatrixXd inputTrials;\n QString dataFileName(QDir::currentPath()+\"\/mne-cpp-test-data\/MEG\/sample\/data_spectral_connectivity.txt\");\n IOUtils::read_eigen_matrix(inputTrials, dataFileName);\n int iNTrials = inputTrials.rows() \/ 2;\n int iNfft = inputTrials.cols();\n QString sWindowType = \"hanning\";\n\n QList<MatrixXd> matDataList;\n for (int i = 0; i < iNTrials; ++i)\n {\n matDataList.append(inputTrials.middleRows(i * 2, 2));\n }\n\n \/\/*********************************************************************************************************\n \/\/ Compute Connectivity\n \/\/*********************************************************************************************************\n\n QVector<MatrixXd> WPLI = WeightedPhaseLagIndex::computeWPLI(matDataList, iNfft, sWindowType);\n m_ConnectivityOutput = WPLI.at(0).row(1);\n\n \/\/*********************************************************************************************************\n \/\/ Load MNE-PYTHON Results As Reference\n \/\/*********************************************************************************************************\n\n MatrixXd refConnectivity;\n QString refFileName(QDir::currentPath()+\"\/mne-cpp-test-data\/Result\/Connectivty\/ref_spectral_connectivity_wpli.txt\");\n IOUtils::read_eigen_matrix(refConnectivity, refFileName);\n m_RefConnectivityOutput = refConnectivity.row(0);\n\n \/\/*********************************************************************************************************\n \/\/ Compare Connectivity\n \/\/*********************************************************************************************************\n\n compareConnectivity();\n}\n\n\n\/\/*************************************************************************************************************\n\nvoid TestSpectralConnectivity::spectralConnectivityWPLI2()\n{\n \/\/*********************************************************************************************************\n \/\/ Load Data\n \/\/*********************************************************************************************************\n\n MatrixXd inputTrials;\n QString dataFileName(QDir::currentPath()+\"\/mne-cpp-test-data\/MEG\/sample\/data_spectral_connectivity.txt\");\n IOUtils::read_eigen_matrix(inputTrials, dataFileName);\n int iNTrials = inputTrials.rows() \/ 2;\n int iNfft = inputTrials.cols();\n QString sWindowType = \"hanning\";\n\n QList<MatrixXd> matDataList;\n for (int i = 0; i < iNTrials; ++i)\n {\n matDataList.append(inputTrials.middleRows(i * 2, 2));\n }\n\n \/\/*********************************************************************************************************\n \/\/ Compute Connectivity\n \/\/*********************************************************************************************************\n\n QVector<MatrixXd> WPLI2 = DebiasedSquaredWeightedPhaseLagIndex::computeDebiasedSquaredWPLI(matDataList, iNfft, sWindowType);\n m_ConnectivityOutput = WPLI2.at(0).row(1);\n\n \/\/*********************************************************************************************************\n \/\/ Load MNE-PYTHON Results As Reference\n \/\/*********************************************************************************************************\n\n MatrixXd refConnectivity;\n QString refFileName(QDir::currentPath()+\"\/mne-cpp-test-data\/Result\/Connectivty\/ref_spectral_connectivity_wpli2.txt\");\n IOUtils::read_eigen_matrix(refConnectivity, refFileName);\n m_RefConnectivityOutput = refConnectivity.row(0);\n\n \/\/*********************************************************************************************************\n \/\/ Compare Connectivity\n \/\/*********************************************************************************************************\n\n compareConnectivity();\n}\n\n\n\/\/*************************************************************************************************************\n\nvoid TestSpectralConnectivity::compareConnectivity()\n{\n \/\/*********************************************************************************************************\n \/\/ Compare Spectral Connectvitity Result to MNE-PYTHON\n \/\/*********************************************************************************************************\n\n printf(\">>>>>>>>>>>>>>>>>>>>>>>>> Compare Spectral Connectivities >>>>>>>>>>>>>>>>>>>>>>>>>\\n\");\n\n QVERIFY( m_ConnectivityOutput.cols() == m_RefConnectivityOutput.cols() );\n for (int i = 0; i < m_ConnectivityOutput.cols(); ++i)\n {\n QVERIFY( (m_ConnectivityOutput(i) - m_RefConnectivityOutput(i)) \/ m_RefConnectivityOutput(i) < epsilon );\n }\n\n printf(\"<<<<<<<<<<<<<<<<<<<<<<<<< Compare Spectral Connectivities Finished <<<<<<<<<<<<<<<<<<<<<<<<<\\n\");\n}\n\n\n\/\/*************************************************************************************************************\n\nvoid TestSpectralConnectivity::cleanupTestCase()\n{\n}\n\n\n\/\/*************************************************************************************************************\n\/\/=============================================================================================================\n\/\/ MAIN\n\/\/=============================================================================================================\n\nQTEST_APPLESS_MAIN(TestSpectralConnectivity)\n#include \"test_spectral_connectivity.moc\"\n<|endoftext|>"} {"text":"<commit_before>#include \"IrrCompileConfig.h\"\r\n\r\n#ifdef _IRR_COMPILE_WITH_OPENGL_\n\n#include \"COpenGLDriver.h\"\n\n#include \"COpenGLRenderBuffer.h\"\n\r\nnamespace irr\r\n{\r\nnamespace video\r\n{\n\r\n\/\/! constructor\nCOpenGLRenderBuffer::COpenGLRenderBuffer(GLenum internalFormat, core::dimension2du size)\n : RenderBufferSize(size), InternalFormat(internalFormat), RenderBufferName(0), RenderBufferNameHasChanged(0)\n{\n COpenGLExtensionHandler::extGlCreateRenderbuffers(1,&RenderBufferName);\n COpenGLExtensionHandler::extGlNamedRenderbufferStorage(RenderBufferName,InternalFormat,RenderBufferSize.Width,RenderBufferSize.Height);\n}\r\n\r\n\/\/! destructor\r\nCOpenGLRenderBuffer::~COpenGLRenderBuffer()\n{\n COpenGLExtensionHandler::extGlDeleteRenderbuffers(1,&RenderBufferName);\n}\n\nvoid COpenGLRenderBuffer::resize(const core::dimension2du &newSize)\n{\n RenderBufferSize = newSize;\n\n if (RenderBufferName)\n {\n glDeleteTextures(1,&RenderBufferName);\n RenderBufferName = 0;\n }\n COpenGLExtensionHandler::extGlCreateRenderbuffers(1,&RenderBufferName);\n COpenGLExtensionHandler::extGlNamedRenderbufferStorage(RenderBufferName,InternalFormat,RenderBufferSize.Width,RenderBufferSize.Height);\n\n\tRenderBufferNameHasChanged = CNullDriver::incrementAndFetchReallocCounter();\n}\n\n\n\n\r\n\/\/! constructor\nCOpenGLMultisampleRenderBuffer::COpenGLMultisampleRenderBuffer(GLenum internalFormat, core::dimension2du size, uint32_t sampleCount)\n : COpenGLRenderBuffer(internalFormat, size, false), SampleCount(sampleCount)\n{\n COpenGLExtensionHandler::extGlCreateRenderbuffers(1,&RenderBufferName);\n COpenGLExtensionHandler::extGlNamedRenderbufferStorageMultisample(RenderBufferName,SampleCount,InternalFormat,RenderBufferSize.Width,RenderBufferSize.Height);\n}\n\n\nvoid COpenGLMultisampleRenderBuffer::resize(const core::dimension2du &newSize)\n{\n RenderBufferSize = newSize;\n\n if (RenderBufferName)\n {\n glDeleteTextures(1,&RenderBufferName);\n RenderBufferName = 0;\n }\n COpenGLExtensionHandler::extGlCreateRenderbuffers(1,&RenderBufferName);\n COpenGLExtensionHandler::extGlNamedRenderbufferStorageMultisample(RenderBufferName,SampleCount,InternalFormat,RenderBufferSize.Width,RenderBufferSize.Height);\n\n\tRenderBufferNameHasChanged = CNullDriver::incrementAndFetchReallocCounter();\n}\n\n}\n}\n#endif\n<commit_msg>Renderbuffer killing random textures on resize fix.<commit_after>#include \"IrrCompileConfig.h\"\r\n\r\n#ifdef _IRR_COMPILE_WITH_OPENGL_\n\n#include \"COpenGLDriver.h\"\n\n#include \"COpenGLRenderBuffer.h\"\n\r\nnamespace irr\r\n{\r\nnamespace video\r\n{\n\r\n\/\/! constructor\nCOpenGLRenderBuffer::COpenGLRenderBuffer(GLenum internalFormat, core::dimension2du size)\n : RenderBufferSize(size), InternalFormat(internalFormat), RenderBufferName(0), RenderBufferNameHasChanged(0)\n{\n COpenGLExtensionHandler::extGlCreateRenderbuffers(1,&RenderBufferName);\n COpenGLExtensionHandler::extGlNamedRenderbufferStorage(RenderBufferName,InternalFormat,RenderBufferSize.Width,RenderBufferSize.Height);\n}\r\n\r\n\/\/! destructor\r\nCOpenGLRenderBuffer::~COpenGLRenderBuffer()\n{\n COpenGLExtensionHandler::extGlDeleteRenderbuffers(1,&RenderBufferName);\n}\n\nvoid COpenGLRenderBuffer::resize(const core::dimension2du &newSize)\n{\n RenderBufferSize = newSize;\n\n if (RenderBufferName)\n {\n COpenGLExtensionHandler::extGlDeleteRenderbuffers(1,&RenderBufferName);\n RenderBufferName = 0;\n }\n COpenGLExtensionHandler::extGlCreateRenderbuffers(1,&RenderBufferName);\n COpenGLExtensionHandler::extGlNamedRenderbufferStorage(RenderBufferName,InternalFormat,RenderBufferSize.Width,RenderBufferSize.Height);\n\n\tRenderBufferNameHasChanged = CNullDriver::incrementAndFetchReallocCounter();\n}\n\n\n\n\r\n\/\/! constructor\nCOpenGLMultisampleRenderBuffer::COpenGLMultisampleRenderBuffer(GLenum internalFormat, core::dimension2du size, uint32_t sampleCount)\n : COpenGLRenderBuffer(internalFormat, size, false), SampleCount(sampleCount)\n{\n COpenGLExtensionHandler::extGlCreateRenderbuffers(1,&RenderBufferName);\n COpenGLExtensionHandler::extGlNamedRenderbufferStorageMultisample(RenderBufferName,SampleCount,InternalFormat,RenderBufferSize.Width,RenderBufferSize.Height);\n}\n\n\nvoid COpenGLMultisampleRenderBuffer::resize(const core::dimension2du &newSize)\n{\n RenderBufferSize = newSize;\n\n if (RenderBufferName)\n {\n COpenGLExtensionHandler::extGlDeleteRenderbuffers(1,&RenderBufferName);\n RenderBufferName = 0;\n }\n COpenGLExtensionHandler::extGlCreateRenderbuffers(1,&RenderBufferName);\n COpenGLExtensionHandler::extGlNamedRenderbufferStorageMultisample(RenderBufferName,SampleCount,InternalFormat,RenderBufferSize.Width,RenderBufferSize.Height);\n\n\tRenderBufferNameHasChanged = CNullDriver::incrementAndFetchReallocCounter();\n}\n\n}\n}\n#endif\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 \"file_manager.h\"\r\n#include \"stringhelpers.h\"\r\n#include \"encryption.h\"\r\n#include \"exception.h\"\r\n#include <QDesktopServices>\r\n#include <QFile>\r\n#include <QXmlStreamWriter>\r\n#include <QXmlStreamReader>\r\n#include <QVariant>\r\n#include <QMutex>\r\n#include <QReadWriteLock>\r\n#include <QSqlDatabase>\r\n#include <QSqlQuery>\r\n#include <QSqlError>\r\n#include <QSqlResult>\r\n#include <QMap>\r\n#include <QMessageBox>\r\n#include <QByteArray>\r\nusing namespace GUtil;\r\nusing namespace GUtil::QtUtil;\r\n\r\n\/\/ A class to keep track of our mutexes\r\nclass mutex_record_t\r\n{\r\npublic:\r\n mutex_record_t()\r\n {\r\n count = 1;\r\n mut = new QReadWriteLock();\r\n }\r\n ~mutex_record_t(){ delete mut;}\r\n\r\n QReadWriteLock *mut;\r\n int count;\r\n};\r\n\r\nQMap<QString, mutex_record_t *> mutexes;\r\nQReadWriteLock mutex_lock;\r\n\r\nFile_Manager::File_Manager(const QString &id, bool primary)\r\n{\r\n my_id = id;\r\n file_location = get_file_loc(id);\r\n\r\n mutex_lock.lockForWrite();\r\n if(mutexes.contains(id))\r\n {\r\n mutexes.value(id)->mut->lockForWrite();\r\n\r\n mutexes[id]->count++;\r\n\r\n mutexes.value(id)->mut->unlock();\r\n }\r\n else\r\n {\r\n mutexes.insert(id, new mutex_record_t());\r\n }\r\n mutex_lock.unlock();\r\n\r\n if(primary)\r\n {\r\n if(QFile::exists(file_location))\r\n QFile::remove(file_location);\r\n\r\n QSqlDatabase::addDatabase(\"QSQLITE\").setDatabaseName(file_location);\r\n reset();\r\n }\r\n}\r\n\r\nFile_Manager::~File_Manager()\r\n{\r\n\r\n}\r\n\r\nint File_Manager::addFile(const QString &data)\r\n{\r\n mutex_lock.lockForRead();\r\n mutexes.value(my_id)->mut->lockForWrite();\r\n\r\n QSqlDatabase dbase;\r\n prep_database(dbase);\r\n\r\n int ret = get_free_file_id(dbase);\r\n add_file(ret, data, dbase);\r\n\r\n dbase.close();\r\n mutexes.value(my_id)->mut->unlock();\r\n mutex_lock.unlock();\r\n\r\n return ret;\r\n}\r\n\r\nint File_Manager::addFile(int id, const QString &data)\r\n{\r\n mutex_lock.lockForRead();\r\n mutexes.value(my_id)->mut->lockForWrite();\r\n\r\n QSqlDatabase dbase;\r\n prep_database(dbase);\r\n\r\n int ret = add_file(id, data, dbase);\r\n\r\n dbase.close();\r\n mutexes.value(my_id)->mut->unlock();\r\n mutex_lock.unlock();\r\n\r\n return ret;\r\n}\r\n\r\nint File_Manager::add_file(int id, const QString &data, QSqlDatabase &dbase)\r\n{\r\n if(has_file(id, dbase))\r\n remove_file(id, dbase);\r\n\r\n QSqlQuery q(\"INSERT INTO files (id, data) VALUES (:id, :data)\", dbase);\r\n q.bindValue(\":id\", id);\r\n q.bindValue(\":data\", data, QSql::Binary);\r\n q.exec();\r\n\r\n return id;\r\n}\r\n\r\nvoid File_Manager::removeFile(int id)\r\n{\r\n mutex_lock.lockForRead();\r\n mutexes.value(my_id)->mut->lockForWrite();\r\n\r\n QSqlDatabase dbase;\r\n prep_database(dbase);\r\n\r\n remove_file(id, dbase);\r\n\r\n dbase.close();\r\n mutexes.value(my_id)->mut->unlock();\r\n mutex_lock.unlock();\r\n}\r\n\r\nvoid File_Manager::remove_file(int id, QSqlDatabase &dbase)\r\n{\r\n \/\/ Remove each item one by one\r\n QSqlQuery q(\"DELETE FROM files WHERE id=:id\");\r\n q.bindValue(\":id\", id);\r\n q.exec();\r\n}\r\n\r\nQString File_Manager::getFile(int id)\r\n{\r\n mutex_lock.lockForRead();\r\n mutexes.value(my_id)->mut->lockForRead();\r\n\r\n QSqlDatabase dbase;\r\n prep_database(dbase);\r\n\r\n QSqlQuery q(\"SELECT data, COUNT(data) FROM files WHERE id=:id\", dbase);\r\n q.bindValue(\":id\", id);\r\n q.exec();\r\n\r\n if(q.first() && (q.value(1).toInt() == 1))\r\n {\r\n QByteArray ba = q.value(0).toByteArray();\r\n mutexes.value(my_id)->mut->unlock();\r\n mutex_lock.unlock();\r\n return QString::fromStdString(string(ba.constData(), ba.length()));\r\n }\r\n\r\n dbase.close();\r\n mutexes.value(my_id)->mut->unlock();\r\n mutex_lock.unlock();\r\n throw GUtil::Exception(\"File not found\");\r\n}\r\n\r\n\/\/ Clear all files\r\nvoid File_Manager::reset()\r\n{\r\n mutex_lock.lockForRead();\r\n mutexes.value(my_id)->mut->lockForWrite();\r\n\r\n QSqlDatabase dbase;\r\n prep_database(dbase);\r\n\r\n QSqlQuery q(dbase);\r\n q.exec(\"DROP TABLE \\\"files\\\"\");\r\n q.exec(\"CREATE TABLE \\\"files\\\" (\"\r\n \"\\\"id\\\" INTEGER NOT NULL,\"\r\n \"\\\"data\\\" BLOB NOT NULL)\");\r\n q.exec(\"CREATE INDEX idx ON files(id)\");\r\n dbase.close();\r\n\r\n mutexes.value(my_id)->mut->unlock();\r\n mutex_lock.unlock();\r\n}\r\n\r\nvoid File_Manager::prep_database(QSqlDatabase &dbase)\r\n{\r\n dbase = QSqlDatabase::database();\r\n if(!dbase.open())\r\n {\r\n mutexes.value(my_id)->mut->unlock();\r\n mutex_lock.unlock();\r\n throw GUtil::Exception(\"Cannot open database\");\r\n }\r\n}\r\n\r\nQString File_Manager::get_file_loc(const QString &id)\r\n{\r\n return QDesktopServices::storageLocation(QDesktopServices::TempLocation)\r\n + QString(\"\/%1.tempfile\").arg(id);\r\n}\r\n\r\nQList<int> File_Manager::idList()\r\n{\r\n mutex_lock.lockForRead();\r\n mutexes.value(my_id)->mut->lockForRead();\r\n\r\n QList<int> ret;\r\n QSqlDatabase dbase;\r\n prep_database(dbase);\r\n\r\n QSqlQuery q(\"SELECT id FROM files\");\r\n if(q.exec())\r\n {\r\n while(q.next())\r\n {\r\n ret.append(q.value(0).toInt());\r\n }\r\n }\r\n\r\n dbase.close();\r\n mutexes.value(my_id)->mut->unlock();\r\n mutex_lock.unlock();\r\n return ret;\r\n}\r\n\r\nbool File_Manager::hasFile(int id)\r\n{\r\n mutex_lock.lockForRead();\r\n mutexes.value(my_id)->mut->lockForRead();\r\n\r\n QSqlDatabase dbase;\r\n prep_database(dbase);\r\n\r\n bool ret = has_file(id, dbase);\r\n\r\n mutexes.value(my_id)->mut->unlock();\r\n mutex_lock.unlock();\r\n return ret;\r\n}\r\n\r\nbool File_Manager::has_file(int id, QSqlDatabase &dbase)\r\n{\r\n QSqlQuery q(\"SELECT id FROM files WHERE id=:id\", dbase);\r\n q.bindValue(\":id\", id);\r\n q.exec();\r\n return q.first();\r\n}\r\n\r\nint File_Manager::get_free_file_id(QSqlDatabase &dbase)\r\n{\r\n \/\/ You must already have a lock on the database before using this function!\r\n\r\n int max_id = 0;\r\n QSqlQuery q(\"SELECT COUNT(id),MAX(id) FROM files\", dbase);\r\n q.exec();\r\n if(q.first())\r\n {\r\n if(q.value(0).toInt() > 0)\r\n max_id = q.value(1).toInt();\r\n }\r\n\r\n do\r\n {\r\n if(++max_id < 0)\r\n max_id = 0;\r\n\r\n \/\/ Make sure the id isn't taken\r\n }while(has_file(max_id, dbase));\r\n\r\n return max_id;\r\n}\r\n<commit_msg>Fixed a bug in the id selection code<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 \"file_manager.h\"\r\n#include \"stringhelpers.h\"\r\n#include \"encryption.h\"\r\n#include \"exception.h\"\r\n#include <QDesktopServices>\r\n#include <QFile>\r\n#include <QXmlStreamWriter>\r\n#include <QXmlStreamReader>\r\n#include <QVariant>\r\n#include <QMutex>\r\n#include <QReadWriteLock>\r\n#include <QSqlDatabase>\r\n#include <QSqlQuery>\r\n#include <QSqlError>\r\n#include <QSqlResult>\r\n#include <QMap>\r\n#include <QMessageBox>\r\n#include <QByteArray>\r\nusing namespace GUtil;\r\nusing namespace GUtil::QtUtil;\r\n\r\n\/\/ A class to keep track of our mutexes\r\nclass mutex_record_t\r\n{\r\npublic:\r\n mutex_record_t()\r\n {\r\n count = 1;\r\n mut = new QReadWriteLock();\r\n }\r\n ~mutex_record_t(){ delete mut;}\r\n\r\n QReadWriteLock *mut;\r\n int count;\r\n};\r\n\r\nQMap<QString, mutex_record_t *> mutexes;\r\nQReadWriteLock mutex_lock;\r\n\r\nFile_Manager::File_Manager(const QString &id, bool primary)\r\n{\r\n my_id = id;\r\n file_location = get_file_loc(id);\r\n\r\n mutex_lock.lockForWrite();\r\n if(mutexes.contains(id))\r\n {\r\n mutexes.value(id)->mut->lockForWrite();\r\n\r\n mutexes[id]->count++;\r\n\r\n mutexes.value(id)->mut->unlock();\r\n }\r\n else\r\n {\r\n mutexes.insert(id, new mutex_record_t());\r\n }\r\n mutex_lock.unlock();\r\n\r\n if(primary)\r\n {\r\n if(QFile::exists(file_location))\r\n QFile::remove(file_location);\r\n\r\n QSqlDatabase::addDatabase(\"QSQLITE\").setDatabaseName(file_location);\r\n reset();\r\n }\r\n}\r\n\r\nFile_Manager::~File_Manager()\r\n{\r\n\r\n}\r\n\r\nint File_Manager::addFile(const QString &data)\r\n{\r\n mutex_lock.lockForRead();\r\n mutexes.value(my_id)->mut->lockForWrite();\r\n\r\n QSqlDatabase dbase;\r\n prep_database(dbase);\r\n\r\n int ret = get_free_file_id(dbase);\r\n add_file(ret, data, dbase);\r\n\r\n dbase.close();\r\n mutexes.value(my_id)->mut->unlock();\r\n mutex_lock.unlock();\r\n\r\n return ret;\r\n}\r\n\r\nint File_Manager::addFile(int id, const QString &data)\r\n{\r\n mutex_lock.lockForRead();\r\n mutexes.value(my_id)->mut->lockForWrite();\r\n\r\n QSqlDatabase dbase;\r\n prep_database(dbase);\r\n\r\n int ret = add_file(id, data, dbase);\r\n\r\n dbase.close();\r\n mutexes.value(my_id)->mut->unlock();\r\n mutex_lock.unlock();\r\n\r\n return ret;\r\n}\r\n\r\nint File_Manager::add_file(int id, const QString &data, QSqlDatabase &dbase)\r\n{\r\n if(has_file(id, dbase))\r\n remove_file(id, dbase);\r\n\r\n QSqlQuery q(\"INSERT INTO files (id, data) VALUES (:id, :data)\", dbase);\r\n q.bindValue(\":id\", id);\r\n q.bindValue(\":data\", data, QSql::Binary);\r\n if(!q.exec())\r\n throw GUtil::Exception(q.lastError().text().toStdString());\r\n\r\n return id;\r\n}\r\n\r\nvoid File_Manager::removeFile(int id)\r\n{\r\n mutex_lock.lockForRead();\r\n mutexes.value(my_id)->mut->lockForWrite();\r\n\r\n QSqlDatabase dbase;\r\n prep_database(dbase);\r\n\r\n remove_file(id, dbase);\r\n\r\n dbase.close();\r\n mutexes.value(my_id)->mut->unlock();\r\n mutex_lock.unlock();\r\n}\r\n\r\nvoid File_Manager::remove_file(int id, QSqlDatabase &dbase)\r\n{\r\n \/\/ Remove each item one by one\r\n QSqlQuery q(\"DELETE FROM files WHERE id=:id\");\r\n q.bindValue(\":id\", id);\r\n q.exec();\r\n}\r\n\r\nQString File_Manager::getFile(int id)\r\n{\r\n mutex_lock.lockForRead();\r\n mutexes.value(my_id)->mut->lockForRead();\r\n\r\n QSqlDatabase dbase;\r\n prep_database(dbase);\r\n\r\n QSqlQuery q(\"SELECT data, COUNT(data) FROM files WHERE id=:id\", dbase);\r\n q.bindValue(\":id\", id);\r\n q.exec();\r\n\r\n if(q.first() && (q.value(1).toInt() == 1))\r\n {\r\n QByteArray ba = q.value(0).toByteArray();\r\n mutexes.value(my_id)->mut->unlock();\r\n mutex_lock.unlock();\r\n return QString::fromStdString(string(ba.constData(), ba.length()));\r\n }\r\n\r\n dbase.close();\r\n mutexes.value(my_id)->mut->unlock();\r\n mutex_lock.unlock();\r\n throw GUtil::Exception(\"File not found\");\r\n}\r\n\r\n\/\/ Clear all files\r\nvoid File_Manager::reset()\r\n{\r\n mutex_lock.lockForRead();\r\n mutexes.value(my_id)->mut->lockForWrite();\r\n\r\n QSqlDatabase dbase;\r\n prep_database(dbase);\r\n\r\n QSqlQuery q(dbase);\r\n q.exec(\"DROP TABLE \\\"files\\\"\");\r\n q.exec(\"CREATE TABLE \\\"files\\\" (\"\r\n \"\\\"id\\\" INTEGER NOT NULL,\"\r\n \"\\\"data\\\" BLOB NOT NULL)\");\r\n q.exec(\"CREATE INDEX idx ON files(id)\");\r\n dbase.close();\r\n\r\n mutexes.value(my_id)->mut->unlock();\r\n mutex_lock.unlock();\r\n}\r\n\r\nvoid File_Manager::prep_database(QSqlDatabase &dbase)\r\n{\r\n dbase = QSqlDatabase::database();\r\n if(!dbase.open())\r\n {\r\n mutexes.value(my_id)->mut->unlock();\r\n mutex_lock.unlock();\r\n throw GUtil::Exception(\"Cannot open database\");\r\n }\r\n}\r\n\r\nQString File_Manager::get_file_loc(const QString &id)\r\n{\r\n return QDesktopServices::storageLocation(QDesktopServices::TempLocation)\r\n + QString(\"\/%1.tempfile\").arg(id);\r\n}\r\n\r\nQList<int> File_Manager::idList()\r\n{\r\n mutex_lock.lockForRead();\r\n mutexes.value(my_id)->mut->lockForRead();\r\n\r\n QList<int> ret;\r\n QSqlDatabase dbase;\r\n prep_database(dbase);\r\n\r\n QSqlQuery q(\"SELECT id FROM files\");\r\n if(q.exec())\r\n {\r\n while(q.next())\r\n {\r\n ret.append(q.value(0).toInt());\r\n }\r\n }\r\n\r\n dbase.close();\r\n mutexes.value(my_id)->mut->unlock();\r\n mutex_lock.unlock();\r\n return ret;\r\n}\r\n\r\nbool File_Manager::hasFile(int id)\r\n{\r\n mutex_lock.lockForRead();\r\n mutexes.value(my_id)->mut->lockForRead();\r\n\r\n QSqlDatabase dbase;\r\n prep_database(dbase);\r\n\r\n bool ret = has_file(id, dbase);\r\n\r\n mutexes.value(my_id)->mut->unlock();\r\n mutex_lock.unlock();\r\n return ret;\r\n}\r\n\r\nbool File_Manager::has_file(int id, QSqlDatabase &dbase)\r\n{\r\n QSqlQuery q(\"SELECT id FROM files WHERE id=:id\", dbase);\r\n q.bindValue(\":id\", id);\r\n q.exec();\r\n return q.first();\r\n}\r\n\r\nint File_Manager::get_free_file_id(QSqlDatabase &dbase)\r\n{\r\n \/\/ You must already have a lock on the database before using this function!\r\n\r\n int max_id = 0;\r\n bool found_id = false;\r\n\r\n QSqlQuery q(\"SELECT COUNT(id),MAX(id) FROM files\", dbase);\r\n q.exec();\r\n if(q.first())\r\n {\r\n if(q.value(0).toInt() > 0)\r\n {\r\n max_id = q.value(1).toInt();\r\n found_id = true;\r\n }\r\n }\r\n\r\n bool first_time = true;\r\n do\r\n {\r\n if(first_time)\r\n {\r\n first_time = false;\r\n if(found_id)\r\n max_id++;\r\n }\r\n else\r\n max_id++;\r\n\r\n if(max_id < 0)\r\n max_id = 0;\r\n\r\n \/\/ Make sure the id isn't taken\r\n }while(has_file(max_id, dbase));\r\n\r\n return max_id;\r\n}\r\n<|endoftext|>"} {"text":"<commit_before>int dp[MAX][MAX]; \/\/ dp[i][j] is number of ways j items can be choosen from i items\n\nvoid ncr() {\n\tdp[0][0] = 1;\n for(int i = 1; i < MAX; ++i) {\n for(int j = 0; j <= i; ++j) {\n if(j == i or j == 0) {\n dp[i][j] = 1;\n } else {\n dp[i][j] = (dp[i - 1][j - 1] + dp[i - 1][j]) % mod;\n }\n }\n }\n}\n\n\/\/ Using combinatorics\n#define MAX 100001\n#define MOD 1000000007\nint fact[MAX];\nint ifact[MAX];\n\nint power(int base, int exp, int mod) {\n if(exp == 0) return 1;\n int ret = power(base, exp \/ 2, mod) % mod;\n ret = 1LL * ret * ret % mod;\n if(exp & 1) {\n ret = 1LL * ret * base % mod;\n }\n return ret;\n}\n\n\/\/ Modular mutiplicative inverse\nint modInv(int base, int mod = 1000000007) {\n return power(base, mod - 2, mod);\n}\n\nvoid init() {\n fact[0] = 1;\n ifact[0] = modInv(fact[0]);\n FOR(i, 1, MAX - 1) {\n fact[i] = 1LL * i * fact[i - 1] % MOD;\n ifact[i] = modInv(fact[i]);\n }\n}\n\nint ncr(int n, int r) {\n int ncr = 1LL * fact[n] * ifact[r] % MOD;\n ncr = 1LL * ncr * ifact[n - r] % MOD;\n return ncr;\n}<commit_msg>nCr updated<commit_after>int dp[MAX][MAX]; \/\/ dp[i][j] is number of ways j items can be choosen from i items\n\nvoid ncr() {\n\tdp[0][0] = 1;\n for(int i = 1; i < MAX; ++i) {\n for(int j = 0; j <= i; ++j) {\n if(j == i or j == 0) {\n dp[i][j] = 1;\n } else {\n dp[i][j] = (dp[i - 1][j - 1] + dp[i - 1][j]) % mod;\n }\n }\n }\n}\n\n\/\/ Using combinatorics\n#define MAX 100001\n#define MOD 1000000007\nint fact[MAX];\nint ifact[MAX];\n\nint power(int base, int exp, int mod) {\n if(exp == 0) return 1;\n int ret = power(base, exp \/ 2, mod) % mod;\n ret = 1LL * ret * ret % mod;\n if(exp & 1) {\n ret = 1LL * ret * base % mod;\n }\n return ret;\n}\n\n\/\/ Modular mutiplicative inverse\nint modInv(int base, int mod = 1000000007) {\n return power(base, mod - 2, mod);\n}\n\nvoid init() {\n fact[0] = 1;\n ifact[0] = modInv(fact[0]);\n FOR(i, 1, MAX - 1) {\n fact[i] = 1LL * i * fact[i - 1] % MOD;\n ifact[i] = modInv(fact[i]);\n }\n}\n\nint ncr(int n, int r) {\n int ans = fact[n];\n ans = 1LL * ans * ifact[r] % MOD;\n ans = 1LL * ans * ifact[n - r] % MOD;\n return ans;\n}<|endoftext|>"} {"text":"<commit_before>\/*\n * Copyright (c) 2013, 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#include \"precompiled.hpp\"\n#include \"runtime\/javaCalls.hpp\"\n#include \"runtime\/gpu.hpp\"\n#include \"utilities\/globalDefinitions.hpp\"\n#include \"utilities\/ostream.hpp\"\n#include \"memory\/allocation.hpp\"\n#include \"memory\/allocation.inline.hpp\"\n#include \"graal\/graalEnv.hpp\"\n#include \"graal\/graalCompiler.hpp\"\n#include \"graal\/graalJavaAccess.hpp\"\n#include \"hsailKernelArguments.hpp\"\n\n\/\/ Entry to GPU native method implementation that transitions current thread to '_thread_in_vm'.\n#define GPU_VMENTRY(result_type, name, signature) \\\n JNIEXPORT result_type JNICALL name signature { \\\n GRAAL_VM_ENTRY_MARK; \\\n\n\/\/ Entry to GPU native method implementation that calls a JNI function\n\/\/ and hence cannot transition current thread to '_thread_in_vm'.\n#define GPU_ENTRY(result_type, name, signature) \\\n JNIEXPORT result_type JNICALL name signature { \\\n\n#define GPU_END }\n\n#define CC (char*) \/*cast a literal from (const char*)*\/\n#define FN_PTR(f) CAST_FROM_FN_PTR(void*, &(f))\n\n#define OBJECT \"Ljava\/lang\/Object;\"\n#define STRING \"Ljava\/lang\/String;\"\n#define HS_INSTALLED_CODE \"Lcom\/oracle\/graal\/hotspot\/meta\/HotSpotInstalledCode;\"\n\n\/\/ public native void executeKernel(HotSpotNmethod kernel, int jobSize, int i, int j, Object[] args) throws InvalidInstalledCodeException;\n\nJNINativeMethod gpu::Hsail::HSAIL_methods[] = {\n {CC\"initialize\", CC\"()Z\", FN_PTR(gpu::Hsail::initialize)},\n {CC\"generateKernel\", CC\"([B\" STRING \")J\", FN_PTR(gpu::Hsail::generate_kernel)},\n {CC\"executeKernel0\", CC\"(\"HS_INSTALLED_CODE\"I[\"OBJECT\")Z\", FN_PTR(gpu::Hsail::execute_kernel_void_1d)},\n};\n\nvoid * gpu::Hsail::_device_context = NULL;\n\ngpu::Hsail::okra_create_context_func_t gpu::Hsail::_okra_create_context;\ngpu::Hsail::okra_create_kernel_func_t gpu::Hsail::_okra_create_kernel;\ngpu::Hsail::okra_push_object_func_t gpu::Hsail::_okra_push_object;\ngpu::Hsail::okra_push_boolean_func_t gpu::Hsail::_okra_push_boolean;\ngpu::Hsail::okra_push_byte_func_t gpu::Hsail::_okra_push_byte;\ngpu::Hsail::okra_push_double_func_t gpu::Hsail::_okra_push_double;\ngpu::Hsail::okra_push_float_func_t gpu::Hsail::_okra_push_float;\ngpu::Hsail::okra_push_int_func_t gpu::Hsail::_okra_push_int;\ngpu::Hsail::okra_push_long_func_t gpu::Hsail::_okra_push_long;\ngpu::Hsail::okra_execute_with_range_func_t gpu::Hsail::_okra_execute_with_range;\ngpu::Hsail::okra_clearargs_func_t gpu::Hsail::_okra_clearargs;\ngpu::Hsail::okra_register_heap_func_t gpu::Hsail::_okra_register_heap;\n\n\nvoid gpu::Hsail::register_heap() {\n \/\/ After the okra functions are set up and the heap is initialized, register the java heap with HSA\n guarantee(Universe::heap() != NULL, \"heap should be there by now.\");\n if (TraceGPUInteraction) {\n tty->print_cr(\"[HSAIL] heap=\" PTR_FORMAT, Universe::heap());\n tty->print_cr(\"[HSAIL] base=0x%08x, capacity=%ld\", Universe::heap()->base(), Universe::heap()->capacity());\n }\n _okra_register_heap(Universe::heap()->base(), Universe::heap()->capacity());\n}\n\nGPU_VMENTRY(jboolean, gpu::Hsail::execute_kernel_void_1d, (JNIEnv* env, jclass, jobject kernel_handle, jint dimX, jobject args_handle))\n\n ResourceMark rm;\n jlong nmethodValue = HotSpotInstalledCode::codeBlob(kernel_handle);\n if (nmethodValue == 0) {\n SharedRuntime::throw_and_post_jvmti_exception(JavaThread::current(), vmSymbols::com_oracle_graal_api_code_InvalidInstalledCodeException(), NULL);\n }\n nmethod* nm = (nmethod*) (address) nmethodValue;\n methodHandle mh = nm->method();\n Symbol* signature = mh->signature();\n\n void* kernel = (void*) HotSpotInstalledCode::codeStart(kernel_handle);\n if (kernel == NULL) {\n SharedRuntime::throw_and_post_jvmti_exception(JavaThread::current(), vmSymbols::com_oracle_graal_api_code_InvalidInstalledCodeException(), NULL);\n }\n\n objArrayOop args = (objArrayOop) JNIHandles::resolve(args_handle);\n\n \/\/ Reset the kernel arguments\n _okra_clearargs(kernel);\n\n \/\/ This object sets up the kernel arguments\n HSAILKernelArguments hka((address) kernel, mh->signature(), args, mh->is_static());\n\n \/\/ Run the kernel\n return _okra_execute_with_range(kernel, dimX);\nGPU_END\n\nGPU_ENTRY(jlong, gpu::Hsail::generate_kernel, (JNIEnv *env, jclass, jbyteArray code_handle, jstring name_handle))\n guarantee(_okra_create_kernel != NULL, \"[HSAIL] Okra not linked\");\n ResourceMark rm;\n jsize name_len = env->GetStringLength(name_handle);\n jsize code_len = env->GetArrayLength(code_handle);\n\n char* name = NEW_RESOURCE_ARRAY(char, name_len + 1);\n unsigned char *code = NEW_RESOURCE_ARRAY(unsigned char, code_len + 1);\n\n code[code_len] = 0;\n name[name_len] = 0;\n\n env->GetByteArrayRegion(code_handle, 0, code_len, (jbyte*) code);\n env->GetStringUTFRegion(name_handle, 0, name_len, name);\n\n register_heap();\n\n \/\/ The kernel entrypoint is always run for the time being \n const char* entryPointName = \"&run\";\n\n _device_context = _okra_create_context();\n\n return (jlong) _okra_create_kernel(_device_context, code, entryPointName);\nGPU_END\n\n#if defined(LINUX)\nstatic const char* okra_library_name = \"libokra_x86_64.so\";\n#else\nstatic char const* okra_library_name = NULL;\n#endif\n\n#define STRINGIFY(x) #x\n\n#define LOOKUP_OKRA_FUNCTION(name, alias) \\\n _##alias = \\\n CAST_TO_FN_PTR(alias##_func_t, os::dll_lookup(handle, STRINGIFY(name))); \\\n if (_##alias == NULL) { \\\n tty->print_cr(\"[HSAIL] ***** Error: Failed to lookup %s in %s, wrong version of OKRA?\", STRINGIFY(name), okra_library_name); \\\n return false; \\\n } \\\n\nGPU_ENTRY(jboolean, gpu::Hsail::initialize, (JNIEnv *env, jclass))\n if (okra_library_name == NULL) {\n if (TraceGPUInteraction) {\n tty->print_cr(\"Unsupported HSAIL platform\");\n }\n return false;\n }\n\n \/\/ here we know we have a valid okra_library_name to try to load\n char ebuf[O_BUFLEN];\n if (TraceGPUInteraction) {\n tty->print_cr(\"[HSAIL] library is %s\", okra_library_name);\n }\n void *handle = os::dll_load(okra_library_name, ebuf, O_BUFLEN);\n \/\/ try alternate location if env variable set\n char *okra_lib_name_from_env_var = getenv(\"_OKRA_SIM_LIB_PATH_\");\n if ((handle == NULL) && (okra_lib_name_from_env_var != NULL)) {\n handle = os::dll_load(okra_lib_name_from_env_var, ebuf, O_BUFLEN);\n if ((handle != NULL) && TraceGPUInteraction) {\n tty->print_cr(\"[HSAIL] using _OKRA_SIM_LIB_PATH_=%s\", getenv(\"_OKRA_SIM_LIB_PATH_\"));\n }\n }\n\n if (handle == NULL) {\n \/\/ Unable to dlopen okra\n if (TraceGPUInteraction) {\n tty->print_cr(\"[HSAIL] library load failed.\");\n }\n return false;\n }\n \n guarantee(_okra_create_context == NULL, \"cannot repeat GPU initialization\");\n\n \/\/ at this point we know handle is valid and we can lookup the functions\n LOOKUP_OKRA_FUNCTION(okra_create_context, okra_create_context);\n LOOKUP_OKRA_FUNCTION(okra_create_kernel, okra_create_kernel);\n LOOKUP_OKRA_FUNCTION(okra_push_object, okra_push_object);\n LOOKUP_OKRA_FUNCTION(okra_push_boolean, okra_push_boolean);\n LOOKUP_OKRA_FUNCTION(okra_push_byte, okra_push_byte);\n LOOKUP_OKRA_FUNCTION(okra_push_double, okra_push_double);\n LOOKUP_OKRA_FUNCTION(okra_push_float, okra_push_float);\n LOOKUP_OKRA_FUNCTION(okra_push_int, okra_push_int);\n LOOKUP_OKRA_FUNCTION(okra_push_long, okra_push_long);\n LOOKUP_OKRA_FUNCTION(okra_execute_with_range, okra_execute_with_range);\n LOOKUP_OKRA_FUNCTION(okra_clearargs, okra_clearargs);\n LOOKUP_OKRA_FUNCTION(okra_register_heap, okra_register_heap);\n \/\/ if we made it this far, real success\n\n gpu::initialized_gpu(\"Okra\");\n\n return true;\nGPU_END\n\nbool gpu::Hsail::register_natives(JNIEnv* env) {\n jclass klass = env->FindClass(\"com\/oracle\/graal\/hotspot\/hsail\/HSAILHotSpotBackend\");\n if (klass == NULL) {\n if (TraceGPUInteraction) {\n tty->print_cr(\"HSAILHotSpotBackend class not found\");\n }\n return false;\n }\n jint status = env->RegisterNatives(klass, HSAIL_methods, sizeof(HSAIL_methods) \/ sizeof(JNINativeMethod));\n if (status != JNI_OK) {\n if (TraceGPUInteraction) {\n tty->print_cr(\"Error registering natives for HSAILHotSpotBackend: %d\", status);\n }\n return false;\n }\n return true;\n}\n<commit_msg>reverted removal of Okra Windows DLL name<commit_after>\/*\n * Copyright (c) 2013, 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#include \"precompiled.hpp\"\n#include \"runtime\/javaCalls.hpp\"\n#include \"runtime\/gpu.hpp\"\n#include \"utilities\/globalDefinitions.hpp\"\n#include \"utilities\/ostream.hpp\"\n#include \"memory\/allocation.hpp\"\n#include \"memory\/allocation.inline.hpp\"\n#include \"graal\/graalEnv.hpp\"\n#include \"graal\/graalCompiler.hpp\"\n#include \"graal\/graalJavaAccess.hpp\"\n#include \"hsailKernelArguments.hpp\"\n\n\/\/ Entry to GPU native method implementation that transitions current thread to '_thread_in_vm'.\n#define GPU_VMENTRY(result_type, name, signature) \\\n JNIEXPORT result_type JNICALL name signature { \\\n GRAAL_VM_ENTRY_MARK; \\\n\n\/\/ Entry to GPU native method implementation that calls a JNI function\n\/\/ and hence cannot transition current thread to '_thread_in_vm'.\n#define GPU_ENTRY(result_type, name, signature) \\\n JNIEXPORT result_type JNICALL name signature { \\\n\n#define GPU_END }\n\n#define CC (char*) \/*cast a literal from (const char*)*\/\n#define FN_PTR(f) CAST_FROM_FN_PTR(void*, &(f))\n\n#define OBJECT \"Ljava\/lang\/Object;\"\n#define STRING \"Ljava\/lang\/String;\"\n#define HS_INSTALLED_CODE \"Lcom\/oracle\/graal\/hotspot\/meta\/HotSpotInstalledCode;\"\n\n\/\/ public native void executeKernel(HotSpotNmethod kernel, int jobSize, int i, int j, Object[] args) throws InvalidInstalledCodeException;\n\nJNINativeMethod gpu::Hsail::HSAIL_methods[] = {\n {CC\"initialize\", CC\"()Z\", FN_PTR(gpu::Hsail::initialize)},\n {CC\"generateKernel\", CC\"([B\" STRING \")J\", FN_PTR(gpu::Hsail::generate_kernel)},\n {CC\"executeKernel0\", CC\"(\"HS_INSTALLED_CODE\"I[\"OBJECT\")Z\", FN_PTR(gpu::Hsail::execute_kernel_void_1d)},\n};\n\nvoid * gpu::Hsail::_device_context = NULL;\n\ngpu::Hsail::okra_create_context_func_t gpu::Hsail::_okra_create_context;\ngpu::Hsail::okra_create_kernel_func_t gpu::Hsail::_okra_create_kernel;\ngpu::Hsail::okra_push_object_func_t gpu::Hsail::_okra_push_object;\ngpu::Hsail::okra_push_boolean_func_t gpu::Hsail::_okra_push_boolean;\ngpu::Hsail::okra_push_byte_func_t gpu::Hsail::_okra_push_byte;\ngpu::Hsail::okra_push_double_func_t gpu::Hsail::_okra_push_double;\ngpu::Hsail::okra_push_float_func_t gpu::Hsail::_okra_push_float;\ngpu::Hsail::okra_push_int_func_t gpu::Hsail::_okra_push_int;\ngpu::Hsail::okra_push_long_func_t gpu::Hsail::_okra_push_long;\ngpu::Hsail::okra_execute_with_range_func_t gpu::Hsail::_okra_execute_with_range;\ngpu::Hsail::okra_clearargs_func_t gpu::Hsail::_okra_clearargs;\ngpu::Hsail::okra_register_heap_func_t gpu::Hsail::_okra_register_heap;\n\n\nvoid gpu::Hsail::register_heap() {\n \/\/ After the okra functions are set up and the heap is initialized, register the java heap with HSA\n guarantee(Universe::heap() != NULL, \"heap should be there by now.\");\n if (TraceGPUInteraction) {\n tty->print_cr(\"[HSAIL] heap=\" PTR_FORMAT, Universe::heap());\n tty->print_cr(\"[HSAIL] base=0x%08x, capacity=%ld\", Universe::heap()->base(), Universe::heap()->capacity());\n }\n _okra_register_heap(Universe::heap()->base(), Universe::heap()->capacity());\n}\n\nGPU_VMENTRY(jboolean, gpu::Hsail::execute_kernel_void_1d, (JNIEnv* env, jclass, jobject kernel_handle, jint dimX, jobject args_handle))\n\n ResourceMark rm;\n jlong nmethodValue = HotSpotInstalledCode::codeBlob(kernel_handle);\n if (nmethodValue == 0) {\n SharedRuntime::throw_and_post_jvmti_exception(JavaThread::current(), vmSymbols::com_oracle_graal_api_code_InvalidInstalledCodeException(), NULL);\n }\n nmethod* nm = (nmethod*) (address) nmethodValue;\n methodHandle mh = nm->method();\n Symbol* signature = mh->signature();\n\n void* kernel = (void*) HotSpotInstalledCode::codeStart(kernel_handle);\n if (kernel == NULL) {\n SharedRuntime::throw_and_post_jvmti_exception(JavaThread::current(), vmSymbols::com_oracle_graal_api_code_InvalidInstalledCodeException(), NULL);\n }\n\n objArrayOop args = (objArrayOop) JNIHandles::resolve(args_handle);\n\n \/\/ Reset the kernel arguments\n _okra_clearargs(kernel);\n\n \/\/ This object sets up the kernel arguments\n HSAILKernelArguments hka((address) kernel, mh->signature(), args, mh->is_static());\n\n \/\/ Run the kernel\n return _okra_execute_with_range(kernel, dimX);\nGPU_END\n\nGPU_ENTRY(jlong, gpu::Hsail::generate_kernel, (JNIEnv *env, jclass, jbyteArray code_handle, jstring name_handle))\n guarantee(_okra_create_kernel != NULL, \"[HSAIL] Okra not linked\");\n ResourceMark rm;\n jsize name_len = env->GetStringLength(name_handle);\n jsize code_len = env->GetArrayLength(code_handle);\n\n char* name = NEW_RESOURCE_ARRAY(char, name_len + 1);\n unsigned char *code = NEW_RESOURCE_ARRAY(unsigned char, code_len + 1);\n\n code[code_len] = 0;\n name[name_len] = 0;\n\n env->GetByteArrayRegion(code_handle, 0, code_len, (jbyte*) code);\n env->GetStringUTFRegion(name_handle, 0, name_len, name);\n\n register_heap();\n\n \/\/ The kernel entrypoint is always run for the time being \n const char* entryPointName = \"&run\";\n\n _device_context = _okra_create_context();\n\n return (jlong) _okra_create_kernel(_device_context, code, entryPointName);\nGPU_END\n\n#if defined(LINUX)\nstatic const char* okra_library_name = \"libokra_x86_64.so\";\n#elif defined(_WINDOWS)\nstatic char const* okra_library_name = \"okra_x86_64.dll\";\n#else\nstatic char const* okra_library_name = NULL;\n#endif\n\n#define STRINGIFY(x) #x\n\n#define LOOKUP_OKRA_FUNCTION(name, alias) \\\n _##alias = \\\n CAST_TO_FN_PTR(alias##_func_t, os::dll_lookup(handle, STRINGIFY(name))); \\\n if (_##alias == NULL) { \\\n tty->print_cr(\"[HSAIL] ***** Error: Failed to lookup %s in %s, wrong version of OKRA?\", STRINGIFY(name), okra_library_name); \\\n return false; \\\n } \\\n\nGPU_ENTRY(jboolean, gpu::Hsail::initialize, (JNIEnv *env, jclass))\n if (okra_library_name == NULL) {\n if (TraceGPUInteraction) {\n tty->print_cr(\"Unsupported HSAIL platform\");\n }\n return false;\n }\n\n \/\/ here we know we have a valid okra_library_name to try to load\n char ebuf[O_BUFLEN];\n if (TraceGPUInteraction) {\n tty->print_cr(\"[HSAIL] library is %s\", okra_library_name);\n }\n void *handle = os::dll_load(okra_library_name, ebuf, O_BUFLEN);\n \/\/ try alternate location if env variable set\n char *okra_lib_name_from_env_var = getenv(\"_OKRA_SIM_LIB_PATH_\");\n if ((handle == NULL) && (okra_lib_name_from_env_var != NULL)) {\n handle = os::dll_load(okra_lib_name_from_env_var, ebuf, O_BUFLEN);\n if ((handle != NULL) && TraceGPUInteraction) {\n tty->print_cr(\"[HSAIL] using _OKRA_SIM_LIB_PATH_=%s\", getenv(\"_OKRA_SIM_LIB_PATH_\"));\n }\n }\n\n if (handle == NULL) {\n \/\/ Unable to dlopen okra\n if (TraceGPUInteraction) {\n tty->print_cr(\"[HSAIL] library load failed.\");\n }\n return false;\n }\n \n guarantee(_okra_create_context == NULL, \"cannot repeat GPU initialization\");\n\n \/\/ at this point we know handle is valid and we can lookup the functions\n LOOKUP_OKRA_FUNCTION(okra_create_context, okra_create_context);\n LOOKUP_OKRA_FUNCTION(okra_create_kernel, okra_create_kernel);\n LOOKUP_OKRA_FUNCTION(okra_push_object, okra_push_object);\n LOOKUP_OKRA_FUNCTION(okra_push_boolean, okra_push_boolean);\n LOOKUP_OKRA_FUNCTION(okra_push_byte, okra_push_byte);\n LOOKUP_OKRA_FUNCTION(okra_push_double, okra_push_double);\n LOOKUP_OKRA_FUNCTION(okra_push_float, okra_push_float);\n LOOKUP_OKRA_FUNCTION(okra_push_int, okra_push_int);\n LOOKUP_OKRA_FUNCTION(okra_push_long, okra_push_long);\n LOOKUP_OKRA_FUNCTION(okra_execute_with_range, okra_execute_with_range);\n LOOKUP_OKRA_FUNCTION(okra_clearargs, okra_clearargs);\n LOOKUP_OKRA_FUNCTION(okra_register_heap, okra_register_heap);\n \/\/ if we made it this far, real success\n\n gpu::initialized_gpu(\"Okra\");\n\n return true;\nGPU_END\n\nbool gpu::Hsail::register_natives(JNIEnv* env) {\n jclass klass = env->FindClass(\"com\/oracle\/graal\/hotspot\/hsail\/HSAILHotSpotBackend\");\n if (klass == NULL) {\n if (TraceGPUInteraction) {\n tty->print_cr(\"HSAILHotSpotBackend class not found\");\n }\n return false;\n }\n jint status = env->RegisterNatives(klass, HSAIL_methods, sizeof(HSAIL_methods) \/ sizeof(JNINativeMethod));\n if (status != JNI_OK) {\n if (TraceGPUInteraction) {\n tty->print_cr(\"Error registering natives for HSAILHotSpotBackend: %d\", status);\n }\n return false;\n }\n return true;\n}\n<|endoftext|>"} {"text":"<commit_before>\/* -*-c++-*- OpenSceneGraph - Copyright (C) 1998-2006 Robert Osfield \n *\n * This library is open source and may be redistributed and\/or modified under \n * the terms of the OpenSceneGraph Public License (OSGPL) version 0.0 or \n * (at your option) any later version. The full license is in LICENSE file\n * included with this distribution, and on the openscenegraph.org website.\n * \n * This library is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the \n * OpenSceneGraph Public License for more details.\n*\/\n\n#include <osgGA\/GUIEventAdapter>\n\nusing namespace osgGA;\n\nGUIEventAdapter::GUIEventAdapter():\n _eventType(NONE),\n _time(0.0),\n _key(0),\n _button(0),\n _Xmin(0.0),\n _Xmax(1.0),\n _Ymin(0.0),\n _Ymax(1.0),\n _mx(0.5),\n _my(0.5),\n _pressure(0.0),\n _buttonMask(0),\n _modKeyMask(0),\n _scrollingMotion(SCROLL_NONE),\n _scrollingDeltaX(0),\n _scrollingDeltaY(0),\n _mouseYOrientation(Y_INCREASING_DOWNWARDS),\n _tabletPointerType(UNKNOWN)\n{}\n\nGUIEventAdapter::GUIEventAdapter(const GUIEventAdapter& rhs):\n Referenced(),\n _eventType(rhs._eventType),\n _time(rhs._time),\n _key(rhs._key),\n _button(rhs._button),\n _Xmin(rhs._Xmin),\n _Xmax(rhs._Xmax),\n _Ymin(rhs._Ymin),\n _Ymax(rhs._Ymax),\n _mx(rhs._mx),\n _my(rhs._my),\n _pressure(rhs._pressure),\n _buttonMask(rhs._buttonMask),\n _modKeyMask(rhs._modKeyMask),\n _scrollingMotion(rhs._scrollingMotion),\n _scrollingDeltaX(rhs._scrollingDeltaX),\n _scrollingDeltaY(rhs._scrollingDeltaY),\n _mouseYOrientation(rhs._mouseYOrientation),\n _tabletPointerType(rhs._tabletPointerType)\n{}\n\nGUIEventAdapter::~GUIEventAdapter()\n{\n}\n\nvoid GUIEventAdapter::setWindowSize(float Xmin, float Ymin, float Xmax, float Ymax)\n{\n _Xmin = Xmin;\n _Ymin = Ymin;\n _Xmax = Xmax;\n _Ymax = Ymax;\n}\n<commit_msg>Added osg:: to Referenced() to fix IRIX build.<commit_after>\/* -*-c++-*- OpenSceneGraph - Copyright (C) 1998-2006 Robert Osfield \n *\n * This library is open source and may be redistributed and\/or modified under \n * the terms of the OpenSceneGraph Public License (OSGPL) version 0.0 or \n * (at your option) any later version. The full license is in LICENSE file\n * included with this distribution, and on the openscenegraph.org website.\n * \n * This library is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the \n * OpenSceneGraph Public License for more details.\n*\/\n\n#include <osgGA\/GUIEventAdapter>\n\nusing namespace osgGA;\n\nGUIEventAdapter::GUIEventAdapter():\n _eventType(NONE),\n _time(0.0),\n _key(0),\n _button(0),\n _Xmin(0.0),\n _Xmax(1.0),\n _Ymin(0.0),\n _Ymax(1.0),\n _mx(0.5),\n _my(0.5),\n _pressure(0.0),\n _buttonMask(0),\n _modKeyMask(0),\n _scrollingMotion(SCROLL_NONE),\n _scrollingDeltaX(0),\n _scrollingDeltaY(0),\n _mouseYOrientation(Y_INCREASING_DOWNWARDS),\n _tabletPointerType(UNKNOWN)\n{}\n\nGUIEventAdapter::GUIEventAdapter(const GUIEventAdapter& rhs):\n osg::Referenced(),\n _eventType(rhs._eventType),\n _time(rhs._time),\n _key(rhs._key),\n _button(rhs._button),\n _Xmin(rhs._Xmin),\n _Xmax(rhs._Xmax),\n _Ymin(rhs._Ymin),\n _Ymax(rhs._Ymax),\n _mx(rhs._mx),\n _my(rhs._my),\n _pressure(rhs._pressure),\n _buttonMask(rhs._buttonMask),\n _modKeyMask(rhs._modKeyMask),\n _scrollingMotion(rhs._scrollingMotion),\n _scrollingDeltaX(rhs._scrollingDeltaX),\n _scrollingDeltaY(rhs._scrollingDeltaY),\n _mouseYOrientation(rhs._mouseYOrientation),\n _tabletPointerType(rhs._tabletPointerType)\n{}\n\nGUIEventAdapter::~GUIEventAdapter()\n{\n}\n\nvoid GUIEventAdapter::setWindowSize(float Xmin, float Ymin, float Xmax, float Ymax)\n{\n _Xmin = Xmin;\n _Ymin = Ymin;\n _Xmax = Xmax;\n _Ymax = Ymax;\n}\n<|endoftext|>"} {"text":"<commit_before>#pragma once\n\n#include <algorithm>\n#include <cstdint>\n#include <string>\n\n#include \"hecl\/CVarManager.hpp\"\n\n#undef min\n#undef max\n\nnamespace hecl {\n\nusing namespace std::literals;\n\n#ifdef _WIN32\n#define DEFAULT_GRAPHICS_API \"D3D11\"sv\n#elif defined(__APPLE__)\n#define DEFAULT_GRAPHICS_API \"Metal\"sv\n#else\n#define DEFAULT_GRAPHICS_API \"Vulkan\"sv\n#endif\n\nstruct CVarCommons {\n CVarManager& m_mgr;\n CVar* m_graphicsApi = nullptr;\n CVar* m_drawSamples = nullptr;\n CVar* m_texAnisotropy = nullptr;\n CVar* m_deepColor = nullptr;\n CVar* m_variableDt = nullptr;\n\n CVar* m_debugOverlayPlayerInfo = nullptr;\n CVar* m_debugOverlayWorldInfo = nullptr;\n CVar* m_debugOverlayAreaInfo = nullptr;\n CVar* m_debugOverlayShowFrameCounter = nullptr;\n CVar* m_debugOverlayShowInGameTime = nullptr;\n CVar* m_debugOverlayShowResourceStats = nullptr;\n\n CVarCommons(CVarManager& manager) : m_mgr(manager) {\n m_graphicsApi = m_mgr.findOrMakeCVar(\"graphicsApi\"sv, \"API to use for rendering graphics\"sv, DEFAULT_GRAPHICS_API,\n hecl::CVar::EFlags::System | hecl::CVar::EFlags::Archive |\n hecl::CVar::EFlags::ModifyRestart);\n m_drawSamples = m_mgr.findOrMakeCVar(\"drawSamples\"sv, \"Number of MSAA samples to use for render targets\"sv, 1,\n hecl::CVar::EFlags::System | hecl::CVar::EFlags::Archive |\n hecl::CVar::EFlags::ModifyRestart);\n m_texAnisotropy = m_mgr.findOrMakeCVar(\n \"texAnisotropy\"sv, \"Number of anisotropic samples to use for sampling textures\"sv, 1,\n hecl::CVar::EFlags::System | hecl::CVar::EFlags::Archive | hecl::CVar::EFlags::ModifyRestart);\n m_deepColor = m_mgr.findOrMakeCVar(\n \"deepColor\"sv, \"Allow framebuffer with color depth greater-then 24-bits\"sv, false,\n hecl::CVar::EFlags::System | hecl::CVar::EFlags::Archive | hecl::CVar::EFlags::ModifyRestart);\n m_variableDt =\n m_mgr.findOrMakeCVar(\"variableDt\", \"Enable variable delta time (experimental)\", false,\n (CVar::EFlags::Game | CVar::EFlags::ReadOnly | CVar::EFlags::InternalArchivable));\n\n m_debugOverlayPlayerInfo = m_mgr.findOrMakeCVar(\n \"debugOverlay.playerInfo\"sv, \"Displays information about the player, such as location and orientation\"sv, false,\n hecl::CVar::EFlags::Game | hecl::CVar::EFlags::Archive | hecl::CVar::EFlags::ReadOnly);\n m_debugOverlayWorldInfo = m_mgr.findOrMakeCVar(\n \"debugOverlay.worldInfo\"sv,\n \"Displays information about the current world, such as world asset ID, and areaId\"sv, false,\n hecl::CVar::EFlags::Game | hecl::CVar::EFlags::Archive | hecl::CVar::EFlags::ReadOnly);\n m_debugOverlayAreaInfo = m_mgr.findOrMakeCVar(\n \"debugOverlay.areaInfo\"sv,\n \"Displays information about the current area, such as asset ID, object\/layer counts, and active layer bits\"sv,\n false, hecl::CVar::EFlags::Game | hecl::CVar::EFlags::Archive | hecl::CVar::EFlags::ReadOnly);\n m_debugOverlayShowFrameCounter =\n m_mgr.findOrMakeCVar(\"debugOverlay.showFrameCounter\"sv, \"Displays the current frame index\"sv, false,\n hecl::CVar::EFlags::Game | hecl::CVar::EFlags::Archive | hecl::CVar::EFlags::ReadOnly);\n m_debugOverlayShowInGameTime =\n m_mgr.findOrMakeCVar(\"debugOverlay.showInGameTime\"sv, \"Displays the current in game time\"sv, false,\n hecl::CVar::EFlags::Game | hecl::CVar::EFlags::Archive | hecl::CVar::EFlags::ReadOnly);\n m_debugOverlayShowResourceStats = m_mgr.findOrMakeCVar(\n \"debugOverlay.showResourceStats\"sv, \"Displays the current live resource object and token counts\"sv, false,\n hecl::CVar::EFlags::Game | hecl::CVar::EFlags::Archive | hecl::CVar::EFlags::ReadOnly);\n }\n\n std::string getGraphicsApi() const { return m_graphicsApi->toLiteral(); }\n\n void setGraphicsApi(std::string_view api) { m_graphicsApi->fromLiteral(api); }\n\n uint32_t getSamples() const { return std::max(1u, m_drawSamples->toUnsigned()); }\n\n void setSamples(uint32_t v) { m_drawSamples->fromInteger(std::max(uint32_t(1), v)); }\n\n uint32_t getAnisotropy() const { return std::max(1u, uint32_t(m_texAnisotropy->toUnsigned())); }\n\n void setAnisotropy(uint32_t v) { m_texAnisotropy->fromInteger(std::max(1u, v)); }\n\n bool getDeepColor() const { return m_deepColor->toBoolean(); }\n\n void setDeepColor(bool b) { m_deepColor->fromBoolean(b); }\n\n void serialize() { m_mgr.serialize(); }\n};\n\n} \/\/ namespace hecl\n<commit_msg>CVarCommons: Fix variableDt cvar type<commit_after>#pragma once\n\n#include <algorithm>\n#include <cstdint>\n#include <string>\n\n#include \"hecl\/CVarManager.hpp\"\n\n#undef min\n#undef max\n\nnamespace hecl {\n\nusing namespace std::literals;\n\n#ifdef _WIN32\n#define DEFAULT_GRAPHICS_API \"D3D11\"sv\n#elif defined(__APPLE__)\n#define DEFAULT_GRAPHICS_API \"Metal\"sv\n#else\n#define DEFAULT_GRAPHICS_API \"Vulkan\"sv\n#endif\n\nstruct CVarCommons {\n CVarManager& m_mgr;\n CVar* m_graphicsApi = nullptr;\n CVar* m_drawSamples = nullptr;\n CVar* m_texAnisotropy = nullptr;\n CVar* m_deepColor = nullptr;\n CVar* m_variableDt = nullptr;\n\n CVar* m_debugOverlayPlayerInfo = nullptr;\n CVar* m_debugOverlayWorldInfo = nullptr;\n CVar* m_debugOverlayAreaInfo = nullptr;\n CVar* m_debugOverlayShowFrameCounter = nullptr;\n CVar* m_debugOverlayShowInGameTime = nullptr;\n CVar* m_debugOverlayShowResourceStats = nullptr;\n\n CVarCommons(CVarManager& manager) : m_mgr(manager) {\n m_graphicsApi = m_mgr.findOrMakeCVar(\"graphicsApi\"sv, \"API to use for rendering graphics\"sv, DEFAULT_GRAPHICS_API,\n hecl::CVar::EFlags::System | hecl::CVar::EFlags::Archive |\n hecl::CVar::EFlags::ModifyRestart);\n m_drawSamples = m_mgr.findOrMakeCVar(\"drawSamples\"sv, \"Number of MSAA samples to use for render targets\"sv, 1,\n hecl::CVar::EFlags::System | hecl::CVar::EFlags::Archive |\n hecl::CVar::EFlags::ModifyRestart);\n m_texAnisotropy = m_mgr.findOrMakeCVar(\n \"texAnisotropy\"sv, \"Number of anisotropic samples to use for sampling textures\"sv, 1,\n hecl::CVar::EFlags::System | hecl::CVar::EFlags::Archive | hecl::CVar::EFlags::ModifyRestart);\n m_deepColor = m_mgr.findOrMakeCVar(\n \"deepColor\"sv, \"Allow framebuffer with color depth greater-then 24-bits\"sv, false,\n hecl::CVar::EFlags::System | hecl::CVar::EFlags::Archive | hecl::CVar::EFlags::ModifyRestart);\n m_variableDt =\n m_mgr.findOrMakeCVar(\"variableDt\", \"Enable variable delta time (experimental)\", false,\n (hecl::CVar::EFlags::System | hecl::CVar::EFlags::Archive |\n hecl::CVar::EFlags::ModifyRestart));\n\n m_debugOverlayPlayerInfo = m_mgr.findOrMakeCVar(\n \"debugOverlay.playerInfo\"sv, \"Displays information about the player, such as location and orientation\"sv, false,\n hecl::CVar::EFlags::Game | hecl::CVar::EFlags::Archive | hecl::CVar::EFlags::ReadOnly);\n m_debugOverlayWorldInfo = m_mgr.findOrMakeCVar(\n \"debugOverlay.worldInfo\"sv,\n \"Displays information about the current world, such as world asset ID, and areaId\"sv, false,\n hecl::CVar::EFlags::Game | hecl::CVar::EFlags::Archive | hecl::CVar::EFlags::ReadOnly);\n m_debugOverlayAreaInfo = m_mgr.findOrMakeCVar(\n \"debugOverlay.areaInfo\"sv,\n \"Displays information about the current area, such as asset ID, object\/layer counts, and active layer bits\"sv,\n false, hecl::CVar::EFlags::Game | hecl::CVar::EFlags::Archive | hecl::CVar::EFlags::ReadOnly);\n m_debugOverlayShowFrameCounter =\n m_mgr.findOrMakeCVar(\"debugOverlay.showFrameCounter\"sv, \"Displays the current frame index\"sv, false,\n hecl::CVar::EFlags::Game | hecl::CVar::EFlags::Archive | hecl::CVar::EFlags::ReadOnly);\n m_debugOverlayShowInGameTime =\n m_mgr.findOrMakeCVar(\"debugOverlay.showInGameTime\"sv, \"Displays the current in game time\"sv, false,\n hecl::CVar::EFlags::Game | hecl::CVar::EFlags::Archive | hecl::CVar::EFlags::ReadOnly);\n m_debugOverlayShowResourceStats = m_mgr.findOrMakeCVar(\n \"debugOverlay.showResourceStats\"sv, \"Displays the current live resource object and token counts\"sv, false,\n hecl::CVar::EFlags::Game | hecl::CVar::EFlags::Archive | hecl::CVar::EFlags::ReadOnly);\n }\n\n std::string getGraphicsApi() const { return m_graphicsApi->toLiteral(); }\n\n void setGraphicsApi(std::string_view api) { m_graphicsApi->fromLiteral(api); }\n\n uint32_t getSamples() const { return std::max(1u, m_drawSamples->toUnsigned()); }\n\n void setSamples(uint32_t v) { m_drawSamples->fromInteger(std::max(uint32_t(1), v)); }\n\n uint32_t getAnisotropy() const { return std::max(1u, uint32_t(m_texAnisotropy->toUnsigned())); }\n\n void setAnisotropy(uint32_t v) { m_texAnisotropy->fromInteger(std::max(1u, v)); }\n\n bool getDeepColor() const { return m_deepColor->toBoolean(); }\n\n void setDeepColor(bool b) { m_deepColor->fromBoolean(b); }\n\n void serialize() { m_mgr.serialize(); }\n};\n\n} \/\/ namespace hecl\n<|endoftext|>"} {"text":"<commit_before>\/*******************************************************************************\n * BSD 3-Clause License\n *\n * Copyright (c) 2019, Los Alamos National Security, 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 are met:\n *\n * * Redistributions of source code must retain the above copyright notice, this\n * list of conditions and the following disclaimer.\n *\n * * Redistributions in binary form must reproduce the above copyright notice,\n * this list of conditions and the following disclaimer in the documentation\n * and\/or other materials provided with the distribution.\n *\n * * Neither the name of the copyright holder nor the names of its\n * contributors may be used to endorse or promote products derived from\n * this software without specific prior written permission.\n *\n * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS \"AS IS\"\n * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE\n * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE\n * ARE\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\/* Title : collision_check.cpp\n * Project : moveit_jog_arm\n * Created : 1\/11\/2019\n * Author : Brian O'Neil, Andy Zelenak, Blake Anderson\n *\/\n\n#include <std_msgs\/Float64.h>\n\n#include <moveit_jog_arm\/collision_check.h>\n#include <moveit_jog_arm\/make_shared_from_pool.h>\n\nstatic const char LOGNAME[] = \"collision_check\";\nstatic const double MIN_RECOMMENDED_COLLISION_RATE = 10;\nconstexpr double EPSILON = 1e-6; \/\/ For very small numeric comparisons\n\nnamespace moveit_jog_arm\n{\n\/\/ Constructor for the class that handles collision checking\nCollisionCheck::CollisionCheck(ros::NodeHandle& nh, const moveit_jog_arm::JogArmParameters& parameters,\n const planning_scene_monitor::PlanningSceneMonitorPtr& planning_scene_monitor,\n const std::shared_ptr<JointStateSubscriber>& joint_state_subscriber)\n : nh_(nh)\n , parameters_(parameters)\n , planning_scene_monitor_(planning_scene_monitor)\n , joint_state_subscriber_(joint_state_subscriber)\n , self_velocity_scale_coefficient_(-log(0.001) \/ parameters.self_collision_proximity_threshold)\n , scene_velocity_scale_coefficient_(-log(0.001) \/ parameters.scene_collision_proximity_threshold)\n , period_(1. \/ parameters_.collision_check_rate)\n{\n \/\/ Init collision request\n collision_request_.group_name = parameters_.move_group_name;\n collision_request_.distance = true; \/\/ enable distance-based collision checking\n\n if (parameters_.collision_check_rate < MIN_RECOMMENDED_COLLISION_RATE)\n ROS_WARN_STREAM_THROTTLE_NAMED(ROS_LOG_THROTTLE_PERIOD, LOGNAME,\n \"Collision check rate is low, increase it in yaml file if CPU allows\");\n\n collision_check_type_ =\n (parameters_.collision_check_type == \"threshold_distance\" ? K_THRESHOLD_DISTANCE : K_STOP_DISTANCE);\n safety_factor_ = parameters_.collision_distance_safety_factor;\n\n \/\/ Internal namespace\n ros::NodeHandle internal_nh(\"~internal\");\n collision_velocity_scale_pub_ = internal_nh.advertise<std_msgs::Float64>(\"collision_velocity_scale\", ROS_QUEUE_SIZE);\n collision_velocity_scale_pub_ = internal_nh.advertise<std_msgs::Float64>(\"collision_velocity_scale\", 1);\n worst_case_stop_time_sub_ =\n internal_nh.subscribe(\"worst_case_stop_time\", ROS_QUEUE_SIZE, &CollisionCheck::worstCaseStopTimeCB, this);\n\n current_state_ = std::make_unique<moveit::core::RobotState>(getLockedPlanningSceneRO()->getCurrentState());\n acm_ = getLockedPlanningSceneRO()->getAllowedCollisionMatrix();\n}\n\nplanning_scene_monitor::LockedPlanningSceneRO CollisionCheck::getLockedPlanningSceneRO() const\n{\n return planning_scene_monitor::LockedPlanningSceneRO(planning_scene_monitor_);\n}\n\nvoid CollisionCheck::start()\n{\n timer_ = nh_.createTimer(period_, &CollisionCheck::run, this);\n}\n\nvoid CollisionCheck::stop()\n{\n timer_.stop();\n}\n\nvoid CollisionCheck::run(const ros::TimerEvent& timer_event)\n{\n \/\/ Log warning when the last loop duration was longer than the period\n if (timer_event.profile.last_duration.toSec() > period_.toSec())\n {\n ROS_WARN_STREAM_THROTTLE_NAMED(ROS_LOG_THROTTLE_PERIOD, LOGNAME,\n \"last_duration: \" << timer_event.profile.last_duration.toSec() << \" (\"\n << period_.toSec() << \")\");\n }\n\n if (paused_)\n {\n return;\n }\n\n \/\/ Copy the latest joint state\n auto latest_joint_state = joint_state_subscriber_->getLatest();\n for (std::size_t i = 0; i < latest_joint_state->position.size(); ++i)\n current_state_->setJointPositions(latest_joint_state->name[i], &latest_joint_state->position[i]);\n\n current_state_->updateCollisionBodyTransforms();\n collision_detected_ = false;\n\n \/\/ Do a timer-safe distance-based collision detection\n collision_result_.clear();\n getLockedPlanningSceneRO()->getCollisionEnv()->checkRobotCollision(collision_request_, collision_result_,\n *current_state_);\n scene_collision_distance_ = collision_result_.distance;\n collision_detected_ |= collision_result_.collision;\n\n collision_result_.clear();\n getLockedPlanningSceneRO()->getCollisionEnvUnpadded()->checkSelfCollision(collision_request_, collision_result_,\n *current_state_, acm_);\n self_collision_distance_ = collision_result_.distance;\n collision_detected_ |= collision_result_.collision;\n\n velocity_scale_ = 1;\n \/\/ If we're definitely in collision, stop immediately\n if (collision_detected_)\n {\n velocity_scale_ = 0;\n }\n \/\/ If threshold distances were specified\n else if (collision_check_type_ == K_THRESHOLD_DISTANCE)\n {\n \/\/ If we are far from a collision, velocity_scale should be 1.\n \/\/ If we are very close to a collision, velocity_scale should be ~zero.\n \/\/ When scene_collision_proximity_threshold is breached, start decelerating exponentially.\n if (scene_collision_distance_ < parameters_.scene_collision_proximity_threshold)\n {\n \/\/ velocity_scale = e ^ k * (collision_distance - threshold)\n \/\/ k = - ln(0.001) \/ collision_proximity_threshold\n \/\/ velocity_scale should equal one when collision_distance is at collision_proximity_threshold.\n \/\/ velocity_scale should equal 0.001 when collision_distance is at zero.\n velocity_scale_ =\n std::min(velocity_scale_, exp(scene_velocity_scale_coefficient_ *\n (scene_collision_distance_ - parameters_.scene_collision_proximity_threshold)));\n }\n\n if (self_collision_distance_ < parameters_.self_collision_proximity_threshold)\n {\n velocity_scale_ =\n std::min(velocity_scale_, exp(self_velocity_scale_coefficient_ *\n (self_collision_distance_ - parameters_.self_collision_proximity_threshold)));\n }\n }\n \/\/ Else, we stop based on worst-case stopping distance\n else\n {\n \/\/ Retrieve the worst-case time to stop, based on current joint velocities\n\n \/\/ Calculate rate of change of distance to nearest collision\n current_collision_distance_ = std::min(scene_collision_distance_, self_collision_distance_);\n derivative_of_collision_distance_ = (current_collision_distance_ - prev_collision_distance_) \/ period_.toSec();\n\n if (current_collision_distance_ < parameters_.min_allowable_collision_distance &&\n derivative_of_collision_distance_ <= 0)\n {\n velocity_scale_ = 0;\n }\n \/\/ Only bother doing calculations if we are moving toward the nearest collision\n else if (derivative_of_collision_distance_ < -EPSILON)\n {\n \/\/ At the rate the collision distance is decreasing, how long until we collide?\n est_time_to_collision_ = fabs(current_collision_distance_ \/ derivative_of_collision_distance_);\n\n \/\/ halt if we can't stop fast enough (including the safety factor)\n if (est_time_to_collision_ < (safety_factor_ * worst_case_stop_time_))\n {\n velocity_scale_ = 0;\n }\n }\n\n \/\/ Update for the next iteration\n prev_collision_distance_ = current_collision_distance_;\n }\n\n \/\/ publish message\n {\n auto msg = moveit::util::make_shared_from_pool<std_msgs::Float64>();\n msg->data = velocity_scale_;\n collision_velocity_scale_pub_.publish(msg);\n }\n}\n\nvoid CollisionCheck::worstCaseStopTimeCB(const std_msgs::Float64ConstPtr& msg)\n{\n worst_case_stop_time_ = msg->data;\n}\n\nvoid CollisionCheck::setPaused(bool paused)\n{\n paused_ = paused;\n}\n\n} \/\/ namespace moveit_jog_arm\n<commit_msg>[jog_arm] remove duplicate line<commit_after>\/*******************************************************************************\n * BSD 3-Clause License\n *\n * Copyright (c) 2019, Los Alamos National Security, 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 are met:\n *\n * * Redistributions of source code must retain the above copyright notice, this\n * list of conditions and the following disclaimer.\n *\n * * Redistributions in binary form must reproduce the above copyright notice,\n * this list of conditions and the following disclaimer in the documentation\n * and\/or other materials provided with the distribution.\n *\n * * Neither the name of the copyright holder nor the names of its\n * contributors may be used to endorse or promote products derived from\n * this software without specific prior written permission.\n *\n * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS \"AS IS\"\n * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE\n * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE\n * ARE\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\/* Title : collision_check.cpp\n * Project : moveit_jog_arm\n * Created : 1\/11\/2019\n * Author : Brian O'Neil, Andy Zelenak, Blake Anderson\n *\/\n\n#include <std_msgs\/Float64.h>\n\n#include <moveit_jog_arm\/collision_check.h>\n#include <moveit_jog_arm\/make_shared_from_pool.h>\n\nstatic const char LOGNAME[] = \"collision_check\";\nstatic const double MIN_RECOMMENDED_COLLISION_RATE = 10;\nconstexpr double EPSILON = 1e-6; \/\/ For very small numeric comparisons\n\nnamespace moveit_jog_arm\n{\n\/\/ Constructor for the class that handles collision checking\nCollisionCheck::CollisionCheck(ros::NodeHandle& nh, const moveit_jog_arm::JogArmParameters& parameters,\n const planning_scene_monitor::PlanningSceneMonitorPtr& planning_scene_monitor,\n const std::shared_ptr<JointStateSubscriber>& joint_state_subscriber)\n : nh_(nh)\n , parameters_(parameters)\n , planning_scene_monitor_(planning_scene_monitor)\n , joint_state_subscriber_(joint_state_subscriber)\n , self_velocity_scale_coefficient_(-log(0.001) \/ parameters.self_collision_proximity_threshold)\n , scene_velocity_scale_coefficient_(-log(0.001) \/ parameters.scene_collision_proximity_threshold)\n , period_(1. \/ parameters_.collision_check_rate)\n{\n \/\/ Init collision request\n collision_request_.group_name = parameters_.move_group_name;\n collision_request_.distance = true; \/\/ enable distance-based collision checking\n\n if (parameters_.collision_check_rate < MIN_RECOMMENDED_COLLISION_RATE)\n ROS_WARN_STREAM_THROTTLE_NAMED(ROS_LOG_THROTTLE_PERIOD, LOGNAME,\n \"Collision check rate is low, increase it in yaml file if CPU allows\");\n\n collision_check_type_ =\n (parameters_.collision_check_type == \"threshold_distance\" ? K_THRESHOLD_DISTANCE : K_STOP_DISTANCE);\n safety_factor_ = parameters_.collision_distance_safety_factor;\n\n \/\/ Internal namespace\n ros::NodeHandle internal_nh(\"~internal\");\n collision_velocity_scale_pub_ = internal_nh.advertise<std_msgs::Float64>(\"collision_velocity_scale\", ROS_QUEUE_SIZE);\n worst_case_stop_time_sub_ =\n internal_nh.subscribe(\"worst_case_stop_time\", ROS_QUEUE_SIZE, &CollisionCheck::worstCaseStopTimeCB, this);\n\n current_state_ = std::make_unique<moveit::core::RobotState>(getLockedPlanningSceneRO()->getCurrentState());\n acm_ = getLockedPlanningSceneRO()->getAllowedCollisionMatrix();\n}\n\nplanning_scene_monitor::LockedPlanningSceneRO CollisionCheck::getLockedPlanningSceneRO() const\n{\n return planning_scene_monitor::LockedPlanningSceneRO(planning_scene_monitor_);\n}\n\nvoid CollisionCheck::start()\n{\n timer_ = nh_.createTimer(period_, &CollisionCheck::run, this);\n}\n\nvoid CollisionCheck::stop()\n{\n timer_.stop();\n}\n\nvoid CollisionCheck::run(const ros::TimerEvent& timer_event)\n{\n \/\/ Log warning when the last loop duration was longer than the period\n if (timer_event.profile.last_duration.toSec() > period_.toSec())\n {\n ROS_WARN_STREAM_THROTTLE_NAMED(ROS_LOG_THROTTLE_PERIOD, LOGNAME,\n \"last_duration: \" << timer_event.profile.last_duration.toSec() << \" (\"\n << period_.toSec() << \")\");\n }\n\n if (paused_)\n {\n return;\n }\n\n \/\/ Copy the latest joint state\n auto latest_joint_state = joint_state_subscriber_->getLatest();\n for (std::size_t i = 0; i < latest_joint_state->position.size(); ++i)\n current_state_->setJointPositions(latest_joint_state->name[i], &latest_joint_state->position[i]);\n\n current_state_->updateCollisionBodyTransforms();\n collision_detected_ = false;\n\n \/\/ Do a timer-safe distance-based collision detection\n collision_result_.clear();\n getLockedPlanningSceneRO()->getCollisionEnv()->checkRobotCollision(collision_request_, collision_result_,\n *current_state_);\n scene_collision_distance_ = collision_result_.distance;\n collision_detected_ |= collision_result_.collision;\n\n collision_result_.clear();\n getLockedPlanningSceneRO()->getCollisionEnvUnpadded()->checkSelfCollision(collision_request_, collision_result_,\n *current_state_, acm_);\n self_collision_distance_ = collision_result_.distance;\n collision_detected_ |= collision_result_.collision;\n\n velocity_scale_ = 1;\n \/\/ If we're definitely in collision, stop immediately\n if (collision_detected_)\n {\n velocity_scale_ = 0;\n }\n \/\/ If threshold distances were specified\n else if (collision_check_type_ == K_THRESHOLD_DISTANCE)\n {\n \/\/ If we are far from a collision, velocity_scale should be 1.\n \/\/ If we are very close to a collision, velocity_scale should be ~zero.\n \/\/ When scene_collision_proximity_threshold is breached, start decelerating exponentially.\n if (scene_collision_distance_ < parameters_.scene_collision_proximity_threshold)\n {\n \/\/ velocity_scale = e ^ k * (collision_distance - threshold)\n \/\/ k = - ln(0.001) \/ collision_proximity_threshold\n \/\/ velocity_scale should equal one when collision_distance is at collision_proximity_threshold.\n \/\/ velocity_scale should equal 0.001 when collision_distance is at zero.\n velocity_scale_ =\n std::min(velocity_scale_, exp(scene_velocity_scale_coefficient_ *\n (scene_collision_distance_ - parameters_.scene_collision_proximity_threshold)));\n }\n\n if (self_collision_distance_ < parameters_.self_collision_proximity_threshold)\n {\n velocity_scale_ =\n std::min(velocity_scale_, exp(self_velocity_scale_coefficient_ *\n (self_collision_distance_ - parameters_.self_collision_proximity_threshold)));\n }\n }\n \/\/ Else, we stop based on worst-case stopping distance\n else\n {\n \/\/ Retrieve the worst-case time to stop, based on current joint velocities\n\n \/\/ Calculate rate of change of distance to nearest collision\n current_collision_distance_ = std::min(scene_collision_distance_, self_collision_distance_);\n derivative_of_collision_distance_ = (current_collision_distance_ - prev_collision_distance_) \/ period_.toSec();\n\n if (current_collision_distance_ < parameters_.min_allowable_collision_distance &&\n derivative_of_collision_distance_ <= 0)\n {\n velocity_scale_ = 0;\n }\n \/\/ Only bother doing calculations if we are moving toward the nearest collision\n else if (derivative_of_collision_distance_ < -EPSILON)\n {\n \/\/ At the rate the collision distance is decreasing, how long until we collide?\n est_time_to_collision_ = fabs(current_collision_distance_ \/ derivative_of_collision_distance_);\n\n \/\/ halt if we can't stop fast enough (including the safety factor)\n if (est_time_to_collision_ < (safety_factor_ * worst_case_stop_time_))\n {\n velocity_scale_ = 0;\n }\n }\n\n \/\/ Update for the next iteration\n prev_collision_distance_ = current_collision_distance_;\n }\n\n \/\/ publish message\n {\n auto msg = moveit::util::make_shared_from_pool<std_msgs::Float64>();\n msg->data = velocity_scale_;\n collision_velocity_scale_pub_.publish(msg);\n }\n}\n\nvoid CollisionCheck::worstCaseStopTimeCB(const std_msgs::Float64ConstPtr& msg)\n{\n worst_case_stop_time_ = msg->data;\n}\n\nvoid CollisionCheck::setPaused(bool paused)\n{\n paused_ = paused;\n}\n\n} \/\/ namespace moveit_jog_arm\n<|endoftext|>"} {"text":"<commit_before>#include <iostream>\n\nusing namespace std;\n\n\nint main()\n{\nint Num1;\nint Num2;\nint Duv;\nint Sum;\n\ncout << \"Pleas Enter A Number...\\n\";\ncout << endl;\ncin >> Num1;\ncout << \"Pleas Enter A Symbole Ex: +, *, - \\n\";\ncin >> Duv;\ncout << endl;\ncout << \"Pleas Enter A Number...\\n\";\ncin >> Num2;\ncout << endl;\n\nSum = Num1, Duv, Num2;\n\ncout << \"Processing...\\n\";\ncout << endl;\ncout << \"Processing Complete....\";\ncout << endl;\ncout << Num1 << Duv << Num2 << \" = \" << Sum << endl; \/\/ Calclats the problem!\n\nreturn 0;\n}\n<commit_msg>Added BING! :D<commit_after>#include <iostream>\n\nusing namespace std;\n\n\nint main()\n{\nint Num1;\nint Num2;\nint Duv;\nint Sum;\n\ncout << \"Pleas Enter A Number...\\n\";\ncout << endl;\ncin >> Num1;\ncout << \"Pleas Enter A Symbole Ex: +, *, - \\n\";\ncin >> Duv;\ncout << endl;\ncout << \"Pleas Enter A Number...\\n\";\ncin >> Num2;\ncout << endl;\n\nSum = Num1, Duv, Num2;\n\ncout << \"Processing ...\\n\";\ncout << endl;\ncout << \"Processing Complete ....\";\ncout << endl;\ncout << Num1 << Duv << Num2 << \" = \\a\" << Sum << endl; \/\/ Calclats the problem!\n\nreturn 0;\n}\n<|endoftext|>"} {"text":"<commit_before>\/*\r\n * Main_Window.cpp\r\n *\r\n * Created on: 30 avr. 2017\r\n * Author: guill\r\n *\/\r\n\r\n#include \"Application\/Windows\/Main_Window.h\"\r\n#include \"Application\/Events.h\"\r\n#include <iostream>\r\n\r\nMain_Window::Main_Window(Picaso::Serial_Commander& lcd) : Touchable_Window(lcd),\r\nbutton_moving(m_lcd, \"Moving Window\", Picaso::Color::RED, Picaso::Color::BLACK, 10, 70, 450\/2, 90),\r\nbutton_monitor(m_lcd, \"Process Monitor\", Picaso::Color::RED, Picaso::Color::BLACK, 10, 70+100, 450\/2, 90),\r\nbutton_spreading(m_lcd, \"Spreading Window\", Picaso::Color::RED, Picaso::Color::BLACK, 20 + 450\/2, 70, 450\/2, 90),\r\nbutton_tilt(m_lcd, \"Tilt Window\", Picaso::Color::RED, Picaso::Color::BLACK, 20 + 450\/2, 70+100, 450\/2, 90),\r\nm_title(m_lcd, \"BE POO 2017\", Picaso::Color::WHITE, 10, 10, 320, 60, 3, Picaso::Alignment_H::CENTER, Picaso::Alignment_V::CENTER, false),\r\nm_names(m_lcd, \"Combattelli Julien \\n\\rSarthou Guillaume\", Picaso::Color::WHITESMOKE, 320, 10, 480-320, 60, 1, Picaso::Alignment_H::CENTER, Picaso::Alignment_V::CENTER, false)\r\n{\r\n\tm_lcd = lcd;\r\n\tbutton_moving.add_receiver(*this);\r\n\tbutton_monitor.add_receiver(*this);\r\n\tbutton_spreading.add_receiver(*this);\r\n\tbutton_tilt.add_receiver(*this);\r\n\tm_touch_dispatcher.register_widget(button_moving);\r\n\tm_touch_dispatcher.register_widget(button_monitor);\r\n\tm_touch_dispatcher.register_widget(button_spreading);\r\n\tm_touch_dispatcher.register_widget(button_tilt);\r\n\r\n\tadd_event_handler<Picaso::Button_Pressed>(&Main_Window::button_pressed_handler, this);\r\n}\r\n\r\nMain_Window::~Main_Window()\r\n{\r\n\r\n}\r\n\r\nvoid Main_Window::show()\r\n{\r\n\tm_lcd.gfx_clear_screen();\r\n\tbutton_moving.show();\r\n\tbutton_monitor.show();\r\n\tbutton_spreading.show();\r\n\tbutton_tilt.show();\r\n\tm_title.show();\r\n\tm_names.show();\r\n}\r\n\r\nvoid Main_Window::button_pressed_handler(Sender& s, const Event& event)\r\n{\r\n\tstd::cout << \"touche\" << std::endl;\r\n\r\n\tunsigned int id = ((Picaso::Widget&)s).get_id();\r\n\r\n\tif(id == button_moving.get_id())\r\n\t\tbutton_moving_pressed();\r\n\telse if (id == button_monitor.get_id())\r\n\t\tbutton_monitor_pressed();\r\n\telse if(id == button_spreading.get_id())\r\n\t\tbutton_spreading_pressed();\r\n\telse if(id == button_tilt.get_id())\r\n\t\tbutton_tilt_pressed();\r\n}\r\n\r\nvoid Main_Window::button_moving_pressed()\r\n{\r\n\traise(Navigation_choise_Pressed(1));\r\n}\r\n\r\nvoid Main_Window::button_monitor_pressed()\r\n{\r\n\traise(Navigation_choise_Pressed(2));\r\n}\r\n\r\nvoid Main_Window::button_spreading_pressed()\r\n{\r\n\traise(Navigation_choise_Pressed(3));\r\n}\r\n\r\nvoid Main_Window::button_tilt_pressed()\r\n{\r\n\traise(Navigation_choise_Pressed(4));\r\n}\r\n<commit_msg>Fix UI bug<commit_after>\/*\r\n * Main_Window.cpp\r\n *\r\n * Created on: 30 avr. 2017\r\n * Author: guill\r\n *\/\r\n\r\n#include \"Application\/Windows\/Main_Window.h\"\r\n#include \"Application\/Events.h\"\r\n#include <iostream>\r\n\r\nMain_Window::Main_Window(Picaso::Serial_Commander& lcd) : Touchable_Window(lcd),\r\nbutton_moving(m_lcd, \"Moving Window\", Picaso::Color::RED, Picaso::Color::BLACK, 10, 70, 450\/2, 90),\r\nbutton_monitor(m_lcd, \"Process Monitor\", Picaso::Color::RED, Picaso::Color::BLACK, 10, 70+100, 450\/2, 90),\r\nbutton_spreading(m_lcd, \"Spreading Window\", Picaso::Color::RED, Picaso::Color::BLACK, 20 + 450\/2, 70, 450\/2, 90),\r\nbutton_tilt(m_lcd, \"Tilt Window\", Picaso::Color::RED, Picaso::Color::BLACK, 20 + 450\/2, 70+100, 450\/2, 90),\r\nm_title(m_lcd, \"BE POO 2017\", Picaso::Color::WHITE, 10, 10, 320, 60, 3, Picaso::Alignment_H::CENTER, Picaso::Alignment_V::CENTER, false),\r\nm_names(m_lcd, \"Combattelli Julien \\n\\rSarthou Guillaume\", Picaso::Color::WHITESMOKE, 320, 10, 480-320, 60, 1, Picaso::Alignment_H::CENTER, Picaso::Alignment_V::CENTER, false)\r\n{\r\n\tm_lcd = lcd;\r\n\tbutton_moving.add_receiver(*this);\r\n\tbutton_monitor.add_receiver(*this);\r\n\tbutton_spreading.add_receiver(*this);\r\n\tbutton_tilt.add_receiver(*this);\r\n\tm_touch_dispatcher.register_widget(button_moving);\r\n\tm_touch_dispatcher.register_widget(button_monitor);\r\n\tm_touch_dispatcher.register_widget(button_spreading);\r\n\tm_touch_dispatcher.register_widget(button_tilt);\r\n\r\n\tadd_event_handler<Picaso::Button_Pressed>(&Main_Window::button_pressed_handler, this);\r\n}\r\n\r\nMain_Window::~Main_Window()\r\n{\r\n\r\n}\r\n\r\nvoid Main_Window::show()\r\n{\r\n\tm_lcd.gfx_clear_screen();\r\n\tbutton_moving.show();\r\n\tbutton_monitor.show();\r\n\tbutton_spreading.show();\r\n\tbutton_tilt.show();\r\n\tm_title.show();\r\n\tm_names.show();\r\n}\r\n\r\nvoid Main_Window::button_pressed_handler(Sender& s, const Event& event)\r\n{\r\n\tstd::cout << \"touche\" << std::endl;\r\n\r\n\tunsigned int id = ((Picaso::Widget&)s).get_id();\r\n\r\n\tif(id == button_moving.get_id())\r\n\t\tbutton_moving_pressed();\r\n\telse if (id == button_monitor.get_id())\r\n\t\tbutton_monitor_pressed();\r\n\telse if(id == button_spreading.get_id())\r\n\t\tbutton_spreading_pressed();\r\n\telse if(id == button_tilt.get_id())\r\n\t\tbutton_tilt_pressed();\r\n}\r\n\r\nvoid Main_Window::button_moving_pressed()\r\n{\r\n\traise(Navigation_choise_Pressed(1));\r\n}\r\n\r\nvoid Main_Window::button_monitor_pressed()\r\n{\r\n\traise(Navigation_choise_Pressed(4));\r\n}\r\n\r\nvoid Main_Window::button_spreading_pressed()\r\n{\r\n\traise(Navigation_choise_Pressed(3));\r\n}\r\n\r\nvoid Main_Window::button_tilt_pressed()\r\n{\r\n\traise(Navigation_choise_Pressed(2));\r\n}\r\n<|endoftext|>"} {"text":"<commit_before>#include \"AudioData.h\"\n\n#include \"Messages\/AudioData.pb.h\"\n#include <google\/protobuf\/io\/zero_copy_stream_impl.h>\n\n#include <algorithm>\n\nusing namespace naoth;\n\nAudioData::AudioData():\n sampleRate(8000),\n numChannels(2),\n timestamp(0)\n{\n \n}\n\nvoid AudioData::print(std::ostream& stream) const\n{\n stream << \"sampleRate: \" << sampleRate << std::endl;\n stream << \"numChannels: \" << numChannels << std::endl;\n stream << \"Number of Samples: \" << samples.size() << std::endl;\n stream << \"timestamp: \" << timestamp << std::endl;\n}\n\nAudioData::~AudioData()\n{\n}\n\nvoid Serializer<AudioData>::serialize(const AudioData& representation, std::ostream& stream)\n{\n \/\/ the data has to be converted to a YUV (1 byte for each) array. no interlacing\n naothmessages::AudioData msg;\n\n msg.set_samplerate(representation.sampleRate);\n msg.set_numchannels(representation.numChannels);\n msg.set_samplesize(sizeof(short));\n msg.set_timestamp(representation.timestamp);\n msg.set_samples((unsigned char*)representation.samples.data(), representation.samples.size()*sizeof(short));\n google::protobuf::io::OstreamOutputStream buf(&stream);\n msg.SerializeToZeroCopyStream(&buf);\n}\n\nvoid Serializer<AudioData>::deserialize(std::istream& stream, AudioData& representation)\n{\n naothmessages::AudioData msg;\n\n google::protobuf::io::IstreamInputStream buf(&stream);\n msg.ParseFromZeroCopyStream(&buf);\n\n representation.sampleRate = msg.samplerate();\n representation.numChannels = msg.numchannels();\n representation.timestamp = msg.timestamp();\n\n assert(msg.samplesize() == sizeof(short));\n representation.samples.resize(msg.samples().size() \/ sizeof(short));\n std::copy_n(msg.samples().data(), msg.samples().size(), (unsigned char*)representation.samples.data());\n}<commit_msg>small cleanup use fixed size type for samples<commit_after>#include \"AudioData.h\"\n\n#include \"Messages\/AudioData.pb.h\"\n#include <google\/protobuf\/io\/zero_copy_stream_impl.h>\n\n#include <algorithm>\n\nusing namespace naoth;\n\nAudioData::AudioData():\n sampleRate(8000),\n numChannels(2),\n timestamp(0)\n{ \n}\n\nvoid AudioData::print(std::ostream& stream) const\n{\n stream << \"sampleRate: \" << sampleRate << std::endl;\n stream << \"numChannels: \" << numChannels << std::endl;\n stream << \"Number of Samples: \" << samples.size() << std::endl;\n stream << \"timestamp: \" << timestamp << std::endl;\n}\n\nvoid Serializer<AudioData>::serialize(const AudioData& representation, std::ostream& stream)\n{\n \/\/ the data has to be converted to a YUV (1 byte for each) array. no interlacing\n naothmessages::AudioData msg;\n\n msg.set_samplerate(representation.sampleRate);\n msg.set_numchannels(representation.numChannels);\n msg.set_samplesize(sizeof(short));\n msg.set_timestamp(representation.timestamp);\n msg.set_samples((unsigned char*)representation.samples.data(), representation.samples.size()*sizeof(short));\n google::protobuf::io::OstreamOutputStream buf(&stream);\n msg.SerializeToZeroCopyStream(&buf);\n}\n\nvoid Serializer<AudioData>::deserialize(std::istream& stream, AudioData& representation)\n{\n naothmessages::AudioData msg;\n\n google::protobuf::io::IstreamInputStream buf(&stream);\n msg.ParseFromZeroCopyStream(&buf);\n\n representation.sampleRate = msg.samplerate();\n representation.numChannels = msg.numchannels();\n representation.timestamp = msg.timestamp();\n\n assert(msg.samplesize() == sizeof(uint16_t));\n representation.samples.resize(msg.samples().size() \/ sizeof(uint16_t));\n std::copy_n(msg.samples().data(), msg.samples().size(), (unsigned char*)representation.samples.data());\n}<|endoftext|>"} {"text":"<commit_before>#include \"dreal\/solver\/assertion_filter.h\"\n\n#include <cmath>\n\n#include \"dreal\/util\/box.h\"\n#include \"dreal\/util\/exception.h\"\n\nnamespace dreal {\nnamespace {\n\nusing std::nextafter;\n\n\/\/ Constrains the @p box with ` box[var].lb() == v`.\nFilterAssertionResult UpdateBoundsViaEquality(const Variable& var,\n const double v, Box* const box) {\n Box::Interval& intv{(*box)[var]};\n if (intv.lb() == intv.ub() && intv.lb() == v) {\n return FilterAssertionResult::FilteredWithoutChange;\n }\n if (intv.contains(v)) {\n intv = v;\n } else {\n box->set_empty();\n }\n return FilterAssertionResult::FilteredWithChange;\n}\n\n\/\/ Constrains the @p box with ` box[var].lb() >= v`.\nFilterAssertionResult UpdateLowerBound(const Variable& var, const double v,\n Box* const box) {\n Box::Interval& iv{(*box)[var]};\n if (v <= iv.lb()) {\n return FilterAssertionResult::FilteredWithoutChange;\n }\n if (v <= iv.ub()) {\n iv = Box::Interval(v, iv.ub());\n } else {\n box->set_empty();\n }\n return FilterAssertionResult::FilteredWithChange;\n}\n\n\/\/ Constrains the @p box with `box[var].lb() > v`. It turns the strict\n\/\/ inequality into a non-strict one, `box[var].lb() >= v + ε` where `v\n\/\/ + ε` is the smallest representable floating-point number bigger than\n\/\/ `v`.\nFilterAssertionResult UpdateStrictLowerBound(const Variable& var,\n const double v, Box* const box) {\n return UpdateLowerBound(var, nextafter(v, DBL_MAX), box);\n}\n\n\/\/ Constrains the @p box with ` box[var].lb() <= v`.\nFilterAssertionResult UpdateUpperBound(const Variable& var, const double v,\n Box* const box) {\n Box::Interval& iv{(*box)[var]};\n if (v >= iv.ub()) {\n return FilterAssertionResult::FilteredWithoutChange;\n }\n if (v >= iv.lb()) {\n iv = Box::Interval(iv.lb(), v);\n } else {\n box->set_empty();\n }\n return FilterAssertionResult::FilteredWithChange;\n}\n\n\/\/ Constrains the @p box with `box[var].lb() < v`. It turns the strict\n\/\/ inequality into a non-strict one, `box[var].lb() <= v - ε` where `v\n\/\/ - ε` is the largest representable floating-point number smaller\n\/\/ than `v`.\nFilterAssertionResult UpdateStrictUpperBound(const Variable& var,\n const double v, Box* const box) {\n return UpdateUpperBound(var, nextafter(v, DBL_MIN), box);\n}\n\nclass AssertionFilter {\n public:\n FilterAssertionResult Process(const Formula& f, Box* const box) const {\n return Visit(f, box, true);\n }\n\n public:\n FilterAssertionResult Visit(const Formula& f, Box* const box,\n const bool polarity) const {\n return VisitFormula<FilterAssertionResult>(this, f, box, polarity);\n }\n FilterAssertionResult VisitFalse(const Formula&, Box* const,\n const bool) const {\n return FilterAssertionResult::NotFiltered;\n }\n FilterAssertionResult VisitTrue(const Formula&, Box* const,\n const bool) const {\n return FilterAssertionResult::NotFiltered;\n }\n FilterAssertionResult VisitVariable(const Formula&, Box* const,\n const bool) const {\n return FilterAssertionResult::NotFiltered;\n }\n FilterAssertionResult VisitEqualTo(const Formula& f, Box* const box,\n const bool polarity) const {\n if (!polarity) {\n return FilterAssertionResult::NotFiltered;\n }\n const Expression& lhs{get_lhs_expression(f)};\n const Expression& rhs{get_rhs_expression(f)};\n if (is_variable(lhs) && is_constant(rhs)) {\n \/\/ var = v\n const Variable& var{get_variable(lhs)};\n const double v{get_constant_value(rhs)};\n return UpdateBoundsViaEquality(var, v, box);\n }\n if (is_constant(lhs) && is_variable(rhs)) {\n \/\/ v = var\n const double v{get_constant_value(lhs)};\n const Variable& var{get_variable(rhs)};\n return UpdateBoundsViaEquality(var, v, box);\n }\n return FilterAssertionResult::NotFiltered;\n }\n FilterAssertionResult VisitNotEqualTo(const Formula& f, Box* const box,\n const bool polarity) const {\n \/\/ Because (x != y) is !(x == y).\n return VisitEqualTo(f, box, !polarity);\n }\n FilterAssertionResult VisitGreaterThan(const Formula& f, Box* const box,\n const bool polarity) const {\n const Expression& lhs{get_lhs_expression(f)};\n const Expression& rhs{get_rhs_expression(f)};\n if (is_variable(lhs) && is_constant(rhs)) {\n const Variable& var{get_variable(lhs)};\n const double v{get_constant_value(rhs)};\n if (polarity) {\n \/\/ var > v\n return UpdateStrictLowerBound(var, v, box);\n } else {\n \/\/ var <= v\n return UpdateUpperBound(var, v, box);\n }\n }\n if (is_constant(lhs) && is_variable(rhs)) {\n const double v{get_constant_value(lhs)};\n const Variable& var{get_variable(rhs)};\n if (polarity) {\n \/\/ v > var\n return UpdateStrictUpperBound(var, v, box);\n } else {\n \/\/ v <= var\n return UpdateLowerBound(var, v, box);\n }\n }\n return FilterAssertionResult::NotFiltered;\n }\n FilterAssertionResult VisitGreaterThanOrEqualTo(const Formula& f,\n Box* const box,\n const bool polarity) const {\n const Expression& lhs{get_lhs_expression(f)};\n const Expression& rhs{get_rhs_expression(f)};\n if (is_variable(lhs) && is_constant(rhs)) {\n const Variable& var{get_variable(lhs)};\n const double v{get_constant_value(rhs)};\n if (polarity) {\n \/\/ var >= v\n return UpdateLowerBound(var, v, box);\n } else {\n \/\/ var < v\n return UpdateStrictUpperBound(var, v, box);\n }\n }\n if (is_constant(lhs) && is_variable(rhs)) {\n const double v{get_constant_value(lhs)};\n const Variable& var{get_variable(rhs)};\n if (polarity) {\n \/\/ v >= var\n return UpdateUpperBound(var, v, box);\n } else {\n \/\/ v < var\n return UpdateStrictLowerBound(var, v, box);\n }\n }\n return FilterAssertionResult::NotFiltered;\n }\n FilterAssertionResult VisitLessThan(const Formula& f, Box* const box,\n const bool polarity) const {\n \/\/ Because x < y is !(x >= y).\n return VisitGreaterThanOrEqualTo(f, box, !polarity);\n }\n FilterAssertionResult VisitLessThanOrEqualTo(const Formula& f, Box* const box,\n const bool polarity) const {\n \/\/ Because x <= y is !(x > y).\n return VisitGreaterThan(f, box, !polarity);\n }\n FilterAssertionResult VisitConjunction(const Formula&, Box* const,\n const bool) const {\n DREAL_UNREACHABLE();\n }\n FilterAssertionResult VisitDisjunction(const Formula&, Box* const,\n const bool) const {\n DREAL_UNREACHABLE();\n }\n FilterAssertionResult VisitNegation(const Formula& f, Box* const box,\n const bool polarity) const {\n return Visit(get_operand(f), box, !polarity);\n }\n FilterAssertionResult VisitForall(const Formula&, Box* const,\n const bool) const {\n return FilterAssertionResult::NotFiltered;\n }\n\n \/\/ Makes VisitFormula a friend of this class so that it can use private\n \/\/ operator()s.\n friend FilterAssertionResult\n drake::symbolic::VisitFormula<FilterAssertionResult>(AssertionFilter*,\n const Formula&,\n dreal::Box* const&,\n const bool&);\n};\n} \/\/ namespace\n\nFilterAssertionResult FilterAssertion(const Formula& assertion,\n Box* const box) {\n return AssertionFilter{}.Process(assertion, box);\n}\n} \/\/ namespace dreal\n<commit_msg>refactor(solver\/assertion_filter.cc): Rename variables \/ Add doc<commit_after>#include \"dreal\/solver\/assertion_filter.h\"\n\n#include <cmath>\n\n#include \"dreal\/util\/box.h\"\n#include \"dreal\/util\/exception.h\"\n\nnamespace dreal {\nnamespace {\n\nusing std::nextafter;\n\n\/\/ Constrains the @p box with ` box[var].lb() == v`.\nFilterAssertionResult UpdateBoundsViaEquality(const Variable& var,\n const double v, Box* const box) {\n Box::Interval& intv{(*box)[var]};\n const double lb{intv.lb()};\n const double ub{intv.ub()};\n if (lb == ub && lb == v) {\n return FilterAssertionResult::FilteredWithoutChange;\n }\n if (intv.contains(v)) {\n intv = v;\n } else {\n box->set_empty();\n }\n return FilterAssertionResult::FilteredWithChange;\n}\n\n\/\/ Constrains the @p box with ` box[var].lb() >= v`.\nFilterAssertionResult UpdateLowerBound(const Variable& var, const double new_lb,\n Box* const box) {\n Box::Interval& intv{(*box)[var]};\n const double lb{intv.lb()};\n const double ub{intv.ub()};\n if (new_lb <= lb) {\n return FilterAssertionResult::FilteredWithoutChange;\n }\n if (new_lb <= ub) {\n intv = Box::Interval(new_lb, ub);\n } else {\n box->set_empty();\n }\n return FilterAssertionResult::FilteredWithChange;\n}\n\n\/\/ Constrains the @p box with `box[var].lb() > v`. It turns the strict\n\/\/ inequality into a non-strict one, `box[var].lb() >= v + ε` where `v\n\/\/ + ε` is the smallest representable floating-point number bigger than\n\/\/ `v`.\nFilterAssertionResult UpdateStrictLowerBound(const Variable& var,\n const double lb, Box* const box) {\n return UpdateLowerBound(var, nextafter(lb, DBL_MAX), box);\n}\n\n\/\/ Constrains the @p box with ` box[var].ub() <= v`.\nFilterAssertionResult UpdateUpperBound(const Variable& var, const double new_ub,\n Box* const box) {\n Box::Interval& intv{(*box)[var]};\n const double lb{intv.lb()};\n const double ub{intv.ub()};\n if (new_ub >= ub) {\n return FilterAssertionResult::FilteredWithoutChange;\n }\n if (new_ub >= lb) {\n intv = Box::Interval(lb, new_ub);\n } else {\n box->set_empty();\n }\n return FilterAssertionResult::FilteredWithChange;\n}\n\n\/\/ Constrains the @p box with `box[var].lb() < v`. It turns the strict\n\/\/ inequality into a non-strict one, `box[var].lb() <= v - ε` where `v\n\/\/ - ε` is the largest representable floating-point number smaller\n\/\/ than `v`.\nFilterAssertionResult UpdateStrictUpperBound(const Variable& var,\n const double ub, Box* const box) {\n return UpdateUpperBound(var, nextafter(ub, DBL_MIN), box);\n}\n\nclass AssertionFilter {\n public:\n FilterAssertionResult Process(const Formula& f, Box* const box) const {\n return Visit(f, box, true);\n }\n\n public:\n FilterAssertionResult Visit(const Formula& f, Box* const box,\n const bool polarity) const {\n return VisitFormula<FilterAssertionResult>(this, f, box, polarity);\n }\n FilterAssertionResult VisitFalse(const Formula&, Box* const,\n const bool) const {\n return FilterAssertionResult::NotFiltered;\n }\n FilterAssertionResult VisitTrue(const Formula&, Box* const,\n const bool) const {\n return FilterAssertionResult::NotFiltered;\n }\n FilterAssertionResult VisitVariable(const Formula&, Box* const,\n const bool) const {\n return FilterAssertionResult::NotFiltered;\n }\n FilterAssertionResult VisitEqualTo(const Formula& f, Box* const box,\n const bool polarity) const {\n if (!polarity) {\n return FilterAssertionResult::NotFiltered;\n }\n const Expression& lhs{get_lhs_expression(f)};\n const Expression& rhs{get_rhs_expression(f)};\n if (is_variable(lhs) && is_constant(rhs)) {\n \/\/ var = v\n const Variable& var{get_variable(lhs)};\n const double v{get_constant_value(rhs)};\n return UpdateBoundsViaEquality(var, v, box);\n }\n if (is_constant(lhs) && is_variable(rhs)) {\n \/\/ v = var\n const double v{get_constant_value(lhs)};\n const Variable& var{get_variable(rhs)};\n return UpdateBoundsViaEquality(var, v, box);\n }\n return FilterAssertionResult::NotFiltered;\n }\n FilterAssertionResult VisitNotEqualTo(const Formula& f, Box* const box,\n const bool polarity) const {\n \/\/ Because (x != y) is !(x == y).\n return VisitEqualTo(f, box, !polarity);\n }\n FilterAssertionResult VisitGreaterThan(const Formula& f, Box* const box,\n const bool polarity) const {\n const Expression& lhs{get_lhs_expression(f)};\n const Expression& rhs{get_rhs_expression(f)};\n if (is_variable(lhs) && is_constant(rhs)) {\n const Variable& var{get_variable(lhs)};\n const double v{get_constant_value(rhs)};\n if (polarity) {\n \/\/ var > v\n return UpdateStrictLowerBound(var, v, box);\n } else {\n \/\/ !(var > v) => (var <= v)\n return UpdateUpperBound(var, v, box);\n }\n }\n if (is_constant(lhs) && is_variable(rhs)) {\n const double v{get_constant_value(lhs)};\n const Variable& var{get_variable(rhs)};\n if (polarity) {\n \/\/ v > var\n return UpdateStrictUpperBound(var, v, box);\n } else {\n \/\/ !(v > var) => (v <= var)\n return UpdateLowerBound(var, v, box);\n }\n }\n return FilterAssertionResult::NotFiltered;\n }\n FilterAssertionResult VisitGreaterThanOrEqualTo(const Formula& f,\n Box* const box,\n const bool polarity) const {\n const Expression& lhs{get_lhs_expression(f)};\n const Expression& rhs{get_rhs_expression(f)};\n if (is_variable(lhs) && is_constant(rhs)) {\n const Variable& var{get_variable(lhs)};\n const double v{get_constant_value(rhs)};\n if (polarity) {\n \/\/ var >= v\n return UpdateLowerBound(var, v, box);\n } else {\n \/\/ !(var >= v) => (var < v)\n return UpdateStrictUpperBound(var, v, box);\n }\n }\n if (is_constant(lhs) && is_variable(rhs)) {\n const double v{get_constant_value(lhs)};\n const Variable& var{get_variable(rhs)};\n if (polarity) {\n \/\/ v >= var\n return UpdateUpperBound(var, v, box);\n } else {\n \/\/ !(v >= var) => (v < var)\n return UpdateStrictLowerBound(var, v, box);\n }\n }\n return FilterAssertionResult::NotFiltered;\n }\n FilterAssertionResult VisitLessThan(const Formula& f, Box* const box,\n const bool polarity) const {\n \/\/ Because x < y is !(x >= y).\n return VisitGreaterThanOrEqualTo(f, box, !polarity);\n }\n FilterAssertionResult VisitLessThanOrEqualTo(const Formula& f, Box* const box,\n const bool polarity) const {\n \/\/ Because x <= y is !(x > y).\n return VisitGreaterThan(f, box, !polarity);\n }\n FilterAssertionResult VisitConjunction(const Formula&, Box* const,\n const bool) const {\n DREAL_UNREACHABLE();\n }\n FilterAssertionResult VisitDisjunction(const Formula&, Box* const,\n const bool) const {\n DREAL_UNREACHABLE();\n }\n FilterAssertionResult VisitNegation(const Formula& f, Box* const box,\n const bool polarity) const {\n return Visit(get_operand(f), box, !polarity);\n }\n FilterAssertionResult VisitForall(const Formula&, Box* const,\n const bool) const {\n return FilterAssertionResult::NotFiltered;\n }\n\n \/\/ Makes VisitFormula a friend of this class so that it can use private\n \/\/ operator()s.\n friend FilterAssertionResult\n drake::symbolic::VisitFormula<FilterAssertionResult>(AssertionFilter*,\n const Formula&,\n dreal::Box* const&,\n const bool&);\n};\n} \/\/ namespace\n\nFilterAssertionResult FilterAssertion(const Formula& assertion,\n Box* const box) {\n return AssertionFilter{}.Process(assertion, box);\n}\n} \/\/ namespace dreal\n<|endoftext|>"} {"text":"<commit_before>\/***\n * Infiniband maximum achievable bandwidth test.\n *\/\n\n#include <stdio.h>\n\n#include <vector>\n#include <iostream>\n#include <cmath>\n\n#include \"Maxfiles.h\"\n#include \"MaxSLiCInterface.h\"\n\nusing namespace std;\n\nconst double GB = pow(1024, 3) * 8;\nconst double MB = pow(1024, 2) * 8;\n\n\n\/** Maxmimum possible bandwidth at given clock speed*\/\nvoid printMaxInfinbandBandwidth() {\n double clock = 200.0;\n double inBitsPerCycle = 32 * 2;\n double outBitsPerCycle = 32;\n double max = (inBitsPerCycle + outBitsPerCycle) * clock * pow10(6) \/ GB;\n cout << \"Max possible bandwidth \" << max << \" GB\/s\" << endl;\n}\n\n\ndouble measuredInifibandBandwidth(long sizeInBits, double runtimeS) {\n return 3 * size \/ MB \/ runtimeS;\n}\n\n\nint main(void)\n{\n\n const long inSize = 2 * 384 * 1E6;\n\n std::vector<int> a(inSize), b(inSize), expected(inSize), out(inSize, 0);\n\n for(long i = 0; i < inSize; ++i) {\n a[i] = i + 1;\n b[i] = i - 1;\n expected[i] = 2 * i;\n }\n\n printMaxInfinbandBandwidth();\n cout << \"Running on DFE.\" << endl;\n struct timeval tv1, tv2;\n gettimeofday(&tv1, NULL);\n InfinibandBenchmark(inSize, &a[0], &b[0], &out[0]);\n gettimeofday(&tv2, NULL);\n\n cout << \"Data size \" << inSize * sizeof(int) \/ GB << \" GBs\" << endl;\n double runtimeS = ((tv2.tv_sec-tv1.tv_sec) * (double)1E6 +\n (tv2.tv_usec-tv1.tv_usec)) \/ (double)1E6;\n cout << \"Runtime (s) \" << runtimeS << endl;\n cout << \"Bandwidth \" << measuredInifibandBandwidth(inSize * sizeof(int), runtimeS) << \" MB\/s \" << endl;\n\n for (int i = 0; i < inSize; i++)\n if (out[i] != expected[i]) {\n printf(\"Output from DFE did not match CPU: %d : %d != %d\\n\",\n i, out[i], expected[i]);\n return 1;\n }\n\n std::cout << \"Test passed!\" << std::endl;\n return 0;\n}\n<commit_msg>Change some UoM.<commit_after>\/***\n * Infiniband maximum achievable bandwidth test.\n *\/\n\n#include <stdio.h>\n\n#include <vector>\n#include <iostream>\n#include <cmath>\n\n#include \"Maxfiles.h\"\n#include \"MaxSLiCInterface.h\"\n\nusing namespace std;\n\n\/\/ All measurements should be in bytes\nconst double GB = pow(1024, 3);\nconst double MB = pow(1024, 2);\n\n\n\/** Maxmimum possible bandwidth at given clock speed*\/\nvoid printMaxInfinbandBandwidth() {\n double clock = 150.0;\n double inBytesPerCycle = sizeof(int) * 2;\n double outBytesPerCycle = sizeof(int);\n double max = (inBytesPerCycle + outBytesPerCycle) * clock * 1E6 \/ GB;\n cout << \"Max possible bandwidth (@150 MHz Stream Clock): \" << max << \" GB\/s\" << endl;\n}\n\n\ndouble measuredInifibandBandwidth(long sizeInBytes, double runtimeS) {\n return sizeInBytes \/ MB \/ runtimeS;\n}\n\n\nint main(void)\n{\n\n const long inSize = 2 * 384 * 1E6;\n const long dataSizeBytes = 3 * inSize * sizeof(int);\n\n std::vector<int> a(inSize), b(inSize), expected(inSize), out(inSize, 0);\n\n for(long i = 0; i < inSize; ++i) {\n a[i] = i + 1;\n b[i] = i - 1;\n expected[i] = 2 * i;\n }\n\n printMaxInfinbandBandwidth();\n cout << \"Running on DFE. Data size: \" << dataSizeBytes \/ GB << \" GB\" << endl;\n\n struct timeval tv1, tv2;\n gettimeofday(&tv1, NULL);\n InfinibandBenchmark(inSize, &a[0], &b[0], &out[0]);\n gettimeofday(&tv2, NULL);\n\n double runtimeS = ((tv2.tv_sec-tv1.tv_sec) * (double)1E6 +\n (tv2.tv_usec-tv1.tv_usec)) \/ (double)1E6;\n\n cout << \"Runtime (s) \" << runtimeS << endl;\n cout << \"Bandwidth \" << measuredInifibandBandwidth(dataSizeBytes, runtimeS);\n cout << \" MB\/s \" << endl;\n\n for (int i = 0; i < inSize; i++)\n if (out[i] != expected[i]) {\n printf(\"Output from DFE did not match CPU: %d : %d != %d\\n\",\n i, out[i], expected[i]);\n return 1;\n }\n\n std::cout << \"Test passed!\" << std::endl;\n return 0;\n}\n<|endoftext|>"} {"text":"<commit_before>#include \"GHIElectronics_TinyCLR_Devices_Storage.h\"\n#include \"..\/GHIElectronics_TinyCLR_InteropUtil.h\"\n\nTinyCLR_Result Interop_GHIElectronics_TinyCLR_Devices_Storage_GHIElectronics_TinyCLR_Devices_Storage_Provider_StorageControllerApiWrapper::get_Descriptor___GHIElectronicsTinyCLRDevicesStorageStorageDescriptor(const TinyCLR_Interop_MethodData md) {\n auto api = reinterpret_cast<const TinyCLR_Storage_Controller*>(TinyCLR_Interop_GetApi(md, FIELD___impl___I));\n\n const TinyCLR_Storage_Descriptor* descriptor;\n\n auto result = api->GetDescriptor(api, descriptor);\n\n TinyCLR_Interop_ClrValue obj, ret;\n TinyCLR_Interop_ClrTypeId type;\n\n md.InteropManager->FindType(md.InteropManager, \"GHIElectronics.TinyCLR.Devices.Storage\", \"GHIElectronics.TinyCLR.Devices.Storage\", \"StorageDescriptor\", type);\n\n md.InteropManager->CreateObject(md.InteropManager, md.Stack, type, obj);\n\n TinyCLR_Interop_ClrValue canReadDirectField, canWriteDirectField, canExecuteDirectField, eraseBeforeWriteField, removableField, regionsContiguousField, regionsEqualSizedField, regionCountField, regionAddressesField, regionSizesField;\n\n md.InteropManager->GetField(md.InteropManager, obj.Object, Interop_GHIElectronics_TinyCLR_Devices_Storage_GHIElectronics_TinyCLR_Devices_Storage_StorageDescriptor::FIELD___CanReadDirect__BackingField___BOOLEAN, canReadDirectField);\n md.InteropManager->GetField(md.InteropManager, obj.Object, Interop_GHIElectronics_TinyCLR_Devices_Storage_GHIElectronics_TinyCLR_Devices_Storage_StorageDescriptor::FIELD___CanWriteDirect__BackingField___BOOLEAN, canWriteDirectField);\n md.InteropManager->GetField(md.InteropManager, obj.Object, Interop_GHIElectronics_TinyCLR_Devices_Storage_GHIElectronics_TinyCLR_Devices_Storage_StorageDescriptor::FIELD___CanExecuteDirect__BackingField___BOOLEAN, canExecuteDirectField);\n md.InteropManager->GetField(md.InteropManager, obj.Object, Interop_GHIElectronics_TinyCLR_Devices_Storage_GHIElectronics_TinyCLR_Devices_Storage_StorageDescriptor::FIELD___EraseBeforeWrite__BackingField___BOOLEAN, eraseBeforeWriteField);\n md.InteropManager->GetField(md.InteropManager, obj.Object, Interop_GHIElectronics_TinyCLR_Devices_Storage_GHIElectronics_TinyCLR_Devices_Storage_StorageDescriptor::FIELD___Removable__BackingField___BOOLEAN, removableField);\n md.InteropManager->GetField(md.InteropManager, obj.Object, Interop_GHIElectronics_TinyCLR_Devices_Storage_GHIElectronics_TinyCLR_Devices_Storage_StorageDescriptor::FIELD___RegionsContiguous__BackingField___BOOLEAN, regionsContiguousField);\n md.InteropManager->GetField(md.InteropManager, obj.Object, Interop_GHIElectronics_TinyCLR_Devices_Storage_GHIElectronics_TinyCLR_Devices_Storage_StorageDescriptor::FIELD___RegionsEqualSized__BackingField___BOOLEAN, regionsEqualSizedField);\n md.InteropManager->GetField(md.InteropManager, obj.Object, Interop_GHIElectronics_TinyCLR_Devices_Storage_GHIElectronics_TinyCLR_Devices_Storage_StorageDescriptor::FIELD___RegionCount__BackingField___I4, regionCountField);\n md.InteropManager->GetField(md.InteropManager, obj.Object, Interop_GHIElectronics_TinyCLR_Devices_Storage_GHIElectronics_TinyCLR_Devices_Storage_StorageDescriptor::FIELD___RegionAddresses__BackingField___SZARRAY_I8, regionAddressesField);\n md.InteropManager->GetField(md.InteropManager, obj.Object, Interop_GHIElectronics_TinyCLR_Devices_Storage_GHIElectronics_TinyCLR_Devices_Storage_StorageDescriptor::FIELD___RegionSizes__BackingField___SZARRAY_I4, regionSizesField);\n\n if (descriptor != nullptr) {\n canReadDirectField.Data.Numeric->Boolean = descriptor->CanReadDirect;\n canWriteDirectField.Data.Numeric->Boolean = descriptor->CanWriteDirect;\n canExecuteDirectField.Data.Numeric->Boolean = descriptor->CanWriteDirect;\n eraseBeforeWriteField.Data.Numeric->Boolean = descriptor->EraseBeforeWrite;\n removableField.Data.Numeric->Boolean = descriptor->Removable;\n regionsContiguousField.Data.Numeric->Boolean = descriptor->RegionsContiguous;\n regionsEqualSizedField.Data.Numeric->Boolean = descriptor->RegionsEqualSized;\n regionCountField.Data.Numeric->I4 = descriptor->RegionCount;\n\n md.InteropManager->FindType(md.InteropManager, \"mscorlib\", \"System\", \"Int64\", type);\n md.InteropManager->CreateArray(md.InteropManager, descriptor->RegionCount, type, regionAddressesField);\n\n md.InteropManager->FindType(md.InteropManager, \"mscorlib\", \"System\", \"Int32\", type);\n md.InteropManager->CreateArray(md.InteropManager, descriptor->RegionCount, type, regionSizesField);\n\n auto regionAddresses = reinterpret_cast<int64_t*>(regionAddressesField.Data.SzArray.Data);\n auto regionSizes = reinterpret_cast<int32_t*>(regionSizesField.Data.SzArray.Data);\n\n for (auto i = 0; i < descriptor->RegionCount; i++) {\n regionAddresses[i] = descriptor->RegionAddresses[i];\n regionSizes[i] = descriptor->RegionSizes[i];\n }\n\n md.InteropManager->GetReturn(md.InteropManager, md.Stack, ret);\n\n md.InteropManager->AssignObjectReference(md.InteropManager, ret, obj.Object);\n }\n\n return TinyCLR_Result::Success;\n}\n\nTinyCLR_Result Interop_GHIElectronics_TinyCLR_Devices_Storage_GHIElectronics_TinyCLR_Devices_Storage_Provider_StorageControllerApiWrapper::Open___VOID(const TinyCLR_Interop_MethodData md) {\n auto api = reinterpret_cast<const TinyCLR_Storage_Controller*>(TinyCLR_Interop_GetApi(md, FIELD___impl___I));\n\n return api->Open(api);\n}\n\nTinyCLR_Result Interop_GHIElectronics_TinyCLR_Devices_Storage_GHIElectronics_TinyCLR_Devices_Storage_Provider_StorageControllerApiWrapper::Close___VOID(const TinyCLR_Interop_MethodData md) {\n auto api = reinterpret_cast<const TinyCLR_Storage_Controller*>(TinyCLR_Interop_GetApi(md, FIELD___impl___I));\n\n return api->Close(api);\n}\n\nTinyCLR_Result Interop_GHIElectronics_TinyCLR_Devices_Storage_GHIElectronics_TinyCLR_Devices_Storage_Provider_StorageControllerApiWrapper::Read___I4__I8__I4__SZARRAY_U1__I4__mscorlibSystemTimeSpan(const TinyCLR_Interop_MethodData md) {\n auto api = reinterpret_cast<const TinyCLR_Storage_Controller*>(TinyCLR_Interop_GetApi(md, FIELD___impl___I));\n\n TinyCLR_Interop_ClrValue args[5];\n\n for (auto i = 0; i < sizeof(args) \/ sizeof(TinyCLR_Interop_ClrValue); i++) {\n md.InteropManager->GetArgument(md.InteropManager, md.Stack, i, args[i]);\n }\n\n auto sector = static_cast<uint64_t>(args[0].Data.Numeric->I8);\n auto count = static_cast<size_t>(args[1].Data.Numeric->I4);\n auto buffer = reinterpret_cast<uint8_t*>(args[2].Data.SzArray.Data);\n auto offset = args[3].Data.Numeric->I8;\n auto timeout = args[4].Data.Numeric->I4;\n\n buffer += offset;\n\n auto result = api->Read(api, sector, count, buffer, timeout);\n\n TinyCLR_Interop_ClrValue ret;\n\n md.InteropManager->GetReturn(md.InteropManager, md.Stack, ret);\n\n ret.Data.Numeric->I4 = count;\n\n return result;\n}\n\nTinyCLR_Result Interop_GHIElectronics_TinyCLR_Devices_Storage_GHIElectronics_TinyCLR_Devices_Storage_Provider_StorageControllerApiWrapper::Write___I4__I8__I4__SZARRAY_U1__I4__mscorlibSystemTimeSpan(const TinyCLR_Interop_MethodData md) {\n auto api = reinterpret_cast<const TinyCLR_Storage_Controller*>(TinyCLR_Interop_GetApi(md, FIELD___impl___I));\n\n TinyCLR_Interop_ClrValue args[5];\n\n for (auto i = 0; i < sizeof(args) \/ sizeof(TinyCLR_Interop_ClrValue); i++) {\n md.InteropManager->GetArgument(md.InteropManager, md.Stack, i, args[i]);\n }\n\n auto sector = static_cast<uint64_t>(args[0].Data.Numeric->I8);\n auto count = static_cast<size_t>(args[1].Data.Numeric->I4);\n auto buffer = reinterpret_cast<uint8_t*>(args[2].Data.SzArray.Data);\n auto offset = args[3].Data.Numeric->I4;\n auto timeout = args[4].Data.Numeric->I8;\n\n buffer += offset;\n\n auto result = api->Write(api, sector, count, buffer, timeout);\n\n TinyCLR_Interop_ClrValue ret;\n\n md.InteropManager->GetReturn(md.InteropManager, md.Stack, ret);\n\n ret.Data.Numeric->I4 = count;\n\n return result;\n}\n\nTinyCLR_Result Interop_GHIElectronics_TinyCLR_Devices_Storage_GHIElectronics_TinyCLR_Devices_Storage_Provider_StorageControllerApiWrapper::Erase___I4__I8__I4__mscorlibSystemTimeSpan(const TinyCLR_Interop_MethodData md) {\n auto api = reinterpret_cast<const TinyCLR_Storage_Controller*>(TinyCLR_Interop_GetApi(md, FIELD___impl___I));\n\n TinyCLR_Interop_ClrValue args[3];\n\n for (auto i = 0; i < sizeof(args) \/ sizeof(TinyCLR_Interop_ClrValue); i++) {\n md.InteropManager->GetArgument(md.InteropManager, md.Stack, i, args[i]);\n }\n\n auto sector = static_cast<uint64_t>(args[0].Data.Numeric->I8);\n auto count = static_cast<size_t>(args[1].Data.Numeric->I4);\n\n auto timeout = args[2].Data.Numeric->I8;\n\n auto result = api->Erase(api, sector, count, timeout);\n\n TinyCLR_Interop_ClrValue ret;\n\n md.InteropManager->GetReturn(md.InteropManager, md.Stack, ret);\n\n ret.Data.Numeric->I4 = count;\n\n return result;\n}\n\nTinyCLR_Result Interop_GHIElectronics_TinyCLR_Devices_Storage_GHIElectronics_TinyCLR_Devices_Storage_Provider_StorageControllerApiWrapper::IsErased___BOOLEAN__I8__I4(const TinyCLR_Interop_MethodData md) {\n auto api = reinterpret_cast<const TinyCLR_Storage_Controller*>(TinyCLR_Interop_GetApi(md, FIELD___impl___I));\n TinyCLR_Interop_ClrValue arg0, arg1, ret;\n\n md.InteropManager->GetArgument(md.InteropManager, md.Stack, 0, arg0);\n md.InteropManager->GetArgument(md.InteropManager, md.Stack, 1, arg1);\n md.InteropManager->GetReturn(md.InteropManager, md.Stack, ret);\n\n size_t count = arg1.Data.Numeric->I4;\n\n return api->IsErased(api, arg0.Data.Numeric->I8, count, ret.Data.Numeric->Boolean);\n}\n\nTinyCLR_Result Interop_GHIElectronics_TinyCLR_Devices_Storage_GHIElectronics_TinyCLR_Devices_Storage_Provider_StorageControllerApiWrapper::Acquire___VOID(const TinyCLR_Interop_MethodData md) {\n auto api = reinterpret_cast<const TinyCLR_Storage_Controller*>(TinyCLR_Interop_GetApi(md, FIELD___impl___I));\n\n return api->Acquire(api);\n}\n\nTinyCLR_Result Interop_GHIElectronics_TinyCLR_Devices_Storage_GHIElectronics_TinyCLR_Devices_Storage_Provider_StorageControllerApiWrapper::Release___VOID(const TinyCLR_Interop_MethodData md) {\n auto api = reinterpret_cast<const TinyCLR_Storage_Controller*>(TinyCLR_Interop_GetApi(md, FIELD___impl___I));\n\n return api->Release(api);\n}\n<commit_msg>Rename. Variable should be address, not sector.<commit_after>#include \"GHIElectronics_TinyCLR_Devices_Storage.h\"\n#include \"..\/GHIElectronics_TinyCLR_InteropUtil.h\"\n\nTinyCLR_Result Interop_GHIElectronics_TinyCLR_Devices_Storage_GHIElectronics_TinyCLR_Devices_Storage_Provider_StorageControllerApiWrapper::get_Descriptor___GHIElectronicsTinyCLRDevicesStorageStorageDescriptor(const TinyCLR_Interop_MethodData md) {\n auto api = reinterpret_cast<const TinyCLR_Storage_Controller*>(TinyCLR_Interop_GetApi(md, FIELD___impl___I));\n\n const TinyCLR_Storage_Descriptor* descriptor;\n\n auto result = api->GetDescriptor(api, descriptor);\n\n TinyCLR_Interop_ClrValue obj, ret;\n TinyCLR_Interop_ClrTypeId type;\n\n md.InteropManager->FindType(md.InteropManager, \"GHIElectronics.TinyCLR.Devices.Storage\", \"GHIElectronics.TinyCLR.Devices.Storage\", \"StorageDescriptor\", type);\n\n md.InteropManager->CreateObject(md.InteropManager, md.Stack, type, obj);\n\n TinyCLR_Interop_ClrValue canReadDirectField, canWriteDirectField, canExecuteDirectField, eraseBeforeWriteField, removableField, regionsContiguousField, regionsEqualSizedField, regionCountField, regionAddressesField, regionSizesField;\n\n md.InteropManager->GetField(md.InteropManager, obj.Object, Interop_GHIElectronics_TinyCLR_Devices_Storage_GHIElectronics_TinyCLR_Devices_Storage_StorageDescriptor::FIELD___CanReadDirect__BackingField___BOOLEAN, canReadDirectField);\n md.InteropManager->GetField(md.InteropManager, obj.Object, Interop_GHIElectronics_TinyCLR_Devices_Storage_GHIElectronics_TinyCLR_Devices_Storage_StorageDescriptor::FIELD___CanWriteDirect__BackingField___BOOLEAN, canWriteDirectField);\n md.InteropManager->GetField(md.InteropManager, obj.Object, Interop_GHIElectronics_TinyCLR_Devices_Storage_GHIElectronics_TinyCLR_Devices_Storage_StorageDescriptor::FIELD___CanExecuteDirect__BackingField___BOOLEAN, canExecuteDirectField);\n md.InteropManager->GetField(md.InteropManager, obj.Object, Interop_GHIElectronics_TinyCLR_Devices_Storage_GHIElectronics_TinyCLR_Devices_Storage_StorageDescriptor::FIELD___EraseBeforeWrite__BackingField___BOOLEAN, eraseBeforeWriteField);\n md.InteropManager->GetField(md.InteropManager, obj.Object, Interop_GHIElectronics_TinyCLR_Devices_Storage_GHIElectronics_TinyCLR_Devices_Storage_StorageDescriptor::FIELD___Removable__BackingField___BOOLEAN, removableField);\n md.InteropManager->GetField(md.InteropManager, obj.Object, Interop_GHIElectronics_TinyCLR_Devices_Storage_GHIElectronics_TinyCLR_Devices_Storage_StorageDescriptor::FIELD___RegionsContiguous__BackingField___BOOLEAN, regionsContiguousField);\n md.InteropManager->GetField(md.InteropManager, obj.Object, Interop_GHIElectronics_TinyCLR_Devices_Storage_GHIElectronics_TinyCLR_Devices_Storage_StorageDescriptor::FIELD___RegionsEqualSized__BackingField___BOOLEAN, regionsEqualSizedField);\n md.InteropManager->GetField(md.InteropManager, obj.Object, Interop_GHIElectronics_TinyCLR_Devices_Storage_GHIElectronics_TinyCLR_Devices_Storage_StorageDescriptor::FIELD___RegionCount__BackingField___I4, regionCountField);\n md.InteropManager->GetField(md.InteropManager, obj.Object, Interop_GHIElectronics_TinyCLR_Devices_Storage_GHIElectronics_TinyCLR_Devices_Storage_StorageDescriptor::FIELD___RegionAddresses__BackingField___SZARRAY_I8, regionAddressesField);\n md.InteropManager->GetField(md.InteropManager, obj.Object, Interop_GHIElectronics_TinyCLR_Devices_Storage_GHIElectronics_TinyCLR_Devices_Storage_StorageDescriptor::FIELD___RegionSizes__BackingField___SZARRAY_I4, regionSizesField);\n\n if (descriptor != nullptr) {\n canReadDirectField.Data.Numeric->Boolean = descriptor->CanReadDirect;\n canWriteDirectField.Data.Numeric->Boolean = descriptor->CanWriteDirect;\n canExecuteDirectField.Data.Numeric->Boolean = descriptor->CanWriteDirect;\n eraseBeforeWriteField.Data.Numeric->Boolean = descriptor->EraseBeforeWrite;\n removableField.Data.Numeric->Boolean = descriptor->Removable;\n regionsContiguousField.Data.Numeric->Boolean = descriptor->RegionsContiguous;\n regionsEqualSizedField.Data.Numeric->Boolean = descriptor->RegionsEqualSized;\n regionCountField.Data.Numeric->I4 = descriptor->RegionCount;\n\n md.InteropManager->FindType(md.InteropManager, \"mscorlib\", \"System\", \"Int64\", type);\n md.InteropManager->CreateArray(md.InteropManager, descriptor->RegionCount, type, regionAddressesField);\n\n md.InteropManager->FindType(md.InteropManager, \"mscorlib\", \"System\", \"Int32\", type);\n md.InteropManager->CreateArray(md.InteropManager, descriptor->RegionCount, type, regionSizesField);\n\n auto regionAddresses = reinterpret_cast<int64_t*>(regionAddressesField.Data.SzArray.Data);\n auto regionSizes = reinterpret_cast<int32_t*>(regionSizesField.Data.SzArray.Data);\n\n for (auto i = 0; i < descriptor->RegionCount; i++) {\n regionAddresses[i] = descriptor->RegionAddresses[i];\n regionSizes[i] = descriptor->RegionSizes[i];\n }\n\n md.InteropManager->GetReturn(md.InteropManager, md.Stack, ret);\n\n md.InteropManager->AssignObjectReference(md.InteropManager, ret, obj.Object);\n }\n\n return TinyCLR_Result::Success;\n}\n\nTinyCLR_Result Interop_GHIElectronics_TinyCLR_Devices_Storage_GHIElectronics_TinyCLR_Devices_Storage_Provider_StorageControllerApiWrapper::Open___VOID(const TinyCLR_Interop_MethodData md) {\n auto api = reinterpret_cast<const TinyCLR_Storage_Controller*>(TinyCLR_Interop_GetApi(md, FIELD___impl___I));\n\n return api->Open(api);\n}\n\nTinyCLR_Result Interop_GHIElectronics_TinyCLR_Devices_Storage_GHIElectronics_TinyCLR_Devices_Storage_Provider_StorageControllerApiWrapper::Close___VOID(const TinyCLR_Interop_MethodData md) {\n auto api = reinterpret_cast<const TinyCLR_Storage_Controller*>(TinyCLR_Interop_GetApi(md, FIELD___impl___I));\n\n return api->Close(api);\n}\n\nTinyCLR_Result Interop_GHIElectronics_TinyCLR_Devices_Storage_GHIElectronics_TinyCLR_Devices_Storage_Provider_StorageControllerApiWrapper::Read___I4__I8__I4__SZARRAY_U1__I4__mscorlibSystemTimeSpan(const TinyCLR_Interop_MethodData md) {\n auto api = reinterpret_cast<const TinyCLR_Storage_Controller*>(TinyCLR_Interop_GetApi(md, FIELD___impl___I));\n\n TinyCLR_Interop_ClrValue args[5];\n\n for (auto i = 0; i < sizeof(args) \/ sizeof(TinyCLR_Interop_ClrValue); i++) {\n md.InteropManager->GetArgument(md.InteropManager, md.Stack, i, args[i]);\n }\n\n auto address = static_cast<uint64_t>(args[0].Data.Numeric->I8);\n auto count = static_cast<size_t>(args[1].Data.Numeric->I4);\n auto buffer = reinterpret_cast<uint8_t*>(args[2].Data.SzArray.Data);\n auto offset = args[3].Data.Numeric->I8;\n auto timeout = args[4].Data.Numeric->I4;\n\n buffer += offset;\n\n auto result = api->Read(api, address, count, buffer, timeout);\n\n TinyCLR_Interop_ClrValue ret;\n\n md.InteropManager->GetReturn(md.InteropManager, md.Stack, ret);\n\n ret.Data.Numeric->I4 = count;\n\n return result;\n}\n\nTinyCLR_Result Interop_GHIElectronics_TinyCLR_Devices_Storage_GHIElectronics_TinyCLR_Devices_Storage_Provider_StorageControllerApiWrapper::Write___I4__I8__I4__SZARRAY_U1__I4__mscorlibSystemTimeSpan(const TinyCLR_Interop_MethodData md) {\n auto api = reinterpret_cast<const TinyCLR_Storage_Controller*>(TinyCLR_Interop_GetApi(md, FIELD___impl___I));\n\n TinyCLR_Interop_ClrValue args[5];\n\n for (auto i = 0; i < sizeof(args) \/ sizeof(TinyCLR_Interop_ClrValue); i++) {\n md.InteropManager->GetArgument(md.InteropManager, md.Stack, i, args[i]);\n }\n\n auto address = static_cast<uint64_t>(args[0].Data.Numeric->I8);\n auto count = static_cast<size_t>(args[1].Data.Numeric->I4);\n auto buffer = reinterpret_cast<uint8_t*>(args[2].Data.SzArray.Data);\n auto offset = args[3].Data.Numeric->I4;\n auto timeout = args[4].Data.Numeric->I8;\n\n buffer += offset;\n\n auto result = api->Write(api, address, count, buffer, timeout);\n\n TinyCLR_Interop_ClrValue ret;\n\n md.InteropManager->GetReturn(md.InteropManager, md.Stack, ret);\n\n ret.Data.Numeric->I4 = count;\n\n return result;\n}\n\nTinyCLR_Result Interop_GHIElectronics_TinyCLR_Devices_Storage_GHIElectronics_TinyCLR_Devices_Storage_Provider_StorageControllerApiWrapper::Erase___I4__I8__I4__mscorlibSystemTimeSpan(const TinyCLR_Interop_MethodData md) {\n auto api = reinterpret_cast<const TinyCLR_Storage_Controller*>(TinyCLR_Interop_GetApi(md, FIELD___impl___I));\n\n TinyCLR_Interop_ClrValue args[3];\n\n for (auto i = 0; i < sizeof(args) \/ sizeof(TinyCLR_Interop_ClrValue); i++) {\n md.InteropManager->GetArgument(md.InteropManager, md.Stack, i, args[i]);\n }\n\n auto address = static_cast<uint64_t>(args[0].Data.Numeric->I8);\n auto count = static_cast<size_t>(args[1].Data.Numeric->I4);\n\n auto timeout = args[2].Data.Numeric->I8;\n\n auto result = api->Erase(api, address, count, timeout);\n\n TinyCLR_Interop_ClrValue ret;\n\n md.InteropManager->GetReturn(md.InteropManager, md.Stack, ret);\n\n ret.Data.Numeric->I4 = count;\n\n return result;\n}\n\nTinyCLR_Result Interop_GHIElectronics_TinyCLR_Devices_Storage_GHIElectronics_TinyCLR_Devices_Storage_Provider_StorageControllerApiWrapper::IsErased___BOOLEAN__I8__I4(const TinyCLR_Interop_MethodData md) {\n auto api = reinterpret_cast<const TinyCLR_Storage_Controller*>(TinyCLR_Interop_GetApi(md, FIELD___impl___I));\n TinyCLR_Interop_ClrValue arg0, arg1, ret;\n\n md.InteropManager->GetArgument(md.InteropManager, md.Stack, 0, arg0);\n md.InteropManager->GetArgument(md.InteropManager, md.Stack, 1, arg1);\n md.InteropManager->GetReturn(md.InteropManager, md.Stack, ret);\n\n size_t count = arg1.Data.Numeric->I4;\n\n return api->IsErased(api, arg0.Data.Numeric->I8, count, ret.Data.Numeric->Boolean);\n}\n\nTinyCLR_Result Interop_GHIElectronics_TinyCLR_Devices_Storage_GHIElectronics_TinyCLR_Devices_Storage_Provider_StorageControllerApiWrapper::Acquire___VOID(const TinyCLR_Interop_MethodData md) {\n auto api = reinterpret_cast<const TinyCLR_Storage_Controller*>(TinyCLR_Interop_GetApi(md, FIELD___impl___I));\n\n return api->Acquire(api);\n}\n\nTinyCLR_Result Interop_GHIElectronics_TinyCLR_Devices_Storage_GHIElectronics_TinyCLR_Devices_Storage_Provider_StorageControllerApiWrapper::Release___VOID(const TinyCLR_Interop_MethodData md) {\n auto api = reinterpret_cast<const TinyCLR_Storage_Controller*>(TinyCLR_Interop_GetApi(md, FIELD___impl___I));\n\n return api->Release(api);\n}\n<|endoftext|>"} {"text":"<commit_before>\/*\n * Copyright (c) 2013-2014 Kajetan Swierk <k0zmo@outlook.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 *\/\n\n#include \"Logic\/NodeType.h\"\n#include \"Logic\/NodeFactory.h\"\n#include \"Kommon\/Utils.h\"\n#include \"Kommon\/StringUtils.h\"\n\n#include <opencv2\/features2d\/features2d.hpp>\n\nusing std::vector;\n\nstatic vector<cv::DMatch> distanceRatioTest(const vector<vector<cv::DMatch>>& knMatches, \n float distanceRatioThreshold)\n{\n vector<cv::DMatch> positiveMatches;\n positiveMatches.reserve(knMatches.size());\n\n for(const auto& knMatch : knMatches)\n {\n if(knMatch.size() != 2)\n continue;\n\n const auto& best = knMatch[0];\n const auto& good = knMatch[1];\n\n if(best.distance <= distanceRatioThreshold * good.distance)\n positiveMatches.push_back(best);\n }\n\n return positiveMatches;\n}\n\nstatic vector<cv::DMatch> symmetryTest(const vector<cv::DMatch>& matches1to2,\n const vector<cv::DMatch>& matches2to1)\n{\n vector<cv::DMatch> bothMatches;\n\n for(const auto& match1to2 : matches1to2)\n {\n for(const auto& match2to1 : matches2to1)\n {\n if(match1to2.queryIdx == match2to1.trainIdx\n && match2to1.queryIdx == match1to2.trainIdx)\n {\n bothMatches.push_back(match1to2);\n break;\n }\n }\n }\n\n return bothMatches;\n}\n\nclass MatcherNodeType : public NodeType\n{\npublic:\n MatcherNodeType()\n : _distanceRatio(0.8f)\n , _symmetryTest(false)\n {\n }\n\n bool setProperty(PropertyID propId, const NodeProperty& newValue) override\n {\n switch(static_cast<pid>(propId))\n {\n case pid::DistanceRatio:\n _distanceRatio = newValue.toFloat();\n return true;\n case pid::SymmetryTest:\n _symmetryTest = newValue.toBool();\n return true;\n }\n\n return false;\n }\n\n NodeProperty property(PropertyID propId) const override\n {\n switch(static_cast<pid>(propId))\n {\n case pid::DistanceRatio: return _distanceRatio;\n case pid::SymmetryTest: return _symmetryTest;\n }\n\n return NodeProperty();\n }\n\n void configuration(NodeConfig& nodeConfig) const override\n {\n static const InputSocketConfig in_config[] = {\n { ENodeFlowDataType::Keypoints, \"keypoints1\", \"Query keypoints\", \"\" },\n { ENodeFlowDataType::Array, \"descriptors1\", \"Query descriptors\", \"\" },\n { ENodeFlowDataType::Keypoints, \"keypoints2\", \"Train keypoints\", \"\" },\n { ENodeFlowDataType::Array, \"descriptors2\", \"Train descriptors\", \"\" },\n { ENodeFlowDataType::Invalid, \"\", \"\", \"\" }\n };\n static const OutputSocketConfig out_config[] = {\n { ENodeFlowDataType::Matches, \"matches\", \"Matches\", \"\" },\n { ENodeFlowDataType::Invalid, \"\", \"\", \"\" }\n };\n static const PropertyConfig prop_config[] = {\n { EPropertyType::Double, \"Distance ratio\", \"min:0.0, max:1.0, step:0.1, decimals:2\" },\n { EPropertyType::Boolean, \"Symmetry test\", \"\" },\n { EPropertyType::Unknown, \"\", \"\" }\n };\n\n nodeConfig.description = \"Finds best matches between query and train descriptors using nearest neighbour distance ratio and\/or symmetry test.\";\n nodeConfig.pInputSockets = in_config;\n nodeConfig.pOutputSockets = out_config;\n nodeConfig.pProperties = prop_config;\n }\n\nprotected:\n enum class pid\n {\n DistanceRatio,\n SymmetryTest,\n };\n\n float _distanceRatio;\n bool _symmetryTest;\n};\n\nclass BruteForceMatcherNodeType : public MatcherNodeType\n{\npublic:\n ExecutionStatus execute(NodeSocketReader& reader, NodeSocketWriter& writer) override\n {\n \/\/ Read input sockets\n const KeyPoints& queryKp = reader.readSocket(0).getKeypoints();\n const cv::Mat& query = reader.readSocket(1).getArray();\n const KeyPoints& trainKp = reader.readSocket(2).getKeypoints();\n const cv::Mat& train = reader.readSocket(3).getArray();\n \/\/ Acquire output sockets\n Matches& mt = writer.acquireSocket(0).getMatches();\n\n \/\/ Validate inputs\n if(train.empty() || query.empty())\n return ExecutionStatus(EStatus::Ok);\n\n if(query.cols != train.cols\n || query.type() != train.type())\n return ExecutionStatus(EStatus::Error, \"Query and train descriptors are different types\");\n\n if(query.type() != CV_32F && query.type() != CV_8U)\n {\n return ExecutionStatus(EStatus::Error, \n \"Unsupported descriptor data type \"\n \"(must be float for L2 norm or Uint8 for Hamming norm\");\n }\n\n \/\/ Do stuff\n vector<cv::DMatch> matches;\n\n if(_symmetryTest)\n {\n vector<cv::DMatch> matches1to2 = nndrMatch(query, train);\n vector<cv::DMatch> matches2to1 = nndrMatch(train, query);\n matches = symmetryTest(matches1to2, matches2to1);\n }\n else\n {\n matches = nndrMatch(query, train);\n }\n\n \/\/ Convert to 'Matches' data type\n mt.queryPoints.clear();\n mt.trainPoints.clear();\n\n mt.queryImage = queryKp.image;\n mt.trainImage = trainKp.image;\n\n for(const auto& match : matches)\n {\n mt.queryPoints.push_back(queryKp.kpoints[match.queryIdx].pt);\n mt.trainPoints.push_back(trainKp.kpoints[match.trainIdx].pt);\n }\n\n return ExecutionStatus(EStatus::Ok, \n string_format(\"Matches found: %d\", (int) mt.queryPoints.size()));\n }\n\nprivate:\n vector<cv::DMatch> nndrMatch(const cv::Mat& query, const cv::Mat& train)\n {\n vector<cv::DMatch> nndrMatches;\n\n if(query.type() == CV_32F)\n {\n \/\/ for each descriptors in query array\n for(int queryIdx = 0; queryIdx < query.rows; ++queryIdx)\n {\n const float* query_row = query.ptr<float>(queryIdx);\n\n float bestDistance1 = std::numeric_limits<float>::max();\n float bestDistance2 = std::numeric_limits<float>::max();\n int bestTrainIdx1 = -1;\n\n \/\/ for each descriptors in train array\n for(int trainIdx = 0; trainIdx < train.rows; ++trainIdx)\n {\n const float* train_row = train.ptr<float>(trainIdx);\n\n cv::L2<float> op;\n cv::L2<float>::ResultType dist = op(train_row, query_row, train.cols);\n\n if(dist < bestDistance1)\n {\n bestDistance2 = bestDistance1;\n bestDistance1 = dist;\n bestTrainIdx1 = trainIdx;\n }\n else if(dist < bestDistance2)\n {\n bestDistance2 = dist;\n }\n }\n\n if(bestDistance1 <= _distanceRatio * bestDistance2)\n {\n nndrMatches.push_back(cv::DMatch(queryIdx, bestTrainIdx1, bestDistance1));\n }\n }\n }\n else if(query.type() == CV_8U)\n {\n \/\/ for each descriptors in query array\n for(int queryIdx = 0; queryIdx < query.rows; ++queryIdx)\n {\n const uchar* query_row = query.ptr<uchar>(queryIdx);\n\n int bestDistance1 = std::numeric_limits<int>::max();\n int bestDistance2 = std::numeric_limits<int>::max();\n int bestTrainIdx1 = -1;\n\n \/\/ for each descriptors in train array\n for(int trainIdx = 0; trainIdx < train.rows; ++trainIdx)\n {\n const uchar* train_row = train.ptr<uchar>(trainIdx);\n\n cv::Hamming op;\n cv::Hamming::ResultType dist = op(train_row, query_row, train.cols);\n\n if(dist < bestDistance1)\n {\n bestDistance2 = bestDistance1;\n bestDistance1 = dist;\n bestTrainIdx1 = trainIdx;\n }\n else if(dist < bestDistance2)\n {\n bestDistance2 = dist;\n }\n }\n\n if(bestDistance1 <= _distanceRatio * bestDistance2)\n {\n nndrMatches.emplace_back(cv::DMatch(queryIdx, bestTrainIdx1, (float)bestDistance1));\n }\n }\n }\n\n return nndrMatches;\n }\n};\n\nclass AproximateNearestNeighborMatcherNodeType : public MatcherNodeType\n{\npublic:\n ExecutionStatus execute(NodeSocketReader& reader, NodeSocketWriter& writer) override\n {\n \/\/ Read input sockets\n const KeyPoints& queryKp = reader.readSocket(0).getKeypoints();\n const cv::Mat& queryDesc = reader.readSocket(1).getArray();\n const KeyPoints& trainKp = reader.readSocket(2).getKeypoints();\n const cv::Mat& trainDesc = reader.readSocket(3).getArray();\n \/\/ Acquire output sockets\n Matches& mt = writer.acquireSocket(0).getMatches();\n\n \/\/ Validate inputs\n if(trainDesc.empty() || queryDesc.empty())\n return ExecutionStatus(EStatus::Ok);\n\n if((size_t) trainDesc.rows != trainKp.kpoints.size()\n || (size_t) queryDesc.rows != queryKp.kpoints.size())\n {\n return ExecutionStatus(EStatus::Error, \"Keypoints and descriptors mismatched\");\n }\n\n \/\/ Do stuff\n cv::Ptr<cv::flann::IndexParams> indexParams;\n \n if(trainDesc.depth() == CV_8U)\n {\n indexParams = new cv::flann::LshIndexParams(12, 20, 2);\n \/\/ For now doesn't work for binary descriptors :(\n \/\/cv::flann::HierarchicalClusteringIndexParams();\n }\n else if(trainDesc.depth() == CV_32F \n || trainDesc.depth() == CV_64F)\n {\n indexParams = new cv::flann::HierarchicalClusteringIndexParams();\n }\n \n cv::FlannBasedMatcher matcher(indexParams);\n vector<cv::DMatch> matches;\n\n if(_symmetryTest)\n {\n vector<vector<cv::DMatch>> knMatches1to2, knMatches2to1;\n\n matcher.knnMatch(queryDesc, trainDesc, knMatches1to2, 2);\n matcher.knnMatch(trainDesc, queryDesc, knMatches2to1, 2);\n\n auto matches1to2 = distanceRatioTest(knMatches1to2, _distanceRatio);\n auto matches2to1 = distanceRatioTest(knMatches2to1, _distanceRatio);\n matches = symmetryTest(matches1to2, matches2to1);\n }\n else\n {\n vector<vector<cv::DMatch>> knMatches;\n matcher.knnMatch(queryDesc, trainDesc, knMatches, 2);\n\n matches = distanceRatioTest(knMatches, _distanceRatio);\n }\n\n \/\/ Convert to 'Matches' data type\n mt.queryPoints.clear();\n mt.trainPoints.clear();\n\n for(const auto& match : matches)\n {\n mt.queryPoints.push_back(queryKp.kpoints[match.queryIdx].pt);\n mt.trainPoints.push_back(trainKp.kpoints[match.trainIdx].pt);\n }\n\n mt.queryImage = queryKp.image;\n mt.trainImage = trainKp.image;\n\n return ExecutionStatus(EStatus::Ok, \n string_format(\"Matches found: %d\", (int) mt.queryPoints.size()));\n }\n};\n\n\/\/\/ Only BFMatcher as LSH (FLANN) for 1-bit descriptor isn't supported\nclass RadiusBruteForceMatcherNodeType : public NodeType\n{\npublic:\n RadiusBruteForceMatcherNodeType()\n : _maxDistance(100.0)\n {\n }\n\n bool setProperty(PropertyID propId, const NodeProperty& newValue) override\n {\n switch(static_cast<pid>(propId))\n {\n case pid::MaxDistance:\n _maxDistance = newValue.toFloat();\n return true;\n }\n\n return false;\n }\n\n NodeProperty property(PropertyID propId) const override\n {\n switch(static_cast<pid>(propId))\n {\n case pid::MaxDistance: return _maxDistance;\n }\n\n return NodeProperty();\n }\n\n ExecutionStatus execute(NodeSocketReader& reader, NodeSocketWriter& writer) override\n {\n \/\/ Read input sockets\n const KeyPoints& queryKp = reader.readSocket(0).getKeypoints();\n const cv::Mat& queryDesc = reader.readSocket(1).getArray();\n const KeyPoints& trainKp = reader.readSocket(2).getKeypoints();\n const cv::Mat& trainDesc = reader.readSocket(3).getArray();\n \/\/ Acquire output sockets\n Matches& mt = writer.acquireSocket(0).getMatches();\n\n \/\/ Validate inputs\n if(trainDesc.empty() || queryDesc.empty())\n return ExecutionStatus(EStatus::Ok);\n\n if((size_t) trainDesc.rows != trainKp.kpoints.size()\n || (size_t) queryDesc.rows != queryKp.kpoints.size())\n {\n return ExecutionStatus(EStatus::Error, \"Keypoints and descriptors mismatched\");\n }\n\n int normType = cv::NORM_L2;\n \/\/ If BRISK, ORB or FREAK was used as a descriptor\n if(queryDesc.depth() == CV_8U && trainDesc.depth() == CV_8U)\n normType = cv::NORM_HAMMING;\n\n mt.queryPoints.clear();\n mt.trainPoints.clear();\n\n cv::BFMatcher matcher(normType);\n vector<vector<cv::DMatch>> radiusMatches;\n\n matcher.radiusMatch(queryDesc, trainDesc, radiusMatches, _maxDistance);\n\n \/\/ remove unmatched ones and pick only first matches\n vector<cv::DMatch> matches;\n\n for(const auto& rmatches : radiusMatches)\n {\n if(!rmatches.empty())\n {\n matches.push_back(rmatches[0]);\n }\n }\n\n \/\/ Convert to 'Matches' data type\n mt.queryPoints.clear();\n mt.trainPoints.clear();\n\n for(const auto& match : matches)\n {\n mt.queryPoints.push_back(queryKp.kpoints[match.queryIdx].pt);\n mt.trainPoints.push_back(trainKp.kpoints[match.trainIdx].pt);\n }\n\n mt.queryImage = queryKp.image;\n mt.trainImage = trainKp.image;\n\n return ExecutionStatus(EStatus::Ok, \n string_format(\"Matches found: %d\", (int) mt.queryPoints.size()));\n }\n\n void configuration(NodeConfig& nodeConfig) const override\n {\n static const InputSocketConfig in_config[] = {\n { ENodeFlowDataType::Keypoints, \"keypoints1\", \"Query keypoints\", \"\" },\n { ENodeFlowDataType::Array, \"descriptors1\", \"Query descriptors\", \"\" },\n { ENodeFlowDataType::Keypoints, \"keypoints2\", \"Train keypoints\", \"\" },\n { ENodeFlowDataType::Array, \"descriptors2\", \"Train descriptors\", \"\" },\n { ENodeFlowDataType::Invalid, \"\", \"\", \"\" }\n };\n static const OutputSocketConfig out_config[] = {\n { ENodeFlowDataType::Matches, \"matches\", \"Matches\", \"\" },\n { ENodeFlowDataType::Invalid, \"\", \"\", \"\" }\n };\n static const PropertyConfig prop_config[] = {\n { EPropertyType::Double, \"Max distance\", \"min:0.0, decimals:2\" },\n { EPropertyType::Unknown, \"\", \"\" }\n };\n\n nodeConfig.description = \"Finds the training descriptors not farther than the specified distance.\";\n nodeConfig.pInputSockets = in_config;\n nodeConfig.pOutputSockets = out_config;\n nodeConfig.pProperties = prop_config;\n }\nprivate:\n enum class pid\n {\n MaxDistance\n };\n\n float _maxDistance;\n};\n\nREGISTER_NODE(\"Features\/Radius BForce Matcher\", RadiusBruteForceMatcherNodeType);\nREGISTER_NODE(\"Features\/BForce Matcher\", BruteForceMatcherNodeType);\nREGISTER_NODE(\"Features\/ANN Matcher\", AproximateNearestNeighborMatcherNodeType)\n<commit_msg>updated matcher nodes for new node conf. interface [WIP]<commit_after>\/*\n * Copyright (c) 2013-2014 Kajetan Swierk <k0zmo@outlook.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 *\/\n\n#include \"Logic\/NodeType.h\"\n#include \"Logic\/NodeFactory.h\"\n#include \"Kommon\/Utils.h\"\n#include \"Kommon\/StringUtils.h\"\n\n#include <opencv2\/features2d\/features2d.hpp>\n\nusing std::vector;\n\nstatic vector<cv::DMatch> distanceRatioTest(const vector<vector<cv::DMatch>>& knMatches, \n float distanceRatioThreshold)\n{\n vector<cv::DMatch> positiveMatches;\n positiveMatches.reserve(knMatches.size());\n\n for(const auto& knMatch : knMatches)\n {\n if(knMatch.size() != 2)\n continue;\n\n const auto& best = knMatch[0];\n const auto& good = knMatch[1];\n\n if(best.distance <= distanceRatioThreshold * good.distance)\n positiveMatches.push_back(best);\n }\n\n return positiveMatches;\n}\n\nstatic vector<cv::DMatch> symmetryTest(const vector<cv::DMatch>& matches1to2,\n const vector<cv::DMatch>& matches2to1)\n{\n vector<cv::DMatch> bothMatches;\n\n for(const auto& match1to2 : matches1to2)\n {\n for(const auto& match2to1 : matches2to1)\n {\n if(match1to2.queryIdx == match2to1.trainIdx\n && match2to1.queryIdx == match1to2.trainIdx)\n {\n bothMatches.push_back(match1to2);\n break;\n }\n }\n }\n\n return bothMatches;\n}\n\nclass MatcherNodeType : public NodeType\n{\npublic:\n MatcherNodeType()\n : _distanceRatio(0.8f)\n , _symmetryTest(false)\n {\n addInput(\"Query keypoints\", ENodeFlowDataType::Keypoints);\n addInput(\"Query descriptors\", ENodeFlowDataType::Array);\n addInput(\"Train keypoints\", ENodeFlowDataType::Keypoints);\n addInput(\"Train descriptors\", ENodeFlowDataType::Array);\n addOutput(\"Matches\", ENodeFlowDataType::Matches);\n addProperty(\"Distance ratio\", _distanceRatio)\n .setValidator(make_validator<InclRangePropertyValidator<double>>(0.0, 1.0))\n .setUiHints(\"min:0.0, max:1.0, step:0.1, decimals:2\");\n addProperty(\"Symmetry test\", _symmetryTest);\n setDescription(\"Finds best matches between query and train descriptors \"\n \"using nearest neighbour distance ratio and\/or symmetry test.\");\n }\n\nprotected:\n TypedNodeProperty<float> _distanceRatio;\n TypedNodeProperty<bool> _symmetryTest;\n};\n\nclass BruteForceMatcherNodeType : public MatcherNodeType\n{\npublic:\n ExecutionStatus execute(NodeSocketReader& reader, NodeSocketWriter& writer) override\n {\n \/\/ Read input sockets\n const KeyPoints& queryKp = reader.readSocket(0).getKeypoints();\n const cv::Mat& query = reader.readSocket(1).getArray();\n const KeyPoints& trainKp = reader.readSocket(2).getKeypoints();\n const cv::Mat& train = reader.readSocket(3).getArray();\n \/\/ Acquire output sockets\n Matches& mt = writer.acquireSocket(0).getMatches();\n\n \/\/ Validate inputs\n if(train.empty() || query.empty())\n return ExecutionStatus(EStatus::Ok);\n\n if(query.cols != train.cols\n || query.type() != train.type())\n return ExecutionStatus(EStatus::Error, \"Query and train descriptors are different types\");\n\n if(query.type() != CV_32F && query.type() != CV_8U)\n {\n return ExecutionStatus(EStatus::Error, \n \"Unsupported descriptor data type \"\n \"(must be float for L2 norm or Uint8 for Hamming norm\");\n }\n\n \/\/ Do stuff\n vector<cv::DMatch> matches;\n\n if(_symmetryTest)\n {\n vector<cv::DMatch> matches1to2 = nndrMatch(query, train);\n vector<cv::DMatch> matches2to1 = nndrMatch(train, query);\n matches = symmetryTest(matches1to2, matches2to1);\n }\n else\n {\n matches = nndrMatch(query, train);\n }\n\n \/\/ Convert to 'Matches' data type\n mt.queryPoints.clear();\n mt.trainPoints.clear();\n\n mt.queryImage = queryKp.image;\n mt.trainImage = trainKp.image;\n\n for(const auto& match : matches)\n {\n mt.queryPoints.push_back(queryKp.kpoints[match.queryIdx].pt);\n mt.trainPoints.push_back(trainKp.kpoints[match.trainIdx].pt);\n }\n\n return ExecutionStatus(EStatus::Ok, \n string_format(\"Matches found: %d\", (int) mt.queryPoints.size()));\n }\n\nprivate:\n vector<cv::DMatch> nndrMatch(const cv::Mat& query, const cv::Mat& train)\n {\n vector<cv::DMatch> nndrMatches;\n\n if(query.type() == CV_32F)\n {\n \/\/ for each descriptors in query array\n for(int queryIdx = 0; queryIdx < query.rows; ++queryIdx)\n {\n const float* query_row = query.ptr<float>(queryIdx);\n\n float bestDistance1 = std::numeric_limits<float>::max();\n float bestDistance2 = std::numeric_limits<float>::max();\n int bestTrainIdx1 = -1;\n\n \/\/ for each descriptors in train array\n for(int trainIdx = 0; trainIdx < train.rows; ++trainIdx)\n {\n const float* train_row = train.ptr<float>(trainIdx);\n\n cv::L2<float> op;\n cv::L2<float>::ResultType dist = op(train_row, query_row, train.cols);\n\n if(dist < bestDistance1)\n {\n bestDistance2 = bestDistance1;\n bestDistance1 = dist;\n bestTrainIdx1 = trainIdx;\n }\n else if(dist < bestDistance2)\n {\n bestDistance2 = dist;\n }\n }\n\n if(bestDistance1 <= _distanceRatio * bestDistance2)\n {\n nndrMatches.push_back(cv::DMatch(queryIdx, bestTrainIdx1, bestDistance1));\n }\n }\n }\n else if(query.type() == CV_8U)\n {\n \/\/ for each descriptors in query array\n for(int queryIdx = 0; queryIdx < query.rows; ++queryIdx)\n {\n const uchar* query_row = query.ptr<uchar>(queryIdx);\n\n int bestDistance1 = std::numeric_limits<int>::max();\n int bestDistance2 = std::numeric_limits<int>::max();\n int bestTrainIdx1 = -1;\n\n \/\/ for each descriptors in train array\n for(int trainIdx = 0; trainIdx < train.rows; ++trainIdx)\n {\n const uchar* train_row = train.ptr<uchar>(trainIdx);\n\n cv::Hamming op;\n cv::Hamming::ResultType dist = op(train_row, query_row, train.cols);\n\n if(dist < bestDistance1)\n {\n bestDistance2 = bestDistance1;\n bestDistance1 = dist;\n bestTrainIdx1 = trainIdx;\n }\n else if(dist < bestDistance2)\n {\n bestDistance2 = dist;\n }\n }\n\n if(bestDistance1 <= _distanceRatio * bestDistance2)\n {\n nndrMatches.emplace_back(cv::DMatch(queryIdx, bestTrainIdx1, (float)bestDistance1));\n }\n }\n }\n\n return nndrMatches;\n }\n};\n\nclass AproximateNearestNeighborMatcherNodeType : public MatcherNodeType\n{\npublic:\n ExecutionStatus execute(NodeSocketReader& reader, NodeSocketWriter& writer) override\n {\n \/\/ Read input sockets\n const KeyPoints& queryKp = reader.readSocket(0).getKeypoints();\n const cv::Mat& queryDesc = reader.readSocket(1).getArray();\n const KeyPoints& trainKp = reader.readSocket(2).getKeypoints();\n const cv::Mat& trainDesc = reader.readSocket(3).getArray();\n \/\/ Acquire output sockets\n Matches& mt = writer.acquireSocket(0).getMatches();\n\n \/\/ Validate inputs\n if(trainDesc.empty() || queryDesc.empty())\n return ExecutionStatus(EStatus::Ok);\n\n if((size_t) trainDesc.rows != trainKp.kpoints.size()\n || (size_t) queryDesc.rows != queryKp.kpoints.size())\n {\n return ExecutionStatus(EStatus::Error, \"Keypoints and descriptors mismatched\");\n }\n\n \/\/ Do stuff\n cv::Ptr<cv::flann::IndexParams> indexParams;\n \n if(trainDesc.depth() == CV_8U)\n {\n indexParams = new cv::flann::LshIndexParams(12, 20, 2);\n \/\/ For now doesn't work for binary descriptors :(\n \/\/cv::flann::HierarchicalClusteringIndexParams();\n }\n else if(trainDesc.depth() == CV_32F \n || trainDesc.depth() == CV_64F)\n {\n indexParams = new cv::flann::HierarchicalClusteringIndexParams();\n }\n \n cv::FlannBasedMatcher matcher(indexParams);\n vector<cv::DMatch> matches;\n\n if(_symmetryTest)\n {\n vector<vector<cv::DMatch>> knMatches1to2, knMatches2to1;\n\n matcher.knnMatch(queryDesc, trainDesc, knMatches1to2, 2);\n matcher.knnMatch(trainDesc, queryDesc, knMatches2to1, 2);\n\n auto matches1to2 = distanceRatioTest(knMatches1to2, _distanceRatio);\n auto matches2to1 = distanceRatioTest(knMatches2to1, _distanceRatio);\n matches = symmetryTest(matches1to2, matches2to1);\n }\n else\n {\n vector<vector<cv::DMatch>> knMatches;\n matcher.knnMatch(queryDesc, trainDesc, knMatches, 2);\n\n matches = distanceRatioTest(knMatches, _distanceRatio);\n }\n\n \/\/ Convert to 'Matches' data type\n mt.queryPoints.clear();\n mt.trainPoints.clear();\n\n for(const auto& match : matches)\n {\n mt.queryPoints.push_back(queryKp.kpoints[match.queryIdx].pt);\n mt.trainPoints.push_back(trainKp.kpoints[match.trainIdx].pt);\n }\n\n mt.queryImage = queryKp.image;\n mt.trainImage = trainKp.image;\n\n return ExecutionStatus(EStatus::Ok, \n string_format(\"Matches found: %d\", (int) mt.queryPoints.size()));\n }\n};\n\n\/\/\/ Only BFMatcher as LSH (FLANN) for 1-bit descriptor isn't supported\nclass RadiusBruteForceMatcherNodeType : public NodeType\n{\npublic:\n RadiusBruteForceMatcherNodeType()\n : _maxDistance(100.0)\n {\n addInput(\"Query keypoints\", ENodeFlowDataType::Keypoints);\n addInput(\"Query descriptors\", ENodeFlowDataType::Array);\n addInput(\"Train keypoints\", ENodeFlowDataType::Keypoints);\n addInput(\"Train descriptors\", ENodeFlowDataType::Array);\n addOutput(\"Matches\", ENodeFlowDataType::Matches);\n addProperty(\"Max distance\", _maxDistance)\n .setValidator(make_validator<MinPropertyValidator<double>>(0.0))\n .setUiHints(\"min:0.0, decimals:2\");\n setDescription(\"Finds the training descriptors not farther than the specified distance.\");\n }\n\n ExecutionStatus execute(NodeSocketReader& reader, NodeSocketWriter& writer) override\n {\n \/\/ Read input sockets\n const KeyPoints& queryKp = reader.readSocket(0).getKeypoints();\n const cv::Mat& queryDesc = reader.readSocket(1).getArray();\n const KeyPoints& trainKp = reader.readSocket(2).getKeypoints();\n const cv::Mat& trainDesc = reader.readSocket(3).getArray();\n \/\/ Acquire output sockets\n Matches& mt = writer.acquireSocket(0).getMatches();\n\n \/\/ Validate inputs\n if(trainDesc.empty() || queryDesc.empty())\n return ExecutionStatus(EStatus::Ok);\n\n if((size_t) trainDesc.rows != trainKp.kpoints.size()\n || (size_t) queryDesc.rows != queryKp.kpoints.size())\n {\n return ExecutionStatus(EStatus::Error, \"Keypoints and descriptors mismatched\");\n }\n\n int normType = cv::NORM_L2;\n \/\/ If BRISK, ORB or FREAK was used as a descriptor\n if(queryDesc.depth() == CV_8U && trainDesc.depth() == CV_8U)\n normType = cv::NORM_HAMMING;\n\n mt.queryPoints.clear();\n mt.trainPoints.clear();\n\n cv::BFMatcher matcher(normType);\n vector<vector<cv::DMatch>> radiusMatches;\n\n matcher.radiusMatch(queryDesc, trainDesc, radiusMatches, _maxDistance);\n\n \/\/ remove unmatched ones and pick only first matches\n vector<cv::DMatch> matches;\n\n for(const auto& rmatches : radiusMatches)\n {\n if(!rmatches.empty())\n {\n matches.push_back(rmatches[0]);\n }\n }\n\n \/\/ Convert to 'Matches' data type\n mt.queryPoints.clear();\n mt.trainPoints.clear();\n\n for(const auto& match : matches)\n {\n mt.queryPoints.push_back(queryKp.kpoints[match.queryIdx].pt);\n mt.trainPoints.push_back(trainKp.kpoints[match.trainIdx].pt);\n }\n\n mt.queryImage = queryKp.image;\n mt.trainImage = trainKp.image;\n\n return ExecutionStatus(EStatus::Ok, \n string_format(\"Matches found: %d\", (int) mt.queryPoints.size()));\n }\n\nprivate:\n TypedNodeProperty<float> _maxDistance;\n};\n\nREGISTER_NODE(\"Features\/Radius BForce Matcher\", RadiusBruteForceMatcherNodeType);\nREGISTER_NODE(\"Features\/BForce Matcher\", BruteForceMatcherNodeType);\nREGISTER_NODE(\"Features\/ANN Matcher\", AproximateNearestNeighborMatcherNodeType)\n<|endoftext|>"} {"text":"<commit_before>\/*\n * Copyright(c) Sophist Solutions, Inc. 1990-2021. All rights reserved\n *\/\n#ifndef _Stroika_Foundation_Traversal_IterableFromIterator_inl_\n#define _Stroika_Foundation_Traversal_IterableFromIterator_inl_\n\n#include \"..\/Debug\/Assertions.h\"\n#include \"DelegatedIterator.h\"\n\nnamespace Stroika::Foundation::Traversal {\n\n#if qDebug\n \/*\n ********************************************************************************\n * IterableFromIterator<T, NEW_ITERATOR_REP_TYPE, CONTEXT_FOR_EACH_ITERATOR>::_Rep::_IteratorTracker *\n ********************************************************************************\n *\/\n template <typename T, typename NEW_ITERATOR_REP_TYPE, typename CONTEXT_FOR_EACH_ITERATOR>\n inline IterableFromIterator<T, NEW_ITERATOR_REP_TYPE, CONTEXT_FOR_EACH_ITERATOR>::_Rep::_IteratorTracker::~_IteratorTracker ()\n {\n Assert (*fCountRunning == 0);\n }\n template <typename T, typename NEW_ITERATOR_REP_TYPE, typename CONTEXT_FOR_EACH_ITERATOR>\n inline Iterator<T> IterableFromIterator<T, NEW_ITERATOR_REP_TYPE, CONTEXT_FOR_EACH_ITERATOR>::_Rep::_IteratorTracker::MakeDelegatedIterator (const Iterator<T>& sourceIterator)\n {\n return DelegatedIterator<T, shared_ptr<unsigned int>> (sourceIterator, fCountRunning);\n }\n#endif\n\n \/*\n ********************************************************************************\n * IterableFromIterator<T, NEW_ITERATOR_REP_TYPE, CONTEXT_FOR_EACH_ITERATOR>::_Rep *\n ********************************************************************************\n *\/\n template <typename T, typename NEW_ITERATOR_REP_TYPE, typename CONTEXT_FOR_EACH_ITERATOR>\n template <typename K1, enable_if_t<not is_same_v<K1, void>>*>\n inline IterableFromIterator<T, NEW_ITERATOR_REP_TYPE, CONTEXT_FOR_EACH_ITERATOR>::_Rep::_Rep (const _ContextObjectType& contextForEachIterator)\n : _fContextForEachIterator{contextForEachIterator}\n {\n }\n template <typename T, typename NEW_ITERATOR_REP_TYPE, typename CONTEXT_FOR_EACH_ITERATOR>\n template <typename K1, enable_if_t<is_same_v<K1, void>>*>\n inline IterableFromIterator<T, NEW_ITERATOR_REP_TYPE, CONTEXT_FOR_EACH_ITERATOR>::_Rep::_Rep ()\n {\n }\n template <typename T, typename NEW_ITERATOR_REP_TYPE, typename CONTEXT_FOR_EACH_ITERATOR>\n Iterator<T> IterableFromIterator<T, NEW_ITERATOR_REP_TYPE, CONTEXT_FOR_EACH_ITERATOR>::_Rep::MakeIterator () const\n {\n if constexpr (is_same_v<NEW_ITERATOR_REP_TYPE, void>) {\n return nullptr;\n }\n else {\n#if qDebug\n return fIteratorTracker_.MakeDelegatedIterator (Iterator<T>{Iterator<T>::template MakeSmartPtr<NEW_ITERATOR_REP_TYPE> (_fContextForEachIterator)});\n#else\n return Iterator<T>{Iterator<T>::template MakeSmartPtr<NEW_ITERATOR_REP_TYPE> (_fContextForEachIterator)};\n#endif\n }\n }\n template <typename T, typename NEW_ITERATOR_REP_TYPE, typename CONTEXT_FOR_EACH_ITERATOR>\n size_t IterableFromIterator<T, NEW_ITERATOR_REP_TYPE, CONTEXT_FOR_EACH_ITERATOR>::_Rep::GetLength () const\n {\n size_t n = 0;\n for (auto i = this->MakeIterator (); not i.Done (); ++i) {\n n++;\n }\n return n;\n }\n template <typename T, typename NEW_ITERATOR_REP_TYPE, typename CONTEXT_FOR_EACH_ITERATOR>\n bool IterableFromIterator<T, NEW_ITERATOR_REP_TYPE, CONTEXT_FOR_EACH_ITERATOR>::_Rep::IsEmpty () const\n {\n for (auto i = this->MakeIterator (); not i.Done (); ++i) {\n return false;\n }\n return true;\n }\n template <typename T, typename NEW_ITERATOR_REP_TYPE, typename CONTEXT_FOR_EACH_ITERATOR>\n void IterableFromIterator<T, NEW_ITERATOR_REP_TYPE, CONTEXT_FOR_EACH_ITERATOR>::_Rep::Apply (const function<void (ArgByValueType<value_type> item)>& doToElement) const\n {\n this->_Apply (doToElement);\n }\n template <typename T, typename NEW_ITERATOR_REP_TYPE, typename CONTEXT_FOR_EACH_ITERATOR>\n Iterator<T> IterableFromIterator<T, NEW_ITERATOR_REP_TYPE, CONTEXT_FOR_EACH_ITERATOR>::_Rep::FindFirstThat (const function<bool (ArgByValueType<value_type> item)>& doToElement) const\n {\n return this->_FindFirstThat (doToElement);\n }\n\n \/*\n ********************************************************************************\n **************************** MakeIterableFromIterator **************************\n ********************************************************************************\n *\/\n template <typename T>\n Iterable<T> MakeIterableFromIterator (const Iterator<T>& iterator)\n {\n struct MyIterable_ : public Iterable<T> {\n struct Rep : public IterableFromIterator<T>::_Rep, public Memory::UseBlockAllocationIfAppropriate<Rep> {\n using inherited = typename IterableFromIterator<T>::_Rep;\n using _IteratorTracker = typename inherited::_IteratorTracker;\n using _IterableRepSharedPtr = typename Iterable<T>::_IterableRepSharedPtr;\n Iterator<T> fOriginalIterator;\n#if qDebug\n mutable _IteratorTracker fIteratorTracker_{};\n#endif\n Rep (const Iterator<T>& originalIterator)\n : fOriginalIterator{originalIterator}\n {\n }\n virtual Iterator<T> MakeIterator () const override\n {\n#if qDebug\n return fIteratorTracker_.MakeDelegatedIterator (fOriginalIterator);\n#else\n return fOriginalIterator;\n#endif\n }\n virtual _IterableRepSharedPtr Clone () const override\n {\n return Iterable<T>::template MakeSmartPtr<Rep> (*this);\n }\n };\n MyIterable_ (const Iterator<T>& originalIterator)\n : Iterable<T>{Iterable<T>::template MakeSmartPtr<Rep> (originalIterator)}\n {\n }\n };\n return MyIterable_{iterator};\n }\n\n}\n\n#endif \/* _Stroika_Foundation_Traversal_IterableFromIterator_inl_ *\/\n<commit_msg>Silecne warning<commit_after>\/*\n * Copyright(c) Sophist Solutions, Inc. 1990-2021. All rights reserved\n *\/\n#ifndef _Stroika_Foundation_Traversal_IterableFromIterator_inl_\n#define _Stroika_Foundation_Traversal_IterableFromIterator_inl_\n\n#include \"..\/Debug\/Assertions.h\"\n#include \"DelegatedIterator.h\"\n\nnamespace Stroika::Foundation::Traversal {\n\n#if qDebug\n \/*\n ********************************************************************************\n * IterableFromIterator<T, NEW_ITERATOR_REP_TYPE, CONTEXT_FOR_EACH_ITERATOR>::_Rep::_IteratorTracker *\n ********************************************************************************\n *\/\n template <typename T, typename NEW_ITERATOR_REP_TYPE, typename CONTEXT_FOR_EACH_ITERATOR>\n inline IterableFromIterator<T, NEW_ITERATOR_REP_TYPE, CONTEXT_FOR_EACH_ITERATOR>::_Rep::_IteratorTracker::~_IteratorTracker ()\n {\n Assert (*fCountRunning == 0);\n }\n template <typename T, typename NEW_ITERATOR_REP_TYPE, typename CONTEXT_FOR_EACH_ITERATOR>\n inline Iterator<T> IterableFromIterator<T, NEW_ITERATOR_REP_TYPE, CONTEXT_FOR_EACH_ITERATOR>::_Rep::_IteratorTracker::MakeDelegatedIterator (const Iterator<T>& sourceIterator)\n {\n return DelegatedIterator<T, shared_ptr<unsigned int>> (sourceIterator, fCountRunning);\n }\n#endif\n\n \/*\n ********************************************************************************\n * IterableFromIterator<T, NEW_ITERATOR_REP_TYPE, CONTEXT_FOR_EACH_ITERATOR>::_Rep *\n ********************************************************************************\n *\/\n template <typename T, typename NEW_ITERATOR_REP_TYPE, typename CONTEXT_FOR_EACH_ITERATOR>\n template <typename K1, enable_if_t<not is_same_v<K1, void>>*>\n inline IterableFromIterator<T, NEW_ITERATOR_REP_TYPE, CONTEXT_FOR_EACH_ITERATOR>::_Rep::_Rep (const _ContextObjectType& contextForEachIterator)\n : _fContextForEachIterator{contextForEachIterator}\n {\n }\n template <typename T, typename NEW_ITERATOR_REP_TYPE, typename CONTEXT_FOR_EACH_ITERATOR>\n template <typename K1, enable_if_t<is_same_v<K1, void>>*>\n inline IterableFromIterator<T, NEW_ITERATOR_REP_TYPE, CONTEXT_FOR_EACH_ITERATOR>::_Rep::_Rep ()\n {\n }\n template <typename T, typename NEW_ITERATOR_REP_TYPE, typename CONTEXT_FOR_EACH_ITERATOR>\n Iterator<T> IterableFromIterator<T, NEW_ITERATOR_REP_TYPE, CONTEXT_FOR_EACH_ITERATOR>::_Rep::MakeIterator () const\n {\n if constexpr (is_same_v<NEW_ITERATOR_REP_TYPE, void>) {\n return nullptr;\n }\n else {\n#if qDebug\n return fIteratorTracker_.MakeDelegatedIterator (Iterator<T>{Iterator<T>::template MakeSmartPtr<NEW_ITERATOR_REP_TYPE> (_fContextForEachIterator)});\n#else\n return Iterator<T>{Iterator<T>::template MakeSmartPtr<NEW_ITERATOR_REP_TYPE> (_fContextForEachIterator)};\n#endif\n }\n }\n template <typename T, typename NEW_ITERATOR_REP_TYPE, typename CONTEXT_FOR_EACH_ITERATOR>\n size_t IterableFromIterator<T, NEW_ITERATOR_REP_TYPE, CONTEXT_FOR_EACH_ITERATOR>::_Rep::GetLength () const\n {\n size_t n = 0;\n for (auto i = this->MakeIterator (); not i.Done (); ++i) {\n n++;\n }\n return n;\n }\n template <typename T, typename NEW_ITERATOR_REP_TYPE, typename CONTEXT_FOR_EACH_ITERATOR>\n bool IterableFromIterator<T, NEW_ITERATOR_REP_TYPE, CONTEXT_FOR_EACH_ITERATOR>::_Rep::IsEmpty () const\n {\n for (auto i = this->MakeIterator (); not i.Done (); ++i) {\n return false;\n }\n return true;\n }\n template <typename T, typename NEW_ITERATOR_REP_TYPE, typename CONTEXT_FOR_EACH_ITERATOR>\n void IterableFromIterator<T, NEW_ITERATOR_REP_TYPE, CONTEXT_FOR_EACH_ITERATOR>::_Rep::Apply (const function<void (ArgByValueType<value_type> item)>& doToElement) const\n {\n this->_Apply (doToElement);\n }\n template <typename T, typename NEW_ITERATOR_REP_TYPE, typename CONTEXT_FOR_EACH_ITERATOR>\n Iterator<T> IterableFromIterator<T, NEW_ITERATOR_REP_TYPE, CONTEXT_FOR_EACH_ITERATOR>::_Rep::FindFirstThat (const function<bool (ArgByValueType<value_type> item)>& doToElement) const\n {\n return this->_FindFirstThat (doToElement);\n }\n\n \/*\n ********************************************************************************\n **************************** MakeIterableFromIterator **************************\n ********************************************************************************\n *\/\n template <typename T>\n Iterable<T> MakeIterableFromIterator (const Iterator<T>& iterator)\n {\n struct MyIterable_ : public Iterable<T> {\n struct Rep : public IterableFromIterator<T>::_Rep, public Memory::UseBlockAllocationIfAppropriate<Rep> {\n using inherited = typename IterableFromIterator<T>::_Rep;\n#if qDebug\n using _IteratorTracker = typename inherited::_IteratorTracker;\n#endif\n using _IterableRepSharedPtr = typename Iterable<T>::_IterableRepSharedPtr;\n Iterator<T> fOriginalIterator;\n#if qDebug\n mutable _IteratorTracker fIteratorTracker_{};\n#endif\n Rep (const Iterator<T>& originalIterator)\n : fOriginalIterator{originalIterator}\n {\n }\n virtual Iterator<T> MakeIterator () const override\n {\n#if qDebug\n return fIteratorTracker_.MakeDelegatedIterator (fOriginalIterator);\n#else\n return fOriginalIterator;\n#endif\n }\n virtual _IterableRepSharedPtr Clone () const override\n {\n return Iterable<T>::template MakeSmartPtr<Rep> (*this);\n }\n };\n MyIterable_ (const Iterator<T>& originalIterator)\n : Iterable<T>{Iterable<T>::template MakeSmartPtr<Rep> (originalIterator)}\n {\n }\n };\n return MyIterable_{iterator};\n }\n\n}\n\n#endif \/* _Stroika_Foundation_Traversal_IterableFromIterator_inl_ *\/\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\/Geometry\/Model.hpp>\n#include <Engine\/Texture\/TextureAsset.hpp>\n#include <Video\/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#include <Engine\/Manager\/ParticleManager.hpp>\n#include <Engine\/Hymn.hpp>\n\n#include \"..\/..\/Util\/EditorSettings.hpp\"\n#include \"..\/FileSelector.hpp\"\n#include \"..\/..\/ImGui\/GuiHelpers.hpp\"\n#include \"..\/..\/Resources.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, ImGuiWindowFlags_NoResize | ImGuiWindowFlags_ShowBorders)) {\n ImGui::InputText(\"Name\", name, 128);\n entity->name = name;\n ImGui::Text(\"Transform\");\n ImGui::ShowHelpMarker(\"The entity's position, rotation and scale.\", 75.f);\n ImGui::Indent();\n ImGui::DraggableVec3(\"Position\", entity->position);\n ImGui::DraggableVec3(\"Rotation\", entity->rotation);\n ImGui::DraggableVec3(\"Scale\", entity->scale);\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\nEntity* EntityEditor::GetEntity() {\n return entity;\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 : Resources().models) {\n if (ImGui::Selectable(model->name.c_str()))\n animation->riggedModel = dynamic_cast<Geometry::Model*>(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::DraggableVec3(\"Velocity\", physics->velocity);\n ImGui::DraggableFloat(\"Max velocity\", physics->maxVelocity, 0.0f);\n ImGui::DraggableVec3(\"Acceleration\", physics->acceleration);\n ImGui::DraggableFloat(\"Velocity drag factor\", physics->velocityDragFactor);\n ImGui::DraggableFloat(\"Gravity factor\", physics->gravityFactor);\n ImGui::Unindent();\n ImGui::Text(\"Angular\");\n ImGui::Indent();\n ImGui::DraggableVec3(\"Angular velocity\", physics->angularVelocity);\n ImGui::DraggableFloat(\"Max angular velocity\", physics->maxAngularVelocity, 0.0f);\n ImGui::DraggableVec3(\"Angular acceleration\", physics->angularAcceleration);\n ImGui::DraggableFloat(\"Angular drag factor\", physics->angularDragFactor);\n ImGui::DraggableVec3(\"Moment of inertia\", physics->momentOfInertia);\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 : Resources().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::DraggableFloat(\"Field of view\", lens->fieldOfView, 0.0f, 180.f);\n ImGui::DraggableFloat(\"Z near\", lens->zNear, 0.0f);\n ImGui::DraggableFloat(\"Z far\", lens->zFar, 0.0f);\n ImGui::Unindent();\n}\n\nvoid EntityEditor::MaterialEditor(Component::Material* material) {\n \/\/ Diffuse\n ImGui::Text(\"Diffuse\");\n ImGui::Indent();\n if (material->diffuse->GetTexture()->IsLoaded())\n ImGui::Image((void*) material->diffuse->GetTexture()->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 (TextureAsset* texture : Resources().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->GetTexture()->IsLoaded())\n ImGui::Image((void*) material->normal->GetTexture()->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 (TextureAsset* texture : Resources().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->GetTexture()->IsLoaded())\n ImGui::Image((void*) material->specular->GetTexture()->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 (TextureAsset* texture : Resources().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->GetTexture()->IsLoaded())\n ImGui::Image((void*) material->glow->GetTexture()->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 (TextureAsset* texture : Resources().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::ColorEdit3(\"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::ColorEdit3(\"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::ColorEdit3(\"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 : Resources().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::ColorEdit3(\"Color\", &particleEmitter->particleType.color[0]);\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::Unindent();\n \n ImGui::Text(\"Emitter\");\n ImGui::Indent();\n ImGui::DraggableFloat(\"Average emit time\", particleEmitter->averageEmitTime, 0.0f);\n ImGui::DraggableFloat(\"Emit time variance\", particleEmitter->emitTimeVariance, 0.0f);\n \n const char* items[] = { \"Point\", \"Cuboid\" };\n int item = static_cast<int>(particleEmitter->emitterType);\n if (ImGui::Combo(\"Emitter type\", &item, items, 2))\n particleEmitter->emitterType = static_cast<Component::ParticleEmitter::EmitterType>(item);\n \n if (particleEmitter->emitterType == Component::ParticleEmitter::CUBOID)\n ImGui::DraggableVec3(\"Size\", particleEmitter->size);\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>Fix reference counting when selecting textures<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\/Geometry\/Model.hpp>\n#include <Engine\/Texture\/TextureAsset.hpp>\n#include <Video\/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#include <Engine\/Manager\/ParticleManager.hpp>\n#include <Engine\/Manager\/ResourceManager.hpp>\n#include <Engine\/Hymn.hpp>\n\n#include \"..\/..\/Util\/EditorSettings.hpp\"\n#include \"..\/FileSelector.hpp\"\n#include \"..\/..\/ImGui\/GuiHelpers.hpp\"\n#include \"..\/..\/Resources.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, ImGuiWindowFlags_NoResize | ImGuiWindowFlags_ShowBorders)) {\n ImGui::InputText(\"Name\", name, 128);\n entity->name = name;\n ImGui::Text(\"Transform\");\n ImGui::ShowHelpMarker(\"The entity's position, rotation and scale.\", 75.f);\n ImGui::Indent();\n ImGui::DraggableVec3(\"Position\", entity->position);\n ImGui::DraggableVec3(\"Rotation\", entity->rotation);\n ImGui::DraggableVec3(\"Scale\", entity->scale);\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\nEntity* EntityEditor::GetEntity() {\n return entity;\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 : Resources().models) {\n if (ImGui::Selectable(model->name.c_str()))\n animation->riggedModel = dynamic_cast<Geometry::Model*>(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::DraggableVec3(\"Velocity\", physics->velocity);\n ImGui::DraggableFloat(\"Max velocity\", physics->maxVelocity, 0.0f);\n ImGui::DraggableVec3(\"Acceleration\", physics->acceleration);\n ImGui::DraggableFloat(\"Velocity drag factor\", physics->velocityDragFactor);\n ImGui::DraggableFloat(\"Gravity factor\", physics->gravityFactor);\n ImGui::Unindent();\n ImGui::Text(\"Angular\");\n ImGui::Indent();\n ImGui::DraggableVec3(\"Angular velocity\", physics->angularVelocity);\n ImGui::DraggableFloat(\"Max angular velocity\", physics->maxAngularVelocity, 0.0f);\n ImGui::DraggableVec3(\"Angular acceleration\", physics->angularAcceleration);\n ImGui::DraggableFloat(\"Angular drag factor\", physics->angularDragFactor);\n ImGui::DraggableVec3(\"Moment of inertia\", physics->momentOfInertia);\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 : Resources().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::DraggableFloat(\"Field of view\", lens->fieldOfView, 0.0f, 180.f);\n ImGui::DraggableFloat(\"Z near\", lens->zNear, 0.0f);\n ImGui::DraggableFloat(\"Z far\", lens->zFar, 0.0f);\n ImGui::Unindent();\n}\n\nvoid EntityEditor::MaterialEditor(Component::Material* material) {\n \/\/ Diffuse\n ImGui::Text(\"Diffuse\");\n ImGui::Indent();\n if (material->diffuse->GetTexture()->IsLoaded())\n ImGui::Image((void*) material->diffuse->GetTexture()->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 (TextureAsset* texture : Resources().textures) {\n if (ImGui::Selectable(texture->name.c_str())) {\n if (material->diffuse != Hymn().defaultDiffuse)\n Managers().resourceManager->FreeTextureAsset(material->diffuse);\n \n material->diffuse = Managers().resourceManager->CreateTextureAsset(texture->name);\n }\n }\n \n ImGui::EndPopup();\n }\n ImGui::Unindent();\n \n \/\/ Normal\n ImGui::Text(\"Normal\");\n ImGui::Indent();\n if (material->normal->GetTexture()->IsLoaded())\n ImGui::Image((void*) material->normal->GetTexture()->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 (TextureAsset* texture : Resources().textures) {\n if (ImGui::Selectable(texture->name.c_str())) {\n if (material->normal != Hymn().defaultNormal)\n Managers().resourceManager->FreeTextureAsset(material->normal);\n \n material->normal = Managers().resourceManager->CreateTextureAsset(texture->name);\n }\n }\n \n ImGui::EndPopup();\n }\n ImGui::Unindent();\n \n \/\/ Specular\n ImGui::Text(\"Specular\");\n ImGui::Indent();\n if (material->specular->GetTexture()->IsLoaded())\n ImGui::Image((void*) material->specular->GetTexture()->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 (TextureAsset* texture : Resources().textures) {\n if (ImGui::Selectable(texture->name.c_str())) {\n if (material->specular != Hymn().defaultSpecular)\n Managers().resourceManager->FreeTextureAsset(material->specular);\n \n material->specular = Managers().resourceManager->CreateTextureAsset(texture->name);\n }\n }\n \n ImGui::EndPopup();\n }\n ImGui::Unindent();\n \n \/\/ Glow\n ImGui::Text(\"Glow\");\n ImGui::Indent();\n if (material->glow->GetTexture()->IsLoaded())\n ImGui::Image((void*) material->glow->GetTexture()->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 (TextureAsset* texture : Resources().textures) {\n if (ImGui::Selectable(texture->name.c_str())) {\n if (material->glow != Hymn().defaultGlow)\n Managers().resourceManager->FreeTextureAsset(material->glow);\n \n material->glow = Managers().resourceManager->CreateTextureAsset(texture->name);\n }\n }\n \n ImGui::EndPopup();\n }\n ImGui::Unindent();\n}\n\nvoid EntityEditor::DirectionalLightEditor(Component::DirectionalLight* directionalLight) {\n ImGui::Indent();\n ImGui::ColorEdit3(\"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::ColorEdit3(\"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::ColorEdit3(\"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 : Resources().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::ColorEdit3(\"Color\", &particleEmitter->particleType.color[0]);\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::Unindent();\n \n ImGui::Text(\"Emitter\");\n ImGui::Indent();\n ImGui::DraggableFloat(\"Average emit time\", particleEmitter->averageEmitTime, 0.0f);\n ImGui::DraggableFloat(\"Emit time variance\", particleEmitter->emitTimeVariance, 0.0f);\n \n const char* items[] = { \"Point\", \"Cuboid\" };\n int item = static_cast<int>(particleEmitter->emitterType);\n if (ImGui::Combo(\"Emitter type\", &item, items, 2))\n particleEmitter->emitterType = static_cast<Component::ParticleEmitter::EmitterType>(item);\n \n if (particleEmitter->emitterType == Component::ParticleEmitter::CUBOID)\n ImGui::DraggableVec3(\"Size\", particleEmitter->size);\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><?hh\n\n\/*\n *\n * ____ _ _ __ __ _ __ __ ____\n * | _ \\ ___ ___| | _____| |_| \\\/ (_)_ __ ___ | \\\/ | _ \\\n * | |_) \/ _ \\ \/ __| |\/ \/ _ \\ __| |\\\/| | | '_ \\ \/ _ \\_____| |\\\/| | |_) |\n * | __\/ (_) | (__| < __\/ |_| | | | | | | | __\/_____| | | | __\/\n * |_| \\___\/ \\___|_|\\_\\___|\\__|_| |_|_|_| |_|\\___| |_| |_|_|\n *\n * This program is free software: you can redistribute it and\/or modify\n * it under the terms of the GNU 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 * @author PocketMine Team\n * @link http:\/\/www.pocketmine.net\/\n *\n *\n*\/\n\nnamespace pocketmine;\n\nabstract class Collectable extends \\Threaded implements \\Collectable{\n\n private $isGarbage = false;\n \n public function isGarbage() : bool{\n return $this->isGarbage;\n }\n\n public function setGarbage(){\n $this->isGarbage = true;\n }\n}\n<commit_msg>Delete Collectable.hh<commit_after><|endoftext|>"} {"text":"<commit_before>#include \"poke.h\"\n#include \"registerOverride.h\"\n#include <nds\/dma.h>\n#include <nds\/arm9\/video.h>\n#include <cassert>\n\n#define VRAM_F_SIZE (16*1024)\n#define VRAM_G_SIZE (16*1024)\n#define VRAM_H_SIZE (32*1024)\n#define VRAM_I_SIZE (16*1024)\n\nITCM_CODE static bool pointerInRange(volatile void *needle, volatile void *base, size_t size);\n\nITCM_CODE void Poke::Perform() {\n\tregisterOverride<uint8_t> oldVRamMode;\n\n\tif(pointerInRange(addr, VRAM_F, VRAM_F_SIZE)) {\n\t\toldVRamMode.set(&VRAM_F_CR, VRAM_F_LCD);\n\t} else if(pointerInRange(addr, VRAM_G, VRAM_G_SIZE)) {\n\t\toldVRamMode.set(&VRAM_G_CR, VRAM_G_LCD);\n\t} else if(pointerInRange(addr, VRAM_H, VRAM_H_SIZE)) {\n\t\toldVRamMode.set(&VRAM_H_CR, VRAM_H_LCD);\n\t} else if(pointerInRange(addr, VRAM_I, VRAM_I_SIZE)) {\n\t\toldVRamMode.set(&VRAM_I_CR, VRAM_I_LCD);\n\t}\n\n\tswitch(mode) {\n\tcase PM_NOOP:\n\t\tbreak;\n\tcase PM_INT:\n\t\tswitch(size) {\n\t\tcase sizeof(uint8_t) :\n\t\t\t*((volatile uint8_t*)addr) = value8;\n\t\t\tbreak;\n\t\tcase sizeof(uint16_t) :\n\t\t\t*((volatile uint16_t*)addr) = value16;\n\t\t\tbreak;\n\t\tcase sizeof(uint32_t) :\n\t\t\t*((volatile uint32_t*)addr) = value32;\n\t\t\tbreak;\n\t\tdefault:\n\t\t\tassert(0);\n\t\t}\n\t\tbreak;\n\tcase PM_BITFIELD:\n\t\tswitch(size) {\n\t\tcase sizeof(uint8_t) :\n\t\t\tbitField8.Poke((volatile uint8_t*)addr);\n\t\t\tbreak;\n\t\tcase sizeof(uint16_t) :\n\t\t\tbitField16.Poke((volatile uint16_t*)addr);\n\t\t\tbreak;\n\t\tcase sizeof(uint32_t) :\n\t\t\tbitField32.Poke((volatile uint32_t*)addr);\n\t\t\tbreak;\n\t\tdefault:\n\t\t\tassert(0);\n\t\t}\n\t\tbreak;\n\tcase PM_DMA_16:\n\t\tdmaCopyHalfWords(3, valuePtr.get(), (void*)addr, size);\n\t\tbreak;\n\tcase PM_DMA_32:\n\t\tdmaCopyWords(3, valuePtr.get(), (void*)addr, size);\n\t\tbreak;\n\tcase PM_MEMCPY_8: {\n\t\tvolatile uint8_t *src = valuePtr.get();\n\t\tstd::copy(src, src + size, (uint8_t *)addr);\n\t} break;\n\tcase PM_MEMCPY_16: {\n\t\tvolatile uint16_t *src = (volatile uint16_t *)valuePtr.get();\n\t\tstd::copy(src, src + size\/2, (uint16_t *)addr);\n\t} break;\n\tcase PM_MEMCPY_32: {\n\t\tvolatile uint32_t *src = (volatile uint32_t *)valuePtr.get();\n\t\tstd::copy(src, src + size\/4, (uint32_t *)addr);\n\t} break;\n\t}\n}\n\n\nstatic bool pointerInRange(uintptr_t needle, uintptr_t base, size_t size) {\n\treturn needle >= base && needle < (base + size);\n}\nstatic bool pointerInRange(volatile void *needle, volatile void *base, size_t size) {\n\treturn pointerInRange((uintptr_t)needle, (uintptr_t)base, size);\n}<commit_msg>Pokes should use the dma channel with the highest priority<commit_after>#include \"poke.h\"\n#include \"registerOverride.h\"\n#include <nds\/dma.h>\n#include <nds\/arm9\/video.h>\n#include <cassert>\n\n#define VRAM_F_SIZE (16*1024)\n#define VRAM_G_SIZE (16*1024)\n#define VRAM_H_SIZE (32*1024)\n#define VRAM_I_SIZE (16*1024)\n\nITCM_CODE static bool pointerInRange(volatile void *needle, volatile void *base, size_t size);\n\nITCM_CODE void Poke::Perform() {\n\tregisterOverride<uint8_t> oldVRamMode;\n\n\tif(pointerInRange(addr, VRAM_F, VRAM_F_SIZE)) {\n\t\toldVRamMode.set(&VRAM_F_CR, VRAM_F_LCD);\n\t} else if(pointerInRange(addr, VRAM_G, VRAM_G_SIZE)) {\n\t\toldVRamMode.set(&VRAM_G_CR, VRAM_G_LCD);\n\t} else if(pointerInRange(addr, VRAM_H, VRAM_H_SIZE)) {\n\t\toldVRamMode.set(&VRAM_H_CR, VRAM_H_LCD);\n\t} else if(pointerInRange(addr, VRAM_I, VRAM_I_SIZE)) {\n\t\toldVRamMode.set(&VRAM_I_CR, VRAM_I_LCD);\n\t}\n\n\tswitch(mode) {\n\tcase PM_NOOP:\n\t\tbreak;\n\tcase PM_INT:\n\t\tswitch(size) {\n\t\tcase sizeof(uint8_t) :\n\t\t\t*((volatile uint8_t*)addr) = value8;\n\t\t\tbreak;\n\t\tcase sizeof(uint16_t) :\n\t\t\t*((volatile uint16_t*)addr) = value16;\n\t\t\tbreak;\n\t\tcase sizeof(uint32_t) :\n\t\t\t*((volatile uint32_t*)addr) = value32;\n\t\t\tbreak;\n\t\tdefault:\n\t\t\tassert(0);\n\t\t}\n\t\tbreak;\n\tcase PM_BITFIELD:\n\t\tswitch(size) {\n\t\tcase sizeof(uint8_t) :\n\t\t\tbitField8.Poke((volatile uint8_t*)addr);\n\t\t\tbreak;\n\t\tcase sizeof(uint16_t) :\n\t\t\tbitField16.Poke((volatile uint16_t*)addr);\n\t\t\tbreak;\n\t\tcase sizeof(uint32_t) :\n\t\t\tbitField32.Poke((volatile uint32_t*)addr);\n\t\t\tbreak;\n\t\tdefault:\n\t\t\tassert(0);\n\t\t}\n\t\tbreak;\n\tcase PM_DMA_16:\n\t\tdmaCopyHalfWords(0, valuePtr.get(), (void*)addr, size);\n\t\tbreak;\n\tcase PM_DMA_32:\n\t\tdmaCopyWords(0, valuePtr.get(), (void*)addr, size);\n\t\tbreak;\n\tcase PM_MEMCPY_8: {\n\t\tvolatile uint8_t *src = valuePtr.get();\n\t\tstd::copy(src, src + size, (uint8_t *)addr);\n\t} break;\n\tcase PM_MEMCPY_16: {\n\t\tvolatile uint16_t *src = (volatile uint16_t *)valuePtr.get();\n\t\tstd::copy(src, src + size\/2, (uint16_t *)addr);\n\t} break;\n\tcase PM_MEMCPY_32: {\n\t\tvolatile uint32_t *src = (volatile uint32_t *)valuePtr.get();\n\t\tstd::copy(src, src + size\/4, (uint32_t *)addr);\n\t} break;\n\t}\n}\n\n\nstatic bool pointerInRange(uintptr_t needle, uintptr_t base, size_t size) {\n\treturn needle >= base && needle < (base + size);\n}\nstatic bool pointerInRange(volatile void *needle, volatile void *base, size_t size) {\n\treturn pointerInRange((uintptr_t)needle, (uintptr_t)base, size);\n}<|endoftext|>"} {"text":"<commit_before>#include \"HCUBE_Defines.h\"\n\n#include \"Experiments\/HCUBE_AtariExperiment.h\"\n#include <boost\/foreach.hpp>\n#include \"..\/..\/..\/ale_v0.1\/test.hpp\"\n\nusing namespace NEAT;\n\nnamespace HCUBE\n{\n AtariExperiment::AtariExperiment(string _experimentName,int _threadID):\n Experiment(_experimentName,_threadID), rom_file(\"\"),\n display_active(false)\n {\n substrate_width = 16;\n substrate_height = 21;\n\n layerInfo = NEAT::LayeredSubstrateInfo();\n layerInfo.layerSizes.push_back(Vector2<int>(substrate_width,substrate_height));\n layerInfo.layerIsInput.push_back(true);\n layerInfo.layerLocations.push_back(Vector3<float>(0,0,0));\n layerInfo.layerNames.push_back(\"Input\");\n\n layerInfo.layerSizes.push_back(Vector2<int>(substrate_width,substrate_height));\n layerInfo.layerIsInput.push_back(false);\n layerInfo.layerLocations.push_back(Vector3<float>(0,4,0));\n layerInfo.layerNames.push_back(\"Output\");\n\n layerInfo.layerAdjacencyList.push_back(std::pair<string,string>(\"Input\",\"Output\"));\n\n layerInfo.normalize = true;\n layerInfo.useOldOutputNames = false;\n layerInfo.layerValidSizes = layerInfo.layerSizes;\n\n substrate = NEAT::LayeredSubstrate<float>();\n substrate.setLayerInfo(layerInfo);\n\n }\n\n NEAT::GeneticPopulation* AtariExperiment::createInitialPopulation(int populationSize) {\n GeneticPopulation *population = new GeneticPopulation();\n vector<GeneticNodeGene> genes;\n\n genes.push_back(GeneticNodeGene(\"Bias\",\"NetworkSensor\",0,false));\n genes.push_back(GeneticNodeGene(\"X1\",\"NetworkSensor\",0,false));\n genes.push_back(GeneticNodeGene(\"X2\",\"NetworkSensor\",0,false));\n genes.push_back(GeneticNodeGene(\"Y1\",\"NetworkSensor\",0,false));\n genes.push_back(GeneticNodeGene(\"Y2\",\"NetworkSensor\",0,false));\n genes.push_back(GeneticNodeGene(\"Output_Input_Output\",\"NetworkOutputNode\",1,false,ACTIVATION_FUNCTION_SIGMOID));\n\n for (int a=0;a<populationSize;a++) {\n shared_ptr<GeneticIndividual> individual(new GeneticIndividual(genes,true,1.0));\n for (int b=0;b<10;b++) {\n individual->testMutate();\n }\n population->addIndividual(individual);\n }\n\n cout << \"Finished creating population\\n\";\n return population;\n }\n\n void AtariExperiment::populateSubstrate(shared_ptr<NEAT::GeneticIndividual> individual) {\n if (currentSubstrateIndividual == individual)\n return;\n\n currentSubstrateIndividual = individual;\n substrate.populateSubstrate(individual);\n }\n\n void AtariExperiment::processGroup(shared_ptr<NEAT::GeneticGeneration> generation)\n {\n static int i=0;\n \n shared_ptr<NEAT::GeneticIndividual> individual = group.front();\n individual->setFitness(10);\n\n \/\/ Print the individual\n \/\/individual->print();\n\n populateSubstrate(individual);\n\n \/\/individual->reward(100);\n runAtariEpisode(individual);\n }\n\n void AtariExperiment::runAtariEpisode(shared_ptr<NEAT::GeneticIndividual> individual) {\n \/\/ Check that rom exists and is readable\n ifstream file(rom_file.c_str());\n if (!file.good()) {\n cerr << \"Unable to find or open rom file: \\\"\" << rom_file << \"\\\"\" << endl;\n exit(-1);\n }\n\n \/\/ Initialize Atari Stuff \n initializeEmulator(rom_file.c_str(),display_active);\n MediaSource &mediasrc = theOSystem->console().mediaSource();\n int pixel_screen_width = mediasrc.width();\n int pixel_screen_height = mediasrc.height();\n for (int i=0; i<pixel_screen_height; ++i) { \/\/ Initialize our screen matrix\n IntVect row;\n for (int j=0; j<pixel_screen_width; ++j)\n row.push_back(-1);\n screen_matrix.push_back(row);\n }\n \/\/ Intialize our ram array\n for (int i=0; i<RAM_LENGTH; i++)\n ram_content.push_back(0);\n\n System* emulator_system = &theOSystem->console().system();\n controller = (InternalController*) theOSystem->getGameController();\n self_detection_agent = (SelfDetectionAgent*) controller->getPlayerAgentLeft();\n visProc = &(self_detection_agent->visProc);\n game_settings = controller->getGameSettings();\n \/\/ Initialize Atari Stuff - fin\n\n \/\/ Main Loop\n int skip_frames_num = game_settings->i_skip_frames_num;\n int frame_skip_ctr = 0;\n\n \/\/ Reset the game mutliple times\n for (int i=0; i<5; i++)\n theOSystem->applyAction(RESET); \n int delay_after_restart = game_settings->i_delay_after_restart;\n Action action = game_settings->e_first_action;\n if (action == UNDEFINED) action = PLAYER_A_NOOP;\n for (int i=0; i<delay_after_restart; i++)\n theOSystem->applyAction(action);\n time_start = time(NULL);\n bool game_ended = false;\n int frame = 0;\n float episode_reward = 0;\n while (!game_ended) {\n frame++;\n\n \/\/ Should we take an action this turn?\n bool take_action = frame_skip_ctr++ >= skip_frames_num;\n if (take_action) {\n frame_skip_ctr = 0;\n \n \/\/ Get the latest screen\n int ind_i, ind_j;\n uInt8* pi_curr_frame_buffer = mediasrc.currentFrameBuffer();\n for (int i = 0; i < pixel_screen_width * pixel_screen_height; i++) {\n uInt8 v = pi_curr_frame_buffer[i];\n ind_i = i \/ pixel_screen_width;\n ind_j = i - (ind_i * pixel_screen_width);\n screen_matrix[ind_i][ind_j] = v;\n }\n\n \/\/ Get the latest ram content\n for(int i = 0; i<RAM_LENGTH; i++) {\n int offset = i;\n offset &= 0x7f; \/\/ there are only 128 bytes\n ram_content[i] = emulator_system->peek(offset + 0x80);\n }\n\n float reward = game_settings->get_reward(&screen_matrix,&ram_content);\n episode_reward += reward;\n\n \/\/ Check if game has ended\n game_ended = game_settings->is_end_of_game(&screen_matrix,&ram_content,frame);\n\n \/\/ Get the object representation\n visProc->process_image(&screen_matrix, action);\n\n substrate.getNetwork()->reinitialize(); \/\/ Set value of all nodes to zero\n substrate.getNetwork()->dummyActivation();\n\n \/\/ Set substrate value for all objects (of a certain size)\n for (int i=0; i<visProc->obj_classes.size(); i++) {\n Prototype& proto = visProc->obj_classes[i];\n\n if (!proto.is_valid) \/\/ not a strong enough prototype yet\n continue;\n if (proto.obj_ids.size() == 0) \/\/ no obhects on screen\n continue;\n\n \/\/ Map object classes to values\n \/\/float assigned_value = proto.value;\n float assigned_value = 0;\n if (proto.size == 41) \/\/ HACK: Hardcoded mapping from object classes to values\n assigned_value = 2;\n else if (proto.size == 42)\n assigned_value = -1;\n\n \/\/ Assign values to each of the objects\n for (set<long>::iterator it=proto.obj_ids.begin(); it!=proto.obj_ids.end(); it++) {\n long obj_id = *it;\n assert(visProc->composite_objs.find(obj_id) != visProc->composite_objs.end());\n point obj_centroid = visProc->composite_objs[obj_id].get_centroid();\n int adj_x = obj_centroid.x * substrate_width \/ pixel_screen_width;\n int adj_y = obj_centroid.y * substrate_height \/ pixel_screen_height;\n substrate.setValue((Node(adj_x,adj_y,0)),assigned_value);\n }\n }\n\n \/\/ Set substrate value for self\n point self_centroid = visProc->get_self_centroid();\n int self_x = -1, self_y = -1;\n if (self_centroid.x >= 0 && self_centroid.y >= 0) {\n self_x = self_centroid.x * substrate_width \/ pixel_screen_width;\n self_y = self_centroid.y * substrate_height \/ pixel_screen_height;\n substrate.setValue(Node(self_x,self_y,0),1.0);\n }\n\n \/\/ for (int y=0; y<substrate_height; ++y) {\n \/\/ for (int x=0; x<substrate_width; ++x) {\n \/\/ float val = substrate.getValue(Node(x,y,0));\n \/\/ printf(\"%1.0f \",val);\n \/\/ }\n \/\/ printf(\"\\n\");\n \/\/ }\n \/\/ printf(\"\\n\");\n \/\/ cin.get();\n\n substrate.getNetwork()->update();\n\n \/\/ Choose which action to take\n float noop_val = substrate.getValue((Node(self_x,self_y,1)));\n float up_val = (self_y <= 0) ? noop_val : substrate.getValue((Node(self_x,self_y-1,1)));\n float down_val = (self_y >= substrate_height-1) ? noop_val : substrate.getValue((Node(self_x,self_y+1,1)));\n float left_val = (self_x <= 0) ? noop_val : substrate.getValue((Node(self_x-1,self_y,1)));\n float right_val= (self_x >= substrate_width-1) ? noop_val : substrate.getValue((Node(self_x+1,self_y,1)));\n\n ActionVect *allowed_actions = game_settings->pv_possible_actions;\n Action actionIds[] = {PLAYER_A_NOOP,PLAYER_A_UP,PLAYER_A_DOWN,PLAYER_A_LEFT,PLAYER_A_RIGHT};\n float action_vals[] = {noop_val,up_val,down_val,left_val,right_val};\n \n int max_id = 0; \/\/ all games should have noop\n float max_val = action_vals[0];\n int size = sizeof(actionIds) \/ sizeof(Action);\n for (int i=1; i < size; i++) {\n if (action_vals[i] > max_val && \n std::find(allowed_actions->begin(), allowed_actions->end(), actionIds[i]) != allowed_actions->end()) {\n max_val = action_vals[i];\n max_id = i;\n }\n }\n\n action = actionIds[max_id];\n\n \/\/ Display the screen\n if (display_active)\n display_screen(screen_matrix);\n }\n\n \/\/ Apply action to simulator and update the simulator\n theOSystem->applyAction(action);\n \n if (frame % 1000 == 0) {\n time_end = time(NULL);\n double avg = ((double)frame)\/(time_end - time_start);\n cerr << \"Average main loop iterations per sec = \" << avg << endl;\n }\n }\n\n \/\/ Give the reward to the agent\n individual->reward(episode_reward);\n }\n\n void AtariExperiment::preprocessIndividual(shared_ptr<NEAT::GeneticGeneration> generation,\n shared_ptr<NEAT::GeneticIndividual> individual) {\n if (individual->getNode(\"X1\") == NULL) {\n printf(\"Got blank individual\\n\");\n }\n }\n\n void AtariExperiment::processIndividualPostHoc(shared_ptr<NEAT::GeneticIndividual> individual)\n {\n \/\/ NEAT::FastNetwork<float> network = individual->spawnFastPhenotypeStack<float>();\n\n \/\/ \/\/TODO Put in userdata\n\n \/\/ double fitness = 10.0;\n \/\/ double maxFitness = 10.0;\n\n \/\/ for (int x1=0;x1<2;x1++)\n \/\/ {\n \/\/ for (int x2=0;x2<2;x2++)\n \/\/ {\n \/\/ network.reinitialize();\n\n \/\/ network.setValue(\"X1\",x1);\n \/\/ network.setValue(\"X2\",x2);\n \/\/ network.setValue(\"Bias\",0.3f);\n\n \/\/ network.update();\n\n \/\/ double value = network.getValue(\"Output\");\n\n \/\/ double expectedValue = (double)(x1 ^ x2);\n\n \/\/ fitness += (5000*(2-fabs(value-expectedValue)));\n \/\/ maxFitness += 5000*2;\n \/\/ }\n \/\/ }\n\n \/\/ cout << \"POST HOC ANALYSIS: \" << fitness << \"\/\" << maxFitness << endl;\n }\n\n Experiment* AtariExperiment::clone()\n {\n AtariExperiment* experiment = new AtariExperiment(*this);\n\n return experiment;\n }\n}\n<commit_msg>Dissallow hyperneat from taking the NOOP action.<commit_after>#include \"HCUBE_Defines.h\"\n\n#include \"Experiments\/HCUBE_AtariExperiment.h\"\n#include <boost\/foreach.hpp>\n#include \"..\/..\/..\/ale_v0.1\/test.hpp\"\n\nusing namespace NEAT;\n\nnamespace HCUBE\n{\n AtariExperiment::AtariExperiment(string _experimentName,int _threadID):\n Experiment(_experimentName,_threadID), rom_file(\"\"),\n display_active(false)\n {\n substrate_width = 16;\n substrate_height = 21;\n\n layerInfo = NEAT::LayeredSubstrateInfo();\n layerInfo.layerSizes.push_back(Vector2<int>(substrate_width,substrate_height));\n layerInfo.layerIsInput.push_back(true);\n layerInfo.layerLocations.push_back(Vector3<float>(0,0,0));\n layerInfo.layerNames.push_back(\"Input\");\n\n layerInfo.layerSizes.push_back(Vector2<int>(substrate_width,substrate_height));\n layerInfo.layerIsInput.push_back(false);\n layerInfo.layerLocations.push_back(Vector3<float>(0,4,0));\n layerInfo.layerNames.push_back(\"Output\");\n\n layerInfo.layerAdjacencyList.push_back(std::pair<string,string>(\"Input\",\"Output\"));\n\n layerInfo.normalize = true;\n layerInfo.useOldOutputNames = false;\n layerInfo.layerValidSizes = layerInfo.layerSizes;\n\n substrate = NEAT::LayeredSubstrate<float>();\n substrate.setLayerInfo(layerInfo);\n\n }\n\n NEAT::GeneticPopulation* AtariExperiment::createInitialPopulation(int populationSize) {\n GeneticPopulation *population = new GeneticPopulation();\n vector<GeneticNodeGene> genes;\n\n genes.push_back(GeneticNodeGene(\"Bias\",\"NetworkSensor\",0,false));\n genes.push_back(GeneticNodeGene(\"X1\",\"NetworkSensor\",0,false));\n genes.push_back(GeneticNodeGene(\"X2\",\"NetworkSensor\",0,false));\n genes.push_back(GeneticNodeGene(\"Y1\",\"NetworkSensor\",0,false));\n genes.push_back(GeneticNodeGene(\"Y2\",\"NetworkSensor\",0,false));\n genes.push_back(GeneticNodeGene(\"Output_Input_Output\",\"NetworkOutputNode\",1,false,ACTIVATION_FUNCTION_SIGMOID));\n\n for (int a=0;a<populationSize;a++) {\n shared_ptr<GeneticIndividual> individual(new GeneticIndividual(genes,true,1.0));\n for (int b=0;b<10;b++) {\n individual->testMutate();\n }\n population->addIndividual(individual);\n }\n\n cout << \"Finished creating population\\n\";\n return population;\n }\n\n void AtariExperiment::populateSubstrate(shared_ptr<NEAT::GeneticIndividual> individual) {\n if (currentSubstrateIndividual == individual)\n return;\n\n currentSubstrateIndividual = individual;\n substrate.populateSubstrate(individual);\n }\n\n void AtariExperiment::processGroup(shared_ptr<NEAT::GeneticGeneration> generation)\n {\n static int i=0;\n \n shared_ptr<NEAT::GeneticIndividual> individual = group.front();\n individual->setFitness(10);\n\n \/\/ Print the individual\n \/\/individual->print();\n\n populateSubstrate(individual);\n\n \/\/individual->reward(100);\n runAtariEpisode(individual);\n }\n\n void AtariExperiment::runAtariEpisode(shared_ptr<NEAT::GeneticIndividual> individual) {\n \/\/ Check that rom exists and is readable\n ifstream file(rom_file.c_str());\n if (!file.good()) {\n cerr << \"Unable to find or open rom file: \\\"\" << rom_file << \"\\\"\" << endl;\n exit(-1);\n }\n\n \/\/ Initialize Atari Stuff \n initializeEmulator(rom_file.c_str(),display_active);\n MediaSource &mediasrc = theOSystem->console().mediaSource();\n int pixel_screen_width = mediasrc.width();\n int pixel_screen_height = mediasrc.height();\n for (int i=0; i<pixel_screen_height; ++i) { \/\/ Initialize our screen matrix\n IntVect row;\n for (int j=0; j<pixel_screen_width; ++j)\n row.push_back(-1);\n screen_matrix.push_back(row);\n }\n \/\/ Intialize our ram array\n for (int i=0; i<RAM_LENGTH; i++)\n ram_content.push_back(0);\n\n System* emulator_system = &theOSystem->console().system();\n controller = (InternalController*) theOSystem->getGameController();\n self_detection_agent = (SelfDetectionAgent*) controller->getPlayerAgentLeft();\n visProc = &(self_detection_agent->visProc);\n game_settings = controller->getGameSettings();\n \/\/ Initialize Atari Stuff - fin\n\n \/\/ Main Loop\n int skip_frames_num = game_settings->i_skip_frames_num;\n int frame_skip_ctr = 0;\n\n \/\/ Reset the game mutliple times\n for (int i=0; i<5; i++)\n theOSystem->applyAction(RESET); \n int delay_after_restart = game_settings->i_delay_after_restart;\n Action action = game_settings->e_first_action;\n if (action == UNDEFINED) action = PLAYER_A_NOOP;\n for (int i=0; i<delay_after_restart; i++)\n theOSystem->applyAction(action);\n time_start = time(NULL);\n bool game_ended = false;\n int frame = 0;\n float episode_reward = 0;\n while (!game_ended) {\n frame++;\n\n \/\/ Should we take an action this turn?\n bool take_action = frame_skip_ctr++ >= skip_frames_num;\n if (take_action) {\n frame_skip_ctr = 0;\n \n \/\/ Get the latest screen\n int ind_i, ind_j;\n uInt8* pi_curr_frame_buffer = mediasrc.currentFrameBuffer();\n for (int i = 0; i < pixel_screen_width * pixel_screen_height; i++) {\n uInt8 v = pi_curr_frame_buffer[i];\n ind_i = i \/ pixel_screen_width;\n ind_j = i - (ind_i * pixel_screen_width);\n screen_matrix[ind_i][ind_j] = v;\n }\n\n \/\/ Get the latest ram content\n for(int i = 0; i<RAM_LENGTH; i++) {\n int offset = i;\n offset &= 0x7f; \/\/ there are only 128 bytes\n ram_content[i] = emulator_system->peek(offset + 0x80);\n }\n\n float reward = game_settings->get_reward(&screen_matrix,&ram_content);\n episode_reward += reward;\n\n \/\/ Check if game has ended\n game_ended = game_settings->is_end_of_game(&screen_matrix,&ram_content,frame);\n\n \/\/ Get the object representation\n visProc->process_image(&screen_matrix, action);\n\n substrate.getNetwork()->reinitialize(); \/\/ Set value of all nodes to zero\n substrate.getNetwork()->dummyActivation();\n\n \/\/ Set substrate value for all objects (of a certain size)\n for (int i=0; i<visProc->obj_classes.size(); i++) {\n Prototype& proto = visProc->obj_classes[i];\n\n if (!proto.is_valid) \/\/ not a strong enough prototype yet\n continue;\n if (proto.obj_ids.size() == 0) \/\/ no obhects on screen\n continue;\n\n \/\/ Map object classes to values\n \/\/float assigned_value = proto.value;\n float assigned_value = 0;\n if (proto.size == 41) \/\/ HACK: Hardcoded mapping from object classes to values\n assigned_value = 2;\n else if (proto.size == 42)\n assigned_value = -1;\n\n \/\/ Assign values to each of the objects\n for (set<long>::iterator it=proto.obj_ids.begin(); it!=proto.obj_ids.end(); it++) {\n long obj_id = *it;\n assert(visProc->composite_objs.find(obj_id) != visProc->composite_objs.end());\n point obj_centroid = visProc->composite_objs[obj_id].get_centroid();\n int adj_x = obj_centroid.x * substrate_width \/ pixel_screen_width;\n int adj_y = obj_centroid.y * substrate_height \/ pixel_screen_height;\n substrate.setValue((Node(adj_x,adj_y,0)),assigned_value);\n }\n }\n\n \/\/ Set substrate value for self\n point self_centroid = visProc->get_self_centroid();\n int self_x = -1, self_y = -1;\n if (self_centroid.x >= 0 && self_centroid.y >= 0) {\n self_x = self_centroid.x * substrate_width \/ pixel_screen_width;\n self_y = self_centroid.y * substrate_height \/ pixel_screen_height;\n substrate.setValue(Node(self_x,self_y,0),1.0);\n } \n\n \/\/ for (int y=0; y<substrate_height; ++y) {\n \/\/ for (int x=0; x<substrate_width; ++x) {\n \/\/ float val = substrate.getValue(Node(x,y,0));\n \/\/ printf(\"%1.0f \",val);\n \/\/ }\n \/\/ printf(\"\\n\");\n \/\/ }\n \/\/ printf(\"\\n\");\n \/\/ cin.get();\n\n substrate.getNetwork()->update();\n\n \/\/ Get possible actions\n ActionVect *allowed_actions = game_settings->pv_possible_actions;\n Action actionIds[] = {PLAYER_A_NOOP,PLAYER_A_UP,PLAYER_A_DOWN,PLAYER_A_LEFT,PLAYER_A_RIGHT};\n\n \/\/ If no self detected, take a random action.\n if (self_x < 0 || self_y < 0) {\n printf(\"Unable to detect the self. Taking random action.\\n\");\n action = (*allowed_actions)[rand() % allowed_actions->size()];\n } else {\n \/\/ Choose which action to take\n float noop_val = -1e37;\/\/substrate.getValue((Node(self_x,self_y,1)));\n float up_val = (self_y <= 0) ? noop_val : substrate.getValue((Node(self_x,self_y-1,1)));\n float down_val = (self_y >= substrate_height-1) ? noop_val : substrate.getValue((Node(self_x,self_y+1,1)));\n float left_val = (self_x <= 0) ? noop_val : substrate.getValue((Node(self_x-1,self_y,1)));\n float right_val= (self_x >= substrate_width-1) ? noop_val : substrate.getValue((Node(self_x+1,self_y,1)));\n\n float action_vals[] = {noop_val,up_val,down_val,left_val,right_val};\n \n int max_id = 0; \/\/ all games should have noop\n float max_val = action_vals[0];\n int size = sizeof(actionIds) \/ sizeof(Action);\n for (int i=1; i < size; i++) {\n if (action_vals[i] > max_val && \n std::find(allowed_actions->begin(), allowed_actions->end(), actionIds[i]) != allowed_actions->end()) {\n max_val = action_vals[i];\n max_id = i;\n }\n }\n action = actionIds[max_id];\n }\n\n \/\/ Display the screen\n if (display_active)\n display_screen(screen_matrix);\n }\n\n \/\/ Apply action to simulator and update the simulator\n theOSystem->applyAction(action);\n \n if (frame % 1000 == 0) {\n time_end = time(NULL);\n double avg = ((double)frame)\/(time_end - time_start);\n cerr << \"Average main loop iterations per sec = \" << avg << endl;\n }\n }\n\n \/\/ Give the reward to the agent\n individual->reward(episode_reward);\n }\n\n void AtariExperiment::preprocessIndividual(shared_ptr<NEAT::GeneticGeneration> generation,\n shared_ptr<NEAT::GeneticIndividual> individual) {\n if (individual->getNode(\"X1\") == NULL) {\n printf(\"Got blank individual\\n\");\n }\n }\n\n void AtariExperiment::processIndividualPostHoc(shared_ptr<NEAT::GeneticIndividual> individual)\n {\n \/\/ NEAT::FastNetwork<float> network = individual->spawnFastPhenotypeStack<float>();\n\n \/\/ \/\/TODO Put in userdata\n\n \/\/ double fitness = 10.0;\n \/\/ double maxFitness = 10.0;\n\n \/\/ for (int x1=0;x1<2;x1++)\n \/\/ {\n \/\/ for (int x2=0;x2<2;x2++)\n \/\/ {\n \/\/ network.reinitialize();\n\n \/\/ network.setValue(\"X1\",x1);\n \/\/ network.setValue(\"X2\",x2);\n \/\/ network.setValue(\"Bias\",0.3f);\n\n \/\/ network.update();\n\n \/\/ double value = network.getValue(\"Output\");\n\n \/\/ double expectedValue = (double)(x1 ^ x2);\n\n \/\/ fitness += (5000*(2-fabs(value-expectedValue)));\n \/\/ maxFitness += 5000*2;\n \/\/ }\n \/\/ }\n\n \/\/ cout << \"POST HOC ANALYSIS: \" << fitness << \"\/\" << maxFitness << endl;\n }\n\n Experiment* AtariExperiment::clone()\n {\n AtariExperiment* experiment = new AtariExperiment(*this);\n\n return experiment;\n }\n}\n<|endoftext|>"} {"text":"<commit_before>\/\/ -------------------------------------------------------------------------\n\/\/ @FileName\t\t\t:\t\tNFCWS.cpp\n\/\/ @Author\t\t\t:\t\tStone.xin\n\/\/ @Date\t\t\t\t:\t\t2016-12-22\n\/\/ @Module\t\t\t:\t\tNFCWS\n\/\/ -------------------------------------------------------------------------\n\n#include \"NFCWS.h\"\n#include <string.h>\n#include <atomic>\n\nbool NFCWS::Execute()\n{\n\tm_EndPoint.poll_one();\n\treturn false;\n}\n\nint NFCWS::Initialization(const unsigned int nMaxClient, const unsigned short nPort, const int nCpuCount)\n{\n\tmnPort = nPort;\n\tmnMaxConnect = nMaxClient;\n\tmnCpuCount = nCpuCount;\n\n\tm_EndPoint.init_asio();\n\n\tm_EndPoint.set_message_handler(std::bind(\n\t\t&NFCWS::OnMessageHandler, this,\n\t\tstd::placeholders::_1, std::placeholders::_2\n\t\t));\n\n\tm_EndPoint.set_open_handler(std::bind(\n\t\t&NFCWS::OnOpenHandler, this,\n\t\tstd::placeholders::_1));\n\n\tm_EndPoint.set_close_handler(std::bind(\n\t\t&NFCWS::OnCloseHandler, this,\n\t\tstd::placeholders::_1));\n\n\tm_EndPoint.set_fail_handler(std::bind(\n\t\t&NFCWS::OnFailHandler, this,\n\t\tstd::placeholders::_1));\n\n\tm_EndPoint.set_pong_handler(std::bind(\n\t\t&NFCWS::OnPongHandler, this,\n\t\tstd::placeholders::_1, std::placeholders::_2));\n\n\tm_EndPoint.set_interrupt_handler(std::bind(\n\t\t&NFCWS::OnInterruptHandler, this,\n\t\tstd::placeholders::_1));\n\t\n\tm_EndPoint.set_pong_timeout_handler(std::bind(\n\t\t&NFCWS::OnPongTimeOutHandler, this,\n\t\tstd::placeholders::_1, std::placeholders::_2));\n\n\n\tm_EndPoint.listen(nPort);\n\tm_EndPoint.start_accept();\n\n\treturn 0;\n}\n\nbool NFCWS::Final()\n{\n\tCloseSocketAll();\n\tm_EndPoint.stop_listening();\n\n\treturn true;\n}\n\nbool NFCWS::SendMsgToAllClient(const char * msg, const uint32_t nLen)\n{\n\tif (nLen <= 0)\n\t{\n\t\treturn false;\n\t}\n\n\tsession_list::iterator it = mmObject.begin();\n\twhile (it!=mmObject.end())\n\t{\n\t\tWSObjectPtr pWSObject = it->second;\n\t\tif (pWSObject && !pWSObject->NeedRemove())\n\t\t{\n\t\t\ttry\n\t\t\t{\n\t\t\t\tm_EndPoint.send(it->first, msg, nLen, websocketpp::frame::opcode::TEXT);\n\t\t\t}\n\t\t\tcatch (websocketpp::exception& e)\n\t\t\t{\n\t\t\t\tstd::cout<<\"websocket exception: \"<<e.what()<<std::endl;\n\t\t\t}\n\t\t}\n\t\tit++;\n\t}\n\t\n\treturn true;\n}\n\nbool NFCWS::SendMsgToClient(const char * msg, const uint32_t nLen, std::vector<websocketpp::connection_hdl> vList)\n{\n\tfor (auto vIt:vList)\n\t{\n\t\tauto pWSObject = GetNetObject(vIt);\n\t\tif (pWSObject && !pWSObject->NeedRemove())\n\t\t{\n\t\t\ttry\n\t\t\t{\n\t\t\t\tm_EndPoint.send(vIt, msg, nLen, websocketpp::frame::opcode::TEXT);\n\t\t\t\treturn true;\n\t\t\t}\n\t\t\tcatch (websocketpp::exception& e)\n\t\t\t{\n\t\t\t\tstd::cout << \"websocket exception: \" << e.what() << std::endl;\t\n\t\t\t}\n\t\t}\n\t}\n\treturn false;\n}\n\nbool NFCWS::SendMsgToClient(const char * msg, const uint32_t nLen, websocketpp::connection_hdl hd)\n{\n\tauto pWSObject = GetNetObject(hd);\n\tif (pWSObject && !pWSObject->NeedRemove())\n\t{\n\t\ttry\n\t\t{\n\t\t\tm_EndPoint.send(hd, msg, nLen, websocketpp::frame::opcode::TEXT);\n\t\t\treturn true;\n\t\t}\n\t\tcatch (websocketpp::exception& e)\n\t\t{\n\t\t\tstd::cout << \"websocket exception: \" << e.what() << std::endl;\n\t\t}\n\t}\n\treturn false;\n}\n\nbool NFCWS::AddNetObject(websocketpp::connection_hdl hd,WSObjectPtr pWSObject)\n{\n\tauto pObject = GetNetObject(hd);\n\tif (pObject)\n\t{\n\t\treturn false;\n\t}\n\tmmObject.emplace(session_list::value_type(hd,pWSObject));\n\treturn true;\n}\n\nWSObjectPtr NFCWS::GetNetObject(websocketpp::connection_hdl hd)\n{\n\tsession_list::iterator it = mmObject.find(hd);\n\tif (it == mmObject.end())\n\t{\n\t\treturn nullptr;\n\t}\n\treturn it->second;\n}\n\nvoid NFCWS::ExecuteClose()\n{\n\tfor each (auto vIt in mvRemoveObject)\n\t{\n\t\tCloseObject(vIt);\n\t}\n\tmvRemoveObject.clear();\n}\n\nbool NFCWS::CloseSocketAll()\n{\n\tsession_list::iterator it = mmObject.begin();\n\tfor (it; it != mmObject.end(); ++it)\n\t{\n\t\tmvRemoveObject.push_back(it->first);\n\t}\n\n\tExecuteClose();\n\n\tmmObject.clear();\n\n\treturn true;\n}\n\nvoid NFCWS::CloseObject(websocketpp::connection_hdl hd, int nCloseCode\/* =1000 *\/, const std::string& strCloseReason\/* =\"\" *\/)\n{\n\tm_EndPoint.close(hd, nCloseCode, strCloseReason);\n}\n\nvoid NFCWS::OnMessageHandler(websocketpp::connection_hdl hd, NFWebSockConf::message_ptr msg)\n{\n\tauto pObject = GetNetObject(hd);\n\tif (!pObject)\n\t{\n\t\treturn;\n\t}\n\n\tif (mRecvCB)\n\t{\n\t\tmRecvCB(hd,msg->get_payload());\n\t}\n}\n\nvoid NFCWS::OnOpenHandler(websocketpp::connection_hdl hd)\n{\n\tWSObjectPtr pWSObject(NF_NEW(WSObject));\n\tif (AddNetObject(hd,pWSObject))\n\t{\n\t\tif (mEventCB)\n\t\t{\n\t\t\tmEventCB(hd, NF_WS_EVENT_OPEN);\n\t\t}\n\t}\n}\n\nbool NFCWS::RemoveConnection(websocketpp::connection_hdl hd, NF_WS_EVENT evt, int nCloseCode \/* = 1000 *\/, const std::string& strCloseReason \/* = \"\" *\/)\n{\n\tsession_list::iterator it = mmObject.find(hd);\n\tif (it != mmObject.end())\n\t{\n\t\tmvRemoveObject.push_back(hd);\n\t\treturn true;\n\t}\n\treturn false;\n}\n\nvoid NFCWS::OnCloseHandler(websocketpp::connection_hdl hd)\n{\n\tRemoveConnection(hd, NF_WS_EVENT_CLOSE);\n}\n\nvoid NFCWS::OnFailHandler(websocketpp::connection_hdl hd)\n{\n\tRemoveConnection(hd, NF_WS_EVENT_FAIL);\n}\n\nvoid NFCWS::OnInterruptHandler(websocketpp::connection_hdl hd)\n{\n\tRemoveConnection(hd, NF_WS_EVENT_INTERRUPT);\n}\n\nbool NFCWS::OnPongHandler(websocketpp::connection_hdl hd, std::string str)\n{\n\treturn true;\n}\n\nvoid NFCWS::OnPongTimeOutHandler(websocketpp::connection_hdl hd, std::string str)\n{\n\tRemoveConnection(hd, NF_WS_EVENT_PONG_TIMEOUT);\n}\n<commit_msg>change for each to for loop<commit_after>\/\/ -------------------------------------------------------------------------\n\/\/ @FileName\t\t\t:\t\tNFCWS.cpp\n\/\/ @Author\t\t\t:\t\tStone.xin\n\/\/ @Date\t\t\t\t:\t\t2016-12-22\n\/\/ @Module\t\t\t:\t\tNFCWS\n\/\/ -------------------------------------------------------------------------\n\n#include \"NFCWS.h\"\n#include <string.h>\n#include <atomic>\n\nbool NFCWS::Execute()\n{\n\tm_EndPoint.poll_one();\n\treturn false;\n}\n\nint NFCWS::Initialization(const unsigned int nMaxClient, const unsigned short nPort, const int nCpuCount)\n{\n\tmnPort = nPort;\n\tmnMaxConnect = nMaxClient;\n\tmnCpuCount = nCpuCount;\n\n\tm_EndPoint.init_asio();\n\n\tm_EndPoint.set_message_handler(std::bind(\n\t\t&NFCWS::OnMessageHandler, this,\n\t\tstd::placeholders::_1, std::placeholders::_2\n\t\t));\n\n\tm_EndPoint.set_open_handler(std::bind(\n\t\t&NFCWS::OnOpenHandler, this,\n\t\tstd::placeholders::_1));\n\n\tm_EndPoint.set_close_handler(std::bind(\n\t\t&NFCWS::OnCloseHandler, this,\n\t\tstd::placeholders::_1));\n\n\tm_EndPoint.set_fail_handler(std::bind(\n\t\t&NFCWS::OnFailHandler, this,\n\t\tstd::placeholders::_1));\n\n\tm_EndPoint.set_pong_handler(std::bind(\n\t\t&NFCWS::OnPongHandler, this,\n\t\tstd::placeholders::_1, std::placeholders::_2));\n\n\tm_EndPoint.set_interrupt_handler(std::bind(\n\t\t&NFCWS::OnInterruptHandler, this,\n\t\tstd::placeholders::_1));\n\t\n\tm_EndPoint.set_pong_timeout_handler(std::bind(\n\t\t&NFCWS::OnPongTimeOutHandler, this,\n\t\tstd::placeholders::_1, std::placeholders::_2));\n\n\n\tm_EndPoint.listen(nPort);\n\tm_EndPoint.start_accept();\n\n\treturn 0;\n}\n\nbool NFCWS::Final()\n{\n\tCloseSocketAll();\n\tm_EndPoint.stop_listening();\n\n\treturn true;\n}\n\nbool NFCWS::SendMsgToAllClient(const char * msg, const uint32_t nLen)\n{\n\tif (nLen <= 0)\n\t{\n\t\treturn false;\n\t}\n\n\tsession_list::iterator it = mmObject.begin();\n\twhile (it!=mmObject.end())\n\t{\n\t\tWSObjectPtr pWSObject = it->second;\n\t\tif (pWSObject && !pWSObject->NeedRemove())\n\t\t{\n\t\t\ttry\n\t\t\t{\n\t\t\t\tm_EndPoint.send(it->first, msg, nLen, websocketpp::frame::opcode::TEXT);\n\t\t\t}\n\t\t\tcatch (websocketpp::exception& e)\n\t\t\t{\n\t\t\t\tstd::cout<<\"websocket exception: \"<<e.what()<<std::endl;\n\t\t\t}\n\t\t}\n\t\tit++;\n\t}\n\t\n\treturn true;\n}\n\nbool NFCWS::SendMsgToClient(const char * msg, const uint32_t nLen, std::vector<websocketpp::connection_hdl> vList)\n{\n\tfor (auto vIt:vList)\n\t{\n\t\tauto pWSObject = GetNetObject(vIt);\n\t\tif (pWSObject && !pWSObject->NeedRemove())\n\t\t{\n\t\t\ttry\n\t\t\t{\n\t\t\t\tm_EndPoint.send(vIt, msg, nLen, websocketpp::frame::opcode::TEXT);\n\t\t\t\treturn true;\n\t\t\t}\n\t\t\tcatch (websocketpp::exception& e)\n\t\t\t{\n\t\t\t\tstd::cout << \"websocket exception: \" << e.what() << std::endl;\t\n\t\t\t}\n\t\t}\n\t}\n\treturn false;\n}\n\nbool NFCWS::SendMsgToClient(const char * msg, const uint32_t nLen, websocketpp::connection_hdl hd)\n{\n\tauto pWSObject = GetNetObject(hd);\n\tif (pWSObject && !pWSObject->NeedRemove())\n\t{\n\t\ttry\n\t\t{\n\t\t\tm_EndPoint.send(hd, msg, nLen, websocketpp::frame::opcode::TEXT);\n\t\t\treturn true;\n\t\t}\n\t\tcatch (websocketpp::exception& e)\n\t\t{\n\t\t\tstd::cout << \"websocket exception: \" << e.what() << std::endl;\n\t\t}\n\t}\n\treturn false;\n}\n\nbool NFCWS::AddNetObject(websocketpp::connection_hdl hd,WSObjectPtr pWSObject)\n{\n\tauto pObject = GetNetObject(hd);\n\tif (pObject)\n\t{\n\t\treturn false;\n\t}\n\tmmObject.emplace(session_list::value_type(hd,pWSObject));\n\treturn true;\n}\n\nWSObjectPtr NFCWS::GetNetObject(websocketpp::connection_hdl hd)\n{\n\tsession_list::iterator it = mmObject.find(hd);\n\tif (it == mmObject.end())\n\t{\n\t\treturn nullptr;\n\t}\n\treturn it->second;\n}\n\nvoid NFCWS::ExecuteClose()\n{\n\tfor(auto vIt : mvRemoveObject)\n\t{\n\t\tCloseObject(vIt);\n\t}\n\tmvRemoveObject.clear();\n}\n\nbool NFCWS::CloseSocketAll()\n{\n\tsession_list::iterator it = mmObject.begin();\n\twhile(it != mmObject.end())\n\t{\n\t\tmvRemoveObject.push_back(it->first);\n\t\tit++;\n\t}\n\n\tExecuteClose();\n\n\tmmObject.clear();\n\n\treturn true;\n}\n\nvoid NFCWS::CloseObject(websocketpp::connection_hdl hd, int nCloseCode\/* =1000 *\/, const std::string& strCloseReason\/* =\"\" *\/)\n{\n\tm_EndPoint.close(hd, nCloseCode, strCloseReason);\n}\n\nvoid NFCWS::OnMessageHandler(websocketpp::connection_hdl hd, NFWebSockConf::message_ptr msg)\n{\n\tauto pObject = GetNetObject(hd);\n\tif (!pObject)\n\t{\n\t\treturn;\n\t}\n\n\tif (mRecvCB)\n\t{\n\t\tmRecvCB(hd,msg->get_payload());\n\t}\n}\n\nvoid NFCWS::OnOpenHandler(websocketpp::connection_hdl hd)\n{\n\tWSObjectPtr pWSObject(NF_NEW(WSObject));\n\tif (AddNetObject(hd,pWSObject))\n\t{\n\t\tif (mEventCB)\n\t\t{\n\t\t\tmEventCB(hd, NF_WS_EVENT_OPEN);\n\t\t}\n\t}\n}\n\nbool NFCWS::RemoveConnection(websocketpp::connection_hdl hd, NF_WS_EVENT evt, int nCloseCode \/* = 1000 *\/, const std::string& strCloseReason \/* = \"\" *\/)\n{\n\tsession_list::iterator it = mmObject.find(hd);\n\tif (it != mmObject.end())\n\t{\n\t\tmvRemoveObject.push_back(hd);\n\t\treturn true;\n\t}\n\treturn false;\n}\n\nvoid NFCWS::OnCloseHandler(websocketpp::connection_hdl hd)\n{\n\tRemoveConnection(hd, NF_WS_EVENT_CLOSE);\n}\n\nvoid NFCWS::OnFailHandler(websocketpp::connection_hdl hd)\n{\n\tRemoveConnection(hd, NF_WS_EVENT_FAIL);\n}\n\nvoid NFCWS::OnInterruptHandler(websocketpp::connection_hdl hd)\n{\n\tRemoveConnection(hd, NF_WS_EVENT_INTERRUPT);\n}\n\nbool NFCWS::OnPongHandler(websocketpp::connection_hdl hd, std::string str)\n{\n\treturn true;\n}\n\nvoid NFCWS::OnPongTimeOutHandler(websocketpp::connection_hdl hd, std::string str)\n{\n\tRemoveConnection(hd, NF_WS_EVENT_PONG_TIMEOUT);\n}\n<|endoftext|>"} {"text":"<commit_before>\/*\n-----------------------------------------------------------------------------\nThis source file is part of OGRE\n (Object-oriented Graphics Rendering Engine)\nFor the latest info, see http:\/\/www.ogre3d.org\/\n\nCopyright (c) 2000-2006 Torus Knot Software Ltd\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\n#include \"OgreOverlay.h\"\n#include \"OgreRoot.h\"\n#include \"OgreSceneManager.h\"\n#include \"OgreOverlayContainer.h\"\n#include \"OgreCamera.h\"\n#include \"OgreOverlayManager.h\"\n#include \"OgreQuaternion.h\"\n#include \"OgreVector3.h\"\n\n\nnamespace Ogre {\n\n \/\/---------------------------------------------------------------------\n Overlay::Overlay(const String& name) :\n mName(name),\n mRotate(0.0f), \n mScrollX(0.0f), mScrollY(0.0f),\n mScaleX(1.0f), mScaleY(1.0f), \n mTransformOutOfDate(true), mTransformUpdated(true), \n mZOrder(100), mVisible(false), mInitialised(false)\n\n {\n mRootNode = OGRE_NEW SceneNode(NULL);\n\n }\n \/\/---------------------------------------------------------------------\n Overlay::~Overlay()\n {\n OGRE_DELETE mRootNode;\n }\n \/\/---------------------------------------------------------------------\n const String& Overlay::getName(void) const\n {\n return mName;\n }\n \/\/---------------------------------------------------------------------\n void Overlay::assignZOrders()\n\t{\n\t\tushort zorder = mZOrder * 100;\n\n \/\/ Notify attached 2D elements\n OverlayContainerList::iterator i, iend;\n iend = m2DElements.end();\n for (i = m2DElements.begin(); i != iend; ++i)\n {\n zorder = (*i)->_notifyZOrder(zorder);\n }\n\t}\n \/\/---------------------------------------------------------------------\n void Overlay::setZOrder(ushort zorder)\n {\n \/\/ Limit to 650 since this is multiplied by 100 to pad out for containers\n assert (zorder <= 650 && \"Overlay ZOrder cannot be greater than 650!\");\n\n mZOrder = zorder;\n\n\t\tassignZOrders();\n }\n \/\/---------------------------------------------------------------------\n ushort Overlay::getZOrder(void) const\n {\n return mZOrder;\n }\n \/\/---------------------------------------------------------------------\n bool Overlay::isVisible(void) const\n {\n return mVisible;\n }\n \/\/---------------------------------------------------------------------\n void Overlay::show(void)\n {\n mVisible = true;\n\t\tif (!mInitialised)\n\t\t{\n\t\t\tinitialise();\n\t\t}\n }\n \/\/---------------------------------------------------------------------\n void Overlay::hide(void)\n {\n mVisible = false;\n }\n \/\/---------------------------------------------------------------------\n\tvoid Overlay::initialise(void)\n\t{\n\t\tOverlayContainerList::iterator i, iend;\n\t\tiend = m2DElements.end();\n\t\tfor (i = m2DElements.begin(); i != m2DElements.end(); ++i)\n\t\t{\n\t\t\t(*i)->initialise();\n\t\t}\n\t\tmInitialised = true;\n\t}\n\t\/\/---------------------------------------------------------------------\n void Overlay::add2D(OverlayContainer* cont)\n {\n m2DElements.push_back(cont);\n \/\/ Notify parent\n cont->_notifyParent(0, this);\n\n\t\tassignZOrders();\n\n Matrix4 xform;\n _getWorldTransforms(&xform);\n cont->_notifyWorldTransforms(xform);\n cont->_notifyViewport();\n }\n \/\/---------------------------------------------------------------------\n void Overlay::remove2D(OverlayContainer* cont)\n {\n m2DElements.remove(cont);\n\t\tassignZOrders();\n }\n \/\/---------------------------------------------------------------------\n void Overlay::add3D(SceneNode* node)\n {\n mRootNode->addChild(node);\n }\n \/\/---------------------------------------------------------------------\n void Overlay::remove3D(SceneNode* node)\n {\n mRootNode->removeChild(node->getName());\n }\n \/\/---------------------------------------------------------------------\n void Overlay::clear(void)\n {\n mRootNode->removeAllChildren();\n m2DElements.clear();\n \/\/ Note no deallocation, memory handled by OverlayManager & SceneManager\n }\n \/\/---------------------------------------------------------------------\n void Overlay::setScroll(Real x, Real y)\n {\n mScrollX = x;\n mScrollY = y;\n mTransformOutOfDate = true;\n mTransformUpdated = true;\n }\n \/\/---------------------------------------------------------------------\n Real Overlay::getScrollX(void) const\n {\n return mScrollX;\n }\n \/\/---------------------------------------------------------------------\n Real Overlay::getScrollY(void) const\n {\n return mScrollY;\n }\n \/\/---------------------------------------------------------------------\n OverlayContainer* Overlay::getChild(const String& name)\n {\n\n OverlayContainerList::iterator i, iend;\n iend = m2DElements.end();\n for (i = m2DElements.begin(); i != iend; ++i)\n {\n if ((*i)->getName() == name)\n\t\t\t{\n\t\t\t\treturn *i;\n\n\t\t\t}\n }\n return NULL;\n }\n \/\/---------------------------------------------------------------------\n void Overlay::scroll(Real xoff, Real yoff)\n {\n mScrollX += xoff;\n mScrollY += yoff;\n mTransformOutOfDate = true;\n mTransformUpdated = true;\n }\n \/\/---------------------------------------------------------------------\n void Overlay::setRotate(const Radian& angle)\n {\n mRotate = angle;\n mTransformOutOfDate = true;\n mTransformUpdated = true;\n }\n \/\/---------------------------------------------------------------------\n void Overlay::rotate(const Radian& angle)\n {\n setRotate(mRotate + angle);\n }\n \/\/---------------------------------------------------------------------\n void Overlay::setScale(Real x, Real y)\n {\n mScaleX = x;\n mScaleY = y;\n mTransformOutOfDate = true;\n mTransformUpdated = true;\n }\n \/\/---------------------------------------------------------------------\n Real Overlay::getScaleX(void) const\n {\n return mScaleX;\n }\n \/\/---------------------------------------------------------------------\n Real Overlay::getScaleY(void) const\n {\n return mScaleY;\n }\n \/\/---------------------------------------------------------------------\n void Overlay::_getWorldTransforms(Matrix4* xform) const\n {\n if (mTransformOutOfDate)\n {\n updateTransform();\n }\n *xform = mTransform;\n\n }\n \/\/---------------------------------------------------------------------\n void Overlay::_findVisibleObjects(Camera* cam, RenderQueue* queue)\n {\n OverlayContainerList::iterator i, iend;\n\n if (OverlayManager::getSingleton().hasViewportChanged())\n {\n iend = m2DElements.end();\n for (i = m2DElements.begin(); i != iend; ++i)\n {\n (*i)->_notifyViewport();\n }\n }\n\n \/\/ update elements\n if (mTransformUpdated)\n {\n OverlayContainerList::iterator i, iend;\n Matrix4 xform;\n\n _getWorldTransforms(&xform);\n iend = m2DElements.end();\n for (i = m2DElements.begin(); i != iend; ++i)\n {\n (*i)->_notifyWorldTransforms(xform);\n }\n\n mTransformUpdated = false;\n }\n\n if (mVisible)\n {\n \/\/ Add 3D elements\n mRootNode->setPosition(cam->getDerivedPosition());\n mRootNode->setOrientation(cam->getDerivedOrientation());\n mRootNode->_update(true, false);\n \/\/ Set up the default queue group for the objects about to be added\n uint8 oldgrp = queue->getDefaultQueueGroup();\n ushort oldPriority = queue-> getDefaultRenderablePriority();\n queue->setDefaultQueueGroup(RENDER_QUEUE_OVERLAY);\n queue->setDefaultRenderablePriority((mZOrder*100)-1);\n mRootNode->_findVisibleObjects(cam, queue, NULL, true, false);\n \/\/ Reset the group\n queue->setDefaultQueueGroup(oldgrp);\n queue->setDefaultRenderablePriority(oldPriority);\n \/\/ Add 2D elements\n iend = m2DElements.end();\n for (i = m2DElements.begin(); i != iend; ++i)\n {\n (*i)->_update();\n\n (*i)->_updateRenderQueue(queue);\n }\n }\n\n\n\n \n }\n \/\/---------------------------------------------------------------------\n void Overlay::updateTransform(void) const\n {\n \/\/ Ordering:\n \/\/ 1. Scale\n \/\/ 2. Rotate\n \/\/ 3. Translate\n\n Matrix3 rot3x3, scale3x3;\n rot3x3.FromEulerAnglesXYZ(Radian(0),Radian(0),mRotate);\n scale3x3 = Matrix3::ZERO;\n scale3x3[0][0] = mScaleX;\n scale3x3[1][1] = mScaleY;\n scale3x3[2][2] = 1.0f;\n\n mTransform = Matrix4::IDENTITY;\n mTransform = rot3x3 * scale3x3;\n mTransform.setTrans(Vector3(mScrollX, mScrollY, 0));\n\n mTransformOutOfDate = false;\n }\n \/\/---------------------------------------------------------------------\n\tOverlayElement* Overlay::findElementAt(Real x, Real y)\n\t{\n\t\tOverlayElement* ret = NULL;\n\t\tint currZ = -1;\n OverlayContainerList::iterator i, iend;\n iend = m2DElements.end();\n for (i = m2DElements.begin(); i != iend; ++i)\n {\n\t\t\tint z = (*i)->getZOrder();\n\t\t\tif (z > currZ)\n\t\t\t{\n\t\t\t\tOverlayElement* elementFound = (*i)->findElementAt(x,y);\n\t\t\t\tif(elementFound)\n\t\t\t\t{\n\t\t\t\t\tcurrZ = elementFound->getZOrder();\n\t\t\t\t\tret = elementFound;\n\t\t\t\t}\n\t\t\t}\n }\n\t\treturn ret;\n\t}\n\n}\n\n<commit_msg>Notify child overlay containers when an overlay is destroyed<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\n#include \"OgreOverlay.h\"\n#include \"OgreRoot.h\"\n#include \"OgreSceneManager.h\"\n#include \"OgreOverlayContainer.h\"\n#include \"OgreCamera.h\"\n#include \"OgreOverlayManager.h\"\n#include \"OgreQuaternion.h\"\n#include \"OgreVector3.h\"\n\n\nnamespace Ogre {\n\n \/\/---------------------------------------------------------------------\n Overlay::Overlay(const String& name) :\n mName(name),\n mRotate(0.0f), \n mScrollX(0.0f), mScrollY(0.0f),\n mScaleX(1.0f), mScaleY(1.0f), \n mTransformOutOfDate(true), mTransformUpdated(true), \n mZOrder(100), mVisible(false), mInitialised(false)\n\n {\n mRootNode = OGRE_NEW SceneNode(NULL);\n\n }\n \/\/---------------------------------------------------------------------\n Overlay::~Overlay()\n {\n\t\t\/\/ remove children\n\n OGRE_DELETE mRootNode;\n\t\t\n\t\tfor (OverlayContainerList::iterator i = m2DElements.begin(); \n\t\t\t i != m2DElements.end(); ++i)\n\t\t{\n\t\t\t(*i)->_notifyParent(0, 0);\n\t\t}\n }\n \/\/---------------------------------------------------------------------\n const String& Overlay::getName(void) const\n {\n return mName;\n }\n \/\/---------------------------------------------------------------------\n void Overlay::assignZOrders()\n\t{\n\t\tushort zorder = mZOrder * 100;\n\n \/\/ Notify attached 2D elements\n OverlayContainerList::iterator i, iend;\n iend = m2DElements.end();\n for (i = m2DElements.begin(); i != iend; ++i)\n {\n zorder = (*i)->_notifyZOrder(zorder);\n }\n\t}\n \/\/---------------------------------------------------------------------\n void Overlay::setZOrder(ushort zorder)\n {\n \/\/ Limit to 650 since this is multiplied by 100 to pad out for containers\n assert (zorder <= 650 && \"Overlay ZOrder cannot be greater than 650!\");\n\n mZOrder = zorder;\n\n\t\tassignZOrders();\n }\n \/\/---------------------------------------------------------------------\n ushort Overlay::getZOrder(void) const\n {\n return mZOrder;\n }\n \/\/---------------------------------------------------------------------\n bool Overlay::isVisible(void) const\n {\n return mVisible;\n }\n \/\/---------------------------------------------------------------------\n void Overlay::show(void)\n {\n mVisible = true;\n\t\tif (!mInitialised)\n\t\t{\n\t\t\tinitialise();\n\t\t}\n }\n \/\/---------------------------------------------------------------------\n void Overlay::hide(void)\n {\n mVisible = false;\n }\n \/\/---------------------------------------------------------------------\n\tvoid Overlay::initialise(void)\n\t{\n\t\tOverlayContainerList::iterator i, iend;\n\t\tiend = m2DElements.end();\n\t\tfor (i = m2DElements.begin(); i != m2DElements.end(); ++i)\n\t\t{\n\t\t\t(*i)->initialise();\n\t\t}\n\t\tmInitialised = true;\n\t}\n\t\/\/---------------------------------------------------------------------\n void Overlay::add2D(OverlayContainer* cont)\n {\n m2DElements.push_back(cont);\n \/\/ Notify parent\n cont->_notifyParent(0, this);\n\n\t\tassignZOrders();\n\n Matrix4 xform;\n _getWorldTransforms(&xform);\n cont->_notifyWorldTransforms(xform);\n cont->_notifyViewport();\n }\n \/\/---------------------------------------------------------------------\n void Overlay::remove2D(OverlayContainer* cont)\n {\n m2DElements.remove(cont);\n\t\tcont->_notifyParent(0, 0);\n\t\tassignZOrders();\n }\n \/\/---------------------------------------------------------------------\n void Overlay::add3D(SceneNode* node)\n {\n mRootNode->addChild(node);\n }\n \/\/---------------------------------------------------------------------\n void Overlay::remove3D(SceneNode* node)\n {\n mRootNode->removeChild(node->getName());\n }\n \/\/---------------------------------------------------------------------\n void Overlay::clear(void)\n {\n mRootNode->removeAllChildren();\n m2DElements.clear();\n \/\/ Note no deallocation, memory handled by OverlayManager & SceneManager\n }\n \/\/---------------------------------------------------------------------\n void Overlay::setScroll(Real x, Real y)\n {\n mScrollX = x;\n mScrollY = y;\n mTransformOutOfDate = true;\n mTransformUpdated = true;\n }\n \/\/---------------------------------------------------------------------\n Real Overlay::getScrollX(void) const\n {\n return mScrollX;\n }\n \/\/---------------------------------------------------------------------\n Real Overlay::getScrollY(void) const\n {\n return mScrollY;\n }\n \/\/---------------------------------------------------------------------\n OverlayContainer* Overlay::getChild(const String& name)\n {\n\n OverlayContainerList::iterator i, iend;\n iend = m2DElements.end();\n for (i = m2DElements.begin(); i != iend; ++i)\n {\n if ((*i)->getName() == name)\n\t\t\t{\n\t\t\t\treturn *i;\n\n\t\t\t}\n }\n return NULL;\n }\n \/\/---------------------------------------------------------------------\n void Overlay::scroll(Real xoff, Real yoff)\n {\n mScrollX += xoff;\n mScrollY += yoff;\n mTransformOutOfDate = true;\n mTransformUpdated = true;\n }\n \/\/---------------------------------------------------------------------\n void Overlay::setRotate(const Radian& angle)\n {\n mRotate = angle;\n mTransformOutOfDate = true;\n mTransformUpdated = true;\n }\n \/\/---------------------------------------------------------------------\n void Overlay::rotate(const Radian& angle)\n {\n setRotate(mRotate + angle);\n }\n \/\/---------------------------------------------------------------------\n void Overlay::setScale(Real x, Real y)\n {\n mScaleX = x;\n mScaleY = y;\n mTransformOutOfDate = true;\n mTransformUpdated = true;\n }\n \/\/---------------------------------------------------------------------\n Real Overlay::getScaleX(void) const\n {\n return mScaleX;\n }\n \/\/---------------------------------------------------------------------\n Real Overlay::getScaleY(void) const\n {\n return mScaleY;\n }\n \/\/---------------------------------------------------------------------\n void Overlay::_getWorldTransforms(Matrix4* xform) const\n {\n if (mTransformOutOfDate)\n {\n updateTransform();\n }\n *xform = mTransform;\n\n }\n \/\/---------------------------------------------------------------------\n void Overlay::_findVisibleObjects(Camera* cam, RenderQueue* queue)\n {\n OverlayContainerList::iterator i, iend;\n\n if (OverlayManager::getSingleton().hasViewportChanged())\n {\n iend = m2DElements.end();\n for (i = m2DElements.begin(); i != iend; ++i)\n {\n (*i)->_notifyViewport();\n }\n }\n\n \/\/ update elements\n if (mTransformUpdated)\n {\n OverlayContainerList::iterator i, iend;\n Matrix4 xform;\n\n _getWorldTransforms(&xform);\n iend = m2DElements.end();\n for (i = m2DElements.begin(); i != iend; ++i)\n {\n (*i)->_notifyWorldTransforms(xform);\n }\n\n mTransformUpdated = false;\n }\n\n if (mVisible)\n {\n \/\/ Add 3D elements\n mRootNode->setPosition(cam->getDerivedPosition());\n mRootNode->setOrientation(cam->getDerivedOrientation());\n mRootNode->_update(true, false);\n \/\/ Set up the default queue group for the objects about to be added\n uint8 oldgrp = queue->getDefaultQueueGroup();\n ushort oldPriority = queue-> getDefaultRenderablePriority();\n queue->setDefaultQueueGroup(RENDER_QUEUE_OVERLAY);\n queue->setDefaultRenderablePriority((mZOrder*100)-1);\n mRootNode->_findVisibleObjects(cam, queue, NULL, true, false);\n \/\/ Reset the group\n queue->setDefaultQueueGroup(oldgrp);\n queue->setDefaultRenderablePriority(oldPriority);\n \/\/ Add 2D elements\n iend = m2DElements.end();\n for (i = m2DElements.begin(); i != iend; ++i)\n {\n (*i)->_update();\n\n (*i)->_updateRenderQueue(queue);\n }\n }\n\n\n\n \n }\n \/\/---------------------------------------------------------------------\n void Overlay::updateTransform(void) const\n {\n \/\/ Ordering:\n \/\/ 1. Scale\n \/\/ 2. Rotate\n \/\/ 3. Translate\n\n Matrix3 rot3x3, scale3x3;\n rot3x3.FromEulerAnglesXYZ(Radian(0),Radian(0),mRotate);\n scale3x3 = Matrix3::ZERO;\n scale3x3[0][0] = mScaleX;\n scale3x3[1][1] = mScaleY;\n scale3x3[2][2] = 1.0f;\n\n mTransform = Matrix4::IDENTITY;\n mTransform = rot3x3 * scale3x3;\n mTransform.setTrans(Vector3(mScrollX, mScrollY, 0));\n\n mTransformOutOfDate = false;\n }\n \/\/---------------------------------------------------------------------\n\tOverlayElement* Overlay::findElementAt(Real x, Real y)\n\t{\n\t\tOverlayElement* ret = NULL;\n\t\tint currZ = -1;\n OverlayContainerList::iterator i, iend;\n iend = m2DElements.end();\n for (i = m2DElements.begin(); i != iend; ++i)\n {\n\t\t\tint z = (*i)->getZOrder();\n\t\t\tif (z > currZ)\n\t\t\t{\n\t\t\t\tOverlayElement* elementFound = (*i)->findElementAt(x,y);\n\t\t\t\tif(elementFound)\n\t\t\t\t{\n\t\t\t\t\tcurrZ = elementFound->getZOrder();\n\t\t\t\t\tret = elementFound;\n\t\t\t\t}\n\t\t\t}\n }\n\t\treturn ret;\n\t}\n\n}\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\n#include \"..\/Node_test.h\"\n#include <SofaTest\/Sofa_test.h>\n#include <SceneCreator\/SceneCreator.h>\n#include <sofa\/simulation\/Visitor.h>\n#include <SofaSimulationGraph\/DAGNode.h>\n#include <SofaSimulationGraph\/DAGSimulation.h>\n\nusing sofa::simulation::graph::DAGNode;\n\nnamespace sofa {\n\nusing namespace modeling;\nusing namespace simulation;\n\n\n\/** Check the traversal of a Directed Acyclic Graph.\n * The traversal order is recorded in a string, and compared with an expected one.\n * @author Francois Faure, Matthieu Nesme @date 2014\n *\/\nstruct DAG_test : public Sofa_test<>\n{\n DAG_test()\n {\n sofa::simulation::setSimulation(new simulation::graph::DAGSimulation());\n }\n\n\n \/**\n * The TestVisitor struct records the name of the traversed nodes in a string.\n * The string can be analyzed as a trace of the traversal.\n *\/\n struct TestVisitor: public sofa::simulation::Visitor\n {\n\n std::string visited, topdown, bottomup;\n bool tree; \/\/ enforce tree traversal\n TreeTraversalRepetition repeat; \/\/ repeat callbacks\n\n TestVisitor()\n : Visitor(sofa::core::ExecParams::defaultInstance() )\n , tree( false )\n , repeat( NO_REPETITION )\n {\n clear();\n }\n\n void clear()\n {\n visited.clear();\n topdown.clear();\n bottomup.clear();\n }\n\n Result processNodeTopDown(simulation::Node* node)\n {\n visited += node->getName();\n topdown += node->getName();\n return RESULT_CONTINUE;\n }\n\n void processNodeBottomUp(simulation::Node* node)\n {\n visited += node->getName();\n bottomup += node->getName();\n }\n\n bool treeTraversal(TreeTraversalRepetition& r) { r=repeat; return tree; }\n\n };\n\n\n\n \/\/\/ utility function testing a scene graph traversals with given expected results\n static void traverse_test( Node::SPtr node, std::string treeTraverse, std::string treeTraverseRepeatAll, std::string treeTraverseRepeatOnce, std::string dagTopDown )\n {\n \/\/ dagBottumUp must be the exact inverse of dagTopDown\n std::string dagBottomUp(dagTopDown);\n std::reverse(dagBottomUp.begin(), dagBottomUp.end());\n\n TestVisitor t;\n\n t.tree = true; \/\/ visitor as TREE traversal w\/o repetition\n t.execute( node.get() );\n \/\/ cout<<\"traverse_simple_tree: visited = \" << t.visited << endl;\n if( t.visited != treeTraverse ){\n ADD_FAILURE() << \"Dag_test::traverse_test treeTraverse: wrong traversal order, expected \"<<treeTraverse<<\", got \" << t.visited;\n }\n t.clear();\n t.repeat = simulation::Visitor::REPEAT_ALL; \/\/ visitor as TREE traversal with repetitions\n t.execute( node.get() );\n \/\/ cout<<\"traverse_simple_tree: visited = \" << t.visited << endl;\n if( t.visited != treeTraverseRepeatAll ){\n ADD_FAILURE() << \"Dag_test::traverse_test treeTraverseRepeatAll: wrong traversal order, expected \"<<treeTraverseRepeatAll<<\", got \" << t.visited;\n }\n t.clear();\n t.repeat = simulation::Visitor::REPEAT_ONCE; \/\/ visitor as TREE traversal with first repetition\n t.execute( node.get() );\n \/\/ cout<<\"traverse_simple_tree: visited = \" << t.visited << endl;\n if( t.visited != treeTraverseRepeatOnce ){\n ADD_FAILURE() << \"Dag_test::traverse_test treeTraverseRepeatOnce: wrong traversal order, expected \"<<treeTraverseRepeatOnce<<\", got \" << t.visited;\n }\n\n t.clear();\n t.tree = false; \/\/ visitor as DAG traversal\n t.execute(node.get());\n \/\/ cout<<\"traverse_test: visited = \" << t.visited << endl;\n if( t.topdown != dagTopDown ){\n ADD_FAILURE() << \"Dag_test::traverse_test dagTopDown: wrong traversal order, expected \"<<dagTopDown<<\", got \" << t.topdown;\n }\n if( t.bottomup != dagBottomUp ){\n ADD_FAILURE() << \"Dag_test::traverse_test dagBottomUp: wrong traversal order, expected \"<<dagBottomUp<<\", got \" << t.bottomup;\n }\n\n\n\/\/ sofa::simulation::getSimulation()->print(node.get());\n }\n\n\n \/**\n * @brief The root and two children:\n\\f$\n\\begin{array}{ccc}\n & R & \\\\\n \\diagup & & \\diagdown \\\\\n A & & B\n\\end{array}\n\\f$\nExpected output: RAABBR\n *\/\n void traverse_simple_tree()\n {\n Node::SPtr root = clearScene();\n root->setName(\"R\");\n root->createChild(\"A\");\n root->createChild(\"B\");\n\n traverse_test( root, \"RAABBR\", \"RAABBR\", \"RAABBR\", \"RAB\" );\n }\n\n\n \/**\n * @brief Diamond-shaped graph:\n\\f$\n\\begin{array}{ccc}\n & R & \\\\\n \\diagup & & \\diagdown \\\\\n A & & B \\\\\n \\diagdown & & \\diagup \\\\\n & C\n\\end{array}\n\\f$\nExpected output: RABCCBAR\n *\/\n void traverse_simple_diamond()\n {\n Node::SPtr root = clearScene();\n root->setName(\"R\");\n Node::SPtr A = root->createChild(\"A\");\n Node::SPtr B = root->createChild(\"B\");\n Node::SPtr C = A->createChild(\"C\");\n B->addChild(C);\n\n traverse_test( root, \"RACCABBR\", \"RACCABCCBR\", \"RACCABCCBR\", \"RABC\" );\n }\n\n\n\/**\n * @brief More complex graph:\n\n R__\n \/ \\ \\\n A B |\n \\ \/ |\n C \/\n \\ \/\n D\n |\n E\n\nExpected output: RABCDEEDCBAR\n *\/\n void traverse_complex()\n {\n Node::SPtr root = clearScene();\n root->setName(\"R\");\n Node::SPtr A = root->createChild(\"A\");\n Node::SPtr B = root->createChild(\"B\");\n Node::SPtr C = A->createChild(\"C\");\n B->addChild(C);\n Node::SPtr D = C->createChild(\"D\");\n root->addChild(D);\n Node::SPtr E = D->createChild(\"E\");\n\n traverse_test( root, \"RACDEEDCABBR\", \"RACDEEDCABCDEEDCBDEEDR\", \"RACDEEDCABCCBDDR\", \"RABCDE\" );\n }\n\n\n\/**\n * @brief Even more complex graph:\n\n R__\n \/ \\ \\\n A B C\n \\\/ \\|\n D E\n | |\n F G\n\n *\/\n void traverse_morecomplex()\n {\n Node::SPtr root = clearScene();\n root->setName(\"R\");\n Node::SPtr A = root->createChild(\"A\");\n Node::SPtr B = root->createChild(\"B\");\n Node::SPtr C = root->createChild(\"C\");\n Node::SPtr D = A->createChild(\"D\");\n B->addChild(D);\n Node::SPtr E = B->createChild(\"E\");\n C->addChild(E);\n Node::SPtr F = D->createChild(\"F\");\n Node::SPtr G = E->createChild(\"G\");\n\n traverse_test( root, \"RADFFDABEGGEBCCR\", \"RADFFDABDFFDEGGEBCEGGECR\", \"RADFFDABDDEGGEBCEECR\", \"RABDFCEG\" );\n }\n\n\n\/**\n * @brief another complex case\n\n R______\n \/ \\ \\ \\ \\\n A B C D E\n \\\/__\/_\/_\/\n F\n |\\\n G |\n |\/\n H\n\n *\/\n void traverse_morecomplex2()\n {\n Node::SPtr root = clearScene();\n root->setName(\"R\");\n Node::SPtr A = root->createChild(\"A\");\n Node::SPtr B = root->createChild(\"B\");\n Node::SPtr C = root->createChild(\"C\");\n Node::SPtr D = root->createChild(\"D\");\n Node::SPtr E = root->createChild(\"E\");\n Node::SPtr F = A->createChild(\"F\");\n B->addChild(F);\n C->addChild(F);\n D->addChild(F);\n E->addChild(F);\n Node::SPtr G = F->createChild(\"G\");\n Node::SPtr H = G->createChild(\"H\");\n F->addChild(H);\n\n traverse_test( root, \"RAFGHHGFABBCCDDEER\",\n \"RAFGHHGHHFABFGHHGHHFBCFGHHGHHFCDFGHHGHHFDEFGHHGHHFER\",\n \"RAFGHHGHHFABFFBCFFCDFFDEFFER\",\n \"RABCDEFGH\" );\n }\n\n\n\n static void getObjectByPath( Node::SPtr node, const std::string& searchpath, const std::string& objpath )\n {\n void *foundObj = node->getObject(classid(Dummy), searchpath);\n ASSERT_TRUE( foundObj!=nullptr );\n Dummy* dummyObj = reinterpret_cast<Dummy*>(foundObj);\n ASSERT_TRUE( dummyObj!=nullptr );\n EXPECT_STREQ( objpath.c_str(), dummyObj->getPathName().c_str() );\n }\n\n\n\n void getObject()\n {\n Node::SPtr A = clearScene();\n A->setName(\"A\");\n\n Node::SPtr B = A->createChild(\"B\");\n Node::SPtr C = A->createChild(\"C\");\n Node::SPtr D = B->createChild(\"D\");\n C->addChild(D);\n Node::SPtr E = D->createChild(\"E\");\n\n\/**\n A\n \/ \\\n B C\n \\ \/\n D\n |\n E\n*\/\/\n\n Dummy::SPtr dummyA = sofa::core::objectmodel::New<Dummy>(\"obj\");\n A->addObject(dummyA);\n Dummy::SPtr dummyA2 = sofa::core::objectmodel::New<Dummy>(\"obj2\");\n A->addObject(dummyA2);\n Dummy::SPtr dummyB = sofa::core::objectmodel::New<Dummy>(\"obj\");\n B->addObject(dummyB);\n Dummy::SPtr dummyC = sofa::core::objectmodel::New<Dummy>(\"obj\");\n C->addObject(dummyC);\n Dummy::SPtr dummyD = sofa::core::objectmodel::New<Dummy>(\"obj\");\n D->addObject(dummyD);\n Dummy::SPtr dummyE = sofa::core::objectmodel::New<Dummy>(\"obj\");\n E->addObject(dummyE);\n\n\n\n \/\/ by path\n {\n void* foundObj = A->getObject(classid(Dummy), \"\/inexisting\");\n ASSERT_TRUE( foundObj==nullptr );\n }\n\n getObjectByPath( A, \"\/obj\", \"\/obj\" );\n getObjectByPath( A, \"obj\", \"\/obj\" );\n getObjectByPath( A, \"\/B\/obj\", \"\/B\/obj\" );\n getObjectByPath( A, \"C\/obj\", \"\/C\/obj\" );\n getObjectByPath( A, \"\/B\/D\/obj\", \"\/B\/D\/obj\" );\n getObjectByPath( A, \"C\/D\/obj\", \"\/B\/D\/obj\" );\n getObjectByPath( A, \"\/B\/D\/E\/obj\", \"\/B\/D\/E\/obj\" );\n getObjectByPath( A, \"C\/D\/E\/obj\", \"\/B\/D\/E\/obj\" );\n getObjectByPath( B, \"obj\", \"\/B\/obj\" );\n getObjectByPath( C, \"D\/E\/obj\", \"\/B\/D\/E\/obj\" );\n getObjectByPath( A, \"\/obj2\", \"\/obj2\" );\n getObjectByPath( A, \"obj2\", \"\/obj2\" );\n\n\n \/\/ TODO test other getObject{s} functions\n\n\n\n }\n\n\n};\n\n\n\nTEST_F( DAG_test, traverse )\n{\n traverse_simple_tree();\n traverse_simple_diamond();\n traverse_complex();\n traverse_morecomplex();\n traverse_morecomplex2();\n}\n\nTEST(DAGNodeTest, objectDestruction_singleObject)\n{\n Node_test_objectDestruction_singleObject<DAGNode>();\n}\n\nTEST(DAGNodeTest, objectDestruction_multipleObjects)\n{\n Node_test_objectDestruction_multipleObjects<DAGNode>();\n}\n\nTEST(DAGNodeTest, objectDestruction_childNode_singleObject)\n{\n Node_test_objectDestruction_childNode_singleObject<DAGNode>();\n}\n\nTEST(DAGNodeTest, objectDestruction_childNode_complexChild)\n{\n Node_test_objectDestruction_childNode_complexChild<DAGNode>();\n}\n\n\nTEST_F(DAG_test, getObject)\n{\n getObject();\n}\n\n\n}\/\/ namespace sofa\n<commit_msg>[SofaKernel] Fix compilation issue in DAG_test.cpp<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\n#include \"..\/Node_test.h\"\n#include <SofaTest\/Sofa_test.h>\n#include <SceneCreator\/SceneCreator.h>\n#include <sofa\/simulation\/Visitor.h>\n#include <SofaSimulationGraph\/DAGNode.h>\n#include <SofaSimulationGraph\/DAGSimulation.h>\n\nusing sofa::simulation::graph::DAGNode;\n\nnamespace sofa {\n\nusing namespace modeling;\nusing namespace simulation;\n\n\n\/** Check the traversal of a Directed Acyclic Graph.\n * The traversal order is recorded in a string, and compared with an expected one.\n * @author Francois Faure, Matthieu Nesme @date 2014\n *\/\nstruct DAG_test : public Sofa_test<>\n{\n DAG_test()\n {\n sofa::simulation::setSimulation(new simulation::graph::DAGSimulation());\n }\n\n\n \/**\n * The TestVisitor struct records the name of the traversed nodes in a string.\n * The string can be analyzed as a trace of the traversal.\n *\/\n struct TestVisitor: public sofa::simulation::Visitor\n {\n\n std::string visited, topdown, bottomup;\n bool tree; \/\/ enforce tree traversal\n TreeTraversalRepetition repeat; \/\/ repeat callbacks\n\n TestVisitor()\n : Visitor(sofa::core::ExecParams::defaultInstance() )\n , tree( false )\n , repeat( NO_REPETITION )\n {\n clear();\n }\n\n void clear()\n {\n visited.clear();\n topdown.clear();\n bottomup.clear();\n }\n\n Result processNodeTopDown(simulation::Node* node)\n {\n visited += node->getName();\n topdown += node->getName();\n return RESULT_CONTINUE;\n }\n\n void processNodeBottomUp(simulation::Node* node)\n {\n visited += node->getName();\n bottomup += node->getName();\n }\n\n bool treeTraversal(TreeTraversalRepetition& r) { r=repeat; return tree; }\n\n };\n\n\n\n \/\/\/ utility function testing a scene graph traversals with given expected results\n static void traverse_test( Node::SPtr node, std::string treeTraverse, std::string treeTraverseRepeatAll, std::string treeTraverseRepeatOnce, std::string dagTopDown )\n {\n \/\/ dagBottumUp must be the exact inverse of dagTopDown\n std::string dagBottomUp(dagTopDown);\n std::reverse(dagBottomUp.begin(), dagBottomUp.end());\n\n TestVisitor t;\n\n t.tree = true; \/\/ visitor as TREE traversal w\/o repetition\n t.execute( node.get() );\n \/\/ cout<<\"traverse_simple_tree: visited = \" << t.visited << endl;\n if( t.visited != treeTraverse ){\n ADD_FAILURE() << \"Dag_test::traverse_test treeTraverse: wrong traversal order, expected \"<<treeTraverse<<\", got \" << t.visited;\n }\n t.clear();\n t.repeat = simulation::Visitor::REPEAT_ALL; \/\/ visitor as TREE traversal with repetitions\n t.execute( node.get() );\n \/\/ cout<<\"traverse_simple_tree: visited = \" << t.visited << endl;\n if( t.visited != treeTraverseRepeatAll ){\n ADD_FAILURE() << \"Dag_test::traverse_test treeTraverseRepeatAll: wrong traversal order, expected \"<<treeTraverseRepeatAll<<\", got \" << t.visited;\n }\n t.clear();\n t.repeat = simulation::Visitor::REPEAT_ONCE; \/\/ visitor as TREE traversal with first repetition\n t.execute( node.get() );\n \/\/ cout<<\"traverse_simple_tree: visited = \" << t.visited << endl;\n if( t.visited != treeTraverseRepeatOnce ){\n ADD_FAILURE() << \"Dag_test::traverse_test treeTraverseRepeatOnce: wrong traversal order, expected \"<<treeTraverseRepeatOnce<<\", got \" << t.visited;\n }\n\n t.clear();\n t.tree = false; \/\/ visitor as DAG traversal\n t.execute(node.get());\n \/\/ cout<<\"traverse_test: visited = \" << t.visited << endl;\n if( t.topdown != dagTopDown ){\n ADD_FAILURE() << \"Dag_test::traverse_test dagTopDown: wrong traversal order, expected \"<<dagTopDown<<\", got \" << t.topdown;\n }\n if( t.bottomup != dagBottomUp ){\n ADD_FAILURE() << \"Dag_test::traverse_test dagBottomUp: wrong traversal order, expected \"<<dagBottomUp<<\", got \" << t.bottomup;\n }\n\n\n\/\/ sofa::simulation::getSimulation()->print(node.get());\n }\n\n\n \/**\n * @brief The root and two children:\n\\f$\n\\begin{array}{ccc}\n & R & \\\\\n \\diagup & & \\diagdown \\\\\n A & & B\n\\end{array}\n\\f$\nExpected output: RAABBR\n *\/\n void traverse_simple_tree()\n {\n Node::SPtr root = clearScene();\n root->setName(\"R\");\n root->createChild(\"A\");\n root->createChild(\"B\");\n\n traverse_test( root, \"RAABBR\", \"RAABBR\", \"RAABBR\", \"RAB\" );\n }\n\n\n \/**\n * @brief Diamond-shaped graph:\n\\f$\n\\begin{array}{ccc}\n & R & \\\\\n \\diagup & & \\diagdown \\\\\n A & & B \\\\\n \\diagdown & & \\diagup \\\\\n & C\n\\end{array}\n\\f$\nExpected output: RABCCBAR\n *\/\n void traverse_simple_diamond()\n {\n Node::SPtr root = clearScene();\n root->setName(\"R\");\n Node::SPtr A = root->createChild(\"A\");\n Node::SPtr B = root->createChild(\"B\");\n Node::SPtr C = A->createChild(\"C\");\n B->addChild(C);\n\n traverse_test( root, \"RACCABBR\", \"RACCABCCBR\", \"RACCABCCBR\", \"RABC\" );\n }\n\n\n\/**\n * @brief More complex graph:\n\n R__\n \/ \\ \\\n A B |\n \\ \/ |\n C \/\n \\ \/\n D\n |\n E\n\nExpected output: RABCDEEDCBAR\n *\/\n void traverse_complex()\n {\n Node::SPtr root = clearScene();\n root->setName(\"R\");\n Node::SPtr A = root->createChild(\"A\");\n Node::SPtr B = root->createChild(\"B\");\n Node::SPtr C = A->createChild(\"C\");\n B->addChild(C);\n Node::SPtr D = C->createChild(\"D\");\n root->addChild(D);\n Node::SPtr E = D->createChild(\"E\");\n\n traverse_test( root, \"RACDEEDCABBR\", \"RACDEEDCABCDEEDCBDEEDR\", \"RACDEEDCABCCBDDR\", \"RABCDE\" );\n }\n\n\n\/**\n * @brief Even more complex graph:\n\n R__\n \/ \\ \\\n A B C\n \\\/ \\|\n D E\n | |\n F G\n\n *\/\n void traverse_morecomplex()\n {\n Node::SPtr root = clearScene();\n root->setName(\"R\");\n Node::SPtr A = root->createChild(\"A\");\n Node::SPtr B = root->createChild(\"B\");\n Node::SPtr C = root->createChild(\"C\");\n Node::SPtr D = A->createChild(\"D\");\n B->addChild(D);\n Node::SPtr E = B->createChild(\"E\");\n C->addChild(E);\n Node::SPtr F = D->createChild(\"F\");\n Node::SPtr G = E->createChild(\"G\");\n\n traverse_test( root, \"RADFFDABEGGEBCCR\", \"RADFFDABDFFDEGGEBCEGGECR\", \"RADFFDABDDEGGEBCEECR\", \"RABDFCEG\" );\n }\n\n\n\/**\n * @brief another complex case\n\n R______\n \/ \\ \\ \\ \\\n A B C D E\n \\\/__\/_\/_\/\n F\n |\\\n G |\n |\/\n H\n\n *\/\n void traverse_morecomplex2()\n {\n Node::SPtr root = clearScene();\n root->setName(\"R\");\n Node::SPtr A = root->createChild(\"A\");\n Node::SPtr B = root->createChild(\"B\");\n Node::SPtr C = root->createChild(\"C\");\n Node::SPtr D = root->createChild(\"D\");\n Node::SPtr E = root->createChild(\"E\");\n Node::SPtr F = A->createChild(\"F\");\n B->addChild(F);\n C->addChild(F);\n D->addChild(F);\n E->addChild(F);\n Node::SPtr G = F->createChild(\"G\");\n Node::SPtr H = G->createChild(\"H\");\n F->addChild(H);\n\n traverse_test( root, \"RAFGHHGFABBCCDDEER\",\n \"RAFGHHGHHFABFGHHGHHFBCFGHHGHHFCDFGHHGHHFDEFGHHGHHFER\",\n \"RAFGHHGHHFABFFBCFFCDFFDEFFER\",\n \"RABCDEFGH\" );\n }\n\n\n\n static void getObjectByPath( Node::SPtr node, const std::string& searchpath, const std::string& objpath )\n {\n void *foundObj = node->getObject(classid(Dummy), searchpath);\n ASSERT_TRUE( foundObj!=nullptr );\n Dummy* dummyObj = reinterpret_cast<Dummy*>(foundObj);\n ASSERT_TRUE( dummyObj!=nullptr );\n EXPECT_STREQ( objpath.c_str(), dummyObj->getPathName().c_str() );\n }\n\n\n\n void getObject()\n {\n Node::SPtr A = clearScene();\n A->setName(\"A\");\n\n Node::SPtr B = A->createChild(\"B\");\n Node::SPtr C = A->createChild(\"C\");\n Node::SPtr D = B->createChild(\"D\");\n C->addChild(D);\n Node::SPtr E = D->createChild(\"E\");\n\n\/**\n A\n \/ \\\n B C\n \\ \/\n D\n |\n E\n*\/\n\n Dummy::SPtr dummyA = sofa::core::objectmodel::New<Dummy>(\"obj\");\n A->addObject(dummyA);\n Dummy::SPtr dummyA2 = sofa::core::objectmodel::New<Dummy>(\"obj2\");\n A->addObject(dummyA2);\n Dummy::SPtr dummyB = sofa::core::objectmodel::New<Dummy>(\"obj\");\n B->addObject(dummyB);\n Dummy::SPtr dummyC = sofa::core::objectmodel::New<Dummy>(\"obj\");\n C->addObject(dummyC);\n Dummy::SPtr dummyD = sofa::core::objectmodel::New<Dummy>(\"obj\");\n D->addObject(dummyD);\n Dummy::SPtr dummyE = sofa::core::objectmodel::New<Dummy>(\"obj\");\n E->addObject(dummyE);\n\n\n\n \/\/ by path\n {\n void* foundObj = A->getObject(classid(Dummy), \"\/inexisting\");\n ASSERT_TRUE( foundObj==nullptr );\n }\n\n getObjectByPath( A, \"\/obj\", \"\/obj\" );\n getObjectByPath( A, \"obj\", \"\/obj\" );\n getObjectByPath( A, \"\/B\/obj\", \"\/B\/obj\" );\n getObjectByPath( A, \"C\/obj\", \"\/C\/obj\" );\n getObjectByPath( A, \"\/B\/D\/obj\", \"\/B\/D\/obj\" );\n getObjectByPath( A, \"C\/D\/obj\", \"\/B\/D\/obj\" );\n getObjectByPath( A, \"\/B\/D\/E\/obj\", \"\/B\/D\/E\/obj\" );\n getObjectByPath( A, \"C\/D\/E\/obj\", \"\/B\/D\/E\/obj\" );\n getObjectByPath( B, \"obj\", \"\/B\/obj\" );\n getObjectByPath( C, \"D\/E\/obj\", \"\/B\/D\/E\/obj\" );\n getObjectByPath( A, \"\/obj2\", \"\/obj2\" );\n getObjectByPath( A, \"obj2\", \"\/obj2\" );\n\n\n \/\/ TODO test other getObject{s} functions\n\n\n\n }\n\n\n};\n\n\n\nTEST_F( DAG_test, traverse )\n{\n traverse_simple_tree();\n traverse_simple_diamond();\n traverse_complex();\n traverse_morecomplex();\n traverse_morecomplex2();\n}\n\nTEST(DAGNodeTest, objectDestruction_singleObject)\n{\n Node_test_objectDestruction_singleObject<DAGNode>();\n}\n\nTEST(DAGNodeTest, objectDestruction_multipleObjects)\n{\n Node_test_objectDestruction_multipleObjects<DAGNode>();\n}\n\nTEST(DAGNodeTest, objectDestruction_childNode_singleObject)\n{\n Node_test_objectDestruction_childNode_singleObject<DAGNode>();\n}\n\nTEST(DAGNodeTest, objectDestruction_childNode_complexChild)\n{\n Node_test_objectDestruction_childNode_complexChild<DAGNode>();\n}\n\n\nTEST_F(DAG_test, getObject)\n{\n getObject();\n}\n\n\n}\/\/ namespace sofa\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 <gmock\/gmock-matchers.h>\n#include <gtest\/gtest.h>\n\n#include <memory>\n#include <utility>\n\n#include \"OrbitBase\/ThreadPool.h\"\n#include \"absl\/synchronization\/mutex.h\"\n#include \"absl\/time\/clock.h\"\n\nTEST(ThreadPool, Smoke) {\n constexpr size_t kThreadPoolMinSize = 1;\n constexpr size_t kThreadPoolMaxSize = 2;\n constexpr absl::Duration kThreadTtl = absl::Milliseconds(5);\n std::unique_ptr<ThreadPool> thread_pool =\n ThreadPool::Create(kThreadPoolMinSize, kThreadPoolMaxSize, kThreadTtl);\n\n absl::Mutex mutex;\n bool called = false;\n\n {\n absl::MutexLock lock(&mutex);\n thread_pool->Schedule([&]() {\n absl::MutexLock lock(&mutex);\n called = true;\n });\n\n EXPECT_FALSE(called);\n\n EXPECT_TRUE(mutex.AwaitWithTimeout(absl::Condition(\n +[](bool* called) { return *called; }, &called),\n absl::Milliseconds(100)));\n\n EXPECT_TRUE(called);\n called = false;\n }\n\n thread_pool->ShutdownAndWait();\n\n EXPECT_FALSE(called);\n}\n\nTEST(ThreadPool, QueuedActionsExecutedOnShutdown) {\n constexpr size_t kThreadPoolMinSize = 1;\n constexpr size_t kThreadPoolMaxSize = 2;\n constexpr absl::Duration kThreadTtl = absl::Milliseconds(5);\n std::unique_ptr<ThreadPool> thread_pool =\n ThreadPool::Create(kThreadPoolMinSize, kThreadPoolMaxSize, kThreadTtl);\n\n absl::Mutex mutex;\n size_t counter = 0;\n\n constexpr size_t kNumberOfActions = 7;\n {\n absl::MutexLock lock(&mutex);\n for (size_t i = 0; i < kNumberOfActions; ++i) {\n thread_pool->Schedule([&]() {\n absl::MutexLock lock(&mutex);\n counter++;\n });\n }\n\n \/\/ All actions are waiting on the mutex, they won't resume until we unlock\n thread_pool->Shutdown();\n }\n\n thread_pool->Wait();\n\n EXPECT_EQ(counter, kNumberOfActions);\n}\n\nTEST(ThreadPool, CheckTtl) {\n constexpr size_t kThreadPoolMinSize = 1;\n constexpr size_t kThreadPoolMaxSize = 5;\n constexpr size_t kThreadTtlMillis = 5;\n std::unique_ptr<ThreadPool> thread_pool = ThreadPool::Create(\n kThreadPoolMinSize, kThreadPoolMaxSize, absl::Milliseconds(kThreadTtlMillis));\n\n absl::Mutex actions_started_mutex;\n size_t actions_started = 0;\n absl::Mutex actions_executed_mutex;\n size_t actions_executed = 0;\n\n auto action = [&] {\n actions_started_mutex.Lock();\n actions_started++;\n actions_started_mutex.Unlock();\n\n absl::MutexLock lock(&actions_executed_mutex);\n actions_executed++;\n };\n\n constexpr size_t kNumberOfActions = 7;\n {\n absl::MutexLock lock(&actions_executed_mutex);\n for (size_t i = 0; i < kNumberOfActions; ++i) {\n thread_pool->Schedule(action);\n }\n \/\/ Wait until actions are on worker threads\n actions_started_mutex.Lock();\n EXPECT_TRUE(actions_started_mutex.AwaitWithTimeout(\n absl::Condition(\n +[](size_t* started) { return *started == 5; }, &actions_started),\n absl::Milliseconds(50)));\n actions_started_mutex.Unlock();\n\n \/\/ Now check the thread_pool size\n EXPECT_EQ(thread_pool->GetPoolSize(), kThreadPoolMaxSize);\n\n \/\/ Wait until all actions completed.\n EXPECT_TRUE(actions_executed_mutex.AwaitWithTimeout(\n absl::Condition(\n +[](size_t* executed) { return *executed == 7; }, &actions_executed),\n absl::Milliseconds(50)));\n }\n\n \/\/ +10 because there might be some milliseconds between action is complete and\n \/\/ thread went idle\n absl::SleepFor(absl::Milliseconds(kThreadTtlMillis + 10));\n\n EXPECT_EQ(thread_pool->GetPoolSize(), kThreadPoolMinSize);\n\n thread_pool->ShutdownAndWait();\n}\n\nTEST(ThreadPool, ExtendThreadPool) {\n constexpr size_t kThreadPoolMinSize = 1;\n constexpr size_t kThreadPoolMaxSize = 5;\n constexpr size_t kThreadTtlMillis = 5;\n std::unique_ptr<ThreadPool> thread_pool = ThreadPool::Create(\n kThreadPoolMinSize, kThreadPoolMaxSize, absl::Milliseconds(kThreadTtlMillis));\n\n absl::Mutex actions_started_mutex;\n size_t actions_started = 0;\n absl::Mutex actions_executed_mutex;\n size_t actions_executed = 0;\n\n auto action = [&] {\n actions_started_mutex.Lock();\n actions_started++;\n actions_started_mutex.Unlock();\n\n absl::MutexLock lock(&actions_executed_mutex);\n actions_executed++;\n };\n\n {\n \/\/ Schedule an action and check we have one worker thread\n absl::MutexLock lock(&actions_executed_mutex);\n thread_pool->Schedule(action);\n\n actions_started_mutex.Lock();\n EXPECT_TRUE(actions_started_mutex.AwaitWithTimeout(\n absl::Condition(\n +[](size_t* started) { return *started == 1; }, &actions_started),\n absl::Milliseconds(100)))\n << \"actions_started=\" << actions_started << \", expected 1\";\n actions_started_mutex.Unlock();\n\n EXPECT_EQ(thread_pool->GetPoolSize(), 1);\n\n \/\/ Schedule another action and check that there are 2 workers threads now.\n thread_pool->Schedule(action);\n\n actions_started_mutex.Lock();\n EXPECT_TRUE(actions_started_mutex.AwaitWithTimeout(\n absl::Condition(\n +[](size_t* started) { return *started == 2; }, &actions_started),\n absl::Milliseconds(100)));\n actions_started_mutex.Unlock();\n\n EXPECT_EQ(thread_pool->GetPoolSize(), 2);\n\n \/\/ Add more and make sure worker thread number remains kThreadPoolMaxSize\n for (size_t i = 0; i < 10; ++i) {\n thread_pool->Schedule(action);\n }\n\n \/\/ I do not think there is a way around it - sleep for 50ms\n absl::SleepFor(absl::Milliseconds(50));\n\n EXPECT_EQ(thread_pool->GetPoolSize(), kThreadPoolMaxSize);\n\n actions_started_mutex.Lock();\n EXPECT_EQ(actions_started, kThreadPoolMaxSize);\n actions_started_mutex.Unlock();\n\n EXPECT_TRUE(actions_executed_mutex.AwaitWithTimeout(\n absl::Condition(\n +[](size_t* executed) { return *executed == 12; }, &actions_executed),\n absl::Milliseconds(100)))\n << \"actions_executed=\" << actions_executed << \", expected 12\";\n }\n\n \/\/ Wait for ttl+10 and check that ThreadPool has reduced\n \/\/ number of worker threads\n absl::SleepFor(absl::Milliseconds(kThreadTtlMillis + 10));\n EXPECT_EQ(thread_pool->GetPoolSize(), kThreadPoolMinSize);\n\n EXPECT_EQ(actions_started, 12);\n EXPECT_EQ(actions_executed, 12);\n\n \/\/ Now make sure thread_pool increases number of threads\n \/\/ correctly after reducing number of worker threads.\n {\n absl::MutexLock lock(&actions_executed_mutex);\n thread_pool->Schedule(action);\n\n actions_started_mutex.Lock();\n EXPECT_TRUE(actions_started_mutex.AwaitWithTimeout(\n absl::Condition(\n +[](size_t* started) { return *started == 13; }, &actions_started),\n absl::Milliseconds(100)));\n actions_started_mutex.Unlock();\n\n EXPECT_EQ(thread_pool->GetPoolSize(), 1);\n\n thread_pool->Schedule(action);\n\n actions_started_mutex.Lock();\n EXPECT_TRUE(actions_started_mutex.AwaitWithTimeout(\n absl::Condition(\n +[](size_t* started) { return *started == 14; }, &actions_started),\n absl::Milliseconds(100)));\n actions_started_mutex.Unlock();\n\n EXPECT_EQ(thread_pool->GetPoolSize(), 2);\n\n \/\/ Add more and make sure worker thread number remains kThreadPoolMaxSize\n for (size_t i = 0; i < 10; ++i) {\n thread_pool->Schedule(action);\n }\n\n \/\/ I do not think there is a way around it - sleep for 50ms\n absl::SleepFor(absl::Milliseconds(50));\n\n EXPECT_EQ(thread_pool->GetPoolSize(), kThreadPoolMaxSize);\n actions_started_mutex.Lock();\n EXPECT_EQ(actions_started, 12 + kThreadPoolMaxSize);\n actions_started_mutex.Unlock();\n }\n\n thread_pool->ShutdownAndWait();\n\n EXPECT_EQ(actions_started, 24);\n EXPECT_EQ(actions_executed, 24);\n}\n\nTEST(ThreadPool, InvalidArguments) {\n EXPECT_DEATH(\n {\n auto thread_pool = ThreadPool::Create(0, 1, absl::Milliseconds(1));\n thread_pool->ShutdownAndWait();\n },\n \"\");\n EXPECT_DEATH(\n {\n auto thread_pool = ThreadPool::Create(2, 1, absl::Milliseconds(1));\n thread_pool->ShutdownAndWait();\n },\n \"\");\n EXPECT_DEATH(\n {\n auto thread_pool = ThreadPool::Create(0, 0, absl::Milliseconds(1));\n thread_pool->ShutdownAndWait();\n },\n \"\");\n EXPECT_DEATH(\n {\n auto thread_pool = ThreadPool::Create(1, 2, absl::Milliseconds(0));\n thread_pool->ShutdownAndWait();\n },\n \"\");\n EXPECT_DEATH(\n {\n auto thread_pool = ThreadPool::Create(1, 2, absl::Nanoseconds(999));\n thread_pool->ShutdownAndWait();\n },\n \"\");\n}\n\nTEST(ThreadPool, NoShutdown) { EXPECT_DEATH(ThreadPool::Create(1, 4, absl::Milliseconds(10)), \"\"); }\n\nTEST(ThreadPool, ScheduleAfterShutdown) {\n EXPECT_DEATH(\n {\n constexpr size_t kThreadPoolMinSize = 1;\n constexpr size_t kThreadPoolMaxSize = 2;\n constexpr absl::Duration kThreadTtl = absl::Milliseconds(5);\n std::unique_ptr<ThreadPool> thread_pool =\n ThreadPool::Create(kThreadPoolMinSize, kThreadPoolMaxSize, kThreadTtl);\n\n thread_pool->Shutdown();\n thread_pool->Schedule([] {});\n },\n \"\");\n}\n\nTEST(ThreadPool, WaitWithoutShutdown) {\n EXPECT_DEATH(\n {\n constexpr size_t kThreadPoolMinSize = 1;\n constexpr size_t kThreadPoolMaxSize = 2;\n constexpr absl::Duration kThreadTtl = absl::Milliseconds(5);\n std::unique_ptr<ThreadPool> thread_pool =\n ThreadPool::Create(kThreadPoolMinSize, kThreadPoolMaxSize, kThreadTtl);\n\n thread_pool->Wait();\n },\n \"\");\n}\n<commit_msg>Add CheckGetNumberOfBusyThreads test<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 <gmock\/gmock-matchers.h>\n#include <gtest\/gtest.h>\n\n#include <memory>\n#include <utility>\n\n#include \"OrbitBase\/ThreadPool.h\"\n#include \"absl\/synchronization\/mutex.h\"\n#include \"absl\/time\/clock.h\"\n\nTEST(ThreadPool, Smoke) {\n constexpr size_t kThreadPoolMinSize = 1;\n constexpr size_t kThreadPoolMaxSize = 2;\n constexpr absl::Duration kThreadTtl = absl::Milliseconds(5);\n std::unique_ptr<ThreadPool> thread_pool =\n ThreadPool::Create(kThreadPoolMinSize, kThreadPoolMaxSize, kThreadTtl);\n\n absl::Mutex mutex;\n bool called = false;\n\n {\n absl::MutexLock lock(&mutex);\n thread_pool->Schedule([&]() {\n absl::MutexLock lock(&mutex);\n called = true;\n });\n\n EXPECT_FALSE(called);\n\n EXPECT_TRUE(mutex.AwaitWithTimeout(absl::Condition(\n +[](bool* called) { return *called; }, &called),\n absl::Milliseconds(100)));\n\n EXPECT_TRUE(called);\n called = false;\n }\n\n thread_pool->ShutdownAndWait();\n\n EXPECT_FALSE(called);\n}\n\nTEST(ThreadPool, QueuedActionsExecutedOnShutdown) {\n constexpr size_t kThreadPoolMinSize = 1;\n constexpr size_t kThreadPoolMaxSize = 2;\n constexpr absl::Duration kThreadTtl = absl::Milliseconds(5);\n std::unique_ptr<ThreadPool> thread_pool =\n ThreadPool::Create(kThreadPoolMinSize, kThreadPoolMaxSize, kThreadTtl);\n\n absl::Mutex mutex;\n size_t counter = 0;\n\n constexpr size_t kNumberOfActions = 7;\n {\n absl::MutexLock lock(&mutex);\n for (size_t i = 0; i < kNumberOfActions; ++i) {\n thread_pool->Schedule([&]() {\n absl::MutexLock lock(&mutex);\n counter++;\n });\n }\n\n \/\/ All actions are waiting on the mutex, they won't resume until we unlock\n thread_pool->Shutdown();\n }\n\n thread_pool->Wait();\n\n EXPECT_EQ(counter, kNumberOfActions);\n}\n\nTEST(ThreadPool, CheckTtl) {\n constexpr size_t kThreadPoolMinSize = 1;\n constexpr size_t kThreadPoolMaxSize = 5;\n constexpr size_t kThreadTtlMillis = 5;\n std::unique_ptr<ThreadPool> thread_pool = ThreadPool::Create(\n kThreadPoolMinSize, kThreadPoolMaxSize, absl::Milliseconds(kThreadTtlMillis));\n\n absl::Mutex actions_started_mutex;\n size_t actions_started = 0;\n absl::Mutex actions_executed_mutex;\n size_t actions_executed = 0;\n\n auto action = [&] {\n actions_started_mutex.Lock();\n actions_started++;\n actions_started_mutex.Unlock();\n\n absl::MutexLock lock(&actions_executed_mutex);\n actions_executed++;\n };\n\n constexpr size_t kNumberOfActions = 7;\n {\n absl::MutexLock lock(&actions_executed_mutex);\n for (size_t i = 0; i < kNumberOfActions; ++i) {\n thread_pool->Schedule(action);\n }\n \/\/ Wait until actions are on worker threads\n actions_started_mutex.Lock();\n EXPECT_TRUE(actions_started_mutex.AwaitWithTimeout(\n absl::Condition(\n +[](size_t* started) { return *started == 5; }, &actions_started),\n absl::Milliseconds(50)));\n actions_started_mutex.Unlock();\n\n \/\/ Now check the thread_pool size\n EXPECT_EQ(thread_pool->GetPoolSize(), kThreadPoolMaxSize);\n\n \/\/ Wait until all actions completed.\n EXPECT_TRUE(actions_executed_mutex.AwaitWithTimeout(\n absl::Condition(\n +[](size_t* executed) { return *executed == 7; }, &actions_executed),\n absl::Milliseconds(50)));\n }\n\n \/\/ +10 because there might be some milliseconds between action is complete and\n \/\/ thread went idle\n absl::SleepFor(absl::Milliseconds(kThreadTtlMillis + 10));\n\n EXPECT_EQ(thread_pool->GetPoolSize(), kThreadPoolMinSize);\n\n thread_pool->ShutdownAndWait();\n}\n\nTEST(ThreadPool, ExtendThreadPool) {\n constexpr size_t kThreadPoolMinSize = 1;\n constexpr size_t kThreadPoolMaxSize = 5;\n constexpr size_t kThreadTtlMillis = 5;\n std::unique_ptr<ThreadPool> thread_pool = ThreadPool::Create(\n kThreadPoolMinSize, kThreadPoolMaxSize, absl::Milliseconds(kThreadTtlMillis));\n\n absl::Mutex actions_started_mutex;\n size_t actions_started = 0;\n absl::Mutex actions_executed_mutex;\n size_t actions_executed = 0;\n\n auto action = [&] {\n actions_started_mutex.Lock();\n actions_started++;\n actions_started_mutex.Unlock();\n\n absl::MutexLock lock(&actions_executed_mutex);\n actions_executed++;\n };\n\n {\n \/\/ Schedule an action and check we have one worker thread\n absl::MutexLock lock(&actions_executed_mutex);\n thread_pool->Schedule(action);\n\n actions_started_mutex.Lock();\n EXPECT_TRUE(actions_started_mutex.AwaitWithTimeout(\n absl::Condition(\n +[](size_t* started) { return *started == 1; }, &actions_started),\n absl::Milliseconds(100)))\n << \"actions_started=\" << actions_started << \", expected 1\";\n actions_started_mutex.Unlock();\n\n EXPECT_EQ(thread_pool->GetPoolSize(), 1);\n\n \/\/ Schedule another action and check that there are 2 workers threads now.\n thread_pool->Schedule(action);\n\n actions_started_mutex.Lock();\n EXPECT_TRUE(actions_started_mutex.AwaitWithTimeout(\n absl::Condition(\n +[](size_t* started) { return *started == 2; }, &actions_started),\n absl::Milliseconds(100)));\n actions_started_mutex.Unlock();\n\n EXPECT_EQ(thread_pool->GetPoolSize(), 2);\n\n \/\/ Add more and make sure worker thread number remains kThreadPoolMaxSize\n for (size_t i = 0; i < 10; ++i) {\n thread_pool->Schedule(action);\n }\n\n \/\/ I do not think there is a way around it - sleep for 50ms\n absl::SleepFor(absl::Milliseconds(50));\n\n EXPECT_EQ(thread_pool->GetPoolSize(), kThreadPoolMaxSize);\n\n actions_started_mutex.Lock();\n EXPECT_EQ(actions_started, kThreadPoolMaxSize);\n actions_started_mutex.Unlock();\n\n EXPECT_TRUE(actions_executed_mutex.AwaitWithTimeout(\n absl::Condition(\n +[](size_t* executed) { return *executed == 12; }, &actions_executed),\n absl::Milliseconds(100)))\n << \"actions_executed=\" << actions_executed << \", expected 12\";\n }\n\n \/\/ Wait for ttl+10 and check that ThreadPool has reduced\n \/\/ number of worker threads\n absl::SleepFor(absl::Milliseconds(kThreadTtlMillis + 10));\n EXPECT_EQ(thread_pool->GetPoolSize(), kThreadPoolMinSize);\n\n EXPECT_EQ(actions_started, 12);\n EXPECT_EQ(actions_executed, 12);\n\n \/\/ Now make sure thread_pool increases number of threads\n \/\/ correctly after reducing number of worker threads.\n {\n absl::MutexLock lock(&actions_executed_mutex);\n thread_pool->Schedule(action);\n\n actions_started_mutex.Lock();\n EXPECT_TRUE(actions_started_mutex.AwaitWithTimeout(\n absl::Condition(\n +[](size_t* started) { return *started == 13; }, &actions_started),\n absl::Milliseconds(100)));\n actions_started_mutex.Unlock();\n\n EXPECT_EQ(thread_pool->GetPoolSize(), 1);\n\n thread_pool->Schedule(action);\n\n actions_started_mutex.Lock();\n EXPECT_TRUE(actions_started_mutex.AwaitWithTimeout(\n absl::Condition(\n +[](size_t* started) { return *started == 14; }, &actions_started),\n absl::Milliseconds(100)));\n actions_started_mutex.Unlock();\n\n EXPECT_EQ(thread_pool->GetPoolSize(), 2);\n\n \/\/ Add more and make sure worker thread number remains kThreadPoolMaxSize\n for (size_t i = 0; i < 10; ++i) {\n thread_pool->Schedule(action);\n }\n\n \/\/ I do not think there is a way around it - sleep for 50ms\n absl::SleepFor(absl::Milliseconds(50));\n\n EXPECT_EQ(thread_pool->GetPoolSize(), kThreadPoolMaxSize);\n actions_started_mutex.Lock();\n EXPECT_EQ(actions_started, 12 + kThreadPoolMaxSize);\n actions_started_mutex.Unlock();\n }\n\n thread_pool->ShutdownAndWait();\n\n EXPECT_EQ(actions_started, 24);\n EXPECT_EQ(actions_executed, 24);\n}\n\nTEST(ThreadPool, CheckGetNumberOfBusyThreads) {\n constexpr size_t kThreadPoolMinSize = 1;\n constexpr size_t kThreadPoolMaxSize = 2;\n constexpr size_t kThreadTtlMillis = 5;\n\n std::unique_ptr<ThreadPool> thread_pool = ThreadPool::Create(\n kThreadPoolMinSize, kThreadPoolMaxSize, absl::Milliseconds(kThreadTtlMillis));\n\n EXPECT_EQ(thread_pool->GetNumberOfBusyThreads(), 0);\n\n absl::Mutex actions_started_mutex;\n size_t actions_started = 0;\n absl::Mutex actions_executed_mutex;\n size_t actions_executed = 0;\n\n auto action = [&] {\n actions_started_mutex.Lock();\n actions_started++;\n actions_started_mutex.Unlock();\n\n absl::MutexLock lock(&actions_executed_mutex);\n actions_executed++;\n };\n\n {\n \/\/ Schedule an action and check we have a busy thread\n absl::MutexLock lock(&actions_executed_mutex);\n thread_pool->Schedule(action);\n\n actions_started_mutex.Lock();\n EXPECT_TRUE(actions_started_mutex.AwaitWithTimeout(\n absl::Condition(\n +[](size_t* started) { return *started == 1; }, &actions_started),\n absl::Milliseconds(100)))\n << \"actions_started=\" << actions_started << \", expected 1\";\n actions_started_mutex.Unlock();\n EXPECT_EQ(thread_pool->GetNumberOfBusyThreads(), 1);\n\n \/\/ Schedule another action and check that there are 2 workers threads now.\n thread_pool->Schedule(action);\n\n actions_started_mutex.Lock();\n EXPECT_TRUE(actions_started_mutex.AwaitWithTimeout(\n absl::Condition(\n +[](size_t* started) { return *started == 2; }, &actions_started),\n absl::Milliseconds(100)));\n actions_started_mutex.Unlock();\n EXPECT_EQ(thread_pool->GetNumberOfBusyThreads(), 2);\n\n EXPECT_TRUE(actions_executed_mutex.AwaitWithTimeout(\n absl::Condition(\n +[](size_t* executed) { return *executed == 2; }, &actions_executed),\n absl::Milliseconds(100)))\n << \"actions_executed=\" << actions_executed << \", expected 2\";\n }\n\n \/\/ Check there are no busy threads anymore\n EXPECT_EQ(thread_pool->GetNumberOfBusyThreads(), 0);\n\n thread_pool->ShutdownAndWait();\n};\n\nTEST(ThreadPool, InvalidArguments) {\n EXPECT_DEATH(\n {\n auto thread_pool = ThreadPool::Create(0, 1, absl::Milliseconds(1));\n thread_pool->ShutdownAndWait();\n },\n \"\");\n EXPECT_DEATH(\n {\n auto thread_pool = ThreadPool::Create(2, 1, absl::Milliseconds(1));\n thread_pool->ShutdownAndWait();\n },\n \"\");\n EXPECT_DEATH(\n {\n auto thread_pool = ThreadPool::Create(0, 0, absl::Milliseconds(1));\n thread_pool->ShutdownAndWait();\n },\n \"\");\n EXPECT_DEATH(\n {\n auto thread_pool = ThreadPool::Create(1, 2, absl::Milliseconds(0));\n thread_pool->ShutdownAndWait();\n },\n \"\");\n EXPECT_DEATH(\n {\n auto thread_pool = ThreadPool::Create(1, 2, absl::Nanoseconds(999));\n thread_pool->ShutdownAndWait();\n },\n \"\");\n}\n\nTEST(ThreadPool, NoShutdown) { EXPECT_DEATH(ThreadPool::Create(1, 4, absl::Milliseconds(10)), \"\"); }\n\nTEST(ThreadPool, ScheduleAfterShutdown) {\n EXPECT_DEATH(\n {\n constexpr size_t kThreadPoolMinSize = 1;\n constexpr size_t kThreadPoolMaxSize = 2;\n constexpr absl::Duration kThreadTtl = absl::Milliseconds(5);\n std::unique_ptr<ThreadPool> thread_pool =\n ThreadPool::Create(kThreadPoolMinSize, kThreadPoolMaxSize, kThreadTtl);\n\n thread_pool->Shutdown();\n thread_pool->Schedule([] {});\n },\n \"\");\n}\n\nTEST(ThreadPool, WaitWithoutShutdown) {\n EXPECT_DEATH(\n {\n constexpr size_t kThreadPoolMinSize = 1;\n constexpr size_t kThreadPoolMaxSize = 2;\n constexpr absl::Duration kThreadTtl = absl::Milliseconds(5);\n std::unique_ptr<ThreadPool> thread_pool =\n ThreadPool::Create(kThreadPoolMinSize, kThreadPoolMaxSize, kThreadTtl);\n\n thread_pool->Wait();\n },\n \"\");\n}\n<|endoftext|>"} {"text":"<commit_before>\/** @file\n @brief Implementation\n\n @date 2016\n\n @author\n Sensics, Inc.\n <http:\/\/sensics.com\/osvr>\n*\/\n\n\/\/ Copyright 2016 Razer 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 \"FindDriver.h\"\n\n\/\/ Library\/third-party includes\n#include <boost\/iostreams\/stream.hpp>\n#include <json\/reader.h>\n#include <json\/value.h>\n#include <osvr\/Util\/Finally.h>\n#include <osvr\/Util\/PlatformConfig.h>\n\n\/\/ Standard includes\n#include <fstream> \/\/ std::ifstream\n#include <iostream>\n#include <limits.h>\n#include <vector>\n\n#if defined(OSVR_USING_FILESYSTEM_HEADER)\n#include <filesystem>\n#elif defined(OSVR_USING_BOOST_FILESYSTEM)\n#include <boost\/filesystem.hpp>\n#endif\n\n#if defined(OSVR_WINDOWS)\n#include <shlobj.h>\n#else\n#include <cstdlib> \/\/ for getenv\n#endif\n\n#undef VIVELOADER_VERBOSE\n\nusing osvr::util::finally;\n\nnamespace osvr {\nnamespace vive {\n#if defined(OSVR_WINDOWS)\n static const auto PLATFORM_DIRNAME_BASE = \"win\";\n static const auto DRIVER_EXTENSION = \".dll\";\n static const auto TOOL_EXTENSION = \".exe\";\n static const auto PATH_SEP = \"\\\\\";\n#elif defined(OSVR_MACOSX)\n \/\/\/ @todo Note that there are no 64-bit steamvr runtimes or drivers on OS X\n static const auto PLATFORM_DIRNAME_BASE = \"osx\";\n static const auto DRIVER_EXTENSION = \".dylib\";\n static const auto TOOL_EXTENSION = \"\";\n static const auto PATH_SEP = \"\/\";\n#elif defined(OSVR_LINUX)\n static const auto PLATFORM_DIRNAME_BASE = \"linux\";\n static const auto DRIVER_EXTENSION = \".so\";\n static const auto TOOL_EXTENSION = \"\";\n static const auto PATH_SEP = \"\/\";\n#else\n#error \"Sorry, Valve does not produce a SteamVR runtime for your platform.\"\n#endif\n\n#if defined(OSVR_USING_FILESYSTEM_TR2)\n using std::tr2::sys::path;\n using std::tr2::sys::wpath;\n using std::tr2::sys::exists;\n#elif defined(OSVR_USING_FILESYSTEM_EXPERIMENTAL)\n using std::experimental::filesystem::path;\n#ifdef _WIN32\n \/\/\/ Some Windows functions deal in wide strings, easier to just let it cope\n \/\/\/ with it.\n using wpath = path;\n#endif\n using std::experimental::filesystem::exists;\n#elif defined(OSVR_USING_BOOST_FILESYSTEM)\n using boost::filesystem::path;\n using boost::filesystem::exists;\n#endif\n\n#ifdef OSVR_MACOSX\n inline std::string getPlatformBitSuffix() {\n \/\/ they use universal binaries but stick them in \"32\"\n return \"32\";\n }\n#else\n inline std::string getPlatformBitSuffix() {\n return std::to_string(sizeof(void *) * CHAR_BIT);\n }\n#endif\n\n inline std::string getPlatformDirname() {\n return PLATFORM_DIRNAME_BASE + getPlatformBitSuffix();\n }\n\n inline void parsePathConfigFile(std::istream &is, Json::Value &ret) {\n Json::Reader reader;\n if (!reader.parse(is, ret)) {\n std::cerr << \"Error parsing file containing path configuration - \"\n \"have you run SteamVR yet?\"\n << std::endl;\n std::cerr << reader.getFormattedErrorMessages() << std::endl;\n }\n }\n\n#if defined(OSVR_WINDOWS)\n inline Json::Value getPathConfig() {\n PWSTR outString = nullptr;\n Json::Value ret;\n \/\/ It's OK to use Vista+ stuff here, since openvr_api.dll uses Vista+\n \/\/ stuff too.\n auto hr =\n SHGetKnownFolderPath(FOLDERID_LocalAppData, 0, nullptr, &outString);\n if (!SUCCEEDED(hr)) {\n std::cerr << \"Could not get local app data directory!\" << std::endl;\n return ret;\n }\n \/\/ Free the string returned when we're all done.\n auto freeString = [&] { CoTaskMemFree(outString); };\n \/\/ Build the path to the file.\n auto vrPaths =\n wpath(outString) \/ wpath(L\"openvr\") \/ wpath(L\"openvrpaths.vrpath\");\n std::ifstream is(vrPaths.string());\n if (!is) {\n std::wcerr << L\"Could not open file containing path configuration \"\n L\"- have you run SteamVR yet? \"\n << vrPaths << L\"\\n\";\n return ret;\n }\n parsePathConfigFile(is, ret);\n return ret;\n }\n\n#elif defined(OSVR_MACOSX) || defined(OSVR_LINUX)\n inline Json::Value getPathConfig() {\n auto home = std::getenv(\"HOME\");\n path homePath =\n (nullptr == home\n ? path{\"~\"}\n \/*that's weird, should have been in environment...*\/\n : path{home});\n auto vrPaths = homePath \/ path{\".openvr\"} \/ path{\"openvrpaths.vrpath\"};\n\n std::ifstream is(vrPaths.string());\n Json::Value ret;\n if (!is) {\n std::cerr << \"Could not open file containing path configuration \"\n \"- have you run SteamVR yet? \"\n << vrPaths << \"\\n\";\n return ret;\n }\n parsePathConfigFile(is, ret);\n return ret;\n }\n#endif\n\n inline std::vector<std::string> getSteamVRRoots(Json::Value const &json) {\n std::vector<std::string> ret;\n auto &runtimes = json[\"runtime\"];\n if (!runtimes.isArray()) {\n return ret;\n }\n for (auto &runtime : runtimes) {\n ret.emplace_back(runtime.asString());\n }\n return ret;\n }\n\n inline std::vector<std::string> getSteamVRRoots() {\n return getSteamVRRoots(getPathConfig());\n }\n\n inline void computeDriverRootAndFilePath(DriverLocationInfo &info,\n std::string const &driver) {\n auto p = path{info.steamVrRoot};\n p \/= \"drivers\";\n p \/= driver;\n p \/= \"bin\";\n p \/= getPlatformDirname();\n info.driverRoot = p.string();\n p \/= (\"driver_\" + driver + DRIVER_EXTENSION);\n info.driverFile = p.string();\n }\n\n \/\/\/ Underlying implementation - hand it the preloaded json.\n inline DriverLocationInfo findDriver(Json::Value const &json,\n std::string const &driver) {\n\n DriverLocationInfo info;\n auto &runtimes = json[\"runtime\"];\n if (!runtimes.isArray()) {\n return info;\n }\n\n for (auto &root : runtimes) {\n info.steamVrRoot = root.asString();\n info.driverName = driver;\n\n computeDriverRootAndFilePath(info, driver);\n\n#ifdef VIVELOADER_VERBOSE\n std::cout << \"Will try to load driver from:\\n\"\n << info.driverFile << std::endl;\n if (exists(path{info.driverRoot})) {\n std::cout << \"Driver root exists\" << std::endl;\n }\n if (exists(path{info.driverFile})) {\n std::cout << \"Driver file exists\" << std::endl;\n }\n#endif\n\n if (exists(path{info.driverRoot}) &&\n exists(path{info.driverFile})) {\n info.found = true;\n return info;\n }\n }\n info = DriverLocationInfo{};\n return info;\n }\n\n DriverLocationInfo findDriver(std::string const &driver) {\n return findDriver(getPathConfig(), driver);\n }\n\n std::string getToolLocation(std::string const &toolName,\n std::string const &steamVrRoot) {\n std::vector<std::string> searchPath;\n if (!steamVrRoot.empty()) {\n searchPath = {steamVrRoot};\n } else {\n searchPath = getSteamVRRoots();\n }\n\n for (auto &root : searchPath) {\n auto p = path{root};\n p \/= \"bin\";\n p \/= getPlatformDirname();\n p \/= (toolName + TOOL_EXTENSION);\n if (exists(p)) {\n return p.string();\n }\n }\n return std::string{};\n }\n\n \/\/\/ Underlying implementation - hand it the preloaded json.\n inline ConfigDirs findConfigDirs(Json::Value const &json,\n std::string const &driver) {\n ConfigDirs ret;\n auto const &configLocations = json[\"config\"];\n if (!configLocations.isArray()) {\n return ret;\n }\n for (auto &configDir : configLocations) {\n auto configPath = path{configDir.asString()};\n if (!exists(configPath)) {\n continue;\n }\n ret.rootConfigDir = configPath.string();\n ret.driverConfigDir = (configPath \/ path{driver}).string();\n ret.valid = true;\n return ret;\n }\n ret = ConfigDirs{};\n return ret;\n }\n\n ConfigDirs findConfigDirs(std::string const & \/*steamVrRoot*\/,\n std::string const &driver) {\n return findConfigDirs(getPathConfig(), driver);\n }\n\n LocationInfo findLocationInfoForDriver(std::string const &driver) {\n auto json = getPathConfig();\n LocationInfo ret;\n\n auto config = findConfigDirs(json, driver);\n if (config.valid) {\n ret.configFound = true;\n ret.rootConfigDir = config.rootConfigDir;\n ret.driverConfigDir = config.driverConfigDir;\n }\n auto driverLoc = findDriver(json, driver);\n if (driverLoc.found) {\n ret.driverFound = true;\n ret.steamVrRoot = driverLoc.steamVrRoot;\n ret.driverRoot = driverLoc.driverRoot;\n ret.driverName = driverLoc.driverName;\n ret.driverFile = driverLoc.driverFile;\n }\n ret.found = (driverLoc.found && config.valid);\n return ret;\n }\n\n} \/\/ namespace vive\n} \/\/ namespace osvr\n<commit_msg>Todo comment and remove suspected unused code.<commit_after>\/** @file\n @brief Implementation\n\n @date 2016\n\n @author\n Sensics, Inc.\n <http:\/\/sensics.com\/osvr>\n*\/\n\n\/\/ Copyright 2016 Razer 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 \"FindDriver.h\"\n\n\/\/ Library\/third-party includes\n#include <boost\/iostreams\/stream.hpp>\n#include <json\/reader.h>\n#include <json\/value.h>\n#include <osvr\/Util\/Finally.h>\n#include <osvr\/Util\/PlatformConfig.h>\n\n\/\/ Standard includes\n#include <fstream> \/\/ std::ifstream\n#include <iostream>\n#include <limits.h>\n#include <vector>\n\n#if defined(OSVR_USING_FILESYSTEM_HEADER)\n#include <filesystem>\n#elif defined(OSVR_USING_BOOST_FILESYSTEM)\n#include <boost\/filesystem.hpp>\n#endif\n\n#if defined(OSVR_WINDOWS)\n#include <shlobj.h>\n#else\n#include <cstdlib> \/\/ for getenv\n#endif\n\n#undef VIVELOADER_VERBOSE\n\nusing osvr::util::finally;\n\nnamespace osvr {\nnamespace vive {\n#if defined(OSVR_WINDOWS)\n static const auto PLATFORM_DIRNAME_BASE = \"win\";\n static const auto DRIVER_EXTENSION = \".dll\";\n static const auto TOOL_EXTENSION = \".exe\";\n static const auto PATH_SEP = \"\\\\\";\n#elif defined(OSVR_MACOSX)\n \/\/\/ @todo Note that there are no 64-bit steamvr runtimes or drivers on OS X\n static const auto PLATFORM_DIRNAME_BASE = \"osx\";\n static const auto DRIVER_EXTENSION = \".dylib\";\n static const auto TOOL_EXTENSION = \"\";\n static const auto PATH_SEP = \"\/\";\n#elif defined(OSVR_LINUX)\n static const auto PLATFORM_DIRNAME_BASE = \"linux\";\n static const auto DRIVER_EXTENSION = \".so\";\n static const auto TOOL_EXTENSION = \"\";\n static const auto PATH_SEP = \"\/\";\n#else\n#error \"Sorry, Valve does not produce a SteamVR runtime for your platform.\"\n#endif\n\n#if defined(OSVR_USING_FILESYSTEM_TR2)\n using std::tr2::sys::path;\n using std::tr2::sys::wpath;\n using std::tr2::sys::exists;\n#elif defined(OSVR_USING_FILESYSTEM_EXPERIMENTAL)\n using std::experimental::filesystem::path;\n#ifdef _WIN32\n \/\/\/ Some Windows functions deal in wide strings, easier to just let it cope\n \/\/\/ with it.\n using wpath = path;\n#endif\n using std::experimental::filesystem::exists;\n#elif defined(OSVR_USING_BOOST_FILESYSTEM)\n using boost::filesystem::path;\n using boost::filesystem::exists;\n#endif\n\n#ifdef OSVR_MACOSX\n inline std::string getPlatformBitSuffix() {\n \/\/ they use universal binaries but stick them in \"32\"\n return \"32\";\n }\n#else\n inline std::string getPlatformBitSuffix() {\n return std::to_string(sizeof(void *) * CHAR_BIT);\n }\n#endif\n\n inline std::string getPlatformDirname() {\n return PLATFORM_DIRNAME_BASE + getPlatformBitSuffix();\n }\n\n inline void parsePathConfigFile(std::istream &is, Json::Value &ret) {\n Json::Reader reader;\n if (!reader.parse(is, ret)) {\n std::cerr << \"Error parsing file containing path configuration - \"\n \"have you run SteamVR yet?\"\n << std::endl;\n std::cerr << reader.getFormattedErrorMessages() << std::endl;\n }\n }\n\n#if defined(OSVR_WINDOWS)\n inline Json::Value getPathConfig() {\n PWSTR outString = nullptr;\n Json::Value ret;\n \/\/ It's OK to use Vista+ stuff here, since openvr_api.dll uses Vista+\n \/\/ stuff too.\n auto hr =\n SHGetKnownFolderPath(FOLDERID_LocalAppData, 0, nullptr, &outString);\n if (!SUCCEEDED(hr)) {\n std::cerr << \"Could not get local app data directory!\" << std::endl;\n return ret;\n }\n \/\/ Free the string returned when we're all done.\n \/\/\/ @todo Shouldn't this be in a \"finally()\" call?\n auto freeString = [&] { CoTaskMemFree(outString); };\n \/\/ Build the path to the file.\n auto vrPaths =\n wpath(outString) \/ wpath(L\"openvr\") \/ wpath(L\"openvrpaths.vrpath\");\n std::ifstream is(vrPaths.string());\n if (!is) {\n std::wcerr << L\"Could not open file containing path configuration \"\n L\"- have you run SteamVR yet? \"\n << vrPaths << L\"\\n\";\n return ret;\n }\n parsePathConfigFile(is, ret);\n return ret;\n }\n\n#elif defined(OSVR_MACOSX) || defined(OSVR_LINUX)\n inline Json::Value getPathConfig() {\n auto home = std::getenv(\"HOME\");\n path homePath =\n (nullptr == home\n ? path{\"~\"}\n \/*that's weird, should have been in environment...*\/\n : path{home});\n auto vrPaths = homePath \/ path{\".openvr\"} \/ path{\"openvrpaths.vrpath\"};\n\n std::ifstream is(vrPaths.string());\n Json::Value ret;\n if (!is) {\n std::cerr << \"Could not open file containing path configuration \"\n \"- have you run SteamVR yet? \"\n << vrPaths << \"\\n\";\n return ret;\n }\n parsePathConfigFile(is, ret);\n return ret;\n }\n#endif\n\n inline std::vector<std::string> getSteamVRRoots(Json::Value const &json) {\n std::vector<std::string> ret;\n auto &runtimes = json[\"runtime\"];\n if (!runtimes.isArray()) {\n return ret;\n }\n for (auto &runtime : runtimes) {\n ret.emplace_back(runtime.asString());\n }\n return ret;\n }\n\n inline std::vector<std::string> getSteamVRRoots() {\n return getSteamVRRoots(getPathConfig());\n }\n\n inline void computeDriverRootAndFilePath(DriverLocationInfo &info,\n std::string const &driver) {\n auto p = path{info.steamVrRoot};\n p \/= \"drivers\";\n p \/= driver;\n p \/= \"bin\";\n p \/= getPlatformDirname();\n info.driverRoot = p.string();\n p \/= (\"driver_\" + driver + DRIVER_EXTENSION);\n info.driverFile = p.string();\n }\n\n \/\/\/ Underlying implementation - hand it the preloaded json.\n inline DriverLocationInfo findDriver(Json::Value const &json,\n std::string const &driver) {\n\n DriverLocationInfo info;\n auto &runtimes = json[\"runtime\"];\n if (!runtimes.isArray()) {\n return info;\n }\n\n for (auto &root : runtimes) {\n info.steamVrRoot = root.asString();\n info.driverName = driver;\n\n computeDriverRootAndFilePath(info, driver);\n\n#ifdef VIVELOADER_VERBOSE\n std::cout << \"Will try to load driver from:\\n\"\n << info.driverFile << std::endl;\n if (exists(path{info.driverRoot})) {\n std::cout << \"Driver root exists\" << std::endl;\n }\n if (exists(path{info.driverFile})) {\n std::cout << \"Driver file exists\" << std::endl;\n }\n#endif\n\n if (exists(path{info.driverRoot}) &&\n exists(path{info.driverFile})) {\n info.found = true;\n return info;\n }\n }\n info = DriverLocationInfo{};\n return info;\n }\n\n DriverLocationInfo findDriver(std::string const &driver) {\n return findDriver(getPathConfig(), driver);\n }\n\n std::string getToolLocation(std::string const &toolName,\n std::string const &steamVrRoot) {\n std::vector<std::string> searchPath;\n if (!steamVrRoot.empty()) {\n searchPath = {steamVrRoot};\n } else {\n searchPath = getSteamVRRoots();\n }\n\n for (auto &root : searchPath) {\n auto p = path{root};\n p \/= \"bin\";\n p \/= getPlatformDirname();\n p \/= (toolName + TOOL_EXTENSION);\n if (exists(p)) {\n return p.string();\n }\n }\n return std::string{};\n }\n\n \/\/\/ Underlying implementation - hand it the preloaded json.\n inline ConfigDirs findConfigDirs(Json::Value const &json,\n std::string const &driver) {\n ConfigDirs ret;\n auto const &configLocations = json[\"config\"];\n if (!configLocations.isArray()) {\n return ret;\n }\n for (auto &configDir : configLocations) {\n auto configPath = path{configDir.asString()};\n if (!exists(configPath)) {\n continue;\n }\n ret.rootConfigDir = configPath.string();\n ret.driverConfigDir = (configPath \/ path{driver}).string();\n ret.valid = true;\n return ret;\n }\n ret = ConfigDirs{};\n return ret;\n }\n#if 0\n ConfigDirs findConfigDirs(std::string const & \/*steamVrRoot*\/,\n std::string const &driver) {\n return findConfigDirs(getPathConfig(), driver);\n }\n#endif\n\n LocationInfo findLocationInfoForDriver(std::string const &driver) {\n auto json = getPathConfig();\n LocationInfo ret;\n\n auto config = findConfigDirs(json, driver);\n if (config.valid) {\n ret.configFound = true;\n ret.rootConfigDir = config.rootConfigDir;\n ret.driverConfigDir = config.driverConfigDir;\n }\n auto driverLoc = findDriver(json, driver);\n if (driverLoc.found) {\n ret.driverFound = true;\n ret.steamVrRoot = driverLoc.steamVrRoot;\n ret.driverRoot = driverLoc.driverRoot;\n ret.driverName = driverLoc.driverName;\n ret.driverFile = driverLoc.driverFile;\n }\n ret.found = (driverLoc.found && config.valid);\n return ret;\n }\n\n} \/\/ namespace vive\n} \/\/ namespace osvr\n<|endoftext|>"} {"text":"<commit_before>\/*************************************************************************\n *\n * OpenOffice.org - a multi-platform office productivity suite\n *\n * $RCSfile: atlwindow.cxx,v $\n *\n * $Revision: 1.10 $\n *\n * last change: $Author: rt $ $Date: 2005-09-08 18:31: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#include <com\/sun\/star\/uno\/Reference.h>\n#include <com\/sun\/star\/lang\/XComponent.hpp>\n#include <com\/sun\/star\/lang\/XInitialization.hpp>\n#include <com\/sun\/star\/datatransfer\/dnd\/XDropTarget.hpp>\n#include <com\/sun\/star\/datatransfer\/dnd\/DNDConstants.hpp>\n\n#include <cppuhelper\/servicefactory.hxx>\n#include <rtl\/string.h>\n\n#include \"atlwindow.hxx\"\n#include \"targetlistener.hxx\"\n#include \"sourcelistener.hxx\"\n\/\/#include \"transferable.hxx\"\n#include <map>\n\n#include <winbase.h>\nusing namespace com::sun::star::lang;\nusing namespace com::sun::star::datatransfer::dnd;\nusing namespace com::sun::star::datatransfer::dnd::DNDConstants;\nusing namespace cppu;\nusing namespace rtl;\nusing namespace std;\n\nLRESULT APIENTRY EditSubclassProc( HWND hwnd, UINT uMsg,WPARAM wParam, LPARAM lParam) ;\n\n\nextern Reference< XMultiServiceFactory > MultiServiceFactory;\nDWORD WINAPI MTAFunc(LPVOID pParams);\n\nchar* szSTAWin= \"XDragSource::executeDrag is called from the same \"\n \"OLE STA thread that created the window.\";\nchar* szMTAWin= \"XDragSource::executeDrag is called from a MTA thread \"\n \"that did not create the window.\";\n\nWNDPROC wpOrigEditProc;\n\nmap<HWND, HWND> mapEditToMainWnd;\n\nLRESULT AWindow::OnClose(UINT uMsg, WPARAM wParam, LPARAM lParam, BOOL& bHandled)\n{\n Reference<XComponent> xcompSource( m_xDragSource, UNO_QUERY);\n\n PostQuitMessage(0);\n\n\n m_xDropTarget=0;\n m_xDragSource=0;\n\n\n \/\/ Remove the subclass from the edit control.\n ::SetWindowLong(m_hwndEdit, GWL_WNDPROC,\n (LONG) wpOrigEditProc);\n\n return 0;\n}\n\n\nLRESULT AWindow::OnCreate(UINT uMsg, WPARAM wParam, LPARAM lParam, BOOL& bHandled)\n{\n \/\/ Prepare the EDIT control\n m_hwndEdit = CreateWindowA(\n \"EDIT\", \/\/ predefined class\n NULL, \/\/ no window title\n WS_CHILD | WS_VISIBLE | WS_VSCROLL |\n ES_LEFT | ES_MULTILINE | ES_AUTOVSCROLL,\n 0, 0, 0, 0, \/\/ set size in WM_SIZE message\n m_hWnd, \/\/ parent window\n (HMENU) NULL, \/\/ edit control ID\n (HINSTANCE) GetWindowLong( GWL_HINSTANCE),\n NULL);\n\n \/\/ the map is used in the window procedure for the edit window to associate the\n \/\/ it to the right main window ( AWindow)\n mapEditToMainWnd[m_hwndEdit]= m_hWnd;\n \/\/ Superclass the edit window, because we want to process mouse messages\n wpOrigEditProc = (WNDPROC) ::SetWindowLongA(m_hwndEdit,\n GWL_WNDPROC, (LONG) EditSubclassProc);\n\n\n \/\/ Add text to the window.\n if( m_isMTA)\n ::SendMessageA(m_hwndEdit, WM_SETTEXT, 0, (LPARAM) szMTAWin);\n else\n ::SendMessageA(m_hwndEdit, WM_SETTEXT, 0, (LPARAM) szSTAWin);\n\n\n \/\/ create the DragSource\n Reference< XInterface> xint= MultiServiceFactory->createInstance(OUString(L\"com.sun.star.datatransfer.dnd.OleDragSource\"));\n m_xDragSource= Reference<XDragSource>( xint, UNO_QUERY);\n Reference<XInitialization> xInit( xint, UNO_QUERY);\n\n Any ar[2];\n ar[1]<<= (sal_uInt32)m_hWnd;\n xInit->initialize( Sequence<Any>( ar, 2) );\n\n \/\/create the DropTarget\n Reference< XInterface> xintTarget= MultiServiceFactory->createInstance(OUString(L\"com.sun.star.datatransfer.dnd.OleDropTarget\"));\n m_xDropTarget= Reference<XDropTarget>( xintTarget, UNO_QUERY);\n Reference<XInitialization> xInitTarget( xintTarget, UNO_QUERY);\n\n Any any;\n any <<= (sal_uInt32)m_hWnd;\n xInitTarget->initialize( Sequence<Any>( &any, 1) );\n\n\n m_xDropTarget->addDropTargetListener( static_cast<XDropTargetListener*>\n ( new DropTargetListener( m_hwndEdit)) );\n\/\/ \/\/ make this window tho a drop target\n m_xDropTarget->setActive(sal_True);\n\n return 0;\n}\n\n\/\/ When the mouse is dragged for a second than a drag is initiated\nLRESULT AWindow::OnMouseAction(UINT uMsg, WPARAM wParam, LPARAM lParam, BOOL& bHandled)\n{\n if( uMsg== WM_LBUTTONDOWN)\n {\n SetTimer( 1, 1000);\n }\n\n else if( uMsg == WM_LBUTTONUP)\n {\n KillTimer( 1);\n }\n\n return 0;\n}\n\nLRESULT AWindow::OnTimer(UINT uMsg, WPARAM wParam, LPARAM lParam, BOOL& bHandled)\n{\n HRESULT hr;\n USES_CONVERSION;\n KillTimer( 1);\n if(m_xDragSource.is())\n {\n\n \/\/Get the Text out of the Edit window\n int length= (int)::SendMessageA( m_hwndEdit, WM_GETTEXTLENGTH, 0, 0);\n char * pBuffer= new char[length + 1];\n ZeroMemory( pBuffer, length + 1);\n ::SendMessageA( m_hwndEdit, WM_GETTEXT, length, (LPARAM) pBuffer);\n\n IDataObject* pData= NULL;\n HRESULT hr= CreateDataCache( NULL, CLSID_NULL, __uuidof(IDataObject),(void**) &pData);\n if( pData)\n {\n FORMATETC format={ CF_TEXT, NULL, DVASPECT_CONTENT, -1, };\n\n HGLOBAL mem= GlobalAlloc(GHND, length + 1 );\n void* pMem= GlobalLock( mem);\n memcpy( pMem, pBuffer, length+1);\n GlobalUnlock( mem);\n\n STGMEDIUM medium;\n medium.tymed= TYMED_HGLOBAL;\n medium.hGlobal= mem;\n medium.pUnkForRelease= NULL;\n\n pData->SetData( &format, &medium, TRUE); \/\/ releases HGLOBAL eventually\n\n Reference<XTransferable> xTrans= m_aDataConverter.createTransferableFromDataObj(\n MultiServiceFactory, pData);\n\n \/\/ call XDragSource::executeDrag from an MTA\n if( m_isMTA )\n {\n DWORD mtaThreadId;\n ThreadData data;\n data.source= m_xDragSource;\n data.transferable= xTrans;\n\n data.evtThreadReady= CreateEvent( NULL, FALSE, FALSE, NULL);\n\n HANDLE hThread= CreateThread( NULL, 0, MTAFunc, &data, 0, &mtaThreadId);\n \/\/ We must wait until the thread copied the ThreadData structure\n WaitForSingleObject( data.evtThreadReady, INFINITE);\n CloseHandle( data.evtThreadReady);\n\n\n }\n else\n {\n m_xDragSource->startDrag( DragGestureEvent(),\n ACTION_LINK|ACTION_MOVE|ACTION_COPY,\n 0,\n 0,\n xTrans,\n Reference<XDragSourceListener>( static_cast<XDragSourceListener*>(new DragSourceListener() ) ) );\n }\n }\n\n delete[] pBuffer;\n }\n\n return 0;\n}\n\nLRESULT AWindow::OnSize(UINT uMsg, WPARAM wParam, LPARAM lParam, BOOL& bHandled)\n{\n \/\/ Make the edit control the size of the window's\n \/\/ client area.\n ::MoveWindow(m_hwndEdit,\n 0, 0, \/\/ starting x- and y-coordinates\n LOWORD(lParam), \/\/ width of client area\n HIWORD(lParam), \/\/ height of client area\n TRUE); \/\/ repaint window\n\n return 0;\n}\nLRESULT AWindow::OnFocus(UINT uMsg, WPARAM wParam, LPARAM lParam, BOOL& bHandled)\n{\n ::SetFocus(m_hwndEdit);\n return 0;\n}\n\n\n\n\/\/ Subclass procedure for EDIT window\nLRESULT APIENTRY EditSubclassProc( HWND hwnd, UINT uMsg,WPARAM wParam, LPARAM lParam)\n{\n\n if( uMsg >= WM_MOUSEFIRST && uMsg <= WM_MOUSELAST)\n {\n HWND hAWindow= mapEditToMainWnd[hwnd];\n ::SendMessage( hAWindow, uMsg, wParam, lParam);\n\n }\n return CallWindowProc( wpOrigEditProc, hwnd, uMsg,\n wParam, lParam);\n}\n\n<commit_msg>INTEGRATION: CWS pchfix02 (1.10.40); FILE MERGED 2006\/09\/01 17:25:41 kaib 1.10.40.1: #i68856# Added header markers and pch files<commit_after>\/*************************************************************************\n *\n * OpenOffice.org - a multi-platform office productivity suite\n *\n * $RCSfile: atlwindow.cxx,v $\n *\n * $Revision: 1.11 $\n *\n * last change: $Author: obo $ $Date: 2006-09-17 17:04: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_dtrans.hxx\"\n\n#include <com\/sun\/star\/uno\/Reference.h>\n#include <com\/sun\/star\/lang\/XComponent.hpp>\n#include <com\/sun\/star\/lang\/XInitialization.hpp>\n#include <com\/sun\/star\/datatransfer\/dnd\/XDropTarget.hpp>\n#include <com\/sun\/star\/datatransfer\/dnd\/DNDConstants.hpp>\n\n#include <cppuhelper\/servicefactory.hxx>\n#include <rtl\/string.h>\n\n#include \"atlwindow.hxx\"\n#include \"targetlistener.hxx\"\n#include \"sourcelistener.hxx\"\n\/\/#include \"transferable.hxx\"\n#include <map>\n\n#include <winbase.h>\nusing namespace com::sun::star::lang;\nusing namespace com::sun::star::datatransfer::dnd;\nusing namespace com::sun::star::datatransfer::dnd::DNDConstants;\nusing namespace cppu;\nusing namespace rtl;\nusing namespace std;\n\nLRESULT APIENTRY EditSubclassProc( HWND hwnd, UINT uMsg,WPARAM wParam, LPARAM lParam) ;\n\n\nextern Reference< XMultiServiceFactory > MultiServiceFactory;\nDWORD WINAPI MTAFunc(LPVOID pParams);\n\nchar* szSTAWin= \"XDragSource::executeDrag is called from the same \"\n \"OLE STA thread that created the window.\";\nchar* szMTAWin= \"XDragSource::executeDrag is called from a MTA thread \"\n \"that did not create the window.\";\n\nWNDPROC wpOrigEditProc;\n\nmap<HWND, HWND> mapEditToMainWnd;\n\nLRESULT AWindow::OnClose(UINT uMsg, WPARAM wParam, LPARAM lParam, BOOL& bHandled)\n{\n Reference<XComponent> xcompSource( m_xDragSource, UNO_QUERY);\n\n PostQuitMessage(0);\n\n\n m_xDropTarget=0;\n m_xDragSource=0;\n\n\n \/\/ Remove the subclass from the edit control.\n ::SetWindowLong(m_hwndEdit, GWL_WNDPROC,\n (LONG) wpOrigEditProc);\n\n return 0;\n}\n\n\nLRESULT AWindow::OnCreate(UINT uMsg, WPARAM wParam, LPARAM lParam, BOOL& bHandled)\n{\n \/\/ Prepare the EDIT control\n m_hwndEdit = CreateWindowA(\n \"EDIT\", \/\/ predefined class\n NULL, \/\/ no window title\n WS_CHILD | WS_VISIBLE | WS_VSCROLL |\n ES_LEFT | ES_MULTILINE | ES_AUTOVSCROLL,\n 0, 0, 0, 0, \/\/ set size in WM_SIZE message\n m_hWnd, \/\/ parent window\n (HMENU) NULL, \/\/ edit control ID\n (HINSTANCE) GetWindowLong( GWL_HINSTANCE),\n NULL);\n\n \/\/ the map is used in the window procedure for the edit window to associate the\n \/\/ it to the right main window ( AWindow)\n mapEditToMainWnd[m_hwndEdit]= m_hWnd;\n \/\/ Superclass the edit window, because we want to process mouse messages\n wpOrigEditProc = (WNDPROC) ::SetWindowLongA(m_hwndEdit,\n GWL_WNDPROC, (LONG) EditSubclassProc);\n\n\n \/\/ Add text to the window.\n if( m_isMTA)\n ::SendMessageA(m_hwndEdit, WM_SETTEXT, 0, (LPARAM) szMTAWin);\n else\n ::SendMessageA(m_hwndEdit, WM_SETTEXT, 0, (LPARAM) szSTAWin);\n\n\n \/\/ create the DragSource\n Reference< XInterface> xint= MultiServiceFactory->createInstance(OUString(L\"com.sun.star.datatransfer.dnd.OleDragSource\"));\n m_xDragSource= Reference<XDragSource>( xint, UNO_QUERY);\n Reference<XInitialization> xInit( xint, UNO_QUERY);\n\n Any ar[2];\n ar[1]<<= (sal_uInt32)m_hWnd;\n xInit->initialize( Sequence<Any>( ar, 2) );\n\n \/\/create the DropTarget\n Reference< XInterface> xintTarget= MultiServiceFactory->createInstance(OUString(L\"com.sun.star.datatransfer.dnd.OleDropTarget\"));\n m_xDropTarget= Reference<XDropTarget>( xintTarget, UNO_QUERY);\n Reference<XInitialization> xInitTarget( xintTarget, UNO_QUERY);\n\n Any any;\n any <<= (sal_uInt32)m_hWnd;\n xInitTarget->initialize( Sequence<Any>( &any, 1) );\n\n\n m_xDropTarget->addDropTargetListener( static_cast<XDropTargetListener*>\n ( new DropTargetListener( m_hwndEdit)) );\n\/\/ \/\/ make this window tho a drop target\n m_xDropTarget->setActive(sal_True);\n\n return 0;\n}\n\n\/\/ When the mouse is dragged for a second than a drag is initiated\nLRESULT AWindow::OnMouseAction(UINT uMsg, WPARAM wParam, LPARAM lParam, BOOL& bHandled)\n{\n if( uMsg== WM_LBUTTONDOWN)\n {\n SetTimer( 1, 1000);\n }\n\n else if( uMsg == WM_LBUTTONUP)\n {\n KillTimer( 1);\n }\n\n return 0;\n}\n\nLRESULT AWindow::OnTimer(UINT uMsg, WPARAM wParam, LPARAM lParam, BOOL& bHandled)\n{\n HRESULT hr;\n USES_CONVERSION;\n KillTimer( 1);\n if(m_xDragSource.is())\n {\n\n \/\/Get the Text out of the Edit window\n int length= (int)::SendMessageA( m_hwndEdit, WM_GETTEXTLENGTH, 0, 0);\n char * pBuffer= new char[length + 1];\n ZeroMemory( pBuffer, length + 1);\n ::SendMessageA( m_hwndEdit, WM_GETTEXT, length, (LPARAM) pBuffer);\n\n IDataObject* pData= NULL;\n HRESULT hr= CreateDataCache( NULL, CLSID_NULL, __uuidof(IDataObject),(void**) &pData);\n if( pData)\n {\n FORMATETC format={ CF_TEXT, NULL, DVASPECT_CONTENT, -1, };\n\n HGLOBAL mem= GlobalAlloc(GHND, length + 1 );\n void* pMem= GlobalLock( mem);\n memcpy( pMem, pBuffer, length+1);\n GlobalUnlock( mem);\n\n STGMEDIUM medium;\n medium.tymed= TYMED_HGLOBAL;\n medium.hGlobal= mem;\n medium.pUnkForRelease= NULL;\n\n pData->SetData( &format, &medium, TRUE); \/\/ releases HGLOBAL eventually\n\n Reference<XTransferable> xTrans= m_aDataConverter.createTransferableFromDataObj(\n MultiServiceFactory, pData);\n\n \/\/ call XDragSource::executeDrag from an MTA\n if( m_isMTA )\n {\n DWORD mtaThreadId;\n ThreadData data;\n data.source= m_xDragSource;\n data.transferable= xTrans;\n\n data.evtThreadReady= CreateEvent( NULL, FALSE, FALSE, NULL);\n\n HANDLE hThread= CreateThread( NULL, 0, MTAFunc, &data, 0, &mtaThreadId);\n \/\/ We must wait until the thread copied the ThreadData structure\n WaitForSingleObject( data.evtThreadReady, INFINITE);\n CloseHandle( data.evtThreadReady);\n\n\n }\n else\n {\n m_xDragSource->startDrag( DragGestureEvent(),\n ACTION_LINK|ACTION_MOVE|ACTION_COPY,\n 0,\n 0,\n xTrans,\n Reference<XDragSourceListener>( static_cast<XDragSourceListener*>(new DragSourceListener() ) ) );\n }\n }\n\n delete[] pBuffer;\n }\n\n return 0;\n}\n\nLRESULT AWindow::OnSize(UINT uMsg, WPARAM wParam, LPARAM lParam, BOOL& bHandled)\n{\n \/\/ Make the edit control the size of the window's\n \/\/ client area.\n ::MoveWindow(m_hwndEdit,\n 0, 0, \/\/ starting x- and y-coordinates\n LOWORD(lParam), \/\/ width of client area\n HIWORD(lParam), \/\/ height of client area\n TRUE); \/\/ repaint window\n\n return 0;\n}\nLRESULT AWindow::OnFocus(UINT uMsg, WPARAM wParam, LPARAM lParam, BOOL& bHandled)\n{\n ::SetFocus(m_hwndEdit);\n return 0;\n}\n\n\n\n\/\/ Subclass procedure for EDIT window\nLRESULT APIENTRY EditSubclassProc( HWND hwnd, UINT uMsg,WPARAM wParam, LPARAM lParam)\n{\n\n if( uMsg >= WM_MOUSEFIRST && uMsg <= WM_MOUSELAST)\n {\n HWND hAWindow= mapEditToMainWnd[hwnd];\n ::SendMessage( hAWindow, uMsg, wParam, lParam);\n\n }\n return CallWindowProc( wpOrigEditProc, hwnd, uMsg,\n wParam, lParam);\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 \"compiler_llvm.h\"\n\n#include \"class_linker.h\"\n#include \"compilation_unit.h\"\n#include \"compiled_method.h\"\n#include \"compiler.h\"\n#include \"dex_cache.h\"\n#include \"elf_image.h\"\n#include \"elf_loader.h\"\n#include \"ir_builder.h\"\n#include \"jni_compiler.h\"\n#include \"method_compiler.h\"\n#include \"oat_compilation_unit.h\"\n#include \"oat_file.h\"\n#include \"stl_util.h\"\n#include \"upcall_compiler.h\"\n\n#include <llvm\/LinkAllPasses.h>\n#include <llvm\/LinkAllVMCore.h>\n#include <llvm\/Support\/CommandLine.h>\n#include <llvm\/Support\/ManagedStatic.h>\n#include <llvm\/Support\/TargetSelect.h>\n#include <llvm\/Support\/Threading.h>\n\nnamespace llvm {\n extern bool TimePassesIsEnabled;\n}\n\n\/\/ NOTE: Although EnableARMLongCalls is defined in llvm\/lib\/Target\/ARM\/\n\/\/ ARMISelLowering.cpp, however, it is not in the llvm namespace.\nextern llvm::cl::opt<bool> EnableARMLongCalls;\n\n\/\/ ReserveR9 is defined in llvm\/lib\/Target\/ARM\/ARMSubtarget.cpp\nextern llvm::cl::opt<bool> ReserveR9;\n\n\nnamespace {\n\npthread_once_t llvm_initialized = PTHREAD_ONCE_INIT;\n\nvoid InitializeLLVM() {\n \/\/ NOTE: Uncomment following line to show the time consumption of LLVM passes\n \/\/llvm::TimePassesIsEnabled = true;\n\n \/\/ Enable -arm-reserve-r9\n ReserveR9 = true;\n\n \/\/ Initialize LLVM target, MC subsystem, asm printer, and asm parser\n llvm::InitializeAllTargets();\n llvm::InitializeAllTargetMCs();\n llvm::InitializeAllAsmPrinters();\n llvm::InitializeAllAsmParsers();\n \/\/ TODO: Maybe we don't have to initialize \"all\" targets.\n\n \/\/ Enable -arm-long-calls\n EnableARMLongCalls = false;\n\n \/\/ Initialize LLVM optimization passes\n llvm::PassRegistry ®istry = *llvm::PassRegistry::getPassRegistry();\n\n llvm::initializeCore(registry);\n llvm::initializeScalarOpts(registry);\n llvm::initializeIPO(registry);\n llvm::initializeAnalysis(registry);\n llvm::initializeIPA(registry);\n llvm::initializeTransformUtils(registry);\n llvm::initializeInstCombine(registry);\n llvm::initializeInstrumentation(registry);\n llvm::initializeTarget(registry);\n\n \/\/ Initialize LLVM internal data structure for multithreading\n llvm::llvm_start_multithreaded();\n}\n\n\/\/ The Guard to Shutdown LLVM\n\/\/ llvm::llvm_shutdown_obj llvm_guard;\n\/\/ TODO: We are commenting out this line because this will cause SEGV from\n\/\/ time to time.\n\/\/ Two reasons: (1) the order of the destruction of static objects, or\n\/\/ (2) dlopen\/dlclose side-effect on static objects.\n\n} \/\/ anonymous namespace\n\n\nnamespace art {\nnamespace compiler_llvm {\n\n\nllvm::Module* makeLLVMModuleContents(llvm::Module* module);\n\n\nCompilerLLVM::CompilerLLVM(Compiler* compiler, InstructionSet insn_set)\n : compiler_(compiler), compiler_lock_(\"llvm_compiler_lock\"),\n insn_set_(insn_set), curr_cunit_(NULL) {\n\n\n \/\/ Initialize LLVM libraries\n pthread_once(&llvm_initialized, InitializeLLVM);\n}\n\n\nCompilerLLVM::~CompilerLLVM() {\n STLDeleteElements(&cunits_);\n}\n\n\nvoid CompilerLLVM::EnsureCompilationUnit() {\n compiler_lock_.AssertHeld();\n\n if (curr_cunit_ != NULL) {\n return;\n }\n\n \/\/ Allocate compilation unit\n size_t cunit_idx = cunits_.size();\n curr_cunit_ = new CompilationUnit(insn_set_, cunit_idx);\n\n \/\/ Register compilation unit\n cunits_.push_back(curr_cunit_);\n}\n\n\nvoid CompilerLLVM::MaterializeRemainder() {\n compiler_lock_.Lock();\n \/\/ Localize\n CompilationUnit* cunit = curr_cunit_;\n \/\/ Reset the curr_cuit_\n curr_cunit_ = NULL;\n compiler_lock_.Unlock();\n\n if (cunit != NULL) {\n Materialize(cunit);\n }\n}\n\n\nvoid CompilerLLVM::MaterializeIfThresholdReached() {\n compiler_lock_.Lock();\n \/\/ Localize\n CompilationUnit* cunit = curr_cunit_;\n\n if (curr_cunit_ != NULL && curr_cunit_->IsMaterializeThresholdReached()) {\n \/\/ Delete the compilation unit\n curr_cunit_ = NULL;\n } else {\n \/\/ Reset cunit such that Materialize() won't be invoked\n cunit = NULL;\n }\n\n compiler_lock_.Unlock();\n\n if (cunit != NULL) {\n Materialize(cunit);\n }\n}\n\n\nvoid CompilerLLVM::Materialize(CompilationUnit* cunit) {\n DCHECK(cunit != NULL);\n DCHECK(!cunit->IsMaterialized());\n\n \/\/ Write bitcode to file when filename is set\n if (IsBitcodeFileNameAvailable()) {\n const size_t cunit_idx = cunits_.size();\n cunit->WriteBitcodeToFile(\n StringPrintf(\"%s-%zu\", bitcode_filename_.c_str(), cunit_idx));\n }\n\n \/\/ Materialize the llvm::Module into ELF object file\n cunit->Materialize();\n\n \/\/ Load ELF image when automatic ELF loading is enabled\n if (IsAutoElfLoadingEnabled()) {\n LoadElfFromCompilationUnit(cunit);\n }\n}\n\n\nvoid CompilerLLVM::EnableAutoElfLoading() {\n MutexLock GUARD(compiler_lock_);\n\n if (IsAutoElfLoadingEnabled()) {\n \/\/ If there is an existing ELF loader, then do nothing.\n \/\/ Because the existing ELF loader may have returned some code address\n \/\/ already. If we replace the existing ELF loader with\n \/\/ elf_loader_.reset(...), then it is possible to have some dangling\n \/\/ pointer.\n return;\n }\n\n \/\/ Create ELF loader and load the materialized CompilationUnit\n elf_loader_.reset(new ElfLoader());\n\n for (size_t i = 0; i < cunits_.size(); ++i) {\n if (cunits_[i]->IsMaterialized()) {\n LoadElfFromCompilationUnit(cunits_[i]);\n }\n }\n}\n\n\nvoid CompilerLLVM::LoadElfFromCompilationUnit(const CompilationUnit* cunit) {\n compiler_lock_.AssertHeld();\n DCHECK(cunit->IsMaterialized()) << cunit->GetElfIndex();\n\n if (!elf_loader_->LoadElfAt(cunit->GetElfIndex(),\n cunit->GetElfImage(),\n OatFile::kRelocAll)) {\n LOG(ERROR) << \"Failed to load ELF from compilation unit \"\n << cunit->GetElfIndex();\n }\n}\n\n\nconst void* CompilerLLVM::GetMethodCodeAddr(const CompiledMethod* cm) const {\n return elf_loader_->GetMethodCodeAddr(cm->GetElfIndex(),\n cm->GetElfFuncIndex());\n}\n\n\nconst Method::InvokeStub* CompilerLLVM::\nGetMethodInvokeStubAddr(const CompiledInvokeStub* cm) const {\n return elf_loader_->GetMethodInvokeStubAddr(cm->GetElfIndex(),\n cm->GetElfFuncIndex());\n}\n\n\nstd::vector<ElfImage> CompilerLLVM::GetElfImages() const {\n std::vector<ElfImage> result;\n\n for (size_t i = 0; i < cunits_.size(); ++i) {\n result.push_back(cunits_[i]->GetElfImage());\n }\n\n return result;\n}\n\n\nCompiledMethod* CompilerLLVM::\nCompileDexMethod(OatCompilationUnit* oat_compilation_unit) {\n MutexLock GUARD(compiler_lock_);\n\n EnsureCompilationUnit();\n\n UniquePtr<MethodCompiler> method_compiler(\n new MethodCompiler(curr_cunit_, compiler_, oat_compilation_unit));\n\n return method_compiler->Compile();\n}\n\n\nCompiledMethod* CompilerLLVM::\nCompileNativeMethod(OatCompilationUnit* oat_compilation_unit) {\n MutexLock GUARD(compiler_lock_);\n\n EnsureCompilationUnit();\n\n UniquePtr<JniCompiler> jni_compiler(\n new JniCompiler(curr_cunit_, *compiler_, oat_compilation_unit));\n\n return jni_compiler->Compile();\n}\n\n\nCompiledInvokeStub* CompilerLLVM::CreateInvokeStub(bool is_static,\n char const *shorty) {\n MutexLock GUARD(compiler_lock_);\n\n EnsureCompilationUnit();\n\n UniquePtr<UpcallCompiler> upcall_compiler(\n new UpcallCompiler(curr_cunit_, *compiler_));\n\n return upcall_compiler->CreateStub(is_static, shorty);\n}\n\n} \/\/ namespace compiler_llvm\n} \/\/ namespace art\n\ninline static art::compiler_llvm::CompilerLLVM* ContextOf(art::Compiler& compiler) {\n void *compiler_context = compiler.GetCompilerContext();\n CHECK(compiler_context != NULL);\n return reinterpret_cast<art::compiler_llvm::CompilerLLVM*>(compiler_context);\n}\n\ninline static const art::compiler_llvm::CompilerLLVM* ContextOf(const art::Compiler& compiler) {\n void *compiler_context = compiler.GetCompilerContext();\n CHECK(compiler_context != NULL);\n return reinterpret_cast<const art::compiler_llvm::CompilerLLVM*>(compiler_context);\n}\n\nextern \"C\" void ArtInitCompilerContext(art::Compiler& compiler) {\n CHECK(compiler.GetCompilerContext() == NULL);\n\n art::compiler_llvm::CompilerLLVM* compiler_llvm =\n new art::compiler_llvm::CompilerLLVM(&compiler,\n compiler.GetInstructionSet());\n\n compiler.SetCompilerContext(compiler_llvm);\n}\n\nextern \"C\" art::CompiledMethod* ArtCompileMethod(art::Compiler& compiler,\n const art::DexFile::CodeItem* code_item,\n uint32_t access_flags, uint32_t method_idx,\n const art::ClassLoader* class_loader,\n const art::DexFile& dex_file)\n{\n art::ClassLinker *class_linker = art::Runtime::Current()->GetClassLinker();\n art::DexCache *dex_cache = class_linker->FindDexCache(dex_file);\n\n art::OatCompilationUnit oat_compilation_unit(\n class_loader, class_linker, dex_file, *dex_cache, code_item,\n method_idx, access_flags);\n art::compiler_llvm::CompilerLLVM* compiler_llvm = ContextOf(compiler);\n art::CompiledMethod* result = compiler_llvm->CompileDexMethod(&oat_compilation_unit);\n compiler_llvm->MaterializeIfThresholdReached();\n return result;\n}\n\nextern \"C\" art::CompiledMethod* ArtJniCompileMethod(art::Compiler& compiler,\n uint32_t access_flags, uint32_t method_idx,\n const art::DexFile& dex_file) {\n art::ClassLinker *class_linker = art::Runtime::Current()->GetClassLinker();\n art::DexCache *dex_cache = class_linker->FindDexCache(dex_file);\n\n art::OatCompilationUnit oat_compilation_unit(\n NULL, class_linker, dex_file, *dex_cache, NULL,\n method_idx, access_flags);\n\n art::compiler_llvm::CompilerLLVM* compiler_llvm = ContextOf(compiler);\n art::CompiledMethod* result = compiler_llvm->CompileNativeMethod(&oat_compilation_unit);\n compiler_llvm->MaterializeIfThresholdReached();\n return result;\n}\n\nextern \"C\" art::CompiledInvokeStub* ArtCreateInvokeStub(art::Compiler& compiler, bool is_static,\n const char* shorty, uint32_t shorty_len) {\n art::compiler_llvm::CompilerLLVM* compiler_llvm = ContextOf(compiler);\n art::CompiledInvokeStub* result = compiler_llvm->CreateInvokeStub(is_static, shorty);\n compiler_llvm->MaterializeIfThresholdReached();\n return result;\n}\n\nextern \"C\" void compilerLLVMSetBitcodeFileName(art::Compiler& compiler,\n std::string const& filename) {\n ContextOf(compiler)->SetBitcodeFileName(filename);\n}\n\nextern \"C\" void compilerLLVMMaterializeRemainder(art::Compiler& compiler) {\n ContextOf(compiler)->MaterializeRemainder();\n}\n\nextern \"C\" void compilerLLVMEnableAutoElfLoading(art::Compiler& compiler) {\n art::compiler_llvm::CompilerLLVM* compiler_llvm =\n reinterpret_cast<art::compiler_llvm::CompilerLLVM*>(compiler.GetCompilerContext());\n return compiler_llvm->EnableAutoElfLoading();\n}\n\nextern \"C\" const void* compilerLLVMGetMethodCodeAddr(const art::Compiler& compiler,\n const art::CompiledMethod* cm,\n const art::Method*) {\n const art::compiler_llvm::CompilerLLVM* compiler_llvm =\n reinterpret_cast<const art::compiler_llvm::CompilerLLVM*>(compiler.GetCompilerContext());\n return compiler_llvm->GetMethodCodeAddr(cm);\n}\n\nextern \"C\" const art::Method::InvokeStub* compilerLLVMGetMethodInvokeStubAddr(const art::Compiler& compiler,\n const art::CompiledInvokeStub* cm,\n const art::Method*) {\n const art::compiler_llvm::CompilerLLVM* compiler_llvm =\n reinterpret_cast<const art::compiler_llvm::CompilerLLVM*>(compiler.GetCompilerContext());\n return compiler_llvm->GetMethodInvokeStubAddr(cm);\n}\n\nextern \"C\" std::vector<art::ElfImage> compilerLLVMGetElfImages(const art::Compiler& compiler) {\n return ContextOf(compiler)->GetElfImages();\n}\n\nextern \"C\" void compilerLLVMDispose(art::Compiler& compiler) {\n delete ContextOf(compiler);\n}\n<commit_msg>am 80cd474b: Fix unit test by holding compiler_lock_ on ourselves.<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 \"compiler_llvm.h\"\n\n#include \"class_linker.h\"\n#include \"compilation_unit.h\"\n#include \"compiled_method.h\"\n#include \"compiler.h\"\n#include \"dex_cache.h\"\n#include \"elf_image.h\"\n#include \"elf_loader.h\"\n#include \"ir_builder.h\"\n#include \"jni_compiler.h\"\n#include \"method_compiler.h\"\n#include \"oat_compilation_unit.h\"\n#include \"oat_file.h\"\n#include \"stl_util.h\"\n#include \"upcall_compiler.h\"\n\n#include <llvm\/LinkAllPasses.h>\n#include <llvm\/LinkAllVMCore.h>\n#include <llvm\/Support\/CommandLine.h>\n#include <llvm\/Support\/ManagedStatic.h>\n#include <llvm\/Support\/TargetSelect.h>\n#include <llvm\/Support\/Threading.h>\n\nnamespace llvm {\n extern bool TimePassesIsEnabled;\n}\n\n\/\/ NOTE: Although EnableARMLongCalls is defined in llvm\/lib\/Target\/ARM\/\n\/\/ ARMISelLowering.cpp, however, it is not in the llvm namespace.\nextern llvm::cl::opt<bool> EnableARMLongCalls;\n\n\/\/ ReserveR9 is defined in llvm\/lib\/Target\/ARM\/ARMSubtarget.cpp\nextern llvm::cl::opt<bool> ReserveR9;\n\n\nnamespace {\n\npthread_once_t llvm_initialized = PTHREAD_ONCE_INIT;\n\nvoid InitializeLLVM() {\n \/\/ NOTE: Uncomment following line to show the time consumption of LLVM passes\n \/\/llvm::TimePassesIsEnabled = true;\n\n \/\/ Enable -arm-reserve-r9\n ReserveR9 = true;\n\n \/\/ Initialize LLVM target, MC subsystem, asm printer, and asm parser\n llvm::InitializeAllTargets();\n llvm::InitializeAllTargetMCs();\n llvm::InitializeAllAsmPrinters();\n llvm::InitializeAllAsmParsers();\n \/\/ TODO: Maybe we don't have to initialize \"all\" targets.\n\n \/\/ Enable -arm-long-calls\n EnableARMLongCalls = false;\n\n \/\/ Initialize LLVM optimization passes\n llvm::PassRegistry ®istry = *llvm::PassRegistry::getPassRegistry();\n\n llvm::initializeCore(registry);\n llvm::initializeScalarOpts(registry);\n llvm::initializeIPO(registry);\n llvm::initializeAnalysis(registry);\n llvm::initializeIPA(registry);\n llvm::initializeTransformUtils(registry);\n llvm::initializeInstCombine(registry);\n llvm::initializeInstrumentation(registry);\n llvm::initializeTarget(registry);\n\n \/\/ Initialize LLVM internal data structure for multithreading\n llvm::llvm_start_multithreaded();\n}\n\n\/\/ The Guard to Shutdown LLVM\n\/\/ llvm::llvm_shutdown_obj llvm_guard;\n\/\/ TODO: We are commenting out this line because this will cause SEGV from\n\/\/ time to time.\n\/\/ Two reasons: (1) the order of the destruction of static objects, or\n\/\/ (2) dlopen\/dlclose side-effect on static objects.\n\n} \/\/ anonymous namespace\n\n\nnamespace art {\nnamespace compiler_llvm {\n\n\nllvm::Module* makeLLVMModuleContents(llvm::Module* module);\n\n\nCompilerLLVM::CompilerLLVM(Compiler* compiler, InstructionSet insn_set)\n : compiler_(compiler), compiler_lock_(\"llvm_compiler_lock\"),\n insn_set_(insn_set), curr_cunit_(NULL) {\n\n\n \/\/ Initialize LLVM libraries\n pthread_once(&llvm_initialized, InitializeLLVM);\n}\n\n\nCompilerLLVM::~CompilerLLVM() {\n STLDeleteElements(&cunits_);\n}\n\n\nvoid CompilerLLVM::EnsureCompilationUnit() {\n compiler_lock_.AssertHeld();\n\n if (curr_cunit_ != NULL) {\n return;\n }\n\n \/\/ Allocate compilation unit\n size_t cunit_idx = cunits_.size();\n curr_cunit_ = new CompilationUnit(insn_set_, cunit_idx);\n\n \/\/ Register compilation unit\n cunits_.push_back(curr_cunit_);\n}\n\n\nvoid CompilerLLVM::MaterializeRemainder() {\n compiler_lock_.Lock();\n \/\/ Localize\n CompilationUnit* cunit = curr_cunit_;\n \/\/ Reset the curr_cuit_\n curr_cunit_ = NULL;\n compiler_lock_.Unlock();\n\n if (cunit != NULL) {\n Materialize(cunit);\n }\n}\n\n\nvoid CompilerLLVM::MaterializeIfThresholdReached() {\n compiler_lock_.Lock();\n \/\/ Localize\n CompilationUnit* cunit = curr_cunit_;\n\n if (curr_cunit_ != NULL && curr_cunit_->IsMaterializeThresholdReached()) {\n \/\/ Delete the compilation unit\n curr_cunit_ = NULL;\n } else {\n \/\/ Reset cunit such that Materialize() won't be invoked\n cunit = NULL;\n }\n\n compiler_lock_.Unlock();\n\n if (cunit != NULL) {\n Materialize(cunit);\n }\n}\n\n\nvoid CompilerLLVM::Materialize(CompilationUnit* cunit) {\n DCHECK(cunit != NULL);\n DCHECK(!cunit->IsMaterialized());\n\n \/\/ Write bitcode to file when filename is set\n if (IsBitcodeFileNameAvailable()) {\n const size_t cunit_idx = cunits_.size();\n cunit->WriteBitcodeToFile(\n StringPrintf(\"%s-%zu\", bitcode_filename_.c_str(), cunit_idx));\n }\n\n \/\/ Materialize the llvm::Module into ELF object file\n cunit->Materialize();\n\n \/\/ Load ELF image when automatic ELF loading is enabled\n if (IsAutoElfLoadingEnabled()) {\n LoadElfFromCompilationUnit(cunit);\n }\n}\n\n\nvoid CompilerLLVM::EnableAutoElfLoading() {\n MutexLock GUARD(compiler_lock_);\n\n if (IsAutoElfLoadingEnabled()) {\n \/\/ If there is an existing ELF loader, then do nothing.\n \/\/ Because the existing ELF loader may have returned some code address\n \/\/ already. If we replace the existing ELF loader with\n \/\/ elf_loader_.reset(...), then it is possible to have some dangling\n \/\/ pointer.\n return;\n }\n\n \/\/ Create ELF loader and load the materialized CompilationUnit\n elf_loader_.reset(new ElfLoader());\n\n for (size_t i = 0; i < cunits_.size(); ++i) {\n if (cunits_[i]->IsMaterialized()) {\n LoadElfFromCompilationUnit(cunits_[i]);\n }\n }\n}\n\n\nvoid CompilerLLVM::LoadElfFromCompilationUnit(const CompilationUnit* cunit) {\n MutexLock GUARD(compiler_lock_);\n DCHECK(cunit->IsMaterialized()) << cunit->GetElfIndex();\n\n if (!elf_loader_->LoadElfAt(cunit->GetElfIndex(),\n cunit->GetElfImage(),\n OatFile::kRelocAll)) {\n LOG(ERROR) << \"Failed to load ELF from compilation unit \"\n << cunit->GetElfIndex();\n }\n}\n\n\nconst void* CompilerLLVM::GetMethodCodeAddr(const CompiledMethod* cm) const {\n return elf_loader_->GetMethodCodeAddr(cm->GetElfIndex(),\n cm->GetElfFuncIndex());\n}\n\n\nconst Method::InvokeStub* CompilerLLVM::\nGetMethodInvokeStubAddr(const CompiledInvokeStub* cm) const {\n return elf_loader_->GetMethodInvokeStubAddr(cm->GetElfIndex(),\n cm->GetElfFuncIndex());\n}\n\n\nstd::vector<ElfImage> CompilerLLVM::GetElfImages() const {\n std::vector<ElfImage> result;\n\n for (size_t i = 0; i < cunits_.size(); ++i) {\n result.push_back(cunits_[i]->GetElfImage());\n }\n\n return result;\n}\n\n\nCompiledMethod* CompilerLLVM::\nCompileDexMethod(OatCompilationUnit* oat_compilation_unit) {\n MutexLock GUARD(compiler_lock_);\n\n EnsureCompilationUnit();\n\n UniquePtr<MethodCompiler> method_compiler(\n new MethodCompiler(curr_cunit_, compiler_, oat_compilation_unit));\n\n return method_compiler->Compile();\n}\n\n\nCompiledMethod* CompilerLLVM::\nCompileNativeMethod(OatCompilationUnit* oat_compilation_unit) {\n MutexLock GUARD(compiler_lock_);\n\n EnsureCompilationUnit();\n\n UniquePtr<JniCompiler> jni_compiler(\n new JniCompiler(curr_cunit_, *compiler_, oat_compilation_unit));\n\n return jni_compiler->Compile();\n}\n\n\nCompiledInvokeStub* CompilerLLVM::CreateInvokeStub(bool is_static,\n char const *shorty) {\n MutexLock GUARD(compiler_lock_);\n\n EnsureCompilationUnit();\n\n UniquePtr<UpcallCompiler> upcall_compiler(\n new UpcallCompiler(curr_cunit_, *compiler_));\n\n return upcall_compiler->CreateStub(is_static, shorty);\n}\n\n} \/\/ namespace compiler_llvm\n} \/\/ namespace art\n\ninline static art::compiler_llvm::CompilerLLVM* ContextOf(art::Compiler& compiler) {\n void *compiler_context = compiler.GetCompilerContext();\n CHECK(compiler_context != NULL);\n return reinterpret_cast<art::compiler_llvm::CompilerLLVM*>(compiler_context);\n}\n\ninline static const art::compiler_llvm::CompilerLLVM* ContextOf(const art::Compiler& compiler) {\n void *compiler_context = compiler.GetCompilerContext();\n CHECK(compiler_context != NULL);\n return reinterpret_cast<const art::compiler_llvm::CompilerLLVM*>(compiler_context);\n}\n\nextern \"C\" void ArtInitCompilerContext(art::Compiler& compiler) {\n CHECK(compiler.GetCompilerContext() == NULL);\n\n art::compiler_llvm::CompilerLLVM* compiler_llvm =\n new art::compiler_llvm::CompilerLLVM(&compiler,\n compiler.GetInstructionSet());\n\n compiler.SetCompilerContext(compiler_llvm);\n}\n\nextern \"C\" art::CompiledMethod* ArtCompileMethod(art::Compiler& compiler,\n const art::DexFile::CodeItem* code_item,\n uint32_t access_flags, uint32_t method_idx,\n const art::ClassLoader* class_loader,\n const art::DexFile& dex_file)\n{\n art::ClassLinker *class_linker = art::Runtime::Current()->GetClassLinker();\n art::DexCache *dex_cache = class_linker->FindDexCache(dex_file);\n\n art::OatCompilationUnit oat_compilation_unit(\n class_loader, class_linker, dex_file, *dex_cache, code_item,\n method_idx, access_flags);\n art::compiler_llvm::CompilerLLVM* compiler_llvm = ContextOf(compiler);\n art::CompiledMethod* result = compiler_llvm->CompileDexMethod(&oat_compilation_unit);\n compiler_llvm->MaterializeIfThresholdReached();\n return result;\n}\n\nextern \"C\" art::CompiledMethod* ArtJniCompileMethod(art::Compiler& compiler,\n uint32_t access_flags, uint32_t method_idx,\n const art::DexFile& dex_file) {\n art::ClassLinker *class_linker = art::Runtime::Current()->GetClassLinker();\n art::DexCache *dex_cache = class_linker->FindDexCache(dex_file);\n\n art::OatCompilationUnit oat_compilation_unit(\n NULL, class_linker, dex_file, *dex_cache, NULL,\n method_idx, access_flags);\n\n art::compiler_llvm::CompilerLLVM* compiler_llvm = ContextOf(compiler);\n art::CompiledMethod* result = compiler_llvm->CompileNativeMethod(&oat_compilation_unit);\n compiler_llvm->MaterializeIfThresholdReached();\n return result;\n}\n\nextern \"C\" art::CompiledInvokeStub* ArtCreateInvokeStub(art::Compiler& compiler, bool is_static,\n const char* shorty, uint32_t shorty_len) {\n art::compiler_llvm::CompilerLLVM* compiler_llvm = ContextOf(compiler);\n art::CompiledInvokeStub* result = compiler_llvm->CreateInvokeStub(is_static, shorty);\n compiler_llvm->MaterializeIfThresholdReached();\n return result;\n}\n\nextern \"C\" void compilerLLVMSetBitcodeFileName(art::Compiler& compiler,\n std::string const& filename) {\n ContextOf(compiler)->SetBitcodeFileName(filename);\n}\n\nextern \"C\" void compilerLLVMMaterializeRemainder(art::Compiler& compiler) {\n ContextOf(compiler)->MaterializeRemainder();\n}\n\nextern \"C\" void compilerLLVMEnableAutoElfLoading(art::Compiler& compiler) {\n art::compiler_llvm::CompilerLLVM* compiler_llvm =\n reinterpret_cast<art::compiler_llvm::CompilerLLVM*>(compiler.GetCompilerContext());\n return compiler_llvm->EnableAutoElfLoading();\n}\n\nextern \"C\" const void* compilerLLVMGetMethodCodeAddr(const art::Compiler& compiler,\n const art::CompiledMethod* cm,\n const art::Method*) {\n const art::compiler_llvm::CompilerLLVM* compiler_llvm =\n reinterpret_cast<const art::compiler_llvm::CompilerLLVM*>(compiler.GetCompilerContext());\n return compiler_llvm->GetMethodCodeAddr(cm);\n}\n\nextern \"C\" const art::Method::InvokeStub* compilerLLVMGetMethodInvokeStubAddr(const art::Compiler& compiler,\n const art::CompiledInvokeStub* cm,\n const art::Method*) {\n const art::compiler_llvm::CompilerLLVM* compiler_llvm =\n reinterpret_cast<const art::compiler_llvm::CompilerLLVM*>(compiler.GetCompilerContext());\n return compiler_llvm->GetMethodInvokeStubAddr(cm);\n}\n\nextern \"C\" std::vector<art::ElfImage> compilerLLVMGetElfImages(const art::Compiler& compiler) {\n return ContextOf(compiler)->GetElfImages();\n}\n\nextern \"C\" void compilerLLVMDispose(art::Compiler& compiler) {\n delete ContextOf(compiler);\n}\n<|endoftext|>"} {"text":"<commit_before>#ifndef DUNE_STUFF_GRID_PROVIDER_CUBE_HH\n#define DUNE_STUFF_GRID_PROVIDER_CUBE_HH\n\n\/\/ dune-common\n#include <dune\/common\/parametertree.hh>\n#include <dune\/common\/shared_ptr.hh>\n#include <dune\/common\/exceptions.hh>\n#include <dune\/common\/fvector.hh>\n\n\/\/ dune-grid\n#include <dune\/grid\/utility\/structuredgridfactory.hh>\n#include <dune\/grid\/yaspgrid.hh>\n#include <dune\/grid\/alugrid.hh>\n#include <dune\/grid\/sgrid.hh>\n#include <dune\/grid\/common\/mcmgmapper.hh>\n#include <dune\/grid\/io\/file\/vtk\/vtkwriter.hh>\n\nnamespace Dune\n{\n\nnamespace Stuff\n{\n\nnamespace Grid\n{\n\nnamespace Provider\n{\n\n\/**\n \\brief Creates a grid of a cube in various dimensions.\n\n Default implementation using the Dune::StructuredGridFactory to create a grid of a cube in 1, 2 or 3\n dimensions. Tested with\n <ul><li> \\c YASPGRID, \\c variant 1, dim = 1, 2, 3,\n <li> \\c SGRID, \\c variant 1, dim = 1, 2, 3,\n <li> \\c ALUGRID_SIMPLEX, \\c variant 2, dim = 2, 3,\n <li> \\c ALUGRID_CONFORM, \\c variant 2, dim = 2, 2 and\n <li> \\c ALUGRID_CUBE, \\c variant 1, dim = 2, 3.<\/ul>\n \\tparam GridImp\n Type of the underlying grid.\n \\tparam variant\n Type of the codim 0 elements:\n <ul><li>\\c 1: cubes\n <li>2: simplices<\/ul>\n **\/\ntemplate< typename GridImp, int variant >\nclass GenericCube\n{\npublic:\n \/\/! Type of the provided grid.\n typedef GridImp GridType;\n\n \/\/! Dimension of the provided grid.\n static const int dim = GridType::dimension;\n\n \/\/! Type of the grids coordinates.\n typedef Dune::FieldVector< typename GridType::ctype, dim > CoordinateType;\n\n \/\/! Unique identifier: \\c stuff.grid.provider.cube\n static const std::string id;\n\n \/**\n \\brief Creates a cube.\n \\param[in] paramTree\n A Dune::ParameterTree containing\n <ul><li> the following keys directly or\n <li> a subtree named Cube::id, containing the following keys.<\/ul>\n The actual keys are:\n <ul><li> \\c lowerLeft: \\a double that is used as a lower left corner in each dimension.\n <li> \\c upperRight: \\a double that is used as a upper right corner in each dimension.<\/ul>\n **\/\n GenericCube(const Dune::ParameterTree& paramTree)\n {\n \/\/ get correct parameters\n Dune::ParameterTree* paramsP = const_cast< Dune::ParameterTree* >(¶mTree);\n if (paramsP->hasSub(id))\n paramsP = &(paramsP->sub(id));\n const Dune::ParameterTree& params = const_cast< const Dune::ParameterTree& >(*paramsP);\n const double lowerLeft = params.get(\"lowerLeft\", 0.0);\n const double upperRight = params.get(\"upperRight\", 1.0);\n const int level = params.get(\"level\", 1);\n buildGrid(CoordinateType(lowerLeft), CoordinateType(upperRight), level);\n } \/\/ Cube(const Dune::ParameterTree& paramTree)\n\n \/**\n \\brief Creates a cube.\n \\param[in] lowerLeft\n A vector that is used as a lower left corner.\n \\param[in] upperRight\n A vector that is used as a upper right corner.\n **\/\n GenericCube(const CoordinateType& lowerLeft, const CoordinateType& upperRight, const int level = 1)\n {\n buildGrid(lowerLeft, upperRight, level);\n }\n\n \/**\n \\brief Creates a cube.\n \\param[in] lowerLeft\n A double that is used as a lower left corner in each dimension.\n \\param[in] upperRight\n A double that is used as a upper right corner in each dimension.\n **\/\n GenericCube(double lowerLeft, double upperRight, const int level = 1)\n {\n buildGrid(CoordinateType(lowerLeft), CoordinateType(upperRight), level);\n }\n\n \/**\n \\brief Provides access to the created grid.\n \\return Reference to the grid.\n **\/\n GridType& grid()\n {\n return *grid_;\n }\n\n const GridType& grid() const\n {\n return *grid_;\n }\n\nprivate:\n template< int dim >\n struct P0Layout\n {\n bool contains(Dune::GeometryType& geometry)\n {\n if (geometry.dim() == dim)\n return true;\n return false;\n }\n }; \/\/ layout class for codim 0 mapper\n\n \/**\n \\brief Visualizes the grid using Dune::VTKWriter.\n \\param[in] paramTree\n A Dune::ParameterTree containing\n <ul><li> the following keys directly or\n <li> a subtree named Cube::id, containing the following keys, or\n <li> a subtree named Cube::id + \\c .visualize, containing the following keys.<\/ul>\n The actual keys are:\n <ul><li> \\c grid: if specified, filename of the vtk file in which the grid which can be obtained via\n grid() is visualized (\\a if \\a not \\a specified: \\a no \\a visualization).\n <li> \\c mdGrid: if specified, filename of the vtk file in which the multidomain grid which can be\n obtained via mdGrid() is visualized (\\a if \\a not \\a specified: \\a no \\a visualization).<\/ul>\n **\/\npublic:\n void visualize(Dune::ParameterTree& paramTree)\n {\n const std::string localId = \"visualize\";\n \/\/ get correct parameters\n Dune::ParameterTree* paramsP = ¶mTree;\n if (paramsP->hasSub(id))\n paramsP = &(paramsP->sub(id));\n if (paramsP->hasSub(localId))\n paramsP = &(paramsP->sub(localId));\n Dune::ParameterTree& params = *paramsP;\n \/\/ check for grid visualization\n if (params.hasKey(\"grid\")) {\n const std::string filenameGrid = params.get(\"grid\", id + \".grid\");\n \/\/ grid view\n typedef GridImp GridType;\n GridType& grid = this->grid();\n typedef typename GridType::LeafGridView GridView;\n GridView gridView = grid.leafView();\n \/\/ mapper\n Dune::LeafMultipleCodimMultipleGeomTypeMapper< GridType, P0Layout > mapper(grid);\n std::vector< double > data(mapper.size());\n \/\/ walk the grid\n typedef typename GridView::template Codim<0>::Iterator ElementIterator;\n typedef typename GridView::template Codim<0>::Entity ElementType;\n typedef typename ElementType::LeafIntersectionIterator FacetIteratorType;\n for (ElementIterator it = gridView.template begin<0>(); it != gridView.template end<0>(); ++it)\n {\n ElementType& element = *it;\n data[mapper.map(element)] = 0.0;\n int numberOfBoundarySegments = 0;\n bool isOnBoundary = false;\n for (FacetIteratorType facet = element.ileafbegin();\n facet != element.ileafend();\n ++facet) {\n if (!facet->neighbor() && facet->boundary()){\n isOnBoundary = true;\n numberOfBoundarySegments += 1;\n data[mapper.map(element)] += double(facet->boundaryId());\n }\n }\n if (isOnBoundary) {\n data[mapper.map(element)] \/= double(numberOfBoundarySegments);\n }\n } \/\/ walk the grid\n \/\/ write to vtk\n Dune::VTKWriter< GridView > vtkwriter(gridView);\n vtkwriter.addCellData(data, \"boundaryId\");\n vtkwriter.write(filenameGrid, Dune::VTK::ascii);\n } \/\/ check for grid visualization\n } \/\/ void visualize(Dune::ParameterTree& paramTree)\n\nprivate:\n void buildGrid(const CoordinateType& lowerLeft, const CoordinateType& upperRight, const int level)\n {\n Dune::array< unsigned int, dim > numElements;\n std::fill(numElements.begin(), numElements.end(), 1);\n switch (variant) {\n case 1:\n grid_ = Dune::StructuredGridFactory< GridType >::createCubeGrid(lowerLeft, upperRight, numElements);\n break;\n case 2:\n grid_ = Dune::StructuredGridFactory< GridType >::createSimplexGrid(lowerLeft, upperRight, numElements);\n break;\n default:\n DUNE_THROW(Dune::NotImplemented, \"Variant \" << variant << \" of cube not implemented.\");\n }\n grid_->globalRefine(level);\n return;\n } \/\/ void buildGrid(const CoordinateType& lowerLeft, const CoordinateType& upperRight)\n\n Dune::shared_ptr< GridType > grid_;\n}; \/\/ class GenericCube\n\ntemplate< typename GridImp, int variant >\nconst std::string GenericCube< GridImp, variant >::id = \"stuff.grid.provider.cube\";\n\n\/\/ default implementation of a cube for any grid\n\/\/ tested for\n\/\/ dim = 2\n\/\/ ALUGRID_SIMPLEX, variant 2\n\/\/ ALUGRID_CONFORM, variant 2\n\/\/ dim = 3\n\/\/ ALUGRID_SIMPLEX, variant 2\ntemplate< typename GridType >\nclass Cube\n : public GenericCube< GridType, 2 >\n{\nprivate:\n typedef GenericCube< GridType, 2 > BaseType;\n\npublic:\n typedef typename BaseType::CoordinateType CoordinateType;\n\n Cube(Dune::ParameterTree& paramTree)\n : BaseType(paramTree)\n {}\n\n Cube(const CoordinateType& lowerLeft, const CoordinateType& upperRight, const int level = 1)\n : BaseType(lowerLeft, upperRight, level)\n {}\n\n Cube(const double lowerLeft, const double upperRight, const int level = 1)\n : BaseType(lowerLeft, upperRight, level)\n {}\n}; \/\/ class Cube\n\n\/\/ specialization of Cube for YaspGrid\n\/\/ tested for dim = 1, 2, 3\ntemplate< int dim >\nclass Cube< Dune::YaspGrid< dim > >\n : public GenericCube< Dune::YaspGrid< dim >, 1 >\n{\nprivate:\n typedef GenericCube< Dune::YaspGrid< dim >, 1 > BaseType;\n\npublic:\n typedef typename BaseType::CoordinateType CoordinateType;\n\n Cube(Dune::ParameterTree& paramTree)\n : BaseType(paramTree)\n {}\n\n Cube(const CoordinateType& lowerLeft, const CoordinateType& upperRight, const int level = 1)\n : BaseType(lowerLeft, upperRight, level)\n {}\n\n Cube(const double lowerLeft, const double upperRight, const int level = 1)\n : BaseType(lowerLeft, upperRight, level)\n {}\n}; \/\/ class Cube< Dune::YaspGrid< dim > >\n\n\/\/ specialization of Cube for SGrid\n\/\/ tested for dim = 1, 2, 3\ntemplate< int dim >\nclass Cube< Dune::SGrid< dim, dim > >\n : public GenericCube< Dune::SGrid< dim, dim >, 1 >\n{\nprivate:\n typedef GenericCube< Dune::SGrid< dim, dim >, 1 > BaseType;\n\npublic:\n typedef typename BaseType::CoordinateType CoordinateType;\n\n Cube(Dune::ParameterTree& paramTree)\n : BaseType(paramTree)\n {}\n\n Cube(const CoordinateType& lowerLeft, const CoordinateType& upperRight, const int level = 1)\n : BaseType(lowerLeft, upperRight, level)\n {}\n\n Cube(const double lowerLeft, const double upperRight, const int level = 1)\n : BaseType(lowerLeft, upperRight, level)\n {}\n}; \/\/ class Cube< Dune::SGrid< dim, dim > >\n\n\/\/ specialization of Cube for ALUCubeGrid\n\/\/ tested for dim = 2, 3\ntemplate< int dim >\nclass Cube< Dune::ALUCubeGrid< dim, dim > >\n : public GenericCube< Dune::ALUCubeGrid< dim, dim >, 1 >\n{\nprivate:\n typedef GenericCube< Dune::ALUCubeGrid< dim, dim >, 1 > BaseType;\n\npublic:\n typedef typename BaseType::CoordinateType CoordinateType;\n\n Cube(Dune::ParameterTree& paramTree)\n : BaseType(paramTree)\n {}\n\n Cube(const CoordinateType& lowerLeft, const CoordinateType& upperRight, const int level = 1)\n : BaseType(lowerLeft, upperRight, level)\n {}\n\n Cube(const double lowerLeft, const double upperRight, const int level = 1)\n : BaseType(lowerLeft, upperRight, level)\n {}\n}; \/\/ class Cube< Dune::ALUCubeGrid< dim, dim > >\n\ntemplate< typename GridType >\nclass UnitCube\n : public Cube< GridType >\n{\nprivate:\n typedef Cube< GridType > BaseType;\n\npublic:\n UnitCube(Dune::ParameterTree& paramTree)\n : BaseType(0.0, 1.0, paramTree.get(\"level\", 1))\n {}\n\n UnitCube(const int level = 1)\n : BaseType(0.0, 1.0, level)\n {}\n}; \/\/ class UnitCube\n\n} \/\/ namespace Provider\n\n} \/\/ namespace Grid\n\n} \/\/ namespace Stuff\n\n} \/\/ namespace Dune\n\n#endif \/\/ DUNE_STUFF_GRID_PROVIDER_CUBE_HH\n<commit_msg>[grid.provider.cube] some changes<commit_after>#ifndef DUNE_STUFF_GRID_PROVIDER_CUBE_HH\n#define DUNE_STUFF_GRID_PROVIDER_CUBE_HH\n\n\/\/ dune-common\n#include <dune\/common\/parametertree.hh>\n#include <dune\/common\/shared_ptr.hh>\n#include <dune\/common\/exceptions.hh>\n#include <dune\/common\/fvector.hh>\n\n\/\/ dune-grid\n#include <dune\/grid\/utility\/structuredgridfactory.hh>\n#include <dune\/grid\/yaspgrid.hh>\n#include <dune\/grid\/alugrid.hh>\n#include <dune\/grid\/sgrid.hh>\n#include <dune\/grid\/common\/mcmgmapper.hh>\n#include <dune\/grid\/io\/file\/vtk\/vtkwriter.hh>\n\nnamespace Dune\n{\n\nnamespace Stuff\n{\n\nnamespace Grid\n{\n\nnamespace Provider\n{\n\n\/**\n \\brief Creates a grid of a cube in various dimensions.\n\n Default implementation using the Dune::StructuredGridFactory to create a grid of a cube in 1, 2 or 3\n dimensions. Tested with\n <ul><li> \\c YASPGRID, \\c variant 1, dim = 1, 2, 3,\n <li> \\c SGRID, \\c variant 1, dim = 1, 2, 3,\n <li> \\c ALUGRID_SIMPLEX, \\c variant 2, dim = 2, 3,\n <li> \\c ALUGRID_CONFORM, \\c variant 2, dim = 2, 2 and\n <li> \\c ALUGRID_CUBE, \\c variant 1, dim = 2, 3.<\/ul>\n \\tparam GridImp\n Type of the underlying grid.\n \\tparam variant\n Type of the codim 0 elements:\n <ul><li>\\c 1: cubes\n <li>2: simplices<\/ul>\n **\/\ntemplate< typename GridImp, int variant >\nclass GenericCube\n{\npublic:\n \/\/! Type of the provided grid.\n typedef GridImp GridType;\n\n \/\/! Dimension of the provided grid.\n static const int dim = GridType::dimension;\n\n \/\/! Type of the grids coordinates.\n typedef Dune::FieldVector< typename GridType::ctype, dim > CoordinateType;\n\n \/\/! Unique identifier: \\c stuff.grid.provider.cube\n static const std::string id;\n\n \/**\n \\brief Creates a cube.\n \\param[in] paramTree\n A Dune::ParameterTree containing\n <ul><li> the following keys directly or\n <li> a subtree named Cube::id, containing the following keys.<\/ul>\n The actual keys are:\n <ul><li> \\c lowerLeft: \\a double that is used as a lower left corner in each dimension.\n <li> \\c upperRight: \\a double that is used as a upper right corner in each dimension.<\/ul>\n **\/\n GenericCube(const Dune::ParameterTree& paramTree)\n : lowerLeft_(0.0),\n upperRight_(0.0)\n {\n \/\/ check for parameters\n const double lowerLeft = paramTree.get(\"lowerLeft\", 0.0);\n const double upperRight = paramTree.get(\"upperRight\", 1.0);\n assert(lowerLeft < upperRight);\n const int level = paramTree.get(\"level\", 1);\n lowerLeft_ = lowerLeft;\n upperRight_ = upperRight;\n buildGrid(lowerLeft_, upperRight_, level);\n } \/\/ Cube(const Dune::ParameterTree& paramTree)\n\n \/**\n \\brief Creates a cube.\n \\param[in] lowerLeft\n A vector that is used as a lower left corner.\n \\param[in] upperRight\n A vector that is used as a upper right corner.\n **\/\n GenericCube(const CoordinateType& lowerLeft, const CoordinateType& upperRight, const int level = 1)\n : lowerLeft_(lowerLeft),\n upperRight_(upperRight)\n {\n buildGrid(lowerLeft_, upperRight_, level);\n }\n\n \/**\n \\brief Creates a cube.\n \\param[in] lowerLeft\n A double that is used as a lower left corner in each dimension.\n \\param[in] upperRight\n A double that is used as a upper right corner in each dimension.\n **\/\n GenericCube(const double lowerLeft, const double upperRight, const int level = 1)\n : lowerLeft_(lowerLeft),\n upperRight_(upperRight)\n {\n buildGrid(lowerLeft_, upperRight_, level);\n }\n\n \/**\n \\brief Provides access to the created grid.\n \\return Reference to the grid.\n **\/\n GridType& grid()\n {\n return *grid_;\n }\n\n const GridType& grid() const\n {\n return *grid_;\n }\n\nprivate:\n template< int dim >\n struct P0Layout\n {\n bool contains(Dune::GeometryType& geometry)\n {\n if (geometry.dim() == dim)\n return true;\n return false;\n }\n }; \/\/ layout class for codim 0 mapper\n\n \/**\n \\brief Visualizes the grid using Dune::VTKWriter.\n \\param[in] paramTree\n A Dune::ParameterTree containing\n <ul><li> the following keys directly or\n <li> a subtree named Cube::id, containing the following keys, or\n <li> a subtree named Cube::id + \\c .visualize, containing the following keys.<\/ul>\n The actual keys are:\n <ul><li> \\c grid: if specified, filename of the vtk file in which the grid which can be obtained via\n grid() is visualized (\\a if \\a not \\a specified: \\a no \\a visualization).\n <li> \\c mdGrid: if specified, filename of the vtk file in which the multidomain grid which can be\n obtained via mdGrid() is visualized (\\a if \\a not \\a specified: \\a no \\a visualization).<\/ul>\n **\/\npublic:\n void visualize(Dune::ParameterTree& paramTree) const\n {\n const std::string localId = \"visualize\";\n \/\/ get correct parameters\n Dune::ParameterTree* paramsP = ¶mTree;\n if (paramsP->hasSub(id))\n paramsP = &(paramsP->sub(id));\n if (paramsP->hasSub(localId))\n paramsP = &(paramsP->sub(localId));\n Dune::ParameterTree& params = *paramsP;\n \/\/ check for grid visualization\n if (params.hasKey(\"grid\")) {\n const std::string filenameGrid = params.get(\"grid\", id + \".grid\");\n \/\/ grid view\n typedef GridImp GridType;\n GridType& grid = this->grid();\n typedef typename GridType::LeafGridView GridView;\n GridView gridView = grid.leafView();\n \/\/ mapper\n Dune::LeafMultipleCodimMultipleGeomTypeMapper< GridType, P0Layout > mapper(grid);\n std::vector< double > data(mapper.size());\n \/\/ walk the grid\n typedef typename GridView::template Codim<0>::Iterator ElementIterator;\n typedef typename GridView::template Codim<0>::Entity ElementType;\n typedef typename ElementType::LeafIntersectionIterator FacetIteratorType;\n for (ElementIterator it = gridView.template begin<0>(); it != gridView.template end<0>(); ++it)\n {\n ElementType& element = *it;\n data[mapper.map(element)] = 0.0;\n int numberOfBoundarySegments = 0;\n bool isOnBoundary = false;\n for (FacetIteratorType facet = element.ileafbegin();\n facet != element.ileafend();\n ++facet) {\n if (!facet->neighbor() && facet->boundary()){\n isOnBoundary = true;\n numberOfBoundarySegments += 1;\n data[mapper.map(element)] += double(facet->boundaryId());\n }\n }\n if (isOnBoundary) {\n data[mapper.map(element)] \/= double(numberOfBoundarySegments);\n }\n } \/\/ walk the grid\n \/\/ write to vtk\n Dune::VTKWriter< GridView > vtkwriter(gridView);\n vtkwriter.addCellData(data, \"boundaryId\");\n vtkwriter.write(filenameGrid, Dune::VTK::ascii);\n } \/\/ check for grid visualization\n } \/\/ void visualize(Dune::ParameterTree& paramTree)\n\nprivate:\n void buildGrid(const CoordinateType& lowerLeft, const CoordinateType& upperRight, const int level)\n {\n Dune::array< unsigned int, dim > numElements;\n std::fill(numElements.begin(), numElements.end(), 1);\n switch (variant) {\n case 1:\n grid_ = Dune::StructuredGridFactory< GridType >::createCubeGrid(lowerLeft, upperRight, numElements);\n break;\n case 2:\n grid_ = Dune::StructuredGridFactory< GridType >::createSimplexGrid(lowerLeft, upperRight, numElements);\n break;\n default:\n DUNE_THROW(Dune::NotImplemented, \"Variant \" << variant << \" of cube not implemented.\");\n }\n grid_->globalRefine(level);\n return;\n } \/\/ void buildGrid(const CoordinateType& lowerLeft, const CoordinateType& upperRight)\n\nprotected:\n CoordinateType lowerLeft_;\n CoordinateType upperRight_;\n\nprivate:\n Dune::shared_ptr< GridType > grid_;\n}; \/\/ class GenericCube\n\ntemplate< typename GridImp, int variant >\nconst std::string GenericCube< GridImp, variant >::id = \"stuff.grid.provider.cube\";\n\n\/\/ default implementation of a cube for any grid\n\/\/ tested for\n\/\/ dim = 2\n\/\/ ALUGRID_SIMPLEX, variant 2\n\/\/ ALUGRID_CONFORM, variant 2\n\/\/ dim = 3\n\/\/ ALUGRID_SIMPLEX, variant 2\ntemplate< typename GridType >\nclass Cube\n : public GenericCube< GridType, 2 >\n{\nprivate:\n typedef GenericCube< GridType, 2 > BaseType;\n\npublic:\n typedef typename BaseType::CoordinateType CoordinateType;\n\n Cube(const Dune::ParameterTree& paramTree)\n : BaseType(paramTree)\n {}\n\n Cube(const CoordinateType& lowerLeft, const CoordinateType& upperRight, const int level = 1)\n : BaseType(lowerLeft, upperRight, level)\n {}\n\n Cube(const double lowerLeft, const double upperRight, const int level = 1)\n : BaseType(lowerLeft, upperRight, level)\n {}\n}; \/\/ class Cube\n\n\/\/ specialization of Cube for YaspGrid\n\/\/ tested for dim = 1, 2, 3\ntemplate< int dim >\nclass Cube< Dune::YaspGrid< dim > >\n : public GenericCube< Dune::YaspGrid< dim >, 1 >\n{\nprivate:\n typedef GenericCube< Dune::YaspGrid< dim >, 1 > BaseType;\n\npublic:\n typedef typename BaseType::CoordinateType CoordinateType;\n\n Cube(const Dune::ParameterTree& paramTree)\n : BaseType(paramTree)\n {}\n\n Cube(const CoordinateType& lowerLeft, const CoordinateType& upperRight, const int level = 1)\n : BaseType(lowerLeft, upperRight, level)\n {}\n\n Cube(const double lowerLeft, const double upperRight, const int level = 1)\n : BaseType(lowerLeft, upperRight, level)\n {}\n}; \/\/ class Cube< Dune::YaspGrid< dim > >\n\n\/\/ specialization of Cube for SGrid\n\/\/ tested for dim = 1, 2, 3\ntemplate< int dim >\nclass Cube< Dune::SGrid< dim, dim > >\n : public GenericCube< Dune::SGrid< dim, dim >, 1 >\n{\nprivate:\n typedef GenericCube< Dune::SGrid< dim, dim >, 1 > BaseType;\n\npublic:\n typedef typename BaseType::CoordinateType CoordinateType;\n\n Cube(const Dune::ParameterTree& paramTree)\n : BaseType(paramTree)\n {}\n\n Cube(const CoordinateType& lowerLeft, const CoordinateType& upperRight, const int level = 1)\n : BaseType(lowerLeft, upperRight, level)\n {}\n\n Cube(const double lowerLeft, const double upperRight, const int level = 1)\n : BaseType(lowerLeft, upperRight, level)\n {}\n}; \/\/ class Cube< Dune::SGrid< dim, dim > >\n\n\/\/ specialization of Cube for ALUCubeGrid\n\/\/ tested for dim = 2, 3\ntemplate< int dim >\nclass Cube< Dune::ALUCubeGrid< dim, dim > >\n : public GenericCube< Dune::ALUCubeGrid< dim, dim >, 1 >\n{\nprivate:\n typedef GenericCube< Dune::ALUCubeGrid< dim, dim >, 1 > BaseType;\n\npublic:\n typedef typename BaseType::CoordinateType CoordinateType;\n\n Cube(const Dune::ParameterTree& paramTree)\n : BaseType(paramTree)\n {}\n\n Cube(const CoordinateType& lowerLeft, const CoordinateType& upperRight, const int level = 1)\n : BaseType(lowerLeft, upperRight, level)\n {}\n\n Cube(const double lowerLeft, const double upperRight, const int level = 1)\n : BaseType(lowerLeft, upperRight, level)\n {}\n}; \/\/ class Cube< Dune::ALUCubeGrid< dim, dim > >\n\ntemplate< typename GridType >\nclass UnitCube\n : public Cube< GridType >\n{\nprivate:\n typedef Cube< GridType > BaseType;\n\npublic:\n UnitCube(const Dune::ParameterTree& paramTree)\n : BaseType(0.0, 1.0, paramTree.get(\"level\", 1))\n {}\n\n UnitCube(const int level = 1)\n : BaseType(0.0, 1.0, level)\n {}\n}; \/\/ class UnitCube\n\n} \/\/ namespace Provider\n\n} \/\/ namespace Grid\n\n} \/\/ namespace Stuff\n\n} \/\/ namespace Dune\n\n#endif \/\/ DUNE_STUFF_GRID_PROVIDER_CUBE_HH\n<|endoftext|>"} {"text":"<commit_before>\/\/ Copyright (c) 2019 Matthew J. Smith and Overkit contributors\n\/\/ License: MIT (http:\/\/opensource.org\/licenses\/MIT)\n\n#ifndef OVK_CORE_DISTRIBUTED_REGION_HASH_HPP_INCLUDED\n#define OVK_CORE_DISTRIBUTED_REGION_HASH_HPP_INCLUDED\n\n#include <ovk\/core\/Array.hpp>\n#include <ovk\/core\/ArrayView.hpp>\n#include <ovk\/core\/Box.hpp>\n#include <ovk\/core\/Comm.hpp>\n#include <ovk\/core\/DataType.hpp>\n#include <ovk\/core\/Elem.hpp>\n#include <ovk\/core\/Field.hpp>\n#include <ovk\/core\/Global.hpp>\n#include <ovk\/core\/Interval.hpp>\n#include <ovk\/core\/Map.hpp>\n#include <ovk\/core\/Range.hpp>\n#include <ovk\/core\/Requires.hpp>\n#include <ovk\/core\/RegionTraits.hpp>\n#include <ovk\/core\/Tuple.hpp>\n\n#include <mpi.h>\n\n#include <cstring>\n#include <type_traits>\n\nnamespace ovk {\nnamespace core {\n\ntemplate <typename CoordType> class distributed_region_hash;\n\ntemplate <typename CoordType> class distributed_region_data {\n\npublic:\n\n using region_type = typename std::conditional<std::is_same<CoordType, double>::value, box,\n range>::type;\n\n const region_type &Region() const { return Region_; }\n\n int Rank() const { return Rank_; }\n\n template <typename T> const T &AuxData() const {\n return *reinterpret_cast<const T *>(AuxData_.Data());\n }\n\nprivate:\n\n region_type Region_;\n int Rank_;\n array<byte> AuxData_;\n\n friend class distributed_region_hash<CoordType>;\n\n};\n\ntemplate <typename CoordType> class distributed_region_hash_retrieved_bins {\n\npublic:\n\n using region_data = distributed_region_data<CoordType>;\n\n const region_data &RegionData(int iRegion) const { return RegionData_(iRegion); }\n\n array_view<const int> BinRegionIndices(int iBin) const {\n const interval<long long> &Interval = BinRegionIndicesIntervals_(iBin);\n return {BinRegionIndices_.Data(Interval.Begin()), Interval};\n }\n\nprivate:\n\n array<region_data> RegionData_;\n map<int,interval<long long>> BinRegionIndicesIntervals_;\n array<int> BinRegionIndices_;\n\n friend class distributed_region_hash<CoordType>;\n\n};\n\ntemplate <typename CoordType> class distributed_region_hash {\n\npublic:\n\n static_assert(std::is_same<CoordType, int>::value || std::is_same<CoordType, double>::value,\n \"Coord type must be int or double.\");\n\n using coord_type = CoordType;\n using region_type = typename std::conditional<std::is_same<coord_type, double>::value, box,\n range>::type;\n using traits = region_traits<region_type>;\n\n using region_data = distributed_region_data<coord_type>;\n using retrieved_bins = distributed_region_hash_retrieved_bins<coord_type>;\n\n distributed_region_hash(int NumDims, comm_view Comm);\n distributed_region_hash(int NumDims, comm_view Comm, int NumLocalRegions, array_view<const\n region_type> LocalRegions);\n template <typename ArrayType, OVK_FUNCDECL_REQUIRES(std::is_trivially_copyable<array_value_type<\n ArrayType>>::value && std::is_trivially_destructible<array_value_type<ArrayType>>::value)>\n distributed_region_hash(int NumDims, comm_view Comm, int NumLocalRegions, array_view<const\n region_type> LocalRegions, const ArrayType &LocalRegionAuxData, MPI_Datatype\n AuxDataMPIType=GetMPIDataType<array_value_type<ArrayType>>());\n\n \/\/ Can't define these here due to issues with GCC < 6.3 and Intel < 17\n\/\/ distributed_region_hash(const distributed_region_hash &Other) = delete;\n\/\/ distributed_region_hash(distributed_region_hash &&Other) noexcept = default;\n\n\/\/ distributed_region_hash &operator=(const distributed_region_hash &Other) = delete;\n\/\/ distributed_region_hash &operator=(distributed_region_hash &&Other) noexcept = default;\n\n elem<int,2> MapToBin(const tuple<coord_type> &Point) const;\n\n map<int,retrieved_bins> RetrieveBins(array_view<const elem<int,2>> BinIDs) const;\n\nprivate:\n\n int NumDims_;\n\n comm_view Comm_;\n\n region_type GlobalExtents_;\n\n range ProcRange_;\n range_indexer<int> ProcIndexer_;\n tuple<coord_type> ProcSize_;\n\n array<int> ProcToBinMultipliers_;\n\n long long AuxDataNumBytes_;\n MPI_Datatype AuxDataMPIType_;\n\n array<region_data> RegionData_;\n range BinRange_;\n field<int> NumRegionsPerBin_;\n field<long long> BinRegionIndicesStarts_;\n array<int> BinRegionIndices_;\n\n distributed_region_hash(int NumDims, comm_view Comm, int NumLocalRegions, array_view<const\n region_type> LocalRegions, const array<const byte *> &LocalRegionAuxData, long long\n AuxDataNumBytes, MPI_Datatype AuxDataMPIType);\n\n template <typename ArrayType> static array<const byte *> GetBytePointers_(const ArrayType &Array);\n\n static tuple<int> BinDecomp_(int NumDims, const region_type &GlobalExtents, int MaxBins);\n\n static tuple<int> GetBinSize_(const range &GlobalExtents, const tuple<int> &NumBins);\n static tuple<double> GetBinSize_(const box &GlobalExtents, const tuple<int> &NumBins);\n\n static tuple<int> MapToUniformCell_(int NumDims, const tuple<int> &Origin, const tuple<int>\n &CellSize, const tuple<int> &Point);\n static tuple<int> MapToUniformCell_(int NumDims, const tuple<double> &Origin, const tuple<double>\n &CellSize, const tuple<double> &Point);\n\n};\n\ntemplate <typename CoordType> template <typename ArrayType, OVK_FUNCDEF_REQUIRES(\n std::is_trivially_copyable<array_value_type<ArrayType>>::value && std::is_trivially_destructible<\n array_value_type<ArrayType>>::value)> distributed_region_hash<CoordType>::distributed_region_hash(\n int NumDims, comm_view Comm, int NumLocalRegions, array_view<const region_type> LocalRegions,\n const ArrayType &LocalRegionAuxData, MPI_Datatype AuxDataMPIType):\n distributed_region_hash(NumDims, Comm, NumLocalRegions, LocalRegions, GetBytePointers_(\n LocalRegionAuxData), sizeof(array_value_type<ArrayType>), AuxDataMPIType)\n{}\n\ntemplate <typename CoordType> template <typename ArrayType> array<const byte *>\n distributed_region_hash<CoordType>::GetBytePointers_(const ArrayType &Array) {\n\n array<const byte *> BytePointers({Array.Count()});\n\n for (int iValue = 0; iValue < Array.Count(); ++iValue) {\n BytePointers(iValue) = reinterpret_cast<const byte *>(ArrayData(Array)+iValue);\n }\n\n return BytePointers;\n\n}\n\nextern template class distributed_region_hash<int>;\nextern template class distributed_region_hash<double>;\n\n}}\n\n#endif\n<commit_msg>std::is_trivially_copyable isn't supported on target Intel compiler version<commit_after>\/\/ Copyright (c) 2019 Matthew J. Smith and Overkit contributors\n\/\/ License: MIT (http:\/\/opensource.org\/licenses\/MIT)\n\n#ifndef OVK_CORE_DISTRIBUTED_REGION_HASH_HPP_INCLUDED\n#define OVK_CORE_DISTRIBUTED_REGION_HASH_HPP_INCLUDED\n\n#include <ovk\/core\/Array.hpp>\n#include <ovk\/core\/ArrayView.hpp>\n#include <ovk\/core\/Box.hpp>\n#include <ovk\/core\/Comm.hpp>\n#include <ovk\/core\/DataType.hpp>\n#include <ovk\/core\/Elem.hpp>\n#include <ovk\/core\/Field.hpp>\n#include <ovk\/core\/Global.hpp>\n#include <ovk\/core\/Interval.hpp>\n#include <ovk\/core\/Map.hpp>\n#include <ovk\/core\/Range.hpp>\n#include <ovk\/core\/Requires.hpp>\n#include <ovk\/core\/RegionTraits.hpp>\n#include <ovk\/core\/Tuple.hpp>\n\n#include <mpi.h>\n\n#include <cstring>\n#include <type_traits>\n\nnamespace ovk {\nnamespace core {\n\ntemplate <typename CoordType> class distributed_region_hash;\n\ntemplate <typename CoordType> class distributed_region_data {\n\npublic:\n\n using region_type = typename std::conditional<std::is_same<CoordType, double>::value, box,\n range>::type;\n\n const region_type &Region() const { return Region_; }\n\n int Rank() const { return Rank_; }\n\n template <typename T> const T &AuxData() const {\n return *reinterpret_cast<const T *>(AuxData_.Data());\n }\n\nprivate:\n\n region_type Region_;\n int Rank_;\n array<byte> AuxData_;\n\n friend class distributed_region_hash<CoordType>;\n\n};\n\ntemplate <typename CoordType> class distributed_region_hash_retrieved_bins {\n\npublic:\n\n using region_data = distributed_region_data<CoordType>;\n\n const region_data &RegionData(int iRegion) const { return RegionData_(iRegion); }\n\n array_view<const int> BinRegionIndices(int iBin) const {\n const interval<long long> &Interval = BinRegionIndicesIntervals_(iBin);\n return {BinRegionIndices_.Data(Interval.Begin()), Interval};\n }\n\nprivate:\n\n array<region_data> RegionData_;\n map<int,interval<long long>> BinRegionIndicesIntervals_;\n array<int> BinRegionIndices_;\n\n friend class distributed_region_hash<CoordType>;\n\n};\n\ntemplate <typename CoordType> class distributed_region_hash {\n\npublic:\n\n static_assert(std::is_same<CoordType, int>::value || std::is_same<CoordType, double>::value,\n \"Coord type must be int or double.\");\n\n using coord_type = CoordType;\n using region_type = typename std::conditional<std::is_same<coord_type, double>::value, box,\n range>::type;\n using traits = region_traits<region_type>;\n\n using region_data = distributed_region_data<coord_type>;\n using retrieved_bins = distributed_region_hash_retrieved_bins<coord_type>;\n\n distributed_region_hash(int NumDims, comm_view Comm);\n distributed_region_hash(int NumDims, comm_view Comm, int NumLocalRegions, array_view<const\n region_type> LocalRegions);\n \/\/ is_trivially_copyable not yet supported on Intel 17\n\/\/ template <typename ArrayType, OVK_FUNCDECL_REQUIRES(std::is_trivially_copyable<array_value_type<\n\/\/ ArrayType>>::value && std::is_trivially_destructible<array_value_type<ArrayType>>::value)>\n template <typename ArrayType, OVK_FUNCDECL_REQUIRES(std::is_trivially_destructible<\n array_value_type<ArrayType>>::value)> distributed_region_hash(int NumDims, comm_view Comm, int\n NumLocalRegions, array_view<const region_type> LocalRegions, const ArrayType\n &LocalRegionAuxData, MPI_Datatype AuxDataMPIType=GetMPIDataType<array_value_type<ArrayType>>());\n\n \/\/ Can't define these here due to issues with GCC < 6.3 and Intel < 17\n\/\/ distributed_region_hash(const distributed_region_hash &Other) = delete;\n\/\/ distributed_region_hash(distributed_region_hash &&Other) noexcept = default;\n\n\/\/ distributed_region_hash &operator=(const distributed_region_hash &Other) = delete;\n\/\/ distributed_region_hash &operator=(distributed_region_hash &&Other) noexcept = default;\n\n elem<int,2> MapToBin(const tuple<coord_type> &Point) const;\n\n map<int,retrieved_bins> RetrieveBins(array_view<const elem<int,2>> BinIDs) const;\n\nprivate:\n\n int NumDims_;\n\n comm_view Comm_;\n\n region_type GlobalExtents_;\n\n range ProcRange_;\n range_indexer<int> ProcIndexer_;\n tuple<coord_type> ProcSize_;\n\n array<int> ProcToBinMultipliers_;\n\n long long AuxDataNumBytes_;\n MPI_Datatype AuxDataMPIType_;\n\n array<region_data> RegionData_;\n range BinRange_;\n field<int> NumRegionsPerBin_;\n field<long long> BinRegionIndicesStarts_;\n array<int> BinRegionIndices_;\n\n distributed_region_hash(int NumDims, comm_view Comm, int NumLocalRegions, array_view<const\n region_type> LocalRegions, const array<const byte *> &LocalRegionAuxData, long long\n AuxDataNumBytes, MPI_Datatype AuxDataMPIType);\n\n template <typename ArrayType> static array<const byte *> GetBytePointers_(const ArrayType &Array);\n\n static tuple<int> BinDecomp_(int NumDims, const region_type &GlobalExtents, int MaxBins);\n\n static tuple<int> GetBinSize_(const range &GlobalExtents, const tuple<int> &NumBins);\n static tuple<double> GetBinSize_(const box &GlobalExtents, const tuple<int> &NumBins);\n\n static tuple<int> MapToUniformCell_(int NumDims, const tuple<int> &Origin, const tuple<int>\n &CellSize, const tuple<int> &Point);\n static tuple<int> MapToUniformCell_(int NumDims, const tuple<double> &Origin, const tuple<double>\n &CellSize, const tuple<double> &Point);\n\n};\n\n\/\/ is_trivially_copyable not yet supported on Intel 17\n\/\/ template <typename CoordType> template <typename ArrayType, OVK_FUNCDEF_REQUIRES(\n\/\/ std::is_trivially_copyable<array_value_type<ArrayType>>::value && std::is_trivially_destructible<\n\/\/ array_value_type<ArrayType>>::value)> distributed_region_hash<CoordType>::distributed_region_hash(\ntemplate <typename CoordType> template <typename ArrayType, OVK_FUNCDEF_REQUIRES(\n std::is_trivially_destructible<array_value_type<ArrayType>>::value)> distributed_region_hash<\n CoordType>::distributed_region_hash(int NumDims, comm_view Comm, int NumLocalRegions,\n array_view<const region_type> LocalRegions, const ArrayType &LocalRegionAuxData, MPI_Datatype\n AuxDataMPIType):\n distributed_region_hash(NumDims, Comm, NumLocalRegions, LocalRegions, GetBytePointers_(\n LocalRegionAuxData), sizeof(array_value_type<ArrayType>), AuxDataMPIType)\n{}\n\ntemplate <typename CoordType> template <typename ArrayType> array<const byte *>\n distributed_region_hash<CoordType>::GetBytePointers_(const ArrayType &Array) {\n\n array<const byte *> BytePointers({Array.Count()});\n\n for (int iValue = 0; iValue < Array.Count(); ++iValue) {\n BytePointers(iValue) = reinterpret_cast<const byte *>(ArrayData(Array)+iValue);\n }\n\n return BytePointers;\n\n}\n\nextern template class distributed_region_hash<int>;\nextern template class distributed_region_hash<double>;\n\n}}\n\n#endif\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 ¶ms)\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 \n int tuple_ctr = 0;\n int tuples_skipped = 0;\n int limit = -1;\n int offset = -1;\n node->getLimitAndOffsetByReference(params, limit, offset);\n\n while ((limit == -1 || tuple_ctr < limit) && iterator.next(tuple))\n {\n \/\/ TODO: need a way to skip \/ iterate N items.\n if (tuples_skipped < offset)\n {\n tuples_skipped++;\n continue;\n }\n tuple_ctr++;\n\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 }\n\n return true;\n}\n<commit_msg>Licensecheck fixup.<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 ¶ms)\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\n int tuple_ctr = 0;\n int tuples_skipped = 0;\n int limit = -1;\n int offset = -1;\n node->getLimitAndOffsetByReference(params, limit, offset);\n\n while ((limit == -1 || tuple_ctr < limit) && iterator.next(tuple))\n {\n \/\/ TODO: need a way to skip \/ iterate N items.\n if (tuples_skipped < offset)\n {\n tuples_skipped++;\n continue;\n }\n tuple_ctr++;\n\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 }\n\n return true;\n}\n<|endoftext|>"} {"text":"<commit_before>\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\n\/\/ The MIT License (MIT)\n\/\/\n\/\/ Copyright (c) 2014 stevehalliwell\n\/\/\n\/\/ Permission is hereby granted, free of charge, to any person obtaining a copy\n\/\/ of this software and associated documentation files (the \"Software\"), to deal\n\/\/ in the Software without restriction, including without limitation the rights\n\/\/ to use, copy, modify, merge, publish, distribute, sublicense, and\/or sell\n\/\/ copies of the Software, and to permit persons to whom the Software is\n\/\/ furnished to do so, subject to the following conditions:\n\/\/\n\/\/ The above copyright notice and this permission notice shall be included in all\n\/\/ copies or substantial portions of the Software.\n\/\/\n\/\/ THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\n\/\/ IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\n\/\/ FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE\n\/\/ AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\n\/\/ LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,\n\/\/ OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE\n\/\/ SOFTWARE.\n\/\/\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n#include <ResourceManager\/ResourceManager.hpp>\n#include <ResourceManager\/BaseResource.hpp>\n#include <ResourceManager\/LuaParser.hpp>\n#include <string>\n#include<vector>\nnamespace rm\n{\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\/ Initialise static members\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nResourceLookup ResourceManager::resources = {};\nResourceLookup ResourceManager::errorResources = {};\nResourceQueue ResourceManager::loadingQueue = {};\nResourceQueue ResourceManager::unloadQueue = {};\nResourceQueue ResourceManager::reloadQueue = {};\nbool ResourceManager::useNullForErrorRes = true;\n\nLoadCompleteCallback ResourceManager::loadCompleteCallback = nullptr;\n\n\n\nenum class LoadMode\n{\n Queue,\n Block,\n};\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\/ Function definitions\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nvoid ResourceManager::unloadResource(const std::string& name, LoadMode mode)\n{\n \/\/ Checking if resource exists in resources\n if (resources.find(name) != resources.end())\n {\n \/\/ Assigns a new pointer to the key for the resource \n ResourcePtr pointer = resources.find(name)->second;\n\n \/\/ If the resource has to be removed immediately\n if(mode == LoadMode::Block)\n {\n \/\/ Change the status of the BaseResource \n pointer->setIsLoaded(false);\n \/\/ Unload the BaseResource\n pointer->unload;\n }\n else\n {\n \/\/ Change the status of the BaseResource \n pointer->setIsLoaded(false);\n \/\/ Send to unloadQueue list\n unloadQueue.push(pointer);\n }\n return;\n }\n return;\n \n}\n\nvoid ResourceManager::reloadResource(const std::string& name)\n{\n ResourcePtr res = nullptr;\n\n \/\/ Check if resource exists in resource map\n if (resources.find(name) != resources.end())\n {\n\t\t\/\/ Set resource pointer\n res = resources[name];\n }\n else \n {\n Logger::logMessage(\"Reload resource warning: Resource not already loaded\");\n \n \/\/ Create new resource anyway\n \/\/loadingQueue.push(res);\n \/\/ Not quire sure how to handle this\/if we're allowing them to load anyway\n }\n \n \/\/ Send to reloadQueue\n reloadQueue.push(res);\n \n \/\/ Must appropriately set isLoaded in resource\n \/\/ Should it even change the state of isLoaded, since it will be loaded until it hits the queue?\n}\n\n\n\nvoid ResourceManager::initPack(const std::string& path)\n{\n \/\/How do you check if a string is a valid file path? Does this even need to be checked?\n \/*\n if(path is not a valid filepath)\n {\n return error?\n }\n *\/\n \n \/\/Get a list of data from the resource pack lua table\n ResourceDataList list = LuaParser::parsePack(path);\n \n \/\/iterate through the list and create a new resource if one does not already exist.\t\n for(ResourceDataList::iterator iter = list.begin(); iter != list.end(); iter++)\n {\n \/\/is this supposed to call initResource()? It seems like initResource() will not set an alias as it only takes a path, whereas this function can set the alias and type returned from the luaparser.\n \/\/initResource(list[iter].path);\n \n \/\/If it does not call initResource()\n bool exists = false;\n for(ResourceLookup::iterator iter2 = resources.begin(); iter2 != resources.end(); iter2++)\n {\n if(iter2->second->getFilePath() == path)\n {\n exists = true;\n }\n }\n \n if(!exists)\n {\n ResourcePtr res = ResourceFactory::createResource(iter->path, iter->type);\n res->setAlias(iter->alias);\n resources.insert({iter->alias, res});\n \n \/\/return success?\n }\n else\n {\n \/\/return error (already exists)?\n }\n }\n}\n\nvoid ResourceManager::loadPack(const std::string& path, LoadMode mode)\n{\n \/\/ Create a list from the parsePack\n ResourceDataList list = LuaParser::parsePack(path);\n\n \/\/ Iterate through the list\n for (ResourceDataList::iterator var = list.begin; var != list.end; ++var)\n {\n \/\/ Checking if resource exists in resources\n if (resources.find(var->alias) != resources.end())\n {\n \/\/ Assigns a new pointer to the key for the resource \n ResourcePtr pointer = resources.find(var->alias)->second;\n\n \/\/ Checking if the resource is not loaded\n if (pointer->isLoaded == false)\n {\n \/\/ If the resource has to be loaded immediately\n if (mode == LoadMode::Block)\n {\n \/\/ Change the status of the BaseResource \n pointer->setIsLoaded(true);\n \/\/ Unload the BaseResource\n pointer->load;\n }\n else\n {\n \n \/\/ Send to unloadQueue list\n loadingQueue.push(pointer);\n }\n }\n }\n \n }\n\n return;\n}\n\nvoid ResourceManager::unloadPack(const std::string& path, LoadMode mode)\n{\n \/\/ Create a list from the parsePack\n ResourceDataList list = LuaParser::parsePack(path);\n\n \/\/ Iterate through the list\n for (ResourceDataList::iterator var = list.begin; var != list.end; ++var)\n {\n \/\/ Checking if resource exists in resources\n if (resources.find(var->alias) != resources.end())\n {\n \/\/ Assigns a new pointer to the key for the resource \n ResourcePtr pointer = resources.find(var->alias)->second;\n\n \/\/ Checking if the resource is loaded\n if (pointer->isLoaded == true)\n {\n \/\/ If the resource has to be unloaded immediately\n if (mode == LoadMode::Block)\n {\n \/\/ Change the status of the BaseResource \n pointer->setIsLoaded(false);\n \/\/ Unload the BaseResource\n pointer->unload;\n }\n else\n {\n \/\/ Send to unloadQueue list\n unloadQueue.push(pointer);\n }\n }\n }\n\n }\n\n return;\n\n}\n\nvoid ResourceManager::reloadPack(const std::string& path)\n{\n\n \/\/ Create a list from the parsePack\n ResourceDataList list = LuaParser::parsePack(path);\n\n \/\/ Iterate through the list\n for (ResourceDataList::iterator var = list.begin; var != list.end; ++var)\n {\n \/\/ Assign the alias to a throw away string\n std::string name = var->alias;\n\n \/\/ Checking if resource exists in resource map\n if (resources.find(name) != resources.end())\n {\n \/\/ Assigns a new pointer to the key for the resource \n ResourcePtr res = resources.find(name)->second;\n\n \/\/ Send to reloadQueue\n reloadQueue.push(res);\n }\n else\n {\n Logger::logMessage(\"Reload resource warning: Resource not already loaded\");\n \n \/\/ Create new resource anyway\n \/\/loadingQueue.push(res);\n \/\/ Not quire sure how to handle this\/if we're allowing them to load anyway\n }\n }\n}\n\nvoid ResourceManager::switchPack(const std::string& fromPath, const std::string& toPath)\n{\n \/\/ Create a list from the parsePack for the current pack\n ResourceDataList from = LuaParser::parsePack(fromPath);\n\n \/\/ Create a list from the parsePack for the future Pack\n ResourceDataList tolist = LuaParser::parsePack(toPath);\n\n \/\/ Create a string vector to hold the common resources\n std::vector<std::string> common;\n\n \/\/ Load the future pack\n for (ResourceDataList::iterator var = tolist.begin; var != tolist.end; ++var)\n {\n \n \/\/ Checking if resource exists in resources\n if (resources.find(var->alias) != resources.end())\n {\n \/\/ Assigns a new pointer to the key for the resource \n ResourcePtr pointer = resources.find(var->alias)->second;\n\n \/\/ Checking if the resource is not loaded\n if (pointer->isLoaded == false)\n {\n \/\/ Change the status of the BaseResource \n pointer->setIsLoaded(true);\n \/\/ Send to unloadQueue list\n loadingQueue.push(pointer);\n }\n else\n {\n \/\/ Add the name to the vector\n common.push_back(var->alias);\n }\n }\n }\n\n \/\/ Iterate through the old Pack and remove the Resources that are not common to the pack and the vector\n for (ResourceDataList::iterator var = from.begin; var != from.end; ++var)\n {\n \n \/\/ Checking if resource is common to the string vector\n if (resources.find(var->alias) != resources.end())\n {\n\n if (std::find(common.begin(), common.end(), resources.find(var->alias) != common.end))\n {\n \/\/ The two entries are common - do nothing\n }\n else\n {\n \/\/ The two entries do not match - unload the old entry\n\n \/\/ Assigns a new pointer to the key for the resource \n ResourcePtr pointer = resources.find(var->alias)->second;\n \n \/\/ Send to unloadQueue list\n loadingQueue.push(pointer);\n }\n \n }\n }\n\n}\n\nvoid ResourceManager::init(bool _useNullForErrorRes)\n{\n useNullForErrorRes = _useNullForErrorRes;\n\n if(!useNullForErrorRes)\n {\n \/\/ initPack(\"ResMan_DefaultError_Resources\\ErrorResource_LuaFile.txt\");\n }\n}\n\nvoid ResourceManager::update()\n{\n loadFromQueue();\n unloadFromQueue();\n reloadFromQueue();\n}\n\nvoid ResourceManager::cleanupUnused()\n{\n \/\/ Fetch a list of all resources\n ResourceList cleanup = listAll();\n \n \/\/ run for each resource in list\n for(ResourcePtr r : cleanup)\n { \n \/\/ if the resource pointer is unique\n if(r.unique())\n { \n \/\/ Get alias of resource\n std::string name = r->getAlias();\n\n \/\/ Log what resources were unloaded\n Logger::logMessage(\"Unloading Unused Resource: \", name);\n \n \/\/ Change resource status to false\n r->setIsLoaded(false);\n\n \/\/ unload resource\n r->unload();\n }\n }\n}\n\nbool ResourceManager::isLoading()\n{\n return getNumToLoad() > 0;\n}\n\nsize_t ResourceManager::getNumToLoad()\/\/ResourceManager::getNumToLoad()\n{\n return loadingQueue.size();\n}\n\nResourceList ResourceManager::listAll()\n{\n \/\/ create a temp list to add pointers\n ResourceList temp;\n\n \/\/ iterate through and add each pointer to the temp list\n for (ResourceLookup::iterator it = resources.begin; it != resources.end; ++it)\n {\n temp.push_back(it->second);\n }\n\n return temp;\n}\n\nsize_t ResourceManager::getMemUsage()\n{\n \n throw(\"Not implemented\");\n}\n\nsize_t ResourceManager::getNumResources()\n{\n return resources.size();\n}\n\nvoid ResourceManager::setLoadCompleteCallback(LoadCompleteCallback callback)\n{\n loadCompleteCallback = callback;\n}\n\nvoid ResourceManager::loadFromQueue()\n{\n while (loadingQueue.size() > 0)\n {\n \/\/ Check First res in the queue\n auto frontRes = loadingQueue.front();\n\n \/\/ Check to see if the resource is already loaded.\n if (frontRes->isLoaded)\n {\n \/\/ If its loaded delete from queue\n \/\/ Allow for another resource to be loaded if there are stil l more in the queue.\n loadingQueue.pop();\n }\n else\n {\n \/\/ Load the first resource and check if any errors\n if (frontRes->load())\n {\n \/\/ Set resource to is loaded\n frontRes->setIsLoaded(true);\n \/\/ Remove from loading queue\n loadingQueue.pop();\n }\n else\n {\n \/\/ Log Error \n Logger::logMessage(\"Load Resource Failed: \", frontRes->getAlias);\n }\n \/\/ Send load complete call back once the last item is loaded.\n if (loadingQueue.size() == 0)\n {\n loadCompleteCallback();\n }\n \/\/ break from loop so only one resource is loaded at a time.\n break;\n }\n }\n}\n\nvoid ResourceManager::unloadFromQueue()\n{\n \/\/ Only run when queue is > 0\n while (unloadQueue.size() > 0)\n {\n \/\/ Check First res in the queue\n auto frontRes = unloadQueue.front();\n\n \/\/ Check to see if the resource is already unloaded.\n if (!frontRes->isLoaded)\n {\n \/\/ If its unloaded delete from queue\n \/\/ Allow for another resource to be unloaded if there are stil l more in the queue.\n unloadQueue.pop();\n }\n else\n {\n \/\/ Load the first resource and check if any errors\n if (frontRes->unload())\n {\n \/\/ Set resource to is unloaded\n frontRes->setIsLoaded(false);\n \/\/ Remove from unloadeding queue\n unloadQueue.pop();\n }\n else\n {\n \/\/ Log Error \n Logger::logMessage(\"Unload Resource Failed: \", frontRes->getAlias);\n }\n \/\/ break from loop so only one resource is unloaded at a time.\n break;\n }\n }\n}\n\nvoid ResourceManager::reloadFromQueue()\n{\n if (reloadQueue.size() > 0)\n {\n \/\/ Check First res in the queue\n auto frontRes = reloadQueue.front();\n\n\n \/\/ Load the first resource and check if any errors\n if (frontRes->reload())\n {\n \/\/ Remove from reloading Queue\n reloadQueue.pop();\n }\n else\n {\n \/\/ Log Error\n Logger::logMessage(\"Reload Resource Failed: \", frontRes->getAlias);\n }\n }\n}\n\n} \/\/ rm\n<commit_msg>Fixed cleanup + Removed getMemUsage<commit_after>\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\n\/\/ The MIT License (MIT)\n\/\/\n\/\/ Copyright (c) 2014 stevehalliwell\n\/\/\n\/\/ Permission is hereby granted, free of charge, to any person obtaining a copy\n\/\/ of this software and associated documentation files (the \"Software\"), to deal\n\/\/ in the Software without restriction, including without limitation the rights\n\/\/ to use, copy, modify, merge, publish, distribute, sublicense, and\/or sell\n\/\/ copies of the Software, and to permit persons to whom the Software is\n\/\/ furnished to do so, subject to the following conditions:\n\/\/\n\/\/ The above copyright notice and this permission notice shall be included in all\n\/\/ copies or substantial portions of the Software.\n\/\/\n\/\/ THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\n\/\/ IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\n\/\/ FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE\n\/\/ AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\n\/\/ LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,\n\/\/ OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE\n\/\/ SOFTWARE.\n\/\/\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n#include <ResourceManager\/ResourceManager.hpp>\n#include <ResourceManager\/BaseResource.hpp>\n#include <ResourceManager\/LuaParser.hpp>\n#include <string>\n#include<vector>\nnamespace rm\n{\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\/ Initialise static members\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nResourceLookup ResourceManager::resources = {};\nResourceLookup ResourceManager::errorResources = {};\nResourceQueue ResourceManager::loadingQueue = {};\nResourceQueue ResourceManager::unloadQueue = {};\nResourceQueue ResourceManager::reloadQueue = {};\nbool ResourceManager::useNullForErrorRes = true;\n\nLoadCompleteCallback ResourceManager::loadCompleteCallback = nullptr;\n\n\n\nenum class LoadMode\n{\n Queue,\n Block,\n};\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\/ Function definitions\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nvoid ResourceManager::unloadResource(const std::string& name, LoadMode mode)\n{\n \/\/ Checking if resource exists in resources\n if (resources.find(name) != resources.end())\n {\n \/\/ Assigns a new pointer to the key for the resource \n ResourcePtr pointer = resources.find(name)->second;\n\n \/\/ If the resource has to be removed immediately\n if(mode == LoadMode::Block)\n {\n \/\/ Change the status of the BaseResource \n pointer->setIsLoaded(false);\n \/\/ Unload the BaseResource\n pointer->unload;\n }\n else\n {\n \/\/ Change the status of the BaseResource \n pointer->setIsLoaded(false);\n \/\/ Send to unloadQueue list\n unloadQueue.push(pointer);\n }\n return;\n }\n return;\n \n}\n\nvoid ResourceManager::reloadResource(const std::string& name)\n{\n ResourcePtr res = nullptr;\n\n \/\/ Check if resource exists in resource map\n if (resources.find(name) != resources.end())\n {\n\t\t\/\/ Set resource pointer\n res = resources[name];\n }\n else \n {\n Logger::logMessage(\"Reload resource warning: Resource not already loaded\");\n \n \/\/ Create new resource anyway\n \/\/loadingQueue.push(res);\n \/\/ Not quire sure how to handle this\/if we're allowing them to load anyway\n }\n \n \/\/ Send to reloadQueue\n reloadQueue.push(res);\n \n \/\/ Must appropriately set isLoaded in resource\n \/\/ Should it even change the state of isLoaded, since it will be loaded until it hits the queue?\n}\n\n\n\nvoid ResourceManager::initPack(const std::string& path)\n{\n \/\/How do you check if a string is a valid file path? Does this even need to be checked?\n \/*\n if(path is not a valid filepath)\n {\n return error?\n }\n *\/\n \n \/\/Get a list of data from the resource pack lua table\n ResourceDataList list = LuaParser::parsePack(path);\n \n \/\/iterate through the list and create a new resource if one does not already exist.\t\n for(ResourceDataList::iterator iter = list.begin(); iter != list.end(); iter++)\n {\n \/\/is this supposed to call initResource()? It seems like initResource() will not set an alias as it only takes a path, whereas this function can set the alias and type returned from the luaparser.\n \/\/initResource(list[iter].path);\n \n \/\/If it does not call initResource()\n bool exists = false;\n for(ResourceLookup::iterator iter2 = resources.begin(); iter2 != resources.end(); iter2++)\n {\n if(iter2->second->getFilePath() == path)\n {\n exists = true;\n }\n }\n \n if(!exists)\n {\n ResourcePtr res = ResourceFactory::createResource(iter->path, iter->type);\n res->setAlias(iter->alias);\n resources.insert({iter->alias, res});\n \n \/\/return success?\n }\n else\n {\n \/\/return error (already exists)?\n }\n }\n}\n\nvoid ResourceManager::loadPack(const std::string& path, LoadMode mode)\n{\n \/\/ Create a list from the parsePack\n ResourceDataList list = LuaParser::parsePack(path);\n\n \/\/ Iterate through the list\n for (ResourceDataList::iterator var = list.begin; var != list.end; ++var)\n {\n \/\/ Checking if resource exists in resources\n if (resources.find(var->alias) != resources.end())\n {\n \/\/ Assigns a new pointer to the key for the resource \n ResourcePtr pointer = resources.find(var->alias)->second;\n\n \/\/ Checking if the resource is not loaded\n if (pointer->isLoaded == false)\n {\n \/\/ If the resource has to be loaded immediately\n if (mode == LoadMode::Block)\n {\n \/\/ Change the status of the BaseResource \n pointer->setIsLoaded(true);\n \/\/ Unload the BaseResource\n pointer->load;\n }\n else\n {\n \n \/\/ Send to unloadQueue list\n loadingQueue.push(pointer);\n }\n }\n }\n \n }\n\n return;\n}\n\nvoid ResourceManager::unloadPack(const std::string& path, LoadMode mode)\n{\n \/\/ Create a list from the parsePack\n ResourceDataList list = LuaParser::parsePack(path);\n\n \/\/ Iterate through the list\n for (ResourceDataList::iterator var = list.begin; var != list.end; ++var)\n {\n \/\/ Checking if resource exists in resources\n if (resources.find(var->alias) != resources.end())\n {\n \/\/ Assigns a new pointer to the key for the resource \n ResourcePtr pointer = resources.find(var->alias)->second;\n\n \/\/ Checking if the resource is loaded\n if (pointer->isLoaded == true)\n {\n \/\/ If the resource has to be unloaded immediately\n if (mode == LoadMode::Block)\n {\n \/\/ Change the status of the BaseResource \n pointer->setIsLoaded(false);\n \/\/ Unload the BaseResource\n pointer->unload;\n }\n else\n {\n \/\/ Send to unloadQueue list\n unloadQueue.push(pointer);\n }\n }\n }\n\n }\n\n return;\n\n}\n\nvoid ResourceManager::reloadPack(const std::string& path)\n{\n\n \/\/ Create a list from the parsePack\n ResourceDataList list = LuaParser::parsePack(path);\n\n \/\/ Iterate through the list\n for (ResourceDataList::iterator var = list.begin; var != list.end; ++var)\n {\n \/\/ Assign the alias to a throw away string\n std::string name = var->alias;\n\n \/\/ Checking if resource exists in resource map\n if (resources.find(name) != resources.end())\n {\n \/\/ Assigns a new pointer to the key for the resource \n ResourcePtr res = resources.find(name)->second;\n\n \/\/ Send to reloadQueue\n reloadQueue.push(res);\n }\n else\n {\n Logger::logMessage(\"Reload resource warning: Resource not already loaded\");\n \n \/\/ Create new resource anyway\n \/\/loadingQueue.push(res);\n \/\/ Not quire sure how to handle this\/if we're allowing them to load anyway\n }\n }\n}\n\nvoid ResourceManager::switchPack(const std::string& fromPath, const std::string& toPath)\n{\n \/\/ Create a list from the parsePack for the current pack\n ResourceDataList from = LuaParser::parsePack(fromPath);\n\n \/\/ Create a list from the parsePack for the future Pack\n ResourceDataList tolist = LuaParser::parsePack(toPath);\n\n \/\/ Create a string vector to hold the common resources\n std::vector<std::string> common;\n\n \/\/ Load the future pack\n for (ResourceDataList::iterator var = tolist.begin; var != tolist.end; ++var)\n {\n \n \/\/ Checking if resource exists in resources\n if (resources.find(var->alias) != resources.end())\n {\n \/\/ Assigns a new pointer to the key for the resource \n ResourcePtr pointer = resources.find(var->alias)->second;\n\n \/\/ Checking if the resource is not loaded\n if (pointer->isLoaded == false)\n {\n \/\/ Change the status of the BaseResource \n pointer->setIsLoaded(true);\n \/\/ Send to unloadQueue list\n loadingQueue.push(pointer);\n }\n else\n {\n \/\/ Add the name to the vector\n common.push_back(var->alias);\n }\n }\n }\n\n \/\/ Iterate through the old Pack and remove the Resources that are not common to the pack and the vector\n for (ResourceDataList::iterator var = from.begin; var != from.end; ++var)\n {\n \n \/\/ Checking if resource is common to the string vector\n if (resources.find(var->alias) != resources.end())\n {\n\n if (std::find(common.begin(), common.end(), resources.find(var->alias) != common.end))\n {\n \/\/ The two entries are common - do nothing\n }\n else\n {\n \/\/ The two entries do not match - unload the old entry\n\n \/\/ Assigns a new pointer to the key for the resource \n ResourcePtr pointer = resources.find(var->alias)->second;\n \n \/\/ Send to unloadQueue list\n loadingQueue.push(pointer);\n }\n \n }\n }\n\n}\n\nvoid ResourceManager::init(bool _useNullForErrorRes)\n{\n useNullForErrorRes = _useNullForErrorRes;\n\n if(!useNullForErrorRes)\n {\n \/\/ initPack(\"ResMan_DefaultError_Resources\\ErrorResource_LuaFile.txt\");\n }\n}\n\nvoid ResourceManager::update()\n{\n loadFromQueue();\n unloadFromQueue();\n reloadFromQueue();\n}\n\nvoid ResourceManager::cleanupUnused()\n{\n \/\/ run for each resource in list\n for(auto r : resources)\n { \n \/\/ if the resource pointer is unique\n if(r->second.unique())\n { \n \/\/ Log what resources were unloaded\n Logger::logMessage(\"Unloading Unused Resource: \", r->first);\n \n \/\/ Change resource status to false\n r->second->setIsLoaded(false);\n\n \/\/ unload resource\n r->second->unload();\n }\n }\n}\n\nbool ResourceManager::isLoading()\n{\n return getNumToLoad() > 0;\n}\n\nsize_t ResourceManager::getNumToLoad()\/\/ResourceManager::getNumToLoad()\n{\n return loadingQueue.size();\n}\n\nResourceList ResourceManager::listAll()\n{\n \/\/ create a temp list to add pointers\n ResourceList temp;\n\n \/\/ iterate through and add each pointer to the temp list\n for (ResourceLookup::iterator it = resources.begin; it != resources.end; ++it)\n {\n temp.push_back(it->second);\n }\n\n return temp;\n}\n\nsize_t ResourceManager::getNumResources()\n{\n return resources.size();\n}\n\nvoid ResourceManager::setLoadCompleteCallback(LoadCompleteCallback callback)\n{\n loadCompleteCallback = callback;\n}\n\nvoid ResourceManager::loadFromQueue()\n{\n while (loadingQueue.size() > 0)\n {\n \/\/ Check First res in the queue\n auto frontRes = loadingQueue.front();\n\n \/\/ Check to see if the resource is already loaded.\n if (frontRes->isLoaded)\n {\n \/\/ If its loaded delete from queue\n \/\/ Allow for another resource to be loaded if there are stil l more in the queue.\n loadingQueue.pop();\n }\n else\n {\n \/\/ Load the first resource and check if any errors\n if (frontRes->load())\n {\n \/\/ Set resource to is loaded\n frontRes->setIsLoaded(true);\n \/\/ Remove from loading queue\n loadingQueue.pop();\n }\n else\n {\n \/\/ Log Error \n Logger::logMessage(\"Load Resource Failed: \", frontRes->getAlias);\n }\n \/\/ Send load complete call back once the last item is loaded.\n if (loadingQueue.size() == 0)\n {\n loadCompleteCallback();\n }\n \/\/ break from loop so only one resource is loaded at a time.\n break;\n }\n }\n}\n\nvoid ResourceManager::unloadFromQueue()\n{\n \/\/ Only run when queue is > 0\n while (unloadQueue.size() > 0)\n {\n \/\/ Check First res in the queue\n auto frontRes = unloadQueue.front();\n\n \/\/ Check to see if the resource is already unloaded.\n if (!frontRes->isLoaded)\n {\n \/\/ If its unloaded delete from queue\n \/\/ Allow for another resource to be unloaded if there are stil l more in the queue.\n unloadQueue.pop();\n }\n else\n {\n \/\/ Load the first resource and check if any errors\n if (frontRes->unload())\n {\n \/\/ Set resource to is unloaded\n frontRes->setIsLoaded(false);\n \/\/ Remove from unloadeding queue\n unloadQueue.pop();\n }\n else\n {\n \/\/ Log Error \n Logger::logMessage(\"Unload Resource Failed: \", frontRes->getAlias);\n }\n \/\/ break from loop so only one resource is unloaded at a time.\n break;\n }\n }\n}\n\nvoid ResourceManager::reloadFromQueue()\n{\n if (reloadQueue.size() > 0)\n {\n \/\/ Check First res in the queue\n auto frontRes = reloadQueue.front();\n\n\n \/\/ Load the first resource and check if any errors\n if (frontRes->reload())\n {\n \/\/ Remove from reloading Queue\n reloadQueue.pop();\n }\n else\n {\n \/\/ Log Error\n Logger::logMessage(\"Reload Resource Failed: \", frontRes->getAlias);\n }\n }\n}\n\n} \/\/ rm\n<|endoftext|>"} {"text":"<commit_before>\/\/ -*- c-basic-offset: 2; related-file-name: \"duplicateConservative.h\" -*-\n\/*\n * @(#)$Id$\n * \n * This file is distributed under the terms in the attached INTEL-LICENSE file.\n * If you do not find these files, copies can be found by writing to:\n * Intel Research Berkeley, 2150 Shattuck Avenue, Suite 1300,\n * Berkeley, CA, 94704. Attention: Intel License Inquiry.\n * \n *\/\n\n#include \"duplicateConservative.h\"\n\nDuplicateConservative::DuplicateConservative(str name, int outputs)\n : Element(name, 1, outputs),\n _push_cb(cbv_null),\n _block_flags(),\n _block_flag_count(0)\n{\n \/\/ Clean out the block flags\n _block_flags.zsetsize(noutputs());\n}\n\nvoid DuplicateConservative::unblock(int output)\n{\n assert((output >= 0) &&\n (output <= noutputs()));\n \n \/\/ Unset a blocked output\n if (_block_flags[output]) {\n log(LoggerI::INFO, -1, strbuf(\"unblock \") << output);\n\n _block_flags[output] = false;\n _block_flag_count--;\n assert(_block_flag_count >= 0);\n }\n\n \/\/ If I have no more blocked outputs, unblock my pusher\n if (_block_flag_count == 0) {\n \/\/assert(_push_cb != cbv_null);\n log(LoggerI::INFO, -1, \"unblock: propagating aggregate unblock\");\n _push_cb();\n _push_cb = cbv_null;\n }\n}\n\nint DuplicateConservative::push(int port, TupleRef p, cbv cb)\n{\n assert(p != 0);\n assert(port == 0);\n\n \/\/ Can I take more?\n if (_block_flag_count > 0) {\n \/\/ I'm still blocked\n assert(_push_cb != cbv_null);\n log(LoggerI::WARN, -1, \"push: Overrun\");\n return 0;\n }\n\n \/\/ We're free and clear\n assert(_block_flag_count == 0);\n assert(_push_cb == cbv_null);\n\n \/\/ For every output\n for (int i = 0;\n i < noutputs();\n i++) {\n \/\/ Send it with the appropriate callback\n int result = output(i)->push(p, wrap(this, &DuplicateConservative::unblock, i));\n\n assert(_block_flags[i] == false);\n\n \/\/ If it can take no more\n if (result == 0) {\n \/\/ update the flags\n _block_flags[i] = true;\n _block_flag_count++;\n }\n }\n\n \/\/ If I just blocked any of my outputs, push back my input\n if (_block_flag_count > 0) {\n _push_cb = cb;\n log(LoggerI::WARN, -1, \"push: Blocking input\");\n return 0;\n } else {\n return 1;\n }\n}\n\n<commit_msg>dupconservative<commit_after>\/\/ -*- c-basic-offset: 2; related-file-name: \"duplicateConservative.h\" -*-\n\/*\n * @(#)$Id$\n * \n * This file is distributed under the terms in the attached INTEL-LICENSE file.\n * If you do not find these files, copies can be found by writing to:\n * Intel Research Berkeley, 2150 Shattuck Avenue, Suite 1300,\n * Berkeley, CA, 94704. Attention: Intel License Inquiry.\n * \n *\/\n\n#include \"duplicateConservative.h\"\n\nDuplicateConservative::DuplicateConservative(str name, int outputs)\n : Element(name, 1, outputs),\n _push_cb(cbv_null),\n _block_flags(),\n _block_flag_count(0)\n{\n \/\/ Clean out the block flags\n _block_flags.zsetsize(noutputs());\n}\n\nvoid DuplicateConservative::unblock(int output)\n{\n assert((output >= 0) &&\n (output <= noutputs()));\n \n \/\/ Unset a blocked output\n if (_block_flags[output]) {\n log(LoggerI::INFO, -1, strbuf(\"unblock \") << output);\n\n _block_flags[output] = false;\n _block_flag_count--;\n assert(_block_flag_count >= 0);\n }\n\n \/\/ If I have no more blocked outputs, unblock my pusher\n if (_block_flag_count == 0) {\n log(LoggerI::INFO, -1, str(strbuf() << \"unblock: propagating aggregate unblock \" << output));\n \/\/assert(_push_cb != cbv_null);\n _push_cb();\n _push_cb = cbv_null;\n }\n}\n\nint DuplicateConservative::push(int port, TupleRef p, cbv cb)\n{\n assert(p != 0);\n assert(port == 0);\n\n \/\/ Can I take more?\n if (_block_flag_count > 0) {\n \/\/ I'm still blocked\n assert(_push_cb != cbv_null);\n log(LoggerI::WARN, -1, \"push: Overrun\");\n return 0;\n }\n\n \/\/ We're free and clear\n assert(_block_flag_count == 0);\n assert(_push_cb == cbv_null);\n\n \/\/ For every output\n for (int i = 0;\n i < noutputs();\n i++) {\n \/\/ Send it with the appropriate callback\n int result = output(i)->push(p, wrap(this, &DuplicateConservative::unblock, i));\n\n assert(_block_flags[i] == false);\n\n \/\/ If it can take no more\n if (result == 0) {\n \/\/ update the flags\n _block_flags[i] = true;\n _block_flag_count++;\n }\n }\n\n \/\/ If I just blocked any of my outputs, push back my input\n if (_block_flag_count > 0) {\n _push_cb = cb;\n log(LoggerI::WARN, -1, \"push: Blocking input\");\n return 0;\n } else {\n return 1;\n }\n}\n\n<|endoftext|>"} {"text":"<commit_before>\/************************************************************\nCOSC 501\nElliott Plack\n19 NOV 2013 Due 25 NOV 2013\nProblem: Create a 1-dimensional array with n elements; get\n\tthe size of the array as user input (validate!), max size\n\tshould be 10 (declared as class constant). Perform a\n\tvariety of functions with the array.\nAlgorithm: Get array size from user, validate, get values,\n\tperform functions.\n************************************************************\/\n#include <iostream>\n#include <iomanip>\nusing namespace std;\n\n\/\/ various array handling functions\nfloat average(float numbers[], int arraySize);\nvoid even(float numbers[], int arraySize);\nvoid odd(float numbers[], int arraySize);\nfloat evenSum(float numbers[], int arraySize);\nfloat oddSum(float numbers[], int arraySize);\n\nint main()\n{\n\t\/\/ intro\n\n\tcout << \"This program does a variety of calculations on an array.\\n\";\n\t\n\t\/\/ do loop around entire program\n\n\tchar continueQuestion = 'Y'; \/\/ check if user wants to run or repeat\n\tcout << \"Do you want to start? (Y\/N): \";\n\tcin >> continueQuestion;\n\twhile (continueQuestion == 'Y' || continueQuestion == 'y')\n\t{\n\t\t\/\/ variables\n\n\t\tint arraySize = 0; \/\/ size of the array\n\t\tconst int maxArraySize = 10; \/\/ max size of the array\n\t\tfloat averageNum(0), evenSumNum(0), oddSumNum(0); \/\/ variables that returns will be stored in\n\n\n\t\t\/\/ array size determination\n\n\t\tcout << \"\\nEnter the size of the array up to 10.\\n\";\n\t\twhile (!(cin >> arraySize) || arraySize < 1 || arraySize > maxArraySize) \/\/ validate\n\t\t{\n\t\t\tcin.clear(); \/\/ Clear the error flags \n\t\t\tcin.ignore(100, '\\n'); \/\/ Remove unwanted characters from buffer \n\t\t\tcout << \"\\aEnter a positive integer, less than 10: \"; \/\/ Re-issue the prompt \n\t\t}\n\t\tcout << \"\\nNow enter the \" << arraySize << \" values.\\n\";\n\n\n\t\t\/\/ set up array\n\n\t\tfloat *numbers;\n\t\tnumbers = new float[arraySize]; \/\/ declare numbers array with 'elements' (n) positions\n\n\n\t\t\/\/ loop to fill array\n\n\t\tfor (int i = 0; i < arraySize; i++)\n\t\t{\n\t\t\tcout << (i + 1) << \": \"; \/\/ display the iterator + 1 since it begins as 0\n\t\t\twhile ((!(cin >> numbers[i]))) \/\/detects errors in input\n\t\t\t{\n\t\t\t\tcin.clear(); \/\/ Clear the error flags\n\t\t\t\tcin.ignore(100, '\\n'); \/\/ Remove unwanted characters from buffer\n\t\t\t\tcout << \"\\aInput Error. Please enter a number only.\\n\"; \/\/ if error, sound the alarm\n\t\t\t\tcout << (i + 1) << \": \";\n\t\t\t}\n\t\t}\n\n\n\t\t\/\/ display array\n\n\t\tcout << \"\\nThe array elements are:\\n\";\n\t\tcout << \" \"; \/\/ indent separator for clarity\n\t\tfor (int i = 0; i < arraySize; i++) \/\/ test loop to output variables in positions\n\t\t{\n\t\t\tcout << numbers[i] << \" \"; \/\/ space separated\n\t\t}\n\n\t\tcout << endl; \/\/ break in output\n\n\n\t\t\/\/ output average\n\n\t\taverageNum = average(numbers, arraySize);\n\t\tcout << \"\\nThe average value = \" << averageNum << endl;\n\n\n\t\t\/\/ even subscripts\n\n\t\teven(numbers, arraySize);\n\n\n\t\t\/\/ even sum\n\n\t\tcout << \"\\nThe sum of the elements with even subscripts = \" << evenSum(numbers, arraySize) << endl;\n\n\n\t\t\/\/ odd subscripts\n\n\t\todd(numbers, arraySize);\n\n\n\t\t\/\/ odd sum\n\n\t\tcout << \"\\nThe sum of the elements with odd subscripts = \" << oddSum(numbers, arraySize) << endl;\n\n\n\t\t\/\/ repeat?\n\n\t\tcout << \"\\nDo you want to continue? (Y\/N):\";\n\t\tcin >> continueQuestion;\n\t}\n\n\treturn 0;\n}\n\nfloat average(float numbers[], int arraySize)\n{\n\tfloat sum(0), average(0); \/\/ define variables\n\tfor (int i = 0; i < arraySize; i++)\n\t{\n\t\tsum += numbers[i];\n\t}\n\taverage = (sum \/ arraySize);\n\treturn average;\n}\n\nvoid even(float numbers[], int arraySize) \/\/ display even values\n{\n\tint temp = 0;\n\n\t\/\/ format output\n\tcout << \"\\nThe elements with even subscripts are:\\n\"\n\t\t << \"Index Value\\n\"\n\t\t << \"=============\\n\";\n\t\n\t\/\/ even check subs\n\tfor (int i = 0; i < arraySize; i++)\n\t{\n\t\ttemp = (int)numbers[i] % 2; \/\/ if integer version of value in numbers array is even..\n\t\tif (temp == 0)\n\t\t\tcout << setw(5) << (i+1) << setw(8) << numbers[i] << endl; \/\/ output the value\n\t}\n}\nvoid odd(float numbers[], int arraySize) \/\/ display odd values\n{\n\tint temp = 0;\n\n\t\/\/ format output\n\tcout << \"\\nThe elements with odd subscripts are:\\n\"\n\t\t<< \"Index Value\\n\"\n\t\t<< \"=============\\n\";\n\n\t\/\/ even check subs\n\tfor (int i = 0; i < arraySize; i++)\n\t{\n\t\ttemp = (int)numbers[i] % 2; \/\/ if integer version of value in numbers array is odd..\n\t\tif (temp != 0)\n\t\t\tcout << setw(5) << (i+1) << setw(8) << numbers[i] << endl; \/\/ output the value\n\t}\n}\nfloat evenSum(float numbers[], int arraySize) \/\/ return even sums\n{\n\tint temp = 0;\n\tfloat sum(0), average(0); \/\/ define variables\n\tfor (int i = 0; i < arraySize; i++)\n\t{\n\t\ttemp = (int)numbers[i] % 2; \/\/ find mod array index div by 2\n\t\tif (temp == 0)\n\t\t\tsum += numbers[i]; \/\/ if mod is zero (even) add to sum)\n\t}\n\n\treturn sum;\n}\nfloat oddSum(float numbers[], int arraySize) \/\/ return odd sums\n{\n\tint temp = 0;\n\tfloat sum(0), average(0); \/\/ define variables\n\tfor (int i = 0; i < arraySize; i++)\n\t{\n\t\ttemp = (int)numbers[i] % 2; \/\/ find mod array index div by 2\n\t\tif (temp != 0)\n\t\t\tsum += numbers[i]; \/\/ if mod is not zero (odd) add to sum)\n\t}\n\n\treturn sum;\n}<commit_msg>built in xCode<commit_after>\/************************************************************\nCOSC 501\nElliott Plack\n19 NOV 2013 Due 25 NOV 2013\nProblem: Create a 1-dimensional array with n elements; get\n\tthe size of the array as user input (validate!), max size\n\tshould be 10 (declared as class constant). Perform a\n\tvariety of functions with the array.\nAlgorithm: Get array size from user, validate, get values,\n\tperform functions.\n************************************************************\/\n#include <iostream>\n#include <iomanip>\nusing namespace std;\n\n\/\/ various array handling functions\nfloat average(float numbers[], int arraySize);\nvoid even(float numbers[], int arraySize);\nvoid odd(float numbers[], int arraySize);\nfloat evenSum(float numbers[], int arraySize);\nfloat oddSum(float numbers[], int arraySize);\n\nint main()\n{\n\t\/\/ intro\n\n\tcout << \"This program does a variety of calculations on an array.\\n\";\n\t\n\t\/\/ do loop around entire program\n\n\tchar continueQuestion = 'Y'; \/\/ check if user wants to run or repeat\n\tcout << \"Do you want to start? (Y\/N): \";\n\tcin >> continueQuestion;\n\twhile (continueQuestion == 'Y' || continueQuestion == 'y')\n\t{\n\t\t\/\/ variables\n\n\t\tint arraySize = 0; \/\/ size of the array\n\t\tconst int maxArraySize = 10; \/\/ max size of the array\n\t\tfloat averageNum(0); \/\/ variables that returns will be stored in\n\n\n\t\t\/\/ array size determination\n\n\t\tcout << \"\\nEnter the size of the array up to 10.\\n\";\n\t\twhile (!(cin >> arraySize) || arraySize < 1 || arraySize > maxArraySize) \/\/ validate\n\t\t{\n\t\t\tcin.clear(); \/\/ Clear the error flags \n\t\t\tcin.ignore(100, '\\n'); \/\/ Remove unwanted characters from buffer \n\t\t\tcout << \"\\aEnter a positive integer, less than 10: \"; \/\/ Re-issue the prompt \n\t\t}\n\t\tcout << \"\\nNow enter the \" << arraySize << \" values.\\n\";\n\n\n\t\t\/\/ set up array\n\n\t\tfloat *numbers;\n\t\tnumbers = new float[arraySize]; \/\/ declare numbers array with 'elements' (n) positions\n\n\n\t\t\/\/ loop to fill array\n\n\t\tfor (int i = 0; i < arraySize; i++)\n\t\t{\n\t\t\tcout << (i + 1) << \": \"; \/\/ display the iterator + 1 since it begins as 0\n\t\t\twhile ((!(cin >> numbers[i]))) \/\/detects errors in input\n\t\t\t{\n\t\t\t\tcin.clear(); \/\/ Clear the error flags\n\t\t\t\tcin.ignore(100, '\\n'); \/\/ Remove unwanted characters from buffer\n\t\t\t\tcout << \"\\aInput Error. Please enter a number only.\\n\"; \/\/ if error, sound the alarm\n\t\t\t\tcout << (i + 1) << \": \";\n\t\t\t}\n\t\t}\n\n\n\t\t\/\/ display array\n\n\t\tcout << \"\\nThe array elements are:\\n\";\n\t\tcout << \" \"; \/\/ indent separator for clarity\n\t\tfor (int i = 0; i < arraySize; i++) \/\/ test loop to output variables in positions\n\t\t{\n\t\t\tcout << numbers[i] << \" \"; \/\/ space separated\n\t\t}\n\n\t\tcout << endl; \/\/ break in output\n\n\n\t\t\/\/ output average\n\n\t\taverageNum = average(numbers, arraySize);\n\t\tcout << \"\\nThe average value = \" << averageNum << endl;\n\n\n\t\t\/\/ even subscripts\n\n\t\teven(numbers, arraySize);\n\n\n\t\t\/\/ even sum\n\n\t\tcout << \"\\nThe sum of the elements with even subscripts = \" << evenSum(numbers, arraySize) << endl;\n\n\n\t\t\/\/ odd subscripts\n\n\t\todd(numbers, arraySize);\n\n\n\t\t\/\/ odd sum\n\n\t\tcout << \"\\nThe sum of the elements with odd subscripts = \" << oddSum(numbers, arraySize) << endl;\n\n\n\t\t\/\/ repeat?\n\n\t\tcout << \"\\nDo you want to continue? (Y\/N):\";\n\t\tcin >> continueQuestion;\n\t}\n\n\treturn 0;\n}\n\nfloat average(float numbers[], int arraySize)\n{\n\tfloat sum(0), average(0); \/\/ define variables\n\tfor (int i = 0; i < arraySize; i++)\n\t{\n\t\tsum += numbers[i];\n\t}\n\taverage = (sum \/ arraySize);\n\treturn average;\n}\n\nvoid even(float numbers[], int arraySize) \/\/ display even values\n{\n\tint temp = 0;\n\n\t\/\/ format output\n\tcout << \"\\nThe elements with even subscripts are:\\n\"\n\t\t << \"Index Value\\n\"\n\t\t << \"=============\\n\";\n\t\n\t\/\/ even check subs\n\tfor (int i = 0; i < arraySize; i++)\n\t{\n\t\ttemp = (int)numbers[i] % 2; \/\/ if integer version of value in numbers array is even..\n\t\tif (temp == 0)\n\t\t\tcout << setw(5) << (i+1) << setw(8) << numbers[i] << endl; \/\/ output the value\n\t}\n}\nvoid odd(float numbers[], int arraySize) \/\/ display odd values\n{\n\tint temp = 0;\n\n\t\/\/ format output\n\tcout << \"\\nThe elements with odd subscripts are:\\n\"\n\t\t<< \"Index Value\\n\"\n\t\t<< \"=============\\n\";\n\n\t\/\/ even check subs\n\tfor (int i = 0; i < arraySize; i++)\n\t{\n\t\ttemp = (int)numbers[i] % 2; \/\/ if integer version of value in numbers array is odd..\n\t\tif (temp != 0)\n\t\t\tcout << setw(5) << (i+1) << setw(8) << numbers[i] << endl; \/\/ output the value\n\t}\n}\nfloat evenSum(float numbers[], int arraySize) \/\/ return even sums\n{\n\tint temp = 0;\n\tfloat sum(0); \/\/ define variables\n\tfor (int i = 0; i < arraySize; i++)\n\t{\n\t\ttemp = (int)numbers[i] % 2; \/\/ find mod array index div by 2\n\t\tif (temp == 0)\n\t\t\tsum += numbers[i]; \/\/ if mod is zero (even) add to sum)\n\t}\n\n\treturn sum;\n}\nfloat oddSum(float numbers[], int arraySize) \/\/ return odd sums\n{\n\tint temp = 0;\n\tfloat sum(0); \/\/ define variables\n\tfor (int i = 0; i < arraySize; i++)\n\t{\n\t\ttemp = (int)numbers[i] % 2; \/\/ find mod array index div by 2\n\t\tif (temp != 0)\n\t\t\tsum += numbers[i]; \/\/ if mod is not zero (odd) add to sum)\n\t}\n\n\treturn sum;\n}<|endoftext|>"} {"text":"<commit_before>class Solution {\npublic:\n vector<int> twoSum(vector<int>& nums, int target) {\n vector<int> res;\n multimap<int,int> nums_map;\n for(unsigned int i=0; i < nums.size();++i)\n {\n nums_map.insert(make_pair(nums.at(i),i));\n }\n for(unsigned int i = 0; i < nums.size(); ++i)\n {\n int other = target-nums.at(i), pos = -1;\n auto check = nums_map.equal_range(other);\n for(auto j = check.first; j != check.second; ++j)\n {\n if((*j).second != i)\n pos = j->second;\n }\n if(pos != -1)\n {\n res.push_back(i+1);\n res.push_back(pos+1);\n break;\n }\n }\n return res;\n }\n};\n<commit_msg>Update 1.cpp<commit_after>class Solution {\npublic:\n vector<int> twoSum(vector<int>& nums, int target) {\n vector<int> res;\n multimap<int,int> nums_map;\n for(unsigned int i=0; i < nums.size();++i)\n {\n nums_map.insert(make_pair(nums.at(i),i));\n }\n for(unsigned int i = 0; i < nums.size(); ++i)\n {\n int other = target-nums.at(i), pos = -1;\n auto check = nums_map.equal_range(other);\n for(auto j = check.first; j != check.second; ++j)\n {\n if((*j).second != i)\n pos = j->second;\n }\n if(pos != -1)\n {\n res.push_back(i+1);\n res.push_back(pos+1);\n break;\n }\n }\n return res;\n }\n};\n\n<|endoftext|>"} {"text":"<commit_before>\/**\n * Zillians MMO\n * Copyright (C) 2007-2011 Zillians.com, Inc.\n * For more information see http:\/\/www.zillians.com\n *\n * Zillians MMO is the library and runtime for massive multiplayer online game\n * development in utility computing model, which runs as a service for every\n * developer to build their virtual world running on our GPU-assisted machines.\n *\n * This is a close source library intended to be used solely within Zillians.com\n *\n * THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\n * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\n * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE\n * COPYRIGHT HOLDER(S) BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN\n * AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN\n * CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.\n *\/\n\n#include \"language\/stage\/serialization\/detail\/ASTSerializationHelper.h\"\n#include \"language\/stage\/serialization\/visitor\/ASTDeserializationStageVisitor.h\"\n#include \"language\/stage\/serialization\/visitor\/ASTSerializationStageVisitor.h\"\n\nnamespace zillians { namespace language { namespace stage {\n\nbool ASTSerializationHelper::serialize(const std::string& filename, tree::ASTNode* node)\n{\n std::ofstream ofs(filename);\n if(!ofs.good()) return false;\n\n \/\/ serialize through boost archive\n boost::archive::text_oarchive oa(ofs);\n tree::ASTNode* to_serialize = node;\n oa << to_serialize;\n\n\t\/\/ de-serialize all objects attached to ContextHub\n\t\/\/ see ASTSerializationStageVisitor::FullDeserializer, which defines the context object types needed to be serialized\n visitor::ASTSerializationStageVisitor<boost::archive::text_oarchive> serialzer(oa);\n serialzer.visit(*to_serialize);\n}\n\ntree::ASTNode* ASTSerializationHelper::deserialize(const std::string& filename)\n{\n\tstd::ifstream ifs(filename);\n\tif(!ifs.good()) return NULL;\n\n\t\/\/ de-serialize through boost archive\n\tboost::archive::text_iarchive ia(ifs);\n\ttree::ASTNode* from_serialize = NULL;\n\tia >> from_serialize;\n\n\t\/\/ de-serialize all objects attached to ContextHub\n\t\/\/ see ASTDeserializationStageVisitor::FullDeserializer, which defines the context object types needed to be de-serialized\n\tvisitor::ASTDeserializationStageVisitor<boost::archive::text_iarchive> deserialzer(ia);\n\tdeserialzer.visit(*from_serialize);\n\n\treturn from_serialize;\n}\n\n} } }\n<commit_msg>fix serialization bug<commit_after>\/**\n * Zillians MMO\n * Copyright (C) 2007-2011 Zillians.com, Inc.\n * For more information see http:\/\/www.zillians.com\n *\n * Zillians MMO is the library and runtime for massive multiplayer online game\n * development in utility computing model, which runs as a service for every\n * developer to build their virtual world running on our GPU-assisted machines.\n *\n * This is a close source library intended to be used solely within Zillians.com\n *\n * THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\n * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\n * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE\n * COPYRIGHT HOLDER(S) BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN\n * AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN\n * CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.\n *\/\n\n#include <boost\/serialization\/export.hpp>\n#include <boost\/archive\/text_oarchive.hpp>\n#include <boost\/archive\/text_iarchive.hpp>\n#include \"language\/stage\/serialization\/detail\/ASTSerializationHelper.h\"\n#include \"language\/stage\/serialization\/visitor\/ASTDeserializationStageVisitor.h\"\n#include \"language\/stage\/serialization\/visitor\/ASTSerializationStageVisitor.h\"\n\nBOOST_CLASS_EXPORT_GUID(zillians::language::tree::ASTNode , \"ASTNode\")\nBOOST_CLASS_EXPORT_GUID(zillians::language::tree::Annotation , \"Annotation\")\nBOOST_CLASS_EXPORT_GUID(zillians::language::tree::Annotations , \"Annotations\")\nBOOST_CLASS_EXPORT_GUID(zillians::language::tree::Internal , \"Internal\")\nBOOST_CLASS_EXPORT_GUID(zillians::language::tree::Program , \"Program\")\nBOOST_CLASS_EXPORT_GUID(zillians::language::tree::Package , \"Package\")\nBOOST_CLASS_EXPORT_GUID(zillians::language::tree::Import , \"Import\")\nBOOST_CLASS_EXPORT_GUID(zillians::language::tree::Block , \"Block\")\nBOOST_CLASS_EXPORT_GUID(zillians::language::tree::Identifier , \"Identifier\")\nBOOST_CLASS_EXPORT_GUID(zillians::language::tree::SimpleIdentifier , \"SimpleIdentifier\")\nBOOST_CLASS_EXPORT_GUID(zillians::language::tree::NestedIdentifier , \"NestedIdentifier\")\nBOOST_CLASS_EXPORT_GUID(zillians::language::tree::TemplatedIdentifier , \"TemplatedIdent\")\nBOOST_CLASS_EXPORT_GUID(zillians::language::tree::Literal , \"Literal\")\nBOOST_CLASS_EXPORT_GUID(zillians::language::tree::NumericLiteral , \"NumericLiteral\")\nBOOST_CLASS_EXPORT_GUID(zillians::language::tree::StringLiteral , \"StringLiteral\")\nBOOST_CLASS_EXPORT_GUID(zillians::language::tree::ObjectLiteral , \"ObjectLiteral\")\nBOOST_CLASS_EXPORT_GUID(zillians::language::tree::TypeSpecifier , \"TypeSpecifier\")\nBOOST_CLASS_EXPORT_GUID(zillians::language::tree::FunctionType , \"FunctionType\")\nBOOST_CLASS_EXPORT_GUID(zillians::language::tree::Declaration , \"Declaration\")\nBOOST_CLASS_EXPORT_GUID(zillians::language::tree::ClassDecl , \"ClassDecl\")\nBOOST_CLASS_EXPORT_GUID(zillians::language::tree::EnumDecl , \"EnumDecl\")\nBOOST_CLASS_EXPORT_GUID(zillians::language::tree::InterfaceDecl , \"InterfaceDecl\")\nBOOST_CLASS_EXPORT_GUID(zillians::language::tree::TypedefDecl , \"TypedefDecl\")\nBOOST_CLASS_EXPORT_GUID(zillians::language::tree::FunctionDecl , \"FunctionDecl\")\nBOOST_CLASS_EXPORT_GUID(zillians::language::tree::VariableDecl , \"VariableDecl\")\nBOOST_CLASS_EXPORT_GUID(zillians::language::tree::Statement , \"Statement\")\nBOOST_CLASS_EXPORT_GUID(zillians::language::tree::DeclarativeStmt , \"DeclarativeStm\")\nBOOST_CLASS_EXPORT_GUID(zillians::language::tree::ExpressionStmt , \"ExpressionStmt\")\nBOOST_CLASS_EXPORT_GUID(zillians::language::tree::IterativeStmt , \"IterativeStmt\")\nBOOST_CLASS_EXPORT_GUID(zillians::language::tree::ForStmt , \"ForStmt\")\nBOOST_CLASS_EXPORT_GUID(zillians::language::tree::ForeachStmt , \"ForeachStmt\")\nBOOST_CLASS_EXPORT_GUID(zillians::language::tree::WhileStmt , \"WhileStmt\")\nBOOST_CLASS_EXPORT_GUID(zillians::language::tree::SelectionStmt , \"SelectionStmt\")\nBOOST_CLASS_EXPORT_GUID(zillians::language::tree::IfElseStmt , \"IfElseStmt\")\nBOOST_CLASS_EXPORT_GUID(zillians::language::tree::SwitchStmt , \"SwitchStmt\")\nBOOST_CLASS_EXPORT_GUID(zillians::language::tree::BranchStmt , \"BranchStmt\")\nBOOST_CLASS_EXPORT_GUID(zillians::language::tree::Expression , \"Expression\")\nBOOST_CLASS_EXPORT_GUID(zillians::language::tree::PrimaryExpr , \"PrimaryExpr\")\nBOOST_CLASS_EXPORT_GUID(zillians::language::tree::UnaryExpr , \"UnaryExpr\")\nBOOST_CLASS_EXPORT_GUID(zillians::language::tree::BinaryExpr , \"BinaryExpr\")\nBOOST_CLASS_EXPORT_GUID(zillians::language::tree::TernaryExpr , \"TernaryExpr\")\nBOOST_CLASS_EXPORT_GUID(zillians::language::tree::MemberExpr , \"MemberExpr\")\nBOOST_CLASS_EXPORT_GUID(zillians::language::tree::CallExpr , \"CallExpr\")\nBOOST_CLASS_EXPORT_GUID(zillians::language::tree::CastExpr , \"CastExpr\")\n\nnamespace zillians { namespace language { namespace stage {\n\nbool ASTSerializationHelper::serialize(const std::string& filename, tree::ASTNode* node)\n{\n std::ofstream ofs(filename);\n if(!ofs.good()) return false;\n\n \/\/ serialize through boost archive\n boost::archive::text_oarchive oa(ofs);\n tree::ASTNode* to_serialize = node;\n oa << to_serialize;\n\n\t\/\/ de-serialize all objects attached to ContextHub\n\t\/\/ see ASTSerializationStageVisitor::FullDeserializer, which defines the context object types needed to be serialized\n visitor::ASTSerializationStageVisitor<boost::archive::text_oarchive> serialzer(oa);\n serialzer.visit(*to_serialize);\n}\n\ntree::ASTNode* ASTSerializationHelper::deserialize(const std::string& filename)\n{\n\tstd::ifstream ifs(filename);\n\tif(!ifs.good()) return NULL;\n\n\t\/\/ de-serialize through boost archive\n\tboost::archive::text_iarchive ia(ifs);\n\ttree::ASTNode* from_serialize = NULL;\n\tia >> from_serialize;\n\n\t\/\/ de-serialize all objects attached to ContextHub\n\t\/\/ see ASTDeserializationStageVisitor::FullDeserializer, which defines the context object types needed to be de-serialized\n\tvisitor::ASTDeserializationStageVisitor<boost::archive::text_iarchive> deserialzer(ia);\n\tdeserialzer.visit(*from_serialize);\n\n\treturn from_serialize;\n}\n\n} } }\n<|endoftext|>"} {"text":"<commit_before><commit_msg>editeng: Avoid calling expensive getLineBreak() if possible<commit_after><|endoftext|>"} {"text":"<commit_before>\/\/\n\/\/ Copyright © 2017 Arm Ltd. All rights reserved.\n\/\/ SPDX-License-Identifier: MIT\n\/\/\n\n#include \"SerializerUtils.hpp\"\n\nnamespace armnnSerializer\n{\n\narmnnSerializer::ComparisonOperation GetFlatBufferComparisonOperation(armnn::ComparisonOperation comparisonOperation)\n{\n switch (comparisonOperation)\n {\n case armnn::ComparisonOperation::Equal:\n return armnnSerializer::ComparisonOperation::ComparisonOperation_Equal;\n case armnn::ComparisonOperation::Greater:\n return armnnSerializer::ComparisonOperation::ComparisonOperation_Greater;\n case armnn::ComparisonOperation::GreaterOrEqual:\n return armnnSerializer::ComparisonOperation::ComparisonOperation_GreaterOrEqual;\n case armnn::ComparisonOperation::Less:\n return armnnSerializer::ComparisonOperation::ComparisonOperation_Less;\n case armnn::ComparisonOperation::LessOrEqual:\n return armnnSerializer::ComparisonOperation::ComparisonOperation_LessOrEqual;\n case armnn::ComparisonOperation::NotEqual:\n default:\n return armnnSerializer::ComparisonOperation::ComparisonOperation_NotEqual;\n }\n}\n\narmnnSerializer::ConstTensorData GetFlatBufferConstTensorData(armnn::DataType dataType)\n{\n switch (dataType)\n {\n case armnn::DataType::Float32:\n case armnn::DataType::Signed32:\n return armnnSerializer::ConstTensorData::ConstTensorData_IntData;\n case armnn::DataType::Float16:\n return armnnSerializer::ConstTensorData::ConstTensorData_ShortData;\n case armnn::DataType::QuantisedAsymm8:\n case armnn::DataType::Boolean:\n return armnnSerializer::ConstTensorData::ConstTensorData_ByteData;\n default:\n return armnnSerializer::ConstTensorData::ConstTensorData_NONE;\n }\n}\n\narmnnSerializer::DataType GetFlatBufferDataType(armnn::DataType dataType)\n{\n switch (dataType)\n {\n case armnn::DataType::Float32:\n return armnnSerializer::DataType::DataType_Float32;\n case armnn::DataType::Float16:\n return armnnSerializer::DataType::DataType_Float16;\n case armnn::DataType::Signed32:\n return armnnSerializer::DataType::DataType_Signed32;\n case armnn::DataType::QuantisedAsymm8:\n return armnnSerializer::DataType::DataType_QuantisedAsymm8;\n case armnn::DataType::Boolean:\n return armnnSerializer::DataType::DataType_Boolean;\n default:\n return armnnSerializer::DataType::DataType_Float16;\n }\n}\n\narmnnSerializer::DataLayout GetFlatBufferDataLayout(armnn::DataLayout dataLayout)\n{\n switch (dataLayout)\n {\n case armnn::DataLayout::NHWC:\n return armnnSerializer::DataLayout::DataLayout_NHWC;\n case armnn::DataLayout::NCHW:\n default:\n return armnnSerializer::DataLayout::DataLayout_NCHW;\n }\n}\n\narmnnSerializer::PoolingAlgorithm GetFlatBufferPoolingAlgorithm(armnn::PoolingAlgorithm poolingAlgorithm)\n{\n switch (poolingAlgorithm)\n {\n case armnn::PoolingAlgorithm::Average:\n return armnnSerializer::PoolingAlgorithm::PoolingAlgorithm_Average;\n case armnn::PoolingAlgorithm::L2:\n return armnnSerializer::PoolingAlgorithm::PoolingAlgorithm_L2;\n case armnn::PoolingAlgorithm::Max:\n default:\n return armnnSerializer::PoolingAlgorithm::PoolingAlgorithm_Max;\n }\n}\n\narmnnSerializer::OutputShapeRounding GetFlatBufferOutputShapeRounding(armnn::OutputShapeRounding outputShapeRounding)\n{\n switch (outputShapeRounding)\n {\n case armnn::OutputShapeRounding::Ceiling:\n return armnnSerializer::OutputShapeRounding::OutputShapeRounding_Ceiling;\n case armnn::OutputShapeRounding::Floor:\n default:\n return armnnSerializer::OutputShapeRounding::OutputShapeRounding_Floor;\n }\n}\n\narmnnSerializer::PaddingMethod GetFlatBufferPaddingMethod(armnn::PaddingMethod paddingMethod)\n{\n switch (paddingMethod)\n {\n case armnn::PaddingMethod::IgnoreValue:\n return armnnSerializer::PaddingMethod::PaddingMethod_IgnoreValue;\n case armnn::PaddingMethod::Exclude:\n default:\n return armnnSerializer::PaddingMethod::PaddingMethod_Exclude;\n }\n}\n\narmnnSerializer::NormalizationAlgorithmChannel GetFlatBufferNormalizationAlgorithmChannel(\n armnn::NormalizationAlgorithmChannel normalizationAlgorithmChannel)\n{\n switch (normalizationAlgorithmChannel)\n {\n case armnn::NormalizationAlgorithmChannel::Across:\n return armnnSerializer::NormalizationAlgorithmChannel::NormalizationAlgorithmChannel_Across;\n case armnn::NormalizationAlgorithmChannel::Within:\n return armnnSerializer::NormalizationAlgorithmChannel::NormalizationAlgorithmChannel_Within;\n default:\n return armnnSerializer::NormalizationAlgorithmChannel::NormalizationAlgorithmChannel_Across;\n }\n}\n\narmnnSerializer::NormalizationAlgorithmMethod GetFlatBufferNormalizationAlgorithmMethod(\n armnn::NormalizationAlgorithmMethod normalizationAlgorithmMethod)\n{\n switch (normalizationAlgorithmMethod)\n {\n case armnn::NormalizationAlgorithmMethod::LocalBrightness:\n return armnnSerializer::NormalizationAlgorithmMethod::NormalizationAlgorithmMethod_LocalBrightness;\n case armnn::NormalizationAlgorithmMethod::LocalContrast:\n return armnnSerializer::NormalizationAlgorithmMethod::NormalizationAlgorithmMethod_LocalContrast;\n default:\n return armnnSerializer::NormalizationAlgorithmMethod::NormalizationAlgorithmMethod_LocalBrightness;\n }\n}\n\narmnnSerializer::ResizeMethod GetFlatBufferResizeMethod(armnn::ResizeMethod method)\n{\n switch (method)\n {\n case armnn::ResizeMethod::NearestNeighbor:\n return armnnSerializer::ResizeMethod_NearestNeighbor;\n case armnn::ResizeMethod::Bilinear:\n return armnnSerializer::ResizeMethod_Bilinear;\n default:\n return armnnSerializer::ResizeMethod_NearestNeighbor;\n }\n}\n\n} \/\/ namespace armnnSerializer\n<commit_msg>Bug fix on serialization of tensor with qsymm16 type<commit_after>\/\/\n\/\/ Copyright © 2017 Arm Ltd. All rights reserved.\n\/\/ SPDX-License-Identifier: MIT\n\/\/\n\n#include \"SerializerUtils.hpp\"\n\nnamespace armnnSerializer\n{\n\narmnnSerializer::ComparisonOperation GetFlatBufferComparisonOperation(armnn::ComparisonOperation comparisonOperation)\n{\n switch (comparisonOperation)\n {\n case armnn::ComparisonOperation::Equal:\n return armnnSerializer::ComparisonOperation::ComparisonOperation_Equal;\n case armnn::ComparisonOperation::Greater:\n return armnnSerializer::ComparisonOperation::ComparisonOperation_Greater;\n case armnn::ComparisonOperation::GreaterOrEqual:\n return armnnSerializer::ComparisonOperation::ComparisonOperation_GreaterOrEqual;\n case armnn::ComparisonOperation::Less:\n return armnnSerializer::ComparisonOperation::ComparisonOperation_Less;\n case armnn::ComparisonOperation::LessOrEqual:\n return armnnSerializer::ComparisonOperation::ComparisonOperation_LessOrEqual;\n case armnn::ComparisonOperation::NotEqual:\n default:\n return armnnSerializer::ComparisonOperation::ComparisonOperation_NotEqual;\n }\n}\n\narmnnSerializer::ConstTensorData GetFlatBufferConstTensorData(armnn::DataType dataType)\n{\n switch (dataType)\n {\n case armnn::DataType::Float32:\n case armnn::DataType::Signed32:\n return armnnSerializer::ConstTensorData::ConstTensorData_IntData;\n case armnn::DataType::Float16:\n case armnn::DataType::QuantisedSymm16:\n return armnnSerializer::ConstTensorData::ConstTensorData_ShortData;\n case armnn::DataType::QuantisedAsymm8:\n case armnn::DataType::Boolean:\n return armnnSerializer::ConstTensorData::ConstTensorData_ByteData;\n default:\n return armnnSerializer::ConstTensorData::ConstTensorData_NONE;\n }\n}\n\narmnnSerializer::DataType GetFlatBufferDataType(armnn::DataType dataType)\n{\n switch (dataType)\n {\n case armnn::DataType::Float32:\n return armnnSerializer::DataType::DataType_Float32;\n case armnn::DataType::Float16:\n return armnnSerializer::DataType::DataType_Float16;\n case armnn::DataType::Signed32:\n return armnnSerializer::DataType::DataType_Signed32;\n case armnn::DataType::QuantisedSymm16:\n return armnnSerializer::DataType::DataType_QuantisedSymm16;\n case armnn::DataType::QuantisedAsymm8:\n return armnnSerializer::DataType::DataType_QuantisedAsymm8;\n case armnn::DataType::Boolean:\n return armnnSerializer::DataType::DataType_Boolean;\n default:\n return armnnSerializer::DataType::DataType_Float16;\n }\n}\n\narmnnSerializer::DataLayout GetFlatBufferDataLayout(armnn::DataLayout dataLayout)\n{\n switch (dataLayout)\n {\n case armnn::DataLayout::NHWC:\n return armnnSerializer::DataLayout::DataLayout_NHWC;\n case armnn::DataLayout::NCHW:\n default:\n return armnnSerializer::DataLayout::DataLayout_NCHW;\n }\n}\n\narmnnSerializer::PoolingAlgorithm GetFlatBufferPoolingAlgorithm(armnn::PoolingAlgorithm poolingAlgorithm)\n{\n switch (poolingAlgorithm)\n {\n case armnn::PoolingAlgorithm::Average:\n return armnnSerializer::PoolingAlgorithm::PoolingAlgorithm_Average;\n case armnn::PoolingAlgorithm::L2:\n return armnnSerializer::PoolingAlgorithm::PoolingAlgorithm_L2;\n case armnn::PoolingAlgorithm::Max:\n default:\n return armnnSerializer::PoolingAlgorithm::PoolingAlgorithm_Max;\n }\n}\n\narmnnSerializer::OutputShapeRounding GetFlatBufferOutputShapeRounding(armnn::OutputShapeRounding outputShapeRounding)\n{\n switch (outputShapeRounding)\n {\n case armnn::OutputShapeRounding::Ceiling:\n return armnnSerializer::OutputShapeRounding::OutputShapeRounding_Ceiling;\n case armnn::OutputShapeRounding::Floor:\n default:\n return armnnSerializer::OutputShapeRounding::OutputShapeRounding_Floor;\n }\n}\n\narmnnSerializer::PaddingMethod GetFlatBufferPaddingMethod(armnn::PaddingMethod paddingMethod)\n{\n switch (paddingMethod)\n {\n case armnn::PaddingMethod::IgnoreValue:\n return armnnSerializer::PaddingMethod::PaddingMethod_IgnoreValue;\n case armnn::PaddingMethod::Exclude:\n default:\n return armnnSerializer::PaddingMethod::PaddingMethod_Exclude;\n }\n}\n\narmnnSerializer::NormalizationAlgorithmChannel GetFlatBufferNormalizationAlgorithmChannel(\n armnn::NormalizationAlgorithmChannel normalizationAlgorithmChannel)\n{\n switch (normalizationAlgorithmChannel)\n {\n case armnn::NormalizationAlgorithmChannel::Across:\n return armnnSerializer::NormalizationAlgorithmChannel::NormalizationAlgorithmChannel_Across;\n case armnn::NormalizationAlgorithmChannel::Within:\n return armnnSerializer::NormalizationAlgorithmChannel::NormalizationAlgorithmChannel_Within;\n default:\n return armnnSerializer::NormalizationAlgorithmChannel::NormalizationAlgorithmChannel_Across;\n }\n}\n\narmnnSerializer::NormalizationAlgorithmMethod GetFlatBufferNormalizationAlgorithmMethod(\n armnn::NormalizationAlgorithmMethod normalizationAlgorithmMethod)\n{\n switch (normalizationAlgorithmMethod)\n {\n case armnn::NormalizationAlgorithmMethod::LocalBrightness:\n return armnnSerializer::NormalizationAlgorithmMethod::NormalizationAlgorithmMethod_LocalBrightness;\n case armnn::NormalizationAlgorithmMethod::LocalContrast:\n return armnnSerializer::NormalizationAlgorithmMethod::NormalizationAlgorithmMethod_LocalContrast;\n default:\n return armnnSerializer::NormalizationAlgorithmMethod::NormalizationAlgorithmMethod_LocalBrightness;\n }\n}\n\narmnnSerializer::ResizeMethod GetFlatBufferResizeMethod(armnn::ResizeMethod method)\n{\n switch (method)\n {\n case armnn::ResizeMethod::NearestNeighbor:\n return armnnSerializer::ResizeMethod_NearestNeighbor;\n case armnn::ResizeMethod::Bilinear:\n return armnnSerializer::ResizeMethod_Bilinear;\n default:\n return armnnSerializer::ResizeMethod_NearestNeighbor;\n }\n}\n\n} \/\/ namespace armnnSerializer\n<|endoftext|>"} {"text":"<commit_before>\/\/..............................................................................\n\/\/\n\/\/ This file is part of the AXL library.\n\/\/\n\/\/ AXL is distributed under the MIT license.\n\/\/ For details see accompanying license.txt file,\n\/\/ the public copy of which is also available at:\n\/\/ http:\/\/tibbo.com\/downloads\/archive\/axl\/license.txt\n\/\/\n\/\/..............................................................................\n\n#include \"pch.h\"\n#include \"axl_enc_EscapeEncoding.h\"\n#include \"axl_enc_HexEncoding.h\"\n\nnamespace axl {\nnamespace enc {\n\n\/\/..............................................................................\n\nchar\nEscapeEncoding::findEscapeChar(char x)\n{\n\tswitch (x)\n\t{\n\tcase '\\0':\n\t\treturn '0';\n\n\tcase '\\a':\n\t\treturn 'a';\n\n\tcase '\\b':\n\t\treturn 'b';\n\n\tcase '\\t':\n\t\treturn 't';\n\n\tcase '\\n':\n\t\treturn 'n';\n\n\tcase '\\f':\n\t\treturn 'f';\n\n\tcase '\\v':\n\t\treturn 'v';\n\n\tcase '\\r':\n\t\treturn 'r';\n\n\tcase '\\x1b':\n\t\treturn 'e';\n\n\tdefault:\n\t\treturn x;\n\t};\n}\n\nchar\nEscapeEncoding::findEscapeReplaceChar(char x)\n{\n\tswitch (x)\n\t{\n\tcase '0':\n\t\treturn '\\0';\n\n\tcase 'a':\n\t\treturn '\\a';\n\n\tcase 'b':\n\t\treturn '\\b';\n\n\tcase 't':\n\t\treturn '\\t';\n\n\tcase 'n':\n\t\treturn '\\n';\n\n\tcase 'f':\n\t\treturn '\\f';\n\n\tcase 'v':\n\t\treturn '\\v';\n\n\tcase 'r':\n\t\treturn '\\r';\n\n\tcase 'e':\n\t\treturn '\\x1b';\n\n\tdefault:\n\t\treturn x;\n\t};\n}\n\nsize_t\nEscapeEncoding::encode(\n\tsl::String* string,\n\tconst sl::StringRef& source\n\t)\n{\n\tstring->clear();\n\tstring->reserve(source.getLength());\n\n\tchar escapeSequence[4] = { '\\\\' };\n\n\tconst char* p = source.cp();\n\tconst char* end = source.getEnd();\n\tconst char* base = p;\n\n\tfor (; p < end; p++)\n\t{\n\t\tif (*p == '\\\\')\n\t\t{\n\t\t\tstring->append(base, p - base);\n\n\t\t\tescapeSequence[1] = '\\\\';\n\t\t\tstring->append(escapeSequence, 2);\n\n\t\t\tbase = p + 1;\n\t\t}\n\t\telse\n\t\t{\n\t\t\tif (isprint(*p))\n\t\t\t\tcontinue;\n\n\t\t\tstring->append(base, p - base);\n\n\t\t\tchar escape = findEscapeChar(*p);\n\t\t\tif (escape != *p)\n\t\t\t{\n\t\t\t\tescapeSequence[1] = escape;\n\t\t\t\tstring->append(escapeSequence, 2);\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\tescapeSequence[1] = 'x';\n\t\t\t\tescapeSequence[2] = HexEncoding::getHexChar_l(*p >> 4);\n\t\t\t\tescapeSequence[3] = HexEncoding::getHexChar_l(*p);\n\t\t\t\tstring->append(escapeSequence, 4);\n\t\t\t}\n\n\t\t\tbase = p + 1;\n\t\t}\n\t}\n\n\tstring->append(base, p - base);\n\n\treturn string->getLength();\n}\n\nstatic\ninline\nbool\nisHexChar(char c)\n{\n\treturn\n\t\tc >= '0' && c <= '9' ||\n\t\tc >= 'a' && c <= 'f' ||\n\t\tc >= 'A' && c <= 'F';\n}\n\nsize_t\nEscapeEncoding::decode(\n\tsl::String* string,\n\tconst sl::StringRef& source\n\t)\n{\n\tenum State\n\t{\n\t\tState_Normal = 0,\n\t\tState_Escape,\n\t\tState_Hex,\n\t};\n\n\tState state = State_Normal;\n\n\tstring->clear();\n\tstring->reserve(source.getLength() \/ 2);\n\n\tchar hexCodeString[16];\n\tsize_t hexCodeLen;\n\tsize_t hexCodeMaxLen;\n\tulong_t hexCode;\n\n\tchar replace;\n\n\tconst char* p = source.cp();\n\tconst char* end = source.getEnd();\n\tconst char* base = p;\n\n\tfor (; p < end; p++)\n\t{\n\t\tswitch (state)\n\t\t{\n\t\tcase State_Normal:\n\t\t\tif (*p == '\\\\')\n\t\t\t{\n\t\t\t\tstring->append(base, p - base);\n\t\t\t\tstate = State_Escape;\n\t\t\t}\n\n\t\t\tbreak;\n\n\t\tcase State_Escape:\n\t\t\tswitch (*p)\n\t\t\t{\n\t\t\tcase 'x':\n\t\t\t\tstate = State_Hex;\n\t\t\t\thexCodeLen = 0;\n\t\t\t\thexCodeMaxLen = 2;\n\t\t\t\tbreak;\n\n\t\t\tcase 'u':\n\t\t\t\tstate = State_Hex;\n\t\t\t\thexCodeLen = 0;\n\t\t\t\thexCodeMaxLen = 4;\n\t\t\t\tbreak;\n\n\t\t\tcase 'U':\n\t\t\t\tstate = State_Hex;\n\t\t\t\thexCodeLen = 0;\n\t\t\t\thexCodeMaxLen = 8;\n\t\t\t\tbreak;\n\n\t\t\tdefault:\n\t\t\t\treplace = findEscapeReplaceChar(*p);\n\t\t\t\tif (replace != *p)\n\t\t\t\t{\n\t\t\t\t\tstring->append(replace, 1);\n\t\t\t\t\tbase = p + 1;\n\t\t\t\t}\n\t\t\t\telse\n\t\t\t\t{\n\t\t\t\t\tbase = p;\n\t\t\t\t}\n\n\t\t\t\tstate = State_Normal;\n\t\t\t}\n\n\t\t\tbreak;\n\n\t\tcase State_Hex:\n\t\t\tif (isHexChar(*p))\n\t\t\t{\n\t\t\t\thexCodeString[hexCodeLen++] = *p;\n\t\t\t\tif (hexCodeLen < hexCodeMaxLen)\n\t\t\t\t\tbreak;\n\n\t\t\t\tbase = p + 1;\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\tbase = p;\n\t\t\t}\n\n\t\t\tif (!hexCodeLen)\n\t\t\t{\n\t\t\t\thexCode = '?';\n\t\t\t\tstring->append((char const*) &hexCode, 1);\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\thexCodeString[hexCodeLen] = 0;\n\t\t\t\thexCode = strtoul(hexCodeString, NULL, 16);\n\n\t\t\t\tif (hexCodeMaxLen == 2) \/\/ \\x\n\t\t\t\t{\n\t\t\t\t\tstring->append((char const*) &hexCode, 1);\n\t\t\t\t}\n\t\t\t\telse \/\/ \\u\n\t\t\t\t{\n\t\t\t\t\tutf8_t buffer[8];\n\t\t\t\t\tsize_t length = enc::Utf8::getEncodeCodePointLength(hexCode);\n\t\t\t\t\tenc::Utf8::encodeCodePoint(buffer, hexCode);\n\t\t\t\t\tstring->append(buffer, length);\n\t\t\t\t}\n\t\t\t}\n\n\t\t\tstate = State_Normal;\n\t\t\tbreak;\n\t\t}\n\t}\n\n\tstring->append(base, p - base);\n\treturn string->getLength();\n}\n\n\/\/..............................................................................\n\n} \/\/ namespace enc\n} \/\/ namespace axl\n<commit_msg>[axl_enc] fix: prevent sign-expansion of a character before passing it to isprint()<commit_after>\/\/..............................................................................\n\/\/\n\/\/ This file is part of the AXL library.\n\/\/\n\/\/ AXL is distributed under the MIT license.\n\/\/ For details see accompanying license.txt file,\n\/\/ the public copy of which is also available at:\n\/\/ http:\/\/tibbo.com\/downloads\/archive\/axl\/license.txt\n\/\/\n\/\/..............................................................................\n\n#include \"pch.h\"\n#include \"axl_enc_EscapeEncoding.h\"\n#include \"axl_enc_HexEncoding.h\"\n\nnamespace axl {\nnamespace enc {\n\n\/\/..............................................................................\n\nchar\nEscapeEncoding::findEscapeChar(char x)\n{\n\tswitch (x)\n\t{\n\tcase '\\0':\n\t\treturn '0';\n\n\tcase '\\a':\n\t\treturn 'a';\n\n\tcase '\\b':\n\t\treturn 'b';\n\n\tcase '\\t':\n\t\treturn 't';\n\n\tcase '\\n':\n\t\treturn 'n';\n\n\tcase '\\f':\n\t\treturn 'f';\n\n\tcase '\\v':\n\t\treturn 'v';\n\n\tcase '\\r':\n\t\treturn 'r';\n\n\tcase '\\x1b':\n\t\treturn 'e';\n\n\tdefault:\n\t\treturn x;\n\t};\n}\n\nchar\nEscapeEncoding::findEscapeReplaceChar(char x)\n{\n\tswitch (x)\n\t{\n\tcase '0':\n\t\treturn '\\0';\n\n\tcase 'a':\n\t\treturn '\\a';\n\n\tcase 'b':\n\t\treturn '\\b';\n\n\tcase 't':\n\t\treturn '\\t';\n\n\tcase 'n':\n\t\treturn '\\n';\n\n\tcase 'f':\n\t\treturn '\\f';\n\n\tcase 'v':\n\t\treturn '\\v';\n\n\tcase 'r':\n\t\treturn '\\r';\n\n\tcase 'e':\n\t\treturn '\\x1b';\n\n\tdefault:\n\t\treturn x;\n\t};\n}\n\nsize_t\nEscapeEncoding::encode(\n\tsl::String* string,\n\tconst sl::StringRef& source\n\t)\n{\n\tstring->clear();\n\tstring->reserve(source.getLength());\n\n\tchar escapeSequence[4] = { '\\\\' };\n\n\tconst char* p = source.cp();\n\tconst char* end = source.getEnd();\n\tconst char* base = p;\n\n\tfor (; p < end; p++)\n\t{\n\t\tif (*p == '\\\\')\n\t\t{\n\t\t\tstring->append(base, p - base);\n\n\t\t\tescapeSequence[1] = '\\\\';\n\t\t\tstring->append(escapeSequence, 2);\n\n\t\t\tbase = p + 1;\n\t\t}\n\t\telse\n\t\t{\n\t\t\tif (isprint(*(uchar_t*)p))\n\t\t\t\tcontinue;\n\n\t\t\tstring->append(base, p - base);\n\n\t\t\tchar escape = findEscapeChar(*p);\n\t\t\tif (escape != *p)\n\t\t\t{\n\t\t\t\tescapeSequence[1] = escape;\n\t\t\t\tstring->append(escapeSequence, 2);\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\tescapeSequence[1] = 'x';\n\t\t\t\tescapeSequence[2] = HexEncoding::getHexChar_l(*p >> 4);\n\t\t\t\tescapeSequence[3] = HexEncoding::getHexChar_l(*p);\n\t\t\t\tstring->append(escapeSequence, 4);\n\t\t\t}\n\n\t\t\tbase = p + 1;\n\t\t}\n\t}\n\n\tstring->append(base, p - base);\n\n\treturn string->getLength();\n}\n\nstatic\ninline\nbool\nisHexChar(char c)\n{\n\treturn\n\t\tc >= '0' && c <= '9' ||\n\t\tc >= 'a' && c <= 'f' ||\n\t\tc >= 'A' && c <= 'F';\n}\n\nsize_t\nEscapeEncoding::decode(\n\tsl::String* string,\n\tconst sl::StringRef& source\n\t)\n{\n\tenum State\n\t{\n\t\tState_Normal = 0,\n\t\tState_Escape,\n\t\tState_Hex,\n\t};\n\n\tState state = State_Normal;\n\n\tstring->clear();\n\tstring->reserve(source.getLength() \/ 2);\n\n\tchar hexCodeString[16];\n\tsize_t hexCodeLen;\n\tsize_t hexCodeMaxLen;\n\tulong_t hexCode;\n\n\tchar replace;\n\n\tconst char* p = source.cp();\n\tconst char* end = source.getEnd();\n\tconst char* base = p;\n\n\tfor (; p < end; p++)\n\t{\n\t\tswitch (state)\n\t\t{\n\t\tcase State_Normal:\n\t\t\tif (*p == '\\\\')\n\t\t\t{\n\t\t\t\tstring->append(base, p - base);\n\t\t\t\tstate = State_Escape;\n\t\t\t}\n\n\t\t\tbreak;\n\n\t\tcase State_Escape:\n\t\t\tswitch (*p)\n\t\t\t{\n\t\t\tcase 'x':\n\t\t\t\tstate = State_Hex;\n\t\t\t\thexCodeLen = 0;\n\t\t\t\thexCodeMaxLen = 2;\n\t\t\t\tbreak;\n\n\t\t\tcase 'u':\n\t\t\t\tstate = State_Hex;\n\t\t\t\thexCodeLen = 0;\n\t\t\t\thexCodeMaxLen = 4;\n\t\t\t\tbreak;\n\n\t\t\tcase 'U':\n\t\t\t\tstate = State_Hex;\n\t\t\t\thexCodeLen = 0;\n\t\t\t\thexCodeMaxLen = 8;\n\t\t\t\tbreak;\n\n\t\t\tdefault:\n\t\t\t\treplace = findEscapeReplaceChar(*p);\n\t\t\t\tif (replace != *p)\n\t\t\t\t{\n\t\t\t\t\tstring->append(replace, 1);\n\t\t\t\t\tbase = p + 1;\n\t\t\t\t}\n\t\t\t\telse\n\t\t\t\t{\n\t\t\t\t\tbase = p;\n\t\t\t\t}\n\n\t\t\t\tstate = State_Normal;\n\t\t\t}\n\n\t\t\tbreak;\n\n\t\tcase State_Hex:\n\t\t\tif (isHexChar(*p))\n\t\t\t{\n\t\t\t\thexCodeString[hexCodeLen++] = *p;\n\t\t\t\tif (hexCodeLen < hexCodeMaxLen)\n\t\t\t\t\tbreak;\n\n\t\t\t\tbase = p + 1;\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\tbase = p;\n\t\t\t}\n\n\t\t\tif (!hexCodeLen)\n\t\t\t{\n\t\t\t\thexCode = '?';\n\t\t\t\tstring->append((char const*) &hexCode, 1);\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\thexCodeString[hexCodeLen] = 0;\n\t\t\t\thexCode = strtoul(hexCodeString, NULL, 16);\n\n\t\t\t\tif (hexCodeMaxLen == 2) \/\/ \\x\n\t\t\t\t{\n\t\t\t\t\tstring->append((char const*) &hexCode, 1);\n\t\t\t\t}\n\t\t\t\telse \/\/ \\u\n\t\t\t\t{\n\t\t\t\t\tutf8_t buffer[8];\n\t\t\t\t\tsize_t length = enc::Utf8::getEncodeCodePointLength(hexCode);\n\t\t\t\t\tenc::Utf8::encodeCodePoint(buffer, hexCode);\n\t\t\t\t\tstring->append(buffer, length);\n\t\t\t\t}\n\t\t\t}\n\n\t\t\tstate = State_Normal;\n\t\t\tbreak;\n\t\t}\n\t}\n\n\tstring->append(base, p - base);\n\treturn string->getLength();\n}\n\n\/\/..............................................................................\n\n} \/\/ namespace enc\n} \/\/ namespace axl\n<|endoftext|>"} {"text":"<commit_before>\/\/ Copyright (c) 2012 The Chromium Authors. All rights reserved.\n\/\/ Use of this source code is governed by a BSD-style license that can be\n\/\/ found in the LICENSE file.\n\n#include \"base\/command_line.h\"\n#include \"base\/prefs\/pref_service.h\"\n#include \"base\/strings\/utf_string_conversions.h\"\n#include \"chrome\/app\/chrome_command_ids.h\"\n#include \"chrome\/browser\/content_settings\/host_content_settings_map.h\"\n#include \"chrome\/browser\/profiles\/profile.h\"\n#include \"chrome\/browser\/ui\/browser.h\"\n#include \"chrome\/browser\/ui\/browser_commands.h\"\n#include \"chrome\/browser\/ui\/tabs\/tab_strip_model.h\"\n#include \"chrome\/common\/chrome_switches.h\"\n#include \"chrome\/common\/pref_names.h\"\n#include \"chrome\/common\/url_constants.h\"\n#include \"chrome\/test\/base\/in_process_browser_test.h\"\n#include \"chrome\/test\/base\/ui_test_utils.h\"\n#include \"content\/public\/browser\/web_contents_observer.h\"\n#include \"content\/public\/test\/browser_test_utils.h\"\n#include \"content\/public\/test\/test_navigation_observer.h\"\n#include \"content\/public\/test\/test_utils.h\"\n\n#if defined(OS_WIN) && defined(USE_AURA)\n#include \"content\/public\/browser\/web_contents_view.h\"\n#include \"ui\/aura\/root_window.h\"\n#endif\n\nnamespace {\n\nclass PrintPreviewTest : public InProcessBrowserTest {\n public:\n PrintPreviewTest() {}\n\n#if !defined(GOOGLE_CHROME_BUILD)\n virtual void SetUpCommandLine(CommandLine* command_line) OVERRIDE {\n command_line->AppendSwitch(switches::kEnablePrintPreview);\n }\n#endif\n\n void Print() {\n content::TestNavigationObserver nav_observer(NULL);\n nav_observer.StartWatchingNewWebContents();\n chrome::ExecuteCommand(browser(), IDC_PRINT);\n nav_observer.Wait();\n nav_observer.StopWatchingNewWebContents();\n }\n};\n\nIN_PROC_BROWSER_TEST_F(PrintPreviewTest, PrintCommands) {\n \/\/ We start off at about:blank page.\n \/\/ Make sure there is 1 tab and print is enabled.\n ASSERT_EQ(1, browser()->tab_strip_model()->count());\n\n ASSERT_TRUE(chrome::IsCommandEnabled(browser(), IDC_PRINT));\n\n \/\/ Make sure advanced print command (Ctrl+Shift+p) is enabled.\n ASSERT_TRUE(chrome::IsCommandEnabled(browser(), IDC_ADVANCED_PRINT));\n\n \/\/ Create the print preview dialog.\n Print();\n\n \/\/ Make sure print is disabled.\n ASSERT_FALSE(chrome::IsCommandEnabled(browser(), IDC_PRINT));\n\n \/\/ Make sure advanced print command (Ctrl+Shift+p) is enabled.\n ASSERT_TRUE(chrome::IsCommandEnabled(browser(), IDC_ADVANCED_PRINT));\n\n content::TestNavigationObserver reload_observer(\n browser()->tab_strip_model()->GetActiveWebContents());\n chrome::Reload(browser(), CURRENT_TAB);\n reload_observer.Wait();\n\n ASSERT_TRUE(chrome::IsCommandEnabled(browser(), IDC_PRINT));\n\n \/\/ Make sure advanced print command (Ctrl+Shift+p) is enabled.\n ASSERT_TRUE(chrome::IsCommandEnabled(browser(), IDC_ADVANCED_PRINT));\n}\n\n#if defined(OS_WIN) && defined(USE_AURA)\n\nBOOL CALLBACK EnumerateChildren(HWND hwnd, LPARAM l_param) {\n HWND* child = reinterpret_cast<HWND*>(l_param);\n *child = hwnd;\n \/\/ The first child window is the plugin, then its children. So stop\n \/\/ enumerating after the first callback.\n return FALSE;\n}\n\n\/\/ This test verifies that constrained windows aren't covered by windowed NPAPI\n\/\/ plugins. The code which fixes this is in WebContentsViewAura::WindowObserver.\nIN_PROC_BROWSER_TEST_F(PrintPreviewTest, WindowedNPAPIPluginHidden) {\n browser()->profile()->GetPrefs()->SetBoolean(prefs::kPluginsAlwaysAuthorize,\n true);\n\n \/\/ First load the page and wait for the NPAPI plugin's window to display.\n string16 expected_title(ASCIIToUTF16(\"ready\"));\n content::WebContents* tab =\n browser()->tab_strip_model()->GetActiveWebContents();\n content::TitleWatcher title_watcher(tab, expected_title);\n\n GURL url = ui_test_utils::GetTestUrl(\n base::FilePath().AppendASCII(\"printing\"),\n base::FilePath().AppendASCII(\"npapi_plugin.html\"));\n ui_test_utils::NavigateToURL(browser(), url);\n\n EXPECT_EQ(expected_title, title_watcher.WaitAndGetTitle());\n\n \/\/ Now get the region of the plugin before and after the print preview is\n \/\/ shown. They should be different.\n HWND hwnd =\n tab->GetView()->GetNativeView()->GetDispatcher()->GetAcceleratedWidget();\n HWND child = NULL;\n EnumChildWindows(hwnd, EnumerateChildren,reinterpret_cast<LPARAM>(&child));\n\n RECT region_before, region_after;\n int result = GetWindowRgnBox(child, ®ion_before);\n ASSERT_EQ(result, SIMPLEREGION);\n\n \/\/ Now print preview.\n Print();\n\n result = GetWindowRgnBox(child, ®ion_after);\n if (result == NULLREGION) {\n \/\/ Depending on the browser window size, the plugin could be full covered.\n return;\n }\n\n if (result == COMPLEXREGION) {\n \/\/ Complex region, by definition not equal to the initial region.\n return;\n }\n\n ASSERT_EQ(result, SIMPLEREGION);\n bool rects_equal =\n region_before.left == region_after.left &&\n region_before.top == region_after.top &&\n region_before.right == region_after.right &&\n region_before.bottom == region_after.bottom;\n ASSERT_FALSE(rects_equal);\n}\n#endif\n\n} \/\/ namespace\n<commit_msg>fix build bustage<commit_after>\/\/ Copyright (c) 2012 The Chromium Authors. All rights reserved.\n\/\/ Use of this source code is governed by a BSD-style license that can be\n\/\/ found in the LICENSE file.\n\n#include \"base\/command_line.h\"\n#include \"base\/prefs\/pref_service.h\"\n#include \"base\/strings\/utf_string_conversions.h\"\n#include \"chrome\/app\/chrome_command_ids.h\"\n#include \"chrome\/browser\/content_settings\/host_content_settings_map.h\"\n#include \"chrome\/browser\/profiles\/profile.h\"\n#include \"chrome\/browser\/ui\/browser.h\"\n#include \"chrome\/browser\/ui\/browser_commands.h\"\n#include \"chrome\/browser\/ui\/tabs\/tab_strip_model.h\"\n#include \"chrome\/common\/chrome_switches.h\"\n#include \"chrome\/common\/pref_names.h\"\n#include \"chrome\/common\/url_constants.h\"\n#include \"chrome\/test\/base\/in_process_browser_test.h\"\n#include \"chrome\/test\/base\/ui_test_utils.h\"\n#include \"content\/public\/browser\/web_contents.h\"\n#include \"content\/public\/browser\/web_contents_observer.h\"\n#include \"content\/public\/test\/browser_test_utils.h\"\n#include \"content\/public\/test\/test_navigation_observer.h\"\n#include \"content\/public\/test\/test_utils.h\"\n\n#if defined(OS_WIN) && defined(USE_AURA)\n#include \"content\/public\/browser\/web_contents_view.h\"\n#include \"ui\/aura\/root_window.h\"\n#endif\n\nnamespace {\n\nclass PrintPreviewTest : public InProcessBrowserTest {\n public:\n PrintPreviewTest() {}\n\n#if !defined(GOOGLE_CHROME_BUILD)\n virtual void SetUpCommandLine(CommandLine* command_line) OVERRIDE {\n command_line->AppendSwitch(switches::kEnablePrintPreview);\n }\n#endif\n\n void Print() {\n content::TestNavigationObserver nav_observer(NULL);\n nav_observer.StartWatchingNewWebContents();\n chrome::ExecuteCommand(browser(), IDC_PRINT);\n nav_observer.Wait();\n nav_observer.StopWatchingNewWebContents();\n }\n};\n\nIN_PROC_BROWSER_TEST_F(PrintPreviewTest, PrintCommands) {\n \/\/ We start off at about:blank page.\n \/\/ Make sure there is 1 tab and print is enabled.\n ASSERT_EQ(1, browser()->tab_strip_model()->count());\n\n ASSERT_TRUE(chrome::IsCommandEnabled(browser(), IDC_PRINT));\n\n \/\/ Make sure advanced print command (Ctrl+Shift+p) is enabled.\n ASSERT_TRUE(chrome::IsCommandEnabled(browser(), IDC_ADVANCED_PRINT));\n\n \/\/ Create the print preview dialog.\n Print();\n\n \/\/ Make sure print is disabled.\n ASSERT_FALSE(chrome::IsCommandEnabled(browser(), IDC_PRINT));\n\n \/\/ Make sure advanced print command (Ctrl+Shift+p) is enabled.\n ASSERT_TRUE(chrome::IsCommandEnabled(browser(), IDC_ADVANCED_PRINT));\n\n content::TestNavigationObserver reload_observer(\n browser()->tab_strip_model()->GetActiveWebContents());\n chrome::Reload(browser(), CURRENT_TAB);\n reload_observer.Wait();\n\n ASSERT_TRUE(chrome::IsCommandEnabled(browser(), IDC_PRINT));\n\n \/\/ Make sure advanced print command (Ctrl+Shift+p) is enabled.\n ASSERT_TRUE(chrome::IsCommandEnabled(browser(), IDC_ADVANCED_PRINT));\n}\n\n#if defined(OS_WIN) && defined(USE_AURA)\n\nBOOL CALLBACK EnumerateChildren(HWND hwnd, LPARAM l_param) {\n HWND* child = reinterpret_cast<HWND*>(l_param);\n *child = hwnd;\n \/\/ The first child window is the plugin, then its children. So stop\n \/\/ enumerating after the first callback.\n return FALSE;\n}\n\n\/\/ This test verifies that constrained windows aren't covered by windowed NPAPI\n\/\/ plugins. The code which fixes this is in WebContentsViewAura::WindowObserver.\nIN_PROC_BROWSER_TEST_F(PrintPreviewTest, WindowedNPAPIPluginHidden) {\n browser()->profile()->GetPrefs()->SetBoolean(prefs::kPluginsAlwaysAuthorize,\n true);\n\n \/\/ First load the page and wait for the NPAPI plugin's window to display.\n string16 expected_title(ASCIIToUTF16(\"ready\"));\n content::WebContents* tab =\n browser()->tab_strip_model()->GetActiveWebContents();\n content::TitleWatcher title_watcher(tab, expected_title);\n\n GURL url = ui_test_utils::GetTestUrl(\n base::FilePath().AppendASCII(\"printing\"),\n base::FilePath().AppendASCII(\"npapi_plugin.html\"));\n ui_test_utils::NavigateToURL(browser(), url);\n\n EXPECT_EQ(expected_title, title_watcher.WaitAndGetTitle());\n\n \/\/ Now get the region of the plugin before and after the print preview is\n \/\/ shown. They should be different.\n HWND hwnd =\n tab->GetView()->GetNativeView()->GetDispatcher()->GetAcceleratedWidget();\n HWND child = NULL;\n EnumChildWindows(hwnd, EnumerateChildren,reinterpret_cast<LPARAM>(&child));\n\n RECT region_before, region_after;\n int result = GetWindowRgnBox(child, ®ion_before);\n ASSERT_EQ(result, SIMPLEREGION);\n\n \/\/ Now print preview.\n Print();\n\n result = GetWindowRgnBox(child, ®ion_after);\n if (result == NULLREGION) {\n \/\/ Depending on the browser window size, the plugin could be full covered.\n return;\n }\n\n if (result == COMPLEXREGION) {\n \/\/ Complex region, by definition not equal to the initial region.\n return;\n }\n\n ASSERT_EQ(result, SIMPLEREGION);\n bool rects_equal =\n region_before.left == region_after.left &&\n region_before.top == region_after.top &&\n region_before.right == region_after.right &&\n region_before.bottom == region_after.bottom;\n ASSERT_FALSE(rects_equal);\n}\n#endif\n\n} \/\/ namespace\n<|endoftext|>"} {"text":"<commit_before>\/**************************************************************************\n\n The MIT License (MIT)\n\n Copyright (c) 2015 Dmitry Sovetov\n\n https:\/\/github.com\/dmsovetov\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 The above copyright notice and this permission notice shall be included in all\n copies or substantial portions of the Software.\n THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\n IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\n FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE\n AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\n LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,\n OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE\n SOFTWARE.\n\n **************************************************************************\/\n\n#include \"Composer.h\"\n\n#include \"FileSystem.h\"\n\n#include \"Widgets\/Menu.h\"\n#include \"Widgets\/MainWindow.h\"\n#include \"Widgets\/AssetTree.h\"\n\n#include \"Project\/Project.h\"\n\nDC_BEGIN_COMPOSER\n\nnamespace Editors {\n\n\/\/ --------------------------------------------------------------- SceneEditorInternal -------------------------------------------------------------- \/\/\n\n\/\/ ** SceneEditorInternal::SceneEditorInternal\nSceneEditorInternal::SceneEditorInternal( Scene::SceneObjectWPtr parent, u8 flags ) : m_parent( parent ), m_flags( flags )\n{\n\n}\n\n\/\/ ** SceneEditorInternal::parent\nScene::SceneObjectWPtr SceneEditorInternal::parent( void ) const\n{\n\treturn m_parent;\n}\n\n\/\/ ** SceneEditorInternal::isPrivate\nbool SceneEditorInternal::isPrivate( void ) const\n{\n\treturn m_flags.is( Private );\n}\n\n\/\/ ** SceneEditorInternal::isHighlighted\nbool SceneEditorInternal::isHighlighted( void ) const\n{\n\treturn m_flags.is( Highlighted );\n}\n\n\/\/ ** SceneEditorInternal::setHighlighted\nvoid SceneEditorInternal::setHighlighted( bool value )\n{\n\tm_flags.set( Highlighted, value );\n}\n\n\/\/ ** SceneEditorInternal::isSelected\nbool SceneEditorInternal::isSelected( void ) const\n{\n\treturn m_flags.is( Selected );\n}\n\n\/\/ ** SceneEditorInternal::setSelected\nvoid SceneEditorInternal::setSelected( bool value )\n{\n\tm_flags.set( Selected, value );\n}\n\n\n} \/\/ namespace Editors\n\n\/\/ -------------------------------------------------------------------- Composer -------------------------------------------------------------------- \/\/\n\n\/\/ ** Composer::kAssetMime\nconst String Composer::kAssetMime = \"text\/uri-list\";\n\n\/\/ ** Composer::Composer\nComposer::Composer( int argc, char ** argv ) : QApplication( argc, argv ), m_project( NULL )\n{\n \/\/ Setup default logger\n Logger::setStandardLogger();\n\n \/\/ Set application name\n setApplicationName( \"Dreemchest Composer\" );\n\n \/\/ Create the main window\n m_mainWindow = new Ui::MainWindow( applicationName() );\n\n \/\/ Create the file system\n\tm_fileSystem = new FileSystem( this );\n\n \/\/ Setup default log handlers\n\tLogger::setStandardLogger();\n}\n\n\/\/ ** Composer::project\nProjectQPtr Composer::project( void ) const\n{\n\treturn m_project;\n}\n\n\/\/ ** Composer::window\nUi::MainWindowQPtr Composer::window( void ) const\n{\n\treturn m_mainWindow;\n}\n\n\/\/ ** Composer::fileSystem\nFileSystemQPtr Composer::fileSystem( void ) const\n{\n\treturn m_fileSystem;\n}\n\n\/\/ ** Composer::initialize\nbool Composer::initialize( void )\n{\n\t\/\/ Initialize the main window\n\tif( !m_mainWindow->initialize( this ) ) {\n\t\treturn false;\n\t}\n\n\t\/\/ Add default menues\n\tm_menues[FileMenu] = m_mainWindow->addMenu( \"&File\" );\n\tm_menues[EditMenu] = m_mainWindow->addMenu( \"&Edit\" );\n\n\t\/\/ Add actions\n\tUi::ActionQPtr create\t= m_menues[FileMenu]->addAction( \"&Create Project\", BindAction( Composer::menuCreateProject ), \"Ctrl+N\", \":Common\/Common\/new.png\" );\n\tUi::ActionQPtr open\t= m_menues[FileMenu]->addAction( \"&Open Project\", BindAction( Composer::menuOpenProject ), \"Ctrl+O\", \":Common\/Common\/open.png\" );\n\tUi::ActionQPtr save\t= m_menues[FileMenu]->addAction( \"&Save Project\", BindAction( Composer::menuSaveProject ), \"Ctrl+S\", \":Common\/Common\/save.png\" );\n\n\t\/\/ Add actions\n\tUi::ActionQPtr undo\t= m_menues[EditMenu]->addAction( \"&Undo\", BindAction( Composer::menuUndo ), \"Ctrl+Z\", \":Common\/Common\/undo.png\" );\n\tUi::ActionQPtr redo\t= m_menues[EditMenu]->addAction( \"&Redo\", BindAction( Composer::menuRedo ), \"Ctrl+Y\", \":Common\/Common\/redo.png\" );\n\n\t\/\/ Create tool bars\n\tUi::ToolBarQPtr tools = m_mainWindow->addToolBar();\n\ttools->addAction( create );\n\ttools->addAction( open );\n\ttools->addAction( save );\n\ttools->addSeparator();\n\ttools->addAction( undo );\n\ttools->addAction( redo );\n\n\treturn true;\n}\n\n\/\/ ** Composer::menuCreateProject\nvoid Composer::menuCreateProject( Ui::ActionQPtr action )\n{\n\t\/\/ Select the directory\n\tString path = m_fileSystem->selectExistingDirectory( \"Create Project\" );\n\n\tif( path == \"\" ) {\n\t\treturn;\n\t}\n\n\tcreateProject( path );\n}\n\n\/\/ ** Composer::menuOpenProject\nvoid Composer::menuOpenProject( Ui::ActionQPtr action )\n{\n\t\/\/ Select the directory\n\tString path = m_fileSystem->selectExistingDirectory( \"Open Project\" );\n\n\tif( path == \"\" ) {\n\t\treturn;\n\t}\n\n\topenProject( path );\n}\n\n\/\/ ** Composer::menuSaveProject\nvoid Composer::menuSaveProject( Ui::ActionQPtr action )\n{\n\tif( Ui::DocumentQPtr document = m_mainWindow->activeDocument() ) {\n document->assetEditor()->save();\n }\n}\n\n\/\/ ** Composer::menuUndo\nvoid Composer::menuUndo( Ui::ActionQPtr action )\n{\n\tm_mainWindow->message( \"Not implemented yet.\", Ui::MessageWarning );\n}\n\n\/\/ ** Composer::menuRedo\nvoid Composer::menuRedo( Ui::ActionQPtr action )\n{\n\tm_mainWindow->message( \"Not implemented yet.\", Ui::MessageWarning );\n}\n\n\/\/ ** Composer::createProject\nvoid Composer::createProject( const String& path )\n{\n \/\/ Close active project\n closeProject();\n\n\t\/\/ Create project instance\n\tm_project = new Project( this, path );\n\n\t\/\/ Create all project folders\n\tfor( s32 i = 0; i < Project::TotalPaths; i++ ) {\n\t\tm_fileSystem->createDirectory( m_project->absolutePath( i ) );\n\t}\n\n\t\/\/ Emit the signal\n emit projectCreated( m_project );\n\n\t\/\/ Open created project\n\topenProject( path );\n}\n\n\/\/ ** Composer::closeProject\nvoid Composer::closeProject( void )\n{\n \/\/ No project opened\n if( !m_project ) {\n return;\n }\n\n \/\/ Emit the signal\n emit projectClosed( m_project );\n\n \/\/ Destroy project\n delete m_project;\n m_project = NULL;\n}\n\n\/\/ ** Composer::assetFromMime\nAssets::Handle Composer::assetFromMime( MimeDataQPtr mime ) const\n{\n\tAssets::AssetSet assets = assetsFromMime( mime );\n\n\tif( assets.empty() ) {\n\t\treturn Assets::Handle();\n\t}\n\n\treturn *assets.begin();\n}\n\n\/\/ ** Composer::assetsFromMime\nAssets::AssetSet Composer::assetsFromMime( MimeDataQPtr mime ) const\n{\n\t\/\/ Resulting asset set\n\tAssets::AssetSet result;\n\n\t\/\/ Get an array of attached assets\n\tQList<QUrl> assets = mime->urls();\n\n\t\/\/ Add assets to scene\n\tforeach( QUrl url, assets ) {\n\t\t\/\/ Read an attached meta data\n\t\tArchive meta = m_project->assetFileSystem()->metaData( url.toLocalFile().toStdString() );\n\n if( !meta.isValid() ) {\n\t\t\tcontinue;\t\/\/ Unsupported asset type or just a folder\n\t\t}\n\n DC_ABORT_IF( !meta.type()->is<KeyValue>(), \"asset meta data expected to be a KeyValue type\" );\n\n\t\t\/\/ Find asset by UUID.\n String uuid = meta.as<KeyValue>().get<String>( \"uuid\" );\n\n\t\tAssets::Handle asset = m_project->assets().findAsset( uuid );\n\t\tDC_BREAK_IF( !asset.isValid() );\n\n\t\t\/\/ Add to set.\n\t\tresult.insert( asset );\n\t}\n\n\treturn result;\n}\n\n\/\/ ** Composer::openProject\nvoid Composer::openProject( const String& path )\n{\n \/\/ Close active project\n closeProject();\n\n\t\/\/ Create project instance\n\tm_project = new Project( this, path );\n\n\t\/\/ Emit the signal\n emit projectOpened( m_project );\n\n\t\/\/ Setup menues\n\t\/\/m_menues[EditMenu]\t = m_mainWindow->addMenu( \"&Edit\" );\n\tm_menues[ViewMenu]\t = m_mainWindow->addMenu( \"&View\" );\n\tm_menues[AssetsMenu] = m_mainWindow->addMenu( \"&Assets\" );\n\n\t\/\/ Fill assets menu\n\tm_project->fillAssetMenu( m_menues[AssetsMenu] );\n}\n\nDC_END_COMPOSER\n\n\/\/ ** main\nint main(int argc, char *argv[])\n{\n\tQCoreApplication::setLibraryPaths( QCoreApplication::libraryPaths() << \".\" << \"imageformats\" << \"platforms\" );\n\n Composer app( argc, argv );\n\n if( !app.initialize() ) {\n return -1;\n }\n \n \/\/ Open the project\n\tapp.openProject( \"~TestProject\" );\n\n return app.exec();\n}<commit_msg>Modified: default composer locale<commit_after>\/**************************************************************************\n\n The MIT License (MIT)\n\n Copyright (c) 2015 Dmitry Sovetov\n\n https:\/\/github.com\/dmsovetov\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 The above copyright notice and this permission notice shall be included in all\n copies or substantial portions of the Software.\n THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\n IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\n FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE\n AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\n LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,\n OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE\n SOFTWARE.\n\n **************************************************************************\/\n\n#include \"Composer.h\"\n\n#include \"FileSystem.h\"\n\n#include \"Widgets\/Menu.h\"\n#include \"Widgets\/MainWindow.h\"\n#include \"Widgets\/AssetTree.h\"\n\n#include \"Project\/Project.h\"\n\nDC_BEGIN_COMPOSER\n\nnamespace Editors {\n\n\/\/ --------------------------------------------------------------- SceneEditorInternal -------------------------------------------------------------- \/\/\n\n\/\/ ** SceneEditorInternal::SceneEditorInternal\nSceneEditorInternal::SceneEditorInternal( Scene::SceneObjectWPtr parent, u8 flags ) : m_parent( parent ), m_flags( flags )\n{\n\n}\n\n\/\/ ** SceneEditorInternal::parent\nScene::SceneObjectWPtr SceneEditorInternal::parent( void ) const\n{\n\treturn m_parent;\n}\n\n\/\/ ** SceneEditorInternal::isPrivate\nbool SceneEditorInternal::isPrivate( void ) const\n{\n\treturn m_flags.is( Private );\n}\n\n\/\/ ** SceneEditorInternal::isHighlighted\nbool SceneEditorInternal::isHighlighted( void ) const\n{\n\treturn m_flags.is( Highlighted );\n}\n\n\/\/ ** SceneEditorInternal::setHighlighted\nvoid SceneEditorInternal::setHighlighted( bool value )\n{\n\tm_flags.set( Highlighted, value );\n}\n\n\/\/ ** SceneEditorInternal::isSelected\nbool SceneEditorInternal::isSelected( void ) const\n{\n\treturn m_flags.is( Selected );\n}\n\n\/\/ ** SceneEditorInternal::setSelected\nvoid SceneEditorInternal::setSelected( bool value )\n{\n\tm_flags.set( Selected, value );\n}\n\n\n} \/\/ namespace Editors\n\n\/\/ -------------------------------------------------------------------- Composer -------------------------------------------------------------------- \/\/\n\n\/\/ ** Composer::kAssetMime\nconst String Composer::kAssetMime = \"text\/uri-list\";\n\n\/\/ ** Composer::Composer\nComposer::Composer( int argc, char ** argv ) : QApplication( argc, argv ), m_project( NULL )\n{\n \/\/ Setup default logger\n Logger::setStandardLogger();\n\n \/\/ Set application name\n setApplicationName( \"Dreemchest Composer\" );\n\n \/\/ Create the main window\n m_mainWindow = new Ui::MainWindow( applicationName() );\n\n \/\/ Create the file system\n\tm_fileSystem = new FileSystem( this );\n\n \/\/ Setup default log handlers\n\tLogger::setStandardLogger();\n}\n\n\/\/ ** Composer::project\nProjectQPtr Composer::project( void ) const\n{\n\treturn m_project;\n}\n\n\/\/ ** Composer::window\nUi::MainWindowQPtr Composer::window( void ) const\n{\n\treturn m_mainWindow;\n}\n\n\/\/ ** Composer::fileSystem\nFileSystemQPtr Composer::fileSystem( void ) const\n{\n\treturn m_fileSystem;\n}\n\n\/\/ ** Composer::initialize\nbool Composer::initialize( void )\n{\n\t\/\/ Initialize the main window\n\tif( !m_mainWindow->initialize( this ) ) {\n\t\treturn false;\n\t}\n\n\t\/\/ Add default menues\n\tm_menues[FileMenu] = m_mainWindow->addMenu( \"&File\" );\n\tm_menues[EditMenu] = m_mainWindow->addMenu( \"&Edit\" );\n\n\t\/\/ Add actions\n\tUi::ActionQPtr create\t= m_menues[FileMenu]->addAction( \"&Create Project\", BindAction( Composer::menuCreateProject ), \"Ctrl+N\", \":Common\/Common\/new.png\" );\n\tUi::ActionQPtr open\t= m_menues[FileMenu]->addAction( \"&Open Project\", BindAction( Composer::menuOpenProject ), \"Ctrl+O\", \":Common\/Common\/open.png\" );\n\tUi::ActionQPtr save\t= m_menues[FileMenu]->addAction( \"&Save Project\", BindAction( Composer::menuSaveProject ), \"Ctrl+S\", \":Common\/Common\/save.png\" );\n\n\t\/\/ Add actions\n\tUi::ActionQPtr undo\t= m_menues[EditMenu]->addAction( \"&Undo\", BindAction( Composer::menuUndo ), \"Ctrl+Z\", \":Common\/Common\/undo.png\" );\n\tUi::ActionQPtr redo\t= m_menues[EditMenu]->addAction( \"&Redo\", BindAction( Composer::menuRedo ), \"Ctrl+Y\", \":Common\/Common\/redo.png\" );\n\n\t\/\/ Create tool bars\n\tUi::ToolBarQPtr tools = m_mainWindow->addToolBar();\n\ttools->addAction( create );\n\ttools->addAction( open );\n\ttools->addAction( save );\n\ttools->addSeparator();\n\ttools->addAction( undo );\n\ttools->addAction( redo );\n\n\treturn true;\n}\n\n\/\/ ** Composer::menuCreateProject\nvoid Composer::menuCreateProject( Ui::ActionQPtr action )\n{\n\t\/\/ Select the directory\n\tString path = m_fileSystem->selectExistingDirectory( \"Create Project\" );\n\n\tif( path == \"\" ) {\n\t\treturn;\n\t}\n\n\tcreateProject( path );\n}\n\n\/\/ ** Composer::menuOpenProject\nvoid Composer::menuOpenProject( Ui::ActionQPtr action )\n{\n\t\/\/ Select the directory\n\tString path = m_fileSystem->selectExistingDirectory( \"Open Project\" );\n\n\tif( path == \"\" ) {\n\t\treturn;\n\t}\n\n\topenProject( path );\n}\n\n\/\/ ** Composer::menuSaveProject\nvoid Composer::menuSaveProject( Ui::ActionQPtr action )\n{\n\tif( Ui::DocumentQPtr document = m_mainWindow->activeDocument() ) {\n document->assetEditor()->save();\n }\n}\n\n\/\/ ** Composer::menuUndo\nvoid Composer::menuUndo( Ui::ActionQPtr action )\n{\n\tm_mainWindow->message( \"Not implemented yet.\", Ui::MessageWarning );\n}\n\n\/\/ ** Composer::menuRedo\nvoid Composer::menuRedo( Ui::ActionQPtr action )\n{\n\tm_mainWindow->message( \"Not implemented yet.\", Ui::MessageWarning );\n}\n\n\/\/ ** Composer::createProject\nvoid Composer::createProject( const String& path )\n{\n \/\/ Close active project\n closeProject();\n\n\t\/\/ Create project instance\n\tm_project = new Project( this, path );\n\n\t\/\/ Create all project folders\n\tfor( s32 i = 0; i < Project::TotalPaths; i++ ) {\n\t\tm_fileSystem->createDirectory( m_project->absolutePath( i ) );\n\t}\n\n\t\/\/ Emit the signal\n emit projectCreated( m_project );\n\n\t\/\/ Open created project\n\topenProject( path );\n}\n\n\/\/ ** Composer::closeProject\nvoid Composer::closeProject( void )\n{\n \/\/ No project opened\n if( !m_project ) {\n return;\n }\n\n \/\/ Emit the signal\n emit projectClosed( m_project );\n\n \/\/ Destroy project\n delete m_project;\n m_project = NULL;\n}\n\n\/\/ ** Composer::assetFromMime\nAssets::Handle Composer::assetFromMime( MimeDataQPtr mime ) const\n{\n\tAssets::AssetSet assets = assetsFromMime( mime );\n\n\tif( assets.empty() ) {\n\t\treturn Assets::Handle();\n\t}\n\n\treturn *assets.begin();\n}\n\n\/\/ ** Composer::assetsFromMime\nAssets::AssetSet Composer::assetsFromMime( MimeDataQPtr mime ) const\n{\n\t\/\/ Resulting asset set\n\tAssets::AssetSet result;\n\n\t\/\/ Get an array of attached assets\n\tQList<QUrl> assets = mime->urls();\n\n\t\/\/ Add assets to scene\n\tforeach( QUrl url, assets ) {\n\t\t\/\/ Read an attached meta data\n\t\tArchive meta = m_project->assetFileSystem()->metaData( url.toLocalFile().toStdString() );\n\n if( !meta.isValid() ) {\n\t\t\tcontinue;\t\/\/ Unsupported asset type or just a folder\n\t\t}\n\n DC_ABORT_IF( !meta.type()->is<KeyValue>(), \"asset meta data expected to be a KeyValue type\" );\n\n\t\t\/\/ Find asset by UUID.\n String uuid = meta.as<KeyValue>().get<String>( \"uuid\" );\n\n\t\tAssets::Handle asset = m_project->assets().findAsset( uuid );\n\t\tDC_BREAK_IF( !asset.isValid() );\n\n\t\t\/\/ Add to set.\n\t\tresult.insert( asset );\n\t}\n\n\treturn result;\n}\n\n\/\/ ** Composer::openProject\nvoid Composer::openProject( const String& path )\n{\n \/\/ Close active project\n closeProject();\n\n\t\/\/ Create project instance\n\tm_project = new Project( this, path );\n\n\t\/\/ Emit the signal\n emit projectOpened( m_project );\n\n\t\/\/ Setup menues\n\t\/\/m_menues[EditMenu]\t = m_mainWindow->addMenu( \"&Edit\" );\n\tm_menues[ViewMenu]\t = m_mainWindow->addMenu( \"&View\" );\n\tm_menues[AssetsMenu] = m_mainWindow->addMenu( \"&Assets\" );\n\n\t\/\/ Fill assets menu\n\tm_project->fillAssetMenu( m_menues[AssetsMenu] );\n}\n\nDC_END_COMPOSER\n\n\/\/ ** main\nint main(int argc, char *argv[])\n{\n\tQCoreApplication::setLibraryPaths( QCoreApplication::libraryPaths() << \".\" << \"imageformats\" << \"platforms\" );\n QLocale::setDefault( QLocale::c() );\n\n Composer app( argc, argv );\n\n if( !app.initialize() ) {\n return -1;\n }\n \n \/\/ Open the project\n\tapp.openProject( \"~TestProject\" );\n\n return app.exec();\n}<|endoftext|>"} {"text":"<commit_before>\/***************************Copyright-DO-NOT-REMOVE-THIS-LINE**\n * CONDOR Copyright Notice\n *\n * See LICENSE.TXT for additional notices and disclaimers.\n *\n * Copyright (c)1990-1998 CONDOR Team, Computer Sciences Department, \n * University of Wisconsin-Madison, Madison, WI. All Rights Reserved. \n * No use of the CONDOR Software Program Source Code is authorized \n * without the express consent of the CONDOR Team. For more information \n * contact: CONDOR Team, Attention: Professor Miron Livny, \n * 7367 Computer Sciences, 1210 W. Dayton St., Madison, WI 53706-1685, \n * (608) 262-0856 or miron@cs.wisc.edu.\n *\n * U.S. Government Rights Restrictions: Use, duplication, or disclosure \n * by the U.S. Government is subject to restrictions as set forth in \n * subparagraph (c)(1)(ii) of The Rights in Technical Data and Computer \n * Software clause at DFARS 252.227-7013 or subparagraphs (c)(1) and \n * (2) of Commercial Computer Software-Restricted Rights at 48 CFR \n * 52.227-19, as applicable, CONDOR Team, Attention: Professor Miron \n * Livny, 7367 Computer Sciences, 1210 W. Dayton St., Madison, \n * WI 53706-1685, (608) 262-0856 or miron@cs.wisc.edu.\n****************************Copyright-DO-NOT-REMOVE-THIS-LINE**\/\n\n#include \"condor_common.h\"\n#include \"condor_daemon_core.h\"\n\nextern bool operator==(const struct in_addr a, const struct in_addr b);\n\ntemplate class HashTable<pid_t, DaemonCore::PidEntry*>;\ntemplate class HashTable<struct in_addr, int>;\n<commit_msg>instantiate an ExtArray of type SockEnt, so our socket table grows dynamically<commit_after>\/***************************Copyright-DO-NOT-REMOVE-THIS-LINE**\n * CONDOR Copyright Notice\n *\n * See LICENSE.TXT for additional notices and disclaimers.\n *\n * Copyright (c)1990-1998 CONDOR Team, Computer Sciences Department, \n * University of Wisconsin-Madison, Madison, WI. All Rights Reserved. \n * No use of the CONDOR Software Program Source Code is authorized \n * without the express consent of the CONDOR Team. For more information \n * contact: CONDOR Team, Attention: Professor Miron Livny, \n * 7367 Computer Sciences, 1210 W. Dayton St., Madison, WI 53706-1685, \n * (608) 262-0856 or miron@cs.wisc.edu.\n *\n * U.S. Government Rights Restrictions: Use, duplication, or disclosure \n * by the U.S. Government is subject to restrictions as set forth in \n * subparagraph (c)(1)(ii) of The Rights in Technical Data and Computer \n * Software clause at DFARS 252.227-7013 or subparagraphs (c)(1) and \n * (2) of Commercial Computer Software-Restricted Rights at 48 CFR \n * 52.227-19, as applicable, CONDOR Team, Attention: Professor Miron \n * Livny, 7367 Computer Sciences, 1210 W. Dayton St., Madison, \n * WI 53706-1685, (608) 262-0856 or miron@cs.wisc.edu.\n****************************Copyright-DO-NOT-REMOVE-THIS-LINE**\/\n\n#include \"condor_common.h\"\n#include \"condor_daemon_core.h\"\n\nextern bool operator==(const struct in_addr a, const struct in_addr b);\n\ntemplate class HashTable<pid_t, DaemonCore::PidEntry*>;\ntemplate class HashTable<struct in_addr, int>;\ntemplate class ExtArray<DaemonCore::SockEnt>;\n<|endoftext|>"} {"text":"<commit_before>#include \"condor_common.h\"\n#include \"condor_sockfunc.h\"\n\n\/\/ condor_sockfunc_ex is used by syscall_lib that has minimal\n\/\/ dependency on condor libs.\n\/\/\n\/\/ make sure that any function included here should not call to\n\/\/ param(). ipv6_interface.cpp and ipv6_hostname.cpp do call to\n\/\/ param() thus never include any function using them.\n\/\/\n\/\/ alternative to condor_sockfunc_ex is to special_stubs.cpp\n\/\/ it includes simpler version of syscall functions.\n\/\/ if you do need separate implementation for normal condor code and\n\/\/ standard universe code, you might want to use special_stubs.cpp\n\nint condor_getsockname(int sockfd, condor_sockaddr& addr)\n{\n\tsockaddr_storage ss;\n\tsocklen_t socklen = sizeof(ss);\n\tint ret = getsockname(sockfd, (sockaddr*)&ss, &socklen);\n\tif (ret == 0) {\n\t\taddr = condor_sockaddr((sockaddr*)&ss);\n\t}\n\treturn ret;\n}\n\nint condor_getpeername(int sockfd, condor_sockaddr& addr)\n{\n\tsockaddr_storage ss;\n\tsocklen_t socklen = sizeof(ss);\n\tint ret = getpeername(sockfd, (sockaddr*)&ss, &socklen);\n\tif (ret == 0) {\n\t\taddr = condor_sockaddr((sockaddr*)&ss);\n\t}\n\treturn ret;\n}\n\n<commit_msg>(#4713) Don't return random garbage off the stack from condor_getsockname() and condor_getpeername().<commit_after>#include \"condor_common.h\"\n#include \"condor_sockfunc.h\"\n\n\/\/ condor_sockfunc_ex is used by syscall_lib that has minimal\n\/\/ dependency on condor libs.\n\/\/\n\/\/ make sure that any function included here should not call to\n\/\/ param(). ipv6_interface.cpp and ipv6_hostname.cpp do call to\n\/\/ param() thus never include any function using them.\n\/\/\n\/\/ alternative to condor_sockfunc_ex is to special_stubs.cpp\n\/\/ it includes simpler version of syscall functions.\n\/\/ if you do need separate implementation for normal condor code and\n\/\/ standard universe code, you might want to use special_stubs.cpp\n\nint condor_getsockname(int sockfd, condor_sockaddr& addr)\n{\n\tsockaddr_storage ss;\n\tsocklen_t socklen = sizeof(ss);\n\tmemset( & ss, 0, socklen );\n\tint ret = getsockname(sockfd, (sockaddr*)&ss, &socklen);\n\tif (ret == 0) {\n\t\taddr = condor_sockaddr((sockaddr*)&ss);\n\t}\n\treturn ret;\n}\n\nint condor_getpeername(int sockfd, condor_sockaddr& addr)\n{\n\tsockaddr_storage ss;\n\tsocklen_t socklen = sizeof(ss);\n\tmemset( & ss, 0, socklen );\n\tint ret = getpeername(sockfd, (sockaddr*)&ss, &socklen);\n\tif (ret == 0) {\n\t\taddr = condor_sockaddr((sockaddr*)&ss);\n\t}\n\treturn ret;\n}\n\n<|endoftext|>"} {"text":"<commit_before>\/*\n * Funambol is a mobile platform developed by Funambol, Inc. \n * Copyright (C) 2003 - 2007 Funambol, Inc.\n * \n * This program is free software; you can redistribute it and\/or modify it under\n * the terms of the GNU Affero General Public License version 3 as published by\n * the Free Software Foundation with the addition of the following permission \n * added to Section 15 as permitted in Section 7(a): FOR ANY PART OF THE COVERED\n * WORK IN WHICH THE COPYRIGHT IS OWNED BY FUNAMBOL, FUNAMBOL DISCLAIMS THE \n * WARRANTY OF NON INFRINGEMENT OF THIRD PARTY RIGHTS.\n * \n * This program is distributed in the hope that it will be useful, but WITHOUT\n * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS\n * FOR A PARTICULAR PURPOSE. See the GNU General Public License for more\n * details.\n * \n * You should have received a copy of the GNU Affero General Public License \n * along with this program; if not, see http:\/\/www.gnu.org\/licenses or write to\n * the Free Software Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston,\n * MA 02110-1301 USA.\n * \n * You can contact Funambol, Inc. headquarters at 643 Bair Island Road, Suite \n * 305, Redwood City, CA 94063, USA, or at email address info@funambol.com.\n * \n * The interactive user interfaces in modified source and object code versions\n * of this program must display Appropriate Legal Notices, as required under\n * Section 5 of the GNU Affero General Public License version 3.\n * \n * In accordance with Section 7(b) of the GNU Affero General Public License\n * version 3, these Appropriate Legal Notices must retain the display of the\n * \"Powered by Funambol\" logo. If the display of the logo is not reasonably \n * feasible for technical reasons, the Appropriate Legal Notices must display\n * the words \"Powered by Funambol\".\n *\/\n\n#include \"event\/ManageListener.h\"\n#include \"base\/globalsdef.h\"\n\nBEGIN_NAMESPACE\n\n\/\/------------------------------------------------------------- Local declarations\n\nclass DestroyManageListener{\npublic:\n DestroyManageListener() { };\n ~DestroyManageListener(){ ManageListener::releaseAllListeners(); }\n};\n\nDestroyManageListener destroyManageListener;\n\n\/** \n * ArrayElement container for the Listeners. It does not clone the inner\n * Listener pointer, nor deletes it. Cloning the element does not clone\n * the Listener, which is managed by ManageListener.\n * The only method which deletes the Listener is set(), to replace it\n * with the new one.\n *\/\nclass ListenerElement: public ArrayElement {\n\n public:\n\n ListenerElement(Listener *_l) : l(_l) {} ;\n ListenerElement(ListenerElement &other) : l(other.l) {} ;\n\n ~ListenerElement() {}\n\n void set(Listener *_l) { delete l; l = _l; };\n Listener* get() { return l; };\n\n ArrayElement* clone() {return new ListenerElement(*this);};\n\n private:\n\n Listener *l;\n};\n\n\n\/* Static Variables *\/\n\nManageListener * ManageListener::instance = 0;\n\n\/* Release all the listeners for the given list *\/\nvoid releaseListeners(ArrayList &list) {\n ListenerElement *l=NULL;\n\n for(l = (ListenerElement*)list.front(); l; l = (ListenerElement*)list.next()) {\n l->set(NULL);\n }\n list.clear();\n}\n\n\/\/-------------------------------- Private Methods ------------------------------\n\n\/* Release all the listeners on all the lists *\/\nManageListener::~ManageListener() {\n releaseListeners(synclisteners);\n releaseListeners(transportlisteners);\n releaseListeners(syncstatuslisteners);\n releaseListeners(syncitemlisteners);\n releaseListeners(syncsourcelisteners);\n}\n\n\/*\n * Search for the given listener in list.\n * \n * @return the pointer to the element with the same name, \n * or NULL otherwise.\n *\/\nListener *ManageListener::lookupListener(const char* name, ArrayList &list) {\n ListenerElement *l=NULL;\n\n for(l = (ListenerElement*)list.front(); l; l = (ListenerElement*)list.next()) {\n if (l->get()->getName() == name) {\n return l->get();\n }\n }\n return NULL;\n}\n\n\/* Set a new listener, replacing an existen one or adding it to the list. *\/\nbool ManageListener::setListener(Listener* listener, ArrayList &list) {\n ListenerElement *l=NULL;\n\n for(l = (ListenerElement*)list.front(); l; l = (ListenerElement*)list.next()) {\n if (l->get()->getName() == listener->getName()) {\n l->set(listener);\n return false; \/\/ Element already in the list, just change it\n }\n }\n\n \/\/ Not found, add it to the list\n ListenerElement newElement(listener);\n list.add(newElement);\n return true;\n}\n\n\n\/* Unset a listener, referenced by name. If the listener with that name is\n * not found, it does nothing. *\/\nvoid ManageListener::unsetListener(const char* name, ArrayList &list) {\n for(int i=0; i<list.size(); i++) {\n ListenerElement *l = dynamic_cast<ListenerElement*>(list[i]);\n if (l->get()->getName() == name) {\n l->set(NULL);\n list.removeElementAt(i);\n }\n }\n}\n\n\n\/\/--------------------------------- Public Methods ------------------------------\n\n\/*\n * Get, or create, ManageListener instance\n *\/\nManageListener& ManageListener::getInstance() {\n if(instance == NULL) {\n instance = new ManageListener();\n }\n return *instance;\n}\n\n\/*\n * Release all the listeners and the singleton instance.\n *\/\nvoid ManageListener::releaseAllListeners() {\n if (instance) {\n delete instance;\n instance = NULL;\n }\n}\n\n\/\/\n\/\/ Get listeners (return internal pointer):\n\/\/\nSyncListener* ManageListener::getSyncListener(const char *name) {\n return dynamic_cast<SyncListener*>(lookupListener(name, synclisteners));\n}\nTransportListener* ManageListener::getTransportListener(const char *name) {\n return dynamic_cast<TransportListener*>(lookupListener(name, transportlisteners));\n}\nSyncSourceListener* ManageListener::getSyncSourceListener(const char *name) {\n return dynamic_cast<SyncSourceListener*>(lookupListener(name, syncsourcelisteners));\n}\nSyncItemListener* ManageListener::getSyncItemListener(const char *name) {\n return dynamic_cast<SyncItemListener*>(lookupListener(name, syncitemlisteners));\n}\nSyncStatusListener* ManageListener::getSyncStatusListener(const char *name) {\n return dynamic_cast<SyncStatusListener*>(lookupListener(name, syncstatuslisteners));\n}\n\n\/\/ Get listeners by position.\nSyncListener* ManageListener::getSyncListener(int pos) {\n ListenerElement* le = static_cast<ListenerElement*>(synclisteners[pos]);\n return static_cast<SyncListener*>(le->get());\n}\nTransportListener* ManageListener::getTransportListener(int pos) {\n ListenerElement* le = static_cast<ListenerElement*>(transportlisteners[pos]);\n return static_cast<TransportListener*>(le->get());\n}\nSyncSourceListener* ManageListener::getSyncSourceListener(int pos) {\n ListenerElement* le = static_cast<ListenerElement*>(syncsourcelisteners[pos]);\n return static_cast<SyncSourceListener*>(le->get());\n}\nSyncItemListener* ManageListener::getSyncItemListener(int pos) {\n ListenerElement* le = static_cast<ListenerElement*>(syncitemlisteners[pos]);\n return static_cast<SyncItemListener*>(le->get());\n}\nSyncStatusListener* ManageListener::getSyncStatusListener(int pos) {\n ListenerElement* le = static_cast<ListenerElement*>(syncstatuslisteners[pos]);\n return static_cast<SyncStatusListener*>(le->get());\n}\n\n\n\/\/\n\/\/ Set listeners:\n\/\/\nvoid ManageListener::setSyncListener(SyncListener* listener) {\n setListener(listener, synclisteners);\n}\n\nvoid ManageListener::setTransportListener(TransportListener* listener) {\n setListener(listener, transportlisteners);\n}\n\nvoid ManageListener::setSyncSourceListener(SyncSourceListener* listener) {\n setListener(listener, syncsourcelisteners);\n}\n\nvoid ManageListener::setSyncItemListener(SyncItemListener* listener) {\n setListener(listener, syncitemlisteners);\n}\n\nvoid ManageListener::setSyncStatusListener(SyncStatusListener* listener) {\n setListener(listener, syncstatuslisteners);\n}\n\n\/\/\n\/\/ Unset listeners:\n\/\/\nvoid ManageListener::unsetSyncListener(const char *name) {\n unsetListener(name, synclisteners);\n}\n\nvoid ManageListener::unsetTransportListener(const char *name) {\n unsetListener(name, transportlisteners);\n}\n\nvoid ManageListener::unsetSyncSourceListener(const char *name) {\n unsetListener(name, syncsourcelisteners);\n}\n\nvoid ManageListener::unsetSyncItemListener(const char *name) {\n unsetListener(name, syncitemlisteners);\n}\n\nvoid ManageListener::unsetSyncStatusListener(const char *name) {\n unsetListener(name, syncstatuslisteners);\n}\n\n\nEND_NAMESPACE\n\n<commit_msg>Use static_cast<commit_after>\/*\n * Funambol is a mobile platform developed by Funambol, Inc. \n * Copyright (C) 2003 - 2007 Funambol, Inc.\n * \n * This program is free software; you can redistribute it and\/or modify it under\n * the terms of the GNU Affero General Public License version 3 as published by\n * the Free Software Foundation with the addition of the following permission \n * added to Section 15 as permitted in Section 7(a): FOR ANY PART OF THE COVERED\n * WORK IN WHICH THE COPYRIGHT IS OWNED BY FUNAMBOL, FUNAMBOL DISCLAIMS THE \n * WARRANTY OF NON INFRINGEMENT OF THIRD PARTY RIGHTS.\n * \n * This program is distributed in the hope that it will be useful, but WITHOUT\n * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS\n * FOR A PARTICULAR PURPOSE. See the GNU General Public License for more\n * details.\n * \n * You should have received a copy of the GNU Affero General Public License \n * along with this program; if not, see http:\/\/www.gnu.org\/licenses or write to\n * the Free Software Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston,\n * MA 02110-1301 USA.\n * \n * You can contact Funambol, Inc. headquarters at 643 Bair Island Road, Suite \n * 305, Redwood City, CA 94063, USA, or at email address info@funambol.com.\n * \n * The interactive user interfaces in modified source and object code versions\n * of this program must display Appropriate Legal Notices, as required under\n * Section 5 of the GNU Affero General Public License version 3.\n * \n * In accordance with Section 7(b) of the GNU Affero General Public License\n * version 3, these Appropriate Legal Notices must retain the display of the\n * \"Powered by Funambol\" logo. If the display of the logo is not reasonably \n * feasible for technical reasons, the Appropriate Legal Notices must display\n * the words \"Powered by Funambol\".\n *\/\n\n#include \"event\/ManageListener.h\"\n#include \"base\/globalsdef.h\"\n\nBEGIN_NAMESPACE\n\n\/\/------------------------------------------------------------- Local declarations\n\nclass DestroyManageListener{\npublic:\n DestroyManageListener() { };\n ~DestroyManageListener(){ ManageListener::releaseAllListeners(); }\n};\n\nDestroyManageListener destroyManageListener;\n\n\/** \n * ArrayElement container for the Listeners. It does not clone the inner\n * Listener pointer, nor deletes it. Cloning the element does not clone\n * the Listener, which is managed by ManageListener.\n * The only method which deletes the Listener is set(), to replace it\n * with the new one.\n *\/\nclass ListenerElement: public ArrayElement {\n\n public:\n\n ListenerElement(Listener *_l) : l(_l) {} ;\n ListenerElement(ListenerElement &other) : l(other.l) {} ;\n\n ~ListenerElement() {}\n\n void set(Listener *_l) { delete l; l = _l; };\n Listener* get() { return l; };\n\n ArrayElement* clone() {return new ListenerElement(*this);};\n\n private:\n\n Listener *l;\n};\n\n\n\/* Static Variables *\/\n\nManageListener * ManageListener::instance = 0;\n\n\/* Release all the listeners for the given list *\/\nvoid releaseListeners(ArrayList &list) {\n ListenerElement *l=NULL;\n\n for(l = (ListenerElement*)list.front(); l; l = (ListenerElement*)list.next()) {\n l->set(NULL);\n }\n list.clear();\n}\n\n\/\/-------------------------------- Private Methods ------------------------------\n\n\/* Release all the listeners on all the lists *\/\nManageListener::~ManageListener() {\n releaseListeners(synclisteners);\n releaseListeners(transportlisteners);\n releaseListeners(syncstatuslisteners);\n releaseListeners(syncitemlisteners);\n releaseListeners(syncsourcelisteners);\n}\n\n\/*\n * Search for the given listener in list.\n * \n * @return the pointer to the element with the same name, \n * or NULL otherwise.\n *\/\nListener *ManageListener::lookupListener(const char* name, ArrayList &list) {\n ListenerElement *l=NULL;\n\n for(l = (ListenerElement*)list.front(); l; l = (ListenerElement*)list.next()) {\n if (l->get()->getName() == name) {\n return l->get();\n }\n }\n return NULL;\n}\n\n\/* Set a new listener, replacing an existen one or adding it to the list. *\/\nbool ManageListener::setListener(Listener* listener, ArrayList &list) {\n ListenerElement *l=NULL;\n\n for(l = (ListenerElement*)list.front(); l; l = (ListenerElement*)list.next()) {\n if (l->get()->getName() == listener->getName()) {\n l->set(listener);\n return false; \/\/ Element already in the list, just change it\n }\n }\n\n \/\/ Not found, add it to the list\n ListenerElement newElement(listener);\n list.add(newElement);\n return true;\n}\n\n\n\/* Unset a listener, referenced by name. If the listener with that name is\n * not found, it does nothing. *\/\nvoid ManageListener::unsetListener(const char* name, ArrayList &list) {\n for(int i=0; i<list.size(); i++) {\n ListenerElement *l = static_cast<ListenerElement*>(list[i]);\n if (l->get()->getName() == name) {\n l->set(NULL);\n list.removeElementAt(i);\n }\n }\n}\n\n\n\/\/--------------------------------- Public Methods ------------------------------\n\n\/*\n * Get, or create, ManageListener instance\n *\/\nManageListener& ManageListener::getInstance() {\n if(instance == NULL) {\n instance = new ManageListener();\n }\n return *instance;\n}\n\n\/*\n * Release all the listeners and the singleton instance.\n *\/\nvoid ManageListener::releaseAllListeners() {\n if (instance) {\n delete instance;\n instance = NULL;\n }\n}\n\n\/\/\n\/\/ Get listeners (return internal pointer):\n\/\/\nSyncListener* ManageListener::getSyncListener(const char *name) {\n return static_cast<SyncListener*>(lookupListener(name, synclisteners));\n}\nTransportListener* ManageListener::getTransportListener(const char *name) {\n return static_cast<TransportListener*>(lookupListener(name, transportlisteners));\n}\nSyncSourceListener* ManageListener::getSyncSourceListener(const char *name) {\n return static_cast<SyncSourceListener*>(lookupListener(name, syncsourcelisteners));\n}\nSyncItemListener* ManageListener::getSyncItemListener(const char *name) {\n return static_cast<SyncItemListener*>(lookupListener(name, syncitemlisteners));\n}\nSyncStatusListener* ManageListener::getSyncStatusListener(const char *name) {\n return static_cast<SyncStatusListener*>(lookupListener(name, syncstatuslisteners));\n}\n\n\/\/ Get listeners by position.\nSyncListener* ManageListener::getSyncListener(int pos) {\n ListenerElement* le = static_cast<ListenerElement*>(synclisteners[pos]);\n return static_cast<SyncListener*>(le->get());\n}\nTransportListener* ManageListener::getTransportListener(int pos) {\n ListenerElement* le = static_cast<ListenerElement*>(transportlisteners[pos]);\n return static_cast<TransportListener*>(le->get());\n}\nSyncSourceListener* ManageListener::getSyncSourceListener(int pos) {\n ListenerElement* le = static_cast<ListenerElement*>(syncsourcelisteners[pos]);\n return static_cast<SyncSourceListener*>(le->get());\n}\nSyncItemListener* ManageListener::getSyncItemListener(int pos) {\n ListenerElement* le = static_cast<ListenerElement*>(syncitemlisteners[pos]);\n return static_cast<SyncItemListener*>(le->get());\n}\nSyncStatusListener* ManageListener::getSyncStatusListener(int pos) {\n ListenerElement* le = static_cast<ListenerElement*>(syncstatuslisteners[pos]);\n return static_cast<SyncStatusListener*>(le->get());\n}\n\n\n\/\/\n\/\/ Set listeners:\n\/\/\nvoid ManageListener::setSyncListener(SyncListener* listener) {\n setListener(listener, synclisteners);\n}\n\nvoid ManageListener::setTransportListener(TransportListener* listener) {\n setListener(listener, transportlisteners);\n}\n\nvoid ManageListener::setSyncSourceListener(SyncSourceListener* listener) {\n setListener(listener, syncsourcelisteners);\n}\n\nvoid ManageListener::setSyncItemListener(SyncItemListener* listener) {\n setListener(listener, syncitemlisteners);\n}\n\nvoid ManageListener::setSyncStatusListener(SyncStatusListener* listener) {\n setListener(listener, syncstatuslisteners);\n}\n\n\/\/\n\/\/ Unset listeners:\n\/\/\nvoid ManageListener::unsetSyncListener(const char *name) {\n unsetListener(name, synclisteners);\n}\n\nvoid ManageListener::unsetTransportListener(const char *name) {\n unsetListener(name, transportlisteners);\n}\n\nvoid ManageListener::unsetSyncSourceListener(const char *name) {\n unsetListener(name, syncsourcelisteners);\n}\n\nvoid ManageListener::unsetSyncItemListener(const char *name) {\n unsetListener(name, syncitemlisteners);\n}\n\nvoid ManageListener::unsetSyncStatusListener(const char *name) {\n unsetListener(name, syncstatuslisteners);\n}\n\n\nEND_NAMESPACE\n\n<|endoftext|>"} {"text":"<commit_before>\/*\n * Copyright (c) 2007 MIPS Technologies, 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: redistributions of source code 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: Korey Sewell\n *\n *\/\n\n#ifndef __CPU_INORDER_CACHE_UNIT_HH__\n#define __CPU_INORDER_CACHE_UNIT_HH__\n\n#include <list>\n#include <string>\n#include <vector>\n\n#include \"arch\/predecoder.hh\"\n#include \"arch\/tlb.hh\"\n#include \"config\/the_isa.hh\"\n#include \"cpu\/inorder\/inorder_dyn_inst.hh\"\n#include \"cpu\/inorder\/pipeline_traits.hh\"\n#include \"cpu\/inorder\/resource.hh\"\n#include \"mem\/packet.hh\"\n#include \"mem\/packet_access.hh\"\n#include \"mem\/port.hh\"\n#include \"params\/InOrderCPU.hh\"\n#include \"sim\/sim_object.hh\"\n\nclass CacheRequest;\ntypedef CacheRequest* CacheReqPtr;\n\nclass CacheReqPacket;\ntypedef CacheReqPacket* CacheReqPktPtr;\n\nclass CacheUnit : public Resource\n{\n public:\n typedef ThePipeline::DynInstPtr DynInstPtr;\n\n public:\n CacheUnit(std::string res_name, int res_id, int res_width,\n int res_latency, InOrderCPU *_cpu, ThePipeline::Params *params);\n\n enum Command {\n InitiateReadData,\n CompleteReadData,\n InitiateWriteData,\n CompleteWriteData,\n InitSecondSplitRead,\n InitSecondSplitWrite,\n CompleteSecondSplitRead,\n CompleteSecondSplitWrite\n };\n\n public:\n \/** CachePort class for the Cache Unit. Handles doing the\n * communication with the cache\/memory.\n *\/\n class CachePort : public Port\n {\n protected:\n \/** Pointer to cache port unit *\/\n CacheUnit *cachePortUnit;\n\n public:\n \/** Default constructor. *\/\n CachePort(CacheUnit *_cachePortUnit)\n : Port(_cachePortUnit->name() + \"-cache-port\",\n (MemObject*)_cachePortUnit->cpu),\n cachePortUnit(_cachePortUnit), snoopRangeSent(false)\n { }\n\n bool snoopRangeSent;\n\n void setPeer(Port *port);\n\n protected:\n \/** Atomic version of receive. Panics. *\/\n Tick recvAtomic(PacketPtr pkt);\n\n \/** Functional version of receive.*\/\n void recvFunctional(PacketPtr pkt);\n\n \/** Receives status change. Other than range changing, panics. *\/\n void recvStatusChange(Status status);\n\n \/** Returns the address ranges of this device. *\/\n void getDeviceAddressRanges(AddrRangeList &resp,\n bool &snoop)\n { resp.clear(); snoop = true; }\n\n \/** Timing version of receive *\/\n bool recvTiming(PacketPtr pkt);\n\n \/** Handles doing a retry of a failed fetch. *\/\n void recvRetry();\n };\n\n void init();\n\n ResourceRequest* getRequest(DynInstPtr _inst, int stage_num,\n int res_idx, int slot_num,\n unsigned cmd);\n\n ResReqPtr findRequest(DynInstPtr inst);\n ResReqPtr findRequest(DynInstPtr inst, int idx);\n\n void requestAgain(DynInstPtr inst, bool &try_request);\n\n virtual int getSlot(DynInstPtr inst);\n\n \/** Executes one of the commands from the \"Command\" enum *\/\n virtual void execute(int slot_num);\n\n virtual void squash(DynInstPtr inst, int stage_num,\n InstSeqNum squash_seq_num, ThreadID tid);\n\n void squashDueToMemStall(DynInstPtr inst, int stage_num,\n InstSeqNum squash_seq_num, ThreadID tid);\n\n virtual void squashCacheRequest(CacheReqPtr req_ptr);\n\n \/** After memory request is completedd in the cache, then do final\n processing to complete the request in the CPU.\n *\/\n virtual void processCacheCompletion(PacketPtr pkt);\n\n \/** Create request that will interface w\/TLB and Memory objects *\/\n virtual void setupMemRequest(DynInstPtr inst, CacheReqPtr cache_req,\n int acc_size, int flags);\n\n void finishCacheUnitReq(DynInstPtr inst, CacheRequest *cache_req);\n\n void buildDataPacket(CacheRequest *cache_req);\n\n bool processSquash(CacheReqPacket *cache_pkt);\n\n#if !FULL_SYSTEM\n void trap(Fault fault, ThreadID tid, DynInstPtr inst);\n#endif\n void recvRetry();\n\n \/** Returns a specific port. *\/\n Port *getPort(const std::string &if_name, int idx);\n \n Fault read(DynInstPtr inst, Addr addr,\n uint8_t *data, unsigned size, unsigned flags);\n\n Fault write(DynInstPtr inst, uint8_t *data, unsigned size,\n Addr addr, unsigned flags, uint64_t *res);\n\n void doTLBAccess(DynInstPtr inst, CacheReqPtr cache_req, int acc_size,\n int flags, TheISA::TLB::Mode tlb_mode);\n\n \/** Read\/Write on behalf of an instruction.\n * curResSlot needs to be a valid value in instruction.\n *\/\n void doCacheAccess(DynInstPtr inst, uint64_t *write_result=NULL,\n CacheReqPtr split_req=NULL);\n\n uint64_t getMemData(Packet *packet);\n\n void setAddrDependency(DynInstPtr inst);\n virtual void removeAddrDependency(DynInstPtr inst);\n \n protected:\n \/** Cache interface. *\/\n CachePort *cachePort;\n\n bool cachePortBlocked;\n\n std::list<Addr> addrList[ThePipeline::MaxThreads];\n\n m5::hash_map<Addr, InstSeqNum> addrMap[ThePipeline::MaxThreads];\n\n public:\n int cacheBlkSize;\n\n int cacheBlkMask;\n\n \/** Align a PC to the start of the Cache block. *\/\n Addr cacheBlockAlign(Addr addr)\n {\n return (addr & ~(cacheBlkMask));\n }\n\n bool tlbBlocked[ThePipeline::MaxThreads];\n InstSeqNum tlbBlockSeqNum[ThePipeline::MaxThreads];\n\n TheISA::TLB* tlb();\n TheISA::TLB *_tlb;\n};\n\nclass CacheUnitEvent : public ResourceEvent {\n public:\n const std::string name() const\n {\n return \"CacheUnitEvent\";\n }\n\n\n \/** Constructs a resource event. *\/\n CacheUnitEvent();\n virtual ~CacheUnitEvent() {}\n\n \/** Processes a resource event. *\/\n void process();\n};\n\n\/\/@todo: Move into CacheUnit Class for private access to \"valid\" field\nclass CacheRequest : public ResourceRequest\n{\n public:\n CacheRequest(CacheUnit *cres)\n : ResourceRequest(cres), memReq(NULL), reqData(NULL),\n dataPkt(NULL), memAccComplete(false),\n memAccPending(false), tlbStall(false), splitAccess(false),\n splitAccessNum(-1), split2ndAccess(false),\n fetchBufferFill(false)\n { }\n\n virtual ~CacheRequest()\n {\n if (reqData && !splitAccess)\n delete [] reqData;\n }\n\n void setRequest(DynInstPtr _inst, int stage_num, int res_idx, int slot_num,\n unsigned _cmd, MemCmd::Command pkt_cmd, int idx)\n {\n pktCmd = pkt_cmd;\n instIdx = idx;\n\n ResourceRequest::setRequest(_inst, stage_num, res_idx, slot_num, _cmd);\n }\n\n void clearRequest();\n\n virtual PacketDataPtr getData()\n { return reqData; }\n\n void\n setMemAccCompleted(bool completed = true)\n {\n memAccComplete = completed;\n }\n\n bool is2ndSplit() \n {\n return split2ndAccess;\n }\n \n bool isMemAccComplete() { return memAccComplete; }\n\n void setMemAccPending(bool pending = true) { memAccPending = pending; }\n bool isMemAccPending() { return memAccPending; }\n\n \/\/Make this data private\/protected!\n MemCmd::Command pktCmd;\n RequestPtr memReq;\n PacketDataPtr reqData;\n CacheReqPacket *dataPkt;\n\n bool memAccComplete;\n bool memAccPending;\n bool tlbStall;\n\n bool splitAccess;\n int splitAccessNum;\n bool split2ndAccess;\n int instIdx; \n\n \/** Should we expect block from cache access or fetch buffer? *\/\n bool fetchBufferFill;\n};\n\nclass CacheReqPacket : public Packet\n{\n public:\n CacheReqPacket(CacheRequest *_req,\n Command _cmd, short _dest, int _idx = 0)\n : Packet(&(*_req->memReq), _cmd, _dest), cacheReq(_req),\n instIdx(_idx), hasSlot(false), reqData(NULL), memReq(NULL)\n {\n\n }\n\n CacheRequest *cacheReq;\n int instIdx;\n bool hasSlot;\n PacketDataPtr reqData;\n RequestPtr memReq;\n};\n\n#endif \/\/__CPU_CACHE_UNIT_HH__\n<commit_msg>InOrder: Make cache_unit.hh include hashmap.hh explicitly, not transitively.<commit_after>\/*\n * Copyright (c) 2007 MIPS Technologies, 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: redistributions of source code 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: Korey Sewell\n *\n *\/\n\n#ifndef __CPU_INORDER_CACHE_UNIT_HH__\n#define __CPU_INORDER_CACHE_UNIT_HH__\n\n#include <list>\n#include <string>\n#include <vector>\n\n#include \"arch\/predecoder.hh\"\n#include \"arch\/tlb.hh\"\n#include \"base\/hashmap.hh\"\n#include \"config\/the_isa.hh\"\n#include \"cpu\/inorder\/inorder_dyn_inst.hh\"\n#include \"cpu\/inorder\/pipeline_traits.hh\"\n#include \"cpu\/inorder\/resource.hh\"\n#include \"mem\/packet.hh\"\n#include \"mem\/packet_access.hh\"\n#include \"mem\/port.hh\"\n#include \"params\/InOrderCPU.hh\"\n#include \"sim\/sim_object.hh\"\n\nclass CacheRequest;\ntypedef CacheRequest* CacheReqPtr;\n\nclass CacheReqPacket;\ntypedef CacheReqPacket* CacheReqPktPtr;\n\nclass CacheUnit : public Resource\n{\n public:\n typedef ThePipeline::DynInstPtr DynInstPtr;\n\n public:\n CacheUnit(std::string res_name, int res_id, int res_width,\n int res_latency, InOrderCPU *_cpu, ThePipeline::Params *params);\n\n enum Command {\n InitiateReadData,\n CompleteReadData,\n InitiateWriteData,\n CompleteWriteData,\n InitSecondSplitRead,\n InitSecondSplitWrite,\n CompleteSecondSplitRead,\n CompleteSecondSplitWrite\n };\n\n public:\n \/** CachePort class for the Cache Unit. Handles doing the\n * communication with the cache\/memory.\n *\/\n class CachePort : public Port\n {\n protected:\n \/** Pointer to cache port unit *\/\n CacheUnit *cachePortUnit;\n\n public:\n \/** Default constructor. *\/\n CachePort(CacheUnit *_cachePortUnit)\n : Port(_cachePortUnit->name() + \"-cache-port\",\n (MemObject*)_cachePortUnit->cpu),\n cachePortUnit(_cachePortUnit), snoopRangeSent(false)\n { }\n\n bool snoopRangeSent;\n\n void setPeer(Port *port);\n\n protected:\n \/** Atomic version of receive. Panics. *\/\n Tick recvAtomic(PacketPtr pkt);\n\n \/** Functional version of receive.*\/\n void recvFunctional(PacketPtr pkt);\n\n \/** Receives status change. Other than range changing, panics. *\/\n void recvStatusChange(Status status);\n\n \/** Returns the address ranges of this device. *\/\n void getDeviceAddressRanges(AddrRangeList &resp,\n bool &snoop)\n { resp.clear(); snoop = true; }\n\n \/** Timing version of receive *\/\n bool recvTiming(PacketPtr pkt);\n\n \/** Handles doing a retry of a failed fetch. *\/\n void recvRetry();\n };\n\n void init();\n\n ResourceRequest* getRequest(DynInstPtr _inst, int stage_num,\n int res_idx, int slot_num,\n unsigned cmd);\n\n ResReqPtr findRequest(DynInstPtr inst);\n ResReqPtr findRequest(DynInstPtr inst, int idx);\n\n void requestAgain(DynInstPtr inst, bool &try_request);\n\n virtual int getSlot(DynInstPtr inst);\n\n \/** Executes one of the commands from the \"Command\" enum *\/\n virtual void execute(int slot_num);\n\n virtual void squash(DynInstPtr inst, int stage_num,\n InstSeqNum squash_seq_num, ThreadID tid);\n\n void squashDueToMemStall(DynInstPtr inst, int stage_num,\n InstSeqNum squash_seq_num, ThreadID tid);\n\n virtual void squashCacheRequest(CacheReqPtr req_ptr);\n\n \/** After memory request is completedd in the cache, then do final\n processing to complete the request in the CPU.\n *\/\n virtual void processCacheCompletion(PacketPtr pkt);\n\n \/** Create request that will interface w\/TLB and Memory objects *\/\n virtual void setupMemRequest(DynInstPtr inst, CacheReqPtr cache_req,\n int acc_size, int flags);\n\n void finishCacheUnitReq(DynInstPtr inst, CacheRequest *cache_req);\n\n void buildDataPacket(CacheRequest *cache_req);\n\n bool processSquash(CacheReqPacket *cache_pkt);\n\n#if !FULL_SYSTEM\n void trap(Fault fault, ThreadID tid, DynInstPtr inst);\n#endif\n void recvRetry();\n\n \/** Returns a specific port. *\/\n Port *getPort(const std::string &if_name, int idx);\n \n Fault read(DynInstPtr inst, Addr addr,\n uint8_t *data, unsigned size, unsigned flags);\n\n Fault write(DynInstPtr inst, uint8_t *data, unsigned size,\n Addr addr, unsigned flags, uint64_t *res);\n\n void doTLBAccess(DynInstPtr inst, CacheReqPtr cache_req, int acc_size,\n int flags, TheISA::TLB::Mode tlb_mode);\n\n \/** Read\/Write on behalf of an instruction.\n * curResSlot needs to be a valid value in instruction.\n *\/\n void doCacheAccess(DynInstPtr inst, uint64_t *write_result=NULL,\n CacheReqPtr split_req=NULL);\n\n uint64_t getMemData(Packet *packet);\n\n void setAddrDependency(DynInstPtr inst);\n virtual void removeAddrDependency(DynInstPtr inst);\n \n protected:\n \/** Cache interface. *\/\n CachePort *cachePort;\n\n bool cachePortBlocked;\n\n std::list<Addr> addrList[ThePipeline::MaxThreads];\n\n m5::hash_map<Addr, InstSeqNum> addrMap[ThePipeline::MaxThreads];\n\n public:\n int cacheBlkSize;\n\n int cacheBlkMask;\n\n \/** Align a PC to the start of the Cache block. *\/\n Addr cacheBlockAlign(Addr addr)\n {\n return (addr & ~(cacheBlkMask));\n }\n\n bool tlbBlocked[ThePipeline::MaxThreads];\n InstSeqNum tlbBlockSeqNum[ThePipeline::MaxThreads];\n\n TheISA::TLB* tlb();\n TheISA::TLB *_tlb;\n};\n\nclass CacheUnitEvent : public ResourceEvent {\n public:\n const std::string name() const\n {\n return \"CacheUnitEvent\";\n }\n\n\n \/** Constructs a resource event. *\/\n CacheUnitEvent();\n virtual ~CacheUnitEvent() {}\n\n \/** Processes a resource event. *\/\n void process();\n};\n\n\/\/@todo: Move into CacheUnit Class for private access to \"valid\" field\nclass CacheRequest : public ResourceRequest\n{\n public:\n CacheRequest(CacheUnit *cres)\n : ResourceRequest(cres), memReq(NULL), reqData(NULL),\n dataPkt(NULL), memAccComplete(false),\n memAccPending(false), tlbStall(false), splitAccess(false),\n splitAccessNum(-1), split2ndAccess(false),\n fetchBufferFill(false)\n { }\n\n virtual ~CacheRequest()\n {\n if (reqData && !splitAccess)\n delete [] reqData;\n }\n\n void setRequest(DynInstPtr _inst, int stage_num, int res_idx, int slot_num,\n unsigned _cmd, MemCmd::Command pkt_cmd, int idx)\n {\n pktCmd = pkt_cmd;\n instIdx = idx;\n\n ResourceRequest::setRequest(_inst, stage_num, res_idx, slot_num, _cmd);\n }\n\n void clearRequest();\n\n virtual PacketDataPtr getData()\n { return reqData; }\n\n void\n setMemAccCompleted(bool completed = true)\n {\n memAccComplete = completed;\n }\n\n bool is2ndSplit() \n {\n return split2ndAccess;\n }\n \n bool isMemAccComplete() { return memAccComplete; }\n\n void setMemAccPending(bool pending = true) { memAccPending = pending; }\n bool isMemAccPending() { return memAccPending; }\n\n \/\/Make this data private\/protected!\n MemCmd::Command pktCmd;\n RequestPtr memReq;\n PacketDataPtr reqData;\n CacheReqPacket *dataPkt;\n\n bool memAccComplete;\n bool memAccPending;\n bool tlbStall;\n\n bool splitAccess;\n int splitAccessNum;\n bool split2ndAccess;\n int instIdx; \n\n \/** Should we expect block from cache access or fetch buffer? *\/\n bool fetchBufferFill;\n};\n\nclass CacheReqPacket : public Packet\n{\n public:\n CacheReqPacket(CacheRequest *_req,\n Command _cmd, short _dest, int _idx = 0)\n : Packet(&(*_req->memReq), _cmd, _dest), cacheReq(_req),\n instIdx(_idx), hasSlot(false), reqData(NULL), memReq(NULL)\n {\n\n }\n\n CacheRequest *cacheReq;\n int instIdx;\n bool hasSlot;\n PacketDataPtr reqData;\n RequestPtr memReq;\n};\n\n#endif \/\/__CPU_CACHE_UNIT_HH__\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\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};\n\nstatic const VkConformanceVersionKHR knownConformanceVersions[] =\n{\n\tmakeConformanceVersionKHR(1, 1, 2, 1),\n\tmakeConformanceVersionKHR(1, 1, 2, 0),\n\tmakeConformanceVersionKHR(1, 1, 1, 3),\n\tmakeConformanceVersionKHR(1, 1, 1, 2),\n\tmakeConformanceVersionKHR(1, 1, 1, 1),\n\tmakeConformanceVersionKHR(1, 1, 1, 0),\n\tmakeConformanceVersionKHR(1, 1, 0, 3),\n\tmakeConformanceVersionKHR(1, 0, 2, 6),\n\tmakeConformanceVersionKHR(1, 0, 2, 5),\n\tmakeConformanceVersionKHR(1, 0, 2, 4),\n\tmakeConformanceVersionKHR(1, 0, 2, 3),\n\tmakeConformanceVersionKHR(1, 0, 2, 2),\n\tmakeConformanceVersionKHR(1, 0, 2, 1),\n\tmakeConformanceVersionKHR(1, 0, 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\ntcu::TestStatus testQueryProperties (Context& context)\n{\n\t\/\/ Check extension support\n\n\tif (!isDeviceExtensionSupported(context.getUsedApiVersion(), context.getDeviceExtensions(), \"VK_KHR_driver_properties\"))\n\t\tTCU_THROW(NotSupportedError, \"Unsupported extension: VK_KHR_driver_properties\");\n\n\t\/\/ Query the driver properties\n\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\n\tbool match = false;\n\n\tfor (const deUint32* pDriverId = knownDriverIds; (pDriverId != DE_ARRAY_END(knownDriverIds)) && !match; ++pDriverId)\n\t{\n\t\tif (deviceDriverProperties.driverID == *pDriverId)\n\t\t{\n\t\t\tmatch = true;\n\n\t\t\tif (!isNullTerminated(deviceDriverProperties.driverName, VK_MAX_DRIVER_NAME_SIZE_KHR))\n\t\t\t\tTCU_FAIL(\"Driver name is not a null-terminated string\");\n\n\t\t\tif (deviceDriverProperties.driverName[0] == 0)\n\t\t\t\tTCU_FAIL(\"Driver name is empty\");\n\n\t\t\tif (!isNullTerminated(deviceDriverProperties.driverInfo, VK_MAX_DRIVER_INFO_SIZE_KHR))\n\t\t\t\tTCU_FAIL(\"Driver info is not a null-terminated string\");\n\n\t\t\tbool conformanceVersionMatch = false;\n\n\t\t\tfor (const VkConformanceVersionKHR* pConformanceVersion = knownConformanceVersions;\n\t\t\t\t\t\t\t\t\t\t\t\tpConformanceVersion != DE_ARRAY_END(knownConformanceVersions);\n\t\t\t\t\t\t\t\t\t\t\t ++pConformanceVersion)\n\t\t\t{\n\t\t\t\tif (deviceDriverProperties.conformanceVersion == *pConformanceVersion)\n\t\t\t\t{\n\t\t\t\t\tconformanceVersionMatch = true;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\n\t\t\tif (!conformanceVersionMatch)\n\t\t\t\tTCU_FAIL(\"Wrong driver conformance version\");\n\t\t}\n\t}\n\n\tif (!match)\n\t\tTCU_FAIL(\"Driver ID did not match any known driver\");\n\n\treturn tcu::TestStatus::pass(\"Pass\");\n}\n\nvoid createTestCases (tcu::TestCaseGroup* group)\n{\n\taddFunctionCase(group, \"properties\", \"Query VkPhysicalDeviceDriverPropertiesKHR and check its values\", testQueryProperties);\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>Add 1.1.2.2 to known conformance versions<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\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};\n\nstatic const VkConformanceVersionKHR knownConformanceVersions[] =\n{\n\tmakeConformanceVersionKHR(1, 1, 2, 2),\n\tmakeConformanceVersionKHR(1, 1, 2, 1),\n\tmakeConformanceVersionKHR(1, 1, 2, 0),\n\tmakeConformanceVersionKHR(1, 1, 1, 3),\n\tmakeConformanceVersionKHR(1, 1, 1, 2),\n\tmakeConformanceVersionKHR(1, 1, 1, 1),\n\tmakeConformanceVersionKHR(1, 1, 1, 0),\n\tmakeConformanceVersionKHR(1, 1, 0, 3),\n\tmakeConformanceVersionKHR(1, 0, 2, 6),\n\tmakeConformanceVersionKHR(1, 0, 2, 5),\n\tmakeConformanceVersionKHR(1, 0, 2, 4),\n\tmakeConformanceVersionKHR(1, 0, 2, 3),\n\tmakeConformanceVersionKHR(1, 0, 2, 2),\n\tmakeConformanceVersionKHR(1, 0, 2, 1),\n\tmakeConformanceVersionKHR(1, 0, 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\ntcu::TestStatus testQueryProperties (Context& context)\n{\n\t\/\/ Check extension support\n\n\tif (!isDeviceExtensionSupported(context.getUsedApiVersion(), context.getDeviceExtensions(), \"VK_KHR_driver_properties\"))\n\t\tTCU_THROW(NotSupportedError, \"Unsupported extension: VK_KHR_driver_properties\");\n\n\t\/\/ Query the driver properties\n\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\n\tbool match = false;\n\n\tfor (const deUint32* pDriverId = knownDriverIds; (pDriverId != DE_ARRAY_END(knownDriverIds)) && !match; ++pDriverId)\n\t{\n\t\tif (deviceDriverProperties.driverID == *pDriverId)\n\t\t{\n\t\t\tmatch = true;\n\n\t\t\tif (!isNullTerminated(deviceDriverProperties.driverName, VK_MAX_DRIVER_NAME_SIZE_KHR))\n\t\t\t\tTCU_FAIL(\"Driver name is not a null-terminated string\");\n\n\t\t\tif (deviceDriverProperties.driverName[0] == 0)\n\t\t\t\tTCU_FAIL(\"Driver name is empty\");\n\n\t\t\tif (!isNullTerminated(deviceDriverProperties.driverInfo, VK_MAX_DRIVER_INFO_SIZE_KHR))\n\t\t\t\tTCU_FAIL(\"Driver info is not a null-terminated string\");\n\n\t\t\tbool conformanceVersionMatch = false;\n\n\t\t\tfor (const VkConformanceVersionKHR* pConformanceVersion = knownConformanceVersions;\n\t\t\t\t\t\t\t\t\t\t\t\tpConformanceVersion != DE_ARRAY_END(knownConformanceVersions);\n\t\t\t\t\t\t\t\t\t\t\t ++pConformanceVersion)\n\t\t\t{\n\t\t\t\tif (deviceDriverProperties.conformanceVersion == *pConformanceVersion)\n\t\t\t\t{\n\t\t\t\t\tconformanceVersionMatch = true;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\n\t\t\tif (!conformanceVersionMatch)\n\t\t\t\tTCU_FAIL(\"Wrong driver conformance version\");\n\t\t}\n\t}\n\n\tif (!match)\n\t\tTCU_FAIL(\"Driver ID did not match any known driver\");\n\n\treturn tcu::TestStatus::pass(\"Pass\");\n}\n\nvoid createTestCases (tcu::TestCaseGroup* group)\n{\n\taddFunctionCase(group, \"properties\", \"Query VkPhysicalDeviceDriverPropertiesKHR and check its values\", testQueryProperties);\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>\/*\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 \"cli-channel.h\"\n\n#include \"_gen\/cli-channel-body.hpp\"\n#include \"_gen\/cli-channel.moc.hpp\"\n#include \"cli-channel.moc.hpp\"\n\n#include <QQueue>\n\n#include \"cli-dbus.h\"\n#include \"constants.h\"\n#include \"debug-internal.hpp\"\n\nnamespace Telepathy\n{\nnamespace Client\n{\n\nstruct Channel::Private\n{\n \/\/ Public object\n Channel& parent;\n\n \/\/ Optional interface proxies\n DBus::PropertiesInterface* properties;\n\n \/\/ Introspection\n Readiness readiness;\n QStringList interfaces;\n QQueue<void (Private::*)()> introspectQueue;\n\n \/\/ Introspected properties\n QString channelType;\n uint targetHandleType;\n uint targetHandle;\n\n Private(Channel& parent)\n : parent(parent)\n {\n debug() << \"Creating new Channel\";\n\n properties = 0;\n readiness = ReadinessJustCreated;\n\n debug() << \"Connecting to Channel::Closed()\";\n parent.connect(&parent,\n SIGNAL(Closed()),\n SLOT(onClosed()));\n\n introspectQueue.enqueue(&Private::introspectMain);\n continueIntrospection();\n }\n\n void introspectMain()\n {\n if (!properties) {\n properties = parent.propertiesInterface();\n Q_ASSERT(properties != 0);\n }\n\n debug() << \"Calling Properties::GetAll(Channel)\";\n QDBusPendingCallWatcher* watcher =\n new QDBusPendingCallWatcher(\n properties->GetAll(TELEPATHY_INTERFACE_CHANNEL), &parent);\n parent.connect(watcher,\n SIGNAL(finished(QDBusPendingCallWatcher*)),\n SLOT(gotMainProperties(QDBusPendingCallWatcher*)));\n }\n\n void introspectMainFallbackChannelType()\n {\n debug() << \"Calling Channel::GetChannelType()\";\n QDBusPendingCallWatcher* watcher =\n new QDBusPendingCallWatcher(parent.GetChannelType(), &parent);\n parent.connect(watcher,\n SIGNAL(finished(QDBusPendingCallWatcher*)),\n SLOT(gotChannelType(QDBusPendingCallWatcher*)));\n }\n\n void introspectMainFallbackHandle()\n {\n debug() << \"Calling Channel::GetHandle()\";\n QDBusPendingCallWatcher* watcher =\n new QDBusPendingCallWatcher(parent.GetHandle(), &parent);\n parent.connect(watcher,\n SIGNAL(finished(QDBusPendingCallWatcher*)),\n SLOT(gotHandle(QDBusPendingCallWatcher*)));\n }\n\n void introspectMainFallbackInterfaces()\n {\n debug() << \"Calling Channel::GetInterfaces()\";\n QDBusPendingCallWatcher* watcher =\n new QDBusPendingCallWatcher(parent.GetInterfaces(), &parent);\n parent.connect(watcher,\n SIGNAL(finished(QDBusPendingCallWatcher*)),\n SLOT(gotInterfaces(QDBusPendingCallWatcher*)));\n }\n\n void continueIntrospection()\n {\n if (introspectQueue.isEmpty()) {\n if (readiness < ReadinessFull)\n changeReadiness(ReadinessFull);\n } else {\n (this->*introspectQueue.dequeue())();\n }\n }\n\n void nowHaveInterfaces()\n {\n debug() << \"Channel has\" << interfaces.size() << \"optional interfaces:\" << interfaces;\n\n for (QStringList::const_iterator i = interfaces.begin();\n i != interfaces.end();\n ++i) {\n \/\/ Enqueue introspection of any optional interfaces here\n }\n\n continueIntrospection();\n }\n\n void changeReadiness(Readiness newReadiness)\n {\n Q_ASSERT(newReadiness != readiness);\n\n switch (readiness) {\n case ReadinessJustCreated:\n break;\n case ReadinessFull:\n Q_ASSERT(newReadiness == ReadinessDead);\n break;\n case ReadinessDead:\n default:\n Q_ASSERT(false);\n break;\n }\n\n debug() << \"Channel readiness changed from\" << readiness << \"to\" << newReadiness;\n\n if (newReadiness == ReadinessFull) {\n debug() << \"Channel fully ready\";\n debug() << \" Channel type\" << channelType;\n debug() << \" Target handle\" << targetHandle;\n debug() << \" Target handle type\" << targetHandleType;\n } else {\n debug() << \"R.I.P. Channel.\";\n }\n\n readiness = newReadiness;\n emit parent.readinessChanged(newReadiness);\n }\n};\n\nChannel::Channel(const QString& serviceName,\n const QString& objectPath,\n QObject* parent)\n : ChannelInterface(serviceName, objectPath, parent),\n mPriv(new Private(*this))\n{\n}\n\nChannel::Channel(const QDBusConnection& connection,\n const QString& serviceName,\n const QString& objectPath,\n QObject* parent)\n : ChannelInterface(connection, serviceName, objectPath, parent),\n mPriv(new Private(*this))\n{\n}\n\nChannel::~Channel()\n{\n delete mPriv;\n}\n\nChannel::Readiness Channel::readiness() const\n{\n return mPriv->readiness;\n}\n\nQStringList Channel::interfaces() const\n{\n return mPriv->interfaces;\n}\n\nQString Channel::channelType() const\n{\n return mPriv->channelType;\n}\n\nuint Channel::targetHandleType() const\n{\n return mPriv->targetHandleType;\n}\n\nuint Channel::targetHandle() const\n{\n return mPriv->targetHandle;\n}\n\nvoid Channel::gotMainProperties(QDBusPendingCallWatcher* watcher)\n{\n QDBusPendingReply<QVariantMap> reply = *watcher;\n QVariantMap props;\n\n if (!reply.isError())\n props = reply.value();\n\n QList<bool> conditions;\n\n conditions << (props.size() >= 4);\n conditions << (props.contains(\"ChannelType\") && !qdbus_cast<QString>(props[\"ChannelType\"]).isEmpty());\n conditions << props.contains(\"Interfaces\");\n conditions << props.contains(\"TargetHandle\");\n conditions << props.contains(\"TargetHandleType\");\n\n if (conditions.contains(false)) {\n if (reply.isError())\n warning().nospace() << \"Properties::GetAll(Channel) failed with \" << reply.error().name() << \": \" << reply.error().message();\n else\n warning() << \"Reply to Properties::GetAll(Channel) didn't contain the expected properties\";\n\n warning() << \"Assuming a pre-0.17.7-spec service, falling back to serial inspection\";\n\n mPriv->introspectQueue.enqueue(&Private::introspectMainFallbackChannelType);\n mPriv->introspectQueue.enqueue(&Private::introspectMainFallbackHandle);\n mPriv->introspectQueue.enqueue(&Private::introspectMainFallbackInterfaces);\n\n mPriv->continueIntrospection();\n return;\n }\n\n debug() << \"Got reply to Properties::GetAll(Channel)\";\n mPriv->channelType = qdbus_cast<QString>(props[\"ChannelType\"]);\n mPriv->interfaces = qdbus_cast<QStringList>(props[\"Interfaces\"]);\n mPriv->targetHandle = qdbus_cast<uint>(props[\"TargetHandle\"]);\n mPriv->targetHandleType = qdbus_cast<uint>(props[\"TargetHandleType\"]);\n mPriv->nowHaveInterfaces();\n}\n\nvoid Channel::gotChannelType(QDBusPendingCallWatcher* watcher)\n{\n QDBusPendingReply<QString> reply = *watcher;\n\n if (reply.isError()) {\n warning().nospace() << \"Channel::GetChannelType() failed with \" << reply.error().name() << \": \" << reply.error().message() << \", Channel officially dead\";\n if (mPriv->readiness != ReadinessDead)\n mPriv->changeReadiness(ReadinessDead);\n return;\n }\n\n debug() << \"Got reply to fallback Channel::GetChannelType()\";\n mPriv->channelType = reply.value();\n mPriv->continueIntrospection();\n}\n\nvoid Channel::gotHandle(QDBusPendingCallWatcher* watcher)\n{\n QDBusPendingReply<uint, uint> reply = *watcher;\n\n if (reply.isError()) {\n warning().nospace() << \"Channel::GetHandle() failed with \" << reply.error().name() << \": \" << reply.error().message() << \", Channel officially dead\";\n if (mPriv->readiness != ReadinessDead)\n mPriv->changeReadiness(ReadinessDead);\n return;\n }\n\n debug() << \"Got reply to fallback Channel::GetHandle()\";\n mPriv->targetHandleType = reply.argumentAt<0>();\n mPriv->targetHandle = reply.argumentAt<1>();\n mPriv->continueIntrospection();\n}\n\nvoid Channel::gotInterfaces(QDBusPendingCallWatcher* watcher)\n{\n QDBusPendingReply<QStringList> reply = *watcher;\n\n if (reply.isError()) {\n warning().nospace() << \"Channel::GetInterfaces() failed with \" << reply.error().name() << \": \" << reply.error().message() << \", Channel officially dead\";\n if (mPriv->readiness != ReadinessDead)\n mPriv->changeReadiness(ReadinessDead);\n return;\n }\n\n debug() << \"Got reply to fallback Channel::GetInterfaces()\";\n mPriv->interfaces = reply.value();\n mPriv->nowHaveInterfaces();\n}\n\nvoid Channel::onClosed()\n{\n debug() << \"Got Channel::Closed\";\n\n if (mPriv->readiness != ReadinessDead)\n mPriv->changeReadiness(ReadinessDead);\n}\n\n}\n}\n<commit_msg>Will-review #1: Change the property checking to be a) more clear b) better scalable to new properties<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 \"cli-channel.h\"\n\n#include \"_gen\/cli-channel-body.hpp\"\n#include \"_gen\/cli-channel.moc.hpp\"\n#include \"cli-channel.moc.hpp\"\n\n#include <QQueue>\n\n#include \"cli-dbus.h\"\n#include \"constants.h\"\n#include \"debug-internal.hpp\"\n\nnamespace Telepathy\n{\nnamespace Client\n{\n\nstruct Channel::Private\n{\n \/\/ Public object\n Channel& parent;\n\n \/\/ Optional interface proxies\n DBus::PropertiesInterface* properties;\n\n \/\/ Introspection\n Readiness readiness;\n QStringList interfaces;\n QQueue<void (Private::*)()> introspectQueue;\n\n \/\/ Introspected properties\n QString channelType;\n uint targetHandleType;\n uint targetHandle;\n\n Private(Channel& parent)\n : parent(parent)\n {\n debug() << \"Creating new Channel\";\n\n properties = 0;\n readiness = ReadinessJustCreated;\n\n debug() << \"Connecting to Channel::Closed()\";\n parent.connect(&parent,\n SIGNAL(Closed()),\n SLOT(onClosed()));\n\n introspectQueue.enqueue(&Private::introspectMain);\n continueIntrospection();\n }\n\n void introspectMain()\n {\n if (!properties) {\n properties = parent.propertiesInterface();\n Q_ASSERT(properties != 0);\n }\n\n debug() << \"Calling Properties::GetAll(Channel)\";\n QDBusPendingCallWatcher* watcher =\n new QDBusPendingCallWatcher(\n properties->GetAll(TELEPATHY_INTERFACE_CHANNEL), &parent);\n parent.connect(watcher,\n SIGNAL(finished(QDBusPendingCallWatcher*)),\n SLOT(gotMainProperties(QDBusPendingCallWatcher*)));\n }\n\n void introspectMainFallbackChannelType()\n {\n debug() << \"Calling Channel::GetChannelType()\";\n QDBusPendingCallWatcher* watcher =\n new QDBusPendingCallWatcher(parent.GetChannelType(), &parent);\n parent.connect(watcher,\n SIGNAL(finished(QDBusPendingCallWatcher*)),\n SLOT(gotChannelType(QDBusPendingCallWatcher*)));\n }\n\n void introspectMainFallbackHandle()\n {\n debug() << \"Calling Channel::GetHandle()\";\n QDBusPendingCallWatcher* watcher =\n new QDBusPendingCallWatcher(parent.GetHandle(), &parent);\n parent.connect(watcher,\n SIGNAL(finished(QDBusPendingCallWatcher*)),\n SLOT(gotHandle(QDBusPendingCallWatcher*)));\n }\n\n void introspectMainFallbackInterfaces()\n {\n debug() << \"Calling Channel::GetInterfaces()\";\n QDBusPendingCallWatcher* watcher =\n new QDBusPendingCallWatcher(parent.GetInterfaces(), &parent);\n parent.connect(watcher,\n SIGNAL(finished(QDBusPendingCallWatcher*)),\n SLOT(gotInterfaces(QDBusPendingCallWatcher*)));\n }\n\n void continueIntrospection()\n {\n if (introspectQueue.isEmpty()) {\n if (readiness < ReadinessFull)\n changeReadiness(ReadinessFull);\n } else {\n (this->*introspectQueue.dequeue())();\n }\n }\n\n void extract01777MainProps(const QVariantMap& props)\n {\n bool haveProps = props.size() >= 4\n && props.contains(\"ChannelType\") && !qdbus_cast<QString>(props[\"ChannelType\"]).isEmpty()\n && props.contains(\"Interfaces\")\n && props.contains(\"TargetHandle\")\n && props.contains(\"TargetHandleType\");\n\n if (!haveProps) {\n warning() << \"No properties expected from a post-0.17.7 spec service in reply to Properties::GetAll(Channel), falling back to serial inspection\";\n\n introspectQueue.enqueue(&Private::introspectMainFallbackChannelType);\n introspectQueue.enqueue(&Private::introspectMainFallbackHandle);\n introspectQueue.enqueue(&Private::introspectMainFallbackInterfaces);\n } else {\n debug() << \" Found properties specified in 0.17.7\";\n\n channelType = qdbus_cast<QString>(props[\"ChannelType\"]);\n interfaces = qdbus_cast<QStringList>(props[\"Interfaces\"]);\n targetHandle = qdbus_cast<uint>(props[\"TargetHandle\"]);\n targetHandleType = qdbus_cast<uint>(props[\"TargetHandleType\"]);\n\n nowHaveInterfaces();\n }\n }\n\n void nowHaveInterfaces()\n {\n debug() << \"Channel has\" << interfaces.size() << \"optional interfaces:\" << interfaces;\n\n for (QStringList::const_iterator i = interfaces.begin();\n i != interfaces.end();\n ++i) {\n \/\/ Enqueue introspection of any optional interfaces here\n }\n }\n\n void changeReadiness(Readiness newReadiness)\n {\n Q_ASSERT(newReadiness != readiness);\n\n switch (readiness) {\n case ReadinessJustCreated:\n break;\n case ReadinessFull:\n Q_ASSERT(newReadiness == ReadinessDead);\n break;\n case ReadinessDead:\n default:\n Q_ASSERT(false);\n break;\n }\n\n debug() << \"Channel readiness changed from\" << readiness << \"to\" << newReadiness;\n\n if (newReadiness == ReadinessFull) {\n debug() << \"Channel fully ready\";\n debug() << \" Channel type\" << channelType;\n debug() << \" Target handle\" << targetHandle;\n debug() << \" Target handle type\" << targetHandleType;\n } else {\n debug() << \"R.I.P. Channel.\";\n }\n\n readiness = newReadiness;\n emit parent.readinessChanged(newReadiness);\n }\n};\n\nChannel::Channel(const QString& serviceName,\n const QString& objectPath,\n QObject* parent)\n : ChannelInterface(serviceName, objectPath, parent),\n mPriv(new Private(*this))\n{\n}\n\nChannel::Channel(const QDBusConnection& connection,\n const QString& serviceName,\n const QString& objectPath,\n QObject* parent)\n : ChannelInterface(connection, serviceName, objectPath, parent),\n mPriv(new Private(*this))\n{\n}\n\nChannel::~Channel()\n{\n delete mPriv;\n}\n\nChannel::Readiness Channel::readiness() const\n{\n return mPriv->readiness;\n}\n\nQStringList Channel::interfaces() const\n{\n return mPriv->interfaces;\n}\n\nQString Channel::channelType() const\n{\n return mPriv->channelType;\n}\n\nuint Channel::targetHandleType() const\n{\n return mPriv->targetHandleType;\n}\n\nuint Channel::targetHandle() const\n{\n return mPriv->targetHandle;\n}\n\nvoid Channel::gotMainProperties(QDBusPendingCallWatcher* watcher)\n{\n QDBusPendingReply<QVariantMap> reply = *watcher;\n QVariantMap props;\n\n if (!reply.isError()) {\n debug() << \"Got reply to Properties::GetAll(Channel)\";\n props = reply.value();\n } else {\n warning().nospace() << \"Properties::GetAll(Channel) failed with \" << reply.error().name() << \": \" << reply.error().message();\n }\n\n mPriv->extract01777MainProps(props);\n \/\/ Add extraction (and possible fallbacks) in similar functions, called from here\n\n mPriv->continueIntrospection();\n}\n\nvoid Channel::gotChannelType(QDBusPendingCallWatcher* watcher)\n{\n QDBusPendingReply<QString> reply = *watcher;\n\n if (reply.isError()) {\n warning().nospace() << \"Channel::GetChannelType() failed with \" << reply.error().name() << \": \" << reply.error().message() << \", Channel officially dead\";\n if (mPriv->readiness != ReadinessDead)\n mPriv->changeReadiness(ReadinessDead);\n return;\n }\n\n debug() << \"Got reply to fallback Channel::GetChannelType()\";\n mPriv->channelType = reply.value();\n mPriv->continueIntrospection();\n}\n\nvoid Channel::gotHandle(QDBusPendingCallWatcher* watcher)\n{\n QDBusPendingReply<uint, uint> reply = *watcher;\n\n if (reply.isError()) {\n warning().nospace() << \"Channel::GetHandle() failed with \" << reply.error().name() << \": \" << reply.error().message() << \", Channel officially dead\";\n if (mPriv->readiness != ReadinessDead)\n mPriv->changeReadiness(ReadinessDead);\n return;\n }\n\n debug() << \"Got reply to fallback Channel::GetHandle()\";\n mPriv->targetHandleType = reply.argumentAt<0>();\n mPriv->targetHandle = reply.argumentAt<1>();\n mPriv->continueIntrospection();\n}\n\nvoid Channel::gotInterfaces(QDBusPendingCallWatcher* watcher)\n{\n QDBusPendingReply<QStringList> reply = *watcher;\n\n if (reply.isError()) {\n warning().nospace() << \"Channel::GetInterfaces() failed with \" << reply.error().name() << \": \" << reply.error().message() << \", Channel officially dead\";\n if (mPriv->readiness != ReadinessDead)\n mPriv->changeReadiness(ReadinessDead);\n return;\n }\n\n debug() << \"Got reply to fallback Channel::GetInterfaces()\";\n mPriv->interfaces = reply.value();\n mPriv->nowHaveInterfaces();\n mPriv->continueIntrospection();\n}\n\nvoid Channel::onClosed()\n{\n debug() << \"Got Channel::Closed\";\n\n if (mPriv->readiness != ReadinessDead)\n mPriv->changeReadiness(ReadinessDead);\n}\n\n}\n}\n<|endoftext|>"} {"text":"<commit_before>#include <cassert>\n#include <iostream>\n\n\n\n#include <util\/PlatformUtils.hpp>\n#include <util\/Mutexes.hpp>\n\n\n\n#include <PlatformSupport\/DOMStringHelper.hpp>\n#include <PlatformSupport\/XalanFileOutputStream.hpp>\n#include <PlatformSupport\/XalanOutputStreamPrintWriter.hpp>\n\n\n\n#include <XalanSourceTree\/XalanSourceTreeDOMSupport.hpp>\n#include <XalanSourceTree\/XalanSourceTreeParserLiaison.hpp>\n\n\n\n#include <XPath\/XObjectFactoryDefault.hpp>\n#include <XPath\/XPathFactoryDefault.hpp>\n\n\n\n#include <XSLT\/StylesheetConstructionContextDefault.hpp>\n#include <XSLT\/StylesheetExecutionContextDefault.hpp>\n#include <XSLT\/StylesheetRoot.hpp>\n#include <XSLT\/XSLTEngineImpl.hpp>\n#include <XSLT\/XSLTInit.hpp>\n#include <XSLT\/XSLTInputSource.hpp>\n#include <XSLT\/XSLTProcessorEnvSupportDefault.hpp>\n#include <XSLT\/XSLTResultTarget.hpp>\n\n\n\n#if defined(WIN32)\n\/\/This is here for the threads.\n#include <process.h>\n\n#define WIN32_LEAN_AND_MEAN\n#include <windows.h>\n#elif defined(XALAN_POSIX2_AVAILABLE)\n#include <pthread.h>\n#include <unistd.h>\n#else\n#error Unsupported platform!\n#endif\n\n\n\n#if !defined(XALAN_NO_NAMESPACES)\n\tusing std::cerr;\n\tusing std::cout;\n\tusing std::endl;\n#endif\n\n\n\t\n\/\/ This is here for memory leak testing.\n#if defined(_DEBUG)\n#include <crtdbg.h>\n#endif\n\n\/\/ Used to hold compiled stylesheet\nStylesheetRoot* glbStylesheetRoot;\n\n\nclass SynchronizedCounter\n{\npublic:\n\n\tSynchronizedCounter();\n\n\t~SynchronizedCounter();\n\n\tvoid\n\tincrement();\n\n\tvoid\n\tdecrement();\n\n\tunsigned long\n\tgetCounter() const;\n\nprivate:\n\n\tmutable XMLMutex\tm_mutex;\n\n\tunsigned long\t\tm_counter;\n};\n\n\n\nSynchronizedCounter::SynchronizedCounter() :\n\tm_mutex(),\n\tm_counter(0)\n{\n}\n\n\n\nSynchronizedCounter::~SynchronizedCounter()\n{\n}\n\n\n\nvoid\nSynchronizedCounter::increment()\n{\n\tXMLMutexLock\ttheLock(&m_mutex);\n\n\tif (m_counter < ULONG_MAX)\n\t{\n\t\t++m_counter;\n\t}\n}\n\n\n\nvoid\nSynchronizedCounter::decrement()\n{\n\tXMLMutexLock\ttheLock(&m_mutex);\n\n\tif (m_counter > 0)\n\t{\n\t\t--m_counter;\n\t}\n}\n\n\n\nunsigned long\nSynchronizedCounter::getCounter() const\n{\n\treturn m_counter;\n}\n\n\n\nstruct\nThreadInfo\n{\n\tThreadInfo(\n\t\t\tunsigned int\t\t\ttheThreadNumber,\n\t\t\tSynchronizedCounter*\ttheCounter) :\n\t\tm_threadNumber(theThreadNumber),\n\t\tm_counter(theCounter)\n\t{\n\t}\n\n\tunsigned int\t\t\tm_threadNumber;\n\n\tSynchronizedCounter*\tm_counter;\n};\n\n\n\n#if defined(WIN32)\n\nextern \"C\" void theThreadRoutine(void* param);\n\nvoid\n#elif defined(XALAN_POSIX2_AVAILABLE)\n\nextern \"C\" void* theThreadRoutine(void* param);\n\nvoid*\n#else\n#error Unsupported platform!\n#endif\ntheThreadRoutine(void*\t\tparam)\n{\n\/\/ This routine uses compiled stylesheet (glbStylesheetRoot), which is set using the \n\/\/ theProcessor.setStylesheetRoot method. The transform is done using the theProcessor's\n\/\/ process() method.\n\n\tconst ThreadInfo*\ttheInfo = reinterpret_cast<const ThreadInfo*>(param);\n\n\tassert(theInfo != 0);\n\n\ttheInfo->m_counter->increment();\n\n\ttry\n\t{\n\t\t\/\/ Create the support objects that are necessary for running the processor...\n\t\tXalanSourceTreeDOMSupport\t\ttheDOMSupport;\n\t\tXalanSourceTreeParserLiaison\ttheParserLiaison(theDOMSupport);\n\n\t\ttheDOMSupport.setParserLiaison(&theParserLiaison);\n\t\t\/\/ The default is that documents are not thread-safe. Set this to\n\t\t\/\/ true so they are.\n\t\t\/\/theParserLiaison.setThreadSafe(true);\n\n\t\tXSLTProcessorEnvSupportDefault\ttheXSLTProcessorEnvSupport;\n\t\tXObjectFactoryDefault\t\t\ttheXObjectFactory;\n\t\tXPathFactoryDefault\t\t\t\ttheXPathFactory;\n\n\t\t\/\/ Create a processor...and output start message.\n\t\tXSLTEngineImpl\ttheProcessor(\n\t\t\t\t\t\ttheParserLiaison,\n\t\t\t\t\t\ttheXSLTProcessorEnvSupport,\n\t\t\t\t\t\ttheDOMSupport,\n\t\t\t\t\t\ttheXObjectFactory,\n\t\t\t\t\t\ttheXPathFactory);\n\n\t\t\/\/ Connect the processor to the support object...\n\t\ttheXSLTProcessorEnvSupport.setProcessor(&theProcessor);\n\n\t\t\/\/ The execution context uses the same factory support objects as\n\t\t\/\/ the processor, since those objects have the same lifetime as\n\t\t\/\/ other objects created as a result of the execution.\n\t\tStylesheetExecutionContextDefault\tssExecutionContext(\n\t\t\t\t\t\t\ttheProcessor,\n\t\t\t\t\t\t\ttheXSLTProcessorEnvSupport,\n\t\t\t\t\t\t\ttheDOMSupport,\n\t\t\t\t\t\t\ttheXObjectFactory);\n\n\t\t\/\/ Our input files. The assumption is that the executable will be run\n\t\t\/\/ from same directory as the input files.\n\n\t\t\/\/ Generate the input and output file names.\n\t\tconst XalanDOMString\ttheXMLfile(\"birds.xml\");\n\n\t\tconst XalanDOMString\ttheOutputFile(\n\t\t\t\tXalanDOMString(\"birds\") +\n\t\t\t\tUnsignedLongToDOMString(theInfo->m_threadNumber) +\n\t\t\t\tXalanDOMString(\".out\"));\n\n\t\t\/\/Generate the XML input and output objects.\n\t\tXSLTInputSource\t\ttheInputSource(c_wstr(theXMLfile));\n\t\tXSLTResultTarget\ttheResultTarget(theOutputFile);\n\n\t\t\/\/ Set the stylesheet to be the compiled stylesheet. Then do the transform. \n\t\t\/\/ Report both the start of the transform and end of the thread.\n\t\ttheProcessor.setStylesheetRoot(glbStylesheetRoot);\n\t\ttheProcessor.process(theInputSource,theResultTarget,ssExecutionContext);\n\t}\n\tcatch(...)\n\t{\n\t}\n\n\t\/\/ Decrement the counter because we're done...\n\ttheInfo->m_counter->decrement();\n\n#if defined(XALAN_POSIX2_AVAILABLE)\n\treturn 0;\n#endif\n}\n\n\n\ninline void\ndoSleep(unsigned int\ttheMilliseconds)\n{\n#if defined(WIN32)\n\tSleep(theMilliseconds);\n#elif defined(XALAN_POSIX2_AVAILABLE)\n\tusleep(theMilliseconds * 10);\n#else\n#error Unsupported platform!\n#endif\n}\n\n\n\nvoid\ndoThreads(long\ttheThreadCount)\n{\n\tcout << endl << \"Starting \" << theThreadCount << \" threads.\" << endl;\n\n\ttypedef std::vector<ThreadInfo>\t\tThreadInfoVectorType;\n\n\tThreadInfoVectorType\ttheThreadInfo;\n\n\ttheThreadInfo.reserve(theThreadCount);\n\n\ttry\n\t{\n\t\tcout << endl << \"Clock before starting threads: \" << clock() << endl;\n\n\t\tSynchronizedCounter\t\ttheCounter;\n\n\t\tfor (long i = 0; i < theThreadCount; i++)\n\t\t{\n\t\t\ttheThreadInfo.push_back(ThreadInfoVectorType::value_type(i, &theCounter));\n\n#if defined(WIN32)\n\n\t\t\tconst unsigned long\t\ttheThreadID =\n\t\t\t\t\t_beginthread(theThreadRoutine, 4096, reinterpret_cast<LPVOID>(&theThreadInfo.back()));\n\n\t\t\tif (theThreadID == unsigned(-1))\n\t\t\t{\n\t\t\t\tcerr << endl << \"Unable to create thread number \" << i + 1 << \".\" << endl;\n\t\t\t}\n\n#elif defined(XALAN_POSIX2_AVAILABLE)\n\n\t\t\tpthread_t\ttheThread;\n\n\t\t\tconst int\ttheResult = pthread_create(&theThread, 0, theThreadRoutine, (void*)&theThreadInfo.back());\n\n\t\t\tif (theResult != 0)\n\t\t\t{\n\t\t\t\tcerr << endl << \"Unable to create thread number \" << i + 1 << \".\" << endl;\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\tpthread_detach(theThread);\n\t\t\t}\n#else\n#error Unsupported platform!\n#endif\n\t\t}\n\n\t\tclock_t\t\ttheClock = 0;\n\n\t\tif (theThreadInfo.size() == 0)\n\t\t{\n\t\t\tcerr << endl << \"No threads were created!\" << endl;\n\t\t}\n\t\telse\n\t\t{\n\t\t\tunsigned int\ttheCheckCount = 0;\n\n\t\t\tdo\n\t\t\t{\n\t\t\t\tdoSleep(2000);\n\n\t\t\t\t\/\/ Check a couple of times, just in case, since\n\t\t\t\t\/\/ getCounter() is not synchronized...\n\t\t\t\tif (theCounter.getCounter() == 0)\n\t\t\t\t{\n\t\t\t\t\tif (theCheckCount == 0)\n\t\t\t\t\t{\n\t\t\t\t\t\ttheClock = clock();\n\t\t\t\t\t}\n\n\t\t\t\t\t++theCheckCount;\n\t\t\t\t}\n\t\t\t}\n\t\t\twhile(theCheckCount < 2);\n\t\t}\n\n\t\tcout << endl << \"Clock after threads: \" << theClock << endl;\n\t}\n\tcatch(...)\n\t{\n\t\tcerr << \"Exception caught!!!\"\n\t\t\t << endl\n\t\t\t<< endl;\n\t}\n}\n\n\nint\nmain(\n\t\t\tint\t\t\t\targc,\n\t\t\tconst char*\t\targv[])\n{\n#if !defined(NDEBUG) && defined(_MSC_VER)\n\t_CrtSetDbgFlag(_CrtSetDbgFlag(_CRTDBG_REPORT_FLAG) | _CRTDBG_LEAK_CHECK_DF);\n\n\t_CrtSetReportMode(_CRT_WARN, _CRTDBG_MODE_FILE);\n\t_CrtSetReportFile(_CRT_WARN, _CRTDBG_FILE_STDERR);\n#endif\n\n\tif (argc > 2)\n\t{\n\t\tcerr << \"Usage: ThreadTest\"\n\t\t\t << endl\n\t\t\t << endl;\n\t}\n\telse\n\t{\n\t\tint\tthreadCount = 60;\n\n\t\tif (argc == 2)\n\t\t{\n\t\t\tthreadCount = atoi(argv[1]);\n\t\t}\n\n\t\ttry\n\t\t{\n\t\t \/\/ Call the static initializers...\n\t\t XMLPlatformUtils::Initialize();\n { \n\t\t\tXSLTInit\ttheInit;\n\n\t\t\t\/\/ Create the necessary stuff of compile the stylesheet.\n\t\t\tXercesDOMSupport\t\t\t\tssDOMSupport;\n\t\t\tXercesParserLiaison\t\t\t\tssParserLiaison(ssDOMSupport);\n\t\t\tXSLTProcessorEnvSupportDefault\tssXSLTProcessorEnvSupport;\n\t\t\tXObjectFactoryDefault\t\t\tssXObjectFactory;\n\t\t\tXPathFactoryDefault\t\t\t\tssXPathFactory;\n\n\t\t\t\/\/ Create a processor to compile the stylesheet...\n\t\t\tXSLTEngineImpl\tssProcessor(\n\t\t\t\t\tssParserLiaison,\n\t\t\t\t\tssXSLTProcessorEnvSupport,\n\t\t\t\t\tssDOMSupport,\n\t\t\t\t\tssXObjectFactory,\n\t\t\t\t\tssXPathFactory);\n\n\t\t\t\/\/ Create separate factory support objects so the stylesheet's\n\t\t\t\/\/ factory-created XObject and XPath instances are independent \n\t\t\t\/\/ from processor's.\n\t\t\tXPathFactoryDefault\t\tssStylesheetXPathFactory;\n\n\t\t\t\/\/ Create a stylesheet construction context, using the\n\t\t\t\/\/ stylesheet's factory support objects.\n\t\t\tStylesheetConstructionContextDefault\tssConstructionContext(\n\t\t\t\t\t\t\t\t\t\t\t\t\tssProcessor,\n\t\t\t\t\t\t\t\t\t\t\t\t\tssXSLTProcessorEnvSupport,\n\t\t\t\t\t\t\t\t\t\t\t\t\tssStylesheetXPathFactory);\n\n\t\t\tconst XalanDOMString theXSLFileName(\"birds.xsl\");\n\t\t\tconst XalanDOMString theXMLFileName(\"birds.xml\");\n\n\t\t\t\/\/ Our stylesheet input source...\n\t\t\tXSLTInputSource\t\tssStylesheetSourceXSL(c_wstr(theXSLFileName));\n\t\t\tXSLTInputSource\t\tssStylesheetSourceXML(c_wstr(theXMLFileName));\n\n\t\t\t\/\/ Ask the processor to create a StylesheetRoot for the specified\n\t\t\t\/\/ input XSL. This is the compiled stylesheet. We don't have to\n\t\t\t\/\/ delete it, since it is owned by the StylesheetConstructionContext\n\t\t\t\/\/ instance.\n\n\t\t\tglbStylesheetRoot = ssProcessor.processStylesheet(ssStylesheetSourceXSL,\n\t\t\t\t\t\t\t\t\t\t\t\t\t ssConstructionContext);\n\t\t\tassert(glbStylesheetRoot != 0);\n\t\t\t\n\n\t\t\tdoThreads(threadCount);\n\t\t }\n\n\t\tXMLPlatformUtils::Terminate();\n\n\t\t}\n\n\t\tcatch(...)\n\t\t{\n\t\t\tcerr << \"Exception caught!!!\"\n\t\t\t\t << endl\n\t\t\t\t << endl;\n\t\t}\n\n\t} \n\n\treturn 0;\n}\n<commit_msg>Updates for HP.<commit_after>\/\/ Base header file. Must be first.\n#include <Include\/PlatformDefinitions.hpp>\n\n\n\n#include <cassert>\n\n\n\n#if defined(XALAN_OLD_STREAM_HEADERS)\n#include <iostream.h>\n#else\n#include <iostream>\n#endif\n\n\n\n#include <util\/PlatformUtils.hpp>\n#include <util\/Mutexes.hpp>\n\n\n\n#include <PlatformSupport\/DOMStringHelper.hpp>\n#include <PlatformSupport\/XalanFileOutputStream.hpp>\n#include <PlatformSupport\/XalanOutputStreamPrintWriter.hpp>\n\n\n\n#include <XalanSourceTree\/XalanSourceTreeDOMSupport.hpp>\n#include <XalanSourceTree\/XalanSourceTreeParserLiaison.hpp>\n\n\n\n#include <XPath\/XObjectFactoryDefault.hpp>\n#include <XPath\/XPathFactoryDefault.hpp>\n\n\n\n#include <XSLT\/StylesheetConstructionContextDefault.hpp>\n#include <XSLT\/StylesheetExecutionContextDefault.hpp>\n#include <XSLT\/StylesheetRoot.hpp>\n#include <XSLT\/XSLTEngineImpl.hpp>\n#include <XSLT\/XSLTInit.hpp>\n#include <XSLT\/XSLTInputSource.hpp>\n#include <XSLT\/XSLTProcessorEnvSupportDefault.hpp>\n#include <XSLT\/XSLTResultTarget.hpp>\n\n\n\n#if defined(WIN32)\n\/\/This is here for the threads.\n#include <process.h>\n\n#define WIN32_LEAN_AND_MEAN\n#include <windows.h>\n#elif defined(XALAN_POSIX2_AVAILABLE)\n#include <pthread.h>\n#include <unistd.h>\n#else\n#error Unsupported platform!\n#endif\n\n\n\n#if !defined(XALAN_NO_NAMESPACES)\n\tusing std::cerr;\n\tusing std::cout;\n\tusing std::endl;\n\tusing std::vector;\n#endif\n\n\n\t\n\/\/ This is here for memory leak testing.\n#if defined(_DEBUG)\n#include <crtdbg.h>\n#endif\n\n\/\/ Used to hold compiled stylesheet\nStylesheetRoot* glbStylesheetRoot;\n\n\nclass SynchronizedCounter\n{\npublic:\n\n\tSynchronizedCounter();\n\n\t~SynchronizedCounter();\n\n\tvoid\n\tincrement();\n\n\tvoid\n\tdecrement();\n\n\tunsigned long\n\tgetCounter() const;\n\nprivate:\n\n\tmutable XMLMutex\tm_mutex;\n\n\tunsigned long\t\tm_counter;\n};\n\n\n\nSynchronizedCounter::SynchronizedCounter() :\n\tm_mutex(),\n\tm_counter(0)\n{\n}\n\n\n\nSynchronizedCounter::~SynchronizedCounter()\n{\n}\n\n\n\nvoid\nSynchronizedCounter::increment()\n{\n\tXMLMutexLock\ttheLock(&m_mutex);\n\n\tif (m_counter < ULONG_MAX)\n\t{\n\t\t++m_counter;\n\t}\n}\n\n\n\nvoid\nSynchronizedCounter::decrement()\n{\n\tXMLMutexLock\ttheLock(&m_mutex);\n\n\tif (m_counter > 0)\n\t{\n\t\t--m_counter;\n\t}\n}\n\n\n\nunsigned long\nSynchronizedCounter::getCounter() const\n{\n\treturn m_counter;\n}\n\n\n\nstruct\nThreadInfo\n{\n\tThreadInfo(\n\t\t\tunsigned int\t\t\ttheThreadNumber,\n\t\t\tSynchronizedCounter*\ttheCounter) :\n\t\tm_threadNumber(theThreadNumber),\n\t\tm_counter(theCounter)\n\t{\n\t}\n\n\tunsigned int\t\t\tm_threadNumber;\n\n\tSynchronizedCounter*\tm_counter;\n};\n\n\n\n#if defined(WIN32)\n\nextern \"C\" void theThreadRoutine(void* param);\n\nvoid\n#elif defined(XALAN_POSIX2_AVAILABLE)\n\nextern \"C\" void* theThreadRoutine(void* param);\n\nvoid*\n#else\n#error Unsupported platform!\n#endif\ntheThreadRoutine(void*\t\tparam)\n{\n\/\/ This routine uses compiled stylesheet (glbStylesheetRoot), which is set using the \n\/\/ theProcessor.setStylesheetRoot method. The transform is done using the theProcessor's\n\/\/ process() method.\n\n\tconst ThreadInfo*\ttheInfo = reinterpret_cast<const ThreadInfo*>(param);\n\n\tassert(theInfo != 0);\n\n\ttheInfo->m_counter->increment();\n\n\ttry\n\t{\n\t\t\/\/ Create the support objects that are necessary for running the processor...\n\t\tXalanSourceTreeDOMSupport\t\ttheDOMSupport;\n\t\tXalanSourceTreeParserLiaison\ttheParserLiaison(theDOMSupport);\n\n\t\ttheDOMSupport.setParserLiaison(&theParserLiaison);\n\t\t\/\/ The default is that documents are not thread-safe. Set this to\n\t\t\/\/ true so they are.\n\t\t\/\/theParserLiaison.setThreadSafe(true);\n\n\t\tXSLTProcessorEnvSupportDefault\ttheXSLTProcessorEnvSupport;\n\t\tXObjectFactoryDefault\t\t\ttheXObjectFactory;\n\t\tXPathFactoryDefault\t\t\t\ttheXPathFactory;\n\n\t\t\/\/ Create a processor...and output start message.\n\t\tXSLTEngineImpl\ttheProcessor(\n\t\t\t\t\t\ttheParserLiaison,\n\t\t\t\t\t\ttheXSLTProcessorEnvSupport,\n\t\t\t\t\t\ttheDOMSupport,\n\t\t\t\t\t\ttheXObjectFactory,\n\t\t\t\t\t\ttheXPathFactory);\n\n\t\t\/\/ Connect the processor to the support object...\n\t\ttheXSLTProcessorEnvSupport.setProcessor(&theProcessor);\n\n\t\t\/\/ The execution context uses the same factory support objects as\n\t\t\/\/ the processor, since those objects have the same lifetime as\n\t\t\/\/ other objects created as a result of the execution.\n\t\tStylesheetExecutionContextDefault\tssExecutionContext(\n\t\t\t\t\t\t\ttheProcessor,\n\t\t\t\t\t\t\ttheXSLTProcessorEnvSupport,\n\t\t\t\t\t\t\ttheDOMSupport,\n\t\t\t\t\t\t\ttheXObjectFactory);\n\n\t\t\/\/ Our input files. The assumption is that the executable will be run\n\t\t\/\/ from same directory as the input files.\n\n\t\t\/\/ Generate the input and output file names.\n\t\tconst XalanDOMString\ttheXMLfile(\"birds.xml\");\n\n\t\tconst XalanDOMString\ttheOutputFile(\n\t\t\t\tXalanDOMString(\"birds\") +\n\t\t\t\tUnsignedLongToDOMString(theInfo->m_threadNumber) +\n\t\t\t\tXalanDOMString(\".out\"));\n\n\t\t\/\/Generate the XML input and output objects.\n\t\tXSLTInputSource\t\ttheInputSource(c_wstr(theXMLfile));\n\t\tXSLTResultTarget\ttheResultTarget(theOutputFile);\n\n\t\t\/\/ Set the stylesheet to be the compiled stylesheet. Then do the transform. \n\t\t\/\/ Report both the start of the transform and end of the thread.\n\t\ttheProcessor.setStylesheetRoot(glbStylesheetRoot);\n\t\ttheProcessor.process(theInputSource,theResultTarget,ssExecutionContext);\n\t}\n\tcatch(...)\n\t{\n\t}\n\n\t\/\/ Decrement the counter because we're done...\n\ttheInfo->m_counter->decrement();\n\n#if defined(XALAN_POSIX2_AVAILABLE)\n\treturn 0;\n#endif\n}\n\n\n\ninline void\ndoSleep(unsigned int\ttheMilliseconds)\n{\n#if defined(WIN32)\n\tSleep(theMilliseconds);\n#elif defined(XALAN_POSIX2_AVAILABLE)\n\tusleep(theMilliseconds * 10);\n#else\n#error Unsupported platform!\n#endif\n}\n\n\n\nvoid\ndoThreads(long\ttheThreadCount)\n{\n\tcout << endl << \"Starting \" << theThreadCount << \" threads.\" << endl;\n\n\ttypedef vector<ThreadInfo>\t\tThreadInfoVectorType;\n\n\tThreadInfoVectorType\ttheThreadInfo;\n\n\ttheThreadInfo.reserve(theThreadCount);\n\n\ttry\n\t{\n\t\tcout << endl << \"Clock before starting threads: \" << clock() << endl;\n\n\t\tSynchronizedCounter\t\ttheCounter;\n\n\t\tfor (long i = 0; i < theThreadCount; i++)\n\t\t{\n\t\t\ttheThreadInfo.push_back(ThreadInfoVectorType::value_type(i, &theCounter));\n\n#if defined(WIN32)\n\n\t\t\tconst unsigned long\t\ttheThreadID =\n\t\t\t\t\t_beginthread(theThreadRoutine, 4096, reinterpret_cast<LPVOID>(&theThreadInfo.back()));\n\n\t\t\tif (theThreadID == unsigned(-1))\n\t\t\t{\n\t\t\t\tcerr << endl << \"Unable to create thread number \" << i + 1 << \".\" << endl;\n\t\t\t}\n\n#elif defined(XALAN_POSIX2_AVAILABLE)\n\n\t\t\tpthread_t\ttheThread;\n\n\t\t\tconst int\ttheResult = pthread_create(&theThread, 0, theThreadRoutine, (void*)&theThreadInfo.back());\n\n\t\t\tif (theResult != 0)\n\t\t\t{\n\t\t\t\tcerr << endl << \"Unable to create thread number \" << i + 1 << \".\" << endl;\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\tpthread_detach(theThread);\n\t\t\t}\n#else\n#error Unsupported platform!\n#endif\n\t\t}\n\n\t\tclock_t\t\ttheClock = 0;\n\n\t\tif (theThreadInfo.size() == 0)\n\t\t{\n\t\t\tcerr << endl << \"No threads were created!\" << endl;\n\t\t}\n\t\telse\n\t\t{\n\t\t\tunsigned int\ttheCheckCount = 0;\n\n\t\t\tdo\n\t\t\t{\n\t\t\t\tdoSleep(2000);\n\n\t\t\t\t\/\/ Check a couple of times, just in case, since\n\t\t\t\t\/\/ getCounter() is not synchronized...\n\t\t\t\tif (theCounter.getCounter() == 0)\n\t\t\t\t{\n\t\t\t\t\tif (theCheckCount == 0)\n\t\t\t\t\t{\n\t\t\t\t\t\ttheClock = clock();\n\t\t\t\t\t}\n\n\t\t\t\t\t++theCheckCount;\n\t\t\t\t}\n\t\t\t}\n\t\t\twhile(theCheckCount < 2);\n\t\t}\n\n\t\tcout << endl << \"Clock after threads: \" << theClock << endl;\n\t}\n\tcatch(...)\n\t{\n\t\tcerr << \"Exception caught!!!\"\n\t\t\t << endl\n\t\t\t<< endl;\n\t}\n}\n\n\nint\nmain(\n\t\t\tint\t\t\t\targc,\n\t\t\tconst char*\t\targv[])\n{\n#if !defined(NDEBUG) && defined(_MSC_VER)\n\t_CrtSetDbgFlag(_CrtSetDbgFlag(_CRTDBG_REPORT_FLAG) | _CRTDBG_LEAK_CHECK_DF);\n\n\t_CrtSetReportMode(_CRT_WARN, _CRTDBG_MODE_FILE);\n\t_CrtSetReportFile(_CRT_WARN, _CRTDBG_FILE_STDERR);\n#endif\n\n\tif (argc > 2)\n\t{\n\t\tcerr << \"Usage: ThreadTest\"\n\t\t\t << endl\n\t\t\t << endl;\n\t}\n\telse\n\t{\n\t\tint\tthreadCount = 60;\n\n\t\tif (argc == 2)\n\t\t{\n\t\t\tthreadCount = atoi(argv[1]);\n\t\t}\n\n\t\ttry\n\t\t{\n\t\t \/\/ Call the static initializers...\n\t\t XMLPlatformUtils::Initialize();\n { \n\t\t\tXSLTInit\ttheInit;\n\n\t\t\t\/\/ Create the necessary stuff of compile the stylesheet.\n\t\t\tXercesDOMSupport\t\t\t\tssDOMSupport;\n\t\t\tXercesParserLiaison\t\t\t\tssParserLiaison(ssDOMSupport);\n\t\t\tXSLTProcessorEnvSupportDefault\tssXSLTProcessorEnvSupport;\n\t\t\tXObjectFactoryDefault\t\t\tssXObjectFactory;\n\t\t\tXPathFactoryDefault\t\t\t\tssXPathFactory;\n\n\t\t\t\/\/ Create a processor to compile the stylesheet...\n\t\t\tXSLTEngineImpl\tssProcessor(\n\t\t\t\t\tssParserLiaison,\n\t\t\t\t\tssXSLTProcessorEnvSupport,\n\t\t\t\t\tssDOMSupport,\n\t\t\t\t\tssXObjectFactory,\n\t\t\t\t\tssXPathFactory);\n\n\t\t\t\/\/ Create separate factory support objects so the stylesheet's\n\t\t\t\/\/ factory-created XObject and XPath instances are independent \n\t\t\t\/\/ from processor's.\n\t\t\tXPathFactoryDefault\t\tssStylesheetXPathFactory;\n\n\t\t\t\/\/ Create a stylesheet construction context, using the\n\t\t\t\/\/ stylesheet's factory support objects.\n\t\t\tStylesheetConstructionContextDefault\tssConstructionContext(\n\t\t\t\t\t\t\t\t\t\t\t\t\tssProcessor,\n\t\t\t\t\t\t\t\t\t\t\t\t\tssXSLTProcessorEnvSupport,\n\t\t\t\t\t\t\t\t\t\t\t\t\tssStylesheetXPathFactory);\n\n\t\t\tconst XalanDOMString theXSLFileName(\"birds.xsl\");\n\t\t\tconst XalanDOMString theXMLFileName(\"birds.xml\");\n\n\t\t\t\/\/ Our stylesheet input source...\n\t\t\tXSLTInputSource\t\tssStylesheetSourceXSL(c_wstr(theXSLFileName));\n\t\t\tXSLTInputSource\t\tssStylesheetSourceXML(c_wstr(theXMLFileName));\n\n\t\t\t\/\/ Ask the processor to create a StylesheetRoot for the specified\n\t\t\t\/\/ input XSL. This is the compiled stylesheet. We don't have to\n\t\t\t\/\/ delete it, since it is owned by the StylesheetConstructionContext\n\t\t\t\/\/ instance.\n\n\t\t\tglbStylesheetRoot = ssProcessor.processStylesheet(ssStylesheetSourceXSL,\n\t\t\t\t\t\t\t\t\t\t\t\t\t ssConstructionContext);\n\t\t\tassert(glbStylesheetRoot != 0);\n\t\t\t\n\n\t\t\tdoThreads(threadCount);\n\t\t }\n\n\t\tXMLPlatformUtils::Terminate();\n\n\t\t}\n\n\t\tcatch(...)\n\t\t{\n\t\t\tcerr << \"Exception caught!!!\"\n\t\t\t\t << endl\n\t\t\t\t << endl;\n\t\t}\n\n\t} \n\n\treturn 0;\n}\n<|endoftext|>"} {"text":"<commit_before>#include <UnitTest\/stdafx.h>\n#include <UnitTest\/UnitTest.h>\n#include <core\/smartview\/block\/block.h>\n#include <core\/smartview\/block\/blockBytes.h>\n#include <core\/smartview\/block\/blockStringA.h>\n#include <core\/smartview\/block\/blockStringW.h>\n#include <core\/smartview\/block\/blockT.h>\n\nnamespace blocktest\n{\n\tTEST_CLASS(blocktest)\n\t{\n\tpublic:\n\t\t\/\/ Without this, clang gets weird\n\t\tstatic const bool dummy_var = true;\n\n\t\tTEST_CLASS_INITIALIZE(initialize) { unittest::init(); }\n\t\tTEST_METHOD(Test_block)\n\t\t{\n\t\t\tauto block1 = std::make_shared<smartview::block>(L\"test\");\n\t\t\tauto block2 = std::make_shared<smartview::block>(L\"block2\");\n\t\t\tauto block3 = std::make_shared<smartview::block>(L\"\");\n\t\t\tAssert::AreEqual(block1->isHeader(), true);\n\t\t\tblock1->setSize(5);\n\t\t\tAssert::AreEqual(block1->isHeader(), false);\n\t\t\tblock1->setOffset(6);\n\t\t\tAssert::AreEqual(block1->isHeader(), false);\n\t\t\tblock1->setSource(7);\n\n\t\t\tAssert::AreEqual(block1->getText(), std::wstring(L\"test\"));\n\t\t\tAssert::AreEqual(block1->getChildren().empty(), true);\n\t\t\tAssert::AreEqual(block1->toString(), std::wstring(L\"test\"));\n\t\t\tAssert::AreEqual(block1->getSize(), size_t(5));\n\t\t\tAssert::AreEqual(block1->getOffset(), size_t(6));\n\t\t\tAssert::AreEqual(block1->getSource(), ULONG(7));\n\n\t\t\tblock1->setText(L\"the %1!ws!\", L\"other\");\n\t\t\tAssert::AreEqual(block1->getText(), std::wstring(L\"the other\"));\n\t\t\tblock1->addHeader(L\" this %1!ws!\", L\"that\");\n\t\t\tAssert::AreEqual(block1->toString(), std::wstring(L\"the other this that\"));\n\n\t\t\tblock1->setText(L\"hello\");\n\t\t\tAssert::AreEqual(block1->getText(), std::wstring(L\"hello\"));\n\n\t\t\tblock1->setText(L\"hello %1!ws!\", L\"world\");\n\t\t\tAssert::AreEqual(block1->getText(), std::wstring(L\"hello world\"));\n\n\t\t\tblock1->terminateBlock();\n\t\t\tblock1->terminateBlock();\n\t\t\tblock1->addChild(block2);\n\t\t\tAssert::AreEqual(block1->toString(), std::wstring(L\"hello world this that\\r\\nblock2\"));\n\n\t\t\tblock1->addBlankLine();\n\t\t\tblock1->addLabeledChild(L\"Label: \", block2);\n\t\t\tAssert::AreEqual(block1->toString(), std::wstring(L\"hello world this that\\r\\nblock2\\r\\n\\r\\nLabel: block2\\r\\n\"));\n\n\t\t\tAssert::AreEqual(block3->hasData(), false);\n\t\t\tblock3->addChild(block1);\n\t\t\tAssert::AreEqual(block3->hasData(), true);\n\t\t}\n\t};\n} \/\/ namespace blocktest<commit_msg>more coverage<commit_after>#include <UnitTest\/stdafx.h>\n#include <UnitTest\/UnitTest.h>\n#include <core\/smartview\/block\/block.h>\n#include <core\/smartview\/block\/blockBytes.h>\n#include <core\/smartview\/block\/blockStringA.h>\n#include <core\/smartview\/block\/blockStringW.h>\n#include <core\/smartview\/block\/blockT.h>\n\nnamespace blocktest\n{\n\tTEST_CLASS(blocktest)\n\t{\n\tpublic:\n\t\t\/\/ Without this, clang gets weird\n\t\tstatic const bool dummy_var = true;\n\n\t\tTEST_CLASS_INITIALIZE(initialize) { unittest::init(); }\n\t\tTEST_METHOD(Test_block)\n\t\t{\n\t\t\tauto block1 = std::make_shared<smartview::block>(L\"test\");\n\t\t\tauto block2 = std::make_shared<smartview::block>(L\"block2\");\n\t\t\tauto block3 = std::make_shared<smartview::block>(L\"\");\n\t\t\tAssert::AreEqual(block1->isHeader(), true);\n\t\t\tblock1->setSize(5);\n\t\t\tAssert::AreEqual(block1->isHeader(), false);\n\t\t\tblock1->setOffset(6);\n\t\t\tAssert::AreEqual(block1->isHeader(), false);\n\t\t\tblock1->setSource(7);\n\n\t\t\tAssert::AreEqual(block1->getText(), std::wstring(L\"test\"));\n\t\t\tAssert::AreEqual(block1->getChildren().empty(), true);\n\t\t\tAssert::AreEqual(block1->toString(), std::wstring(L\"test\"));\n\t\t\tAssert::AreEqual(block1->getSize(), size_t(5));\n\t\t\tAssert::AreEqual(block1->getOffset(), size_t(6));\n\t\t\tAssert::AreEqual(block1->getSource(), ULONG(7));\n\n\t\t\tblock1->setText(L\"the %1!ws!\", L\"other\");\n\t\t\tAssert::AreEqual(block1->getText(), std::wstring(L\"the other\"));\n\t\t\tblock1->addHeader(L\" this %1!ws!\", L\"that\");\n\t\t\tAssert::AreEqual(block1->toString(), std::wstring(L\"the other this that\"));\n\n\t\t\tblock1->setText(L\"hello\");\n\t\t\tAssert::AreEqual(block1->getText(), std::wstring(L\"hello\"));\n\n\t\t\tblock1->setText(L\"hello %1!ws!\", L\"world\");\n\t\t\tAssert::AreEqual(block1->getText(), std::wstring(L\"hello world\"));\n\n\t\t\tblock1->terminateBlock();\n\t\t\tblock1->terminateBlock();\n\t\t\tblock1->addChild(block2);\n\t\t\tAssert::AreEqual(block1->toString(), std::wstring(L\"hello world this that\\r\\nblock2\"));\n\n\t\t\tblock1->addBlankLine();\n\t\t\tblock1->addLabeledChild(L\"Label: \", block2);\n\t\t\tAssert::AreEqual(\n\t\t\t\tblock1->toString(), std::wstring(L\"hello world this that\\r\\nblock2\\r\\n\\r\\nLabel: block2\\r\\n\"));\n\n\t\t\tAssert::AreEqual(block3->hasData(), false);\n\t\t\tblock3->addChild(block1);\n\t\t\tAssert::AreEqual(block3->hasData(), true);\n\t\t}\n\n\t\tTEST_METHOD(Test_blockStringA)\n\t\t{\n\t\t\tauto block1 = std::make_shared<smartview::blockStringA>();\n\t\t\tAssert::AreEqual(block1->isSet(), false);\n\t\t\tauto block2 = std::make_shared<smartview::blockStringA>(std::string(\"test\"), 4, 5);\n\t\t\tAssert::AreEqual(block2->toWstring(), std::wstring(L\"test\"));\n\t\t\tAssert::AreEqual(block2->length(), size_t(4));\n\t\t}\n\n\t\tTEST_METHOD(Test_blockStringW)\n\t\t{\n\t\t\tauto block1 = std::make_shared<smartview::blockStringW>();\n\t\t\tAssert::AreEqual(block1->isSet(), false);\n\t\t\tauto block2 = std::make_shared<smartview::blockStringW>(std::wstring(L\"test\"), 4, 5);\n\t\t\tAssert::AreEqual(block2->toString(), std::wstring(L\"test\"));\n\t\t\tAssert::AreEqual(block2->length(), size_t(4));\n\t\t}\n\t};\n} \/\/ namespace blocktest<|endoftext|>"} {"text":"<commit_before>\/\/ Copyright (c) 2017, Joseph Mirabel\n\/\/ Authors: Joseph Mirabel (joseph.mirabel@laas.fr)\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 <http:\/\/www.gnu.org\/licenses\/>.\n\n#include <hpp\/core\/explicit-relative-transformation.hh>\n\n#include <pinocchio\/spatial\/explog.hpp>\n#include <pinocchio\/spatial\/skew.hpp>\n\n#include <hpp\/pinocchio\/device.hh>\n\n#include <..\/src\/times-frame-function.hh>\n\nnamespace hpp {\n namespace core {\n namespace {\n typedef JointJacobian_t::ConstNRowsBlockXpr<3>::Type ConstHalfJacobian_t;\n inline ConstHalfJacobian_t omega(const JointJacobian_t& j) { return j.bottomRows<3>(); }\n inline ConstHalfJacobian_t trans(const JointJacobian_t& j) { return j.topRows<3>(); }\n\n void inputVariable (JointConstPtr_t joint, std::vector<bool>& conf, std::vector<bool>& vel)\n {\n while (joint && joint->index() != 0) {\n for (size_type i = 0; i < joint->configSize(); ++i)\n conf[joint->rankInConfiguration() + i] = !conf[joint->rankInConfiguration() + i];\n for (size_type i = 0; i < joint->numberDof(); ++i)\n vel[joint->rankInVelocity() + i] = !vel[joint->rankInVelocity() + i];\n hppDout (info, \"Adding joint \" << joint->name ()\n << \" as input variable.\");\n joint = joint->parentJoint();\n }\n }\n\n BlockIndex::segments_t vectorOfBoolToIntervals (std::vector<bool>& v)\n {\n BlockIndex::segments_t ret;\n for (std::size_t i = 0; i < v.size(); ++i)\n if (v[i]) ret.push_back(BlockIndex::segment_t (i, 1));\n BlockIndex::shrink (ret);\n return ret;\n }\n\n BlockIndex::segments_t jointConfInterval (JointConstPtr_t j) {\n return BlockIndex::segments_t(1, BlockIndex::segment_t\n (j->rankInConfiguration(),\n j->configSize()));\n }\n BlockIndex::segments_t jointVelInterval (JointConstPtr_t j) {\n return BlockIndex::segments_t(1, BlockIndex::segment_t\n (j->rankInVelocity(), j->numberDof()));\n }\n }\n\n ExplicitRelativeTransformationPtr_t ExplicitRelativeTransformation::create\n (const std::string& name , const DevicePtr_t& robot,\n const JointConstPtr_t& joint1, const JointConstPtr_t& joint2,\n const Transform3f& frame1 , const Transform3f& frame2)\n {\n std::vector<bool> conf (robot->configSize(), false);\n std::vector<bool> vel (robot->numberDof(), false);\n inputVariable (joint1, conf, vel);\n inputVariable (joint2->parentJoint(), conf, vel);\n\n ExplicitRelativeTransformation* ptr =\n new ExplicitRelativeTransformation (name, robot, joint1, joint2,\n frame1, frame2,\n vectorOfBoolToIntervals(conf),\n jointConfInterval(joint2),\n vectorOfBoolToIntervals(vel),\n jointVelInterval(joint2));\n ExplicitRelativeTransformationPtr_t shPtr (ptr);\n ptr->init (shPtr);\n return shPtr;\n }\n\n ExplicitRelativeTransformation::ExplicitRelativeTransformation (\n const std::string& name , const DevicePtr_t& robot,\n const JointConstPtr_t& joint1, const JointConstPtr_t& joint2,\n const Transform3f& frame1 , const Transform3f& frame2,\n const segments_t inConf , const segments_t outConf,\n const segments_t inVel , const segments_t outVel ,\n std::vector <bool> \/*mask*\/)\n : DifferentiableFunction (\n BlockIndex::cardinal(inConf), BlockIndex::cardinal(inVel),\n pinocchio::LiegroupSpace::SE3 (), name),\n robot_ (robot),\n parentJoint_ (joint2->parentJoint ()),\n joint1_ (joint1), joint2_ (joint2),\n inConf_ (inConf), inVel_ (inVel),\n outConf_ (outConf), outVel_ (outVel),\n F1inJ1_invF2inJ2_ (frame1)\n {\n if (!frame2.isIdentity()) {\n g_ = DifferentiableFunctionPtr_t (new TimesFrameFunction\n (frame2, \"Output function \" + name));\n ginv_ = DifferentiableFunctionPtr_t (new TimesFrameFunction\n (frame2.inverse(), \"Inverse output function \" + name));\n }\n }\n\n void ExplicitRelativeTransformation::forwardKinematics (vectorIn_t arg) const\n {\n qsmall_ = inConf_.rview(robot_->currentConfiguration());\n if (qsmall_ != arg) {\n q_ = robot_->currentConfiguration();\n inConf_.lview(q_) = arg;\n robot_->currentConfiguration(q_);\n }\n robot_->computeForwardKinematics ();\n }\n\n void ExplicitRelativeTransformation::impl_compute\n (LiegroupElement& result, vectorIn_t argument) const\n {\n forwardKinematics (argument);\n\n \/\/ J1 * M1\/J1 = J2 * M2\/J2\n \/\/ J2 = J1 * M1\/J1 * M2\/J2^{-1}\n \/\/ J2 = J2_{parent} * T\n \/\/ T = J2_{parent}^{-1} * J2\n \/\/ T = J2_{parent}^{-1} * J1 * F1\/J1 * F2\/J2^{-1}\n freeflyerPose_ =\n joint1_->currentTransformation () * F1inJ1_invF2inJ2_;\n\n if (parentJoint_)\n freeflyerPose_ = parentJoint_->currentTransformation ().actInv(freeflyerPose_);\n\n freeflyerPose_ =\n joint2_->positionInParentFrame ().actInv (freeflyerPose_);\n\n typedef Transform3f::Quaternion_t Q_t;\n result.vector ().head<3>() = freeflyerPose_.translation();\n result.vector ().tail<4>() = Q_t(freeflyerPose_.rotation()).coeffs();\n }\n\n void ExplicitRelativeTransformation::impl_jacobian (matrixOut_t jacobian, vectorIn_t arg) const\n {\n LiegroupElement result (outputSpace ());\n impl_compute (result, arg);\n Configuration_t q (robot_->currentConfiguration ());\n outConf_.lview (q) = result.vector ();\n robot_->currentConfiguration (q);\n robot_->computeForwardKinematics ();\n\n const JointJacobian_t& J1 (joint1_->jacobian());\n \/\/ const JointJacobian_t& J2_parent (parentJoint_->jacobian());\n\n const matrix3_t& R1 (joint1_->currentTransformation().rotation());\n const matrix3_t& R2 (joint2_->currentTransformation().rotation());\n const matrix3_t& R2_inParentFrame (joint2_->positionInParentFrame().\n rotation());\n\n const vector3_t& t1 (joint1_->currentTransformation().translation());\n\n cross1_ = se3::skew((R1 * F1inJ1_invF2inJ2_.translation()).eval());\n if (parentJoint_) {\n const vector3_t& t2_parent (parentJoint_ ->currentTransformation().translation());\n cross2_ = se3::skew((t2_parent - t1).eval());\n\n J2_parent_minus_J1_.noalias() = parentJoint_->jacobian() - J1;\n } else {\n cross2_ = - se3::skew(t1);\n \/\/ J2_parent_minus_J1_ = - J1;\n }\n\n matrix3_t R2t_R1 (R2.transpose() * R1);\n \/\/ Express velocity of J1 * M1\/J1 * M2\/J2^{-1} in J2_{parent}.\n if (parentJoint_) {\n const matrix3_t& R2_parent (parentJoint_->currentTransformation().rotation());\n const JointJacobian_t& J2_parent (parentJoint_->jacobian());\n\n tmpJac_.noalias() = (R2_inParentFrame.transpose() * R2_parent.transpose()) *\n ( cross1_ * (omega(J2_parent_minus_J1_))\n - cross2_ * omega(J2_parent)\n - trans(J2_parent_minus_J1_));\n } else {\n tmpJac_.noalias() = (- R2.transpose() * cross1_ * R1) * omega(J1);\n tmpJac_.noalias() += R2t_R1 * trans(J1);\n }\n\n jacobian.topRows<3>() = inVel_.rview(tmpJac_);\n \/\/ jacobian.topRows<3>().setZero();\n\n if (parentJoint_) {\n const matrix3_t& R2_parent (parentJoint_->currentTransformation().rotation());\n const JointJacobian_t& J2_parent (parentJoint_->jacobian());\n\n \/\/ J = p2RT2 * 0RTp2 * [ p2\n tmpJac_.noalias() = ( R2.transpose() * R2_parent ) * omega(J2_parent)\n - (R2.transpose() * R1) * omega(J1);\n } else {\n tmpJac_.noalias() = R2t_R1 * omega(J1);\n }\n\n jacobian.bottomRows<3>() = inVel_.rview(tmpJac_);\n }\n\n constraints::ExplicitPtr_t ExplicitRelativeTransformation::createNumericalConstraint ()\n {\n if (g_)\n return constraints::Explicit::create (\n robot_->configSpace (),\n weak_.lock(),\n g_, ginv_,\n inConf_.indices(),\n inVel_.indices(),\n outConf_.indices(),\n outVel_.indices());\n else\n return constraints::Explicit::create (\n robot_->configSpace (),\n weak_.lock(),\n inConf_.indices(),\n inVel_.indices(),\n outConf_.indices(),\n outVel_.indices());\n }\n } \/\/ namespace core\n} \/\/ namespace hpp\n<commit_msg>Fix ExplicitRelativeTransformation::createNumericalConstraint<commit_after>\/\/ Copyright (c) 2017, Joseph Mirabel\n\/\/ Authors: Joseph Mirabel (joseph.mirabel@laas.fr)\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 <http:\/\/www.gnu.org\/licenses\/>.\n\n#include <hpp\/core\/explicit-relative-transformation.hh>\n\n#include <pinocchio\/spatial\/explog.hpp>\n#include <pinocchio\/spatial\/skew.hpp>\n\n#include <hpp\/pinocchio\/device.hh>\n\n#include <..\/src\/times-frame-function.hh>\n\nnamespace hpp {\n namespace core {\n namespace {\n typedef JointJacobian_t::ConstNRowsBlockXpr<3>::Type ConstHalfJacobian_t;\n inline ConstHalfJacobian_t omega(const JointJacobian_t& j) { return j.bottomRows<3>(); }\n inline ConstHalfJacobian_t trans(const JointJacobian_t& j) { return j.topRows<3>(); }\n\n void inputVariable (JointConstPtr_t joint, std::vector<bool>& conf, std::vector<bool>& vel)\n {\n while (joint && joint->index() != 0) {\n for (size_type i = 0; i < joint->configSize(); ++i)\n conf[joint->rankInConfiguration() + i] = !conf[joint->rankInConfiguration() + i];\n for (size_type i = 0; i < joint->numberDof(); ++i)\n vel[joint->rankInVelocity() + i] = !vel[joint->rankInVelocity() + i];\n hppDout (info, \"Adding joint \" << joint->name ()\n << \" as input variable.\");\n joint = joint->parentJoint();\n }\n }\n\n BlockIndex::segments_t vectorOfBoolToIntervals (std::vector<bool>& v)\n {\n BlockIndex::segments_t ret;\n for (std::size_t i = 0; i < v.size(); ++i)\n if (v[i]) ret.push_back(BlockIndex::segment_t (i, 1));\n BlockIndex::shrink (ret);\n return ret;\n }\n\n BlockIndex::segments_t jointConfInterval (JointConstPtr_t j) {\n return BlockIndex::segments_t(1, BlockIndex::segment_t\n (j->rankInConfiguration(),\n j->configSize()));\n }\n BlockIndex::segments_t jointVelInterval (JointConstPtr_t j) {\n return BlockIndex::segments_t(1, BlockIndex::segment_t\n (j->rankInVelocity(), j->numberDof()));\n }\n }\n\n ExplicitRelativeTransformationPtr_t ExplicitRelativeTransformation::create\n (const std::string& name , const DevicePtr_t& robot,\n const JointConstPtr_t& joint1, const JointConstPtr_t& joint2,\n const Transform3f& frame1 , const Transform3f& frame2)\n {\n std::vector<bool> conf (robot->configSize(), false);\n std::vector<bool> vel (robot->numberDof(), false);\n inputVariable (joint1, conf, vel);\n inputVariable (joint2->parentJoint(), conf, vel);\n\n ExplicitRelativeTransformation* ptr =\n new ExplicitRelativeTransformation (name, robot, joint1, joint2,\n frame1, frame2,\n vectorOfBoolToIntervals(conf),\n jointConfInterval(joint2),\n vectorOfBoolToIntervals(vel),\n jointVelInterval(joint2));\n ExplicitRelativeTransformationPtr_t shPtr (ptr);\n ptr->init (shPtr);\n return shPtr;\n }\n\n ExplicitRelativeTransformation::ExplicitRelativeTransformation (\n const std::string& name , const DevicePtr_t& robot,\n const JointConstPtr_t& joint1, const JointConstPtr_t& joint2,\n const Transform3f& frame1 , const Transform3f& frame2,\n const segments_t inConf , const segments_t outConf,\n const segments_t inVel , const segments_t outVel ,\n std::vector <bool> \/*mask*\/)\n : DifferentiableFunction (\n BlockIndex::cardinal(inConf), BlockIndex::cardinal(inVel),\n pinocchio::LiegroupSpace::SE3 (), name),\n robot_ (robot),\n parentJoint_ (joint2->parentJoint ()),\n joint1_ (joint1), joint2_ (joint2),\n inConf_ (inConf), inVel_ (inVel),\n outConf_ (outConf), outVel_ (outVel),\n F1inJ1_invF2inJ2_ (frame1)\n {\n if (!frame2.isIdentity()) {\n g_ = DifferentiableFunctionPtr_t (new TimesFrameFunction\n (frame2, \"Output function \" + name));\n ginv_ = DifferentiableFunctionPtr_t (new TimesFrameFunction\n (frame2.inverse(), \"Inverse output function \" + name));\n }\n }\n\n void ExplicitRelativeTransformation::forwardKinematics (vectorIn_t arg) const\n {\n qsmall_ = inConf_.rview(robot_->currentConfiguration());\n if (qsmall_ != arg) {\n q_ = robot_->currentConfiguration();\n inConf_.lview(q_) = arg;\n robot_->currentConfiguration(q_);\n }\n robot_->computeForwardKinematics ();\n }\n\n void ExplicitRelativeTransformation::impl_compute\n (LiegroupElement& result, vectorIn_t argument) const\n {\n forwardKinematics (argument);\n\n \/\/ J1 * M1\/J1 = J2 * M2\/J2\n \/\/ J2 = J1 * M1\/J1 * M2\/J2^{-1}\n \/\/ J2 = J2_{parent} * T\n \/\/ T = J2_{parent}^{-1} * J2\n \/\/ T = J2_{parent}^{-1} * J1 * F1\/J1 * F2\/J2^{-1}\n freeflyerPose_ =\n joint1_->currentTransformation () * F1inJ1_invF2inJ2_;\n\n if (parentJoint_)\n freeflyerPose_ = parentJoint_->currentTransformation ().actInv(freeflyerPose_);\n\n freeflyerPose_ =\n joint2_->positionInParentFrame ().actInv (freeflyerPose_);\n\n typedef Transform3f::Quaternion_t Q_t;\n result.vector ().head<3>() = freeflyerPose_.translation();\n result.vector ().tail<4>() = Q_t(freeflyerPose_.rotation()).coeffs();\n }\n\n void ExplicitRelativeTransformation::impl_jacobian (matrixOut_t jacobian, vectorIn_t arg) const\n {\n LiegroupElement result (outputSpace ());\n impl_compute (result, arg);\n Configuration_t q (robot_->currentConfiguration ());\n outConf_.lview (q) = result.vector ();\n robot_->currentConfiguration (q);\n robot_->computeForwardKinematics ();\n\n const JointJacobian_t& J1 (joint1_->jacobian());\n \/\/ const JointJacobian_t& J2_parent (parentJoint_->jacobian());\n\n const matrix3_t& R1 (joint1_->currentTransformation().rotation());\n const matrix3_t& R2 (joint2_->currentTransformation().rotation());\n const matrix3_t& R2_inParentFrame (joint2_->positionInParentFrame().\n rotation());\n\n const vector3_t& t1 (joint1_->currentTransformation().translation());\n\n cross1_ = se3::skew((R1 * F1inJ1_invF2inJ2_.translation()).eval());\n if (parentJoint_) {\n const vector3_t& t2_parent (parentJoint_ ->currentTransformation().translation());\n cross2_ = se3::skew((t2_parent - t1).eval());\n\n J2_parent_minus_J1_.noalias() = parentJoint_->jacobian() - J1;\n } else {\n cross2_ = - se3::skew(t1);\n \/\/ J2_parent_minus_J1_ = - J1;\n }\n\n matrix3_t R2t_R1 (R2.transpose() * R1);\n \/\/ Express velocity of J1 * M1\/J1 * M2\/J2^{-1} in J2_{parent}.\n if (parentJoint_) {\n const matrix3_t& R2_parent (parentJoint_->currentTransformation().rotation());\n const JointJacobian_t& J2_parent (parentJoint_->jacobian());\n\n tmpJac_.noalias() = (R2_inParentFrame.transpose() * R2_parent.transpose()) *\n ( cross1_ * (omega(J2_parent_minus_J1_))\n - cross2_ * omega(J2_parent)\n - trans(J2_parent_minus_J1_));\n } else {\n tmpJac_.noalias() = (- R2.transpose() * cross1_ * R1) * omega(J1);\n tmpJac_.noalias() += R2t_R1 * trans(J1);\n }\n\n jacobian.topRows<3>() = inVel_.rview(tmpJac_);\n \/\/ jacobian.topRows<3>().setZero();\n\n if (parentJoint_) {\n const matrix3_t& R2_parent (parentJoint_->currentTransformation().rotation());\n const JointJacobian_t& J2_parent (parentJoint_->jacobian());\n\n \/\/ J = p2RT2 * 0RTp2 * [ p2\n tmpJac_.noalias() = ( R2.transpose() * R2_parent ) * omega(J2_parent)\n - (R2.transpose() * R1) * omega(J1);\n } else {\n tmpJac_.noalias() = R2t_R1 * omega(J1);\n }\n\n jacobian.bottomRows<3>() = inVel_.rview(tmpJac_);\n }\n\n constraints::ExplicitPtr_t ExplicitRelativeTransformation::createNumericalConstraint ()\n {\n return constraints::Explicit::create (robot_->configSpace (),\n weak_.lock(), inConf_.indices(),\n inVel_.indices(), outConf_.indices(),\n outVel_.indices());\n }\n } \/\/ namespace core\n} \/\/ namespace hpp\n<|endoftext|>"} {"text":"<commit_before>\/*************** <auto-copyright.pl BEGIN do not edit this line> **************\n *\n * VR Juggler is (C) Copyright 1998-2007 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 <gadget\/Devices\/DriverConfig.h>\n\n#include <string>\n#include <boost\/bind.hpp>\n\n#include <gmtl\/Matrix.h>\n#include <gmtl\/Vec.h>\n#include <gmtl\/MatrixOps.h>\n#include <gmtl\/Generate.h>\n#include <gmtl\/AxisAngle.h>\n\n#include <vpr\/System.h>\n\n#include <jccl\/Config\/ConfigElement.h>\n#include <gadget\/Type\/DeviceConstructor.h>\n#include <gadget\/gadgetParam.h>\n#include <drivers\/EssentialReality\/P5Glove\/P5GloveStandalone.h> \/* standalone dataglove driver *\/\n#include <drivers\/EssentialReality\/P5Glove\/P5GloveWrapper.h> \/* Gadgeteer dataglove driver *\/\n\n\nextern \"C\"\n{\n\nGADGET_DRIVER_EXPORT(vpr::Uint32) getGadgeteerVersion()\n{\n return __GADGET_version;\n}\n\nGADGET_DRIVER_EXPORT(void) initDevice(gadget::InputManager* inputMgr)\n{\n new gadget::DeviceConstructor<gadget::P5GloveWrapper>(inputMgr);\n}\n\n}\n\nnamespace gadget\n{\n\nP5GloveWrapper::P5GloveWrapper()\n : mGlove(NULL)\n , mAnalogP5(5)\n , mDigitalP5(3)\n , mPositionP5(1)\n , mExitFlag(false)\n{\n mAnalogP5[0] = 0.0f;\n mAnalogP5[1] = 0.0f;\n mAnalogP5[2] = 0.0f;\n mAnalogP5[3] = 0.0f;\n mAnalogP5[5] = 0.0f;\n}\n\nP5GloveWrapper::~P5GloveWrapper()\n{\n stopSampling(); \/\/ Stop the glove\n\n if ( NULL != mGlove )\n {\n delete mGlove; \/\/ Delete the glove\n mGlove = NULL;\n }\n}\n\nbool P5GloveWrapper::config(jccl::ConfigElementPtr e)\n{\n if ( ! (Input::config(e) \/*&& Glove::config(e)*\/ ) )\n {\n return false;\n }\n\n mGloveNumber = e->getProperty<int>(\"number\");\n\n vprASSERT(mThread == NULL); \/\/ This should have been set by Input(c)\n mGlove = new P5GloveStandalone();\n return true;\n}\n\nstd::string P5GloveWrapper::getElementType()\n{\n return \"p5_glove\";\n}\n\nbool P5GloveWrapper::startSampling()\n{\n bool started(false);\n\n if ( mThread == NULL )\n {\n vprDEBUG(gadgetDBG_INPUT_MGR, vprDBG_STATE_LVL)\n << \"[p5glove] Begin sampling\\n\" << vprDEBUG_FLUSH;\n \n int maxAttempts(0);\n bool result(false);\n\n while ( result == false && maxAttempts < 5 )\n {\n vprDEBUG(gadgetDBG_INPUT_MGR, vprDBG_STATE_LVL)\n << \"[p5glove] Connecting to glove number \" << mGloveNumber\n << \"...\\n\" << vprDEBUG_FLUSH;\n result = mGlove->connectToHardware(mGloveNumber);\n\n if ( result == false )\n {\n vprDEBUG(gadgetDBG_INPUT_MGR, vprDBG_CRITICAL_LVL)\n << \"[p5glove] ERROR: Can't open or it is already opened.\"\n << vprDEBUG_FLUSH;\n vpr::System::usleep(14500);\n ++maxAttempts;\n }\n }\n\n vprDEBUG(gadgetDBG_INPUT_MGR, vprDBG_STATE_LVL)\n << \"[p5glove] Successfully connected, Now sampling dataglove data.\\n\"\n << vprDEBUG_FLUSH;\n\n \/\/ Create a new thread to handle the control and set exit flag to false\n mExitFlag = false;\n vprDEBUG(gadgetDBG_INPUT_MGR, vprDBG_STATE_LVL)\n << \"[p5glove] Spawning control thread.\\n\" << vprDEBUG_FLUSH;\n\n try\n {\n mThread = new vpr::Thread(boost::bind(&P5GloveWrapper::controlLoop,\n this));\n mActive = true;\n started = true;\n\n vprDEBUG(gadgetDBG_INPUT_MGR, vprDBG_STATE_LVL)\n << \"[p5glove] P5Glove is active.\\n\" << vprDEBUG_FLUSH;\n }\n catch (vpr::Exception& ex)\n {\n vprDEBUG(gadgetDBG_INPUT_MGR, vprDBG_CRITICAL_LVL)\n << clrOutBOLD(clrRED, \"ERROR\")\n << \": Failed to spawn thread for P5 Glove driver!\\n\"\n << vprDEBUG_FLUSH;\n vprDEBUG_NEXT(gadgetDBG_INPUT_MGR, vprDBG_CRITICAL_LVL)\n << ex.what() << std::endl << vprDEBUG_FLUSH;\n started = false;\n }\n }\n\n return started;\n}\n\nvoid P5GloveWrapper::controlLoop()\n{\n vprDEBUG(gadgetDBG_INPUT_MGR, vprDBG_STATE_LVL)\n << \"[p5glove] Entered control thread\\n\" << vprDEBUG_FLUSH;\n\n \/\/ Go until mExitFlag is set to true\n while ( ! mExitFlag )\n {\n sample();\n }\n}\n\nbool P5GloveWrapper::sample()\n{\n P5GloveStandalone::Record rec;\n bool sample_read = mGlove->readRecordsFromHardware(rec);\n\n if ( sample_read )\n {\n\/\/ Furst, we set the flexion of the gloves\n mAnalogP5[0] = rec.thumb; \/\/ Thumb (0.0 - 1.0)\n mAnalogP5[1] = rec.index; \/\/ Index\n mAnalogP5[2] = rec.middle; \/\/ Middle\n mAnalogP5[3] = rec.ring; \/\/ Ring\n mAnalogP5[4] = rec.pinky; \/\/ Pinky\n addAnalogSample(mAnalogP5);\n swapAnalogBuffers();\n\n\/\/ Then, we define the buttons of the glove\n mDigitalP5[0] = rec.buttonA;\n mDigitalP5[1] = rec.buttonB;\n mDigitalP5[2] = rec.buttonC;\n addDigitalSample(mDigitalP5);\n swapDigitalBuffers();\n\n\/\/ Finally, we set the position of the glove ...\n const gmtl::AxisAnglef rotation(rec.rotationAngle, rec.rotationAxis[0],\n rec.rotationAxis[1],\n rec.rotationAxis[2]);\n const gmtl::Vec3f translation(static_cast<float>(rec.position[0]),\n static_cast<float>(rec.position[1]),\n static_cast<float>(rec.position[2]));\n gmtl::Matrix44f position = gmtl::makeTrans<gmtl::Matrix44f>(translation);\n position = position * gmtl::make<gmtl::Matrix44f>(rotation);\n mPositionP5[0].mPosData = position; \n addPositionSample(mPositionP5);\n swapPositionBuffers();\n }\n\n return true;\n}\n\nvoid P5GloveWrapper::updateData()\n{\n swapAnalogBuffers();\n swapDigitalBuffers();\n swapPositionBuffers();\n}\n\nbool P5GloveWrapper::stopSampling()\n{\n if ( mThread != NULL )\n {\n mExitFlag = true;\n \n \/\/Wait for thread to exit normally after setting exit flag\n mThread->join();\n delete mThread;\n mThread = NULL;\n\n vprDEBUG(gadgetDBG_INPUT_MGR, vprDBG_CONFIG_LVL)\n << \"[p5glove] stopping P5Glove..\" << std::endl << vprDEBUG_FLUSH;\n }\n\n return true;\n}\n\n} \/\/ End of gadget namespace\n<commit_msg>If the connection to the hardware fails, do not spawn a sampling thread.<commit_after>\/*************** <auto-copyright.pl BEGIN do not edit this line> **************\n *\n * VR Juggler is (C) Copyright 1998-2007 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 <gadget\/Devices\/DriverConfig.h>\n\n#include <string>\n#include <boost\/bind.hpp>\n\n#include <gmtl\/Matrix.h>\n#include <gmtl\/Vec.h>\n#include <gmtl\/MatrixOps.h>\n#include <gmtl\/Generate.h>\n#include <gmtl\/AxisAngle.h>\n\n#include <vpr\/System.h>\n\n#include <jccl\/Config\/ConfigElement.h>\n#include <gadget\/Type\/DeviceConstructor.h>\n#include <gadget\/gadgetParam.h>\n#include <drivers\/EssentialReality\/P5Glove\/P5GloveStandalone.h> \/* standalone dataglove driver *\/\n#include <drivers\/EssentialReality\/P5Glove\/P5GloveWrapper.h> \/* Gadgeteer dataglove driver *\/\n\n\nextern \"C\"\n{\n\nGADGET_DRIVER_EXPORT(vpr::Uint32) getGadgeteerVersion()\n{\n return __GADGET_version;\n}\n\nGADGET_DRIVER_EXPORT(void) initDevice(gadget::InputManager* inputMgr)\n{\n new gadget::DeviceConstructor<gadget::P5GloveWrapper>(inputMgr);\n}\n\n}\n\nnamespace gadget\n{\n\nP5GloveWrapper::P5GloveWrapper()\n : mGlove(NULL)\n , mAnalogP5(5)\n , mDigitalP5(3)\n , mPositionP5(1)\n , mExitFlag(false)\n{\n mAnalogP5[0] = 0.0f;\n mAnalogP5[1] = 0.0f;\n mAnalogP5[2] = 0.0f;\n mAnalogP5[3] = 0.0f;\n mAnalogP5[5] = 0.0f;\n}\n\nP5GloveWrapper::~P5GloveWrapper()\n{\n stopSampling(); \/\/ Stop the glove\n\n if ( NULL != mGlove )\n {\n delete mGlove; \/\/ Delete the glove\n mGlove = NULL;\n }\n}\n\nbool P5GloveWrapper::config(jccl::ConfigElementPtr e)\n{\n if ( ! (Input::config(e) \/*&& Glove::config(e)*\/ ) )\n {\n return false;\n }\n\n mGloveNumber = e->getProperty<int>(\"number\");\n\n vprASSERT(mThread == NULL); \/\/ This should have been set by Input(c)\n mGlove = new P5GloveStandalone();\n return true;\n}\n\nstd::string P5GloveWrapper::getElementType()\n{\n return \"p5_glove\";\n}\n\nbool P5GloveWrapper::startSampling()\n{\n bool started(false);\n\n if ( mThread == NULL )\n {\n vprDEBUG(gadgetDBG_INPUT_MGR, vprDBG_STATE_LVL)\n << \"[p5glove] Begin sampling\\n\" << vprDEBUG_FLUSH;\n \n int max_attempts(0);\n bool result(false);\n\n while ( result == false && max_attempts < 5 )\n {\n vprDEBUG(gadgetDBG_INPUT_MGR, vprDBG_STATE_LVL)\n << \"[p5glove] Connecting to glove number \" << mGloveNumber\n << \"...\\n\" << vprDEBUG_FLUSH;\n result = mGlove->connectToHardware(mGloveNumber);\n\n if ( result == false )\n {\n vprDEBUG(gadgetDBG_INPUT_MGR, vprDBG_CRITICAL_LVL)\n << \"[p5glove] ERROR: Can't open or it is already opened.\"\n << vprDEBUG_FLUSH;\n vpr::System::usleep(14500);\n ++max_attempts;\n }\n }\n\n if ( result )\n {\n vprDEBUG(gadgetDBG_INPUT_MGR, vprDBG_STATE_LVL)\n << \"[p5glove] Successfully connected, Now sampling dataglove \"\n << \"data.\\n\" << vprDEBUG_FLUSH;\n\n \/\/ Create a new thread to handle the control and set exit flag to\n \/\/ false.\n mExitFlag = false;\n vprDEBUG(gadgetDBG_INPUT_MGR, vprDBG_STATE_LVL)\n << \"[p5glove] Spawning control thread.\\n\" << vprDEBUG_FLUSH;\n\n try\n {\n mThread =\n new vpr::Thread(boost::bind(&P5GloveWrapper::controlLoop,\n this));\n mActive = true;\n started = true;\n\n vprDEBUG(gadgetDBG_INPUT_MGR, vprDBG_STATE_LVL)\n << \"[p5glove] P5Glove is active.\\n\" << vprDEBUG_FLUSH;\n }\n catch (vpr::Exception& ex)\n {\n vprDEBUG(gadgetDBG_INPUT_MGR, vprDBG_CRITICAL_LVL)\n << clrOutBOLD(clrRED, \"ERROR\")\n << \": Failed to spawn thread for P5 Glove driver!\\n\"\n << vprDEBUG_FLUSH;\n vprDEBUG_NEXT(gadgetDBG_INPUT_MGR, vprDBG_CRITICAL_LVL)\n << ex.what() << std::endl << vprDEBUG_FLUSH;\n started = false;\n }\n }\n }\n\n return started;\n}\n\nvoid P5GloveWrapper::controlLoop()\n{\n vprDEBUG(gadgetDBG_INPUT_MGR, vprDBG_STATE_LVL)\n << \"[p5glove] Entered control thread\\n\" << vprDEBUG_FLUSH;\n\n \/\/ Go until mExitFlag is set to true\n while ( ! mExitFlag )\n {\n sample();\n }\n}\n\nbool P5GloveWrapper::sample()\n{\n P5GloveStandalone::Record rec;\n bool sample_read = mGlove->readRecordsFromHardware(rec);\n\n if ( sample_read )\n {\n\/\/ Furst, we set the flexion of the gloves\n mAnalogP5[0] = rec.thumb; \/\/ Thumb (0.0 - 1.0)\n mAnalogP5[1] = rec.index; \/\/ Index\n mAnalogP5[2] = rec.middle; \/\/ Middle\n mAnalogP5[3] = rec.ring; \/\/ Ring\n mAnalogP5[4] = rec.pinky; \/\/ Pinky\n addAnalogSample(mAnalogP5);\n swapAnalogBuffers();\n\n\/\/ Then, we define the buttons of the glove\n mDigitalP5[0] = rec.buttonA;\n mDigitalP5[1] = rec.buttonB;\n mDigitalP5[2] = rec.buttonC;\n addDigitalSample(mDigitalP5);\n swapDigitalBuffers();\n\n\/\/ Finally, we set the position of the glove ...\n const gmtl::AxisAnglef rotation(rec.rotationAngle, rec.rotationAxis[0],\n rec.rotationAxis[1],\n rec.rotationAxis[2]);\n const gmtl::Vec3f translation(static_cast<float>(rec.position[0]),\n static_cast<float>(rec.position[1]),\n static_cast<float>(rec.position[2]));\n gmtl::Matrix44f position = gmtl::makeTrans<gmtl::Matrix44f>(translation);\n position = position * gmtl::make<gmtl::Matrix44f>(rotation);\n mPositionP5[0].mPosData = position; \n addPositionSample(mPositionP5);\n swapPositionBuffers();\n }\n\n return true;\n}\n\nvoid P5GloveWrapper::updateData()\n{\n swapAnalogBuffers();\n swapDigitalBuffers();\n swapPositionBuffers();\n}\n\nbool P5GloveWrapper::stopSampling()\n{\n if ( mThread != NULL )\n {\n mExitFlag = true;\n \n \/\/Wait for thread to exit normally after setting exit flag\n mThread->join();\n delete mThread;\n mThread = NULL;\n\n vprDEBUG(gadgetDBG_INPUT_MGR, vprDBG_CONFIG_LVL)\n << \"[p5glove] stopping P5Glove..\" << std::endl << vprDEBUG_FLUSH;\n }\n\n return true;\n}\n\n} \/\/ End of gadget namespace\n<|endoftext|>"} {"text":"<commit_before>\n#include \"llcp.h\"\n#include \"PN532_debug.h\"\n\n\/\/ LLCP PDU Type Values\n#define PDU_SYMM 0x00\n#define PDU_PAX 0x01\n#define PDU_CONNECT 0x04\n#define PDU_DISC 0x05\n#define PDU_CC 0x06\n#define PDU_DM 0x07\n#define PDU_I 0x0c\n#define PDU_RR 0x0d\n\nuint8_t LLCP::SYMM_PDU[2] = {0, 0};\n\ninline uint8_t getPType(const uint8_t *buf)\n{\n return ((buf[0] & 0x3) << 2) + (buf[1] >> 6);\n}\n\ninline uint8_t getSSAP(const uint8_t *buf)\n{\n return buf[1] & 0x3f;\n}\n\ninline uint8_t getDSAP(const uint8_t *buf)\n{\n return buf[0] >> 2;\n}\n\nint8_t LLCP::activate(uint16_t timeout)\n{\n return link.activateAsTarget(timeout);\n}\n\nint8_t LLCP::waitForConnection(uint16_t timeout)\n{\n uint8_t type;\n\n mode = 1;\n ns = 0;\n nr = 0;\n\n \/\/ Get CONNECT PDU\n DMSG(\"wait for a CONNECT PDU\\n\");\n do {\n if (2 > link.read(headerBuf, headerBufLen)) {\n return -1;\n }\n\n type = getPType(headerBuf);\n if (PDU_CONNECT == type) {\n break;\n } else if (PDU_SYMM == type) {\n if (!link.write(SYMM_PDU, sizeof(SYMM_PDU))) {\n return -2;\n }\n } else {\n return -3;\n }\n\n } while (1);\n\n \/\/ Put CC PDU\n DMSG(\"put a CC(Connection Complete) PDU to response the CONNECT PDU\\n\");\n ssap = getDSAP(headerBuf);\n dsap = getSSAP(headerBuf);\n headerBuf[0] = (dsap << 2) + ((PDU_CC >> 2) & 0x3);\n headerBuf[1] = ((PDU_CC & 0x3) << 6) + ssap;\n if (!link.write(headerBuf, 2)) {\n return -2;\n }\n\n return 1;\n}\n\nint8_t LLCP::waitForDisconnection(uint16_t timeout)\n{\n uint8_t type;\n\n \/\/ Get DISC PDU\n DMSG(\"wait for a DISC PDU\\n\");\n do {\n if (2 > link.read(headerBuf, headerBufLen)) {\n return -1;\n }\n\n type = getPType(headerBuf);\n if (PDU_DISC == type) {\n break;\n } else if (PDU_SYMM == type) {\n if (!link.write(SYMM_PDU, sizeof(SYMM_PDU))) {\n return -2;\n }\n } else {\n return -3;\n }\n\n } while (1);\n\n \/\/ Put DM PDU\n DMSG(\"put a DM(Disconnect Mode) PDU to response the DISC PDU\\n\");\n \/\/ ssap = getDSAP(headerBuf);\n \/\/ dsap = getSSAP(headerBuf);\n headerBuf[0] = (dsap << 2) + (PDU_DM >> 2);\n headerBuf[1] = ((PDU_DM & 0x3) << 6) + ssap;\n if (!link.write(headerBuf, 2)) {\n return -2;\n }\n\n return 1;\n}\n\nint8_t LLCP::connect(uint16_t timeout)\n{\n uint8_t type;\n\n mode = 0;\n dsap = LLCP_DEFAULT_DSAP;\n ssap = LLCP_DEFAULT_SSAP;\n ns = 0;\n nr = 0;\n\n \/\/ try to get a SYMM PDU\n if (2 > link.read(headerBuf, headerBufLen)) {\n return -1;\n }\n type = getPType(headerBuf);\n if (PDU_SYMM != type) {\n return -1;\n }\n\n \/\/ put a CONNECT PDU\n headerBuf[0] = (LLCP_DEFAULT_DSAP << 2) + (PDU_CONNECT >> 2);\n headerBuf[1] = ((PDU_CONNECT & 0x03) << 6) + LLCP_DEFAULT_SSAP;\n uint8_t body[] = \" urn:nfc:sn:snep\";\n body[0] = 0x06;\n body[1] = sizeof(body) - 2 - 1;\n if (!link.write(headerBuf, 2, body, sizeof(body) - 1)) {\n return -2;\n }\n\n \/\/ wait for a CC PDU\n DMSG(\"wait for a CC PDU\\n\");\n do {\n if (2 > link.read(headerBuf, headerBufLen)) {\n return -1;\n }\n\n type = getPType(headerBuf);\n if (PDU_CC == type) {\n break;\n } else if (PDU_SYMM == type) {\n if (!link.write(SYMM_PDU, sizeof(SYMM_PDU))) {\n return -2;\n }\n } else {\n return -3;\n }\n\n } while (1);\n\n return 1;\n}\n\nint8_t LLCP::disconnect(uint16_t timeout)\n{\n uint8_t type;\n\n \/\/ try to get a SYMM PDU\n if (2 > link.read(headerBuf, headerBufLen)) {\n return -1;\n }\n type = getPType(headerBuf);\n if (PDU_SYMM != type) {\n return -1;\n }\n\n \/\/ put a DISC PDU\n headerBuf[0] = (LLCP_DEFAULT_DSAP << 2) + (PDU_DISC >> 2);\n headerBuf[1] = ((PDU_DISC & 0x03) << 6) + LLCP_DEFAULT_SSAP;\n if (!link.write(headerBuf, 2)) {\n return -2;\n }\n\n \/\/ wait for a DM PDU\n DMSG(\"wait for a DM PDU\\n\");\n do {\n if (2 > link.read(headerBuf, headerBufLen)) {\n return -1;\n }\n\n type = getPType(headerBuf);\n if (PDU_CC == type) {\n break;\n } else if (PDU_DM == type) {\n if (!link.write(SYMM_PDU, sizeof(SYMM_PDU))) {\n return -2;\n }\n } else {\n return -3;\n }\n\n } while (1);\n\n return 1;\n}\n\nbool LLCP::write(const uint8_t *header, uint8_t hlen, const uint8_t *body, uint8_t blen)\n{\n uint8_t type;\n uint8_t buf[3];\n\n if (mode) {\n \/\/ Get a SYMM PDU\n if (2 != link.read(buf, sizeof(buf))) {\n return false;\n }\n }\n\n if (headerBufLen < (hlen + 3)) {\n return false;\n }\n\n for (int8_t i = hlen - 1; i >= 0; i--) {\n headerBuf[i + 3] = header[i];\n }\n\n headerBuf[0] = (dsap << 2) + (PDU_I >> 2);\n headerBuf[1] = ((PDU_I & 0x3) << 6) + ssap;\n headerBuf[2] = (ns << 4) + nr;\n if (!link.write(headerBuf, 3 + hlen, body, blen)) {\n return false;\n }\n\n ns++;\n\n \/\/ Get a RR PDU\n int16_t status;\n do {\n status = link.read(headerBuf, headerBufLen);\n if (2 > status) {\n return false;\n }\n\n type = getPType(headerBuf);\n if (PDU_RR == type) {\n break;\n } else if (PDU_SYMM == type) {\n if (!link.write(SYMM_PDU, sizeof(SYMM_PDU))) {\n return false;\n }\n } else {\n return false;\n }\n } while (1);\n\n if (!link.write(SYMM_PDU, sizeof(SYMM_PDU))) {\n return false;\n }\n\n return true;\n}\n\nint16_t LLCP::read(uint8_t *buf, uint8_t length)\n{\n uint8_t type;\n uint16_t status;\n\n \/\/ Get INFO PDU\n do {\n status = link.read(buf, length);\n if (2 > status) {\n return -1;\n }\n\n type = getPType(buf);\n if (PDU_I == type) {\n break;\n } else if (PDU_SYMM == type) {\n if (!link.write(SYMM_PDU, sizeof(SYMM_PDU))) {\n return -2;\n }\n } else {\n return -3;\n }\n\n } while (1);\n\n uint8_t len = status - 3;\n ssap = getDSAP(buf);\n dsap = getSSAP(buf);\n\n headerBuf[0] = (dsap << 2) + (PDU_RR >> 2);\n headerBuf[1] = ((PDU_RR & 0x3) << 6) + ssap;\n headerBuf[2] = (buf[2] >> 4) + 1;\n if (!link.write(headerBuf, 3)) {\n return -2;\n }\n\n for (uint8_t i = 0; i < len; i++) {\n buf[i] = buf[i + 3];\n }\n\n nr++;\n\n return len;\n}\n<commit_msg>bugfix<commit_after>\n#include \"llcp.h\"\n#include \"PN532_debug.h\"\n\n\/\/ LLCP PDU Type Values\n#define PDU_SYMM 0x00\n#define PDU_PAX 0x01\n#define PDU_CONNECT 0x04\n#define PDU_DISC 0x05\n#define PDU_CC 0x06\n#define PDU_DM 0x07\n#define PDU_I 0x0c\n#define PDU_RR 0x0d\n\nuint8_t LLCP::SYMM_PDU[2] = {0, 0};\n\ninline uint8_t getPType(const uint8_t *buf)\n{\n return ((buf[0] & 0x3) << 2) + (buf[1] >> 6);\n}\n\ninline uint8_t getSSAP(const uint8_t *buf)\n{\n return buf[1] & 0x3f;\n}\n\ninline uint8_t getDSAP(const uint8_t *buf)\n{\n return buf[0] >> 2;\n}\n\nint8_t LLCP::activate(uint16_t timeout)\n{\n return link.activateAsTarget(timeout);\n}\n\nint8_t LLCP::waitForConnection(uint16_t timeout)\n{\n uint8_t type;\n\n mode = 1;\n ns = 0;\n nr = 0;\n\n \/\/ Get CONNECT PDU\n DMSG(\"wait for a CONNECT PDU\\n\");\n do {\n if (2 > link.read(headerBuf, headerBufLen)) {\n return -1;\n }\n\n type = getPType(headerBuf);\n if (PDU_CONNECT == type) {\n break;\n } else if (PDU_SYMM == type) {\n if (!link.write(SYMM_PDU, sizeof(SYMM_PDU))) {\n return -2;\n }\n } else {\n return -3;\n }\n\n } while (1);\n\n \/\/ Put CC PDU\n DMSG(\"put a CC(Connection Complete) PDU to response the CONNECT PDU\\n\");\n ssap = getDSAP(headerBuf);\n dsap = getSSAP(headerBuf);\n headerBuf[0] = (dsap << 2) + ((PDU_CC >> 2) & 0x3);\n headerBuf[1] = ((PDU_CC & 0x3) << 6) + ssap;\n if (!link.write(headerBuf, 2)) {\n return -2;\n }\n\n return 1;\n}\n\nint8_t LLCP::waitForDisconnection(uint16_t timeout)\n{\n uint8_t type;\n\n \/\/ Get DISC PDU\n DMSG(\"wait for a DISC PDU\\n\");\n do {\n if (2 > link.read(headerBuf, headerBufLen)) {\n return -1;\n }\n\n type = getPType(headerBuf);\n if (PDU_DISC == type) {\n break;\n } else if (PDU_SYMM == type) {\n if (!link.write(SYMM_PDU, sizeof(SYMM_PDU))) {\n return -2;\n }\n } else {\n return -3;\n }\n\n } while (1);\n\n \/\/ Put DM PDU\n DMSG(\"put a DM(Disconnect Mode) PDU to response the DISC PDU\\n\");\n \/\/ ssap = getDSAP(headerBuf);\n \/\/ dsap = getSSAP(headerBuf);\n headerBuf[0] = (dsap << 2) + (PDU_DM >> 2);\n headerBuf[1] = ((PDU_DM & 0x3) << 6) + ssap;\n if (!link.write(headerBuf, 2)) {\n return -2;\n }\n\n return 1;\n}\n\nint8_t LLCP::connect(uint16_t timeout)\n{\n uint8_t type;\n\n mode = 0;\n dsap = LLCP_DEFAULT_DSAP;\n ssap = LLCP_DEFAULT_SSAP;\n ns = 0;\n nr = 0;\n\n \/\/ try to get a SYMM PDU\n if (2 > link.read(headerBuf, headerBufLen)) {\n return -1;\n }\n type = getPType(headerBuf);\n if (PDU_SYMM != type) {\n return -1;\n }\n\n \/\/ put a CONNECT PDU\n headerBuf[0] = (LLCP_DEFAULT_DSAP << 2) + (PDU_CONNECT >> 2);\n headerBuf[1] = ((PDU_CONNECT & 0x03) << 6) + LLCP_DEFAULT_SSAP;\n uint8_t body[] = \" urn:nfc:sn:snep\";\n body[0] = 0x06;\n body[1] = sizeof(body) - 2 - 1;\n if (!link.write(headerBuf, 2, body, sizeof(body) - 1)) {\n return -2;\n }\n\n \/\/ wait for a CC PDU\n DMSG(\"wait for a CC PDU\\n\");\n do {\n if (2 > link.read(headerBuf, headerBufLen)) {\n return -1;\n }\n\n type = getPType(headerBuf);\n if (PDU_CC == type) {\n break;\n } else if (PDU_SYMM == type) {\n if (!link.write(SYMM_PDU, sizeof(SYMM_PDU))) {\n return -2;\n }\n } else {\n return -3;\n }\n\n } while (1);\n\n return 1;\n}\n\nint8_t LLCP::disconnect(uint16_t timeout)\n{\n uint8_t type;\n\n \/\/ try to get a SYMM PDU\n if (2 > link.read(headerBuf, headerBufLen)) {\n return -1;\n }\n type = getPType(headerBuf);\n if (PDU_SYMM != type) {\n return -1;\n }\n\n \/\/ put a DISC PDU\n headerBuf[0] = (LLCP_DEFAULT_DSAP << 2) + (PDU_DISC >> 2);\n headerBuf[1] = ((PDU_DISC & 0x03) << 6) + LLCP_DEFAULT_SSAP;\n if (!link.write(headerBuf, 2)) {\n return -2;\n }\n\n \/\/ wait for a DM PDU\n DMSG(\"wait for a DM PDU\\n\");\n do {\n if (2 > link.read(headerBuf, headerBufLen)) {\n return -1;\n }\n\n type = getPType(headerBuf);\n if (PDU_CC == type) {\n break;\n } else if (PDU_DM == type) {\n if (!link.write(SYMM_PDU, sizeof(SYMM_PDU))) {\n return -2;\n }\n } else {\n return -3;\n }\n\n } while (1);\n\n return 1;\n}\n\nbool LLCP::write(const uint8_t *header, uint8_t hlen, const uint8_t *body, uint8_t blen)\n{\n uint8_t type;\n uint8_t buf[3];\n\n if (mode) {\n \/\/ Get a SYMM PDU\n if (2 != link.read(buf, sizeof(buf))) {\n return false;\n }\n }\n\n if (headerBufLen < (hlen + 3)) {\n return false;\n }\n\n for (int8_t i = hlen - 1; i >= 0; i--) {\n headerBuf[i + 3] = header[i];\n }\n\n headerBuf[0] = (dsap << 2) + (PDU_I >> 2);\n headerBuf[1] = ((PDU_I & 0x3) << 6) + ssap;\n headerBuf[2] = (ns << 4) + nr;\n if (!link.write(headerBuf, 3 + hlen, body, blen)) {\n return false;\n }\n\n ns++;\n\n \/\/ Get a RR PDU\n int16_t status;\n do {\n status = link.read(headerBuf, headerBufLen);\n if (2 > status) {\n return false;\n }\n\n type = getPType(headerBuf);\n if (PDU_RR == type) {\n break;\n } else if (PDU_SYMM == type) {\n if (!link.write(SYMM_PDU, sizeof(SYMM_PDU))) {\n return false;\n }\n } else {\n return false;\n }\n } while (1);\n\n if (!link.write(SYMM_PDU, sizeof(SYMM_PDU))) {\n return false;\n }\n\n return true;\n}\n\nint16_t LLCP::read(uint8_t *buf, uint8_t length)\n{\n uint8_t type;\n int16_t status;\n\n \/\/ Get INFO PDU\n do {\n status = link.read(buf, length);\n if (2 > status) {\n return -1;\n }\n\n type = getPType(buf);\n if (PDU_I == type) {\n break;\n } else if (PDU_SYMM == type) {\n if (!link.write(SYMM_PDU, sizeof(SYMM_PDU))) {\n return -2;\n }\n } else {\n return -3;\n }\n\n } while (1);\n\n uint8_t len = status - 3;\n ssap = getDSAP(buf);\n dsap = getSSAP(buf);\n\n headerBuf[0] = (dsap << 2) + (PDU_RR >> 2);\n headerBuf[1] = ((PDU_RR & 0x3) << 6) + ssap;\n headerBuf[2] = (buf[2] >> 4) + 1;\n if (!link.write(headerBuf, 3)) {\n return -2;\n }\n\n for (uint8_t i = 0; i < len; i++) {\n buf[i] = buf[i + 3];\n }\n\n nr++;\n\n return len;\n}\n<|endoftext|>"} {"text":"<commit_before>\/**\n * Unit Tests for Piezas\n**\/\n\n#include <gtest\/gtest.h>\n#include \"Piezas.h\"\n \nclass PiezasTest : public ::testing::Test\n{\n\tprotected:\n\t\tPiezasTest(){} \/\/constructor runs before each test\n\t\tvirtual ~PiezasTest(){} \/\/destructor cleans up after tests\n\t\tvirtual void SetUp(){} \/\/sets up before each test (after constructor)\n\t\tvirtual void TearDown(){} \/\/clean up after each test, (before destructor) \n};\n\nTEST(PiezasTest, sanityCheck)\n{\n\tASSERT_TRUE(true);\n}<commit_msg>added first few tests<commit_after>\/**\n * Unit Tests for Piezas\n**\/\n\n#include <gtest\/gtest.h>\n#include \"Piezas.h\"\n \nclass PiezasTest : public ::testing::Test\n{\n\tprotected:\n\t\tPiezasTest(){} \/\/constructor runs before each test\n\t\tvirtual ~PiezasTest(){} \/\/destructor cleans up after tests\n\t\tvirtual void SetUp(){} \/\/sets up before each test (after constructor)\n\t\tvirtual void TearDown(){} \/\/clean up after each test, (before destructor) \n};\n\nTEST(PiezasTest, sanityCheck)\n{\n\tASSERT_TRUE(true);\n}\n\nTEST(PiezasTest,CheckPiezas)\n{\n\n bool check1=true;\n Piezas p;\n for(int i=0;i<BOARD_ROWS;i++)\n {\n\tfor(int j=0;j<BOARD_COLS;j++) \n\t{\n if(p.pieceAt(i,j)!=Blank) \n\t{\n check1=false;\n \t }\n }\n }\n ASSERT_TRUE(check1);\n}\n\nTEST(PiezasTest, CheckReset) \n{\n\n Piezas p;\n p.dropPiece(0);\n p.reset();\n bool check2=true;\n\n for(int i = 0; i < BOARD_ROWS; i++)\n {\n\tfor(int j = 0; j < BOARD_COLS; j++)\n\t{\t\t\n\t if(p.pieceAt(i,j) != Blank)\n\t {\n\t\tcheck2=false;\n\t } \t\t\n\n\t}\n }\n\n ASSERT_TRUE(check2);\n\n}\n\nTEST(PiezasTest, toggleCheckO)\n{\n\n Piezas p;\n bool check3=true;\n if(p.toggle_piece_turn()!=O)\n {\n\n check3=false;\n }\n ASSERT_TRUE(check3);\n\n}\n\nTEST(PiezasTest, toggleCheckX) \n{\n\n Piezas p;\n bool check4=true;\n p.toggle_piece_turn();\n if(p.toggle_piece_turn()!=X)\n {\n\n check4=false;\n\n }\n\n ASSERT_TRUE(check4);\n\n}\n\nTEST(PiezasTest, InvalidplacePiece)\n\n{\n\n\tPiezas p;\n\tASSERT_TRUE(p.pieceAt(5,1) == Invalid);\n\n}\n\nTEST(PiezasTest, InvaliddropPiece)\n\n{\n\n Piezas p;\n bool check5= false;\n\n if(p.dropPiece(5)==Invalid)\n {\n check5=true;\n }\n\n ASSERT_TRUE(check5);\n\n}\n\n\nTEST(PiezasTest, fullColumndropPiece)\n\n{\n\n Piezas p;\n\n bool check6=false;\n\n p.dropPiece(0);\n\n p.dropPiece(0);\n\n p.dropPiece(0);\n\n if(p.dropPiece(0)==Blank)\n {\n check6=true;\n }\n\n ASSERT_TRUE(check6);\n\n}\n<|endoftext|>"} {"text":"<commit_before>#include \"Ray.h\"\n\nRay::Ray(sf::Vector2f const& origin, sf::Vector2f const& direction):\n m_origin(origin),\n m_direction(direction),\n m_intersectionFound(false),\n m_minT(0),\n m_obj(nullptr)\n{}\n\nvoid Ray::intersect(INCollisionable & object)\n{\n object.collision(this);\n}\n\nbool Ray::validIntersectionFound() const\n{\n return m_intersectionFound;\n}\n\nbool Ray::intersectionIsObject() const\n{\n return m_obj != nullptr;\n}\n\nObject * Ray::intersectionObject() const\n{\n return m_obj;\n}\n\nsf::Vector2f Ray::intersection() const\n{\n return m_origin + m_direction*m_minT;\n}\n\nfloat Ray::distanceToIntersection() const\n{\n\treturn m_minT;\n}\n\nvoid Ray::resetDistance()\n{\n\tm_minT = 0;\n\tm_intersectionFound = false;\n}\n\nsf::Vector2f Ray::getOrigin() const\n{\n return m_origin;\n}\n\nsf::Vector2f Ray::getDirection() const\n{\n return m_direction;\n}\n\nvoid Ray::setIntersection(float t, Object * obj)\n{\n\tif(t >= 0)\n\t{\n\t\tif(!m_intersectionFound)\n\t\t\tm_minT = t;\n\t\telse\n\t\t\tm_minT = min(m_minT, t);\n\n\t\tm_intersectionFound = true;\n m_obj = obj;\n\t}\n}\n\nbool Ray::intersectCircle(sf::Vector2f circleCenter, float radius, bool saveIntersection)\n{\n float t = -scalar((m_origin - circleCenter), m_direction) \/ normSquare(m_direction);\n sf::Vector2f point = m_origin + t * m_direction;\n float dist = norm(point - circleCenter);\n\n bool intersection = dist <= radius;\n\n if(intersection && saveIntersection)\n setIntersection(t);\n \n\treturn intersection;\n}\n\nbool Ray::intersectSquare(sf::Vector2f pointMin, sf::Vector2f pointMax, bool saveIntersection, Object * obj)\n{\n float t1 = (pointMin.x - m_origin.x)\/m_direction.x;\n float t2 = (pointMax.x - m_origin.x)\/m_direction.x;\n\n float minX = min(t1, t2);\n float maxX = max(t1, t2);\n\n t1 = (pointMin.y - m_origin.y)\/m_direction.y;\n t2 = (pointMax.y - m_origin.y)\/m_direction.y;\n\n float minY = min(t1, t2);\n float maxY = max(t1, t2);\n\n float I = max(minX, minY);\n float M = min(maxX, maxY);\n\n\t\/\/sf::Vector2f center(pointMin.x + 16, pointMin.y + 16);\n\t\/\/float distanceIntersection = norm(center - m_origin);\n\n bool intersection = I <= M;\n\n if(intersection && saveIntersection)\n setIntersection(I, obj);\n\n return intersection;\n}\n<commit_msg>bugfix<commit_after>#include \"Ray.h\"\n\n#include <iostream>\n\nRay::Ray(sf::Vector2f const& origin, sf::Vector2f const& direction):\n m_origin(origin),\n m_direction(direction),\n m_intersectionFound(false),\n m_minT(0),\n m_obj(nullptr)\n{}\n\nvoid Ray::intersect(INCollisionable & object)\n{\n object.collision(this);\n}\n\nbool Ray::validIntersectionFound() const\n{\n return m_intersectionFound;\n}\n\nbool Ray::intersectionIsObject() const\n{\n return m_obj != nullptr;\n}\n\nObject * Ray::intersectionObject() const\n{\n return m_obj;\n}\n\nsf::Vector2f Ray::intersection() const\n{\n return m_origin + m_direction*m_minT;\n}\n\nfloat Ray::distanceToIntersection() const\n{\n\treturn m_minT;\n}\n\nvoid Ray::resetDistance()\n{\n\tm_minT = 0;\n\tm_intersectionFound = false;\n}\n\nsf::Vector2f Ray::getOrigin() const\n{\n return m_origin;\n}\n\nsf::Vector2f Ray::getDirection() const\n{\n return m_direction;\n}\n\nvoid Ray::setIntersection(float t, Object * obj)\n{\n\tif(t >= 0)\n\t{\n\t\tif(!m_intersectionFound || t < m_minT)\n {\n\t\t\tm_minT = t;\n m_obj = obj;\n }\n\n\t\tm_intersectionFound = true;\n\t}\n}\n\nbool Ray::intersectCircle(sf::Vector2f circleCenter, float radius, bool saveIntersection)\n{\n float t = -scalar((m_origin - circleCenter), m_direction) \/ normSquare(m_direction);\n sf::Vector2f point = m_origin + t * m_direction;\n float dist = norm(point - circleCenter);\n\n bool intersection = dist <= radius;\n\n if(intersection && saveIntersection)\n setIntersection(t);\n \n\treturn intersection;\n}\n\nbool Ray::intersectSquare(sf::Vector2f pointMin, sf::Vector2f pointMax, bool saveIntersection, Object * obj)\n{\n float t1 = (pointMin.x - m_origin.x)\/m_direction.x;\n float t2 = (pointMax.x - m_origin.x)\/m_direction.x;\n\n float minX = min(t1, t2);\n float maxX = max(t1, t2);\n\n t1 = (pointMin.y - m_origin.y)\/m_direction.y;\n t2 = (pointMax.y - m_origin.y)\/m_direction.y;\n\n float minY = min(t1, t2);\n float maxY = max(t1, t2);\n\n float I = max(minX, minY);\n float M = min(maxX, maxY);\n\n\t\/\/sf::Vector2f center(pointMin.x + 16, pointMin.y + 16);\n\t\/\/float distanceIntersection = norm(center - m_origin);\n\n bool intersection = I <= M;\n\n if(intersection && saveIntersection)\n setIntersection(I, obj);\n\n return intersection;\n}\n<|endoftext|>"} {"text":"<commit_before>#include <QtGui>\n#include \"Renderer.h\"\n\nconst int IdRole = Qt::UserRole;\n\nRenderer::Renderer(QWidget *parent)\n : QWidget(parent)\n{\n\t\/\/ Initialize a couple variables\n\thasPattern = false;\n\thasImage = false;\n antialiased = true;\n\tpaintedOutline = false;\n\thasImageChanged = false;\n\tgridX = 1;\n\tgridY = 1;\n\toutline = Qt::black;\n\tbrush = Qt::white;\n\tbackground = Qt::white;\n\n\tthis->setAttribute(Qt::WA_NoBackground);\n}\n\nRenderer::~Renderer()\n{\n\tif (hasImage)\n\t{\n\t\thasImage = false;\n\t}\n}\n\nvoid Renderer::newImage(int x, int y)\n{\n\timage = QImage(x,y,QImage::Format_RGB32);\n\timage.fill(brush.rgb());\n\n\tgridX = x;\n\tgridY = y;\n\thasImage = true;\n\thasImageChanged = true;\n\t\n\tupdatePatternSize();\n}\n\nbool Renderer::loadImage(QString imagePath)\n{\n\timage.load(imagePath);\n\tif (!image.isNull())\n\t{\n\t\tgridX = image.width();\n\t\tgridY = image.height();;\n\n\t\thasImage = true;\n\t\thasImageChanged = false;\n\t\tupdatePatternSize();\n\t\treturn true;\n\t}\n\treturn false;\n}\n\nbool Renderer::smartResize(int x, int y)\n{\n\tQImage imageSource;\n\timageSource = image;\n\tif (!imageSource.isNull() && hasPattern)\n\t{\n\t\tint pixelXCount = x\/pattern.getReadX();\n\t\tint pixelYCount = y\/pattern.getReadY();\n\t\tif (pixelXCount%pattern.getReadX()==0)\n\t\t\tpixelXCount--;\n\t\tif (pixelYCount%pattern.getReadY()==0)\n\t\t\tpixelYCount--;\n\n\t\tpixelXCount = pattern.getX()*pixelXCount+pattern.getLargestTileOffsetX();\n\t\tpixelYCount = pattern.getY()*pixelYCount+pattern.getLargestTileOffsetY();\n\n\t\timage = QImage(x, y, QImage::Format_RGB32);\n\n\t\tfor (int i=0; i<x; i++)\n\t\t{\n\t\t\tfor (int j=0; j<y; j++)\n\t\t\t{\n\t\t\t\tint tileX = i%pattern.getReadX();\n\t\t\t\tint tileY = j%pattern.getReadY();\n\t\t\t\tfloat displaceX = pattern.getX()*(i\/pattern.getReadX())+pattern.getTileW(tileX, tileY)\/2.0+pattern.getTileX(tileX,tileY);\n\t\t\t\tfloat displaceY = pattern.getY()*(j\/pattern.getReadY())+pattern.getTileH(tileX, tileY)\/2.0+pattern.getTileY(tileX,tileY);\n\t\t\t\tint ii = int(imageSource.width()\/float(pixelXCount)*displaceX);\n\t\t\t\tint jj = int(imageSource.height()\/float(pixelYCount)*displaceY);\n\n\t\t\t\tif (ii > imageSource.width()-1)\n\t\t\t\t\tii = imageSource.width()-1;\n\t\t\t\tif (jj > imageSource.height()-1)\n\t\t\t\t\tjj = imageSource.height()-1;\n\t\t\t\timage.setPixel(i, j, imageSource.pixel(ii, jj));\n\t\t\t}\n\t\t}\n\n\t\t\/\/ Set the remainder of the values\n\t\tgridX = image.width();\n\t\tgridY = image.height();\n\n\t\thasImage = true;\n\t\thasImageChanged = true;\n\t\tupdatePatternSize();\n\t\treturn true;\n\t}\n\treturn false;\n}\n\nQSize Renderer::smartResizeTip()\n{\n\tif (hasPattern && hasImage)\n\t{\n\t\treturn QSize(image.width()*pattern.getReadX()*20\/pattern.getX(),image.height()*pattern.getReadY()*20\/pattern.getY());\n\t}\n\tif (hasImage)\n\t\treturn QSize(image.size());\n\treturn QSize(1,1);\n}\n\nvoid Renderer::resizeImage(int x, int y)\n{\n\tif (!image.isNull())\n\t{\n\t\timage = image.scaled(x,y);\n\t\t\n\t\tgridX = image.width();\n\t\tgridY = image.height();\n\n\t\tupdatePatternSize();\n\t\thasImageChanged = true;\n\t}\n}\n\nvoid Renderer::changePalette(QString colorFile)\n{\n\tif (!image.isNull())\n\t{\n\t\tQVector<QRgb> newColorTable;\n\t\tQImage paletteImage;\n\t\tpaletteImage.load(colorFile);\n\t\tif (!paletteImage.isNull())\n\t\t{\n\t\t\tfor (int i=0; i<paletteImage.width(); i++)\n\t\t\t{\n\t\t\t\tnewColorTable.push_back(paletteImage.pixel(i,0));\n\t\t\t}\n\t\t\timage = image.convertToFormat(QImage::Format_Indexed8, newColorTable, Qt::ColorOnly);\n\t\t\timage = image.convertToFormat(QImage::Format_RGB32, newColorTable, Qt::ColorOnly);\n\t\t\tupdate();\n\t\t\thasImageChanged = true;\n\t\t}\n\t}\n}\n\nvoid Renderer::setBackgroundColor(QColor color)\n{\n\tbackground = color;\n\tpaintedOutline = false;\n}\n\nvoid Renderer::setOutlineColor(QColor color)\n{\n\toutline = color;\n\tpaintedOutline = false;\n}\n\nvoid Renderer::setBrushColor(QColor color)\n{\n\tbrush = color;\n}\n\nvoid Renderer::rotateTranspose()\n{\n\trotate(QTransform(0,-1,-1,0,1,1));\n}\n\nvoid Renderer::rotateClockwise()\n{\n\trotate(QTransform(0,1,-1,0,1,1));\n}\n\nvoid Renderer::rotateCounterClockwise()\n{\n\trotate(QTransform(0,-1,1,0,1,1));\n}\n\nvoid Renderer::rotate180()\n{\n\trotate(QTransform(-1,0,0,-1,1,1));\n}\n\nvoid Renderer::rotateFlipX()\n{\n\trotate(QTransform(-1,0,0,1,1,1));\n}\n\nvoid Renderer::rotateFlipY()\n{\n\trotate(QTransform(1,0,0,-1,1,1));\n}\n\nvoid Renderer::zoomIn()\n{\n\tzoom*=1.1;\n\tupdatePatternSize();\n}\n\nvoid Renderer::zoomOut()\n{\n\tzoom*=0.9;\n\tupdatePatternSize();\n}\n\nvoid Renderer::zoomNormal()\n{\n\tzoom=1.0;\n\tupdatePatternSize();\n}\n\nbool Renderer::setPattern(QDir dir)\n{\n\t\/\/std::cout << \"Loaded Pattern: \" << dir.dirName().toStdString() << \"\\n\";\n\tif (pattern.loadPattern(dir))\n\t{\n\t\tzoom = 1;\n\t\thasPattern = true;\n\t\tupdatePatternSize();\n\t\treturn true;\n\t}\n\telse\n\t\thasPattern = false;\n\tupdatePatternSize();\n\treturn false;\n}\n\nQSize Renderer::getMinSize()\n{\n\tupdatePatternSize();\n\treturn QSize(sizeX,sizeY);\n}\n\nQSize Renderer::getImageSize()\n{\n\tif (!image.isNull())\n\t\treturn image.size();\n\treturn QSize(1,1);\n}\n\nbool Renderer::saveImage(QString saveFileName)\n{\n\tif (hasImage)\n\t{\n\t\tbool wasSaved = image.save(saveFileName);\n\t\tif (wasSaved)\n\t\t\thasImageChanged = false;\n\t\treturn wasSaved;\n\t}\n\treturn false;\n}\n\nbool Renderer::imageChanged()\n{\n\tif (hasImage && hasPattern)\n\t\treturn hasImageChanged;\n\treturn false;\n}\n\nbool Renderer::hasPatternSelected()\n{\n\treturn hasPattern;\n}\n\nvoid Renderer::countColors(QVector<QRgb> *colors, QVector<int> *counts)\n{\n\tif (hasImage)\n\t{\n\t\tcolors->clear();\n\t\tcounts->clear();\n\t\tQImage newImage = image.convertToFormat(QImage::Format_Indexed8, Qt::ColorOnly);\n\t\t\n\t\tfor (int i=0; i<image.width(); i++)\n\t\t{\n\t\t\tfor (int j=0; j<image.height(); j++)\n\t\t\t{\n\t\t\t\tint location = colors->indexOf(image.pixel(i,j));\n\t\t\t\tif (location >= 0)\n\t\t\t\t{\n\t\t\t\t\tcounts->replace(location,counts->value(location)+1);\n\t\t\t\t}\n\t\t\t\telse\n\t\t\t\t{\n\t\t\t\t\tcolors->push_back(image.pixel(i,j));\n\t\t\t\t\tcounts->push_back(1);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n}\n\nvoid Renderer::paintEvent(QPaintEvent *e)\n{\n\tQPainter painter(this);\n\n\tif (hasPattern && hasImage)\n\t{\n\t\tint x=0;\n\t\tint y=0;\n\t\tint gridCountX = int(gridX\/pattern.getReadX());\n\t\tint gridXStart = int(e->region().boundingRect().left()\/zoom\/zoom\/pattern.getX())-1;\n\t\tint gridXEnd = int(e->region().boundingRect().right()\/zoom\/zoom\/pattern.getX())+2;\n\t\tint gridCountY = int(gridY\/pattern.getReadY());\n\t\tint gridYStart = int(e->region().boundingRect().top()\/zoom\/zoom\/pattern.getY())-1;\n\t\tint gridYEnd = int(e->region().boundingRect().bottom()\/zoom\/zoom\/pattern.getY())+2;\n\n\t\tif (gridXStart<0)\n\t\t\tgridXStart=0;\n\t\tif (gridYStart<0)\n\t\t\tgridYStart=0;\n\t\tif (gridXEnd>gridCountX)\n\t\t\tgridXEnd=gridCountX;\n\t\tif (gridYEnd>gridCountY)\n\t\t\tgridYEnd=gridCountY;\n\n\t\t\/\/ Paint the outline and background\n\t\tpainter.setBackgroundMode(Qt::OpaqueMode);\n\t\tpainter.setBackground(QBrush(background));\n\t\tfor (int i=gridXStart; i<=gridXEnd+1; i++)\n\t\t{\n\t\t\tx=int(pattern.getX()*zoom)*i;\n\t\t\tfor (int j=gridYStart; j<=gridYEnd+1; j++)\n\t\t\t{\n\t\t\t\ty=int(pattern.getY()*zoom)*j;\n\t\t\t\tpainter.save();\n\t\t\t\tpainter.scale(zoom,zoom);\n\t\t\t\tpainter.translate(x,y);\n\t\t\t\tpainter.scale(zoom,zoom);\n\n\t\t\t\tpainter.setPen(outline);\n\t\t\t\tpainter.drawPixmap(0,0,QBitmap(pattern.getBackground()));\n\n\t\t\t\tpainter.restore();\n\t\t\t}\n\t\t}\n\t\tpainter.setBackgroundMode(Qt::TransparentMode);\n\n\t\t\/\/ Paint the imageGrid\n\t\tfor (int i=gridXStart; i<=gridXEnd; i++)\n\t\t{\n\t\t\tx=int(pattern.getX()*zoom)*i;\n\t\t\tfor (int j=gridYStart; j<=gridYEnd; j++)\n\t\t\t{\n\t\t\t\ty=int(pattern.getY()*zoom)*j;\n\t\t\t\tpainter.save();\n\t\t\t\tpainter.scale(zoom,zoom);\n\t\t\t\tpainter.translate(x,y);\n\t\t\t\tpainter.scale(zoom,zoom);\n\n\t\t\t\t\/\/ Paint tiles\n\t\t\t\tfor (int tileX=0; tileX < pattern.getReadX(); tileX++)\n\t\t\t\t{\n\t\t\t\t\tfor (int tileY=0; tileY < pattern.getReadY(); tileY++)\n\t\t\t\t\t{\n\t\t\t\t\t\tint pixelX = i*(pattern.getReadX())+pattern.getTileReadX(tileX, tileY);\n\t\t\t\t\t\tint pixelY = j*(pattern.getReadY())+pattern.getTileReadY(tileX, tileY);\n\t\t\t\t\t\tif (pixelX < gridX && pixelY < gridY)\n\t\t\t\t\t\t{\n\t\t\t\t\t\t\tpainter.setPen(image.pixel(pixelX, pixelY));\n\t\t\t\t\t\t\tpainter.drawPixmap(pattern.getTileX(tileX, tileY),pattern.getTileY(tileX, tileY), QBitmap(pattern.getTile(tileX, tileY)));\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\tpainter.restore();\n\t\t\t}\n\t\t}\n\t}\n\tpainter.end();\n}\n\nvoid Renderer::mousePressEvent(QMouseEvent *e)\n{\n\tif (hasImage && hasPattern)\n\t{\n\t\t\/\/ Starting positions to test\n\t\tint eX = int(e->x()\/zoom\/zoom);\n\t\tint eY = int(e->y()\/zoom\/zoom);\n\t\tint startX = int(e->x()\/zoom\/zoom\/pattern.getX());\n\t\tint startY = int(e->y()\/zoom\/zoom\/pattern.getY());\n\n\t\t\/\/ Search 3x3 patterned area\n\t\tfor (int i=-1; i<2; i++)\n\t\t{\n\t\t\tfor (int j=-1; j<2; j++)\n\t\t\t{\n\t\t\t\tint curX = i+startX;\n\t\t\t\tint curY = j+startY;\n\n\t\t\t\tif (curX >= 0 && curX < gridX && curY >= 0 && curY < gridY)\n\t\t\t\t{\n\t\t\t\t\t\/\/ Search all subtiles\n\t\t\t\t\tfor (int tileX=0; tileX<pattern.getReadX(); tileX++)\n\t\t\t\t\t{\n\t\t\t\t\t\tfor (int tileY=0; tileY<pattern.getReadY(); tileY++)\n\t\t\t\t\t\t{\n\t\t\t\t\t\t\tQBitmap tile = pattern.getTile(tileX,tileY);\n\t\t\t\t\t\t\tint xTest = eX-(curX*pattern.getX()+pattern.getTileX(tileX,tileY));\n\t\t\t\t\t\t\tint yTest = eY-(curY*pattern.getY()+pattern.getTileY(tileX,tileY));\n\t\t\t\t\t\t\tif (tile.rect().contains(xTest,yTest))\n\t\t\t\t\t\t\t{\n\t\t\t\t\t\t\t\t\/\/ Check if clicked pixel is within tile mask\n\t\t\t\t\t\t\t\tif (QColor(tile.toImage().pixel(xTest,yTest)).black()>0)\n\t\t\t\t\t\t\t\t{\n\t\t\t\t\t\t\t\t\tint pixelX = curX*pattern.getReadX()+pattern.getTileReadX(tileX,tileY);\n\t\t\t\t\t\t\t\t\tint pixelY = curY*pattern.getReadY()+pattern.getTileReadY(tileX,tileY);\n\t\t\t\t\t\t\t\t\t\/\/ Make sure clicked image pixel is inside the image\n\t\t\t\t\t\t\t\t\tif (pixelX < gridX && pixelY < gridY)\n\t\t\t\t\t\t\t\t\t{\n\t\t\t\t\t\t\t\t\t\timage.setPixel(pixelX,pixelY,brush.rgb());\n\t\t\t\t\t\t\t\t\t\tupdate();\n\t\t\t\t\t\t\t\t\t\thasImageChanged = true;\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\t\t\t\t}\n\t\t\t}\t\n\t\t}\n\t}\n}\n\nvoid Renderer::updatePatternSize()\n{\n\tif (hasImage && hasPattern)\n\t{\n\t\tfloat gridXCount = gridX\/pattern.getReadX();\n\t\tfloat gridYCount = gridY\/pattern.getReadY();\n\t\tif (gridX%pattern.getReadX()==0)\n\t\t\tgridXCount--;\n\t\tif (gridY%pattern.getReadY()==0)\n\t\t\tgridYCount--;\n\n\t\tsizeX = int((pattern.getX()*gridXCount+pattern.getLargestTileOffsetX())*zoom*zoom);\n\t\tsizeY = int((pattern.getY()*gridYCount+pattern.getLargestTileOffsetY())*zoom*zoom);\n\n\t\tpaintedOutline = false;\n\t\tupdate();\n\t}\n\telse\n\t{\n\t\tsizeX = 1;\n\t\tsizeY = 1;\n\t}\n}\n\nvoid Renderer::rotate(QTransform matrix)\n{\n\tif (hasImage)\n\t{\n\t\tQImage newImage = image.transformed(matrix);\n\t\timage.swap(newImage); \n\n\t\tgridX = image.width();\n\t\tgridY = image.height();\n\t\t\n\t\tupdatePatternSize();\n\t\thasImageChanged = true;\n\t}\n}\n\n\n<commit_msg>Fixing artifacts created during zooming<commit_after>#include <QtGui>\n#include \"Renderer.h\"\n\nRenderer::Renderer(QWidget *parent)\n : QWidget(parent)\n{\n\t\/\/ Initialize a couple variables\n\thasPattern = false;\n\thasImage = false;\n antialiased = true;\n\tpaintedOutline = false;\n\thasImageChanged = false;\n\tgridX = 1;\n\tgridY = 1;\n\toutline = Qt::black;\n\tbrush = Qt::white;\n\tbackground = Qt::white;\n\n\tthis->setAttribute(Qt::WA_NoBackground);\n}\n\nRenderer::~Renderer()\n{\n\tif (hasImage)\n\t{\n\t\thasImage = false;\n\t}\n}\n\nvoid Renderer::newImage(int x, int y)\n{\n\timage = QImage(x,y,QImage::Format_RGB32);\n\timage.fill(brush.rgb());\n\n\tgridX = x;\n\tgridY = y;\n\thasImage = true;\n\thasImageChanged = true;\n\t\n\tupdatePatternSize();\n}\n\nbool Renderer::loadImage(QString imagePath)\n{\n\timage.load(imagePath);\n\tif (!image.isNull())\n\t{\n\t\tgridX = image.width();\n\t\tgridY = image.height();;\n\n\t\thasImage = true;\n\t\thasImageChanged = false;\n\t\tupdatePatternSize();\n\t\treturn true;\n\t}\n\treturn false;\n}\n\nbool Renderer::smartResize(int x, int y)\n{\n\tQImage imageSource;\n\timageSource = image;\n\tif (!imageSource.isNull() && hasPattern)\n\t{\n\t\tint pixelXCount = x\/pattern.getReadX();\n\t\tint pixelYCount = y\/pattern.getReadY();\n\t\tif (pixelXCount%pattern.getReadX()==0)\n\t\t\tpixelXCount--;\n\t\tif (pixelYCount%pattern.getReadY()==0)\n\t\t\tpixelYCount--;\n\n\t\tpixelXCount = pattern.getX()*pixelXCount+pattern.getLargestTileOffsetX();\n\t\tpixelYCount = pattern.getY()*pixelYCount+pattern.getLargestTileOffsetY();\n\n\t\timage = QImage(x, y, QImage::Format_RGB32);\n\n\t\tfor (int i=0; i<x; i++)\n\t\t{\n\t\t\tfor (int j=0; j<y; j++)\n\t\t\t{\n\t\t\t\tint tileX = i%pattern.getReadX();\n\t\t\t\tint tileY = j%pattern.getReadY();\n\t\t\t\tfloat displaceX = pattern.getX()*(i\/pattern.getReadX())+pattern.getTileW(tileX, tileY)\/2.0+pattern.getTileX(tileX,tileY);\n\t\t\t\tfloat displaceY = pattern.getY()*(j\/pattern.getReadY())+pattern.getTileH(tileX, tileY)\/2.0+pattern.getTileY(tileX,tileY);\n\t\t\t\tint ii = int(imageSource.width()\/float(pixelXCount)*displaceX);\n\t\t\t\tint jj = int(imageSource.height()\/float(pixelYCount)*displaceY);\n\n\t\t\t\tif (ii > imageSource.width()-1)\n\t\t\t\t\tii = imageSource.width()-1;\n\t\t\t\tif (jj > imageSource.height()-1)\n\t\t\t\t\tjj = imageSource.height()-1;\n\t\t\t\timage.setPixel(i, j, imageSource.pixel(ii, jj));\n\t\t\t}\n\t\t}\n\n\t\t\/\/ Set the remainder of the values\n\t\tgridX = image.width();\n\t\tgridY = image.height();\n\n\t\thasImage = true;\n\t\thasImageChanged = true;\n\t\tupdatePatternSize();\n\t\treturn true;\n\t}\n\treturn false;\n}\n\nQSize Renderer::smartResizeTip()\n{\n\tif (hasPattern && hasImage)\n\t{\n\t\treturn QSize(image.width()*pattern.getReadX()*20\/pattern.getX(),image.height()*pattern.getReadY()*20\/pattern.getY());\n\t}\n\tif (hasImage)\n\t\treturn QSize(image.size());\n\treturn QSize(1,1);\n}\n\nvoid Renderer::resizeImage(int x, int y)\n{\n\tif (!image.isNull())\n\t{\n\t\timage = image.scaled(x,y);\n\t\t\n\t\tgridX = image.width();\n\t\tgridY = image.height();\n\n\t\tupdatePatternSize();\n\t\thasImageChanged = true;\n\t}\n}\n\nvoid Renderer::changePalette(QString colorFile)\n{\n\tif (!image.isNull())\n\t{\n\t\tQVector<QRgb> newColorTable;\n\t\tQImage paletteImage;\n\t\tpaletteImage.load(colorFile);\n\t\tif (!paletteImage.isNull())\n\t\t{\n\t\t\tfor (int i=0; i<paletteImage.width(); i++)\n\t\t\t{\n\t\t\t\tnewColorTable.push_back(paletteImage.pixel(i,0));\n\t\t\t}\n\t\t\timage = image.convertToFormat(QImage::Format_Indexed8, newColorTable, Qt::ColorOnly);\n\t\t\timage = image.convertToFormat(QImage::Format_RGB32, newColorTable, Qt::ColorOnly);\n\t\t\tupdate();\n\t\t\thasImageChanged = true;\n\t\t}\n\t}\n}\n\nvoid Renderer::setBackgroundColor(QColor color)\n{\n\tbackground = color;\n\tpaintedOutline = false;\n}\n\nvoid Renderer::setOutlineColor(QColor color)\n{\n\toutline = color;\n\tpaintedOutline = false;\n}\n\nvoid Renderer::setBrushColor(QColor color)\n{\n\tbrush = color;\n}\n\nvoid Renderer::rotateTranspose()\n{\n\trotate(QTransform(0,-1,-1,0,1,1));\n}\n\nvoid Renderer::rotateClockwise()\n{\n\trotate(QTransform(0,1,-1,0,1,1));\n}\n\nvoid Renderer::rotateCounterClockwise()\n{\n\trotate(QTransform(0,-1,1,0,1,1));\n}\n\nvoid Renderer::rotate180()\n{\n\trotate(QTransform(-1,0,0,-1,1,1));\n}\n\nvoid Renderer::rotateFlipX()\n{\n\trotate(QTransform(-1,0,0,1,1,1));\n}\n\nvoid Renderer::rotateFlipY()\n{\n\trotate(QTransform(1,0,0,-1,1,1));\n}\n\nvoid Renderer::zoomIn()\n{\n\tzoom*=1.1;\n\tupdatePatternSize();\n}\n\nvoid Renderer::zoomOut()\n{\n\tzoom*=0.9;\n\tupdatePatternSize();\n}\n\nvoid Renderer::zoomNormal()\n{\n\tzoom=1.0;\n\tupdatePatternSize();\n}\n\nbool Renderer::setPattern(QDir dir)\n{\n\t\/\/std::cout << \"Loaded Pattern: \" << dir.dirName().toStdString() << \"\\n\";\n\tif (pattern.loadPattern(dir))\n\t{\n\t\tzoom = 1;\n\t\thasPattern = true;\n\t\tupdatePatternSize();\n\t\treturn true;\n\t}\n\telse\n\t\thasPattern = false;\n\tupdatePatternSize();\n\treturn false;\n}\n\nQSize Renderer::getMinSize()\n{\n\tupdatePatternSize();\n\treturn QSize(sizeX,sizeY);\n}\n\nQSize Renderer::getImageSize()\n{\n\tif (!image.isNull())\n\t\treturn image.size();\n\treturn QSize(1,1);\n}\n\nbool Renderer::saveImage(QString saveFileName)\n{\n\tif (hasImage)\n\t{\n\t\tbool wasSaved = image.save(saveFileName);\n\t\tif (wasSaved)\n\t\t\thasImageChanged = false;\n\t\treturn wasSaved;\n\t}\n\treturn false;\n}\n\nbool Renderer::imageChanged()\n{\n\tif (hasImage && hasPattern)\n\t\treturn hasImageChanged;\n\treturn false;\n}\n\nbool Renderer::hasPatternSelected()\n{\n\treturn hasPattern;\n}\n\nvoid Renderer::countColors(QVector<QRgb> *colors, QVector<int> *counts)\n{\n\tif (hasImage)\n\t{\n\t\tcolors->clear();\n\t\tcounts->clear();\n\t\tQImage newImage = image.convertToFormat(QImage::Format_Indexed8, Qt::ColorOnly);\n\t\t\n\t\tfor (int i=0; i<image.width(); i++)\n\t\t{\n\t\t\tfor (int j=0; j<image.height(); j++)\n\t\t\t{\n\t\t\t\tint location = colors->indexOf(image.pixel(i,j));\n\t\t\t\tif (location >= 0)\n\t\t\t\t{\n\t\t\t\t\tcounts->replace(location,counts->value(location)+1);\n\t\t\t\t}\n\t\t\t\telse\n\t\t\t\t{\n\t\t\t\t\tcolors->push_back(image.pixel(i,j));\n\t\t\t\t\tcounts->push_back(1);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n}\n\nvoid Renderer::paintEvent(QPaintEvent *e)\n{\n\tQPainter painter(this);\n\n\tif (hasPattern && hasImage)\n\t{\n\t\tint x=0;\n\t\tint y=0;\n\t\tint gridCountX = int(gridX\/pattern.getReadX());\n\t\tint gridXStart = int(e->region().boundingRect().left()\/zoom\/pattern.getX())-1;\n\t\tint gridXEnd = int(e->region().boundingRect().right()\/zoom\/pattern.getX())+2;\n\t\tint gridCountY = int(gridY\/pattern.getReadY());\n\t\tint gridYStart = int(e->region().boundingRect().top()\/zoom\/pattern.getY())-1;\n\t\tint gridYEnd = int(e->region().boundingRect().bottom()\/zoom\/pattern.getY())+2;\n\n\t\tif (gridXStart<0)\n\t\t\tgridXStart=0;\n\t\tif (gridYStart<0)\n\t\t\tgridYStart=0;\n\t\tif (gridXEnd>gridCountX)\n\t\t\tgridXEnd=gridCountX;\n\t\tif (gridYEnd>gridCountY)\n\t\t\tgridYEnd=gridCountY;\n\n\t\tpainter.scale(zoom,zoom);\n\n\t\t\/\/ Paint the outline and background\n\t\tpainter.setBackgroundMode(Qt::OpaqueMode);\n\t\tpainter.setBackground(QBrush(background));\n\t\tpainter.setPen(outline);\n\t\tpainter.drawTiledPixmap(0,0,sizeX\/zoom,sizeY\/zoom,QBitmap(pattern.getBackground()));\n\t\tpainter.setBackgroundMode(Qt::TransparentMode);\n\n\t\t\/\/ Paint the imageGrid\n\t\tfor (int i=gridXStart; i<=gridXEnd; i++)\n\t\t{\n\t\t\tx=int(pattern.getX())*i;\n\t\t\tfor (int j=gridYStart; j<=gridYEnd; j++)\n\t\t\t{\n\t\t\t\ty=int(pattern.getY())*j;\n\n\t\t\t\t\/\/ Paint tiles\n\t\t\t\tpainter.save();\n\t\t\t\tpainter.translate(x,y);\n\t\t\t\tfor (int tileX=0; tileX < pattern.getReadX(); tileX++)\n\t\t\t\t{\n\t\t\t\t\tfor (int tileY=0; tileY < pattern.getReadY(); tileY++)\n\t\t\t\t\t{\n\t\t\t\t\t\tint pixelX = i*(pattern.getReadX())+pattern.getTileReadX(tileX, tileY);\n\t\t\t\t\t\tint pixelY = j*(pattern.getReadY())+pattern.getTileReadY(tileX, tileY);\n\t\t\t\t\t\tif (pixelX < gridX && pixelY < gridY)\n\t\t\t\t\t\t{\n\t\t\t\t\t\t\tpainter.setPen(image.pixel(pixelX, pixelY));\n\t\t\t\t\t\t\tpainter.drawPixmap(pattern.getTileX(tileX, tileY),pattern.getTileY(tileX, tileY), QBitmap(pattern.getTile(tileX, tileY)));\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\tpainter.restore();\n\t\t\t}\n\t\t}\n\t}\n\tpainter.end();\n}\n\nvoid Renderer::mousePressEvent(QMouseEvent *e)\n{\n\tif (hasImage && hasPattern)\n\t{\n\t\t\/\/ Starting positions to test\n\t\tint eX = int(e->x()\/zoom);\n\t\tint eY = int(e->y()\/zoom);\n\t\tint startX = int(e->x()\/zoom\/pattern.getX());\n\t\tint startY = int(e->y()\/zoom\/pattern.getY());\n\n\t\t\/\/ Search 3x3 patterned area\n\t\tfor (int i=-1; i<2; i++)\n\t\t{\n\t\t\tfor (int j=-1; j<2; j++)\n\t\t\t{\n\t\t\t\tint curX = i+startX;\n\t\t\t\tint curY = j+startY;\n\n\t\t\t\tif (curX >= 0 && curX < gridX && curY >= 0 && curY < gridY)\n\t\t\t\t{\n\t\t\t\t\t\/\/ Search all subtiles\n\t\t\t\t\tfor (int tileX=0; tileX<pattern.getReadX(); tileX++)\n\t\t\t\t\t{\n\t\t\t\t\t\tfor (int tileY=0; tileY<pattern.getReadY(); tileY++)\n\t\t\t\t\t\t{\n\t\t\t\t\t\t\tQBitmap tile = pattern.getTile(tileX,tileY);\n\t\t\t\t\t\t\tint xTest = eX-(curX*pattern.getX()+pattern.getTileX(tileX,tileY));\n\t\t\t\t\t\t\tint yTest = eY-(curY*pattern.getY()+pattern.getTileY(tileX,tileY));\n\t\t\t\t\t\t\tif (tile.rect().contains(xTest,yTest))\n\t\t\t\t\t\t\t{\n\t\t\t\t\t\t\t\t\/\/ Check if clicked pixel is within tile mask\n\t\t\t\t\t\t\t\tif (QColor(tile.toImage().pixel(xTest,yTest)).black()>0)\n\t\t\t\t\t\t\t\t{\n\t\t\t\t\t\t\t\t\tint pixelX = curX*pattern.getReadX()+pattern.getTileReadX(tileX,tileY);\n\t\t\t\t\t\t\t\t\tint pixelY = curY*pattern.getReadY()+pattern.getTileReadY(tileX,tileY);\n\t\t\t\t\t\t\t\t\t\/\/ Make sure clicked image pixel is inside the image\n\t\t\t\t\t\t\t\t\tif (pixelX < gridX && pixelY < gridY)\n\t\t\t\t\t\t\t\t\t{\n\t\t\t\t\t\t\t\t\t\timage.setPixel(pixelX,pixelY,brush.rgb());\n\t\t\t\t\t\t\t\t\t\tupdate();\n\t\t\t\t\t\t\t\t\t\thasImageChanged = true;\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\t\t\t\t}\n\t\t\t}\t\n\t\t}\n\t}\n}\n\nvoid Renderer::updatePatternSize()\n{\n\tif (hasImage && hasPattern)\n\t{\n\t\tfloat gridXCount = gridX\/pattern.getReadX();\n\t\tfloat gridYCount = gridY\/pattern.getReadY();\n\t\tif (gridX%pattern.getReadX()==0)\n\t\t\tgridXCount--;\n\t\tif (gridY%pattern.getReadY()==0)\n\t\t\tgridYCount--;\n\n\t\tsizeX = int((pattern.getX()*gridXCount+pattern.getLargestTileOffsetX())*zoom);\n\t\tsizeY = int((pattern.getY()*gridYCount+pattern.getLargestTileOffsetY())*zoom);\n\n\t\tpaintedOutline = false;\n\t\tupdate();\n\t}\n\telse\n\t{\n\t\tsizeX = 1;\n\t\tsizeY = 1;\n\t}\n}\n\nvoid Renderer::rotate(QTransform matrix)\n{\n\tif (hasImage)\n\t{\n\t\tQImage newImage = image.transformed(matrix);\n\t\timage.swap(newImage); \n\n\t\tgridX = image.width();\n\t\tgridY = image.height();\n\t\t\n\t\tupdatePatternSize();\n\t\thasImageChanged = true;\n\t}\n}\n\n\n<|endoftext|>"} {"text":"<commit_before>#include \"Settings.h\"\n#include <QDir>\n#include <QStandardPaths>\n#include \"SimpleCrypt.h\"\n#include \"Log.h\"\n#include \"ToolBase.h\"\n#include \"Exceptions.h\"\n#include \"Helper.h\"\n\n\nbool Settings::settingsApplicationUserExists()\n{\n\tQStringList default_paths = QStandardPaths::standardLocations(QStandardPaths::AppLocalDataLocation);\n\tif(default_paths.isEmpty()) return false;\n\n\tQString filename = default_paths[0] + QDir::separator() + QCoreApplication::applicationName() + \"_local.ini\";\n\tif (!QFile::exists(filename)) return false;\n\n\treturn true;\n}\n\nQSettings& Settings::settingsApplicationUser()\n{\n\tstatic QSettings* settings = 0;\n\tif(settings==0)\n\t{\n\t\tQStringList default_paths = QStandardPaths::standardLocations(QStandardPaths::AppLocalDataLocation);\n\t\tif(default_paths.isEmpty()) THROW(Exception, \"No local application data path was found!\");\n\t\tQString path = default_paths[0];\n\t\tif (!QDir().mkpath(path)) THROW(Exception, \"Could not create application data path '\" + path + \"'!\");\n\n\t\t\/\/set log file\n\t\tQString filename = path + QDir::separator() + QCoreApplication::applicationName() + \"_local.ini\";\n\t\tsettings = new QSettings(filename, QSettings::IniFormat);\n\t}\n\treturn *settings;\n}\n\nconst QSettings& Settings::settingsApplication()\n{\n\tstatic QSettings* settings = 0;\n\tif(settings==0)\n\t{\n\t\tQString filename = QCoreApplication::applicationDirPath() + QDir::separator() + QCoreApplication::applicationName() + \".ini\";\n\t\tsettings = new QSettings(filename, QSettings::IniFormat);\n\t}\n\treturn *settings;\n}\n\nconst QSettings& Settings::settingsGeneral()\n{\n\tstatic QSettings* settings = 0;\n\tif(settings==0)\n\t{\n\t\tQString filename = QCoreApplication::applicationDirPath() + QDir::separator() + \"settings.ini\";\n\t\tsettings = new QSettings(filename, QSettings::IniFormat);\n\t}\n\treturn *settings;\n}\n\nint Settings::integer(QString key)\n{\n\treturn valueWithFallback(key).toInt();\n}\n\nvoid Settings::setInteger(QString key, int value)\n{\n\tsettingsApplicationUser().setValue(key, value);\n}\n\nQString Settings::string(QString key, bool optional)\n{\n\tif (optional && !contains(key)) return \"\";\n\n\tQString value = valueWithFallback(key).toString();\n\n\t\/\/decrypt if encrypted\n\tQString crypt_prefix = \"encrypted:\";\n\tif (value.startsWith(crypt_prefix))\n\t{\n\t\t\/\/remove prefix\n\t\tvalue = value.mid(crypt_prefix.count()).trimmed();\n\n\t\t\/\/decrypt\n\t\tqulonglong crypt_key = ToolBase::encryptionKey(\"setting entry '\" + key + \"'\");\n\t\tvalue = SimpleCrypt(crypt_key).decryptToString(value);\n\t}\n\n\treturn value;\n}\n\nvoid Settings::setString(QString key, QString value)\n{\n\tsettingsApplicationUser().setValue(key, value);\n}\n\n\nQStringList Settings::stringList(QString key, bool optional)\n{\n\tif (optional && !contains(key)) return QStringList();\n\n\treturn valueWithFallback(key).toStringList();\n}\n\nvoid Settings::setStringList(QString key, QStringList value)\n{\n\tsettingsApplicationUser().setValue(key, value);\n}\n\n\nbool Settings::boolean(QString key, bool optional)\n{\n\tif (optional && !contains(key)) return false;\n\n\treturn valueWithFallback(key).toBool();\n}\n\nvoid Settings::setBoolean(QString key, bool value)\n{\n\tsettingsApplicationUser().setValue(key, value);\n}\n\nQMap<QString, QVariant> Settings::map(QString key, bool optional)\n{\n\tif (optional && !contains(key)) QMap<QString, QVariant>();\n\n\treturn valueWithFallback(key).toMap();\n}\n\nvoid Settings::setMap(QString key, QMap<QString, QVariant> value)\n{\n\tsettingsApplicationUser().setValue(key, value);\n}\n\nQString Settings::path(QString key, bool optional)\n{\n\tif (optional && !contains(key)) return \"\";\n\n\tQString path = string(key).trimmed();\n\n\t\/\/convert separators\n\tpath = Helper::canonicalPath(path);\n\n\t\/\/add separator at the end if missing from path\n\tif (QFile::exists(path) && QFileInfo(path).isDir() && !path.endsWith(QDir::separator()))\n\t{\n\t\tpath += QDir::separator();\n\t}\n\n\treturn path;\n}\n\nvoid Settings::setPath(QString key, QString path)\n{\n\tQFileInfo info(path);\n\tif (info.isFile())\n\t{\n\t\tpath = info.absolutePath();\n\t}\n\n\tif (QDir(path).exists())\n\t{\n\t\tsetString(key, Helper::canonicalPath(path));\n\t}\n}\n\nvoid Settings::clear()\n{\n\tsettingsApplicationUser().clear();\n}\n\nvoid Settings::remove(QString key)\n{\n\tsettingsApplicationUser().remove(key);\n}\n\nQStringList Settings::allKeys()\n{\n\tQStringList output;\n\n\tif (settingsApplicationUserExists())\n\t{\n\t\toutput << settingsApplicationUser().allKeys();\n\t}\n\toutput << settingsApplication().allKeys();\n\toutput << settingsGeneral().allKeys();\n\n\tstd::sort(output.begin(), output.end());\n\toutput.removeDuplicates();\n\n\treturn output;\n}\n\nbool Settings::contains(QString key)\n{\n\t\/\/check if key exists\n\tbool key_exists = (settingsApplicationUserExists() && settingsApplicationUser().contains(key)) || settingsApplication().contains(key) || settingsGeneral().contains(key);\n\tif (!key_exists) return false;\n\n\t\/\/if the key exists, check that the value is not empty\n\treturn valueWithFallback(key).toString().trimmed()!=\"\";\n}\n\nQVariant Settings::valueWithFallback(QString key)\n{\n\tif (settingsApplicationUserExists() && settingsApplicationUser().contains(key))\n\t{\n\t\treturn settingsApplicationUser().value(key);\n\t}\n\n\tif (settingsApplication().contains(key))\n\t{\n\t\treturn settingsApplication().value(key);\n\t}\n\n\tif (settingsGeneral().contains(key))\n\t{\n\t\treturn settingsGeneral().value(key);\n\t}\n\n\tTHROW(ProgrammingException, \"Requested key '\" + key + \"' not found in settings!\");\n}\n<commit_msg>Fixed two bugs in Settings class: - QSettings sometimes cached changes in RAM: fixed by forced sync after writing - contains method did not work correctly for string list and map<commit_after>#include \"Settings.h\"\n#include <QDir>\n#include <QStandardPaths>\n#include \"SimpleCrypt.h\"\n#include \"Log.h\"\n#include \"ToolBase.h\"\n#include \"Exceptions.h\"\n#include \"Helper.h\"\n\n\nbool Settings::settingsApplicationUserExists()\n{\n\tQStringList default_paths = QStandardPaths::standardLocations(QStandardPaths::AppLocalDataLocation);\n\tif(default_paths.isEmpty()) return false;\n\n\tQString filename = default_paths[0] + QDir::separator() + QCoreApplication::applicationName() + \"_local.ini\";\n\tif (!QFile::exists(filename)) return false;\n\n\treturn true;\n}\n\nQSettings& Settings::settingsApplicationUser()\n{\n\tstatic QSharedPointer<QSettings> settings;\n\tif(settings.isNull())\n\t{\n\t\tQStringList default_paths = QStandardPaths::standardLocations(QStandardPaths::AppLocalDataLocation);\n\t\tif(default_paths.isEmpty()) THROW(Exception, \"No local application data path was found!\");\n\t\tQString path = default_paths[0];\n\t\tif (!QDir().mkpath(path)) THROW(Exception, \"Could not create application data path '\" + path + \"'!\");\n\n\t\t\/\/set log file\n\t\tQString filename = path + QDir::separator() + QCoreApplication::applicationName() + \"_local.ini\";\n\t\tsettings.reset(new QSettings(filename, QSettings::IniFormat));\n\t\tif (!settings->isWritable()) THROW(Exception, \"Settings file '\" + filename + \"' is not writable!\");\n\t}\n\treturn *(settings.data());\n}\n\nconst QSettings& Settings::settingsApplication()\n{\n\tstatic QSettings* settings = nullptr;\n\tif(settings==nullptr)\n\t{\n\t\tQString filename = QCoreApplication::applicationDirPath() + QDir::separator() + QCoreApplication::applicationName() + \".ini\";\n\t\tsettings = new QSettings(filename, QSettings::IniFormat);\n\t}\n\treturn *settings;\n}\n\nconst QSettings& Settings::settingsGeneral()\n{\n\tstatic QSettings* settings = nullptr;\n\tif(settings==nullptr)\n\t{\n\t\tQString filename = QCoreApplication::applicationDirPath() + QDir::separator() + \"settings.ini\";\n\t\tsettings = new QSettings(filename, QSettings::IniFormat);\n\t}\n\treturn *settings;\n}\n\nint Settings::integer(QString key)\n{\n\treturn valueWithFallback(key).toInt();\n}\n\nvoid Settings::setInteger(QString key, int value)\n{\n\tQSettings& settings = settingsApplicationUser();\n\tsettings.setValue(key, value);\n\tsettings.sync(); \/\/sync, so that the file is created, which is checked by settingsApplicationUserExists\n}\n\nQString Settings::string(QString key, bool optional)\n{\n\tif (optional && !contains(key)) return \"\";\n\n\tQString value = valueWithFallback(key).toString();\n\n\t\/\/decrypt if encrypted\n\tQString crypt_prefix = \"encrypted:\";\n\tif (value.startsWith(crypt_prefix))\n\t{\n\t\t\/\/remove prefix\n\t\tvalue = value.mid(crypt_prefix.count()).trimmed();\n\n\t\t\/\/decrypt\n\t\tqulonglong crypt_key = ToolBase::encryptionKey(\"setting entry '\" + key + \"'\");\n\t\tvalue = SimpleCrypt(crypt_key).decryptToString(value);\n\t}\n\n\treturn value;\n}\n\nvoid Settings::setString(QString key, QString value)\n{\n\tQSettings& settings = settingsApplicationUser();\n\tsettings.setValue(key, value);\n\tsettings.sync(); \/\/sync, so that the file is created, which is checked by settingsApplicationUserExists\n}\n\n\nQStringList Settings::stringList(QString key, bool optional)\n{\n\tif (optional && !contains(key)) return QStringList();\n\n\treturn valueWithFallback(key).toStringList();\n}\n\nvoid Settings::setStringList(QString key, QStringList value)\n{\n\tQSettings& settings = settingsApplicationUser();\n\tsettings.setValue(key, value);\n\tsettings.sync(); \/\/sync, so that the file is created, which is checked by settingsApplicationUserExists\n}\n\n\nbool Settings::boolean(QString key, bool optional)\n{\n\tif (optional && !contains(key)) return false;\n\n\treturn valueWithFallback(key).toBool();\n}\n\nvoid Settings::setBoolean(QString key, bool value)\n{\n\tQSettings& settings = settingsApplicationUser();\n\tsettings.setValue(key, value);\n\tsettings.sync(); \/\/sync, so that the file is created, which is checked by settingsApplicationUserExists\n}\n\nQMap<QString, QVariant> Settings::map(QString key, bool optional)\n{\n\tif (optional && !contains(key)) QMap<QString, QVariant>();\n\n\treturn valueWithFallback(key).toMap();\n}\n\nvoid Settings::setMap(QString key, QMap<QString, QVariant> value)\n{\n\tQSettings& settings = settingsApplicationUser();\n\tsettings.setValue(key, value);\n\tsettings.sync(); \/\/sync, so that the file is created, which is checked by settingsApplicationUserExists\n}\n\nQString Settings::path(QString key, bool optional)\n{\n\tif (optional && !contains(key)) return \"\";\n\n\tQString path = string(key).trimmed();\n\n\t\/\/convert separators\n\tpath = Helper::canonicalPath(path);\n\n\t\/\/add separator at the end if missing from path\n\tif (QFile::exists(path) && QFileInfo(path).isDir() && !path.endsWith(QDir::separator()))\n\t{\n\t\tpath += QDir::separator();\n\t}\n\n\treturn path;\n}\n\nvoid Settings::setPath(QString key, QString path)\n{\n\tQFileInfo info(path);\n\tif (info.isFile())\n\t{\n\t\tpath = info.absolutePath();\n\t}\n\n\tif (QDir(path).exists())\n\t{\n\t\tsetString(key, Helper::canonicalPath(path));\n\t}\n}\n\nvoid Settings::clear()\n{\n\tsettingsApplicationUser().clear();\n}\n\nvoid Settings::remove(QString key)\n{\n\tsettingsApplicationUser().remove(key);\n}\n\nQStringList Settings::allKeys()\n{\n\tQStringList output;\n\n\tif (settingsApplicationUserExists())\n\t{\n\t\toutput << settingsApplicationUser().allKeys();\n\t}\n\toutput << settingsApplication().allKeys();\n\toutput << settingsGeneral().allKeys();\n\n\tstd::sort(output.begin(), output.end());\n\toutput.removeDuplicates();\n\n\treturn output;\n}\n\nbool Settings::contains(QString key)\n{\n\t\/\/check if key exists\n\tbool key_exists = (settingsApplicationUserExists() && settingsApplicationUser().contains(key)) || settingsApplication().contains(key) || settingsGeneral().contains(key);\n\tif (!key_exists) return false;\n\n\t\/\/if the key exists, check that the value is not empty\n\tQVariant var = valueWithFallback(key);\n\tif (var.type()==QVariant::StringList) return var.toStringList().join(\"\").trimmed()!=\"\"; \/\/special handling for QStringList\n\tif (var.type()==QVariant::Map) return var.toMap().keys().join(\"\").trimmed()!=\"\"; \/\/special handling for QMap\n\treturn var.toString().trimmed()!=\"\";\n}\n\nQVariant Settings::valueWithFallback(QString key)\n{\n\tif (settingsApplicationUserExists() && settingsApplicationUser().contains(key))\n\t{\n\t\treturn settingsApplicationUser().value(key);\n\t}\n\n\tif (settingsApplication().contains(key))\n\t{\n\t\treturn settingsApplication().value(key);\n\t}\n\n\tif (settingsGeneral().contains(key))\n\t{\n\t\treturn settingsGeneral().value(key);\n\t}\n\n\tTHROW(ProgrammingException, \"Requested key '\" + key + \"' not found in settings!\");\n}\n<|endoftext|>"} {"text":"<commit_before>\/\/\n\/\/ SonarSRF\n\/\/ Arduino Library for controlling SRF sonar sensors\n\/\/ http:\/\/www.arduino.cc\/playground\/Main\/SonarSrf08\n\/\/\n\/\/ MIT License\n\/\/ Copyright(c) 2009 Zach Foresta\n\/\/ Copyright(c) 2012 Philipp A. Mohrenweiser\n\/\/ Copyright(c) 2012-2016 Leo Colombaro\n\/\/\n\n#include \"SonarSRF.h\"\n\n\/\/\/ <summary>\n\/\/\/ Initiates the connection to the sensor and start I2C bus\n\/\/\/ <\/summary>\n\/\/\/ <param name=\"address\">I2C Address<\/param>\n\/\/\/ <param name=\"gainRegister\">SRF Location 1<\/param>\n\/\/\/ <param name=\"rangeLocation\">SRF Location 2<\/param>\nvoid SonarSRF::SonarSRF(int address, int gainRegister, int rangeLocation)\n{\n _address = address;\n _gainRegister = gainRegister;\n _rangeLocation = rangeLocation;\n Wire.begin();\n}\n\n\/\/\/ <summary>\n\/\/\/ Sets Units for display \/ storage\n\/\/\/ <\/summary>\n\/\/\/ <remarks>\n\/\/\/ * 'i' for inches\n\/\/\/ * 'c' for centimeters\n\/\/\/ * 'm' for microseconds\n\/\/\/ <\/remarks>\n\/\/\/ <param name=\"unit\">Unit used<\/param>\nvoid SonarSRF::startRanging(char unit)\n{\n switch (unit)\n {\n case 'i':\n sendCommand(INCHES);\n break;\n case 'c':\n sendCommand(CENTIMETERS);\n break;\n case 'm':\n sendCommand(MICROSECONDS);\n break;\n default:\n Serial.println(\"Invalid units entered... using micro-seconds\");\n sendCommand(MICROSECONDS);\n }\n}\n\n\/\/\/ <summary>\n\/\/\/ Communicates with Sonar to send commands\n\/\/\/ <\/summary>\n\/\/\/ <param name=\"command\">SRF Command<\/param>\n\/\/\/ <param name=\"addressRegister\">SRF Location 0<\/param>\n\/\/\/ <seealso cref=\"connect\"\/>\nvoid SonarSRF::sendCommand(int command, int addressRegister)\n{\n \/\/ start I2C transmission\n Wire.beginTransmission(_address);\n \/\/ send command\n Wire.write(addressRegister);\n if (command != NULL)\n {\n Wire.write(command);\n if (_gainRegister && _rangeLocation)\n {\n Wire.write(_gainRegister); \/\/ SRF Location 1\n Wire.write(_rangeLocation); \/\/ SRF Location 2\n }\n }\n \/\/ end I2C transmission\n Wire.endTransmission();\n}\n\n\/\/\/ <summary>\n\/\/\/ Read data from register return result\n\/\/\/ <\/summary>\n\/\/\/ <param name=\"unit\">Unit used<\/param>\n\/\/\/ <param name=\"andStart\"><\/param>\n\/\/\/ <returns>The range number (two bytes)<\/returns>\n\/\/\/ <seealso cref=\"startRanging\"\/>\nint SonarSRF::getRange(char unit, bool andStart)\n{\n int result = 0; \/\/ the result is two bytes long\n if (andStart)\n {\n startRanging(unit);\n waitForCompletion();\n }\n sendCommand(NULL, RESULT_REGISTER);\n Wire.requestFrom(_address, 2);\n \/\/ wait for two bytes to return\n while (Wire.available() < 2); \/\/ wait for result\n \/\/ read the two bytes, and combine them into one int\n byte highByte = Wire.read(); \/\/ Stores high byte from ranging\n byte lowByte = Wire.read(); \/\/ Stored low byte from ranging\n result = (highByte << 8) + lowByte;\n return result;\n}\n\n\/\/\/ <summary>\n\/\/\/ Wait for completion\n\/\/\/ <\/summary>\nvoid SonarSRF::waitForCompletion()\n{\n while (getVersion() == -1)\n {\n delay(1);\n }\n}\n\n\/\/\/ <summary>\n\/\/\/ Get software revision\n\/\/\/ <\/summary>\n\/\/\/ <returns>The software revision (one byte)<\/returns>\nint SonarSRF::getVersion()\n{\n sendCommand();\n Wire.requestFrom(_address, 1); \/\/ Request 1 byte\n while (Wire.available() < 0); \/\/ While byte available\n int software = Wire.read(); \/\/ Get byte\n return software;\n}\n\n\/\/\/ <summary>\n\/\/\/ Set a new address\n\/\/\/ <\/summary>\n\/\/\/ <remarks>\n\/\/\/ The address given in Arduino 7bit has to be converted back into SRF 8bit\n\/\/\/ newAddress << 1 can be set to any of E0, E2, E4, E6, E8, EA, EC, EE, F0, F2,\n\/\/\/ F4, F6, F8, FA, FC, FE.\n\/\/\/ <\/remarks>\n\/\/\/ <param name=\"newAddress\">The new address<\/param>\nvoid SonarSRF::setAddress(int newAddress)\n{\n sendCommand(0xA0);\n sendCommand(0xAA);\n sendCommand(0xA5);\n sendCommand(newAddress << 1);\n}\n<commit_msg>Remove useless code<commit_after>\/\/\n\/\/ SonarSRF\n\/\/ Arduino Library for controlling SRF sonar sensors\n\/\/ http:\/\/www.arduino.cc\/playground\/Main\/SonarSrf08\n\/\/\n\/\/ MIT License\n\/\/ Copyright(c) 2009 Zach Foresta\n\/\/ Copyright(c) 2012 Philipp A. Mohrenweiser\n\/\/ Copyright(c) 2012-2016 Leo Colombaro\n\/\/\n\n#include \"SonarSRF.h\"\n\n\/\/\/ <summary>\n\/\/\/ Initiates the connection to the sensor and start I2C bus\n\/\/\/ <\/summary>\n\/\/\/ <param name=\"address\">I2C Address<\/param>\n\/\/\/ <param name=\"gainRegister\">SRF Location 1<\/param>\n\/\/\/ <param name=\"rangeLocation\">SRF Location 2<\/param>\nvoid SonarSRF::SonarSRF(int address, int gainRegister, int rangeLocation)\n{\n _address = address;\n _gainRegister = gainRegister;\n _rangeLocation = rangeLocation;\n Wire.begin();\n}\n\n\/\/\/ <summary>\n\/\/\/ Sets Units for display \/ storage\n\/\/\/ <\/summary>\n\/\/\/ <remarks>\n\/\/\/ * 'i' for inches\n\/\/\/ * 'c' for centimeters\n\/\/\/ * 'm' for microseconds\n\/\/\/ <\/remarks>\n\/\/\/ <param name=\"unit\">Unit used<\/param>\nvoid SonarSRF::startRanging(char unit)\n{\n switch (unit)\n {\n case 'i':\n sendCommand(INCHES);\n break;\n case 'c':\n sendCommand(CENTIMETERS);\n break;\n case 'm':\n sendCommand(MICROSECONDS);\n break;\n default:\n Serial.println(\"Invalid units entered... using micro-seconds\");\n sendCommand(MICROSECONDS);\n }\n}\n\n\/\/\/ <summary>\n\/\/\/ Communicates with Sonar to send commands\n\/\/\/ <\/summary>\n\/\/\/ <param name=\"command\">SRF Command<\/param>\n\/\/\/ <param name=\"addressRegister\">SRF Location 0<\/param>\n\/\/\/ <seealso cref=\"connect\"\/>\nvoid SonarSRF::sendCommand(int command, int addressRegister)\n{\n \/\/ start I2C transmission\n Wire.beginTransmission(_address);\n \/\/ send command\n Wire.write(addressRegister);\n if (command != NULL)\n {\n Wire.write(command);\n if (_gainRegister && _rangeLocation)\n {\n Wire.write(_gainRegister); \/\/ SRF Location 1\n Wire.write(_rangeLocation); \/\/ SRF Location 2\n }\n }\n \/\/ end I2C transmission\n Wire.endTransmission();\n}\n\n\/\/\/ <summary>\n\/\/\/ Read data from register return result\n\/\/\/ <\/summary>\n\/\/\/ <param name=\"unit\">Unit used<\/param>\n\/\/\/ <param name=\"andStart\"><\/param>\n\/\/\/ <returns>The range number (two bytes)<\/returns>\n\/\/\/ <seealso cref=\"startRanging\"\/>\nint SonarSRF::getRange(char unit, bool andStart)\n{\n if (andStart)\n {\n startRanging(unit);\n waitForCompletion();\n }\n sendCommand(NULL, RESULT_REGISTER);\n Wire.requestFrom(_address, 2);\n \/\/ wait for two bytes to return\n while (Wire.available() < 2); \/\/ wait for result\n \/\/ read the two bytes, and combine them into one int\n byte highByte = Wire.read(); \/\/ Stores high byte from ranging\n byte lowByte = Wire.read(); \/\/ Stored low byte from ranging\n return (int)((highByte << 8) + lowByte);\n}\n\n\/\/\/ <summary>\n\/\/\/ Wait for completion\n\/\/\/ <\/summary>\nvoid SonarSRF::waitForCompletion()\n{\n while (getVersion() == -1)\n {\n delay(1);\n }\n}\n\n\/\/\/ <summary>\n\/\/\/ Get software revision\n\/\/\/ <\/summary>\n\/\/\/ <returns>The software revision (one byte)<\/returns>\nint SonarSRF::getVersion()\n{\n sendCommand();\n Wire.requestFrom(_address, 1); \/\/ Request 1 byte\n while (Wire.available() < 0); \/\/ While byte available\n return (int)(Wire.read());\n}\n\n\/\/\/ <summary>\n\/\/\/ Set a new address\n\/\/\/ <\/summary>\n\/\/\/ <remarks>\n\/\/\/ The address given in Arduino 7bit has to be converted back into SRF 8bit\n\/\/\/ newAddress << 1 can be set to any of E0, E2, E4, E6, E8, EA, EC, EE, F0, F2,\n\/\/\/ F4, F6, F8, FA, FC, FE.\n\/\/\/ <\/remarks>\n\/\/\/ <param name=\"newAddress\">The new address<\/param>\nvoid SonarSRF::setAddress(int newAddress)\n{\n sendCommand(0xA0);\n sendCommand(0xAA);\n sendCommand(0xA5);\n sendCommand(newAddress << 1);\n}\n<|endoftext|>"} {"text":"<commit_before>#include <iostream>\n\n#include \"StringSet.hh\"\n\nusing namespace std;\n\n\nStringSet::StringSet(const std::map<std::string, flt_type> &vocab, bool log_domain) {\n max_factor_length = 0;\n for (auto it = vocab.cbegin(); it !=vocab.cend(); ++it)\n add(it->first, it->second);\n this->optimize_arcs(&root_node, log_domain);\n}\n\n\nStringSet::~StringSet() {\n clear(&root_node);\n}\n\n\nStringSet::Arc*\nStringSet::find_arc(char letter,\n const StringSet::Node *node) const\n{\n Arc *arc = node->first_arc;\n while (arc != NULL) {\n if (arc->letter == letter) break;\n arc = arc->sibling_arc;\n }\n return arc;\n}\n\n\nbool\nStringSet::includes(const string &factor) const\n{\n const StringSet::Node *node = &root_node;\n StringSet::Arc *arc = NULL;\n for (unsigned int i=0; i<factor.length(); i++) {\n arc = find_arc(factor[i], node);\n if (arc == NULL) return false;\n node = arc->target_node;\n }\n if (arc->factor.length() == 0) return false;\n return true;\n}\n\n\nflt_type\nStringSet::get_score(const string &factor) const\n{\n const StringSet::Node *node = &root_node;\n StringSet::Arc *arc = NULL;\n for (unsigned int i=0; i<factor.length(); i++) {\n arc = find_arc(factor[i], node);\n if (arc == NULL) throw string(\"could not find factor\");\n node = arc->target_node;\n }\n if (arc->factor.length() == 0) throw string(\"could not find factor\");\n return arc->cost;\n}\n\n\nvoid\nStringSet::add(const string &factor, flt_type cost)\n{\n \/\/ Create arcs\n Node *node = &root_node;\n int i=0;\n for (; i < (int)factor.length()-1; i++)\n node = insert(factor[i], \"\" , 0.0, node);\n insert(factor[i], factor, cost, node);\n}\n\n\nflt_type\nStringSet::remove(const string &factor)\n{\n StringSet::Node *node = &root_node;\n StringSet::Arc *arc = NULL;\n\n for (unsigned int i=0; i<factor.length(); i++) {\n arc = find_arc(factor[i], node);\n if (arc == NULL) throw string(\"could not remove factor\");\n node = arc->target_node;\n }\n arc->factor.clear();\n flt_type cost = arc->cost;\n arc->cost = 0.0;\n return cost;\n}\n\n\nStringSet::Node*\nStringSet::insert(char letter,\n const string &factor,\n flt_type cost,\n StringSet::Node *node)\n{\n \/\/ Find a possible existing arc with the letter\n Arc *arc = node->first_arc;\n while (arc != NULL) {\n if (arc->letter == letter) break;\n arc = arc->sibling_arc;\n }\n\n \/\/ No existing arc: create a new arc\n if (arc == NULL) {\n Node *new_node = new Node(NULL);\n node->first_arc = new Arc(letter, factor, new_node, node->first_arc, cost);\n arc = node->first_arc;\n }\n\n \/\/ Update the existing arc if factor was set\n else if (factor.length() > 0) {\n if (arc->factor.length() == 0) arc->factor = factor;\n arc->cost = cost;\n }\n\n \/\/ Maintain the length of the longest factor\n if ((int)factor.length() > max_factor_length)\n max_factor_length = factor.length();\n\n return arc->target_node;\n}\n\n\nflt_type\nStringSet::optimize_arcs(Node *node, bool log_domain)\n{\n flt_type total = log_domain ? SMALL_LP : 0.0;\n StringSet::Arc *arc = node->first_arc;\n multimap<flt_type, Arc*> letters;\n\n while (arc != NULL) {\n flt_type cumsum = optimize_arcs(arc->target_node, log_domain);\n if (log_domain) {\n if (arc->factor.length() > 0)\n cumsum = add_log_domain_probs(cumsum, arc->cost);\n total = add_log_domain_probs(cumsum, total);\n } else {\n if (arc->factor.length() > 0)\n cumsum += arc->cost;\n total += cumsum;\n }\n letters.insert( pair<flt_type, Arc*>(cumsum, arc) );\n arc = arc->sibling_arc;\n }\n\n Arc* prev_arc = NULL;\n Arc* curr_arc = NULL;\n for (auto it = letters.begin(); it != letters.end(); ++it) {\n curr_arc = it->second;\n curr_arc->sibling_arc = prev_arc;\n prev_arc = curr_arc;\n }\n node->first_arc = curr_arc;\n\n return total;\n}\n\n\nvoid\nStringSet::assign_scores(const std::map<std::string, flt_type> &vocab)\n{\n for (auto it = vocab.begin(); it != vocab.end(); ++it) {\n string factor(it->first);\n Node *node = &root_node;\n int i=0;\n for (; i < (int)factor.length()-1; i++)\n node = insert(factor[i], \"\" , 0.0, node);\n insert(factor[i], factor, it->second, node);\n }\n}\n\n\nvoid\nStringSet::clear(Node *node)\n{\n StringSet::Arc *curr_arc = node->first_arc;\n StringSet::Arc *temp_arc = NULL;\n\n while (curr_arc != NULL) {\n clear(curr_arc->target_node);\n temp_arc = curr_arc;\n curr_arc = curr_arc->sibling_arc;\n delete temp_arc->target_node;\n delete temp_arc;\n }\n}\n\n\nbool\nStringSet::prune(Node *node)\n{\n StringSet::Arc *curr_arc = node->first_arc;\n StringSet::Arc *temp_arc = NULL;\n\n std::vector<StringSet::Arc*> arcs;\n while (curr_arc != NULL) {\n bool unused = prune(curr_arc->target_node);\n temp_arc = curr_arc;\n curr_arc = curr_arc->sibling_arc;\n if (unused && temp_arc->factor.length() == 0) {\n delete temp_arc->target_node;\n delete temp_arc;\n } else {\n arcs.push_back(temp_arc);\n }\n }\n\n node->first_arc = NULL;\n for (int i=0; i<(int)arcs.size()-1; i++)\n arcs[i]->sibling_arc = arcs[i+1];\n if (arcs.size() > 0) {\n arcs[arcs.size()-1]->sibling_arc = NULL;\n node->first_arc = arcs[0];\n }\n\n if (arcs.size() > 0) return false;\n else return true;\n}\n<commit_msg>Minor cleanup.<commit_after>#include <iostream>\n\n#include \"StringSet.hh\"\n\nusing namespace std;\n\n\nStringSet::StringSet(const std::map<std::string, flt_type> &vocab, bool log_domain) {\n max_factor_length = 0;\n for (auto it = vocab.cbegin(); it !=vocab.cend(); ++it)\n add(it->first, it->second);\n this->optimize_arcs(&root_node, log_domain);\n}\n\n\nStringSet::~StringSet() {\n clear(&root_node);\n}\n\n\nStringSet::Arc*\nStringSet::find_arc(char letter,\n const StringSet::Node *node) const\n{\n Arc *arc = node->first_arc;\n while (arc != NULL) {\n if (arc->letter == letter) break;\n arc = arc->sibling_arc;\n }\n return arc;\n}\n\n\nbool\nStringSet::includes(const string &factor) const\n{\n const StringSet::Node *node = &root_node;\n StringSet::Arc *arc = NULL;\n for (unsigned int i=0; i<factor.length(); i++) {\n arc = find_arc(factor[i], node);\n if (arc == NULL) return false;\n node = arc->target_node;\n }\n if (arc->factor.length() == 0) return false;\n return true;\n}\n\n\nflt_type\nStringSet::get_score(const string &factor) const\n{\n const StringSet::Node *node = &root_node;\n StringSet::Arc *arc = NULL;\n for (unsigned int i=0; i<factor.length(); i++) {\n arc = find_arc(factor[i], node);\n if (arc == NULL) throw string(\"could not find factor\");\n node = arc->target_node;\n }\n if (arc->factor.length() == 0) throw string(\"could not find factor\");\n return arc->cost;\n}\n\n\nvoid\nStringSet::add(const string &factor, flt_type cost)\n{\n \/\/ Create arcs\n Node *node = &root_node;\n int i=0;\n for (; i < (int)factor.length()-1; i++)\n node = insert(factor[i], \"\" , 0.0, node);\n insert(factor[i], factor, cost, node);\n}\n\n\nflt_type\nStringSet::remove(const string &factor)\n{\n StringSet::Node *node = &root_node;\n StringSet::Arc *arc = NULL;\n\n for (unsigned int i=0; i<factor.length(); i++) {\n arc = find_arc(factor[i], node);\n if (arc == NULL) throw string(\"could not remove factor\");\n node = arc->target_node;\n }\n arc->factor.clear();\n flt_type cost = arc->cost;\n arc->cost = 0.0;\n return cost;\n}\n\n\nStringSet::Node*\nStringSet::insert(char letter,\n const string &factor,\n flt_type cost,\n StringSet::Node *node)\n{\n \/\/ Find a possible existing arc with the letter\n Arc *arc = node->first_arc;\n while (arc != NULL) {\n if (arc->letter == letter) break;\n arc = arc->sibling_arc;\n }\n\n \/\/ No existing arc: create a new arc\n if (arc == NULL) {\n Node *new_node = new Node(NULL);\n node->first_arc = new Arc(letter, factor, new_node, node->first_arc, cost);\n arc = node->first_arc;\n }\n\n \/\/ Update the existing arc if factor was set\n else if (factor.length() > 0) {\n if (arc->factor.length() == 0) arc->factor = factor;\n arc->cost = cost;\n }\n\n \/\/ Maintain the length of the longest factor\n if ((int)factor.length() > max_factor_length)\n max_factor_length = factor.length();\n\n return arc->target_node;\n}\n\n\nflt_type\nStringSet::optimize_arcs(Node *node, bool log_domain)\n{\n flt_type total = log_domain ? SMALL_LP : 0.0;\n StringSet::Arc *arc = node->first_arc;\n multimap<flt_type, Arc*> letters;\n\n while (arc != NULL) {\n flt_type cumsum = optimize_arcs(arc->target_node, log_domain);\n if (log_domain) {\n if (arc->factor.length() > 0)\n cumsum = add_log_domain_probs(cumsum, arc->cost);\n total = add_log_domain_probs(cumsum, total);\n } else {\n if (arc->factor.length() > 0)\n cumsum += arc->cost;\n total += cumsum;\n }\n letters.insert( pair<flt_type, Arc*>(cumsum, arc) );\n arc = arc->sibling_arc;\n }\n\n Arc* prev_arc = NULL;\n Arc* curr_arc = NULL;\n for (auto it = letters.begin(); it != letters.end(); ++it) {\n curr_arc = it->second;\n curr_arc->sibling_arc = prev_arc;\n prev_arc = curr_arc;\n }\n node->first_arc = curr_arc;\n\n return total;\n}\n\n\nvoid\nStringSet::assign_scores(const std::map<std::string, flt_type> &vocab)\n{\n for (auto it = vocab.begin(); it != vocab.end(); ++it) {\n string factor(it->first);\n Node *node = &root_node;\n int i=0;\n for (; i < (int)factor.length()-1; i++)\n node = insert(factor[i], \"\" , 0.0, node);\n insert(factor[i], factor, it->second, node);\n }\n}\n\n\nvoid\nStringSet::clear(Node *node)\n{\n StringSet::Arc *curr_arc = node->first_arc;\n StringSet::Arc *temp_arc = NULL;\n\n while (curr_arc != NULL) {\n clear(curr_arc->target_node);\n temp_arc = curr_arc;\n curr_arc = curr_arc->sibling_arc;\n delete temp_arc->target_node;\n delete temp_arc;\n }\n}\n\n\nbool\nStringSet::prune(Node *node)\n{\n StringSet::Arc *curr_arc = node->first_arc;\n StringSet::Arc *temp_arc = NULL;\n\n std::vector<StringSet::Arc*> arcs;\n while (curr_arc != NULL) {\n bool unused = prune(curr_arc->target_node);\n temp_arc = curr_arc;\n curr_arc = curr_arc->sibling_arc;\n if (unused && temp_arc->factor.length() == 0) {\n delete temp_arc->target_node;\n delete temp_arc;\n }\n else arcs.push_back(temp_arc);\n }\n\n node->first_arc = NULL;\n if (arcs.size() > 0) {\n for (int i=0; i<(int)arcs.size()-1; i++)\n arcs[i]->sibling_arc = arcs[i+1];\n arcs[arcs.size()-1]->sibling_arc = NULL;\n node->first_arc = arcs[0];\n return false;\n }\n else return true;\n}\n<|endoftext|>"} {"text":"<commit_before>#ifndef TESTS\n#error \"You shouldn't compile UnitTests.cc without test mode on.\"\n#endif\n\n#include \"UnitTests.h\"\n\n#include \"Bank.h\"\n\n#include \"Printer.h\"\n#include \"debug.h\"\n\n#include \"Config.h\"\n#include \"Main.h\"\n\nusing namespace std;\n\n\nstatic void VectorsEqual(vector<PrintState> &lhs, vector<PrintState> &rhs) {\n int ix = 0;\n while (ix < (int)min(lhs.size(), rhs.size())) {\n if (!lhs[ix].equals(rhs[ix])) {\n printf(\"Values not equal at %d:\\n\", ix);\n printf(\"Should be:\\t\\t\"); lhs[ix].print();\n printf(\"But was:\\t\\t\"); rhs[ix].print();\n }\n ix++;\n }\n if (ix < (int)lhs.size()) {\n printf(\"Missing values:\\n\");\n }\n while (ix < (int)lhs.size()) {\n printf(\"\\t\"); lhs[ix++].print();\n }\n\n if (ix < (int)rhs.size()) {\n printf(\"Extra values:\\n\");\n }\n while (ix < (int)rhs.size()) {\n printf(\"\\t\"); rhs[ix++].print();\n }\n}\n\n\n_Task BankWithdraw {\npublic:\n Bank &bank;\n int id;\n int count;\n BankWithdraw(Bank & bank, int id, int count) : bank(bank), id(id), count(count) { }\n void main() {\n bank.withdraw(id, count);\n }\n};\n\nstatic void TestBank(uBaseTask &task) {\n testPrinter.states.clear();\n Bank bank(1);\n {\n BankWithdraw task(bank, 0, 2);\n task.yield(10);\n bank.deposit(0, 1);\n bank.deposit(0, 1);\n }\n\n vector<PrintState> TestBankResults {\n PrintState(PrinterKind::BankDeposit, 0, ' ', 1),\n PrintState(PrinterKind::BankDeposit, 0, ' ', 1),\n PrintState(PrinterKind::BankWithdraw, 0, ' ', 2)\n };\n VectorsEqual(TestBankResults, testPrinter.states);\n}\n\nvoid RunAllTests(uBaseTask &task) {\n TestBank(task);\n}\n\nConfig genRandConfig() {\n Config config;\n config.sodaCost = rand() % 10 + 1;\n config.numStudents = rand() % 10 + 1;\n config.maxPurchases = rand() % 10 + 1;\n config.numVendingMachines = rand() % 10 + 1;\n config.maxStockPerFlavour = rand() % 10 + 1;\n config.maxShippedPerFlavour = rand() % 10 + 1;\n config.timeBetweenShipments = rand() % 10 + 1;\n config.parentalDelay = rand() % 10 + 1;\n config.numCouriers = rand() % 10 + 1;\n return config;\n}\n\nvoid uMain::main() {\n Config config = genRandConfig();\n \n Main(config);\n \/\/RunAllTests(*this);\n}\n<commit_msg>Printed the config file.<commit_after>#ifndef TESTS\n#error \"You shouldn't compile UnitTests.cc without test mode on.\"\n#endif\n\n#include \"UnitTests.h\"\n\n#include \"Bank.h\"\n\n#include \"Printer.h\"\n#include \"debug.h\"\n\n#include \"Config.h\"\n#include \"Main.h\"\n\nusing namespace std;\n\n\nstatic void VectorsEqual(vector<PrintState> &lhs, vector<PrintState> &rhs) {\n int ix = 0;\n while (ix < (int)min(lhs.size(), rhs.size())) {\n if (!lhs[ix].equals(rhs[ix])) {\n printf(\"Values not equal at %d:\\n\", ix);\n printf(\"Should be:\\t\\t\"); lhs[ix].print();\n printf(\"But was:\\t\\t\"); rhs[ix].print();\n }\n ix++;\n }\n if (ix < (int)lhs.size()) {\n printf(\"Missing values:\\n\");\n }\n while (ix < (int)lhs.size()) {\n printf(\"\\t\"); lhs[ix++].print();\n }\n\n if (ix < (int)rhs.size()) {\n printf(\"Extra values:\\n\");\n }\n while (ix < (int)rhs.size()) {\n printf(\"\\t\"); rhs[ix++].print();\n }\n}\n\n\n_Task BankWithdraw {\npublic:\n Bank &bank;\n int id;\n int count;\n BankWithdraw(Bank & bank, int id, int count) : bank(bank), id(id), count(count) { }\n void main() {\n bank.withdraw(id, count);\n }\n};\n\nstatic void TestBank(uBaseTask &task) {\n testPrinter.states.clear();\n Bank bank(1);\n {\n BankWithdraw task(bank, 0, 2);\n task.yield(10);\n bank.deposit(0, 1);\n bank.deposit(0, 1);\n }\n\n vector<PrintState> TestBankResults {\n PrintState(PrinterKind::BankDeposit, 0, ' ', 1),\n PrintState(PrinterKind::BankDeposit, 0, ' ', 1),\n PrintState(PrinterKind::BankWithdraw, 0, ' ', 2)\n };\n VectorsEqual(TestBankResults, testPrinter.states);\n}\n\nvoid RunAllTests(uBaseTask &task) {\n TestBank(task);\n}\n\nConfig genRandConfig() {\n Config config;\n config.sodaCost = rand() % 10 + 1;\n config.numStudents = rand() % 10 + 1;\n config.maxPurchases = rand() % 10 + 1;\n config.numVendingMachines = rand() % 10 + 1;\n config.maxStockPerFlavour = rand() % 10 + 1;\n config.maxShippedPerFlavour = rand() % 10 + 1;\n config.timeBetweenShipments = rand() % 10 + 1;\n config.parentalDelay = rand() % 10 + 1;\n config.numCouriers = rand() % 10 + 1;\n return config;\n}\n\nvoid uMain::main() {\n Config config = genRandConfig();\n\n printf(\n \"sodaCost %d, \"\n \"numStudents %d, \"\n \"maxPurchases %d, \"\n \"numVendingMachines %d, \"\n \"maxStockPerFlavour %d, \"\n \"maxShippedPerFlavour %d, \"\n \"timeBetweenShipments %d, \"\n \"parentalDelay %d, \"\n \"numCouriers %d\\n\",\n config.sodaCost,\n config.numStudents,\n config.maxPurchases,\n config.numVendingMachines,\n config.maxStockPerFlavour,\n config.maxShippedPerFlavour,\n config.timeBetweenShipments,\n config.parentalDelay,\n config.numCouriers\n );\n\n Main(config);\n \/\/RunAllTests(*this);\n}\n<|endoftext|>"} {"text":"<commit_before>\n\/*\n * Copyright (c) 2012 Karl N. Redgate\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\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\/** \\file Channel.cc\n * \\brief \n *\n *\/\n\n#include <sys\/stat.h>\n#include <sys\/types.h>\n#include <sys\/ipc.h>\n#include <sys\/msg.h>\n\n#include <unistd.h>\n#include <stdlib.h>\n#include <stdio.h>\n#include <errno.h>\n#include <string.h>\n#include <syslog.h>\n#include <glob.h>\n\n#include <tcl.h>\n#include \"TCL_Fixup.h\"\n#include <valgrind\/memcheck.h>\n\n#include \"util.h\"\n#include \"Channel.h\"\n#include \"Service.h\"\n\nnamespace { int debug = 0; }\n\n\/**\n * dst is the destination service id\n * src is the source service id\n *\/\nstruct channel_message {\n long dst;\n long src;\n long error;\n char body[1012];\n};\n#define MESSAGE_OK 0\n#define MESSAGE_ERROR 1\n#define MESSAGE_EXCEPTION 2\n\n\/** \n * Look through list of processes to see if the named service is\n * alive. We check by looking a process that has its executable\n * as \/usr\/sbin\/[service_name].\n *\n * Note: readlink does not NULL terminate the strings it reads, so\n * we must do it explicitly.\n *\/\nstatic int\nis_alive( char *service_name ) {\n int result = 0;\n glob_t processes;\n size_t i;\n char exe[256], path[80];\n\n sprintf( path, \"\/usr\/sbin\/%s\", service_name );\n\n memset( &processes, 0, sizeof(processes) );\n glob( \"\/proc\/*\/exe\", GLOB_NOSORT, NULL, &processes );\n\n for ( i = 0 ; i < processes.gl_pathc ; i++ ) {\n int count = readlink( processes.gl_pathv[i], exe, sizeof(exe) );\n if ( count == -1 ) continue;\n exe[count] = '\\0';\n if ( strcmp(exe, path) == 0 ) {\n result = 1;\n break;\n }\n }\n\n globfree( &processes );\n return result;\n}\n\n\/**\n *\/\nkey_t service_key( const char *service_name ) {\n key_t key = *( (key_t*)service_name );\n if ( key == -1 ) {\n syslog( LOG_ERR, \"could not generate a key for '%s'\", service_name );\n exit( 1 );\n }\n \/\/ send this to stdout if the tcl interpreter is interactive\n \/\/ syslog( LOG_NOTICE, \"channel key for '%s' is 0x%08x\", service_name, key );\n return key;\n}\n\f\n\/**\n * will need a path name to point the mq at\n *\n * Channel needs to be a thread that reads the Q and\n * calls the interpreter when it gets the message\n *\n * The channel cannot accept messages until the interpreter is\n * fully initialized. Also, the channel should be the primary\n * (only?) evaluator in the interpreter.\n *\n * Should make the Interpreter be a base class and have a \n * TclInterpreter and a RubyInterpreter? The Interpreter\n * should provide an evalute method ...\n *\n *\n * There will be a race here ... where the client of a service\n * will not be able to start until the server. However, if they\n * talk to each other then they are both clients and servers\n * so neither could start. So, the client needs to be able to\n * create the server's directory also.\n *\/\nChannel::Channel( Service *service )\n: service(service) {\n key_t key = service_key( service->name() );\n syslog( LOG_NOTICE, \"msgQ id = 0x%08x\", key );\n\n \/\/ Eventually change this so only root can send...\n q = msgget( key, IPC_CREAT | 0777 );\n if ( q < 0 ) {\n syslog( LOG_ERR, \"could not create a msgQ for '%s'\", service->name() );\n exit( 1 );\n }\n}\n\n\/**\n * \\todo should use IPC_NOWAIT -- and try again if EAGAIN\n * \\todo fix message length calculation\n *\/\nvoid\nChannel::send( long dst, int result, char *message ) {\n int flags = 0; \/\/ IPC_NOWAIT | MSG_NOERROR\n struct channel_message m;\n m.dst = dst;\n m.src = 1;\n m.error = result;\n int bytes = strlcpy( m.body, message, sizeof(m.body) );\n if ( bytes > sizeof(m.body) ) {\n syslog( LOG_WARNING, \"message body truncated\" );\n bytes = sizeof(m.body) - 1;\n }\n if ( msgsnd(q, &m, bytes + sizeof(char) + sizeof(long) + sizeof(long), flags) < 0 ) {\n syslog( LOG_ERR, \"failed to msgsnd\" );\n }\n}\n\n\/**\n * block ... read from Q and process msg\n * \\todo add retry logic when we get a msgrcv err on Channel\n *\/\nlong\nChannel::receive( char *buffer, int length ) {\n int flags = 0; \/\/ IPC_NOWAIT | MSG_NOERROR\n struct channel_message request;\n int bytes = msgrcv( q, &request, sizeof(request), 1, flags );\n if ( bytes < 0 ) {\n \/\/ how to handle error\n syslog( LOG_ERR, \"Error receiving Channel request\" );\n }\n if ( debug > 0 ) syslog( LOG_NOTICE, \"request '%s'\", request.body );\n strlcpy( buffer, request.body, length );\n return request.src;\n}\n\f\n\/**\n *\/\nChannelClient::ChannelClient( char *service_name ) {\n strlcpy( service, service_name, sizeof(service) );\n key_t key = service_key( service_name );\n \/\/ Eventually change this so only root can send...\n q = msgget( key, IPC_CREAT | 0777 );\n if ( q < 0 ) {\n syslog( LOG_ERR, \"could not create a msgQ for '%s'\", service_name );\n exit( 1 );\n }\n}\n\n\/**\n * \\todo should use IPC_NOWAIT -- and try again if EAGAIN\n * \\todo fix message length calculation\n *\/\nvoid\nChannelClient::send( char *message ) {\n int flags = 0; \/\/ IPC_NOWAIT | MSG_NOERROR\n struct channel_message m;\n m.dst = 1;\n m.src = getpid();\n m.error = 0;\n int bytes = strlcpy( m.body, message, sizeof(m.body) );\n if ( bytes > sizeof(m.body) ) {\n syslog( LOG_WARNING, \"message body truncated\" );\n bytes = sizeof(m.body) - 1;\n }\n if ( msgsnd(q, &m, bytes + sizeof(char) + sizeof(long) + sizeof(long), flags) < 0 ) {\n syslog( LOG_ERR, \"failed to msgsnd\" );\n }\n}\n\n\/**\n * block ... read from Q and process msg\n *\/\nint\nChannelClient::receive( char *buffer, int length ) {\n int flags = 0; \/\/ IPC_NOWAIT | MSG_NOERROR\n struct channel_message request;\n\n int bytes = msgrcv( q, &request, sizeof(request), getpid(), flags );\n if ( bytes < 0 ) {\n \/\/ how to handle error -- try again\n }\n strlcpy( buffer, request.body, length );\n return request.error;\n}\n\n\/**\n *\/\nint\nChannelClient::receive( char *buffer, int length, time_t time_limit ) {\n struct channel_message request;\n time_t elapsed = 0;\n struct timespec delay = { 1, 0 };\n pid_t pid = getpid();\n\n do {\n int bytes = msgrcv( q, &request, sizeof(request), pid, IPC_NOWAIT );\n\n if ( bytes > 0 ) {\n strlcpy( buffer, request.body, length );\n return request.error;\n }\n\n \/**\n * We only want this error correction when we are not running under\n * valgrind, since valgrind changes the name of the program that is\n * running and all messaging would fail since we can not detect process\n * liveness after the program name change.\n *\/\n if ( RUNNING_ON_VALGRIND == 0 ) {\n if ( is_alive(service) == false ) return MESSAGE_EXCEPTION;\n }\n nanosleep( &delay, NULL );\n } while ( ++elapsed < time_limit );\n\n syslog( LOG_ERR, \"ERROR channel recv timed out\" );\n return MESSAGE_EXCEPTION;\n}\n\n\/* vim: set autoindent expandtab sw=4 : *\/\n<commit_msg>fix build errs<commit_after>\n\/*\n * Copyright (c) 2012 Karl N. Redgate\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\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\/** \\file Channel.cc\n * \\brief \n *\n *\/\n\n#include <sys\/stat.h>\n#include <sys\/types.h>\n#include <sys\/ipc.h>\n#include <sys\/msg.h>\n\n#include <unistd.h>\n#include <stdlib.h>\n#include <stdio.h>\n#include <errno.h>\n#include <string.h>\n#include <syslog.h>\n#include <glob.h>\n\n#include \"util.h\"\n#include \"Channel.h\"\n#include \"Service.h\"\n\nnamespace { int debug = 0; }\n\n\/**\n * dst is the destination service id\n * src is the source service id\n *\/\nstruct channel_message {\n long dst;\n long src;\n long error;\n char body[1012];\n};\n#define MESSAGE_OK 0\n#define MESSAGE_ERROR 1\n#define MESSAGE_EXCEPTION 2\n\n\/** \n * Look through list of processes to see if the named service is\n * alive. We check by looking a process that has its executable\n * as \/usr\/sbin\/[service_name].\n *\n * Note: readlink does not NULL terminate the strings it reads, so\n * we must do it explicitly.\n *\/\nstatic int\nis_alive( char *service_name ) {\n int result = 0;\n glob_t processes;\n size_t i;\n char exe[256], path[80];\n\n sprintf( path, \"\/usr\/sbin\/%s\", service_name );\n\n memset( &processes, 0, sizeof(processes) );\n glob( \"\/proc\/*\/exe\", GLOB_NOSORT, NULL, &processes );\n\n for ( i = 0 ; i < processes.gl_pathc ; i++ ) {\n int count = readlink( processes.gl_pathv[i], exe, sizeof(exe) );\n if ( count == -1 ) continue;\n exe[count] = '\\0';\n if ( strcmp(exe, path) == 0 ) {\n result = 1;\n break;\n }\n }\n\n globfree( &processes );\n return result;\n}\n\n\/**\n *\/\nkey_t service_key( const char *service_name ) {\n key_t key = *( (key_t*)service_name );\n if ( key == -1 ) {\n syslog( LOG_ERR, \"could not generate a key for '%s'\", service_name );\n exit( 1 );\n }\n \/\/ send this to stdout if the tcl interpreter is interactive\n \/\/ syslog( LOG_NOTICE, \"channel key for '%s' is 0x%08x\", service_name, key );\n return key;\n}\n\f\n\/**\n * will need a path name to point the mq at\n *\n * Channel needs to be a thread that reads the Q and\n * calls the interpreter when it gets the message\n *\n * The channel cannot accept messages until the interpreter is\n * fully initialized. Also, the channel should be the primary\n * (only?) evaluator in the interpreter.\n *\n * Should make the Interpreter be a base class and have a \n * TclInterpreter and a RubyInterpreter? The Interpreter\n * should provide an evalute method ...\n *\n *\n * There will be a race here ... where the client of a service\n * will not be able to start until the server. However, if they\n * talk to each other then they are both clients and servers\n * so neither could start. So, the client needs to be able to\n * create the server's directory also.\n *\/\nChannel::Channel( Service *service )\n: service(service) {\n key_t key = service_key( service->name() );\n syslog( LOG_NOTICE, \"msgQ id = 0x%08x\", key );\n\n \/\/ Eventually change this so only root can send...\n q = msgget( key, IPC_CREAT | 0777 );\n if ( q < 0 ) {\n syslog( LOG_ERR, \"could not create a msgQ for '%s'\", service->name() );\n exit( 1 );\n }\n}\n\n\/**\n * \\todo should use IPC_NOWAIT -- and try again if EAGAIN\n * \\todo fix message length calculation\n *\/\nvoid\nChannel::send( long dst, int result, char *message ) {\n int flags = 0; \/\/ IPC_NOWAIT | MSG_NOERROR\n struct channel_message m;\n m.dst = dst;\n m.src = 1;\n m.error = result;\n int bytes = strlcpy( m.body, message, sizeof(m.body) );\n if ( bytes > sizeof(m.body) ) {\n syslog( LOG_WARNING, \"message body truncated\" );\n bytes = sizeof(m.body) - 1;\n }\n if ( msgsnd(q, &m, bytes + sizeof(char) + sizeof(long) + sizeof(long), flags) < 0 ) {\n syslog( LOG_ERR, \"failed to msgsnd\" );\n }\n}\n\n\/**\n * block ... read from Q and process msg\n * \\todo add retry logic when we get a msgrcv err on Channel\n *\/\nlong\nChannel::receive( char *buffer, int length ) {\n int flags = 0; \/\/ IPC_NOWAIT | MSG_NOERROR\n struct channel_message request;\n int bytes = msgrcv( q, &request, sizeof(request), 1, flags );\n if ( bytes < 0 ) {\n \/\/ how to handle error\n syslog( LOG_ERR, \"Error receiving Channel request\" );\n }\n if ( debug > 0 ) syslog( LOG_NOTICE, \"request '%s'\", request.body );\n strlcpy( buffer, request.body, length );\n return request.src;\n}\n\f\n\/**\n *\/\nChannelClient::ChannelClient( char *service_name ) {\n strlcpy( service, service_name, sizeof(service) );\n key_t key = service_key( service_name );\n \/\/ Eventually change this so only root can send...\n q = msgget( key, IPC_CREAT | 0777 );\n if ( q < 0 ) {\n syslog( LOG_ERR, \"could not create a msgQ for '%s'\", service_name );\n exit( 1 );\n }\n}\n\n\/**\n * \\todo should use IPC_NOWAIT -- and try again if EAGAIN\n * \\todo fix message length calculation\n *\/\nvoid\nChannelClient::send( char *message ) {\n int flags = 0; \/\/ IPC_NOWAIT | MSG_NOERROR\n struct channel_message m;\n m.dst = 1;\n m.src = getpid();\n m.error = 0;\n int bytes = strlcpy( m.body, message, sizeof(m.body) );\n if ( bytes > sizeof(m.body) ) {\n syslog( LOG_WARNING, \"message body truncated\" );\n bytes = sizeof(m.body) - 1;\n }\n if ( msgsnd(q, &m, bytes + sizeof(char) + sizeof(long) + sizeof(long), flags) < 0 ) {\n syslog( LOG_ERR, \"failed to msgsnd\" );\n }\n}\n\n\/**\n * block ... read from Q and process msg\n *\/\nint\nChannelClient::receive( char *buffer, int length ) {\n int flags = 0; \/\/ IPC_NOWAIT | MSG_NOERROR\n struct channel_message request;\n\n int bytes = msgrcv( q, &request, sizeof(request), getpid(), flags );\n if ( bytes < 0 ) {\n \/\/ how to handle error -- try again\n }\n strlcpy( buffer, request.body, length );\n return request.error;\n}\n\n\/**\n *\/\nint\nChannelClient::receive( char *buffer, int length, time_t time_limit ) {\n struct channel_message request;\n time_t elapsed = 0;\n struct timespec delay = { 1, 0 };\n pid_t pid = getpid();\n\n do {\n int bytes = msgrcv( q, &request, sizeof(request), pid, IPC_NOWAIT );\n\n if ( bytes > 0 ) {\n strlcpy( buffer, request.body, length );\n return request.error;\n }\n\n#if 0 \/\/ where is valgrind on OSX\n \/**\n * We only want this error correction when we are not running under\n * valgrind, since valgrind changes the name of the program that is\n * running and all messaging would fail since we can not detect process\n * liveness after the program name change.\n *\/\n if ( RUNNING_ON_VALGRIND == 0 ) {\n if ( is_alive(service) == false ) return MESSAGE_EXCEPTION;\n }\n#endif\n nanosleep( &delay, NULL );\n } while ( ++elapsed < time_limit );\n\n syslog( LOG_ERR, \"ERROR channel recv timed out\" );\n return MESSAGE_EXCEPTION;\n}\n\n\/* vim: set autoindent expandtab sw=4 : *\/\n<|endoftext|>"} {"text":"<commit_before>#include <v8.h>\n#include <node.h>\n#include <node_events.h>\n#include <zmq.h>\n#include <assert.h>\n#include <stdio.h>\n#include <string.h>\n#include <errno.h>\n\nusing namespace v8;\nusing namespace node;\n\nnamespace zmq {\n\nstatic Persistent<Integer> p2p_symbol;\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 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, 1, ZMQ_POLL);\n }\n\n ~Context () {\n assert(context_ == NULL);\n }\n\nprivate:\n void * context_;\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_P2P);\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\n NODE_SET_PROTOTYPE_METHOD(t, \"bind\", Bind);\n NODE_SET_PROTOTYPE_METHOD(t, \"connect\", Connect);\n NODE_SET_PROTOTYPE_METHOD(t, \"close\", Close);\n\n target->Set(String::NewSymbol(\"Socket\"), t->GetFunction());\n }\n\n bool Bind(const char *address) {\n return zmq_bind(socket_, address) == 0;\n }\n\n bool Connect(const char *address) {\n return zmq_connect(socket_, address) == 0;\n }\n\n void Close(Local<Value> exception = Local<Value>()) {\n zmq_close(socket_);\n socket_ = NULL;\n Unref();\n }\n\n char * ErrorMessage() {\n return strerror(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 Socket *socket = getSocket(args);\n HandleScope scope;\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 Socket *socket = getSocket(args);\n HandleScope scope;\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 Close (const Arguments &args) {\n Socket *socket = getSocket(args);\n HandleScope scope;\n socket->Close();\n return Undefined();\n }\n\n Socket (Context *context, int type) : EventEmitter () {\n context_ = context;\n socket_ = zmq_socket(context->getCContext(), type);\n }\n\n ~Socket () {\n assert(socket_ == NULL);\n }\n\nprivate:\n static Socket * getSocket(const Arguments &args) {\n return ObjectWrap::Unwrap<Socket>(args.This());\n }\n void *socket_;\n void *context_;\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>realize we don't actually need to keep the context object around for a socket<commit_after>#include <v8.h>\n#include <node.h>\n#include <node_events.h>\n#include <zmq.h>\n#include <assert.h>\n#include <stdio.h>\n#include <string.h>\n#include <errno.h>\n\nusing namespace v8;\nusing namespace node;\n\nnamespace zmq {\n\nstatic Persistent<Integer> p2p_symbol;\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 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, 1, ZMQ_POLL);\n }\n\n ~Context () {\n assert(context_ == NULL);\n }\n\nprivate:\n void * context_;\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_P2P);\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\n NODE_SET_PROTOTYPE_METHOD(t, \"bind\", Bind);\n NODE_SET_PROTOTYPE_METHOD(t, \"connect\", Connect);\n NODE_SET_PROTOTYPE_METHOD(t, \"close\", Close);\n\n target->Set(String::NewSymbol(\"Socket\"), t->GetFunction());\n }\n\n bool Bind(const char *address) {\n return zmq_bind(socket_, address) == 0;\n }\n\n bool Connect(const char *address) {\n return zmq_connect(socket_, address) == 0;\n }\n\n void Close(Local<Value> exception = Local<Value>()) {\n zmq_close(socket_);\n socket_ = NULL;\n Unref();\n }\n\n char * ErrorMessage() {\n return strerror(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 Socket *socket = getSocket(args);\n HandleScope scope;\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 Socket *socket = getSocket(args);\n HandleScope scope;\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 Close (const Arguments &args) {\n Socket *socket = getSocket(args);\n HandleScope scope;\n socket->Close();\n return Undefined();\n }\n\n Socket (Context *context, int type) : EventEmitter () {\n socket_ = zmq_socket(context->getCContext(), type);\n }\n\n ~Socket () {\n assert(socket_ == NULL);\n }\n\nprivate:\n static Socket * getSocket(const Arguments &args) {\n return ObjectWrap::Unwrap<Socket>(args.This());\n }\n void *socket_;\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>#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#define MAD_LIGHTS_LOGGING 1\n\n\nLights::Lights( int pA, int pB, int countLights )\n{\n \/\/ initialize variables\n pinA = pA;\n pinB = pB;\n numLights_total = countLights * 2;\n numLights_perStrip = countLights;\n\n stripA = new Adafruit_NeoPixel(numLights_perStrip, pinA, NEO_GRB + NEO_KHZ800);\n\/\/ stripB = new Adafruit_NeoPixel(numLights_perStrip, 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_total; 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<commit_msg>breaking change to lights for bill to see.<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#define MAD_LIGHTS_LOGGING 1\n\n\nLights::Lights( int pA, int pB, int countLights )\n{\n \/\/ initialize variables\n pinA = pA;\n pinB = pB;\n numLights_total = countLights * 2;\n numLights_perStrip = countLights;\n\n stripA = new Adafruit_NeoPixel(numLights_perStrip, pinA, NEO_GRB + NEO_KHZ800);\n\/\/ stripB = new Adafruit_NeoPixel(numLights_perStrip, 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 return;\n \n static int looper = 0;\n static int r = 40;\n static int b = 0;\n static boolean flop = false;\n \n unsigned long sss = millis();\n \n for ( int i = 0; i < numLights_perStrip; i++ ) {\n \n looper++;\n if ( i == looper ) {\n color c = stripA->Color(0,0,40);\n stripA->setPixelColor(i, c);\n } else {\n color c = stripA->Color(40,0,0);\n stripA->setPixelColor(i, c); \n }\n } \n stripA->show();\n \n unsigned long eee = millis() - sss;\n if ( eee > 10 ) {\n Serial.print(\"Lights took \"); Serial.println(eee);\n }\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_total; 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<|endoftext|>"} {"text":"<commit_before>#ifndef MS_RTC_RTP_PACKET_HPP\n#define MS_RTC_RTP_PACKET_HPP\n\n#include \"common.hpp\"\n#include \"Utils.hpp\"\n#include \"RTC\/RtpDictionaries.hpp\"\n#include <map>\n\nnamespace RTC\n{\n\t\/\/ Max MTU size.\n\tconstexpr size_t MtuSize{ 1500 };\n\n\tclass RtpPacket\n\t{\n\tpublic:\n\t\t\/* Struct for RTP header. *\/\n\t\tstruct Header\n\t\t{\n#if defined(MS_LITTLE_ENDIAN)\n\t\t\tuint8_t csrcCount : 4;\n\t\t\tuint8_t extension : 1;\n\t\t\tuint8_t padding : 1;\n\t\t\tuint8_t version : 2;\n\t\t\tuint8_t payloadType : 7;\n\t\t\tuint8_t marker : 1;\n#elif defined(MS_BIG_ENDIAN)\n\t\t\tuint8_t version : 2;\n\t\t\tuint8_t padding : 1;\n\t\t\tuint8_t extension : 1;\n\t\t\tuint8_t csrcCount : 4;\n\t\t\tuint8_t marker : 1;\n\t\t\tuint8_t payloadType : 7;\n#endif\n\t\t\tuint16_t sequenceNumber;\n\t\t\tuint32_t timestamp;\n\t\t\tuint32_t ssrc;\n\t\t};\n\n\tprivate:\n\t\t\/* Struct for RTP extension header. *\/\n\t\tstruct ExtensionHeader\n\t\t{\n\t\t\tuint16_t id;\n\t\t\tuint16_t length; \/\/ Size of value in multiples of 4 bytes.\n\t\t\tuint8_t value[1];\n\t\t};\n\n\tprivate:\n\t\t\/* Struct for One-Byte extension. *\/\n\t\tstruct OneByteExtension\n\t\t{\n#if defined(MS_LITTLE_ENDIAN)\n\t\t\tuint8_t len : 4;\n\t\t\tuint8_t id : 4;\n#elif defined(MS_BIG_ENDIAN)\n\t\t\tuint8_t id : 4;\n\t\t\tuint8_t len : 4;\n#endif\n\t\t\tuint8_t value[1];\n\t\t};\n\n\tprivate:\n\t\t\/* Struct for Two-Bytes extension. *\/\n\t\tstruct TwoBytesExtension\n\t\t{\n#if defined(MS_LITTLE_ENDIAN)\n\t\t\tuint8_t len : 8;\n\t\t\tuint8_t id : 8;\n#elif defined(MS_BIG_ENDIAN)\n\t\t\tuint8_t id : 8;\n\t\t\tuint8_t len : 8;\n#endif\n\t\t\tuint8_t value[1];\n\t\t};\n\n\tpublic:\n\t\tstatic bool IsRtp(const uint8_t* data, size_t len);\n\t\tstatic RtpPacket* Parse(const uint8_t* data, size_t len);\n\n\tpublic:\n\t\tRtpPacket(\n\t\t Header* header,\n\t\t ExtensionHeader* extensionHeader,\n\t\t const uint8_t* payload,\n\t\t size_t payloadLength,\n\t\t uint8_t payloadPadding,\n\t\t size_t size);\n\t\t~RtpPacket();\n\n\t\tvoid Dump() const;\n\t\tconst uint8_t* GetData() const;\n\t\tsize_t GetSize() const;\n\t\tuint8_t GetPayloadType() const;\n\t\tvoid SetPayloadType(uint8_t payloadType);\n\t\tbool HasMarker() const;\n\t\tvoid SetMarker(bool marker);\n\t\tuint16_t GetSequenceNumber() const;\n\t\tvoid SetSequenceNumber(uint16_t seq);\n\t\tuint32_t GetExtendedSequenceNumber() const;\n\t\tvoid SetExtendedSequenceNumber(uint32_t seq32);\n\t\tuint32_t GetTimestamp() const;\n\t\tvoid SetTimestamp(uint32_t timestamp);\n\t\tuint32_t GetSsrc() const;\n\t\tvoid SetSsrc(uint32_t ssrc);\n\t\tbool HasExtensionHeader() const;\n\t\tuint16_t GetExtensionHeaderId() const;\n\t\tsize_t GetExtensionHeaderLength() const;\n\t\tuint8_t* GetExtensionHeaderValue() const;\n\t\tbool HasOneByteExtensions() const;\n\t\tbool HasTwoBytesExtensions() const;\n\t\tvoid AddExtensionMapping(RtpHeaderExtensionUri::Type uri, uint8_t id);\n\t\tuint8_t* GetExtension(RtpHeaderExtensionUri::Type uri, uint8_t* len) const;\n\t\tbool ReadAudioLevel(uint8_t* volume, bool* voice) const;\n\t\tbool ReadAbsSendTime(uint32_t* time) const;\n\t\tuint8_t* GetPayload() const;\n\t\tsize_t GetPayloadLength() const;\n\t\tvoid Serialize(uint8_t* buffer);\n\t\tRtpPacket* Clone(uint8_t* buffer) const;\n\t\tvoid RtxEncode(uint8_t payloadType, uint32_t ssrc, uint16_t seq);\n\t\tbool RtxDecode(uint8_t payloadType, uint32_t ssrc);\n\n\tprivate:\n\t\tvoid ParseExtensions();\n\n\tprivate:\n\t\t\/\/ Passed by argument.\n\t\tHeader* header{ nullptr };\n\t\tuint8_t* csrcList{ nullptr };\n\t\tExtensionHeader* extensionHeader{ nullptr };\n\t\tstd::map<uint8_t, OneByteExtension*> oneByteExtensions;\n\t\tstd::map<uint8_t, TwoBytesExtension*> twoBytesExtensions;\n\t\tstd::map<RtpHeaderExtensionUri::Type, uint8_t> extensionMap;\n\t\tuint8_t* payload{ nullptr };\n\t\tsize_t payloadLength{ 0 };\n\t\tuint8_t payloadPadding{ 0 };\n\t\tsize_t size{ 0 }; \/\/ Full size of the packet in bytes.\n\t\tuint32_t seq32{ 0 }; \/\/ Extended seq number.\n\t};\n\n\t\/* Inline static methods. *\/\n\n\tinline bool RtpPacket::IsRtp(const uint8_t* data, size_t len)\n\t{\n\t\t\/\/ NOTE: RtcpPacket::IsRtcp() must always be called before this method.\n\n\t\tauto header = const_cast<Header*>(reinterpret_cast<const Header*>(data));\n\n\t\treturn (\n\t\t (len >= sizeof(Header)) &&\n\t\t \/\/ DOC: https:\/\/tools.ietf.org\/html\/draft-ietf-avtcore-rfc5764-mux-fixes\n\t\t (data[0] > 127 && data[0] < 192) &&\n\t\t \/\/ RTP Version must be 2.\n\t\t (header->version == 2));\n\t}\n\n\t\/* Inline instance methods. *\/\n\n\tinline const uint8_t* RtpPacket::GetData() const\n\t{\n\t\treturn (const uint8_t*)this->header;\n\t}\n\n\tinline size_t RtpPacket::GetSize() const\n\t{\n\t\treturn this->size;\n\t}\n\n\tinline uint8_t RtpPacket::GetPayloadType() const\n\t{\n\t\treturn this->header->payloadType;\n\t}\n\n\tinline void RtpPacket::SetPayloadType(uint8_t payloadType)\n\t{\n\t\tthis->header->payloadType = payloadType;\n\t}\n\n\tinline bool RtpPacket::HasMarker() const\n\t{\n\t\treturn this->header->marker;\n\t}\n\n\tinline void RtpPacket::SetMarker(bool marker)\n\t{\n\t\tthis->header->marker = marker;\n\t}\n\n\tinline uint16_t RtpPacket::GetSequenceNumber() const\n\t{\n\t\treturn uint16_t{ ntohs(this->header->sequenceNumber) };\n\t}\n\n\tinline void RtpPacket::SetSequenceNumber(uint16_t seq)\n\t{\n\t\tthis->header->sequenceNumber = uint16_t{ htons(seq) };\n\t}\n\n\tinline uint32_t RtpPacket::GetExtendedSequenceNumber() const\n\t{\n\t\treturn this->seq32;\n\t}\n\n\tinline void RtpPacket::SetExtendedSequenceNumber(uint32_t seq32)\n\t{\n\t\tthis->seq32 = seq32;\n\t}\n\n\tinline uint32_t RtpPacket::GetTimestamp() const\n\t{\n\t\treturn uint32_t{ ntohl(this->header->timestamp) };\n\t}\n\n\tinline void RtpPacket::SetTimestamp(uint32_t timestamp)\n\t{\n\t\tthis->header->timestamp = uint32_t{ htonl(timestamp) };\n\t}\n\n\tinline uint32_t RtpPacket::GetSsrc() const\n\t{\n\t\treturn uint32_t{ ntohl(this->header->ssrc) };\n\t}\n\n\tinline void RtpPacket::SetSsrc(uint32_t ssrc)\n\t{\n\t\tthis->header->ssrc = uint32_t{ htonl(ssrc) };\n\t}\n\n\tinline bool RtpPacket::HasExtensionHeader() const\n\t{\n\t\treturn (this->extensionHeader ? true : false);\n\t}\n\n\tinline uint16_t RtpPacket::GetExtensionHeaderId() const\n\t{\n\t\tif (!this->extensionHeader)\n\t\t\treturn 0;\n\n\t\treturn uint16_t{ ntohs(this->extensionHeader->id) };\n\t}\n\n\tinline size_t RtpPacket::GetExtensionHeaderLength() const\n\t{\n\t\tif (!this->extensionHeader)\n\t\t\treturn 0;\n\n\t\treturn static_cast<size_t>(ntohs(this->extensionHeader->length) * 4);\n\t}\n\n\tinline uint8_t* RtpPacket::GetExtensionHeaderValue() const\n\t{\n\t\tif (!this->extensionHeader)\n\t\t\treturn nullptr;\n\n\t\treturn this->extensionHeader->value;\n\t}\n\n\tinline bool RtpPacket::HasOneByteExtensions() const\n\t{\n\t\treturn GetExtensionHeaderId() == 0xBEDE;\n\t}\n\n\tinline bool RtpPacket::HasTwoBytesExtensions() const\n\t{\n\t\treturn (GetExtensionHeaderId() & 0b1111111111110000) == 0b0001000000000000;\n\t}\n\n\tinline void RtpPacket::AddExtensionMapping(RtpHeaderExtensionUri::Type uri, uint8_t id)\n\t{\n\t\tthis->extensionMap[uri] = id;\n\t}\n\n\tinline uint8_t* RtpPacket::GetExtension(RtpHeaderExtensionUri::Type uri, uint8_t* len) const\n\t{\n\t\t*len = 0;\n\n\t\tif (this->extensionMap.find(uri) == this->extensionMap.end())\n\t\t\treturn nullptr;\n\n\t\tuint8_t id = this->extensionMap.at(uri);\n\n\t\tif (HasOneByteExtensions())\n\t\t{\n\t\t\tif (this->oneByteExtensions.find(id) == this->oneByteExtensions.end())\n\t\t\t\treturn nullptr;\n\n\t\t\t*len = this->oneByteExtensions.at(id)->len + 1;\n\n\t\t\treturn this->oneByteExtensions.at(id)->value;\n\t\t}\n\t\telse if (HasTwoBytesExtensions())\n\t\t{\n\t\t\tif (this->twoBytesExtensions.find(id) == this->twoBytesExtensions.end())\n\t\t\t\treturn nullptr;\n\n\t\t\t*len = this->oneByteExtensions.at(id)->len;\n\n\t\t\treturn this->twoBytesExtensions.at(id)->value;\n\t\t}\n\t\telse\n\t\t{\n\t\t\treturn nullptr;\n\t\t}\n\t}\n\n\tinline bool RtpPacket::ReadAudioLevel(uint8_t* volume, bool* voice) const\n\t{\n\t\tuint8_t extenLen;\n\t\tuint8_t* extenValue;\n\n\t\textenValue = GetExtension(RtpHeaderExtensionUri::Type::SSRC_AUDIO_LEVEL, &extenLen);\n\n\t\tif (!extenValue || extenLen != 1)\n\t\t\treturn false;\n\n\t\t*volume = Utils::Byte::Get1Byte(extenValue, 0);\n\t\t*voice = (*volume & (1 << 7)) ? true : false;\n\t\t*volume &= ~(1 << 7);\n\n\t\treturn true;\n\t}\n\n\tinline bool RtpPacket::ReadAbsSendTime(uint32_t* time) const\n\t{\n\t\tuint8_t extenLen;\n\t\tuint8_t* extenValue;\n\n\t\textenValue = GetExtension(RtpHeaderExtensionUri::Type::ABS_SEND_TIME, &extenLen);\n\n\t\tif (!extenValue || extenLen != 3)\n\t\t\treturn false;\n\n\t\t*time = Utils::Byte::Get3Bytes(extenValue, 0);\n\n\t\treturn true;\n\t}\n\n\tinline uint8_t* RtpPacket::GetPayload() const\n\t{\n\t\treturn this->payload;\n\t}\n\n\tinline size_t RtpPacket::GetPayloadLength() const\n\t{\n\t\treturn this->payloadLength;\n\t}\n} \/\/ namespace RTC\n\n#endif\n<commit_msg>Fix bug<commit_after>#ifndef MS_RTC_RTP_PACKET_HPP\n#define MS_RTC_RTP_PACKET_HPP\n\n#include \"common.hpp\"\n#include \"Utils.hpp\"\n#include \"RTC\/RtpDictionaries.hpp\"\n#include <map>\n\nnamespace RTC\n{\n\t\/\/ Max MTU size.\n\tconstexpr size_t MtuSize{ 1500 };\n\n\tclass RtpPacket\n\t{\n\tpublic:\n\t\t\/* Struct for RTP header. *\/\n\t\tstruct Header\n\t\t{\n#if defined(MS_LITTLE_ENDIAN)\n\t\t\tuint8_t csrcCount : 4;\n\t\t\tuint8_t extension : 1;\n\t\t\tuint8_t padding : 1;\n\t\t\tuint8_t version : 2;\n\t\t\tuint8_t payloadType : 7;\n\t\t\tuint8_t marker : 1;\n#elif defined(MS_BIG_ENDIAN)\n\t\t\tuint8_t version : 2;\n\t\t\tuint8_t padding : 1;\n\t\t\tuint8_t extension : 1;\n\t\t\tuint8_t csrcCount : 4;\n\t\t\tuint8_t marker : 1;\n\t\t\tuint8_t payloadType : 7;\n#endif\n\t\t\tuint16_t sequenceNumber;\n\t\t\tuint32_t timestamp;\n\t\t\tuint32_t ssrc;\n\t\t};\n\n\tprivate:\n\t\t\/* Struct for RTP extension header. *\/\n\t\tstruct ExtensionHeader\n\t\t{\n\t\t\tuint16_t id;\n\t\t\tuint16_t length; \/\/ Size of value in multiples of 4 bytes.\n\t\t\tuint8_t value[1];\n\t\t};\n\n\tprivate:\n\t\t\/* Struct for One-Byte extension. *\/\n\t\tstruct OneByteExtension\n\t\t{\n#if defined(MS_LITTLE_ENDIAN)\n\t\t\tuint8_t len : 4;\n\t\t\tuint8_t id : 4;\n#elif defined(MS_BIG_ENDIAN)\n\t\t\tuint8_t id : 4;\n\t\t\tuint8_t len : 4;\n#endif\n\t\t\tuint8_t value[1];\n\t\t};\n\n\tprivate:\n\t\t\/* Struct for Two-Bytes extension. *\/\n\t\tstruct TwoBytesExtension\n\t\t{\n#if defined(MS_LITTLE_ENDIAN)\n\t\t\tuint8_t len : 8;\n\t\t\tuint8_t id : 8;\n#elif defined(MS_BIG_ENDIAN)\n\t\t\tuint8_t id : 8;\n\t\t\tuint8_t len : 8;\n#endif\n\t\t\tuint8_t value[1];\n\t\t};\n\n\tpublic:\n\t\tstatic bool IsRtp(const uint8_t* data, size_t len);\n\t\tstatic RtpPacket* Parse(const uint8_t* data, size_t len);\n\n\tpublic:\n\t\tRtpPacket(\n\t\t Header* header,\n\t\t ExtensionHeader* extensionHeader,\n\t\t const uint8_t* payload,\n\t\t size_t payloadLength,\n\t\t uint8_t payloadPadding,\n\t\t size_t size);\n\t\t~RtpPacket();\n\n\t\tvoid Dump() const;\n\t\tconst uint8_t* GetData() const;\n\t\tsize_t GetSize() const;\n\t\tuint8_t GetPayloadType() const;\n\t\tvoid SetPayloadType(uint8_t payloadType);\n\t\tbool HasMarker() const;\n\t\tvoid SetMarker(bool marker);\n\t\tuint16_t GetSequenceNumber() const;\n\t\tvoid SetSequenceNumber(uint16_t seq);\n\t\tuint32_t GetExtendedSequenceNumber() const;\n\t\tvoid SetExtendedSequenceNumber(uint32_t seq32);\n\t\tuint32_t GetTimestamp() const;\n\t\tvoid SetTimestamp(uint32_t timestamp);\n\t\tuint32_t GetSsrc() const;\n\t\tvoid SetSsrc(uint32_t ssrc);\n\t\tbool HasExtensionHeader() const;\n\t\tuint16_t GetExtensionHeaderId() const;\n\t\tsize_t GetExtensionHeaderLength() const;\n\t\tuint8_t* GetExtensionHeaderValue() const;\n\t\tbool HasOneByteExtensions() const;\n\t\tbool HasTwoBytesExtensions() const;\n\t\tvoid AddExtensionMapping(RtpHeaderExtensionUri::Type uri, uint8_t id);\n\t\tuint8_t* GetExtension(RtpHeaderExtensionUri::Type uri, uint8_t* len) const;\n\t\tbool ReadAudioLevel(uint8_t* volume, bool* voice) const;\n\t\tbool ReadAbsSendTime(uint32_t* time) const;\n\t\tuint8_t* GetPayload() const;\n\t\tsize_t GetPayloadLength() const;\n\t\tvoid Serialize(uint8_t* buffer);\n\t\tRtpPacket* Clone(uint8_t* buffer) const;\n\t\tvoid RtxEncode(uint8_t payloadType, uint32_t ssrc, uint16_t seq);\n\t\tbool RtxDecode(uint8_t payloadType, uint32_t ssrc);\n\n\tprivate:\n\t\tvoid ParseExtensions();\n\n\tprivate:\n\t\t\/\/ Passed by argument.\n\t\tHeader* header{ nullptr };\n\t\tuint8_t* csrcList{ nullptr };\n\t\tExtensionHeader* extensionHeader{ nullptr };\n\t\tstd::map<uint8_t, OneByteExtension*> oneByteExtensions;\n\t\tstd::map<uint8_t, TwoBytesExtension*> twoBytesExtensions;\n\t\tstd::map<RtpHeaderExtensionUri::Type, uint8_t> extensionMap;\n\t\tuint8_t* payload{ nullptr };\n\t\tsize_t payloadLength{ 0 };\n\t\tuint8_t payloadPadding{ 0 };\n\t\tsize_t size{ 0 }; \/\/ Full size of the packet in bytes.\n\t\tuint32_t seq32{ 0 }; \/\/ Extended seq number.\n\t};\n\n\t\/* Inline static methods. *\/\n\n\tinline bool RtpPacket::IsRtp(const uint8_t* data, size_t len)\n\t{\n\t\t\/\/ NOTE: RtcpPacket::IsRtcp() must always be called before this method.\n\n\t\tauto header = const_cast<Header*>(reinterpret_cast<const Header*>(data));\n\n\t\treturn (\n\t\t (len >= sizeof(Header)) &&\n\t\t \/\/ DOC: https:\/\/tools.ietf.org\/html\/draft-ietf-avtcore-rfc5764-mux-fixes\n\t\t (data[0] > 127 && data[0] < 192) &&\n\t\t \/\/ RTP Version must be 2.\n\t\t (header->version == 2));\n\t}\n\n\t\/* Inline instance methods. *\/\n\n\tinline const uint8_t* RtpPacket::GetData() const\n\t{\n\t\treturn (const uint8_t*)this->header;\n\t}\n\n\tinline size_t RtpPacket::GetSize() const\n\t{\n\t\treturn this->size;\n\t}\n\n\tinline uint8_t RtpPacket::GetPayloadType() const\n\t{\n\t\treturn this->header->payloadType;\n\t}\n\n\tinline void RtpPacket::SetPayloadType(uint8_t payloadType)\n\t{\n\t\tthis->header->payloadType = payloadType;\n\t}\n\n\tinline bool RtpPacket::HasMarker() const\n\t{\n\t\treturn this->header->marker;\n\t}\n\n\tinline void RtpPacket::SetMarker(bool marker)\n\t{\n\t\tthis->header->marker = marker;\n\t}\n\n\tinline uint16_t RtpPacket::GetSequenceNumber() const\n\t{\n\t\treturn uint16_t{ ntohs(this->header->sequenceNumber) };\n\t}\n\n\tinline void RtpPacket::SetSequenceNumber(uint16_t seq)\n\t{\n\t\tthis->header->sequenceNumber = uint16_t{ htons(seq) };\n\t}\n\n\tinline uint32_t RtpPacket::GetExtendedSequenceNumber() const\n\t{\n\t\treturn this->seq32;\n\t}\n\n\tinline void RtpPacket::SetExtendedSequenceNumber(uint32_t seq32)\n\t{\n\t\tthis->seq32 = seq32;\n\t}\n\n\tinline uint32_t RtpPacket::GetTimestamp() const\n\t{\n\t\treturn uint32_t{ ntohl(this->header->timestamp) };\n\t}\n\n\tinline void RtpPacket::SetTimestamp(uint32_t timestamp)\n\t{\n\t\tthis->header->timestamp = uint32_t{ htonl(timestamp) };\n\t}\n\n\tinline uint32_t RtpPacket::GetSsrc() const\n\t{\n\t\treturn uint32_t{ ntohl(this->header->ssrc) };\n\t}\n\n\tinline void RtpPacket::SetSsrc(uint32_t ssrc)\n\t{\n\t\tthis->header->ssrc = uint32_t{ htonl(ssrc) };\n\t}\n\n\tinline bool RtpPacket::HasExtensionHeader() const\n\t{\n\t\treturn (this->extensionHeader ? true : false);\n\t}\n\n\tinline uint16_t RtpPacket::GetExtensionHeaderId() const\n\t{\n\t\tif (!this->extensionHeader)\n\t\t\treturn 0;\n\n\t\treturn uint16_t{ ntohs(this->extensionHeader->id) };\n\t}\n\n\tinline size_t RtpPacket::GetExtensionHeaderLength() const\n\t{\n\t\tif (!this->extensionHeader)\n\t\t\treturn 0;\n\n\t\treturn static_cast<size_t>(ntohs(this->extensionHeader->length) * 4);\n\t}\n\n\tinline uint8_t* RtpPacket::GetExtensionHeaderValue() const\n\t{\n\t\tif (!this->extensionHeader)\n\t\t\treturn nullptr;\n\n\t\treturn this->extensionHeader->value;\n\t}\n\n\tinline bool RtpPacket::HasOneByteExtensions() const\n\t{\n\t\treturn GetExtensionHeaderId() == 0xBEDE;\n\t}\n\n\tinline bool RtpPacket::HasTwoBytesExtensions() const\n\t{\n\t\treturn (GetExtensionHeaderId() & 0b1111111111110000) == 0b0001000000000000;\n\t}\n\n\tinline void RtpPacket::AddExtensionMapping(RtpHeaderExtensionUri::Type uri, uint8_t id)\n\t{\n\t\tthis->extensionMap[uri] = id;\n\t}\n\n\tinline uint8_t* RtpPacket::GetExtension(RtpHeaderExtensionUri::Type uri, uint8_t* len) const\n\t{\n\t\t*len = 0;\n\n\t\tif (this->extensionMap.find(uri) == this->extensionMap.end())\n\t\t\treturn nullptr;\n\n\t\tuint8_t id = this->extensionMap.at(uri);\n\n\t\tif (HasOneByteExtensions())\n\t\t{\n\t\t\tif (this->oneByteExtensions.find(id) == this->oneByteExtensions.end())\n\t\t\t\treturn nullptr;\n\n\t\t\t*len = this->oneByteExtensions.at(id)->len + 1;\n\n\t\t\treturn this->oneByteExtensions.at(id)->value;\n\t\t}\n\t\telse if (HasTwoBytesExtensions())\n\t\t{\n\t\t\tif (this->twoBytesExtensions.find(id) == this->twoBytesExtensions.end())\n\t\t\t\treturn nullptr;\n\n\t\t\t*len = this->twoByteExtensions.at(id)->len;\n\n\t\t\treturn this->twoBytesExtensions.at(id)->value;\n\t\t}\n\t\telse\n\t\t{\n\t\t\treturn nullptr;\n\t\t}\n\t}\n\n\tinline bool RtpPacket::ReadAudioLevel(uint8_t* volume, bool* voice) const\n\t{\n\t\tuint8_t extenLen;\n\t\tuint8_t* extenValue;\n\n\t\textenValue = GetExtension(RtpHeaderExtensionUri::Type::SSRC_AUDIO_LEVEL, &extenLen);\n\n\t\tif (!extenValue || extenLen != 1)\n\t\t\treturn false;\n\n\t\t*volume = Utils::Byte::Get1Byte(extenValue, 0);\n\t\t*voice = (*volume & (1 << 7)) ? true : false;\n\t\t*volume &= ~(1 << 7);\n\n\t\treturn true;\n\t}\n\n\tinline bool RtpPacket::ReadAbsSendTime(uint32_t* time) const\n\t{\n\t\tuint8_t extenLen;\n\t\tuint8_t* extenValue;\n\n\t\textenValue = GetExtension(RtpHeaderExtensionUri::Type::ABS_SEND_TIME, &extenLen);\n\n\t\tif (!extenValue || extenLen != 3)\n\t\t\treturn false;\n\n\t\t*time = Utils::Byte::Get3Bytes(extenValue, 0);\n\n\t\treturn true;\n\t}\n\n\tinline uint8_t* RtpPacket::GetPayload() const\n\t{\n\t\treturn this->payload;\n\t}\n\n\tinline size_t RtpPacket::GetPayloadLength() const\n\t{\n\t\treturn this->payloadLength;\n\t}\n} \/\/ namespace RTC\n\n#endif\n<|endoftext|>"} {"text":"<commit_before>#include \"ChunkPatcher.h\"\r\n#include \"..\/stringtools.h\"\r\n#include <assert.h>\r\n\r\nChunkPatcher::ChunkPatcher(void)\r\n\t: cb(NULL), require_unchanged(true)\r\n{\r\n}\r\n\r\nvoid ChunkPatcher::setCallback(IChunkPatcherCallback *pCb)\r\n{\r\n\tcb=pCb;\r\n}\r\n\r\nbool ChunkPatcher::ApplyPatch(IFile *file, IFile *patch)\r\n{\r\n\tpatch->Seek(0);\r\n\tfile->Seek(0);\r\n\t_i64 patchf_pos=0;\r\n\r\n\tconst unsigned int buffer_size=32768;\r\n\tchar buf[buffer_size];\r\n\r\n\tif(patch->Read((char*)&filesize, sizeof(_i64))!=sizeof(_i64))\r\n\t{\r\n\t\treturn false;\r\n\t}\r\n\r\n\tfilesize = little_endian(filesize);\r\n\r\n\tpatchf_pos+=sizeof(_i64);\r\n\r\n\tSPatchHeader next_header;\r\n\tnext_header.patch_off=-1;\r\n\tbool has_header=true;\r\n\tfor(_i64 file_pos=0,size=file->Size(); (file_pos<size && file_pos<filesize) || has_header;)\r\n\t{\r\n\t\tif(has_header && next_header.patch_off==-1)\r\n\t\t{\r\n\t\t\thas_header=readNextValidPatch(patch, patchf_pos, &next_header);\r\n\t\t}\r\n\r\n\t\tunsigned int tr=buffer_size;\r\n\t\tif(next_header.patch_off!=-1)\r\n\t\t{\r\n\t\t\t_i64 hoff=next_header.patch_off-file_pos;\r\n\t\t\tif(hoff>=0 && hoff<tr)\r\n\t\t\t\ttr=(unsigned int)hoff;\r\n\r\n\t\t\tassert(hoff>=0);\r\n\t\t}\r\n\r\n\t\tif(file_pos>=filesize)\r\n\t\t{\r\n\t\t\tServer->Log(\"Patch corrupt file_pos>=filesize. file_pos=\"+nconvert(file_pos)+\" next_header.patch_off=\"+nconvert(next_header.patch_off)+\" next_header.patch_size=\"+nconvert(next_header.patch_size)+\" tr=\"+nconvert(tr)+\" size=\"+nconvert(size)+\" filesize=\"+nconvert(filesize)+\" has_header=\"+nconvert(has_header), LL_ERROR);\r\n\t\t\tassert(file_pos<filesize);\r\n\t\t\treturn false;\r\n\t\t}\r\n\r\n\t\tif(tr==0)\r\n\t\t{\r\n\t\t\tassert(file_pos==next_header.patch_off);\r\n\r\n\t\t\tfile_pos+=next_header.patch_size;\r\n\r\n\t\t\twhile(next_header.patch_size>0)\r\n\t\t\t{\r\n\t\t\t\t_u32 r=patch->Read((char*)buf, (std::min)((unsigned int)buffer_size, next_header.patch_size));\r\n\t\t\t\tpatchf_pos+=r;\r\n\t\t\t\tcb->next_chunk_patcher_bytes(buf, r, true);\r\n\t\t\t\tnext_header.patch_size-=r;\r\n\t\t\t}\r\n\t\t\tif(require_unchanged)\r\n\t\t\t{\r\n\t\t\t\tfile->Seek(file_pos);\r\n\t\t\t}\r\n\t\t\tnext_header.patch_off=-1;\r\n\t\t}\r\n\t\telse if(file_pos<size && file_pos<filesize)\r\n\t\t{\r\n\t\t\twhile(tr>0 && file_pos<size && file_pos<filesize)\r\n\t\t\t{\r\n\t\t\t\tif(file_pos+tr>filesize)\n\t\t\t\t{\n\t\t\t\t\ttr=static_cast<unsigned int>(filesize-file_pos);\n\t\t\t\t}\r\n\r\n\t\t\t\tif(require_unchanged)\r\n\t\t\t\t{\n\t\t\t\t\t_u32 r=file->Read((char*)buf, tr);\r\n\t\t\t\t\tfile_pos+=r;\r\n\t\t\t\t\tcb->next_chunk_patcher_bytes(buf, r, false);\r\n\t\t\t\t\ttr-=r;\r\n\t\t\t\t}\r\n\t\t\t\telse\r\n\t\t\t\t{\r\n\t\t\t\t\tif(file_pos+tr>size)\n\t\t\t\t\t{\n\t\t\t\t\t\ttr=static_cast<unsigned int>(size-file_pos);\n\t\t\t\t\t}\r\n\r\n\t\t\t\t\tfile_pos+=tr;\r\n\t\t\t\t\tcb->next_chunk_patcher_bytes(NULL, tr, false);\r\n\t\t\t\t\ttr=0;\r\n\t\t\t\t}\t\t\t\t\r\n\t\t\t}\t\t\t\r\n\t\t}\r\n\t\telse\r\n\t\t{\r\n\t\t\tServer->Log(\"Patch corrupt. file_pos=\"+nconvert(file_pos)+\" next_header.patch_off=\"+nconvert(next_header.patch_off)+\" next_header.patch_size=\"+nconvert(next_header.patch_size)+\" tr=\"+nconvert(tr)+\" size=\"+nconvert(size)+\" filesize=\"+nconvert(filesize), LL_ERROR);\r\n\t\t\tassert(false);\r\n\t\t\treturn false;\r\n\t\t}\r\n\t}\r\n\treturn true;\r\n}\r\n\r\nbool ChunkPatcher::readNextValidPatch(IFile *patchf, _i64 &patchf_pos, SPatchHeader *patch_header)\r\n{\r\n\tconst unsigned int to_read=sizeof(_i64)+sizeof(unsigned int);\r\n\tdo\r\n\t{\r\n\t\t_u32 r=patchf->Read((char*)&patch_header->patch_off, to_read);\r\n\t\tpatchf_pos+=r;\r\n\t\tif(r!=to_read)\r\n\t\t{\r\n\t\t\tpatch_header->patch_off=-1;\r\n\t\t\tpatch_header->patch_size=0;\r\n\t\t\treturn false;\r\n\t\t}\r\n\t\telse\r\n\t\t{\r\n\t\t\tpatch_header->patch_off = little_endian(patch_header->patch_off);\r\n\t\t\tpatch_header->patch_size = little_endian(patch_header->patch_size);\r\n\t\t}\r\n\r\n\t\tif(patch_header->patch_off==-1)\r\n\t\t{\r\n\t\t\tpatchf_pos+=patch_header->patch_size;\r\n\t\t\tpatchf->Seek(patchf_pos);\r\n\t\t}\r\n\t}\r\n\twhile(patch_header->patch_off==-1);\r\n\r\n\treturn true;\r\n}\r\n\r\n_i64 ChunkPatcher::getFilesize(void)\r\n{\r\n\treturn filesize;\r\n}\r\n\r\nvoid ChunkPatcher::setRequireUnchanged( bool b )\r\n{\r\n\trequire_unchanged=b;\r\n}\r\n<commit_msg>Exit if no header was found and file was patched<commit_after>#include \"ChunkPatcher.h\"\r\n#include \"..\/stringtools.h\"\r\n#include <assert.h>\r\n\r\nChunkPatcher::ChunkPatcher(void)\r\n\t: cb(NULL), require_unchanged(true)\r\n{\r\n}\r\n\r\nvoid ChunkPatcher::setCallback(IChunkPatcherCallback *pCb)\r\n{\r\n\tcb=pCb;\r\n}\r\n\r\nbool ChunkPatcher::ApplyPatch(IFile *file, IFile *patch)\r\n{\r\n\tpatch->Seek(0);\r\n\tfile->Seek(0);\r\n\t_i64 patchf_pos=0;\r\n\r\n\tconst unsigned int buffer_size=32768;\r\n\tchar buf[buffer_size];\r\n\r\n\tif(patch->Read((char*)&filesize, sizeof(_i64))!=sizeof(_i64))\r\n\t{\r\n\t\treturn false;\r\n\t}\r\n\r\n\tfilesize = little_endian(filesize);\r\n\r\n\tpatchf_pos+=sizeof(_i64);\r\n\r\n\tSPatchHeader next_header;\r\n\tnext_header.patch_off=-1;\r\n\tbool has_header=true;\r\n\tfor(_i64 file_pos=0,size=file->Size(); (file_pos<size && file_pos<filesize) || has_header;)\r\n\t{\r\n\t\tif(has_header && next_header.patch_off==-1)\r\n\t\t{\r\n\t\t\thas_header=readNextValidPatch(patch, patchf_pos, &next_header);\r\n\r\n\t\t\tif(!has_header && file_pos>=filesize)\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\tunsigned int tr=buffer_size;\r\n\t\tif(next_header.patch_off!=-1)\r\n\t\t{\r\n\t\t\t_i64 hoff=next_header.patch_off-file_pos;\r\n\t\t\tif(hoff>=0 && hoff<tr)\r\n\t\t\t\ttr=(unsigned int)hoff;\r\n\r\n\t\t\tassert(hoff>=0);\r\n\t\t}\r\n\r\n\t\tif(file_pos>=filesize)\r\n\t\t{\r\n\t\t\tServer->Log(\"Patch corrupt file_pos>=filesize. file_pos=\"+nconvert(file_pos)+\" next_header.patch_off=\"+nconvert(next_header.patch_off)+\" next_header.patch_size=\"+nconvert(next_header.patch_size)+\" tr=\"+nconvert(tr)+\" size=\"+nconvert(size)+\" filesize=\"+nconvert(filesize)+\" has_header=\"+nconvert(has_header), LL_ERROR);\r\n\t\t\tassert(file_pos<filesize);\r\n\t\t\treturn false;\r\n\t\t}\r\n\r\n\t\tif(tr==0)\r\n\t\t{\r\n\t\t\tassert(file_pos==next_header.patch_off);\r\n\r\n\t\t\tfile_pos+=next_header.patch_size;\r\n\r\n\t\t\twhile(next_header.patch_size>0)\r\n\t\t\t{\r\n\t\t\t\t_u32 r=patch->Read((char*)buf, (std::min)((unsigned int)buffer_size, next_header.patch_size));\r\n\t\t\t\tpatchf_pos+=r;\r\n\t\t\t\tcb->next_chunk_patcher_bytes(buf, r, true);\r\n\t\t\t\tnext_header.patch_size-=r;\r\n\t\t\t}\r\n\t\t\tif(require_unchanged)\r\n\t\t\t{\r\n\t\t\t\tfile->Seek(file_pos);\r\n\t\t\t}\r\n\t\t\tnext_header.patch_off=-1;\r\n\t\t}\r\n\t\telse if(file_pos<size && file_pos<filesize)\r\n\t\t{\r\n\t\t\twhile(tr>0 && file_pos<size && file_pos<filesize)\r\n\t\t\t{\r\n\t\t\t\tif(file_pos+tr>filesize)\n\t\t\t\t{\n\t\t\t\t\ttr=static_cast<unsigned int>(filesize-file_pos);\n\t\t\t\t}\r\n\r\n\t\t\t\tif(require_unchanged)\r\n\t\t\t\t{\n\t\t\t\t\t_u32 r=file->Read((char*)buf, tr);\r\n\t\t\t\t\tfile_pos+=r;\r\n\t\t\t\t\tcb->next_chunk_patcher_bytes(buf, r, false);\r\n\t\t\t\t\ttr-=r;\r\n\t\t\t\t}\r\n\t\t\t\telse\r\n\t\t\t\t{\r\n\t\t\t\t\tif(file_pos+tr>size)\n\t\t\t\t\t{\n\t\t\t\t\t\ttr=static_cast<unsigned int>(size-file_pos);\n\t\t\t\t\t}\r\n\r\n\t\t\t\t\tfile_pos+=tr;\r\n\t\t\t\t\tcb->next_chunk_patcher_bytes(NULL, tr, false);\r\n\t\t\t\t\ttr=0;\r\n\t\t\t\t}\t\t\t\t\r\n\t\t\t}\t\t\t\r\n\t\t}\r\n\t\telse\r\n\t\t{\r\n\t\t\tServer->Log(\"Patch corrupt. file_pos=\"+nconvert(file_pos)+\" next_header.patch_off=\"+nconvert(next_header.patch_off)+\" next_header.patch_size=\"+nconvert(next_header.patch_size)+\" tr=\"+nconvert(tr)+\" size=\"+nconvert(size)+\" filesize=\"+nconvert(filesize), LL_ERROR);\r\n\t\t\tassert(false);\r\n\t\t\treturn false;\r\n\t\t}\r\n\t}\r\n\treturn true;\r\n}\r\n\r\nbool ChunkPatcher::readNextValidPatch(IFile *patchf, _i64 &patchf_pos, SPatchHeader *patch_header)\r\n{\r\n\tconst unsigned int to_read=sizeof(_i64)+sizeof(unsigned int);\r\n\tdo\r\n\t{\r\n\t\t_u32 r=patchf->Read((char*)&patch_header->patch_off, to_read);\r\n\t\tpatchf_pos+=r;\r\n\t\tif(r!=to_read)\r\n\t\t{\r\n\t\t\tpatch_header->patch_off=-1;\r\n\t\t\tpatch_header->patch_size=0;\r\n\t\t\treturn false;\r\n\t\t}\r\n\t\telse\r\n\t\t{\r\n\t\t\tpatch_header->patch_off = little_endian(patch_header->patch_off);\r\n\t\t\tpatch_header->patch_size = little_endian(patch_header->patch_size);\r\n\t\t}\r\n\r\n\t\tif(patch_header->patch_off==-1)\r\n\t\t{\r\n\t\t\tpatchf_pos+=patch_header->patch_size;\r\n\t\t\tpatchf->Seek(patchf_pos);\r\n\t\t}\r\n\t}\r\n\twhile(patch_header->patch_off==-1);\r\n\r\n\treturn true;\r\n}\r\n\r\n_i64 ChunkPatcher::getFilesize(void)\r\n{\r\n\treturn filesize;\r\n}\r\n\r\nvoid ChunkPatcher::setRequireUnchanged( bool b )\r\n{\r\n\trequire_unchanged=b;\r\n}\r\n<|endoftext|>"} {"text":"<commit_before>#define __STDC_FORMAT_MACROS\n\n#include <stdio.h>\n#include <iostream>\n#include <signal.h>\n#include <time.h>\n#include <fcntl.h>\n#include <sys\/stat.h>\n#include <algorithm>\n#include <unistd.h>\n#include <getopt.h>\n\nextern \"C\" {\n#include \"lua.h\"\n#include \"lualib.h\"\n#include \"lauxlib.h\"\n#include \"lpeg.h\"\n}\n\n#include <sinsp.h>\n#include <config_digwatch.h>\n#include \"rules.h\"\n#include \"formats.h\"\n#include \"fields.h\"\n#include \"syslog.h\"\n#include \"utils.h\"\n\nstatic bool g_terminate = false;\n\nstatic void signal_callback(int signal)\n{\n\tg_terminate = true;\n}\n\n\nstd::vector<string> valid_output_names {\"stdout\", \"syslog\"};\n\n\/\/\n\/\/ Program help\n\/\/\nstatic void usage()\n{\n printf(\n\t \"Usage: digwatch [options] rules_filename\\n\\n\"\n\t \"Options:\\n\"\n\t \" -h, --help Print this page\\n\"\n\t \" -o Output type (options are 'stdout', 'syslog', default is 'stdout')\\n\"\n\t \"\\n\"\n );\n}\n\nstring lua_on_event = \"on_event\";\n\n\/\/\n\/\/ Event processing loop\n\/\/\nvoid do_inspect(sinsp* inspector,\n\t\tdigwatch_rules* rules,\n\t\tstring output_name,\n\t\tlua_State* ls)\n{\n\tint32_t res;\n\tsinsp_evt* ev;\n\tstring line;\n\n\t\/\/\n\t\/\/ Loop through the events\n\t\/\/\n\twhile(1)\n\t{\n\n\t\tif(g_terminate)\n\t\t{\n\t\t\tbreak;\n\t\t}\n\n\t\tres = inspector->next(&ev);\n\n\t\tif(res == SCAP_TIMEOUT)\n\t\t{\n\t\t\tcontinue;\n\t\t}\n\t\telse if(res == SCAP_EOF)\n\t\t{\n\t\t\tbreak;\n\t\t}\n\t\telse if(res != SCAP_SUCCESS)\n\t\t{\n\t\t\t\/\/\n\t\t\t\/\/ Event read error.\n\t\t\t\/\/ Notify the chisels that we're exiting, and then die with an error.\n\t\t\t\/\/\n\t\t\tcerr << \"res = \" << res << endl;\n\t\t\tthrow sinsp_exception(inspector->getlasterr().c_str());\n\t\t}\n\n\t\tif(!inspector->is_debug_enabled() &&\n\t\t\tev->get_category() & EC_INTERNAL)\n\t\t{\n\t\t\tcontinue;\n\t\t}\n\n\t\tlua_getglobal(ls, lua_on_event.c_str());\n\n\t\tif(lua_isfunction(ls, -1))\n\t\t{\n\t\t\tlua_pushlightuserdata(ls, ev);\n\t\t\tlua_pushnumber(ls, ev->get_check_id());\n\t\t\tlua_pushstring(ls, output_name.c_str());\n\n\t\t\tif(lua_pcall(ls, 3, 0, 0) != 0)\n\t\t\t{\n\t\t\t\tconst char* lerr = lua_tostring(ls, -1);\n\t\t\t\tstring err = \"Error invoking function output: \" + string(lerr);\n\t\t\t\tthrow sinsp_exception(err);\n\t\t\t}\n\t\t}\n\t\telse\n\t\t{\n\t\t\tthrow sinsp_exception(\"No function \" + lua_on_event + \" found in lua compiler module\");\n\t\t}\n\t}\n}\n\nvoid add_lua_path(lua_State *ls, string path)\n{\n\tstring cpath = string(path);\n\tpath += \"?.lua\";\n\tcpath += \"?.so\";\n\n\tlua_getglobal(ls, \"package\");\n\n\tlua_getfield(ls, -1, \"path\");\n\tstring cur_path = lua_tostring(ls, -1 );\n\tcur_path += ';';\n\tlua_pop(ls, 1);\n\n\tcur_path.append(path.c_str());\n\n\tlua_pushstring(ls, cur_path.c_str());\n\tlua_setfield(ls, -2, \"path\");\n\n\tlua_getfield(ls, -1, \"cpath\");\n\tstring cur_cpath = lua_tostring(ls, -1 );\n\tcur_cpath += ';';\n\tlua_pop(ls, 1);\n\n\tcur_cpath.append(cpath.c_str());\n\n\tlua_pushstring(ls, cur_cpath.c_str());\n\tlua_setfield(ls, -2, \"cpath\");\n\n\tlua_pop(ls, 1);\n}\n\n\/\/\n\/\/ ARGUMENT PARSING AND PROGRAM SETUP\n\/\/\nint digwatch_init(int argc, char **argv)\n{\n\tint result = EXIT_SUCCESS;\n\tsinsp* inspector = NULL;\n\tdigwatch_rules* rules = NULL;\n\tint op;\n\tsinsp_evt::param_fmt event_buffer_format = sinsp_evt::PF_NORMAL;\n\tint long_index = 0;\n\tstring lua_main_filename;\n\tstring output_name = \"stdout\";\n\tstring lua_dir = DIGWATCH_LUA_DIR;\n\tlua_State* ls = NULL;\n\n\tstatic struct option long_options[] =\n\t{\n\t\t{\"help\", no_argument, 0, 'h' },\n\t\t{\"main-lua\", required_argument, 0, 'u' },\n\t\t{0, 0, 0, 0}\n\t};\n\n\ttry\n\t{\n\t\tinspector = new sinsp();\n\t\tbool valid;\n\n\t\t\/\/\n\t\t\/\/ Parse the args\n\t\t\/\/\n\t\twhile((op = getopt_long(argc, argv,\n \"ho:\",\n long_options, &long_index)) != -1)\n\t\t{\n\t\t\tswitch(op)\n\t\t\t{\n\t\t\tcase 'h':\n\t\t\t\tusage();\n\t\t\t\tgoto exit;\n\t\t\tcase 'o':\n\t\t\t\tvalid = std::find(valid_output_names.begin(), valid_output_names.end(), optarg) != valid_output_names.end();\n\t\t\t\tif (!valid)\n\t\t\t\t{\n\t\t\t\t\tthrow sinsp_exception(string(\"Invalid output name \") + optarg);\n\t\t\t\t}\n\t\t\t\toutput_name = optarg;\n\t\t\t\tbreak;\n\t\t\tcase '?':\n\t\t\t\tresult = EXIT_FAILURE;\n\t\t\t\tgoto exit;\n\t\t\tdefault:\n\t\t\t\tbreak;\n\t\t\t}\n\n\t\t}\n\n\t\tinspector->set_buffer_format(event_buffer_format);\n\n\t\tstring rules_file;\n\n\t\tif(optind < argc)\n\t\t{\n#ifdef HAS_FILTERING\n\t\t\tfor(int32_t j = optind ; j < argc; j++)\n\t\t\t{\n\t\t\t\trules_file += argv[j];\n\t\t\t\tif(j < argc - 1)\n\t\t\t\t{\n\t\t\t\t\trules_file += \" \";\n\t\t\t\t}\n\t\t\t}\n\n#else\n\t\t\tfprintf(stderr, \"filtering not compiled.\\n\");\n\t\t\tresult = EXIT_FAILURE;\n\t\t\tgoto exit;\n#endif\n\t\t}\n\n\t\tif(rules_file.size() == 0) {\n\t\t\tusage();\n\t\t\tresult = EXIT_FAILURE;\n\t\t\tgoto exit;\n\n\t\t}\n\n\t\tif(signal(SIGINT, signal_callback) == SIG_ERR)\n\t\t{\n\t\t\tfprintf(stderr, \"An error occurred while setting SIGINT signal handler.\\n\");\n\t\t\tresult = EXIT_FAILURE;\n\t\t\tgoto exit;\n\t\t}\n\n\t\tif(signal(SIGTERM, signal_callback) == SIG_ERR)\n\t\t{\n\t\t\tfprintf(stderr, \"An error occurred while setting SIGTERM signal handler.\\n\");\n\t\t\tresult = EXIT_FAILURE;\n\t\t\tgoto exit;\n\t\t}\n\n\t\tlua_main_filename = lua_dir + DIGWATCH_LUA_MAIN;\n\t\tif (!std::ifstream(lua_main_filename))\n\t\t{\n\t\t\tlua_dir = DIGWATCH_SOURCE_LUA_DIR;\n\t\t\tlua_main_filename = lua_dir + DIGWATCH_LUA_MAIN;\n\t\t\tif (!std::ifstream(lua_main_filename))\n\t\t\t{\n\t\t\t\tfprintf(stderr, \"Could not find Digwatch Lua libraries (tried %s, %s). \\n\",\n\t\t\t\t\tDIGWATCH_LUA_DIR DIGWATCH_LUA_MAIN,\n\t\t\t\t\tlua_main_filename.c_str());\n\t\t\t\tresult = EXIT_FAILURE;\n\t\t\t\tgoto exit;\n\t\t\t}\n\t\t}\n\n\n\t\t\/\/ Initialize Lua interpreter\n\t\tls = lua_open();\n\t\tluaL_openlibs(ls);\n\t\tluaopen_lpeg(ls);\n\t\tadd_lua_path(ls, lua_dir);\n\n\t\trules = new digwatch_rules(inspector, ls, lua_main_filename);\n\n\t\tdigwatch_formats::init(inspector, ls);\n\t\tdigwatch_fields::init(inspector, ls);\n\n\t\tdigwatch_syslog::init(ls);\n\n\t\trules->load_rules(rules_file);\n\t\tinspector->set_filter(rules->get_filter());\n\n\t\tinspector->set_hostname_and_port_resolution_mode(false);\n\n\t\ttry\n\t\t{\n\t\t\tinspector->open(\"\");\n\t\t}\n\t\tcatch(sinsp_exception e)\n\t\t{\n\t\t\tif(system(\"modprobe \" PROBE_NAME \" > \/dev\/null 2> \/dev\/null\"))\n\t\t\t{\n\t\t\t\tfprintf(stderr, \"Unable to load the driver\\n\");\n\t\t\t}\n\t\t\tinspector->open(\"\");\n\t\t}\n\n\t\tdo_inspect(inspector,\n\t\t\t rules,\n\t\t\t output_name,\n\t\t\t ls);\n\n\t\tinspector->close();\n\t}\n\tcatch(sinsp_exception& e)\n\t{\n\t\tcerr << e.what() << endl;\n\t\tresult = EXIT_FAILURE;\n\t}\n\tcatch(...)\n\t{\n\t\tprintf(\"Exception\\n\");\n\t\tresult = EXIT_FAILURE;\n\t}\n\nexit:\n\n\tif(inspector)\n\t{\n\t\tdelete inspector;\n\t}\n\n\tif(ls)\n\t{\n\t\tlua_close(ls);\n\t}\n\treturn result;\n}\n\n\/\/\n\/\/ MAIN\n\/\/\nint main(int argc, char **argv)\n{\n\treturn digwatch_init(argc, argv);\n}\n<commit_msg>Add support for reading .scap files<commit_after>#define __STDC_FORMAT_MACROS\n\n#include <stdio.h>\n#include <iostream>\n#include <signal.h>\n#include <time.h>\n#include <fcntl.h>\n#include <sys\/stat.h>\n#include <algorithm>\n#include <unistd.h>\n#include <getopt.h>\n\nextern \"C\" {\n#include \"lua.h\"\n#include \"lualib.h\"\n#include \"lauxlib.h\"\n#include \"lpeg.h\"\n}\n\n#include <sinsp.h>\n#include <config_digwatch.h>\n#include \"rules.h\"\n#include \"formats.h\"\n#include \"fields.h\"\n#include \"syslog.h\"\n#include \"utils.h\"\n\nstatic bool g_terminate = false;\n\nstatic void signal_callback(int signal)\n{\n\tg_terminate = true;\n}\n\n\nstd::vector<string> valid_output_names {\"stdout\", \"syslog\"};\n\n\/\/\n\/\/ Program help\n\/\/\nstatic void usage()\n{\n printf(\n\t \"Usage: digwatch [options] rules_filename\\n\\n\"\n\t \"Options:\\n\"\n\t \" -h, --help Print this page\\n\"\n\t \" -o Output type (options are 'stdout', 'syslog', default is 'stdout')\\n\"\n \" -r <readfile>, --read=<readfile>\\n\"\n \" Read the events from <readfile>.\\n\"\n\t \"\\n\"\n );\n}\n\nstring lua_on_event = \"on_event\";\n\n\/\/\n\/\/ Event processing loop\n\/\/\nvoid do_inspect(sinsp* inspector,\n\t\tdigwatch_rules* rules,\n\t\tstring output_name,\n\t\tlua_State* ls)\n{\n\tint32_t res;\n\tsinsp_evt* ev;\n\tstring line;\n\n\t\/\/\n\t\/\/ Loop through the events\n\t\/\/\n\twhile(1)\n\t{\n\n\t\tif(g_terminate)\n\t\t{\n\t\t\tbreak;\n\t\t}\n\n\t\tres = inspector->next(&ev);\n\n\t\tif(res == SCAP_TIMEOUT)\n\t\t{\n\t\t\tcontinue;\n\t\t}\n\t\telse if(res == SCAP_EOF)\n\t\t{\n\t\t\tbreak;\n\t\t}\n\t\telse if(res != SCAP_SUCCESS)\n\t\t{\n\t\t\t\/\/\n\t\t\t\/\/ Event read error.\n\t\t\t\/\/ Notify the chisels that we're exiting, and then die with an error.\n\t\t\t\/\/\n\t\t\tcerr << \"res = \" << res << endl;\n\t\t\tthrow sinsp_exception(inspector->getlasterr().c_str());\n\t\t}\n\n\t\tif(!inspector->is_debug_enabled() &&\n\t\t\tev->get_category() & EC_INTERNAL)\n\t\t{\n\t\t\tcontinue;\n\t\t}\n\n\t\tlua_getglobal(ls, lua_on_event.c_str());\n\n\t\tif(lua_isfunction(ls, -1))\n\t\t{\n\t\t\tlua_pushlightuserdata(ls, ev);\n\t\t\tlua_pushnumber(ls, ev->get_check_id());\n\t\t\tlua_pushstring(ls, output_name.c_str());\n\n\t\t\tif(lua_pcall(ls, 3, 0, 0) != 0)\n\t\t\t{\n\t\t\t\tconst char* lerr = lua_tostring(ls, -1);\n\t\t\t\tstring err = \"Error invoking function output: \" + string(lerr);\n\t\t\t\tthrow sinsp_exception(err);\n\t\t\t}\n\t\t}\n\t\telse\n\t\t{\n\t\t\tthrow sinsp_exception(\"No function \" + lua_on_event + \" found in lua compiler module\");\n\t\t}\n\t}\n}\n\nvoid add_lua_path(lua_State *ls, string path)\n{\n\tstring cpath = string(path);\n\tpath += \"?.lua\";\n\tcpath += \"?.so\";\n\n\tlua_getglobal(ls, \"package\");\n\n\tlua_getfield(ls, -1, \"path\");\n\tstring cur_path = lua_tostring(ls, -1 );\n\tcur_path += ';';\n\tlua_pop(ls, 1);\n\n\tcur_path.append(path.c_str());\n\n\tlua_pushstring(ls, cur_path.c_str());\n\tlua_setfield(ls, -2, \"path\");\n\n\tlua_getfield(ls, -1, \"cpath\");\n\tstring cur_cpath = lua_tostring(ls, -1 );\n\tcur_cpath += ';';\n\tlua_pop(ls, 1);\n\n\tcur_cpath.append(cpath.c_str());\n\n\tlua_pushstring(ls, cur_cpath.c_str());\n\tlua_setfield(ls, -2, \"cpath\");\n\n\tlua_pop(ls, 1);\n}\n\n\/\/\n\/\/ ARGUMENT PARSING AND PROGRAM SETUP\n\/\/\nint digwatch_init(int argc, char **argv)\n{\n\tint result = EXIT_SUCCESS;\n\tsinsp* inspector = NULL;\n\tdigwatch_rules* rules = NULL;\n\tint op;\n\tsinsp_evt::param_fmt event_buffer_format = sinsp_evt::PF_NORMAL;\n\tint long_index = 0;\n\tstring lua_main_filename;\n\tstring output_name = \"stdout\";\n\tstring infile;\n\tstring lua_dir = DIGWATCH_LUA_DIR;\n\tlua_State* ls = NULL;\n\n\tstatic struct option long_options[] =\n\t{\n\t\t{\"help\", no_argument, 0, 'h' },\n\t\t{\"readfile\", required_argument, 0, 'r' },\n\t\t{0, 0, 0, 0}\n\t};\n\n\ttry\n\t{\n\t\tinspector = new sinsp();\n\t\tbool valid;\n\n\t\t\/\/\n\t\t\/\/ Parse the args\n\t\t\/\/\n\t\twhile((op = getopt_long(argc, argv,\n \"ho:r:\",\n long_options, &long_index)) != -1)\n\t\t{\n\t\t\tswitch(op)\n\t\t\t{\n\t\t\tcase 'h':\n\t\t\t\tusage();\n\t\t\t\tgoto exit;\n\t\t\tcase 'o':\n\t\t\t\tvalid = std::find(valid_output_names.begin(), valid_output_names.end(), optarg) != valid_output_names.end();\n\t\t\t\tif (!valid)\n\t\t\t\t{\n\t\t\t\t\tthrow sinsp_exception(string(\"Invalid output name \") + optarg);\n\t\t\t\t}\n\t\t\t\toutput_name = optarg;\n\t\t\t\tbreak;\n\t\t\tcase 'r':\n\t\t\t\tinfile = optarg;\n\t\t\t\tbreak;\n\t\t\tcase '?':\n\t\t\t\tresult = EXIT_FAILURE;\n\t\t\t\tgoto exit;\n\t\t\tdefault:\n\t\t\t\tbreak;\n\t\t\t}\n\n\t\t}\n\n\t\tinspector->set_buffer_format(event_buffer_format);\n\n\t\tstring rules_file;\n\n\t\tif(optind < argc)\n\t\t{\n#ifdef HAS_FILTERING\n\t\t\tfor(int32_t j = optind ; j < argc; j++)\n\t\t\t{\n\t\t\t\trules_file += argv[j];\n\t\t\t\tif(j < argc - 1)\n\t\t\t\t{\n\t\t\t\t\trules_file += \" \";\n\t\t\t\t}\n\t\t\t}\n\n#else\n\t\t\tfprintf(stderr, \"filtering not compiled.\\n\");\n\t\t\tresult = EXIT_FAILURE;\n\t\t\tgoto exit;\n#endif\n\t\t}\n\n\t\tif(rules_file.size() == 0) {\n\t\t\tusage();\n\t\t\tresult = EXIT_FAILURE;\n\t\t\tgoto exit;\n\n\t\t}\n\n\t\tif(signal(SIGINT, signal_callback) == SIG_ERR)\n\t\t{\n\t\t\tfprintf(stderr, \"An error occurred while setting SIGINT signal handler.\\n\");\n\t\t\tresult = EXIT_FAILURE;\n\t\t\tgoto exit;\n\t\t}\n\n\t\tif(signal(SIGTERM, signal_callback) == SIG_ERR)\n\t\t{\n\t\t\tfprintf(stderr, \"An error occurred while setting SIGTERM signal handler.\\n\");\n\t\t\tresult = EXIT_FAILURE;\n\t\t\tgoto exit;\n\t\t}\n\n\t\tlua_main_filename = lua_dir + DIGWATCH_LUA_MAIN;\n\t\tif (!std::ifstream(lua_main_filename))\n\t\t{\n\t\t\tlua_dir = DIGWATCH_SOURCE_LUA_DIR;\n\t\t\tlua_main_filename = lua_dir + DIGWATCH_LUA_MAIN;\n\t\t\tif (!std::ifstream(lua_main_filename))\n\t\t\t{\n\t\t\t\tfprintf(stderr, \"Could not find Digwatch Lua libraries (tried %s, %s). \\n\",\n\t\t\t\t\tDIGWATCH_LUA_DIR DIGWATCH_LUA_MAIN,\n\t\t\t\t\tlua_main_filename.c_str());\n\t\t\t\tresult = EXIT_FAILURE;\n\t\t\t\tgoto exit;\n\t\t\t}\n\t\t}\n\n\n\t\t\/\/ Initialize Lua interpreter\n\t\tls = lua_open();\n\t\tluaL_openlibs(ls);\n\t\tluaopen_lpeg(ls);\n\t\tadd_lua_path(ls, lua_dir);\n\n\t\trules = new digwatch_rules(inspector, ls, lua_main_filename);\n\n\t\tdigwatch_formats::init(inspector, ls);\n\t\tdigwatch_fields::init(inspector, ls);\n\n\t\tdigwatch_syslog::init(ls);\n\n\t\trules->load_rules(rules_file);\n\t\tinspector->set_filter(rules->get_filter());\n\n\t\tinspector->set_hostname_and_port_resolution_mode(false);\n\n\t\tif (infile.size())\n\t\t{\n\t\t\tinspector->open(infile);\n\t\t}\n\t\telse\n\t\t{\n\t\t\ttry\n\t\t\t{\n\t\t\t\tinspector->open();\n\t\t\t}\n\t\t\tcatch(sinsp_exception e)\n\t\t\t{\n\t\t\t\tif(system(\"modprobe \" PROBE_NAME \" > \/dev\/null 2> \/dev\/null\"))\n\t\t\t\t{\n\t\t\t\t\tfprintf(stderr, \"Unable to load the driver\\n\");\n\t\t\t\t}\n\t\t\t\tinspector->open();\n\t\t\t}\n\t\t}\n\t\tdo_inspect(inspector,\n\t\t\t rules,\n\t\t\t output_name,\n\t\t\t ls);\n\n\t\tinspector->close();\n\t}\n\tcatch(sinsp_exception& e)\n\t{\n\t\tcerr << e.what() << endl;\n\t\tresult = EXIT_FAILURE;\n\t}\n\tcatch(...)\n\t{\n\t\tprintf(\"Exception\\n\");\n\t\tresult = EXIT_FAILURE;\n\t}\n\nexit:\n\n\tif(inspector)\n\t{\n\t\tdelete inspector;\n\t}\n\n\tif(ls)\n\t{\n\t\tlua_close(ls);\n\t}\n\treturn result;\n}\n\n\/\/\n\/\/ MAIN\n\/\/\nint main(int argc, char **argv)\n{\n\treturn digwatch_init(argc, argv);\n}\n<|endoftext|>"} {"text":"<commit_before>\/\/ Copyright 2004-present Facebook. All Rights Reserved.\n\n#include <string>\n#include <fstream>\n#include <streambuf>\n#include <sstream>\n#include <map>\n\n#include <stdlib.h>\n#include <unistd.h>\n#include <sys\/stat.h>\n#include <proc\/readproc.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\n#ifdef PROC_EDITCMDLCVT\n\/\/\/ EDITCMDLCVT is available in libprocps3-dev\n#define PROC_SELECTS \\\n PROC_FILLCOM | PROC_EDITCMDLCVT | PROC_FILLMEM | PROC_FILLSTATUS | \\\n PROC_FILLSTAT\n#else\n#define PROC_SELECTS \\\n PROC_FILLCOM | PROC_FILLMEM | PROC_FILLSTATUS | PROC_FILLSTAT\n#endif\n\nstd::string proc_name(const proc_t* proc_info) {\n char cmd[17]; \/\/ cmd is a 16 char buffer\n\n memset(cmd, 0, 17);\n memcpy(cmd, proc_info->cmd, 16);\n return std::string(cmd);\n}\n\nstd::string proc_attr(const std::string& attr, const proc_t* proc_info) {\n std::stringstream filename;\n\n filename << \"\/proc\/\" << proc_info->tid << \"\/\" << attr;\n return filename.str();\n}\n\nstd::string proc_cmdline(const proc_t* proc_info) {\n std::string attr;\n std::string result;\n\n attr = proc_attr(\"cmdline\", proc_info);\n std::ifstream fd(attr, std::ios::in | std::ios::binary);\n if (fd) {\n result = std::string(std::istreambuf_iterator<char>(fd),\n std::istreambuf_iterator<char>());\n }\n\n return result;\n}\n\nstd::string proc_link(const proc_t* proc_info) {\n std::string attr;\n std::string result;\n char* link_path;\n long path_max;\n int bytes;\n\n \/\/ The exe is a symlink to the binary on-disk.\n attr = proc_attr(\"exe\", proc_info);\n path_max = pathconf(attr.c_str(), _PC_PATH_MAX);\n link_path = (char*)malloc(path_max);\n\n memset(link_path, 0, path_max);\n bytes = readlink(attr.c_str(), link_path, path_max);\n if (bytes >= 0) {\n result = std::string(link_path);\n }\n\n free(link_path);\n return result;\n}\n\nstd::map<std::string, std::string> proc_env(const proc_t* proc_info) {\n std::map<std::string, std::string> env;\n std::string attr = osquery::tables::proc_attr(\"environ\", proc_info);\n std::string buf;\n\n uid_t euid = geteuid();\n struct stat info;\n if (stat(filename, &info) == -1) {\n return env;\n }\n\n if (euid != 0 && info.st_uid != euid) {\n return env;\n }\n\n std::ifstream fd(attr, std::ios::in | std::ios::binary);\n\n while (!fd.eof()) {\n std::getline(fd, buf, '\\0');\n size_t idx = buf.find_first_of(\"=\");\n\n std::string key = buf.substr(0, idx);\n std::string value = buf.substr(idx + 1);\n\n env[key] = value;\n }\n return env;\n}\n\n\/**\n * @brief deallocate the space allocated by readproc if the passed rbuf was NULL\n *\n * @param p The rbuf to free\n *\/\nvoid standard_freeproc(proc_t* p) {\n if (!p) { \/\/ in case p is NULL\n return;\n }\n \/\/ ptrs are after strings to avoid copying memory when building them.\n \/\/ so free is called on the address of the address of strvec[0].\n if (p->cmdline) {\n free((void*)*p->cmdline);\n }\n if (p->environ) {\n free((void*)*p->environ);\n }\n free(p);\n}\n\nQueryData genProcesses() {\n QueryData results;\n\n proc_t* proc_info;\n PROCTAB* proc = openproc(PROC_SELECTS);\n\n \/\/ Populate proc struc for each process.\n while ((proc_info = readproc(proc, NULL))) {\n Row r;\n\n r[\"pid\"] = boost::lexical_cast<std::string>(proc_info->tid);\n r[\"name\"] = proc_name(proc_info);\n r[\"cmdline\"] = proc_cmdline(proc_info);\n r[\"path\"] = proc_link(proc_info);\n r[\"on_disk\"] = osquery::pathExists(r[\"path\"]).toString();\n\n r[\"resident_size\"] = boost::lexical_cast<std::string>(proc_info->vm_rss);\n r[\"phys_footprint\"] = boost::lexical_cast<std::string>(proc_info->vm_size);\n r[\"user_time\"] = boost::lexical_cast<std::string>(proc_info->utime);\n r[\"system_time\"] = boost::lexical_cast<std::string>(proc_info->stime);\n r[\"start_time\"] = boost::lexical_cast<std::string>(proc_info->start_time);\n r[\"parent\"] = boost::lexical_cast<std::string>(proc_info->ppid);\n\n results.push_back(r);\n standard_freeproc(proc_info);\n }\n\n closeproc(proc);\n\n return results;\n}\n\nQueryData genProcessEnvs() {\n QueryData results;\n\n proc_t* proc_info;\n PROCTAB* proc = openproc(PROC_SELECTS);\n\n \/\/ Populate proc struc for each process.\n\n while ((proc_info = readproc(proc, NULL))) {\n auto env = proc_env(proc_info);\n for (auto itr = env.begin(); itr != env.end(); ++itr) {\n Row r;\n r[\"pid\"] = boost::lexical_cast<std::string>(proc_info->tid);\n r[\"name\"] = proc_name(proc_info);\n r[\"path\"] = proc_link(proc_info);\n r[\"key\"] = itr->first;\n r[\"value\"] = itr->second;\n results.push_back(r);\n }\n\n standard_freeproc(proc_info);\n }\n\n closeproc(proc);\n\n return results;\n}\n\nQueryData genProcessOpenFiles() {\n QueryData results;\n return results;\n}\n}\n}\n<commit_msg>Add note about blocking process_env as non-su<commit_after>\/\/ Copyright 2004-present Facebook. All Rights Reserved.\n\n#include <string>\n#include <fstream>\n#include <streambuf>\n#include <sstream>\n#include <map>\n\n#include <stdlib.h>\n#include <unistd.h>\n#include <sys\/stat.h>\n#include <proc\/readproc.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\n#ifdef PROC_EDITCMDLCVT\n\/\/\/ EDITCMDLCVT is available in libprocps3-dev\n#define PROC_SELECTS \\\n PROC_FILLCOM | PROC_EDITCMDLCVT | PROC_FILLMEM | PROC_FILLSTATUS | \\\n PROC_FILLSTAT\n#else\n#define PROC_SELECTS \\\n PROC_FILLCOM | PROC_FILLMEM | PROC_FILLSTATUS | PROC_FILLSTAT\n#endif\n\nstd::string proc_name(const proc_t* proc_info) {\n char cmd[17]; \/\/ cmd is a 16 char buffer\n\n memset(cmd, 0, 17);\n memcpy(cmd, proc_info->cmd, 16);\n return std::string(cmd);\n}\n\nstd::string proc_attr(const std::string& attr, const proc_t* proc_info) {\n std::stringstream filename;\n\n filename << \"\/proc\/\" << proc_info->tid << \"\/\" << attr;\n return filename.str();\n}\n\nstd::string proc_cmdline(const proc_t* proc_info) {\n std::string attr;\n std::string result;\n\n attr = proc_attr(\"cmdline\", proc_info);\n std::ifstream fd(attr, std::ios::in | std::ios::binary);\n if (fd) {\n result = std::string(std::istreambuf_iterator<char>(fd),\n std::istreambuf_iterator<char>());\n }\n\n return result;\n}\n\nstd::string proc_link(const proc_t* proc_info) {\n std::string attr;\n std::string result;\n char* link_path;\n long path_max;\n int bytes;\n\n \/\/ The exe is a symlink to the binary on-disk.\n attr = proc_attr(\"exe\", proc_info);\n path_max = pathconf(attr.c_str(), _PC_PATH_MAX);\n link_path = (char*)malloc(path_max);\n\n memset(link_path, 0, path_max);\n bytes = readlink(attr.c_str(), link_path, path_max);\n if (bytes >= 0) {\n result = std::string(link_path);\n }\n\n free(link_path);\n return result;\n}\n\nstd::map<std::string, std::string> proc_env(const proc_t* proc_info) {\n std::map<std::string, std::string> env;\n std::string attr = osquery::tables::proc_attr(\"environ\", proc_info);\n std::string buf;\n\n uid_t euid = geteuid();\n struct stat info;\n if (stat(filename, &info) == -1) {\n return env;\n }\n\n \/\/ Avoid a non-su block: https:\/\/github.com\/facebook\/osquery\/issues\/323\n if (euid != 0 && info.st_uid != euid) {\n return env;\n }\n\n std::ifstream fd(attr, std::ios::in | std::ios::binary);\n\n while (!fd.eof()) {\n std::getline(fd, buf, '\\0');\n size_t idx = buf.find_first_of(\"=\");\n\n std::string key = buf.substr(0, idx);\n std::string value = buf.substr(idx + 1);\n\n env[key] = value;\n }\n return env;\n}\n\n\/**\n * @brief deallocate the space allocated by readproc if the passed rbuf was NULL\n *\n * @param p The rbuf to free\n *\/\nvoid standard_freeproc(proc_t* p) {\n if (!p) { \/\/ in case p is NULL\n return;\n }\n \/\/ ptrs are after strings to avoid copying memory when building them.\n \/\/ so free is called on the address of the address of strvec[0].\n if (p->cmdline) {\n free((void*)*p->cmdline);\n }\n if (p->environ) {\n free((void*)*p->environ);\n }\n free(p);\n}\n\nQueryData genProcesses() {\n QueryData results;\n\n proc_t* proc_info;\n PROCTAB* proc = openproc(PROC_SELECTS);\n\n \/\/ Populate proc struc for each process.\n while ((proc_info = readproc(proc, NULL))) {\n Row r;\n\n r[\"pid\"] = boost::lexical_cast<std::string>(proc_info->tid);\n r[\"name\"] = proc_name(proc_info);\n r[\"cmdline\"] = proc_cmdline(proc_info);\n r[\"path\"] = proc_link(proc_info);\n r[\"on_disk\"] = osquery::pathExists(r[\"path\"]).toString();\n\n r[\"resident_size\"] = boost::lexical_cast<std::string>(proc_info->vm_rss);\n r[\"phys_footprint\"] = boost::lexical_cast<std::string>(proc_info->vm_size);\n r[\"user_time\"] = boost::lexical_cast<std::string>(proc_info->utime);\n r[\"system_time\"] = boost::lexical_cast<std::string>(proc_info->stime);\n r[\"start_time\"] = boost::lexical_cast<std::string>(proc_info->start_time);\n r[\"parent\"] = boost::lexical_cast<std::string>(proc_info->ppid);\n\n results.push_back(r);\n standard_freeproc(proc_info);\n }\n\n closeproc(proc);\n\n return results;\n}\n\nQueryData genProcessEnvs() {\n QueryData results;\n\n proc_t* proc_info;\n PROCTAB* proc = openproc(PROC_SELECTS);\n\n \/\/ Populate proc struc for each process.\n\n while ((proc_info = readproc(proc, NULL))) {\n auto env = proc_env(proc_info);\n for (auto itr = env.begin(); itr != env.end(); ++itr) {\n Row r;\n r[\"pid\"] = boost::lexical_cast<std::string>(proc_info->tid);\n r[\"name\"] = proc_name(proc_info);\n r[\"path\"] = proc_link(proc_info);\n r[\"key\"] = itr->first;\n r[\"value\"] = itr->second;\n results.push_back(r);\n }\n\n standard_freeproc(proc_info);\n }\n\n closeproc(proc);\n\n return results;\n}\n\nQueryData genProcessOpenFiles() {\n QueryData results;\n return results;\n}\n}\n}\n<|endoftext|>"} {"text":"<commit_before>#ifndef TIME_UTILS_HPP_INCLUDED\r\n#define TIME_UTILS_HPP_INCLUDED\r\n\r\n\/**\r\n @file time_utils.hpp\r\n @author François Becker\r\n \r\nMIT License\r\n\r\nCopyright (c) 2015-2017 François Becker\r\n\r\nPermission is hereby granted, free of charge, to any person obtaining a copy\r\nof this software and associated documentation files (the \"Software\"), to deal\r\nin the Software without restriction, including without limitation the rights\r\nto use, copy, modify, merge, publish, distribute, sublicense, and\/or sell\r\ncopies of the Software, and to permit persons to whom the Software is\r\nfurnished to do so, subject to the following conditions:\r\n\r\nThe above copyright notice and this permission notice shall be included in all\r\ncopies or substantial portions of the Software.\r\n\r\nTHE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\r\nIMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\r\nFITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE\r\nAUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\r\nLIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,\r\nOUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE\r\nSOFTWARE.\r\n*\/\r\n\r\n#include <cassert>\r\n#include <ctime>\r\n\r\nnamespace tu\r\n{\r\n inline std::time_t timeFromYMDString(const char* pString)\r\n {\r\n \/\/ Time from YYYY-MM-DD\r\n int lYear, lMonth, lDay;\r\n sscanf(pString, \"%d-%d-%d\", &lYear, &lMonth, &lDay);\r\n struct tm t = {0};\r\n t.tm_year = lYear - 1900;\r\n t.tm_mon = lMonth - 1;\r\n t.tm_mday = lDay;\r\n t.tm_isdst = -1;\r\n return mktime(&t);\r\n }\r\n \r\n inline std::time_t timeFromYMDHMSString(const char* pString)\r\n {\r\n \/\/ Time from YYYY-mm-DD HH:MM:SS\r\n int lYear, lMonth, lDay, lHour, lMinute, lSecond;\r\n sscanf(pString, \"%d-%d-%d %d:%d:%d\", &lYear, &lMonth, &lDay, &lHour, &lMinute, &lSecond);\r\n struct tm t = {0};\r\n t.tm_year = lYear - 1900;\r\n t.tm_mon = lMonth - 1;\r\n t.tm_mday = lDay;\r\n t.tm_hour = lHour;\r\n t.tm_min = lMinute;\r\n t.tm_sec = lSecond;\r\n t.tm_isdst = -1;\r\n return mktime(&t);\r\n }\r\n \r\n inline std::time_t timeFromStringDate(const char *time)\r\n {\r\n char s_month[5];\r\n int month, day, year;\r\n struct tm t = {0};\r\n static const char month_names[] = \"JanFebMarAprMayJunJulAugSepOctNovDec\";\r\n \r\n sscanf(time, \"%s %d %d\", s_month, &day, &year);\r\n \r\n month = (int)(strstr(month_names, s_month)-month_names)\/3;\r\n \r\n t.tm_mon = month;\r\n t.tm_mday = day;\r\n t.tm_year = year - 1900;\r\n t.tm_isdst = -1;\r\n \r\n return mktime(&t);\r\n }\r\n}\r\n\r\n#endif\r\n<commit_msg>time_utils.hpp: fixed missing includes<commit_after>#ifndef TIME_UTILS_HPP_INCLUDED\r\n#define TIME_UTILS_HPP_INCLUDED\r\n\r\n\/**\r\n @file time_utils.hpp\r\n @author François Becker\r\n \r\nMIT License\r\n\r\nCopyright (c) 2015-2017 François Becker\r\n\r\nPermission is hereby granted, free of charge, to any person obtaining a copy\r\nof this software and associated documentation files (the \"Software\"), to deal\r\nin the Software without restriction, including without limitation the rights\r\nto use, copy, modify, merge, publish, distribute, sublicense, and\/or sell\r\ncopies of the Software, and to permit persons to whom the Software is\r\nfurnished to do so, subject to the following conditions:\r\n\r\nThe above copyright notice and this permission notice shall be included in all\r\ncopies or substantial portions of the Software.\r\n\r\nTHE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\r\nIMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\r\nFITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE\r\nAUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\r\nLIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,\r\nOUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE\r\nSOFTWARE.\r\n*\/\r\n\r\n#include <ctime>\n#include <cstdio>\n#include <cstring>\n#include <cassert>\r\n\r\nnamespace tu\r\n{\r\n inline std::time_t timeFromYMDString(const char* pString)\r\n {\r\n \/\/ Time from YYYY-MM-DD\r\n int lYear, lMonth, lDay;\r\n sscanf(pString, \"%d-%d-%d\", &lYear, &lMonth, &lDay);\r\n struct tm t = {0};\r\n t.tm_year = lYear - 1900;\r\n t.tm_mon = lMonth - 1;\r\n t.tm_mday = lDay;\r\n t.tm_isdst = -1;\r\n return mktime(&t);\r\n }\r\n \r\n inline std::time_t timeFromYMDHMSString(const char* pString)\r\n {\r\n \/\/ Time from YYYY-mm-DD HH:MM:SS\r\n int lYear, lMonth, lDay, lHour, lMinute, lSecond;\r\n sscanf(pString, \"%d-%d-%d %d:%d:%d\", &lYear, &lMonth, &lDay, &lHour, &lMinute, &lSecond);\r\n struct tm t = {0};\r\n t.tm_year = lYear - 1900;\r\n t.tm_mon = lMonth - 1;\r\n t.tm_mday = lDay;\r\n t.tm_hour = lHour;\r\n t.tm_min = lMinute;\r\n t.tm_sec = lSecond;\r\n t.tm_isdst = -1;\r\n return mktime(&t);\r\n }\r\n \r\n inline std::time_t timeFromStringDate(const char *time)\r\n {\r\n char s_month[5];\r\n int month, day, year;\r\n struct tm t = {0};\r\n static const char month_names[] = \"JanFebMarAprMayJunJulAugSepOctNovDec\";\r\n \r\n sscanf(time, \"%s %d %d\", s_month, &day, &year);\r\n \r\n month = (int)(strstr(month_names, s_month)-month_names)\/3;\r\n \r\n t.tm_mon = month;\r\n t.tm_mday = day;\r\n t.tm_year = year - 1900;\r\n t.tm_isdst = -1;\r\n \r\n return mktime(&t);\r\n }\r\n}\r\n\r\n#endif\r\n<|endoftext|>"} {"text":"<commit_before>\/\/ Copyright (C) 2017 Elviss Strazdins\n\/\/ This file is part of the Ouzel engine.\n\n#include <X11\/cursorfont.h>\n#include <X11\/Xcursor\/Xcursor.h>\n#include \"CursorResourceLinux.h\"\n#include \"core\/Engine.h\"\n#include \"core\/linux\/WindowLinux.h\"\n#include \"utils\/Log.h\"\n\nnamespace ouzel\n{\n namespace input\n {\n CursorResourceLinux::~CursorResourceLinux()\n {\n if (sharedEngine)\n {\n WindowLinux* windowLinux = static_cast<WindowLinux*>(sharedEngine->getWindow());\n Display* display = windowLinux->getDisplay();\n if (cursor != None) XFreeCursor(display, cursor);\n }\n }\n\n bool CursorResourceLinux::upload()\n {\n std::lock_guard<std::mutex> lock(uploadMutex);\n\n if (dirty)\n {\n if (sharedEngine)\n {\n WindowLinux* windowLinux = static_cast<WindowLinux*>(sharedEngine->getWindow());\n Display* display = windowLinux->getDisplay();\n\n if (cursor != None)\n {\n XFreeCursor(display, cursor);\n cursor = None;\n }\n\n if (data.empty())\n {\n switch (systemCursor)\n {\n case SystemCursor::DEFAULT:\n cursor = XcursorLibraryLoadCursor(display, \"arrow\");\n break;\n case SystemCursor::ARROW:\n cursor = XcursorLibraryLoadCursor(display, \"arrow\");\n break;\n case SystemCursor::HAND:\n cursor = XcursorLibraryLoadCursor(display, \"hand1\");\n break;\n case SystemCursor::HORIZONTAL_RESIZE:\n cursor = XcursorLibraryLoadCursor(display, \"sb_h_double_arrow\");\n break;\n case SystemCursor::VERTICAL_RESIZE:\n cursor = XcursorLibraryLoadCursor(display, \"sb_v_double_arrow\");\n break;\n case SystemCursor::CROSS:\n cursor = XcursorLibraryLoadCursor(display, \"crosshair\");\n break;\n case SystemCursor::I_BEAM:\n cursor = XcursorLibraryLoadCursor(display, \"xterm\");\n break;\n }\n }\n else\n {\n int width = static_cast<int>(size.v[0]);\n int height = static_cast<int>(size.v[1]);\n\n XcursorImage* cursorImage = XcursorImageCreate(width, height);\n\n if (!cursorImage)\n {\n Log(Log::Level::ERR) << \"Failed to create cursor image\";\n return false;\n }\n\n cursorImage->xhot = static_cast<int>(hotSpot.v[0]);\n cursorImage->yhot = height - static_cast<int>(hotSpot.v[1]) - 1;\n cursorImage->delay = 0;\n\n for (int i = 0; i < width * height; i++)\n {\n cursorImage->pixels[i * 4 + 0] = data[i * 4 + 2];\n cursorImage->pixels[i * 4 + 1] = data[i * 4 + 1];\n cursorImage->pixels[i * 4 + 2] = data[i * 4 + 0];\n cursorImage->pixels[i * 4 + 3] = data[i * 4 + 3];\n }\n\n cursor = X11_XcursorImageLoadCursor(display, cursorImage);\n\n X11_XcursorImageDestroy(cursorImage);\n }\n }\n\n dirty = false;\n }\n\n return true;\n }\n } \/\/ namespace input\n} \/\/ namespace ouzel\n<commit_msg>Fix typo<commit_after>\/\/ Copyright (C) 2017 Elviss Strazdins\n\/\/ This file is part of the Ouzel engine.\n\n#include <X11\/cursorfont.h>\n#include <X11\/Xcursor\/Xcursor.h>\n#include \"CursorResourceLinux.h\"\n#include \"core\/Engine.h\"\n#include \"core\/linux\/WindowLinux.h\"\n#include \"utils\/Log.h\"\n\nnamespace ouzel\n{\n namespace input\n {\n CursorResourceLinux::~CursorResourceLinux()\n {\n if (sharedEngine)\n {\n WindowLinux* windowLinux = static_cast<WindowLinux*>(sharedEngine->getWindow());\n Display* display = windowLinux->getDisplay();\n if (cursor != None) XFreeCursor(display, cursor);\n }\n }\n\n bool CursorResourceLinux::upload()\n {\n std::lock_guard<std::mutex> lock(uploadMutex);\n\n if (dirty)\n {\n if (sharedEngine)\n {\n WindowLinux* windowLinux = static_cast<WindowLinux*>(sharedEngine->getWindow());\n Display* display = windowLinux->getDisplay();\n\n if (cursor != None)\n {\n XFreeCursor(display, cursor);\n cursor = None;\n }\n\n if (data.empty())\n {\n switch (systemCursor)\n {\n case SystemCursor::DEFAULT:\n cursor = XcursorLibraryLoadCursor(display, \"arrow\");\n break;\n case SystemCursor::ARROW:\n cursor = XcursorLibraryLoadCursor(display, \"arrow\");\n break;\n case SystemCursor::HAND:\n cursor = XcursorLibraryLoadCursor(display, \"hand1\");\n break;\n case SystemCursor::HORIZONTAL_RESIZE:\n cursor = XcursorLibraryLoadCursor(display, \"sb_h_double_arrow\");\n break;\n case SystemCursor::VERTICAL_RESIZE:\n cursor = XcursorLibraryLoadCursor(display, \"sb_v_double_arrow\");\n break;\n case SystemCursor::CROSS:\n cursor = XcursorLibraryLoadCursor(display, \"crosshair\");\n break;\n case SystemCursor::I_BEAM:\n cursor = XcursorLibraryLoadCursor(display, \"xterm\");\n break;\n }\n }\n else\n {\n int width = static_cast<int>(size.v[0]);\n int height = static_cast<int>(size.v[1]);\n\n XcursorImage* cursorImage = XcursorImageCreate(width, height);\n\n if (!cursorImage)\n {\n Log(Log::Level::ERR) << \"Failed to create cursor image\";\n return false;\n }\n\n cursorImage->xhot = static_cast<int>(hotSpot.v[0]);\n cursorImage->yhot = height - static_cast<int>(hotSpot.v[1]) - 1;\n cursorImage->delay = 0;\n\n for (int i = 0; i < width * height; i++)\n {\n cursorImage->pixels[i * 4 + 0] = data[i * 4 + 2];\n cursorImage->pixels[i * 4 + 1] = data[i * 4 + 1];\n cursorImage->pixels[i * 4 + 2] = data[i * 4 + 0];\n cursorImage->pixels[i * 4 + 3] = data[i * 4 + 3];\n }\n\n cursor = XcursorImageLoadCursor(display, cursorImage);\n\n XcursorImageDestroy(cursorImage);\n }\n }\n\n dirty = false;\n }\n\n return true;\n }\n } \/\/ namespace input\n} \/\/ namespace ouzel\n<|endoftext|>"} {"text":"<commit_before>#include <iostream>\n#include <string>\n#include <regex>\n\ndouble interceptXAxis(double m, double c) {\n \/\/\/\n \/\/\/ A function to calculate the intercept on the x-axis of a straight line\n \/\/\/ \n return c\/m;\n}\n\nint main(int argc, char *argv[])\n{\n \/\/ string to decide what to do\n \/\/ TODO make it 'human' so that the user could type (e.g.)\n \/\/ > Please can I find out the intercept of a straight line on the x-axis\n \/\/ and the program knows what to do (by matching 'intercept' and 'x-axis')\n std::string decision;\n \n std::cout << \"Hello World\" << std::endl;\n\n std::cout << \"Welcome to PP6Calculator (reborn). \"\n\t << \"Please specify which function you would like to perform: \"\n\t << std::endl\n\t << \"> \";\n std::cin >> decision;\n if(std::regex_match(decision, std::regex(\"(^i$)|(intercept)\")))\n {\n std::cout << \"You have chosen the intercept function!\" << std::endl;\n }\np\n std::cout << \"You chose \" << decision << std::endl;\n std::cout << \"Sorry, I'm not yet complete enough to give you what you want.\"\n\t << std::endl\n\t << \"Goodbye! I hope to see you again soon!\"\n\t << std::endl;\n \n return 0;\n}\n<commit_msg>Added quadratic solver function to program<commit_after>#include <iostream>\n#include <string>\n#include <regex>\n\/\/ #include <cmath>\n#include <complex>\n\ndouble interceptXAxis(double m, double c) {\n \/\/\/\n \/\/\/ A function to calculate the intercept on the x-axis of a straight line\n \/\/\/ \n return c\/m;\n}\n\nstruct quadraticRoots\n{\n std::complex<double> root1,root2; \n};\n\nstd::ostream& operator<<(std::ostream& s, const quadraticRoots& c)\n{\n \/\/\/\n \/\/\/ Be smart about what to print when it comes to roots of quadratic equations\n \/\/\/ \n if(c.root1 == c.root2 && c.root1.imag() != 0)\n s << c.root1 << \" (repeated root)\";\n else if(c.root1 == c.root2 && c.root1.imag() == 0)\n s << c.root1.real() << \" (repeated root)\";\n else if(c.root1.imag() == 0 || c.root2.imag() == 0)\n s << c.root1.real() << \" and \" << c.root2.real();\n else \t\t\t\t\/\/ all that's left is root1, root2 are complex\n s << c.root1 << \" and \" << c.root2;\n return s;\n}\n\nquadraticRoots quadraticSolver(double aReal, double bReal, double cReal)\n{\n quadraticRoots roots = quadraticRoots();\n roots.root1 = std::complex<double>(0,0);\n roots.root2 = std::complex<double>(0,0);\n\n std::complex<double> a = aReal;\n std::complex<double> b = bReal;\n std::complex<double> c = cReal;\n\n if((b*b - 4.0*a*c) == std::complex<double>(0,0))\n {\n roots.root1 = (-b)\/(2.0*a);\n roots.root2 = roots.root1;\n }\n else\n {\n roots.root1 = (-b+sqrt(b*b-4.0*a*c))\/(2.0*a);\n roots.root2 = (-b-sqrt(b*b-4.0*a*c))\/(2.0*a);\n }\n return roots;\n}\n\nvoid coutChosen(std::string x)\n{\n \/\/\/\n \/\/\/ Function to cout \"You have chosen the [x] function\"\n \/\/\/ \n std::cout << \"You have chosen the \" << x << \" function!\" << std::endl;\n}\n\nint main(int argc, char *argv[])\n{\n \/\/ string to decide what to do\n \/\/ TODO make it 'human' so that the user could type (e.g.)\n \/\/ > Please can I find out the intercept of a straight line on the x-axis\n \/\/ and the program knows what to do (by matching 'intercept' and 'x-axis')\n std::string decision;\n \n std::cout << \"Hello World\" << std::endl;\n\n std::cout << \"Welcome to PP6Calculator (reborn). \"\n\t << \"Please specify which function you would like to perform: \"\n\t << std::endl\n\t << \"> \";\n \n std::getline(std::cin,decision);\n \n if(std::regex_match(decision, std::regex(\"(^i$)|(.*intercept.*)\")))\n {\n \/\/ initialise variables for y=mx+c\n double m,c;\n \n coutChosen(\"intercept\");\n std::cout << \"Please specify a gradient (m): \";\n std::cin >> m;\n std::cout << \"Please specify an intercept (c): \" << std::endl;\n std::cin >> c;\n std::cout << \"The x intercept for the line y = \" << m << \"x + \" << c\n\t\t<< \" is \" << interceptXAxis(m,c) << \".\" << std::endl;\n }\n else if(std::regex_match(decision, std::regex(\"(^q$)|(.*quadratic.*)\")))\n {\n \/\/ Initialise variables for (-b±√(b^2 - 4ac))\/(2a)\n double a, b, c;\n\n coutChosen(\"quadratic solver\");\n std::cout << \"Choose the x^2 term (a): \" << std::endl << \"> \";\n std::cin >> a;\n std::cout << \"Choose the x term (b): \" << std::endl << \"> \";\n std::cin >> b;\n std::cout << \"Choose the constant term (c): \" << std::endl << \"> \";\n std::cin >> c;\n\n std::cout << \"The roots for your chosen quadratic are \"\n\t\t<< quadraticSolver(a,b,c) << std::endl;\n }\n else\n {\n std::cout << \"You chose \" << decision << std::endl;\n std::cout << \"Sorry, I'm not yet complete enough to give you what you want.\"\n\t\t<< std::endl;\n }\n return 0;\n}\n<|endoftext|>"} {"text":"<commit_before>#include <iostream>\n#include <string>\n#include <iomanip>\n#include <stack>\n#include <limits>\n#include <algorithm>\n#include <cmath>\n#include <cstdint>\n#include <cassert>\n\n#include \"matrix.h\"\n\n#ifdef DEBUG\n #define LOG(x) std::cerr << x\n#else\n #define LOG(x)\n#endif\n\nusing namespace std;\n\n\/\/ Largest neighborhood to explore during 2-opt.\nconst size_t TWOOPT_MAX_NEIGHBORS = 100;\n\n\/\/ Output stream operator (convenient for printing tours).\nostream& operator<<(ostream& os, const vector<size_t>& v) {\n for (auto e : v)\n os << e << ' ';\n os << endl;\n return os;\n}\n\n\/**\n * Create a distance matrix from an input stream and return it.\n *\n * @param in Input stream.\n * @return The read distance matrix.\n *\/\nMatrix<uint32_t> createDistanceMatrix(istream& in) {\n \/\/ Read vertex coordinates.\n size_t N;\n in >> N;\n vector<double> x(N);\n vector<double> y(N);\n for (size_t i = 0; i < N; ++i) {\n in >> x[i] >> y[i];\n }\n\n \/\/ Calculate distance matrix.\n Matrix<uint32_t> d(N, N);\n for (size_t i = 0; i < N; ++i) {\n for (size_t j = i + 1; j < N; ++j) {\n d[i][j] = d[j][i] = round(sqrt(pow(x[i]-x[j], 2) + pow(y[i]-y[j], 2)));\n }\n }\n\n return d;\n}\n\n\/**\n * Calculate minimum spanning tree using Prim's algorithm.\n *\n * @param d Distance matrix.\n * @return The minimum spanning tree.\n *\/\nMatrix<uint32_t> primMST(const Matrix<uint32_t>& d) {\n size_t N = d.rows();\n\n vector<bool> inMST(N);\n vector<uint32_t> cost(N);\n vector<uint32_t> parent(N);\n fill(inMST.begin(), inMST.end(), false);\n fill(cost.begin(), cost.end(), numeric_limits<uint32_t>::max());\n cost[0] = 0;\n\n for (size_t added = 0; added < N - 1; ++added) {\n \/\/ Find lowest cost city not in MST and add it to MST.\n size_t u = 0;\n uint32_t c = numeric_limits<int>::max();\n for (size_t v = 0; v < N; ++v) {\n if (cost[v] < c && !inMST[v]) {\n u = v;\n c = cost[v];\n }\n }\n inMST[u] = true;\n\n \/\/ For each neighbor v of u not already in MST.\n for (size_t v = 0; v < N; ++v) {\n if (0 < d[u][v] && d[u][v] < cost[v] && !inMST[v]) {\n \/\/ d[u][v] is lower than current cost of v, so mark u\n \/\/ as parent of v and set cost of v to d[u][v].\n parent[v] = u;\n cost[v] = d[u][v];\n }\n }\n }\n\n \/\/ Build MST matrix.\n Matrix<uint32_t> MST(N, N);\n for (size_t v = 1; v < N; ++v) {\n MST[parent[v]][v] = d[parent[v]][v];\n }\n\n return MST;\n}\n\n\/**\n * Calculates a 2-approximation TSP tour from a minimum spanning tree.\n *\n * @param MST Input minimum spanning tree.\n * @return 2-approximation TSP tour.\n *\/\nvector<uint16_t> twoApprox(const Matrix<uint32_t>& MST) {\n size_t N = MST.rows();\n\n vector<uint16_t> tour;\n vector<bool> visited(N);\n stack<uint16_t> stack;\n stack.push(0);\n\n while (tour.size() < N) {\n size_t u = stack.top();\n stack.pop();\n if (!visited[u]) {\n tour.push_back(u);\n visited[u] = true;\n for (uint16_t v = 0; v < N; ++v) {\n if (MST[u][v] != 0) {\n stack.push(v);\n }\n }\n }\n }\n\n return tour;\n}\n\n\/**\n * Calculates a greedy TSP tour starting at city u.\n *\n * This is the naive algorithm given in the Kattis problem description.\n *\n * @param d Distance matrix.\n * @param u Start city of tour.\n * @return Greedy TSP tour.\n *\/\nvector<uint16_t> greedy(const Matrix<uint32_t>& d, size_t u) {\n size_t N = d.rows();\n vector<uint16_t> tour(N);\n vector<bool> used(N, false);\n tour[0] = u;\n used[u] = true;\n for (size_t i = 1; i < N; ++i) {\n \/\/ Find k, the closest city to the (i - 1):th city in tour.\n int32_t k = -1;\n for (uint16_t j = 0; j < N; ++j) {\n if (!used[j] && (k == -1 || d[tour[i-1]][j] < d[tour[i-1]][k])) {\n k = j;\n }\n }\n tour[i] = k;\n used[k] = true;\n }\n return tour;\n}\n\n\/**\n * Calculate K-nearest neighbors matrix from a distance matrix.\n *\n * @param d Distance matrix.\n * @return d.rows() x (d.cols - 1) matrix where element i,j is\n * the j:th nearest neighbor of city i.\n *\/\nMatrix<uint16_t> createNeighborsMatrix(const Matrix<uint32_t>& d, size_t K) {\n size_t N = d.rows();\n size_t M = d.cols() - 1;\n K = min(M, K);\n Matrix<uint16_t> neighbor(N, K);\n std::vector<uint16_t> row(M); \/\/ For sorting.\n\n for (size_t i = 0; i < N; ++i) {\n \/\/ Fill row with 0, 1, ..., i - 1, i + 1, ..., M - 1.\n uint16_t k = 0;\n for (size_t j = 0; j < M; ++j, ++k) {\n row[j] = (i == j) ? ++k : k;\n }\n \/\/ Sort K nearest row elements by distance to i.\n partial_sort(row.begin(), row.begin() + K, row.end(),\n [&](uint16_t j, uint16_t k) {\n return d[i][j] < d[i][k];\n }\n );\n \/\/ Copy first K elements (now sorted) to neighbor matrix.\n copy(row.begin(), row.begin() + K, neighbor[i]);\n }\n return neighbor;\n}\n\n\/**\n * Reverse a segment of a tour.\n *\n * This functions reverses the segment [start, end] of the given\n * tour and updates the position vector accordingly.\n *\n * @param tour The input tour.\n * @param start Start index of segment to reverse.\n * @param end End index of segment to reverse.\n * @param position Vector containing positions of cities in the tour, will\n * be updated to reflect the reversal.\n *\/\nvoid reverse(vector<uint16_t> &tour, size_t start, size_t end,\n vector<uint16_t>& position) {\n size_t N = tour.size();\n size_t numSwaps = (((start <= end ? end - start : (end + N) - start) + 1)\/2);\n uint16_t i = start;\n uint16_t j = end;\n for (size_t n = 0; n < numSwaps; ++n) {\n swap(tour[i], tour[j]);\n position[tour[i]] = i;\n position[tour[j]] = j;\n i = (i + 1) % N;\n j = ((j + N) - 1) % N;\n }\n}\n\n\/**\n * Returns the shortest distance d[i][j], i != j in the given distance matrix.\n *\n * @param d Distance matrix.\n * @return Minimum distance in d.\n *\/\nuint32_t minDistance(const Matrix<uint32_t>& d) {\n size_t N = d.rows();\n uint32_t min = numeric_limits<size_t>::max();\n for (size_t i = 0; i < N; ++i) {\n for (size_t j = 0; j < N; ++j) {\n if (i != j)\n min = std::min(min, d[i][j]);\n }\n }\n return min;\n}\n\n\/**\n * Returns the longest inter-city distance in the given tour.\n *\n * @param tour Input tour.\n * @param d Distance matrix.\n * @return Maximum inter-city distance in tour.\n *\/\nuint32_t maxDistance(const vector<uint16_t>& tour, const Matrix<uint32_t>& d) {\n size_t N = tour.size();\n uint32_t max = 0;\n for (size_t i = 0, j = 1; i < N; ++i, ++j) {\n max = std::max(max, d[tour[i]][tour[j % N]]);\n }\n return max;\n}\n\n\/**\n * Returns the total length of a tour.\n *\n * @param tour The input tour.\n * @param d Distance matrix.\n * @return The total length of the tour.\n *\/\nuint64_t length(const vector<uint32_t>& tour, const Matrix<uint32_t>& d) {\n size_t N = tour.size();\n uint64_t length = 0;\n for (size_t i = 0, j = 1; i < N; ++i, ++j) {\n length += d[tour[i]][tour[j % N]];\n }\n return length;\n}\n\n\/**\n * Perform a 2-opt pass on the given tour.\n *\n * This function uses the fast approach described on page 12 of \"Large-Step\n * Markov Chains for the Traveling Salesman Problem\" (Martin\/Otto\/Felten, 1991)\n *\n * @param tour The tour to optimize.\n * @param d Distance matrix.\n * @param neighbor Nearest neighbors matrix.\n * @param min Shortest possible inter-city distance.\n * @return true if the tour was improved, otherwise false.\n *\/\nbool twoOpt(vector<uint16_t>& tour, const Matrix<uint32_t>& d,\n const Matrix<uint16_t>& neighbor, uint32_t min) {\n size_t N = d.rows();\n bool didImprove = false;\n\n \/\/ Initialize city tour position vector.\n vector<uint16_t> position(N);\n for (uint16_t i = 0; i < N; ++i) {\n position[tour[i]] = i; \/\/ tour[i] is the i:th city in tour.\n }\n\n uint16_t u, v, w, z;\n size_t u_i, v_i, w_i, z_i;\n uint32_t max = maxDistance(tour, d); \/\/ Longest link in current tour.\n\n for (u_i = 0, v_i = 1; u_i < N; ++u_i, ++v_i) {\n \/\/ For each edge (u, v).\n u = tour[u_i];\n v = tour[v_i % N];\n for (size_t k = 0; k < neighbor.cols(); ++k) {\n \/\/ Visit nearby edges (w, z).\n w_i = position[neighbor[u][k]];\n z_i = w_i + 1;\n w = tour[w_i]; \/\/ w is the k:th closest neighbor of u.\n z = tour[z_i % N];\n\n if (v == w || z == u) {\n continue; \/\/ Skip adjacent edges.\n }\n\n \/\/ d[u][w] + min is a lower bound on new length.\n \/\/ d[u][v] + max is an upper bound on old length.\n if (d[u][w] + min > d[u][v] + max) {\n break; \/\/ Go to next edge (u, v).\n }\n\n if (d[u][w] + d[v][z] < d[u][v] + d[w][z]) {\n \/\/ --u w-- --u-w->\n \/\/ X ===>\n \/\/ <-z v-> <-z-v--\n reverse(tour, v_i % N, w_i, position);\n \n \/\/ FIXME: Is this enough to update max?\n max = std::max(max, std::max(d[u][w], d[v][z]));\n\n didImprove = true;\n break;\n }\n }\n }\n\n return didImprove;\n}\n\nint main(int argc, char *argv[]) {\n \/\/ Create distance matrix from standard input.\n Matrix<uint32_t> d = createDistanceMatrix(cin);\n\n \/\/ Calculate 2-approximation tour from minimum spanning tree.\n \/\/Matrix<uint32_t> MST = primMST(d);\n \/\/vector<uint16_t> tour = twoApprox(MST);\n \n \/\/ Calculate a greedy tour.\n vector<uint16_t> tour = greedy(d, 0);\n\n \/\/ Calculate nearest neighbors and smallest possible city distance.\n Matrix<uint16_t> neighbor = createNeighborsMatrix(d, TWOOPT_MAX_NEIGHBORS);\n uint32_t min = minDistance(d);\n\n \/\/ Optimize tour using 2-opt.\n bool didImprove;\n do {\n didImprove = twoOpt(tour, d, neighbor, min);\n } while (didImprove);\n\n \/\/ Print tour.\n for (auto city : tour) {\n cout << city << endl;\n }\n\n return 0;\n}\n\n<commit_msg>Iterate greedy + 2-opt for 1950 ms (28.8 p on Kattis).<commit_after>#include <iostream>\n#include <string>\n#include <iomanip>\n#include <stack>\n#include <limits>\n#include <algorithm>\n#include <chrono>\n#include <random>\n#include <cmath>\n#include <cstdint>\n#include <cassert>\n\n#include \"matrix.h\"\n\n#ifdef DEBUG\n #define LOG(x) std::cerr << x\n#else\n #define LOG(x)\n#endif\n\nusing namespace std;\n\n\/\/ Random number generator.\nrandom_device rd;\ndefault_random_engine rng(rd());\n\n\/\/ Largest neighborhood to explore during 2-opt.\nconst size_t TWOOPT_MAX_NEIGHBORS = 100;\n\n\/\/ Output stream operator (convenient for printing tours).\nostream& operator<<(ostream& os, const vector<size_t>& v) {\n for (auto e : v)\n os << e << ' ';\n os << endl;\n return os;\n}\n\n\/**\n * Create a distance matrix from an input stream and return it.\n *\n * @param in Input stream.\n * @return The read distance matrix.\n *\/\nMatrix<uint32_t> createDistanceMatrix(istream& in) {\n \/\/ Read vertex coordinates.\n size_t N;\n in >> N;\n vector<double> x(N);\n vector<double> y(N);\n for (size_t i = 0; i < N; ++i) {\n in >> x[i] >> y[i];\n }\n\n \/\/ Calculate distance matrix.\n Matrix<uint32_t> d(N, N);\n for (size_t i = 0; i < N; ++i) {\n for (size_t j = i + 1; j < N; ++j) {\n d[i][j] = d[j][i] = round(sqrt(pow(x[i]-x[j], 2) + pow(y[i]-y[j], 2)));\n }\n }\n\n return d;\n}\n\n\/**\n * Calculate minimum spanning tree using Prim's algorithm.\n *\n * @param d Distance matrix.\n * @return The minimum spanning tree.\n *\/\nMatrix<uint32_t> primMST(const Matrix<uint32_t>& d) {\n size_t N = d.rows();\n\n vector<bool> inMST(N);\n vector<uint32_t> cost(N);\n vector<uint32_t> parent(N);\n fill(inMST.begin(), inMST.end(), false);\n fill(cost.begin(), cost.end(), numeric_limits<uint32_t>::max());\n cost[0] = 0;\n\n for (size_t added = 0; added < N - 1; ++added) {\n \/\/ Find lowest cost city not in MST and add it to MST.\n size_t u = 0;\n uint32_t c = numeric_limits<int>::max();\n for (size_t v = 0; v < N; ++v) {\n if (cost[v] < c && !inMST[v]) {\n u = v;\n c = cost[v];\n }\n }\n inMST[u] = true;\n\n \/\/ For each neighbor v of u not already in MST.\n for (size_t v = 0; v < N; ++v) {\n if (0 < d[u][v] && d[u][v] < cost[v] && !inMST[v]) {\n \/\/ d[u][v] is lower than current cost of v, so mark u\n \/\/ as parent of v and set cost of v to d[u][v].\n parent[v] = u;\n cost[v] = d[u][v];\n }\n }\n }\n\n \/\/ Build MST matrix.\n Matrix<uint32_t> MST(N, N);\n for (size_t v = 1; v < N; ++v) {\n MST[parent[v]][v] = d[parent[v]][v];\n }\n\n return MST;\n}\n\n\/**\n * Calculates a 2-approximation TSP tour from a minimum spanning tree.\n *\n * @param MST Input minimum spanning tree.\n * @return 2-approximation TSP tour.\n *\/\nvector<uint16_t> twoApprox(const Matrix<uint32_t>& MST) {\n size_t N = MST.rows();\n\n vector<uint16_t> tour;\n vector<bool> visited(N);\n stack<uint16_t> stack;\n stack.push(0);\n\n while (tour.size() < N) {\n size_t u = stack.top();\n stack.pop();\n if (!visited[u]) {\n tour.push_back(u);\n visited[u] = true;\n for (uint16_t v = 0; v < N; ++v) {\n if (MST[u][v] != 0) {\n stack.push(v);\n }\n }\n }\n }\n\n return tour;\n}\n\n\/**\n * Calculates a greedy TSP tour starting at city u.\n *\n * This is the naive algorithm given in the Kattis problem description.\n *\n * @param d Distance matrix.\n * @param u Start city of tour.\n * @return Greedy TSP tour.\n *\/\nvector<uint16_t> greedy(const Matrix<uint32_t>& d, size_t u) {\n size_t N = d.rows();\n vector<uint16_t> tour(N);\n vector<bool> used(N, false);\n tour[0] = u;\n used[u] = true;\n for (size_t i = 1; i < N; ++i) {\n \/\/ Find k, the closest city to the (i - 1):th city in tour.\n int32_t k = -1;\n for (uint16_t j = 0; j < N; ++j) {\n if (!used[j] && (k == -1 || d[tour[i-1]][j] < d[tour[i-1]][k])) {\n k = j;\n }\n }\n tour[i] = k;\n used[k] = true;\n }\n return tour;\n}\n\n\/**\n * Calculate K-nearest neighbors matrix from a distance matrix.\n *\n * @param d Distance matrix.\n * @return d.rows() x (d.cols - 1) matrix where element i,j is\n * the j:th nearest neighbor of city i.\n *\/\nMatrix<uint16_t> createNeighborsMatrix(const Matrix<uint32_t>& d, size_t K) {\n size_t N = d.rows();\n size_t M = d.cols() - 1;\n K = min(M, K);\n Matrix<uint16_t> neighbor(N, K);\n std::vector<uint16_t> row(M); \/\/ For sorting.\n\n for (size_t i = 0; i < N; ++i) {\n \/\/ Fill row with 0, 1, ..., i - 1, i + 1, ..., M - 1.\n uint16_t k = 0;\n for (size_t j = 0; j < M; ++j, ++k) {\n row[j] = (i == j) ? ++k : k;\n }\n \/\/ Sort K nearest row elements by distance to i.\n partial_sort(row.begin(), row.begin() + K, row.end(),\n [&](uint16_t j, uint16_t k) {\n return d[i][j] < d[i][k];\n }\n );\n \/\/ Copy first K elements (now sorted) to neighbor matrix.\n copy(row.begin(), row.begin() + K, neighbor[i]);\n }\n return neighbor;\n}\n\n\/**\n * Reverse a segment of a tour.\n *\n * This functions reverses the segment [start, end] of the given\n * tour and updates the position vector accordingly.\n *\n * @param tour The input tour.\n * @param start Start index of segment to reverse.\n * @param end End index of segment to reverse.\n * @param position Vector containing positions of cities in the tour, will\n * be updated to reflect the reversal.\n *\/\nvoid reverse(vector<uint16_t> &tour, size_t start, size_t end,\n vector<uint16_t>& position) {\n size_t N = tour.size();\n size_t numSwaps = (((start <= end ? end - start : (end + N) - start) + 1)\/2);\n uint16_t i = start;\n uint16_t j = end;\n for (size_t n = 0; n < numSwaps; ++n) {\n swap(tour[i], tour[j]);\n position[tour[i]] = i;\n position[tour[j]] = j;\n i = (i + 1) % N;\n j = ((j + N) - 1) % N;\n }\n}\n\n\/**\n * Returns the shortest distance d[i][j], i != j in the given distance matrix.\n *\n * @param d Distance matrix.\n * @return Minimum distance in d.\n *\/\nuint32_t minDistance(const Matrix<uint32_t>& d) {\n size_t N = d.rows();\n uint32_t min = numeric_limits<size_t>::max();\n for (size_t i = 0; i < N; ++i) {\n for (size_t j = 0; j < N; ++j) {\n if (i != j)\n min = std::min(min, d[i][j]);\n }\n }\n return min;\n}\n\n\/**\n * Returns the longest inter-city distance in the given tour.\n *\n * @param tour Input tour.\n * @param d Distance matrix.\n * @return Maximum inter-city distance in tour.\n *\/\nuint32_t maxDistance(const vector<uint16_t>& tour, const Matrix<uint32_t>& d) {\n size_t N = tour.size();\n uint32_t max = 0;\n for (size_t i = 0, j = 1; i < N; ++i, ++j) {\n max = std::max(max, d[tour[i]][tour[j % N]]);\n }\n return max;\n}\n\n\/**\n * Returns the total length of a tour.\n *\n * @param tour The input tour.\n * @param d Distance matrix.\n * @return The total length of the tour.\n *\/\nuint64_t length(const vector<uint16_t>& tour, const Matrix<uint32_t>& d) {\n size_t N = tour.size();\n uint64_t length = 0;\n for (size_t i = 0, j = 1; i < N; ++i, ++j) {\n length += d[tour[i]][tour[j % N]];\n }\n return length;\n}\n\n\/**\n * Perform a 2-opt pass on the given tour.\n *\n * This function uses the fast approach described on page 12 of \"Large-Step\n * Markov Chains for the Traveling Salesman Problem\" (Martin\/Otto\/Felten, 1991)\n *\n * @param tour The tour to optimize.\n * @param d Distance matrix.\n * @param neighbor Nearest neighbors matrix.\n * @param min Shortest possible inter-city distance.\n * @return true if the tour was improved, otherwise false.\n *\/\nbool twoOpt(vector<uint16_t>& tour, const Matrix<uint32_t>& d,\n const Matrix<uint16_t>& neighbor, uint32_t min) {\n size_t N = d.rows();\n bool didImprove = false;\n\n \/\/ Initialize city tour position vector.\n vector<uint16_t> position(N);\n for (uint16_t i = 0; i < N; ++i) {\n position[tour[i]] = i; \/\/ tour[i] is the i:th city in tour.\n }\n\n uint16_t u, v, w, z;\n size_t u_i, v_i, w_i, z_i;\n uint32_t max = maxDistance(tour, d); \/\/ Longest link in current tour.\n\n for (u_i = 0, v_i = 1; u_i < N; ++u_i, ++v_i) {\n \/\/ For each edge (u, v).\n u = tour[u_i];\n v = tour[v_i % N];\n for (size_t k = 0; k < neighbor.cols(); ++k) {\n \/\/ Visit nearby edges (w, z).\n w_i = position[neighbor[u][k]];\n z_i = w_i + 1;\n w = tour[w_i]; \/\/ w is the k:th closest neighbor of u.\n z = tour[z_i % N];\n\n if (v == w || z == u) {\n continue; \/\/ Skip adjacent edges.\n }\n\n \/\/ d[u][w] + min is a lower bound on new length.\n \/\/ d[u][v] + max is an upper bound on old length.\n if (d[u][w] + min > d[u][v] + max) {\n break; \/\/ Go to next edge (u, v).\n }\n\n if (d[u][w] + d[v][z] < d[u][v] + d[w][z]) {\n \/\/ --u w-- --u-w->\n \/\/ X ===>\n \/\/ <-z v-> <-z-v--\n reverse(tour, v_i % N, w_i, position);\n \n \/\/ FIXME: Is this enough to update max?\n max = std::max(max, std::max(d[u][w], d[v][z]));\n\n didImprove = true;\n break;\n }\n }\n }\n\n return didImprove;\n}\n\nint main(int argc, char *argv[]) {\n \/\/ Deadline is 1950 ms into the future.\n auto now = chrono::high_resolution_clock::now();\n auto deadline = now + chrono::duration<int, milli>(1950);\n\n \/\/ Create distance \/ nearest neighbors matrix.\n Matrix<uint32_t> d = createDistanceMatrix(cin);\n Matrix<uint16_t> neighbor = createNeighborsMatrix(d, TWOOPT_MAX_NEIGHBORS);\n\n uint32_t minCityDistance = minDistance(d); \/\/ Smallest city distance.\n\n \/\/ Create vector of random possible start cities.\n vector<uint16_t> startCities(d.rows());\n for (uint16_t i = 0; i < d.rows(); ++i) {\n startCities[i] = i;\n }\n shuffle(startCities.begin(), startCities.end(), rng);\n\n vector<vector<uint16_t> > tours;\n size_t minTour;\n uint64_t minLength = numeric_limits<uint64_t>::max();\n\n \/\/ For each possible start city.\n for (size_t i = 0; i < d.rows(); ++i) {\n \/\/ Create greedy tour starting in startCities[i].\n tours.emplace_back(d.rows());\n tours[i] = greedy(d, startCities[i]);\n\n \/\/ Optimize tour using 2-opt.\n bool didImprove;\n do {\n didImprove = twoOpt(tours[i], d, neighbor, minCityDistance);\n } while (didImprove);\n\n \/\/ Check if we got a shorter tour.\n uint64_t tourLength = length(tours[i], d);\n if (tourLength < minLength) {\n minTour = i;\n minLength = tourLength;\n }\n\n \/\/ Check if deadline has passed.\n if (chrono::high_resolution_clock::now() > deadline) {\n break;\n }\n }\n\n \/\/ Print the shortest tour.\n for (auto city : tours[minTour]) {\n cout << city << endl;\n }\n\n return 0;\n}\n\n<|endoftext|>"} {"text":"<commit_before>\/*\n * Copyright 2012 Google Inc.\n *\n * Use of this source code is governed by a BSD-style license that can be\n * found in the LICENSE file.\n *\/\n\n#include \"GrTextureStripAtlas.h\"\n#include \"GrContext.h\"\n#include \"GrContextPriv.h\"\n#include \"GrSurfaceContext.h\"\n#include \"SkGr.h\"\n#include \"SkPixelRef.h\"\n#include \"SkTSearch.h\"\n\n#ifdef SK_DEBUG\n #define VALIDATE this->validate()\n#else\n #define VALIDATE\n#endif\n\nclass GrTextureStripAtlas::Hash : public SkTDynamicHash<GrTextureStripAtlas::AtlasEntry,\n GrTextureStripAtlas::Desc> {};\n\nint32_t GrTextureStripAtlas::gCacheCount = 0;\n\nGrTextureStripAtlas::Hash* GrTextureStripAtlas::gAtlasCache = nullptr;\n\nGrTextureStripAtlas::Hash* GrTextureStripAtlas::GetCache() {\n\n if (nullptr == gAtlasCache) {\n gAtlasCache = new Hash;\n }\n\n return gAtlasCache;\n}\n\n\/\/ Remove the specified atlas from the cache\nvoid GrTextureStripAtlas::CleanUp(const GrContext*, void* info) {\n SkASSERT(info);\n\n AtlasEntry* entry = static_cast<AtlasEntry*>(info);\n\n \/\/ remove the cache entry\n GetCache()->remove(entry->fDesc);\n\n \/\/ remove the actual entry\n delete entry;\n\n if (0 == GetCache()->count()) {\n delete gAtlasCache;\n gAtlasCache = nullptr;\n }\n}\n\nGrTextureStripAtlas* GrTextureStripAtlas::GetAtlas(const GrTextureStripAtlas::Desc& desc) {\n AtlasEntry* entry = GetCache()->find(desc);\n if (nullptr == entry) {\n entry = new AtlasEntry;\n\n entry->fAtlas = new GrTextureStripAtlas(desc);\n entry->fDesc = desc;\n\n desc.fContext->addCleanUp(CleanUp, entry);\n\n GetCache()->add(entry);\n }\n\n return entry->fAtlas;\n}\n\nGrTextureStripAtlas::GrTextureStripAtlas(GrTextureStripAtlas::Desc desc)\n : fCacheKey(sk_atomic_inc(&gCacheCount))\n , fLockedRows(0)\n , fDesc(desc)\n , fNumRows(desc.fHeight \/ desc.fRowHeight)\n , fRows(new AtlasRow[fNumRows])\n , fLRUFront(nullptr)\n , fLRUBack(nullptr) {\n SkASSERT(fNumRows * fDesc.fRowHeight == fDesc.fHeight);\n this->initLRU();\n fNormalizedYHeight = SK_Scalar1 \/ fDesc.fHeight;\n VALIDATE;\n}\n\nGrTextureStripAtlas::~GrTextureStripAtlas() { delete[] fRows; }\n\nint GrTextureStripAtlas::lockRow(const SkBitmap& bitmap) {\n VALIDATE;\n if (0 == fLockedRows) {\n this->lockTexture();\n if (!fTexContext) {\n return -1;\n }\n }\n\n int key = bitmap.getGenerationID();\n int rowNumber = -1;\n int index = this->searchByKey(key);\n\n if (index >= 0) {\n \/\/ We already have the data in a row, so we can just return that row\n AtlasRow* row = fKeyTable[index];\n if (0 == row->fLocks) {\n this->removeFromLRU(row);\n }\n ++row->fLocks;\n ++fLockedRows;\n\n \/\/ Since all the rows are always stored in a contiguous array, we can save the memory\n \/\/ required for storing row numbers and just compute it with some pointer arithmetic\n rowNumber = static_cast<int>(row - fRows);\n } else {\n \/\/ ~index is the index where we will insert the new key to keep things sorted\n index = ~index;\n\n \/\/ We don't have this data cached, so pick the least recently used row to copy into\n AtlasRow* row = this->getLRU();\n\n ++fLockedRows;\n\n if (nullptr == row) {\n \/\/ force a flush, which should unlock all the rows; then try again\n fDesc.fContext->flush();\n row = this->getLRU();\n if (nullptr == row) {\n --fLockedRows;\n return -1;\n }\n }\n\n this->removeFromLRU(row);\n\n uint32_t oldKey = row->fKey;\n\n \/\/ If we are writing into a row that already held bitmap data, we need to remove the\n \/\/ reference to that genID which is stored in our sorted table of key values.\n if (oldKey != kEmptyAtlasRowKey) {\n\n \/\/ Find the entry in the list; if it's before the index where we plan on adding the new\n \/\/ entry, we decrement since it will shift elements ahead of it back by one.\n int oldIndex = this->searchByKey(oldKey);\n if (oldIndex < index) {\n --index;\n }\n\n fKeyTable.remove(oldIndex);\n }\n\n row->fKey = key;\n row->fLocks = 1;\n fKeyTable.insert(index, 1, &row);\n rowNumber = static_cast<int>(row - fRows);\n\n SkAutoLockPixels lock(bitmap);\n\n SkASSERT(bitmap.width() == fDesc.fWidth);\n SkASSERT(bitmap.height() == fDesc.fRowHeight);\n\n \/\/ Pass in the kDontFlush flag, since we know we're writing to a part of this texture\n \/\/ that is not currently in use\n fTexContext->writePixels(bitmap.info(), bitmap.getPixels(), bitmap.rowBytes(),\n 0, rowNumber * fDesc.fRowHeight,\n GrContext::kDontFlush_PixelOpsFlag);\n }\n\n SkASSERT(rowNumber >= 0);\n VALIDATE;\n return rowNumber;\n}\n\nsk_sp<GrTextureProxy> GrTextureStripAtlas::asTextureProxyRef() const {\n return fTexContext->asTextureProxyRef();\n}\n\nvoid GrTextureStripAtlas::unlockRow(int row) {\n VALIDATE;\n --fRows[row].fLocks;\n --fLockedRows;\n SkASSERT(fRows[row].fLocks >= 0 && fLockedRows >= 0);\n if (0 == fRows[row].fLocks) {\n this->appendLRU(fRows + row);\n }\n if (0 == fLockedRows) {\n this->unlockTexture();\n }\n VALIDATE;\n}\n\nGrTextureStripAtlas::AtlasRow* GrTextureStripAtlas::getLRU() {\n \/\/ Front is least-recently-used\n AtlasRow* row = fLRUFront;\n return row;\n}\n\nvoid GrTextureStripAtlas::lockTexture() {\n GrSurfaceDesc texDesc;\n texDesc.fWidth = fDesc.fWidth;\n texDesc.fHeight = fDesc.fHeight;\n texDesc.fConfig = fDesc.fConfig;\n texDesc.fIsMipMapped = false;\n\n static const GrUniqueKey::Domain kDomain = GrUniqueKey::GenerateDomain();\n GrUniqueKey key;\n GrUniqueKey::Builder builder(&key, kDomain, 1);\n builder[0] = static_cast<uint32_t>(fCacheKey);\n builder.finish();\n\n \/\/ MDB TODO (caching): this side-steps the issue of proxies with unique IDs\n GrTexture* texture = fDesc.fContext->textureProvider()->findAndRefTextureByUniqueKey(key);\n if (!texture) {\n texture = fDesc.fContext->textureProvider()->createTexture(texDesc, SkBudgeted::kYes,\n nullptr, 0);\n if (!texture) {\n return;\n }\n\n \/\/ We will be issuing writes to the surface using kDontFlush_PixelOpsFlag, so we\n \/\/ need to make sure any existing IO is flushed\n fDesc.fContext->flushSurfaceIO(texture);\n fDesc.fContext->textureProvider()->assignUniqueKeyToTexture(key, texture);\n \/\/ This is a new texture, so all of our cache info is now invalid\n this->initLRU();\n fKeyTable.rewind();\n }\n SkASSERT(texture);\n fTexContext = fDesc.fContext->contextPriv().makeWrappedSurfaceContext(sk_ref_sp(texture));\n}\n\nvoid GrTextureStripAtlas::unlockTexture() {\n SkASSERT(fTexContext && 0 == fLockedRows);\n fTexContext.reset();\n}\n\nvoid GrTextureStripAtlas::initLRU() {\n fLRUFront = nullptr;\n fLRUBack = nullptr;\n \/\/ Initially all the rows are in the LRU list\n for (int i = 0; i < fNumRows; ++i) {\n fRows[i].fKey = kEmptyAtlasRowKey;\n fRows[i].fNext = nullptr;\n fRows[i].fPrev = nullptr;\n this->appendLRU(fRows + i);\n }\n SkASSERT(nullptr == fLRUFront || nullptr == fLRUFront->fPrev);\n SkASSERT(nullptr == fLRUBack || nullptr == fLRUBack->fNext);\n}\n\nvoid GrTextureStripAtlas::appendLRU(AtlasRow* row) {\n SkASSERT(nullptr == row->fPrev && nullptr == row->fNext);\n if (nullptr == fLRUFront && nullptr == fLRUBack) {\n fLRUFront = row;\n fLRUBack = row;\n } else {\n row->fPrev = fLRUBack;\n fLRUBack->fNext = row;\n fLRUBack = row;\n }\n}\n\nvoid GrTextureStripAtlas::removeFromLRU(AtlasRow* row) {\n SkASSERT(row);\n if (row->fNext && row->fPrev) {\n row->fPrev->fNext = row->fNext;\n row->fNext->fPrev = row->fPrev;\n } else {\n if (nullptr == row->fNext) {\n SkASSERT(row == fLRUBack);\n fLRUBack = row->fPrev;\n if (fLRUBack) {\n fLRUBack->fNext = nullptr;\n }\n }\n if (nullptr == row->fPrev) {\n SkASSERT(row == fLRUFront);\n fLRUFront = row->fNext;\n if (fLRUFront) {\n fLRUFront->fPrev = nullptr;\n }\n }\n }\n row->fNext = nullptr;\n row->fPrev = nullptr;\n}\n\nint GrTextureStripAtlas::searchByKey(uint32_t key) {\n AtlasRow target;\n target.fKey = key;\n return SkTSearch<const AtlasRow,\n GrTextureStripAtlas::KeyLess>((const AtlasRow**)fKeyTable.begin(),\n fKeyTable.count(),\n &target,\n sizeof(AtlasRow*));\n}\n\n#ifdef SK_DEBUG\nvoid GrTextureStripAtlas::validate() {\n\n \/\/ Our key table should be sorted\n uint32_t prev = 1 > fKeyTable.count() ? 0 : fKeyTable[0]->fKey;\n for (int i = 1; i < fKeyTable.count(); ++i) {\n SkASSERT(prev < fKeyTable[i]->fKey);\n SkASSERT(fKeyTable[i]->fKey != kEmptyAtlasRowKey);\n prev = fKeyTable[i]->fKey;\n }\n\n int lruCount = 0;\n \/\/ Validate LRU pointers, and count LRU entries\n SkASSERT(nullptr == fLRUFront || nullptr == fLRUFront->fPrev);\n SkASSERT(nullptr == fLRUBack || nullptr == fLRUBack->fNext);\n for (AtlasRow* r = fLRUFront; r != nullptr; r = r->fNext) {\n if (nullptr == r->fNext) {\n SkASSERT(r == fLRUBack);\n } else {\n SkASSERT(r->fNext->fPrev == r);\n }\n ++lruCount;\n }\n\n int rowLocks = 0;\n int freeRows = 0;\n\n for (int i = 0; i < fNumRows; ++i) {\n rowLocks += fRows[i].fLocks;\n if (0 == fRows[i].fLocks) {\n ++freeRows;\n bool inLRU = false;\n \/\/ Step through the LRU and make sure it's present\n for (AtlasRow* r = fLRUFront; r != nullptr; r = r->fNext) {\n if (r == &fRows[i]) {\n inLRU = true;\n break;\n }\n }\n SkASSERT(inLRU);\n } else {\n \/\/ If we are locked, we should have a key\n SkASSERT(kEmptyAtlasRowKey != fRows[i].fKey);\n }\n\n \/\/ If we have a key != kEmptyAtlasRowKey, it should be in the key table\n SkASSERT(fRows[i].fKey == kEmptyAtlasRowKey || this->searchByKey(fRows[i].fKey) >= 0);\n }\n\n \/\/ Our count of locks should equal the sum of row locks, unless we ran out of rows and flushed,\n \/\/ in which case we'll have one more lock than recorded in the rows (to represent the pending\n \/\/ lock of a row; which ensures we don't unlock the texture prematurely).\n SkASSERT(rowLocks == fLockedRows || rowLocks + 1 == fLockedRows);\n\n \/\/ We should have one lru entry for each free row\n SkASSERT(freeRows == lruCount);\n\n \/\/ If we have locked rows, we should have a locked texture, otherwise\n \/\/ it should be unlocked\n if (fLockedRows == 0) {\n SkASSERT(!fTexContext);\n } else {\n SkASSERT(fTexContext);\n }\n}\n#endif\n<commit_msg>Fix memory leak: adopt rather than ref GrTexture* in GrTextureStripAtlas<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 \"GrTextureStripAtlas.h\"\n#include \"GrContext.h\"\n#include \"GrContextPriv.h\"\n#include \"GrSurfaceContext.h\"\n#include \"SkGr.h\"\n#include \"SkPixelRef.h\"\n#include \"SkTSearch.h\"\n\n#ifdef SK_DEBUG\n #define VALIDATE this->validate()\n#else\n #define VALIDATE\n#endif\n\nclass GrTextureStripAtlas::Hash : public SkTDynamicHash<GrTextureStripAtlas::AtlasEntry,\n GrTextureStripAtlas::Desc> {};\n\nint32_t GrTextureStripAtlas::gCacheCount = 0;\n\nGrTextureStripAtlas::Hash* GrTextureStripAtlas::gAtlasCache = nullptr;\n\nGrTextureStripAtlas::Hash* GrTextureStripAtlas::GetCache() {\n\n if (nullptr == gAtlasCache) {\n gAtlasCache = new Hash;\n }\n\n return gAtlasCache;\n}\n\n\/\/ Remove the specified atlas from the cache\nvoid GrTextureStripAtlas::CleanUp(const GrContext*, void* info) {\n SkASSERT(info);\n\n AtlasEntry* entry = static_cast<AtlasEntry*>(info);\n\n \/\/ remove the cache entry\n GetCache()->remove(entry->fDesc);\n\n \/\/ remove the actual entry\n delete entry;\n\n if (0 == GetCache()->count()) {\n delete gAtlasCache;\n gAtlasCache = nullptr;\n }\n}\n\nGrTextureStripAtlas* GrTextureStripAtlas::GetAtlas(const GrTextureStripAtlas::Desc& desc) {\n AtlasEntry* entry = GetCache()->find(desc);\n if (nullptr == entry) {\n entry = new AtlasEntry;\n\n entry->fAtlas = new GrTextureStripAtlas(desc);\n entry->fDesc = desc;\n\n desc.fContext->addCleanUp(CleanUp, entry);\n\n GetCache()->add(entry);\n }\n\n return entry->fAtlas;\n}\n\nGrTextureStripAtlas::GrTextureStripAtlas(GrTextureStripAtlas::Desc desc)\n : fCacheKey(sk_atomic_inc(&gCacheCount))\n , fLockedRows(0)\n , fDesc(desc)\n , fNumRows(desc.fHeight \/ desc.fRowHeight)\n , fRows(new AtlasRow[fNumRows])\n , fLRUFront(nullptr)\n , fLRUBack(nullptr) {\n SkASSERT(fNumRows * fDesc.fRowHeight == fDesc.fHeight);\n this->initLRU();\n fNormalizedYHeight = SK_Scalar1 \/ fDesc.fHeight;\n VALIDATE;\n}\n\nGrTextureStripAtlas::~GrTextureStripAtlas() { delete[] fRows; }\n\nint GrTextureStripAtlas::lockRow(const SkBitmap& bitmap) {\n VALIDATE;\n if (0 == fLockedRows) {\n this->lockTexture();\n if (!fTexContext) {\n return -1;\n }\n }\n\n int key = bitmap.getGenerationID();\n int rowNumber = -1;\n int index = this->searchByKey(key);\n\n if (index >= 0) {\n \/\/ We already have the data in a row, so we can just return that row\n AtlasRow* row = fKeyTable[index];\n if (0 == row->fLocks) {\n this->removeFromLRU(row);\n }\n ++row->fLocks;\n ++fLockedRows;\n\n \/\/ Since all the rows are always stored in a contiguous array, we can save the memory\n \/\/ required for storing row numbers and just compute it with some pointer arithmetic\n rowNumber = static_cast<int>(row - fRows);\n } else {\n \/\/ ~index is the index where we will insert the new key to keep things sorted\n index = ~index;\n\n \/\/ We don't have this data cached, so pick the least recently used row to copy into\n AtlasRow* row = this->getLRU();\n\n ++fLockedRows;\n\n if (nullptr == row) {\n \/\/ force a flush, which should unlock all the rows; then try again\n fDesc.fContext->flush();\n row = this->getLRU();\n if (nullptr == row) {\n --fLockedRows;\n return -1;\n }\n }\n\n this->removeFromLRU(row);\n\n uint32_t oldKey = row->fKey;\n\n \/\/ If we are writing into a row that already held bitmap data, we need to remove the\n \/\/ reference to that genID which is stored in our sorted table of key values.\n if (oldKey != kEmptyAtlasRowKey) {\n\n \/\/ Find the entry in the list; if it's before the index where we plan on adding the new\n \/\/ entry, we decrement since it will shift elements ahead of it back by one.\n int oldIndex = this->searchByKey(oldKey);\n if (oldIndex < index) {\n --index;\n }\n\n fKeyTable.remove(oldIndex);\n }\n\n row->fKey = key;\n row->fLocks = 1;\n fKeyTable.insert(index, 1, &row);\n rowNumber = static_cast<int>(row - fRows);\n\n SkAutoLockPixels lock(bitmap);\n\n SkASSERT(bitmap.width() == fDesc.fWidth);\n SkASSERT(bitmap.height() == fDesc.fRowHeight);\n\n \/\/ Pass in the kDontFlush flag, since we know we're writing to a part of this texture\n \/\/ that is not currently in use\n fTexContext->writePixels(bitmap.info(), bitmap.getPixels(), bitmap.rowBytes(),\n 0, rowNumber * fDesc.fRowHeight,\n GrContext::kDontFlush_PixelOpsFlag);\n }\n\n SkASSERT(rowNumber >= 0);\n VALIDATE;\n return rowNumber;\n}\n\nsk_sp<GrTextureProxy> GrTextureStripAtlas::asTextureProxyRef() const {\n return fTexContext->asTextureProxyRef();\n}\n\nvoid GrTextureStripAtlas::unlockRow(int row) {\n VALIDATE;\n --fRows[row].fLocks;\n --fLockedRows;\n SkASSERT(fRows[row].fLocks >= 0 && fLockedRows >= 0);\n if (0 == fRows[row].fLocks) {\n this->appendLRU(fRows + row);\n }\n if (0 == fLockedRows) {\n this->unlockTexture();\n }\n VALIDATE;\n}\n\nGrTextureStripAtlas::AtlasRow* GrTextureStripAtlas::getLRU() {\n \/\/ Front is least-recently-used\n AtlasRow* row = fLRUFront;\n return row;\n}\n\nvoid GrTextureStripAtlas::lockTexture() {\n GrSurfaceDesc texDesc;\n texDesc.fWidth = fDesc.fWidth;\n texDesc.fHeight = fDesc.fHeight;\n texDesc.fConfig = fDesc.fConfig;\n texDesc.fIsMipMapped = false;\n\n static const GrUniqueKey::Domain kDomain = GrUniqueKey::GenerateDomain();\n GrUniqueKey key;\n GrUniqueKey::Builder builder(&key, kDomain, 1);\n builder[0] = static_cast<uint32_t>(fCacheKey);\n builder.finish();\n\n \/\/ MDB TODO (caching): this side-steps the issue of proxies with unique IDs\n sk_sp<GrTexture> texture(fDesc.fContext->textureProvider()->findAndRefTextureByUniqueKey(key));\n if (!texture) {\n texture.reset(fDesc.fContext->textureProvider()->createTexture(texDesc, SkBudgeted::kYes,\n nullptr, 0));\n if (!texture) {\n return;\n }\n\n \/\/ We will be issuing writes to the surface using kDontFlush_PixelOpsFlag, so we\n \/\/ need to make sure any existing IO is flushed\n fDesc.fContext->flushSurfaceIO(texture.get());\n fDesc.fContext->textureProvider()->assignUniqueKeyToTexture(key, texture.get());\n \/\/ This is a new texture, so all of our cache info is now invalid\n this->initLRU();\n fKeyTable.rewind();\n }\n SkASSERT(texture);\n fTexContext = fDesc.fContext->contextPriv().makeWrappedSurfaceContext(std::move(texture));\n}\n\nvoid GrTextureStripAtlas::unlockTexture() {\n SkASSERT(fTexContext && 0 == fLockedRows);\n fTexContext.reset();\n}\n\nvoid GrTextureStripAtlas::initLRU() {\n fLRUFront = nullptr;\n fLRUBack = nullptr;\n \/\/ Initially all the rows are in the LRU list\n for (int i = 0; i < fNumRows; ++i) {\n fRows[i].fKey = kEmptyAtlasRowKey;\n fRows[i].fNext = nullptr;\n fRows[i].fPrev = nullptr;\n this->appendLRU(fRows + i);\n }\n SkASSERT(nullptr == fLRUFront || nullptr == fLRUFront->fPrev);\n SkASSERT(nullptr == fLRUBack || nullptr == fLRUBack->fNext);\n}\n\nvoid GrTextureStripAtlas::appendLRU(AtlasRow* row) {\n SkASSERT(nullptr == row->fPrev && nullptr == row->fNext);\n if (nullptr == fLRUFront && nullptr == fLRUBack) {\n fLRUFront = row;\n fLRUBack = row;\n } else {\n row->fPrev = fLRUBack;\n fLRUBack->fNext = row;\n fLRUBack = row;\n }\n}\n\nvoid GrTextureStripAtlas::removeFromLRU(AtlasRow* row) {\n SkASSERT(row);\n if (row->fNext && row->fPrev) {\n row->fPrev->fNext = row->fNext;\n row->fNext->fPrev = row->fPrev;\n } else {\n if (nullptr == row->fNext) {\n SkASSERT(row == fLRUBack);\n fLRUBack = row->fPrev;\n if (fLRUBack) {\n fLRUBack->fNext = nullptr;\n }\n }\n if (nullptr == row->fPrev) {\n SkASSERT(row == fLRUFront);\n fLRUFront = row->fNext;\n if (fLRUFront) {\n fLRUFront->fPrev = nullptr;\n }\n }\n }\n row->fNext = nullptr;\n row->fPrev = nullptr;\n}\n\nint GrTextureStripAtlas::searchByKey(uint32_t key) {\n AtlasRow target;\n target.fKey = key;\n return SkTSearch<const AtlasRow,\n GrTextureStripAtlas::KeyLess>((const AtlasRow**)fKeyTable.begin(),\n fKeyTable.count(),\n &target,\n sizeof(AtlasRow*));\n}\n\n#ifdef SK_DEBUG\nvoid GrTextureStripAtlas::validate() {\n\n \/\/ Our key table should be sorted\n uint32_t prev = 1 > fKeyTable.count() ? 0 : fKeyTable[0]->fKey;\n for (int i = 1; i < fKeyTable.count(); ++i) {\n SkASSERT(prev < fKeyTable[i]->fKey);\n SkASSERT(fKeyTable[i]->fKey != kEmptyAtlasRowKey);\n prev = fKeyTable[i]->fKey;\n }\n\n int lruCount = 0;\n \/\/ Validate LRU pointers, and count LRU entries\n SkASSERT(nullptr == fLRUFront || nullptr == fLRUFront->fPrev);\n SkASSERT(nullptr == fLRUBack || nullptr == fLRUBack->fNext);\n for (AtlasRow* r = fLRUFront; r != nullptr; r = r->fNext) {\n if (nullptr == r->fNext) {\n SkASSERT(r == fLRUBack);\n } else {\n SkASSERT(r->fNext->fPrev == r);\n }\n ++lruCount;\n }\n\n int rowLocks = 0;\n int freeRows = 0;\n\n for (int i = 0; i < fNumRows; ++i) {\n rowLocks += fRows[i].fLocks;\n if (0 == fRows[i].fLocks) {\n ++freeRows;\n bool inLRU = false;\n \/\/ Step through the LRU and make sure it's present\n for (AtlasRow* r = fLRUFront; r != nullptr; r = r->fNext) {\n if (r == &fRows[i]) {\n inLRU = true;\n break;\n }\n }\n SkASSERT(inLRU);\n } else {\n \/\/ If we are locked, we should have a key\n SkASSERT(kEmptyAtlasRowKey != fRows[i].fKey);\n }\n\n \/\/ If we have a key != kEmptyAtlasRowKey, it should be in the key table\n SkASSERT(fRows[i].fKey == kEmptyAtlasRowKey || this->searchByKey(fRows[i].fKey) >= 0);\n }\n\n \/\/ Our count of locks should equal the sum of row locks, unless we ran out of rows and flushed,\n \/\/ in which case we'll have one more lock than recorded in the rows (to represent the pending\n \/\/ lock of a row; which ensures we don't unlock the texture prematurely).\n SkASSERT(rowLocks == fLockedRows || rowLocks + 1 == fLockedRows);\n\n \/\/ We should have one lru entry for each free row\n SkASSERT(freeRows == lruCount);\n\n \/\/ If we have locked rows, we should have a locked texture, otherwise\n \/\/ it should be unlocked\n if (fLockedRows == 0) {\n SkASSERT(!fTexContext);\n } else {\n SkASSERT(fTexContext);\n }\n}\n#endif\n<|endoftext|>"} {"text":"<commit_before>\/****************************************************************************\n**\n** Copyright (C) 2008 Nokia Corporation and\/or its subsidiary(-ies).\n** Contact: Qt Software Information (qt-info@nokia.com)\n**\n** This file is part of the $MODULE$ of the Qt Toolkit.\n**\n** $TROLLTECH_DUAL_EMBEDDED_LICENSE$\n**\n****************************************************************************\/\n\n#include <qglobal.h> \/\/ for Q_WS_WIN define (non-PCH)\n\n#include <QtGui\/qpaintdevice.h>\n#include <private\/qwidget_p.h>\n#include \"qwindowsurface_s60_p.h\"\n#include \"qt_s60_p.h\"\n#include \"private\/qdrawhelper_p.h\"\n\nQT_BEGIN_NAMESPACE\n\nstruct QS60WindowSurfacePrivate\n{\n QImage device;\n CFbsBitmap *bitmap;\n uchar* bytes;\n\n \/\/ Since only one CFbsBitmap is allowed to be locked at a time, this is static.\n static QS60WindowSurface* lockedSurface;\n};\nQS60WindowSurface* QS60WindowSurfacePrivate::lockedSurface = NULL;\n\nQS60WindowSurface::QS60WindowSurface(QWidget* widget)\n : QWindowSurface(widget), d_ptr(new QS60WindowSurfacePrivate)\n{\n d_ptr->bytes = 0;\n d_ptr->bitmap = 0;\n\n TDisplayMode mode = S60->screenDevice()->DisplayMode();\n bool isOpaque = qt_widget_private(widget)->isOpaque;\n if (mode == EColor16MA && isOpaque)\n mode = EColor16MU; \/\/ Faster since 16MU -> 16MA is typically accelerated\n else if (mode == EColor16MU && !isOpaque)\n mode = EColor16MA; \/\/ Try for transparency anyway\n\n\n \/\/ We create empty CFbsBitmap here -> it will be resized in setGeometry\n d_ptr->bitmap = new (ELeave) CFbsBitmap;\n User::LeaveIfError( d_ptr->bitmap->Create(TSize(0, 0), mode ) );\n\n updatePaintDeviceOnBitmap();\n\n setStaticContentsSupport(true);\n}\n\nQS60WindowSurface::~QS60WindowSurface()\n{\n \/\/ Ensure that locking and unlocking of this surface were symmetrical\n Q_ASSERT(QS60WindowSurfacePrivate::lockedSurface != this);\n\n delete d_ptr->bitmap;\n delete d_ptr;\n}\n\nvoid QS60WindowSurface::beginPaint(const QRegion &rgn)\n{\n if(!d_ptr->bitmap)\n return;\n\n Q_ASSERT(!QS60WindowSurfacePrivate::lockedSurface);\n QS60WindowSurfacePrivate::lockedSurface = this;\n lockBitmapHeap();\n\n if (!qt_widget_private(window())->isOpaque) {\n QRgb *data = reinterpret_cast<QRgb *>(d_ptr->device.bits());\n const int row_stride = d_ptr->device.bytesPerLine() \/ 4;\n\n const QVector<QRect> rects = rgn.rects();\n for (QVector<QRect>::const_iterator it = rects.begin(); it != rects.end(); ++it) {\n const int x_start = it->x();\n const int width = it->width();\n\n const int y_start = it->y();\n const int height = it->height();\n\n QRgb *row = data + row_stride * y_start;\n for (int y = 0; y < height; ++y) {\n qt_memfill(row + x_start, 0U, width);\n row += row_stride;\n }\n }\n }\n}\n\nvoid QS60WindowSurface::flush(QWidget *widget, const QRegion ®ion, const QPoint &)\n{\n const QVector<QRect> subRects = region.rects();\n for (int i = 0; i < subRects.count(); ++i) {\n TRect tr = qt_QRect2TRect(subRects[i]);\n widget->winId()->DrawNow(tr);\n }\n}\n\nbool QS60WindowSurface::scroll(const QRegion &area, int dx, int dy)\n{\n QRect rect = area.boundingRect();\n\n if (dx == 0 && dy == 0)\n return false;\n\n if (d_ptr->device.isNull())\n return false;\n\n CFbsBitmapDevice *bitmapDevice = CFbsBitmapDevice::NewL(d_ptr->bitmap);\n CBitmapContext *bitmapContext;\n TInt err = bitmapDevice->CreateBitmapContext(bitmapContext);\n if (err != KErrNone) {\n CBase::Delete(bitmapDevice);\n return false;\n }\n bitmapContext->CopyRect(TPoint(dx, dy), qt_QRect2TRect(rect));\n CBase::Delete(bitmapContext);\n CBase::Delete(bitmapDevice);\n return true;\n}\n\nvoid QS60WindowSurface::endPaint(const QRegion &rgn)\n{\n if(!d_ptr->bitmap)\n return;\n\n Q_ASSERT(QS60WindowSurfacePrivate::lockedSurface);\n unlockBitmapHeap();\n QS60WindowSurfacePrivate::lockedSurface = NULL;\n}\n\nQPaintDevice* QS60WindowSurface::paintDevice()\n{\n return &d_ptr->device;\n}\n\nvoid QS60WindowSurface::setGeometry(const QRect& rect)\n{\n if (rect == geometry())\n return;\n\n TRect nativeRect(qt_QRect2TRect(rect));\n User::LeaveIfError(d_ptr->bitmap->Resize(nativeRect.Size()));\n\n updatePaintDeviceOnBitmap();\n\n QWindowSurface::setGeometry(rect);\n}\n\nvoid QS60WindowSurface::lockBitmapHeap()\n{\n if (!QS60WindowSurfacePrivate::lockedSurface)\n return;\n\n \/\/ Get some local variables to make later code lines more clear to read\n CFbsBitmap*& bitmap = QS60WindowSurfacePrivate::lockedSurface->d_ptr->bitmap;\n QImage& device = QS60WindowSurfacePrivate::lockedSurface->d_ptr->device;\n uchar*& bytes = QS60WindowSurfacePrivate::lockedSurface->d_ptr->bytes;\n\n bitmap->LockHeap();\n uchar *newBytes = (uchar*)bitmap->DataAddress();\n if (newBytes != bytes) {\n bytes = newBytes;\n\n \/\/ Get some values for QImage creation\n TDisplayMode mode = bitmap->DisplayMode();\n if (mode == EColor16MA\n && qt_widget_private(QS60WindowSurfacePrivate::lockedSurface->window())->isOpaque)\n mode = EColor16MU;\n QImage::Format format = qt_TDisplayMode2Format( mode );\n TSize bitmapSize = bitmap->SizeInPixels();\n int bytesPerLine = CFbsBitmap::ScanLineLength( bitmapSize.iWidth, mode);\n\n device = QImage( bytes, bitmapSize.iWidth, bitmapSize.iHeight, bytesPerLine, format );\n }\n}\n\nvoid QS60WindowSurface::unlockBitmapHeap()\n{\n if (!QS60WindowSurfacePrivate::lockedSurface)\n return;\n\n QS60WindowSurfacePrivate::lockedSurface->d_ptr->bitmap->UnlockHeap();\n}\n\nvoid QS60WindowSurface::updatePaintDeviceOnBitmap()\n{\n \/\/ This forces the actual device to be updated based on CFbsBitmap\n beginPaint(QRegion());\n endPaint(QRegion());\n}\n\nCFbsBitmap *QS60WindowSurface::symbianBitmap() const\n{\n return d_ptr->bitmap;\n}\n\nQT_END_NAMESPACE\n<commit_msg>Small optimization when hiding windows.<commit_after>\/****************************************************************************\n**\n** Copyright (C) 2008 Nokia Corporation and\/or its subsidiary(-ies).\n** Contact: Qt Software Information (qt-info@nokia.com)\n**\n** This file is part of the $MODULE$ of the Qt Toolkit.\n**\n** $TROLLTECH_DUAL_EMBEDDED_LICENSE$\n**\n****************************************************************************\/\n\n#include <qglobal.h> \/\/ for Q_WS_WIN define (non-PCH)\n\n#include <QtGui\/qpaintdevice.h>\n#include <private\/qwidget_p.h>\n#include \"qwindowsurface_s60_p.h\"\n#include \"qt_s60_p.h\"\n#include \"private\/qdrawhelper_p.h\"\n\nQT_BEGIN_NAMESPACE\n\nstruct QS60WindowSurfacePrivate\n{\n QImage device;\n CFbsBitmap *bitmap;\n uchar* bytes;\n\n \/\/ Since only one CFbsBitmap is allowed to be locked at a time, this is static.\n static QS60WindowSurface* lockedSurface;\n};\nQS60WindowSurface* QS60WindowSurfacePrivate::lockedSurface = NULL;\n\nQS60WindowSurface::QS60WindowSurface(QWidget* widget)\n : QWindowSurface(widget), d_ptr(new QS60WindowSurfacePrivate)\n{\n d_ptr->bytes = 0;\n d_ptr->bitmap = 0;\n\n TDisplayMode mode = S60->screenDevice()->DisplayMode();\n bool isOpaque = qt_widget_private(widget)->isOpaque;\n if (mode == EColor16MA && isOpaque)\n mode = EColor16MU; \/\/ Faster since 16MU -> 16MA is typically accelerated\n else if (mode == EColor16MU && !isOpaque)\n mode = EColor16MA; \/\/ Try for transparency anyway\n\n\n \/\/ We create empty CFbsBitmap here -> it will be resized in setGeometry\n d_ptr->bitmap = new (ELeave) CFbsBitmap;\n User::LeaveIfError( d_ptr->bitmap->Create(TSize(0, 0), mode ) );\n\n updatePaintDeviceOnBitmap();\n\n setStaticContentsSupport(true);\n}\n\nQS60WindowSurface::~QS60WindowSurface()\n{\n \/\/ Ensure that locking and unlocking of this surface were symmetrical\n Q_ASSERT(QS60WindowSurfacePrivate::lockedSurface != this);\n\n delete d_ptr->bitmap;\n delete d_ptr;\n}\n\nvoid QS60WindowSurface::beginPaint(const QRegion &rgn)\n{\n if(!d_ptr->bitmap)\n return;\n\n Q_ASSERT(!QS60WindowSurfacePrivate::lockedSurface);\n QS60WindowSurfacePrivate::lockedSurface = this;\n lockBitmapHeap();\n\n if (!qt_widget_private(window())->isOpaque) {\n QRgb *data = reinterpret_cast<QRgb *>(d_ptr->device.bits());\n const int row_stride = d_ptr->device.bytesPerLine() \/ 4;\n\n const QVector<QRect> rects = rgn.rects();\n for (QVector<QRect>::const_iterator it = rects.begin(); it != rects.end(); ++it) {\n const int x_start = it->x();\n const int width = it->width();\n\n const int y_start = it->y();\n const int height = it->height();\n\n QRgb *row = data + row_stride * y_start;\n for (int y = 0; y < height; ++y) {\n qt_memfill(row + x_start, 0U, width);\n row += row_stride;\n }\n }\n }\n}\n\nvoid QS60WindowSurface::flush(QWidget *widget, const QRegion ®ion, const QPoint &)\n{\n const QVector<QRect> subRects = region.rects();\n for (int i = 0; i < subRects.count(); ++i) {\n TRect tr = qt_QRect2TRect(subRects[i]);\n widget->winId()->DrawNow(tr);\n }\n}\n\nbool QS60WindowSurface::scroll(const QRegion &area, int dx, int dy)\n{\n QRect rect = area.boundingRect();\n\n if (dx == 0 && dy == 0)\n return false;\n\n if (d_ptr->device.isNull())\n return false;\n\n CFbsBitmapDevice *bitmapDevice = CFbsBitmapDevice::NewL(d_ptr->bitmap);\n CBitmapContext *bitmapContext;\n TInt err = bitmapDevice->CreateBitmapContext(bitmapContext);\n if (err != KErrNone) {\n CBase::Delete(bitmapDevice);\n return false;\n }\n bitmapContext->CopyRect(TPoint(dx, dy), qt_QRect2TRect(rect));\n CBase::Delete(bitmapContext);\n CBase::Delete(bitmapDevice);\n return true;\n}\n\nvoid QS60WindowSurface::endPaint(const QRegion &rgn)\n{\n if(!d_ptr->bitmap)\n return;\n\n Q_ASSERT(QS60WindowSurfacePrivate::lockedSurface);\n unlockBitmapHeap();\n QS60WindowSurfacePrivate::lockedSurface = NULL;\n}\n\nQPaintDevice* QS60WindowSurface::paintDevice()\n{\n return &d_ptr->device;\n}\n\nvoid QS60WindowSurface::setGeometry(const QRect& rect)\n{\n if (rect == geometry())\n return;\n\n QWindowSurface::setGeometry(rect);\n\n TRect nativeRect(qt_QRect2TRect(rect));\n User::LeaveIfError(d_ptr->bitmap->Resize(nativeRect.Size()));\n\n if (!rect.isNull())\n updatePaintDeviceOnBitmap();\n}\n\nvoid QS60WindowSurface::lockBitmapHeap()\n{\n if (!QS60WindowSurfacePrivate::lockedSurface)\n return;\n\n \/\/ Get some local variables to make later code lines more clear to read\n CFbsBitmap*& bitmap = QS60WindowSurfacePrivate::lockedSurface->d_ptr->bitmap;\n QImage& device = QS60WindowSurfacePrivate::lockedSurface->d_ptr->device;\n uchar*& bytes = QS60WindowSurfacePrivate::lockedSurface->d_ptr->bytes;\n\n bitmap->LockHeap();\n uchar *newBytes = (uchar*)bitmap->DataAddress();\n if (newBytes != bytes) {\n bytes = newBytes;\n\n \/\/ Get some values for QImage creation\n TDisplayMode mode = bitmap->DisplayMode();\n if (mode == EColor16MA\n && qt_widget_private(QS60WindowSurfacePrivate::lockedSurface->window())->isOpaque)\n mode = EColor16MU;\n QImage::Format format = qt_TDisplayMode2Format( mode );\n TSize bitmapSize = bitmap->SizeInPixels();\n int bytesPerLine = CFbsBitmap::ScanLineLength( bitmapSize.iWidth, mode);\n\n device = QImage( bytes, bitmapSize.iWidth, bitmapSize.iHeight, bytesPerLine, format );\n }\n}\n\nvoid QS60WindowSurface::unlockBitmapHeap()\n{\n if (!QS60WindowSurfacePrivate::lockedSurface)\n return;\n\n QS60WindowSurfacePrivate::lockedSurface->d_ptr->bitmap->UnlockHeap();\n}\n\nvoid QS60WindowSurface::updatePaintDeviceOnBitmap()\n{\n \/\/ This forces the actual device to be updated based on CFbsBitmap\n beginPaint(QRegion());\n endPaint(QRegion());\n}\n\nCFbsBitmap *QS60WindowSurface::symbianBitmap() const\n{\n return d_ptr->bitmap;\n}\n\nQT_END_NAMESPACE\n<|endoftext|>"} {"text":"<commit_before>\/\/ Copyright (c) 2011 The Chromium Authors. All rights reserved.\n\/\/ Use of this source code is governed by a BSD-style license that can be\n\/\/ found in the LICENSE file.\n\n#include \"base\/path_service.h\"\n#include \"base\/task.h\"\n#include \"chrome\/browser\/ui\/views\/html_dialog_view.h\"\n#include \"chrome\/common\/chrome_paths.h\"\n#include \"chrome\/common\/url_constants.h\"\n#include \"chrome\/test\/in_process_browser_test.h\"\n#include \"chrome\/test\/ui_test_utils.h\"\n#include \"content\/browser\/tab_contents\/navigation_controller.h\"\n#include \"content\/browser\/tab_contents\/tab_contents.h\"\n#include \"content\/browser\/webui\/web_ui.h\"\n#include \"content\/common\/notification_registrar.h\"\n#include \"net\/test\/test_server.h\"\n\nnamespace {\n\ntypedef DOMElementProxy::By By;\n\nclass FileBrowseBrowserTest : public InProcessBrowserTest {\n public:\n FileBrowseBrowserTest() {\n EnableDOMAutomation();\n }\n};\n\nclass FileBrowseUiObserver : public NotificationObserver {\n public:\n FileBrowseUiObserver() : file_browse_tab_(NULL), is_waiting_(false) {\n registrar_.Add(this, NotificationType::LOAD_STOP,\n NotificationService::AllSources());\n registrar_.Add(this, NotificationType::TAB_CONTENTS_DESTROYED,\n NotificationService::AllSources());\n }\n\n void WaitForFileBrowseLoad() {\n if (file_browse_tab_ == NULL) {\n is_waiting_ = true;\n ui_test_utils::RunMessageLoop();\n }\n }\n\n \/\/ File browse tab deletion is a non-nestable task and BrowserTest would\n \/\/ not get related notification because test body runs in a task already.\n \/\/ Uses a periodical check of the dialog window to implement the wait.\n void WaitForFileBrowseClose() {\n if (file_browse_tab_ != NULL) {\n is_waiting_ = true;\n ui_test_utils::RunMessageLoop();\n }\n }\n\n virtual void Observe(NotificationType type,\n const NotificationSource& source,\n const NotificationDetails& details) {\n if (type == NotificationType::LOAD_STOP) {\n NavigationController* controller =\n Source<NavigationController>(source).ptr();\n\n if (controller) {\n TabContents* tab_contents = controller->tab_contents();\n if (tab_contents &&\n tab_contents->GetURL().SchemeIs(chrome::kChromeUIScheme) &&\n tab_contents->GetURL().host() == chrome::kChromeUIFileBrowseHost) {\n file_browse_tab_ = tab_contents;\n\n if (is_waiting_) {\n is_waiting_ = false;\n MessageLoopForUI::current()->Quit();\n }\n }\n }\n } else if (type == NotificationType::TAB_CONTENTS_DESTROYED) {\n TabContents* tab_contents = Source<TabContents>(source).ptr();\n if (file_browse_tab_ == tab_contents) {\n file_browse_tab_ = NULL;\n\n if (is_waiting_) {\n is_waiting_ = false;\n MessageLoopForUI::current()->Quit();\n }\n }\n }\n }\n\n TabContents* file_browse_tab() {\n return file_browse_tab_;\n }\n\n WebUI* file_browse_ui() {\n return file_browse_tab_ ? file_browse_tab_->render_manager()->web_ui() :\n NULL;\n }\n\n private:\n NotificationRegistrar registrar_;\n TabContents* file_browse_tab_;\n bool is_waiting_;\n\n DISALLOW_COPY_AND_ASSIGN(FileBrowseUiObserver);\n};\n\nIN_PROC_BROWSER_TEST_F(FileBrowseBrowserTest, InputFileTriggerFileBrowse) {\n ASSERT_TRUE(test_server()->Start());\n ui_test_utils::NavigateToURL(browser(),\n test_server()->GetURL(\"files\/input_file.html\"));\n\n DOMElementProxyRef doc = ui_test_utils::GetActiveDOMDocument(browser());\n\n DOMElementProxyRef input_file = doc->FindElement(By::Selectors(\".single\"));\n ASSERT_TRUE(input_file);\n\n \/\/ Creates FileBrowseUiObserver before we click.\n FileBrowseUiObserver observer;\n\n \/\/ Click on the input control. This should bring up the FileBrowseUI.\n input_file->Click();\n\n observer.WaitForFileBrowseLoad();\n WebUI* file_browser_ui = observer.file_browse_ui();\n ASSERT_TRUE(file_browser_ui);\n\n file_browser_ui->CallJavascriptFunction(\"dialogCancelClick\");\n\n observer.WaitForFileBrowseClose();\n}\n\n} \/\/ namespace\n<commit_msg>Disabled obsolete test, we should rewrite this to match the new code.<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\/path_service.h\"\n#include \"base\/task.h\"\n#include \"chrome\/browser\/ui\/views\/html_dialog_view.h\"\n#include \"chrome\/common\/chrome_paths.h\"\n#include \"chrome\/common\/url_constants.h\"\n#include \"chrome\/test\/in_process_browser_test.h\"\n#include \"chrome\/test\/ui_test_utils.h\"\n#include \"content\/browser\/tab_contents\/navigation_controller.h\"\n#include \"content\/browser\/tab_contents\/tab_contents.h\"\n#include \"content\/browser\/webui\/web_ui.h\"\n#include \"content\/common\/notification_registrar.h\"\n#include \"net\/test\/test_server.h\"\n\nnamespace {\n\ntypedef DOMElementProxy::By By;\n\nclass FileBrowseBrowserTest : public InProcessBrowserTest {\n public:\n FileBrowseBrowserTest() {\n EnableDOMAutomation();\n }\n};\n\nclass FileBrowseUiObserver : public NotificationObserver {\n public:\n FileBrowseUiObserver() : file_browse_tab_(NULL), is_waiting_(false) {\n registrar_.Add(this, NotificationType::LOAD_STOP,\n NotificationService::AllSources());\n registrar_.Add(this, NotificationType::TAB_CONTENTS_DESTROYED,\n NotificationService::AllSources());\n }\n\n void WaitForFileBrowseLoad() {\n if (file_browse_tab_ == NULL) {\n is_waiting_ = true;\n ui_test_utils::RunMessageLoop();\n }\n }\n\n \/\/ File browse tab deletion is a non-nestable task and BrowserTest would\n \/\/ not get related notification because test body runs in a task already.\n \/\/ Uses a periodical check of the dialog window to implement the wait.\n void WaitForFileBrowseClose() {\n if (file_browse_tab_ != NULL) {\n is_waiting_ = true;\n ui_test_utils::RunMessageLoop();\n }\n }\n\n virtual void Observe(NotificationType type,\n const NotificationSource& source,\n const NotificationDetails& details) {\n if (type == NotificationType::LOAD_STOP) {\n NavigationController* controller =\n Source<NavigationController>(source).ptr();\n\n if (controller) {\n TabContents* tab_contents = controller->tab_contents();\n if (tab_contents &&\n tab_contents->GetURL().SchemeIs(chrome::kChromeUIScheme) &&\n tab_contents->GetURL().host() == chrome::kChromeUIFileBrowseHost) {\n file_browse_tab_ = tab_contents;\n\n if (is_waiting_) {\n is_waiting_ = false;\n MessageLoopForUI::current()->Quit();\n }\n }\n }\n } else if (type == NotificationType::TAB_CONTENTS_DESTROYED) {\n TabContents* tab_contents = Source<TabContents>(source).ptr();\n if (file_browse_tab_ == tab_contents) {\n file_browse_tab_ = NULL;\n\n if (is_waiting_) {\n is_waiting_ = false;\n MessageLoopForUI::current()->Quit();\n }\n }\n }\n }\n\n TabContents* file_browse_tab() {\n return file_browse_tab_;\n }\n\n WebUI* file_browse_ui() {\n return file_browse_tab_ ? file_browse_tab_->render_manager()->web_ui() :\n NULL;\n }\n\n private:\n NotificationRegistrar registrar_;\n TabContents* file_browse_tab_;\n bool is_waiting_;\n\n DISALLOW_COPY_AND_ASSIGN(FileBrowseUiObserver);\n};\n\nIN_PROC_BROWSER_TEST_F(FileBrowseBrowserTest,\n DISABLED_InputFileTriggerFileBrowse) {\n ASSERT_TRUE(test_server()->Start());\n ui_test_utils::NavigateToURL(browser(),\n test_server()->GetURL(\"files\/input_file.html\"));\n\n DOMElementProxyRef doc = ui_test_utils::GetActiveDOMDocument(browser());\n\n DOMElementProxyRef input_file = doc->FindElement(By::Selectors(\".single\"));\n ASSERT_TRUE(input_file);\n\n \/\/ Creates FileBrowseUiObserver before we click.\n FileBrowseUiObserver observer;\n\n \/\/ Click on the input control. This should bring up the FileBrowseUI.\n input_file->Click();\n\n observer.WaitForFileBrowseLoad();\n WebUI* file_browser_ui = observer.file_browse_ui();\n ASSERT_TRUE(file_browser_ui);\n\n file_browser_ui->CallJavascriptFunction(\"dialogCancelClick\");\n\n observer.WaitForFileBrowseClose();\n}\n\n} \/\/ namespace\n<|endoftext|>"} {"text":"<commit_before>\/*\n * Copyright (c) 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 \"utility\/test\/Test_Timer.h\"\n#include \"utility\/oskar_timer_functions.h\"\n\nvoid Test_Timer::test()\n{\n oskar_Timer t_cuda, t_omp, t_native;\n oskar_timer_create(&t_native, OSKAR_TIMER_NATIVE);\n oskar_timer_create(&t_cuda, OSKAR_TIMER_CUDA);\n oskar_timer_create(&t_omp, OSKAR_TIMER_OMP);\n\n \/\/ Time a sleep(1).\n oskar_timer_resume(&t_native);\n oskar_timer_resume(&t_cuda);\n oskar_timer_resume(&t_omp);\n sleep(1);\n oskar_timer_pause(&t_native);\n oskar_timer_pause(&t_cuda);\n oskar_timer_pause(&t_omp);\n\n \/\/ Don't time this sleep.\n sleep(1);\n\n \/\/ Time another sleep(1).\n oskar_timer_resume(&t_native);\n oskar_timer_resume(&t_cuda);\n oskar_timer_resume(&t_omp);\n sleep(1);\n oskar_timer_pause(&t_native);\n oskar_timer_pause(&t_cuda);\n oskar_timer_pause(&t_omp);\n\n double elapsed_native = oskar_timer_elapsed(&t_native);\n double elapsed_cuda = oskar_timer_elapsed(&t_cuda);\n double elapsed_omp = oskar_timer_elapsed(&t_omp);\n\/\/ printf(\"Timings -- Native: %.5f, CUDA: %.5f, OpenMP: %.5f\\n\",\n\/\/ elapsed_native, elapsed_cuda, elapsed_omp);\n CPPUNIT_ASSERT_DOUBLES_EQUAL(elapsed_native, elapsed_cuda, 5e-3);\n CPPUNIT_ASSERT_DOUBLES_EQUAL(elapsed_native, elapsed_omp, 5e-3);\n CPPUNIT_ASSERT_DOUBLES_EQUAL(2.0, elapsed_native, 1e-2);\n CPPUNIT_ASSERT_DOUBLES_EQUAL(2.0, elapsed_cuda, 1e-2);\n CPPUNIT_ASSERT_DOUBLES_EQUAL(2.0, elapsed_omp, 1e-2);\n\n oskar_timer_destroy(&t_native);\n oskar_timer_destroy(&t_cuda);\n oskar_timer_destroy(&t_omp);\n}\n\nvoid Test_Timer::test_performance()\n{\n oskar_Timer t_native, t_cuda, t_omp, t;\n oskar_timer_create(&t, OSKAR_TIMER_NATIVE);\n oskar_timer_create(&t_native, OSKAR_TIMER_NATIVE);\n oskar_timer_create(&t_cuda, OSKAR_TIMER_CUDA);\n oskar_timer_create(&t_omp, OSKAR_TIMER_OMP);\n int runs = 1000;\n printf(\"\\n\");\n\n oskar_timer_start(&t);\n for (int i = 0; i < runs; ++i)\n {\n oskar_timer_resume(&t_cuda);\n oskar_timer_pause(&t_cuda);\n }\n printf(\" CUDA timer overhead: %.4e s.\\n\", oskar_timer_elapsed(&t) \/ runs);\n\n oskar_timer_start(&t);\n for (int i = 0; i < runs; ++i)\n {\n oskar_timer_resume(&t_omp);\n oskar_timer_pause(&t_omp);\n }\n printf(\"OpenMP timer overhead: %.4e s.\\n\", oskar_timer_elapsed(&t) \/ runs);\n\n oskar_timer_start(&t);\n for (int i = 0; i < runs; ++i)\n {\n oskar_timer_resume(&t_native);\n oskar_timer_pause(&t_native);\n }\n printf(\"Native timer overhead: %.4e s.\\n\", oskar_timer_elapsed(&t) \/ runs);\n\n oskar_timer_destroy(&t);\n oskar_timer_destroy(&t_native);\n oskar_timer_destroy(&t_cuda);\n oskar_timer_destroy(&t_omp);\n}\n<commit_msg>added header for the sleep function - needed for g++-4.7<commit_after>\/*\n * Copyright (c) 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 \"utility\/test\/Test_Timer.h\"\n#include \"utility\/oskar_timer_functions.h\"\n#include <unistd.h> \/\/ Note: this is a GNU compiler only header and needed\n \/\/ for sleep() for some versions of g++ (tested with v 4.7)\n \/\/ On windows this function is defined in windows.h\n \/\/ with an argument in milliseconds rather than seconds.\n\nvoid Test_Timer::test()\n{\n oskar_Timer t_cuda, t_omp, t_native;\n oskar_timer_create(&t_native, OSKAR_TIMER_NATIVE);\n oskar_timer_create(&t_cuda, OSKAR_TIMER_CUDA);\n oskar_timer_create(&t_omp, OSKAR_TIMER_OMP);\n\n \/\/ Time a sleep(1).\n oskar_timer_resume(&t_native);\n oskar_timer_resume(&t_cuda);\n oskar_timer_resume(&t_omp);\n sleep(1);\n oskar_timer_pause(&t_native);\n oskar_timer_pause(&t_cuda);\n oskar_timer_pause(&t_omp);\n\n \/\/ Don't time this sleep.\n sleep(1);\n\n \/\/ Time another sleep(1).\n oskar_timer_resume(&t_native);\n oskar_timer_resume(&t_cuda);\n oskar_timer_resume(&t_omp);\n sleep(1);\n oskar_timer_pause(&t_native);\n oskar_timer_pause(&t_cuda);\n oskar_timer_pause(&t_omp);\n\n double elapsed_native = oskar_timer_elapsed(&t_native);\n double elapsed_cuda = oskar_timer_elapsed(&t_cuda);\n double elapsed_omp = oskar_timer_elapsed(&t_omp);\n\/\/ printf(\"Timings -- Native: %.5f, CUDA: %.5f, OpenMP: %.5f\\n\",\n\/\/ elapsed_native, elapsed_cuda, elapsed_omp);\n CPPUNIT_ASSERT_DOUBLES_EQUAL(elapsed_native, elapsed_cuda, 5e-3);\n CPPUNIT_ASSERT_DOUBLES_EQUAL(elapsed_native, elapsed_omp, 5e-3);\n CPPUNIT_ASSERT_DOUBLES_EQUAL(2.0, elapsed_native, 1e-2);\n CPPUNIT_ASSERT_DOUBLES_EQUAL(2.0, elapsed_cuda, 1e-2);\n CPPUNIT_ASSERT_DOUBLES_EQUAL(2.0, elapsed_omp, 1e-2);\n\n oskar_timer_destroy(&t_native);\n oskar_timer_destroy(&t_cuda);\n oskar_timer_destroy(&t_omp);\n}\n\nvoid Test_Timer::test_performance()\n{\n oskar_Timer t_native, t_cuda, t_omp, t;\n oskar_timer_create(&t, OSKAR_TIMER_NATIVE);\n oskar_timer_create(&t_native, OSKAR_TIMER_NATIVE);\n oskar_timer_create(&t_cuda, OSKAR_TIMER_CUDA);\n oskar_timer_create(&t_omp, OSKAR_TIMER_OMP);\n int runs = 1000;\n printf(\"\\n\");\n\n oskar_timer_start(&t);\n for (int i = 0; i < runs; ++i)\n {\n oskar_timer_resume(&t_cuda);\n oskar_timer_pause(&t_cuda);\n }\n printf(\" CUDA timer overhead: %.4e s.\\n\", oskar_timer_elapsed(&t) \/ runs);\n\n oskar_timer_start(&t);\n for (int i = 0; i < runs; ++i)\n {\n oskar_timer_resume(&t_omp);\n oskar_timer_pause(&t_omp);\n }\n printf(\"OpenMP timer overhead: %.4e s.\\n\", oskar_timer_elapsed(&t) \/ runs);\n\n oskar_timer_start(&t);\n for (int i = 0; i < runs; ++i)\n {\n oskar_timer_resume(&t_native);\n oskar_timer_pause(&t_native);\n }\n printf(\"Native timer overhead: %.4e s.\\n\", oskar_timer_elapsed(&t) \/ runs);\n\n oskar_timer_destroy(&t);\n oskar_timer_destroy(&t_native);\n oskar_timer_destroy(&t_cuda);\n oskar_timer_destroy(&t_omp);\n}\n<|endoftext|>"} {"text":"<commit_before>#include <QString>\n#include <QDebug>\n\n#include \"qdeclarativeorganizeritem_p.h\"\n#include \"qorganizeritemdetails.h\"\n#include \"qdeclarativeorganizeritemdetail_p.h\"\n#include \"qdeclarativeorganizeritemmetaobject_p.h\"\n\nQTM_USE_NAMESPACE\nstatic OrganizerItemDetailNameMap qt_organizerItemDetailNameMap[] = {\n {\"\", \"\", false}\n};\n\nQDeclarativeOrganizerItemMetaObject::QDeclarativeOrganizerItemMetaObject(QObject* obj, const QOrganizerItem& item)\n :QDeclarativeOpenMetaObject(obj)\n{\n setItem(item);\n}\n\nQDeclarativeOrganizerItemMetaObject::~QDeclarativeOrganizerItemMetaObject()\n{\n\n}\n\nvoid QDeclarativeOrganizerItemMetaObject::getValue(int propId, void **a)\n{\n qDebug() << \"value for propId:\" << propId;\n OrganizerItemDetailNameMap* detailMetaData = m_properties.value(propId);\n if (detailMetaData) {\n if (detailMetaData->group) {\n qDebug() << \"name:\" << detailMetaData->name;\n *reinterpret_cast< QDeclarativeListProperty<QDeclarativeOrganizerItemDetail>* >(a[0]) =\n QDeclarativeListProperty<QDeclarativeOrganizerItemDetail>(object(), detailMetaData, detail_append, detail_count, detail_at, detail_clear);\n\n } else {\n foreach(QDeclarativeOrganizerItemDetail* cd, m_details) {\n if (cd->detail().definitionName() == detailMetaData->definitionName) {\n *reinterpret_cast<QVariant *>(a[0]) = QVariant::fromValue(cd);\n }\n }\n }\n }\n\n}\n\nvoid QDeclarativeOrganizerItemMetaObject::setValue(int propId, void **a)\n{\n OrganizerItemDetailNameMap* detailMetaData = m_properties.value(propId);\n if (detailMetaData) {\n if (!detailMetaData->group) {\n QVariant& v = *reinterpret_cast<QVariant *>(a[0]);\n QDeclarativeOrganizerItemDetail* detail = v.value<QDeclarativeOrganizerItemDetail*>();\n\n foreach(QDeclarativeOrganizerItemDetail* cd, m_details) {\n if (cd->detail().definitionName() == detailMetaData->definitionName) {\n delete cd;\n cd = detail;\n }\n }\n }\n }\n}\n\nint QDeclarativeOrganizerItemMetaObject::createProperty(const char * name, const char *)\n{\n\n const int detailCount = sizeof(qt_organizerItemDetailNameMap)\/sizeof(OrganizerItemDetailNameMap);\n OrganizerItemDetailNameMap* detailMetaData = 0;\n\n for (int i = 0; i < detailCount; i++) {\n if (QString::fromLocal8Bit(qt_organizerItemDetailNameMap[i].name) == QString::fromLocal8Bit(name)) {\n detailMetaData = &qt_organizerItemDetailNameMap[i];\n break;\n }\n }\n\n if (detailMetaData) {\n int propId = -1;\n if (detailMetaData->group)\n propId = QDeclarativeOpenMetaObject::createProperty(name, \"QDeclarativeListProperty<QDeclarativeOrganizerItemDetail>\");\n else\n propId = QDeclarativeOpenMetaObject::createProperty(name, \"QVariant\");\n m_properties.insert(propId, detailMetaData);\n qDebug() << \"createProperty:\" << name << \"propId:\" << propId;\n return propId;\n }\n return -1;\n}\n\n\nQVariant QDeclarativeOrganizerItemMetaObject::detail(const QString& name)\n{\n int propId = indexOfProperty(name.toLatin1());\n\n if (propId > 0)\n return property(propId).read(object());\n\n \/\/Assume it's a detail definition name\n foreach(QDeclarativeOrganizerItemDetail* cd, m_details) {\n if (cd->detail().definitionName() == name) {\n return QVariant::fromValue(cd);\n }\n }\n return QVariant();\n}\n\nQVariant QDeclarativeOrganizerItemMetaObject::details(const QString& name)\n{\n if (name.isEmpty()) {\n \/\/return all\n return QVariant::fromValue(QDeclarativeListProperty<QDeclarativeOrganizerItemDetail>(object(), m_details));\n } else {\n int propId = indexOfProperty(name.toLatin1());\n if (propId > 0)\n return property(propId).read(object());\n\n \/\/Assume it's a detail definition name\n \/\/TODO::customized details\n for (QHash<int, OrganizerItemDetailNameMap*>::ConstIterator iter = m_properties.constBegin(); iter != m_properties.constEnd(); iter++) {\n if (iter.value()->group && iter.value()->definitionName == name)\n return property(iter.key()).read(object());\n }\n }\n return QVariant();\n}\n\nvoid QDeclarativeOrganizerItemMetaObject::setItem(const QOrganizerItem& contact)\n{\n m_item = contact;\n QList<QOrganizerItemDetail> details = m_item.details();\n m_details.clear();\n foreach (const QOrganizerItemDetail& detail, details) {\n QDeclarativeOrganizerItemDetail* cd = new QDeclarativeOrganizerItemDetail(object());\n\n cd->connect(cd, SIGNAL(fieldsChanged()), object(), SIGNAL(detailsChanged()));\n\n cd->setDetail(detail);\n m_details.append(cd);\n }\n}\n\nQOrganizerItem QDeclarativeOrganizerItemMetaObject::item()\n{\n m_item.clearDetails();\n foreach ( QDeclarativeOrganizerItemDetail* cd, m_details) {\n QOrganizerItemDetail detail = cd->detail();\n m_item.saveDetail(&detail);\n }\n return m_item;\n}\n\nuint QDeclarativeOrganizerItemMetaObject::localId() const\n{\n return qHash(m_item.localId());\n}\n\nuint QDeclarativeOrganizerItemMetaObject::itemId() const\n{\n return qHash(m_item.id());\n}\n\n\nvoid QDeclarativeOrganizerItemMetaObject::detail_append(QDeclarativeListProperty<QDeclarativeOrganizerItemDetail> *p, QDeclarativeOrganizerItemDetail *detail)\n{\n OrganizerItemDetailNameMap* data = (OrganizerItemDetailNameMap*)(p->data);\n if (data) {\n QDeclarativeOrganizerItem* dc = qobject_cast<QDeclarativeOrganizerItem*>(p->object);\n if (dc && detail->detail().definitionName() == data->definitionName) {\n detail->connect(detail, SIGNAL(fieldsChanged()), dc, SIGNAL(detailsChanged()));\n dc->d->m_details.append(detail);\n }\n }\n}\n\nint QDeclarativeOrganizerItemMetaObject::detail_count(QDeclarativeListProperty<QDeclarativeOrganizerItemDetail> *p)\n{\n OrganizerItemDetailNameMap* data = (OrganizerItemDetailNameMap*)(p->data);\n int count = 0;\n QDeclarativeOrganizerItem* dc = qobject_cast<QDeclarativeOrganizerItem*>(p->object);\n if (dc && data) {\n foreach(QDeclarativeOrganizerItemDetail* detail, dc->d->m_details) {\n if (detail->detail().definitionName() == data->definitionName)\n count++;\n }\n }\n return count;\n}\n\nQDeclarativeOrganizerItemDetail * QDeclarativeOrganizerItemMetaObject::detail_at(QDeclarativeListProperty<QDeclarativeOrganizerItemDetail> *p, int idx)\n{\n OrganizerItemDetailNameMap* data = (OrganizerItemDetailNameMap*)(p->data);\n QDeclarativeOrganizerItemDetail* detail = 0;\n QDeclarativeOrganizerItem* dc = qobject_cast<QDeclarativeOrganizerItem*>(p->object);\n if (dc && data) {\n int i = 0;\n foreach(QDeclarativeOrganizerItemDetail* cd,dc->d->m_details) {\n if (cd->detail().definitionName() == data->definitionName) {\n if (i == idx) {\n detail = cd;\n break;\n } else {\n i++;\n }\n }\n }\n }\n return detail;\n}\n\nvoid QDeclarativeOrganizerItemMetaObject::detail_clear(QDeclarativeListProperty<QDeclarativeOrganizerItemDetail> *p)\n{\n OrganizerItemDetailNameMap* data = (OrganizerItemDetailNameMap*)(p->data);\n QDeclarativeOrganizerItem* dc = qobject_cast<QDeclarativeOrganizerItem*>(p->object);\n if (dc && data) {\n foreach(QDeclarativeOrganizerItemDetail* cd, dc->d->m_details) {\n if (cd->detail().definitionName() == data->definitionName) {\n dc->d->m_details.removeAll(cd);\n }\n }\n }\n}\n<commit_msg>organizer declarative plugin:register item detail names and detail group names which could be accessed from qml<commit_after>#include <QString>\n#include <QDebug>\n\n#include \"qdeclarativeorganizeritem_p.h\"\n#include \"qorganizeritemdetails.h\"\n#include \"qdeclarativeorganizeritemdetail_p.h\"\n#include \"qdeclarativeorganizeritemmetaobject_p.h\"\n\nQTM_USE_NAMESPACE\n#define Q_DECLARATIVE_ORGANIZER_ITEM_DETAILNAME(classname) \\\n {QDeclarativeOrganizer##classname::DetailName.latin1(), QOrganizer##classname::DefinitionName.latin1(), false}\n\n#define Q_DECLARATIVE_ORGANIZER_ITEM_DETAILGROUPNAME(classname) \\\n {QDeclarativeOrganizer##classname::DetailGroupName.latin1(), QOrganizer##classname::DefinitionName.latin1(), true}\n\nstatic OrganizerItemDetailNameMap qt_organizerItemDetailNameMap[] = {\n Q_DECLARATIVE_ORGANIZER_ITEM_DETAILNAME(EventTimeRange),\n Q_DECLARATIVE_ORGANIZER_ITEM_DETAILNAME(ItemComment),\n Q_DECLARATIVE_ORGANIZER_ITEM_DETAILGROUPNAME(ItemComment),\n Q_DECLARATIVE_ORGANIZER_ITEM_DETAILNAME(ItemDescription),\n Q_DECLARATIVE_ORGANIZER_ITEM_DETAILNAME(ItemDisplayLabel),\n Q_DECLARATIVE_ORGANIZER_ITEM_DETAILNAME(ItemGuid),\n Q_DECLARATIVE_ORGANIZER_ITEM_DETAILNAME(ItemInstanceOrigin),\n Q_DECLARATIVE_ORGANIZER_ITEM_DETAILNAME(ItemLocation),\n Q_DECLARATIVE_ORGANIZER_ITEM_DETAILNAME(ItemPriority),\n Q_DECLARATIVE_ORGANIZER_ITEM_DETAILNAME(ItemRecurrence),\n Q_DECLARATIVE_ORGANIZER_ITEM_DETAILNAME(ItemReminder),\n Q_DECLARATIVE_ORGANIZER_ITEM_DETAILGROUPNAME(ItemReminder),\n Q_DECLARATIVE_ORGANIZER_ITEM_DETAILNAME(ItemAudibleReminder),\n Q_DECLARATIVE_ORGANIZER_ITEM_DETAILGROUPNAME(ItemAudibleReminder),\n Q_DECLARATIVE_ORGANIZER_ITEM_DETAILNAME(ItemVisualReminder),\n Q_DECLARATIVE_ORGANIZER_ITEM_DETAILGROUPNAME(ItemVisualReminder),\n Q_DECLARATIVE_ORGANIZER_ITEM_DETAILNAME(ItemEmailReminder),\n Q_DECLARATIVE_ORGANIZER_ITEM_DETAILGROUPNAME(ItemEmailReminder),\n Q_DECLARATIVE_ORGANIZER_ITEM_DETAILNAME(ItemTimestamp),\n Q_DECLARATIVE_ORGANIZER_ITEM_DETAILNAME(ItemType),\n Q_DECLARATIVE_ORGANIZER_ITEM_DETAILNAME(JournalTimeRange),\n Q_DECLARATIVE_ORGANIZER_ITEM_DETAILNAME(TodoProgress),\n Q_DECLARATIVE_ORGANIZER_ITEM_DETAILNAME(TodoTimeRange)\n};\n\nQDeclarativeOrganizerItemMetaObject::QDeclarativeOrganizerItemMetaObject(QObject* obj, const QOrganizerItem& item)\n :QDeclarativeOpenMetaObject(obj)\n{\n setItem(item);\n}\n\nQDeclarativeOrganizerItemMetaObject::~QDeclarativeOrganizerItemMetaObject()\n{\n\n}\n\nvoid QDeclarativeOrganizerItemMetaObject::getValue(int propId, void **a)\n{\n qDebug() << \"value for propId:\" << propId;\n OrganizerItemDetailNameMap* detailMetaData = m_properties.value(propId);\n if (detailMetaData) {\n if (detailMetaData->group) {\n qDebug() << \"name:\" << detailMetaData->name;\n *reinterpret_cast< QDeclarativeListProperty<QDeclarativeOrganizerItemDetail>* >(a[0]) =\n QDeclarativeListProperty<QDeclarativeOrganizerItemDetail>(object(), detailMetaData, detail_append, detail_count, detail_at, detail_clear);\n\n } else {\n foreach(QDeclarativeOrganizerItemDetail* cd, m_details) {\n if (cd->detail().definitionName() == detailMetaData->definitionName) {\n *reinterpret_cast<QVariant *>(a[0]) = QVariant::fromValue(cd);\n }\n }\n }\n }\n\n}\n\nvoid QDeclarativeOrganizerItemMetaObject::setValue(int propId, void **a)\n{\n OrganizerItemDetailNameMap* detailMetaData = m_properties.value(propId);\n if (detailMetaData) {\n if (!detailMetaData->group) {\n QVariant& v = *reinterpret_cast<QVariant *>(a[0]);\n QDeclarativeOrganizerItemDetail* detail = v.value<QDeclarativeOrganizerItemDetail*>();\n\n foreach(QDeclarativeOrganizerItemDetail* cd, m_details) {\n if (cd->detail().definitionName() == detailMetaData->definitionName) {\n delete cd;\n cd = detail;\n }\n }\n }\n }\n}\n\nint QDeclarativeOrganizerItemMetaObject::createProperty(const char * name, const char *)\n{\n\n const int detailCount = sizeof(qt_organizerItemDetailNameMap)\/sizeof(OrganizerItemDetailNameMap);\n OrganizerItemDetailNameMap* detailMetaData = 0;\n\n for (int i = 0; i < detailCount; i++) {\n if (QString::fromLocal8Bit(qt_organizerItemDetailNameMap[i].name) == QString::fromLocal8Bit(name)) {\n detailMetaData = &qt_organizerItemDetailNameMap[i];\n break;\n }\n }\n\n if (detailMetaData) {\n int propId = -1;\n if (detailMetaData->group)\n propId = QDeclarativeOpenMetaObject::createProperty(name, \"QDeclarativeListProperty<QDeclarativeOrganizerItemDetail>\");\n else\n propId = QDeclarativeOpenMetaObject::createProperty(name, \"QVariant\");\n m_properties.insert(propId, detailMetaData);\n qDebug() << \"createProperty:\" << name << \"propId:\" << propId;\n return propId;\n }\n return -1;\n}\n\n\nQVariant QDeclarativeOrganizerItemMetaObject::detail(const QString& name)\n{\n int propId = indexOfProperty(name.toLatin1());\n\n if (propId > 0)\n return property(propId).read(object());\n\n \/\/Assume it's a detail definition name\n foreach(QDeclarativeOrganizerItemDetail* cd, m_details) {\n if (cd->detail().definitionName() == name) {\n return QVariant::fromValue(cd);\n }\n }\n return QVariant();\n}\n\nQVariant QDeclarativeOrganizerItemMetaObject::details(const QString& name)\n{\n if (name.isEmpty()) {\n \/\/return all\n return QVariant::fromValue(QDeclarativeListProperty<QDeclarativeOrganizerItemDetail>(object(), m_details));\n } else {\n int propId = indexOfProperty(name.toLatin1());\n if (propId > 0)\n return property(propId).read(object());\n\n \/\/Assume it's a detail definition name\n \/\/TODO::customized details\n for (QHash<int, OrganizerItemDetailNameMap*>::ConstIterator iter = m_properties.constBegin(); iter != m_properties.constEnd(); iter++) {\n if (iter.value()->group && iter.value()->definitionName == name)\n return property(iter.key()).read(object());\n }\n }\n return QVariant();\n}\n\nvoid QDeclarativeOrganizerItemMetaObject::setItem(const QOrganizerItem& contact)\n{\n m_item = contact;\n QList<QOrganizerItemDetail> details = m_item.details();\n m_details.clear();\n foreach (const QOrganizerItemDetail& detail, details) {\n QDeclarativeOrganizerItemDetail* cd = new QDeclarativeOrganizerItemDetail(object());\n\n cd->connect(cd, SIGNAL(fieldsChanged()), object(), SIGNAL(detailsChanged()));\n\n cd->setDetail(detail);\n m_details.append(cd);\n }\n}\n\nQOrganizerItem QDeclarativeOrganizerItemMetaObject::item()\n{\n m_item.clearDetails();\n foreach ( QDeclarativeOrganizerItemDetail* cd, m_details) {\n QOrganizerItemDetail detail = cd->detail();\n m_item.saveDetail(&detail);\n }\n return m_item;\n}\n\nuint QDeclarativeOrganizerItemMetaObject::localId() const\n{\n return qHash(m_item.localId());\n}\n\nuint QDeclarativeOrganizerItemMetaObject::itemId() const\n{\n return qHash(m_item.id());\n}\n\n\nvoid QDeclarativeOrganizerItemMetaObject::detail_append(QDeclarativeListProperty<QDeclarativeOrganizerItemDetail> *p, QDeclarativeOrganizerItemDetail *detail)\n{\n OrganizerItemDetailNameMap* data = (OrganizerItemDetailNameMap*)(p->data);\n if (data) {\n QDeclarativeOrganizerItem* dc = qobject_cast<QDeclarativeOrganizerItem*>(p->object);\n if (dc && detail->detail().definitionName() == data->definitionName) {\n detail->connect(detail, SIGNAL(fieldsChanged()), dc, SIGNAL(detailsChanged()));\n dc->d->m_details.append(detail);\n }\n }\n}\n\nint QDeclarativeOrganizerItemMetaObject::detail_count(QDeclarativeListProperty<QDeclarativeOrganizerItemDetail> *p)\n{\n OrganizerItemDetailNameMap* data = (OrganizerItemDetailNameMap*)(p->data);\n int count = 0;\n QDeclarativeOrganizerItem* dc = qobject_cast<QDeclarativeOrganizerItem*>(p->object);\n if (dc && data) {\n foreach(QDeclarativeOrganizerItemDetail* detail, dc->d->m_details) {\n if (detail->detail().definitionName() == data->definitionName)\n count++;\n }\n }\n return count;\n}\n\nQDeclarativeOrganizerItemDetail * QDeclarativeOrganizerItemMetaObject::detail_at(QDeclarativeListProperty<QDeclarativeOrganizerItemDetail> *p, int idx)\n{\n OrganizerItemDetailNameMap* data = (OrganizerItemDetailNameMap*)(p->data);\n QDeclarativeOrganizerItemDetail* detail = 0;\n QDeclarativeOrganizerItem* dc = qobject_cast<QDeclarativeOrganizerItem*>(p->object);\n if (dc && data) {\n int i = 0;\n foreach(QDeclarativeOrganizerItemDetail* cd,dc->d->m_details) {\n if (cd->detail().definitionName() == data->definitionName) {\n if (i == idx) {\n detail = cd;\n break;\n } else {\n i++;\n }\n }\n }\n }\n return detail;\n}\n\nvoid QDeclarativeOrganizerItemMetaObject::detail_clear(QDeclarativeListProperty<QDeclarativeOrganizerItemDetail> *p)\n{\n OrganizerItemDetailNameMap* data = (OrganizerItemDetailNameMap*)(p->data);\n QDeclarativeOrganizerItem* dc = qobject_cast<QDeclarativeOrganizerItem*>(p->object);\n if (dc && data) {\n foreach(QDeclarativeOrganizerItemDetail* cd, dc->d->m_details) {\n if (cd->detail().definitionName() == data->definitionName) {\n dc->d->m_details.removeAll(cd);\n }\n }\n }\n}\n<|endoftext|>"} {"text":"<commit_before>\/\/ Copyright (c) 2010-2022, Lawrence Livermore National Security, LLC. Produced\n\/\/ at the Lawrence Livermore National Laboratory. All Rights reserved. See files\n\/\/ LICENSE and NOTICE for details. LLNL-CODE-806117.\n\/\/\n\/\/ This file is part of the MFEM library. For more information and source code\n\/\/ availability visit https:\/\/mfem.org.\n\/\/\n\/\/ MFEM is free software; you can redistribute it and\/or modify it under the\n\/\/ terms of the BSD-3 license. We welcome feedback and contributions, see file\n\/\/ CONTRIBUTING.md for details.\n\n#ifndef MFEM_ELASTICITY_MAT_NEOHOOKEAN_HPP\n#define MFEM_ELASTICITY_MAT_NEOHOOKEAN_HPP\n\n#include \"general\/enzyme.hpp\"\n#include \"gradient_type.hpp\"\n#include \"linalg\/tensor.hpp\"\n#include \"mfem.hpp\"\n\nusing mfem::internal::tensor;\nusing mfem::internal::make_tensor;\n\n\/**\n * @brief Neo-Hookean material\n *\n * Defines a Neo-Hookean material response. It satisfies the material_type\n * interface for ElasticityOperator::SetMaterial. This material type allows\n * choosing the method of derivative calculation in `action_of_gradient`.\n * Choices include methods derived by hand using symbolic calculation and a\n * variety of automatically computed gradient applications, like\n * - Enzyme forward mode\n * - Enzyme reverse mode\n * - Dual number type forward mode\n * - Finite difference mode\n *\n * @tparam dim\n * @tparam gradient_type\n *\/\ntemplate <int dim = 3, GradientType gradient_type = GradientType::Symbolic>\nstruct NeoHookeanMaterial\n{\n static_assert(dim == 3, \"NeoHookean model currently implemented only in 3D\");\n\n \/**\n * @brief Compute the stress response.\n *\n * @param[in] dudx derivative of the displacement\n * @return\n *\/\n template <typename T>\n MFEM_HOST_DEVICE tensor<T, dim, dim>\n stress(const tensor<T, dim, dim> &__restrict__ dudx) const\n {\n constexpr auto I = mfem::internal::IsotropicIdentity<dim>();\n T J = det(I + dudx);\n T p = -2.0 * D1 * J * (J - 1);\n auto devB = dev(dudx + transpose(dudx) + dot(dudx, transpose(dudx)));\n auto sigma = -(p \/ J) * I + 2 * (C1 \/ pow(J, 5.0 \/ 3.0)) * devB;\n return sigma;\n }\n\n \/**\n * @brief A method to wrap the stress calculation into a static function.\n *\n * This is necessary for Enzyme to access the class pointer (self).\n *\n * @param[in] self\n * @param[in] dudx\n * @param[in] sigma\n * @return stress\n *\/\n MFEM_HOST_DEVICE static void\n stress_wrapper(NeoHookeanMaterial<dim, gradient_type> *self,\n tensor<double, dim, dim> &dudx,\n tensor<double, dim, dim> &sigma)\n {\n sigma = self->stress(dudx);\n }\n\n \/**\n * @brief Compute the gradient.\n *\n * This method is used in the ElasticityDiagonalPreconditioner type to\n * compute the gradient matrix entries of the current quadrature point,\n * instead of the action.\n *\n * @param[in] dudx\n * @return\n *\/\n MFEM_HOST_DEVICE tensor<double, dim, dim, dim, dim>\n gradient(tensor<double, dim, dim> dudx) const\n {\n constexpr auto I = mfem::internal::IsotropicIdentity<dim>();\n\n tensor<double, dim, dim> F = I + dudx;\n tensor<double, dim, dim> invF = inv(F);\n tensor<double, dim, dim> devB =\n dev(dudx + transpose(dudx) + dot(dudx, transpose(dudx)));\n double J = det(F);\n double coef = (C1 \/ pow(J, 5.0 \/ 3.0));\n return make_tensor<dim, dim, dim, dim>([&](int i, int j, int k,\n int l)\n {\n return 2.0 * (D1 * J * (i == j) - (5.0 \/ 3.0) * coef * devB[i][j]) *\n invF[l][k] +\n 2.0 * coef *\n ((i == k) * F[j][l] + F[i][l] * (j == k) -\n (2.0 \/ 3.0) * ((i == j) * F[k][l]));\n });\n }\n\n \/**\n * @brief Apply the gradient of the stress.\n *\n * @param[in] dudx\n * @param[in] ddudx\n * @return\n *\/\n MFEM_HOST_DEVICE tensor<double, dim, dim>\n action_of_gradient(const tensor<double, dim, dim> &dudx,\n const tensor<double, dim, dim> &ddudx) const\n {\n if (gradient_type == GradientType::Symbolic)\n {\n return action_of_gradient_symbolic(dudx, ddudx);\n }\n#ifdef MFEM_USE_ENZYME\n else if (gradient_type == GradientType::EnzymeFwd)\n {\n return action_of_gradient_enzyme_fwd(dudx, ddudx);\n }\n else if (gradient_type == GradientType::EnzymeRev)\n {\n return action_of_gradient_enzyme_rev(dudx, ddudx);\n }\n#endif\n else if (gradient_type == GradientType::FiniteDiff)\n {\n return action_of_gradient_finite_diff(dudx, ddudx);\n }\n else if (gradient_type == GradientType::InternalFwd)\n {\n return action_of_gradient_dual(dudx, ddudx);\n }\n }\n\n MFEM_HOST_DEVICE tensor<double, dim, dim>\n action_of_gradient_dual(const tensor<double, dim, dim> &dudx,\n const tensor<double, dim, dim> &ddudx) const\n {\n auto sigma = stress(make_tensor<dim, dim>([&](int i, int j)\n {\n return mfem::internal::dual<double, double> {dudx[i][j], ddudx[i][j]};\n }));\n return make_tensor<dim, dim>(\n [&](int i, int j) { return sigma[i][j].gradient; });\n }\n\n#ifdef MFEM_USE_ENZYME\n MFEM_HOST_DEVICE tensor<double, dim, dim>\n action_of_gradient_enzyme_fwd(const tensor<double, dim, dim> &dudx,\n const tensor<double, dim, dim> &ddudx) const\n {\n tensor<double, dim, dim> sigma{};\n tensor<double, dim, dim> dsigma{};\n\n __enzyme_fwddiff<void>(stress_wrapper, enzyme_const, this, enzyme_dup,\n &dudx, &ddudx, enzyme_dupnoneed, &sigma, &dsigma);\n return dsigma;\n }\n\n MFEM_HOST_DEVICE tensor<double, dim, dim>\n action_of_gradient_enzyme_rev(const tensor<double, dim, dim> &dudx,\n const tensor<double, dim, dim> &ddudx) const\n {\n tensor<double, dim, dim, dim, dim> gradient{};\n tensor<double, dim, dim> sigma{};\n tensor<double, dim, dim> dir{};\n\n for (int i = 0; i < dim; i++)\n {\n for (int j = 0; j < dim; j++)\n {\n dir[i][j] = 1;\n __enzyme_autodiff<void>(stress_wrapper, enzyme_const, this, enzyme_dup,\n &dudx, &gradient[i][j], enzyme_dupnoneed,\n &sigma, &dir);\n dir[i][j] = 0;\n }\n }\n return ddot(gradient, ddudx);\n }\n#endif\n\n MFEM_HOST_DEVICE tensor<double, dim, dim>\n action_of_gradient_finite_diff(const tensor<double, dim, dim> &dudx,\n const tensor<double, dim, dim> &ddudx) const\n {\n return (stress(dudx + 1.0e-8 * ddudx) - stress(dudx - 1.0e-8 * ddudx)) \/\n 2.0e-8;\n }\n\n \/\/ d(stress)_{ij} := (d(stress)_ij \/ d(du_dx)_{kl}) * d(du_dx)_{kl}\n \/\/ Only works with 3D stress\n MFEM_HOST_DEVICE tensor<double, dim, dim>\n action_of_gradient_symbolic(const tensor<double, dim, dim> &du_dx,\n const tensor<double, dim, dim> &ddu_dx) const\n {\n constexpr auto I = mfem::internal::IsotropicIdentity<dim>();\n\n tensor<double, dim, dim> F = I + du_dx;\n tensor<double, dim, dim> invFT = inv(transpose(F));\n tensor<double, dim, dim> devB =\n dev(du_dx + transpose(du_dx) + dot(du_dx, transpose(du_dx)));\n double J = det(F);\n double coef = (C1 \/ pow(J, 5.0 \/ 3.0));\n double a1 = ddot(invFT, ddu_dx);\n double a2 = ddot(F, ddu_dx);\n\n return (2.0 * D1 * J * a1 - (4.0 \/ 3.0) * coef * a2) * I -\n ((10.0 \/ 3.0) * coef * a1) * devB +\n (2 * coef) * (dot(ddu_dx, transpose(F)) + dot(F, transpose(ddu_dx)));\n }\n\n \/\/ Parameters\n double D1 = 100.0;\n double C1 = 50.0;\n};\n\n#endif\n<commit_msg>remove restrict keyword<commit_after>\/\/ Copyright (c) 2010-2022, Lawrence Livermore National Security, LLC. Produced\n\/\/ at the Lawrence Livermore National Laboratory. All Rights reserved. See files\n\/\/ LICENSE and NOTICE for details. LLNL-CODE-806117.\n\/\/\n\/\/ This file is part of the MFEM library. For more information and source code\n\/\/ availability visit https:\/\/mfem.org.\n\/\/\n\/\/ MFEM is free software; you can redistribute it and\/or modify it under the\n\/\/ terms of the BSD-3 license. We welcome feedback and contributions, see file\n\/\/ CONTRIBUTING.md for details.\n\n#ifndef MFEM_ELASTICITY_MAT_NEOHOOKEAN_HPP\n#define MFEM_ELASTICITY_MAT_NEOHOOKEAN_HPP\n\n#include \"general\/enzyme.hpp\"\n#include \"gradient_type.hpp\"\n#include \"linalg\/tensor.hpp\"\n#include \"mfem.hpp\"\n\nusing mfem::internal::tensor;\nusing mfem::internal::make_tensor;\n\n\/**\n * @brief Neo-Hookean material\n *\n * Defines a Neo-Hookean material response. It satisfies the material_type\n * interface for ElasticityOperator::SetMaterial. This material type allows\n * choosing the method of derivative calculation in `action_of_gradient`.\n * Choices include methods derived by hand using symbolic calculation and a\n * variety of automatically computed gradient applications, like\n * - Enzyme forward mode\n * - Enzyme reverse mode\n * - Dual number type forward mode\n * - Finite difference mode\n *\n * @tparam dim\n * @tparam gradient_type\n *\/\ntemplate <int dim = 3, GradientType gradient_type = GradientType::Symbolic>\nstruct NeoHookeanMaterial\n{\n static_assert(dim == 3, \"NeoHookean model currently implemented only in 3D\");\n\n \/**\n * @brief Compute the stress response.\n *\n * @param[in] dudx derivative of the displacement\n * @return\n *\/\n template <typename T>\n MFEM_HOST_DEVICE tensor<T, dim, dim>\n stress(const tensor<T, dim, dim> &dudx) const\n {\n constexpr auto I = mfem::internal::IsotropicIdentity<dim>();\n T J = det(I + dudx);\n T p = -2.0 * D1 * J * (J - 1);\n auto devB = dev(dudx + transpose(dudx) + dot(dudx, transpose(dudx)));\n auto sigma = -(p \/ J) * I + 2 * (C1 \/ pow(J, 5.0 \/ 3.0)) * devB;\n return sigma;\n }\n\n \/**\n * @brief A method to wrap the stress calculation into a static function.\n *\n * This is necessary for Enzyme to access the class pointer (self).\n *\n * @param[in] self\n * @param[in] dudx\n * @param[in] sigma\n * @return stress\n *\/\n MFEM_HOST_DEVICE static void\n stress_wrapper(NeoHookeanMaterial<dim, gradient_type> *self,\n tensor<double, dim, dim> &dudx,\n tensor<double, dim, dim> &sigma)\n {\n sigma = self->stress(dudx);\n }\n\n \/**\n * @brief Compute the gradient.\n *\n * This method is used in the ElasticityDiagonalPreconditioner type to\n * compute the gradient matrix entries of the current quadrature point,\n * instead of the action.\n *\n * @param[in] dudx\n * @return\n *\/\n MFEM_HOST_DEVICE tensor<double, dim, dim, dim, dim>\n gradient(tensor<double, dim, dim> dudx) const\n {\n constexpr auto I = mfem::internal::IsotropicIdentity<dim>();\n\n tensor<double, dim, dim> F = I + dudx;\n tensor<double, dim, dim> invF = inv(F);\n tensor<double, dim, dim> devB =\n dev(dudx + transpose(dudx) + dot(dudx, transpose(dudx)));\n double J = det(F);\n double coef = (C1 \/ pow(J, 5.0 \/ 3.0));\n return make_tensor<dim, dim, dim, dim>([&](int i, int j, int k,\n int l)\n {\n return 2.0 * (D1 * J * (i == j) - (5.0 \/ 3.0) * coef * devB[i][j]) *\n invF[l][k] +\n 2.0 * coef *\n ((i == k) * F[j][l] + F[i][l] * (j == k) -\n (2.0 \/ 3.0) * ((i == j) * F[k][l]));\n });\n }\n\n \/**\n * @brief Apply the gradient of the stress.\n *\n * @param[in] dudx\n * @param[in] ddudx\n * @return\n *\/\n MFEM_HOST_DEVICE tensor<double, dim, dim>\n action_of_gradient(const tensor<double, dim, dim> &dudx,\n const tensor<double, dim, dim> &ddudx) const\n {\n if (gradient_type == GradientType::Symbolic)\n {\n return action_of_gradient_symbolic(dudx, ddudx);\n }\n#ifdef MFEM_USE_ENZYME\n else if (gradient_type == GradientType::EnzymeFwd)\n {\n return action_of_gradient_enzyme_fwd(dudx, ddudx);\n }\n else if (gradient_type == GradientType::EnzymeRev)\n {\n return action_of_gradient_enzyme_rev(dudx, ddudx);\n }\n#endif\n else if (gradient_type == GradientType::FiniteDiff)\n {\n return action_of_gradient_finite_diff(dudx, ddudx);\n }\n else if (gradient_type == GradientType::InternalFwd)\n {\n return action_of_gradient_dual(dudx, ddudx);\n }\n }\n\n MFEM_HOST_DEVICE tensor<double, dim, dim>\n action_of_gradient_dual(const tensor<double, dim, dim> &dudx,\n const tensor<double, dim, dim> &ddudx) const\n {\n auto sigma = stress(make_tensor<dim, dim>([&](int i, int j)\n {\n return mfem::internal::dual<double, double> {dudx[i][j], ddudx[i][j]};\n }));\n return make_tensor<dim, dim>(\n [&](int i, int j) { return sigma[i][j].gradient; });\n }\n\n#ifdef MFEM_USE_ENZYME\n MFEM_HOST_DEVICE tensor<double, dim, dim>\n action_of_gradient_enzyme_fwd(const tensor<double, dim, dim> &dudx,\n const tensor<double, dim, dim> &ddudx) const\n {\n tensor<double, dim, dim> sigma{};\n tensor<double, dim, dim> dsigma{};\n\n __enzyme_fwddiff<void>(stress_wrapper, enzyme_const, this, enzyme_dup,\n &dudx, &ddudx, enzyme_dupnoneed, &sigma, &dsigma);\n return dsigma;\n }\n\n MFEM_HOST_DEVICE tensor<double, dim, dim>\n action_of_gradient_enzyme_rev(const tensor<double, dim, dim> &dudx,\n const tensor<double, dim, dim> &ddudx) const\n {\n tensor<double, dim, dim, dim, dim> gradient{};\n tensor<double, dim, dim> sigma{};\n tensor<double, dim, dim> dir{};\n\n for (int i = 0; i < dim; i++)\n {\n for (int j = 0; j < dim; j++)\n {\n dir[i][j] = 1;\n __enzyme_autodiff<void>(stress_wrapper, enzyme_const, this, enzyme_dup,\n &dudx, &gradient[i][j], enzyme_dupnoneed,\n &sigma, &dir);\n dir[i][j] = 0;\n }\n }\n return ddot(gradient, ddudx);\n }\n#endif\n\n MFEM_HOST_DEVICE tensor<double, dim, dim>\n action_of_gradient_finite_diff(const tensor<double, dim, dim> &dudx,\n const tensor<double, dim, dim> &ddudx) const\n {\n return (stress(dudx + 1.0e-8 * ddudx) - stress(dudx - 1.0e-8 * ddudx)) \/\n 2.0e-8;\n }\n\n \/\/ d(stress)_{ij} := (d(stress)_ij \/ d(du_dx)_{kl}) * d(du_dx)_{kl}\n \/\/ Only works with 3D stress\n MFEM_HOST_DEVICE tensor<double, dim, dim>\n action_of_gradient_symbolic(const tensor<double, dim, dim> &du_dx,\n const tensor<double, dim, dim> &ddu_dx) const\n {\n constexpr auto I = mfem::internal::IsotropicIdentity<dim>();\n\n tensor<double, dim, dim> F = I + du_dx;\n tensor<double, dim, dim> invFT = inv(transpose(F));\n tensor<double, dim, dim> devB =\n dev(du_dx + transpose(du_dx) + dot(du_dx, transpose(du_dx)));\n double J = det(F);\n double coef = (C1 \/ pow(J, 5.0 \/ 3.0));\n double a1 = ddot(invFT, ddu_dx);\n double a2 = ddot(F, ddu_dx);\n\n return (2.0 * D1 * J * a1 - (4.0 \/ 3.0) * coef * a2) * I -\n ((10.0 \/ 3.0) * coef * a1) * devB +\n (2 * coef) * (dot(ddu_dx, transpose(F)) + dot(F, transpose(ddu_dx)));\n }\n\n \/\/ Parameters\n double D1 = 100.0;\n double C1 = 50.0;\n};\n\n#endif\n<|endoftext|>"} {"text":"<commit_before>\/*\n * Copyright 2008-2010 Google Inc.\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n *\/\n\n#include \"esnpapi.h\"\n#include \"proxyImpl.h\"\n\n#include <any.h>\n#include <reflect.h>\n#include <org\/w3c\/dom.h>\n\nusing namespace org::w3c::dom;\n\nvoid initializeHtmlMetaData()\n{\n registerMetaData(html::ApplicationCache::getMetaData(), reinterpret_cast<Object* (*)(ProxyObject)>(Proxy_Impl<ProxyObject, html::ApplicationCache_Bridge<Any, invoke> >::createInstance));\n registerMetaData(html::BarProp::getMetaData(), reinterpret_cast<Object* (*)(ProxyObject)>(Proxy_Impl<ProxyObject, html::BarProp_Bridge<Any, invoke> >::createInstance));\n registerMetaData(html::BeforeUnloadEvent::getMetaData(), reinterpret_cast<Object* (*)(ProxyObject)>(Proxy_Impl<ProxyObject, html::BeforeUnloadEvent_Bridge<Any, invoke> >::createInstance));\n registerMetaData(html::CanvasGradient::getMetaData(), reinterpret_cast<Object* (*)(ProxyObject)>(Proxy_Impl<ProxyObject, html::CanvasGradient_Bridge<Any, invoke> >::createInstance));\n registerMetaData(html::CanvasPattern::getMetaData(), reinterpret_cast<Object* (*)(ProxyObject)>(Proxy_Impl<ProxyObject, html::CanvasPattern_Bridge<Any, invoke> >::createInstance));\n registerMetaData(html::CanvasPixelArray::getMetaData(), reinterpret_cast<Object* (*)(ProxyObject)>(Proxy_Impl<ProxyObject, html::CanvasPixelArray_Bridge<Any, invoke> >::createInstance));\n registerMetaData(html::CanvasRenderingContext2D::getMetaData(), reinterpret_cast<Object* (*)(ProxyObject)>(Proxy_Impl<ProxyObject, html::CanvasRenderingContext2D_Bridge<Any, invoke> >::createInstance));\n registerMetaData(html::DataTransfer::getMetaData(), reinterpret_cast<Object* (*)(ProxyObject)>(Proxy_Impl<ProxyObject, html::DataTransfer_Bridge<Any, invoke> >::createInstance));\n registerMetaData(html::DOMSettableTokenList::getMetaData(), reinterpret_cast<Object* (*)(ProxyObject)>(Proxy_Impl<ProxyObject, html::DOMSettableTokenList_Bridge<Any, invoke> >::createInstance));\n registerMetaData(html::DOMStringMap::getMetaData(), reinterpret_cast<Object* (*)(ProxyObject)>(Proxy_Impl<ProxyObject, html::DOMStringMap_Bridge<Any, invoke> >::createInstance));\n registerMetaData(html::DOMTokenList::getMetaData(), reinterpret_cast<Object* (*)(ProxyObject)>(Proxy_Impl<ProxyObject, html::DOMTokenList_Bridge<Any, invoke> >::createInstance));\n registerMetaData(html::DragEvent::getMetaData(), reinterpret_cast<Object* (*)(ProxyObject)>(Proxy_Impl<ProxyObject, html::DragEvent_Bridge<Any, invoke> >::createInstance));\n registerMetaData(html::Function::getMetaData(), reinterpret_cast<Object* (*)(ProxyObject)>(Proxy_Impl<ProxyObject, html::Function_Bridge<Any, invoke> >::createInstance));\n registerMetaData(html::History::getMetaData(), reinterpret_cast<Object* (*)(ProxyObject)>(Proxy_Impl<ProxyObject, html::History_Bridge<Any, invoke> >::createInstance));\n registerMetaData(html::ImageData::getMetaData(), reinterpret_cast<Object* (*)(ProxyObject)>(Proxy_Impl<ProxyObject, html::ImageData_Bridge<Any, invoke> >::createInstance));\n registerMetaData(html::Location::getMetaData(), reinterpret_cast<Object* (*)(ProxyObject)>(Proxy_Impl<ProxyObject, html::Location_Bridge<Any, invoke> >::createInstance));\n registerMetaData(html::MediaError::getMetaData(), reinterpret_cast<Object* (*)(ProxyObject)>(Proxy_Impl<ProxyObject, html::MediaError_Bridge<Any, invoke> >::createInstance));\n registerMetaData(html::MessageChannel::getMetaData(), reinterpret_cast<Object* (*)(ProxyObject)>(Proxy_Impl<ProxyObject, html::MessageChannel_Bridge<Any, invoke> >::createInstance));\n registerMetaData(html::MessageEvent::getMetaData(), reinterpret_cast<Object* (*)(ProxyObject)>(Proxy_Impl<ProxyObject, html::MessageEvent_Bridge<Any, invoke> >::createInstance));\n registerMetaData(html::MessagePort::getMetaData(), reinterpret_cast<Object* (*)(ProxyObject)>(Proxy_Impl<ProxyObject, html::MessagePort_Bridge<Any, invoke> >::createInstance));\n registerMetaData(html::Navigator::getMetaData(), reinterpret_cast<Object* (*)(ProxyObject)>(Proxy_Impl<ProxyObject, html::Navigator_Bridge<Any, invoke> >::createInstance));\n registerMetaData(html::PopStateEvent::getMetaData(), reinterpret_cast<Object* (*)(ProxyObject)>(Proxy_Impl<ProxyObject, html::PopStateEvent_Bridge<Any, invoke> >::createInstance));\n registerMetaData(html::PropertyNodeList::getMetaData(), reinterpret_cast<Object* (*)(ProxyObject)>(Proxy_Impl<ProxyObject, html::PropertyNodeList_Bridge<Any, invoke> >::createInstance));\n registerMetaData(html::RadioNodeList::getMetaData(), reinterpret_cast<Object* (*)(ProxyObject)>(Proxy_Impl<ProxyObject, html::RadioNodeList_Bridge<Any, invoke> >::createInstance));\n registerMetaData(html::Screen::getMetaData(), reinterpret_cast<Object* (*)(ProxyObject)>(Proxy_Impl<ProxyObject, html::Screen_Bridge<Any, invoke> >::createInstance));\n registerMetaData(html::Selection::getMetaData(), reinterpret_cast<Object* (*)(ProxyObject)>(Proxy_Impl<ProxyObject, html::Selection_Bridge<Any, invoke> >::createInstance));\n registerMetaData(html::StyleMedia::getMetaData(), reinterpret_cast<Object* (*)(ProxyObject)>(Proxy_Impl<ProxyObject, html::StyleMedia_Bridge<Any, invoke> >::createInstance));\n registerMetaData(html::TextMetrics::getMetaData(), reinterpret_cast<Object* (*)(ProxyObject)>(Proxy_Impl<ProxyObject, html::TextMetrics_Bridge<Any, invoke> >::createInstance));\n registerMetaData(html::TimeRanges::getMetaData(), reinterpret_cast<Object* (*)(ProxyObject)>(Proxy_Impl<ProxyObject, html::TimeRanges_Bridge<Any, invoke> >::createInstance));\n registerMetaData(html::UndoManagerEvent::getMetaData(), reinterpret_cast<Object* (*)(ProxyObject)>(Proxy_Impl<ProxyObject, html::UndoManagerEvent_Bridge<Any, invoke> >::createInstance));\n registerMetaData(html::UndoManager::getMetaData(), reinterpret_cast<Object* (*)(ProxyObject)>(Proxy_Impl<ProxyObject, html::UndoManager_Bridge<Any, invoke> >::createInstance));\n registerMetaData(html::ValidityState::getMetaData(), reinterpret_cast<Object* (*)(ProxyObject)>(Proxy_Impl<ProxyObject, html::ValidityState_Bridge<Any, invoke> >::createInstance));\n registerMetaData(html::Window::getMetaData(), reinterpret_cast<Object* (*)(ProxyObject)>(Proxy_Impl<ProxyObject, html::Window_Bridge<Any, invoke> >::createInstance));\n\n initializeHtmlMetaDataA_G();\n initializeHtmlMetaDataH_N();\n initializeHtmlMetaDataO_U();\n initializeHtmlMetaDataV_Z();\n\n \/\/ In HTML5, HTMLDocument is a mixin of Document, but historically it was a separate interface extended from Document.\n \/\/ Existing browsers uses HTMLDocument as a class name, and we need to register 'HTMLDocument' as a valid interface name for Document.\n registerMetaData(Document::getMetaData(),\n reinterpret_cast<Object* (*)(ProxyObject)>(Proxy_Impl<ProxyObject, Document_Bridge<Any, invoke> >::createInstance),\n \"HTMLDocument\");\n}\n<commit_msg>(initializeHtmlMetaData) : Regiseter DOMWindow for WebKit.<commit_after>\/*\n * Copyright 2008-2010 Google Inc.\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n *\/\n\n#include \"esnpapi.h\"\n#include \"proxyImpl.h\"\n\n#include <any.h>\n#include <reflect.h>\n#include <org\/w3c\/dom.h>\n\nusing namespace org::w3c::dom;\n\nvoid initializeHtmlMetaData()\n{\n registerMetaData(html::ApplicationCache::getMetaData(), reinterpret_cast<Object* (*)(ProxyObject)>(Proxy_Impl<ProxyObject, html::ApplicationCache_Bridge<Any, invoke> >::createInstance));\n registerMetaData(html::BarProp::getMetaData(), reinterpret_cast<Object* (*)(ProxyObject)>(Proxy_Impl<ProxyObject, html::BarProp_Bridge<Any, invoke> >::createInstance));\n registerMetaData(html::BeforeUnloadEvent::getMetaData(), reinterpret_cast<Object* (*)(ProxyObject)>(Proxy_Impl<ProxyObject, html::BeforeUnloadEvent_Bridge<Any, invoke> >::createInstance));\n registerMetaData(html::CanvasGradient::getMetaData(), reinterpret_cast<Object* (*)(ProxyObject)>(Proxy_Impl<ProxyObject, html::CanvasGradient_Bridge<Any, invoke> >::createInstance));\n registerMetaData(html::CanvasPattern::getMetaData(), reinterpret_cast<Object* (*)(ProxyObject)>(Proxy_Impl<ProxyObject, html::CanvasPattern_Bridge<Any, invoke> >::createInstance));\n registerMetaData(html::CanvasPixelArray::getMetaData(), reinterpret_cast<Object* (*)(ProxyObject)>(Proxy_Impl<ProxyObject, html::CanvasPixelArray_Bridge<Any, invoke> >::createInstance));\n registerMetaData(html::CanvasRenderingContext2D::getMetaData(), reinterpret_cast<Object* (*)(ProxyObject)>(Proxy_Impl<ProxyObject, html::CanvasRenderingContext2D_Bridge<Any, invoke> >::createInstance));\n registerMetaData(html::DataTransfer::getMetaData(), reinterpret_cast<Object* (*)(ProxyObject)>(Proxy_Impl<ProxyObject, html::DataTransfer_Bridge<Any, invoke> >::createInstance));\n registerMetaData(html::DOMSettableTokenList::getMetaData(), reinterpret_cast<Object* (*)(ProxyObject)>(Proxy_Impl<ProxyObject, html::DOMSettableTokenList_Bridge<Any, invoke> >::createInstance));\n registerMetaData(html::DOMStringMap::getMetaData(), reinterpret_cast<Object* (*)(ProxyObject)>(Proxy_Impl<ProxyObject, html::DOMStringMap_Bridge<Any, invoke> >::createInstance));\n registerMetaData(html::DOMTokenList::getMetaData(), reinterpret_cast<Object* (*)(ProxyObject)>(Proxy_Impl<ProxyObject, html::DOMTokenList_Bridge<Any, invoke> >::createInstance));\n registerMetaData(html::DragEvent::getMetaData(), reinterpret_cast<Object* (*)(ProxyObject)>(Proxy_Impl<ProxyObject, html::DragEvent_Bridge<Any, invoke> >::createInstance));\n registerMetaData(html::Function::getMetaData(), reinterpret_cast<Object* (*)(ProxyObject)>(Proxy_Impl<ProxyObject, html::Function_Bridge<Any, invoke> >::createInstance));\n registerMetaData(html::History::getMetaData(), reinterpret_cast<Object* (*)(ProxyObject)>(Proxy_Impl<ProxyObject, html::History_Bridge<Any, invoke> >::createInstance));\n registerMetaData(html::ImageData::getMetaData(), reinterpret_cast<Object* (*)(ProxyObject)>(Proxy_Impl<ProxyObject, html::ImageData_Bridge<Any, invoke> >::createInstance));\n registerMetaData(html::Location::getMetaData(), reinterpret_cast<Object* (*)(ProxyObject)>(Proxy_Impl<ProxyObject, html::Location_Bridge<Any, invoke> >::createInstance));\n registerMetaData(html::MediaError::getMetaData(), reinterpret_cast<Object* (*)(ProxyObject)>(Proxy_Impl<ProxyObject, html::MediaError_Bridge<Any, invoke> >::createInstance));\n registerMetaData(html::MessageChannel::getMetaData(), reinterpret_cast<Object* (*)(ProxyObject)>(Proxy_Impl<ProxyObject, html::MessageChannel_Bridge<Any, invoke> >::createInstance));\n registerMetaData(html::MessageEvent::getMetaData(), reinterpret_cast<Object* (*)(ProxyObject)>(Proxy_Impl<ProxyObject, html::MessageEvent_Bridge<Any, invoke> >::createInstance));\n registerMetaData(html::MessagePort::getMetaData(), reinterpret_cast<Object* (*)(ProxyObject)>(Proxy_Impl<ProxyObject, html::MessagePort_Bridge<Any, invoke> >::createInstance));\n registerMetaData(html::Navigator::getMetaData(), reinterpret_cast<Object* (*)(ProxyObject)>(Proxy_Impl<ProxyObject, html::Navigator_Bridge<Any, invoke> >::createInstance));\n registerMetaData(html::PopStateEvent::getMetaData(), reinterpret_cast<Object* (*)(ProxyObject)>(Proxy_Impl<ProxyObject, html::PopStateEvent_Bridge<Any, invoke> >::createInstance));\n registerMetaData(html::PropertyNodeList::getMetaData(), reinterpret_cast<Object* (*)(ProxyObject)>(Proxy_Impl<ProxyObject, html::PropertyNodeList_Bridge<Any, invoke> >::createInstance));\n registerMetaData(html::RadioNodeList::getMetaData(), reinterpret_cast<Object* (*)(ProxyObject)>(Proxy_Impl<ProxyObject, html::RadioNodeList_Bridge<Any, invoke> >::createInstance));\n registerMetaData(html::Screen::getMetaData(), reinterpret_cast<Object* (*)(ProxyObject)>(Proxy_Impl<ProxyObject, html::Screen_Bridge<Any, invoke> >::createInstance));\n registerMetaData(html::Selection::getMetaData(), reinterpret_cast<Object* (*)(ProxyObject)>(Proxy_Impl<ProxyObject, html::Selection_Bridge<Any, invoke> >::createInstance));\n registerMetaData(html::StyleMedia::getMetaData(), reinterpret_cast<Object* (*)(ProxyObject)>(Proxy_Impl<ProxyObject, html::StyleMedia_Bridge<Any, invoke> >::createInstance));\n registerMetaData(html::TextMetrics::getMetaData(), reinterpret_cast<Object* (*)(ProxyObject)>(Proxy_Impl<ProxyObject, html::TextMetrics_Bridge<Any, invoke> >::createInstance));\n registerMetaData(html::TimeRanges::getMetaData(), reinterpret_cast<Object* (*)(ProxyObject)>(Proxy_Impl<ProxyObject, html::TimeRanges_Bridge<Any, invoke> >::createInstance));\n registerMetaData(html::UndoManagerEvent::getMetaData(), reinterpret_cast<Object* (*)(ProxyObject)>(Proxy_Impl<ProxyObject, html::UndoManagerEvent_Bridge<Any, invoke> >::createInstance));\n registerMetaData(html::UndoManager::getMetaData(), reinterpret_cast<Object* (*)(ProxyObject)>(Proxy_Impl<ProxyObject, html::UndoManager_Bridge<Any, invoke> >::createInstance));\n registerMetaData(html::ValidityState::getMetaData(), reinterpret_cast<Object* (*)(ProxyObject)>(Proxy_Impl<ProxyObject, html::ValidityState_Bridge<Any, invoke> >::createInstance));\n registerMetaData(html::Window::getMetaData(), reinterpret_cast<Object* (*)(ProxyObject)>(Proxy_Impl<ProxyObject, html::Window_Bridge<Any, invoke> >::createInstance));\n\n initializeHtmlMetaDataA_G();\n initializeHtmlMetaDataH_N();\n initializeHtmlMetaDataO_U();\n initializeHtmlMetaDataV_Z();\n\n \/\/ In HTML5, HTMLDocument is a mixin of Document, but historically it was a separate interface extended from Document.\n \/\/ Existing browsers uses HTMLDocument as a class name, and we need to register 'HTMLDocument' as a valid interface name for Document.\n registerMetaData(Document::getMetaData(),\n reinterpret_cast<Object* (*)(ProxyObject)>(Proxy_Impl<ProxyObject, Document_Bridge<Any, invoke> >::createInstance),\n \"HTMLDocument\");\n\n \/\/ WebKit uses \"DOMWindow\" instead of \"Window\"\n registerMetaData(html::Window::getMetaData(),\n reinterpret_cast<Object* (*)(ProxyObject)>(Proxy_Impl<ProxyObject, html::Window_Bridge<Any, invoke> >::createInstance),\n \"DOMWindow\");\n}\n<|endoftext|>"} {"text":"<commit_before>#include <iostream>\r\n#include <string>\r\nusing namespace std;\r\n\r\nint atoi(char a)\r\n{\r\n return (int)(a - 48);\r\n}\r\n\r\nchar itoa(int i)\r\n{\r\n return (char)(i + 48);\r\n}\r\n\r\nstring append(string s,string maxs)\r\n{\r\n string a;\r\n for(int i = 0;i < maxs.length() - s.length();i++)\r\n a += \"0\";\r\n a += s;\r\n return a;\r\n}\r\n\r\nbool judgeplus(string a,string b,string c,int control)\r\n{\r\n string sum(a.length(),0);int carry = 0;\r\n for(int i = a.length() - 1;i >= 0;i--)\r\n {\r\n sum[i] = itoa(atoi(a[i]) + atoi(b[i]) + carry);\r\n carry = (atoi(a[i]) + atoi(b[i])) \/ 10;\r\n }\r\n switch(control)\r\n {\r\n case 1:{if(sum > c) return true;else return false;}\r\n case 2:{if(sum < c) return true;else return false;}\r\n }\r\n}\r\n\r\nbool judgeminus(string a,string b,string c,int control)\r\n{\r\n string maxs = (a > b ? a : b);string mins = (a < b ? a : b);\r\n string diff(a.length(),0);const int borrow = 10;\r\n for(int i = 0;i < a.length();i++)\r\n diff[i] = itoa((atoi(maxs[i]) - atoi(mins[i]) + borrow) % 10);\r\n switch(control)\r\n {\r\n case 1:{if(diff > c) return true;else return false;}\r\n case 2:{if(diff < c) return true;else return false;}\r\n }\r\n}\r\n\nint main()\n{\n int n;\r\n cin>>n;\r\n for(int i = 1;i <= n;i++)\r\n {\r\n string a,b,c;bool flag = false;\r\n cin>>a>>b>>c;\r\n if(c[0] == '-')\r\n {\r\n if(a[0] == '-' && b[0] == '-')\r\n {\r\n a = a.substr(1,string::npos);\r\n b = b.substr(1,string::npos);\r\n c = c.substr(1,string::npos);\r\n a = append(a,((a.length() >= b.length() ? a : b).length() >= c.length() ? (a.length() >= b.length() ? a : b) : c));\r\n b = append(b,((a.length() >= b.length() ? a : b).length() >= c.length() ? (a.length() >= b.length() ? a : b) : c));\r\n c = append(c,((a.length() >= b.length() ? a : b).length() >= c.length() ? (a.length() >= b.length() ? a : b) : c));\r\n flag = judgeplus(a,b,c,2);\r\n }\r\n else if(a[0] == '-' && b[0] != '-')\r\n {\r\n a = a.substr(1,string::npos);\r\n c = c.substr(1,string::npos);\r\n a = append(a,((a.length() >= b.length() ? a : b).length() >= c.length() ? (a.length() >= b.length() ? a : b) : c));\r\n b = append(b,((a.length() >= b.length() ? a : b).length() >= c.length() ? (a.length() >= b.length() ? a : b) : c));\r\n c = append(c,((a.length() >= b.length() ? a : b).length() >= c.length() ? (a.length() >= b.length() ? a : b) : c));\r\n flag = judgeminus(a,b,c,2);\r\n }\r\n else if(a[0] != '-' && b[0] == '-')\r\n {\r\n b = b.substr(1,string::npos);\r\n c = c.substr(1,string::npos);\r\n a = append(a,((a.length() >= b.length() ? a : b).length() >= c.length() ? (a.length() >= b.length() ? a : b) : c));\r\n b = append(b,((a.length() >= b.length() ? a : b).length() >= c.length() ? (a.length() >= b.length() ? a : b) : c));\r\n c = append(c,((a.length() >= b.length() ? a : b).length() >= c.length() ? (a.length() >= b.length() ? a : b) : c));\r\n flag = judgeminus(a,b,c,2);\r\n }\r\n else\r\n flag = true;\r\n }\r\n else\r\n {\r\n if(a[0] != '-' && b[0] != '-')\r\n {\r\n a = append(a,((a.length() >= b.length() ? a : b).length() >= c.length() ? (a.length() >= b.length() ? a : b) : c));\r\n b = append(b,((a.length() >= b.length() ? a : b).length() >= c.length() ? (a.length() >= b.length() ? a : b) : c));\r\n c = append(c,((a.length() >= b.length() ? a : b).length() >= c.length() ? (a.length() >= b.length() ? a : b) : c));\r\n flag = judgeplus(a,b,c,1);\r\n }\r\n else if(a[0] == '-' && b[0] != '-')\r\n {\r\n a = a.substr(1,string::npos);\r\n a = append(a,((a.length() >= b.length() ? a : b).length() >= c.length() ? (a.length() >= b.length() ? a : b) : c));\r\n b = append(b,((a.length() >= b.length() ? a : b).length() >= c.length() ? (a.length() >= b.length() ? a : b) : c));\r\n c = append(c,((a.length() >= b.length() ? a : b).length() >= c.length() ? (a.length() >= b.length() ? a : b) : c));\r\n flag = judgeminus(a,b,c,1);\r\n }\r\n else if(a[0] != '-' && b[0] == '-')\r\n {\r\n b = b.substr(1,string::npos);\r\n a = append(a,((a.length() >= b.length() ? a : b).length() >= c.length() ? (a.length() >= b.length() ? a : b) : c));\r\n b = append(b,((a.length() >= b.length() ? a : b).length() >= c.length() ? (a.length() >= b.length() ? a : b) : c));\r\n c = append(c,((a.length() >= b.length() ? a : b).length() >= c.length() ? (a.length() >= b.length() ? a : b) : c));\r\n flag = judgeminus(a,b,c,1);\r\n }\r\n }\r\n if(flag) cout<<\"Case #\"<<i<<\": true\"<<endl;\r\n else cout<<\"Case #\"<<i<<\": false\"<<endl;\r\n }\n}\r\n<commit_msg>Clean up.<commit_after>#include <iostream>\r\n#include <string>\r\nusing namespace std;\r\n\r\nvoid append(string& s,int&& length)\r\n{\r\n int limit = length - s.size();\r\n for(int i = 0;i < limit;i++) s.push_back('0');\r\n}\r\n\r\nbool judgeplus(string& a,string& b,string& c,int control)\r\n{\r\n auto atoi = [](char a)-> int {return (a - 48);};\r\n auto itoa = [](int i)-> char {return (i + 48);};\r\n string sum(a.length(),0);int carry = 0;\r\n for(int i = a.length() - 1;i >= 0;i--)\r\n {\r\n sum[i] = itoa(atoi(a[i]) + atoi(b[i]) + carry);\r\n carry = (atoi(a[i]) + atoi(b[i])) \/ 10;\r\n }\r\n switch(control)\r\n {\r\n case 1:{if(sum > c) return true;else return false;}\r\n case 2:{if(sum < c) return true;else return false;}\r\n }\r\n}\r\n\r\nbool judgeminus(string& a,string& b,string& c,int control)\r\n{\r\n auto atoi = [](char a)-> int {return (a - 48);};\r\n auto itoa = [](int i)-> char {return (i + 48);};\r\n string maxs = (a > b ? a : b);string mins = (a < b ? a : b);\r\n string diff(a.length(),0);const int borrow = 10;\r\n for(int i = 0;i < a.length();i++)\r\n diff[i] = itoa((atoi(maxs[i]) - atoi(mins[i]) + borrow) % 10);\r\n switch(control)\r\n {\r\n case 1:{if(diff > c) return true;else return false;}\r\n case 2:{if(diff < c) return true;else return false;}\r\n }\r\n}\r\n\r\nint main()\r\n{\r\n int n;\r\n cin>>n;\r\n for(int i = 1;i <= n;i++)\r\n {\r\n string a,b,c;bool flag = false;\r\n cin>>a>>b>>c;\r\n if(c.front() == '-')\r\n {\r\n if(a.front() == '-' && b.front() == '-')\r\n {\r\n a.erase(0,1);b.erase(0,1);c.erase(0,1);\r\n append(a,((a.length() >= b.length() ? a : b).length() >= c.length() ? (a.length() >= b.length() ? a : b) : c).size());\r\n append(b,((a.length() >= b.length() ? a : b).length() >= c.length() ? (a.length() >= b.length() ? a : b) : c).size());\r\n append(c,((a.length() >= b.length() ? a : b).length() >= c.length() ? (a.length() >= b.length() ? a : b) : c).size());\r\n flag = judgeplus(a,b,c,2);\r\n }\r\n else if(a.front() == '-' && b.front() != '-')\r\n {\r\n a.erase(0,1);c.erase(0,1);\r\n append(a,((a.length() >= b.length() ? a : b).length() >= c.length() ? (a.length() >= b.length() ? a : b) : c).size());\r\n append(b,((a.length() >= b.length() ? a : b).length() >= c.length() ? (a.length() >= b.length() ? a : b) : c).size());\r\n append(c,((a.length() >= b.length() ? a : b).length() >= c.length() ? (a.length() >= b.length() ? a : b) : c).size());\r\n flag = judgeminus(a,b,c,2);\r\n }\r\n else if(a.front() != '-' && b.front() == '-')\r\n {\r\n b.erase(0,1);c.erase(0,1);\r\n append(a,((a.length() >= b.length() ? a : b).length() >= c.length() ? (a.length() >= b.length() ? a : b) : c).size());\r\n append(b,((a.length() >= b.length() ? a : b).length() >= c.length() ? (a.length() >= b.length() ? a : b) : c).size());\r\n append(c,((a.length() >= b.length() ? a : b).length() >= c.length() ? (a.length() >= b.length() ? a : b) : c).size());\r\n flag = judgeminus(a,b,c,2);\r\n }\r\n else flag = true;\r\n }\r\n else\r\n {\r\n if(a.front() != '-' && b.front() != '-')\r\n {\r\n append(a,((a.length() >= b.length() ? a : b).length() >= c.length() ? (a.length() >= b.length() ? a : b) : c).size());\r\n append(b,((a.length() >= b.length() ? a : b).length() >= c.length() ? (a.length() >= b.length() ? a : b) : c).size());\r\n append(c,((a.length() >= b.length() ? a : b).length() >= c.length() ? (a.length() >= b.length() ? a : b) : c).size());\r\n flag = judgeplus(a,b,c,1);\r\n }\r\n else if(a.front() == '-' && b.front() != '-')\r\n {\r\n a.erase(0,1);\r\n append(a,((a.length() >= b.length() ? a : b).length() >= c.length() ? (a.length() >= b.length() ? a : b) : c).size());\r\n append(b,((a.length() >= b.length() ? a : b).length() >= c.length() ? (a.length() >= b.length() ? a : b) : c).size());\r\n append(c,((a.length() >= b.length() ? a : b).length() >= c.length() ? (a.length() >= b.length() ? a : b) : c).size());\r\n flag = judgeminus(a,b,c,1);\r\n }\r\n else if(a.front() != '-' && b.front() == '-')\r\n {\r\n b.erase(0,1);\r\n append(a,((a.length() >= b.length() ? a : b).length() >= c.length() ? (a.length() >= b.length() ? a : b) : c).size());\r\n append(b,((a.length() >= b.length() ? a : b).length() >= c.length() ? (a.length() >= b.length() ? a : b) : c).size());\r\n append(c,((a.length() >= b.length() ? a : b).length() >= c.length() ? (a.length() >= b.length() ? a : b) : c).size());\r\n flag = judgeminus(a,b,c,1);\r\n }\r\n }\r\n cout<<\"Case #\"<<i<<\": \"<<boolalpha<<flag<<endl;\r\n }\r\n}\r\n<|endoftext|>"} {"text":"<commit_before>#include \"nxtStringPropertyConverter.h\"\r\n\r\nusing namespace qReal::robots::generators;\r\nusing namespace converters;\r\nusing namespace parts;\r\n\r\nNxtStringPropertyConverter::NxtStringPropertyConverter(Variables const &variables\r\n\t\t, parts::Subprograms &subprograms)\r\n\t: mVariables(variables)\r\n{\r\n\tQString const formatStringCode =\r\n\t\t\t\"char *formatString(char *format, ...)\\n\"\\\r\n\t\t\t\"{\\n\"\\\r\n\t\t\t\"\tchar buffer[256];\\n\"\\\r\n\t\t\t\"\tva_list args;\\n\"\\\r\n\t\t\t\"\tva_start(args, format);\\n\"\\\r\n\t\t\t\"\tvsnprintf(buffer, 256, format, args);\\n\"\\\r\n\t\t\t\"\tva_end(args);\\n\"\\\r\n\t\t\t\"\treturn buffer;\\n\"\\\r\n\t\t\t\"}\";\r\n\tsubprograms.appendManualSubprogram(\"formatString\", formatStringCode);\r\n}\r\n\r\nQString NxtStringPropertyConverter::convert(QString const &data) const\r\n{\r\n\tQString const preparedString = StringPropertyConverter::convert(data);\r\n\tQStringList metVariables;\r\n\tQString const formatString = TextExpressionProcessorBase::processExpression(preparedString, metVariables);\r\n\tQString const formatVariables = metVariables.join(\", \");\r\n\treturn QString(\"formatString(%1, %2)\").arg(formatString, formatVariables);\r\n}\r\n\r\nbool NxtStringPropertyConverter::variableExists(QString const &variable) const\r\n{\r\n\treturn mVariables.expressionType(variable) != enums::variableType::unknown;\r\n}\r\n\r\nQString NxtStringPropertyConverter::value(QString const &variable) const\r\n{\r\n\treturn mVariables.expressionType(variable) == enums::variableType::intType ? \"%d\" : \"%.4f\";\r\n}\r\n<commit_msg>Made it working for floats<commit_after>#include \"nxtStringPropertyConverter.h\"\r\n\r\nusing namespace qReal::robots::generators;\r\nusing namespace converters;\r\nusing namespace parts;\r\n\r\nNxtStringPropertyConverter::NxtStringPropertyConverter(Variables const &variables\r\n\t\t, parts::Subprograms &subprograms)\r\n\t: mVariables(variables)\r\n{\r\n\tQString const formatStringCode =\r\n\t\t\t\"char *formatString(char *format, ...)\\n\"\\\r\n\t\t\t\"{\\n\"\\\r\n\t\t\t\"\tchar buffer[256];\\n\"\\\r\n\t\t\t\"\tva_list args;\\n\"\\\r\n\t\t\t\"\tva_start(args, format);\\n\"\\\r\n\t\t\t\"\tvsnprintf(buffer, 256, format, args);\\n\"\\\r\n\t\t\t\"\tva_end(args);\\n\"\\\r\n\t\t\t\"\treturn buffer;\\n\"\\\r\n\t\t\t\"}\";\r\n\tsubprograms.appendManualSubprogram(\"formatString\", formatStringCode);\r\n}\r\n\r\nQString NxtStringPropertyConverter::convert(QString const &data) const\r\n{\r\n\tQString const preparedString = StringPropertyConverter::convert(data);\r\n\tQStringList metVariables;\r\n\tQString const formatString = TextExpressionProcessorBase::processExpression(preparedString, metVariables);\r\n\r\n\t\/\/ Nxt OSEK does not support floating point numbers printing, so hello hacks\r\n\t\/\/ (we print each float variable like two int ones separated with '.')\r\n\tQStringList hackedVariables;\r\n\tforeach (QString const &variable, metVariables) {\r\n\t\tif (mVariables.expressionType(variable) == enums::variableType::intType) {\r\n\t\t\thackedVariables << variable;\r\n\t\t} else {\r\n\t\t\thackedVariables << \"(int)\" + variable\r\n\t\t\t\t\t<< QString(\"((int)((%1 - (int)%1) * 1000))\").arg(variable);\r\n\t\t}\r\n\t}\r\n\tQString const formatVariables = hackedVariables.join(\", \");\r\n\treturn QString(\"formatString(%1, %2)\").arg(formatString, formatVariables);\r\n}\r\n\r\nbool NxtStringPropertyConverter::variableExists(QString const &variable) const\r\n{\r\n\treturn mVariables.expressionType(variable) != enums::variableType::unknown;\r\n}\r\n\r\nQString NxtStringPropertyConverter::value(QString const &variable) const\r\n{\r\n\treturn mVariables.expressionType(variable) == enums::variableType::intType ? \"%d\" : \"%d.%d\";\r\n}\r\n<|endoftext|>"} {"text":"<commit_before>\/\/ ======================================================================== \/\/\n\/\/ Copyright 2009-2017 Intel Corporation \/\/\n\/\/ \/\/\n\/\/ Licensed under the Apache License, Version 2.0 (the \"License\"); \/\/\n\/\/ you may not use this file except in compliance with the License. \/\/\n\/\/ You may obtain a copy of the License at \/\/\n\/\/ \/\/\n\/\/ http:\/\/www.apache.org\/licenses\/LICENSE-2.0 \/\/\n\/\/ \/\/\n\/\/ Unless required by applicable law or agreed to in writing, software \/\/\n\/\/ distributed under the License is distributed on an \"AS IS\" BASIS, \/\/\n\/\/ WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. \/\/\n\/\/ See the License for the specific language governing permissions and \/\/\n\/\/ limitations under the License. \/\/\n\/\/ ======================================================================== \/\/\n\n#include <iterator>\n#include <algorithm>\n\/\/ ospray\n#include \"api\/Device.h\"\n#include \"DistributedModel.h\"\n#include \"mpiCommon\/MPICommon.h\"\n#include \"Messaging.h\"\n#include \"common\/Data.h\"\n\/\/ ispc exports\n#include \"DistributedModel_ispc.h\"\n\nnamespace ospray {\n namespace mpi {\n\n extern \"C\" void *ospray_getEmbreeDevice()\n {\n return api::Device::current->embreeDevice;\n }\n\n DistributedModel::DistributedModel()\n {\n managedObjectType = OSP_MODEL;\n this->ispcEquivalent = ispc::DistributedModel_create(this);\n }\n\n std::string DistributedModel::toString() const\n {\n return \"ospray::mpi::DistributedModel\";\n }\n\n void DistributedModel::commit()\n {\n \/\/ TODO: We may need to override the ISPC calls made\n \/\/ to the Model or customize the model struct on the ISPC\n \/\/ side. In which case we need some ISPC side inheritence\n \/\/ for the model type. Currently the code is actually identical.\n Model::commit();\n \/\/ Send my bounding boxes to other nodes, recieve theirs for a\n \/\/ \"full picture\" of what geometries live on what nodes\n Data *regionData = getParamData(\"regions\");\n\n \/\/ The box3f data is sent as data of FLOAT3 items\n \/\/ TODO: It's a little awkward to copy the boxes again like this, maybe\n \/\/ can re-thinkg the send side of the bcast call? One that takes\n \/\/ a ptr and a size since we know we won't be writing out to it?\n \/\/ TODO: For now it doesn't matter that we don't know who owns the\n \/\/ other boxes, just that we know they exist and their bounds, and that\n \/\/ they aren't ours.\n if (regionData) {\n box3f *boxes = reinterpret_cast<box3f*>(regionData->data);\n myRegions = std::vector<box3f>(boxes, boxes + regionData->numItems \/ 2);\n }\n\n \/\/ If the user hasn't set any regions, there's an implicit infinitely\n \/\/ large region box we can place around the entire world.\n if (myRegions.empty()) {\n postStatusMsg(\"No regions found, making implicit \"\n \"infinitely large region\");\n myRegions.push_back(box3f(vec3f(neg_inf), vec3f(pos_inf)));\n }\n\n for (size_t i = 0; i < mpicommon::numGlobalRanks(); ++i) {\n if (i == mpicommon::globalRank()) {\n messaging::bcast(i, myRegions);\n } else {\n std::vector<box3f> recv;\n messaging::bcast(i, recv);\n std::copy(recv.begin(), recv.end(),\n std::back_inserter(othersRegions));\n }\n }\n\n if (logLevel() >= 1) {\n const bool asyncWasRunning = messaging::asyncMessagingEnabled();\n messaging::disableAsyncMessaging();\n\n \/\/ TODO: WILL: Just for making the debug log more readable,\n \/\/ this will NOT stick around\n for (size_t i = 0; i < mpicommon::numGlobalRanks(); ++i) {\n if (i == mpicommon::globalRank()) {\n postStatusMsg(1) << \"Rank \" << mpicommon::globalRank()\n << \": Got regions from others {\";\n for (const auto &b : othersRegions) {\n postStatusMsg(1) << \"\\t\" << b << \",\";\n }\n postStatusMsg(1) << \"}\";\n }\n\n mpicommon::world.barrier();\n }\n\n if (asyncWasRunning) {\n postStatusMsg(\"Async was running, re-enabling\", 1);\n messaging::enableAsyncMessaging();\n }\n }\n }\n\n } \/\/ ::ospray::mpi\n} \/\/ ::ospray\n<commit_msg>Post the infinite region log msg at appropriate log level<commit_after>\/\/ ======================================================================== \/\/\n\/\/ Copyright 2009-2017 Intel Corporation \/\/\n\/\/ \/\/\n\/\/ Licensed under the Apache License, Version 2.0 (the \"License\"); \/\/\n\/\/ you may not use this file except in compliance with the License. \/\/\n\/\/ You may obtain a copy of the License at \/\/\n\/\/ \/\/\n\/\/ http:\/\/www.apache.org\/licenses\/LICENSE-2.0 \/\/\n\/\/ \/\/\n\/\/ Unless required by applicable law or agreed to in writing, software \/\/\n\/\/ distributed under the License is distributed on an \"AS IS\" BASIS, \/\/\n\/\/ WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. \/\/\n\/\/ See the License for the specific language governing permissions and \/\/\n\/\/ limitations under the License. \/\/\n\/\/ ======================================================================== \/\/\n\n#include <iterator>\n#include <algorithm>\n\/\/ ospray\n#include \"api\/Device.h\"\n#include \"DistributedModel.h\"\n#include \"mpiCommon\/MPICommon.h\"\n#include \"Messaging.h\"\n#include \"common\/Data.h\"\n\/\/ ispc exports\n#include \"DistributedModel_ispc.h\"\n\nnamespace ospray {\n namespace mpi {\n\n extern \"C\" void *ospray_getEmbreeDevice()\n {\n return api::Device::current->embreeDevice;\n }\n\n DistributedModel::DistributedModel()\n {\n managedObjectType = OSP_MODEL;\n this->ispcEquivalent = ispc::DistributedModel_create(this);\n }\n\n std::string DistributedModel::toString() const\n {\n return \"ospray::mpi::DistributedModel\";\n }\n\n void DistributedModel::commit()\n {\n \/\/ TODO: We may need to override the ISPC calls made\n \/\/ to the Model or customize the model struct on the ISPC\n \/\/ side. In which case we need some ISPC side inheritence\n \/\/ for the model type. Currently the code is actually identical.\n Model::commit();\n \/\/ Send my bounding boxes to other nodes, recieve theirs for a\n \/\/ \"full picture\" of what geometries live on what nodes\n Data *regionData = getParamData(\"regions\");\n\n \/\/ The box3f data is sent as data of FLOAT3 items\n \/\/ TODO: It's a little awkward to copy the boxes again like this, maybe\n \/\/ can re-thinkg the send side of the bcast call? One that takes\n \/\/ a ptr and a size since we know we won't be writing out to it?\n \/\/ TODO: For now it doesn't matter that we don't know who owns the\n \/\/ other boxes, just that we know they exist and their bounds, and that\n \/\/ they aren't ours.\n if (regionData) {\n box3f *boxes = reinterpret_cast<box3f*>(regionData->data);\n myRegions = std::vector<box3f>(boxes, boxes + regionData->numItems \/ 2);\n }\n\n \/\/ If the user hasn't set any regions, there's an implicit infinitely\n \/\/ large region box we can place around the entire world.\n if (myRegions.empty()) {\n postStatusMsg(\"No regions found, making implicit \"\n \"infinitely large region\", 1);\n myRegions.push_back(box3f(vec3f(neg_inf), vec3f(pos_inf)));\n }\n\n for (size_t i = 0; i < mpicommon::numGlobalRanks(); ++i) {\n if (i == mpicommon::globalRank()) {\n messaging::bcast(i, myRegions);\n } else {\n std::vector<box3f> recv;\n messaging::bcast(i, recv);\n std::copy(recv.begin(), recv.end(),\n std::back_inserter(othersRegions));\n }\n }\n\n if (logLevel() >= 1) {\n const bool asyncWasRunning = messaging::asyncMessagingEnabled();\n messaging::disableAsyncMessaging();\n\n \/\/ TODO: WILL: Just for making the debug log more readable,\n \/\/ this will NOT stick around\n for (size_t i = 0; i < mpicommon::numGlobalRanks(); ++i) {\n if (i == mpicommon::globalRank()) {\n postStatusMsg(1) << \"Rank \" << mpicommon::globalRank()\n << \": Got regions from others {\";\n for (const auto &b : othersRegions) {\n postStatusMsg(1) << \"\\t\" << b << \",\";\n }\n postStatusMsg(1) << \"}\";\n }\n\n mpicommon::world.barrier();\n }\n\n if (asyncWasRunning) {\n postStatusMsg(\"Async was running, re-enabling\", 1);\n messaging::enableAsyncMessaging();\n }\n }\n }\n\n } \/\/ ::ospray::mpi\n} \/\/ ::ospray\n<|endoftext|>"} {"text":"<commit_before>\r\n\/\/ Copyright (c) 2012, 2013 Pierre MOULON\r\n\r\n\/\/ This Source Code Form is subject to the terms of the Mozilla Public\r\n\/\/ License, v. 2.0. If a copy of the MPL was not distributed with this\r\n\/\/ file, You can obtain one at http:\/\/mozilla.org\/MPL\/2.0\/.\r\n\r\n#include \"CppUnitLite\/TestHarness.h\"\r\n#include \"testing\/testing.h\"\r\n\r\n#include \"openMVG\/tracks\/tracks.hpp\"\r\n#include \"openMVG\/matching\/indMatch.hpp\"\r\nusing namespace openMVG::tracks;\r\nusing namespace openMVG::matching;\r\n\r\n#include <vector>\r\n#include <utility>\r\n\r\nTEST(Tracks, Simple) {\r\n\r\n \/\/ Create some tracks for image (A,B,C)\r\n \/\/ {A,B,C} imageId will be {0,1,2}\r\n \/\/ For those image link some features id depicted below\r\n \/\/A B C\r\n \/\/0 -> 0 -> 0\r\n \/\/1 -> 1 -> 6\r\n \/\/2 -> 3\r\n\r\n \/\/ Create the input pairwise correspondences\r\n PairWiseMatches map_pairwisematches;\r\n\r\n const IndMatch testAB[] = {IndMatch(0,0), IndMatch(1,1), IndMatch(2,3)};\r\n const IndMatch testBC[] = {IndMatch(0,0), IndMatch(1,6)};\r\n\r\n const std::vector<IndMatch> ab(testAB, testAB+3);\r\n const std::vector<IndMatch> bc(testBC, testBC+2);\r\n const int A = 0;\r\n const int B = 1;\r\n const int C = 2;\r\n map_pairwisematches[ std::make_pair(A,B) ] = ab;\r\n map_pairwisematches[ std::make_pair(B,C) ] = bc;\r\n\r\n \/\/-- Build tracks using the interface tracksbuilder\r\n TracksBuilder trackBuilder;\r\n trackBuilder.Build( map_pairwisematches );\r\n\r\n trackBuilder.ExportToStream(std::cout);\r\n\r\n STLMAPTracks map_tracks;\r\n trackBuilder.ExportToSTL(map_tracks);\r\n\r\n \/\/-------------------\r\n \/\/ Unit Test check\r\n \/\/-------------------\r\n\r\n \/\/0, {(0,0) (1,0) (2,0)}\r\n \/\/1, {(0,1) (1,1) (2,6)}\r\n \/\/2, {(0,2) (1,3)}\r\n const std::pair<std::size_t,std::size_t> GT_Tracks[] =\r\n {\r\n std::make_pair(0,0), std::make_pair(1,0), std::make_pair(2,0),\r\n std::make_pair(0,1), std::make_pair(1,1), std::make_pair(2,6),\r\n std::make_pair(0,2), std::make_pair(1,3)\r\n };\r\n\r\n CHECK_EQUAL(3, map_tracks.size());\r\n std::size_t cpt = 0, i = 0;\r\n for (STLMAPTracks::const_iterator iterT = map_tracks.begin();\r\n iterT != map_tracks.end();\r\n ++iterT, ++i)\r\n {\r\n CHECK_EQUAL(i, iterT->first);\r\n for (submapTrack::const_iterator iter = iterT->second.begin();\r\n iter != iterT->second.end();\r\n ++iter)\r\n {\r\n CHECK( GT_Tracks[cpt] == std::make_pair(iter->first, iter->second));\r\n ++cpt;\r\n }\r\n }\r\n}\r\n\r\nTEST(Tracks, filter_3viewAtLeast) {\r\n\r\n \/\/\r\n \/\/A B C\r\n \/\/0 -> 0 -> 0\r\n \/\/1 -> 1 -> 6\r\n \/\/2 -> 3\r\n \/\/\r\n\r\n \/\/ Create the input pairwise correspondences\r\n PairWiseMatches map_pairwisematches;\r\n\r\n IndMatch testAB[] = {IndMatch(0,0), IndMatch(1,1), IndMatch(2,3)};\r\n IndMatch testBC[] = {IndMatch(0,0), IndMatch(1,6)};\r\n\r\n\r\n std::vector<IndMatch> ab(testAB, testAB+3);\r\n std::vector<IndMatch> bc(testBC, testBC+2);\r\n const int A = 0;\r\n const int B = 1;\r\n const int C = 2;\r\n map_pairwisematches[ std::make_pair(A,B) ] = ab;\r\n map_pairwisematches[ std::make_pair(B,C) ] = bc;\r\n\r\n \/\/-- Build tracks using the interface tracksbuilder\r\n TracksBuilder trackBuilder;\r\n trackBuilder.Build( map_pairwisematches );\r\n CHECK_EQUAL(3, trackBuilder.NbTracks());\r\n trackBuilder.Filter(3);\r\n CHECK_EQUAL(2, trackBuilder.NbTracks());\r\n}\r\n\r\nTEST(Tracks, Conflict) {\r\n\r\n \/\/\r\n \/\/A B C\r\n \/\/0 -> 0 -> 0\r\n \/\/1 -> 1 -> 6\r\n \/\/{2 -> 3 -> 2\r\n \/\/ 3 -> 8 } This track must be deleted, index 3 appears two times\r\n \/\/\r\n\r\n \/\/ Create the input pairwise correspondences\r\n PairWiseMatches map_pairwisematches;\r\n\r\n const IndMatch testAB[] = {IndMatch(0,0), IndMatch(1,1), IndMatch(2,3)};\r\n const IndMatch testBC[] = {IndMatch(0,0), IndMatch(1,6), IndMatch(3,2), IndMatch(3,8)};\r\n\r\n std::vector<IndMatch> ab(testAB, testAB+3);\r\n std::vector<IndMatch> bc(testBC, testBC+4);\r\n const int A = 0;\r\n const int B = 1;\r\n const int C = 2;\r\n map_pairwisematches[ std::make_pair(A,B) ] = ab;\r\n map_pairwisematches[ std::make_pair(B,C) ] = bc;\r\n\r\n \/\/-- Build tracks using the interface tracksbuilder\r\n TracksBuilder trackBuilder;\r\n trackBuilder.Build( map_pairwisematches );\r\n\r\n CHECK_EQUAL(3, trackBuilder.NbTracks());\r\n trackBuilder.Filter(); \/\/ Key feature tested here to kill the conflicted track\r\n CHECK_EQUAL(2, trackBuilder.NbTracks());\r\n\r\n STLMAPTracks map_tracks;\r\n trackBuilder.ExportToSTL(map_tracks);\r\n\r\n \/\/-------------------\r\n \/\/ Unit Test check\r\n \/\/-------------------\r\n\r\n \/\/0, {(0,0) (1,0) (2,0)}\r\n \/\/1, {(0,1) (1,1) (2,6)}\r\n const std::pair<std::size_t,std::size_t> GT_Tracks[] =\r\n {std::make_pair(0,0), std::make_pair(1,0), std::make_pair(2,0),\r\n std::make_pair(0,1), std::make_pair(1,1), std::make_pair(2,6)};\r\n\r\n CHECK_EQUAL(2, map_tracks.size());\r\n std::size_t cpt = 0, i = 0;\r\n for (STLMAPTracks::const_iterator iterT = map_tracks.begin();\r\n iterT != map_tracks.end();\r\n ++iterT, ++i)\r\n {\r\n CHECK_EQUAL(i, iterT->first);\r\n for (submapTrack::const_iterator iter = iterT->second.begin();\r\n iter != iterT->second.end();\r\n ++iter)\r\n {\r\n CHECK( GT_Tracks[cpt] == std::make_pair(iter->first, iter->second));\r\n ++cpt;\r\n }\r\n }\r\n}\r\n\r\nTEST(Tracks, GetCommonTracksInImages)\r\n{\r\n {\r\n std::set<std::size_t> set_imageIndex {15, 20};\r\n TracksPerView map_tracksPerView;\r\n\r\n std::vector<std::size_t> base{1,2,3,4};\r\n map_tracksPerView[10] = base;\r\n map_tracksPerView[15] = base;\r\n map_tracksPerView[20] = base;\r\n map_tracksPerView[40] = base;\r\n map_tracksPerView[15].push_back(5);\r\n map_tracksPerView[20].push_back(6);\r\n\r\n std::set<std::size_t> set_visibleTracks;\r\n TracksUtilsMap::GetCommonTracksInImages(set_imageIndex, map_tracksPerView, set_visibleTracks);\r\n CHECK_EQUAL(base.size(), set_visibleTracks.size());\r\n }\r\n {\r\n std::set<std::size_t> set_imageIndex {15, 20, 10, 40};\r\n TracksPerView map_tracksPerView;\r\n\r\n std::vector<std::size_t> base{1,2,3,4};\r\n map_tracksPerView[10] = base;\r\n map_tracksPerView[15] = base;\r\n map_tracksPerView[20] = base;\r\n map_tracksPerView[40] = base;\r\n\r\n map_tracksPerView[10].push_back(100);\r\n map_tracksPerView[15].push_back(100);\r\n map_tracksPerView[20].push_back(100);\r\n\r\n map_tracksPerView[15].push_back(200);\r\n map_tracksPerView[20].push_back(200);\r\n map_tracksPerView[40].push_back(200);\r\n\r\n map_tracksPerView[15].push_back(5);\r\n map_tracksPerView[20].push_back(6);\r\n\r\n std::set<std::size_t> set_visibleTracks;\r\n TracksUtilsMap::GetCommonTracksInImages(set_imageIndex, map_tracksPerView, set_visibleTracks);\r\n CHECK_EQUAL(base.size(), set_visibleTracks.size());\r\n }\r\n}\r\n\r\n\/* ************************************************************************* *\/\r\nint main() { TestResult tr; return TestRegistry::runAllTests(tr);}\r\n\/* ************************************************************************* *\/\r\n<commit_msg>[tracks] added a test to check common tracks with a view without visible tracks<commit_after>\r\n\/\/ Copyright (c) 2012, 2013 Pierre MOULON\r\n\r\n\/\/ This Source Code Form is subject to the terms of the Mozilla Public\r\n\/\/ License, v. 2.0. If a copy of the MPL was not distributed with this\r\n\/\/ file, You can obtain one at http:\/\/mozilla.org\/MPL\/2.0\/.\r\n\r\n#include \"CppUnitLite\/TestHarness.h\"\r\n#include \"testing\/testing.h\"\r\n\r\n#include \"openMVG\/tracks\/tracks.hpp\"\r\n#include \"openMVG\/matching\/indMatch.hpp\"\r\nusing namespace openMVG::tracks;\r\nusing namespace openMVG::matching;\r\n\r\n#include <vector>\r\n#include <utility>\r\n\r\nTEST(Tracks, Simple) {\r\n\r\n \/\/ Create some tracks for image (A,B,C)\r\n \/\/ {A,B,C} imageId will be {0,1,2}\r\n \/\/ For those image link some features id depicted below\r\n \/\/A B C\r\n \/\/0 -> 0 -> 0\r\n \/\/1 -> 1 -> 6\r\n \/\/2 -> 3\r\n\r\n \/\/ Create the input pairwise correspondences\r\n PairWiseMatches map_pairwisematches;\r\n\r\n const IndMatch testAB[] = {IndMatch(0,0), IndMatch(1,1), IndMatch(2,3)};\r\n const IndMatch testBC[] = {IndMatch(0,0), IndMatch(1,6)};\r\n\r\n const std::vector<IndMatch> ab(testAB, testAB+3);\r\n const std::vector<IndMatch> bc(testBC, testBC+2);\r\n const int A = 0;\r\n const int B = 1;\r\n const int C = 2;\r\n map_pairwisematches[ std::make_pair(A,B) ] = ab;\r\n map_pairwisematches[ std::make_pair(B,C) ] = bc;\r\n\r\n \/\/-- Build tracks using the interface tracksbuilder\r\n TracksBuilder trackBuilder;\r\n trackBuilder.Build( map_pairwisematches );\r\n\r\n trackBuilder.ExportToStream(std::cout);\r\n\r\n STLMAPTracks map_tracks;\r\n trackBuilder.ExportToSTL(map_tracks);\r\n\r\n \/\/-------------------\r\n \/\/ Unit Test check\r\n \/\/-------------------\r\n\r\n \/\/0, {(0,0) (1,0) (2,0)}\r\n \/\/1, {(0,1) (1,1) (2,6)}\r\n \/\/2, {(0,2) (1,3)}\r\n const std::pair<std::size_t,std::size_t> GT_Tracks[] =\r\n {\r\n std::make_pair(0,0), std::make_pair(1,0), std::make_pair(2,0),\r\n std::make_pair(0,1), std::make_pair(1,1), std::make_pair(2,6),\r\n std::make_pair(0,2), std::make_pair(1,3)\r\n };\r\n\r\n CHECK_EQUAL(3, map_tracks.size());\r\n std::size_t cpt = 0, i = 0;\r\n for (STLMAPTracks::const_iterator iterT = map_tracks.begin();\r\n iterT != map_tracks.end();\r\n ++iterT, ++i)\r\n {\r\n CHECK_EQUAL(i, iterT->first);\r\n for (submapTrack::const_iterator iter = iterT->second.begin();\r\n iter != iterT->second.end();\r\n ++iter)\r\n {\r\n CHECK( GT_Tracks[cpt] == std::make_pair(iter->first, iter->second));\r\n ++cpt;\r\n }\r\n }\r\n}\r\n\r\nTEST(Tracks, filter_3viewAtLeast) {\r\n\r\n \/\/\r\n \/\/A B C\r\n \/\/0 -> 0 -> 0\r\n \/\/1 -> 1 -> 6\r\n \/\/2 -> 3\r\n \/\/\r\n\r\n \/\/ Create the input pairwise correspondences\r\n PairWiseMatches map_pairwisematches;\r\n\r\n IndMatch testAB[] = {IndMatch(0,0), IndMatch(1,1), IndMatch(2,3)};\r\n IndMatch testBC[] = {IndMatch(0,0), IndMatch(1,6)};\r\n\r\n\r\n std::vector<IndMatch> ab(testAB, testAB+3);\r\n std::vector<IndMatch> bc(testBC, testBC+2);\r\n const int A = 0;\r\n const int B = 1;\r\n const int C = 2;\r\n map_pairwisematches[ std::make_pair(A,B) ] = ab;\r\n map_pairwisematches[ std::make_pair(B,C) ] = bc;\r\n\r\n \/\/-- Build tracks using the interface tracksbuilder\r\n TracksBuilder trackBuilder;\r\n trackBuilder.Build( map_pairwisematches );\r\n CHECK_EQUAL(3, trackBuilder.NbTracks());\r\n trackBuilder.Filter(3);\r\n CHECK_EQUAL(2, trackBuilder.NbTracks());\r\n}\r\n\r\nTEST(Tracks, Conflict) {\r\n\r\n \/\/\r\n \/\/A B C\r\n \/\/0 -> 0 -> 0\r\n \/\/1 -> 1 -> 6\r\n \/\/{2 -> 3 -> 2\r\n \/\/ 3 -> 8 } This track must be deleted, index 3 appears two times\r\n \/\/\r\n\r\n \/\/ Create the input pairwise correspondences\r\n PairWiseMatches map_pairwisematches;\r\n\r\n const IndMatch testAB[] = {IndMatch(0,0), IndMatch(1,1), IndMatch(2,3)};\r\n const IndMatch testBC[] = {IndMatch(0,0), IndMatch(1,6), IndMatch(3,2), IndMatch(3,8)};\r\n\r\n std::vector<IndMatch> ab(testAB, testAB+3);\r\n std::vector<IndMatch> bc(testBC, testBC+4);\r\n const int A = 0;\r\n const int B = 1;\r\n const int C = 2;\r\n map_pairwisematches[ std::make_pair(A,B) ] = ab;\r\n map_pairwisematches[ std::make_pair(B,C) ] = bc;\r\n\r\n \/\/-- Build tracks using the interface tracksbuilder\r\n TracksBuilder trackBuilder;\r\n trackBuilder.Build( map_pairwisematches );\r\n\r\n CHECK_EQUAL(3, trackBuilder.NbTracks());\r\n trackBuilder.Filter(); \/\/ Key feature tested here to kill the conflicted track\r\n CHECK_EQUAL(2, trackBuilder.NbTracks());\r\n\r\n STLMAPTracks map_tracks;\r\n trackBuilder.ExportToSTL(map_tracks);\r\n\r\n \/\/-------------------\r\n \/\/ Unit Test check\r\n \/\/-------------------\r\n\r\n \/\/0, {(0,0) (1,0) (2,0)}\r\n \/\/1, {(0,1) (1,1) (2,6)}\r\n const std::pair<std::size_t,std::size_t> GT_Tracks[] =\r\n {std::make_pair(0,0), std::make_pair(1,0), std::make_pair(2,0),\r\n std::make_pair(0,1), std::make_pair(1,1), std::make_pair(2,6)};\r\n\r\n CHECK_EQUAL(2, map_tracks.size());\r\n std::size_t cpt = 0, i = 0;\r\n for (STLMAPTracks::const_iterator iterT = map_tracks.begin();\r\n iterT != map_tracks.end();\r\n ++iterT, ++i)\r\n {\r\n CHECK_EQUAL(i, iterT->first);\r\n for (submapTrack::const_iterator iter = iterT->second.begin();\r\n iter != iterT->second.end();\r\n ++iter)\r\n {\r\n CHECK( GT_Tracks[cpt] == std::make_pair(iter->first, iter->second));\r\n ++cpt;\r\n }\r\n }\r\n}\r\n\r\nTEST(Tracks, GetCommonTracksInImages)\r\n{\r\n {\r\n std::set<std::size_t> set_imageIndex {15, 20};\r\n TracksPerView map_tracksPerView;\r\n\r\n std::vector<std::size_t> base{1,2,3,4};\r\n map_tracksPerView[10] = base;\r\n map_tracksPerView[15] = base;\r\n map_tracksPerView[20] = base;\r\n map_tracksPerView[40] = base;\r\n map_tracksPerView[15].push_back(5);\r\n map_tracksPerView[20].push_back(6);\r\n\r\n std::set<std::size_t> set_visibleTracks;\r\n TracksUtilsMap::GetCommonTracksInImages(set_imageIndex, map_tracksPerView, set_visibleTracks);\r\n CHECK_EQUAL(base.size(), set_visibleTracks.size());\r\n set_visibleTracks.clear();\r\n \/\/ test non-existing view index\r\n TracksUtilsMap::GetCommonTracksInImages({15, 50}, map_tracksPerView, set_visibleTracks);\r\n CHECK(set_visibleTracks.empty());\r\n }\r\n {\r\n std::set<std::size_t> set_imageIndex {15, 20, 10, 40};\r\n TracksPerView map_tracksPerView;\r\n\r\n std::vector<std::size_t> base{1,2,3,4};\r\n map_tracksPerView[10] = base;\r\n map_tracksPerView[15] = base;\r\n map_tracksPerView[20] = base;\r\n map_tracksPerView[40] = base;\r\n\r\n map_tracksPerView[10].push_back(100);\r\n map_tracksPerView[15].push_back(100);\r\n map_tracksPerView[20].push_back(100);\r\n\r\n map_tracksPerView[15].push_back(200);\r\n map_tracksPerView[20].push_back(200);\r\n map_tracksPerView[40].push_back(200);\r\n\r\n map_tracksPerView[15].push_back(5);\r\n map_tracksPerView[20].push_back(6);\r\n\r\n std::set<std::size_t> set_visibleTracks;\r\n TracksUtilsMap::GetCommonTracksInImages(set_imageIndex, map_tracksPerView, set_visibleTracks);\r\n CHECK_EQUAL(base.size(), set_visibleTracks.size());\r\n }\r\n}\r\n\r\n\/* ************************************************************************* *\/\r\nint main() { TestResult tr; return TestRegistry::runAllTests(tr);}\r\n\/* ************************************************************************* *\/\r\n<|endoftext|>"} {"text":"<commit_before>\/*\n * AccumulateLayer.cpp\n *\n * Created on: Nov 18, 2013\n * Author: pschultz\n *\/\n\n#include \"AccumulateLayer.hpp\"\n\nnamespace PV {\n\nAccumulateLayer::AccumulateLayer(const char * name, HyPerCol * hc, int numChannels) {\n initialize_base();\n initialize(name, hc, numChannels);\n}\n\nAccumulateLayer::AccumulateLayer() {\n initialize_base();\n}\n\nint AccumulateLayer::initialize_base() {\n syncedInputLayerName = NULL;\n syncedInputLayer = NULL;\n return PV_SUCCESS;\n}\n\nint AccumulateLayer::initialize(const char * name, HyPerCol * hc, int numChannels) {\n return ANNLayer::initialize(name, hc, numChannels);\n}\n\nint AccumulateLayer::setParams(PVParams * inputParams) {\n int status = ANNLayer::setParams(inputParams);\n readSyncedInputLayer(inputParams);\n return status;\n}\n\nvoid AccumulateLayer::readSyncedInputLayer(PVParams * params) {\n const char * synced_input_layer_name = params->stringValue(name, \"syncedInputLayer\");\n if (synced_input_layer_name != NULL) {\n syncedInputLayerName = strdup(synced_input_layer_name);\n if (syncedInputLayerName == NULL) {\n fprintf(stderr, \"%s \\\"%s\\\": unable to allocate memory for syncedInputLayer: %s\\n\", params->groupKeywordFromName(name), name, strerror(errno));\n exit(EXIT_FAILURE);\n }\n }\n}\n\nint AccumulateLayer::communicateInitInfo() {\n if (syncedInputLayerName != NULL) {\n syncedInputLayer = parent->getLayerFromName(syncedInputLayerName);\n if (syncedInputLayer == NULL) {\n fprintf(stderr, \"%s \\\"%s\\\": syncedInputLayer \\\"%s\\\" is not a layer in the column.\\n\", parent->parameters()->groupKeywordFromName(name), name, syncedInputLayerName);\n exit(EXIT_FAILURE);\n }\n }\n return PV_SUCCESS;\n}\n\nint AccumulateLayer::doUpdateState(double time, double dt, const PVLayerLoc * loc, pvdata_t * A,\n pvdata_t * V, int num_channels, pvdata_t * gSynHead, bool spiking,\n unsigned int * active_indices, unsigned int * num_active)\n{\n bool needsUpdate = false;\n if (syncedInputLayer != NULL) {\n if (getPhase() > syncedInputLayer->getPhase()) {\n needsUpdate = syncedInputLayer->getLastUpdateTime() >= lastUpdateTime;\n }\n else {\n needsUpdate = syncedInputLayer->getLastUpdateTime() > lastUpdateTime;\n }\n }\n if (needsUpdate) {\n memset(clayer->activity->data, 0, sizeof(pvdata_t)*getNumExtended());\n }\n update_timer->start();\n#ifdef PV_USE_OPENCL\n if(gpuAccelerateFlag) {\n updateStateOpenCL(time, dt);\n \/\/HyPerLayer::updateState(time, dt);\n }\n else {\n#endif\n int nx = loc->nx;\n int ny = loc->ny;\n int nf = loc->nf;\n int num_neurons = nx*ny*nf;\n updateV_AccumulateLayer(num_neurons, V, num_channels, gSynHead, A,\n VMax, VMin, VThresh, VShift, VWidth, nx, ny, nf, loc->nb);\n if (this->writeSparseActivity){\n updateActiveIndices(); \/\/ added by GTK to allow for sparse output, can this be made an inline function???\n }\n#ifdef PV_USE_OPENCL\n }\n#endif\n\n update_timer->stop();\n return PV_SUCCESS;\n}\n\nint AccumulateLayer::setActivity() {\n const PVLayerLoc * loc = getLayerLoc();\n int nx = loc->nx;\n int ny = loc->ny;\n int nf = loc->nf;\n int nb = loc->nb;\n int num_neurons = nx*ny*nf;\n int status;\n memset(clayer->activity->data, 0, sizeof(pvdata_t)*getNumExtended());\n if( status == PV_SUCCESS ) status = applyVThresh_ANNLayer(num_neurons, getV(), VMin, VThresh, VShift, VWidth, getCLayer()->activity->data, nx, ny, nf, nb);\n if( status == PV_SUCCESS ) status = applyVMax_ANNLayer(num_neurons, getV(), VMax, getCLayer()->activity->data, nx, ny, nf, nb);\n return status;\n}\n\nAccumulateLayer::~AccumulateLayer() {\n}\n\n} \/* namespace PV *\/\n<commit_msg>Eliminate uninitialized-variable warning<commit_after>\/*\n * AccumulateLayer.cpp\n *\n * Created on: Nov 18, 2013\n * Author: pschultz\n *\/\n\n#include \"AccumulateLayer.hpp\"\n\nnamespace PV {\n\nAccumulateLayer::AccumulateLayer(const char * name, HyPerCol * hc, int numChannels) {\n initialize_base();\n initialize(name, hc, numChannels);\n}\n\nAccumulateLayer::AccumulateLayer() {\n initialize_base();\n}\n\nint AccumulateLayer::initialize_base() {\n syncedInputLayerName = NULL;\n syncedInputLayer = NULL;\n return PV_SUCCESS;\n}\n\nint AccumulateLayer::initialize(const char * name, HyPerCol * hc, int numChannels) {\n return ANNLayer::initialize(name, hc, numChannels);\n}\n\nint AccumulateLayer::setParams(PVParams * inputParams) {\n int status = ANNLayer::setParams(inputParams);\n readSyncedInputLayer(inputParams);\n return status;\n}\n\nvoid AccumulateLayer::readSyncedInputLayer(PVParams * params) {\n const char * synced_input_layer_name = params->stringValue(name, \"syncedInputLayer\");\n if (synced_input_layer_name != NULL) {\n syncedInputLayerName = strdup(synced_input_layer_name);\n if (syncedInputLayerName == NULL) {\n fprintf(stderr, \"%s \\\"%s\\\": unable to allocate memory for syncedInputLayer: %s\\n\", params->groupKeywordFromName(name), name, strerror(errno));\n exit(EXIT_FAILURE);\n }\n }\n}\n\nint AccumulateLayer::communicateInitInfo() {\n if (syncedInputLayerName != NULL) {\n syncedInputLayer = parent->getLayerFromName(syncedInputLayerName);\n if (syncedInputLayer == NULL) {\n fprintf(stderr, \"%s \\\"%s\\\": syncedInputLayer \\\"%s\\\" is not a layer in the column.\\n\", parent->parameters()->groupKeywordFromName(name), name, syncedInputLayerName);\n exit(EXIT_FAILURE);\n }\n }\n return PV_SUCCESS;\n}\n\nint AccumulateLayer::doUpdateState(double time, double dt, const PVLayerLoc * loc, pvdata_t * A,\n pvdata_t * V, int num_channels, pvdata_t * gSynHead, bool spiking,\n unsigned int * active_indices, unsigned int * num_active)\n{\n bool needsUpdate = false;\n if (syncedInputLayer != NULL) {\n if (getPhase() > syncedInputLayer->getPhase()) {\n needsUpdate = syncedInputLayer->getLastUpdateTime() >= lastUpdateTime;\n }\n else {\n needsUpdate = syncedInputLayer->getLastUpdateTime() > lastUpdateTime;\n }\n }\n if (needsUpdate) {\n memset(clayer->activity->data, 0, sizeof(pvdata_t)*getNumExtended());\n }\n update_timer->start();\n#ifdef PV_USE_OPENCL\n if(gpuAccelerateFlag) {\n updateStateOpenCL(time, dt);\n \/\/HyPerLayer::updateState(time, dt);\n }\n else {\n#endif\n int nx = loc->nx;\n int ny = loc->ny;\n int nf = loc->nf;\n int num_neurons = nx*ny*nf;\n updateV_AccumulateLayer(num_neurons, V, num_channels, gSynHead, A,\n VMax, VMin, VThresh, VShift, VWidth, nx, ny, nf, loc->nb);\n if (this->writeSparseActivity){\n updateActiveIndices(); \/\/ added by GTK to allow for sparse output, can this be made an inline function???\n }\n#ifdef PV_USE_OPENCL\n }\n#endif\n\n update_timer->stop();\n return PV_SUCCESS;\n}\n\nint AccumulateLayer::setActivity() {\n const PVLayerLoc * loc = getLayerLoc();\n int nx = loc->nx;\n int ny = loc->ny;\n int nf = loc->nf;\n int nb = loc->nb;\n int num_neurons = nx*ny*nf;\n int status = PV_SUCCESS;\n memset(clayer->activity->data, 0, sizeof(pvdata_t)*getNumExtended());\n if( status == PV_SUCCESS ) status = applyVThresh_ANNLayer(num_neurons, getV(), VMin, VThresh, VShift, VWidth, getCLayer()->activity->data, nx, ny, nf, nb);\n if( status == PV_SUCCESS ) status = applyVMax_ANNLayer(num_neurons, getV(), VMax, getCLayer()->activity->data, nx, ny, nf, nb);\n return status;\n}\n\nAccumulateLayer::~AccumulateLayer() {\n}\n\n} \/* namespace PV *\/\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 \"native_client\/src\/shared\/ppapi_proxy\/browser_ppp_input_event.h\"\n\n#include \"native_client\/src\/include\/nacl_scoped_ptr.h\"\n#include \"native_client\/src\/include\/portability.h\"\n#include \"native_client\/src\/shared\/ppapi_proxy\/browser_globals.h\"\n#include \"native_client\/src\/shared\/ppapi_proxy\/input_event_data.h\"\n#include \"native_client\/src\/shared\/ppapi_proxy\/object_serialize.h\"\n#include \"native_client\/src\/shared\/ppapi_proxy\/browser_ppp.h\"\n#include \"native_client\/src\/shared\/ppapi_proxy\/trusted\/srpcgen\/ppp_rpc.h\"\n#include \"native_client\/src\/shared\/ppapi_proxy\/utility.h\"\n#include \"ppapi\/c\/pp_resource.h\"\n#include \"ppapi\/c\/ppp_input_event.h\"\n\nnamespace ppapi_proxy {\n\nnamespace {\n\nPP_Bool HandleInputEvent(PP_Instance instance, PP_Resource input_event) {\n DebugPrintf(\"PPP_InputEvent::HandleInputEvent: instance=%\"NACL_PRIu32\", \"\n \"input_event = %\"NACL_PRIu32\"\\n\",\n instance, input_event);\n\n PP_Var character_text = PP_MakeUndefined();\n InputEventData data;\n data.event_type = PPBInputEventInterface()->GetType(input_event);\n data.event_time_stamp = PPBInputEventInterface()->GetTimeStamp(input_event);\n data.event_modifiers = PPBInputEventInterface()->GetModifiers(input_event);\n\n switch (data.event_type) {\n \/\/ These events all use the PPB_MouseInputEvent interface.\n case PP_INPUTEVENT_TYPE_MOUSEDOWN:\n case PP_INPUTEVENT_TYPE_MOUSEUP:\n case PP_INPUTEVENT_TYPE_MOUSEENTER:\n case PP_INPUTEVENT_TYPE_MOUSELEAVE:\n case PP_INPUTEVENT_TYPE_MOUSEMOVE:\n case PP_INPUTEVENT_TYPE_CONTEXTMENU:\n data.mouse_button =\n PPBMouseInputEventInterface()->GetButton(input_event);\n data.mouse_position =\n PPBMouseInputEventInterface()->GetPosition(input_event);\n data.mouse_click_count =\n PPBMouseInputEventInterface()->GetClickCount(input_event);\n data.mouse_movement =\n PPBMouseInputEventInterface()->GetMovement(input_event);\n break;\n \/\/ This event uses the PPB_WheelInputEvent interface.\n case PP_INPUTEVENT_TYPE_WHEEL:\n data.wheel_delta =\n PPBWheelInputEventInterface()->GetDelta(input_event);\n data.wheel_ticks =\n PPBWheelInputEventInterface()->GetTicks(input_event);\n data.wheel_scroll_by_page =\n PPBWheelInputEventInterface()->GetScrollByPage(input_event);\n break;\n \/\/ These events all use the PPB_KeyInputEvent interface.\n case PP_INPUTEVENT_TYPE_RAWKEYDOWN:\n case PP_INPUTEVENT_TYPE_KEYDOWN:\n case PP_INPUTEVENT_TYPE_KEYUP:\n case PP_INPUTEVENT_TYPE_CHAR:\n data.key_code =\n PPBKeyboardInputEventInterface()->GetKeyCode(input_event);\n character_text =\n PPBKeyboardInputEventInterface()->GetCharacterText(input_event);\n break;\n case PP_INPUTEVENT_TYPE_UNDEFINED:\n return PP_FALSE;\n \/\/ No default case; if any new types are added we should get a compile\n \/\/ warning.\n }\n \/\/ Now data and character_text have all the data we want to send to the\n \/\/ untrusted side.\n\n \/\/ character_text should either be undefined or a string type.\n DCHECK((character_text.type == PP_VARTYPE_UNDEFINED) ||\n (character_text.type == PP_VARTYPE_STRING));\n \/\/ Serialize the character_text Var.\n uint32_t text_size = kMaxVarSize;\n nacl::scoped_array<char> text_bytes(Serialize(&character_text, 1,\n &text_size));\n int32_t handled;\n NaClSrpcError srpc_result =\n PppInputEventRpcClient::PPP_InputEvent_HandleInputEvent(\n GetMainSrpcChannel(instance),\n instance,\n input_event,\n sizeof(data),\n reinterpret_cast<char*>(&data),\n text_size,\n text_bytes.get(),\n &handled);\n DebugPrintf(\"PPP_Instance::HandleInputEvent: %s\\n\",\n NaClSrpcErrorString(srpc_result));\n if (srpc_result != NACL_SRPC_RESULT_OK) {\n return PP_FALSE;\n }\n \/\/ The 'handled' int should only ever have a value matching one of PP_FALSE\n \/\/ or PP_TRUE. Otherwise, there's an error in the proxy.\n DCHECK((handled == static_cast<int32_t>(PP_FALSE) ||\n (handled == static_cast<int32_t>(PP_TRUE))));\n PP_Bool handled_bool = static_cast<PP_Bool>(handled);\n return handled_bool;\n}\n\n} \/\/ namespace\n\nconst PPP_InputEvent* BrowserInputEvent::GetInterface() {\n static const PPP_InputEvent input_event_interface = {\n HandleInputEvent\n };\n return &input_event_interface;\n}\n\n} \/\/ namespace ppapi_proxy\n<commit_msg>Add new input event enums for deps roll BUG= none TEST= existing test suites Review URL: http:\/\/codereview.chromium.org\/7925019<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 \"native_client\/src\/shared\/ppapi_proxy\/browser_ppp_input_event.h\"\n\n#include \"native_client\/src\/include\/nacl_scoped_ptr.h\"\n#include \"native_client\/src\/include\/portability.h\"\n#include \"native_client\/src\/shared\/ppapi_proxy\/browser_globals.h\"\n#include \"native_client\/src\/shared\/ppapi_proxy\/input_event_data.h\"\n#include \"native_client\/src\/shared\/ppapi_proxy\/object_serialize.h\"\n#include \"native_client\/src\/shared\/ppapi_proxy\/browser_ppp.h\"\n#include \"native_client\/src\/shared\/ppapi_proxy\/trusted\/srpcgen\/ppp_rpc.h\"\n#include \"native_client\/src\/shared\/ppapi_proxy\/utility.h\"\n#include \"ppapi\/c\/pp_resource.h\"\n#include \"ppapi\/c\/ppp_input_event.h\"\n\nnamespace ppapi_proxy {\n\nnamespace {\n\nPP_Bool HandleInputEvent(PP_Instance instance, PP_Resource input_event) {\n DebugPrintf(\"PPP_InputEvent::HandleInputEvent: instance=%\"NACL_PRIu32\", \"\n \"input_event = %\"NACL_PRIu32\"\\n\",\n instance, input_event);\n\n PP_Var character_text = PP_MakeUndefined();\n InputEventData data;\n data.event_type = PPBInputEventInterface()->GetType(input_event);\n data.event_time_stamp = PPBInputEventInterface()->GetTimeStamp(input_event);\n data.event_modifiers = PPBInputEventInterface()->GetModifiers(input_event);\n\n switch (data.event_type) {\n \/\/ These events all use the PPB_MouseInputEvent interface.\n case PP_INPUTEVENT_TYPE_MOUSEDOWN:\n case PP_INPUTEVENT_TYPE_MOUSEUP:\n case PP_INPUTEVENT_TYPE_MOUSEENTER:\n case PP_INPUTEVENT_TYPE_MOUSELEAVE:\n case PP_INPUTEVENT_TYPE_MOUSEMOVE:\n case PP_INPUTEVENT_TYPE_CONTEXTMENU:\n data.mouse_button =\n PPBMouseInputEventInterface()->GetButton(input_event);\n data.mouse_position =\n PPBMouseInputEventInterface()->GetPosition(input_event);\n data.mouse_click_count =\n PPBMouseInputEventInterface()->GetClickCount(input_event);\n data.mouse_movement =\n PPBMouseInputEventInterface()->GetMovement(input_event);\n break;\n \/\/ This event uses the PPB_WheelInputEvent interface.\n case PP_INPUTEVENT_TYPE_WHEEL:\n data.wheel_delta =\n PPBWheelInputEventInterface()->GetDelta(input_event);\n data.wheel_ticks =\n PPBWheelInputEventInterface()->GetTicks(input_event);\n data.wheel_scroll_by_page =\n PPBWheelInputEventInterface()->GetScrollByPage(input_event);\n break;\n \/\/ These events all use the PPB_KeyInputEvent interface.\n case PP_INPUTEVENT_TYPE_RAWKEYDOWN:\n case PP_INPUTEVENT_TYPE_KEYDOWN:\n case PP_INPUTEVENT_TYPE_KEYUP:\n case PP_INPUTEVENT_TYPE_CHAR:\n data.key_code =\n PPBKeyboardInputEventInterface()->GetKeyCode(input_event);\n character_text =\n PPBKeyboardInputEventInterface()->GetCharacterText(input_event);\n break;\n case PP_INPUTEVENT_TYPE_UNDEFINED:\n return PP_FALSE;\n \/\/ TODO(nfullagar): Implement support for event types below.\n case PP_INPUTEVENT_TYPE_COMPOSITION_START:\n case PP_INPUTEVENT_TYPE_COMPOSITION_UPDATE:\n case PP_INPUTEVENT_TYPE_COMPOSITION_END:\n case PP_INPUTEVENT_TYPE_IME_TEXT:\n DebugPrintf(\" No implementation for event type %d\\n\",\n data.event_type);\n return PP_FALSE;\n \/\/ No default case; if any new types are added we should get a compile\n \/\/ warning.\n }\n \/\/ Now data and character_text have all the data we want to send to the\n \/\/ untrusted side.\n\n \/\/ character_text should either be undefined or a string type.\n DCHECK((character_text.type == PP_VARTYPE_UNDEFINED) ||\n (character_text.type == PP_VARTYPE_STRING));\n \/\/ Serialize the character_text Var.\n uint32_t text_size = kMaxVarSize;\n nacl::scoped_array<char> text_bytes(Serialize(&character_text, 1,\n &text_size));\n int32_t handled;\n NaClSrpcError srpc_result =\n PppInputEventRpcClient::PPP_InputEvent_HandleInputEvent(\n GetMainSrpcChannel(instance),\n instance,\n input_event,\n sizeof(data),\n reinterpret_cast<char*>(&data),\n text_size,\n text_bytes.get(),\n &handled);\n DebugPrintf(\"PPP_Instance::HandleInputEvent: %s\\n\",\n NaClSrpcErrorString(srpc_result));\n if (srpc_result != NACL_SRPC_RESULT_OK) {\n return PP_FALSE;\n }\n \/\/ The 'handled' int should only ever have a value matching one of PP_FALSE\n \/\/ or PP_TRUE. Otherwise, there's an error in the proxy.\n DCHECK((handled == static_cast<int32_t>(PP_FALSE) ||\n (handled == static_cast<int32_t>(PP_TRUE))));\n PP_Bool handled_bool = static_cast<PP_Bool>(handled);\n return handled_bool;\n}\n\n} \/\/ namespace\n\nconst PPP_InputEvent* BrowserInputEvent::GetInterface() {\n static const PPP_InputEvent input_event_interface = {\n HandleInputEvent\n };\n return &input_event_interface;\n}\n\n} \/\/ namespace ppapi_proxy\n<|endoftext|>"} {"text":"<commit_before>\/\/ Copyright (c) 2012 The Chromium Authors. All rights reserved.\n\/\/ Use of this source code is governed by a BSD-style license that can be\n\/\/ found in the LICENSE file.\n\n#include \"media\/audio\/audio_output_controller.h\"\n\n#include \"base\/bind.h\"\n#include \"base\/debug\/trace_event.h\"\n#include \"base\/message_loop.h\"\n#include \"base\/threading\/platform_thread.h\"\n#include \"base\/time.h\"\n#include \"build\/build_config.h\"\n#include \"media\/audio\/audio_util.h\"\n#include \"media\/audio\/shared_memory_util.h\"\n\nusing base::Time;\nusing base::TimeDelta;\n\nnamespace media {\n\n\/\/ Polling-related constants.\nconst int AudioOutputController::kPollNumAttempts = 3;\nconst int AudioOutputController::kPollPauseInMilliseconds = 3;\n\nAudioOutputController::AudioOutputController(AudioManager* audio_manager,\n EventHandler* handler,\n const AudioParameters& params,\n SyncReader* sync_reader)\n : audio_manager_(audio_manager),\n params_(params),\n handler_(handler),\n stream_(NULL),\n diverting_to_stream_(NULL),\n volume_(1.0),\n state_(kEmpty),\n num_allowed_io_(0),\n sync_reader_(sync_reader),\n message_loop_(audio_manager->GetMessageLoop()),\n number_polling_attempts_left_(0),\n ALLOW_THIS_IN_INITIALIZER_LIST(weak_this_(this)) {\n DCHECK(audio_manager);\n DCHECK(handler_);\n DCHECK(sync_reader_);\n DCHECK(message_loop_);\n}\n\nAudioOutputController::~AudioOutputController() {\n DCHECK_EQ(kClosed, state_);\n}\n\n\/\/ static\nscoped_refptr<AudioOutputController> AudioOutputController::Create(\n AudioManager* audio_manager,\n EventHandler* event_handler,\n const AudioParameters& params,\n SyncReader* sync_reader) {\n DCHECK(audio_manager);\n DCHECK(sync_reader);\n\n if (!params.IsValid() || !audio_manager)\n return NULL;\n\n scoped_refptr<AudioOutputController> controller(new AudioOutputController(\n audio_manager, event_handler, params, sync_reader));\n controller->message_loop_->PostTask(FROM_HERE, base::Bind(\n &AudioOutputController::DoCreate, controller, false));\n return controller;\n}\n\nvoid AudioOutputController::Play() {\n message_loop_->PostTask(FROM_HERE, base::Bind(\n &AudioOutputController::DoPlay, this));\n}\n\nvoid AudioOutputController::Pause() {\n message_loop_->PostTask(FROM_HERE, base::Bind(\n &AudioOutputController::DoPause, this));\n}\n\nvoid AudioOutputController::Flush() {\n message_loop_->PostTask(FROM_HERE, base::Bind(\n &AudioOutputController::DoFlush, this));\n}\n\nvoid AudioOutputController::Close(const base::Closure& closed_task) {\n DCHECK(!closed_task.is_null());\n message_loop_->PostTaskAndReply(FROM_HERE, base::Bind(\n &AudioOutputController::DoClose, this), closed_task);\n}\n\nvoid AudioOutputController::SetVolume(double volume) {\n message_loop_->PostTask(FROM_HERE, base::Bind(\n &AudioOutputController::DoSetVolume, this, volume));\n}\n\nvoid AudioOutputController::DoCreate(bool is_for_device_change) {\n DCHECK(message_loop_->BelongsToCurrentThread());\n\n \/\/ Close() can be called before DoCreate() is executed.\n if (state_ == kClosed)\n return;\n\n DoStopCloseAndClearStream(); \/\/ Calls RemoveOutputDeviceChangeListener().\n DCHECK_EQ(kEmpty, state_);\n\n stream_ = diverting_to_stream_ ? diverting_to_stream_ :\n audio_manager_->MakeAudioOutputStreamProxy(params_);\n if (!stream_) {\n state_ = kError;\n\n \/\/ TODO(hclam): Define error types.\n handler_->OnError(this, 0);\n return;\n }\n\n if (!stream_->Open()) {\n DoStopCloseAndClearStream();\n state_ = kError;\n\n \/\/ TODO(hclam): Define error types.\n handler_->OnError(this, 0);\n return;\n }\n\n \/\/ Everything started okay, so re-register for state change callbacks if\n \/\/ stream_ was created via AudioManager.\n if (stream_ != diverting_to_stream_)\n audio_manager_->AddOutputDeviceChangeListener(this);\n\n \/\/ We have successfully opened the stream. Set the initial volume.\n stream_->SetVolume(volume_);\n\n \/\/ Finally set the state to kCreated.\n state_ = kCreated;\n\n \/\/ And then report we have been created if we haven't done so already.\n if (!is_for_device_change)\n handler_->OnCreated(this);\n}\n\nvoid AudioOutputController::DoPlay() {\n DCHECK(message_loop_->BelongsToCurrentThread());\n\n \/\/ We can start from created or paused state.\n if (state_ != kCreated && state_ != kPaused)\n return;\n\n state_ = kStarting;\n\n \/\/ Ask for first packet.\n sync_reader_->UpdatePendingBytes(0);\n\n \/\/ Cannot start stream immediately, should give renderer some time\n \/\/ to deliver data.\n \/\/ TODO(vrk): The polling here and in WaitTillDataReady() is pretty clunky.\n \/\/ Refine the API such that polling is no longer needed. (crbug.com\/112196)\n number_polling_attempts_left_ = kPollNumAttempts;\n DCHECK(!weak_this_.HasWeakPtrs());\n message_loop_->PostDelayedTask(\n FROM_HERE,\n base::Bind(&AudioOutputController::PollAndStartIfDataReady,\n weak_this_.GetWeakPtr()),\n TimeDelta::FromMilliseconds(kPollPauseInMilliseconds));\n}\n\nvoid AudioOutputController::PollAndStartIfDataReady() {\n DCHECK(message_loop_->BelongsToCurrentThread());\n\n DCHECK_EQ(kStarting, state_);\n\n \/\/ If we are ready to start the stream, start it.\n if (--number_polling_attempts_left_ == 0 ||\n sync_reader_->DataReady()) {\n StartStream();\n } else {\n message_loop_->PostDelayedTask(\n FROM_HERE,\n base::Bind(&AudioOutputController::PollAndStartIfDataReady,\n weak_this_.GetWeakPtr()),\n TimeDelta::FromMilliseconds(kPollPauseInMilliseconds));\n }\n}\n\nvoid AudioOutputController::StartStream() {\n DCHECK(message_loop_->BelongsToCurrentThread());\n state_ = kPlaying;\n\n \/\/ We start the AudioOutputStream lazily.\n AllowEntryToOnMoreIOData();\n stream_->Start(this);\n\n \/\/ Tell the event handler that we are now playing.\n handler_->OnPlaying(this);\n}\n\nvoid AudioOutputController::StopStream() {\n DCHECK(message_loop_->BelongsToCurrentThread());\n\n if (state_ == kStarting) {\n \/\/ Cancel in-progress polling start.\n weak_this_.InvalidateWeakPtrs();\n state_ = kPaused;\n } else if (state_ == kPlaying) {\n stream_->Stop();\n DisallowEntryToOnMoreIOData();\n state_ = kPaused;\n }\n}\n\nvoid AudioOutputController::DoPause() {\n DCHECK(message_loop_->BelongsToCurrentThread());\n\n StopStream();\n\n if (state_ != kPaused)\n return;\n\n \/\/ Send a special pause mark to the low-latency audio thread.\n sync_reader_->UpdatePendingBytes(kPauseMark);\n\n handler_->OnPaused(this);\n}\n\nvoid AudioOutputController::DoFlush() {\n DCHECK(message_loop_->BelongsToCurrentThread());\n\n \/\/ TODO(hclam): Actually flush the audio device.\n}\n\nvoid AudioOutputController::DoClose() {\n DCHECK(message_loop_->BelongsToCurrentThread());\n\n if (state_ != kClosed) {\n DoStopCloseAndClearStream();\n sync_reader_->Close();\n state_ = kClosed;\n }\n}\n\nvoid AudioOutputController::DoSetVolume(double volume) {\n DCHECK(message_loop_->BelongsToCurrentThread());\n\n \/\/ Saves the volume to a member first. We may not be able to set the volume\n \/\/ right away but when the stream is created we'll set the volume.\n volume_ = volume;\n\n switch (state_) {\n case kCreated:\n case kStarting:\n case kPlaying:\n case kPaused:\n stream_->SetVolume(volume_);\n break;\n default:\n return;\n }\n}\n\nvoid AudioOutputController::DoReportError(int code) {\n DCHECK(message_loop_->BelongsToCurrentThread());\n if (state_ != kClosed)\n handler_->OnError(this, code);\n}\n\nint AudioOutputController::OnMoreData(AudioBus* dest,\n AudioBuffersState buffers_state) {\n return OnMoreIOData(NULL, dest, buffers_state);\n}\n\nint AudioOutputController::OnMoreIOData(AudioBus* source,\n AudioBus* dest,\n AudioBuffersState buffers_state) {\n DisallowEntryToOnMoreIOData();\n TRACE_EVENT0(\"audio\", \"AudioOutputController::OnMoreIOData\");\n\n const int frames = sync_reader_->Read(source, dest);\n DCHECK_LE(0, frames);\n sync_reader_->UpdatePendingBytes(\n buffers_state.total_bytes() + frames * params_.GetBytesPerFrame());\n\n AllowEntryToOnMoreIOData();\n return frames;\n}\n\nvoid AudioOutputController::WaitTillDataReady() {\n base::Time start = base::Time::Now();\n \/\/ Wait for up to 1.5 seconds for DataReady(). 1.5 seconds was chosen because\n \/\/ it's larger than the playback time of the WaveOut buffer size using the\n \/\/ minimum supported sample rate: 4096 \/ 3000 = ~1.4 seconds. Even a client\n \/\/ expecting real time playout should be able to fill in this time.\n const base::TimeDelta max_wait = base::TimeDelta::FromMilliseconds(1500);\n while (!sync_reader_->DataReady() &&\n ((base::Time::Now() - start) < max_wait)) {\n base::PlatformThread::YieldCurrentThread();\n }\n}\n\nvoid AudioOutputController::OnError(AudioOutputStream* stream, int code) {\n \/\/ Handle error on the audio controller thread.\n message_loop_->PostTask(FROM_HERE, base::Bind(\n &AudioOutputController::DoReportError, this, code));\n}\n\nvoid AudioOutputController::DoStopCloseAndClearStream() {\n DCHECK(message_loop_->BelongsToCurrentThread());\n\n \/\/ Allow calling unconditionally and bail if we don't have a stream_ to close.\n if (stream_) {\n \/\/ De-register from state change callbacks if stream_ was created via\n \/\/ AudioManager.\n if (stream_ != diverting_to_stream_)\n audio_manager_->RemoveOutputDeviceChangeListener(this);\n\n StopStream();\n stream_->Close();\n if (stream_ == diverting_to_stream_)\n diverting_to_stream_ = NULL;\n stream_ = NULL;\n }\n\n state_ = kEmpty;\n}\n\nvoid AudioOutputController::OnDeviceChange() {\n DCHECK(message_loop_->BelongsToCurrentThread());\n\n \/\/ TODO(dalecurtis): Notify the renderer side that a device change has\n \/\/ occurred. Currently querying the hardware information here will lead to\n \/\/ crashes on OSX. See http:\/\/crbug.com\/158170.\n\n \/\/ Recreate the stream (DoCreate() will first shut down an existing stream).\n \/\/ Exit if we ran into an error.\n const State original_state = state_;\n DoCreate(true);\n if (!stream_ || state_ == kError)\n return;\n\n \/\/ Get us back to the original state or an equivalent state.\n switch (original_state) {\n case kStarting:\n case kPlaying:\n DoPlay();\n return;\n case kCreated:\n case kPaused:\n \/\/ From the outside these two states are equivalent.\n return;\n default:\n NOTREACHED() << \"Invalid original state.\";\n }\n}\n\nconst AudioParameters& AudioOutputController::GetAudioParameters() {\n return params_;\n}\n\nvoid AudioOutputController::StartDiverting(AudioOutputStream* to_stream) {\n message_loop_->PostTask(\n FROM_HERE,\n base::Bind(&AudioOutputController::DoStartDiverting, this, to_stream));\n}\n\nvoid AudioOutputController::StopDiverting() {\n message_loop_->PostTask(\n FROM_HERE, base::Bind(&AudioOutputController::DoStopDiverting, this));\n}\n\nvoid AudioOutputController::DoStartDiverting(AudioOutputStream* to_stream) {\n DCHECK(message_loop_->BelongsToCurrentThread());\n\n if (state_ == kClosed)\n return;\n\n DCHECK(!diverting_to_stream_);\n diverting_to_stream_ = to_stream;\n \/\/ Note: OnDeviceChange() will engage the \"re-create\" process, which will\n \/\/ detect and use the alternate AudioOutputStream rather than create a new one\n \/\/ via AudioManager.\n OnDeviceChange();\n}\n\nvoid AudioOutputController::DoStopDiverting() {\n DCHECK(message_loop_->BelongsToCurrentThread());\n\n if (state_ == kClosed)\n return;\n\n \/\/ Note: OnDeviceChange() will cause the existing stream (the consumer of the\n \/\/ diverted audio data) to be closed, and diverting_to_stream_ will be set\n \/\/ back to NULL.\n OnDeviceChange();\n DCHECK(!diverting_to_stream_);\n}\n\nvoid AudioOutputController::AllowEntryToOnMoreIOData() {\n DCHECK(base::AtomicRefCountIsZero(&num_allowed_io_));\n base::AtomicRefCountInc(&num_allowed_io_);\n}\n\nvoid AudioOutputController::DisallowEntryToOnMoreIOData() {\n const bool is_zero = !base::AtomicRefCountDec(&num_allowed_io_);\n DCHECK(is_zero);\n}\n\n} \/\/ namespace media\n<commit_msg>Wait for the renderer even on WASAPI.<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\/audio\/audio_output_controller.h\"\n\n#include \"base\/bind.h\"\n#include \"base\/debug\/trace_event.h\"\n#include \"base\/message_loop.h\"\n#include \"base\/threading\/platform_thread.h\"\n#include \"base\/time.h\"\n#include \"build\/build_config.h\"\n#include \"media\/audio\/audio_util.h\"\n#include \"media\/audio\/shared_memory_util.h\"\n\nusing base::Time;\nusing base::TimeDelta;\n\nnamespace media {\n\n\/\/ Polling-related constants.\nconst int AudioOutputController::kPollNumAttempts = 3;\nconst int AudioOutputController::kPollPauseInMilliseconds = 3;\n\nAudioOutputController::AudioOutputController(AudioManager* audio_manager,\n EventHandler* handler,\n const AudioParameters& params,\n SyncReader* sync_reader)\n : audio_manager_(audio_manager),\n params_(params),\n handler_(handler),\n stream_(NULL),\n diverting_to_stream_(NULL),\n volume_(1.0),\n state_(kEmpty),\n num_allowed_io_(0),\n sync_reader_(sync_reader),\n message_loop_(audio_manager->GetMessageLoop()),\n number_polling_attempts_left_(0),\n ALLOW_THIS_IN_INITIALIZER_LIST(weak_this_(this)) {\n DCHECK(audio_manager);\n DCHECK(handler_);\n DCHECK(sync_reader_);\n DCHECK(message_loop_);\n}\n\nAudioOutputController::~AudioOutputController() {\n DCHECK_EQ(kClosed, state_);\n}\n\n\/\/ static\nscoped_refptr<AudioOutputController> AudioOutputController::Create(\n AudioManager* audio_manager,\n EventHandler* event_handler,\n const AudioParameters& params,\n SyncReader* sync_reader) {\n DCHECK(audio_manager);\n DCHECK(sync_reader);\n\n if (!params.IsValid() || !audio_manager)\n return NULL;\n\n scoped_refptr<AudioOutputController> controller(new AudioOutputController(\n audio_manager, event_handler, params, sync_reader));\n controller->message_loop_->PostTask(FROM_HERE, base::Bind(\n &AudioOutputController::DoCreate, controller, false));\n return controller;\n}\n\nvoid AudioOutputController::Play() {\n message_loop_->PostTask(FROM_HERE, base::Bind(\n &AudioOutputController::DoPlay, this));\n}\n\nvoid AudioOutputController::Pause() {\n message_loop_->PostTask(FROM_HERE, base::Bind(\n &AudioOutputController::DoPause, this));\n}\n\nvoid AudioOutputController::Flush() {\n message_loop_->PostTask(FROM_HERE, base::Bind(\n &AudioOutputController::DoFlush, this));\n}\n\nvoid AudioOutputController::Close(const base::Closure& closed_task) {\n DCHECK(!closed_task.is_null());\n message_loop_->PostTaskAndReply(FROM_HERE, base::Bind(\n &AudioOutputController::DoClose, this), closed_task);\n}\n\nvoid AudioOutputController::SetVolume(double volume) {\n message_loop_->PostTask(FROM_HERE, base::Bind(\n &AudioOutputController::DoSetVolume, this, volume));\n}\n\nvoid AudioOutputController::DoCreate(bool is_for_device_change) {\n DCHECK(message_loop_->BelongsToCurrentThread());\n\n \/\/ Close() can be called before DoCreate() is executed.\n if (state_ == kClosed)\n return;\n\n DoStopCloseAndClearStream(); \/\/ Calls RemoveOutputDeviceChangeListener().\n DCHECK_EQ(kEmpty, state_);\n\n stream_ = diverting_to_stream_ ? diverting_to_stream_ :\n audio_manager_->MakeAudioOutputStreamProxy(params_);\n if (!stream_) {\n state_ = kError;\n\n \/\/ TODO(hclam): Define error types.\n handler_->OnError(this, 0);\n return;\n }\n\n if (!stream_->Open()) {\n DoStopCloseAndClearStream();\n state_ = kError;\n\n \/\/ TODO(hclam): Define error types.\n handler_->OnError(this, 0);\n return;\n }\n\n \/\/ Everything started okay, so re-register for state change callbacks if\n \/\/ stream_ was created via AudioManager.\n if (stream_ != diverting_to_stream_)\n audio_manager_->AddOutputDeviceChangeListener(this);\n\n \/\/ We have successfully opened the stream. Set the initial volume.\n stream_->SetVolume(volume_);\n\n \/\/ Finally set the state to kCreated.\n state_ = kCreated;\n\n \/\/ And then report we have been created if we haven't done so already.\n if (!is_for_device_change)\n handler_->OnCreated(this);\n}\n\nvoid AudioOutputController::DoPlay() {\n DCHECK(message_loop_->BelongsToCurrentThread());\n\n \/\/ We can start from created or paused state.\n if (state_ != kCreated && state_ != kPaused)\n return;\n\n state_ = kStarting;\n\n \/\/ Ask for first packet.\n sync_reader_->UpdatePendingBytes(0);\n\n \/\/ Cannot start stream immediately, should give renderer some time\n \/\/ to deliver data.\n \/\/ TODO(vrk): The polling here and in WaitTillDataReady() is pretty clunky.\n \/\/ Refine the API such that polling is no longer needed. (crbug.com\/112196)\n number_polling_attempts_left_ = kPollNumAttempts;\n DCHECK(!weak_this_.HasWeakPtrs());\n message_loop_->PostDelayedTask(\n FROM_HERE,\n base::Bind(&AudioOutputController::PollAndStartIfDataReady,\n weak_this_.GetWeakPtr()),\n TimeDelta::FromMilliseconds(kPollPauseInMilliseconds));\n}\n\nvoid AudioOutputController::PollAndStartIfDataReady() {\n DCHECK(message_loop_->BelongsToCurrentThread());\n\n DCHECK_EQ(kStarting, state_);\n\n \/\/ If we are ready to start the stream, start it.\n if (--number_polling_attempts_left_ == 0 ||\n sync_reader_->DataReady()) {\n StartStream();\n } else {\n message_loop_->PostDelayedTask(\n FROM_HERE,\n base::Bind(&AudioOutputController::PollAndStartIfDataReady,\n weak_this_.GetWeakPtr()),\n TimeDelta::FromMilliseconds(kPollPauseInMilliseconds));\n }\n}\n\nvoid AudioOutputController::StartStream() {\n DCHECK(message_loop_->BelongsToCurrentThread());\n state_ = kPlaying;\n\n \/\/ We start the AudioOutputStream lazily.\n AllowEntryToOnMoreIOData();\n stream_->Start(this);\n\n \/\/ Tell the event handler that we are now playing.\n handler_->OnPlaying(this);\n}\n\nvoid AudioOutputController::StopStream() {\n DCHECK(message_loop_->BelongsToCurrentThread());\n\n if (state_ == kStarting) {\n \/\/ Cancel in-progress polling start.\n weak_this_.InvalidateWeakPtrs();\n state_ = kPaused;\n } else if (state_ == kPlaying) {\n stream_->Stop();\n DisallowEntryToOnMoreIOData();\n state_ = kPaused;\n }\n}\n\nvoid AudioOutputController::DoPause() {\n DCHECK(message_loop_->BelongsToCurrentThread());\n\n StopStream();\n\n if (state_ != kPaused)\n return;\n\n \/\/ Send a special pause mark to the low-latency audio thread.\n sync_reader_->UpdatePendingBytes(kPauseMark);\n\n handler_->OnPaused(this);\n}\n\nvoid AudioOutputController::DoFlush() {\n DCHECK(message_loop_->BelongsToCurrentThread());\n\n \/\/ TODO(hclam): Actually flush the audio device.\n}\n\nvoid AudioOutputController::DoClose() {\n DCHECK(message_loop_->BelongsToCurrentThread());\n\n if (state_ != kClosed) {\n DoStopCloseAndClearStream();\n sync_reader_->Close();\n state_ = kClosed;\n }\n}\n\nvoid AudioOutputController::DoSetVolume(double volume) {\n DCHECK(message_loop_->BelongsToCurrentThread());\n\n \/\/ Saves the volume to a member first. We may not be able to set the volume\n \/\/ right away but when the stream is created we'll set the volume.\n volume_ = volume;\n\n switch (state_) {\n case kCreated:\n case kStarting:\n case kPlaying:\n case kPaused:\n stream_->SetVolume(volume_);\n break;\n default:\n return;\n }\n}\n\nvoid AudioOutputController::DoReportError(int code) {\n DCHECK(message_loop_->BelongsToCurrentThread());\n if (state_ != kClosed)\n handler_->OnError(this, code);\n}\n\nint AudioOutputController::OnMoreData(AudioBus* dest,\n AudioBuffersState buffers_state) {\n return OnMoreIOData(NULL, dest, buffers_state);\n}\n\nint AudioOutputController::OnMoreIOData(AudioBus* source,\n AudioBus* dest,\n AudioBuffersState buffers_state) {\n DisallowEntryToOnMoreIOData();\n TRACE_EVENT0(\"audio\", \"AudioOutputController::OnMoreIOData\");\n\n \/\/ The OS level audio APIs on Linux and Windows all have problems requesting\n \/\/ data on a fixed interval. Sometimes they will issue calls back to back\n \/\/ which can cause glitching, so wait until the renderer is ready for Read().\n \/\/\n \/\/ See many bugs for context behind this decision: http:\/\/crbug.com\/170498,\n \/\/ http:\/\/crbug.com\/171651, http:\/\/crbug.com\/174985, and more.\n#if defined(OS_WIN) || defined(OS_LINUX)\n WaitTillDataReady();\n#endif\n\n const int frames = sync_reader_->Read(source, dest);\n DCHECK_LE(0, frames);\n sync_reader_->UpdatePendingBytes(\n buffers_state.total_bytes() + frames * params_.GetBytesPerFrame());\n\n AllowEntryToOnMoreIOData();\n return frames;\n}\n\nvoid AudioOutputController::WaitTillDataReady() {\n base::Time start = base::Time::Now();\n \/\/ Wait for up to 683ms for DataReady(). 683ms was chosen because it's larger\n \/\/ than the playback time of the WaveOut buffer size using the minimum\n \/\/ supported sample rate: 2048 \/ 3000 = ~683ms.\n const base::TimeDelta kMaxWait = base::TimeDelta::FromMilliseconds(683);\n while (!sync_reader_->DataReady() &&\n ((base::Time::Now() - start) < kMaxWait)) {\n base::PlatformThread::YieldCurrentThread();\n }\n}\n\nvoid AudioOutputController::OnError(AudioOutputStream* stream, int code) {\n \/\/ Handle error on the audio controller thread.\n message_loop_->PostTask(FROM_HERE, base::Bind(\n &AudioOutputController::DoReportError, this, code));\n}\n\nvoid AudioOutputController::DoStopCloseAndClearStream() {\n DCHECK(message_loop_->BelongsToCurrentThread());\n\n \/\/ Allow calling unconditionally and bail if we don't have a stream_ to close.\n if (stream_) {\n \/\/ De-register from state change callbacks if stream_ was created via\n \/\/ AudioManager.\n if (stream_ != diverting_to_stream_)\n audio_manager_->RemoveOutputDeviceChangeListener(this);\n\n StopStream();\n stream_->Close();\n if (stream_ == diverting_to_stream_)\n diverting_to_stream_ = NULL;\n stream_ = NULL;\n }\n\n state_ = kEmpty;\n}\n\nvoid AudioOutputController::OnDeviceChange() {\n DCHECK(message_loop_->BelongsToCurrentThread());\n\n \/\/ TODO(dalecurtis): Notify the renderer side that a device change has\n \/\/ occurred. Currently querying the hardware information here will lead to\n \/\/ crashes on OSX. See http:\/\/crbug.com\/158170.\n\n \/\/ Recreate the stream (DoCreate() will first shut down an existing stream).\n \/\/ Exit if we ran into an error.\n const State original_state = state_;\n DoCreate(true);\n if (!stream_ || state_ == kError)\n return;\n\n \/\/ Get us back to the original state or an equivalent state.\n switch (original_state) {\n case kStarting:\n case kPlaying:\n DoPlay();\n return;\n case kCreated:\n case kPaused:\n \/\/ From the outside these two states are equivalent.\n return;\n default:\n NOTREACHED() << \"Invalid original state.\";\n }\n}\n\nconst AudioParameters& AudioOutputController::GetAudioParameters() {\n return params_;\n}\n\nvoid AudioOutputController::StartDiverting(AudioOutputStream* to_stream) {\n message_loop_->PostTask(\n FROM_HERE,\n base::Bind(&AudioOutputController::DoStartDiverting, this, to_stream));\n}\n\nvoid AudioOutputController::StopDiverting() {\n message_loop_->PostTask(\n FROM_HERE, base::Bind(&AudioOutputController::DoStopDiverting, this));\n}\n\nvoid AudioOutputController::DoStartDiverting(AudioOutputStream* to_stream) {\n DCHECK(message_loop_->BelongsToCurrentThread());\n\n if (state_ == kClosed)\n return;\n\n DCHECK(!diverting_to_stream_);\n diverting_to_stream_ = to_stream;\n \/\/ Note: OnDeviceChange() will engage the \"re-create\" process, which will\n \/\/ detect and use the alternate AudioOutputStream rather than create a new one\n \/\/ via AudioManager.\n OnDeviceChange();\n}\n\nvoid AudioOutputController::DoStopDiverting() {\n DCHECK(message_loop_->BelongsToCurrentThread());\n\n if (state_ == kClosed)\n return;\n\n \/\/ Note: OnDeviceChange() will cause the existing stream (the consumer of the\n \/\/ diverted audio data) to be closed, and diverting_to_stream_ will be set\n \/\/ back to NULL.\n OnDeviceChange();\n DCHECK(!diverting_to_stream_);\n}\n\nvoid AudioOutputController::AllowEntryToOnMoreIOData() {\n DCHECK(base::AtomicRefCountIsZero(&num_allowed_io_));\n base::AtomicRefCountInc(&num_allowed_io_);\n}\n\nvoid AudioOutputController::DisallowEntryToOnMoreIOData() {\n const bool is_zero = !base::AtomicRefCountDec(&num_allowed_io_);\n DCHECK(is_zero);\n}\n\n} \/\/ namespace media\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 \"sky\/engine\/config.h\"\n#include \"sky\/engine\/core\/painting\/LayoutRoot.h\"\n\n#include \"sky\/engine\/core\/dom\/Document.h\"\n#include \"sky\/engine\/core\/dom\/Element.h\"\n#include \"sky\/engine\/core\/frame\/FrameView.h\"\n#include \"sky\/engine\/core\/frame\/LocalFrame.h\"\n#include \"sky\/engine\/core\/frame\/Settings.h\"\n#include \"sky\/engine\/core\/painting\/PaintingTasks.h\"\n#include \"sky\/engine\/platform\/geometry\/IntRect.h\"\n#include \"third_party\/skia\/include\/core\/SkCanvas.h\"\n\nnamespace blink {\n\nPassRefPtr<LayoutRoot> LayoutRoot::create()\n{\n return adoptRef(new LayoutRoot);\n}\n\nLayoutRoot::LayoutRoot()\n : m_minWidth(0)\n , m_maxWidth(0)\n , m_minHeight(0)\n , m_maxHeight(0)\n{\n m_settings = Settings::create();\n m_settings->setDefaultFixedFontSize(13);\n m_settings->setDefaultFontSize(16);\n m_frameHost = FrameHost::createDummy(m_settings.get());\n m_frame = LocalFrame::create(nullptr, m_frameHost.get());\n m_frame->createView(IntSize(), Color::white, false);\n}\n\nLayoutRoot::~LayoutRoot()\n{\n}\n\nElement* LayoutRoot::rootElement() const\n{\n if (!m_document)\n return nullptr;\n return m_document->firstElementChild();\n}\n\nvoid LayoutRoot::setRootElement(Element* root)\n{\n m_document = &root->document();\n m_frame->setDocument(m_document.get());\n m_document->setFrame(m_frame.get());\n\n m_document->attach();\n m_document->setChild(root, ASSERT_NO_EXCEPTION);\n\n m_document->setFrame(nullptr);\n m_frame->setDocument(nullptr);\n}\n\nvoid LayoutRoot::layout()\n{\n m_frame->setDocument(m_document.get());\n m_document->setFrame(m_frame.get());\n\n LayoutUnit maxWidth = std::max(m_minWidth, m_maxWidth);\n LayoutUnit maxHeight = std::max(m_minHeight, m_maxHeight);\n IntSize maxSize(maxWidth, maxHeight);\n\n m_frame->view()->setFrameRect(IntRect(IntPoint(), maxSize));\n m_frame->view()->setLayoutSize(maxSize);\n\n m_document->updateLayout();\n\n m_document->setFrame(nullptr);\n m_frame->setDocument(nullptr);\n}\n\nvoid LayoutRoot::paint(Canvas* canvas)\n{\n if (m_document)\n rootElement()->paint(canvas);\n}\n\n} \/\/ namespace blink\n<commit_msg>Make SkyShell stop crashing on scroll in Stocks2.<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 \"sky\/engine\/config.h\"\n#include \"sky\/engine\/core\/painting\/LayoutRoot.h\"\n\n#include \"sky\/engine\/core\/dom\/Document.h\"\n#include \"sky\/engine\/core\/dom\/Element.h\"\n#include \"sky\/engine\/core\/frame\/FrameView.h\"\n#include \"sky\/engine\/core\/frame\/LocalFrame.h\"\n#include \"sky\/engine\/core\/frame\/Settings.h\"\n#include \"sky\/engine\/core\/painting\/PaintingTasks.h\"\n#include \"sky\/engine\/platform\/geometry\/IntRect.h\"\n#include \"third_party\/skia\/include\/core\/SkCanvas.h\"\n\nnamespace blink {\n\nPassRefPtr<LayoutRoot> LayoutRoot::create()\n{\n return adoptRef(new LayoutRoot);\n}\n\nLayoutRoot::LayoutRoot()\n : m_minWidth(0)\n , m_maxWidth(0)\n , m_minHeight(0)\n , m_maxHeight(0)\n{\n m_settings = Settings::create();\n m_settings->setDefaultFixedFontSize(13);\n m_settings->setDefaultFontSize(16);\n m_frameHost = FrameHost::createDummy(m_settings.get());\n m_frame = LocalFrame::create(nullptr, m_frameHost.get());\n m_frame->createView(IntSize(), Color::white, false);\n}\n\nLayoutRoot::~LayoutRoot()\n{\n if (!m_document->needsAttach())\n m_document->detach();\n}\n\nElement* LayoutRoot::rootElement() const\n{\n if (!m_document)\n return nullptr;\n return m_document->firstElementChild();\n}\n\nvoid LayoutRoot::setRootElement(Element* root)\n{\n m_document = &root->document();\n m_frame->setDocument(m_document.get());\n m_document->setFrame(m_frame.get());\n\n m_document->attach();\n m_document->setChild(root, ASSERT_NO_EXCEPTION);\n\n m_document->setFrame(nullptr);\n m_frame->setDocument(nullptr);\n}\n\nvoid LayoutRoot::layout()\n{\n m_frame->setDocument(m_document.get());\n m_document->setFrame(m_frame.get());\n\n LayoutUnit maxWidth = std::max(m_minWidth, m_maxWidth);\n LayoutUnit maxHeight = std::max(m_minHeight, m_maxHeight);\n IntSize maxSize(maxWidth, maxHeight);\n\n m_frame->view()->setFrameRect(IntRect(IntPoint(), maxSize));\n m_frame->view()->setLayoutSize(maxSize);\n\n m_document->updateLayout();\n\n m_document->setFrame(nullptr);\n m_frame->setDocument(nullptr);\n}\n\nvoid LayoutRoot::paint(Canvas* canvas)\n{\n if (m_document)\n rootElement()->paint(canvas);\n}\n\n} \/\/ namespace blink\n<|endoftext|>"} {"text":"<commit_before>\/* -------------------------------------------------------------------------- *\n * Simbody(tm) Example: Long Pendulum *\n * -------------------------------------------------------------------------- *\n * This is part of the SimTK biosimulation toolkit originating from *\n * Simbios, the NIH National Center for Physics-Based Simulation of *\n * Biological Structures at Stanford, funded under the NIH Roadmap for *\n * Medical Research, grant U54 GM072970. See https:\/\/simtk.org\/home\/simbody. *\n * *\n * Portions copyright (c) 2008-13 Stanford University and the Authors. *\n * Authors: Michael Sherman *\n * Contributors: *\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\/* Simbody ExampleLongPendulum\nThis example shows how to build a linked chain of bodies programmatically,\nsimulate it, and produce a simple animation while it is simulating. *\/\n\n#include \"Simbody.h\"\n#include <iostream>\n\nusing namespace SimTK;\n\nint main() {\n try { \n \/\/ Create the system.\n \n MultibodySystem system; system.setUseUniformBackground(true);\n SimbodyMatterSubsystem matter(system);\n GeneralForceSubsystem forces(system);\n Force::UniformGravity gravity(forces, matter, Vec3(0, -9.8, 0));\n Body::Rigid pendulumBody(MassProperties(1.0, Vec3(0), Inertia(1)));\n pendulumBody.addDecoration(Transform(), DecorativeSphere(0.1));\n\n MobilizedBody lastBody = matter.Ground();\n for (int i = 0; i < 10; ++i) {\n MobilizedBody::Ball pendulum(lastBody, Transform(Vec3(0)), \n pendulumBody, Transform(Vec3(0, 1, 0)));\n lastBody = pendulum;\n }\n\n Visualizer viz(system);\n system.addEventReporter(new Visualizer::Reporter(viz, 1.\/30));\n \n \/\/ Initialize the system and state.\n \n system.realizeTopology();\n State state = system.getDefaultState();\n Random::Gaussian random;\n for (int i = 0; i < state.getNQ(); ++i)\n state.updQ()[i] = random.getValue();\n \n \/\/ Simulate it.\n\n RungeKuttaMersonIntegrator integ(system);\n TimeStepper ts(system, integ);\n ts.initialize(state);\n ts.stepTo(10.0);\n\n } catch(const std::exception& e) {\n std::cout << \"EXCEPTION: \" << e.what() << std::endl;\n return 1;\n }\n return 0;\n}\n<commit_msg>Update ExampleLongPendulum.cpp<commit_after>\/* -------------------------------------------------------------------------- *\n * Simbody(tm) Example: Long Pendulum *\n * -------------------------------------------------------------------------- *\n * This is part of the SimTK biosimulation toolkit originating from *\n * Simbios, the NIH National Center for Physics-Based Simulation of *\n * Biological Structures at Stanford, funded under the NIH Roadmap for *\n * Medical Research, grant U54 GM072970. See https:\/\/simtk.org\/home\/simbody. *\n * *\n * Portions copyright (c) 2008-13 Stanford University and the Authors. *\n * Authors: Michael Sherman *\n * Contributors: *\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\/* Simbody ExampleLongPendulum\nThis example shows how to build a linked chain of bodies programmatically,\nsimulate it, and produce a simple animation while it is simulating. *\/\n\n#include \"Simbody.h\"\n#include <iostream>\n\nusing namespace SimTK;\n\nint main() {\n try { \n \/\/ Create the system.\n \n MultibodySystem system; system.setUseUniformBackground(true);\n SimbodyMatterSubsystem matter(system);\n GeneralForceSubsystem forces(system);\n Force::UniformGravity gravity(forces, matter, Vec3(0, -9.8, 0));\n Body::Rigid pendulumBody(MassProperties(1.0, Vec3(0), Inertia(1)));\n pendulumBody.addDecoration(Transform(), DecorativeSphere(0.1));\n\n MobilizedBody lastBody = matter.Ground();\n for (int i = 0; i < 10; ++i) {\n MobilizedBody::Ball pendulum(lastBody, Transform(Vec3(0)), \n pendulumBody, Transform(Vec3(0, 1, 0)));\n lastBody = pendulum;\n }\n\n Visualizer viz(system);\n system.addEventReporter(new Visualizer::Reporter(viz, 1.\/30));\n \n \/\/ Initialize the system and state.\n \n system.realizeTopology();\n State state = system.getDefaultState();\n Random::Gaussian random;\n for (int i = 0; i < state.getNQ(); ++i)\n state.updQ()[i] = random.getValue();\n \n \/\/ Simulate it.\n\n RungeKuttaMersonIntegrator integ(system);\n TimeStepper ts(system, integ);\n ts.initialize(state);\n ts.stepTo(10.0);\n\n } catch(const std::exception& e) {\n std::cout << \"EXCEPTION: \" << e.what() << std::endl;\n return 1;\n } catch (...) {\n std::cout << \"UNKNOWN EXCEPTION\\n\";\n return 1;\n }\n return 0;\n}\n<|endoftext|>"} {"text":"<commit_before>#include \"fourtaxon.hpp\"\nusing namespace std;\n\n\/*-----------------------------------------------------------------------------\n| \tAllocates a two-dimensional array of doubles as one contiguous block of \n|\tmemory the dimensions are f by s. The array is set up so that each \n|\tsuccessive row follows the previous row in memory.\n*\/\ndouble **NewTwoDArray(unsigned f , unsigned s)\n\t{\n\tdouble **ptr;\n\tptr = new double *[f];\n\t*ptr = new double [f * s];\n\tfor (unsigned fIt = 1 ; fIt < f ; fIt++)\n\t\tptr[fIt] = ptr[fIt -1] + s ;\n\treturn ptr;\n\t}\n\n\/*-----------------------------------------------------------------------------\n|\tDelete a two-dimensional array (e.g. one created by NewTwoDArray) and set \n|\tptr to NULL.\n*\/\nvoid DeleteTwoDArray (double ** & ptr)\n\t{\n\tif (ptr)\n\t\t{\n\t\tdelete [] * ptr;\n\t\tdelete [] ptr;\n\t\tptr = NULL;\n\t\t}\n\t}\n\n\/*-----------------------------------------------------------------------------\n|\tConstructor simply calls init().\n*\/\nFourTaxonExample::FourTaxonExample()\n\t{\n\tinit();\n\t}\n\t\n\/*-----------------------------------------------------------------------------\n|\tThis function is called if the program encounters an unrecoverable error.\n|\tAfter issuing the supplied error message, the program exits, returning 1.\n*\/\nvoid FourTaxonExample::abort(\n std::string msg)\t\/**< is the error message to report to the user *\/\n\t{\n\tstd::cerr << msg << \"\\nAborting...\" << std::endl;\n\tstd::exit(1);\n\t}\n\t\n\/*-----------------------------------------------------------------------------\n|\tThe init() function sets up the beagle library and initializes all data\n|\tmembers.\n*\/\nvoid FourTaxonExample::init()\n\t{\n\tint code;\n\t\n\ttaxon_name.resize(4);\n\tdata.resize(4);\n\tpartial.resize(4);\n\t\n\t\/\/ hard coded tree topology is (A,B,(C,D))\n\t\/\/ where taxon order is A, B, C, D in the data file\n\t\/\/ Assume nodes 0..3 are the tip node indices\n\t\/\/ Assume node 4 is ancestor of A,B (0,1)\n\t\/\/ Assume node 5 is ancestor of C,D (2,3)\n\toperations.push_back(4);\t\/\/ destination (to be calculated)\n\toperations.push_back(0);\t\/\/ left child partial index\n\toperations.push_back(0);\t\/\/ left child transition matrix index\n\toperations.push_back(1);\t\/\/ right child partial index\n\toperations.push_back(1);\t\/\/ right child transition matrix index\n\t\n\toperations.push_back(5);\t\/\/ destination (to be calculated)\n\toperations.push_back(2);\t\/\/ left child partial index\n\toperations.push_back(2);\t\/\/ left child transition matrix index\n\toperations.push_back(3);\t\/\/ right child partial index\n\toperations.push_back(3);\t\/\/ right child transition matrix index\n\t\n\tinstance_handle = createInstance(\n\t\t\t\t4,\t\t\t\/\/ tipCount\n\t\t\t\t7,\t\t\t\/\/ partialsBufferCount\n\t\t\t\t0,\t\t\t\/\/ compactBufferCount\n\t\t\t\t4, \t\t\t\/\/ stateCount\n\t\t\t\tnsites,\t\t\/\/ patternCount\n\t\t\t\t1,\t\t\t\/\/ eigenBufferCount\n\t\t\t\t5,\t\t\t\/\/ matrixBufferCount,\n\t\t\t\tNULL,\t\t\/\/ resourceList\n\t\t\t\t0,\t\t\t\/\/ resourceCount\n\t\t\t\t0,\t\t\t\/\/ preferenceFlags\n\t\t\t\t0\t\t\t\/\/ requirementFlags\t\t\n\t\t\t\t);\n\t\n\tif (instance_handle < 0)\n\t\tabort(\"createInstance returned a negative instance handle (and that's not good)\");\n\t\t\t\t\n\ttransition_matrix_index.resize(5);\n\ttransition_matrix_index.push_back(0);\n\ttransition_matrix_index.push_back(1);\n\ttransition_matrix_index.push_back(2);\n\ttransition_matrix_index.push_back(3);\n\ttransition_matrix_index.push_back(4);\n\t\n\tbrlens.resize(5);\n\tbrlens.push_back(0.01);\n\tbrlens.push_back(0.02);\n\tbrlens.push_back(0.03);\n\tbrlens.push_back(0.04);\n\tbrlens.push_back(0.05);\n\t\n\tfor (unsigned i = 0; i < 4; ++i)\n\t\t{\n\t\tcode = setPartials(\n\t\t\t\t\t\tinstance_handle,\t\t\t\/\/ instance\n\t\t\t\t\t\ti,\t\t\t\t\t\t\t\/\/ bufferIndex\n\t\t\t\t\t\t&partial[i][0]);\t\t\t\/\/ inPartials\n\t\tif (code != 0)\n\t\t\tabort(\"setPartials encountered a problem\");\n\t\t}\n\t\t\n\tdouble evec[4][4] = {\n\t\t{ 1.0, 2.0, 0.0, 0.5},\n\t\t{ 1.0, -2.0, 0.5, 0.0},\n\t\t{ 1.0, 2.0, 0.0, -0.5},\n\t\t{ 1.0, -2.0, -0.5, 0.0}\n\t};\n\t\n\tdouble ivec[4][4] = {\n\t\t{ 0.25, 0.25, 0.25, 0.25},\n\t\t{ 0.125, -0.125, 0.125, -0.125},\n\t\t{ 0.0, 1.0, 0.0, -1.0},\n\t\t{ 1.0, 0.0, -1.0, 0.0}\n\t};\n\t\n\tdouble eval[4] = { 0.0, -1.3333333333333333, -1.3333333333333333, -1.3333333333333333 };\n\t\n\tdouble ** evecP = NewTwoDArray(4,4);\n\tdouble ** ivecP = NewTwoDArray(4,4);\n\n\tfor (int i = 0; i < 4; i++) {\n\t\tfor (int j = 0; j < 4; j++) {\n\t\t\tevecP[i][j] = evec[i][j];\n\t\t\tivecP[i][j] = ivec[i][j];\n\t\t}\n\t}\n\t\t\n\tcode = setEigenDecomposition(\n\t\t\t instance_handle,\t\t\t\t\t\/\/ instance\n\t\t\t 0,\t\t\t\t\t\t\t\t\/\/ eigenIndex,\n\t\t\t (const double **)evecP,\t\t\t\/\/ inEigenVectors,\n\t\t\t (const double **)ivecP,\t\t\t\/\/ inInverseEigenVectors,\n\t\t\t eval);\t\t\t\t\t\t\t\/\/ inEigenValues\n\t\n\tDeleteTwoDArray(evecP);\n\tDeleteTwoDArray(ivecP);\n\t\t\t \n\tif (code != 0)\n\t\tabort(\"setEigenDecomposition encountered a problem\");\n\t}\n\t\n\/*-----------------------------------------------------------------------------\n|\t\n*\/\ndouble FourTaxonExample::calcLnL()\n\t{\n\tint code = updateTransitionMatrices(\n\t\t\tinstance_handle,\t\t\t\t\/\/ instance,\n\t\t\t0,\t\t\t\t\t\t\t\t\/\/ eigenIndex,\n\t\t\t&transition_matrix_index[0],\t\/\/ probabilityIndices,\n\t\t\tNULL, \t\t\t\t\t\t\t\/\/ firstDerivativeIndices,\n\t\t\tNULL,\t\t\t\t\t\t\t\/\/ secondDervativeIndices,\n\t\t\t&brlens[0],\t\t\t\t\t\t\/\/ edgeLengths,\n\t\t\t5);\t\t\t\t\t\t\t\t\/\/ count \n\t\t\t\n\tif (code != 0)\n\t\tabort(\"updateTransitionMatrices encountered a problem\");\n\t\t\n\tcode = updatePartials(\n\t\t &instance_handle,\t\/\/ instance\n\t\t 1,\t\t\t\t\t\/\/ instanceCount\n\t\t &operations[0],\t\t\/\/ operations\t\t\t\t\n\t\t 2,\t\t\t\t\t\/\/ operationCount\n\t\t 0);\t\t\t\t\t\/\/ rescale\n\t\t \n\tif (code != 0)\n\t\tabort(\"updatePartials encountered a problem\");\n\t\t\n\tint parentBufferIndex = 4;\n\tint childBufferIndex = 5;\n\tint transitionMatrixIndex = 4;\n\tdouble relativeRateProb = 1.0;\n\tdouble stateFreqs[] = {0.25, 0.25, 0.25, 0.25};\n\tdouble lnL = 0.0;\n\t\n\tcode = calculateEdgeLogLikelihoods(\n\t\t instance_handle,\t\t\t\t\t\/\/ instance,\n\t\t &parentBufferIndex,\t\t\t\t\/\/ parentBufferIndices\n\t\t &childBufferIndex,\t\t\t\t\t\/\/ childBufferIndices\t\t \n\t\t &transitionMatrixIndex,\t\t\t\/\/ probabilityIndices\n\t\t NULL,\t\t\t\t\t\t\t\t\/\/ firstDerivativeIndices\n\t\t NULL,\t\t\t\t\t\t\t\t\/\/ secondDerivativeIndices\n\t\t (const double*)&relativeRateProb,\t\/\/ weights\n\t\t (const double**)&stateFreqs,\t\t\/\/ stateFrequencies,\n\t\t 1,\t\t\t\t\t\t\t\t\t\/\/ count\n\t\t &lnL,\t\t\t\t\t\t\t\t\/\/ outLogLikelihoods,\n\t\t NULL,\t\t\t\t\t\t\t\t\/\/ outFirstDerivatives,\n\t\t NULL);\t\t\t\t\t\t\t\t\/\/ outSecondDerivatives\n\n\tif (code != 0)\n\t\tabort(\"calculateEdgeLogLikelihoods encountered a problem\");\n\t\t\n\treturn lnL;\n\t}\n\n\/*-----------------------------------------------------------------------------\n|\t\n*\/\nvoid FourTaxonExample::run()\n\t{\n\treadData(\"fourtaxon.dat\");\n\t\/\/writeData(\"example_data.check.txt\");\n\n\tunsigned nreps = 1000;\n\tfor (unsigned rep = 0; rep < nreps; ++rep)\n\t\t{\n\t\tstd::cerr << rep << \": lnL = \" << calcLnL() << std::endl;\n\t\t}\n\t\t\n\tint code = finalize(\n\t\tinstance_handle);\t\t\/\/ instance\n\t\n\tstd::cerr << \"finalize returned \" << code << std::endl;\n\t}\n\n\/*-----------------------------------------------------------------------------\n|\t\n*\/\nvoid FourTaxonExample::readData(const std::string file_name)\n\t{\n\tstd::string sequence;\n\tstd::ifstream inf(file_name.c_str());\n\tif(!inf.good())\n\t\tabort(\"problem reading datafile\");\n\tinf >> ntaxa >> nsites;\n\tfor (unsigned i = 0; i < ntaxa; ++i)\n\t\t{\n\t\tinf >> taxon_name[i];\n\t\tinf >> sequence;\n\t\tdata[i].resize(nsites);\n\t\tpartial[i].reserve(nsites*4);\n\t\tfor (unsigned j = 0; j < nsites; ++j)\n\t\t\t{\n\t\t\tswitch (sequence[j])\n\t\t\t\t{\n\t\t\t\tcase 'a':\n\t\t\t\tcase 'A':\n\t\t\t\t\tdata[i][j] = 0;\n\t\t\t\t\tpartial[i].push_back(1.0);\n\t\t\t\t\tpartial[i].push_back(0.0);\n\t\t\t\t\tpartial[i].push_back(0.0);\n\t\t\t\t\tpartial[i].push_back(0.0);\n\t\t\t\t\tbreak;\n\t\t\t\tcase 'c':\n\t\t\t\tcase 'C':\n\t\t\t\t\tdata[i][j] = 1;\n\t\t\t\t\tpartial[i].push_back(0.0);\n\t\t\t\t\tpartial[i].push_back(1.0);\n\t\t\t\t\tpartial[i].push_back(0.0);\n\t\t\t\t\tpartial[i].push_back(0.0);\n\t\t\t\t\tbreak;\n\t\t\t\tcase 'g':\n\t\t\t\tcase 'G':\n\t\t\t\t\tdata[i][j] = 2;\n\t\t\t\t\tpartial[i].push_back(0.0);\n\t\t\t\t\tpartial[i].push_back(0.0);\n\t\t\t\t\tpartial[i].push_back(1.0);\n\t\t\t\t\tpartial[i].push_back(0.0);\n\t\t\t\t\tbreak;\n\t\t\t\tcase 't':\n\t\t\t\tcase 'T':\n\t\t\t\t\tdata[i][j] = 3;\n\t\t\t\t\tpartial[i].push_back(0.0);\n\t\t\t\t\tpartial[i].push_back(0.0);\n\t\t\t\t\tpartial[i].push_back(0.0);\n\t\t\t\t\tpartial[i].push_back(1.0);\n\t\t\t\t\tbreak;\n\t\t\t\tdefault:\n\t\t\t\t\tdata[i][j] = 4;\n\t\t\t\t\tpartial[i].push_back(1.0);\n\t\t\t\t\tpartial[i].push_back(1.0);\n\t\t\t\t\tpartial[i].push_back(1.0);\n\t\t\t\t\tpartial[i].push_back(1.0);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\tinf.close();\n\t}\n\t\n\/*-----------------------------------------------------------------------------\n|\t\n*\/\nvoid FourTaxonExample::writeData(const std::string file_name)\n\t{\n\tstd::ofstream outf(file_name.c_str(), std::ios::out);\n\toutf << ntaxa << \" \" << nsites << std::endl;\n\tfor (unsigned i = 0; i < ntaxa; ++i)\n\t\t{\n\t\toutf << taxon_name[i] << \" \";\n\t\tfor (unsigned j = 0; j < nsites; ++j)\n\t\t\t{\n\t\t\tswitch (data[i][j])\n\t\t\t\t{\n\t\t\t\tcase 0:\n\t\t\t\t\toutf << 'a';\n\t\t\t\t\tbreak;\n\t\t\t\tcase 1:\n\t\t\t\t\toutf << 'c';\n\t\t\t\t\tbreak;\n\t\t\t\tcase 2:\n\t\t\t\t\toutf << 'g';\n\t\t\t\t\tbreak;\n\t\t\t\tcase 3:\n\t\t\t\t\toutf << 't';\n\t\t\t\t\tbreak;\n\t\t\t\tdefault:\n\t\t\t\t\toutf << '?';\n\t\t\t\t}\n\t\t\t}\n\t\t\toutf << std::endl;\n\t\t}\n\toutf.close();\n\t}\n\n\/*-----------------------------------------------------------------------------\n|\t\n*\/\nint main(int argc, char* argv[])\n\t{\n\tFourTaxonExample().run();\n\t}\n\t\n<commit_msg>various bug fixes. Now we get a likelihood, but it does not agree with PAUP<commit_after>#include \"fourtaxon.hpp\"\n#include <algorithm>\nusing namespace std;\n\n\/*-----------------------------------------------------------------------------\n| \tAllocates a two-dimensional array of doubles as one contiguous block of \n|\tmemory the dimensions are f by s. The array is set up so that each \n|\tsuccessive row follows the previous row in memory.\n*\/\ndouble **NewTwoDArray(unsigned f , unsigned s)\n\t{\n\tdouble **ptr;\n\tptr = new double *[f];\n\t*ptr = new double [f * s];\n\tfor (unsigned fIt = 1 ; fIt < f ; fIt++)\n\t\tptr[fIt] = ptr[fIt -1] + s ;\n\treturn ptr;\n\t}\n\n\/*-----------------------------------------------------------------------------\n|\tDelete a two-dimensional array (e.g. one created by NewTwoDArray) and set \n|\tptr to NULL.\n*\/\nvoid DeleteTwoDArray (double ** & ptr)\n\t{\n\tif (ptr)\n\t\t{\n\t\tdelete [] * ptr;\n\t\tdelete [] ptr;\n\t\tptr = NULL;\n\t\t}\n\t}\n\n\/*-----------------------------------------------------------------------------\n|\tConstructor simply calls init().\n*\/\nFourTaxonExample::FourTaxonExample()\n\t{\n\t\/\/init();\n\t}\n\t\n\/*-----------------------------------------------------------------------------\n|\tThis function is called if the program encounters an unrecoverable error.\n|\tAfter issuing the supplied error message, the program exits, returning 1.\n*\/\nvoid FourTaxonExample::abort(\n std::string msg)\t\/**< is the error message to report to the user *\/\n\t{\n\tstd::cerr << msg << \"\\nAborting...\" << std::endl;\n\tstd::exit(1);\n\t}\n\t\n\/*-----------------------------------------------------------------------------\n|\tThe init() function sets up the beagle library and initializes all data\n|\tmembers.\n*\/\nvoid FourTaxonExample::init()\n\t{\n\tint code;\n\tpartial.resize(4);\n\t\n\t\/\/ hard coded tree topology is (A,B,(C,D))\t\n\t\/\/ where taxon order is A, B, C, D in the data file\n\t\/\/ Assume nodes 0..3 are the tip node indices\n\t\/\/ Assume node 4 is ancestor of A,B (0,1)\n\t\/\/ Assume node 5 is ancestor of C,D (2,3)\n\toperations.push_back(4);\t\/\/ destination (to be calculated)\n\toperations.push_back(0);\t\/\/ left child partial index\n\toperations.push_back(0);\t\/\/ left child transition matrix index\n\toperations.push_back(1);\t\/\/ right child partial index\n\toperations.push_back(1);\t\/\/ right child transition matrix index\n\t\n\toperations.push_back(5);\t\/\/ destination (to be calculated)\n\toperations.push_back(2);\t\/\/ left child partial index\n\toperations.push_back(2);\t\/\/ left child transition matrix index\n\toperations.push_back(3);\t\/\/ right child partial index\n\toperations.push_back(3);\t\/\/ right child transition matrix index\n\t\n\tcout << \"nsites\\t\" << nsites << endl;\n\t\n\tinstance_handle = createInstance(\n\t\t\t\t4,\t\t\t\/\/ tipCount\n\t\t\t\t7,\t\t\t\/\/ partialsBufferCount\n\t\t\t\t0,\t\t\t\/\/ compactBufferCount\n\t\t\t\t4, \t\t\t\/\/ stateCount\n\t\t\t\tnsites,\t\t\/\/ patternCount\n\t\t\t\t1,\t\t\t\/\/ eigenBufferCount\n\t\t\t\t5,\t\t\t\/\/ matrixBufferCount,\n\t\t\t\tNULL,\t\t\/\/ resourceList\n\t\t\t\t0,\t\t\t\/\/ resourceCount\n\t\t\t\t0,\t\t\t\/\/ preferenceFlags\n\t\t\t\t0\t\t\t\/\/ requirementFlags\t\t\n\t\t\t\t);\n\t\n\tif (instance_handle < 0)\n\t\tabort(\"createInstance returned a negative instance handle (and that's not good)\");\n\t\t\t\t\n\ttransition_matrix_index.resize(5);\n\tbrlens.resize(5);\n\tfor (unsigned brIndex = 0; brIndex < 5; ++brIndex)\n\t\t{\n\t\ttransition_matrix_index[brIndex] = brIndex;\n\t\tbrlens[brIndex] = 0.01 + ((float)brIndex)\/100.0;\n\t\t}\n \n\t\n\tfor (unsigned i = 0; i < 4; ++i)\n\t\t{\n\t\tcode = setPartials(\n\t\t\t\t\t\tinstance_handle,\t\t\t\/\/ instance\n\t\t\t\t\t\ti,\t\t\t\t\t\t\t\/\/ bufferIndex\n\t\t\t\t\t\t&partial[i][0]);\t\t\t\/\/ inPartials\n\t\tif (code != 0)\n\t\t\tabort(\"setPartials encountered a problem\");\n\t\t}\n\tdouble evec[4][4] = {\n\t\t{ 1.0, 2.0, 0.0, 0.5},\n\t\t{ 1.0, -2.0, 0.5, 0.0},\n\t\t{ 1.0, 2.0, 0.0, -0.5},\n\t\t{ 1.0, -2.0, -0.5, 0.0}\n\t};\n\t\n\tdouble ivec[4][4] = {\n\t\t{ 0.25, 0.25, 0.25, 0.25},\n\t\t{ 0.125, -0.125, 0.125, -0.125},\n\t\t{ 0.0, 1.0, 0.0, -1.0},\n\t\t{ 1.0, 0.0, -1.0, 0.0}\n\t};\n\t\n\tdouble eval[4] = { 0.0, -1.3333333333333333, -1.3333333333333333, -1.3333333333333333 };\n\t\n\tdouble ** evecP = NewTwoDArray(4,4);\n\tdouble ** ivecP = NewTwoDArray(4,4);\n\n\tfor (int i = 0; i < 4; i++) {\n\t\tfor (int j = 0; j < 4; j++) {\n\t\t\tevecP[i][j] = evec[i][j];\n\t\t\tivecP[i][j] = ivec[i][j];\n\t\t}\n\t}\n\t\t\n\tcode = setEigenDecomposition(\n\t\t\t instance_handle,\t\t\t\t\t\/\/ instance\n\t\t\t 0,\t\t\t\t\t\t\t\t\/\/ eigenIndex,\n\t\t\t (const double **)evecP,\t\t\t\/\/ inEigenVectors,\n\t\t\t (const double **)ivecP,\t\t\t\/\/ inInverseEigenVectors,\n\t\t\t eval);\t\t\t\t\t\t\t\/\/ inEigenValues\n\t\n\tDeleteTwoDArray(evecP);\n\tDeleteTwoDArray(ivecP);\n\t\t\t \n\tif (code != 0)\n\t\tabort(\"setEigenDecomposition encountered a problem\");\n\t}\n\t\n\/*-----------------------------------------------------------------------------\n|\t\n*\/\ndouble FourTaxonExample::calcLnL()\n\t{\n\tint code = updateTransitionMatrices(\n\t\t\tinstance_handle,\t\t\t\t\/\/ instance,\n\t\t\t0,\t\t\t\t\t\t\t\t\/\/ eigenIndex,\n\t\t\t&transition_matrix_index[0],\t\/\/ probabilityIndices,\n\t\t\tNULL, \t\t\t\t\t\t\t\/\/ firstDerivativeIndices,\n\t\t\tNULL,\t\t\t\t\t\t\t\/\/ secondDervativeIndices,\n\t\t\t&brlens[0],\t\t\t\t\t\t\/\/ edgeLengths,\n\t\t\t5);\t\t\t\t\t\t\t\t\/\/ count \n\t\t\t\n\tif (code != 0)\n\t\tabort(\"updateTransitionMatrices encountered a problem\");\n\t\t\n\tcode = updatePartials(\n\t\t &instance_handle,\t\/\/ instance\n\t\t 1,\t\t\t\t\t\/\/ instanceCount\n\t\t &operations[0],\t\t\/\/ operations\t\t\t\t\n\t\t 2,\t\t\t\t\t\/\/ operationCount\n\t\t 0);\t\t\t\t\t\/\/ rescale\n\t\t \n\tif (code != 0)\n\t\tabort(\"updatePartials encountered a problem\");\n\t\t\n\tint parentBufferIndex = 4;\n\tint childBufferIndex = 5;\n\tint transitionMatrixIndex = 4;\n\tdouble relativeRateProb = 1.0;\n\t\/\/double stateFreqs[] = {0.25, 0.25, 0.25, 0.25};\n\tdouble ** stateFreqs = NewTwoDArray(1,4);\n\tfor (int i=0;i<4;i++)\n\t\tstateFreqs[0][i] = 0.25;\n\n\tvector<double> lnL(nsites);\n\t\n\tcode = calculateEdgeLogLikelihoods(\n\t\t instance_handle,\t\t\t\t\t\/\/ instance,\n\t\t &parentBufferIndex,\t\t\t\t\/\/ parentBufferIndices\n\t\t &childBufferIndex,\t\t\t\t\t\/\/ childBufferIndices\t\t \n\t\t &transitionMatrixIndex,\t\t\t\/\/ probabilityIndices\n\t\t NULL,\t\t\t\t\t\t\t\t\/\/ firstDerivativeIndices\n\t\t NULL,\t\t\t\t\t\t\t\t\/\/ secondDerivativeIndices\n\t\t (const double*)&relativeRateProb,\t\/\/ weights\n\t\t (const double**)stateFreqs,\t\t\/\/ stateFrequencies,\n\t\t 1,\t\t\t\t\t\t\t\t\t\/\/ count\n\t\t &lnL[0],\t\t\t\t\t\t\t\t\/\/ outLogLikelihoods,\n\t\t NULL,\t\t\t\t\t\t\t\t\/\/ outFirstDerivatives,\n\t\t NULL);\t\t\t\t\t\t\t\t\/\/ outSecondDerivatives\n\n\tif (code != 0)\n\t\tabort(\"calculateEdgeLogLikelihoods encountered a problem\");\n\t\t\n\t\/\/return std::accumulate(lnL.begin(),lnL.end(),0.0);\n\tdouble tot=0.0;\n\tfor(int i=0;i<nsites;i++){\n\/\/\t\tstd::cout << lnL[i] << std::endl;\n\t\ttot += lnL[i];\n\t\t}\n\treturn tot;\n\/\/\treturn lnL;\n\t}\n\n\/*-----------------------------------------------------------------------------\n|\t\n*\/\nvoid FourTaxonExample::run()\n\t{\n\treadData(\"fourtaxon.dat\");\n\tinit();\n\t\/\/writeData(\"example_data.check.txt\");\n\n\tunsigned nreps = 1;\n\tfor (unsigned rep = 0; rep < nreps; ++rep)\n\t\t{\n\t\tstd::cerr << rep << \": lnL = \" << calcLnL() << std::endl;\n\t\t}\n\t\t\n\tint code = finalize(\n\t\tinstance_handle);\t\t\/\/ instance\n\t\n\tstd::cerr << \"finalize returned \" << code << std::endl;\n\t}\n\n\/*-----------------------------------------------------------------------------\n|\t\n*\/\nvoid FourTaxonExample::readData(const std::string file_name)\n\t{\n\tstd::cerr << \"opening \" << file_name.c_str() << \" ...\" << std::endl;\n\tstd::string sequence;\n\tstd::ifstream inf(file_name.c_str());\n\tif(!inf.good())\n\t\tabort(\"problem reading datafile\");\n\tinf >> ntaxa >> nsites;\n\tcout << \"ntaxa\\t\" << ntaxa << \"\\tnsites\\t\" << nsites << endl;\n\ttaxon_name.resize(ntaxa);\n\tdata.resize(ntaxa);\n\tpartial.resize(ntaxa);\n\tfor (unsigned i = 0; i < ntaxa; ++i)\n\t\t{\n\t\tinf >> taxon_name[i];\n\t\tinf >> sequence;\n\t\tdata[i].resize(nsites);\n\t\tpartial[i].reserve(nsites*4);\n\t\tfor (unsigned j = 0; j < nsites; ++j)\n\t\t\t{\n\t\t\tswitch (sequence[j])\n\t\t\t\t{\n\t\t\t\tcase 'a':\n\t\t\t\tcase 'A':\n\t\t\t\t\tdata[i][j] = 0;\n\t\t\t\t\tpartial[i].push_back(1.0);\n\t\t\t\t\tpartial[i].push_back(0.0);\n\t\t\t\t\tpartial[i].push_back(0.0);\n\t\t\t\t\tpartial[i].push_back(0.0);\n\t\t\t\t\tbreak;\n\t\t\t\tcase 'c':\n\t\t\t\tcase 'C':\n\t\t\t\t\tdata[i][j] = 1;\n\t\t\t\t\tpartial[i].push_back(0.0);\n\t\t\t\t\tpartial[i].push_back(1.0);\n\t\t\t\t\tpartial[i].push_back(0.0);\n\t\t\t\t\tpartial[i].push_back(0.0);\n\t\t\t\t\tbreak;\n\t\t\t\tcase 'g':\n\t\t\t\tcase 'G':\n\t\t\t\t\tdata[i][j] = 2;\n\t\t\t\t\tpartial[i].push_back(0.0);\n\t\t\t\t\tpartial[i].push_back(0.0);\n\t\t\t\t\tpartial[i].push_back(1.0);\n\t\t\t\t\tpartial[i].push_back(0.0);\n\t\t\t\t\tbreak;\n\t\t\t\tcase 't':\n\t\t\t\tcase 'T':\n\t\t\t\t\tdata[i][j] = 3;\n\t\t\t\t\tpartial[i].push_back(0.0);\n\t\t\t\t\tpartial[i].push_back(0.0);\n\t\t\t\t\tpartial[i].push_back(0.0);\n\t\t\t\t\tpartial[i].push_back(1.0);\n\t\t\t\t\tbreak;\n\t\t\t\tdefault:\n\t\t\t\t\tdata[i][j] = 4;\n\t\t\t\t\tpartial[i].push_back(1.0);\n\t\t\t\t\tpartial[i].push_back(1.0);\n\t\t\t\t\tpartial[i].push_back(1.0);\n\t\t\t\t\tpartial[i].push_back(1.0);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\tinf.close();\n\t}\n\t\n\/*-----------------------------------------------------------------------------\n|\t\n*\/\nvoid FourTaxonExample::writeData(const std::string file_name)\n\t{\n\tstd::ofstream outf(file_name.c_str(), std::ios::out);\n\toutf << ntaxa << \" \" << nsites << std::endl;\n\tfor (unsigned i = 0; i < ntaxa; ++i)\n\t\t{\n\t\toutf << taxon_name[i] << \" \";\n\t\tfor (unsigned j = 0; j < nsites; ++j)\n\t\t\t{\n\t\t\tswitch (data[i][j])\n\t\t\t\t{\n\t\t\t\tcase 0:\n\t\t\t\t\toutf << 'a';\n\t\t\t\t\tbreak;\n\t\t\t\tcase 1:\n\t\t\t\t\toutf << 'c';\n\t\t\t\t\tbreak;\n\t\t\t\tcase 2:\n\t\t\t\t\toutf << 'g';\n\t\t\t\t\tbreak;\n\t\t\t\tcase 3:\n\t\t\t\t\toutf << 't';\n\t\t\t\t\tbreak;\n\t\t\t\tdefault:\n\t\t\t\t\toutf << '?';\n\t\t\t\t}\n\t\t\t}\n\t\t\toutf << std::endl;\n\t\t}\n\toutf.close();\n\t}\n\n\/*-----------------------------------------------------------------------------\n|\t\n*\/\nint main(int argc, char* argv[])\n\t{\n\tFourTaxonExample fte;\n\tfte.run();\n\t}\n\t\n<|endoftext|>"} {"text":"<commit_before>#include \"SH_OpenAL.h\"\n#include \"alloca_def.h\"\n#include <assert.h>\n\n\/\/#define LOGGING\n#define SAMPLE_RATE 44100\n\nALCint g_attrList[] = \n{\n\tALC_FREQUENCY,\tSAMPLE_RATE,\n\t0,\t\t\t\t0\n};\n\n#define CHECK_AL_ERROR() { assert(alGetError() == AL_NO_ERROR); }\n\nCSH_OpenAL::CSH_OpenAL() :\nm_context(m_device, g_attrList),\nm_lastUpdateTime(0),\nm_mustSync(true)\n{\n\tm_context.MakeCurrent();\n\talGenBuffers(MAX_BUFFERS, m_bufferNames);\n\tCHECK_AL_ERROR();\n\tReset();\n}\n\nCSH_OpenAL::~CSH_OpenAL()\n{\n\tReset();\n\talDeleteBuffers(MAX_BUFFERS, m_bufferNames);\n\tCHECK_AL_ERROR();\n}\n\nCSoundHandler* CSH_OpenAL::HandlerFactory()\n{\n\treturn new CSH_OpenAL();\n}\n\nvoid CSH_OpenAL::Reset()\n{\n\tm_source.Stop();\n\tALint sourceState = m_source.GetState();\n\tassert(sourceState == AL_INITIAL || sourceState == AL_STOPPED);\n\talSourcei(m_source, AL_BUFFER, 0);\n\tCHECK_AL_ERROR();\n\tm_availableBuffers.clear();\n\tm_availableBuffers.insert(m_availableBuffers.begin(), m_bufferNames, m_bufferNames + MAX_BUFFERS);\n}\n\nvoid CSH_OpenAL::RecycleBuffers()\n{\n\tunsigned int bufferCount = m_source.GetBuffersProcessed();\n\tCHECK_AL_ERROR();\n\tif(bufferCount != 0)\n\t{\n\t\tALuint* bufferNames = reinterpret_cast<ALuint*>(alloca(sizeof(ALuint) * bufferCount));\n\t\talSourceUnqueueBuffers(m_source, bufferCount, bufferNames);\n\t\tCHECK_AL_ERROR();\n\t\tm_availableBuffers.insert(m_availableBuffers.begin(), bufferNames, bufferNames + bufferCount);\n\t}\n}\n\nbool CSH_OpenAL::HasFreeBuffers()\n{\n\treturn m_availableBuffers.size() != 0;\n}\n\nvoid CSH_OpenAL::Write(int16* samples, unsigned int sampleCount, unsigned int sampleRate)\n{\n\tassert(m_availableBuffers.size() != 0);\n\tif(m_availableBuffers.size() == 0) return;\n\tALuint buffer = *m_availableBuffers.begin();\n\tm_availableBuffers.pop_front();\n\n\talBufferData(buffer, AL_FORMAT_STEREO16, samples, sampleCount * sizeof(int16), sampleRate);\n\tCHECK_AL_ERROR();\n\t\n\talSourceQueueBuffers(m_source, 1, &buffer);\n\tCHECK_AL_ERROR();\n\t\n\tif(m_availableBuffers.size() == 0)\n\t{\n\t\tALint sourceState = m_source.GetState();\n\t\tif(sourceState != AL_PLAYING)\n\t\t{\n\t\t\tm_source.Play();\n\t\t\tassert(m_source.GetState() == AL_PLAYING);\n\t\t\tRecycleBuffers();\n\t\t}\n\t}\n}\n<commit_msg>Don't wait for all buffers to be queued before starting playback.<commit_after>#include \"SH_OpenAL.h\"\n#include \"alloca_def.h\"\n#include <assert.h>\n\n\/\/#define LOGGING\n#define SAMPLE_RATE 44100\n\nALCint g_attrList[] = \n{\n\tALC_FREQUENCY,\tSAMPLE_RATE,\n\t0,\t\t\t\t0\n};\n\n#define CHECK_AL_ERROR() { assert(alGetError() == AL_NO_ERROR); }\n\nCSH_OpenAL::CSH_OpenAL() :\nm_context(m_device, g_attrList),\nm_lastUpdateTime(0),\nm_mustSync(true)\n{\n\tm_context.MakeCurrent();\n\talGenBuffers(MAX_BUFFERS, m_bufferNames);\n\tCHECK_AL_ERROR();\n\tReset();\n}\n\nCSH_OpenAL::~CSH_OpenAL()\n{\n\tReset();\n\talDeleteBuffers(MAX_BUFFERS, m_bufferNames);\n\tCHECK_AL_ERROR();\n}\n\nCSoundHandler* CSH_OpenAL::HandlerFactory()\n{\n\treturn new CSH_OpenAL();\n}\n\nvoid CSH_OpenAL::Reset()\n{\n\tm_source.Stop();\n\tALint sourceState = m_source.GetState();\n\tassert(sourceState == AL_INITIAL || sourceState == AL_STOPPED);\n\talSourcei(m_source, AL_BUFFER, 0);\n\tCHECK_AL_ERROR();\n\tm_availableBuffers.clear();\n\tm_availableBuffers.insert(m_availableBuffers.begin(), m_bufferNames, m_bufferNames + MAX_BUFFERS);\n}\n\nvoid CSH_OpenAL::RecycleBuffers()\n{\n\tunsigned int bufferCount = m_source.GetBuffersProcessed();\n\tCHECK_AL_ERROR();\n\tif(bufferCount != 0)\n\t{\n\t\tALuint* bufferNames = reinterpret_cast<ALuint*>(alloca(sizeof(ALuint) * bufferCount));\n\t\talSourceUnqueueBuffers(m_source, bufferCount, bufferNames);\n\t\tCHECK_AL_ERROR();\n\t\tm_availableBuffers.insert(m_availableBuffers.begin(), bufferNames, bufferNames + bufferCount);\n\t}\n}\n\nbool CSH_OpenAL::HasFreeBuffers()\n{\n\treturn m_availableBuffers.size() != 0;\n}\n\nvoid CSH_OpenAL::Write(int16* samples, unsigned int sampleCount, unsigned int sampleRate)\n{\n\tassert(m_availableBuffers.size() != 0);\n\tif(m_availableBuffers.size() == 0) return;\n\tALuint buffer = *m_availableBuffers.begin();\n\tm_availableBuffers.pop_front();\n\n\talBufferData(buffer, AL_FORMAT_STEREO16, samples, sampleCount * sizeof(int16), sampleRate);\n\tCHECK_AL_ERROR();\n\t\n\talSourceQueueBuffers(m_source, 1, &buffer);\n\tCHECK_AL_ERROR();\n\t\n\tALint sourceState = m_source.GetState();\n\tif(sourceState != AL_PLAYING)\n\t{\n\t\tm_source.Play();\n\t\tassert(m_source.GetState() == AL_PLAYING);\n\t}\n}\n<|endoftext|>"} {"text":"<commit_before>\/*\n RawSpeed - RAW file decoder.\n\n Copyright (C) 2009-2014 Klaus Post\n Copyright (C) 2014-2015 Pedro Côrte-Real\n\n This library is free software; you can redistribute it and\/or\n modify it under the terms of the GNU Lesser General Public\n License as published by the Free Software Foundation; either\n version 2 of the License, or (at your option) any later version.\n\n This library is distributed in the hope that it will be useful,\n but WITHOUT ANY WARRANTY; without even the implied warranty of\n MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU\n Lesser General Public License for more details.\n\n You should have received a copy of the GNU Lesser General Public\n License along with this library; if not, write to the Free Software\n Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA\n*\/\n\n#include \"decoders\/RafDecoder.h\"\n#include \"common\/Common.h\" \/\/ for uint32, ushort16\n#include \"common\/Point.h\" \/\/ for iPoint2D, iRecta...\n#include \"decoders\/RawDecoderException.h\" \/\/ for RawDecoderExcept...\n#include \"decompressors\/UncompressedDecompressor.h\" \/\/ for UncompressedDeco...\n#include \"io\/Buffer.h\" \/\/ for Buffer\n#include \"io\/ByteStream.h\" \/\/ for ByteStream\n#include \"io\/Endianness.h\" \/\/ for getHostEndianness\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 \"tiff\/TiffEntry.h\" \/\/ for TiffEntry\n#include \"tiff\/TiffIFD.h\" \/\/ for TiffRootIFD, Tif...\n#include \"tiff\/TiffTag.h\" \/\/ for TiffTag::FUJIOLDWB\n#include <cassert> \/\/ for assert\n#include <cstdio> \/\/ for size_t\n#include <cstring> \/\/ for memcmp\n#include <memory> \/\/ for unique_ptr, allo...\n#include <string> \/\/ for string\n#include <vector> \/\/ for vector\n\nnamespace rawspeed {\n\nbool RafDecoder::isRAF(const Buffer* input) {\n static const char magic[] = \"FUJIFILMCCD-RAW \";\n static const size_t magic_size = sizeof(magic) - 1; \/\/ excluding \\0\n const unsigned char* data = input->getData(0, magic_size);\n return 0 == memcmp(&data[0], magic, magic_size);\n}\n\nbool RafDecoder::isAppropriateDecoder(const TiffRootIFD* rootIFD,\n const Buffer* file) {\n const auto id = rootIFD->getID();\n const std::string& make = id.make;\n\n \/\/ FIXME: magic\n\n return make == \"FUJIFILM\";\n}\n\nRawImage RafDecoder::decodeRawInternal() {\n auto raw = mRootIFD->getIFDWithTag(FUJI_STRIPOFFSETS);\n uint32 height = 0;\n uint32 width = 0;\n\n if (raw->hasEntry(FUJI_RAWIMAGEFULLHEIGHT)) {\n height = raw->getEntry(FUJI_RAWIMAGEFULLHEIGHT)->getU32();\n width = raw->getEntry(FUJI_RAWIMAGEFULLWIDTH)->getU32();\n } else if (raw->hasEntry(IMAGEWIDTH)) {\n TiffEntry *e = raw->getEntry(IMAGEWIDTH);\n height = e->getU16(0);\n width = e->getU16(1);\n } else\n ThrowRDE(\"Unable to locate image size\");\n\n if (raw->hasEntry(FUJI_LAYOUT)) {\n TiffEntry *e = raw->getEntry(FUJI_LAYOUT);\n alt_layout = !(e->getByte(0) >> 7);\n }\n\n TiffEntry *offsets = raw->getEntry(FUJI_STRIPOFFSETS);\n TiffEntry *counts = raw->getEntry(FUJI_STRIPBYTECOUNTS);\n\n if (offsets->count != 1 || counts->count != 1)\n ThrowRDE(\"Multiple Strips found: %u %u\", offsets->count, counts->count);\n\n if (counts->getU32() * 8 \/ (width * height) < 10)\n ThrowRDE(\"Don't know how to decode compressed images\");\n\n ByteStream input(offsets->getRootIfdData());\n input = input.getSubStream(offsets->getU32(), counts->getU32());\n\n \/\/ x-trans sensors report 14bpp, but data isn't packed\n \/\/ thus, unless someone has any better ideas, let's autodetect it.\n int bps;\n\n \/\/ Some fuji SuperCCD cameras include a second raw image next to the first one\n \/\/ that is identical but darker to the first. The two combined can produce\n \/\/ a higher dynamic range image. Right now we're ignoring it.\n bool double_width;\n\n if (8UL * counts->getU32() >= 2UL * 16UL * width * height) {\n bps = 16;\n double_width = true;\n } else if (8UL * counts->getU32() >= 2UL * 14UL * width * height) {\n bps = 14;\n double_width = true;\n } else if (8UL * counts->getU32() >= 2UL * 12UL * width * height) {\n bps = 12;\n double_width = true;\n } else if (8UL * counts->getU32() >= 16UL * width * height) {\n bps = 16;\n double_width = false;\n } else if (8UL * counts->getU32() >= 14UL * width * height) {\n bps = 14;\n double_width = false;\n } else if (8UL * counts->getU32() >= 12UL * width * height) {\n bps = 12;\n double_width = false;\n } else {\n ThrowRDE(\"Can not detect bitdepth. StripByteCounts = %u, width = %u, \"\n \"height = %u\",\n counts->getU32(), width, height);\n }\n\n double_width = hints.has(\"double_width_unpacked\");\n const uint32 real_width = double_width ? 2U * width : width;\n\n mRaw->dim = iPoint2D(real_width, height);\n mRaw->createData();\n\n UncompressedDecompressor u(input, mRaw);\n\n iPoint2D pos(0, 0);\n\n if (double_width) {\n u.decodeRawUnpacked<16, little>(width * 2, height);\n } else if (input.isInNativeByteOrder() == (getHostEndianness() == big)) {\n u.decodeRawUnpacked<16, big>(width, height);\n } else {\n if (hints.has(\"jpeg32_bitorder\")) {\n u.readUncompressedRaw(mRaw->dim, pos, width * bps \/ 8, bps,\n BitOrder_MSB32);\n } else {\n u.readUncompressedRaw(mRaw->dim, pos, width * bps \/ 8, bps, BitOrder_LSB);\n }\n }\n\n return mRaw;\n}\n\nvoid RafDecoder::checkSupportInternal(const CameraMetaData* meta) {\n if (!this->checkCameraSupported(meta, mRootIFD->getID(), \"\"))\n ThrowRDE(\"Unknown camera. Will not guess.\");\n}\n\nvoid RafDecoder::decodeMetaDataInternal(const CameraMetaData* meta) {\n int iso = 0;\n if (mRootIFD->hasEntryRecursive(ISOSPEEDRATINGS))\n iso = mRootIFD->getEntryRecursive(ISOSPEEDRATINGS)->getU32();\n mRaw->metadata.isoSpeed = iso;\n\n \/\/ This is where we'd normally call setMetaData but since we may still need\n \/\/ to rotate the image for SuperCCD cameras we do everything ourselves\n auto id = mRootIFD->getID();\n const Camera* cam = meta->getCamera(id.make, id.model, \"\");\n if (!cam)\n ThrowRDE(\"Couldn't find camera\");\n\n assert(cam != nullptr);\n\n iPoint2D new_size(mRaw->dim);\n iPoint2D crop_offset = iPoint2D(0,0);\n\n if (applyCrop) {\n new_size = cam->cropSize;\n crop_offset = cam->cropPos;\n bool double_width = hints.has(\"double_width_unpacked\");\n \/\/ If crop size is negative, use relative cropping\n if (new_size.x <= 0)\n new_size.x = mRaw->dim.x \/ (double_width ? 2 : 1) - cam->cropPos.x + new_size.x;\n else\n new_size.x \/= (double_width ? 2 : 1);\n if (new_size.y <= 0)\n new_size.y = mRaw->dim.y - cam->cropPos.y + new_size.y;\n }\n\n bool rotate = hints.has(\"fuji_rotate\");\n rotate = rotate && fujiRotate;\n\n \/\/ Rotate 45 degrees - could be multithreaded.\n if (rotate && !this->uncorrectedRawValues) {\n \/\/ Calculate the 45 degree rotated size;\n uint32 rotatedsize;\n uint32 rotationPos;\n if (alt_layout) {\n rotatedsize = new_size.y+new_size.x\/2;\n rotationPos = new_size.x\/2 - 1;\n }\n else {\n rotatedsize = new_size.x+new_size.y\/2;\n rotationPos = new_size.x - 1;\n }\n\n iPoint2D final_size(rotatedsize, rotatedsize-1);\n RawImage rotated = RawImage::create(final_size, TYPE_USHORT16, 1);\n rotated->clearArea(iRectangle2D(iPoint2D(0,0), rotated->dim));\n rotated->metadata = mRaw->metadata;\n rotated->metadata.fujiRotationPos = rotationPos;\n\n int dest_pitch = static_cast<int>(rotated->pitch) \/ 2;\n auto* dst = reinterpret_cast<ushort16*>(rotated->getData(0, 0));\n\n for (int y = 0; y < new_size.y; y++) {\n auto* src = reinterpret_cast<ushort16*>(\n mRaw->getData(crop_offset.x, crop_offset.y + y));\n for (int x = 0; x < new_size.x; x++) {\n int h;\n int w;\n if (alt_layout) { \/\/ Swapped x and y\n h = rotatedsize - (new_size.y + 1 - y + (x >> 1));\n w = ((x+1) >> 1) + y;\n } else {\n h = new_size.x - 1 - x + (y >> 1);\n w = ((y+1) >> 1) + x;\n }\n if (h < rotated->dim.y && w < rotated->dim.x)\n dst[w + h * dest_pitch] = src[x];\n else\n ThrowRDE(\"Trying to write out of bounds\");\n }\n }\n mRaw = rotated;\n } else if (applyCrop) {\n mRaw->subFrame(iRectangle2D(crop_offset, new_size));\n }\n\n const CameraSensorInfo *sensor = cam->getSensorInfo(iso);\n mRaw->blackLevel = sensor->mBlackLevel;\n\n \/\/ at least the (bayer sensor) X100 comes with a tag like this:\n if (mRootIFD->hasEntryRecursive(FUJI_BLACKLEVEL)) {\n TiffEntry* sep_black = mRootIFD->getEntryRecursive(FUJI_BLACKLEVEL);\n if (sep_black->count == 4)\n {\n for(int k=0;k<4;k++)\n mRaw->blackLevelSeparate[k] = sep_black->getU32(k);\n } else if (sep_black->count == 36) {\n for (int& k : mRaw->blackLevelSeparate)\n k = 0;\n\n for (int y = 0; y < 6; y++) {\n for (int x = 0; x < 6; x++)\n mRaw->blackLevelSeparate[2 * (y % 2) + (x % 2)] +=\n sep_black->getU32(6 * y + x);\n }\n\n for (int& k : mRaw->blackLevelSeparate)\n k \/= 9;\n }\n }\n\n mRaw->whitePoint = sensor->mWhiteLevel;\n mRaw->blackAreas = cam->blackAreas;\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 = id.make;\n mRaw->metadata.model = id.model;\n\n if (mRootIFD->hasEntryRecursive(FUJI_WB_GRBLEVELS)) {\n TiffEntry *wb = mRootIFD->getEntryRecursive(FUJI_WB_GRBLEVELS);\n if (wb->count == 3) {\n mRaw->metadata.wbCoeffs[0] = wb->getFloat(1);\n mRaw->metadata.wbCoeffs[1] = wb->getFloat(0);\n mRaw->metadata.wbCoeffs[2] = wb->getFloat(2);\n }\n } else if (mRootIFD->hasEntryRecursive(FUJIOLDWB)) {\n TiffEntry *wb = mRootIFD->getEntryRecursive(FUJIOLDWB);\n if (wb->count == 8) {\n mRaw->metadata.wbCoeffs[0] = wb->getFloat(1);\n mRaw->metadata.wbCoeffs[1] = wb->getFloat(0);\n mRaw->metadata.wbCoeffs[2] = wb->getFloat(3);\n }\n }\n}\n\n} \/\/ namespace rawspeed\n<commit_msg>RafDecoder::decodeRawInternal(): check w\/h before doing anything<commit_after>\/*\n RawSpeed - RAW file decoder.\n\n Copyright (C) 2009-2014 Klaus Post\n Copyright (C) 2014-2015 Pedro Côrte-Real\n\n This library is free software; you can redistribute it and\/or\n modify it under the terms of the GNU Lesser General Public\n License as published by the Free Software Foundation; either\n version 2 of the License, or (at your option) any later version.\n\n This library is distributed in the hope that it will be useful,\n but WITHOUT ANY WARRANTY; without even the implied warranty of\n MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU\n Lesser General Public License for more details.\n\n You should have received a copy of the GNU Lesser General Public\n License along with this library; if not, write to the Free Software\n Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA\n*\/\n\n#include \"decoders\/RafDecoder.h\"\n#include \"common\/Common.h\" \/\/ for uint32, ushort16\n#include \"common\/Point.h\" \/\/ for iPoint2D, iRecta...\n#include \"decoders\/RawDecoderException.h\" \/\/ for RawDecoderExcept...\n#include \"decompressors\/UncompressedDecompressor.h\" \/\/ for UncompressedDeco...\n#include \"io\/Buffer.h\" \/\/ for Buffer\n#include \"io\/ByteStream.h\" \/\/ for ByteStream\n#include \"io\/Endianness.h\" \/\/ for getHostEndianness\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 \"tiff\/TiffEntry.h\" \/\/ for TiffEntry\n#include \"tiff\/TiffIFD.h\" \/\/ for TiffRootIFD, Tif...\n#include \"tiff\/TiffTag.h\" \/\/ for TiffTag::FUJIOLDWB\n#include <cassert> \/\/ for assert\n#include <cstdio> \/\/ for size_t\n#include <cstring> \/\/ for memcmp\n#include <memory> \/\/ for unique_ptr, allo...\n#include <string> \/\/ for string\n#include <vector> \/\/ for vector\n\nnamespace rawspeed {\n\nbool RafDecoder::isRAF(const Buffer* input) {\n static const char magic[] = \"FUJIFILMCCD-RAW \";\n static const size_t magic_size = sizeof(magic) - 1; \/\/ excluding \\0\n const unsigned char* data = input->getData(0, magic_size);\n return 0 == memcmp(&data[0], magic, magic_size);\n}\n\nbool RafDecoder::isAppropriateDecoder(const TiffRootIFD* rootIFD,\n const Buffer* file) {\n const auto id = rootIFD->getID();\n const std::string& make = id.make;\n\n \/\/ FIXME: magic\n\n return make == \"FUJIFILM\";\n}\n\nRawImage RafDecoder::decodeRawInternal() {\n auto raw = mRootIFD->getIFDWithTag(FUJI_STRIPOFFSETS);\n uint32 height = 0;\n uint32 width = 0;\n\n if (raw->hasEntry(FUJI_RAWIMAGEFULLHEIGHT)) {\n height = raw->getEntry(FUJI_RAWIMAGEFULLHEIGHT)->getU32();\n width = raw->getEntry(FUJI_RAWIMAGEFULLWIDTH)->getU32();\n } else if (raw->hasEntry(IMAGEWIDTH)) {\n TiffEntry *e = raw->getEntry(IMAGEWIDTH);\n height = e->getU16(0);\n width = e->getU16(1);\n } else\n ThrowRDE(\"Unable to locate image size\");\n\n if (height < 1 || width < 1)\n ThrowRDE(\"Bad image dimensions\");\n\n if (raw->hasEntry(FUJI_LAYOUT)) {\n TiffEntry *e = raw->getEntry(FUJI_LAYOUT);\n alt_layout = !(e->getByte(0) >> 7);\n }\n\n TiffEntry *offsets = raw->getEntry(FUJI_STRIPOFFSETS);\n TiffEntry *counts = raw->getEntry(FUJI_STRIPBYTECOUNTS);\n\n if (offsets->count != 1 || counts->count != 1)\n ThrowRDE(\"Multiple Strips found: %u %u\", offsets->count, counts->count);\n\n if (counts->getU32() * 8 \/ (width * height) < 10)\n ThrowRDE(\"Don't know how to decode compressed images\");\n\n ByteStream input(offsets->getRootIfdData());\n input = input.getSubStream(offsets->getU32(), counts->getU32());\n\n \/\/ x-trans sensors report 14bpp, but data isn't packed\n \/\/ thus, unless someone has any better ideas, let's autodetect it.\n int bps;\n\n \/\/ Some fuji SuperCCD cameras include a second raw image next to the first one\n \/\/ that is identical but darker to the first. The two combined can produce\n \/\/ a higher dynamic range image. Right now we're ignoring it.\n bool double_width;\n\n if (8UL * counts->getU32() >= 2UL * 16UL * width * height) {\n bps = 16;\n double_width = true;\n } else if (8UL * counts->getU32() >= 2UL * 14UL * width * height) {\n bps = 14;\n double_width = true;\n } else if (8UL * counts->getU32() >= 2UL * 12UL * width * height) {\n bps = 12;\n double_width = true;\n } else if (8UL * counts->getU32() >= 16UL * width * height) {\n bps = 16;\n double_width = false;\n } else if (8UL * counts->getU32() >= 14UL * width * height) {\n bps = 14;\n double_width = false;\n } else if (8UL * counts->getU32() >= 12UL * width * height) {\n bps = 12;\n double_width = false;\n } else {\n ThrowRDE(\"Can not detect bitdepth. StripByteCounts = %u, width = %u, \"\n \"height = %u\",\n counts->getU32(), width, height);\n }\n\n double_width = hints.has(\"double_width_unpacked\");\n const uint32 real_width = double_width ? 2U * width : width;\n\n mRaw->dim = iPoint2D(real_width, height);\n mRaw->createData();\n\n UncompressedDecompressor u(input, mRaw);\n\n iPoint2D pos(0, 0);\n\n if (double_width) {\n u.decodeRawUnpacked<16, little>(width * 2, height);\n } else if (input.isInNativeByteOrder() == (getHostEndianness() == big)) {\n u.decodeRawUnpacked<16, big>(width, height);\n } else {\n if (hints.has(\"jpeg32_bitorder\")) {\n u.readUncompressedRaw(mRaw->dim, pos, width * bps \/ 8, bps,\n BitOrder_MSB32);\n } else {\n u.readUncompressedRaw(mRaw->dim, pos, width * bps \/ 8, bps, BitOrder_LSB);\n }\n }\n\n return mRaw;\n}\n\nvoid RafDecoder::checkSupportInternal(const CameraMetaData* meta) {\n if (!this->checkCameraSupported(meta, mRootIFD->getID(), \"\"))\n ThrowRDE(\"Unknown camera. Will not guess.\");\n}\n\nvoid RafDecoder::decodeMetaDataInternal(const CameraMetaData* meta) {\n int iso = 0;\n if (mRootIFD->hasEntryRecursive(ISOSPEEDRATINGS))\n iso = mRootIFD->getEntryRecursive(ISOSPEEDRATINGS)->getU32();\n mRaw->metadata.isoSpeed = iso;\n\n \/\/ This is where we'd normally call setMetaData but since we may still need\n \/\/ to rotate the image for SuperCCD cameras we do everything ourselves\n auto id = mRootIFD->getID();\n const Camera* cam = meta->getCamera(id.make, id.model, \"\");\n if (!cam)\n ThrowRDE(\"Couldn't find camera\");\n\n assert(cam != nullptr);\n\n iPoint2D new_size(mRaw->dim);\n iPoint2D crop_offset = iPoint2D(0,0);\n\n if (applyCrop) {\n new_size = cam->cropSize;\n crop_offset = cam->cropPos;\n bool double_width = hints.has(\"double_width_unpacked\");\n \/\/ If crop size is negative, use relative cropping\n if (new_size.x <= 0)\n new_size.x = mRaw->dim.x \/ (double_width ? 2 : 1) - cam->cropPos.x + new_size.x;\n else\n new_size.x \/= (double_width ? 2 : 1);\n if (new_size.y <= 0)\n new_size.y = mRaw->dim.y - cam->cropPos.y + new_size.y;\n }\n\n bool rotate = hints.has(\"fuji_rotate\");\n rotate = rotate && fujiRotate;\n\n \/\/ Rotate 45 degrees - could be multithreaded.\n if (rotate && !this->uncorrectedRawValues) {\n \/\/ Calculate the 45 degree rotated size;\n uint32 rotatedsize;\n uint32 rotationPos;\n if (alt_layout) {\n rotatedsize = new_size.y+new_size.x\/2;\n rotationPos = new_size.x\/2 - 1;\n }\n else {\n rotatedsize = new_size.x+new_size.y\/2;\n rotationPos = new_size.x - 1;\n }\n\n iPoint2D final_size(rotatedsize, rotatedsize-1);\n RawImage rotated = RawImage::create(final_size, TYPE_USHORT16, 1);\n rotated->clearArea(iRectangle2D(iPoint2D(0,0), rotated->dim));\n rotated->metadata = mRaw->metadata;\n rotated->metadata.fujiRotationPos = rotationPos;\n\n int dest_pitch = static_cast<int>(rotated->pitch) \/ 2;\n auto* dst = reinterpret_cast<ushort16*>(rotated->getData(0, 0));\n\n for (int y = 0; y < new_size.y; y++) {\n auto* src = reinterpret_cast<ushort16*>(\n mRaw->getData(crop_offset.x, crop_offset.y + y));\n for (int x = 0; x < new_size.x; x++) {\n int h;\n int w;\n if (alt_layout) { \/\/ Swapped x and y\n h = rotatedsize - (new_size.y + 1 - y + (x >> 1));\n w = ((x+1) >> 1) + y;\n } else {\n h = new_size.x - 1 - x + (y >> 1);\n w = ((y+1) >> 1) + x;\n }\n if (h < rotated->dim.y && w < rotated->dim.x)\n dst[w + h * dest_pitch] = src[x];\n else\n ThrowRDE(\"Trying to write out of bounds\");\n }\n }\n mRaw = rotated;\n } else if (applyCrop) {\n mRaw->subFrame(iRectangle2D(crop_offset, new_size));\n }\n\n const CameraSensorInfo *sensor = cam->getSensorInfo(iso);\n mRaw->blackLevel = sensor->mBlackLevel;\n\n \/\/ at least the (bayer sensor) X100 comes with a tag like this:\n if (mRootIFD->hasEntryRecursive(FUJI_BLACKLEVEL)) {\n TiffEntry* sep_black = mRootIFD->getEntryRecursive(FUJI_BLACKLEVEL);\n if (sep_black->count == 4)\n {\n for(int k=0;k<4;k++)\n mRaw->blackLevelSeparate[k] = sep_black->getU32(k);\n } else if (sep_black->count == 36) {\n for (int& k : mRaw->blackLevelSeparate)\n k = 0;\n\n for (int y = 0; y < 6; y++) {\n for (int x = 0; x < 6; x++)\n mRaw->blackLevelSeparate[2 * (y % 2) + (x % 2)] +=\n sep_black->getU32(6 * y + x);\n }\n\n for (int& k : mRaw->blackLevelSeparate)\n k \/= 9;\n }\n }\n\n mRaw->whitePoint = sensor->mWhiteLevel;\n mRaw->blackAreas = cam->blackAreas;\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 = id.make;\n mRaw->metadata.model = id.model;\n\n if (mRootIFD->hasEntryRecursive(FUJI_WB_GRBLEVELS)) {\n TiffEntry *wb = mRootIFD->getEntryRecursive(FUJI_WB_GRBLEVELS);\n if (wb->count == 3) {\n mRaw->metadata.wbCoeffs[0] = wb->getFloat(1);\n mRaw->metadata.wbCoeffs[1] = wb->getFloat(0);\n mRaw->metadata.wbCoeffs[2] = wb->getFloat(2);\n }\n } else if (mRootIFD->hasEntryRecursive(FUJIOLDWB)) {\n TiffEntry *wb = mRootIFD->getEntryRecursive(FUJIOLDWB);\n if (wb->count == 8) {\n mRaw->metadata.wbCoeffs[0] = wb->getFloat(1);\n mRaw->metadata.wbCoeffs[1] = wb->getFloat(0);\n mRaw->metadata.wbCoeffs[2] = wb->getFloat(3);\n }\n }\n}\n\n} \/\/ namespace rawspeed\n<|endoftext|>"} {"text":"<commit_before>#include \"description.h\"\n\n#include <sstream>\n\nnamespace possumwood {\n\nnamespace {\n\nbool starts_with(const std::string& str, const std::string& prefix) {\n\tif(str.length() < prefix.length())\n\t\treturn false;\n\n\tauto it1 = str.begin();\n\tauto it2 = prefix.begin();\n\n\twhile(it2 != prefix.end()) {\n\t\tif(*it1 != *it2)\n\t\t\treturn false;\n\n\t\t++it1;\n\t\t++it2;\n\t}\n\n\treturn true;\n}\n\n}\n\nDescription::Description(const std::string& md) : m_markDown(md) {\n}\n\nvoid Description::clear() {\n\tm_markDown = \"(empty description)\";\n}\n\nvoid Description::setMarkdown(const std::string& md) {\n\tm_markDown = md;\n}\n\nconst std::string& Description::markdown() const {\n\treturn m_markDown;\n}\n\nstd::string Description::html() const {\n\tstd::stringstream ss(m_markDown);\n\n\tstd::string result;\n\n\twhile(ss.good()) {\n\t\tstd::string line;\n\t\tstd::getline(ss, line);\n\n\t\tif(starts_with(line, \"# \"))\n\t\t\tline = \"<h1>\" + line.substr(2) + \"<\/h1>\\n\";\n\t\telse if(starts_with(line, \"## \"))\n\t\t\tline = \"<h2>\" + line.substr(3) + \"<\/h2>\\n\";\n\t\telse if(starts_with(line, \"### \"))\n\t\t\tline = \"<h3>\" + line.substr(4) + \"<\/h3>\\n\";\n\t\telse if(starts_with(line, \"#### \"))\n\t\t\tline = \"<h4>\" + line.substr(5) + \"<\/h4>\\n\";\n\t\telse if(!line.empty())\n\t\t\tline = \"<p>\" + line + \"<\/p>\\n\";\n\n\t\t{\n\t\t\tstd::string link_text, link;\n\t\t\tint state = 0;\n\t\t\tstd::size_t start = 0;\n\t\t\tstd::size_t bracket_counter = 0;\n\n\t\t\tfor(std::size_t i=0; i<line.length(); ++i) {\n\t\t\t\tswitch(state) {\n\t\t\t\t\tcase 0:\n\t\t\t\t\t\tif(line[i] == '[') {\n\t\t\t\t\t\t\tstate = 1;\n\t\t\t\t\t\t\tstart = i;\n\t\t\t\t\t\t}\n\t\t\t\t\t\tbreak;\n\n\t\t\t\t\tcase 1:\n\t\t\t\t\t\tif(line[i] == ']')\n\t\t\t\t\t\t\tstate = 2;\n\t\t\t\t\t\telse\n\t\t\t\t\t\t\tlink_text += line[i];\n\t\t\t\t\t\tbreak;\n\n\t\t\t\t\tcase 2:\n\t\t\t\t\t\tif(line[i] == '(') {\n\t\t\t\t\t\t\tstate = 3;\n\t\t\t\t\t\t\tbracket_counter = 1;\n\t\t\t\t\t\t}\n\t\t\t\t\t\telse\n\t\t\t\t\t\t\tstate = 0;\n\t\t\t\t\t\tbreak;\n\n\t\t\t\t\tcase 3:\n\t\t\t\t\t\tif(line[i] == '(')\n\t\t\t\t\t\t\tbracket_counter++;\n\t\t\t\t\t\telse if(line[i] == ')')\n\t\t\t\t\t\t\tbracket_counter--;\n\n\t\t\t\t\t\tif(bracket_counter == 0)\n\t\t\t\t\t\t\tstate = 4;\n\t\t\t\t\t\telse\n\t\t\t\t\t\t\tlink += line[i];\n\t\t\t\t\t\tbreak;\n\n\t\t\t\t\tcase 4:\n\t\t\t\t\t\tline = line.substr(0, start) + \"<a href=\\\"\" + link + \"\\\">\" + link_text + \"<\/a>\" + line.substr(i);\n\t\t\t\t\t\ti = 0;\n\t\t\t\t\t\tstate = 0;\n\t\t\t\t\t\tlink = \"\";\n\t\t\t\t\t\tlink_text = \"\";\n\t\t\t\t\t\tbreak;\n\t\t\t\t};\n\t\t\t}\n\t\t}\n\n\t\t{\n\t\t\tint state = 0;\n\t\t\tfor(std::size_t i=0; i<line.length(); ++i) {\n\t\t\t\tswitch(state) {\n\t\t\t\t\tcase 0:\n\t\t\t\t\t\tif(line[i] == '`') {\n\t\t\t\t\t\t\tline = line.substr(0, i) + \"<code>\" + line.substr(i+1);\n\t\t\t\t\t\t\tstate = 1;\n\t\t\t\t\t\t}\n\t\t\t\t\t\tbreak;\n\t\t\t\t\tcase 1:\n\t\t\t\t\t\tif(line[i] == '`') {\n\t\t\t\t\t\t\tline = line.substr(0, i) + \"<\/code>\" + line.substr(i+1);\n\t\t\t\t\t\t\tstate = 0;\n\t\t\t\t\t\t}\n\t\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\tresult += line;\n\t}\n\n\treturn result;\n}\n\nstd::string Description::serialize() const {\n\n\t\/\/ std::stringstream ss;\n\n\t\/\/ for(auto c : m_markDown) {\n\t\/\/ \tif(c == '\"')\n\t\/\/ \t\tss << \"\\\\\\\"\";\n\t\/\/ \telse if(c == '\\n')\n\t\/\/ \t\tss << \"\\\\n\";\n\t\/\/ \telse if(c == '\\r')\n\t\/\/ \t\tss << \"\\\\r\";\n\t\/\/ \telse\n\t\/\/ \t\tss << c;\n\t\/\/ }\n\n\t\/\/ return ss.str();\n\n\treturn m_markDown;\n}\n\nvoid Description::deserialize(const std::string& s) {\n\t\/\/ std::string result;\n\n\t\/\/ auto it = s.begin();\n\t\/\/ while(it != s.end()) {\n\t\/\/ \tif(*it == '\\\\') {\n\t\/\/ \t\t++it;\n\t\/\/ \t\tif(it != s.end()) {\n\t\/\/ \t\t\tif(*it == 'n')\n\t\/\/ \t\t\t\tresult += '\\n';\n\t\/\/ \t\t\telse if(*it == 'r')\n\t\/\/ \t\t\t\tresult += '\\r';\n\t\/\/ \t\t\telse if(*it == '\"')\n\t\/\/ \t\t\t\tresult += '\"';\n\t\/\/ \t\t\telse\n\t\/\/ \t\t\t\tresult += \"\\\\\" + *it;\n\t\/\/ \t\t}\n\t\/\/ \t}\n\t\/\/ \telse\n\t\/\/ \t\tresult += *it;\n\n\t\/\/ \t++it;\n\t\/\/ }\n\n\t\/\/ m_markDown = result;\n\n\tm_markDown = s;\n}\n\n}\n<commit_msg>Added support for *bold* in scene description<commit_after>#include \"description.h\"\n\n#include <sstream>\n\nnamespace possumwood {\n\nnamespace {\n\nbool starts_with(const std::string& str, const std::string& prefix) {\n\tif(str.length() < prefix.length())\n\t\treturn false;\n\n\tauto it1 = str.begin();\n\tauto it2 = prefix.begin();\n\n\twhile(it2 != prefix.end()) {\n\t\tif(*it1 != *it2)\n\t\t\treturn false;\n\n\t\t++it1;\n\t\t++it2;\n\t}\n\n\treturn true;\n}\n\n}\n\nDescription::Description(const std::string& md) : m_markDown(md) {\n}\n\nvoid Description::clear() {\n\tm_markDown = \"(empty description)\";\n}\n\nvoid Description::setMarkdown(const std::string& md) {\n\tm_markDown = md;\n}\n\nconst std::string& Description::markdown() const {\n\treturn m_markDown;\n}\n\nstd::string Description::html() const {\n\tstd::stringstream ss(m_markDown);\n\n\tstd::string result;\n\n\twhile(ss.good()) {\n\t\tstd::string line;\n\t\tstd::getline(ss, line);\n\n\t\tif(starts_with(line, \"# \"))\n\t\t\tline = \"<h1>\" + line.substr(2) + \"<\/h1>\\n\";\n\t\telse if(starts_with(line, \"## \"))\n\t\t\tline = \"<h2>\" + line.substr(3) + \"<\/h2>\\n\";\n\t\telse if(starts_with(line, \"### \"))\n\t\t\tline = \"<h3>\" + line.substr(4) + \"<\/h3>\\n\";\n\t\telse if(starts_with(line, \"#### \"))\n\t\t\tline = \"<h4>\" + line.substr(5) + \"<\/h4>\\n\";\n\t\telse if(!line.empty())\n\t\t\tline = \"<p>\" + line + \"<\/p>\\n\";\n\n\t\t{\n\t\t\tstd::string link_text, link;\n\t\t\tint state = 0;\n\t\t\tstd::size_t start = 0;\n\t\t\tstd::size_t bracket_counter = 0;\n\n\t\t\tfor(std::size_t i=0; i<line.length(); ++i) {\n\t\t\t\tswitch(state) {\n\t\t\t\t\tcase 0:\n\t\t\t\t\t\tif(line[i] == '[') {\n\t\t\t\t\t\t\tstate = 1;\n\t\t\t\t\t\t\tstart = i;\n\t\t\t\t\t\t}\n\t\t\t\t\t\tbreak;\n\n\t\t\t\t\tcase 1:\n\t\t\t\t\t\tif(line[i] == ']')\n\t\t\t\t\t\t\tstate = 2;\n\t\t\t\t\t\telse\n\t\t\t\t\t\t\tlink_text += line[i];\n\t\t\t\t\t\tbreak;\n\n\t\t\t\t\tcase 2:\n\t\t\t\t\t\tif(line[i] == '(') {\n\t\t\t\t\t\t\tstate = 3;\n\t\t\t\t\t\t\tbracket_counter = 1;\n\t\t\t\t\t\t}\n\t\t\t\t\t\telse\n\t\t\t\t\t\t\tstate = 0;\n\t\t\t\t\t\tbreak;\n\n\t\t\t\t\tcase 3:\n\t\t\t\t\t\tif(line[i] == '(')\n\t\t\t\t\t\t\tbracket_counter++;\n\t\t\t\t\t\telse if(line[i] == ')')\n\t\t\t\t\t\t\tbracket_counter--;\n\n\t\t\t\t\t\tif(bracket_counter == 0)\n\t\t\t\t\t\t\tstate = 4;\n\t\t\t\t\t\telse\n\t\t\t\t\t\t\tlink += line[i];\n\t\t\t\t\t\tbreak;\n\n\t\t\t\t\tcase 4:\n\t\t\t\t\t\tline = line.substr(0, start) + \"<a href=\\\"\" + link + \"\\\">\" + link_text + \"<\/a>\" + line.substr(i);\n\t\t\t\t\t\ti = 0;\n\t\t\t\t\t\tstate = 0;\n\t\t\t\t\t\tlink = \"\";\n\t\t\t\t\t\tlink_text = \"\";\n\t\t\t\t\t\tbreak;\n\t\t\t\t};\n\t\t\t}\n\t\t}\n\n\t\t{\n\t\t\tint state = 1;\n\t\t\tfor(std::size_t i=0; i<line.length(); ++i) {\n\t\t\t\tswitch(state) {\n\t\t\t\t\tcase 0:\n\t\t\t\t\t\tif(line[i] == ' ' || line[i] == '\\r' || line[i] == '\\n' || line[i] == '\\t')\n\t\t\t\t\t\t\tstate = 1;\n\t\t\t\t\t\tbreak;\n\t\t\t\t\tcase 1:\n\t\t\t\t\t\tif(line[i] == '`') {\n\t\t\t\t\t\t\tline = line.substr(0, i) + \"<code>\" + line.substr(i+1);\n\t\t\t\t\t\t\tstate = 1;\n\t\t\t\t\t\t}\n\t\t\t\t\t\tif(line[i] == '*') {\n\t\t\t\t\t\t\tline = line.substr(0, i) + \"<b>\" + line.substr(i+1);\n\t\t\t\t\t\t\tstate = 3;\n\t\t\t\t\t\t}\n\t\t\t\t\t\tbreak;\n\t\t\t\t\tcase 2:\n\t\t\t\t\t\tif(line[i] == '`') {\n\t\t\t\t\t\t\tline = line.substr(0, i) + \"<\/code>\" + line.substr(i+1);\n\t\t\t\t\t\t\tstate = 0;\n\t\t\t\t\t\t}\n\t\t\t\t\t\tbreak;\n\t\t\t\t\tcase 3:\n\t\t\t\t\t\tif(line[i] == '*') {\n\t\t\t\t\t\t\tline = line.substr(0, i) + \"<\/b>\" + line.substr(i+1);\n\t\t\t\t\t\t\tstate = 0;\n\t\t\t\t\t\t}\n\t\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\tresult += line;\n\t}\n\n\treturn result;\n}\n\nstd::string Description::serialize() const {\n\n\t\/\/ std::stringstream ss;\n\n\t\/\/ for(auto c : m_markDown) {\n\t\/\/ \tif(c == '\"')\n\t\/\/ \t\tss << \"\\\\\\\"\";\n\t\/\/ \telse if(c == '\\n')\n\t\/\/ \t\tss << \"\\\\n\";\n\t\/\/ \telse if(c == '\\r')\n\t\/\/ \t\tss << \"\\\\r\";\n\t\/\/ \telse\n\t\/\/ \t\tss << c;\n\t\/\/ }\n\n\t\/\/ return ss.str();\n\n\treturn m_markDown;\n}\n\nvoid Description::deserialize(const std::string& s) {\n\t\/\/ std::string result;\n\n\t\/\/ auto it = s.begin();\n\t\/\/ while(it != s.end()) {\n\t\/\/ \tif(*it == '\\\\') {\n\t\/\/ \t\t++it;\n\t\/\/ \t\tif(it != s.end()) {\n\t\/\/ \t\t\tif(*it == 'n')\n\t\/\/ \t\t\t\tresult += '\\n';\n\t\/\/ \t\t\telse if(*it == 'r')\n\t\/\/ \t\t\t\tresult += '\\r';\n\t\/\/ \t\t\telse if(*it == '\"')\n\t\/\/ \t\t\t\tresult += '\"';\n\t\/\/ \t\t\telse\n\t\/\/ \t\t\t\tresult += \"\\\\\" + *it;\n\t\/\/ \t\t}\n\t\/\/ \t}\n\t\/\/ \telse\n\t\/\/ \t\tresult += *it;\n\n\t\/\/ \t++it;\n\t\/\/ }\n\n\t\/\/ m_markDown = result;\n\n\tm_markDown = s;\n}\n\n}\n<|endoftext|>"} {"text":"<commit_before>#include \"Button.h\"\n\nvoid Button::setState(State state)\n{\n state_ = state;\n}\n\nvoid Button::fireOnClicked()\n{\n onClicked_();\n}\n\nvoid Button::transition()\n{\n switch (getState()) {\n case State::LEFT:\n if (getShape().mouseOver && !getShape().leftPressed) {\n state_ = State::MOUSE_OVER;\n }\n break;\n case State::MOUSE_OVER:\n if (getShape().leftPressed) {\n state_ = State::PRESSED;\n }\n else if (!getShape().mouseOver) {\n state_ = State::LEFT;\n }\n break;\n case State::PRESSED:\n if (!getShape().mouseOver) {\n state_ = State::LEFT;\n }\n else if (getShape().leftReleased) {\n state_ = State::RELEASED;\n }\n break;\n case State::RELEASED:\n state_ = State::MOUSE_OVER;\n break;\n default:\n break;\n }\n}\n\nButtonBuilder Button::builder()\n{\n return ButtonBuilder();\n}\n\n\n\nvoid Button::draw() const\n{\n if (view_ != nullptr) {\n switch (getState()) {\n case ButtonInterface::State::LEFT:\n view_->drawLeft();\n break;\n case ButtonInterface::State::MOUSE_OVER:\n view_->drawMouseOver();\n break;\n case ButtonInterface::State::PRESSED:\n view_->drawPressed();\n break;\n case ButtonInterface::State::RELEASED:\n view_->drawReleased();\n break;\n default:\n break;\n }\n }\n}\n\nButtonInterface::State Button::getState() const\n{\n return state_;\n}\n\nShape const &Button::getShape() const\n{\n return shape_;\n}\n<commit_msg>Buttonクラスを編集<commit_after>#include \"Button.h\"\n\nvoid Button::setState(State state)\n{\n state_ = state;\n}\n\nvoid Button::fireOnClicked()\n{\n onClicked_();\n}\n\nvoid Button::transition()\n{\n switch (getState()) {\n case State::LEFT:\n if (getShape().mouseOver && !getShape().leftPressed) {\n setState(State::MOUSE_OVER);\n }\n break;\n case State::MOUSE_OVER:\n if (getShape().leftPressed) {\n setState(State::PRESSED);\n }\n else if (!getShape().mouseOver) {\n setState(State::LEFT);\n }\n break;\n case State::PRESSED:\n if (!getShape().mouseOver) {\n setState(State::LEFT);\n }\n else if (getShape().leftReleased) {\n setState(State::RELEASED);\n }\n break;\n case State::RELEASED:\n setState(State::MOUSE_OVER);\n break;\n default:\n break;\n }\n}\n\nButtonBuilder Button::builder()\n{\n return ButtonBuilder();\n}\n\n\n\nvoid Button::draw() const\n{\n if (view_ != nullptr) {\n switch (getState()) {\n case ButtonInterface::State::LEFT:\n view_->drawLeft();\n break;\n case ButtonInterface::State::MOUSE_OVER:\n view_->drawMouseOver();\n break;\n case ButtonInterface::State::PRESSED:\n view_->drawPressed();\n break;\n case ButtonInterface::State::RELEASED:\n view_->drawReleased();\n break;\n default:\n break;\n }\n }\n}\n\nButtonInterface::State Button::getState() const\n{\n return state_;\n}\n\nShape const &Button::getShape() const\n{\n return shape_;\n}\n<|endoftext|>"} {"text":"<commit_before>#include \"binary-cache-store.hh\"\n#include \"filetransfer.hh\"\n#include \"globals.hh\"\n#include \"nar-info-disk-cache.hh\"\n\nnamespace nix {\n\nMakeError(UploadToHTTP, Error);\n\nclass HttpBinaryCacheStore : public BinaryCacheStore\n{\nprivate:\n\n Path cacheUri;\n\n struct State\n {\n bool enabled = true;\n std::chrono::steady_clock::time_point disabledUntil;\n };\n\n Sync<State> _state;\n\npublic:\n\n HttpBinaryCacheStore(\n const Params & params, const Path & _cacheUri)\n : BinaryCacheStore(params)\n , cacheUri(_cacheUri)\n {\n if (cacheUri.back() == '\/')\n cacheUri.pop_back();\n\n diskCache = getNarInfoDiskCache();\n }\n\n std::string getUri() override\n {\n return cacheUri;\n }\n\n void init() override\n {\n \/\/ FIXME: do this lazily?\n if (auto cacheInfo = diskCache->cacheExists(cacheUri)) {\n wantMassQuery.setDefault(cacheInfo->wantMassQuery ? \"true\" : \"false\");\n priority.setDefault(fmt(\"%d\", cacheInfo->priority));\n } else {\n try {\n BinaryCacheStore::init();\n } catch (UploadToHTTP &) {\n throw Error(\"'%s' does not appear to be a binary cache\", cacheUri);\n }\n diskCache->createCache(cacheUri, storeDir, wantMassQuery, priority);\n }\n }\n\nprotected:\n\n void maybeDisable()\n {\n auto state(_state.lock());\n if (state->enabled && settings.tryFallback) {\n int t = 60;\n printError(\"disabling binary cache '%s' for %s seconds\", getUri(), t);\n state->enabled = false;\n state->disabledUntil = std::chrono::steady_clock::now() + std::chrono::seconds(t);\n }\n }\n\n void checkEnabled()\n {\n auto state(_state.lock());\n if (state->enabled) return;\n if (std::chrono::steady_clock::now() > state->disabledUntil) {\n state->enabled = true;\n debug(\"re-enabling binary cache '%s'\", getUri());\n return;\n }\n throw SubstituterDisabled(\"substituter '%s' is disabled\", getUri());\n }\n\n bool fileExists(const std::string & path) override\n {\n checkEnabled();\n\n try {\n FileTransferRequest request(cacheUri + \"\/\" + path);\n request.head = true;\n getFileTransfer()->download(request);\n return true;\n } catch (FileTransferError & e) {\n \/* S3 buckets return 403 if a file doesn't exist and the\n bucket is unlistable, so treat 403 as 404. *\/\n if (e.error == FileTransfer::NotFound || e.error == FileTransfer::Forbidden)\n return false;\n maybeDisable();\n throw;\n }\n }\n\n void upsertFile(const std::string & path,\n std::shared_ptr<std::basic_iostream<char>> istream,\n const std::string & mimeType) override\n {\n auto req = FileTransferRequest(cacheUri + \"\/\" + path);\n req.data = std::make_shared<string>(StreamToSourceAdapter(istream).drain());\n req.mimeType = mimeType;\n try {\n getFileTransfer()->upload(req);\n } catch (FileTransferError & e) {\n throw UploadToHTTP(\"while uploading to HTTP binary cache at '%s': %s\", cacheUri, e.msg());\n }\n }\n\n FileTransferRequest makeRequest(const std::string & path)\n {\n FileTransferRequest request(cacheUri + \"\/\" + path);\n return request;\n }\n\n void getFile(const std::string & path, Sink & sink) override\n {\n checkEnabled();\n auto request(makeRequest(path));\n try {\n getFileTransfer()->download(std::move(request), sink);\n } catch (FileTransferError & e) {\n if (e.error == FileTransfer::NotFound || e.error == FileTransfer::Forbidden)\n throw NoSuchBinaryCacheFile(\"file '%s' does not exist in binary cache '%s'\", path, getUri());\n maybeDisable();\n throw;\n }\n }\n\n void getFile(const std::string & path,\n Callback<std::shared_ptr<std::string>> callback) noexcept override\n {\n checkEnabled();\n\n auto request(makeRequest(path));\n\n auto callbackPtr = std::make_shared<decltype(callback)>(std::move(callback));\n\n getFileTransfer()->enqueueFileTransfer(request,\n {[callbackPtr, this](std::future<FileTransferResult> result) {\n try {\n (*callbackPtr)(result.get().data);\n } catch (FileTransferError & e) {\n if (e.error == FileTransfer::NotFound || e.error == FileTransfer::Forbidden)\n return (*callbackPtr)(std::shared_ptr<std::string>());\n maybeDisable();\n callbackPtr->rethrow();\n } catch (...) {\n callbackPtr->rethrow();\n }\n }});\n }\n\n};\n\nstatic RegisterStoreImplementation regStore([](\n const std::string & uri, const Store::Params & params)\n -> std::shared_ptr<Store>\n{\n static bool forceHttp = getEnv(\"_NIX_FORCE_HTTP\") == \"1\";\n if (std::string(uri, 0, 7) != \"http:\/\/\" &&\n std::string(uri, 0, 8) != \"https:\/\/\" &&\n (!forceHttp || std::string(uri, 0, 7) != \"file:\/\/\"))\n return 0;\n auto store = std::make_shared<HttpBinaryCacheStore>(params, uri);\n store->init();\n return store;\n});\n\n}\n<commit_msg>Allow HTTP binary cache to request absolute uris<commit_after>#include \"binary-cache-store.hh\"\n#include \"filetransfer.hh\"\n#include \"globals.hh\"\n#include \"nar-info-disk-cache.hh\"\n\nnamespace nix {\n\nMakeError(UploadToHTTP, Error);\n\nclass HttpBinaryCacheStore : public BinaryCacheStore\n{\nprivate:\n\n Path cacheUri;\n\n struct State\n {\n bool enabled = true;\n std::chrono::steady_clock::time_point disabledUntil;\n };\n\n Sync<State> _state;\n\npublic:\n\n HttpBinaryCacheStore(\n const Params & params, const Path & _cacheUri)\n : BinaryCacheStore(params)\n , cacheUri(_cacheUri)\n {\n if (cacheUri.back() == '\/')\n cacheUri.pop_back();\n\n diskCache = getNarInfoDiskCache();\n }\n\n std::string getUri() override\n {\n return cacheUri;\n }\n\n void init() override\n {\n \/\/ FIXME: do this lazily?\n if (auto cacheInfo = diskCache->cacheExists(cacheUri)) {\n wantMassQuery.setDefault(cacheInfo->wantMassQuery ? \"true\" : \"false\");\n priority.setDefault(fmt(\"%d\", cacheInfo->priority));\n } else {\n try {\n BinaryCacheStore::init();\n } catch (UploadToHTTP &) {\n throw Error(\"'%s' does not appear to be a binary cache\", cacheUri);\n }\n diskCache->createCache(cacheUri, storeDir, wantMassQuery, priority);\n }\n }\n\nprotected:\n\n void maybeDisable()\n {\n auto state(_state.lock());\n if (state->enabled && settings.tryFallback) {\n int t = 60;\n printError(\"disabling binary cache '%s' for %s seconds\", getUri(), t);\n state->enabled = false;\n state->disabledUntil = std::chrono::steady_clock::now() + std::chrono::seconds(t);\n }\n }\n\n void checkEnabled()\n {\n auto state(_state.lock());\n if (state->enabled) return;\n if (std::chrono::steady_clock::now() > state->disabledUntil) {\n state->enabled = true;\n debug(\"re-enabling binary cache '%s'\", getUri());\n return;\n }\n throw SubstituterDisabled(\"substituter '%s' is disabled\", getUri());\n }\n\n bool fileExists(const std::string & path) override\n {\n checkEnabled();\n\n try {\n FileTransferRequest request(makeRequest(path));\n request.head = true;\n getFileTransfer()->download(request);\n return true;\n } catch (FileTransferError & e) {\n \/* S3 buckets return 403 if a file doesn't exist and the\n bucket is unlistable, so treat 403 as 404. *\/\n if (e.error == FileTransfer::NotFound || e.error == FileTransfer::Forbidden)\n return false;\n maybeDisable();\n throw;\n }\n }\n\n void upsertFile(const std::string & path,\n std::shared_ptr<std::basic_iostream<char>> istream,\n const std::string & mimeType) override\n {\n auto req = makeRequest(path);\n req.data = std::make_shared<string>(StreamToSourceAdapter(istream).drain());\n req.mimeType = mimeType;\n try {\n getFileTransfer()->upload(req);\n } catch (FileTransferError & e) {\n throw UploadToHTTP(\"while uploading to HTTP binary cache at '%s': %s\", cacheUri, e.msg());\n }\n }\n\n FileTransferRequest makeRequest(const std::string & path)\n {\n return FileTransferRequest(\n hasPrefix(path, \"https:\/\/\") || hasPrefix(path, \"http:\/\/\") || hasPrefix(path, \"file:\/\/\")\n ? path\n : cacheUri + \"\/\" + path);\n\n }\n\n void getFile(const std::string & path, Sink & sink) override\n {\n checkEnabled();\n auto request(makeRequest(path));\n try {\n getFileTransfer()->download(std::move(request), sink);\n } catch (FileTransferError & e) {\n if (e.error == FileTransfer::NotFound || e.error == FileTransfer::Forbidden)\n throw NoSuchBinaryCacheFile(\"file '%s' does not exist in binary cache '%s'\", path, getUri());\n maybeDisable();\n throw;\n }\n }\n\n void getFile(const std::string & path,\n Callback<std::shared_ptr<std::string>> callback) noexcept override\n {\n checkEnabled();\n\n auto request(makeRequest(path));\n\n auto callbackPtr = std::make_shared<decltype(callback)>(std::move(callback));\n\n getFileTransfer()->enqueueFileTransfer(request,\n {[callbackPtr, this](std::future<FileTransferResult> result) {\n try {\n (*callbackPtr)(result.get().data);\n } catch (FileTransferError & e) {\n if (e.error == FileTransfer::NotFound || e.error == FileTransfer::Forbidden)\n return (*callbackPtr)(std::shared_ptr<std::string>());\n maybeDisable();\n callbackPtr->rethrow();\n } catch (...) {\n callbackPtr->rethrow();\n }\n }});\n }\n\n};\n\nstatic RegisterStoreImplementation regStore([](\n const std::string & uri, const Store::Params & params)\n -> std::shared_ptr<Store>\n{\n static bool forceHttp = getEnv(\"_NIX_FORCE_HTTP\") == \"1\";\n if (std::string(uri, 0, 7) != \"http:\/\/\" &&\n std::string(uri, 0, 8) != \"https:\/\/\" &&\n (!forceHttp || std::string(uri, 0, 7) != \"file:\/\/\"))\n return 0;\n auto store = std::make_shared<HttpBinaryCacheStore>(params, uri);\n store->init();\n return store;\n});\n\n}\n<|endoftext|>"} {"text":"<commit_before>\/\/\n\/\/ testing a subd idea\n\/\/\n\n#include <stdlib.h>\n#include <iostream>\n#include <cctype> \/\/ std::tolower\n#include <algorithm>\n#include <vector>\n\/\/ in project properties, add \"..\/include\" to the vc++ directories include path\n\n#include \"geometric.h\" \n#include \"glwin.h\" \/\/ minimal opengl for windows setup wrapper\n#include \"misc_gl.h\"\n#include \"wingmesh.h\"\n#include \"minixml.h\"\n\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\tgldraw(m.verts, m.GenerateTris());\n}\n\n\nstd::vector<std::string> split(std::string line, std::string delimeter=\" \")\n{\n\tstd::vector<std::string> tokens;\n\tsize_t pos = 0;\n\twhile ((pos = line.find(delimeter)) != std::string::npos)\n\t{\n\t\tauto token = line.substr(0, pos);\n\t\tline.erase(0, pos + delimeter.length());\n\t\tif (token.length())\n\t\t\ttokens.push_back(token);\n\t}\n\tif (line.length())\n\t\ttokens.push_back(line);\n\treturn tokens;\n}\n\nWingMesh WingMeshLoad(const char *filename)\n{\n\tWingMesh wm;\n\tstd::ifstream filein(filename);\n\tif (!filein.is_open())\n\t\tthrow \"unable to open file\";\n\tstd::string line;\n\twhile (std::getline(filein, line))\n\t{\n\t\tauto tokens = split(line);\n\t\tif (!tokens.size())\n\t\t\tcontinue;\n\t\tauto head = tokens.front(); \n\t\ttokens.erase(tokens.begin());\n\t\tif (head == \"v\")\n\t\t{\n\t\t\tline.erase(0, 1);\n\t\t\twm.verts.push_back(StringTo<float3>(line)*0.1f);\n\t\t\tcontinue;\n\t\t}\n\t\tif (head == \"f\")\n\t\t{\n\t\t\tstd::vector<int> vids;\n\t\t\tfor(auto &token:tokens)\n\t\t\t\tvids.push_back(StringTo<int>(split(token,\"\/\")[0]) - 1); \/\/ ugg obj index from one instead of zero\n\t\t\tint base = wm.edges.size();\n\t\t\tstd::vector<float3> fverts;\n\t\t\tfor (int i = 0; i < (int)vids.size(); i++)\n\t\t\t{\n\t\t\t\tint inext = (i + 1) % vids.size();\n\t\t\t\tint iprev = (i + vids.size()-1) % vids.size();\n\t\t\t\twm.edges.push_back(WingMesh::HalfEdge(base + i, vids[i], -1, base + inext, base + iprev, wm.faces.size()));\n\t\t\t\tfverts.push_back(wm.verts[vids[i]]);\n\t\t\t}\n\t\t\twm.faces.push_back(PolyPlane(fverts));\n\t\t\tcontinue;\n\t\t}\n\t}\n\twm.LinkMesh();\n\twm.InitBackLists();\n\treturn wm;\n}\n\nint main(int argc, char *argv[])\n{\n\tstd::cout << \"Test...\\n\";\n\tauto body = WingMeshLoad(\"EntireBody.obj\");\n\tauto body1 = WingMeshSubDiv(body);\n\tauto body2 = WingMeshSubDiv(body1);\n\n\t\/\/auto box = WingMeshSubDiv(WingMeshSubDiv(WingMeshCube(0.5f)));\n\n\tGLWin glwin(\"Test CatmullClark\");\n\tglwin.keyboardfunc = [](int key, int, int)\n\t{\n\t\t\tswitch (std::tolower(key))\n\t\t\t{\n\t\t\tcase ' ':\n\n\t\t\t\tbreak;\n\t\t\tcase 27: \/\/ ESC\n\t\t\tcase 'q':\n\t\t\t\texit(0);\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\n\t};\n\n\tfloat3 mousevec_prev;\n\tfloat4 model_orientation(0, 0, 0, 1);\n\twhile (glwin.WindowUp())\n\t{\n\t\tif (glwin.MouseState) \/\/ on mouse drag \n\t\t{\n\t\t\tmodel_orientation = qmul(VirtualTrackBall(float3(0, 0, 2), float3(0, 0, 0), mousevec_prev, glwin.MouseVector), model_orientation);\n\t\t}\n\t\tmousevec_prev = glwin.MouseVector;\n\n\n\n\t\tglPushAttrib(GL_ALL_ATTRIB_BITS);\n\n\t\t\/\/ Set up the viewport\n\t\tglViewport(0, 0, glwin.Width, glwin.Height);\n\t\tglClearColor(0.1f, 0.1f, 0.15f, 1);\n\t\tglClear(GL_COLOR_BUFFER_BIT | GL_DEPTH_BUFFER_BIT);\n\n\t\tglMatrixMode(GL_PROJECTION);\n\t\tglPushMatrix();\n\t\tglLoadIdentity();\n\t\tgluPerspective(glwin.ViewAngle, (double)glwin.Width \/ glwin.Height, 0.01, 10);\n\n\t\tglMatrixMode(GL_MODELVIEW);\n\t\tglPushMatrix();\n\t\tgluLookAt(0, 0, 2, 0, 0, 0, 0, 1, 0);\n\n\t\tfloat4x4 R = { { 1, 0, 0, 0 },{ 0, 1, 0, 0 },{ 0, 0, 1, 0 },{ 0, 0, 0, 1 } };\n\t\tR[0].xyz() = qxdir(model_orientation); R[1].xyz() = qydir(model_orientation); R[2].xyz() = qzdir(model_orientation);\n\t\tglMultMatrixf(R);\n\n\t\tglEnable(GL_DEPTH_TEST);\n\n\n\t\tglDisable(GL_BLEND);\n\n\t\tglColor3f(0, 1, 1);\n\t\tglEnable(GL_CULL_FACE);\n\t\t\/\/glEnable(GL_LIGHTING);\n\t\tglEnable(GL_LIGHT0);\n\t\twmwire(body2);\n\t\tglTranslatef(0.3f,0,0 );\n\t\twmwire(body1);\n\t\tglTranslatef( 0.3f,0,0);\n\t\twmwire(body );\n\n\n\n\t\t\/\/ Restore state\n\t\tglMatrixMode(GL_PROJECTION);\n\t\tglPopMatrix();\n\t\tglMatrixMode(GL_MODELVIEW);\n\t\tglPopMatrix(); \/\/should be currently in modelview mode\n\t\tglPopAttrib();\n\n\t\tglwin.PrintString({ 0, 0 }, \"Press ESC to quit.\");\n\n\t\tglwin.SwapBuffers();\n\t}\n\n\n\tstd::cout << \"\\n\";\n\treturn 0;\n}\n\n<commit_msg>using camera pose convention for view<commit_after>\/\/\n\/\/ testing a subd idea\n\/\/\n\n#include <stdlib.h>\n#include <iostream>\n#include <cctype> \/\/ std::tolower\n#include <algorithm>\n#include <vector>\n\/\/ in project properties, add \"..\/include\" to the vc++ directories include path\n\n#include \"geometric.h\" \n#include \"glwin.h\" \/\/ minimal opengl for windows setup wrapper\n#include \"misc_gl.h\"\n#include \"wingmesh.h\"\n#include \"minixml.h\"\n\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\tgldraw(m.verts, m.GenerateTris());\n}\n\n\nstd::vector<std::string> split(std::string line, std::string delimeter=\" \")\n{\n\tstd::vector<std::string> tokens;\n\tsize_t pos = 0;\n\twhile ((pos = line.find(delimeter)) != std::string::npos)\n\t{\n\t\tauto token = line.substr(0, pos);\n\t\tline.erase(0, pos + delimeter.length());\n\t\tif (token.length())\n\t\t\ttokens.push_back(token);\n\t}\n\tif (line.length())\n\t\ttokens.push_back(line);\n\treturn tokens;\n}\n\nWingMesh WingMeshLoad(const char *filename)\n{\n\tWingMesh wm;\n\tstd::ifstream filein(filename);\n\tif (!filein.is_open())\n\t\tthrow \"unable to open file\";\n\tstd::string line;\n\twhile (std::getline(filein, line))\n\t{\n\t\tauto tokens = split(line);\n\t\tif (!tokens.size())\n\t\t\tcontinue;\n\t\tauto head = tokens.front(); \n\t\ttokens.erase(tokens.begin());\n\t\tif (head == \"v\")\n\t\t{\n\t\t\tline.erase(0, 1);\n\t\t\twm.verts.push_back(StringTo<float3>(line)*0.1f);\n\t\t\tcontinue;\n\t\t}\n\t\tif (head == \"f\")\n\t\t{\n\t\t\tstd::vector<int> vids;\n\t\t\tfor(auto &token:tokens)\n\t\t\t\tvids.push_back(StringTo<int>(split(token,\"\/\")[0]) - 1); \/\/ ugg obj index from one instead of zero\n\t\t\tint base = wm.edges.size();\n\t\t\tstd::vector<float3> fverts;\n\t\t\tfor (int i = 0; i < (int)vids.size(); i++)\n\t\t\t{\n\t\t\t\tint inext = (i + 1) % vids.size();\n\t\t\t\tint iprev = (i + vids.size()-1) % vids.size();\n\t\t\t\twm.edges.push_back(WingMesh::HalfEdge(base + i, vids[i], -1, base + inext, base + iprev, wm.faces.size()));\n\t\t\t\tfverts.push_back(wm.verts[vids[i]]);\n\t\t\t}\n\t\t\twm.faces.push_back(PolyPlane(fverts));\n\t\t\tcontinue;\n\t\t}\n\t}\n\twm.LinkMesh();\n\twm.InitBackLists();\n\treturn wm;\n}\n\nint main(int argc, char *argv[])\n{\n\tstd::cout << \"Test...\\n\";\n\tauto body = WingMeshLoad(\"EntireBody.obj\");\n\tauto body1 = WingMeshSubDiv(body);\n\tauto body2 = WingMeshSubDiv(body1);\n\n\t\/\/auto box = WingMeshSubDiv(WingMeshSubDiv(WingMeshCube(0.5f)));\n\n\tGLWin glwin(\"Test CatmullClark\");\n\tglwin.keyboardfunc = [](int key, int, int)\n\t{\n\t\t\tswitch (std::tolower(key))\n\t\t\t{\n\t\t\tcase ' ':\n\n\t\t\t\tbreak;\n\t\t\tcase 27: \/\/ ESC\n\t\t\tcase 'q':\n\t\t\t\texit(0);\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\n\t};\n\n\tfloat3 mousevec_prev;\n\tfloat camdist = 2.0f;\n\tPose camera({ 0,0,camdist }, { 0, 0, 0, 1 });\n\twhile (glwin.WindowUp())\n\t{\n\t\tif (glwin.MouseState) \/\/ on mouse drag \n\t\t{\n\t\t\tcamera.orientation = qmul(camera.orientation,qconj(VirtualTrackBall(float3(0, 0, 2), float3(0, 0, 0), mousevec_prev, glwin.MouseVector)));\n\t\t\tcamera.position = qzdir(camera.orientation)*camdist;\n\t\t}\n\t\tmousevec_prev = glwin.MouseVector;\n\n\n\n\t\tglPushAttrib(GL_ALL_ATTRIB_BITS);\n\n\t\t\/\/ Set up the viewport\n\t\tglViewport(0, 0, glwin.Width, glwin.Height);\n\t\tglClearColor(0.1f, 0.1f, 0.15f, 1);\n\t\tglClear(GL_COLOR_BUFFER_BIT | GL_DEPTH_BUFFER_BIT);\n\n\t\tglMatrixMode(GL_PROJECTION);\n\t\tglPushMatrix();\n\t\tglLoadIdentity();\n\t\tgluPerspective(glwin.ViewAngle, (double)glwin.Width \/ glwin.Height, 0.01, 10);\n\n\t\tglMatrixMode(GL_MODELVIEW);\n\t\tglPushMatrix();\n\t\tglMultMatrixf(camera.inverse().matrix());\n\n\t\tglEnable(GL_DEPTH_TEST);\n\n\n\t\tglDisable(GL_BLEND);\n\n\t\tglColor3f(0, 1, 1);\n\t\tglEnable(GL_CULL_FACE);\n\t\t\/\/glEnable(GL_LIGHTING);\n\t\tglEnable(GL_LIGHT0);\n\t\twmwire(body );\n\t\tglTranslatef(0.3f,0,0 );\n\t\twmwire(body1);\n\t\tglTranslatef( 0.3f,0,0);\n\t\twmwire(body2);\n\n\n\n\t\t\/\/ Restore state\n\t\tglMatrixMode(GL_PROJECTION);\n\t\tglPopMatrix();\n\t\tglMatrixMode(GL_MODELVIEW);\n\t\tglPopMatrix(); \/\/should be currently in modelview mode\n\t\tglPopAttrib();\n\n\t\tglwin.PrintString({ 0, 0 }, \"Press ESC to quit.\");\n\n\t\tglwin.SwapBuffers();\n\t}\n\n\n\tstd::cout << \"\\n\";\n\treturn 0;\n}\n\n<|endoftext|>"} {"text":"<commit_before>\/*\n* SIV Mode Encryption\n* (C) 2013,2017 Jack Lloyd\n* (C) 2016 Daniel Neus, Rohde & Schwarz Cybersecurity\n*\n* Botan is released under the Simplified BSD License (see license.txt)\n*\/\n\n#include <botan\/siv.h>\n#include <botan\/block_cipher.h>\n#include <botan\/cmac.h>\n#include <botan\/internal\/poly_dbl.h>\n#include <botan\/ctr.h>\n\nnamespace Botan {\n\nSIV_Mode::SIV_Mode(BlockCipher* cipher) :\n m_name(cipher->name() + \"\/SIV\"),\n m_ctr(new CTR_BE(cipher->clone())),\n m_mac(new CMAC(cipher)),\n m_bs(cipher->block_size())\n {\n if(cipher->block_size() != 16)\n throw Invalid_Argument(\"SIV requires a 128 bit block cipher\");\n }\n\nSIV_Mode::~SIV_Mode()\n {\n \/\/ for ~unique_ptr\n }\n\nvoid SIV_Mode::clear()\n {\n m_ctr->clear();\n m_mac->clear();\n reset();\n }\n\nvoid SIV_Mode::reset()\n {\n m_nonce.clear();\n m_msg_buf.clear();\n m_ad_macs.clear();\n }\n\nstd::string SIV_Mode::name() const\n {\n return m_name;\n }\n\nbool SIV_Mode::valid_nonce_length(size_t) const\n {\n return true;\n }\n\nsize_t SIV_Mode::update_granularity() const\n {\n \/*\n This value does not particularly matter as regardless SIV_Mode::update\n buffers all input, so in theory this could be 1. However as for instance\n Transform_Filter creates update_granularity() uint8_t buffers, use a\n somewhat large size to avoid bouncing on a tiny buffer.\n *\/\n return 128;\n }\n\nKey_Length_Specification SIV_Mode::key_spec() const\n {\n return m_mac->key_spec().multiple(2);\n }\n\nvoid SIV_Mode::key_schedule(const uint8_t key[], size_t length)\n {\n const size_t keylen = length \/ 2;\n m_mac->set_key(key, keylen);\n m_ctr->set_key(key + keylen, keylen);\n m_ad_macs.clear();\n }\n\nvoid SIV_Mode::set_associated_data_n(size_t n, const uint8_t ad[], size_t length)\n {\n const size_t max_ads = block_size() * 8 - 2;\n if(n > max_ads)\n throw Invalid_Argument(name() + \" allows no more than \" + std::to_string(max_ads) + \" ADs\");\n\n if(n >= m_ad_macs.size())\n m_ad_macs.resize(n+1);\n\n m_ad_macs[n] = m_mac->process(ad, length);\n }\n\nvoid SIV_Mode::start_msg(const uint8_t nonce[], size_t nonce_len)\n {\n if(!valid_nonce_length(nonce_len))\n throw Invalid_IV_Length(name(), nonce_len);\n\n if(nonce_len)\n m_nonce = m_mac->process(nonce, nonce_len);\n else\n m_nonce.clear();\n\n m_msg_buf.clear();\n }\n\nsize_t SIV_Mode::process(uint8_t buf[], size_t sz)\n {\n \/\/ all output is saved for processing in finish\n m_msg_buf.insert(m_msg_buf.end(), buf, buf + sz);\n return 0;\n }\n\nsecure_vector<uint8_t> SIV_Mode::S2V(const uint8_t* text, size_t text_len)\n {\n const std::vector<uint8_t> zeros(block_size());\n\n secure_vector<uint8_t> V = m_mac->process(zeros.data(), zeros.size());\n\n for(size_t i = 0; i != m_ad_macs.size(); ++i)\n {\n poly_double_n(V.data(), V.size());\n V ^= m_ad_macs[i];\n }\n\n if(m_nonce.size())\n {\n poly_double_n(V.data(), V.size());\n V ^= m_nonce;\n }\n\n if(text_len < block_size())\n {\n poly_double_n(V.data(), V.size());\n xor_buf(V.data(), text, text_len);\n V[text_len] ^= 0x80;\n return m_mac->process(V);\n }\n\n m_mac->update(text, text_len - block_size());\n xor_buf(V.data(), &text[text_len - block_size()], block_size());\n m_mac->update(V);\n\n return m_mac->final();\n }\n\nvoid SIV_Mode::set_ctr_iv(secure_vector<uint8_t> V)\n {\n V[m_bs-8] &= 0x7F;\n V[m_bs-4] &= 0x7F;\n\n ctr().set_iv(V.data(), V.size());\n }\n\nvoid SIV_Encryption::finish(secure_vector<uint8_t>& buffer, size_t offset)\n {\n BOTAN_ASSERT(buffer.size() >= offset, \"Offset is sane\");\n\n buffer.insert(buffer.begin() + offset, msg_buf().begin(), msg_buf().end());\n msg_buf().clear();\n\n const secure_vector<uint8_t> V = S2V(buffer.data() + offset, buffer.size() - offset);\n\n buffer.insert(buffer.begin() + offset, V.begin(), V.end());\n\n if(buffer.size() != offset + V.size())\n {\n set_ctr_iv(V);\n ctr().cipher1(&buffer[offset + V.size()], buffer.size() - offset - V.size());\n }\n }\n\nvoid SIV_Decryption::finish(secure_vector<uint8_t>& buffer, size_t offset)\n {\n BOTAN_ASSERT(buffer.size() >= offset, \"Offset is sane\");\n\n buffer.insert(buffer.begin() + offset, msg_buf().begin(), msg_buf().end());\n msg_buf().clear();\n\n const size_t sz = buffer.size() - offset;\n\n BOTAN_ASSERT(sz >= tag_size(), \"We have the tag\");\n\n secure_vector<uint8_t> V(buffer.data() + offset,\n buffer.data() + offset + block_size());\n\n if(buffer.size() != offset + V.size())\n {\n set_ctr_iv(V);\n\n ctr().cipher(buffer.data() + offset + V.size(),\n buffer.data() + offset,\n buffer.size() - offset - V.size());\n }\n\n const secure_vector<uint8_t> T = S2V(buffer.data() + offset, buffer.size() - offset - V.size());\n\n if(!constant_time_compare(T.data(), V.data(), T.size()))\n throw Integrity_Failure(\"SIV tag check failed\");\n\n buffer.resize(buffer.size() - tag_size());\n }\n\n}\n<commit_msg>Helpful comment<commit_after>\/*\n* SIV Mode Encryption\n* (C) 2013,2017 Jack Lloyd\n* (C) 2016 Daniel Neus, Rohde & Schwarz Cybersecurity\n*\n* Botan is released under the Simplified BSD License (see license.txt)\n*\/\n\n#include <botan\/siv.h>\n#include <botan\/block_cipher.h>\n#include <botan\/cmac.h>\n#include <botan\/internal\/poly_dbl.h>\n#include <botan\/ctr.h>\n\nnamespace Botan {\n\nSIV_Mode::SIV_Mode(BlockCipher* cipher) :\n m_name(cipher->name() + \"\/SIV\"),\n m_ctr(new CTR_BE(cipher->clone())),\n m_mac(new CMAC(cipher)),\n m_bs(cipher->block_size())\n {\n \/\/ Not really true but only 128 bit allowed at the moment\n if(m_bs != 16)\n throw Invalid_Argument(\"SIV requires a 128 bit block cipher\");\n }\n\nSIV_Mode::~SIV_Mode()\n {\n \/\/ for ~unique_ptr\n }\n\nvoid SIV_Mode::clear()\n {\n m_ctr->clear();\n m_mac->clear();\n reset();\n }\n\nvoid SIV_Mode::reset()\n {\n m_nonce.clear();\n m_msg_buf.clear();\n m_ad_macs.clear();\n }\n\nstd::string SIV_Mode::name() const\n {\n return m_name;\n }\n\nbool SIV_Mode::valid_nonce_length(size_t) const\n {\n return true;\n }\n\nsize_t SIV_Mode::update_granularity() const\n {\n \/*\n This value does not particularly matter as regardless SIV_Mode::update\n buffers all input, so in theory this could be 1. However as for instance\n Transform_Filter creates update_granularity() uint8_t buffers, use a\n somewhat large size to avoid bouncing on a tiny buffer.\n *\/\n return 128;\n }\n\nKey_Length_Specification SIV_Mode::key_spec() const\n {\n return m_mac->key_spec().multiple(2);\n }\n\nvoid SIV_Mode::key_schedule(const uint8_t key[], size_t length)\n {\n const size_t keylen = length \/ 2;\n m_mac->set_key(key, keylen);\n m_ctr->set_key(key + keylen, keylen);\n m_ad_macs.clear();\n }\n\nvoid SIV_Mode::set_associated_data_n(size_t n, const uint8_t ad[], size_t length)\n {\n const size_t max_ads = block_size() * 8 - 2;\n if(n > max_ads)\n throw Invalid_Argument(name() + \" allows no more than \" + std::to_string(max_ads) + \" ADs\");\n\n if(n >= m_ad_macs.size())\n m_ad_macs.resize(n+1);\n\n m_ad_macs[n] = m_mac->process(ad, length);\n }\n\nvoid SIV_Mode::start_msg(const uint8_t nonce[], size_t nonce_len)\n {\n if(!valid_nonce_length(nonce_len))\n throw Invalid_IV_Length(name(), nonce_len);\n\n if(nonce_len)\n m_nonce = m_mac->process(nonce, nonce_len);\n else\n m_nonce.clear();\n\n m_msg_buf.clear();\n }\n\nsize_t SIV_Mode::process(uint8_t buf[], size_t sz)\n {\n \/\/ all output is saved for processing in finish\n m_msg_buf.insert(m_msg_buf.end(), buf, buf + sz);\n return 0;\n }\n\nsecure_vector<uint8_t> SIV_Mode::S2V(const uint8_t* text, size_t text_len)\n {\n const std::vector<uint8_t> zeros(block_size());\n\n secure_vector<uint8_t> V = m_mac->process(zeros.data(), zeros.size());\n\n for(size_t i = 0; i != m_ad_macs.size(); ++i)\n {\n poly_double_n(V.data(), V.size());\n V ^= m_ad_macs[i];\n }\n\n if(m_nonce.size())\n {\n poly_double_n(V.data(), V.size());\n V ^= m_nonce;\n }\n\n if(text_len < block_size())\n {\n poly_double_n(V.data(), V.size());\n xor_buf(V.data(), text, text_len);\n V[text_len] ^= 0x80;\n return m_mac->process(V);\n }\n\n m_mac->update(text, text_len - block_size());\n xor_buf(V.data(), &text[text_len - block_size()], block_size());\n m_mac->update(V);\n\n return m_mac->final();\n }\n\nvoid SIV_Mode::set_ctr_iv(secure_vector<uint8_t> V)\n {\n V[m_bs-8] &= 0x7F;\n V[m_bs-4] &= 0x7F;\n\n ctr().set_iv(V.data(), V.size());\n }\n\nvoid SIV_Encryption::finish(secure_vector<uint8_t>& buffer, size_t offset)\n {\n BOTAN_ASSERT(buffer.size() >= offset, \"Offset is sane\");\n\n buffer.insert(buffer.begin() + offset, msg_buf().begin(), msg_buf().end());\n msg_buf().clear();\n\n const secure_vector<uint8_t> V = S2V(buffer.data() + offset, buffer.size() - offset);\n\n buffer.insert(buffer.begin() + offset, V.begin(), V.end());\n\n if(buffer.size() != offset + V.size())\n {\n set_ctr_iv(V);\n ctr().cipher1(&buffer[offset + V.size()], buffer.size() - offset - V.size());\n }\n }\n\nvoid SIV_Decryption::finish(secure_vector<uint8_t>& buffer, size_t offset)\n {\n BOTAN_ASSERT(buffer.size() >= offset, \"Offset is sane\");\n\n buffer.insert(buffer.begin() + offset, msg_buf().begin(), msg_buf().end());\n msg_buf().clear();\n\n const size_t sz = buffer.size() - offset;\n\n BOTAN_ASSERT(sz >= tag_size(), \"We have the tag\");\n\n secure_vector<uint8_t> V(buffer.data() + offset,\n buffer.data() + offset + block_size());\n\n if(buffer.size() != offset + V.size())\n {\n set_ctr_iv(V);\n\n ctr().cipher(buffer.data() + offset + V.size(),\n buffer.data() + offset,\n buffer.size() - offset - V.size());\n }\n\n const secure_vector<uint8_t> T = S2V(buffer.data() + offset, buffer.size() - offset - V.size());\n\n if(!constant_time_compare(T.data(), V.data(), T.size()))\n throw Integrity_Failure(\"SIV tag check failed\");\n\n buffer.resize(buffer.size() - tag_size());\n }\n\n}\n<|endoftext|>"} {"text":"<commit_before>#if 1\n\n#include <osgDB\/ReadFile>\n#include <osgViewer\/Viewer>\n#include <osgGA\/TrackballManipulator>\n#include <osgGA\/AnimationPathManipulator>\n#include <iostream>\n\nvoid singleWindowMultipleCameras(osgViewer::Viewer& viewer)\n{\n osg::GraphicsContext::WindowingSystemInterface* wsi = osg::GraphicsContext::getWindowingSystemInterface();\n if (!wsi) \n {\n osg::notify(osg::NOTICE)<<\"View::setUpViewAcrossAllScreens() : Error, no WindowSystemInterface available, cannot create windows.\"<<std::endl;\n return;\n }\n \n unsigned int width, height;\n wsi->getScreenResolution(osg::GraphicsContext::ScreenIdentifier(0), width, height);\n\n osg::ref_ptr<osg::GraphicsContext::Traits> traits = new osg::GraphicsContext::Traits;\n traits->x = 0;\n traits->y = 0;\n traits->width = width;\n traits->height = height;\n#if 0\n traits->windowDecoration = false;\n#else\n traits->windowDecoration = true;\n#endif \n traits->doubleBuffer = true;\n traits->sharedContext = 0;\n\n osg::ref_ptr<osg::GraphicsContext> gc = osg::GraphicsContext::createGraphicsContext(traits.get());\n\n osgViewer::GraphicsWindow* gw = dynamic_cast<osgViewer::GraphicsWindow*>(gc.get());\n if (gw)\n {\n osg::notify(osg::INFO)<<\" GraphicsWindow has been created successfully.\"<<gw<<std::endl;\n\n gw->getEventQueue()->getCurrentEventState()->setWindowRectangle(0, 0, width, height );\n }\n else\n {\n osg::notify(osg::NOTICE)<<\" GraphicsWindow has not been created successfully.\"<<std::endl;\n }\n\n unsigned int numCameras = 2;\n double aspectRatioScale = 1.0;\/\/\/(double)numCameras;\n for(unsigned int i=0; i<numCameras;++i)\n {\n osg::ref_ptr<osg::Camera> camera = new osg::Camera;\n camera->setGraphicsContext(gc.get());\n camera->setViewport(new osg::Viewport((i*width)\/numCameras,(i*height)\/numCameras, width\/numCameras, height\/numCameras));\n GLenum buffer = traits->doubleBuffer ? GL_BACK : GL_FRONT;\n camera->setDrawBuffer(buffer);\n camera->setReadBuffer(buffer);\n\n viewer.addSlave(camera.get(), osg::Matrixd(), osg::Matrixd::scale(aspectRatioScale,1.0,1.0));\n }\n}\n\nvoid multipleWindowMultipleCameras(osgViewer::Viewer& viewer)\n{\n osg::GraphicsContext::WindowingSystemInterface* wsi = osg::GraphicsContext::getWindowingSystemInterface();\n if (!wsi) \n {\n osg::notify(osg::NOTICE)<<\"View::setUpViewAcrossAllScreens() : Error, no WindowSystemInterface available, cannot create windows.\"<<std::endl;\n return;\n }\n \n unsigned int width, height;\n wsi->getScreenResolution(osg::GraphicsContext::ScreenIdentifier(0), width, height);\n\n\n unsigned int numCameras = 4;\n double aspectRatioScale = (double)numCameras;\n double translate_x = double(numCameras)-1;\n for(unsigned int i=0; i<numCameras;++i, translate_x -= 2.0)\n {\n osg::ref_ptr<osg::GraphicsContext::Traits> traits = new osg::GraphicsContext::Traits;\n traits->screenNum = i \/ 2;\n traits->x = (i*width)\/numCameras;\n traits->y = 0;\n traits->width = width\/numCameras-1;\n traits->height = height;\n #if 0\n traits->windowDecoration = false;\n #else\n traits->windowDecoration = true;\n #endif \n traits->doubleBuffer = true;\n traits->sharedContext = 0;\n\n osg::ref_ptr<osg::GraphicsContext> gc = osg::GraphicsContext::createGraphicsContext(traits.get());\n\n osgViewer::GraphicsWindow* gw = dynamic_cast<osgViewer::GraphicsWindow*>(gc.get());\n if (gw)\n {\n osg::notify(osg::INFO)<<\" GraphicsWindow has been created successfully.\"<<gw<<std::endl;\n\n gw->getEventQueue()->getCurrentEventState()->setWindowRectangle(0, 0, traits->width, traits->height );\n }\n else\n {\n osg::notify(osg::NOTICE)<<\" GraphicsWindow has not been created successfully.\"<<std::endl;\n }\n\n osg::ref_ptr<osg::Camera> camera = new osg::Camera;\n camera->setGraphicsContext(gc.get());\n camera->setViewport(new osg::Viewport(0,0, width\/numCameras, height));\n GLenum buffer = traits->doubleBuffer ? GL_BACK : GL_FRONT;\n camera->setDrawBuffer(buffer);\n camera->setReadBuffer(buffer);\n\n viewer.addSlave(camera.get(), osg::Matrix::scale(aspectRatioScale, 1.0, 1.0)*osg::Matrix::translate(translate_x, 0.0, 0.0), osg::Matrix() );\n }\n}\n\nint main( int argc, char **argv )\n{\n \/\/ use an ArgumentParser object to manage the program arguments.\n osg::ArgumentParser arguments(&argc,argv);\n\n if (argc<2) \n {\n std::cout << argv[0] <<\": requires filename argument.\" << std::endl;\n return 1;\n }\n\n\n std::string pathfile;\n osg::ref_ptr<osgGA::AnimationPathManipulator> apm = 0;\n while (arguments.read(\"-p\",pathfile))\n {\n apm = new osgGA::AnimationPathManipulator(pathfile);\n if(!apm.valid() || !(apm->valid()) ) \n {\n apm = 0;\n }\n }\n\n osgViewer::Viewer viewer;\n \n while (arguments.read(\"-s\")) { viewer.setThreadingModel(osgViewer::Viewer::SingleThreaded); }\n while (arguments.read(\"-g\")) { viewer.setThreadingModel(osgViewer::Viewer::ThreadPerContext); }\n while (arguments.read(\"-c\")) { viewer.setThreadingModel(osgViewer::Viewer::ThreadPerCamera); }\n \n bool limitNumberOfFrames = false;\n unsigned int maxFrames = 10;\n while (arguments.read(\"--run-till-frame-number\",maxFrames)) { limitNumberOfFrames = true; }\n\n \/\/ alternative viewer window setups.\n while (arguments.read(\"-1\")) { singleWindowMultipleCameras(viewer); }\n while (arguments.read(\"-2\")) { multipleWindowMultipleCameras(viewer); }\n\n\n if (apm.valid()) viewer.setCameraManipulator(apm.get());\n else viewer.setCameraManipulator( new osgGA::TrackballManipulator() );\n\n \/\/ load the scene.\n osg::ref_ptr<osg::Node> loadedModel = osgDB::readNodeFiles(arguments);\n if (!loadedModel) \n {\n std::cout << argv[0] <<\": No data loaded.\" << std::endl;\n return 1;\n }\n\n viewer.setSceneData(loadedModel.get());\n\n \/\/ viewer.realize();\n\n unsigned int numFrames = 0;\n while(!viewer.done() && !(limitNumberOfFrames && numFrames>=maxFrames))\n {\n viewer.frame();\n ++numFrames;\n }\n\n return 0;\n}\n#else\n\n#include <osgViewer\/Viewer>\n#include <osgDB\/ReadFile>\n\nint main( int, char **)\n{\n osgViewer::Viewer viewer;\n viewer.setSceneData(osgDB::readNodeFile(\"cow.osg\"));\n viewer.run();\n}\n#endif\n<commit_msg>Cleaned up graphics window setup and added clear graphics window to single window, multiple camera setup.<commit_after>#if 1\n\n#include <osgDB\/ReadFile>\n#include <osgViewer\/Viewer>\n#include <osgGA\/TrackballManipulator>\n#include <osgGA\/AnimationPathManipulator>\n#include <iostream>\n\nvoid singleWindowMultipleCameras(osgViewer::Viewer& viewer)\n{\n osg::GraphicsContext::WindowingSystemInterface* wsi = osg::GraphicsContext::getWindowingSystemInterface();\n if (!wsi) \n {\n osg::notify(osg::NOTICE)<<\"View::setUpViewAcrossAllScreens() : Error, no WindowSystemInterface available, cannot create windows.\"<<std::endl;\n return;\n }\n \n unsigned int width, height;\n wsi->getScreenResolution(osg::GraphicsContext::ScreenIdentifier(0), width, height);\n\n osg::ref_ptr<osg::GraphicsContext::Traits> traits = new osg::GraphicsContext::Traits;\n traits->x = 0;\n traits->y = 0;\n traits->width = width;\n traits->height = height;\n traits->windowDecoration = true;\n traits->doubleBuffer = true;\n traits->sharedContext = 0;\n\n osg::ref_ptr<osg::GraphicsContext> gc = osg::GraphicsContext::createGraphicsContext(traits.get());\n if (gc.valid())\n {\n osg::notify(osg::INFO)<<\" GraphicsWindow has been created successfully.\"<<std::endl;\n\n \/\/ need to ensure that the window is cleared make sure that the complete window is set the correct colour\n \/\/ rather than just the parts of the window that are under the camera's viewports\n gc->setClearColor(osg::Vec4f(0.2f,0.2f,0.6f,1.0f));\n gc->setClearMask(GL_COLOR_BUFFER_BIT | GL_DEPTH_BUFFER_BIT);\n }\n else\n {\n osg::notify(osg::NOTICE)<<\" GraphicsWindow has not been created successfully.\"<<std::endl;\n }\n\n unsigned int numCameras = 2;\n double aspectRatioScale = 1.0;\/\/\/(double)numCameras;\n for(unsigned int i=0; i<numCameras;++i)\n {\n osg::ref_ptr<osg::Camera> camera = new osg::Camera;\n camera->setGraphicsContext(gc.get());\n camera->setViewport(new osg::Viewport((i*width)\/numCameras,(i*height)\/numCameras, width\/numCameras, height\/numCameras));\n GLenum buffer = traits->doubleBuffer ? GL_BACK : GL_FRONT;\n camera->setDrawBuffer(buffer);\n camera->setReadBuffer(buffer);\n\n viewer.addSlave(camera.get(), osg::Matrixd(), osg::Matrixd::scale(aspectRatioScale,1.0,1.0));\n }\n}\n\nvoid multipleWindowMultipleCameras(osgViewer::Viewer& viewer)\n{\n osg::GraphicsContext::WindowingSystemInterface* wsi = osg::GraphicsContext::getWindowingSystemInterface();\n if (!wsi) \n {\n osg::notify(osg::NOTICE)<<\"View::setUpViewAcrossAllScreens() : Error, no WindowSystemInterface available, cannot create windows.\"<<std::endl;\n return;\n }\n \n unsigned int width, height;\n wsi->getScreenResolution(osg::GraphicsContext::ScreenIdentifier(0), width, height);\n\n\n unsigned int numCameras = 4;\n double aspectRatioScale = (double)numCameras;\n double translate_x = double(numCameras)-1;\n for(unsigned int i=0; i<numCameras;++i, translate_x -= 2.0)\n {\n osg::ref_ptr<osg::GraphicsContext::Traits> traits = new osg::GraphicsContext::Traits;\n traits->screenNum = i \/ 2;\n traits->x = (i*width)\/numCameras;\n traits->y = 0;\n traits->width = width\/numCameras-1;\n traits->height = height;\n traits->windowDecoration = true;\n traits->doubleBuffer = true;\n traits->sharedContext = 0;\n\n osg::ref_ptr<osg::GraphicsContext> gc = osg::GraphicsContext::createGraphicsContext(traits.get());\n if (gc.valid())\n {\n osg::notify(osg::INFO)<<\" GraphicsWindow has been created successfully.\"<<std::endl;\n }\n else\n {\n osg::notify(osg::NOTICE)<<\" GraphicsWindow has not been created successfully.\"<<std::endl;\n }\n\n osg::ref_ptr<osg::Camera> camera = new osg::Camera;\n camera->setGraphicsContext(gc.get());\n camera->setViewport(new osg::Viewport(0,0, width\/numCameras, height));\n GLenum buffer = traits->doubleBuffer ? GL_BACK : GL_FRONT;\n camera->setDrawBuffer(buffer);\n camera->setReadBuffer(buffer);\n\n viewer.addSlave(camera.get(), osg::Matrix::scale(aspectRatioScale, 1.0, 1.0)*osg::Matrix::translate(translate_x, 0.0, 0.0), osg::Matrix() );\n }\n}\n\nint main( int argc, char **argv )\n{\n \/\/ use an ArgumentParser object to manage the program arguments.\n osg::ArgumentParser arguments(&argc,argv);\n\n if (argc<2) \n {\n std::cout << argv[0] <<\": requires filename argument.\" << std::endl;\n return 1;\n }\n\n\n std::string pathfile;\n osg::ref_ptr<osgGA::AnimationPathManipulator> apm = 0;\n while (arguments.read(\"-p\",pathfile))\n {\n apm = new osgGA::AnimationPathManipulator(pathfile);\n if(!apm.valid() || !(apm->valid()) ) \n {\n apm = 0;\n }\n }\n\n osgViewer::Viewer viewer;\n \n while (arguments.read(\"-s\")) { viewer.setThreadingModel(osgViewer::Viewer::SingleThreaded); }\n while (arguments.read(\"-g\")) { viewer.setThreadingModel(osgViewer::Viewer::ThreadPerContext); }\n while (arguments.read(\"-c\")) { viewer.setThreadingModel(osgViewer::Viewer::ThreadPerCamera); }\n \n bool limitNumberOfFrames = false;\n unsigned int maxFrames = 10;\n while (arguments.read(\"--run-till-frame-number\",maxFrames)) { limitNumberOfFrames = true; }\n\n \/\/ alternative viewer window setups.\n while (arguments.read(\"-1\")) { singleWindowMultipleCameras(viewer); }\n while (arguments.read(\"-2\")) { multipleWindowMultipleCameras(viewer); }\n\n\n if (apm.valid()) viewer.setCameraManipulator(apm.get());\n else viewer.setCameraManipulator( new osgGA::TrackballManipulator() );\n\n \/\/ load the scene.\n osg::ref_ptr<osg::Node> loadedModel = osgDB::readNodeFiles(arguments);\n if (!loadedModel) \n {\n std::cout << argv[0] <<\": No data loaded.\" << std::endl;\n return 1;\n }\n\n viewer.setSceneData(loadedModel.get());\n\n \/\/ viewer.realize();\n\n unsigned int numFrames = 0;\n while(!viewer.done() && !(limitNumberOfFrames && numFrames>=maxFrames))\n {\n viewer.frame();\n ++numFrames;\n }\n\n return 0;\n}\n#else\n\n#include <osgViewer\/Viewer>\n#include <osgDB\/ReadFile>\n\nint main( int, char **)\n{\n osgViewer::Viewer viewer;\n viewer.setSceneData(osgDB::readNodeFile(\"cow.osg\"));\n viewer.run();\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: namedvaluecollection.hxx,v $\n * $Revision: 1.11.20.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\n#ifndef COMPHELPER_NAMEDVALUECOLLECTION_HXX\n#define COMPHELPER_NAMEDVALUECOLLECTION_HXX\n\n#include <comphelper\/comphelperdllapi.h>\n\n\/** === begin UNO includes === **\/\n#include <com\/sun\/star\/uno\/Sequence.hxx>\n#include <com\/sun\/star\/uno\/Any.hxx>\n#include <com\/sun\/star\/beans\/PropertyValue.hpp>\n#include <com\/sun\/star\/beans\/NamedValue.hpp>\n\/** === end UNO includes === **\/\n\n#include <memory>\n#include <algorithm>\n\n\/\/........................................................................\nnamespace comphelper\n{\n\/\/........................................................................\n\n \/\/ ====================================================================\n \/\/ = NamedValueCollection\n \/\/ ====================================================================\n struct NamedValueCollection_Impl;\n \/** a collection of named values, packed in various formats.\n *\/\n class COMPHELPER_DLLPUBLIC NamedValueCollection\n {\n private:\n ::std::auto_ptr< NamedValueCollection_Impl > m_pImpl;\n\n public:\n NamedValueCollection();\n\n NamedValueCollection( const NamedValueCollection& _rCopySource );\n\n NamedValueCollection& operator=( const NamedValueCollection& i_rCopySource );\n\n \/** constructs a collection\n @param _rElements\n the wrapped elements of the collection. The <code>Any<\/code> might contain a sequence of\n property values, a sequence of named values, or directly a property value or named value.\n All other cases are worth an assertion in non-product builds.\n *\/\n NamedValueCollection( const ::com::sun::star::uno::Any& _rElements );\n\n \/** constructs a collection\n @param _rArguments\n a sequence of Any's containing either PropertyValue's or NamedValue's.\n *\/\n NamedValueCollection( const ::com::sun::star::uno::Sequence< ::com::sun::star::uno::Any >& _rArguments );\n\n \/** constructs a collection\n @param _rArguments\n a sequence of PropertyValues's\n *\/\n NamedValueCollection( const ::com::sun::star::uno::Sequence< ::com::sun::star::beans::PropertyValue >& _rArguments );\n\n \/** constructs a collection\n @param _rArguments\n a sequence of NamedValue's\n *\/\n NamedValueCollection( const ::com::sun::star::uno::Sequence< ::com::sun::star::beans::NamedValue >& _rArguments );\n\n ~NamedValueCollection();\n\n inline void assign( const ::com::sun::star::uno::Sequence< ::com::sun::star::uno::Any >& _rArguments )\n {\n impl_assign( _rArguments );\n }\n\n inline void assign( const ::com::sun::star::uno::Sequence< ::com::sun::star::beans::PropertyValue >& _rArguments )\n {\n impl_assign( _rArguments );\n }\n\n inline void assign( const ::com::sun::star::uno::Sequence< ::com::sun::star::beans::NamedValue >& _rArguments )\n {\n impl_assign( _rArguments );\n }\n\n \/\/\/ returns the number of elements in the collection\n size_t size() const;\n\n \/\/\/ determines whether the collection is empty\n bool empty() const;\n\n \/** merges the content of another collection into |this|\n @param _rAdditionalValues\n the collection whose values are to be merged\n @param _bOverwriteExisting\n defines whether or not elements which are already present in |this|\n should be overwritten (<TRUE\/>) or preserved (<FALSE\/>).\n @return |*this|\n *\/\n NamedValueCollection&\n merge(\n const NamedValueCollection& _rAdditionalValues,\n bool _bOverwriteExisting\n );\n\n \/** retrieves a value with a given name from the collection, if it is present\n\n @param _pAsciiValueName\n the ASCII name of the value to retrieve\n\n @param _out_rValue\n is the output parameter taking the desired value upon successful return. If\n a value with the given name is not present in the collection, or if a wrong-typed\n value is present, then this parameter will not be touched.\n\n @return\n <TRUE\/> if there is a value with the given name, which could successfully\n be extraced. In this case, <arg>_out_rValue<\/arg> will contain the requested\n value.<br\/>\n <FALSE\/>, if there is no value with the given name.\n @throws IllegalArgumentException\n in case there is a value with the given name, but it cannot legally assigned to\n _out_rValue.\n *\/\n template < typename VALUE_TYPE >\n bool get_ensureType( const sal_Char* _pAsciiValueName, VALUE_TYPE& _out_rValue ) const\n {\n return get_ensureType( ::rtl::OUString::createFromAscii( _pAsciiValueName ), &_out_rValue, ::cppu::UnoType< VALUE_TYPE >::get() );\n }\n\n template < typename VALUE_TYPE >\n bool get_ensureType( const ::rtl::OUString& _rValueName, VALUE_TYPE& _out_rValue ) const\n {\n return get_ensureType( _rValueName, &_out_rValue, ::cppu::UnoType< VALUE_TYPE >::get() );\n }\n\n \/** retrieves a value with a given name, or defaults it to a given value, if its not present\n in the colllection\n *\/\n template < typename VALUE_TYPE >\n VALUE_TYPE getOrDefault( const sal_Char* _pAsciiValueName, const VALUE_TYPE& _rDefault ) const\n {\n return getOrDefault( ::rtl::OUString::createFromAscii( _pAsciiValueName ), _rDefault );\n }\n\n template < typename VALUE_TYPE >\n VALUE_TYPE getOrDefault( const ::rtl::OUString& _rValueName, const VALUE_TYPE& _rDefault ) const\n {\n VALUE_TYPE retVal( _rDefault );\n get_ensureType( _rValueName, retVal );\n return retVal;\n }\n\n \/** retrieves a (untyped) value with a given name\n\n If the collection does not contain a value with the given name, an empty\n Any is returned.\n *\/\n const ::com::sun::star::uno::Any& get( const sal_Char* _pAsciiValueName ) const\n {\n return get( ::rtl::OUString::createFromAscii( _pAsciiValueName ) );\n }\n\n \/** retrieves a (untyped) value with a given name\n\n If the collection does not contain a value with the given name, an empty\n Any is returned.\n *\/\n const ::com::sun::star::uno::Any& get( const ::rtl::OUString& _rValueName ) const\n {\n return impl_get( _rValueName );\n }\n\n \/\/\/ determines whether a value with a given name is present in the collection\n inline bool has( const sal_Char* _pAsciiValueName ) const\n {\n return impl_has( ::rtl::OUString::createFromAscii( _pAsciiValueName ) );\n }\n\n \/\/\/ determines whether a value with a given name is present in the collection\n inline bool has( const ::rtl::OUString& _rValueName ) const\n {\n return impl_has( _rValueName );\n }\n\n \/** puts a value into the collection\n\n @return <TRUE\/> if and only if a value was already present previously, in\n which case it has been overwritten.\n *\/\n template < typename VALUE_TYPE >\n inline bool put( const sal_Char* _pAsciiValueName, const VALUE_TYPE& _rValue )\n {\n return impl_put( ::rtl::OUString::createFromAscii( _pAsciiValueName ), ::com::sun::star::uno::makeAny( _rValue ) );\n }\n\n \/** puts a value into the collection\n\n @return <TRUE\/> if and only if a value was already present previously, in\n which case it has been overwritten.\n *\/\n template < typename VALUE_TYPE >\n inline bool put( const ::rtl::OUString& _rValueName, const VALUE_TYPE& _rValue )\n {\n return impl_put( _rValueName, ::com::sun::star::uno::makeAny( _rValue ) );\n }\n\n inline bool put( const sal_Char* _pAsciiValueName, const ::com::sun::star::uno::Any& _rValue )\n {\n return impl_put( ::rtl::OUString::createFromAscii( _pAsciiValueName ), _rValue );\n }\n\n inline bool put( const ::rtl::OUString& _rValueName, const ::com::sun::star::uno::Any& _rValue )\n {\n return impl_put( _rValueName, _rValue );\n }\n\n \/** removes the value with the given name from the collection\n\n @return <TRUE\/> if and only if a value with the given name existed in the collection.\n *\/\n inline bool remove( const sal_Char* _pAsciiValueName )\n {\n return impl_remove( ::rtl::OUString::createFromAscii( _pAsciiValueName ) );\n }\n\n \/** removes the value with the given name from the collection\n\n @return <TRUE\/> if and only if a value with the given name existed in the collection.\n *\/\n inline bool remove( const ::rtl::OUString& _rValueName )\n {\n return impl_remove( _rValueName );\n }\n\n \/** transforms the collection to a sequence of PropertyValues\n\n @return\n the number of elements in the sequence\n *\/\n sal_Int32 operator >>= ( ::com::sun::star::uno::Sequence< ::com::sun::star::beans::PropertyValue >& _out_rValues ) const;\n\n \/** transforms the collection to a sequence of NamedValues\n\n @return\n the number of elements in the sequence\n *\/\n sal_Int32 operator >>= ( ::com::sun::star::uno::Sequence< ::com::sun::star::beans::NamedValue >& _out_rValues ) const;\n\n \/** transforms the collection into a sequence of PropertyValues\n *\/\n inline ::com::sun::star::uno::Sequence< ::com::sun::star::beans::PropertyValue >\n getPropertyValues() const\n {\n ::com::sun::star::uno::Sequence< ::com::sun::star::beans::PropertyValue > aValues;\n *this >>= aValues;\n return aValues;\n }\n\n \/** returns a Sequence< Any >, containing PropertyValues\n *\/\n inline ::com::sun::star::uno::Sequence< ::com::sun::star::uno::Any >\n getWrappedPropertyValues() const\n {\n return impl_wrap< ::com::sun::star::beans::PropertyValue >();\n }\n\n \/** returns a Sequence< Any >, containing NamedValues\n *\/\n inline ::com::sun::star::uno::Sequence< ::com::sun::star::uno::Any >\n getWrappedNamedValues() const\n {\n return impl_wrap< ::com::sun::star::beans::NamedValue >();\n }\n\n \/** transforms the collection into a sequence of NamedValues\n *\/\n inline ::com::sun::star::uno::Sequence< ::com::sun::star::beans::NamedValue >\n getNamedValues() const\n {\n ::com::sun::star::uno::Sequence< ::com::sun::star::beans::NamedValue > aValues;\n *this >>= aValues;\n return aValues;\n }\n\n private:\n void impl_assign( const ::com::sun::star::uno::Sequence< ::com::sun::star::uno::Any >& _rArguments );\n void impl_assign( const ::com::sun::star::uno::Sequence< ::com::sun::star::beans::PropertyValue >& _rArguments );\n void impl_assign( const ::com::sun::star::uno::Sequence< ::com::sun::star::beans::NamedValue >& _rArguments );\n\n bool get_ensureType(\n const ::rtl::OUString& _rValueName,\n void* _pValueLocation,\n const ::com::sun::star::uno::Type& _rExpectedValueType\n ) const;\n\n const ::com::sun::star::uno::Any&\n impl_get( const ::rtl::OUString& _rValueName ) const;\n\n bool impl_has( const ::rtl::OUString& _rValueName ) const;\n\n bool impl_put( const ::rtl::OUString& _rValueName, const ::com::sun::star::uno::Any& _rValue );\n\n bool impl_remove( const ::rtl::OUString& _rValueName );\n\n template< class VALUE_TYPE >\n ::com::sun::star::uno::Sequence< ::com::sun::star::uno::Any > impl_wrap() const\n {\n ::com::sun::star::uno::Sequence< VALUE_TYPE > aValues;\n *this >>= aValues;\n ::com::sun::star::uno::Sequence< ::com::sun::star::uno::Any > aWrappedValues( aValues.getLength() );\n ::std::transform(\n aValues.getConstArray(),\n aValues.getConstArray() + aValues.getLength(),\n aWrappedValues.getArray(),\n ::com::sun::star::uno::makeAny< VALUE_TYPE >\n );\n return aWrappedValues;\n }\n };\n\n\/\/........................................................................\n} \/\/ namespace comphelper\n\/\/........................................................................\n\n#endif \/\/ COMPHELPER_NAMEDVALUECOLLECTION_HXX\n\n<commit_msg>autorecovery: +clear<commit_after>\/*************************************************************************\n *\n * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.\n *\n * Copyright 2008 by Sun Microsystems, Inc.\n *\n * OpenOffice.org - a multi-platform office productivity suite\n *\n * $RCSfile: namedvaluecollection.hxx,v $\n * $Revision: 1.11.20.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\n#ifndef COMPHELPER_NAMEDVALUECOLLECTION_HXX\n#define COMPHELPER_NAMEDVALUECOLLECTION_HXX\n\n#include <comphelper\/comphelperdllapi.h>\n\n\/** === begin UNO includes === **\/\n#include <com\/sun\/star\/uno\/Sequence.hxx>\n#include <com\/sun\/star\/uno\/Any.hxx>\n#include <com\/sun\/star\/beans\/PropertyValue.hpp>\n#include <com\/sun\/star\/beans\/NamedValue.hpp>\n\/** === end UNO includes === **\/\n\n#include <memory>\n#include <algorithm>\n\n\/\/........................................................................\nnamespace comphelper\n{\n\/\/........................................................................\n\n \/\/ ====================================================================\n \/\/ = NamedValueCollection\n \/\/ ====================================================================\n struct NamedValueCollection_Impl;\n \/** a collection of named values, packed in various formats.\n *\/\n class COMPHELPER_DLLPUBLIC NamedValueCollection\n {\n private:\n ::std::auto_ptr< NamedValueCollection_Impl > m_pImpl;\n\n public:\n NamedValueCollection();\n\n NamedValueCollection( const NamedValueCollection& _rCopySource );\n\n NamedValueCollection& operator=( const NamedValueCollection& i_rCopySource );\n\n \/** constructs a collection\n @param _rElements\n the wrapped elements of the collection. The <code>Any<\/code> might contain a sequence of\n property values, a sequence of named values, or directly a property value or named value.\n All other cases are worth an assertion in non-product builds.\n *\/\n NamedValueCollection( const ::com::sun::star::uno::Any& _rElements );\n\n \/** constructs a collection\n @param _rArguments\n a sequence of Any's containing either PropertyValue's or NamedValue's.\n *\/\n NamedValueCollection( const ::com::sun::star::uno::Sequence< ::com::sun::star::uno::Any >& _rArguments );\n\n \/** constructs a collection\n @param _rArguments\n a sequence of PropertyValues's\n *\/\n NamedValueCollection( const ::com::sun::star::uno::Sequence< ::com::sun::star::beans::PropertyValue >& _rArguments );\n\n \/** constructs a collection\n @param _rArguments\n a sequence of NamedValue's\n *\/\n NamedValueCollection( const ::com::sun::star::uno::Sequence< ::com::sun::star::beans::NamedValue >& _rArguments );\n\n ~NamedValueCollection();\n\n inline void assign( const ::com::sun::star::uno::Sequence< ::com::sun::star::uno::Any >& _rArguments )\n {\n impl_assign( _rArguments );\n }\n\n inline void assign( const ::com::sun::star::uno::Sequence< ::com::sun::star::beans::PropertyValue >& _rArguments )\n {\n impl_assign( _rArguments );\n }\n\n inline void assign( const ::com::sun::star::uno::Sequence< ::com::sun::star::beans::NamedValue >& _rArguments )\n {\n impl_assign( _rArguments );\n }\n\n inline void clear()\n {\n impl_assign( ::com::sun::star::uno::Sequence< ::com::sun::star::beans::NamedValue >() );\n }\n\n \/\/\/ returns the number of elements in the collection\n size_t size() const;\n\n \/\/\/ determines whether the collection is empty\n bool empty() const;\n\n \/** merges the content of another collection into |this|\n @param _rAdditionalValues\n the collection whose values are to be merged\n @param _bOverwriteExisting\n defines whether or not elements which are already present in |this|\n should be overwritten (<TRUE\/>) or preserved (<FALSE\/>).\n @return |*this|\n *\/\n NamedValueCollection&\n merge(\n const NamedValueCollection& _rAdditionalValues,\n bool _bOverwriteExisting\n );\n\n \/** retrieves a value with a given name from the collection, if it is present\n\n @param _pAsciiValueName\n the ASCII name of the value to retrieve\n\n @param _out_rValue\n is the output parameter taking the desired value upon successful return. If\n a value with the given name is not present in the collection, or if a wrong-typed\n value is present, then this parameter will not be touched.\n\n @return\n <TRUE\/> if there is a value with the given name, which could successfully\n be extraced. In this case, <arg>_out_rValue<\/arg> will contain the requested\n value.<br\/>\n <FALSE\/>, if there is no value with the given name.\n @throws IllegalArgumentException\n in case there is a value with the given name, but it cannot legally assigned to\n _out_rValue.\n *\/\n template < typename VALUE_TYPE >\n bool get_ensureType( const sal_Char* _pAsciiValueName, VALUE_TYPE& _out_rValue ) const\n {\n return get_ensureType( ::rtl::OUString::createFromAscii( _pAsciiValueName ), &_out_rValue, ::cppu::UnoType< VALUE_TYPE >::get() );\n }\n\n template < typename VALUE_TYPE >\n bool get_ensureType( const ::rtl::OUString& _rValueName, VALUE_TYPE& _out_rValue ) const\n {\n return get_ensureType( _rValueName, &_out_rValue, ::cppu::UnoType< VALUE_TYPE >::get() );\n }\n\n \/** retrieves a value with a given name, or defaults it to a given value, if its not present\n in the colllection\n *\/\n template < typename VALUE_TYPE >\n VALUE_TYPE getOrDefault( const sal_Char* _pAsciiValueName, const VALUE_TYPE& _rDefault ) const\n {\n return getOrDefault( ::rtl::OUString::createFromAscii( _pAsciiValueName ), _rDefault );\n }\n\n template < typename VALUE_TYPE >\n VALUE_TYPE getOrDefault( const ::rtl::OUString& _rValueName, const VALUE_TYPE& _rDefault ) const\n {\n VALUE_TYPE retVal( _rDefault );\n get_ensureType( _rValueName, retVal );\n return retVal;\n }\n\n \/** retrieves a (untyped) value with a given name\n\n If the collection does not contain a value with the given name, an empty\n Any is returned.\n *\/\n const ::com::sun::star::uno::Any& get( const sal_Char* _pAsciiValueName ) const\n {\n return get( ::rtl::OUString::createFromAscii( _pAsciiValueName ) );\n }\n\n \/** retrieves a (untyped) value with a given name\n\n If the collection does not contain a value with the given name, an empty\n Any is returned.\n *\/\n const ::com::sun::star::uno::Any& get( const ::rtl::OUString& _rValueName ) const\n {\n return impl_get( _rValueName );\n }\n\n \/\/\/ determines whether a value with a given name is present in the collection\n inline bool has( const sal_Char* _pAsciiValueName ) const\n {\n return impl_has( ::rtl::OUString::createFromAscii( _pAsciiValueName ) );\n }\n\n \/\/\/ determines whether a value with a given name is present in the collection\n inline bool has( const ::rtl::OUString& _rValueName ) const\n {\n return impl_has( _rValueName );\n }\n\n \/** puts a value into the collection\n\n @return <TRUE\/> if and only if a value was already present previously, in\n which case it has been overwritten.\n *\/\n template < typename VALUE_TYPE >\n inline bool put( const sal_Char* _pAsciiValueName, const VALUE_TYPE& _rValue )\n {\n return impl_put( ::rtl::OUString::createFromAscii( _pAsciiValueName ), ::com::sun::star::uno::makeAny( _rValue ) );\n }\n\n \/** puts a value into the collection\n\n @return <TRUE\/> if and only if a value was already present previously, in\n which case it has been overwritten.\n *\/\n template < typename VALUE_TYPE >\n inline bool put( const ::rtl::OUString& _rValueName, const VALUE_TYPE& _rValue )\n {\n return impl_put( _rValueName, ::com::sun::star::uno::makeAny( _rValue ) );\n }\n\n inline bool put( const sal_Char* _pAsciiValueName, const ::com::sun::star::uno::Any& _rValue )\n {\n return impl_put( ::rtl::OUString::createFromAscii( _pAsciiValueName ), _rValue );\n }\n\n inline bool put( const ::rtl::OUString& _rValueName, const ::com::sun::star::uno::Any& _rValue )\n {\n return impl_put( _rValueName, _rValue );\n }\n\n \/** removes the value with the given name from the collection\n\n @return <TRUE\/> if and only if a value with the given name existed in the collection.\n *\/\n inline bool remove( const sal_Char* _pAsciiValueName )\n {\n return impl_remove( ::rtl::OUString::createFromAscii( _pAsciiValueName ) );\n }\n\n \/** removes the value with the given name from the collection\n\n @return <TRUE\/> if and only if a value with the given name existed in the collection.\n *\/\n inline bool remove( const ::rtl::OUString& _rValueName )\n {\n return impl_remove( _rValueName );\n }\n\n \/** transforms the collection to a sequence of PropertyValues\n\n @return\n the number of elements in the sequence\n *\/\n sal_Int32 operator >>= ( ::com::sun::star::uno::Sequence< ::com::sun::star::beans::PropertyValue >& _out_rValues ) const;\n\n \/** transforms the collection to a sequence of NamedValues\n\n @return\n the number of elements in the sequence\n *\/\n sal_Int32 operator >>= ( ::com::sun::star::uno::Sequence< ::com::sun::star::beans::NamedValue >& _out_rValues ) const;\n\n \/** transforms the collection into a sequence of PropertyValues\n *\/\n inline ::com::sun::star::uno::Sequence< ::com::sun::star::beans::PropertyValue >\n getPropertyValues() const\n {\n ::com::sun::star::uno::Sequence< ::com::sun::star::beans::PropertyValue > aValues;\n *this >>= aValues;\n return aValues;\n }\n\n \/** returns a Sequence< Any >, containing PropertyValues\n *\/\n inline ::com::sun::star::uno::Sequence< ::com::sun::star::uno::Any >\n getWrappedPropertyValues() const\n {\n return impl_wrap< ::com::sun::star::beans::PropertyValue >();\n }\n\n \/** returns a Sequence< Any >, containing NamedValues\n *\/\n inline ::com::sun::star::uno::Sequence< ::com::sun::star::uno::Any >\n getWrappedNamedValues() const\n {\n return impl_wrap< ::com::sun::star::beans::NamedValue >();\n }\n\n \/** transforms the collection into a sequence of NamedValues\n *\/\n inline ::com::sun::star::uno::Sequence< ::com::sun::star::beans::NamedValue >\n getNamedValues() const\n {\n ::com::sun::star::uno::Sequence< ::com::sun::star::beans::NamedValue > aValues;\n *this >>= aValues;\n return aValues;\n }\n\n private:\n void impl_assign( const ::com::sun::star::uno::Sequence< ::com::sun::star::uno::Any >& _rArguments );\n void impl_assign( const ::com::sun::star::uno::Sequence< ::com::sun::star::beans::PropertyValue >& _rArguments );\n void impl_assign( const ::com::sun::star::uno::Sequence< ::com::sun::star::beans::NamedValue >& _rArguments );\n\n bool get_ensureType(\n const ::rtl::OUString& _rValueName,\n void* _pValueLocation,\n const ::com::sun::star::uno::Type& _rExpectedValueType\n ) const;\n\n const ::com::sun::star::uno::Any&\n impl_get( const ::rtl::OUString& _rValueName ) const;\n\n bool impl_has( const ::rtl::OUString& _rValueName ) const;\n\n bool impl_put( const ::rtl::OUString& _rValueName, const ::com::sun::star::uno::Any& _rValue );\n\n bool impl_remove( const ::rtl::OUString& _rValueName );\n\n template< class VALUE_TYPE >\n ::com::sun::star::uno::Sequence< ::com::sun::star::uno::Any > impl_wrap() const\n {\n ::com::sun::star::uno::Sequence< VALUE_TYPE > aValues;\n *this >>= aValues;\n ::com::sun::star::uno::Sequence< ::com::sun::star::uno::Any > aWrappedValues( aValues.getLength() );\n ::std::transform(\n aValues.getConstArray(),\n aValues.getConstArray() + aValues.getLength(),\n aWrappedValues.getArray(),\n ::com::sun::star::uno::makeAny< VALUE_TYPE >\n );\n return aWrappedValues;\n }\n };\n\n\/\/........................................................................\n} \/\/ namespace comphelper\n\/\/........................................................................\n\n#endif \/\/ COMPHELPER_NAMEDVALUECOLLECTION_HXX\n\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 \"iexcitoncl.h\"\n#include \"votca\/xtp\/segmentmapper.h\"\n\n#include <boost\/filesystem.hpp>\n#include <boost\/format.hpp>\n#include <votca\/tools\/constants.h>\n#include <votca\/tools\/propertyiomanipulator.h>\n#include <votca\/xtp\/eeinteractor.h>\n#include <votca\/xtp\/logger.h>\n\nusing namespace std;\nusing namespace boost::filesystem;\nusing namespace votca::tools;\n\nnamespace votca {\nnamespace xtp {\n\n\/\/ +++++++++++++++++++++++++++++ \/\/\n\/\/ IEXCITON MEMBER FUNCTIONS \/\/\n\/\/ +++++++++++++++++++++++++++++ \/\/\n\nvoid IEXCITON::Initialize(tools::Property& options) {\n\n cout << endl\n << \"... ... Initialized with \" << _nThreads << \" threads. \" << flush;\n\n _maverick = (_nThreads == 1) ? true : false;\n\n string key = \"options.\" + Identify();\n _jobfile = options.ifExistsReturnElseThrowRuntimeError<std::string>(\n key + \".job_file\");\n _mapfile = options.ifExistsReturnElseThrowRuntimeError<std::string>(\n key + \".map_file\");\n\n if (options.exists(key + \".states\")) {\n string parse_string = options.get(key + \".states\").as<string>();\n _statemap = FillParseMaps(parse_string);\n }\n\n cout << \"done\" << endl;\n}\n\nstd::map<std::string, QMState> IEXCITON::FillParseMaps(\n const string& Mapstring) {\n Tokenizer split_options(Mapstring, \", \\t\\n\");\n std::map<std::string, QMState> type2level;\n for (const string& substring : split_options) {\n std::vector<string> segmentpnumber;\n Tokenizer tok(substring, \":\");\n tok.ToVector(segmentpnumber);\n if (segmentpnumber.size() != 2) {\n throw runtime_error(\"Parser iqm: Segment and exciton labels:\" +\n substring + \"are not separated properly\");\n }\n QMState state = QMState(segmentpnumber[1]);\n if (!state.isTransition()) {\n throw std::runtime_error(\"State to calculate must be a transition state\");\n }\n string segmentname = segmentpnumber[0];\n type2level[segmentname] = state;\n }\n return type2level;\n}\n\nJob::JobResult IEXCITON::EvalJob(Topology& top, Job& job, QMThread& opThread) {\n\n \/\/ report back to the progress observer\n Job::JobResult jres = Job::JobResult();\n\n \/\/ get the logger from the thread\n Logger& pLog = opThread.getLogger();\n\n \/\/ get the information about the job executed by the thread\n int job_ID = job.getId();\n Property job_input = job.getInput();\n vector<Property*> segment_list = job_input.Select(\"segment\");\n int ID_A = segment_list.front()->getAttribute<int>(\"id\");\n string type_A = segment_list.front()->getAttribute<string>(\"type\");\n string mps_fileA = segment_list.front()->getAttribute<string>(\"mps_file\");\n int ID_B = segment_list.back()->getAttribute<int>(\"id\");\n string type_B = segment_list.back()->getAttribute<string>(\"type\");\n string mps_fileB = segment_list.back()->getAttribute<string>(\"mps_file\");\n\n Segment& seg_A = top.getSegment(ID_A);\n Segment& seg_B = top.getSegment(ID_B);\n QMNBList& nblist = top.NBList();\n QMPair* pair = nblist.FindPair(&seg_A, &seg_B);\n if (pair == nullptr) {\n throw std::runtime_error(\n \"pair between segments \" + std::to_string(seg_A.getId()) + \":\" +\n std::to_string(seg_B.getId()) + \" not found in neighborlist \");\n }\n\n XTP_LOG_SAVE(logINFO, pLog) << TimeStamp() << \" Evaluating pair \" << job_ID\n << \" [\" << ID_A << \":\" << ID_B << \"]\" << flush;\n\n StaticMapper map(pLog);\n map.LoadMappingFile(_mapfile);\n StaticSegment seg1 = map.map(*(pair->Seg1()), mps_fileA);\n StaticSegment seg2 = map.map(*(pair->Seg2PbCopy()), mps_fileB);\n eeInteractor actor;\n double JAB = actor.InteractStatic(seg1, seg2);\n _cutoff = 0;\n Property job_summary;\n Property& job_output = job_summary.add(\"output\", \"\");\n Property& pair_summary = job_output.add(\"pair\", \"\");\n string nameA = seg_A.getName();\n string nameB = seg_B.getName();\n pair_summary.setAttribute(\"idA\", ID_A);\n pair_summary.setAttribute(\"idB\", ID_B);\n pair_summary.setAttribute(\"typeA\", nameA);\n pair_summary.setAttribute(\"typeB\", nameB);\n Property& coupling_summary = pair_summary.add(\"Coupling\", \"\");\n coupling_summary.setAttribute(\"jABstatic\", JAB * tools::conv::hrt2ev);\n\n jres.setOutput(job_summary);\n jres.setStatus(Job::COMPLETE);\n\n return jres;\n}\n\nQMState IEXCITON::GetElementFromMap(const std::string& elementname) const {\n QMState state;\n try {\n state = _statemap.at(elementname);\n } catch (std::out_of_range& error) {\n std::string errormessage =\n \"Map does not have segment of type: \" + elementname;\n errormessage += \"\\n segments in map are:\";\n for (const auto& s : _statemap) {\n errormessage += \"\\n\\t\" + s.first;\n }\n throw std::runtime_error(errormessage);\n }\n return state;\n}\n\nvoid IEXCITON::WriteJobFile(Topology& top) {\n\n cout << endl << \"... ... Writing job file \" << flush;\n std::ofstream ofs;\n ofs.open(_jobfile, std::ofstream::out);\n if (!ofs.is_open())\n throw runtime_error(\"\\nERROR: bad file handle: \" + _jobfile);\n QMNBList& nblist = top.NBList();\n int jobCount = 0;\n if (nblist.size() == 0) {\n cout << endl << \"... ... No pairs in neighbor list, skip.\" << flush;\n return;\n }\n\n ofs << \"<jobs>\" << endl;\n string tag = \"\";\n\n for (QMPair* pair : nblist) {\n if (pair->getType() == QMPair::PairType::Excitoncl) {\n int id1 = pair->Seg1()->getId();\n string name1 = pair->Seg1()->getName();\n int id2 = pair->Seg2()->getId();\n string name2 = pair->Seg2()->getName();\n int id = ++jobCount;\n QMState state1 = GetElementFromMap(name1);\n QMState state2 = GetElementFromMap(name2);\n\n string mps_file1 =\n (boost::format(\"MP_FILES\/%s_%s.mps\") % name1 % state1.ToString())\n .str();\n string mps_file2 =\n (boost::format(\"MP_FILES\/%s_%s.mps\") % name1 % state2.ToString())\n .str();\n\n Property Input;\n Property& pInput = Input.add(\"input\", \"\");\n Property& pSegment1 =\n pInput.add(\"segment\", boost::lexical_cast<string>(id1));\n pSegment1.setAttribute<string>(\"type\", name1);\n pSegment1.setAttribute<int>(\"id\", id1);\n pSegment1.setAttribute<string>(\"mps_file\", mps_file1);\n Property& pSegment2 =\n pInput.add(\"segment\", boost::lexical_cast<string>(id2));\n pSegment2.setAttribute<string>(\"type\", name2);\n pSegment2.setAttribute<int>(\"id\", id2);\n pSegment2.setAttribute<string>(\"mps_file\", mps_file2);\n\n Job job(id, tag, Input, Job::AVAILABLE);\n job.ToStream(ofs, \"xml\");\n }\n }\n\n \/\/ CLOSE STREAM\n ofs << \"<\/jobs>\" << endl;\n ofs.close();\n\n cout << endl << \"... ... In total \" << jobCount << \" jobs\" << flush;\n}\n\nvoid IEXCITON::ReadJobFile(Topology& top) {\n\n Property xml;\n vector<Property*> records;\n \/\/ gets the neighborlist from the topology\n QMNBList& nblist = top.NBList();\n int number_of_pairs = nblist.size();\n int current_pairs = 0;\n Logger log;\n log.setReportLevel(logINFO);\n\n \/\/ load the QC results in a vector indexed by the pair ID\n load_property_from_xml(xml, _jobfile);\n vector<Property*> jobProps = xml.Select(\"jobs.job\");\n records.resize(number_of_pairs + 1);\n\n \/\/ to skip pairs which are not in the jobfile\n for (unsigned i = 0; i < records.size(); i++) {\n records[i] = NULL;\n }\n \/\/ loop over all jobs = pair records in the job file\n for (Property* prop : jobProps) {\n \/\/ if job produced an output, then continue with analysis\n if (prop->exists(\"output\") && prop->exists(\"output.pair\")) {\n current_pairs++;\n Property& poutput = prop->get(\"output.pair\");\n int idA = poutput.getAttribute<int>(\"idA\");\n int idB = poutput.getAttribute<int>(\"idB\");\n Segment& segA = top.getSegment(idA);\n Segment& segB = top.getSegment(idB);\n QMPair* qmp = nblist.FindPair(&segA, &segB);\n\n if (qmp == NULL) {\n XTP_LOG_SAVE(logINFO, log)\n << \"No pair \" << idA << \":\" << idB\n << \" found in the neighbor list. Ignoring\" << flush;\n } else {\n records[qmp->getId()] = &(prop->get(\"output.pair\"));\n }\n } else {\n Property thebadone = prop->get(\"id\");\n throw runtime_error(\"\\nERROR: Job file incomplete.\\n Job with id \" +\n thebadone.as<string>() +\n \" is not finished. Check your job file for FAIL, \"\n \"AVAILABLE, or ASSIGNED. Exiting\\n\");\n }\n } \/\/ finished loading from the file\n\n \/\/ loop over all pairs in the neighbor list\n XTP_LOG_SAVE(logINFO, log)\n << \"Neighborlist size \" << top.NBList().size() << flush;\n for (QMPair* pair : top.NBList()) {\n\n if (records[pair->getId()] == NULL)\n continue; \/\/ skip pairs which are not in the jobfile\n double Jeff2 = 0.0;\n double jAB = 0.0;\n if (pair->getType() == QMPair::Excitoncl) {\n Property* pair_property = records[pair->getId()];\n vector<Property*> pCoupling = pair_property->Select(\"Coupling\");\n for (Property* coup : pCoupling) {\n jAB = coup->getAttribute<double>(\"jABstatic\");\n }\n Jeff2 = jAB * jAB * tools::conv::ev2hrt * tools::conv::ev2hrt;\n pair->setJeff2(Jeff2, QMStateType::Singlet);\n }\n }\n XTP_LOG_SAVE(logINFO, log) << \"Pairs [total:updated] \" << number_of_pairs\n << \":\" << current_pairs << flush;\n cout << log;\n}\n\n} \/\/ namespace xtp\n}; \/\/ namespace votca\n<commit_msg>Removed unused variables<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 \"iexcitoncl.h\"\n#include \"votca\/xtp\/segmentmapper.h\"\n\n#include <boost\/filesystem.hpp>\n#include <boost\/format.hpp>\n#include <votca\/tools\/constants.h>\n#include <votca\/tools\/propertyiomanipulator.h>\n#include <votca\/xtp\/eeinteractor.h>\n#include <votca\/xtp\/logger.h>\n\nusing namespace std;\nusing namespace boost::filesystem;\nusing namespace votca::tools;\n\nnamespace votca {\nnamespace xtp {\n\n\/\/ +++++++++++++++++++++++++++++ \/\/\n\/\/ IEXCITON MEMBER FUNCTIONS \/\/\n\/\/ +++++++++++++++++++++++++++++ \/\/\n\nvoid IEXCITON::Initialize(tools::Property& options) {\n\n cout << endl\n << \"... ... Initialized with \" << _nThreads << \" threads. \" << flush;\n\n _maverick = (_nThreads == 1) ? true : false;\n\n string key = \"options.\" + Identify();\n _jobfile = options.ifExistsReturnElseThrowRuntimeError<std::string>(\n key + \".job_file\");\n _mapfile = options.ifExistsReturnElseThrowRuntimeError<std::string>(\n key + \".map_file\");\n\n if (options.exists(key + \".states\")) {\n string parse_string = options.get(key + \".states\").as<string>();\n _statemap = FillParseMaps(parse_string);\n }\n\n cout << \"done\" << endl;\n}\n\nstd::map<std::string, QMState> IEXCITON::FillParseMaps(\n const string& Mapstring) {\n Tokenizer split_options(Mapstring, \", \\t\\n\");\n std::map<std::string, QMState> type2level;\n for (const string& substring : split_options) {\n std::vector<string> segmentpnumber;\n Tokenizer tok(substring, \":\");\n tok.ToVector(segmentpnumber);\n if (segmentpnumber.size() != 2) {\n throw runtime_error(\"Parser iqm: Segment and exciton labels:\" +\n substring + \"are not separated properly\");\n }\n QMState state = QMState(segmentpnumber[1]);\n if (!state.isTransition()) {\n throw std::runtime_error(\"State to calculate must be a transition state\");\n }\n string segmentname = segmentpnumber[0];\n type2level[segmentname] = state;\n }\n return type2level;\n}\n\nJob::JobResult IEXCITON::EvalJob(Topology& top, Job& job, QMThread& opThread) {\n\n \/\/ report back to the progress observer\n Job::JobResult jres = Job::JobResult();\n\n \/\/ get the logger from the thread\n Logger& pLog = opThread.getLogger();\n\n \/\/ get the information about the job executed by the thread\n int job_ID = job.getId();\n Property job_input = job.getInput();\n vector<Property*> segment_list = job_input.Select(\"segment\");\n int ID_A = segment_list.front()->getAttribute<int>(\"id\");\n string mps_fileA = segment_list.front()->getAttribute<string>(\"mps_file\");\n int ID_B = segment_list.back()->getAttribute<int>(\"id\");\n string mps_fileB = segment_list.back()->getAttribute<string>(\"mps_file\");\n\n Segment& seg_A = top.getSegment(ID_A);\n Segment& seg_B = top.getSegment(ID_B);\n QMNBList& nblist = top.NBList();\n QMPair* pair = nblist.FindPair(&seg_A, &seg_B);\n if (pair == nullptr) {\n throw std::runtime_error(\n \"pair between segments \" + std::to_string(seg_A.getId()) + \":\" +\n std::to_string(seg_B.getId()) + \" not found in neighborlist \");\n }\n\n XTP_LOG_SAVE(logINFO, pLog) << TimeStamp() << \" Evaluating pair \" << job_ID\n << \" [\" << ID_A << \":\" << ID_B << \"]\" << flush;\n\n StaticMapper map(pLog);\n map.LoadMappingFile(_mapfile);\n StaticSegment seg1 = map.map(*(pair->Seg1()), mps_fileA);\n StaticSegment seg2 = map.map(*(pair->Seg2PbCopy()), mps_fileB);\n eeInteractor actor;\n double JAB = actor.InteractStatic(seg1, seg2);\n _cutoff = 0;\n Property job_summary;\n Property& job_output = job_summary.add(\"output\", \"\");\n Property& pair_summary = job_output.add(\"pair\", \"\");\n string nameA = seg_A.getName();\n string nameB = seg_B.getName();\n pair_summary.setAttribute(\"idA\", ID_A);\n pair_summary.setAttribute(\"idB\", ID_B);\n pair_summary.setAttribute(\"typeA\", nameA);\n pair_summary.setAttribute(\"typeB\", nameB);\n Property& coupling_summary = pair_summary.add(\"Coupling\", \"\");\n coupling_summary.setAttribute(\"jABstatic\", JAB * tools::conv::hrt2ev);\n\n jres.setOutput(job_summary);\n jres.setStatus(Job::COMPLETE);\n\n return jres;\n}\n\nQMState IEXCITON::GetElementFromMap(const std::string& elementname) const {\n QMState state;\n try {\n state = _statemap.at(elementname);\n } catch (std::out_of_range& error) {\n std::string errormessage =\n \"Map does not have segment of type: \" + elementname;\n errormessage += \"\\n segments in map are:\";\n for (const auto& s : _statemap) {\n errormessage += \"\\n\\t\" + s.first;\n }\n throw std::runtime_error(errormessage);\n }\n return state;\n}\n\nvoid IEXCITON::WriteJobFile(Topology& top) {\n\n cout << endl << \"... ... Writing job file \" << flush;\n std::ofstream ofs;\n ofs.open(_jobfile, std::ofstream::out);\n if (!ofs.is_open())\n throw runtime_error(\"\\nERROR: bad file handle: \" + _jobfile);\n QMNBList& nblist = top.NBList();\n int jobCount = 0;\n if (nblist.size() == 0) {\n cout << endl << \"... ... No pairs in neighbor list, skip.\" << flush;\n return;\n }\n\n ofs << \"<jobs>\" << endl;\n string tag = \"\";\n\n for (QMPair* pair : nblist) {\n if (pair->getType() == QMPair::PairType::Excitoncl) {\n int id1 = pair->Seg1()->getId();\n string name1 = pair->Seg1()->getName();\n int id2 = pair->Seg2()->getId();\n string name2 = pair->Seg2()->getName();\n int id = ++jobCount;\n QMState state1 = GetElementFromMap(name1);\n QMState state2 = GetElementFromMap(name2);\n\n string mps_file1 =\n (boost::format(\"MP_FILES\/%s_%s.mps\") % name1 % state1.ToString())\n .str();\n string mps_file2 =\n (boost::format(\"MP_FILES\/%s_%s.mps\") % name1 % state2.ToString())\n .str();\n\n Property Input;\n Property& pInput = Input.add(\"input\", \"\");\n Property& pSegment1 =\n pInput.add(\"segment\", boost::lexical_cast<string>(id1));\n pSegment1.setAttribute<string>(\"type\", name1);\n pSegment1.setAttribute<int>(\"id\", id1);\n pSegment1.setAttribute<string>(\"mps_file\", mps_file1);\n Property& pSegment2 =\n pInput.add(\"segment\", boost::lexical_cast<string>(id2));\n pSegment2.setAttribute<string>(\"type\", name2);\n pSegment2.setAttribute<int>(\"id\", id2);\n pSegment2.setAttribute<string>(\"mps_file\", mps_file2);\n\n Job job(id, tag, Input, Job::AVAILABLE);\n job.ToStream(ofs, \"xml\");\n }\n }\n\n \/\/ CLOSE STREAM\n ofs << \"<\/jobs>\" << endl;\n ofs.close();\n\n cout << endl << \"... ... In total \" << jobCount << \" jobs\" << flush;\n}\n\nvoid IEXCITON::ReadJobFile(Topology& top) {\n\n Property xml;\n vector<Property*> records;\n \/\/ gets the neighborlist from the topology\n QMNBList& nblist = top.NBList();\n int number_of_pairs = nblist.size();\n int current_pairs = 0;\n Logger log;\n log.setReportLevel(logINFO);\n\n \/\/ load the QC results in a vector indexed by the pair ID\n load_property_from_xml(xml, _jobfile);\n vector<Property*> jobProps = xml.Select(\"jobs.job\");\n records.resize(number_of_pairs + 1);\n\n \/\/ to skip pairs which are not in the jobfile\n for (unsigned i = 0; i < records.size(); i++) {\n records[i] = NULL;\n }\n \/\/ loop over all jobs = pair records in the job file\n for (Property* prop : jobProps) {\n \/\/ if job produced an output, then continue with analysis\n if (prop->exists(\"output\") && prop->exists(\"output.pair\")) {\n current_pairs++;\n Property& poutput = prop->get(\"output.pair\");\n int idA = poutput.getAttribute<int>(\"idA\");\n int idB = poutput.getAttribute<int>(\"idB\");\n Segment& segA = top.getSegment(idA);\n Segment& segB = top.getSegment(idB);\n QMPair* qmp = nblist.FindPair(&segA, &segB);\n\n if (qmp == NULL) {\n XTP_LOG_SAVE(logINFO, log)\n << \"No pair \" << idA << \":\" << idB\n << \" found in the neighbor list. Ignoring\" << flush;\n } else {\n records[qmp->getId()] = &(prop->get(\"output.pair\"));\n }\n } else {\n Property thebadone = prop->get(\"id\");\n throw runtime_error(\"\\nERROR: Job file incomplete.\\n Job with id \" +\n thebadone.as<string>() +\n \" is not finished. Check your job file for FAIL, \"\n \"AVAILABLE, or ASSIGNED. Exiting\\n\");\n }\n } \/\/ finished loading from the file\n\n \/\/ loop over all pairs in the neighbor list\n XTP_LOG_SAVE(logINFO, log)\n << \"Neighborlist size \" << top.NBList().size() << flush;\n for (QMPair* pair : top.NBList()) {\n\n if (records[pair->getId()] == NULL)\n continue; \/\/ skip pairs which are not in the jobfile\n double Jeff2 = 0.0;\n double jAB = 0.0;\n if (pair->getType() == QMPair::Excitoncl) {\n Property* pair_property = records[pair->getId()];\n vector<Property*> pCoupling = pair_property->Select(\"Coupling\");\n for (Property* coup : pCoupling) {\n jAB = coup->getAttribute<double>(\"jABstatic\");\n }\n Jeff2 = jAB * jAB * tools::conv::ev2hrt * tools::conv::ev2hrt;\n pair->setJeff2(Jeff2, QMStateType::Singlet);\n }\n }\n XTP_LOG_SAVE(logINFO, log) << \"Pairs [total:updated] \" << number_of_pairs\n << \":\" << current_pairs << flush;\n cout << log;\n}\n\n} \/\/ namespace xtp\n}; \/\/ namespace votca\n<|endoftext|>"} {"text":"<commit_before>\/*************************************************************************\n *\n * $RCSfile: accessibleeventnotifier.cxx,v $\n *\n * $Revision: 1.6 $\n *\n * last change: $Author: vg $ $Date: 2003-05-19 12:57:08 $\n *\n * The Contents of this file are made available subject to the terms of\n * either of the following licenses\n *\n * - GNU Lesser General Public License Version 2.1\n * - Sun Industry Standards Source License Version 1.1\n *\n * Sun Microsystems Inc., October, 2000\n *\n * GNU Lesser General Public License Version 2.1\n * =============================================\n * Copyright 2000 by Sun Microsystems, Inc.\n * 901 San Antonio Road, Palo Alto, CA 94303, USA\n *\n * This library is free software; you can redistribute it and\/or\n * modify it under the terms of the GNU Lesser General Public\n * License version 2.1, as published by the Free Software Foundation.\n *\n * This library is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU\n * Lesser General Public License for more details.\n *\n * You should have received a copy of the GNU Lesser General Public\n * License along with this library; if not, write to the Free Software\n * Foundation, Inc., 59 Temple Place, Suite 330, Boston,\n * MA 02111-1307 USA\n *\n *\n * Sun Industry Standards Source License Version 1.1\n * =================================================\n * The contents of this file are subject to the Sun Industry Standards\n * Source License Version 1.1 (the \"License\"); You may not use this file\n * except in compliance with the License. You may obtain a copy of the\n * License at http:\/\/www.openoffice.org\/license.html.\n *\n * Software provided under this License is provided on an \"AS IS\" basis,\n * WITHOUT WARRANTY OF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING,\n * WITHOUT LIMITATION, WARRANTIES THAT THE SOFTWARE IS FREE OF DEFECTS,\n * MERCHANTABLE, FIT FOR A PARTICULAR PURPOSE, OR NON-INFRINGING.\n * See the License for the specific provisions governing your rights and\n * obligations concerning the Software.\n *\n * The Initial Developer of the Original Code is: Sun Microsystems, Inc.\n *\n * Copyright: 2000 by Sun Microsystems, Inc.\n *\n * All Rights Reserved.\n *\n * Contributor(s): _______________________________________\n *\n *\n ************************************************************************\/\n\n#ifndef COMPHELPER_ACCESSIBLE_EVENT_NOTIFIER\n#include <comphelper\/accessibleeventnotifier.hxx>\n#endif\n\n#ifndef _OSL_DIAGNOSE_H_\n#include <osl\/diagnose.h>\n#endif\n\n#ifndef _COMPHELPER_GUARDING_HXX_\n#include <comphelper\/guarding.hxx>\n#endif\n\n\/\/.........................................................................\nnamespace comphelper\n{\n\/\/.........................................................................\n\n using namespace ::com::sun::star::uno;\n using namespace ::com::sun::star::lang;\n using namespace ::com::sun::star::accessibility;\n using namespace ::comphelper;\n\n \/\/=====================================================================\n \/\/= AccessibleEventNotifier\n \/\/=====================================================================\n \/\/---------------------------------------------------------------------\n ::osl::Mutex AccessibleEventNotifier::s_aMutex;\n AccessibleEventNotifier::ClientMap AccessibleEventNotifier::s_aClients;\n\n \/\/---------------------------------------------------------------------\n AccessibleEventNotifier::TClientId AccessibleEventNotifier::generateId()\n {\n TClientId nBiggestUsedId = 0;\n TClientId nFreeId = 0;\n\n \/\/ look through all registered clients until we find a \"gap\" in the ids\n\n \/\/ Note that the following relies on the fact the elements in the map are traveled with\n \/\/ ascending keys (aka client ids)\n\n for ( ClientMap::const_iterator aLookup = s_aClients.begin();\n aLookup != s_aClients.end();\n ++aLookup\n )\n {\n TClientId nCurrent = aLookup->first;\n OSL_ENSURE( nCurrent > nBiggestUsedId, \"AccessibleEventNotifier::generateId: map is expected to be sorted ascending!\" );\n\n if ( nCurrent - nBiggestUsedId > 1 )\n { \/\/ found a \"gap\"\n nFreeId = nBiggestUsedId + 1;\n break;\n }\n\n nBiggestUsedId = nCurrent;\n }\n\n if ( !nFreeId )\n nFreeId = nBiggestUsedId + 1;\n\n OSL_ENSURE( s_aClients.end() == s_aClients.find( nFreeId ),\n \"AccessibleEventNotifier::generateId: algorithm broken!\" );\n\n return nFreeId;\n }\n\n \/\/---------------------------------------------------------------------\n AccessibleEventNotifier::TClientId AccessibleEventNotifier::registerClient( )\n {\n ::osl::MutexGuard aGuard( s_aMutex );\n\n \/\/ generate a new client id\n TClientId nNewClientId = generateId( );\n\n \/\/ the event listeners for the new client\n EventListeners* pNewListeners = new EventListeners( s_aMutex );\n \/\/ note that we're using our own mutex here, so the listener containers for all\n \/\/ our clients share this same mutex.\n \/\/ this is a reminiscense to the days where the notifier was asynchronous. Today this is\n \/\/ completely nonsense, and potentially slowing down the Office me thinks ...\n\n \/\/ add the client\n s_aClients.insert( ClientMap::value_type( nNewClientId, pNewListeners ) );\n\n \/\/ outta here\n return nNewClientId;\n }\n\n \/\/---------------------------------------------------------------------\n sal_Bool AccessibleEventNotifier::implLookupClient( const TClientId _nClient, ClientMap::iterator& _rPos )\n {\n \/\/ look up this client\n _rPos = s_aClients.find( _nClient );\n OSL_ENSURE( s_aClients.end() != _rPos, \"AccessibleEventNotifier::implLookupClient: invalid client id (did you register your client?)!\" );\n\n return ( s_aClients.end() != _rPos );\n }\n\n \/\/---------------------------------------------------------------------\n void AccessibleEventNotifier::revokeClient( const TClientId _nClient )\n {\n ::osl::MutexGuard aGuard( s_aMutex );\n\n ClientMap::iterator aClientPos;\n if ( !implLookupClient( _nClient, aClientPos ) )\n \/\/ already asserted in implLookupClient\n return;\n\n \/\/ remove it from the clients map\n delete aClientPos->second;\n s_aClients.erase( aClientPos );\n }\n\n \/\/---------------------------------------------------------------------\n void AccessibleEventNotifier::revokeClientNotifyDisposing( const TClientId _nClient,\n const Reference< XInterface >& _rxEventSource ) SAL_THROW( ( ) )\n {\n ::osl::MutexGuard aGuard( s_aMutex );\n\n ClientMap::iterator aClientPos;\n if ( !implLookupClient( _nClient, aClientPos ) )\n \/\/ already asserted in implLookupClient\n return;\n\n \/\/ notify the \"disposing\" event for this client\n EventObject aDisposalEvent;\n aDisposalEvent.Source = _rxEventSource;\n\n \/\/ notify the listeners\n EventListeners* pListeners = aClientPos->second;\n\n \/\/ we do not need the entry in the clients map anymore\n \/\/ (do this before actually notifying, because some client implementations have re-entrance\n \/\/ problems and call into revokeClient while we are notifying from hereing)\n s_aClients.erase( aClientPos );\n\n \/\/ now really do the notification\n pListeners->disposeAndClear( aDisposalEvent );\n delete pListeners;\n\n }\n\n \/\/---------------------------------------------------------------------\n sal_Int32 AccessibleEventNotifier::addEventListener(\n const TClientId _nClient, const Reference< XAccessibleEventListener >& _rxListener ) SAL_THROW( ( ) )\n {\n ::osl::MutexGuard aGuard( s_aMutex );\n\n ClientMap::iterator aClientPos;\n if ( !implLookupClient( _nClient, aClientPos ) )\n \/\/ already asserted in implLookupClient\n return 0;\n\n if ( _rxListener.is() )\n aClientPos->second->addInterface( _rxListener );\n\n return aClientPos->second->getLength();\n }\n\n \/\/---------------------------------------------------------------------\n sal_Int32 AccessibleEventNotifier::removeEventListener(\n const TClientId _nClient, const Reference< XAccessibleEventListener >& _rxListener ) SAL_THROW( ( ) )\n {\n ::osl::MutexGuard aGuard( s_aMutex );\n\n ClientMap::iterator aClientPos;\n if ( !implLookupClient( _nClient, aClientPos ) )\n \/\/ already asserted in implLookupClient\n return 0;\n\n if ( _rxListener.is() )\n aClientPos->second->removeInterface( _rxListener );\n\n return aClientPos->second->getLength();\n }\n\n \/\/---------------------------------------------------------------------\n Sequence< Reference< XInterface > > AccessibleEventNotifier::getEventListeners( const TClientId _nClient ) SAL_THROW( ( ) )\n {\n Sequence< Reference< XInterface > > aListeners;\n\n ::osl::MutexGuard aGuard( s_aMutex );\n\n ClientMap::iterator aClientPos;\n if ( implLookupClient( _nClient, aClientPos ) )\n aListeners = aClientPos->second->getElements();\n\n return aListeners;\n }\n\n \/\/---------------------------------------------------------------------\n void AccessibleEventNotifier::addEvent( const TClientId _nClient, const AccessibleEventObject& _rEvent ) SAL_THROW( ( ) )\n {\n Sequence< Reference< XInterface > > aListeners;\n\n \/\/ --- <mutex lock> -------------------------------\n {\n ::osl::MutexGuard aGuard( s_aMutex );\n\n ClientMap::iterator aClientPos;\n if ( !implLookupClient( _nClient, aClientPos ) )\n \/\/ already asserted in implLookupClient\n return;\n\n \/\/ since we're synchronous, again, we want to notify immediately\n aListeners = aClientPos->second->getElements();\n }\n \/\/ --- <\/mutex lock> ------------------------------\n\n \/\/ default handling: loop through all listeners, and notify them\n const Reference< XInterface >* pListeners = aListeners.getConstArray();\n const Reference< XInterface >* pListenersEnd = pListeners + aListeners.getLength();\n while ( pListeners != pListenersEnd )\n {\n try\n {\n static_cast< XAccessibleEventListener* >( pListeners->get() )->notifyEvent( _rEvent );\n }\n catch( const Exception& e )\n {\n e;\n \/\/ silent this\n \/\/ no assertion, because a broken access remote bridge or something like this\n \/\/ can cause this exception\n }\n ++pListeners;\n }\n }\n\n\/\/.........................................................................\n} \/\/ namespace comphelper\n\/\/.........................................................................\n\n<commit_msg>INTEGRATION: CWS tune04 (1.6.120); FILE MERGED 2004\/06\/14 09:16:48 cmc 1.6.120.1: #i29636# turn global objects into local static data protected with swishy double-locked templated template<commit_after>\/*************************************************************************\n *\n * $RCSfile: accessibleeventnotifier.cxx,v $\n *\n * $Revision: 1.7 $\n *\n * last change: $Author: hjs $ $Date: 2004-06-25 17:20: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 COMPHELPER_ACCESSIBLE_EVENT_NOTIFIER\n#include <comphelper\/accessibleeventnotifier.hxx>\n#endif\n\n#ifndef _OSL_DIAGNOSE_H_\n#include <osl\/diagnose.h>\n#endif\n#ifndef INCLUDED_RTL_INSTANCE_HXX\n#include <rtl\/instance.hxx>\n#endif\n\n#ifndef _COMPHELPER_GUARDING_HXX_\n#include <comphelper\/guarding.hxx>\n#endif\n\nusing namespace ::com::sun::star::uno;\nusing namespace ::com::sun::star::lang;\nusing namespace ::com::sun::star::accessibility;\nusing namespace ::comphelper;\n\n\/\/=====================================================================\n\/\/= AccessibleEventNotifier\n\/\/=====================================================================\n\/\/---------------------------------------------------------------------\nnamespace\n{\n struct lclMutex\n : public rtl::Static< ::osl::Mutex, lclMutex > {};\n struct Clients\n : public rtl::Static< AccessibleEventNotifier::ClientMap, Clients > {};\n}\n\n\/\/.........................................................................\nnamespace comphelper\n{\n\/\/.........................................................................\n\n \/\/---------------------------------------------------------------------\n AccessibleEventNotifier::TClientId AccessibleEventNotifier::generateId()\n {\n TClientId nBiggestUsedId = 0;\n TClientId nFreeId = 0;\n\n \/\/ look through all registered clients until we find a \"gap\" in the ids\n\n \/\/ Note that the following relies on the fact the elements in the map are traveled with\n \/\/ ascending keys (aka client ids)\n AccessibleEventNotifier::ClientMap &rClients = Clients::get();\n for ( ClientMap::const_iterator aLookup = rClients.begin();\n aLookup != rClients.end();\n ++aLookup\n )\n {\n TClientId nCurrent = aLookup->first;\n OSL_ENSURE( nCurrent > nBiggestUsedId, \"AccessibleEventNotifier::generateId: map is expected to be sorted ascending!\" );\n\n if ( nCurrent - nBiggestUsedId > 1 )\n { \/\/ found a \"gap\"\n nFreeId = nBiggestUsedId + 1;\n break;\n }\n\n nBiggestUsedId = nCurrent;\n }\n\n if ( !nFreeId )\n nFreeId = nBiggestUsedId + 1;\n\n OSL_ENSURE( rClients.end() == rClients.find( nFreeId ),\n \"AccessibleEventNotifier::generateId: algorithm broken!\" );\n\n return nFreeId;\n }\n\n \/\/---------------------------------------------------------------------\n AccessibleEventNotifier::TClientId AccessibleEventNotifier::registerClient( )\n {\n ::osl::MutexGuard aGuard( lclMutex::get() );\n\n \/\/ generate a new client id\n TClientId nNewClientId = generateId( );\n\n \/\/ the event listeners for the new client\n EventListeners* pNewListeners = new EventListeners( lclMutex::get() );\n \/\/ note that we're using our own mutex here, so the listener containers for all\n \/\/ our clients share this same mutex.\n \/\/ this is a reminiscense to the days where the notifier was asynchronous. Today this is\n \/\/ completely nonsense, and potentially slowing down the Office me thinks ...\n\n \/\/ add the client\n Clients::get().insert( ClientMap::value_type( nNewClientId, pNewListeners ) );\n\n \/\/ outta here\n return nNewClientId;\n }\n\n \/\/---------------------------------------------------------------------\n sal_Bool AccessibleEventNotifier::implLookupClient( const TClientId _nClient, ClientMap::iterator& _rPos )\n {\n \/\/ look up this client\n AccessibleEventNotifier::ClientMap &rClients = Clients::get();\n _rPos = rClients.find( _nClient );\n OSL_ENSURE( rClients.end() != _rPos, \"AccessibleEventNotifier::implLookupClient: invalid client id (did you register your client?)!\" );\n\n return ( rClients.end() != _rPos );\n }\n\n \/\/---------------------------------------------------------------------\n void AccessibleEventNotifier::revokeClient( const TClientId _nClient )\n {\n ::osl::MutexGuard aGuard( lclMutex::get() );\n\n ClientMap::iterator aClientPos;\n if ( !implLookupClient( _nClient, aClientPos ) )\n \/\/ already asserted in implLookupClient\n return;\n\n \/\/ remove it from the clients map\n delete aClientPos->second;\n Clients::get().erase( aClientPos );\n }\n\n \/\/---------------------------------------------------------------------\n void AccessibleEventNotifier::revokeClientNotifyDisposing( const TClientId _nClient,\n const Reference< XInterface >& _rxEventSource ) SAL_THROW( ( ) )\n {\n ::osl::MutexGuard aGuard( lclMutex::get() );\n\n ClientMap::iterator aClientPos;\n if ( !implLookupClient( _nClient, aClientPos ) )\n \/\/ already asserted in implLookupClient\n return;\n\n \/\/ notify the \"disposing\" event for this client\n EventObject aDisposalEvent;\n aDisposalEvent.Source = _rxEventSource;\n\n \/\/ notify the listeners\n EventListeners* pListeners = aClientPos->second;\n\n \/\/ we do not need the entry in the clients map anymore\n \/\/ (do this before actually notifying, because some client implementations have re-entrance\n \/\/ problems and call into revokeClient while we are notifying from hereing)\n Clients::get().erase( aClientPos );\n\n \/\/ now really do the notification\n pListeners->disposeAndClear( aDisposalEvent );\n delete pListeners;\n\n }\n\n \/\/---------------------------------------------------------------------\n sal_Int32 AccessibleEventNotifier::addEventListener(\n const TClientId _nClient, const Reference< XAccessibleEventListener >& _rxListener ) SAL_THROW( ( ) )\n {\n ::osl::MutexGuard aGuard( lclMutex::get() );\n\n ClientMap::iterator aClientPos;\n if ( !implLookupClient( _nClient, aClientPos ) )\n \/\/ already asserted in implLookupClient\n return 0;\n\n if ( _rxListener.is() )\n aClientPos->second->addInterface( _rxListener );\n\n return aClientPos->second->getLength();\n }\n\n \/\/---------------------------------------------------------------------\n sal_Int32 AccessibleEventNotifier::removeEventListener(\n const TClientId _nClient, const Reference< XAccessibleEventListener >& _rxListener ) SAL_THROW( ( ) )\n {\n ::osl::MutexGuard aGuard( lclMutex::get() );\n\n ClientMap::iterator aClientPos;\n if ( !implLookupClient( _nClient, aClientPos ) )\n \/\/ already asserted in implLookupClient\n return 0;\n\n if ( _rxListener.is() )\n aClientPos->second->removeInterface( _rxListener );\n\n return aClientPos->second->getLength();\n }\n\n \/\/---------------------------------------------------------------------\n Sequence< Reference< XInterface > > AccessibleEventNotifier::getEventListeners( const TClientId _nClient ) SAL_THROW( ( ) )\n {\n Sequence< Reference< XInterface > > aListeners;\n\n ::osl::MutexGuard aGuard( lclMutex::get() );\n\n ClientMap::iterator aClientPos;\n if ( implLookupClient( _nClient, aClientPos ) )\n aListeners = aClientPos->second->getElements();\n\n return aListeners;\n }\n\n \/\/---------------------------------------------------------------------\n void AccessibleEventNotifier::addEvent( const TClientId _nClient, const AccessibleEventObject& _rEvent ) SAL_THROW( ( ) )\n {\n Sequence< Reference< XInterface > > aListeners;\n\n \/\/ --- <mutex lock> -------------------------------\n {\n ::osl::MutexGuard aGuard( lclMutex::get() );\n\n ClientMap::iterator aClientPos;\n if ( !implLookupClient( _nClient, aClientPos ) )\n \/\/ already asserted in implLookupClient\n return;\n\n \/\/ since we're synchronous, again, we want to notify immediately\n aListeners = aClientPos->second->getElements();\n }\n \/\/ --- <\/mutex lock> ------------------------------\n\n \/\/ default handling: loop through all listeners, and notify them\n const Reference< XInterface >* pListeners = aListeners.getConstArray();\n const Reference< XInterface >* pListenersEnd = pListeners + aListeners.getLength();\n while ( pListeners != pListenersEnd )\n {\n try\n {\n static_cast< XAccessibleEventListener* >( pListeners->get() )->notifyEvent( _rEvent );\n }\n catch( const Exception& e )\n {\n e;\n \/\/ silent this\n \/\/ no assertion, because a broken access remote bridge or something like this\n \/\/ can cause this exception\n }\n ++pListeners;\n }\n }\n\n\/\/.........................................................................\n} \/\/ namespace comphelper\n\/\/.........................................................................\n\n<|endoftext|>"} {"text":"<commit_before>#include \"torrentdetailscontentview.h\"\n\n#include <QMenu>\n#include <QFileInfo>\n#include <QDir>\n#include <QFocusEvent>\n#include <QApplication>\n#include \"utilities\/utils.h\"\n#include \"utilities\/filesystem_utils.h\"\n#include \"torrentcontentmodel.h\"\n#include \"global_functions.h\"\n\n#include <utility>\n\nTorrentDetailsContentView::TorrentDetailsContentView(QWidget* parent \/*= 0*\/): QTreeView(parent)\n{\n setContextMenuPolicy(Qt::CustomContextMenu);\n VERIFY(connect(this, SIGNAL(customContextMenuRequested(const QPoint&)), SLOT(on_showTreeTorentContextMenu(const QPoint&))));\n}\n\nvoid TorrentDetailsContentView::setModel(TorrentContentFilterModel* a_model)\n{\n QTreeView::setModel(a_model);\n\n VERIFY(connect(this, SIGNAL(doubleClicked(const QModelIndex&)), SLOT(on_ItemOpenFolder())));\n}\n\nTorrentContentFilterModel* TorrentDetailsContentView::model()\n{\n return static_cast<TorrentContentFilterModel*>(QTreeView::model());\n}\n\nvoid TorrentDetailsContentView::on_showTreeTorentContextMenu(const QPoint& pos)\n{\n QModelIndex index = indexAt(pos);\n if (index.isValid())\n {\n QMenu menu;\n menu.setObjectName(QStringLiteral(\"TorrentDetailsContextMenu\"));\n menu.addAction(QIcon(), tr(\"Open in folder\"), this, SLOT(on_ItemOpenFolder()));\n menu.addAction(QIcon(), tr(\"Open File\"), this, SLOT(on_ItemOpenFile()));\n\n menu.exec(QCursor::pos());\n }\n}\n\nvoid TorrentDetailsContentView::on_ItemOpenFolder()\n{\n QModelIndex curr_index = selectionModel()->currentIndex();\n if (!curr_index.isValid())\n {\n return;\n }\n\n TorrentContentModelItem* torrentItem = model()->getTorrentContentModelItem(curr_index);\n QString pathFile = torrentItem->getPath();\n if (pathFile.isEmpty())\n {\n pathFile = torrentItem->getName();\n }\n QString savePath = model()->model()->getSavePath();\n QString filename = savePath + pathFile;\n QFileInfo downloadFile(filename);\n utilities::SelectFile(downloadFile.absoluteFilePath(), downloadFile.dir().path());\n}\n\nvoid TorrentDetailsContentView::on_ItemOpenFile()\n{\n QModelIndex curr_index = selectionModel()->currentIndex();\n if (!curr_index.isValid())\n {\n return;\n }\n\n TorrentContentModelItem* torrentItem = model()->getTorrentContentModelItem(curr_index);\n QString pathFile = torrentItem->getPath();\n QString savePath = model()->model()->getSavePath();\n QString filename = savePath + pathFile;\n if (torrentItem->isFolder() || !QFile::exists(filename))\n {\n return;\n }\n\n global_functions::openFile(filename);\n}\n\nbool TorrentDetailsContentView::event(QEvent *event)\n{\n if (event->type() == QEvent::FocusOut\n && static_cast<QFocusEvent*>(event)->reason() == Qt::MouseFocusReason)\n {\n if (QWidget *widget = QApplication::focusWidget()) \n {\n const QModelIndexList selectedRows = selectionModel()->selectedRows(TorrentContentModelItem::COL_PRIO);\n for (const auto& idx : qAsConst(selectedRows))\n {\n if (indexWidget(idx) == widget)\n {\n return QAbstractScrollArea::event(event);\n }\n }\n }\n }\n\n return QTreeView::event(event);\n}\n\nvoid TorrentDetailsContentView::commitData(QWidget *editor)\n{\n QModelIndexList selectedRows = selectionModel()->selectedRows(TorrentContentModelItem::COL_PRIO);\n for (const auto& idx : qAsConst(selectedRows))\n {\n if (indexWidget(idx) == editor)\n {\n model()->setSelectedRows(std::move(selectedRows));\n break;\n }\n }\n\n QTreeView::commitData(editor);\n\n model()->setSelectedRows(QModelIndexList());\n}\n<commit_msg>context menu items fixed<commit_after>#include \"torrentdetailscontentview.h\"\n\n#include <QMenu>\n#include <QFileInfo>\n#include <QDir>\n#include <QFocusEvent>\n#include <QApplication>\n#include \"utilities\/utils.h\"\n#include \"utilities\/filesystem_utils.h\"\n#include \"torrentcontentmodel.h\"\n#include \"global_functions.h\"\n\n#include <utility>\n\nTorrentDetailsContentView::TorrentDetailsContentView(QWidget* parent \/*= 0*\/): QTreeView(parent)\n{\n setContextMenuPolicy(Qt::CustomContextMenu);\n VERIFY(connect(this, SIGNAL(customContextMenuRequested(const QPoint&)), SLOT(on_showTreeTorentContextMenu(const QPoint&))));\n}\n\nvoid TorrentDetailsContentView::setModel(TorrentContentFilterModel* a_model)\n{\n QTreeView::setModel(a_model);\n\n VERIFY(connect(this, SIGNAL(doubleClicked(const QModelIndex&)), SLOT(on_ItemOpenFolder())));\n}\n\nTorrentContentFilterModel* TorrentDetailsContentView::model()\n{\n return static_cast<TorrentContentFilterModel*>(QTreeView::model());\n}\n\nvoid TorrentDetailsContentView::on_showTreeTorentContextMenu(const QPoint& pos)\n{\n QModelIndex index = indexAt(pos);\n if (!index.isValid())\n {\n return;\n }\n\n TorrentContentModelItem* torrentItem = model()->getTorrentContentModelItem(index);\n QMenu menu;\n menu.setObjectName(QStringLiteral(\"TorrentDetailsContextMenu\"));\n menu.addAction(QIcon(), tr(\"Open in folder\"), this, SLOT(on_ItemOpenFolder()));\n if (!torrentItem->isFolder())\n {\n menu.addAction(QIcon(), tr(\"Open File\"), this, SLOT(on_ItemOpenFile()));\n }\n\n menu.exec(QCursor::pos());\n}\n\nvoid TorrentDetailsContentView::on_ItemOpenFolder()\n{\n QModelIndex curr_index = selectionModel()->currentIndex();\n if (!curr_index.isValid())\n {\n return;\n }\n\n TorrentContentModelItem* torrentItem = model()->getTorrentContentModelItem(curr_index);\n QString pathFile = torrentItem->getPath();\n if (pathFile.isEmpty())\n {\n pathFile = torrentItem->getName();\n }\n QString savePath = model()->model()->getSavePath();\n QString filename = savePath + pathFile;\n QFileInfo downloadFile(filename);\n utilities::SelectFile(downloadFile.absoluteFilePath(), downloadFile.dir().path());\n}\n\nvoid TorrentDetailsContentView::on_ItemOpenFile()\n{\n QModelIndex curr_index = selectionModel()->currentIndex();\n if (!curr_index.isValid())\n {\n return;\n }\n\n TorrentContentModelItem* torrentItem = model()->getTorrentContentModelItem(curr_index);\n QString pathFile = torrentItem->getPath();\n QString savePath = model()->model()->getSavePath();\n QString filename = savePath + pathFile;\n if (torrentItem->isFolder() || !QFile::exists(filename))\n {\n return;\n }\n\n global_functions::openFile(filename);\n}\n\nbool TorrentDetailsContentView::event(QEvent *event)\n{\n if (event->type() == QEvent::FocusOut\n && static_cast<QFocusEvent*>(event)->reason() == Qt::MouseFocusReason)\n {\n if (QWidget *widget = QApplication::focusWidget()) \n {\n const QModelIndexList selectedRows = selectionModel()->selectedRows(TorrentContentModelItem::COL_PRIO);\n for (const auto& idx : qAsConst(selectedRows))\n {\n if (indexWidget(idx) == widget)\n {\n return QAbstractScrollArea::event(event);\n }\n }\n }\n }\n\n return QTreeView::event(event);\n}\n\nvoid TorrentDetailsContentView::commitData(QWidget *editor)\n{\n QModelIndexList selectedRows = selectionModel()->selectedRows(TorrentContentModelItem::COL_PRIO);\n for (const auto& idx : qAsConst(selectedRows))\n {\n if (indexWidget(idx) == editor)\n {\n model()->setSelectedRows(std::move(selectedRows));\n break;\n }\n }\n\n QTreeView::commitData(editor);\n\n model()->setSelectedRows(QModelIndexList());\n}\n<|endoftext|>"} {"text":"<commit_before>\/* \n * Copyright 2009-2017 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\/csg\/nblistgrid_3body.h>\n\nnamespace votca { namespace csg {\n\nvoid NBListGrid_3Body::Generate(BeadList &list1, BeadList &list2, BeadList &list3, bool do_exclusions)\n{\n BeadList::iterator iter;\n _do_exclusions = do_exclusions;\n if(list1.empty()) return;\n if(list2.empty()) return;\n if(list3.empty()) return;\n\n \/\/check if all bead lists \"have\" the same topology\n assert(list1.getTopology() == list2.getTopology());\n assert(list1.getTopology() == list3.getTopology());\n assert(list2.getTopology() == list3.getTopology());\n Topology *top = _top = list1.getTopology();\n\n InitializeGrid(top->getBox());\n\n \/\/ Add all beads of list1 to _beads1\n for(iter = list1.begin(); iter != list1.end(); ++iter)\n getCell((*iter)->getPos())._beads1.push_back(*iter);\n \n \/\/ Add all beads of list2 to _beads2\n for(iter = list2.begin(); iter != list2.end(); ++iter)\n getCell((*iter)->getPos())._beads2.push_back(*iter);\n \n \/\/ Add all beads of list2 to _beads3\n for(iter = list3.begin(); iter != list3.end(); ++iter)\n getCell((*iter)->getPos())._beads3.push_back(*iter);\n\n \/\/loop over beads of list 1 again to get the correlations\n for(iter = list1.begin(); iter != list1.end(); ++iter) {\n cell_t &cell = getCell((*iter)->getPos());\n TestBead(cell, *iter); \n }\n \n}\n \nvoid NBListGrid_3Body::Generate(BeadList &list1, BeadList &list2, bool do_exclusions)\n{\n BeadList::iterator iter;\n _do_exclusions = do_exclusions;\n if(list1.empty()) return;\n if(list2.empty()) return;\n\n \/\/check if both bead lists \"have\" the same topology\n assert(list1.getTopology() == list2.getTopology());\n Topology *top = _top = list1.getTopology();\n\n InitializeGrid(top->getBox());\n\n \/\/ Add all beads of list1 to _beads1\n for(iter = list1.begin(); iter != list1.end(); ++iter)\n getCell((*iter)->getPos())._beads1.push_back(*iter);\n \n \/\/ Add all beads of list2 to _beads2\n for(iter = list2.begin(); iter != list2.end(); ++iter)\n getCell((*iter)->getPos())._beads2.push_back(*iter);\n \n \/\/In this case type2 and type3 are the same\n for(vector<cell_t>::iterator iter = _grid.begin(); iter != _grid.end(); ++iter){\n (*iter)._beads3 = (*iter)._beads2;\n }\n\n \/\/loop over beads of list 1 again to get the correlations\n for(iter = list1.begin(); iter != list1.end(); ++iter) {\n cell_t &cell = getCell((*iter)->getPos());\n TestBead(cell, *iter); \n }\n}\n\nvoid NBListGrid_3Body::Generate(BeadList &list, bool do_exclusions)\n{\n BeadList::iterator iter;\n _do_exclusions = do_exclusions;\n if(list.empty()) return;\n\n Topology *top = _top = list.getTopology();\n\n InitializeGrid(top->getBox());\n \n \/\/ Add all beads of list to all! bead lists of the cell\n for(iter = list.begin(); iter != list.end(); ++iter) \n getCell((*iter)->getPos())._beads1.push_back(*iter); \n \n for(vector<cell_t>::iterator iter = _grid.begin(); iter != _grid.end(); ++iter){\n (*iter)._beads2 = (*iter)._beads1;\n (*iter)._beads3 = (*iter)._beads1;\n }\n\n \/\/loop over beads again to get the correlations (as all of the same type here)\n for(iter = list.begin(); iter != list.end(); ++iter) {\n cell_t &cell = getCell((*iter)->getPos());\n TestBead(cell, *iter);\n }\n}\n\nvoid NBListGrid_3Body::InitializeGrid(const matrix &box)\n{\n _box_a = box.getCol(0);\n _box_b = box.getCol(1);\n _box_c = box.getCol(2);\n\n \/\/ create plane normals\n _norm_a = _box_b ^ _box_c;\n _norm_b = _box_c ^ _box_a;\n _norm_c = _box_a ^ _box_b;\n\n _norm_a.normalize();\n _norm_b.normalize();\n _norm_c.normalize();\n\n double la = _box_a * _norm_a;\n double lb = _box_b * _norm_b;\n double lc = _box_c * _norm_c;\n \n \/\/ calculate grid size, each grid has to be at least size of cut-off\n _box_Na = max((int)(fabs(la\/_cutoff)), 1);\n _box_Nb = max((int)(fabs(lb\/_cutoff)), 1);\n _box_Nc = max((int)(fabs(lc\/_cutoff)), 1);\n\n _norm_a = _norm_a \/ (_box_a*_norm_a)*(double)_box_Na;\n _norm_b = _norm_b \/ (_box_b*_norm_b)*(double)_box_Nb;\n _norm_c = _norm_c \/ (_box_c*_norm_c)*(double)_box_Nc;\n\n \/\/cout << \"grid size: \" << _box_Na << \"x\" << _box_Nb << \"x\" << _box_Nc << endl;\n _grid.resize(_box_Na*_box_Nb*_box_Nc);\n\n int a1,a2,b1,b2,c1,c2;\n \n a1 = b1 = c1 = -1;\n a2 = b2 = c2 = 1;\n\n if(_box_Na < 3) a2 = 0;\n if(_box_Nb < 3) b2 = 0;\n if(_box_Nc < 3) c2 = 0;\n\n if(_box_Na < 2) a1 = 0;\n if(_box_Nb < 2) b1 = 0;\n if(_box_Nc < 2) c1 = 0;\n\n \/\/ wow, setting up the neighbours is an ugly for construct!\n \/\/ loop from N..2*N to avoid if and only use %\n for(int a=_box_Na; a<2*_box_Na; ++a)\n for(int b=_box_Nb; b<2*_box_Nb; ++b)\n for(int c=_box_Nc; c<2*_box_Nc; ++c) {\n cell_t &cell = getCell(a%_box_Na, b%_box_Nb, c%_box_Nc);\n for(int aa=a+a1; aa<=a+a2; ++aa)\n for(int bb=b+b1; bb<=b+b2; ++bb)\n for(int cc=c+c1; cc<=c+c2; ++cc) {\n cell_t *c = &getCell(aa%_box_Na, bb%_box_Nb, cc%_box_Nc);\n \/\/test: for 3body algorithm: each cell is a neighbor of its own !!!\n \/\/if(c == &cell) continue; \/\/ ignore self\n cell._neighbours.push_back(\n &getCell(aa%_box_Na, bb%_box_Nb, cc%_box_Nc)\n );\n }\n }\n}\n\nNBListGrid_3Body::cell_t &NBListGrid_3Body::getCell(const vec &r)\n{\n int a = (int)floor(r*_norm_a);\n int b = (int)floor(r*_norm_b);\n int c = (int)floor(r*_norm_c);\n\n if(a<0) a = _box_Na + a%_box_Na;\n a %= _box_Na;\n\n if(b<0)\n b = _box_Nb + b%_box_Nb;\n b %= _box_Nb;\n\n if(c<0) c = _box_Nc + c%_box_Nc;\n c %= _box_Nc;\n\n return getCell(a,b,c);\n }\n\n\nvoid NBListGrid_3Body::TestBead(NBListGrid_3Body::cell_t &cell, Bead *bead)\n{\n BeadList::iterator iter2;\n BeadList::iterator iter3; \n vec u = bead->getPos();\n \n \/\/loop over all neighbors (this now includes the cell itself!) to iterate over all beads of type2 of the cell and its neighbors\n for(vector<cell_t*>::iterator iterc2=cell._neighbours.begin(); iterc2!=cell._neighbours.end(); ++iterc2) { \n for(iter2=(*(*iterc2))._beads2.begin(); iter2!=(*(*iterc2))._beads2.end(); ++iter2) {\n \n \n if(bead == *iter2) {\n continue;\n }\n \n\n \/\/loop again over all neighbors (this now includes the cell itself!) to iterate over all beads of type3 of the cell and its neighbors\n for(vector<cell_t*>::iterator iterc3=cell._neighbours.begin(); iterc3!=cell._neighbours.end(); ++iterc3) {\n for(iter3=(*(*iterc3))._beads3.begin(); iter3!=(*(*iterc3))._beads3.end(); ++iter3) {\n \n \/\/do not include the same beads twice in one triple!\n if(bead == *iter3) {\n continue;\n }\n if(*iter2 == *iter3) {\n continue;\n }\n \n vec v = (*iter2)->getPos(); \n vec z = (*iter3)->getPos();\n \n vec r12 = _top->BCShortestConnection(u, v);\n vec r13 = _top->BCShortestConnection(u, z); \n vec r23 = _top->BCShortestConnection(v, z); \n double d12 = abs(r12);\n double d13 = abs(r13); \n double d23 = abs(r23); \n \n \/\/to do: at the moment use only one cutoff value\n \/\/to do: so far only check the distance between bead 1 (central bead) and bead2 and bead 3\n if( (d12 < _cutoff) && (d13 < _cutoff) ){\n \/\/\/ experimental: at the moment exclude interaction as soon as one of the three pairs (1,2) (1,3) (2,3) is excluded!\n if(_do_exclusions)\n if( (_top->getExclusions().IsExcluded(bead, *iter2)) || (_top->getExclusions().IsExcluded(bead, *iter3)) || (_top->getExclusions().IsExcluded(*iter2, *iter3)) ) {\n continue;\n }\n if((*_match_function)(bead, *iter2, *iter3, r12, r13, r23, d12, d13, d23))\n if(!FindTriple(bead, *iter2, *iter3))\n AddTriple( _triple_creator(bead, *iter2, *iter3, r12, r13, r23));\n } \n \n \n }\n \n }\n \n } \n }\n\n\n}\n\n\n\n}}\n<commit_msg>Update nblistgrid_3body.cc<commit_after>\/* \n * Copyright 2009-2017 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\/csg\/nblistgrid_3body.h>\n\nnamespace votca { namespace csg {\n\nvoid NBListGrid_3Body::Generate(BeadList &list1, BeadList &list2, BeadList &list3, bool do_exclusions)\n{\n BeadList::iterator iter;\n _do_exclusions = do_exclusions;\n if(list1.empty()) return;\n if(list2.empty()) return;\n if(list3.empty()) return;\n\n \/\/check if all bead lists \"have\" the same topology\n assert(list1.getTopology() == list2.getTopology());\n assert(list1.getTopology() == list3.getTopology());\n assert(list2.getTopology() == list3.getTopology());\n Topology *top = _top = list1.getTopology();\n\n InitializeGrid(top->getBox());\n\n \/\/ Add all beads of list1 to _beads1\n for(iter = list1.begin(); iter != list1.end(); ++iter)\n getCell((*iter)->getPos())._beads1.push_back(*iter);\n \n \/\/ Add all beads of list2 to _beads2\n for(iter = list2.begin(); iter != list2.end(); ++iter)\n getCell((*iter)->getPos())._beads2.push_back(*iter);\n \n \/\/ Add all beads of list2 to _beads3\n for(iter = list3.begin(); iter != list3.end(); ++iter)\n getCell((*iter)->getPos())._beads3.push_back(*iter);\n\n \/\/loop over beads of list 1 again to get the correlations\n for(iter = list1.begin(); iter != list1.end(); ++iter) {\n cell_t &cell = getCell((*iter)->getPos());\n TestBead(cell, *iter); \n }\n \n}\n \nvoid NBListGrid_3Body::Generate(BeadList &list1, BeadList &list2, bool do_exclusions)\n{\n BeadList::iterator iter;\n _do_exclusions = do_exclusions;\n if(list1.empty()) return;\n if(list2.empty()) return;\n\n \/\/check if both bead lists \"have\" the same topology\n assert(list1.getTopology() == list2.getTopology());\n Topology *top = _top = list1.getTopology();\n\n InitializeGrid(top->getBox());\n\n \/\/ Add all beads of list1 to _beads1\n for(iter = list1.begin(); iter != list1.end(); ++iter)\n getCell((*iter)->getPos())._beads1.push_back(*iter);\n \n \/\/ Add all beads of list2 to _beads2\n for(iter = list2.begin(); iter != list2.end(); ++iter)\n getCell((*iter)->getPos())._beads2.push_back(*iter);\n \n \/\/In this case type2 and type3 are the same\n for(vector<cell_t>::iterator iter = _grid.begin(); iter != _grid.end(); ++iter){\n (*iter)._beads3 = (*iter)._beads2;\n }\n\n \/\/loop over beads of list 1 again to get the correlations\n for(iter = list1.begin(); iter != list1.end(); ++iter) {\n cell_t &cell = getCell((*iter)->getPos());\n TestBead(cell, *iter); \n }\n}\n\nvoid NBListGrid_3Body::Generate(BeadList &list, bool do_exclusions)\n{\n BeadList::iterator iter;\n _do_exclusions = do_exclusions;\n if(list.empty()) return;\n\n Topology *top = _top = list.getTopology();\n\n InitializeGrid(top->getBox());\n \n \/\/ Add all beads of list to all! bead lists of the cell\n for(iter = list.begin(); iter != list.end(); ++iter) \n getCell((*iter)->getPos())._beads1.push_back(*iter); \n \n for(vector<cell_t>::iterator iter = _grid.begin(); iter != _grid.end(); ++iter){\n (*iter)._beads2 = (*iter)._beads1;\n (*iter)._beads3 = (*iter)._beads1;\n }\n\n \/\/loop over beads again to get the correlations (as all of the same type here)\n for(iter = list.begin(); iter != list.end(); ++iter) {\n cell_t &cell = getCell((*iter)->getPos());\n TestBead(cell, *iter);\n }\n}\n\nvoid NBListGrid_3Body::InitializeGrid(const matrix &box)\n{\n _box_a = box.getCol(0);\n _box_b = box.getCol(1);\n _box_c = box.getCol(2);\n\n \/\/ create plane normals\n _norm_a = _box_b ^ _box_c;\n _norm_b = _box_c ^ _box_a;\n _norm_c = _box_a ^ _box_b;\n\n _norm_a.normalize();\n _norm_b.normalize();\n _norm_c.normalize();\n\n double la = _box_a * _norm_a;\n double lb = _box_b * _norm_b;\n double lc = _box_c * _norm_c;\n \n \/\/ calculate grid size, each grid has to be at least size of cut-off\n _box_Na = max((int)(fabs(la\/_cutoff)), 1);\n _box_Nb = max((int)(fabs(lb\/_cutoff)), 1);\n _box_Nc = max((int)(fabs(lc\/_cutoff)), 1);\n\n _norm_a = _norm_a \/ (_box_a*_norm_a)*(double)_box_Na;\n _norm_b = _norm_b \/ (_box_b*_norm_b)*(double)_box_Nb;\n _norm_c = _norm_c \/ (_box_c*_norm_c)*(double)_box_Nc;\n\n \/\/cout << \"grid size: \" << _box_Na << \"x\" << _box_Nb << \"x\" << _box_Nc << endl;\n _grid.resize(_box_Na*_box_Nb*_box_Nc);\n\n int a1,a2,b1,b2,c1,c2;\n \n a1 = b1 = c1 = -1;\n a2 = b2 = c2 = 1;\n\n if(_box_Na < 3) a2 = 0;\n if(_box_Nb < 3) b2 = 0;\n if(_box_Nc < 3) c2 = 0;\n\n if(_box_Na < 2) a1 = 0;\n if(_box_Nb < 2) b1 = 0;\n if(_box_Nc < 2) c1 = 0;\n\n \/\/ wow, setting up the neighbours is an ugly for construct!\n \/\/ loop from N..2*N to avoid if and only use %\n for(int a=_box_Na; a<2*_box_Na; ++a)\n for(int b=_box_Nb; b<2*_box_Nb; ++b)\n for(int c=_box_Nc; c<2*_box_Nc; ++c) {\n cell_t &cell = getCell(a%_box_Na, b%_box_Nb, c%_box_Nc);\n for(int aa=a+a1; aa<=a+a2; ++aa)\n for(int bb=b+b1; bb<=b+b2; ++bb)\n for(int cc=c+c1; cc<=c+c2; ++cc) {\n cell_t *c = &getCell(aa%_box_Na, bb%_box_Nb, cc%_box_Nc);\n \/\/test: for 3body algorithm: each cell is a neighbor of its own !!!\n cell._neighbours.push_back(\n &getCell(aa%_box_Na, bb%_box_Nb, cc%_box_Nc)\n );\n }\n }\n}\n\nNBListGrid_3Body::cell_t &NBListGrid_3Body::getCell(const vec &r)\n{\n int a = (int)floor(r*_norm_a);\n int b = (int)floor(r*_norm_b);\n int c = (int)floor(r*_norm_c);\n\n if(a<0) a = _box_Na + a%_box_Na;\n a %= _box_Na;\n\n if(b<0)\n b = _box_Nb + b%_box_Nb;\n b %= _box_Nb;\n\n if(c<0) c = _box_Nc + c%_box_Nc;\n c %= _box_Nc;\n\n return getCell(a,b,c);\n }\n\n\nvoid NBListGrid_3Body::TestBead(NBListGrid_3Body::cell_t &cell, Bead *bead)\n{\n BeadList::iterator iter2;\n BeadList::iterator iter3; \n vec u = bead->getPos();\n \n \/\/loop over all neighbors (this now includes the cell itself!) to iterate over all beads of type2 of the cell and its neighbors\n for(vector<cell_t*>::iterator iterc2=cell._neighbours.begin(); iterc2!=cell._neighbours.end(); ++iterc2) { \n for(iter2=(*(*iterc2))._beads2.begin(); iter2!=(*(*iterc2))._beads2.end(); ++iter2) {\n \n \n if(bead == *iter2) {\n continue;\n }\n \n\n \/\/loop again over all neighbors (this now includes the cell itself!) to iterate over all beads of type3 of the cell and its neighbors\n for(vector<cell_t*>::iterator iterc3=cell._neighbours.begin(); iterc3!=cell._neighbours.end(); ++iterc3) {\n for(iter3=(*(*iterc3))._beads3.begin(); iter3!=(*(*iterc3))._beads3.end(); ++iter3) {\n \n \/\/do not include the same beads twice in one triple!\n if(bead == *iter3) {\n continue;\n }\n if(*iter2 == *iter3) {\n continue;\n }\n \n vec v = (*iter2)->getPos(); \n vec z = (*iter3)->getPos();\n \n vec r12 = _top->BCShortestConnection(u, v);\n vec r13 = _top->BCShortestConnection(u, z); \n vec r23 = _top->BCShortestConnection(v, z); \n double d12 = abs(r12);\n double d13 = abs(r13); \n double d23 = abs(r23); \n \n \/\/to do: at the moment use only one cutoff value\n \/\/to do: so far only check the distance between bead 1 (central bead) and bead2 and bead 3\n if( (d12 < _cutoff) && (d13 < _cutoff) ){\n \/\/\/ experimental: at the moment exclude interaction as soon as one of the three pairs (1,2) (1,3) (2,3) is excluded!\n if(_do_exclusions)\n if( (_top->getExclusions().IsExcluded(bead, *iter2)) || (_top->getExclusions().IsExcluded(bead, *iter3)) || (_top->getExclusions().IsExcluded(*iter2, *iter3)) ) {\n continue;\n }\n if((*_match_function)(bead, *iter2, *iter3, r12, r13, r23, d12, d13, d23))\n if(!FindTriple(bead, *iter2, *iter3))\n AddTriple( _triple_creator(bead, *iter2, *iter3, r12, r13, r23));\n } \n \n \n }\n \n }\n \n } \n }\n\n\n}\n\n\n\n}}\n<|endoftext|>"} {"text":"<commit_before>\/\/=======================================================================\n\/\/ Copyright Baptiste Wicht 2011.\n\/\/ Distributed under the Boost Software License, Version 1.0.\n\/\/ (See accompanying file LICENSE_1_0.txt or copy at\n\/\/ http:\/\/www.boost.org\/LICENSE_1_0.txt)\n\/\/=======================================================================\n\n#include <iostream>\n#include <boost\/optional.hpp>\n\n#include \"Utils.hpp\"\n\n#include \"ltac\/PeepholeOptimizer.hpp\"\n\n#include \"mtac\/Utils.hpp\"\n\nusing namespace eddic;\n\n\/\/TODO Comment every optimization\n\nvoid optimize_statement(ltac::Statement& statement){\n if(boost::get<std::shared_ptr<ltac::Instruction>>(&statement)){\n auto instruction = boost::get<std::shared_ptr<ltac::Instruction>>(statement);\n\n if(instruction->op == ltac::Operator::MOV){\n \/\/MOV reg, 0 can be transformed into XOR reg, reg\n if(mtac::is<ltac::Register>(*instruction->arg1) && mtac::equals<int>(*instruction->arg2, 0)){\n instruction->op = ltac::Operator::XOR;\n instruction->arg2 = instruction->arg1;\n\n return;\n }\n }\n\n if(instruction->op == ltac::Operator::ADD){\n \/\/ADD reg, 1 can be transformed into INC reg\n if(mtac::is<ltac::Register>(*instruction->arg1) && mtac::equals<int>(*instruction->arg2, 1)){\n instruction->op = ltac::Operator::INC;\n instruction->arg2.reset();\n\n return;\n }\n \n \/\/ADD reg, -1 can be transformed into DEC reg\n if(mtac::is<ltac::Register>(*instruction->arg1) && mtac::equals<int>(*instruction->arg2, -1)){\n instruction->op = ltac::Operator::DEC;\n instruction->arg2.reset();\n\n return;\n }\n }\n \n if(instruction->op == ltac::Operator::SUB){\n \/\/SUB reg, 1 can be transformed into DEC reg\n if(mtac::is<ltac::Register>(*instruction->arg1) && mtac::equals<int>(*instruction->arg2, 1)){\n instruction->op = ltac::Operator::DEC;\n instruction->arg2.reset();\n\n return;\n }\n \n \/\/SUB reg, -1 can be transformed into INC reg\n if(mtac::is<ltac::Register>(*instruction->arg1) && mtac::equals<int>(*instruction->arg2, -1)){\n instruction->op = ltac::Operator::INC;\n instruction->arg2.reset();\n\n return;\n }\n }\n\n if(instruction->op == ltac::Operator::MUL){\n \/\/Optimize multiplications with SHIFTs or LEAs\n if(mtac::is<ltac::Register>(*instruction->arg1) && mtac::is<int>(*instruction->arg2)){\n int constant = boost::get<int>(*instruction->arg2);\n\n auto reg = boost::get<ltac::Register>(*instruction->arg1);\n \n if(isPowerOfTwo(constant)){\n instruction->op = ltac::Operator::SHIFT_LEFT;\n instruction->arg2 = powerOfTwo(constant);\n\n return;\n } \n \n if(constant == 3){\n instruction->op = ltac::Operator::LEA;\n instruction->arg2 = ltac::Address(reg, reg, 2, 0);\n\n return;\n } \n \n if(constant == 5){\n instruction->op = ltac::Operator::LEA;\n instruction->arg2 = ltac::Address(reg, reg, 4, 0);\n\n return;\n } \n \n if(constant == 9){\n instruction->op = ltac::Operator::LEA;\n instruction->arg2 = ltac::Address(reg, reg, 8, 0);\n\n return;\n } \n }\n }\n\n if(instruction->op == ltac::Operator::CMP_INT){\n \/\/Optimize comparisons with 0 with or reg, reg\n if(mtac::is<ltac::Register>(*instruction->arg1) && mtac::equals<int>(*instruction->arg2, 0)){\n instruction->op = ltac::Operator::OR;\n instruction->arg2 = instruction->arg1;\n\n return;\n }\n }\n }\n}\n\nvoid single_statement_optimizations(std::shared_ptr<ltac::Program> program){\n for(auto& function : program->functions){\n for(auto& statement : function->getStatements()){\n optimize_statement(statement);\n }\n }\n}\n\nvoid multiple_statement_optimizations(std::shared_ptr<ltac::Program> program){\n for(auto& function : program->functions){\n auto& statements = function->getStatements();\n\n for(size_t i = 1; i < statements.size(); ++i){\n auto& s1 = statements[i - 1];\n auto& s2 = statements[i];\n\n if(mtac::is<std::shared_ptr<ltac::Instruction>>(s1) && mtac::is<std::shared_ptr<ltac::Instruction>>(s2)){\n auto& i1 = boost::get<std::shared_ptr<ltac::Instruction>>(s1);\n auto& i2 = boost::get<std::shared_ptr<ltac::Instruction>>(s2);\n\n if(i1->op == ltac::Operator::LEAVE && i2->op == ltac::Operator::LEAVE){\n i2->op = ltac::Operator::NOP;\n }\n }\n }\n }\n}\n\nvoid eddic::ltac::optimize(std::shared_ptr<ltac::Program> program){\n single_statement_optimizations(program);\n multiple_statement_optimizations(program);\n}\n<commit_msg>Combine FREE_STACK Together a MOV reg, reg is useless<commit_after>\/\/=======================================================================\n\/\/ Copyright Baptiste Wicht 2011.\n\/\/ Distributed under the Boost Software License, Version 1.0.\n\/\/ (See accompanying file LICENSE_1_0.txt or copy at\n\/\/ http:\/\/www.boost.org\/LICENSE_1_0.txt)\n\/\/=======================================================================\n\n#include <iostream>\n#include <boost\/optional.hpp>\n\n#include \"Utils.hpp\"\n\n#include \"ltac\/PeepholeOptimizer.hpp\"\n\n#include \"mtac\/Utils.hpp\"\n\nusing namespace eddic;\n\n\/\/TODO Comment every optimization\n\nvoid optimize_statement(ltac::Statement& statement){\n if(boost::get<std::shared_ptr<ltac::Instruction>>(&statement)){\n auto instruction = boost::get<std::shared_ptr<ltac::Instruction>>(statement);\n\n if(instruction->op == ltac::Operator::MOV){\n \/\/MOV reg, 0 can be transformed into XOR reg, reg\n if(mtac::is<ltac::Register>(*instruction->arg1) && mtac::equals<int>(*instruction->arg2, 0)){\n instruction->op = ltac::Operator::XOR;\n instruction->arg2 = instruction->arg1;\n\n return;\n }\n\n if(mtac::is<ltac::Register>(*instruction->arg1) && mtac::is<ltac::Register>(*instruction->arg2)){\n auto& reg1 = boost::get<ltac::Register>(*instruction->arg1); \n auto& reg2 = boost::get<ltac::Register>(*instruction->arg2); \n \n \/\/MOV reg, reg is useless\n if(reg1 == reg2){\n instruction->op = ltac::Operator::NOP;\n instruction->arg1.reset();\n instruction->arg2.reset();\n }\n }\n }\n\n if(instruction->op == ltac::Operator::ADD){\n \/\/ADD reg, 1 can be transformed into INC reg\n if(mtac::is<ltac::Register>(*instruction->arg1) && mtac::equals<int>(*instruction->arg2, 1)){\n instruction->op = ltac::Operator::INC;\n instruction->arg2.reset();\n\n return;\n }\n \n \/\/ADD reg, -1 can be transformed into DEC reg\n if(mtac::is<ltac::Register>(*instruction->arg1) && mtac::equals<int>(*instruction->arg2, -1)){\n instruction->op = ltac::Operator::DEC;\n instruction->arg2.reset();\n\n return;\n }\n }\n \n if(instruction->op == ltac::Operator::SUB){\n \/\/SUB reg, 1 can be transformed into DEC reg\n if(mtac::is<ltac::Register>(*instruction->arg1) && mtac::equals<int>(*instruction->arg2, 1)){\n instruction->op = ltac::Operator::DEC;\n instruction->arg2.reset();\n\n return;\n }\n \n \/\/SUB reg, -1 can be transformed into INC reg\n if(mtac::is<ltac::Register>(*instruction->arg1) && mtac::equals<int>(*instruction->arg2, -1)){\n instruction->op = ltac::Operator::INC;\n instruction->arg2.reset();\n\n return;\n }\n }\n\n if(instruction->op == ltac::Operator::MUL){\n \/\/Optimize multiplications with SHIFTs or LEAs\n if(mtac::is<ltac::Register>(*instruction->arg1) && mtac::is<int>(*instruction->arg2)){\n int constant = boost::get<int>(*instruction->arg2);\n\n auto reg = boost::get<ltac::Register>(*instruction->arg1);\n \n if(isPowerOfTwo(constant)){\n instruction->op = ltac::Operator::SHIFT_LEFT;\n instruction->arg2 = powerOfTwo(constant);\n\n return;\n } \n \n if(constant == 3){\n instruction->op = ltac::Operator::LEA;\n instruction->arg2 = ltac::Address(reg, reg, 2, 0);\n\n return;\n } \n \n if(constant == 5){\n instruction->op = ltac::Operator::LEA;\n instruction->arg2 = ltac::Address(reg, reg, 4, 0);\n\n return;\n } \n \n if(constant == 9){\n instruction->op = ltac::Operator::LEA;\n instruction->arg2 = ltac::Address(reg, reg, 8, 0);\n\n return;\n } \n }\n }\n\n if(instruction->op == ltac::Operator::CMP_INT){\n \/\/Optimize comparisons with 0 with or reg, reg\n if(mtac::is<ltac::Register>(*instruction->arg1) && mtac::equals<int>(*instruction->arg2, 0)){\n instruction->op = ltac::Operator::OR;\n instruction->arg2 = instruction->arg1;\n\n return;\n }\n }\n }\n}\n\nvoid single_statement_optimizations(std::shared_ptr<ltac::Program> program){\n for(auto& function : program->functions){\n for(auto& statement : function->getStatements()){\n optimize_statement(statement);\n }\n }\n}\n\nvoid multiple_statement_optimizations(std::shared_ptr<ltac::Program> program){\n for(auto& function : program->functions){\n auto& statements = function->getStatements();\n\n for(size_t i = 1; i < statements.size(); ++i){\n auto& s1 = statements[i - 1];\n auto& s2 = statements[i];\n\n if(mtac::is<std::shared_ptr<ltac::Instruction>>(s1) && mtac::is<std::shared_ptr<ltac::Instruction>>(s2)){\n auto& i1 = boost::get<std::shared_ptr<ltac::Instruction>>(s1);\n auto& i2 = boost::get<std::shared_ptr<ltac::Instruction>>(s2);\n\n \/\/The seconde LEAVE is dead\n if(i1->op == ltac::Operator::LEAVE && i2->op == ltac::Operator::LEAVE){\n i2->op = ltac::Operator::NOP;\n }\n\n \/\/Combine two FREE STACK into one\n if(i1->op == ltac::Operator::FREE_STACK && i2->op == ltac::Operator::FREE_STACK){\n i1->arg1 = boost::get<int>(*i1->arg1) + boost::get<int>(*i2->arg1);\n i2->arg1.reset();\n i2->op = ltac::Operator::NOP;\n }\n }\n }\n }\n}\n\nvoid eddic::ltac::optimize(std::shared_ptr<ltac::Program> program){\n single_statement_optimizations(program);\n multiple_statement_optimizations(program);\n}\n<|endoftext|>"} {"text":"<commit_before>\/\/=======================================================================\n\/\/ Copyright Baptiste Wicht 2011.\n\/\/ Distributed under the Boost Software License, Version 1.0.\n\/\/ (See accompanying file LICENSE_1_0.txt or copy at\n\/\/ http:\/\/www.boost.org\/LICENSE_1_0.txt)\n\/\/=======================================================================\n\n#include <iostream>\n#include <boost\/optional.hpp>\n\n#include \"Utils.hpp\"\n#include \"PerfsTimer.hpp\"\n\n#include \"ltac\/PeepholeOptimizer.hpp\"\n\n#include \"mtac\/Utils.hpp\"\n\nusing namespace eddic;\n\ntemplate<typename T>\ninline bool is_reg(T value){\n return mtac::is<ltac::Register>(value);\n}\n\ninline void optimize_statement(ltac::Statement& statement){\n if(boost::get<std::shared_ptr<ltac::Instruction>>(&statement)){\n auto instruction = boost::get<std::shared_ptr<ltac::Instruction>>(statement);\n\n if(instruction->op == ltac::Operator::MOV){\n \/\/MOV reg, 0 can be transformed into XOR reg, reg\n if(is_reg(*instruction->arg1) && mtac::equals<int>(*instruction->arg2, 0)){\n instruction->op = ltac::Operator::XOR;\n instruction->arg2 = instruction->arg1;\n\n return;\n }\n\n if(is_reg(*instruction->arg1) && is_reg(*instruction->arg2)){\n auto& reg1 = boost::get<ltac::Register>(*instruction->arg1); \n auto& reg2 = boost::get<ltac::Register>(*instruction->arg2); \n \n \/\/MOV reg, reg is useless\n if(reg1 == reg2){\n instruction->op = ltac::Operator::NOP;\n instruction->arg1.reset();\n instruction->arg2.reset();\n }\n }\n }\n\n if(instruction->op == ltac::Operator::ADD){\n \/\/ADD reg, 1 can be transformed into INC reg\n if(is_reg(*instruction->arg1) && mtac::equals<int>(*instruction->arg2, 1)){\n instruction->op = ltac::Operator::INC;\n instruction->arg2.reset();\n\n return;\n }\n \n \/\/ADD reg, -1 can be transformed into DEC reg\n if(is_reg(*instruction->arg1) && mtac::equals<int>(*instruction->arg2, -1)){\n instruction->op = ltac::Operator::DEC;\n instruction->arg2.reset();\n\n return;\n }\n }\n \n if(instruction->op == ltac::Operator::SUB){\n \/\/SUB reg, 1 can be transformed into DEC reg\n if(is_reg(*instruction->arg1) && mtac::equals<int>(*instruction->arg2, 1)){\n instruction->op = ltac::Operator::DEC;\n instruction->arg2.reset();\n\n return;\n }\n \n \/\/SUB reg, -1 can be transformed into INC reg\n if(is_reg(*instruction->arg1) && mtac::equals<int>(*instruction->arg2, -1)){\n instruction->op = ltac::Operator::INC;\n instruction->arg2.reset();\n\n return;\n }\n }\n\n if(instruction->op == ltac::Operator::MUL){\n \/\/Optimize multiplications with SHIFTs or LEAs\n if(is_reg(*instruction->arg1) && mtac::is<int>(*instruction->arg2)){\n int constant = boost::get<int>(*instruction->arg2);\n\n auto reg = boost::get<ltac::Register>(*instruction->arg1);\n \n if(isPowerOfTwo(constant)){\n instruction->op = ltac::Operator::SHIFT_LEFT;\n instruction->arg2 = powerOfTwo(constant);\n\n return;\n } \n \n if(constant == 3){\n instruction->op = ltac::Operator::LEA;\n instruction->arg2 = ltac::Address(reg, reg, 2, 0);\n\n return;\n } \n \n if(constant == 5){\n instruction->op = ltac::Operator::LEA;\n instruction->arg2 = ltac::Address(reg, reg, 4, 0);\n\n return;\n } \n \n if(constant == 9){\n instruction->op = ltac::Operator::LEA;\n instruction->arg2 = ltac::Address(reg, reg, 8, 0);\n\n return;\n } \n }\n }\n\n if(instruction->op == ltac::Operator::CMP_INT){\n \/\/Optimize comparisons with 0 with or reg, reg\n if(is_reg(*instruction->arg1) && mtac::equals<int>(*instruction->arg2, 0)){\n instruction->op = ltac::Operator::OR;\n instruction->arg2 = instruction->arg1;\n\n return;\n }\n }\n }\n}\n\ninline void multiple_statement_optimizations(ltac::Statement& s1, ltac::Statement& s2){\n if(mtac::is<std::shared_ptr<ltac::Instruction>>(s1) && mtac::is<std::shared_ptr<ltac::Instruction>>(s2)){\n auto& i1 = boost::get<std::shared_ptr<ltac::Instruction>>(s1);\n auto& i2 = boost::get<std::shared_ptr<ltac::Instruction>>(s2);\n\n \/\/The seconde LEAVE is dead\n if(i1->op == ltac::Operator::LEAVE && i2->op == ltac::Operator::LEAVE){\n i2->op = ltac::Operator::NOP;\n }\n\n \/\/Combine two FREE STACK into one\n if(i1->op == ltac::Operator::FREE_STACK && i2->op == ltac::Operator::FREE_STACK){\n i1->arg1 = boost::get<int>(*i1->arg1) + boost::get<int>(*i2->arg1);\n i2->arg1.reset();\n i2->op = ltac::Operator::NOP;\n }\n\n if(i1->op == ltac::Operator::MOV && i2->op == ltac::Operator::MOV){\n if(is_reg(*i1->arg1) && is_reg(*i1->arg2) && is_reg(*i2->arg1) && is_reg(*i2->arg2)){\n auto reg11 = boost::get<ltac::Register>(*i1->arg1);\n auto reg12 = boost::get<ltac::Register>(*i1->arg2);\n auto reg21 = boost::get<ltac::Register>(*i2->arg1);\n auto reg22 = boost::get<ltac::Register>(*i2->arg2);\n\n \/\/cross MOV (ir4 = ir5, ir5 = ir4), keep only the first\n if (reg11 == reg22 && reg12 == reg21){\n i2->op = ltac::Operator::NOP;\n }\n } else if(is_reg(*i1->arg1) && is_reg(*i2->arg1)){\n auto reg11 = boost::get<ltac::Register>(*i1->arg1);\n auto reg21 = boost::get<ltac::Register>(*i2->arg1);\n\n \/\/Two MOV to the same register => keep only last MOV\n if(reg11 == reg21){\n i1->op = ltac::Operator::NOP;\n }\n } else if(is_reg(*i1->arg1) && is_reg(*i2->arg2)){\n if(boost::get<ltac::Address>(&*i1->arg2) && boost::get<ltac::Address>(&*i2->arg1)){\n if(boost::get<ltac::Address>(*i1->arg2) == boost::get<ltac::Address>(*i2->arg1)){\n i2->op = ltac::Operator::NOP;\n i2->arg1.reset();\n i2->arg2.reset();\n }\n }\n } else if(is_reg(*i1->arg2) && is_reg(*i2->arg1)){\n if(boost::get<ltac::Address>(&*i1->arg1) && boost::get<ltac::Address>(&*i2->arg2)){\n if(boost::get<ltac::Address>(*i1->arg1) == boost::get<ltac::Address>(*i2->arg2)){\n i2->op = ltac::Operator::NOP;\n i2->arg1.reset();\n i2->arg2.reset();\n }\n }\n }\n }\n\n if(i1->op == ltac::Operator::MOV && i2->op == ltac::Operator::ADD){\n if(is_reg(*i1->arg1) && is_reg(*i2->arg1)){\n if(boost::get<ltac::Register>(*i1->arg1) == boost::get<ltac::Register>(*i2->arg1)){\n if(boost::get<ltac::Register>(&*i1->arg2) && boost::get<int>(&*i2->arg2)){\n i2->op = ltac::Operator::LEA;\n i2->arg2 = ltac::Address(boost::get<ltac::Register>(*i1->arg2), boost::get<int>(*i2->arg2));\n\n i1->op = ltac::Operator::NOP;\n i1->arg1.reset();\n i1->arg2.reset();\n } else if(boost::get<std::string>(&*i1->arg2) && boost::get<int>(&*i2->arg2)){\n i2->op = ltac::Operator::LEA;\n i2->arg2 = ltac::Address(boost::get<std::string>(*i1->arg2), boost::get<int>(*i2->arg2));\n\n i1->op = ltac::Operator::NOP;\n i1->arg1.reset();\n i1->arg2.reset();\n }\n }\n }\n }\n }\n}\n\ninline bool is_nop(ltac::Statement& statement){\n if(mtac::is<std::shared_ptr<ltac::Instruction>>(statement)){\n auto instruction = boost::get<std::shared_ptr<ltac::Instruction>>(statement);\n\n if(instruction->op == ltac::Operator::NOP){\n return true;\n }\n }\n\n return false;\n}\n\nvoid basic_optimizations(std::shared_ptr<ltac::Function> function){\n auto& statements = function->getStatements();\n\n auto it = statements.begin();\n auto end = statements.end() - 1;\n\n while(it != end){\n auto& s1 = *it;\n auto& s2 = *(it + 1);\n\n \/\/Optimizations that looks at only one statement\n optimize_statement(s1);\n\n \/\/Optimizations that looks at several statements at once\n multiple_statement_optimizations(s1, s2);\n\n if(is_nop(s1)){\n it = statements.erase(it);\n end = statements.end() - 1;\n\n continue;\n }\n\n ++it;\n }\n}\n\nvoid eddic::ltac::optimize(std::shared_ptr<ltac::Program> program){\n PerfsTimer(\"Peephole optimizations\", true);\n\n \/\/TODO Make something comparable to the optimization model for MTAC\n for(int i = 0; i < 2; ++i){\n for(auto& function : program->functions){\n basic_optimizations(function);\n }\n }\n}\n<commit_msg>Improve the optimization model for the peephole optimizer<commit_after>\/\/=======================================================================\n\/\/ Copyright Baptiste Wicht 2011.\n\/\/ Distributed under the Boost Software License, Version 1.0.\n\/\/ (See accompanying file LICENSE_1_0.txt or copy at\n\/\/ http:\/\/www.boost.org\/LICENSE_1_0.txt)\n\/\/=======================================================================\n\n#include <iostream>\n#include <boost\/optional.hpp>\n\n#include \"Utils.hpp\"\n#include \"PerfsTimer.hpp\"\n\n#include \"ltac\/PeepholeOptimizer.hpp\"\n\n#include \"mtac\/Utils.hpp\"\n\nusing namespace eddic;\n\ntemplate<typename T>\ninline bool is_reg(T value){\n return mtac::is<ltac::Register>(value);\n}\n\ninline bool optimize_statement(ltac::Statement& statement){\n if(boost::get<std::shared_ptr<ltac::Instruction>>(&statement)){\n auto instruction = boost::get<std::shared_ptr<ltac::Instruction>>(statement);\n\n if(instruction->op == ltac::Operator::MOV){\n \/\/MOV reg, 0 can be transformed into XOR reg, reg\n if(is_reg(*instruction->arg1) && mtac::equals<int>(*instruction->arg2, 0)){\n instruction->op = ltac::Operator::XOR;\n instruction->arg2 = instruction->arg1;\n\n return true;\n }\n\n if(is_reg(*instruction->arg1) && is_reg(*instruction->arg2)){\n auto& reg1 = boost::get<ltac::Register>(*instruction->arg1); \n auto& reg2 = boost::get<ltac::Register>(*instruction->arg2); \n \n \/\/MOV reg, reg is useless\n if(reg1 == reg2){\n instruction->op = ltac::Operator::NOP;\n instruction->arg1.reset();\n instruction->arg2.reset();\n \n return true;\n }\n }\n }\n\n if(instruction->op == ltac::Operator::ADD){\n \/\/ADD reg, 1 can be transformed into INC reg\n if(is_reg(*instruction->arg1) && mtac::equals<int>(*instruction->arg2, 1)){\n instruction->op = ltac::Operator::INC;\n instruction->arg2.reset();\n\n return true;\n }\n \n \/\/ADD reg, -1 can be transformed into DEC reg\n if(is_reg(*instruction->arg1) && mtac::equals<int>(*instruction->arg2, -1)){\n instruction->op = ltac::Operator::DEC;\n instruction->arg2.reset();\n\n return true;\n }\n }\n \n if(instruction->op == ltac::Operator::SUB){\n \/\/SUB reg, 1 can be transformed into DEC reg\n if(is_reg(*instruction->arg1) && mtac::equals<int>(*instruction->arg2, 1)){\n instruction->op = ltac::Operator::DEC;\n instruction->arg2.reset();\n\n return true;\n }\n \n \/\/SUB reg, -1 can be transformed into INC reg\n if(is_reg(*instruction->arg1) && mtac::equals<int>(*instruction->arg2, -1)){\n instruction->op = ltac::Operator::INC;\n instruction->arg2.reset();\n\n return true;\n }\n }\n\n if(instruction->op == ltac::Operator::MUL){\n \/\/Optimize multiplications with SHIFTs or LEAs\n if(is_reg(*instruction->arg1) && mtac::is<int>(*instruction->arg2)){\n int constant = boost::get<int>(*instruction->arg2);\n\n auto reg = boost::get<ltac::Register>(*instruction->arg1);\n \n if(isPowerOfTwo(constant)){\n instruction->op = ltac::Operator::SHIFT_LEFT;\n instruction->arg2 = powerOfTwo(constant);\n\n return true;\n } \n \n if(constant == 3){\n instruction->op = ltac::Operator::LEA;\n instruction->arg2 = ltac::Address(reg, reg, 2, 0);\n\n return true;\n } \n \n if(constant == 5){\n instruction->op = ltac::Operator::LEA;\n instruction->arg2 = ltac::Address(reg, reg, 4, 0);\n\n return true;\n } \n \n if(constant == 9){\n instruction->op = ltac::Operator::LEA;\n instruction->arg2 = ltac::Address(reg, reg, 8, 0);\n\n return true;\n } \n }\n }\n\n if(instruction->op == ltac::Operator::CMP_INT){\n \/\/Optimize comparisons with 0 with or reg, reg\n if(is_reg(*instruction->arg1) && mtac::equals<int>(*instruction->arg2, 0)){\n instruction->op = ltac::Operator::OR;\n instruction->arg2 = instruction->arg1;\n\n return true;\n }\n }\n }\n\n return false;\n}\n\ninline bool multiple_statement_optimizations(ltac::Statement& s1, ltac::Statement& s2){\n if(mtac::is<std::shared_ptr<ltac::Instruction>>(s1) && mtac::is<std::shared_ptr<ltac::Instruction>>(s2)){\n auto& i1 = boost::get<std::shared_ptr<ltac::Instruction>>(s1);\n auto& i2 = boost::get<std::shared_ptr<ltac::Instruction>>(s2);\n\n \/\/The seconde LEAVE is dead\n if(i1->op == ltac::Operator::LEAVE && i2->op == ltac::Operator::LEAVE){\n i2->op = ltac::Operator::NOP;\n \n return true;\n }\n\n \/\/Combine two FREE STACK into one\n if(i1->op == ltac::Operator::FREE_STACK && i2->op == ltac::Operator::FREE_STACK){\n i1->arg1 = boost::get<int>(*i1->arg1) + boost::get<int>(*i2->arg1);\n \n i2->op = ltac::Operator::NOP;\n i2->arg1.reset();\n \n return true;\n }\n\n if(i1->op == ltac::Operator::MOV && i2->op == ltac::Operator::MOV){\n if(is_reg(*i1->arg1) && is_reg(*i1->arg2) && is_reg(*i2->arg1) && is_reg(*i2->arg2)){\n auto reg11 = boost::get<ltac::Register>(*i1->arg1);\n auto reg12 = boost::get<ltac::Register>(*i1->arg2);\n auto reg21 = boost::get<ltac::Register>(*i2->arg1);\n auto reg22 = boost::get<ltac::Register>(*i2->arg2);\n\n \/\/cross MOV (ir4 = ir5, ir5 = ir4), keep only the first\n if (reg11 == reg22 && reg12 == reg21){\n i2->op = ltac::Operator::NOP;\n \n return true;\n }\n } else if(is_reg(*i1->arg1) && is_reg(*i2->arg1)){\n auto reg11 = boost::get<ltac::Register>(*i1->arg1);\n auto reg21 = boost::get<ltac::Register>(*i2->arg1);\n\n \/\/Two MOV to the same register => keep only last MOV\n if(reg11 == reg21){\n i1->op = ltac::Operator::NOP;\n \n return true;\n }\n } else if(is_reg(*i1->arg1) && is_reg(*i2->arg2)){\n if(boost::get<ltac::Address>(&*i1->arg2) && boost::get<ltac::Address>(&*i2->arg1)){\n if(boost::get<ltac::Address>(*i1->arg2) == boost::get<ltac::Address>(*i2->arg1)){\n i2->op = ltac::Operator::NOP;\n i2->arg1.reset();\n i2->arg2.reset();\n \n return true;\n }\n }\n } else if(is_reg(*i1->arg2) && is_reg(*i2->arg1)){\n if(boost::get<ltac::Address>(&*i1->arg1) && boost::get<ltac::Address>(&*i2->arg2)){\n if(boost::get<ltac::Address>(*i1->arg1) == boost::get<ltac::Address>(*i2->arg2)){\n i2->op = ltac::Operator::NOP;\n i2->arg1.reset();\n i2->arg2.reset();\n \n return true;\n }\n }\n }\n }\n\n if(i1->op == ltac::Operator::MOV && i2->op == ltac::Operator::ADD){\n if(is_reg(*i1->arg1) && is_reg(*i2->arg1)){\n if(boost::get<ltac::Register>(*i1->arg1) == boost::get<ltac::Register>(*i2->arg1)){\n if(boost::get<ltac::Register>(&*i1->arg2) && boost::get<int>(&*i2->arg2)){\n i2->op = ltac::Operator::LEA;\n i2->arg2 = ltac::Address(boost::get<ltac::Register>(*i1->arg2), boost::get<int>(*i2->arg2));\n\n i1->op = ltac::Operator::NOP;\n i1->arg1.reset();\n i1->arg2.reset();\n \n return true;\n } else if(boost::get<std::string>(&*i1->arg2) && boost::get<int>(&*i2->arg2)){\n i2->op = ltac::Operator::LEA;\n i2->arg2 = ltac::Address(boost::get<std::string>(*i1->arg2), boost::get<int>(*i2->arg2));\n\n i1->op = ltac::Operator::NOP;\n i1->arg1.reset();\n i1->arg2.reset();\n \n return true;\n }\n }\n }\n }\n }\n\n return false;\n}\n\ninline bool is_nop(ltac::Statement& statement){\n if(mtac::is<std::shared_ptr<ltac::Instruction>>(statement)){\n auto instruction = boost::get<std::shared_ptr<ltac::Instruction>>(statement);\n\n if(instruction->op == ltac::Operator::NOP){\n return true;\n }\n }\n\n return false;\n}\n\nbool basic_optimizations(std::shared_ptr<ltac::Function> function){\n auto& statements = function->getStatements();\n\n auto it = statements.begin();\n auto end = statements.end() - 1;\n\n bool optimized = false;\n\n while(it != end){\n auto& s1 = *it;\n auto& s2 = *(it + 1);\n\n \/\/Optimizations that looks at only one statement\n optimized |= optimize_statement(s1);\n\n \/\/Optimizations that looks at several statements at once\n optimized |= multiple_statement_optimizations(s1, s2);\n\n if(is_nop(s1)){\n it = statements.erase(it);\n end = statements.end() - 1;\n\n continue;\n }\n\n ++it;\n }\n\n return optimized;\n}\n\nvoid eddic::ltac::optimize(std::shared_ptr<ltac::Program> program){\n PerfsTimer(\"Peephole optimizations\", true);\n\n for(auto& function : program->functions){\n bool optimized;\n do {\n optimized = false;\n \n optimized |= basic_optimizations(function);\n } while(optimized);\n }\n}\n<|endoftext|>"} {"text":"<commit_before>\/\/ Copyright 2018 The Amber Authors.\n\/\/\n\/\/ Licensed under the Apache License, Version 2.0 (the \"License\");\n\/\/ you may not use this file except in compliance with the License.\n\/\/ You may obtain a copy of the License at\n\/\/\n\/\/ http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n\/\/\n\/\/ Unless required by applicable law or agreed to in writing, software\n\/\/ distributed under the License is distributed on an \"AS IS\" BASIS,\n\/\/ WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n\/\/ See the License for the specific language governing permissions and\n\/\/ limitations under the License.\n\n#include <cassert>\n#include <cstdlib>\n#include <fstream>\n#include <iostream>\n#include <set>\n#include <utility>\n#include <vector>\n\n#include \"amber\/amber.h\"\n#include \"amber\/recipe.h\"\n#include \"samples\/config_helper.h\"\n#include \"samples\/ppm.h\"\n#include \"src\/build-versions.h\"\n#include \"src\/make_unique.h\"\n\nnamespace {\n\nstruct Options {\n std::vector<std::string> input_filenames;\n\n std::string image_filename;\n std::string buffer_filename;\n int64_t buffer_binding_index = 0;\n uint32_t engine_major = 1;\n uint32_t engine_minor = 0;\n bool parse_only = false;\n bool disable_validation_layer = false;\n bool show_summary = false;\n bool show_help = false;\n bool show_version_info = false;\n amber::EngineType engine = amber::kEngineTypeVulkan;\n std::string spv_env;\n};\n\nconst char kUsage[] = R\"(Usage: amber [options] SCRIPT [SCRIPTS...]\n\n options:\n -p -- Parse input files only; Don't execute.\n -s -- Print summary of pass\/failure.\n -d -- Disable validation layers.\n -t <spirv_env> -- The target SPIR-V environment. Defaults to SPV_ENV_UNIVERSAL_1_0.\n -i <filename> -- Write rendering to <filename> as a PPM image.\n -b <filename> -- Write contents of a UBO or SSBO to <filename>.\n -B <buffer> -- Index of buffer to write. Defaults buffer 0.\n -e <engine> -- Specify graphics engine: vulkan, dawn. Default is vulkan.\n -v <engine version> -- Engine version (eg, 1.1 for Vulkan). Default 1.0.\n -V, --version -- Output version information for Amber and libraries.\n -h -- This help text.\n)\";\n\nbool ParseArgs(const std::vector<std::string>& args, Options* opts) {\n for (size_t i = 1; i < args.size(); ++i) {\n const std::string& arg = args[i];\n if (arg == \"-i\") {\n ++i;\n if (i >= args.size()) {\n std::cerr << \"Missing value for -i argument.\" << std::endl;\n return false;\n }\n opts->image_filename = args[i];\n\n } else if (arg == \"-b\") {\n ++i;\n if (i >= args.size()) {\n std::cerr << \"Missing value for -b argument.\" << std::endl;\n return false;\n }\n opts->buffer_filename = args[i];\n\n } else if (arg == \"-B\") {\n ++i;\n if (i >= args.size()) {\n std::cerr << \"Missing value for -B argument.\" << std::endl;\n return false;\n }\n opts->buffer_binding_index =\n static_cast<int64_t>(strtol(args[i].c_str(), nullptr, 10));\n\n if (opts->buffer_binding_index < 0U) {\n std::cerr << \"Invalid value for -B, must be 0 or greater.\" << std::endl;\n return false;\n }\n\n } else if (arg == \"-e\") {\n ++i;\n if (i >= args.size()) {\n std::cerr << \"Missing value for -e argument.\" << std::endl;\n return false;\n }\n const std::string& engine = args[i];\n if (engine == \"vulkan\") {\n opts->engine = amber::kEngineTypeVulkan;\n } else if (engine == \"dawn\") {\n opts->engine = amber::kEngineTypeDawn;\n } else {\n std::cerr\n << \"Invalid value for -e argument. Must be one of: vulkan dawn\"\n << std::endl;\n return false;\n }\n } else if (arg == \"-t\") {\n ++i;\n if (i >= args.size()) {\n std::cerr << \"Missing value for -t argument.\" << std::endl;\n return false;\n }\n opts->spv_env = args[i];\n } else if (arg == \"-h\" || arg == \"--help\") {\n opts->show_help = true;\n } else if (arg == \"-v\") {\n ++i;\n if (i >= args.size()) {\n std::cerr << \"Missing value for -v argument.\" << std::endl;\n return false;\n }\n const std::string& ver = args[i];\n\n size_t dot_pos = 0;\n int32_t val = std::stoi(ver, &dot_pos);\n if (val < 0) {\n std::cerr << \"Version major must be non-negative\" << std::endl;\n return false;\n }\n\n opts->engine_major = static_cast<uint32_t>(val);\n if (dot_pos != std::string::npos && (dot_pos + 1) < ver.size()) {\n val = std::stoi(ver.substr(dot_pos + 1));\n if (val < 0) {\n std::cerr << \"Version minor must be non-negative\" << std::endl;\n return false;\n }\n opts->engine_minor = static_cast<uint32_t>(val);\n }\n } else if (arg == \"-V\" || arg == \"--version\") {\n opts->show_version_info = true;\n } else if (arg == \"-p\") {\n opts->parse_only = true;\n } else if (arg == \"-d\") {\n opts->disable_validation_layer = true;\n } else if (arg == \"-s\") {\n opts->show_summary = true;\n } else if (arg.size() > 0 && arg[0] == '-') {\n std::cerr << \"Unrecognized option \" << arg << std::endl;\n return false;\n } else if (!arg.empty()) {\n opts->input_filenames.push_back(arg);\n }\n }\n\n return true;\n}\n\nstd::string ReadFile(const std::string& input_file) {\n FILE* file = nullptr;\n#if defined(_MSC_VER)\n fopen_s(&file, input_file.c_str(), \"rb\");\n#else\n file = fopen(input_file.c_str(), \"rb\");\n#endif\n if (!file) {\n std::cerr << \"Failed to open \" << input_file << std::endl;\n return {};\n }\n\n fseek(file, 0, SEEK_END);\n uint64_t tell_file_size = static_cast<uint64_t>(ftell(file));\n if (tell_file_size <= 0) {\n std::cerr << \"Input file of incorrect size: \" << input_file << std::endl;\n return {};\n }\n fseek(file, 0, SEEK_SET);\n\n size_t file_size = static_cast<size_t>(tell_file_size);\n\n std::vector<char> data;\n data.resize(file_size);\n\n size_t bytes_read = fread(data.data(), sizeof(char), file_size, file);\n fclose(file);\n if (bytes_read != file_size) {\n std::cerr << \"Failed to read \" << input_file << std::endl;\n return {};\n }\n\n return std::string(data.begin(), data.end());\n}\n\n} \/\/ namespace\n\nint main(int argc, const char** argv) {\n std::vector<std::string> args(argv, argv + argc);\n Options options;\n\n if (!ParseArgs(args, &options)) {\n std::cerr << \"Failed to parse arguments.\" << std::endl;\n return 1;\n }\n\n if (options.show_version_info) {\n std::cout << \"Amber : \" << AMBER_VERSION << std::endl;\n#if AMBER_ENABLE_SPIRV_TOOLS\n std::cout << \"SPIRV-Tools : \" << SPIRV_TOOLS_VERSION << std::endl;\n std::cout << \"SPIRV-Headers: \" << SPIRV_HEADERS_VERSION << std::endl;\n#endif \/\/ AMBER_ENABLE_SPIRV_TOOLS\n#if AMBER_ENABLE_SHADERC\n std::cout << \"GLSLang : \" << GLSLANG_VERSION << std::endl;\n std::cout << \"Shaderc : \" << SHADERC_VERSION << std::endl;\n#endif \/\/ AMBER_ENABLE_SHADERC\n }\n\n if (options.show_help) {\n std::cout << kUsage << std::endl;\n return 0;\n }\n\n if (options.input_filenames.empty()) {\n std::cerr << \"Input file must be provided.\" << std::endl;\n return 2;\n }\n\n amber::Result result;\n std::vector<std::string> failures;\n struct RecipeData {\n std::string file;\n std::unique_ptr<amber::Recipe> recipe;\n };\n std::vector<RecipeData> recipe_data;\n for (const auto& file : options.input_filenames) {\n auto data = ReadFile(file);\n if (data.empty()) {\n std::cerr << file << \" is empty.\" << std::endl;\n failures.push_back(file);\n continue;\n }\n\n amber::Amber am;\n std::unique_ptr<amber::Recipe> recipe = amber::MakeUnique<amber::Recipe>();\n\n result = am.Parse(data, recipe.get());\n if (!result.IsSuccess()) {\n std::cerr << file << \": \" << result.Error() << std::endl;\n failures.push_back(file);\n continue;\n }\n\n recipe_data.emplace_back();\n recipe_data.back().file = file;\n recipe_data.back().recipe = std::move(recipe);\n }\n\n if (options.parse_only)\n return 0;\n\n amber::Options amber_options;\n amber_options.engine = options.engine;\n amber_options.spv_env = options.spv_env;\n\n std::set<std::string> required_features;\n std::set<std::string> required_extensions;\n for (const auto& recipe_data_elem : recipe_data) {\n const auto features = recipe_data_elem.recipe->GetRequiredFeatures();\n required_features.insert(features.begin(), features.end());\n\n const auto extensions = recipe_data_elem.recipe->GetRequiredExtensions();\n required_extensions.insert(extensions.begin(), extensions.end());\n }\n\n sample::ConfigHelper config_helper;\n std::unique_ptr<amber::EngineConfig> config;\n\n amber::Result r = config_helper.CreateConfig(\n amber_options.engine, options.engine_major, options.engine_minor,\n std::vector<std::string>(required_features.begin(),\n required_features.end()),\n std::vector<std::string>(required_extensions.begin(),\n required_extensions.end()),\n options.disable_validation_layer, &config);\n\n if (!r.IsSuccess()) {\n std::cout << r.Error() << std::endl;\n return 1;\n }\n\n amber_options.config = config.get();\n\n if (!options.buffer_filename.empty()) {\n \/\/ TODO(dsinclair): Write buffer file\n assert(false);\n }\n\n if (!options.image_filename.empty()) {\n amber::BufferInfo buffer_info;\n buffer_info.buffer_name = \"framebuffer\";\n amber_options.extractions.push_back(buffer_info);\n }\n\n for (const auto& recipe_data_elem : recipe_data) {\n const auto* recipe = recipe_data_elem.recipe.get();\n const auto& file = recipe_data_elem.file;\n\n amber::Amber am;\n result = am.Execute(recipe, &amber_options);\n if (!result.IsSuccess()) {\n std::cerr << file << \": \" << result.Error() << std::endl;\n failures.push_back(file);\n continue;\n }\n\n if (!options.image_filename.empty()) {\n std::string image;\n for (amber::BufferInfo buffer_info : amber_options.extractions) {\n if (buffer_info.buffer_name == \"framebuffer\") {\n std::tie(result, image) = ppm::ConvertToPPM(\n buffer_info.width, buffer_info.height, buffer_info.values);\n break;\n }\n }\n if (!result.IsSuccess()) {\n std::cerr << result.Error() << std::endl;\n continue;\n }\n std::ofstream image_file;\n image_file.open(options.image_filename, std::ios::out | std::ios::binary);\n if (!image_file.is_open()) {\n std::cerr << \"Cannot open file for image dump: \";\n std::cerr << options.image_filename << std::endl;\n continue;\n }\n image_file << image;\n image_file.close();\n }\n }\n\n if (options.show_summary) {\n if (!failures.empty()) {\n std::cout << \"\\nSummary of Failures:\" << std::endl;\n\n for (const auto& failure : failures)\n std::cout << \" \" << failure << std::endl;\n }\n\n std::cout << \"\\nSummary: \"\n << (options.input_filenames.size() - failures.size()) << \" pass, \"\n << failures.size() << \" fail\" << std::endl;\n\n config_helper.Shutdown();\n }\n\n return !failures.empty();\n}\n<commit_msg>Sample app shutdown always (#274)<commit_after>\/\/ Copyright 2018 The Amber Authors.\n\/\/\n\/\/ Licensed under the Apache License, Version 2.0 (the \"License\");\n\/\/ you may not use this file except in compliance with the License.\n\/\/ You may obtain a copy of the License at\n\/\/\n\/\/ http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n\/\/\n\/\/ Unless required by applicable law or agreed to in writing, software\n\/\/ distributed under the License is distributed on an \"AS IS\" BASIS,\n\/\/ WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n\/\/ See the License for the specific language governing permissions and\n\/\/ limitations under the License.\n\n#include <cassert>\n#include <cstdlib>\n#include <fstream>\n#include <iostream>\n#include <set>\n#include <utility>\n#include <vector>\n\n#include \"amber\/amber.h\"\n#include \"amber\/recipe.h\"\n#include \"samples\/config_helper.h\"\n#include \"samples\/ppm.h\"\n#include \"src\/build-versions.h\"\n#include \"src\/make_unique.h\"\n\nnamespace {\n\nstruct Options {\n std::vector<std::string> input_filenames;\n\n std::string image_filename;\n std::string buffer_filename;\n int64_t buffer_binding_index = 0;\n uint32_t engine_major = 1;\n uint32_t engine_minor = 0;\n bool parse_only = false;\n bool disable_validation_layer = false;\n bool show_summary = false;\n bool show_help = false;\n bool show_version_info = false;\n amber::EngineType engine = amber::kEngineTypeVulkan;\n std::string spv_env;\n};\n\nconst char kUsage[] = R\"(Usage: amber [options] SCRIPT [SCRIPTS...]\n\n options:\n -p -- Parse input files only; Don't execute.\n -s -- Print summary of pass\/failure.\n -d -- Disable validation layers.\n -t <spirv_env> -- The target SPIR-V environment. Defaults to SPV_ENV_UNIVERSAL_1_0.\n -i <filename> -- Write rendering to <filename> as a PPM image.\n -b <filename> -- Write contents of a UBO or SSBO to <filename>.\n -B <buffer> -- Index of buffer to write. Defaults buffer 0.\n -e <engine> -- Specify graphics engine: vulkan, dawn. Default is vulkan.\n -v <engine version> -- Engine version (eg, 1.1 for Vulkan). Default 1.0.\n -V, --version -- Output version information for Amber and libraries.\n -h -- This help text.\n)\";\n\nbool ParseArgs(const std::vector<std::string>& args, Options* opts) {\n for (size_t i = 1; i < args.size(); ++i) {\n const std::string& arg = args[i];\n if (arg == \"-i\") {\n ++i;\n if (i >= args.size()) {\n std::cerr << \"Missing value for -i argument.\" << std::endl;\n return false;\n }\n opts->image_filename = args[i];\n\n } else if (arg == \"-b\") {\n ++i;\n if (i >= args.size()) {\n std::cerr << \"Missing value for -b argument.\" << std::endl;\n return false;\n }\n opts->buffer_filename = args[i];\n\n } else if (arg == \"-B\") {\n ++i;\n if (i >= args.size()) {\n std::cerr << \"Missing value for -B argument.\" << std::endl;\n return false;\n }\n opts->buffer_binding_index =\n static_cast<int64_t>(strtol(args[i].c_str(), nullptr, 10));\n\n if (opts->buffer_binding_index < 0U) {\n std::cerr << \"Invalid value for -B, must be 0 or greater.\" << std::endl;\n return false;\n }\n\n } else if (arg == \"-e\") {\n ++i;\n if (i >= args.size()) {\n std::cerr << \"Missing value for -e argument.\" << std::endl;\n return false;\n }\n const std::string& engine = args[i];\n if (engine == \"vulkan\") {\n opts->engine = amber::kEngineTypeVulkan;\n } else if (engine == \"dawn\") {\n opts->engine = amber::kEngineTypeDawn;\n } else {\n std::cerr\n << \"Invalid value for -e argument. Must be one of: vulkan dawn\"\n << std::endl;\n return false;\n }\n } else if (arg == \"-t\") {\n ++i;\n if (i >= args.size()) {\n std::cerr << \"Missing value for -t argument.\" << std::endl;\n return false;\n }\n opts->spv_env = args[i];\n } else if (arg == \"-h\" || arg == \"--help\") {\n opts->show_help = true;\n } else if (arg == \"-v\") {\n ++i;\n if (i >= args.size()) {\n std::cerr << \"Missing value for -v argument.\" << std::endl;\n return false;\n }\n const std::string& ver = args[i];\n\n size_t dot_pos = 0;\n int32_t val = std::stoi(ver, &dot_pos);\n if (val < 0) {\n std::cerr << \"Version major must be non-negative\" << std::endl;\n return false;\n }\n\n opts->engine_major = static_cast<uint32_t>(val);\n if (dot_pos != std::string::npos && (dot_pos + 1) < ver.size()) {\n val = std::stoi(ver.substr(dot_pos + 1));\n if (val < 0) {\n std::cerr << \"Version minor must be non-negative\" << std::endl;\n return false;\n }\n opts->engine_minor = static_cast<uint32_t>(val);\n }\n } else if (arg == \"-V\" || arg == \"--version\") {\n opts->show_version_info = true;\n } else if (arg == \"-p\") {\n opts->parse_only = true;\n } else if (arg == \"-d\") {\n opts->disable_validation_layer = true;\n } else if (arg == \"-s\") {\n opts->show_summary = true;\n } else if (arg.size() > 0 && arg[0] == '-') {\n std::cerr << \"Unrecognized option \" << arg << std::endl;\n return false;\n } else if (!arg.empty()) {\n opts->input_filenames.push_back(arg);\n }\n }\n\n return true;\n}\n\nstd::string ReadFile(const std::string& input_file) {\n FILE* file = nullptr;\n#if defined(_MSC_VER)\n fopen_s(&file, input_file.c_str(), \"rb\");\n#else\n file = fopen(input_file.c_str(), \"rb\");\n#endif\n if (!file) {\n std::cerr << \"Failed to open \" << input_file << std::endl;\n return {};\n }\n\n fseek(file, 0, SEEK_END);\n uint64_t tell_file_size = static_cast<uint64_t>(ftell(file));\n if (tell_file_size <= 0) {\n std::cerr << \"Input file of incorrect size: \" << input_file << std::endl;\n return {};\n }\n fseek(file, 0, SEEK_SET);\n\n size_t file_size = static_cast<size_t>(tell_file_size);\n\n std::vector<char> data;\n data.resize(file_size);\n\n size_t bytes_read = fread(data.data(), sizeof(char), file_size, file);\n fclose(file);\n if (bytes_read != file_size) {\n std::cerr << \"Failed to read \" << input_file << std::endl;\n return {};\n }\n\n return std::string(data.begin(), data.end());\n}\n\n} \/\/ namespace\n\nint main(int argc, const char** argv) {\n std::vector<std::string> args(argv, argv + argc);\n Options options;\n\n if (!ParseArgs(args, &options)) {\n std::cerr << \"Failed to parse arguments.\" << std::endl;\n return 1;\n }\n\n if (options.show_version_info) {\n std::cout << \"Amber : \" << AMBER_VERSION << std::endl;\n#if AMBER_ENABLE_SPIRV_TOOLS\n std::cout << \"SPIRV-Tools : \" << SPIRV_TOOLS_VERSION << std::endl;\n std::cout << \"SPIRV-Headers: \" << SPIRV_HEADERS_VERSION << std::endl;\n#endif \/\/ AMBER_ENABLE_SPIRV_TOOLS\n#if AMBER_ENABLE_SHADERC\n std::cout << \"GLSLang : \" << GLSLANG_VERSION << std::endl;\n std::cout << \"Shaderc : \" << SHADERC_VERSION << std::endl;\n#endif \/\/ AMBER_ENABLE_SHADERC\n }\n\n if (options.show_help) {\n std::cout << kUsage << std::endl;\n return 0;\n }\n\n if (options.input_filenames.empty()) {\n std::cerr << \"Input file must be provided.\" << std::endl;\n return 2;\n }\n\n amber::Result result;\n std::vector<std::string> failures;\n struct RecipeData {\n std::string file;\n std::unique_ptr<amber::Recipe> recipe;\n };\n std::vector<RecipeData> recipe_data;\n for (const auto& file : options.input_filenames) {\n auto data = ReadFile(file);\n if (data.empty()) {\n std::cerr << file << \" is empty.\" << std::endl;\n failures.push_back(file);\n continue;\n }\n\n amber::Amber am;\n std::unique_ptr<amber::Recipe> recipe = amber::MakeUnique<amber::Recipe>();\n\n result = am.Parse(data, recipe.get());\n if (!result.IsSuccess()) {\n std::cerr << file << \": \" << result.Error() << std::endl;\n failures.push_back(file);\n continue;\n }\n\n recipe_data.emplace_back();\n recipe_data.back().file = file;\n recipe_data.back().recipe = std::move(recipe);\n }\n\n if (options.parse_only)\n return 0;\n\n amber::Options amber_options;\n amber_options.engine = options.engine;\n amber_options.spv_env = options.spv_env;\n\n std::set<std::string> required_features;\n std::set<std::string> required_extensions;\n for (const auto& recipe_data_elem : recipe_data) {\n const auto features = recipe_data_elem.recipe->GetRequiredFeatures();\n required_features.insert(features.begin(), features.end());\n\n const auto extensions = recipe_data_elem.recipe->GetRequiredExtensions();\n required_extensions.insert(extensions.begin(), extensions.end());\n }\n\n sample::ConfigHelper config_helper;\n std::unique_ptr<amber::EngineConfig> config;\n\n amber::Result r = config_helper.CreateConfig(\n amber_options.engine, options.engine_major, options.engine_minor,\n std::vector<std::string>(required_features.begin(),\n required_features.end()),\n std::vector<std::string>(required_extensions.begin(),\n required_extensions.end()),\n options.disable_validation_layer, &config);\n\n if (!r.IsSuccess()) {\n std::cout << r.Error() << std::endl;\n return 1;\n }\n\n amber_options.config = config.get();\n\n if (!options.buffer_filename.empty()) {\n \/\/ TODO(dsinclair): Write buffer file\n assert(false);\n }\n\n if (!options.image_filename.empty()) {\n amber::BufferInfo buffer_info;\n buffer_info.buffer_name = \"framebuffer\";\n amber_options.extractions.push_back(buffer_info);\n }\n\n for (const auto& recipe_data_elem : recipe_data) {\n const auto* recipe = recipe_data_elem.recipe.get();\n const auto& file = recipe_data_elem.file;\n\n amber::Amber am;\n result = am.Execute(recipe, &amber_options);\n if (!result.IsSuccess()) {\n std::cerr << file << \": \" << result.Error() << std::endl;\n failures.push_back(file);\n continue;\n }\n\n if (!options.image_filename.empty()) {\n std::string image;\n for (amber::BufferInfo buffer_info : amber_options.extractions) {\n if (buffer_info.buffer_name == \"framebuffer\") {\n std::tie(result, image) = ppm::ConvertToPPM(\n buffer_info.width, buffer_info.height, buffer_info.values);\n break;\n }\n }\n if (!result.IsSuccess()) {\n std::cerr << result.Error() << std::endl;\n continue;\n }\n std::ofstream image_file;\n image_file.open(options.image_filename, std::ios::out | std::ios::binary);\n if (!image_file.is_open()) {\n std::cerr << \"Cannot open file for image dump: \";\n std::cerr << options.image_filename << std::endl;\n continue;\n }\n image_file << image;\n image_file.close();\n }\n }\n\n if (options.show_summary) {\n if (!failures.empty()) {\n std::cout << \"\\nSummary of Failures:\" << std::endl;\n\n for (const auto& failure : failures)\n std::cout << \" \" << failure << std::endl;\n }\n\n std::cout << \"\\nSummary: \"\n << (options.input_filenames.size() - failures.size()) << \" pass, \"\n << failures.size() << \" fail\" << std::endl;\n }\n\n config_helper.Shutdown();\n\n return !failures.empty();\n}\n<|endoftext|>"} {"text":"<commit_before>\/* js_utils.cc\n Jeremy Barnes, 21 July 2010\n Copyright (c) 2010 Datacratic. All rights reserved.\n\n Implementation of Javascript utility functions.\n*\/\n\n#include \"js_utils.h\"\n#include \"js_value.h\"\n#include <cxxabi.h>\n#include \"jml\/arch\/demangle.h\"\n#include \"jml\/arch\/exception_internals.h\"\n#include \"jml\/arch\/backtrace.h\"\n#include \"jml\/utils\/string_functions.h\"\n\nusing namespace std;\nusing namespace v8;\nusing namespace ML;\n\nnamespace ML {\n\nextern __thread BacktraceInfo * current_backtrace;\n\n} \/\/ namespace ML\n\nnamespace Datacratic {\nnamespace JS {\n\n\n\/*****************************************************************************\/\n\/* UTILITIES *\/\n\/*****************************************************************************\/\n\nstd::string cstr(const std::string & str)\n{\n return str;\n}\n\nstd::string cstr(const JSValue & val)\n{\n return from_js(val, (string *)0);\n}\n\nv8::Handle<v8::Value>\ninjectBacktrace(v8::Handle<v8::Value> value)\n{\n if (value.IsEmpty())\n throw ML::Exception(\"no object passed for backtrace injection\");\n\n v8::Handle<v8::Object> obj(v8::Object::Cast(*value));\n\n if (obj.IsEmpty())\n throw ML::Exception(\"can't inject backtrace\");\n\n v8::Handle<v8::Value> js_trace = obj->Get(v8::String::NewSymbol(\"stack\"));\n\n vector<string> js_trace_elements = split(cstr(js_trace), '\\n');\n\n \/\/ Frames to skip:\n \/\/ at [C++] ML::backtrace(int)\n \/\/ at [C++] Datacratic::JS::injectBacktrace(v8::Handle<v8::Value>)\n \/\/ at [C++] Datacratic::JS::mapException(ML::Exception const&)\n \/\/ at [C++] Datacratic::JS::translateCurrentException()\n int num_frames_to_skip = 0;\n\n vector<ML::BacktraceFrame> backtrace;\n if (current_backtrace && abi::__cxa_current_exception_type()) {\n \/\/ Skip:\n backtrace = ML::backtrace(*current_backtrace, num_frames_to_skip);\n delete current_backtrace;\n current_backtrace = 0;\n }\n else backtrace = ML::backtrace(num_frames_to_skip);\n\n string cpp_trace_str = js_trace_elements.at(0) + \"\\n\";\n\n v8::Handle<v8::Array> cpp_trace(v8::Array::New(backtrace.size() + 1));\n for (unsigned i = 0; i < backtrace.size(); ++i) {\n cpp_trace_str += \" at [C++] \" + backtrace[i].print_for_trace() + \"\\n\";\n cpp_trace->Set(v8::Uint32::New(i),\n v8::String::New(backtrace[i].print().c_str()));\n }\n \n for (unsigned i = 1; i < js_trace_elements.size(); ++i)\n cpp_trace_str += js_trace_elements[i] + \"\\n\";\n\n cpp_trace->Set(v8::Uint32::New(backtrace.size()), js_trace);\n\n obj->Set(v8::String::NewSymbol(\"cpp_trace\"), cpp_trace);\n obj->Set(v8::String::NewSymbol(\"js_trace\"), js_trace);\n obj->Set(v8::String::NewSymbol(\"stack\"), v8::String::New(cpp_trace_str.c_str()));\n\n return obj;\n}\n\nv8::Handle<Value>\nmapException(const std::exception & exc)\n{\n return v8::ThrowException\n (injectBacktrace\n (v8::Exception::Error(v8::String::New((type_name(exc)\n + \": \" + exc.what()).c_str()))));\n}\n\nv8::Handle<Value>\nmapException(const ML::Exception & exc)\n{\n \/\/cerr << \"mapping ML::Exception \" << exc.what() << endl;\n\n return v8::ThrowException\n (injectBacktrace\n (v8::Exception::Error(v8::String::New(exc.what()))));\n}\n\nv8::Handle<v8::Value>\ntranslateCurrentException()\n{\n if (!std::current_exception()) {\n throw ML::Exception(\"no exception\");\n }\n\n try {\n throw;\n }\n catch(const JSPassException&) {\n return v8::Handle<v8::Value>();\n }\n catch(const ML::Exception& ex) {\n return mapException(ex);\n }\n catch(const std::exception& ex) {\n return mapException(ex);\n }\n catch(...) {\n std::string msg = \"unknown exception type\";\n auto error = v8::Exception::Error(v8::String::New(msg.c_str()));\n return v8::ThrowException(injectBacktrace(error));\n }\n}\n\nvoid passJsException(const v8::TryCatch & tc);\n\nstruct NullHandle NULL_HANDLE;\n\nValuePromise getArg(const JSArgs & args, int argnum,\n const std::string & name)\n{\n if (args.Length() <= argnum)\n throw ML::Exception(\"argument %d (%s) must be present\",\n argnum, name.c_str());\n\n ValuePromise arg;\n arg.value = args[argnum];\n\n if (arg.value->IsUndefined() || arg.value->IsNull())\n throw ML::Exception(\"argument %d (%s) was %s\",\n argnum, name.c_str(), cstr(arg.value).c_str());\n\n arg.argnum = argnum;\n arg.name = name;\n\n return arg;\n}\n\n\nstring getArg(const JSArgs & args, int argnum, const string & defvalue,\n const std::string & name)\n{\n\n return getArg<string>(args, argnum, defvalue, name);\n}\n\n\/** Convert the given value into a persistent v8 function. *\/\nv8::Persistent<v8::Function>\nfrom_js(const JSValue & val, v8::Persistent<v8::Function> *)\n{\n v8::Handle<v8::Function> fn(v8::Function::Cast(*val));\n if (fn.IsEmpty() || !fn->IsFunction()) {\n \/\/cerr << \"fn = \" << cstr(fn) << endl;\n \/\/cerr << \"fn.IsEmpty() = \" << fn.IsEmpty() << endl;\n \/\/cerr << \"val->IsFunction() = \" << val->IsFunction() << endl;\n throw ML::Exception(\"expected a function; instead we got \" + cstr(val));\n }\n \n return v8::Persistent<v8::Function>::New(fn);\n}\n\nv8::Local<v8::Function>\nfrom_js(const JSValue & val, v8::Local<v8::Function> *)\n{\n v8::Local<v8::Function> fn(v8::Function::Cast(*val));\n if (fn.IsEmpty() || !fn->IsFunction()) {\n \/\/cerr << \"fn = \" << cstr(fn) << endl;\n \/\/cerr << \"fn.IsEmpty() = \" << fn.IsEmpty() << endl;\n \/\/cerr << \"val->IsFunction() = \" << val->IsFunction() << endl;\n throw ML::Exception(\"expected a function; instead we got \" + cstr(val));\n }\n\n return fn;\n}\n\nv8::Handle<v8::Function>\nfrom_js(const JSValue & val, v8::Handle<v8::Function> *)\n{\n v8::Handle<v8::Function> fn(v8::Function::Cast(*val));\n if (fn.IsEmpty() || !fn->IsFunction()) {\n \/\/cerr << \"fn = \" << cstr(fn) << endl;\n \/\/cerr << \"fn.IsEmpty() = \" << fn.IsEmpty() << endl;\n \/\/cerr << \"val->IsFunction() = \" << val->IsFunction() << endl;\n throw ML::Exception(\"expected a function; instead we got \" + cstr(val));\n }\n\n return fn;\n}\n\nv8::Handle<v8::Array>\nfrom_js(const JSValue & val, v8::Handle<v8::Array> *)\n{\n v8::Handle<v8::Array> arr(v8::Array::Cast(*val));\n if (arr.IsEmpty() || !arr->IsArray())\n throw ML::Exception(\"expected an array; instead we got \" + cstr(val));\n\n return arr;\n}\n\nv8::Handle<v8::Function>\ngetFunction(const std::string & script_source)\n{\n using namespace v8;\n\n HandleScope scope;\n Handle<String> source = String::New(script_source.c_str());\n\n TryCatch tc;\n \n \/\/ Compile the source code.\n Handle<Script> script = Script::Compile(source);\n\n if (script.IsEmpty() && tc.HasCaught())\n throw ML::Exception(\"got exception compiling: \"\n + JS::cstr(tc.Exception()));\n if (script.IsEmpty())\n throw ML::Exception(\"compilation returned nothing\");\n \n \/\/ Run the script to get the result (which should be a function)\n Handle<Value> result = script->Run();\n\n if (result.IsEmpty() && tc.HasCaught())\n throw ML::Exception(\"got exception compiling: \"\n + JS::cstr(tc.Exception()));\n if (result.IsEmpty())\n throw ML::Exception(\"compilation returned nothing\");\n if (!result->IsFunction())\n throw ML::Exception(\"result of script isn't a function\");\n \n v8::Local<v8::Function> fnresult(v8::Function::Cast(*result));\n\n return scope.Close(fnresult);\n}\n\nv8::Handle<v8::Array>\ngetIndexArray(size_t sz)\n{\n v8::Handle<v8::Array> result(v8::Array::New(sz));\n \n for (unsigned i = 0; i < sz; ++i) {\n result->Set(v8::Uint32::New(i),\n v8::Uint32::New(i));\n }\n\n return result;\n}\n\n\/** Call a getter function that's in the data field of the given object. *\/\nv8::Handle<v8::Value>\ncallGetterFn(v8::Local<v8::String> property,\n const v8::AccessorInfo & info)\n{\n try {\n HandleScope scope;\n if (!info.Data()->IsFunction())\n throw ML::Exception(\"isn't a function\");\n v8::Local<v8::Function> fn(v8::Function::Cast(*info.Data()));\n if (fn.IsEmpty())\n throw JSPassException();\n const int argc = 1;\n v8::Local<v8::Value> argv[argc] = { property };\n return scope.Close(fn->Call(info.This(), argc, argv));\n } HANDLE_JS_EXCEPTIONS;\n}\n\nvoid printObj(const v8::Handle<v8::Value> & val,\n std::ostream & stream,\n int nesting)\n{\n string s(nesting * 4, ' ');\n stream << s << cstr(val) << endl;\n if (val->IsObject()) {\n auto objPtr = v8::Object::Cast(*val);\n if (!objPtr)\n return;\n\n v8::Local<v8::Array> properties = objPtr->GetPropertyNames();\n\n for(int i=0; i<properties->Length(); ++i) {\n v8::Local<v8::Value> key = properties->Get(i);\n v8::Local<v8::Value> val = objPtr->Get(key);\n\n stream << s << \" \" << cstr(key) << \": \" << cstr(val) << endl;\n }\n\n v8::Local<v8::Value> proto = objPtr->Get(v8::String::New(\"prototype\"));\n stream << s << \" prototype \" << cstr(proto) << endl;\n if (proto->IsObject())\n printObj(proto, stream, nesting + 1);\n\n v8::Local<v8::Value> proto2 = objPtr->GetPrototype(); \n stream << s << \" .__proto__ \" << cstr(proto2) << endl;\n if (proto2->IsObject())\n printObj(proto2, stream, nesting + 1);\n }\n}\n\n} \/\/ namespace JS\n} \/\/ namespace Datacratic\n<commit_msg>replaced catch(...) by JML_CATCH_ALL.<commit_after>\/* js_utils.cc\n Jeremy Barnes, 21 July 2010\n Copyright (c) 2010 Datacratic. All rights reserved.\n\n Implementation of Javascript utility functions.\n*\/\n\n#include \"js_utils.h\"\n#include \"js_value.h\"\n#include <cxxabi.h>\n#include \"jml\/arch\/demangle.h\"\n#include \"jml\/arch\/exception_internals.h\"\n#include \"jml\/arch\/backtrace.h\"\n#include \"jml\/utils\/string_functions.h\"\n#include \"jml\/compiler\/compiler.h\"\n\nusing namespace std;\nusing namespace v8;\nusing namespace ML;\n\nnamespace ML {\n\nextern __thread BacktraceInfo * current_backtrace;\n\n} \/\/ namespace ML\n\nnamespace Datacratic {\nnamespace JS {\n\n\n\/*****************************************************************************\/\n\/* UTILITIES *\/\n\/*****************************************************************************\/\n\nstd::string cstr(const std::string & str)\n{\n return str;\n}\n\nstd::string cstr(const JSValue & val)\n{\n return from_js(val, (string *)0);\n}\n\nv8::Handle<v8::Value>\ninjectBacktrace(v8::Handle<v8::Value> value)\n{\n if (value.IsEmpty())\n throw ML::Exception(\"no object passed for backtrace injection\");\n\n v8::Handle<v8::Object> obj(v8::Object::Cast(*value));\n\n if (obj.IsEmpty())\n throw ML::Exception(\"can't inject backtrace\");\n\n v8::Handle<v8::Value> js_trace = obj->Get(v8::String::NewSymbol(\"stack\"));\n\n vector<string> js_trace_elements = split(cstr(js_trace), '\\n');\n\n \/\/ Frames to skip:\n \/\/ at [C++] ML::backtrace(int)\n \/\/ at [C++] Datacratic::JS::injectBacktrace(v8::Handle<v8::Value>)\n \/\/ at [C++] Datacratic::JS::mapException(ML::Exception const&)\n \/\/ at [C++] Datacratic::JS::translateCurrentException()\n int num_frames_to_skip = 0;\n\n vector<ML::BacktraceFrame> backtrace;\n if (current_backtrace && abi::__cxa_current_exception_type()) {\n \/\/ Skip:\n backtrace = ML::backtrace(*current_backtrace, num_frames_to_skip);\n delete current_backtrace;\n current_backtrace = 0;\n }\n else backtrace = ML::backtrace(num_frames_to_skip);\n\n string cpp_trace_str = js_trace_elements.at(0) + \"\\n\";\n\n v8::Handle<v8::Array> cpp_trace(v8::Array::New(backtrace.size() + 1));\n for (unsigned i = 0; i < backtrace.size(); ++i) {\n cpp_trace_str += \" at [C++] \" + backtrace[i].print_for_trace() + \"\\n\";\n cpp_trace->Set(v8::Uint32::New(i),\n v8::String::New(backtrace[i].print().c_str()));\n }\n \n for (unsigned i = 1; i < js_trace_elements.size(); ++i)\n cpp_trace_str += js_trace_elements[i] + \"\\n\";\n\n cpp_trace->Set(v8::Uint32::New(backtrace.size()), js_trace);\n\n obj->Set(v8::String::NewSymbol(\"cpp_trace\"), cpp_trace);\n obj->Set(v8::String::NewSymbol(\"js_trace\"), js_trace);\n obj->Set(v8::String::NewSymbol(\"stack\"), v8::String::New(cpp_trace_str.c_str()));\n\n return obj;\n}\n\nv8::Handle<Value>\nmapException(const std::exception & exc)\n{\n return v8::ThrowException\n (injectBacktrace\n (v8::Exception::Error(v8::String::New((type_name(exc)\n + \": \" + exc.what()).c_str()))));\n}\n\nv8::Handle<Value>\nmapException(const ML::Exception & exc)\n{\n \/\/cerr << \"mapping ML::Exception \" << exc.what() << endl;\n\n return v8::ThrowException\n (injectBacktrace\n (v8::Exception::Error(v8::String::New(exc.what()))));\n}\n\nv8::Handle<v8::Value>\ntranslateCurrentException()\n{\n if (!std::current_exception()) {\n throw ML::Exception(\"no exception\");\n }\n\n try {\n throw;\n }\n catch(const JSPassException&) {\n return v8::Handle<v8::Value>();\n }\n catch(const ML::Exception& ex) {\n return mapException(ex);\n }\n catch(const std::exception& ex) {\n return mapException(ex);\n }\n JML_CATCH_ALL {\n std::string msg = \"unknown exception type\";\n auto error = v8::Exception::Error(v8::String::New(msg.c_str()));\n return v8::ThrowException(injectBacktrace(error));\n }\n}\n\nvoid passJsException(const v8::TryCatch & tc);\n\nstruct NullHandle NULL_HANDLE;\n\nValuePromise getArg(const JSArgs & args, int argnum,\n const std::string & name)\n{\n if (args.Length() <= argnum)\n throw ML::Exception(\"argument %d (%s) must be present\",\n argnum, name.c_str());\n\n ValuePromise arg;\n arg.value = args[argnum];\n\n if (arg.value->IsUndefined() || arg.value->IsNull())\n throw ML::Exception(\"argument %d (%s) was %s\",\n argnum, name.c_str(), cstr(arg.value).c_str());\n\n arg.argnum = argnum;\n arg.name = name;\n\n return arg;\n}\n\n\nstring getArg(const JSArgs & args, int argnum, const string & defvalue,\n const std::string & name)\n{\n\n return getArg<string>(args, argnum, defvalue, name);\n}\n\n\/** Convert the given value into a persistent v8 function. *\/\nv8::Persistent<v8::Function>\nfrom_js(const JSValue & val, v8::Persistent<v8::Function> *)\n{\n v8::Handle<v8::Function> fn(v8::Function::Cast(*val));\n if (fn.IsEmpty() || !fn->IsFunction()) {\n \/\/cerr << \"fn = \" << cstr(fn) << endl;\n \/\/cerr << \"fn.IsEmpty() = \" << fn.IsEmpty() << endl;\n \/\/cerr << \"val->IsFunction() = \" << val->IsFunction() << endl;\n throw ML::Exception(\"expected a function; instead we got \" + cstr(val));\n }\n \n return v8::Persistent<v8::Function>::New(fn);\n}\n\nv8::Local<v8::Function>\nfrom_js(const JSValue & val, v8::Local<v8::Function> *)\n{\n v8::Local<v8::Function> fn(v8::Function::Cast(*val));\n if (fn.IsEmpty() || !fn->IsFunction()) {\n \/\/cerr << \"fn = \" << cstr(fn) << endl;\n \/\/cerr << \"fn.IsEmpty() = \" << fn.IsEmpty() << endl;\n \/\/cerr << \"val->IsFunction() = \" << val->IsFunction() << endl;\n throw ML::Exception(\"expected a function; instead we got \" + cstr(val));\n }\n\n return fn;\n}\n\nv8::Handle<v8::Function>\nfrom_js(const JSValue & val, v8::Handle<v8::Function> *)\n{\n v8::Handle<v8::Function> fn(v8::Function::Cast(*val));\n if (fn.IsEmpty() || !fn->IsFunction()) {\n \/\/cerr << \"fn = \" << cstr(fn) << endl;\n \/\/cerr << \"fn.IsEmpty() = \" << fn.IsEmpty() << endl;\n \/\/cerr << \"val->IsFunction() = \" << val->IsFunction() << endl;\n throw ML::Exception(\"expected a function; instead we got \" + cstr(val));\n }\n\n return fn;\n}\n\nv8::Handle<v8::Array>\nfrom_js(const JSValue & val, v8::Handle<v8::Array> *)\n{\n v8::Handle<v8::Array> arr(v8::Array::Cast(*val));\n if (arr.IsEmpty() || !arr->IsArray())\n throw ML::Exception(\"expected an array; instead we got \" + cstr(val));\n\n return arr;\n}\n\nv8::Handle<v8::Function>\ngetFunction(const std::string & script_source)\n{\n using namespace v8;\n\n HandleScope scope;\n Handle<String> source = String::New(script_source.c_str());\n\n TryCatch tc;\n \n \/\/ Compile the source code.\n Handle<Script> script = Script::Compile(source);\n\n if (script.IsEmpty() && tc.HasCaught())\n throw ML::Exception(\"got exception compiling: \"\n + JS::cstr(tc.Exception()));\n if (script.IsEmpty())\n throw ML::Exception(\"compilation returned nothing\");\n \n \/\/ Run the script to get the result (which should be a function)\n Handle<Value> result = script->Run();\n\n if (result.IsEmpty() && tc.HasCaught())\n throw ML::Exception(\"got exception compiling: \"\n + JS::cstr(tc.Exception()));\n if (result.IsEmpty())\n throw ML::Exception(\"compilation returned nothing\");\n if (!result->IsFunction())\n throw ML::Exception(\"result of script isn't a function\");\n \n v8::Local<v8::Function> fnresult(v8::Function::Cast(*result));\n\n return scope.Close(fnresult);\n}\n\nv8::Handle<v8::Array>\ngetIndexArray(size_t sz)\n{\n v8::Handle<v8::Array> result(v8::Array::New(sz));\n \n for (unsigned i = 0; i < sz; ++i) {\n result->Set(v8::Uint32::New(i),\n v8::Uint32::New(i));\n }\n\n return result;\n}\n\n\/** Call a getter function that's in the data field of the given object. *\/\nv8::Handle<v8::Value>\ncallGetterFn(v8::Local<v8::String> property,\n const v8::AccessorInfo & info)\n{\n try {\n HandleScope scope;\n if (!info.Data()->IsFunction())\n throw ML::Exception(\"isn't a function\");\n v8::Local<v8::Function> fn(v8::Function::Cast(*info.Data()));\n if (fn.IsEmpty())\n throw JSPassException();\n const int argc = 1;\n v8::Local<v8::Value> argv[argc] = { property };\n return scope.Close(fn->Call(info.This(), argc, argv));\n } HANDLE_JS_EXCEPTIONS;\n}\n\nvoid printObj(const v8::Handle<v8::Value> & val,\n std::ostream & stream,\n int nesting)\n{\n string s(nesting * 4, ' ');\n stream << s << cstr(val) << endl;\n if (val->IsObject()) {\n auto objPtr = v8::Object::Cast(*val);\n if (!objPtr)\n return;\n\n v8::Local<v8::Array> properties = objPtr->GetPropertyNames();\n\n for(int i=0; i<properties->Length(); ++i) {\n v8::Local<v8::Value> key = properties->Get(i);\n v8::Local<v8::Value> val = objPtr->Get(key);\n\n stream << s << \" \" << cstr(key) << \": \" << cstr(val) << endl;\n }\n\n v8::Local<v8::Value> proto = objPtr->Get(v8::String::New(\"prototype\"));\n stream << s << \" prototype \" << cstr(proto) << endl;\n if (proto->IsObject())\n printObj(proto, stream, nesting + 1);\n\n v8::Local<v8::Value> proto2 = objPtr->GetPrototype(); \n stream << s << \" .__proto__ \" << cstr(proto2) << endl;\n if (proto2->IsObject())\n printObj(proto2, stream, nesting + 1);\n }\n}\n\n} \/\/ namespace JS\n} \/\/ namespace Datacratic\n<|endoftext|>"} {"text":"<commit_before>#include <FImage.h>\n#include <stdint.h>\n\nusing namespace FImage;\n\nVar x, y, c;\n\nFunc hot_pixel_suppression(Func input) {\n Expr max = Max(Max(input(x-2, y), input(x+2, y)),\n Max(input(x, y-2), input(x, y+2)));\n Expr min = Min(Min(input(x-2, y), input(x+2, y)),\n Min(input(x, y-2), input(x, y+2)));\n \n Func denoised(\"denoised\");\n denoised(x, y) = Clamp(input(x, y), min, max);\n \n return denoised;\n}\n\nExpr abs(Expr e) {\n return Select(e < Cast(e.type(), 0), -e, e);\n}\n\nFunc interleave_x(Func a, Func b) {\n Func out;\n out(x, y) = Select((x%2)==0, a(x\/2, y), b(x\/2, y));\n return out;\n}\n\nFunc interleave_y(Func a, Func b) {\n Func out;\n out(x, y) = Select((y%2)==0, a(x, y\/2), b(x, y\/2));\n return out;\n}\n\nFunc demosaic(Func raw) {\n \/\/ These are the values we already know from the input\n \/\/ x_y = the value of channel x at a site in the input of channel y\n \/\/ gb refers to green sites in the blue rows\n \/\/ gr refers to green sites in the red rows\n Func r_r(\"r_r\"), g_gr(\"g_gr\"), g_gb(\"g_gb\"), b_b(\"b_b\"); \n g_gr(x, y) = raw(2*x, 2*y);\n r_r(x, y) = raw(2*x+1, 2*y);\n b_b(x, y) = raw(2*x, 2*y+1);\n g_gb(x, y) = raw(2*x+1, 2*y+1);\n\n \/\/ These are the ones we need to interpolate\n Func b_r(\"b_r\"), g_r(\"g_r\");\n Func b_gr(\"b_gr\"), r_gr(\"r_gr\");\n Func b_gb(\"b_gb\"), r_gb(\"r_gb\");\n Func r_b(\"r_b\"), g_b(\"g_b\");\n\n \/\/ First calculate green at the red and blue sites\n\n \/\/ Try interpolating vertically and horizontally. Also compute\n \/\/ differences vertically and horizontally. Use interpolation in\n \/\/ whichever direction had the smallest difference.\n Expr gv_r = (g_gb(x, y-1) + g_gb(x, y))\/2;\n Expr gvd_r = abs(g_gb(x, y-1) - g_gb(x, y));\n Expr gh_r = (g_gr(x+1, y) + g_gr(x, y))\/2;\n Expr ghd_r = abs(g_gr(x+1, y) - g_gr(x, y));\n\n g_r(x, y) = Select(ghd_r < gvd_r, gh_r, gv_r);\n\n Expr gv_b = (g_gr(x, y+1) + g_gr(x, y))\/2;\n Expr gvd_b = abs(g_gr(x, y+1) - g_gr(x, y));\n Expr gh_b = (g_gb(x-1, y) + g_gb(x, y))\/2;\n Expr ghd_b = abs(g_gb(x-1, y) - g_gb(x, y));\n\n g_b(x, y) = Select(ghd_b < gvd_b, gh_b, gv_b);\n\n \/\/ Next interpolate red at gr by first interpolating, then\n \/\/ correcting using the error green would have had if we had\n \/\/ interpolated it in the same way (i.e. add the second derivative\n \/\/ of the green channel at the same place).\n Expr correction;\n correction = g_gr(x, y) - (g_r(x, y) + g_r(x-1, y))\/2;\n r_gr(x, y) = correction + (r_r(x-1, y) + r_r(x, y))\/2;\n \n \/\/ Do the same for other reds and blues at green sites\n correction = g_gr(x, y) - (g_b(x, y) + g_b(x, y-1))\/2;\n b_gr(x, y) = correction + (b_b(x, y) + b_b(x, y-1))\/2;\n\n correction = g_gb(x, y) - (g_r(x, y) + g_r(x, y+1))\/2;\n r_gb(x, y) = correction + (r_r(x, y) + r_r(x, y+1))\/2;\n\n correction = g_gb(x, y) - (g_b(x, y) + g_b(x+1, y))\/2;\n b_gb(x, y) = correction + (b_b(x, y) + b_b(x+1, y))\/2;\n \n \/\/ Now interpolate diagonally to get red at blue and blue at\n \/\/ red. Hold onto your hats; this gets really fancy. We do the\n \/\/ same thing as for interpolating green where we try both\n \/\/ directions (in this case the positive and negative diagonals),\n \/\/ and use the one with the lowest absolute difference. But we\n \/\/ also use the same trick as interpolating red and blue at green\n \/\/ sites - we correct our interpolations using the second\n \/\/ derivative of green at the same sites.\n\n correction = g_b(x, y) - (g_r(x, y) + g_r(x-1, y+1))\/2;\n Expr rp_b = correction + (r_r(x, y) + r_r(x-1, y+1))\/2;\n Expr rpd_b = abs(r_r(x, y) - r_r(x-1, y+1));\n\n correction = g_b(x, y) - (g_r(x-1, y) + g_r(x, y+1))\/2;\n Expr rn_b = correction + (r_r(x-1, y) + r_r(x, y+1))\/2;\n Expr rnd_b = abs(r_r(x-1, y) - r_r(x, y+1));\n\n r_b(x, y) = Select(rpd_b < rnd_b, rp_b, rn_b);\n\n \/\/ Same thing for blue at red\n correction = g_r(x, y) - (g_b(x, y) + g_b(x+1, y-1))\/2;\n Expr bp_r = correction + (b_b(x, y) + b_b(x+1, y-1))\/2;\n Expr bpd_r = abs(b_b(x, y) - b_b(x+1, y-1));\n\n correction = g_r(x, y) - (g_b(x+1, y) + g_b(x, y-1))\/2;\n Expr bn_r = correction + (b_b(x+1, y) + b_b(x, y-1))\/2;\n Expr bnd_r = abs(b_b(x+1, y) - b_b(x, y-1));\n\n b_r(x, y) = Select(bpd_r < bnd_r, bp_r, bn_r); \n\n \/\/ Interleave the resulting channels\n Func r = interleave_y(interleave_x(r_gr, r_r),\n interleave_x(r_b, r_gb));\n Func g = interleave_y(interleave_x(g_gr, g_r),\n interleave_x(g_b, g_gb));\n Func b = interleave_y(interleave_x(b_gr, b_r), \n interleave_x(b_b, b_gb));\n\n Func output(\"dem\");\n output(x, y) = (r(x, y), g(x, y), b(x, y));\n\n return output;\n}\n\n\nFunc color_correct(Func input, UniformImage matrix_3200, UniformImage matrix_7000, Uniform<float> kelvin) {\n \/\/ Get a color matrix by linearly interpolating between two\n \/\/ calibrated matrices using inverse kelvin.\n\n Func matrix;\n Expr alpha = (1.0f\/kelvin - 1.0f\/3200) \/ (1.0f\/7000 - 1.0f\/3200);\n matrix(x, y) = (matrix_3200(x, y) * alpha + \n matrix_7000(x, y) * (1 - alpha));\n\n Func corrected;\n RVar j(0, 3);\n corrected(x, y, c) = Cast<int16_t>(Sum(matrix(j, c)*Cast<float>(input(x, y, j))) + matrix(3, c));\n return corrected;\n}\n\n\nFunc apply_curve(Func input, Uniform<float> gamma, Uniform<float> contrast) {\n \/\/ copied from FCam\n Func curve(\"curve\");\n\n Expr xf = Cast<float>(x)\/1024.0f;\n Expr g = pow(xf, 1.0f\/gamma);\n Expr b = 2.0f - pow(2.0f, contrast\/100.0f);\n Expr a = 2.0f - 2.0f*b; \n Expr z = Select(g > 0.5f,\n 1.0f - (a*(1.0f-g)*(1.0f-g) + b*(1.0f-g)),\n a*g*g + b*g);\n Expr val = Cast<uint8_t>(Clamp(z*256.0f, 0.0f, 255.0f));\n curve(x) = val; \/\/Debug(val, \"curve \", x, xf, g, z, val);\n\n Func curved(\"curved\");\n \/\/ This is after the color transform, so the input could be\n \/\/ negative or very large. Clamp it back to 10 bits before applying the curve.\n curved(x, y, c) = curve(Clamp(Cast<int32_t>(input(x, y, c)), 0, 1023));\n return curved;\n}\n\n\/*\nFunc rgb_to_yuv422(Func rgb) {\n Func Y;\n Func U;\n Func V;\n Func UV;\n Func YUV; \n}\n*\/\n\nFunc process(Func raw, \n UniformImage matrix_3200, UniformImage matrix_7000, Uniform<float> color_temp, \n Uniform<float> gamma, Uniform<float> contrast) {\n Func im = raw;\n im = hot_pixel_suppression(im);\n im = demosaic(im);\n im = color_correct(im, matrix_3200, matrix_7000, color_temp);\n im = apply_curve(im, gamma, contrast);\n\n \/*\n Func check;\n Var x, y, c;\n check(x, y, c) = Debug(im(x, y, c), \"after curve \", x, y, c, im(x, y, c));\n im = check;\n *\/\n\n \/\/im = rgb_to_yuv422(im);\n return im;\n}\n\nint main(int argc, char **argv) {\n UniformImage input(UInt(16), 2, \"raw\");\n UniformImage matrix_3200(Float(32), 2, \"m3200\"), matrix_7000(Float(32), 2, \"m7000\");\n Uniform<float> color_temp(\"color_temp\", 3200.0f);\n Uniform<float> gamma(\"gamma\", 1.8f);\n Uniform<float> contrast(\"contrast\", 10.0f);\n\n \/\/ add a boundary condition and treat things as signed ints\n \/\/ (demosaic might introduce negative values)\n Func clamped(\"in\");\n clamped(x, y) = Cast<int16_t>(input(Clamp(x, 0, input.width()-1),\n Clamp(y, 0, input.height()-1)));\n\n \/\/ Run the pipeline\n Func processed = process(clamped, matrix_3200, matrix_7000, color_temp, gamma, contrast);\n\n \/\/ Pick a schedule \n\n if (argc > 1) \n srand(atoi(argv[1]));\n else\n srand(0);\n\n Var xo(\"xo\"), yo(\"yo\"), c(\"c\"), xi(\"xi\"), yi(\"yi\");\n Func output;\n output(xo, yo, c) = processed(xo, yo, c);\n output.root().tile(xo, yo, xi, yi, 32, 16).transpose(yo, c).transpose(xo, c);\n\n std::vector<Func> funcs = output.rhs().funcs(); \n\n for (size_t i = 0; i < funcs.size(); i++) {\n if (funcs[i].name() == \"curve\") funcs[i].root();\n else funcs[i].chunk(xo);\n \/\/if (funcs[i].returnType() == UInt(8)) funcs[i].vectorize(x, 16);\n \/\/if (funcs[i].returnType() == Int(16)) funcs[i].vectorize(x, 8);\n \/\/if (funcs[i].returnType() == Float(32)) funcs[i].vectorize(x, 4);\n }\n\n output.compileToFile(\"curved\");\n \n return 0;\n}\n\n<commit_msg>Updated camera_pipe example<commit_after>#include <FImage.h>\n#include <stdint.h>\n\nusing namespace FImage;\n\nVar x, y, c;\n\nFunc hot_pixel_suppression(Func input) {\n Expr max = Max(Max(input(x-2, y), input(x+2, y)),\n Max(input(x, y-2), input(x, y+2)));\n Expr min = Min(Min(input(x-2, y), input(x+2, y)),\n Min(input(x, y-2), input(x, y+2)));\n \n Func denoised(\"denoised\");\n denoised(x, y) = Clamp(input(x, y), min, max);\n \n return denoised;\n}\n\nExpr abs(Expr e) {\n return Select(e < Cast(e.type(), 0), -e, e);\n}\n\nFunc interleave_x(Func a, Func b) {\n Func out;\n out(x, y) = Select((x%2)==0, a(x\/2, y), b(x\/2, y));\n return out;\n}\n\nFunc interleave_y(Func a, Func b) {\n Func out;\n out(x, y) = Select((y%2)==0, a(x, y\/2), b(x, y\/2));\n return out;\n}\n\nFunc demosaic(Func raw) {\n \/\/ These are the values we already know from the input\n \/\/ x_y = the value of channel x at a site in the input of channel y\n \/\/ gb refers to green sites in the blue rows\n \/\/ gr refers to green sites in the red rows\n Func r_r(\"r_r\"), g_gr(\"g_gr\"), g_gb(\"g_gb\"), b_b(\"b_b\"); \n g_gr(x, y) = raw(2*x, 2*y);\n r_r(x, y) = raw(2*x+1, 2*y);\n b_b(x, y) = raw(2*x, 2*y+1);\n g_gb(x, y) = raw(2*x+1, 2*y+1);\n\n \/\/ These are the ones we need to interpolate\n Func b_r(\"b_r\"), g_r(\"g_r\");\n Func b_gr(\"b_gr\"), r_gr(\"r_gr\");\n Func b_gb(\"b_gb\"), r_gb(\"r_gb\");\n Func r_b(\"r_b\"), g_b(\"g_b\");\n\n \/\/ First calculate green at the red and blue sites\n\n \/\/ Try interpolating vertically and horizontally. Also compute\n \/\/ differences vertically and horizontally. Use interpolation in\n \/\/ whichever direction had the smallest difference.\n Expr gv_r = (g_gb(x, y-1) + g_gb(x, y))\/2;\n Expr gvd_r = abs(g_gb(x, y-1) - g_gb(x, y));\n Expr gh_r = (g_gr(x+1, y) + g_gr(x, y))\/2;\n Expr ghd_r = abs(g_gr(x+1, y) - g_gr(x, y));\n\n g_r(x, y) = Select(ghd_r < gvd_r, gh_r, gv_r);\n\n Expr gv_b = (g_gr(x, y+1) + g_gr(x, y))\/2;\n Expr gvd_b = abs(g_gr(x, y+1) - g_gr(x, y));\n Expr gh_b = (g_gb(x-1, y) + g_gb(x, y))\/2;\n Expr ghd_b = abs(g_gb(x-1, y) - g_gb(x, y));\n\n g_b(x, y) = Select(ghd_b < gvd_b, gh_b, gv_b);\n\n \/\/ Next interpolate red at gr by first interpolating, then\n \/\/ correcting using the error green would have had if we had\n \/\/ interpolated it in the same way (i.e. add the second derivative\n \/\/ of the green channel at the same place).\n Expr correction;\n correction = g_gr(x, y) - (g_r(x, y) + g_r(x-1, y))\/2;\n r_gr(x, y) = correction + (r_r(x-1, y) + r_r(x, y))\/2;\n \n \/\/ Do the same for other reds and blues at green sites\n correction = g_gr(x, y) - (g_b(x, y) + g_b(x, y-1))\/2;\n b_gr(x, y) = correction + (b_b(x, y) + b_b(x, y-1))\/2;\n\n correction = g_gb(x, y) - (g_r(x, y) + g_r(x, y+1))\/2;\n r_gb(x, y) = correction + (r_r(x, y) + r_r(x, y+1))\/2;\n\n correction = g_gb(x, y) - (g_b(x, y) + g_b(x+1, y))\/2;\n b_gb(x, y) = correction + (b_b(x, y) + b_b(x+1, y))\/2;\n \n \/\/ Now interpolate diagonally to get red at blue and blue at\n \/\/ red. Hold onto your hats; this gets really fancy. We do the\n \/\/ same thing as for interpolating green where we try both\n \/\/ directions (in this case the positive and negative diagonals),\n \/\/ and use the one with the lowest absolute difference. But we\n \/\/ also use the same trick as interpolating red and blue at green\n \/\/ sites - we correct our interpolations using the second\n \/\/ derivative of green at the same sites.\n\n correction = g_b(x, y) - (g_r(x, y) + g_r(x-1, y+1))\/2;\n Expr rp_b = correction + (r_r(x, y) + r_r(x-1, y+1))\/2;\n Expr rpd_b = abs(r_r(x, y) - r_r(x-1, y+1));\n\n correction = g_b(x, y) - (g_r(x-1, y) + g_r(x, y+1))\/2;\n Expr rn_b = correction + (r_r(x-1, y) + r_r(x, y+1))\/2;\n Expr rnd_b = abs(r_r(x-1, y) - r_r(x, y+1));\n\n r_b(x, y) = Select(rpd_b < rnd_b, rp_b, rn_b);\n\n \/\/ Same thing for blue at red\n correction = g_r(x, y) - (g_b(x, y) + g_b(x+1, y-1))\/2;\n Expr bp_r = correction + (b_b(x, y) + b_b(x+1, y-1))\/2;\n Expr bpd_r = abs(b_b(x, y) - b_b(x+1, y-1));\n\n correction = g_r(x, y) - (g_b(x+1, y) + g_b(x, y-1))\/2;\n Expr bn_r = correction + (b_b(x+1, y) + b_b(x, y-1))\/2;\n Expr bnd_r = abs(b_b(x+1, y) - b_b(x, y-1));\n\n b_r(x, y) = Select(bpd_r < bnd_r, bp_r, bn_r); \n\n \/\/ Interleave the resulting channels\n Func r = interleave_y(interleave_x(r_gr, r_r),\n interleave_x(r_b, r_gb));\n Func g = interleave_y(interleave_x(g_gr, g_r),\n interleave_x(g_b, g_gb));\n Func b = interleave_y(interleave_x(b_gr, b_r), \n interleave_x(b_b, b_gb));\n\n Func output(\"dem\");\n output(x, y) = (r(x, y), g(x, y), b(x, y));\n\n return output;\n}\n\n\nFunc color_correct(Func input, UniformImage matrix_3200, UniformImage matrix_7000, Uniform<float> kelvin) {\n \/\/ Get a color matrix by linearly interpolating between two\n \/\/ calibrated matrices using inverse kelvin.\n\n Func matrix(\"matrix\");\n Expr alpha = (1.0f\/kelvin - 1.0f\/3200) \/ (1.0f\/7000 - 1.0f\/3200);\n matrix(x, y) = (matrix_3200(x, y) * alpha + \n matrix_7000(x, y) * (1 - alpha));\n\n Func corrected(\"corrected\");\n RVar j(0, 3);\n corrected(x, y, c) = Cast<int16_t>(Sum(matrix(j, c)*Cast<float>(input(x, y, j))) + matrix(3, c));\n return corrected;\n}\n\n\nFunc apply_curve(Func input, Uniform<float> gamma, Uniform<float> contrast) {\n \/\/ copied from FCam\n Func curve(\"curve\");\n\n Expr xf = Cast<float>(x)\/1024.0f;\n Expr g = pow(xf, 1.0f\/gamma);\n Expr b = 2.0f - pow(2.0f, contrast\/100.0f);\n Expr a = 2.0f - 2.0f*b; \n Expr z = Select(g > 0.5f,\n 1.0f - (a*(1.0f-g)*(1.0f-g) + b*(1.0f-g)),\n a*g*g + b*g);\n Expr val = Cast<uint8_t>(Clamp(z*256.0f, 0.0f, 255.0f));\n curve(x) = val; \/\/Debug(val, \"curve \", x, xf, g, z, val);\n\n Func curved(\"curved\");\n \/\/ This is after the color transform, so the input could be\n \/\/ negative or very large. Clamp it back to 10 bits before applying the curve.\n curved(x, y, c) = curve(Clamp(Cast<int32_t>(input(x, y, c)), 0, 1023));\n return curved;\n}\n\n\/*\nFunc rgb_to_yuv422(Func rgb) {\n Func Y;\n Func U;\n Func V;\n Func UV;\n Func YUV; \n}\n*\/\n\nFunc process(Func raw, \n UniformImage matrix_3200, UniformImage matrix_7000, Uniform<float> color_temp, \n Uniform<float> gamma, Uniform<float> contrast) {\n Func im = raw;\n im = hot_pixel_suppression(im);\n im = demosaic(im);\n im = color_correct(im, matrix_3200, matrix_7000, color_temp);\n im = apply_curve(im, gamma, contrast);\n\n \/*\n Func check;\n Var x, y, c;\n check(x, y, c) = Debug(im(x, y, c), \"after curve \", x, y, c, im(x, y, c));\n im = check;\n *\/\n\n \/\/im = rgb_to_yuv422(im);\n return im;\n}\n\nint main(int argc, char **argv) {\n UniformImage input(UInt(16), 2, \"raw\");\n UniformImage matrix_3200(Float(32), 2, \"m3200\"), matrix_7000(Float(32), 2, \"m7000\");\n Uniform<float> color_temp(\"color_temp\", 3200.0f);\n Uniform<float> gamma(\"gamma\", 1.8f);\n Uniform<float> contrast(\"contrast\", 10.0f);\n\n \/\/ add a boundary condition and treat things as signed ints\n \/\/ (demosaic might introduce negative values)\n Func clamped(\"in\");\n clamped(x, y) = Cast<int16_t>(input(Clamp(x, 0, input.width()-1),\n Clamp(y, 0, input.height()-1)));\n\n \/\/ Run the pipeline\n Func processed = process(clamped, matrix_3200, matrix_7000, color_temp, gamma, contrast);\n\n \/\/ Pick a schedule \n\n if (argc > 1) \n srand(atoi(argv[1]));\n else\n srand(0);\n\n Var xo(\"xo\"), yo(\"yo\"), c(\"c\"), xi(\"xi\"), yi(\"yi\");\n Func output;\n output(xo, yo, c) = processed(xo, yo, c);\n output.root().tile(xo, yo, xi, yi, 32, 16).transpose(yo, c).transpose(xo, c);\n\n std::vector<Func> funcs = output.rhs().funcs(); \n\n for (size_t i = 0; i < funcs.size(); i++) {\n if (funcs[i] == processed) {} \/\/ inline\n else if (funcs[i].name() == \"curve\") funcs[i].root();\n else funcs[i].chunk(xo);\n \/\/if (funcs[i].returnType() == UInt(8)) funcs[i].vectorize(x, 16);\n \/\/if (funcs[i].returnType() == Int(16)) funcs[i].vectorize(x, 8);\n \/\/if (funcs[i].returnType() == Float(32)) funcs[i].vectorize(x, 4);\n }\n\n output.compileToFile(\"curved\");\n \n return 0;\n}\n\n<|endoftext|>"} {"text":"<commit_before>#include <omp.h>\n#include <stdlib.h>\n#include <iostream>\n#include <mutex>\n#include <thread>\n#include <queue>\n#include <condition_variable>\n\nusing namespace std;\n\nconst int SCALE = 1500;\n\nconst int W = SCALE*2;\nconst int H = SCALE;\nconst int T = SCALE*2;\n\ndouble field[H][W];\ndouble field1[H][W];\n\nconst int OBS_N = 19;\n\ndouble obs_seq[OBS_N];\ndouble seq_max, seq_mid, seq_min;\n\ndouble obs_omp[OBS_N];\ndouble omp_max, omp_mid, omp_min;\n\ndouble obs_tet[OBS_N];\ndouble tet_max, tet_mid, tet_min;\n\nvoid shufle()\n{\n\tsrand(0);\n\tfor(int i=0;i<H;i++)\n\tfor(int j=0;j<W;j++) field[i][j]=rand();\n}\n\nvoid shufle1()\n{\n\tsrand(0);\n\tfor(int i=0;i<H;i++)\n\tfor(int j=0;j<W;j++) field1[i][j]=rand();\n}\n\nvoid op(int i)\n{\n\tfor (int j=1; j<W-1; j++)\n\t\tfield[i][j]=(field[i][j-1]+field[i][j+1]+\n\t\t\tfield[i-1][j]+field[i+1][j])*0.25;\n}\n\nvoid op1(int i)\n{\n\tfor (int j = 1; j<W - 1; j++)\n\t\tfield1[i][j] = (field1[i][j - 1] + field1[i][j + 1] +\n\t\tfield1[i - 1][j] + field1[i + 1][j])*0.25;\n}\n\ndouble seq_alg()\n{\n\tdouble time=omp_get_wtime();\n\n\tfor (int t=1;t<=T;t++)\n\tfor (int i=1;i<H-1;i++) op1(i);\n\t\n\treturn omp_get_wtime() - time;\n}\n\ndouble par_omp()\n{\n\tdouble time = omp_get_wtime();\n\n#pragma omp parallel shared(H,T)\n{\n\tfor (int t = 1; t <= (2 * T - 1) + (H - 3); t++){\n\n\t\tif (t % 2 == 1){\n#pragma omp for schedule(dynamic,1)\n\t\t\tfor (int i = 1; i<H - 1; i += 2)\n\t\t\t\tif (i <= t && i>t - 2 * T)\top(i);\n\t\t}\n\t\tif (t % 2 == 0){\n#pragma omp for schedule(dynamic,1)\n\t\t\tfor (int i = 2; i<H - 1; i += 2)\n\t\t\t\tif (i <= t && i>t - 2 * T)\top(i);\n\t\t}\n\t}\n}\n\treturn omp_get_wtime() - time;\n}\n\nbool compare()\n{\n\tfor(int i=0; i<H; i++)\n\tfor(int j=0; j<W; j++) if(field1[i][j]!=field[i][j])return false;\n\treturn true;\n}\n\nvoid min_max()\n{\n\tseq_max = seq_min = obs_seq[0];\n\tomp_max = omp_min = obs_omp[0];\n\ttet_max = tet_min = obs_tet[0];\n\n\tfor (int i = 1; i < OBS_N; i++){\n\t\tseq_max = obs_seq[i] > seq_max ? obs_seq[i] : seq_max;\n\t\tseq_min = obs_seq[i] < seq_min ? obs_seq[i] : seq_min;\n\n\t\tomp_max = obs_omp[i] > omp_max ? obs_omp[i] : omp_max;\n\t\tomp_min = obs_omp[i] < omp_min ? obs_omp[i] : omp_min;\n\n\t\ttet_max = obs_tet[i] > tet_max ? obs_tet[i] : tet_max;\n\t\ttet_min = obs_tet[i] < tet_min ? obs_tet[i] : tet_min;\n\t}\n\tseq_mid = (seq_min + seq_max) \/ 2;\n\tomp_mid = (omp_min + omp_max) \/ 2;\n\ttet_mid = (tet_min + tet_max) \/ 2;\n}\n\nstruct message;\nstruct actor;\n\nstruct engine{\n\tvolatile int active;\n\tstd::mutex mtx;\n\tstd::condition_variable cv;\n\tstd::queue<message*> ready;\n};\n\nstruct actor{\n\tstd::mutex mtx;\n\tvoid(*recv)(message*, actor*);\n};\n\nstruct message{\n\tactor*a;\n\tbool sending;\n};\n\ninline void send(engine*e, message*m, actor*a)\n{\n\tif (m->sending) return;\n\tm->sending = true;\tm->a = a;\n\tstd::unique_lock<std::mutex> lck(e->mtx);\n\te->ready.push(m);\te->cv.notify_one();\n}\n\ninline bool access(message*m, actor*a)\n{\n\treturn m->a == a && !m->sending;\n}\n\nvoid tfunc(engine*e)\n{\n\tmessage*m; actor*a;\n\n\tfor (;;){\n\t\t{\n\t\t\tstd::unique_lock<std::mutex> lck(e->mtx);\n\t\t\twhile (e->ready.empty()){\n\t\t\t\te->active--;\n\t\t\t\tif (!e->active){ e->cv.notify_one(); return; }\n\t\t\t\te->cv.wait(lck);\n\t\t\t\te->active++;\n\t\t\t}\n\t\t\tm = e->ready.front();\n\t\t\te->ready.pop();\n\t\t}\n\t\ta = m->a;\n\t\t{\n\t\t\tstd::unique_lock<std::mutex> lck(a->mtx);\n\t\t\tm->sending = false;\n\t\t\ta->recv(m, a);\n\t\t}\n\t}\n}\n\ndouble run(engine*e, int n = 1)\n{\n\tstd::vector<std::thread> threads(n);\n\te->active = n;\n\tfor (int i = 0; i<n; i++) threads[i] = std::thread(tfunc, e);\n\tdouble start = omp_get_wtime();\n\tfor (auto& th : threads) th.join();\n\treturn omp_get_wtime() - start;\n}\n\nconst int N = H - 2;\n\nengine e;\nactor as[N];\nmessage ms[N - 1];\nint ts[N];\n\nvoid recv(message* , actor* a)\n{\n\tint id = (int)(a - as);\n\n\tif ((id == 0 || access(&ms[id - 1], a)) &&\n\t\t(id == N - 1 || access(&ms[id], a)) &&\n\t\t(ts[id] <= T)){\n\n\t\top(id+1);\tts[id]++;\n\n\t\tif (id != 0)\tsend(&e, &ms[id - 1], &as[id - 1]);\n\t\tif (id != N - 1)\tsend(&e, &ms[id], &as[id + 1]);\n\t}\n}\n\ndouble par_tet()\n{\n\tfor (int i = 0; i < N; i++)\n\t{\n\t\tas[i].recv = recv; ts[i] = 1;\n\t}\n\tfor (int i = 0; i < N - 1; i++)\n\t{\n\t\tms[i].a = &as[i]; ms[i].sending = false;\n\t}\n\tsend(&e, &ms[0], &as[0]);\n\n\treturn run(&e, omp_get_max_threads());\n}\n\nvoid main()\n{\n\tfor (int i = 0; i < OBS_N; i++){\n\t\tshufle1();\tobs_seq[i] = seq_alg();\n\t\tshufle();\tobs_omp[i] = par_omp(); cout << (compare() ? \"OMP Ok \" : \"something wrong in OMP \");\n\t\tshufle();\tobs_tet[i] = par_tet(); cout << (compare() ? \"Templet Ok \" : \"something wrong in Templet \");\n\t\tcout << (int)((float)(i+1)\/OBS_N*100) << \"% done\" << endl;\n\t}\n\t\n\tmin_max();\t\n\n\tcout << \"\\nTest results for H = \" << H << \"; W = \" << W << \"; T = \" << T << \"; OMP max threads = \" << omp_get_max_threads() << \"\\n\";\n\t\n\tcout << \"\\nseq_min = \" << seq_min << \" sec; \" << \"\\nseq_mid = \" << seq_mid <<\" sec; \\nseq_max = \" << seq_max << \" sec\\n\"; \n\tcout << \"\\nomp_min = \" << omp_min << \" sec; \" << \"\\nomp_mid = \" << omp_mid << \" sec; \\nomp_max = \" << omp_max << \" sec\\n\";\n\tcout << \"\\ntet_min = \" << tet_min << \" sec; \" << \"\\ntet_mid = \" << tet_mid << \" sec; \\ntet_max = \" << tet_max << \" sec\\n\";\n}\n\n\/*\npublic class MyActor extends UntypedActor{\n\tpublic int id;\n\t\n\tpublic bool access_ms_id_minus_1 = false;\n\tpublic bool access_ms_id = false;\n\n\tpublic ActorRef id_minus_1 = null;\n\tpublic ActorRef id_plus_1 = null;\n\n\tpublic void onRecieve(Object m){ \/\/ Akka analog of void recv(message* , actor* a)\n\t\taccess_ms_id_1 = ((Integer)m.intValue() == id - 1);\n\t\taccess_ms_id = ((Integer)m.intValue == id);\n\n\t\tif ((id == 0 || access_ms_id_minus_1) &&\n\t\t\t(id == N - 1 || access_ms_id)) &&\n\t\t\t(ts[id] <= T)){\n\n\t\t\top(id + 1);\tts[id]++;\n\n\t\t\tif (id != 0)\t id_minus_1.sendOneWay(Integer(id - 1));\n\t\t\tif (id != N - 1) id_plus_1.sendOneWay(Integer(id));\n\t\t}\n\t}\n}\n*\/<commit_msg>renaming<commit_after>#include <omp.h>\n#include <stdlib.h>\n#include <iostream>\n#include <mutex>\n#include <thread>\n#include <queue>\n#include <condition_variable>\n\nusing namespace std;\n\nconst int SCALE = 1500;\n\nconst int W = SCALE*2;\nconst int H = SCALE;\nconst int T = SCALE*2;\n\ndouble field[H][W];\ndouble field1[H][W];\n\nconst int OBS_N = 19;\n\ndouble obs_seq[OBS_N];\ndouble seq_max, seq_mid, seq_min;\n\ndouble obs_omp[OBS_N];\ndouble omp_max, omp_mid, omp_min;\n\ndouble obs_tet[OBS_N];\ndouble tet_max, tet_mid, tet_min;\n\nvoid shufle()\n{\n\tsrand(0);\n\tfor(int i=0;i<H;i++)\n\tfor(int j=0;j<W;j++) field[i][j]=rand();\n}\n\nvoid shufle1()\n{\n\tsrand(0);\n\tfor(int i=0;i<H;i++)\n\tfor(int j=0;j<W;j++) field1[i][j]=rand();\n}\n\nvoid op(int i)\n{\n\tfor (int j=1; j<W-1; j++)\n\t\tfield[i][j]=(field[i][j-1]+field[i][j+1]+\n\t\t\tfield[i-1][j]+field[i+1][j])*0.25;\n}\n\nvoid op1(int i)\n{\n\tfor (int j = 1; j<W - 1; j++)\n\t\tfield1[i][j] = (field1[i][j - 1] + field1[i][j + 1] +\n\t\tfield1[i - 1][j] + field1[i + 1][j])*0.25;\n}\n\ndouble seq_alg()\n{\n\tdouble time=omp_get_wtime();\n\n\tfor (int t=1;t<=T;t++)\n\tfor (int i=1;i<H-1;i++) op1(i);\n\t\n\treturn omp_get_wtime() - time;\n}\n\ndouble par_omp()\n{\n\tdouble time = omp_get_wtime();\n\n#pragma omp parallel shared(H,T)\n{\n\tfor (int t = 1; t <= (2 * T - 1) + (H - 3); t++){\n\n\t\tif (t % 2 == 1){\n#pragma omp for schedule(dynamic,1)\n\t\t\tfor (int i = 1; i<H - 1; i += 2)\n\t\t\t\tif (i <= t && i>t - 2 * T)\top(i);\n\t\t}\n\t\tif (t % 2 == 0){\n#pragma omp for schedule(dynamic,1)\n\t\t\tfor (int i = 2; i<H - 1; i += 2)\n\t\t\t\tif (i <= t && i>t - 2 * T)\top(i);\n\t\t}\n\t}\n}\n\treturn omp_get_wtime() - time;\n}\n\nbool compare()\n{\n\tfor(int i=0; i<H; i++)\n\tfor(int j=0; j<W; j++) if(field1[i][j]!=field[i][j])return false;\n\treturn true;\n}\n\nvoid min_max()\n{\n\tseq_max = seq_min = obs_seq[0];\n\tomp_max = omp_min = obs_omp[0];\n\ttet_max = tet_min = obs_tet[0];\n\n\tfor (int i = 1; i < OBS_N; i++){\n\t\tseq_max = obs_seq[i] > seq_max ? obs_seq[i] : seq_max;\n\t\tseq_min = obs_seq[i] < seq_min ? obs_seq[i] : seq_min;\n\n\t\tomp_max = obs_omp[i] > omp_max ? obs_omp[i] : omp_max;\n\t\tomp_min = obs_omp[i] < omp_min ? obs_omp[i] : omp_min;\n\n\t\ttet_max = obs_tet[i] > tet_max ? obs_tet[i] : tet_max;\n\t\ttet_min = obs_tet[i] < tet_min ? obs_tet[i] : tet_min;\n\t}\n\tseq_mid = (seq_min + seq_max) \/ 2;\n\tomp_mid = (omp_min + omp_max) \/ 2;\n\ttet_mid = (tet_min + tet_max) \/ 2;\n}\n\nstruct message;\nstruct actor;\n\nstruct engine{\n\tvolatile int active;\n\tstd::mutex mtx;\n\tstd::condition_variable cv;\n\tstd::queue<message*> ready;\n};\n\nstruct actor{\n\tstd::mutex mtx;\n\tvoid(*recv)(message*, actor*);\n};\n\nstruct message{\n\tactor*a;\n\tbool sending;\n};\n\ninline void send(engine*e, message*m, actor*a)\n{\n\tif (m->sending) return;\n\tm->sending = true;\tm->a = a;\n\tstd::unique_lock<std::mutex> lck(e->mtx);\n\te->ready.push(m);\te->cv.notify_one();\n}\n\ninline bool access(message*m, actor*a)\n{\n\treturn m->a == a && !m->sending;\n}\n\nvoid tfunc(engine*e)\n{\n\tmessage*m; actor*a;\n\n\tfor (;;){\n\t\t{\n\t\t\tstd::unique_lock<std::mutex> lck(e->mtx);\n\t\t\twhile (e->ready.empty()){\n\t\t\t\te->active--;\n\t\t\t\tif (!e->active){ e->cv.notify_one(); return; }\n\t\t\t\te->cv.wait(lck);\n\t\t\t\te->active++;\n\t\t\t}\n\t\t\tm = e->ready.front();\n\t\t\te->ready.pop();\n\t\t}\n\t\ta = m->a;\n\t\t{\n\t\t\tstd::unique_lock<std::mutex> lck(a->mtx);\n\t\t\tm->sending = false;\n\t\t\ta->recv(m, a);\n\t\t}\n\t}\n}\n\ndouble run(engine*e, int n = 1)\n{\n\tstd::vector<std::thread> threads(n);\n\te->active = n;\n\tfor (int i = 0; i<n; i++) threads[i] = std::thread(tfunc, e);\n\tdouble start = omp_get_wtime();\n\tfor (auto& th : threads) th.join();\n\treturn omp_get_wtime() - start;\n}\n\nconst int N = H - 2;\n\nengine e;\nactor as[N];\nmessage ms[N - 1];\nint ts[N];\n\nvoid recv(message* , actor* a)\n{\n\tint id = (int)(a - as);\n\n\tif ((id == 0 || access(&ms[id - 1], a)) &&\n\t\t(id == N - 1 || access(&ms[id], a)) &&\n\t\t(ts[id] <= T)){\n\n\t\top(id+1);\tts[id]++;\n\n\t\tif (id != 0)\tsend(&e, &ms[id - 1], &as[id - 1]);\n\t\tif (id != N - 1)\tsend(&e, &ms[id], &as[id + 1]);\n\t}\n}\n\ndouble par_tet()\n{\n\tfor (int i = 0; i < N; i++)\n\t{\n\t\tas[i].recv = recv; ts[i] = 1;\n\t}\n\tfor (int i = 0; i < N - 1; i++)\n\t{\n\t\tms[i].a = &as[i]; ms[i].sending = false;\n\t}\n\tsend(&e, &ms[0], &as[0]);\n\n\treturn run(&e, omp_get_max_threads());\n}\n\nvoid main()\n{\n\tfor (int i = 0; i < OBS_N; i++){\n\t\tshufle1();\tobs_seq[i] = seq_alg();\n\t\tshufle();\tobs_omp[i] = par_omp(); cout << (compare() ? \"OMP Ok \" : \"something wrong in OMP \");\n\t\tshufle();\tobs_tet[i] = par_tet(); cout << (compare() ? \"Templet Ok \" : \"something wrong in Templet \");\n\t\tcout << (int)((float)(i+1)\/OBS_N*100) << \"% done\" << endl;\n\t}\n\t\n\tmin_max();\t\n\n\tcout << \"\\nTest results for H = \" << H << \"; W = \" << W << \"; T = \" << T << \"; OMP max threads = \" << omp_get_max_threads() << \"\\n\";\n\t\n\tcout << \"\\nseq_min = \" << seq_min << \" sec; \" << \"\\nseq_mid = \" << seq_mid <<\" sec; \\nseq_max = \" << seq_max << \" sec\\n\"; \n\tcout << \"\\nomp_min = \" << omp_min << \" sec; \" << \"\\nomp_mid = \" << omp_mid << \" sec; \\nomp_max = \" << omp_max << \" sec\\n\";\n\tcout << \"\\ntet_min = \" << tet_min << \" sec; \" << \"\\ntet_mid = \" << tet_mid << \" sec; \\ntet_max = \" << tet_max << \" sec\\n\";\n}\n\n\/*\npublic class MyActor extends UntypedActor{\n\tpublic int id;\n\t\n\tpublic bool access_ms_id_minus_1 = false;\n\tpublic bool access_ms_id = false;\n\n\tpublic ActorRef id_minus_1 = null;\n\tpublic ActorRef id_plus_1 = null;\n\n\tpublic void onRecieve(Object m){ \/\/ Akka analog of void recv(message* , actor* a)\n\t\tif ((Integer)m.intValue() == id - 1) access_ms_id_minus_1 = true;\n\t\tif((Integer)m.intValue == id) access_ms_id = true;\n\n\t\tif ((id == 0 || access_ms_id_minus_1) &&\n\t\t\t(id == N - 1 || access_ms_id)) &&\n\t\t\t(ts[id] <= T)){\n\n\t\t\top(id + 1);\tts[id]++;\n\n\t\t\tif (id != 0){id_minus_1.sendOneWay(Integer(id - 1));access_ms_id_minus_1 = false;}\n\t\t\tif (id != N - 1){id_plus_1.sendOneWay(Integer(id));access_ms_id = false;}\n\t\t}\n\t}\n}\n*\/<|endoftext|>"} {"text":"<commit_before>\/****************************************************************\/\n\/* MOOSE - Multiphysics Object Oriented Simulation Environment *\/\n\/* *\/\n\/* All contents are licensed under LGPL V2.1 *\/\n\/* See LICENSE for full restrictions *\/\n\/****************************************************************\/\n#include \"CPPlasticEnergyMaterial.h\"\n\/\/ #include \"CrystalPlasticityStateVariable.h\"\n\ntemplate <>\nInputParameters\nvalidParams<CPPlasticEnergyMaterial>()\n{\n InputParameters params = validParams<DerivativeFunctionMaterialBase>();\n params.addClassDescription(\"Free energy material for the plastic energy contributions. Based on Mellbin 2017\");\n params.addRequiredParam<std::string>(\"uo_state_var_name\",\n \"Name of state variable property: Same as \"\n \"state variable user object specified in input \"\n \"file.\");\n params.addRequiredCoupledVar(\"args\", \"Arguments of F() - use vector coupling\");\n params.addParam<Real>(\"Q\", 1, \"Hardening parameter SHOULD BE ALREADY USED SOMEWHERE...\");\n params.addParam<Real>(\"q\", 1.4, \"Cross-hardening parameter\");\n \/\/ params.addParam<Real>(\"s0\", 0, \"Initial value of slip resistance\"); \/\/Should make a vector\n params.addRequiredParam<unsigned int>(\"variable_size\", \"Number of slip systems.\");\n params.addParam<std::vector<unsigned int>>(\"groups\",\n \"To group the initial values on different \"\n \"slip systems 'format: [start end)', i.e.'0 \"\n \"4 8 11' groups 0-3, 4-7 and 8-11 \");\n params.addParam<std::vector<Real>>(\"group_values\",\n \"The initial values correspoinding to each \"\n \"group, i.e. '0.0 1.0 2.0' means 0-4 = 0.0, \"\n \"4-8 = 1.0 and 8-12 = 2.0 \");\n return params;\n}\n\nCPPlasticEnergyMaterial::CPPlasticEnergyMaterial(const InputParameters & parameters)\n : DerivativeFunctionMaterialBase(parameters),\n _variable_size(getParam<unsigned int>(\"variable_size\")),\n _mat_prop_state_var(\n getMaterialProperty<std::vector<Real>>(parameters.get<std::string>(\"uo_state_var_name\"))),\n _Q(getParam<Real>(\"Q\")),\n _q(getParam<Real>(\"q\")),\n \/\/ _s0(getParam<Real>(\"s0\")),\n _groups(getParam<std::vector<unsigned int>>(\"groups\")),\n _group_values(getParam<std::vector<Real>>(\"group_values\"))\n{\n\n}\nReal\nCPPlasticEnergyMaterial::computeF()\n{\n std::vector<Real> s0;\n s0.resize(_variable_size);\n for (unsigned int i = 0; i < _groups.size() - 1; ++i)\n {\n unsigned int is, ie;\n\n is = _groups[i];\n ie = _groups[i + 1] - 1;\n\n if (is > ie)\n mooseError(\"CPPlasticEnergyMaterial: Start index is = \",\n is,\n \" should be greater than end index ie = \",\n ie,\n \" in state variable read\");\n\n for (unsigned int j = is; j <= ie; ++j)\n s0[j] = _group_values[i];\n }\n\n\n Real sum, qab;\n sum = 0;\n \/\/ Loop over all slip systems\n for (unsigned int i = 0; i < _variable_size; ++i)\n {\n for (unsigned int j = 0; j < _variable_size; ++j)\n {\n \/\/ unsigned int iplane, jplane;\n \/\/ iplane = i \/ 2;\n \/\/ jplane = j \/ 2;\n \/\/\n \/\/ \/\/ Not sure why not if i==j\n \/\/ if (iplane == jplane) \/\/ Kalidindi\n if (i == j)\n qab = 1.0;\n \/\/ else\n \/\/ qab = _q;\n else if ( i >=20 || j >=20)\n qab = _q;\n\n else if ((i == 0||i==4)||(i==14||i==15))\n if ((j == 0||j==4)||(j==14||j==15))\n qab = 1.0;\n else if ((i == 1||i==5)||(i==12||i==13))\n if ((j == 1||j==5)||(j==12||j==13))\n qab = 1.0;\n else if ((i==2||i==6)||(i==7||i==10))\n if ((j==2||j==6)||(j==7||j==10))\n qab = 1.0;\n\n else if ((i==3||i==8)||(i==9||i==11))\n if ((j==3||j==8)||(j==9||j==11))\n qab = 1.0;\n\n else if (i>=16&&i<=19)\n if (i>=16&&i<=19)\n qab = 1.0;\n\n else\n qab = _q;\n\n sum += qab * _mat_prop_state_var[_qp][i] * _mat_prop_state_var[_qp][j];\n \/\/ This will not give sum = 0 for purely elastic so must subtract initial value of _mat_prop_state_var\n \/\/ sum -= qab * s0[i] * s0[j];\n\n }\n }\n\n return 0.5 * _Q * sum;\n}\n\n\/\/\/ Do not know which derivatives I must calculate so just return 0\nReal\nCPPlasticEnergyMaterial::computeDF(unsigned int i_var)\n{\n return 0;\n}\n\nReal\nCPPlasticEnergyMaterial::computeD2F(unsigned int i_var, unsigned int j_var)\n{\n return 0;\n}\n<commit_msg>subtract initial state variable value<commit_after>\/****************************************************************\/\n\/* MOOSE - Multiphysics Object Oriented Simulation Environment *\/\n\/* *\/\n\/* All contents are licensed under LGPL V2.1 *\/\n\/* See LICENSE for full restrictions *\/\n\/****************************************************************\/\n#include \"CPPlasticEnergyMaterial.h\"\n\/\/ #include \"CrystalPlasticityStateVariable.h\"\n\ntemplate <>\nInputParameters\nvalidParams<CPPlasticEnergyMaterial>()\n{\n InputParameters params = validParams<DerivativeFunctionMaterialBase>();\n params.addClassDescription(\"Free energy material for the plastic energy contributions. Based on Mellbin 2017\");\n params.addRequiredParam<std::string>(\"uo_state_var_name\",\n \"Name of state variable property: Same as \"\n \"state variable user object specified in input \"\n \"file.\");\n params.addRequiredCoupledVar(\"args\", \"Arguments of F() - use vector coupling\");\n params.addParam<Real>(\"Q\", 1, \"Hardening parameter SHOULD BE ALREADY USED SOMEWHERE...\");\n params.addParam<Real>(\"q\", 1.4, \"Cross-hardening parameter\");\n \/\/ params.addParam<Real>(\"s0\", 0, \"Initial value of slip resistance\"); \/\/Should make a vector\n params.addRequiredParam<unsigned int>(\"variable_size\", \"Number of slip systems.\");\n params.addParam<std::vector<unsigned int>>(\"groups\",\n \"To group the initial values on different \"\n \"slip systems 'format: [start end)', i.e.'0 \"\n \"4 8 11' groups 0-3, 4-7 and 8-11 \");\n params.addParam<std::vector<Real>>(\"group_values\",\n \"The initial values correspoinding to each \"\n \"group, i.e. '0.0 1.0 2.0' means 0-4 = 0.0, \"\n \"4-8 = 1.0 and 8-12 = 2.0 \");\n return params;\n}\n\nCPPlasticEnergyMaterial::CPPlasticEnergyMaterial(const InputParameters & parameters)\n : DerivativeFunctionMaterialBase(parameters),\n _variable_size(getParam<unsigned int>(\"variable_size\")),\n _mat_prop_state_var(\n getMaterialProperty<std::vector<Real>>(parameters.get<std::string>(\"uo_state_var_name\"))),\n _Q(getParam<Real>(\"Q\")),\n _q(getParam<Real>(\"q\")),\n \/\/ _s0(getParam<Real>(\"s0\")),\n _groups(getParam<std::vector<unsigned int>>(\"groups\")),\n _group_values(getParam<std::vector<Real>>(\"group_values\"))\n{\n\n}\nReal\nCPPlasticEnergyMaterial::computeF()\n{\n std::vector<Real> s0;\n s0.resize(_variable_size);\n for (unsigned int i = 0; i < _groups.size() - 1; ++i)\n {\n unsigned int is, ie;\n\n is = _groups[i];\n ie = _groups[i + 1] - 1;\n\n if (is > ie)\n mooseError(\"CPPlasticEnergyMaterial: Start index is = \",\n is,\n \" should be greater than end index ie = \",\n ie,\n \" in state variable read\");\n\n for (unsigned int j = is; j <= ie; ++j)\n s0[j] = _group_values[i];\n }\n\n\n Real sum, qab;\n sum = 0;\n \/\/ Loop over all slip systems\n for (unsigned int i = 0; i < _variable_size; ++i)\n {\n for (unsigned int j = 0; j < _variable_size; ++j)\n {\n \/\/ unsigned int iplane, jplane;\n \/\/ iplane = i \/ 2;\n \/\/ jplane = j \/ 2;\n \/\/\n \/\/ \/\/ Not sure why not if i==j\n \/\/ if (iplane == jplane) \/\/ Kalidindi\n if (i == j)\n qab = 1.0;\n \/\/ else\n \/\/ qab = _q;\n else if ( i >=20 || j >=20)\n qab = _q;\n\n else if ((i == 0||i==4)||(i==14||i==15))\n if ((j == 0||j==4)||(j==14||j==15))\n qab = 1.0;\n else if ((i == 1||i==5)||(i==12||i==13))\n if ((j == 1||j==5)||(j==12||j==13))\n qab = 1.0;\n else if ((i==2||i==6)||(i==7||i==10))\n if ((j==2||j==6)||(j==7||j==10))\n qab = 1.0;\n\n else if ((i==3||i==8)||(i==9||i==11))\n if ((j==3||j==8)||(j==9||j==11))\n qab = 1.0;\n\n else if (i>=16&&i<=19)\n if (i>=16&&i<=19)\n qab = 1.0;\n\n else\n qab = _q;\n\n sum += qab * _mat_prop_state_var[_qp][i] * _mat_prop_state_var[_qp][j];\n \/\/ This will not give sum = 0 for purely elastic so must subtract initial value of _mat_prop_state_var\n sum -= qab * s0[i] * s0[j];\n\n }\n }\n\n return 0.5 * _Q * sum;\n}\n\n\/\/\/ Do not know which derivatives I must calculate so just return 0\nReal\nCPPlasticEnergyMaterial::computeDF(unsigned int i_var)\n{\n return 0;\n}\n\nReal\nCPPlasticEnergyMaterial::computeD2F(unsigned int i_var, unsigned int j_var)\n{\n return 0;\n}\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 \"paddle\/fluid\/framework\/ir\/graph_helper.h\"\n#include <algorithm>\n#include <deque>\n#include <fstream>\n#include <iosfwd>\n#include <ostream>\n#include <stack>\n#include <unordered_map>\n#include <unordered_set>\n#include \"paddle\/fluid\/framework\/ir\/graph_traits.h\"\n\nDEFINE_string(print_sub_graph_dir, \"\",\n \"FLAGS_print_sub_graph_dir is used \"\n \"to print the nodes of sub_graphs.\");\n\nnamespace paddle {\nnamespace framework {\nnamespace ir {\nnamespace {\nvoid SortHelper(\n const std::map<ir::Node *, std::unordered_set<ir::Node *>> &adj_list,\n ir::Node *node, std::unordered_set<ir::Node *> *visited,\n std::vector<ir::Node *> *ret) {\n visited->insert(node);\n\n for (auto adj : adj_list.at(node)) {\n if (visited->find(adj) == visited->end()) {\n SortHelper(adj_list, adj, visited, ret);\n }\n }\n\n VLOG(5) << \"topology sort insert: \" << node->Name() << \" \"\n << reinterpret_cast<void *>(node) << \" input \" << node->inputs.size();\n ret->push_back(node);\n}\n\nbool HasCircleHelper(\n ir::Node *node,\n const std::map<ir::Node *, std::unordered_set<ir::Node *>> &adj_list,\n std::unordered_set<ir::Node *> *visited,\n std::unordered_set<ir::Node *> *in_trace,\n std::vector<std::vector<ir::Node *>> *circles) {\n if (visited->find(node) == visited->end()) {\n visited->insert(node);\n in_trace->insert(node);\n\n for (ir::Node *in : adj_list.at(node)) {\n if (visited->find(in) == visited->end() &&\n HasCircleHelper(in, adj_list, visited, in_trace, circles)) {\n return true;\n } else if (in_trace->find(in) != in_trace->end()) {\n if (circles != nullptr) {\n std::vector<ir::Node *> circle;\n circle.emplace_back(in);\n ir::Node *p = in;\n for (auto &adj : adj_list.at(p)) {\n if (in_trace->count(adj)) {\n circle.emplace_back(adj);\n p = adj;\n }\n }\n circles->emplace_back(circle);\n }\n return true;\n }\n }\n }\n in_trace->erase(node);\n return false;\n}\n\nbool HasCircleInternal(\n const std::map<ir::Node *, std::unordered_set<ir::Node *>> &adj_list,\n std::vector<std::vector<ir::Node *>> *circles) {\n std::unordered_set<ir::Node *> visited;\n std::unordered_set<ir::Node *> in_trace;\n for (auto &adj : adj_list) {\n if (HasCircleHelper(adj.first, adj_list, &visited, &in_trace, circles)) {\n return true;\n }\n }\n return false;\n}\n} \/\/ namespace\n\nbool HasCircle(const Graph &graph) {\n return HasCircleInternal(BuildOperationAdjList(graph), nullptr);\n}\n\nbool FindCircleSubGraph(const Graph &graph,\n std::vector<std::vector<ir::Node *>> *circles) {\n return HasCircleInternal(BuildOperationAdjList(graph), circles);\n}\n\nstd::vector<ir::Node *> TopologySortOperations(const Graph &graph) {\n std::map<ir::Node *, std::unordered_set<ir::Node *>> adj_list =\n BuildOperationAdjList(graph);\n PADDLE_ENFORCE(!HasCircleInternal(adj_list, nullptr));\n std::unordered_set<ir::Node *> visited;\n std::vector<ir::Node *> ret;\n for (auto adj : adj_list) {\n if (visited.find(adj.first) == visited.end()) {\n SortHelper(adj_list, adj.first, &visited, &ret);\n }\n }\n return ret;\n}\n\n\/\/ Build operator inlink edge table.\nstd::map<ir::Node *, std::unordered_set<ir::Node *>> BuildOperationAdjList(\n const Graph &graph) {\n std::map<ir::Node *, std::unordered_set<ir::Node *>> adj_list;\n\n for (auto &n : graph.Nodes()) {\n if (!n->IsOp()) continue;\n if (adj_list.find(n) == adj_list.end()) {\n adj_list[n] = std::unordered_set<ir::Node *>();\n }\n for (auto &var : n->inputs) {\n for (auto &adj_n : var->inputs) {\n PADDLE_ENFORCE(adj_n->NodeType() == ir::Node::Type::kOperation);\n VLOG(4) << \"adj \" << adj_n->Name() << reinterpret_cast<void *>(adj_n)\n << \" -> \" << n->Name() << reinterpret_cast<void *>(n)\n << \" via \" << var->Name() << reinterpret_cast<void *>(var);\n adj_list[n].insert(adj_n);\n }\n }\n }\n return adj_list;\n}\n\n\/\/ Build operator outlink edge table.\nstd::map<ir::Node *, std::unordered_set<ir::Node *>> BuildOperationOutAdjList(\n const Graph &graph) {\n std::map<ir::Node *, std::unordered_set<ir::Node *>> adj_list;\n\n for (auto &n : graph.Nodes()) {\n if (!n->IsOp()) continue;\n if (adj_list.find(n) == adj_list.end()) {\n adj_list[n] = std::unordered_set<ir::Node *>();\n }\n for (auto &var : n->outputs) {\n for (auto &adj_n : var->outputs) {\n PADDLE_ENFORCE(adj_n->NodeType() == ir::Node::Type::kOperation);\n VLOG(40) << \"adj \" << adj_n->Name() << reinterpret_cast<void *>(adj_n)\n << \" -> \" << n->Name() << reinterpret_cast<void *>(n)\n << \" via \" << var->Name() << reinterpret_cast<void *>(var);\n adj_list[n].insert(adj_n);\n }\n }\n }\n return adj_list;\n}\n\nstd::vector<ir::Node *> OpDFSSort(const Graph &graph) {\n auto edge_table = BuildOperationOutAdjList(graph);\n std::stack<Node *> stack;\n for (auto &ele : edge_table) {\n if (ele.first->inputs.empty()) {\n \/\/ find the input ops (those without input vars)\n stack.push(ele.first);\n } else {\n \/\/ find the ops with only persistable vars as inputs.\n bool all_persistable = true;\n for (auto *input : ele.first->inputs) {\n if (!(input->IsVar() && input->Var() && input->Var()->Persistable())) {\n all_persistable = false;\n }\n }\n if (all_persistable) {\n stack.push(ele.first);\n }\n }\n }\n\n std::vector<Node *> res;\n \/\/ start from the feed op and DFS\n std::unordered_set<Node *> unique_set;\n while (!stack.empty()) {\n \/\/ will start from the last feed by default.\n auto cur = stack.top();\n stack.pop();\n unique_set.insert(cur);\n res.push_back(cur);\n\n for (auto *op : edge_table[cur]) {\n if (!unique_set.count(op)) {\n stack.push(op);\n }\n }\n }\n return res;\n}\n\nstd::vector<ir::Node *> TopologyDfsSortOperations(const Graph &graph) {\n std::vector<ir::Node *> nodes;\n std::unordered_map<Node *, int> in_degree;\n\n auto set_out_ops_ready = [&](Node *var) {\n for (auto *op : var->outputs) {\n --in_degree[op];\n }\n };\n \/\/ build in_degree\n for (auto *node : graph.Nodes()) {\n if (node->IsOp()) {\n in_degree[node] += node->inputs.size();\n } else if (node->IsVar() && node->inputs.empty()) {\n \/\/ put all the inputs of the whole graph ready.\n set_out_ops_ready(node);\n }\n }\n\n std::deque<Node *> op_queue;\n \/\/ first visit\n for (auto &node : OpDFSSort(graph)) {\n if (node->IsOp()) {\n op_queue.push_back(node);\n }\n }\n\n \/\/ traverse the graph\n int num_ops = op_queue.size();\n while (num_ops) {\n for (auto it = op_queue.begin(); it != op_queue.end(); it++) {\n auto *&cur_op = *it;\n if (!cur_op || in_degree[cur_op] > 0) continue;\n \/\/ visit this node\n \/\/ put all the output var of this op valid.\n for (auto *out_var : cur_op->outputs) {\n if (!out_var) continue;\n set_out_ops_ready(out_var);\n }\n VLOG(8) << \"visit \" << cur_op->Name();\n nodes.push_back(cur_op);\n\n cur_op = nullptr;\n num_ops--;\n }\n }\n\n return nodes;\n}\n\nsize_t GraphNum(const Graph &graph) {\n std::unordered_set<ir::Node *> nodes(graph.Nodes());\n std::unordered_set<ir::Node *> visited_nodes;\n visited_nodes.reserve(nodes.size());\n std::deque<ir::Node *> q_nodes;\n std::vector<std::unordered_set<ir::Node *>> graph_nodes;\n std::unordered_set<ir::Node *> g_nodes;\n \/\/ q_set used to record records in the queue.\n std::unordered_set<ir::Node *> q_set;\n size_t graph_count = 0;\n\n auto traverse_nodes = [&visited_nodes, &q_nodes,\n &q_set](const std::vector<ir::Node *> &nodes) {\n for (auto n : nodes) {\n if (visited_nodes.count(n) == 0 && q_set.count(n) == 0) {\n q_nodes.push_back(n);\n q_set.insert(n);\n }\n }\n };\n\n while (visited_nodes.size() != nodes.size()) {\n if (!q_nodes.empty()) {\n auto cur_node = q_nodes.front();\n q_nodes.pop_front();\n q_set.erase(cur_node);\n visited_nodes.insert(cur_node);\n g_nodes.insert(cur_node);\n traverse_nodes(cur_node->inputs);\n traverse_nodes(cur_node->outputs);\n } else {\n ++graph_count;\n if (g_nodes.size()) {\n graph_nodes.emplace_back(g_nodes);\n }\n g_nodes.clear();\n for (auto &n : nodes) {\n if (visited_nodes.count(n) == 0) {\n q_nodes.push_back(n);\n q_set.insert(n);\n break;\n }\n }\n }\n }\n\n if (g_nodes.size()) {\n graph_nodes.emplace_back(g_nodes);\n }\n\n if (FLAGS_print_sub_graph_dir.size()) {\n if (graph_nodes.size() > 1) {\n std::stringstream out;\n for (auto &g_n : graph_nodes) {\n out << \"graph_nodes: \" << g_n.size() << \"\\n\";\n }\n out << \"\\n\\n\";\n for (auto &g_n : graph_nodes) {\n out << \"graph_nodes: \" << g_n.size();\n for (auto &node : g_n) {\n out << \"\\nNode: \" << node->Name() << \" in [\";\n for (auto &n : node->inputs) {\n out << n->Name() << \", \";\n }\n out << \"], out[\";\n for (auto &n : node->outputs) {\n out << n->Name() << \", \";\n }\n out << \"]\";\n }\n out << \"\\n\\n\\n\";\n }\n std::unique_ptr<std::ostream> fout(\n new std::ofstream(FLAGS_print_sub_graph_dir));\n PADDLE_ENFORCE(fout->good());\n *fout << out.str();\n }\n }\n\n return graph_count;\n}\n\nvoid CleanIndividualNodes(Graph *graph) {\n std::unordered_set<Node *> nodes2rm;\n for (auto *node : graph->Nodes()) {\n if (node->inputs.empty() && node->outputs.empty()) {\n nodes2rm.insert(node);\n }\n }\n\n for (auto *node : nodes2rm) {\n graph->RemoveNode(node);\n }\n}\n\nstd::vector<Node *> TopologyVarientSort(const Graph &graph,\n SortKind sort_kind) {\n switch (sort_kind) {\n case SortKind::TS:\n return framework::ir::TopologySortOperations(graph);\n default:\n return framework::ir::TopologyDfsSortOperations(graph);\n }\n}\n\n} \/\/ namespace ir\n} \/\/ namespace framework\n} \/\/ namespace paddle\n<commit_msg>Fix the node's order issue when the content of graph is changed (#16088)<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 \"paddle\/fluid\/framework\/ir\/graph_helper.h\"\n#include <algorithm>\n#include <deque>\n#include <fstream>\n#include <iosfwd>\n#include <ostream>\n#include <stack>\n#include <unordered_map>\n#include <unordered_set>\n#include \"paddle\/fluid\/framework\/ir\/graph_traits.h\"\n\nDEFINE_string(print_sub_graph_dir, \"\",\n \"FLAGS_print_sub_graph_dir is used \"\n \"to print the nodes of sub_graphs.\");\n\nnamespace paddle {\nnamespace framework {\nnamespace ir {\nnamespace {\nvoid SortHelper(\n const std::map<ir::Node *, std::unordered_set<ir::Node *>> &adj_list,\n ir::Node *node, std::unordered_set<ir::Node *> *visited,\n std::vector<ir::Node *> *ret) {\n visited->insert(node);\n\n for (auto adj : adj_list.at(node)) {\n if (visited->find(adj) == visited->end()) {\n SortHelper(adj_list, adj, visited, ret);\n }\n }\n\n VLOG(5) << \"topology sort insert: \" << node->Name() << \" \"\n << reinterpret_cast<void *>(node) << \" input \" << node->inputs.size();\n ret->push_back(node);\n}\n\nbool HasCircleHelper(\n ir::Node *node,\n const std::map<ir::Node *, std::unordered_set<ir::Node *>> &adj_list,\n std::unordered_set<ir::Node *> *visited,\n std::unordered_set<ir::Node *> *in_trace,\n std::vector<std::vector<ir::Node *>> *circles) {\n if (visited->find(node) == visited->end()) {\n visited->insert(node);\n in_trace->insert(node);\n\n for (ir::Node *in : adj_list.at(node)) {\n if (visited->find(in) == visited->end() &&\n HasCircleHelper(in, adj_list, visited, in_trace, circles)) {\n return true;\n } else if (in_trace->find(in) != in_trace->end()) {\n if (circles != nullptr) {\n std::vector<ir::Node *> circle;\n circle.emplace_back(in);\n ir::Node *p = in;\n for (auto &adj : adj_list.at(p)) {\n if (in_trace->count(adj)) {\n circle.emplace_back(adj);\n p = adj;\n }\n }\n circles->emplace_back(circle);\n }\n return true;\n }\n }\n }\n in_trace->erase(node);\n return false;\n}\n\nbool HasCircleInternal(\n const std::map<ir::Node *, std::unordered_set<ir::Node *>> &adj_list,\n std::vector<std::vector<ir::Node *>> *circles) {\n std::unordered_set<ir::Node *> visited;\n std::unordered_set<ir::Node *> in_trace;\n for (auto &adj : adj_list) {\n if (HasCircleHelper(adj.first, adj_list, &visited, &in_trace, circles)) {\n return true;\n }\n }\n return false;\n}\n} \/\/ namespace\n\nbool HasCircle(const Graph &graph) {\n return HasCircleInternal(BuildOperationAdjList(graph), nullptr);\n}\n\nbool FindCircleSubGraph(const Graph &graph,\n std::vector<std::vector<ir::Node *>> *circles) {\n return HasCircleInternal(BuildOperationAdjList(graph), circles);\n}\n\nstd::vector<ir::Node *> TopologySortOperations(const Graph &graph) {\n std::map<ir::Node *, std::unordered_set<ir::Node *>> adj_list =\n BuildOperationAdjList(graph);\n PADDLE_ENFORCE(!HasCircleInternal(adj_list, nullptr));\n std::unordered_set<ir::Node *> visited;\n std::vector<ir::Node *> ret;\n for (auto adj : adj_list) {\n if (visited.find(adj.first) == visited.end()) {\n SortHelper(adj_list, adj.first, &visited, &ret);\n }\n }\n return ret;\n}\n\n\/\/ Build operator inlink edge table.\nstd::map<ir::Node *, std::unordered_set<ir::Node *>> BuildOperationAdjList(\n const Graph &graph) {\n std::map<ir::Node *, std::unordered_set<ir::Node *>> adj_list;\n\n for (auto &n : graph.Nodes()) {\n if (!n->IsOp()) continue;\n if (adj_list.find(n) == adj_list.end()) {\n adj_list[n] = std::unordered_set<ir::Node *>();\n }\n std::vector<ir::Node *> nodes;\n for (auto &var : n->inputs) {\n for (auto &adj_n : var->inputs) {\n PADDLE_ENFORCE(adj_n->NodeType() == ir::Node::Type::kOperation);\n VLOG(4) << \"adj \" << adj_n->Name() << reinterpret_cast<void *>(adj_n)\n << \" -> \" << n->Name() << reinterpret_cast<void *>(n)\n << \" via \" << var->Name() << reinterpret_cast<void *>(var);\n nodes.push_back(adj_n);\n }\n }\n std::sort(nodes.begin(), nodes.end(), [](ir::Node *node1, ir::Node *node2) {\n return node1->id() > node2->id();\n });\n adj_list[n].insert(std::make_move_iterator(nodes.begin()),\n std::make_move_iterator(nodes.end()));\n }\n return adj_list;\n}\n\n\/\/ Build operator outlink edge table.\nstd::map<ir::Node *, std::unordered_set<ir::Node *>> BuildOperationOutAdjList(\n const Graph &graph) {\n std::map<ir::Node *, std::unordered_set<ir::Node *>> adj_list;\n\n for (auto &n : graph.Nodes()) {\n if (!n->IsOp()) continue;\n if (adj_list.find(n) == adj_list.end()) {\n adj_list[n] = std::unordered_set<ir::Node *>();\n }\n for (auto &var : n->outputs) {\n for (auto &adj_n : var->outputs) {\n PADDLE_ENFORCE(adj_n->NodeType() == ir::Node::Type::kOperation);\n VLOG(40) << \"adj \" << adj_n->Name() << reinterpret_cast<void *>(adj_n)\n << \" -> \" << n->Name() << reinterpret_cast<void *>(n)\n << \" via \" << var->Name() << reinterpret_cast<void *>(var);\n adj_list[n].insert(adj_n);\n }\n }\n }\n return adj_list;\n}\n\nstd::vector<ir::Node *> OpDFSSort(const Graph &graph) {\n auto edge_table = BuildOperationOutAdjList(graph);\n std::stack<Node *> stack;\n for (auto &ele : edge_table) {\n if (ele.first->inputs.empty()) {\n \/\/ find the input ops (those without input vars)\n stack.push(ele.first);\n } else {\n \/\/ find the ops with only persistable vars as inputs.\n bool all_persistable = true;\n for (auto *input : ele.first->inputs) {\n if (!(input->IsVar() && input->Var() && input->Var()->Persistable())) {\n all_persistable = false;\n }\n }\n if (all_persistable) {\n stack.push(ele.first);\n }\n }\n }\n\n std::vector<Node *> res;\n \/\/ start from the feed op and DFS\n std::unordered_set<Node *> unique_set;\n while (!stack.empty()) {\n \/\/ will start from the last feed by default.\n auto cur = stack.top();\n stack.pop();\n unique_set.insert(cur);\n res.push_back(cur);\n\n for (auto *op : edge_table[cur]) {\n if (!unique_set.count(op)) {\n stack.push(op);\n }\n }\n }\n return res;\n}\n\nstd::vector<ir::Node *> TopologyDfsSortOperations(const Graph &graph) {\n std::vector<ir::Node *> nodes;\n std::unordered_map<Node *, int> in_degree;\n\n auto set_out_ops_ready = [&](Node *var) {\n for (auto *op : var->outputs) {\n --in_degree[op];\n }\n };\n \/\/ build in_degree\n for (auto *node : graph.Nodes()) {\n if (node->IsOp()) {\n in_degree[node] += node->inputs.size();\n } else if (node->IsVar() && node->inputs.empty()) {\n \/\/ put all the inputs of the whole graph ready.\n set_out_ops_ready(node);\n }\n }\n\n std::deque<Node *> op_queue;\n \/\/ first visit\n for (auto &node : OpDFSSort(graph)) {\n if (node->IsOp()) {\n op_queue.push_back(node);\n }\n }\n\n \/\/ traverse the graph\n int num_ops = op_queue.size();\n while (num_ops) {\n for (auto it = op_queue.begin(); it != op_queue.end(); it++) {\n auto *&cur_op = *it;\n if (!cur_op || in_degree[cur_op] > 0) continue;\n \/\/ visit this node\n \/\/ put all the output var of this op valid.\n for (auto *out_var : cur_op->outputs) {\n if (!out_var) continue;\n set_out_ops_ready(out_var);\n }\n VLOG(8) << \"visit \" << cur_op->Name();\n nodes.push_back(cur_op);\n\n cur_op = nullptr;\n num_ops--;\n }\n }\n\n return nodes;\n}\n\nsize_t GraphNum(const Graph &graph) {\n std::unordered_set<ir::Node *> nodes(graph.Nodes());\n std::unordered_set<ir::Node *> visited_nodes;\n visited_nodes.reserve(nodes.size());\n std::deque<ir::Node *> q_nodes;\n std::vector<std::unordered_set<ir::Node *>> graph_nodes;\n std::unordered_set<ir::Node *> g_nodes;\n \/\/ q_set used to record records in the queue.\n std::unordered_set<ir::Node *> q_set;\n size_t graph_count = 0;\n\n auto traverse_nodes = [&visited_nodes, &q_nodes,\n &q_set](const std::vector<ir::Node *> &nodes) {\n for (auto n : nodes) {\n if (visited_nodes.count(n) == 0 && q_set.count(n) == 0) {\n q_nodes.push_back(n);\n q_set.insert(n);\n }\n }\n };\n\n while (visited_nodes.size() != nodes.size()) {\n if (!q_nodes.empty()) {\n auto cur_node = q_nodes.front();\n q_nodes.pop_front();\n q_set.erase(cur_node);\n visited_nodes.insert(cur_node);\n g_nodes.insert(cur_node);\n traverse_nodes(cur_node->inputs);\n traverse_nodes(cur_node->outputs);\n } else {\n ++graph_count;\n if (g_nodes.size()) {\n graph_nodes.emplace_back(g_nodes);\n }\n g_nodes.clear();\n for (auto &n : nodes) {\n if (visited_nodes.count(n) == 0) {\n q_nodes.push_back(n);\n q_set.insert(n);\n break;\n }\n }\n }\n }\n\n if (g_nodes.size()) {\n graph_nodes.emplace_back(g_nodes);\n }\n\n if (FLAGS_print_sub_graph_dir.size()) {\n if (graph_nodes.size() > 1) {\n std::stringstream out;\n for (auto &g_n : graph_nodes) {\n out << \"graph_nodes: \" << g_n.size() << \"\\n\";\n }\n out << \"\\n\\n\";\n for (auto &g_n : graph_nodes) {\n out << \"graph_nodes: \" << g_n.size();\n for (auto &node : g_n) {\n out << \"\\nNode: \" << node->Name() << \" in [\";\n for (auto &n : node->inputs) {\n out << n->Name() << \", \";\n }\n out << \"], out[\";\n for (auto &n : node->outputs) {\n out << n->Name() << \", \";\n }\n out << \"]\";\n }\n out << \"\\n\\n\\n\";\n }\n std::unique_ptr<std::ostream> fout(\n new std::ofstream(FLAGS_print_sub_graph_dir));\n PADDLE_ENFORCE(fout->good());\n *fout << out.str();\n }\n }\n\n return graph_count;\n}\n\nvoid CleanIndividualNodes(Graph *graph) {\n std::unordered_set<Node *> nodes2rm;\n for (auto *node : graph->Nodes()) {\n if (node->inputs.empty() && node->outputs.empty()) {\n nodes2rm.insert(node);\n }\n }\n\n for (auto *node : nodes2rm) {\n graph->RemoveNode(node);\n }\n}\n\nstd::vector<Node *> TopologyVarientSort(const Graph &graph,\n SortKind sort_kind) {\n switch (sort_kind) {\n case SortKind::TS:\n return framework::ir::TopologySortOperations(graph);\n default:\n return framework::ir::TopologyDfsSortOperations(graph);\n }\n}\n\n} \/\/ namespace ir\n} \/\/ namespace framework\n} \/\/ namespace paddle\n<|endoftext|>"} {"text":"<commit_before>\/\/ Filename: pStatClientImpl.cxx\n\/\/ Created by: drose (23Dec04)\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#include \"pStatClientImpl.h\"\n\n\/\/ This file only defines anything if DO_PSTATS is defined.\n#ifdef DO_PSTATS\n\n#include \"pStatClient.h\"\n#include \"pStatClientControlMessage.h\"\n#include \"pStatServerControlMessage.h\"\n#include \"pStatCollector.h\"\n#include \"pStatThread.h\"\n#include \"config_pstats.h\"\n#include \"pStatProperties.h\"\n#include \"cmath.h\"\n#include \"mathNumbers.h\"\n\n#include <algorithm>\n\n#ifdef WIN32_VC\n#include <windows.h>\n#endif\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ Function: PStatClientImpl::Constructor\n\/\/ Access: Public\n\/\/ Description:\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nPStatClientImpl::\nPStatClientImpl(PStatClient *client) :\n _client(client),\n _reader(this, 0),\n _writer(this, pstats_threaded_write ? 1 : 0)\n{\n _reader.set_tcp_header_size(4);\n _writer.set_tcp_header_size(4);\n _is_connected = false;\n _got_udp_port = false;\n _collectors_reported = 0;\n _threads_reported = 0;\n\n \/\/ Make sure our clock is in \"normal\" mode.\n _clock.set_mode(ClockObject::M_normal);\n\n _client_name = pstats_name;\n _max_rate = pstats_max_rate;\n\n _tcp_count = 1;\n _udp_count = 1;\n\n if (pstats_tcp_ratio >= 1.0f) {\n _tcp_count_factor = 0.0f;\n _udp_count_factor = 1.0f;\n\n } else if (pstats_tcp_ratio <= 0.0f) {\n _tcp_count_factor = 1.0f;\n _udp_count_factor = 0.0f;\n\n } else {\n csincos(pstats_tcp_ratio * MathNumbers::pi_f \/ 2.0f,\n &_udp_count_factor,\n &_tcp_count_factor);\n }\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ Function: PStatClientImpl::Destructor\n\/\/ Access: Public\n\/\/ Description:\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nPStatClientImpl::\n~PStatClientImpl() {\n nassertv(!_is_connected);\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ Function: PStatClientImpl::client_connect\n\/\/ Access: Public\n\/\/ Description: Called only by PStatClient::client_connect().\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nbool PStatClientImpl::\nclient_connect(string hostname, int port) {\n nassertr(!_is_connected, true);\n\n if (hostname.empty()) {\n hostname = pstats_host;\n }\n if (port < 0) {\n port = pstats_port;\n }\n\n if (!_server.set_host(hostname, port)) {\n pstats_cat.error()\n << \"Unknown host: \" << hostname << \"\\n\";\n return false;\n }\n\n _tcp_connection = open_TCP_client_connection(_server, 5000);\n\n if (_tcp_connection.is_null()) {\n pstats_cat.error()\n << \"Couldn't connect to PStatServer at \" << hostname << \":\"\n << port << \"\\n\";\n return false;\n }\n \/\/ Make sure we're not queuing up multiple TCP sockets--we expect\n \/\/ immediate writes of our TCP datagrams.\n _tcp_connection->set_collect_tcp(false);\n\n _reader.add_connection(_tcp_connection);\n _is_connected = true;\n\n _udp_connection = open_UDP_connection();\n\n send_hello();\n\n return _is_connected;\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ Function: PStatClientImpl::client_disconnect\n\/\/ Access: Public\n\/\/ Description: Called only by PStatClient::client_disconnect().\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nvoid PStatClientImpl::\nclient_disconnect() {\n if (_is_connected) {\n _reader.remove_connection(_tcp_connection);\n close_connection(_tcp_connection);\n close_connection(_udp_connection);\n }\n\n _tcp_connection.clear();\n _udp_connection.clear();\n\n _is_connected = false;\n _got_udp_port = false;\n\n _collectors_reported = 0;\n _threads_reported = 0;\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ Function: PStatClientImpl::new_frame\n\/\/ Access: Public\n\/\/ Description: Called by the PStatThread interface at the beginning\n\/\/ of every frame, for each thread. This resets the\n\/\/ clocks for the new frame and transmits the data for\n\/\/ the previous frame.\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nvoid PStatClientImpl::\nnew_frame(int thread_index) {\n nassertv(thread_index >= 0 && thread_index < (int)_client->_threads.size());\n\n PStatClient::InternalThread &pthread = _client->_threads[thread_index];\n\n \/\/ If we're the main thread, we should exchange control packets with\n \/\/ the server.\n if (thread_index == 0) {\n transmit_control_data();\n }\n\n \/\/ If we've got the UDP port by the time the frame starts, it's\n \/\/ time to become active and start actually tracking data.\n if (_got_udp_port) {\n pthread._is_active = true;\n }\n\n if (!pthread._is_active) {\n return;\n }\n\n float frame_start = _clock.get_real_time();\n\n if (!pthread._frame_data.is_empty()) {\n \/\/ Collector 0 is the whole frame.\n _client->stop(0, thread_index, frame_start);\n\n \/\/ Fill up the level data for all the collectors who have level\n \/\/ data for this pthread.\n int num_collectors = _client->_collectors.size();\n for (int i = 0; i < num_collectors; i++) {\n const PStatClient::PerThreadData &ptd = \n _client->_collectors[i]._per_thread[thread_index];\n if (ptd._has_level) {\n pthread._frame_data.add_level(i, ptd._level);\n }\n }\n transmit_frame_data(thread_index);\n }\n\n pthread._frame_data.clear();\n pthread._frame_number++;\n _client->start(0, thread_index, frame_start);\n\n \/\/ Also record the time for the PStats operation itself.\n int pstats_index = PStatClient::_pstats_pcollector.get_index();\n _client->start(pstats_index, thread_index, frame_start);\n _client->stop(pstats_index, thread_index, _clock.get_real_time());\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ Function: PStatClientImpl::transmit_frame_data\n\/\/ Access: Private\n\/\/ Description: Should be called once per frame per thread to\n\/\/ transmit the latest data to the PStatServer.\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nvoid PStatClientImpl::\ntransmit_frame_data(int thread_index) {\n nassertv(thread_index >= 0 && thread_index < (int)_client->_threads.size());\n if (_is_connected && _client->_threads[thread_index]._is_active) {\n\n \/\/ We don't want to send too many packets in a hurry and flood the\n \/\/ server. Check that enough time has elapsed for us to send a\n \/\/ new packet. If not, we'll drop this packet on the floor and\n \/\/ send a new one next time around.\n float now = _clock.get_real_time();\n if (now >= _client->_threads[thread_index]._next_packet) {\n \/\/ We don't want to send more than _max_rate UDP-size packets\n \/\/ per second, per thread.\n float packet_delay = 1.0 \/ _max_rate;\n\n \/\/ Send new data.\n NetDatagram datagram;\n \/\/ We always start with a zero byte, to differentiate it from a\n \/\/ control message.\n datagram.add_uint8(0);\n\n datagram.add_uint16(thread_index);\n datagram.add_uint32(_client->_threads[thread_index]._frame_number);\n _client->_threads[thread_index]._frame_data.write_datagram(datagram);\n\n if (_writer.is_valid_for_udp(datagram)) {\n if (_udp_count * _udp_count_factor < _tcp_count * _tcp_count_factor) {\n \/\/ Send this one as a UDP packet.\n nassertv(_got_udp_port);\n _writer.send(datagram, _udp_connection, _server);\n _udp_count++;\n\n if (_udp_count == 0) {\n \/\/ Wraparound!\n _udp_count = 1;\n _tcp_count = 1;\n }\n\n } else {\n \/\/ Send this one as a TCP packet.\n _writer.send(datagram, _tcp_connection);\n _tcp_count++;\n\n if (_tcp_count == 0) {\n \/\/ Wraparound!\n _udp_count = 1;\n _tcp_count = 1;\n }\n }\n\n } else {\n _writer.send(datagram, _tcp_connection);\n \/\/ If our packets are so large that we must ship them via TCP,\n \/\/ then artificially slow down the packet rate even further.\n int packet_ratio =\n (datagram.get_length() + maximum_udp_datagram - 1) \/\n maximum_udp_datagram;\n packet_delay *= (float)packet_ratio;\n }\n\n _client->_threads[thread_index]._next_packet = now + packet_delay;\n }\n }\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ Function: PStatClientImpl::transmit_control_data\n\/\/ Access: Private\n\/\/ Description: Should be called once a frame to exchange control\n\/\/ information with the server.\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nvoid PStatClientImpl::\ntransmit_control_data() {\n \/\/ Check for new messages from the server.\n while (_is_connected && _reader.data_available()) {\n NetDatagram datagram;\n\n if (_reader.get_data(datagram)) {\n PStatServerControlMessage message;\n if (message.decode(datagram)) {\n handle_server_control_message(message);\n\n } else {\n pstats_cat.error()\n << \"Got unexpected message from server.\\n\";\n }\n }\n }\n\n if (_is_connected) {\n report_new_collectors();\n report_new_threads();\n }\n}\n\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ Function: PStatClientImpl::get_hostname\n\/\/ Access: Private\n\/\/ Description: Returns the current machine's hostname.\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nstring PStatClientImpl::\nget_hostname() {\n if (_hostname.empty()) {\n char temp_buff[1024];\n if (gethostname(temp_buff, 1024) == 0) {\n _hostname = temp_buff;\n } else {\n _hostname = \"unknown\";\n }\n }\n return _hostname;\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ Function: PStatClientImpl::send_hello\n\/\/ Access: Private\n\/\/ Description: Sends the initial greeting message to the server.\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nvoid PStatClientImpl::\nsend_hello() {\n nassertv(_is_connected);\n\n PStatClientControlMessage message;\n message._type = PStatClientControlMessage::T_hello;\n message._client_hostname = get_hostname();\n message._client_progname = _client_name;\n message._major_version = get_current_pstat_major_version();\n message._minor_version = get_current_pstat_minor_version();\n\n Datagram datagram;\n message.encode(datagram);\n _writer.send(datagram, _tcp_connection);\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ Function: PStatClientImpl::report_new_collectors\n\/\/ Access: Private\n\/\/ Description: Sends over any information about new Collectors that\n\/\/ the user code might have recently created.\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nvoid PStatClientImpl::\nreport_new_collectors() {\n nassertv(_is_connected);\n\n if (_collectors_reported < (int)_client->_collectors.size()) {\n \/\/ Empirically, we determined that you can't send more than about\n \/\/ 1400 collectors at once without exceeding the 64K limit on a\n \/\/ single datagram. So we limit ourselves here to sending only\n \/\/ half that many.\n static const int max_collectors_at_once = 700;\n\n while (_collectors_reported < (int)_client->_collectors.size()) {\n PStatClientControlMessage message;\n message._type = PStatClientControlMessage::T_define_collectors;\n int i = 0;\n while (_collectors_reported < (int)_client->_collectors.size() &&\n i < max_collectors_at_once) {\n message._collectors.push_back(_client->get_collector_def(_collectors_reported));\n _collectors_reported++;\n i++;\n }\n\n Datagram datagram;\n message.encode(datagram);\n _writer.send(datagram, _tcp_connection);\n }\n }\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ Function: PStatClientImpl::report_new_threads\n\/\/ Access: Private\n\/\/ Description: Sends over any information about new Threads that\n\/\/ the user code might have recently created.\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nvoid PStatClientImpl::\nreport_new_threads() {\n nassertv(_is_connected);\n\n if (_threads_reported < (int)_client->_threads.size()) {\n PStatClientControlMessage message;\n message._type = PStatClientControlMessage::T_define_threads;\n message._first_thread_index = _threads_reported;\n while (_threads_reported < (int)_client->_threads.size()) {\n message._names.push_back(_client->_threads[_threads_reported]._name);\n _threads_reported++;\n }\n\n Datagram datagram;\n message.encode(datagram);\n _writer.send(datagram, _tcp_connection);\n }\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ Function: PStatClientImpl::handle_server_control_message\n\/\/ Access: Private\n\/\/ Description: Called when a control message has been received by\n\/\/ the server over the TCP connection.\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nvoid PStatClientImpl::\nhandle_server_control_message(const PStatServerControlMessage &message) {\n switch (message._type) {\n case PStatServerControlMessage::T_hello:\n pstats_cat.info()\n << \"Connected to \" << message._server_progname << \" on \"\n << message._server_hostname << \"\\n\";\n\n _server.set_port(message._udp_port);\n _got_udp_port = true;\n break;\n\n default:\n pstats_cat.error()\n << \"Invalid control message received from server.\\n\";\n }\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ Function: PStatClientImpl::connection_reset\n\/\/ Access: Private, Virtual\n\/\/ Description: Called by the internal net code when the connection\n\/\/ has been lost.\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nvoid PStatClientImpl::\nconnection_reset(const PT(Connection) &connection, PRErrorCode) {\n if (connection == _tcp_connection) {\n _client->client_disconnect();\n } else {\n pstats_cat.warning()\n << \"Ignoring spurious connection_reset() message\\n\";\n }\n}\n\n#endif \/\/ DO_PSTATS\n<commit_msg>no longer depends on linmath<commit_after>\/\/ Filename: pStatClientImpl.cxx\n\/\/ Created by: drose (23Dec04)\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#include \"pStatClientImpl.h\"\n\n\/\/ This file only defines anything if DO_PSTATS is defined.\n#ifdef DO_PSTATS\n\n#include \"pStatClient.h\"\n#include \"pStatClientControlMessage.h\"\n#include \"pStatServerControlMessage.h\"\n#include \"pStatCollector.h\"\n#include \"pStatThread.h\"\n#include \"config_pstats.h\"\n#include \"pStatProperties.h\"\n#include \"cmath.h\"\n\n#include <algorithm>\n\n#ifdef WIN32_VC\n#include <windows.h>\n#endif\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ Function: PStatClientImpl::Constructor\n\/\/ Access: Public\n\/\/ Description:\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nPStatClientImpl::\nPStatClientImpl(PStatClient *client) :\n _client(client),\n _reader(this, 0),\n _writer(this, pstats_threaded_write ? 1 : 0)\n{\n _reader.set_tcp_header_size(4);\n _writer.set_tcp_header_size(4);\n _is_connected = false;\n _got_udp_port = false;\n _collectors_reported = 0;\n _threads_reported = 0;\n\n \/\/ Make sure our clock is in \"normal\" mode.\n _clock.set_mode(ClockObject::M_normal);\n\n _client_name = pstats_name;\n _max_rate = pstats_max_rate;\n\n _tcp_count = 1;\n _udp_count = 1;\n\n if (pstats_tcp_ratio >= 1.0f) {\n _tcp_count_factor = 0.0f;\n _udp_count_factor = 1.0f;\n\n } else if (pstats_tcp_ratio <= 0.0f) {\n _tcp_count_factor = 1.0f;\n _udp_count_factor = 0.0f;\n\n } else {\n csincos(pstats_tcp_ratio * (3.14159265f \/ 2.0f),\n &_udp_count_factor,\n &_tcp_count_factor);\n }\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ Function: PStatClientImpl::Destructor\n\/\/ Access: Public\n\/\/ Description:\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nPStatClientImpl::\n~PStatClientImpl() {\n nassertv(!_is_connected);\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ Function: PStatClientImpl::client_connect\n\/\/ Access: Public\n\/\/ Description: Called only by PStatClient::client_connect().\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nbool PStatClientImpl::\nclient_connect(string hostname, int port) {\n nassertr(!_is_connected, true);\n\n if (hostname.empty()) {\n hostname = pstats_host;\n }\n if (port < 0) {\n port = pstats_port;\n }\n\n if (!_server.set_host(hostname, port)) {\n pstats_cat.error()\n << \"Unknown host: \" << hostname << \"\\n\";\n return false;\n }\n\n _tcp_connection = open_TCP_client_connection(_server, 5000);\n\n if (_tcp_connection.is_null()) {\n pstats_cat.error()\n << \"Couldn't connect to PStatServer at \" << hostname << \":\"\n << port << \"\\n\";\n return false;\n }\n \/\/ Make sure we're not queuing up multiple TCP sockets--we expect\n \/\/ immediate writes of our TCP datagrams.\n _tcp_connection->set_collect_tcp(false);\n\n _reader.add_connection(_tcp_connection);\n _is_connected = true;\n\n _udp_connection = open_UDP_connection();\n\n send_hello();\n\n return _is_connected;\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ Function: PStatClientImpl::client_disconnect\n\/\/ Access: Public\n\/\/ Description: Called only by PStatClient::client_disconnect().\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nvoid PStatClientImpl::\nclient_disconnect() {\n if (_is_connected) {\n _reader.remove_connection(_tcp_connection);\n close_connection(_tcp_connection);\n close_connection(_udp_connection);\n }\n\n _tcp_connection.clear();\n _udp_connection.clear();\n\n _is_connected = false;\n _got_udp_port = false;\n\n _collectors_reported = 0;\n _threads_reported = 0;\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ Function: PStatClientImpl::new_frame\n\/\/ Access: Public\n\/\/ Description: Called by the PStatThread interface at the beginning\n\/\/ of every frame, for each thread. This resets the\n\/\/ clocks for the new frame and transmits the data for\n\/\/ the previous frame.\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nvoid PStatClientImpl::\nnew_frame(int thread_index) {\n nassertv(thread_index >= 0 && thread_index < (int)_client->_threads.size());\n\n PStatClient::InternalThread &pthread = _client->_threads[thread_index];\n\n \/\/ If we're the main thread, we should exchange control packets with\n \/\/ the server.\n if (thread_index == 0) {\n transmit_control_data();\n }\n\n \/\/ If we've got the UDP port by the time the frame starts, it's\n \/\/ time to become active and start actually tracking data.\n if (_got_udp_port) {\n pthread._is_active = true;\n }\n\n if (!pthread._is_active) {\n return;\n }\n\n float frame_start = _clock.get_real_time();\n\n if (!pthread._frame_data.is_empty()) {\n \/\/ Collector 0 is the whole frame.\n _client->stop(0, thread_index, frame_start);\n\n \/\/ Fill up the level data for all the collectors who have level\n \/\/ data for this pthread.\n int num_collectors = _client->_collectors.size();\n for (int i = 0; i < num_collectors; i++) {\n const PStatClient::PerThreadData &ptd = \n _client->_collectors[i]._per_thread[thread_index];\n if (ptd._has_level) {\n pthread._frame_data.add_level(i, ptd._level);\n }\n }\n transmit_frame_data(thread_index);\n }\n\n pthread._frame_data.clear();\n pthread._frame_number++;\n _client->start(0, thread_index, frame_start);\n\n \/\/ Also record the time for the PStats operation itself.\n int pstats_index = PStatClient::_pstats_pcollector.get_index();\n _client->start(pstats_index, thread_index, frame_start);\n _client->stop(pstats_index, thread_index, _clock.get_real_time());\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ Function: PStatClientImpl::transmit_frame_data\n\/\/ Access: Private\n\/\/ Description: Should be called once per frame per thread to\n\/\/ transmit the latest data to the PStatServer.\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nvoid PStatClientImpl::\ntransmit_frame_data(int thread_index) {\n nassertv(thread_index >= 0 && thread_index < (int)_client->_threads.size());\n if (_is_connected && _client->_threads[thread_index]._is_active) {\n\n \/\/ We don't want to send too many packets in a hurry and flood the\n \/\/ server. Check that enough time has elapsed for us to send a\n \/\/ new packet. If not, we'll drop this packet on the floor and\n \/\/ send a new one next time around.\n float now = _clock.get_real_time();\n if (now >= _client->_threads[thread_index]._next_packet) {\n \/\/ We don't want to send more than _max_rate UDP-size packets\n \/\/ per second, per thread.\n float packet_delay = 1.0 \/ _max_rate;\n\n \/\/ Send new data.\n NetDatagram datagram;\n \/\/ We always start with a zero byte, to differentiate it from a\n \/\/ control message.\n datagram.add_uint8(0);\n\n datagram.add_uint16(thread_index);\n datagram.add_uint32(_client->_threads[thread_index]._frame_number);\n _client->_threads[thread_index]._frame_data.write_datagram(datagram);\n\n if (_writer.is_valid_for_udp(datagram)) {\n if (_udp_count * _udp_count_factor < _tcp_count * _tcp_count_factor) {\n \/\/ Send this one as a UDP packet.\n nassertv(_got_udp_port);\n _writer.send(datagram, _udp_connection, _server);\n _udp_count++;\n\n if (_udp_count == 0) {\n \/\/ Wraparound!\n _udp_count = 1;\n _tcp_count = 1;\n }\n\n } else {\n \/\/ Send this one as a TCP packet.\n _writer.send(datagram, _tcp_connection);\n _tcp_count++;\n\n if (_tcp_count == 0) {\n \/\/ Wraparound!\n _udp_count = 1;\n _tcp_count = 1;\n }\n }\n\n } else {\n _writer.send(datagram, _tcp_connection);\n \/\/ If our packets are so large that we must ship them via TCP,\n \/\/ then artificially slow down the packet rate even further.\n int packet_ratio =\n (datagram.get_length() + maximum_udp_datagram - 1) \/\n maximum_udp_datagram;\n packet_delay *= (float)packet_ratio;\n }\n\n _client->_threads[thread_index]._next_packet = now + packet_delay;\n }\n }\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ Function: PStatClientImpl::transmit_control_data\n\/\/ Access: Private\n\/\/ Description: Should be called once a frame to exchange control\n\/\/ information with the server.\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nvoid PStatClientImpl::\ntransmit_control_data() {\n \/\/ Check for new messages from the server.\n while (_is_connected && _reader.data_available()) {\n NetDatagram datagram;\n\n if (_reader.get_data(datagram)) {\n PStatServerControlMessage message;\n if (message.decode(datagram)) {\n handle_server_control_message(message);\n\n } else {\n pstats_cat.error()\n << \"Got unexpected message from server.\\n\";\n }\n }\n }\n\n if (_is_connected) {\n report_new_collectors();\n report_new_threads();\n }\n}\n\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ Function: PStatClientImpl::get_hostname\n\/\/ Access: Private\n\/\/ Description: Returns the current machine's hostname.\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nstring PStatClientImpl::\nget_hostname() {\n if (_hostname.empty()) {\n char temp_buff[1024];\n if (gethostname(temp_buff, 1024) == 0) {\n _hostname = temp_buff;\n } else {\n _hostname = \"unknown\";\n }\n }\n return _hostname;\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ Function: PStatClientImpl::send_hello\n\/\/ Access: Private\n\/\/ Description: Sends the initial greeting message to the server.\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nvoid PStatClientImpl::\nsend_hello() {\n nassertv(_is_connected);\n\n PStatClientControlMessage message;\n message._type = PStatClientControlMessage::T_hello;\n message._client_hostname = get_hostname();\n message._client_progname = _client_name;\n message._major_version = get_current_pstat_major_version();\n message._minor_version = get_current_pstat_minor_version();\n\n Datagram datagram;\n message.encode(datagram);\n _writer.send(datagram, _tcp_connection);\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ Function: PStatClientImpl::report_new_collectors\n\/\/ Access: Private\n\/\/ Description: Sends over any information about new Collectors that\n\/\/ the user code might have recently created.\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nvoid PStatClientImpl::\nreport_new_collectors() {\n nassertv(_is_connected);\n\n if (_collectors_reported < (int)_client->_collectors.size()) {\n \/\/ Empirically, we determined that you can't send more than about\n \/\/ 1400 collectors at once without exceeding the 64K limit on a\n \/\/ single datagram. So we limit ourselves here to sending only\n \/\/ half that many.\n static const int max_collectors_at_once = 700;\n\n while (_collectors_reported < (int)_client->_collectors.size()) {\n PStatClientControlMessage message;\n message._type = PStatClientControlMessage::T_define_collectors;\n int i = 0;\n while (_collectors_reported < (int)_client->_collectors.size() &&\n i < max_collectors_at_once) {\n message._collectors.push_back(_client->get_collector_def(_collectors_reported));\n _collectors_reported++;\n i++;\n }\n\n Datagram datagram;\n message.encode(datagram);\n _writer.send(datagram, _tcp_connection);\n }\n }\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ Function: PStatClientImpl::report_new_threads\n\/\/ Access: Private\n\/\/ Description: Sends over any information about new Threads that\n\/\/ the user code might have recently created.\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nvoid PStatClientImpl::\nreport_new_threads() {\n nassertv(_is_connected);\n\n if (_threads_reported < (int)_client->_threads.size()) {\n PStatClientControlMessage message;\n message._type = PStatClientControlMessage::T_define_threads;\n message._first_thread_index = _threads_reported;\n while (_threads_reported < (int)_client->_threads.size()) {\n message._names.push_back(_client->_threads[_threads_reported]._name);\n _threads_reported++;\n }\n\n Datagram datagram;\n message.encode(datagram);\n _writer.send(datagram, _tcp_connection);\n }\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ Function: PStatClientImpl::handle_server_control_message\n\/\/ Access: Private\n\/\/ Description: Called when a control message has been received by\n\/\/ the server over the TCP connection.\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nvoid PStatClientImpl::\nhandle_server_control_message(const PStatServerControlMessage &message) {\n switch (message._type) {\n case PStatServerControlMessage::T_hello:\n pstats_cat.info()\n << \"Connected to \" << message._server_progname << \" on \"\n << message._server_hostname << \"\\n\";\n\n _server.set_port(message._udp_port);\n _got_udp_port = true;\n break;\n\n default:\n pstats_cat.error()\n << \"Invalid control message received from server.\\n\";\n }\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ Function: PStatClientImpl::connection_reset\n\/\/ Access: Private, Virtual\n\/\/ Description: Called by the internal net code when the connection\n\/\/ has been lost.\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nvoid PStatClientImpl::\nconnection_reset(const PT(Connection) &connection, PRErrorCode) {\n if (connection == _tcp_connection) {\n _client->client_disconnect();\n } else {\n pstats_cat.warning()\n << \"Ignoring spurious connection_reset() message\\n\";\n }\n}\n\n#endif \/\/ DO_PSTATS\n<|endoftext|>"} {"text":"<commit_before>\/*************************************************************************\/\n\/* godot.cpp *\/\n\/*************************************************************************\/\n\/* This file is part of: *\/\n\/* GODOT ENGINE *\/\n\/* https:\/\/godotengine.org *\/\n\/*************************************************************************\/\n\/* Copyright (c) 2007-2019 Juan Linietsky, Ariel Manzur. *\/\n\/* Copyright (c) 2014-2019 Godot Engine contributors (cf. AUTHORS.md) *\/\n\/* *\/\n\/* Permission is hereby granted, free of charge, to any person obtaining *\/\n\/* a copy of this software and associated documentation files (the *\/\n\/* \"Software\"), to deal in the Software without restriction, including *\/\n\/* without limitation the rights to use, copy, modify, merge, publish, *\/\n\/* distribute, sublicense, and\/or sell copies of the Software, and to *\/\n\/* permit persons to whom the Software is furnished to do so, subject to *\/\n\/* the following conditions: *\/\n\/* *\/\n\/* The above copyright notice and this permission notice shall be *\/\n\/* included in all copies or substantial portions of the Software. *\/\n\/* *\/\n\/* THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, *\/\n\/* EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF *\/\n\/* MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT.*\/\n\/* IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY *\/\n\/* CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, *\/\n\/* TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE *\/\n\/* SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE. *\/\n\/*************************************************************************\/\n\/**\n @file godot.cpp\n @brief ENet Godot specific functions\n*\/\n\n#include \"core\/io\/ip.h\"\n#include \"core\/io\/net_socket.h\"\n#include \"core\/os\/os.h\"\n\n\/\/ This must be last for windows to compile (tested with MinGW)\n#include \"enet\/enet.h\"\n\nstatic enet_uint32 timeBase = 0;\n\nint enet_initialize(void) {\n\n\treturn 0;\n}\n\nvoid enet_deinitialize(void) {\n}\n\nenet_uint32 enet_host_random_seed(void) {\n\n\treturn (enet_uint32)OS::get_singleton()->get_unix_time();\n}\n\nenet_uint32 enet_time_get(void) {\n\n\treturn OS::get_singleton()->get_ticks_msec() - timeBase;\n}\n\nvoid enet_time_set(enet_uint32 newTimeBase) {\n\n\ttimeBase = OS::get_singleton()->get_ticks_msec() - newTimeBase;\n}\n\nint enet_address_set_host(ENetAddress *address, const char *name) {\n\n\tIP_Address ip = IP::get_singleton()->resolve_hostname(name);\n\tERR_FAIL_COND_V(!ip.is_valid(), -1);\n\n\tenet_address_set_ip(address, ip.get_ipv6(), 16);\n\treturn 0;\n}\n\nvoid enet_address_set_ip(ENetAddress *address, const uint8_t *ip, size_t size) {\n\n\tint len = size > 16 ? 16 : size;\n\tmemset(address->host, 0, 16);\n\tmemcpy(address->host, ip, len);\n}\n\nint enet_address_get_host_ip(const ENetAddress *address, char *name, size_t nameLength) {\n\n\treturn -1;\n}\n\nint enet_address_get_host(const ENetAddress *address, char *name, size_t nameLength) {\n\n\treturn -1;\n}\n\nENetSocket enet_socket_create(ENetSocketType type) {\n\n\tNetSocket *socket = NetSocket::create();\n\tIP::Type ip_type = IP::TYPE_ANY;\n\tsocket->open(NetSocket::TYPE_UDP, ip_type);\n\tsocket->set_blocking_enabled(false);\n\n\treturn socket;\n}\n\nint enet_socket_bind(ENetSocket socket, const ENetAddress *address) {\n\n\tIP_Address ip;\n\tif (address->wildcard) {\n\t\tip = IP_Address(\"*\");\n\t} else {\n\t\tip.set_ipv6(address->host);\n\t}\n\n\tNetSocket *sock = (NetSocket *)socket;\n\tif (sock->bind(ip, address->port) != OK) {\n\t\treturn -1;\n\t}\n\treturn 0;\n}\n\nvoid enet_socket_destroy(ENetSocket socket) {\n\tNetSocket *sock = (NetSocket *)socket;\n\tsock->close();\n\tmemdelete(sock);\n}\n\nint enet_socket_send(ENetSocket socket, const ENetAddress *address, const ENetBuffer *buffers, size_t bufferCount) {\n\n\tERR_FAIL_COND_V(address == NULL, -1);\n\n\tNetSocket *sock = (NetSocket *)socket;\n\tIP_Address dest;\n\tError err;\n\tsize_t i = 0;\n\n\tdest.set_ipv6(address->host);\n\n\t\/\/ Create a single packet.\n\tPoolVector<uint8_t> out;\n\tPoolVector<uint8_t>::Write w;\n\tint size = 0;\n\tint pos = 0;\n\tfor (i = 0; i < bufferCount; i++) {\n\t\tsize += buffers[i].dataLength;\n\t}\n\n\tout.resize(size);\n\tw = out.write();\n\tfor (i = 0; i < bufferCount; i++) {\n\t\tmemcpy(&w[pos], buffers[i].data, buffers[i].dataLength);\n\t\tpos += buffers[i].dataLength;\n\t}\n\n\tint sent = 0;\n\terr = sock->sendto((const uint8_t *)&w[0], size, sent, dest, address->port);\n\tif (err != OK) {\n\n\t\tif (err == ERR_BUSY) { \/\/ Blocking call\n\t\t\treturn 0;\n\t\t}\n\n\t\tWARN_PRINT(\"Sending failed!\");\n\t\treturn -1;\n\t}\n\n\treturn sent;\n}\n\nint enet_socket_receive(ENetSocket socket, ENetAddress *address, ENetBuffer *buffers, size_t bufferCount) {\n\n\tERR_FAIL_COND_V(bufferCount != 1, -1);\n\n\tNetSocket *sock = (NetSocket *)socket;\n\n\tError ret = sock->poll(NetSocket::POLL_TYPE_IN, 0);\n\n\tif (ret == ERR_BUSY)\n\t\treturn 0;\n\n\tif (ret != OK)\n\t\treturn -1;\n\n\tint read;\n\tIP_Address ip;\n\n\tError err = sock->recvfrom((uint8_t *)buffers[0].data, buffers[0].dataLength, read, ip, address->port);\n\tif (err == ERR_BUSY)\n\t\treturn 0;\n\n\tif (err != OK)\n\t\treturn -1;\n\n\tenet_address_set_ip(address, ip.get_ipv6(), 16);\n\n\treturn read;\n}\n\n\/\/ Not implemented\nint enet_socket_wait(ENetSocket socket, enet_uint32 *condition, enet_uint32 timeout) {\n\n\treturn 0; \/\/ do we need this function?\n}\n\nint enet_socket_get_address(ENetSocket socket, ENetAddress *address) {\n\n\treturn -1; \/\/ do we need this function?\n}\n\nint enet_socketset_select(ENetSocket maxSocket, ENetSocketSet *readSet, ENetSocketSet *writeSet, enet_uint32 timeout) {\n\n\treturn -1;\n}\n\nint enet_socket_listen(ENetSocket socket, int backlog) {\n\n\treturn -1;\n}\n\nint enet_socket_set_option(ENetSocket socket, ENetSocketOption option, int value) {\n\n\treturn -1;\n}\n\nint enet_socket_get_option(ENetSocket socket, ENetSocketOption option, int *value) {\n\n\treturn -1;\n}\n\nint enet_socket_connect(ENetSocket socket, const ENetAddress *address) {\n\n\treturn -1;\n}\n\nENetSocket enet_socket_accept(ENetSocket socket, ENetAddress *address) {\n\n\treturn NULL;\n}\n\nint enet_socket_shutdown(ENetSocket socket, ENetSocketShutdown how) {\n\n\treturn -1;\n}\n<commit_msg>Implement function enet_socket_set_option using ENetSocket class's methods. Implemented options: - ENET_SOCKOPT_NONBLOCK - ENET_SOCKOPT_BROADCAST - ENET_SOCKOPT_REUSEADDR - ENET_SOCKOPT_NODELAY Not implemented options: - ENET_SOCKOPT_RCVBUF - ENET_SOCKOPT_SNDBUF - ENET_SOCKOPT_RCVTIMEO - ENET_SOCKOPT_SNDTIMEO<commit_after>\/*************************************************************************\/\n\/* godot.cpp *\/\n\/*************************************************************************\/\n\/* This file is part of: *\/\n\/* GODOT ENGINE *\/\n\/* https:\/\/godotengine.org *\/\n\/*************************************************************************\/\n\/* Copyright (c) 2007-2019 Juan Linietsky, Ariel Manzur. *\/\n\/* Copyright (c) 2014-2019 Godot Engine contributors (cf. AUTHORS.md) *\/\n\/* *\/\n\/* Permission is hereby granted, free of charge, to any person obtaining *\/\n\/* a copy of this software and associated documentation files (the *\/\n\/* \"Software\"), to deal in the Software without restriction, including *\/\n\/* without limitation the rights to use, copy, modify, merge, publish, *\/\n\/* distribute, sublicense, and\/or sell copies of the Software, and to *\/\n\/* permit persons to whom the Software is furnished to do so, subject to *\/\n\/* the following conditions: *\/\n\/* *\/\n\/* The above copyright notice and this permission notice shall be *\/\n\/* included in all copies or substantial portions of the Software. *\/\n\/* *\/\n\/* THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, *\/\n\/* EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF *\/\n\/* MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT.*\/\n\/* IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY *\/\n\/* CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, *\/\n\/* TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE *\/\n\/* SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE. *\/\n\/*************************************************************************\/\n\/**\n @file godot.cpp\n @brief ENet Godot specific functions\n*\/\n\n#include \"core\/io\/ip.h\"\n#include \"core\/io\/net_socket.h\"\n#include \"core\/os\/os.h\"\n\n\/\/ This must be last for windows to compile (tested with MinGW)\n#include \"enet\/enet.h\"\n\nstatic enet_uint32 timeBase = 0;\n\nint enet_initialize(void) {\n\n\treturn 0;\n}\n\nvoid enet_deinitialize(void) {\n}\n\nenet_uint32 enet_host_random_seed(void) {\n\n\treturn (enet_uint32)OS::get_singleton()->get_unix_time();\n}\n\nenet_uint32 enet_time_get(void) {\n\n\treturn OS::get_singleton()->get_ticks_msec() - timeBase;\n}\n\nvoid enet_time_set(enet_uint32 newTimeBase) {\n\n\ttimeBase = OS::get_singleton()->get_ticks_msec() - newTimeBase;\n}\n\nint enet_address_set_host(ENetAddress *address, const char *name) {\n\n\tIP_Address ip = IP::get_singleton()->resolve_hostname(name);\n\tERR_FAIL_COND_V(!ip.is_valid(), -1);\n\n\tenet_address_set_ip(address, ip.get_ipv6(), 16);\n\treturn 0;\n}\n\nvoid enet_address_set_ip(ENetAddress *address, const uint8_t *ip, size_t size) {\n\n\tint len = size > 16 ? 16 : size;\n\tmemset(address->host, 0, 16);\n\tmemcpy(address->host, ip, len);\n}\n\nint enet_address_get_host_ip(const ENetAddress *address, char *name, size_t nameLength) {\n\n\treturn -1;\n}\n\nint enet_address_get_host(const ENetAddress *address, char *name, size_t nameLength) {\n\n\treturn -1;\n}\n\nENetSocket enet_socket_create(ENetSocketType type) {\n\n\tNetSocket *socket = NetSocket::create();\n\tIP::Type ip_type = IP::TYPE_ANY;\n\tsocket->open(NetSocket::TYPE_UDP, ip_type);\n\tsocket->set_blocking_enabled(false);\n\n\treturn socket;\n}\n\nint enet_socket_bind(ENetSocket socket, const ENetAddress *address) {\n\n\tIP_Address ip;\n\tif (address->wildcard) {\n\t\tip = IP_Address(\"*\");\n\t} else {\n\t\tip.set_ipv6(address->host);\n\t}\n\n\tNetSocket *sock = (NetSocket *)socket;\n\tif (sock->bind(ip, address->port) != OK) {\n\t\treturn -1;\n\t}\n\treturn 0;\n}\n\nvoid enet_socket_destroy(ENetSocket socket) {\n\tNetSocket *sock = (NetSocket *)socket;\n\tsock->close();\n\tmemdelete(sock);\n}\n\nint enet_socket_send(ENetSocket socket, const ENetAddress *address, const ENetBuffer *buffers, size_t bufferCount) {\n\n\tERR_FAIL_COND_V(address == NULL, -1);\n\n\tNetSocket *sock = (NetSocket *)socket;\n\tIP_Address dest;\n\tError err;\n\tsize_t i = 0;\n\n\tdest.set_ipv6(address->host);\n\n\t\/\/ Create a single packet.\n\tPoolVector<uint8_t> out;\n\tPoolVector<uint8_t>::Write w;\n\tint size = 0;\n\tint pos = 0;\n\tfor (i = 0; i < bufferCount; i++) {\n\t\tsize += buffers[i].dataLength;\n\t}\n\n\tout.resize(size);\n\tw = out.write();\n\tfor (i = 0; i < bufferCount; i++) {\n\t\tmemcpy(&w[pos], buffers[i].data, buffers[i].dataLength);\n\t\tpos += buffers[i].dataLength;\n\t}\n\n\tint sent = 0;\n\terr = sock->sendto((const uint8_t *)&w[0], size, sent, dest, address->port);\n\tif (err != OK) {\n\n\t\tif (err == ERR_BUSY) { \/\/ Blocking call\n\t\t\treturn 0;\n\t\t}\n\n\t\tWARN_PRINT(\"Sending failed!\");\n\t\treturn -1;\n\t}\n\n\treturn sent;\n}\n\nint enet_socket_receive(ENetSocket socket, ENetAddress *address, ENetBuffer *buffers, size_t bufferCount) {\n\n\tERR_FAIL_COND_V(bufferCount != 1, -1);\n\n\tNetSocket *sock = (NetSocket *)socket;\n\n\tError ret = sock->poll(NetSocket::POLL_TYPE_IN, 0);\n\n\tif (ret == ERR_BUSY)\n\t\treturn 0;\n\n\tif (ret != OK)\n\t\treturn -1;\n\n\tint read;\n\tIP_Address ip;\n\n\tError err = sock->recvfrom((uint8_t *)buffers[0].data, buffers[0].dataLength, read, ip, address->port);\n\tif (err == ERR_BUSY)\n\t\treturn 0;\n\n\tif (err != OK)\n\t\treturn -1;\n\n\tenet_address_set_ip(address, ip.get_ipv6(), 16);\n\n\treturn read;\n}\n\n\/\/ Not implemented\nint enet_socket_wait(ENetSocket socket, enet_uint32 *condition, enet_uint32 timeout) {\n\n\treturn 0; \/\/ do we need this function?\n}\n\nint enet_socket_get_address(ENetSocket socket, ENetAddress *address) {\n\n\treturn -1; \/\/ do we need this function?\n}\n\nint enet_socketset_select(ENetSocket maxSocket, ENetSocketSet *readSet, ENetSocketSet *writeSet, enet_uint32 timeout) {\n\n\treturn -1;\n}\n\nint enet_socket_listen(ENetSocket socket, int backlog) {\n\n\treturn -1;\n}\n\nint enet_socket_set_option(ENetSocket socket, ENetSocketOption option, int value) {\n\n\tNetSocket *sock = (NetSocket *)socket;\n\n\tswitch (option) {\n\t\tcase ENET_SOCKOPT_NONBLOCK: {\n\t\t\tsock->set_blocking_enabled(value ? false : true);\n\t\t\treturn 0;\n\t\t} break;\n\n\t\tcase ENET_SOCKOPT_BROADCAST: {\n\t\t\tsock->set_broadcasting_enabled(value ? true : false);\n\t\t\treturn 0;\n\t\t} break;\n\n\t\tcase ENET_SOCKOPT_REUSEADDR: {\n\t\t\tsock->set_reuse_address_enabled(value ? true : false);\n\t\t\treturn 0;\n\t\t} break;\n\n\t\tcase ENET_SOCKOPT_RCVBUF: {\n\t\t\treturn -1;\n\t\t} break;\n\n\t\tcase ENET_SOCKOPT_SNDBUF: {\n\t\t\treturn -1;\n\t\t} break;\n\n\t\tcase ENET_SOCKOPT_RCVTIMEO: {\n\t\t\treturn -1;\n\t\t} break;\n\n\t\tcase ENET_SOCKOPT_SNDTIMEO: {\n\t\t\treturn -1;\n\t\t} break;\n\n\t\tcase ENET_SOCKOPT_NODELAY: {\n\t\t\tsock->set_tcp_no_delay_enabled(value ? true : false);\n\t\t\treturn 0;\n\t\t} break;\n\t}\n\n\treturn -1;\n}\n\nint enet_socket_get_option(ENetSocket socket, ENetSocketOption option, int *value) {\n\n\treturn -1;\n}\n\nint enet_socket_connect(ENetSocket socket, const ENetAddress *address) {\n\n\treturn -1;\n}\n\nENetSocket enet_socket_accept(ENetSocket socket, ENetAddress *address) {\n\n\treturn NULL;\n}\n\nint enet_socket_shutdown(ENetSocket socket, ENetSocketShutdown how) {\n\n\treturn -1;\n}\n<|endoftext|>"} {"text":"<commit_before>#include \"Halide.h\"\n\nusing namespace Halide;\n\n#include <image_io.h>\n\n#include <iostream>\n#include <limits>\n\n#include <sys\/time.h>\n\nusing std::vector;\n\ndouble now() {\n struct timeval tv;\n gettimeofday(&tv, NULL);\n static bool first_call = true;\n static time_t first_sec = 0;\n if (first_call) {\n first_call = false;\n first_sec = tv.tv_sec;\n }\n assert(tv.tv_sec >= first_sec);\n return (tv.tv_sec - first_sec) + (tv.tv_usec \/ 1000000.0);\n}\n\nint main(int argc, char **argv) {\n if (argc < 3) {\n std::cerr << \"Usage:\\n\\t.\/interpolate in.png out.png\\n\" << std::endl;\n return 1;\n }\n\n ImageParam input(Float(32), 3);\n\n const unsigned int levels = 10;\n\n Func downsampled[levels];\n Func downx[levels];\n Func interpolated[levels];\n Func upsampled[levels];\n Func upsampledx[levels];\n Var x(\"x\"), y(\"y\"), c(\"c\");\n\n Func clamped;\n clamped(x, y, c) = input(clamp(x, 0, input.width()-1), clamp(y, 0, input.height()-1), c);\n\n \/\/ This triggers a bug in llvm 3.3 (3.2 and trunk are fine), so we\n \/\/ rewrite it in a way that doesn't trigger the bug. The rewritten\n \/\/ form assumes the input alpha is zero or one.\n \/\/ downsampled[0](x, y, c) = select(c < 3, clamped(x, y, c) * clamped(x, y, 3), clamped(x, y, 3));\n downsampled[0](x, y, c) = clamped(x, y, c) * clamped(x, y, 3);\n\n for (unsigned int l = 1; l < levels; ++l) {\n downx[l](x, y, c) = (downsampled[l-1](x*2-1, y, c) +\n 2.0f * downsampled[l-1](x*2, y, c) +\n downsampled[l-1](x*2+1, y, c)) * 0.25f;\n downsampled[l](x, y, c) = (downx[l](x, y*2-1, c) +\n 2.0f * downx[l](x, y*2, c) +\n downx[l](x, y*2+1, c)) * 0.25f;\n }\n interpolated[levels-1](x, y, c) = downsampled[levels-1](x, y, c);\n for (unsigned int l = levels-2; l < levels; --l) {\n upsampledx[l](x, y, c) = select((x % 2) == 0,\n interpolated[l+1](x\/2, y, c),\n 0.5f * (interpolated[l+1](x\/2, y, c) +\n interpolated[l+1](x\/2+1, y, c)));\n upsampled[l](x, y, c) = select((y % 2) == 0,\n upsampledx[l](x, y\/2, c),\n 0.5f * (upsampledx[l](x, y\/2, c) +\n upsampledx[l](x, y\/2+1, c)));\n interpolated[l](x, y, c) = downsampled[l](x, y, c) + (1.0f - downsampled[l](x, y, 3)) * upsampled[l](x, y, c);\n }\n\n Func normalize(\"normalize\");\n normalize(x, y, c) = interpolated[0](x, y, c) \/ interpolated[0](x, y, 3);\n\n Func final(\"final\");\n final(x, y, c) = normalize(x, y, c);\n\n std::cout << \"Finished function setup.\" << std::endl;\n\n int sched;\n std::string target = get_target();\n if (target == \"ptx\" || target == \"ptx-debug\") {\n sched = 4;\n } else {\n sched = 2;\n }\n\n switch (sched) {\n case 0:\n {\n std::cout << \"Flat schedule.\" << std::endl;\n for (unsigned int l = 0; l < levels; ++l) {\n downsampled[l].compute_root();\n interpolated[l].compute_root();\n }\n final.compute_root();\n break;\n }\n case 1:\n {\n std::cout << \"Flat schedule with vectorization.\" << std::endl;\n for (unsigned int l = 0; l < levels; ++l) {\n downsampled[l].compute_root().vectorize(x,4);\n interpolated[l].compute_root().vectorize(x,4);\n }\n final.compute_root();\n break;\n }\n case 2:\n {\n Var xi, yi;\n std::cout << \"Flat schedule with parallelization + vectorization.\" << std::endl;\n clamped.compute_root().parallel(y).bound(c, 0, 4).reorder(c, x, y).reorder_storage(c, x, y).vectorize(c, 4);\n for (unsigned int l = 1; l < levels-1; ++l) {\n if (l > 0) downsampled[l].compute_root().parallel(y).reorder(c, x, y).reorder_storage(c, x, y).vectorize(c, 4);\n interpolated[l].compute_root().parallel(y).reorder(c, x, y).reorder_storage(c, x, y).vectorize(c, 4);\n interpolated[l].unroll(x, 2).unroll(y, 2);\n }\n final.reorder(c, x, y).bound(c, 0, 3).parallel(y);\n final.tile(x, y, xi, yi, 2, 2).unroll(xi).unroll(yi);\n final.bound(x, 0, input.width());\n final.bound(y, 0, input.height());\n break;\n }\n case 3:\n {\n std::cout << \"Flat schedule with vectorization sometimes.\" << std::endl;\n for (unsigned int l = 0; l < levels; ++l) {\n if (l + 4 < levels) {\n Var yo,yi;\n downsampled[l].compute_root().vectorize(x,4);\n interpolated[l].compute_root().vectorize(x,4);\n } else {\n downsampled[l].compute_root();\n interpolated[l].compute_root();\n }\n }\n final.compute_root();\n break;\n }\n case 4:\n {\n std::cout << \"GPU schedule.\" << std::endl;\n\n \/\/ Some gpus don't have enough memory to process the entire\n \/\/ image, so we process the image in tiles.\n Var yo, yi, xo, xi;\n final.reorder(c, x, y).bound(c, 0, 3).vectorize(x, 4);\n final.tile(x, y, xo, yo, xi, yi, input.width()\/4, input.height()\/4);\n normalize.compute_at(final, xo).reorder(c, x, y).cuda_tile(x, y, 16, 16).unroll(c);\n\n \/\/ Start from level 1 to save memory - level zero will be computed on demand\n for (unsigned int l = 1; l < levels; ++l) {\n int tile_size = 32 >> l;\n if (tile_size < 1) tile_size = 1;\n if (tile_size > 16) tile_size = 16;\n downsampled[l].compute_root().cuda_tile(x, y, c, tile_size, tile_size, 4);\n interpolated[l].compute_at(final, xo).cuda_tile(x, y, c, tile_size, tile_size, 4);\n }\n\n break;\n }\n default:\n assert(0 && \"No schedule with this number.\");\n }\n\n \/\/ JIT compile the pipeline eagerly, so we don't interfere with timing\n final.compile_jit();\n\n Image<float> in_png = load<float>(argv[1]);\n Image<float> out(in_png.width(), in_png.height(), 3);\n assert(in_png.channels() == 4);\n input.set(in_png);\n\n std::cout << \"Running... \" << std::endl;\n double min = std::numeric_limits<double>::infinity();\n const unsigned int iters = 20;\n\n for (unsigned int x = 0; x < iters; ++x) {\n double before = now();\n final.realize(out);\n double after = now();\n double amt = after - before;\n\n std::cout << \" \" << amt * 1000 << std::endl;\n if (amt < min) min = amt;\n\n }\n std::cout << \" took \" << min * 1000 << \" msec.\" << std::endl;\n\n vector<Argument> args;\n args.push_back(input);\n final.compile_to_assembly(\"test.s\", args);\n\n save(out, argv[2]);\n\n}\n<commit_msg>Added a boundary condition to interpolate to speed it up.<commit_after>#include \"Halide.h\"\n\nusing namespace Halide;\n\n#include <image_io.h>\n\n#include <iostream>\n#include <limits>\n\n#include <sys\/time.h>\n\nusing std::vector;\n\ndouble now() {\n struct timeval tv;\n gettimeofday(&tv, NULL);\n static bool first_call = true;\n static time_t first_sec = 0;\n if (first_call) {\n first_call = false;\n first_sec = tv.tv_sec;\n }\n assert(tv.tv_sec >= first_sec);\n return (tv.tv_sec - first_sec) + (tv.tv_usec \/ 1000000.0);\n}\n\nint main(int argc, char **argv) {\n if (argc < 3) {\n std::cerr << \"Usage:\\n\\t.\/interpolate in.png out.png\\n\" << std::endl;\n return 1;\n }\n\n ImageParam input(Float(32), 3);\n\n const unsigned int levels = 10;\n\n Func downsampled[levels];\n Func downx[levels];\n Func interpolated[levels];\n Func upsampled[levels];\n Func upsampledx[levels];\n Var x(\"x\"), y(\"y\"), c(\"c\");\n\n Func clamped;\n clamped(x, y, c) = input(clamp(x, 0, input.width()-1), clamp(y, 0, input.height()-1), c);\n\n \/\/ This triggers a bug in llvm 3.3 (3.2 and trunk are fine), so we\n \/\/ rewrite it in a way that doesn't trigger the bug. The rewritten\n \/\/ form assumes the input alpha is zero or one.\n \/\/ downsampled[0](x, y, c) = select(c < 3, clamped(x, y, c) * clamped(x, y, 3), clamped(x, y, 3));\n downsampled[0](x, y, c) = clamped(x, y, c) * clamped(x, y, 3);\n\n for (unsigned int l = 1; l < levels; ++l) {\n Func prev = downsampled[l-1];\n\n if (l == 4) {\n \/\/ Also add a boundary condition at a middle pyramid level\n \/\/ to prevent the footprint of the downsamplings to extend\n \/\/ too far off the base image. Otherwise we look 512\n \/\/ pixels off each edge.\n Expr w = input.width()\/(1 << l);\n Expr h = input.height()\/(1 << l);\n prev = lambda(x, y, c, prev(clamp(x, 0, w), clamp(y, 0, h), c));\n }\n\n downx[l](x, y, c) = (prev(x*2-1, y, c) +\n 2.0f * prev(x*2, y, c) +\n prev(x*2+1, y, c)) * 0.25f;\n downsampled[l](x, y, c) = (downx[l](x, y*2-1, c) +\n 2.0f * downx[l](x, y*2, c) +\n downx[l](x, y*2+1, c)) * 0.25f;\n }\n interpolated[levels-1](x, y, c) = downsampled[levels-1](x, y, c);\n for (unsigned int l = levels-2; l < levels; --l) {\n upsampledx[l](x, y, c) = select((x % 2) == 0,\n interpolated[l+1](x\/2, y, c),\n 0.5f * (interpolated[l+1](x\/2, y, c) +\n interpolated[l+1](x\/2+1, y, c)));\n upsampled[l](x, y, c) = select((y % 2) == 0,\n upsampledx[l](x, y\/2, c),\n 0.5f * (upsampledx[l](x, y\/2, c) +\n upsampledx[l](x, y\/2+1, c)));\n interpolated[l](x, y, c) = downsampled[l](x, y, c) + (1.0f - downsampled[l](x, y, 3)) * upsampled[l](x, y, c);\n }\n\n Func normalize(\"normalize\");\n normalize(x, y, c) = interpolated[0](x, y, c) \/ interpolated[0](x, y, 3);\n\n Func final(\"final\");\n final(x, y, c) = normalize(x, y, c);\n\n std::cout << \"Finished function setup.\" << std::endl;\n\n int sched;\n std::string target = get_target();\n if (target == \"ptx\" || target == \"ptx-debug\") {\n sched = 4;\n } else {\n sched = 2;\n }\n\n switch (sched) {\n case 0:\n {\n std::cout << \"Flat schedule.\" << std::endl;\n for (unsigned int l = 0; l < levels; ++l) {\n downsampled[l].compute_root();\n interpolated[l].compute_root();\n }\n final.compute_root();\n break;\n }\n case 1:\n {\n std::cout << \"Flat schedule with vectorization.\" << std::endl;\n for (unsigned int l = 0; l < levels; ++l) {\n downsampled[l].compute_root().vectorize(x,4);\n interpolated[l].compute_root().vectorize(x,4);\n }\n final.compute_root();\n break;\n }\n case 2:\n {\n Var xi, yi;\n std::cout << \"Flat schedule with parallelization + vectorization.\" << std::endl;\n clamped.compute_root().parallel(y).bound(c, 0, 4).reorder(c, x, y).reorder_storage(c, x, y).vectorize(c, 4);\n for (unsigned int l = 1; l < levels-1; ++l) {\n if (l > 0) downsampled[l].compute_root().parallel(y).reorder(c, x, y).reorder_storage(c, x, y).vectorize(c, 4);\n interpolated[l].compute_root().parallel(y).reorder(c, x, y).reorder_storage(c, x, y).vectorize(c, 4);\n interpolated[l].unroll(x, 2).unroll(y, 2);\n }\n final.reorder(c, x, y).bound(c, 0, 3).parallel(y);\n final.tile(x, y, xi, yi, 2, 2).unroll(xi).unroll(yi);\n final.bound(x, 0, input.width());\n final.bound(y, 0, input.height());\n break;\n }\n case 3:\n {\n std::cout << \"Flat schedule with vectorization sometimes.\" << std::endl;\n for (unsigned int l = 0; l < levels; ++l) {\n if (l + 4 < levels) {\n Var yo,yi;\n downsampled[l].compute_root().vectorize(x,4);\n interpolated[l].compute_root().vectorize(x,4);\n } else {\n downsampled[l].compute_root();\n interpolated[l].compute_root();\n }\n }\n final.compute_root();\n break;\n }\n case 4:\n {\n std::cout << \"GPU schedule.\" << std::endl;\n\n \/\/ Some gpus don't have enough memory to process the entire\n \/\/ image, so we process the image in tiles.\n Var yo, yi, xo, xi;\n final.reorder(c, x, y).bound(c, 0, 3).vectorize(x, 4);\n final.tile(x, y, xo, yo, xi, yi, input.width()\/4, input.height()\/4);\n normalize.compute_at(final, xo).reorder(c, x, y).cuda_tile(x, y, 16, 16).unroll(c);\n\n \/\/ Start from level 1 to save memory - level zero will be computed on demand\n for (unsigned int l = 1; l < levels; ++l) {\n int tile_size = 32 >> l;\n if (tile_size < 1) tile_size = 1;\n if (tile_size > 16) tile_size = 16;\n downsampled[l].compute_root().cuda_tile(x, y, c, tile_size, tile_size, 4);\n interpolated[l].compute_at(final, xo).cuda_tile(x, y, c, tile_size, tile_size, 4);\n }\n break;\n }\n default:\n assert(0 && \"No schedule with this number.\");\n }\n\n \/\/ JIT compile the pipeline eagerly, so we don't interfere with timing\n final.compile_jit();\n\n Image<float> in_png = load<float>(argv[1]);\n Image<float> out(in_png.width(), in_png.height(), 3);\n assert(in_png.channels() == 4);\n input.set(in_png);\n\n std::cout << \"Running... \" << std::endl;\n double min = std::numeric_limits<double>::infinity();\n const unsigned int iters = 20;\n\n for (unsigned int x = 0; x < iters; ++x) {\n double before = now();\n final.realize(out);\n double after = now();\n double amt = after - before;\n\n std::cout << \" \" << amt * 1000 << std::endl;\n if (amt < min) min = amt;\n\n }\n std::cout << \" took \" << min * 1000 << \" msec.\" << std::endl;\n\n vector<Argument> args;\n args.push_back(input);\n final.compile_to_assembly(\"test.s\", args);\n\n save(out, argv[2]);\n\n}\n<|endoftext|>"} {"text":"<commit_before>\/\/ This file is part of OpenMVG, an Open Multiple View Geometry C++ library.\n\n\/\/ Copyright (c) 2016 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_MULTIVIEW_TRIANGULATION_HPP\n#define OPENMVG_MULTIVIEW_TRIANGULATION_HPP\n\n#include \"openMVG\/numeric\/eigen_alias_definition.hpp\"\n\nnamespace openMVG\n{\n\n\/**\n* @brief Linear DLT triangulation\n* @param P1 First camera projection matrix\n* @param P2 Second camera projection matrix\n* @param x1 bearing vector of the landmark observation in the first camera\n* @param x2 bearing vector of the landmark observation in the second camera\n* @param[out] X_homogeneous Homogeneous triangulated point\n* @see HZ 12.2 pag.312\n* @ref Multiple View Geometry - Richard Hartley, Andrew Zisserman - second edition\n*\/\nvoid TriangulateDLT\n(\n const Mat34 &P1,\n const Vec3 &x1,\n const Mat34 &P2,\n const Vec3 &x2,\n Vec4 *X_homogeneous\n);\n\n\/**\n* @brief Linear DLT triangulation\n* @param P1 First camera projection matrix\n* @param P2 Second camera projection matrix\n* @param x1 bearing vector of the landmark observation in the first camera\n* @param x2 bearing vector of the landmark observation in the second camera\n* @param[out] X_euclidean Euclidean triangulated point\n* @see HZ 12.2 pag.312\n* @ref Multiple View Geometry - Richard Hartley, Andrew Zisserman - second edition\n*\/\nvoid TriangulateDLT\n( const Mat34 &P1,\n const Vec3 &x1,\n const Mat34 &P2,\n const Vec3 &x2,\n Vec3 *X_euclidean\n);\n\n\/**\n* @brief Optimal L1 Angular triangulation\n* @brief Minimize the L1 norm of angular errors\n* @param R0 First Camera rotation matrix\n* @param t0 First Camera translation vector\n* @param x0 bearing vector of the landmark observation in the first camera\n* @param R1 Second Camera rotation matrix\n* @param t1 Second Camera translation vector\n* @param x1 bearing vector of the landmark observation in the second camera\n* @param[out] X_euclidean Euclidean triangulated point\n* @ref S.H. Lee, J. Civera - Closed-Form Optimal Triangulation Based on Angular Errors - ICCV 2019 - https:\/\/arxiv.org\/pdf\/1903.09115.pdf\n*\/\nvoid TriangulateL1Angular\n(\n const Mat3 &R0,\n const Vec3 &t0,\n const Vec3 &x0,\n const Mat3 &R1,\n const Vec3 &t1,\n const Vec3 &x1,\n Vec3 *X_euclidean\n);\n\n\n\/**\n* @brief Optimal LInfinity Angular triangulation\n* @brief Minimize the LInfinity norm of angular errors\n* @param R0 First Camera rotation matrix\n* @param t0 First Camera translation vector\n* @param x0 bearing vector of the landmark observation in the first camera\n* @param R1 Second Camera rotation matrix\n* @param t1 Second Camera translation vector\n* @param x1 bearing vector of the landmark observation in the second camera\n* @param[out] X_euclidean Euclidean triangulated point\n* @ref S.H. Lee, J. Civera - Closed-Form Optimal Triangulation Based on Angular Errors - ICCV 2019 - https:\/\/arxiv.org\/pdf\/1903.09115.pdf\n*\/\nvoid TriangulateLInfinityAngular\n(\n const Mat3 &R0,\n const Vec3 &t0,\n const Vec3 &x0,\n const Mat3 &R1,\n const Vec3 &t1,\n const Vec3 &x1,\n Vec3 *X_euclidean\n);\n\n\/**\n* @brief Inverse Depth Weighted Midpoint method\n* @brief and its ad hoc adequacy test (a replacment for cheiralty tests)\n* @brief should be better than DLT for low and high parallax angles\n* @param P1 First camera projection matrix\n* @param P2 Second camera projection matrix\n* @param x1 bearing vector of the landmark observation in the first camera\n* @param x2 bearing vector of the landmark observation in the second camera\n* @param[out] X_euclidean Euclidean triangulated point\n* @return true if the point pass the adequacy test, false otherwise\n* @ref S.H. Lee, J. Civera - Triangulation: Why Optimize? - BMVC 2019 - https:\/\/arxiv.org\/pdf\/1907.11917.pdf\n*\/\nbool TriangulateIDW(\n const Mat34 & P1,\n const Vec3 &x1,\n const Mat34 &P2, \n const Vec3 &x2,\n Vec3 *X_euclidean\n);\n\n\n\n} \/\/ namespace openMVG\n\n#endif \/\/ OPENMVG_MULTIVIEW_TRIANGULATION_HPP\n<commit_msg>Typo fix #1623<commit_after>\/\/ This file is part of OpenMVG, an Open Multiple View Geometry C++ library.\n\n\/\/ Copyright (c) 2016 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_MULTIVIEW_TRIANGULATION_HPP\n#define OPENMVG_MULTIVIEW_TRIANGULATION_HPP\n\n#include \"openMVG\/numeric\/eigen_alias_definition.hpp\"\n\nnamespace openMVG\n{\n\n\/**\n* @brief Linear DLT triangulation\n* @param P1 First camera projection matrix\n* @param P2 Second camera projection matrix\n* @param x1 bearing vector of the landmark observation in the first camera\n* @param x2 bearing vector of the landmark observation in the second camera\n* @param[out] X_homogeneous Homogeneous triangulated point\n* @see HZ 12.2 pag.312\n* @ref Multiple View Geometry - Richard Hartley, Andrew Zisserman - second edition\n*\/\nvoid TriangulateDLT\n(\n const Mat34 &P1,\n const Vec3 &x1,\n const Mat34 &P2,\n const Vec3 &x2,\n Vec4 *X_homogeneous\n);\n\n\/**\n* @brief Linear DLT triangulation\n* @param P1 First camera projection matrix\n* @param P2 Second camera projection matrix\n* @param x1 bearing vector of the landmark observation in the first camera\n* @param x2 bearing vector of the landmark observation in the second camera\n* @param[out] X_euclidean Euclidean triangulated point\n* @see HZ 12.2 pag.312\n* @ref Multiple View Geometry - Richard Hartley, Andrew Zisserman - second edition\n*\/\nvoid TriangulateDLT\n( const Mat34 &P1,\n const Vec3 &x1,\n const Mat34 &P2,\n const Vec3 &x2,\n Vec3 *X_euclidean\n);\n\n\/**\n* @brief Optimal L1 Angular triangulation\n* @brief Minimize the L1 norm of angular errors\n* @param R0 First Camera rotation matrix\n* @param t0 First Camera translation vector\n* @param x0 bearing vector of the landmark observation in the first camera\n* @param R1 Second Camera rotation matrix\n* @param t1 Second Camera translation vector\n* @param x1 bearing vector of the landmark observation in the second camera\n* @param[out] X_euclidean Euclidean triangulated point\n* @ref S.H. Lee, J. Civera - Closed-Form Optimal Triangulation Based on Angular Errors - ICCV 2019 - https:\/\/arxiv.org\/pdf\/1903.09115.pdf\n*\/\nvoid TriangulateL1Angular\n(\n const Mat3 &R0,\n const Vec3 &t0,\n const Vec3 &x0,\n const Mat3 &R1,\n const Vec3 &t1,\n const Vec3 &x1,\n Vec3 *X_euclidean\n);\n\n\n\/**\n* @brief Optimal LInfinity Angular triangulation\n* @brief Minimize the LInfinity norm of angular errors\n* @param R0 First Camera rotation matrix\n* @param t0 First Camera translation vector\n* @param x0 bearing vector of the landmark observation in the first camera\n* @param R1 Second Camera rotation matrix\n* @param t1 Second Camera translation vector\n* @param x1 bearing vector of the landmark observation in the second camera\n* @param[out] X_euclidean Euclidean triangulated point\n* @ref S.H. Lee, J. Civera - Closed-Form Optimal Triangulation Based on Angular Errors - ICCV 2019 - https:\/\/arxiv.org\/pdf\/1903.09115.pdf\n*\/\nvoid TriangulateLInfinityAngular\n(\n const Mat3 &R0,\n const Vec3 &t0,\n const Vec3 &x0,\n const Mat3 &R1,\n const Vec3 &t1,\n const Vec3 &x1,\n Vec3 *X_euclidean\n);\n\n\/**\n* @brief Inverse Depth Weighted Midpoint method\n* @brief and its ad hoc adequacy test (a replacement for cheirality tests)\n* @brief should be better than DLT for low and high parallax angles\n* @param P1 First camera projection matrix\n* @param P2 Second camera projection matrix\n* @param x1 bearing vector of the landmark observation in the first camera\n* @param x2 bearing vector of the landmark observation in the second camera\n* @param[out] X_euclidean Euclidean triangulated point\n* @return true if the point pass the adequacy test, false otherwise\n* @ref S.H. Lee, J. Civera - Triangulation: Why Optimize? - BMVC 2019 - https:\/\/arxiv.org\/pdf\/1907.11917.pdf\n*\/\nbool TriangulateIDW(\n const Mat34 & P1,\n const Vec3 &x1,\n const Mat34 &P2,\n const Vec3 &x2,\n Vec3 *X_euclidean\n);\n\n\n\n} \/\/ namespace openMVG\n\n#endif \/\/ OPENMVG_MULTIVIEW_TRIANGULATION_HPP\n<|endoftext|>"} {"text":"<commit_before>\/****************************************************************************\n**\n** Copyright (C) 2009 Nokia Corporation and\/or its subsidiary(-ies).\n** Contact: Nokia Corporation (qt-info@nokia.com)\n**\n** This file is part of the examples of the Qt Toolkit.\n**\n** $QT_BEGIN_LICENSE:LGPL$\n** No Commercial Usage\n** This file contains pre-release code and may not be distributed.\n** You may use this file in accordance with the terms and conditions\n** contained in the either Technology Preview License Agreement or the\n** Beta Release License Agreement.\n**\n** GNU Lesser General Public License Usage\n** Alternatively, this file may be used under the terms of the GNU Lesser\n** General Public License version 2.1 as published by the Free Software\n** Foundation and appearing in the file LICENSE.LGPL included in the\n** packaging of this file. Please review the following information to\n** ensure the GNU Lesser General Public License version 2.1 requirements\n** will be met: http:\/\/www.gnu.org\/licenses\/old-licenses\/lgpl-2.1.html.\n**\n** In addition, as a special exception, Nokia gives you certain\n** additional rights. These rights are described in the Nokia Qt LGPL\n** Exception version 1.0, included in the file LGPL_EXCEPTION.txt in this\n** package.\n**\n** GNU General Public License Usage\n** Alternatively, this file may be used under the terms of the GNU\n** General Public License version 3.0 as published by the Free Software\n** Foundation and appearing in the file LICENSE.GPL included in the\n** packaging of this file. Please review the following information to\n** ensure the GNU General Public License version 3.0 requirements will be\n** met: http:\/\/www.gnu.org\/copyleft\/gpl.html.\n**\n** If you are unsure which license is appropriate for your use, please\n** contact the sales department at http:\/\/qt.nokia.com\/contact.\n** $QT_END_LICENSE$\n**\n****************************************************************************\/\n\n#include <QtGui\/QImage>\n#include \"glwidget.h\"\n\n#include <math.h>\n\n#ifndef GL_MULTISAMPLE\n#define GL_MULTISAMPLE 0x809D\n#endif\n\nGLWidget::GLWidget(QWidget *parent)\n : QGLWidget(QGLFormat(QGL::SampleBuffers|QGL::AlphaChannel), parent)\n{\n setWindowTitle(tr(\"OpenGL framebuffer objects\"));\n makeCurrent();\n\n if (QGLFramebufferObject::hasOpenGLFramebufferBlit()) {\n QGLFramebufferObjectFormat format;\n format.setSamples(4);\n\n render_fbo = new QGLFramebufferObject(512, 512, format);\n texture_fbo = new QGLFramebufferObject(512, 512);\n } else {\n render_fbo = new QGLFramebufferObject(1024, 1024);\n texture_fbo = render_fbo;\n }\n\n rot_x = rot_y = rot_z = 0.0f;\n scale = 0.1f;\n anim = new QTimeLine(750, this);\n anim->setUpdateInterval(20);\n connect(anim, SIGNAL(valueChanged(qreal)), SLOT(animate(qreal)));\n connect(anim, SIGNAL(finished()), SLOT(animFinished()));\n\n svg_renderer = new QSvgRenderer(QLatin1String(\":\/res\/bubbles.svg\"), this);\n connect(svg_renderer, SIGNAL(repaintNeeded()), this, SLOT(draw()));\n\n logo = QImage(\":\/res\/designer.png\");\n logo = logo.convertToFormat(QImage::Format_ARGB32);\n\n tile_list = glGenLists(1);\n glNewList(tile_list, GL_COMPILE);\n glBegin(GL_QUADS);\n {\n glTexCoord2f(0.0f, 0.0f); glVertex3f(-1.0f, -1.0f, 1.0f);\n glTexCoord2f(1.0f, 0.0f); glVertex3f( 1.0f, -1.0f, 1.0f);\n glTexCoord2f(1.0f, 1.0f); glVertex3f( 1.0f, 1.0f, 1.0f);\n glTexCoord2f(0.0f, 1.0f); glVertex3f(-1.0f, 1.0f, 1.0f);\n\n glTexCoord2f(1.0f, 0.0f); glVertex3f(-1.0f, -1.0f, -1.0f);\n glTexCoord2f(1.0f, 1.0f); glVertex3f(-1.0f, 1.0f, -1.0f);\n glTexCoord2f(0.0f, 1.0f); glVertex3f( 1.0f, 1.0f, -1.0f);\n glTexCoord2f(0.0f, 0.0f); glVertex3f( 1.0f, -1.0f, -1.0f);\n\n glTexCoord2f(0.0f, 1.0f); glVertex3f(-1.0f, 1.0f, -1.0f);\n glTexCoord2f(0.0f, 0.0f); glVertex3f(-1.0f, 1.0f, 1.0f);\n glTexCoord2f(1.0f, 0.0f); glVertex3f( 1.0f, 1.0f, 1.0f);\n glTexCoord2f(1.0f, 1.0f); glVertex3f( 1.0f, 1.0f, -1.0f);\n\n glTexCoord2f(1.0f, 1.0f); glVertex3f(-1.0f, -1.0f, -1.0f);\n glTexCoord2f(0.0f, 1.0f); glVertex3f( 1.0f, -1.0f, -1.0f);\n glTexCoord2f(0.0f, 0.0f); glVertex3f( 1.0f, -1.0f, 1.0f);\n glTexCoord2f(1.0f, 0.0f); glVertex3f(-1.0f, -1.0f, 1.0f);\n\n glTexCoord2f(1.0f, 0.0f); glVertex3f( 1.0f, -1.0f, -1.0f);\n glTexCoord2f(1.0f, 1.0f); glVertex3f( 1.0f, 1.0f, -1.0f);\n glTexCoord2f(0.0f, 1.0f); glVertex3f( 1.0f, 1.0f, 1.0f);\n glTexCoord2f(0.0f, 0.0f); glVertex3f( 1.0f, -1.0f, 1.0f);\n\n glTexCoord2f(0.0f, 0.0f); glVertex3f(-1.0f, -1.0f, -1.0f);\n glTexCoord2f(1.0f, 0.0f); glVertex3f(-1.0f, -1.0f, 1.0f);\n glTexCoord2f(1.0f, 1.0f); glVertex3f(-1.0f, 1.0f, 1.0f);\n glTexCoord2f(0.0f, 1.0f); glVertex3f(-1.0f, 1.0f, -1.0f);\n }\n glEnd();\n glEndList();\n\n wave = new GLfloat[logo.width()*logo.height()];\n memset(wave, 0, logo.width()*logo.height());\n startTimer(30); \/\/ wave timer\n}\n\nGLWidget::~GLWidget()\n{\n delete[] wave;\n glDeleteLists(tile_list, 1);\n delete texture_fbo;\n if (render_fbo != texture_fbo)\n delete render_fbo;\n}\n\nvoid GLWidget::paintEvent(QPaintEvent *)\n{\n draw();\n}\n\nvoid GLWidget::draw()\n{\n QPainter p(this); \/\/ used for text overlay\n\n \/\/ save the GL state set for QPainter\n saveGLState();\n\n \/\/ render the 'bubbles.svg' file into our framebuffer object\n QPainter fbo_painter(render_fbo);\n svg_renderer->render(&fbo_painter);\n fbo_painter.end();\n\n if (render_fbo != texture_fbo) {\n QRect rect(0, 0, render_fbo->width(), render_fbo->height());\n QGLFramebufferObject::blitFramebuffer(texture_fbo, rect,\n render_fbo, rect);\n }\n\n \/\/ draw into the GL widget\n glClear(GL_COLOR_BUFFER_BIT | GL_DEPTH_BUFFER_BIT);\n glMatrixMode(GL_PROJECTION);\n glLoadIdentity();\n glFrustum(-1, 1, -1, 1, 10, 100);\n glTranslatef(0.0f, 0.0f, -15.0f);\n glMatrixMode(GL_MODELVIEW);\n glLoadIdentity();\n glViewport(0, 0, width(), height());\n glEnable(GL_BLEND);\n glBlendFunc(GL_SRC_ALPHA, GL_ONE_MINUS_SRC_ALPHA);\n\n glBindTexture(GL_TEXTURE_2D, texture_fbo->texture());\n glTexParameteri(GL_TEXTURE_2D, GL_TEXTURE_MAG_FILTER, GL_LINEAR);\n glTexParameteri(GL_TEXTURE_2D, GL_TEXTURE_MIN_FILTER, GL_LINEAR);\n glEnable(GL_TEXTURE_2D);\n glEnable(GL_MULTISAMPLE);\n glEnable(GL_CULL_FACE);\n\n \/\/ draw background\n glPushMatrix();\n glScalef(1.7f, 1.7f, 1.7f);\n glColor4f(1.0f, 1.0f, 1.0f, 1.0f);\n glCallList(tile_list);\n glPopMatrix();\n\n const int w = logo.width();\n const int h = logo.height();\n\n glRotatef(rot_x, 1.0f, 0.0f, 0.0f);\n glRotatef(rot_y, 0.0f, 1.0f, 0.0f);\n glRotatef(rot_z, 0.0f, 0.0f, 1.0f);\n glScalef(scale\/w, scale\/w, scale\/w);\n\n glDepthFunc(GL_LESS);\n glEnable(GL_DEPTH_TEST);\n \/\/ draw the Qt icon\n glTranslatef(-w+1, -h+1, 0.0f);\n for (int y=h-1; y>=0; --y) {\n uint *p = (uint*) logo.scanLine(y);\n uint *end = p + w;\n int x = 0;\n while (p < end) {\n glColor4ub(qRed(*p), qGreen(*p), qBlue(*p), uchar(qAlpha(*p)*.9));\n glTranslatef(0.0f, 0.0f, wave[y*w+x]);\n if (qAlpha(*p) > 128)\n glCallList(tile_list);\n glTranslatef(0.0f, 0.0f, -wave[y*w+x]);\n glTranslatef(2.0f, 0.0f, 0.0f);\n ++x;\n ++p;\n }\n glTranslatef(-w*2.0f, 2.0f, 0.0f);\n }\n\n \/\/ restore the GL state that QPainter expects\n restoreGLState();\n\n \/\/ draw the overlayed text using QPainter\n p.setPen(QColor(197, 197, 197, 157));\n p.setBrush(QColor(197, 197, 197, 127));\n p.drawRect(QRect(0, 0, width(), 50));\n p.setPen(Qt::black);\n p.setBrush(Qt::NoBrush);\n const QString str1(tr(\"A simple OpenGL framebuffer object example.\"));\n const QString str2(tr(\"Use the mouse wheel to zoom, press buttons and move mouse to rotate, double-click to flip.\"));\n QFontMetrics fm(p.font());\n p.drawText(width()\/2 - fm.width(str1)\/2, 20, str1);\n p.drawText(width()\/2 - fm.width(str2)\/2, 20 + fm.lineSpacing(), str2);\n}\n\nvoid GLWidget::mousePressEvent(QMouseEvent *e)\n{\n anchor = e->pos();\n}\n\nvoid GLWidget::mouseMoveEvent(QMouseEvent *e)\n{\n QPoint diff = e->pos() - anchor;\n if (e->buttons() & Qt::LeftButton) {\n rot_x += diff.y()\/5.0f;\n rot_y += diff.x()\/5.0f;\n } else if (e->buttons() & Qt::RightButton) {\n rot_z += diff.x()\/5.0f;\n }\n\n anchor = e->pos();\n draw();\n}\n\nvoid GLWidget::wheelEvent(QWheelEvent *e)\n{\n e->delta() > 0 ? scale += scale*0.1f : scale -= scale*0.1f;\n draw();\n}\n\nvoid GLWidget::mouseDoubleClickEvent(QMouseEvent *)\n{\n anim->start();\n}\n\nvoid GLWidget::animate(qreal val)\n{\n rot_y = val * 180;\n draw();\n}\n\nvoid GLWidget::animFinished()\n{\n if (anim->direction() == QTimeLine::Forward)\n anim->setDirection(QTimeLine::Backward);\n else\n anim->setDirection(QTimeLine::Forward);\n}\n\nvoid GLWidget::saveGLState()\n{\n glPushAttrib(GL_ALL_ATTRIB_BITS);\n glMatrixMode(GL_PROJECTION);\n glPushMatrix();\n glMatrixMode(GL_MODELVIEW);\n glPushMatrix();\n}\n\nvoid GLWidget::restoreGLState()\n{\n glMatrixMode(GL_PROJECTION);\n glPopMatrix();\n glMatrixMode(GL_MODELVIEW);\n glPopMatrix();\n glPopAttrib();\n}\n\n#define PI 3.14159\n\nvoid GLWidget::timerEvent(QTimerEvent *)\n{\n if (QApplication::mouseButtons() != 0)\n return;\n\n static bool scale_in = true;\n\n if (scale_in && scale > 35.0f)\n scale_in = false;\n else if (!scale_in && scale < .5f)\n scale_in = true;\n\n scale = scale_in ? scale + scale*0.01f : scale-scale*0.01f;\n rot_z += 0.3f;\n rot_x += 0.1f;\n\n int dx, dy; \/\/ disturbance point\n float s, v, W, t;\n int i, j;\n static float wt[128][128];\n const int width = logo.width();\n const int AMP = 5;\n\n dx = dy = width >> 1;\n\n W = .3f;\n v = -4; \/\/ wave speed\n\n for (i = 0; i < width; ++i) {\n\tfor ( j = 0; j < width; ++j) {\n\t s = sqrt((double) ((j - dx) * (j - dx) + (i - dy) * (i - dy)));\n\t wt[i][j] += 0.1f;\n\t t = s \/ v;\n if (s != 0)\n wave[i*width + j] = AMP * sin(2 * PI * W * (wt[i][j] + t)) \/ (0.2*(s + 2));\n else\n wave[i*width + j] = AMP * sin(2 * PI * W * (wt[i][j] + t));\n\t}\n }\n}\n<commit_msg>Ensured that the framebufferobject example has a stencil buffer.<commit_after>\/****************************************************************************\n**\n** Copyright (C) 2009 Nokia Corporation and\/or its subsidiary(-ies).\n** Contact: Nokia Corporation (qt-info@nokia.com)\n**\n** This file is part of the examples of the Qt Toolkit.\n**\n** $QT_BEGIN_LICENSE:LGPL$\n** No Commercial Usage\n** This file contains pre-release code and may not be distributed.\n** You may use this file in accordance with the terms and conditions\n** contained in the either Technology Preview License Agreement or the\n** Beta Release License Agreement.\n**\n** GNU Lesser General Public License Usage\n** Alternatively, this file may be used under the terms of the GNU Lesser\n** General Public License version 2.1 as published by the Free Software\n** Foundation and appearing in the file LICENSE.LGPL included in the\n** packaging of this file. Please review the following information to\n** ensure the GNU Lesser General Public License version 2.1 requirements\n** will be met: http:\/\/www.gnu.org\/licenses\/old-licenses\/lgpl-2.1.html.\n**\n** In addition, as a special exception, Nokia gives you certain\n** additional rights. These rights are described in the Nokia Qt LGPL\n** Exception version 1.0, included in the file LGPL_EXCEPTION.txt in this\n** package.\n**\n** GNU General Public License Usage\n** Alternatively, this file may be used under the terms of the GNU\n** General Public License version 3.0 as published by the Free Software\n** Foundation and appearing in the file LICENSE.GPL included in the\n** packaging of this file. Please review the following information to\n** ensure the GNU General Public License version 3.0 requirements will be\n** met: http:\/\/www.gnu.org\/copyleft\/gpl.html.\n**\n** If you are unsure which license is appropriate for your use, please\n** contact the sales department at http:\/\/qt.nokia.com\/contact.\n** $QT_END_LICENSE$\n**\n****************************************************************************\/\n\n#include <QtGui\/QImage>\n#include \"glwidget.h\"\n\n#include <math.h>\n\n#ifndef GL_MULTISAMPLE\n#define GL_MULTISAMPLE 0x809D\n#endif\n\nGLWidget::GLWidget(QWidget *parent)\n : QGLWidget(QGLFormat(QGL::SampleBuffers|QGL::AlphaChannel), parent)\n{\n setWindowTitle(tr(\"OpenGL framebuffer objects\"));\n makeCurrent();\n\n if (QGLFramebufferObject::hasOpenGLFramebufferBlit()) {\n QGLFramebufferObjectFormat format;\n format.setSamples(4);\n format.setAttachment(QGLFramebufferObject::CombinedDepthStencil);\n\n render_fbo = new QGLFramebufferObject(512, 512, format);\n texture_fbo = new QGLFramebufferObject(512, 512);\n } else {\n render_fbo = new QGLFramebufferObject(1024, 1024);\n texture_fbo = render_fbo;\n }\n\n rot_x = rot_y = rot_z = 0.0f;\n scale = 0.1f;\n anim = new QTimeLine(750, this);\n anim->setUpdateInterval(20);\n connect(anim, SIGNAL(valueChanged(qreal)), SLOT(animate(qreal)));\n connect(anim, SIGNAL(finished()), SLOT(animFinished()));\n\n svg_renderer = new QSvgRenderer(QLatin1String(\":\/res\/bubbles.svg\"), this);\n connect(svg_renderer, SIGNAL(repaintNeeded()), this, SLOT(draw()));\n\n logo = QImage(\":\/res\/designer.png\");\n logo = logo.convertToFormat(QImage::Format_ARGB32);\n\n tile_list = glGenLists(1);\n glNewList(tile_list, GL_COMPILE);\n glBegin(GL_QUADS);\n {\n glTexCoord2f(0.0f, 0.0f); glVertex3f(-1.0f, -1.0f, 1.0f);\n glTexCoord2f(1.0f, 0.0f); glVertex3f( 1.0f, -1.0f, 1.0f);\n glTexCoord2f(1.0f, 1.0f); glVertex3f( 1.0f, 1.0f, 1.0f);\n glTexCoord2f(0.0f, 1.0f); glVertex3f(-1.0f, 1.0f, 1.0f);\n\n glTexCoord2f(1.0f, 0.0f); glVertex3f(-1.0f, -1.0f, -1.0f);\n glTexCoord2f(1.0f, 1.0f); glVertex3f(-1.0f, 1.0f, -1.0f);\n glTexCoord2f(0.0f, 1.0f); glVertex3f( 1.0f, 1.0f, -1.0f);\n glTexCoord2f(0.0f, 0.0f); glVertex3f( 1.0f, -1.0f, -1.0f);\n\n glTexCoord2f(0.0f, 1.0f); glVertex3f(-1.0f, 1.0f, -1.0f);\n glTexCoord2f(0.0f, 0.0f); glVertex3f(-1.0f, 1.0f, 1.0f);\n glTexCoord2f(1.0f, 0.0f); glVertex3f( 1.0f, 1.0f, 1.0f);\n glTexCoord2f(1.0f, 1.0f); glVertex3f( 1.0f, 1.0f, -1.0f);\n\n glTexCoord2f(1.0f, 1.0f); glVertex3f(-1.0f, -1.0f, -1.0f);\n glTexCoord2f(0.0f, 1.0f); glVertex3f( 1.0f, -1.0f, -1.0f);\n glTexCoord2f(0.0f, 0.0f); glVertex3f( 1.0f, -1.0f, 1.0f);\n glTexCoord2f(1.0f, 0.0f); glVertex3f(-1.0f, -1.0f, 1.0f);\n\n glTexCoord2f(1.0f, 0.0f); glVertex3f( 1.0f, -1.0f, -1.0f);\n glTexCoord2f(1.0f, 1.0f); glVertex3f( 1.0f, 1.0f, -1.0f);\n glTexCoord2f(0.0f, 1.0f); glVertex3f( 1.0f, 1.0f, 1.0f);\n glTexCoord2f(0.0f, 0.0f); glVertex3f( 1.0f, -1.0f, 1.0f);\n\n glTexCoord2f(0.0f, 0.0f); glVertex3f(-1.0f, -1.0f, -1.0f);\n glTexCoord2f(1.0f, 0.0f); glVertex3f(-1.0f, -1.0f, 1.0f);\n glTexCoord2f(1.0f, 1.0f); glVertex3f(-1.0f, 1.0f, 1.0f);\n glTexCoord2f(0.0f, 1.0f); glVertex3f(-1.0f, 1.0f, -1.0f);\n }\n glEnd();\n glEndList();\n\n wave = new GLfloat[logo.width()*logo.height()];\n memset(wave, 0, logo.width()*logo.height());\n startTimer(30); \/\/ wave timer\n}\n\nGLWidget::~GLWidget()\n{\n delete[] wave;\n glDeleteLists(tile_list, 1);\n delete texture_fbo;\n if (render_fbo != texture_fbo)\n delete render_fbo;\n}\n\nvoid GLWidget::paintEvent(QPaintEvent *)\n{\n draw();\n}\n\nvoid GLWidget::draw()\n{\n QPainter p(this); \/\/ used for text overlay\n\n \/\/ save the GL state set for QPainter\n saveGLState();\n\n \/\/ render the 'bubbles.svg' file into our framebuffer object\n QPainter fbo_painter(render_fbo);\n svg_renderer->render(&fbo_painter);\n fbo_painter.end();\n\n if (render_fbo != texture_fbo) {\n QRect rect(0, 0, render_fbo->width(), render_fbo->height());\n QGLFramebufferObject::blitFramebuffer(texture_fbo, rect,\n render_fbo, rect);\n }\n\n \/\/ draw into the GL widget\n glClear(GL_COLOR_BUFFER_BIT | GL_DEPTH_BUFFER_BIT);\n glMatrixMode(GL_PROJECTION);\n glLoadIdentity();\n glFrustum(-1, 1, -1, 1, 10, 100);\n glTranslatef(0.0f, 0.0f, -15.0f);\n glMatrixMode(GL_MODELVIEW);\n glLoadIdentity();\n glViewport(0, 0, width(), height());\n glEnable(GL_BLEND);\n glBlendFunc(GL_SRC_ALPHA, GL_ONE_MINUS_SRC_ALPHA);\n\n glBindTexture(GL_TEXTURE_2D, texture_fbo->texture());\n glTexParameteri(GL_TEXTURE_2D, GL_TEXTURE_MAG_FILTER, GL_LINEAR);\n glTexParameteri(GL_TEXTURE_2D, GL_TEXTURE_MIN_FILTER, GL_LINEAR);\n glEnable(GL_TEXTURE_2D);\n glEnable(GL_MULTISAMPLE);\n glEnable(GL_CULL_FACE);\n\n \/\/ draw background\n glPushMatrix();\n glScalef(1.7f, 1.7f, 1.7f);\n glColor4f(1.0f, 1.0f, 1.0f, 1.0f);\n glCallList(tile_list);\n glPopMatrix();\n\n const int w = logo.width();\n const int h = logo.height();\n\n glRotatef(rot_x, 1.0f, 0.0f, 0.0f);\n glRotatef(rot_y, 0.0f, 1.0f, 0.0f);\n glRotatef(rot_z, 0.0f, 0.0f, 1.0f);\n glScalef(scale\/w, scale\/w, scale\/w);\n\n glDepthFunc(GL_LESS);\n glEnable(GL_DEPTH_TEST);\n \/\/ draw the Qt icon\n glTranslatef(-w+1, -h+1, 0.0f);\n for (int y=h-1; y>=0; --y) {\n uint *p = (uint*) logo.scanLine(y);\n uint *end = p + w;\n int x = 0;\n while (p < end) {\n glColor4ub(qRed(*p), qGreen(*p), qBlue(*p), uchar(qAlpha(*p)*.9));\n glTranslatef(0.0f, 0.0f, wave[y*w+x]);\n if (qAlpha(*p) > 128)\n glCallList(tile_list);\n glTranslatef(0.0f, 0.0f, -wave[y*w+x]);\n glTranslatef(2.0f, 0.0f, 0.0f);\n ++x;\n ++p;\n }\n glTranslatef(-w*2.0f, 2.0f, 0.0f);\n }\n\n \/\/ restore the GL state that QPainter expects\n restoreGLState();\n\n \/\/ draw the overlayed text using QPainter\n p.setPen(QColor(197, 197, 197, 157));\n p.setBrush(QColor(197, 197, 197, 127));\n p.drawRect(QRect(0, 0, width(), 50));\n p.setPen(Qt::black);\n p.setBrush(Qt::NoBrush);\n const QString str1(tr(\"A simple OpenGL framebuffer object example.\"));\n const QString str2(tr(\"Use the mouse wheel to zoom, press buttons and move mouse to rotate, double-click to flip.\"));\n QFontMetrics fm(p.font());\n p.drawText(width()\/2 - fm.width(str1)\/2, 20, str1);\n p.drawText(width()\/2 - fm.width(str2)\/2, 20 + fm.lineSpacing(), str2);\n}\n\nvoid GLWidget::mousePressEvent(QMouseEvent *e)\n{\n anchor = e->pos();\n}\n\nvoid GLWidget::mouseMoveEvent(QMouseEvent *e)\n{\n QPoint diff = e->pos() - anchor;\n if (e->buttons() & Qt::LeftButton) {\n rot_x += diff.y()\/5.0f;\n rot_y += diff.x()\/5.0f;\n } else if (e->buttons() & Qt::RightButton) {\n rot_z += diff.x()\/5.0f;\n }\n\n anchor = e->pos();\n draw();\n}\n\nvoid GLWidget::wheelEvent(QWheelEvent *e)\n{\n e->delta() > 0 ? scale += scale*0.1f : scale -= scale*0.1f;\n draw();\n}\n\nvoid GLWidget::mouseDoubleClickEvent(QMouseEvent *)\n{\n anim->start();\n}\n\nvoid GLWidget::animate(qreal val)\n{\n rot_y = val * 180;\n draw();\n}\n\nvoid GLWidget::animFinished()\n{\n if (anim->direction() == QTimeLine::Forward)\n anim->setDirection(QTimeLine::Backward);\n else\n anim->setDirection(QTimeLine::Forward);\n}\n\nvoid GLWidget::saveGLState()\n{\n glPushAttrib(GL_ALL_ATTRIB_BITS);\n glMatrixMode(GL_PROJECTION);\n glPushMatrix();\n glMatrixMode(GL_MODELVIEW);\n glPushMatrix();\n}\n\nvoid GLWidget::restoreGLState()\n{\n glMatrixMode(GL_PROJECTION);\n glPopMatrix();\n glMatrixMode(GL_MODELVIEW);\n glPopMatrix();\n glPopAttrib();\n}\n\n#define PI 3.14159\n\nvoid GLWidget::timerEvent(QTimerEvent *)\n{\n if (QApplication::mouseButtons() != 0)\n return;\n\n static bool scale_in = true;\n\n if (scale_in && scale > 35.0f)\n scale_in = false;\n else if (!scale_in && scale < .5f)\n scale_in = true;\n\n scale = scale_in ? scale + scale*0.01f : scale-scale*0.01f;\n rot_z += 0.3f;\n rot_x += 0.1f;\n\n int dx, dy; \/\/ disturbance point\n float s, v, W, t;\n int i, j;\n static float wt[128][128];\n const int width = logo.width();\n const int AMP = 5;\n\n dx = dy = width >> 1;\n\n W = .3f;\n v = -4; \/\/ wave speed\n\n for (i = 0; i < width; ++i) {\n\tfor ( j = 0; j < width; ++j) {\n\t s = sqrt((double) ((j - dx) * (j - dx) + (i - dy) * (i - dy)));\n\t wt[i][j] += 0.1f;\n\t t = s \/ v;\n if (s != 0)\n wave[i*width + j] = AMP * sin(2 * PI * W * (wt[i][j] + t)) \/ (0.2*(s + 2));\n else\n wave[i*width + j] = AMP * sin(2 * PI * W * (wt[i][j] + t));\n\t}\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-2012 Heiko Strathmann\n * Copyright (C) 2011 Berlin Institute of Technology and Max-Planck-Society\n * Written (W) 2012 Victor Sadkov\n * Copyright (C) 2011 Moscow State University\n *\/\n\n#include <shogun\/base\/init.h>\n#include <shogun\/mathematics\/Statistics.h>\n#include <shogun\/mathematics\/Math.h>\n#include <shogun\/lib\/SGVector.h>\n#include <shogun\/lib\/SGMatrix.h>\n\nusing namespace shogun;\n\nvoid test_mean()\n{\n\tSGMatrix<float64_t> X(3,5);\n\n\tfor (index_t i=0; i<X.num_rows*X.num_cols; ++i)\n\t{\n\t\tX.matrix[i]=i;\n\t}\n\tX.display_matrix(\"X\");\n\n\tSGVector<float64_t> mean=CStatistics::matrix_mean(X, true);\n\tmean.display_vector(\"mean\");\n\tASSERT(mean.vlen==5);\n\tASSERT(mean[0]==1);\n\tASSERT(mean[1]==4);\n\tASSERT(mean[2]==7);\n\tASSERT(mean[3]==10);\n\tASSERT(mean[4]==13);\n\n\tfloat64_t mean2=CStatistics::mean(mean);\n\tASSERT(mean2==7);\n\n\tmean=CStatistics::matrix_mean(X, false);\n\tmean.display_vector(\"mean\");\n\tASSERT(mean.vlen==3);\n\tASSERT(mean[0]==6);\n\tASSERT(mean[1]==7);\n\tASSERT(mean[2]==8);\n\n\tmean2=CStatistics::mean(mean);\n\tASSERT(mean2==7);\n}\n\nvoid test_median()\n{\n\tSGMatrix<float64_t> X(3,5);\n\tSGVector<float64_t> Y(X.num_rows*X.num_cols);\n\tfor (index_t i=0; i<X.num_rows*X.num_cols; ++i)\n\t{\n\t\tX.matrix[i]=CMath::random(0, 15);\n\t\tY[i]=X.matrix[i];\n\t}\n\tX.display_matrix(\"X\");\n\tY.display_vector(\"Y\");\n\n\t\/* test all median computation method on vector and matrix *\/\n\tfloat64_t median=CStatistics::median(Y, false, false);\n\tASSERT(median==CStatistics::median(Y, false, true));\n\tASSERT(median==CStatistics::median(Y, true));\n\n\tASSERT(median==CStatistics::matrix_median(X, false, false));\n\tASSERT(median==CStatistics::matrix_median(X, false, true));\n\tASSERT(median==CStatistics::matrix_median(X, true));\n}\n\nvoid test_variance()\n{\n\tSGMatrix<float64_t> X(3,5);\n\n\tfor (index_t i=0; i<X.num_rows*X.num_cols; ++i)\n\t{\n\t\tX.matrix[i]=i;\n\t}\n\tX.display_matrix(\"X\");\n\n\tSGVector<float64_t> var=CStatistics::matrix_variance(X, true);\n\tvar.display_vector(\"variance\");\n\tASSERT(var.vlen==5);\n\tASSERT(var[0]==1);\n\tASSERT(var[1]==1);\n\tASSERT(var[2]==1);\n\tASSERT(var[3]==1);\n\tASSERT(var[4]==1);\n\n\tfloat64_t var2=CStatistics::variance(var);\n\tASSERT(var2==0);\n\n\tvar=CStatistics::matrix_variance(X, false);\n\tvar.display_vector(\"variance\");\n\tASSERT(var.vlen==3);\n\tASSERT(var[0]==22.5);\n\tASSERT(var[1]==22.5);\n\tASSERT(var[2]==22.5);\n\n\tvar2=CStatistics::variance(var);\n\tASSERT(var2==0);\n}\n\nvoid test_confidence_intervals()\n{\n\tint32_t data_size=100;\n\tSGVector<float64_t> data(data_size);\n\tdata.range_fill();\n\n\tfloat64_t low, up, mean;\n\tfloat64_t error_prob=0.1;\n\tmean=CStatistics::confidence_intervals_mean(data, error_prob, low, up);\n\n\tSG_SPRINT(\"sample mean: %f. True mean lies in [%f,%f] with %f%%\\n\",\n\t\t\tmean, low, up, 100*(1-error_prob));\n\n\tSG_SPRINT(\"variance: %f\\n\", CStatistics::variance(data));\n\tSG_SPRINT(\"deviation: %f\\n\", CStatistics::std_deviation(data));\n}\n\nvoid test_inverse_student_t()\n{\n\t\/* some tests for high precision MATLAB comparison *\/\n\tfloat64_t difference=CStatistics::inverse_student_t(1, 0.99);\n\tSG_SPRINT(\"inverse_student_t(0.99, 1)=%f\\n\", difference);\n\tdifference-=31.820515953773953;\n\tdifference=CMath::abs(difference);\n\tASSERT(difference<=10E-14);\n\n\tdifference=CStatistics::inverse_student_t(2, 0.99);\n\tSG_SPRINT(\"inverse_student_t(0.99, 2)=%f\\n\", difference);\n\tdifference-= 6.964556734283233;\n\tdifference=CMath::abs(difference);\n\tASSERT(difference<=10E-14);\n\n\tdifference=CStatistics::inverse_student_t(3, 0.99);\n\tSG_SPRINT(\"inverse_student_t(0.99, 3)=%f\\n\", difference);\n\tdifference-=4.540702858568132;\n\tdifference=CMath::abs(difference);\n\tASSERT(difference<=10E-20);\n\n\tdifference=CStatistics::inverse_student_t(4, 0.99);\n\tSG_SPRINT(\"inverse_student_t(0.99, 4)=%f\\n\", difference);\n\tdifference-=3.746947387979196;\n\tdifference=CMath::abs(difference);\n\tASSERT(difference<=10E-20);\n}\n\nvoid test_incomplete_gamma()\n{\n\t\/* some tests for high precision MATLAB comparison *\/\n\tfloat64_t difference=CStatistics::incomplete_gamma(2, 1);\n\tSG_SPRINT(\"incomplete_gamma(1, 2)=%f\\n\", difference);\n\tdifference-= 0.264241117657115;\n\tdifference=CMath::abs(difference);\n\tASSERT(difference<=10E-16);\n\n\tdifference=CStatistics::incomplete_gamma(3, 2);\n\tSG_SPRINT(\"incomplete_gamma(3, 2)=%f\\n\", difference);\n\tdifference-= 0.323323583816937;\n\tdifference=CMath::abs(difference);\n\tASSERT(difference<=10E-16);\n\n\tdifference=CStatistics::incomplete_gamma(1, 0.1);\n\tSG_SPRINT(\"incomplete_gamma(1, 0.1)=%f\\n\", difference);\n\tdifference-=0.095162581964040;\n\tdifference=CMath::abs(difference);\n\tASSERT(difference<=10E-16);\n}\n\nvoid test_gamma_cdf()\n{\n\t\/* some tests for high precision MATLAB comparison *\/\n\tfloat64_t difference=CStatistics::gamma_cdf(0.95, 1, 2);\n\tSG_SPRINT(\"gamma_cdf(0.95, 1, 2)=%f\\n\", difference);\n\tdifference-=0.378114943534980;\n\tdifference=CMath::abs(difference);\n\tASSERT(difference<=10E-16);\n\n\tdifference=CStatistics::gamma_cdf(0.95, 2, 2);\n\tSG_SPRINT(\"gamma_cdf(0.95, 2, 2)=%f\\n\", difference);\n\tdifference-= 0.082719541714095;\n\tdifference=CMath::abs(difference);\n\tASSERT(difference<=10E-15);\n\n\tdifference=CStatistics::gamma_cdf(1, 1, 1);\n\tSG_SPRINT(\"gamma_cdf(1, 1, 1)=%f\\n\", difference);\n\tdifference-= 0.632120558828558;\n\tdifference=CMath::abs(difference);\n\tASSERT(difference<=10E-15);\n\n\tdifference=CStatistics::gamma_cdf(0.95, 0.9, 1.1);\n\tSG_SPRINT(\"gamma_cdf(0.95, 0.9, 1.1=%f\\n\", difference);\n\tdifference-= 0.624727614394445;\n\tdifference=CMath::abs(difference);\n\tASSERT(difference<=10E-15);\n}\n\nvoid test_normal_cdf()\n{\n\t\/* some tests for high precision MATLAB comparison *\/\n\tfloat64_t difference=CStatistics::normal_cdf(1);\n\tSG_SPRINT(\"normal_cdf(1)=%f\\n\", difference);\n\tdifference-=0.841344746068543;\n\tdifference=CMath::abs(difference);\n\tASSERT(difference<=10E-16);\n\n\tdifference=CStatistics::normal_cdf(2);\n\tSG_SPRINT(\"normal_cdf(2)=%f\\n\", difference);\n\tdifference-=0.977249868051821;\n\tdifference=CMath::abs(difference);\n\tASSERT(difference<=10E-16);\n\n\tdifference=CStatistics::normal_cdf(0.1);\n\tSG_SPRINT(\"normal_cdf(0.1)=%f\\n\", difference);\n\tdifference-=0.539827837277029;\n\tdifference=CMath::abs(difference);\n\tASSERT(difference<=10E-16);\n}\n\nvoid test_inverse_normal_cdf()\n{\n\t\/* some tests for high precision MATLAB comparison *\/\n\tfloat64_t difference=CStatistics::inverse_normal_cdf(0.4, 0, 1);\n\tSG_SPRINT(\"inverse_normal_cdf(0.4, 0, 1)=%f\\n\", difference);\n\tdifference-=-0.253347103135800;\n\tdifference=CMath::abs(difference);\n\tASSERT(difference<=10E-16);\n\n\tdifference=CStatistics::inverse_normal_cdf(0.8, 0.2, 2.2);\n\tSG_SPRINT(\"inverse_normal_cdf(0.8, 0.2, 2.2)=%f\\n\", difference);\n\tdifference-=2.051566713860412;\n\tdifference=CMath::abs(difference);\n\tASSERT(difference<=10E-16);\n\n\tdifference=CStatistics::inverse_normal_cdf(0.1, 0.1, 1.2);\n\tSG_SPRINT(\"inverse_normal_cdf(0.1, 0.1, 1.2)=%f\\n\", difference);\n\tdifference-=-1.437861878653521;\n\tdifference=CMath::abs(difference);\n\tASSERT(difference<=10E-16);\n}\n\nvoid test_error_function()\n{\n\t\/* some tests for high precision MATLAB comparison *\/\n\tfloat64_t difference=CStatistics::error_function(1);\n\tSG_SPRINT(\"error_function(1)=%f\\n\", difference);\n\tdifference-=0.842700792949715;\n\tdifference=CMath::abs(difference);\n\tASSERT(difference<=10E-16);\n\n\tdifference=CStatistics::error_function(2);\n\tSG_SPRINT(\"error_function(2)=%f\\n\", difference);\n\tdifference-=0.995322265018953;\n\tdifference=CMath::abs(difference);\n\tASSERT(difference<=10E-16);\n\n\tdifference=CStatistics::error_function(0.1);\n\tSG_SPRINT(\"error_function(0.1)=%f\\n\", difference);\n\tdifference-=0.112462916018285;\n\tdifference=CMath::abs(difference);\n\tASSERT(difference<=10E-16);\n}\n\nvoid test_error_function_complement()\n{\n\t\/* some tests for high precision MATLAB comparison *\/\n\tfloat64_t difference=CStatistics::error_function_complement(1);\n\tSG_SPRINT(\"error_function_complement(1)=%f\\n\", difference);\n\tdifference-=0.157299207050285;\n\tdifference=CMath::abs(difference);\n\tASSERT(difference<=10E-16);\n\n\tdifference=CStatistics::error_function_complement(2);\n\tSG_SPRINT(\"error_function_complement(2)=%f\\n\", difference);\n\tdifference-=0.004677734981047;\n\tdifference=CMath::abs(difference);\n\tASSERT(difference<=10E-16);\n\n\tdifference=CStatistics::error_function_complement(0.1);\n\tSG_SPRINT(\"error_function_complement(0.1)=%f\\n\", difference);\n\tdifference-=0.887537083981715;\n\tdifference=CMath::abs(difference);\n\tASSERT(difference<=10E-16);\n}\n\nvoid test_inverse_gamma_cdf()\n{\n\t\/* some tests for high precision MATLAB comparison *\/\n\tfloat64_t difference=CStatistics::inverse_gamma_cdf(0.5, 1.0, 1.0);\n\tSG_SPRINT(\"inverse_gamma_cdf(0.5, 1.0, 1.0)=%f\\n\", difference);\n\tdifference-=0.693147180559945;\n\tdifference=CMath::abs(difference);\n\tASSERT(difference<=10E-16);\n\n\tdifference=CStatistics::inverse_gamma_cdf(0.5, 0.5, 0.3);\n\tSG_SPRINT(\"inverse_gamma_cdf(0.5, 0.5, 0.3)=%f\\n\", difference);\n\tdifference-= 0.068240463467936;\n\tdifference=CMath::abs(difference);\n\tASSERT(difference<=10E-16);\n\n\tdifference=CStatistics::inverse_gamma_cdf(0.8, 0.1, 0.3);\n\tSG_SPRINT(\"inverse_gamma_cdf(0.8, 0.1, 0.3)=%f\\n\", difference);\n\tdifference-=0.020816964971992;\n\tdifference=CMath::abs(difference);\n\tASSERT(difference<=10E-16);\n}\n\n#ifdef HAVE_LAPACK\nvoid test_covariance_matrix()\n{\n\tSGMatrix<float64_t> X(2,3);\n\tfor (index_t i=0; i<X.num_cols*X.num_rows; ++i)\n\t\tX.matrix[i]=i;\n\n\tX.display_matrix(\"X\");\n\tSGMatrix<float64_t> cov=CStatistics::covariance_matrix(X);\n\tcov.display_matrix(\"cov\");\n\n\t\/* all entries of this covariance matrix will be 0.5 *\/\n\tfor (index_t i=0; i<cov.num_rows*cov.num_cols; ++i)\n\t\tASSERT(cov.matrix[i]==0.5);\n\n}\n#endif \/\/HAVE_LAPACK\n\nint main(int argc, char **argv)\n{\n\tinit_shogun_with_defaults();\n\n\ttest_mean();\n\ttest_median();\n\ttest_variance();\n\ttest_confidence_intervals();\n\ttest_inverse_student_t();\n\ttest_incomplete_gamma();\n\ttest_gamma_cdf();\n\ttest_inverse_gamma_cdf();\n\ttest_normal_cdf();\n\ttest_inverse_normal_cdf();\n\ttest_error_function();\n\ttest_error_function_complement();\n\n#ifdef HAVE_LAPACK\n\ttest_covariance_matrix();\n#endif \/\/HAVE_LAPACK\n\n\texit_shogun();\n\n\treturn 0;\n}\n\n<commit_msg>remove example that is in fact a unit test.<commit_after><|endoftext|>"} {"text":"<commit_before>\/*\n * The Apache Software License, Version 1.1\n *\n * Copyright (c) 1999-2001 The Apache Software Foundation. All rights\n * reserved.\n *\n * Redistribution and use in source and binary forms, with or without\n * modification, are permitted provided that the following conditions\n * are met:\n *\n * 1. Redistributions of source code must retain the above copyright\n * notice, this list of conditions and the following disclaimer.\n *\n * 2. Redistributions in binary form must reproduce the above copyright\n * notice, this list of conditions and the following disclaimer in\n * the documentation and\/or other materials provided with the\n * distribution.\n *\n * 3. The end-user documentation included with the redistribution,\n * if any, must include the following acknowledgment:\n * \"This product includes software developed by the\n * Apache Software Foundation (http:\/\/www.apache.org\/).\"\n * Alternately, this acknowledgment may appear in the software itself,\n * if and wherever such third-party acknowledgments normally appear.\n *\n * 4. The names \"Xerces\" and \"Apache Software Foundation\" must\n * not be used to endorse or promote products derived from this\n * software without prior written permission. For written\n * permission, please contact apache\\@apache.org.\n *\n * 5. Products derived from this software may not be called \"Apache\",\n * nor may \"Apache\" appear in their name, without prior written\n * permission of the Apache Software Foundation.\n *\n * THIS SOFTWARE IS PROVIDED ``AS IS'' AND ANY EXPRESSED OR IMPLIED\n * WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES\n * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE\n * DISCLAIMED. IN NO EVENT SHALL THE APACHE SOFTWARE FOUNDATION OR\n * ITS CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,\n * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT\n * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF\n * USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND\n * ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,\n * OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT\n * OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF\n * SUCH DAMAGE.\n * ====================================================================\n *\n * This software consists of voluntary contributions made by many\n * individuals on behalf of the Apache Software Foundation, and was\n * originally based on software copyright (c) 1999, International\n * Business Machines, Inc., http:\/\/www.ibm.com . For more information\n * on the Apache Software Foundation, please see\n * <http:\/\/www.apache.org\/>.\n *\/\n\n\/**\n * $Id$\n *\/\n\n\n\/\/ ---------------------------------------------------------------------------\n\/\/ Includes\n\/\/ ---------------------------------------------------------------------------\n#include <xercesc\/util\/RuntimeException.hpp>\n#include <xercesc\/util\/XMLString.hpp>\n#include <xercesc\/util\/XMLUni.hpp>\n#include <xercesc\/framework\/XMLRecognizer.hpp>\n#include <string.h>\n\nXERCES_CPP_NAMESPACE_BEGIN\n\n\/\/ ---------------------------------------------------------------------------\n\/\/ Local data\n\/\/\n\/\/ gEncodingNameMap\n\/\/ This array maps the Encodings enum values to their canonical names.\n\/\/ Be sure to keep this in sync with that enum!\n\/\/ ---------------------------------------------------------------------------\nstatic const XMLCh* gEncodingNameMap[XMLRecognizer::Encodings_Count] =\n{\n XMLUni::fgEBCDICEncodingString\n , XMLUni::fgUCS4BEncodingString\n , XMLUni::fgUCS4LEncodingString\n , XMLUni::fgUSASCIIEncodingString\n , XMLUni::fgUTF8EncodingString\n , XMLUni::fgUTF16BEncodingString\n , XMLUni::fgUTF16LEncodingString\n , XMLUni::fgXMLChEncodingString\n};\n\n\n\n\/\/ ---------------------------------------------------------------------------\n\/\/ XMLRecognizer: Public, const static data\n\/\/\n\/\/ gXXXPre\n\/\/ gXXXPreLen\n\/\/ The byte sequence prefixes for all of the encodings that we can\n\/\/ auto sense. Also included is the length of each sequence.\n\/\/ ---------------------------------------------------------------------------\nconst char XMLRecognizer::fgASCIIPre[] = { 0x3C, 0x3F, 0x78, 0x6D, 0x6C, 0x20 };\nconst unsigned int XMLRecognizer::fgASCIIPreLen = 6;\nconst XMLByte XMLRecognizer::fgEBCDICPre[] = { 0x4C, 0x6F, 0xA7, 0x94, 0x93, 0x40 };\nconst unsigned int XMLRecognizer::fgEBCDICPreLen = 6;\nconst XMLByte XMLRecognizer::fgUTF16BPre[] = { 0x00, 0x3C, 0x00, 0x3F, 0x00, 0x78, 0x00, 0x6D, 0x00, 0x6C, 0x00, 0x20 };\nconst XMLByte XMLRecognizer::fgUTF16LPre[] = { 0x3C, 0x00, 0x3F, 0x00, 0x78, 0x00, 0x6D, 0x00, 0x6C, 0x00, 0x20, 0x00 };\nconst unsigned int XMLRecognizer::fgUTF16PreLen = 12;\nconst XMLByte XMLRecognizer::fgUCS4BPre[] =\n{\n 0x00, 0x00, 0x00, 0x3C, 0x00, 0x00, 0x00, 0x3F\n , 0x00, 0x00, 0x00, 0x78, 0x00, 0x00, 0x00, 0x6D\n , 0x00, 0x00, 0x00, 0x6C, 0x00, 0x00, 0x00, 0x20\n};\nconst XMLByte XMLRecognizer::fgUCS4LPre[] =\n{\n 0x3C, 0x00, 0x00, 0x00, 0x3F, 0x00, 0x00, 0x00\n , 0x78, 0x00, 0x00, 0x00, 0x6D, 0x00, 0x00, 0x00\n , 0x6C, 0x00, 0x00, 0x00, 0x20, 0x00, 0x00, 0x00\n};\nconst unsigned int XMLRecognizer::fgUCS4PreLen = 24;\n\nconst char XMLRecognizer::fgUTF8BOM[] = {(char)0xEF, (char)0xBB, (char)0xBF};\nconst unsigned int XMLRecognizer::fgUTF8BOMLen = 3;\n\n\/\/ ---------------------------------------------------------------------------\n\/\/ XMLRecognizer: Encoding recognition methods\n\/\/ ---------------------------------------------------------------------------\nXMLRecognizer::Encodings\nXMLRecognizer::basicEncodingProbe( const XMLByte* const rawBuffer\n , const unsigned int rawByteCount)\n{\n \/\/\n \/\/ As an optimization to check the 90% case, check first for the ASCII\n \/\/ sequence '<?xml', which means its either US-ASCII, UTF-8, or some\n \/\/ other encoding that we don't do manually but which happens to share\n \/\/ the US-ASCII code points for these characters. So just return UTF-8\n \/\/ to get us through the first line.\n \/\/\n if (rawByteCount >= fgASCIIPreLen)\n {\n if (!memcmp(rawBuffer, fgASCIIPre, fgASCIIPreLen))\n return UTF_8;\n }\n\n \/\/\n \/\/ If the count of raw bytes is less than 2, it cannot be anything\n \/\/ we understand, so return UTF-8 as a fallback.\n \/\/\n if (rawByteCount < 2)\n return UTF_8;\n\n \/\/\n \/\/ Checking BOM for UCS-4BE, UCS-4LE, UTF-16BE and UTF-16LE\n \/\/\n if ((rawBuffer[0] == 0x00) && (rawBuffer[1] == 0x00) && (rawBuffer[2] == 0xFE) && (rawBuffer[3] == 0xFF))\n return UCS_4B;\n else if ((rawBuffer[0] == 0xFF) && (rawBuffer[1] == 0xFE) && (rawBuffer[2] == 0x00) && (rawBuffer[3] == 0x00))\n return UCS_4L;\n else if ((rawBuffer[0] == 0xFE) && (rawBuffer[1] == 0xFF) && (rawBuffer[2] == 0x00) && (rawBuffer[3] != 0x00))\n return UTF_16B;\n else if ((rawBuffer[0] == 0xFF) && (rawBuffer[1] == 0xFE) && (rawBuffer[2] != 0x00) && (rawBuffer[3] == 0x00))\n return UTF_16L;\n\n \/\/\n \/\/ Oh well, not one of those. So now lets see if we have at least 4\n \/\/ bytes. If not, then we are out of ideas and can return UTF-8 as the\n \/\/ fallback.\n \/\/\n if (rawByteCount < 4)\n return UTF_8;\n\n \/\/\n \/\/ We have at least 4 bytes. So lets check the 4 byte sequences that\n \/\/ indicate other UTF-16 and UCS encodings.\n \/\/\n if ((rawBuffer[0] == 0x00) || (rawBuffer[0] == 0x3C))\n {\n if (rawByteCount >= fgUCS4PreLen && !memcmp(rawBuffer, fgUCS4BPre, fgUCS4PreLen))\n return UCS_4B;\n else if (rawByteCount >= fgUCS4PreLen && !memcmp(rawBuffer, fgUCS4LPre, fgUCS4PreLen))\n return UCS_4L;\n else if (rawByteCount >= fgUTF16PreLen && !memcmp(rawBuffer, fgUTF16BPre, fgUTF16PreLen))\n return UTF_16B;\n else if (rawByteCount >= fgUTF16PreLen && !memcmp(rawBuffer, fgUTF16LPre, fgUTF16PreLen))\n return UTF_16L;\n }\n\n \/\/\n \/\/ See if we have enough bytes to possibly match the EBCDIC prefix.\n \/\/ If so, try it.\n \/\/\n if (rawByteCount > fgEBCDICPreLen)\n {\n if (!memcmp(rawBuffer, fgEBCDICPre, fgEBCDICPreLen))\n return EBCDIC;\n }\n\n \/\/\n \/\/ Does not seem to be anything we know, so go with UTF-8 to get at\n \/\/ least through the first line and see what it really is.\n \/\/\n return UTF_8;\n}\n\n\nXMLRecognizer::Encodings\nXMLRecognizer::encodingForName(const XMLCh* const encName)\n{\n \/\/\n \/\/ Compare the passed string, assume input string is already uppercased,\n \/\/ to the variations that we recognize.\n \/\/\n \/\/ !!NOTE: Note that we don't handle EBCDIC here because we don't handle\n \/\/ that one ourselves. It is allowed to fall into 'other'.\n \/\/\n if (encName == XMLUni::fgXMLChEncodingString ||\n !XMLString::compareString(encName, XMLUni::fgXMLChEncodingString))\n {\n return XMLRecognizer::XERCES_XMLCH;\n }\n else if (!XMLString::compareString(encName, XMLUni::fgUTF8EncodingString)\n || !XMLString::compareString(encName, XMLUni::fgUTF8EncodingString2))\n {\n return XMLRecognizer::UTF_8;\n }\n else if (!XMLString::compareString(encName, XMLUni::fgUSASCIIEncodingString)\n || !XMLString::compareString(encName, XMLUni::fgUSASCIIEncodingString2)\n || !XMLString::compareString(encName, XMLUni::fgUSASCIIEncodingString3)\n || !XMLString::compareString(encName, XMLUni::fgUSASCIIEncodingString4))\n {\n return XMLRecognizer::US_ASCII;\n }\n else if (!XMLString::compareString(encName, XMLUni::fgUTF16LEncodingString)\n || !XMLString::compareString(encName, XMLUni::fgUTF16LEncodingString2))\n {\n return XMLRecognizer::UTF_16L;\n }\n else if (!XMLString::compareString(encName, XMLUni::fgUTF16BEncodingString)\n || !XMLString::compareString(encName, XMLUni::fgUTF16BEncodingString2))\n {\n return XMLRecognizer::UTF_16B;\n }\n else if (!XMLString::compareString(encName, XMLUni::fgUCS4LEncodingString)\n || !XMLString::compareString(encName, XMLUni::fgUCS4LEncodingString2))\n {\n return XMLRecognizer::UCS_4L;\n }\n else if (!XMLString::compareString(encName, XMLUni::fgUCS4BEncodingString)\n || !XMLString::compareString(encName, XMLUni::fgUCS4BEncodingString2))\n {\n return XMLRecognizer::UCS_4B;\n }\n\n \/\/ Return 'other' since we don't recognizer it\n return XMLRecognizer::OtherEncoding;\n}\n\n\nconst XMLCh*\nXMLRecognizer::nameForEncoding(const XMLRecognizer::Encodings theEncoding)\n{\n if (theEncoding > Encodings_Count)\n ThrowXML(RuntimeException, XMLExcepts::XMLRec_UnknownEncoding);\n\n return gEncodingNameMap[theEncoding];\n}\n\nXERCES_CPP_NAMESPACE_END\n<commit_msg>Allow double UTF-16 BOM.<commit_after>\/*\n * The Apache Software License, Version 1.1\n *\n * Copyright (c) 1999-2001 The Apache Software Foundation. All rights\n * reserved.\n *\n * Redistribution and use in source and binary forms, with or without\n * modification, are permitted provided that the following conditions\n * are met:\n *\n * 1. Redistributions of source code must retain the above copyright\n * notice, this list of conditions and the following disclaimer.\n *\n * 2. Redistributions in binary form must reproduce the above copyright\n * notice, this list of conditions and the following disclaimer in\n * the documentation and\/or other materials provided with the\n * distribution.\n *\n * 3. The end-user documentation included with the redistribution,\n * if any, must include the following acknowledgment:\n * \"This product includes software developed by the\n * Apache Software Foundation (http:\/\/www.apache.org\/).\"\n * Alternately, this acknowledgment may appear in the software itself,\n * if and wherever such third-party acknowledgments normally appear.\n *\n * 4. The names \"Xerces\" and \"Apache Software Foundation\" must\n * not be used to endorse or promote products derived from this\n * software without prior written permission. For written\n * permission, please contact apache\\@apache.org.\n *\n * 5. Products derived from this software may not be called \"Apache\",\n * nor may \"Apache\" appear in their name, without prior written\n * permission of the Apache Software Foundation.\n *\n * THIS SOFTWARE IS PROVIDED ``AS IS'' AND ANY EXPRESSED OR IMPLIED\n * WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES\n * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE\n * DISCLAIMED. IN NO EVENT SHALL THE APACHE SOFTWARE FOUNDATION OR\n * ITS CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,\n * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT\n * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF\n * USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND\n * ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,\n * OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT\n * OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF\n * SUCH DAMAGE.\n * ====================================================================\n *\n * This software consists of voluntary contributions made by many\n * individuals on behalf of the Apache Software Foundation, and was\n * originally based on software copyright (c) 1999, International\n * Business Machines, Inc., http:\/\/www.ibm.com . For more information\n * on the Apache Software Foundation, please see\n * <http:\/\/www.apache.org\/>.\n *\/\n\n\/**\n * $Id$\n *\/\n\n\n\/\/ ---------------------------------------------------------------------------\n\/\/ Includes\n\/\/ ---------------------------------------------------------------------------\n#include <xercesc\/util\/RuntimeException.hpp>\n#include <xercesc\/util\/XMLString.hpp>\n#include <xercesc\/util\/XMLUni.hpp>\n#include <xercesc\/framework\/XMLRecognizer.hpp>\n#include <string.h>\n\nXERCES_CPP_NAMESPACE_BEGIN\n\n\/\/ ---------------------------------------------------------------------------\n\/\/ Local data\n\/\/\n\/\/ gEncodingNameMap\n\/\/ This array maps the Encodings enum values to their canonical names.\n\/\/ Be sure to keep this in sync with that enum!\n\/\/ ---------------------------------------------------------------------------\nstatic const XMLCh* gEncodingNameMap[XMLRecognizer::Encodings_Count] =\n{\n XMLUni::fgEBCDICEncodingString\n , XMLUni::fgUCS4BEncodingString\n , XMLUni::fgUCS4LEncodingString\n , XMLUni::fgUSASCIIEncodingString\n , XMLUni::fgUTF8EncodingString\n , XMLUni::fgUTF16BEncodingString\n , XMLUni::fgUTF16LEncodingString\n , XMLUni::fgXMLChEncodingString\n};\n\n\n\n\/\/ ---------------------------------------------------------------------------\n\/\/ XMLRecognizer: Public, const static data\n\/\/\n\/\/ gXXXPre\n\/\/ gXXXPreLen\n\/\/ The byte sequence prefixes for all of the encodings that we can\n\/\/ auto sense. Also included is the length of each sequence.\n\/\/ ---------------------------------------------------------------------------\nconst char XMLRecognizer::fgASCIIPre[] = { 0x3C, 0x3F, 0x78, 0x6D, 0x6C, 0x20 };\nconst unsigned int XMLRecognizer::fgASCIIPreLen = 6;\nconst XMLByte XMLRecognizer::fgEBCDICPre[] = { 0x4C, 0x6F, 0xA7, 0x94, 0x93, 0x40 };\nconst unsigned int XMLRecognizer::fgEBCDICPreLen = 6;\nconst XMLByte XMLRecognizer::fgUTF16BPre[] = { 0x00, 0x3C, 0x00, 0x3F, 0x00, 0x78, 0x00, 0x6D, 0x00, 0x6C, 0x00, 0x20 };\nconst XMLByte XMLRecognizer::fgUTF16LPre[] = { 0x3C, 0x00, 0x3F, 0x00, 0x78, 0x00, 0x6D, 0x00, 0x6C, 0x00, 0x20, 0x00 };\nconst unsigned int XMLRecognizer::fgUTF16PreLen = 12;\nconst XMLByte XMLRecognizer::fgUCS4BPre[] =\n{\n 0x00, 0x00, 0x00, 0x3C, 0x00, 0x00, 0x00, 0x3F\n , 0x00, 0x00, 0x00, 0x78, 0x00, 0x00, 0x00, 0x6D\n , 0x00, 0x00, 0x00, 0x6C, 0x00, 0x00, 0x00, 0x20\n};\nconst XMLByte XMLRecognizer::fgUCS4LPre[] =\n{\n 0x3C, 0x00, 0x00, 0x00, 0x3F, 0x00, 0x00, 0x00\n , 0x78, 0x00, 0x00, 0x00, 0x6D, 0x00, 0x00, 0x00\n , 0x6C, 0x00, 0x00, 0x00, 0x20, 0x00, 0x00, 0x00\n};\nconst unsigned int XMLRecognizer::fgUCS4PreLen = 24;\n\nconst char XMLRecognizer::fgUTF8BOM[] = {(char)0xEF, (char)0xBB, (char)0xBF};\nconst unsigned int XMLRecognizer::fgUTF8BOMLen = 3;\n\n\/\/ ---------------------------------------------------------------------------\n\/\/ XMLRecognizer: Encoding recognition methods\n\/\/ ---------------------------------------------------------------------------\nXMLRecognizer::Encodings\nXMLRecognizer::basicEncodingProbe( const XMLByte* const rawBuffer\n , const unsigned int rawByteCount)\n{\n \/\/\n \/\/ As an optimization to check the 90% case, check first for the ASCII\n \/\/ sequence '<?xml', which means its either US-ASCII, UTF-8, or some\n \/\/ other encoding that we don't do manually but which happens to share\n \/\/ the US-ASCII code points for these characters. So just return UTF-8\n \/\/ to get us through the first line.\n \/\/\n if (rawByteCount >= fgASCIIPreLen)\n {\n if (!memcmp(rawBuffer, fgASCIIPre, fgASCIIPreLen))\n return UTF_8;\n }\n\n \/\/\n \/\/ If the count of raw bytes is less than 2, it cannot be anything\n \/\/ we understand, so return UTF-8 as a fallback.\n \/\/\n if (rawByteCount < 2)\n return UTF_8;\n\n \/\/\n \/\/ Checking BOM for UCS-4BE, UCS-4LE, UTF-16BE and UTF-16LE\n \/\/\n if ((rawBuffer[0] == 0x00) && (rawBuffer[1] == 0x00) && (rawBuffer[2] == 0xFE) && (rawBuffer[3] == 0xFF))\n return UCS_4B;\n else if ((rawBuffer[0] == 0xFF) && (rawBuffer[1] == 0xFE) && (rawBuffer[2] == 0x00) && (rawBuffer[3] == 0x00))\n return UCS_4L;\n else if ((rawBuffer[0] == 0xFE) && (rawBuffer[1] == 0xFF))\n return UTF_16B;\n else if ((rawBuffer[0] == 0xFF) && (rawBuffer[1] == 0xFE))\n return UTF_16L;\n\n \/\/\n \/\/ Oh well, not one of those. So now lets see if we have at least 4\n \/\/ bytes. If not, then we are out of ideas and can return UTF-8 as the\n \/\/ fallback.\n \/\/\n if (rawByteCount < 4)\n return UTF_8;\n\n \/\/\n \/\/ We have at least 4 bytes. So lets check the 4 byte sequences that\n \/\/ indicate other UTF-16 and UCS encodings.\n \/\/\n if ((rawBuffer[0] == 0x00) || (rawBuffer[0] == 0x3C))\n {\n if (rawByteCount >= fgUCS4PreLen && !memcmp(rawBuffer, fgUCS4BPre, fgUCS4PreLen))\n return UCS_4B;\n else if (rawByteCount >= fgUCS4PreLen && !memcmp(rawBuffer, fgUCS4LPre, fgUCS4PreLen))\n return UCS_4L;\n else if (rawByteCount >= fgUTF16PreLen && !memcmp(rawBuffer, fgUTF16BPre, fgUTF16PreLen))\n return UTF_16B;\n else if (rawByteCount >= fgUTF16PreLen && !memcmp(rawBuffer, fgUTF16LPre, fgUTF16PreLen))\n return UTF_16L;\n }\n\n \/\/\n \/\/ See if we have enough bytes to possibly match the EBCDIC prefix.\n \/\/ If so, try it.\n \/\/\n if (rawByteCount > fgEBCDICPreLen)\n {\n if (!memcmp(rawBuffer, fgEBCDICPre, fgEBCDICPreLen))\n return EBCDIC;\n }\n\n \/\/\n \/\/ Does not seem to be anything we know, so go with UTF-8 to get at\n \/\/ least through the first line and see what it really is.\n \/\/\n return UTF_8;\n}\n\n\nXMLRecognizer::Encodings\nXMLRecognizer::encodingForName(const XMLCh* const encName)\n{\n \/\/\n \/\/ Compare the passed string, assume input string is already uppercased,\n \/\/ to the variations that we recognize.\n \/\/\n \/\/ !!NOTE: Note that we don't handle EBCDIC here because we don't handle\n \/\/ that one ourselves. It is allowed to fall into 'other'.\n \/\/\n if (encName == XMLUni::fgXMLChEncodingString ||\n !XMLString::compareString(encName, XMLUni::fgXMLChEncodingString))\n {\n return XMLRecognizer::XERCES_XMLCH;\n }\n else if (!XMLString::compareString(encName, XMLUni::fgUTF8EncodingString)\n || !XMLString::compareString(encName, XMLUni::fgUTF8EncodingString2))\n {\n return XMLRecognizer::UTF_8;\n }\n else if (!XMLString::compareString(encName, XMLUni::fgUSASCIIEncodingString)\n || !XMLString::compareString(encName, XMLUni::fgUSASCIIEncodingString2)\n || !XMLString::compareString(encName, XMLUni::fgUSASCIIEncodingString3)\n || !XMLString::compareString(encName, XMLUni::fgUSASCIIEncodingString4))\n {\n return XMLRecognizer::US_ASCII;\n }\n else if (!XMLString::compareString(encName, XMLUni::fgUTF16LEncodingString)\n || !XMLString::compareString(encName, XMLUni::fgUTF16LEncodingString2))\n {\n return XMLRecognizer::UTF_16L;\n }\n else if (!XMLString::compareString(encName, XMLUni::fgUTF16BEncodingString)\n || !XMLString::compareString(encName, XMLUni::fgUTF16BEncodingString2))\n {\n return XMLRecognizer::UTF_16B;\n }\n else if (!XMLString::compareString(encName, XMLUni::fgUCS4LEncodingString)\n || !XMLString::compareString(encName, XMLUni::fgUCS4LEncodingString2))\n {\n return XMLRecognizer::UCS_4L;\n }\n else if (!XMLString::compareString(encName, XMLUni::fgUCS4BEncodingString)\n || !XMLString::compareString(encName, XMLUni::fgUCS4BEncodingString2))\n {\n return XMLRecognizer::UCS_4B;\n }\n\n \/\/ Return 'other' since we don't recognizer it\n return XMLRecognizer::OtherEncoding;\n}\n\n\nconst XMLCh*\nXMLRecognizer::nameForEncoding(const XMLRecognizer::Encodings theEncoding)\n{\n if (theEncoding > Encodings_Count)\n ThrowXML(RuntimeException, XMLExcepts::XMLRec_UnknownEncoding);\n\n return gEncodingNameMap[theEncoding];\n}\n\nXERCES_CPP_NAMESPACE_END\n<|endoftext|>"} {"text":"<commit_before>\/*************************************************************************\n *\n * OpenOffice.org - a multi-platform office productivity suite\n *\n * $RCSfile: lrucache.hxx,v $\n *\n * $Revision: 1.6 $\n *\n * last change: $Author: hr $ $Date: 2006-06-20 00:01: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 _LRU_CACHE_HXX_\n#define _LRU_CACHE_HXX_\n\n\/\/ __CACHE_DIAGNOSE forces cache size to 4 and works only for OUString keys\n\/\/ #define __CACHE_DIAGNOSE 1\n\n#ifndef _OSL_MUTEX_HXX_\n#include <osl\/mutex.hxx>\n#endif\n#ifndef _RTL_USTRING_\n#include \"rtl\/ustring.hxx\"\n#endif\n\n#include <hash_map>\n\n\/** Implementation of a least recently used (lru) cache.\n <br>\n @author Daniel Boelzle\n*\/\ntemplate< class t_Key, class t_Val, class t_KeyHash, class t_KeyEqual >\nclass LRU_Cache\n{\n struct CacheEntry\n {\n t_Key aKey;\n t_Val aVal;\n CacheEntry * pPred;\n CacheEntry * pSucc;\n };\n typedef ::std::hash_map< t_Key, CacheEntry *, t_KeyHash, t_KeyEqual > t_Key2Element;\n\n mutable ::osl::Mutex _aCacheMutex;\n sal_Int32 _nCachedElements;\n t_Key2Element _aKey2Element;\n\n CacheEntry * _pBlock;\n mutable CacheEntry * _pHead;\n mutable CacheEntry * _pTail;\n inline void toFront( CacheEntry * pEntry ) const;\n\npublic:\n \/** Constructor:\n <br>\n @param nCachedElements number of elements to be cached; default param set to 128\n *\/\n inline LRU_Cache( sal_Int32 nCachedElements = 128 );\n \/** Destructor: releases all cached elements and keys.\n <br>\n *\/\n inline ~LRU_Cache();\n\n \/** Retrieves a value from the cache. Returns default constructed value,\n if none was found.\n <br>\n @param rKey a key\n @return value\n *\/\n inline t_Val getValue( const t_Key & rKey ) const;\n \/** Sets a value to be cached for given key.\n <br>\n @param rKey a key\n @param rValue a value\n *\/\n inline void setValue( const t_Key & rKey, const t_Val & rValue );\n \/** Tests whether a value is cached for given key.\n <br>\n @param rKey a key\n @return true, if value is cached\n *\/\n inline sal_Bool hasValue( const t_Key & rKey ) const;\n \/** Clears the cache, thus releasing all cached elements and keys.\n <br>\n *\/\n inline void clear();\n};\n\/\/__________________________________________________________________________________________________\ntemplate< class t_Key, class t_Val, class t_KeyHash, class t_KeyEqual >\ninline LRU_Cache< t_Key, t_Val, t_KeyHash, t_KeyEqual >::LRU_Cache( sal_Int32 nCachedElements )\n#ifdef __CACHE_DIAGNOSE\n : _nCachedElements( 4 )\n#else\n : _nCachedElements( nCachedElements )\n#endif\n , _pBlock( 0 )\n{\n if (_nCachedElements > 0)\n {\n _pBlock = new CacheEntry[_nCachedElements];\n _pHead = _pBlock;\n _pTail = _pBlock + _nCachedElements -1;\n for ( sal_Int32 nPos = _nCachedElements; nPos--; )\n {\n _pBlock[nPos].pPred = _pBlock + nPos -1;\n _pBlock[nPos].pSucc = _pBlock + nPos +1;\n }\n }\n}\n\/\/__________________________________________________________________________________________________\ntemplate< class t_Key, class t_Val, class t_KeyHash, class t_KeyEqual >\ninline LRU_Cache< t_Key, t_Val, t_KeyHash, t_KeyEqual >::~LRU_Cache()\n{\n delete [] _pBlock;\n}\n\/\/__________________________________________________________________________________________________\ntemplate< class t_Key, class t_Val, class t_KeyHash, class t_KeyEqual >\ninline void LRU_Cache< t_Key, t_Val, t_KeyHash, t_KeyEqual >::toFront( CacheEntry * pEntry ) const\n{\n if (pEntry != _pHead)\n {\n \/\/ cut out element\n if (pEntry == _pTail)\n {\n _pTail = pEntry->pPred;\n }\n else\n {\n pEntry->pSucc->pPred = pEntry->pPred;\n pEntry->pPred->pSucc = pEntry->pSucc;\n }\n \/\/ push to front\n _pHead->pPred = pEntry;\n pEntry->pSucc = _pHead;\n _pHead = pEntry;\n }\n}\n\/\/__________________________________________________________________________________________________\ntemplate< class t_Key, class t_Val, class t_KeyHash, class t_KeyEqual >\ninline sal_Bool LRU_Cache< t_Key, t_Val, t_KeyHash, t_KeyEqual >::hasValue( const t_Key & rKey ) const\n{\n ::osl::MutexGuard aGuard( _aCacheMutex );\n const typename t_Key2Element::const_iterator iFind( _aKey2Element.find( rKey ) );\n return (iFind != _aKey2Element.end());\n}\n\/\/__________________________________________________________________________________________________\ntemplate< class t_Key, class t_Val, class t_KeyHash, class t_KeyEqual >\ninline t_Val LRU_Cache< t_Key, t_Val, t_KeyHash, t_KeyEqual >::getValue( const t_Key & rKey ) const\n{\n ::osl::MutexGuard aGuard( _aCacheMutex );\n const typename t_Key2Element::const_iterator iFind( _aKey2Element.find( rKey ) );\n if (iFind != _aKey2Element.end())\n {\n CacheEntry * pEntry = (*iFind).second;\n toFront( pEntry );\n#ifdef __CACHE_DIAGNOSE\n OSL_TRACE( \"> retrieved element \\\"\" );\n OSL_TRACE( ::rtl::OUStringToOString( pEntry->aKey, RTL_TEXTENCODING_ASCII_US ).getStr() );\n OSL_TRACE( \"\\\" from cache <\\n\" );\n#endif\n return pEntry->aVal;\n }\n return t_Val();\n}\n\/\/__________________________________________________________________________________________________\ntemplate< class t_Key, class t_Val, class t_KeyHash, class t_KeyEqual >\ninline void LRU_Cache< t_Key, t_Val, t_KeyHash, t_KeyEqual >::setValue(\n const t_Key & rKey, const t_Val & rValue )\n{\n if (_nCachedElements > 0)\n {\n ::osl::MutexGuard aGuard( _aCacheMutex );\n const typename t_Key2Element::const_iterator iFind( _aKey2Element.find( rKey ) );\n\n CacheEntry * pEntry;\n if (iFind == _aKey2Element.end())\n {\n pEntry = _pTail; \/\/ erase last element\n#ifdef __CACHE_DIAGNOSE\n if (pEntry->aKey.getLength())\n {\n OSL_TRACE( \"> kicking element \\\"\" );\n OSL_TRACE( ::rtl::OUStringToOString( pEntry->aKey, RTL_TEXTENCODING_ASCII_US ).getStr() );\n OSL_TRACE( \"\\\" from cache <\\n\" );\n }\n#endif\n _aKey2Element.erase( pEntry->aKey );\n _aKey2Element[ pEntry->aKey = rKey ] = pEntry;\n }\n else\n {\n pEntry = (*iFind).second;\n#ifdef __CACHE_DIAGNOSE\n OSL_TRACE( \"> replacing element \\\"\" );\n OSL_TRACE( ::rtl::OUStringToOString( pEntry->aKey, RTL_TEXTENCODING_ASCII_US ).getStr() );\n OSL_TRACE( \"\\\" in cache <\\n\" );\n#endif\n }\n pEntry->aVal = rValue;\n toFront( pEntry );\n }\n}\n\/\/__________________________________________________________________________________________________\ntemplate< class t_Key, class t_Val, class t_KeyHash, class t_KeyEqual >\ninline void LRU_Cache< t_Key, t_Val, t_KeyHash, t_KeyEqual >::clear()\n{\n ::osl::MutexGuard aGuard( _aCacheMutex );\n _aKey2Element.clear();\n for ( sal_Int32 nPos = _nCachedElements; nPos--; )\n {\n _pBlock[nPos].aKey = t_Key();\n _pBlock[nPos].aVal = t_Val();\n }\n#ifdef __CACHE_DIAGNOSE\n OSL_TRACE( \"> cleared cache <\\n\" );\n#endif\n}\n\n\/\/==================================================================================================\nstruct FctHashOUString : public ::std::unary_function< const ::rtl::OUString &, size_t >\n{\n size_t operator()( const ::rtl::OUString & rKey ) const\n { return rKey.hashCode(); }\n};\n\n\/** Template instance for OUString keys, Any values.<br>\n*\/\ntypedef LRU_Cache< ::rtl::OUString, ::com::sun::star::uno::Any,\n FctHashOUString, ::std::equal_to< ::rtl::OUString > >\n LRU_CacheAnyByOUString;\n\n\n#endif\n<commit_msg>INTEGRATION: CWS changefileheader (1.6.66); FILE MERGED 2008\/04\/01 15:42:24 thb 1.6.66.2: #i85898# Stripping all external header guards 2008\/03\/31 07:26:08 rt 1.6.66.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: lrucache.hxx,v $\n * $Revision: 1.7 $\n *\n * This file is part of OpenOffice.org.\n *\n * OpenOffice.org is free software: you can redistribute it and\/or modify\n * it under the terms of the GNU Lesser General Public License version 3\n * only, as published by the Free Software Foundation.\n *\n * OpenOffice.org is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the\n * GNU Lesser General Public License version 3 for more details\n * (a copy is included in the LICENSE file that accompanied this code).\n *\n * You should have received a copy of the GNU Lesser General Public License\n * version 3 along with OpenOffice.org. If not, see\n * <http:\/\/www.openoffice.org\/license.html>\n * for a copy of the LGPLv3 License.\n *\n ************************************************************************\/\n#ifndef _LRU_CACHE_HXX_\n#define _LRU_CACHE_HXX_\n\n\/\/ __CACHE_DIAGNOSE forces cache size to 4 and works only for OUString keys\n\/\/ #define __CACHE_DIAGNOSE 1\n\n#include <osl\/mutex.hxx>\n#include \"rtl\/ustring.hxx\"\n\n#include <hash_map>\n\n\/** Implementation of a least recently used (lru) cache.\n <br>\n @author Daniel Boelzle\n*\/\ntemplate< class t_Key, class t_Val, class t_KeyHash, class t_KeyEqual >\nclass LRU_Cache\n{\n struct CacheEntry\n {\n t_Key aKey;\n t_Val aVal;\n CacheEntry * pPred;\n CacheEntry * pSucc;\n };\n typedef ::std::hash_map< t_Key, CacheEntry *, t_KeyHash, t_KeyEqual > t_Key2Element;\n\n mutable ::osl::Mutex _aCacheMutex;\n sal_Int32 _nCachedElements;\n t_Key2Element _aKey2Element;\n\n CacheEntry * _pBlock;\n mutable CacheEntry * _pHead;\n mutable CacheEntry * _pTail;\n inline void toFront( CacheEntry * pEntry ) const;\n\npublic:\n \/** Constructor:\n <br>\n @param nCachedElements number of elements to be cached; default param set to 128\n *\/\n inline LRU_Cache( sal_Int32 nCachedElements = 128 );\n \/** Destructor: releases all cached elements and keys.\n <br>\n *\/\n inline ~LRU_Cache();\n\n \/** Retrieves a value from the cache. Returns default constructed value,\n if none was found.\n <br>\n @param rKey a key\n @return value\n *\/\n inline t_Val getValue( const t_Key & rKey ) const;\n \/** Sets a value to be cached for given key.\n <br>\n @param rKey a key\n @param rValue a value\n *\/\n inline void setValue( const t_Key & rKey, const t_Val & rValue );\n \/** Tests whether a value is cached for given key.\n <br>\n @param rKey a key\n @return true, if value is cached\n *\/\n inline sal_Bool hasValue( const t_Key & rKey ) const;\n \/** Clears the cache, thus releasing all cached elements and keys.\n <br>\n *\/\n inline void clear();\n};\n\/\/__________________________________________________________________________________________________\ntemplate< class t_Key, class t_Val, class t_KeyHash, class t_KeyEqual >\ninline LRU_Cache< t_Key, t_Val, t_KeyHash, t_KeyEqual >::LRU_Cache( sal_Int32 nCachedElements )\n#ifdef __CACHE_DIAGNOSE\n : _nCachedElements( 4 )\n#else\n : _nCachedElements( nCachedElements )\n#endif\n , _pBlock( 0 )\n{\n if (_nCachedElements > 0)\n {\n _pBlock = new CacheEntry[_nCachedElements];\n _pHead = _pBlock;\n _pTail = _pBlock + _nCachedElements -1;\n for ( sal_Int32 nPos = _nCachedElements; nPos--; )\n {\n _pBlock[nPos].pPred = _pBlock + nPos -1;\n _pBlock[nPos].pSucc = _pBlock + nPos +1;\n }\n }\n}\n\/\/__________________________________________________________________________________________________\ntemplate< class t_Key, class t_Val, class t_KeyHash, class t_KeyEqual >\ninline LRU_Cache< t_Key, t_Val, t_KeyHash, t_KeyEqual >::~LRU_Cache()\n{\n delete [] _pBlock;\n}\n\/\/__________________________________________________________________________________________________\ntemplate< class t_Key, class t_Val, class t_KeyHash, class t_KeyEqual >\ninline void LRU_Cache< t_Key, t_Val, t_KeyHash, t_KeyEqual >::toFront( CacheEntry * pEntry ) const\n{\n if (pEntry != _pHead)\n {\n \/\/ cut out element\n if (pEntry == _pTail)\n {\n _pTail = pEntry->pPred;\n }\n else\n {\n pEntry->pSucc->pPred = pEntry->pPred;\n pEntry->pPred->pSucc = pEntry->pSucc;\n }\n \/\/ push to front\n _pHead->pPred = pEntry;\n pEntry->pSucc = _pHead;\n _pHead = pEntry;\n }\n}\n\/\/__________________________________________________________________________________________________\ntemplate< class t_Key, class t_Val, class t_KeyHash, class t_KeyEqual >\ninline sal_Bool LRU_Cache< t_Key, t_Val, t_KeyHash, t_KeyEqual >::hasValue( const t_Key & rKey ) const\n{\n ::osl::MutexGuard aGuard( _aCacheMutex );\n const typename t_Key2Element::const_iterator iFind( _aKey2Element.find( rKey ) );\n return (iFind != _aKey2Element.end());\n}\n\/\/__________________________________________________________________________________________________\ntemplate< class t_Key, class t_Val, class t_KeyHash, class t_KeyEqual >\ninline t_Val LRU_Cache< t_Key, t_Val, t_KeyHash, t_KeyEqual >::getValue( const t_Key & rKey ) const\n{\n ::osl::MutexGuard aGuard( _aCacheMutex );\n const typename t_Key2Element::const_iterator iFind( _aKey2Element.find( rKey ) );\n if (iFind != _aKey2Element.end())\n {\n CacheEntry * pEntry = (*iFind).second;\n toFront( pEntry );\n#ifdef __CACHE_DIAGNOSE\n OSL_TRACE( \"> retrieved element \\\"\" );\n OSL_TRACE( ::rtl::OUStringToOString( pEntry->aKey, RTL_TEXTENCODING_ASCII_US ).getStr() );\n OSL_TRACE( \"\\\" from cache <\\n\" );\n#endif\n return pEntry->aVal;\n }\n return t_Val();\n}\n\/\/__________________________________________________________________________________________________\ntemplate< class t_Key, class t_Val, class t_KeyHash, class t_KeyEqual >\ninline void LRU_Cache< t_Key, t_Val, t_KeyHash, t_KeyEqual >::setValue(\n const t_Key & rKey, const t_Val & rValue )\n{\n if (_nCachedElements > 0)\n {\n ::osl::MutexGuard aGuard( _aCacheMutex );\n const typename t_Key2Element::const_iterator iFind( _aKey2Element.find( rKey ) );\n\n CacheEntry * pEntry;\n if (iFind == _aKey2Element.end())\n {\n pEntry = _pTail; \/\/ erase last element\n#ifdef __CACHE_DIAGNOSE\n if (pEntry->aKey.getLength())\n {\n OSL_TRACE( \"> kicking element \\\"\" );\n OSL_TRACE( ::rtl::OUStringToOString( pEntry->aKey, RTL_TEXTENCODING_ASCII_US ).getStr() );\n OSL_TRACE( \"\\\" from cache <\\n\" );\n }\n#endif\n _aKey2Element.erase( pEntry->aKey );\n _aKey2Element[ pEntry->aKey = rKey ] = pEntry;\n }\n else\n {\n pEntry = (*iFind).second;\n#ifdef __CACHE_DIAGNOSE\n OSL_TRACE( \"> replacing element \\\"\" );\n OSL_TRACE( ::rtl::OUStringToOString( pEntry->aKey, RTL_TEXTENCODING_ASCII_US ).getStr() );\n OSL_TRACE( \"\\\" in cache <\\n\" );\n#endif\n }\n pEntry->aVal = rValue;\n toFront( pEntry );\n }\n}\n\/\/__________________________________________________________________________________________________\ntemplate< class t_Key, class t_Val, class t_KeyHash, class t_KeyEqual >\ninline void LRU_Cache< t_Key, t_Val, t_KeyHash, t_KeyEqual >::clear()\n{\n ::osl::MutexGuard aGuard( _aCacheMutex );\n _aKey2Element.clear();\n for ( sal_Int32 nPos = _nCachedElements; nPos--; )\n {\n _pBlock[nPos].aKey = t_Key();\n _pBlock[nPos].aVal = t_Val();\n }\n#ifdef __CACHE_DIAGNOSE\n OSL_TRACE( \"> cleared cache <\\n\" );\n#endif\n}\n\n\/\/==================================================================================================\nstruct FctHashOUString : public ::std::unary_function< const ::rtl::OUString &, size_t >\n{\n size_t operator()( const ::rtl::OUString & rKey ) const\n { return rKey.hashCode(); }\n};\n\n\/** Template instance for OUString keys, Any values.<br>\n*\/\ntypedef LRU_Cache< ::rtl::OUString, ::com::sun::star::uno::Any,\n FctHashOUString, ::std::equal_to< ::rtl::OUString > >\n LRU_CacheAnyByOUString;\n\n\n#endif\n<|endoftext|>"} {"text":"<commit_before>\/*************************************************************************\n *\n * OpenOffice.org - a multi-platform office productivity suite\n *\n * $RCSfile: ocomponentenumeration.hxx,v $\n *\n * $Revision: 1.6 $\n *\n * last change: $Author: hr $ $Date: 2006-06-19 10:53: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_HELPER_OCOMPONENTENUMERATION_HXX_\n#define __FRAMEWORK_HELPER_OCOMPONENTENUMERATION_HXX_\n\n\/\/_________________________________________________________________________________________________________________\n\/\/ my own includes\n\/\/_________________________________________________________________________________________________________________\n\n#ifndef __FRAMEWORK_OMUTEXMEMBER_HXX_\n#include <threadhelp\/threadhelpbase.hxx>\n#endif\n\n#ifndef __FRAMEWORK_MACROS_GENERIC_HXX_\n#include <macros\/generic.hxx>\n#endif\n\n#ifndef __FRAMEWORK_MACROS_XINTERFACE_HXX_\n#include <macros\/xinterface.hxx>\n#endif\n\n#ifndef __FRAMEWORK_MACROS_XTYPEPROVIDER_HXX_\n#include <macros\/xtypeprovider.hxx>\n#endif\n\n#ifndef __FRAMEWORK_MACROS_DEBUG_HXX_\n#include <macros\/debug.hxx>\n#endif\n\n#ifndef __FRAMEWORK_GENERAL_H_\n#include <general.h>\n#endif\n\n\/\/_________________________________________________________________________________________________________________\n\/\/ interface includes\n\/\/_________________________________________________________________________________________________________________\n\n#ifndef _COM_SUN_STAR_LANG_XEVENTLISTENER_HPP_\n#include <com\/sun\/star\/lang\/XEventListener.hpp>\n#endif\n\n#ifndef _COM_SUN_STAR_CONTAINER_XENUMERATION_HPP_\n#include <com\/sun\/star\/container\/XEnumeration.hpp>\n#endif\n\n#ifndef _COM_SUN_STAR_LANG_XCOMPONENT_HPP_\n#include <com\/sun\/star\/lang\/XComponent.hpp>\n#endif\n\n\/\/_________________________________________________________________________________________________________________\n\/\/ other includes\n\/\/_________________________________________________________________________________________________________________\n\n#ifndef _CPPUHELPER_WEAK_HXX_\n#include <cppuhelper\/weak.hxx>\n#endif\n\n\/\/_________________________________________________________________________________________________________________\n\/\/ namespace\n\/\/_________________________________________________________________________________________________________________\n\nnamespace framework{\n\n\/\/_________________________________________________________________________________________________________________\n\/\/ exported const\n\/\/_________________________________________________________________________________________________________________\n\n\/\/_________________________________________________________________________________________________________________\n\/\/ exported definitions\n\/\/_________________________________________________________________________________________________________________\n\n\/*-************************************************************************************************************\/\/**\n @short implement a helper for a oneway enumeration of components\n @descr You can step during this list only for one time! Its a snapshot.\n Don't forget to release the reference. You are the owner of an instance of this implementation.\n You cant use this as a baseclass. Please use it as a dynamical object for return.\n\n @implements XInterface\n XTypeProvider\n XEventListener\n XEnumeration\n\n @base ThreadHelpBase\n OWeakObject\n\n @devstatus ready to use\n @threadsafe yes\n*\/\/*-*************************************************************************************************************\/\n\nclass OComponentEnumeration : public css::lang::XTypeProvider ,\n public css::lang::XEventListener ,\n public css::container::XEnumeration ,\n public ThreadHelpBase ,\n public ::cppu::OWeakObject\n{\n \/\/-------------------------------------------------------------------------------------------------------------\n \/\/ public methods\n \/\/-------------------------------------------------------------------------------------------------------------\n\n public:\n\n \/\/---------------------------------------------------------------------------------------------------------\n \/\/ constructor \/ destructor\n \/\/---------------------------------------------------------------------------------------------------------\n\n \/*-****************************************************************************************************\/\/**\n @short constructor to initialize this enumeration\n @descr An enumeration is a list with oneway-access! You can get every member only for one time.\n This method allow to initialize this oneway list with values.\n\n @seealso -\n\n @param \"seqComponents\" is a sequence of interfaces, which are components.\n @return -\n\n @onerror Do nothing and reset this object to default with an empty list.\n *\/\/*-*****************************************************************************************************\/\n\n OComponentEnumeration( const css::uno::Sequence< css::uno::Reference< css::lang::XComponent > >& seqComponents );\n\n \/\/---------------------------------------------------------------------------------------------------------\n \/\/ XInterface\n \/\/---------------------------------------------------------------------------------------------------------\n\n FWK_DECLARE_XINTERFACE\n FWK_DECLARE_XTYPEPROVIDER\n\n \/\/---------------------------------------------------------------------------------------------------------\n \/\/ XEventListener\n \/\/---------------------------------------------------------------------------------------------------------\n\n \/*-****************************************************************************************************\/\/**\n @short last chance to release all references and free memory\n @descr This method is called, if the enumeration is used completly and has no more elements.\n Then we must destroy ouer list and release all references to other objects.\n\n @seealso interface XEventListener\n\n @param \"aEvent\" describe the source of this event.\n @return -\n\n @onerror -\n *\/\/*-*****************************************************************************************************\/\n\n virtual void SAL_CALL disposing( const css::lang::EventObject& aEvent ) throw( css::uno::RuntimeException );\n\n \/\/---------------------------------------------------------------------------------------------------------\n \/\/ XEnumeration\n \/\/---------------------------------------------------------------------------------------------------------\n\n \/*-****************************************************************************************************\/\/**\n @short check count of accessible elements of enumeration\n @descr You can call this method to get information about accessible elements in future.\n Elements you have already getted are not accessible!\n\n @seealso interface XEnumeration\n\n @param -\n @return sal_True = if more elements accessible<BR>\n sal_False = other way\n\n @onerror sal_False<BR>\n (List is emtpy and there no accessible elements ...)\n *\/\/*-*****************************************************************************************************\/\n\n virtual sal_Bool SAL_CALL hasMoreElements() throw( css::uno::RuntimeException );\n\n \/*-****************************************************************************************************\/\/**\n @short give the next element, if some exist\n @descr If a call \"hasMoreElements()\" return true, you can get the next element of list.\n\n @seealso interface XEnumeration\n\n @param -\n @return A Reference to a component, safed in an Any-structure.\n\n @onerror If end of enumeration is arrived or there are no elements in list => a NoSuchElementException is thrown.\n *\/\/*-*****************************************************************************************************\/\n\n virtual css::uno::Any SAL_CALL nextElement() throw( css::container::NoSuchElementException ,\n css::lang::WrappedTargetException ,\n css::uno::RuntimeException );\n\n \/\/-------------------------------------------------------------------------------------------------------------\n \/\/ protected methods\n \/\/-------------------------------------------------------------------------------------------------------------\n\n protected:\n\n \/*-****************************************************************************************************\/\/**\n @short standard destructor\n @descr This method destruct an instance of this class and clear some member.\n We make it protected, because its not supported to use this class as normal instance!\n You must create it dynamical in memory and use a pointer.\n\n @seealso -\n\n @param -\n @return -\n\n @onerror -\n *\/\/*-*****************************************************************************************************\/\n\n virtual ~OComponentEnumeration();\n\n \/*-****************************************************************************************************\/\/**\n @short reset instance to default values\n\n @descr There are two ways to delete an instance of this class.<BR>\n 1) delete with destructor<BR>\n 2) dispose from parent or factory ore ...<BR>\n This method do the same for both ways! It free used memory and release references ...\n\n @seealso method dispose()\n @seealso destructor ~TaskEnumeration()\n\n @param -\n\n @return -\n\n @onerror -\n *\/\/*-*****************************************************************************************************\/\n\n virtual void impl_resetObject();\n\n \/\/-------------------------------------------------------------------------------------------------------------\n \/\/ private methods\n \/\/-------------------------------------------------------------------------------------------------------------\n\n private:\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 ASSERT 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_OComponentEnumerationCtor ( const css::uno::Sequence< css::uno::Reference< css::lang::XComponent > >& seqComponents );\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 sal_uInt32 m_nPosition ; \/\/\/ current position in enumeration\n css::uno::Sequence< css::uno::Reference< css::lang::XComponent > > m_seqComponents ; \/\/\/ list of current components\n\n}; \/\/ class OComponentEnumeration\n\n} \/\/ namespace framework\n\n#endif \/\/ #ifndef __FRAMEWORK_HELPER_OCOMPONENTENUMERATION_HXX_\n<commit_msg>INTEGRATION: CWS changefileheader (1.6.318); FILE MERGED 2008\/04\/01 15:18:17 thb 1.6.318.3: #i85898# Stripping all external header guards 2008\/04\/01 10:57:47 thb 1.6.318.2: #i85898# Stripping all external header guards 2008\/03\/28 15:34:38 rt 1.6.318.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: ocomponentenumeration.hxx,v $\n * $Revision: 1.7 $\n *\n * This file is part of OpenOffice.org.\n *\n * OpenOffice.org is free software: you can redistribute it and\/or modify\n * it under the terms of the GNU Lesser General Public License version 3\n * only, as published by the Free Software Foundation.\n *\n * OpenOffice.org is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the\n * GNU Lesser General Public License version 3 for more details\n * (a copy is included in the LICENSE file that accompanied this code).\n *\n * You should have received a copy of the GNU Lesser General Public License\n * version 3 along with OpenOffice.org. If not, see\n * <http:\/\/www.openoffice.org\/license.html>\n * for a copy of the LGPLv3 License.\n *\n ************************************************************************\/\n\n#ifndef __FRAMEWORK_HELPER_OCOMPONENTENUMERATION_HXX_\n#define __FRAMEWORK_HELPER_OCOMPONENTENUMERATION_HXX_\n\n\/\/_________________________________________________________________________________________________________________\n\/\/ my own includes\n\/\/_________________________________________________________________________________________________________________\n\n#ifndef __FRAMEWORK_OMUTEXMEMBER_HXX_\n#include <threadhelp\/threadhelpbase.hxx>\n#endif\n#include <macros\/generic.hxx>\n#include <macros\/xinterface.hxx>\n#include <macros\/xtypeprovider.hxx>\n#include <macros\/debug.hxx>\n#include <general.h>\n\n\/\/_________________________________________________________________________________________________________________\n\/\/ interface includes\n\/\/_________________________________________________________________________________________________________________\n#include <com\/sun\/star\/lang\/XEventListener.hpp>\n#include <com\/sun\/star\/container\/XEnumeration.hpp>\n#include <com\/sun\/star\/lang\/XComponent.hpp>\n\n\/\/_________________________________________________________________________________________________________________\n\/\/ other includes\n\/\/_________________________________________________________________________________________________________________\n#include <cppuhelper\/weak.hxx>\n\n\/\/_________________________________________________________________________________________________________________\n\/\/ namespace\n\/\/_________________________________________________________________________________________________________________\n\nnamespace framework{\n\n\/\/_________________________________________________________________________________________________________________\n\/\/ exported const\n\/\/_________________________________________________________________________________________________________________\n\n\/\/_________________________________________________________________________________________________________________\n\/\/ exported definitions\n\/\/_________________________________________________________________________________________________________________\n\n\/*-************************************************************************************************************\/\/**\n @short implement a helper for a oneway enumeration of components\n @descr You can step during this list only for one time! Its a snapshot.\n Don't forget to release the reference. You are the owner of an instance of this implementation.\n You cant use this as a baseclass. Please use it as a dynamical object for return.\n\n @implements XInterface\n XTypeProvider\n XEventListener\n XEnumeration\n\n @base ThreadHelpBase\n OWeakObject\n\n @devstatus ready to use\n @threadsafe yes\n*\/\/*-*************************************************************************************************************\/\n\nclass OComponentEnumeration : public css::lang::XTypeProvider ,\n public css::lang::XEventListener ,\n public css::container::XEnumeration ,\n public ThreadHelpBase ,\n public ::cppu::OWeakObject\n{\n \/\/-------------------------------------------------------------------------------------------------------------\n \/\/ public methods\n \/\/-------------------------------------------------------------------------------------------------------------\n\n public:\n\n \/\/---------------------------------------------------------------------------------------------------------\n \/\/ constructor \/ destructor\n \/\/---------------------------------------------------------------------------------------------------------\n\n \/*-****************************************************************************************************\/\/**\n @short constructor to initialize this enumeration\n @descr An enumeration is a list with oneway-access! You can get every member only for one time.\n This method allow to initialize this oneway list with values.\n\n @seealso -\n\n @param \"seqComponents\" is a sequence of interfaces, which are components.\n @return -\n\n @onerror Do nothing and reset this object to default with an empty list.\n *\/\/*-*****************************************************************************************************\/\n\n OComponentEnumeration( const css::uno::Sequence< css::uno::Reference< css::lang::XComponent > >& seqComponents );\n\n \/\/---------------------------------------------------------------------------------------------------------\n \/\/ XInterface\n \/\/---------------------------------------------------------------------------------------------------------\n\n FWK_DECLARE_XINTERFACE\n FWK_DECLARE_XTYPEPROVIDER\n\n \/\/---------------------------------------------------------------------------------------------------------\n \/\/ XEventListener\n \/\/---------------------------------------------------------------------------------------------------------\n\n \/*-****************************************************************************************************\/\/**\n @short last chance to release all references and free memory\n @descr This method is called, if the enumeration is used completly and has no more elements.\n Then we must destroy ouer list and release all references to other objects.\n\n @seealso interface XEventListener\n\n @param \"aEvent\" describe the source of this event.\n @return -\n\n @onerror -\n *\/\/*-*****************************************************************************************************\/\n\n virtual void SAL_CALL disposing( const css::lang::EventObject& aEvent ) throw( css::uno::RuntimeException );\n\n \/\/---------------------------------------------------------------------------------------------------------\n \/\/ XEnumeration\n \/\/---------------------------------------------------------------------------------------------------------\n\n \/*-****************************************************************************************************\/\/**\n @short check count of accessible elements of enumeration\n @descr You can call this method to get information about accessible elements in future.\n Elements you have already getted are not accessible!\n\n @seealso interface XEnumeration\n\n @param -\n @return sal_True = if more elements accessible<BR>\n sal_False = other way\n\n @onerror sal_False<BR>\n (List is emtpy and there no accessible elements ...)\n *\/\/*-*****************************************************************************************************\/\n\n virtual sal_Bool SAL_CALL hasMoreElements() throw( css::uno::RuntimeException );\n\n \/*-****************************************************************************************************\/\/**\n @short give the next element, if some exist\n @descr If a call \"hasMoreElements()\" return true, you can get the next element of list.\n\n @seealso interface XEnumeration\n\n @param -\n @return A Reference to a component, safed in an Any-structure.\n\n @onerror If end of enumeration is arrived or there are no elements in list => a NoSuchElementException is thrown.\n *\/\/*-*****************************************************************************************************\/\n\n virtual css::uno::Any SAL_CALL nextElement() throw( css::container::NoSuchElementException ,\n css::lang::WrappedTargetException ,\n css::uno::RuntimeException );\n\n \/\/-------------------------------------------------------------------------------------------------------------\n \/\/ protected methods\n \/\/-------------------------------------------------------------------------------------------------------------\n\n protected:\n\n \/*-****************************************************************************************************\/\/**\n @short standard destructor\n @descr This method destruct an instance of this class and clear some member.\n We make it protected, because its not supported to use this class as normal instance!\n You must create it dynamical in memory and use a pointer.\n\n @seealso -\n\n @param -\n @return -\n\n @onerror -\n *\/\/*-*****************************************************************************************************\/\n\n virtual ~OComponentEnumeration();\n\n \/*-****************************************************************************************************\/\/**\n @short reset instance to default values\n\n @descr There are two ways to delete an instance of this class.<BR>\n 1) delete with destructor<BR>\n 2) dispose from parent or factory ore ...<BR>\n This method do the same for both ways! It free used memory and release references ...\n\n @seealso method dispose()\n @seealso destructor ~TaskEnumeration()\n\n @param -\n\n @return -\n\n @onerror -\n *\/\/*-*****************************************************************************************************\/\n\n virtual void impl_resetObject();\n\n \/\/-------------------------------------------------------------------------------------------------------------\n \/\/ private methods\n \/\/-------------------------------------------------------------------------------------------------------------\n\n private:\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 ASSERT 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_OComponentEnumerationCtor ( const css::uno::Sequence< css::uno::Reference< css::lang::XComponent > >& seqComponents );\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 sal_uInt32 m_nPosition ; \/\/\/ current position in enumeration\n css::uno::Sequence< css::uno::Reference< css::lang::XComponent > > m_seqComponents ; \/\/\/ list of current components\n\n}; \/\/ class OComponentEnumeration\n\n} \/\/ namespace framework\n\n#endif \/\/ #ifndef __FRAMEWORK_HELPER_OCOMPONENTENUMERATION_HXX_\n<|endoftext|>"} {"text":"<commit_before>#include \"..\/NacaBnd_test.h\"\n\nusing namespace dealii;\nusing namespace NSFEMSolver;\n\n#define dim 2\n\nint main()\n{\n Triangulation<dim> triangulation;\n {\n GridIn<dim> grid_in;\n grid_in.attach_triangulation (triangulation);\n\n std::ifstream input_file (\"NACA0012.msh\");\n Assert (input_file, ExcFileNotOpen (\"NACA0012.msh\"));\n grid_in.read_msh (input_file);\n }\n\n const BndNaca4DigitSymm<dim> NACA_foil_boundary (0012, 1.0);\n std::ofstream fout (\"output.out\");\n Assert (fout, ExcFileNotOpen (\"output.out\"));\n fout << std::scientific;\n fout.precision (8);\n\n for (typename Triangulation<dim>::active_cell_iterator\n cell = triangulation.begin_active();\n cell != triangulation.end();\n ++cell)\n for (unsigned int f=0; f<GeometryInfo<dim>::faces_per_cell; ++f)\n if (cell->face (f)->at_boundary())\n {\n if (cell->face (f)->boundary_id() == 1)\n {\n typename Boundary<2,2>::FaceVertexNormals face_vertex_normals;\n NACA_foil_boundary.get_normals_at_vertices (cell->face (f),\n face_vertex_normals);\n for (unsigned int v=0; v<GeometryInfo<2>::vertices_per_face; ++v)\n {\n fout << cell->face (f)->vertex (v) << '\\t';\n fout << face_vertex_normals[v] << std::endl;\n }\n }\n }\n\n fout.close();\n return (0);\n}\n<commit_msg>follow dealii update: rename Boundary to Manifold in regTest<commit_after>#include \"..\/NacaBnd_test.h\"\n\nusing namespace dealii;\nusing namespace NSFEMSolver;\n\n#define dim 2\n\nint main()\n{\n Triangulation<dim> triangulation;\n {\n GridIn<dim> grid_in;\n grid_in.attach_triangulation (triangulation);\n\n std::ifstream input_file (\"NACA0012.msh\");\n Assert (input_file, ExcFileNotOpen (\"NACA0012.msh\"));\n grid_in.read_msh (input_file);\n }\n\n const BndNaca4DigitSymm<dim> NACA_foil_boundary (0012, 1.0);\n std::ofstream fout (\"output.out\");\n Assert (fout, ExcFileNotOpen (\"output.out\"));\n fout << std::scientific;\n fout.precision (8);\n\n for (typename Triangulation<dim>::active_cell_iterator\n cell = triangulation.begin_active();\n cell != triangulation.end();\n ++cell)\n for (unsigned int f=0; f<GeometryInfo<dim>::faces_per_cell; ++f)\n if (cell->face (f)->at_boundary())\n {\n if (cell->face (f)->boundary_id() == 1)\n {\n typename Manifold<2,2>::FaceVertexNormals face_vertex_normals;\n NACA_foil_boundary.get_normals_at_vertices (cell->face (f),\n face_vertex_normals);\n for (unsigned int v=0; v<GeometryInfo<2>::vertices_per_face; ++v)\n {\n fout << cell->face (f)->vertex (v) << '\\t';\n fout << face_vertex_normals[v] << std::endl;\n }\n }\n }\n\n fout.close();\n return (0);\n}\n<|endoftext|>"} {"text":"<commit_before>\/*\n * Copyright 2014 Facebook, Inc.\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n *\/\n\n#include \"thrift\/lib\/cpp2\/async\/GssSaslClient.h\"\n\n#include \"folly\/io\/Cursor.h\"\n#include \"folly\/io\/IOBuf.h\"\n#include \"folly\/io\/IOBufQueue.h\"\n#include \"folly\/Memory.h\"\n#include \"folly\/MoveWrapper.h\"\n#include \"thrift\/lib\/cpp\/async\/TEventBase.h\"\n#include \"thrift\/lib\/cpp\/concurrency\/FunctionRunner.h\"\n#include \"thrift\/lib\/cpp2\/protocol\/MessageSerializer.h\"\n#include \"thrift\/lib\/cpp2\/gen-cpp2\/Sasl_types.h\"\n#include \"thrift\/lib\/cpp2\/gen-cpp2\/SaslAuthService.h\"\n#include \"thrift\/lib\/cpp2\/security\/KerberosSASLHandshakeClient.h\"\n#include \"thrift\/lib\/cpp2\/security\/KerberosSASLHandshakeUtils.h\"\n#include \"thrift\/lib\/cpp2\/security\/KerberosSASLThreadManager.h\"\n#include \"thrift\/lib\/cpp2\/security\/SecurityLogger.h\"\n#include \"thrift\/lib\/cpp\/concurrency\/Exception.h\"\n\n#include <memory>\n\nusing folly::IOBuf;\nusing folly::IOBufQueue;\nusing folly::MoveWrapper;\nusing apache::thrift::concurrency::Guard;\nusing apache::thrift::concurrency::Mutex;\nusing apache::thrift::concurrency::FunctionRunner;\nusing apache::thrift::concurrency::PosixThreadFactory;\nusing apache::thrift::concurrency::ThreadManager;\nusing apache::thrift::concurrency::TooManyPendingTasksException;\nusing apache::thrift::transport::TTransportException;\n\nusing namespace std;\nusing apache::thrift::sasl::SaslStart;\nusing apache::thrift::sasl::SaslRequest;\nusing apache::thrift::sasl::SaslReply;\nusing apache::thrift::sasl::SaslAuthService_authFirstRequest_pargs;\nusing apache::thrift::sasl::SaslAuthService_authFirstRequest_presult;\nusing apache::thrift::sasl::SaslAuthService_authNextRequest_pargs;\nusing apache::thrift::sasl::SaslAuthService_authNextRequest_presult;\n\nnamespace apache { namespace thrift {\n\nstatic const char MECH[] = \"krb5\";\n\nGssSaslClient::GssSaslClient(apache::thrift::async::TEventBase* evb,\n const std::shared_ptr<SecurityLogger>& logger)\n : SaslClient(logger)\n , evb_(evb)\n , clientHandshake_(new KerberosSASLHandshakeClient(logger))\n , mutex_(new Mutex)\n , saslThreadManager_(nullptr)\n , seqId_(0) {\n}\n\nvoid GssSaslClient::start(Callback *cb) {\n\n auto channelCallbackUnavailable = channelCallbackUnavailable_;\n auto clientHandshake = clientHandshake_;\n auto mutex = mutex_;\n auto logger = saslLogger_;\n\n logger->logStart(\"prepare_first_request\");\n auto ew_tm = folly::try_and_catch<TooManyPendingTasksException>([&]() {\n if (!saslThreadManager_) {\n throw TApplicationException(\n \"saslThreadManager is not set in GssSaslClient\");\n }\n\n logger->logStart(\"thread_manager_overhead\");\n saslThreadManager_->get()->add(std::make_shared<FunctionRunner>([=] {\n logger->logEnd(\"thread_manager_overhead\");\n MoveWrapper<unique_ptr<IOBuf>> iobuf;\n folly::exception_wrapper ex;\n\n \/\/ This is an optimization. If the channel is unavailable, we have no\n \/\/ need to attempt to communicate to the KDC. Note that this is just\n \/\/ checking a boolean, so thread safety is not an issue here.\n if (*channelCallbackUnavailable) {\n return;\n }\n\n ex = folly::try_and_catch<std::exception, TTransportException,\n TProtocolException, TApplicationException, TKerberosException>(\n [&]() {\n clientHandshake->startClientHandshake();\n auto token = clientHandshake->getTokenToSend();\n\n SaslStart start;\n start.mechanism = MECH;\n if (token != nullptr) {\n start.request.response = *token;\n start.request.__isset.response = true;\n }\n start.__isset.request = true;\n SaslAuthService_authFirstRequest_pargs argsp;\n argsp.saslStart = &start;\n\n *iobuf = PargsPresultCompactSerialize(\n argsp, \"authFirstRequest\", T_CALL, seqId_++);\n });\n\n Guard guard(*mutex);\n \/\/ Return if channel is unavailable. Ie. evb_ may not be good.\n if (*channelCallbackUnavailable) {\n return;\n }\n\n evb_->runInEventBaseThread([=]() mutable {\n if (*channelCallbackUnavailable) {\n return;\n }\n if (ex) {\n cb->saslError(std::move(ex));\n return;\n } else {\n logger->logStart(\"first_rtt\");\n cb->saslSendServer(std::move(*iobuf));\n }\n });\n }));\n });\n if (ew_tm) {\n logger->log(\"too_many_pending_tasks_in_start\");\n cb->saslError(std::move(ew_tm));\n }\n}\n\nvoid GssSaslClient::consumeFromServer(\n Callback *cb, std::unique_ptr<IOBuf>&& message) {\n std::shared_ptr<IOBuf> smessage(std::move(message));\n\n auto channelCallbackUnavailable = channelCallbackUnavailable_;\n auto clientHandshake = clientHandshake_;\n auto mutex = mutex_;\n auto logger = saslLogger_;\n\n auto ew_tm = folly::try_and_catch<TooManyPendingTasksException>([&]() {\n saslThreadManager_->get()->add(std::make_shared<FunctionRunner>([=] {\n std::string req_data;\n MoveWrapper<unique_ptr<IOBuf>> iobuf;\n folly::exception_wrapper ex;\n\n \/\/ This is an optimization. If the channel is unavailable, we have no\n \/\/ need to attempt to communicate to the KDC. Note that this is just\n \/\/ checking a boolean, so thread safety is not an issue here.\n if (*channelCallbackUnavailable) {\n return;\n }\n\n \/\/ Get the input string or outcome status\n std::string input = \"\";\n bool finished = false;\n \/\/ SaslAuthService_authFirstRequest_presult should be structurally\n \/\/ identical to SaslAuthService_authNextRequest_presult\n static_assert(sizeof(SaslAuthService_authFirstRequest_presult) ==\n sizeof(SaslAuthService_authNextRequest_presult),\n \"Types should be structurally identical\");\n static_assert(std::is_same<\n decltype(SaslAuthService_authFirstRequest_presult::success),\n decltype(SaslAuthService_authNextRequest_presult::success)>::value,\n \"Types should be structurally identical\");\n ex = folly::try_and_catch<std::exception, TTransportException,\n TProtocolException, TApplicationException, TKerberosException>(\n [&]() {\n SaslReply reply;\n SaslAuthService_authFirstRequest_presult presult;\n presult.success = &reply;\n string methodName =\n PargsPresultCompactDeserialize(presult, smessage.get(), T_REPLY).first;\n if (methodName != \"authFirstRequest\" &&\n methodName != \"authNextRequest\") {\n throw TApplicationException(\"Bad return method name: \" + methodName);\n }\n if (reply.__isset.challenge) {\n input = reply.challenge;\n }\n if (reply.__isset.outcome) {\n finished = reply.outcome.success;\n }\n\n clientHandshake->handleResponse(input);\n auto token = clientHandshake->getTokenToSend();\n if (clientHandshake->getPhase() == COMPLETE) {\n assert(token == nullptr);\n if (finished != true) {\n throw TKerberosException(\"Outcome of false returned from server\");\n }\n }\n if (token != nullptr) {\n SaslRequest req;\n req.response = *token;\n req.__isset.response = true;\n SaslAuthService_authNextRequest_pargs argsp;\n argsp.saslRequest = &req;\n *iobuf = PargsPresultCompactSerialize(argsp, \"authNextRequest\",\n T_CALL, seqId_++);\n }\n });\n\n Guard guard(*mutex);\n \/\/ Return if channel is unavailable. Ie. evb_ may not be good.\n if (*channelCallbackUnavailable) {\n return;\n }\n\n auto phase = clientHandshake->getPhase();\n evb_->runInEventBaseThread([=]() mutable {\n if (*channelCallbackUnavailable) {\n return;\n }\n if (ex) {\n cb->saslError(std::move(ex));\n return;\n }\n if (*iobuf && !(*iobuf)->empty()) {\n if (phase == SELECT_SECURITY_LAYER) {\n logger->logStart(\"third_rtt\");\n } else {\n logger->logStart(\"second_rtt\");\n }\n cb->saslSendServer(std::move(*iobuf));\n }\n if (clientHandshake_->isContextEstablished()) {\n cb->saslComplete();\n }\n });\n }));\n });\n if (ew_tm) {\n logger->log(\"too_many_pending_tasks_in_consume\");\n cb->saslError(std::move(ew_tm));\n }\n}\n\nstd::unique_ptr<IOBuf> GssSaslClient::wrap(std::unique_ptr<IOBuf>&& buf) {\n buf->coalesce();\n\n std::unique_ptr<IOBuf> wrapped = clientHandshake_->wrapMessage(\n std::move(buf));\n uint32_t wraplen = wrapped->length();\n\n std::unique_ptr<IOBuf> framing = IOBuf::create(sizeof(wraplen));\n framing->append(sizeof(wraplen));\n framing->appendChain(std::move(wrapped));\n\n folly::io::RWPrivateCursor c(framing.get());\n c.writeBE<uint32_t>(wraplen);\n return framing;\n}\n\nstd::unique_ptr<IOBuf> GssSaslClient::unwrap(\n IOBufQueue* q,\n size_t* remaining) {\n\n folly::io::Cursor c(q->front());\n size_t chainSize = q->front()->computeChainDataLength();\n uint32_t wraplen = 0;\n\n if (chainSize < sizeof(wraplen)) {\n *remaining = sizeof(wraplen) - chainSize;\n return nullptr;\n }\n\n wraplen = c.readBE<uint32_t>();\n\n if (chainSize < sizeof(wraplen) + wraplen) {\n *remaining = sizeof(wraplen) + wraplen - chainSize;\n return nullptr;\n }\n\n \/\/ unwrap the data\n q->trimStart(sizeof(wraplen));\n std::unique_ptr<IOBuf> input = q->split(wraplen);\n input->coalesce();\n std::unique_ptr<IOBuf> output = clientHandshake_->unwrapMessage(\n std::move(input));\n *remaining = 0;\n return output;\n}\n\nstd::string GssSaslClient::getClientIdentity() const {\n if (clientHandshake_->isContextEstablished()) {\n return clientHandshake_->getEstablishedClientPrincipal();\n } else {\n return \"\";\n }\n}\n\nstd::string GssSaslClient::getServerIdentity() const {\n if (clientHandshake_->isContextEstablished()) {\n return clientHandshake_->getEstablishedServicePrincipal();\n } else {\n return \"\";\n }\n}\n\n}}\n<commit_msg>Log a few more things<commit_after>\/*\n * Copyright 2014 Facebook, Inc.\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n *\/\n\n#include \"thrift\/lib\/cpp2\/async\/GssSaslClient.h\"\n\n#include \"folly\/io\/Cursor.h\"\n#include \"folly\/io\/IOBuf.h\"\n#include \"folly\/io\/IOBufQueue.h\"\n#include \"folly\/Memory.h\"\n#include \"folly\/MoveWrapper.h\"\n#include \"thrift\/lib\/cpp\/async\/TEventBase.h\"\n#include \"thrift\/lib\/cpp\/concurrency\/FunctionRunner.h\"\n#include \"thrift\/lib\/cpp2\/protocol\/MessageSerializer.h\"\n#include \"thrift\/lib\/cpp2\/gen-cpp2\/Sasl_types.h\"\n#include \"thrift\/lib\/cpp2\/gen-cpp2\/SaslAuthService.h\"\n#include \"thrift\/lib\/cpp2\/security\/KerberosSASLHandshakeClient.h\"\n#include \"thrift\/lib\/cpp2\/security\/KerberosSASLHandshakeUtils.h\"\n#include \"thrift\/lib\/cpp2\/security\/KerberosSASLThreadManager.h\"\n#include \"thrift\/lib\/cpp2\/security\/SecurityLogger.h\"\n#include \"thrift\/lib\/cpp\/concurrency\/Exception.h\"\n\n#include <memory>\n\nusing folly::IOBuf;\nusing folly::IOBufQueue;\nusing folly::MoveWrapper;\nusing apache::thrift::concurrency::Guard;\nusing apache::thrift::concurrency::Mutex;\nusing apache::thrift::concurrency::FunctionRunner;\nusing apache::thrift::concurrency::PosixThreadFactory;\nusing apache::thrift::concurrency::ThreadManager;\nusing apache::thrift::concurrency::TooManyPendingTasksException;\nusing apache::thrift::transport::TTransportException;\n\nusing namespace std;\nusing apache::thrift::sasl::SaslStart;\nusing apache::thrift::sasl::SaslRequest;\nusing apache::thrift::sasl::SaslReply;\nusing apache::thrift::sasl::SaslAuthService_authFirstRequest_pargs;\nusing apache::thrift::sasl::SaslAuthService_authFirstRequest_presult;\nusing apache::thrift::sasl::SaslAuthService_authNextRequest_pargs;\nusing apache::thrift::sasl::SaslAuthService_authNextRequest_presult;\n\nnamespace apache { namespace thrift {\n\nstatic const char MECH[] = \"krb5\";\n\nGssSaslClient::GssSaslClient(apache::thrift::async::TEventBase* evb,\n const std::shared_ptr<SecurityLogger>& logger)\n : SaslClient(logger)\n , evb_(evb)\n , clientHandshake_(new KerberosSASLHandshakeClient(logger))\n , mutex_(new Mutex)\n , saslThreadManager_(nullptr)\n , seqId_(0) {\n}\n\nvoid GssSaslClient::start(Callback *cb) {\n\n auto channelCallbackUnavailable = channelCallbackUnavailable_;\n auto clientHandshake = clientHandshake_;\n auto mutex = mutex_;\n auto logger = saslLogger_;\n\n logger->logStart(\"prepare_first_request\");\n auto ew_tm = folly::try_and_catch<TooManyPendingTasksException>([&]() {\n if (!saslThreadManager_) {\n throw TApplicationException(\n \"saslThreadManager is not set in GssSaslClient\");\n }\n\n logger->logStart(\"thread_manager_overhead\");\n saslThreadManager_->get()->add(std::make_shared<FunctionRunner>([=] {\n logger->logEnd(\"thread_manager_overhead\");\n MoveWrapper<unique_ptr<IOBuf>> iobuf;\n folly::exception_wrapper ex;\n\n \/\/ This is an optimization. If the channel is unavailable, we have no\n \/\/ need to attempt to communicate to the KDC. Note that this is just\n \/\/ checking a boolean, so thread safety is not an issue here.\n if (*channelCallbackUnavailable) {\n return;\n }\n\n ex = folly::try_and_catch<std::exception, TTransportException,\n TProtocolException, TApplicationException, TKerberosException>(\n [&]() {\n clientHandshake->startClientHandshake();\n auto token = clientHandshake->getTokenToSend();\n\n SaslStart start;\n start.mechanism = MECH;\n if (token != nullptr) {\n start.request.response = *token;\n start.request.__isset.response = true;\n }\n start.__isset.request = true;\n SaslAuthService_authFirstRequest_pargs argsp;\n argsp.saslStart = &start;\n\n *iobuf = PargsPresultCompactSerialize(\n argsp, \"authFirstRequest\", T_CALL, seqId_++);\n });\n\n Guard guard(*mutex);\n \/\/ Return if channel is unavailable. Ie. evb_ may not be good.\n if (*channelCallbackUnavailable) {\n return;\n }\n\n \/\/ Log the overhead around rescheduling the remainder of the\n \/\/ handshake at the back of the evb queue.\n logger->logStart(\"evb_overhead\");\n evb_->runInEventBaseThread([=]() mutable {\n logger->logEnd(\"evb_overhead\");\n if (*channelCallbackUnavailable) {\n return;\n }\n if (ex) {\n cb->saslError(std::move(ex));\n return;\n } else {\n logger->logStart(\"first_rtt\");\n cb->saslSendServer(std::move(*iobuf));\n }\n });\n }));\n });\n if (ew_tm) {\n logger->log(\"too_many_pending_tasks_in_start\");\n cb->saslError(std::move(ew_tm));\n }\n}\n\nvoid GssSaslClient::consumeFromServer(\n Callback *cb, std::unique_ptr<IOBuf>&& message) {\n std::shared_ptr<IOBuf> smessage(std::move(message));\n\n auto channelCallbackUnavailable = channelCallbackUnavailable_;\n auto clientHandshake = clientHandshake_;\n auto mutex = mutex_;\n auto logger = saslLogger_;\n\n auto ew_tm = folly::try_and_catch<TooManyPendingTasksException>([&]() {\n saslThreadManager_->get()->add(std::make_shared<FunctionRunner>([=] {\n std::string req_data;\n MoveWrapper<unique_ptr<IOBuf>> iobuf;\n folly::exception_wrapper ex;\n\n \/\/ This is an optimization. If the channel is unavailable, we have no\n \/\/ need to attempt to communicate to the KDC. Note that this is just\n \/\/ checking a boolean, so thread safety is not an issue here.\n if (*channelCallbackUnavailable) {\n return;\n }\n\n \/\/ Get the input string or outcome status\n std::string input = \"\";\n bool finished = false;\n \/\/ SaslAuthService_authFirstRequest_presult should be structurally\n \/\/ identical to SaslAuthService_authNextRequest_presult\n static_assert(sizeof(SaslAuthService_authFirstRequest_presult) ==\n sizeof(SaslAuthService_authNextRequest_presult),\n \"Types should be structurally identical\");\n static_assert(std::is_same<\n decltype(SaslAuthService_authFirstRequest_presult::success),\n decltype(SaslAuthService_authNextRequest_presult::success)>::value,\n \"Types should be structurally identical\");\n ex = folly::try_and_catch<std::exception, TTransportException,\n TProtocolException, TApplicationException, TKerberosException>(\n [&]() {\n SaslReply reply;\n SaslAuthService_authFirstRequest_presult presult;\n presult.success = &reply;\n string methodName =\n PargsPresultCompactDeserialize(presult, smessage.get(), T_REPLY).first;\n if (methodName != \"authFirstRequest\" &&\n methodName != \"authNextRequest\") {\n throw TApplicationException(\"Bad return method name: \" + methodName);\n }\n if (reply.__isset.challenge) {\n input = reply.challenge;\n }\n if (reply.__isset.outcome) {\n finished = reply.outcome.success;\n }\n\n clientHandshake->handleResponse(input);\n auto token = clientHandshake->getTokenToSend();\n if (clientHandshake->getPhase() == COMPLETE) {\n assert(token == nullptr);\n if (finished != true) {\n throw TKerberosException(\"Outcome of false returned from server\");\n }\n }\n if (token != nullptr) {\n SaslRequest req;\n req.response = *token;\n req.__isset.response = true;\n SaslAuthService_authNextRequest_pargs argsp;\n argsp.saslRequest = &req;\n *iobuf = PargsPresultCompactSerialize(argsp, \"authNextRequest\",\n T_CALL, seqId_++);\n }\n });\n\n Guard guard(*mutex);\n \/\/ Return if channel is unavailable. Ie. evb_ may not be good.\n if (*channelCallbackUnavailable) {\n return;\n }\n\n auto phase = clientHandshake->getPhase();\n evb_->runInEventBaseThread([=]() mutable {\n if (*channelCallbackUnavailable) {\n return;\n }\n if (ex) {\n cb->saslError(std::move(ex));\n return;\n }\n if (*iobuf && !(*iobuf)->empty()) {\n if (phase == SELECT_SECURITY_LAYER) {\n logger->logStart(\"third_rtt\");\n } else {\n logger->logStart(\"second_rtt\");\n }\n cb->saslSendServer(std::move(*iobuf));\n }\n if (clientHandshake_->isContextEstablished()) {\n cb->saslComplete();\n }\n });\n }));\n });\n if (ew_tm) {\n logger->log(\"too_many_pending_tasks_in_consume\");\n cb->saslError(std::move(ew_tm));\n }\n}\n\nstd::unique_ptr<IOBuf> GssSaslClient::wrap(std::unique_ptr<IOBuf>&& buf) {\n buf->coalesce();\n\n std::unique_ptr<IOBuf> wrapped = clientHandshake_->wrapMessage(\n std::move(buf));\n uint32_t wraplen = wrapped->length();\n\n std::unique_ptr<IOBuf> framing = IOBuf::create(sizeof(wraplen));\n framing->append(sizeof(wraplen));\n framing->appendChain(std::move(wrapped));\n\n folly::io::RWPrivateCursor c(framing.get());\n c.writeBE<uint32_t>(wraplen);\n return framing;\n}\n\nstd::unique_ptr<IOBuf> GssSaslClient::unwrap(\n IOBufQueue* q,\n size_t* remaining) {\n\n folly::io::Cursor c(q->front());\n size_t chainSize = q->front()->computeChainDataLength();\n uint32_t wraplen = 0;\n\n if (chainSize < sizeof(wraplen)) {\n *remaining = sizeof(wraplen) - chainSize;\n return nullptr;\n }\n\n wraplen = c.readBE<uint32_t>();\n\n if (chainSize < sizeof(wraplen) + wraplen) {\n *remaining = sizeof(wraplen) + wraplen - chainSize;\n return nullptr;\n }\n\n \/\/ unwrap the data\n q->trimStart(sizeof(wraplen));\n std::unique_ptr<IOBuf> input = q->split(wraplen);\n input->coalesce();\n std::unique_ptr<IOBuf> output = clientHandshake_->unwrapMessage(\n std::move(input));\n *remaining = 0;\n return output;\n}\n\nstd::string GssSaslClient::getClientIdentity() const {\n if (clientHandshake_->isContextEstablished()) {\n return clientHandshake_->getEstablishedClientPrincipal();\n } else {\n return \"\";\n }\n}\n\nstd::string GssSaslClient::getServerIdentity() const {\n if (clientHandshake_->isContextEstablished()) {\n return clientHandshake_->getEstablishedServicePrincipal();\n } else {\n return \"\";\n }\n}\n\n}}\n<|endoftext|>"} {"text":"<commit_before>\/\/ @(#)root\/gpad:$Id$\n\/\/ Author: Rene Brun 01\/07\/96\n\n\/*************************************************************************\n * Copyright (C) 1995-2000, Rene Brun and Fons Rademakers. *\n * All rights reserved. *\n * *\n * For the licensing terms see $ROOTSYS\/LICENSE. *\n * For the list of contributors see $ROOTSYS\/README\/CREDITS. *\n *************************************************************************\/\n\n#include \"Riostream.h\"\n#include \"TROOT.h\"\n#include \"TBox.h\"\n#include \"TGroupButton.h\"\n#include \"TVirtualX.h\"\n#include \"TDialogCanvas.h\"\n#include \"TCanvas.h\"\n#include \"TText.h\"\n#include \"TInterpreter.h\"\n#include \"TTimer.h\"\n#include <string.h>\n\nClassImp(TGroupButton)\n\n\n\/\/______________________________________________________________________________\n\/\/\n\/\/ A TGroupButton object is a specialized TButton used in a group of Buttons.\n\/\/ When a button from a group of TGroupButtons is selected, all other buttons\n\/\/ from the group with the same name are disabled.\n\/\/\n\/\/ For examples of use of TGroupButton objects, see:\n\/\/ TAttFillCanvas, TAttLineCanvas, TAttTextCanvas and TAttMarkerCanvas.\n\n\n\/\/______________________________________________________________________________\nTGroupButton::TGroupButton(): TButton()\n{\n \/\/ GroupButton default constructor.\n\n SetFraming();\n}\n\n\n\/\/______________________________________________________________________________\nTGroupButton::TGroupButton(const char *groupname, const char *title, const char *method, Double_t x1, Double_t y1,Double_t x2, Double_t y2)\n :TButton(title,method,x1,y1,x2,y2)\n{\n \/\/ GroupButton normal constructor.\n\n SetName((char*)groupname);\n SetFraming();\n}\n\n\n\/\/______________________________________________________________________________\nTGroupButton::~TGroupButton()\n{\n \/\/ GroupButton default destructor.\n}\n\n\n\/\/______________________________________________________________________________\nvoid TGroupButton::DisplayColorTable(const char *action, Double_t x0, Double_t y0, Double_t wc, Double_t hc)\n{\n \/\/ Display Color Table in an attribute canvas.\n\n TGroupButton *colorpad;\n Int_t i, j;\n Int_t color;\n Double_t xlow, ylow, hs, ws;\n\n \/\/ draw colortable buttons\n hs = hc\/5;\n ws = wc\/10;\n char command[32];\n for (i=0;i<10;i++) {\n xlow = x0 + ws*i;\n for (j=0;j<5;j++) {\n ylow = y0 + hs*j;\n color = 10*j + i + 1;\n snprintf(command,32,\"%s(%d)\",action,10*j+i+1);\n colorpad = new TGroupButton(\"Color\",\"\",command,xlow, ylow, xlow+0.9*ws, ylow+0.9*hs);\n colorpad->SetFillColor(color);\n colorpad->SetBorderSize(1);\n if (i == 0 && j == 0) colorpad->SetBorderMode(-1);\n colorpad->Draw();\n }\n }\n}\n\n\n\/\/______________________________________________________________________________\nvoid TGroupButton::ExecuteAction()\n{\n \/\/ Execute action of this button.\n \/\/\n \/\/ If an object has been selected before executing the APPLY button\n \/\/ in the control canvas, The member function and its parameters\n \/\/ for this object is executed via the interpreter.\n\n TVirtualPad *pad;\n char line[128];\n strlcpy(line,GetMethod(),128); \n char *method = line;\n if(!strlen(line)) return;\n char *params = strchr(method,'(');\n if (params) {\n *params = 0;\n params++;\n char *end = strrchr(params,')');\n if (end) *end = 0;\n }\n TDialogCanvas *canvas = (TDialogCanvas*)GetMother();\n TObject *obj = canvas->GetRefObject();\n if (!obj) return;\n if (strcmp(method,\"PIXELS\")) {\n obj->Execute(method,params);\n } else {\n TText *text = (TText*)GetListOfPrimitives()->First();\n Int_t npixels = Int_t((YtoPixel(0) - YtoPixel(1))*text->GetTextSize());\n Double_t dy;\n pad = gROOT->GetSelectedPad();\n if (!params) return;\n Int_t nmax = (Int_t)(params-method);\n if (obj->InheritsFrom(\"TPaveLabel\")) {\n TBox *pl = (TBox*)obj;\n dy = pad->AbsPixeltoY(0) - pad->AbsPixeltoY(npixels);\n snprintf(params,nmax,\"%f\",dy\/(pl->GetY2() - pl->GetY1()));\n obj->Execute(\"SetTextSize\",params);\n } else {\n if (obj->InheritsFrom(\"TPave\")) {\n dy = pad->AbsPixeltoY(0) - pad->AbsPixeltoY(npixels);\n snprintf(params,nmax,\"%f\",dy\/(pad->GetY2() - pad->GetY1()));\n obj->Execute(\"SetTextSize\",params);\n } else {\n snprintf(params,nmax,\"%d\",npixels);\n obj->Execute(\"SetTextSizePixels\",params);\n }\n }\n }\n}\n\n\n\/\/______________________________________________________________________________\nvoid TGroupButton::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 Button object is clicked.\n\n if (fMother->IsEditable()) {\n TPad::ExecuteEvent(event,px,py);\n return;\n }\n\n TIter next(gPad->GetCanvas()->GetListOfPrimitives());\n TObject *obj;\n TGroupButton *button;\n TPad *pad;\n TDialogCanvas *canvas;\n\n switch (event) {\n\n case kButton1Down:\n\n case kMouseMotion:\n\n break;\n\n case kButton1Motion:\n\n break;\n\n case kButton1Up:\n \/\/Clicked on APPLY button?\n if (!strcasecmp(GetName(),\"APPLY\")) {\n canvas = (TDialogCanvas*)GetMother();\n if (!strcasecmp(GetTitle(),\"CLOSE\")) {\n canvas->Close();\n return;\n }\n pad = canvas->GetRefPad();\n if (pad) pad->GetCanvas()->FeedbackMode(kFALSE);\n canvas->Apply(GetTitle()); \/\/just in case the apply button executes some code\n if (pad) {\n pad->Modified(kTRUE);\n pad->Update();\n }\n break;\n }\n \/\/Unset other buttons with same name\n while ((obj = next())) {\n if (obj == this) continue;\n if (obj->InheritsFrom(TGroupButton::Class())) {\n button = (TGroupButton*)obj;\n if (!strcmp(button->GetName(),GetName())) {\n if (button->GetBorderMode() < 0) {\n button->SetBorderMode(1);\n button->Modified();\n }\n }\n }\n }\n \/\/Set button on\n SetBorderMode(-1);\n Modified();\n gPad->GetCanvas()->Modified();\n gPad->Update();\n break;\n }\n}\n\n\n\/\/______________________________________________________________________________\nvoid TGroupButton::SavePrimitive(ostream &out, Option_t * \/*= \"\"*\/)\n{\n \/\/ Save primitive as a C++ statement(s) on output stream out\n\n TPad *padsav = (TPad*)gPad;\n char quote = '\"';\n if (gROOT->ClassSaved(TGroupButton::Class())) {\n out<<\" \";\n } else {\n out<<\" TGroupButton *\";\n }\n out<<\"button = new TGroupButton(\"<<quote<<GetName()<<quote<<\", \"<<quote<<GetTitle()\n <<quote<<\",\"<<quote<<GetMethod()<<quote\n <<\",\"<<fXlowNDC\n <<\",\"<<fYlowNDC\n <<\",\"<<fXlowNDC+fWNDC\n <<\",\"<<fYlowNDC+fHNDC\n <<\");\"<<endl;\n\n SaveFillAttributes(out,\"button\",0,1001);\n SaveLineAttributes(out,\"button\",1,1,1);\n SaveTextAttributes(out,\"button\",22,0,1,62,.75);\n\n if (GetBorderSize() != 2) {\n out<<\" button->SetBorderSize(\"<<GetBorderSize()<<\");\"<<endl;\n }\n if (GetBorderMode() != 1) {\n out<<\" button->SetBorderMode(\"<<GetBorderMode()<<\");\"<<endl;\n }\n\n out<<\" button->Draw();\"<<endl;\n out<<\" button->cd();\"<<endl;\n\n TIter next(GetListOfPrimitives());\n TObject *obj = next(); \/\/do not save first primitive\n\n while ((obj = next()))\n obj->SavePrimitive(out, (Option_t *)next.GetOption());\n\n out<<\" \"<<padsav->GetName()<<\"->cd();\"<<endl;\n padsav->cd();\n}\n<commit_msg>Fix Coverty report #33226<commit_after>\/\/ @(#)root\/gpad:$Id$\n\/\/ Author: Rene Brun 01\/07\/96\n\n\/*************************************************************************\n * Copyright (C) 1995-2000, Rene Brun and Fons Rademakers. *\n * All rights reserved. *\n * *\n * For the licensing terms see $ROOTSYS\/LICENSE. *\n * For the list of contributors see $ROOTSYS\/README\/CREDITS. *\n *************************************************************************\/\n\n#include \"Riostream.h\"\n#include \"TROOT.h\"\n#include \"TBox.h\"\n#include \"TGroupButton.h\"\n#include \"TVirtualX.h\"\n#include \"TDialogCanvas.h\"\n#include \"TCanvas.h\"\n#include \"TText.h\"\n#include \"TInterpreter.h\"\n#include \"TTimer.h\"\n#include <string.h>\n\nClassImp(TGroupButton)\n\n\n\/\/______________________________________________________________________________\n\/\/\n\/\/ A TGroupButton object is a specialized TButton used in a group of Buttons.\n\/\/ When a button from a group of TGroupButtons is selected, all other buttons\n\/\/ from the group with the same name are disabled.\n\/\/\n\/\/ For examples of use of TGroupButton objects, see:\n\/\/ TAttFillCanvas, TAttLineCanvas, TAttTextCanvas and TAttMarkerCanvas.\n\n\n\/\/______________________________________________________________________________\nTGroupButton::TGroupButton(): TButton()\n{\n \/\/ GroupButton default constructor.\n\n SetFraming();\n}\n\n\n\/\/______________________________________________________________________________\nTGroupButton::TGroupButton(const char *groupname, const char *title, const char *method, Double_t x1, Double_t y1,Double_t x2, Double_t y2)\n :TButton(title,method,x1,y1,x2,y2)\n{\n \/\/ GroupButton normal constructor.\n\n SetName((char*)groupname);\n SetFraming();\n}\n\n\n\/\/______________________________________________________________________________\nTGroupButton::~TGroupButton()\n{\n \/\/ GroupButton default destructor.\n}\n\n\n\/\/______________________________________________________________________________\nvoid TGroupButton::DisplayColorTable(const char *action, Double_t x0, Double_t y0, Double_t wc, Double_t hc)\n{\n \/\/ Display Color Table in an attribute canvas.\n\n TGroupButton *colorpad;\n Int_t i, j;\n Int_t color;\n Double_t xlow, ylow, hs, ws;\n\n \/\/ draw colortable buttons\n hs = hc\/5;\n ws = wc\/10;\n char command[32];\n for (i=0;i<10;i++) {\n xlow = x0 + ws*i;\n for (j=0;j<5;j++) {\n ylow = y0 + hs*j;\n color = 10*j + i + 1;\n snprintf(command,32,\"%s(%d)\",action,10*j+i+1);\n colorpad = new TGroupButton(\"Color\",\"\",command,xlow, ylow, xlow+0.9*ws, ylow+0.9*hs);\n colorpad->SetFillColor(color);\n colorpad->SetBorderSize(1);\n if (i == 0 && j == 0) colorpad->SetBorderMode(-1);\n colorpad->Draw();\n }\n }\n}\n\n\n\/\/______________________________________________________________________________\nvoid TGroupButton::ExecuteAction()\n{\n \/\/ Execute action of this button.\n \/\/\n \/\/ If an object has been selected before executing the APPLY button\n \/\/ in the control canvas, The member function and its parameters\n \/\/ for this object is executed via the interpreter.\n\n TVirtualPad *pad;\n char line[128];\n strlcpy(line,GetMethod(),128); \n char *method = line;\n if(!strlen(line)) return;\n char *params = strchr(method,'(');\n if (params) {\n *params = 0;\n params++;\n char *end = strrchr(params,')');\n if (end) *end = 0;\n }\n TDialogCanvas *canvas = (TDialogCanvas*)GetMother();\n TObject *obj = canvas->GetRefObject();\n if (!obj) return;\n if (strcmp(method,\"PIXELS\")) {\n obj->Execute(method,params);\n } else {\n TText *text = (TText*)GetListOfPrimitives()->First();\n Int_t npixels = Int_t((YtoPixel(0) - YtoPixel(1))*text->GetTextSize());\n Double_t dy;\n pad = gROOT->GetSelectedPad();\n if (!params) return;\n Int_t nmax = (Int_t)(params-method);\n if (obj->InheritsFrom(\"TPaveLabel\")) {\n TBox *pl = (TBox*)obj;\n dy = pad->AbsPixeltoY(0) - pad->AbsPixeltoY(npixels);\n snprintf(params,nmax,\"%f\",dy\/(pl->GetY2() - pl->GetY1()));\n obj->Execute(\"SetTextSize\",params);\n } else {\n if (obj->InheritsFrom(\"TPave\")) {\n dy = pad->AbsPixeltoY(0) - pad->AbsPixeltoY(npixels);\n snprintf(params,nmax,\"%f\",dy\/(pad->GetY2() - pad->GetY1()));\n obj->Execute(\"SetTextSize\",params);\n } else {\n snprintf(params,nmax,\"%d\",npixels);\n obj->Execute(\"SetTextSizePixels\",params);\n }\n }\n }\n}\n\n\n\/\/______________________________________________________________________________\nvoid TGroupButton::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 Button object is clicked.\n\n if (fMother->IsEditable()) {\n TPad::ExecuteEvent(event,px,py);\n return;\n }\n\n TCanvas *c = gPad->GetCanvas();\n if (!c) return;\n TIter next(c->GetListOfPrimitives());\n TObject *obj;\n TGroupButton *button;\n TPad *pad;\n TDialogCanvas *canvas;\n\n switch (event) {\n\n case kButton1Down:\n\n case kMouseMotion:\n\n break;\n\n case kButton1Motion:\n\n break;\n\n case kButton1Up:\n \/\/Clicked on APPLY button?\n if (!strcasecmp(GetName(),\"APPLY\")) {\n canvas = (TDialogCanvas*)GetMother();\n if (!strcasecmp(GetTitle(),\"CLOSE\")) {\n canvas->Close();\n return;\n }\n pad = canvas->GetRefPad();\n if (pad) pad->GetCanvas()->FeedbackMode(kFALSE);\n canvas->Apply(GetTitle()); \/\/just in case the apply button executes some code\n if (pad) {\n pad->Modified(kTRUE);\n pad->Update();\n }\n break;\n }\n \/\/Unset other buttons with same name\n while ((obj = next())) {\n if (obj == this) continue;\n if (obj->InheritsFrom(TGroupButton::Class())) {\n button = (TGroupButton*)obj;\n if (!strcmp(button->GetName(),GetName())) {\n if (button->GetBorderMode() < 0) {\n button->SetBorderMode(1);\n button->Modified();\n }\n }\n }\n }\n \/\/Set button on\n SetBorderMode(-1);\n Modified();\n gPad->GetCanvas()->Modified();\n gPad->Update();\n break;\n }\n}\n\n\n\/\/______________________________________________________________________________\nvoid TGroupButton::SavePrimitive(ostream &out, Option_t * \/*= \"\"*\/)\n{\n \/\/ Save primitive as a C++ statement(s) on output stream out\n\n TPad *padsav = (TPad*)gPad;\n char quote = '\"';\n if (gROOT->ClassSaved(TGroupButton::Class())) {\n out<<\" \";\n } else {\n out<<\" TGroupButton *\";\n }\n out<<\"button = new TGroupButton(\"<<quote<<GetName()<<quote<<\", \"<<quote<<GetTitle()\n <<quote<<\",\"<<quote<<GetMethod()<<quote\n <<\",\"<<fXlowNDC\n <<\",\"<<fYlowNDC\n <<\",\"<<fXlowNDC+fWNDC\n <<\",\"<<fYlowNDC+fHNDC\n <<\");\"<<endl;\n\n SaveFillAttributes(out,\"button\",0,1001);\n SaveLineAttributes(out,\"button\",1,1,1);\n SaveTextAttributes(out,\"button\",22,0,1,62,.75);\n\n if (GetBorderSize() != 2) {\n out<<\" button->SetBorderSize(\"<<GetBorderSize()<<\");\"<<endl;\n }\n if (GetBorderMode() != 1) {\n out<<\" button->SetBorderMode(\"<<GetBorderMode()<<\");\"<<endl;\n }\n\n out<<\" button->Draw();\"<<endl;\n out<<\" button->cd();\"<<endl;\n\n TIter next(GetListOfPrimitives());\n TObject *obj = next(); \/\/do not save first primitive\n\n while ((obj = next()))\n obj->SavePrimitive(out, (Option_t *)next.GetOption());\n\n out<<\" \"<<padsav->GetName()<<\"->cd();\"<<endl;\n padsav->cd();\n}\n<|endoftext|>"} {"text":"<commit_before>\/* This file is part of the KDE project\n Copyright (C) 2005-2007 Matthias Kretz <kretz@kde.org>\n\n This library is free software; you can redistribute it and\/or\n modify it under the terms of the GNU Library General Public\n License version 2 as published by the Free Software Foundation.\n\n This library is distributed in the hope that it will be useful,\n but WITHOUT ANY WARRANTY; without even the implied warranty of\n MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU\n Library General Public License for more details.\n\n You should have received a copy of the GNU Library General Public License\n along with this library; see the file COPYING.LIB. If not, write to\n the Free Software Foundation, Inc., 51 Franklin Street, Fifth Floor,\n Boston, MA 02110-1301, USA.\n\n*\/\n#include \"videodataoutput.h\"\n#include \"videodataoutput_p.h\"\n#include \"..\/factory.h\"\n#include <QtCore\/QSize>\n\n#define PHONON_CLASSNAME VideoDataOutput\n\nnamespace Phonon\n{\nnamespace Experimental\n{\n\nVideoDataOutput::VideoDataOutput(QObject *parent)\n : QObject(parent)\n , AbstractVideoOutput(*new VideoDataOutputPrivate)\n{\n K_D(VideoDataOutput);\n d->createBackendObject();\n}\n\nvoid VideoDataOutputPrivate::createBackendObject()\n{\n if (m_backendObject)\n return;\n Q_Q(VideoDataOutput);\n m_backendObject = Factory::createVideoDataOutput(q);\n if (m_backendObject) {\n setupBackendObject();\n }\n}\n\n\nPHONON_GETTER(int, latency, d->latency)\n\nbool VideoDataOutputPrivate::aboutToDeleteBackendObject()\n{\n Q_ASSERT(m_backendObject);\n\n return AbstractVideoOutputPrivate::aboutToDeleteBackendObject();\n}\n\nvoid VideoDataOutputPrivate::setupBackendObject()\n{\n Q_Q(VideoDataOutput);\n Q_ASSERT(m_backendObject);\n \/\/AbstractVideoOutputPrivate::setupBackendObject();\n\n \/\/QObject::connect(m_backendObject, SIGNAL(frameReady(const Phonon::Experimental::VideoFrame &)),\n \/\/ q, SIGNAL(frameReady(const Phonon::Experimental::VideoFrame &)));\n\n QObject::connect(m_backendObject, SIGNAL(displayFrame(qint64, qint64)),\n q, SIGNAL(displayFrame(qint64, qint64)));\n QObject::connect(m_backendObject, SIGNAL(endOfMedia()), q, SIGNAL(endOfMedia()));\n}\n\nbool VideoDataOutput::isRunning() const\n{\n K_D(const VideoDataOutput);\n \/\/return d->m_backendObject->isRunning();\n return false;\n}\n\nVideoFrame VideoDataOutput::frameForTime(qint64 timestamp)\n{\n \/\/return d->m_backendObject->frameForTime(timestamp);\n}\n\nvoid VideoDataOutput::setRunning(bool running)\n{\n \/\/return d->m_backendObject->setRunning(running);\n}\n\nvoid VideoDataOutput::start()\n{\n \/\/return d->m_backendObject->setRunning(true);\n}\n\nvoid VideoDataOutput::stop()\n{\n \/\/return d->m_backendObject->setRunning(false);\n}\n\n} \/\/ namespace Experimental\n} \/\/ namespace Phonon\n\n#include \"videodataoutput.moc\"\n\n#undef PHONON_CLASSNAME\n\/\/ vim: sw=4 ts=4 tw=80\n<commit_msg>seems to be needed to compile on VS 05 as long as the real implementation is missing<commit_after>\/* This file is part of the KDE project\n Copyright (C) 2005-2007 Matthias Kretz <kretz@kde.org>\n\n This library is free software; you can redistribute it and\/or\n modify it under the terms of the GNU Library General Public\n License version 2 as published by the Free Software Foundation.\n\n This library is distributed in the hope that it will be useful,\n but WITHOUT ANY WARRANTY; without even the implied warranty of\n MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU\n Library General Public License for more details.\n\n You should have received a copy of the GNU Library General Public License\n along with this library; see the file COPYING.LIB. If not, write to\n the Free Software Foundation, Inc., 51 Franklin Street, Fifth Floor,\n Boston, MA 02110-1301, USA.\n\n*\/\n#include \"videodataoutput.h\"\n#include \"videodataoutput_p.h\"\n#include \"..\/factory.h\"\n#include <QtCore\/QSize>\n\n#define PHONON_CLASSNAME VideoDataOutput\n\nnamespace Phonon\n{\nnamespace Experimental\n{\n\nVideoDataOutput::VideoDataOutput(QObject *parent)\n : QObject(parent)\n , AbstractVideoOutput(*new VideoDataOutputPrivate)\n{\n K_D(VideoDataOutput);\n d->createBackendObject();\n}\n\nvoid VideoDataOutputPrivate::createBackendObject()\n{\n if (m_backendObject)\n return;\n Q_Q(VideoDataOutput);\n m_backendObject = Factory::createVideoDataOutput(q);\n if (m_backendObject) {\n setupBackendObject();\n }\n}\n\n\nPHONON_GETTER(int, latency, d->latency)\n\nbool VideoDataOutputPrivate::aboutToDeleteBackendObject()\n{\n Q_ASSERT(m_backendObject);\n\n return AbstractVideoOutputPrivate::aboutToDeleteBackendObject();\n}\n\nvoid VideoDataOutputPrivate::setupBackendObject()\n{\n Q_Q(VideoDataOutput);\n Q_ASSERT(m_backendObject);\n \/\/AbstractVideoOutputPrivate::setupBackendObject();\n\n \/\/QObject::connect(m_backendObject, SIGNAL(frameReady(const Phonon::Experimental::VideoFrame &)),\n \/\/ q, SIGNAL(frameReady(const Phonon::Experimental::VideoFrame &)));\n\n QObject::connect(m_backendObject, SIGNAL(displayFrame(qint64, qint64)),\n q, SIGNAL(displayFrame(qint64, qint64)));\n QObject::connect(m_backendObject, SIGNAL(endOfMedia()), q, SIGNAL(endOfMedia()));\n}\n\nbool VideoDataOutput::isRunning() const\n{\n K_D(const VideoDataOutput);\n \/\/return d->m_backendObject->isRunning();\n return false;\n}\n\nVideoFrame VideoDataOutput::frameForTime(qint64 timestamp)\n{\n \/\/return d->m_backendObject->frameForTime(timestamp);\n return VideoFrame();\n}\n\nvoid VideoDataOutput::setRunning(bool running)\n{\n \/\/return d->m_backendObject->setRunning(running);\n}\n\nvoid VideoDataOutput::start()\n{\n \/\/return d->m_backendObject->setRunning(true);\n}\n\nvoid VideoDataOutput::stop()\n{\n \/\/return d->m_backendObject->setRunning(false);\n}\n\n} \/\/ namespace Experimental\n} \/\/ namespace Phonon\n\n#include \"videodataoutput.moc\"\n\n#undef PHONON_CLASSNAME\n\/\/ vim: sw=4 ts=4 tw=80\n<|endoftext|>"} {"text":"<commit_before>\/*== SAGITTARIUS =====================================================================\n * Copyright (c) 2012, Jesse K Medley\n * All rights 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 University of Washington nor the\n names of its contributors may be used to endorse or promote products\n derived from this software without specific prior written permission.\n\n * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS \"AS IS\" AND\n * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED\n * WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE\n * DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDERS OR ANYONE DISTRIBUTING THE SOFTWARE\n * BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL \n * DAMAGES (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\/\/== BEGINNING OF CODE ===============================================================\n\n\/\/== INCLUDES ========================================================================\n\n#include \"graphfab\/core\/SagittariusCore.h\"\n#include \"graphfab\/sbml\/autolayoutSBML.h\"\n#include \"graphfab\/diag\/error.h\"\n\n#include \"sbml\/SBMLTypes.h\"\n#include <sstream>\n\nvoid gf_freeSBMLModel(gf_SBMLModel* lo) {\n if(!lo)\n AN(0, \"Not a valid layout pointer\"); \/\/null\n SBMLDocument* doc = (SBMLDocument*)lo->pdoc;\n delete doc;\n free(lo);\n}\n\nextern \"C\" gf_SBMLModel* gf_loadSBMLbuf(const char* buf) {\n gf_SBMLModel* r=(gf_SBMLModel*)malloc(sizeof(gf_SBMLModel));\n SBMLReader reader;\n SBMLDocument* doc = reader.readSBMLFromString(buf);\n \n AN(doc, \"Failed to parse SBML\"); \/\/not libSBML's documented way of failing, but just in case...\n \n if(doc->getNumErrors()) {\n #if SAGITTARIUS_DEBUG_LEVEL >= 2\n fprintf(stderr, \"Failed to parse SBML\\n\");\n for(unsigned int i=0; i<doc->getNumErrors(); ++i) {\n std::cerr << \"Error \" << i << \": \" <<doc->getError(i)->getMessage() << \"\\n\";\n }\n std::stringstream ss;\n ss << \"Failed to parse SBML\\n\";\n for(unsigned int i=0; i<doc->getNumErrors(); ++i) {\n ss << \"Error \" << i << \": \" <<doc->getError(i)->getMessage() << \"\\n\";\n }\n gf_setError(ss.str().c_str());\n #endif\n \/\/ if all are warnings, continue - else abort\n for(unsigned int i=0; i<doc->getNumErrors(); ++i) {\n if (!doc->getError(i)->isWarning())\n return NULL;\n }\n }\n \n r->pdoc = doc;\n return r;\n}\n\nextern \"C\" gf_SBMLModel* gf_loadSBMLfile(const char* path) {\n char* buf;\n size_t size=0;\n FILE* file=NULL;\n size_t bytes_read;\n \n #if SAGITTARIUS_DEBUG_LEVEL >= 2\n\/\/ fprintf(stderr, \"Specified file is %s\\n\", path);\n #endif\n file = fopen(path, \"rb\");\n if(!file)\n {\n #if SAGITTARIUS_DEBUG_LEVEL >= 2\n fprintf(stderr, \"Failed to open file\\n\"); \/\/ Assert elided on release build, which we have to use thanks to libsbml\n #endif\n return NULL;\n }\n \/\/get t3h s!z3\n fseek(file, 0, SEEK_END);\n size = ftell(file);\n rewind(file);\n #if SAGITTARIUS_DEBUG_LEVEL >= 2\n\/\/ fprintf(stderr, \"File size is %lu\\n\", size);\n #endif\n assert(size > 0);\n \n \/\/allocated buffer\n assert(sizeof(char) == 1 && \"char must be one byte wide\");\n buf=(char*)malloc(size+1); \/\/one extra byte for null char\n assert(buf && \"Failed to allocate buffer\");\n \/\/read the whole file at once\n bytes_read = fread(buf, 1, size, file);\n assert(bytes_read == size && \"Failed to read whole file (wrong size specified?)\");\n \/\/trip EOF indicator\n fgetc(file);\n assert(feof(file) && \"EOF Expected\");\n buf[size] = '\\0'; \/\/terminating null char\n \n \/*close*\/\n fclose(file);\n \n gf_SBMLModel* mod = gf_loadSBMLbuf(buf);\n \n free(buf);\n \n return mod;\n}\n\n\n<commit_msg>add more error checking to gf_loadSBMLfile<commit_after>\/*== SAGITTARIUS =====================================================================\n * Copyright (c) 2012, Jesse K Medley\n * All rights 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 University of Washington nor the\n names of its contributors may be used to endorse or promote products\n derived from this software without specific prior written permission.\n\n * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS \"AS IS\" AND\n * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED\n * WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE\n * DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDERS OR ANYONE DISTRIBUTING THE SOFTWARE\n * BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL \n * DAMAGES (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\/\/== BEGINNING OF CODE ===============================================================\n\n\/\/== INCLUDES ========================================================================\n\n#include \"graphfab\/core\/SagittariusCore.h\"\n#include \"graphfab\/sbml\/autolayoutSBML.h\"\n#include \"graphfab\/diag\/error.h\"\n\n#include \"sbml\/SBMLTypes.h\"\n#include <sstream>\n\nvoid gf_freeSBMLModel(gf_SBMLModel* lo) {\n if(!lo)\n AN(0, \"Not a valid layout pointer\"); \/\/null\n SBMLDocument* doc = (SBMLDocument*)lo->pdoc;\n delete doc;\n free(lo);\n}\n\nextern \"C\" gf_SBMLModel* gf_loadSBMLbuf(const char* buf) {\n gf_SBMLModel* r=(gf_SBMLModel*)malloc(sizeof(gf_SBMLModel));\n SBMLReader reader;\n SBMLDocument* doc = reader.readSBMLFromString(buf);\n \n AN(doc, \"Failed to parse SBML\"); \/\/not libSBML's documented way of failing, but just in case...\n \n if(doc->getNumErrors()) {\n #if SAGITTARIUS_DEBUG_LEVEL >= 2\n fprintf(stderr, \"Failed to parse SBML\\n\");\n for(unsigned int i=0; i<doc->getNumErrors(); ++i) {\n std::cerr << \"Error \" << i << \": \" <<doc->getError(i)->getMessage() << \"\\n\";\n }\n std::stringstream ss;\n ss << \"Failed to parse SBML\\n\";\n for(unsigned int i=0; i<doc->getNumErrors(); ++i) {\n ss << \"Error \" << i << \": \" <<doc->getError(i)->getMessage() << \"\\n\";\n }\n gf_setError(ss.str().c_str());\n #endif\n \/\/ if all are warnings, continue - else abort\n for(unsigned int i=0; i<doc->getNumErrors(); ++i) {\n if (!doc->getError(i)->isWarning())\n return NULL;\n }\n }\n \n r->pdoc = doc;\n return r;\n}\n\nextern \"C\" gf_SBMLModel* gf_loadSBMLfile(const char* path) {\n char* buf;\n size_t size=0;\n FILE* file=NULL;\n size_t bytes_read;\n\n try {\n\n file = fopen(path, \"rb\");\n if(!file)\n SBNW_THROW(InternalCheckFailureException, \"Failed to open file\", \"gf_loadSBMLfile\");\n\n \/\/get t3h s!z3\n fseek(file, 0, SEEK_END);\n size = ftell(file);\n rewind(file);\n #if SAGITTARIUS_DEBUG_LEVEL >= 2\n \/\/ fprintf(stderr, \"File size is %lu\\n\", size);\n #endif\n assert(size > 0);\n\n \/\/allocated buffer\n if (sizeof(char) != 1)\n SBNW_THROW(InternalCheckFailureException, \"char must be one byte wide\", \"gf_loadSBMLfile\");\n buf=(char*)malloc(size+1); \/\/one extra byte for null char\n if (!buf)\n SBNW_THROW(InternalCheckFailureException, \"Failed to allocate buffer\", \"gf_loadSBMLfile\");\n \/\/read the whole file at once\n bytes_read = fread(buf, 1, size, file);\n if (bytes_read != size)\n SBNW_THROW(InternalCheckFailureException, \"Failed to read whole file (wrong size specified?)\", \"gf_loadSBMLfile\");\n \/\/trip EOF indicator\n fgetc(file);\n if (!feof(file))\n SBNW_THROW(InternalCheckFailureException, \"EOF Expected\", \"gf_loadSBMLfile\");\n buf[size] = '\\0'; \/\/terminating null char\n\n \/*close*\/\n fclose(file);\n\n gf_SBMLModel* mod = gf_loadSBMLbuf(buf);\n\n free(buf);\n\n return mod;\n\n } catch (const Exception& e) {\n gf_setError( e.getReport().c_str() );\n return NULL;\n }\n}\n\n\n<|endoftext|>"} {"text":"<commit_before>\/******************************************************************************\n * This file is part of the Gluon Development Platform\n * Copyright (C) 2008 Sacha Schutz <istdasklar@free.fr>\n * Copyright (C) 2008 Olivier Gueudelot <gueudelotolive@gmail.com>\n * Copyright (C) 2008 Charles Huet <packadal@gmail.com>\n * Copyright (c) 2010 Arjen Hiemstra <ahiemstra@heimr.nl>\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 \"graphics\/material.h\"\n#include \"graphics\/manager.h\"\n#include \"graphics\/renderwidget.h\"\n\n#include <QtGui\/QApplication>\n#include <shader.h>\n#include <backend.h>\n\nint main( int argc, char* argv[] )\n{\n QApplication app( argc, argv );\n\n \/\/GluonGraphics::RenderWidget widget;\n \/\/widget.show();\n\n \/\/GluonGraphics::Material* mat = new GluonGraphics::Material();\n \/\/GluonGraphics::Material* mat = GluonGraphics::Manager::instance()->createResource< GluonGraphics::Material >( \"Main\" );\n \/\/createResource< GluonGraphics::Material >( \"Main\" );\n \/\/GluonGraphics::Manager::instance()->destroyResource< GluonGraphics::Material >( \"Main\" );\n \/\/qDebug() << GluonGraphics::Manager::instance()->backend( widget )->information( GluonGraphics::Backend::VerboseInformation );\n\n GluonGraphics::RenderWidget widget;\n widget.show();\n \/\/app.exec();\n\n \/\/delete widget;\n\n \/\/Create a widget to render the graphics on.\n\/\/ GluonGraphics::RenderWidget* widget = new GluonGraphics::RenderWidget();\n\/\/ widget->show();\n\n\/\/ GluonGraphics::World* world = GluonGraphics::Manager::instance()->createWorld();\n\n \/\/Create a camera to view the scene from.\n\/\/ GluonGraphics::Camera* cam = world->createEntity< GluonGraphics::Camera* >();\n\n \/\/Set the viewport\n\/\/ cam->frustrum()->setOrthographic( -5.f, 5.f, -5.f, 5.f, -5.f, 5.f );\n\n \/\/Activate the new camera\n \/\/GluonGraphics::Manager::instance()->setActiveCamera( cam );\n\n \/\/Create an item to display\n\/\/ GluonGraphics::Item* item = GluonGraphics::Engine::instance()->createItem( \"default\" );\n\/\/\n\/\/ QMatrix4x4 mat;\n\/\/ mat.translate( -1.5f, -1.5f );\n\/\/ item->setTransform( mat );\n\/\/\n\/\/ item = GluonGraphics::Engine::instance()->createItem( \"default\" );\n\/\/ mat.translate( 3.f, 3.f );\n\/\/ item->setTransform( mat );\n\/\/\n\/\/ QTimer::singleShot( 0, widget, SLOT(updateGL()) );\n\/\/ return app.exec();\n\n app.exec();\n}\n<commit_msg>Create and load a texture in the example.<commit_after>\/******************************************************************************\n * This file is part of the Gluon Development Platform\n * Copyright (C) 2008 Sacha Schutz <istdasklar@free.fr>\n * Copyright (C) 2008 Olivier Gueudelot <gueudelotolive@gmail.com>\n * Copyright (C) 2008 Charles Huet <packadal@gmail.com>\n * Copyright (c) 2010 Arjen Hiemstra <ahiemstra@heimr.nl>\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 \"graphics\/material.h\"\n#include \"graphics\/manager.h\"\n#include \"graphics\/renderwidget.h\"\n\n#include <QtGui\/QApplication>\n#include <shader.h>\n#include <backend.h>\n#include <texture.h>\n#include <core\/directoryprovider.h>\n\nint main( int argc, char* argv[] )\n{\n QApplication app( argc, argv );\n\n \/\/GluonGraphics::RenderWidget widget;\n \/\/widget.show();\n\n \/\/GluonGraphics::Material* mat = new GluonGraphics::Material();\n \/\/GluonGraphics::Material* mat = GluonGraphics::Manager::instance()->createResource< GluonGraphics::Material >( \"Main\" );\n \/\/createResource< GluonGraphics::Material >( \"Main\" );\n \/\/GluonGraphics::Manager::instance()->destroyResource< GluonGraphics::Material >( \"Main\" );\n \/\/qDebug() << GluonGraphics::Manager::instance()->backend( widget )->information( GluonGraphics::Backend::VerboseInformation );\n GluonGraphics::RenderWidget widget;\n widget.show();\n \/\/app.exec();\n\n GluonGraphics::Texture* texture = GluonGraphics::Manager::instance()->createResource< GluonGraphics::Texture >( \"test\" );\n texture->load( GluonCore::DirectoryProvider::instance()->dataDirectory() + \"\/gluon\/defaults\/default.png\" );\n\n \/\/delete widget;\n\n \/\/Create a widget to render the graphics on.\n\/\/ GluonGraphics::RenderWidget* widget = new GluonGraphics::RenderWidget();\n\/\/ widget->show();\n\n\/\/ GluonGraphics::World* world = GluonGraphics::Manager::instance()->createWorld();\n\n \/\/Create a camera to view the scene from.\n\/\/ GluonGraphics::Camera* cam = world->createEntity< GluonGraphics::Camera* >();\n\n \/\/Set the viewport\n\/\/ cam->frustrum()->setOrthographic( -5.f, 5.f, -5.f, 5.f, -5.f, 5.f );\n\n \/\/Activate the new camera\n \/\/GluonGraphics::Manager::instance()->setActiveCamera( cam );\n\n \/\/Create an item to display\n\/\/ GluonGraphics::Item* item = GluonGraphics::Engine::instance()->createItem( \"default\" );\n\/\/\n\/\/ QMatrix4x4 mat;\n\/\/ mat.translate( -1.5f, -1.5f );\n\/\/ item->setTransform( mat );\n\/\/\n\/\/ item = GluonGraphics::Engine::instance()->createItem( \"default\" );\n\/\/ mat.translate( 3.f, 3.f );\n\/\/ item->setTransform( mat );\n\/\/\n\/\/ QTimer::singleShot( 0, widget, SLOT(updateGL()) );\n\/\/ return app.exec();\n\n app.exec();\n}\n<|endoftext|>"} {"text":"<commit_before>\/**\n * The MIT License (MIT)\n *\n * Copyright (c) 2016 Brad van der Laan\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 <QCoreApplication>\n#include <QFileInfo>\n#include <functional>\n#include \"CommandLineInterface.hpp\"\n#include \"InputArgument.hpp\"\n\nusing namespace Taranis;\nusing action_callback = std::function<void(QVariant)>;\n\nconst QString CommandLineInterface::VERSIONARGUMENT = \"version\";\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nCommandLineInterface::CommandLineInterface(const QString applicationName, QStringList arguments, QStringList acceptedArgumentPrefixes)\n : m_applicationName(applicationName),\n m_inputArguments( arguments ),\n m_acceptedArgumentPrefixs( acceptedArgumentPrefixes )\n{\n addHelpArguments();\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nCommandLineInterface::~CommandLineInterface()\n{\n\/\/ qDeleteAll( m_arguments );\n m_arguments.clear();\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nQString CommandLineInterface::name() const\n{\n return m_applicationName;\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nQString CommandLineInterface::version() const\n{\n return m_version;\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nQString CommandLineInterface::description() const\n{\n return m_description;\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nQStringList CommandLineInterface::arguments() const\n{\n return m_arguments.keys();\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nCommandLineInterface& CommandLineInterface::process()\n{\n foreach( QString a, m_inputArguments )\n {\n InputArgument arg( a, m_acceptedArgumentPrefixs );\n if ( arg.isValid() )\n {\n QString key = arg.name().toLower();\n if ( m_arguments.contains( key ) )\n {\n m_arguments[key]->callback()(arg.value());\n }\n }\n }\n return *this;\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nQVariant CommandLineInterface::operator[](const QString key) const\n{\n if ( m_arguments.contains(key) )\n {\n return m_arguments[key]->value();\n }\n else\n {\n return QVariant();\n }\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nCommandLineInterfaceBuilder CommandLineInterface::build()\n{\n return CommandLineInterfaceBuilder();\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nvoid CommandLineInterface::addArgument(Argument* arg)\n{\n m_arguments[arg->name()] = arg;\n if ( arg->hasShortName() )\n {\n m_arguments[arg->shortName()] = arg;\n }\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nvoid CommandLineInterface::setVersion(const QString version)\n{\n m_version = version;\n if ( m_version.isEmpty() )\n {\n delete m_arguments.value(VERSIONARGUMENT);\n m_arguments.remove(VERSIONARGUMENT);\n }\n else\n {\n action_callback versionCallback = std::bind( &CommandLineInterface::doVersionAction, this );\n addArgument( new Argument( VERSIONARGUMENT, \"Display version information and exit\", ArgumentType::Action, versionCallback) );\n }\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nvoid CommandLineInterface::setName(const QString name)\n{\n m_applicationName = name;\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nvoid CommandLineInterface::setDescription(const QString description)\n{\n m_description = description;\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nvoid CommandLineInterface::addHelpArguments()\n{\n action_callback helpCallback = std::bind( &CommandLineInterface::doHelpAction, this );\n addArgument( new Argument( \"help\", \"Display this help and exit\", ArgumentType::Action, helpCallback) );\n addArgument( new Argument( \"?\", \"Display this help and exit\", ArgumentType::Action, helpCallback) );\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nvoid CommandLineInterface::setValue(const QString key, const QVariant value)\n{\n if ( m_arguments.contains(key) )\n {\n m_arguments[key]->setValue(value);\n }\n else\n {\n Q_ASSERT_X( false, \"CommandLineInterface::setValue\", QString(\"No argument with name %1\").arg(key).toLatin1().data() );\n }\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nQString CommandLineInterface::helpMessage() const\n{\n QString applicationExecutable = QFileInfo( QCoreApplication::applicationFilePath() ).fileName();\n QString message = generateTitle();\n\n if ( !message.isEmpty() )\n {\n message += QString(message.length()-1, '=') + QStringLiteral(\"\\n\");\n }\n\n if ( !m_description.isEmpty() )\n {\n message += m_description + QStringLiteral(\"\\n\\n\");\n }\n\n message += QString(\"Usage: %1 [OPTION]\\n\\n\").arg(applicationExecutable);\n\n QStringList filterArgumentAliases;\n foreach( Argument* arg, m_arguments.values() )\n {\n if ( filterArgumentAliases.contains( arg->name() ) ) continue;\n if ( arg->hasShortName() )\n {\n message += QString( \" -%1, --%2\").arg(arg->shortName()).arg(arg->name());\n }\n else\n {\n message += QString( \" -%1\").arg(arg->name());\n }\n\n message += QString(\"\\t%1\\n\").arg(arg->description());\n filterArgumentAliases.append( arg->name());\n }\n return message;\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nQString CommandLineInterface::generateTitle() const\n{\n QString message;\n if ( !m_applicationName.isEmpty() && !m_version.isEmpty() )\n {\n message += QString(\"%1 - Version %2\\n\").arg(m_applicationName).arg(m_version);\n }\n else if ( !m_applicationName.isEmpty() )\n {\n message += QString(\"%1\\n\").arg(m_applicationName);\n }\n else if ( !m_version.isEmpty() )\n {\n message += QString(\"Version %1\\n\").arg(m_version);\n }\n\n return message;\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nvoid CommandLineInterface::doHelpAction() const\n{\n printf( \"%s\", helpMessage().toLatin1().data() );\n QCoreApplication::exit(0);\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nvoid CommandLineInterface::doVersionAction() const\n{\n printf( \"%s\", generateTitle().toLatin1().data() );\n QCoreApplication::exit(0);\n}\n<commit_msg>Change QCoreApplication::exit(0) to just exit(0) for the doVersion and doHelp methods. I didn't think about it, but the CommandLineInterface will process the doVersion and doHelp methods _before_ the event loop is spun up. QCoreApplication::exit(int) only terminates the event loop and since we typically spin up the event loop like 'return app.exec();' that would terminate the application. However these methods are executed before the event loop is spun up so if we really want the application to terminate after they are processed we need to call the standard exit(int) method instead which does explicitly terminate the applicaiton.<commit_after>\/**\n * The MIT License (MIT)\n *\n * Copyright (c) 2016 Brad van der Laan\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 <QCoreApplication>\n#include <QFileInfo>\n#include <functional>\n#include \"CommandLineInterface.hpp\"\n#include \"InputArgument.hpp\"\n\nusing namespace Taranis;\nusing action_callback = std::function<void(QVariant)>;\n\nconst QString CommandLineInterface::VERSIONARGUMENT = \"version\";\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nCommandLineInterface::CommandLineInterface(const QString applicationName, QStringList arguments, QStringList acceptedArgumentPrefixes)\n : m_applicationName(applicationName),\n m_inputArguments( arguments ),\n m_acceptedArgumentPrefixs( acceptedArgumentPrefixes )\n{\n addHelpArguments();\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nCommandLineInterface::~CommandLineInterface()\n{\n\/\/ qDeleteAll( m_arguments );\n m_arguments.clear();\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nQString CommandLineInterface::name() const\n{\n return m_applicationName;\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nQString CommandLineInterface::version() const\n{\n return m_version;\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nQString CommandLineInterface::description() const\n{\n return m_description;\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nQStringList CommandLineInterface::arguments() const\n{\n return m_arguments.keys();\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nCommandLineInterface& CommandLineInterface::process()\n{\n foreach( QString a, m_inputArguments )\n {\n InputArgument arg( a, m_acceptedArgumentPrefixs );\n if ( arg.isValid() )\n {\n QString key = arg.name().toLower();\n if ( m_arguments.contains( key ) )\n {\n m_arguments[key]->callback()(arg.value());\n }\n }\n }\n return *this;\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nQVariant CommandLineInterface::operator[](const QString key) const\n{\n if ( m_arguments.contains(key) )\n {\n return m_arguments[key]->value();\n }\n else\n {\n return QVariant();\n }\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nCommandLineInterfaceBuilder CommandLineInterface::build()\n{\n return CommandLineInterfaceBuilder();\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nvoid CommandLineInterface::addArgument(Argument* arg)\n{\n m_arguments[arg->name()] = arg;\n if ( arg->hasShortName() )\n {\n m_arguments[arg->shortName()] = arg;\n }\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nvoid CommandLineInterface::setVersion(const QString version)\n{\n m_version = version;\n if ( m_version.isEmpty() )\n {\n delete m_arguments.value(VERSIONARGUMENT);\n m_arguments.remove(VERSIONARGUMENT);\n }\n else\n {\n action_callback versionCallback = std::bind( &CommandLineInterface::doVersionAction, this );\n addArgument( new Argument( VERSIONARGUMENT, \"Display version information and exit\", ArgumentType::Action, versionCallback) );\n }\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nvoid CommandLineInterface::setName(const QString name)\n{\n m_applicationName = name;\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nvoid CommandLineInterface::setDescription(const QString description)\n{\n m_description = description;\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nvoid CommandLineInterface::addHelpArguments()\n{\n action_callback helpCallback = std::bind( &CommandLineInterface::doHelpAction, this );\n addArgument( new Argument( \"help\", \"Display this help and exit\", ArgumentType::Action, helpCallback) );\n addArgument( new Argument( \"?\", \"Display this help and exit\", ArgumentType::Action, helpCallback) );\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nvoid CommandLineInterface::setValue(const QString key, const QVariant value)\n{\n if ( m_arguments.contains(key) )\n {\n m_arguments[key]->setValue(value);\n }\n else\n {\n Q_ASSERT_X( false, \"CommandLineInterface::setValue\", QString(\"No argument with name %1\").arg(key).toLatin1().data() );\n }\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nQString CommandLineInterface::helpMessage() const\n{\n QString applicationExecutable = QFileInfo( QCoreApplication::applicationFilePath() ).fileName();\n QString message = generateTitle();\n\n if ( !message.isEmpty() )\n {\n message += QString(message.length()-1, '=') + QStringLiteral(\"\\n\");\n }\n\n if ( !m_description.isEmpty() )\n {\n message += m_description + QStringLiteral(\"\\n\\n\");\n }\n\n message += QString(\"Usage: %1 [OPTION]\\n\\n\").arg(applicationExecutable);\n\n QStringList filterArgumentAliases;\n foreach( Argument* arg, m_arguments.values() )\n {\n if ( filterArgumentAliases.contains( arg->name() ) ) continue;\n if ( arg->hasShortName() )\n {\n message += QString( \" -%1, --%2\").arg(arg->shortName()).arg(arg->name());\n }\n else\n {\n message += QString( \" -%1\").arg(arg->name());\n }\n\n message += QString(\"\\t%1\\n\").arg(arg->description());\n filterArgumentAliases.append( arg->name());\n }\n return message;\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nQString CommandLineInterface::generateTitle() const\n{\n QString message;\n if ( !m_applicationName.isEmpty() && !m_version.isEmpty() )\n {\n message += QString(\"%1 - Version %2\\n\").arg(m_applicationName).arg(m_version);\n }\n else if ( !m_applicationName.isEmpty() )\n {\n message += QString(\"%1\\n\").arg(m_applicationName);\n }\n else if ( !m_version.isEmpty() )\n {\n message += QString(\"Version %1\\n\").arg(m_version);\n }\n\n return message;\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nvoid CommandLineInterface::doHelpAction() const\n{\n printf( \"%s\", helpMessage().toLatin1().data() );\n exit(0);\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nvoid CommandLineInterface::doVersionAction() const\n{\n printf( \"%s\", generateTitle().toLatin1().data() );\n exit(0);\n}\n<|endoftext|>"} {"text":"<commit_before>\/**\n * @file column_types_test.cpp\n * @date 09.01.2015\n * @author mkoenig\n *\/\n\n#include \"pydbc\/column_types.h\"\n\n#include <cppunit\/extensions\/HelperMacros.h>\n#include <cppunit_toolbox\/helpers\/is_abstract_base_class.h>\n\n#include \"mock_classes.h\"\n#include <sqlext.h>\n\n\nclass column_types_test : public CppUnit::TestFixture {\nCPPUNIT_TEST_SUITE( column_types_test );\n\n\tCPPUNIT_TEST( long_column_bound_on_construction );\n\tCPPUNIT_TEST( string_column_bound_on_construction );\n\nCPPUNIT_TEST_SUITE_END();\n\npublic:\n\n\tvoid long_column_bound_on_construction();\n\tvoid string_column_bound_on_construction();\n\n};\n\n\/\/ Registers the fixture with the 'registry'\nCPPUNIT_TEST_SUITE_REGISTRATION( column_types_test );\n\nusing pydbc_test::mock_statement;\n\nvoid column_types_test::long_column_bound_on_construction()\n{\n\tstd::size_t const column_index = 42;\n\tauto const buffer_type = SQL_C_SBIGINT;\n\tmock_statement statement;\n\n\tEXPECT_CALL(statement, do_bind_column(column_index, buffer_type, testing::_)).Times(1);\n\tpydbc::long_column column(statement, column_index);\n}\n\nvoid column_types_test::string_column_bound_on_construction()\n{\n\tstd::size_t const column_index = 42;\n\tauto const buffer_type = SQL_CHAR;\n\tmock_statement statement;\n\n\tEXPECT_CALL(statement, do_bind_column(column_index, buffer_type, testing::_)).Times(1);\n\tpydbc::string_column column(statement, column_index);\n}\n\n<commit_msg>Improved on column types tests<commit_after>\/**\n * @file column_types_test.cpp\n * @date 09.01.2015\n * @author mkoenig\n *\/\n\n#include \"pydbc\/column_types.h\"\n\n#include <cppunit\/extensions\/HelperMacros.h>\n#include <cppunit_toolbox\/helpers\/is_abstract_base_class.h>\n\n#include \"mock_classes.h\"\n#include <sqlext.h>\n#include <boost\/variant\/get.hpp>\n#include <cstring>\n\n\nclass column_types_test : public CppUnit::TestFixture {\nCPPUNIT_TEST_SUITE( column_types_test );\n\n\tCPPUNIT_TEST( long_column_get_field );\n\tCPPUNIT_TEST( string_column_get_field );\n\nCPPUNIT_TEST_SUITE_END();\n\npublic:\n\n\tvoid long_column_get_field();\n\tvoid string_column_get_field();\n\n};\n\n\/\/ Registers the fixture with the 'registry'\nCPPUNIT_TEST_SUITE_REGISTRATION( column_types_test );\n\nusing pydbc_test::mock_statement;\n\n\nnamespace {\n\t\/**\n\t* Change the address of the given target_pointer to point to the third argument of the mocked function\n\t*\/\n\tACTION_P(store_pointer_to_buffer_in, target_pointer) {\n\t\t*target_pointer = &arg2;\n\t}\n\n\tstd::size_t const column_index = 42;\n}\n\n\nnamespace {\n\tvoid fill_buffer_with_value(cpp_odbc::multi_value_buffer & buffer, long value)\n\t{\n\t\tauto element = buffer[0];\n\t\tmemcpy(element.data_pointer, &value, sizeof(long));\n\t\telement.indicator = sizeof(long);\n\t}\n}\n\nvoid column_types_test::long_column_get_field()\n{\n\tlong const expected = 12345;\n\tauto const buffer_type = SQL_C_SBIGINT;\n\tmock_statement statement;\n\n\tcpp_odbc::multi_value_buffer * buffer = nullptr;\n\tEXPECT_CALL(statement, do_bind_column(column_index, buffer_type, testing::_))\n\t\t.WillOnce(store_pointer_to_buffer_in(&buffer));\n\n\tpydbc::long_column column(statement, column_index);\n\tCPPUNIT_ASSERT( buffer != nullptr);\n\n\tfill_buffer_with_value(*buffer, expected);\n\tCPPUNIT_ASSERT_EQUAL(expected, boost::get<long>(column.get_field()));\n}\n\n\nnamespace {\n\tvoid fill_buffer_with_value(cpp_odbc::multi_value_buffer & buffer, std::string const & value)\n\t{\n\t\tauto element = buffer[0];\n\t\tmemcpy(element.data_pointer, value.data(), value.size() + 1);\n\t\telement.indicator = value.size();\n\t}\n}\n\nvoid column_types_test::string_column_get_field()\n{\n\tstd::string const expected(\"this is a test string\");\n\tauto const buffer_type = SQL_CHAR;\n\tmock_statement statement;\n\n\tcpp_odbc::multi_value_buffer * buffer = nullptr;\n\tEXPECT_CALL(statement, do_bind_column(column_index, buffer_type, testing::_))\n\t\t.WillOnce(store_pointer_to_buffer_in(&buffer));\n\n\tpydbc::string_column column(statement, column_index);\n\tCPPUNIT_ASSERT( buffer != nullptr);\n\n\tfill_buffer_with_value(*buffer, expected);\n\tCPPUNIT_ASSERT_EQUAL(expected, boost::get<std::string>(column.get_field()));\n}\n\n<|endoftext|>"} {"text":"<commit_before>\/\/===- Interpreter.cpp - Top-Level LLVM Interpreter Implementation --------===\/\/\n\/\/\n\/\/ This file implements the top-level functionality for the LLVM interpreter.\n\/\/ This interpreter is designed to be a very simple, portable, inefficient\n\/\/ interpreter.\n\/\/\n\/\/===----------------------------------------------------------------------===\/\/\n\n#include \"Interpreter.h\"\n#include \"llvm\/Target\/TargetMachineImpls.h\"\n\n\/\/\/ createInterpreter - Create a new interpreter object. This can never fail.\n\/\/\/\nExecutionEngine *ExecutionEngine::createInterpreter(Module *M,\n\t\t\t\t\t\t unsigned Config,\n\t\t\t\t\t\t bool DebugMode,\n\t\t\t\t\t\t bool TraceMode) {\n return new Interpreter(M, Config, DebugMode, TraceMode);\n}\n\n\/\/===----------------------------------------------------------------------===\/\/\n\/\/ Interpreter ctor - Initialize stuff\n\/\/\nInterpreter::Interpreter(Module *M, unsigned Config,\n\t\t\t bool DebugMode, bool TraceMode)\n : ExecutionEngine(M), ExitCode(0), Debug(DebugMode), Trace(TraceMode),\n CurFrame(-1), TD(\"lli\", (Config & TM::EndianMask) == TM::LittleEndian,\n\t\t 1, 4,\n\t\t (Config & TM::PtrSizeMask) == TM::PtrSize64 ? 8 : 4,\n\t\t (Config & TM::PtrSizeMask) == TM::PtrSize64 ? 8 : 4) {\n\n setTargetData(TD);\n \/\/ Initialize the \"backend\"\n initializeExecutionEngine();\n initializeExternalMethods();\n CW.setModule(M); \/\/ Update Writer\n}\n\n\/\/\/ run - Start execution with the specified function and arguments.\n\/\/\/\nint Interpreter::run(const std::string &MainFunction,\n\t\t const std::vector<std::string> &Args) {\n \/\/ Start interpreter into the main function...\n \/\/\n if (!callMainMethod(MainFunction, Args) && !Debug) {\n \/\/ If not in debug mode and if the call succeeded, run the code now...\n run();\n }\n\n \/\/ If debug mode, allow the user to interact... also, if the user pressed \n \/\/ ctrl-c or execution hit an error, enter the event loop...\n if (Debug || isStopped())\n handleUserInput();\n return ExitCode;\n}\n\n<commit_msg>MAke sure that LLI properly configures align_of(double)<commit_after>\/\/===- Interpreter.cpp - Top-Level LLVM Interpreter Implementation --------===\/\/\n\/\/\n\/\/ This file implements the top-level functionality for the LLVM interpreter.\n\/\/ This interpreter is designed to be a very simple, portable, inefficient\n\/\/ interpreter.\n\/\/\n\/\/===----------------------------------------------------------------------===\/\/\n\n#include \"Interpreter.h\"\n#include \"llvm\/Target\/TargetMachineImpls.h\"\n\n\/\/\/ createInterpreter - Create a new interpreter object. This can never fail.\n\/\/\/\nExecutionEngine *ExecutionEngine::createInterpreter(Module *M,\n\t\t\t\t\t\t unsigned Config,\n\t\t\t\t\t\t bool DebugMode,\n\t\t\t\t\t\t bool TraceMode) {\n return new Interpreter(M, Config, DebugMode, TraceMode);\n}\n\n\/\/===----------------------------------------------------------------------===\/\/\n\/\/ Interpreter ctor - Initialize stuff\n\/\/\nInterpreter::Interpreter(Module *M, unsigned Config,\n\t\t\t bool DebugMode, bool TraceMode)\n : ExecutionEngine(M), ExitCode(0), Debug(DebugMode), Trace(TraceMode),\n CurFrame(-1), TD(\"lli\", (Config & TM::EndianMask) == TM::LittleEndian,\n\t\t 1, 4,\n\t\t (Config & TM::PtrSizeMask) == TM::PtrSize64 ? 8 : 4,\n\t\t (Config & TM::PtrSizeMask) == TM::PtrSize64 ? 8 : 4,\n\t\t (Config & TM::PtrSizeMask) == TM::PtrSize64 ? 8 : 4) {\n\n setTargetData(TD);\n \/\/ Initialize the \"backend\"\n initializeExecutionEngine();\n initializeExternalMethods();\n CW.setModule(M); \/\/ Update Writer\n}\n\n\/\/\/ run - Start execution with the specified function and arguments.\n\/\/\/\nint Interpreter::run(const std::string &MainFunction,\n\t\t const std::vector<std::string> &Args) {\n \/\/ Start interpreter into the main function...\n \/\/\n if (!callMainMethod(MainFunction, Args) && !Debug) {\n \/\/ If not in debug mode and if the call succeeded, run the code now...\n run();\n }\n\n \/\/ If debug mode, allow the user to interact... also, if the user pressed \n \/\/ ctrl-c or execution hit an error, enter the event loop...\n if (Debug || isStopped())\n handleUserInput();\n return ExitCode;\n}\n\n<|endoftext|>"} {"text":"<commit_before>\/\/===------- MandatoryCombiner.cpp ----------------------------------------===\/\/\n\/\/\n\/\/ This source file is part of the Swift.org open source project\n\/\/\n\/\/ Copyright (c) 2014 - 2019 Apple Inc. and the Swift project authors\n\/\/ Licensed under Apache License v2.0 with Runtime Library Exception\n\/\/\n\/\/ See https:\/\/swift.org\/LICENSE.txt for license information\n\/\/ See https:\/\/swift.org\/CONTRIBUTORS.txt for the list of Swift project authors\n\/\/\n\/\/===----------------------------------------------------------------------===\/\/\n\/\/\/\n\/\/\/ \\file\n\/\/\/\n\/\/\/ Defines the MandatoryCombiner function transform. The pass contains basic\n\/\/\/ instruction combines to be performed at the begining of both the Onone and\n\/\/\/ also the performance pass pipelines, after the diagnostics passes have been\n\/\/\/ run. It is intended to be run before and to be independent of other\n\/\/\/ transforms.\n\/\/\/\n\/\/\/ The intention of this pass is to be a place for mandatory peepholes that\n\/\/\/ are not needed for diagnostics. Please put any such peepholes here instead\n\/\/\/ of in the diagnostic passes.\n\/\/\/\n\/\/===----------------------------------------------------------------------===\/\/\n\n#define DEBUG_TYPE \"sil-mandatory-combiner\"\n#include \"swift\/Basic\/LLVM.h\"\n#include \"swift\/Basic\/STLExtras.h\"\n#include \"swift\/SIL\/SILInstructionWorklist.h\"\n#include \"swift\/SIL\/SILVisitor.h\"\n#include \"swift\/SILOptimizer\/PassManager\/Passes.h\"\n#include \"swift\/SILOptimizer\/PassManager\/Transforms.h\"\n#include \"swift\/SILOptimizer\/Utils\/Local.h\"\n#include \"llvm\/ADT\/STLExtras.h\"\n#include \"llvm\/ADT\/Statistic.h\"\n#include \"llvm\/Support\/raw_ostream.h\"\n#include <algorithm>\n\nusing namespace swift;\n\nnamespace {\n\nclass MandatoryCombiner final\n : public SILInstructionVisitor<MandatoryCombiner, SILInstruction *> {\n\n using Worklist = SmallSILInstructionWorklist<256>;\n\n \/\/\/ The list of instructions remaining to visit, perhaps to combine.\n Worklist worklist;\n\n \/\/\/ Whether any changes have been made.\n bool madeChange;\n\n \/\/\/ The number of times that the worklist has been processed.\n unsigned iteration;\n\n InstModCallbacks instModCallbacks;\n SmallVectorImpl<SILInstruction *> &createdInstructions;\n SmallVector<SILInstruction *, 16> instructionsPendingDeletion;\n\npublic:\n MandatoryCombiner(\n SmallVectorImpl<SILInstruction *> &createdInstructions)\n : worklist(\"MC\"), madeChange(false), iteration(0),\n instModCallbacks(\n [&](SILInstruction *instruction) {\n worklist.erase(instruction);\n instructionsPendingDeletion.push_back(instruction);\n },\n [&](SILInstruction *instruction) { worklist.add(instruction); }),\n createdInstructions(createdInstructions){};\n\n \/\/\/ Base visitor that does not do anything.\n SILInstruction *visitSILInstruction(SILInstruction *) { return nullptr; }\n\n \/\/\/ \\returns whether all the values are of trivial type in the provided\n \/\/\/ function.\n template <typename Values>\n static bool areAllValuesTrivial(Values values, SILFunction &function) {\n return llvm::all_of(values, [&](SILValue value) -> bool {\n return value->getType().isTrivial(function);\n });\n }\n\n SILInstruction *visitApplyInst(ApplyInst *instruction) {\n \/\/ Apply this pass only to partial applies all of whose arguments are\n \/\/ trivial.\n auto calledValue = instruction->getCallee();\n if (calledValue == nullptr) {\n return nullptr;\n }\n auto fullApplyCallee = calledValue->getDefiningInstruction();\n if (fullApplyCallee == nullptr) {\n return nullptr;\n }\n auto partialApply = dyn_cast<PartialApplyInst>(fullApplyCallee);\n if (partialApply == nullptr) {\n return nullptr;\n }\n auto *function = partialApply->getCalleeFunction();\n if (function == nullptr) {\n return nullptr;\n }\n ApplySite fullApplySite(instruction);\n auto fullApplyArguments = fullApplySite.getArguments();\n if (!areAllValuesTrivial(fullApplyArguments, *function)) {\n return nullptr;\n }\n auto partialApplyArguments = ApplySite(partialApply).getArguments();\n if (!areAllValuesTrivial(partialApplyArguments, *function)) {\n return nullptr;\n }\n\n auto callee = partialApply->getCallee();\n\n ApplySite partialApplySite(partialApply);\n\n SmallVector<SILValue, 8> argsVec;\n llvm::copy(fullApplyArguments, std::back_inserter(argsVec));\n llvm::copy(partialApplyArguments, std::back_inserter(argsVec));\n\n SILBuilderWithScope builder(instruction, &createdInstructions);\n ApplyInst *replacement = builder.createApply(\n \/*Loc=*\/instruction->getDebugLocation().getLocation(), \/*Fn=*\/callee,\n \/*Subs=*\/partialApply->getSubstitutionMap(),\n \/*Args*\/ argsVec,\n \/*isNonThrowing=*\/instruction->isNonThrowing(),\n \/*SpecializationInfo=*\/partialApply->getSpecializationInfo());\n\n worklist.replaceInstructionWithInstruction(instruction, replacement\n#ifndef NDEBUG\n ,\n \/*instructionDescription=*\/\"\"\n#endif\n );\n tryDeleteDeadClosure(partialApply, instModCallbacks);\n return nullptr;\n }\n\n void addReachableCodeToWorklist(SILFunction &function) {\n SmallBlotSetVector<SILBasicBlock *, 32> blockWorklist;\n SmallBlotSetVector<SILBasicBlock *, 32> blocksVisited;\n SmallVector<SILInstruction *, 128> instructions;\n\n blockWorklist.insert(&*function.begin());\n while (!blockWorklist.empty()) {\n auto *block = blockWorklist.pop_back_val().getValueOr(nullptr);\n if (block == nullptr) {\n continue;\n }\n\n if (!blocksVisited.insert(block).second) {\n continue;\n }\n\n for (auto iterator = block->begin(), end = block->end(); iterator != end;) {\n auto *instruction = &*iterator;\n ++iterator;\n\n if (isInstructionTriviallyDead(instruction)) {\n continue;\n }\n\n instructions.push_back(instruction);\n }\n\n for_each(block->getSuccessorBlocks(), [&](SILBasicBlock *block) {\n blockWorklist.insert(block);\n });\n }\n\n worklist.addInitialGroup(instructions);\n }\n\n \/\/\/ \\return whether a change was made.\n bool doOneIteration(SILFunction &function, unsigned iteration) {\n madeChange = false;\n\n addReachableCodeToWorklist(function);\n\n while (!worklist.isEmpty()) {\n auto *instruction = worklist.pop_back_val();\n if (instruction == nullptr) {\n continue;\n }\n\n#ifndef NDEBUG\n std::string instructionDescription;\n#endif\n LLVM_DEBUG(llvm::raw_string_ostream SS(instructionDescription);\n instruction->print(SS); instructionDescription = SS.str(););\n LLVM_DEBUG(llvm::dbgs()\n << \"MC: Visiting: \" << instructionDescription << '\\n');\n\n if (auto replacement = visit(instruction)) {\n worklist.replaceInstructionWithInstruction(instruction, replacement\n#ifndef NDEBUG\n , instructionDescription\n#endif\n );\n }\n\n for (SILInstruction *instruction : instructionsPendingDeletion) {\n worklist.eraseInstFromFunction(*instruction);\n }\n instructionsPendingDeletion.clear();\n\n \/\/ Our tracking list has been accumulating instructions created by the\n \/\/ SILBuilder during this iteration. Go through the tracking list and add\n \/\/ its contents to the worklist and then clear said list in preparation\n \/\/ for the next iteration.\n for (SILInstruction *instruction : createdInstructions) {\n LLVM_DEBUG(llvm::dbgs() << \"MC: add \" << *instruction\n << \" from tracking list to worklist\\n\");\n worklist.add(instruction);\n }\n createdInstructions.clear();\n }\n\n worklist.resetChecked();\n return madeChange;\n }\n\n void clear() {\n iteration = 0;\n worklist.resetChecked();\n madeChange = false;\n }\n\n\n \/\/\/ Applies the MandatoryCombiner to the provided function.\n \/\/\/\n \/\/\/ \\param function the function to which to apply the MandatoryCombiner.\n \/\/\/\n \/\/\/ \\return whether a change was made.\n bool runOnFunction(SILFunction &function) {\n bool changed = false;\n\n while (doOneIteration(function, iteration)) {\n changed = true;\n ++iteration;\n }\n\n return changed;\n }\n};\n\n} \/\/ end anonymous namespace\n\n\/\/===----------------------------------------------------------------------===\/\/\n\/\/ Top Level Entrypoint\n\/\/===----------------------------------------------------------------------===\/\/\n\nnamespace {\n\nclass MandatoryCombine final : public SILFunctionTransform {\n\n SmallVector<SILInstruction *, 64> createdInstructions;\n\n void run() override {\n auto *function = getFunction();\n\n MandatoryCombiner combiner(createdInstructions);\n bool madeChange = combiner.runOnFunction(*function);\n\n if (madeChange) {\n invalidateAnalysis(SILAnalysis::InvalidationKind::Instructions);\n }\n }\n\n void handleDeleteNotification(SILNode *node) override {\n \/\/ Remove instructions that were both created and deleted from the list of\n \/\/ created instructions which will eventually be added to the worklist.\n\n auto *instruction = dyn_cast<SILInstruction>(node);\n if (instruction == nullptr) {\n return;\n }\n\n \/\/ Linear searching the tracking list doesn't hurt because usually it only\n \/\/ contains a few elements.\n auto iterator = find(createdInstructions, instruction);\n if (createdInstructions.end() != iterator) {\n createdInstructions.erase(iterator);\n }\n }\n\n bool needsNotifications() override { return true; }\n};\n\n} \/\/ end anonymous namespace\n\nSILTransform *swift::createMandatoryCombine() { return new MandatoryCombine(); }\n<commit_msg>[mandatory-combiner] Some small cleanups.<commit_after>\/\/===------- MandatoryCombiner.cpp ----------------------------------------===\/\/\n\/\/\n\/\/ This source file is part of the Swift.org open source project\n\/\/\n\/\/ Copyright (c) 2014 - 2019 Apple Inc. and the Swift project authors\n\/\/ Licensed under Apache License v2.0 with Runtime Library Exception\n\/\/\n\/\/ See https:\/\/swift.org\/LICENSE.txt for license information\n\/\/ See https:\/\/swift.org\/CONTRIBUTORS.txt for the list of Swift project authors\n\/\/\n\/\/===----------------------------------------------------------------------===\/\/\n\/\/\/\n\/\/\/ \\file\n\/\/\/\n\/\/\/ Defines the MandatoryCombiner function transform. The pass contains basic\n\/\/\/ instruction combines to be performed at the begining of both the Onone and\n\/\/\/ also the performance pass pipelines, after the diagnostics passes have been\n\/\/\/ run. It is intended to be run before and to be independent of other\n\/\/\/ transforms.\n\/\/\/\n\/\/\/ The intention of this pass is to be a place for mandatory peepholes that\n\/\/\/ are not needed for diagnostics. Please put any such peepholes here instead\n\/\/\/ of in the diagnostic passes.\n\/\/\/\n\/\/===----------------------------------------------------------------------===\/\/\n\n#define DEBUG_TYPE \"sil-mandatory-combiner\"\n#include \"swift\/Basic\/LLVM.h\"\n#include \"swift\/Basic\/STLExtras.h\"\n#include \"swift\/SIL\/SILInstructionWorklist.h\"\n#include \"swift\/SIL\/SILVisitor.h\"\n#include \"swift\/SILOptimizer\/PassManager\/Passes.h\"\n#include \"swift\/SILOptimizer\/PassManager\/Transforms.h\"\n#include \"swift\/SILOptimizer\/Utils\/Local.h\"\n#include \"llvm\/ADT\/STLExtras.h\"\n#include \"llvm\/ADT\/Statistic.h\"\n#include \"llvm\/Support\/raw_ostream.h\"\n#include <algorithm>\n\nusing namespace swift;\n\n\/\/===----------------------------------------------------------------------===\/\/\n\/\/ Utility\n\/\/===----------------------------------------------------------------------===\/\/\n\n\/\/\/ \\returns whether all the values are of trivial type in the provided\n\/\/\/ function.\ntemplate <typename Values>\nstatic bool areAllValuesTrivial(Values values, SILFunction &function) {\n return llvm::all_of(values, [&](SILValue value) -> bool {\n return value->getType().isTrivial(function);\n });\n}\n\n\/\/===----------------------------------------------------------------------===\/\/\n\/\/ MandatoryCombiner Interface\n\/\/===----------------------------------------------------------------------===\/\/\n\nnamespace {\n\nclass MandatoryCombiner final\n : public SILInstructionVisitor<MandatoryCombiner, SILInstruction *> {\n\n using Worklist = SmallSILInstructionWorklist<256>;\n\n \/\/\/ The list of instructions remaining to visit, perhaps to combine.\n Worklist worklist;\n\n \/\/\/ Whether any changes have been made.\n bool madeChange;\n\n \/\/\/ The number of times that the worklist has been processed.\n unsigned iteration;\n\n InstModCallbacks instModCallbacks;\n SmallVectorImpl<SILInstruction *> &createdInstructions;\n SmallVector<SILInstruction *, 16> instructionsPendingDeletion;\n\npublic:\n MandatoryCombiner(\n SmallVectorImpl<SILInstruction *> &createdInstructions)\n : worklist(\"MC\"), madeChange(false), iteration(0),\n instModCallbacks(\n [&](SILInstruction *instruction) {\n worklist.erase(instruction);\n instructionsPendingDeletion.push_back(instruction);\n },\n [&](SILInstruction *instruction) { worklist.add(instruction); }),\n createdInstructions(createdInstructions){};\n\n void addReachableCodeToWorklist(SILFunction &function);\n\n \/\/\/ \\return whether a change was made.\n bool doOneIteration(SILFunction &function, unsigned iteration);\n\n void clear() {\n iteration = 0;\n worklist.resetChecked();\n madeChange = false;\n }\n\n \/\/\/ Applies the MandatoryCombiner to the provided function.\n \/\/\/\n \/\/\/ \\param function the function to which to apply the MandatoryCombiner.\n \/\/\/\n \/\/\/ \\return whether a change was made.\n bool runOnFunction(SILFunction &function) {\n bool changed = false;\n\n while (doOneIteration(function, iteration)) {\n changed = true;\n ++iteration;\n }\n\n return changed;\n }\n\n \/\/\/ Base visitor that does not do anything.\n SILInstruction *visitSILInstruction(SILInstruction *) { return nullptr; }\n SILInstruction *visitApplyInst(ApplyInst *instruction);\n};\n\n} \/\/ end anonymous namespace\n\n\/\/===----------------------------------------------------------------------===\/\/\n\/\/ MandatoryCombiner Non-Visitor Utility Methods\n\/\/===----------------------------------------------------------------------===\/\/\n\nvoid MandatoryCombiner::addReachableCodeToWorklist(SILFunction &function) {\n SmallBlotSetVector<SILBasicBlock *, 32> blockWorklist;\n SmallBlotSetVector<SILBasicBlock *, 32> blocksVisited;\n SmallVector<SILInstruction *, 128> instructions;\n\n blockWorklist.insert(&*function.begin());\n while (!blockWorklist.empty()) {\n auto *block = blockWorklist.pop_back_val().getValueOr(nullptr);\n if (block == nullptr) {\n continue;\n }\n\n if (!blocksVisited.insert(block).second) {\n continue;\n }\n\n for (auto iterator = block->begin(), end = block->end(); iterator != end;) {\n auto *instruction = &*iterator;\n ++iterator;\n\n if (isInstructionTriviallyDead(instruction)) {\n continue;\n }\n\n instructions.push_back(instruction);\n }\n\n for_each(block->getSuccessorBlocks(),\n [&](SILBasicBlock *block) { blockWorklist.insert(block); });\n }\n\n worklist.addInitialGroup(instructions);\n}\n\nbool MandatoryCombiner::doOneIteration(SILFunction &function,\n unsigned iteration) {\n madeChange = false;\n\n addReachableCodeToWorklist(function);\n\n while (!worklist.isEmpty()) {\n auto *instruction = worklist.pop_back_val();\n if (instruction == nullptr) {\n continue;\n }\n\n#ifndef NDEBUG\n std::string instructionDescription;\n#endif\n LLVM_DEBUG(llvm::raw_string_ostream SS(instructionDescription);\n instruction->print(SS); instructionDescription = SS.str(););\n LLVM_DEBUG(llvm::dbgs()\n << \"MC: Visiting: \" << instructionDescription << '\\n');\n\n if (auto replacement = visit(instruction)) {\n worklist.replaceInstructionWithInstruction(instruction, replacement\n#ifndef NDEBUG\n ,\n instructionDescription\n#endif\n );\n }\n\n for (SILInstruction *instruction : instructionsPendingDeletion) {\n worklist.eraseInstFromFunction(*instruction);\n }\n instructionsPendingDeletion.clear();\n\n \/\/ Our tracking list has been accumulating instructions created by the\n \/\/ SILBuilder during this iteration. Go through the tracking list and add\n \/\/ its contents to the worklist and then clear said list in preparation\n \/\/ for the next iteration.\n for (SILInstruction *instruction : createdInstructions) {\n LLVM_DEBUG(llvm::dbgs() << \"MC: add \" << *instruction\n << \" from tracking list to worklist\\n\");\n worklist.add(instruction);\n }\n createdInstructions.clear();\n }\n\n worklist.resetChecked();\n return madeChange;\n}\n\n\/\/===----------------------------------------------------------------------===\/\/\n\/\/ MandatoryCombiner Visitor Methods\n\/\/===----------------------------------------------------------------------===\/\/\n\nSILInstruction *MandatoryCombiner::visitApplyInst(ApplyInst *instruction) {\n \/\/ Apply this pass only to partial applies all of whose arguments are\n \/\/ trivial.\n auto calledValue = instruction->getCallee();\n if (calledValue == nullptr) {\n return nullptr;\n }\n auto fullApplyCallee = calledValue->getDefiningInstruction();\n if (fullApplyCallee == nullptr) {\n return nullptr;\n }\n auto partialApply = dyn_cast<PartialApplyInst>(fullApplyCallee);\n if (partialApply == nullptr) {\n return nullptr;\n }\n auto *function = partialApply->getCalleeFunction();\n if (function == nullptr) {\n return nullptr;\n }\n ApplySite fullApplySite(instruction);\n auto fullApplyArguments = fullApplySite.getArguments();\n if (!areAllValuesTrivial(fullApplyArguments, *function)) {\n return nullptr;\n }\n auto partialApplyArguments = ApplySite(partialApply).getArguments();\n if (!areAllValuesTrivial(partialApplyArguments, *function)) {\n return nullptr;\n }\n\n auto callee = partialApply->getCallee();\n\n ApplySite partialApplySite(partialApply);\n\n SmallVector<SILValue, 8> argsVec;\n llvm::copy(fullApplyArguments, std::back_inserter(argsVec));\n llvm::copy(partialApplyArguments, std::back_inserter(argsVec));\n\n SILBuilderWithScope builder(instruction, &createdInstructions);\n ApplyInst *replacement = builder.createApply(\n \/*Loc=*\/instruction->getDebugLocation().getLocation(), \/*Fn=*\/callee,\n \/*Subs=*\/partialApply->getSubstitutionMap(),\n \/*Args*\/ argsVec,\n \/*isNonThrowing=*\/instruction->isNonThrowing(),\n \/*SpecializationInfo=*\/partialApply->getSpecializationInfo());\n\n worklist.replaceInstructionWithInstruction(instruction, replacement\n#ifndef NDEBUG\n ,\n \/*instructionDescription=*\/\"\"\n#endif\n );\n tryDeleteDeadClosure(partialApply, instModCallbacks);\n return nullptr;\n}\n\n\/\/===----------------------------------------------------------------------===\/\/\n\/\/ Top Level Entrypoint\n\/\/===----------------------------------------------------------------------===\/\/\n\nnamespace {\n\nclass MandatoryCombine final : public SILFunctionTransform {\n\n SmallVector<SILInstruction *, 64> createdInstructions;\n\n void run() override {\n auto *function = getFunction();\n\n MandatoryCombiner combiner(createdInstructions);\n bool madeChange = combiner.runOnFunction(*function);\n\n if (madeChange) {\n invalidateAnalysis(SILAnalysis::InvalidationKind::Instructions);\n }\n }\n\n void handleDeleteNotification(SILNode *node) override {\n \/\/ Remove instructions that were both created and deleted from the list of\n \/\/ created instructions which will eventually be added to the worklist.\n\n auto *instruction = dyn_cast<SILInstruction>(node);\n if (instruction == nullptr) {\n return;\n }\n\n \/\/ Linear searching the tracking list doesn't hurt because usually it only\n \/\/ contains a few elements.\n auto iterator = find(createdInstructions, instruction);\n if (createdInstructions.end() != iterator) {\n createdInstructions.erase(iterator);\n }\n }\n\n bool needsNotifications() override { return true; }\n};\n\n} \/\/ end anonymous namespace\n\nSILTransform *swift::createMandatoryCombine() { return new MandatoryCombine(); }\n<|endoftext|>"} {"text":"<commit_before>#pragma once\n\n#include <concepts>\n#include <cstddef>\n#include <filesystem>\n#include <phosphor-logging\/lg2\/flags.hpp>\n#include <phosphor-logging\/lg2\/header.hpp>\n#include <phosphor-logging\/lg2\/level.hpp>\n#include <phosphor-logging\/lg2\/logger.hpp>\n#include <phosphor-logging\/lg2\/source_location.hpp>\n#include <sdbusplus\/message\/native_types.hpp>\n#include <string_view>\n#include <tuple>\n#include <type_traits>\n\nnamespace lg2::details\n{\n\n\/** Concept to determine if an item acts like a string.\n *\n * Something acts like a string if we can construct a string_view from it.\n * This covers std::string and C-strings. But, there is subtlety in that\n * nullptr_t can be used to construct a string_view until C++23, so we need\n * to exempt out nullptr_t's (otherwise `nullptr` ends up acting like a\n * string).\n *\/\ntemplate <typename T>\nconcept string_like_type =\n (std::constructible_from<std::string_view, T> ||\n std::same_as<std::filesystem::path,\n std::decay_t<T>>)&&!std::same_as<nullptr_t, T>;\n\n\/** Concept to determine if an item acts like a pointer.\n *\n * Any pointer, which doesn't act like a string, should be treated as a raw\n * pointer.\n *\/\ntemplate <typename T>\nconcept pointer_type = (std::is_pointer_v<T> ||\n std::same_as<nullptr_t, T>)&&!string_like_type<T>;\n\n\/** Concept to determine if an item acts like an unsigned_integral.\n *\n * Except bool because we want bool to be handled special to create nice\n * `True` and `False` strings.\n *\/\ntemplate <typename T>\nconcept unsigned_integral_except_bool =\n !std::same_as<T, bool> && std::unsigned_integral<T>;\n\ntemplate <typename T>\nconcept sdbusplus_enum = sdbusplus::message::has_convert_from_string_v<T>;\n\ntemplate <typename T>\nconcept exception_type = std::derived_from<std::decay_t<T>, std::exception>;\n\n\/** Concept listing all of the types we know how to convert into a format\n * for logging.\n *\/\ntemplate <typename T>\nconcept unsupported_log_convert_types =\n !(unsigned_integral_except_bool<T> || std::signed_integral<T> ||\n std::same_as<bool, T> || std::floating_point<T> || string_like_type<T> ||\n pointer_type<T> || sdbusplus_enum<T> || exception_type<T>);\n\n\/** Any type we do not know how to convert for logging gives a nicer\n * static_assert message. *\/\ntemplate <log_flags... Fs, unsupported_log_convert_types T>\nstatic auto log_convert(const char*, log_flag<Fs...>, T)\n{\n static_assert(!std::is_same_v<T, T>, \"Unsupported type for logging value.\");\n \/\/ Having this return of an empty tuple reduces the error messages.\n return std::tuple<>{};\n}\n\n\/** Logging conversion for unsigned. *\/\ntemplate <log_flags... Fs, unsigned_integral_except_bool V>\nstatic auto log_convert(const char* h, log_flag<Fs...> f, V v)\n{\n \/\/ Compile-time checks for valid formatting flags.\n prohibit(f, floating);\n prohibit(f, signed_val);\n prohibit(f, str);\n\n one_from_set(f, dec | hex | bin);\n one_from_set(f, field8 | field16 | field32 | field64);\n\n \/\/ Add 'unsigned' flag, force to uint64_t for variadic passing.\n return std::make_tuple(h, (f | unsigned_val).value,\n static_cast<uint64_t>(v));\n}\n\n\/** Logging conversion for signed. *\/\ntemplate <log_flags... Fs, std::signed_integral V>\nstatic auto log_convert(const char* h, log_flag<Fs...> f, V v)\n{\n \/\/ Compile-time checks for valid formatting flags.\n prohibit(f, floating);\n prohibit(f, str);\n prohibit(f, unsigned_val);\n\n one_from_set(f, dec | hex | bin);\n one_from_set(f, field8 | field16 | field32 | field64);\n\n \/\/ Add 'signed' flag, force to int64_t for variadic passing.\n return std::make_tuple(h, (f | signed_val).value, static_cast<int64_t>(v));\n}\n\n\/** Logging conversion for bool. *\/\ntemplate <log_flags... Fs, std::same_as<bool> V>\nstatic auto log_convert(const char* h, log_flag<Fs...> f, V v)\n{\n \/\/ Compile-time checks for valid formatting flags.\n prohibit(f, bin);\n prohibit(f, dec);\n prohibit(f, field16);\n prohibit(f, field32);\n prohibit(f, field64);\n prohibit(f, field8);\n prohibit(f, floating);\n prohibit(f, hex);\n prohibit(f, signed_val);\n prohibit(f, unsigned_val);\n\n \/\/ Cast bools to a \"True\" or \"False\" string.\n return std::make_tuple(h, (f | str).value, v ? \"True\" : \"False\");\n}\n\n\/** Logging conversion for floating points. *\/\ntemplate <log_flags... Fs, std::floating_point V>\nstatic auto log_convert(const char* h, log_flag<Fs...> f, V v)\n{\n \/\/ Compile-time checks for valid formatting flags.\n prohibit(f, bin);\n prohibit(f, dec);\n prohibit(f, field16);\n prohibit(f, field32);\n prohibit(f, field64);\n prohibit(f, field8);\n prohibit(f, hex);\n prohibit(f, signed_val);\n prohibit(f, str);\n prohibit(f, unsigned_val);\n\n \/\/ Add 'floating' flag, force to double for variadic passing.\n return std::make_tuple(h, (f | floating).value, static_cast<double>(v));\n}\n\n\/** Logging conversion for sdbusplus enums. *\/\ntemplate <log_flags... Fs, sdbusplus_enum V>\nstatic auto log_convert(const char* h, log_flag<Fs...> f, V v)\n{\n \/\/ Compile-time checks for valid formatting flags.\n prohibit(f, bin);\n prohibit(f, dec);\n prohibit(f, field16);\n prohibit(f, field32);\n prohibit(f, field64);\n prohibit(f, field8);\n prohibit(f, floating);\n prohibit(f, hex);\n prohibit(f, signed_val);\n prohibit(f, unsigned_val);\n\n return std::make_tuple(h, (f | str).value,\n sdbusplus::message::convert_to_string(v));\n}\n\n\/** Logging conversion for string-likes. *\/\ntemplate <log_flags... Fs, string_like_type V>\nstatic auto log_convert(const char* h, log_flag<Fs...> f, V&& v)\n{\n \/\/ Compile-time checks for valid formatting flags.\n prohibit(f, bin);\n prohibit(f, dec);\n prohibit(f, field16);\n prohibit(f, field32);\n prohibit(f, field64);\n prohibit(f, field8);\n prohibit(f, floating);\n prohibit(f, hex);\n prohibit(f, signed_val);\n prohibit(f, unsigned_val);\n\n \/\/ Utiilty to handle conversion to a 'const char*' depending on V:\n \/\/ - 'const char*' and similar use static cast.\n \/\/ - 'std::filesystem::path' use c_str() function.\n \/\/ - 'std::string' and 'std::string_view' use data() function.\n auto str_data = [](V&& v) {\n if constexpr (std::is_same_v<const char*, std::decay_t<V>> ||\n std::is_same_v<char*, std::decay_t<V>>)\n {\n return static_cast<const char*>(v);\n }\n else if constexpr (std::is_same_v<std::filesystem::path,\n std::decay_t<V>>)\n {\n return v.c_str();\n }\n else\n {\n return v.data();\n }\n };\n\n \/\/ Add 'str' flag, force to 'const char*' for variadic passing.\n return std::make_tuple(h, (f | str).value, str_data(std::forward<V>(v)));\n}\n\n\/** Logging conversion for pointer-types. *\/\ntemplate <log_flags... Fs, pointer_type V>\nstatic auto log_convert(const char* h, log_flag<Fs...> f, V v)\n{\n \/\/ Compile-time checks for valid formatting flags.\n prohibit(f, bin);\n prohibit(f, dec);\n prohibit(f, field16);\n prohibit(f, field32);\n prohibit(f, field64);\n prohibit(f, field8);\n prohibit(f, floating);\n prohibit(f, signed_val);\n prohibit(f, str);\n\n \/\/ Cast (void*) to a hex-formatted uint64 using the target's pointer-size\n \/\/ to determine field-width.\n constexpr static auto new_f =\n sizeof(void*) == 4 ? field32.value : field64.value;\n\n return std::make_tuple(h, new_f | (hex | unsigned_val).value,\n reinterpret_cast<uint64_t>(v));\n}\n\n\/* Logging conversion for exceptions. *\/\ntemplate <log_flags... Fs, exception_type V>\nstatic auto log_convert(const char* h, log_flag<Fs...> f, V&& v)\n{\n \/\/ Compile-time checks for valid formatting flags.\n prohibit(f, bin);\n prohibit(f, dec);\n prohibit(f, field16);\n prohibit(f, field32);\n prohibit(f, field64);\n prohibit(f, field8);\n prohibit(f, floating);\n prohibit(f, hex);\n prohibit(f, signed_val);\n prohibit(f, unsigned_val);\n\n \/\/ Treat like a string, but get the 'what' from the exception.\n return std::make_tuple(h, (f | str).value, v.what());\n}\n\n\/** Class to facilitate walking through the arguments of the `lg2::log` function\n * and ensuring correct parameter types and conversion operations.\n *\/\nclass log_conversion\n{\n private:\n \/** Conversion and validation is complete. Pass along to the final\n * do_log variadic function. *\/\n template <typename... Ts>\n static void done(level l, const lg2::source_location& s, const char* m,\n Ts&&... ts)\n {\n do_log(l, s, m, std::forward<Ts>(ts)..., nullptr);\n }\n\n \/** Apply the tuple from the end of 'step' into done.\n *\n * There are some cases where the tuple must hold a `std::string` in\n * order to avoid losing data in a temporary (see sdbusplus-enum\n * conversion), but the `do_log` function wants a `const char*` as\n * the variadic type. Run the tuple through a lambda to pull out\n * the `const char*`'s without losing the temporary held by the tuple.\n *\/\n static void apply_done(const auto& args_tuple)\n {\n auto squash_string = [](auto& arg) -> decltype(auto) {\n if constexpr (std::is_same_v<const std::string&, decltype(arg)>)\n {\n return arg.data();\n }\n else\n {\n return arg;\n }\n };\n\n std::apply([squash_string](\n const auto&... args) { done(squash_string(args)...); },\n args_tuple);\n }\n\n \/** Handle conversion of a { Header, Flags, Value } argument set. *\/\n template <typename... Ts, log_flags... Fs, typename V, typename... Ss>\n static void step(std::tuple<Ts...>&& ts, const header_str& h,\n log_flag<Fs...> f, V&& v, Ss&&... ss)\n {\n static_assert(!std::is_same_v<header_str, std::decay_t<V>>,\n \"Found header_str as value; suggest using std::string to \"\n \"avoid unintended conversion.\");\n\n \/\/ These two if conditions are similar, except that one calls 'done'\n \/\/ since Ss is empty and the other calls the next 'step'.\n\n \/\/ 1. Call `log_convert` on {h, f, v} for proper conversion.\n \/\/ 2. Append the results of `log_convert` into the already handled\n \/\/ arguments (in ts).\n \/\/ 3. Call the next step in the chain to handle the remainder Ss.\n\n if constexpr (sizeof...(Ss) == 0)\n {\n apply_done(\n std::tuple_cat(std::move(ts), log_convert(h.data(), f, v)));\n }\n else\n {\n step(std::tuple_cat(std::move(ts), log_convert(h.data(), f, v)),\n std::forward<Ss>(ss)...);\n }\n }\n\n \/** Handle conversion of a { Header, Value } argument set. *\/\n template <typename... Ts, typename V, typename... Ss>\n static void step(std::tuple<Ts...>&& ts, const header_str& h, V&& v,\n Ss&&... ss)\n {\n static_assert(!std::is_same_v<header_str, std::decay_t<V>>,\n \"Found header_str as value; suggest using std::string to \"\n \"avoid unintended conversion.\");\n \/\/ These two if conditions are similar, except that one calls 'done'\n \/\/ since Ss is empty and the other calls the next 'step'.\n\n \/\/ 1. Call `log_convert` on {h, <empty flags>, v} for proper conversion.\n \/\/ 2. Append the results of `log_convert` into the already handled\n \/\/ arguments (in ts).\n \/\/ 3. Call the next step in the chain to handle the remainder Ss.\n\n if constexpr (sizeof...(Ss) == 0)\n {\n apply_done(std::tuple_cat(std::move(ts),\n log_convert(h.data(), log_flag<>{}, v)));\n }\n else\n {\n step(std::tuple_cat(std::move(ts),\n log_convert(h.data(), log_flag<>{}, v)),\n std::forward<Ss>(ss)...);\n }\n }\n\n \/** Finding a non-string as the first argument of a 2 or 3 argument set\n * is an error (missing HEADER field). *\/\n template <typename... Ts, not_constexpr_string H, typename... Ss>\n static void step(std::tuple<Ts...>&&, H, Ss&&...)\n {\n static_assert(std::is_same_v<header_str, H>,\n \"Found value without expected header field.\");\n }\n\n \/** Finding a free string at the end is an error (found HEADER but no data).\n *\/\n template <typename... Ts>\n static void step(std::tuple<Ts...>&&, header_str)\n {\n static_assert(!std::is_same_v<header_str, header_str>,\n \"Found header field without expected data.\");\n }\n\n public:\n \/** Start processing a sequence of arguments to `lg2::log` using `step` or\n * `done`. *\/\n template <typename... Ts>\n static void start(level l, const lg2::source_location& s, const char* msg,\n Ts&&... ts)\n {\n \/\/ If there are no arguments (ie. just a message), then skip processing\n \/\/ and call `done` directly.\n if constexpr (sizeof...(Ts) == 0)\n {\n done(l, s, msg);\n }\n \/\/ Handle all the Ts by recursively calling 'step'.\n else\n {\n step(std::forward_as_tuple(l, s, msg), std::forward<Ts>(ts)...);\n }\n }\n};\n\n} \/\/ namespace lg2::details\n<commit_msg>lg2: fix clang issue on nullptr_t<commit_after>#pragma once\n\n#include <concepts>\n#include <cstddef>\n#include <filesystem>\n#include <phosphor-logging\/lg2\/flags.hpp>\n#include <phosphor-logging\/lg2\/header.hpp>\n#include <phosphor-logging\/lg2\/level.hpp>\n#include <phosphor-logging\/lg2\/logger.hpp>\n#include <phosphor-logging\/lg2\/source_location.hpp>\n#include <sdbusplus\/message\/native_types.hpp>\n#include <string_view>\n#include <tuple>\n#include <type_traits>\n\nnamespace lg2::details\n{\n\n\/** Concept to determine if an item acts like a string.\n *\n * Something acts like a string if we can construct a string_view from it.\n * This covers std::string and C-strings. But, there is subtlety in that\n * nullptr_t can be used to construct a string_view until C++23, so we need\n * to exempt out nullptr_t's (otherwise `nullptr` ends up acting like a\n * string).\n *\/\ntemplate <typename T>\nconcept string_like_type =\n (std::constructible_from<std::string_view, T> ||\n std::same_as<std::filesystem::path,\n std::decay_t<T>>)&&!std::same_as<std::nullptr_t, T>;\n\n\/** Concept to determine if an item acts like a pointer.\n *\n * Any pointer, which doesn't act like a string, should be treated as a raw\n * pointer.\n *\/\ntemplate <typename T>\nconcept pointer_type = (std::is_pointer_v<T> ||\n std::same_as<std::nullptr_t, T>)&&!string_like_type<T>;\n\n\/** Concept to determine if an item acts like an unsigned_integral.\n *\n * Except bool because we want bool to be handled special to create nice\n * `True` and `False` strings.\n *\/\ntemplate <typename T>\nconcept unsigned_integral_except_bool =\n !std::same_as<T, bool> && std::unsigned_integral<T>;\n\ntemplate <typename T>\nconcept sdbusplus_enum = sdbusplus::message::has_convert_from_string_v<T>;\n\ntemplate <typename T>\nconcept exception_type = std::derived_from<std::decay_t<T>, std::exception>;\n\n\/** Concept listing all of the types we know how to convert into a format\n * for logging.\n *\/\ntemplate <typename T>\nconcept unsupported_log_convert_types =\n !(unsigned_integral_except_bool<T> || std::signed_integral<T> ||\n std::same_as<bool, T> || std::floating_point<T> || string_like_type<T> ||\n pointer_type<T> || sdbusplus_enum<T> || exception_type<T>);\n\n\/** Any type we do not know how to convert for logging gives a nicer\n * static_assert message. *\/\ntemplate <log_flags... Fs, unsupported_log_convert_types T>\nstatic auto log_convert(const char*, log_flag<Fs...>, T)\n{\n static_assert(!std::is_same_v<T, T>, \"Unsupported type for logging value.\");\n \/\/ Having this return of an empty tuple reduces the error messages.\n return std::tuple<>{};\n}\n\n\/** Logging conversion for unsigned. *\/\ntemplate <log_flags... Fs, unsigned_integral_except_bool V>\nstatic auto log_convert(const char* h, log_flag<Fs...> f, V v)\n{\n \/\/ Compile-time checks for valid formatting flags.\n prohibit(f, floating);\n prohibit(f, signed_val);\n prohibit(f, str);\n\n one_from_set(f, dec | hex | bin);\n one_from_set(f, field8 | field16 | field32 | field64);\n\n \/\/ Add 'unsigned' flag, force to uint64_t for variadic passing.\n return std::make_tuple(h, (f | unsigned_val).value,\n static_cast<uint64_t>(v));\n}\n\n\/** Logging conversion for signed. *\/\ntemplate <log_flags... Fs, std::signed_integral V>\nstatic auto log_convert(const char* h, log_flag<Fs...> f, V v)\n{\n \/\/ Compile-time checks for valid formatting flags.\n prohibit(f, floating);\n prohibit(f, str);\n prohibit(f, unsigned_val);\n\n one_from_set(f, dec | hex | bin);\n one_from_set(f, field8 | field16 | field32 | field64);\n\n \/\/ Add 'signed' flag, force to int64_t for variadic passing.\n return std::make_tuple(h, (f | signed_val).value, static_cast<int64_t>(v));\n}\n\n\/** Logging conversion for bool. *\/\ntemplate <log_flags... Fs, std::same_as<bool> V>\nstatic auto log_convert(const char* h, log_flag<Fs...> f, V v)\n{\n \/\/ Compile-time checks for valid formatting flags.\n prohibit(f, bin);\n prohibit(f, dec);\n prohibit(f, field16);\n prohibit(f, field32);\n prohibit(f, field64);\n prohibit(f, field8);\n prohibit(f, floating);\n prohibit(f, hex);\n prohibit(f, signed_val);\n prohibit(f, unsigned_val);\n\n \/\/ Cast bools to a \"True\" or \"False\" string.\n return std::make_tuple(h, (f | str).value, v ? \"True\" : \"False\");\n}\n\n\/** Logging conversion for floating points. *\/\ntemplate <log_flags... Fs, std::floating_point V>\nstatic auto log_convert(const char* h, log_flag<Fs...> f, V v)\n{\n \/\/ Compile-time checks for valid formatting flags.\n prohibit(f, bin);\n prohibit(f, dec);\n prohibit(f, field16);\n prohibit(f, field32);\n prohibit(f, field64);\n prohibit(f, field8);\n prohibit(f, hex);\n prohibit(f, signed_val);\n prohibit(f, str);\n prohibit(f, unsigned_val);\n\n \/\/ Add 'floating' flag, force to double for variadic passing.\n return std::make_tuple(h, (f | floating).value, static_cast<double>(v));\n}\n\n\/** Logging conversion for sdbusplus enums. *\/\ntemplate <log_flags... Fs, sdbusplus_enum V>\nstatic auto log_convert(const char* h, log_flag<Fs...> f, V v)\n{\n \/\/ Compile-time checks for valid formatting flags.\n prohibit(f, bin);\n prohibit(f, dec);\n prohibit(f, field16);\n prohibit(f, field32);\n prohibit(f, field64);\n prohibit(f, field8);\n prohibit(f, floating);\n prohibit(f, hex);\n prohibit(f, signed_val);\n prohibit(f, unsigned_val);\n\n return std::make_tuple(h, (f | str).value,\n sdbusplus::message::convert_to_string(v));\n}\n\n\/** Logging conversion for string-likes. *\/\ntemplate <log_flags... Fs, string_like_type V>\nstatic auto log_convert(const char* h, log_flag<Fs...> f, V&& v)\n{\n \/\/ Compile-time checks for valid formatting flags.\n prohibit(f, bin);\n prohibit(f, dec);\n prohibit(f, field16);\n prohibit(f, field32);\n prohibit(f, field64);\n prohibit(f, field8);\n prohibit(f, floating);\n prohibit(f, hex);\n prohibit(f, signed_val);\n prohibit(f, unsigned_val);\n\n \/\/ Utiilty to handle conversion to a 'const char*' depending on V:\n \/\/ - 'const char*' and similar use static cast.\n \/\/ - 'std::filesystem::path' use c_str() function.\n \/\/ - 'std::string' and 'std::string_view' use data() function.\n auto str_data = [](V&& v) {\n if constexpr (std::is_same_v<const char*, std::decay_t<V>> ||\n std::is_same_v<char*, std::decay_t<V>>)\n {\n return static_cast<const char*>(v);\n }\n else if constexpr (std::is_same_v<std::filesystem::path,\n std::decay_t<V>>)\n {\n return v.c_str();\n }\n else\n {\n return v.data();\n }\n };\n\n \/\/ Add 'str' flag, force to 'const char*' for variadic passing.\n return std::make_tuple(h, (f | str).value, str_data(std::forward<V>(v)));\n}\n\n\/** Logging conversion for pointer-types. *\/\ntemplate <log_flags... Fs, pointer_type V>\nstatic auto log_convert(const char* h, log_flag<Fs...> f, V v)\n{\n \/\/ Compile-time checks for valid formatting flags.\n prohibit(f, bin);\n prohibit(f, dec);\n prohibit(f, field16);\n prohibit(f, field32);\n prohibit(f, field64);\n prohibit(f, field8);\n prohibit(f, floating);\n prohibit(f, signed_val);\n prohibit(f, str);\n\n \/\/ Cast (void*) to a hex-formatted uint64 using the target's pointer-size\n \/\/ to determine field-width.\n constexpr static auto new_f =\n sizeof(void*) == 4 ? field32.value : field64.value;\n\n return std::make_tuple(h, new_f | (hex | unsigned_val).value,\n reinterpret_cast<uint64_t>(v));\n}\n\n\/* Logging conversion for exceptions. *\/\ntemplate <log_flags... Fs, exception_type V>\nstatic auto log_convert(const char* h, log_flag<Fs...> f, V&& v)\n{\n \/\/ Compile-time checks for valid formatting flags.\n prohibit(f, bin);\n prohibit(f, dec);\n prohibit(f, field16);\n prohibit(f, field32);\n prohibit(f, field64);\n prohibit(f, field8);\n prohibit(f, floating);\n prohibit(f, hex);\n prohibit(f, signed_val);\n prohibit(f, unsigned_val);\n\n \/\/ Treat like a string, but get the 'what' from the exception.\n return std::make_tuple(h, (f | str).value, v.what());\n}\n\n\/** Class to facilitate walking through the arguments of the `lg2::log` function\n * and ensuring correct parameter types and conversion operations.\n *\/\nclass log_conversion\n{\n private:\n \/** Conversion and validation is complete. Pass along to the final\n * do_log variadic function. *\/\n template <typename... Ts>\n static void done(level l, const lg2::source_location& s, const char* m,\n Ts&&... ts)\n {\n do_log(l, s, m, std::forward<Ts>(ts)..., nullptr);\n }\n\n \/** Apply the tuple from the end of 'step' into done.\n *\n * There are some cases where the tuple must hold a `std::string` in\n * order to avoid losing data in a temporary (see sdbusplus-enum\n * conversion), but the `do_log` function wants a `const char*` as\n * the variadic type. Run the tuple through a lambda to pull out\n * the `const char*`'s without losing the temporary held by the tuple.\n *\/\n static void apply_done(const auto& args_tuple)\n {\n auto squash_string = [](auto& arg) -> decltype(auto) {\n if constexpr (std::is_same_v<const std::string&, decltype(arg)>)\n {\n return arg.data();\n }\n else\n {\n return arg;\n }\n };\n\n std::apply([squash_string](\n const auto&... args) { done(squash_string(args)...); },\n args_tuple);\n }\n\n \/** Handle conversion of a { Header, Flags, Value } argument set. *\/\n template <typename... Ts, log_flags... Fs, typename V, typename... Ss>\n static void step(std::tuple<Ts...>&& ts, const header_str& h,\n log_flag<Fs...> f, V&& v, Ss&&... ss)\n {\n static_assert(!std::is_same_v<header_str, std::decay_t<V>>,\n \"Found header_str as value; suggest using std::string to \"\n \"avoid unintended conversion.\");\n\n \/\/ These two if conditions are similar, except that one calls 'done'\n \/\/ since Ss is empty and the other calls the next 'step'.\n\n \/\/ 1. Call `log_convert` on {h, f, v} for proper conversion.\n \/\/ 2. Append the results of `log_convert` into the already handled\n \/\/ arguments (in ts).\n \/\/ 3. Call the next step in the chain to handle the remainder Ss.\n\n if constexpr (sizeof...(Ss) == 0)\n {\n apply_done(\n std::tuple_cat(std::move(ts), log_convert(h.data(), f, v)));\n }\n else\n {\n step(std::tuple_cat(std::move(ts), log_convert(h.data(), f, v)),\n std::forward<Ss>(ss)...);\n }\n }\n\n \/** Handle conversion of a { Header, Value } argument set. *\/\n template <typename... Ts, typename V, typename... Ss>\n static void step(std::tuple<Ts...>&& ts, const header_str& h, V&& v,\n Ss&&... ss)\n {\n static_assert(!std::is_same_v<header_str, std::decay_t<V>>,\n \"Found header_str as value; suggest using std::string to \"\n \"avoid unintended conversion.\");\n \/\/ These two if conditions are similar, except that one calls 'done'\n \/\/ since Ss is empty and the other calls the next 'step'.\n\n \/\/ 1. Call `log_convert` on {h, <empty flags>, v} for proper conversion.\n \/\/ 2. Append the results of `log_convert` into the already handled\n \/\/ arguments (in ts).\n \/\/ 3. Call the next step in the chain to handle the remainder Ss.\n\n if constexpr (sizeof...(Ss) == 0)\n {\n apply_done(std::tuple_cat(std::move(ts),\n log_convert(h.data(), log_flag<>{}, v)));\n }\n else\n {\n step(std::tuple_cat(std::move(ts),\n log_convert(h.data(), log_flag<>{}, v)),\n std::forward<Ss>(ss)...);\n }\n }\n\n \/** Finding a non-string as the first argument of a 2 or 3 argument set\n * is an error (missing HEADER field). *\/\n template <typename... Ts, not_constexpr_string H, typename... Ss>\n static void step(std::tuple<Ts...>&&, H, Ss&&...)\n {\n static_assert(std::is_same_v<header_str, H>,\n \"Found value without expected header field.\");\n }\n\n \/** Finding a free string at the end is an error (found HEADER but no data).\n *\/\n template <typename... Ts>\n static void step(std::tuple<Ts...>&&, header_str)\n {\n static_assert(!std::is_same_v<header_str, header_str>,\n \"Found header field without expected data.\");\n }\n\n public:\n \/** Start processing a sequence of arguments to `lg2::log` using `step` or\n * `done`. *\/\n template <typename... Ts>\n static void start(level l, const lg2::source_location& s, const char* msg,\n Ts&&... ts)\n {\n \/\/ If there are no arguments (ie. just a message), then skip processing\n \/\/ and call `done` directly.\n if constexpr (sizeof...(Ts) == 0)\n {\n done(l, s, msg);\n }\n \/\/ Handle all the Ts by recursively calling 'step'.\n else\n {\n step(std::forward_as_tuple(l, s, msg), std::forward<Ts>(ts)...);\n }\n }\n};\n\n} \/\/ namespace lg2::details\n<|endoftext|>"} {"text":"<commit_before>\/******************************************************************************\n* YawController.cpp\n*\n* Contains the yaw_controller() function\n******************************************************************************\/\n#include \"Mapper.h\"\n\n\/******************************************************************************\n* int yaw_controller()\n*\n* Takes in readings from IMU and calculates a percentage (-1 to 1) to run \n* motors at\n******************************************************************************\/\n\/*\nint yaw_controller()\n{\n\t\/\/ control output \/\/\n\tif( bno055.yaw < 180 ) \/\/ AUV is pointed right\n\t{\n\t\t\/\/ u[2] is negative\n\t\tmotor_percent = yaw_pid.kp*(bno055.yaw - yaw_pid.setpoint) \n\t\t\t+ KD_YAW*(sstate.yaw[0]-sstate.yaw[1])\/DT; \/\/ yaw controller\n\t}\n\telse\t\t\/\/ AUV is pointed left\n\t{\n\t\t\/\/ u[2] is positive\n\t\tmotor_percent = yaw_pid.kp*(yaw_pid.setpoint-(bno055.yaw-360)) \n\t\t\t+ KD_YAW*(sstate.yaw[0]-sstate.yaw[1])\/DT; \/\/ yaw controller\n\t}\n\t\/\/ saturate yaw controller \/\/\n\tif( u[2] > YAW_SAT )\n\t{\n\t\tmotor_percent=YAW_SAT;\n\t}\n\telse if( motor_percent < -YAW_SAT )\n\t{\n\t\tmotor_percent = -YAW_SAT;\n\t}\n\n\t\/\/ set current yaw to be the old yaw \/\/\n\tyaw_pid.oldyaw = bno055.yaw;\n\n\t\/\/ set starboard positive and port negative \/\/\n\tstarboard_percent = motor_percent;\n\tport_percent = -motor_percent;\n\n\t\/\/ set current yaw to be the old yaw \/\/\n\tyaw_pid.oldyaw = bno055.yaw;\n\n\treturn 0;\n}\n*\/\n<commit_msg>Changed Controls.cpp to return motor_percent<commit_after>\/******************************************************************************\n* YawController.cpp\n*\n* Contains the yaw_controller() function\n******************************************************************************\/\n#include \"Mapper.h\"\n\n\/******************************************************************************\n* float yaw_controller()\n*\n* Takes in readings from IMU and calculates a percentage (-1 to 1) to run \n* motors at\n******************************************************************************\/\n\/*\nfloat yaw_controller()\n{\n\t\/\/ control output \/\/\n\tif( bno055.yaw < 180 ) \/\/ AUV is pointed right\n\t{\n\t\t\/\/ u[2] is negative\n\t\tmotor_percent = yaw_pid.kp*(bno055.yaw - yaw_pid.setpoint) \n\t\t\t+ KD_YAW*(sstate.yaw[0]-sstate.yaw[1])\/DT; \/\/ yaw controller\n\t}\n\telse\t\t\/\/ AUV is pointed left\n\t{\n\t\t\/\/ u[2] is positive\n\t\tmotor_percent = yaw_pid.kp*(yaw_pid.setpoint-(bno055.yaw-360)) \n\t\t\t+ KD_YAW*(sstate.yaw[0]-sstate.yaw[1])\/DT; \/\/ yaw controller\n\t}\n\t\/\/ saturate yaw controller \/\/\n\tif( u[2] > YAW_SAT )\n\t{\n\t\tmotor_percent=YAW_SAT;\n\t}\n\telse if( motor_percent < -YAW_SAT )\n\t{\n\t\tmotor_percent = -YAW_SAT;\n\t}\n\n\t\/\/ set current yaw to be the old yaw \/\/\n\tyaw_pid.oldyaw = bno055.yaw;\n\n\t\/\/ set current yaw to be the old yaw \/\/\n\tyaw_pid.oldyaw = bno055.yaw;\n\n\treturn motor_percent;\n}\n*\/\n<|endoftext|>"} {"text":"<commit_before>\/\/ Natron\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 \"NodeCreationDialog.h\"\n\nCLANG_DIAG_OFF(deprecated)\nCLANG_DIAG_OFF(uninitialized)\n#include <QVBoxLayout>\n#include <QStringList>\n#include <QKeyEvent>\n#include <QAbstractItemView>\n#include <QTimer>\n#include <QApplication>\n#include <QListView>\n#include <QDesktopWidget>\n#include <QApplication>\n#include <QStringListModel>\nCLANG_DIAG_ON(deprecated)\nCLANG_DIAG_ON(uninitialized)\n\n#include \"Engine\/Plugin.h\"\n#include \"Gui\/LineEdit.h\"\n#include \"Gui\/GuiApplicationManager.h\"\n\n\nstruct CompleterLineEditPrivate\n{\n QDialog* dialog;\n QListView* listView;\n QStringListModel* model;\n QStringList words,ids;\n bool quickExitEnabled;\n\n CompleterLineEditPrivate(const QStringList & displayWords,\n const QStringList & internalIds,\n bool quickExit,\n QDialog* parent)\n : dialog(parent)\n , listView(NULL)\n , model(NULL)\n , words(displayWords)\n , ids(internalIds)\n , quickExitEnabled(quickExit)\n {\n assert( displayWords.size() == internalIds.size() );\n }\n};\n\nCompleterLineEdit::CompleterLineEdit(const QStringList & displayWords,\n const QStringList & internalIds,\n bool quickExit,\n QDialog* parent)\n : LineEdit(parent)\n , _imp( new CompleterLineEditPrivate(displayWords,internalIds,quickExit,parent) )\n{\n _imp->listView = new QListView(this);\n _imp->model = new QStringListModel(this);\n _imp->listView->setWindowFlags(Qt::ToolTip);\n _imp->listView->setModel(_imp->model);\n connect( this, SIGNAL( textChanged(QString) ), this, SLOT( filterText(QString) ) );\n connect( _imp->listView, SIGNAL( clicked(QModelIndex) ), this, SLOT( setTextFromIndex(QModelIndex) ) );\n}\n\nCompleterLineEdit::~CompleterLineEdit()\n{\n}\n\nQListView*\nCompleterLineEdit::getView() const\n{\n return _imp->listView;\n}\n\nvoid\nCompleterLineEdit::filterText(const QString & txt)\n{\n QStringList sl;\n\n if ( txt.isEmpty() ) {\n sl = _imp->words;\n } else {\n for (int i = 0; i < _imp->ids.size(); ++i) {\n if ( _imp->ids[i].contains(txt,Qt::CaseInsensitive) ) {\n sl << _imp->words[i];\n }\n }\n }\n _imp->model->setStringList(sl);\n _imp->listView->setModel(_imp->model);\n\n int rowCount = _imp->model->rowCount();\n if (rowCount == 0) {\n return;\n }\n\n QPoint p = mapToGlobal( QPoint( 0,height() ) );\n QDesktopWidget* desktop = QApplication::desktop();\n QRect screen = desktop->screenGeometry();\n double maxHeight = ( screen.height() - p.y() ) * 0.8;\n QFontMetrics fm = _imp->listView->fontMetrics();\n maxHeight = std::min( maxHeight, ( rowCount * fm.height() * 1.2 + fm.height() ) );\n\n \/\/ Position the text edit\n _imp->listView->resize(width(),maxHeight);\n\n _imp->listView->move(p);\n _imp->listView->show();\n}\n\nvoid\nCompleterLineEdit::setTextFromIndex(const QModelIndex & index)\n{\n QString text = index.data().toString();\n\n setText(text);\n emit itemCompletionChosen();\n _imp->listView->hide();\n if (_imp->quickExitEnabled) {\n _imp->dialog->accept();\n }\n}\n\nvoid\nCompleterLineEdit::keyPressEvent(QKeyEvent* e)\n{\n int key = e->key();\n bool viewVisible = !_imp->listView->isHidden();\n\n assert( _imp->listView->model() );\n int count = _imp->listView->model()->rowCount();\n QModelIndex currentIndex = _imp->listView->currentIndex();\n\n if (key == Qt::Key_Escape) {\n if (_imp->quickExitEnabled) {\n _imp->dialog->reject();\n } else {\n if ( _imp->listView->isVisible() ) {\n _imp->listView->hide();\n } else {\n _imp->dialog->reject();\n }\n }\n e->accept();\n } else if (key == Qt::Key_Down) {\n if (viewVisible) {\n int row = currentIndex.row() + 1;\n\n \/\/\/Handle circular selection\n if (row >= count) {\n row = 0;\n }\n\n QModelIndex index = _imp->listView->model()->index(row, 0);\n _imp->listView->setCurrentIndex(index);\n }\n } else if (key == Qt::Key_Up) {\n if (viewVisible) {\n int row = currentIndex.row() - 1;\n\n \/\/\/Handle circular selection\n if (row < 0) {\n row = count - 1;\n }\n\n QModelIndex index = _imp->listView->model()->index(row, 0);\n _imp->listView->setCurrentIndex(index);\n }\n } else if ( (key == Qt::Key_Enter) || (key == Qt::Key_Return) ) {\n _imp->listView->hide();\n if (_imp->model->rowCount() == 1) {\n setText( _imp->model->index(0).data().toString() );\n emit itemCompletionChosen();\n if (_imp->quickExitEnabled) {\n _imp->dialog->accept();\n }\n e->accept();\n } else {\n const QItemSelection selection = _imp->listView->selectionModel()->selection();\n QModelIndexList indexes = selection.indexes();\n if (indexes.size() == 1) {\n setText( _imp->model->index( indexes[0].row() ).data().toString() );\n emit itemCompletionChosen();\n if (_imp->quickExitEnabled) {\n _imp->dialog->accept();\n }\n e->accept();\n } else {\n QLineEdit::keyPressEvent(e);\n }\n }\n\n } else {\n QLineEdit::keyPressEvent(e);\n }\n} \/\/ keyPressEvent\n\nvoid\nCompleterLineEdit::showCompleter()\n{\n filterText(\"\");\n}\n\nstruct NodeCreationDialogPrivate\n{\n QVBoxLayout* layout;\n CompleterLineEdit* textEdit;\n std::vector<Natron::Plugin*> items;\n\n NodeCreationDialogPrivate()\n : layout(NULL)\n , textEdit(NULL)\n , items( appPTR->getPluginsList() )\n {\n }\n};\n\nNodeCreationDialog::NodeCreationDialog(QWidget* parent)\n : QDialog(parent)\n , _imp( new NodeCreationDialogPrivate() )\n{\n setWindowTitle( tr(\"Node creation tool\") );\n setWindowFlags(Qt::Window | Qt::CustomizeWindowHint);\n setObjectName(\"nodeCreationDialog\");\n setAttribute(Qt::WA_DeleteOnClose,false);\n _imp->layout = new QVBoxLayout(this);\n _imp->layout->setContentsMargins(0, 0, 0, 0);\n\n\n QStringList ids;\n QStringList names;\n for (unsigned int i = 0; i < _imp->items.size(); ++i) {\n ids.push_back( _imp->items[i]->getPluginID() );\n names.push_back( _imp->items[i]->getPluginLabel() );\n }\n ids.sort();\n names.sort();\n _imp->textEdit = new CompleterLineEdit(ids,names,true,this);\n\n QPoint global = QCursor::pos();\n QSize sizeH = sizeHint();\n global.rx() -= sizeH.width() \/ 2;\n global.ry() -= sizeH.height() \/ 2;\n move( global.x(), global.y() );\n\n _imp->layout->addWidget(_imp->textEdit);\n _imp->textEdit->setFocus();\n QTimer::singleShot( 25, _imp->textEdit, SLOT( showCompleter() ) );\n}\n\nNodeCreationDialog::~NodeCreationDialog()\n{\n}\n\nQString\nNodeCreationDialog::getNodeName() const\n{\n return _imp->textEdit->text();\n}\n\nvoid\nNodeCreationDialog::keyPressEvent(QKeyEvent* e)\n{\n if ( (e->key() == Qt::Key_Return) || (e->key() == Qt::Key_Enter) ) {\n accept();\n } else if (e->key() == Qt::Key_Escape) {\n reject();\n } else {\n QDialog::keyPressEvent(e);\n }\n}\n\nvoid\nNodeCreationDialog::changeEvent(QEvent* e)\n{\n if (e->type() == QEvent::ActivationChange) {\n if ( !isActiveWindow() ) {\n reject();\n\n return;\n }\n }\n QDialog::changeEvent(e);\n}\n\n<commit_msg>Fix a bug with the node creation dialog where on windows it would not create the node when clicking an entry in the menu<commit_after>\/\/ Natron\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 \"NodeCreationDialog.h\"\n\nCLANG_DIAG_OFF(deprecated)\nCLANG_DIAG_OFF(uninitialized)\n#include <QVBoxLayout>\n#include <QStringList>\n#include <QKeyEvent>\n#include <QAbstractItemView>\n#include <QTimer>\n#include <QApplication>\n#include <QListView>\n#include <QDesktopWidget>\n#include <QApplication>\n#include <QStringListModel>\nCLANG_DIAG_ON(deprecated)\nCLANG_DIAG_ON(uninitialized)\n\n#include \"Engine\/Plugin.h\"\n#include \"Gui\/LineEdit.h\"\n#include \"Gui\/GuiApplicationManager.h\"\n\n\nstruct CompleterLineEditPrivate\n{\n QDialog* dialog;\n QListView* listView;\n QStringListModel* model;\n QStringList words,ids;\n bool quickExitEnabled;\n\n CompleterLineEditPrivate(const QStringList & displayWords,\n const QStringList & internalIds,\n bool quickExit,\n QDialog* parent)\n : dialog(parent)\n , listView(NULL)\n , model(NULL)\n , words(displayWords)\n , ids(internalIds)\n , quickExitEnabled(quickExit)\n {\n assert( displayWords.size() == internalIds.size() );\n }\n};\n\nCompleterLineEdit::CompleterLineEdit(const QStringList & displayWords,\n const QStringList & internalIds,\n bool quickExit,\n QDialog* parent)\n : LineEdit(parent)\n , _imp( new CompleterLineEditPrivate(displayWords,internalIds,quickExit,parent) )\n{\n _imp->listView = new QListView(this);\n _imp->model = new QStringListModel(this);\n _imp->listView->setWindowFlags(Qt::ToolTip);\n _imp->listView->setModel(_imp->model);\n connect( this, SIGNAL( textChanged(QString) ), this, SLOT( filterText(QString) ) );\n connect( _imp->listView, SIGNAL( clicked(QModelIndex) ), this, SLOT( setTextFromIndex(QModelIndex) ) );\n}\n\nCompleterLineEdit::~CompleterLineEdit()\n{\n}\n\nQListView*\nCompleterLineEdit::getView() const\n{\n return _imp->listView;\n}\n\nvoid\nCompleterLineEdit::filterText(const QString & txt)\n{\n QStringList sl;\n\n if ( txt.isEmpty() ) {\n sl = _imp->words;\n } else {\n for (int i = 0; i < _imp->ids.size(); ++i) {\n if ( _imp->ids[i].contains(txt,Qt::CaseInsensitive) ) {\n sl << _imp->words[i];\n }\n }\n }\n _imp->model->setStringList(sl);\n _imp->listView->setModel(_imp->model);\n\n int rowCount = _imp->model->rowCount();\n if (rowCount == 0) {\n return;\n }\n\n QPoint p = mapToGlobal( QPoint( 0,height() ) );\n QDesktopWidget* desktop = QApplication::desktop();\n QRect screen = desktop->screenGeometry();\n double maxHeight = ( screen.height() - p.y() ) * 0.8;\n QFontMetrics fm = _imp->listView->fontMetrics();\n maxHeight = std::min( maxHeight, ( rowCount * fm.height() * 1.2 + fm.height() ) );\n\n \/\/ Position the text edit\n _imp->listView->resize(width(),maxHeight);\n\n _imp->listView->move(p);\n _imp->listView->show();\n}\n\nvoid\nCompleterLineEdit::setTextFromIndex(const QModelIndex & index)\n{\n QString text = index.data().toString();\n\n setText(text);\n emit itemCompletionChosen();\n _imp->listView->hide();\n if (_imp->quickExitEnabled) {\n _imp->dialog->accept();\n }\n}\n\nvoid\nCompleterLineEdit::keyPressEvent(QKeyEvent* e)\n{\n int key = e->key();\n bool viewVisible = !_imp->listView->isHidden();\n\n assert( _imp->listView->model() );\n int count = _imp->listView->model()->rowCount();\n QModelIndex currentIndex = _imp->listView->currentIndex();\n\n if (key == Qt::Key_Escape) {\n if (_imp->quickExitEnabled) {\n _imp->dialog->reject();\n } else {\n if ( _imp->listView->isVisible() ) {\n _imp->listView->hide();\n } else {\n _imp->dialog->reject();\n }\n }\n e->accept();\n } else if (key == Qt::Key_Down) {\n if (viewVisible) {\n int row = currentIndex.row() + 1;\n\n \/\/\/Handle circular selection\n if (row >= count) {\n row = 0;\n }\n\n QModelIndex index = _imp->listView->model()->index(row, 0);\n _imp->listView->setCurrentIndex(index);\n }\n } else if (key == Qt::Key_Up) {\n if (viewVisible) {\n int row = currentIndex.row() - 1;\n\n \/\/\/Handle circular selection\n if (row < 0) {\n row = count - 1;\n }\n\n QModelIndex index = _imp->listView->model()->index(row, 0);\n _imp->listView->setCurrentIndex(index);\n }\n } else if ( (key == Qt::Key_Enter) || (key == Qt::Key_Return) ) {\n _imp->listView->hide();\n if (_imp->model->rowCount() == 1) {\n setText( _imp->model->index(0).data().toString() );\n emit itemCompletionChosen();\n if (_imp->quickExitEnabled) {\n _imp->dialog->accept();\n }\n e->accept();\n } else {\n const QItemSelection selection = _imp->listView->selectionModel()->selection();\n QModelIndexList indexes = selection.indexes();\n if (indexes.size() == 1) {\n setText( _imp->model->index( indexes[0].row() ).data().toString() );\n emit itemCompletionChosen();\n if (_imp->quickExitEnabled) {\n _imp->dialog->accept();\n }\n e->accept();\n } else {\n QLineEdit::keyPressEvent(e);\n }\n }\n\n } else {\n QLineEdit::keyPressEvent(e);\n }\n} \/\/ keyPressEvent\n\nvoid\nCompleterLineEdit::showCompleter()\n{\n filterText(\"\");\n}\n\nstruct NodeCreationDialogPrivate\n{\n QVBoxLayout* layout;\n CompleterLineEdit* textEdit;\n std::vector<Natron::Plugin*> items;\n\n NodeCreationDialogPrivate()\n : layout(NULL)\n , textEdit(NULL)\n , items( appPTR->getPluginsList() )\n {\n }\n};\n\nNodeCreationDialog::NodeCreationDialog(QWidget* parent)\n : QDialog(parent)\n , _imp( new NodeCreationDialogPrivate() )\n{\n setWindowTitle( tr(\"Node creation tool\") );\n setWindowFlags(Qt::Window | Qt::CustomizeWindowHint);\n setObjectName(\"nodeCreationDialog\");\n setAttribute(Qt::WA_DeleteOnClose,false);\n _imp->layout = new QVBoxLayout(this);\n _imp->layout->setContentsMargins(0, 0, 0, 0);\n\n\n QStringList ids;\n QStringList names;\n for (unsigned int i = 0; i < _imp->items.size(); ++i) {\n ids.push_back( _imp->items[i]->getPluginID() );\n names.push_back( _imp->items[i]->getPluginLabel() );\n }\n ids.sort();\n names.sort();\n _imp->textEdit = new CompleterLineEdit(ids,names,true,this);\n\n QPoint global = QCursor::pos();\n QSize sizeH = sizeHint();\n global.rx() -= sizeH.width() \/ 2;\n global.ry() -= sizeH.height() \/ 2;\n move( global.x(), global.y() );\n\n _imp->layout->addWidget(_imp->textEdit);\n _imp->textEdit->setFocus();\n QTimer::singleShot( 25, _imp->textEdit, SLOT( showCompleter() ) );\n}\n\nNodeCreationDialog::~NodeCreationDialog()\n{\n}\n\nQString\nNodeCreationDialog::getNodeName() const\n{\n return _imp->textEdit->text();\n}\n\nvoid\nNodeCreationDialog::keyPressEvent(QKeyEvent* e)\n{\n if ( (e->key() == Qt::Key_Return) || (e->key() == Qt::Key_Enter) ) {\n accept();\n } else if (e->key() == Qt::Key_Escape) {\n reject();\n } else {\n QDialog::keyPressEvent(e);\n }\n}\n\nvoid\nNodeCreationDialog::changeEvent(QEvent* e)\n{\n if (e->type() == QEvent::ActivationChange) {\n if ( !isActiveWindow() && qApp->activeWindow() != _imp->textEdit->getView() ) {\n reject();\n\n return;\n }\n }\n QDialog::changeEvent(e);\n}\n\n<|endoftext|>"} {"text":"<commit_before>#include <jni.h>\r\n#include <stdlib.h>\r\n\r\n#include \"lib\/Log.h\"\r\n#include \"data_core\/base\/HashTable.h\"\r\n#include <sys\/socket.h>\r\n#include <netinet\/in.h>\r\n#include <arpa\/inet.h>\r\n\r\n#include <fcntl.h>\r\n\r\n#include <sys\/epoll.h>\r\n#include <pthread.h>\r\n\r\n#include <errno.h>\r\n#define MAXBUFLEN \t1024\r\n#define MAXEVENTS 100\r\n\r\nvoid test(signed char * message);\r\nstatic void make_sendipv4addr(struct sockaddr_in *addr, int remoteport);\r\nint setSend(const char *ipAddr);\r\nint sendPackege(int sockd, const void * buffer, int PackegeSize, unsigned int mode);\r\nstatic void make_recvipv4addr(struct sockaddr_in *addr, const int localport);\r\nint recvPacket(int sockd);\r\nstatic unsigned short GetSocketPort(int sd);\r\nint setNonBlocking(int sock);\r\nvoid setEpoll(int sock);\r\nint sendData(int sockd, const char *buffer);\r\nvoid sendPackeges(int sockd, const char *buffer);\r\nvoid test2();\r\nvoid epollLooper(int epollFD);\r\n\r\nint epollFD = 0;\r\nint listeningSocketFD = 0;\r\nint connectingSocketFD = 0;\r\nint sendingSocketFD = 0;\r\n\r\nint PackegeSize = 1024;\r\n\r\nint dataLength = 0;\r\nint sentLength = 0;\r\nint packegesNum = 0;\r\nint lastPackegeSize = 0;\r\nint sentRuturnLength = 0;\r\nconst char *dataBuffer;\r\nbool isSocketBufferFull = false;\r\n\r\nchar target[15] = \"\";\r\n\r\n\/\/#define LOG_TAG \"OpenHttp\"\r\n\/\/#define LOGE(...) __android_log_print(ANDROID_LOG_ERROR,LOG_TAG,__VA_ARGS__)\r\nextern \"C\"\r\nJNIEXPORT jint Java_com_open_clib_MyHttpJNI_nativeSend(JNIEnv *env, jobject obj, jbyteArray ip, jbyteArray url, jint method, jbyteArray header, jbyteArray body, jint start, jint length, jint id) {\r\n\r\n\tchar * ip_buffer;\r\n\tchar * url_buffer;\r\n\tchar * header_buffer;\r\n\r\n\tsigned char * body_buffer = (signed char*) malloc(length * sizeof(char));\r\n\tenv->GetByteArrayRegion(body, start, length, body_buffer);\r\n\tLog(\"hello\");\r\n\r\n\treturn (jint) 1;\r\n}\r\n\r\nextern \"C\"\r\nJNIEXPORT jint Java_com_open_clib_MyHttpJNI_test(JNIEnv *env, jobject obj, jbyteArray message) {\r\n\r\n\tint length = env->GetArrayLength(message);\r\n\tsigned char * body_buffer = (signed char*) malloc(length + 1 * sizeof(char));\r\n\tenv->GetByteArrayRegion(message, 0, length, body_buffer);\r\n\tbody_buffer[length] = 0;\r\n\tLog((const char*) body_buffer);\r\n\r\n\/\/\ttest(body_buffer);\r\n\ttest2();\r\n\treturn (jint) 1;\r\n}\r\n\r\nvoid test(signed char * message) {\r\n\tchar * buffer = (char*) malloc(1024 * 3 * sizeof(char));\r\n\tfor (int i = 1; i < 1024 * 3 - 2; i++) {\r\n\t\t*(buffer + i) = i \/ 100 + 1;\r\n\t}\r\n\t*(buffer + 1024 * 3 - 1) = 0;\r\n\r\n\tint socket = setSend(\"192.168.1.7\");\r\n\/\/\tsendPacket(socket,\r\n\/\/\t\t\t\"GET \/index.html HTTP\/1.1\\r\\nHost: www.testhttp.com\\r\\n\\r\\n\\r\\n\\r\\n\");\r\n\/\/\tsendPacket(socket, buffer);\r\n\tchar target[15] = \"\";\r\n\tparseNubmerToString((int) GetSocketPort(socket), target);\r\n\/\/\tparseNubmerToString(9555444, target);\r\n\tLog((const char*) \"Connected @ \");\r\n\tLog((const char*) target);\r\n\trecvPacket(socket);\r\n}\r\n\r\nvoid *epollLooperThread(void *arg) {\r\n\tepollLooper(epollFD);\r\n}\r\nvoid test2() {\r\n\r\n\tchar * buffer = (char*) malloc(1024 * 3 * sizeof(char));\r\n\tfor (int i = 1; i < 1024 * 3 - 2; i++) {\r\n\t\t*(buffer + i) = i \/ 100 + 1;\r\n\t}\r\n\t*(buffer + 1024 * 3 - 1) = 0;\r\n\r\n\tsendingSocketFD = setSend(\"192.168.1.7\");\r\n\tsetEpoll(sendingSocketFD);\r\n\r\n\tpthread_t epollLooperPthread;\r\n\tint ret = pthread_create(&epollLooperPthread, NULL, epollLooperThread, (void *) 1);\r\n\tsleep(1);\r\n\tsendData(sendingSocketFD, buffer);\r\n\r\n}\r\n\r\nvoid epollLooper(int epollFD) {\r\n\r\n\tstruct epoll_event events[MAXEVENTS];\r\n\tint numEvents = 0;\r\n\tLog((const char*) \"epollLooper started ! \");\r\n\twhile (true) {\r\n\t\tnumEvents = epoll_wait(epollFD, events, MAXEVENTS, 1000);\r\n\t\tLog((const char*) \"epollLooper events\");\r\n\r\n\t\tfor (int i = 0; i < numEvents; ++i) {\r\n\t\t\tLog((const char*) \"resolve event\");\r\n\t\t\tif (events[i].data.fd == listeningSocketFD) {\r\n\t\t\t\tLog((const char*) \"resolve event 新建连接\");\r\n\t\t\t\tstruct sockaddr clientAddress;\r\n\t\t\t\tsocklen_t clientaddrLen = (socklen_t) sizeof(clientAddress);\r\n\t\t\t\tconnectingSocketFD = accept(listeningSocketFD, &clientAddress, &(clientaddrLen));\r\n\t\t\t\tepoll_event* clientEvent = new epoll_event();\r\n\t\t\t\tclientEvent->data.fd = connectingSocketFD;\r\n\t\t\t\tclientEvent->events = EPOLLIN | EPOLLET;\r\n\t\t\t\tepoll_ctl(epollFD, EPOLL_CTL_ADD, connectingSocketFD, clientEvent);\r\n\t\t\t}\r\n\t\t\tif (events[i].events & EPOLLIN) \/\/接收到数据，读socket\r\n\t\t\t{\r\n\t\t\t\tLog((const char*) \"resolve event 接收到数据\");\r\n\t\t\t\trecvPacket(events[i].data.fd);\r\n\t\t\t}\r\n\t\t\tif (events[i].events & EPOLLOUT) {\r\n\t\t\t\tLog((const char*) \"resolve event EPOLLOUT\");\r\n\r\n\t\t\t\tstruct epoll_event event = events[i];\r\n\t\t\t\tif (events[i].data.fd == sendingSocketFD) {\r\n\t\t\t\t\tisSocketBufferFull = false;\r\n\t\t\t\t\tLog((const char*) \"缓冲区可写\");\r\n\t\t\t\t\tsendPackeges(sendingSocketFD, dataBuffer);\r\n\t\t\t\t\tevent.events = EPOLLIN | EPOLLET;\r\n\/\/\t\t\t\t\tepoll_ctl(epollFD, EPOLL_CTL_MOD, sendingSocketFD, &event);\r\n\t\t\t\t}\r\n\r\n\t\t\t}\r\n\r\n\t\t\t{\r\n\t\t\t\t\/\/其他的处理\r\n\t\t\t\tLog((const char*) \"事件@\");\r\n\t\t\t\tparseNubmerToString(events[i].events, target);\r\n\t\t\t\tLog((const char*) target);\r\n\t\t\t}\r\n\t\t}\r\n\t}\r\n}\r\n\r\nint sendData(int sockd, const char *buffer) {\r\n\tLog((const char*) \"sendData\");\r\n\tdataBuffer = buffer;\r\n\tdataLength = strlen(dataBuffer);\r\n\tsentLength = 0;\r\n\r\n\tpackegesNum = dataLength \/ PackegeSize;\r\n\tlastPackegeSize = dataLength % PackegeSize;\r\n\tif (lastPackegeSize != 0) {\r\n\t\tpackegesNum = dataLength \/ PackegeSize + 1;\r\n\t}\r\n\r\n\tsendPackeges(sockd, dataBuffer);\r\n\/\/\tsend(sockd, str, strlen(str), 0);\r\n\treturn 1;\r\n}\r\n\r\nvoid sendPackeges(int sockd, const char *buffer) {\r\n\tif (packegesNum <= 0 || sentLength >= dataLength) {\r\n\t\treturn;\r\n\t}\r\n\r\n\tLog((const char*) \"sendPackeges\");\r\n\tfor (int i = sentLength \/ PackegeSize; i < packegesNum - 1; i++) {\r\n\r\n\t\tint sentPackegeLength = sendPackege(sockd, buffer, PackegeSize, 0);\r\n\r\n\t\tif (isSocketBufferFull) {\r\n\t\t\treturn;\r\n\t\t}\r\n\t\tsentLength += sentPackegeLength;\r\n\t\tbuffer = buffer + PackegeSize;\r\n\t}\r\n\r\n\tif (lastPackegeSize != 0) {\r\n\t\tsentLength += sendPackege(sockd, buffer, lastPackegeSize, 0);\r\n\t} else {\r\n\t\tsentLength += sendPackege(sockd, buffer, PackegeSize, 0);\r\n\t}\r\n}\r\n\r\nint sendPackege(int sockd, const void * buffer, int PackegeSize, unsigned int mode) {\r\n\tLog((const char*) \"send ont Packege\");\r\n\tint sentPackegeLength = send(sockd, buffer, PackegeSize, 0);\r\n\tif (sentPackegeLength == -1) {\r\n\t\tif (errno == EAGAIN) {\r\n\t\t\tsentPackegeLength = PackegeSize;\r\n\t\t\tisSocketBufferFull = true;\r\n\t\t\tLog((const char*) \"缓冲区已满\");\r\n\t\t\tsentPackegeLength = 0;\r\n\t\t} else {\r\n\t\t\tsentPackegeLength = 0;\r\n\t\t}\r\n\t}\r\n\treturn sentPackegeLength;\r\n}\r\n\r\nstatic void make_sendipv4addr(struct sockaddr_in *addr, int remoteport) {\r\n\tmemset(addr, 0, sizeof(struct sockaddr_in));\r\n\taddr->sin_family = AF_INET;\r\n\taddr->sin_port = htons(remoteport);\r\n}\r\n\r\n\r\nint setSend(const char *ipAddr) {\r\n\tint sockd = 0;\r\n\tstruct sockaddr_in addr;\r\n\tmake_sendipv4addr(&addr, 8091);\r\n\tsockd = socket(AF_INET, SOCK_STREAM, 0);\r\n\taddr.sin_addr.s_addr = inet_addr(\"192.168.1.7\");\r\n\r\n\tstruct sockaddr_in serveraddr;\r\n\tmake_recvipv4addr(&serveraddr, 6868);\r\n\tint isReUsedPort = 1;\r\n\tint sendBuffSize = 1024;\r\n\tsetsockopt(sockd, SOL_SOCKET, SO_REUSEADDR, &(isReUsedPort), sizeof(isReUsedPort));\r\n\tsetsockopt(sockd, SOL_SOCKET, SO_SNDBUF, &sendBuffSize, sizeof(sendBuffSize));\r\n\r\n\tif (-1 == bind(sockd, (struct sockaddr *) &serveraddr, sizeof(serveraddr))) {\r\n\t\tLog((const char*) \"bind fail !\\r\\n\");\r\n\t\treturn -1;\r\n\t}\r\n\tLog((const char*) \"bind ok !\\r\\n\");\r\n\r\n\/\/\tif (-1 == listen(sockd, 5)) {\r\n\/\/\t\tLog((const char*) \"listen fail !\\r\\n\");\r\n\/\/\t\treturn -1;\r\n\/\/\t}\r\n\/\/\tLog((const char*) \"listen ok\\r\\n\");\r\n\r\n\tint status = connect(sockd, (struct sockaddr *) &addr, sizeof(addr));\r\n\r\n\tif (status != 0) {\r\n\r\n\t\tparseNubmerToString(errno, target);\r\n\t\tLog((const char*) target);\r\n\t\tLog((const char*) \"Connect fail!\\n\");\r\n\t\treturn -1;\r\n\t}\r\n\tLog((const char*) \"Connected\\n\");\r\n\tsetNonBlocking(sockd);\r\n\tif ((errno == EAGAIN) || (errno == EWOULDBLOCK)) {\r\n\/\/non-blocking模式下无新connection请求，跳出while (1)\r\n\t}\r\n\treturn sockd;\r\n}\r\n\r\nvoid setEpoll(int sock) {\r\n\tepollFD = epoll_create(10);\r\n\tstruct epoll_event event;\r\n\r\n\tevent.data.fd = (sock);\r\n\tevent.events = EPOLLIN | EPOLLOUT | EPOLLET;\r\n\r\n\tepoll_ctl(epollFD, EPOLL_CTL_ADD, sock, &event);\r\n\r\n\tparseNubmerToString(epollFD, target);\r\n\tLog((const char*) \"setEpoll@\");\r\n\tLog((const char*) target);\r\n\r\n}\r\n\r\nint setNonBlocking(int sock) {\r\n\tint flags = 0;\r\n\r\n\tflags = fcntl(sock, F_GETFL, 0);\r\n\tflags |= O_NONBLOCK;\r\n\tfcntl(sock, F_SETFL, flags);\r\n\r\n\treturn 1;\r\n}\r\n\r\n\/\/返回当前socket绑定的端口\r\nstatic unsigned short GetSocketPort(int sd) {\r\n\tunsigned short port = 0;\r\n\tstruct sockaddr_in address;\r\n\tsocklen_t addressLength = sizeof(address);\r\n\tif (-1 == getsockname(sd, (struct sockaddr*) &address, &addressLength)) {\r\n\t} else {\r\n\t\tport = ntohs(address.sin_port);\r\n\t}\r\n\treturn port;\r\n}\r\n\r\n\/\/int sendPacket(int sockd, const char *str) {\r\n\/\/\/\/\tchar data[MAXBUFLEN] = { 0 };\r\n\/\/\/\/\tstrcpy(data, str);\r\n\/\/\tsend(sockd, str, strlen(str), 0);\r\n\/\/\tparseNubmerToString(strlen(str), target);\r\n\/\/\tLog((const char*) target);\r\n\/\/\treturn 1;\r\n\/\/}\r\n\r\nstatic void make_recvipv4addr(struct sockaddr_in *addr, const int localport) {\r\n\tmemset(addr, 0, sizeof(struct sockaddr_in));\r\n\r\n\taddr->sin_family = AF_INET;\r\n\taddr->sin_port = htons(localport);\r\n\taddr->sin_addr.s_addr = INADDR_ANY;\r\n}\r\n\r\nint setupRecv() {\r\n\tint optval = 1;\r\n\tint socklsn = 0;\r\n\tstruct sockaddr_in serveraddr;\r\n\r\n\tmake_recvipv4addr(&serveraddr, 6868);\r\n\r\n\tsocklsn = socket(AF_INET, SOCK_STREAM, 0);\r\n\r\n\tsetsockopt(optval, SOL_SOCKET, SO_REUSEADDR, &optval, sizeof(optval));\r\n\r\n\tbind(socklsn, (struct sockaddr *) &serveraddr, sizeof(serveraddr));\r\n\treturn socklsn;\r\n}\r\n\r\nint recvPacket(int sockd) {\r\n\tchar packet[MAXBUFLEN] = { 0 };\r\n\tchar * packetPtr = packet;\r\n\r\n\tint nBytesNeed = MAXBUFLEN;\r\n\tint nBytesRecv = 10;\r\n\r\n\twhile (nBytesRecv > 0) {\r\n\t\tLog((const char*) \"ready to recv\");\r\n\t\tnBytesRecv = recv(sockd, packetPtr, MAXBUFLEN, 0);\r\n\t\tLog((const char*) \"received\");\r\n\t\tLog((const char*) packetPtr);\r\n\r\n\t}\r\n\r\n\treturn 1;\r\n}\r\n<commit_msg>Packet data duplication.<commit_after>#include <jni.h>\r\n#include <stdlib.h>\r\n\r\n#include \"lib\/Log.h\"\r\n#include \"data_core\/base\/HashTable.h\"\r\n#include <sys\/socket.h>\r\n#include <netinet\/in.h>\r\n#include <arpa\/inet.h>\r\n\r\n#include <fcntl.h>\r\n\r\n#include <sys\/epoll.h>\r\n#include <pthread.h>\r\n\r\n#include <errno.h>\r\n#define MAXBUFLEN \t1024\r\n#define MAXEVENTS 100\r\n\r\nvoid test(signed char * message);\r\nstatic void make_sendipv4addr(struct sockaddr_in *addr, int remoteport);\r\nint setSend(const char *ipAddr);\r\nint sendPackege(int sockd, const void * buffer, int PackegeSize, unsigned int mode);\r\nstatic void make_recvipv4addr(struct sockaddr_in *addr, const int localport);\r\nint recvPacket(int sockd);\r\nstatic unsigned short GetSocketPort(int sd);\r\nint setNonBlocking(int sock);\r\nvoid setEpoll(int sock);\r\nint sendData(int sockd, const char *buffer);\r\nvoid sendPackeges(int sockd, const char *buffer);\r\nvoid test2();\r\nvoid epollLooper(int epollFD);\r\n\r\nint epollFD = 0;\r\nint listeningSocketFD = 0;\r\nint connectingSocketFD = 0;\r\nint sendingSocketFD = 0;\r\n\r\nint PackegeSize = 1024;\r\n\r\nint dataLength = 0;\r\nint sentLength = 0;\r\nint packegesNum = 0;\r\nint lastPackegeSize = 0;\r\nint sentRuturnLength = 0;\r\nconst char *dataBuffer;\r\nbool isSocketBufferFull = false;\r\n\r\nchar target[15] = \"\";\r\n\r\n\/\/#define LOG_TAG \"OpenHttp\"\r\n\/\/#define LOGE(...) __android_log_print(ANDROID_LOG_ERROR,LOG_TAG,__VA_ARGS__)\r\nextern \"C\"\r\nJNIEXPORT jint Java_com_open_clib_MyHttpJNI_nativeSend(JNIEnv *env, jobject obj, jbyteArray ip, jbyteArray url, jint method, jbyteArray header, jbyteArray body, jint start, jint length, jint id) {\r\n\r\n\tchar * ip_buffer;\r\n\tchar * url_buffer;\r\n\tchar * header_buffer;\r\n\r\n\tsigned char * body_buffer = (signed char*) malloc(length * sizeof(char));\r\n\tenv->GetByteArrayRegion(body, start, length, body_buffer);\r\n\tLog(\"hello\");\r\n\r\n\treturn (jint) 1;\r\n}\r\n\r\nextern \"C\"\r\nJNIEXPORT jint Java_com_open_clib_MyHttpJNI_test(JNIEnv *env, jobject obj, jbyteArray message) {\r\n\r\n\tint length = env->GetArrayLength(message);\r\n\tsigned char * body_buffer = (signed char*) malloc(length + 1 * sizeof(char));\r\n\tenv->GetByteArrayRegion(message, 0, length, body_buffer);\r\n\tbody_buffer[length] = 0;\r\n\tLog((const char*) body_buffer);\r\n\r\n\/\/\ttest(body_buffer);\r\n\ttest2();\r\n\treturn (jint) 1;\r\n}\r\n\r\nvoid test(signed char * message) {\r\n\tchar * buffer = (char*) malloc(1024 * 3 * sizeof(char));\r\n\tfor (int i = 1; i < 1024 * 3 - 2; i++) {\r\n\t\t*(buffer + i) = i \/ 100 + 1;\r\n\t}\r\n\t*(buffer + 1024 * 3 - 1) = 0;\r\n\r\n\tint socket = setSend(\"192.168.1.7\");\r\n\/\/\tsendPacket(socket,\r\n\/\/\t\t\t\"GET \/index.html HTTP\/1.1\\r\\nHost: www.testhttp.com\\r\\n\\r\\n\\r\\n\\r\\n\");\r\n\/\/\tsendPacket(socket, buffer);\r\n\tchar target[15] = \"\";\r\n\tparseNubmerToString((int) GetSocketPort(socket), target);\r\n\/\/\tparseNubmerToString(9555444, target);\r\n\tLog((const char*) \"Connected @ \");\r\n\tLog((const char*) target);\r\n\trecvPacket(socket);\r\n}\r\n\r\nvoid *epollLooperThread(void *arg) {\r\n\tepollLooper(epollFD);\r\n}\r\nvoid test2() {\r\n\r\n\tchar * buffer = (char*) malloc(1024 * 3 * sizeof(char));\r\n\tfor (int i = 1; i < 1024 * 3 - 2; i++) {\r\n\t\t*(buffer + i) = i \/ 100 + 1;\r\n\t}\r\n\t*(buffer + 1024 * 3 - 1) = 0;\r\n\r\n\tsendingSocketFD = setSend(\"192.168.1.7\");\r\n\tsetEpoll(sendingSocketFD);\r\n\r\n\tpthread_t epollLooperPthread;\r\n\tint ret = pthread_create(&epollLooperPthread, NULL, epollLooperThread, (void *) 1);\r\n\tsleep(1);\r\n\tsendData(sendingSocketFD, buffer);\r\n\r\n}\r\n\r\nvoid epollLooper(int epollFD) {\r\n\r\n\tstruct epoll_event events[MAXEVENTS];\r\n\tint numEvents = 0;\r\n\tLog((const char*) \"epollLooper started ! \");\r\n\twhile (true) {\r\n\t\tnumEvents = epoll_wait(epollFD, events, MAXEVENTS, 1000);\r\n\t\tLog((const char*) \"epollLooper events\");\r\n\r\n\t\tfor (int i = 0; i < numEvents; ++i) {\r\n\t\t\tLog((const char*) \"resolve event\");\r\n\t\t\tif (events[i].data.fd == listeningSocketFD) {\r\n\t\t\t\tLog((const char*) \"resolve event 新建连接\");\r\n\t\t\t\tstruct sockaddr clientAddress;\r\n\t\t\t\tsocklen_t clientaddrLen = (socklen_t) sizeof(clientAddress);\r\n\t\t\t\tconnectingSocketFD = accept(listeningSocketFD, &clientAddress, &(clientaddrLen));\r\n\t\t\t\tepoll_event* clientEvent = new epoll_event();\r\n\t\t\t\tclientEvent->data.fd = connectingSocketFD;\r\n\t\t\t\tclientEvent->events = EPOLLIN | EPOLLET;\r\n\t\t\t\tepoll_ctl(epollFD, EPOLL_CTL_ADD, connectingSocketFD, clientEvent);\r\n\t\t\t}\r\n\t\t\tif (events[i].events & EPOLLIN) \/\/接收到数据，读socket\r\n\t\t\t{\r\n\t\t\t\tLog((const char*) \"resolve event 接收到数据\");\r\n\t\t\t\trecvPacket(events[i].data.fd);\r\n\t\t\t}\r\n\t\t\tif (events[i].events & EPOLLOUT) {\r\n\t\t\t\tLog((const char*) \"resolve event EPOLLOUT\");\r\n\r\n\t\t\t\tstruct epoll_event event = events[i];\r\n\t\t\t\tif (events[i].data.fd == sendingSocketFD) {\r\n\t\t\t\t\tisSocketBufferFull = false;\r\n\t\t\t\t\tLog((const char*) \"缓冲区可写\");\r\n\t\t\t\t\tsendPackeges(sendingSocketFD, dataBuffer);\r\n\t\t\t\t\tevent.events = EPOLLIN | EPOLLET;\r\n\/\/\t\t\t\t\tepoll_ctl(epollFD, EPOLL_CTL_MOD, sendingSocketFD, &event);\r\n\t\t\t\t}\r\n\r\n\t\t\t}\r\n\r\n\t\t\t{\r\n\t\t\t\t\/\/其他的处理\r\n\t\t\t\tLog((const char*) \"事件@\");\r\n\t\t\t\tparseNubmerToString(events[i].events, target);\r\n\t\t\t\tLog((const char*) target);\r\n\t\t\t}\r\n\t\t}\r\n\t}\r\n}\r\n\r\nint sendData(int sockd, const char *buffer) {\r\n\tLog((const char*) \"sendData\");\r\n\tdataBuffer = buffer;\r\n\tdataLength = strlen(dataBuffer);\r\n\tsentLength = 0;\r\n\r\n\tpackegesNum = dataLength \/ PackegeSize;\r\n\tlastPackegeSize = dataLength % PackegeSize;\r\n\tif (lastPackegeSize != 0) {\r\n\t\tpackegesNum = dataLength \/ PackegeSize + 1;\r\n\t}\r\n\r\n\tsendPackeges(sockd, dataBuffer);\r\n\/\/\tsend(sockd, str, strlen(str), 0);\r\n\treturn 1;\r\n}\r\n\r\nvoid sendPackeges(int sockd, const char *buffer) {\r\n\tif (packegesNum <= 0 || sentLength >= dataLength) {\r\n\t\treturn;\r\n\t}\r\n\tbuffer = buffer + sentLength;\r\n\tLog((const char*) \"sendPackeges\");\r\n\tfor (int i = sentLength \/ PackegeSize; i < packegesNum - 1; i++) {\r\n\r\n\t\tint sentPackegeLength = sendPackege(sockd, buffer, PackegeSize, 0);\r\n\r\n\t\tif (isSocketBufferFull) {\r\n\t\t\treturn;\r\n\t\t}\r\n\t\tsentLength += sentPackegeLength;\r\n\t\tbuffer = buffer + PackegeSize;\r\n\t}\r\n\r\n\tif (lastPackegeSize != 0) {\r\n\t\tsentLength += sendPackege(sockd, buffer, lastPackegeSize, 0);\r\n\t} else {\r\n\t\tsentLength += sendPackege(sockd, buffer, PackegeSize, 0);\r\n\t}\r\n}\r\n\r\nint sendPackege(int sockd, const void * buffer, int PackegeSize, unsigned int mode) {\r\n\tLog((const char*) \"send ont Packege\");\r\n\tint sentPackegeLength = send(sockd, buffer, PackegeSize, 0);\r\n\tif (sentPackegeLength == -1) {\r\n\t\tif (errno == EAGAIN) {\r\n\t\t\tsentPackegeLength = PackegeSize;\r\n\t\t\tisSocketBufferFull = true;\r\n\t\t\tLog((const char*) \"缓冲区已满\");\r\n\t\t\tsentPackegeLength = 0;\r\n\t\t} else {\r\n\t\t\tsentPackegeLength = 0;\r\n\t\t}\r\n\t}\r\n\treturn sentPackegeLength;\r\n}\r\n\r\nstatic void make_sendipv4addr(struct sockaddr_in *addr, int remoteport) {\r\n\tmemset(addr, 0, sizeof(struct sockaddr_in));\r\n\taddr->sin_family = AF_INET;\r\n\taddr->sin_port = htons(remoteport);\r\n}\r\n\r\n\r\nint setSend(const char *ipAddr) {\r\n\tint sockd = 0;\r\n\tstruct sockaddr_in addr;\r\n\tmake_sendipv4addr(&addr, 8091);\r\n\tsockd = socket(AF_INET, SOCK_STREAM, 0);\r\n\taddr.sin_addr.s_addr = inet_addr(\"192.168.1.7\");\r\n\r\n\tstruct sockaddr_in serveraddr;\r\n\tmake_recvipv4addr(&serveraddr, 6868);\r\n\tint isReUsedPort = 1;\r\n\tint sendBuffSize = 1024;\r\n\tsetsockopt(sockd, SOL_SOCKET, SO_REUSEADDR, &(isReUsedPort), sizeof(isReUsedPort));\r\n\tsetsockopt(sockd, SOL_SOCKET, SO_SNDBUF, &sendBuffSize, sizeof(sendBuffSize));\r\n\r\n\tif (-1 == bind(sockd, (struct sockaddr *) &serveraddr, sizeof(serveraddr))) {\r\n\t\tLog((const char*) \"bind fail !\\r\\n\");\r\n\t\treturn -1;\r\n\t}\r\n\tLog((const char*) \"bind ok !\\r\\n\");\r\n\r\n\/\/\tif (-1 == listen(sockd, 5)) {\r\n\/\/\t\tLog((const char*) \"listen fail !\\r\\n\");\r\n\/\/\t\treturn -1;\r\n\/\/\t}\r\n\/\/\tLog((const char*) \"listen ok\\r\\n\");\r\n\r\n\tint status = connect(sockd, (struct sockaddr *) &addr, sizeof(addr));\r\n\r\n\tif (status != 0) {\r\n\r\n\t\tparseNubmerToString(errno, target);\r\n\t\tLog((const char*) target);\r\n\t\tLog((const char*) \"Connect fail!\\n\");\r\n\t\treturn -1;\r\n\t}\r\n\tLog((const char*) \"Connected\\n\");\r\n\tsetNonBlocking(sockd);\r\n\tif ((errno == EAGAIN) || (errno == EWOULDBLOCK)) {\r\n\/\/non-blocking模式下无新connection请求，跳出while (1)\r\n\t}\r\n\treturn sockd;\r\n}\r\n\r\nvoid setEpoll(int sock) {\r\n\tepollFD = epoll_create(10);\r\n\tstruct epoll_event event;\r\n\r\n\tevent.data.fd = (sock);\r\n\tevent.events = EPOLLIN | EPOLLOUT | EPOLLET;\r\n\r\n\tepoll_ctl(epollFD, EPOLL_CTL_ADD, sock, &event);\r\n\r\n\tparseNubmerToString(epollFD, target);\r\n\tLog((const char*) \"setEpoll@\");\r\n\tLog((const char*) target);\r\n\r\n}\r\n\r\nint setNonBlocking(int sock) {\r\n\tint flags = 0;\r\n\r\n\tflags = fcntl(sock, F_GETFL, 0);\r\n\tflags |= O_NONBLOCK;\r\n\tfcntl(sock, F_SETFL, flags);\r\n\r\n\treturn 1;\r\n}\r\n\r\n\/\/返回当前socket绑定的端口\r\nstatic unsigned short GetSocketPort(int sd) {\r\n\tunsigned short port = 0;\r\n\tstruct sockaddr_in address;\r\n\tsocklen_t addressLength = sizeof(address);\r\n\tif (-1 == getsockname(sd, (struct sockaddr*) &address, &addressLength)) {\r\n\t} else {\r\n\t\tport = ntohs(address.sin_port);\r\n\t}\r\n\treturn port;\r\n}\r\n\r\n\/\/int sendPacket(int sockd, const char *str) {\r\n\/\/\/\/\tchar data[MAXBUFLEN] = { 0 };\r\n\/\/\/\/\tstrcpy(data, str);\r\n\/\/\tsend(sockd, str, strlen(str), 0);\r\n\/\/\tparseNubmerToString(strlen(str), target);\r\n\/\/\tLog((const char*) target);\r\n\/\/\treturn 1;\r\n\/\/}\r\n\r\nstatic void make_recvipv4addr(struct sockaddr_in *addr, const int localport) {\r\n\tmemset(addr, 0, sizeof(struct sockaddr_in));\r\n\r\n\taddr->sin_family = AF_INET;\r\n\taddr->sin_port = htons(localport);\r\n\taddr->sin_addr.s_addr = INADDR_ANY;\r\n}\r\n\r\nint setupRecv() {\r\n\tint optval = 1;\r\n\tint socklsn = 0;\r\n\tstruct sockaddr_in serveraddr;\r\n\r\n\tmake_recvipv4addr(&serveraddr, 6868);\r\n\r\n\tsocklsn = socket(AF_INET, SOCK_STREAM, 0);\r\n\r\n\tsetsockopt(optval, SOL_SOCKET, SO_REUSEADDR, &optval, sizeof(optval));\r\n\r\n\tbind(socklsn, (struct sockaddr *) &serveraddr, sizeof(serveraddr));\r\n\treturn socklsn;\r\n}\r\n\r\nint recvPacket(int sockd) {\r\n\tchar packet[MAXBUFLEN] = { 0 };\r\n\tchar * packetPtr = packet;\r\n\r\n\tint nBytesNeed = MAXBUFLEN;\r\n\tint nBytesRecv = 10;\r\n\r\n\twhile (nBytesRecv > 0) {\r\n\t\tLog((const char*) \"ready to recv\");\r\n\t\tnBytesRecv = recv(sockd, packetPtr, MAXBUFLEN, 0);\r\n\t\tLog((const char*) \"received\");\r\n\t\tLog((const char*) packetPtr);\r\n\t}\r\n\r\n\treturn 1;\r\n}\r\n<|endoftext|>"} {"text":"<commit_before>#include \"FileStream.h\"\n\n#include <Windows.h>\n#include <stdio.h>\n#include <assert.h>\n\nclass FileStreamImpl {\n \nprivate:\n \/\/ Track the number of references to this filestream so\n \/\/ that we know whether or not we need to close it when\n \/\/ the object gets destroyed.\n uint32 m_ReferenceCount;\n\n HANDLE m_Handle;\n\npublic:\n FileStreamImpl(const CHAR *filename, EFileMode mode) \n : m_ReferenceCount(1)\n {\n\n\tDWORD dwDesiredAccess = GENERIC_READ;\n\tDWORD dwShareMode = 0;\n switch(mode) {\n default:\n case eFileMode_ReadBinary:\n case eFileMode_Read:\n \/\/ Do nothing.\n break;\n\n case eFileMode_Write:\n case eFileMode_WriteBinary:\n dwDesiredAccess = GENERIC_WRITE;\n break;\n\n case eFileMode_WriteAppend:\n case eFileMode_WriteBinaryAppend:\n\t\tdwDesiredAccess = FILE_APPEND_DATA;\n break;\n }\n\n m_Handle = CreateFile(filename, dwDesiredAccess, dwShareMode, NULL, 0, FILE_ATTRIBUTE_NORMAL, NULL);\n\tassert(m_Handle != INVALID_HANDLE_VALUE);\n }\n\n ~FileStreamImpl() {\n CloseHandle(m_Handle);\n }\n\n void IncreaseReferenceCount() { m_ReferenceCount++; }\n void DecreaseReferenceCount() { m_ReferenceCount--; }\n\n uint32 GetReferenceCount() { return m_ReferenceCount; }\n\n HANDLE GetFileHandle() const { return m_Handle; }\n};\n\nFileStream::FileStream(const CHAR *filename, EFileMode mode)\n : m_Impl(new FileStreamImpl(filename, mode))\n , m_Mode(mode)\n{\n strncpy_s(m_Filename, filename, kMaxFilenameSz);\n m_Filename[kMaxFilenameSz - 1] = CHAR('\\0');\n}\n \nFileStream::FileStream(const FileStream &other)\n : m_Impl(other.m_Impl)\n , m_Mode(other.m_Mode)\n{\n m_Impl->IncreaseReferenceCount();\n strncpy_s(m_Filename, other.m_Filename, kMaxFilenameSz);\n}\n\nFileStream &FileStream::operator=(const FileStream &other) {\n \n \/\/ We no longer reference this implementation.\n m_Impl->DecreaseReferenceCount();\n\n \/\/ If we're the last ones to reference it, then it should be destroyed.\n if(m_Impl->GetReferenceCount() <= 0) {\n assert(m_Impl->GetReferenceCount() == 0);\n delete m_Impl;\n m_Impl = 0;\n }\n\n m_Impl = other.m_Impl;\n m_Impl->IncreaseReferenceCount();\n\n m_Mode = other.m_Mode;\n strncpy_s(m_Filename, other.m_Filename, kMaxFilenameSz); \n\n return *this;\n}\n\nFileStream::~FileStream() {\n \/\/ We no longer reference this implementation.\n m_Impl->DecreaseReferenceCount();\n\n \/\/ If we're the last ones to reference it, then it should be destroyed.\n if(m_Impl->GetReferenceCount() <= 0) {\n assert(m_Impl->GetReferenceCount() == 0);\n delete m_Impl;\n m_Impl = 0;\n } \n}\n\nint32 FileStream::Read(uint8 *buf, uint32 bufSz) {\n\n if(\n m_Mode == eFileMode_Write ||\n m_Mode == eFileMode_WriteBinary ||\n m_Mode == eFileMode_WriteAppend ||\n m_Mode == eFileMode_WriteBinaryAppend\n ) {\n CHAR errStr[256];\n\t_sntprintf_s(errStr, 256, \"Cannot read from file '%s': File opened for reading.\", m_Filename);\n\tOutputDebugString(errStr);\n return -2;\n }\n\n HANDLE fp = m_Impl->GetFileHandle();\n if(INVALID_HANDLE_VALUE == fp)\n return -1;\n\n DWORD oldPosition = SetFilePointer(fp, 0, NULL, FILE_CURRENT);\n if(INVALID_SET_FILE_POINTER == oldPosition) {\n\tCHAR errStr[256];\n\t_sntprintf_s(errStr, 256, \"Error querying the file position before reading from file '%s'(0x%x).\", m_Filename, GetLastError());\n\tOutputDebugString(errStr);\n\treturn -1;\n }\n\n DWORD amtRead;\n BOOL success = ReadFile(fp, buf, bufSz, &amtRead, NULL);\n if(!success) {\n\tCHAR errStr[256];\n\t_sntprintf_s(errStr, 256, \"Error reading from file '%s'.\", m_Filename);\n\tOutputDebugString(errStr);\n return -1;\n }\n\n DWORD newPosition = SetFilePointer(fp, 0, NULL, FILE_CURRENT);\n if(INVALID_SET_FILE_POINTER == newPosition) {\n\tCHAR errStr[256];\n\t_sntprintf_s(errStr, 256, \"Error querying the file position after reading from file '%s'(0x%x).\", m_Filename, GetLastError());\n\tOutputDebugString(errStr);\n\treturn -1;\n }\n\n return newPosition - oldPosition;\n}\n\nint32 FileStream::Write(const uint8 *buf, uint32 bufSz) {\n if(\n m_Mode == eFileMode_Read ||\n m_Mode == eFileMode_ReadBinary\n ) {\n\tCHAR errStr[256];\n\t_sntprintf_s(errStr, 256, \"Cannot write to file '%s': File opened for writing.\", m_Filename);\n\tOutputDebugString(errStr);\n return -2;\n }\n\n HANDLE fp = m_Impl->GetFileHandle();\n if(NULL == fp)\n return -1;\n\n DWORD dwPos;\n if(m_Mode == eFileMode_WriteBinaryAppend || m_Mode == eFileMode_WriteAppend) {\n dwPos = SetFilePointer(fp, 0, NULL, FILE_END);\n }\n else {\n dwPos = SetFilePointer(fp, 0, NULL, FILE_CURRENT);\n }\n\n if(INVALID_SET_FILE_POINTER == dwPos) {\n\tCHAR errStr[256];\n\t_sntprintf_s(errStr, 256, \"Error querying the file position before reading to file '%s'(0x%x).\", m_Filename, GetLastError());\n\tOutputDebugString(errStr);\n\treturn -1;\n }\n\n while(!LockFile(fp, dwPos, 0, bufSz, 0)) Sleep(1);\n\n DWORD amtWritten;\n BOOL success = WriteFile(fp, buf, bufSz, &amtWritten, NULL);\n\n UnlockFile(fp, dwPos, 0, bufSz, 0);\n\n if(!success) {\n\tCHAR errStr[256];\n\t_sntprintf_s(errStr, 256, \"Error writing to file '%s'.\", m_Filename);\n\tOutputDebugString(errStr);\n return -1;\n }\n\n return amtWritten;\n}\n\nint32 FileStream::Tell() {\n HANDLE fp = m_Impl->GetFileHandle();\n if(NULL == fp) {\n return -1;\n }\n\n DWORD pos = SetFilePointer(fp, 0, NULL, FILE_CURRENT);\n if(INVALID_SET_FILE_POINTER == pos) {\n\tCHAR errStr[256];\n\t_sntprintf_s(errStr, 256, \"Error querying the file position before reading to file '%s'(0x%x).\", m_Filename, GetLastError());\n\tOutputDebugString(errStr);\n\treturn -1;\n }\n\n return pos;\n}\n\nbool FileStream::Seek(uint32 offset, ESeekPosition pos) {\n \n \/\/ We cannot seek in append mode.\n if(m_Mode == eFileMode_WriteAppend || m_Mode == eFileMode_WriteBinaryAppend)\n return false;\n\n HANDLE fp = m_Impl->GetFileHandle();\n if(NULL == fp) return false;\n\n DWORD origin = FILE_BEGIN;\n switch(pos) {\n default:\n case eSeekPosition_Beginning:\n \/\/ Do nothing\n break;\n\n case eSeekPosition_Current:\n origin = FILE_CURRENT;\n break;\n\n case eSeekPosition_End:\n origin = FILE_END;\n break;\n }\n\n if(SetFilePointer(fp, offset, NULL, origin) == INVALID_SET_FILE_POINTER)\n return false;\n\n return true;\n}\n\nvoid FileStream::Flush() {\n HANDLE fp = m_Impl->GetFileHandle();\n if(NULL == fp) return;\n\n FlushFileBuffers(fp);\n}\n<commit_msg>Fixed a lot of untested bugs with our windows filestream<commit_after>#include \"FileStream.h\"\n\n#include <Windows.h>\r\n#include <strsafe.h>\n\n#include <stdio.h>\n#include <assert.h>\n\nvoid ErrorExit(LPTSTR lpszFunction) \r\n{ \r\n \/\/ Retrieve the system error message for the last-error code\r\n\r\n LPVOID lpMsgBuf;\r\n LPVOID lpDisplayBuf;\r\n DWORD dw = GetLastError(); \r\n\r\n FormatMessage(\r\n FORMAT_MESSAGE_ALLOCATE_BUFFER | \r\n FORMAT_MESSAGE_FROM_SYSTEM |\r\n FORMAT_MESSAGE_IGNORE_INSERTS,\r\n NULL,\r\n dw,\r\n MAKELANGID(LANG_NEUTRAL, SUBLANG_DEFAULT),\r\n (LPTSTR) &lpMsgBuf,\r\n 0, NULL );\r\n\r\n \/\/ Display the error message and exit the process\r\n\r\n lpDisplayBuf = (LPVOID)LocalAlloc(LMEM_ZEROINIT, \r\n (lstrlen((LPCTSTR)lpMsgBuf) + lstrlen((LPCTSTR)lpszFunction) + 40) * sizeof(TCHAR)); \r\n StringCchPrintf((LPTSTR)lpDisplayBuf, \r\n LocalSize(lpDisplayBuf) \/ sizeof(TCHAR),\r\n TEXT(\"%s failed with error %d: %s\"), \r\n lpszFunction, dw, lpMsgBuf); \r\n MessageBox(NULL, (LPCTSTR)lpDisplayBuf, TEXT(\"Error\"), MB_OK); \r\n\r\n LocalFree(lpMsgBuf);\r\n LocalFree(lpDisplayBuf);\r\n ExitProcess(dw); \r\n}\n\nclass FileStreamImpl {\n \nprivate:\n \/\/ Track the number of references to this filestream so\n \/\/ that we know whether or not we need to close it when\n \/\/ the object gets destroyed.\n uint32 m_ReferenceCount;\n\n HANDLE m_Handle;\n\npublic:\n FileStreamImpl(const CHAR *filename, EFileMode mode) \n : m_ReferenceCount(1)\n {\n\n\tDWORD dwDesiredAccess = GENERIC_READ;\n DWORD dwOpenAction = OPEN_EXISTING;\n switch(mode) {\n default:\n case eFileMode_ReadBinary:\n case eFileMode_Read:\n \/\/ Do nothing.\n break;\n\n case eFileMode_Write:\n case eFileMode_WriteBinary:\n dwDesiredAccess = GENERIC_WRITE;\n dwOpenAction = CREATE_NEW;\n break;\n\n case eFileMode_WriteAppend:\n case eFileMode_WriteBinaryAppend:\n\t\t dwDesiredAccess = FILE_APPEND_DATA;\n dwOpenAction = CREATE_NEW;\n break;\n }\n\n m_Handle = CreateFile(filename, dwDesiredAccess, 0, NULL, dwOpenAction, FILE_ATTRIBUTE_NORMAL, NULL);\n\t if(m_Handle == INVALID_HANDLE_VALUE) {\n ErrorExit(TEXT(\"CreateFile\"));\n }\n }\n\n ~FileStreamImpl() {\n CloseHandle(m_Handle);\n }\n\n void IncreaseReferenceCount() { m_ReferenceCount++; }\n void DecreaseReferenceCount() { m_ReferenceCount--; }\n\n uint32 GetReferenceCount() { return m_ReferenceCount; }\n\n HANDLE GetFileHandle() const { return m_Handle; }\n};\n\nFileStream::FileStream(const CHAR *filename, EFileMode mode)\n : m_Impl(new FileStreamImpl(filename, mode))\n , m_Mode(mode)\n{\n strncpy_s(m_Filename, filename, kMaxFilenameSz);\n m_Filename[kMaxFilenameSz - 1] = CHAR('\\0');\n}\n \nFileStream::FileStream(const FileStream &other)\n : m_Impl(other.m_Impl)\n , m_Mode(other.m_Mode)\n{\n m_Impl->IncreaseReferenceCount();\n strncpy_s(m_Filename, other.m_Filename, kMaxFilenameSz);\n}\n\nFileStream &FileStream::operator=(const FileStream &other) {\n \n \/\/ We no longer reference this implementation.\n m_Impl->DecreaseReferenceCount();\n\n \/\/ If we're the last ones to reference it, then it should be destroyed.\n if(m_Impl->GetReferenceCount() <= 0) {\n assert(m_Impl->GetReferenceCount() == 0);\n delete m_Impl;\n m_Impl = 0;\n }\n\n m_Impl = other.m_Impl;\n m_Impl->IncreaseReferenceCount();\n\n m_Mode = other.m_Mode;\n strncpy_s(m_Filename, other.m_Filename, kMaxFilenameSz); \n\n return *this;\n}\n\nFileStream::~FileStream() {\n \/\/ We no longer reference this implementation.\n m_Impl->DecreaseReferenceCount();\n\n \/\/ If we're the last ones to reference it, then it should be destroyed.\n if(m_Impl->GetReferenceCount() <= 0) {\n assert(m_Impl->GetReferenceCount() == 0);\n delete m_Impl;\n m_Impl = 0;\n } \n}\n\nint32 FileStream::Read(uint8 *buf, uint32 bufSz) {\n\n if(\n m_Mode == eFileMode_Write ||\n m_Mode == eFileMode_WriteBinary ||\n m_Mode == eFileMode_WriteAppend ||\n m_Mode == eFileMode_WriteBinaryAppend\n ) {\n CHAR errStr[256];\n\t_sntprintf_s(errStr, 256, \"Cannot read from file '%s': File opened for reading.\", m_Filename);\n\tOutputDebugString(errStr);\n return -2;\n }\n\n HANDLE fp = m_Impl->GetFileHandle();\n if(INVALID_HANDLE_VALUE == fp)\n return -1;\n\n DWORD oldPosition = SetFilePointer(fp, 0, NULL, FILE_CURRENT);\n if(INVALID_SET_FILE_POINTER == oldPosition) {\n\tCHAR errStr[256];\n\t_sntprintf_s(errStr, 256, \"Error querying the file position before reading from file '%s'(0x%x).\", m_Filename, GetLastError());\n\tOutputDebugString(errStr);\n\treturn -1;\n }\n\n DWORD amtRead;\n BOOL success = ReadFile(fp, buf, bufSz, &amtRead, NULL);\n if(!success) {\n\tCHAR errStr[256];\n\t_sntprintf_s(errStr, 256, \"Error reading from file '%s'.\", m_Filename);\n\tOutputDebugString(errStr);\n return -1;\n }\n\n DWORD newPosition = SetFilePointer(fp, 0, NULL, FILE_CURRENT);\n if(INVALID_SET_FILE_POINTER == newPosition) {\n\tCHAR errStr[256];\n\t_sntprintf_s(errStr, 256, \"Error querying the file position after reading from file '%s'(0x%x).\", m_Filename, GetLastError());\n\tOutputDebugString(errStr);\n\treturn -1;\n }\n\n return newPosition - oldPosition;\n}\n\nint32 FileStream::Write(const uint8 *buf, uint32 bufSz) {\n if(\n m_Mode == eFileMode_Read ||\n m_Mode == eFileMode_ReadBinary\n ) {\n\tCHAR errStr[256];\n\t_sntprintf_s(errStr, 256, \"Cannot write to file '%s': File opened for writing.\", m_Filename);\n\tOutputDebugString(errStr);\n return -2;\n }\n\n HANDLE fp = m_Impl->GetFileHandle();\n if(NULL == fp)\n return -1;\n\n DWORD dwPos;\n if(m_Mode == eFileMode_WriteBinaryAppend || m_Mode == eFileMode_WriteAppend) {\n dwPos = SetFilePointer(fp, 0, NULL, FILE_END);\n }\n else {\n dwPos = SetFilePointer(fp, 0, NULL, FILE_CURRENT);\n }\n\n if(INVALID_SET_FILE_POINTER == dwPos) {\n\tCHAR errStr[256];\n\t_sntprintf_s(errStr, 256, \"Error querying the file position before reading to file '%s'(0x%x).\", m_Filename, GetLastError());\n\tOutputDebugString(errStr);\n\treturn -1;\n }\n\n while(!LockFile(fp, dwPos, 0, bufSz, 0)) Sleep(1);\n\n DWORD amtWritten;\n BOOL success = WriteFile(fp, buf, bufSz, &amtWritten, NULL);\n\n UnlockFile(fp, dwPos, 0, bufSz, 0);\n\n if(!success) {\n\tCHAR errStr[256];\n\t_sntprintf_s(errStr, 256, \"Error writing to file '%s'.\", m_Filename);\n\tOutputDebugString(errStr);\n return -1;\n }\n\n return amtWritten;\n}\n\nint32 FileStream::Tell() {\n HANDLE fp = m_Impl->GetFileHandle();\n if(NULL == fp) {\n return -1;\n }\n\n DWORD pos = SetFilePointer(fp, 0, NULL, FILE_CURRENT);\n if(INVALID_SET_FILE_POINTER == pos) {\n\tCHAR errStr[256];\n\t_sntprintf_s(errStr, 256, \"Error querying the file position before reading to file '%s'(0x%x).\", m_Filename, GetLastError());\n\tOutputDebugString(errStr);\n\treturn -1;\n }\n\n return pos;\n}\n\nbool FileStream::Seek(uint32 offset, ESeekPosition pos) {\n \n \/\/ We cannot seek in append mode.\n if(m_Mode == eFileMode_WriteAppend || m_Mode == eFileMode_WriteBinaryAppend)\n return false;\n\n HANDLE fp = m_Impl->GetFileHandle();\n if(NULL == fp) return false;\n\n DWORD origin = FILE_BEGIN;\n switch(pos) {\n default:\n case eSeekPosition_Beginning:\n \/\/ Do nothing\n break;\n\n case eSeekPosition_Current:\n origin = FILE_CURRENT;\n break;\n\n case eSeekPosition_End:\n origin = FILE_END;\n break;\n }\n\n if(SetFilePointer(fp, offset, NULL, origin) == INVALID_SET_FILE_POINTER)\n return false;\n\n return true;\n}\n\nvoid FileStream::Flush() {\n HANDLE fp = m_Impl->GetFileHandle();\n if(NULL == fp) return;\n\n FlushFileBuffers(fp);\n}\n<|endoftext|>"} {"text":"<commit_before>#include \"Core\/Time.h\"\n#include \"Containers\/String.h\"\n\n#include <time.h>\n#include <cstdio>\n\n\nnamespace Intra {\n\nDateTime DateTime::Now()\n{\n\tconst time_t t = time(0);\n\ttm* now = localtime(&t);\n\treturn {ushort(now->tm_year+1900), byte(now->tm_mon+1), (byte)now->tm_mday,\n\t\t(byte)now->tm_hour, (byte)now->tm_min, (byte)now->tm_sec};\n}\n\nString ToString(const DateTime& datetime)\n{\n\treturn String::Format()\n\t\t(datetime.Day, 2, '0')(\".\")(datetime.Month, 2, '0')(\".\")(datetime.Year)(\" \")\n\t\t(datetime.Hour, 2, '0')(\":\")(datetime.Minute, 2, '0')(\":\")(datetime.Second, 2, '0');\n}\n\n}\n\n#if(INTRA_LIBRARY_TIMER==INTRA_LIBRARY_TIMER_Dummy)\n\nnamespace Intra {\n\nTimer::Timer() = default;\nTimer::~Timer() = default;\nvoid Timer::Reset() {}\ndouble Timer::GetTime() {return 0;}\ndouble Timer::GetTimeAndReset() {return 0;}\nvoid Timer::Wait(uint msec) {}\n\n}\n\n#elif(INTRA_LIBRARY_TIMER==INTRA_LIBRARY_TIMER_QPC)\n\n#ifndef WIN32_LEAN_AND_MEAN\n#define WIN32_LEAN_AND_MEAN\n#endif\n#include <windows.h>\n\nnamespace Intra {\n\nstatic ulong64 g_timer_frequency;\n\nTimer::Timer()\n{\n\tQueryPerformanceFrequency((LARGE_INTEGER*)&g_timer_frequency);\n\tReset();\n}\n\nTimer::~Timer() = default;\n\nvoid Timer::Reset() {GetTimeAndReset();}\n\n\ndouble Timer::GetTime()\n{\n\tconst ulong64 oldHndl = hndl;\n\tconst double result = GetTimeAndReset();\n\thndl = oldHndl;\n\treturn result;\n}\n\ndouble Timer::GetTimeAndReset()\n{\n\tulong64 current;\n\tQueryPerformanceCounter((LARGE_INTEGER*)¤t);\n\tdouble result = double(current-hndl)\/g_timer_frequency;\n\thndl = current;\n\treturn result;\n}\n\n}\n\n#elif(INTRA_LIBRARY_TIMER==INTRA_LIBRARY_TIMER_CPPLIB)\n\n#include <chrono>\n#include <thread>\n\nnamespace Intra {\n\nTimer::Timer()\n{\n\thndl = (ulong64)new std::chrono::high_resolution_clock::time_point(std::chrono::high_resolution_clock::now());\n}\n\nTimer::~Timer()\n{\n\tdelete (std::chrono::high_resolution_clock::time_point*)hndl;\n}\n\n\n\/\/Получить время таймера и сбросить его\ndouble Timer::GetTimeAndReset()\n{\n\tauto current = std::chrono::high_resolution_clock::now();\n\tauto& prev = *(std::chrono::high_resolution_clock::time_point*)hndl;\n\tauto result = std::chrono::duration<double, std::ratio<1,1>>(current-prev).count();\n\t*(std::chrono::high_resolution_clock::time_point*)hndl = current;\n\treturn result;\n}\n\ndouble Timer::GetTime()\n{\n\tauto current = std::chrono::high_resolution_clock::now();\n\tauto& prev = *(std::chrono::high_resolution_clock::time_point*)hndl;\n\tauto result = std::chrono::duration<double, std::ratio<1, 1>>(current-prev).count();\n\treturn result;\n}\n\nvoid Timer::Reset()\n{\n\tauto current = std::chrono::high_resolution_clock::now();\n\t*(std::chrono::high_resolution_clock::time_point*)hndl = current;\n}\n\n\/\/void Timer::Wait(uint msec) {std::this_thread::sleep_for(std::chrono::milliseconds(msec));}\n\n}\n\n#elif INTRA_LIBRARY_TIMER==INTRA_LIBRARY_TIMER_Qt\n#include <QtCore\/QElapsedTimer>\n#include <QtCore\/QThread>\n\nnamespace Intra {\n\nTimer::Timer()\n{\n\thndl = (ulong64)new QElapsedTimer;\n\tReset();\n}\n\nTimer::~Timer() {delete (QElapsedTimer*)hndl;}\n\nvoid Timer::Reset() {((QElapsedTimer*)hndl)->start();}\n\ndouble Timer::GetTime()\n{\n\tconst double result = (double)((QElapsedTimer*)hndl)->nsecsElapsed()\/1000000000;\n\treturn result;\n}\n\ndouble Timer::GetTimeAndReset()\n{\n\tconst double result = GetTime();\n\tReset();\n\treturn result;\n}\n\n\/*void Timer::Wait(uint msec)\n{\n\tstruct SleepThread: public QThread {using QThread::msleep;};\n\tSleepThread::msleep(msec);\n}*\/\n\n}\n\n#elif INTRA_LIBRARY_TIMER==INTRA_LIBRARY_TIMER_CLIB\n\nnamespace Intra {\n\nTimer::Timer() {hndl = clock();}\nTimer::~Timer() = default;\nvoid Timer::Reset() {hndl = clock();}\ndouble Timer::GetTime() {return double(clock()-hndl)\/CLOCKS_PER_SEC;}\n\ndouble Timer::GetTimeAndReset()\n{\n\tauto newHndl = clock();\n\tconst double result = double(newHndl-hndl)\/CLOCKS_PER_SEC;\n\thndl = newHndl;\n\treturn result;\n}\n\n}\n\n#else\n#error \"INTRA_LIBRARY_TIMER define is invalid!\"\n#endif\n\n#if INTRA_PLATFORM_OS==INTRA_PLATFORM_OS_Windows\n\n#ifndef WIN32_LEAN_AND_MEAN\n#define WIN32_LEAN_AND_MEAN\n#endif\n#include <windows.h>\n\nnamespace Intra {\n\nvoid Timer::Wait(uint msec) {Sleep(msec);}\n\n}\n\n#elif defined(INTRA_PLATFORM_IS_POSIX)\n\n#include <unistd.h>\n\nnamespace Intra {\n\nvoid Timer::Wait(uint msec)\n{\n\tif(msec < (1 << 29)\/125 ) usleep(msec*1000);\n\telse sleep((msec+999)\/1000);\n}\n\n}\n\n#endif\n\n<commit_msg>Clang fix<commit_after>#include \"Core\/Time.h\"\n#include \"Containers\/String.h\"\n\n#include <time.h>\n\n\nnamespace Intra {\n\nDateTime DateTime::Now()\n{\n\tconst time_t t = time(0);\n\ttm* now = localtime(&t);\n\treturn {ushort(now->tm_year+1900), byte(now->tm_mon+1), (byte)now->tm_mday,\n\t\t(byte)now->tm_hour, (byte)now->tm_min, (byte)now->tm_sec};\n}\n\nString ToString(const DateTime& datetime)\n{\n\treturn String::Format()\n\t\t(datetime.Day, 2, '0')(\".\")(datetime.Month, 2, '0')(\".\")(datetime.Year)(\" \")\n\t\t(datetime.Hour, 2, '0')(\":\")(datetime.Minute, 2, '0')(\":\")(datetime.Second, 2, '0');\n}\n\n}\n\n#if(INTRA_LIBRARY_TIMER==INTRA_LIBRARY_TIMER_Dummy)\n\nnamespace Intra {\n\nTimer::Timer() = default;\nTimer::~Timer() = default;\nvoid Timer::Reset() {}\ndouble Timer::GetTime() {return 0;}\ndouble Timer::GetTimeAndReset() {return 0;}\nvoid Timer::Wait(uint msec) {}\n\n}\n\n#elif(INTRA_LIBRARY_TIMER==INTRA_LIBRARY_TIMER_QPC)\n\n#ifndef WIN32_LEAN_AND_MEAN\n#define WIN32_LEAN_AND_MEAN\n#endif\n#include <windows.h>\n\nnamespace Intra {\n\nstatic ulong64 g_timer_frequency;\n\nTimer::Timer()\n{\n\tQueryPerformanceFrequency((LARGE_INTEGER*)&g_timer_frequency);\n\tReset();\n}\n\nTimer::~Timer() = default;\n\nvoid Timer::Reset() {GetTimeAndReset();}\n\n\ndouble Timer::GetTime()\n{\n\tconst ulong64 oldHndl = hndl;\n\tconst double result = GetTimeAndReset();\n\thndl = oldHndl;\n\treturn result;\n}\n\ndouble Timer::GetTimeAndReset()\n{\n\tulong64 current;\n\tQueryPerformanceCounter((LARGE_INTEGER*)¤t);\n\tdouble result = double(current-hndl)\/g_timer_frequency;\n\thndl = current;\n\treturn result;\n}\n\n}\n\n#elif(INTRA_LIBRARY_TIMER==INTRA_LIBRARY_TIMER_CPPLIB)\n\nchar* gets(char* str);\n\n#include <chrono>\n#include <thread>\n\nnamespace Intra {\n\nTimer::Timer()\n{\n\thndl = (ulong64)new std::chrono::high_resolution_clock::time_point(std::chrono::high_resolution_clock::now());\n}\n\nTimer::~Timer()\n{\n\tdelete (std::chrono::high_resolution_clock::time_point*)hndl;\n}\n\n\n\/\/Получить время таймера и сбросить его\ndouble Timer::GetTimeAndReset()\n{\n\tauto current = std::chrono::high_resolution_clock::now();\n\tauto& prev = *(std::chrono::high_resolution_clock::time_point*)hndl;\n\tauto result = std::chrono::duration<double, std::ratio<1,1>>(current-prev).count();\n\t*(std::chrono::high_resolution_clock::time_point*)hndl = current;\n\treturn result;\n}\n\ndouble Timer::GetTime()\n{\n\tauto current = std::chrono::high_resolution_clock::now();\n\tauto& prev = *(std::chrono::high_resolution_clock::time_point*)hndl;\n\tauto result = std::chrono::duration<double, std::ratio<1, 1>>(current-prev).count();\n\treturn result;\n}\n\nvoid Timer::Reset()\n{\n\tauto current = std::chrono::high_resolution_clock::now();\n\t*(std::chrono::high_resolution_clock::time_point*)hndl = current;\n}\n\n\/\/void Timer::Wait(uint msec) {std::this_thread::sleep_for(std::chrono::milliseconds(msec));}\n\n}\n\n#elif INTRA_LIBRARY_TIMER==INTRA_LIBRARY_TIMER_Qt\n#include <QtCore\/QElapsedTimer>\n#include <QtCore\/QThread>\n\nnamespace Intra {\n\nTimer::Timer()\n{\n\thndl = (ulong64)new QElapsedTimer;\n\tReset();\n}\n\nTimer::~Timer() {delete (QElapsedTimer*)hndl;}\n\nvoid Timer::Reset() {((QElapsedTimer*)hndl)->start();}\n\ndouble Timer::GetTime()\n{\n\tconst double result = (double)((QElapsedTimer*)hndl)->nsecsElapsed()\/1000000000;\n\treturn result;\n}\n\ndouble Timer::GetTimeAndReset()\n{\n\tconst double result = GetTime();\n\tReset();\n\treturn result;\n}\n\n\/*void Timer::Wait(uint msec)\n{\n\tstruct SleepThread: public QThread {using QThread::msleep;};\n\tSleepThread::msleep(msec);\n}*\/\n\n}\n\n#elif INTRA_LIBRARY_TIMER==INTRA_LIBRARY_TIMER_CLIB\n\nnamespace Intra {\n\nTimer::Timer() {hndl = clock();}\nTimer::~Timer() = default;\nvoid Timer::Reset() {hndl = clock();}\ndouble Timer::GetTime() {return double(clock()-hndl)\/CLOCKS_PER_SEC;}\n\ndouble Timer::GetTimeAndReset()\n{\n\tauto newHndl = clock();\n\tconst double result = double(newHndl-hndl)\/CLOCKS_PER_SEC;\n\thndl = newHndl;\n\treturn result;\n}\n\n}\n\n#else\n#error \"INTRA_LIBRARY_TIMER define is invalid!\"\n#endif\n\n#if INTRA_PLATFORM_OS==INTRA_PLATFORM_OS_Windows\n\n#ifndef WIN32_LEAN_AND_MEAN\n#define WIN32_LEAN_AND_MEAN\n#endif\n#include <windows.h>\n\nnamespace Intra {\n\nvoid Timer::Wait(uint msec) {Sleep(msec);}\n\n}\n\n#elif defined(INTRA_PLATFORM_IS_POSIX)\n\n#include <unistd.h>\n\nnamespace Intra {\n\nvoid Timer::Wait(uint msec)\n{\n\tif(msec < (1 << 29)\/125 ) usleep(msec*1000);\n\telse sleep((msec+999)\/1000);\n}\n\n}\n\n#endif\n\n<|endoftext|>"} {"text":"<commit_before>\/*\n * tools_p.cpp\n *\n * Copyright (c) 2001, 2002, 2003 Frerich Raabe <raabe@kde.org>\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. For licensing and distribution details, check the\n * accompanying file 'COPYING'.\n *\/\n#include \"tools_p.h\"\n\n#include <krfcdate.h>\n#include <qdom.h>\n\ntime_t RSS::parseISO8601Date(const QString &s)\n{\n\tif (s.find('T') != -1)\n\t\treturn KRFCDate::parseDateISO8601(s);\n\tQString time=s;\n\ttime += \"T12:00:00\";\n\treturn KRFCDate::parseDateISO8601(time);\n}\n\n\nQString RSS::extractNode(const QDomNode &parent, const QString &elemName, bool simplifyWhiteSpace)\n{\n\tQDomNode node = parent.namedItem(elemName);\n\tif (node.isNull())\n\t\treturn QString::null;\n\n\tQString result = node.toElement().text();\n\tif (simplifyWhiteSpace) {\n\t\tresult=result.simplifyWhiteSpace();\n\t}\n\tif (result.isEmpty())\n\t\treturn QString::null;\n\n\treturn result;\n}\n\n\/\/ vim:noet:ts=4\n<commit_msg>here, we assume that an article containing no < is empty from any html tags, and has to be plain text. so we exapnd linebreaks before the spaces simplifications.<commit_after>\/*\n * tools_p.cpp\n *\n * Copyright (c) 2001, 2002, 2003 Frerich Raabe <raabe@kde.org>\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. For licensing and distribution details, check the\n * accompanying file 'COPYING'.\n *\/\n#include \"tools_p.h\"\n\n#include <krfcdate.h>\n#include <qdom.h>\n\ntime_t RSS::parseISO8601Date(const QString &s)\n{\n\tif (s.find('T') != -1)\n\t\treturn KRFCDate::parseDateISO8601(s);\n\tQString time=s;\n\ttime += \"T12:00:00\";\n\treturn KRFCDate::parseDateISO8601(time);\n}\n\n\nQString RSS::extractNode(const QDomNode &parent, const QString &elemName, bool simplifyWhiteSpace)\n{\n\tQDomNode node = parent.namedItem(elemName);\n\tif (node.isNull())\n\t\treturn QString::null;\n\n\tQString result = node.toElement().text();\n\tif (simplifyWhiteSpace) {\n\t\t\/\/ MC : this line assumes that a feed containing no < has no html tags\n\t\t\/\/ and then have no formattig, so we should convert \\n into <br> to make it readable\n\t\t\/\/ Mon, 23 Aug 2004 15:22:06 +0200\n\t\tif(!result.contains(\"<\")) result=result.replace(QChar('\\n'),\"<br \/>\");\n\n\t\tresult=result.simplifyWhiteSpace();\n\t}\n\tif (result.isEmpty())\n\t\treturn QString::null;\n\n\treturn result;\n}\n\n\/\/ vim:noet:ts=4\n<|endoftext|>"} {"text":"<commit_before>\/**\n * @file cursor.cpp\n * @date 12.12.2014\n * @author mkoenig\n * @brief\n *\n * $LastChangedDate$\n * $LastChangedBy$\n * $LastChangedRevision$\n *\n *\/\n\n#include <pydbc\/cursor.h>\n#include <pydbc\/column_types.h>\n#include <sqlext.h>\n#include <stdexcept>\n\nnamespace pydbc {\n\nnamespace {\n\n\tbool is_string_type(long type)\n\t{\n\t\tswitch (type) {\n\t\t\tcase SQL_VARCHAR:\n\t\t\tcase SQL_LONGVARCHAR:\n\t\t\tcase SQL_WVARCHAR:\n\t\t\tcase SQL_CHAR:\n\t\t\tcase SQL_WLONGVARCHAR:\n\t\t\tcase SQL_WCHAR:\n\t\t\t\treturn true;\n\t\t\tdefault:\n\t\t\t\treturn false;\n\t\t}\n\n\t}\n\n}\n\nresult_set::result_set(std::shared_ptr<cpp_odbc::statement const> statement) :\n\tstatement_(statement)\n{\n\tstd::size_t const n_columns = statement_->number_of_columns();\n\n\tfor (std::size_t one_based_index = 1; one_based_index <= n_columns; ++one_based_index) {\n\t\tauto const type = statement_->get_integer_column_attribute(one_based_index, SQL_DESC_TYPE);\n\n\t\tif (is_string_type(type)) {\n\t\t\tcolumns_.emplace_back(new string_column(*statement_, one_based_index));\n\t\t} else {\n\t\t\tcolumns_.emplace_back(new long_column(*statement_, one_based_index));\n\t\t}\n\t}\n}\n\nstd::vector<field> result_set::fetch_one()\n{\n\tauto const has_results = statement_->fetch_next();\n\tif (has_results) {\n\t\tstd::vector<field> row;\n\t\tfor (auto const & column : columns_) {\n\t\t\trow.push_back(column->get_field());\n\t\t}\n\t\treturn row;\n\t} else {\n\t\treturn {};\n\t}\n}\n\n\n}\n<commit_msg>Extracted column factory. Added exception for unsupported type identifiers<commit_after>\/**\n * @file cursor.cpp\n * @date 12.12.2014\n * @author mkoenig\n * @brief\n *\n * $LastChangedDate$\n * $LastChangedBy$\n * $LastChangedRevision$\n *\n *\/\n\n#include <pydbc\/cursor.h>\n#include <pydbc\/column_types.h>\n#include <sqlext.h>\n#include <stdexcept>\n#include <sstream>\n\nnamespace pydbc {\n\nnamespace {\n\n\tstd::unique_ptr<column> make_column(cpp_odbc::statement const & statement, std::size_t one_based_index)\n\t{\n\t\tauto const type = statement.get_integer_column_attribute(one_based_index, SQL_DESC_TYPE);\n\n\t\tswitch (type) {\n\t\t\tcase SQL_VARCHAR:\n\t\t\tcase SQL_LONGVARCHAR:\n\t\t\tcase SQL_WVARCHAR:\n\t\t\tcase SQL_CHAR:\n\t\t\tcase SQL_WLONGVARCHAR:\n\t\t\tcase SQL_WCHAR:\n\t\t\t\treturn std::unique_ptr<column>(new string_column(statement, one_based_index));\n\t\t\tcase SQL_INTEGER:\n\t\t\tcase SQL_SMALLINT:\n\t\t\tcase SQL_BIGINT:\n\t\t\tcase SQL_BIT:\n\t\t\t\treturn std::unique_ptr<column>(new long_column(statement, one_based_index));\n\t\t\tdefault:\n\t\t\t\tstd::ostringstream message;\n\t\t\t\tmessage << \"Error! Unsupported type identifier '\" << type << \"'\";\n\t\t\t\tthrow std::runtime_error(message.str());\n\t\t}\n\t}\n\n}\n\nresult_set::result_set(std::shared_ptr<cpp_odbc::statement const> statement) :\n\tstatement_(statement)\n{\n\tstd::size_t const n_columns = statement_->number_of_columns();\n\n\tfor (std::size_t one_based_index = 1; one_based_index <= n_columns; ++one_based_index) {\n\t\tcolumns_.push_back(make_column(*statement, one_based_index));\n\t}\n}\n\nstd::vector<field> result_set::fetch_one()\n{\n\tauto const has_results = statement_->fetch_next();\n\tif (has_results) {\n\t\tstd::vector<field> row;\n\t\tfor (auto const & column : columns_) {\n\t\t\trow.push_back(column->get_field());\n\t\t}\n\t\treturn row;\n\t} else {\n\t\treturn {};\n\t}\n}\n\n\n}\n<|endoftext|>"} {"text":"<commit_before>\/\/\n\/\/ ZX8081.cpp\n\/\/ Clock Signal\n\/\/\n\/\/ Created by Thomas Harte on 04\/06\/2017.\n\/\/ Copyright © 2017 Thomas Harte. All rights reserved.\n\/\/\n\n#include \"ZX8081.hpp\"\n\n#include \"..\/MemoryFuzzer.hpp\"\n\nusing namespace ZX8081;\n\nnamespace {\n\t\/\/ The clock rate is 3.25Mhz.\n\tconst unsigned int ZX8081ClockRate = 3250000;\n}\n\nMachine::Machine() :\n\tvsync_(false),\n\thsync_(false),\n\ttape_player_(ZX8081ClockRate) {\n\tset_clock_rate(ZX8081ClockRate);\n\ttape_player_.set_motor_control(true);\n\tclear_all_keys();\n}\n\nint Machine::perform_machine_cycle(const CPU::Z80::MachineCycle &cycle) {\n\tint previous_counter = horizontal_counter_;\n\thorizontal_counter_ += cycle.length;\n\tif(previous_counter < 16 && horizontal_counter_ >= 16) {\n\t\tvideo_->run_for_cycles(16 - previous_counter);\n\t\tset_hsync(true);\n\t\tvideo_->run_for_cycles(horizontal_counter_ - 16);\n\t} else if(previous_counter < 32 && horizontal_counter_ >= 32) {\n\t\tvideo_->run_for_cycles(32 - previous_counter);\n\t\tset_hsync(false);\n\t\tvideo_->run_for_cycles(horizontal_counter_ - 32);\n\t} else {\n\t\tvideo_->run_for_cycles(cycle.length);\n\t}\n\n\/\/\ttape_player_.run_for_cycles(cycle.length);\n\n\tuint16_t refresh = 0;\n\tuint16_t address = cycle.address ? *cycle.address : 0;\n\tswitch(cycle.operation) {\n\t\tcase CPU::Z80::BusOperation::Output:\n\t\t\tset_vsync(false);\n\t\t\tline_counter_ = 0;\n\t\tbreak;\n\n\t\tcase CPU::Z80::BusOperation::Input: {\n\t\t\tuint8_t value = 0xff;\n\t\t\tif(!(address&1)) {\n\t\t\t\tset_vsync(true);\n\n\t\t\t\tuint16_t mask = 0x100;\n\t\t\t\tfor(int c = 0; c < 8; c++) {\n\t\t\t\t\tif(!(address & mask)) value &= key_states_[c];\n\t\t\t\t\tmask <<= 1;\n\t\t\t\t}\n\n\t\t\t\tvalue &= ~(tape_player_.get_input() ? 0x00 : 0x80);\n\t\t\t}\n\t\t\t*cycle.value = value;\n\t\t} break;\n\n\t\tcase CPU::Z80::BusOperation::Interrupt:\n\/\/\t\t\tset_hsync(true);\n\t\t\tline_counter_ = (line_counter_ + 1) & 7;\n\t\t\t*cycle.value = 0xff;\n\t\t\thorizontal_counter_ = 0;\t\/\/ TODO: more than this?\n\t\tbreak;\n\n\t\tcase CPU::Z80::BusOperation::ReadOpcode:\n\/\/\t\t\tset_hsync(false);\n\n\t\t\t\/\/ The ZX80 and 81 signal an interrupt while refresh is active and bit 6 of the refresh\n\t\t\t\/\/ address is low. The Z80 signals a refresh, providing the refresh address during the\n\t\t\t\/\/ final two cycles of an opcode fetch. Therefore communicate a transient signalling\n\t\t\t\/\/ of the IRQ line if necessary.\n\t\t\trefresh = get_value_of_register(CPU::Z80::Register::Refresh);\n\t\t\tset_interrupt_line(!(refresh & 0x40), -2);\n\t\t\tset_interrupt_line(false);\n\n\t\t\t\/\/ Check for use of the fast tape hack.\n\t\t\tif(address == tape_trap_address_) { \/\/ TODO: && fast_tape_hack_enabled_\n\t\t\t\tint next_byte = parser_.get_next_byte(tape_player_.get_tape());\n\t\t\t\tif(next_byte != -1) {\n\t\t\t\t\tuint16_t hl = get_value_of_register(CPU::Z80::Register::HL);\n\t\t\t\t\tram_[hl & ram_mask_] = (uint8_t)next_byte;\n\t\t\t\t\t*cycle.value = 0x00;\n\t\t\t\t\tset_value_of_register(CPU::Z80::Register::ProgramCounter, tape_return_address_ - 1);\n\t\t\t\t\treturn 0;\n\t\t\t\t}\n\t\t\t}\n\n\t\tcase CPU::Z80::BusOperation::Read:\n\t\t\tif(address < ram_base_) {\n\t\t\t\t*cycle.value = rom_[address & rom_mask_];\n\t\t\t} else {\n\t\t\t\tuint8_t value = ram_[address & ram_mask_];\n\n\t\t\t\t\/\/ If this is an M1 cycle reading from above the 32kb mark and HALT is not\n\t\t\t\t\/\/ currently active, perform a video output and return a NOP. Otherwise,\n\t\t\t\t\/\/ just return the value as read.\n\t\t\t\tif(cycle.operation == CPU::Z80::BusOperation::ReadOpcode && address&0x8000 && !(value & 0x40) && !get_halt_line()) {\n\t\t\t\t\tsize_t char_address = (size_t)((refresh & 0xff00) | ((value & 0x3f) << 3) | line_counter_);\n\t\t\t\t\tif(char_address < ram_base_) {\n\t\t\t\t\t\tuint8_t mask = (value & 0x80) ? 0x00 : 0xff;\n\t\t\t\t\t\tvalue = rom_[char_address & rom_mask_] ^ mask;\n\t\t\t\t\t}\n\n\t\t\t\t\tvideo_->output_byte(value);\n\t\t\t\t\t*cycle.value = 0;\n\t\t\t\t} else *cycle.value = value;\n\t\t\t}\n\t\tbreak;\n\n\t\tcase CPU::Z80::BusOperation::Write:\n\t\t\tif(address >= ram_base_) {\n\t\t\t\tram_[address & ram_mask_] = *cycle.value;\n\t\t\t}\n\t\tbreak;\n\n\t\tdefault: break;\n\t}\n\n\treturn 0;\n}\n\nvoid Machine::flush() {\n\tvideo_->flush();\n}\n\nvoid Machine::setup_output(float aspect_ratio) {\n\tvideo_.reset(new Video);\n}\n\nvoid Machine::close_output() {\n\tvideo_.reset();\n}\n\nstd::shared_ptr<Outputs::CRT::CRT> Machine::get_crt() {\n\treturn video_->get_crt();\n}\n\nstd::shared_ptr<Outputs::Speaker> Machine::get_speaker() {\n\treturn nullptr;\n}\n\nvoid Machine::run_for_cycles(int number_of_cycles) {\n\tCPU::Z80::Processor<Machine>::run_for_cycles(number_of_cycles);\n}\n\nvoid Machine::configure_as_target(const StaticAnalyser::Target &target) {\n\tis_zx81_ = target.zx8081.isZX81;\n\tif(is_zx81_) {\n\t\trom_ = zx81_rom_;\n\t\ttape_trap_address_ = 0x37c;\n\t\ttape_return_address_ = 0x380;\n\t} else {\n\t\trom_ = zx80_rom_;\n\t\ttape_trap_address_ = 0x220;\n\t\ttape_return_address_ = 0x248;\n\t}\n\trom_mask_ = (uint16_t)(rom_.size() - 1);\n\n\tswitch(target.zx8081.memory_model) {\n\t\tcase StaticAnalyser::ZX8081MemoryModel::Unexpanded:\n\t\t\tram_.resize(1024);\n\t\t\tram_base_ = 16384;\n\t\t\tram_mask_ = 1023;\n\t\tbreak;\n\t\tcase StaticAnalyser::ZX8081MemoryModel::SixteenKB:\n\t\t\tram_.resize(16384);\n\t\t\tram_base_ = 16384;\n\t\t\tram_mask_ = 16383;\n\t\tbreak;\n\t\tcase StaticAnalyser::ZX8081MemoryModel::SixtyFourKB:\n\t\t\tram_.resize(65536);\n\t\t\tram_base_ = 8192;\n\t\t\tram_mask_ = 65535;\n\t\tbreak;\n\t}\n\tMemory::Fuzz(ram_);\n\n\tif(target.tapes.size()) {\n\t\ttape_player_.set_tape(target.tapes.front());\n\t}\n}\n\nvoid Machine::set_rom(ROMType type, std::vector<uint8_t> data) {\n\tswitch(type) {\n\t\tcase ZX80: zx80_rom_ = data; break;\n\t\tcase ZX81: zx81_rom_ = data; break;\n\t}\n}\n\n#pragma mark - Video\n\nvoid Machine::set_vsync(bool sync) {\n\tvsync_ = sync;\n\tupdate_sync();\n}\n\nvoid Machine::set_hsync(bool sync) {\n\thsync_ = sync;\n\tupdate_sync();\n}\n\nvoid Machine::update_sync() {\n\tvideo_->set_sync(vsync_ || hsync_);\n}\n\n#pragma mark - Keyboard\n\nvoid Machine::set_key_state(uint16_t key, bool isPressed) {\n\tif(isPressed)\n\t\tkey_states_[key >> 8] &= (uint8_t)(~key);\n\telse\n\t\tkey_states_[key >> 8] |= (uint8_t)key;\n}\n\nvoid Machine::clear_all_keys() {\n\tmemset(key_states_, 0xff, 8);\n}\n<commit_msg>Started splitting ZX80 and ZX81 paths. Also the '80 fires its horizontal sync a little earlier than the '81, so pulled that back a little.<commit_after>\/\/\n\/\/ ZX8081.cpp\n\/\/ Clock Signal\n\/\/\n\/\/ Created by Thomas Harte on 04\/06\/2017.\n\/\/ Copyright © 2017 Thomas Harte. All rights reserved.\n\/\/\n\n#include \"ZX8081.hpp\"\n\n#include \"..\/MemoryFuzzer.hpp\"\n\nusing namespace ZX8081;\n\nnamespace {\n\t\/\/ The clock rate is 3.25Mhz.\n\tconst unsigned int ZX8081ClockRate = 3250000;\n}\n\nMachine::Machine() :\n\tvsync_(false),\n\thsync_(false),\n\ttape_player_(ZX8081ClockRate) {\n\tset_clock_rate(ZX8081ClockRate);\n\ttape_player_.set_motor_control(true);\n\tclear_all_keys();\n}\n\nint Machine::perform_machine_cycle(const CPU::Z80::MachineCycle &cycle) {\n\tconst int vsync_length = 16;\n\n\tint previous_counter = horizontal_counter_;\n\thorizontal_counter_ += cycle.length;\n\n\tif(is_zx81_) {\n\t} else {\n\t\tconst int vsync_start_cycle = 13;\n\t\tconst int vsync_end_cycle = vsync_start_cycle + vsync_length;\n\n\t\tif(previous_counter < vsync_start_cycle && horizontal_counter_ >= vsync_start_cycle) {\n\t\t\tvideo_->run_for_cycles(vsync_start_cycle - previous_counter);\n\t\t\tset_hsync(true);\n\t\t\tvideo_->run_for_cycles(horizontal_counter_ - vsync_start_cycle);\n\t\t} else if(previous_counter < vsync_end_cycle && horizontal_counter_ >= vsync_end_cycle) {\n\t\t\tvideo_->run_for_cycles(vsync_end_cycle - previous_counter);\n\t\t\tset_hsync(false);\n\t\t\tvideo_->run_for_cycles(horizontal_counter_ - vsync_end_cycle);\n\t\t} else {\n\t\t\tvideo_->run_for_cycles(cycle.length);\n\t\t}\n\t}\n\n\/\/\ttape_player_.run_for_cycles(cycle.length);\n\n\tuint16_t refresh = 0;\n\tuint16_t address = cycle.address ? *cycle.address : 0;\n\tswitch(cycle.operation) {\n\t\tcase CPU::Z80::BusOperation::Output:\n\t\t\tset_vsync(false);\n\t\t\tline_counter_ = 0;\n\t\tbreak;\n\n\t\tcase CPU::Z80::BusOperation::Input: {\n\t\t\tuint8_t value = 0xff;\n\t\t\tif(!(address&1)) {\n\t\t\t\tset_vsync(true);\n\n\t\t\t\tuint16_t mask = 0x100;\n\t\t\t\tfor(int c = 0; c < 8; c++) {\n\t\t\t\t\tif(!(address & mask)) value &= key_states_[c];\n\t\t\t\t\tmask <<= 1;\n\t\t\t\t}\n\n\t\t\t\tvalue &= ~(tape_player_.get_input() ? 0x00 : 0x80);\n\t\t\t}\n\t\t\t*cycle.value = value;\n\t\t} break;\n\n\t\tcase CPU::Z80::BusOperation::Interrupt:\n\/\/\t\t\tset_hsync(true);\n\t\t\tline_counter_ = (line_counter_ + 1) & 7;\n\t\t\t*cycle.value = 0xff;\n\t\t\thorizontal_counter_ = 0;\t\/\/ TODO: more than this?\n\t\tbreak;\n\n\t\tcase CPU::Z80::BusOperation::ReadOpcode:\n\/\/\t\t\tset_hsync(false);\n\n\t\t\t\/\/ The ZX80 and 81 signal an interrupt while refresh is active and bit 6 of the refresh\n\t\t\t\/\/ address is low. The Z80 signals a refresh, providing the refresh address during the\n\t\t\t\/\/ final two cycles of an opcode fetch. Therefore communicate a transient signalling\n\t\t\t\/\/ of the IRQ line if necessary.\n\t\t\trefresh = get_value_of_register(CPU::Z80::Register::Refresh);\n\t\t\tset_interrupt_line(!(refresh & 0x40), -2);\n\t\t\tset_interrupt_line(false);\n\n\t\t\t\/\/ Check for use of the fast tape hack.\n\t\t\tif(address == tape_trap_address_) { \/\/ TODO: && fast_tape_hack_enabled_\n\t\t\t\tint next_byte = parser_.get_next_byte(tape_player_.get_tape());\n\t\t\t\tif(next_byte != -1) {\n\t\t\t\t\tuint16_t hl = get_value_of_register(CPU::Z80::Register::HL);\n\t\t\t\t\tram_[hl & ram_mask_] = (uint8_t)next_byte;\n\t\t\t\t\t*cycle.value = 0x00;\n\t\t\t\t\tset_value_of_register(CPU::Z80::Register::ProgramCounter, tape_return_address_ - 1);\n\t\t\t\t\treturn 0;\n\t\t\t\t}\n\t\t\t}\n\n\t\tcase CPU::Z80::BusOperation::Read:\n\t\t\tif(address < ram_base_) {\n\t\t\t\t*cycle.value = rom_[address & rom_mask_];\n\t\t\t} else {\n\t\t\t\tuint8_t value = ram_[address & ram_mask_];\n\n\t\t\t\t\/\/ If this is an M1 cycle reading from above the 32kb mark and HALT is not\n\t\t\t\t\/\/ currently active, perform a video output and return a NOP. Otherwise,\n\t\t\t\t\/\/ just return the value as read.\n\t\t\t\tif(cycle.operation == CPU::Z80::BusOperation::ReadOpcode && address&0x8000 && !(value & 0x40) && !get_halt_line()) {\n\t\t\t\t\tsize_t char_address = (size_t)((refresh & 0xff00) | ((value & 0x3f) << 3) | line_counter_);\n\t\t\t\t\tif(char_address < ram_base_) {\n\t\t\t\t\t\tuint8_t mask = (value & 0x80) ? 0x00 : 0xff;\n\t\t\t\t\t\tvalue = rom_[char_address & rom_mask_] ^ mask;\n\t\t\t\t\t}\n\n\t\t\t\t\tvideo_->output_byte(value);\n\t\t\t\t\t*cycle.value = 0;\n\t\t\t\t} else *cycle.value = value;\n\t\t\t}\n\t\tbreak;\n\n\t\tcase CPU::Z80::BusOperation::Write:\n\t\t\tif(address >= ram_base_) {\n\t\t\t\tram_[address & ram_mask_] = *cycle.value;\n\t\t\t}\n\t\tbreak;\n\n\t\tdefault: break;\n\t}\n\n\treturn 0;\n}\n\nvoid Machine::flush() {\n\tvideo_->flush();\n}\n\nvoid Machine::setup_output(float aspect_ratio) {\n\tvideo_.reset(new Video);\n}\n\nvoid Machine::close_output() {\n\tvideo_.reset();\n}\n\nstd::shared_ptr<Outputs::CRT::CRT> Machine::get_crt() {\n\treturn video_->get_crt();\n}\n\nstd::shared_ptr<Outputs::Speaker> Machine::get_speaker() {\n\treturn nullptr;\n}\n\nvoid Machine::run_for_cycles(int number_of_cycles) {\n\tCPU::Z80::Processor<Machine>::run_for_cycles(number_of_cycles);\n}\n\nvoid Machine::configure_as_target(const StaticAnalyser::Target &target) {\n\tis_zx81_ = target.zx8081.isZX81;\n\tif(is_zx81_) {\n\t\trom_ = zx81_rom_;\n\t\ttape_trap_address_ = 0x37c;\n\t\ttape_return_address_ = 0x380;\n\t} else {\n\t\trom_ = zx80_rom_;\n\t\ttape_trap_address_ = 0x220;\n\t\ttape_return_address_ = 0x248;\n\t}\n\trom_mask_ = (uint16_t)(rom_.size() - 1);\n\n\tswitch(target.zx8081.memory_model) {\n\t\tcase StaticAnalyser::ZX8081MemoryModel::Unexpanded:\n\t\t\tram_.resize(1024);\n\t\t\tram_base_ = 16384;\n\t\t\tram_mask_ = 1023;\n\t\tbreak;\n\t\tcase StaticAnalyser::ZX8081MemoryModel::SixteenKB:\n\t\t\tram_.resize(16384);\n\t\t\tram_base_ = 16384;\n\t\t\tram_mask_ = 16383;\n\t\tbreak;\n\t\tcase StaticAnalyser::ZX8081MemoryModel::SixtyFourKB:\n\t\t\tram_.resize(65536);\n\t\t\tram_base_ = 8192;\n\t\t\tram_mask_ = 65535;\n\t\tbreak;\n\t}\n\tMemory::Fuzz(ram_);\n\n\tif(target.tapes.size()) {\n\t\ttape_player_.set_tape(target.tapes.front());\n\t}\n}\n\nvoid Machine::set_rom(ROMType type, std::vector<uint8_t> data) {\n\tswitch(type) {\n\t\tcase ZX80: zx80_rom_ = data; break;\n\t\tcase ZX81: zx81_rom_ = data; break;\n\t}\n}\n\n#pragma mark - Video\n\nvoid Machine::set_vsync(bool sync) {\n\tvsync_ = sync;\n\tupdate_sync();\n}\n\nvoid Machine::set_hsync(bool sync) {\n\thsync_ = sync;\n\tupdate_sync();\n}\n\nvoid Machine::update_sync() {\n\tvideo_->set_sync(vsync_ || hsync_);\n}\n\n#pragma mark - Keyboard\n\nvoid Machine::set_key_state(uint16_t key, bool isPressed) {\n\tif(isPressed)\n\t\tkey_states_[key >> 8] &= (uint8_t)(~key);\n\telse\n\t\tkey_states_[key >> 8] |= (uint8_t)key;\n}\n\nvoid Machine::clear_all_keys() {\n\tmemset(key_states_, 0xff, 8);\n}\n<|endoftext|>"} {"text":"<commit_before>\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\n\/\/ Copyright (c) 2002, Industrial Light & Magic, a division of Lucas\n\/\/ Digital Ltd. LLC\n\/\/ \n\/\/ All rights reserved.\n\/\/ \n\/\/ Redistribution and use in source and binary forms, with or without\n\/\/ modification, are permitted provided that the following conditions are\n\/\/ met:\n\/\/ * Redistributions of source code must retain the above copyright\n\/\/ notice, this list of conditions and the following disclaimer.\n\/\/ * Redistributions in binary form must reproduce the above\n\/\/ copyright notice, this list of conditions and the following disclaimer\n\/\/ in the documentation and\/or other materials provided with the\n\/\/ distribution.\n\/\/ * Neither the name of Industrial Light & Magic nor the names of\n\/\/ its contributors may be used to endorse or promote products derived\n\/\/ from this software without specific prior written permission. \n\/\/ \n\/\/ THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS\n\/\/ \"AS IS\" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT\n\/\/ LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR\n\/\/ A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT\n\/\/ OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,\n\/\/ SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT\n\/\/ LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,\n\/\/ DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY\n\/\/ THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT\n\/\/ (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE\n\/\/ OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.\n\/\/\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n\n\n#include <testRoots.h>\n#include <testFun.h>\n#include <testInvert.h>\n#include <testFrustum.h>\n#include <testRandom.h>\n#include <testColor.h>\n#include <testShear.h>\n#include <testMatrix.h>\n#include <testExtractEuler.h>\n#include <testExtractSHRT.h>\n\n#include <string.h>\n\n#define TEST(x) if (argc < 2 || !strcmp (argv[1], #x)) x();\n\nint\nmain (int argc, char *argv[])\n{\n TEST (testColor);\n TEST (testShear);\n TEST (testMatrix);\n TEST (testRoots);\n TEST (testFun);\n TEST (testInvert);\n TEST (testFrustum);\n TEST (testRandom);\n TEST (testExtractEuler);\n TEST (testExtractSHRT);\n return 0;\n}\n<commit_msg><commit_after>\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\n\/\/ Copyright (c) 2002, Industrial Light & Magic, a division of Lucas\n\/\/ Digital Ltd. LLC\n\/\/ \n\/\/ All rights reserved.\n\/\/ \n\/\/ Redistribution and use in source and binary forms, with or without\n\/\/ modification, are permitted provided that the following conditions are\n\/\/ met:\n\/\/ * Redistributions of source code must retain the above copyright\n\/\/ notice, this list of conditions and the following disclaimer.\n\/\/ * Redistributions in binary form must reproduce the above\n\/\/ copyright notice, this list of conditions and the following disclaimer\n\/\/ in the documentation and\/or other materials provided with the\n\/\/ distribution.\n\/\/ * Neither the name of Industrial Light & Magic nor the names of\n\/\/ its contributors may be used to endorse or promote products derived\n\/\/ from this software without specific prior written permission. \n\/\/ \n\/\/ THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS\n\/\/ \"AS IS\" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT\n\/\/ LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR\n\/\/ A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT\n\/\/ OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,\n\/\/ SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT\n\/\/ LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,\n\/\/ DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY\n\/\/ THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT\n\/\/ (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE\n\/\/ OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.\n\/\/\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n\n\n#include <testRoots.h>\n#include <testFun.h>\n#include <testInvert.h>\n#include <testFrustum.h>\n#include <testRandom.h>\n#include <testColor.h>\n#include <testShear.h>\n#include <testMatrix.h>\n#include <testExtractEuler.h>\n#include <testExtractSHRT.h>\n#include <testTMatrix.h>\n#include <testTMatrixData.h>\n\n#include <string.h>\n\n#define TEST(x) if (argc < 2 || !strcmp (argv[1], #x)) x();\n\nint\nmain (int argc, char *argv[])\n{\n TEST (testColor);\n TEST (testShear);\n TEST (testMatrix);\n TEST (testRoots);\n TEST (testFun);\n TEST (testInvert);\n TEST (testFrustum);\n TEST (testRandom);\n TEST (testExtractEuler);\n TEST (testExtractSHRT);\n TEST (testTMatrix);\n TEST (testTMatrixData);\n return 0;\n}\n<|endoftext|>"} {"text":"<commit_before>\/*************************************************************************\n *\n * $RCSfile: tabsthdl.cxx,v $\n *\n * $Revision: 1.2 $\n *\n * last change: $Author: mib $ $Date: 2001-07-02 09:50: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 _XMLOFF_PROPERTYHANDLER_TABSTOPTYPES_HXX\n#include <tabsthdl.hxx>\n#endif\n\n#ifndef _COM_SUN_STAR_UNO_SEQUENCE_HXX_\n#include <com\/sun\/star\/uno\/Sequence.hxx>\n#endif\n\n#ifndef _COM_SUN_STAR_STYLE_TABSTOP_HPP_\n#include <com\/sun\/star\/style\/TabStop.hpp>\n#endif\n\nusing namespace ::com::sun::star;\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\n\/\/ class XMLFontFamilyNamePropHdl\n\/\/\n\nXMLTabStopPropHdl::~XMLTabStopPropHdl()\n{\n \/\/ Nothing to do\n}\n\nsal_Bool XMLTabStopPropHdl::equals( const uno::Any& r1, const uno::Any& r2 ) const\n{\n sal_Bool bEqual = sal_False;\n\n uno::Sequence< style::TabStop> aSeq1;\n if( r1 >>= aSeq1 )\n {\n uno::Sequence< style::TabStop> aSeq2;\n if( r2 >>= aSeq2 )\n {\n if( aSeq1.getLength() == aSeq2.getLength() )\n {\n bEqual = sal_True;\n if( aSeq1.getLength() > 0 )\n {\n const style::TabStop* pTabs1 = aSeq1.getConstArray();\n const style::TabStop* pTabs2 = aSeq2.getConstArray();\n\n int i=0;\n\n do\n {\n bEqual = ( pTabs1[i].Position == pTabs2[i].Position &&\n pTabs1[i].Alignment == pTabs2[i].Alignment &&\n pTabs1[i].DecimalChar == pTabs2[i].DecimalChar &&\n pTabs1[i].FillChar == pTabs2[i].FillChar );\n i++;\n\n } while( bEqual && i < aSeq1.getLength() );\n }\n }\n }\n }\n\n return bEqual;\n}\n\nsal_Bool XMLTabStopPropHdl::importXML( const ::rtl::OUString& rStrImpValue, ::com::sun::star::uno::Any& rValue, const SvXMLUnitConverter& rUnitConverter ) const\n{\n return sal_False;\n}\n\nsal_Bool XMLTabStopPropHdl::exportXML( ::rtl::OUString& rStrExpValue, const ::com::sun::star::uno::Any& rValue, const SvXMLUnitConverter& rUnitConverter ) const\n{\n return sal_False;\n}\n\n<commit_msg>INTEGRATION: CWS ooo19126 (1.2.636); FILE MERGED 2005\/09\/05 14:39:31 rt 1.2.636.1: #i54170# Change license header: remove SISSL<commit_after>\/*************************************************************************\n *\n * OpenOffice.org - a multi-platform office productivity suite\n *\n * $RCSfile: tabsthdl.cxx,v $\n *\n * $Revision: 1.3 $\n *\n * last change: $Author: rt $ $Date: 2005-09-09 14:49:13 $\n *\n * The Contents of this file are made available subject to\n * the terms of GNU Lesser General Public License Version 2.1.\n *\n *\n * GNU Lesser General Public License Version 2.1\n * =============================================\n * Copyright 2005 by Sun Microsystems, Inc.\n * 901 San Antonio Road, Palo Alto, CA 94303, USA\n *\n * This library is free software; you can redistribute it and\/or\n * modify it under the terms of the GNU Lesser General Public\n * License version 2.1, as published by the Free Software Foundation.\n *\n * This library is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU\n * Lesser General Public License for more details.\n *\n * You should have received a copy of the GNU Lesser General Public\n * License along with this library; if not, write to the Free Software\n * Foundation, Inc., 59 Temple Place, Suite 330, Boston,\n * MA 02111-1307 USA\n *\n ************************************************************************\/\n\n#ifndef _XMLOFF_PROPERTYHANDLER_TABSTOPTYPES_HXX\n#include <tabsthdl.hxx>\n#endif\n\n#ifndef _COM_SUN_STAR_UNO_SEQUENCE_HXX_\n#include <com\/sun\/star\/uno\/Sequence.hxx>\n#endif\n\n#ifndef _COM_SUN_STAR_STYLE_TABSTOP_HPP_\n#include <com\/sun\/star\/style\/TabStop.hpp>\n#endif\n\nusing namespace ::com::sun::star;\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\n\/\/ class XMLFontFamilyNamePropHdl\n\/\/\n\nXMLTabStopPropHdl::~XMLTabStopPropHdl()\n{\n \/\/ Nothing to do\n}\n\nsal_Bool XMLTabStopPropHdl::equals( const uno::Any& r1, const uno::Any& r2 ) const\n{\n sal_Bool bEqual = sal_False;\n\n uno::Sequence< style::TabStop> aSeq1;\n if( r1 >>= aSeq1 )\n {\n uno::Sequence< style::TabStop> aSeq2;\n if( r2 >>= aSeq2 )\n {\n if( aSeq1.getLength() == aSeq2.getLength() )\n {\n bEqual = sal_True;\n if( aSeq1.getLength() > 0 )\n {\n const style::TabStop* pTabs1 = aSeq1.getConstArray();\n const style::TabStop* pTabs2 = aSeq2.getConstArray();\n\n int i=0;\n\n do\n {\n bEqual = ( pTabs1[i].Position == pTabs2[i].Position &&\n pTabs1[i].Alignment == pTabs2[i].Alignment &&\n pTabs1[i].DecimalChar == pTabs2[i].DecimalChar &&\n pTabs1[i].FillChar == pTabs2[i].FillChar );\n i++;\n\n } while( bEqual && i < aSeq1.getLength() );\n }\n }\n }\n }\n\n return bEqual;\n}\n\nsal_Bool XMLTabStopPropHdl::importXML( const ::rtl::OUString& rStrImpValue, ::com::sun::star::uno::Any& rValue, const SvXMLUnitConverter& rUnitConverter ) const\n{\n return sal_False;\n}\n\nsal_Bool XMLTabStopPropHdl::exportXML( ::rtl::OUString& rStrExpValue, const ::com::sun::star::uno::Any& rValue, const SvXMLUnitConverter& rUnitConverter ) const\n{\n return sal_False;\n}\n\n<|endoftext|>"} {"text":"<commit_before>#include <nan.h>\n#include <string.h>\n#ifdef WIN32\n#include <windows.h>\n#else\n#include <unistd.h>\n#endif \/\/ win32\n\nextern \"C\" {\n #include <git2.h>\n {% each cDependencies as dependency %}\n #include <{{ dependency }}>\n {% endeach %}\n}\n\n#include <iostream>\n#include \"..\/include\/nodegit.h\"\n#include \"..\/include\/lock_master.h\"\n#include \"..\/include\/functions\/copy.h\"\n#include \"..\/include\/{{ filename }}.h\"\n#include \"nodegit_wrapper.cc\"\n\n{% each dependencies as dependency %}\n #include \"{{ dependency }}\"\n{% endeach %}\n\nusing namespace v8;\nusing namespace node;\nusing namespace std;\n\n\n\/\/ generated from struct_content.cc\n{{ cppClassName }}::{{ cppClassName }}() : NodeGitWrapper<{{ cppClassName }}Traits>(NULL, true, v8::Local<v8::Object>())\n{\n {% if ignoreInit == true %}\n this->raw = new {{ cType }};\n {% else %}\n {% if isExtendedStruct %}\n {{ cType }}_extended wrappedValue = {{ cType|upper }}_INIT;\n this->raw = ({{ cType }}*) malloc(sizeof({{ cType }}_extended));\n memcpy(this->raw, &wrappedValue, sizeof({{ cType }}_extended));\n {% else %}\n {{ cType }} wrappedValue = {{ cType|upper }}_INIT;\n this->raw = ({{ cType }}*) malloc(sizeof({{ cType }}));\n memcpy(this->raw, &wrappedValue, sizeof({{ cType }}));\n {% endif %}\n {% endif %}\n\n this->ConstructFields();\n}\n\n{{ cppClassName }}::{{ cppClassName }}({{ cType }}* raw, bool selfFreeing, v8::Local<v8::Object> owner)\n : NodeGitWrapper<{{ cppClassName }}Traits>(raw, selfFreeing, owner)\n{\n this->ConstructFields();\n}\n\n{{ cppClassName }}::~{{ cppClassName }}() {\n {% each fields|fieldsInfo as field %}\n {% if not field.ignore %}\n {% if not field.isEnum %}\n {% if field.isCallbackFunction %}\n if (this->{{ field.name }}.HasCallback()) {\n {% if isExtendedStruct %}\n (({{ cType }}_extended *)this->raw)->payload = NULL;\n {% else %}\n this->raw->{{ fields|payloadFor field.name }} = NULL;\n {% endif %}\n }\n {% endif %}\n {% endif %}\n {% endif %}\n {% endeach %}\n}\n\nvoid {{ cppClassName }}::ConstructFields() {\n {% each fields|fieldsInfo as field %}\n {% if not field.ignore %}\n {% if not field.isEnum %}\n {% if field.hasConstructor |or field.isLibgitType %}\n v8::Local<Object> {{ field.name }}Temp = {{ field.cppClassName }}::New(\n {%if not field.cType|isPointer %}&{%endif%}this->raw->{{ field.name }},\n false\n )->ToObject();\n this->{{ field.name }}.Reset({{ field.name }}Temp);\n\n {% elsif field.isCallbackFunction %}\n\n \/\/ Set the static method call and set the payload for this function to be\n \/\/ the current instance\n this->raw->{{ field.name }} = NULL;\n {% if isExtendedStruct %}\n (({{ cType }}_extended *)this->raw)->payload = (void *)this;\n {% else %}\n this->raw->{{ fields|payloadFor field.name }} = (void *)this;\n {% endif %}\n {% elsif field.payloadFor %}\n\n v8::Local<Value> {{ field.name }} = Nan::Undefined();\n this->{{ field.name }}.Reset({{ field.name }});\n {% endif %}\n {% endif %}\n {% endif %}\n {% endeach %}\n}\n\nvoid {{ cppClassName }}::InitializeComponent(v8::Local<v8::Object> target) {\n Nan::HandleScope scope;\n\n v8::Local<FunctionTemplate> tpl = Nan::New<FunctionTemplate>(JSNewFunction);\n\n tpl->InstanceTemplate()->SetInternalFieldCount(1);\n tpl->SetClassName(Nan::New(\"{{ jsClassName }}\").ToLocalChecked());\n\n {% each fields as field %}\n {% if not field.ignore %}\n {% if not field | isPayload %}\n Nan::SetAccessor(tpl->InstanceTemplate(), Nan::New(\"{{ field.jsFunctionName }}\").ToLocalChecked(), Get{{ field.cppFunctionName}}, Set{{ field.cppFunctionName}});\n {% endif %}\n {% endif %}\n {% endeach %}\n\n InitializeTemplate(tpl);\n\n v8::Local<Function> _constructor_template = Nan::GetFunction(tpl).ToLocalChecked();\n constructor_template.Reset(_constructor_template);\n Nan::Set(target, Nan::New(\"{{ jsClassName }}\").ToLocalChecked(), _constructor_template);\n}\n\n{% partial fieldAccessors . %}\n\n\/\/ force base class template instantiation, to make sure we get all the\n\/\/ methods, statics, etc.\ntemplate class NodeGitWrapper<{{ cppClassName }}Traits>;\n<commit_msg>We should clear the persistent cell in structs when they are destroyed<commit_after>#include <nan.h>\n#include <string.h>\n#ifdef WIN32\n#include <windows.h>\n#else\n#include <unistd.h>\n#endif \/\/ win32\n\nextern \"C\" {\n #include <git2.h>\n {% each cDependencies as dependency %}\n #include <{{ dependency }}>\n {% endeach %}\n}\n\n#include <iostream>\n#include \"..\/include\/nodegit.h\"\n#include \"..\/include\/lock_master.h\"\n#include \"..\/include\/functions\/copy.h\"\n#include \"..\/include\/{{ filename }}.h\"\n#include \"nodegit_wrapper.cc\"\n\n{% each dependencies as dependency %}\n #include \"{{ dependency }}\"\n{% endeach %}\n\nusing namespace v8;\nusing namespace node;\nusing namespace std;\n\n\n\/\/ generated from struct_content.cc\n{{ cppClassName }}::{{ cppClassName }}() : NodeGitWrapper<{{ cppClassName }}Traits>(NULL, true, v8::Local<v8::Object>())\n{\n {% if ignoreInit == true %}\n this->raw = new {{ cType }};\n {% else %}\n {% if isExtendedStruct %}\n {{ cType }}_extended wrappedValue = {{ cType|upper }}_INIT;\n this->raw = ({{ cType }}*) malloc(sizeof({{ cType }}_extended));\n memcpy(this->raw, &wrappedValue, sizeof({{ cType }}_extended));\n {% else %}\n {{ cType }} wrappedValue = {{ cType|upper }}_INIT;\n this->raw = ({{ cType }}*) malloc(sizeof({{ cType }}));\n memcpy(this->raw, &wrappedValue, sizeof({{ cType }}));\n {% endif %}\n {% endif %}\n\n this->ConstructFields();\n}\n\n{{ cppClassName }}::{{ cppClassName }}({{ cType }}* raw, bool selfFreeing, v8::Local<v8::Object> owner)\n : NodeGitWrapper<{{ cppClassName }}Traits>(raw, selfFreeing, owner)\n{\n this->ConstructFields();\n}\n\n{{ cppClassName }}::~{{ cppClassName }}() {\n {% each fields|fieldsInfo as field %}\n {% if not field.ignore %}\n {% if not field.isEnum %}\n {% if field.isCallbackFunction %}\n if (this->{{ field.name }}.HasCallback()) {\n {% if isExtendedStruct %}\n (({{ cType }}_extended *)this->raw)->payload = NULL;\n {% else %}\n this->raw->{{ fields|payloadFor field.name }} = NULL;\n {% endif %}\n }\n {% elsif field.hasConstructor |or field.isLibgitType %}\n this->{{ field.name }}.Reset();\n {% endif %}\n {% endif %}\n {% endif %}\n {% endeach %}\n}\n\nvoid {{ cppClassName }}::ConstructFields() {\n {% each fields|fieldsInfo as field %}\n {% if not field.ignore %}\n {% if not field.isEnum %}\n {% if field.hasConstructor |or field.isLibgitType %}\n v8::Local<Object> {{ field.name }}Temp = {{ field.cppClassName }}::New(\n {%if not field.cType|isPointer %}&{%endif%}this->raw->{{ field.name }},\n false\n )->ToObject();\n this->{{ field.name }}.Reset({{ field.name }}Temp);\n\n {% elsif field.isCallbackFunction %}\n\n \/\/ Set the static method call and set the payload for this function to be\n \/\/ the current instance\n this->raw->{{ field.name }} = NULL;\n {% if isExtendedStruct %}\n (({{ cType }}_extended *)this->raw)->payload = (void *)this;\n {% else %}\n this->raw->{{ fields|payloadFor field.name }} = (void *)this;\n {% endif %}\n {% elsif field.payloadFor %}\n\n v8::Local<Value> {{ field.name }} = Nan::Undefined();\n this->{{ field.name }}.Reset({{ field.name }});\n {% endif %}\n {% endif %}\n {% endif %}\n {% endeach %}\n}\n\nvoid {{ cppClassName }}::InitializeComponent(v8::Local<v8::Object> target) {\n Nan::HandleScope scope;\n\n v8::Local<FunctionTemplate> tpl = Nan::New<FunctionTemplate>(JSNewFunction);\n\n tpl->InstanceTemplate()->SetInternalFieldCount(1);\n tpl->SetClassName(Nan::New(\"{{ jsClassName }}\").ToLocalChecked());\n\n {% each fields as field %}\n {% if not field.ignore %}\n {% if not field | isPayload %}\n Nan::SetAccessor(tpl->InstanceTemplate(), Nan::New(\"{{ field.jsFunctionName }}\").ToLocalChecked(), Get{{ field.cppFunctionName}}, Set{{ field.cppFunctionName}});\n {% endif %}\n {% endif %}\n {% endeach %}\n\n InitializeTemplate(tpl);\n\n v8::Local<Function> _constructor_template = Nan::GetFunction(tpl).ToLocalChecked();\n constructor_template.Reset(_constructor_template);\n Nan::Set(target, Nan::New(\"{{ jsClassName }}\").ToLocalChecked(), _constructor_template);\n}\n\n{% partial fieldAccessors . %}\n\n\/\/ force base class template instantiation, to make sure we get all the\n\/\/ methods, statics, etc.\ntemplate class NodeGitWrapper<{{ cppClassName }}Traits>;\n<|endoftext|>"} {"text":"<commit_before>\/\/ Draws 2D star\n#include <GL\/gl.h>\n#include <GL\/glu.h>\n#include <GL\/glut.h>\n#include <cmath>\n#include \"common.hpp\"\n\n#define PI 3.14159265359\n \nvoid display();\nvoid display2();\nvoid init();\nvoid par(GLfloat hx, GLfloat hy, GLfloat lx, GLfloat ly, int colornum);\nvoid write(GLubyte text[]);\nvoid star();\nvoid star2();\nvoid myMouseFunc( int button, int state, int x, int y );\nvoid keyboard(unsigned char key, int a, int b);\nvoid updateWindows();\nvoid addPar(int);\n\nint c1 = 3, c2 = 2;\nint win1, win2;\n\ndouble IncFactor = PI;\nint clicks = 1;\n\nvoid addPar(int no = 1)\n{\n clicks += no;\n IncFactor = PI\/(clicks\/2.0);\n updateWindows();\n}\n\nvoid updateWindows()\n{\n glutSetWindow(win1);\n glutPostRedisplay();\n glutSetWindow(win2);\n glutPostRedisplay();\n}\n\nvoid keyboard(unsigned char key, int a, int b)\n{\n switch (key)\n {\n case('a'):\n case('A'):\n c1 = (c1 < 8)? c1 + 1 : c1;\n break;\n \n case('q'):\n case('Q'):\n c1 = (c1 > 0)? c1 - 1 : c1;\n break;\n \n case('w'):\n case('W'):\n c2 = (c2 < 8)? c2 + 1 : c2;\n break;\n \n case('s'):\n case('S'):\n c2 = (c2 > 0)? c2 - 1 : c2;\n break;\n \n case(' '):\n case('.'):\n case('>'):\n addPar();\n break;\n \n case(','):\n case('<'):\n addPar(-1);\n break;\n \n case 27:\t\t\t\/\/ Escape key\n exit(0);\n break;\n }\n \n updateWindows();\n}\n\nvoid myMouseFunc( int button, int state, int x, int y ) {\n\tif ( button==GLUT_LEFT_BUTTON && state==GLUT_DOWN ) {\n addPar();\n\t}\n}\n\nvoid display()\n{\n glClear(GL_COLOR_BUFFER_BIT | GL_DEPTH_BUFFER_BIT);\n glLoadIdentity();\n star();\n glutSwapBuffers();\n}\n\nvoid display2()\n{\n glClear(GL_COLOR_BUFFER_BIT | GL_DEPTH_BUFFER_BIT);\n glLoadIdentity();\n star2();\n glutSwapBuffers();\n}\n\nvoid par(double hx, double hy, double lx, double ly, int colornum)\n{\n glBegin(GL_TRIANGLE_FAN);\n glColor3fv(color[colornum]);\n glVertex2d(0.0,0.0);\n glVertex2d(hx,hy);\n glVertex2d(lx,ly);\n glEnd();\n glLoadIdentity();\n}\n\nvoid star2()\n{\n for (double deg = 0.0; deg < 2*PI; deg += IncFactor)\n {\n par(cos(deg), sin(deg), 0.2 * cos(deg + IncFactor\/2.0), 0.2 * sin(deg + IncFactor\/2.0), c1);\n par(0.2 * sin(deg + IncFactor\/2.0), 0.2 * cos(deg + IncFactor\/2.0), sin(deg), cos(deg), c2);\n }\n}\n\nvoid star()\n{ \n glBegin(GL_TRIANGLE_FAN);\n glColor3fv(color[c1]);\n glVertex2f(0.0, 0.0);\n glColor3fv(color[c2]);\n for (double deg = 0.0; deg < 2*PI; deg += IncFactor)\n {\n glVertex2f(cos(deg), sin(deg));\n glVertex2f(0.2 * cos(deg + IncFactor\/2.0), 0.2 * sin(deg + IncFactor\/2.0));\n }\n glVertex2f(1.0, 0.0);\n glEnd();\n glLoadIdentity();\n}\n\nvoid init()\n{\n glClearColor(0.0 ,0.0 ,0.0 ,0.0);\n\tglLoadIdentity();\n}\n\nint main(int argc, char **argv)\n{\n glutInit(&argc, argv);\n glutInitDisplayMode(GLUT_DOUBLE | GLUT_RGB | GLUT_DEPTH);\n \n \/\/ window one\n glutInitWindowSize(500, 500);\n glutInitWindowPosition(0,0);\n win1 = glutCreateWindow(\"Star fade color\");\n glutDisplayFunc(display);\n \n glutMouseFunc(myMouseFunc);\n glutKeyboardFunc(keyboard);\n \n \/\/ window two\n glutInitWindowSize(500, 500);\n glutInitWindowPosition(600, 0);\n win2 = glutCreateWindow(\"Star solid color\");\n glutDisplayFunc(display2); \n \n glutMouseFunc(myMouseFunc);\n glutKeyboardFunc(keyboard);\n \n init();\n glutMainLoop();\n}\n<commit_msg>rearranged functions<commit_after>\/\/ Draws 2D star\n#include <GL\/gl.h>\n#include <GL\/glu.h>\n#include <GL\/glut.h>\n#include <cmath>\n#include \"common.hpp\"\n\n#define PI 3.14159265359\n\nvoid par(double hx, double hy, double lx, double ly, int colornum);\nvoid addPar(int);\nvoid star();\nvoid star2();\nvoid updateWindows();\nvoid Mouse( int button, int state, int x, int y );\nvoid keyboard(unsigned char key, int a, int b);\nvoid display();\nvoid display2();\nvoid init();\n\nint color1 = 3, color2 = 2;\nint clicks = 1;\nint win1, win2;\ndouble IncFactor = PI;\n\nvoid star()\n{ \n glBegin(GL_TRIANGLE_FAN);\n glColor3fv(color[color1]);\n glVertex2f(0.0, 0.0);\n glColor3fv(color[color2]);\n for (double deg = 0.0; deg < 2*PI; deg += IncFactor)\n {\n glVertex2f(cos(deg), sin(deg));\n glVertex2f(0.2 * cos(deg + IncFactor\/2.0), 0.2 * sin(deg + IncFactor\/2.0));\n }\n glVertex2f(1.0, 0.0);\n glEnd();\n glLoadIdentity();\n}\n\nvoid par(double hx, double hy, double lx, double ly, int colornum)\n{\n glBegin(GL_TRIANGLE_FAN);\n glColor3fv(color[colornum]);\n glVertex2d(0.0,0.0);\n glVertex2d(hx,hy);\n glVertex2d(lx,ly);\n glEnd();\n glLoadIdentity();\n}\n\nvoid star2()\n{\n for (double deg = 0.0; deg < 2*PI; deg += IncFactor)\n {\n par(cos(deg), sin(deg), 0.2 * cos(deg + IncFactor\/2.0), 0.2 * sin(deg + IncFactor\/2.0), color1);\n par(0.2 * sin(deg + IncFactor\/2.0), 0.2 * cos(deg + IncFactor\/2.0), sin(deg), cos(deg), color2);\n }\n}\n\nvoid addPar(int no = 1)\n{\n clicks += no;\n IncFactor = PI\/(clicks\/2.0);\n updateWindows();\n}\n\nvoid init()\n{\n glClearColor(0.0 ,0.0 ,0.0 ,0.0);\n\tglLoadIdentity();\n}\n\nint main(int argc, char **argv)\n{\n glutInit(&argc, argv);\n glutInitDisplayMode(GLUT_DOUBLE | GLUT_RGB | GLUT_DEPTH);\n \n \/\/ window one\n glutInitWindowSize(500, 500);\n glutInitWindowPosition(0,0);\n win1 = glutCreateWindow(\"Star fade color\");\n glutDisplayFunc(display);\n \n glutMouseFunc(Mouse);\n glutKeyboardFunc(keyboard);\n \n \/\/ window two\n glutInitWindowSize(500, 500);\n glutInitWindowPosition(600, 0);\n win2 = glutCreateWindow(\"Star solid color\");\n glutDisplayFunc(display2); \n \n glutMouseFunc(Mouse);\n glutKeyboardFunc(keyboard);\n \n init();\n glutMainLoop();\n}\n\n\nvoid updateWindows()\n{\n glutSetWindow(win1);\n glutPostRedisplay();\n glutSetWindow(win2);\n glutPostRedisplay();\n}\n\nvoid keyboard(unsigned char key, int a, int b)\n{\n switch (key)\n {\n case('a'):\n case('A'):\n color1 = (color1 < 8)? color1 + 1 : color1;\n break;\n \n case('q'):\n case('Q'):\n color1 = (color1 > 0)? color1 - 1 : color1;\n break;\n \n case('w'):\n case('W'):\n color2 = (color2 < 8)? color2 + 1 : color2;\n break;\n \n case('s'):\n case('S'):\n color2 = (color2 > 0)? color2 - 1 : color2;\n break;\n \n case(' '):\n case('.'):\n case('>'):\n addPar();\n break;\n \n case(','):\n case('<'):\n addPar(-1);\n break;\n \n case 27:\t\t\t\/\/ Escape key\n exit(0);\n break;\n }\n \n updateWindows();\n}\n\nvoid Mouse( int button, int state, int x, int y ) {\n\tif ( button==GLUT_LEFT_BUTTON && state==GLUT_DOWN ) {\n addPar();\n\t}\n}\n\nvoid display()\n{\n glClear(GL_COLOR_BUFFER_BIT | GL_DEPTH_BUFFER_BIT);\n glLoadIdentity();\n star();\n glutSwapBuffers();\n}\n\nvoid display2()\n{\n glClear(GL_COLOR_BUFFER_BIT | GL_DEPTH_BUFFER_BIT);\n glLoadIdentity();\n star2();\n glutSwapBuffers();\n}\n<|endoftext|>"} {"text":"<commit_before>#ifndef __PLUGINSETTINGS_HPP__\n#define __PLUGINSETTINGS_HPP__\n\n#include \"plugin.hpp\"\n\nclass PluginSettings\n{\n\tHANDLE handle;\n\tFARAPISETTINGSCONTROL SettingsControl;\n\npublic:\n\n\tPluginSettings(const GUID &guid, FARAPISETTINGSCONTROL SettingsControl)\n\t{\n\t\tthis->SettingsControl = SettingsControl;\n\t\thandle = INVALID_HANDLE_VALUE;\n\n\t\tFarSettingsCreate settings={sizeof(FarSettingsCreate),guid,handle};\n\t\tif (SettingsControl(INVALID_HANDLE_VALUE,SCTL_CREATE,0,&settings))\n\t\t\thandle = settings.Handle;\n\t}\n\n\t~PluginSettings()\n\t{\n\t SettingsControl(handle,SCTL_FREE,0,0);\n\t}\n\n\tint CreateSubKey(int Root, const wchar_t *Name)\n\t{\n\t\tFarSettingsValue value={Root,Name};\n\t\treturn (int)SettingsControl(handle,SCTL_SUBKEY,0,&value);\n\t}\n\n\tconst wchar_t *Get(int Root, const wchar_t *Name, const wchar_t *Default)\n\t{\n\t\tFarSettingsItem item={Root,Name,FST_STRING};\n\t\tif (SettingsControl(handle,SCTL_GET,0,&item))\n\t\t{\n\t\t\treturn item.String;\n\t\t}\n\t\treturn Default;\n\t}\n\n\tvoid Get(int Root, const wchar_t *Name, wchar_t *Value, size_t Size, const wchar_t *Default)\n\t{\n\t\tlstrcpyn(Value, Get(Root,Name,Default), (int)Size);\n\t}\n\n\tunsigned __int64 Get(int Root, const wchar_t *Name, unsigned __int64 Default)\n\t{\n\t\tFarSettingsItem item={Root,Name,FST_QWORD};\n\t\tif (SettingsControl(handle,SCTL_GET,0,&item))\n\t\t{\n\t\t\treturn item.Number;\n\t\t}\n\t\treturn Default;\n\t}\n\n\t__int64 Get(int Root, const wchar_t *Name, __int64 Default) { return (__int64)Get(Root,Name,(unsigned __int64)Default); }\n\tint Get(int Root, const wchar_t *Name, int Default) { return (int)Get(Root,Name,(unsigned __int64)Default); }\n\tunsigned int Get(int Root, const wchar_t *Name, unsigned int Default) { return (unsigned int)Get(Root,Name,(unsigned __int64)Default); }\n\tDWORD Get(int Root, const wchar_t *Name, DWORD Default) { return (DWORD)Get(Root,Name,(unsigned __int64)Default); }\n\tbool Get(int Root, const wchar_t *Name, bool Default) { return Get(Root,Name,Default?1ull:0ull)?true:false; }\n\n\tbool Set(int Root, const wchar_t *Name, const wchar_t *Value)\n\t{\n\t\tFarSettingsItem item={Root,Name,FST_STRING};\n\t\titem.String=Value;\n\t\treturn SettingsControl(handle,SCTL_SET,0,&item)!=FALSE;\n\t}\n\n\tbool Set(int Root, const wchar_t *Name, unsigned __int64 Value)\n\t{\n\t\tFarSettingsItem item={Root,Name,FST_QWORD};\n\t\titem.Number=Value;\n\t\treturn SettingsControl(handle,SCTL_SET,0,&item)!=FALSE;\n\t}\n\n\tbool Set(int Root, const wchar_t *Name, __int64 Value) { return Set(Root,Name,(unsigned __int64)Value); }\n\tbool Set(int Root, const wchar_t *Name, int Value) { return Set(Root,Name,(unsigned __int64)Value); }\n\tbool Set(int Root, const wchar_t *Name, unsigned int Value) { return Set(Root,Name,(unsigned __int64)Value); }\n\tbool Set(int Root, const wchar_t *Name, DWORD Value) { return Set(Root,Name,(unsigned __int64)Value); }\n\tbool Set(int Root, const wchar_t *Name, bool Value) { return Set(Root,Name,Value?1ull:0ull); }\n};\n\n#endif\n<commit_msg>add delete<commit_after>#ifndef __PLUGINSETTINGS_HPP__\n#define __PLUGINSETTINGS_HPP__\n\n#include \"plugin.hpp\"\n\nclass PluginSettings\n{\n\tHANDLE handle;\n\tFARAPISETTINGSCONTROL SettingsControl;\n\npublic:\n\n\tPluginSettings(const GUID &guid, FARAPISETTINGSCONTROL SettingsControl)\n\t{\n\t\tthis->SettingsControl = SettingsControl;\n\t\thandle = INVALID_HANDLE_VALUE;\n\n\t\tFarSettingsCreate settings={sizeof(FarSettingsCreate),guid,handle};\n\t\tif (SettingsControl(INVALID_HANDLE_VALUE,SCTL_CREATE,0,&settings))\n\t\t\thandle = settings.Handle;\n\t}\n\n\t~PluginSettings()\n\t{\n\t SettingsControl(handle,SCTL_FREE,0,0);\n\t}\n\n\tint CreateSubKey(int Root, const wchar_t *Name)\n\t{\n\t\tFarSettingsValue value={Root,Name};\n\t\treturn (int)SettingsControl(handle,SCTL_SUBKEY,0,&value);\n\t}\n\n\tbool DeleteSubKey(int Root)\n\t{\n\t\tFarSettingsValue value={Root,nullptr};\n\t\treturn (int)SettingsControl(handle,SCTL_DELETE,0,&value) ? true : false;\n\t}\n\n\tbool DeleteValue(int Root, const wchar_t *Name)\n\t{\n\t\tFarSettingsValue value={Root,Name};\n\t\treturn (int)SettingsControl(handle,SCTL_DELETE,0,&value) ? true : false;\n\t}\n\n\tconst wchar_t *Get(int Root, const wchar_t *Name, const wchar_t *Default)\n\t{\n\t\tFarSettingsItem item={Root,Name,FST_STRING};\n\t\tif (SettingsControl(handle,SCTL_GET,0,&item))\n\t\t{\n\t\t\treturn item.String;\n\t\t}\n\t\treturn Default;\n\t}\n\n\tvoid Get(int Root, const wchar_t *Name, wchar_t *Value, size_t Size, const wchar_t *Default)\n\t{\n\t\tlstrcpyn(Value, Get(Root,Name,Default), (int)Size);\n\t}\n\n\tunsigned __int64 Get(int Root, const wchar_t *Name, unsigned __int64 Default)\n\t{\n\t\tFarSettingsItem item={Root,Name,FST_QWORD};\n\t\tif (SettingsControl(handle,SCTL_GET,0,&item))\n\t\t{\n\t\t\treturn item.Number;\n\t\t}\n\t\treturn Default;\n\t}\n\n\t__int64 Get(int Root, const wchar_t *Name, __int64 Default) { return (__int64)Get(Root,Name,(unsigned __int64)Default); }\n\tint Get(int Root, const wchar_t *Name, int Default) { return (int)Get(Root,Name,(unsigned __int64)Default); }\n\tunsigned int Get(int Root, const wchar_t *Name, unsigned int Default) { return (unsigned int)Get(Root,Name,(unsigned __int64)Default); }\n\tDWORD Get(int Root, const wchar_t *Name, DWORD Default) { return (DWORD)Get(Root,Name,(unsigned __int64)Default); }\n\tbool Get(int Root, const wchar_t *Name, bool Default) { return Get(Root,Name,Default?1ull:0ull)?true:false; }\n\n\tbool Set(int Root, const wchar_t *Name, const wchar_t *Value)\n\t{\n\t\tFarSettingsItem item={Root,Name,FST_STRING};\n\t\titem.String=Value;\n\t\treturn SettingsControl(handle,SCTL_SET,0,&item)!=FALSE;\n\t}\n\n\tbool Set(int Root, const wchar_t *Name, unsigned __int64 Value)\n\t{\n\t\tFarSettingsItem item={Root,Name,FST_QWORD};\n\t\titem.Number=Value;\n\t\treturn SettingsControl(handle,SCTL_SET,0,&item)!=FALSE;\n\t}\n\n\tbool Set(int Root, const wchar_t *Name, __int64 Value) { return Set(Root,Name,(unsigned __int64)Value); }\n\tbool Set(int Root, const wchar_t *Name, int Value) { return Set(Root,Name,(unsigned __int64)Value); }\n\tbool Set(int Root, const wchar_t *Name, unsigned int Value) { return Set(Root,Name,(unsigned __int64)Value); }\n\tbool Set(int Root, const wchar_t *Name, DWORD Value) { return Set(Root,Name,(unsigned __int64)Value); }\n\tbool Set(int Root, const wchar_t *Name, bool Value) { return Set(Root,Name,Value?1ull:0ull); }\n};\n\n#endif\n<|endoftext|>"} {"text":"<commit_before>\/**\n * @file\n *\n * @brief Source for cpptemplate plugin\n *\n * @copyright BSD License (see LICENSE.md or https:\/\/www.libelektra.org)\n *\n *\/\n\n#include \"cpptemplate.hpp\"\n#include \"cpptemplate_delegate.hpp\"\n\n#include <kdbhelper.h>\n\nusing elektra::CppTemplateDelegate;\n\nextern \"C\" {\n\ntypedef Delegator<CppTemplateDelegate> delegator;\n\n\/** @see elektraDocOpen *\/\nint elektraCppTemplateOpen (Plugin * handle, Key * key)\n{\n\t\/\/ After the call to `delegator::open` you can retrieve a pointer to the delegate via `coderDelegator::get (handle)`\n\treturn delegator::open (handle, key);\n}\n\n\/** @see elektraDocClose *\/\nint elektraCppTemplateClose (Plugin * handle, Key * key)\n{\n\treturn delegator::close (handle, key);\n}\n\n\/** @see elektraDocGet *\/\nint elektraCppTemplateGet (Plugin * handle ELEKTRA_UNUSED, KeySet * returned, Key * parentKey)\n{\n\tif (!elektraStrCmp (keyName (parentKey), \"system\/elektra\/modules\/cpptemplate\"))\n\t{\n\t\tKeySet * contract = ksNew (\n\t\t\t30, keyNew (\"system\/elektra\/modules\/cpptemplate\", KEY_VALUE, \"cpptemplate plugin waits for your orders\", KEY_END),\n\t\t\tkeyNew (\"system\/elektra\/modules\/cpptemplate\/exports\", KEY_END),\n\t\t\tkeyNew (\"system\/elektra\/modules\/cpptemplate\/exports\/open\", KEY_FUNC, elektraCppTemplateOpen, KEY_END),\n\t\t\tkeyNew (\"system\/elektra\/modules\/cpptemplate\/exports\/close\", KEY_FUNC, elektraCppTemplateClose, KEY_END),\n\t\t\tkeyNew (\"system\/elektra\/modules\/cpptemplate\/exports\/get\", KEY_FUNC, elektraCppTemplateGet, KEY_END),\n\t\t\tkeyNew (\"system\/elektra\/modules\/cpptemplate\/exports\/set\", KEY_FUNC, elektraCppTemplateSet, KEY_END),\n\t\t\tkeyNew (\"system\/elektra\/modules\/cpptemplate\/exports\/error\", KEY_FUNC, elektraCppTemplateError, KEY_END),\n\t\t\tkeyNew (\"system\/elektra\/modules\/cpptemplate\/exports\/checkconf\", KEY_FUNC, elektraCppTemplateCheckConfig, KEY_END),\n#include ELEKTRA_README (cpptemplate)\n\t\t\tkeyNew (\"system\/elektra\/modules\/cpptemplate\/infos\/version\", KEY_VALUE, PLUGINVERSION, KEY_END), KS_END);\n\t\tksAppend (returned, contract);\n\t\tksDel (contract);\n\n\t\treturn ELEKTRA_PLUGIN_STATUS_SUCCESS;\n\t}\n\n\treturn ELEKTRA_PLUGIN_STATUS_NO_UPDATE;\n}\n\n\/** @see elektraDocSet *\/\nint elektraCppTemplateSet (Plugin * handle ELEKTRA_UNUSED, KeySet * returned ELEKTRA_UNUSED, Key * parentKey ELEKTRA_UNUSED)\n{\n\treturn ELEKTRA_PLUGIN_STATUS_NO_UPDATE;\n}\n\n\/** @see elektraDocError *\/\nint elektraCppTemplateError (Plugin * handle ELEKTRA_UNUSED, KeySet * returned ELEKTRA_UNUSED, Key * parentKey ELEKTRA_UNUSED)\n{\n\treturn ELEKTRA_PLUGIN_STATUS_SUCCESS;\n}\n\n\/** @see elektraDocCheckConf *\/\nint elektraCppTemplateCheckConfig (Key * errorKey ELEKTRA_UNUSED, KeySet * conf ELEKTRA_UNUSED)\n{\n\treturn ELEKTRA_PLUGIN_STATUS_NO_UPDATE;\n}\n\nPlugin * ELEKTRA_PLUGIN_EXPORT (cpptemplate)\n{\n\t\/\/ clang-format off\n\treturn elektraPluginExport (\"cpptemplate\",\n\t\tELEKTRA_PLUGIN_OPEN,\t&elektraCppTemplateOpen,\n\t\tELEKTRA_PLUGIN_CLOSE,\t&elektraCppTemplateClose,\n\t\tELEKTRA_PLUGIN_GET,\t&elektraCppTemplateGet,\n\t\tELEKTRA_PLUGIN_SET,\t&elektraCppTemplateSet,\n\t\tELEKTRA_PLUGIN_ERROR,\t&elektraCppTemplateError,\n\t\tELEKTRA_PLUGIN_END);\n}\n\n} \/\/ end extern \"C\"\n<commit_msg>CPP Template: Add function for plugin contract<commit_after>\/**\n * @file\n *\n * @brief Source for cpptemplate plugin\n *\n * @copyright BSD License (see LICENSE.md or https:\/\/www.libelektra.org)\n *\n *\/\n\n#include \"cpptemplate.hpp\"\n#include \"cpptemplate_delegate.hpp\"\n\n#include <kdbhelper.h>\n\nusing elektra::CppTemplateDelegate;\n\nusing CppKey = kdb::Key;\nusing CppKeySet = kdb::KeySet;\n\nnamespace\n{\n\n\/**\n * @brief This function returns a key set containing the plugin contract.\n *\n * @return A key set specifying the capabilities of the plugin\n *\/\nCppKeySet getContract ()\n{\n\treturn CppKeySet{ 30,\n\t\t\t keyNew (\"system\/elektra\/modules\/cpptemplate\", KEY_VALUE, \"cpptemplate plugin waits for your orders\", KEY_END),\n\t\t\t keyNew (\"system\/elektra\/modules\/cpptemplate\/exports\", KEY_END),\n\t\t\t keyNew (\"system\/elektra\/modules\/cpptemplate\/exports\/open\", KEY_FUNC, elektraCppTemplateOpen, KEY_END),\n\t\t\t keyNew (\"system\/elektra\/modules\/cpptemplate\/exports\/close\", KEY_FUNC, elektraCppTemplateClose, KEY_END),\n\t\t\t keyNew (\"system\/elektra\/modules\/cpptemplate\/exports\/get\", KEY_FUNC, elektraCppTemplateGet, KEY_END),\n\t\t\t keyNew (\"system\/elektra\/modules\/cpptemplate\/exports\/set\", KEY_FUNC, elektraCppTemplateSet, KEY_END),\n\t\t\t keyNew (\"system\/elektra\/modules\/cpptemplate\/exports\/error\", KEY_FUNC, elektraCppTemplateError, KEY_END),\n\t\t\t keyNew (\"system\/elektra\/modules\/cpptemplate\/exports\/checkconf\", KEY_FUNC, elektraCppTemplateCheckConfig, KEY_END),\n#include ELEKTRA_README (cpptemplate)\n\t\t\t keyNew (\"system\/elektra\/modules\/cpptemplate\/infos\/version\", KEY_VALUE, PLUGINVERSION, KEY_END),\n\t\t\t KS_END };\n}\n\n} \/\/ end namespace\n\nextern \"C\" {\n\ntypedef Delegator<CppTemplateDelegate> delegator;\n\n\/** @see elektraDocOpen *\/\nint elektraCppTemplateOpen (Plugin * handle, Key * key)\n{\n\t\/\/ After the call to `delegator::open` you can retrieve a pointer to the delegate via `coderDelegator::get (handle)`\n\treturn delegator::open (handle, key);\n}\n\n\/** @see elektraDocClose *\/\nint elektraCppTemplateClose (Plugin * handle, Key * key)\n{\n\treturn delegator::close (handle, key);\n}\n\n\/** @see elektraDocGet *\/\nint elektraCppTemplateGet (Plugin * handle ELEKTRA_UNUSED, KeySet * returned, Key * parentKey)\n{\n\tCppKeySet keys{ returned };\n\tCppKey parent{ parentKey };\n\tbool updated = false;\n\n\tif (parent.getName () == \"system\/elektra\/modules\/cpptemplate\")\n\t{\n\t\tkeys.append (getContract ());\n\t\tupdated = true;\n\t}\n\n\tparent.release ();\n\tkeys.release ();\n\treturn updated ? ELEKTRA_PLUGIN_STATUS_SUCCESS : ELEKTRA_PLUGIN_STATUS_NO_UPDATE;\n}\n\n\/** @see elektraDocSet *\/\nint elektraCppTemplateSet (Plugin * handle ELEKTRA_UNUSED, KeySet * returned ELEKTRA_UNUSED, Key * parentKey ELEKTRA_UNUSED)\n{\n\treturn ELEKTRA_PLUGIN_STATUS_NO_UPDATE;\n}\n\n\/** @see elektraDocError *\/\nint elektraCppTemplateError (Plugin * handle ELEKTRA_UNUSED, KeySet * returned ELEKTRA_UNUSED, Key * parentKey ELEKTRA_UNUSED)\n{\n\treturn ELEKTRA_PLUGIN_STATUS_SUCCESS;\n}\n\n\/** @see elektraDocCheckConf *\/\nint elektraCppTemplateCheckConfig (Key * errorKey ELEKTRA_UNUSED, KeySet * conf ELEKTRA_UNUSED)\n{\n\treturn ELEKTRA_PLUGIN_STATUS_NO_UPDATE;\n}\n\nPlugin * ELEKTRA_PLUGIN_EXPORT (cpptemplate)\n{\n\t\/\/ clang-format off\n\treturn elektraPluginExport (\"cpptemplate\",\n\t\tELEKTRA_PLUGIN_OPEN,\t&elektraCppTemplateOpen,\n\t\tELEKTRA_PLUGIN_CLOSE,\t&elektraCppTemplateClose,\n\t\tELEKTRA_PLUGIN_GET,\t&elektraCppTemplateGet,\n\t\tELEKTRA_PLUGIN_SET,\t&elektraCppTemplateSet,\n\t\tELEKTRA_PLUGIN_ERROR,\t&elektraCppTemplateError,\n\t\tELEKTRA_PLUGIN_END);\n}\n\n} \/\/ end extern \"C\"\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 \"registerwindow.h\"\n\n#include \"debuggeractions.h\"\n#include \"debuggerconstants.h\"\n\n#include <utils\/qtcassert.h>\n#include <utils\/savedaction.h>\n\n#include <QtCore\/QDebug>\n#include <QtCore\/QDir>\n#include <QtCore\/QFileInfo>\n#include <QtCore\/QFileInfoList>\n\n#include <QtGui\/QAction>\n#include <QtGui\/QHeaderView>\n#include <QtGui\/QItemDelegate>\n#include <QtGui\/QLineEdit>\n#include <QtGui\/QMenu>\n#include <QtGui\/QPainter>\n#include <QtGui\/QResizeEvent>\n#include <QtGui\/QToolButton>\n\nnamespace Debugger {\nnamespace Internal {\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\n\/\/ RegisterDelegate\n\/\/\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nclass RegisterDelegate : public QItemDelegate\n{\npublic:\n RegisterDelegate(RegisterWindow *owner, QObject *parent)\n : QItemDelegate(parent), m_owner(owner)\n {}\n\n QWidget *createEditor(QWidget *parent, const QStyleOptionViewItem &,\n const QModelIndex &) const\n {\n QLineEdit *lineEdit = new QLineEdit(parent);\n lineEdit->setAlignment(Qt::AlignRight);\n return lineEdit;\n }\n\n void setEditorData(QWidget *editor, const QModelIndex &index) const\n {\n QLineEdit *lineEdit = qobject_cast<QLineEdit *>(editor);\n QTC_ASSERT(lineEdit, return);\n lineEdit->setText(index.data(Qt::DisplayRole).toString());\n }\n\n void setModelData(QWidget *editor, QAbstractItemModel *model,\n const QModelIndex &index) const\n {\n Q_UNUSED(model);\n \/\/qDebug() << \"SET MODEL DATA\";\n QLineEdit *lineEdit = qobject_cast<QLineEdit*>(editor);\n QTC_ASSERT(lineEdit, return);\n QString value = lineEdit->text();\n \/\/model->setData(index, value, Qt::EditRole);\n if (index.column() == 1)\n m_owner->model()->setData(index, value, RequestSetRegisterRole);\n }\n\n void updateEditorGeometry(QWidget *editor, const QStyleOptionViewItem &option,\n const QModelIndex &) const\n {\n editor->setGeometry(option.rect);\n }\n\n void paint(QPainter *painter, const QStyleOptionViewItem &option,\n const QModelIndex &index) const\n {\n if (index.column() == 1) {\n bool paintRed = index.data(RegisterChangedRole).toBool();\n QPen oldPen = painter->pen();\n if (paintRed)\n painter->setPen(QColor(200, 0, 0));\n \/\/ FIXME: performance? this changes only on real font changes.\n QFontMetrics fm(option.font);\n int charWidth = fm.width(QLatin1Char('x'));\n for (int i = '1'; i <= '9'; ++i)\n charWidth = qMax(charWidth, fm.width(QLatin1Char(i)));\n for (int i = 'a'; i <= 'f'; ++i)\n charWidth = qMax(charWidth, fm.width(QLatin1Char(i)));\n QString str = index.data(Qt::DisplayRole).toString();\n int x = option.rect.x();\n for (int i = 0; i < str.size(); ++i) {\n QRect r = option.rect;\n r.setX(x);\n r.setWidth(charWidth);\n x += charWidth;\n painter->drawText(r, Qt::AlignHCenter, QString(str.at(i)));\n }\n if (paintRed)\n painter->setPen(oldPen);\n } else {\n QItemDelegate::paint(painter, option, index);\n }\n }\n\nprivate:\n RegisterWindow *m_owner;\n};\n\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\n\/\/ RegisterWindow\n\/\/\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nRegisterWindow::RegisterWindow(QWidget *parent)\n : QTreeView(parent), m_alwaysResizeColumnsToContents(true)\n{\n QAction *act = theDebuggerAction(UseAlternatingRowColors);\n setWindowTitle(tr(\"Registers\"));\n setAttribute(Qt::WA_MacShowFocusRect, false);\n setAlternatingRowColors(act->isChecked());\n setRootIsDecorated(false);\n setItemDelegate(new RegisterDelegate(this, this));\n\n connect(act, SIGNAL(toggled(bool)),\n this, SLOT(setAlternatingRowColorsHelper(bool)));\n}\n\nvoid RegisterWindow::resizeEvent(QResizeEvent *ev)\n{\n QTreeView::resizeEvent(ev);\n}\n\nvoid RegisterWindow::contextMenuEvent(QContextMenuEvent *ev)\n{\n QMenu menu;\n\n const unsigned engineCapabilities = modelData(EngineCapabilitiesRole).toUInt();\n const bool actionsEnabled = modelData(EngineActionsEnabledRole).toInt();\n const int state = modelData(EngineStateRole).toInt();\n\n QAction *actReload = menu.addAction(tr(\"Reload Register Listing\"));\n actReload->setEnabled((engineCapabilities & RegisterCapability)\n && (state == InferiorStopOk || state == InferiorUnrunnable));\n\n menu.addSeparator();\n\n QModelIndex idx = indexAt(ev->pos());\n QString address = modelData(RegisterAddressRole, idx).toString();\n QAction *actShowMemory = menu.addAction(QString());\n if (address.isEmpty()) {\n actShowMemory->setText(tr(\"Open Memory Editor\"));\n actShowMemory->setEnabled(false);\n } else {\n actShowMemory->setText(tr(\"Open Memory Editor at %1\").arg(address));\n actShowMemory->setEnabled(actionsEnabled\n && (engineCapabilities & ShowMemoryCapability));\n }\n menu.addSeparator();\n\n int base = modelData(RegisterNumberBaseRole).toInt();\n QAction *act16 = menu.addAction(tr(\"Hexadecimal\"));\n act16->setCheckable(true);\n act16->setChecked(base == 16);\n QAction *act10 = menu.addAction(tr(\"Decimal\"));\n act10->setCheckable(true);\n act10->setChecked(base == 10);\n QAction *act8 = menu.addAction(tr(\"Octal\"));\n act8->setCheckable(true);\n act8->setChecked(base == 8);\n QAction *act2 = menu.addAction(tr(\"Binary\"));\n act2->setCheckable(true);\n act2->setChecked(base == 2);\n menu.addSeparator();\n\n QAction *actAdjust = menu.addAction(tr(\"Adjust Column Widths to Contents\"));\n QAction *actAlwaysAdjust =\n menu.addAction(tr(\"Always Adjust Column Widths to Contents\"));\n actAlwaysAdjust->setCheckable(true);\n actAlwaysAdjust->setChecked(m_alwaysResizeColumnsToContents);\n menu.addSeparator();\n\n menu.addAction(theDebuggerAction(SettingsDialog));\n\n QAction *act = menu.exec(ev->globalPos());\n\n if (act == actAdjust)\n resizeColumnsToContents();\n else if (act == actAlwaysAdjust)\n setAlwaysResizeColumnsToContents(!m_alwaysResizeColumnsToContents);\n else if (act == actReload)\n setModelData(RequestReloadRegistersRole);\n else if (act == actShowMemory)\n setModelData(RequestShowMemoryRole, address);\n else if (act) {\n base = (act == act10 ? 10 : act == act8 ? 8 : act == act2 ? 2 : 16);\n QMetaObject::invokeMethod(model(), \"setNumberBase\", Q_ARG(int, base));\n }\n}\n\nvoid RegisterWindow::resizeColumnsToContents()\n{\n resizeColumnToContents(0);\n resizeColumnToContents(1);\n}\n\nvoid RegisterWindow::setAlwaysResizeColumnsToContents(bool on)\n{\n m_alwaysResizeColumnsToContents = on;\n QHeaderView::ResizeMode mode = on\n ? QHeaderView::ResizeToContents : QHeaderView::Interactive;\n header()->setResizeMode(0, mode);\n header()->setResizeMode(1, mode);\n}\n\nvoid RegisterWindow::setModel(QAbstractItemModel *model)\n{\n QTreeView::setModel(model);\n setAlwaysResizeColumnsToContents(true);\n}\n\nvoid RegisterWindow::reloadRegisters()\n{\n \/\/ FIXME: Only trigger when becoming visible?\n setModelData(RequestReloadRegistersRole);\n}\n\nvoid RegisterWindow::setModelData\n (int role, const QVariant &value, const QModelIndex &index)\n{\n QTC_ASSERT(model(), return);\n model()->setData(index, value, role);\n}\n\nQVariant RegisterWindow::modelData(int role, const QModelIndex &index)\n{\n QTC_ASSERT(model(), return QVariant());\n return model()->data(index, role);\n}\n\n} \/\/ namespace Internal\n} \/\/ namespace Debugger\n<commit_msg>debugger: the register view should have no extra frame.<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 \"registerwindow.h\"\n\n#include \"debuggeractions.h\"\n#include \"debuggerconstants.h\"\n\n#include <utils\/qtcassert.h>\n#include <utils\/savedaction.h>\n\n#include <QtCore\/QDebug>\n#include <QtCore\/QDir>\n#include <QtCore\/QFileInfo>\n#include <QtCore\/QFileInfoList>\n\n#include <QtGui\/QAction>\n#include <QtGui\/QHeaderView>\n#include <QtGui\/QItemDelegate>\n#include <QtGui\/QLineEdit>\n#include <QtGui\/QMenu>\n#include <QtGui\/QPainter>\n#include <QtGui\/QResizeEvent>\n#include <QtGui\/QToolButton>\n\nnamespace Debugger {\nnamespace Internal {\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\n\/\/ RegisterDelegate\n\/\/\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nclass RegisterDelegate : public QItemDelegate\n{\npublic:\n RegisterDelegate(RegisterWindow *owner, QObject *parent)\n : QItemDelegate(parent), m_owner(owner)\n {}\n\n QWidget *createEditor(QWidget *parent, const QStyleOptionViewItem &,\n const QModelIndex &) const\n {\n QLineEdit *lineEdit = new QLineEdit(parent);\n lineEdit->setAlignment(Qt::AlignRight);\n return lineEdit;\n }\n\n void setEditorData(QWidget *editor, const QModelIndex &index) const\n {\n QLineEdit *lineEdit = qobject_cast<QLineEdit *>(editor);\n QTC_ASSERT(lineEdit, return);\n lineEdit->setText(index.data(Qt::DisplayRole).toString());\n }\n\n void setModelData(QWidget *editor, QAbstractItemModel *model,\n const QModelIndex &index) const\n {\n Q_UNUSED(model);\n \/\/qDebug() << \"SET MODEL DATA\";\n QLineEdit *lineEdit = qobject_cast<QLineEdit*>(editor);\n QTC_ASSERT(lineEdit, return);\n QString value = lineEdit->text();\n \/\/model->setData(index, value, Qt::EditRole);\n if (index.column() == 1)\n m_owner->model()->setData(index, value, RequestSetRegisterRole);\n }\n\n void updateEditorGeometry(QWidget *editor, const QStyleOptionViewItem &option,\n const QModelIndex &) const\n {\n editor->setGeometry(option.rect);\n }\n\n void paint(QPainter *painter, const QStyleOptionViewItem &option,\n const QModelIndex &index) const\n {\n if (index.column() == 1) {\n bool paintRed = index.data(RegisterChangedRole).toBool();\n QPen oldPen = painter->pen();\n if (paintRed)\n painter->setPen(QColor(200, 0, 0));\n \/\/ FIXME: performance? this changes only on real font changes.\n QFontMetrics fm(option.font);\n int charWidth = fm.width(QLatin1Char('x'));\n for (int i = '1'; i <= '9'; ++i)\n charWidth = qMax(charWidth, fm.width(QLatin1Char(i)));\n for (int i = 'a'; i <= 'f'; ++i)\n charWidth = qMax(charWidth, fm.width(QLatin1Char(i)));\n QString str = index.data(Qt::DisplayRole).toString();\n int x = option.rect.x();\n for (int i = 0; i < str.size(); ++i) {\n QRect r = option.rect;\n r.setX(x);\n r.setWidth(charWidth);\n x += charWidth;\n painter->drawText(r, Qt::AlignHCenter, QString(str.at(i)));\n }\n if (paintRed)\n painter->setPen(oldPen);\n } else {\n QItemDelegate::paint(painter, option, index);\n }\n }\n\nprivate:\n RegisterWindow *m_owner;\n};\n\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\n\/\/ RegisterWindow\n\/\/\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nRegisterWindow::RegisterWindow(QWidget *parent)\n : QTreeView(parent), m_alwaysResizeColumnsToContents(true)\n{\n QAction *act = theDebuggerAction(UseAlternatingRowColors);\n setFrameStyle(QFrame::NoFrame);\n setWindowTitle(tr(\"Registers\"));\n setAttribute(Qt::WA_MacShowFocusRect, false);\n setAlternatingRowColors(act->isChecked());\n setRootIsDecorated(false);\n setItemDelegate(new RegisterDelegate(this, this));\n\n connect(act, SIGNAL(toggled(bool)),\n this, SLOT(setAlternatingRowColorsHelper(bool)));\n}\n\nvoid RegisterWindow::resizeEvent(QResizeEvent *ev)\n{\n QTreeView::resizeEvent(ev);\n}\n\nvoid RegisterWindow::contextMenuEvent(QContextMenuEvent *ev)\n{\n QMenu menu;\n\n const unsigned engineCapabilities = modelData(EngineCapabilitiesRole).toUInt();\n const bool actionsEnabled = modelData(EngineActionsEnabledRole).toInt();\n const int state = modelData(EngineStateRole).toInt();\n\n QAction *actReload = menu.addAction(tr(\"Reload Register Listing\"));\n actReload->setEnabled((engineCapabilities & RegisterCapability)\n && (state == InferiorStopOk || state == InferiorUnrunnable));\n\n menu.addSeparator();\n\n QModelIndex idx = indexAt(ev->pos());\n QString address = modelData(RegisterAddressRole, idx).toString();\n QAction *actShowMemory = menu.addAction(QString());\n if (address.isEmpty()) {\n actShowMemory->setText(tr(\"Open Memory Editor\"));\n actShowMemory->setEnabled(false);\n } else {\n actShowMemory->setText(tr(\"Open Memory Editor at %1\").arg(address));\n actShowMemory->setEnabled(actionsEnabled\n && (engineCapabilities & ShowMemoryCapability));\n }\n menu.addSeparator();\n\n int base = modelData(RegisterNumberBaseRole).toInt();\n QAction *act16 = menu.addAction(tr(\"Hexadecimal\"));\n act16->setCheckable(true);\n act16->setChecked(base == 16);\n QAction *act10 = menu.addAction(tr(\"Decimal\"));\n act10->setCheckable(true);\n act10->setChecked(base == 10);\n QAction *act8 = menu.addAction(tr(\"Octal\"));\n act8->setCheckable(true);\n act8->setChecked(base == 8);\n QAction *act2 = menu.addAction(tr(\"Binary\"));\n act2->setCheckable(true);\n act2->setChecked(base == 2);\n menu.addSeparator();\n\n QAction *actAdjust = menu.addAction(tr(\"Adjust Column Widths to Contents\"));\n QAction *actAlwaysAdjust =\n menu.addAction(tr(\"Always Adjust Column Widths to Contents\"));\n actAlwaysAdjust->setCheckable(true);\n actAlwaysAdjust->setChecked(m_alwaysResizeColumnsToContents);\n menu.addSeparator();\n\n menu.addAction(theDebuggerAction(SettingsDialog));\n\n QAction *act = menu.exec(ev->globalPos());\n\n if (act == actAdjust)\n resizeColumnsToContents();\n else if (act == actAlwaysAdjust)\n setAlwaysResizeColumnsToContents(!m_alwaysResizeColumnsToContents);\n else if (act == actReload)\n setModelData(RequestReloadRegistersRole);\n else if (act == actShowMemory)\n setModelData(RequestShowMemoryRole, address);\n else if (act) {\n base = (act == act10 ? 10 : act == act8 ? 8 : act == act2 ? 2 : 16);\n QMetaObject::invokeMethod(model(), \"setNumberBase\", Q_ARG(int, base));\n }\n}\n\nvoid RegisterWindow::resizeColumnsToContents()\n{\n resizeColumnToContents(0);\n resizeColumnToContents(1);\n}\n\nvoid RegisterWindow::setAlwaysResizeColumnsToContents(bool on)\n{\n m_alwaysResizeColumnsToContents = on;\n QHeaderView::ResizeMode mode = on\n ? QHeaderView::ResizeToContents : QHeaderView::Interactive;\n header()->setResizeMode(0, mode);\n header()->setResizeMode(1, mode);\n}\n\nvoid RegisterWindow::setModel(QAbstractItemModel *model)\n{\n QTreeView::setModel(model);\n setAlwaysResizeColumnsToContents(true);\n}\n\nvoid RegisterWindow::reloadRegisters()\n{\n \/\/ FIXME: Only trigger when becoming visible?\n setModelData(RequestReloadRegistersRole);\n}\n\nvoid RegisterWindow::setModelData\n (int role, const QVariant &value, const QModelIndex &index)\n{\n QTC_ASSERT(model(), return);\n model()->setData(index, value, role);\n}\n\nQVariant RegisterWindow::modelData(int role, const QModelIndex &index)\n{\n QTC_ASSERT(model(), return QVariant());\n return model()->data(index, role);\n}\n\n} \/\/ namespace Internal\n} \/\/ namespace Debugger\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\/\/ Implements C wrappers around the CUDA library for easy linking in ORC jit.\n\/\/ Also adds some debugging helpers that are helpful when writing MLIR code to\n\/\/ run on GPUs.\n\n#include <cassert>\n#include <numeric>\n\n#include \"absl\/container\/flat_hash_map.h\"\n#include \"tensorflow\/core\/platform\/logging.h\"\n#include \"tensorflow\/core\/platform\/mutex.h\"\n\n#if GOOGLE_CUDA\n#include \"third_party\/gpus\/cuda\/include\/cuda.h\"\n\n#define CUDA_REPORT_IF_ERROR(expr) \\\n [](CUresult result) { \\\n if (!result) return; \\\n const char *name = nullptr; \\\n cuGetErrorName(result, &name); \\\n if (!name) name = \"<unknown>\"; \\\n LOG(WARNING) << \"'\" << #expr << \"' failed with '\" << name << \"'\\n\"; \\\n }(expr)\n\nnamespace {\n\/\/ Implements a cache for loading modules and creating streams. The assumption\n\/\/ is that we never unload modules or delete streams again during the lifetime\n\/\/ of a tensorflow runtime process.\nstruct CudaRuntimeCache {\n public:\n CUmodule loadModule(void *data) {\n tensorflow::mutex_lock lock(module_handle_mutex);\n auto it = module_handles.find(data);\n if (it != module_handles.end()) {\n return it->second;\n }\n CUmodule module = nullptr;\n CUDA_REPORT_IF_ERROR(cuModuleLoadData(&module, data));\n module_handles.insert({data, module});\n return module;\n }\n\n CUstream createStream() {\n tensorflow::mutex_lock lock(stream_handle_mutex);\n CUstream stream = nullptr;\n if (stream_handles.empty()) {\n CUDA_REPORT_IF_ERROR(cuStreamCreate(&stream, CU_STREAM_NON_BLOCKING));\n } else {\n stream = stream_handles.back();\n stream_handles.pop_back();\n }\n return stream;\n }\n\n void releaseStream(CUstream stream) {\n tensorflow::mutex_lock lock(stream_handle_mutex);\n stream_handles.push_back(stream);\n }\n\n static CudaRuntimeCache *get() {\n static auto *instance = new CudaRuntimeCache();\n return instance;\n }\n\n private:\n CudaRuntimeCache() = default;\n\n tensorflow::mutex stream_handle_mutex;\n std::vector<CUstream> stream_handles TF_GUARDED_BY(stream_handle_mutex);\n tensorflow::mutex module_handle_mutex;\n absl::flat_hash_map<void *, CUmodule> module_handles\n TF_GUARDED_BY(module_handle_mutex);\n};\n} \/\/ namespace\n\nextern \"C\" CUmodule mgpuModuleLoad(void *data) {\n return CudaRuntimeCache::get()->loadModule(data);\n}\n\nextern \"C\" void mgpuModuleUnload(CUmodule module) {\n \/\/ We never unload modules.\n}\n\nextern \"C\" CUfunction mgpuModuleGetFunction(CUmodule module, const char *name) {\n CUfunction function = nullptr;\n CUDA_REPORT_IF_ERROR(cuModuleGetFunction(&function, module, name));\n return function;\n}\n\n\/\/ The wrapper uses intptr_t instead of CUDA's unsigned int to match\n\/\/ the type of MLIR's index type. This avoids the need for casts in the\n\/\/ generated MLIR code.\nextern \"C\" void mgpuLaunchKernel(CUfunction function, intptr_t gridX,\n intptr_t gridY, intptr_t gridZ,\n intptr_t blockX, intptr_t blockY,\n intptr_t blockZ, int32_t smem, CUstream stream,\n void **params, void **extra) {\n CUDA_REPORT_IF_ERROR(cuLaunchKernel(function, gridX, gridY, gridZ, blockX,\n blockY, blockZ, smem, stream, params,\n extra));\n}\n\nextern \"C\" CUstream mgpuStreamCreate() {\n return CudaRuntimeCache::get()->createStream();\n}\n\nextern \"C\" void mgpuStreamDestroy(CUstream stream) {\n return CudaRuntimeCache::get()->releaseStream(stream);\n}\n\nextern \"C\" void mgpuStreamSynchronize(CUstream stream) {\n CUDA_REPORT_IF_ERROR(cuStreamSynchronize(stream));\n}\n\nextern \"C\" void mgpuStreamWaitEvent(CUstream stream, CUevent event) {\n CUDA_REPORT_IF_ERROR(cuStreamWaitEvent(stream, event, \/*flags=*\/0));\n}\n\nextern \"C\" CUevent mgpuEventCreate() {\n CUevent event = nullptr;\n CUDA_REPORT_IF_ERROR(cuEventCreate(&event, CU_EVENT_DISABLE_TIMING));\n return event;\n}\n\nextern \"C\" void mgpuEventDestroy(CUevent event) {\n CUDA_REPORT_IF_ERROR(cuEventDestroy(event));\n}\n\nextern \"C\" void mgpuEventSynchronize(CUevent event) {\n CUDA_REPORT_IF_ERROR(cuEventSynchronize(event));\n}\n\nextern \"C\" void mgpuEventRecord(CUevent event, CUstream stream) {\n CUDA_REPORT_IF_ERROR(cuEventRecord(event, stream));\n}\n\n#endif\n<commit_msg>Make the runtime cache in the tf cuda runtime wrappers context specific.<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\/\/ Implements C wrappers around the CUDA library for easy linking in ORC jit.\n\/\/ Also adds some debugging helpers that are helpful when writing MLIR code to\n\/\/ run on GPUs.\n\n#include <cassert>\n#include <numeric>\n\n#include \"absl\/container\/flat_hash_map.h\"\n#include \"tensorflow\/core\/platform\/logging.h\"\n#include \"tensorflow\/core\/platform\/mutex.h\"\n\n#if GOOGLE_CUDA\n#include \"third_party\/gpus\/cuda\/include\/cuda.h\"\n\n#define CUDA_REPORT_IF_ERROR(expr) \\\n [](CUresult result) { \\\n if (!result) return; \\\n const char *name = nullptr; \\\n cuGetErrorName(result, &name); \\\n if (!name) name = \"<unknown>\"; \\\n LOG(WARNING) << \"'\" << #expr << \"' failed with '\" << name << \"'\\n\"; \\\n }(expr)\n\nnamespace {\n\/\/ Implements a cache for loading modules and creating streams. The assumption\n\/\/ is that we never unload modules or delete streams again during the lifetime\n\/\/ of a tensorflow runtime process.\nstruct CudaRuntimeCache {\n public:\n CUmodule loadModule(void *data) {\n tensorflow::mutex_lock lock(module_handle_mutex);\n auto &module = module_handles[data];\n if (!module) {\n CUDA_REPORT_IF_ERROR(cuModuleLoadData(&module, data));\n }\n return module;\n }\n\n CUstream createStream() {\n tensorflow::mutex_lock lock(stream_handle_mutex);\n CUstream stream = nullptr;\n if (stream_handles.empty()) {\n CUDA_REPORT_IF_ERROR(cuStreamCreate(&stream, CU_STREAM_NON_BLOCKING));\n } else {\n stream = stream_handles.back();\n stream_handles.pop_back();\n }\n return stream;\n }\n\n void releaseStream(CUstream stream) {\n tensorflow::mutex_lock lock(stream_handle_mutex);\n stream_handles.push_back(stream);\n }\n\n \/\/ Returns the runtime cache for the current context.\n static CudaRuntimeCache *get() {\n using CacheWithLock =\n std::pair<tensorflow::mutex,\n absl::flat_hash_map<CUcontext, CudaRuntimeCache *>>;\n static auto *cache_with_lock = new CacheWithLock();\n tensorflow::mutex_lock lock(cache_with_lock->first);\n CUcontext context;\n CUDA_REPORT_IF_ERROR(cuCtxGetCurrent(&context));\n auto &runtime_cache = cache_with_lock->second[context];\n if (!runtime_cache) {\n runtime_cache = new CudaRuntimeCache();\n }\n return runtime_cache;\n }\n\n private:\n CudaRuntimeCache() = default;\n\n tensorflow::mutex stream_handle_mutex;\n std::vector<CUstream> stream_handles TF_GUARDED_BY(stream_handle_mutex);\n tensorflow::mutex module_handle_mutex;\n absl::flat_hash_map<void *, CUmodule> module_handles\n TF_GUARDED_BY(module_handle_mutex);\n};\n} \/\/ namespace\n\nextern \"C\" CUmodule mgpuModuleLoad(void *data) {\n return CudaRuntimeCache::get()->loadModule(data);\n}\n\nextern \"C\" void mgpuModuleUnload(CUmodule module) {\n \/\/ We never unload modules.\n}\n\nextern \"C\" CUfunction mgpuModuleGetFunction(CUmodule module, const char *name) {\n CUfunction function = nullptr;\n CUDA_REPORT_IF_ERROR(cuModuleGetFunction(&function, module, name));\n return function;\n}\n\n\/\/ The wrapper uses intptr_t instead of CUDA's unsigned int to match\n\/\/ the type of MLIR's index type. This avoids the need for casts in the\n\/\/ generated MLIR code.\nextern \"C\" void mgpuLaunchKernel(CUfunction function, intptr_t gridX,\n intptr_t gridY, intptr_t gridZ,\n intptr_t blockX, intptr_t blockY,\n intptr_t blockZ, int32_t smem, CUstream stream,\n void **params, void **extra) {\n CUDA_REPORT_IF_ERROR(cuLaunchKernel(function, gridX, gridY, gridZ, blockX,\n blockY, blockZ, smem, stream, params,\n extra));\n}\n\nextern \"C\" CUstream mgpuStreamCreate() {\n return CudaRuntimeCache::get()->createStream();\n}\n\nextern \"C\" void mgpuStreamDestroy(CUstream stream) {\n return CudaRuntimeCache::get()->releaseStream(stream);\n}\n\nextern \"C\" void mgpuStreamSynchronize(CUstream stream) {\n CUDA_REPORT_IF_ERROR(cuStreamSynchronize(stream));\n}\n\nextern \"C\" void mgpuStreamWaitEvent(CUstream stream, CUevent event) {\n CUDA_REPORT_IF_ERROR(cuStreamWaitEvent(stream, event, \/*flags=*\/0));\n}\n\nextern \"C\" CUevent mgpuEventCreate() {\n CUevent event = nullptr;\n CUDA_REPORT_IF_ERROR(cuEventCreate(&event, CU_EVENT_DISABLE_TIMING));\n return event;\n}\n\nextern \"C\" void mgpuEventDestroy(CUevent event) {\n CUDA_REPORT_IF_ERROR(cuEventDestroy(event));\n}\n\nextern \"C\" void mgpuEventSynchronize(CUevent event) {\n CUDA_REPORT_IF_ERROR(cuEventSynchronize(event));\n}\n\nextern \"C\" void mgpuEventRecord(CUevent event, CUstream stream) {\n CUDA_REPORT_IF_ERROR(cuEventRecord(event, stream));\n}\n\n#endif\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\n#include \"registerwindow.h\"\n#include \"registerhandler.h\"\n\n#include \"debuggeractions.h\"\n#include \"debuggeragents.h\"\n#include \"debuggerconstants.h\"\n\n#include <utils\/qtcassert.h>\n\n#include <QtCore\/QDebug>\n#include <QtCore\/QDir>\n#include <QtCore\/QFileInfo>\n#include <QtCore\/QFileInfoList>\n\n#include <QtGui\/QAction>\n#include <QtGui\/QHeaderView>\n#include <QtGui\/QItemDelegate>\n#include <QtGui\/QLineEdit>\n#include <QtGui\/QMenu>\n#include <QtGui\/QPainter>\n#include <QtGui\/QResizeEvent>\n#include <QtGui\/QToolButton>\n\n\nnamespace Debugger {\nnamespace Internal {\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\n\/\/ RegisterDelegate\n\/\/\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nclass RegisterDelegate : public QItemDelegate\n{\npublic:\n RegisterDelegate(DebuggerManager *manager, QObject *parent)\n : QItemDelegate(parent), m_manager(manager)\n {}\n\n QWidget *createEditor(QWidget *parent, const QStyleOptionViewItem &,\n const QModelIndex &) const\n {\n QLineEdit *lineEdit = new QLineEdit(parent);\n lineEdit->setAlignment(Qt::AlignRight);\n return lineEdit;\n }\n\n void setEditorData(QWidget *editor, const QModelIndex &index) const\n {\n QLineEdit *lineEdit = qobject_cast<QLineEdit *>(editor);\n QTC_ASSERT(lineEdit, return);\n lineEdit->setText(index.model()->data(index, Qt::DisplayRole).toString());\n }\n\n void setModelData(QWidget *editor, QAbstractItemModel *model,\n const QModelIndex &index) const\n {\n Q_UNUSED(model);\n \/\/qDebug() << \"SET MODEL DATA\";\n QLineEdit *lineEdit = qobject_cast<QLineEdit*>(editor);\n QTC_ASSERT(lineEdit, return);\n QString value = lineEdit->text();\n \/\/model->setData(index, value, Qt::EditRole);\n if (index.column() == 1)\n m_manager->setRegisterValue(index.row(), value);\n }\n\n void updateEditorGeometry(QWidget *editor, const QStyleOptionViewItem &option,\n const QModelIndex &) const\n {\n editor->setGeometry(option.rect);\n }\n\n void paint(QPainter *painter, const QStyleOptionViewItem &option,\n const QModelIndex &index) const\n {\n if (index.column() == 1) {\n \/\/ FIXME: performance? this changes only on real font changes.\n QFontMetrics fm(option.font);\n int charWidth = fm.width(QLatin1Char('x'));\n for (int i = '1'; i <= '9'; ++i)\n charWidth = qMax(charWidth, fm.width(QLatin1Char(i)));\n for (int i = 'a'; i <= 'f'; ++i)\n charWidth = qMax(charWidth, fm.width(QLatin1Char(i)));\n QString str = index.model()->data(index, Qt::DisplayRole).toString();\n int x = option.rect.x();\n for (int i = 0; i < str.size(); ++i) {\n QRect r = option.rect;\n r.setX(x);\n r.setWidth(charWidth);\n x += charWidth;\n painter->drawText(r, Qt::AlignHCenter, QString(str.at(i)));\n }\n } else {\n QItemDelegate::paint(painter, option, index);\n }\n }\n\nprivate:\n DebuggerManager *m_manager;\n};\n\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\n\/\/ RegisterWindow\n\/\/\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nRegisterWindow::RegisterWindow(DebuggerManager *manager)\n : m_manager(manager), m_alwaysResizeColumnsToContents(true),\n m_alwaysReloadContents(false)\n{\n QAction *act = theDebuggerAction(UseAlternatingRowColors);\n setWindowTitle(tr(\"Registers\"));\n setSortingEnabled(true);\n setAlternatingRowColors(act->isChecked());\n setRootIsDecorated(false);\n setItemDelegate(new RegisterDelegate(m_manager, this));\n\n connect(act, SIGNAL(toggled(bool)),\n this, SLOT(setAlternatingRowColorsHelper(bool)));\n}\n\nvoid RegisterWindow::resizeEvent(QResizeEvent *ev)\n{\n QTreeView::resizeEvent(ev);\n}\n\nvoid RegisterWindow::contextMenuEvent(QContextMenuEvent *ev)\n{\n QMenu menu;\n\n QAction *actReload = menu.addAction(tr(\"Reload register listing\"));\n QAction *actAlwaysReload = menu.addAction(tr(\"Always reload register listing\"));\n actAlwaysReload->setCheckable(true);\n actAlwaysReload->setChecked(m_alwaysReloadContents);\n menu.addSeparator();\n\n QModelIndex idx = indexAt(ev->pos());\n QString address = model()->data(idx, RegisterAddressRole).toString();\n QAction *actShowMemory = menu.addAction(QString());\n if (address.isEmpty()) {\n actShowMemory->setText(tr(\"Open memory editor\"));\n actShowMemory->setEnabled(false);\n } else {\n actShowMemory->setText(tr(\"Open memory editor at %1\").arg(address));\n }\n menu.addSeparator();\n\n int base = model()->data(QModelIndex(), RegisterNumberBaseRole).toInt();\n QAction *act16 = menu.addAction(tr(\"Hexadecimal\"));\n act16->setCheckable(true);\n act16->setChecked(base == 16);\n QAction *act10 = menu.addAction(tr(\"Decimal\"));\n act10->setCheckable(true);\n act10->setChecked(base == 10);\n QAction *act8 = menu.addAction(tr(\"Octal\"));\n act8->setCheckable(true);\n act8->setChecked(base == 8);\n QAction *act2 = menu.addAction(tr(\"Binary\"));\n act2->setCheckable(true);\n act2->setChecked(base == 2);\n menu.addSeparator();\n\n QAction *actAdjust = menu.addAction(tr(\"Adjust column widths to contents\"));\n QAction *actAlwaysAdjust =\n menu.addAction(tr(\"Always adjust column widths to contents\"));\n actAlwaysAdjust->setCheckable(true);\n actAlwaysAdjust->setChecked(m_alwaysResizeColumnsToContents);\n menu.addSeparator();\n\n menu.addAction(theDebuggerAction(SettingsDialog));\n\n QAction *act = menu.exec(ev->globalPos());\n \n if (act == actAdjust)\n resizeColumnsToContents();\n else if (act == actAlwaysAdjust)\n setAlwaysResizeColumnsToContents(!m_alwaysResizeColumnsToContents);\n else if (act == actReload)\n reloadContents();\n else if (act == actAlwaysReload)\n setAlwaysReloadContents(!m_alwaysReloadContents);\n else if (act == actShowMemory)\n (void) new MemoryViewAgent(m_manager, address);\n else if (act) {\n base = (act == act10 ? 10 : act == act8 ? 8 : act == act2 ? 2 : 16);\n QMetaObject::invokeMethod(model(), \"setNumberBase\", Q_ARG(int, base));\n }\n}\n\nvoid RegisterWindow::resizeColumnsToContents()\n{\n resizeColumnToContents(0);\n resizeColumnToContents(1);\n}\n\nvoid RegisterWindow::setAlwaysResizeColumnsToContents(bool on)\n{\n m_alwaysResizeColumnsToContents = on;\n QHeaderView::ResizeMode mode = on\n ? QHeaderView::ResizeToContents : QHeaderView::Interactive;\n header()->setResizeMode(0, mode);\n header()->setResizeMode(1, mode);\n}\n\nvoid RegisterWindow::setAlwaysReloadContents(bool on)\n{\n m_alwaysReloadContents = on;\n if (m_alwaysReloadContents)\n reloadContents();\n}\n\nvoid RegisterWindow::reloadContents()\n{\n emit reloadRegisterRequested();\n}\n\n\nvoid RegisterWindow::setModel(QAbstractItemModel *model)\n{\n QTreeView::setModel(model);\n setAlwaysResizeColumnsToContents(true);\n}\n\n} \/\/ namespace Internal\n} \/\/ namespace Debugger\n<commit_msg>debugger: disable sorting of registers<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\n#include \"registerwindow.h\"\n#include \"registerhandler.h\"\n\n#include \"debuggeractions.h\"\n#include \"debuggeragents.h\"\n#include \"debuggerconstants.h\"\n\n#include <utils\/qtcassert.h>\n\n#include <QtCore\/QDebug>\n#include <QtCore\/QDir>\n#include <QtCore\/QFileInfo>\n#include <QtCore\/QFileInfoList>\n\n#include <QtGui\/QAction>\n#include <QtGui\/QHeaderView>\n#include <QtGui\/QItemDelegate>\n#include <QtGui\/QLineEdit>\n#include <QtGui\/QMenu>\n#include <QtGui\/QPainter>\n#include <QtGui\/QResizeEvent>\n#include <QtGui\/QToolButton>\n\n\nnamespace Debugger {\nnamespace Internal {\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\n\/\/ RegisterDelegate\n\/\/\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nclass RegisterDelegate : public QItemDelegate\n{\npublic:\n RegisterDelegate(DebuggerManager *manager, QObject *parent)\n : QItemDelegate(parent), m_manager(manager)\n {}\n\n QWidget *createEditor(QWidget *parent, const QStyleOptionViewItem &,\n const QModelIndex &) const\n {\n QLineEdit *lineEdit = new QLineEdit(parent);\n lineEdit->setAlignment(Qt::AlignRight);\n return lineEdit;\n }\n\n void setEditorData(QWidget *editor, const QModelIndex &index) const\n {\n QLineEdit *lineEdit = qobject_cast<QLineEdit *>(editor);\n QTC_ASSERT(lineEdit, return);\n lineEdit->setText(index.model()->data(index, Qt::DisplayRole).toString());\n }\n\n void setModelData(QWidget *editor, QAbstractItemModel *model,\n const QModelIndex &index) const\n {\n Q_UNUSED(model);\n \/\/qDebug() << \"SET MODEL DATA\";\n QLineEdit *lineEdit = qobject_cast<QLineEdit*>(editor);\n QTC_ASSERT(lineEdit, return);\n QString value = lineEdit->text();\n \/\/model->setData(index, value, Qt::EditRole);\n if (index.column() == 1)\n m_manager->setRegisterValue(index.row(), value);\n }\n\n void updateEditorGeometry(QWidget *editor, const QStyleOptionViewItem &option,\n const QModelIndex &) const\n {\n editor->setGeometry(option.rect);\n }\n\n void paint(QPainter *painter, const QStyleOptionViewItem &option,\n const QModelIndex &index) const\n {\n if (index.column() == 1) {\n \/\/ FIXME: performance? this changes only on real font changes.\n QFontMetrics fm(option.font);\n int charWidth = fm.width(QLatin1Char('x'));\n for (int i = '1'; i <= '9'; ++i)\n charWidth = qMax(charWidth, fm.width(QLatin1Char(i)));\n for (int i = 'a'; i <= 'f'; ++i)\n charWidth = qMax(charWidth, fm.width(QLatin1Char(i)));\n QString str = index.model()->data(index, Qt::DisplayRole).toString();\n int x = option.rect.x();\n for (int i = 0; i < str.size(); ++i) {\n QRect r = option.rect;\n r.setX(x);\n r.setWidth(charWidth);\n x += charWidth;\n painter->drawText(r, Qt::AlignHCenter, QString(str.at(i)));\n }\n } else {\n QItemDelegate::paint(painter, option, index);\n }\n }\n\nprivate:\n DebuggerManager *m_manager;\n};\n\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\n\/\/ RegisterWindow\n\/\/\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nRegisterWindow::RegisterWindow(DebuggerManager *manager)\n : m_manager(manager), m_alwaysResizeColumnsToContents(true),\n m_alwaysReloadContents(false)\n{\n QAction *act = theDebuggerAction(UseAlternatingRowColors);\n setWindowTitle(tr(\"Registers\"));\n setAlternatingRowColors(act->isChecked());\n setRootIsDecorated(false);\n setItemDelegate(new RegisterDelegate(m_manager, this));\n\n connect(act, SIGNAL(toggled(bool)),\n this, SLOT(setAlternatingRowColorsHelper(bool)));\n}\n\nvoid RegisterWindow::resizeEvent(QResizeEvent *ev)\n{\n QTreeView::resizeEvent(ev);\n}\n\nvoid RegisterWindow::contextMenuEvent(QContextMenuEvent *ev)\n{\n QMenu menu;\n\n QAction *actReload = menu.addAction(tr(\"Reload register listing\"));\n QAction *actAlwaysReload = menu.addAction(tr(\"Always reload register listing\"));\n actAlwaysReload->setCheckable(true);\n actAlwaysReload->setChecked(m_alwaysReloadContents);\n menu.addSeparator();\n\n QModelIndex idx = indexAt(ev->pos());\n QString address = model()->data(idx, RegisterAddressRole).toString();\n QAction *actShowMemory = menu.addAction(QString());\n if (address.isEmpty()) {\n actShowMemory->setText(tr(\"Open memory editor\"));\n actShowMemory->setEnabled(false);\n } else {\n actShowMemory->setText(tr(\"Open memory editor at %1\").arg(address));\n }\n menu.addSeparator();\n\n int base = model()->data(QModelIndex(), RegisterNumberBaseRole).toInt();\n QAction *act16 = menu.addAction(tr(\"Hexadecimal\"));\n act16->setCheckable(true);\n act16->setChecked(base == 16);\n QAction *act10 = menu.addAction(tr(\"Decimal\"));\n act10->setCheckable(true);\n act10->setChecked(base == 10);\n QAction *act8 = menu.addAction(tr(\"Octal\"));\n act8->setCheckable(true);\n act8->setChecked(base == 8);\n QAction *act2 = menu.addAction(tr(\"Binary\"));\n act2->setCheckable(true);\n act2->setChecked(base == 2);\n menu.addSeparator();\n\n QAction *actAdjust = menu.addAction(tr(\"Adjust column widths to contents\"));\n QAction *actAlwaysAdjust =\n menu.addAction(tr(\"Always adjust column widths to contents\"));\n actAlwaysAdjust->setCheckable(true);\n actAlwaysAdjust->setChecked(m_alwaysResizeColumnsToContents);\n menu.addSeparator();\n\n menu.addAction(theDebuggerAction(SettingsDialog));\n\n QAction *act = menu.exec(ev->globalPos());\n \n if (act == actAdjust)\n resizeColumnsToContents();\n else if (act == actAlwaysAdjust)\n setAlwaysResizeColumnsToContents(!m_alwaysResizeColumnsToContents);\n else if (act == actReload)\n reloadContents();\n else if (act == actAlwaysReload)\n setAlwaysReloadContents(!m_alwaysReloadContents);\n else if (act == actShowMemory)\n (void) new MemoryViewAgent(m_manager, address);\n else if (act) {\n base = (act == act10 ? 10 : act == act8 ? 8 : act == act2 ? 2 : 16);\n QMetaObject::invokeMethod(model(), \"setNumberBase\", Q_ARG(int, base));\n }\n}\n\nvoid RegisterWindow::resizeColumnsToContents()\n{\n resizeColumnToContents(0);\n resizeColumnToContents(1);\n}\n\nvoid RegisterWindow::setAlwaysResizeColumnsToContents(bool on)\n{\n m_alwaysResizeColumnsToContents = on;\n QHeaderView::ResizeMode mode = on\n ? QHeaderView::ResizeToContents : QHeaderView::Interactive;\n header()->setResizeMode(0, mode);\n header()->setResizeMode(1, mode);\n}\n\nvoid RegisterWindow::setAlwaysReloadContents(bool on)\n{\n m_alwaysReloadContents = on;\n if (m_alwaysReloadContents)\n reloadContents();\n}\n\nvoid RegisterWindow::reloadContents()\n{\n emit reloadRegisterRequested();\n}\n\n\nvoid RegisterWindow::setModel(QAbstractItemModel *model)\n{\n QTreeView::setModel(model);\n setAlwaysResizeColumnsToContents(true);\n}\n\n} \/\/ namespace Internal\n} \/\/ namespace Debugger\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 \"uri_capture.h\"\n#include \"uc_configuration.h\"\n#include \"db_uri_record.h\"\n#include \"seeks_proxy.h\" \/\/ for user_db.\n#include \"user_db.h\"\n#include \"proxy_dts.h\"\n#include \"urlmatch.h\"\n#include \"miscutil.h\"\n#include \"errlog.h\"\n\n#include <sys\/time.h>\n#include <sys\/stat.h>\n\n#include <algorithm>\n#include <iterator>\n#include <iostream>\n\nusing sp::seeks_proxy;\nusing sp::user_db;\nusing sp::db_record;\nusing sp::urlmatch;\nusing sp::miscutil;\nusing sp::errlog;\n\nnamespace seeks_plugins\n{\n \n \/*- uri_db_sweepable -*\/\n uri_db_sweepable::uri_db_sweepable()\n :user_db_sweepable()\n {\n\t \/\/ set last sweep to now.\n\t \/\/ sweeping is done when plugin starts.\n\t struct timeval tv_now;\n\t gettimeofday(&tv_now,NULL);\n\t _last_sweep = tv_now.tv_sec;\n }\n \n uri_db_sweepable::~uri_db_sweepable()\n {\n }\n \n bool uri_db_sweepable::sweep_me()\n {\n\tstruct timeval tv_now;\n\tgettimeofday(&tv_now,NULL);\n\tif ((tv_now.tv_sec - _last_sweep) \n\t > uc_configuration::_config->_sweep_cycle)\n\t return true;\n\telse return false;\n }\n \n int uri_db_sweepable::sweep_records()\n {\n\tstruct timeval tv_now;\n\tgettimeofday(&tv_now,NULL);\n\ttime_t sweep_date = tv_now.tv_sec - uc_configuration::_config->_retention;\n\tseeks_proxy::_user_db->prune_db(\"uri-capture\",sweep_date);\n }\n \n \/*- uri_capture -*\/\n uri_capture::uri_capture()\n : plugin(),_nr(0)\n {\n\t _name = \"uri-capture\";\n\t _version_major = \"0\";\n\t _version_minor = \"1\";\n\t _configuration = NULL;\n\t _interceptor_plugin = new uri_capture_element(this);\n \n\t if (seeks_proxy::_datadir.empty())\n\t _config_filename = plugin_manager::_plugin_repository + \"uri_capture\/uri-capture-config\";\n\t else\n\t _config_filename = seeks_proxy::_datadir + \"\/plugins\/uri_capture\/uri-capture-config\";\n \n#ifdef SEEKS_CONFIGDIR\n\t struct stat stFileInfo;\n\t if (!stat(_config_filename.c_str(), &stFileInfo) == 0)\n\t {\n\t _config_filename = SEEKS_CONFIGDIR \"\/uri-capture-config\";\n\t }\n#endif\n\t \n\t if (uc_configuration::_config == NULL)\n\t uc_configuration::_config = new uc_configuration(_config_filename);\n\t _configuration = uc_configuration::_config;\n }\n \n uri_capture::~uri_capture()\n {\n }\n \n void uri_capture::start()\n {\n\t\/\/ check for user db.\n\tif (!seeks_proxy::_user_db || !seeks_proxy::_user_db->_opened)\n\t {\n\t errlog::log_error(LOG_LEVEL_ERROR,\"user db is not opened for URI capture plugin to work with it\");\n\t }\n\t\n\t\/\/ preventive sweep of records.\n\tstatic_cast<uri_capture_element*>(_interceptor_plugin)->_uds.sweep_records();\n\t\n\t\/\/ get number of captured URI already in user_db.\n\t_nr = seeks_proxy::_user_db->number_records(_name);\n \n\terrlog::log_error(LOG_LEVEL_INFO,\"uri_capture plugin: %u records\",_nr);\n }\n \n void uri_capture::stop()\n {\n }\n\n sp::db_record* uri_capture::create_db_record()\n {\n\treturn new db_uri_record();\n }\n\n int uri_capture::remove_all_uri_records()\n {\n\tseeks_proxy::_user_db->prune_db(_name);\n }\n \n \/*- uri_capture_element -*\/\n std::string uri_capture_element::_capt_filename = \"uri_capture\/uri-patterns\";\n hash_map<const char*,bool,hash<const char*>,eqstr> uri_capture_element::_img_ext_list;\n std::string uri_capture_element::_cgi_site_host = CGI_SITE_1_HOST;\n \n uri_capture_element::uri_capture_element(plugin *parent)\n : interceptor_plugin((seeks_proxy::_datadir.empty() ? std::string(plugin_manager::_plugin_repository\n\t\t\t\t\t\t\t\t + uri_capture_element::_capt_filename).c_str()\n\t\t\t : std::string(seeks_proxy::_datadir + \"\/plugins\/\" + uri_capture_element::_capt_filename).c_str()),\n\t\t\t parent)\n {\n\t uri_capture_element::init_file_ext_list();\n\t seeks_proxy::_user_db->register_sweeper(&_uds);\n }\n \n uri_capture_element::~uri_capture_element()\n {\n }\n \n http_response* uri_capture_element::plugin_response(client_state *csp)\n {\n\t\/\/ store domain names.\n\t\/* std::cerr << \"[uri_capture]: headers:\\n\";\n\tstd::copy(csp->_headers.begin(),csp->_headers.end(),\n\t\t std::ostream_iterator<const char*>(std::cout,\"\\n\"));\n\tstd::cerr << std::endl; *\/\n\t\n\tstd::string host, referer, accept, get;\n\tbool connect = false;\n\turi_capture_element::get_useful_headers(csp->_headers,\n\t\t\t\t\t\thost,referer,\n\t\t\t\t\t\taccept,get,connect);\n\t\n\t\/**\n\t * URI domain name is store in two cases:\n\t * - there is no referer in the HTTP request headers.\n\t * - the host domain is different than the referer, indicating a move\n\t * to a different website.\n\t * \n\t * We do not record:\n\t * - 'CONNECT' requests.\n\t * - paths to images.\n\t * - TODO: calls to search engines.\n\t *\/\n\tstd::string uri;\n\t\n\tbool store = true;\n\tif (connect)\n\t {\n\t store = false;\n\t }\n\telse if (store)\n\t {\n\t size_t p = accept.find(\"image\");\n\t if (p!=std::string::npos)\n\t store = false;\t\t \n\t else\n\t {\n\t\t p = miscutil::replace_in_string(get,\" HTTP\/1.1\",\"\");\n\t\t if (p == 0)\n\t\t miscutil::replace_in_string(get,\" HTTP\/1.0\",\"\");\n\t\t if (uri_capture_element::is_path_to_no_page(get))\n\t\t store = false;\n\t }\n\t }\n\thost = urlmatch::strip_url(host);\n\tstd::transform(host.begin(),host.end(),host.begin(),tolower);\n\tstd::transform(get.begin(),get.end(),get.begin(),tolower);\n\t\n\t\/\/std::cerr << \"****************** host: \" << host << \" -- ref_host: \" << ref_host << std::endl;\n\t\/\/std::cerr << \"cgi host: \" << uri_capture_element::_cgi_site_host << std::endl;\n\tif (host == uri_capture_element::_cgi_site_host) \/\/ if proxy domain.\n\t store = false;\n\t\t\n\tif (store && referer.empty())\n\t {\n\t \/\/std::cerr << \"****************** no referer!\\n\";\n\t if (get != \"\/\")\n\t uri = host + get;\n\t }\n\telse if (store)\n\t {\n\t std::string ref_host, ref_path;\n\t urlmatch::parse_url_host_and_path(referer,ref_host,ref_path);\n\t ref_host = urlmatch::strip_url(ref_host);\n\t \n\t if (get != \"\/\")\n\t uri = host + get;\n\t }\n\t\n\t\/\/std::cerr << \"-----------------> store: \" << store << std::endl;\n\t\/\/std::cerr << std::endl;\n\n\tif (store)\n\t {\n\t \/\/ add record to user db.\n\t db_uri_record dbur(_parent->get_name());\n\t if (!uri.empty())\n\t {\n\t\t \/\/TODO: uri cleaning ?\n\t\t \n\t\t std::cerr << \"adding URI: \" << uri << std::endl;\n\t\t seeks_proxy::_user_db->add_dbr(uri,dbur);\n\t\t static_cast<uri_capture*>(_parent)->_nr++;\n\t }\n\t if (!host.empty() && uri != host)\n\t {\n\t\t std::cerr << \"adding HOST: \" << host << std::endl;\n\t\t seeks_proxy::_user_db->add_dbr(host,dbur);\n\t\t static_cast<uri_capture*>(_parent)->_nr++;\n\t }\n\t }\n\t\n\treturn NULL; \/\/ no response, so the proxy does not crunch this HTTP request.\n }\n \n void uri_capture_element::get_useful_headers(const std::list<const char*> &headers,\n\t\t\t\t\t\tstd::string &host, std::string &referer,\n\t\t\t\t\t\tstd::string &accept, std::string &get,\n\t\t\t\t\t\tbool &connect)\n {\n\tstd::list<const char*>::const_iterator lit = headers.begin();\n\twhile(lit!=headers.end())\n\t {\n\t if (miscutil::strncmpic((*lit),\"get \",4) == 0)\n\t {\n\t\t get = (*lit);\n\t\t get = get.substr(4);\n\t }\n\t else if (miscutil::strncmpic((*lit),\"host:\",5) == 0)\n\t {\n\t\t host = (*lit);\n\t\t host = host.substr(6);\n\t }\n\t else if (miscutil::strncmpic((*lit),\"referer:\",8) == 0)\n\t {\n\t\t referer = (*lit);\n\t\t referer = referer.substr(9);\n\t }\n\t else if (miscutil::strncmpic((*lit),\"accept:\",7) == 0)\n\t {\n\t\t accept = (*lit);\n\t\t accept = accept.substr(8);\n\t }\n\t else if (miscutil::strncmpic((*lit),\"connect \",8) == 0) \/\/ XXX: could grab GET and negate the test.\n\t connect = true;\n\t ++lit;\n\t }\n }\n \n void uri_capture_element::init_file_ext_list()\n {\n\tstatic std::string ext_list[32]\n\t = { \"jpg\",\"jpeg\",\"raw\",\"png\",\"gif\",\"bmp\",\"ppm\",\"pgm\",\"pbm\",\"pnm\",\"tga\",\"pcx\",\n\t \"ecw\",\"img\",\"sid\",\"pgf\",\"cgm\",\"svg\",\"eps\",\"odg\",\"pdf\",\"pgml\",\"swf\",\n\t \"vml\",\"wmf\",\"emf\",\"xps\",\"ico\",\"css\",\"js\",\"xml\",\"pl\"};\n\t\n\tif (!uri_capture_element::_img_ext_list.empty())\n\t return;\n\t\n\tfor (int i=0;i<32;i++)\n\t uri_capture_element::_img_ext_list.insert(std::pair<const char*,bool>(strdup(ext_list[i].c_str()),true)); \n }\n \n bool uri_capture_element::is_path_to_no_page(const std::string &path)\n {\n\tsize_t pos = path.find_last_of(\".\");\n\tif (pos == std::string::npos || path.size() < pos+1)\n\t return false;\n\tstd::string ext = path.substr(pos+1);\n\thash_map<const char*,bool,hash<const char*>,eqstr>::const_iterator hit;\n\tif ((hit=uri_capture_element::_img_ext_list.find(ext.c_str()))!=uri_capture_element::_img_ext_list.end())\n\t return true;\n\treturn false;\n }\n \n \/* auto-registration *\/\n#if defined(ON_OPENBSD) || defined(ON_OSX)\n extern \"C\"\n {\n\tplugin* maker()\n\t {\n\t return new uri_capture;\n\t }\n }\n#else \n plugin* makeruc()\n {\n\treturn new uri_capture;\n }\n \n class proxy_autor_capture\n {\n public:\n\tproxy_autor_capture()\n\t {\n\t plugin_manager::_factory[\"uri-capture\"] = makeruc; \/\/ beware: default plugin shell with no name.\n\t }\n };\n \n proxy_autor_capture _p; \/\/ one instance, instanciated when dl-opening.\n#endif\n \n} \/* end of namespace. *\/\n<commit_msg>fixed sweeping call when user db does not exist and tiny refactoring of URI capture fcts<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 \"uri_capture.h\"\n#include \"uc_configuration.h\"\n#include \"db_uri_record.h\"\n#include \"seeks_proxy.h\" \/\/ for user_db.\n#include \"user_db.h\"\n#include \"proxy_dts.h\"\n#include \"urlmatch.h\"\n#include \"miscutil.h\"\n#include \"errlog.h\"\n\n#include <sys\/time.h>\n#include <sys\/stat.h>\n\n#include <algorithm>\n#include <iterator>\n#include <iostream>\n\nusing sp::seeks_proxy;\nusing sp::user_db;\nusing sp::db_record;\nusing sp::urlmatch;\nusing sp::miscutil;\nusing sp::errlog;\n\nnamespace seeks_plugins\n{\n \n \/*- uri_db_sweepable -*\/\n uri_db_sweepable::uri_db_sweepable()\n :user_db_sweepable()\n {\n\t \/\/ set last sweep to now.\n\t \/\/ sweeping is done when plugin starts.\n\t struct timeval tv_now;\n\t gettimeofday(&tv_now,NULL);\n\t _last_sweep = tv_now.tv_sec;\n }\n \n uri_db_sweepable::~uri_db_sweepable()\n {\n }\n \n bool uri_db_sweepable::sweep_me()\n {\n\tstruct timeval tv_now;\n\tgettimeofday(&tv_now,NULL);\n\tif ((tv_now.tv_sec - _last_sweep) \n\t > uc_configuration::_config->_sweep_cycle)\n\t return true;\n\telse return false;\n }\n \n int uri_db_sweepable::sweep_records()\n {\n\tstruct timeval tv_now;\n\tgettimeofday(&tv_now,NULL);\n\ttime_t sweep_date = tv_now.tv_sec - uc_configuration::_config->_retention;\n\tseeks_proxy::_user_db->prune_db(\"uri-capture\",sweep_date);\n }\n \n \/*- uri_capture -*\/\n uri_capture::uri_capture()\n : plugin(),_nr(0)\n {\n\t _name = \"uri-capture\";\n\t _version_major = \"0\";\n\t _version_minor = \"1\";\n\t _configuration = NULL;\n\t _interceptor_plugin = new uri_capture_element(this);\n \n\t if (seeks_proxy::_datadir.empty())\n\t _config_filename = plugin_manager::_plugin_repository + \"uri_capture\/uri-capture-config\";\n\t else\n\t _config_filename = seeks_proxy::_datadir + \"\/plugins\/uri_capture\/uri-capture-config\";\n \n#ifdef SEEKS_CONFIGDIR\n\t struct stat stFileInfo;\n\t if (!stat(_config_filename.c_str(), &stFileInfo) == 0)\n\t {\n\t _config_filename = SEEKS_CONFIGDIR \"\/uri-capture-config\";\n\t }\n#endif\n\t \n\t if (uc_configuration::_config == NULL)\n\t uc_configuration::_config = new uc_configuration(_config_filename);\n\t _configuration = uc_configuration::_config;\n }\n \n uri_capture::~uri_capture()\n {\n }\n \n void uri_capture::start()\n {\n\t\/\/ check for user db.\n\tif (!seeks_proxy::_user_db || !seeks_proxy::_user_db->_opened)\n\t {\n\t errlog::log_error(LOG_LEVEL_ERROR,\"user db is not opened for URI capture plugin to work with it\");\n\t }\n\telse\n\t {\n\t \/\/ preventive sweep of records.\n\t static_cast<uri_capture_element*>(_interceptor_plugin)->_uds.sweep_records();\n\t \n\t \/\/ get number of captured URI already in user_db.\n\t _nr = seeks_proxy::_user_db->number_records(_name);\n\t \n\t errlog::log_error(LOG_LEVEL_INFO,\"uri_capture plugin: %u records\",_nr);\n\t }\n }\n \n void uri_capture::stop()\n {\n }\n\n sp::db_record* uri_capture::create_db_record()\n {\n\treturn new db_uri_record();\n }\n\n int uri_capture::remove_all_uri_records()\n {\n\tseeks_proxy::_user_db->prune_db(_name);\n }\n \n \/*- uri_capture_element -*\/\n std::string uri_capture_element::_capt_filename = \"uri_capture\/uri-patterns\";\n hash_map<const char*,bool,hash<const char*>,eqstr> uri_capture_element::_img_ext_list;\n std::string uri_capture_element::_cgi_site_host = CGI_SITE_1_HOST;\n \n uri_capture_element::uri_capture_element(plugin *parent)\n : interceptor_plugin((seeks_proxy::_datadir.empty() ? std::string(plugin_manager::_plugin_repository\n\t\t\t\t\t\t\t\t + uri_capture_element::_capt_filename).c_str()\n\t\t\t : std::string(seeks_proxy::_datadir + \"\/plugins\/\" + uri_capture_element::_capt_filename).c_str()),\n\t\t\t parent)\n {\n\t uri_capture_element::init_file_ext_list();\n\t if (seeks_proxy::_user_db)\n\t seeks_proxy::_user_db->register_sweeper(&_uds);\n }\n \n uri_capture_element::~uri_capture_element()\n {\n }\n \n http_response* uri_capture_element::plugin_response(client_state *csp)\n {\n\t\/\/ store domain names.\n\t\/* std::cerr << \"[uri_capture]: headers:\\n\";\n\tstd::copy(csp->_headers.begin(),csp->_headers.end(),\n\t\t std::ostream_iterator<const char*>(std::cout,\"\\n\"));\n\tstd::cerr << std::endl; *\/\n\t\n\tstd::string host, referer, accept, get;\n\tbool connect = false;\n\turi_capture_element::get_useful_headers(csp->_headers,\n\t\t\t\t\t\thost,referer,\n\t\t\t\t\t\taccept,get,connect);\n\t\n\t\/**\n\t * URI domain name is store in two cases:\n\t * - there is no referer in the HTTP request headers.\n\t * - the host domain is different than the referer, indicating a move\n\t * to a different website.\n\t * \n\t * We do not record:\n\t * - 'CONNECT' requests.\n\t * - paths to images.\n\t * - TODO: calls to search engines.\n\t *\/\n\tstd::string uri;\n\t\n\tbool store = true;\n\tif (connect)\n\t {\n\t store = false;\n\t }\n\telse if (store)\n\t {\n\t size_t p = accept.find(\"image\");\n\t if (p!=std::string::npos)\n\t store = false;\t\t \n\t else\n\t {\n\t\t p = miscutil::replace_in_string(get,\" HTTP\/1.1\",\"\");\n\t\t if (p == 0)\n\t\t miscutil::replace_in_string(get,\" HTTP\/1.0\",\"\");\n\t\t if (uri_capture_element::is_path_to_no_page(get))\n\t\t store = false;\n\t }\n\t }\n\thost = uri_capture_element::prepare_uri(host);\n\tstd::transform(get.begin(),get.end(),get.begin(),tolower);\n\t\n\t\/\/std::cerr << \"****************** host: \" << host << \" -- ref_host: \" << ref_host << std::endl;\n\t\/\/std::cerr << \"cgi host: \" << uri_capture_element::_cgi_site_host << std::endl;\n\tif (host == uri_capture_element::_cgi_site_host) \/\/ if proxy domain.\n\t store = false;\n\t\t\n\tif (store && referer.empty())\n\t {\n\t \/\/std::cerr << \"****************** no referer!\\n\";\n\t if (get != \"\/\")\n\t uri = host + get;\n\t }\n\telse if (store)\n\t {\n\t if (get != \"\/\")\n\t uri = host + get;\n\t }\n\t\n\t\/\/std::cerr << \"-----------------> store: \" << store << std::endl;\n\t\/\/std::cerr << std::endl;\n\n\tif (store)\n\t {\n\t store_uri(uri,host);\n\t }\n\t\n\treturn NULL; \/\/ no response, so the proxy does not crunch this HTTP request.\n }\n\n void uri_capture_element::store_uri(const std::string &uri, const std::string &host) const\n {\n\t\/\/ add record to user db.\n\tdb_uri_record dbur(_parent->get_name());\n\tif (!uri.empty())\n\t {\n\t \/\/TODO: uri cleaning ?\n\t std::cerr << \"adding URI: \" << uri << std::endl;\n\t seeks_proxy::_user_db->add_dbr(uri,dbur);\n\t static_cast<uri_capture*>(_parent)->_nr++;\n\t }\n\tif (!host.empty() && uri != host)\n\t {\n\t std::cerr << \"adding HOST: \" << host << std::endl;\n\t seeks_proxy::_user_db->add_dbr(host,dbur);\n\t static_cast<uri_capture*>(_parent)->_nr++;\n\t }\n }\n \n std::string uri_capture_element::prepare_uri(const std::string &uri)\n {\n\tstd::string prep_uri = urlmatch::strip_url(uri);\n\tstd::transform(prep_uri.begin(),prep_uri.end(),prep_uri.begin(),tolower);\n\treturn prep_uri;\n }\n \n void uri_capture_element::get_useful_headers(const std::list<const char*> &headers,\n\t\t\t\t\t\tstd::string &host, std::string &referer,\n\t\t\t\t\t\tstd::string &accept, std::string &get,\n\t\t\t\t\t\tbool &connect)\n {\n\tstd::list<const char*>::const_iterator lit = headers.begin();\n\twhile(lit!=headers.end())\n\t {\n\t if (miscutil::strncmpic((*lit),\"get \",4) == 0)\n\t {\n\t\t get = (*lit);\n\t\t get = get.substr(4);\n\t }\n\t else if (miscutil::strncmpic((*lit),\"host:\",5) == 0)\n\t {\n\t\t host = (*lit);\n\t\t host = host.substr(6);\n\t }\n\t else if (miscutil::strncmpic((*lit),\"referer:\",8) == 0)\n\t {\n\t\t referer = (*lit);\n\t\t referer = referer.substr(9);\n\t }\n\t else if (miscutil::strncmpic((*lit),\"accept:\",7) == 0)\n\t {\n\t\t accept = (*lit);\n\t\t accept = accept.substr(8);\n\t }\n\t else if (miscutil::strncmpic((*lit),\"connect \",8) == 0) \/\/ XXX: could grab GET and negate the test.\n\t connect = true;\n\t ++lit;\n\t }\n }\n \n void uri_capture_element::init_file_ext_list()\n {\n\tstatic std::string ext_list[32]\n\t = { \"jpg\",\"jpeg\",\"raw\",\"png\",\"gif\",\"bmp\",\"ppm\",\"pgm\",\"pbm\",\"pnm\",\"tga\",\"pcx\",\n\t \"ecw\",\"img\",\"sid\",\"pgf\",\"cgm\",\"svg\",\"eps\",\"odg\",\"pdf\",\"pgml\",\"swf\",\n\t \"vml\",\"wmf\",\"emf\",\"xps\",\"ico\",\"css\",\"js\",\"xml\",\"pl\"};\n\t\n\tif (!uri_capture_element::_img_ext_list.empty())\n\t return;\n\t\n\tfor (int i=0;i<32;i++)\n\t uri_capture_element::_img_ext_list.insert(std::pair<const char*,bool>(strdup(ext_list[i].c_str()),true)); \n }\n \n bool uri_capture_element::is_path_to_no_page(const std::string &path)\n {\n\tsize_t pos = path.find_last_of(\".\");\n\tif (pos == std::string::npos || path.size() < pos+1)\n\t return false;\n\tstd::string ext = path.substr(pos+1);\n\thash_map<const char*,bool,hash<const char*>,eqstr>::const_iterator hit;\n\tif ((hit=uri_capture_element::_img_ext_list.find(ext.c_str()))!=uri_capture_element::_img_ext_list.end())\n\t return true;\n\treturn false;\n }\n \n \/* auto-registration *\/\n#if defined(ON_OPENBSD) || defined(ON_OSX)\n extern \"C\"\n {\n\tplugin* maker()\n\t {\n\t return new uri_capture;\n\t }\n }\n#else \n plugin* makeruc()\n {\n\treturn new uri_capture;\n }\n \n class proxy_autor_capture\n {\n public:\n\tproxy_autor_capture()\n\t {\n\t plugin_manager::_factory[\"uri-capture\"] = makeruc; \/\/ beware: default plugin shell with no name.\n\t }\n };\n \n proxy_autor_capture _p; \/\/ one instance, instanciated when dl-opening.\n#endif\n \n} \/* end of namespace. *\/\n<|endoftext|>"} {"text":"<commit_before>\/* csvstream_test.cpp\n *\n * Andrew DeOrio <awdeorio@umich.edu>\n *\n * An easy-to-use CSV file parser for C++\n * https:\/\/github.com\/awdeorio\/csvstream\n *\/\n\n#include \"csvstream.h\"\n#include <iostream>\n#include <fstream>\n#include <string>\n#include <map>\n#include <vector>\nusing namespace std;\n\n\nvoid test_filename_ctor();\nvoid test_stream_ctor();\nvoid test_getheader();\nvoid test_emptyfields();\nvoid test_tsv();\nvoid test_too_few_cols_in_the_middle(bool strict);\nvoid test_too_few_cols_at_the_end(bool strict);\nvoid test_too_many_cols(bool strict);\nvoid test_no_newline_at_the_end();\nvoid test_quotes();\nvoid test_escape_quotes();\nvoid test_multiline_quotes();\nvoid test_osx_line_endings();\nvoid test_windows_line_endings();\nvoid test_strict_notsctrict();\nvoid test_notstrict_exceptions();\n\n\nint main() {\n test_filename_ctor();\n test_stream_ctor();\n test_getheader();\n test_emptyfields();\n test_tsv();\n for (auto strict : { false, true }) {\n test_too_few_cols_in_the_middle(strict);\n test_too_few_cols_at_the_end(strict);\n test_too_many_cols(strict);\n }\n test_no_newline_at_the_end();\n test_quotes();\n test_escape_quotes();\n test_multiline_quotes();\n test_osx_line_endings();\n test_windows_line_endings();\n test_strict_notsctrict();\n test_notstrict_exceptions();\n cout << \"csvstream_test PASSED\\n\";\n return 0;\n}\n\n\n\/\/ data for next few unit tests\nconst string input_filename_animals = \"csvstream_example.csv\";\nconst vector<string> header_correct_animals = {\"name\", \"animal\"};\nconst vector<map<string, string>> output_correct_animals =\n {\n {{\"name\",\"Fergie\"},{\"animal\",\"horse\"}},\n {{\"name\",\"Myrtle II\"},{\"animal\",\"chicken\"}},\n {{\"name\",\"Oscar\"},{\"animal\",\"cat\"}},\n }\n ;\n\n\nvoid test_filename_ctor() {\n \/\/ Test creating a csvstream object from a filename string\n\n \/\/ Save actual output\n vector<map<string, string>> output_observed;\n\n \/\/ Read file\n csvstream csvin(input_filename_animals);\n map<string, string> row;\n while (csvin >> row) {\n output_observed.push_back(row);\n }\n\n \/\/ Check output\n assert(output_observed == output_correct_animals);\n}\n\n\nvoid test_stream_ctor() {\n \/\/ Test creating a csvstream object from a stream\n\n \/\/ Save actual output\n vector<map<string, string>> output_observed;\n\n \/\/ Open file\n ifstream fin(input_filename_animals.c_str());\n assert(fin.is_open());\n\n \/\/ Read file from stream\n csvstream csvin(fin);\n map<string, string> row;\n while (csvin >> row) {\n output_observed.push_back(row);\n }\n\n \/\/ Check output\n assert(output_observed == output_correct_animals);\n\n \/\/ Clean up\n fin.close();\n}\n\n\nvoid test_getheader() {\n \/\/ Test reading header from first line of CSV file\n\n csvstream csvin(input_filename_animals);\n auto header = csvin.getheader();\n assert(header == header_correct_animals);\n}\n\n\nvoid test_emptyfields() {\n \/\/ Test with input data containing empty fields (consecutive commas)\n\n \/\/ Input\n stringstream iss(\"a,b,c\\n,,\\n,,\\n\");\n\n \/\/ Correct answer\n const vector<map<string, string>> output_correct =\n {\n {{\"a\",\"\"},{\"b\",\"\"},{\"c\",\"\"}},\n {{\"a\",\"\"},{\"b\",\"\"},{\"c\",\"\"}},\n }\n ;\n\n \/\/ Save actual output\n vector<map<string, string>> output_observed;\n\n \/\/ Read stream\n csvstream csvin(iss);\n map<string, string> row;\n try {\n while (csvin >> row) {\n output_observed.push_back(row);\n }\n } catch(csvstream_exception e) {\n cout << e.what() << endl;\n assert(0);\n }\n\n \/\/ Check output\n assert(output_observed == output_correct);\n}\n\n\nvoid test_tsv() {\n \/\/ Test with tab separated data\n\n \/\/ Input\n stringstream iss(\"a\\tb\\tc\\nd\\te\\tf\\n\\t\\t\\n\");\n\n \/\/ Correct answer\n const vector<map<string, string>> output_correct =\n {\n {{\"a\",\"d\"},{\"b\",\"e\"},{\"c\",\"f\"}},\n {{\"a\",\"\"},{\"b\",\"\"},{\"c\",\"\"}},\n }\n ;\n\n \/\/ Save actual output\n vector<map<string, string>> output_observed;\n\n \/\/ Read file\n csvstream csvin(iss, '\\t');\n map<string, string> row;\n try {\n while (csvin >> row) {\n output_observed.push_back(row);\n }\n } catch(csvstream_exception e) {\n cout << e.what() << endl;\n assert(0);\n }\n\n \/\/ Check output\n assert(output_observed == output_correct);\n}\n\n\nvoid test_too_few_cols_in_the_middle(bool strict) {\n \/\/ Test error condition: a row in the middle of the file that doesn't have\n \/\/ enough fields\n\n \/\/ Input\n stringstream iss(\"a,b,c\\n,\\nd,e,f\");\n\n \/\/ Create object\n csvstream csvin(iss, ',', strict);\n\n \/\/ Read file\n map<string, string> row;\n try {\n while (csvin >> row); \/\/ throw away data\n } catch(csvstream_exception e) {\n \/\/ exception must be caught for strict mode\n if (strict) return;\n cout << e.what() << endl;\n assert(0);\n }\n\n \/\/ if exception wasn't caught for strict mode, then it didn't work\n if (strict) assert(0);\n}\n\n\nvoid test_too_few_cols_at_the_end(bool strict) {\n \/\/ Test error condition: last row doesn't have enough fields\n\n \/\/ Input\n stringstream iss(\"a,b,c\\n,\");\n\n \/\/ Create object\n csvstream csvin(iss, ',', strict);\n\n \/\/ Read file\n map<string, string> row;\n try {\n while (csvin >> row); \/\/ throw away data\n } catch(csvstream_exception e) {\n \/\/ exception must be caught for strict mode\n if (strict) return;\n cout << e.what() << endl;\n assert(0);\n }\n\n \/\/ if exception wasn't caught for strict mode, then it didn't work\n if (strict) assert(0);\n}\n\n\nvoid test_too_many_cols(bool strict) {\n \/\/ Test error condition: row with too many fields\n\n \/\/ Input\n stringstream iss(\"a,b,c\\n,,,\");\n\n \/\/ Create object\n csvstream csvin(iss, ',', strict);\n\n \/\/ Read file\n map<string, string> row;\n try {\n while (csvin >> row); \/\/ throw away data\n } catch(csvstream_exception e) {\n \/\/ exception must be caught for strict mode\n if (strict) return;\n cout << e.what() << endl;\n assert(0);\n }\n\n \/\/ if exception wasn't caught for strict mode, then it didn't work\n if (strict) assert(0);\n}\n\n\nvoid test_no_newline_at_the_end() {\n \/\/ Test with input that has no newline at the end\n\n \/\/ Input\n stringstream iss(\"a,b,c\\n,,\");\n\n \/\/ Create object\n csvstream csvin(iss);\n\n \/\/ Correct answer\n const vector<map<string, string>> output_correct =\n {\n {{\"a\",\"\"},{\"b\",\"\"},{\"c\",\"\"}},\n }\n ;\n\n \/\/ Save actual output\n vector<map<string, string>> output_observed;\n\n \/\/ Read stream\n map<string, string> row;\n try {\n while (csvin >> row) {\n output_observed.push_back(row);\n }\n } catch(csvstream_exception e) {\n cout << e.what() << endl;\n assert(0);\n }\n\n \/\/ Check output\n assert(output_observed == output_correct);\n\n}\n\n\nvoid test_quotes() {\n \/\/ Input\n stringstream iss(\"\\\"a\\\",b,c\\n\\\"1\\\",2,3\\n\\\"4,44\\\",5,6\\n\");\n\n \/\/ Correct answer\n const vector<map<string, string>> output_correct =\n {\n {{\"a\",\"1\"},{\"b\",\"2\"},{\"c\",\"3\"}},\n {{\"a\",\"4,44\"},{\"b\",\"5\"},{\"c\",\"6\"}}, \/\/quoted comma\n }\n ;\n\n \/\/ Save actual output\n vector<map<string, string>> output_observed;\n\n \/\/ Read stream\n csvstream csvin(iss);\n map<string, string> row;\n try {\n while (csvin >> row) {\n output_observed.push_back(row);\n }\n } catch(csvstream_exception e) {\n cout << e.what() << endl;\n assert(0);\n }\n\n \/\/ Check output\n assert(output_observed == output_correct);\n}\n\n\nvoid test_escape_quotes() {\n \/\/ Test with input data containing escaped quotes\n\n \/\/ Input\n stringstream iss(\"\\\\\\\"a\\\\\\\",b,c\\n\\\\\\\"1\\\\\\\",2,3\\n\\\"4,\\\\\\\"44\\\",5,6\");\n\n \/\/ Correct answer\n const vector<map<string, string>> output_correct =\n {\n {{\"\\\\\\\"a\\\\\\\"\",\"\\\\\\\"1\\\\\\\"\"},{\"b\",\"2\"},{\"c\",\"3\"}}, \/\/escaped quote\n {{\"\\\\\\\"a\\\\\\\"\",\"4,\\\\\\\"44\"},{\"b\",\"5\"},{\"c\",\"6\"}}, \/\/escaped quote\n }\n ;\n\n \/\/ Save actual output\n vector<map<string, string>> output_observed;\n\n \/\/ Read stream\n csvstream csvin(iss);\n map<string, string> row;\n try {\n while (csvin >> row) {\n output_observed.push_back(row);\n }\n } catch(csvstream_exception e) {\n cout << e.what() << endl;\n assert(0);\n }\n\n \/\/ Check output\n assert(output_observed == output_correct);\n}\n\n\nvoid test_multiline_quotes() {\n \/\/ Test with input data containing a quoted field containing newlines\n\n stringstream iss(\"a,b\\n\\\"hello\\nworld\\\",\\\"b\\\"\\n\");\n\n const vector<map<string, string>> output_correct =\n {\n {{\"a\", \"hello\\nworld\"},{\"b\", \"b\"}}\n }\n ;\n\n vector<map<string, string>> output_observed;\n\n csvstream csvin(iss);\n map<string, string> row;\n try {\n while (csvin >> row) {\n output_observed.push_back(row);\n }\n } catch(csvstream_exception e) {\n cout << e.what() << endl;\n assert(0);\n }\n\n \/\/ Check output\n assert(output_observed == output_correct);\n}\n\n\nvoid test_osx_line_endings() {\n \/\/ Test with input data containing OSX line endings: \\r\n\n \/\/ Input\n stringstream iss(\"a,b,c\\r1,2,3\\r,,\\r\");\n\n \/\/ Correct answer\n const vector<map<string, string>> output_correct =\n {\n {{\"a\",\"1\"},{\"b\",\"2\"},{\"c\",\"3\"}},\n {{\"a\",\"\"},{\"b\",\"\"},{\"c\",\"\"}},\n }\n ;\n\n \/\/ Save actual output\n vector<map<string, string>> output_observed;\n\n \/\/ Read stream\n csvstream csvin(iss);\n map<string, string> row;\n try {\n while (csvin >> row) {\n output_observed.push_back(row);\n }\n } catch(csvstream_exception e) {\n cout << e.what() << endl;\n assert(0);\n }\n\n \/\/ Check output\n assert(output_observed == output_correct);\n}\n\n\nvoid test_windows_line_endings() {\n \/\/ Test with input data containing Windows line endings: \\r\\n\n\n \/\/ Input\n stringstream iss(\"a,b,c\\r\\n1,2,3\\r\\n,,\\r\\n\");\n\n \/\/ Correct answer\n const vector<map<string, string>> output_correct =\n {\n {{\"a\",\"1\"},{\"b\",\"2\"},{\"c\",\"3\"}},\n {{\"a\",\"\"},{\"b\",\"\"},{\"c\",\"\"}},\n }\n ;\n\n \/\/ Save actual output\n vector<map<string, string>> output_observed;\n\n \/\/ Read stream\n csvstream csvin(iss);\n map<string, string> row;\n try {\n while (csvin >> row) {\n output_observed.push_back(row);\n }\n } catch(csvstream_exception e) {\n cout << e.what() << endl;\n assert(0);\n }\n\n \/\/ Check output\n assert(output_observed == output_correct);\n}\n\n\nvoid test_ordered() {\n \/\/ Test ordered stream extraction operator. Store data in a vector instead\n \/\/ of a map.\n\n \/\/ Input\n stringstream iss(\"b,a,c\\n2,1,3\\n\");\n\n \/\/ Correct answer\n const vector<vector<pair<string, string>>> output_correct =\n {\n {{\"b\",\"2\"},{\"a\",\"1\"},{\"c\",\"3\"}},\n }\n ;\n\n \/\/ Save actual output\n vector<vector<pair<string, string>>> output_observed;\n\n \/\/ Read stream\n csvstream csvin(iss);\n vector<pair<string, string>> row;\n try {\n while (csvin >> row) {\n output_observed.push_back(row);\n }\n } catch(csvstream_exception e) {\n cout << e.what() << endl;\n assert(0);\n }\n\n \/\/ Check output\n assert(output_observed == output_correct);\n}\n\n\nvoid test_strict_notsctrict() {\n \/\/ Test with same input for strict and not strict modes.\n\n \/\/ Correct answer\n const vector<vector<pair<string, string>>> output_correct =\n {\n {{\"a\",\"1\"},{\"b\",\"2\"},{\"c\",\"3\"}},\n {{\"a\",\"4\"},{\"b\",\"5\"},{\"c\",\"6\"}},\n }\n ;\n for (auto strict : { false, true }) {\n \/\/ Input\n stringstream iss(\"a,b,c\\n1,2,3\\n4,5,6\");\n\n \/\/ Save actual output\n vector<vector<pair<string, string>>> output_observed;\n\n \/\/ Read stream\n csvstream csvin(iss, ',', strict);\n vector<pair<string, string>> row;\n try {\n while (csvin >> row) {\n output_observed.push_back(row);\n }\n } catch(csvstream_exception e) {\n cout << e.what() << endl;\n assert(0);\n }\n\n \/\/ Check output\n assert(output_observed == output_correct);\n }\n}\n\n\nvoid test_notstrict_exceptions() {\n \/\/ Test for exceptions in not strict mode.\n\n \/\/ Invalid input strings\n vector<string> input_strings = {\n \"\\\"a,b,c\\n1,2,3\", \/\/ no closing bracket\n \",,,\\n1,2,3\", \/\/ empty headers\n \"\\n\\n\\n\\n\" \/\/ string with endings only\n \"a,b\\n1,2,3\\n1\", \/\/ lines have different size\n \"a,b,c\\n,,,,,\\n,,\\n,\\n\\n\", \/\/ empty values\n }\n ;\n\n for (auto &input_string : input_strings) {\n \/\/ Input\n stringstream iss(input_string);\n\n \/\/ Read stream\n csvstream csvin(iss, ',', false);\n vector<pair<string, string>> row;\n try {\n while (csvin >> row);\n } catch(csvstream_exception e) {\n cout << e.what() << endl;\n \/\/ If exception was caught, it didn't work\n assert(0);\n }\n }\n}\n<commit_msg>testcase nit: replace parametrized tests with copy pasta. Easier to read for a unit test.<commit_after>\/* csvstream_test.cpp\n *\n * Andrew DeOrio <awdeorio@umich.edu>\n *\n * An easy-to-use CSV file parser for C++\n * https:\/\/github.com\/awdeorio\/csvstream\n *\/\n\n#include \"csvstream.h\"\n#include <iostream>\n#include <fstream>\n#include <string>\n#include <map>\n#include <vector>\nusing namespace std;\n\n\nvoid test_filename_ctor();\nvoid test_stream_ctor();\nvoid test_getheader();\nvoid test_emptyfields();\nvoid test_tsv();\nvoid test_too_few_cols_in_the_middle_strict();\nvoid test_too_few_cols_in_the_middle_notstrict();\nvoid test_too_few_cols_at_the_end_strict();\nvoid test_too_few_cols_at_the_end_notstrict();\nvoid test_too_many_cols_strict();\nvoid test_too_many_cols_notstrict();\nvoid test_no_newline_at_the_end();\nvoid test_quotes();\nvoid test_escape_quotes();\nvoid test_multiline_quotes();\nvoid test_osx_line_endings();\nvoid test_windows_line_endings();\nvoid test_strict_notsctrict();\nvoid test_notstrict_exceptions();\n\n\nint main() {\n test_filename_ctor();\n test_stream_ctor();\n test_getheader();\n test_emptyfields();\n test_tsv();\n test_too_few_cols_in_the_middle_strict();\n test_too_few_cols_in_the_middle_notstrict();\n test_too_few_cols_at_the_end_strict();\n test_too_few_cols_at_the_end_notstrict();\n test_too_many_cols_strict();\n test_too_many_cols_notstrict();\n test_no_newline_at_the_end();\n test_quotes();\n test_escape_quotes();\n test_multiline_quotes();\n test_osx_line_endings();\n test_windows_line_endings();\n test_strict_notsctrict();\n test_notstrict_exceptions();\n cout << \"csvstream_test PASSED\\n\";\n return 0;\n}\n\n\n\/\/ data for next few unit tests\nconst string input_filename_animals = \"csvstream_example.csv\";\nconst vector<string> header_correct_animals = {\"name\", \"animal\"};\nconst vector<map<string, string>> output_correct_animals =\n {\n {{\"name\",\"Fergie\"},{\"animal\",\"horse\"}},\n {{\"name\",\"Myrtle II\"},{\"animal\",\"chicken\"}},\n {{\"name\",\"Oscar\"},{\"animal\",\"cat\"}},\n }\n ;\n\n\nvoid test_filename_ctor() {\n \/\/ Test creating a csvstream object from a filename string\n\n \/\/ Save actual output\n vector<map<string, string>> output_observed;\n\n \/\/ Read file\n csvstream csvin(input_filename_animals);\n map<string, string> row;\n while (csvin >> row) {\n output_observed.push_back(row);\n }\n\n \/\/ Check output\n assert(output_observed == output_correct_animals);\n}\n\n\nvoid test_stream_ctor() {\n \/\/ Test creating a csvstream object from a stream\n\n \/\/ Save actual output\n vector<map<string, string>> output_observed;\n\n \/\/ Open file\n ifstream fin(input_filename_animals.c_str());\n assert(fin.is_open());\n\n \/\/ Read file from stream\n csvstream csvin(fin);\n map<string, string> row;\n while (csvin >> row) {\n output_observed.push_back(row);\n }\n\n \/\/ Check output\n assert(output_observed == output_correct_animals);\n\n \/\/ Clean up\n fin.close();\n}\n\n\nvoid test_getheader() {\n \/\/ Test reading header from first line of CSV file\n\n csvstream csvin(input_filename_animals);\n auto header = csvin.getheader();\n assert(header == header_correct_animals);\n}\n\n\nvoid test_emptyfields() {\n \/\/ Test with input data containing empty fields (consecutive commas)\n\n \/\/ Input\n stringstream iss(\"a,b,c\\n,,\\n,,\\n\");\n\n \/\/ Correct answer\n const vector<map<string, string>> output_correct =\n {\n {{\"a\",\"\"},{\"b\",\"\"},{\"c\",\"\"}},\n {{\"a\",\"\"},{\"b\",\"\"},{\"c\",\"\"}},\n }\n ;\n\n \/\/ Save actual output\n vector<map<string, string>> output_observed;\n\n \/\/ Read stream\n csvstream csvin(iss);\n map<string, string> row;\n try {\n while (csvin >> row) {\n output_observed.push_back(row);\n }\n } catch(csvstream_exception e) {\n cout << e.what() << endl;\n assert(0);\n }\n\n \/\/ Check output\n assert(output_observed == output_correct);\n}\n\n\nvoid test_tsv() {\n \/\/ Test with tab separated data\n\n \/\/ Input\n stringstream iss(\"a\\tb\\tc\\nd\\te\\tf\\n\\t\\t\\n\");\n\n \/\/ Correct answer\n const vector<map<string, string>> output_correct =\n {\n {{\"a\",\"d\"},{\"b\",\"e\"},{\"c\",\"f\"}},\n {{\"a\",\"\"},{\"b\",\"\"},{\"c\",\"\"}},\n }\n ;\n\n \/\/ Save actual output\n vector<map<string, string>> output_observed;\n\n \/\/ Read file\n csvstream csvin(iss, '\\t');\n map<string, string> row;\n try {\n while (csvin >> row) {\n output_observed.push_back(row);\n }\n } catch(csvstream_exception e) {\n cout << e.what() << endl;\n assert(0);\n }\n\n \/\/ Check output\n assert(output_observed == output_correct);\n}\n\n\nvoid test_too_few_cols_in_the_middle_strict() {\n \/\/ Test error condition: a row in the middle of the file that doesn't have\n \/\/ enough fields\n\n \/\/ Input\n stringstream iss(\"a,b,c\\n,\\nd,e,f\");\n\n \/\/ Create object\n csvstream csvin(iss);\n\n \/\/ Read file\n map<string, string> row;\n try {\n while (csvin >> row); \/\/ throw away data\n } catch(csvstream_exception e) {\n \/\/if we caught an exception, then it worked\n return;\n }\n\n \/\/ if we made it this far, then it didn't work\n assert(0);\n}\n\n\nvoid test_too_few_cols_in_the_middle_notstrict() {\n \/\/ Test error condition: a row in the middle of the file that doesn't have\n \/\/ enough fields. When strict=false, this should *not* cause an error.\n\n \/\/ Input\n stringstream iss(\"a,b,c\\n,\\nd,e,f\");\n\n \/\/ Create object with strict=false\n csvstream csvin(iss, ',', false);\n\n \/\/ Read file\n map<string, string> row;\n try {\n while (csvin >> row); \/\/ throw away data\n } catch(csvstream_exception e) {\n \/\/ If we caught an exception, then strict=false failed to coerce the number\n \/\/ of values.\n assert(0);\n }\n}\n\n\nvoid test_too_few_cols_at_the_end_strict() {\n \/\/ Test error condition: last row doesn't have enough fields\n\n \/\/ Input\n stringstream iss(\"a,b,c\\n,\");\n\n \/\/ Create object\n csvstream csvin(iss);\n\n \/\/ Read file\n map<string, string> row;\n try {\n while (csvin >> row); \/\/ throw away data\n } catch(csvstream_exception e) {\n \/\/if we caught an exception, then it worked\n return;\n }\n\n \/\/ if we made it this far, then it didn't work\n assert(0);\n}\n\n\nvoid test_too_few_cols_at_the_end_notstrict() {\n \/\/ Test error condition: last row doesn't have enough fields\n\n \/\/ Input\n stringstream iss(\"a,b,c\\n,\");\n\n \/\/ Create object with strict=false\n csvstream csvin(iss, ',', false);\n\n \/\/ Read file\n map<string, string> row;\n try {\n while (csvin >> row); \/\/ throw away data\n } catch(csvstream_exception e) {\n \/\/ If we caught an exception, then strict=false failed to coerce the number\n \/\/ of values.\n assert(0);\n }\n}\n\n\nvoid test_too_many_cols_strict() {\n \/\/ Test error condition: row with too many fields\n\n \/\/ Input\n stringstream iss(\"a,b,c\\n,,,\");\n\n \/\/ Create object\n csvstream csvin(iss);\n\n \/\/ Read file\n map<string, string> row;\n try {\n while (csvin >> row); \/\/ throw away data\n } catch(csvstream_exception e) {\n \/\/if we caught an exception, then it worked\n return;\n }\n\n \/\/ if we made it this far, then it didn't work\n assert(0);\n}\n\n\nvoid test_too_many_cols_notstrict() {\n \/\/ Test error condition: row with too many fields. When strict=false,\n \/\/ this should *not* cause an error.\n\n \/\/ Input\n stringstream iss(\"a,b,c\\n,,,\");\n\n \/\/ Create object, with strict=false\n csvstream csvin(iss, ',', false);\n\n \/\/ Read file\n map<string, string> row;\n try {\n while (csvin >> row); \/\/ throw away data\n } catch(csvstream_exception e) {\n \/\/ If we caught an exception, then strict=false failed to coerce the number\n \/\/ of values.\n assert(0);\n }\n}\n\n\nvoid test_no_newline_at_the_end() {\n \/\/ Test with input that has no newline at the end\n\n \/\/ Input\n stringstream iss(\"a,b,c\\n,,\");\n\n \/\/ Create object\n csvstream csvin(iss);\n\n \/\/ Correct answer\n const vector<map<string, string>> output_correct =\n {\n {{\"a\",\"\"},{\"b\",\"\"},{\"c\",\"\"}},\n }\n ;\n\n \/\/ Save actual output\n vector<map<string, string>> output_observed;\n\n \/\/ Read stream\n map<string, string> row;\n try {\n while (csvin >> row) {\n output_observed.push_back(row);\n }\n } catch(csvstream_exception e) {\n cout << e.what() << endl;\n assert(0);\n }\n\n \/\/ Check output\n assert(output_observed == output_correct);\n\n}\n\n\nvoid test_quotes() {\n \/\/ Input\n stringstream iss(\"\\\"a\\\",b,c\\n\\\"1\\\",2,3\\n\\\"4,44\\\",5,6\\n\");\n\n \/\/ Correct answer\n const vector<map<string, string>> output_correct =\n {\n {{\"a\",\"1\"},{\"b\",\"2\"},{\"c\",\"3\"}},\n {{\"a\",\"4,44\"},{\"b\",\"5\"},{\"c\",\"6\"}}, \/\/quoted comma\n }\n ;\n\n \/\/ Save actual output\n vector<map<string, string>> output_observed;\n\n \/\/ Read stream\n csvstream csvin(iss);\n map<string, string> row;\n try {\n while (csvin >> row) {\n output_observed.push_back(row);\n }\n } catch(csvstream_exception e) {\n cout << e.what() << endl;\n assert(0);\n }\n\n \/\/ Check output\n assert(output_observed == output_correct);\n}\n\n\nvoid test_escape_quotes() {\n \/\/ Test with input data containing escaped quotes\n\n \/\/ Input\n stringstream iss(\"\\\\\\\"a\\\\\\\",b,c\\n\\\\\\\"1\\\\\\\",2,3\\n\\\"4,\\\\\\\"44\\\",5,6\");\n\n \/\/ Correct answer\n const vector<map<string, string>> output_correct =\n {\n {{\"\\\\\\\"a\\\\\\\"\",\"\\\\\\\"1\\\\\\\"\"},{\"b\",\"2\"},{\"c\",\"3\"}}, \/\/escaped quote\n {{\"\\\\\\\"a\\\\\\\"\",\"4,\\\\\\\"44\"},{\"b\",\"5\"},{\"c\",\"6\"}}, \/\/escaped quote\n }\n ;\n\n \/\/ Save actual output\n vector<map<string, string>> output_observed;\n\n \/\/ Read stream\n csvstream csvin(iss);\n map<string, string> row;\n try {\n while (csvin >> row) {\n output_observed.push_back(row);\n }\n } catch(csvstream_exception e) {\n cout << e.what() << endl;\n assert(0);\n }\n\n \/\/ Check output\n assert(output_observed == output_correct);\n}\n\n\nvoid test_multiline_quotes() {\n \/\/ Test with input data containing a quoted field containing newlines\n\n stringstream iss(\"a,b\\n\\\"hello\\nworld\\\",\\\"b\\\"\\n\");\n\n const vector<map<string, string>> output_correct =\n {\n {{\"a\", \"hello\\nworld\"},{\"b\", \"b\"}}\n }\n ;\n\n vector<map<string, string>> output_observed;\n\n csvstream csvin(iss);\n map<string, string> row;\n try {\n while (csvin >> row) {\n output_observed.push_back(row);\n }\n } catch(csvstream_exception e) {\n cout << e.what() << endl;\n assert(0);\n }\n\n \/\/ Check output\n assert(output_observed == output_correct);\n}\n\n\nvoid test_osx_line_endings() {\n \/\/ Test with input data containing OSX line endings: \\r\n\n \/\/ Input\n stringstream iss(\"a,b,c\\r1,2,3\\r,,\\r\");\n\n \/\/ Correct answer\n const vector<map<string, string>> output_correct =\n {\n {{\"a\",\"1\"},{\"b\",\"2\"},{\"c\",\"3\"}},\n {{\"a\",\"\"},{\"b\",\"\"},{\"c\",\"\"}},\n }\n ;\n\n \/\/ Save actual output\n vector<map<string, string>> output_observed;\n\n \/\/ Read stream\n csvstream csvin(iss);\n map<string, string> row;\n try {\n while (csvin >> row) {\n output_observed.push_back(row);\n }\n } catch(csvstream_exception e) {\n cout << e.what() << endl;\n assert(0);\n }\n\n \/\/ Check output\n assert(output_observed == output_correct);\n}\n\n\nvoid test_windows_line_endings() {\n \/\/ Test with input data containing Windows line endings: \\r\\n\n\n \/\/ Input\n stringstream iss(\"a,b,c\\r\\n1,2,3\\r\\n,,\\r\\n\");\n\n \/\/ Correct answer\n const vector<map<string, string>> output_correct =\n {\n {{\"a\",\"1\"},{\"b\",\"2\"},{\"c\",\"3\"}},\n {{\"a\",\"\"},{\"b\",\"\"},{\"c\",\"\"}},\n }\n ;\n\n \/\/ Save actual output\n vector<map<string, string>> output_observed;\n\n \/\/ Read stream\n csvstream csvin(iss);\n map<string, string> row;\n try {\n while (csvin >> row) {\n output_observed.push_back(row);\n }\n } catch(csvstream_exception e) {\n cout << e.what() << endl;\n assert(0);\n }\n\n \/\/ Check output\n assert(output_observed == output_correct);\n}\n\n\nvoid test_ordered() {\n \/\/ Test ordered stream extraction operator. Store data in a vector instead\n \/\/ of a map.\n\n \/\/ Input\n stringstream iss(\"b,a,c\\n2,1,3\\n\");\n\n \/\/ Correct answer\n const vector<vector<pair<string, string>>> output_correct =\n {\n {{\"b\",\"2\"},{\"a\",\"1\"},{\"c\",\"3\"}},\n }\n ;\n\n \/\/ Save actual output\n vector<vector<pair<string, string>>> output_observed;\n\n \/\/ Read stream\n csvstream csvin(iss);\n vector<pair<string, string>> row;\n try {\n while (csvin >> row) {\n output_observed.push_back(row);\n }\n } catch(csvstream_exception e) {\n cout << e.what() << endl;\n assert(0);\n }\n\n \/\/ Check output\n assert(output_observed == output_correct);\n}\n\n\nvoid test_strict_notsctrict() {\n \/\/ Test with same input for strict and not strict modes.\n\n \/\/ Correct answer\n const vector<vector<pair<string, string>>> output_correct =\n {\n {{\"a\",\"1\"},{\"b\",\"2\"},{\"c\",\"3\"}},\n {{\"a\",\"4\"},{\"b\",\"5\"},{\"c\",\"6\"}},\n }\n ;\n for (auto strict : { false, true }) {\n \/\/ Input\n stringstream iss(\"a,b,c\\n1,2,3\\n4,5,6\");\n\n \/\/ Save actual output\n vector<vector<pair<string, string>>> output_observed;\n\n \/\/ Read stream\n csvstream csvin(iss, ',', strict);\n vector<pair<string, string>> row;\n try {\n while (csvin >> row) {\n output_observed.push_back(row);\n }\n } catch(csvstream_exception e) {\n cout << e.what() << endl;\n assert(0);\n }\n\n \/\/ Check output\n assert(output_observed == output_correct);\n }\n}\n\n\nvoid test_notstrict_exceptions() {\n \/\/ Test for exceptions in not strict mode.\n\n \/\/ Invalid input strings\n vector<string> input_strings = {\n \"\\\"a,b,c\\n1,2,3\", \/\/ no closing bracket\n \",,,\\n1,2,3\", \/\/ empty headers\n \"\\n\\n\\n\\n\" \/\/ string with endings only\n \"a,b\\n1,2,3\\n1\", \/\/ lines have different size\n \"a,b,c\\n,,,,,\\n,,\\n,\\n\\n\", \/\/ empty values\n }\n ;\n\n for (auto &input_string : input_strings) {\n \/\/ Input\n stringstream iss(input_string);\n\n \/\/ Read stream\n csvstream csvin(iss, ',', false);\n vector<pair<string, string>> row;\n try {\n while (csvin >> row);\n } catch(csvstream_exception e) {\n cout << e.what() << endl;\n \/\/ If exception was caught, it didn't work\n assert(0);\n }\n }\n}\n<|endoftext|>"} {"text":"<commit_before>\/*\n Q Light Controller Plus\n webaccessauth.cpp\n\n Copyright (c) Bartosz Grabias\n\n Licensed under the Apache License, Version 2.0 (the \"License\");\n you may not use this file except in 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 <iostream>\n#include <QDebug>\n#include <QByteArray>\n#include <QCryptographicHash>\n#include <QFile>\n#include <QTextStream>\n\n#include \"webaccessauth.h\"\n\n#include \"qhttprequest.h\"\n#include \"qhttpresponse.h\"\n\n#define PASSWORD_HASH_ALGORITHM QCryptographicHash::Algorithm::Sha256\n\nWebAccessAuth::WebAccessAuth(const QString& realm)\n : m_passwords()\n , m_realm(realm)\n{\n}\n\nbool WebAccessAuth::loadPasswordsFile(const QString& filePath)\n{\n QFile file(filePath);\n \n if(! file.open(QIODevice::OpenModeFlag::ReadOnly))\n return false;\n \n QTextStream stream(&file);\n QString line;\n\n while(! (line = stream.readLine()).isNull()) \n {\n int colonIndex = line.indexOf(':');\n\n if(colonIndex == -1)\n {\n qDebug() << \"WebAccessAuth::loadPasswordsFile: Skipping invalid line '\" << line << \"'\";\n continue;\n }\n \n auto username = line.left(colonIndex);\n auto passwordHash = line.mid(colonIndex + 1);\n\n \/\/ Silently skips duplicate usernames due to unique keys in maps\n this->m_passwords.insert(username, passwordHash);\n }\n\n return true;\n}\n\nbool WebAccessAuth::authenticateRequest(const QHttpRequest* req, QHttpResponse* res) const\n{\n \/\/ Disable authentication when no passwords were added\n if(this->m_passwords.empty())\n return true;\n \n QString header = QString(\"Basic realm=\\\"\") + m_realm + QString(\"\\\"\");\n res->setHeader(\"WWW-Authenticate\", header);\n\n QString auth = req->header(\"Authorization\");\n \/\/ Tell the browser that authorization is required\n if(! auth.startsWith(\"Basic \"))\n {\n this->sendUnauthorizedResponse(res);\n return false;\n }\n\n auto authentication = QString(QByteArray::fromBase64(auth.right(auth.size() - 6).toUtf8()));\n std::cout << \"Got authentication header: \" << authentication.toStdString().c_str() << std::endl;\n int colonIndex = authentication.indexOf(':');\n \n if(colonIndex == -1)\n { \/\/ Technically this should be 400 Bad Request, but 401 Unauthorized is fine\n this->sendUnauthorizedResponse(res);\n return false;\n }\n\n auto username = authentication.left(colonIndex);\n auto passwordHash = this->hashPassword(authentication.mid(colonIndex + 1));\n\n auto passwordHashIterator = m_passwords.find(username);\n if(passwordHashIterator == m_passwords.end() || *passwordHashIterator != passwordHash)\n {\n this->sendUnauthorizedResponse(res);\n return false;\n }\n\n return true;\n}\n\nvoid WebAccessAuth::sendUnauthorizedResponse(QHttpResponse* res) const\n{\n const static QByteArray text = QString(\n \"<html>\"\n \"<head>\"\n \"<meta charset=\\\"utf-8\\\">\"\n \"<title>Unauthorized<\/title>\"\n \"<\/head>\"\n \"<body>\"\n \"<h1>401 Unauthorized<\/h1>\"\n \"<p>Access to this resource requires proper authorization\"\n \"and you have failed to authenticate.<\/p>\"\n \"<\/body>\"\n \"<\/html>\"\n ).toUtf8();\n\n res->setHeader(\"Content-Type\", \"text\/html\");\n res->setHeader(\"Content-Length\", QString::number(text.size()));\n res->writeHead(401);\n res->end(text);\n}\n\nQString WebAccessAuth::hashPassword(const QString& password) const\n{\n std::cout << \"Hashing password: '\" << password.toStdString().c_str() << \"'\" << std::endl;\n return QCryptographicHash::hash(password.toUtf8(), PASSWORD_HASH_ALGORITHM).toHex();\n}<commit_msg>Tidying up debug stuff.<commit_after>\/*\n Q Light Controller Plus\n webaccessauth.cpp\n\n Copyright (c) Bartosz Grabias\n\n Licensed under the Apache License, Version 2.0 (the \"License\");\n you may not use this file except in 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 <QDebug>\n#include <QByteArray>\n#include <QCryptographicHash>\n#include <QFile>\n#include <QTextStream>\n\n#include \"webaccessauth.h\"\n\n#include \"qhttprequest.h\"\n#include \"qhttpresponse.h\"\n\n#define PASSWORD_HASH_ALGORITHM QCryptographicHash::Algorithm::Sha256\n\nWebAccessAuth::WebAccessAuth(const QString& realm)\n : m_passwords()\n , m_realm(realm)\n{\n}\n\nbool WebAccessAuth::loadPasswordsFile(const QString& filePath)\n{\n QFile file(filePath);\n \n if(! file.open(QIODevice::OpenModeFlag::ReadOnly))\n return false;\n \n QTextStream stream(&file);\n QString line;\n\n while(! (line = stream.readLine()).isNull()) \n {\n int colonIndex = line.indexOf(':');\n\n if(colonIndex == -1)\n {\n qDebug() << \"Skipping invalid line '\" << line << \"'\";\n continue;\n }\n \n auto username = line.left(colonIndex);\n auto passwordHash = line.mid(colonIndex + 1);\n\n \/\/ Silently skips duplicate usernames due to unique keys in maps\n this->m_passwords.insert(username, passwordHash);\n }\n\n return true;\n}\n\nbool WebAccessAuth::authenticateRequest(const QHttpRequest* req, QHttpResponse* res) const\n{\n \/\/ Disable authentication when no passwords were added\n if(this->m_passwords.empty())\n return true;\n \n QString header = QString(\"Basic realm=\\\"\") + m_realm + QString(\"\\\"\");\n res->setHeader(\"WWW-Authenticate\", header);\n\n QString auth = req->header(\"Authorization\");\n \/\/ Tell the browser that authorization is required\n if(! auth.startsWith(\"Basic \"))\n {\n this->sendUnauthorizedResponse(res);\n return false;\n }\n\n auto authentication = QString(QByteArray::fromBase64(auth.right(auth.size() - 6).toUtf8()));\n std::cout << \"Got authentication header: \" << authentication.toStdString().c_str() << std::endl;\n int colonIndex = authentication.indexOf(':');\n \n \/\/ Disallow empty passwords\n if(colonIndex == -1)\n {\n this->sendUnauthorizedResponse(res);\n return false;\n }\n\n auto username = authentication.left(colonIndex);\n auto passwordHash = this->hashPassword(authentication.mid(colonIndex + 1));\n\n auto passwordHashIterator = m_passwords.find(username);\n if(passwordHashIterator == m_passwords.end() || *passwordHashIterator != passwordHash)\n {\n this->sendUnauthorizedResponse(res);\n return false;\n }\n\n return true;\n}\n\nvoid WebAccessAuth::sendUnauthorizedResponse(QHttpResponse* res) const\n{\n const static QByteArray text = QString(\n \"<html>\"\n \"<head>\"\n \"<meta charset=\\\"utf-8\\\">\"\n \"<title>Unauthorized<\/title>\"\n \"<\/head>\"\n \"<body>\"\n \"<h1>401 Unauthorized<\/h1>\"\n \"<p>Access to this resource requires proper authorization\"\n \"and you have failed to authenticate.<\/p>\"\n \"<\/body>\"\n \"<\/html>\"\n ).toUtf8();\n\n res->setHeader(\"Content-Type\", \"text\/html\");\n res->setHeader(\"Content-Length\", QString::number(text.size()));\n res->writeHead(401);\n res->end(text);\n}\n\nQString WebAccessAuth::hashPassword(const QString& password) const\n{\n return QCryptographicHash::hash(password.toUtf8(), PASSWORD_HASH_ALGORITHM).toHex();\n}<|endoftext|>"} {"text":"<commit_before>\/**\n * \\file\n *\n * \\brief Plugin which acts as proxy and calls other plugins written in python\n *\n * \\copyright BSD License (see doc\/COPYING or http:\/\/www.libelektra.org)\n *\n *\/\n\n#ifndef SWIG_TYPE_TABLE\n# error Build system error, SWIG_TYPE_TABLE is not defined\n#endif\n\n#include <Python.h>\n\n#ifndef HAVE_KDBCONFIG\n# include <kdbconfig.h>\n#endif\n#include <kdbhelper.h>\n#include SWIG_RUNTIME\n#include \"python.hpp\"\n\n#include <key.hpp>\n#include <keyset.hpp>\n#include <libgen.h>\n#include <pthread.h>\n#include <iostream>\n\nusing namespace ckdb;\n#include <kdberrors.h>\n\n#define __stringify(x) __stringify2(x)\n#define __stringify2(x) #x\n#define PYTHON_PLUGIN_NAME_STR __stringify(PYTHON_PLUGIN_NAME)\n\nstatic PyObject *Python_fromSWIG(ckdb::Key *key)\n{\n\tswig_type_info *ti = SWIG_TypeQuery(\"kdb::Key *\");\n\tif (key == NULL || ti == NULL)\n\t\treturn Py_None;\n\treturn SWIG_NewPointerObj(new kdb::Key(key), ti, 0);\n}\n\nstatic PyObject *Python_fromSWIG(ckdb::KeySet *keyset)\n{\n\tswig_type_info *ti = SWIG_TypeQuery(\"kdb::KeySet *\");\n\tif (keyset == NULL || ti == NULL)\n\t\treturn Py_None;\n\treturn SWIG_NewPointerObj(new kdb::KeySet(keyset), ti, 0);\n}\n\nextern \"C\"\n{\n\ntypedef struct\n{\n\tPyObject *instance;\n\tint printError;\n\tint shutdown;\n} moduleData;\n\n\/* pythons repr() - a little debug helper - misses all Py_DECREF calls! *\/\n#define Python_Repr(obj) \\\n\tPyBytes_AS_STRING( \\\n\t\tPyUnicode_AsEncodedString(PyObject_Repr(obj), \"utf-8\", \"Error ~\") \\\n\t)\n\nstatic PyObject *Python_ImportModule(const char *name)\n{\n\tif (!name)\n\t\treturn NULL;\n\n\tPyGILState_STATE gstate = PyGILState_Ensure();\n\tPyObject *module = PyImport_ImportModule(name);\n\tPyGILState_Release(gstate);\n\treturn module;\n}\n\nstatic PyObject *Python_CallFunction(PyObject *object, PyObject *args)\n{\n\tPyGILState_STATE gstate = PyGILState_Ensure();\n\n\tif (!PyCallable_Check(object))\n\t{\n\t\tPyGILState_Release(gstate);\n\t\treturn NULL;\n\t}\n\n\tPyObject *res = PyObject_CallObject(object, args ? args : PyTuple_New (0));\n\tPyGILState_Release(gstate);\n\tPy_XINCREF(res);\n\treturn res;\n}\n\nstatic int Python_CallFunction_Int(moduleData *data, PyObject *object,\n\t\tPyObject *args, ckdb::Key *errorKey)\n{\n\tint ret = -1;\n\tPyGILState_STATE gstate = PyGILState_Ensure();\n\n\tPyObject *res = Python_CallFunction(object, args);\n\tif (!res)\n\t{\n\t\tELEKTRA_SET_ERROR(111, errorKey,\n\t\t\t\t\"Error while calling python function\");\n\t\tif (data->printError)\n\t\t\tPyErr_Print();\n\t}\n\telse\n\t{\n#if PY_MAJOR_VERSION >= 3\n\t\tif (!PyLong_Check(res))\n#else\n\t\tif (!PyInt_Check(res))\n#endif\n\t\t\tELEKTRA_SET_ERROR(111, errorKey,\n\t\t\t\t\t\"Error: return value is no integer\");\n\t\telse\n\t\t\tret = PyLong_AsLong(res);\n\t}\n\n\tPyGILState_Release(gstate);\n\tPy_XDECREF(res);\n\treturn ret;\n}\n\nstatic int Python_CallFunction_Helper1(moduleData *data, const char *funcName,\n\tckdb::Key *errorKey)\n{\n\tint ret = 0;\n\tPyGILState_STATE gstate = PyGILState_Ensure();\n\tPyObject *func = PyObject_GetAttrString(data->instance, funcName);\n\tif (func)\n\t{\n\t\tPyObject *arg0 = Python_fromSWIG(errorKey);\n\t\tPyObject *args = Py_BuildValue(\"(O)\", arg0);\n\t\tret = Python_CallFunction_Int(data, func, args, errorKey);\n\t\tPy_DECREF(arg0);\n\t\tPy_DECREF(args);\n\t\tPy_DECREF(func);\n\t}\n\tPyGILState_Release(gstate);\n\treturn ret;\n}\n\nstatic int Python_CallFunction_Helper2(moduleData *data, const char *funcName,\n\tckdb::KeySet *returned, ckdb::Key *parentKey)\n{\n\tint ret = 0;\n\tPyGILState_STATE gstate = PyGILState_Ensure();\n\tPyObject *func = PyObject_GetAttrString(data->instance, funcName);\n\tif (func)\n\t{\n\t\tPyObject *arg0 = Python_fromSWIG(returned);\n\t\tPyObject *arg1 = Python_fromSWIG(parentKey);\n\t\tPyObject *args = Py_BuildValue(\"(OO)\", arg0, arg1);\n\t\tret = Python_CallFunction_Int(data, func, args, parentKey);\n\t\tPy_DECREF(arg0);\n\t\tPy_DECREF(arg1);\n\t\tPy_DECREF(args);\n\t\tPy_DECREF(func);\n\t}\n\tPyGILState_Release(gstate);\n\treturn ret;\n}\n\nstatic int Python_AppendToSysPath(const char *path)\n{\n\tif (path == NULL)\n\t\treturn 0;\n\n\tPyGILState_STATE gstate = PyGILState_Ensure();\n\tPyObject *sysPath = PySys_GetObject((char *)\"path\");\n\tPyObject *pyPath = PyUnicode_FromString(path);\n\tPyList_Append(sysPath, pyPath);\n\tPy_DECREF(pyPath);\n\tPyGILState_Release(gstate);\n\treturn 1;\n}\n\nstatic pthread_mutex_t mutex = PTHREAD_MUTEX_INITIALIZER;\nstatic unsigned open_cnt = 0;\n\nint PYTHON_PLUGIN_FUNCTION(Open)(ckdb::Plugin *handle, ckdb::Key *errorKey)\n{\n\t\/* store modules *\/\n\tmoduleData *data = new moduleData;\n\tdata->instance = NULL;\n\tdata->printError = 0;\n\tdata->shutdown = 0;\n\telektraPluginSetData(handle, data);\n\n\tKeySet *config = elektraPluginGetConfig(handle);\n\tdata->printError = (ksLookupByName(config, \"\/print\", 0) != NULL);\n\tdata->shutdown = (ksLookupByName(config, \"\/shutdown\", 0) != NULL);\n\n\tKey *script = ksLookupByName(config, \"\/script\", 0);\n\tif (script == NULL)\n\t\treturn 0; \/\/ success if no script to execute\n\tif (keyString(script) == NULL)\n\t{\n\t\tELEKTRA_SET_ERROR(111, errorKey, \"No python script set\");\n\t\treturn -1;\n\t}\n\n\t\/* initialize python interpreter - only once *\/\n\tpthread_mutex_lock(&mutex);\n\tif (!Py_IsInitialized())\n\t{\n\t\tPy_Initialize();\n\t\tPyEval_InitThreads();\n\t\tif (!Py_IsInitialized())\n\t\t{\n\t\t\tpthread_mutex_unlock(&mutex);\n\t\t\treturn -1;\n\t\t}\n\t}\n\topen_cnt++;\n\tpthread_mutex_unlock(&mutex);\n\n\t\/* import kdb *\/\n\tPyObject *kdbModule = Python_ImportModule(\"kdb\");\n\tif (kdbModule == NULL)\n\t{\n\t\tELEKTRA_SET_ERROR(111, errorKey, \"Unable to import kdb module\");\n\t\tif (data->printError)\n\t\t\tPyErr_Print();\n\t\treturn -1;\n\t}\n\tPy_XDECREF(kdbModule);\n\n\t\/* extend sys path *\/\n\tchar *tmpScript = elektraStrDup(keyString(script));\n\tconst char *dname = dirname(tmpScript);\n\tif (!Python_AppendToSysPath(dname))\n\t{\n\t\tELEKTRA_SET_ERROR(111, errorKey, \"Unable to extend sys.path\");\n\t\telektraFree(tmpScript);\n\t\treturn -1;\n\t}\n\telektraFree(tmpScript);\n\n\t\/* import module\/script *\/\n\ttmpScript = elektraStrDup(keyString(script));\n\tchar *bname = basename(tmpScript);\n\tsize_t bname_len = strlen(bname);\n\tif (bname_len >= 4 && strcmp(bname + bname_len - 3, \".py\") == 0)\n\t\tbname[bname_len - 3] = '\\0';\n\n\tPyObject *pModule = Python_ImportModule(bname);\n\tif (pModule == NULL)\n\t{\n\t\tELEKTRA_SET_ERRORF(111, errorKey,\"Unable to import python script %s\",\n\t\t\t\tkeyString(script));\n\t\tif (data->printError)\n\t\t\tPyErr_Print();\n\t\telektraFree(tmpScript);\n\t\treturn -1;\n\t}\n\telektraFree(tmpScript);\n\n\t\/* get class *\/\n\tPyGILState_STATE gstate = PyGILState_Ensure();\n\tPyObject *klass = PyObject_GetAttrString(pModule, \"ElektraPlugin\");\n\tPy_DECREF(pModule);\n\tPyGILState_Release(gstate);\n\tif (klass == NULL)\n\t{\n\t\tELEKTRA_SET_ERROR(111, errorKey,\n\t\t\t\t\"Module doesn't provide a ElektraPlugin class\");\n\t\tif (data->printError)\n\t\t\tPyErr_Print();\n\t\treturn -1;\n\t}\n\n\t\/* create instance of class *\/\n\tgstate = PyGILState_Ensure();\n\tPyObject *inst_args = Py_BuildValue(\"()\");\n\tPyObject *inst = PyEval_CallObject(klass, inst_args);\n\tPy_DECREF(klass);\n\tPy_DECREF(inst_args);\n\tPyGILState_Release(gstate);\n\tif (inst == NULL)\n\t{\n\t\tELEKTRA_SET_ERROR(111, errorKey,\n\t\t\t\t\"Unable to create instance of ElektraPlugin\");\n\t\tif (data->printError)\n\t\t\tPyErr_Print();\n\t\treturn -1;\n\t}\n\tdata->instance = inst;\n\n\t\/* call python function *\/\n\treturn Python_CallFunction_Helper1(data, \"open\", errorKey);\n}\n\nint PYTHON_PLUGIN_FUNCTION(Close)(ckdb::Plugin *handle, ckdb::Key *errorKey)\n{\n\tmoduleData *data = static_cast<moduleData *>(elektraPluginGetData(handle));\n\tif (data == NULL)\n\t\treturn 0;\n\n\t\/* call python function *\/\n\tint ret = 0;\n\tif (data->instance != NULL)\n\t{\n\t\tPyGILState_STATE gstate = PyGILState_Ensure();\n\t\tret = Python_CallFunction_Helper1(data, \"close\", errorKey);\n\n\t\t\/* clean up references *\/\n\t\tPy_DECREF(data->instance);\n\t\tdata->instance = NULL;\n\t\tPyGILState_Release(gstate);\n\t}\n\n\t\/* destroy python if plugin isn't used anymore *\/\n\t\/\/FIXME python reinitialization is known to be buggy\n\tpthread_mutex_lock(&mutex);\n\topen_cnt--;\n\tif (!open_cnt && data->shutdown && Py_IsInitialized())\n\t\tPy_Finalize();\n\tpthread_mutex_unlock(&mutex);\n\n\tdelete data;\n\treturn ret;\n}\n\nint PYTHON_PLUGIN_FUNCTION(Get)(ckdb::Plugin *handle, ckdb::KeySet *returned,\n\tckdb::Key *parentKey)\n{\n#define _MODULE_CONFIG_PATH \"system\/elektra\/modules\/\" PYTHON_PLUGIN_NAME_STR\n\tif (!strcmp(keyName(parentKey), _MODULE_CONFIG_PATH))\n\t{\n\t\tKeySet *n;\n\t\tksAppend(returned, n = ksNew(30,\n\t\t\tkeyNew(_MODULE_CONFIG_PATH,\n\t\t\t\tKEY_VALUE, \"python interpreter waits for your orders\", KEY_END),\n\t\t\tkeyNew(_MODULE_CONFIG_PATH \"\/exports\", KEY_END),\n\t\t\tkeyNew(_MODULE_CONFIG_PATH \"\/exports\/get\",\n\t\t\t\tKEY_FUNC, PYTHON_PLUGIN_FUNCTION(Get),\n\t\t\t\tKEY_END),\n\t\t\tkeyNew(_MODULE_CONFIG_PATH \"\/exports\/set\",\n\t\t\t\tKEY_FUNC, PYTHON_PLUGIN_FUNCTION(Set),\n\t\t\t\tKEY_END),\n\t\t\tkeyNew(_MODULE_CONFIG_PATH \"\/exports\/error\",\n\t\t\t\tKEY_FUNC, PYTHON_PLUGIN_FUNCTION(Error),\n\t\t\t\tKEY_END),\n\t\t\tkeyNew(_MODULE_CONFIG_PATH \"\/exports\/open\",\n\t\t\t\tKEY_FUNC, PYTHON_PLUGIN_FUNCTION(Open),\n\t\t\t\tKEY_END),\n\t\t\tkeyNew(_MODULE_CONFIG_PATH \"\/exports\/close\",\n\t\t\t\tKEY_FUNC, PYTHON_PLUGIN_FUNCTION(Close),\n\t\t\t\tKEY_END),\n#define __readme_header(x) __readme_header2(x)\n#define __readme_header2(x) __stringify(readme_##x.c)\n#include __readme_header(PYTHON_PLUGIN_NAME)\n\t\t\tkeyNew(_MODULE_CONFIG_PATH \"\/infos\/version\",\n\t\t\t\tKEY_VALUE, PLUGINVERSION, KEY_END),\n\t\t\tKS_END));\n\t\tksDel(n);\n\t}\n\n\tmoduleData *data = static_cast<moduleData *>(elektraPluginGetData(handle));\n\tif (data != NULL && data->instance != NULL)\n\t\treturn Python_CallFunction_Helper2(data, \"get\", returned,\n\t\t\t\tparentKey);\n\treturn 0;\n}\n\nint PYTHON_PLUGIN_FUNCTION(Set)(ckdb::Plugin *handle, ckdb::KeySet *returned,\n\tckdb::Key *parentKey)\n{\n\tmoduleData *data = static_cast<moduleData *>(elektraPluginGetData(handle));\n\tif (data != NULL && data->instance != NULL)\n\t\treturn Python_CallFunction_Helper2(data, \"set\", returned,\n\t\t\t\tparentKey);\n\treturn 0;\n}\n\nint PYTHON_PLUGIN_FUNCTION(Error)(ckdb::Plugin *handle, ckdb::KeySet *returned,\n\tckdb::Key *parentKey)\n{\n\tmoduleData *data = static_cast<moduleData *>(elektraPluginGetData(handle));\n\tif (data != NULL && data->instance != NULL)\n\t\treturn Python_CallFunction_Helper2(data, \"error\", returned,\n\t\t\t\tparentKey);\n\treturn 0;\n}\n\nckdb::Plugin *PYTHON_PLUGIN_EXPORT(PYTHON_PLUGIN_NAME)\n{\n\treturn elektraPluginExport(PYTHON_PLUGIN_NAME_STR,\n\t\tELEKTRA_PLUGIN_OPEN, &PYTHON_PLUGIN_FUNCTION(Open),\n\t\tELEKTRA_PLUGIN_CLOSE, &PYTHON_PLUGIN_FUNCTION(Close),\n\t\tELEKTRA_PLUGIN_GET, &PYTHON_PLUGIN_FUNCTION(Get),\n\t\tELEKTRA_PLUGIN_SET, &PYTHON_PLUGIN_FUNCTION(Set),\n\t\tELEKTRA_PLUGIN_ERROR, &PYTHON_PLUGIN_FUNCTION(Error),\n\t\tELEKTRA_PLUGIN_END);\n}\n}\n<commit_msg>python: fix small memleak if plugin cannot be initialized<commit_after>\/**\n * \\file\n *\n * \\brief Plugin which acts as proxy and calls other plugins written in python\n *\n * \\copyright BSD License (see doc\/COPYING or http:\/\/www.libelektra.org)\n *\n *\/\n\n#ifndef SWIG_TYPE_TABLE\n# error Build system error, SWIG_TYPE_TABLE is not defined\n#endif\n\n#include <Python.h>\n\n#ifndef HAVE_KDBCONFIG\n# include <kdbconfig.h>\n#endif\n#include <kdbhelper.h>\n#include SWIG_RUNTIME\n#include \"python.hpp\"\n\n#include <key.hpp>\n#include <keyset.hpp>\n#include <libgen.h>\n#include <pthread.h>\n#include <iostream>\n\nusing namespace ckdb;\n#include <kdberrors.h>\n\n#define __stringify(x) __stringify2(x)\n#define __stringify2(x) #x\n#define PYTHON_PLUGIN_NAME_STR __stringify(PYTHON_PLUGIN_NAME)\n\nstatic PyObject *Python_fromSWIG(ckdb::Key *key)\n{\n\tswig_type_info *ti = SWIG_TypeQuery(\"kdb::Key *\");\n\tif (key == NULL || ti == NULL)\n\t\treturn Py_None;\n\treturn SWIG_NewPointerObj(new kdb::Key(key), ti, 0);\n}\n\nstatic PyObject *Python_fromSWIG(ckdb::KeySet *keyset)\n{\n\tswig_type_info *ti = SWIG_TypeQuery(\"kdb::KeySet *\");\n\tif (keyset == NULL || ti == NULL)\n\t\treturn Py_None;\n\treturn SWIG_NewPointerObj(new kdb::KeySet(keyset), ti, 0);\n}\n\nextern \"C\"\n{\n\ntypedef struct\n{\n\tPyObject *instance;\n\tint printError;\n\tint shutdown;\n} moduleData;\n\n\/* pythons repr() - a little debug helper - misses all Py_DECREF calls! *\/\n#define Python_Repr(obj) \\\n\tPyBytes_AS_STRING( \\\n\t\tPyUnicode_AsEncodedString(PyObject_Repr(obj), \"utf-8\", \"Error ~\") \\\n\t)\n\nstatic PyObject *Python_ImportModule(const char *name)\n{\n\tif (!name)\n\t\treturn NULL;\n\n\tPyGILState_STATE gstate = PyGILState_Ensure();\n\tPyObject *module = PyImport_ImportModule(name);\n\tPyGILState_Release(gstate);\n\treturn module;\n}\n\nstatic PyObject *Python_CallFunction(PyObject *object, PyObject *args)\n{\n\tPyGILState_STATE gstate = PyGILState_Ensure();\n\n\tif (!PyCallable_Check(object))\n\t{\n\t\tPyGILState_Release(gstate);\n\t\treturn NULL;\n\t}\n\n\tPyObject *res = PyObject_CallObject(object, args ? args : PyTuple_New (0));\n\tPyGILState_Release(gstate);\n\tPy_XINCREF(res);\n\treturn res;\n}\n\nstatic int Python_CallFunction_Int(moduleData *data, PyObject *object,\n\t\tPyObject *args, ckdb::Key *errorKey)\n{\n\tint ret = -1;\n\tPyGILState_STATE gstate = PyGILState_Ensure();\n\n\tPyObject *res = Python_CallFunction(object, args);\n\tif (!res)\n\t{\n\t\tELEKTRA_SET_ERROR(111, errorKey,\n\t\t\t\t\"Error while calling python function\");\n\t\tif (data->printError)\n\t\t\tPyErr_Print();\n\t}\n\telse\n\t{\n#if PY_MAJOR_VERSION >= 3\n\t\tif (!PyLong_Check(res))\n#else\n\t\tif (!PyInt_Check(res))\n#endif\n\t\t\tELEKTRA_SET_ERROR(111, errorKey,\n\t\t\t\t\t\"Error: return value is no integer\");\n\t\telse\n\t\t\tret = PyLong_AsLong(res);\n\t}\n\n\tPyGILState_Release(gstate);\n\tPy_XDECREF(res);\n\treturn ret;\n}\n\nstatic int Python_CallFunction_Helper1(moduleData *data, const char *funcName,\n\tckdb::Key *errorKey)\n{\n\tint ret = 0;\n\tPyGILState_STATE gstate = PyGILState_Ensure();\n\tPyObject *func = PyObject_GetAttrString(data->instance, funcName);\n\tif (func)\n\t{\n\t\tPyObject *arg0 = Python_fromSWIG(errorKey);\n\t\tPyObject *args = Py_BuildValue(\"(O)\", arg0);\n\t\tret = Python_CallFunction_Int(data, func, args, errorKey);\n\t\tPy_DECREF(arg0);\n\t\tPy_DECREF(args);\n\t\tPy_DECREF(func);\n\t}\n\tPyGILState_Release(gstate);\n\treturn ret;\n}\n\nstatic int Python_CallFunction_Helper2(moduleData *data, const char *funcName,\n\tckdb::KeySet *returned, ckdb::Key *parentKey)\n{\n\tint ret = 0;\n\tPyGILState_STATE gstate = PyGILState_Ensure();\n\tPyObject *func = PyObject_GetAttrString(data->instance, funcName);\n\tif (func)\n\t{\n\t\tPyObject *arg0 = Python_fromSWIG(returned);\n\t\tPyObject *arg1 = Python_fromSWIG(parentKey);\n\t\tPyObject *args = Py_BuildValue(\"(OO)\", arg0, arg1);\n\t\tret = Python_CallFunction_Int(data, func, args, parentKey);\n\t\tPy_DECREF(arg0);\n\t\tPy_DECREF(arg1);\n\t\tPy_DECREF(args);\n\t\tPy_DECREF(func);\n\t}\n\tPyGILState_Release(gstate);\n\treturn ret;\n}\n\nstatic int Python_AppendToSysPath(const char *path)\n{\n\tif (path == NULL)\n\t\treturn 0;\n\n\tPyGILState_STATE gstate = PyGILState_Ensure();\n\tPyObject *sysPath = PySys_GetObject((char *)\"path\");\n\tPyObject *pyPath = PyUnicode_FromString(path);\n\tPyList_Append(sysPath, pyPath);\n\tPy_DECREF(pyPath);\n\tPyGILState_Release(gstate);\n\treturn 1;\n}\n\nstatic pthread_mutex_t mutex = PTHREAD_MUTEX_INITIALIZER;\nstatic unsigned open_cnt = 0;\n\nstatic void Python_Shutdown(moduleData *data)\n{\n\t\/* destroy python if plugin isn't used anymore *\/\n\t\/\/FIXME python reinitialization is known to be buggy\n\tpthread_mutex_lock(&mutex);\n\tif (data->shutdown && Py_IsInitialized())\n\t{\n\t\tif (!--open_cnt)\n\t\t\tPy_Finalize();\n\t}\n\tpthread_mutex_unlock(&mutex);\n}\n\nint PYTHON_PLUGIN_FUNCTION(Open)(ckdb::Plugin *handle, ckdb::Key *errorKey)\n{\n\tKeySet *config = elektraPluginGetConfig(handle);\n\tKey *script = ksLookupByName(config, \"\/script\", 0);\n\tif (script == NULL)\n\t\treturn 0; \/\/ success if no script to execute\n\n\tif (keyString(script) == NULL)\n\t{\n\t\tELEKTRA_SET_ERROR(111, errorKey, \"No python script set\");\n\t\treturn -1;\n\t}\n\n\t\/* create module data *\/\n\tmoduleData *data = new moduleData;\n\tdata->instance = NULL;\n\tdata->printError = (ksLookupByName(config, \"\/print\", 0) != NULL);\n\tdata->shutdown = (ksLookupByName(config, \"\/shutdown\", 0) != NULL);\n\n\t{\n\t\t\/* initialize python interpreter - only once *\/\n\t\tpthread_mutex_lock(&mutex);\n\t\tif (!Py_IsInitialized())\n\t\t{\n\t\t\tPy_Initialize();\n\t\t\tPyEval_InitThreads();\n\t\t\tif (!Py_IsInitialized())\n\t\t\t{\n\t\t\t\tpthread_mutex_unlock(&mutex);\n\t\t\t\tgoto error;\n\t\t\t}\n\t\t}\n\t\topen_cnt++;\n\t\tpthread_mutex_unlock(&mutex);\n\n\t\t\/* import kdb *\/\n\t\tPyObject *kdbModule = Python_ImportModule(\"kdb\");\n\t\tif (kdbModule == NULL)\n\t\t{\n\t\t\tELEKTRA_SET_ERROR(111, errorKey, \"Unable to import kdb module\");\n\t\t\tgoto error_print;\n\t\t}\n\t\tPy_XDECREF(kdbModule);\n\n\t\t\/* extend sys path *\/\n\t\tchar *tmpScript = elektraStrDup(keyString(script));\n\t\tconst char *dname = dirname(tmpScript);\n\t\tif (!Python_AppendToSysPath(dname))\n\t\t{\n\t\t\tELEKTRA_SET_ERROR(111, errorKey, \"Unable to extend sys.path\");\n\t\t\telektraFree(tmpScript);\n\t\t\tgoto error;\n\t\t}\n\t\telektraFree(tmpScript);\n\n\t\t\/* import module\/script *\/\n\t\ttmpScript = elektraStrDup(keyString(script));\n\t\tchar *bname = basename(tmpScript);\n\t\tsize_t bname_len = strlen(bname);\n\t\tif (bname_len >= 4 && strcmp(bname + bname_len - 3, \".py\") == 0)\n\t\t\tbname[bname_len - 3] = '\\0';\n\n\t\tPyObject *pModule = Python_ImportModule(bname);\n\t\tif (pModule == NULL)\n\t\t{\n\t\t\tELEKTRA_SET_ERRORF(111, errorKey,\"Unable to import python script %s\",\n\t\t\t\t\tkeyString(script));\n\t\t\telektraFree(tmpScript);\n\t\t\tgoto error_print;\n\t\t}\n\t\telektraFree(tmpScript);\n\n\t\t\/* get class *\/\n\t\tPyGILState_STATE gstate = PyGILState_Ensure();\n\t\tPyObject *klass = PyObject_GetAttrString(pModule, \"ElektraPlugin\");\n\t\tPy_DECREF(pModule);\n\t\tPyGILState_Release(gstate);\n\t\tif (klass == NULL)\n\t\t{\n\t\t\tELEKTRA_SET_ERROR(111, errorKey,\n\t\t\t\t\t\"Module doesn't provide a ElektraPlugin class\");\n\t\t\tgoto error_print;\n\t\t}\n\n\t\t\/* create instance of class *\/\n\t\tgstate = PyGILState_Ensure();\n\t\tPyObject *inst_args = Py_BuildValue(\"()\");\n\t\tPyObject *inst = PyEval_CallObject(klass, inst_args);\n\t\tPy_DECREF(klass);\n\t\tPy_DECREF(inst_args);\n\t\tPyGILState_Release(gstate);\n\t\tif (inst == NULL)\n\t\t{\n\t\t\tELEKTRA_SET_ERROR(111, errorKey,\n\t\t\t\t\t\"Unable to create instance of ElektraPlugin\");\n\t\t\tgoto error_print;\n\t\t}\n\t\tdata->instance = inst;\n\t}\n\n\t\/* store module data after everything is set up *\/\n\telektraPluginSetData(handle, data);\n\n\t\/* call python function *\/\n\treturn Python_CallFunction_Helper1(data, \"open\", errorKey);\n\nerror_print:\n\tif (data->printError)\n\t\tPyErr_Print();\nerror:\n\t\/* destroy python *\/\n\tPython_Shutdown(data);\n\tdelete data;\n\treturn -1;\n}\n\nint PYTHON_PLUGIN_FUNCTION(Close)(ckdb::Plugin *handle, ckdb::Key *errorKey)\n{\n\tmoduleData *data = static_cast<moduleData *>(elektraPluginGetData(handle));\n\tif (data == NULL)\n\t\treturn 0;\n\n\t\/* call python function *\/\n\tint ret = 0;\n\tif (data != NULL)\n\t{\n\t\tPyGILState_STATE gstate = PyGILState_Ensure();\n\t\tret = Python_CallFunction_Helper1(data, \"close\", errorKey);\n\n\t\t\/* clean up references *\/\n\t\tPy_DECREF(data->instance);\n\t\tdata->instance = NULL;\n\t\tPyGILState_Release(gstate);\n\t}\n\n\t\/* destroy python *\/\n\tPython_Shutdown(data);\n\tdelete data;\n\treturn ret;\n}\n\nint PYTHON_PLUGIN_FUNCTION(Get)(ckdb::Plugin *handle, ckdb::KeySet *returned,\n\tckdb::Key *parentKey)\n{\n#define _MODULE_CONFIG_PATH \"system\/elektra\/modules\/\" PYTHON_PLUGIN_NAME_STR\n\tif (!strcmp(keyName(parentKey), _MODULE_CONFIG_PATH))\n\t{\n\t\tKeySet *n;\n\t\tksAppend(returned, n = ksNew(30,\n\t\t\tkeyNew(_MODULE_CONFIG_PATH,\n\t\t\t\tKEY_VALUE, \"python interpreter waits for your orders\", KEY_END),\n\t\t\tkeyNew(_MODULE_CONFIG_PATH \"\/exports\", KEY_END),\n\t\t\tkeyNew(_MODULE_CONFIG_PATH \"\/exports\/get\",\n\t\t\t\tKEY_FUNC, PYTHON_PLUGIN_FUNCTION(Get),\n\t\t\t\tKEY_END),\n\t\t\tkeyNew(_MODULE_CONFIG_PATH \"\/exports\/set\",\n\t\t\t\tKEY_FUNC, PYTHON_PLUGIN_FUNCTION(Set),\n\t\t\t\tKEY_END),\n\t\t\tkeyNew(_MODULE_CONFIG_PATH \"\/exports\/error\",\n\t\t\t\tKEY_FUNC, PYTHON_PLUGIN_FUNCTION(Error),\n\t\t\t\tKEY_END),\n\t\t\tkeyNew(_MODULE_CONFIG_PATH \"\/exports\/open\",\n\t\t\t\tKEY_FUNC, PYTHON_PLUGIN_FUNCTION(Open),\n\t\t\t\tKEY_END),\n\t\t\tkeyNew(_MODULE_CONFIG_PATH \"\/exports\/close\",\n\t\t\t\tKEY_FUNC, PYTHON_PLUGIN_FUNCTION(Close),\n\t\t\t\tKEY_END),\n#define __readme_header(x) __readme_header2(x)\n#define __readme_header2(x) __stringify(readme_##x.c)\n#include __readme_header(PYTHON_PLUGIN_NAME)\n\t\t\tkeyNew(_MODULE_CONFIG_PATH \"\/infos\/version\",\n\t\t\t\tKEY_VALUE, PLUGINVERSION, KEY_END),\n\t\t\tKS_END));\n\t\tksDel(n);\n\t}\n\n\tmoduleData *data = static_cast<moduleData *>(elektraPluginGetData(handle));\n\tif (data != NULL)\n\t\treturn Python_CallFunction_Helper2(data, \"get\", returned,\n\t\t\t\tparentKey);\n\treturn 0;\n}\n\nint PYTHON_PLUGIN_FUNCTION(Set)(ckdb::Plugin *handle, ckdb::KeySet *returned,\n\tckdb::Key *parentKey)\n{\n\tmoduleData *data = static_cast<moduleData *>(elektraPluginGetData(handle));\n\tif (data != NULL)\n\t\treturn Python_CallFunction_Helper2(data, \"set\", returned,\n\t\t\t\tparentKey);\n\treturn 0;\n}\n\nint PYTHON_PLUGIN_FUNCTION(Error)(ckdb::Plugin *handle, ckdb::KeySet *returned,\n\tckdb::Key *parentKey)\n{\n\tmoduleData *data = static_cast<moduleData *>(elektraPluginGetData(handle));\n\tif (data != NULL)\n\t\treturn Python_CallFunction_Helper2(data, \"error\", returned,\n\t\t\t\tparentKey);\n\treturn 0;\n}\n\nckdb::Plugin *PYTHON_PLUGIN_EXPORT(PYTHON_PLUGIN_NAME)\n{\n\treturn elektraPluginExport(PYTHON_PLUGIN_NAME_STR,\n\t\tELEKTRA_PLUGIN_OPEN, &PYTHON_PLUGIN_FUNCTION(Open),\n\t\tELEKTRA_PLUGIN_CLOSE, &PYTHON_PLUGIN_FUNCTION(Close),\n\t\tELEKTRA_PLUGIN_GET, &PYTHON_PLUGIN_FUNCTION(Get),\n\t\tELEKTRA_PLUGIN_SET, &PYTHON_PLUGIN_FUNCTION(Set),\n\t\tELEKTRA_PLUGIN_ERROR, &PYTHON_PLUGIN_FUNCTION(Error),\n\t\tELEKTRA_PLUGIN_END);\n}\n}\n<|endoftext|>"} {"text":"<commit_before>\/**\n * @file\n *\n * @brief Plugin which acts as proxy and calls other plugins written in python\n *\n * @copyright BSD License (see doc\/COPYING or http:\/\/www.libelektra.org)\n *\n *\/\n\n#ifndef SWIG_TYPE_TABLE\n#error Build system error, SWIG_TYPE_TABLE is not defined\n#endif\n\n#include <Python.h>\n\n#ifndef HAVE_KDBCONFIG\n#include <kdbconfig.h>\n#endif\n#include <kdbhelper.h>\n#include SWIG_RUNTIME\n#include \"python.hpp\"\n\n#include <key.hpp>\n#include <keyset.hpp>\n#include <libgen.h>\n#include <mutex>\n\nusing namespace ckdb;\n#include <kdberrors.h>\n\n#define PYTHON_PLUGIN_NAME_STR2(x) ELEKTRA_QUOTE (x)\n#define PYTHON_PLUGIN_NAME_STR PYTHON_PLUGIN_NAME_STR2 (PYTHON_PLUGIN_NAME)\n\nstatic PyObject * Python_fromSWIG (ckdb::Key * key)\n{\n\tswig_type_info * ti = SWIG_TypeQuery (\"kdb::Key *\");\n\tif (key == nullptr || ti == nullptr) return Py_None;\n\treturn SWIG_NewPointerObj (new kdb::Key (key), ti, 0);\n}\n\nstatic PyObject * Python_fromSWIG (ckdb::KeySet * keyset)\n{\n\tswig_type_info * ti = SWIG_TypeQuery (\"kdb::KeySet *\");\n\tif (keyset == nullptr || ti == nullptr) return Py_None;\n\treturn SWIG_NewPointerObj (new kdb::KeySet (keyset), ti, 0);\n}\n\nclass Python_LockSwap\n{\npublic:\n\tPython_LockSwap (PyThreadState * newstate)\n\t{\n\t\tgstate = PyGILState_Ensure ();\n\t\ttstate = PyThreadState_Swap (newstate);\n\t}\n\n\t~Python_LockSwap ()\n\t{\n\t\tPyThreadState_Swap (tstate);\n\t\tPyGILState_Release (gstate);\n\t}\n\nprivate:\n\tPyGILState_STATE gstate;\n\tPyThreadState * tstate;\n};\n\ntypedef struct\n{\n\tPyThreadState * tstate;\n\tPyObject * instance;\n\tint printError;\n\tint shutdown;\n} moduleData;\n\nstatic int Python_AppendToSysPath (const char * path)\n{\n\tif (path == nullptr) return 0;\n\n\tPyObject * sysPath = PySys_GetObject ((char *)\"path\");\n\tPyObject * pyPath = PyUnicode_FromString (path);\n\tPyList_Append (sysPath, pyPath);\n\tPy_DECREF (pyPath);\n\treturn 1;\n}\n\nstatic PyObject * Python_CallFunction (PyObject * object, PyObject * args)\n{\n\tif (!PyCallable_Check (object)) return nullptr;\n\n\tPyObject * res = PyObject_CallObject (object, args ? args : PyTuple_New (0));\n\tPy_XINCREF (res);\n\treturn res;\n}\n\nstatic int Python_CallFunction_Int (moduleData * data, PyObject * object, PyObject * args, ckdb::Key * errorKey)\n{\n\tint ret = -1;\n\tPyObject * res = Python_CallFunction (object, args);\n\tif (!res)\n\t{\n\t\tELEKTRA_SET_ERROR (111, errorKey, \"Error while calling python function\");\n\t\tif (data->printError) PyErr_Print ();\n\t}\n\telse\n\t{\n#if PY_MAJOR_VERSION >= 3\n\t\tif (!PyLong_Check (res))\n#else\n\t\tif (!PyInt_Check (res))\n#endif\n\t\t\tELEKTRA_SET_ERROR (111, errorKey, \"Return value is no integer\");\n\t\telse\n\t\t\tret = PyLong_AsLong (res);\n\t}\n\n\tPy_XDECREF (res);\n\treturn ret;\n}\n\nstatic int Python_CallFunction_Helper1 (moduleData * data, const char * funcName, ckdb::Key * errorKey)\n{\n\tint ret = 0;\n\tPython_LockSwap pylock (data->tstate);\n\tPyObject * func = PyObject_GetAttrString (data->instance, funcName);\n\tif (func)\n\t{\n\t\tPyObject * arg0 = Python_fromSWIG (errorKey);\n\t\tPyObject * args = Py_BuildValue (\"(O)\", arg0);\n\t\tret = Python_CallFunction_Int (data, func, args, errorKey);\n\t\tPy_DECREF (arg0);\n\t\tPy_DECREF (args);\n\t\tPy_DECREF (func);\n\t}\n\treturn ret;\n}\n\nstatic int Python_CallFunction_Helper2 (moduleData * data, const char * funcName, ckdb::KeySet * returned, ckdb::Key * parentKey)\n{\n\tint ret = 0;\n\tPython_LockSwap pylock (data->tstate);\n\tPyObject * func = PyObject_GetAttrString (data->instance, funcName);\n\tif (func)\n\t{\n\t\tPyObject * arg0 = Python_fromSWIG (returned);\n\t\tPyObject * arg1 = Python_fromSWIG (parentKey);\n\t\tPyObject * args = Py_BuildValue (\"(OO)\", arg0, arg1);\n\t\tret = Python_CallFunction_Int (data, func, args, parentKey);\n\t\tPy_DECREF (arg0);\n\t\tPy_DECREF (arg1);\n\t\tPy_DECREF (args);\n\t\tPy_DECREF (func);\n\t}\n\treturn ret;\n}\n\nstatic std::mutex mutex;\nstatic unsigned open_cnt = 0;\n\nstatic void Python_Shutdown (moduleData * data)\n{\n\t\/* destroy python if plugin isn't used anymore *\/\n\tif (Py_IsInitialized ())\n\t{\n\t\tif (data->tstate)\n\t\t{\n\t\t\tPython_LockSwap pylock (data->tstate);\n\n\t\t\t\/* clean up references *\/\n\t\t\tPy_XDECREF (data->instance);\n\t\t\tdata->instance = nullptr;\n\n\t\t\t\/* destroy sub interpreter *\/\n\t\t\tPy_EndInterpreter (data->tstate);\n\t\t}\n\t\tmutex.lock ();\n\t\tif (open_cnt && !--open_cnt && data->shutdown) \/\/ order matters!\n\t\t\tPy_Finalize ();\n\t\tmutex.unlock ();\n\t}\n}\n\nextern \"C\" {\nint PYTHON_PLUGIN_FUNCTION (Open) (ckdb::Plugin * handle, ckdb::Key * errorKey)\n{\n\tKeySet * config = elektraPluginGetConfig (handle);\n\n\tKey * script = ksLookupByName (config, \"\/script\", 0);\n\tif (script == nullptr || !strlen (keyString (script)))\n\t{\n\t\tif (ksLookupByName (config, \"\/module\", 0) != nullptr)\n\t\t{\n\t\t\treturn 0; \/\/ by convention: success if \/module exists\n\t\t}\n\t\tELEKTRA_SET_ERROR (111, errorKey, \"No python script set\");\n\t\treturn -1;\n\t}\n\n\t\/* create module data *\/\n\tauto data = new moduleData;\n\tdata->tstate = nullptr;\n\tdata->instance = nullptr;\n\tdata->printError = (ksLookupByName (config, \"\/print\", 0) != nullptr);\n\t\/* shutdown flag is integer by design. This way users can set the\n\t * expected behaviour without worring about default values\n\t *\/\n\tdata->shutdown = (ksLookupByName (config, \"\/shutdown\", 0) && !!strcmp (keyString (ksLookupByName (config, \"\/shutdown\", 0)), \"0\"));\n\n\t{\n\t\t\/* initialize python interpreter if necessary *\/\n\t\tmutex.lock ();\n\t\tif (!Py_IsInitialized ())\n\t\t{\n\t\t\tPy_Initialize ();\n\t\t\tif (!Py_IsInitialized ())\n\t\t\t{\n\t\t\t\tmutex.unlock ();\n\t\t\t\tgoto error;\n\t\t\t}\n\t\t\topen_cnt++;\n\t\t}\n\t\telse if (open_cnt) \/\/ we have initialized python before\n\t\t\topen_cnt++;\n\t\tmutex.unlock ();\n\n\t\t\/* init threads *\/\n\t\tPyEval_InitThreads ();\n\n\t\t\/* acquire GIL *\/\n\t\tPython_LockSwap pylock (nullptr);\n\n\t\t\/* create a new sub-interpreter *\/\n\t\tdata->tstate = Py_NewInterpreter ();\n\t\tif (data->tstate == nullptr)\n\t\t{\n\t\t\tELEKTRA_SET_ERROR (111, errorKey, \"Unable to create sub intepreter\");\n\t\t\tgoto error;\n\t\t}\n\t\tPyThreadState_Swap (data->tstate);\n\n\t\t\/* import kdb *\/\n\t\tPyObject * kdbModule = PyImport_ImportModule (\"kdb\");\n\t\tif (kdbModule == nullptr)\n\t\t{\n\t\t\tELEKTRA_SET_ERROR (111, errorKey, \"Unable to import kdb module\");\n\t\t\tgoto error_print;\n\t\t}\n\t\tPy_XDECREF (kdbModule);\n\n\t\t\/* extend sys path *\/\n\t\tchar * tmpScript = elektraStrDup (keyString (script));\n\t\tconst char * dname = dirname (tmpScript);\n\t\tif (!Python_AppendToSysPath (dname))\n\t\t{\n\t\t\tELEKTRA_SET_ERROR (111, errorKey, \"Unable to extend sys.path\");\n\t\t\telektraFree (tmpScript);\n\t\t\tgoto error;\n\t\t}\n\t\telektraFree (tmpScript);\n\n\t\t\/* import module\/script *\/\n\t\ttmpScript = elektraStrDup (keyString (script));\n\t\tchar * bname = basename (tmpScript);\n\t\tsize_t bname_len = strlen (bname);\n\t\tif (bname_len >= 4 && strcmp (bname + bname_len - 3, \".py\") == 0) bname[bname_len - 3] = '\\0';\n\n\t\tPyObject * pModule = PyImport_ImportModule (bname);\n\t\tif (pModule == nullptr)\n\t\t{\n\t\t\tELEKTRA_SET_ERRORF (111, errorKey, \"Unable to import python script %s\", keyString (script));\n\t\t\telektraFree (tmpScript);\n\t\t\tgoto error_print;\n\t\t}\n\t\telektraFree (tmpScript);\n\n\t\t\/* get class *\/\n\t\tPyObject * klass = PyObject_GetAttrString (pModule, \"ElektraPlugin\");\n\t\tPy_DECREF (pModule);\n\t\tif (klass == nullptr)\n\t\t{\n\t\t\tELEKTRA_SET_ERROR (111, errorKey, \"Module doesn't provide a ElektraPlugin class\");\n\t\t\tgoto error_print;\n\t\t}\n\n\t\t\/* create instance of class *\/\n\t\tPyObject * inst_args = Py_BuildValue (\"()\");\n\t\tPyObject * inst = PyEval_CallObject (klass, inst_args);\n\t\tPy_DECREF (klass);\n\t\tPy_DECREF (inst_args);\n\t\tif (inst == nullptr)\n\t\t{\n\t\t\tELEKTRA_SET_ERROR (111, errorKey, \"Unable to create instance of ElektraPlugin\");\n\t\t\tgoto error_print;\n\t\t}\n\t\tdata->instance = inst;\n\t}\n\n\t\/* store module data after everything is set up *\/\n\telektraPluginSetData (handle, data);\n\n\t\/* call python function *\/\n\treturn Python_CallFunction_Helper2 (data, \"open\", config, errorKey);\n\nerror_print:\n\tif (data->printError) PyErr_Print ();\nerror:\n\t\/* destroy python *\/\n\tPython_Shutdown (data);\n\tdelete data;\n\treturn -1;\n}\n\nint PYTHON_PLUGIN_FUNCTION (Close) (ckdb::Plugin * handle, ckdb::Key * errorKey)\n{\n\tmoduleData * data = static_cast<moduleData *> (elektraPluginGetData (handle));\n\tif (data == nullptr) return 0;\n\n\tint ret = Python_CallFunction_Helper1 (data, \"close\", errorKey);\n\n\t\/* destroy python *\/\n\tPython_Shutdown (data);\n\tdelete data;\n\treturn ret;\n}\n\nint PYTHON_PLUGIN_FUNCTION (Get) (ckdb::Plugin * handle, ckdb::KeySet * returned, ckdb::Key * parentKey)\n{\n#define _MODULE_CONFIG_PATH \"system\/elektra\/modules\/\" PYTHON_PLUGIN_NAME_STR\n\tif (!strcmp (keyName (parentKey), _MODULE_CONFIG_PATH))\n\t{\n\t\tKeySet * n;\n\t\tksAppend (returned,\n\t\t\t n = ksNew (30, keyNew (_MODULE_CONFIG_PATH, KEY_VALUE, \"python interpreter waits for your orders\", KEY_END),\n\t\t\t\t keyNew (_MODULE_CONFIG_PATH \"\/exports\", KEY_END),\n\t\t\t\t keyNew (_MODULE_CONFIG_PATH \"\/exports\/get\", KEY_FUNC, PYTHON_PLUGIN_FUNCTION (Get), KEY_END),\n\t\t\t\t keyNew (_MODULE_CONFIG_PATH \"\/exports\/set\", KEY_FUNC, PYTHON_PLUGIN_FUNCTION (Set), KEY_END),\n\t\t\t\t keyNew (_MODULE_CONFIG_PATH \"\/exports\/error\", KEY_FUNC, PYTHON_PLUGIN_FUNCTION (Error), KEY_END),\n\t\t\t\t keyNew (_MODULE_CONFIG_PATH \"\/exports\/open\", KEY_FUNC, PYTHON_PLUGIN_FUNCTION (Open), KEY_END),\n\t\t\t\t keyNew (_MODULE_CONFIG_PATH \"\/exports\/close\", KEY_FUNC, PYTHON_PLUGIN_FUNCTION (Close), KEY_END),\n#include ELEKTRA_README (PYTHON_PLUGIN_NAME)\n\t\t\t\t keyNew (_MODULE_CONFIG_PATH \"\/infos\/version\", KEY_VALUE, PLUGINVERSION, KEY_END), KS_END));\n\t\tksDel (n);\n\t}\n\n\tmoduleData * data = static_cast<moduleData *> (elektraPluginGetData (handle));\n\tif (data != nullptr) return Python_CallFunction_Helper2 (data, \"get\", returned, parentKey);\n\treturn 0;\n}\n\nint PYTHON_PLUGIN_FUNCTION (Set) (ckdb::Plugin * handle, ckdb::KeySet * returned, ckdb::Key * parentKey)\n{\n\tmoduleData * data = static_cast<moduleData *> (elektraPluginGetData (handle));\n\tif (data != nullptr) return Python_CallFunction_Helper2 (data, \"set\", returned, parentKey);\n\treturn 0;\n}\n\nint PYTHON_PLUGIN_FUNCTION (Error) (ckdb::Plugin * handle, ckdb::KeySet * returned, ckdb::Key * parentKey)\n{\n\tmoduleData * data = static_cast<moduleData *> (elektraPluginGetData (handle));\n\tif (data != nullptr) return Python_CallFunction_Helper2 (data, \"error\", returned, parentKey);\n\treturn 0;\n}\n\nckdb::Plugin * PYTHON_PLUGIN_EXPORT (PYTHON_PLUGIN_NAME)\n{\n\t\/\/ clang-format off\n\treturn elektraPluginExport(PYTHON_PLUGIN_NAME_STR,\n\t\tELEKTRA_PLUGIN_OPEN, &PYTHON_PLUGIN_FUNCTION(Open),\n\t\tELEKTRA_PLUGIN_CLOSE, &PYTHON_PLUGIN_FUNCTION(Close),\n\t\tELEKTRA_PLUGIN_GET, &PYTHON_PLUGIN_FUNCTION(Get),\n\t\tELEKTRA_PLUGIN_SET, &PYTHON_PLUGIN_FUNCTION(Set),\n\t\tELEKTRA_PLUGIN_ERROR, &PYTHON_PLUGIN_FUNCTION(Error),\n\t\tELEKTRA_PLUGIN_END);\n}\n}\n<commit_msg>python: fix typo<commit_after>\/**\n * @file\n *\n * @brief Plugin which acts as proxy and calls other plugins written in python\n *\n * @copyright BSD License (see doc\/COPYING or http:\/\/www.libelektra.org)\n *\n *\/\n\n#ifndef SWIG_TYPE_TABLE\n#error Build system error, SWIG_TYPE_TABLE is not defined\n#endif\n\n#include <Python.h>\n\n#ifndef HAVE_KDBCONFIG\n#include <kdbconfig.h>\n#endif\n#include <kdbhelper.h>\n#include SWIG_RUNTIME\n#include \"python.hpp\"\n\n#include <key.hpp>\n#include <keyset.hpp>\n#include <libgen.h>\n#include <mutex>\n\nusing namespace ckdb;\n#include <kdberrors.h>\n\n#define PYTHON_PLUGIN_NAME_STR2(x) ELEKTRA_QUOTE (x)\n#define PYTHON_PLUGIN_NAME_STR PYTHON_PLUGIN_NAME_STR2 (PYTHON_PLUGIN_NAME)\n\nstatic PyObject * Python_fromSWIG (ckdb::Key * key)\n{\n\tswig_type_info * ti = SWIG_TypeQuery (\"kdb::Key *\");\n\tif (key == nullptr || ti == nullptr) return Py_None;\n\treturn SWIG_NewPointerObj (new kdb::Key (key), ti, 0);\n}\n\nstatic PyObject * Python_fromSWIG (ckdb::KeySet * keyset)\n{\n\tswig_type_info * ti = SWIG_TypeQuery (\"kdb::KeySet *\");\n\tif (keyset == nullptr || ti == nullptr) return Py_None;\n\treturn SWIG_NewPointerObj (new kdb::KeySet (keyset), ti, 0);\n}\n\nclass Python_LockSwap\n{\npublic:\n\tPython_LockSwap (PyThreadState * newstate)\n\t{\n\t\tgstate = PyGILState_Ensure ();\n\t\ttstate = PyThreadState_Swap (newstate);\n\t}\n\n\t~Python_LockSwap ()\n\t{\n\t\tPyThreadState_Swap (tstate);\n\t\tPyGILState_Release (gstate);\n\t}\n\nprivate:\n\tPyGILState_STATE gstate;\n\tPyThreadState * tstate;\n};\n\ntypedef struct\n{\n\tPyThreadState * tstate;\n\tPyObject * instance;\n\tint printError;\n\tint shutdown;\n} moduleData;\n\nstatic int Python_AppendToSysPath (const char * path)\n{\n\tif (path == nullptr) return 0;\n\n\tPyObject * sysPath = PySys_GetObject ((char *)\"path\");\n\tPyObject * pyPath = PyUnicode_FromString (path);\n\tPyList_Append (sysPath, pyPath);\n\tPy_DECREF (pyPath);\n\treturn 1;\n}\n\nstatic PyObject * Python_CallFunction (PyObject * object, PyObject * args)\n{\n\tif (!PyCallable_Check (object)) return nullptr;\n\n\tPyObject * res = PyObject_CallObject (object, args ? args : PyTuple_New (0));\n\tPy_XINCREF (res);\n\treturn res;\n}\n\nstatic int Python_CallFunction_Int (moduleData * data, PyObject * object, PyObject * args, ckdb::Key * errorKey)\n{\n\tint ret = -1;\n\tPyObject * res = Python_CallFunction (object, args);\n\tif (!res)\n\t{\n\t\tELEKTRA_SET_ERROR (111, errorKey, \"Error while calling python function\");\n\t\tif (data->printError) PyErr_Print ();\n\t}\n\telse\n\t{\n#if PY_MAJOR_VERSION >= 3\n\t\tif (!PyLong_Check (res))\n#else\n\t\tif (!PyInt_Check (res))\n#endif\n\t\t\tELEKTRA_SET_ERROR (111, errorKey, \"Return value is no integer\");\n\t\telse\n\t\t\tret = PyLong_AsLong (res);\n\t}\n\n\tPy_XDECREF (res);\n\treturn ret;\n}\n\nstatic int Python_CallFunction_Helper1 (moduleData * data, const char * funcName, ckdb::Key * errorKey)\n{\n\tint ret = 0;\n\tPython_LockSwap pylock (data->tstate);\n\tPyObject * func = PyObject_GetAttrString (data->instance, funcName);\n\tif (func)\n\t{\n\t\tPyObject * arg0 = Python_fromSWIG (errorKey);\n\t\tPyObject * args = Py_BuildValue (\"(O)\", arg0);\n\t\tret = Python_CallFunction_Int (data, func, args, errorKey);\n\t\tPy_DECREF (arg0);\n\t\tPy_DECREF (args);\n\t\tPy_DECREF (func);\n\t}\n\treturn ret;\n}\n\nstatic int Python_CallFunction_Helper2 (moduleData * data, const char * funcName, ckdb::KeySet * returned, ckdb::Key * parentKey)\n{\n\tint ret = 0;\n\tPython_LockSwap pylock (data->tstate);\n\tPyObject * func = PyObject_GetAttrString (data->instance, funcName);\n\tif (func)\n\t{\n\t\tPyObject * arg0 = Python_fromSWIG (returned);\n\t\tPyObject * arg1 = Python_fromSWIG (parentKey);\n\t\tPyObject * args = Py_BuildValue (\"(OO)\", arg0, arg1);\n\t\tret = Python_CallFunction_Int (data, func, args, parentKey);\n\t\tPy_DECREF (arg0);\n\t\tPy_DECREF (arg1);\n\t\tPy_DECREF (args);\n\t\tPy_DECREF (func);\n\t}\n\treturn ret;\n}\n\nstatic std::mutex mutex;\nstatic unsigned open_cnt = 0;\n\nstatic void Python_Shutdown (moduleData * data)\n{\n\t\/* destroy python if plugin isn't used anymore *\/\n\tif (Py_IsInitialized ())\n\t{\n\t\tif (data->tstate)\n\t\t{\n\t\t\tPython_LockSwap pylock (data->tstate);\n\n\t\t\t\/* clean up references *\/\n\t\t\tPy_XDECREF (data->instance);\n\t\t\tdata->instance = nullptr;\n\n\t\t\t\/* destroy sub interpreter *\/\n\t\t\tPy_EndInterpreter (data->tstate);\n\t\t}\n\t\tmutex.lock ();\n\t\tif (open_cnt && !--open_cnt && data->shutdown) \/\/ order matters!\n\t\t\tPy_Finalize ();\n\t\tmutex.unlock ();\n\t}\n}\n\nextern \"C\" {\nint PYTHON_PLUGIN_FUNCTION (Open) (ckdb::Plugin * handle, ckdb::Key * errorKey)\n{\n\tKeySet * config = elektraPluginGetConfig (handle);\n\n\tKey * script = ksLookupByName (config, \"\/script\", 0);\n\tif (script == nullptr || !strlen (keyString (script)))\n\t{\n\t\tif (ksLookupByName (config, \"\/module\", 0) != nullptr)\n\t\t{\n\t\t\treturn 0; \/\/ by convention: success if \/module exists\n\t\t}\n\t\tELEKTRA_SET_ERROR (111, errorKey, \"No python script set\");\n\t\treturn -1;\n\t}\n\n\t\/* create module data *\/\n\tauto data = new moduleData;\n\tdata->tstate = nullptr;\n\tdata->instance = nullptr;\n\tdata->printError = (ksLookupByName (config, \"\/print\", 0) != nullptr);\n\t\/* shutdown flag is integer by design. This way users can set the\n\t * expected behaviour without worring about default values\n\t *\/\n\tdata->shutdown = (ksLookupByName (config, \"\/shutdown\", 0) && !!strcmp (keyString (ksLookupByName (config, \"\/shutdown\", 0)), \"0\"));\n\n\t{\n\t\t\/* initialize python interpreter if necessary *\/\n\t\tmutex.lock ();\n\t\tif (!Py_IsInitialized ())\n\t\t{\n\t\t\tPy_Initialize ();\n\t\t\tif (!Py_IsInitialized ())\n\t\t\t{\n\t\t\t\tmutex.unlock ();\n\t\t\t\tgoto error;\n\t\t\t}\n\t\t\topen_cnt++;\n\t\t}\n\t\telse if (open_cnt) \/\/ we have initialized python before\n\t\t\topen_cnt++;\n\t\tmutex.unlock ();\n\n\t\t\/* init threads *\/\n\t\tPyEval_InitThreads ();\n\n\t\t\/* acquire GIL *\/\n\t\tPython_LockSwap pylock (nullptr);\n\n\t\t\/* create a new sub-interpreter *\/\n\t\tdata->tstate = Py_NewInterpreter ();\n\t\tif (data->tstate == nullptr)\n\t\t{\n\t\t\tELEKTRA_SET_ERROR (111, errorKey, \"Unable to create sub interpreter\");\n\t\t\tgoto error;\n\t\t}\n\t\tPyThreadState_Swap (data->tstate);\n\n\t\t\/* import kdb *\/\n\t\tPyObject * kdbModule = PyImport_ImportModule (\"kdb\");\n\t\tif (kdbModule == nullptr)\n\t\t{\n\t\t\tELEKTRA_SET_ERROR (111, errorKey, \"Unable to import kdb module\");\n\t\t\tgoto error_print;\n\t\t}\n\t\tPy_XDECREF (kdbModule);\n\n\t\t\/* extend sys path *\/\n\t\tchar * tmpScript = elektraStrDup (keyString (script));\n\t\tconst char * dname = dirname (tmpScript);\n\t\tif (!Python_AppendToSysPath (dname))\n\t\t{\n\t\t\tELEKTRA_SET_ERROR (111, errorKey, \"Unable to extend sys.path\");\n\t\t\telektraFree (tmpScript);\n\t\t\tgoto error;\n\t\t}\n\t\telektraFree (tmpScript);\n\n\t\t\/* import module\/script *\/\n\t\ttmpScript = elektraStrDup (keyString (script));\n\t\tchar * bname = basename (tmpScript);\n\t\tsize_t bname_len = strlen (bname);\n\t\tif (bname_len >= 4 && strcmp (bname + bname_len - 3, \".py\") == 0) bname[bname_len - 3] = '\\0';\n\n\t\tPyObject * pModule = PyImport_ImportModule (bname);\n\t\tif (pModule == nullptr)\n\t\t{\n\t\t\tELEKTRA_SET_ERRORF (111, errorKey, \"Unable to import python script %s\", keyString (script));\n\t\t\telektraFree (tmpScript);\n\t\t\tgoto error_print;\n\t\t}\n\t\telektraFree (tmpScript);\n\n\t\t\/* get class *\/\n\t\tPyObject * klass = PyObject_GetAttrString (pModule, \"ElektraPlugin\");\n\t\tPy_DECREF (pModule);\n\t\tif (klass == nullptr)\n\t\t{\n\t\t\tELEKTRA_SET_ERROR (111, errorKey, \"Module doesn't provide a ElektraPlugin class\");\n\t\t\tgoto error_print;\n\t\t}\n\n\t\t\/* create instance of class *\/\n\t\tPyObject * inst_args = Py_BuildValue (\"()\");\n\t\tPyObject * inst = PyEval_CallObject (klass, inst_args);\n\t\tPy_DECREF (klass);\n\t\tPy_DECREF (inst_args);\n\t\tif (inst == nullptr)\n\t\t{\n\t\t\tELEKTRA_SET_ERROR (111, errorKey, \"Unable to create instance of ElektraPlugin\");\n\t\t\tgoto error_print;\n\t\t}\n\t\tdata->instance = inst;\n\t}\n\n\t\/* store module data after everything is set up *\/\n\telektraPluginSetData (handle, data);\n\n\t\/* call python function *\/\n\treturn Python_CallFunction_Helper2 (data, \"open\", config, errorKey);\n\nerror_print:\n\tif (data->printError) PyErr_Print ();\nerror:\n\t\/* destroy python *\/\n\tPython_Shutdown (data);\n\tdelete data;\n\treturn -1;\n}\n\nint PYTHON_PLUGIN_FUNCTION (Close) (ckdb::Plugin * handle, ckdb::Key * errorKey)\n{\n\tmoduleData * data = static_cast<moduleData *> (elektraPluginGetData (handle));\n\tif (data == nullptr) return 0;\n\n\tint ret = Python_CallFunction_Helper1 (data, \"close\", errorKey);\n\n\t\/* destroy python *\/\n\tPython_Shutdown (data);\n\tdelete data;\n\treturn ret;\n}\n\nint PYTHON_PLUGIN_FUNCTION (Get) (ckdb::Plugin * handle, ckdb::KeySet * returned, ckdb::Key * parentKey)\n{\n#define _MODULE_CONFIG_PATH \"system\/elektra\/modules\/\" PYTHON_PLUGIN_NAME_STR\n\tif (!strcmp (keyName (parentKey), _MODULE_CONFIG_PATH))\n\t{\n\t\tKeySet * n;\n\t\tksAppend (returned,\n\t\t\t n = ksNew (30, keyNew (_MODULE_CONFIG_PATH, KEY_VALUE, \"python interpreter waits for your orders\", KEY_END),\n\t\t\t\t keyNew (_MODULE_CONFIG_PATH \"\/exports\", KEY_END),\n\t\t\t\t keyNew (_MODULE_CONFIG_PATH \"\/exports\/get\", KEY_FUNC, PYTHON_PLUGIN_FUNCTION (Get), KEY_END),\n\t\t\t\t keyNew (_MODULE_CONFIG_PATH \"\/exports\/set\", KEY_FUNC, PYTHON_PLUGIN_FUNCTION (Set), KEY_END),\n\t\t\t\t keyNew (_MODULE_CONFIG_PATH \"\/exports\/error\", KEY_FUNC, PYTHON_PLUGIN_FUNCTION (Error), KEY_END),\n\t\t\t\t keyNew (_MODULE_CONFIG_PATH \"\/exports\/open\", KEY_FUNC, PYTHON_PLUGIN_FUNCTION (Open), KEY_END),\n\t\t\t\t keyNew (_MODULE_CONFIG_PATH \"\/exports\/close\", KEY_FUNC, PYTHON_PLUGIN_FUNCTION (Close), KEY_END),\n#include ELEKTRA_README (PYTHON_PLUGIN_NAME)\n\t\t\t\t keyNew (_MODULE_CONFIG_PATH \"\/infos\/version\", KEY_VALUE, PLUGINVERSION, KEY_END), KS_END));\n\t\tksDel (n);\n\t}\n\n\tmoduleData * data = static_cast<moduleData *> (elektraPluginGetData (handle));\n\tif (data != nullptr) return Python_CallFunction_Helper2 (data, \"get\", returned, parentKey);\n\treturn 0;\n}\n\nint PYTHON_PLUGIN_FUNCTION (Set) (ckdb::Plugin * handle, ckdb::KeySet * returned, ckdb::Key * parentKey)\n{\n\tmoduleData * data = static_cast<moduleData *> (elektraPluginGetData (handle));\n\tif (data != nullptr) return Python_CallFunction_Helper2 (data, \"set\", returned, parentKey);\n\treturn 0;\n}\n\nint PYTHON_PLUGIN_FUNCTION (Error) (ckdb::Plugin * handle, ckdb::KeySet * returned, ckdb::Key * parentKey)\n{\n\tmoduleData * data = static_cast<moduleData *> (elektraPluginGetData (handle));\n\tif (data != nullptr) return Python_CallFunction_Helper2 (data, \"error\", returned, parentKey);\n\treturn 0;\n}\n\nckdb::Plugin * PYTHON_PLUGIN_EXPORT (PYTHON_PLUGIN_NAME)\n{\n\t\/\/ clang-format off\n\treturn elektraPluginExport(PYTHON_PLUGIN_NAME_STR,\n\t\tELEKTRA_PLUGIN_OPEN, &PYTHON_PLUGIN_FUNCTION(Open),\n\t\tELEKTRA_PLUGIN_CLOSE, &PYTHON_PLUGIN_FUNCTION(Close),\n\t\tELEKTRA_PLUGIN_GET, &PYTHON_PLUGIN_FUNCTION(Get),\n\t\tELEKTRA_PLUGIN_SET, &PYTHON_PLUGIN_FUNCTION(Set),\n\t\tELEKTRA_PLUGIN_ERROR, &PYTHON_PLUGIN_FUNCTION(Error),\n\t\tELEKTRA_PLUGIN_END);\n}\n}\n<|endoftext|>"} {"text":"<commit_before>#include <cassert>\n#include <cstdio>\n#include <iostream>\n#include <map>\n\n#include \"Blur.h\"\n#include \"Sharpen.h\"\n#include \"Sobel.h\"\n\n#define METHOD_REFERENCE (1<<1)\n#define METHOD_HALIDE_CPU (1<<2)\n#define METHOD_HALIDE_GPU (1<<3)\n#define METHOD_OPENCL (1<<4)\n\nusing namespace improsa;\nusing namespace std;\n\nvoid printUsage();\nint updateStatus(const char *format, va_list args);\n\nmap<string, Filter*> m_filters =\n{\n {\"blur\", new Blur()},\n {\"sharpen\", new Sharpen()},\n {\"sobel\", new Sobel()},\n};\n\nmap<string, unsigned int> m_methods =\n{\n {\"reference\", METHOD_REFERENCE},\n {\"halide_cpu\", METHOD_HALIDE_CPU},\n {\"halide_gpu\", METHOD_HALIDE_GPU},\n {\"opencl\", METHOD_OPENCL},\n};\n\nint main(int argc, char *argv[])\n{\n size_t size = 0;\n Filter *filter = NULL;\n unsigned int method = 0;\n\n \/\/ Parse arguments\n for (int i = 1; i < argc; i++)\n {\n if (m_filters.find(argv[i]) != m_filters.end())\n {\n filter = m_filters[argv[i]];\n }\n else if (m_methods.find(argv[i]) != m_methods.end())\n {\n method = m_methods[argv[i]];\n }\n else\n {\n char *next;\n size_t sz = strtoul(argv[i], &next, 10);\n if (strlen(next) > 0 || size != 0 || sz == 0)\n {\n cout << \"Invalid argument '\" << argv[i] << \"'\" << endl;\n printUsage();\n exit(1);\n }\n size = sz;\n }\n }\n if (size == 0 || filter == NULL || method == 0)\n {\n printUsage();\n exit(1);\n }\n\n \/\/ Allocate input\/output images\n Image input = {new unsigned char[size*size*4], size, size};\n Image output = {new unsigned char[size*size*4], size, size};\n\n \/\/ Initialize input image with random data\n for (int y = 0; y < size; y++)\n {\n for (int x = 0; x < size; x++)\n {\n setPixel(input, x, y, 0, rand()\/RAND_MAX);\n setPixel(input, x, y, 1, rand()\/RAND_MAX);\n setPixel(input, x, y, 2, rand()\/RAND_MAX);\n setPixel(input, x, y, 3, 255);\n }\n }\n\n \/\/ Run filter\n Filter::Params params = {{0,0}};\n filter->setStatusCallback(updateStatus);\n switch (method)\n {\n case METHOD_REFERENCE:\n filter->runReference(input, output);\n break;\n case METHOD_HALIDE_CPU:\n filter->runHalideCPU(input, output, params);\n break;\n case METHOD_HALIDE_GPU:\n filter->runHalideGPU(input, output, params);\n break;\n case METHOD_OPENCL:\n filter->runOpenCL(input, output, params);\n break;\n default:\n assert(false && \"Invalid method.\");\n }\n\n return 0;\n}\n\nvoid printUsage()\n{\n cout << endl << \"Usage: improsa SIZE FILTER METHOD\" << endl;\n\n cout << endl << \"Where FILTER is one of:\" << endl;\n map<string, Filter*>::iterator fItr;\n for (fItr = m_filters.begin(); fItr != m_filters.end(); fItr++)\n {\n cout << \"\\t\" << fItr->first << endl;\n }\n\n cout << endl << \"Where METHOD is one of:\" << endl;\n map<string, unsigned int>::iterator mItr;\n for (mItr = m_methods.begin(); mItr != m_methods.end(); mItr++)\n {\n cout << \"\\t\" << mItr->first << endl;\n }\n\n cout << endl;\n}\n\nint updateStatus(const char *format, va_list args)\n{\n vprintf(format, args);\n printf(\"\\n\");\n return 0;\n}\n<commit_msg>Included cstring for strlen().<commit_after>#include <cassert>\n#include <cstdio>\n#include <cstring>\n#include <iostream>\n#include <map>\n\n#include \"Blur.h\"\n#include \"Sharpen.h\"\n#include \"Sobel.h\"\n\n#define METHOD_REFERENCE (1<<1)\n#define METHOD_HALIDE_CPU (1<<2)\n#define METHOD_HALIDE_GPU (1<<3)\n#define METHOD_OPENCL (1<<4)\n\nusing namespace improsa;\nusing namespace std;\n\nvoid printUsage();\nint updateStatus(const char *format, va_list args);\n\nmap<string, Filter*> m_filters =\n{\n {\"blur\", new Blur()},\n {\"sharpen\", new Sharpen()},\n {\"sobel\", new Sobel()},\n};\n\nmap<string, unsigned int> m_methods =\n{\n {\"reference\", METHOD_REFERENCE},\n {\"halide_cpu\", METHOD_HALIDE_CPU},\n {\"halide_gpu\", METHOD_HALIDE_GPU},\n {\"opencl\", METHOD_OPENCL},\n};\n\nint main(int argc, char *argv[])\n{\n size_t size = 0;\n Filter *filter = NULL;\n unsigned int method = 0;\n\n \/\/ Parse arguments\n for (int i = 1; i < argc; i++)\n {\n if (m_filters.find(argv[i]) != m_filters.end())\n {\n filter = m_filters[argv[i]];\n }\n else if (m_methods.find(argv[i]) != m_methods.end())\n {\n method = m_methods[argv[i]];\n }\n else\n {\n char *next;\n size_t sz = strtoul(argv[i], &next, 10);\n if (strlen(next) > 0 || size != 0 || sz == 0)\n {\n cout << \"Invalid argument '\" << argv[i] << \"'\" << endl;\n printUsage();\n exit(1);\n }\n size = sz;\n }\n }\n if (size == 0 || filter == NULL || method == 0)\n {\n printUsage();\n exit(1);\n }\n\n \/\/ Allocate input\/output images\n Image input = {new unsigned char[size*size*4], size, size};\n Image output = {new unsigned char[size*size*4], size, size};\n\n \/\/ Initialize input image with random data\n for (int y = 0; y < size; y++)\n {\n for (int x = 0; x < size; x++)\n {\n setPixel(input, x, y, 0, rand()\/RAND_MAX);\n setPixel(input, x, y, 1, rand()\/RAND_MAX);\n setPixel(input, x, y, 2, rand()\/RAND_MAX);\n setPixel(input, x, y, 3, 255);\n }\n }\n\n \/\/ Run filter\n Filter::Params params = {{0,0}};\n filter->setStatusCallback(updateStatus);\n switch (method)\n {\n case METHOD_REFERENCE:\n filter->runReference(input, output);\n break;\n case METHOD_HALIDE_CPU:\n filter->runHalideCPU(input, output, params);\n break;\n case METHOD_HALIDE_GPU:\n filter->runHalideGPU(input, output, params);\n break;\n case METHOD_OPENCL:\n filter->runOpenCL(input, output, params);\n break;\n default:\n assert(false && \"Invalid method.\");\n }\n\n return 0;\n}\n\nvoid printUsage()\n{\n cout << endl << \"Usage: improsa SIZE FILTER METHOD\" << endl;\n\n cout << endl << \"Where FILTER is one of:\" << endl;\n map<string, Filter*>::iterator fItr;\n for (fItr = m_filters.begin(); fItr != m_filters.end(); fItr++)\n {\n cout << \"\\t\" << fItr->first << endl;\n }\n\n cout << endl << \"Where METHOD is one of:\" << endl;\n map<string, unsigned int>::iterator mItr;\n for (mItr = m_methods.begin(); mItr != m_methods.end(); mItr++)\n {\n cout << \"\\t\" << mItr->first << endl;\n }\n\n cout << endl;\n}\n\nint updateStatus(const char *format, va_list args)\n{\n vprintf(format, args);\n printf(\"\\n\");\n return 0;\n}\n<|endoftext|>"} {"text":"<commit_before>\/****************************************************************************\n**\n** This file is part of QtCompositor**\n**\n** Copyright © 2010 Nokia Corporation and\/or its subsidiary(-ies).\n** All rights reserved.\n**\n** Contact: Nokia Corporation qt-info@nokia.com\n**\n** You may use this file under the terms of the BSD license as follows:\n**\n** Redistribution and use in source and binary forms, with or without\n** modification, are permitted provided that the following conditions are\n** met:\n**\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 Nokia Corporation and its Subsidiary(-ies) 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** 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 \"wlsurface.h\"\n\n#include \"..\/waylandsurface.h\"\n\n#include \"wlcompositor.h\"\n#include \"wlshmbuffer.h\"\n\n#include <QtCore\/QDebug>\n\n#include <wayland-server.h>\n\n#include <linux\/input.h>\n\n#ifdef QT_COMPOSITOR_WAYLAND_GL\n#include \"..\/graphicshardwareintegration.cpp\"\n#include <QtGui\/QPlatformGLContext>\n#endif\n\nnamespace Wayland {\n\nclass SurfacePrivate\n{\npublic:\n SurfacePrivate(struct wl_client *client, Compositor *compositor)\n : client(client)\n , compositor(compositor)\n {\n type = WaylandSurface::Invalid;\n#ifdef QT_COMPOSITOR_WAYLAND_GL\n texture_id = 0;\n#endif\n }\n\n WaylandSurface::Type type;\n QRect rect;\n struct wl_client *client;\n Compositor *compositor;\n WaylandSurface *qtSurface;\n\n ShmBuffer *shm_buffer;\n#ifdef QT_COMPOSITOR_WAYLAND_GL\n GLuint texture_id;\n#endif\n};\n\n\n\nvoid surface_destroy(struct wl_client *client, struct wl_surface *surface)\n{\n wl_resource_destroy(&surface->resource, client);\n}\n\nvoid surface_attach(struct wl_client *client, struct wl_surface *surface,\n struct wl_buffer *buffer, int x, int y)\n{\n Q_UNUSED(client);\n Q_UNUSED(x);\n Q_UNUSED(y);\n\n if (buffer->attach) {\n wayland_cast<Surface *>(surface)->attachShm(wayland_cast<ShmBuffer *>(buffer));\n }\n#ifdef QT_COMPOSITOR_WAYLAND_GL\n else {\n wayland_cast<Surface *>(surface)->attachHWBuffer(buffer);\n }\n#endif \/\/QT_COMPOSITOR_WAYLAND_EGL\n}\n\nvoid surface_map_toplevel(struct wl_client *client,\n struct wl_surface *surface)\n{\n Q_UNUSED(client);\n printf(\"surface_map_toplevel: %p, %p\", client, surface);\n\n wayland_cast<Surface *>(surface)->mapTopLevel();\n}\n\nvoid surface_map_transient(struct wl_client *client,\n struct wl_surface *surface,\n struct wl_surface *parent,\n int x,\n int y,\n uint32_t flags)\n{\n Q_UNUSED(client);\n Q_UNUSED(surface);\n Q_UNUSED(parent);\n Q_UNUSED(x);\n Q_UNUSED(y);\n Q_UNUSED(flags);\n printf(\"surface_map_transient: %p, %p\", client, surface);\n}\n\nvoid surface_map_fullscreen(struct wl_client *client,\n struct wl_surface *surface)\n{\n Q_UNUSED(client);\n Q_UNUSED(surface);\n printf(\"surface_map_fullscreen: %p, %p\", client, surface);\n}\n\nvoid surface_damage(struct wl_client *client, struct wl_surface *surface,\n int32_t x, int32_t y, int32_t width, int32_t height)\n{\n Q_UNUSED(client);\n wayland_cast<Surface *>(surface)->damage(QRect(x, y, width, height));\n}\n\nSurface::Surface(struct wl_client *client, Compositor *compositor)\n : d_ptr(new SurfacePrivate(client,compositor))\n{\n base()->client = client;\n wl_list_init(&base()->destroy_listener_list);\n d_ptr->qtSurface = new WaylandSurface(this);\n\n}\n\nSurface::~Surface()\n{\n Q_D(Surface);\n d->compositor->surfaceDestroyed(this);\n delete d->qtSurface;\n}\n\nWaylandSurface::Type Surface::type() const\n{\n Q_D(const Surface);\n return d->type;\n}\n\nvoid Surface::damage(const QRect &rect)\n{\n Q_D(Surface);\n emit d->qtSurface->damaged(rect);\n}\n\nQImage Surface::image() const\n{\n Q_D(const Surface);\n if (d->type == WaylandSurface::Shm) {\n return d->shm_buffer->image();\n }\n return QImage();\n}\n\n#ifdef QT_COMPOSITOR_WAYLAND_GL\n\nvoid Surface::attachHWBuffer(struct wl_buffer *buffer)\n{\n Q_D(Surface);\n d->type = WaylandSurface::Texture;\n\n \/\/make current for the topLevel. We could have used the eglContext,\n \/\/but then we would need to handle eglSurfaces as well.\n d->compositor->topLevelWidget()->platformWindow()->glContext()->makeCurrent();\n\n glDeleteTextures(1,&d->texture_id);\n\n d->texture_id = d->compositor->graphicsHWIntegration()->createTextureFromBuffer(buffer);\n emit d->qtSurface->mapped(QRect(QPoint(), QSize(buffer->width, buffer->height)));\n}\n\nGLuint Surface::textureId() const\n{\n Q_D(const Surface);\n return d->texture_id;\n}\n#endif \/\/ QT_COMPOSITOR_WAYLAND_GL\n\nvoid Surface::attachShm(Wayland::ShmBuffer *shm_buffer)\n{\n Q_D(Surface);\n d->shm_buffer = shm_buffer;\n d->type = WaylandSurface::Shm;\n emit d->qtSurface->mapped(QRect(QPoint(), shm_buffer->size()));\n}\n\n\nvoid Surface::mapTopLevel()\n{\n Q_D(Surface);\n d->rect = QRect(0, 0, 200, 200);\n}\n\nWaylandSurface * Surface::handle() const\n{\n Q_D(const Surface);\n return d->qtSurface;\n}\n\nuint32_t toWaylandButton(Qt::MouseButton button)\n{\n switch (button) {\n case Qt::LeftButton:\n return BTN_LEFT;\n case Qt::RightButton:\n return BTN_RIGHT;\n default:\n return BTN_MIDDLE;\n }\n}\n\nvoid Surface::sendMousePressEvent(int x, int y, Qt::MouseButton button)\n{\n Q_D(Surface);\n if (d->client) {\n uint32_t time = d->compositor->currentTimeMsecs();\n wl_client_post_event(d->client, &d->compositor->defaultInputDevice()->object,\n WL_INPUT_DEVICE_BUTTON, time, toWaylandButton(button), 1);\n }\n sendMouseMoveEvent(x, y);\n}\n\nvoid Surface::sendMouseReleaseEvent(int x, int y, Qt::MouseButton button)\n{\n Q_D(Surface);\n if (d->client)\n wl_client_post_event(d->client, &d->compositor->defaultInputDevice()->object,\n WL_INPUT_DEVICE_BUTTON, d->compositor->currentTimeMsecs(), toWaylandButton(button), 0);\n sendMouseMoveEvent(x, y);\n}\n\nvoid Surface::sendMouseMoveEvent(int x, int y)\n{\n Q_D(Surface);\n if (d->client) {\n uint32_t time = d->compositor->currentTimeMsecs();\n wl_input_device_set_pointer_focus(d->compositor->defaultInputDevice(),\n base(), time, x, y, x, y);\n wl_client_post_event(d->client, &d->compositor->defaultInputDevice()->object,\n WL_INPUT_DEVICE_MOTION, time, x, y, x, y);\n }\n}\n\nvoid Surface::sendKeyPressEvent(uint code)\n{\n Q_D(Surface);\n if (d->compositor->defaultInputDevice()->keyboard_focus != NULL) {\n uint32_t time = d->compositor->currentTimeMsecs();\n wl_client_post_event(d->client, &d->compositor->defaultInputDevice()->object,\n WL_INPUT_DEVICE_KEY, time, code - 8, 1);\n }\n\n}\n\nvoid Surface::sendKeyReleaseEvent(uint code)\n{\n Q_D(Surface);\n if (d->compositor->defaultInputDevice()->keyboard_focus != NULL) {\n uint32_t time = d->compositor->currentTimeMsecs();\n wl_client_post_event(d->client, &d->compositor->defaultInputDevice()->object,\n WL_INPUT_DEVICE_KEY, time, code - 8, 0);\n }\n}\n\nvoid Surface::setInputFocus()\n{\n Q_D(Surface);\n ulong time = d->compositor->currentTimeMsecs();\n\n wl_input_device_set_keyboard_focus(d->compositor->defaultInputDevice(), base(), time);\n wl_input_device_set_pointer_focus(d->compositor->defaultInputDevice(), base(), time, 0, 0, 0, 0);\n}\n\n}\n<commit_msg>Fixed wrong coordinates sent for button press events.<commit_after>\/****************************************************************************\n**\n** This file is part of QtCompositor**\n**\n** Copyright © 2010 Nokia Corporation and\/or its subsidiary(-ies).\n** All rights reserved.\n**\n** Contact: Nokia Corporation qt-info@nokia.com\n**\n** You may use this file under the terms of the BSD license as follows:\n**\n** Redistribution and use in source and binary forms, with or without\n** modification, are permitted provided that the following conditions are\n** met:\n**\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 Nokia Corporation and its Subsidiary(-ies) 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** 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 \"wlsurface.h\"\n\n#include \"..\/waylandsurface.h\"\n\n#include \"wlcompositor.h\"\n#include \"wlshmbuffer.h\"\n\n#include <QtCore\/QDebug>\n\n#include <wayland-server.h>\n\n#include <linux\/input.h>\n\n#ifdef QT_COMPOSITOR_WAYLAND_GL\n#include \"..\/graphicshardwareintegration.cpp\"\n#include <QtGui\/QPlatformGLContext>\n#endif\n\nnamespace Wayland {\n\nclass SurfacePrivate\n{\npublic:\n SurfacePrivate(struct wl_client *client, Compositor *compositor)\n : client(client)\n , compositor(compositor)\n {\n type = WaylandSurface::Invalid;\n#ifdef QT_COMPOSITOR_WAYLAND_GL\n texture_id = 0;\n#endif\n }\n\n WaylandSurface::Type type;\n QRect rect;\n struct wl_client *client;\n Compositor *compositor;\n WaylandSurface *qtSurface;\n\n ShmBuffer *shm_buffer;\n#ifdef QT_COMPOSITOR_WAYLAND_GL\n GLuint texture_id;\n#endif\n};\n\n\n\nvoid surface_destroy(struct wl_client *client, struct wl_surface *surface)\n{\n wl_resource_destroy(&surface->resource, client);\n}\n\nvoid surface_attach(struct wl_client *client, struct wl_surface *surface,\n struct wl_buffer *buffer, int x, int y)\n{\n Q_UNUSED(client);\n Q_UNUSED(x);\n Q_UNUSED(y);\n\n if (buffer->attach) {\n wayland_cast<Surface *>(surface)->attachShm(wayland_cast<ShmBuffer *>(buffer));\n }\n#ifdef QT_COMPOSITOR_WAYLAND_GL\n else {\n wayland_cast<Surface *>(surface)->attachHWBuffer(buffer);\n }\n#endif \/\/QT_COMPOSITOR_WAYLAND_EGL\n}\n\nvoid surface_map_toplevel(struct wl_client *client,\n struct wl_surface *surface)\n{\n Q_UNUSED(client);\n printf(\"surface_map_toplevel: %p, %p\", client, surface);\n\n wayland_cast<Surface *>(surface)->mapTopLevel();\n}\n\nvoid surface_map_transient(struct wl_client *client,\n struct wl_surface *surface,\n struct wl_surface *parent,\n int x,\n int y,\n uint32_t flags)\n{\n Q_UNUSED(client);\n Q_UNUSED(surface);\n Q_UNUSED(parent);\n Q_UNUSED(x);\n Q_UNUSED(y);\n Q_UNUSED(flags);\n printf(\"surface_map_transient: %p, %p\", client, surface);\n}\n\nvoid surface_map_fullscreen(struct wl_client *client,\n struct wl_surface *surface)\n{\n Q_UNUSED(client);\n Q_UNUSED(surface);\n printf(\"surface_map_fullscreen: %p, %p\", client, surface);\n}\n\nvoid surface_damage(struct wl_client *client, struct wl_surface *surface,\n int32_t x, int32_t y, int32_t width, int32_t height)\n{\n Q_UNUSED(client);\n wayland_cast<Surface *>(surface)->damage(QRect(x, y, width, height));\n}\n\nSurface::Surface(struct wl_client *client, Compositor *compositor)\n : d_ptr(new SurfacePrivate(client,compositor))\n{\n base()->client = client;\n wl_list_init(&base()->destroy_listener_list);\n d_ptr->qtSurface = new WaylandSurface(this);\n\n}\n\nSurface::~Surface()\n{\n Q_D(Surface);\n d->compositor->surfaceDestroyed(this);\n delete d->qtSurface;\n}\n\nWaylandSurface::Type Surface::type() const\n{\n Q_D(const Surface);\n return d->type;\n}\n\nvoid Surface::damage(const QRect &rect)\n{\n Q_D(Surface);\n emit d->qtSurface->damaged(rect);\n}\n\nQImage Surface::image() const\n{\n Q_D(const Surface);\n if (d->type == WaylandSurface::Shm) {\n return d->shm_buffer->image();\n }\n return QImage();\n}\n\n#ifdef QT_COMPOSITOR_WAYLAND_GL\n\nvoid Surface::attachHWBuffer(struct wl_buffer *buffer)\n{\n Q_D(Surface);\n d->type = WaylandSurface::Texture;\n\n \/\/make current for the topLevel. We could have used the eglContext,\n \/\/but then we would need to handle eglSurfaces as well.\n d->compositor->topLevelWidget()->platformWindow()->glContext()->makeCurrent();\n\n glDeleteTextures(1,&d->texture_id);\n\n d->texture_id = d->compositor->graphicsHWIntegration()->createTextureFromBuffer(buffer);\n emit d->qtSurface->mapped(QRect(QPoint(), QSize(buffer->width, buffer->height)));\n}\n\nGLuint Surface::textureId() const\n{\n Q_D(const Surface);\n return d->texture_id;\n}\n#endif \/\/ QT_COMPOSITOR_WAYLAND_GL\n\nvoid Surface::attachShm(Wayland::ShmBuffer *shm_buffer)\n{\n Q_D(Surface);\n d->shm_buffer = shm_buffer;\n d->type = WaylandSurface::Shm;\n emit d->qtSurface->mapped(QRect(QPoint(), shm_buffer->size()));\n}\n\n\nvoid Surface::mapTopLevel()\n{\n Q_D(Surface);\n d->rect = QRect(0, 0, 200, 200);\n}\n\nWaylandSurface * Surface::handle() const\n{\n Q_D(const Surface);\n return d->qtSurface;\n}\n\nuint32_t toWaylandButton(Qt::MouseButton button)\n{\n switch (button) {\n case Qt::LeftButton:\n return BTN_LEFT;\n case Qt::RightButton:\n return BTN_RIGHT;\n default:\n return BTN_MIDDLE;\n }\n}\n\nvoid Surface::sendMousePressEvent(int x, int y, Qt::MouseButton button)\n{\n Q_D(Surface);\n sendMouseMoveEvent(x, y);\n if (d->client) {\n uint32_t time = d->compositor->currentTimeMsecs();\n wl_client_post_event(d->client, &d->compositor->defaultInputDevice()->object,\n WL_INPUT_DEVICE_BUTTON, time, toWaylandButton(button), 1);\n }\n}\n\nvoid Surface::sendMouseReleaseEvent(int x, int y, Qt::MouseButton button)\n{\n Q_D(Surface);\n sendMouseMoveEvent(x, y);\n if (d->client) {\n uint32_t time = d->compositor->currentTimeMsecs();\n wl_client_post_event(d->client, &d->compositor->defaultInputDevice()->object,\n WL_INPUT_DEVICE_BUTTON, time, toWaylandButton(button), 0);\n }\n}\n\nvoid Surface::sendMouseMoveEvent(int x, int y)\n{\n Q_D(Surface);\n if (d->client) {\n uint32_t time = d->compositor->currentTimeMsecs();\n wl_input_device_set_pointer_focus(d->compositor->defaultInputDevice(),\n base(), time, x, y, x, y);\n wl_client_post_event(d->client, &d->compositor->defaultInputDevice()->object,\n WL_INPUT_DEVICE_MOTION, time, x, y, x, y);\n }\n}\n\nvoid Surface::sendKeyPressEvent(uint code)\n{\n Q_D(Surface);\n if (d->compositor->defaultInputDevice()->keyboard_focus != NULL) {\n uint32_t time = d->compositor->currentTimeMsecs();\n wl_client_post_event(d->client, &d->compositor->defaultInputDevice()->object,\n WL_INPUT_DEVICE_KEY, time, code - 8, 1);\n }\n\n}\n\nvoid Surface::sendKeyReleaseEvent(uint code)\n{\n Q_D(Surface);\n if (d->compositor->defaultInputDevice()->keyboard_focus != NULL) {\n uint32_t time = d->compositor->currentTimeMsecs();\n wl_client_post_event(d->client, &d->compositor->defaultInputDevice()->object,\n WL_INPUT_DEVICE_KEY, time, code - 8, 0);\n }\n}\n\nvoid Surface::setInputFocus()\n{\n Q_D(Surface);\n ulong time = d->compositor->currentTimeMsecs();\n\n wl_input_device_set_keyboard_focus(d->compositor->defaultInputDevice(), base(), time);\n wl_input_device_set_pointer_focus(d->compositor->defaultInputDevice(), base(), time, 0, 0, 0, 0);\n}\n\n}\n<|endoftext|>"} {"text":"<commit_before>\/**\n * Render Pipeline C++\n *\n * Copyright (c) 2014-2016 tobspr <tobias.springer1@gmail.com>\n * Copyright (c) 2016-2017 Center of Human-centered Interaction for Coexistence.\n *\n * Permission is hereby granted, free of charge, to any person obtaining a copy of this software\n * and associated documentation files (the \"Software\"), to deal in the Software without restriction,\n * including without limitation 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 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 copies or substantial\n * portions of the Software.\n *\n * THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR IMPLIED, INCLUDING BUT NOT\n * LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT.\n * IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY,\n * WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE\n * SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.\n *\/\n\n#pragma once\n\n#include <boost\/any.hpp>\n\n#include \"render_pipeline\/rpcore\/rpobject.hpp\"\n#include \"render_pipeline\/rpcore\/stage_manager.hpp\"\n#include \"rplibs\/yaml.hpp\"\n\nnamespace rpcore {\n\n\/\/ ************************************************************************************************\n\/** This is the base setting type, all setting types derive from this. *\/\nclass BaseType : public RPObject\n{\npublic:\n BaseType(YAML::Node& data);\n virtual ~BaseType() {}\n\n virtual std::string get_value_as_string() const = 0;\n const boost::any& get_value() const { return _value; }\n\n virtual void set_value(const YAML::Node& value) = 0;\n\n virtual void add_defines(const std::string& plugin_id,\n const std::string& setting_id, StageManager::DefinesType& defines) const;\n\n const std::string& get_type() const { return _type; }\n const std::string& get_label() const { return _label; }\n const std::string& get_description() const { return _description; }\n bool is_runtime() const { return _runtime; }\n bool is_shader_runtime() const { return _shader_runtime; }\n\nprotected:\n boost::any _value;\n std::string _type;\n std::string _label;\n std::string _description;\n bool _runtime;\n bool _shader_runtime;\n std::unordered_map<std::string, std::string> _display_conditions;\n};\n\n\/\/ ************************************************************************************************\n\/**\n * This setting stores a single type including a minimum and maximum value.\n * It is shared between integer and floating point types.\n *\/\ntemplate <class T>\nclass TemplatedType : public BaseType\n{\npublic:\n TemplatedType(YAML::Node& data);\n\n std::string get_value_as_string() const override;\n void set_value(const YAML::Node& value) override;\n virtual void set_value(T value);\n\nprotected:\n const std::string _template_type;\n T _default;\n T _minval;\n T _maxval;\n};\n\ntemplate <class T>\nTemplatedType<T>::TemplatedType(YAML::Node& data): BaseType(data), _template_type(typeid(T).name())\n{\n _default = data[\"default\"].as<T>();\n data.remove(\"default\");\n _value = _default;\n\n const std::vector<T>& setting_range = data[\"range\"].as<std::vector<T>>();\n _minval = setting_range[0];\n _maxval = setting_range[1];\n data.remove(\"range\");\n}\n\ntemplate <class T>\nstd::string TemplatedType<T>::get_value_as_string() const\n{\n return std::to_string(boost::any_cast<T>(_value));\n}\n\ntemplate <class T>\nvoid TemplatedType<T>::set_value(const YAML::Node& value)\n{\n set_value(value.as<T>());\n}\n\ntemplate <class T>\nvoid TemplatedType<T>::set_value(T value)\n{\n if (_minval <= value && value <= _maxval)\n _value = value;\n else\n error(std::string(\"Invalid value: \") + std::to_string(value));\n}\n\n\/\/ ************************************************************************************************\n\/** Template instantiation of TemplatedType using int. *\/\nusing IntType = TemplatedType<int>;\n\n\/** Template instantiation of TemplatedType using float. *\/\nusing FloatType = TemplatedType<float>;\n\n\/\/ ************************************************************************************************\n\/** Type for any power of two resolution. *\/\nclass PowerOfTwoType : public IntType\n{\npublic:\n PowerOfTwoType(YAML::Node& data);\n\n void set_value(int value) final;\n};\n\ninline PowerOfTwoType::PowerOfTwoType(YAML::Node& data): IntType(data)\n{\n}\n\ninline void PowerOfTwoType::set_value(int value)\n{\n if (_minval <= value && value <= _maxval)\n {\n \/\/ check if value is power of two.\n if (value && !(value & (value - 1)))\n _value = value;\n else\n error(\"Not a power of two: \" + std::to_string(value));\n }\n else\n {\n error(\"Invalid value: \" + std::to_string(value));\n }\n}\n\n\/\/ ************************************************************************************************\n\/** Boolean setting type. *\/\nclass BoolType : public BaseType\n{\npublic:\n BoolType(YAML::Node& data);\n\n std::string get_value_as_string() const final;\n void set_value(const YAML::Node& value) final;\n void set_value(bool value) { _value = value; }\n\nprivate:\n bool _default;\n};\n\n\/\/ ************************************************************************************************\n\/** Enumeration setting type. *\/\nclass EnumType : public BaseType\n{\npublic:\n EnumType(YAML::Node& data);\n\n std::string get_value_as_string() const final;\n void set_value(const YAML::Node& value) final;\n void set_value(const std::string& value);\n void add_defines(const std::string& plugin_id,\n const std::string& setting_id, StageManager::DefinesType& defines) const final;\n\nprivate:\n std::vector<std::string> _values;\n std::string _default;\n};\n\n\/\/ ************************************************************************************************\n\/** Type for any 2D or 3D sample sequence. *\/\nclass SampleSequenceType : public BaseType\n{\npublic:\n static const std::vector<int> POISSON_2D_SIZES;\n static const std::vector<int> POISSON_3D_SIZES;\n static const std::vector<int> HALTON_SIZES;\n\n SampleSequenceType(YAML::Node& data);\n\n std::string get_value_as_string() const final;\n void set_value(const YAML::Node& value) final;\n void set_value(const std::string& value);\n\n std::vector<std::string> get_sequences() const;\n\nprivate:\n int dimension_;\n std::string default_;\n};\n\ninline std::string SampleSequenceType::get_value_as_string() const\n{\n return boost::any_cast<const std::string&>(_value);\n}\n\ninline void SampleSequenceType::set_value(const std::string& value)\n{\n const auto& sequences = get_sequences();\n if (std::find(sequences.begin(), sequences.end(), value) == sequences.end())\n {\n error(\"Value '\" + value + \"' is not a valid sequence!\");\n return;\n }\n _value = value;\n}\n\n\/\/ ************************************************************************************************\n\/** Path type to specify paths to files. *\/\nclass PathType : public BaseType\n{\npublic:\n PathType(YAML::Node& data);\n\n std::string get_value_as_string() const final;\n void set_value(const YAML::Node& value) final;\n void set_value(const std::string& value);\n void add_defines(const std::string& plugin_id,\n const std::string& setting_id, StageManager::DefinesType& defines) const final;\n\nprivate:\n std::string _default;\n std::string _file_type;\n std::string _base_path;\n};\n\ninline std::string PathType::get_value_as_string() const\n{\n return boost::any_cast<const std::string&>(_value);\n}\n\ninline void PathType::set_value(const std::string& value)\n{\n _value = value;\n}\n\n\/\/ ************************************************************************************************\n\/**\n * Constructs a new setting from a given dataset. This method will automatically\n * instantiate a new class matching the type of the given dataset. It will fill\n * all values provided by the dataset and then return the created instance.\n *\/\nstd::shared_ptr<BaseType> make_setting_from_data(YAML::Node& data);\n\n}\n<commit_msg>Remove unused memeber data to remove RTTI<commit_after>\/**\n * Render Pipeline C++\n *\n * Copyright (c) 2014-2016 tobspr <tobias.springer1@gmail.com>\n * Copyright (c) 2016-2017 Center of Human-centered Interaction for Coexistence.\n *\n * Permission is hereby granted, free of charge, to any person obtaining a copy of this software\n * and associated documentation files (the \"Software\"), to deal in the Software without restriction,\n * including without limitation 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 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 copies or substantial\n * portions of the Software.\n *\n * THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR IMPLIED, INCLUDING BUT NOT\n * LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT.\n * IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY,\n * WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE\n * SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.\n *\/\n\n#pragma once\n\n#include <boost\/any.hpp>\n\n#include \"render_pipeline\/rpcore\/rpobject.hpp\"\n#include \"render_pipeline\/rpcore\/stage_manager.hpp\"\n#include \"rplibs\/yaml.hpp\"\n\nnamespace rpcore {\n\n\/\/ ************************************************************************************************\n\/** This is the base setting type, all setting types derive from this. *\/\nclass BaseType : public RPObject\n{\npublic:\n BaseType(YAML::Node& data);\n virtual ~BaseType() {}\n\n virtual std::string get_value_as_string() const = 0;\n const boost::any& get_value() const { return _value; }\n\n virtual void set_value(const YAML::Node& value) = 0;\n\n virtual void add_defines(const std::string& plugin_id,\n const std::string& setting_id, StageManager::DefinesType& defines) const;\n\n const std::string& get_type() const { return _type; }\n const std::string& get_label() const { return _label; }\n const std::string& get_description() const { return _description; }\n bool is_runtime() const { return _runtime; }\n bool is_shader_runtime() const { return _shader_runtime; }\n\nprotected:\n boost::any _value;\n std::string _type;\n std::string _label;\n std::string _description;\n bool _runtime;\n bool _shader_runtime;\n std::unordered_map<std::string, std::string> _display_conditions;\n};\n\n\/\/ ************************************************************************************************\n\/**\n * This setting stores a single type including a minimum and maximum value.\n * It is shared between integer and floating point types.\n *\/\ntemplate <class T>\nclass TemplatedType : public BaseType\n{\npublic:\n TemplatedType(YAML::Node& data);\n\n std::string get_value_as_string() const override;\n void set_value(const YAML::Node& value) override;\n virtual void set_value(T value);\n\nprotected:\n T _default;\n T _minval;\n T _maxval;\n};\n\ntemplate <class T>\nTemplatedType<T>::TemplatedType(YAML::Node& data): BaseType(data)\n{\n _default = data[\"default\"].as<T>();\n data.remove(\"default\");\n _value = _default;\n\n const std::vector<T>& setting_range = data[\"range\"].as<std::vector<T>>();\n _minval = setting_range[0];\n _maxval = setting_range[1];\n data.remove(\"range\");\n}\n\ntemplate <class T>\nstd::string TemplatedType<T>::get_value_as_string() const\n{\n return std::to_string(boost::any_cast<T>(_value));\n}\n\ntemplate <class T>\nvoid TemplatedType<T>::set_value(const YAML::Node& value)\n{\n set_value(value.as<T>());\n}\n\ntemplate <class T>\nvoid TemplatedType<T>::set_value(T value)\n{\n if (_minval <= value && value <= _maxval)\n _value = value;\n else\n error(std::string(\"Invalid value: \") + std::to_string(value));\n}\n\n\/\/ ************************************************************************************************\n\/** Template instantiation of TemplatedType using int. *\/\nusing IntType = TemplatedType<int>;\n\n\/** Template instantiation of TemplatedType using float. *\/\nusing FloatType = TemplatedType<float>;\n\n\/\/ ************************************************************************************************\n\/** Type for any power of two resolution. *\/\nclass PowerOfTwoType : public IntType\n{\npublic:\n PowerOfTwoType(YAML::Node& data);\n\n void set_value(int value) final;\n};\n\ninline PowerOfTwoType::PowerOfTwoType(YAML::Node& data): IntType(data)\n{\n}\n\ninline void PowerOfTwoType::set_value(int value)\n{\n if (_minval <= value && value <= _maxval)\n {\n \/\/ check if value is power of two.\n if (value && !(value & (value - 1)))\n _value = value;\n else\n error(\"Not a power of two: \" + std::to_string(value));\n }\n else\n {\n error(\"Invalid value: \" + std::to_string(value));\n }\n}\n\n\/\/ ************************************************************************************************\n\/** Boolean setting type. *\/\nclass BoolType : public BaseType\n{\npublic:\n BoolType(YAML::Node& data);\n\n std::string get_value_as_string() const final;\n void set_value(const YAML::Node& value) final;\n void set_value(bool value) { _value = value; }\n\nprivate:\n bool _default;\n};\n\n\/\/ ************************************************************************************************\n\/** Enumeration setting type. *\/\nclass EnumType : public BaseType\n{\npublic:\n EnumType(YAML::Node& data);\n\n std::string get_value_as_string() const final;\n void set_value(const YAML::Node& value) final;\n void set_value(const std::string& value);\n void add_defines(const std::string& plugin_id,\n const std::string& setting_id, StageManager::DefinesType& defines) const final;\n\nprivate:\n std::vector<std::string> _values;\n std::string _default;\n};\n\n\/\/ ************************************************************************************************\n\/** Type for any 2D or 3D sample sequence. *\/\nclass SampleSequenceType : public BaseType\n{\npublic:\n static const std::vector<int> POISSON_2D_SIZES;\n static const std::vector<int> POISSON_3D_SIZES;\n static const std::vector<int> HALTON_SIZES;\n\n SampleSequenceType(YAML::Node& data);\n\n std::string get_value_as_string() const final;\n void set_value(const YAML::Node& value) final;\n void set_value(const std::string& value);\n\n std::vector<std::string> get_sequences() const;\n\nprivate:\n int dimension_;\n std::string default_;\n};\n\ninline std::string SampleSequenceType::get_value_as_string() const\n{\n return boost::any_cast<const std::string&>(_value);\n}\n\ninline void SampleSequenceType::set_value(const std::string& value)\n{\n const auto& sequences = get_sequences();\n if (std::find(sequences.begin(), sequences.end(), value) == sequences.end())\n {\n error(\"Value '\" + value + \"' is not a valid sequence!\");\n return;\n }\n _value = value;\n}\n\n\/\/ ************************************************************************************************\n\/** Path type to specify paths to files. *\/\nclass PathType : public BaseType\n{\npublic:\n PathType(YAML::Node& data);\n\n std::string get_value_as_string() const final;\n void set_value(const YAML::Node& value) final;\n void set_value(const std::string& value);\n void add_defines(const std::string& plugin_id,\n const std::string& setting_id, StageManager::DefinesType& defines) const final;\n\nprivate:\n std::string _default;\n std::string _file_type;\n std::string _base_path;\n};\n\ninline std::string PathType::get_value_as_string() const\n{\n return boost::any_cast<const std::string&>(_value);\n}\n\ninline void PathType::set_value(const std::string& value)\n{\n _value = value;\n}\n\n\/\/ ************************************************************************************************\n\/**\n * Constructs a new setting from a given dataset. This method will automatically\n * instantiate a new class matching the type of the given dataset. It will fill\n * all values provided by the dataset and then return the created instance.\n *\/\nstd::shared_ptr<BaseType> make_setting_from_data(YAML::Node& data);\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 \"webkit\/glue\/webaccessibility.h\"\n\n#include \"third_party\/WebKit\/WebKit\/chromium\/public\/WebAccessibilityCache.h\"\n#include \"third_party\/WebKit\/WebKit\/chromium\/public\/WebAccessibilityObject.h\"\n#include \"third_party\/WebKit\/WebKit\/chromium\/public\/WebAccessibilityRole.h\"\n#include \"third_party\/WebKit\/WebKit\/chromium\/public\/WebAttribute.h\"\n#include \"third_party\/WebKit\/WebKit\/chromium\/public\/WebDocument.h\"\n#include \"third_party\/WebKit\/WebKit\/chromium\/public\/WebDocumentType.h\"\n#include \"third_party\/WebKit\/WebKit\/chromium\/public\/WebElement.h\"\n#include \"third_party\/WebKit\/WebKit\/chromium\/public\/WebFrame.h\"\n#include \"third_party\/WebKit\/WebKit\/chromium\/public\/WebNamedNodeMap.h\"\n#include \"third_party\/WebKit\/WebKit\/chromium\/public\/WebNode.h\"\n#include \"third_party\/WebKit\/WebKit\/chromium\/public\/WebString.h\"\n\nusing WebKit::WebAccessibilityCache;\nusing WebKit::WebAccessibilityRole;\nusing WebKit::WebAccessibilityObject;\n\nnamespace webkit_glue {\n\n\/\/ Provides a conversion between the WebKit::WebAccessibilityRole and a role\n\/\/ supported on the Browser side. Listed alphabetically by the\n\/\/ WebAccessibilityRole (except for default role).\nWebAccessibility::Role ConvertRole(WebKit::WebAccessibilityRole role) {\n switch (role) {\n case WebKit::WebAccessibilityRoleAnnotation:\n return WebAccessibility::ROLE_ANNOTATION;\n case WebKit::WebAccessibilityRoleApplication:\n return WebAccessibility::ROLE_APPLICATION;\n case WebKit::WebAccessibilityRoleApplicationAlert:\n return WebAccessibility::ROLE_ALERT;\n case WebKit::WebAccessibilityRoleApplicationAlertDialog:\n return WebAccessibility::ROLE_ALERT_DIALOG;\n case WebKit::WebAccessibilityRoleApplicationDialog:\n return WebAccessibility::ROLE_DIALOG;\n case WebKit::WebAccessibilityRoleApplicationLog:\n return WebAccessibility::ROLE_LOG;\n case WebKit::WebAccessibilityRoleApplicationMarquee:\n return WebAccessibility::ROLE_MARQUEE;\n case WebKit::WebAccessibilityRoleApplicationStatus:\n return WebAccessibility::ROLE_STATUS;\n case WebKit::WebAccessibilityRoleApplicationTimer:\n return WebAccessibility::ROLE_TIMER;\n case WebKit::WebAccessibilityRoleBrowser:\n return WebAccessibility::ROLE_BROWSER;\n case WebKit::WebAccessibilityRoleBusyIndicator:\n return WebAccessibility::ROLE_BUSY_INDICATOR;\n case WebKit::WebAccessibilityRoleButton:\n return WebAccessibility::ROLE_BUTTON;\n case WebKit::WebAccessibilityRoleCell:\n return WebAccessibility::ROLE_CELL;\n case WebKit::WebAccessibilityRoleCheckBox:\n return WebAccessibility::ROLE_CHECKBOX;\n case WebKit::WebAccessibilityRoleColorWell:\n return WebAccessibility::ROLE_COLOR_WELL;\n case WebKit::WebAccessibilityRoleColumn:\n return WebAccessibility::ROLE_COLUMN;\n case WebKit::WebAccessibilityRoleColumnHeader:\n return WebAccessibility::ROLE_COLUMN_HEADER;\n case WebKit::WebAccessibilityRoleComboBox:\n return WebAccessibility::ROLE_COMBO_BOX;\n case WebKit::WebAccessibilityRoleDefinitionListDefinition:\n return WebAccessibility::ROLE_DEFINITION_LIST_DEFINITION;\n case WebKit::WebAccessibilityRoleDefinitionListTerm:\n return WebAccessibility::ROLE_DEFINITION_LIST_TERM;\n case WebKit::WebAccessibilityRoleDirectory:\n return WebAccessibility::ROLE_DIRECTORY;\n case WebKit::WebAccessibilityRoleDisclosureTriangle:\n return WebAccessibility::ROLE_DISCLOSURE_TRIANGLE;\n case WebKit::WebAccessibilityRoleDocument:\n return WebAccessibility::ROLE_DOCUMENT;\n case WebKit::WebAccessibilityRoleDocumentArticle:\n return WebAccessibility::ROLE_ARTICLE;\n case WebKit::WebAccessibilityRoleDocumentMath:\n return WebAccessibility::ROLE_MATH;\n case WebKit::WebAccessibilityRoleDocumentNote:\n return WebAccessibility::ROLE_NOTE;\n case WebKit::WebAccessibilityRoleDocumentRegion:\n return WebAccessibility::ROLE_REGION;\n case WebKit::WebAccessibilityRoleDrawer:\n return WebAccessibility::ROLE_DRAWER;\n case WebKit::WebAccessibilityRoleEditableText:\n return WebAccessibility::ROLE_EDITABLE_TEXT;\n case WebKit::WebAccessibilityRoleGrid:\n return WebAccessibility::ROLE_GRID;\n case WebKit::WebAccessibilityRoleGroup:\n return WebAccessibility::ROLE_GROUP;\n case WebKit::WebAccessibilityRoleGrowArea:\n return WebAccessibility::ROLE_GROW_AREA;\n case WebKit::WebAccessibilityRoleHeading:\n return WebAccessibility::ROLE_HEADING;\n case WebKit::WebAccessibilityRoleHelpTag:\n return WebAccessibility::ROLE_HELP_TAG;\n case WebKit::WebAccessibilityRoleIgnored:\n return WebAccessibility::ROLE_IGNORED;\n case WebKit::WebAccessibilityRoleImage:\n return WebAccessibility::ROLE_IMAGE;\n case WebKit::WebAccessibilityRoleImageMap:\n return WebAccessibility::ROLE_IMAGE_MAP;\n case WebKit::WebAccessibilityRoleImageMapLink:\n return WebAccessibility::ROLE_IMAGE_MAP_LINK;\n case WebKit::WebAccessibilityRoleIncrementor:\n return WebAccessibility::ROLE_INCREMENTOR;\n case WebKit::WebAccessibilityRoleLandmarkApplication:\n return WebAccessibility::ROLE_LANDMARK_APPLICATION;\n case WebKit::WebAccessibilityRoleLandmarkBanner:\n return WebAccessibility::ROLE_LANDMARK_BANNER;\n case WebKit::WebAccessibilityRoleLandmarkComplementary:\n return WebAccessibility::ROLE_LANDMARK_COMPLEMENTARY;\n case WebKit::WebAccessibilityRoleLandmarkContentInfo:\n return WebAccessibility::ROLE_LANDMARK_CONTENTINFO;\n case WebKit::WebAccessibilityRoleLandmarkMain:\n return WebAccessibility::ROLE_LANDMARK_MAIN;\n case WebKit::WebAccessibilityRoleLandmarkNavigation:\n return WebAccessibility::ROLE_LANDMARK_NAVIGATION;\n case WebKit::WebAccessibilityRoleLandmarkSearch:\n return WebAccessibility::ROLE_LANDMARK_SEARCH;\n case WebKit::WebAccessibilityRoleLink:\n return WebAccessibility::ROLE_LINK;\n case WebKit::WebAccessibilityRoleList:\n return WebAccessibility::ROLE_LIST;\n case WebKit::WebAccessibilityRoleListBox:\n return WebAccessibility::ROLE_LISTBOX;\n case WebKit::WebAccessibilityRoleListBoxOption:\n return WebAccessibility::ROLE_LISTBOX_OPTION;\n case WebKit::WebAccessibilityRoleListItem:\n return WebAccessibility::ROLE_LIST_ITEM;\n case WebKit::WebAccessibilityRoleListMarker:\n return WebAccessibility::ROLE_LIST_MARKER;\n case WebKit::WebAccessibilityRoleMatte:\n return WebAccessibility::ROLE_MATTE;\n case WebKit::WebAccessibilityRoleMenu:\n return WebAccessibility::ROLE_MENU;\n case WebKit::WebAccessibilityRoleMenuBar:\n return WebAccessibility::ROLE_MENU_BAR;\n case WebKit::WebAccessibilityRoleMenuButton:\n return WebAccessibility::ROLE_MENU_BUTTON;\n case WebKit::WebAccessibilityRoleMenuItem:\n return WebAccessibility::ROLE_MENU_ITEM;\n case WebKit::WebAccessibilityRoleMenuListOption:\n return WebAccessibility::ROLE_MENU_LIST_OPTION;\n case WebKit::WebAccessibilityRoleMenuListPopup:\n return WebAccessibility::ROLE_MENU_LIST_POPUP;\n case WebKit::WebAccessibilityRoleOutline:\n return WebAccessibility::ROLE_OUTLINE;\n case WebKit::WebAccessibilityRolePopUpButton:\n return WebAccessibility::ROLE_POPUP_BUTTON;\n case WebKit::WebAccessibilityRoleProgressIndicator:\n return WebAccessibility::ROLE_PROGRESS_INDICATOR;\n case WebKit::WebAccessibilityRoleRadioButton:\n return WebAccessibility::ROLE_RADIO_BUTTON;\n case WebKit::WebAccessibilityRoleRadioGroup:\n return WebAccessibility::ROLE_RADIO_GROUP;\n case WebKit::WebAccessibilityRoleRow:\n return WebAccessibility::ROLE_ROW;\n case WebKit::WebAccessibilityRoleRowHeader:\n return WebAccessibility::ROLE_ROW_HEADER;\n case WebKit::WebAccessibilityRoleRuler:\n return WebAccessibility::ROLE_RULER;\n case WebKit::WebAccessibilityRoleRulerMarker:\n return WebAccessibility::ROLE_RULER_MARKER;\n case WebKit::WebAccessibilityRoleScrollArea:\n return WebAccessibility::ROLE_SCROLLAREA;\n case WebKit::WebAccessibilityRoleScrollBar:\n return WebAccessibility::ROLE_SCROLLBAR;\n case WebKit::WebAccessibilityRoleSheet:\n return WebAccessibility::ROLE_SHEET;\n case WebKit::WebAccessibilityRoleSlider:\n return WebAccessibility::ROLE_SLIDER;\n case WebKit::WebAccessibilityRoleSliderThumb:\n return WebAccessibility::ROLE_SLIDER_THUMB;\n case WebKit::WebAccessibilityRoleSplitGroup:\n return WebAccessibility::ROLE_SPLIT_GROUP;\n case WebKit::WebAccessibilityRoleSplitter:\n return WebAccessibility::ROLE_SPLITTER;\n case WebKit::WebAccessibilityRoleStaticText:\n return WebAccessibility::ROLE_STATIC_TEXT;\n case WebKit::WebAccessibilityRoleSystemWide:\n return WebAccessibility::ROLE_SYSTEM_WIDE;\n case WebKit::WebAccessibilityRoleTab:\n return WebAccessibility::ROLE_TAB;\n case WebKit::WebAccessibilityRoleTabGroup:\n return WebAccessibility::ROLE_TAB_GROUP;\n case WebKit::WebAccessibilityRoleTabList:\n return WebAccessibility::ROLE_TAB_LIST;\n case WebKit::WebAccessibilityRoleTabPanel:\n return WebAccessibility::ROLE_TAB_PANEL;\n case WebKit::WebAccessibilityRoleTable:\n return WebAccessibility::ROLE_TABLE;\n case WebKit::WebAccessibilityRoleTableHeaderContainer:\n return WebAccessibility::ROLE_TABLE_HEADER_CONTAINER;\n case WebKit::WebAccessibilityRoleTextArea:\n return WebAccessibility::ROLE_TEXTAREA;\n case WebKit::WebAccessibilityRoleTextField:\n return WebAccessibility::ROLE_TEXT_FIELD;\n case WebKit::WebAccessibilityRoleToolbar:\n return WebAccessibility::ROLE_TOOLBAR;\n case WebKit::WebAccessibilityRoleTreeGrid:\n return WebAccessibility::ROLE_TREE_GRID;\n case WebKit::WebAccessibilityRoleTreeItemRole:\n return WebAccessibility::ROLE_TREE_ITEM;\n case WebKit::WebAccessibilityRoleTreeRole:\n return WebAccessibility::ROLE_TREE;\n case WebKit::WebAccessibilityRoleUserInterfaceTooltip:\n return WebAccessibility::ROLE_TOOLTIP;\n case WebKit::WebAccessibilityRoleValueIndicator:\n return WebAccessibility::ROLE_VALUE_INDICATOR;\n case WebKit::WebAccessibilityRoleWebArea:\n return WebAccessibility::ROLE_WEB_AREA;\n case WebKit::WebAccessibilityRoleWebCoreLink:\n return WebAccessibility::ROLE_WEBCORE_LINK;\n case WebKit::WebAccessibilityRoleWindow:\n return WebAccessibility::ROLE_WINDOW;\n\n default:\n return WebAccessibility::ROLE_UNKNOWN;\n }\n}\n\nuint32 ConvertState(const WebAccessibilityObject& o) {\n uint32 state = 0;\n if (o.isChecked())\n state |= (1 << WebAccessibility::STATE_CHECKED);\n\n if (o.canSetFocusAttribute())\n state |= (1 << WebAccessibility::STATE_FOCUSABLE);\n\n if (o.isFocused())\n state |= (1 << WebAccessibility::STATE_FOCUSED);\n\n if (o.isHovered())\n state |= (1 << WebAccessibility::STATE_HOTTRACKED);\n\n if (o.isIndeterminate())\n state |= (1 << WebAccessibility::STATE_INDETERMINATE);\n\n if (o.isAnchor())\n state |= (1 << WebAccessibility::STATE_LINKED);\n\n if (o.isMultiSelectable())\n state |= (1 << WebAccessibility::STATE_MULTISELECTABLE);\n\n if (o.isOffScreen())\n state |= (1 << WebAccessibility::STATE_OFFSCREEN);\n\n if (o.isPressed())\n state |= (1 << WebAccessibility::STATE_PRESSED);\n\n if (o.isPasswordField())\n state |= (1 << WebAccessibility::STATE_PROTECTED);\n\n if (o.isReadOnly())\n state |= (1 << WebAccessibility::STATE_READONLY);\n\n if (o.isVisited())\n state |= (1 << WebAccessibility::STATE_TRAVERSED);\n\n if (!o.isEnabled())\n state |= (1 << WebAccessibility::STATE_UNAVAILABLE);\n\n return state;\n}\n\nWebAccessibility::WebAccessibility()\n : id(-1),\n role(ROLE_NONE),\n state(-1) {\n}\n\nWebAccessibility::WebAccessibility(const WebKit::WebAccessibilityObject& src,\n WebKit::WebAccessibilityCache* cache) {\n Init(src, cache);\n}\n\nWebAccessibility::~WebAccessibility() {\n}\n\nvoid WebAccessibility::Init(const WebKit::WebAccessibilityObject& src,\n WebKit::WebAccessibilityCache* cache) {\n name = src.title();\n value = src.stringValue();\n role = ConvertRole(src.roleValue());\n state = ConvertState(src);\n location = src.boundingBoxRect();\n\n if (src.actionVerb().length())\n attributes[ATTR_ACTION] = src.actionVerb();\n if (src.accessibilityDescription().length())\n attributes[ATTR_DESCRIPTION] = src.accessibilityDescription();\n if (src.helpText().length())\n attributes[ATTR_HELP] = src.helpText();\n if (src.keyboardShortcut().length())\n attributes[ATTR_SHORTCUT] = src.keyboardShortcut();\n if (src.hasComputedStyle())\n attributes[ATTR_DISPLAY] = src.computedStyleDisplay();\n\n WebKit::WebNode node = src.node();\n\n if (!node.isNull() && node.isElementNode()) {\n WebKit::WebElement element = node.to<WebKit::WebElement>();\n attributes[ATTR_HTML_TAG] = element.tagName();\n for (unsigned i = 0; i < element.attributes().length(); i++) {\n html_attributes.push_back(\n std::pair<string16, string16>(\n element.attributes().attributeItem(i).localName(),\n element.attributes().attributeItem(i).value()));\n }\n }\n\n if (role == WebAccessibility::ROLE_DOCUMENT ||\n role == WebAccessibility::ROLE_WEB_AREA) {\n WebKit::WebDocument document = src.document();\n attributes[ATTR_DOC_TITLE] = document.title();\n attributes[ATTR_DOC_URL] = document.frame()->url().spec().utf16();\n if (document.isXHTMLDocument())\n attributes[ATTR_DOC_MIMETYPE] = WebKit::WebString(\"text\/xhtml\");\n else\n attributes[ATTR_DOC_MIMETYPE] = WebKit::WebString(\"text\/html\");\n\n WebKit::WebDocumentType doctype = document.doctype();\n if (!doctype.isNull())\n attributes[ATTR_DOC_DOCTYPE] = doctype.name();\n }\n\n \/\/ Add the source object to the cache and store its id.\n id = cache->addOrGetId(src);\n\n \/\/ Recursively create children.\n int child_count = src.childCount();\n children.resize(child_count);\n for (int i = 0; i < child_count; i++) {\n children[i].Init(src.childAt(i), cache);\n }\n}\n\n} \/\/ namespace webkit_glue\n<commit_msg>Don't add invalid webkit accessibility objects to the renderer accessibility tree.<commit_after>\/\/ Copyright (c) 2010 The Chromium Authors. All rights reserved.\n\/\/ Use of this source code is governed by a BSD-style license that can be\n\/\/ found in the LICENSE file.\n\n#include \"webkit\/glue\/webaccessibility.h\"\n\n#include \"third_party\/WebKit\/WebKit\/chromium\/public\/WebAccessibilityCache.h\"\n#include \"third_party\/WebKit\/WebKit\/chromium\/public\/WebAccessibilityObject.h\"\n#include \"third_party\/WebKit\/WebKit\/chromium\/public\/WebAccessibilityRole.h\"\n#include \"third_party\/WebKit\/WebKit\/chromium\/public\/WebAttribute.h\"\n#include \"third_party\/WebKit\/WebKit\/chromium\/public\/WebDocument.h\"\n#include \"third_party\/WebKit\/WebKit\/chromium\/public\/WebDocumentType.h\"\n#include \"third_party\/WebKit\/WebKit\/chromium\/public\/WebElement.h\"\n#include \"third_party\/WebKit\/WebKit\/chromium\/public\/WebFrame.h\"\n#include \"third_party\/WebKit\/WebKit\/chromium\/public\/WebNamedNodeMap.h\"\n#include \"third_party\/WebKit\/WebKit\/chromium\/public\/WebNode.h\"\n#include \"third_party\/WebKit\/WebKit\/chromium\/public\/WebString.h\"\n\nusing WebKit::WebAccessibilityCache;\nusing WebKit::WebAccessibilityRole;\nusing WebKit::WebAccessibilityObject;\n\nnamespace webkit_glue {\n\n\/\/ Provides a conversion between the WebKit::WebAccessibilityRole and a role\n\/\/ supported on the Browser side. Listed alphabetically by the\n\/\/ WebAccessibilityRole (except for default role).\nWebAccessibility::Role ConvertRole(WebKit::WebAccessibilityRole role) {\n switch (role) {\n case WebKit::WebAccessibilityRoleAnnotation:\n return WebAccessibility::ROLE_ANNOTATION;\n case WebKit::WebAccessibilityRoleApplication:\n return WebAccessibility::ROLE_APPLICATION;\n case WebKit::WebAccessibilityRoleApplicationAlert:\n return WebAccessibility::ROLE_ALERT;\n case WebKit::WebAccessibilityRoleApplicationAlertDialog:\n return WebAccessibility::ROLE_ALERT_DIALOG;\n case WebKit::WebAccessibilityRoleApplicationDialog:\n return WebAccessibility::ROLE_DIALOG;\n case WebKit::WebAccessibilityRoleApplicationLog:\n return WebAccessibility::ROLE_LOG;\n case WebKit::WebAccessibilityRoleApplicationMarquee:\n return WebAccessibility::ROLE_MARQUEE;\n case WebKit::WebAccessibilityRoleApplicationStatus:\n return WebAccessibility::ROLE_STATUS;\n case WebKit::WebAccessibilityRoleApplicationTimer:\n return WebAccessibility::ROLE_TIMER;\n case WebKit::WebAccessibilityRoleBrowser:\n return WebAccessibility::ROLE_BROWSER;\n case WebKit::WebAccessibilityRoleBusyIndicator:\n return WebAccessibility::ROLE_BUSY_INDICATOR;\n case WebKit::WebAccessibilityRoleButton:\n return WebAccessibility::ROLE_BUTTON;\n case WebKit::WebAccessibilityRoleCell:\n return WebAccessibility::ROLE_CELL;\n case WebKit::WebAccessibilityRoleCheckBox:\n return WebAccessibility::ROLE_CHECKBOX;\n case WebKit::WebAccessibilityRoleColorWell:\n return WebAccessibility::ROLE_COLOR_WELL;\n case WebKit::WebAccessibilityRoleColumn:\n return WebAccessibility::ROLE_COLUMN;\n case WebKit::WebAccessibilityRoleColumnHeader:\n return WebAccessibility::ROLE_COLUMN_HEADER;\n case WebKit::WebAccessibilityRoleComboBox:\n return WebAccessibility::ROLE_COMBO_BOX;\n case WebKit::WebAccessibilityRoleDefinitionListDefinition:\n return WebAccessibility::ROLE_DEFINITION_LIST_DEFINITION;\n case WebKit::WebAccessibilityRoleDefinitionListTerm:\n return WebAccessibility::ROLE_DEFINITION_LIST_TERM;\n case WebKit::WebAccessibilityRoleDirectory:\n return WebAccessibility::ROLE_DIRECTORY;\n case WebKit::WebAccessibilityRoleDisclosureTriangle:\n return WebAccessibility::ROLE_DISCLOSURE_TRIANGLE;\n case WebKit::WebAccessibilityRoleDocument:\n return WebAccessibility::ROLE_DOCUMENT;\n case WebKit::WebAccessibilityRoleDocumentArticle:\n return WebAccessibility::ROLE_ARTICLE;\n case WebKit::WebAccessibilityRoleDocumentMath:\n return WebAccessibility::ROLE_MATH;\n case WebKit::WebAccessibilityRoleDocumentNote:\n return WebAccessibility::ROLE_NOTE;\n case WebKit::WebAccessibilityRoleDocumentRegion:\n return WebAccessibility::ROLE_REGION;\n case WebKit::WebAccessibilityRoleDrawer:\n return WebAccessibility::ROLE_DRAWER;\n case WebKit::WebAccessibilityRoleEditableText:\n return WebAccessibility::ROLE_EDITABLE_TEXT;\n case WebKit::WebAccessibilityRoleGrid:\n return WebAccessibility::ROLE_GRID;\n case WebKit::WebAccessibilityRoleGroup:\n return WebAccessibility::ROLE_GROUP;\n case WebKit::WebAccessibilityRoleGrowArea:\n return WebAccessibility::ROLE_GROW_AREA;\n case WebKit::WebAccessibilityRoleHeading:\n return WebAccessibility::ROLE_HEADING;\n case WebKit::WebAccessibilityRoleHelpTag:\n return WebAccessibility::ROLE_HELP_TAG;\n case WebKit::WebAccessibilityRoleIgnored:\n return WebAccessibility::ROLE_IGNORED;\n case WebKit::WebAccessibilityRoleImage:\n return WebAccessibility::ROLE_IMAGE;\n case WebKit::WebAccessibilityRoleImageMap:\n return WebAccessibility::ROLE_IMAGE_MAP;\n case WebKit::WebAccessibilityRoleImageMapLink:\n return WebAccessibility::ROLE_IMAGE_MAP_LINK;\n case WebKit::WebAccessibilityRoleIncrementor:\n return WebAccessibility::ROLE_INCREMENTOR;\n case WebKit::WebAccessibilityRoleLandmarkApplication:\n return WebAccessibility::ROLE_LANDMARK_APPLICATION;\n case WebKit::WebAccessibilityRoleLandmarkBanner:\n return WebAccessibility::ROLE_LANDMARK_BANNER;\n case WebKit::WebAccessibilityRoleLandmarkComplementary:\n return WebAccessibility::ROLE_LANDMARK_COMPLEMENTARY;\n case WebKit::WebAccessibilityRoleLandmarkContentInfo:\n return WebAccessibility::ROLE_LANDMARK_CONTENTINFO;\n case WebKit::WebAccessibilityRoleLandmarkMain:\n return WebAccessibility::ROLE_LANDMARK_MAIN;\n case WebKit::WebAccessibilityRoleLandmarkNavigation:\n return WebAccessibility::ROLE_LANDMARK_NAVIGATION;\n case WebKit::WebAccessibilityRoleLandmarkSearch:\n return WebAccessibility::ROLE_LANDMARK_SEARCH;\n case WebKit::WebAccessibilityRoleLink:\n return WebAccessibility::ROLE_LINK;\n case WebKit::WebAccessibilityRoleList:\n return WebAccessibility::ROLE_LIST;\n case WebKit::WebAccessibilityRoleListBox:\n return WebAccessibility::ROLE_LISTBOX;\n case WebKit::WebAccessibilityRoleListBoxOption:\n return WebAccessibility::ROLE_LISTBOX_OPTION;\n case WebKit::WebAccessibilityRoleListItem:\n return WebAccessibility::ROLE_LIST_ITEM;\n case WebKit::WebAccessibilityRoleListMarker:\n return WebAccessibility::ROLE_LIST_MARKER;\n case WebKit::WebAccessibilityRoleMatte:\n return WebAccessibility::ROLE_MATTE;\n case WebKit::WebAccessibilityRoleMenu:\n return WebAccessibility::ROLE_MENU;\n case WebKit::WebAccessibilityRoleMenuBar:\n return WebAccessibility::ROLE_MENU_BAR;\n case WebKit::WebAccessibilityRoleMenuButton:\n return WebAccessibility::ROLE_MENU_BUTTON;\n case WebKit::WebAccessibilityRoleMenuItem:\n return WebAccessibility::ROLE_MENU_ITEM;\n case WebKit::WebAccessibilityRoleMenuListOption:\n return WebAccessibility::ROLE_MENU_LIST_OPTION;\n case WebKit::WebAccessibilityRoleMenuListPopup:\n return WebAccessibility::ROLE_MENU_LIST_POPUP;\n case WebKit::WebAccessibilityRoleOutline:\n return WebAccessibility::ROLE_OUTLINE;\n case WebKit::WebAccessibilityRolePopUpButton:\n return WebAccessibility::ROLE_POPUP_BUTTON;\n case WebKit::WebAccessibilityRoleProgressIndicator:\n return WebAccessibility::ROLE_PROGRESS_INDICATOR;\n case WebKit::WebAccessibilityRoleRadioButton:\n return WebAccessibility::ROLE_RADIO_BUTTON;\n case WebKit::WebAccessibilityRoleRadioGroup:\n return WebAccessibility::ROLE_RADIO_GROUP;\n case WebKit::WebAccessibilityRoleRow:\n return WebAccessibility::ROLE_ROW;\n case WebKit::WebAccessibilityRoleRowHeader:\n return WebAccessibility::ROLE_ROW_HEADER;\n case WebKit::WebAccessibilityRoleRuler:\n return WebAccessibility::ROLE_RULER;\n case WebKit::WebAccessibilityRoleRulerMarker:\n return WebAccessibility::ROLE_RULER_MARKER;\n case WebKit::WebAccessibilityRoleScrollArea:\n return WebAccessibility::ROLE_SCROLLAREA;\n case WebKit::WebAccessibilityRoleScrollBar:\n return WebAccessibility::ROLE_SCROLLBAR;\n case WebKit::WebAccessibilityRoleSheet:\n return WebAccessibility::ROLE_SHEET;\n case WebKit::WebAccessibilityRoleSlider:\n return WebAccessibility::ROLE_SLIDER;\n case WebKit::WebAccessibilityRoleSliderThumb:\n return WebAccessibility::ROLE_SLIDER_THUMB;\n case WebKit::WebAccessibilityRoleSplitGroup:\n return WebAccessibility::ROLE_SPLIT_GROUP;\n case WebKit::WebAccessibilityRoleSplitter:\n return WebAccessibility::ROLE_SPLITTER;\n case WebKit::WebAccessibilityRoleStaticText:\n return WebAccessibility::ROLE_STATIC_TEXT;\n case WebKit::WebAccessibilityRoleSystemWide:\n return WebAccessibility::ROLE_SYSTEM_WIDE;\n case WebKit::WebAccessibilityRoleTab:\n return WebAccessibility::ROLE_TAB;\n case WebKit::WebAccessibilityRoleTabGroup:\n return WebAccessibility::ROLE_TAB_GROUP;\n case WebKit::WebAccessibilityRoleTabList:\n return WebAccessibility::ROLE_TAB_LIST;\n case WebKit::WebAccessibilityRoleTabPanel:\n return WebAccessibility::ROLE_TAB_PANEL;\n case WebKit::WebAccessibilityRoleTable:\n return WebAccessibility::ROLE_TABLE;\n case WebKit::WebAccessibilityRoleTableHeaderContainer:\n return WebAccessibility::ROLE_TABLE_HEADER_CONTAINER;\n case WebKit::WebAccessibilityRoleTextArea:\n return WebAccessibility::ROLE_TEXTAREA;\n case WebKit::WebAccessibilityRoleTextField:\n return WebAccessibility::ROLE_TEXT_FIELD;\n case WebKit::WebAccessibilityRoleToolbar:\n return WebAccessibility::ROLE_TOOLBAR;\n case WebKit::WebAccessibilityRoleTreeGrid:\n return WebAccessibility::ROLE_TREE_GRID;\n case WebKit::WebAccessibilityRoleTreeItemRole:\n return WebAccessibility::ROLE_TREE_ITEM;\n case WebKit::WebAccessibilityRoleTreeRole:\n return WebAccessibility::ROLE_TREE;\n case WebKit::WebAccessibilityRoleUserInterfaceTooltip:\n return WebAccessibility::ROLE_TOOLTIP;\n case WebKit::WebAccessibilityRoleValueIndicator:\n return WebAccessibility::ROLE_VALUE_INDICATOR;\n case WebKit::WebAccessibilityRoleWebArea:\n return WebAccessibility::ROLE_WEB_AREA;\n case WebKit::WebAccessibilityRoleWebCoreLink:\n return WebAccessibility::ROLE_WEBCORE_LINK;\n case WebKit::WebAccessibilityRoleWindow:\n return WebAccessibility::ROLE_WINDOW;\n\n default:\n return WebAccessibility::ROLE_UNKNOWN;\n }\n}\n\nuint32 ConvertState(const WebAccessibilityObject& o) {\n uint32 state = 0;\n if (o.isChecked())\n state |= (1 << WebAccessibility::STATE_CHECKED);\n\n if (o.canSetFocusAttribute())\n state |= (1 << WebAccessibility::STATE_FOCUSABLE);\n\n if (o.isFocused())\n state |= (1 << WebAccessibility::STATE_FOCUSED);\n\n if (o.isHovered())\n state |= (1 << WebAccessibility::STATE_HOTTRACKED);\n\n if (o.isIndeterminate())\n state |= (1 << WebAccessibility::STATE_INDETERMINATE);\n\n if (o.isAnchor())\n state |= (1 << WebAccessibility::STATE_LINKED);\n\n if (o.isMultiSelectable())\n state |= (1 << WebAccessibility::STATE_MULTISELECTABLE);\n\n if (o.isOffScreen())\n state |= (1 << WebAccessibility::STATE_OFFSCREEN);\n\n if (o.isPressed())\n state |= (1 << WebAccessibility::STATE_PRESSED);\n\n if (o.isPasswordField())\n state |= (1 << WebAccessibility::STATE_PROTECTED);\n\n if (o.isReadOnly())\n state |= (1 << WebAccessibility::STATE_READONLY);\n\n if (o.isVisited())\n state |= (1 << WebAccessibility::STATE_TRAVERSED);\n\n if (!o.isEnabled())\n state |= (1 << WebAccessibility::STATE_UNAVAILABLE);\n\n return state;\n}\n\nWebAccessibility::WebAccessibility()\n : id(-1),\n role(ROLE_NONE),\n state(-1) {\n}\n\nWebAccessibility::WebAccessibility(const WebKit::WebAccessibilityObject& src,\n WebKit::WebAccessibilityCache* cache) {\n Init(src, cache);\n}\n\nWebAccessibility::~WebAccessibility() {\n}\n\nvoid WebAccessibility::Init(const WebKit::WebAccessibilityObject& src,\n WebKit::WebAccessibilityCache* cache) {\n name = src.title();\n value = src.stringValue();\n role = ConvertRole(src.roleValue());\n state = ConvertState(src);\n location = src.boundingBoxRect();\n\n if (src.actionVerb().length())\n attributes[ATTR_ACTION] = src.actionVerb();\n if (src.accessibilityDescription().length())\n attributes[ATTR_DESCRIPTION] = src.accessibilityDescription();\n if (src.helpText().length())\n attributes[ATTR_HELP] = src.helpText();\n if (src.keyboardShortcut().length())\n attributes[ATTR_SHORTCUT] = src.keyboardShortcut();\n if (src.hasComputedStyle())\n attributes[ATTR_DISPLAY] = src.computedStyleDisplay();\n\n WebKit::WebNode node = src.node();\n\n if (!node.isNull() && node.isElementNode()) {\n WebKit::WebElement element = node.to<WebKit::WebElement>();\n attributes[ATTR_HTML_TAG] = element.tagName();\n for (unsigned i = 0; i < element.attributes().length(); i++) {\n html_attributes.push_back(\n std::pair<string16, string16>(\n element.attributes().attributeItem(i).localName(),\n element.attributes().attributeItem(i).value()));\n }\n }\n\n if (role == WebAccessibility::ROLE_DOCUMENT ||\n role == WebAccessibility::ROLE_WEB_AREA) {\n WebKit::WebDocument document = src.document();\n attributes[ATTR_DOC_TITLE] = document.title();\n attributes[ATTR_DOC_URL] = document.frame()->url().spec().utf16();\n if (document.isXHTMLDocument())\n attributes[ATTR_DOC_MIMETYPE] = WebKit::WebString(\"text\/xhtml\");\n else\n attributes[ATTR_DOC_MIMETYPE] = WebKit::WebString(\"text\/html\");\n\n WebKit::WebDocumentType doctype = document.doctype();\n if (!doctype.isNull())\n attributes[ATTR_DOC_DOCTYPE] = doctype.name();\n }\n\n \/\/ Add the source object to the cache and store its id.\n id = cache->addOrGetId(src);\n\n \/\/ Recursively create children.\n int child_count = src.childCount();\n for (int i = 0; i < child_count; i++) {\n WebAccessibilityObject child = src.childAt(i);\n\n \/\/ The child may be invalid due to issues in webkit accessibility code.\n \/\/ Don't add children are invalid thus preventing a crash.\n \/\/ https:\/\/bugs.webkit.org\/show_bug.cgi?id=44149\n \/\/ TODO(ctguil): We may want to remove this check as webkit stabilizes.\n if (child.isValid())\n children.push_back(WebAccessibility(child, cache));\n }\n}\n\n} \/\/ namespace webkit_glue\n<|endoftext|>"} {"text":"<commit_before>\/***************************************************************************\n * algo\/sort_file.cpp\n *\n * Part of the STXXL. See http:\/\/stxxl.sourceforge.net\n *\n * Copyright (C) 2002-2003 Roman Dementiev <dementiev@mpi-sb.mpg.de>\n * Copyright (C) 2009 Andreas Beckmann <beckmann@cs.uni-frankfurt.de>\n *\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\/\/! \\example algo\/sort_file.cpp\n\/\/! This example imports a file into an \\c stxxl::vector without copying its\n\/\/! content and then sorts it using stxxl::sort \/ stxxl::ksort \/ ...\n\n#include <stxxl\/io>\n#include <stxxl\/mng>\n#include <stxxl\/ksort>\n#include <stxxl\/sort>\n#include <stxxl\/stable_ksort>\n#include <stxxl\/vector>\n\n\nstruct my_type\n{\n typedef unsigned key_type;\n\n key_type _key;\n char _data[128 - sizeof(key_type)];\n key_type key() const\n {\n return _key;\n }\n\n my_type() { }\n my_type(key_type __key) : _key(__key) { }\n\n static my_type min_value()\n {\n return my_type((std::numeric_limits<key_type>::min)());\n }\n static my_type max_value()\n {\n return my_type((std::numeric_limits<key_type>::max)());\n }\n};\n\n\ninline bool operator < (const my_type & a, const my_type & b)\n{\n return a.key() < b.key();\n}\n\ninline bool operator == (const my_type & a, const my_type & b)\n{\n return a.key() == b.key();\n}\n\nstruct Cmp\n{\n bool operator () (const my_type & a, const my_type & b) const\n {\n return a < b;\n }\n static my_type min_value()\n {\n return my_type::min_value();\n }\n static my_type max_value()\n {\n return my_type::max_value();\n }\n};\n\nstd::ostream & operator << (std::ostream & o, const my_type & obj)\n{\n o << obj._key;\n return o;\n}\n\nint main(int argc, char ** argv)\n{\n if (argc < 3)\n {\n std::cout << \"Usage: \" << argv[0] << \" action file\" << std::endl;\n std::cout << \" where action is one of generate, sort, ksort, stable_sort, stable_ksort\" << std::endl;\n return -1;\n }\n\n if (strcasecmp(argv[1], \"generate\") == 0) {\n const my_type::key_type max_key = 1 * 1024 * 1024;\n const unsigned int block_size = 1 * 1024 * 1024;\n const unsigned int records_in_block = block_size \/ sizeof(my_type);\n stxxl::syscall_file f(argv[2], stxxl::file::CREAT | stxxl::file::RDWR);\n my_type * array = (my_type *)stxxl::aligned_alloc<BLOCK_ALIGN>(block_size);\n memset(array, 0, block_size);\n\n my_type::key_type cur_key = max_key;\n for (unsigned i = 0; i < max_key \/ records_in_block; i++)\n {\n for (unsigned j = 0; j < records_in_block; j++)\n array[j]._key = cur_key--;\n\n stxxl::request_ptr req = f.awrite((void *)array, stxxl::int64(i) * block_size, block_size, stxxl::default_completion_handler());\n req->wait();\n }\n stxxl::aligned_dealloc<BLOCK_ALIGN>(array);\n } else {\n stxxl::syscall_file f(argv[2], stxxl::file::DIRECT | stxxl::file::RDWR);\n unsigned memory_to_use = 50 * 1024 * 1024;\n typedef stxxl::vector<my_type> vector_type;\n vector_type v(&f);\n\n \/*\n STXXL_MSG(\"Printing...\");\n for(stxxl::int64 i=0; i < v.size(); i++)\n STXXL_MSG(v[i].key());\n *\/\n\n STXXL_MSG(\"Checking order...\");\n STXXL_MSG((stxxl::is_sorted(v.begin(), v.end()) ? \"OK\" : \"WRONG\"));\n\n STXXL_MSG(\"Sorting...\");\n if (strcasecmp(argv[1], \"sort\") == 0) {\n stxxl::sort(v.begin(), v.end(), Cmp(), memory_to_use);\n \/* stable_sort is not yet implemented\n } else if (strcasecmp(argv[1], \"stable_sort\") == 0) {\n stxxl::stable_sort(v.begin(), v.end(), memory_to_use);\n *\/\n } else if (strcasecmp(argv[1], \"ksort\") == 0) {\n stxxl::ksort(v.begin(), v.end(), memory_to_use);\n } else if (strcasecmp(argv[1], \"stable_ksort\") == 0) {\n stxxl::stable_ksort(v.begin(), v.end(), memory_to_use);\n } else {\n STXXL_MSG(\"Not implemented: \" << argv[1]);\n }\n\n STXXL_MSG(\"Checking order...\");\n STXXL_MSG((stxxl::is_sorted(v.begin(), v.end()) ? \"OK\" : \"WRONG\"));\n }\n\n return 0;\n}\n\n\/\/ vim: et:ts=4:sw=4\n<commit_msg>adjust sort_file for mcstl usage<commit_after>\/***************************************************************************\n * algo\/sort_file.cpp\n *\n * Part of the STXXL. See http:\/\/stxxl.sourceforge.net\n *\n * Copyright (C) 2002-2003 Roman Dementiev <dementiev@mpi-sb.mpg.de>\n * Copyright (C) 2009 Andreas Beckmann <beckmann@cs.uni-frankfurt.de>\n *\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\/\/! \\example algo\/sort_file.cpp\n\/\/! This example imports a file into an \\c stxxl::vector without copying its\n\/\/! content and then sorts it using stxxl::sort \/ stxxl::ksort \/ ...\n\n#include <stxxl\/io>\n#include <stxxl\/mng>\n#include <stxxl\/ksort>\n#include <stxxl\/sort>\n#include <stxxl\/stable_ksort>\n#include <stxxl\/vector>\n\n\nstruct my_type\n{\n typedef unsigned key_type;\n\n key_type _key;\n char _data[128 - sizeof(key_type)];\n key_type key() const\n {\n return _key;\n }\n\n my_type() { }\n my_type(key_type __key) : _key(__key) { }\n\n static my_type min_value()\n {\n return my_type((std::numeric_limits<key_type>::min)());\n }\n static my_type max_value()\n {\n return my_type((std::numeric_limits<key_type>::max)());\n }\n};\n\n\ninline bool operator < (const my_type & a, const my_type & b)\n{\n return a.key() < b.key();\n}\n\ninline bool operator == (const my_type & a, const my_type & b)\n{\n return a.key() == b.key();\n}\n\nstruct Cmp\n{\n typedef my_type first_argument_type;\n typedef my_type second_argument_type;\n typedef bool result_type;\n bool operator () (const my_type & a, const my_type & b) const\n {\n return a < b;\n }\n static my_type min_value()\n {\n return my_type::min_value();\n }\n static my_type max_value()\n {\n return my_type::max_value();\n }\n};\n\nstd::ostream & operator << (std::ostream & o, const my_type & obj)\n{\n o << obj._key;\n return o;\n}\n\nint main(int argc, char ** argv)\n{\n if (argc < 3)\n {\n std::cout << \"Usage: \" << argv[0] << \" action file\" << std::endl;\n std::cout << \" where action is one of generate, sort, ksort, stable_sort, stable_ksort\" << std::endl;\n return -1;\n }\n\n if (strcasecmp(argv[1], \"generate\") == 0) {\n const my_type::key_type max_key = 1 * 1024 * 1024;\n const unsigned int block_size = 1 * 1024 * 1024;\n const unsigned int records_in_block = block_size \/ sizeof(my_type);\n stxxl::syscall_file f(argv[2], stxxl::file::CREAT | stxxl::file::RDWR);\n my_type * array = (my_type *)stxxl::aligned_alloc<BLOCK_ALIGN>(block_size);\n memset(array, 0, block_size);\n\n my_type::key_type cur_key = max_key;\n for (unsigned i = 0; i < max_key \/ records_in_block; i++)\n {\n for (unsigned j = 0; j < records_in_block; j++)\n array[j]._key = cur_key--;\n\n stxxl::request_ptr req = f.awrite((void *)array, stxxl::int64(i) * block_size, block_size, stxxl::default_completion_handler());\n req->wait();\n }\n stxxl::aligned_dealloc<BLOCK_ALIGN>(array);\n } else {\n stxxl::syscall_file f(argv[2], stxxl::file::DIRECT | stxxl::file::RDWR);\n unsigned memory_to_use = 50 * 1024 * 1024;\n typedef stxxl::vector<my_type> vector_type;\n vector_type v(&f);\n\n \/*\n STXXL_MSG(\"Printing...\");\n for(stxxl::int64 i=0; i < v.size(); i++)\n STXXL_MSG(v[i].key());\n *\/\n\n STXXL_MSG(\"Checking order...\");\n STXXL_MSG((stxxl::is_sorted(v.begin(), v.end()) ? \"OK\" : \"WRONG\"));\n\n STXXL_MSG(\"Sorting...\");\n if (strcasecmp(argv[1], \"sort\") == 0) {\n stxxl::sort(v.begin(), v.end(), Cmp(), memory_to_use);\n \/* stable_sort is not yet implemented\n } else if (strcasecmp(argv[1], \"stable_sort\") == 0) {\n stxxl::stable_sort(v.begin(), v.end(), memory_to_use);\n *\/\n } else if (strcasecmp(argv[1], \"ksort\") == 0) {\n stxxl::ksort(v.begin(), v.end(), memory_to_use);\n } else if (strcasecmp(argv[1], \"stable_ksort\") == 0) {\n stxxl::stable_ksort(v.begin(), v.end(), memory_to_use);\n } else {\n STXXL_MSG(\"Not implemented: \" << argv[1]);\n }\n\n STXXL_MSG(\"Checking order...\");\n STXXL_MSG((stxxl::is_sorted(v.begin(), v.end()) ? \"OK\" : \"WRONG\"));\n }\n\n return 0;\n}\n\n\/\/ vim: et:ts=4:sw=4\n<|endoftext|>"} {"text":"<commit_before>#include <iostream>\n#include <cstdio>\n\nusing namespace std;\n\nstruct TreeNode\n{\n int data;\n TreeNode* left;\n TreeNode* right;\n};\n\ntypedef TreeNode* NodePtr;\n\nNodePtr parse_tree()\n{\n char c;\n cin >> c; \/\/ Read (\n\n cin >> c; \/\/ Read next character\n\n \/\/ If the next character is ), this is the empty tree\n if(c == ')')\n {\n return NULL;\n }\n\n \/\/ Return the \"borrowed\" character to the input stream\n cin.putback(c);\n\n int node_data;\n cin >> node_data;\n\n NodePtr node = new TreeNode;\n node->data = node_data;\n node->left = parse_tree();\n node->right = parse_tree();\n\n cin >> c; \/\/ Consume the trailing )\n\n return node;\n}\n\nvoid print_infix(NodePtr tree)\n{\n if(tree == NULL)\n {\n return;\n }\n print_infix(tree->left);\n cout << tree->data << \" \";\n print_infix(tree->right);\n\n}\n\nvoid print_postfix(NodePtr tree)\n{\n if(tree == NULL)\n {\n return;\n }\n print_infix(tree->left);\n print_infix(tree->right);\n cout << tree->data << \" \";\n\n}\n\nvoid print_prefix(NodePtr tree)\n{\n if(tree == NULL)\n {\n return;\n }\n cout << tree->data << \" \";\n print_infix(tree->left);\n print_infix(tree->right);\n\n}\n\nvoid print_tree(NodePtr tree)\n{\n if(tree == NULL)\n {\n cout << \"()\" << endl;\n return;\n }\n cout << \"(\" << tree->data << endl;\n print_tree(tree->left);\n print_tree(tree->right);\n cout << \")\" << endl;\n}\n\nint main()\n{\n NodePtr tree = parse_tree();\n print_tree(tree);\n cout << endl;\n return 0;\n}\n<commit_msg>Correct implementation of LISP tree printing :v<commit_after>#include <iostream>\n#include <cstdio>\n\nusing namespace std;\n\nstruct TreeNode\n{\n int data;\n TreeNode* left;\n TreeNode* right;\n\n bool is_leaf();\n};\n\nbool TreeNode::is_leaf()\n{\n return (left == NULL && right == NULL);\n}\n\ntypedef TreeNode* NodePtr;\n\nNodePtr parse_tree()\n{\n char c;\n cin >> c; \/\/ Read (\n\n cin >> c; \/\/ Read next character\n\n \/\/ If the next character is ), this is the empty tree\n if(c == ')') {\n return NULL;\n }\n\n \/\/ Return the \"borrowed\" character to the input stream\n cin.putback(c);\n\n int node_data;\n cin >> node_data;\n\n NodePtr node = new TreeNode;\n node->data = node_data;\n node->left = parse_tree();\n node->right = parse_tree();\n\n cin >> c; \/\/ Consume the trailing )\n\n return node;\n}\n\nvoid print_infix(NodePtr tree)\n{\n if(tree == NULL) {\n return;\n }\n print_infix(tree->left);\n cout << tree->data << \" \";\n print_infix(tree->right);\n\n}\n\nvoid print_postfix(NodePtr tree)\n{\n if(tree == NULL) {\n return;\n }\n print_infix(tree->left);\n print_infix(tree->right);\n cout << tree->data << \" \";\n\n}\n\nvoid print_prefix(NodePtr tree)\n{\n if(tree == NULL) {\n return;\n }\n cout << tree->data << \" \";\n print_infix(tree->left);\n print_infix(tree->right);\n\n}\n\nconst int INDENT_SIZE = 3;\n\nvoid indent(int level)\n{\n for(int i = 0; i != level * INDENT_SIZE; i++) {\n cout << \" \";\n }\n}\n\nvoid print_tree(NodePtr tree, int level = 0)\n{\n indent(level);\n if(tree == NULL) {\n cout << \"()\" << endl;\n return;\n }\n cout << \"(\" << tree->data << endl;\n print_tree(tree->left, level + 1);\n print_tree(tree->right, level + 1);\n indent(level);\n cout << \")\" << endl;\n}\n\n\/\/ Prints the end symbol of a lisp-style representation of a tree. If the tree\n\/\/ is not a rightmost child, the end symbol is a newline character. Otherwise,\n\/\/ there is no end symbol (i.e., it is the empty string).\nvoid tree_end(bool right)\n{\n if(!right) {\n cout << endl;\n }\n}\n\n\/\/ Print tree lisp-style\nvoid print_tree_lisp(NodePtr tree, int level = 0, bool right = false)\n{\n indent(level);\n if(tree == NULL) {\n cout << \"()\";\n tree_end(right);\n return;\n }\n \/\/ Print leaves as numbers inside brackets, but not\n \/\/ with two empty children.\n cout << \"(\" << tree->data;\n if(tree->is_leaf()) {\n cout << \")\";\n tree_end(right);\n } else {\n cout << endl;\n print_tree_lisp(tree->left, level + 1, false);\n print_tree_lisp(tree->right, level + 1, true);\n cout << \")\";\n tree_end(right);\n }\n}\n\nint main()\n{\n NodePtr tree = parse_tree();\n print_tree_lisp(tree);\n cout << endl;\n return 0;\n}\n<|endoftext|>"} {"text":"<commit_before>\/*************************************************************************\n *\n * OpenOffice.org - a multi-platform office productivity suite\n *\n * $RCSfile: xmlictxt.cxx,v $\n *\n * $Revision: 1.5 $\n *\n * last change: $Author: hr $ $Date: 2007-06-27 14:57: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_xmloff.hxx\"\n\n#ifndef _COM_SUN_STAR_XML_SAX_SAXPARSEEXCEPTION_HPP_\n#include <com\/sun\/star\/xml\/sax\/SAXParseException.hpp>\n#endif\n#ifndef _COM_SUN_STAR_XML_SAX_XEXTENDEDDOCUMENTHANDLER_HPP_\n#include <com\/sun\/star\/xml\/sax\/XExtendedDocumentHandler.hpp>\n#endif\n#ifndef _COM_SUN_STAR_XML_SAX_SAXEXCEPTION_HPP_\n#include <com\/sun\/star\/xml\/sax\/SAXException.hpp>\n#endif\n#ifndef _COM_SUN_STAR_XML_SAX_XDOCUMENTHANDLER_HPP_\n#include <com\/sun\/star\/xml\/sax\/XDocumentHandler.hpp>\n#endif\n#ifndef _COM_SUN_STAR_XML_SAX_XATTRIBUTELIST_HPP_\n#include <com\/sun\/star\/xml\/sax\/XAttributeList.hpp>\n#endif\n#ifndef _COM_SUN_STAR_XML_SAX_XLOCATOR_HPP_\n#include <com\/sun\/star\/xml\/sax\/XLocator.hpp>\n#endif\n\n#ifndef _XMLOFF_NMSPMAP_HXX\n#include <xmloff\/nmspmap.hxx>\n#endif\n\n#ifndef _XMLOFF_XMLIMP_HXX\n#include <xmloff\/xmlimp.hxx>\n#endif\n\n#ifndef _XMLOFF_XMLICTXT_HXX\n#include <xmloff\/xmlictxt.hxx>\n#endif\n\nusing namespace ::rtl;\nusing namespace ::com::sun::star;\n\nTYPEINIT0( SvXMLImportContext );\n\nSvXMLImportContext::SvXMLImportContext( SvXMLImport& rImp, USHORT nPrfx,\n const OUString& rLName ) :\n mrImport( rImp ),\n mnPrefix( nPrfx ),\n maLocalName( rLName ),\n mpRewindMap( 0 )\n{\n}\n\nSvXMLImportContext::~SvXMLImportContext()\n{\n}\n\nSvXMLImportContext *SvXMLImportContext::CreateChildContext( USHORT nPrefix,\n const OUString& rLocalName,\n const uno::Reference< xml::sax::XAttributeList >& xAttrList )\n{\n return mrImport.CreateContext( nPrefix, rLocalName, xAttrList );\n}\n\nvoid SvXMLImportContext::StartElement( const uno::Reference< xml::sax::XAttributeList >& )\n{\n}\n\nvoid SvXMLImportContext::EndElement()\n{\n}\n\nvoid SvXMLImportContext::Characters( const OUString& )\n{\n}\n\n\n<commit_msg>INTEGRATION: CWS impresstables2 (1.4.80); FILE MERGED 2007\/08\/01 14:07:49 cl 1.4.80.2: RESYNC: (1.4-1.5); FILE MERGED 2007\/07\/27 09:09:50 cl 1.4.80.1: fixed build issues due to pch and namespace ::rtl<commit_after>\/*************************************************************************\n *\n * OpenOffice.org - a multi-platform office productivity suite\n *\n * $RCSfile: xmlictxt.cxx,v $\n *\n * $Revision: 1.6 $\n *\n * last change: $Author: rt $ $Date: 2008-03-12 10:29: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_xmloff.hxx\"\n\n#ifndef _COM_SUN_STAR_XML_SAX_SAXPARSEEXCEPTION_HPP_\n#include <com\/sun\/star\/xml\/sax\/SAXParseException.hpp>\n#endif\n#ifndef _COM_SUN_STAR_XML_SAX_XEXTENDEDDOCUMENTHANDLER_HPP_\n#include <com\/sun\/star\/xml\/sax\/XExtendedDocumentHandler.hpp>\n#endif\n#ifndef _COM_SUN_STAR_XML_SAX_SAXEXCEPTION_HPP_\n#include <com\/sun\/star\/xml\/sax\/SAXException.hpp>\n#endif\n#ifndef _COM_SUN_STAR_XML_SAX_XDOCUMENTHANDLER_HPP_\n#include <com\/sun\/star\/xml\/sax\/XDocumentHandler.hpp>\n#endif\n#ifndef _COM_SUN_STAR_XML_SAX_XATTRIBUTELIST_HPP_\n#include <com\/sun\/star\/xml\/sax\/XAttributeList.hpp>\n#endif\n#ifndef _COM_SUN_STAR_XML_SAX_XLOCATOR_HPP_\n#include <com\/sun\/star\/xml\/sax\/XLocator.hpp>\n#endif\n\n#ifndef _XMLOFF_NMSPMAP_HXX\n#include <xmloff\/nmspmap.hxx>\n#endif\n\n#ifndef _XMLOFF_XMLIMP_HXX\n#include <xmloff\/xmlimp.hxx>\n#endif\n\n#ifndef _XMLOFF_XMLICTXT_HXX\n#include <xmloff\/xmlictxt.hxx>\n#endif\n\nusing ::rtl::OUString;\nusing ::rtl::OUStringBuffer;\n\nusing namespace ::com::sun::star;\n\nTYPEINIT0( SvXMLImportContext );\n\nSvXMLImportContext::SvXMLImportContext( SvXMLImport& rImp, USHORT nPrfx,\n const OUString& rLName ) :\n mrImport( rImp ),\n mnPrefix( nPrfx ),\n maLocalName( rLName ),\n mpRewindMap( 0 )\n{\n}\n\nSvXMLImportContext::~SvXMLImportContext()\n{\n}\n\nSvXMLImportContext *SvXMLImportContext::CreateChildContext( USHORT nPrefix,\n const OUString& rLocalName,\n const uno::Reference< xml::sax::XAttributeList >& xAttrList )\n{\n return mrImport.CreateContext( nPrefix, rLocalName, xAttrList );\n}\n\nvoid SvXMLImportContext::StartElement( const uno::Reference< xml::sax::XAttributeList >& )\n{\n}\n\nvoid SvXMLImportContext::EndElement()\n{\n}\n\nvoid SvXMLImportContext::Characters( const OUString& )\n{\n}\n\n\n<|endoftext|>"} {"text":"<commit_before>\/*************************************************************************\n *\n * OpenOffice.org - a multi-platform office productivity suite\n *\n * $RCSfile: layerexp.cxx,v $\n *\n * $Revision: 1.5 $\n *\n * last change: $Author: rt $ $Date: 2005-09-09 13:44:40 $\n *\n * The Contents of this file are made available subject to\n * the terms of GNU Lesser General Public License Version 2.1.\n *\n *\n * GNU Lesser General Public License Version 2.1\n * =============================================\n * Copyright 2005 by Sun Microsystems, Inc.\n * 901 San Antonio Road, Palo Alto, CA 94303, USA\n *\n * This library is free software; you can redistribute it and\/or\n * modify it under the terms of the GNU Lesser General Public\n * License version 2.1, as published by the Free Software Foundation.\n *\n * This library is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU\n * Lesser General Public License for more details.\n *\n * You should have received a copy of the GNU Lesser General Public\n * License along with this library; if not, write to the Free Software\n * Foundation, Inc., 59 Temple Place, Suite 330, Boston,\n * MA 02111-1307 USA\n *\n ************************************************************************\/\n\n#include <tools\/debug.hxx>\n\n#ifndef _COM_SUN_STAR_DRAWING_XLAYERSUPPLIER_HPP_\n#include <com\/sun\/star\/drawing\/XLayerSupplier.hpp>\n#endif\n\n#ifndef _COM_SUN_STAR_CONTAINER_XINDEXACCESS_HPP_\n#include <com\/sun\/star\/container\/XIndexAccess.hpp>\n#endif\n\n#ifndef _COM_SUN_STAR_BEANS_XPROPERTYSET_HPP_\n#include <com\/sun\/star\/beans\/XPropertySet.hpp>\n#endif\n\n#ifndef _XMLOFF_XMLTOKEN_HXX\n#include \"xmltoken.hxx\"\n#endif\n\n#ifndef _XMLOFF_XMLNMSPE_HXX\n#include \"xmlnmspe.hxx\"\n#endif\n\n#ifndef _XMLOFF_XMLEXP_HXX\n#include \"xmlexp.hxx\"\n#endif\n\n#ifndef _XMLOFF_XMLEMENT_HXX\n#include \"xmlement.hxx\"\n#endif\n\n#ifndef _XMLOFF_NMSPMAP_HXX\n#include \"nmspmap.hxx\"\n#endif\n\n#ifndef _XMLOFF_LAYEREXP_HXX\n#include \"layerexp.hxx\"\n#endif\n\nusing namespace ::rtl;\nusing namespace ::cppu;\nusing namespace ::com::sun::star;\nusing namespace ::com::sun::star::uno;\nusing namespace ::com::sun::star::drawing;\nusing namespace ::com::sun::star::beans;\nusing namespace ::com::sun::star::lang;\nusing namespace ::com::sun::star::container;\nusing namespace ::xmloff::token;\n\nvoid SdXMLayerExporter::exportLayer( SvXMLExport& rExport )\n{\n Reference< XLayerSupplier > xLayerSupplier( rExport.GetModel(), UNO_QUERY );\n if( !xLayerSupplier.is() )\n return;\n\n Reference< XIndexAccess > xLayerManager( xLayerSupplier->getLayerManager(), UNO_QUERY );\n if( !xLayerManager.is() )\n return;\n\n const sal_Int32 nCount = xLayerManager->getCount();\n if( nCount == 0 )\n return;\n\n Reference< XPropertySet> xLayer;\n const OUString strName( RTL_CONSTASCII_USTRINGPARAM( \"Name\" ) );\n\n OUStringBuffer sTmp;\n OUString aName;\n\n SvXMLElementExport aElem( rExport, XML_NAMESPACE_DRAW, XML_LAYER_SET, sal_True, sal_True );\n\n for( sal_Int32 nIndex = 0; nIndex < nCount; nIndex++ )\n {\n xLayerManager->getByIndex( nIndex ) >>= xLayer;\n\n if( xLayer.is() )\n {\n if( xLayer->getPropertyValue( strName ) >>= aName )\n {\n rExport.AddAttribute( XML_NAMESPACE_DRAW, XML_NAME, aName );\n }\n\n SvXMLElementExport aElem( rExport, XML_NAMESPACE_DRAW, XML_LAYER, sal_True, sal_True );\n }\n }\n}\n<commit_msg>INTEGRATION: CWS warnings01 (1.5.34); FILE MERGED 2005\/11\/16 21:34:10 pl 1.5.34.1: #i55991# removed warnings<commit_after>\/*************************************************************************\n *\n * OpenOffice.org - a multi-platform office productivity suite\n *\n * $RCSfile: layerexp.cxx,v $\n *\n * $Revision: 1.6 $\n *\n * last change: $Author: hr $ $Date: 2006-06-19 18:10:16 $\n *\n * The Contents of this file are made available subject to\n * the terms of GNU Lesser General Public License Version 2.1.\n *\n *\n * GNU Lesser General Public License Version 2.1\n * =============================================\n * Copyright 2005 by Sun Microsystems, Inc.\n * 901 San Antonio Road, Palo Alto, CA 94303, USA\n *\n * This library is free software; you can redistribute it and\/or\n * modify it under the terms of the GNU Lesser General Public\n * License version 2.1, as published by the Free Software Foundation.\n *\n * This library is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU\n * Lesser General Public License for more details.\n *\n * You should have received a copy of the GNU Lesser General Public\n * License along with this library; if not, write to the Free Software\n * Foundation, Inc., 59 Temple Place, Suite 330, Boston,\n * MA 02111-1307 USA\n *\n ************************************************************************\/\n\n#include <tools\/debug.hxx>\n\n#ifndef _COM_SUN_STAR_DRAWING_XLAYERSUPPLIER_HPP_\n#include <com\/sun\/star\/drawing\/XLayerSupplier.hpp>\n#endif\n\n#ifndef _COM_SUN_STAR_CONTAINER_XINDEXACCESS_HPP_\n#include <com\/sun\/star\/container\/XIndexAccess.hpp>\n#endif\n\n#ifndef _COM_SUN_STAR_BEANS_XPROPERTYSET_HPP_\n#include <com\/sun\/star\/beans\/XPropertySet.hpp>\n#endif\n\n#ifndef _XMLOFF_XMLTOKEN_HXX\n#include \"xmltoken.hxx\"\n#endif\n\n#ifndef _XMLOFF_XMLNMSPE_HXX\n#include \"xmlnmspe.hxx\"\n#endif\n\n#ifndef _XMLOFF_XMLEXP_HXX\n#include \"xmlexp.hxx\"\n#endif\n\n#ifndef _XMLOFF_XMLEMENT_HXX\n#include \"xmlement.hxx\"\n#endif\n\n#ifndef _XMLOFF_NMSPMAP_HXX\n#include \"nmspmap.hxx\"\n#endif\n\n#ifndef _XMLOFF_LAYEREXP_HXX\n#include \"layerexp.hxx\"\n#endif\n\nusing namespace ::rtl;\nusing namespace ::cppu;\nusing namespace ::com::sun::star;\nusing namespace ::com::sun::star::uno;\nusing namespace ::com::sun::star::drawing;\nusing namespace ::com::sun::star::beans;\nusing namespace ::com::sun::star::lang;\nusing namespace ::com::sun::star::container;\nusing namespace ::xmloff::token;\n\nvoid SdXMLayerExporter::exportLayer( SvXMLExport& rExport )\n{\n Reference< XLayerSupplier > xLayerSupplier( rExport.GetModel(), UNO_QUERY );\n if( !xLayerSupplier.is() )\n return;\n\n Reference< XIndexAccess > xLayerManager( xLayerSupplier->getLayerManager(), UNO_QUERY );\n if( !xLayerManager.is() )\n return;\n\n const sal_Int32 nCount = xLayerManager->getCount();\n if( nCount == 0 )\n return;\n\n Reference< XPropertySet> xLayer;\n const OUString strName( RTL_CONSTASCII_USTRINGPARAM( \"Name\" ) );\n\n OUStringBuffer sTmp;\n OUString aName;\n\n SvXMLElementExport aElem( rExport, XML_NAMESPACE_DRAW, XML_LAYER_SET, sal_True, sal_True );\n\n for( sal_Int32 nIndex = 0; nIndex < nCount; nIndex++ )\n {\n xLayerManager->getByIndex( nIndex ) >>= xLayer;\n\n if( xLayer.is() )\n {\n if( xLayer->getPropertyValue( strName ) >>= aName )\n {\n rExport.AddAttribute( XML_NAMESPACE_DRAW, XML_NAME, aName );\n }\n\n SvXMLElementExport aEle( rExport, XML_NAMESPACE_DRAW, XML_LAYER, sal_True, sal_True );\n }\n }\n}\n<|endoftext|>"} {"text":"<commit_before>\/*************************************************************************\n *\n * $RCSfile: xmltabi.cxx,v $\n *\n * $Revision: 1.11 $\n *\n * last change: $Author: rt $ $Date: 2004-07-13 08:29: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 _COM_SUN_STAR_STYLE_TABALIGN_HPP_\n#include <com\/sun\/star\/style\/TabAlign.hpp>\n#endif\n\n#ifndef _RTL_USTRBUF_HXX_\n#include <rtl\/ustrbuf.hxx>\n#endif\n\n#ifndef _XMLOFF_XMLTKMAP_HXX\n#include \"xmltkmap.hxx\"\n#endif\n#ifndef _XMLOFF_NMSPMAP_HXX\n#include \"nmspmap.hxx\"\n#endif\n#ifndef _XMLOFF_XMLNMSPE_HXX\n#include \"xmlnmspe.hxx\"\n#endif\n#ifndef _XMLOFF_XMLIMP_HXX\n#include \"xmlimp.hxx\"\n#endif\n\n#ifndef _COM_SUN_STAR_STYLE_TABSTOP_HPP_\n#include <com\/sun\/star\/style\/TabStop.hpp>\n#endif\n\n#ifndef _XMLOFF_XMLTOKEN_HXX\n#include \"xmltoken.hxx\"\n#endif\n#ifndef _XMLOFF_I18NMAP_HXX\n#include \"i18nmap.hxx\"\n#endif\n#ifndef _XMLOFF_XMLUCONV_HXX\n#include \"xmluconv.hxx\"\n#endif\n\n#include \"xmltabi.hxx\"\n\n#define _SVSTDARR_USHORTS\n#include <svtools\/svstdarr.hxx>\n\nusing namespace ::rtl;\nusing namespace ::com::sun::star;\nusing namespace ::xmloff::token;\n\n\/\/ ---\n\nenum SvXMLTokenMapAttrs\n{\n XML_TOK_TABSTOP_POSITION,\n XML_TOK_TABSTOP_TYPE,\n XML_TOK_TABSTOP_CHAR,\n XML_TOK_TABSTOP_LEADER_STYLE,\n XML_TOK_TABSTOP_LEADER_TEXT,\n XML_TOK_TABSTOP_END=XML_TOK_UNKNOWN\n};\n\nstatic __FAR_DATA SvXMLTokenMapEntry aTabsAttributesAttrTokenMap[] =\n{\n { XML_NAMESPACE_STYLE, XML_POSITION, XML_TOK_TABSTOP_POSITION },\n { XML_NAMESPACE_STYLE, XML_TYPE, XML_TOK_TABSTOP_TYPE },\n { XML_NAMESPACE_STYLE, XML_CHAR, XML_TOK_TABSTOP_CHAR },\n { XML_NAMESPACE_STYLE, XML_LEADER_TEXT, XML_TOK_TABSTOP_LEADER_TEXT },\n { XML_NAMESPACE_STYLE, XML_LEADER_STYLE, XML_TOK_TABSTOP_LEADER_STYLE },\n XML_TOKEN_MAP_END\n};\n\n\/\/ ---\n\nclass SvxXMLTabStopContext_Impl : public SvXMLImportContext\n{\nprivate:\n style::TabStop aTabStop;\n\npublic:\n TYPEINFO();\n\n SvxXMLTabStopContext_Impl( SvXMLImport& rImport, sal_uInt16 nPrfx,\n const OUString& rLName,\n const uno::Reference< xml::sax::XAttributeList > & xAttrList );\n\n virtual ~SvxXMLTabStopContext_Impl();\n\n virtual SvXMLImportContext *CreateChildContext( sal_uInt16 nPrefix,\n const OUString& rLocalName,\n const uno::Reference< xml::sax::XAttributeList > & xAttrList );\n\n const style::TabStop& getTabStop() const { return aTabStop; }\n};\n\nTYPEINIT1( SvxXMLTabStopContext_Impl, SvXMLImportContext );\n\nSvxXMLTabStopContext_Impl::SvxXMLTabStopContext_Impl(\n SvXMLImport& rImport, sal_uInt16 nPrfx,\n const OUString& rLName,\n const uno::Reference< xml::sax::XAttributeList > & xAttrList )\n: SvXMLImportContext( rImport, nPrfx, rLName )\n{\n aTabStop.Position = 0;\n aTabStop.Alignment = style::TabAlign_LEFT;\n aTabStop.DecimalChar = sal_Unicode( ',' );\n aTabStop.FillChar = sal_Unicode( ' ' );\n sal_Unicode cTextFillChar = 0;\n\n SvXMLTokenMap aTokenMap( aTabsAttributesAttrTokenMap );\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 OUString aLocalName;\n sal_uInt16 nPrefix =\n GetImport().GetNamespaceMap().GetKeyByAttrName( rAttrName,\n &aLocalName );\n const OUString& rValue = xAttrList->getValueByIndex( i );\n\n sal_Int32 nVal;\n switch( aTokenMap.Get( nPrefix, aLocalName ) )\n {\n case XML_TOK_TABSTOP_POSITION:\n if( GetImport().GetMM100UnitConverter().convertMeasure( nVal,\n rValue ) )\n aTabStop.Position = nVal;\n break;\n case XML_TOK_TABSTOP_TYPE:\n if( IsXMLToken( rValue, XML_LEFT ) )\n {\n aTabStop.Alignment = style::TabAlign_LEFT;\n }\n else if( IsXMLToken( rValue, XML_RIGHT ) )\n {\n aTabStop.Alignment = style::TabAlign_RIGHT;\n }\n else if( IsXMLToken( rValue, XML_CENTER ) )\n {\n aTabStop.Alignment = style::TabAlign_CENTER;\n }\n else if( IsXMLToken( rValue, XML_CHAR ) )\n {\n aTabStop.Alignment = style::TabAlign_DECIMAL;\n }\n else if( IsXMLToken( rValue, XML_DEFAULT ) )\n {\n aTabStop.Alignment = style::TabAlign_DEFAULT;\n }\n break;\n case XML_TOK_TABSTOP_CHAR:\n if( 0 != rValue.getLength() )\n aTabStop.DecimalChar = rValue[0];\n break;\n case XML_TOK_TABSTOP_LEADER_STYLE:\n if( IsXMLToken( rValue, XML_NONE ) )\n aTabStop.FillChar = ' ';\n else if( IsXMLToken( rValue, XML_DOTTED ) )\n aTabStop.FillChar = '.';\n else\n aTabStop.FillChar = '_';\n break;\n case XML_TOK_TABSTOP_LEADER_TEXT:\n if( 0 != rValue.getLength() )\n cTextFillChar = rValue[0];\n break;\n }\n }\n\n if( cTextFillChar != 0 && aTabStop.FillChar != ' ' )\n aTabStop.FillChar = cTextFillChar;\n}\n\nSvxXMLTabStopContext_Impl::~SvxXMLTabStopContext_Impl()\n{\n}\n\nSvXMLImportContext *SvxXMLTabStopContext_Impl::CreateChildContext(\n sal_uInt16 nPrefix,\n const OUString& rLocalName,\n const uno::Reference< xml::sax::XAttributeList > & xAttrList )\n{\n return new SvXMLImportContext( GetImport(), nPrefix, rLocalName );\n}\n\n\n\n\ntypedef SvxXMLTabStopContext_Impl *SvxXMLTabStopContext_Impl_ImplPtr;\nSV_DECL_PTRARR( SvxXMLTabStopArray_Impl, SvxXMLTabStopContext_Impl_ImplPtr, 20, 5 )\n\n\n\/\/ ---\n\nTYPEINIT1( SvxXMLTabStopImportContext, XMLElementPropertyContext );\n\nSvxXMLTabStopImportContext::SvxXMLTabStopImportContext(\n SvXMLImport& rImport, sal_uInt16 nPrfx,\n const OUString& rLName,\n const XMLPropertyState& rProp,\n ::std::vector< XMLPropertyState > &rProps )\n: XMLElementPropertyContext( rImport, nPrfx, rLName, rProp, rProps ),\n mpTabStops( NULL )\n{\n}\n\nSvxXMLTabStopImportContext::~SvxXMLTabStopImportContext()\n{\n if( mpTabStops )\n {\n sal_uInt16 nCount = mpTabStops->Count();\n while( nCount )\n {\n nCount--;\n SvxXMLTabStopContext_Impl *pTabStop = (*mpTabStops)[nCount];\n mpTabStops->Remove( nCount, 1 );\n pTabStop->ReleaseRef();\n }\n }\n\n delete mpTabStops;\n}\n\nSvXMLImportContext *SvxXMLTabStopImportContext::CreateChildContext(\n sal_uInt16 nPrefix,\n const OUString& rLocalName,\n const uno::Reference< xml::sax::XAttributeList > & xAttrList )\n{\n SvXMLImportContext *pContext = 0;\n\n if( XML_NAMESPACE_STYLE == nPrefix && IsXMLToken( rLocalName, XML_TAB_STOP ) )\n {\n \/\/ create new tabstop import context\n SvxXMLTabStopContext_Impl *pTabStopContext =\n new SvxXMLTabStopContext_Impl( GetImport(), nPrefix, rLocalName,\n xAttrList );\n\n \/\/ add new tabstop to array of tabstops\n if( !mpTabStops )\n mpTabStops = new SvxXMLTabStopArray_Impl;\n\n mpTabStops->Insert( pTabStopContext, mpTabStops->Count() );\n pTabStopContext->AddRef();\n\n pContext = pTabStopContext;\n }\n else\n {\n pContext = new SvXMLImportContext( GetImport(), nPrefix, rLocalName );\n }\n\n return pContext;\n}\n\nvoid SvxXMLTabStopImportContext::EndElement( )\n{\n sal_uInt16 nCount = mpTabStops ? mpTabStops->Count() : 0;\n uno::Sequence< style::TabStop> aSeq( nCount );\n\n if( mpTabStops )\n {\n sal_uInt16 nNewCount = 0;\n\n style::TabStop* pTabStops = aSeq.getArray();\n for( sal_uInt16 i=0; i < nCount; i++ )\n {\n SvxXMLTabStopContext_Impl *pTabStopContext = (*mpTabStops)[i];\n const style::TabStop& rTabStop = pTabStopContext->getTabStop();\n sal_Bool bDflt = style::TabAlign_DEFAULT == rTabStop.Alignment;\n if( !bDflt || 0==i )\n {\n *pTabStops++ = pTabStopContext->getTabStop();\n nNewCount++;\n }\n if( bDflt && 0==i )\n break;\n }\n\n if( nCount != nNewCount )\n aSeq.realloc( nNewCount );\n }\n aProp.maValue <<= aSeq;\n\n SetInsert( sal_True );\n XMLElementPropertyContext::EndElement();\n\n}\n\n\n\n\n<commit_msg>INTEGRATION: CWS ooo19126 (1.11.298); FILE MERGED 2005\/09\/05 14:39:36 rt 1.11.298.1: #i54170# Change license header: remove SISSL<commit_after>\/*************************************************************************\n *\n * OpenOffice.org - a multi-platform office productivity suite\n *\n * $RCSfile: xmltabi.cxx,v $\n *\n * $Revision: 1.12 $\n *\n * last change: $Author: rt $ $Date: 2005-09-09 14:55:35 $\n *\n * The Contents of this file are made available subject to\n * the terms of GNU Lesser General Public License Version 2.1.\n *\n *\n * GNU Lesser General Public License Version 2.1\n * =============================================\n * Copyright 2005 by Sun Microsystems, Inc.\n * 901 San Antonio Road, Palo Alto, CA 94303, USA\n *\n * This library is free software; you can redistribute it and\/or\n * modify it under the terms of the GNU Lesser General Public\n * License version 2.1, as published by the Free Software Foundation.\n *\n * This library is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU\n * Lesser General Public License for more details.\n *\n * You should have received a copy of the GNU Lesser General Public\n * License along with this library; if not, write to the Free Software\n * Foundation, Inc., 59 Temple Place, Suite 330, Boston,\n * MA 02111-1307 USA\n *\n ************************************************************************\/\n\n#ifndef _COM_SUN_STAR_STYLE_TABALIGN_HPP_\n#include <com\/sun\/star\/style\/TabAlign.hpp>\n#endif\n\n#ifndef _RTL_USTRBUF_HXX_\n#include <rtl\/ustrbuf.hxx>\n#endif\n\n#ifndef _XMLOFF_XMLTKMAP_HXX\n#include \"xmltkmap.hxx\"\n#endif\n#ifndef _XMLOFF_NMSPMAP_HXX\n#include \"nmspmap.hxx\"\n#endif\n#ifndef _XMLOFF_XMLNMSPE_HXX\n#include \"xmlnmspe.hxx\"\n#endif\n#ifndef _XMLOFF_XMLIMP_HXX\n#include \"xmlimp.hxx\"\n#endif\n\n#ifndef _COM_SUN_STAR_STYLE_TABSTOP_HPP_\n#include <com\/sun\/star\/style\/TabStop.hpp>\n#endif\n\n#ifndef _XMLOFF_XMLTOKEN_HXX\n#include \"xmltoken.hxx\"\n#endif\n#ifndef _XMLOFF_I18NMAP_HXX\n#include \"i18nmap.hxx\"\n#endif\n#ifndef _XMLOFF_XMLUCONV_HXX\n#include \"xmluconv.hxx\"\n#endif\n\n#include \"xmltabi.hxx\"\n\n#define _SVSTDARR_USHORTS\n#include <svtools\/svstdarr.hxx>\n\nusing namespace ::rtl;\nusing namespace ::com::sun::star;\nusing namespace ::xmloff::token;\n\n\/\/ ---\n\nenum SvXMLTokenMapAttrs\n{\n XML_TOK_TABSTOP_POSITION,\n XML_TOK_TABSTOP_TYPE,\n XML_TOK_TABSTOP_CHAR,\n XML_TOK_TABSTOP_LEADER_STYLE,\n XML_TOK_TABSTOP_LEADER_TEXT,\n XML_TOK_TABSTOP_END=XML_TOK_UNKNOWN\n};\n\nstatic __FAR_DATA SvXMLTokenMapEntry aTabsAttributesAttrTokenMap[] =\n{\n { XML_NAMESPACE_STYLE, XML_POSITION, XML_TOK_TABSTOP_POSITION },\n { XML_NAMESPACE_STYLE, XML_TYPE, XML_TOK_TABSTOP_TYPE },\n { XML_NAMESPACE_STYLE, XML_CHAR, XML_TOK_TABSTOP_CHAR },\n { XML_NAMESPACE_STYLE, XML_LEADER_TEXT, XML_TOK_TABSTOP_LEADER_TEXT },\n { XML_NAMESPACE_STYLE, XML_LEADER_STYLE, XML_TOK_TABSTOP_LEADER_STYLE },\n XML_TOKEN_MAP_END\n};\n\n\/\/ ---\n\nclass SvxXMLTabStopContext_Impl : public SvXMLImportContext\n{\nprivate:\n style::TabStop aTabStop;\n\npublic:\n TYPEINFO();\n\n SvxXMLTabStopContext_Impl( SvXMLImport& rImport, sal_uInt16 nPrfx,\n const OUString& rLName,\n const uno::Reference< xml::sax::XAttributeList > & xAttrList );\n\n virtual ~SvxXMLTabStopContext_Impl();\n\n virtual SvXMLImportContext *CreateChildContext( sal_uInt16 nPrefix,\n const OUString& rLocalName,\n const uno::Reference< xml::sax::XAttributeList > & xAttrList );\n\n const style::TabStop& getTabStop() const { return aTabStop; }\n};\n\nTYPEINIT1( SvxXMLTabStopContext_Impl, SvXMLImportContext );\n\nSvxXMLTabStopContext_Impl::SvxXMLTabStopContext_Impl(\n SvXMLImport& rImport, sal_uInt16 nPrfx,\n const OUString& rLName,\n const uno::Reference< xml::sax::XAttributeList > & xAttrList )\n: SvXMLImportContext( rImport, nPrfx, rLName )\n{\n aTabStop.Position = 0;\n aTabStop.Alignment = style::TabAlign_LEFT;\n aTabStop.DecimalChar = sal_Unicode( ',' );\n aTabStop.FillChar = sal_Unicode( ' ' );\n sal_Unicode cTextFillChar = 0;\n\n SvXMLTokenMap aTokenMap( aTabsAttributesAttrTokenMap );\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 OUString aLocalName;\n sal_uInt16 nPrefix =\n GetImport().GetNamespaceMap().GetKeyByAttrName( rAttrName,\n &aLocalName );\n const OUString& rValue = xAttrList->getValueByIndex( i );\n\n sal_Int32 nVal;\n switch( aTokenMap.Get( nPrefix, aLocalName ) )\n {\n case XML_TOK_TABSTOP_POSITION:\n if( GetImport().GetMM100UnitConverter().convertMeasure( nVal,\n rValue ) )\n aTabStop.Position = nVal;\n break;\n case XML_TOK_TABSTOP_TYPE:\n if( IsXMLToken( rValue, XML_LEFT ) )\n {\n aTabStop.Alignment = style::TabAlign_LEFT;\n }\n else if( IsXMLToken( rValue, XML_RIGHT ) )\n {\n aTabStop.Alignment = style::TabAlign_RIGHT;\n }\n else if( IsXMLToken( rValue, XML_CENTER ) )\n {\n aTabStop.Alignment = style::TabAlign_CENTER;\n }\n else if( IsXMLToken( rValue, XML_CHAR ) )\n {\n aTabStop.Alignment = style::TabAlign_DECIMAL;\n }\n else if( IsXMLToken( rValue, XML_DEFAULT ) )\n {\n aTabStop.Alignment = style::TabAlign_DEFAULT;\n }\n break;\n case XML_TOK_TABSTOP_CHAR:\n if( 0 != rValue.getLength() )\n aTabStop.DecimalChar = rValue[0];\n break;\n case XML_TOK_TABSTOP_LEADER_STYLE:\n if( IsXMLToken( rValue, XML_NONE ) )\n aTabStop.FillChar = ' ';\n else if( IsXMLToken( rValue, XML_DOTTED ) )\n aTabStop.FillChar = '.';\n else\n aTabStop.FillChar = '_';\n break;\n case XML_TOK_TABSTOP_LEADER_TEXT:\n if( 0 != rValue.getLength() )\n cTextFillChar = rValue[0];\n break;\n }\n }\n\n if( cTextFillChar != 0 && aTabStop.FillChar != ' ' )\n aTabStop.FillChar = cTextFillChar;\n}\n\nSvxXMLTabStopContext_Impl::~SvxXMLTabStopContext_Impl()\n{\n}\n\nSvXMLImportContext *SvxXMLTabStopContext_Impl::CreateChildContext(\n sal_uInt16 nPrefix,\n const OUString& rLocalName,\n const uno::Reference< xml::sax::XAttributeList > & xAttrList )\n{\n return new SvXMLImportContext( GetImport(), nPrefix, rLocalName );\n}\n\n\n\n\ntypedef SvxXMLTabStopContext_Impl *SvxXMLTabStopContext_Impl_ImplPtr;\nSV_DECL_PTRARR( SvxXMLTabStopArray_Impl, SvxXMLTabStopContext_Impl_ImplPtr, 20, 5 )\n\n\n\/\/ ---\n\nTYPEINIT1( SvxXMLTabStopImportContext, XMLElementPropertyContext );\n\nSvxXMLTabStopImportContext::SvxXMLTabStopImportContext(\n SvXMLImport& rImport, sal_uInt16 nPrfx,\n const OUString& rLName,\n const XMLPropertyState& rProp,\n ::std::vector< XMLPropertyState > &rProps )\n: XMLElementPropertyContext( rImport, nPrfx, rLName, rProp, rProps ),\n mpTabStops( NULL )\n{\n}\n\nSvxXMLTabStopImportContext::~SvxXMLTabStopImportContext()\n{\n if( mpTabStops )\n {\n sal_uInt16 nCount = mpTabStops->Count();\n while( nCount )\n {\n nCount--;\n SvxXMLTabStopContext_Impl *pTabStop = (*mpTabStops)[nCount];\n mpTabStops->Remove( nCount, 1 );\n pTabStop->ReleaseRef();\n }\n }\n\n delete mpTabStops;\n}\n\nSvXMLImportContext *SvxXMLTabStopImportContext::CreateChildContext(\n sal_uInt16 nPrefix,\n const OUString& rLocalName,\n const uno::Reference< xml::sax::XAttributeList > & xAttrList )\n{\n SvXMLImportContext *pContext = 0;\n\n if( XML_NAMESPACE_STYLE == nPrefix && IsXMLToken( rLocalName, XML_TAB_STOP ) )\n {\n \/\/ create new tabstop import context\n SvxXMLTabStopContext_Impl *pTabStopContext =\n new SvxXMLTabStopContext_Impl( GetImport(), nPrefix, rLocalName,\n xAttrList );\n\n \/\/ add new tabstop to array of tabstops\n if( !mpTabStops )\n mpTabStops = new SvxXMLTabStopArray_Impl;\n\n mpTabStops->Insert( pTabStopContext, mpTabStops->Count() );\n pTabStopContext->AddRef();\n\n pContext = pTabStopContext;\n }\n else\n {\n pContext = new SvXMLImportContext( GetImport(), nPrefix, rLocalName );\n }\n\n return pContext;\n}\n\nvoid SvxXMLTabStopImportContext::EndElement( )\n{\n sal_uInt16 nCount = mpTabStops ? mpTabStops->Count() : 0;\n uno::Sequence< style::TabStop> aSeq( nCount );\n\n if( mpTabStops )\n {\n sal_uInt16 nNewCount = 0;\n\n style::TabStop* pTabStops = aSeq.getArray();\n for( sal_uInt16 i=0; i < nCount; i++ )\n {\n SvxXMLTabStopContext_Impl *pTabStopContext = (*mpTabStops)[i];\n const style::TabStop& rTabStop = pTabStopContext->getTabStop();\n sal_Bool bDflt = style::TabAlign_DEFAULT == rTabStop.Alignment;\n if( !bDflt || 0==i )\n {\n *pTabStops++ = pTabStopContext->getTabStop();\n nNewCount++;\n }\n if( bDflt && 0==i )\n break;\n }\n\n if( nCount != nNewCount )\n aSeq.realloc( nNewCount );\n }\n aProp.maValue <<= aSeq;\n\n SetInsert( sal_True );\n XMLElementPropertyContext::EndElement();\n\n}\n\n\n\n\n<|endoftext|>"} {"text":"<commit_before>\/*************************************************************************\n *\n * $RCSfile: txtstyle.cxx,v $\n *\n * $Revision: 1.10 $\n *\n * last change: $Author: mtg $ $Date: 2001-03-22 21:02:27 $\n *\n * The Contents of this file are made available subject to the terms of\n * either of the following licenses\n *\n * - GNU Lesser General Public License Version 2.1\n * - Sun Industry Standards Source License Version 1.1\n *\n * Sun Microsystems Inc., October, 2000\n *\n * GNU Lesser General Public License Version 2.1\n * =============================================\n * Copyright 2000 by Sun Microsystems, Inc.\n * 901 San Antonio Road, Palo Alto, CA 94303, USA\n *\n * This library is free software; you can redistribute it and\/or\n * modify it under the terms of the GNU Lesser General Public\n * License version 2.1, as published by the Free Software Foundation.\n *\n * This library is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU\n * Lesser General Public License for more details.\n *\n * You should have received a copy of the GNU Lesser General Public\n * License along with this library; if not, write to the Free Software\n * Foundation, Inc., 59 Temple Place, Suite 330, Boston,\n * MA 02111-1307 USA\n *\n *\n * Sun Industry Standards Source License Version 1.1\n * =================================================\n * The contents of this file are subject to the Sun Industry Standards\n * Source License Version 1.1 (the \"License\"); You may not use this file\n * except in compliance with the License. You may obtain a copy of the\n * License at http:\/\/www.openoffice.org\/license.html.\n *\n * Software provided under this License is provided on an \"AS IS\" basis,\n * WITHOUT WARRANTY OF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING,\n * WITHOUT LIMITATION, WARRANTIES THAT THE SOFTWARE IS FREE OF DEFECTS,\n * MERCHANTABLE, FIT FOR A PARTICULAR PURPOSE, OR NON-INFRINGING.\n * See the License for the specific provisions governing your rights and\n * obligations concerning the Software.\n *\n * The Initial Developer of the Original Code is: Sun Microsystems, Inc.\n *\n * Copyright: 2000 by Sun Microsystems, Inc.\n *\n * All Rights Reserved.\n *\n * Contributor(s): _______________________________________\n *\n *\n ************************************************************************\/\n\n#ifndef _TOOLS_DEBUG_HXX\n\/\/#include <tools\/debug.hxx>\n#endif\n\n#ifndef _COM_SUN_STAR_STYLE_PARAGRAPHSTYLECATEGORY_HPP_\n#include <com\/sun\/star\/style\/ParagraphStyleCategory.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_BEANS_XPROPERTYSETINFO_HPP_\n#include <com\/sun\/star\/beans\/XPropertySetInfo.hpp>\n#endif\n#ifndef _COM_SUN_STAR_BEANS_XPROPERTYSTATE_HPP_\n#include <com\/sun\/star\/beans\/XPropertyState.hpp>\n#endif\n\n\n#ifndef _XMLOFF_XMLKYWD_HXX\n#include \"xmlkywd.hxx\"\n#endif\n\n#ifndef _XMLOFF_PROPERTYSETMAPPER_HXX\n\/\/#include \"xmlprmap.hxx\"\n#endif\n#ifndef _XMLOFF_XMLSMSPE_HXX\n#include \"xmlnmspe.hxx\"\n#endif\n#ifndef _XMLOFF_FAMILIES_HXX\n#include \"families.hxx\"\n#endif\n#ifndef _XMLOFF_TXTPRMAP_HXX\n\/\/#include \"txtprmap.hxx\"\n#endif\n#ifndef _XMLOFF_TXTPARAE_HXX\n#include \"txtparae.hxx\"\n#endif\n#ifndef _XMLOFF_XMLNUME_HXX\n#include \"xmlnume.hxx\"\n#endif\n#ifndef _XMLOFF_XMLEXP_HXX\n#include \"xmlexp.hxx\"\n#endif\n#ifndef _XMLOFF_XMLSECTIONEXPORT_HXX\n#include \"XMLSectionExport.hxx\"\n#endif\n#ifndef _XMLOFF_XMLLINENUMBERINGEXPORT_HXX_\n#include \"XMLLineNumberingExport.hxx\"\n#endif\n\n#ifndef _XMLOFF_STYLEEXP_HXX\n\/\/#include \"styleexp.hxx\"\n#endif\n\nusing namespace ::rtl;\nusing namespace ::com::sun::star;\nusing namespace ::com::sun::star::uno;\nusing namespace ::com::sun::star::style;\nusing namespace ::com::sun::star::container;\nusing namespace ::com::sun::star::beans;\n\nvoid XMLTextParagraphExport::exportStyleAttributes(\n const ::com::sun::star::uno::Reference<\n ::com::sun::star::style::XStyle > & rStyle )\n{\n Any aAny;\n Reference< XPropertySet > xPropSet( rStyle, UNO_QUERY );\n Reference< XPropertySetInfo > xPropSetInfo =\n xPropSet->getPropertySetInfo();\n if( xPropSetInfo->hasPropertyByName( sCategory ) )\n {\n aAny = xPropSet->getPropertyValue( sCategory );\n sal_Int16 nCategory;\n aAny >>= nCategory;\n const sal_Char *pValue = 0;\n if( -1 != nCategory )\n {\n switch( nCategory )\n {\n case ParagraphStyleCategory::TEXT:\n pValue = sXML_text;\n break;\n case ParagraphStyleCategory::CHAPTER:\n pValue = sXML_chapter;\n break;\n case ParagraphStyleCategory::LIST:\n pValue = sXML_list;\n break;\n case ParagraphStyleCategory::INDEX:\n pValue = sXML_index;\n break;\n case ParagraphStyleCategory::EXTRA:\n pValue = sXML_extra;\n break;\n case ParagraphStyleCategory::HTML:\n pValue = sXML_html;\n break;\n }\n }\n if( pValue )\n GetExport().AddAttributeASCII( XML_NAMESPACE_STYLE, sXML_class,\n pValue );\n }\n if( xPropSetInfo->hasPropertyByName( sPageDescName ) )\n {\n Reference< XPropertyState > xPropState( xPropSet, uno::UNO_QUERY );\n if( PropertyState_DIRECT_VALUE ==\n xPropState->getPropertyState( sPageDescName ) )\n {\n aAny = xPropSet->getPropertyValue( sPageDescName );\n OUString sName;\n aAny >>= sName;\n GetExport().AddAttribute( XML_NAMESPACE_STYLE,\n sXML_master_page_name,\n sName );\n }\n }\n}\n\nvoid XMLTextParagraphExport::exportNumStyles( sal_Bool bUsed )\n{\n SvxXMLNumRuleExport aNumRuleExport( GetExport() );\n aNumRuleExport.exportStyles( bUsed, pListAutoPool, !IsBlockMode() );\n}\n\nvoid XMLTextParagraphExport::exportTextStyles( sal_Bool bUsed )\n{\n Reference < lang::XMultiServiceFactory > xFactory (GetExport().GetModel(), UNO_QUERY);\n if (xFactory.is())\n {\n Reference < XInterface > xInt = xFactory->createInstance (\n OUString( RTL_CONSTASCII_USTRINGPARAM (\n \"com.sun.star.text.Defaults\") ) );\n if ( xInt.is() )\n {\n Reference < XPropertySet > xPropSet (xInt, UNO_QUERY);\n if (xPropSet.is())\n exportDefaultStyle( xPropSet, sXML_paragraph, GetParaPropMapper());\n }\n }\n exportStyleFamily( \"ParagraphStyles\", sXML_paragraph, GetParaPropMapper(),\n bUsed, XML_STYLE_FAMILY_TEXT_PARAGRAPH, 0);\n exportStyleFamily( \"CharacterStyles\", sXML_text, GetTextPropMapper(),\n bUsed, XML_STYLE_FAMILY_TEXT_TEXT );\n \/\/ get shape export to make sure the the frame family is added correctly.\n GetExport().GetShapeExport();\n exportStyleFamily( \"FrameStyles\", XML_STYLE_FAMILY_SD_GRAPHICS_NAME, GetFramePropMapper(),\n bUsed, XML_STYLE_FAMILY_TEXT_FRAME, 0);\n exportNumStyles( bUsed );\n if( !IsBlockMode() )\n {\n exportTextFootnoteConfiguration();\n XMLSectionExport::ExportBibliographyConfiguration(GetExport());\n XMLLineNumberingExport aLineNumberingExport(GetExport());\n aLineNumberingExport.Export();\n }\n}\n<commit_msg>maybe fix wierd solaris bug?<commit_after>\/*************************************************************************\n *\n * $RCSfile: txtstyle.cxx,v $\n *\n * $Revision: 1.11 $\n *\n * last change: $Author: mtg $ $Date: 2001-03-30 10:29: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 _TOOLS_DEBUG_HXX\n\/\/#include <tools\/debug.hxx>\n#endif\n\n#ifndef _COM_SUN_STAR_STYLE_PARAGRAPHSTYLECATEGORY_HPP_\n#include <com\/sun\/star\/style\/ParagraphStyleCategory.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_BEANS_XPROPERTYSETINFO_HPP_\n#include <com\/sun\/star\/beans\/XPropertySetInfo.hpp>\n#endif\n#ifndef _COM_SUN_STAR_BEANS_XPROPERTYSTATE_HPP_\n#include <com\/sun\/star\/beans\/XPropertyState.hpp>\n#endif\n\n\n#ifndef _XMLOFF_XMLKYWD_HXX\n#include \"xmlkywd.hxx\"\n#endif\n\n#ifndef _XMLOFF_PROPERTYSETMAPPER_HXX\n\/\/#include \"xmlprmap.hxx\"\n#endif\n#ifndef _XMLOFF_XMLSMSPE_HXX\n#include \"xmlnmspe.hxx\"\n#endif\n#ifndef _XMLOFF_FAMILIES_HXX\n#include \"families.hxx\"\n#endif\n#ifndef _XMLOFF_TXTPRMAP_HXX\n\/\/#include \"txtprmap.hxx\"\n#endif\n#ifndef _XMLOFF_TXTPARAE_HXX\n#include \"txtparae.hxx\"\n#endif\n#ifndef _XMLOFF_XMLNUME_HXX\n#include \"xmlnume.hxx\"\n#endif\n#ifndef _XMLOFF_XMLEXP_HXX\n#include \"xmlexp.hxx\"\n#endif\n#ifndef _XMLOFF_XMLSECTIONEXPORT_HXX\n#include \"XMLSectionExport.hxx\"\n#endif\n#ifndef _XMLOFF_XMLLINENUMBERINGEXPORT_HXX_\n#include \"XMLLineNumberingExport.hxx\"\n#endif\n\n#ifndef _XMLOFF_STYLEEXP_HXX\n\/\/#include \"styleexp.hxx\"\n#endif\n\nusing namespace ::rtl;\nusing namespace ::com::sun::star;\nusing namespace ::com::sun::star::uno;\nusing namespace ::com::sun::star::style;\nusing namespace ::com::sun::star::container;\nusing namespace ::com::sun::star::beans;\n\nvoid XMLTextParagraphExport::exportStyleAttributes(\n const ::com::sun::star::uno::Reference<\n ::com::sun::star::style::XStyle > & rStyle )\n{\n Any aAny;\n Reference< XPropertySet > xPropSet( rStyle, UNO_QUERY );\n Reference< XPropertySetInfo > xPropSetInfo =\n xPropSet->getPropertySetInfo();\n if( xPropSetInfo->hasPropertyByName( sCategory ) )\n {\n aAny = xPropSet->getPropertyValue( sCategory );\n sal_Int16 nCategory;\n aAny >>= nCategory;\n const sal_Char *pValue = 0;\n if( -1 != nCategory )\n {\n switch( nCategory )\n {\n case ParagraphStyleCategory::TEXT:\n pValue = sXML_text;\n break;\n case ParagraphStyleCategory::CHAPTER:\n pValue = sXML_chapter;\n break;\n case ParagraphStyleCategory::LIST:\n pValue = sXML_list;\n break;\n case ParagraphStyleCategory::INDEX:\n pValue = sXML_index;\n break;\n case ParagraphStyleCategory::EXTRA:\n pValue = sXML_extra;\n break;\n case ParagraphStyleCategory::HTML:\n pValue = sXML_html;\n break;\n }\n }\n if( pValue )\n GetExport().AddAttributeASCII( XML_NAMESPACE_STYLE, sXML_class,\n pValue );\n }\n if( xPropSetInfo->hasPropertyByName( sPageDescName ) )\n {\n Reference< XPropertyState > xPropState( xPropSet, uno::UNO_QUERY );\n if( PropertyState_DIRECT_VALUE ==\n xPropState->getPropertyState( sPageDescName ) )\n {\n aAny = xPropSet->getPropertyValue( sPageDescName );\n OUString sName;\n aAny >>= sName;\n GetExport().AddAttribute( XML_NAMESPACE_STYLE,\n sXML_master_page_name,\n sName );\n }\n }\n}\n\nvoid XMLTextParagraphExport::exportNumStyles( sal_Bool bUsed )\n{\n SvxXMLNumRuleExport aNumRuleExport( GetExport() );\n aNumRuleExport.exportStyles( bUsed, pListAutoPool, !IsBlockMode() );\n}\n\nvoid XMLTextParagraphExport::exportTextStyles( sal_Bool bUsed )\n{\n Reference < lang::XMultiServiceFactory > xFactory (GetExport().GetModel(), UNO_QUERY);\n if (xFactory.is())\n {\n OUString sTextDefaults ( RTL_CONSTASCII_USTRINGPARAM ( \"com.sun.star.text.Defaults\" ) );\n Reference < XInterface > xInt = xFactory->createInstance ( sTextDefaults );\n if ( xInt.is() )\n {\n Reference < XPropertySet > xPropSet (xInt, UNO_QUERY);\n if (xPropSet.is())\n exportDefaultStyle( xPropSet, sXML_paragraph, GetParaPropMapper());\n }\n }\n exportStyleFamily( \"ParagraphStyles\", sXML_paragraph, GetParaPropMapper(),\n bUsed, XML_STYLE_FAMILY_TEXT_PARAGRAPH, 0);\n exportStyleFamily( \"CharacterStyles\", sXML_text, GetTextPropMapper(),\n bUsed, XML_STYLE_FAMILY_TEXT_TEXT );\n \/\/ get shape export to make sure the the frame family is added correctly.\n GetExport().GetShapeExport();\n exportStyleFamily( \"FrameStyles\", XML_STYLE_FAMILY_SD_GRAPHICS_NAME, GetFramePropMapper(),\n bUsed, XML_STYLE_FAMILY_TEXT_FRAME, 0);\n exportNumStyles( bUsed );\n if( !IsBlockMode() )\n {\n exportTextFootnoteConfiguration();\n XMLSectionExport::ExportBibliographyConfiguration(GetExport());\n XMLLineNumberingExport aLineNumberingExport(GetExport());\n aLineNumberingExport.Export();\n }\n}\n<|endoftext|>"} {"text":"<commit_before>\/\/ Copyright (c) 2011-2014 The Bitcoin developers\n\/\/ Distributed under the MIT\/X11 software license, see the accompanying\n\/\/ file COPYING or http:\/\/www.opensource.org\/licenses\/mit-license.php.\n\n#include \"bitcoinamountfield.h\"\n\n#include \"bitcoinunits.h\"\n#include \"guiconstants.h\"\n#include \"qvaluecombobox.h\"\n\n#include <QApplication>\n#include <QAbstractSpinBox>\n#include <QHBoxLayout>\n#include <QKeyEvent>\n#include <QLineEdit>\n\n\/** QSpinBox that uses fixed-point numbers internally and uses our own\n * formatting\/parsing functions.\n *\/\nclass AmountSpinBox: public QAbstractSpinBox\n{\n Q_OBJECT\npublic:\n explicit AmountSpinBox(QWidget *parent):\n QAbstractSpinBox(parent),\n currentUnit(BitcoinUnits::BTC),\n singleStep(100000) \/\/ satoshis\n {\n setAlignment(Qt::AlignRight);\n\n connect(lineEdit(), SIGNAL(textEdited(QString)), this, SIGNAL(valueChanged()));\n }\n\n QValidator::State validate(QString &text, int &pos) const\n {\n if(text.isEmpty())\n return QValidator::Intermediate;\n bool valid = false;\n parse(text, &valid);\n \/* Make sure we return Intermediate so that fixup() is called on defocus *\/\n return valid ? QValidator::Intermediate : QValidator::Invalid;\n }\n\n void fixup(QString &input) const\n {\n bool valid = false;\n CAmount val = parse(input, &valid);\n if(valid)\n {\n input = BitcoinUnits::format(currentUnit, val, false, BitcoinUnits::separatorAlways);\n lineEdit()->setText(input);\n }\n }\n\n CAmount value(bool *valid_out=0) const\n {\n return parse(text(), valid_out);\n }\n\n void setValue(const CAmount& value)\n {\n lineEdit()->setText(BitcoinUnits::format(currentUnit, value, false, BitcoinUnits::separatorAlways));\n emit valueChanged();\n }\n\n void stepBy(int steps)\n {\n bool valid = false;\n CAmount val = value(&valid);\n val = val + steps * singleStep;\n val = qMin(qMax(val, CAmount(0)), BitcoinUnits::maxMoney());\n setValue(val);\n }\n\n StepEnabled stepEnabled() const\n {\n StepEnabled rv = 0;\n if(text().isEmpty()) \/\/ Allow step-up with empty field\n return StepUpEnabled;\n bool valid = false;\n CAmount val = value(&valid);\n if(valid)\n {\n if(val > 0)\n rv |= StepDownEnabled;\n if(val < BitcoinUnits::maxMoney())\n rv |= StepUpEnabled;\n }\n return rv;\n }\n\n void setDisplayUnit(int unit)\n {\n bool valid = false;\n CAmount val = value(&valid);\n\n currentUnit = unit;\n\n if(valid)\n setValue(val);\n else\n clear();\n }\n\n void setSingleStep(const CAmount& step)\n {\n singleStep = step;\n }\n\n QSize minimumSizeHint() const\n {\n if(cachedMinimumSizeHint.isEmpty())\n {\n ensurePolished();\n\n const QFontMetrics fm(fontMetrics());\n int h = lineEdit()->minimumSizeHint().height();\n int w = fm.width(BitcoinUnits::format(BitcoinUnits::BTC, BitcoinUnits::maxMoney(), false, BitcoinUnits::separatorAlways));\n w += 2; \/\/ cursor blinking space\n\n QStyleOptionSpinBox opt;\n initStyleOption(&opt);\n QSize hint(w, h);\n QSize extra(35, 6);\n opt.rect.setSize(hint + extra);\n extra += hint - style()->subControlRect(QStyle::CC_SpinBox, &opt,\n QStyle::SC_SpinBoxEditField, this).size();\n \/\/ get closer to final result by repeating the calculation\n opt.rect.setSize(hint + extra);\n extra += hint - style()->subControlRect(QStyle::CC_SpinBox, &opt,\n QStyle::SC_SpinBoxEditField, this).size();\n hint += extra;\n\n opt.rect = rect();\n\n cachedMinimumSizeHint = style()->sizeFromContents(QStyle::CT_SpinBox, &opt, hint, this)\n .expandedTo(QApplication::globalStrut());\n }\n return cachedMinimumSizeHint;\n }\nprivate:\n int currentUnit;\n CAmount singleStep;\n mutable QSize cachedMinimumSizeHint;\n\n \/**\n * Parse a string into a number of base monetary units and\n * return validity.\n * @note Must return 0 if !valid.\n *\/\n CAmount parse(const QString &text, bool *valid_out=0) const\n {\n CAmount val = 0;\n bool valid = BitcoinUnits::parse(currentUnit, text, &val);\n if(valid)\n {\n if(val < 0 || val > BitcoinUnits::maxMoney())\n valid = false;\n }\n if(valid_out)\n *valid_out = valid;\n return valid ? val : 0;\n }\n\nprotected:\n bool event(QEvent *event)\n {\n if (event->type() == QEvent::KeyPress || event->type() == QEvent::KeyRelease)\n {\n QKeyEvent *keyEvent = static_cast<QKeyEvent *>(event);\n if (keyEvent->key() == Qt::Key_Comma)\n {\n \/\/ Translate a comma into a period\n QKeyEvent periodKeyEvent(event->type(), Qt::Key_Period, keyEvent->modifiers(), \".\", keyEvent->isAutoRepeat(), keyEvent->count());\n return QAbstractSpinBox::event(&periodKeyEvent);\n }\n }\n return QAbstractSpinBox::event(event);\n }\n\nsignals:\n void valueChanged();\n};\n\n#include \"bitcoinamountfield.moc\"\n\nBitcoinAmountField::BitcoinAmountField(QWidget *parent) :\n QWidget(parent),\n amount(0)\n{\n amount = new AmountSpinBox(this);\n amount->setLocale(QLocale::c());\n amount->installEventFilter(this);\n amount->setMaximumWidth(170);\n\n QHBoxLayout *layout = new QHBoxLayout(this);\n layout->addWidget(amount);\n unit = new QValueComboBox(this);\n unit->setModel(new BitcoinUnits(this));\n layout->addWidget(unit);\n layout->addStretch(1);\n layout->setContentsMargins(0,0,0,0);\n\n setLayout(layout);\n\n setFocusPolicy(Qt::TabFocus);\n setFocusProxy(amount);\n\n \/\/ If one if the widgets changes, the combined content changes as well\n connect(amount, SIGNAL(valueChanged()), this, SIGNAL(valueChanged()));\n connect(unit, SIGNAL(currentIndexChanged(int)), this, SLOT(unitChanged(int)));\n\n \/\/ Set default based on configuration\n unitChanged(unit->currentIndex());\n}\n\nvoid BitcoinAmountField::clear()\n{\n amount->clear();\n unit->setCurrentIndex(0);\n}\n\nbool BitcoinAmountField::validate()\n{\n bool valid = false;\n value(&valid);\n setValid(valid);\n return valid;\n}\n\nvoid BitcoinAmountField::setValid(bool valid)\n{\n if (valid)\n amount->setStyleSheet(\"\");\n else\n amount->setStyleSheet(STYLE_INVALID);\n}\n\nbool BitcoinAmountField::eventFilter(QObject *object, QEvent *event)\n{\n if (event->type() == QEvent::FocusIn)\n {\n \/\/ Clear invalid flag on focus\n setValid(true);\n }\n return QWidget::eventFilter(object, event);\n}\n\nQWidget *BitcoinAmountField::setupTabChain(QWidget *prev)\n{\n QWidget::setTabOrder(prev, amount);\n QWidget::setTabOrder(amount, unit);\n return unit;\n}\n\nCAmount BitcoinAmountField::value(bool *valid_out) const\n{\n return amount->value(valid_out);\n}\n\nvoid BitcoinAmountField::setValue(const CAmount& value)\n{\n amount->setValue(value);\n}\n\nvoid BitcoinAmountField::setReadOnly(bool fReadOnly)\n{\n amount->setReadOnly(fReadOnly);\n unit->setEnabled(!fReadOnly);\n}\n\nvoid BitcoinAmountField::unitChanged(int idx)\n{\n \/\/ Use description tooltip for current unit for the combobox\n unit->setToolTip(unit->itemData(idx, Qt::ToolTipRole).toString());\n\n \/\/ Determine new unit ID\n int newUnit = unit->itemData(idx, BitcoinUnits::UnitRole).toInt();\n\n amount->setDisplayUnit(newUnit);\n}\n\nvoid BitcoinAmountField::setDisplayUnit(int newUnit)\n{\n unit->setValue(newUnit);\n}\n\nvoid BitcoinAmountField::setSingleStep(const CAmount& step)\n{\n amount->setSingleStep(step);\n}\n<commit_msg>[Qt] Fix height of BitcoinAmountField<commit_after>\/\/ Copyright (c) 2011-2014 The Bitcoin developers\n\/\/ Distributed under the MIT\/X11 software license, see the accompanying\n\/\/ file COPYING or http:\/\/www.opensource.org\/licenses\/mit-license.php.\n\n#include \"bitcoinamountfield.h\"\n\n#include \"bitcoinunits.h\"\n#include \"guiconstants.h\"\n#include \"qvaluecombobox.h\"\n\n#include <QApplication>\n#include <QAbstractSpinBox>\n#include <QHBoxLayout>\n#include <QKeyEvent>\n#include <QLineEdit>\n\n\/** QSpinBox that uses fixed-point numbers internally and uses our own\n * formatting\/parsing functions.\n *\/\nclass AmountSpinBox: public QAbstractSpinBox\n{\n Q_OBJECT\npublic:\n explicit AmountSpinBox(QWidget *parent):\n QAbstractSpinBox(parent),\n currentUnit(BitcoinUnits::BTC),\n singleStep(100000) \/\/ satoshis\n {\n setAlignment(Qt::AlignRight);\n\n connect(lineEdit(), SIGNAL(textEdited(QString)), this, SIGNAL(valueChanged()));\n }\n\n QValidator::State validate(QString &text, int &pos) const\n {\n if(text.isEmpty())\n return QValidator::Intermediate;\n bool valid = false;\n parse(text, &valid);\n \/* Make sure we return Intermediate so that fixup() is called on defocus *\/\n return valid ? QValidator::Intermediate : QValidator::Invalid;\n }\n\n void fixup(QString &input) const\n {\n bool valid = false;\n CAmount val = parse(input, &valid);\n if(valid)\n {\n input = BitcoinUnits::format(currentUnit, val, false, BitcoinUnits::separatorAlways);\n lineEdit()->setText(input);\n }\n }\n\n CAmount value(bool *valid_out=0) const\n {\n return parse(text(), valid_out);\n }\n\n void setValue(const CAmount& value)\n {\n lineEdit()->setText(BitcoinUnits::format(currentUnit, value, false, BitcoinUnits::separatorAlways));\n emit valueChanged();\n }\n\n void stepBy(int steps)\n {\n bool valid = false;\n CAmount val = value(&valid);\n val = val + steps * singleStep;\n val = qMin(qMax(val, CAmount(0)), BitcoinUnits::maxMoney());\n setValue(val);\n }\n\n StepEnabled stepEnabled() const\n {\n StepEnabled rv = 0;\n if(text().isEmpty()) \/\/ Allow step-up with empty field\n return StepUpEnabled;\n bool valid = false;\n CAmount val = value(&valid);\n if(valid)\n {\n if(val > 0)\n rv |= StepDownEnabled;\n if(val < BitcoinUnits::maxMoney())\n rv |= StepUpEnabled;\n }\n return rv;\n }\n\n void setDisplayUnit(int unit)\n {\n bool valid = false;\n CAmount val = value(&valid);\n\n currentUnit = unit;\n\n if(valid)\n setValue(val);\n else\n clear();\n }\n\n void setSingleStep(const CAmount& step)\n {\n singleStep = step;\n }\n\n QSize minimumSizeHint() const\n {\n if(cachedMinimumSizeHint.isEmpty())\n {\n ensurePolished();\n\n const QFontMetrics fm(fontMetrics());\n int h = lineEdit()->minimumSizeHint().height();\n int w = fm.width(BitcoinUnits::format(BitcoinUnits::BTC, BitcoinUnits::maxMoney(), false, BitcoinUnits::separatorAlways));\n w += 2; \/\/ cursor blinking space\n\n QStyleOptionSpinBox opt;\n initStyleOption(&opt);\n QSize hint(w, h);\n QSize extra(35, 6);\n opt.rect.setSize(hint + extra);\n extra += hint - style()->subControlRect(QStyle::CC_SpinBox, &opt,\n QStyle::SC_SpinBoxEditField, this).size();\n \/\/ get closer to final result by repeating the calculation\n opt.rect.setSize(hint + extra);\n extra += hint - style()->subControlRect(QStyle::CC_SpinBox, &opt,\n QStyle::SC_SpinBoxEditField, this).size();\n hint += extra;\n hint.setHeight(h);\n\n opt.rect = rect();\n\n cachedMinimumSizeHint = style()->sizeFromContents(QStyle::CT_SpinBox, &opt, hint, this)\n .expandedTo(QApplication::globalStrut());\n }\n return cachedMinimumSizeHint;\n }\nprivate:\n int currentUnit;\n CAmount singleStep;\n mutable QSize cachedMinimumSizeHint;\n\n \/**\n * Parse a string into a number of base monetary units and\n * return validity.\n * @note Must return 0 if !valid.\n *\/\n CAmount parse(const QString &text, bool *valid_out=0) const\n {\n CAmount val = 0;\n bool valid = BitcoinUnits::parse(currentUnit, text, &val);\n if(valid)\n {\n if(val < 0 || val > BitcoinUnits::maxMoney())\n valid = false;\n }\n if(valid_out)\n *valid_out = valid;\n return valid ? val : 0;\n }\n\nprotected:\n bool event(QEvent *event)\n {\n if (event->type() == QEvent::KeyPress || event->type() == QEvent::KeyRelease)\n {\n QKeyEvent *keyEvent = static_cast<QKeyEvent *>(event);\n if (keyEvent->key() == Qt::Key_Comma)\n {\n \/\/ Translate a comma into a period\n QKeyEvent periodKeyEvent(event->type(), Qt::Key_Period, keyEvent->modifiers(), \".\", keyEvent->isAutoRepeat(), keyEvent->count());\n return QAbstractSpinBox::event(&periodKeyEvent);\n }\n }\n return QAbstractSpinBox::event(event);\n }\n\nsignals:\n void valueChanged();\n};\n\n#include \"bitcoinamountfield.moc\"\n\nBitcoinAmountField::BitcoinAmountField(QWidget *parent) :\n QWidget(parent),\n amount(0)\n{\n amount = new AmountSpinBox(this);\n amount->setLocale(QLocale::c());\n amount->installEventFilter(this);\n amount->setMaximumWidth(170);\n\n QHBoxLayout *layout = new QHBoxLayout(this);\n layout->addWidget(amount);\n unit = new QValueComboBox(this);\n unit->setModel(new BitcoinUnits(this));\n layout->addWidget(unit);\n layout->addStretch(1);\n layout->setContentsMargins(0,0,0,0);\n\n setLayout(layout);\n\n setFocusPolicy(Qt::TabFocus);\n setFocusProxy(amount);\n\n \/\/ If one if the widgets changes, the combined content changes as well\n connect(amount, SIGNAL(valueChanged()), this, SIGNAL(valueChanged()));\n connect(unit, SIGNAL(currentIndexChanged(int)), this, SLOT(unitChanged(int)));\n\n \/\/ Set default based on configuration\n unitChanged(unit->currentIndex());\n}\n\nvoid BitcoinAmountField::clear()\n{\n amount->clear();\n unit->setCurrentIndex(0);\n}\n\nbool BitcoinAmountField::validate()\n{\n bool valid = false;\n value(&valid);\n setValid(valid);\n return valid;\n}\n\nvoid BitcoinAmountField::setValid(bool valid)\n{\n if (valid)\n amount->setStyleSheet(\"\");\n else\n amount->setStyleSheet(STYLE_INVALID);\n}\n\nbool BitcoinAmountField::eventFilter(QObject *object, QEvent *event)\n{\n if (event->type() == QEvent::FocusIn)\n {\n \/\/ Clear invalid flag on focus\n setValid(true);\n }\n return QWidget::eventFilter(object, event);\n}\n\nQWidget *BitcoinAmountField::setupTabChain(QWidget *prev)\n{\n QWidget::setTabOrder(prev, amount);\n QWidget::setTabOrder(amount, unit);\n return unit;\n}\n\nCAmount BitcoinAmountField::value(bool *valid_out) const\n{\n return amount->value(valid_out);\n}\n\nvoid BitcoinAmountField::setValue(const CAmount& value)\n{\n amount->setValue(value);\n}\n\nvoid BitcoinAmountField::setReadOnly(bool fReadOnly)\n{\n amount->setReadOnly(fReadOnly);\n unit->setEnabled(!fReadOnly);\n}\n\nvoid BitcoinAmountField::unitChanged(int idx)\n{\n \/\/ Use description tooltip for current unit for the combobox\n unit->setToolTip(unit->itemData(idx, Qt::ToolTipRole).toString());\n\n \/\/ Determine new unit ID\n int newUnit = unit->itemData(idx, BitcoinUnits::UnitRole).toInt();\n\n amount->setDisplayUnit(newUnit);\n}\n\nvoid BitcoinAmountField::setDisplayUnit(int newUnit)\n{\n unit->setValue(newUnit);\n}\n\nvoid BitcoinAmountField::setSingleStep(const CAmount& step)\n{\n amount->setSingleStep(step);\n}\n<|endoftext|>"} {"text":"<commit_before>#include \"businessobjectlist.h\"\n#include \"bitcoinunits.h\"\n#include \"ui_businessobjectlist.h\"\n#include \"secdialog.h\"\n#include \"ui_secdialog.h\"\n#include \"writeorphan.h\"\n#include \"walletmodel.h\"\n#include \"guiutil.h\"\n#include \"rpcpog.h\"\n#include <QPainter>\n#include <QTableWidget>\n#include <QGridLayout>\n#include <QUrl>\n#include <QTimer>\n#include <univalue.h>\n#include <boost\/algorithm\/string\/case_conv.hpp> \/\/ for to_lower()\n\nbool bSlotsCreated = false;\n\nQStringList BusinessObjectList::GetHeaders(std::string sFields)\n{\n\tQStringList pHeaders;\n\tUniValue aBO;\n\tif (ObjectType != \"pog_leaderboard\")\n\t{\n\t\taBO\t= GetBusinessObjectByFieldValue(\"object\", \"object_name\", ObjectType);\n\t\tsFields = \"id,\" + aBO[\"fields\"].getValStr();\t\n\t}\n\t\n\tsHeaderFields = sFields;\n\n\tstd::vector<std::string> vFields = Split(sFields.c_str(),\",\");\n\tfor (int i = 0; i < (int)vFields.size(); i++)\n\t{\n\t\tstd::string sFieldName = vFields[i];\n\t\tpHeaders << GUIUtil::TOQS(sFieldName);\n\t}\n\treturn pHeaders;\n}\n\nBusinessObjectList::BusinessObjectList(const PlatformStyle *platformStyle, QWidget *parent) : ui(new Ui::BusinessObjectList)\n{\n ui->setupUi(this);\n}\n\n\nBusinessObjectList::~BusinessObjectList()\n{\n delete ui;\n}\n\nvoid BusinessObjectList::setModel(WalletModel *model)\n{\n this->model = model;\n}\n\nvoid BusinessObjectList::RefreshPogLeaderboard()\n{\n\tif (ObjectType == \"pog_leaderboard\") \n\t\tUpdateObject(\"pog_leaderboard\");\n}\n\nvoid BusinessObjectList::UpdateObject(std::string objType)\n{\n\tObjectType = objType;\n\tstd::string sFields;\n QString pString;\n\n\tif (objType == \"pog_leaderboard\")\n\t{\n\t\tsFields = \"id,nickname,address,height,amount,weight\";\n\t\tpString = GUIUtil::TOQS(GetPOGBusinessObjectList(ObjectType, sFields));\n\t\t\/\/ Update once per minute\n\t\tQTimer::singleShot(60000, this, SLOT(RefreshPogLeaderboard()));\n\t}\n\telse\n\t{\n\t\tUniValue aBO = GetBusinessObjectByFieldValue(\"object\", \"object_name\", ObjectType);\n\t\tsFields = aBO[\"fields\"].getValStr();\n\t\tpString\t= GUIUtil::TOQS(GetBusinessObjectList(ObjectType, sFields));\n\t}\n\t\/\/ Show the difficulty, my_tithes, my_nickname, grand total (amount) as grand total rows\n QStringList pHeaders = GetHeaders(sFields);\n this->createUI(pHeaders, pString);\n}\n\nvoid BusinessObjectList::addFooterRow(int& rows, int& iFooterRow, std::string sCaption, std::string sValue)\n{\n\trows++;\n ui->tableWidget->setItem(rows, 0, new QTableWidgetItem(GUIUtil::TOQS(sCaption)));\n\tui->tableWidget->setItem(rows, 1, new QTableWidgetItem(GUIUtil::TOQS(sValue)));\n}\n\nvoid BusinessObjectList::createUI(const QStringList &headers, const QString &pStr)\n{\n ui->tableWidget->setShowGrid(true);\n\tui->tableWidget->setRowCount(0);\n\tui->tableWidget->setSortingEnabled(false);\n\n\n ui->tableWidget->setSelectionMode(QAbstractItemView::SingleSelection);\n ui->tableWidget->setSelectionBehavior(QAbstractItemView::SelectRows);\n ui->tableWidget->horizontalHeader()->setStretchLastSection(true);\n\n QVector<QVector<QString> > pMatrix;\n\tif (pStr == \"\") return;\n\n pMatrix = SplitData(pStr);\n\tint rows = pMatrix.size();\n\tint iFooterRow = 0;\n\tint iAmountCol = 0;\n\tint iNameCol = 0;\n\tif (ObjectType == \"pog_leaderboard\") \n\t{\n\t\tiFooterRow += 6;\n\t\tiAmountCol = -1;\n\t\tiNameCol = GetUrlColumn(\"nickname\");\n\t}\n\telse\n\t{\n\t\tiAmountCol = GetUrlColumn(\"Amount\");\n\t\tiFooterRow = (iAmountCol > -1) ? 1 : 0;\n\t}\n\n ui->tableWidget->setRowCount(rows + iFooterRow);\n int cols = pMatrix[0].size() - 1;\n ui->tableWidget->setColumnCount(cols);\n ui->tableWidget->setHorizontalHeaderLabels(headers);\n QString s;\n\tdouble dGrandTotal = 0;\n\t\n for(int i = 0; i < rows; i++)\n\t{\n\t\tbool bHighlighted = (iNameCol > 0 && pMatrix[i][iNameCol] == GUIUtil::TOQS(msNickName));\n\t\n for(int j = 0; j < cols; j++)\n\t\t{\n\t\t\tQTableWidgetItem* q = new QTableWidgetItem(pMatrix[i][j]);\n\t\t\tif (j == iAmountCol) q = new QTableWidgetItem(cdbl(GUIUtil::FROMQS(pMatrix[i][j]), 2));\n\t\t\tui->tableWidget->setItem(i, j, q);\n\t\t}\n\t\tif (bHighlighted)\n\t\t{\n\t\t\tui->tableWidget->selectRow(i);\n\t\t\tui->tableWidget->item(i, iNameCol)->setBackground(Qt::yellow);\n\t\t}\n\n\t\tif (iAmountCol > -1)\n\t\t{\n\t\t\tdGrandTotal += cdbl(GUIUtil::FROMQS(pMatrix[i][iAmountCol]), 2);\n\t\t}\n\t}\n\t\n\tif (ObjectType == \"pog_leaderboard\")\n\t{\n\t\t\/\/ Sort by ShareWeight descending\n\t\tui->tableWidget->sortByColumn(5, Qt::DescendingOrder);\n\t\tui->tableWidget->setSortingEnabled(true);\n\t\tstd::string sXML = GUIUtil::FROMQS(pStr);\n\t\taddFooterRow(rows, iFooterRow, \"Difficulty:\", ExtractXML(sXML, \"<difficulty>\",\"<\/difficulty>\"));\n\t\taddFooterRow(rows, iFooterRow, \"My Tithes:\", ExtractXML(sXML, \"<my_tithes>\",\"<\/my_tithes>\"));\n\t\taddFooterRow(rows, iFooterRow, \"My Nick Name:\", ExtractXML(sXML, \"<my_nickname>\",\"<\/my_nickname>\"));\n\t\taddFooterRow(rows, iFooterRow, \"Total Pool Tithes:\", ExtractXML(sXML, \"<total>\",\"<\/total>\"));\n\t\taddFooterRow(rows, iFooterRow, \"Total Pool Participants:\", ExtractXML(sXML, \"<participants>\",\"<\/participants>\"));\n\t}\n\telse if (iFooterRow > 0)\n\t{\n\t\tui->tableWidget->setItem(rows, 0, new QTableWidgetItem(\"Grand Total:\"));\n\t\tui->tableWidget->setItem(rows, iAmountCol, new QTableWidgetItem(GUIUtil::TOQS(RoundToString(dGrandTotal, 2))));\n\t}\n\n ui->tableWidget->setEditTriggers(QAbstractItemView::NoEditTriggers);\n ui->tableWidget->resizeRowsToContents();\n ui->tableWidget->resizeColumnsToContents();\n ui->tableWidget->setContextMenuPolicy(Qt::CustomContextMenu);\n\n\t\/\/ Column widths should be set \n\tfor (int j=0; j < cols; j++)\n\t{\n\t\tui->tableWidget->setColumnWidth(j, 128);\n\t}\n\n\tif (!bSlotsCreated)\n\t{\n\t\tconnect(ui->tableWidget, SIGNAL(customContextMenuRequested(QPoint)), this, SLOT(slotCustomMenuRequested(QPoint)));\n\t\tbSlotsCreated = true;\n\t}\n}\n\nvoid BusinessObjectList::slotCustomMenuRequested(QPoint pos)\n{\n \/* Create an object context menu *\/\n QMenu * menu = new QMenu(this);\n \/\/ Create, Connect and Set the actions to the menu\n menu->addAction(tr(\"Navigate To\"), this, SLOT(slotNavigateTo()));\n\tmenu->addAction(tr(\"List\"), this, SLOT(slotList()));\n\tmenu->addAction(tr(\"View\"), this, SLOT(slotView()));\n\tif (ObjectType==\"orphan\")\n\t{\n\t\tif (Params().NetworkIDString() != \"main\") menu->addAction(tr(\"Write Orphan\"), this, SLOT(slotWriteOrphan()));\n\t}\n\tif (ObjectType == \"letter\")\n\t{\n\t\tif (Params().NetworkIDString() != \"main\") menu->addAction(tr(\"Review Letter\"), this, SLOT(slotReviewLetter()));\n\t}\n\n menu->popup(ui->tableWidget->viewport()->mapToGlobal(pos));\n}\n\nstd::string BusinessObjectList::GetHtmlForm(std::string PK)\n{\n\tUniValue aBO = GetBusinessObjectByFieldValue(\"object\", \"object_name\", ObjectType);\n\tstd::string sFields = aBO[\"fields\"].getValStr();\t\n\tstd::vector<std::string> vFields = Split(sFields.c_str(), \",\");\n\tstd::vector<std::string> vPK = Split(PK.c_str(), \"-\");\n\tstd::string sError = \"\";\n\tif (vPK.size() > 2)\n\t{\n\t\taBO = GetBusinessObject(vPK[0], vPK[1], sError);\n\t\tstd::string sHTML = \"<table>\";\n\t\tfor (int i = 0; i < (int)vFields.size(); i++)\n\t\t{\n\t\t\tstd::string sFieldName = vFields[i];\n\t\t\tstd::string sFV = aBO[sFieldName].getValStr();\n\t\t\tstd::string sRow = \"<tr><td>\" + sFieldName + \":<\/td><td>\" + sFV + \"<\/td><\/tr>\";\n\t\t\tsHTML += sRow;\n\t\t}\n\t\tsHTML += \"<\/table>\";\n\t\treturn sHTML;\n\t}\n\treturn \"Business object not found\";\n}\n\nint BusinessObjectList::GetUrlColumn(std::string sTarget)\n{\n\tboost::to_upper(sTarget);\n\t\/\/ UniValue aBO = GetBusinessObjectByFieldValue(\"object\", \"object_name\", ObjectType);\n\t\/\/ std::string sFields = \"id,\" + aBO[\"fields\"].getValStr();\t\n\tstd::vector<std::string> vFields = Split(sHeaderFields.c_str(), \",\");\n\tfor (int i = 0; i < (int)vFields.size(); i++)\n\t{\n\t\tstd::string sFieldName = vFields[i];\n\t\tboost::to_upper(sFieldName);\n\t\tif (sFieldName == sTarget) return i;\n\t}\n\treturn -1;\n}\n\n\nvoid BusinessObjectList::slotList()\n{\n int row = ui->tableWidget->selectionModel()->currentIndex().row();\n if(row >= 0)\n {\n\t\t\/\/ Navigate to the List of the Object\n std::string sID = GUIUtil::FROMQS(ui->tableWidget->item(row, 0)->text()); \/\/ PK-2PK-IPFS Hash of business object\n\t\tint iCol = GetUrlColumn(\"object_name\");\n\t\tif (iCol > -1)\n\t\t{\n\t\t\tstd::string sTarget = GUIUtil::FROMQS(ui->tableWidget->item(row, iCol)->text());\n\t\t\t\/\/ Close existing menu\n\t\t\tUpdateObject(sTarget);\n\t\t}\n }\n}\n\nvoid BusinessObjectList::slotReviewLetter()\n{\n\tint row = ui->tableWidget->selectionModel()->currentIndex().row();\n if(row >= 0)\n {\n QMessageBox msgBox;\n std::string id = GUIUtil::FROMQS(ui->tableWidget->item(row, 0)->text());\n\t\t\/\/ If we wrote this letter, allow edit:\n\t\tstd::string sReceivingAddress = DefaultRecAddress(BUSINESS_OBJECTS);\n\t\tint iCol = GetUrlColumn(\"receiving_address\");\n\t\tstd::string sWriterAddr = GUIUtil::FROMQS(ui->tableWidget->item(row, iCol)->text());\n\t\tbool bOwned = (sWriterAddr == sReceivingAddress && !sWriterAddr.empty());\n\t\tstd::string sMode = bOwned ? \"EDIT\" : \"REVIEW\";\n\t\tWriteOrphan *dlg = new WriteOrphan(this, sMode, \"\", id);\n\t\tdlg->show();\n\t}\n}\n\n\nvoid BusinessObjectList::slotWriteOrphan()\n{\n\tint row = ui->tableWidget->selectionModel()->currentIndex().row();\n if(row >= 0)\n {\n QMessageBox msgBox;\n std::string id = GUIUtil::FROMQS(ui->tableWidget->item(row, 0)->text());\n\t\tint iURLCol = GetUrlColumn(\"ORPHANID\");\n\t\tstd::string orphanId = GUIUtil::FROMQS(ui->tableWidget->item(row, iURLCol)->text());\n\t\t\/\/ The last argument is the letter ID, this is required on an Edit but not on an Add\n\t\tWriteOrphan *dlg = new WriteOrphan(this, \"ADD\", orphanId, \"\");\n\t\tdlg->show();\n }\n}\n\nvoid BusinessObjectList::slotView()\n{\n int row = ui->tableWidget->selectionModel()->currentIndex().row();\n if(row >= 0)\n {\n QMessageBox msgBox;\n std::string id = GUIUtil::FROMQS(ui->tableWidget->item(row, 0)->text()); \/\/ PK-2PK-IPFS Hash of business object\n\t\tmsgBox.setWindowTitle(GUIUtil::TOQS(id));\n\t msgBox.setText(GUIUtil::TOQS(GetHtmlForm(id)));\n msgBox.setStandardButtons(QMessageBox::Ok);\n msgBox.setDefaultButton(QMessageBox::Ok);\n\t\tmsgBox.exec();\n }\n}\n\n\nvoid BusinessObjectList::slotNavigateTo()\n{\n int row = ui->tableWidget->selectionModel()->currentIndex().row();\n if(row >= 0)\n {\n\t\t\/\/ Open the URL\n QMessageBox msgBox;\n\t\tint iURLCol = GetUrlColumn(\"URL\");\n\t\tif (iURLCol > -1)\n\t\t{\n\t\t\tQString Url = ui->tableWidget->item(row, iURLCol)->text();\n\t\t\tQUrl pUrl(Url);\n\t\t\tQDesktopServices::openUrl(pUrl);\n\t\t}\n }\n}\n\nQVector<QVector<QString> > BusinessObjectList::SplitData(const QString &pStr)\n{\n\tQStringList proposals = pStr.split(QRegExp(\"<object>\"),QString::SkipEmptyParts);\n int nProposals = proposals.size();\n QVector<QVector<QString> > proposalMatrix;\n for (int i=0; i < nProposals; i++)\n {\n QStringList proposalDetail = proposals[i].split(QRegExp(\"<col>\"));\n int detailSize = proposalDetail.size();\n\t\tif (detailSize > 1)\n\t\t{\n\t\t\tproposalMatrix.append(QVector<QString>());\n\t\t\tfor (int j = 0; j < detailSize; j++)\n\t\t\t{\n\t\t\t\tQString sData = proposalDetail[j];\n\t\t\t\t\/* Reserved for BitcoinUnits\n\t\t\t\t\tsData = BitcoinUnits::format(2, cdbl(GUIUtil::FROMQS(sData), 2) * 100, false, BitcoinUnits::separatorAlways);\t\t\n\t\t\t\t*\/\n\t\t\t\tproposalMatrix[i].append(sData);\n\t\t\t}\n\t\t}\n }\n\treturn proposalMatrix;\n}\n<commit_msg>Issue #74 don't update PoG leaderboard till blockchain is synced<commit_after>#include \"businessobjectlist.h\"\n#include \"bitcoinunits.h\"\n#include \"ui_businessobjectlist.h\"\n#include \"secdialog.h\"\n#include \"masternode-sync.h\"\n#include \"ui_secdialog.h\"\n#include \"writeorphan.h\"\n#include \"walletmodel.h\"\n#include \"guiutil.h\"\n#include \"rpcpog.h\"\n#include <QPainter>\n#include <QTableWidget>\n#include <QGridLayout>\n#include <QUrl>\n#include <QTimer>\n#include <univalue.h>\n#include <boost\/algorithm\/string\/case_conv.hpp> \/\/ for to_lower()\n\nbool bSlotsCreated = false;\n\nQStringList BusinessObjectList::GetHeaders(std::string sFields)\n{\n\tQStringList pHeaders;\n\tUniValue aBO;\n\tif (ObjectType != \"pog_leaderboard\")\n\t{\n\t\taBO\t= GetBusinessObjectByFieldValue(\"object\", \"object_name\", ObjectType);\n\t\tsFields = \"id,\" + aBO[\"fields\"].getValStr();\t\n\t}\n\t\n\tsHeaderFields = sFields;\n\n\tstd::vector<std::string> vFields = Split(sFields.c_str(),\",\");\n\tfor (int i = 0; i < (int)vFields.size(); i++)\n\t{\n\t\tstd::string sFieldName = vFields[i];\n\t\tpHeaders << GUIUtil::TOQS(sFieldName);\n\t}\n\treturn pHeaders;\n}\n\nBusinessObjectList::BusinessObjectList(const PlatformStyle *platformStyle, QWidget *parent) : ui(new Ui::BusinessObjectList)\n{\n ui->setupUi(this);\n}\n\n\nBusinessObjectList::~BusinessObjectList()\n{\n delete ui;\n}\n\nvoid BusinessObjectList::setModel(WalletModel *model)\n{\n this->model = model;\n}\n\nvoid BusinessObjectList::RefreshPogLeaderboard()\n{\n\tif (ObjectType == \"pog_leaderboard\") \n\t\tUpdateObject(\"pog_leaderboard\");\n}\n\nvoid BusinessObjectList::UpdateObject(std::string objType)\n{\n\tObjectType = objType;\n\tstd::string sFields;\n QString pString;\n\n if (objType == \"pog_leaderboard\" && masternodeSync.IsBlockchainSynced() )\n\t{\n\t\tsFields = \"id,nickname,address,height,amount,weight\";\n\t\tpString = GUIUtil::TOQS(GetPOGBusinessObjectList(ObjectType, sFields));\n\t\t\/\/ Update once per minute\n\t\tQTimer::singleShot(60000, this, SLOT(RefreshPogLeaderboard()));\n\t}\n\telse\n\t{\n\t\tUniValue aBO = GetBusinessObjectByFieldValue(\"object\", \"object_name\", ObjectType);\n\t\tsFields = aBO[\"fields\"].getValStr();\n\t\tpString\t= GUIUtil::TOQS(GetBusinessObjectList(ObjectType, sFields));\n\t}\n\t\/\/ Show the difficulty, my_tithes, my_nickname, grand total (amount) as grand total rows\n QStringList pHeaders = GetHeaders(sFields);\n this->createUI(pHeaders, pString);\n}\n\nvoid BusinessObjectList::addFooterRow(int& rows, int& iFooterRow, std::string sCaption, std::string sValue)\n{\n\trows++;\n ui->tableWidget->setItem(rows, 0, new QTableWidgetItem(GUIUtil::TOQS(sCaption)));\n\tui->tableWidget->setItem(rows, 1, new QTableWidgetItem(GUIUtil::TOQS(sValue)));\n}\n\nvoid BusinessObjectList::createUI(const QStringList &headers, const QString &pStr)\n{\n ui->tableWidget->setShowGrid(true);\n\tui->tableWidget->setRowCount(0);\n\tui->tableWidget->setSortingEnabled(false);\n\n\n ui->tableWidget->setSelectionMode(QAbstractItemView::SingleSelection);\n ui->tableWidget->setSelectionBehavior(QAbstractItemView::SelectRows);\n ui->tableWidget->horizontalHeader()->setStretchLastSection(true);\n\n QVector<QVector<QString> > pMatrix;\n\tif (pStr == \"\") return;\n\n pMatrix = SplitData(pStr);\n\tint rows = pMatrix.size();\n\tint iFooterRow = 0;\n\tint iAmountCol = 0;\n\tint iNameCol = 0;\n\tif (ObjectType == \"pog_leaderboard\") \n\t{\n\t\tiFooterRow += 6;\n\t\tiAmountCol = -1;\n\t\tiNameCol = GetUrlColumn(\"nickname\");\n\t}\n\telse\n\t{\n\t\tiAmountCol = GetUrlColumn(\"Amount\");\n\t\tiFooterRow = (iAmountCol > -1) ? 1 : 0;\n\t}\n\n ui->tableWidget->setRowCount(rows + iFooterRow);\n int cols = pMatrix[0].size() - 1;\n ui->tableWidget->setColumnCount(cols);\n ui->tableWidget->setHorizontalHeaderLabels(headers);\n QString s;\n\tdouble dGrandTotal = 0;\n\t\n for(int i = 0; i < rows; i++)\n\t{\n\t\tbool bHighlighted = (iNameCol > 0 && pMatrix[i][iNameCol] == GUIUtil::TOQS(msNickName));\n\t\n for(int j = 0; j < cols; j++)\n\t\t{\n\t\t\tQTableWidgetItem* q = new QTableWidgetItem(pMatrix[i][j]);\n\t\t\tif (j == iAmountCol) q = new QTableWidgetItem(cdbl(GUIUtil::FROMQS(pMatrix[i][j]), 2));\n\t\t\tui->tableWidget->setItem(i, j, q);\n\t\t}\n\t\tif (bHighlighted)\n\t\t{\n\t\t\tui->tableWidget->selectRow(i);\n\t\t\tui->tableWidget->item(i, iNameCol)->setBackground(Qt::yellow);\n\t\t}\n\n\t\tif (iAmountCol > -1)\n\t\t{\n\t\t\tdGrandTotal += cdbl(GUIUtil::FROMQS(pMatrix[i][iAmountCol]), 2);\n\t\t}\n\t}\n\t\n\tif (ObjectType == \"pog_leaderboard\")\n\t{\n\t\t\/\/ Sort by ShareWeight descending\n\t\tui->tableWidget->sortByColumn(5, Qt::DescendingOrder);\n\t\tui->tableWidget->setSortingEnabled(true);\n\t\tstd::string sXML = GUIUtil::FROMQS(pStr);\n\t\taddFooterRow(rows, iFooterRow, \"Difficulty:\", ExtractXML(sXML, \"<difficulty>\",\"<\/difficulty>\"));\n\t\taddFooterRow(rows, iFooterRow, \"My Tithes:\", ExtractXML(sXML, \"<my_tithes>\",\"<\/my_tithes>\"));\n\t\taddFooterRow(rows, iFooterRow, \"My Nick Name:\", ExtractXML(sXML, \"<my_nickname>\",\"<\/my_nickname>\"));\n\t\taddFooterRow(rows, iFooterRow, \"Total Pool Tithes:\", ExtractXML(sXML, \"<total>\",\"<\/total>\"));\n\t\taddFooterRow(rows, iFooterRow, \"Total Pool Participants:\", ExtractXML(sXML, \"<participants>\",\"<\/participants>\"));\n\t}\n\telse if (iFooterRow > 0)\n\t{\n\t\tui->tableWidget->setItem(rows, 0, new QTableWidgetItem(\"Grand Total:\"));\n\t\tui->tableWidget->setItem(rows, iAmountCol, new QTableWidgetItem(GUIUtil::TOQS(RoundToString(dGrandTotal, 2))));\n\t}\n\n ui->tableWidget->setEditTriggers(QAbstractItemView::NoEditTriggers);\n ui->tableWidget->resizeRowsToContents();\n ui->tableWidget->resizeColumnsToContents();\n ui->tableWidget->setContextMenuPolicy(Qt::CustomContextMenu);\n\n\t\/\/ Column widths should be set \n\tfor (int j=0; j < cols; j++)\n\t{\n\t\tui->tableWidget->setColumnWidth(j, 128);\n\t}\n\n\tif (!bSlotsCreated)\n\t{\n\t\tconnect(ui->tableWidget, SIGNAL(customContextMenuRequested(QPoint)), this, SLOT(slotCustomMenuRequested(QPoint)));\n\t\tbSlotsCreated = true;\n\t}\n}\n\nvoid BusinessObjectList::slotCustomMenuRequested(QPoint pos)\n{\n \/* Create an object context menu *\/\n QMenu * menu = new QMenu(this);\n \/\/ Create, Connect and Set the actions to the menu\n menu->addAction(tr(\"Navigate To\"), this, SLOT(slotNavigateTo()));\n\tmenu->addAction(tr(\"List\"), this, SLOT(slotList()));\n\tmenu->addAction(tr(\"View\"), this, SLOT(slotView()));\n\tif (ObjectType==\"orphan\")\n\t{\n\t\tif (Params().NetworkIDString() != \"main\") menu->addAction(tr(\"Write Orphan\"), this, SLOT(slotWriteOrphan()));\n\t}\n\tif (ObjectType == \"letter\")\n\t{\n\t\tif (Params().NetworkIDString() != \"main\") menu->addAction(tr(\"Review Letter\"), this, SLOT(slotReviewLetter()));\n\t}\n\n menu->popup(ui->tableWidget->viewport()->mapToGlobal(pos));\n}\n\nstd::string BusinessObjectList::GetHtmlForm(std::string PK)\n{\n\tUniValue aBO = GetBusinessObjectByFieldValue(\"object\", \"object_name\", ObjectType);\n\tstd::string sFields = aBO[\"fields\"].getValStr();\t\n\tstd::vector<std::string> vFields = Split(sFields.c_str(), \",\");\n\tstd::vector<std::string> vPK = Split(PK.c_str(), \"-\");\n\tstd::string sError = \"\";\n\tif (vPK.size() > 2)\n\t{\n\t\taBO = GetBusinessObject(vPK[0], vPK[1], sError);\n\t\tstd::string sHTML = \"<table>\";\n\t\tfor (int i = 0; i < (int)vFields.size(); i++)\n\t\t{\n\t\t\tstd::string sFieldName = vFields[i];\n\t\t\tstd::string sFV = aBO[sFieldName].getValStr();\n\t\t\tstd::string sRow = \"<tr><td>\" + sFieldName + \":<\/td><td>\" + sFV + \"<\/td><\/tr>\";\n\t\t\tsHTML += sRow;\n\t\t}\n\t\tsHTML += \"<\/table>\";\n\t\treturn sHTML;\n\t}\n\treturn \"Business object not found\";\n}\n\nint BusinessObjectList::GetUrlColumn(std::string sTarget)\n{\n\tboost::to_upper(sTarget);\n\t\/\/ UniValue aBO = GetBusinessObjectByFieldValue(\"object\", \"object_name\", ObjectType);\n\t\/\/ std::string sFields = \"id,\" + aBO[\"fields\"].getValStr();\t\n\tstd::vector<std::string> vFields = Split(sHeaderFields.c_str(), \",\");\n\tfor (int i = 0; i < (int)vFields.size(); i++)\n\t{\n\t\tstd::string sFieldName = vFields[i];\n\t\tboost::to_upper(sFieldName);\n\t\tif (sFieldName == sTarget) return i;\n\t}\n\treturn -1;\n}\n\n\nvoid BusinessObjectList::slotList()\n{\n int row = ui->tableWidget->selectionModel()->currentIndex().row();\n if(row >= 0)\n {\n\t\t\/\/ Navigate to the List of the Object\n std::string sID = GUIUtil::FROMQS(ui->tableWidget->item(row, 0)->text()); \/\/ PK-2PK-IPFS Hash of business object\n\t\tint iCol = GetUrlColumn(\"object_name\");\n\t\tif (iCol > -1)\n\t\t{\n\t\t\tstd::string sTarget = GUIUtil::FROMQS(ui->tableWidget->item(row, iCol)->text());\n\t\t\t\/\/ Close existing menu\n\t\t\tUpdateObject(sTarget);\n\t\t}\n }\n}\n\nvoid BusinessObjectList::slotReviewLetter()\n{\n\tint row = ui->tableWidget->selectionModel()->currentIndex().row();\n if(row >= 0)\n {\n QMessageBox msgBox;\n std::string id = GUIUtil::FROMQS(ui->tableWidget->item(row, 0)->text());\n\t\t\/\/ If we wrote this letter, allow edit:\n\t\tstd::string sReceivingAddress = DefaultRecAddress(BUSINESS_OBJECTS);\n\t\tint iCol = GetUrlColumn(\"receiving_address\");\n\t\tstd::string sWriterAddr = GUIUtil::FROMQS(ui->tableWidget->item(row, iCol)->text());\n\t\tbool bOwned = (sWriterAddr == sReceivingAddress && !sWriterAddr.empty());\n\t\tstd::string sMode = bOwned ? \"EDIT\" : \"REVIEW\";\n\t\tWriteOrphan *dlg = new WriteOrphan(this, sMode, \"\", id);\n\t\tdlg->show();\n\t}\n}\n\n\nvoid BusinessObjectList::slotWriteOrphan()\n{\n\tint row = ui->tableWidget->selectionModel()->currentIndex().row();\n if(row >= 0)\n {\n QMessageBox msgBox;\n std::string id = GUIUtil::FROMQS(ui->tableWidget->item(row, 0)->text());\n\t\tint iURLCol = GetUrlColumn(\"ORPHANID\");\n\t\tstd::string orphanId = GUIUtil::FROMQS(ui->tableWidget->item(row, iURLCol)->text());\n\t\t\/\/ The last argument is the letter ID, this is required on an Edit but not on an Add\n\t\tWriteOrphan *dlg = new WriteOrphan(this, \"ADD\", orphanId, \"\");\n\t\tdlg->show();\n }\n}\n\nvoid BusinessObjectList::slotView()\n{\n int row = ui->tableWidget->selectionModel()->currentIndex().row();\n if(row >= 0)\n {\n QMessageBox msgBox;\n std::string id = GUIUtil::FROMQS(ui->tableWidget->item(row, 0)->text()); \/\/ PK-2PK-IPFS Hash of business object\n\t\tmsgBox.setWindowTitle(GUIUtil::TOQS(id));\n\t msgBox.setText(GUIUtil::TOQS(GetHtmlForm(id)));\n msgBox.setStandardButtons(QMessageBox::Ok);\n msgBox.setDefaultButton(QMessageBox::Ok);\n\t\tmsgBox.exec();\n }\n}\n\n\nvoid BusinessObjectList::slotNavigateTo()\n{\n int row = ui->tableWidget->selectionModel()->currentIndex().row();\n if(row >= 0)\n {\n\t\t\/\/ Open the URL\n QMessageBox msgBox;\n\t\tint iURLCol = GetUrlColumn(\"URL\");\n\t\tif (iURLCol > -1)\n\t\t{\n\t\t\tQString Url = ui->tableWidget->item(row, iURLCol)->text();\n\t\t\tQUrl pUrl(Url);\n\t\t\tQDesktopServices::openUrl(pUrl);\n\t\t}\n }\n}\n\nQVector<QVector<QString> > BusinessObjectList::SplitData(const QString &pStr)\n{\n\tQStringList proposals = pStr.split(QRegExp(\"<object>\"),QString::SkipEmptyParts);\n int nProposals = proposals.size();\n QVector<QVector<QString> > proposalMatrix;\n for (int i=0; i < nProposals; i++)\n {\n QStringList proposalDetail = proposals[i].split(QRegExp(\"<col>\"));\n int detailSize = proposalDetail.size();\n\t\tif (detailSize > 1)\n\t\t{\n\t\t\tproposalMatrix.append(QVector<QString>());\n\t\t\tfor (int j = 0; j < detailSize; j++)\n\t\t\t{\n\t\t\t\tQString sData = proposalDetail[j];\n\t\t\t\t\/* Reserved for BitcoinUnits\n\t\t\t\t\tsData = BitcoinUnits::format(2, cdbl(GUIUtil::FROMQS(sData), 2) * 100, false, BitcoinUnits::separatorAlways);\t\t\n\t\t\t\t*\/\n\t\t\t\tproposalMatrix[i].append(sData);\n\t\t\t}\n\t\t}\n }\n\treturn proposalMatrix;\n}\n<|endoftext|>"} {"text":"<commit_before>#ifndef FILESYSTEM_TEST_HELPER_HPP\n#define FILESYSTEM_TEST_HELPER_HPP\n\n#include <experimental\/filesystem>\n#include <cassert>\n#include <cstdio> \/\/ for printf\n#include <string>\n#include <fstream>\n#include <random>\n#include <chrono>\n\nnamespace fs = std::experimental::filesystem;\n\n\/\/ static test helpers\n\n#ifndef LIBCXX_FILESYSTEM_STATIC_TEST_ROOT\n#warning \"STATIC TESTS DISABLED\"\n#else \/\/ LIBCXX_FILESYSTEM_STATIC_TEST_ROOT\n\nnamespace StaticEnv {\n\ninline fs::path makePath(fs::path const& p) {\n static const fs::path env_path = LIBCXX_FILESYSTEM_STATIC_TEST_ROOT;\n return env_path \/ p;\n}\n\nstatic const fs::path Root = LIBCXX_FILESYSTEM_STATIC_TEST_ROOT;\n\nstatic const fs::path TestFileList[] = {\n makePath(\"empty_file\"),\n makePath(\"non_empty_file\"),\n makePath(\"dir1\/file1\"),\n makePath(\"dir1\/file2\")\n};\nconst std::size_t TestFileListSize = sizeof(TestFileList) \/ sizeof(fs::path);\n\nstatic const fs::path TestDirList[] = {\n makePath(\"dir1\"),\n makePath(\"dir1\/dir2\"),\n makePath(\"dir1\/dir2\/dir3\")\n};\nconst std::size_t TestDirListSize = sizeof(TestDirList) \/ sizeof(fs::path);\n\nstatic const fs::path File = TestFileList[0];\nstatic const fs::path Dir = TestDirList[0];\nstatic const fs::path Dir2 = TestDirList[1];\nstatic const fs::path Dir3 = TestDirList[2];\nstatic const fs::path SymlinkToFile = makePath(\"symlink_to_empty_file\");\nstatic const fs::path SymlinkToDir = makePath(\"symlink_to_dir\");\nstatic const fs::path BadSymlink = makePath(\"bad_symlink\");\nstatic const fs::path DNE = makePath(\"DNE\");\nstatic const fs::path EmptyFile = TestFileList[0];\nstatic const fs::path NonEmptyFile = TestFileList[1];\nstatic const fs::path CharFile = \"\/dev\/null\"; \/\/ Hopefully this exists\n\nstatic const fs::path DirIterationList[] = {\n makePath(\"dir1\/dir2\"),\n makePath(\"dir1\/file1\"),\n makePath(\"dir1\/file2\")\n};\nconst std::size_t DirIterationListSize = sizeof(DirIterationList)\n \/ sizeof(fs::path);\n\nstatic const fs::path DirIterationListDepth1[] = {\n makePath(\"dir1\/dir2\/afile3\"),\n makePath(\"dir1\/dir2\/dir3\"),\n makePath(\"dir1\/dir2\/symlink_to_dir3\"),\n makePath(\"dir1\/dir2\/file4\"),\n};\n\nstatic const fs::path RecDirIterationList[] = {\n makePath(\"dir1\/dir2\"),\n makePath(\"dir1\/file1\"),\n makePath(\"dir1\/file2\"),\n makePath(\"dir1\/dir2\/afile3\"),\n makePath(\"dir1\/dir2\/dir3\"),\n makePath(\"dir1\/dir2\/symlink_to_dir3\"),\n makePath(\"dir1\/dir2\/file4\"),\n makePath(\"dir1\/dir2\/dir3\/file5\")\n};\n\nstatic const fs::path RecDirFollowSymlinksIterationList[] = {\n makePath(\"dir1\/dir2\"),\n makePath(\"dir1\/file1\"),\n makePath(\"dir1\/file2\"),\n makePath(\"dir1\/dir2\/afile3\"),\n makePath(\"dir1\/dir2\/dir3\"),\n makePath(\"dir1\/dir2\/file4\"),\n makePath(\"dir1\/dir2\/dir3\/file5\"),\n makePath(\"dir1\/dir2\/symlink_to_dir3\"),\n makePath(\"dir1\/dir2\/symlink_to_dir3\/file5\"),\n};\n\n} \/\/ namespace StaticEnv\n\n#endif \/\/ LIBCXX_FILESYSTEM_STATIC_TEST_ROOT\n\n#ifndef LIBCXX_FILESYSTEM_DYNAMIC_TEST_ROOT\n#warning LIBCXX_FILESYSTEM_DYNAMIC_TEST_ROOT must be defined\n#else \/\/ LIBCXX_FILESYSTEM_DYNAMIC_TEST_ROOT\n\n#ifndef LIBCXX_FILESYSTEM_DYNAMIC_TEST_HELPER\n#error LIBCXX_FILESYSTEM_DYNAMIC_TEST_HELPER must be defined\n#endif\n\nstruct scoped_test_env\n{\n scoped_test_env() : test_root(random_env_path())\n { fs_helper_run(fs_make_cmd(\"init_test_directory\", test_root)); }\n\n ~scoped_test_env()\n { fs_helper_run(fs_make_cmd(\"destroy_test_directory\", test_root)); }\n\n scoped_test_env(scoped_test_env const &) = delete;\n scoped_test_env & operator=(scoped_test_env const &) = delete;\n\n fs::path make_env_path(std::string p) { return sanitize_path(p); }\n\n std::string sanitize_path(std::string raw) {\n assert(raw.find(\"..\") == std::string::npos);\n std::string const& root = test_root.native();\n if (root.compare(0, root.size(), raw, 0, root.size()) != 0) {\n assert(raw.front() != '\\\\');\n fs::path tmp(test_root);\n tmp \/= raw;\n return std::move(const_cast<std::string&>(tmp.native()));\n }\n return raw;\n }\n\n std::string create_file(std::string filename, std::size_t size = 0) {\n filename = sanitize_path(std::move(filename));\n std::string out_str(size, 'a');\n {\n std::ofstream out(filename.c_str());\n out << out_str;\n }\n return filename;\n }\n\n std::string create_dir(std::string filename) {\n filename = sanitize_path(std::move(filename));\n fs_helper_run(fs_make_cmd(\"create_dir\", filename));\n return filename;\n }\n\n std::string create_symlink(std::string source, std::string to) {\n source = sanitize_path(std::move(source));\n to = sanitize_path(std::move(to));\n fs_helper_run(fs_make_cmd(\"create_symlink\", source, to));\n return to;\n }\n\n std::string create_hardlink(std::string source, std::string to) {\n source = sanitize_path(std::move(source));\n to = sanitize_path(std::move(to));\n fs_helper_run(fs_make_cmd(\"create_hardlink\", source, to));\n return to;\n }\n\n std::string create_fifo(std::string file) {\n file = sanitize_path(std::move(file));\n fs_helper_run(fs_make_cmd(\"create_fifo\", file));\n return file;\n }\n\n \/\/ OS X and FreeBSD doesn't support socket files so we shouldn't even\n \/\/ allow tests to call this unguarded.\n#if !defined(__FreeBSD__) && !defined(__APPLE__)\n std::string create_socket(std::string file) {\n file = sanitize_path(std::move(file));\n fs_helper_run(fs_make_cmd(\"create_socket\", file));\n return file;\n }\n#endif\n\n fs::path const test_root;\n\nprivate:\n static char to_hex(int ch) {\n return ch < 10 ? static_cast<char>('0' + ch)\n : static_cast<char>('a' + (ch - 10));\n }\n\n static char random_hex_char() {\n static std::mt19937 rd { std::random_device{}() };\n static std::uniform_int_distribution<int> mrand{0, 15};\n return to_hex( mrand(rd) );\n }\n\n static std::string unique_path_suffix() {\n std::string model = \"test.%%%%%%\";\n for (auto & ch : model) {\n if (ch == '%') ch = random_hex_char();\n }\n return model;\n }\n\n \/\/ This could potentially introduce a filesystem race with other tests\n \/\/ running at the same time, but oh well, it's just test code.\n static inline fs::path random_env_path() {\n static const char* env_path = LIBCXX_FILESYSTEM_DYNAMIC_TEST_ROOT;\n fs::path p = fs::path(env_path) \/ unique_path_suffix();\n assert(p.parent_path() == env_path);\n return p;\n }\n\n static inline std::string make_arg(std::string const& arg) {\n return \"'\" + arg + \"'\";\n }\n\n static inline std::string make_arg(std::size_t arg) {\n return std::to_string(arg);\n }\n\n template <class T>\n static inline std::string\n fs_make_cmd(std::string const& cmd_name, T const& arg) {\n return cmd_name + \"(\" + make_arg(arg) + \")\";\n }\n\n template <class T, class U>\n static inline std::string\n fs_make_cmd(std::string const& cmd_name, T const& arg1, U const& arg2) {\n return cmd_name + \"(\" + make_arg(arg1) + \", \" + make_arg(arg2) + \")\";\n }\n\n static inline void fs_helper_run(std::string const& raw_cmd) {\n \/\/ check that the fs test root in the enviroment matches what we were\n \/\/ compiled with.\n static bool checked = checkDynamicTestRoot();\n std::string cmd = LIBCXX_FILESYSTEM_DYNAMIC_TEST_HELPER;\n cmd += \" \\\"\" + raw_cmd + \"\\\"\";\n int ret = std::system(cmd.c_str());\n assert(ret == 0);\n }\n\n static bool checkDynamicTestRoot() {\n char* fs_root = std::getenv(\"LIBCXX_FILESYSTEM_DYNAMIC_TEST_ROOT\");\n if (!fs_root) {\n std::printf(\"ERROR: LIBCXX_FILESYSTEM_DYNAMIC_TEST_ROOT must be a defined \"\n \"environment variable when running the test.\\n\");\n std::abort();\n }\n if (std::string(fs_root) != LIBCXX_FILESYSTEM_DYNAMIC_TEST_ROOT) {\n std::printf(\"ERROR: LIBCXX_FILESYSTEM_DYNAMIC_TEST_ROOT enviroment variable\"\n \" must have the same value as when the test was compiled.\\n\");\n std::printf(\" Current Value: '%s'\\n\", fs_root);\n std::printf(\" Expected Value: '%s'\\n\", LIBCXX_FILESYSTEM_DYNAMIC_TEST_ROOT);\n std::abort();\n }\n return true;\n }\n\n};\n\n#endif \/\/ LIBCXX_FILESYSTEM_DYNAMIC_TEST_ROOT\n\n\/\/ Misc test types\n\n#define CONCAT2(LHS, RHS) LHS##RHS\n#define CONCAT(LHS, RHS) CONCAT2(LHS, RHS)\n#define MKSTR(Str) {Str, CONCAT(L, Str), CONCAT(u, Str), CONCAT(U, Str)}\n\nstruct MultiStringType {\n const char* s;\n const wchar_t* w;\n const char16_t* u16;\n const char32_t* u32;\n\n operator const char* () const { return s; }\n operator const wchar_t* () const { return w; }\n operator const char16_t* () const { return u16; }\n operator const char32_t* () const { return u32; }\n};\n\nconst MultiStringType PathList[] = {\n MKSTR(\"\"),\n MKSTR(\" \"),\n MKSTR(\"\/\/\"),\n MKSTR(\".\"),\n MKSTR(\"..\"),\n MKSTR(\"foo\"),\n MKSTR(\"\/\"),\n MKSTR(\"\/foo\"),\n MKSTR(\"foo\/\"),\n MKSTR(\"\/foo\/\"),\n MKSTR(\"foo\/bar\"),\n MKSTR(\"\/foo\/bar\"),\n MKSTR(\"\/\/net\"),\n MKSTR(\"\/\/net\/foo\"),\n MKSTR(\"\/\/\/foo\/\/\/\"),\n MKSTR(\"\/\/\/foo\/\/\/bar\"),\n MKSTR(\"\/.\"),\n MKSTR(\".\/\"),\n MKSTR(\"\/..\"),\n MKSTR(\"..\/\"),\n MKSTR(\"foo\/.\"),\n MKSTR(\"foo\/..\"),\n MKSTR(\"foo\/.\/\"),\n MKSTR(\"foo\/.\/bar\"),\n MKSTR(\"foo\/..\/\"),\n MKSTR(\"foo\/..\/bar\"),\n MKSTR(\"c:\"),\n MKSTR(\"c:\/\"),\n MKSTR(\"c:foo\"),\n MKSTR(\"c:\/foo\"),\n MKSTR(\"c:foo\/\"),\n MKSTR(\"c:\/foo\/\"),\n MKSTR(\"c:\/foo\/bar\"),\n MKSTR(\"prn:\"),\n MKSTR(\"c:\\\\\"),\n MKSTR(\"c:\\\\foo\"),\n MKSTR(\"c:foo\\\\\"),\n MKSTR(\"c:\\\\foo\\\\\"),\n MKSTR(\"c:\\\\foo\/\"),\n MKSTR(\"c:\/foo\\\\bar\"),\n MKSTR(\"\/\/\"),\n MKSTR(\"\/finally\/we\/need\/one\/really\/really\/really\/really\/really\/really\/really\/long\/string\")\n};\nconst unsigned PathListSize = sizeof(PathList) \/ sizeof(MultiStringType);\n\ntemplate <class Iter>\nIter IterEnd(Iter B) {\n using VT = typename std::iterator_traits<Iter>::value_type;\n for (; *B != VT{}; ++B)\n ;\n return B;\n}\n\ntemplate <class CharT>\nconst CharT* StrEnd(CharT const* P) {\n return IterEnd(P);\n}\n\ntemplate <class CharT>\nstd::size_t StrLen(CharT const* P) {\n return StrEnd(P) - P;\n}\n\n\/\/ Testing the allocation behavior of the code_cvt functions requires\n\/\/ *knowing* that the allocation was not done by \"path::__str_\".\n\/\/ This hack forces path to allocate enough memory.\ninline void PathReserve(fs::path& p, std::size_t N) {\n auto const& native_ref = p.native();\n const_cast<std::string&>(native_ref).reserve(N);\n}\n\ntemplate <class Iter1, class Iter2>\nbool checkCollectionsEqual(\n Iter1 start1, Iter1 const end1\n , Iter2 start2, Iter2 const end2\n )\n{\n while (start1 != end1 && start2 != end2) {\n if (*start1 != *start2) {\n return false;\n }\n ++start1; ++start2;\n }\n return (start1 == end1 && start2 == end2);\n}\n\n\ntemplate <class Iter1, class Iter2>\nbool checkCollectionsEqualBackwards(\n Iter1 const start1, Iter1 end1\n , Iter2 const start2, Iter2 end2\n )\n{\n while (start1 != end1 && start2 != end2) {\n --end1; --end2;\n if (*end1 != *end2) {\n return false;\n }\n }\n return (start1 == end1 && start2 == end2);\n}\n\n\/\/ We often need to test that the error_code was cleared if no error occurs\n\/\/ this function returns a error_code which is set to an error that will\n\/\/ never be returned by the filesystem functions.\ninline std::error_code GetTestEC() {\n return std::make_error_code(std::errc::address_family_not_supported);\n}\n\n\/\/ Provide our own Sleep routine since std::this_thread::sleep_for is not\n\/\/ available in single-threaded mode.\nvoid SleepFor(std::chrono::seconds dur) {\n using namespace std::chrono;\n const auto curr_time = steady_clock::now();\n auto wake_time = curr_time + dur;\n while (steady_clock::now() < wake_time)\n ;\n}\n\n#endif \/* FILESYSTEM_TEST_HELPER_HPP *\/\n<commit_msg>Fix SleepFor(...) helper when a monotonic clock is not available.<commit_after>#ifndef FILESYSTEM_TEST_HELPER_HPP\n#define FILESYSTEM_TEST_HELPER_HPP\n\n#include <experimental\/filesystem>\n#include <cassert>\n#include <cstdio> \/\/ for printf\n#include <string>\n#include <fstream>\n#include <random>\n#include <chrono>\n\nnamespace fs = std::experimental::filesystem;\n\n\/\/ static test helpers\n\n#ifndef LIBCXX_FILESYSTEM_STATIC_TEST_ROOT\n#warning \"STATIC TESTS DISABLED\"\n#else \/\/ LIBCXX_FILESYSTEM_STATIC_TEST_ROOT\n\nnamespace StaticEnv {\n\ninline fs::path makePath(fs::path const& p) {\n static const fs::path env_path = LIBCXX_FILESYSTEM_STATIC_TEST_ROOT;\n return env_path \/ p;\n}\n\nstatic const fs::path Root = LIBCXX_FILESYSTEM_STATIC_TEST_ROOT;\n\nstatic const fs::path TestFileList[] = {\n makePath(\"empty_file\"),\n makePath(\"non_empty_file\"),\n makePath(\"dir1\/file1\"),\n makePath(\"dir1\/file2\")\n};\nconst std::size_t TestFileListSize = sizeof(TestFileList) \/ sizeof(fs::path);\n\nstatic const fs::path TestDirList[] = {\n makePath(\"dir1\"),\n makePath(\"dir1\/dir2\"),\n makePath(\"dir1\/dir2\/dir3\")\n};\nconst std::size_t TestDirListSize = sizeof(TestDirList) \/ sizeof(fs::path);\n\nstatic const fs::path File = TestFileList[0];\nstatic const fs::path Dir = TestDirList[0];\nstatic const fs::path Dir2 = TestDirList[1];\nstatic const fs::path Dir3 = TestDirList[2];\nstatic const fs::path SymlinkToFile = makePath(\"symlink_to_empty_file\");\nstatic const fs::path SymlinkToDir = makePath(\"symlink_to_dir\");\nstatic const fs::path BadSymlink = makePath(\"bad_symlink\");\nstatic const fs::path DNE = makePath(\"DNE\");\nstatic const fs::path EmptyFile = TestFileList[0];\nstatic const fs::path NonEmptyFile = TestFileList[1];\nstatic const fs::path CharFile = \"\/dev\/null\"; \/\/ Hopefully this exists\n\nstatic const fs::path DirIterationList[] = {\n makePath(\"dir1\/dir2\"),\n makePath(\"dir1\/file1\"),\n makePath(\"dir1\/file2\")\n};\nconst std::size_t DirIterationListSize = sizeof(DirIterationList)\n \/ sizeof(fs::path);\n\nstatic const fs::path DirIterationListDepth1[] = {\n makePath(\"dir1\/dir2\/afile3\"),\n makePath(\"dir1\/dir2\/dir3\"),\n makePath(\"dir1\/dir2\/symlink_to_dir3\"),\n makePath(\"dir1\/dir2\/file4\"),\n};\n\nstatic const fs::path RecDirIterationList[] = {\n makePath(\"dir1\/dir2\"),\n makePath(\"dir1\/file1\"),\n makePath(\"dir1\/file2\"),\n makePath(\"dir1\/dir2\/afile3\"),\n makePath(\"dir1\/dir2\/dir3\"),\n makePath(\"dir1\/dir2\/symlink_to_dir3\"),\n makePath(\"dir1\/dir2\/file4\"),\n makePath(\"dir1\/dir2\/dir3\/file5\")\n};\n\nstatic const fs::path RecDirFollowSymlinksIterationList[] = {\n makePath(\"dir1\/dir2\"),\n makePath(\"dir1\/file1\"),\n makePath(\"dir1\/file2\"),\n makePath(\"dir1\/dir2\/afile3\"),\n makePath(\"dir1\/dir2\/dir3\"),\n makePath(\"dir1\/dir2\/file4\"),\n makePath(\"dir1\/dir2\/dir3\/file5\"),\n makePath(\"dir1\/dir2\/symlink_to_dir3\"),\n makePath(\"dir1\/dir2\/symlink_to_dir3\/file5\"),\n};\n\n} \/\/ namespace StaticEnv\n\n#endif \/\/ LIBCXX_FILESYSTEM_STATIC_TEST_ROOT\n\n#ifndef LIBCXX_FILESYSTEM_DYNAMIC_TEST_ROOT\n#warning LIBCXX_FILESYSTEM_DYNAMIC_TEST_ROOT must be defined\n#else \/\/ LIBCXX_FILESYSTEM_DYNAMIC_TEST_ROOT\n\n#ifndef LIBCXX_FILESYSTEM_DYNAMIC_TEST_HELPER\n#error LIBCXX_FILESYSTEM_DYNAMIC_TEST_HELPER must be defined\n#endif\n\nstruct scoped_test_env\n{\n scoped_test_env() : test_root(random_env_path())\n { fs_helper_run(fs_make_cmd(\"init_test_directory\", test_root)); }\n\n ~scoped_test_env()\n { fs_helper_run(fs_make_cmd(\"destroy_test_directory\", test_root)); }\n\n scoped_test_env(scoped_test_env const &) = delete;\n scoped_test_env & operator=(scoped_test_env const &) = delete;\n\n fs::path make_env_path(std::string p) { return sanitize_path(p); }\n\n std::string sanitize_path(std::string raw) {\n assert(raw.find(\"..\") == std::string::npos);\n std::string const& root = test_root.native();\n if (root.compare(0, root.size(), raw, 0, root.size()) != 0) {\n assert(raw.front() != '\\\\');\n fs::path tmp(test_root);\n tmp \/= raw;\n return std::move(const_cast<std::string&>(tmp.native()));\n }\n return raw;\n }\n\n std::string create_file(std::string filename, std::size_t size = 0) {\n filename = sanitize_path(std::move(filename));\n std::string out_str(size, 'a');\n {\n std::ofstream out(filename.c_str());\n out << out_str;\n }\n return filename;\n }\n\n std::string create_dir(std::string filename) {\n filename = sanitize_path(std::move(filename));\n fs_helper_run(fs_make_cmd(\"create_dir\", filename));\n return filename;\n }\n\n std::string create_symlink(std::string source, std::string to) {\n source = sanitize_path(std::move(source));\n to = sanitize_path(std::move(to));\n fs_helper_run(fs_make_cmd(\"create_symlink\", source, to));\n return to;\n }\n\n std::string create_hardlink(std::string source, std::string to) {\n source = sanitize_path(std::move(source));\n to = sanitize_path(std::move(to));\n fs_helper_run(fs_make_cmd(\"create_hardlink\", source, to));\n return to;\n }\n\n std::string create_fifo(std::string file) {\n file = sanitize_path(std::move(file));\n fs_helper_run(fs_make_cmd(\"create_fifo\", file));\n return file;\n }\n\n \/\/ OS X and FreeBSD doesn't support socket files so we shouldn't even\n \/\/ allow tests to call this unguarded.\n#if !defined(__FreeBSD__) && !defined(__APPLE__)\n std::string create_socket(std::string file) {\n file = sanitize_path(std::move(file));\n fs_helper_run(fs_make_cmd(\"create_socket\", file));\n return file;\n }\n#endif\n\n fs::path const test_root;\n\nprivate:\n static char to_hex(int ch) {\n return ch < 10 ? static_cast<char>('0' + ch)\n : static_cast<char>('a' + (ch - 10));\n }\n\n static char random_hex_char() {\n static std::mt19937 rd { std::random_device{}() };\n static std::uniform_int_distribution<int> mrand{0, 15};\n return to_hex( mrand(rd) );\n }\n\n static std::string unique_path_suffix() {\n std::string model = \"test.%%%%%%\";\n for (auto & ch : model) {\n if (ch == '%') ch = random_hex_char();\n }\n return model;\n }\n\n \/\/ This could potentially introduce a filesystem race with other tests\n \/\/ running at the same time, but oh well, it's just test code.\n static inline fs::path random_env_path() {\n static const char* env_path = LIBCXX_FILESYSTEM_DYNAMIC_TEST_ROOT;\n fs::path p = fs::path(env_path) \/ unique_path_suffix();\n assert(p.parent_path() == env_path);\n return p;\n }\n\n static inline std::string make_arg(std::string const& arg) {\n return \"'\" + arg + \"'\";\n }\n\n static inline std::string make_arg(std::size_t arg) {\n return std::to_string(arg);\n }\n\n template <class T>\n static inline std::string\n fs_make_cmd(std::string const& cmd_name, T const& arg) {\n return cmd_name + \"(\" + make_arg(arg) + \")\";\n }\n\n template <class T, class U>\n static inline std::string\n fs_make_cmd(std::string const& cmd_name, T const& arg1, U const& arg2) {\n return cmd_name + \"(\" + make_arg(arg1) + \", \" + make_arg(arg2) + \")\";\n }\n\n static inline void fs_helper_run(std::string const& raw_cmd) {\n \/\/ check that the fs test root in the enviroment matches what we were\n \/\/ compiled with.\n static bool checked = checkDynamicTestRoot();\n std::string cmd = LIBCXX_FILESYSTEM_DYNAMIC_TEST_HELPER;\n cmd += \" \\\"\" + raw_cmd + \"\\\"\";\n int ret = std::system(cmd.c_str());\n assert(ret == 0);\n }\n\n static bool checkDynamicTestRoot() {\n char* fs_root = std::getenv(\"LIBCXX_FILESYSTEM_DYNAMIC_TEST_ROOT\");\n if (!fs_root) {\n std::printf(\"ERROR: LIBCXX_FILESYSTEM_DYNAMIC_TEST_ROOT must be a defined \"\n \"environment variable when running the test.\\n\");\n std::abort();\n }\n if (std::string(fs_root) != LIBCXX_FILESYSTEM_DYNAMIC_TEST_ROOT) {\n std::printf(\"ERROR: LIBCXX_FILESYSTEM_DYNAMIC_TEST_ROOT enviroment variable\"\n \" must have the same value as when the test was compiled.\\n\");\n std::printf(\" Current Value: '%s'\\n\", fs_root);\n std::printf(\" Expected Value: '%s'\\n\", LIBCXX_FILESYSTEM_DYNAMIC_TEST_ROOT);\n std::abort();\n }\n return true;\n }\n\n};\n\n#endif \/\/ LIBCXX_FILESYSTEM_DYNAMIC_TEST_ROOT\n\n\/\/ Misc test types\n\n#define CONCAT2(LHS, RHS) LHS##RHS\n#define CONCAT(LHS, RHS) CONCAT2(LHS, RHS)\n#define MKSTR(Str) {Str, CONCAT(L, Str), CONCAT(u, Str), CONCAT(U, Str)}\n\nstruct MultiStringType {\n const char* s;\n const wchar_t* w;\n const char16_t* u16;\n const char32_t* u32;\n\n operator const char* () const { return s; }\n operator const wchar_t* () const { return w; }\n operator const char16_t* () const { return u16; }\n operator const char32_t* () const { return u32; }\n};\n\nconst MultiStringType PathList[] = {\n MKSTR(\"\"),\n MKSTR(\" \"),\n MKSTR(\"\/\/\"),\n MKSTR(\".\"),\n MKSTR(\"..\"),\n MKSTR(\"foo\"),\n MKSTR(\"\/\"),\n MKSTR(\"\/foo\"),\n MKSTR(\"foo\/\"),\n MKSTR(\"\/foo\/\"),\n MKSTR(\"foo\/bar\"),\n MKSTR(\"\/foo\/bar\"),\n MKSTR(\"\/\/net\"),\n MKSTR(\"\/\/net\/foo\"),\n MKSTR(\"\/\/\/foo\/\/\/\"),\n MKSTR(\"\/\/\/foo\/\/\/bar\"),\n MKSTR(\"\/.\"),\n MKSTR(\".\/\"),\n MKSTR(\"\/..\"),\n MKSTR(\"..\/\"),\n MKSTR(\"foo\/.\"),\n MKSTR(\"foo\/..\"),\n MKSTR(\"foo\/.\/\"),\n MKSTR(\"foo\/.\/bar\"),\n MKSTR(\"foo\/..\/\"),\n MKSTR(\"foo\/..\/bar\"),\n MKSTR(\"c:\"),\n MKSTR(\"c:\/\"),\n MKSTR(\"c:foo\"),\n MKSTR(\"c:\/foo\"),\n MKSTR(\"c:foo\/\"),\n MKSTR(\"c:\/foo\/\"),\n MKSTR(\"c:\/foo\/bar\"),\n MKSTR(\"prn:\"),\n MKSTR(\"c:\\\\\"),\n MKSTR(\"c:\\\\foo\"),\n MKSTR(\"c:foo\\\\\"),\n MKSTR(\"c:\\\\foo\\\\\"),\n MKSTR(\"c:\\\\foo\/\"),\n MKSTR(\"c:\/foo\\\\bar\"),\n MKSTR(\"\/\/\"),\n MKSTR(\"\/finally\/we\/need\/one\/really\/really\/really\/really\/really\/really\/really\/long\/string\")\n};\nconst unsigned PathListSize = sizeof(PathList) \/ sizeof(MultiStringType);\n\ntemplate <class Iter>\nIter IterEnd(Iter B) {\n using VT = typename std::iterator_traits<Iter>::value_type;\n for (; *B != VT{}; ++B)\n ;\n return B;\n}\n\ntemplate <class CharT>\nconst CharT* StrEnd(CharT const* P) {\n return IterEnd(P);\n}\n\ntemplate <class CharT>\nstd::size_t StrLen(CharT const* P) {\n return StrEnd(P) - P;\n}\n\n\/\/ Testing the allocation behavior of the code_cvt functions requires\n\/\/ *knowing* that the allocation was not done by \"path::__str_\".\n\/\/ This hack forces path to allocate enough memory.\ninline void PathReserve(fs::path& p, std::size_t N) {\n auto const& native_ref = p.native();\n const_cast<std::string&>(native_ref).reserve(N);\n}\n\ntemplate <class Iter1, class Iter2>\nbool checkCollectionsEqual(\n Iter1 start1, Iter1 const end1\n , Iter2 start2, Iter2 const end2\n )\n{\n while (start1 != end1 && start2 != end2) {\n if (*start1 != *start2) {\n return false;\n }\n ++start1; ++start2;\n }\n return (start1 == end1 && start2 == end2);\n}\n\n\ntemplate <class Iter1, class Iter2>\nbool checkCollectionsEqualBackwards(\n Iter1 const start1, Iter1 end1\n , Iter2 const start2, Iter2 end2\n )\n{\n while (start1 != end1 && start2 != end2) {\n --end1; --end2;\n if (*end1 != *end2) {\n return false;\n }\n }\n return (start1 == end1 && start2 == end2);\n}\n\n\/\/ We often need to test that the error_code was cleared if no error occurs\n\/\/ this function returns a error_code which is set to an error that will\n\/\/ never be returned by the filesystem functions.\ninline std::error_code GetTestEC() {\n return std::make_error_code(std::errc::address_family_not_supported);\n}\n\n\/\/ Provide our own Sleep routine since std::this_thread::sleep_for is not\n\/\/ available in single-threaded mode.\nvoid SleepFor(std::chrono::seconds dur) {\n using namespace std::chrono;\n#if defined(_LIBCPP_HAS_NO_MONOTONIC_CLOCK)\n using Clock = system_clock;\n#else\n using Clock = steady_clock;\n#endif\n const auto wake_time = Clock::now() + dur;\n while (Clock::now() < wake_time)\n ;\n}\n\n#endif \/* FILESYSTEM_TEST_HELPER_HPP *\/\n<|endoftext|>"} {"text":"<commit_before>\/\/ Copyright 2010-2014 RethinkDB, all rights reserved.\n#include \"rdb_protocol\/wire_func.hpp\"\n\n#include \"containers\/archive\/boost_types.hpp\"\n#include \"containers\/archive\/stl_types.hpp\"\n#include \"containers\/archive\/archive.hpp\"\n#include \"rdb_protocol\/env.hpp\"\n#include \"rdb_protocol\/func.hpp\"\n#include \"rdb_protocol\/protocol.hpp\"\n#include \"rdb_protocol\/term_walker.hpp\"\n#include \"stl_utils.hpp\"\n\nnamespace ql {\n\nwire_func_t::wire_func_t() { }\n\nwire_func_t::wire_func_t(const counted_t<func_t> &f) : func(f) {\n r_sanity_check(func.has());\n}\n\nwire_func_t::wire_func_t(protob_t<const Term> body, std::vector<sym_t> arg_names,\n protob_t<const Backtrace> backtrace) {\n compile_env_t env(var_visibility_t().with_func_arg_name_list(arg_names));\n func = make_counted<reql_func_t>(backtrace, var_scope_t(), arg_names, compile_term(&env, body));\n}\n\nwire_func_t::wire_func_t(const wire_func_t ©ee)\n : func(copyee.func) { }\n\nwire_func_t &wire_func_t::operator=(const wire_func_t &assignee) {\n func = assignee.func;\n return *this;\n}\n\nwire_func_t::~wire_func_t() { }\n\ncounted_t<func_t> wire_func_t::compile_wire_func() const {\n r_sanity_check(func.has() || func_can_be_null());\n return func;\n}\n\nprotob_t<const Backtrace> wire_func_t::get_bt() const {\n r_sanity_check(func.has());\n return func->backtrace();\n}\n\nenum class wire_func_type_t { REQL, JS };\n\nARCHIVE_PRIM_MAKE_RANGED_SERIALIZABLE(wire_func_type_t, int8_t,\n wire_func_type_t::REQL, wire_func_type_t::JS);\n\ntemplate <cluster_version_t W>\nclass wire_func_serialization_visitor_t : public func_visitor_t {\npublic:\n explicit wire_func_serialization_visitor_t(write_message_t *_wm) : wm(_wm) { }\n\n void on_reql_func(const reql_func_t *reql_func) {\n serialize<W>(wm, wire_func_type_t::REQL);\n const var_scope_t &scope = reql_func->captured_scope;\n serialize<W>(wm, scope);\n const std::vector<sym_t> &arg_names = reql_func->arg_names;\n serialize<W>(wm, arg_names);\n const protob_t<const Term> &body = reql_func->body->get_src();\n serialize_protobuf(wm, *body);\n const protob_t<const Backtrace> &backtrace = reql_func->backtrace();\n serialize_protobuf(wm, *backtrace);\n }\n\n void on_js_func(const js_func_t *js_func) {\n serialize<W>(wm, wire_func_type_t::JS);\n const std::string &js_source = js_func->js_source;\n serialize<W>(wm, js_source);\n const uint64_t &js_timeout_ms = js_func->js_timeout_ms;\n serialize<W>(wm, js_timeout_ms);\n const protob_t<const Backtrace> &backtrace = js_func->backtrace();\n serialize_protobuf(wm, *backtrace);\n }\n\nprivate:\n write_message_t *wm;\n};\n\ntemplate <cluster_version_t W>\nvoid wire_func_t::rdb_serialize(write_message_t *wm) const {\n if (func_can_be_null()) {\n serialize<W>(wm, func.has());\n if (!func.has()) return;\n }\n r_sanity_check(func.has());\n wire_func_serialization_visitor_t<W> v(wm);\n func->visit(&v);\n}\n\ntemplate <cluster_version_t W>\narchive_result_t wire_func_t::rdb_deserialize(read_stream_t *s) {\n archive_result_t res;\n\n if (func_can_be_null()) {\n bool has;\n res = deserialize<W>(s, &has);\n if (bad(res)) return res;\n if (!has) return archive_result_t::SUCCESS;\n }\n\n wire_func_type_t type;\n res = deserialize<W>(s, &type);\n if (bad(res)) { return res; }\n switch (type) {\n case wire_func_type_t::REQL: {\n var_scope_t scope;\n res = deserialize<W>(s, &scope);\n if (bad(res)) { return res; }\n\n std::vector<sym_t> arg_names;\n res = deserialize<W>(s, &arg_names);\n if (bad(res)) { return res; }\n\n protob_t<Term> body = make_counted_term();\n res = deserialize_protobuf(s, &*body);\n if (bad(res)) { return res; }\n\n protob_t<Backtrace> backtrace = make_counted_backtrace();\n res = deserialize_protobuf(s, &*backtrace);\n if (bad(res)) { return res; }\n\n compile_env_t env(\n scope.compute_visibility().with_func_arg_name_list(arg_names));\n func = make_counted<reql_func_t>(\n backtrace, scope, arg_names, compile_term(&env, body));\n return res;\n } break;\n case wire_func_type_t::JS: {\n std::string js_source;\n res = deserialize<W>(s, &js_source);\n if (bad(res)) { return res; }\n\n uint64_t js_timeout_ms;\n res = deserialize<W>(s, &js_timeout_ms);\n if (bad(res)) { return res; }\n\n protob_t<Backtrace> backtrace = make_counted_backtrace();\n res = deserialize_protobuf(s, &*backtrace);\n if (bad(res)) { return res; }\n\n func = make_counted<js_func_t>(js_source, js_timeout_ms, backtrace);\n return res;\n } break;\n default:\n unreachable();\n }\n}\n\nINSTANTIATE_SELF_SINCE_v1_13(wire_func_t);\n\ngroup_wire_func_t::group_wire_func_t(std::vector<counted_t<func_t> > &&_funcs,\n bool _append_index, bool _multi)\n : append_index(_append_index), multi(_multi) {\n funcs.reserve(_funcs.size());\n for (size_t i = 0; i < _funcs.size(); ++i) {\n funcs.push_back(wire_func_t(std::move(_funcs[i])));\n }\n}\n\nstd::vector<counted_t<func_t> > group_wire_func_t::compile_funcs() const {\n std::vector<counted_t<func_t> > ret;\n ret.reserve(funcs.size());\n for (size_t i = 0; i < funcs.size(); ++i) {\n ret.push_back(funcs[i].compile_wire_func());\n }\n return std::move(ret);\n}\n\nbool group_wire_func_t::should_append_index() const {\n return append_index;\n}\n\nbool group_wire_func_t::is_multi() const {\n return multi;\n}\n\nprotob_t<const Backtrace> group_wire_func_t::get_bt() const {\n return bt.get_bt();\n}\n\nRDB_IMPL_ME_SERIALIZABLE_4(group_wire_func_t, funcs, append_index, multi, bt);\n\nRDB_IMPL_ME_SERIALIZABLE_0(count_wire_func_t);\n\nmap_wire_func_t map_wire_func_t::make_safely(\n pb::dummy_var_t dummy_var,\n const std::function<protob_t<Term>(sym_t argname)> &body_generator,\n protob_t<const Backtrace> backtrace) {\n const sym_t varname = dummy_var_to_sym(dummy_var);\n protob_t<Term> body = body_generator(varname);\n propagate_backtrace(body.get(), backtrace.get());\n return map_wire_func_t(body, make_vector(varname), backtrace);\n}\n\nRDB_IMPL_SERIALIZABLE_2(filter_wire_func_t, filter_func, default_filter_val);\n\ntemplate <cluster_version_t W>\nvoid bt_wire_func_t::rdb_serialize(write_message_t *wm) const {\n serialize_protobuf(wm, *bt);\n}\n\ntemplate <cluster_version_t W>\narchive_result_t bt_wire_func_t::rdb_deserialize(read_stream_t *s) {\n protob_t<Backtrace> backtrace = make_counted_backtrace();\n archive_result_t res = deserialize_protobuf(s, const_cast<Backtrace *>(&*bt));\n if (bad(res)) { return res; }\n bt = backtrace;\n return archive_result_t::SUCCESS;\n}\n\nINSTANTIATE_SELF_SINCE_v1_13(bt_wire_func_t);\n\n} \/\/ namespace ql\n<commit_msg>Made bt_wire_func_t deserialization not be broken.<commit_after>\/\/ Copyright 2010-2014 RethinkDB, all rights reserved.\n#include \"rdb_protocol\/wire_func.hpp\"\n\n#include \"containers\/archive\/boost_types.hpp\"\n#include \"containers\/archive\/stl_types.hpp\"\n#include \"containers\/archive\/archive.hpp\"\n#include \"rdb_protocol\/env.hpp\"\n#include \"rdb_protocol\/func.hpp\"\n#include \"rdb_protocol\/protocol.hpp\"\n#include \"rdb_protocol\/term_walker.hpp\"\n#include \"stl_utils.hpp\"\n\nnamespace ql {\n\nwire_func_t::wire_func_t() { }\n\nwire_func_t::wire_func_t(const counted_t<func_t> &f) : func(f) {\n r_sanity_check(func.has());\n}\n\nwire_func_t::wire_func_t(protob_t<const Term> body, std::vector<sym_t> arg_names,\n protob_t<const Backtrace> backtrace) {\n compile_env_t env(var_visibility_t().with_func_arg_name_list(arg_names));\n func = make_counted<reql_func_t>(backtrace, var_scope_t(), arg_names, compile_term(&env, body));\n}\n\nwire_func_t::wire_func_t(const wire_func_t ©ee)\n : func(copyee.func) { }\n\nwire_func_t &wire_func_t::operator=(const wire_func_t &assignee) {\n func = assignee.func;\n return *this;\n}\n\nwire_func_t::~wire_func_t() { }\n\ncounted_t<func_t> wire_func_t::compile_wire_func() const {\n r_sanity_check(func.has() || func_can_be_null());\n return func;\n}\n\nprotob_t<const Backtrace> wire_func_t::get_bt() const {\n r_sanity_check(func.has());\n return func->backtrace();\n}\n\nenum class wire_func_type_t { REQL, JS };\n\nARCHIVE_PRIM_MAKE_RANGED_SERIALIZABLE(wire_func_type_t, int8_t,\n wire_func_type_t::REQL, wire_func_type_t::JS);\n\ntemplate <cluster_version_t W>\nclass wire_func_serialization_visitor_t : public func_visitor_t {\npublic:\n explicit wire_func_serialization_visitor_t(write_message_t *_wm) : wm(_wm) { }\n\n void on_reql_func(const reql_func_t *reql_func) {\n serialize<W>(wm, wire_func_type_t::REQL);\n const var_scope_t &scope = reql_func->captured_scope;\n serialize<W>(wm, scope);\n const std::vector<sym_t> &arg_names = reql_func->arg_names;\n serialize<W>(wm, arg_names);\n const protob_t<const Term> &body = reql_func->body->get_src();\n serialize_protobuf(wm, *body);\n const protob_t<const Backtrace> &backtrace = reql_func->backtrace();\n serialize_protobuf(wm, *backtrace);\n }\n\n void on_js_func(const js_func_t *js_func) {\n serialize<W>(wm, wire_func_type_t::JS);\n const std::string &js_source = js_func->js_source;\n serialize<W>(wm, js_source);\n const uint64_t &js_timeout_ms = js_func->js_timeout_ms;\n serialize<W>(wm, js_timeout_ms);\n const protob_t<const Backtrace> &backtrace = js_func->backtrace();\n serialize_protobuf(wm, *backtrace);\n }\n\nprivate:\n write_message_t *wm;\n};\n\ntemplate <cluster_version_t W>\nvoid wire_func_t::rdb_serialize(write_message_t *wm) const {\n if (func_can_be_null()) {\n serialize<W>(wm, func.has());\n if (!func.has()) return;\n }\n r_sanity_check(func.has());\n wire_func_serialization_visitor_t<W> v(wm);\n func->visit(&v);\n}\n\ntemplate <cluster_version_t W>\narchive_result_t wire_func_t::rdb_deserialize(read_stream_t *s) {\n archive_result_t res;\n\n if (func_can_be_null()) {\n bool has;\n res = deserialize<W>(s, &has);\n if (bad(res)) return res;\n if (!has) return archive_result_t::SUCCESS;\n }\n\n wire_func_type_t type;\n res = deserialize<W>(s, &type);\n if (bad(res)) { return res; }\n switch (type) {\n case wire_func_type_t::REQL: {\n var_scope_t scope;\n res = deserialize<W>(s, &scope);\n if (bad(res)) { return res; }\n\n std::vector<sym_t> arg_names;\n res = deserialize<W>(s, &arg_names);\n if (bad(res)) { return res; }\n\n protob_t<Term> body = make_counted_term();\n res = deserialize_protobuf(s, &*body);\n if (bad(res)) { return res; }\n\n protob_t<Backtrace> backtrace = make_counted_backtrace();\n res = deserialize_protobuf(s, &*backtrace);\n if (bad(res)) { return res; }\n\n compile_env_t env(\n scope.compute_visibility().with_func_arg_name_list(arg_names));\n func = make_counted<reql_func_t>(\n backtrace, scope, arg_names, compile_term(&env, body));\n return res;\n } break;\n case wire_func_type_t::JS: {\n std::string js_source;\n res = deserialize<W>(s, &js_source);\n if (bad(res)) { return res; }\n\n uint64_t js_timeout_ms;\n res = deserialize<W>(s, &js_timeout_ms);\n if (bad(res)) { return res; }\n\n protob_t<Backtrace> backtrace = make_counted_backtrace();\n res = deserialize_protobuf(s, &*backtrace);\n if (bad(res)) { return res; }\n\n func = make_counted<js_func_t>(js_source, js_timeout_ms, backtrace);\n return res;\n } break;\n default:\n unreachable();\n }\n}\n\nINSTANTIATE_SELF_SINCE_v1_13(wire_func_t);\n\ngroup_wire_func_t::group_wire_func_t(std::vector<counted_t<func_t> > &&_funcs,\n bool _append_index, bool _multi)\n : append_index(_append_index), multi(_multi) {\n funcs.reserve(_funcs.size());\n for (size_t i = 0; i < _funcs.size(); ++i) {\n funcs.push_back(wire_func_t(std::move(_funcs[i])));\n }\n}\n\nstd::vector<counted_t<func_t> > group_wire_func_t::compile_funcs() const {\n std::vector<counted_t<func_t> > ret;\n ret.reserve(funcs.size());\n for (size_t i = 0; i < funcs.size(); ++i) {\n ret.push_back(funcs[i].compile_wire_func());\n }\n return std::move(ret);\n}\n\nbool group_wire_func_t::should_append_index() const {\n return append_index;\n}\n\nbool group_wire_func_t::is_multi() const {\n return multi;\n}\n\nprotob_t<const Backtrace> group_wire_func_t::get_bt() const {\n return bt.get_bt();\n}\n\nRDB_IMPL_ME_SERIALIZABLE_4(group_wire_func_t, funcs, append_index, multi, bt);\n\nRDB_IMPL_ME_SERIALIZABLE_0(count_wire_func_t);\n\nmap_wire_func_t map_wire_func_t::make_safely(\n pb::dummy_var_t dummy_var,\n const std::function<protob_t<Term>(sym_t argname)> &body_generator,\n protob_t<const Backtrace> backtrace) {\n const sym_t varname = dummy_var_to_sym(dummy_var);\n protob_t<Term> body = body_generator(varname);\n propagate_backtrace(body.get(), backtrace.get());\n return map_wire_func_t(body, make_vector(varname), backtrace);\n}\n\nRDB_IMPL_SERIALIZABLE_2(filter_wire_func_t, filter_func, default_filter_val);\n\ntemplate <cluster_version_t W>\nvoid bt_wire_func_t::rdb_serialize(write_message_t *wm) const {\n serialize_protobuf(wm, *bt);\n}\n\ntemplate <cluster_version_t W>\narchive_result_t bt_wire_func_t::rdb_deserialize(read_stream_t *s) {\n protob_t<Backtrace> backtrace = make_counted_backtrace();\n archive_result_t res = deserialize_protobuf(s, backtrace.get());\n if (bad(res)) { return res; }\n bt = std::move(backtrace);\n return archive_result_t::SUCCESS;\n}\n\nINSTANTIATE_SELF_SINCE_v1_13(bt_wire_func_t);\n\n} \/\/ namespace ql\n<|endoftext|>"} {"text":"<commit_before>\/*************************************************************************\n *\n * REALM CONFIDENTIAL\n * __________________\n *\n * [2011] - [2015] Realm Inc\n * All Rights Reserved.\n *\n * NOTICE: All information contained herein is, and remains\n * the property of Realm Incorporated and its suppliers,\n * if any. The intellectual and technical concepts contained\n * herein are proprietary to Realm Incorporated\n * and its suppliers and may be covered by U.S. and Foreign Patents,\n * patents in process, and are protected by trade secret or copyright law.\n * Dissemination of this information or reproduction of this material\n * is strictly forbidden unless prior written permission is obtained\n * from Realm Incorporated.\n *\n **************************************************************************\/\n#ifndef REALM_COLUMN_DATETIME_HPP\n#define REALM_COLUMN_DATETIME_HPP\n\n#include <realm\/column.hpp>\n\nnamespace realm {\n\nstruct NewDate {\n NewDate(int64_t seconds, uint32_t nanoseconds) : m_seconds(seconds), m_nanoseconds(nanoseconds), m_is_null(false) \n {\n REALM_ASSERT_3(nanoseconds, <, 1000000000);\n }\n NewDate(const null&) : m_is_null(true) { }\n NewDate() : NewDate(null()) { }\n\n bool is_null() const { return m_is_null; }\n bool operator == (const NewDate& rhs) const { return m_seconds == rhs.m_seconds && m_nanoseconds == rhs.m_nanoseconds; }\n bool operator != (const NewDate& rhs) const { return m_seconds != rhs.m_seconds || m_nanoseconds != rhs.m_nanoseconds; }\n bool operator > (const NewDate& rhs) const { return (m_seconds > rhs.m_seconds) || (m_seconds == rhs.m_seconds && m_nanoseconds > rhs.m_nanoseconds); }\n bool operator < (const NewDate& rhs) const { return (m_seconds < rhs.m_seconds) || (m_seconds == rhs.m_seconds && m_nanoseconds < rhs.m_nanoseconds); }\n bool operator <= (const NewDate& rhs) const { return *this < rhs || *this == rhs; }\n bool operator >= (const NewDate& rhs) const { return *this > rhs || *this == rhs; }\n NewDate& operator = (const NewDate& rhs) = default;\n\n template<class Ch, class Tr>\n friend std::basic_ostream<Ch, Tr>& operator<<(std::basic_ostream<Ch, Tr>& out, const DateTime&);\n\n int64_t m_seconds;\n uint32_t m_nanoseconds;\n bool m_is_null;\n};\n\ntemplate<class C, class T>\ninline std::basic_ostream<C, T>& operator<<(std::basic_ostream<C, T>& out, const NewDate& d)\n{\n out << \"NewDate(\" << d.m_seconds << \", \" << d.m_nanoseconds << \")\";\n return out;\n}\n\nclass DateTimeColumn : public ColumnBase, public ColumnTemplate<NewDate> {\npublic:\n DateTimeColumn();\n \/\/\/ Get the number of entries in this column. This operation is relatively\n \/\/\/ slow.\n size_t size() const noexcept override;\n \/\/\/ Whether or not this column is nullable.\n bool is_nullable() const noexcept override;\n \/\/\/ Whether or not the value at \\a row_ndx is NULL. If the column is not\n \/\/\/ nullable, always returns false.\n bool is_null(size_t row_ndx) const noexcept override;\n \/\/\/ Sets the value at \\a row_ndx to be NULL.\n \/\/\/ \\throw LogicError Thrown if this column is not nullable.\n void set_null(size_t row_ndx) override;\n void insert_rows(size_t row_ndx, size_t num_rows_to_insert, size_t prior_num_rows, bool nullable) override;\n void erase_rows(size_t row_ndx, size_t num_rows_to_erase, size_t prior_num_rows,\n bool broken_reciprocal_backlinks) override;\n void move_last_row_over(size_t row_ndx, size_t prior_num_rows,\n bool broken_reciprocal_backlinks) override;\n void clear(size_t num_rows, bool broken_reciprocal_backlinks) override;\n void swap_rows(size_t row_ndx_1, size_t row_ndx_2) override;\n void destroy() noexcept override;\n StringData get_index_data(size_t, StringIndex::StringConversionBuffer& buffer) const noexcept override;\n Allocator& get_alloc() const noexcept override;\n \/\/\/ Returns the 'ref' of the root array.\n ref_type get_ref() const noexcept override;\n MemRef get_mem() const noexcept override;\n void replace_root_array(std::unique_ptr<Array> leaf) override;\n MemRef clone_deep(Allocator& alloc) const override;\n void detach() override;\n bool is_attached() const noexcept override;\n ref_type write(size_t slice_offset, size_t slice_size, size_t table_size, _impl::OutputStream&) const override;\n void set_parent(ArrayParent*, size_t ndx_in_parent) noexcept override;\n size_t get_ndx_in_parent() const noexcept override;\n void set_ndx_in_parent(size_t ndx_in_parent) noexcept override;\n void update_from_parent(size_t old_baseline) noexcept override;\n void refresh_accessor_tree(size_t new_col_ndx, const Spec&) override;\n#ifdef REALM_DEBUG\n void verify() const override;\n void to_dot(std::ostream&, StringData title = StringData()) const override;\n void do_dump_node_structure(std::ostream&, int level) const override;\n void leaf_to_dot(MemRef, ArrayParent*, size_t ndx_in_parent, std::ostream&) const override;\n#endif\n void add(const NewDate& ndt = NewDate{});\n NewDate get(size_t row_ndx) const noexcept;\n NewDate get_val(size_t row_ndx) const override;\n void set(size_t row_ndx, const NewDate& ndt);\nprivate:\n IntNullColumn m_seconds;\n IntegerColumn m_nanoseconds;\n};\n\n\n\/\/ Implementation\n\ninline DateTimeColumn::DateTimeColumn() :\n m_seconds(Allocator::get_default(), IntNullColumn::create(Allocator::get_default())),\n m_nanoseconds(Allocator::get_default(), IntegerColumn::create(Allocator::get_default()))\n{\n}\n\n\/\/\/ Get the number of entries in this column. This operation is relatively\n\/\/\/ slow.\ninline size_t DateTimeColumn::size() const noexcept\n{\n \/\/ FIXME: Consider debug asserts on the columns having the same size\n return m_seconds.size();\n}\n\n\/\/\/ Whether or not this column is nullable.\ninline bool DateTimeColumn::is_nullable() const noexcept\n{\n return m_seconds.is_nullable();\n}\n\n\/\/\/ Whether or not the value at \\a row_ndx is NULL. If the column is not\n\/\/\/ nullable, always returns false.\ninline bool DateTimeColumn::is_null(size_t row_ndx) const noexcept\n{\n return m_seconds.is_null(row_ndx);\n}\n\n\/\/\/ Sets the value at \\a row_ndx to be NULL.\n\/\/\/ \\throw LogicError Thrown if this column is not nullable.\ninline void DateTimeColumn::set_null(size_t row_ndx)\n{\n m_seconds.set_null(row_ndx);\n}\n\ninline void DateTimeColumn::insert_rows(size_t row_ndx, size_t num_rows_to_insert, size_t prior_num_rows,\n bool nullable)\n{\n m_seconds.insert_rows(row_ndx, num_rows_to_insert, prior_num_rows, nullable);\n m_nanoseconds.insert_rows(row_ndx, num_rows_to_insert, prior_num_rows, false);\n}\n\ninline void DateTimeColumn::erase_rows(size_t row_ndx, size_t num_rows_to_erase, size_t prior_num_rows,\n bool broken_reciprocal_backlinks)\n{\n m_seconds.erase_rows(row_ndx, num_rows_to_erase, prior_num_rows, broken_reciprocal_backlinks);\n m_nanoseconds.erase_rows(row_ndx, num_rows_to_erase, prior_num_rows, broken_reciprocal_backlinks);\n}\n\ninline void DateTimeColumn::move_last_row_over(size_t row_ndx, size_t prior_num_rows,\n bool broken_reciprocal_backlinks)\n{\n m_seconds.move_last_row_over(row_ndx, prior_num_rows, broken_reciprocal_backlinks);\n m_nanoseconds.move_last_row_over(row_ndx, prior_num_rows, broken_reciprocal_backlinks);\n}\n\ninline void DateTimeColumn::clear(size_t num_rows, bool broken_reciprocal_backlinks)\n{\n m_seconds.clear(num_rows, broken_reciprocal_backlinks);\n m_nanoseconds.clear(num_rows, broken_reciprocal_backlinks);\n}\n\ninline void DateTimeColumn::swap_rows(size_t row_ndx_1, size_t row_ndx_2)\n{\n m_seconds.swap_rows(row_ndx_1, row_ndx_2);\n m_nanoseconds.swap_rows(row_ndx_1, row_ndx_2);\n}\n\ninline void DateTimeColumn::destroy() noexcept\n{\n m_seconds.destroy();\n m_nanoseconds.destroy();\n}\n\ninline StringData DateTimeColumn::get_index_data(size_t, StringIndex::StringConversionBuffer& \/*buffer*\/) const noexcept\n{\n \/\/ FIXME: Dummy implementation\n return null();\n}\n\ninline Allocator& DateTimeColumn::get_alloc() const noexcept\n{\n \/\/ FIXME: Dummy implementation\n return Allocator::get_default();\n}\n\ninline ref_type DateTimeColumn::get_ref() const noexcept\n{\n \/\/ FIXME: Dummy implementation\n return 0;\n}\n\ninline MemRef DateTimeColumn::get_mem() const noexcept\n{\n \/\/ FIXME: Dummy implementation\n return MemRef();\n}\n\ninline void DateTimeColumn::replace_root_array(std::unique_ptr<Array> \/*leaf*\/)\n{\n \/\/ FIXME: Dummy implementation\n}\n\ninline MemRef DateTimeColumn::clone_deep(Allocator& \/*alloc*\/) const\n{\n \/\/ FIXME: Dummy implementation\n return MemRef();\n}\n\ninline void DateTimeColumn::detach()\n{\n m_seconds.detach();\n m_nanoseconds.detach();\n}\n\ninline bool DateTimeColumn::is_attached() const noexcept\n{\n \/\/ FIXME: Assert on both columns having same attached state?\n return m_seconds.is_attached();\n}\n\ninline ref_type DateTimeColumn::write(size_t \/*slice_offset*\/, size_t \/*slice_size*\/, size_t \/*table_size*\/,\n _impl::OutputStream&) const\n{\n \/\/ FIXME: Dummy implementation\n return 0;\n}\n\ninline void DateTimeColumn::set_parent(ArrayParent*, size_t \/*ndx_in_parent*\/) noexcept\n{\n \/\/ FIXME: Dummy implementation\n}\n\ninline size_t DateTimeColumn::get_ndx_in_parent() const noexcept\n{\n \/\/ FIXME: Dummy implementation\n return 0;\n}\n\ninline void DateTimeColumn::set_ndx_in_parent(size_t \/*ndx_in_parent*\/) noexcept\n{\n \/\/ FIXME: Dummy implementation\n}\n\ninline void DateTimeColumn::update_from_parent(size_t \/*old_baseline*\/) noexcept\n{\n \/\/ FIXME: Dummy implementation\n}\n\ninline void DateTimeColumn::refresh_accessor_tree(size_t \/*new_col_ndx*\/, const Spec&)\n{\n \/\/ FIXME: Dummy implementation\n}\n\n#ifdef REALM_DEBUG\n\ninline void DateTimeColumn::verify() const\n{\n \/\/ FIXME: Dummy implementation\n}\n\ninline void DateTimeColumn::to_dot(std::ostream&, StringData \/*title*\/) const\n{\n \/\/ FIXME: Dummy implementation\n}\n\ninline void DateTimeColumn::do_dump_node_structure(std::ostream&, int \/*level*\/) const\n{\n \/\/ FIXME: Dummy implementation\n}\n\ninline void DateTimeColumn::leaf_to_dot(MemRef, ArrayParent*, size_t \/*ndx_in_parent*\/, std::ostream&) const\n{\n \/\/ FIXME: Dummy implementation\n}\n\n#endif\n\ninline void DateTimeColumn::add(const NewDate& ndt)\n{\n bool is_null = ndt.is_null();\n util::Optional<int64_t> seconds = is_null ? util::none : util::make_optional(ndt.m_seconds);\n int32_t nanoseconds = is_null ? 0 : ndt.m_nanoseconds;\n m_seconds.add(seconds);\n m_nanoseconds.add(nanoseconds);\n}\n\ninline NewDate DateTimeColumn::get(size_t row_ndx) const noexcept\n{\n util::Optional<int64_t> seconds = m_seconds.get(row_ndx);\n return seconds ? NewDate(*seconds, int32_t(m_nanoseconds.get(row_ndx))) : NewDate(null());\n}\n\ninline NewDate DateTimeColumn::get_val(size_t row_ndx) const\n{\n return get(row_ndx);\n}\n\ninline void DateTimeColumn::set(size_t row_ndx, const NewDate& ndt)\n{\n bool is_null = ndt.is_null();\n util::Optional<int64_t> seconds = is_null ? util::none : util::make_optional(ndt.m_seconds);\n int32_t nanoseconds = is_null ? 0 : ndt.m_nanoseconds;\n m_seconds.set(row_ndx, seconds);\n m_nanoseconds.set(row_ndx, nanoseconds);\n}\n\n} \/\/ namespace realm\n\n#endif \/\/ REALM_COLUMN_DATETIME_HPP\n<commit_msg><< operator bug<commit_after>\/*************************************************************************\n *\n * REALM CONFIDENTIAL\n * __________________\n *\n * [2011] - [2015] Realm Inc\n * All Rights Reserved.\n *\n * NOTICE: All information contained herein is, and remains\n * the property of Realm Incorporated and its suppliers,\n * if any. The intellectual and technical concepts contained\n * herein are proprietary to Realm Incorporated\n * and its suppliers and may be covered by U.S. and Foreign Patents,\n * patents in process, and are protected by trade secret or copyright law.\n * Dissemination of this information or reproduction of this material\n * is strictly forbidden unless prior written permission is obtained\n * from Realm Incorporated.\n *\n **************************************************************************\/\n#ifndef REALM_COLUMN_DATETIME_HPP\n#define REALM_COLUMN_DATETIME_HPP\n\n#include <realm\/column.hpp>\n\nnamespace realm {\n\nstruct NewDate {\n NewDate(int64_t seconds, uint32_t nanoseconds) : m_seconds(seconds), m_nanoseconds(nanoseconds), m_is_null(false) \n {\n REALM_ASSERT_3(nanoseconds, <, 1000000000);\n }\n NewDate(const null&) : m_is_null(true) { }\n NewDate() : NewDate(null()) { }\n\n bool is_null() const { return m_is_null; }\n bool operator == (const NewDate& rhs) const { return m_seconds == rhs.m_seconds && m_nanoseconds == rhs.m_nanoseconds; }\n bool operator != (const NewDate& rhs) const { return m_seconds != rhs.m_seconds || m_nanoseconds != rhs.m_nanoseconds; }\n bool operator > (const NewDate& rhs) const { return (m_seconds > rhs.m_seconds) || (m_seconds == rhs.m_seconds && m_nanoseconds > rhs.m_nanoseconds); }\n bool operator < (const NewDate& rhs) const { return (m_seconds < rhs.m_seconds) || (m_seconds == rhs.m_seconds && m_nanoseconds < rhs.m_nanoseconds); }\n bool operator <= (const NewDate& rhs) const { return *this < rhs || *this == rhs; }\n bool operator >= (const NewDate& rhs) const { return *this > rhs || *this == rhs; }\n NewDate& operator = (const NewDate& rhs) = default;\n\n template<class Ch, class Tr>\n friend std::basic_ostream<Ch, Tr>& operator<<(std::basic_ostream<Ch, Tr>& out, const NewDate&);\n\n int64_t m_seconds;\n uint32_t m_nanoseconds;\n bool m_is_null;\n};\n\ntemplate<class C, class T>\ninline std::basic_ostream<C, T>& operator<<(std::basic_ostream<C, T>& out, const NewDate& d)\n{\n out << \"NewDate(\" << d.m_seconds << \", \" << d.m_nanoseconds << \")\";\n return out;\n}\n\nclass DateTimeColumn : public ColumnBase, public ColumnTemplate<NewDate> {\npublic:\n DateTimeColumn();\n \/\/\/ Get the number of entries in this column. This operation is relatively\n \/\/\/ slow.\n size_t size() const noexcept override;\n \/\/\/ Whether or not this column is nullable.\n bool is_nullable() const noexcept override;\n \/\/\/ Whether or not the value at \\a row_ndx is NULL. If the column is not\n \/\/\/ nullable, always returns false.\n bool is_null(size_t row_ndx) const noexcept override;\n \/\/\/ Sets the value at \\a row_ndx to be NULL.\n \/\/\/ \\throw LogicError Thrown if this column is not nullable.\n void set_null(size_t row_ndx) override;\n void insert_rows(size_t row_ndx, size_t num_rows_to_insert, size_t prior_num_rows, bool nullable) override;\n void erase_rows(size_t row_ndx, size_t num_rows_to_erase, size_t prior_num_rows,\n bool broken_reciprocal_backlinks) override;\n void move_last_row_over(size_t row_ndx, size_t prior_num_rows,\n bool broken_reciprocal_backlinks) override;\n void clear(size_t num_rows, bool broken_reciprocal_backlinks) override;\n void swap_rows(size_t row_ndx_1, size_t row_ndx_2) override;\n void destroy() noexcept override;\n StringData get_index_data(size_t, StringIndex::StringConversionBuffer& buffer) const noexcept override;\n Allocator& get_alloc() const noexcept override;\n \/\/\/ Returns the 'ref' of the root array.\n ref_type get_ref() const noexcept override;\n MemRef get_mem() const noexcept override;\n void replace_root_array(std::unique_ptr<Array> leaf) override;\n MemRef clone_deep(Allocator& alloc) const override;\n void detach() override;\n bool is_attached() const noexcept override;\n ref_type write(size_t slice_offset, size_t slice_size, size_t table_size, _impl::OutputStream&) const override;\n void set_parent(ArrayParent*, size_t ndx_in_parent) noexcept override;\n size_t get_ndx_in_parent() const noexcept override;\n void set_ndx_in_parent(size_t ndx_in_parent) noexcept override;\n void update_from_parent(size_t old_baseline) noexcept override;\n void refresh_accessor_tree(size_t new_col_ndx, const Spec&) override;\n#ifdef REALM_DEBUG\n void verify() const override;\n void to_dot(std::ostream&, StringData title = StringData()) const override;\n void do_dump_node_structure(std::ostream&, int level) const override;\n void leaf_to_dot(MemRef, ArrayParent*, size_t ndx_in_parent, std::ostream&) const override;\n#endif\n void add(const NewDate& ndt = NewDate{});\n NewDate get(size_t row_ndx) const noexcept;\n NewDate get_val(size_t row_ndx) const override;\n void set(size_t row_ndx, const NewDate& ndt);\nprivate:\n IntNullColumn m_seconds;\n IntegerColumn m_nanoseconds;\n};\n\n\n\/\/ Implementation\n\ninline DateTimeColumn::DateTimeColumn() :\n m_seconds(Allocator::get_default(), IntNullColumn::create(Allocator::get_default())),\n m_nanoseconds(Allocator::get_default(), IntegerColumn::create(Allocator::get_default()))\n{\n}\n\n\/\/\/ Get the number of entries in this column. This operation is relatively\n\/\/\/ slow.\ninline size_t DateTimeColumn::size() const noexcept\n{\n \/\/ FIXME: Consider debug asserts on the columns having the same size\n return m_seconds.size();\n}\n\n\/\/\/ Whether or not this column is nullable.\ninline bool DateTimeColumn::is_nullable() const noexcept\n{\n return m_seconds.is_nullable();\n}\n\n\/\/\/ Whether or not the value at \\a row_ndx is NULL. If the column is not\n\/\/\/ nullable, always returns false.\ninline bool DateTimeColumn::is_null(size_t row_ndx) const noexcept\n{\n return m_seconds.is_null(row_ndx);\n}\n\n\/\/\/ Sets the value at \\a row_ndx to be NULL.\n\/\/\/ \\throw LogicError Thrown if this column is not nullable.\ninline void DateTimeColumn::set_null(size_t row_ndx)\n{\n m_seconds.set_null(row_ndx);\n}\n\ninline void DateTimeColumn::insert_rows(size_t row_ndx, size_t num_rows_to_insert, size_t prior_num_rows,\n bool nullable)\n{\n m_seconds.insert_rows(row_ndx, num_rows_to_insert, prior_num_rows, nullable);\n m_nanoseconds.insert_rows(row_ndx, num_rows_to_insert, prior_num_rows, false);\n}\n\ninline void DateTimeColumn::erase_rows(size_t row_ndx, size_t num_rows_to_erase, size_t prior_num_rows,\n bool broken_reciprocal_backlinks)\n{\n m_seconds.erase_rows(row_ndx, num_rows_to_erase, prior_num_rows, broken_reciprocal_backlinks);\n m_nanoseconds.erase_rows(row_ndx, num_rows_to_erase, prior_num_rows, broken_reciprocal_backlinks);\n}\n\ninline void DateTimeColumn::move_last_row_over(size_t row_ndx, size_t prior_num_rows,\n bool broken_reciprocal_backlinks)\n{\n m_seconds.move_last_row_over(row_ndx, prior_num_rows, broken_reciprocal_backlinks);\n m_nanoseconds.move_last_row_over(row_ndx, prior_num_rows, broken_reciprocal_backlinks);\n}\n\ninline void DateTimeColumn::clear(size_t num_rows, bool broken_reciprocal_backlinks)\n{\n m_seconds.clear(num_rows, broken_reciprocal_backlinks);\n m_nanoseconds.clear(num_rows, broken_reciprocal_backlinks);\n}\n\ninline void DateTimeColumn::swap_rows(size_t row_ndx_1, size_t row_ndx_2)\n{\n m_seconds.swap_rows(row_ndx_1, row_ndx_2);\n m_nanoseconds.swap_rows(row_ndx_1, row_ndx_2);\n}\n\ninline void DateTimeColumn::destroy() noexcept\n{\n m_seconds.destroy();\n m_nanoseconds.destroy();\n}\n\ninline StringData DateTimeColumn::get_index_data(size_t, StringIndex::StringConversionBuffer& \/*buffer*\/) const noexcept\n{\n \/\/ FIXME: Dummy implementation\n return null();\n}\n\ninline Allocator& DateTimeColumn::get_alloc() const noexcept\n{\n \/\/ FIXME: Dummy implementation\n return Allocator::get_default();\n}\n\ninline ref_type DateTimeColumn::get_ref() const noexcept\n{\n \/\/ FIXME: Dummy implementation\n return 0;\n}\n\ninline MemRef DateTimeColumn::get_mem() const noexcept\n{\n \/\/ FIXME: Dummy implementation\n return MemRef();\n}\n\ninline void DateTimeColumn::replace_root_array(std::unique_ptr<Array> \/*leaf*\/)\n{\n \/\/ FIXME: Dummy implementation\n}\n\ninline MemRef DateTimeColumn::clone_deep(Allocator& \/*alloc*\/) const\n{\n \/\/ FIXME: Dummy implementation\n return MemRef();\n}\n\ninline void DateTimeColumn::detach()\n{\n m_seconds.detach();\n m_nanoseconds.detach();\n}\n\ninline bool DateTimeColumn::is_attached() const noexcept\n{\n \/\/ FIXME: Assert on both columns having same attached state?\n return m_seconds.is_attached();\n}\n\ninline ref_type DateTimeColumn::write(size_t \/*slice_offset*\/, size_t \/*slice_size*\/, size_t \/*table_size*\/,\n _impl::OutputStream&) const\n{\n \/\/ FIXME: Dummy implementation\n return 0;\n}\n\ninline void DateTimeColumn::set_parent(ArrayParent*, size_t \/*ndx_in_parent*\/) noexcept\n{\n \/\/ FIXME: Dummy implementation\n}\n\ninline size_t DateTimeColumn::get_ndx_in_parent() const noexcept\n{\n \/\/ FIXME: Dummy implementation\n return 0;\n}\n\ninline void DateTimeColumn::set_ndx_in_parent(size_t \/*ndx_in_parent*\/) noexcept\n{\n \/\/ FIXME: Dummy implementation\n}\n\ninline void DateTimeColumn::update_from_parent(size_t \/*old_baseline*\/) noexcept\n{\n \/\/ FIXME: Dummy implementation\n}\n\ninline void DateTimeColumn::refresh_accessor_tree(size_t \/*new_col_ndx*\/, const Spec&)\n{\n \/\/ FIXME: Dummy implementation\n}\n\n#ifdef REALM_DEBUG\n\ninline void DateTimeColumn::verify() const\n{\n \/\/ FIXME: Dummy implementation\n}\n\ninline void DateTimeColumn::to_dot(std::ostream&, StringData \/*title*\/) const\n{\n \/\/ FIXME: Dummy implementation\n}\n\ninline void DateTimeColumn::do_dump_node_structure(std::ostream&, int \/*level*\/) const\n{\n \/\/ FIXME: Dummy implementation\n}\n\ninline void DateTimeColumn::leaf_to_dot(MemRef, ArrayParent*, size_t \/*ndx_in_parent*\/, std::ostream&) const\n{\n \/\/ FIXME: Dummy implementation\n}\n\n#endif\n\ninline void DateTimeColumn::add(const NewDate& ndt)\n{\n bool is_null = ndt.is_null();\n util::Optional<int64_t> seconds = is_null ? util::none : util::make_optional(ndt.m_seconds);\n int32_t nanoseconds = is_null ? 0 : ndt.m_nanoseconds;\n m_seconds.add(seconds);\n m_nanoseconds.add(nanoseconds);\n}\n\ninline NewDate DateTimeColumn::get(size_t row_ndx) const noexcept\n{\n util::Optional<int64_t> seconds = m_seconds.get(row_ndx);\n return seconds ? NewDate(*seconds, int32_t(m_nanoseconds.get(row_ndx))) : NewDate(null());\n}\n\ninline NewDate DateTimeColumn::get_val(size_t row_ndx) const\n{\n return get(row_ndx);\n}\n\ninline void DateTimeColumn::set(size_t row_ndx, const NewDate& ndt)\n{\n bool is_null = ndt.is_null();\n util::Optional<int64_t> seconds = is_null ? util::none : util::make_optional(ndt.m_seconds);\n int32_t nanoseconds = is_null ? 0 : ndt.m_nanoseconds;\n m_seconds.set(row_ndx, seconds);\n m_nanoseconds.set(row_ndx, nanoseconds);\n}\n\n} \/\/ namespace realm\n\n#endif \/\/ REALM_COLUMN_DATETIME_HPP\n<|endoftext|>"} {"text":"<commit_before>\/**\n * This file is part of the CernVM File System.\n *\/\n\n#include <gtest\/gtest.h>\n\n#include \"publish\/except.h\"\n#include \"publish\/settings.h\"\n\nusing namespace std; \/\/ NOLINT\n\nnamespace publish {\n\nclass T_Transaction : public ::testing::Test {\n protected:\n virtual void SetUp() {\n }\n\n protected:\n};\n\nTEST_F(T_Transaction, Template) {\n SettingsTransaction settings(\"test.cvmfs.io\");\n EXPECT_FALSE(settings.HasTemplate());\n EXPECT_THROW(settings.SetTemplate(\"\", \"\/foo\"), EPublish);\n EXPECT_THROW(settings.SetTemplate(\"\/foo\", \"\"), EPublish);\n settings.SetTemplate(\"\/foo\", \"\/bar\");\n EXPECT_TRUE(settings.HasTemplate());\n EXPECT_EQ(\"foo\", settings.template_from());\n EXPECT_EQ(\"bar\", settings.template_to());\n}\n\n} \/\/ namespace publish\n<commit_msg>[publish] unit test skeleton for transaction<commit_after>\/**\n * This file is part of the CernVM File System.\n *\/\n\n#include <gtest\/gtest.h>\n\n#include \"c_repository.h\"\n#include \"publish\/except.h\"\n#include \"publish\/repository.h\"\n#include \"publish\/settings.h\"\n\nusing namespace std; \/\/ NOLINT\n\nnamespace publish {\n\nclass T_Transaction : public ::testing::Test {\n protected:\n virtual void SetUp() {\n }\n\n protected:\n};\n\nTEST_F(T_Transaction, TemplateSettings) {\n SettingsTransaction settings(\"test.cvmfs.io\");\n EXPECT_FALSE(settings.HasTemplate());\n EXPECT_THROW(settings.SetTemplate(\"\", \"\/foo\"), EPublish);\n EXPECT_THROW(settings.SetTemplate(\"\/foo\", \"\"), EPublish);\n settings.SetTemplate(\"\/foo\", \"\/bar\");\n EXPECT_TRUE(settings.HasTemplate());\n EXPECT_EQ(\"foo\", settings.template_from());\n EXPECT_EQ(\"bar\", settings.template_to());\n}\n\n\nTEST_F(T_Transaction, BasicTransaction) {\n Publisher *publisher = GetTestPublisher();\n EXPECT_FALSE(publisher->in_transaction());\n publisher->Transaction();\n EXPECT_TRUE(publisher->in_transaction());\n delete publisher;\n\n \/\/ TODO(jblomer): add more tests when publish and abort are implemented\n}\n\n} \/\/ namespace publish\n<|endoftext|>"} {"text":"<commit_before>\/\/\n\/\/ EnviroGUI.cpp\n\/\/ GUI-specific functionality of the Enviro class\n\/\/\n\/\/ Copyright (c) 2003-2007 Virtual Terrain Project\n\/\/ Free for all uses, see license.txt for details.\n\/\/\n\n\/\/ For compilers that support precompilation, includes \"wx.h\".\n#include \"wx\/wxprec.h\"\n\n#ifndef WX_PRECOMP\n#include \"wx\/wx.h\"\n#endif\n\n#include \"vtlib\/vtlib.h\"\n#include \"vtlib\/core\/Terrain.h\"\n#include \"vtdata\/vtLog.h\"\n#include \"vtui\/Helper.h\"\n#include \"vtui\/InstanceDlg.h\"\n#include \"vtui\/ProfileDlg.h\"\n\n#include \"EnviroGUI.h\"\n#include \"EnviroApp.h\"\n#include \"EnviroFrame.h\"\n#include \"canvas.h\"\n#include \"DistanceDlg3d.h\"\n#include \"LayerDlg.h\"\n#include \"StyleDlg.h\"\n\n#if WIN32 || !wxUSE_JOYSTICK\n #include \"vtui\/Joystick.h\"\n#else\n #include \"wx\/joystick.h\"\n#endif\n\nDECLARE_APP(EnviroApp);\n\n\/\/\n\/\/ This is a 'singleton', the only instance of the global application object\n\/\/\nEnviroGUI g_App;\n\n\/\/ helper\nEnviroFrame *GetFrame()\n{\n\treturn dynamic_cast<EnviroFrame *>(wxGetApp().GetTopWindow());\n}\n\nEnviroGUI::EnviroGUI()\n{\n\tm_pJFlyer = NULL;\n}\n\nEnviroGUI::~EnviroGUI()\n{\n}\n\nvoid EnviroGUI::ShowPopupMenu(const IPoint2 &pos)\n{\n\tGetFrame()->ShowPopupMenu(pos);\n}\n\nvoid EnviroGUI::SetTerrainToGUI(vtTerrain *pTerrain)\n{\n\tGetFrame()->SetTerrainToGUI(pTerrain);\n\n\tif (pTerrain && m_pJFlyer)\n\t{\n\t\tfloat speed = pTerrain->GetParams().GetValueFloat(STR_NAVSPEED);\n\t\tm_pJFlyer->SetSpeed(speed);\n\t}\n}\n\nvoid EnviroGUI::SetFlightSpeed(float speed)\n{\n\tif (m_pJFlyer)\n\t\tm_pJFlyer->SetSpeed(speed);\n\tEnviro::SetFlightSpeed(speed);\n}\n\nconst char *AppStateNames[] = \n{\n\t\"AS_Initializing\",\n\t\"AS_Neutral\",\n\t\"AS_Orbit\",\n\t\"AS_FlyingIn\",\n\t\"AS_SwitchToTerrain\",\n\t\"AS_Terrain\",\n\t\"AS_MovingOut\",\n\t\"AS_Error\"\n};\n\nvoid EnviroGUI::SetState(AppState s)\n{\n\t\/\/ if entering or leaving terrain or orbit state\n\tAppState previous = m_state;\n\tm_state = s;\n\n\tif (m_state != previous)\n\t{\n\t\tVTLOG(\"Changing app state from %s to %s\\n\", AppStateNames[previous],\n\t\t\tAppStateNames[m_state]);\n\t}\n\n\tif ((previous == AS_Terrain && m_state != AS_Terrain) ||\n\t\t(previous == AS_Orbit && m_state != AS_Orbit) ||\n\t\t(previous != AS_Terrain && m_state == AS_Terrain) ||\n\t\t(previous != AS_Orbit && m_state == AS_Orbit))\n\t{\n\t\tGetFrame()->RefreshToolbar();\n\t}\n}\n\nvtString EnviroGUI::GetStringFromUser(const vtString &title, const vtString &msg)\n{\n\twxString caption(title, wxConvUTF8);\n\twxString message(msg, wxConvUTF8);\n\twxString str = wxGetTextFromUser(message, caption, _T(\"\"), GetFrame());\n\treturn (vtString) (const char *) str.mb_str(wxConvUTF8);\n}\n\nvoid EnviroGUI::ShowProgress(bool bShow)\n{\n\tif (bShow)\n\t\tOpenProgressDialog2(_(\"Creating Terrain\"), false, GetFrame());\n\telse\n\t\tCloseProgressDialog2();\n}\n\nvoid EnviroGUI::SetProgressTerrain(vtTerrain *pTerr)\n{\n\tpTerr->SetProgressCallback(progress_callback_minor);\n}\n\nvoid EnviroGUI::UpdateProgress(const char *msg, int amount1, int amount2)\n{\n\twxString str(msg, wxConvUTF8);\n\n\t\/\/ Try to translate it; a translation might be available.\n\t\/\/ If the string is not found in any of the loaded message catalogs,\n\t\/\/ the original string is returned.\n\twxString str2 = wxGetTranslation(str);\n\n\tUpdateProgressDialog2(amount1, amount2, str2);\n}\n\nvoid EnviroGUI::RefreshLayerView()\n{\n\tLayerDlg *dlg = GetFrame()->m_pLayerDlg;\n\tdlg->RefreshTreeContents();\n}\n\nvoid EnviroGUI::UpdateLayerView()\n{\n\tLayerDlg *dlg = GetFrame()->m_pLayerDlg;\n\tdlg->UpdateTreeTerrain();\n}\n\nvoid EnviroGUI::ShowLayerView()\n{\n\tLayerDlg *dlg = GetFrame()->m_pLayerDlg;\n\tdlg->Show(true);\n}\n\nvoid EnviroGUI::CameraChanged()\n{\n\tGetFrame()->CameraChanged();\n}\n\nvoid EnviroGUI::EarthPosUpdated()\n{\n\tGetFrame()->EarthPosUpdated(m_EarthPos);\n}\n\nvoid EnviroGUI::ShowDistance(const DPoint2 &p1, const DPoint2 &p2,\n\t\t\t\t\t\t\t double fGround, double fVertical)\n{\n\tGetFrame()->m_pDistanceDlg->SetPoints(p1, p2, false);\n\tGetFrame()->m_pDistanceDlg->SetGroundAndVertical(fGround, fVertical, true);\n\n\tif (GetFrame()->m_pProfileDlg)\n\t\tGetFrame()->m_pProfileDlg->SetPoints(p1, p2);\n}\n\nvoid EnviroGUI::ShowDistance(const DLine2 &path,\n\t\t\t\t\t\t\t double fGround, double fVertical)\n{\n\tGetFrame()->m_pDistanceDlg->SetPath(path, false);\n\tGetFrame()->m_pDistanceDlg->SetGroundAndVertical(fGround, fVertical, true);\n\n\tif (GetFrame()->m_pProfileDlg)\n\t\tGetFrame()->m_pProfileDlg->SetPath(path);\n}\n\nvtTagArray *EnviroGUI::GetInstanceFromGUI()\n{\n\treturn GetFrame()->m_pInstanceDlg->GetTagArray();\n}\n\nbool EnviroGUI::OnMouseEvent(vtMouseEvent &event)\n{\n\treturn GetFrame()->OnMouseEvent(event);\n}\n\nvoid EnviroGUI::SetupScene3()\n{\n\tGetFrame()->Setup3DScene();\n\n#if wxUSE_JOYSTICK || WIN32\n\tm_pJFlyer = new vtJoystickEngine;\n\tm_pJFlyer->SetName2(\"Joystick\");\n\tvtGetScene()->AddEngine(m_pJFlyer);\n\tm_pJFlyer->SetTarget(m_pNormalCamera);\n#endif\n}\n\nvoid EnviroGUI::SetTimeEngineToGUI(class vtTimeEngine *pEngine)\n{\n\tGetFrame()->SetTimeEngine(pEngine);\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nvoid EnviroGUI::SaveVegetation(bool bAskFilename)\n{\n\tvtTerrain *pTerr = GetCurrentTerrain();\n\tvtPlantInstanceArray &pia = pTerr->GetPlantInstances();\n\n\tvtString fname = pia.GetFilename();\n\n\tif (bAskFilename)\n\t{\n\t\t\/\/ save current directory\n\t\twxString path = wxGetCwd();\n\n\t\twxString default_file(StartOfFilename(fname), wxConvUTF8);\n\t\twxString default_dir(ExtractPath(fname), wxConvUTF8);\n\n\t\tEnableContinuousRendering(false);\n\t\twxFileDialog saveFile(NULL, _(\"Save Vegetation Data\"), default_dir,\n\t\t\tdefault_file, _(\"Vegetation Files (*.vf)|*.vf\"), wxFD_SAVE);\n\t\tbool bResult = (saveFile.ShowModal() == wxID_OK);\n\t\tEnableContinuousRendering(true);\n\t\tif (!bResult)\n\t\t{\n\t\t\twxSetWorkingDirectory(path);\t\/\/ restore\n\t\t\treturn;\n\t\t}\n\t\twxString str = saveFile.GetPath();\n\t\tfname = str.mb_str(wxConvUTF8);\n\t\tpia.SetFilename(fname);\n\t}\n\tpia.WriteVF(fname);\n}\n\nvoid EnviroGUI::SaveStructures(bool bAskFilename)\n{\n\tvtStructureArray3d *sa = GetCurrentTerrain()->GetStructureLayer();\n\tvtString fname = sa->GetFilename();\n\tif (bAskFilename)\n\t{\n\t\t\/\/ save current directory\n\t\twxString path = wxGetCwd();\n\n\t\twxString default_file(StartOfFilename(fname), wxConvUTF8);\n\t\twxString default_dir(ExtractPath(fname), wxConvUTF8);\n\n\t\tEnableContinuousRendering(false);\n\t\twxFileDialog saveFile(NULL, _(\"Save Built Structures Data\"),\n\t\t\tdefault_dir, default_file, _(\"Structure Files (*.vtst)|*.vtst\"),\n\t\t\twxFD_SAVE | wxFD_OVERWRITE_PROMPT);\n\t\tbool bResult = (saveFile.ShowModal() == wxID_OK);\n\t\tEnableContinuousRendering(true);\n\t\tif (!bResult)\n\t\t{\n\t\t\twxSetWorkingDirectory(path);\t\/\/ restore\n\t\t\treturn;\n\t\t}\n\t\twxString str = saveFile.GetPath();\n\t\tfname = str.mb_str(wxConvUTF8);\n\t\tsa->SetFilename(fname);\n\t}\n\tsa->WriteXML(fname);\n}\n\nbool EnviroGUI::IsAcceptable(vtTerrain *pTerr)\n{\n\treturn GetFrame()->IsAcceptable(pTerr);\n}\n\nvoid EnviroGUI::ShowMessage(const vtString &str)\n{\n\tEnableContinuousRendering(false);\n\n\twxString str2(str, wxConvUTF8);\n\twxMessageBox(str2);\n\n\tEnableContinuousRendering(true);\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nvtJoystickEngine::vtJoystickEngine()\n{\n\tm_fSpeed = 1.0f;\n\tm_fLastTime = 0.0f;\n\n\tm_pStick = new wxJoystick;\n\tif (!m_pStick->IsOk())\n\t{\n\t\tdelete m_pStick;\n\t\tm_pStick = NULL;\n\t}\n}\nvoid vtJoystickEngine::Eval()\n{\n\tif (!m_pStick)\n\t\treturn;\n\n\tfloat fTime = vtGetTime(), fElapsed = fTime - m_fLastTime;\n\n\tvtTransform *pTarget = (vtTransform*) GetTarget();\n\tif (pTarget)\n\t{\n\t\twxPoint p = m_pStick->GetPosition();\n\t\tint buttons = m_pStick->GetButtonState();\n\t\tfloat dx = ((float)p.x \/ 32768) - 1.0f;\n\t\tfloat dy = ((float)p.y \/ 32768) - 1.0f;\n\n\t\t\/\/ use a small dead zone to avoid drift\n\t\tconst float dead_zone = 0.04f;\n\n\t\tif (buttons & wxJOY_BUTTON2)\n\t\t{\n\t\t\t\/\/ move up down left right\n\t\t\tif (fabs(dx) > dead_zone)\n\t\t\t\tpTarget->TranslateLocal(FPoint3(dx * m_fSpeed * fElapsed, 0.0f, 0.0f));\n\t\t\tif (fabs(dy) > dead_zone)\n\t\t\t\tpTarget->Translate1(FPoint3(0.0f, dy * m_fSpeed * fElapsed, 0.0f));\n\t\t}\n\t\telse if (buttons & wxJOY_BUTTON3)\n\t\t{\n\t\t\t\/\/ pitch up down, yaw left right\n\t\t\tif (fabs(dx) > dead_zone)\n\t\t\t\tpTarget->RotateParent(FPoint3(0,1,0), -dx * fElapsed);\n\t\t\tif (fabs(dy) > dead_zone)\n\t\t\t\tpTarget->RotateLocal(FPoint3(1,0,0), dy * fElapsed);\n\t\t}\n\t\telse\n\t\t{\n\t\t\t\/\/ move forward-backward, turn left-right\n\t\t\tif (fabs(dy) > dead_zone)\n\t\t\t\tpTarget->TranslateLocal(FPoint3(0.0f, 0.0f, dy * m_fSpeed * fElapsed));\n\t\t\tif (fabs(dx) > dead_zone)\n\t\t\t\tpTarget->RotateParent(FPoint3(0,1,0), -dx * fElapsed);\n\t\t}\n\t}\n\tm_fLastTime = fTime;\n}\n\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ Helpers\n\nvtAbstractLayer *CreateNewAbstractPointLayer(vtTerrain *pTerr)\n{\n\t\/\/ make a new abstract layer (points)\n\tvtFeatureSetPoint2D *pSet = new vtFeatureSetPoint2D;\n\tvtTagArray &props = pSet->GetProperties();\n\tpSet->SetFilename(\"Untitled.shp\");\n\tpSet->AddField(\"Label\", FT_String);\n\n\t\/\/ Ask style for the new point layer\n\tprops.SetValueBool(\"Geometry\", false, true);\n\tprops.SetValueBool(\"Labels\", true, true);\n\tprops.SetValueRGBi(\"LabelColor\", RGBi(255,255,0), true);\n\tprops.SetValueFloat(\"Elevation\", 10.0f, true);\n\tprops.SetValueInt(\"TextFieldIndex\", 0, true);\n\n\tStyleDlg dlg(NULL, -1, _(\"Style\"));\n\tdlg.SetFeatureSet(pSet);\n\tdlg.SetOptions(vtGetDataPath(), props);\n\tif (dlg.ShowModal() != wxID_OK)\n\t{\n\t\tdelete pSet;\n\t\treturn NULL;\n\t}\n\tdlg.GetOptions(props);\n\n\t\/\/ wrap the features in an abstract layer\n\tvtAbstractLayer *pLay = new vtAbstractLayer;\n\tpLay->pSet = pSet;\n\n\t\/\/ add the new layer to the terrain\n\tpTerr->GetLayers().Append(pLay);\n\tpTerr->SetAbstractLayer(pLay);\n\n\treturn pLay;\n}\n<commit_msg>close progress on terrain load error, to avoid stuck dialog<commit_after>\/\/\n\/\/ EnviroGUI.cpp\n\/\/ GUI-specific functionality of the Enviro class\n\/\/\n\/\/ Copyright (c) 2003-2007 Virtual Terrain Project\n\/\/ Free for all uses, see license.txt for details.\n\/\/\n\n\/\/ For compilers that support precompilation, includes \"wx.h\".\n#include \"wx\/wxprec.h\"\n\n#ifndef WX_PRECOMP\n#include \"wx\/wx.h\"\n#endif\n\n#include \"vtlib\/vtlib.h\"\n#include \"vtlib\/core\/Terrain.h\"\n#include \"vtdata\/vtLog.h\"\n#include \"vtui\/Helper.h\"\n#include \"vtui\/InstanceDlg.h\"\n#include \"vtui\/ProfileDlg.h\"\n\n#include \"EnviroGUI.h\"\n#include \"EnviroApp.h\"\n#include \"EnviroFrame.h\"\n#include \"canvas.h\"\n#include \"DistanceDlg3d.h\"\n#include \"LayerDlg.h\"\n#include \"StyleDlg.h\"\n\n#if WIN32 || !wxUSE_JOYSTICK\n #include \"vtui\/Joystick.h\"\n#else\n #include \"wx\/joystick.h\"\n#endif\n\nDECLARE_APP(EnviroApp);\n\n\/\/\n\/\/ This is a 'singleton', the only instance of the global application object\n\/\/\nEnviroGUI g_App;\n\n\/\/ helper\nEnviroFrame *GetFrame()\n{\n\treturn dynamic_cast<EnviroFrame *>(wxGetApp().GetTopWindow());\n}\n\nEnviroGUI::EnviroGUI()\n{\n\tm_pJFlyer = NULL;\n}\n\nEnviroGUI::~EnviroGUI()\n{\n}\n\nvoid EnviroGUI::ShowPopupMenu(const IPoint2 &pos)\n{\n\tGetFrame()->ShowPopupMenu(pos);\n}\n\nvoid EnviroGUI::SetTerrainToGUI(vtTerrain *pTerrain)\n{\n\tGetFrame()->SetTerrainToGUI(pTerrain);\n\n\tif (pTerrain && m_pJFlyer)\n\t{\n\t\tfloat speed = pTerrain->GetParams().GetValueFloat(STR_NAVSPEED);\n\t\tm_pJFlyer->SetSpeed(speed);\n\t}\n}\n\nvoid EnviroGUI::SetFlightSpeed(float speed)\n{\n\tif (m_pJFlyer)\n\t\tm_pJFlyer->SetSpeed(speed);\n\tEnviro::SetFlightSpeed(speed);\n}\n\nconst char *AppStateNames[] = \n{\n\t\"AS_Initializing\",\n\t\"AS_Neutral\",\n\t\"AS_Orbit\",\n\t\"AS_FlyingIn\",\n\t\"AS_SwitchToTerrain\",\n\t\"AS_Terrain\",\n\t\"AS_MovingOut\",\n\t\"AS_Error\"\n};\n\nvoid EnviroGUI::SetState(AppState s)\n{\n\t\/\/ if entering or leaving terrain or orbit state\n\tAppState previous = m_state;\n\tm_state = s;\n\n\tif (m_state != previous)\n\t{\n\t\tVTLOG(\"Changing app state from %s to %s\\n\", AppStateNames[previous],\n\t\t\tAppStateNames[m_state]);\n\t}\n\n\tif ((previous == AS_Terrain && m_state != AS_Terrain) ||\n\t\t(previous == AS_Orbit && m_state != AS_Orbit) ||\n\t\t(previous != AS_Terrain && m_state == AS_Terrain) ||\n\t\t(previous != AS_Orbit && m_state == AS_Orbit))\n\t{\n\t\tGetFrame()->RefreshToolbar();\n\t}\n\n\tif (s == AS_Error)\n\t{\n\t\t\/\/ If we encounter an error while trying to open a terrain, don't get\n\t\t\/\/ stuck in a progress dialog.\n\t\tCloseProgressDialog2();\n\t}\n}\n\nvtString EnviroGUI::GetStringFromUser(const vtString &title, const vtString &msg)\n{\n\twxString caption(title, wxConvUTF8);\n\twxString message(msg, wxConvUTF8);\n\twxString str = wxGetTextFromUser(message, caption, _T(\"\"), GetFrame());\n\treturn (vtString) (const char *) str.mb_str(wxConvUTF8);\n}\n\nvoid EnviroGUI::ShowProgress(bool bShow)\n{\n\tif (bShow)\n\t\tOpenProgressDialog2(_(\"Creating Terrain\"), false, GetFrame());\n\telse\n\t\tCloseProgressDialog2();\n}\n\nvoid EnviroGUI::SetProgressTerrain(vtTerrain *pTerr)\n{\n\tpTerr->SetProgressCallback(progress_callback_minor);\n}\n\nvoid EnviroGUI::UpdateProgress(const char *msg, int amount1, int amount2)\n{\n\twxString str(msg, wxConvUTF8);\n\n\t\/\/ Try to translate it; a translation might be available.\n\t\/\/ If the string is not found in any of the loaded message catalogs,\n\t\/\/ the original string is returned.\n\twxString str2 = wxGetTranslation(str);\n\n\tUpdateProgressDialog2(amount1, amount2, str2);\n}\n\nvoid EnviroGUI::RefreshLayerView()\n{\n\tLayerDlg *dlg = GetFrame()->m_pLayerDlg;\n\tdlg->RefreshTreeContents();\n}\n\nvoid EnviroGUI::UpdateLayerView()\n{\n\tLayerDlg *dlg = GetFrame()->m_pLayerDlg;\n\tdlg->UpdateTreeTerrain();\n}\n\nvoid EnviroGUI::ShowLayerView()\n{\n\tLayerDlg *dlg = GetFrame()->m_pLayerDlg;\n\tdlg->Show(true);\n}\n\nvoid EnviroGUI::CameraChanged()\n{\n\tGetFrame()->CameraChanged();\n}\n\nvoid EnviroGUI::EarthPosUpdated()\n{\n\tGetFrame()->EarthPosUpdated(m_EarthPos);\n}\n\nvoid EnviroGUI::ShowDistance(const DPoint2 &p1, const DPoint2 &p2,\n\t\t\t\t\t\t\t double fGround, double fVertical)\n{\n\tGetFrame()->m_pDistanceDlg->SetPoints(p1, p2, false);\n\tGetFrame()->m_pDistanceDlg->SetGroundAndVertical(fGround, fVertical, true);\n\n\tif (GetFrame()->m_pProfileDlg)\n\t\tGetFrame()->m_pProfileDlg->SetPoints(p1, p2);\n}\n\nvoid EnviroGUI::ShowDistance(const DLine2 &path,\n\t\t\t\t\t\t\t double fGround, double fVertical)\n{\n\tGetFrame()->m_pDistanceDlg->SetPath(path, false);\n\tGetFrame()->m_pDistanceDlg->SetGroundAndVertical(fGround, fVertical, true);\n\n\tif (GetFrame()->m_pProfileDlg)\n\t\tGetFrame()->m_pProfileDlg->SetPath(path);\n}\n\nvtTagArray *EnviroGUI::GetInstanceFromGUI()\n{\n\treturn GetFrame()->m_pInstanceDlg->GetTagArray();\n}\n\nbool EnviroGUI::OnMouseEvent(vtMouseEvent &event)\n{\n\treturn GetFrame()->OnMouseEvent(event);\n}\n\nvoid EnviroGUI::SetupScene3()\n{\n\tGetFrame()->Setup3DScene();\n\n#if wxUSE_JOYSTICK || WIN32\n\tm_pJFlyer = new vtJoystickEngine;\n\tm_pJFlyer->SetName2(\"Joystick\");\n\tvtGetScene()->AddEngine(m_pJFlyer);\n\tm_pJFlyer->SetTarget(m_pNormalCamera);\n#endif\n}\n\nvoid EnviroGUI::SetTimeEngineToGUI(class vtTimeEngine *pEngine)\n{\n\tGetFrame()->SetTimeEngine(pEngine);\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nvoid EnviroGUI::SaveVegetation(bool bAskFilename)\n{\n\tvtTerrain *pTerr = GetCurrentTerrain();\n\tvtPlantInstanceArray &pia = pTerr->GetPlantInstances();\n\n\tvtString fname = pia.GetFilename();\n\n\tif (bAskFilename)\n\t{\n\t\t\/\/ save current directory\n\t\twxString path = wxGetCwd();\n\n\t\twxString default_file(StartOfFilename(fname), wxConvUTF8);\n\t\twxString default_dir(ExtractPath(fname), wxConvUTF8);\n\n\t\tEnableContinuousRendering(false);\n\t\twxFileDialog saveFile(NULL, _(\"Save Vegetation Data\"), default_dir,\n\t\t\tdefault_file, _(\"Vegetation Files (*.vf)|*.vf\"), wxFD_SAVE);\n\t\tbool bResult = (saveFile.ShowModal() == wxID_OK);\n\t\tEnableContinuousRendering(true);\n\t\tif (!bResult)\n\t\t{\n\t\t\twxSetWorkingDirectory(path);\t\/\/ restore\n\t\t\treturn;\n\t\t}\n\t\twxString str = saveFile.GetPath();\n\t\tfname = str.mb_str(wxConvUTF8);\n\t\tpia.SetFilename(fname);\n\t}\n\tpia.WriteVF(fname);\n}\n\nvoid EnviroGUI::SaveStructures(bool bAskFilename)\n{\n\tvtStructureArray3d *sa = GetCurrentTerrain()->GetStructureLayer();\n\tvtString fname = sa->GetFilename();\n\tif (bAskFilename)\n\t{\n\t\t\/\/ save current directory\n\t\twxString path = wxGetCwd();\n\n\t\twxString default_file(StartOfFilename(fname), wxConvUTF8);\n\t\twxString default_dir(ExtractPath(fname), wxConvUTF8);\n\n\t\tEnableContinuousRendering(false);\n\t\twxFileDialog saveFile(NULL, _(\"Save Built Structures Data\"),\n\t\t\tdefault_dir, default_file, _(\"Structure Files (*.vtst)|*.vtst\"),\n\t\t\twxFD_SAVE | wxFD_OVERWRITE_PROMPT);\n\t\tbool bResult = (saveFile.ShowModal() == wxID_OK);\n\t\tEnableContinuousRendering(true);\n\t\tif (!bResult)\n\t\t{\n\t\t\twxSetWorkingDirectory(path);\t\/\/ restore\n\t\t\treturn;\n\t\t}\n\t\twxString str = saveFile.GetPath();\n\t\tfname = str.mb_str(wxConvUTF8);\n\t\tsa->SetFilename(fname);\n\t}\n\tsa->WriteXML(fname);\n}\n\nbool EnviroGUI::IsAcceptable(vtTerrain *pTerr)\n{\n\treturn GetFrame()->IsAcceptable(pTerr);\n}\n\nvoid EnviroGUI::ShowMessage(const vtString &str)\n{\n\tEnableContinuousRendering(false);\n\n\twxString str2(str, wxConvUTF8);\n\twxMessageBox(str2);\n\n\tEnableContinuousRendering(true);\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nvtJoystickEngine::vtJoystickEngine()\n{\n\tm_fSpeed = 1.0f;\n\tm_fLastTime = 0.0f;\n\n\tm_pStick = new wxJoystick;\n\tif (!m_pStick->IsOk())\n\t{\n\t\tdelete m_pStick;\n\t\tm_pStick = NULL;\n\t}\n}\nvoid vtJoystickEngine::Eval()\n{\n\tif (!m_pStick)\n\t\treturn;\n\n\tfloat fTime = vtGetTime(), fElapsed = fTime - m_fLastTime;\n\n\tvtTransform *pTarget = (vtTransform*) GetTarget();\n\tif (pTarget)\n\t{\n\t\twxPoint p = m_pStick->GetPosition();\n\t\tint buttons = m_pStick->GetButtonState();\n\t\tfloat dx = ((float)p.x \/ 32768) - 1.0f;\n\t\tfloat dy = ((float)p.y \/ 32768) - 1.0f;\n\n\t\t\/\/ use a small dead zone to avoid drift\n\t\tconst float dead_zone = 0.04f;\n\n\t\tif (buttons & wxJOY_BUTTON2)\n\t\t{\n\t\t\t\/\/ move up down left right\n\t\t\tif (fabs(dx) > dead_zone)\n\t\t\t\tpTarget->TranslateLocal(FPoint3(dx * m_fSpeed * fElapsed, 0.0f, 0.0f));\n\t\t\tif (fabs(dy) > dead_zone)\n\t\t\t\tpTarget->Translate1(FPoint3(0.0f, dy * m_fSpeed * fElapsed, 0.0f));\n\t\t}\n\t\telse if (buttons & wxJOY_BUTTON3)\n\t\t{\n\t\t\t\/\/ pitch up down, yaw left right\n\t\t\tif (fabs(dx) > dead_zone)\n\t\t\t\tpTarget->RotateParent(FPoint3(0,1,0), -dx * fElapsed);\n\t\t\tif (fabs(dy) > dead_zone)\n\t\t\t\tpTarget->RotateLocal(FPoint3(1,0,0), dy * fElapsed);\n\t\t}\n\t\telse\n\t\t{\n\t\t\t\/\/ move forward-backward, turn left-right\n\t\t\tif (fabs(dy) > dead_zone)\n\t\t\t\tpTarget->TranslateLocal(FPoint3(0.0f, 0.0f, dy * m_fSpeed * fElapsed));\n\t\t\tif (fabs(dx) > dead_zone)\n\t\t\t\tpTarget->RotateParent(FPoint3(0,1,0), -dx * fElapsed);\n\t\t}\n\t}\n\tm_fLastTime = fTime;\n}\n\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ Helpers\n\nvtAbstractLayer *CreateNewAbstractPointLayer(vtTerrain *pTerr)\n{\n\t\/\/ make a new abstract layer (points)\n\tvtFeatureSetPoint2D *pSet = new vtFeatureSetPoint2D;\n\tvtTagArray &props = pSet->GetProperties();\n\tpSet->SetFilename(\"Untitled.shp\");\n\tpSet->AddField(\"Label\", FT_String);\n\n\t\/\/ Ask style for the new point layer\n\tprops.SetValueBool(\"Geometry\", false, true);\n\tprops.SetValueBool(\"Labels\", true, true);\n\tprops.SetValueRGBi(\"LabelColor\", RGBi(255,255,0), true);\n\tprops.SetValueFloat(\"Elevation\", 10.0f, true);\n\tprops.SetValueInt(\"TextFieldIndex\", 0, true);\n\n\tStyleDlg dlg(NULL, -1, _(\"Style\"));\n\tdlg.SetFeatureSet(pSet);\n\tdlg.SetOptions(vtGetDataPath(), props);\n\tif (dlg.ShowModal() != wxID_OK)\n\t{\n\t\tdelete pSet;\n\t\treturn NULL;\n\t}\n\tdlg.GetOptions(props);\n\n\t\/\/ wrap the features in an abstract layer\n\tvtAbstractLayer *pLay = new vtAbstractLayer;\n\tpLay->pSet = pSet;\n\n\t\/\/ add the new layer to the terrain\n\tpTerr->GetLayers().Append(pLay);\n\tpTerr->SetAbstractLayer(pLay);\n\n\treturn pLay;\n}\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_MATH_HELPERS_HPP\n#define NOMLIB_MATH_HELPERS_HPP\n\n#include <random>\n#include <cmath>\n\n#include \"nomlib\/config.hpp\"\n#include \"nomlib\/math\/Point2.hpp\"\n#include \"nomlib\/math\/Size2.hpp\"\n\nnamespace nom {\n\nconst double PI = 4.0 * atan ( 1.0 );\n\nnamespace priv {\n\nextern std::random_device rd;\nextern std::default_random_engine rd_generator;\n\n} \/\/ namespace priv\n\n\/\/\/ \\brief Initialize the default random engine.\n\/\/\/\n\/\/\/ \\param seed The seed sequence value for the random number generator.\n\/\/\/\n\/\/\/ \\remarks This function does not need to be called when the use of a known\n\/\/\/ seed source is not necessary.\n\/\/\/\n\/\/\/ \\note This function should only be called once, and before using any of the\n\/\/\/ random number generators provided by nomlib.\n\/\/\/\n\/\/\/ \\see nom::uniform_int_rand, nom::uniform_real_rand.\nvoid init_rand(uint32 seed_seq);\n\n\/\/\/ \\brief Generate a random number.\n\/\/\/\n\/\/\/ \\return Random number between the specified start and end numbers.\n\/\/\/\n\/\/\/ \\remarks This function should only be used with signed or unsigned integers.\ntemplate <typename T>\nT uniform_int_rand(T start_range, T end_range)\n{\n std::uniform_int_distribution<T> distribution(start_range, end_range);\n\n return distribution(priv::rd_generator);\n}\n\n\/\/\/ \\brief Generate a random number.\n\/\/\/\n\/\/\/ \\return Random number between the specified start and end numbers.\n\/\/\/\n\/\/\/ \\remarks This function should only be used with float or double numbers.\ntemplate <typename T>\nT uniform_real_rand(T start_range, T end_range)\n{\n std::uniform_real_distribution<T> distribution(start_range, end_range);\n\n return distribution(priv::rd_generator);\n}\n\n\/\/\/ Rotates a given X & Y coordinate point along a given pivot axis\n\/\/\/ (rotation point) at the given angle (in degrees), clockwise.\nconst Point2d rotate_points ( float angle, float x, float y, float pivot_x, float pivot_y );\n\n\/\/\/ \\brief Round a fractional value.\n\/\/\/\n\/\/\/ \\param number The 32-bit floating-point number to round.\n\/\/\/\n\/\/\/ \\returns The rounded value as a signed 32-bit integer.\n\/\/\/\n\/\/\/ \\remarks The number is round up when it is greater than 0.5 and rounded\n\/\/\/ down when the number is less than 0.5\ntemplate <typename T>\nT round_float(real32 number)\n{\n real32 ret = number < 0.0f ? ceilf(number - 0.5f) : floorf(number + 0.5f);\n return NOM_SCAST(T, ret);\n}\n\n\/\/\/ \\brief Round a fractional value.\n\/\/\/\n\/\/\/ \\param number The 64-bit floating-point number to round.\n\/\/\/\n\/\/\/ \\returns The rounded value as a signed 64-bit integer.\n\/\/\/\n\/\/\/ \\remarks The number is round up when it is greater than 0.5 and rounded\ntemplate <typename T>\nT round_double(real64 number)\n{\n real64 ret = number < 0.0f ? ceil(number - 0.5f) : floor(number + 0.5f);\n return NOM_SCAST(T, ret);\n}\n\n} \/\/ namespace nom\n\n#endif \/\/ include guard defined\n<commit_msg>math_helpers: Add ::round_float_down, ::round_float_up<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_MATH_HELPERS_HPP\n#define NOMLIB_MATH_HELPERS_HPP\n\n#include <random>\n#include <cmath>\n\n#include \"nomlib\/config.hpp\"\n#include \"nomlib\/math\/Point2.hpp\"\n#include \"nomlib\/math\/Size2.hpp\"\n\nnamespace nom {\n\nconst double PI = 4.0 * atan ( 1.0 );\n\nnamespace priv {\n\nextern std::random_device rd;\nextern std::default_random_engine rd_generator;\n\n} \/\/ namespace priv\n\n\/\/\/ \\brief Initialize the default random engine.\n\/\/\/\n\/\/\/ \\param seed The seed sequence value for the random number generator.\n\/\/\/\n\/\/\/ \\remarks This function does not need to be called when the use of a known\n\/\/\/ seed source is not necessary.\n\/\/\/\n\/\/\/ \\note This function should only be called once, and before using any of the\n\/\/\/ random number generators provided by nomlib.\n\/\/\/\n\/\/\/ \\see nom::uniform_int_rand, nom::uniform_real_rand.\nvoid init_rand(uint32 seed_seq);\n\n\/\/\/ \\brief Generate a random number.\n\/\/\/\n\/\/\/ \\return Random number between the specified start and end numbers.\n\/\/\/\n\/\/\/ \\remarks This function should only be used with signed or unsigned integers.\ntemplate <typename T>\nT uniform_int_rand(T start_range, T end_range)\n{\n std::uniform_int_distribution<T> distribution(start_range, end_range);\n\n return distribution(priv::rd_generator);\n}\n\n\/\/\/ \\brief Generate a random number.\n\/\/\/\n\/\/\/ \\return Random number between the specified start and end numbers.\n\/\/\/\n\/\/\/ \\remarks This function should only be used with float or double numbers.\ntemplate <typename T>\nT uniform_real_rand(T start_range, T end_range)\n{\n std::uniform_real_distribution<T> distribution(start_range, end_range);\n\n return distribution(priv::rd_generator);\n}\n\n\/\/\/ Rotates a given X & Y coordinate point along a given pivot axis\n\/\/\/ (rotation point) at the given angle (in degrees), clockwise.\nconst Point2d rotate_points ( float angle, float x, float y, float pivot_x, float pivot_y );\n\n\/\/\/ \\brief Round a fractional value.\n\/\/\/\n\/\/\/ \\param number The 32-bit floating-point number to round.\n\/\/\/\n\/\/\/ \\remarks The number is round up when it is greater than 0.5 and rounded\n\/\/\/ down when the number is less than 0.5\ntemplate <typename T>\nT round_float(real32 number)\n{\n real32 ret = number < 0.0f ? ceilf(number - 0.5f) : floorf(number + 0.5f);\n return NOM_SCAST(T, ret);\n}\n\n\/\/\/ \\brief Round a fractional value down to the nearest integral number.\n\/\/\/\n\/\/\/ \\param number The 32-bit floating-point number to round.\ntemplate <typename T>\nT round_float_down(real32 number)\n{\n real32 ret = floorf(number);\n return NOM_SCAST(T, ret);\n}\n\n\/\/\/ \\brief Round a fractional value up to the largest integral number.\n\/\/\/\n\/\/\/ \\param number The 32-bit floating-point number to round.\ntemplate <typename T>\nT round_float_up(real32 number)\n{\n real32 ret = ceilf(number);\n return NOM_SCAST(T, ret);\n}\n\n\/\/\/ \\brief Round a fractional value.\n\/\/\/\n\/\/\/ \\param number The 64-bit floating-point number to round.\n\/\/\/\n\/\/\/ \\remarks The number is round up when it is greater than 0.5 and rounded\n\/\/\/ down when the number is less than 0.5.\ntemplate <typename T>\nT round_double(real64 number)\n{\n real64 ret = number < 0.0f ? ceil(number - 0.5f) : floor(number + 0.5f);\n return NOM_SCAST(T, ret);\n}\n\n} \/\/ namespace nom\n\n#endif \/\/ include guard defined\n<|endoftext|>"} {"text":"<commit_before>\n#include <pthread.h>\n#include <iostream>\n\nstruct subArys{\n int** ary11;\n int** ary12;\n int** ary21;\n int** ary22;\n int n; \n};\n\nstruct multArgs{\n int** c;\n int** a;\n int** b;\n int n;\n \n public:\n multArgs(int** c_, int** a_, int** b_, int n_){\n c=c_;\n a=a_;\n b=b_;\n n=n_;\n }\n};\n\nstruct addArgs{\n int**c;\n int**t;\n int n;\n \n public:\n addArgs(int** c_, int** t_, int n_){\n c=c_;\n t=t_;\n n=n_;\n }\n};\n\n\n\nvoid *multMtx(void*);\nvoid *addMtx(void*);\nint** newAry(int);\nsubArys* split(int**, int);\nvoid printAry(int**, int);\n\nvoid testSplit(int);\nvoid testAdd();\n\nusing namespace std;\n\nint main(){\n testSplit(4);\n testAdd();\n \n return 0;\n}\n\nvoid *multMtx(void* param){\n\t multArgs* par = (multArgs*) param;\n\t int ** tt = newAry(par->n); \/\/create empty array\n\tif(par->n == 1){\n\t par->c[0][0] = par->a[0][0] * par->b[0][0];\n\t \/\/need to bundle for return here\n\t}\n\telse{\n\t \n\t subArys* a = split(par->a, par->n); \/\/aplit arrays\n\t subArys* b = split(par->b, par->n);\n\t subArys* c = split(par->c, par->n);\n\t subArys* t = split(tt, par->n);\n\t \/\/package all params\n\t multArgs* param1 = new multArgs(c->ary11, a->ary11, b->ary11, t->n);\n\t multArgs* param2 = new multArgs(c->ary12, a->ary11, b->ary12, t->n);\n\t multArgs* param3 = new multArgs(c->ary21, a->ary21, b->ary11, t->n);\n\t multArgs* param4 = new multArgs(c->ary22, a->ary21, b->ary12, t->n);\n\t multArgs* param5 = new multArgs(t->ary11, a->ary12, b->ary22, t->n);\n\t multArgs* param6 = new multArgs(t->ary12, a->ary12, b->ary22, t->n);\n\t multArgs* param7 = new multArgs(t->ary21, a->ary22, b->ary21, t->n);\n\t multArgs* param8 = new multArgs(t->ary22, a->ary22, b->ary22, t->n);\n\t pthread_t m1, m2, m3, m4, m5, m6, m7, m8;\n\t pthread_create(&m1, NULL, multMtx, (void*) param1);\n\t \/\/add and bundle for return here\n\t}\n\t\n\tdelete tt;\n\n}\n\nvoid *addMtx(void* param) {\n\taddArgs* par = (addArgs*) param;\n\t\n\tif(par->n==1){\n\t par->c[0][0]+=par->t[0][0];\n\t \n\t}\n\telse{\n\t subArys* c = split(par->c, par->n);\n\t subArys* t = split(par->t, par->n);\n\t \n\t addArgs* param1 = new addArgs(c->ary11, t->ary11, t->n);\n\t addArgs* param2 = new addArgs(c->ary12, t->ary12, t->n);\n\t addArgs* param3 = new addArgs(c->ary21, t->ary21, t->n);\n\t addArgs* param4 = new addArgs(c->ary22, t->ary22, t->n);\n\t pthread_t m1,m2, m3, m4;\n\t pthread_t threads[4]={m1, m2, m3, m4};\n\t \n\t pthread_create(&m1, NULL, addMtx, (void*) param1);\n\t pthread_create(&m2, NULL, addMtx, (void*) param2);\n\t pthread_create(&m3, NULL, addMtx, (void*) param3);\n\t pthread_create(&m4, NULL, addMtx, (void*) param4);\n\t \n\t \/\/thread syntax is all over the place and looks like a toddler threw up in my code\n\t pthread_join(m1,NULL);\n\t pthread_join(m2,NULL);\n\t pthread_join(m3,NULL);\n\t pthread_join(m4,NULL);\n\t}\n}\n\nint** newAry(int n){\n int** temp = new int*[n]; \/\/outer array for poitners\n for(int i=0;i<n;++i){\n temp[i]=new int[n]; \/\/inner 1d arrays of int*\n for(int j=0;j<n;++j){\n temp[i][j]= 0;\n }\n }\n return temp;\n}\n\nsubArys* split(int** ary, int n){\n subArys* temp = new subArys;\n \n temp->ary11 = newAry(n\/2); \/\/define all initial vals\n temp->ary12 = newAry(n\/2);\n temp->ary21 = newAry(n\/2);\n temp->ary22 = newAry(n\/2);\n temp->n = n\/2;\n int shift=n\/2;\n \n for(int i=0;i<n;++i){ \/\/loop through original and push to correct quad\n\n if(i<n\/2){\n temp->ary11[i]=&ary[i][0];\n temp->ary12[i]=&ary[i][n\/shift];\n }\n else{\n temp->ary21[i%shift]=&ary[i][0];\n temp->ary22[i%shift]=&ary[i][n\/shift];\n }\n }\n if(n==2){\/\/shitty edge case\n temp->ary12[0]=&ary[0][1];\n temp->ary22[0]=&ary[1][1];\n }\n return temp;\n}\n\nvoid testSplit(int n){\n int** ptr=newAry(n);\n cout<<\"*** Start Split Test ***\\n\";\n cout<<\"parent matrix to be split\\n\";\n for(int i=0;i<n;++i){\n for(int j=0;j<n;++j){\n ptr[i][j]=(i*10)+j+1; \/\/asign values to location pointed to \n cout<<ptr[i][j]<<\" \";\n }\n cout<<endl;\n }\n cout<<endl;\n \n subArys* test=split(ptr, n);\n n=test->n;\n \n cout<<\"top left quad, ary11\\n\";\n for(int i=0;i<n;++i){\n for(int j=0;j<n;++j){\n ptr[i][j]=(i*10)+j+1;\n cout<<test->ary11[i][j]<<\" \";\n }\n cout<<endl;\n }\n \n cout<<\"top right quad, ary12\\n\";\n for(int i=0;i<n;++i){\n for(int j=0;j<n;++j){\n ptr[i][j]=(i*10)+j+1;\n cout<<test->ary12[i][j]<<\" \";\n }\n cout<<endl;\n }\n \n cout<<\"bottom left quad, ary21\\n\";\n for(int i=0;i<n;++i){\n for(int j=0;j<n;++j){\n ptr[i][j]=(i*10)+j+1;\n cout<<test->ary21[i][j]<<\" \";\n }\n cout<<endl;\n }\n \n cout<<\"bottom right quad, ary22\\n\";\n for(int i=0;i<n;++i){\n for(int j=0;j<n;++j){\n ptr[i][j]=(i*10)+j+1;\n cout<<test->ary22[i][j]<<\" \";\n }\n cout<<endl;\n }\n cout<<\"*** End Split Test ***\\n\";\n}\n\nvoid testAdd(){\n int n=2;\n int** subA = newAry(n);\n int** subB = newAry(n);\n \n cout<<\"*** Start Add Test ***\\n\";\n for(int i=0;i<n;++i){\n for(int j=0;j<n;++j){\n\tsubA[i][j]=(i*2)+j;\n\tsubB[i][j]=(i*2)+j;\n }\n }\n printAry(subA, n);\n printAry(subB, n);\n \n addArgs* package = new addArgs(subA, subB, n);\n \n addMtx((void*)package);\n \n printAry(subA, 2);\n printAry(subB, 2);\n \n cout<<\"*** End Add Test ***\\n\";\n \n}\n\nvoid printAry(int ** ary, int n){\n for(int i=0;i<n;++i){\n for(int j=0;j<n;++j){\n\tcout<<ary[i][j]<<\" \";\n }\n cout<<endl;\n }\n cout<<endl;\n}\n<commit_msg>fixed Mult seg fault<commit_after>\n#include <pthread.h>\n#include <iostream>\n\nstruct subArys{\n int** ary11;\n int** ary12;\n int** ary21;\n int** ary22;\n int n; \n};\n\nstruct multArgs{\n int** c;\n int** a;\n int** b;\n int n;\n \n public:\n multArgs(int** c_, int** a_, int** b_, int n_){\n c=c_;\n a=a_;\n b=b_;\n n=n_;\n }\n};\n\nstruct addArgs{\n int**c;\n int**t;\n int n;\n \n public:\n addArgs(int** c_, int** t_, int n_){\n c=c_;\n t=t_;\n n=n_;\n }\n};\n\n\n\nvoid *multMtx(void*);\nvoid *addMtx(void*);\nint** newAry(int);\nsubArys* split(int**, int);\nvoid printAry(int**, int);\n\nvoid testSplit(int);\nvoid testAdd();\nvoid testMult();\n\nusing namespace std;\n\nint main(){\n \/\/ testSplit(4);\n \/\/ testAdd();\n testMult();\n \n return 0;\n}\n\nvoid *multMtx(void* param){\n\t multArgs* par = (multArgs*) param;\n\t int ** tt = newAry(par->n); \/\/create empty array\n\tif(par->n == 1){\n\t par->c[0][0] = par->a[0][0] * par->b[0][0];\n\t}\n\telse{\n\t \n\t subArys* a = split(par->a, par->n); \/\/aplit arrays\n\t subArys* b = split(par->b, par->n);\n\t subArys* c = split(par->c, par->n);\n\t subArys* t = split(tt, par->n);\n\t cout<<\"par length: \"<<par->n<<endl;\n\t cout<<\"a length: \"<<a->n<<endl;\n\t \/\/package all params\n\t multArgs* param1 = new multArgs(c->ary11, a->ary11, b->ary11, t->n);\n\t multArgs* param2 = new multArgs(c->ary12, a->ary11, b->ary12, t->n);\n\t multArgs* param3 = new multArgs(c->ary21, a->ary21, b->ary11, t->n);\n\t multArgs* param4 = new multArgs(c->ary22, a->ary21, b->ary12, t->n);\n\t multArgs* param5 = new multArgs(t->ary11, a->ary12, b->ary21, t->n);\n\t multArgs* param6 = new multArgs(t->ary12, a->ary12, b->ary22, t->n);\n\t multArgs* param7 = new multArgs(t->ary21, a->ary22, b->ary21, t->n);\n\t multArgs* param8 = new multArgs(t->ary22, a->ary22, b->ary22, t->n);\n\t pthread_t m1, m2, m3, m4, m5, m6, m7, m8;\n\t \/\/threads run rampent\n\t pthread_create(&m1, NULL, multMtx, (void*) param1);\n\t pthread_create(&m2, NULL, multMtx, (void*) param2);\n\t pthread_create(&m3, NULL, multMtx, (void*) param3);\n\t pthread_create(&m4, NULL, multMtx, (void*) param4);\n\t pthread_create(&m5, NULL, multMtx, (void*) param5);\n\t pthread_create(&m6, NULL, multMtx, (void*) param6);\n\t pthread_create(&m7, NULL, multMtx, (void*) param7);\n\t pthread_create(&m8, NULL, multMtx, (void*) param8);\n\t \/\/bring them home\n\t pthread_join(m1,NULL);\n\t pthread_join(m2,NULL);\n\t pthread_join(m3,NULL);\n\t pthread_join(m4,NULL);\n\t pthread_join(m5,NULL);\n\t pthread_join(m6,NULL);\n\t pthread_join(m7,NULL);\n\t pthread_join(m8,NULL);\n\t \n\t}\n\t\n\tdelete tt;\n\n}\n\nvoid *addMtx(void* param) {\n\taddArgs* par = (addArgs*) param;\n\t\n\tif(par->n==1){\n\t par->c[0][0]+=par->t[0][0];\n\t \n\t}\n\telse{\n\t subArys* c = split(par->c, par->n);\n\t subArys* t = split(par->t, par->n);\n\t \n\t addArgs* param1 = new addArgs(c->ary11, t->ary11, t->n);\n\t addArgs* param2 = new addArgs(c->ary12, t->ary12, t->n);\n\t addArgs* param3 = new addArgs(c->ary21, t->ary21, t->n);\n\t addArgs* param4 = new addArgs(c->ary22, t->ary22, t->n);\n\t pthread_t m1,m2, m3, m4;\n\t pthread_t threads[4]={m1, m2, m3, m4};\n\t \n\t pthread_create(&m1, NULL, addMtx, (void*) param1);\n\t pthread_create(&m2, NULL, addMtx, (void*) param2);\n\t pthread_create(&m3, NULL, addMtx, (void*) param3);\n\t pthread_create(&m4, NULL, addMtx, (void*) param4);\n\t \n\t \/\/thread syntax is all over the place and looks like a toddler threw up in my code\n\t pthread_join(m1,NULL);\n\t pthread_join(m2,NULL);\n\t pthread_join(m3,NULL);\n\t pthread_join(m4,NULL);\n\t}\n}\n\nint** newAry(int n){\n int** temp = new int*[n]; \/\/outer array for poitners\n for(int i=0;i<n;++i){\n temp[i]=new int[n]; \/\/inner 1d arrays of int*\n for(int j=0;j<n;++j){\n temp[i][j]= 0;\n }\n }\n return temp;\n}\n\nsubArys* split(int** ary, int n){\n subArys* temp = new subArys;\n \n temp->ary11 = newAry(n\/2); \/\/define all initial vals\n temp->ary12 = newAry(n\/2);\n temp->ary21 = newAry(n\/2);\n temp->ary22 = newAry(n\/2);\n temp->n = n\/2;\n int shift=n\/2;\n \n for(int i=0;i<n;++i){ \/\/loop through original and push to correct quad\n\n if(i<n\/2){\n temp->ary11[i]=&ary[i][0];\n temp->ary12[i]=&ary[i][n\/shift];\n }\n else{\n temp->ary21[i%shift]=&ary[i][0];\n temp->ary22[i%shift]=&ary[i][n\/shift];\n }\n }\n if(n==2){\/\/shitty edge case\n temp->ary12[0]=&ary[0][1];\n temp->ary22[0]=&ary[1][1];\n }\n return temp;\n}\n\nvoid testSplit(int n){\n int** ptr=newAry(n);\n cout<<\"*** Start Split Test ***\\n\";\n cout<<\"parent matrix to be split\\n\";\n for(int i=0;i<n;++i){\n for(int j=0;j<n;++j){\n ptr[i][j]=(i*10)+j+1; \/\/asign values to location pointed to \n cout<<ptr[i][j]<<\" \";\n }\n cout<<endl;\n }\n cout<<endl;\n \n subArys* test=split(ptr, n);\n n=test->n;\n \n cout<<\"top left quad, ary11\\n\";\n for(int i=0;i<n;++i){\n for(int j=0;j<n;++j){\n ptr[i][j]=(i*10)+j+1;\n cout<<test->ary11[i][j]<<\" \";\n }\n cout<<endl;\n }\n \n cout<<\"top right quad, ary12\\n\";\n for(int i=0;i<n;++i){\n for(int j=0;j<n;++j){\n ptr[i][j]=(i*10)+j+1;\n cout<<test->ary12[i][j]<<\" \";\n }\n cout<<endl;\n }\n \n cout<<\"bottom left quad, ary21\\n\";\n for(int i=0;i<n;++i){\n for(int j=0;j<n;++j){\n ptr[i][j]=(i*10)+j+1;\n cout<<test->ary21[i][j]<<\" \";\n }\n cout<<endl;\n }\n \n cout<<\"bottom right quad, ary22\\n\";\n for(int i=0;i<n;++i){\n for(int j=0;j<n;++j){\n ptr[i][j]=(i*10)+j+1;\n cout<<test->ary22[i][j]<<\" \";\n }\n cout<<endl;\n }\n cout<<\"*** End Split Test ***\\n\";\n}\n\nvoid testAdd(){\n int n=2;\n int** subA = newAry(n);\n int** subB = newAry(n);\n \n cout<<\"*** Start Add Test ***\\n\";\n for(int i=0;i<n;++i){\n for(int j=0;j<n;++j){\n\tsubA[i][j]=(i*2)+j;\n\tsubB[i][j]=(i*2)+j;\n }\n }\n cout<<\"array A before\\n\";\n printAry(subA, n);\n cout<<\"array B before\\n\";\n printAry(subB, n);\n \n addArgs* package = new addArgs(subA, subB, n);\n \n addMtx((void*)package);\n \n cout<<\"array A after\\n\";\n printAry(subA, 2);\n cout<<\"array B after\\n\";\n printAry(subB, 2);\n \n cout<<\"*** End Add Test ***\\n\";\n \n}\n\nvoid testMult(){\n int n=2;\n int** subA = newAry(n);\n int** subB = newAry(n);\n int** subC = newAry(n);\n \n cout<<\"*** Start Mult Test ***\\n\";\n for(int i=0;i<n;++i){\n for(int j=0;j<n;++j){\n\tsubA[i][j]=(i*2)+j;\n\tsubB[i][j]=(i*2)+j;\n }\n }\n \n cout<<\"array A before\\n\";\n printAry(subA, n);\n cout<<\"array B before\\n\";\n printAry(subB, n);\n cout<<\"answer array C before\\n\";\n printAry(subC, n);\n \n multArgs* package = new multArgs(subC, subA, subB, n);\n \n multMtx((void*)package);\n \n cout<<\"array A after\\n\";\n printAry(subA, 2);\n cout<<\"array B after\\n\";\n printAry(subB, 2);\n cout<<\"answer array C after\\n\";\n printAry(subC, n);\n cout<<\"should be\\n2 3\\n6 11\\n\";\n \n cout<<\"*** End Mult Test ***\\n\"; \n}\n\nvoid printAry(int ** ary, int n){\n for(int i=0;i<n;++i){\n for(int j=0;j<n;++j){\n\tcout<<ary[i][j]<<\" \";\n }\n cout<<endl;\n }\n cout<<endl;\n}\n<|endoftext|>"} {"text":"<commit_before>#define SYS_CLOCK_GETTIME 263\n#include \"linux_clock.cpp\"\n<commit_msg>Fix a syscall number for 64-bit arm<commit_after>#ifdef BITS_64\n#define SYS_CLOCK_GETTIME 113\n#endif\n\n#ifdef BITS_32\n#define SYS_CLOCK_GETTIME 263\n#endif\n\n#include \"linux_clock.cpp\"\n<|endoftext|>"} {"text":"<commit_before>\/*****************************************************************************\n * Copyright (C) 2008-2011 Massachusetts Institute of Technology *\n * *\n * Permission is hereby granted, free of charge, to any person obtaining *\n * a copy of this software and associated documentation files (the *\n * \"Software\"), to deal in the Software without restriction, including *\n * without limitation the rights to use, copy, modify, merge, publish, *\n * distribute, sublicense, and\/or sell copies of the Software, and to *\n * permit persons to whom the Software is furnished to do so, subject *\n * to the following conditions: *\n * *\n * The above copyright notice and this permission notice shall be included *\n * in all copies or substantial portions of the Software. *\n * *\n * THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY *\n * KIND, EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE *\n * WARRANTIES OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND *\n * NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE *\n * LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION *\n * OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION *\n * WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE *\n * *\n * This source code is part of the PetaBricks project: *\n * http:\/\/projects.csail.mit.edu\/petabricks\/ *\n * *\n *****************************************************************************\/\n#include \"testisolation.h\"\n#include \"dynamicscheduler.h\"\n#include \"gpumanager.h\"\n\n#include <limits>\n#include <string.h>\n\n#include \"petabricksruntime.h\"\n\n#ifdef HAVE_CONFIG_H\n# include \"config.h\"\n#endif\n\n#ifdef HAVE_POLL_H\n#include <poll.h>\n#endif \n#ifdef HAVE_SIGNAL_H\n#include <signal.h>\n#endif \n#ifdef HAVE_SYS_PRCTL_H\n#include <sys\/prctl.h>\n#endif\n#ifdef HAVE_SYS_SELECT_H\n#include <sys\/select.h>\n#endif\n#ifdef HAVE_SYS_SOCKET_H\n#include <sys\/socket.h>\n#endif\n#ifdef HAVE_SYS_TIME_H\n#include <sys\/time.h>\n#endif\n#ifdef HAVE_SYS_TYPES_H\n#include <sys\/types.h>\n#endif\n#ifdef HAVE_SYS_WAIT_H\n#include <sys\/wait.h>\n#endif\n\n\/\/ annoyingly lapack returns 0 when it aborts, so we use a \"secret\" rv here\n#define SUCCESS_RV 198\n#define RUNNING_RV -257\n#define CRASH_RV 666\n\nstatic void _settestprocflags(){\n#ifdef HAVE_SYS_PRCTL_H\n# ifdef PR_SET_PDEATHSIG \/\/linux 2.1.57\n \/\/automatically kill us when parent dies\n JWARNING(prctl(PR_SET_PDEATHSIG, SIGTERM, 0, 0, 0)==0);\n# endif\n# ifdef PR_GET_NAME \/\/linux 2.6.11 (PR_SET_NAME 2.6.9)\n \/\/append \"(timing)\" to our process name\n char buf[128];\/\/spec says 16 is big enough\n memset(buf, 0, sizeof buf);\n prctl(PR_GET_NAME, buf, 0, 0, 0);\n strncpy(buf+strlen(buf), \"(timing)\", sizeof(buf)-strlen(buf)-1);\n prctl(PR_SET_NAME, buf, 0, 0, 0);\n# endif\n#endif\n}\n\n\/\/keep these 1 char long: (all must be same size)\nstatic const char COOKIE_DONE[] = \"D\";\nstatic const char COOKIE_DISABLETIMEOUT[] = \"E\";\nstatic const char COOKIE_RESTARTTIMEOUT[] = \"R\";\nJASSERT_STATIC(sizeof COOKIE_DONE == sizeof COOKIE_DISABLETIMEOUT);\nJASSERT_STATIC(sizeof COOKIE_DONE == sizeof COOKIE_RESTARTTIMEOUT);\n\npetabricks::SubprocessTestIsolation::SubprocessTestIsolation(double to) \n : _pid(-1), _fd(-1), _rv(RUNNING_RV), _timeout(to), _timeoutEnabled(false), _start(jalib::JTime::null())\n{\n if(_timeout < std::numeric_limits<double>::max()-TIMEOUT_GRACESEC)\n _timeout += TIMEOUT_GRACESEC;\n}\n\nvoid petabricks::SubprocessTestIsolation::onTunableModification(jalib::JTunable* t, jalib::TunableValue, jalib::TunableValue newVal){ \n _modifications.push_back(TunableMod(t,newVal)); \n}\n\npetabricks::TestIsolation* theMasterProcess = NULL;\npetabricks::TestIsolation* petabricks::SubprocessTestIsolation::masterProcess() {\n return theMasterProcess;\n}\n\nbool petabricks::SubprocessTestIsolation::beginTest(int workerThreads, int reexecchild) {\n JASSERT(theMasterProcess==NULL);\n _modifications.clear();\n#ifdef HAVE_OPENCL\n GpuManager::shutdown();\n#endif\n DynamicScheduler::cpuScheduler().shutdown();\n int fds[2];\n \/\/JASSERT(pipe(fds) == 0);\n if(reexecchild<0) {\n JASSERT(socketpair(AF_UNIX, SOCK_STREAM, 0, fds) == 0);\n JASSERT((_pid=fork()) >=0);\n }else{\n _pid=0;\n }\n if(_pid>0){\n \/\/parent\n _fd=fds[0];\n close(fds[1]);\n _rv = RUNNING_RV;\n _timeoutEnabled = false;\n _start = jalib::JTime::now();\n \/\/JTRACE(\"parent\");\n return false;\n }else{\n \/\/child\n \/\/JTRACE(\"child\")(reexecchild);\n if(reexecchild<0) {\n _fd=fds[1];\n close(fds[0]);\n PetabricksRuntime::reexecTestIsolation(fds[1]);\n }else{\n _fd = reexecchild;\n }\n GpuManager::start();\n _settestprocflags();\n PetabricksRuntime::startWorkerThreads(workerThreads);\n jalib::JTunable::setModificationCallback(this); \n theMasterProcess=this;\n \/\/JTRACE(\"child starting\");\n restartTimeout();\n return true;\n }\n}\n\nvoid petabricks::SubprocessTestIsolation::disableTimeout() {\n JASSERT(write(_fd, COOKIE_DISABLETIMEOUT, strlen(COOKIE_DISABLETIMEOUT))>0)(JASSERT_ERRNO);\n fsync(_fd);\n}\n\nvoid petabricks::SubprocessTestIsolation::restartTimeout() {\n JASSERT(write(_fd, COOKIE_RESTARTTIMEOUT, strlen(COOKIE_RESTARTTIMEOUT))>0)(JASSERT_ERRNO);\n fsync(_fd);\n}\n\nvoid petabricks::SubprocessTestIsolation::endTest(TestResult& result) {\n JASSERT(_pid==0);\n JASSERT(write(_fd, COOKIE_DONE, strlen(COOKIE_DONE))>0)(JASSERT_ERRNO);\n jalib::JBinarySerializeWriterRaw o(\"pipe\", _fd);\n o.serialize(result.time);\n o.serialize(result.accuracy);\n o & result.hash;\n o.serializeVector(_modifications);\n fflush(NULL);\n fsync(_fd);\n fsync(fileno(stdout));\n fsync(fileno(stderr));\n \/\/GpuManager::shutdown();\n \/\/DynamicScheduler::cpuScheduler().shutdown();\n _exit(SUCCESS_RV);\n}\n\ninline static void _settimeout(struct timespec& timeout, double sec){\n if(sec >= std::numeric_limits<long>::max()){\n timeout.tv_sec=std::numeric_limits<long>::max();\n timeout.tv_nsec=0;\n }else{\n timeout.tv_sec = (long)sec;\n timeout.tv_nsec = (long)((sec-(double)timeout.tv_sec)*1.0e9);\n }\n}\n\ninline static void _settimeout(int& timeout, double sec){\n if(sec >= std::numeric_limits<int>::max()\/1000-1){\n timeout = -1;\n }else{\n timeout = (int)(sec*1000.0 + 0.5);\n }\n}\n\n\nvoid petabricks::SubprocessTestIsolation::recvResult(TestResult& result) {\n TimeoutT timeout;\n int ready;\n _settimeout(timeout, std::numeric_limits<int>::max());\n\n struct pollfd fds[1];\n fds[0].fd = _fd;\n fds[0].events = POLLIN;\n fds[0].revents = 0;\n\n for(;;){\n _settimeout(timeout, timeleft());\n \/\/JTRACE(\"timeout\")(timeout);\n ready = poll(fds, sizeof(fds)\/sizeof(struct pollfd), timeout);\n JASSERT(ready>=0)(ready);\n\n if(ready==0){ \/\/timeout\n killChild();\n break;\n }\n\n if(handleEvent(result)){\n break;\n }\n }\n}\n \nvoid petabricks::SubprocessTestIsolation::recvFirstResult(SubprocessTestIsolation& a, TestResult& aresult,\n SubprocessTestIsolation& b, TestResult& bresult) {\n struct pollfd fds[2];\n struct pollfd* pfds = fds;\n bool adone = false;\n bool bdone = false;\n int nfds = 2;\n fds[0].fd = a._fd;\n fds[0].events = POLLIN;\n fds[0].revents = 0;\n fds[1].fd = b._fd;\n fds[1].events = POLLIN;\n fds[1].revents = 0;\n\n for(;;){\n int ready = 0;\n double secleft = std::max(0.0, std::max(a.timeleft(), b.timeleft()));\n TimeoutT timeout;\n _settimeout(timeout, secleft);\n ready = poll(pfds, nfds, timeout);\n JASSERT(ready>=0)(ready);\n\n if(ready==0){ \/\/timeout\n a.killChild();\n b.killChild();\n break;\n }\n\n try {\n adone = adone || ((fds[0].revents&POLLIN)!=0 && a.handleEvent(aresult));\n } catch(UnknownTestFailure e) {\n adone = true;\n }\n try {\n bdone = bdone || ((fds[1].revents&POLLIN)!=0 && b.handleEvent(bresult));\n } catch(UnknownTestFailure e) {\n bdone = true;\n }\n if(adone) {\n fds[0].revents = 0;\n pfds = fds+1;\n nfds = 1;\n b._timeout = PetabricksRuntime::updateRaceTimeout(aresult, 0);\n }else if(bdone) {\n fds[1].revents = 0;\n pfds = fds;\n nfds = 1;\n a._timeout = PetabricksRuntime::updateRaceTimeout(bresult, 1);\n }\n if(adone && bdone) break;\n }\n}\n\ndouble petabricks::SubprocessTestIsolation::timeleft() const {\n if(!running())\n return 0;\n if(_timeoutEnabled)\n return _timeout - (jalib::JTime::now() - _start) + 0.02;\n return std::numeric_limits<double>::max();\n}\n\nbool petabricks::SubprocessTestIsolation::handleEvent(TestResult& result) {\n \/\/receive a control code\n std::string cnt = recvControlCookie();\n\n \/\/check control code:\n if(cnt==COOKIE_DISABLETIMEOUT){\n _timeoutEnabled = false;\n return false;\n }\n if(cnt==COOKIE_RESTARTTIMEOUT){\n _timeoutEnabled = true;\n _start = jalib::JTime::now();\n return false;\n }\n if(cnt!=COOKIE_DONE || (!running() && rv()!=SUCCESS_RV )){ \n \/\/unknown control code, most likely assertion failure in child\n killChild();\n throw UnknownTestFailure(rv());\n }\n\n \/\/read the result\n jalib::JBinarySerializeReaderRaw o(\"pipe\", _fd);\n o.serialize(result.time);\n o.serialize(result.accuracy);\n o & result.hash;\n o.serializeVector(_modifications);\n\n \/\/reapply tunable modifications to this process\n for(size_t i=0; i<_modifications.size(); ++i)\n _modifications[i].tunable->setValue(_modifications[i].value);\n _modifications.clear();\n\n \/\/wait for subprocess to exit cleanly\n waitExited();\n if(rv()!=SUCCESS_RV){\n throw UnknownTestFailure(rv());\n }\n return true;\n}\n\nstd::string petabricks::SubprocessTestIsolation::recvControlCookie() {\n \/\/perform a test read -- we dont expect reads to block because of pselect above\n char buf[sizeof COOKIE_DONE];\n for(ssize_t n=0; n==0;){\n memset(buf, 0, sizeof buf);\n n=recv(_fd, buf, strlen(COOKIE_DONE), MSG_DONTWAIT);\n if(n<0 && errno==EAGAIN)\n n=0;\n testExited();\n if(!running() && rv()!=SUCCESS_RV)\n break;\/\/child failed\n }\n return buf;\n}\n \nvoid petabricks::SubprocessTestIsolation::killChild() {\n if(running()){\n kill(_pid, TIMEOUTKILLSIG);\n waitExited();\n }\n}\nvoid petabricks::SubprocessTestIsolation::waitExited() {\n if(running()){\n if(waitpid(_pid, &_rv, 0)==_pid){\n JASSERT(!running())(_rv);\n }else\n JASSERT(false)(JASSERT_ERRNO).Text(\"wait failed\");\n }\n if(_fd>=0){\n close(_fd);\n _fd=-1;\n }\n\n}\nvoid petabricks::SubprocessTestIsolation::testExited() {\n if(running()){\n if(waitpid(_pid, &_rv, WNOHANG)==_pid)\n JASSERT(!running())(_rv);\n else\n _rv=RUNNING_RV;\/\/ensure running()\n }\n}\nbool petabricks::SubprocessTestIsolation::running() const{ \n return _rv<-256; \n}\nint petabricks::SubprocessTestIsolation::rv(){\n JASSERT(!running());\n if(WIFEXITED(_rv))\n return WEXITSTATUS(_rv);\n return CRASH_RV;\n}\n\nbool petabricks::DummyTestIsolation::beginTest(int workerThreads, int reexecchild) {\n DynamicScheduler::cpuScheduler().startWorkerThreads(workerThreads);\n JASSERT(reexecchild<0);\n return true;\n}\n\nvoid petabricks::DummyTestIsolation::endTest(TestResult&) {}\n\nvoid petabricks::DummyTestIsolation::recvResult(TestResult&) {\n JASSERT(false);\n}\n\n<commit_msg>shutdown remotehost<commit_after>\/*****************************************************************************\n * Copyright (C) 2008-2011 Massachusetts Institute of Technology *\n * *\n * Permission is hereby granted, free of charge, to any person obtaining *\n * a copy of this software and associated documentation files (the *\n * \"Software\"), to deal in the Software without restriction, including *\n * without limitation the rights to use, copy, modify, merge, publish, *\n * distribute, sublicense, and\/or sell copies of the Software, and to *\n * permit persons to whom the Software is furnished to do so, subject *\n * to the following conditions: *\n * *\n * The above copyright notice and this permission notice shall be included *\n * in all copies or substantial portions of the Software. *\n * *\n * THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY *\n * KIND, EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE *\n * WARRANTIES OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND *\n * NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE *\n * LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION *\n * OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION *\n * WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE *\n * *\n * This source code is part of the PetaBricks project: *\n * http:\/\/projects.csail.mit.edu\/petabricks\/ *\n * *\n *****************************************************************************\/\n#include \"testisolation.h\"\n#include \"dynamicscheduler.h\"\n#include \"gpumanager.h\"\n#include \"remotehost.h\"\n\n#include <limits>\n#include <string.h>\n\n#include \"petabricksruntime.h\"\n\n#ifdef HAVE_CONFIG_H\n# include \"config.h\"\n#endif\n\n#ifdef HAVE_POLL_H\n#include <poll.h>\n#endif\n#ifdef HAVE_SIGNAL_H\n#include <signal.h>\n#endif\n#ifdef HAVE_SYS_PRCTL_H\n#include <sys\/prctl.h>\n#endif\n#ifdef HAVE_SYS_SELECT_H\n#include <sys\/select.h>\n#endif\n#ifdef HAVE_SYS_SOCKET_H\n#include <sys\/socket.h>\n#endif\n#ifdef HAVE_SYS_TIME_H\n#include <sys\/time.h>\n#endif\n#ifdef HAVE_SYS_TYPES_H\n#include <sys\/types.h>\n#endif\n#ifdef HAVE_SYS_WAIT_H\n#include <sys\/wait.h>\n#endif\n\n\/\/ annoyingly lapack returns 0 when it aborts, so we use a \"secret\" rv here\n#define SUCCESS_RV 198\n#define RUNNING_RV -257\n#define CRASH_RV 666\n\nstatic void _settestprocflags(){\n#ifdef HAVE_SYS_PRCTL_H\n# ifdef PR_SET_PDEATHSIG \/\/linux 2.1.57\n \/\/automatically kill us when parent dies\n JWARNING(prctl(PR_SET_PDEATHSIG, SIGTERM, 0, 0, 0)==0);\n# endif\n# ifdef PR_GET_NAME \/\/linux 2.6.11 (PR_SET_NAME 2.6.9)\n \/\/append \"(timing)\" to our process name\n char buf[128];\/\/spec says 16 is big enough\n memset(buf, 0, sizeof buf);\n prctl(PR_GET_NAME, buf, 0, 0, 0);\n strncpy(buf+strlen(buf), \"(timing)\", sizeof(buf)-strlen(buf)-1);\n prctl(PR_SET_NAME, buf, 0, 0, 0);\n# endif\n#endif\n}\n\n\/\/keep these 1 char long: (all must be same size)\nstatic const char COOKIE_DONE[] = \"D\";\nstatic const char COOKIE_DISABLETIMEOUT[] = \"E\";\nstatic const char COOKIE_RESTARTTIMEOUT[] = \"R\";\nJASSERT_STATIC(sizeof COOKIE_DONE == sizeof COOKIE_DISABLETIMEOUT);\nJASSERT_STATIC(sizeof COOKIE_DONE == sizeof COOKIE_RESTARTTIMEOUT);\n\npetabricks::SubprocessTestIsolation::SubprocessTestIsolation(double to)\n : _pid(-1), _fd(-1), _rv(RUNNING_RV), _timeout(to), _timeoutEnabled(false), _start(jalib::JTime::null())\n{\n if(_timeout < std::numeric_limits<double>::max()-TIMEOUT_GRACESEC)\n _timeout += TIMEOUT_GRACESEC;\n}\n\nvoid petabricks::SubprocessTestIsolation::onTunableModification(jalib::JTunable* t, jalib::TunableValue, jalib::TunableValue newVal){\n _modifications.push_back(TunableMod(t,newVal));\n}\n\npetabricks::TestIsolation* theMasterProcess = NULL;\npetabricks::TestIsolation* petabricks::SubprocessTestIsolation::masterProcess() {\n return theMasterProcess;\n}\n\nbool petabricks::SubprocessTestIsolation::beginTest(int workerThreads, int reexecchild) {\n JASSERT(theMasterProcess==NULL);\n _modifications.clear();\n#ifdef HAVE_OPENCL\n GpuManager::shutdown();\n#endif\n DynamicScheduler::cpuScheduler().shutdown();\n int fds[2];\n \/\/JASSERT(pipe(fds) == 0);\n if(reexecchild<0) {\n JASSERT(socketpair(AF_UNIX, SOCK_STREAM, 0, fds) == 0);\n JASSERT((_pid=fork()) >=0);\n }else{\n _pid=0;\n }\n if(_pid>0){\n \/\/parent\n _fd=fds[0];\n close(fds[1]);\n _rv = RUNNING_RV;\n _timeoutEnabled = false;\n _start = jalib::JTime::now();\n \/\/JTRACE(\"parent\");\n return false;\n }else{\n \/\/child\n \/\/JTRACE(\"child\")(reexecchild);\n if(reexecchild<0) {\n _fd=fds[1];\n close(fds[0]);\n PetabricksRuntime::reexecTestIsolation(fds[1]);\n }else{\n _fd = reexecchild;\n }\n GpuManager::start();\n _settestprocflags();\n PetabricksRuntime::startWorkerThreads(workerThreads);\n jalib::JTunable::setModificationCallback(this);\n theMasterProcess=this;\n \/\/JTRACE(\"child starting\");\n restartTimeout();\n return true;\n }\n}\n\nvoid petabricks::SubprocessTestIsolation::disableTimeout() {\n JASSERT(write(_fd, COOKIE_DISABLETIMEOUT, strlen(COOKIE_DISABLETIMEOUT))>0)(JASSERT_ERRNO);\n fsync(_fd);\n}\n\nvoid petabricks::SubprocessTestIsolation::restartTimeout() {\n JASSERT(write(_fd, COOKIE_RESTARTTIMEOUT, strlen(COOKIE_RESTARTTIMEOUT))>0)(JASSERT_ERRNO);\n fsync(_fd);\n}\n\nvoid petabricks::SubprocessTestIsolation::endTest(TestResult& result) {\n JASSERT(_pid==0);\n JASSERT(write(_fd, COOKIE_DONE, strlen(COOKIE_DONE))>0)(JASSERT_ERRNO);\n jalib::JBinarySerializeWriterRaw o(\"pipe\", _fd);\n o.serialize(result.time);\n o.serialize(result.accuracy);\n o & result.hash;\n o.serializeVector(_modifications);\n fflush(NULL);\n fsync(_fd);\n fsync(fileno(stdout));\n fsync(fileno(stderr));\n \/\/GpuManager::shutdown();\n \/\/DynamicScheduler::cpuScheduler().shutdown();\n RemoteHostDB().instance().shutdown();\n _exit(SUCCESS_RV);\n}\n\ninline static void _settimeout(struct timespec& timeout, double sec){\n if(sec >= std::numeric_limits<long>::max()){\n timeout.tv_sec=std::numeric_limits<long>::max();\n timeout.tv_nsec=0;\n }else{\n timeout.tv_sec = (long)sec;\n timeout.tv_nsec = (long)((sec-(double)timeout.tv_sec)*1.0e9);\n }\n}\n\ninline static void _settimeout(int& timeout, double sec){\n if(sec >= std::numeric_limits<int>::max()\/1000-1){\n timeout = -1;\n }else{\n timeout = (int)(sec*1000.0 + 0.5);\n }\n}\n\n\nvoid petabricks::SubprocessTestIsolation::recvResult(TestResult& result) {\n TimeoutT timeout;\n int ready;\n _settimeout(timeout, std::numeric_limits<int>::max());\n\n struct pollfd fds[1];\n fds[0].fd = _fd;\n fds[0].events = POLLIN;\n fds[0].revents = 0;\n\n for(;;){\n _settimeout(timeout, timeleft());\n \/\/JTRACE(\"timeout\")(timeout);\n ready = poll(fds, sizeof(fds)\/sizeof(struct pollfd), timeout);\n JASSERT(ready>=0)(ready);\n\n if(ready==0){ \/\/timeout\n killChild();\n break;\n }\n\n if(handleEvent(result)){\n break;\n }\n }\n}\n\nvoid petabricks::SubprocessTestIsolation::recvFirstResult(SubprocessTestIsolation& a, TestResult& aresult,\n SubprocessTestIsolation& b, TestResult& bresult) {\n struct pollfd fds[2];\n struct pollfd* pfds = fds;\n bool adone = false;\n bool bdone = false;\n int nfds = 2;\n fds[0].fd = a._fd;\n fds[0].events = POLLIN;\n fds[0].revents = 0;\n fds[1].fd = b._fd;\n fds[1].events = POLLIN;\n fds[1].revents = 0;\n\n for(;;){\n int ready = 0;\n double secleft = std::max(0.0, std::max(a.timeleft(), b.timeleft()));\n TimeoutT timeout;\n _settimeout(timeout, secleft);\n ready = poll(pfds, nfds, timeout);\n JASSERT(ready>=0)(ready);\n\n if(ready==0){ \/\/timeout\n a.killChild();\n b.killChild();\n break;\n }\n\n try {\n adone = adone || ((fds[0].revents&POLLIN)!=0 && a.handleEvent(aresult));\n } catch(UnknownTestFailure e) {\n adone = true;\n }\n try {\n bdone = bdone || ((fds[1].revents&POLLIN)!=0 && b.handleEvent(bresult));\n } catch(UnknownTestFailure e) {\n bdone = true;\n }\n if(adone) {\n fds[0].revents = 0;\n pfds = fds+1;\n nfds = 1;\n b._timeout = PetabricksRuntime::updateRaceTimeout(aresult, 0);\n }else if(bdone) {\n fds[1].revents = 0;\n pfds = fds;\n nfds = 1;\n a._timeout = PetabricksRuntime::updateRaceTimeout(bresult, 1);\n }\n if(adone && bdone) break;\n }\n}\n\ndouble petabricks::SubprocessTestIsolation::timeleft() const {\n if(!running())\n return 0;\n if(_timeoutEnabled)\n return _timeout - (jalib::JTime::now() - _start) + 0.02;\n return std::numeric_limits<double>::max();\n}\n\nbool petabricks::SubprocessTestIsolation::handleEvent(TestResult& result) {\n \/\/receive a control code\n std::string cnt = recvControlCookie();\n\n \/\/check control code:\n if(cnt==COOKIE_DISABLETIMEOUT){\n _timeoutEnabled = false;\n return false;\n }\n if(cnt==COOKIE_RESTARTTIMEOUT){\n _timeoutEnabled = true;\n _start = jalib::JTime::now();\n return false;\n }\n if(cnt!=COOKIE_DONE || (!running() && rv()!=SUCCESS_RV )){\n \/\/unknown control code, most likely assertion failure in child\n killChild();\n throw UnknownTestFailure(rv());\n }\n\n \/\/read the result\n jalib::JBinarySerializeReaderRaw o(\"pipe\", _fd);\n o.serialize(result.time);\n o.serialize(result.accuracy);\n o & result.hash;\n o.serializeVector(_modifications);\n\n \/\/reapply tunable modifications to this process\n for(size_t i=0; i<_modifications.size(); ++i)\n _modifications[i].tunable->setValue(_modifications[i].value);\n _modifications.clear();\n\n \/\/wait for subprocess to exit cleanly\n waitExited();\n if(rv()!=SUCCESS_RV){\n throw UnknownTestFailure(rv());\n }\n return true;\n}\n\nstd::string petabricks::SubprocessTestIsolation::recvControlCookie() {\n \/\/perform a test read -- we dont expect reads to block because of pselect above\n char buf[sizeof COOKIE_DONE];\n for(ssize_t n=0; n==0;){\n memset(buf, 0, sizeof buf);\n n=recv(_fd, buf, strlen(COOKIE_DONE), MSG_DONTWAIT);\n if(n<0 && errno==EAGAIN)\n n=0;\n testExited();\n if(!running() && rv()!=SUCCESS_RV)\n break;\/\/child failed\n }\n return buf;\n}\n\nvoid petabricks::SubprocessTestIsolation::killChild() {\n if(running()){\n kill(_pid, TIMEOUTKILLSIG);\n waitExited();\n }\n}\nvoid petabricks::SubprocessTestIsolation::waitExited() {\n if(running()){\n if(waitpid(_pid, &_rv, 0)==_pid){\n JASSERT(!running())(_rv);\n }else\n JASSERT(false)(JASSERT_ERRNO).Text(\"wait failed\");\n }\n if(_fd>=0){\n close(_fd);\n _fd=-1;\n }\n\n}\nvoid petabricks::SubprocessTestIsolation::testExited() {\n if(running()){\n if(waitpid(_pid, &_rv, WNOHANG)==_pid)\n JASSERT(!running())(_rv);\n else\n _rv=RUNNING_RV;\/\/ensure running()\n }\n}\nbool petabricks::SubprocessTestIsolation::running() const{\n return _rv<-256;\n}\nint petabricks::SubprocessTestIsolation::rv(){\n JASSERT(!running());\n if(WIFEXITED(_rv))\n return WEXITSTATUS(_rv);\n return CRASH_RV;\n}\n\nbool petabricks::DummyTestIsolation::beginTest(int workerThreads, int reexecchild) {\n DynamicScheduler::cpuScheduler().startWorkerThreads(workerThreads);\n JASSERT(reexecchild<0);\n return true;\n}\n\nvoid petabricks::DummyTestIsolation::endTest(TestResult&) {}\n\nvoid petabricks::DummyTestIsolation::recvResult(TestResult&) {\n JASSERT(false);\n}\n\n<|endoftext|>"} {"text":"<commit_before>\/\/ ========================================================================== \/\/\n\/\/ This file is part of Sara, a basic set of libraries in C++ for computer\n\/\/ vision.\n\/\/\n\/\/ Copyright (C) 2015-2016 David Ok <david.ok8@gmail.com>\n\/\/\n\/\/ This Source Code Form is subject to the terms of the Mozilla Public\n\/\/ License v. 2.0. If a copy of the MPL was not distributed with this file,\n\/\/ you can obtain one at http:\/\/mozilla.org\/MPL\/2.0\/.\n\/\/ ========================================================================== \/\/\n\n\/\/! @file\n\n#pragma once\n\n#include <cstdint>\n\n#include <DO\/Sara\/Core\/ArrayIterators.hpp>\n#include <DO\/Sara\/Core\/MultiArray\/ElementTraits.hpp>\n\n\nnamespace DO { namespace Sara {\n\n \/\/! @{\n \/\/! @brief Forward declaration of the multi-dimensional array classes.\n template <typename T, int N, int StorageOrder = ColMajor>\n class MultiArrayView;\n\n template <typename MultiArrayView, template <typename> class Allocator>\n class MultiArrayBase;\n\n template <typename T, int N, int StorageOrder = ColMajor,\n template <typename> class Allocator = std::allocator>\n using MultiArray =\n MultiArrayBase<MultiArrayView<T, N, StorageOrder>, Allocator>;\n \/\/! @}\n\n\n template <typename T, int N, int S>\n class MultiArrayView\n {\n using self_type = MultiArrayView;\n\n public: \/* typedefs. *\/\n \/\/! Storage order.\n enum\n {\n Dimension = N,\n StorageOrder = S\n };\n\n \/\/! @{\n \/\/! @brief STL-compatible interface.\n using size_type = std::size_t;\n using difference_type = std::ptrdiff_t;\n using value_type = T;\n using pointer = T *;\n using const_pointer = const T *;\n using reference = T&;\n using const_reference = const T&;\n using iterator = T *;\n using const_iterator = const T *;\n \/\/! @}\n\n \/\/! @{\n \/\/! @brief Slice type.\n using slice_type = MultiArrayView<T, N - 1, S>;\n using const_slice_type = const MultiArrayView<T, N - 1, S>;\n \/\/! @}\n\n \/\/! @{\n \/\/! @brief Vector type.\n using vector_type = Matrix<int, N, 1>;\n using slice_vector_type = Matrix<int, N - 1, 1>;\n \/\/! @}\n\n \/\/! @{\n \/\/! @brief N-dimensional iterator type.\n using array_iterator = ArrayIterator<false, T, N, StorageOrder>;\n using const_array_iterator = ArrayIterator<true, T, N, StorageOrder>;\n \/\/! @}\n\n \/\/! @{\n \/\/! @brief N-dimensional subrange iterator.\n using subarray_iterator = SubarrayIterator<false, T, N, StorageOrder>;\n using const_subarray_iterator = SubarrayIterator<true, T, N, StorageOrder>;\n \/\/! @}\n\n \/\/! @{\n \/\/! @brief Array views for linear algebra.\n using flat_array_view_type =\n Map<Array<typename ElementTraits<T>::value_type, Dynamic, 1>>;\n using const_flat_array_view_type =\n Map<const Array<typename ElementTraits<T>::value_type, Dynamic, 1>>;\n \/\/! @}\n\n \/\/! @{\n \/\/! @brief Matrix views for linear algebra.\n using matrix_view_type = Map<Matrix<typename ElementTraits<T>::value_type,\n Dynamic, Dynamic, StorageOrder>>;\n using const_matrix_view_type =\n Map<const Matrix<typename ElementTraits<T>::value_type, Dynamic,\n Dynamic, StorageOrder>>;\n \/\/! @}\n\n public: \/* methods *\/\n \/\/! @brief Default constructor.\n inline MultiArrayView() = default;\n\n \/\/! @brief Copy constructor.\n inline MultiArrayView(const self_type&) = default;\n\n \/\/! @brief Move constructor.\n inline MultiArrayView(self_type&& other)\n {\n swap(other);\n }\n\n \/\/! @brief Constructor that wraps plain data with its known sizes.\n inline explicit MultiArrayView(value_type *data, const vector_type& sizes)\n : _begin{data}\n , _end{data + compute_size(sizes)}\n , _sizes{sizes}\n , _strides{compute_strides(sizes)}\n {\n }\n\n \/\/! @brief Copy assignment operator.\n self_type& operator=(self_type other)\n {\n swap(other);\n return *this;\n }\n\n \/\/! @brief Return the size vector of the MultiArray object.\n const vector_type& sizes() const\n {\n return _sizes;\n }\n\n \/\/! @brief Return the number of elements in the internal data array.\n size_type size() const\n {\n return _end - _begin;\n }\n\n \/\/! @brief Return the size of the MultiArray object along the i-th\n \/\/! dimension.\n int size(int i) const\n {\n return _sizes[i];\n }\n\n \/\/! @brief Return the number of rows.\n int rows() const\n {\n return _sizes[0];\n }\n\n \/\/! @brief Return the number of cols.\n int cols() const\n {\n return _sizes[1];\n }\n\n \/\/! @brief Return the depth size.\n int depth() const\n {\n return _sizes[2];\n }\n\n \/\/! @brief Return the stride vector of the MultiArray object.\n inline const vector_type& strides() const\n {\n return _strides;\n }\n\n \/\/! @brief Return the stride value along the i-th dimension.\n inline int stride(int i) const\n {\n return _strides[i];\n }\n \/\/! @{\n \/\/! @brief Return the array pointer\n inline pointer data()\n {\n return _begin;\n }\n\n inline const_pointer data() const\n {\n return _begin;\n }\n \/\/! @}\n\n \/\/! @{\n \/\/! @brief Return reference to the element at the given coordinates.\n inline reference operator()(const vector_type& pos)\n {\n return _begin[offset(pos)];\n }\n\n inline reference operator()(int i, int j)\n {\n static_assert(N == 2, \"MultiArray must be 2D\");\n return _begin[offset(Vector2i(i, j))];\n }\n\n inline reference operator()(int i, int j, int k)\n {\n static_assert(N == 3, \"MultiArray must be 3D\");\n return _begin[offset(Vector3i(i, j, k))];\n }\n\n inline const_reference operator()(const vector_type& pos) const\n {\n return _begin[offset(pos)];\n }\n\n inline const_reference operator()(int i, int j) const\n {\n static_assert(N == 2, \"MultiArray must be 2D\");\n return _begin[offset(Vector2i(i, j))];\n }\n\n inline const_reference operator()(int i, int j, int k) const\n {\n static_assert(N == 3, \"MultiArray must be 3D\");\n return _begin[offset(Vector3i(i, j, k))];\n }\n \/\/! @}\n\n \/\/! @{\n \/\/! @brief Return the i-th slice of the MultiArray object.\n inline slice_type operator[](int i)\n {\n auto slice_sizes = _sizes.tail(N - 1).eval();\n auto slice_data = _begin + _strides[0] * i;\n return slice_type{slice_data, slice_sizes};\n }\n\n inline const_slice_type operator[](int i) const\n {\n auto slice_sizes = _sizes.tail(N - 1).eval();\n auto slice_data = _begin + _strides[0] * i;\n return slice_type{slice_data, slice_sizes};\n }\n \/\/! @}\n\n \/\/! @{\n \/\/! @brief Return the begin iterator.\n inline iterator begin()\n {\n return _begin;\n }\n\n inline const_iterator begin() const\n {\n return _begin;\n }\n \/\/! @}\n\n \/\/! @{\n \/\/! @brief Return the end iterator.\n inline iterator end()\n {\n return _end;\n }\n\n inline const_iterator end() const\n {\n return _end;\n }\n \/\/! @}\n\n \/\/! @{\n \/\/! @brief Return the array view for linear algebra with Eigen libraries.\n inline flat_array_view_type flat_array()\n {\n return flat_array_view_type{\n reinterpret_cast<typename ElementTraits<T>::pointer>(data()),\n static_cast<int64_t>(size())};\n }\n\n inline const_flat_array_view_type flat_array() const\n {\n return const_flat_array_view_type{\n reinterpret_cast<const typename ElementTraits<T>::const_pointer>(\n data()),\n static_cast<int64_t>(size())};\n }\n \/\/! @}\n\n \/\/! @{\n \/\/! @brief Return the matrix view for linear algebra with Eigen libraries.\n inline matrix_view_type matrix()\n {\n static_assert(N == 2, \"MultiArray must be 2D\");\n return matrix_view_type{\n reinterpret_cast<typename ElementTraits<T>::pointer>(data()), rows(),\n cols()};\n }\n\n inline const_matrix_view_type matrix() const\n {\n static_assert(N == 2, \"MultiArray must be 2D\");\n return const_matrix_view_type{\n reinterpret_cast<typename ElementTraits<T>::const_pointer>(data()),\n rows(), cols()};\n }\n \/\/! @}\n\n \/\/! @{\n \/\/! @brief Return the begin iterator of the whole multi-array.\n inline array_iterator begin_array()\n {\n return array_iterator{false, _begin, vector_type::Zero(), _sizes,\n _strides};\n }\n\n inline const_array_iterator begin_array() const\n {\n return const_array_iterator{false, _begin, vector_type::Zero(), _sizes,\n _strides};\n }\n \/\/! @}\n\n \/\/! @{\n \/\/! @brief Return the begin iterator of the sub-array.\n inline subarray_iterator begin_subarray(const vector_type& start,\n const vector_type& end)\n {\n return subarray_iterator{false, _begin, start, end, _strides, _sizes};\n }\n\n inline const_subarray_iterator begin_subarray(const vector_type& start,\n const vector_type& end) const\n {\n return const_subarray_iterator{false, _begin, start,\n end, _strides, _sizes};\n }\n \/\/! @}\n\n \/\/! @brief Swap multi-array objects.\n inline void swap(self_type& other)\n {\n using std::swap;\n swap(_begin, other._begin);\n swap(_end, other._end);\n swap(_sizes, other._sizes);\n swap(_strides, other._strides);\n }\n\n \/\/! @{\n \/\/! @brief Equality comparison.\n inline bool operator==(const self_type& other) const\n {\n if (_sizes != other._sizes)\n return false;\n return std::equal(_begin, _end, other._begin);\n }\n\n inline bool operator!=(const self_type& other) const\n {\n return !(*this == other);\n }\n \/\/! @}\n\n \/\/! @brief Copy contents.\n inline void copy(const self_type& other) const\n {\n if (this == &other)\n return;\n\n if (_sizes != other._sizes)\n throw std::domain_error{\n \"Source and destination image sizes are not equal!\"};\n\n std::copy(other._begin, other._end, _begin);\n }\n\n \/\/! @brief Perform coefficient-wise transform in place.\n template <typename Op>\n inline auto cwise_transform_inplace(Op op) -> self_type&\n {\n for (auto pixel = begin(); pixel != end(); ++pixel)\n op(*pixel);\n return *this;\n }\n\n \/\/! @brief Perform coefficient-wise transform.\n template <typename Op>\n inline auto cwise_transform(Op op) const\n -> MultiArray<decltype(op(std::declval<value_type>())), Dimension,\n StorageOrder>\n {\n using ValueType = decltype(op(std::declval<value_type>()));\n\n auto dst = MultiArray<ValueType, N, S>{sizes()};\n\n auto src_pixel = begin();\n auto dst_pixel = dst.begin();\n for (; src_pixel != end(); ++src_pixel, ++dst_pixel)\n *dst_pixel = op(*src_pixel);\n\n return dst;\n }\n\n protected:\n \/\/! @brief Compute the strides according the size vector and storage order.\n inline vector_type compute_strides(const vector_type& sizes) const\n {\n return StrideComputer<StorageOrder>::eval(sizes);\n }\n\n \/\/! @brief Compute the raw size needed to allocate the internal data.\n inline size_type compute_size(const vector_type& sizes) const\n {\n auto sz = sizes.template cast<size_type>().eval();\n return std::accumulate(sz.data(), sz.data() + N, size_type(1),\n std::multiplies<size_type>());\n }\n\n \/\/! @brief Compute the 1D index of the corresponding coordinates.\n inline int offset(const vector_type& pos) const\n {\n return jump(pos, _strides);\n }\n\n protected: \/* data members. *\/\n \/\/! @brief First element of the internal array.\n value_type *_begin{nullptr};\n \/\/! @brief Last element of the internal array.\n value_type *_end{nullptr};\n \/\/! @brief Sizes vector.\n vector_type _sizes = vector_type::Zero();\n \/\/! @brief Strides vector.\n vector_type _strides = vector_type::Zero();\n };\n\n\n \/\/! @brief Output stream operator.\n template <typename T, int N, int StorageOrder>\n std::ostream& operator<<(std::ostream& os,\n const MultiArrayView<T, N, StorageOrder>& M)\n {\n os << M.sizes() << std::endl;\n os << M.array() << std::endl;\n return os;\n }\n\n\n} \/* namespace Sara *\/\n} \/* namespace DO *\/\n<commit_msg>MAINT: tentative fix for gcc 4.8.4.<commit_after>\/\/ ========================================================================== \/\/\n\/\/ This file is part of Sara, a basic set of libraries in C++ for computer\n\/\/ vision.\n\/\/\n\/\/ Copyright (C) 2015-2016 David Ok <david.ok8@gmail.com>\n\/\/\n\/\/ This Source Code Form is subject to the terms of the Mozilla Public\n\/\/ License v. 2.0. If a copy of the MPL was not distributed with this file,\n\/\/ you can obtain one at http:\/\/mozilla.org\/MPL\/2.0\/.\n\/\/ ========================================================================== \/\/\n\n\/\/! @file\n\n#pragma once\n\n#include <cstdint>\n\n#include <DO\/Sara\/Core\/ArrayIterators.hpp>\n#include <DO\/Sara\/Core\/MultiArray\/ElementTraits.hpp>\n\n\nnamespace DO { namespace Sara {\n\n \/\/! @{\n \/\/! @brief Forward declaration of the multi-dimensional array classes.\n template <typename T, int N, int StorageOrder = ColMajor>\n class MultiArrayView;\n\n template <typename MultiArrayView, template <typename> class Allocator>\n class MultiArrayBase;\n\n template <typename T, int N, int StorageOrder = ColMajor,\n template <typename> class Allocator = std::allocator>\n using MultiArray =\n MultiArrayBase<MultiArrayView<T, N, StorageOrder>, Allocator>;\n \/\/! @}\n\n\n template <typename T, int N, int S>\n class MultiArrayView\n {\n using self_type = MultiArrayView;\n\n public: \/* typedefs. *\/\n \/\/! Storage order.\n enum\n {\n Dimension = N,\n StorageOrder = S\n };\n\n \/\/! @{\n \/\/! @brief STL-compatible interface.\n using size_type = std::size_t;\n using difference_type = std::ptrdiff_t;\n using value_type = T;\n using pointer = T *;\n using const_pointer = const T *;\n using reference = T&;\n using const_reference = const T&;\n using iterator = T *;\n using const_iterator = const T *;\n \/\/! @}\n\n \/\/! @{\n \/\/! @brief Slice type.\n using slice_type = MultiArrayView<T, N - 1, S>;\n using const_slice_type = const MultiArrayView<T, N - 1, S>;\n \/\/! @}\n\n \/\/! @{\n \/\/! @brief Vector type.\n using vector_type = Matrix<int, N, 1>;\n using slice_vector_type = Matrix<int, N - 1, 1>;\n \/\/! @}\n\n \/\/! @{\n \/\/! @brief N-dimensional iterator type.\n using array_iterator = ArrayIterator<false, T, N, StorageOrder>;\n using const_array_iterator = ArrayIterator<true, T, N, StorageOrder>;\n \/\/! @}\n\n \/\/! @{\n \/\/! @brief N-dimensional subrange iterator.\n using subarray_iterator = SubarrayIterator<false, T, N, StorageOrder>;\n using const_subarray_iterator = SubarrayIterator<true, T, N, StorageOrder>;\n \/\/! @}\n\n \/\/! @{\n \/\/! @brief Array views for linear algebra.\n using flat_array_view_type =\n Map<Array<typename ElementTraits<T>::value_type, Dynamic, 1>>;\n using const_flat_array_view_type =\n Map<const Array<typename ElementTraits<T>::value_type, Dynamic, 1>>;\n \/\/! @}\n\n \/\/! @{\n \/\/! @brief Matrix views for linear algebra.\n using matrix_view_type = Map<Matrix<typename ElementTraits<T>::value_type,\n Dynamic, Dynamic, StorageOrder>>;\n using const_matrix_view_type =\n Map<const Matrix<typename ElementTraits<T>::value_type, Dynamic,\n Dynamic, StorageOrder>>;\n \/\/! @}\n\n public: \/* methods *\/\n \/\/! @brief Default constructor.\n inline MultiArrayView() = default;\n\n \/\/! @brief Copy constructor.\n inline MultiArrayView(const self_type&) = default;\n\n \/\/! @brief Move constructor.\n inline MultiArrayView(self_type&& other)\n {\n swap(other);\n }\n\n \/\/! @brief Constructor that wraps plain data with its known sizes.\n inline explicit MultiArrayView(value_type *data, const vector_type& sizes)\n : _begin{data}\n , _end{data + compute_size(sizes)}\n , _sizes{sizes}\n , _strides{compute_strides(sizes)}\n {\n }\n\n \/\/! @brief Copy assignment operator.\n self_type& operator=(self_type other)\n {\n swap(other);\n return *this;\n }\n\n \/\/! @brief Return the size vector of the MultiArray object.\n const vector_type& sizes() const\n {\n return _sizes;\n }\n\n \/\/! @brief Return the number of elements in the internal data array.\n size_type size() const\n {\n return _end - _begin;\n }\n\n \/\/! @brief Return the size of the MultiArray object along the i-th\n \/\/! dimension.\n int size(int i) const\n {\n return _sizes[i];\n }\n\n \/\/! @brief Return the number of rows.\n int rows() const\n {\n return _sizes[0];\n }\n\n \/\/! @brief Return the number of cols.\n int cols() const\n {\n return _sizes[1];\n }\n\n \/\/! @brief Return the depth size.\n int depth() const\n {\n return _sizes[2];\n }\n\n \/\/! @brief Return the stride vector of the MultiArray object.\n inline const vector_type& strides() const\n {\n return _strides;\n }\n\n \/\/! @brief Return the stride value along the i-th dimension.\n inline int stride(int i) const\n {\n return _strides[i];\n }\n \/\/! @{\n \/\/! @brief Return the array pointer\n inline pointer data()\n {\n return _begin;\n }\n\n inline const_pointer data() const\n {\n return _begin;\n }\n \/\/! @}\n\n \/\/! @{\n \/\/! @brief Return reference to the element at the given coordinates.\n inline reference operator()(const vector_type& pos)\n {\n return _begin[offset(pos)];\n }\n\n inline reference operator()(int i, int j)\n {\n static_assert(N == 2, \"MultiArray must be 2D\");\n return _begin[offset(Vector2i(i, j))];\n }\n\n inline reference operator()(int i, int j, int k)\n {\n static_assert(N == 3, \"MultiArray must be 3D\");\n return _begin[offset(Vector3i(i, j, k))];\n }\n\n inline const_reference operator()(const vector_type& pos) const\n {\n return _begin[offset(pos)];\n }\n\n inline const_reference operator()(int i, int j) const\n {\n static_assert(N == 2, \"MultiArray must be 2D\");\n return _begin[offset(Vector2i(i, j))];\n }\n\n inline const_reference operator()(int i, int j, int k) const\n {\n static_assert(N == 3, \"MultiArray must be 3D\");\n return _begin[offset(Vector3i(i, j, k))];\n }\n \/\/! @}\n\n \/\/! @{\n \/\/! @brief Return the i-th slice of the MultiArray object.\n inline slice_type operator[](int i)\n {\n auto slice_sizes = _sizes.tail(N - 1).eval();\n auto slice_data = _begin + _strides[0] * i;\n return slice_type{slice_data, slice_sizes};\n }\n\n inline const_slice_type operator[](int i) const\n {\n auto slice_sizes = _sizes.tail(N - 1).eval();\n auto slice_data = _begin + _strides[0] * i;\n return slice_type{slice_data, slice_sizes};\n }\n \/\/! @}\n\n \/\/! @{\n \/\/! @brief Return the begin iterator.\n inline iterator begin()\n {\n return _begin;\n }\n\n inline const_iterator begin() const\n {\n return _begin;\n }\n \/\/! @}\n\n \/\/! @{\n \/\/! @brief Return the end iterator.\n inline iterator end()\n {\n return _end;\n }\n\n inline const_iterator end() const\n {\n return _end;\n }\n \/\/! @}\n\n \/\/! @{\n \/\/! @brief Return the array view for linear algebra with Eigen libraries.\n inline flat_array_view_type flat_array()\n {\n return flat_array_view_type{\n reinterpret_cast<typename ElementTraits<T>::pointer>(data()),\n static_cast<int64_t>(size())};\n }\n\n inline const_flat_array_view_type flat_array() const\n {\n return const_flat_array_view_type{\n reinterpret_cast<const typename ElementTraits<T>::const_pointer>(\n data()),\n static_cast<int64_t>(size())};\n }\n \/\/! @}\n\n \/\/! @{\n \/\/! @brief Return the matrix view for linear algebra with Eigen libraries.\n inline matrix_view_type matrix()\n {\n static_assert(N == 2, \"MultiArray must be 2D\");\n return matrix_view_type{\n reinterpret_cast<typename ElementTraits<T>::pointer>(data()), rows(),\n cols()};\n }\n\n inline const_matrix_view_type matrix() const\n {\n static_assert(N == 2, \"MultiArray must be 2D\");\n return const_matrix_view_type{\n reinterpret_cast<typename ElementTraits<T>::const_pointer>(data()),\n rows(), cols()};\n }\n \/\/! @}\n\n \/\/! @{\n \/\/! @brief Return the begin iterator of the whole multi-array.\n inline array_iterator begin_array()\n {\n return array_iterator{false, _begin, vector_type::Zero(), _sizes,\n _strides};\n }\n\n inline const_array_iterator begin_array() const\n {\n return const_array_iterator{false, _begin, vector_type::Zero(), _sizes,\n _strides};\n }\n \/\/! @}\n\n \/\/! @{\n \/\/! @brief Return the begin iterator of the sub-array.\n inline subarray_iterator begin_subarray(const vector_type& start,\n const vector_type& end)\n {\n return subarray_iterator{false, _begin, start, end, _strides, _sizes};\n }\n\n inline const_subarray_iterator begin_subarray(const vector_type& start,\n const vector_type& end) const\n {\n return const_subarray_iterator{false, _begin, start,\n end, _strides, _sizes};\n }\n \/\/! @}\n\n \/\/! @brief Swap multi-array objects.\n inline void swap(self_type& other)\n {\n using std::swap;\n swap(_begin, other._begin);\n swap(_end, other._end);\n swap(_sizes, other._sizes);\n swap(_strides, other._strides);\n }\n\n \/\/! @{\n \/\/! @brief Equality comparison.\n inline bool operator==(const self_type& other) const\n {\n if (_sizes != other._sizes)\n return false;\n return std::equal(_begin, _end, other._begin);\n }\n\n inline bool operator!=(const self_type& other) const\n {\n return !(*this == other);\n }\n \/\/! @}\n\n \/\/! @brief Copy contents.\n inline void copy(const self_type& other) const\n {\n if (this == &other)\n return;\n\n if (_sizes != other._sizes)\n throw std::domain_error{\n \"Source and destination image sizes are not equal!\"};\n\n std::copy(other._begin, other._end, _begin);\n }\n\n \/\/! @brief Perform coefficient-wise transform in place.\n template <typename Op>\n inline auto cwise_transform_inplace(Op op) -> self_type&\n {\n for (auto pixel = begin(); pixel != end(); ++pixel)\n op(*pixel);\n return *this;\n }\n\n \/\/! @brief Perform coefficient-wise transform.\n template <typename Op>\n inline auto cwise_transform(Op op) const\n -> MultiArray<decltype(op(std::declval<value_type>())), Dimension,\n StorageOrder>\n {\n using ValueType = decltype(op(std::declval<value_type>()));\n\n auto dst = MultiArray<ValueType, N, S>{sizes()};\n\n auto src_pixel = begin();\n auto dst_pixel = dst.begin();\n for (; src_pixel != end(); ++src_pixel, ++dst_pixel)\n *dst_pixel = op(*src_pixel);\n\n return dst;\n }\n\n protected:\n \/\/! @brief Compute the strides according the size vector and storage order.\n inline vector_type compute_strides(const vector_type& sizes) const\n {\n return StrideComputer<StorageOrder>::eval(sizes);\n }\n\n \/\/! @brief Compute the raw size needed to allocate the internal data.\n inline size_type compute_size(const vector_type& sizes) const\n {\n auto sz = sizes.template cast<size_type>().eval();\n return std::accumulate(sz.data(), sz.data() + N, size_type(1),\n std::multiplies<size_type>());\n }\n\n \/\/! @brief Compute the 1D index of the corresponding coordinates.\n inline int offset(const vector_type& pos) const\n {\n return jump(pos, _strides);\n }\n\n protected: \/* data members. *\/\n \/\/! @brief First element of the internal array.\n value_type *_begin{nullptr};\n \/\/! @brief Last element of the internal array.\n value_type *_end{nullptr};\n \/\/! @brief Sizes vector.\n vector_type _sizes{vector_type::Zero().eval()};\n \/\/! @brief Strides vector.\n vector_type _strides{vector_type::Zero().eval()};\n };\n\n\n \/\/! @brief Output stream operator.\n template <typename T, int N, int StorageOrder>\n std::ostream& operator<<(std::ostream& os,\n const MultiArrayView<T, N, StorageOrder>& M)\n {\n os << M.sizes() << std::endl;\n os << M.array() << std::endl;\n return os;\n }\n\n\n} \/* namespace Sara *\/\n} \/* namespace DO *\/\n<|endoftext|>"} {"text":"<commit_before>\/\/===-- LLVMSymbolize.cpp -------------------------------------------------===\/\/\n\/\/\n\/\/ The LLVM Compiler Infrastructure\n\/\/\n\/\/ This file is distributed under the University of Illinois Open Source\n\/\/ License. See LICENSE.TXT for details.\n\/\/\n\/\/===----------------------------------------------------------------------===\/\/\n\/\/\n\/\/ Implementation for LLVM symbolization library.\n\/\/\n\/\/===----------------------------------------------------------------------===\/\/\n\n#include \"LLVMSymbolize.h\"\n#include \"llvm\/ADT\/STLExtras.h\"\n#include \"llvm\/Object\/MachO.h\"\n#include \"llvm\/Support\/Casting.h\"\n#include \"llvm\/Support\/FileSystem.h\"\n#include \"llvm\/Support\/Path.h\"\n\n#include <sstream>\n\nnamespace llvm {\nnamespace symbolize {\n\nstatic bool error(error_code ec) {\n if (!ec)\n return false;\n errs() << \"LLVMSymbolizer: error reading file: \" << ec.message() << \".\\n\";\n return true;\n}\n\nstatic uint32_t\ngetDILineInfoSpecifierFlags(const LLVMSymbolizer::Options &Opts) {\n uint32_t Flags = llvm::DILineInfoSpecifier::FileLineInfo |\n llvm::DILineInfoSpecifier::AbsoluteFilePath;\n if (Opts.PrintFunctions)\n Flags |= llvm::DILineInfoSpecifier::FunctionName;\n return Flags;\n}\n\nstatic void patchFunctionNameInDILineInfo(const std::string &NewFunctionName,\n DILineInfo &LineInfo) {\n std::string FileName = LineInfo.getFileName();\n LineInfo = DILineInfo(StringRef(FileName), StringRef(NewFunctionName),\n LineInfo.getLine(), LineInfo.getColumn());\n}\n\nModuleInfo::ModuleInfo(ObjectFile *Obj, DIContext *DICtx)\n : Module(Obj), DebugInfoContext(DICtx) {\n error_code ec;\n for (symbol_iterator si = Module->begin_symbols(), se = Module->end_symbols();\n si != se; si.increment(ec)) {\n if (error(ec))\n return;\n SymbolRef::Type SymbolType;\n if (error(si->getType(SymbolType)))\n continue;\n if (SymbolType != SymbolRef::ST_Function &&\n SymbolType != SymbolRef::ST_Data)\n continue;\n uint64_t SymbolAddress;\n if (error(si->getAddress(SymbolAddress)) ||\n SymbolAddress == UnknownAddressOrSize)\n continue;\n uint64_t SymbolSize;\n \/\/ Getting symbol size is linear for Mach-O files, so assume that symbol\n \/\/ occupies the memory range up to the following symbol.\n if (isa<MachOObjectFile>(Obj))\n SymbolSize = 0;\n else if (error(si->getSize(SymbolSize)) ||\n SymbolSize == UnknownAddressOrSize)\n continue;\n StringRef SymbolName;\n if (error(si->getName(SymbolName)))\n continue;\n \/\/ Mach-O symbol table names have leading underscore, skip it.\n if (Module->isMachO() && SymbolName.size() > 0 && SymbolName[0] == '_')\n SymbolName = SymbolName.drop_front();\n \/\/ FIXME: If a function has alias, there are two entries in symbol table\n \/\/ with same address size. Make sure we choose the correct one.\n SymbolMapTy &M = SymbolType == SymbolRef::ST_Function ? Functions : Objects;\n SymbolDesc SD = { SymbolAddress, SymbolSize };\n M.insert(std::make_pair(SD, SymbolName));\n }\n}\n\nbool ModuleInfo::getNameFromSymbolTable(SymbolRef::Type Type, uint64_t Address,\n std::string &Name, uint64_t &Addr,\n uint64_t &Size) const {\n const SymbolMapTy &M = Type == SymbolRef::ST_Function ? Functions : Objects;\n if (M.empty())\n return false;\n SymbolDesc SD = { Address, Address };\n SymbolMapTy::const_iterator it = M.upper_bound(SD);\n if (it == M.begin())\n return false;\n --it;\n if (it->first.Size != 0 && it->first.Addr + it->first.Size <= Address)\n return false;\n Name = it->second.str();\n Addr = it->first.Addr;\n Size = it->first.Size;\n return true;\n}\n\nDILineInfo ModuleInfo::symbolizeCode(\n uint64_t ModuleOffset, const LLVMSymbolizer::Options &Opts) const {\n DILineInfo LineInfo;\n if (DebugInfoContext) {\n LineInfo = DebugInfoContext->getLineInfoForAddress(\n ModuleOffset, getDILineInfoSpecifierFlags(Opts));\n }\n \/\/ Override function name from symbol table if necessary.\n if (Opts.PrintFunctions && Opts.UseSymbolTable) {\n std::string FunctionName;\n uint64_t Start, Size;\n if (getNameFromSymbolTable(SymbolRef::ST_Function, ModuleOffset,\n FunctionName, Start, Size)) {\n patchFunctionNameInDILineInfo(FunctionName, LineInfo);\n }\n }\n return LineInfo;\n}\n\nDIInliningInfo ModuleInfo::symbolizeInlinedCode(\n uint64_t ModuleOffset, const LLVMSymbolizer::Options &Opts) const {\n DIInliningInfo InlinedContext;\n if (DebugInfoContext) {\n InlinedContext = DebugInfoContext->getInliningInfoForAddress(\n ModuleOffset, getDILineInfoSpecifierFlags(Opts));\n }\n \/\/ Make sure there is at least one frame in context.\n if (InlinedContext.getNumberOfFrames() == 0) {\n InlinedContext.addFrame(DILineInfo());\n }\n \/\/ Override the function name in lower frame with name from symbol table.\n if (Opts.PrintFunctions && Opts.UseSymbolTable) {\n DIInliningInfo PatchedInlinedContext;\n for (uint32_t i = 0, n = InlinedContext.getNumberOfFrames(); i < n; i++) {\n DILineInfo LineInfo = InlinedContext.getFrame(i);\n if (i == n - 1) {\n std::string FunctionName;\n uint64_t Start, Size;\n if (getNameFromSymbolTable(SymbolRef::ST_Function, ModuleOffset,\n FunctionName, Start, Size)) {\n patchFunctionNameInDILineInfo(FunctionName, LineInfo);\n }\n }\n PatchedInlinedContext.addFrame(LineInfo);\n }\n InlinedContext = PatchedInlinedContext;\n }\n return InlinedContext;\n}\n\nbool ModuleInfo::symbolizeData(uint64_t ModuleOffset, std::string &Name,\n uint64_t &Start, uint64_t &Size) const {\n return getNameFromSymbolTable(SymbolRef::ST_Data, ModuleOffset, Name, Start,\n Size);\n}\n\nconst char LLVMSymbolizer::kBadString[] = \"??\";\n\nstd::string LLVMSymbolizer::symbolizeCode(const std::string &ModuleName,\n uint64_t ModuleOffset) {\n ModuleInfo *Info = getOrCreateModuleInfo(ModuleName);\n if (Info == 0)\n return printDILineInfo(DILineInfo());\n if (Opts.PrintInlining) {\n DIInliningInfo InlinedContext =\n Info->symbolizeInlinedCode(ModuleOffset, Opts);\n uint32_t FramesNum = InlinedContext.getNumberOfFrames();\n assert(FramesNum > 0);\n std::string Result;\n for (uint32_t i = 0; i < FramesNum; i++) {\n DILineInfo LineInfo = InlinedContext.getFrame(i);\n Result += printDILineInfo(LineInfo);\n }\n return Result;\n }\n DILineInfo LineInfo = Info->symbolizeCode(ModuleOffset, Opts);\n return printDILineInfo(LineInfo);\n}\n\nstd::string LLVMSymbolizer::symbolizeData(const std::string &ModuleName,\n uint64_t ModuleOffset) {\n std::string Name = kBadString;\n uint64_t Start = 0;\n uint64_t Size = 0;\n if (Opts.UseSymbolTable) {\n if (ModuleInfo *Info = getOrCreateModuleInfo(ModuleName)) {\n if (Info->symbolizeData(ModuleOffset, Name, Start, Size) && Opts.Demangle)\n Name = DemangleName(Name);\n }\n }\n std::stringstream ss;\n ss << Name << \"\\n\" << Start << \" \" << Size << \"\\n\";\n return ss.str();\n}\n\nvoid LLVMSymbolizer::flush() {\n DeleteContainerSeconds(Modules);\n DeleteContainerPointers(ParsedBinariesAndObjects);\n BinaryForPath.clear();\n ObjectFileForArch.clear();\n}\n\nstatic std::string getDarwinDWARFResourceForPath(const std::string &Path) {\n StringRef Basename = sys::path::filename(Path);\n const std::string &DSymDirectory = Path + \".dSYM\";\n SmallString<16> ResourceName = StringRef(DSymDirectory);\n sys::path::append(ResourceName, \"Contents\", \"Resources\", \"DWARF\");\n sys::path::append(ResourceName, Basename);\n return ResourceName.str();\n}\n\nLLVMSymbolizer::BinaryPair\nLLVMSymbolizer::getOrCreateBinary(const std::string &Path) {\n BinaryMapTy::iterator I = BinaryForPath.find(Path);\n if (I != BinaryForPath.end())\n return I->second;\n Binary *Bin = 0;\n Binary *DbgBin = 0;\n OwningPtr<Binary> ParsedBinary;\n OwningPtr<Binary> ParsedDbgBinary;\n if (!error(createBinary(Path, ParsedBinary))) {\n \/\/ Check if it's a universal binary.\n Bin = ParsedBinary.take();\n ParsedBinariesAndObjects.push_back(Bin);\n if (Bin->isMachO() || Bin->isMachOUniversalBinary()) {\n \/\/ On Darwin we may find DWARF in separate object file in\n \/\/ resource directory.\n const std::string &ResourcePath =\n getDarwinDWARFResourceForPath(Path);\n bool ResourceFileExists = false;\n if (!sys::fs::exists(ResourcePath, ResourceFileExists) &&\n ResourceFileExists &&\n !error(createBinary(ResourcePath, ParsedDbgBinary))) {\n DbgBin = ParsedDbgBinary.take();\n ParsedBinariesAndObjects.push_back(DbgBin);\n }\n }\n }\n if (DbgBin == 0)\n DbgBin = Bin;\n BinaryPair Res = std::make_pair(Bin, DbgBin);\n BinaryForPath[Path] = Res;\n return Res;\n}\n\nObjectFile *\nLLVMSymbolizer::getObjectFileFromBinary(Binary *Bin, const std::string &ArchName) {\n if (Bin == 0)\n return 0;\n ObjectFile *Res = 0;\n if (MachOUniversalBinary *UB = dyn_cast<MachOUniversalBinary>(Bin)) {\n ObjectFileForArchMapTy::iterator I = ObjectFileForArch.find(\n std::make_pair(UB, ArchName));\n if (I != ObjectFileForArch.end())\n return I->second;\n OwningPtr<ObjectFile> ParsedObj;\n if (!UB->getObjectForArch(Triple(ArchName).getArch(), ParsedObj)) {\n Res = ParsedObj.take();\n ParsedBinariesAndObjects.push_back(Res);\n }\n ObjectFileForArch[std::make_pair(UB, ArchName)] = Res;\n } else if (Bin->isObject()) {\n Res = cast<ObjectFile>(Bin);\n }\n return Res;\n}\n\nModuleInfo *\nLLVMSymbolizer::getOrCreateModuleInfo(const std::string &ModuleName) {\n ModuleMapTy::iterator I = Modules.find(ModuleName);\n if (I != Modules.end())\n return I->second;\n std::string BinaryName = ModuleName;\n std::string ArchName = Opts.DefaultArch;\n size_t ColonPos = ModuleName.find_last_of(':');\n \/\/ Verify that substring after colon form a valid arch name.\n if (ColonPos != std::string::npos) {\n std::string ArchStr = ModuleName.substr(ColonPos + 1);\n if (Triple(ArchStr).getArch() != Triple::ArchType::UnknownArch) {\n BinaryName = ModuleName.substr(0, ColonPos);\n ArchName = ArchStr;\n }\n }\n BinaryPair Binaries = getOrCreateBinary(BinaryName);\n ObjectFile *Obj = getObjectFileFromBinary(Binaries.first, ArchName);\n ObjectFile *DbgObj = getObjectFileFromBinary(Binaries.second, ArchName);\n\n if (Obj == 0) {\n \/\/ Failed to find valid object file.\n Modules.insert(make_pair(ModuleName, (ModuleInfo *)0));\n return 0;\n }\n DIContext *Context = DIContext::getDWARFContext(DbgObj);\n assert(Context);\n ModuleInfo *Info = new ModuleInfo(Obj, Context);\n Modules.insert(make_pair(ModuleName, Info));\n return Info;\n}\n\nstd::string LLVMSymbolizer::printDILineInfo(DILineInfo LineInfo) const {\n \/\/ By default, DILineInfo contains \"<invalid>\" for function\/filename it\n \/\/ cannot fetch. We replace it to \"??\" to make our output closer to addr2line.\n static const std::string kDILineInfoBadString = \"<invalid>\";\n std::stringstream Result;\n if (Opts.PrintFunctions) {\n std::string FunctionName = LineInfo.getFunctionName();\n if (FunctionName == kDILineInfoBadString)\n FunctionName = kBadString;\n else if (Opts.Demangle)\n FunctionName = DemangleName(FunctionName);\n Result << FunctionName << \"\\n\";\n }\n std::string Filename = LineInfo.getFileName();\n if (Filename == kDILineInfoBadString)\n Filename = kBadString;\n Result << Filename << \":\" << LineInfo.getLine() << \":\" << LineInfo.getColumn()\n << \"\\n\";\n return Result.str();\n}\n\n#if !defined(_MSC_VER)\n\/\/ Assume that __cxa_demangle is provided by libcxxabi (except for Windows).\nextern \"C\" char *__cxa_demangle(const char *mangled_name, char *output_buffer,\n size_t *length, int *status);\n#endif\n\nstd::string LLVMSymbolizer::DemangleName(const std::string &Name) {\n#if !defined(_MSC_VER)\n int status = 0;\n char *DemangledName = __cxa_demangle(Name.c_str(), 0, 0, &status);\n if (status != 0)\n return Name;\n std::string Result = DemangledName;\n free(DemangledName);\n return Result;\n#else\n return Name;\n#endif\n}\n\n} \/\/ namespace symbolize\n} \/\/ namespace llvm\n<commit_msg>LLVMSymbolize.cpp: Fix build. Triple::ArchType is not a namespace.<commit_after>\/\/===-- LLVMSymbolize.cpp -------------------------------------------------===\/\/\n\/\/\n\/\/ The LLVM Compiler Infrastructure\n\/\/\n\/\/ This file is distributed under the University of Illinois Open Source\n\/\/ License. See LICENSE.TXT for details.\n\/\/\n\/\/===----------------------------------------------------------------------===\/\/\n\/\/\n\/\/ Implementation for LLVM symbolization library.\n\/\/\n\/\/===----------------------------------------------------------------------===\/\/\n\n#include \"LLVMSymbolize.h\"\n#include \"llvm\/ADT\/STLExtras.h\"\n#include \"llvm\/Object\/MachO.h\"\n#include \"llvm\/Support\/Casting.h\"\n#include \"llvm\/Support\/FileSystem.h\"\n#include \"llvm\/Support\/Path.h\"\n\n#include <sstream>\n\nnamespace llvm {\nnamespace symbolize {\n\nstatic bool error(error_code ec) {\n if (!ec)\n return false;\n errs() << \"LLVMSymbolizer: error reading file: \" << ec.message() << \".\\n\";\n return true;\n}\n\nstatic uint32_t\ngetDILineInfoSpecifierFlags(const LLVMSymbolizer::Options &Opts) {\n uint32_t Flags = llvm::DILineInfoSpecifier::FileLineInfo |\n llvm::DILineInfoSpecifier::AbsoluteFilePath;\n if (Opts.PrintFunctions)\n Flags |= llvm::DILineInfoSpecifier::FunctionName;\n return Flags;\n}\n\nstatic void patchFunctionNameInDILineInfo(const std::string &NewFunctionName,\n DILineInfo &LineInfo) {\n std::string FileName = LineInfo.getFileName();\n LineInfo = DILineInfo(StringRef(FileName), StringRef(NewFunctionName),\n LineInfo.getLine(), LineInfo.getColumn());\n}\n\nModuleInfo::ModuleInfo(ObjectFile *Obj, DIContext *DICtx)\n : Module(Obj), DebugInfoContext(DICtx) {\n error_code ec;\n for (symbol_iterator si = Module->begin_symbols(), se = Module->end_symbols();\n si != se; si.increment(ec)) {\n if (error(ec))\n return;\n SymbolRef::Type SymbolType;\n if (error(si->getType(SymbolType)))\n continue;\n if (SymbolType != SymbolRef::ST_Function &&\n SymbolType != SymbolRef::ST_Data)\n continue;\n uint64_t SymbolAddress;\n if (error(si->getAddress(SymbolAddress)) ||\n SymbolAddress == UnknownAddressOrSize)\n continue;\n uint64_t SymbolSize;\n \/\/ Getting symbol size is linear for Mach-O files, so assume that symbol\n \/\/ occupies the memory range up to the following symbol.\n if (isa<MachOObjectFile>(Obj))\n SymbolSize = 0;\n else if (error(si->getSize(SymbolSize)) ||\n SymbolSize == UnknownAddressOrSize)\n continue;\n StringRef SymbolName;\n if (error(si->getName(SymbolName)))\n continue;\n \/\/ Mach-O symbol table names have leading underscore, skip it.\n if (Module->isMachO() && SymbolName.size() > 0 && SymbolName[0] == '_')\n SymbolName = SymbolName.drop_front();\n \/\/ FIXME: If a function has alias, there are two entries in symbol table\n \/\/ with same address size. Make sure we choose the correct one.\n SymbolMapTy &M = SymbolType == SymbolRef::ST_Function ? Functions : Objects;\n SymbolDesc SD = { SymbolAddress, SymbolSize };\n M.insert(std::make_pair(SD, SymbolName));\n }\n}\n\nbool ModuleInfo::getNameFromSymbolTable(SymbolRef::Type Type, uint64_t Address,\n std::string &Name, uint64_t &Addr,\n uint64_t &Size) const {\n const SymbolMapTy &M = Type == SymbolRef::ST_Function ? Functions : Objects;\n if (M.empty())\n return false;\n SymbolDesc SD = { Address, Address };\n SymbolMapTy::const_iterator it = M.upper_bound(SD);\n if (it == M.begin())\n return false;\n --it;\n if (it->first.Size != 0 && it->first.Addr + it->first.Size <= Address)\n return false;\n Name = it->second.str();\n Addr = it->first.Addr;\n Size = it->first.Size;\n return true;\n}\n\nDILineInfo ModuleInfo::symbolizeCode(\n uint64_t ModuleOffset, const LLVMSymbolizer::Options &Opts) const {\n DILineInfo LineInfo;\n if (DebugInfoContext) {\n LineInfo = DebugInfoContext->getLineInfoForAddress(\n ModuleOffset, getDILineInfoSpecifierFlags(Opts));\n }\n \/\/ Override function name from symbol table if necessary.\n if (Opts.PrintFunctions && Opts.UseSymbolTable) {\n std::string FunctionName;\n uint64_t Start, Size;\n if (getNameFromSymbolTable(SymbolRef::ST_Function, ModuleOffset,\n FunctionName, Start, Size)) {\n patchFunctionNameInDILineInfo(FunctionName, LineInfo);\n }\n }\n return LineInfo;\n}\n\nDIInliningInfo ModuleInfo::symbolizeInlinedCode(\n uint64_t ModuleOffset, const LLVMSymbolizer::Options &Opts) const {\n DIInliningInfo InlinedContext;\n if (DebugInfoContext) {\n InlinedContext = DebugInfoContext->getInliningInfoForAddress(\n ModuleOffset, getDILineInfoSpecifierFlags(Opts));\n }\n \/\/ Make sure there is at least one frame in context.\n if (InlinedContext.getNumberOfFrames() == 0) {\n InlinedContext.addFrame(DILineInfo());\n }\n \/\/ Override the function name in lower frame with name from symbol table.\n if (Opts.PrintFunctions && Opts.UseSymbolTable) {\n DIInliningInfo PatchedInlinedContext;\n for (uint32_t i = 0, n = InlinedContext.getNumberOfFrames(); i < n; i++) {\n DILineInfo LineInfo = InlinedContext.getFrame(i);\n if (i == n - 1) {\n std::string FunctionName;\n uint64_t Start, Size;\n if (getNameFromSymbolTable(SymbolRef::ST_Function, ModuleOffset,\n FunctionName, Start, Size)) {\n patchFunctionNameInDILineInfo(FunctionName, LineInfo);\n }\n }\n PatchedInlinedContext.addFrame(LineInfo);\n }\n InlinedContext = PatchedInlinedContext;\n }\n return InlinedContext;\n}\n\nbool ModuleInfo::symbolizeData(uint64_t ModuleOffset, std::string &Name,\n uint64_t &Start, uint64_t &Size) const {\n return getNameFromSymbolTable(SymbolRef::ST_Data, ModuleOffset, Name, Start,\n Size);\n}\n\nconst char LLVMSymbolizer::kBadString[] = \"??\";\n\nstd::string LLVMSymbolizer::symbolizeCode(const std::string &ModuleName,\n uint64_t ModuleOffset) {\n ModuleInfo *Info = getOrCreateModuleInfo(ModuleName);\n if (Info == 0)\n return printDILineInfo(DILineInfo());\n if (Opts.PrintInlining) {\n DIInliningInfo InlinedContext =\n Info->symbolizeInlinedCode(ModuleOffset, Opts);\n uint32_t FramesNum = InlinedContext.getNumberOfFrames();\n assert(FramesNum > 0);\n std::string Result;\n for (uint32_t i = 0; i < FramesNum; i++) {\n DILineInfo LineInfo = InlinedContext.getFrame(i);\n Result += printDILineInfo(LineInfo);\n }\n return Result;\n }\n DILineInfo LineInfo = Info->symbolizeCode(ModuleOffset, Opts);\n return printDILineInfo(LineInfo);\n}\n\nstd::string LLVMSymbolizer::symbolizeData(const std::string &ModuleName,\n uint64_t ModuleOffset) {\n std::string Name = kBadString;\n uint64_t Start = 0;\n uint64_t Size = 0;\n if (Opts.UseSymbolTable) {\n if (ModuleInfo *Info = getOrCreateModuleInfo(ModuleName)) {\n if (Info->symbolizeData(ModuleOffset, Name, Start, Size) && Opts.Demangle)\n Name = DemangleName(Name);\n }\n }\n std::stringstream ss;\n ss << Name << \"\\n\" << Start << \" \" << Size << \"\\n\";\n return ss.str();\n}\n\nvoid LLVMSymbolizer::flush() {\n DeleteContainerSeconds(Modules);\n DeleteContainerPointers(ParsedBinariesAndObjects);\n BinaryForPath.clear();\n ObjectFileForArch.clear();\n}\n\nstatic std::string getDarwinDWARFResourceForPath(const std::string &Path) {\n StringRef Basename = sys::path::filename(Path);\n const std::string &DSymDirectory = Path + \".dSYM\";\n SmallString<16> ResourceName = StringRef(DSymDirectory);\n sys::path::append(ResourceName, \"Contents\", \"Resources\", \"DWARF\");\n sys::path::append(ResourceName, Basename);\n return ResourceName.str();\n}\n\nLLVMSymbolizer::BinaryPair\nLLVMSymbolizer::getOrCreateBinary(const std::string &Path) {\n BinaryMapTy::iterator I = BinaryForPath.find(Path);\n if (I != BinaryForPath.end())\n return I->second;\n Binary *Bin = 0;\n Binary *DbgBin = 0;\n OwningPtr<Binary> ParsedBinary;\n OwningPtr<Binary> ParsedDbgBinary;\n if (!error(createBinary(Path, ParsedBinary))) {\n \/\/ Check if it's a universal binary.\n Bin = ParsedBinary.take();\n ParsedBinariesAndObjects.push_back(Bin);\n if (Bin->isMachO() || Bin->isMachOUniversalBinary()) {\n \/\/ On Darwin we may find DWARF in separate object file in\n \/\/ resource directory.\n const std::string &ResourcePath =\n getDarwinDWARFResourceForPath(Path);\n bool ResourceFileExists = false;\n if (!sys::fs::exists(ResourcePath, ResourceFileExists) &&\n ResourceFileExists &&\n !error(createBinary(ResourcePath, ParsedDbgBinary))) {\n DbgBin = ParsedDbgBinary.take();\n ParsedBinariesAndObjects.push_back(DbgBin);\n }\n }\n }\n if (DbgBin == 0)\n DbgBin = Bin;\n BinaryPair Res = std::make_pair(Bin, DbgBin);\n BinaryForPath[Path] = Res;\n return Res;\n}\n\nObjectFile *\nLLVMSymbolizer::getObjectFileFromBinary(Binary *Bin, const std::string &ArchName) {\n if (Bin == 0)\n return 0;\n ObjectFile *Res = 0;\n if (MachOUniversalBinary *UB = dyn_cast<MachOUniversalBinary>(Bin)) {\n ObjectFileForArchMapTy::iterator I = ObjectFileForArch.find(\n std::make_pair(UB, ArchName));\n if (I != ObjectFileForArch.end())\n return I->second;\n OwningPtr<ObjectFile> ParsedObj;\n if (!UB->getObjectForArch(Triple(ArchName).getArch(), ParsedObj)) {\n Res = ParsedObj.take();\n ParsedBinariesAndObjects.push_back(Res);\n }\n ObjectFileForArch[std::make_pair(UB, ArchName)] = Res;\n } else if (Bin->isObject()) {\n Res = cast<ObjectFile>(Bin);\n }\n return Res;\n}\n\nModuleInfo *\nLLVMSymbolizer::getOrCreateModuleInfo(const std::string &ModuleName) {\n ModuleMapTy::iterator I = Modules.find(ModuleName);\n if (I != Modules.end())\n return I->second;\n std::string BinaryName = ModuleName;\n std::string ArchName = Opts.DefaultArch;\n size_t ColonPos = ModuleName.find_last_of(':');\n \/\/ Verify that substring after colon form a valid arch name.\n if (ColonPos != std::string::npos) {\n std::string ArchStr = ModuleName.substr(ColonPos + 1);\n if (Triple(ArchStr).getArch() != Triple::UnknownArch) {\n BinaryName = ModuleName.substr(0, ColonPos);\n ArchName = ArchStr;\n }\n }\n BinaryPair Binaries = getOrCreateBinary(BinaryName);\n ObjectFile *Obj = getObjectFileFromBinary(Binaries.first, ArchName);\n ObjectFile *DbgObj = getObjectFileFromBinary(Binaries.second, ArchName);\n\n if (Obj == 0) {\n \/\/ Failed to find valid object file.\n Modules.insert(make_pair(ModuleName, (ModuleInfo *)0));\n return 0;\n }\n DIContext *Context = DIContext::getDWARFContext(DbgObj);\n assert(Context);\n ModuleInfo *Info = new ModuleInfo(Obj, Context);\n Modules.insert(make_pair(ModuleName, Info));\n return Info;\n}\n\nstd::string LLVMSymbolizer::printDILineInfo(DILineInfo LineInfo) const {\n \/\/ By default, DILineInfo contains \"<invalid>\" for function\/filename it\n \/\/ cannot fetch. We replace it to \"??\" to make our output closer to addr2line.\n static const std::string kDILineInfoBadString = \"<invalid>\";\n std::stringstream Result;\n if (Opts.PrintFunctions) {\n std::string FunctionName = LineInfo.getFunctionName();\n if (FunctionName == kDILineInfoBadString)\n FunctionName = kBadString;\n else if (Opts.Demangle)\n FunctionName = DemangleName(FunctionName);\n Result << FunctionName << \"\\n\";\n }\n std::string Filename = LineInfo.getFileName();\n if (Filename == kDILineInfoBadString)\n Filename = kBadString;\n Result << Filename << \":\" << LineInfo.getLine() << \":\" << LineInfo.getColumn()\n << \"\\n\";\n return Result.str();\n}\n\n#if !defined(_MSC_VER)\n\/\/ Assume that __cxa_demangle is provided by libcxxabi (except for Windows).\nextern \"C\" char *__cxa_demangle(const char *mangled_name, char *output_buffer,\n size_t *length, int *status);\n#endif\n\nstd::string LLVMSymbolizer::DemangleName(const std::string &Name) {\n#if !defined(_MSC_VER)\n int status = 0;\n char *DemangledName = __cxa_demangle(Name.c_str(), 0, 0, &status);\n if (status != 0)\n return Name;\n std::string Result = DemangledName;\n free(DemangledName);\n return Result;\n#else\n return Name;\n#endif\n}\n\n} \/\/ namespace symbolize\n} \/\/ namespace llvm\n<|endoftext|>"} {"text":"<commit_before>\/\/ 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 \"burg.hpp\"\n\n#include <algorithm>\n#include <cassert>\n#include <iostream>\n#include <iterator>\n#include <vector>\n\n\/\/ Test zohar_linear_solve routine against an Octave-provided reference\nint main(int argc, char *argv[])\n{\n using namespace std;\n\n vector<double> a;\n a.push_back( 2);\n a.push_back( 3);\n a.push_back( 5);\n a.push_back( 7);\n a.push_back(11);\n a.push_back(13);\n a.push_back(17);\n\n cout << \"Topmost row of Toeplitz matrix is: \\n\\t1 \";\n copy(a.begin(), a.end(), ostream_iterator<double>(cout,\" \"));\n cout << endl;\n\n vector<double> r;\n r.push_back( 2);\n r.push_back( 4);\n r.push_back( 8);\n r.push_back( 16);\n r.push_back( 32);\n r.push_back( 64);\n r.push_back(128);\n\n assert(a.size() == r.size());\n\n cout << \"Leftmost column of Toeplitz matrix is: \\n\\t1 \";\n copy(r.begin(), r.end(), ostream_iterator<double>(cout,\" \"));\n cout << endl;\n\n vector<double> d;\n d.push_back(1);\n d.push_back(2);\n d.push_back(3);\n d.push_back(4);\n d.push_back(5);\n d.push_back(6);\n d.push_back(7);\n d.push_back(8);\n\n assert(d.size() == a.size() + 1);\n\n cout << \"Right hand size data is:\\n\\t\";\n copy(d.begin(), d.end(), ostream_iterator<double>(cout,\" \"));\n cout << endl;\n\n vector<double> exp;\n exp.push_back(-17.\/27);\n exp.push_back( 4.\/27);\n exp.push_back( 32.\/ 9);\n exp.push_back(- 5.\/ 3);\n exp.push_back( 0. );\n exp.push_back(- 2. );\n exp.push_back(- 1. );\n exp.push_back( 2. );\n\n assert(exp.size() == d.size());\n\n cout << \"Expected solution is:\\n\\t\";\n copy(exp.begin(), exp.end(), ostream_iterator<double>(cout,\" \"));\n cout << endl;\n\n cout << \"Solution computed by zohar_linear_solve is:\\n\\t\";\n zohar_linear_solve(a.begin(), a.end(), r.begin(), d.begin());\n copy(d.begin(), d.end(), ostream_iterator<double>(cout,\" \"));\n cout << endl;\n\n vector<double> err(exp.size());\n for (size_t i = 0; i < err.size(); ++i) {\n err[i] = exp[i] - d[i];\n }\n\n cout << \"Term-by-term errors are:\\n\\t\";\n copy(err.begin(), err.end(), ostream_iterator<double>(cout,\" \"));\n cout << endl;\n\n double sserr = 0;\n for (size_t i = 0; i < exp.size(); ++i) {\n sserr += err[i]*err[i];\n }\n cout << \"Sum of the squared errors is:\\n\\t\" << sserr << endl;\n\n return 0;\n}\n<commit_msg>change the error display metric<commit_after>\/\/ 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 \"burg.hpp\"\n\n#include <algorithm>\n#include <cassert>\n#include <cmath>\n#include <iostream>\n#include <iterator>\n#include <vector>\n\n\/\/ Test zohar_linear_solve routine against an Octave-provided reference\nint main(int argc, char *argv[])\n{\n using namespace std;\n\n vector<double> a;\n a.push_back( 2);\n a.push_back( 3);\n a.push_back( 5);\n a.push_back( 7);\n a.push_back(11);\n a.push_back(13);\n a.push_back(17);\n\n cout << \"Topmost row of Toeplitz matrix is: \\n\\t1 \";\n copy(a.begin(), a.end(), ostream_iterator<double>(cout,\" \"));\n cout << endl;\n\n vector<double> r;\n r.push_back( 2);\n r.push_back( 4);\n r.push_back( 8);\n r.push_back( 16);\n r.push_back( 32);\n r.push_back( 64);\n r.push_back(128);\n\n assert(a.size() == r.size());\n\n cout << \"Leftmost column of Toeplitz matrix is: \\n\\t1 \";\n copy(r.begin(), r.end(), ostream_iterator<double>(cout,\" \"));\n cout << endl;\n\n vector<double> d;\n d.push_back(1);\n d.push_back(2);\n d.push_back(3);\n d.push_back(4);\n d.push_back(5);\n d.push_back(6);\n d.push_back(7);\n d.push_back(8);\n\n assert(d.size() == a.size() + 1);\n\n cout << \"Right hand size data is:\\n\\t\";\n copy(d.begin(), d.end(), ostream_iterator<double>(cout,\" \"));\n cout << endl;\n\n vector<double> exp;\n exp.push_back(-17.\/27);\n exp.push_back( 4.\/27);\n exp.push_back( 32.\/ 9);\n exp.push_back(- 5.\/ 3);\n exp.push_back( 0. );\n exp.push_back(- 2. );\n exp.push_back(- 1. );\n exp.push_back( 2. );\n\n assert(exp.size() == d.size());\n\n cout << \"Expected solution is:\\n\\t\";\n copy(exp.begin(), exp.end(), ostream_iterator<double>(cout,\" \"));\n cout << endl;\n\n cout << \"Solution computed by zohar_linear_solve is:\\n\\t\";\n zohar_linear_solve(a.begin(), a.end(), r.begin(), d.begin());\n copy(d.begin(), d.end(), ostream_iterator<double>(cout,\" \"));\n cout << endl;\n\n vector<double> err(exp.size());\n for (size_t i = 0; i < err.size(); ++i) {\n err[i] = exp[i] - d[i];\n }\n\n cout << \"Term-by-term errors are:\\n\\t\";\n copy(err.begin(), err.end(), ostream_iterator<double>(cout,\" \"));\n cout << endl;\n\n double abserr = 0;\n for (size_t i = 0; i < exp.size(); ++i) abserr += std::abs(err[i]);\n cout << \"Sum of the absolute errors is:\\n\\t\" << abserr << endl;\n\n return 0;\n}\n<|endoftext|>"} {"text":"<commit_before>#include \"bvsd.h\"\n\n\/** Main function, creates interactive loop. *\/\nint main(const int argc, const char** argv)\n{\n\tsignal(SIGINT, mainSignal);\n\tsignal(SIGSEGV, mainSignal);\n\tsignal(SIGALRM, mainSignal);\n\n\tbvs = new BVS::BVS(argc, argv, &shutdownFunction);\n\n\tLOG(2, \"loading modules!\");\n\tbvs->loadModules();\n\n\tLOG(2, \"connecting modules!\");\n\tbvs->connectAllModules();\n\n\tLOG(2, \"starting!\");\n\tbvs->start();\n\n\tbvs->run();\n\n\tstd::string input;\n\twhile (true)\n\t{\n\t\tstd::getline(std::cin, input);\n\t\tif (std::cin.eof()) input = \"q\";\n\n\t\tif (input == \"r\" || input == \"run\" || input == \"c\" || input == \"continue\")\n\t\t{\n\t\t\tLOG(2, \"RUN!!!\");\n\t\t\tbvs->run();\n\t\t}\n\t\telse if (input.empty() || input == \"s\" || input == \"step\")\n\t\t{\n\t\t\tLOG(2, \"STEP!!!\");\n\t\t\tbvs->step();\n\t\t}\n\t\telse if (input == \"p\" || input == \"pause\")\n\t\t{\n\t\t\tLOG(2, \"PAUSING!!!\");\n\t\t\tbvs->pause();\n\t\t}\n\t\telse if (input.substr(0,2) == \"hs\" || input.substr(0, 7) == \"hotswap\")\n\t\t{\n\t\t\tsize_t delimiter = input.find_first_of(\" \");\n\t\t\tinput.erase(0, delimiter+1);\n\t\t\tif (input.empty() || delimiter==std::string::npos) std::cout << \"ERROR: no module ID given!\" << std::endl;\n\t\t\telse bvs->hotSwap(input);\n\t\t}\n\t\telse if (input == \"q\" || input == \"quit\")\n\t\t{\n\t\t\tLOG(2, \"quitting...\");\n\t\t\tbvs->quit();\n\t\t\tLOG(2, \"finished!\");\n\t\t\tbreak;\n\t\t}\n\t\telse if (input == \"h\" || input == \"help\")\n\t\t{\n\t\t\tstd::cout << \"usage:\" << std::endl;\n\t\t\tstd::cout << \" r|run run system until paused\" << std::endl;\n\t\t\tstd::cout << \" c|continue same as run\" << std::endl;\n\t\t\tstd::cout << \" s|step advance system by one step\" << std::endl;\n\t\t\tstd::cout << \" p|pause pause(stop) system\" << std::endl;\n\t\t\tstd::cout << \" hs|hotswap <arg> HotSwap(TM) <moduleID>\" << std::endl;\n\t\t\tstd::cout << \" q|quit shutdown system and quit\" << std::endl;\n\t\t\tstd::cout << \" h|help show help\" << std::endl;\n\t\t}\n\t\telse\n\t\t{\n\t\t\tstd::cout << \">>> unknown command: \" << input << std::endl << \">>> for help press 'h<enter>'!\" << std::endl;\n\t\t}\n\t}\n\n\tdelete bvs;\n\n\treturn 0;\n}\n\n\n\nvoid mainSignal(int sig)\n{\n\tswitch (sig)\n\t{\n\t\tcase SIGINT:\n\t\t\tLOG(2, \"Caught 'Ctrl-C', quitting!\");\n\t\t\tbreak;\n\t\tcase SIGSEGV:\n\t\t\tLOG(2, \"Caught segmentation fault...!\");\n\t\t\tvoid *msgs[100];\n\t\t\tsize_t size;\n\t\t\tsize = backtrace(msgs, 100);\n\t\t\tfprintf(stderr, \"\\n\\n\\nCaught signal %d (%s)!\\n\\n\", sig, strsignal(sig));\n\t\t\tchar** messages;\n\t\t\tmessages = backtrace_symbols(msgs, size);\n\t\t\tfor (size_t i=2; i < size && messages != NULL; ++i)\n\t\t\t\tfprintf(stderr, \"[bt]: (%lu) %s\\n\", i-2, messages[i]);\n\t\t\tfree(messages);\n\t\t\tbreak;\n\t\tcase SIGALRM:\n\t\t\tLOG(2, \"Shutdown requested, quitting!\");\n\t\t\tbreak;\n\t}\n\n\tif (sig==SIGSEGV)\n\t{\n\t\tsignal(SIGSEGV, SIG_DFL);\n\t\traise(SIGSEGV);\n\t}\n\telse\n\t{\n\t\t\/\/ TODO: BUG, causes system to hang, probably because it waits for some thread to join, investigate!\n\t\tbvs->quit();\n\t\tdelete bvs;\n\t\texit(EXIT_FAILURE);\n\t}\n}\n\n\n\nvoid shutdownFunction()\n{\n\tLOG(1,\"daemon exit caused by bvs shutdown request!\");\n\tbvs->quit();\n\talarm(1); \/\/ SIGALRM after 1 second so all framework\/module threads have a chance to quit\n}\n\n<commit_msg>daemon: disable shutdown function for now<commit_after>#include \"bvsd.h\"\n\n\/** Main function, creates interactive loop. *\/\nint main(const int argc, const char** argv)\n{\n\tsignal(SIGINT, mainSignal);\n\tsignal(SIGSEGV, mainSignal);\n\tsignal(SIGALRM, mainSignal);\n\n\t\/\/bvs = new BVS::BVS(argc, argv, &shutdownFunction); \/\/ TODO: disable shutdown function for now, also see mainSignal\n\tbvs = new BVS::BVS(argc, argv);\n\n\tLOG(2, \"loading modules!\");\n\tbvs->loadModules();\n\n\tLOG(2, \"connecting modules!\");\n\tbvs->connectAllModules();\n\n\tLOG(2, \"starting!\");\n\tbvs->start();\n\n\tbvs->run();\n\n\tstd::string input;\n\twhile (true)\n\t{\n\t\tstd::getline(std::cin, input);\n\t\tif (std::cin.eof()) input = \"q\";\n\n\t\tif (input == \"r\" || input == \"run\" || input == \"c\" || input == \"continue\")\n\t\t{\n\t\t\tLOG(2, \"RUN!!!\");\n\t\t\tbvs->run();\n\t\t}\n\t\telse if (input.empty() || input == \"s\" || input == \"step\")\n\t\t{\n\t\t\tLOG(2, \"STEP!!!\");\n\t\t\tbvs->step();\n\t\t}\n\t\telse if (input == \"p\" || input == \"pause\")\n\t\t{\n\t\t\tLOG(2, \"PAUSING!!!\");\n\t\t\tbvs->pause();\n\t\t}\n\t\telse if (input.substr(0,2) == \"hs\" || input.substr(0, 7) == \"hotswap\")\n\t\t{\n\t\t\tsize_t delimiter = input.find_first_of(\" \");\n\t\t\tinput.erase(0, delimiter+1);\n\t\t\tif (input.empty() || delimiter==std::string::npos) std::cout << \"ERROR: no module ID given!\" << std::endl;\n\t\t\telse bvs->hotSwap(input);\n\t\t}\n\t\telse if (input == \"q\" || input == \"quit\")\n\t\t{\n\t\t\tLOG(2, \"quitting...\");\n\t\t\tbvs->quit();\n\t\t\tLOG(2, \"finished!\");\n\t\t\tbreak;\n\t\t}\n\t\telse if (input == \"h\" || input == \"help\")\n\t\t{\n\t\t\tstd::cout << \"usage:\" << std::endl;\n\t\t\tstd::cout << \" r|run run system until paused\" << std::endl;\n\t\t\tstd::cout << \" c|continue same as run\" << std::endl;\n\t\t\tstd::cout << \" s|step advance system by one step\" << std::endl;\n\t\t\tstd::cout << \" p|pause pause(stop) system\" << std::endl;\n\t\t\tstd::cout << \" hs|hotswap <arg> HotSwap(TM) <moduleID>\" << std::endl;\n\t\t\tstd::cout << \" q|quit shutdown system and quit\" << std::endl;\n\t\t\tstd::cout << \" h|help show help\" << std::endl;\n\t\t}\n\t\telse\n\t\t{\n\t\t\tstd::cout << \">>> unknown command: \" << input << std::endl << \">>> for help press 'h<enter>'!\" << std::endl;\n\t\t}\n\t}\n\n\tdelete bvs;\n\n\treturn 0;\n}\n\n\n\nvoid mainSignal(int sig)\n{\n\tswitch (sig)\n\t{\n\t\tcase SIGINT:\n\t\t\tLOG(2, \"Caught 'Ctrl-C', quitting!\");\n\t\t\tbreak;\n\t\tcase SIGSEGV:\n\t\t\tLOG(2, \"Caught segmentation fault...!\");\n\t\t\tvoid *msgs[100];\n\t\t\tsize_t size;\n\t\t\tsize = backtrace(msgs, 100);\n\t\t\tfprintf(stderr, \"\\n\\n\\nCaught signal %d (%s)!\\n\\n\", sig, strsignal(sig));\n\t\t\tchar** messages;\n\t\t\tmessages = backtrace_symbols(msgs, size);\n\t\t\tfor (size_t i=2; i < size && messages != NULL; ++i)\n\t\t\t\tfprintf(stderr, \"[bt]: (%lu) %s\\n\", i-2, messages[i]);\n\t\t\tfree(messages);\n\t\t\tbreak;\n\t\tcase SIGALRM:\n\t\t\tLOG(2, \"Shutdown requested, quitting!\");\n\t\t\tbreak;\n\t}\n\n\tif (sig==SIGSEGV)\n\t{\n\t\tsignal(SIGSEGV, SIG_DFL);\n\t\traise(SIGSEGV);\n\t}\n\telse\n\t{\n\t\t\/\/ TODO: BUG, causes system to hang, probably because it waits for some thread to join, investigate!\n\t\tbvs->quit();\n\t\tdelete bvs;\n\t\texit(EXIT_FAILURE);\n\t}\n}\n\n\n\nvoid shutdownFunction()\n{\n\tLOG(1,\"daemon exit caused by bvs shutdown request!\");\n\tbvs->quit();\n\talarm(1); \/\/ SIGALRM after 1 second so all framework\/module threads have a chance to quit\n}\n\n<|endoftext|>"} {"text":"<commit_before>#include <sigma\/util\/filesystem.hpp>\n\n#include <filesystem>\n\nnamespace sigma {\nnamespace filesystem {\n bool contains_file(std::filesystem::path directory, std::filesystem::path file)\n {\n auto dbegin = directory.begin();\n auto dend = directory.end();\n auto fbegin = file.begin();\n auto fend = file.end();\n\n auto directory_size = std::distance(dbegin, dend);\n auto file_size = std::distance(fbegin, fend);\n if (directory_size > file_size)\n return false;\n\n return std::equal(dbegin, dend, fbegin);\n }\n\n std::filesystem::path make_relative(std::filesystem::path directory, std::filesystem::path file)\n {\n auto dbegin = directory.begin();\n auto fbegin = file.begin();\n auto fend = file.end();\n\n while (*dbegin == *fbegin) {\n dbegin++;\n fbegin++;\n }\n std::filesystem::path output;\n do {\n output = output \/ (*fbegin).string();\n fbegin++;\n } while (fbegin != fend);\n return output;\n }\n\n bool is_hidden(const std::filesystem::path& path)\n {\n auto name = path.filename().string();\n return !name.empty() && name != \"..\" && name != \".\" && name[0] == '.';\n }\n}\n}\n<commit_msg>Bye bye boost part1.5<commit_after>#include <sigma\/util\/filesystem.hpp>\n\n#include <filesystem>\n\nnamespace sigma {\nnamespace filesystem {\n bool contains_file(std::filesystem::path directory, std::filesystem::path file)\n {\n auto dbegin = directory.begin();\n auto dend = directory.end();\n auto fbegin = file.begin();\n auto fend = file.end();\n\n auto directory_size = std::distance(dbegin, dend);\n auto file_size = std::distance(fbegin, fend);\n if (directory_size > file_size)\n return false;\n\n return std::equal(dbegin, dend, fbegin);\n }\n\n std::filesystem::path make_relative(std::filesystem::path directory, std::filesystem::path file)\n {\n auto dbegin = directory.begin();\n auto dend = directory.end();\n auto fbegin = file.begin();\n auto fend = file.end();\n\n while (dbegin != dend && fbegin != fend && *dbegin == *fbegin) {\n dbegin++;\n fbegin++;\n }\n std::filesystem::path output;\n do {\n output = output \/ (*fbegin).string();\n fbegin++;\n } while (fbegin != fend);\n return output;\n }\n\n bool is_hidden(const std::filesystem::path& path)\n {\n auto name = path.filename().string();\n return !name.empty() && name != \"..\" && name != \".\" && name[0] == '.';\n }\n}\n}\n<|endoftext|>"} {"text":"<commit_before>\/*************************************************************************\n *\n * $RCSfile: svgcom.hxx,v $\n *\n * $Revision: 1.2 $\n *\n * last change: $Author: ka $ $Date: 2001-03-22 17:49: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 _SVGCOM_HXX\n#define _SVGCOM_HXX\n\n#ifndef _CPPUHELPER_WEAK_HXX_\n#include <cppuhelper\/weak.hxx>\n#endif\n#ifndef __RTL_USTRING_\n#include <rtl\/ustring>\n#endif\n#ifndef _DEBUG_HXX\n#include <tools\/debug.hxx>\n#endif\n#ifndef _STREAM_HXX\n#include <tools\/stream.hxx>\n#endif\n#ifndef _STRING_HXX\n#include <tools\/string.hxx>\n#endif\n#ifndef _URLOBJ_HXX\n#include <tools\/urlobj.hxx>\n#endif\n#ifndef _STACK_HXX\n#include <tools\/stack.hxx>\n#endif\n#ifndef _SALBTYPE_HXX\n#include <vcl\/salbtype.hxx>\n#endif\n#ifndef _GDIMTF_HXX\n#include <vcl\/gdimtf.hxx>\n#endif\n#ifndef _METAACT_HXX\n#include <vcl\/metaact.hxx>\n#endif\n\n#include <com\/sun\/star\/uno\/Reference.h>\n#include <com\/sun\/star\/uno\/RuntimeException.hpp>\n#include <com\/sun\/star\/lang\/XMultiServiceFactory.hpp>\n#include <com\/sun\/star\/lang\/XComponent.hpp>\n#include <com\/sun\/star\/registry\/XRegistryKey.hpp>\n#include <com\/sun\/star\/lang\/XComponent.hpp>\n#include <com\/sun\/star\/io\/XInputStream.hpp>\n#include <com\/sun\/star\/io\/XOutputStream.hpp>\n#include <com\/sun\/star\/xml\/sax\/XDocumentHandler.hpp>\n#include <com\/sun\/star\/xml\/sax\/XExtendedDocumentHandler.hpp>\n#include <com\/sun\/star\/svg\/XSVGWriter.hpp>\n#include <com\/sun\/star\/svg\/XSVGPrinter.hpp>\n\n#ifndef _XMLOFF_XMLEXP_HXX\n#include <xmloff\/xmlexp.hxx>\n#endif\n#ifndef _XMLOFF_NMSPMAP_HXX\n#include <xmloff\/nmspmap.hxx>\n#endif\n\n\/\/ -----------------------------------------------------------------------------\n\n#define NMSP_CPPU cppu\n#define NMSP_RTL rtl\n#define NMSP_UNO com::sun::star::uno\n#define NMSP_LANG com::sun::star::lang\n#define NMSP_SAX com::sun::star::xml::sax\n#define NMSP_SVG com::sun::star::svg\n#define NMSP_REGISTRY com::sun::star::registry\n\n\n#define REF( _def_Obj ) NMSP_UNO::Reference< _def_Obj >\n#define SEQ( _def_Obj ) NMSP_UNO::Sequence< _def_Obj >\n#define ANY NMSP_UNO::Any\n#define B2UCONST( _def_pChar ) (NMSP_RTL::OUString(RTL_CONSTASCII_USTRINGPARAM(_def_pChar )))\n#define SVG_DTD_STRING B2UCONST( \"<!DOCTYPE svg PUBLIC \\\"-\/\/W3C\/\/DTD SVG 20001102\/\/EN\\\" \\\"http:\/\/www.w3.org\/TR\/2000\/CR-SVG-20001102\/DTD\/svg-20001102.dtd\\\">\" )\n\n#endif \/\/ _SYNCCOM_HXX\n<commit_msg>#95043#: update to the latest DTD<commit_after>\/*************************************************************************\n *\n * $RCSfile: svgcom.hxx,v $\n *\n * $Revision: 1.3 $\n *\n * last change: $Author: ka $ $Date: 2001-11-21 12:28:09 $\n *\n * The Contents of this file are made available subject to the terms of\n * either of the following licenses\n *\n * - GNU Lesser General Public License Version 2.1\n * - Sun Industry Standards Source License Version 1.1\n *\n * Sun Microsystems Inc., October, 2000\n *\n * GNU Lesser General Public License Version 2.1\n * =============================================\n * Copyright 2000 by Sun Microsystems, Inc.\n * 901 San Antonio Road, Palo Alto, CA 94303, USA\n *\n * This library is free software; you can redistribute it and\/or\n * modify it under the terms of the GNU Lesser General Public\n * License version 2.1, as published by the Free Software Foundation.\n *\n * This library is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU\n * Lesser General Public License for more details.\n *\n * You should have received a copy of the GNU Lesser General Public\n * License along with this library; if not, write to the Free Software\n * Foundation, Inc., 59 Temple Place, Suite 330, Boston,\n * MA 02111-1307 USA\n *\n *\n * Sun Industry Standards Source License Version 1.1\n * =================================================\n * The contents of this file are subject to the Sun Industry Standards\n * Source License Version 1.1 (the \"License\"); You may not use this file\n * except in compliance with the License. You may obtain a copy of the\n * License at http:\/\/www.openoffice.org\/license.html.\n *\n * Software provided under this License is provided on an \"AS IS\" basis,\n * WITHOUT WARRANTY OF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING,\n * WITHOUT LIMITATION, WARRANTIES THAT THE SOFTWARE IS FREE OF DEFECTS,\n * MERCHANTABLE, FIT FOR A PARTICULAR PURPOSE, OR NON-INFRINGING.\n * See the License for the specific provisions governing your rights and\n * obligations concerning the Software.\n *\n * The Initial Developer of the Original Code is: Sun Microsystems, Inc.\n *\n * Copyright: 2000 by Sun Microsystems, Inc.\n *\n * All Rights Reserved.\n *\n * Contributor(s): _______________________________________\n *\n *\n ************************************************************************\/\n\n#ifndef _SVGCOM_HXX\n#define _SVGCOM_HXX\n\n#ifndef _CPPUHELPER_WEAK_HXX_\n#include <cppuhelper\/weak.hxx>\n#endif\n#ifndef __RTL_USTRING_\n#include <rtl\/ustring>\n#endif\n#ifndef _DEBUG_HXX\n#include <tools\/debug.hxx>\n#endif\n#ifndef _STREAM_HXX\n#include <tools\/stream.hxx>\n#endif\n#ifndef _STRING_HXX\n#include <tools\/string.hxx>\n#endif\n#ifndef _URLOBJ_HXX\n#include <tools\/urlobj.hxx>\n#endif\n#ifndef _STACK_HXX\n#include <tools\/stack.hxx>\n#endif\n#ifndef _SALBTYPE_HXX\n#include <vcl\/salbtype.hxx>\n#endif\n#ifndef _GDIMTF_HXX\n#include <vcl\/gdimtf.hxx>\n#endif\n#ifndef _METAACT_HXX\n#include <vcl\/metaact.hxx>\n#endif\n\n#include <com\/sun\/star\/uno\/Reference.h>\n#include <com\/sun\/star\/uno\/RuntimeException.hpp>\n#include <com\/sun\/star\/lang\/XMultiServiceFactory.hpp>\n#include <com\/sun\/star\/lang\/XComponent.hpp>\n#include <com\/sun\/star\/registry\/XRegistryKey.hpp>\n#include <com\/sun\/star\/lang\/XComponent.hpp>\n#include <com\/sun\/star\/io\/XInputStream.hpp>\n#include <com\/sun\/star\/io\/XOutputStream.hpp>\n#include <com\/sun\/star\/xml\/sax\/XDocumentHandler.hpp>\n#include <com\/sun\/star\/xml\/sax\/XExtendedDocumentHandler.hpp>\n#include <com\/sun\/star\/svg\/XSVGWriter.hpp>\n#include <com\/sun\/star\/svg\/XSVGPrinter.hpp>\n\n#ifndef _XMLOFF_XMLEXP_HXX\n#include <xmloff\/xmlexp.hxx>\n#endif\n#ifndef _XMLOFF_NMSPMAP_HXX\n#include <xmloff\/nmspmap.hxx>\n#endif\n\n\/\/ -----------------------------------------------------------------------------\n\n#define NMSP_CPPU cppu\n#define NMSP_RTL rtl\n#define NMSP_UNO com::sun::star::uno\n#define NMSP_LANG com::sun::star::lang\n#define NMSP_SAX com::sun::star::xml::sax\n#define NMSP_SVG com::sun::star::svg\n#define NMSP_REGISTRY com::sun::star::registry\n\n\n#define REF( _def_Obj ) NMSP_UNO::Reference< _def_Obj >\n#define SEQ( _def_Obj ) NMSP_UNO::Sequence< _def_Obj >\n#define ANY NMSP_UNO::Any\n#define B2UCONST( _def_pChar ) (NMSP_RTL::OUString(RTL_CONSTASCII_USTRINGPARAM(_def_pChar )))\n#define SVG_DTD_STRING B2UCONST( \"<!DOCTYPE svg PUBLIC \\\"-\/\/W3C\/\/DTD SVG 1.0\/\/EN\\\" \\\"http:\/\/www.w3.org\/TR\/2001\/REC-SVG-20010904\/DTD\/svg10.dtd\\\">\" )\n\n#endif \/\/ _SYNCCOM_HXX\n<|endoftext|>"} {"text":"<commit_before>#include \"SlitherlinkDatabase.h\"\r\n#include \"SlitherlinkDatabaseMethod.hpp\"\r\n#include \"..\/common\/SolverConstant.h\"\r\n\r\nnamespace Penciloid\r\n{\r\nint *SlitherlinkDatabase::database = nullptr;\r\nconst int SlitherlinkDatabase::DATABASE_DX[] = { -2, -2, -1, -1, -1, 0, 0, 1, 1, 1, 2, 2 };\r\nconst int SlitherlinkDatabase::DATABASE_DY[] = { -1, 1, -2, 0, 2, -1, 1, -2, 0, 2, -1, 1 };\r\n\r\nvoid SlitherlinkDatabase::CreateDatabase()\r\n{\r\n\tconst int pow3[] = { 1, 3, 9, 27, 81, 243, 729, 2187, 6561, 19683, 59049, 177147, 531441 };\r\n\r\n\tReleaseDatabase();\r\n\tdatabase = new int[pow3[12] * 4];\r\n\r\n\tint styles[12];\r\n\r\n\tfor (int hint = 0; hint <= 3; ++hint) {\r\n\t\tfor (int id = pow3[12] - 1; id >= 0; --id) {\r\n\t\t\tint tmp = id;\r\n\t\t\tint undecided_pos = -1;\r\n\r\n\t\t\tfor (int i = 0; i < 12; ++i) {\r\n\t\t\t\tstyles[i] = tmp % 3;\r\n\t\t\t\ttmp \/= 3;\r\n\r\n\t\t\t\tif (styles[i] == 0) undecided_pos = i;\r\n\t\t\t}\r\n\r\n\t\t\tif (undecided_pos == -1) {\r\n\t\t\t\tbool consistency = true;\r\n\r\n\t\t\t\tif (8 - (styles[3] + styles[5] + styles[6] + styles[8]) != hint) {\r\n\t\t\t\t\tconsistency = false;\r\n\t\t\t\t}\r\n\r\n\t\t\t\ttmp = 8 - (styles[0] + styles[2] + styles[3] + styles[5]);\r\n\t\t\t\tif (tmp != 0 && tmp != 2) consistency = false;\r\n\t\t\t\ttmp = 8 - (styles[1] + styles[3] + styles[4] + styles[6]);\r\n\t\t\t\tif (tmp != 0 && tmp != 2) consistency = false;\r\n\t\t\t\ttmp = 8 - (styles[5] + styles[7] + styles[8] + styles[10]);\r\n\t\t\t\tif (tmp != 0 && tmp != 2) consistency = false;\r\n\t\t\t\ttmp = 8 - (styles[6] + styles[8] + styles[9] + styles[11]);\r\n\t\t\t\tif (tmp != 0 && tmp != 2) consistency = false;\r\n\r\n\t\t\t\tif (consistency) {\r\n\t\t\t\t\tint tmp = 0;\r\n\t\t\t\t\tfor (int i = 0; i < 12; ++i) tmp |= styles[i] << (2 * i);\r\n\t\t\t\t\tdatabase[hint * pow3[12] + id] = tmp;\r\n\t\t\t\t} else {\r\n\t\t\t\t\tdatabase[hint * pow3[12] + id] = -1;\r\n\t\t\t\t}\r\n\t\t\t} else {\r\n\t\t\t\tint base1 = database[hint * pow3[12] + id + pow3[undecided_pos]];\r\n\t\t\t\tint base2 = database[hint * pow3[12] + id + pow3[undecided_pos] * 2];\r\n\r\n\t\t\t\tdatabase[hint * pow3[12] + id] = base1 & base2;\r\n\t\t\t}\r\n\t\t}\r\n\t}\r\n}\r\n\r\nvoid SlitherlinkDatabase::CreateReducedDatabase(SlitherlinkDatabaseMethod &method)\r\n{\r\n\tconst int pow3[] = { 1, 3, 9, 27, 81, 243, 729, 2187, 6561, 19683, 59049, 177147, 531441 };\r\n\r\n\tReleaseDatabase();\r\n\tdatabase = new int[pow3[12] * 4];\r\n\r\n\tint styles[12];\r\n\r\n\tfor (int hint = 0; hint <= 3; ++hint) {\r\n\t\tfor (int id = pow3[12] - 1; id >= 0; --id) {\r\n\t\t\tint tmp = id;\r\n\r\n\t\t\tfor (int i = 0; i < 12; ++i) {\r\n\t\t\t\tstyles[i] = tmp % 3;\r\n\t\t\t\ttmp \/= 3;\r\n\t\t\t}\r\n\r\n\t\t\tdatabase[hint * pow3[12] + id] = SolveLocal(hint, styles, method);\r\n\t\t}\r\n\t}\r\n}\r\n\r\nvoid SlitherlinkDatabase::ReleaseDatabase()\r\n{\r\n\tif (database) {\r\n\t\tdelete[] database;\r\n\t\tdatabase = nullptr;\r\n\t}\r\n}\r\n\r\nint SlitherlinkDatabase::SolveLocal(int clue, int styles[12], SlitherlinkDatabaseMethod &method)\r\n{\r\n\tconst int UNDECIDED = 0, LINE = 1, BLANK = 2;\r\n\tint segments[5][5];\r\n\r\n\tfor (int i = 0; i < 12; ++i) segments[2 + DATABASE_DY[i]][2 + DATABASE_DX[i]] = styles[i];\r\n\r\n\tif (method.adjacent_lines) {\r\n\t\tint n_lines =\r\n\t\t\t(segments[2][1] == LINE ? 1 : 0) +\r\n\t\t\t(segments[2][3] == LINE ? 1 : 0) +\r\n\t\t\t(segments[1][2] == LINE ? 1 : 0) +\r\n\t\t\t(segments[3][2] == LINE ? 1 : 0);\r\n\t\tint n_blanks =\r\n\t\t\t(segments[2][1] == BLANK ? 1 : 0) +\r\n\t\t\t(segments[2][3] == BLANK ? 1 : 0) +\r\n\t\t\t(segments[1][2] == BLANK ? 1 : 0) +\r\n\t\t\t(segments[3][2] == BLANK ? 1 : 0);\r\n\r\n\t\tif (n_lines > clue || 4 - n_blanks < clue) return -1;\r\n\t\t\r\n\t\tif (n_lines == clue) {\r\n\t\t\tif (segments[2][1] == UNDECIDED) segments[2][1] = BLANK;\r\n\t\t\tif (segments[2][3] == UNDECIDED) segments[2][3] = BLANK;\r\n\t\t\tif (segments[1][2] == UNDECIDED) segments[1][2] = BLANK;\r\n\t\t\tif (segments[3][2] == UNDECIDED) segments[3][2] = BLANK;\r\n\t\t}\r\n\t\tif (4 - n_blanks == clue) {\r\n\t\t\tif (segments[2][1] == UNDECIDED) segments[2][1] = LINE;\r\n\t\t\tif (segments[2][3] == UNDECIDED) segments[2][3] = LINE;\r\n\t\t\tif (segments[1][2] == UNDECIDED) segments[1][2] = LINE;\r\n\t\t\tif (segments[3][2] == UNDECIDED) segments[3][2] = LINE;\r\n\t\t}\r\n\t}\r\n\r\n\tfor (int dir = 0; dir < 4; ++dir) {\r\n\t\tint dy1 = GridConstant::GRID_DY[dir], dx1 = GridConstant::GRID_DX[dir];\r\n\t\tint dy2 = GridConstant::GRID_DY[(dir + 1) % 4], dx2 = GridConstant::GRID_DX[(dir + 1) % 4];\r\n\r\n\t\tif (segments[2 + dy1 * 2 + dy2][2 + dx1 * 2 + dx2] == BLANK && segments[2 + dy1 + dy2 * 2][2 + dx1 + dx2 * 2] == BLANK) {\r\n\t\t\t\/\/ this cell is corner\r\n\r\n\t\t\tif (clue == 1 && method.corner_1) {\r\n\t\t\t\tsegments[2 + dy1][2 + dx1] = segments[2 + dy2][2 + dx2] = BLANK;\r\n\t\t\t}\r\n\t\t\tif (clue == 2 && method.corner_2) {\r\n\t\t\t\tint out_y1, out_x1, out_y2, out_x2;\r\n\r\n\t\t\t\tout_y1 = 2 + dy1 * 2 - dy2, out_x1 = 2 + dx1 * 2 - dx2;\r\n\t\t\t\tout_y2 = 2 + dy1 - dy2 * 2, out_x2 = 2 + dx1 - dx2 * 2;\r\n\r\n\t\t\t\tif (segments[out_y1][out_x1] == LINE) segments[out_y2][out_x2] |= BLANK;\r\n\t\t\t\tif (segments[out_y1][out_x1] == BLANK) segments[out_y2][out_x2] |= LINE;\r\n\t\t\t\tif (segments[out_y2][out_x2] == LINE) segments[out_y1][out_x1] |= BLANK;\r\n\t\t\t\tif (segments[out_y2][out_x2] == BLANK) segments[out_y1][out_x1] |= LINE;\r\n\r\n\t\t\t\tout_y1 = 2 - dy1 * 2 + dy2, out_x1 = 2 - dx1 * 2 + dx2;\r\n\t\t\t\tout_y2 = 2 - dy1 + dy2 * 2, out_x2 = 2 - dx1 + dx2 * 2;\r\n\r\n\t\t\t\tif (segments[out_y1][out_x1] == LINE) segments[out_y2][out_x2] |= BLANK;\r\n\t\t\t\tif (segments[out_y1][out_x1] == BLANK) segments[out_y2][out_x2] |= LINE;\r\n\t\t\t\tif (segments[out_y2][out_x2] == LINE) segments[out_y1][out_x1] |= BLANK;\r\n\t\t\t\tif (segments[out_y2][out_x2] == BLANK) segments[out_y1][out_x1] |= LINE;\r\n\t\t\t}\r\n\t\t\tif (clue == 3 && method.corner_3) {\r\n\t\t\t\tsegments[2 + dy1][2 + dx1] = segments[2 + dy2][2 + dx2] = LINE;\r\n\t\t\t}\r\n\t\t}\r\n\r\n\t\tint in_y1, in_x1, in_y2, in_x2;\r\n\t\tin_y1 = 2 + dy1 * 2 + dy2, in_x1 = 2 + dx1 * 2 + dx2;\r\n\t\tin_y2 = 2 + dy1 + dy2 * 2, in_x2 = 2 + dx1 + dx2 * 2;\r\n\r\n\t\tif (clue == 3 && method.line_to_3) {\r\n\t\t\tif (segments[in_y1][in_x1] == LINE || segments[in_y2][in_x2] == LINE) {\r\n\t\t\t\tsegments[2 - dy1][2 - dx1] |= LINE;\r\n\t\t\t\tsegments[2 - dy2][2 - dx2] |= LINE;\r\n\r\n\t\t\t\tif (segments[in_y1][in_x1] == LINE) segments[in_y2][in_x2] |= BLANK;\r\n\t\t\t\tif (segments[in_y2][in_x2] == LINE) segments[in_y1][in_x1] |= BLANK;\r\n\t\t\t}\r\n\t\t}\r\n\r\n\t\tif (clue == 1 && method.line_to_1) {\r\n\t\t\tif ((segments[in_y1][in_x1] == LINE && segments[in_y2][in_x2] == BLANK) ||\r\n\t\t\t\t(segments[in_y1][in_x1] == BLANK && segments[in_y2][in_x2] == LINE)) {\r\n\t\t\t\tsegments[2 - dy1][2 - dx1] |= BLANK;\r\n\t\t\t\tsegments[2 - dy2][2 - dx2] |= BLANK;\r\n\t\t\t}\r\n\t\t}\r\n\r\n\t\tif (clue == 2 && method.line_to_2) {\r\n\t\t\tif ((segments[in_y1][in_x1] == LINE && segments[in_y2][in_x2] == BLANK) ||\r\n\t\t\t\t(segments[in_y1][in_x1] == BLANK && segments[in_y2][in_x2] == LINE)) {\r\n\t\t\t\tint out_y1, out_x1, out_y2, out_x2;\r\n\r\n\t\t\t\tout_y1 = 2 - dy1, out_x1 = 2 - dx1;\r\n\t\t\t\tout_y2 = 2 - dy2, out_x2 = 2 - dx2;\r\n\r\n\t\t\t\tif (segments[out_y1][out_x1] == BLANK) segments[out_y2][out_x2] |= LINE;\r\n\t\t\t\tif (segments[out_y1][out_x1] == LINE) segments[out_y2][out_x2] |= BLANK;\r\n\t\t\t\tif (segments[out_y2][out_x2] == BLANK) segments[out_y1][out_x1] |= LINE;\r\n\t\t\t\tif (segments[out_y2][out_x2] == LINE) segments[out_y1][out_x1] |= BLANK;\r\n\r\n\t\t\t\tout_y1 = 2 - dy1 * 2 - dy2, out_x1 = 2 - dx1 * 2 - dx2;\r\n\t\t\t\tout_y2 = 2 - dy1 - dy2 * 2, out_x2 = 2 - dx1 - dx2 * 2;\r\n\r\n\t\t\t\tif (segments[out_y1][out_x1] == BLANK) segments[out_y2][out_x2] |= LINE;\r\n\t\t\t\tif (segments[out_y1][out_x1] == LINE) segments[out_y2][out_x2] |= BLANK;\r\n\t\t\t\tif (segments[out_y2][out_x2] == BLANK) segments[out_y1][out_x1] |= LINE;\r\n\t\t\t\tif (segments[out_y2][out_x2] == LINE) segments[out_y1][out_x1] |= BLANK;\r\n\t\t\t}\r\n\t\t}\r\n\r\n\t\tif ((clue == 1 && method.line_from_1 && segments[2 - dy1][2 - dx1] == BLANK && segments[2 - dy2][2 - dx2] == BLANK) || \r\n\t\t\t(clue == 3 && method.line_from_3 && segments[2 - dy1][2 - dx1] == LINE && segments[2 - dy2][2 - dx2] == LINE)) {\r\n\t\t\tif (segments[in_y1][in_x1] == LINE) segments[in_y2][in_x2] |= BLANK;\r\n\t\t\tif (segments[in_y1][in_x1] == BLANK) segments[in_y2][in_x2] |= LINE;\r\n\t\t\tif (segments[in_y2][in_x2] == LINE) segments[in_y1][in_x1] |= BLANK;\r\n\t\t\tif (segments[in_y2][in_x2] == BLANK) segments[in_y1][in_x1] |= LINE;\r\n\t\t}\r\n\t}\r\n\r\n\tint ret = 0;\r\n\tfor (int i = 0; i < 12; ++i) {\r\n\t\tint y = 2 + DATABASE_DY[i], x = 2 + DATABASE_DX[i];\r\n\t\tif (segments[y][x] == 3) return -1;\r\n\t\tret |= segments[y][x] << (2 * i);\r\n\t}\r\n\r\n\treturn ret;\r\n}\r\n}\r\n<commit_msg>Apply the methods as long as new facts are revealed in SolveLocal<commit_after>#include \"SlitherlinkDatabase.h\"\r\n#include \"SlitherlinkDatabaseMethod.hpp\"\r\n#include \"..\/common\/SolverConstant.h\"\r\n\r\nnamespace Penciloid\r\n{\r\nint *SlitherlinkDatabase::database = nullptr;\r\nconst int SlitherlinkDatabase::DATABASE_DX[] = { -2, -2, -1, -1, -1, 0, 0, 1, 1, 1, 2, 2 };\r\nconst int SlitherlinkDatabase::DATABASE_DY[] = { -1, 1, -2, 0, 2, -1, 1, -2, 0, 2, -1, 1 };\r\n\r\nvoid SlitherlinkDatabase::CreateDatabase()\r\n{\r\n\tconst int pow3[] = { 1, 3, 9, 27, 81, 243, 729, 2187, 6561, 19683, 59049, 177147, 531441 };\r\n\r\n\tReleaseDatabase();\r\n\tdatabase = new int[pow3[12] * 4];\r\n\r\n\tint styles[12];\r\n\r\n\tfor (int hint = 0; hint <= 3; ++hint) {\r\n\t\tfor (int id = pow3[12] - 1; id >= 0; --id) {\r\n\t\t\tint tmp = id;\r\n\t\t\tint undecided_pos = -1;\r\n\r\n\t\t\tfor (int i = 0; i < 12; ++i) {\r\n\t\t\t\tstyles[i] = tmp % 3;\r\n\t\t\t\ttmp \/= 3;\r\n\r\n\t\t\t\tif (styles[i] == 0) undecided_pos = i;\r\n\t\t\t}\r\n\r\n\t\t\tif (undecided_pos == -1) {\r\n\t\t\t\tbool consistency = true;\r\n\r\n\t\t\t\tif (8 - (styles[3] + styles[5] + styles[6] + styles[8]) != hint) {\r\n\t\t\t\t\tconsistency = false;\r\n\t\t\t\t}\r\n\r\n\t\t\t\ttmp = 8 - (styles[0] + styles[2] + styles[3] + styles[5]);\r\n\t\t\t\tif (tmp != 0 && tmp != 2) consistency = false;\r\n\t\t\t\ttmp = 8 - (styles[1] + styles[3] + styles[4] + styles[6]);\r\n\t\t\t\tif (tmp != 0 && tmp != 2) consistency = false;\r\n\t\t\t\ttmp = 8 - (styles[5] + styles[7] + styles[8] + styles[10]);\r\n\t\t\t\tif (tmp != 0 && tmp != 2) consistency = false;\r\n\t\t\t\ttmp = 8 - (styles[6] + styles[8] + styles[9] + styles[11]);\r\n\t\t\t\tif (tmp != 0 && tmp != 2) consistency = false;\r\n\r\n\t\t\t\tif (consistency) {\r\n\t\t\t\t\tint tmp = 0;\r\n\t\t\t\t\tfor (int i = 0; i < 12; ++i) tmp |= styles[i] << (2 * i);\r\n\t\t\t\t\tdatabase[hint * pow3[12] + id] = tmp;\r\n\t\t\t\t} else {\r\n\t\t\t\t\tdatabase[hint * pow3[12] + id] = -1;\r\n\t\t\t\t}\r\n\t\t\t} else {\r\n\t\t\t\tint base1 = database[hint * pow3[12] + id + pow3[undecided_pos]];\r\n\t\t\t\tint base2 = database[hint * pow3[12] + id + pow3[undecided_pos] * 2];\r\n\r\n\t\t\t\tdatabase[hint * pow3[12] + id] = base1 & base2;\r\n\t\t\t}\r\n\t\t}\r\n\t}\r\n}\r\n\r\nvoid SlitherlinkDatabase::CreateReducedDatabase(SlitherlinkDatabaseMethod &method)\r\n{\r\n\tconst int pow3[] = { 1, 3, 9, 27, 81, 243, 729, 2187, 6561, 19683, 59049, 177147, 531441 };\r\n\r\n\tReleaseDatabase();\r\n\tdatabase = new int[pow3[12] * 4];\r\n\r\n\tint styles[12];\r\n\r\n\tfor (int hint = 0; hint <= 3; ++hint) {\r\n\t\tfor (int id = pow3[12] - 1; id >= 0; --id) {\r\n\t\t\tint tmp = id;\r\n\r\n\t\t\tfor (int i = 0; i < 12; ++i) {\r\n\t\t\t\tstyles[i] = tmp % 3;\r\n\t\t\t\ttmp \/= 3;\r\n\t\t\t}\r\n\r\n\t\t\tdatabase[hint * pow3[12] + id] = SolveLocal(hint, styles, method);\r\n\t\t}\r\n\t}\r\n}\r\n\r\nvoid SlitherlinkDatabase::ReleaseDatabase()\r\n{\r\n\tif (database) {\r\n\t\tdelete[] database;\r\n\t\tdatabase = nullptr;\r\n\t}\r\n}\r\n\r\nint SlitherlinkDatabase::SolveLocal(int clue, int styles[12], SlitherlinkDatabaseMethod &method)\r\n{\r\n\tconst int UNDECIDED = 0, LINE = 1, BLANK = 2;\r\n\tint segments[5][5];\r\n\tint ret = 0, ret_previous = 0;\r\n\r\n\tfor (int i = 0; i < 12; ++i) segments[2 + DATABASE_DY[i]][2 + DATABASE_DX[i]] = styles[i];\r\n\r\n\tint nt = 0;\r\n\tdo {\r\n\t\tret_previous = ret;\r\n\t\tif (method.adjacent_lines) {\r\n\t\t\tint n_lines =\r\n\t\t\t\t(segments[2][1] == LINE ? 1 : 0) +\r\n\t\t\t\t(segments[2][3] == LINE ? 1 : 0) +\r\n\t\t\t\t(segments[1][2] == LINE ? 1 : 0) +\r\n\t\t\t\t(segments[3][2] == LINE ? 1 : 0);\r\n\t\t\tint n_blanks =\r\n\t\t\t\t(segments[2][1] == BLANK ? 1 : 0) +\r\n\t\t\t\t(segments[2][3] == BLANK ? 1 : 0) +\r\n\t\t\t\t(segments[1][2] == BLANK ? 1 : 0) +\r\n\t\t\t\t(segments[3][2] == BLANK ? 1 : 0);\r\n\r\n\t\t\tif (n_lines > clue || 4 - n_blanks < clue) return -1;\r\n\r\n\t\t\tif (n_lines == clue) {\r\n\t\t\t\tif (segments[2][1] == UNDECIDED) segments[2][1] = BLANK;\r\n\t\t\t\tif (segments[2][3] == UNDECIDED) segments[2][3] = BLANK;\r\n\t\t\t\tif (segments[1][2] == UNDECIDED) segments[1][2] = BLANK;\r\n\t\t\t\tif (segments[3][2] == UNDECIDED) segments[3][2] = BLANK;\r\n\t\t\t}\r\n\t\t\tif (4 - n_blanks == clue) {\r\n\t\t\t\tif (segments[2][1] == UNDECIDED) segments[2][1] = LINE;\r\n\t\t\t\tif (segments[2][3] == UNDECIDED) segments[2][3] = LINE;\r\n\t\t\t\tif (segments[1][2] == UNDECIDED) segments[1][2] = LINE;\r\n\t\t\t\tif (segments[3][2] == UNDECIDED) segments[3][2] = LINE;\r\n\t\t\t}\r\n\t\t}\r\n\r\n\t\tfor (int dir = 0; dir < 4; ++dir) {\r\n\t\t\tint dy1 = GridConstant::GRID_DY[dir], dx1 = GridConstant::GRID_DX[dir];\r\n\t\t\tint dy2 = GridConstant::GRID_DY[(dir + 1) % 4], dx2 = GridConstant::GRID_DX[(dir + 1) % 4];\r\n\r\n\t\t\tif (segments[2 + dy1 * 2 + dy2][2 + dx1 * 2 + dx2] == BLANK && segments[2 + dy1 + dy2 * 2][2 + dx1 + dx2 * 2] == BLANK) {\r\n\t\t\t\t\/\/ this cell is corner\r\n\r\n\t\t\t\tif (clue == 1 && method.corner_1) {\r\n\t\t\t\t\tsegments[2 + dy1][2 + dx1] = segments[2 + dy2][2 + dx2] = BLANK;\r\n\t\t\t\t}\r\n\t\t\t\tif (clue == 2 && method.corner_2) {\r\n\t\t\t\t\tint out_y1, out_x1, out_y2, out_x2;\r\n\r\n\t\t\t\t\tout_y1 = 2 + dy1 * 2 - dy2, out_x1 = 2 + dx1 * 2 - dx2;\r\n\t\t\t\t\tout_y2 = 2 + dy1 - dy2 * 2, out_x2 = 2 + dx1 - dx2 * 2;\r\n\r\n\t\t\t\t\tif (segments[out_y1][out_x1] == LINE) segments[out_y2][out_x2] |= BLANK;\r\n\t\t\t\t\tif (segments[out_y1][out_x1] == BLANK) segments[out_y2][out_x2] |= LINE;\r\n\t\t\t\t\tif (segments[out_y2][out_x2] == LINE) segments[out_y1][out_x1] |= BLANK;\r\n\t\t\t\t\tif (segments[out_y2][out_x2] == BLANK) segments[out_y1][out_x1] |= LINE;\r\n\r\n\t\t\t\t\tout_y1 = 2 - dy1 * 2 + dy2, out_x1 = 2 - dx1 * 2 + dx2;\r\n\t\t\t\t\tout_y2 = 2 - dy1 + dy2 * 2, out_x2 = 2 - dx1 + dx2 * 2;\r\n\r\n\t\t\t\t\tif (segments[out_y1][out_x1] == LINE) segments[out_y2][out_x2] |= BLANK;\r\n\t\t\t\t\tif (segments[out_y1][out_x1] == BLANK) segments[out_y2][out_x2] |= LINE;\r\n\t\t\t\t\tif (segments[out_y2][out_x2] == LINE) segments[out_y1][out_x1] |= BLANK;\r\n\t\t\t\t\tif (segments[out_y2][out_x2] == BLANK) segments[out_y1][out_x1] |= LINE;\r\n\t\t\t\t}\r\n\t\t\t\tif (clue == 3 && method.corner_3) {\r\n\t\t\t\t\tsegments[2 + dy1][2 + dx1] = segments[2 + dy2][2 + dx2] = LINE;\r\n\t\t\t\t}\r\n\t\t\t}\r\n\r\n\t\t\tint in_y1, in_x1, in_y2, in_x2;\r\n\t\t\tin_y1 = 2 + dy1 * 2 + dy2, in_x1 = 2 + dx1 * 2 + dx2;\r\n\t\t\tin_y2 = 2 + dy1 + dy2 * 2, in_x2 = 2 + dx1 + dx2 * 2;\r\n\r\n\t\t\tif (clue == 3 && method.line_to_3) {\r\n\t\t\t\tif (segments[in_y1][in_x1] == LINE || segments[in_y2][in_x2] == LINE) {\r\n\t\t\t\t\tsegments[2 - dy1][2 - dx1] |= LINE;\r\n\t\t\t\t\tsegments[2 - dy2][2 - dx2] |= LINE;\r\n\r\n\t\t\t\t\tif (segments[in_y1][in_x1] == LINE) segments[in_y2][in_x2] |= BLANK;\r\n\t\t\t\t\tif (segments[in_y2][in_x2] == LINE) segments[in_y1][in_x1] |= BLANK;\r\n\t\t\t\t}\r\n\t\t\t}\r\n\r\n\t\t\tif (clue == 1 && method.line_to_1) {\r\n\t\t\t\tif ((segments[in_y1][in_x1] == LINE && segments[in_y2][in_x2] == BLANK) ||\r\n\t\t\t\t\t(segments[in_y1][in_x1] == BLANK && segments[in_y2][in_x2] == LINE)) {\r\n\t\t\t\t\tsegments[2 - dy1][2 - dx1] |= BLANK;\r\n\t\t\t\t\tsegments[2 - dy2][2 - dx2] |= BLANK;\r\n\t\t\t\t}\r\n\t\t\t}\r\n\r\n\t\t\tif (clue == 2 && method.line_to_2) {\r\n\t\t\t\tif ((segments[in_y1][in_x1] == LINE && segments[in_y2][in_x2] == BLANK) ||\r\n\t\t\t\t\t(segments[in_y1][in_x1] == BLANK && segments[in_y2][in_x2] == LINE)) {\r\n\t\t\t\t\tint out_y1, out_x1, out_y2, out_x2;\r\n\r\n\t\t\t\t\tout_y1 = 2 - dy1, out_x1 = 2 - dx1;\r\n\t\t\t\t\tout_y2 = 2 - dy2, out_x2 = 2 - dx2;\r\n\r\n\t\t\t\t\tif (segments[out_y1][out_x1] == BLANK) segments[out_y2][out_x2] |= LINE;\r\n\t\t\t\t\tif (segments[out_y1][out_x1] == LINE) segments[out_y2][out_x2] |= BLANK;\r\n\t\t\t\t\tif (segments[out_y2][out_x2] == BLANK) segments[out_y1][out_x1] |= LINE;\r\n\t\t\t\t\tif (segments[out_y2][out_x2] == LINE) segments[out_y1][out_x1] |= BLANK;\r\n\r\n\t\t\t\t\tout_y1 = 2 - dy1 * 2 - dy2, out_x1 = 2 - dx1 * 2 - dx2;\r\n\t\t\t\t\tout_y2 = 2 - dy1 - dy2 * 2, out_x2 = 2 - dx1 - dx2 * 2;\r\n\r\n\t\t\t\t\tif (segments[out_y1][out_x1] == BLANK) segments[out_y2][out_x2] |= LINE;\r\n\t\t\t\t\tif (segments[out_y1][out_x1] == LINE) segments[out_y2][out_x2] |= BLANK;\r\n\t\t\t\t\tif (segments[out_y2][out_x2] == BLANK) segments[out_y1][out_x1] |= LINE;\r\n\t\t\t\t\tif (segments[out_y2][out_x2] == LINE) segments[out_y1][out_x1] |= BLANK;\r\n\t\t\t\t}\r\n\t\t\t}\r\n\r\n\t\t\tif ((clue == 1 && method.line_from_1 && segments[2 - dy1][2 - dx1] == BLANK && segments[2 - dy2][2 - dx2] == BLANK) ||\r\n\t\t\t\t(clue == 3 && method.line_from_3 && segments[2 - dy1][2 - dx1] == LINE && segments[2 - dy2][2 - dx2] == LINE)) {\r\n\t\t\t\tif (segments[in_y1][in_x1] == LINE) segments[in_y2][in_x2] |= BLANK;\r\n\t\t\t\tif (segments[in_y1][in_x1] == BLANK) segments[in_y2][in_x2] |= LINE;\r\n\t\t\t\tif (segments[in_y2][in_x2] == LINE) segments[in_y1][in_x1] |= BLANK;\r\n\t\t\t\tif (segments[in_y2][in_x2] == BLANK) segments[in_y1][in_x1] |= LINE;\r\n\t\t\t}\r\n\t\t}\r\n\r\n\t\tret = 0;\r\n\t\tfor (int i = 0; i < 12; ++i) {\r\n\t\t\tint y = 2 + DATABASE_DY[i], x = 2 + DATABASE_DX[i];\r\n\t\t\tif (segments[y][x] == 3) return -1;\r\n\t\t\tret |= segments[y][x] << (2 * i);\r\n\t\t}\r\n\t} while (ret != ret_previous);\r\n\r\n\treturn ret;\r\n}\r\n}\r\n<|endoftext|>"} {"text":"<commit_before>\/\/\n\/\/ Copyright Copyright 2009-2022, AMT – The Association For Manufacturing Technology (“AMT”)\n\/\/ All rights reserved.\n\/\/\n\/\/ Licensed under the Apache License, Version 2.0 (the \"License\");\n\/\/ you may not use this file except in compliance with the License.\n\/\/ You may obtain a copy of the License at\n\/\/\n\/\/ http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n\/\/\n\/\/ Unless required by applicable law or agreed to in writing, software\n\/\/ distributed under the License is distributed on an \"AS IS\" BASIS,\n\/\/ WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n\/\/ See the License for the specific language governing permissions and\n\/\/ limitations under the License.\n\/\/\n\n#include \"source\/adapter\/adapter_pipeline.hpp\"\n\n#include \"agent.hpp\"\n#include \"configuration\/agent_config.hpp\"\n#include \"configuration\/config_options.hpp\"\n#include \"pipeline\/convert_sample.hpp\"\n#include \"pipeline\/deliver.hpp\"\n#include \"pipeline\/delta_filter.hpp\"\n#include \"pipeline\/duplicate_filter.hpp\"\n#include \"pipeline\/period_filter.hpp\"\n#include \"pipeline\/timestamp_extractor.hpp\"\n#include \"pipeline\/topic_mapper.hpp\"\n#include \"pipeline\/upcase_value.hpp\"\n#include \"source\/adapter\/adapter.hpp\"\n\nusing namespace std;\nusing namespace std::literals;\n\nnamespace mtconnect {\n using namespace observation;\n using namespace entity;\n using namespace pipeline;\n\n namespace source::adapter {\n std::unique_ptr<Handler> AdapterPipeline::makeHandler()\n {\n auto handler = make_unique<Handler>();\n\n \/\/ Build the pipeline for an adapter\n handler->m_connecting = [this](const std::string &id) {\n auto entity = make_shared<Entity>(\"ConnectionStatus\",\n Properties {{\"VALUE\", \"CONNECTING\"s}, {\"source\", id}});\n run(entity);\n };\n handler->m_connected = [this](const std::string &id) {\n auto entity = make_shared<Entity>(\"ConnectionStatus\",\n Properties {{\"VALUE\", \"CONNECTED\"s}, {\"source\", id}});\n run(entity);\n };\n handler->m_disconnected = [this](const std::string &id) {\n auto entity = make_shared<Entity>(\"ConnectionStatus\",\n Properties {{\"VALUE\", \"DISCONNECTED\"s}, {\"source\", id}});\n run(entity);\n };\n handler->m_processData = [this](const std::string &data, const std::string &source) {\n auto entity = make_shared<Entity>(\"Data\", Properties {{\"VALUE\", data}, {\"source\", source}});\n run(entity);\n };\n handler->m_processMessage = [this](const std::string &topic, const std::string &data,\n const std::string &source) {\n auto entity = make_shared<PipelineMessage>(\n \"Message\", Properties {{\"VALUE\", data}, {\"topic\", topic}, {\"source\", source}});\n run(entity);\n };\n handler->m_command = [this](const std::string &data, const std::string &source) {\n auto entity =\n make_shared<Entity>(\"Command\", Properties {{\"VALUE\", data}, {\"source\", source}});\n run(entity);\n };\n\n return handler;\n }\n\n void AdapterPipeline::build(const ConfigOptions &options)\n {\n clear();\n m_options = options;\n\n m_identity = GetOption<string>(m_options, configuration::AdapterIdentity).value_or(\"unknown\");\n }\n\n void AdapterPipeline::buildDeviceList()\n {\n m_identity = *GetOption<string>(m_options, configuration::AdapterIdentity);\n\n auto list = GetOption<StringList>(m_options, configuration::AdditionalDevices);\n if (list)\n m_devices = *list;\n m_device = GetOption<string>(m_options, configuration::Device);\n if (m_device)\n {\n m_devices.emplace_front(*m_device);\n auto dp = m_context->m_contract->findDevice(*m_device);\n if (dp)\n {\n dp->setOptions(m_options);\n }\n }\n }\n\n void AdapterPipeline::buildCommandAndStatusDelivery()\n {\n bind(make_shared<DeliverConnectionStatus>(\n m_context, m_devices, IsOptionSet(m_options, configuration::AutoAvailable)));\n bind(make_shared<DeliverCommand>(m_context, m_device));\n }\n\n void AdapterPipeline::buildAssetDelivery(pipeline::TransformPtr next)\n {\n \/\/ Go directly to asset delivery\n std::optional<string> assetMetrics;\n assetMetrics = m_identity + \"_asset_update_rate\";\n\n next->bind(make_shared<DeliverAsset>(m_context, assetMetrics));\n next->bind(make_shared<DeliverAssetCommand>(m_context));\n }\n\n void AdapterPipeline::buildObservationDelivery(pipeline::TransformPtr next)\n {\n \/\/ Uppercase Events\n if (IsOptionSet(m_options, configuration::UpcaseDataItemValue))\n next = next->bind(make_shared<UpcaseValue>());\n\n \/\/ Filter dups, by delta, and by period\n next = next->bind(make_shared<DuplicateFilter>(m_context));\n next = next->bind(make_shared<DeltaFilter>(m_context));\n next = next->bind(make_shared<PeriodFilter>(m_context, m_strand));\n\n \/\/ Convert values\n if (IsOptionSet(m_options, configuration::ConversionRequired))\n next = next->bind(make_shared<ConvertSample>());\n\n \/\/ Deliver\n std::optional<string> obsMetrics;\n obsMetrics = m_identity + \"_observation_update_rate\";\n next->bind(make_shared<DeliverObservation>(m_context, obsMetrics));\n }\n } \/\/ namespace source::adapter\n} \/\/ namespace mtconnect\n<commit_msg>Removed setting m_identity in the buildDeviceList method. Should already be set in build.<commit_after>\/\/\n\/\/ Copyright Copyright 2009-2022, AMT – The Association For Manufacturing Technology (“AMT”)\n\/\/ All rights reserved.\n\/\/\n\/\/ Licensed under the Apache License, Version 2.0 (the \"License\");\n\/\/ you may not use this file except in compliance with the License.\n\/\/ You may obtain a copy of the License at\n\/\/\n\/\/ http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n\/\/\n\/\/ Unless required by applicable law or agreed to in writing, software\n\/\/ distributed under the License is distributed on an \"AS IS\" BASIS,\n\/\/ WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n\/\/ See the License for the specific language governing permissions and\n\/\/ limitations under the License.\n\/\/\n\n#include \"source\/adapter\/adapter_pipeline.hpp\"\n\n#include \"agent.hpp\"\n#include \"configuration\/agent_config.hpp\"\n#include \"configuration\/config_options.hpp\"\n#include \"pipeline\/convert_sample.hpp\"\n#include \"pipeline\/deliver.hpp\"\n#include \"pipeline\/delta_filter.hpp\"\n#include \"pipeline\/duplicate_filter.hpp\"\n#include \"pipeline\/period_filter.hpp\"\n#include \"pipeline\/timestamp_extractor.hpp\"\n#include \"pipeline\/topic_mapper.hpp\"\n#include \"pipeline\/upcase_value.hpp\"\n#include \"source\/adapter\/adapter.hpp\"\n\nusing namespace std;\nusing namespace std::literals;\n\nnamespace mtconnect {\n using namespace observation;\n using namespace entity;\n using namespace pipeline;\n\n namespace source::adapter {\n std::unique_ptr<Handler> AdapterPipeline::makeHandler()\n {\n auto handler = make_unique<Handler>();\n\n \/\/ Build the pipeline for an adapter\n handler->m_connecting = [this](const std::string &id) {\n auto entity = make_shared<Entity>(\"ConnectionStatus\",\n Properties {{\"VALUE\", \"CONNECTING\"s}, {\"source\", id}});\n run(entity);\n };\n handler->m_connected = [this](const std::string &id) {\n auto entity = make_shared<Entity>(\"ConnectionStatus\",\n Properties {{\"VALUE\", \"CONNECTED\"s}, {\"source\", id}});\n run(entity);\n };\n handler->m_disconnected = [this](const std::string &id) {\n auto entity = make_shared<Entity>(\"ConnectionStatus\",\n Properties {{\"VALUE\", \"DISCONNECTED\"s}, {\"source\", id}});\n run(entity);\n };\n handler->m_processData = [this](const std::string &data, const std::string &source) {\n auto entity = make_shared<Entity>(\"Data\", Properties {{\"VALUE\", data}, {\"source\", source}});\n run(entity);\n };\n handler->m_processMessage = [this](const std::string &topic, const std::string &data,\n const std::string &source) {\n auto entity = make_shared<PipelineMessage>(\n \"Message\", Properties {{\"VALUE\", data}, {\"topic\", topic}, {\"source\", source}});\n run(entity);\n };\n handler->m_command = [this](const std::string &data, const std::string &source) {\n auto entity =\n make_shared<Entity>(\"Command\", Properties {{\"VALUE\", data}, {\"source\", source}});\n run(entity);\n };\n\n return handler;\n }\n\n void AdapterPipeline::build(const ConfigOptions &options)\n {\n clear();\n m_options = options;\n\n m_identity = GetOption<string>(m_options, configuration::AdapterIdentity).value_or(\"unknown\");\n }\n\n void AdapterPipeline::buildDeviceList()\n {\n auto list = GetOption<StringList>(m_options, configuration::AdditionalDevices);\n if (list)\n m_devices = *list;\n m_device = GetOption<string>(m_options, configuration::Device);\n if (m_device)\n {\n m_devices.emplace_front(*m_device);\n auto dp = m_context->m_contract->findDevice(*m_device);\n if (dp)\n {\n dp->setOptions(m_options);\n }\n }\n }\n\n void AdapterPipeline::buildCommandAndStatusDelivery()\n {\n bind(make_shared<DeliverConnectionStatus>(\n m_context, m_devices, IsOptionSet(m_options, configuration::AutoAvailable)));\n bind(make_shared<DeliverCommand>(m_context, m_device));\n }\n\n void AdapterPipeline::buildAssetDelivery(pipeline::TransformPtr next)\n {\n \/\/ Go directly to asset delivery\n std::optional<string> assetMetrics;\n assetMetrics = m_identity + \"_asset_update_rate\";\n\n next->bind(make_shared<DeliverAsset>(m_context, assetMetrics));\n next->bind(make_shared<DeliverAssetCommand>(m_context));\n }\n\n void AdapterPipeline::buildObservationDelivery(pipeline::TransformPtr next)\n {\n \/\/ Uppercase Events\n if (IsOptionSet(m_options, configuration::UpcaseDataItemValue))\n next = next->bind(make_shared<UpcaseValue>());\n\n \/\/ Filter dups, by delta, and by period\n next = next->bind(make_shared<DuplicateFilter>(m_context));\n next = next->bind(make_shared<DeltaFilter>(m_context));\n next = next->bind(make_shared<PeriodFilter>(m_context, m_strand));\n\n \/\/ Convert values\n if (IsOptionSet(m_options, configuration::ConversionRequired))\n next = next->bind(make_shared<ConvertSample>());\n\n \/\/ Deliver\n std::optional<string> obsMetrics;\n obsMetrics = m_identity + \"_observation_update_rate\";\n next->bind(make_shared<DeliverObservation>(m_context, obsMetrics));\n }\n } \/\/ namespace source::adapter\n} \/\/ namespace mtconnect\n<|endoftext|>"} {"text":"<commit_before>\/\/\r\n\/\/ PROJECT: Aspia Remote Desktop\r\n\/\/ FILE: host\/console_session_launcher.cc\r\n\/\/ LICENSE: See top-level directory\r\n\/\/ PROGRAMMERS: Dmitry Chapyshev (dmitry@aspia.ru)\r\n\/\/\r\n\r\n#include \"host\/console_session_launcher.h\"\r\n\r\n#include <userenv.h>\r\n#include <wtsapi32.h>\r\n#include <string>\r\n\r\n#include \"base\/version_helpers.h\"\r\n#include \"base\/process_helpers.h\"\r\n#include \"base\/service_manager.h\"\r\n#include \"base\/scoped_object.h\"\r\n#include \"base\/scoped_wts_memory.h\"\r\n#include \"base\/scoped_impersonator.h\"\r\n#include \"base\/object_watcher.h\"\r\n#include \"base\/unicode.h\"\r\n#include \"base\/path.h\"\r\n#include \"base\/process.h\"\r\n#include \"base\/logging.h\"\r\n\r\nnamespace aspia {\r\n\r\nstatic const WCHAR kServiceShortName[] = L\"aspia-desktop-session-launcher\";\r\nstatic const WCHAR kServiceFullName[] = L\"Aspia Desktop Session Launcher\";\r\n\r\n\/\/ Name of the default session desktop.\r\nstatic WCHAR kDefaultDesktopName[] = L\"winsta0\\\\default\";\r\n\r\nConsoleSessionLauncher::ConsoleSessionLauncher(const std::wstring& service_id) :\r\n Service(ServiceManager::CreateUniqueServiceName(kServiceShortName, service_id))\r\n{\r\n \/\/ Nothing\r\n}\r\n\r\nstatic bool CopyProcessToken(DWORD desired_access, ScopedHandle& token_out)\r\n{\r\n ScopedHandle process_token;\r\n\r\n if (!OpenProcessToken(GetCurrentProcess(),\r\n TOKEN_DUPLICATE | desired_access,\r\n process_token.Recieve()))\r\n {\r\n LOG(ERROR) << \"OpenProcessToken() failed: \" << GetLastSystemErrorString();\r\n return false;\r\n }\r\n\r\n if (!DuplicateTokenEx(process_token,\r\n desired_access,\r\n nullptr,\r\n SecurityImpersonation,\r\n TokenPrimary,\r\n token_out.Recieve()))\r\n {\r\n LOG(ERROR) << \"DuplicateTokenEx() failed: \" << GetLastSystemErrorString();\r\n return false;\r\n }\r\n\r\n return true;\r\n}\r\n\r\n\/\/ Creates a copy of the current process with SE_TCB_NAME privilege enabled.\r\nstatic bool CreatePrivilegedToken(ScopedHandle& token_out)\r\n{\r\n ScopedHandle privileged_token;\r\n DWORD desired_access = TOKEN_ADJUST_PRIVILEGES | TOKEN_IMPERSONATE |\r\n TOKEN_DUPLICATE | TOKEN_QUERY;\r\n\r\n if (!CopyProcessToken(desired_access, privileged_token))\r\n return false;\r\n\r\n \/\/ Get the LUID for the SE_TCB_NAME privilege.\r\n TOKEN_PRIVILEGES state;\r\n state.PrivilegeCount = 1;\r\n state.Privileges[0].Attributes = SE_PRIVILEGE_ENABLED;\r\n\r\n if (!LookupPrivilegeValueW(nullptr, SE_TCB_NAME, &state.Privileges[0].Luid))\r\n {\r\n LOG(ERROR) << \"LookupPrivilegeValueW() failed: \" << GetLastSystemErrorString();\r\n return false;\r\n }\r\n\r\n \/\/ Enable the SE_TCB_NAME privilege.\r\n if (!AdjustTokenPrivileges(privileged_token, FALSE, &state, 0, nullptr, 0))\r\n {\r\n LOG(ERROR) << \"AdjustTokenPrivileges() failed: \" << GetLastSystemErrorString();\r\n return false;\r\n }\r\n\r\n token_out.Reset(privileged_token.Release());\r\n return true;\r\n}\r\n\r\n\/\/ Creates a copy of the current process token for the given |session_id| so\r\n\/\/ it can be used to launch a process in that session.\r\nstatic bool CreateSessionToken(uint32_t session_id, ScopedHandle& token_out)\r\n{\r\n ScopedHandle session_token;\r\n DWORD desired_access = TOKEN_ADJUST_DEFAULT | TOKEN_ADJUST_SESSIONID |\r\n TOKEN_ASSIGN_PRIMARY | TOKEN_DUPLICATE | TOKEN_QUERY;\r\n\r\n if (!CopyProcessToken(desired_access, session_token))\r\n return false;\r\n\r\n ScopedHandle privileged_token;\r\n\r\n if (!CreatePrivilegedToken(privileged_token))\r\n return false;\r\n\r\n {\r\n ScopedImpersonator impersonator;\r\n\r\n if (!impersonator.ImpersonateLoggedOnUser(privileged_token))\r\n return false;\r\n\r\n \/\/ Change the session ID of the token.\r\n DWORD new_session_id = session_id;\r\n if (!SetTokenInformation(session_token,\r\n TokenSessionId,\r\n &new_session_id,\r\n sizeof(new_session_id)))\r\n {\r\n LOG(ERROR) << \"SetTokenInformation() failed: \" << GetLastSystemErrorString();\r\n return false;\r\n }\r\n }\r\n\r\n token_out.Reset(session_token.Release());\r\n return true;\r\n}\r\n\r\nstatic bool CreateProcessWithToken(HANDLE user_token, const std::wstring& command_line)\r\n{\r\n PROCESS_INFORMATION process_info = { 0 };\r\n STARTUPINFOW startup_info = { 0 };\r\n\r\n startup_info.cb = sizeof(startup_info);\r\n startup_info.lpDesktop = kDefaultDesktopName;\r\n\r\n if (!CreateProcessAsUserW(user_token,\r\n nullptr,\r\n const_cast<LPWSTR>(command_line.c_str()),\r\n nullptr,\r\n nullptr,\r\n FALSE,\r\n 0,\r\n nullptr,\r\n nullptr,\r\n &startup_info,\r\n &process_info))\r\n {\r\n LOG(ERROR) << \"CreateProcessAsUserW() failed: \" << GetLastSystemErrorString();\r\n return false;\r\n }\r\n\r\n CloseHandle(process_info.hThread);\r\n CloseHandle(process_info.hProcess);\r\n\r\n return true;\r\n}\r\n\r\nstatic bool LaunchProcessInSession(uint32_t session_id,\r\n const std::wstring& input_channel_id,\r\n const std::wstring& output_channel_id)\r\n{\r\n std::wstring command_line;\r\n\r\n if (!GetPathW(PathKey::FILE_EXE, command_line))\r\n return false;\r\n\r\n command_line.append(L\" --run_mode=\");\r\n\r\n command_line.append(kDesktopSessionSwitch);\r\n\r\n command_line.append(L\" --input_channel_id=\");\r\n command_line.append(input_channel_id);\r\n command_line.append(L\" --output_channel_id=\");\r\n command_line.append(output_channel_id);\r\n\r\n ScopedHandle session_token;\r\n\r\n if (!CreateSessionToken(session_id, session_token))\r\n return false;\r\n\r\n return CreateProcessWithToken(session_token, command_line);\r\n}\r\n\r\nvoid ConsoleSessionLauncher::Worker()\r\n{\r\n LaunchProcessInSession(session_id_, input_channel_id_, output_channel_id_);\r\n}\r\n\r\nvoid ConsoleSessionLauncher::OnStop()\r\n{\r\n \/\/ Nothing\r\n}\r\n\r\nvoid ConsoleSessionLauncher::ExecuteService(uint32_t session_id,\r\n const std::wstring& input_channel_id,\r\n const std::wstring& output_channel_id)\r\n{\r\n session_id_ = session_id;\r\n input_channel_id_ = input_channel_id;\r\n output_channel_id_ = output_channel_id;\r\n\r\n Run();\r\n\r\n ServiceManager(ServiceName()).Remove();\r\n}\r\n\r\n\/\/ static\r\nbool ConsoleSessionLauncher::LaunchSession(uint32_t session_id,\r\n const std::wstring& input_channel_id,\r\n const std::wstring& output_channel_id)\r\n{\r\n std::wstring command_line;\r\n\r\n if (!GetPathW(PathKey::FILE_EXE, command_line))\r\n return false;\r\n\r\n command_line.append(L\" --input_channel_id=\");\r\n command_line.append(input_channel_id);\r\n command_line.append(L\" --output_channel_id=\");\r\n command_line.append(output_channel_id);\r\n\r\n if (!IsCallerHasAdminRights())\r\n {\r\n command_line.append(L\" --run_mode=\");\r\n command_line.append(kDesktopSessionSwitch);\r\n\r\n ScopedHandle token;\r\n\r\n if (!CopyProcessToken(TOKEN_ALL_ACCESS, token))\r\n return false;\r\n\r\n return CreateProcessWithToken(token, command_line);\r\n }\r\n else\r\n {\r\n typedef BOOL(WINAPI *ProcessIdToSessionIdFn)(DWORD, DWORD*);\r\n\r\n HMODULE kernel32_module = GetModuleHandleW(L\"kernel32.dll\");\r\n CHECK(kernel32_module);\r\n\r\n ProcessIdToSessionIdFn process_id_to_session_id =\r\n reinterpret_cast<ProcessIdToSessionIdFn>(\r\n GetProcAddress(kernel32_module, \"ProcessIdToSessionId\"));\r\n CHECK(process_id_to_session_id);\r\n\r\n DWORD current_process_session_id;\r\n\r\n if (!process_id_to_session_id(GetCurrentProcessId(), ¤t_process_session_id))\r\n {\r\n LOG(WARNING) << \"ProcessIdToSessionId() failed: \" << GetLastSystemErrorString();\r\n return false;\r\n }\r\n\r\n \/\/ If the current process is started not in session 0 (not as a service),\r\n \/\/ then we create a service to start the process in the required session.\r\n if (!IsWindowsVistaOrGreater() || current_process_session_id != 0)\r\n {\r\n std::wstring service_id =\r\n ServiceManager::GenerateUniqueServiceId();\r\n\r\n std::wstring unique_short_name =\r\n ServiceManager::CreateUniqueServiceName(kServiceShortName, service_id);\r\n\r\n std::wstring unique_full_name =\r\n ServiceManager::CreateUniqueServiceName(kServiceFullName, service_id);\r\n\r\n command_line.append(L\" --run_mode=\");\r\n command_line.append(kDesktopSessionLauncherSwitch);\r\n command_line.append(L\" --session_id=\");\r\n command_line.append(std::to_wstring(session_id));\r\n\r\n command_line.append(L\" --service_id=\");\r\n command_line.append(service_id);\r\n\r\n \/\/ Install the service in the system.\r\n ServiceManager manager(ServiceManager::Create(command_line,\r\n unique_full_name,\r\n unique_short_name));\r\n\r\n \/\/ If the service was not installed.\r\n if (!manager.IsValid())\r\n return false;\r\n\r\n return manager.Start();\r\n }\r\n else \/\/ The code is executed from the service.\r\n {\r\n \/\/ Start the process directly.\r\n return LaunchProcessInSession(session_id, input_channel_id, output_channel_id);\r\n }\r\n }\r\n}\r\n\r\n} \/\/ namespace aspia\r\n<commit_msg>- Getting session id moved to separate function<commit_after>\/\/\r\n\/\/ PROJECT: Aspia Remote Desktop\r\n\/\/ FILE: host\/console_session_launcher.cc\r\n\/\/ LICENSE: See top-level directory\r\n\/\/ PROGRAMMERS: Dmitry Chapyshev (dmitry@aspia.ru)\r\n\/\/\r\n\r\n#include \"host\/console_session_launcher.h\"\r\n\r\n#include <userenv.h>\r\n#include <wtsapi32.h>\r\n#include <string>\r\n\r\n#include \"base\/version_helpers.h\"\r\n#include \"base\/process_helpers.h\"\r\n#include \"base\/service_manager.h\"\r\n#include \"base\/scoped_object.h\"\r\n#include \"base\/scoped_wts_memory.h\"\r\n#include \"base\/scoped_impersonator.h\"\r\n#include \"base\/object_watcher.h\"\r\n#include \"base\/unicode.h\"\r\n#include \"base\/path.h\"\r\n#include \"base\/process.h\"\r\n#include \"base\/logging.h\"\r\n\r\nnamespace aspia {\r\n\r\nstatic const WCHAR kServiceShortName[] = L\"aspia-desktop-session-launcher\";\r\nstatic const WCHAR kServiceFullName[] = L\"Aspia Desktop Session Launcher\";\r\n\r\n\/\/ Name of the default session desktop.\r\nstatic WCHAR kDefaultDesktopName[] = L\"winsta0\\\\default\";\r\n\r\nConsoleSessionLauncher::ConsoleSessionLauncher(const std::wstring& service_id) :\r\n Service(ServiceManager::CreateUniqueServiceName(kServiceShortName, service_id))\r\n{\r\n \/\/ Nothing\r\n}\r\n\r\nstatic bool CopyProcessToken(DWORD desired_access, ScopedHandle& token_out)\r\n{\r\n ScopedHandle process_token;\r\n\r\n if (!OpenProcessToken(GetCurrentProcess(),\r\n TOKEN_DUPLICATE | desired_access,\r\n process_token.Recieve()))\r\n {\r\n LOG(ERROR) << \"OpenProcessToken() failed: \" << GetLastSystemErrorString();\r\n return false;\r\n }\r\n\r\n if (!DuplicateTokenEx(process_token,\r\n desired_access,\r\n nullptr,\r\n SecurityImpersonation,\r\n TokenPrimary,\r\n token_out.Recieve()))\r\n {\r\n LOG(ERROR) << \"DuplicateTokenEx() failed: \" << GetLastSystemErrorString();\r\n return false;\r\n }\r\n\r\n return true;\r\n}\r\n\r\n\/\/ Creates a copy of the current process with SE_TCB_NAME privilege enabled.\r\nstatic bool CreatePrivilegedToken(ScopedHandle& token_out)\r\n{\r\n ScopedHandle privileged_token;\r\n DWORD desired_access = TOKEN_ADJUST_PRIVILEGES | TOKEN_IMPERSONATE |\r\n TOKEN_DUPLICATE | TOKEN_QUERY;\r\n\r\n if (!CopyProcessToken(desired_access, privileged_token))\r\n return false;\r\n\r\n \/\/ Get the LUID for the SE_TCB_NAME privilege.\r\n TOKEN_PRIVILEGES state;\r\n state.PrivilegeCount = 1;\r\n state.Privileges[0].Attributes = SE_PRIVILEGE_ENABLED;\r\n\r\n if (!LookupPrivilegeValueW(nullptr, SE_TCB_NAME, &state.Privileges[0].Luid))\r\n {\r\n LOG(ERROR) << \"LookupPrivilegeValueW() failed: \" << GetLastSystemErrorString();\r\n return false;\r\n }\r\n\r\n \/\/ Enable the SE_TCB_NAME privilege.\r\n if (!AdjustTokenPrivileges(privileged_token, FALSE, &state, 0, nullptr, 0))\r\n {\r\n LOG(ERROR) << \"AdjustTokenPrivileges() failed: \" << GetLastSystemErrorString();\r\n return false;\r\n }\r\n\r\n token_out.Reset(privileged_token.Release());\r\n return true;\r\n}\r\n\r\n\/\/ Creates a copy of the current process token for the given |session_id| so\r\n\/\/ it can be used to launch a process in that session.\r\nstatic bool CreateSessionToken(uint32_t session_id, ScopedHandle& token_out)\r\n{\r\n ScopedHandle session_token;\r\n DWORD desired_access = TOKEN_ADJUST_DEFAULT | TOKEN_ADJUST_SESSIONID |\r\n TOKEN_ASSIGN_PRIMARY | TOKEN_DUPLICATE | TOKEN_QUERY;\r\n\r\n if (!CopyProcessToken(desired_access, session_token))\r\n return false;\r\n\r\n ScopedHandle privileged_token;\r\n\r\n if (!CreatePrivilegedToken(privileged_token))\r\n return false;\r\n\r\n {\r\n ScopedImpersonator impersonator;\r\n\r\n if (!impersonator.ImpersonateLoggedOnUser(privileged_token))\r\n return false;\r\n\r\n \/\/ Change the session ID of the token.\r\n DWORD new_session_id = session_id;\r\n if (!SetTokenInformation(session_token,\r\n TokenSessionId,\r\n &new_session_id,\r\n sizeof(new_session_id)))\r\n {\r\n LOG(ERROR) << \"SetTokenInformation() failed: \" << GetLastSystemErrorString();\r\n return false;\r\n }\r\n }\r\n\r\n token_out.Reset(session_token.Release());\r\n return true;\r\n}\r\n\r\nstatic bool CreateProcessWithToken(HANDLE user_token, const std::wstring& command_line)\r\n{\r\n PROCESS_INFORMATION process_info = { 0 };\r\n STARTUPINFOW startup_info = { 0 };\r\n\r\n startup_info.cb = sizeof(startup_info);\r\n startup_info.lpDesktop = kDefaultDesktopName;\r\n\r\n if (!CreateProcessAsUserW(user_token,\r\n nullptr,\r\n const_cast<LPWSTR>(command_line.c_str()),\r\n nullptr,\r\n nullptr,\r\n FALSE,\r\n 0,\r\n nullptr,\r\n nullptr,\r\n &startup_info,\r\n &process_info))\r\n {\r\n LOG(ERROR) << \"CreateProcessAsUserW() failed: \" << GetLastSystemErrorString();\r\n return false;\r\n }\r\n\r\n CloseHandle(process_info.hThread);\r\n CloseHandle(process_info.hProcess);\r\n\r\n return true;\r\n}\r\n\r\nstatic bool LaunchProcessInSession(uint32_t session_id,\r\n const std::wstring& input_channel_id,\r\n const std::wstring& output_channel_id)\r\n{\r\n std::wstring command_line;\r\n\r\n if (!GetPathW(PathKey::FILE_EXE, command_line))\r\n return false;\r\n\r\n command_line.append(L\" --run_mode=\");\r\n\r\n command_line.append(kDesktopSessionSwitch);\r\n\r\n command_line.append(L\" --input_channel_id=\");\r\n command_line.append(input_channel_id);\r\n command_line.append(L\" --output_channel_id=\");\r\n command_line.append(output_channel_id);\r\n\r\n ScopedHandle session_token;\r\n\r\n if (!CreateSessionToken(session_id, session_token))\r\n return false;\r\n\r\n return CreateProcessWithToken(session_token, command_line);\r\n}\r\n\r\nvoid ConsoleSessionLauncher::Worker()\r\n{\r\n LaunchProcessInSession(session_id_, input_channel_id_, output_channel_id_);\r\n}\r\n\r\nvoid ConsoleSessionLauncher::OnStop()\r\n{\r\n \/\/ Nothing\r\n}\r\n\r\nvoid ConsoleSessionLauncher::ExecuteService(uint32_t session_id,\r\n const std::wstring& input_channel_id,\r\n const std::wstring& output_channel_id)\r\n{\r\n session_id_ = session_id;\r\n input_channel_id_ = input_channel_id;\r\n output_channel_id_ = output_channel_id;\r\n\r\n Run();\r\n\r\n ServiceManager(ServiceName()).Remove();\r\n}\r\n\r\nstatic bool GetSessionIdForCurrentProcess(DWORD& session_id)\r\n{\r\n typedef BOOL(WINAPI *ProcessIdToSessionIdFn)(DWORD, DWORD*);\r\n\r\n HMODULE kernel32_module = GetModuleHandleW(L\"kernel32.dll\");\r\n if (!kernel32_module)\r\n {\r\n LOG(ERROR) << \"Failed to get kernel32.dll module handle\";\r\n return false;\r\n }\r\n\r\n ProcessIdToSessionIdFn process_id_to_session_id =\r\n reinterpret_cast<ProcessIdToSessionIdFn>(\r\n GetProcAddress(kernel32_module, \"ProcessIdToSessionId\"));\r\n if (!process_id_to_session_id)\r\n {\r\n LOG(ERROR) << \"Failed to load ProcessIdToSessionId function\";\r\n return false;\r\n }\r\n\r\n if (!process_id_to_session_id(GetCurrentProcessId(), &session_id))\r\n {\r\n LOG(ERROR) << \"ProcessIdToSessionId() failed: \"\r\n << GetLastSystemErrorString();\r\n return false;\r\n }\r\n\r\n return true;\r\n}\r\n\r\n\/\/ static\r\nbool ConsoleSessionLauncher::LaunchSession(uint32_t session_id,\r\n const std::wstring& input_channel_id,\r\n const std::wstring& output_channel_id)\r\n{\r\n std::wstring command_line;\r\n\r\n if (!GetPathW(PathKey::FILE_EXE, command_line))\r\n return false;\r\n\r\n command_line.append(L\" --input_channel_id=\");\r\n command_line.append(input_channel_id);\r\n command_line.append(L\" --output_channel_id=\");\r\n command_line.append(output_channel_id);\r\n\r\n if (!IsCallerHasAdminRights())\r\n {\r\n command_line.append(L\" --run_mode=\");\r\n command_line.append(kDesktopSessionSwitch);\r\n\r\n ScopedHandle token;\r\n\r\n if (!CopyProcessToken(TOKEN_ALL_ACCESS, token))\r\n return false;\r\n\r\n return CreateProcessWithToken(token, command_line);\r\n }\r\n else\r\n {\r\n DWORD current_process_session_id;\r\n\r\n if (!GetSessionIdForCurrentProcess(current_process_session_id))\r\n return false;\r\n\r\n \/\/ If the current process is started not in session 0 (not as a service),\r\n \/\/ then we create a service to start the process in the required session.\r\n if (!IsWindowsVistaOrGreater() || current_process_session_id != 0)\r\n {\r\n std::wstring service_id =\r\n ServiceManager::GenerateUniqueServiceId();\r\n\r\n std::wstring unique_short_name =\r\n ServiceManager::CreateUniqueServiceName(kServiceShortName, service_id);\r\n\r\n std::wstring unique_full_name =\r\n ServiceManager::CreateUniqueServiceName(kServiceFullName, service_id);\r\n\r\n command_line.append(L\" --run_mode=\");\r\n command_line.append(kDesktopSessionLauncherSwitch);\r\n command_line.append(L\" --session_id=\");\r\n command_line.append(std::to_wstring(session_id));\r\n\r\n command_line.append(L\" --service_id=\");\r\n command_line.append(service_id);\r\n\r\n \/\/ Install the service in the system.\r\n ServiceManager manager(ServiceManager::Create(command_line,\r\n unique_full_name,\r\n unique_short_name));\r\n\r\n \/\/ If the service was not installed.\r\n if (!manager.IsValid())\r\n return false;\r\n\r\n return manager.Start();\r\n }\r\n else \/\/ The code is executed from the service.\r\n {\r\n \/\/ Start the process directly.\r\n return LaunchProcessInSession(session_id, input_channel_id, output_channel_id);\r\n }\r\n }\r\n}\r\n\r\n} \/\/ namespace aspia\r\n<|endoftext|>"} {"text":"<commit_before>\/\/ main.cpp: Santiago Arias\n\/\/ Description: HW4 the HEX program\n\/\/ c++11\n\/\/ to compile: g++ -std=c++11 graph.cpp shortest_path.cpp main.cpp;\n#include <iostream>\n\n#include \"graph.h\"\n#include \"shortest_path.h\"\n\nusing namespace std;\n\nint main(){\n cout << \"HW 4\" << endl;\n}\n<commit_msg>starting the hex board<commit_after>\/\/ main.cpp: Santiago Arias\n\/\/ Description: HW4 the HEX program\n\/\/ c++11\n\/\/ to compile: g++ -std=c++11 graph.cpp shortest_path.cpp main.cpp;\n#include <iostream>\n\n#include \"graph.h\"\n#include \"shortest_path.h\"\n\nusing namespace std;\n\nint main(){\n cout << \"HW 4\" << endl;\n int size = 7;\n\n string space = \"\";\n for(int j = 0; j < 7; j++){\n cout << space;\n for(int i = 0; i < 7; i++){\n cout << \" . \";\n if(i != 6)\n\tcout << \" - \";\n }\n cout << endl;\n if(j != 6){\n space += \" \";\n cout << space;\n cout << \" \\\\ \";\n for(int i = 0; i < 6; i++){\n\tcout << \" \/ \" << \"\\\\ \";\n }\n cout << endl;\n space += \" \";\n }\n }\n cout << endl << endl;\n\/\/ . - . - . - . - .\n\/\/ \\ \/ \\ \n\n}\n<|endoftext|>"} {"text":"<commit_before>#include <catch.hpp>\r\n#include <memory>\r\n\r\n#include \"GCodeWriter.hpp\"\r\n#include \"test_options.hpp\"\r\n\r\nusing namespace Slic3r;\r\nusing namespace std::literals::string_literals;\r\n\r\nSCENARIO(\"lift() is not ignored after unlift() at large values of Z\", \"[!mayfail]\") {\r\n GIVEN(\"A config from a file and a single extruder.\")\r\n auto writer {std::make_unique(GCodeWriter())}; \/\/ ensure cleanup later\r\n auto& config {writer->config};\r\n config.set_defaults();\r\n config.load(std::string(testfile_dir) + \"test_gcodewriter\/config_lift_unlift.ini\"s);\r\n\r\n std::vector<unsigned int> extruder_ids {0};\r\n writer->set_extruders(extruder_ids);\r\n writer->set_extruder(0);\r\n\r\n double trouble_Z = 9007199254740992;\r\n WHEN(\"Z is set to 9007199254740992\") {\r\n writer->travel_to_z(trouble_Z);\r\n AND_WHEN(\"GcodeWriter::Lift() is called\") {\r\n REQUIRE(writer->lift().size() > 0);\r\n AND_WHEN(\"Z is moved post-lift to the same delta as the config Z lift\") {\r\n writer->travel_to_z(trouble_z + config.retract_lift);\r\n AND_WHEN(\"GCodeWriter::Lift() is called after GCodeWriter::Unlift()\") {\r\n REQUIRE(writer->unlift().size() > 0);\r\n THEN(\"GCodeWriter::Lift() emits gcode.\") {\r\n REQUIRE(writer->lift().size() > 0);\r\n }\r\n }\r\n }\r\n }\r\n }\r\n}\r\n<commit_msg>Fall back to not using make::unique for now<commit_after>#include <catch.hpp>\r\n#include <memory>\r\n\r\n#include \"GCodeWriter.hpp\"\r\n#include \"test_options.hpp\"\r\n\r\nusing namespace Slic3r;\r\nusing namespace std::literals::string_literals;\r\n\r\nSCENARIO(\"lift() is not ignored after unlift() at large values of Z\", \"[!mayfail]\") {\r\n GIVEN(\"A config from a file and a single extruder.\")\r\n auto* writer {new GCodeWriter()};\r\n auto& config {writer->config};\r\n config.set_defaults();\r\n config.load(std::string(testfile_dir) + \"test_gcodewriter\/config_lift_unlift.ini\"s);\r\n\r\n std::vector<unsigned int> extruder_ids {0};\r\n writer->set_extruders(extruder_ids);\r\n writer->set_extruder(0);\r\n\r\n WHEN(\"Z is set to 9007199254740992\") {\r\n double trouble_Z = 9007199254740992;\r\n writer->travel_to_z(trouble_Z);\r\n AND_WHEN(\"GcodeWriter::Lift() is called\") {\r\n REQUIRE(writer->lift().size() > 0);\r\n AND_WHEN(\"Z is moved post-lift to the same delta as the config Z lift\") {\r\n REQUIRE(writer->travel_to_z(trouble_z + config.retract_lift).size() == 0);\r\n AND_WHEN(\"GCodeWriter::Lift() is called after GCodeWriter::Unlift()\") {\r\n REQUIRE(writer->unlift().size() > 0);\r\n THEN(\"GCodeWriter::Lift() emits gcode.\") {\r\n REQUIRE(writer->lift().size() > 0);\r\n }\r\n }\r\n }\r\n }\r\n }\r\n delete writer;\r\n}\r\n<|endoftext|>"} {"text":"<commit_before>#include \"Base64.h\"\n\nconst char b64_alphabet[] = \"ABCDEFGHIJKLMNOPQRSTUVWXYZ\"\n\t\t\"abcdefghijklmnopqrstuvwxyz\"\n\t\t\"0123456789+\/\";\n\n\/* 'Private' declarations *\/\ninline void a3_to_a4(unsigned char * a4, unsigned char * a3);\ninline void a4_to_a3(unsigned char * a3, unsigned char * a4);\ninline unsigned char b64_lookup(char c);\n\nint base64_encode(char *output, char *input, int inputLen) {\n\tint i = 0, j = 0;\n\tint encLen = 0;\n\tunsigned char a3[3];\n\tunsigned char a4[4];\n\n\twhile(inputLen--) {\n\t\ta3[i++] = *(input++);\n\t\tif(i == 3) {\n\t\t\ta3_to_a4(a4, a3);\n\n\t\t\tfor(i = 0; i < 4; i++) {\n\t\t\t\toutput[encLen++] = b64_alphabet[a4[i]];\n\t\t\t}\n\n\t\t\ti = 0;\n\t\t}\n\t}\n\n\tif(i) {\n\t\tfor(j = i; j < 3; j++) {\n\t\t\ta3[j] = '\\0';\n\t\t}\n\n\t\ta3_to_a4(a4, a3);\n\n\t\tfor(j = 0; j < i + 1; j++) {\n\t\t\toutput[encLen++] = b64_alphabet[a4[j]];\n\t\t}\n\n\t\twhile((i++ < 3)) {\n\t\t\toutput[encLen++] = '=';\n\t\t}\n\t}\n\toutput[encLen] = '\\0';\n\treturn encLen;\n}\n\nint base64_decode(char * output, char * input, int inputLen) {\n\tint i = 0, j = 0;\n\tint decLen = 0;\n\tunsigned char a3[3];\n\tunsigned char a4[4];\n\n\n\twhile (inputLen--) {\n\t\tif(*input == '=') {\n\t\t\tbreak;\n\t\t}\n\n\t\ta4[i++] = *(input++);\n\t\tif (i == 4) {\n\t\t\tfor (i = 0; i <4; i++) {\n\t\t\t\ta4[i] = b64_lookup(a4[i]);\n\t\t\t}\n\n\t\t\ta4_to_a3(a3,a4);\n\n\t\t\tfor (i = 0; i < 3; i++) {\n\t\t\t\toutput[decLen++] = a3[i];\n\t\t\t}\n\t\t\ti = 0;\n\t\t}\n\t}\n\n\tif (i) {\n\t\tfor (j = i; j < 4; j++) {\n\t\t\ta4[j] = '\\0';\n\t\t}\n\n\t\tfor (j = 0; j <4; j++) {\n\t\t\ta4[j] = b64_lookup(a4[j]);\n\t\t}\n\n\t\ta4_to_a3(a3,a4);\n\n\t\tfor (j = 0; j < i - 1; j++) {\n\t\t\toutput[decLen++] = a3[j];\n\t\t}\n\t}\n\toutput[decLen] = '\\0';\n\treturn decLen;\n}\n\nint base64_enc_len(int plainLen) {\n\tint n = plainLen;\n\treturn (n + 2 - ((n + 2) % 3)) \/ 3 * 4;\n}\n\nint base64_dec_len(char * input, int inputLen) {\n\tint i = 0;\n\tint numEq = 0;\n\tfor(i = inputLen - 1; input[i] == '='; i--) {\n\t\tnumEq++;\n\t}\n\n\treturn ((6 * inputLen) \/ 8) - numEq;\n}\n\ninline void a3_to_a4(unsigned char * a4, unsigned char * a3) {\n\ta4[0] = (a3[0] & 0xfc) >> 2;\n\ta4[1] = ((a3[0] & 0x03) << 4) + ((a3[1] & 0xf0) >> 4);\n\ta4[2] = ((a3[1] & 0x0f) << 2) + ((a3[2] & 0xc0) >> 6);\n\ta4[3] = (a3[2] & 0x3f);\n}\n\ninline void a4_to_a3(unsigned char * a3, unsigned char * a4) {\n\ta3[0] = (a4[0] << 2) + ((a4[1] & 0x30) >> 4);\n\ta3[1] = ((a4[1] & 0xf) << 4) + ((a4[2] & 0x3c) >> 2);\n\ta3[2] = ((a4[2] & 0x3) << 6) + a4[3];\n}\n\ninline unsigned char b64_lookup(char c) {\n\tif(c >='A' && c <='Z') return c - 'A';\n\tif(c >='a' && c <='z') return c - 71;\n\tif(c >='0' && c <='9') return c + 4;\n\tif(c == '+') return 62;\n\tif(c == '\/') return 63;\n\treturn -1;\n}\n<commit_msg>Moved the base 64 alphabet into PROGMEM to save ram<commit_after>#include \"Base64.h\"\n#include <avr\/pgmspace.h>\nconst char PROGMEM b64_alphabet[] = \"ABCDEFGHIJKLMNOPQRSTUVWXYZ\"\n\t\t\"abcdefghijklmnopqrstuvwxyz\"\n\t\t\"0123456789+\/\";\n\n\/* 'Private' declarations *\/\ninline void a3_to_a4(unsigned char * a4, unsigned char * a3);\ninline void a4_to_a3(unsigned char * a3, unsigned char * a4);\ninline unsigned char b64_lookup(char c);\n\nint base64_encode(char *output, char *input, int inputLen) {\n\tint i = 0, j = 0;\n\tint encLen = 0;\n\tunsigned char a3[3];\n\tunsigned char a4[4];\n\n\twhile(inputLen--) {\n\t\ta3[i++] = *(input++);\n\t\tif(i == 3) {\n\t\t\ta3_to_a4(a4, a3);\n\n\t\t\tfor(i = 0; i < 4; i++) {\n\t\t\t\toutput[encLen++] = pgm_read_byte(&b64_alphabet[a4[i]]);\n\t\t\t}\n\n\t\t\ti = 0;\n\t\t}\n\t}\n\n\tif(i) {\n\t\tfor(j = i; j < 3; j++) {\n\t\t\ta3[j] = '\\0';\n\t\t}\n\n\t\ta3_to_a4(a4, a3);\n\n\t\tfor(j = 0; j < i + 1; j++) {\n\t\t\toutput[encLen++] = pgm_read_byte(&b64_alphabet[a4[j]]);\n\t\t}\n\n\t\twhile((i++ < 3)) {\n\t\t\toutput[encLen++] = '=';\n\t\t}\n\t}\n\toutput[encLen] = '\\0';\n\treturn encLen;\n}\n\nint base64_decode(char * output, char * input, int inputLen) {\n\tint i = 0, j = 0;\n\tint decLen = 0;\n\tunsigned char a3[3];\n\tunsigned char a4[4];\n\n\n\twhile (inputLen--) {\n\t\tif(*input == '=') {\n\t\t\tbreak;\n\t\t}\n\n\t\ta4[i++] = *(input++);\n\t\tif (i == 4) {\n\t\t\tfor (i = 0; i <4; i++) {\n\t\t\t\ta4[i] = b64_lookup(a4[i]);\n\t\t\t}\n\n\t\t\ta4_to_a3(a3,a4);\n\n\t\t\tfor (i = 0; i < 3; i++) {\n\t\t\t\toutput[decLen++] = a3[i];\n\t\t\t}\n\t\t\ti = 0;\n\t\t}\n\t}\n\n\tif (i) {\n\t\tfor (j = i; j < 4; j++) {\n\t\t\ta4[j] = '\\0';\n\t\t}\n\n\t\tfor (j = 0; j <4; j++) {\n\t\t\ta4[j] = b64_lookup(a4[j]);\n\t\t}\n\n\t\ta4_to_a3(a3,a4);\n\n\t\tfor (j = 0; j < i - 1; j++) {\n\t\t\toutput[decLen++] = a3[j];\n\t\t}\n\t}\n\toutput[decLen] = '\\0';\n\treturn decLen;\n}\n\nint base64_enc_len(int plainLen) {\n\tint n = plainLen;\n\treturn (n + 2 - ((n + 2) % 3)) \/ 3 * 4;\n}\n\nint base64_dec_len(char * input, int inputLen) {\n\tint i = 0;\n\tint numEq = 0;\n\tfor(i = inputLen - 1; input[i] == '='; i--) {\n\t\tnumEq++;\n\t}\n\n\treturn ((6 * inputLen) \/ 8) - numEq;\n}\n\ninline void a3_to_a4(unsigned char * a4, unsigned char * a3) {\n\ta4[0] = (a3[0] & 0xfc) >> 2;\n\ta4[1] = ((a3[0] & 0x03) << 4) + ((a3[1] & 0xf0) >> 4);\n\ta4[2] = ((a3[1] & 0x0f) << 2) + ((a3[2] & 0xc0) >> 6);\n\ta4[3] = (a3[2] & 0x3f);\n}\n\ninline void a4_to_a3(unsigned char * a3, unsigned char * a4) {\n\ta3[0] = (a4[0] << 2) + ((a4[1] & 0x30) >> 4);\n\ta3[1] = ((a4[1] & 0xf) << 4) + ((a4[2] & 0x3c) >> 2);\n\ta3[2] = ((a4[2] & 0x3) << 6) + a4[3];\n}\n\ninline unsigned char b64_lookup(char c) {\n\tif(c >='A' && c <='Z') return c - 'A';\n\tif(c >='a' && c <='z') return c - 71;\n\tif(c >='0' && c <='9') return c + 4;\n\tif(c == '+') return 62;\n\tif(c == '\/') return 63;\n\treturn -1;\n}\n<|endoftext|>"} {"text":"<commit_before>#include \"interpreter.h\"\n\n#include \"details\/autoconfigurer.h\"\n\n#include <QtCore\/QDebug>\n\nusing namespace qReal;\nusing namespace interpreters::robots;\nusing namespace interpreters::robots::details;\n\nconst Id startingElementType = Id(\"RobotsMetamodel\", \"RobotsDiagram\", \"InitialNode\");\nconst Id startingElementType1 = Id(\"RobotsMetamodel\", \"RobotsDiagram\", \"InitialBlock\");\n\nInterpreter::Interpreter()\n\t: mGraphicalModelApi(NULL)\n\t, mLogicalModelApi(NULL)\n\t, mInterpretersInterface(NULL)\n\t, mState(idle)\n\t, mRobotModel(new RobotModel())\n\t, mBlocksTable(NULL)\n\t, mBluetoothRobotCommunication(NULL)\n{\n\tmParser = NULL;\n\tmBlocksTable = NULL;\n\tmTimer = new QTimer();\n\n\tmD2RobotModel = new d2Model::D2RobotModel();\n\tmD2ModelWidget = mD2RobotModel->createModelWidget();\n}\n\nvoid Interpreter::init(GraphicalModelAssistInterface const &graphicalModelApi\n\t, LogicalModelAssistInterface const &logicalModelApi\n\t, qReal::gui::MainWindowInterpretersInterface &interpretersInterface)\n{\n\tmGraphicalModelApi = &graphicalModelApi;\n\tmLogicalModelApi = &logicalModelApi;\n\tmInterpretersInterface = &interpretersInterface;\n\n\tmParser = new RobotsBlockParser(mInterpretersInterface->errorReporter());\n\tmBlocksTable = new BlocksTable(graphicalModelApi, logicalModelApi, mRobotModel, mInterpretersInterface->errorReporter(), mParser);\n\n\tQString const comPort = SettingsManager::instance()->value(\"bluetoothPortName\", \"\").toString();\n\tmBluetoothRobotCommunication = new BluetoothRobotCommunication(comPort);\n\trobotModelType::robotModelTypeEnum const modelType = static_cast<robotModelType::robotModelTypeEnum>(SettingsManager::value(\"robotModel\", \"1\").toInt());\n\tsetRobotImplementation(modelType, mBluetoothRobotCommunication);\n}\n\nInterpreter::~Interpreter()\n{\n\tforeach (Thread * const thread, mThreads)\n\t\tdelete thread;\n\tdelete mBlocksTable;\n}\n\nvoid Interpreter::interpret()\n{\n\tmInterpretersInterface->errorReporter()->clear();\n\n\tId const ¤tDiagramId = mInterpretersInterface->activeDiagram();\n\n\tif (!mConnected) {\n\t\tmInterpretersInterface->errorReporter()->addInformation(tr(\"No connection to robot\"));\n\t\treturn;\n\t}\n\tif (mState == interpreting) {\n\t\tmInterpretersInterface->errorReporter()->addInformation(tr(\"Interpreter is already running\"));\n\t\treturn;\n\t}\n\n\tmState = interpreting;\n\n\tmBlocksTable->setIdleForBlocks();\n\n\tId const startingElement = findStartingElement(currentDiagramId);\n\tif (startingElement == Id()) {\n\t\tmInterpretersInterface->errorReporter()->addError(tr(\"No entry point found, please add Initial Node to a diagram\"));\n\t\treturn;\n\t}\n\n\tAutoconfigurer configurer(*mGraphicalModelApi, mBlocksTable, mInterpretersInterface->errorReporter(), mRobotModel);\n\tif (!configurer.configure(currentDiagramId))\n\t\treturn;\n\n\tif (dynamic_cast<UnrealRobotModelImplementation*>(mRobotModel->robotImpl()))\n\t\tshowD2ModelWidget(true);\n\n\tThread * const initialThread = new Thread(*mInterpretersInterface, *mBlocksTable, startingElement);\n\taddThread(initialThread);\n}\n\nvoid Interpreter::stop()\n{\n\tmRobotModel->stopRobot();\n\tmState = idle;\n\tforeach (Thread *thread, mThreads)\n\t\tdelete thread;\n\tmBlocksTable->setFailure();\n\t\/*mBlocksTable->clear();\n\tmThreads.clear();\n\tmTimer->stop();*\/\n}\n\nvoid Interpreter::stopRobot()\n{\n\tstop();\n}\n\nvoid Interpreter::showD2ModelWidget(bool isVisible)\n{\n\tmD2ModelWidget->init(isVisible);\n}\n\nvoid Interpreter::setD2ModelWidgetActions(QAction *runAction, QAction *stopAction)\n{\n\tmD2ModelWidget->setD2ModelWidgetActions(runAction, stopAction);\n}\n\nvoid Interpreter::setRobotImplementation(robotModelType::robotModelTypeEnum implementationType, RobotCommunicationInterface * const robotCommunicationInterface)\n{\n\tdisconnect(&mRobotModel->robotImpl(), SIGNAL(connected(bool)), this, SLOT(connectedSlot(bool)));\n\tmConnected = false;\n\tif (implementationType != robotModelType::real)\n\t\tmConnected = true;\n\trobotImplementations::AbstractRobotModelImplementation *robotImpl =\n\t\t\trobotImplementations::AbstractRobotModelImplementation::robotModel(implementationType, robotCommunicationInterface, mD2RobotModel);\n\tsetRobotImplementation(robotImpl);\n\tconnect(robotImpl, SIGNAL(connected(bool)), this, SLOT(connectedSlot(bool)));\n}\n\nvoid Interpreter::connectedSlot(bool success)\n{\n\tif (success) {\n\t\tmConnected = true;\n\t\tmInterpretersInterface->errorReporter()->addInformation(tr(\"Connected successfully\"));\n\t} else {\n\t\tmConnected = false;\n\t\tmInterpretersInterface->errorReporter()->addError(tr(\"Can't connect to a robot.\"));\n\t}\n}\n\nId const Interpreter::findStartingElement(Id const &diagram) const\n{\n\tIdList const children = mGraphicalModelApi->graphicalRepoApi().children(diagram);\n\n\tforeach (Id const child, children) {\n\t\tif (child.type() == startingElementType || child.type() == startingElementType1)\n\t\t\treturn child;\n\t}\n\n\treturn Id();\n}\n\nvoid Interpreter::threadStopped()\n{\n\tThread *thread = static_cast<Thread *>(sender());\n\n\tmThreads.removeAll(thread);\n\tdelete thread;\n\n\tif (mThreads.isEmpty())\n\t\tstop();\n}\n\nvoid Interpreter::newThread(details::blocks::Block * const startBlock)\n{\n\tThread * const thread = new Thread(*mInterpretersInterface, *mBlocksTable, startBlock->id());\n\taddThread(thread);\n}\n\nvoid Interpreter::configureSensors(sensorType::SensorTypeEnum const &port1\n\t\t, sensorType::SensorTypeEnum const &port2\n\t\t, sensorType::SensorTypeEnum const &port3\n\t\t, sensorType::SensorTypeEnum const &port4)\n{\n\tmRobotModel->configureSensors(port1, port2, port3, port4);\n}\n\nvoid Interpreter::addThread(details::Thread * const thread)\n{\n\tmThreads.append(thread);\n\tconnect(thread, SIGNAL(stopped()), this, SLOT(threadStopped()));\n\tconnect(thread, SIGNAL(newThread(details::blocks::Block*const)), this, SLOT(newThread(details::blocks::Block*const)));\n\n\tthread->interpret();\n}\n\ninterpreters::robots::details::RobotModel *Interpreter::robotModel()\n{\n\treturn mRobotModel;\n}\n\nvoid Interpreter::setRobotModel(details::RobotModel * const robotModel)\n{\n\tmRobotModel = robotModel;\n}\n\nvoid Interpreter::setRobotImplementation(details::robotImplementations::AbstractRobotModelImplementation *robotImpl)\n{\n\tmRobotModel->setRobotImplementation(robotImpl);\n\tif (robotImpl)\n\t\tconnect(&mRobotModel->robotImpl(), SIGNAL(connected(bool)), this, SLOT(runTimer()));\n}\n\nvoid Interpreter::runTimer()\n{\n\tmTimer->start(1000);\n\tconnect(mTimer, SIGNAL(timeout()), this, SLOT(readSensorValues()));\n\tif (mRobotModel->sensor(inputPort::port1)) {\n\t\tconnect(mRobotModel->sensor(inputPort::port1)->sensorImpl(), SIGNAL(response(int)), this, SLOT(responseSlot1(int)));\n\t\tconnect(mRobotModel->sensor(inputPort::port1)->sensorImpl(), SIGNAL(failure()), this, SLOT(slotFailure()));\n\t}\n\tif (mRobotModel->sensor(inputPort::port2)) {\n\t\tconnect(mRobotModel->sensor(inputPort::port2)->sensorImpl(), SIGNAL(response(int)), this, SLOT(responseSlot2(int)));\n\t\tconnect(mRobotModel->sensor(inputPort::port2)->sensorImpl(), SIGNAL(failure()), this, SLOT(slotFailure()));\n\t}\n\tif (mRobotModel->sensor(inputPort::port3)) {\n\t\tconnect(mRobotModel->sensor(inputPort::port3)->sensorImpl(), SIGNAL(response(int)), this, SLOT(responseSlot3(int)));\n\t\tconnect(mRobotModel->sensor(inputPort::port3)->sensorImpl(), SIGNAL(failure()), this, SLOT(slotFailure()));\n\t}\n\tif (mRobotModel->sensor(inputPort::port4)) {\n\t\tconnect(mRobotModel->sensor(inputPort::port4)->sensorImpl(), SIGNAL(response(int)), this, SLOT(responseSlot4(int)));\n\t\tconnect(mRobotModel->sensor(inputPort::port4)->sensorImpl(), SIGNAL(failure()), this, SLOT(slotFailure()));\n\t}\n}\n\nvoid Interpreter::readSensorValues()\n{\n\tif (mState == idle)\n\t\treturn;\n\n\tif (mRobotModel->sensor(inputPort::port1))\n\t\tmRobotModel->sensor(inputPort::port1)->read();\n\tif (mRobotModel->sensor(inputPort::port2))\n\t\tmRobotModel->sensor(inputPort::port2)->read();\n\tif (mRobotModel->sensor(inputPort::port3))\n\t\tmRobotModel->sensor(inputPort::port3)->read();\n\tif (mRobotModel->sensor(inputPort::port4))\n\t\tmRobotModel->sensor(inputPort::port4)->read();\n}\n\nvoid Interpreter::slotFailure()\n{\n\tqDebug() << \"slotFailure\";\n}\n\nvoid Interpreter::responseSlot1(int sensorValue)\n{\n\tupdateSensorValues(QObject::tr(\"Sensor1\"), sensorValue);\n}\n\nvoid Interpreter::responseSlot2(int sensorValue)\n{\n\tupdateSensorValues(QObject::tr(\"Sensor2\"), sensorValue);\n}\n\nvoid Interpreter::responseSlot3(int sensorValue)\n{\n\tupdateSensorValues(QObject::tr(\"Sensor3\"), sensorValue);\n}\n\nvoid Interpreter::responseSlot4(int sensorValue)\n{\n\tupdateSensorValues(QObject::tr(\"Sensor4\"), sensorValue);\n}\n\nvoid Interpreter::updateSensorValues(const QString &sensorVariableName, int sensorValue)\n{\n\t(*(mParser->getVariables()))[sensorVariableName] = Number(sensorValue, Number::intType);\n\/\/\tqDebug() << sensorVariableName << sensorValue;\n}\n\nvoid Interpreter::connectToRobot()\n{\n\tmRobotModel->init();\n}\n\nvoid Interpreter::setBluetoothPortName(QString const &portName)\n{\n\tmBluetoothRobotCommunication->setPortName(portName);\n}\n\nvoid Interpreter::setRobotModelType(robotModelType::robotModelTypeEnum robotModelType)\n{\n\tsetRobotImplementation(robotModelType, mBluetoothRobotCommunication);\n}\n<commit_msg>build fixed<commit_after>#include \"interpreter.h\"\n\n#include \"details\/autoconfigurer.h\"\n#include \"details\/robotImplementations\/unrealRobotModelImplementation.h\"\n\n#include <QtCore\/QDebug>\n\nusing namespace qReal;\nusing namespace interpreters::robots;\nusing namespace interpreters::robots::details;\n\nconst Id startingElementType = Id(\"RobotsMetamodel\", \"RobotsDiagram\", \"InitialNode\");\nconst Id startingElementType1 = Id(\"RobotsMetamodel\", \"RobotsDiagram\", \"InitialBlock\");\n\nInterpreter::Interpreter()\n\t: mGraphicalModelApi(NULL)\n\t, mLogicalModelApi(NULL)\n\t, mInterpretersInterface(NULL)\n\t, mState(idle)\n\t, mRobotModel(new RobotModel())\n\t, mBlocksTable(NULL)\n\t, mBluetoothRobotCommunication(NULL)\n{\n\tmParser = NULL;\n\tmBlocksTable = NULL;\n\tmTimer = new QTimer();\n\n\tmD2RobotModel = new d2Model::D2RobotModel();\n\tmD2ModelWidget = mD2RobotModel->createModelWidget();\n}\n\nvoid Interpreter::init(GraphicalModelAssistInterface const &graphicalModelApi\n\t, LogicalModelAssistInterface const &logicalModelApi\n\t, qReal::gui::MainWindowInterpretersInterface &interpretersInterface)\n{\n\tmGraphicalModelApi = &graphicalModelApi;\n\tmLogicalModelApi = &logicalModelApi;\n\tmInterpretersInterface = &interpretersInterface;\n\n\tmParser = new RobotsBlockParser(mInterpretersInterface->errorReporter());\n\tmBlocksTable = new BlocksTable(graphicalModelApi, logicalModelApi, mRobotModel, mInterpretersInterface->errorReporter(), mParser);\n\n\tQString const comPort = SettingsManager::instance()->value(\"bluetoothPortName\", \"\").toString();\n\tmBluetoothRobotCommunication = new BluetoothRobotCommunication(comPort);\n\trobotModelType::robotModelTypeEnum const modelType = static_cast<robotModelType::robotModelTypeEnum>(SettingsManager::value(\"robotModel\", \"1\").toInt());\n\tsetRobotImplementation(modelType, mBluetoothRobotCommunication);\n}\n\nInterpreter::~Interpreter()\n{\n\tforeach (Thread * const thread, mThreads)\n\t\tdelete thread;\n\tdelete mBlocksTable;\n}\n\nvoid Interpreter::interpret()\n{\n\tmInterpretersInterface->errorReporter()->clear();\n\n\tId const ¤tDiagramId = mInterpretersInterface->activeDiagram();\n\n\tif (!mConnected) {\n\t\tmInterpretersInterface->errorReporter()->addInformation(tr(\"No connection to robot\"));\n\t\treturn;\n\t}\n\tif (mState == interpreting) {\n\t\tmInterpretersInterface->errorReporter()->addInformation(tr(\"Interpreter is already running\"));\n\t\treturn;\n\t}\n\n\tmState = interpreting;\n\n\tmBlocksTable->setIdleForBlocks();\n\n\tId const startingElement = findStartingElement(currentDiagramId);\n\tif (startingElement == Id()) {\n\t\tmInterpretersInterface->errorReporter()->addError(tr(\"No entry point found, please add Initial Node to a diagram\"));\n\t\treturn;\n\t}\n\n\tAutoconfigurer configurer(*mGraphicalModelApi, mBlocksTable, mInterpretersInterface->errorReporter(), mRobotModel);\n\tif (!configurer.configure(currentDiagramId))\n\t\treturn;\n\n\tif (dynamic_cast<robotImplementations::UnrealRobotModelImplementation*>(&(mRobotModel->robotImpl())))\n\t\tshowD2ModelWidget(true);\n\n\tThread * const initialThread = new Thread(*mInterpretersInterface, *mBlocksTable, startingElement);\n\taddThread(initialThread);\n}\n\nvoid Interpreter::stop()\n{\n\tmRobotModel->stopRobot();\n\tmState = idle;\n\tforeach (Thread *thread, mThreads)\n\t\tdelete thread;\n\tmBlocksTable->setFailure();\n\t\/*mBlocksTable->clear();\n\tmThreads.clear();\n\tmTimer->stop();*\/\n}\n\nvoid Interpreter::stopRobot()\n{\n\tstop();\n}\n\nvoid Interpreter::showD2ModelWidget(bool isVisible)\n{\n\tmD2ModelWidget->init(isVisible);\n}\n\nvoid Interpreter::setD2ModelWidgetActions(QAction *runAction, QAction *stopAction)\n{\n\tmD2ModelWidget->setD2ModelWidgetActions(runAction, stopAction);\n}\n\nvoid Interpreter::setRobotImplementation(robotModelType::robotModelTypeEnum implementationType, RobotCommunicationInterface * const robotCommunicationInterface)\n{\n\tdisconnect(&mRobotModel->robotImpl(), SIGNAL(connected(bool)), this, SLOT(connectedSlot(bool)));\n\tmConnected = false;\n\tif (implementationType != robotModelType::real)\n\t\tmConnected = true;\n\trobotImplementations::AbstractRobotModelImplementation *robotImpl =\n\t\t\trobotImplementations::AbstractRobotModelImplementation::robotModel(implementationType, robotCommunicationInterface, mD2RobotModel);\n\tsetRobotImplementation(robotImpl);\n\tconnect(robotImpl, SIGNAL(connected(bool)), this, SLOT(connectedSlot(bool)));\n}\n\nvoid Interpreter::connectedSlot(bool success)\n{\n\tif (success) {\n\t\tmConnected = true;\n\t\tmInterpretersInterface->errorReporter()->addInformation(tr(\"Connected successfully\"));\n\t} else {\n\t\tmConnected = false;\n\t\tmInterpretersInterface->errorReporter()->addError(tr(\"Can't connect to a robot.\"));\n\t}\n}\n\nId const Interpreter::findStartingElement(Id const &diagram) const\n{\n\tIdList const children = mGraphicalModelApi->graphicalRepoApi().children(diagram);\n\n\tforeach (Id const child, children) {\n\t\tif (child.type() == startingElementType || child.type() == startingElementType1)\n\t\t\treturn child;\n\t}\n\n\treturn Id();\n}\n\nvoid Interpreter::threadStopped()\n{\n\tThread *thread = static_cast<Thread *>(sender());\n\n\tmThreads.removeAll(thread);\n\tdelete thread;\n\n\tif (mThreads.isEmpty())\n\t\tstop();\n}\n\nvoid Interpreter::newThread(details::blocks::Block * const startBlock)\n{\n\tThread * const thread = new Thread(*mInterpretersInterface, *mBlocksTable, startBlock->id());\n\taddThread(thread);\n}\n\nvoid Interpreter::configureSensors(sensorType::SensorTypeEnum const &port1\n\t\t, sensorType::SensorTypeEnum const &port2\n\t\t, sensorType::SensorTypeEnum const &port3\n\t\t, sensorType::SensorTypeEnum const &port4)\n{\n\tmRobotModel->configureSensors(port1, port2, port3, port4);\n}\n\nvoid Interpreter::addThread(details::Thread * const thread)\n{\n\tmThreads.append(thread);\n\tconnect(thread, SIGNAL(stopped()), this, SLOT(threadStopped()));\n\tconnect(thread, SIGNAL(newThread(details::blocks::Block*const)), this, SLOT(newThread(details::blocks::Block*const)));\n\n\tthread->interpret();\n}\n\ninterpreters::robots::details::RobotModel *Interpreter::robotModel()\n{\n\treturn mRobotModel;\n}\n\nvoid Interpreter::setRobotModel(details::RobotModel * const robotModel)\n{\n\tmRobotModel = robotModel;\n}\n\nvoid Interpreter::setRobotImplementation(details::robotImplementations::AbstractRobotModelImplementation *robotImpl)\n{\n\tmRobotModel->setRobotImplementation(robotImpl);\n\tif (robotImpl)\n\t\tconnect(&mRobotModel->robotImpl(), SIGNAL(connected(bool)), this, SLOT(runTimer()));\n}\n\nvoid Interpreter::runTimer()\n{\n\tmTimer->start(1000);\n\tconnect(mTimer, SIGNAL(timeout()), this, SLOT(readSensorValues()));\n\tif (mRobotModel->sensor(inputPort::port1)) {\n\t\tconnect(mRobotModel->sensor(inputPort::port1)->sensorImpl(), SIGNAL(response(int)), this, SLOT(responseSlot1(int)));\n\t\tconnect(mRobotModel->sensor(inputPort::port1)->sensorImpl(), SIGNAL(failure()), this, SLOT(slotFailure()));\n\t}\n\tif (mRobotModel->sensor(inputPort::port2)) {\n\t\tconnect(mRobotModel->sensor(inputPort::port2)->sensorImpl(), SIGNAL(response(int)), this, SLOT(responseSlot2(int)));\n\t\tconnect(mRobotModel->sensor(inputPort::port2)->sensorImpl(), SIGNAL(failure()), this, SLOT(slotFailure()));\n\t}\n\tif (mRobotModel->sensor(inputPort::port3)) {\n\t\tconnect(mRobotModel->sensor(inputPort::port3)->sensorImpl(), SIGNAL(response(int)), this, SLOT(responseSlot3(int)));\n\t\tconnect(mRobotModel->sensor(inputPort::port3)->sensorImpl(), SIGNAL(failure()), this, SLOT(slotFailure()));\n\t}\n\tif (mRobotModel->sensor(inputPort::port4)) {\n\t\tconnect(mRobotModel->sensor(inputPort::port4)->sensorImpl(), SIGNAL(response(int)), this, SLOT(responseSlot4(int)));\n\t\tconnect(mRobotModel->sensor(inputPort::port4)->sensorImpl(), SIGNAL(failure()), this, SLOT(slotFailure()));\n\t}\n}\n\nvoid Interpreter::readSensorValues()\n{\n\tif (mState == idle)\n\t\treturn;\n\n\tif (mRobotModel->sensor(inputPort::port1))\n\t\tmRobotModel->sensor(inputPort::port1)->read();\n\tif (mRobotModel->sensor(inputPort::port2))\n\t\tmRobotModel->sensor(inputPort::port2)->read();\n\tif (mRobotModel->sensor(inputPort::port3))\n\t\tmRobotModel->sensor(inputPort::port3)->read();\n\tif (mRobotModel->sensor(inputPort::port4))\n\t\tmRobotModel->sensor(inputPort::port4)->read();\n}\n\nvoid Interpreter::slotFailure()\n{\n\tqDebug() << \"slotFailure\";\n}\n\nvoid Interpreter::responseSlot1(int sensorValue)\n{\n\tupdateSensorValues(QObject::tr(\"Sensor1\"), sensorValue);\n}\n\nvoid Interpreter::responseSlot2(int sensorValue)\n{\n\tupdateSensorValues(QObject::tr(\"Sensor2\"), sensorValue);\n}\n\nvoid Interpreter::responseSlot3(int sensorValue)\n{\n\tupdateSensorValues(QObject::tr(\"Sensor3\"), sensorValue);\n}\n\nvoid Interpreter::responseSlot4(int sensorValue)\n{\n\tupdateSensorValues(QObject::tr(\"Sensor4\"), sensorValue);\n}\n\nvoid Interpreter::updateSensorValues(const QString &sensorVariableName, int sensorValue)\n{\n\t(*(mParser->getVariables()))[sensorVariableName] = Number(sensorValue, Number::intType);\n\/\/\tqDebug() << sensorVariableName << sensorValue;\n}\n\nvoid Interpreter::connectToRobot()\n{\n\tmRobotModel->init();\n}\n\nvoid Interpreter::setBluetoothPortName(QString const &portName)\n{\n\tmBluetoothRobotCommunication->setPortName(portName);\n}\n\nvoid Interpreter::setRobotModelType(robotModelType::robotModelTypeEnum robotModelType)\n{\n\tsetRobotImplementation(robotModelType, mBluetoothRobotCommunication);\n}\n<|endoftext|>"} {"text":"<commit_before>#include <QCoreApplication>\n#include <QtGui\/QAction>\n\n#include \"interpreter.h\"\n\n#include \"details\/autoconfigurer.h\"\n#include \"details\/robotImplementations\/unrealRobotModelImplementation.h\"\n#include \"details\/robotCommunication\/bluetoothRobotCommunicationThread.h\"\n#include \"details\/robotCommunication\/usbRobotCommunicationThread.h\"\n#include \"details\/tracer.h\"\n#include \"details\/debugHelper.h\"\n\nusing namespace qReal;\nusing namespace interpreters::robots;\nusing namespace interpreters::robots::details;\n\nconst Id startingElementType = Id(\"RobotsMetamodel\", \"RobotsDiagram\", \"InitialNode\");\nconst Id startingElementType1 = Id(\"RobotsMetamodel\", \"RobotsDiagram\", \"InitialBlock\");\n\nInterpreter::Interpreter()\n\t: mGraphicalModelApi(NULL)\n\t, mLogicalModelApi(NULL)\n\t, mInterpretersInterface(NULL)\n\t, mState(idle)\n\t, mRobotModel(new RobotModel())\n\t, mBlocksTable(NULL)\n\t, mRobotCommunication(new RobotCommunicator(SettingsManager::value(\"valueOfCommunication\").toString()))\n\t, mImplementationType(robotModelType::null)\n\t, mWatchListWindow(NULL)\n\t, mActionConnectToRobot(NULL)\n{\n\tmParser = NULL;\n\tmBlocksTable = NULL;\n\tmTimer = new QTimer();\n\n\tmD2RobotModel = new d2Model::D2RobotModel();\n\tmD2ModelWidget = mD2RobotModel->createModelWidget();\n\n\tconnect(mRobotModel, SIGNAL(disconnected()), this, SLOT(disconnectSlot()));\n\tconnect(mRobotModel, SIGNAL(sensorsConfigured()), this, SLOT(sensorsConfiguredSlot()));\n\tconnect(mRobotModel, SIGNAL(connected(bool)), this, SLOT(connectedSlot(bool)));\n\tconnect(mD2ModelWidget, SIGNAL(d2WasClosed()), this, SLOT(stopRobot()));\n\tconnect(mRobotCommunication, SIGNAL(errorOccured(QString)), this, SLOT(reportError(QString)));\n}\n\nvoid Interpreter::init(GraphicalModelAssistInterface const &graphicalModelApi\n\t, LogicalModelAssistInterface const &logicalModelApi\n\t, qReal::gui::MainWindowInterpretersInterface &interpretersInterface)\n{\n\tmGraphicalModelApi = &graphicalModelApi;\n\tmLogicalModelApi = &logicalModelApi;\n\tmInterpretersInterface = &interpretersInterface;\n\n\tmParser = new RobotsBlockParser(mInterpretersInterface->errorReporter());\n\tmBlocksTable = new BlocksTable(graphicalModelApi, logicalModelApi, mRobotModel, mInterpretersInterface->errorReporter(), mParser);\n\n\trobotModelType::robotModelTypeEnum const modelType = static_cast<robotModelType::robotModelTypeEnum>(SettingsManager::value(\"robotModel\").toInt());\n\tTracer::debug(tracer::initialization, \"Interpreter::init\", \"Going to set robot implementation, model type is \" + DebugHelper::toString(modelType));\n\tsetRobotImplementation(modelType);\n\n\tmWatchListWindow = new WatchListWindow(mParser, mInterpretersInterface->windowWidget());\n}\n\nInterpreter::~Interpreter()\n{\n\tforeach (Thread * const thread, mThreads) {\n\t\tdelete thread;\n\t}\n\tdelete mBlocksTable;\n}\n\nvoid Interpreter::interpret()\n{\n\tTracer::debug(tracer::initialization, \"Interpreter::interpret\", \"Preparing for interpretation\");\n\n\tmInterpretersInterface->errorReporter()->clear();\n\n\tId const ¤tDiagramId = mInterpretersInterface->activeDiagram();\n\n\tif (!mConnected) {\n\t\tmInterpretersInterface->errorReporter()->addInformation(tr(\"No connection to robot\"));\n\t\treturn;\n\t}\n\tif (mState != idle) {\n\t\tmInterpretersInterface->errorReporter()->addInformation(tr(\"Interpreter is already running\"));\n\t\treturn;\n\t}\n\n\tmState = waitingForSensorsConfiguredToLaunch;\n\tmBlocksTable->setIdleForBlocks();\n\n\tId const startingElement = findStartingElement(currentDiagramId);\n\tif (startingElement == Id()) {\n\t\tmInterpretersInterface->errorReporter()->addError(tr(\"No entry point found, please add Initial Node to a diagram\"));\n\t\tmState = idle;\n\t\treturn;\n\t}\n\n\tAutoconfigurer configurer(*mGraphicalModelApi, mBlocksTable, mInterpretersInterface->errorReporter(), mRobotModel);\n\tif (!configurer.configure(currentDiagramId)) {\n\t\treturn;\n\t}\n\n\trunTimer();\n}\n\nvoid Interpreter::stopRobot()\n{\n\tmTimer->stop();\n\tmRobotModel->stopRobot();\n\tmState = idle;\n\tforeach (Thread *thread, mThreads) {\n\t\tdelete thread;\n\t\tmThreads.removeAll(thread);\n\t}\n\tmBlocksTable->setFailure();\n}\n\nvoid Interpreter::showWatchList()\n{\n\tmWatchListWindow->show();\n}\n\nvoid Interpreter::closeWatchList()\n{\n\tif (mWatchListWindow) {\n\t\tmWatchListWindow->setVisible(false);\n\t}\n}\n\nvoid Interpreter::closeD2ModelWidget()\n{\n\tif (mD2ModelWidget) {\n\t\tmD2ModelWidget->close();\n\t}\n}\n\nvoid Interpreter::showD2ModelWidget(bool isVisible)\n{\n\tmD2ModelWidget->init(isVisible);\n\tif (isVisible) {\n\t\tmD2ModelWidget->activateWindow();\n\t\tmD2ModelWidget->showNormal();\n\t}\n}\n\nvoid Interpreter::setD2ModelWidgetActions(QAction *runAction, QAction *stopAction)\n{\n\tmD2ModelWidget->setD2ModelWidgetActions(runAction, stopAction);\n}\n\nvoid Interpreter::enableD2ModelWidgetRunStopButtons()\n{\n\tmD2ModelWidget->enableRunStopButtons();\n}\n\nvoid Interpreter::disableD2ModelWidgetRunStopButtons()\n{\n\tmD2ModelWidget->disableRunStopButtons();\n}\n\nvoid Interpreter::setRobotImplementation(robotModelType::robotModelTypeEnum implementationType)\n{\n\tmConnected = false;\n\trobotImplementations::AbstractRobotModelImplementation *robotImpl =\n\t\t\trobotImplementations::AbstractRobotModelImplementation::robotModel(implementationType, mRobotCommunication, mD2RobotModel);\n\tsetRobotImplementation(robotImpl);\n\tmImplementationType = implementationType;\n\tif (mImplementationType != robotModelType::real) {\n\t\tmRobotModel->init();\n\t}\n}\n\nvoid Interpreter::connectedSlot(bool success)\n{\n\tif (success) {\n\t\tif (mRobotModel->needsConnection()) {\n\t\t\tmInterpretersInterface->errorReporter()->addInformation(tr(\"Connected successfully\"));\n\t\t}\n\t} else {\n\t\tTracer::debug(tracer::initialization, \"Interpreter::connectedSlot\", \"Robot connection status: \" + QString::number(success));\n\t\tmInterpretersInterface->errorReporter()->addError(tr(\"Can't connect to a robot.\"));\n\t}\n\tmConnected = success;\n\tmActionConnectToRobot->setChecked(success);\n}\n\nvoid Interpreter::sensorsConfiguredSlot()\n{\n\tTracer::debug(tracer::initialization, \"Interpreter::sensorsConfiguredSlot\", \"Sensors are configured\");\n\n\tmConnected = true;\n\tmActionConnectToRobot->setChecked(mConnected);\n\n\tresetVariables();\n\n\tmRobotModel->nextBlockAfterInitial(mConnected);\n\n\tif (mState == waitingForSensorsConfiguredToLaunch) {\n\t\tmState = interpreting;\n\n\t\tTracer::debug(tracer::initialization, \"Interpreter::sensorsConfiguredSlot\", \"Starting interpretation\");\n\t\tmRobotModel->startInterpretation();\n\n\t\tId const ¤tDiagramId = mInterpretersInterface->activeDiagram();\n\t\tId const startingElement = findStartingElement(currentDiagramId);\n\t\tThread * const initialThread = new Thread(*mInterpretersInterface, *mBlocksTable, startingElement);\n\t\taddThread(initialThread);\n\t}\n}\n\nId const Interpreter::findStartingElement(Id const &diagram) const\n{\n\tIdList const children = mGraphicalModelApi->graphicalRepoApi().children(diagram);\n\n\tforeach (Id const child, children) {\n\t\tif (child.type() == startingElementType || child.type() == startingElementType1) {\n\t\t\treturn child;\n\t\t}\n\t}\n\n\treturn Id();\n}\n\nvoid Interpreter::threadStopped()\n{\n\tThread *thread = static_cast<Thread *>(sender());\n\n\tmThreads.removeAll(thread);\n\tdelete thread;\n\n\tif (mThreads.isEmpty()) {\n\t\tstopRobot();\n\t}\n}\n\nvoid Interpreter::newThread(details::blocks::Block * const startBlock)\n{\n\tThread * const thread = new Thread(*mInterpretersInterface, *mBlocksTable, startBlock->id());\n\taddThread(thread);\n}\n\nvoid Interpreter::configureSensors(sensorType::SensorTypeEnum const &port1\n\t\t, sensorType::SensorTypeEnum const &port2\n\t\t, sensorType::SensorTypeEnum const &port3\n\t\t, sensorType::SensorTypeEnum const &port4)\n{\n\tif (mConnected) {\n\t\tmRobotModel->configureSensors(port1, port2, port3, port4);\n\t}\n}\n\nvoid Interpreter::addThread(details::Thread * const thread)\n{\n\tmThreads.append(thread);\n\tconnect(thread, SIGNAL(stopped()), this, SLOT(threadStopped()));\n\tconnect(thread, SIGNAL(newThread(details::blocks::Block*const)), this, SLOT(newThread(details::blocks::Block*const)));\n\n\tQCoreApplication::processEvents();\n\tthread->interpret();\n}\n\ninterpreters::robots::details::RobotModel *Interpreter::robotModel()\n{\n\treturn mRobotModel;\n}\n\nvoid Interpreter::setRobotModel(details::RobotModel * const robotModel)\n{\n\tmRobotModel = robotModel;\n}\n\nvoid Interpreter::setRobotImplementation(details::robotImplementations::AbstractRobotModelImplementation *robotImpl)\n{\n\tmRobotModel->setRobotImplementation(robotImpl);\n\tif (robotImpl) {\n\t\tconnect(mRobotModel, SIGNAL(connected(bool)), this, SLOT(runTimer()));\n\t}\n}\n\nvoid Interpreter::runTimer()\n{\n\tmTimer->start(200);\n\tconnect(mTimer, SIGNAL(timeout()), this, SLOT(readSensorValues()));\n\tif (mRobotModel->sensor(inputPort::port1)) {\n\t\tconnect(mRobotModel->sensor(inputPort::port1)->sensorImpl(), SIGNAL(response(int)), this, SLOT(responseSlot1(int)));\n\t\tconnect(mRobotModel->sensor(inputPort::port1)->sensorImpl(), SIGNAL(failure()), this, SLOT(slotFailure()));\n\t}\n\tif (mRobotModel->sensor(inputPort::port2)) {\n\t\tconnect(mRobotModel->sensor(inputPort::port2)->sensorImpl(), SIGNAL(response(int)), this, SLOT(responseSlot2(int)));\n\t\tconnect(mRobotModel->sensor(inputPort::port2)->sensorImpl(), SIGNAL(failure()), this, SLOT(slotFailure()));\n\t}\n\tif (mRobotModel->sensor(inputPort::port3)) {\n\t\tconnect(mRobotModel->sensor(inputPort::port3)->sensorImpl(), SIGNAL(response(int)), this, SLOT(responseSlot3(int)));\n\t\tconnect(mRobotModel->sensor(inputPort::port3)->sensorImpl(), SIGNAL(failure()), this, SLOT(slotFailure()));\n\t}\n\tif (mRobotModel->sensor(inputPort::port4)) {\n\t\tconnect(mRobotModel->sensor(inputPort::port4)->sensorImpl(), SIGNAL(response(int)), this, SLOT(responseSlot4(int)));\n\t\tconnect(mRobotModel->sensor(inputPort::port4)->sensorImpl(), SIGNAL(failure()), this, SLOT(slotFailure()));\n\t}\n}\n\nvoid Interpreter::readSensorValues()\n{\n\tif (mState == idle) {\n\t\treturn;\n\t}\n\n\tif (mRobotModel->sensor(inputPort::port1)) {\n\t\tmRobotModel->sensor(inputPort::port1)->read();\n\t}\n\tif (mRobotModel->sensor(inputPort::port2)) {\n\t\tmRobotModel->sensor(inputPort::port2)->read();\n\t}\n\tif (mRobotModel->sensor(inputPort::port3)) {\n\t\tmRobotModel->sensor(inputPort::port3)->read();\n\t}\n\tif (mRobotModel->sensor(inputPort::port4)) {\n\t\tmRobotModel->sensor(inputPort::port4)->read();\n\t}\n}\n\nvoid Interpreter::slotFailure()\n{\n\tTracer::debug(tracer::autoupdatedSensorValues, \"Interpreter::slotFailure\", \"\");\n}\n\nvoid Interpreter::responseSlot1(int sensorValue)\n{\n\tupdateSensorValues(\"Sensor1\", sensorValue);\n}\n\nvoid Interpreter::responseSlot2(int sensorValue)\n{\n\tupdateSensorValues(\"Sensor2\", sensorValue);\n}\n\nvoid Interpreter::responseSlot3(int sensorValue)\n{\n\tupdateSensorValues(\"Sensor3\", sensorValue);\n}\n\nvoid Interpreter::responseSlot4(int sensorValue)\n{\n\tupdateSensorValues(\"Sensor4\", sensorValue);\n}\n\nvoid Interpreter::updateSensorValues(QString const &sensorVariableName, int sensorValue)\n{\n\t(*(mParser->getVariables()))[sensorVariableName] = utils::Number(sensorValue, utils::Number::intType);\n\tTracer::debug(tracer::autoupdatedSensorValues, \"Interpreter::updateSensorValues\", sensorVariableName + QString::number(sensorValue));\n}\n\nvoid Interpreter::resetVariables()\n{\n\tint const resetValue = 0;\n\tresponseSlot1(resetValue);\n\tresponseSlot2(resetValue);\n\tresponseSlot3(resetValue);\n\tresponseSlot4(resetValue);\n}\n\nvoid Interpreter::connectToRobot()\n{\n\tif (mConnected) {\n\t\tmRobotModel->stopRobot();\n\t\tmRobotModel->disconnectFromRobot();\n\t} else {\n\t\tmRobotModel->init();\n\t\tconfigureSensors(static_cast<sensorType::SensorTypeEnum>(SettingsManager::instance()->value(\"port1SensorType\").toInt())\n\t\t\t\t\t\t , static_cast<sensorType::SensorTypeEnum>(SettingsManager::instance()->value(\"port2SensorType\").toInt())\n\t\t\t\t\t\t , static_cast<sensorType::SensorTypeEnum>(SettingsManager::instance()->value(\"port3SensorType\").toInt())\n\t\t\t\t\t\t , static_cast<sensorType::SensorTypeEnum>(SettingsManager::instance()->value(\"port4SensorType\").toInt()));\n\t}\n\tmActionConnectToRobot->setChecked(mConnected);\n}\n\nvoid Interpreter::disconnectSlot()\n{\n\tmActionConnectToRobot->setChecked(false);\n\tmConnected = false;\n}\n\nvoid Interpreter::setRobotModelType(robotModelType::robotModelTypeEnum robotModelType)\n{\n\tsetRobotImplementation(robotModelType);\n}\n\nvoid Interpreter::setCommunicator(QString const &valueOfCommunication, QString const &portName)\n{\n\tif (valueOfCommunication == mLastCommunicationValue) {\n\t\treturn;\n\t}\n\tRobotCommunicationThreadInterface *communicator = NULL;\n\tif (valueOfCommunication == \"bluetooth\") {\n\t\tcommunicator = new BluetoothRobotCommunicationThread();\n\t} else {\n\t\tcommunicator = new UsbRobotCommunicationThread();\n\t}\n\tmLastCommunicationValue = valueOfCommunication;\n\n\tmRobotCommunication->setRobotCommunicationThreadObject(communicator);\n\tmRobotCommunication->setPortName(portName);\n\tconnectToRobot();\n}\n\nvoid Interpreter::setConnectRobotAction(QAction *actionConnect)\n{\n\tmActionConnectToRobot = actionConnect;\n}\n\nvoid Interpreter::reportError(QString const &message)\n{\n\tmInterpretersInterface->errorReporter()->addError(message);\n}\n\nWatchListWindow *Interpreter::watchWindow() const\n{\n\treturn mWatchListWindow;\n}\n\nvoid Interpreter::connectSensorConfigurer(details::SensorsConfigurationWidget *configurer) const\n{\n\tconnect(configurer, SIGNAL(saved()), mD2ModelWidget, SLOT(syncronizeSensors()));\n}\n<commit_msg>Fixed terribelly large sensor rereading interval<commit_after>#include <QCoreApplication>\n#include <QtGui\/QAction>\n\n#include \"interpreter.h\"\n\n#include \"details\/autoconfigurer.h\"\n#include \"details\/robotImplementations\/unrealRobotModelImplementation.h\"\n#include \"details\/robotCommunication\/bluetoothRobotCommunicationThread.h\"\n#include \"details\/robotCommunication\/usbRobotCommunicationThread.h\"\n#include \"details\/tracer.h\"\n#include \"details\/debugHelper.h\"\n\nusing namespace qReal;\nusing namespace interpreters::robots;\nusing namespace interpreters::robots::details;\n\nconst Id startingElementType = Id(\"RobotsMetamodel\", \"RobotsDiagram\", \"InitialNode\");\nconst Id startingElementType1 = Id(\"RobotsMetamodel\", \"RobotsDiagram\", \"InitialBlock\");\n\nInterpreter::Interpreter()\n\t: mGraphicalModelApi(NULL)\n\t, mLogicalModelApi(NULL)\n\t, mInterpretersInterface(NULL)\n\t, mState(idle)\n\t, mRobotModel(new RobotModel())\n\t, mBlocksTable(NULL)\n\t, mRobotCommunication(new RobotCommunicator(SettingsManager::value(\"valueOfCommunication\").toString()))\n\t, mImplementationType(robotModelType::null)\n\t, mWatchListWindow(NULL)\n\t, mActionConnectToRobot(NULL)\n{\n\tmParser = NULL;\n\tmBlocksTable = NULL;\n\tmTimer = new QTimer();\n\n\tmD2RobotModel = new d2Model::D2RobotModel();\n\tmD2ModelWidget = mD2RobotModel->createModelWidget();\n\n\tconnect(mRobotModel, SIGNAL(disconnected()), this, SLOT(disconnectSlot()));\n\tconnect(mRobotModel, SIGNAL(sensorsConfigured()), this, SLOT(sensorsConfiguredSlot()));\n\tconnect(mRobotModel, SIGNAL(connected(bool)), this, SLOT(connectedSlot(bool)));\n\tconnect(mD2ModelWidget, SIGNAL(d2WasClosed()), this, SLOT(stopRobot()));\n\tconnect(mRobotCommunication, SIGNAL(errorOccured(QString)), this, SLOT(reportError(QString)));\n}\n\nvoid Interpreter::init(GraphicalModelAssistInterface const &graphicalModelApi\n\t, LogicalModelAssistInterface const &logicalModelApi\n\t, qReal::gui::MainWindowInterpretersInterface &interpretersInterface)\n{\n\tmGraphicalModelApi = &graphicalModelApi;\n\tmLogicalModelApi = &logicalModelApi;\n\tmInterpretersInterface = &interpretersInterface;\n\n\tmParser = new RobotsBlockParser(mInterpretersInterface->errorReporter());\n\tmBlocksTable = new BlocksTable(graphicalModelApi, logicalModelApi, mRobotModel, mInterpretersInterface->errorReporter(), mParser);\n\n\trobotModelType::robotModelTypeEnum const modelType = static_cast<robotModelType::robotModelTypeEnum>(SettingsManager::value(\"robotModel\").toInt());\n\tTracer::debug(tracer::initialization, \"Interpreter::init\", \"Going to set robot implementation, model type is \" + DebugHelper::toString(modelType));\n\tsetRobotImplementation(modelType);\n\n\tmWatchListWindow = new WatchListWindow(mParser, mInterpretersInterface->windowWidget());\n}\n\nInterpreter::~Interpreter()\n{\n\tforeach (Thread * const thread, mThreads) {\n\t\tdelete thread;\n\t}\n\tdelete mBlocksTable;\n}\n\nvoid Interpreter::interpret()\n{\n\tTracer::debug(tracer::initialization, \"Interpreter::interpret\", \"Preparing for interpretation\");\n\n\tmInterpretersInterface->errorReporter()->clear();\n\n\tId const ¤tDiagramId = mInterpretersInterface->activeDiagram();\n\n\tif (!mConnected) {\n\t\tmInterpretersInterface->errorReporter()->addInformation(tr(\"No connection to robot\"));\n\t\treturn;\n\t}\n\tif (mState != idle) {\n\t\tmInterpretersInterface->errorReporter()->addInformation(tr(\"Interpreter is already running\"));\n\t\treturn;\n\t}\n\n\tmState = waitingForSensorsConfiguredToLaunch;\n\tmBlocksTable->setIdleForBlocks();\n\n\tId const startingElement = findStartingElement(currentDiagramId);\n\tif (startingElement == Id()) {\n\t\tmInterpretersInterface->errorReporter()->addError(tr(\"No entry point found, please add Initial Node to a diagram\"));\n\t\tmState = idle;\n\t\treturn;\n\t}\n\n\tAutoconfigurer configurer(*mGraphicalModelApi, mBlocksTable, mInterpretersInterface->errorReporter(), mRobotModel);\n\tif (!configurer.configure(currentDiagramId)) {\n\t\treturn;\n\t}\n\n\trunTimer();\n}\n\nvoid Interpreter::stopRobot()\n{\n\tmTimer->stop();\n\tmRobotModel->stopRobot();\n\tmState = idle;\n\tforeach (Thread *thread, mThreads) {\n\t\tdelete thread;\n\t\tmThreads.removeAll(thread);\n\t}\n\tmBlocksTable->setFailure();\n}\n\nvoid Interpreter::showWatchList()\n{\n\tmWatchListWindow->show();\n}\n\nvoid Interpreter::closeWatchList()\n{\n\tif (mWatchListWindow) {\n\t\tmWatchListWindow->setVisible(false);\n\t}\n}\n\nvoid Interpreter::closeD2ModelWidget()\n{\n\tif (mD2ModelWidget) {\n\t\tmD2ModelWidget->close();\n\t}\n}\n\nvoid Interpreter::showD2ModelWidget(bool isVisible)\n{\n\tmD2ModelWidget->init(isVisible);\n\tif (isVisible) {\n\t\tmD2ModelWidget->activateWindow();\n\t\tmD2ModelWidget->showNormal();\n\t}\n}\n\nvoid Interpreter::setD2ModelWidgetActions(QAction *runAction, QAction *stopAction)\n{\n\tmD2ModelWidget->setD2ModelWidgetActions(runAction, stopAction);\n}\n\nvoid Interpreter::enableD2ModelWidgetRunStopButtons()\n{\n\tmD2ModelWidget->enableRunStopButtons();\n}\n\nvoid Interpreter::disableD2ModelWidgetRunStopButtons()\n{\n\tmD2ModelWidget->disableRunStopButtons();\n}\n\nvoid Interpreter::setRobotImplementation(robotModelType::robotModelTypeEnum implementationType)\n{\n\tmConnected = false;\n\trobotImplementations::AbstractRobotModelImplementation *robotImpl =\n\t\t\trobotImplementations::AbstractRobotModelImplementation::robotModel(implementationType, mRobotCommunication, mD2RobotModel);\n\tsetRobotImplementation(robotImpl);\n\tmImplementationType = implementationType;\n\tif (mImplementationType != robotModelType::real) {\n\t\tmRobotModel->init();\n\t}\n}\n\nvoid Interpreter::connectedSlot(bool success)\n{\n\tif (success) {\n\t\tif (mRobotModel->needsConnection()) {\n\t\t\tmInterpretersInterface->errorReporter()->addInformation(tr(\"Connected successfully\"));\n\t\t}\n\t} else {\n\t\tTracer::debug(tracer::initialization, \"Interpreter::connectedSlot\", \"Robot connection status: \" + QString::number(success));\n\t\tmInterpretersInterface->errorReporter()->addError(tr(\"Can't connect to a robot.\"));\n\t}\n\tmConnected = success;\n\tmActionConnectToRobot->setChecked(success);\n}\n\nvoid Interpreter::sensorsConfiguredSlot()\n{\n\tTracer::debug(tracer::initialization, \"Interpreter::sensorsConfiguredSlot\", \"Sensors are configured\");\n\n\tmConnected = true;\n\tmActionConnectToRobot->setChecked(mConnected);\n\n\tresetVariables();\n\n\tmRobotModel->nextBlockAfterInitial(mConnected);\n\n\tif (mState == waitingForSensorsConfiguredToLaunch) {\n\t\tmState = interpreting;\n\n\t\tTracer::debug(tracer::initialization, \"Interpreter::sensorsConfiguredSlot\", \"Starting interpretation\");\n\t\tmRobotModel->startInterpretation();\n\n\t\tId const ¤tDiagramId = mInterpretersInterface->activeDiagram();\n\t\tId const startingElement = findStartingElement(currentDiagramId);\n\t\tThread * const initialThread = new Thread(*mInterpretersInterface, *mBlocksTable, startingElement);\n\t\taddThread(initialThread);\n\t}\n}\n\nId const Interpreter::findStartingElement(Id const &diagram) const\n{\n\tIdList const children = mGraphicalModelApi->graphicalRepoApi().children(diagram);\n\n\tforeach (Id const child, children) {\n\t\tif (child.type() == startingElementType || child.type() == startingElementType1) {\n\t\t\treturn child;\n\t\t}\n\t}\n\n\treturn Id();\n}\n\nvoid Interpreter::threadStopped()\n{\n\tThread *thread = static_cast<Thread *>(sender());\n\n\tmThreads.removeAll(thread);\n\tdelete thread;\n\n\tif (mThreads.isEmpty()) {\n\t\tstopRobot();\n\t}\n}\n\nvoid Interpreter::newThread(details::blocks::Block * const startBlock)\n{\n\tThread * const thread = new Thread(*mInterpretersInterface, *mBlocksTable, startBlock->id());\n\taddThread(thread);\n}\n\nvoid Interpreter::configureSensors(sensorType::SensorTypeEnum const &port1\n\t\t, sensorType::SensorTypeEnum const &port2\n\t\t, sensorType::SensorTypeEnum const &port3\n\t\t, sensorType::SensorTypeEnum const &port4)\n{\n\tif (mConnected) {\n\t\tmRobotModel->configureSensors(port1, port2, port3, port4);\n\t}\n}\n\nvoid Interpreter::addThread(details::Thread * const thread)\n{\n\tmThreads.append(thread);\n\tconnect(thread, SIGNAL(stopped()), this, SLOT(threadStopped()));\n\tconnect(thread, SIGNAL(newThread(details::blocks::Block*const)), this, SLOT(newThread(details::blocks::Block*const)));\n\n\tQCoreApplication::processEvents();\n\tthread->interpret();\n}\n\ninterpreters::robots::details::RobotModel *Interpreter::robotModel()\n{\n\treturn mRobotModel;\n}\n\nvoid Interpreter::setRobotModel(details::RobotModel * const robotModel)\n{\n\tmRobotModel = robotModel;\n}\n\nvoid Interpreter::setRobotImplementation(details::robotImplementations::AbstractRobotModelImplementation *robotImpl)\n{\n\tmRobotModel->setRobotImplementation(robotImpl);\n\tif (robotImpl) {\n\t\tconnect(mRobotModel, SIGNAL(connected(bool)), this, SLOT(runTimer()));\n\t}\n}\n\nvoid Interpreter::runTimer()\n{\n\tmTimer->start(1);\n\tconnect(mTimer, SIGNAL(timeout()), this, SLOT(readSensorValues()));\n\tif (mRobotModel->sensor(inputPort::port1)) {\n\t\tconnect(mRobotModel->sensor(inputPort::port1)->sensorImpl(), SIGNAL(response(int)), this, SLOT(responseSlot1(int)));\n\t\tconnect(mRobotModel->sensor(inputPort::port1)->sensorImpl(), SIGNAL(failure()), this, SLOT(slotFailure()));\n\t}\n\tif (mRobotModel->sensor(inputPort::port2)) {\n\t\tconnect(mRobotModel->sensor(inputPort::port2)->sensorImpl(), SIGNAL(response(int)), this, SLOT(responseSlot2(int)));\n\t\tconnect(mRobotModel->sensor(inputPort::port2)->sensorImpl(), SIGNAL(failure()), this, SLOT(slotFailure()));\n\t}\n\tif (mRobotModel->sensor(inputPort::port3)) {\n\t\tconnect(mRobotModel->sensor(inputPort::port3)->sensorImpl(), SIGNAL(response(int)), this, SLOT(responseSlot3(int)));\n\t\tconnect(mRobotModel->sensor(inputPort::port3)->sensorImpl(), SIGNAL(failure()), this, SLOT(slotFailure()));\n\t}\n\tif (mRobotModel->sensor(inputPort::port4)) {\n\t\tconnect(mRobotModel->sensor(inputPort::port4)->sensorImpl(), SIGNAL(response(int)), this, SLOT(responseSlot4(int)));\n\t\tconnect(mRobotModel->sensor(inputPort::port4)->sensorImpl(), SIGNAL(failure()), this, SLOT(slotFailure()));\n\t}\n}\n\nvoid Interpreter::readSensorValues()\n{\n\tif (mState == idle) {\n\t\treturn;\n\t}\n\n\tif (mRobotModel->sensor(inputPort::port1)) {\n\t\tmRobotModel->sensor(inputPort::port1)->read();\n\t}\n\tif (mRobotModel->sensor(inputPort::port2)) {\n\t\tmRobotModel->sensor(inputPort::port2)->read();\n\t}\n\tif (mRobotModel->sensor(inputPort::port3)) {\n\t\tmRobotModel->sensor(inputPort::port3)->read();\n\t}\n\tif (mRobotModel->sensor(inputPort::port4)) {\n\t\tmRobotModel->sensor(inputPort::port4)->read();\n\t}\n}\n\nvoid Interpreter::slotFailure()\n{\n\tTracer::debug(tracer::autoupdatedSensorValues, \"Interpreter::slotFailure\", \"\");\n}\n\nvoid Interpreter::responseSlot1(int sensorValue)\n{\n\tupdateSensorValues(\"Sensor1\", sensorValue);\n}\n\nvoid Interpreter::responseSlot2(int sensorValue)\n{\n\tupdateSensorValues(\"Sensor2\", sensorValue);\n}\n\nvoid Interpreter::responseSlot3(int sensorValue)\n{\n\tupdateSensorValues(\"Sensor3\", sensorValue);\n}\n\nvoid Interpreter::responseSlot4(int sensorValue)\n{\n\tupdateSensorValues(\"Sensor4\", sensorValue);\n}\n\nvoid Interpreter::updateSensorValues(QString const &sensorVariableName, int sensorValue)\n{\n\t(*(mParser->getVariables()))[sensorVariableName] = utils::Number(sensorValue, utils::Number::intType);\n\tTracer::debug(tracer::autoupdatedSensorValues, \"Interpreter::updateSensorValues\", sensorVariableName + QString::number(sensorValue));\n}\n\nvoid Interpreter::resetVariables()\n{\n\tint const resetValue = 0;\n\tresponseSlot1(resetValue);\n\tresponseSlot2(resetValue);\n\tresponseSlot3(resetValue);\n\tresponseSlot4(resetValue);\n}\n\nvoid Interpreter::connectToRobot()\n{\n\tif (mConnected) {\n\t\tmRobotModel->stopRobot();\n\t\tmRobotModel->disconnectFromRobot();\n\t} else {\n\t\tmRobotModel->init();\n\t\tconfigureSensors(static_cast<sensorType::SensorTypeEnum>(SettingsManager::instance()->value(\"port1SensorType\").toInt())\n\t\t\t\t\t\t , static_cast<sensorType::SensorTypeEnum>(SettingsManager::instance()->value(\"port2SensorType\").toInt())\n\t\t\t\t\t\t , static_cast<sensorType::SensorTypeEnum>(SettingsManager::instance()->value(\"port3SensorType\").toInt())\n\t\t\t\t\t\t , static_cast<sensorType::SensorTypeEnum>(SettingsManager::instance()->value(\"port4SensorType\").toInt()));\n\t}\n\tmActionConnectToRobot->setChecked(mConnected);\n}\n\nvoid Interpreter::disconnectSlot()\n{\n\tmActionConnectToRobot->setChecked(false);\n\tmConnected = false;\n}\n\nvoid Interpreter::setRobotModelType(robotModelType::robotModelTypeEnum robotModelType)\n{\n\tsetRobotImplementation(robotModelType);\n}\n\nvoid Interpreter::setCommunicator(QString const &valueOfCommunication, QString const &portName)\n{\n\tif (valueOfCommunication == mLastCommunicationValue) {\n\t\treturn;\n\t}\n\tRobotCommunicationThreadInterface *communicator = NULL;\n\tif (valueOfCommunication == \"bluetooth\") {\n\t\tcommunicator = new BluetoothRobotCommunicationThread();\n\t} else {\n\t\tcommunicator = new UsbRobotCommunicationThread();\n\t}\n\tmLastCommunicationValue = valueOfCommunication;\n\n\tmRobotCommunication->setRobotCommunicationThreadObject(communicator);\n\tmRobotCommunication->setPortName(portName);\n\tconnectToRobot();\n}\n\nvoid Interpreter::setConnectRobotAction(QAction *actionConnect)\n{\n\tmActionConnectToRobot = actionConnect;\n}\n\nvoid Interpreter::reportError(QString const &message)\n{\n\tmInterpretersInterface->errorReporter()->addError(message);\n}\n\nWatchListWindow *Interpreter::watchWindow() const\n{\n\treturn mWatchListWindow;\n}\n\nvoid Interpreter::connectSensorConfigurer(details::SensorsConfigurationWidget *configurer) const\n{\n\tconnect(configurer, SIGNAL(saved()), mD2ModelWidget, SLOT(syncronizeSensors()));\n}\n<|endoftext|>"} {"text":"<commit_before>#include \"..\/notification.h\"\n#include \"..\/cef_handler.h\"\n#include \"main_window.h\"\n\nbool\nMainWindow::SetFocus(bool focused) {\n BaseWindow::SetFocus(focused);\n\n if (!focused)\n return false;\n\n CefRefPtr<ClientHandler> handler = ClientHandler::GetInstance();\n if (!handler)\n return false;\n\n CefRefPtr<CefBrowser> browser = handler->GetBrowser();\n if (!browser)\n return false;\n\n \/\/ Give focus to the browser window.\n browser->GetHost()->SetFocus(true);\n\n \/\/ Hide previously showed notification\n Notification::Hide();\n return true;\n}<commit_msg>Пробуем обогнуть странное поведение событий onblur\/onfocus в CEF<commit_after>#include \"..\/notification.h\"\n#include \"..\/cef_handler.h\"\n#include \"main_window.h\"\n\nbool\nMainWindow::SetFocus(bool focused) {\n BaseWindow::SetFocus(focused);\n\n CefRefPtr<ClientHandler> handler = ClientHandler::GetInstance();\n if (!handler)\n return false;\n\n CefRefPtr<CefBrowser> browser = handler->GetBrowser();\n if (!browser)\n return false;\n\n \/\/ Give focus to the browser window.\n browser->GetHost()->SetFocus(focused);\n\n if (focused) {\n \/\/ Hide previously showed notification\n Notification::Hide();\n }\n\n \/\/ Hack: CEF have strange behaviour for onfocus\/onblur event, so we send custom event\n \/\/ ToDo: Research\n handler->SendJSEvent(browser, \"BXForegroundChanged\", focused? \"[true]\": \"[false]\");\n\n return true;\n}<|endoftext|>"} {"text":"<commit_before>#include \"docks\/favorites-dock.h\"\n#include <QEvent>\n#include <QStringList>\n#include <ui_favorites-dock.h>\n#include \"functions.h\"\n#include \"helpers.h\"\n#include \"models\/favorite.h\"\n#include \"models\/profile.h\"\n#include \"ui\/QAffiche.h\"\n\n\nFavoritesDock::FavoritesDock(Profile *profile, QWidget *parent)\n\t: Dock(parent), ui(new Ui::FavoritesDock), m_favorites(profile->getFavorites())\n{\n\tui->setupUi(this);\n\n\tconnect(profile, &Profile::favoritesChanged, this, &FavoritesDock::refresh);\n\n\trefresh();\n\n}\n\nFavoritesDock::~FavoritesDock()\n{\n\tclose();\n\tdelete ui;\n}\n\nvoid FavoritesDock::changeEvent(QEvent *event)\n{\n\tif (event->type() == QEvent::LanguageChange) {\n\t\tui->retranslateUi(this);\n\t}\n\n\tQWidget::changeEvent(event);\n}\n\nvoid FavoritesDock::changeSortDirection()\n{\n\tm_descending = !m_descending;\n\n\tstatic const QIcon asc(\":\/images\/icons\/arrow-down.png\");\n\tstatic const QIcon desc(\":\/images\/icons\/arrow-up.png\");\n\tui->buttonSortDirection->setIcon(m_descending ? desc : asc);\n\n\trefresh();\n}\n\nvoid FavoritesDock::refresh()\n{\n\tclearLayout(ui->layoutFavorites);\n\n\t\/\/ Sort\n\tstatic const QStringList assoc { \"name\", \"note\", \"lastviewed\" };\n\tconst QString order = assoc[qMax(ui->comboSortBy->currentIndex(), 0)];\n\tif (order == \"note\") {\n\t\tstd::sort(m_favorites.begin(), m_favorites.end(), Favorite::sortByNote);\n\t} else if (order == \"lastviewed\") {\n\t\tstd::sort(m_favorites.begin(), m_favorites.end(), Favorite::sortByLastViewed);\n\t} else {\n\t\tstd::sort(m_favorites.begin(), m_favorites.end(), Favorite::sortByName);\n\t}\n\n\t\/\/ Reverse\n\tif (m_descending) {\n\t\tm_favorites = reversed(m_favorites);\n\t}\n\n\tfor (const Favorite &fav : qAsConst(m_favorites)) {\n\t\tQAffiche *lab = new QAffiche(QString(fav.getName()), 0, QColor(), this);\n\t\tlab->setText(fav.getName());\n\t\tlab->setToolTip(\"<img src=\\\"\" + fav.getImagePath() + \"\\\" \/><br\/>\" + tr(\"<b>Name:<\/b> %1<br\/><b>Note:<\/b> %2 %%<br\/><b>Last view:<\/b> %3\").arg(fav.getName(), QString::number(fav.getNote()), fav.getLastViewed().toString(Qt::DefaultLocaleShortDate)));\n\t\tlab->setCursor(Qt::PointingHandCursor);\n\n\t\tconnect(lab, SIGNAL(clicked(QString)), this, SIGNAL(open(QString)));\n\t\tconnect(lab, SIGNAL(middleClicked(QString)), this, SIGNAL(openInNewTab(QString)));\n\n\t\tui->layoutFavorites->addWidget(lab);\n\t}\n}\n<commit_msg>Make favorites alternate background in favorites dock (issue #1957)<commit_after>#include \"docks\/favorites-dock.h\"\n#include <QEvent>\n#include <QStringList>\n#include <ui_favorites-dock.h>\n#include \"functions.h\"\n#include \"helpers.h\"\n#include \"models\/favorite.h\"\n#include \"models\/profile.h\"\n#include \"ui\/QAffiche.h\"\n\n\nFavoritesDock::FavoritesDock(Profile *profile, QWidget *parent)\n\t: Dock(parent), ui(new Ui::FavoritesDock), m_favorites(profile->getFavorites())\n{\n\tui->setupUi(this);\n\n\tconnect(profile, &Profile::favoritesChanged, this, &FavoritesDock::refresh);\n\n\trefresh();\n\n}\n\nFavoritesDock::~FavoritesDock()\n{\n\tclose();\n\tdelete ui;\n}\n\nvoid FavoritesDock::changeEvent(QEvent *event)\n{\n\tif (event->type() == QEvent::LanguageChange) {\n\t\tui->retranslateUi(this);\n\t}\n\n\tQWidget::changeEvent(event);\n}\n\nvoid FavoritesDock::changeSortDirection()\n{\n\tm_descending = !m_descending;\n\n\tstatic const QIcon asc(\":\/images\/icons\/arrow-down.png\");\n\tstatic const QIcon desc(\":\/images\/icons\/arrow-up.png\");\n\tui->buttonSortDirection->setIcon(m_descending ? desc : asc);\n\n\trefresh();\n}\n\nvoid FavoritesDock::refresh()\n{\n\tclearLayout(ui->layoutFavorites);\n\n\t\/\/ Sort\n\tstatic const QStringList assoc { \"name\", \"note\", \"lastviewed\" };\n\tconst QString order = assoc[qMax(ui->comboSortBy->currentIndex(), 0)];\n\tif (order == \"note\") {\n\t\tstd::sort(m_favorites.begin(), m_favorites.end(), Favorite::sortByNote);\n\t} else if (order == \"lastviewed\") {\n\t\tstd::sort(m_favorites.begin(), m_favorites.end(), Favorite::sortByLastViewed);\n\t} else {\n\t\tstd::sort(m_favorites.begin(), m_favorites.end(), Favorite::sortByName);\n\t}\n\n\t\/\/ Reverse\n\tif (m_descending) {\n\t\tm_favorites = reversed(m_favorites);\n\t}\n\n\tint i = 0;\n\tfor (const Favorite &fav : qAsConst(m_favorites)) {\n\t\tQAffiche *lab = new QAffiche(QString(fav.getName()), 0, QColor(), this);\n\t\tlab->setText(fav.getName());\n\t\tlab->setToolTip(\"<img src=\\\"\" + fav.getImagePath() + \"\\\" \/><br\/>\" + tr(\"<b>Name:<\/b> %1<br\/><b>Note:<\/b> %2 %%<br\/><b>Last view:<\/b> %3\").arg(fav.getName(), QString::number(fav.getNote()), fav.getLastViewed().toString(Qt::DefaultLocaleShortDate)));\n\t\tlab->setCursor(Qt::PointingHandCursor);\n\n\t\tif (i++ % 2 == 1) {\n\t\t\tlab->setStyleSheet(\"QAffiche { background-color: rgba(128, 128, 128, 10%); }\");\n\t\t}\n\n\t\tconnect(lab, SIGNAL(clicked(QString)), this, SIGNAL(open(QString)));\n\t\tconnect(lab, SIGNAL(middleClicked(QString)), this, SIGNAL(openInNewTab(QString)));\n\n\t\tui->layoutFavorites->addWidget(lab);\n\t}\n}\n<|endoftext|>"} {"text":"<commit_before>\/*\n * Copyright 2011-2017 Branimir Karadzic. All rights reserved.\n * License: https:\/\/github.com\/bkaradzic\/bgfx#license-bsd-2-clause\n *\/\n\n#include \"common.h\"\n#include \"bgfx_utils.h\"\n#include <entry\/cmd.h>\n#include <entry\/input.h>\n\n#include <camera.h>\n#include <debugdraw\/debugdraw.h>\n#include <imgui\/imgui.h>\n\n#include <bx\/rng.h>\n#include <bx\/easing.h>\n\n#include <ps\/particle_system.h>\n\nstatic const char* s_shapeNames[] =\n{\n\t\"Sphere\",\n\t\"Hemisphere\",\n\t\"Circle\",\n\t\"Disc\",\n\t\"Rect\",\n};\n\nstatic const char* s_directionName[] =\n{\n\t\"Up\",\n\t\"Outward\",\n};\n\nstatic const char* s_easeFuncName[] =\n{\n\t\"Linear\",\n\t\"InQuad\",\n\t\"OutQuad\",\n\t\"InOutQuad\",\n\t\"OutInQuad\",\n\t\"InCubic\",\n\t\"OutCubic\",\n\t\"InOutCubic\",\n\t\"OutInCubic\",\n\t\"InQuart\",\n\t\"OutQuart\",\n\t\"InOutQuart\",\n\t\"OutInQuart\",\n\t\"InQuint\",\n\t\"OutQuint\",\n\t\"InOutQuint\",\n\t\"OutInQuint\",\n\t\"InSine\",\n\t\"OutSine\",\n\t\"InOutSine\",\n\t\"OutInSine\",\n\t\"InExpo\",\n\t\"OutExpo\",\n\t\"InOutExpo\",\n\t\"OutInExpo\",\n\t\"InCirc\",\n\t\"OutCirc\",\n\t\"InOutCirc\",\n\t\"OutInCirc\",\n\t\"InElastic\",\n\t\"OutElastic\",\n\t\"InOutElastic\",\n\t\"OutInElastic\",\n\t\"InBack\",\n\t\"OutBack\",\n\t\"InOutBack\",\n\t\"OutInBack\",\n\t\"InBounce\",\n\t\"OutBounce\",\n\t\"InOutBounce\",\n\t\"OutInBounce\",\n};\nBX_STATIC_ASSERT(BX_COUNTOF(s_easeFuncName) == bx::Easing::Count);\n\nstruct Emitter\n{\n\tEmitterUniforms m_uniforms;\n\tEmitterHandle m_handle;\n\n\tEmitterShape::Enum m_shape;\n\tEmitterDirection::Enum m_direction;\n\n\tvoid create()\n\t{\n\t\tm_shape = EmitterShape::Sphere;\n\t\tm_direction = EmitterDirection::Outward;\n\n\t\tm_handle = psCreateEmitter(m_shape, m_direction, 1024);\n\t\tm_uniforms.reset();\n\t}\n\n\tvoid destroy()\n\t{\n\t\tpsDestroyEmitter(m_handle);\n\t}\n\n\tvoid update()\n\t{\n\t\tpsUpdateEmitter(m_handle, &m_uniforms);\n\t}\n\n\tvoid imgui(const float* _view, const float* _proj)\n\t{\n\/\/\t\tif (ImGui::CollapsingHeader(\"General\") )\n\t\t{\n\t\t\tif (ImGui::Combo(\"Shape\", (int*)&m_shape, s_shapeNames, BX_COUNTOF(s_shapeNames) )\n\t\t\t|| ImGui::Combo(\"Direction\", (int*)&m_direction, s_directionName, BX_COUNTOF(s_directionName) ) )\n\t\t\t{\n\t\t\t\tpsDestroyEmitter(m_handle);\n\t\t\t\tm_handle = psCreateEmitter(m_shape, m_direction, 1024);\n\t\t\t}\n\n\t\t\tImGui::SliderInt(\"particles \/ s\", (int*)&m_uniforms.m_particlesPerSecond, 0, 1024);\n\n\t\t\tImGui::SliderFloat(\"Gravity scale\"\n\t\t\t\t\t, &m_uniforms.m_gravityScale\n\t\t\t\t\t, -2.0f\n\t\t\t\t\t, 2.0f\n\t\t\t\t\t);\n\n\t\t\tImGui::RangeSliderFloat(\"Life span\"\n\t\t\t\t\t, &m_uniforms.m_lifeSpan[0]\n\t\t\t\t\t, &m_uniforms.m_lifeSpan[1]\n\t\t\t\t\t, 0.1f\n\t\t\t\t\t, 5.0f\n\t\t\t\t\t);\n\n\t\t\tif (ImGui::Button(\"Reset\") )\n\t\t\t{\n\t\t\t\tpsUpdateEmitter(m_handle);\n\t\t\t}\n\t\t}\n\n\t\tif (ImGui::CollapsingHeader(\"Position and scale\") )\n\t\t{\n\t\t\tImGui::Combo(\"Position Ease\", (int*)&m_uniforms.m_easePos, s_easeFuncName, BX_COUNTOF(s_easeFuncName) );\n\n\t\t\tImGui::RangeSliderFloat(\"Start offset\"\n\t\t\t\t\t, &m_uniforms.m_offsetStart[0]\n\t\t\t\t\t, &m_uniforms.m_offsetStart[1]\n\t\t\t\t\t, 0.0f\n\t\t\t\t\t, 10.0f\n\t\t\t\t\t);\n\t\t\tImGui::RangeSliderFloat(\"End offset\"\n\t\t\t\t\t, &m_uniforms.m_offsetEnd[0]\n\t\t\t\t\t, &m_uniforms.m_offsetEnd[1]\n\t\t\t\t\t, 0.0f\n\t\t\t\t\t, 10.0f\n\t\t\t\t\t);\n\n\t\t\tImGui::Text(\"Scale:\");\n\n\t\t\tImGui::Combo(\"Scale Ease\", (int*)&m_uniforms.m_easeScale, s_easeFuncName, BX_COUNTOF(s_easeFuncName) );\n\n\t\t\tImGui::RangeSliderFloat(\"Scale Start\"\n\t\t\t\t\t, &m_uniforms.m_scaleStart[0]\n\t\t\t\t\t, &m_uniforms.m_scaleStart[1]\n\t\t\t\t\t, 0.0f\n\t\t\t\t\t, 3.0f\n\t\t\t\t\t);\n\t\t\tImGui::RangeSliderFloat(\"Scale End\"\n\t\t\t\t\t, &m_uniforms.m_scaleEnd[0]\n\t\t\t\t\t, &m_uniforms.m_scaleEnd[1]\n\t\t\t\t\t, 0.0f\n\t\t\t\t\t, 3.0f\n\t\t\t\t\t);\n\t\t}\n\n\t\tif (ImGui::CollapsingHeader(\"Blending and color\") )\n\t\t{\n\t\t\tImGui::Combo(\"Blend Ease\", (int*)&m_uniforms.m_easeBlend, s_easeFuncName, BX_COUNTOF(s_easeFuncName) );\n\t\t\tImGui::RangeSliderFloat(\"Blend Start\"\n\t\t\t\t\t, &m_uniforms.m_blendStart[0]\n\t\t\t\t\t, &m_uniforms.m_blendStart[1]\n\t\t\t\t\t, 0.0f\n\t\t\t\t\t, 1.0f\n\t\t\t\t\t);\n\t\t\tImGui::RangeSliderFloat(\"Blend End\"\n\t\t\t\t\t, &m_uniforms.m_blendEnd[0]\n\t\t\t\t\t, &m_uniforms.m_blendEnd[1]\n\t\t\t\t\t, 0.0f\n\t\t\t\t\t, 1.0f\n\t\t\t\t\t);\n\n\t\t\tImGui::Text(\"Color:\");\n\n\t\t\tImGui::Combo(\"RGBA Ease\", (int*)&m_uniforms.m_easeRgba, s_easeFuncName, BX_COUNTOF(s_easeFuncName) );\n\t\t\tImGui::ColorEdit4(\"RGBA0\", &m_uniforms.m_rgba[0], true);\n\t\t\tImGui::ColorEdit4(\"RGBA1\", &m_uniforms.m_rgba[1], true);\n\t\t\tImGui::ColorEdit4(\"RGBA2\", &m_uniforms.m_rgba[2], true);\n\t\t\tImGui::ColorEdit4(\"RGBA3\", &m_uniforms.m_rgba[3], true);\n\t\t\tImGui::ColorEdit4(\"RGBA4\", &m_uniforms.m_rgba[4], true);\n\t\t}\n\n\t\tImGui::End();\n\n\t\tfloat mtx[16];\n\t\tbx::mtxSRT(mtx\n\t\t\t\t, 1.0f, 1.0f, 1.0f\n\t\t\t\t, m_uniforms.m_angle[0], m_uniforms.m_angle[1], m_uniforms.m_angle[2]\n\t\t\t\t, m_uniforms.m_position[0], m_uniforms.m_position[1], m_uniforms.m_position[2]\n\t\t\t\t);\n\n\t\tImGuizmo::Manipulate(\n\t\t\t\t_view\n\t\t\t\t, _proj\n\t\t\t\t, ImGuizmo::OPERATION::TRANSLATE\n\t\t\t\t, ImGuizmo::MODE::LOCAL\n\t\t\t\t, mtx\n\t\t\t\t);\n\n\t\tfloat scale[3];\n\t\tImGuizmo::DecomposeMatrixToComponents(mtx, m_uniforms.m_position, m_uniforms.m_angle, scale);\n\t}\n};\n\nclass Particles : public entry::AppI\n{\n\tvoid init(int _argc, char** _argv) BX_OVERRIDE\n\t{\n\t\tArgs args(_argc, _argv);\n\n\t\tm_width = 1280;\n\t\tm_height = 720;\n\t\tm_debug = BGFX_DEBUG_TEXT;\n\t\tm_reset = BGFX_RESET_VSYNC;\n\n\t\tbgfx::init(args.m_type, args.m_pciId);\n\t\tbgfx::reset(m_width, m_height, m_reset);\n\n\t\t\/\/ Enable m_debug text.\n\t\tbgfx::setDebug(m_debug);\n\n\t\t\/\/ Set view 0 clear state.\n\t\tbgfx::setViewClear(0\n\t\t\t\t, BGFX_CLEAR_COLOR|BGFX_CLEAR_DEPTH\n\t\t\t\t, 0x202020ff\n\t\t\t\t, 1.0f\n\t\t\t\t, 0\n\t\t\t\t);\n\n\t\tddInit();\n\n\t\tpsInit();\n\n\t\tfor (uint32_t ii = 0; ii < BX_COUNTOF(m_emitter); ++ii)\n\t\t{\n\t\t\tm_emitter[ii].create();\n\t\t}\n\n\t\timguiCreate();\n\n\t\tcameraCreate();\n\n\t\tconst float initialPos[3] = { 0.0f, 2.0f, -12.0f };\n\t\tcameraSetPosition(initialPos);\n\t\tcameraSetVerticalAngle(0.0f);\n\n\t\tm_timeOffset = bx::getHPCounter();\n\t}\n\n\tvirtual int shutdown() BX_OVERRIDE\n\t{\n\t\tfor (uint32_t ii = 0; ii < BX_COUNTOF(m_emitter); ++ii)\n\t\t{\n\t\t\tm_emitter[ii].destroy();\n\t\t}\n\n\t\tpsShutdown();\n\n\t\tddShutdown();\n\n\t\timguiDestroy();\n\n\t\tcameraDestroy();\n\n\t\t\/\/ Shutdown bgfx.\n\t\tbgfx::shutdown();\n\n\t\treturn 0;\n\t}\n\n\tbool update() BX_OVERRIDE\n\t{\n\t\tif (!entry::processEvents(m_width, m_height, m_debug, m_reset, &m_mouseState) )\n\t\t{\n\t\t\t\/\/ Set view 0 default viewport.\n\t\t\tbgfx::setViewRect(0, 0, 0, m_width, m_height);\n\n\t\t\tbgfx::touch(0);\n\n\t\t\tint64_t now = bx::getHPCounter() - m_timeOffset;\n\t\t\tstatic int64_t last = now;\n\t\t\tconst int64_t frameTime = now - last;\n\t\t\tlast = now;\n\t\t\tconst double freq = double(bx::getHPFrequency() );\n\t\t\tconst double toMs = 1000.0\/freq;\n\t\t\tconst float deltaTime = float(frameTime\/freq);\n\n\t\t\t\/\/ Use debug font to print information about this example.\n\t\t\tbgfx::dbgTextClear();\n\t\t\tbgfx::dbgTextPrintf(0, 1, 0x4f, \"bgfx\/examples\/32-particles\");\n\t\t\tbgfx::dbgTextPrintf(0, 2, 0x6f, \"Description: Particles.\");\n\t\t\tbgfx::dbgTextPrintf(0, 3, 0x0f, \"Frame: % 7.3f[ms]\", double(frameTime)*toMs);\n\n\t\t\t\/\/ Update camera.George RR Martin\n\t\t\tcameraUpdate(deltaTime, m_mouseState);\n\n\t\t\tfloat view[16];\n\t\t\tcameraGetViewMtx(view);\n\n\t\t\tfloat proj[16];\n\n\t\t\t\/\/ Set view and projection matrix for view 0.\n\t\t\tconst bgfx::HMD* hmd = bgfx::getHMD();\n\t\t\tif (NULL != hmd && 0 != (hmd->flags & BGFX_HMD_RENDERING) )\n\t\t\t{\n\t\t\t\tfloat eye[3];\n\t\t\t\tcameraGetPosition(eye);\n\t\t\t\tbx::mtxQuatTranslationHMD(view, hmd->eye[0].rotation, eye);\n\t\t\t\tbgfx::setViewTransform(0, view, hmd->eye[0].projection, BGFX_VIEW_STEREO, hmd->eye[1].projection);\n\t\t\t\tbgfx::setViewRect(0, 0, 0, hmd->width, hmd->height);\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\tbx::mtxProj(proj, 60.0f, float(m_width)\/float(m_height), 0.1f, 100.0f);\n\n\t\t\t\tbgfx::setViewTransform(0, view, proj);\n\t\t\t\tbgfx::setViewRect(0, 0, 0, m_width, m_height);\n\t\t\t}\n\n\t\t\timguiBeginFrame(\n\t\t\t\t m_mouseState.m_mx\n\t\t\t\t, m_mouseState.m_my\n\t\t\t\t, (m_mouseState.m_buttons[entry::MouseButton::Left ] ? IMGUI_MBUT_LEFT : 0)\n\t\t\t\t| (m_mouseState.m_buttons[entry::MouseButton::Right ] ? IMGUI_MBUT_RIGHT : 0)\n\t\t\t\t| (m_mouseState.m_buttons[entry::MouseButton::Middle] ? IMGUI_MBUT_MIDDLE : 0)\n\t\t\t\t, m_mouseState.m_mz\n\t\t\t\t, m_width\n\t\t\t\t, m_height\n\t\t\t\t);\n\n\t\t\tImGui::Begin(\"Properties\"\n\t\t\t\t, NULL\n\t\t\t\t, ImVec2(400.0f, 600.0f)\n\t\t\t\t, ImGuiWindowFlags_AlwaysAutoResize\n\t\t\t\t);\n\n\t\t\tstatic float timeScale = 1.0f;\n\t\t\tImGui::SliderFloat(\"Time scale\"\n\t\t\t\t, &timeScale\n\t\t\t\t, 0.0f\n\t\t\t\t, 1.0f\n\t\t\t\t);\n\n\t\t\tstatic bool showBounds;\n\t\t\tImGui::Checkbox(\"Show bounds\", &showBounds);\n\n\t\t\tImGui::Text(\"Emitter:\");\n\t\t\tstatic int currentEmitter = 0;\n\t\t\tfor (uint32_t ii = 0; ii < BX_COUNTOF(m_emitter); ++ii)\n\t\t\t{\n\t\t\t\tImGui::SameLine();\n\n\t\t\t\tchar name[16];\n\t\t\t\tbx::snprintf(name, BX_COUNTOF(name), \"%d\", ii);\n\n\t\t\t\tImGui::RadioButton(name, ¤tEmitter, ii);\n\t\t\t}\n\n\t\t\tm_emitter[currentEmitter].imgui(view, proj);\n\n\t\t\timguiEndFrame();\n\n\t\t\tddBegin(0);\n\n\t\t\tfloat center[3] = { 0.0f, 0.0f, 0.0f };\n\t\t\tddDrawGrid(Axis::Y, center);\n\n\t\t\tfloat eye[3];\n\t\t\tcameraGetPosition(eye);\n\n\t\t\tm_emitter[currentEmitter].update();\n\n\t\t\tpsUpdate(deltaTime * timeScale);\n\t\t\tpsRender(0, view, eye);\n\n\t\t\tif (showBounds)\n\t\t\t{\n\t\t\t\tAabb aabb;\n\t\t\t\tpsGetAabb(m_emitter[currentEmitter].m_handle, aabb);\n\t\t\t\tddSetColor(0xff0000ff);\n\t\t\t\tddDraw(aabb);\n\t\t\t}\n\n\n\t\t\tddEnd();\n\n\t\t\t\/\/ Advance to next frame. Rendering thread will be kicked to\n\t\t\t\/\/ process submitted rendering primitives.\n\t\t\tbgfx::frame();\n\n\t\t\treturn true;\n\t\t}\n\n\t\treturn false;\n\t}\n\n\tentry::MouseState m_mouseState;\n\n\tint64_t m_timeOffset;\n\n\tuint32_t m_width;\n\tuint32_t m_height;\n\tuint32_t m_debug;\n\tuint32_t m_reset;\n\n\tEmitter m_emitter[4];\n};\n\nENTRY_IMPLEMENT_MAIN(Particles);\n<commit_msg>Cleanup.<commit_after>\/*\n * Copyright 2011-2017 Branimir Karadzic. All rights reserved.\n * License: https:\/\/github.com\/bkaradzic\/bgfx#license-bsd-2-clause\n *\/\n\n#include \"common.h\"\n#include \"bgfx_utils.h\"\n#include <entry\/cmd.h>\n#include <entry\/input.h>\n\n#include <camera.h>\n#include <debugdraw\/debugdraw.h>\n#include <imgui\/imgui.h>\n\n#include <bx\/rng.h>\n#include <bx\/easing.h>\n\n#include <ps\/particle_system.h>\n\nstatic const char* s_shapeNames[] =\n{\n\t\"Sphere\",\n\t\"Hemisphere\",\n\t\"Circle\",\n\t\"Disc\",\n\t\"Rect\",\n};\n\nstatic const char* s_directionName[] =\n{\n\t\"Up\",\n\t\"Outward\",\n};\n\nstatic const char* s_easeFuncName[] =\n{\n\t\"Linear\",\n\t\"InQuad\",\n\t\"OutQuad\",\n\t\"InOutQuad\",\n\t\"OutInQuad\",\n\t\"InCubic\",\n\t\"OutCubic\",\n\t\"InOutCubic\",\n\t\"OutInCubic\",\n\t\"InQuart\",\n\t\"OutQuart\",\n\t\"InOutQuart\",\n\t\"OutInQuart\",\n\t\"InQuint\",\n\t\"OutQuint\",\n\t\"InOutQuint\",\n\t\"OutInQuint\",\n\t\"InSine\",\n\t\"OutSine\",\n\t\"InOutSine\",\n\t\"OutInSine\",\n\t\"InExpo\",\n\t\"OutExpo\",\n\t\"InOutExpo\",\n\t\"OutInExpo\",\n\t\"InCirc\",\n\t\"OutCirc\",\n\t\"InOutCirc\",\n\t\"OutInCirc\",\n\t\"InElastic\",\n\t\"OutElastic\",\n\t\"InOutElastic\",\n\t\"OutInElastic\",\n\t\"InBack\",\n\t\"OutBack\",\n\t\"InOutBack\",\n\t\"OutInBack\",\n\t\"InBounce\",\n\t\"OutBounce\",\n\t\"InOutBounce\",\n\t\"OutInBounce\",\n};\nBX_STATIC_ASSERT(BX_COUNTOF(s_easeFuncName) == bx::Easing::Count);\n\nstruct Emitter\n{\n\tEmitterUniforms m_uniforms;\n\tEmitterHandle m_handle;\n\n\tEmitterShape::Enum m_shape;\n\tEmitterDirection::Enum m_direction;\n\n\tvoid create()\n\t{\n\t\tm_shape = EmitterShape::Sphere;\n\t\tm_direction = EmitterDirection::Outward;\n\n\t\tm_handle = psCreateEmitter(m_shape, m_direction, 1024);\n\t\tm_uniforms.reset();\n\t}\n\n\tvoid destroy()\n\t{\n\t\tpsDestroyEmitter(m_handle);\n\t}\n\n\tvoid update()\n\t{\n\t\tpsUpdateEmitter(m_handle, &m_uniforms);\n\t}\n\n\tvoid imgui(const float* _view, const float* _proj)\n\t{\n\/\/\t\tif (ImGui::CollapsingHeader(\"General\") )\n\t\t{\n\t\t\tif (ImGui::Combo(\"Shape\", (int*)&m_shape, s_shapeNames, BX_COUNTOF(s_shapeNames) )\n\t\t\t|| ImGui::Combo(\"Direction\", (int*)&m_direction, s_directionName, BX_COUNTOF(s_directionName) ) )\n\t\t\t{\n\t\t\t\tpsDestroyEmitter(m_handle);\n\t\t\t\tm_handle = psCreateEmitter(m_shape, m_direction, 1024);\n\t\t\t}\n\n\t\t\tImGui::SliderInt(\"particles \/ s\", (int*)&m_uniforms.m_particlesPerSecond, 0, 1024);\n\n\t\t\tImGui::SliderFloat(\"Gravity scale\"\n\t\t\t\t\t, &m_uniforms.m_gravityScale\n\t\t\t\t\t, -2.0f\n\t\t\t\t\t, 2.0f\n\t\t\t\t\t);\n\n\t\t\tImGui::RangeSliderFloat(\"Life span\"\n\t\t\t\t\t, &m_uniforms.m_lifeSpan[0]\n\t\t\t\t\t, &m_uniforms.m_lifeSpan[1]\n\t\t\t\t\t, 0.1f\n\t\t\t\t\t, 5.0f\n\t\t\t\t\t);\n\n\t\t\tif (ImGui::Button(\"Reset\") )\n\t\t\t{\n\t\t\t\tpsUpdateEmitter(m_handle);\n\t\t\t}\n\t\t}\n\n\t\tif (ImGui::CollapsingHeader(\"Position and scale\") )\n\t\t{\n\t\t\tImGui::Combo(\"Position Ease\", (int*)&m_uniforms.m_easePos, s_easeFuncName, BX_COUNTOF(s_easeFuncName) );\n\n\t\t\tImGui::RangeSliderFloat(\"Start offset\"\n\t\t\t\t\t, &m_uniforms.m_offsetStart[0]\n\t\t\t\t\t, &m_uniforms.m_offsetStart[1]\n\t\t\t\t\t, 0.0f\n\t\t\t\t\t, 10.0f\n\t\t\t\t\t);\n\t\t\tImGui::RangeSliderFloat(\"End offset\"\n\t\t\t\t\t, &m_uniforms.m_offsetEnd[0]\n\t\t\t\t\t, &m_uniforms.m_offsetEnd[1]\n\t\t\t\t\t, 0.0f\n\t\t\t\t\t, 10.0f\n\t\t\t\t\t);\n\n\t\t\tImGui::Text(\"Scale:\");\n\n\t\t\tImGui::Combo(\"Scale Ease\", (int*)&m_uniforms.m_easeScale, s_easeFuncName, BX_COUNTOF(s_easeFuncName) );\n\n\t\t\tImGui::RangeSliderFloat(\"Scale Start\"\n\t\t\t\t\t, &m_uniforms.m_scaleStart[0]\n\t\t\t\t\t, &m_uniforms.m_scaleStart[1]\n\t\t\t\t\t, 0.0f\n\t\t\t\t\t, 3.0f\n\t\t\t\t\t);\n\t\t\tImGui::RangeSliderFloat(\"Scale End\"\n\t\t\t\t\t, &m_uniforms.m_scaleEnd[0]\n\t\t\t\t\t, &m_uniforms.m_scaleEnd[1]\n\t\t\t\t\t, 0.0f\n\t\t\t\t\t, 3.0f\n\t\t\t\t\t);\n\t\t}\n\n\t\tif (ImGui::CollapsingHeader(\"Blending and color\") )\n\t\t{\n\t\t\tImGui::Combo(\"Blend Ease\", (int*)&m_uniforms.m_easeBlend, s_easeFuncName, BX_COUNTOF(s_easeFuncName) );\n\t\t\tImGui::RangeSliderFloat(\"Blend Start\"\n\t\t\t\t\t, &m_uniforms.m_blendStart[0]\n\t\t\t\t\t, &m_uniforms.m_blendStart[1]\n\t\t\t\t\t, 0.0f\n\t\t\t\t\t, 1.0f\n\t\t\t\t\t);\n\t\t\tImGui::RangeSliderFloat(\"Blend End\"\n\t\t\t\t\t, &m_uniforms.m_blendEnd[0]\n\t\t\t\t\t, &m_uniforms.m_blendEnd[1]\n\t\t\t\t\t, 0.0f\n\t\t\t\t\t, 1.0f\n\t\t\t\t\t);\n\n\t\t\tImGui::Text(\"Color:\");\n\n\t\t\tImGui::Combo(\"RGBA Ease\", (int*)&m_uniforms.m_easeRgba, s_easeFuncName, BX_COUNTOF(s_easeFuncName) );\n\t\t\tImGui::ColorEdit4(\"RGBA0\", &m_uniforms.m_rgba[0], true);\n\t\t\tImGui::ColorEdit4(\"RGBA1\", &m_uniforms.m_rgba[1], true);\n\t\t\tImGui::ColorEdit4(\"RGBA2\", &m_uniforms.m_rgba[2], true);\n\t\t\tImGui::ColorEdit4(\"RGBA3\", &m_uniforms.m_rgba[3], true);\n\t\t\tImGui::ColorEdit4(\"RGBA4\", &m_uniforms.m_rgba[4], true);\n\t\t}\n\n\t\tImGui::End();\n\n\t\tfloat mtx[16];\n\t\tbx::mtxSRT(mtx\n\t\t\t\t, 1.0f, 1.0f, 1.0f\n\t\t\t\t, m_uniforms.m_angle[0], m_uniforms.m_angle[1], m_uniforms.m_angle[2]\n\t\t\t\t, m_uniforms.m_position[0], m_uniforms.m_position[1], m_uniforms.m_position[2]\n\t\t\t\t);\n\n\t\tImGuizmo::Manipulate(\n\t\t\t\t_view\n\t\t\t\t, _proj\n\t\t\t\t, ImGuizmo::OPERATION::TRANSLATE\n\t\t\t\t, ImGuizmo::MODE::LOCAL\n\t\t\t\t, mtx\n\t\t\t\t);\n\n\t\tfloat scale[3];\n\t\tImGuizmo::DecomposeMatrixToComponents(mtx, m_uniforms.m_position, m_uniforms.m_angle, scale);\n\t}\n};\n\nclass Particles : public entry::AppI\n{\n\tvoid init(int _argc, char** _argv) BX_OVERRIDE\n\t{\n\t\tArgs args(_argc, _argv);\n\n\t\tm_width = 1280;\n\t\tm_height = 720;\n\t\tm_debug = BGFX_DEBUG_TEXT;\n\t\tm_reset = BGFX_RESET_VSYNC;\n\n\t\tbgfx::init(args.m_type, args.m_pciId);\n\t\tbgfx::reset(m_width, m_height, m_reset);\n\n\t\t\/\/ Enable m_debug text.\n\t\tbgfx::setDebug(m_debug);\n\n\t\t\/\/ Set view 0 clear state.\n\t\tbgfx::setViewClear(0\n\t\t\t\t, BGFX_CLEAR_COLOR|BGFX_CLEAR_DEPTH\n\t\t\t\t, 0x202020ff\n\t\t\t\t, 1.0f\n\t\t\t\t, 0\n\t\t\t\t);\n\n\t\tddInit();\n\n\t\tpsInit();\n\n\t\tfor (uint32_t ii = 0; ii < BX_COUNTOF(m_emitter); ++ii)\n\t\t{\n\t\t\tm_emitter[ii].create();\n\t\t}\n\n\t\timguiCreate();\n\n\t\tcameraCreate();\n\n\t\tconst float initialPos[3] = { 0.0f, 2.0f, -12.0f };\n\t\tcameraSetPosition(initialPos);\n\t\tcameraSetVerticalAngle(0.0f);\n\n\t\tm_timeOffset = bx::getHPCounter();\n\t}\n\n\tvirtual int shutdown() BX_OVERRIDE\n\t{\n\t\tfor (uint32_t ii = 0; ii < BX_COUNTOF(m_emitter); ++ii)\n\t\t{\n\t\t\tm_emitter[ii].destroy();\n\t\t}\n\n\t\tpsShutdown();\n\n\t\tddShutdown();\n\n\t\timguiDestroy();\n\n\t\tcameraDestroy();\n\n\t\t\/\/ Shutdown bgfx.\n\t\tbgfx::shutdown();\n\n\t\treturn 0;\n\t}\n\n\tbool update() BX_OVERRIDE\n\t{\n\t\tif (!entry::processEvents(m_width, m_height, m_debug, m_reset, &m_mouseState) )\n\t\t{\n\t\t\t\/\/ Set view 0 default viewport.\n\t\t\tbgfx::setViewRect(0, 0, 0, m_width, m_height);\n\n\t\t\tbgfx::touch(0);\n\n\t\t\tint64_t now = bx::getHPCounter() - m_timeOffset;\n\t\t\tstatic int64_t last = now;\n\t\t\tconst int64_t frameTime = now - last;\n\t\t\tlast = now;\n\t\t\tconst double freq = double(bx::getHPFrequency() );\n\t\t\tconst double toMs = 1000.0\/freq;\n\t\t\tconst float deltaTime = float(frameTime\/freq);\n\n\t\t\t\/\/ Use debug font to print information about this example.\n\t\t\tbgfx::dbgTextClear();\n\t\t\tbgfx::dbgTextPrintf(0, 1, 0x4f, \"bgfx\/examples\/32-particles\");\n\t\t\tbgfx::dbgTextPrintf(0, 2, 0x6f, \"Description: Particles.\");\n\t\t\tbgfx::dbgTextPrintf(0, 3, 0x0f, \"Frame: % 7.3f[ms]\", double(frameTime)*toMs);\n\n\t\t\t\/\/ Update camera.George RR Martin\n\t\t\tcameraUpdate(deltaTime, m_mouseState);\n\n\t\t\tfloat view[16];\n\t\t\tcameraGetViewMtx(view);\n\n\t\t\tfloat proj[16];\n\n\t\t\t\/\/ Set view and projection matrix for view 0.\n\t\t\tconst bgfx::HMD* hmd = bgfx::getHMD();\n\t\t\tif (NULL != hmd && 0 != (hmd->flags & BGFX_HMD_RENDERING) )\n\t\t\t{\n\t\t\t\tfloat eye[3];\n\t\t\t\tcameraGetPosition(eye);\n\t\t\t\tbx::mtxQuatTranslationHMD(view, hmd->eye[0].rotation, eye);\n\t\t\t\tbgfx::setViewTransform(0, view, hmd->eye[0].projection, BGFX_VIEW_STEREO, hmd->eye[1].projection);\n\t\t\t\tbgfx::setViewRect(0, 0, 0, hmd->width, hmd->height);\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\tbx::mtxProj(proj, 60.0f, float(m_width)\/float(m_height), 0.1f, 100.0f);\n\n\t\t\t\tbgfx::setViewTransform(0, view, proj);\n\t\t\t\tbgfx::setViewRect(0, 0, 0, m_width, m_height);\n\t\t\t}\n\n\t\t\timguiBeginFrame(\n\t\t\t\t m_mouseState.m_mx\n\t\t\t\t, m_mouseState.m_my\n\t\t\t\t, (m_mouseState.m_buttons[entry::MouseButton::Left ] ? IMGUI_MBUT_LEFT : 0)\n\t\t\t\t| (m_mouseState.m_buttons[entry::MouseButton::Right ] ? IMGUI_MBUT_RIGHT : 0)\n\t\t\t\t| (m_mouseState.m_buttons[entry::MouseButton::Middle] ? IMGUI_MBUT_MIDDLE : 0)\n\t\t\t\t, m_mouseState.m_mz\n\t\t\t\t, m_width\n\t\t\t\t, m_height\n\t\t\t\t);\n\n\t\t\tImGui::Begin(\"Properties\"\n\t\t\t\t, NULL\n\t\t\t\t, ImVec2(400.0f, 600.0f)\n\t\t\t\t, ImGuiWindowFlags_AlwaysAutoResize\n\t\t\t\t);\n\n\t\t\tstatic float timeScale = 1.0f;\n\t\t\tImGui::SliderFloat(\"Time scale\"\n\t\t\t\t, &timeScale\n\t\t\t\t, 0.0f\n\t\t\t\t, 1.0f\n\t\t\t\t);\n\n\t\t\tstatic bool showBounds;\n\t\t\tImGui::Checkbox(\"Show bounds\", &showBounds);\n\n\t\t\tImGui::Text(\"Emitter:\");\n\t\t\tstatic int currentEmitter = 0;\n\t\t\tfor (uint32_t ii = 0; ii < BX_COUNTOF(m_emitter); ++ii)\n\t\t\t{\n\t\t\t\tImGui::SameLine();\n\n\t\t\t\tchar name[16];\n\t\t\t\tbx::snprintf(name, BX_COUNTOF(name), \"%d\", ii);\n\n\t\t\t\tImGui::RadioButton(name, ¤tEmitter, ii);\n\t\t\t}\n\n\t\t\tm_emitter[currentEmitter].imgui(view, proj);\n\n\t\t\timguiEndFrame();\n\n\t\t\tddBegin(0);\n\n\t\t\tfloat center[3] = { 0.0f, 0.0f, 0.0f };\n\t\t\tddDrawGrid(Axis::Y, center);\n\n\t\t\tfloat eye[3];\n\t\t\tcameraGetPosition(eye);\n\n\t\t\tm_emitter[currentEmitter].update();\n\n\t\t\tpsUpdate(deltaTime * timeScale);\n\t\t\tpsRender(0, view, eye);\n\n\t\t\tif (showBounds)\n\t\t\t{\n\t\t\t\tAabb aabb;\n\t\t\t\tpsGetAabb(m_emitter[currentEmitter].m_handle, aabb);\n\t\t\t\tddSetColor(0xff0000ff);\n\t\t\t\tddDraw(aabb);\n\t\t\t}\n\n\t\t\tddEnd();\n\n\t\t\t\/\/ Advance to next frame. Rendering thread will be kicked to\n\t\t\t\/\/ process submitted rendering primitives.\n\t\t\tbgfx::frame();\n\n\t\t\treturn true;\n\t\t}\n\n\t\treturn false;\n\t}\n\n\tentry::MouseState m_mouseState;\n\n\tint64_t m_timeOffset;\n\n\tuint32_t m_width;\n\tuint32_t m_height;\n\tuint32_t m_debug;\n\tuint32_t m_reset;\n\n\tEmitter m_emitter[4];\n};\n\nENTRY_IMPLEMENT_MAIN(Particles);\n<|endoftext|>"} {"text":"<commit_before>#include \"TestRcGen.h\"\n#include \"Render\/Renderable\/StaticRenderable.h\"\n#include \"Render\/Renderable\/StaticRenderableContainer.h\"\n#include \"Render\/Shader\/Shader.h\"\n#include \"Render\/RenderCommand\/RenderCommand.h\"\n#include \"Render\/Camera.h\"\n#include \"Render\/Shader\/ShaderUniformUpdater.h\"\n\nnamespace ve\n{\n\nclass TestRenderCommand : public RenderCommand\n{\npublic:\n\tTestRenderCommand(const std::shared_ptr<ShaderUniformUpdater>& uniformUpdater,\n\t const ShaderProgram& shaderProgram,\n\t const GpuMesh& gpuMesh);\n\tvirtual ~TestRenderCommand() override;\n\n\tvirtual void execute() override;\n\nprivate:\n\tstd::shared_ptr<ShaderUniformUpdater> m_uniformUpdater;\n\tShaderProgram m_shaderProgram;\n\tGpuMesh m_gpuMesh;\n};\n\nclass TestUniformUpdater : public ShaderUniformUpdater\n{\npublic:\n\tTestUniformUpdater(const Camera& camera, const Matrix4f& modelMatrix);\n\tvirtual ~TestUniformUpdater() override;\n\n\tvirtual void updateUniforms(ShaderProgram& shaderProgram) const override;\n\nprivate:\n\tCamera m_camera;\n\tMatrix4f m_modelMatrix;\n};\n\n}\n\nusing namespace ve;\n\nTestRenderCommand::TestRenderCommand(const std::shared_ptr<ShaderUniformUpdater>& uniformUpdater, \n const ShaderProgram& shaderProgram,\n const GpuMesh& gpuMesh) : \n\tm_uniformUpdater(uniformUpdater), m_shaderProgram(shaderProgram), m_gpuMesh(gpuMesh)\n{\n\n}\n\nTestRenderCommand::~TestRenderCommand()\n{\n\n}\n\nvoid TestRenderCommand::execute()\n{\n\tm_shaderProgram.use();\n\n\tm_uniformUpdater->updateUniforms(m_shaderProgram);\n\n\tm_gpuMesh.bind();\n\tm_gpuMesh.draw();\n}\n\nTestUniformUpdater::TestUniformUpdater(const Camera& camera, const Matrix4f& modelMatrix) : \n\tm_camera(camera), m_modelMatrix(modelMatrix)\n{\n\n}\n\nTestUniformUpdater::~TestUniformUpdater()\n{\n\n}\n\nvoid TestUniformUpdater::updateUniforms(ShaderProgram& shaderProgram) const\n{\n\tshaderProgram.updateUniform(\"u_viewMatrix\", m_camera.getViewMatrix());\n\tshaderProgram.updateUniform(\"u_projectionMatrix\", m_camera.getProjectionMatrix());\n\tshaderProgram.updateUniform(\"u_modelMatrix\", m_modelMatrix);\n}\n\nbool TestRcGen::init()\n{\n\tm_shaderProgram.createProgram();\n\n\tShader vertShader(\".\/Shader\/TestShader.vs\");\n\tShader fragShader(\".\/Shader\/TestShader.fs\");\n\tvertShader.compile();\n\tfragShader.compile();\n\n\tm_shaderProgram.completeProgram(vertShader, fragShader);\n\n\tm_shaderProgram.registerUniform(\"u_viewMatrix\");\n\tm_shaderProgram.registerUniform(\"u_projectionMatrix\");\n\tm_shaderProgram.registerUniform(\"u_modelMatrix\");\n\n\treturn true;\n}\n\nvoid TestRcGen::genRenderCommands(const Camera& camera, \n const StaticRenderableContainer& renderables,\n std::vector<std::shared_ptr<RenderCommand>>* out_renderCommands) const\n{\n\tfor(uint32 x = 0; x < renderables.numStaticRenderables(); x++)\n\t{\n\t\tconst auto& renderable = renderables.getStaticRenderable(x);\n\t\tfor(uint32 i = 0; i < renderable.numMeshMaterialPairs(); i++)\n\t\t{\n\t\t\tconst auto& meshMatlPair = renderable.getMeshMaterialPair(i);\n\n\t\t\tout_renderCommands->push_back(std::make_shared<TestRenderCommand>(std::make_shared<TestUniformUpdater>(camera, renderable.getModelMatrix()),\n\t\t\t m_shaderProgram,\n\t\t\t meshMatlPair.first));\n\t\t}\n\t}\n}<commit_msg>lambda based uniform updater<commit_after>#include \"TestRcGen.h\"\n#include \"Render\/Renderable\/StaticRenderable.h\"\n#include \"Render\/Renderable\/StaticRenderableContainer.h\"\n#include \"Render\/Shader\/Shader.h\"\n#include \"Render\/RenderCommand\/RenderCommand.h\"\n#include \"Render\/Camera.h\"\n#include \"Render\/Shader\/ShaderUniformUpdater.h\"\n\n#include <functional>\n\nnamespace ve\n{\n\nclass TestRenderCommand : public RenderCommand\n{\npublic:\n\tTestRenderCommand(const std::function<void(ShaderProgram&)>& uniformUpdater,\n\t const ShaderProgram& shaderProgram,\n\t const GpuMesh& gpuMesh);\n\tvirtual ~TestRenderCommand() override;\n\n\tvirtual void execute() override;\n\nprivate:\n\tstd::function<void (ShaderProgram&)> m_uniformUpdater;\n\tShaderProgram m_shaderProgram;\n\tGpuMesh m_gpuMesh;\n};\n\n}\n\nusing namespace ve;\n\nTestRenderCommand::TestRenderCommand(const std::function<void(ShaderProgram&)>& uniformUpdater,\n const ShaderProgram& shaderProgram,\n const GpuMesh& gpuMesh) : \n\tm_uniformUpdater(uniformUpdater), m_shaderProgram(shaderProgram), m_gpuMesh(gpuMesh)\n{\n\n}\n\nTestRenderCommand::~TestRenderCommand()\n{\n\n}\n\nvoid TestRenderCommand::execute()\n{\n\tm_shaderProgram.use();\n\n\tm_uniformUpdater(m_shaderProgram);\n\n\tm_gpuMesh.bind();\n\tm_gpuMesh.draw();\n}\n\nbool TestRcGen::init()\n{\n\tm_shaderProgram.createProgram();\n\n\tShader vertShader(\".\/Shader\/TestShader.vs\");\n\tShader fragShader(\".\/Shader\/TestShader.fs\");\n\tvertShader.compile();\n\tfragShader.compile();\n\n\tm_shaderProgram.completeProgram(vertShader, fragShader);\n\n\tm_shaderProgram.registerUniform(\"u_viewMatrix\");\n\tm_shaderProgram.registerUniform(\"u_projectionMatrix\");\n\tm_shaderProgram.registerUniform(\"u_modelMatrix\");\n\n\treturn true;\n}\n\nvoid TestRcGen::genRenderCommands(const Camera& camera, \n const StaticRenderableContainer& renderables,\n std::vector<std::shared_ptr<RenderCommand>>* out_renderCommands) const\n{\n\tfor(uint32 x = 0; x < renderables.numStaticRenderables(); x++)\n\t{\n\t\tconst auto& renderable = renderables.getStaticRenderable(x);\n\t\tfor(uint32 i = 0; i < renderable.numMeshMaterialPairs(); i++)\n\t\t{\n\t\t\tconst auto& meshMatlPair = renderable.getMeshMaterialPair(i);\n\t\t\tconst auto& uniformUpdater = [&camera, &renderable](ShaderProgram& shaderProgram)\n\t\t\t{\n\t\t\t\tshaderProgram.updateUniform(\"u_viewMatrix\", camera.getViewMatrix());\n\t\t\t\tshaderProgram.updateUniform(\"u_projectionMatrix\", camera.getProjectionMatrix());\n\t\t\t\tshaderProgram.updateUniform(\"u_modelMatrix\", renderable.getModelMatrix());\n\t\t\t};\n\n\t\t\tconst auto& renderCommand = std::make_shared<TestRenderCommand>(uniformUpdater, m_shaderProgram, meshMatlPair.first);\n\t\t\tout_renderCommands->push_back(renderCommand);\n\t\t}\n\t}\n}<|endoftext|>"} {"text":"<commit_before>\/*\nCopyright (C) 2015,2018 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 <QIcon>\n#include <QFile>\n#include <QMimeData>\n#include <QDataStream>\n#include <QByteArray>\n#include <QXmlStreamWriter>\n#include <QTextStream>\n#include \"SceneModel.h\"\n#include \"aeongames\/Tree.h\"\n\nnamespace AeonGames\n{\n SceneModel::SceneModel ( QObject *parent ) :\n QAbstractItemModel ( parent )\n {\n }\n\n SceneModel::~SceneModel() = default;\n\n QVariant SceneModel::headerData ( int section, Qt::Orientation orientation, int role ) const\n {\n if ( ( orientation == Qt::Horizontal ) && ( role == Qt::DisplayRole ) )\n {\n switch ( section )\n {\n case 0:\n return QString ( \"Node\" );\n default:\n return QVariant();\n }\n }\n return QVariant();\n }\n\n QModelIndex SceneModel::index ( int row, int column, const QModelIndex & parent ) const\n {\n if ( !parent.isValid() )\n {\n if ( row < static_cast<int> ( mScene.GetChildrenCount() ) )\n {\n if ( row < mScene.GetChildrenCount() )\n {\n return createIndex ( row, column, &const_cast<SceneModel*> ( this )->mScene[row] );\n }\n }\n }\n else\n {\n Tree::Node* node = reinterpret_cast<Tree::Node*> ( parent.internalPointer() );\n if ( row < node->GetChildrenCount() )\n {\n return createIndex ( row, column, & ( node->GetChild ( row ) ) );\n }\n }\n return QModelIndex();\n }\n\n QModelIndex SceneModel::parent ( const QModelIndex & index ) const\n {\n if ( index.isValid() )\n {\n Tree::Node* node = reinterpret_cast<Tree::Node*> ( index.internalPointer() );\n Tree::Node* node_parent = node->GetParent();\n if ( node_parent != nullptr )\n {\n return createIndex ( static_cast<int> ( node->GetIndex() ), 0, node_parent );\n }\n }\n return QModelIndex();\n }\n\n int SceneModel::rowCount ( const QModelIndex & index ) const\n {\n if ( index.isValid() )\n {\n return static_cast<int> ( reinterpret_cast<Tree::Node*> ( index.internalPointer() )->GetChildrenCount() );\n }\n return static_cast<int> ( mScene.GetChildrenCount() );\n }\n\n int SceneModel::columnCount ( const QModelIndex & index ) const\n {\n return 1;\n }\n\n bool SceneModel::hasChildren ( const QModelIndex & index ) const\n {\n if ( index.isValid() )\n {\n return ( reinterpret_cast<Tree::Node*> ( index.internalPointer() )->GetChildrenCount() > 0 );\n }\n return ( mScene.GetChildrenCount() > 0 );\n }\n\n QVariant SceneModel::data ( const QModelIndex & index, int role ) const\n {\n if ( ( role == Qt::DisplayRole ) || ( role == Qt::EditRole ) )\n {\n if ( index.isValid() )\n {\n switch ( index.column() )\n {\n case 0:\n return QString ( reinterpret_cast<Tree::Node*> ( index.internalPointer() )->GetName().c_str() );\n break;\n }\n }\n }\n else if ( role == Qt::DecorationRole )\n {\n return QIcon ( \":\/icons\/icon_node\" );\n }\n else if ( role == Qt::UserRole )\n {\n return qVariantFromValue ( index.internalPointer() );\n }\n return QVariant();\n }\n\n Qt::ItemFlags SceneModel::flags ( const QModelIndex & index ) const\n {\n if ( index.isValid() )\n {\n return QAbstractItemModel::flags ( index ) | Qt::ItemIsEditable | Qt::ItemIsDragEnabled | Qt::ItemIsDropEnabled;\n }\n return QAbstractItemModel::flags ( index ) | Qt::ItemIsDropEnabled;\n }\n\n bool SceneModel::setData ( const QModelIndex & index, const QVariant & value, int role )\n {\n Tree::Node* node = reinterpret_cast<Tree::Node*> ( index.internalPointer() );\n if ( role == Qt::EditRole )\n {\n node->SetName ( value.toString().toUtf8().constData() );\n emit dataChanged ( index, index );\n return true;\n }\n return false;\n }\n\n bool SceneModel::moveRows ( const QModelIndex & sourceParent, int sourceRow, int count, const QModelIndex & destinationParent, int destinationRow )\n {\n if ( sourceParent.isValid() && destinationParent.isValid() )\n {\n \/\/ Moving between nodes\n Tree::Node* source = reinterpret_cast<Tree::Node*> ( sourceParent.internalPointer() );\n Tree::Node* destination = reinterpret_cast<Tree::Node*> ( destinationParent.internalPointer() );\n if ( beginMoveRows ( sourceParent, sourceRow, ( sourceRow + count ) - 1, destinationParent, destinationRow ) )\n {\n for ( int i = 0; i < count; ++i )\n {\n auto node = source->GetChild ( sourceRow );\n destination->Move ( destinationRow + i, std::move ( *source ) );\n }\n endMoveRows();\n }\n else\n {\n return false;\n }\n }\n else if ( sourceParent.isValid() )\n {\n \/\/ Moving from a node to the scene\n Tree::Node* source = reinterpret_cast<Tree::Node*> ( sourceParent.internalPointer() );\n if ( beginMoveRows ( sourceParent, sourceRow, ( sourceRow + count ) - 1, destinationParent, destinationRow ) )\n {\n for ( int i = 0; i < count; ++i )\n {\n auto node = source->GetChild ( sourceRow );\n mScene.Move ( destinationRow, std::move ( *source ) );\n }\n endMoveRows();\n }\n else\n {\n return false;\n }\n }\n else if ( destinationParent.isValid() )\n {\n \/\/ Moving from the scene to a node\n Tree::Node* destination = reinterpret_cast<Tree::Node*> ( destinationParent.internalPointer() );\n if ( beginMoveRows ( sourceParent, sourceRow, ( sourceRow + count ) - 1, destinationParent, destinationRow ) )\n {\n for ( int i = 0; i < count; ++i )\n {\n Tree::Node* node = &mScene.GetChild ( sourceRow );\n destination->Move ( destinationRow, std::move ( *node ) );\n }\n endMoveRows();\n }\n else\n {\n return false;\n }\n }\n else\n {\n \/* This is the case when a row is moved up or down directly at the scene*\/\n if ( beginMoveRows ( sourceParent, sourceRow, ( sourceRow + count ) - 1, destinationParent, destinationRow ) )\n {\n for ( int i = 0; i < count; ++i )\n {\n Tree::Node* node = &mScene.GetChild ( sourceRow );\n mScene.Move ( destinationRow, std::move ( *node ) );\n }\n endMoveRows();\n }\n else\n {\n return false;\n }\n }\n return true;\n }\n\n Qt::DropActions SceneModel::supportedDropActions() const\n {\n return Qt::MoveAction;\n }\n\n bool SceneModel::dropMimeData ( const QMimeData * data, Qt::DropAction action, int row, int column, const QModelIndex & parent )\n {\n QString format ( \"application\/x-aeon-editor-node\" );\n \/\/ check if the action is supported\n if ( !data || ( action != Qt::MoveAction ) )\n {\n return false;\n }\n \/\/ check if the format is supported\n if ( !data->hasFormat ( format ) )\n {\n return false;\n }\n if ( ( row > rowCount ( parent ) ) || ( row < 0 ) )\n {\n row = rowCount ( parent );\n }\n QByteArray byteArray = data->data ( format );\n QDataStream dataStream ( &byteArray, QIODevice::ReadOnly );\n int count;\n dataStream >> count;\n for ( int i = 0; i < count; ++i )\n {\n Tree::Node* pointer;\n dataStream.readRawData ( reinterpret_cast<char*> ( &pointer ), sizeof ( void* ) );\n QModelIndex model_index = createIndex ( static_cast<int> ( pointer->GetIndex() ), 0, pointer );\n moveRow ( this->parent ( model_index ), static_cast<int> ( pointer->GetIndex() ), parent, row );\n }\n return true;\n }\n\n QMimeData * SceneModel::mimeData ( const QModelIndexList & indexes ) const\n {\n QMimeData* data = nullptr;\n if ( !indexes.isEmpty() )\n {\n QByteArray byteArray;\n byteArray.reserve ( ( indexes.count() + 1 ) *sizeof ( void* ) );\n QDataStream dataStream ( &byteArray, QIODevice::WriteOnly );\n dataStream << indexes.count();\n for ( auto i = indexes.cbegin(); i != indexes.cend(); ++i )\n {\n void* pointer = ( *i ).internalPointer();\n dataStream.writeRawData ( reinterpret_cast<char*> ( &pointer ), sizeof ( void* ) );\n }\n QStringList types = mimeTypes();\n data = new QMimeData();\n data->setData ( types[0], byteArray );\n }\n return data;\n }\n\n QStringList SceneModel::mimeTypes() const\n {\n QStringList types;\n types << \"application\/x-aeon-editor-node\";\n return types;\n }\n\n void SceneModel::InsertNode ( int row, const QModelIndex & parent )\n {\n beginResetModel();\n if ( parent.isValid() )\n {\n reinterpret_cast<Tree::Node*> ( parent.internalPointer() )->Insert ( row, {} );\n }\n else\n {\n mScene.Insert ( row, {} );\n }\n endResetModel();\n }\n\n void SceneModel::RemoveNode ( const QModelIndex & index )\n {\n beginResetModel();\n if ( index.isValid() )\n {\n Tree::Node* node = reinterpret_cast<Tree::Node*> ( index.internalPointer() );\n Tree::Node* parent = node->GetParent();\n if ( parent )\n {\n parent->Erase ( *node );\n }\n else\n {\n mScene.Erase ( *node );\n }\n }\n endResetModel();\n }\n\n const Tree& SceneModel::GetScene() const\n {\n return mScene;\n }\n}\n<commit_msg>Fix Linux build.<commit_after>\/*\nCopyright (C) 2015,2018 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 <QIcon>\n#include <QFile>\n#include <QMimeData>\n#include <QDataStream>\n#include <QByteArray>\n#include <QXmlStreamWriter>\n#include <QTextStream>\n#include \"SceneModel.h\"\n#include \"aeongames\/Tree.h\"\n\nnamespace AeonGames\n{\n SceneModel::SceneModel ( QObject *parent ) :\n QAbstractItemModel ( parent )\n {\n }\n\n SceneModel::~SceneModel() = default;\n\n QVariant SceneModel::headerData ( int section, Qt::Orientation orientation, int role ) const\n {\n if ( ( orientation == Qt::Horizontal ) && ( role == Qt::DisplayRole ) )\n {\n switch ( section )\n {\n case 0:\n return QString ( \"Node\" );\n default:\n return QVariant();\n }\n }\n return QVariant();\n }\n\n QModelIndex SceneModel::index ( int row, int column, const QModelIndex & parent ) const\n {\n if ( !parent.isValid() )\n {\n if ( row < static_cast<int> ( mScene.GetChildrenCount() ) )\n {\n return createIndex ( row, column, &const_cast<SceneModel*> ( this )->mScene[row] );\n }\n }\n else\n {\n Tree::Node* node = reinterpret_cast<Tree::Node*> ( parent.internalPointer() );\n if ( row < static_cast<int> ( node->GetChildrenCount() ) )\n {\n return createIndex ( row, column, & ( node->GetChild ( row ) ) );\n }\n }\n return QModelIndex();\n }\n\n QModelIndex SceneModel::parent ( const QModelIndex & index ) const\n {\n if ( index.isValid() )\n {\n Tree::Node* node = reinterpret_cast<Tree::Node*> ( index.internalPointer() );\n Tree::Node* node_parent = node->GetParent();\n if ( node_parent != nullptr )\n {\n return createIndex ( static_cast<int> ( node->GetIndex() ), 0, node_parent );\n }\n }\n return QModelIndex();\n }\n\n int SceneModel::rowCount ( const QModelIndex & index ) const\n {\n if ( index.isValid() )\n {\n return static_cast<int> ( reinterpret_cast<Tree::Node*> ( index.internalPointer() )->GetChildrenCount() );\n }\n return static_cast<int> ( mScene.GetChildrenCount() );\n }\n\n int SceneModel::columnCount ( const QModelIndex & index ) const\n {\n return 1;\n }\n\n bool SceneModel::hasChildren ( const QModelIndex & index ) const\n {\n if ( index.isValid() )\n {\n return ( reinterpret_cast<Tree::Node*> ( index.internalPointer() )->GetChildrenCount() > 0 );\n }\n return ( mScene.GetChildrenCount() > 0 );\n }\n\n QVariant SceneModel::data ( const QModelIndex & index, int role ) const\n {\n if ( ( role == Qt::DisplayRole ) || ( role == Qt::EditRole ) )\n {\n if ( index.isValid() )\n {\n switch ( index.column() )\n {\n case 0:\n return QString ( reinterpret_cast<Tree::Node*> ( index.internalPointer() )->GetName().c_str() );\n break;\n }\n }\n }\n else if ( role == Qt::DecorationRole )\n {\n return QIcon ( \":\/icons\/icon_node\" );\n }\n else if ( role == Qt::UserRole )\n {\n return qVariantFromValue ( index.internalPointer() );\n }\n return QVariant();\n }\n\n Qt::ItemFlags SceneModel::flags ( const QModelIndex & index ) const\n {\n if ( index.isValid() )\n {\n return QAbstractItemModel::flags ( index ) | Qt::ItemIsEditable | Qt::ItemIsDragEnabled | Qt::ItemIsDropEnabled;\n }\n return QAbstractItemModel::flags ( index ) | Qt::ItemIsDropEnabled;\n }\n\n bool SceneModel::setData ( const QModelIndex & index, const QVariant & value, int role )\n {\n Tree::Node* node = reinterpret_cast<Tree::Node*> ( index.internalPointer() );\n if ( role == Qt::EditRole )\n {\n node->SetName ( value.toString().toUtf8().constData() );\n emit dataChanged ( index, index );\n return true;\n }\n return false;\n }\n\n bool SceneModel::moveRows ( const QModelIndex & sourceParent, int sourceRow, int count, const QModelIndex & destinationParent, int destinationRow )\n {\n if ( sourceParent.isValid() && destinationParent.isValid() )\n {\n \/\/ Moving between nodes\n Tree::Node* source = reinterpret_cast<Tree::Node*> ( sourceParent.internalPointer() );\n Tree::Node* destination = reinterpret_cast<Tree::Node*> ( destinationParent.internalPointer() );\n if ( beginMoveRows ( sourceParent, sourceRow, ( sourceRow + count ) - 1, destinationParent, destinationRow ) )\n {\n for ( int i = 0; i < count; ++i )\n {\n auto node = source->GetChild ( sourceRow );\n destination->Move ( destinationRow + i, std::move ( *source ) );\n }\n endMoveRows();\n }\n else\n {\n return false;\n }\n }\n else if ( sourceParent.isValid() )\n {\n \/\/ Moving from a node to the scene\n Tree::Node* source = reinterpret_cast<Tree::Node*> ( sourceParent.internalPointer() );\n if ( beginMoveRows ( sourceParent, sourceRow, ( sourceRow + count ) - 1, destinationParent, destinationRow ) )\n {\n for ( int i = 0; i < count; ++i )\n {\n auto node = source->GetChild ( sourceRow );\n mScene.Move ( destinationRow, std::move ( *source ) );\n }\n endMoveRows();\n }\n else\n {\n return false;\n }\n }\n else if ( destinationParent.isValid() )\n {\n \/\/ Moving from the scene to a node\n Tree::Node* destination = reinterpret_cast<Tree::Node*> ( destinationParent.internalPointer() );\n if ( beginMoveRows ( sourceParent, sourceRow, ( sourceRow + count ) - 1, destinationParent, destinationRow ) )\n {\n for ( int i = 0; i < count; ++i )\n {\n Tree::Node* node = &mScene.GetChild ( sourceRow );\n destination->Move ( destinationRow, std::move ( *node ) );\n }\n endMoveRows();\n }\n else\n {\n return false;\n }\n }\n else\n {\n \/* This is the case when a row is moved up or down directly at the scene*\/\n if ( beginMoveRows ( sourceParent, sourceRow, ( sourceRow + count ) - 1, destinationParent, destinationRow ) )\n {\n for ( int i = 0; i < count; ++i )\n {\n Tree::Node* node = &mScene.GetChild ( sourceRow );\n mScene.Move ( destinationRow, std::move ( *node ) );\n }\n endMoveRows();\n }\n else\n {\n return false;\n }\n }\n return true;\n }\n\n Qt::DropActions SceneModel::supportedDropActions() const\n {\n return Qt::MoveAction;\n }\n\n bool SceneModel::dropMimeData ( const QMimeData * data, Qt::DropAction action, int row, int column, const QModelIndex & parent )\n {\n QString format ( \"application\/x-aeon-editor-node\" );\n \/\/ check if the action is supported\n if ( !data || ( action != Qt::MoveAction ) )\n {\n return false;\n }\n \/\/ check if the format is supported\n if ( !data->hasFormat ( format ) )\n {\n return false;\n }\n if ( ( row > rowCount ( parent ) ) || ( row < 0 ) )\n {\n row = rowCount ( parent );\n }\n QByteArray byteArray = data->data ( format );\n QDataStream dataStream ( &byteArray, QIODevice::ReadOnly );\n int count;\n dataStream >> count;\n for ( int i = 0; i < count; ++i )\n {\n Tree::Node* pointer;\n dataStream.readRawData ( reinterpret_cast<char*> ( &pointer ), sizeof ( void* ) );\n QModelIndex model_index = createIndex ( static_cast<int> ( pointer->GetIndex() ), 0, pointer );\n moveRow ( this->parent ( model_index ), static_cast<int> ( pointer->GetIndex() ), parent, row );\n }\n return true;\n }\n\n QMimeData * SceneModel::mimeData ( const QModelIndexList & indexes ) const\n {\n QMimeData* data = nullptr;\n if ( !indexes.isEmpty() )\n {\n QByteArray byteArray;\n byteArray.reserve ( ( indexes.count() + 1 ) *sizeof ( void* ) );\n QDataStream dataStream ( &byteArray, QIODevice::WriteOnly );\n dataStream << indexes.count();\n for ( auto i = indexes.cbegin(); i != indexes.cend(); ++i )\n {\n void* pointer = ( *i ).internalPointer();\n dataStream.writeRawData ( reinterpret_cast<char*> ( &pointer ), sizeof ( void* ) );\n }\n QStringList types = mimeTypes();\n data = new QMimeData();\n data->setData ( types[0], byteArray );\n }\n return data;\n }\n\n QStringList SceneModel::mimeTypes() const\n {\n QStringList types;\n types << \"application\/x-aeon-editor-node\";\n return types;\n }\n\n void SceneModel::InsertNode ( int row, const QModelIndex & parent )\n {\n beginResetModel();\n if ( parent.isValid() )\n {\n reinterpret_cast<Tree::Node*> ( parent.internalPointer() )->Insert ( row, {} );\n }\n else\n {\n mScene.Insert ( row, {} );\n }\n endResetModel();\n }\n\n void SceneModel::RemoveNode ( const QModelIndex & index )\n {\n beginResetModel();\n if ( index.isValid() )\n {\n Tree::Node* node = reinterpret_cast<Tree::Node*> ( index.internalPointer() );\n Tree::Node* parent = node->GetParent();\n if ( parent )\n {\n parent->Erase ( *node );\n }\n else\n {\n mScene.Erase ( *node );\n }\n }\n endResetModel();\n }\n\n const Tree& SceneModel::GetScene() const\n {\n return mScene;\n }\n}\n<|endoftext|>"} {"text":"<commit_before><commit_msg>found typo, gave false positive results - triangles no longer work<commit_after><|endoftext|>"} {"text":"<commit_before>\/*************************************************************************\n *\n * OpenOffice.org - a multi-platform office productivity suite\n *\n * $RCSfile: cppdep.cxx,v $\n *\n * $Revision: 1.11 $\n *\n * last change: $Author: rt $ $Date: 2005-09-09 13:28: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#include <stdio.h>\n#include <string.h>\n\n#include <unistd.h>\n\n#include <sys\/stat.h>\n#include <stream.hxx>\n#include \"cppdep.hxx\"\n\n\/\/#define TEST\n\nCppDep::CppDep( ByteString aFileName )\n{\n aSourceFile = aFileName;\n\n pSearchPath = new ByteStringList;\n pFileList = new ByteStringList;\n}\n\nCppDep::CppDep()\n{\n pSources = new ByteStringList;\n pSearchPath = new ByteStringList;\n pFileList = new ByteStringList;\n}\n\nCppDep::~CppDep()\n{\n delete pSearchPath;\n delete pFileList;\n}\n\nvoid CppDep::Execute()\n{\n ULONG nCount = pSources->Count();\n for ( ULONG n=0; n<nCount;n++)\n {\n ByteString *pStr = pSources->GetObject(n);\n Search( *pStr );\n }\n}\n\nBOOL CppDep::AddSearchPath( const char* aPath )\n{\n ByteString *pStr = new ByteString( aPath );\n pSearchPath->Insert( pStr, LIST_APPEND );\n return FALSE;\n}\n\nBOOL CppDep::AddSource( const char* aSource )\n{\n ByteString *pStr = new ByteString( aSource );\n pSources->Insert( pStr, LIST_APPEND );\n return FALSE;\n}\n\nBOOL CppDep::Search( ByteString aFileName )\n{\n#ifdef DEBUG_VERBOSE\n fprintf( stderr, \"SEARCH : %s\\n\", aFileName.GetBuffer());\n#endif\n BOOL bRet = FALSE;\n\n SvFileStream aFile;\n ByteString aReadLine;\n\n UniString suFileName( aFileName, gsl_getSystemTextEncoding());\n\n aFile.Open( suFileName, STREAM_READ );\n while ( aFile.ReadLine( aReadLine ))\n {\n USHORT nPos;\n if ( nPos = aReadLine.Search( \"include\" ) != STRING_NOTFOUND )\n {\n#ifdef DEBUG_VERBOSE\n fprintf( stderr, \"found : %d %s\\n\", nPos, aReadLine.GetBuffer() );\n#endif\n ByteString aResult = IsIncludeStatement( aReadLine );\n#ifdef DEBUG_VERBOSE\n fprintf( stderr, \"Result : %s\\n\", aResult.GetBuffer() );\n#endif\n\n ByteString aNewFile;\n if ( aResult !=\"\")\n if ( (aNewFile = Exists( aResult )) != \"\" )\n {\n BOOL bFound = FALSE;\n ULONG nCount = pFileList->Count();\n for ( ULONG i=0; i<nCount; i++ )\n {\n ByteString *pStr = pFileList->GetObject(i);\n if ( *pStr == aNewFile )\n bFound = TRUE;\n }\n#ifdef DEBUG_VERBOSE\n fprintf( stderr, \"not in list : %d %s\\n\", nPos, aReadLine.GetBuffer() );\n#endif\n if ( !bFound )\n {\n pFileList->Insert( new ByteString( aNewFile ), LIST_APPEND );\n#ifdef DEBUG_VERBOSE\n fprintf( stderr, \" CppDep %s\\\\\\n\", aNewFile.GetBuffer() );\n#endif\n Search(aNewFile);\n }\n }\n }\n }\n aFile.Close();\n\n return bRet;\n}\n\nByteString CppDep::Exists( ByteString aFileName )\n{\n char pFullName[1023];\n ByteString aString;\n\n#ifdef DEBUG_VERBOSE\n fprintf( stderr, \"Searching %s \\n\", aFileName.GetBuffer() );\n#endif\n\n ULONG nCount = pSearchPath->Count();\n for ( ULONG n=0; n<nCount; n++)\n {\n struct stat aBuf;\n ByteString *pPathName = pSearchPath->GetObject(n);\n\n strcpy( pFullName, pPathName->GetBuffer());\n strcat( pFullName, DIR_SEP );\n strcat( pFullName, aFileName.GetBuffer());\n\n#ifdef DEBUG_VERBOSE\n fprintf( stderr, \"looking for %s\\t \", pFullName );\n#endif\n if ( stat( pFullName, &aBuf ) == 0 )\n {\n#ifdef DEBUG_VERBOSE\n fprintf( stderr, \"Got Dependency \", pFullName );\n#endif\n#ifdef DEBUG_VERBOSE\n fprintf( stderr, \"%s \\\\\\n\", pFullName );\n#endif\n\n return ByteString(pFullName);\n }\n }\n return aString;\n}\n\nByteString CppDep::IsIncludeStatement( ByteString aLine )\n{\n ByteString aRetStr;\n \/\/ WhiteSpacesfressen\n aLine.EraseAllChars(' ');\n aLine.EraseAllChars('\\t');\n#ifdef DEBUG_VERBOSE\n fprintf( stderr, \"now : %s\\n\", aLine.GetBuffer() );\n#endif\n \/\/ ist der erste Teil ein #include ?\n ByteString aTmpStr;\n aTmpStr = aLine.Copy( 0, 8 );\n#ifdef DEBUG_VERBOSE\n fprintf( stderr, \"is include : %s\\n\", aTmpStr.GetBuffer() );\n#endif\n if ( aTmpStr.Equals(\"#include\") )\n {\n aTmpStr = aLine.Erase( 0, 8 );\n USHORT nLen = aLine.Len();\n aLine.Erase( nLen-1, 1 );\n aLine.Erase( 0, 1 );\n#ifdef DEBUG_VERBOSE\n fprintf( stderr, \"Gotcha : %s\\n\", aLine.GetBuffer() );\n#endif\n aRetStr = aLine;\n }\n return aRetStr;\n}\n\n#ifdef TEST\n\nint main( int argc, char **argv )\n{\n CppDep *pDep = new CppDep( \"cppdep.cxx\" );\n pDep->AddSearchPath(\".\");\n pDep->AddSearchPath(\"\/usr\/include\");\n pDep->AddSearchPath(\"\/usr\/local\/include\");\n pDep->AddSearchPath(\"\/usr\/include\/sys\");\n pDep->AddSearchPath(\"\/usr\/include\/X11\");\n pDep->Execute();\n delete pDep;\n return 0;\n}\n\n#endif\n<commit_msg>INTEGRATION: CWS warnings01 (1.11.8); FILE MERGED 2006\/02\/24 14:48:16 sb 1.11.8.1: #i53898# Made code warning-free; removed dead code.<commit_after>\/*************************************************************************\n *\n * OpenOffice.org - a multi-platform office productivity suite\n *\n * $RCSfile: cppdep.cxx,v $\n *\n * $Revision: 1.12 $\n *\n * last change: $Author: hr $ $Date: 2006-06-19 13:19: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#include <stdio.h>\n#include <string.h>\n\n#include <unistd.h>\n\n#include <sys\/stat.h>\n#include <stream.hxx>\n#include \"cppdep.hxx\"\n\n\/\/#define TEST\n\nCppDep::CppDep( ByteString aFileName )\n{\n aSourceFile = aFileName;\n\n pSearchPath = new ByteStringList;\n pFileList = new ByteStringList;\n}\n\nCppDep::CppDep()\n{\n pSources = new ByteStringList;\n pSearchPath = new ByteStringList;\n pFileList = new ByteStringList;\n}\n\nCppDep::~CppDep()\n{\n delete pSearchPath;\n delete pFileList;\n}\n\nvoid CppDep::Execute()\n{\n ULONG nCount = pSources->Count();\n for ( ULONG n=0; n<nCount;n++)\n {\n ByteString *pStr = pSources->GetObject(n);\n Search( *pStr );\n }\n}\n\nBOOL CppDep::AddSearchPath( const char* aPath )\n{\n ByteString *pStr = new ByteString( aPath );\n pSearchPath->Insert( pStr, LIST_APPEND );\n return FALSE;\n}\n\nBOOL CppDep::AddSource( const char* aSource )\n{\n ByteString *pStr = new ByteString( aSource );\n pSources->Insert( pStr, LIST_APPEND );\n return FALSE;\n}\n\nBOOL CppDep::Search( ByteString aFileName )\n{\n#ifdef DEBUG_VERBOSE\n fprintf( stderr, \"SEARCH : %s\\n\", aFileName.GetBuffer());\n#endif\n BOOL bRet = FALSE;\n\n SvFileStream aFile;\n ByteString aReadLine;\n\n UniString suFileName( aFileName, gsl_getSystemTextEncoding());\n\n aFile.Open( suFileName, STREAM_READ );\n while ( aFile.ReadLine( aReadLine ))\n {\n USHORT nPos = aReadLine.Search( \"include\" );\n if ( nPos != STRING_NOTFOUND )\n {\n#ifdef DEBUG_VERBOSE\n fprintf( stderr, \"found : %d %s\\n\", nPos, aReadLine.GetBuffer() );\n#endif\n ByteString aResult = IsIncludeStatement( aReadLine );\n#ifdef DEBUG_VERBOSE\n fprintf( stderr, \"Result : %s\\n\", aResult.GetBuffer() );\n#endif\n\n ByteString aNewFile;\n if ( aResult !=\"\")\n if ( (aNewFile = Exists( aResult )) != \"\" )\n {\n BOOL bFound = FALSE;\n ULONG nCount = pFileList->Count();\n for ( ULONG i=0; i<nCount; i++ )\n {\n ByteString *pStr = pFileList->GetObject(i);\n if ( *pStr == aNewFile )\n bFound = TRUE;\n }\n#ifdef DEBUG_VERBOSE\n fprintf( stderr, \"not in list : %d %s\\n\", nPos, aReadLine.GetBuffer() );\n#endif\n if ( !bFound )\n {\n pFileList->Insert( new ByteString( aNewFile ), LIST_APPEND );\n#ifdef DEBUG_VERBOSE\n fprintf( stderr, \" CppDep %s\\\\\\n\", aNewFile.GetBuffer() );\n#endif\n Search(aNewFile);\n }\n }\n }\n }\n aFile.Close();\n\n return bRet;\n}\n\nByteString CppDep::Exists( ByteString aFileName )\n{\n char pFullName[1023];\n ByteString aString;\n\n#ifdef DEBUG_VERBOSE\n fprintf( stderr, \"Searching %s \\n\", aFileName.GetBuffer() );\n#endif\n\n ULONG nCount = pSearchPath->Count();\n for ( ULONG n=0; n<nCount; n++)\n {\n struct stat aBuf;\n ByteString *pPathName = pSearchPath->GetObject(n);\n\n strcpy( pFullName, pPathName->GetBuffer());\n strcat( pFullName, DIR_SEP );\n strcat( pFullName, aFileName.GetBuffer());\n\n#ifdef DEBUG_VERBOSE\n fprintf( stderr, \"looking for %s\\t \", pFullName );\n#endif\n if ( stat( pFullName, &aBuf ) == 0 )\n {\n#ifdef DEBUG_VERBOSE\n fprintf( stderr, \"Got Dependency \", pFullName );\n#endif\n#ifdef DEBUG_VERBOSE\n fprintf( stderr, \"%s \\\\\\n\", pFullName );\n#endif\n\n return ByteString(pFullName);\n }\n }\n return aString;\n}\n\nByteString CppDep::IsIncludeStatement( ByteString aLine )\n{\n ByteString aRetStr;\n \/\/ WhiteSpacesfressen\n aLine.EraseAllChars(' ');\n aLine.EraseAllChars('\\t');\n#ifdef DEBUG_VERBOSE\n fprintf( stderr, \"now : %s\\n\", aLine.GetBuffer() );\n#endif\n \/\/ ist der erste Teil ein #include ?\n ByteString aTmpStr;\n aTmpStr = aLine.Copy( 0, 8 );\n#ifdef DEBUG_VERBOSE\n fprintf( stderr, \"is include : %s\\n\", aTmpStr.GetBuffer() );\n#endif\n if ( aTmpStr.Equals(\"#include\") )\n {\n aTmpStr = aLine.Erase( 0, 8 );\n USHORT nLen = aLine.Len();\n aLine.Erase( nLen-1, 1 );\n aLine.Erase( 0, 1 );\n#ifdef DEBUG_VERBOSE\n fprintf( stderr, \"Gotcha : %s\\n\", aLine.GetBuffer() );\n#endif\n aRetStr = aLine;\n }\n return aRetStr;\n}\n\n#ifdef TEST\n\nint main( int argc, char **argv )\n{\n CppDep *pDep = new CppDep( \"cppdep.cxx\" );\n pDep->AddSearchPath(\".\");\n pDep->AddSearchPath(\"\/usr\/include\");\n pDep->AddSearchPath(\"\/usr\/local\/include\");\n pDep->AddSearchPath(\"\/usr\/include\/sys\");\n pDep->AddSearchPath(\"\/usr\/include\/X11\");\n pDep->Execute();\n delete pDep;\n return 0;\n}\n\n#endif\n<|endoftext|>"} {"text":"<commit_before>\/*************************************************************************\n *\n * OpenOffice.org - a multi-platform office productivity suite\n *\n * $RCSfile: rscdep.cxx,v $\n *\n * $Revision: 1.20 $\n *\n * last change: $Author: rt $ $Date: 2005-09-09 13:32: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#ifdef UNX\n#include <unistd.h>\n#endif\n\n#include <sys\/stat.h>\n#include <stdio.h>\n#include <string.h>\n\n#include \"prj.hxx\"\n\n#include <string.hxx>\n#include <list.hxx>\n#include <fsys.hxx>\n#include <stream.hxx>\n\n#include \"cppdep.hxx\"\n\nclass RscHrcDep : public CppDep\n{\npublic:\n RscHrcDep();\n virtual ~RscHrcDep();\n\n virtual void Execute();\n};\n\nRscHrcDep::RscHrcDep() :\n CppDep()\n{\n}\n\nRscHrcDep::~RscHrcDep()\n{\n}\n\nvoid RscHrcDep::Execute()\n{\n CppDep::Execute();\n}\n\n\/\/static String aDelim;\n\n\/* poor man's getopt() *\/\nint simple_getopt(int argc, char *argv[], const char *optstring);\n#ifdef WNT\nstatic char *optarg = NULL;\nstatic int optind = 1;\nstatic int optopt = 0;\nstatic int opterr = 0;\n#endif\n\n\nint\n#ifdef WNT\n_cdecl\n#endif\nmain( int argc, char **argv )\n{\n int c;\n int digit_optind = 0;\n char aBuf[255];\n char pOutputFileName[255];\n char pSrsFileName[255];\n String aSrsBaseName;\n BOOL bSource = FALSE;\n ByteString aRespArg;\n String aDelim = String(DirEntry::GetAccessDelimiter());\n\n RscHrcDep *pDep = new RscHrcDep;\n\n pOutputFileName[0] = 0;\n pSrsFileName[0] = 0;\n\n for ( int i=1; i<argc; i++)\n {\n strcpy( aBuf, (const char *)argv[i] );\n if ( aBuf[0] == '-' && aBuf[1] == 'f' && aBuf[2] == 'o' && aBuf[3] == '=' )\n {\n strcpy(pOutputFileName, &aBuf[4]);\n \/\/break;\n }\n if ( aBuf[0] == '-' && aBuf[1] == 'f' && aBuf[2] == 'p' && aBuf[3] == '=' )\n {\n strcpy(pSrsFileName, &aBuf[4]);\n String aName( pSrsFileName, gsl_getSystemTextEncoding());\n USHORT nPos = 0;\n DirEntry aDest( aName );\n aSrsBaseName = aDest.GetBase();\n \/\/break;\n }\n if (aBuf[0] == '-' && aBuf[1] == 'i' )\n {\n \/\/printf(\"Include : %s\\n\", &aBuf[2] );\n pDep->AddSearchPath( &aBuf[2] );\n }\n if (aBuf[0] == '-' && aBuf[1] == 'I' )\n {\n \/\/printf(\"Include : %s\\n\", &aBuf[2] );\n pDep->AddSearchPath( &aBuf[2] );\n }\n if (aBuf[0] == '@' )\n {\n ByteString aToken;\n String aRespName( &aBuf[1], gsl_getSystemTextEncoding());\n SimpleConfig aConfig( aRespName );\n while ( (aToken = aConfig.GetNext()) != \"\")\n {\n char aBuf2[255];\n (void) strcpy( aBuf2, aToken.GetBuffer());\n if ( aBuf2[0] == '-' && aBuf2[1] == 'f' && aBuf2[2] == 'o' )\n {\n strcpy(pOutputFileName, &aBuf2[3]);\n \/\/break;\n }\n if ( aBuf2[0] == '-' && aBuf2[1] == 'f' && aBuf2[2] == 'p' )\n {\n strcpy(pSrsFileName, &aBuf2[3]);\n String aName( pSrsFileName, gsl_getSystemTextEncoding());\n USHORT nPos = 0;\n DirEntry aDest( aName );\n aSrsBaseName = aDest.GetBase();\n \/\/break;\n }\n if (aBuf2[0] == '-' && aBuf2[1] == 'i' )\n {\n \/\/printf(\"Include : %s\\n\", &aBuf[2] );\n pDep->AddSearchPath( &aBuf2[2] );\n }\n if (aBuf2[0] == '-' && aBuf2[1] == 'I' )\n {\n \/\/printf(\"Include : %s\\n\", &aBuf[2] );\n pDep->AddSearchPath( &aBuf2[2] );\n }\n if (( aBuf2[0] != '-' ) && ( aBuf2[0] != '@' ))\n {\n pDep->AddSource( &aBuf2[0] );\n aRespArg += \" \";\n aRespArg += &aBuf2[0];\n bSource = TRUE;\n }\n }\n }\n }\n\n while( 1 )\n {\n int this_option_optind = optind ? optind : 1;\n c = simple_getopt( argc, argv,\n \"_abcdefghi:jklmnopqrstuvwxyzABCDEFGHI:JKLMNOPQRSTUVWXYZ1234567890\/-+=.\\\\()\\\"\");\n if ( c == -1 )\n break;\n\n switch( c )\n {\n case 0:\n break;\n case 'a' :\n#ifdef DEBUG_VERBOSE\n printf(\"option a\\n\");\n#endif\n break;\n\n case 'l' :\n#ifdef DEBUG_VERBOSE\n printf(\"option l with Value %s\\n\", optarg );\n#endif\n pDep->AddSource( optarg );\n break;\n\n case 'h' :\n case 'H' :\n case '?' :\n printf(\"RscDep 1.0 (c)2000 StarOffice\\n\");\n break;\n\n default:\n#ifdef DEBUG_VERBOSE\n printf(\"Unknown getopt error\\n\");\n#endif\n ;\n }\n }\n\n\n DirEntry aEntry(\".\");\n aEntry.ToAbs();\n String aCwd = aEntry.GetName();\n\/* USHORT nPos;\n#ifndef UNX\n while ( (nPos = aCwd.Search('\\\\') != STRING_NOTFOUND ))\n#else\n while ( (nPos = aCwd.Search('\/') != STRING_NOTFOUND ))\n#endif\n {\n String attt = aCwd.Copy( 0, nPos );\n aCwd.Erase( 0, nPos );\n } *\/\n SvFileStream aOutStream;\n String aOutputFileName( pOutputFileName, gsl_getSystemTextEncoding());\n DirEntry aOutEntry( aOutputFileName );\n String aOutPath = aOutEntry.GetPath().GetFull();\n\n String aFileName( aOutPath );\n aFileName += aDelim;\n aFileName += aCwd;\n aFileName += String(\".\", gsl_getSystemTextEncoding());\n aFileName += aSrsBaseName;\n aFileName += String(\".dprr\", gsl_getSystemTextEncoding());\n \/\/fprintf( stderr, \"OutFileName : %s \\n\",aFileName.GetStr());\n aOutStream.Open( aFileName, STREAM_WRITE );\n\n ByteString aString;\n if ( optind < argc )\n {\n#ifdef DEBUG_VERBOSE\n printf(\"further arguments : \");\n#endif\n aString = ByteString( pSrsFileName );\n aString += ByteString(\" : \" );\n\n while ( optind < argc )\n {\n if (!bSource )\n {\n aString += ByteString(\" \" );\n aString += ByteString( argv[optind]);\n pDep->AddSource( argv[optind++]);\n }\n else\n {\n optind++;\n }\n }\n }\n aString += aRespArg;\n pDep->Execute();\n ByteStringList *pLst = pDep->GetDepList();\n ULONG nCount = pLst->Count();\n if ( nCount == 0 )\n {\n aOutStream.WriteLine( aString );\n }\n else\n {\n aString += ByteString( \"\\\\\" );\n aOutStream.WriteLine( aString );\n }\n\n for ( ULONG j=0; j<nCount; j++ )\n {\n ByteString *pStr = pLst->GetObject(j);\n#ifdef UNX\n pStr->SearchAndReplaceAll('\\\\', ByteString( aDelim, RTL_TEXTENCODING_ASCII_US ));\n#endif\n#ifdef WNT\n pStr->SearchAndReplaceAll('\/', ByteString( aDelim, RTL_TEXTENCODING_ASCII_US ));\n#endif\n if ( j != (nCount-1) )\n *pStr += ByteString( \"\\\\\" );\n aOutStream.WriteLine( *pStr );\n }\n delete pDep;\n aOutStream.Close();\n\n return 0;\n}\n\n\/* my very simple minded implementation of getopt()\n * it's too sad that getopt() is not available everywhere\n * note: this is not a full POSIX conforming getopt()\n *\/\nint simple_getopt(int argc, char *argv[], const char *optstring)\n{\n char *arg = argv[optind];\n\n \/* skip all response file arguments *\/\n if ( arg ) {\n while ( *arg == '@' )\n arg = argv[++optind];\n\n if ( arg[0] == '-' && arg[1] != '\\0' ) {\n const char *popt;\n int c = arg[1];\n if ( (popt = strchr(optstring, c)) == NULL ) {\n optopt = c;\n if ( opterr )\n fprintf(stderr, \"Unknown option character `\\\\x%x'.\\n\", optopt);\n return '?';\n }\n if ( *(++popt) == ':') {\n if ( arg[2] != '\\0' ) {\n optarg = ++arg;\n } else {\n optarg = argv[++optind];\n }\n } else {\n optarg = NULL;\n }\n ++optind;\n return c;\n }\n }\n return -1;\n}\n\n<commit_msg>INTEGRATION: CWS warnings01 (1.20.8); FILE MERGED 2005\/10\/27 12:28:49 sb 1.20.8.2: #i53898# Made code warning-free. 2005\/10\/14 11:19:24 sb 1.20.8.1: #i53898# Made code warning-free; cleanup.<commit_after>\/*************************************************************************\n *\n * OpenOffice.org - a multi-platform office productivity suite\n *\n * $RCSfile: rscdep.cxx,v $\n *\n * $Revision: 1.21 $\n *\n * last change: $Author: hr $ $Date: 2006-06-19 13:21: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#ifdef UNX\n#include <unistd.h>\n#endif\n\n#include <sys\/stat.h>\n#include <stdio.h>\n#include <string.h>\n\n#include \"bootstrp\/prj.hxx\"\n\n#include <string.hxx>\n#include <list.hxx>\n#include <fsys.hxx>\n#include <stream.hxx>\n\n#include \"cppdep.hxx\"\n\nclass RscHrcDep : public CppDep\n{\npublic:\n RscHrcDep();\n virtual ~RscHrcDep();\n\n virtual void Execute();\n};\n\nRscHrcDep::RscHrcDep() :\n CppDep()\n{\n}\n\nRscHrcDep::~RscHrcDep()\n{\n}\n\nvoid RscHrcDep::Execute()\n{\n CppDep::Execute();\n}\n\n\/\/static String aDelim;\n\n\/* poor man's getopt() *\/\nint simple_getopt(char *argv[], const char *optstring);\n#ifdef WNT\nstatic char *optarg = NULL;\nstatic int optind = 1;\nstatic int optopt = 0;\nstatic int opterr = 0;\n#endif\n\n\nint\n#ifdef WNT\n_cdecl\n#endif\nmain( int argc, char **argv )\n{\n int c;\n char aBuf[255];\n char pOutputFileName[255];\n char pSrsFileName[255];\n String aSrsBaseName;\n BOOL bSource = FALSE;\n ByteString aRespArg;\n String aDelim = String(DirEntry::GetAccessDelimiter());\n\n RscHrcDep *pDep = new RscHrcDep;\n\n pOutputFileName[0] = 0;\n pSrsFileName[0] = 0;\n\n for ( int i=1; i<argc; i++)\n {\n strcpy( aBuf, (const char *)argv[i] );\n if ( aBuf[0] == '-' && aBuf[1] == 'f' && aBuf[2] == 'o' && aBuf[3] == '=' )\n {\n strcpy(pOutputFileName, &aBuf[4]);\n \/\/break;\n }\n if ( aBuf[0] == '-' && aBuf[1] == 'f' && aBuf[2] == 'p' && aBuf[3] == '=' )\n {\n strcpy(pSrsFileName, &aBuf[4]);\n String aName( pSrsFileName, gsl_getSystemTextEncoding());\n DirEntry aDest( aName );\n aSrsBaseName = aDest.GetBase();\n \/\/break;\n }\n if (aBuf[0] == '-' && aBuf[1] == 'i' )\n {\n \/\/printf(\"Include : %s\\n\", &aBuf[2] );\n pDep->AddSearchPath( &aBuf[2] );\n }\n if (aBuf[0] == '-' && aBuf[1] == 'I' )\n {\n \/\/printf(\"Include : %s\\n\", &aBuf[2] );\n pDep->AddSearchPath( &aBuf[2] );\n }\n if (aBuf[0] == '@' )\n {\n ByteString aToken;\n String aRespName( &aBuf[1], gsl_getSystemTextEncoding());\n SimpleConfig aConfig( aRespName );\n while ( (aToken = aConfig.GetNext()) != \"\")\n {\n char aBuf2[255];\n (void) strcpy( aBuf2, aToken.GetBuffer());\n if ( aBuf2[0] == '-' && aBuf2[1] == 'f' && aBuf2[2] == 'o' )\n {\n strcpy(pOutputFileName, &aBuf2[3]);\n \/\/break;\n }\n if ( aBuf2[0] == '-' && aBuf2[1] == 'f' && aBuf2[2] == 'p' )\n {\n strcpy(pSrsFileName, &aBuf2[3]);\n String aName( pSrsFileName, gsl_getSystemTextEncoding());\n DirEntry aDest( aName );\n aSrsBaseName = aDest.GetBase();\n \/\/break;\n }\n if (aBuf2[0] == '-' && aBuf2[1] == 'i' )\n {\n \/\/printf(\"Include : %s\\n\", &aBuf[2] );\n pDep->AddSearchPath( &aBuf2[2] );\n }\n if (aBuf2[0] == '-' && aBuf2[1] == 'I' )\n {\n \/\/printf(\"Include : %s\\n\", &aBuf[2] );\n pDep->AddSearchPath( &aBuf2[2] );\n }\n if (( aBuf2[0] != '-' ) && ( aBuf2[0] != '@' ))\n {\n pDep->AddSource( &aBuf2[0] );\n aRespArg += \" \";\n aRespArg += &aBuf2[0];\n bSource = TRUE;\n }\n }\n }\n }\n\n while( 1 )\n {\n c = simple_getopt( argv,\n \"_abcdefghi:jklmnopqrstuvwxyzABCDEFGHI:JKLMNOPQRSTUVWXYZ1234567890\/-+=.\\\\()\\\"\");\n if ( c == -1 )\n break;\n\n switch( c )\n {\n case 0:\n break;\n case 'a' :\n#ifdef DEBUG_VERBOSE\n printf(\"option a\\n\");\n#endif\n break;\n\n case 'l' :\n#ifdef DEBUG_VERBOSE\n printf(\"option l with Value %s\\n\", optarg );\n#endif\n pDep->AddSource( optarg );\n break;\n\n case 'h' :\n case 'H' :\n case '?' :\n printf(\"RscDep 1.0 (c)2000 StarOffice\\n\");\n break;\n\n default:\n#ifdef DEBUG_VERBOSE\n printf(\"Unknown getopt error\\n\");\n#endif\n ;\n }\n }\n\n\n DirEntry aEntry(\".\");\n aEntry.ToAbs();\n String aCwd = aEntry.GetName();\n\/* USHORT nPos;\n#ifndef UNX\n while ( (nPos = aCwd.Search('\\\\') != STRING_NOTFOUND ))\n#else\n while ( (nPos = aCwd.Search('\/') != STRING_NOTFOUND ))\n#endif\n {\n String attt = aCwd.Copy( 0, nPos );\n aCwd.Erase( 0, nPos );\n } *\/\n SvFileStream aOutStream;\n String aOutputFileName( pOutputFileName, gsl_getSystemTextEncoding());\n DirEntry aOutEntry( aOutputFileName );\n String aOutPath = aOutEntry.GetPath().GetFull();\n\n String aFileName( aOutPath );\n aFileName += aDelim;\n aFileName += aCwd;\n aFileName += String(\".\", gsl_getSystemTextEncoding());\n aFileName += aSrsBaseName;\n aFileName += String(\".dprr\", gsl_getSystemTextEncoding());\n \/\/fprintf( stderr, \"OutFileName : %s \\n\",aFileName.GetStr());\n aOutStream.Open( aFileName, STREAM_WRITE );\n\n ByteString aString;\n if ( optind < argc )\n {\n#ifdef DEBUG_VERBOSE\n printf(\"further arguments : \");\n#endif\n aString = ByteString( pSrsFileName );\n aString += ByteString(\" : \" );\n\n while ( optind < argc )\n {\n if (!bSource )\n {\n aString += ByteString(\" \" );\n aString += ByteString( argv[optind]);\n pDep->AddSource( argv[optind++]);\n }\n else\n {\n optind++;\n }\n }\n }\n aString += aRespArg;\n pDep->Execute();\n ByteStringList *pLst = pDep->GetDepList();\n ULONG nCount = pLst->Count();\n if ( nCount == 0 )\n {\n aOutStream.WriteLine( aString );\n }\n else\n {\n aString += ByteString( \"\\\\\" );\n aOutStream.WriteLine( aString );\n }\n\n for ( ULONG j=0; j<nCount; j++ )\n {\n ByteString *pStr = pLst->GetObject(j);\n#ifdef UNX\n pStr->SearchAndReplaceAll('\\\\', ByteString( aDelim, RTL_TEXTENCODING_ASCII_US ));\n#endif\n#ifdef WNT\n pStr->SearchAndReplaceAll('\/', ByteString( aDelim, RTL_TEXTENCODING_ASCII_US ));\n#endif\n if ( j != (nCount-1) )\n *pStr += ByteString( \"\\\\\" );\n aOutStream.WriteLine( *pStr );\n }\n delete pDep;\n aOutStream.Close();\n\n return 0;\n}\n\n\/* my very simple minded implementation of getopt()\n * it's too sad that getopt() is not available everywhere\n * note: this is not a full POSIX conforming getopt()\n *\/\nint simple_getopt(char *argv[], const char *optstring)\n{\n char *arg = argv[optind];\n\n \/* skip all response file arguments *\/\n if ( arg ) {\n while ( *arg == '@' )\n arg = argv[++optind];\n\n if ( arg[0] == '-' && arg[1] != '\\0' ) {\n const char *popt;\n int c = arg[1];\n if ( (popt = strchr(optstring, c)) == NULL ) {\n optopt = c;\n if ( opterr )\n fprintf(stderr, \"Unknown option character `\\\\x%x'.\\n\", optopt);\n return '?';\n }\n if ( *(++popt) == ':') {\n if ( arg[2] != '\\0' ) {\n optarg = ++arg;\n } else {\n optarg = argv[++optind];\n }\n } else {\n optarg = NULL;\n }\n ++optind;\n return c;\n }\n }\n return -1;\n}\n\n<|endoftext|>"} {"text":"<commit_before>#ifndef _MSP_PERIPH_HPP\n#define _MSP_PERIPH_HPP\n\n#include <msp430.h>\n#include \"msp430\/msp_sys.hpp\"\n#include \"utilities\/circfifo.hpp\"\n\n#define REG_16(x) *((volatile uint16_t*)x)\n#define REG_8(x) *((volatile uint8_t*)x)\n\nnamespace McuPeripheral {\n\n\nstruct DisableAllInterrupts {\n\tvoid operator () (){\n\t\t__dint();\n\t}\n};\n\nstruct EnableAllInterrupts {\n\tvoid operator () (){\n\t\t__eint();\n\t}\n};\n\ntemplate<uint8_t _ienable, uint8_t _iflag>\nstruct DisableInterrupt {\n\tvoid operator () (){\n\t\tREG_8(_ienable) &= ~_iflag;\n\t}\n};\n\ntemplate<uint8_t _ienable, uint8_t _iflag>\nstruct EnableInterrupt {\n\tvoid operator () (){\n\t\tREG_8(_ienable) |= _iflag;\n\t}\n};\n\n\/\/Should be a base class to inherit from\nstruct FakeDisableInterrupt {\n\tvoid operator () (){\n\t\t\/\/Do nothing\n\t}\n};\n\nstruct FakeEnableInterrupt {\n\tvoid operator () (){\n\t\t\/\/Do nothing\n\t}\n};\n\n\ntemplate<uint8_t _ienable,uint8_t _txen, uint8_t _rxen>\nclass Interrupts {\npublic:\n\tstatic FifoBuffer<uint8_t, 8, McuPeripheral::DisableInterrupt<_ienable,_txen>, EnableInterrupt<_ienable,_txen> > mTxBuffer;\n\tstatic FifoBuffer<uint8_t, 8, McuPeripheral::DisableInterrupt<_ienable,_rxen>, EnableInterrupt<_ienable,_rxen> > mRxBuffer;\n\n\tstatic void init() { REG_8(_ienable) &= ~(_rxen | _txen); }\n\tstatic DisableInterrupt<_ienable,_txen> disableTxInterrupt;\n\tstatic DisableInterrupt<_ienable,_rxen> disableRxInterrupt;\n\tstatic EnableInterrupt<_ienable,_txen> enableTxInterrupt;\n\tstatic EnableInterrupt<_ienable,_rxen> enableRxInterrupt;\n};\n\ntemplate<uint8_t _ienable,uint8_t _txen, uint8_t _rxen>\nFifoBuffer<uint8_t, 8, McuPeripheral::DisableInterrupt<_ienable,_txen>, EnableInterrupt<_ienable,_txen> > Interrupts<_ienable,_txen,_rxen>::mTxBuffer;\n\ntemplate<uint8_t _ienable,uint8_t _txen, uint8_t _rxen>\nFifoBuffer<uint8_t, 8, McuPeripheral::DisableInterrupt<_ienable,_rxen>, EnableInterrupt<_ienable,_rxen> > Interrupts<_ienable,_txen,_rxen>::mRxBuffer;\n\ntemplate<uint8_t _ienable,uint8_t _txen, uint8_t _rxen>\nDisableInterrupt<_ienable,_txen> Interrupts<_ienable,_txen,_rxen>::disableTxInterrupt;\n\ntemplate<uint8_t _ienable,uint8_t _txen, uint8_t _rxen>\nDisableInterrupt<_ienable,_rxen> Interrupts<_ienable,_txen,_rxen>::disableRxInterrupt;\n\ntemplate<uint8_t _ienable,uint8_t _txen, uint8_t _rxen>\nEnableInterrupt<_ienable,_txen> Interrupts<_ienable,_txen,_rxen>::enableTxInterrupt;\n\ntemplate<uint8_t _ienable,uint8_t _txen, uint8_t _rxen>\nEnableInterrupt<_ienable,_rxen> Interrupts<_ienable,_txen,_rxen>::enableRxInterrupt;\n\n\nclass FakeInterupts {\npublic:\n\tstatic FakeFifoBuffer mTxBuffer;\n\tstatic FakeFifoBuffer mRxBuffer;\n\tstatic void init() { return; }\n\n\tstatic FakeDisableInterrupt disableTxInterrupt;\n\tstatic FakeDisableInterrupt disableRxInterrupt;\n\tstatic FakeEnableInterrupt enableTxInterrupt;\n\tstatic FakeEnableInterrupt enableRxInterrupt;\n};\n\n}\n\n#endif \/\/_MSP_PERIPH_HPP\n<commit_msg>Comment updates<commit_after>#ifndef _MSP_PERIPH_HPP\n#define _MSP_PERIPH_HPP\n\n#include <msp430.h>\n#include \"msp430\/msp_sys.hpp\"\n#include \"utilities\/circfifo.hpp\"\n\n#define REG_16(x) *((volatile uint16_t*)x)\n#define REG_8(x) *((volatile uint8_t*)x)\n\nnamespace McuPeripheral {\n\n\/**@brief Wrapper to disable all interrupts\n *\/\nstruct DisableAllInterrupts {\n\tvoid operator () (){\n\t\t__dint();\n\t}\n};\n\n\/**@brief Wrapper to enable all interrupts\n *\/\nstruct EnableAllInterrupts {\n\tvoid operator () (){\n\t\t__eint();\n\t}\n};\n\n\/**@brief Wrapper to disable specifc interrupt or interrupts\n * tparam _ienable the interrupt register that the _iflag is cleared to disable interrupts\n * tparam _iflag the flag in the _ienable register to be cleared for disabling interrupt\n *\/\ntemplate<uint8_t _ienable, uint8_t _iflag>\nstruct DisableInterrupt {\n\tvoid operator () (){\n\t\tREG_8(_ienable) &= ~_iflag;\n\t}\n};\n\n\/**@brief Wrapper to enable specifc interrupt or interrupts\n * tparam _ienable the interrupt register that the _iflag is cleared to enable interrupts\n * tparam _iflag the flag in the _ienable register to be cleared for enabling interrupt\n *\/\ntemplate<uint8_t _ienable, uint8_t _iflag>\nstruct EnableInterrupt {\n\tvoid operator () (){\n\t\tREG_8(_ienable) |= _iflag;\n\t}\n};\n\n\/**@brief Empty class that can be used as a dummy when interrupts are not needed for disabling or enabling\n *\/\nstruct FakeInterrupt {\n\tvoid operator () (){\n\t\t\/\/Do nothing\n\t}\n};\n\n\/**@brief Templated class for specifing interrupts used in communications\n * tparam _ienable the interrupt register that the _iflag is set\/cleared for interrupts\n * tparam _txen tx flag for enabling and disabling interrupts\n * tparam _rxen rx flag for enabling and disabling interrupts\n *\/\ntemplate<uint8_t _ienable,uint8_t _txen, uint8_t _rxen>\nclass Interrupts {\npublic:\n\tstatic FifoBuffer<uint8_t, 8, McuPeripheral::DisableInterrupt<_ienable,_txen>, EnableInterrupt<_ienable,_txen> > mTxBuffer;\n\tstatic FifoBuffer<uint8_t, 8, McuPeripheral::DisableInterrupt<_ienable,_rxen>, EnableInterrupt<_ienable,_rxen> > mRxBuffer;\n\n\tstatic void init() { REG_8(_ienable) &= ~(_rxen | _txen); }\n\tstatic DisableInterrupt<_ienable,_txen> disableTxInterrupt;\n\tstatic DisableInterrupt<_ienable,_rxen> disableRxInterrupt;\n\tstatic EnableInterrupt<_ienable,_txen> enableTxInterrupt;\n\tstatic EnableInterrupt<_ienable,_rxen> enableRxInterrupt;\n};\n\ntemplate<uint8_t _ienable,uint8_t _txen, uint8_t _rxen>\nFifoBuffer<uint8_t, 8, McuPeripheral::DisableInterrupt<_ienable,_txen>, EnableInterrupt<_ienable,_txen> > Interrupts<_ienable,_txen,_rxen>::mTxBuffer;\n\ntemplate<uint8_t _ienable,uint8_t _txen, uint8_t _rxen>\nFifoBuffer<uint8_t, 8, McuPeripheral::DisableInterrupt<_ienable,_rxen>, EnableInterrupt<_ienable,_rxen> > Interrupts<_ienable,_txen,_rxen>::mRxBuffer;\n\ntemplate<uint8_t _ienable,uint8_t _txen, uint8_t _rxen>\nDisableInterrupt<_ienable,_txen> Interrupts<_ienable,_txen,_rxen>::disableTxInterrupt;\n\ntemplate<uint8_t _ienable,uint8_t _txen, uint8_t _rxen>\nDisableInterrupt<_ienable,_rxen> Interrupts<_ienable,_txen,_rxen>::disableRxInterrupt;\n\ntemplate<uint8_t _ienable,uint8_t _txen, uint8_t _rxen>\nEnableInterrupt<_ienable,_txen> Interrupts<_ienable,_txen,_rxen>::enableTxInterrupt;\n\ntemplate<uint8_t _ienable,uint8_t _txen, uint8_t _rxen>\nEnableInterrupt<_ienable,_rxen> Interrupts<_ienable,_txen,_rxen>::enableRxInterrupt;\n\n\/**@brief dummy class for interrupts that are used when interrupts are not to be enabled.\n * this is used for polling functionality of the communication.\n *\/\nclass FakeInterupts {\npublic:\n\tstatic FakeFifoBuffer mTxBuffer;\n\tstatic FakeFifoBuffer mRxBuffer;\n\tstatic void init() { return; }\n\n\tstatic FakeInterrupt disableTxInterrupt;\n\tstatic FakeInterrupt disableRxInterrupt;\n\tstatic FakeInterrupt enableTxInterrupt;\n\tstatic FakeInterrupt enableRxInterrupt;\n};\n\n}\n\n#endif \/\/_MSP_PERIPH_HPP\n<|endoftext|>"} {"text":"<commit_before>\/\/---------------------------------------------------------------------------\/\/\n\/\/!\n\/\/! \\file MonteCarlo_TetMeshTrackLengthFluxEstimator.cpp\n\/\/! \\author Alex Robinson, Eli Moll\n\/\/! \\brief Tet mesh flux estimator class declaration.\n\/\/!\n\/\/---------------------------------------------------------------------------\/\/\n\n\/\/ Moab Includes\n#include <moab\/Core.hpp>\n\n\/\/ FRENSIE Includes\n#include \"MonteCarlo_TetMeshTrackLengthFluxEstimator.hpp\"\n#include \"Utility_TetrahedronHelpers.hpp\"\n#include \"Utility_MOABException.hpp\"\n#include \"Utility_ContractException.hpp\"\n#include \"Utility_ExceptionTestMacros.hpp\"\n\nnamespace MonteCarlo{\n\n\/\/ Constructor\ntemplate<typename ContributionMultiplierPolicy>\nTetMeshTrackLengthFluxEstimator<ContributionMultiplierPolicy>::TetMeshTrackLengthFluxEstimator(\n\t\t const Estimator::idType id,\n\t\t\t\t const double multiplier,\n\t\t\t\t const std::string input_mesh_file_name,\n\t\t const std::string output_mesh_file_name )\n : StandardEntityEstimator<moab::EntityHandle>( id, multiplier ),\n d_moab_interface( new moab::Core ),\n d_tet_meshset,\n d_kd_tree( new moab::AdaptiveKDTree( d_moab_interface.getRawPtr() ) ),\n d_kd_tree_root(),\n d_obb_tree( new moab::OrientedBoxTreeTool( d_moab_interface.getRawPtr() )),\n d_obb_tree_root(),\n d_last_visited_tet(),\n d_last_visited_cell(),\n d_tet_barycentric_transform_matrices()\n{\n \/\/ ------------------------ Load Meshset ------------------------------------\n\n \/\/ Create empty MOAB meshset\n moab::EntityHandle d_tet_meshset;\n moab::ErrorCode return_value = d_moab_interface->create_meshset(\n\t\t\t\t\tmoab::MESHSET_SET, d_tet_meshset);\n \n TEST_FOR_EXCEPTION( return_value != moab::MB_SUCCESS,\n Utility::MOABException,\n moab::ErrorCodeStr[return_value] );\n\n \/\/ Populate MOAB meshset with data from input file \n return_value = d_moab_interface->load_file(\n input_mesh_file_name.c_str(), &d_tet_meshset);\n \n TEST_FOR_EXCEPTION( return_value != moab::MB_SUCCESS,\n Utility::MOABException,\n moab::ErrorCodeStr[return_value] ); \n \n \/\/ Range (domain) of all tetrahedral elements\n moab::Range all_tet_elements;\n\n \/\/ ---------------------- Reduce Meshset to 3D ------------------------------\n \n \/\/ Extract 3D elements from meshset\n return_value = d_moab_interface->get_entities_by_dimension(\n d_tet_meshset, 3, all_tet_elements);\n \n TEST_FOR_EXCEPTION( return_value != moab::MB_SUCCESS,\n Utility::MOABException,\n moab::ErrorCodeStr[return_value] );\n \n \/\/ Clear the meshset \n return_value = d_moab_interface->clear_meshset(&d_tet_meshset, 1);\n \n TEST_FOR_EXCEPTION( return_value != moab::MB_SUCCESS,\n Utility::MOABException,\n moab::ErrorCodeStr[return_value] );\n \n \/\/ Reconstruct the meshset using only 3D entitites \n return_value = d_moab_interface->add_entities(\n d_tet_meshset, all_tet_elements);\n \n TEST_FOR_EXCEPTION( return_value != moab::MB_SUCCESS,\n Utility::MOABException,\n moab::ErrorCodeStr[return_value] );\n \n unsigned int number_of_tets = all_tet_elements.size();\n \n for( moab::Range::const_iterator tet = all_tet_elements.begin(); \n tet != all_tet_elements.end(); \n ++tet )\n {\n \/\/ Extract the vertex data for the given tet\n std::vector<moab::EntityHandle> vertex_handles;\n d_moab_interface->get_connectivity( tet, 1, vertex_handles );\n \n \/\/ Test that the vertex entity contains four points\n TEST_FOR_EXCEPTION( vertex_handles.size() != 4,\n\t\t\t Utility::MOABException,\n\t\t\t \"Error: tet found with incorrect number of vertices \"\n\t\t\t \"(\" << vertex_handles.size() << \" != 4)\" );\n \n moab::CartVect vertices[4];\n \n for( unsigned j = 0; j < vertex_handles.size(); ++j )\n {\n\td_moab_interface->get_coords( &vertex_handles[j], \n\t\t\t\t 1, \n\t\t\t\t vertices[j].array() );\n }\n \n \/\/ Calculate Barycentric Matrix\n moab::Matrix3& barycentric_transform_matrix = \n\t d_tet_barycentric_transform_matrices[tet];\n \n Utility::calculateBarycentricTransformMatrix( \n\t\t\t\t\t\t vertices[0],\n\t\t\t\t\t\t vertices[1],\n\t\t\t\t\t\t vertices[2],\n\t\t\t\t\t\t vertices[3],\n barycentric_transform_matrix );\n\n \/\/ Calculate tet volumes\n boost::unordered_map<moab::EntityHandle,double> entity_volumes;\n \n entity_volumes[*tet] = Utility::calculateTetrahedronVolume( vertices[0],\n\t\t\t\t\t\t\t\t vertices[1],\n\t\t\t\t\t\t\t\t vertices[2],\n\t\t\t\t\t\t\t\t vertices[3]);\n\n \/\/ Assign the entity volumes\n this->assignEntities( entity_volumes );\n }\n \n \/\/ ---------------------------- KD Trees ------------------------------------\n \n int current_dimension;\n \n \/\/ Get dimension of the input set\n current_dimension = \n d_moab_interface->dimension_from_handle(all_tet_elements[0]);\n \n moab::Range surface_triangles;\n \n \/\/ Determine the edges from the input set\n return_value = d_moab_interface->get_adjacencies( all_tet_elements, \n\t\t\t\t\t\t current_dimension - 1, \n\t\t\t\t\t\t true,\n\t\t\t\t\t\t surface_triangles, \n\t\t\t\t\t\t moab::Interface::UNION );\n \n TEST_FOR_EXCEPTION( return_value != moab::MB_SUCCESS,\n Utility::MOABException,\n moab::ErrorCodeStr[return_value] );\n \n all_tet_elements.merge( surface_triangles );\n \n const char settings[]=\"MESHSET_FLAGS=0x1;TAG_NAME=0\";\n moab::FileOptions fileopts(settings);\n \n d_kd_tree->build_tree(all_tet_elements, &d_kd_tree_root, &fileopts);\n\n \/\/ Set up OBB Tree (how is this done?)\n} \n\n\/\/ Set the response functions\ntemplate<typename ContributionMultiplierPolicy>\nvoid TetMeshTrackLengthFluxEstimator<ContributionMultiplierPolicy>::setResponseFunctions(\n const Teuchos::Array<Teuchos::RCP<ResponseFunction> >& response_functions )\n{\n for( unsigned i = 0; i < response_functions.size(); ++i )\n {\n if( !response_functions[i]->isSpatiallyUniform() )\n {\n std::cerr << \"Warning: tetrahedral mesh track length estimators can only \"\n\t\t<< \"be used with spatially uniform response functions. Results from \"\n\t\t<< \"tetrahdedral mesh track length estimator \" << getId()\n\t\t<< \"will not be correct.\" << std::endl;\n }\n }\n StandardEntityEstimator::setResponseFunctions( response_functions );\n}\n\n\/\/ Set the particle types that can contribute to the estimator\ntemplate<typename ContributionMultiplierPolicy>\nvoid TetMeshTrackLengthFluxEstimator<ContributionMultiplierPolicy>::setParticleTypes( const Teuchos::Array<ParticleType>& particle_types )\n{\n Estimator::setParticleTypes( particle_types );\n}\n\n\/\/ Add current history estimator contribution\ntemplate<typename ContributionMultiplierPolicy>\nvoid TetMeshTrackLengthFluxEstimator<ContributionMultiplierPolicy>::updateFromParticleSubtrackEndingEvent(\n\t\t\t const ParticleState& particle,\n\t\t\t const Geometry::ModuleTraits::InternalCellHandle,\n\t\t\t const double track_length )\n{\n\n}\n\n\/\/ Export the estimator data\ntemplate<typename ContributionMultiplierPolicy>\nvoid TetMeshTrackLengthFluxEstimator<ContributionMultiplierPolicy>::exportData(\n EstimatorHDF5FileHandler& hdf5_file,\n\t\t\t\t\t const bool process_data ) const\n{\n \/\/ Export data in FRENSIE formatting for data manipulation\n StandardEntityEstimator::exportData();\n \n \/\/ Export data for visualization\n if( process_data )\n {\n moab::Range all_tet_elements;\n moab::ErrorCode return_value = d_moab_interface->get_entities_by_dimension(\n d_tet_meshset, 3, all_tet_elements);\n \n TEST_FOR_EXCEPTION( return_value != moab::MB_SUCCESS,\n Utility::MOABException,\n moab::ErrorCodeStr[return_value] );\n \n \/\/ Process moments\n for ( moab::Range::const_iterator tet = all_tet_elements.begin(); \n\t tet != all_tet_elements.end(); \n\t ++tet )\n {\n double tet_volume = this->getEntityNormConstant( *tet );\n \n const Estimator::TwoEstimatorMomentsArray& tet_bin_data = \n\tthis->getEntityBinData( *tet );\n \n Teuchos::Array<moab::Tag> mean_tag( tet_bin_data.size() ), \n\trelative_error_tag( tet_bin_data.size() );\n\n std::string mean_tag_prefix = \"mean_\";\n std::string relative_error_tag_prefix = \"relative_error_\";\t\n\n for( unsigned i = 0; i < tet_bin_data.size(); ++i )\n {\n\tdouble mean, relative_error;\n\t\n\tthis->processMoments( tet_bin_data[i],\n\t\t\t tet_volume,\n\t\t\t mean, \n\t\t\t relative_error );\n\n\tstd::string bin_name = this->getBinName( i );\n\tstd::string mean_tag_name = mean_tag_prefix + bin_name;\n\tstd::string relative_error_tag_name = relative_error_tag_prefix +\n\t bin_name;\n\t \n\tmoab::ErrorCode return_value = \n\t d_moab_interface->tag_get_handle( \n\t\t\t\t mean_tag_name.c_str(),\n\t\t\t\t 1,\n\t\t\t\t moab::MB_TYPE_DOUBLE,\n\t\t\t\t mean_tag[i],\n\t\t\t\t moab::MB_TAG_DENSE|moab::MB_TAG_CREAT );\n\n\tTEST_FOR_EXCEPTION( return_value != moab::MB_SUCCESS,\n Utility::MOABException,\n moab::ErrorCodeStr[return_value] );\n\n\treturn_value = d_moab_interface->tag_set_data( mean_tag[i], \n\t\t\t\t\t\t *tet,\n\t\t\t\t\t\t 1,\n\t\t\t\t\t\t mean );\n\n\tTEST_FOR_EXCEPTION( return_value != moab::MB_SUCCESS,\n Utility::MOABException,\n moab::ErrorCodeStr[return_value] );\n }\n }\n } \n}\n\n\/\/ Print the estimator data\ntemplate<typename ContributionMultiplierPolicy>\nvoid TetMeshTrackLengthFluxEstimator<ContributionMultiplierPolicy>::print( \n\t\t\t\t\t\t std::ostream& os ) const\n{\n StandardEntityEstimator::printImplementation( os );\n}\n\n\/\/ Assign bin boundaries to an estimator dimension\ntemplate<typename ContributionMultiplierPolicy>\nvoid TetMeshTrackLengthFluxEstimator<ContributionMultiplierPolicy>::assignBinBoundaries(\n\tconst Teuchos::RCP<EstimatorDimensionDiscretization>& bin_boundaries )\n{\n \/\/ if( bin_boundaries->getDimension() != ENERGY_DIMENSION )\n \/\/ {\n \/\/ std::cerr << \"Warning: \" << bin_boundaries->getDimensionName()\n \/\/ \t << \" bins cannot be set for standard cell estimators. The bins \"\n \/\/ \t << \"requested for tetrahdedral mesh flux estimator \" << this->getId()\n \/\/ \t << \" will be ignored.\"\n \/\/ \t << std::endl;\n \/\/ }\n else\n StandardEntityEstimator<cellIdType>::assignBinBoundaries( bin_boundaries );\n}\n \n} \/\/ end MonteCarlo namespace\n\n\/\/---------------------------------------------------------------------------\/\/\n\/\/ end MonteCarlo_TetMeshTrackLengthFluxEstimator.hpp\n\/\/---------------------------------------------------------------------------\/\/\n<commit_msg>Implemented most of the track length mesh tally contribution work.<commit_after>\/\/---------------------------------------------------------------------------\/\/\n\/\/!\n\/\/! \\file MonteCarlo_TetMeshTrackLengthFluxEstimator.cpp\n\/\/! \\author Alex Robinson, Eli Moll\n\/\/! \\brief Tet mesh flux estimator class declaration.\n\/\/!\n\/\/---------------------------------------------------------------------------\/\/\n\n\/\/ Moab Includes\n#include <moab\/Core.hpp>\n\n\/\/ FRENSIE Includes\n#include \"MonteCarlo_TetMeshTrackLengthFluxEstimator.hpp\"\n#include \"Utility_TetrahedronHelpers.hpp\"\n#include \"Utility_MOABException.hpp\"\n#include \"Utility_ContractException.hpp\"\n#include \"Utility_ExceptionTestMacros.hpp\"\n\n\/\/ Used for intersection data storage and comparison\nstruct ray_data {\n double intersect;\n moab::EntityHandle triangle;\n};\n\n\/\/ Compare and sort intersection data\ninline static bool compare(const ray_data &a, const ray_data &b)\n{\n return a.intersect < b.intersect;\n}\n\nnamespace MonteCarlo{\n\n\/\/ Constructor\ntemplate<typename ContributionMultiplierPolicy>\nTetMeshTrackLengthFluxEstimator<ContributionMultiplierPolicy>::TetMeshTrackLengthFluxEstimator(\n\t\t const Estimator::idType id,\n\t\t\t\t const double multiplier,\n\t\t\t\t const std::string input_mesh_file_name,\n\t\t const std::string output_mesh_file_name )\n : StandardEntityEstimator<moab::EntityHandle>( id, multiplier ),\n d_moab_interface( new moab::Core ),\n d_tet_meshset,\n d_kd_tree( new moab::AdaptiveKDTree( d_moab_interface.getRawPtr() ) ),\n d_kd_tree_root(),\n d_obb_tree( new moab::OrientedBoxTreeTool( d_moab_interface.getRawPtr() )),\n d_obb_tree_root(),\n d_last_visited_tet(),\n d_last_visited_cell(),\n d_tet_barycentric_transform_matrices()\n{\n \/\/ ------------------------ Load Meshset ------------------------------------\n\n \/\/ Create empty MOAB meshset\n moab::EntityHandle d_tet_meshset;\n moab::ErrorCode return_value = d_moab_interface->create_meshset(\n\t\t\t\t\tmoab::MESHSET_SET, d_tet_meshset);\n \n TEST_FOR_EXCEPTION( return_value != moab::MB_SUCCESS,\n Utility::MOABException,\n moab::ErrorCodeStr[return_value] );\n\n \/\/ Populate MOAB meshset with data from input file \n return_value = d_moab_interface->load_file(\n input_mesh_file_name.c_str(), &d_tet_meshset);\n \n TEST_FOR_EXCEPTION( return_value != moab::MB_SUCCESS,\n Utility::MOABException,\n moab::ErrorCodeStr[return_value] ); \n \n \/\/ Range (domain) of all tetrahedral elements\n moab::Range all_tet_elements;\n\n \/\/ ---------------------- Reduce Meshset to 3D ------------------------------\n \n \/\/ Extract 3D elements from meshset\n return_value = d_moab_interface->get_entities_by_dimension(\n d_tet_meshset, 3, all_tet_elements);\n \n TEST_FOR_EXCEPTION( return_value != moab::MB_SUCCESS,\n Utility::MOABException,\n moab::ErrorCodeStr[return_value] );\n \n \/\/ Clear the meshset \n return_value = d_moab_interface->clear_meshset(&d_tet_meshset, 1);\n \n TEST_FOR_EXCEPTION( return_value != moab::MB_SUCCESS,\n Utility::MOABException,\n moab::ErrorCodeStr[return_value] );\n \n \/\/ Reconstruct the meshset using only 3D entitites \n return_value = d_moab_interface->add_entities(\n d_tet_meshset, all_tet_elements);\n \n TEST_FOR_EXCEPTION( return_value != moab::MB_SUCCESS,\n Utility::MOABException,\n moab::ErrorCodeStr[return_value] );\n \n unsigned int number_of_tets = all_tet_elements.size();\n \n for( moab::Range::const_iterator tet = all_tet_elements.begin(); \n tet != all_tet_elements.end(); \n ++tet )\n {\n \/\/ Extract the vertex data for the given tet\n std::vector<moab::EntityHandle> vertex_handles;\n d_moab_interface->get_connectivity( tet, 1, vertex_handles );\n \n \/\/ Test that the vertex entity contains four points\n TEST_FOR_EXCEPTION( vertex_handles.size() != 4,\n\t\t\t Utility::MOABException,\n\t\t\t \"Error: tet found with incorrect number of vertices \"\n\t\t\t \"(\" << vertex_handles.size() << \" != 4)\" );\n \n moab::CartVect vertices[4];\n \n for( unsigned j = 0; j < vertex_handles.size(); ++j )\n {\n\td_moab_interface->get_coords( &vertex_handles[j], \n\t\t\t\t 1, \n\t\t\t\t vertices[j].array() );\n }\n \n \/\/ Calculate Barycentric Matrix\n moab::Matrix3& barycentric_transform_matrix = \n\t d_tet_barycentric_transform_matrices[tet];\n \n Utility::calculateBarycentricTransformMatrix( \n\t\t\t\t\t\t vertices[0],\n\t\t\t\t\t\t vertices[1],\n\t\t\t\t\t\t vertices[2],\n\t\t\t\t\t\t vertices[3],\n barycentric_transform_matrix );\n\n \/\/ Calculate tet volumes\n boost::unordered_map<moab::EntityHandle,double> entity_volumes;\n \n entity_volumes[*tet] = Utility::calculateTetrahedronVolume( vertices[0],\n\t\t\t\t\t\t\t\t vertices[1],\n\t\t\t\t\t\t\t\t vertices[2],\n\t\t\t\t\t\t\t\t vertices[3]);\n\n \/\/ Assign the entity volumes\n this->assignEntities( entity_volumes );\n }\n \n \/\/ ---------------------------- KD Trees ------------------------------------\n \n int current_dimension;\n \n \/\/ Get dimension of the input set\n current_dimension = \n d_moab_interface->dimension_from_handle(all_tet_elements[0]);\n \n moab::Range surface_triangles;\n \n \/\/ Determine the edges from the input set\n return_value = d_moab_interface->get_adjacencies( all_tet_elements, \n\t\t\t\t\t\t current_dimension - 1, \n\t\t\t\t\t\t true,\n\t\t\t\t\t\t surface_triangles, \n\t\t\t\t\t\t moab::Interface::UNION );\n \n TEST_FOR_EXCEPTION( return_value != moab::MB_SUCCESS,\n Utility::MOABException,\n moab::ErrorCodeStr[return_value] );\n \n all_tet_elements.merge( surface_triangles );\n \n const char settings[]=\"MESHSET_FLAGS=0x1;TAG_NAME=0\";\n moab::FileOptions fileopts(settings);\n \n d_kd_tree->build_tree(all_tet_elements, &d_kd_tree_root, &fileopts);\n\n \/\/ Set up OBB Tree (how is this done?)\n} \n\n\/\/ Set the response functions\ntemplate<typename ContributionMultiplierPolicy>\nvoid TetMeshTrackLengthFluxEstimator<ContributionMultiplierPolicy>::setResponseFunctions(\n const Teuchos::Array<Teuchos::RCP<ResponseFunction> >& response_functions )\n{\n for( unsigned i = 0; i < response_functions.size(); ++i )\n {\n if( !response_functions[i]->isSpatiallyUniform() )\n {\n std::cerr << \"Warning: tetrahedral mesh track length estimators can only \"\n\t\t<< \"be used with spatially uniform response functions. Results from \"\n\t\t<< \"tetrahdedral mesh track length estimator \" << getId()\n\t\t<< \"will not be correct.\" << std::endl;\n }\n }\n StandardEntityEstimator::setResponseFunctions( response_functions );\n}\n\n\/\/ Set the particle types that can contribute to the estimator\ntemplate<typename ContributionMultiplierPolicy>\nvoid TetMeshTrackLengthFluxEstimator<ContributionMultiplierPolicy>::setParticleTypes( const Teuchos::Array<ParticleType>& particle_types )\n{\n Estimator::setParticleTypes( particle_types );\n}\n\n\/\/ Add current history estimator contribution\ntemplate<typename ContributionMultiplierPolicy>\nvoid TetMeshTrackLengthFluxEstimator<ContributionMultiplierPolicy>::updateFromParticleSubtrackEndingEvent(\n\t\t\t const ParticleState& particle,\n\t\t\t const Geometry::ModuleTraits::InternalCellHandle,\n\t\t\t const double track_length )\n{\n std::vector<double> ray_tet_intersections;\n std::vector<moab::EntityHandle> tet_surface_triangles;\n\n \/\/ Get all intersections of the ray and the tets\n moab:ErrorCode return_value = \n d_kd_tree->ray_intersect_triangles( d_kd_tree_root,\n 1e-6,\n particle.getDirection().array(),\n particle.getPosition().array(),\n tet_surface_triangles,\n ray_tet_intersections,\n 0,\n track_length );\n \n TEST_FOR_EXCEPTION( return_value != moab::MB_SUCCESS,\n Utility::MOABException,\n moab::ErrorCodeStr[return_value] );\n \n \/\/ Sort all intersections of the ray with the tets\n std::vector<ray_data> intersection_data;\n \n \/\/ Transfer the data to ray_data structures for sorting\n for( unsigned int i = 0; i < ray_tet_intersections.size(); i++ )\n {\n ray_data data;\n data.intersect = ray_tet_intersections[i];\n data.triangle = tet_surface_triangles[i];\n intersection_data.push_back(data);\n }\n \n std::sort(intersection_data.begin(), intersection_data.end(), compare);\n \n \/\/ Transfer the data back to the previous data structures\n for( unsigned int i = 0; i < ray_tet_intersections.size(); i++ )\n {\n ray_tet_intersections[i] = intersection_data[i].intersect;\n tet_surface_triangles[i] = intersection_data[i].triangle;\n }\n \n \/\/ Account for the case where there are no intersections (entirely in tet)\n if( ray_tet_intersections.size() == 0 )\n {\n \/\/ FIGURE OUT HOW TO ADD TRACK LENGTH TO MESH TALLY\n \/\/ Map of tets and contributionss\n \/\/ Map here consists of [d_last_visited_tet] -> [track_length]\n }\n else \n {\n moab::CartVect hit_point;\n std::vector<moab::CartVect> array_of_hit_points;\n moab::CartVect tet_centroid;\n moab::EntityHandle tet;\n \n \/\/ Add the origin point of the ray to the array of points\n array_of_hit_points.push_back( particle.getPosition() );\n \n moab::EntityHandle next_tet_intersected = 0;\n \n for( unsigned int i = 0; i < ray_tet_intersections.size(); i++ )\n {\n hit_point = particle.getDirection()*ray_tet_intersections[i] + \n particle.getPosition();\n array_of_hit_points.push_back(hit_point);\n tet_centroid = ( (array_of_hit_points[i+1]+array_of_hit_points[i])\/2.0 );\n \n tet = POINT_IN_WHICH_TET ? Do we want to do this???\n \n if( tet > 0 )\n {\n if( i != 0)\n partial_track_length =\n ray_tet_intersections[i] - ray_tet_intersections[i-1];\n else\n partial_track_length = ray_tet_intersections[i]j;\n } \n \n \/\/ FIGURE OUT HOW TO ADD TRACK LENGTH TO MESH TALLY\n \/\/ Map of tets and contributionss\n \n }\n \n \/\/ Get any left over track length\n if ( ray_tet_intersections[ray_tet_intersections.size() -1] < track_length )\n {\n partial_track_length = track_length - \n ray_tet_intersections[ray_tet_intersections.size() - 1];\n \n tet = POINT IN WHICH TET ! Again need to talk about this!!!\n \n \/\/ FIGURE OUT HOW TO ADD TRACK LENGTH TO MESH TALLY\n \/\/ Map of tets and contributionss \n }\n \n }\n}\n\n\/\/ Export the estimator data\ntemplate<typename ContributionMultiplierPolicy>\nvoid TetMeshTrackLengthFluxEstimator<ContributionMultiplierPolicy>::exportData(\n EstimatorHDF5FileHandler& hdf5_file,\n\t\t\t\t\t const bool process_data ) const\n{\n \/\/ Export data in FRENSIE formatting for data manipulation\n StandardEntityEstimator::exportData();\n \n \/\/ Export data for visualization\n if( process_data )\n {\n moab::Range all_tet_elements;\n moab::ErrorCode return_value = d_moab_interface->get_entities_by_dimension(\n d_tet_meshset, 3, all_tet_elements);\n \n TEST_FOR_EXCEPTION( return_value != moab::MB_SUCCESS,\n Utility::MOABException,\n moab::ErrorCodeStr[return_value] );\n \n \/\/ Process moments\n for ( moab::Range::const_iterator tet = all_tet_elements.begin(); \n\t tet != all_tet_elements.end(); \n\t ++tet )\n {\n double tet_volume = this->getEntityNormConstant( *tet );\n \n const Estimator::TwoEstimatorMomentsArray& tet_bin_data = \n\t this->getEntityBinData( *tet );\n \n Teuchos::Array<moab::Tag> mean_tag( tet_bin_data.size() + 1 ), \n\t relative_error_tag( tet_bin_data.size() + 1 ),\n\t vov_tag( tet_bin_data.size() + 1 ),\n\t fom_tag( tet_bin_data.size() + 1 );\n\n std::string mean_tag_prefix = \"mean_\";\n std::string relative_error_tag_prefix = \"relative_error_\";\t\n std::string vov_tag_prefix = \"vov_\";\n std::string fom_tag_prefix = \"fom_\";\n\n for( unsigned i = 0; i < tet_bin_data.size(); ++i )\n {\n \tdouble mean, relative_error;\n\t\n \tthis->processMoments( tet_bin_data[i],\n \t\t\t tet_volume,\n \t\t\t mean, \n \t\t\t relative_error );\n\n \tstd::string bin_name = this->getBinName( i );\n \tstd::string mean_tag_name = mean_tag_prefix + bin_name;\n \tstd::string relative_error_tag_name = relative_error_tag_prefix +\n \t bin_name;\n\t \n\t \/\/ Assign mean tag data\n\t moab::ErrorCode return_value = d_moab_interface->tag_get_handle( \n\t\t mean_tag_name.c_str(),\n\t 1,\n\t moab::MB_TYPE_DOUBLE,\n\t\t\t\t mean_tag[i],\n\t\t\t\t moab::MB_TAG_DENSE|moab::MB_TAG_CREAT );\n\n\t TEST_FOR_EXCEPTION( return_value != moab::MB_SUCCESS,\n Utility::MOABException,\n moab::ErrorCodeStr[return_value] );\n\n\t return_value = d_moab_interface->tag_set_data( mean_tag[i], \n\t\t \t\t\t\t *tet,\n\t\t \t\t\t\t 1,\n\t\t\t\t\t\t mean );\n\n\t TEST_FOR_EXCEPTION( return_value != moab::MB_SUCCESS,\n Utility::MOABException,\n moab::ErrorCodeStr[return_value] );\n \n \/\/ Assign error tag data \n\t moab::ErrorCode return_value = d_moab_interface->tag_get_handle( \n\t\t relative_error_tag_name.c_str(),\n\t 1,\n\t moab::MB_TYPE_DOUBLE,\n\t\t\t\t relative_error_tag[i],\n\t\t\t\t moab::MB_TAG_DENSE|moab::MB_TAG_CREAT );\n\n\t TEST_FOR_EXCEPTION( return_value != moab::MB_SUCCESS,\n Utility::MOABException,\n moab::ErrorCodeStr[return_value] );\n\n\t return_value = d_moab_interface->tag_set_data( relative_error_tag[i], \n\t\t \t\t\t\t *tet,\n\t\t \t\t\t\t 1,\n\t\t\t\t\t\t relative_error );\n\n\t TEST_FOR_EXCEPTION( return_value != moab::MB_SUCCESS,\n Utility::MOABException,\n moab::ErrorCodeStr[return_value] );\n }\n \n \/\/ Assign total bin data for each entity\n std::string total_tag_prefix = \"total_\";\n std::string total_mean_tag_name = total_tag_prefix + \"mean\"\n std::string total_relative_error_tag_name = total_tag_prefix +\n \"relative_error\"\n std::string total_vov_tag_name = total_tag_prefix + \"vov\"\n std::string total_fom_tag_name = total_tag_prefix + \"fom\"\n \n const Estimator::FourEstimatorMomentsArray& total_tet_bin_data = \n\t this->getEntityTotalData( *tet );\n\n int end = tet_bin_data.size();\n double mean, relative_error, vov, fom;\n\n this->processMoments( total_tet_bin_data,\n tet_volume,\n mean,\n relative_error,\n vov,\n fom); \n\n \/\/ Assign total mean tag data \n\t moab::ErrorCode return_value = d_moab_interface->tag_get_handle( \n\t\t total_mean_tag_name.c_str(),\n\t 1,\n\t moab::MB_TYPE_DOUBLE,\n\t\t\t\t mean_tag[end],\n\t\t\t\t moab::MB_TAG_DENSE|moab::MB_TAG_CREAT );\n\n\t TEST_FOR_EXCEPTION( return_value != moab::MB_SUCCESS,\n Utility::MOABException,\n moab::ErrorCodeStr[return_value] );\n\n\t return_value = d_moab_interface->tag_set_data( mean_tag[end], \n\t\t \t\t\t\t *tet,\n\t\t \t\t\t\t 1,\n\t\t\t\t\t\t mean );\n\n\t TEST_FOR_EXCEPTION( return_value != moab::MB_SUCCESS,\n Utility::MOABException,\n moab::ErrorCodeStr[return_value] );\n \n \/\/ Assign total relative error tag data \n\t moab::ErrorCode return_value = d_moab_interface->tag_get_handle( \n\t\t total_relative_error_tag_name.c_str(),\n\t 1,\n\t moab::MB_TYPE_DOUBLE,\n\t\t\t\t relative_error_tag[end],\n\t\t\t\t moab::MB_TAG_DENSE|moab::MB_TAG_CREAT );\n\n\t TEST_FOR_EXCEPTION( return_value != moab::MB_SUCCESS,\n Utility::MOABException,\n moab::ErrorCodeStr[return_value] );\n\n\t return_value = d_moab_interface->tag_set_data( relative_error_tag[end], \n\t\t \t\t\t\t *tet,\n\t\t \t\t\t\t 1,\n\t\t\t\t\t\t relative_error );\n\n\t TEST_FOR_EXCEPTION( return_value != moab::MB_SUCCESS,\n Utility::MOABException,\n moab::ErrorCodeStr[return_value] );\n \n \/\/ Assign total vov tag data \n\t moab::ErrorCode return_value = d_moab_interface->tag_get_handle( \n\t\t total_vov_tag_name.c_str(),\n\t 1,\n\t moab::MB_TYPE_DOUBLE,\n\t\t\t\t vov_tag[end],\n\t\t\t\t moab::MB_TAG_DENSE|moab::MB_TAG_CREAT );\n\n\t TEST_FOR_EXCEPTION( return_value != moab::MB_SUCCESS,\n Utility::MOABException,\n moab::ErrorCodeStr[return_value] );\n\n\t return_value = d_moab_interface->tag_set_data( vov_tag[end], \n\t\t \t\t\t\t *tet,\n\t\t \t\t\t\t 1,\n\t\t\t\t\t\t vov );\n\n\t TEST_FOR_EXCEPTION( return_value != moab::MB_SUCCESS,\n Utility::MOABException,\n moab::ErrorCodeStr[return_value] ); \n \n \/\/ Assign total fom tag data \n\t moab::ErrorCode return_value = d_moab_interface->tag_get_handle( \n\t\t total_fom_tag_name.c_str(),\n\t 1,\n\t moab::MB_TYPE_DOUBLE,\n\t\t\t\t fom_tag[end],\n\t\t\t\t moab::MB_TAG_DENSE|moab::MB_TAG_CREAT );\n\n\t TEST_FOR_EXCEPTION( return_value != moab::MB_SUCCESS,\n Utility::MOABException,\n moab::ErrorCodeStr[return_value] );\n\n\t return_value = d_moab_interface->tag_set_data( fom_tag[end], \n\t\t \t\t\t\t *tet,\n\t\t \t\t\t\t 1,\n\t\t\t\t\t\t fom );\n\n\t TEST_FOR_EXCEPTION( return_value != moab::MB_SUCCESS,\n Utility::MOABException,\n moab::ErrorCodeStr[return_value] ); \n }\n } \n}\n\n\/\/ Print the estimator data\ntemplate<typename ContributionMultiplierPolicy>\nvoid TetMeshTrackLengthFluxEstimator<ContributionMultiplierPolicy>::print( \n\t\t\t\t\t\t std::ostream& os ) const\n{\n StandardEntityEstimator::printImplementation( os );\n}\n\n\/\/ Assign bin boundaries to an estimator dimension\ntemplate<typename ContributionMultiplierPolicy>\nvoid TetMeshTrackLengthFluxEstimator<ContributionMultiplierPolicy>::assignBinBoundaries(\n\tconst Teuchos::RCP<EstimatorDimensionDiscretization>& bin_boundaries )\n{\n if( bin_boundaries->getDimension() == COSINE_DIMENSION )\n {\n std::cerr << \"Warning: \" << bin_boundaries->getDimensionName()\n \t << \" bins cannot be set for standard cell estimators. The bins \"\n \t << \"requested for tetrahdedral mesh flux estimator \" << this->getId()\n \t << \" will be ignored.\"\n \t << std::endl;\n }\n else if( bin_boundaries->getDimension() == TIME_DIMENSION )\n {\n std::cerr << \"Warning: \" << bin_boundaries->getDimensionName()\n \t << \" bins cannot be set for standard cell estimators. The bins \"\n \t << \"requested for tetrahdedral mesh flux estimator \" << this->getId()\n \t << \" will be ignored.\"\n \t << std::endl;\n }\n else\n StandardEntityEstimator<cellIdType>::assignBinBoundaries( bin_boundaries );\n}\n \n} \/\/ end MonteCarlo namespace\n\n\/\/---------------------------------------------------------------------------\/\/\n\/\/ end MonteCarlo_TetMeshTrackLengthFluxEstimator.hpp\n\/\/---------------------------------------------------------------------------\/\/\n<|endoftext|>"} {"text":"<commit_before>#include \"shader_program.h\"\n#include \"pathos\/engine.h\"\n#include \"pathos\/render\/render_device.h\"\n#include \"pathos\/util\/log.h\"\n#include \"pathos\/util\/resource_finder.h\"\n\n#include \"badger\/assertion\/assertion.h\"\n\n#include <fstream>\n#include <sstream>\n\n#define DUMP_SHADER_SOURCE 0\n\nnamespace pathos {\n\n\tstatic struct InitRecompileShaders {\n\t\tInitRecompileShaders() {\n\t\t\tEngine::internal_registerGlobalRenderRoutine(InitRecompileShaders::recompileShaders, nullptr);\n\t\t}\n\t\t\/\/ Dirty but works anyway\n\t\tstatic void recompileShaders(OpenGLDevice* device) {\n\t\t\tgEngine->registerExec(\"recompile_shaders\", [](const std::string& command) -> void {\n\t\t\t\tLOG(LogInfo, \"Begin reloading shaders...\");\n\t\t\t\tShaderDB::get().forEach([](ShaderProgram* program) -> void {\n\t\t\t\t\tprogram->reload();\n\t\t\t\t});\n\t\t\t\tLOG(LogInfo, \"End reloading shaders.\");\n\t\t\t});\n\t\t}\n\t} internal_recompileShaders;\n\n\tShaderProgram::ShaderProgram(const char* inDebugName, uint32 inProgramHash)\n\t\t: debugName(inDebugName)\n\t\t, programHash(inProgramHash)\n\t\t, glName(0xffffffff)\n\t\t, firstLoad(true)\n\t\t, internal_justInstantiated(true)\n\t{\n\t\tShaderDB::get().registerProgram(inProgramHash, this);\n\t}\n\n\tShaderProgram::~ShaderProgram()\n\t{\n\t\tCHECK(isValid());\n\t\tShaderDB::get().unregisterProgram(programHash);\n\t}\n\n\tvoid ShaderProgram::addShaderStage(ShaderStage* shaderStage)\n\t{\n\t\tshaderStages.push_back(shaderStage);\n\t}\n\n\tvoid ShaderProgram::reload()\n\t{\n\t\tGLuint oldGLName = glName;\n\t\tbool oldValid = isValid();\n\n\t\t\/\/ Try to compile shader stages\n\t\tbool allCompiled = true;\n\t\tbool allNotChanged = true;\n\t\tfor (ShaderStage* shaderStage : shaderStages) {\n\t\t\tShaderStage::CompileResponse response = shaderStage->tryCompile();\n\t\t\tallCompiled = allCompiled && response != ShaderStage::CompileResponse::Failed;\n\t\t\tallNotChanged = allNotChanged && response == ShaderStage::CompileResponse::NotChanged;\n\t\t}\n\t\tif (allNotChanged) {\n\t\t\tLOG(LogDebug, \"%s: All shader stages are not changed, won't recompile.\", debugName);\n\t\t\treturn;\n\t\t}\n\t\tif (!allCompiled) {\n\t\t\tLOG(LogDebug, \"%s: Failed to compile some shader stages.\", debugName);\n\t\t\treturn;\n\t\t}\n\n\t\t\/\/ Finalize shader compilation\n\t\tfor (ShaderStage* shaderStage : shaderStages) {\n\t\t\tshaderStage->finishCompile();\n\t\t}\n\n\t\t\/\/ Attach and link shader stages\n\t\tglName = glCreateProgram();\n\t\tglObjectLabel(GL_PROGRAM, glName, -1, debugName);\n\t\tfor (ShaderStage* shaderStage : shaderStages) {\n\t\t\tglAttachShader(glName, shaderStage->getGLName());\n\t\t}\n\t\tglLinkProgram(glName);\n\n\t\tGLint isLinked = 0;\n\t\tglGetProgramiv(glName, GL_LINK_STATUS, &isLinked);\n\n\t\tif (isLinked == GL_FALSE) {\n\t\t\t\/\/ If linking failed, leave the old program as is.\n\t\t\tGLint maxLength = 0;\n\t\t\tglGetProgramiv(glName, GL_INFO_LOG_LENGTH, &maxLength);\n\t\t\tif (maxLength == 0) maxLength = 1024;\n\t\t\tstd::vector<GLchar> infoLog(maxLength);\n\t\t\tglGetProgramInfoLog(glName, maxLength, &maxLength, infoLog.data());\n\n\t\t\tLOG(LogError, \"program link error(code=%d): %s\", glGetError(), infoLog.data());\n\n\t\t\tglDeleteProgram(glName);\n\t\t\tglName = oldGLName;\n\t\t} else {\n\t\t\t\/\/ If linked, replace old program with new one.\n\t\t\tif (oldValid) {\n\t\t\t\tglDeleteProgram(oldGLName);\n\t\t\t}\n\t\t\tif (!firstLoad) {\n\t\t\t\tLOG(LogDebug, \"%s: Recompiled the shader program.\", debugName);\n\t\t\t}\n\t\t}\n\t}\n\n\tvoid ShaderProgram::checkFirstLoad()\n\t{\n\t\tif (firstLoad) {\n\t\t\treload();\n\t\t\tfirstLoad = false;\n\t\t}\n\t}\n\n\t\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n\tShaderStage::ShaderStage(GLenum inShaderType, const char* inDebugName)\n\t\t: shaderType(inShaderType)\n\t\t, debugName(inDebugName)\n\t\t, glName(0)\n\t\t, pendingGLName(0)\n\t\t, filepath(nullptr)\n\t{\n\t\tCHECK( inShaderType == GL_VERTEX_SHADER\n\t\t\t|| inShaderType == GL_GEOMETRY_SHADER\n\t\t\t|| inShaderType == GL_TESS_CONTROL_SHADER\n\t\t\t|| inShaderType == GL_TESS_EVALUATION_SHADER\n\t\t\t|| inShaderType == GL_FRAGMENT_SHADER\n\t\t\t|| inShaderType == GL_COMPUTE_SHADER);\n\t\tCHECK(inDebugName != nullptr);\n\t}\n\n\tShaderStage::~ShaderStage()\n\t{\n\t\tif (glName != 0) {\n\t\t\tglDeleteShader(glName);\n\t\t}\n\t}\n\n\tbool ShaderStage::loadSource()\n\t{\n\t\tCHECK(filepath != nullptr);\n\n\t\tstd::string fullFilepath = ResourceFinder::get().find(filepath);\n\n\t\tif (fullFilepath.size() == 0) {\n\t\t\tLOG(LogError, \"[%s]: Couldn't find file: %s\", __FUNCTION__, filepath);\n\t\t\treturn false;\n\t\t}\n\n\t\tstd::ifstream fileStream(fullFilepath);\n\t\tif (fileStream.is_open() == false) {\n\t\t\tLOG(LogError, \"[%s]: Couldn't open file: %s\", __FUNCTION__, filepath);\n\t\t\treturn false;\n\t\t}\n\n\t\tstd::ostringstream codeStream;\n\t\tcodeStream << fileStream.rdbuf();\n\t\tstd::string fullCode = std::move(codeStream.str());\n\n\t\tsize_t version_start = fullCode.find(\"#version\");\n\t\tif (version_start == std::string::npos) {\n\t\t\tLOG(LogError, \"[%s]: GLSL source file should contain '#version' statement\", __FUNCTION__);\n\t\t\treturn false;\n\t\t}\n\n\t\tsize_t version_end = fullCode.find_first_of('\\n', version_start);\n\n\t\t\/\/ Add defines\n\t\tif (defines.size() > 0) {\n\t\t\tcodeStream.clear();\n\t\t\tcodeStream.str(\"\");\n\t\t\t\/\/ Put #version back\n\t\t\tcodeStream << fullCode.substr(version_start, version_end - version_start + 1);\n\t\t\tfor (const std::string& def : defines) {\n\t\t\t\tcodeStream << \"#define \" << def << '\\n';\n\t\t\t}\n\t\t\tcodeStream << fullCode.substr(version_end + 1);\n\t\t\tfullCode = std::move(codeStream.str());\n\t\t}\n\n\t\tsourceCode.clear();\n\n\t\tsize_t find_offset = 0u;\n\t\twhile (true) {\n\t\t\t\/\/ #todo-shader: Need to skip '#include' in comments\n\t\t\tsize_t include_start = fullCode.find(\"#include\", find_offset);\n\t\t\tif (include_start == std::string::npos) {\n\t\t\t\tbreak;\n\t\t\t}\n\n\t\t\tsize_t include_end = fullCode.find_first_of('\\n', include_start);\n\t\t\tsourceCode.emplace_back(fullCode.substr(0, include_start));\n\t\t\tstd::string include_line = fullCode.substr(include_start, include_end - include_start);\n\n\t\t\tsize_t quote_start = include_line.find('\"');\n\t\t\tsize_t quote_end = include_line.find('\"', quote_start + 1);\n\t\t\tCHECK(quote_start != std::string::npos && quote_end != std::string::npos);\n\n\t\t\t\/\/ #todo-shader: Support recursive include?\n\t\t\tstd::string include_file = include_line.substr(quote_start + 1, quote_end - quote_start - 1);\n\t\t\tstd::string include_filepath = ResourceFinder::get().find(include_file);\n\t\t\tstd::ifstream subfile(include_filepath);\n\t\t\tif (!subfile.is_open()) {\n\t\t\t\tLOG(LogError, \"Couldn't open a #include file: %s\", include_filepath.c_str());\n\t\t\t\treturn false;\n\t\t\t}\n\t\t\tstd::ostringstream substream;\n\t\t\tsubstream << subfile.rdbuf();\n\t\t\tsourceCode.emplace_back(substream.str());\n\n\t\t\tfullCode = fullCode.substr(include_end + 1);\n\t\t}\n\n\t\tsourceCode.emplace_back(fullCode);\n\n\t\treturn true;\n\t}\n\n\tShaderStage::CompileResponse ShaderStage::tryCompile()\n\t{\n\t\tstd::vector<std::string> sourceCodeBackup = sourceCode;\n\t\tloadSource();\n\n\t\tbool sourceChanged = false;\n\t\tif (sourceCode.size() == sourceCodeBackup.size()) {\n\t\t\tfor (uint32 i = 0; i < sourceCode.size(); ++i) {\n\t\t\t\tif (sourceCode[i] != sourceCodeBackup[i]) {\n\t\t\t\t\tsourceChanged = true;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t} else {\n\t\t\tsourceChanged = true;\n\t\t}\n\t\tif (sourceChanged == false) {\n\t\t\tLOG(LogDebug, \"%s: Source code is same.\", debugName);\n\t\t\treturn ShaderStage::CompileResponse::NotChanged;\n\t\t}\n\n\t\tif (pendingGLName != 0) {\n\t\t\tglDeleteShader(pendingGLName);\n\t\t}\n\n\t\t\/\/ #todo-shader-rework: Output shader code to intermediate\/shader_dump\n#if DUMP_SHADER_SOURCE\n\t\t\/\/\n#endif\n\t\t\n\t\tstd::vector<const char*> sourceList;\n\t\tfor (const auto& s : sourceCode) {\n\t\t\tsourceList.push_back(s.c_str());\n\t\t}\n\n\t\tpendingGLName = glCreateShader(shaderType);\n\t\tglShaderSource(pendingGLName, (GLsizei)sourceList.size(), sourceList.data(), NULL);\n\t\tglCompileShader(pendingGLName);\n\n\t\tGLint success;\n\t\tglGetShaderiv(pendingGLName, GL_COMPILE_STATUS, &success);\n\n\t\tif (success == GL_FALSE) {\n\t\t\tGLint logSize;\n\t\t\tglGetShaderiv(pendingGLName, GL_INFO_LOG_LENGTH, &logSize);\n\n\t\t\tstd::string errorLog;\n\t\t\terrorLog.resize(logSize);\n\t\t\tglGetShaderInfoLog(pendingGLName, logSize, NULL, &errorLog[0]);\n\t\t\tLOG(LogError, \"Failed to compile shader (%s) : %s\", debugName, errorLog.c_str());\n\n\t\t\tglDeleteShader(pendingGLName);\n\t\t\tpendingGLName = 0;\n\n\t\t\treturn ShaderStage::CompileResponse::Failed;\n\t\t}\n\n\t\treturn ShaderStage::CompileResponse::Compiled;\n\t}\n\n\tbool ShaderStage::finishCompile()\n\t{\n\t\tif (pendingGLName == 0) {\n\t\t\treturn false;\n\t\t}\n\n\t\tif (glName != 0) {\n\t\t\tglDeleteShader(glName);\n\t\t}\n\n\t\tglName = pendingGLName;\n\t\tpendingGLName = 0;\n\n\t\tglObjectLabel(GL_SHADER, glName, -1, debugName);\n\n\t\treturn true;\n\t}\n\n}\n<commit_msg>No log for same shaders when recompiling<commit_after>#include \"shader_program.h\"\n#include \"pathos\/engine.h\"\n#include \"pathos\/render\/render_device.h\"\n#include \"pathos\/util\/log.h\"\n#include \"pathos\/util\/resource_finder.h\"\n\n#include \"badger\/assertion\/assertion.h\"\n\n#include <fstream>\n#include <sstream>\n\n#define DUMP_SHADER_SOURCE 0\n#define IGNORE_SAME_SHADERS_ON_RECOMPILE 1\n\nnamespace pathos {\n\n\tstatic struct InitRecompileShaders {\n\t\tInitRecompileShaders() {\n\t\t\tEngine::internal_registerGlobalRenderRoutine(InitRecompileShaders::recompileShaders, nullptr);\n\t\t}\n\t\t\/\/ Dirty but works anyway\n\t\tstatic void recompileShaders(OpenGLDevice* device) {\n\t\t\tgEngine->registerExec(\"recompile_shaders\", [](const std::string& command) -> void {\n\t\t\t\tLOG(LogInfo, \"Begin reloading shaders...\");\n\t\t\t\tShaderDB::get().forEach([](ShaderProgram* program) -> void {\n\t\t\t\t\tprogram->reload();\n\t\t\t\t});\n\t\t\t\tLOG(LogInfo, \"End reloading shaders.\");\n\t\t\t});\n\t\t}\n\t} internal_recompileShaders;\n\n\tShaderProgram::ShaderProgram(const char* inDebugName, uint32 inProgramHash)\n\t\t: debugName(inDebugName)\n\t\t, programHash(inProgramHash)\n\t\t, glName(0xffffffff)\n\t\t, firstLoad(true)\n\t\t, internal_justInstantiated(true)\n\t{\n\t\tShaderDB::get().registerProgram(inProgramHash, this);\n\t}\n\n\tShaderProgram::~ShaderProgram()\n\t{\n\t\tCHECK(isValid());\n\t\tShaderDB::get().unregisterProgram(programHash);\n\t}\n\n\tvoid ShaderProgram::addShaderStage(ShaderStage* shaderStage)\n\t{\n\t\tshaderStages.push_back(shaderStage);\n\t}\n\n\tvoid ShaderProgram::reload()\n\t{\n\t\tGLuint oldGLName = glName;\n\t\tbool oldValid = isValid();\n\n\t\t\/\/ Try to compile shader stages\n\t\tbool allCompiled = true;\n\t\tbool allNotChanged = true;\n\t\tfor (ShaderStage* shaderStage : shaderStages) {\n\t\t\tShaderStage::CompileResponse response = shaderStage->tryCompile();\n\t\t\tallCompiled = allCompiled && response != ShaderStage::CompileResponse::Failed;\n\t\t\tallNotChanged = allNotChanged && response == ShaderStage::CompileResponse::NotChanged;\n\t\t}\n\t\tif (allNotChanged) {\n#if IGNORE_SAME_SHADERS_ON_RECOMPILE == 0\n\t\t\tLOG(LogDebug, \"%s: All shader stages are not changed, won't recompile.\", debugName);\n#endif\n\t\t\treturn;\n\t\t}\n\t\tif (!allCompiled) {\n\t\t\tLOG(LogDebug, \"%s: Failed to compile some shader stages.\", debugName);\n\t\t\treturn;\n\t\t}\n\n\t\t\/\/ Finalize shader compilation\n\t\tfor (ShaderStage* shaderStage : shaderStages) {\n\t\t\tshaderStage->finishCompile();\n\t\t}\n\n\t\t\/\/ Attach and link shader stages\n\t\tglName = glCreateProgram();\n\t\tglObjectLabel(GL_PROGRAM, glName, -1, debugName);\n\t\tfor (ShaderStage* shaderStage : shaderStages) {\n\t\t\tglAttachShader(glName, shaderStage->getGLName());\n\t\t}\n\t\tglLinkProgram(glName);\n\n\t\tGLint isLinked = 0;\n\t\tglGetProgramiv(glName, GL_LINK_STATUS, &isLinked);\n\n\t\tif (isLinked == GL_FALSE) {\n\t\t\t\/\/ If linking failed, leave the old program as is.\n\t\t\tGLint maxLength = 0;\n\t\t\tglGetProgramiv(glName, GL_INFO_LOG_LENGTH, &maxLength);\n\t\t\tif (maxLength == 0) maxLength = 1024;\n\t\t\tstd::vector<GLchar> infoLog(maxLength);\n\t\t\tglGetProgramInfoLog(glName, maxLength, &maxLength, infoLog.data());\n\n\t\t\tLOG(LogError, \"program link error(code=%d): %s\", glGetError(), infoLog.data());\n\n\t\t\tglDeleteProgram(glName);\n\t\t\tglName = oldGLName;\n\t\t} else {\n\t\t\t\/\/ If linked, replace old program with new one.\n\t\t\tif (oldValid) {\n\t\t\t\tglDeleteProgram(oldGLName);\n\t\t\t}\n\t\t\tif (!firstLoad) {\n\t\t\t\tLOG(LogDebug, \"%s: Recompiled the shader program.\", debugName);\n\t\t\t}\n\t\t}\n\t}\n\n\tvoid ShaderProgram::checkFirstLoad()\n\t{\n\t\tif (firstLoad) {\n\t\t\treload();\n\t\t\tfirstLoad = false;\n\t\t}\n\t}\n\n\t\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n\tShaderStage::ShaderStage(GLenum inShaderType, const char* inDebugName)\n\t\t: shaderType(inShaderType)\n\t\t, debugName(inDebugName)\n\t\t, glName(0)\n\t\t, pendingGLName(0)\n\t\t, filepath(nullptr)\n\t{\n\t\tCHECK( inShaderType == GL_VERTEX_SHADER\n\t\t\t|| inShaderType == GL_GEOMETRY_SHADER\n\t\t\t|| inShaderType == GL_TESS_CONTROL_SHADER\n\t\t\t|| inShaderType == GL_TESS_EVALUATION_SHADER\n\t\t\t|| inShaderType == GL_FRAGMENT_SHADER\n\t\t\t|| inShaderType == GL_COMPUTE_SHADER);\n\t\tCHECK(inDebugName != nullptr);\n\t}\n\n\tShaderStage::~ShaderStage()\n\t{\n\t\tif (glName != 0) {\n\t\t\tglDeleteShader(glName);\n\t\t}\n\t}\n\n\tbool ShaderStage::loadSource()\n\t{\n\t\tCHECK(filepath != nullptr);\n\n\t\tstd::string fullFilepath = ResourceFinder::get().find(filepath);\n\n\t\tif (fullFilepath.size() == 0) {\n\t\t\tLOG(LogError, \"[%s]: Couldn't find file: %s\", __FUNCTION__, filepath);\n\t\t\treturn false;\n\t\t}\n\n\t\tstd::ifstream fileStream(fullFilepath);\n\t\tif (fileStream.is_open() == false) {\n\t\t\tLOG(LogError, \"[%s]: Couldn't open file: %s\", __FUNCTION__, filepath);\n\t\t\treturn false;\n\t\t}\n\n\t\tstd::ostringstream codeStream;\n\t\tcodeStream << fileStream.rdbuf();\n\t\tstd::string fullCode = std::move(codeStream.str());\n\n\t\tsize_t version_start = fullCode.find(\"#version\");\n\t\tif (version_start == std::string::npos) {\n\t\t\tLOG(LogError, \"[%s]: GLSL source file should contain '#version' statement\", __FUNCTION__);\n\t\t\treturn false;\n\t\t}\n\n\t\tsize_t version_end = fullCode.find_first_of('\\n', version_start);\n\n\t\t\/\/ Add defines\n\t\tif (defines.size() > 0) {\n\t\t\tcodeStream.clear();\n\t\t\tcodeStream.str(\"\");\n\t\t\t\/\/ Put #version back\n\t\t\tcodeStream << fullCode.substr(version_start, version_end - version_start + 1);\n\t\t\tfor (const std::string& def : defines) {\n\t\t\t\tcodeStream << \"#define \" << def << '\\n';\n\t\t\t}\n\t\t\tcodeStream << fullCode.substr(version_end + 1);\n\t\t\tfullCode = std::move(codeStream.str());\n\t\t}\n\n\t\tsourceCode.clear();\n\n\t\tsize_t find_offset = 0u;\n\t\twhile (true) {\n\t\t\t\/\/ #todo-shader: Need to skip '#include' in comments\n\t\t\tsize_t include_start = fullCode.find(\"#include\", find_offset);\n\t\t\tif (include_start == std::string::npos) {\n\t\t\t\tbreak;\n\t\t\t}\n\n\t\t\tsize_t include_end = fullCode.find_first_of('\\n', include_start);\n\t\t\tsourceCode.emplace_back(fullCode.substr(0, include_start));\n\t\t\tstd::string include_line = fullCode.substr(include_start, include_end - include_start);\n\n\t\t\tsize_t quote_start = include_line.find('\"');\n\t\t\tsize_t quote_end = include_line.find('\"', quote_start + 1);\n\t\t\tCHECK(quote_start != std::string::npos && quote_end != std::string::npos);\n\n\t\t\t\/\/ #todo-shader: Support recursive include?\n\t\t\tstd::string include_file = include_line.substr(quote_start + 1, quote_end - quote_start - 1);\n\t\t\tstd::string include_filepath = ResourceFinder::get().find(include_file);\n\t\t\tstd::ifstream subfile(include_filepath);\n\t\t\tif (!subfile.is_open()) {\n\t\t\t\tLOG(LogError, \"Couldn't open a #include file: %s\", include_filepath.c_str());\n\t\t\t\treturn false;\n\t\t\t}\n\t\t\tstd::ostringstream substream;\n\t\t\tsubstream << subfile.rdbuf();\n\t\t\tsourceCode.emplace_back(substream.str());\n\n\t\t\tfullCode = fullCode.substr(include_end + 1);\n\t\t}\n\n\t\tsourceCode.emplace_back(fullCode);\n\n\t\treturn true;\n\t}\n\n\tShaderStage::CompileResponse ShaderStage::tryCompile()\n\t{\n\t\tstd::vector<std::string> sourceCodeBackup = sourceCode;\n\t\tloadSource();\n\n\t\tbool sourceChanged = false;\n\t\tif (sourceCode.size() == sourceCodeBackup.size()) {\n\t\t\tfor (uint32 i = 0; i < sourceCode.size(); ++i) {\n\t\t\t\tif (sourceCode[i] != sourceCodeBackup[i]) {\n\t\t\t\t\tsourceChanged = true;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t} else {\n\t\t\tsourceChanged = true;\n\t\t}\n\t\tif (sourceChanged == false) {\n#if IGNORE_SAME_SHADERS_ON_RECOMPILE == 0\n\t\t\tLOG(LogDebug, \"%s: Source code is same.\", debugName);\n#endif\n\t\t\treturn ShaderStage::CompileResponse::NotChanged;\n\t\t}\n\n\t\tif (pendingGLName != 0) {\n\t\t\tglDeleteShader(pendingGLName);\n\t\t}\n\n\t\t\/\/ #todo-shader-rework: Output shader code to intermediate\/shader_dump\n#if DUMP_SHADER_SOURCE\n\t\t\/\/\n#endif\n\t\t\n\t\tstd::vector<const char*> sourceList;\n\t\tfor (const auto& s : sourceCode) {\n\t\t\tsourceList.push_back(s.c_str());\n\t\t}\n\n\t\tpendingGLName = glCreateShader(shaderType);\n\t\tglShaderSource(pendingGLName, (GLsizei)sourceList.size(), sourceList.data(), NULL);\n\t\tglCompileShader(pendingGLName);\n\n\t\tGLint success;\n\t\tglGetShaderiv(pendingGLName, GL_COMPILE_STATUS, &success);\n\n\t\tif (success == GL_FALSE) {\n\t\t\tGLint logSize;\n\t\t\tglGetShaderiv(pendingGLName, GL_INFO_LOG_LENGTH, &logSize);\n\n\t\t\tstd::string errorLog;\n\t\t\terrorLog.resize(logSize);\n\t\t\tglGetShaderInfoLog(pendingGLName, logSize, NULL, &errorLog[0]);\n\t\t\tLOG(LogError, \"Failed to compile shader (%s) : %s\", debugName, errorLog.c_str());\n\n\t\t\tglDeleteShader(pendingGLName);\n\t\t\tpendingGLName = 0;\n\n\t\t\treturn ShaderStage::CompileResponse::Failed;\n\t\t}\n\n\t\treturn ShaderStage::CompileResponse::Compiled;\n\t}\n\n\tbool ShaderStage::finishCompile()\n\t{\n\t\tif (pendingGLName == 0) {\n\t\t\treturn false;\n\t\t}\n\n\t\tif (glName != 0) {\n\t\t\tglDeleteShader(glName);\n\t\t}\n\n\t\tglName = pendingGLName;\n\t\tpendingGLName = 0;\n\n\t\tglObjectLabel(GL_SHADER, glName, -1, debugName);\n\n\t\treturn true;\n\t}\n\n}\n<|endoftext|>"} {"text":"<commit_before>#ifndef _PNMC_MC_STATISTICS_SERIALIZE_HH_\n#define _PNMC_MC_STATISTICS_SERIALIZE_HH_\n\n#include <cereal\/archives\/json.hpp>\n#include <cereal\/types\/deque.hpp>\n\n#include \"conf\/configuration.hh\"\n#include \"mc\/statistics.hh\"\n\nnamespace pnmc { namespace mc {\n\n\/*------------------------------------------------------------------------------------------------*\/\n\ntemplate<class Archive>\nvoid\nsave(Archive& archive, const statistics& s)\n{\n archive( cereal::make_nvp(\"interrupted\", s.interrupted)\n , cereal::make_nvp(\"states\", s.nb_states)\n , cereal::make_nvp(\"states as string\", std::to_string(s.nb_states))\n , cereal::make_nvp(\"relation time\", s.relation_duration.count())\n , cereal::make_nvp(\"rewrite time\", s.rewrite_duration.count())\n , cereal::make_nvp(\"state space time\", s.state_space_duration.count())\n , cereal::make_nvp(\"sdd samples\", s.sdd_ut_size)\n );\n if (s.conf.order_ordering_force)\n {\n archive(cereal::make_nvp(\"FORCE time\", s.force_duration.count()));\n }\n if (s.conf.compute_dead_states)\n {\n archive( cereal::make_nvp(\"dead states relation time\", s.dead_states_relation_duration.count())\n , cereal::make_nvp(\"dead states rewrite time\", s.dead_states_rewrite_duration.count())\n , cereal::make_nvp(\"dead states time\", s.dead_states_duration.count())\n );\n }\n}\n\n\/*------------------------------------------------------------------------------------------------*\/\n\n}} \/\/ namespace pnmc::mc\n\n#endif \/\/ _PNMC_MC_STATISTICS_SERIALIZE_HH_\n<commit_msg>Add the time limit to serialized statistics.<commit_after>#ifndef _PNMC_MC_STATISTICS_SERIALIZE_HH_\n#define _PNMC_MC_STATISTICS_SERIALIZE_HH_\n\n#include <cereal\/archives\/json.hpp>\n#include <cereal\/types\/deque.hpp>\n\n#include \"conf\/configuration.hh\"\n#include \"mc\/statistics.hh\"\n\nnamespace pnmc { namespace mc {\n\n\/*------------------------------------------------------------------------------------------------*\/\n\ntemplate<class Archive>\nvoid\nsave(Archive& archive, const statistics& s)\n{\n archive( cereal::make_nvp(\"interrupted\", s.interrupted)\n , cereal::make_nvp(\"time limit\", s.conf.max_time.count())\n , cereal::make_nvp(\"states\", s.nb_states)\n , cereal::make_nvp(\"states as string\", std::to_string(s.nb_states))\n , cereal::make_nvp(\"relation time\", s.relation_duration.count())\n , cereal::make_nvp(\"rewrite time\", s.rewrite_duration.count())\n , cereal::make_nvp(\"state space time\", s.state_space_duration.count())\n , cereal::make_nvp(\"sdd samples\", s.sdd_ut_size)\n );\n if (s.conf.order_ordering_force)\n {\n archive(cereal::make_nvp(\"FORCE time\", s.force_duration.count()));\n }\n if (s.conf.compute_dead_states)\n {\n archive( cereal::make_nvp(\"dead states relation time\", s.dead_states_relation_duration.count())\n , cereal::make_nvp(\"dead states rewrite time\", s.dead_states_rewrite_duration.count())\n , cereal::make_nvp(\"dead states time\", s.dead_states_duration.count())\n );\n }\n}\n\n\/*------------------------------------------------------------------------------------------------*\/\n\n}} \/\/ namespace pnmc::mc\n\n#endif \/\/ _PNMC_MC_STATISTICS_SERIALIZE_HH_\n<|endoftext|>"} {"text":"<commit_before>\/*\n\tNazara Engine\n\n\tCopyright (C) 2015 Jérôme \"Lynix\" Leclercq (Lynix680@gmail.com)\n\n\tPermission is hereby granted, free of charge, to any person obtaining a copy of\n\tthis software and associated documentation files (the \"Software\"), to deal in\n\tthe Software without restriction, including without limitation the rights to\n\tuse, copy, modify, merge, publish, distribute, sublicense, and\/or sell copies\n\tof the Software, and to permit persons to whom the Software is furnished to do\n\tso, subject to the following conditions:\n\n\tThe above copyright notice and this permission notice shall be included in all\n\tcopies or substantial portions of the Software.\n\n\tTHE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\n\tIMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\n\tFITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE\n\tAUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\n\tLIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,\n\tOUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE\n\tSOFTWARE.\n*\/\n\n#ifndef NAZARA_PREREQUISITES_HPP\n#define NAZARA_PREREQUISITES_HPP\n\n#if defined(__APPLE__)\n#include <TargetConditionals.h>\n#endif\n\n\/\/ Try to identify the compiler\n#if defined(__BORLANDC__)\n\t#define NAZARA_COMPILER_BORDLAND\n\t#define NAZARA_DEPRECATED(txt)\n\t#define NAZARA_FUNCTION __FUNC__\n#elif defined(__clang__)\n\t#define NAZARA_COMPILER_CLANG\n\t#define NAZARA_DEPRECATED(txt) __attribute__((__deprecated__(txt)))\n\t#define NAZARA_FUNCTION __PRETTY_FUNCTION__\n\n\t#ifdef __MINGW32__\n\t\t#define NAZARA_COMPILER_MINGW\n\t\t#ifdef __MINGW64_VERSION_MAJOR\n\t\t\t#define NAZARA_COMPILER_MINGW_W64\n\t\t#endif\n\t#endif\n#elif defined(__GNUC__) || defined(__MINGW32__)\n\t#define NAZARA_COMPILER_GCC\n\t#define NAZARA_DEPRECATED(txt) __attribute__((__deprecated__(txt)))\n\t#define NAZARA_FUNCTION __PRETTY_FUNCTION__\n\n\t#ifdef __MINGW32__\n\t\t#define NAZARA_COMPILER_MINGW\n\t\t#ifdef __MINGW64_VERSION_MAJOR\n\t\t\t#define NAZARA_COMPILER_MINGW_W64\n\t\t#endif\n\t#endif\n#elif defined(__INTEL_COMPILER) || defined(__ICL)\n\t#define NAZARA_COMPILER_INTEL\n\t#define NAZARA_DEPRECATED(txt)\n\t#define NAZARA_FUNCTION __FUNCTION__\n#elif defined(_MSC_VER)\n\t#define NAZARA_COMPILER_MSVC\n\t#define NAZARA_DEPRECATED(txt) __declspec(deprecated(txt))\n\t#define NAZARA_FUNCTION __FUNCSIG__\n\n\t#if _MSC_VER >= 1900\n\t\t#define NAZARA_COMPILER_SUPPORTS_CPP11\n\t#endif\n\n\t#pragma warning(disable: 4251)\n#else\n\t#define NAZARA_COMPILER_UNKNOWN\n\t#define NAZARA_DEPRECATED(txt)\n\t#define NAZARA_FUNCTION __func__ \/\/ __func__ has been standardized in C++ 2011\n\n\t#pragma message This compiler is not fully supported\n#endif\n\n#if !defined(NAZARA_COMPILER_SUPPORTS_CPP11) && defined(__cplusplus) && __cplusplus >= 201103L\n\t#define NAZARA_COMPILER_SUPPORTS_CPP11\n#endif\n\n#ifndef NAZARA_COMPILER_SUPPORTS_CPP11\n\t#error Nazara requires a C++11 compliant compiler\n#endif\n\n\/\/ Nazara version macro\n#define NAZARA_VERSION_MAJOR 0\n#define NAZARA_VERSION_MINOR 4\n#define NAZARA_VERSION_PATCH 0\n\n#include <Nazara\/Core\/Config.hpp>\n\n\/\/ Try to identify target platform via defines\n#if defined(_WIN32)\n\t#define NAZARA_PLATFORM_DESKTOP\n\t#define NAZARA_PLATFORM_WINDOWS\n\n\t#define NAZARA_EXPORT __declspec(dllexport)\n\t#define NAZARA_IMPORT __declspec(dllimport)\n\n\t\/\/ Somes defines for windows.h include..\n\t#if defined(NAZARA_BUILD)\n\t\t#ifndef WIN32_LEAN_AND_MEAN\n\t\t\t#define WIN32_LEAN_AND_MEAN\n\t\t#endif\n\n\t\t#ifndef NOMINMAX\n\t\t\t#define NOMINMAX\n\t\t#endif\n\n\t\t#if NAZARA_CORE_WINDOWS_NT6\n\t\t\t#define NAZARA_WINNT 0x0600\n\t\t#else\n\t\t\t#define NAZARA_WINNT 0x0501\n\t\t#endif\n\n\t\t\/\/ Keep the actual define if existing and greater than our requirement\n\t\t#if defined(_WIN32_WINNT)\n\t\t\t#if _WIN32_WINNT < NAZARA_WINNT\n\t\t\t\t#undef _WIN32_WINNT\n\t\t\t\t#define _WIN32_WINNT NAZARA_WINNT\n\t\t\t#endif\n\t\t#else\n\t\t\t#define _WIN32_WINNT NAZARA_WINNT\n\t\t#endif\n\t#endif\n#elif defined(__linux__) || defined(__unix__)\n\t#define NAZARA_PLATFORM_DESKTOP\n\t#define NAZARA_PLATFORM_LINUX\n\t#define NAZARA_PLATFORM_POSIX\n\n\t#define NAZARA_EXPORT __attribute__((visibility (\"default\")))\n\t#define NAZARA_IMPORT __attribute__((visibility (\"default\")))\n#elif defined(__APPLE__) && !TARGET_OS_IPHONE\n\t#define NAZARA_PLATFORM_DESKTOP\n\t#define NAZARA_PLATFORM_MACOS\n\t#define NAZARA_PLATFORM_POSIX\n\n\t#define NAZARA_EXPORT __attribute__((visibility (\"default\")))\n\t#define NAZARA_IMPORT __attribute__((visibility (\"default\")))\n#else\n\t#error This operating system is not fully supported by the Nazara Engine\n\n\t#define NAZARA_PLATFORM_UNKNOWN\n#endif\n\n\/\/ Detect 64 bits\n#if !defined(NAZARA_PLATFORM_x64) && (defined(_WIN64) || defined(__amd64__) || defined(__x86_64__) || defined(__ia64__) || defined(__ia64) || \\\n\tdefined(_M_IA64) || defined(__itanium__) || defined(__MINGW64__) || defined(_M_AMD64) || defined (_M_X64))\n\t#define NAZARA_PLATFORM_x64\n#endif\n\n#ifdef NAZARA_UNITY_BUILD\n\t#define NAZARA_ANONYMOUS_NAMESPACE NAZARA_UNITY_ID\n\t#define NAZARA_USE_ANONYMOUS_NAMESPACE using namespace NAZARA_UNITY_ID;\n\t#define NAZARA_ANONYMOUS_NAMESPACE_PREFIX(a) NAZARA_UNITY_ID::a\n#else\n\t#define NAZARA_ANONYMOUS_NAMESPACE\n\t#define NAZARA_USE_ANONYMOUS_NAMESPACE\n\t#define NAZARA_ANONYMOUS_NAMESPACE_PREFIX(a) a\n#endif\n\n\/\/ A bunch of useful macros\n#define NazaraPrefix(a, prefix) prefix ## a\n#define NazaraPrefixMacro(a, prefix) NazaraPrefix(a, prefix)\n#define NazaraSuffix(a, suffix) a ## suffix\n#define NazaraSuffixMacro(a, suffix) NazaraSuffix(a, suffix)\n#define NazaraStringify(s) #s\n#define NazaraStringifyMacro(s) NazaraStringify(s) \/\/ http:\/\/gcc.gnu.org\/onlinedocs\/cpp\/Stringification.html#Stringification\n#define NazaraUnused(a) (void) a\n\n#include <climits>\n#include <cstdint>\n\nstatic_assert(CHAR_BIT == 8, \"CHAR_BIT is expected to be 8\");\n\nstatic_assert(sizeof(int8_t) == 1, \"int8_t is not of the correct size\" );\nstatic_assert(sizeof(int16_t) == 2, \"int16_t is not of the correct size\");\nstatic_assert(sizeof(int32_t) == 4, \"int32_t is not of the correct size\");\nstatic_assert(sizeof(int64_t) == 8, \"int64_t is not of the correct size\");\n\nstatic_assert(sizeof(uint8_t) == 1, \"uint8_t is not of the correct size\" );\nstatic_assert(sizeof(uint16_t) == 2, \"uint16_t is not of the correct size\");\nstatic_assert(sizeof(uint32_t) == 4, \"uint32_t is not of the correct size\");\nstatic_assert(sizeof(uint64_t) == 8, \"uint64_t is not of the correct size\");\n\nnamespace Nz\n{\n\tusing Int8 = int8_t;\n\tusing UInt8 = uint8_t;\n\n\tusing Int16 = int16_t;\n\tusing UInt16 = uint16_t;\n\n\tusing Int32 = int32_t;\n\tusing UInt32 = uint32_t;\n\n\tusing Int64 = int64_t;\n\tusing UInt64 = uint64_t;\n}\n\n#endif \/\/ NAZARA_PREREQUISITES_HPP\n<commit_msg>Update Prerequisites.hpp<commit_after>\/*\n\tNazara Engine\n\n\tCopyright (C) 2015 Jérôme \"Lynix\" Leclercq (Lynix680@gmail.com)\n\n\tPermission is hereby granted, free of charge, to any person obtaining a copy of\n\tthis software and associated documentation files (the \"Software\"), to deal in\n\tthe Software without restriction, including without limitation the rights to\n\tuse, copy, modify, merge, publish, distribute, sublicense, and\/or sell copies\n\tof the Software, and to permit persons to whom the Software is furnished to do\n\tso, subject to the following conditions:\n\n\tThe above copyright notice and this permission notice shall be included in all\n\tcopies or substantial portions of the Software.\n\n\tTHE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\n\tIMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\n\tFITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE\n\tAUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\n\tLIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,\n\tOUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE\n\tSOFTWARE.\n*\/\n\n#ifndef NAZARA_PREREQUISITES_HPP\n#define NAZARA_PREREQUISITES_HPP\n\n\/\/ Try to identify the compiler\n#if defined(__BORLANDC__)\n\t#define NAZARA_COMPILER_BORDLAND\n\t#define NAZARA_DEPRECATED(txt)\n\t#define NAZARA_FUNCTION __FUNC__\n#elif defined(__clang__)\n\t#define NAZARA_COMPILER_CLANG\n\t#define NAZARA_DEPRECATED(txt) __attribute__((__deprecated__(txt)))\n\t#define NAZARA_FUNCTION __PRETTY_FUNCTION__\n\n\t#ifdef __MINGW32__\n\t\t#define NAZARA_COMPILER_MINGW\n\t\t#ifdef __MINGW64_VERSION_MAJOR\n\t\t\t#define NAZARA_COMPILER_MINGW_W64\n\t\t#endif\n\t#endif\n#elif defined(__GNUC__) || defined(__MINGW32__)\n\t#define NAZARA_COMPILER_GCC\n\t#define NAZARA_DEPRECATED(txt) __attribute__((__deprecated__(txt)))\n\t#define NAZARA_FUNCTION __PRETTY_FUNCTION__\n\n\t#ifdef __MINGW32__\n\t\t#define NAZARA_COMPILER_MINGW\n\t\t#ifdef __MINGW64_VERSION_MAJOR\n\t\t\t#define NAZARA_COMPILER_MINGW_W64\n\t\t#endif\n\t#endif\n#elif defined(__INTEL_COMPILER) || defined(__ICL)\n\t#define NAZARA_COMPILER_INTEL\n\t#define NAZARA_DEPRECATED(txt)\n\t#define NAZARA_FUNCTION __FUNCTION__\n#elif defined(_MSC_VER)\n\t#define NAZARA_COMPILER_MSVC\n\t#define NAZARA_DEPRECATED(txt) __declspec(deprecated(txt))\n\t#define NAZARA_FUNCTION __FUNCSIG__\n\n\t#if _MSC_VER >= 1900\n\t\t#define NAZARA_COMPILER_SUPPORTS_CPP11\n\t#endif\n\n\t#pragma warning(disable: 4251)\n#else\n\t#define NAZARA_COMPILER_UNKNOWN\n\t#define NAZARA_DEPRECATED(txt)\n\t#define NAZARA_FUNCTION __func__ \/\/ __func__ has been standardized in C++ 2011\n\n\t#pragma message This compiler is not fully supported\n#endif\n\n#if !defined(NAZARA_COMPILER_SUPPORTS_CPP11) && defined(__cplusplus) && __cplusplus >= 201103L\n\t#define NAZARA_COMPILER_SUPPORTS_CPP11\n#endif\n\n#ifndef NAZARA_COMPILER_SUPPORTS_CPP11\n\t#error Nazara requires a C++11 compliant compiler\n#endif\n\n\/\/ Nazara version macro\n#define NAZARA_VERSION_MAJOR 0\n#define NAZARA_VERSION_MINOR 4\n#define NAZARA_VERSION_PATCH 0\n\n#include <Nazara\/Core\/Config.hpp>\n\n\/\/ Try to identify target platform via defines\n#if defined(_WIN32)\n\t#define NAZARA_PLATFORM_DESKTOP\n\t#define NAZARA_PLATFORM_WINDOWS\n\n\t#define NAZARA_EXPORT __declspec(dllexport)\n\t#define NAZARA_IMPORT __declspec(dllimport)\n\n\t\/\/ Somes defines for windows.h include..\n\t#if defined(NAZARA_BUILD)\n\t\t#ifndef WIN32_LEAN_AND_MEAN\n\t\t\t#define WIN32_LEAN_AND_MEAN\n\t\t#endif\n\n\t\t#ifndef NOMINMAX\n\t\t\t#define NOMINMAX\n\t\t#endif\n\n\t\t#if NAZARA_CORE_WINDOWS_NT6\n\t\t\t#define NAZARA_WINNT 0x0600\n\t\t#else\n\t\t\t#define NAZARA_WINNT 0x0501\n\t\t#endif\n\n\t\t\/\/ Keep the actual define if existing and greater than our requirement\n\t\t#if defined(_WIN32_WINNT)\n\t\t\t#if _WIN32_WINNT < NAZARA_WINNT\n\t\t\t\t#undef _WIN32_WINNT\n\t\t\t\t#define _WIN32_WINNT NAZARA_WINNT\n\t\t\t#endif\n\t\t#else\n\t\t\t#define _WIN32_WINNT NAZARA_WINNT\n\t\t#endif\n\t#endif\n#elif defined(__linux__) || defined(__unix__)\n\t#define NAZARA_PLATFORM_DESKTOP\n\t#define NAZARA_PLATFORM_LINUX\n\t#define NAZARA_PLATFORM_POSIX\n\n\t#define NAZARA_EXPORT __attribute__((visibility (\"default\")))\n\t#define NAZARA_IMPORT __attribute__((visibility (\"default\")))\n#elif defined(__APPLE__)\n\t#include <TargetConditionals.h>\n\t#if TARGET_OS_IPHONE\n\t\t#define NAZARA_PLATFORM_IOS\n\t#else\n\t\t#define NAZARA_PLATFORM_DESKTOP\n\t\t#define NAZARA_PLATFORM_MACOS\n\t#endif\n\t#define NAZARA_PLATFORM_POSIX\n\n\t#define NAZARA_EXPORT __attribute__((visibility (\"default\")))\n\t#define NAZARA_IMPORT __attribute__((visibility (\"default\")))\n#else\n\t#error This operating system is not fully supported by the Nazara Engine\n\n\t#define NAZARA_PLATFORM_UNKNOWN\n#endif\n\n\/\/ Detect 64 bits\n#if !defined(NAZARA_PLATFORM_x64) && (defined(_WIN64) || defined(__amd64__) || defined(__x86_64__) || defined(__ia64__) || defined(__ia64) || \\\n\tdefined(_M_IA64) || defined(__itanium__) || defined(__MINGW64__) || defined(_M_AMD64) || defined (_M_X64))\n\t#define NAZARA_PLATFORM_x64\n#endif\n\n#ifdef NAZARA_UNITY_BUILD\n\t#define NAZARA_ANONYMOUS_NAMESPACE NAZARA_UNITY_ID\n\t#define NAZARA_USE_ANONYMOUS_NAMESPACE using namespace NAZARA_UNITY_ID;\n\t#define NAZARA_ANONYMOUS_NAMESPACE_PREFIX(a) NAZARA_UNITY_ID::a\n#else\n\t#define NAZARA_ANONYMOUS_NAMESPACE\n\t#define NAZARA_USE_ANONYMOUS_NAMESPACE\n\t#define NAZARA_ANONYMOUS_NAMESPACE_PREFIX(a) a\n#endif\n\n\/\/ A bunch of useful macros\n#define NazaraPrefix(a, prefix) prefix ## a\n#define NazaraPrefixMacro(a, prefix) NazaraPrefix(a, prefix)\n#define NazaraSuffix(a, suffix) a ## suffix\n#define NazaraSuffixMacro(a, suffix) NazaraSuffix(a, suffix)\n#define NazaraStringify(s) #s\n#define NazaraStringifyMacro(s) NazaraStringify(s) \/\/ http:\/\/gcc.gnu.org\/onlinedocs\/cpp\/Stringification.html#Stringification\n#define NazaraUnused(a) (void) a\n\n#include <climits>\n#include <cstdint>\n\nstatic_assert(CHAR_BIT == 8, \"CHAR_BIT is expected to be 8\");\n\nstatic_assert(sizeof(int8_t) == 1, \"int8_t is not of the correct size\" );\nstatic_assert(sizeof(int16_t) == 2, \"int16_t is not of the correct size\");\nstatic_assert(sizeof(int32_t) == 4, \"int32_t is not of the correct size\");\nstatic_assert(sizeof(int64_t) == 8, \"int64_t is not of the correct size\");\n\nstatic_assert(sizeof(uint8_t) == 1, \"uint8_t is not of the correct size\" );\nstatic_assert(sizeof(uint16_t) == 2, \"uint16_t is not of the correct size\");\nstatic_assert(sizeof(uint32_t) == 4, \"uint32_t is not of the correct size\");\nstatic_assert(sizeof(uint64_t) == 8, \"uint64_t is not of the correct size\");\n\nnamespace Nz\n{\n\tusing Int8 = int8_t;\n\tusing UInt8 = uint8_t;\n\n\tusing Int16 = int16_t;\n\tusing UInt16 = uint16_t;\n\n\tusing Int32 = int32_t;\n\tusing UInt32 = uint32_t;\n\n\tusing Int64 = int64_t;\n\tusing UInt64 = uint64_t;\n}\n\n#endif \/\/ NAZARA_PREREQUISITES_HPP\n<|endoftext|>"} {"text":"<commit_before>#ifndef Texture_HPP\n#define Texture_HPP\n\n#include <VBE\/config.hpp>\n#include <VBE\/graphics\/OpenGL.hpp>\n#include <VBE\/graphics\/TextureFormat.hpp>\n#include <VBE\/utils\/NonCopyable.hpp>\n\nclass Texture : public NonCopyable {\n\tpublic:\n\t\tenum Type {\n\t\t\tType2D = 0,\n\t\t\tType2DArray,\n\t\t\tType3D,\n\t\t\tTypeCubemap,\n\t\t\tTypeCount\n\t\t};\n\n\t\tvirtual ~Texture();\n\n\t\tGLuint getHandle() const;\n\t\tTextureFormat::Format getFormat() const;\n\t\tType getType() const;\n\n#ifndef VBE_GLES2\n\t\tvoid setComparison(GLenum func, GLenum mode = GL_COMPARE_REF_TO_TEXTURE);\n#endif\n\t\tvoid setFilter(GLenum min, GLenum mag);\n\t\tvoid setWrap(GLenum wrap);\n\t\tstatic unsigned int getMaxSlots();\n\n\t\tfriend void swap(Texture& a, Texture& b);\n\tprotected:\n\t\tTexture(Type type, TextureFormat::Format format = TextureFormat::RGBA);\n\n\t\tstatic void bind(Type type, const Texture* tex, unsigned int slot);\n\t\tstatic GLenum typeToGL(Type t);\n\tprivate:\n\t\tGLuint handle = 0;\n\t\tTextureFormat::Format format = TextureFormat::RGB;\n\t\tType type = Type2D;\n\n\t\tstatic std::vector<std::vector<GLuint>> current;\n\t\tstatic unsigned int currentUnit;\n\t\tstatic int maxSlots;\n};\n\n#endif \/\/ Texture_HPP\n<commit_msg>Update Texture.hpp<commit_after>#ifndef Texture_HPP\n#define Texture_HPP\n\n#include <VBE\/config.hpp>\n#include <VBE\/graphics\/OpenGL.hpp>\n#include <VBE\/graphics\/TextureFormat.hpp>\n#include <VBE\/utils\/NonCopyable.hpp>\n\n\/\/\/\n\/\/\/ \\brief Texture is the base class for all the OpenGL texture types.\n\/\/\/\nclass Texture : public NonCopyable {\n\tpublic:\n\t\t\/\/\/\n\t\t\/\/\/ \\brief The Type enum represents the different OpenGL texture Types, used by the subclasses.\n\t\t\/\/\/\n\t\tenum Type {\n\t\t\tType2D = 0, \/\/< GL_TEXTURE_2D\n\t\t\tType2DArray, \/\/< GL_TEXTURE_2D_ARRAY\n\t\t\tType3D, \/\/< GL_TEXTURE_3D\n\t\t\tTypeCubemap, \/\/< GL_TEXTURE_CUBEMAP\n\t\t\tTypeCount\n\t\t};\n\t\t\n\t\t\/\/\/\n\t\t\/\/\/ \\brief Destructor\n\t\t\/\/\/\n\t\tvirtual ~Texture();\n\n\t\t\/\/\/\n\t\t\/\/\/ \\brief Returns the OpenGL handle of this texture\n\t\t\/\/\/\n\t\tGLuint getHandle() const;\n\t\t\n\t\t\/\/\/\n\t\t\/\/\/ \\brief Returns this texture's pixel format\n\t\t\/\/\/\n\t\tTextureFormat::Format getFormat() const;\n\t\t\n\t\t\/\/\/\n\t\t\/\/\/ \\brief Returns the texture type\n\t\t\/\/\/ \\see Texture::Type\n\t\t\/\/\/\n\t\tType getType() const;\n\n#ifndef VBE_GLES2\n\t\tvoid setComparison(GLenum func, GLenum mode = GL_COMPARE_REF_TO_TEXTURE);\n#endif\n\t\tvoid setFilter(GLenum min, GLenum mag);\n\t\tvoid setWrap(GLenum wrap);\n\t\tstatic unsigned int getMaxSlots();\n\n\t\tfriend void swap(Texture& a, Texture& b);\n\tprotected:\n\t\tTexture(Type type, TextureFormat::Format format = TextureFormat::RGBA);\n\n\t\tstatic void bind(Type type, const Texture* tex, unsigned int slot);\n\t\tstatic GLenum typeToGL(Type t);\n\tprivate:\n\t\tGLuint handle = 0;\n\t\tTextureFormat::Format format = TextureFormat::RGB;\n\t\tType type = Type2D;\n\n\t\tstatic std::vector<std::vector<GLuint>> current;\n\t\tstatic unsigned int currentUnit;\n\t\tstatic int maxSlots;\n};\n\n\/\/\/\n\/\/\/ \\class Window Window.hpp <VBE\/system\/Window.hpp>\n\/\/\/ \\ingroup System\n\/\/\/\n\/\/\/ This base class provides common functionality that is available for all textures, such as setting\n\/\/\/ the wrapping\/filtering\/comparing modes.\n\/\/\/\n\n#endif \/\/ Texture_HPP\n<|endoftext|>"} {"text":"<commit_before>\/****************************************************************************\/\n\/* Copyright 2005-2006, Francis Russell *\/\n\/* *\/\n\/* Licensed under the Apache License, Version 2.0 (the License); *\/\n\/* you may not use this file except in compliance with the License. *\/\n\/* You may obtain a copy of the License at *\/\n\/* *\/\n\/* http:\/\/www.apache.org\/licenses\/LICENSE-2.0 *\/\n\/* *\/\n\/* Unless required by applicable law or agreed to in writing, software *\/\n\/* distributed under the License is distributed on an AS IS BASIS, *\/\n\/* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. *\/\n\/* See the License for the specific language governing permissions and *\/\n\/* limitations under the License. *\/\n\/* *\/\n\/****************************************************************************\/\n\n#ifndef DESOLIN_INTERNAL_REPS_HPP\n#define DESOLIN_INTERNAL_REPS_HPP\n\n#include <cassert>\n#include <desolin\/Desolin_fwd.hpp>\n#include <desolin\/file-access\/mtl_entry.hpp>\n#include <boost\/numeric\/ublas\/matrix_sparse.hpp>\n#include <boost\/numeric\/ublas\/matrix_proxy.hpp>\n\nnamespace desolin\n{\n\nnamespace detail\n{\n\ntemplate<typename T_element>\nclass InternalValue\n{\nprotected:\n bool allocated;\n\npublic:\n InternalValue(const bool isAllocated) : allocated(isAllocated) \n {\n }\n \n inline bool isAllocated() const\n {\n return allocated;\n }\n \n virtual void allocate() = 0;\n\n virtual ~InternalValue() {}\n};\n\ntemplate<typename T_element>\nclass InternalScalar : public InternalValue<T_element>\n{\npublic:\n InternalScalar(const bool allocated) : InternalValue<T_element>(allocated)\n {\n }\n \n virtual void accept(InternalScalarVisitor<T_element>& visitor) = 0;\n\n virtual T_element getElementValue() = 0;\n};\n\ntemplate<typename T_element>\nclass InternalVector : public InternalValue<T_element>\n{\nprotected:\n const int rows;\n\npublic:\n InternalVector(const bool allocated, const int rowCount) : InternalValue<T_element>(allocated), rows(rowCount)\n {\n }\n \n const inline int getRowCount() const\n {\n return rows;\n }\n\n virtual void accept(InternalVectorVisitor<T_element>& visitor) = 0;\n\n virtual T_element getElementValue(const ElementIndex<vector>& index) = 0;\n};\n\ntemplate<typename T_element>\nclass InternalMatrix : public InternalValue<T_element>\n{\nprotected:\n const int rows;\n const int cols;\n \npublic:\n InternalMatrix(const bool allocated, const int rowCount, const int colCount) : InternalValue<T_element>(allocated), rows(rowCount), cols(colCount)\n {\n }\n \n const inline int getRowCount() const\n {\n return rows;\n }\n\n const inline int getColCount() const\n {\n return cols;\n }\n\n virtual void accept(InternalMatrixVisitor<T_element>& visitor) = 0;\n\n virtual T_element getElementValue(const ElementIndex<matrix>& index) = 0;\n};\n\ntemplate<typename T_element>\nclass ConventionalScalar : public InternalScalar<T_element>\n{\nprivate:\n T_element value;\n \npublic:\n ConventionalScalar() : InternalScalar<T_element>(true), value(T_element(0))\n {\n }\n\n ConventionalScalar(const T_element initialValue) : InternalScalar<T_element>(true), value(initialValue)\n {\n } \n\n virtual void allocate()\n {\n this->allocated=true;\n }\n\n virtual void accept(InternalScalarVisitor<T_element>& visitor)\n {\n visitor.visit(*this);\n }\n\n virtual T_element getElementValue()\n {\n assert(this->allocated);\n return value;\n } \n\n T_element* getValue()\n {\n assert(this->allocated);\n return &value;\n }\n};\n\ntemplate<typename T_element>\nclass ConventionalVector : public InternalVector<T_element>\n{\nprivate:\n std::vector<T_element> value;\n \npublic:\n ConventionalVector(const int rowCount) : InternalVector<T_element>(false, rowCount)\n {\n }\n\n ConventionalVector(const int rowCount, const T_element initialValue) : InternalVector<T_element>(true, rowCount), value(rowCount, initialValue)\n {\n }\n\n virtual void allocate()\n {\n if(!this->allocated)\n {\n value.resize(this->rows, T_element(0));\n this->allocated=true;\n }\n }\n\n virtual void accept(InternalVectorVisitor<T_element>& visitor)\n {\n visitor.visit(*this);\n }\n\n T_element* getValue()\n {\n assert(this->allocated);\n return &value[0];\n }\n\n virtual T_element getElementValue(const ElementIndex<vector>& index)\n {\n assert(this->allocated);\n return value[index.getRow()];\n }\n};\n\ntemplate<typename T_element>\nclass ConventionalMatrix : public InternalMatrix<T_element>\n{\nprivate:\n std::vector<T_element> value;\n \npublic:\n ConventionalMatrix(const int rowCount, const int colCount) : InternalMatrix<T_element>(false, rowCount, colCount)\n {\n }\n\n template<typename StreamType>\n ConventionalMatrix(StreamType& stream) : InternalMatrix<T_element>(true, stream.nrows(), stream.ncols()), value(stream.nrows()*stream.ncols())\n {\n while(!stream.eof())\n {\n entry2<double> entry;\n stream >> entry;\n\tvalue[this->getColCount()*entry.row + entry.col] = entry.value;\n }\n }\n \n virtual void allocate()\n {\n if(!this->allocated)\n {\n value.resize(this->rows * this->cols, T_element(0));\n this->allocated=true;\n }\n }\n\n virtual void accept(InternalMatrixVisitor<T_element>& visitor)\n {\n visitor.visit(*this);\n }\n\n T_element* getValue()\n {\n assert(this->allocated);\n return &value[0];\n }\n\n virtual T_element getElementValue(const ElementIndex<matrix>& index) \n {\n assert(this->allocated);\n return value[(this->cols*index.getRow())+index.getCol()];\n }\n};\n\ntemplate<typename T_element>\nclass CRSMatrix : public InternalMatrix<T_element>\n{\nprivate:\n std::vector<int> col_ind;\n std::vector<int> row_ptr;\n std::vector<T_element> val;\n \npublic:\n CRSMatrix(const int rowCount, const int colCount) : InternalMatrix<T_element>(false, rowCount, colCount)\n {\n }\n\n template<typename StreamType>\n CRSMatrix(StreamType& stream) : InternalMatrix<T_element>(true, stream.nrows(), stream.ncols())\n {\n typedef boost::numeric::ublas::mapped_matrix<T_element> TempMatrixType;\n TempMatrixType matrix(this->getRowCount(), this->getColCount());\n\n while(!stream.eof())\n {\n entry2<double> entry;\n stream >> entry;\n matrix(entry.row, entry.col) = entry.value;\n }\n\n for(int row=0; row<this->getRowCount(); ++row)\n {\n row_ptr.push_back(val.size());\n typedef boost::numeric::ublas::matrix_row<TempMatrixType> row_t;\n row_t mr(matrix, row);\n for(typename row_t::const_iterator colIter(mr.begin()); colIter!=mr.end(); ++colIter)\n {\n col_ind.push_back(colIter.index());\n val.push_back(*colIter);\n }\n }\n row_ptr.push_back(val.size());\n }\n \n virtual void allocate()\n {\n if(!this->allocated)\n {\n row_ptr.resize(this->getRowCount()+1, 0);\n this->allocated=true;\n }\n }\n\n virtual void accept(InternalMatrixVisitor<T_element>& visitor)\n {\n visitor.visit(*this);\n }\n\n unsigned nnz() const\n {\n return col_ind.size();\n }\n\n unsigned row_ptr_size() const\n {\n return row_ptr.size();\n }\n\n int* get_col_ind()\n {\n return &col_ind[0];\n }\n\n int* get_row_ptr()\n {\n return &row_ptr[0];\n }\n\n T_element* get_val()\n {\n return &val[0];\n }\n\n virtual T_element getElementValue(const ElementIndex<matrix>& index) \n {\n assert(this->allocated);\n for(int valPtr = row_ptr[index.getRow()]; valPtr < row_ptr[index.getRow()+1]; ++valPtr)\n if (col_ind[valPtr] == index.getCol())\n return val[valPtr];\n\n return T_element();\n }\n};\n\ntemplate<typename T_elementType>\nclass InternalScalarVisitor\n{\npublic:\n virtual void visit(ConventionalScalar<T_elementType>& value) = 0;\n virtual ~InternalScalarVisitor() {}\n};\n\ntemplate<typename T_elementType>\nclass InternalVectorVisitor\n{\npublic:\n virtual void visit(ConventionalVector<T_elementType>& value) = 0;\n virtual ~InternalVectorVisitor() {}\n}; \n\ntemplate<typename T_elementType>\nclass InternalMatrixVisitor\n{\npublic:\n virtual void visit(ConventionalMatrix<T_elementType>& value) = 0;\n virtual void visit(CRSMatrix<T_elementType>& value) = 0;\n virtual ~InternalMatrixVisitor() {}\n};\n\n}\n\n}\n#endif\n<commit_msg>Rewrite CRS loader not to use Boost ublas.<commit_after>\/****************************************************************************\/\n\/* Copyright 2005-2006, Francis Russell *\/\n\/* *\/\n\/* Licensed under the Apache License, Version 2.0 (the License); *\/\n\/* you may not use this file except in compliance with the License. *\/\n\/* You may obtain a copy of the License at *\/\n\/* *\/\n\/* http:\/\/www.apache.org\/licenses\/LICENSE-2.0 *\/\n\/* *\/\n\/* Unless required by applicable law or agreed to in writing, software *\/\n\/* distributed under the License is distributed on an AS IS BASIS, *\/\n\/* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. *\/\n\/* See the License for the specific language governing permissions and *\/\n\/* limitations under the License. *\/\n\/* *\/\n\/****************************************************************************\/\n\n#ifndef DESOLIN_INTERNAL_REPS_HPP\n#define DESOLIN_INTERNAL_REPS_HPP\n\n#include <cassert>\n#include <map>\n#include <vector>\n#include <desolin\/Desolin_fwd.hpp>\n#include <desolin\/file-access\/mtl_entry.hpp>\n\nnamespace desolin\n{\n\nnamespace detail\n{\n\ntemplate<typename T_element>\nclass InternalValue\n{\nprotected:\n bool allocated;\n\npublic:\n InternalValue(const bool isAllocated) : allocated(isAllocated) \n {\n }\n \n inline bool isAllocated() const\n {\n return allocated;\n }\n \n virtual void allocate() = 0;\n\n virtual ~InternalValue() {}\n};\n\ntemplate<typename T_element>\nclass InternalScalar : public InternalValue<T_element>\n{\npublic:\n InternalScalar(const bool allocated) : InternalValue<T_element>(allocated)\n {\n }\n \n virtual void accept(InternalScalarVisitor<T_element>& visitor) = 0;\n\n virtual T_element getElementValue() = 0;\n};\n\ntemplate<typename T_element>\nclass InternalVector : public InternalValue<T_element>\n{\nprotected:\n const int rows;\n\npublic:\n InternalVector(const bool allocated, const int rowCount) : InternalValue<T_element>(allocated), rows(rowCount)\n {\n }\n \n const inline int getRowCount() const\n {\n return rows;\n }\n\n virtual void accept(InternalVectorVisitor<T_element>& visitor) = 0;\n\n virtual T_element getElementValue(const ElementIndex<vector>& index) = 0;\n};\n\ntemplate<typename T_element>\nclass InternalMatrix : public InternalValue<T_element>\n{\nprotected:\n const int rows;\n const int cols;\n \npublic:\n InternalMatrix(const bool allocated, const int rowCount, const int colCount) : InternalValue<T_element>(allocated), rows(rowCount), cols(colCount)\n {\n }\n \n const inline int getRowCount() const\n {\n return rows;\n }\n\n const inline int getColCount() const\n {\n return cols;\n }\n\n virtual void accept(InternalMatrixVisitor<T_element>& visitor) = 0;\n\n virtual T_element getElementValue(const ElementIndex<matrix>& index) = 0;\n};\n\ntemplate<typename T_element>\nclass ConventionalScalar : public InternalScalar<T_element>\n{\nprivate:\n T_element value;\n \npublic:\n ConventionalScalar() : InternalScalar<T_element>(true), value(T_element(0))\n {\n }\n\n ConventionalScalar(const T_element initialValue) : InternalScalar<T_element>(true), value(initialValue)\n {\n } \n\n virtual void allocate()\n {\n this->allocated=true;\n }\n\n virtual void accept(InternalScalarVisitor<T_element>& visitor)\n {\n visitor.visit(*this);\n }\n\n virtual T_element getElementValue()\n {\n assert(this->allocated);\n return value;\n } \n\n T_element* getValue()\n {\n assert(this->allocated);\n return &value;\n }\n};\n\ntemplate<typename T_element>\nclass ConventionalVector : public InternalVector<T_element>\n{\nprivate:\n std::vector<T_element> value;\n \npublic:\n ConventionalVector(const int rowCount) : InternalVector<T_element>(false, rowCount)\n {\n }\n\n ConventionalVector(const int rowCount, const T_element initialValue) : InternalVector<T_element>(true, rowCount), value(rowCount, initialValue)\n {\n }\n\n virtual void allocate()\n {\n if(!this->allocated)\n {\n value.resize(this->rows, T_element(0));\n this->allocated=true;\n }\n }\n\n virtual void accept(InternalVectorVisitor<T_element>& visitor)\n {\n visitor.visit(*this);\n }\n\n T_element* getValue()\n {\n assert(this->allocated);\n return &value[0];\n }\n\n virtual T_element getElementValue(const ElementIndex<vector>& index)\n {\n assert(this->allocated);\n return value[index.getRow()];\n }\n};\n\ntemplate<typename T_element>\nclass ConventionalMatrix : public InternalMatrix<T_element>\n{\nprivate:\n std::vector<T_element> value;\n \npublic:\n ConventionalMatrix(const int rowCount, const int colCount) : InternalMatrix<T_element>(false, rowCount, colCount)\n {\n }\n\n template<typename StreamType>\n ConventionalMatrix(StreamType& stream) : InternalMatrix<T_element>(true, stream.nrows(), stream.ncols()), value(stream.nrows()*stream.ncols())\n {\n while(!stream.eof())\n {\n entry2<double> entry;\n stream >> entry;\n\tvalue[this->getColCount()*entry.row + entry.col] = entry.value;\n }\n }\n \n virtual void allocate()\n {\n if(!this->allocated)\n {\n value.resize(this->rows * this->cols, T_element(0));\n this->allocated=true;\n }\n }\n\n virtual void accept(InternalMatrixVisitor<T_element>& visitor)\n {\n visitor.visit(*this);\n }\n\n T_element* getValue()\n {\n assert(this->allocated);\n return &value[0];\n }\n\n virtual T_element getElementValue(const ElementIndex<matrix>& index) \n {\n assert(this->allocated);\n return value[(this->cols*index.getRow())+index.getCol()];\n }\n};\n\ntemplate<typename T_element>\nclass CRSMatrix : public InternalMatrix<T_element>\n{\nprivate:\n std::vector<int> col_ind;\n std::vector<int> row_ptr;\n std::vector<T_element> val;\n \npublic:\n CRSMatrix(const int rowCount, const int colCount) : InternalMatrix<T_element>(false, rowCount, colCount)\n {\n }\n\n template<typename StreamType>\n CRSMatrix(StreamType& stream) : InternalMatrix<T_element>(true, stream.nrows(), stream.ncols())\n {\n std::vector< std::map<std::size_t, T_element> > matrixData(this->getRowCount());\n\n while(!stream.eof())\n {\n entry2<double> entry;\n stream >> entry;\n assert(entry.row >= 0 && entry.col >=0);\n matrixData[entry.row][entry.col] = entry.value;\n }\n\n for(int row=0; row<this->getRowCount(); ++row)\n {\n row_ptr.push_back(val.size());\n const std::map<std::size_t, T_element>& mr(matrixData[row]);\n for(typename std::map<std::size_t, T_element>::const_iterator colIter(mr.begin()); colIter!=mr.end(); ++colIter)\n {\n col_ind.push_back(colIter->first);\n val.push_back(colIter->second);\n }\n }\n row_ptr.push_back(val.size());\n }\n \n virtual void allocate()\n {\n if(!this->allocated)\n {\n row_ptr.resize(this->getRowCount()+1, 0);\n this->allocated=true;\n }\n }\n\n virtual void accept(InternalMatrixVisitor<T_element>& visitor)\n {\n visitor.visit(*this);\n }\n\n unsigned nnz() const\n {\n return col_ind.size();\n }\n\n unsigned row_ptr_size() const\n {\n return row_ptr.size();\n }\n\n int* get_col_ind()\n {\n return &col_ind[0];\n }\n\n int* get_row_ptr()\n {\n return &row_ptr[0];\n }\n\n T_element* get_val()\n {\n return &val[0];\n }\n\n virtual T_element getElementValue(const ElementIndex<matrix>& index) \n {\n assert(this->allocated);\n for(int valPtr = row_ptr[index.getRow()]; valPtr < row_ptr[index.getRow()+1]; ++valPtr)\n if (col_ind[valPtr] == index.getCol())\n return val[valPtr];\n\n return T_element();\n }\n};\n\ntemplate<typename T_elementType>\nclass InternalScalarVisitor\n{\npublic:\n virtual void visit(ConventionalScalar<T_elementType>& value) = 0;\n virtual ~InternalScalarVisitor() {}\n};\n\ntemplate<typename T_elementType>\nclass InternalVectorVisitor\n{\npublic:\n virtual void visit(ConventionalVector<T_elementType>& value) = 0;\n virtual ~InternalVectorVisitor() {}\n}; \n\ntemplate<typename T_elementType>\nclass InternalMatrixVisitor\n{\npublic:\n virtual void visit(ConventionalMatrix<T_elementType>& value) = 0;\n virtual void visit(CRSMatrix<T_elementType>& value) = 0;\n virtual ~InternalMatrixVisitor() {}\n};\n\n}\n\n}\n#endif\n<|endoftext|>"} {"text":"<commit_before>\/\/=======================================================================\n\/\/ Copyright (c) 2014-2015 Baptiste Wicht\n\/\/ Distributed under the terms of the MIT License.\n\/\/ (See accompanying file LICENSE or copy at\n\/\/ http:\/\/opensource.org\/licenses\/MIT)\n\/\/=======================================================================\n\n#pragma once\n\n#include \"cuda_runtime.h\"\n\nnamespace etl {\n\nnamespace impl {\n\nnamespace cuda {\n\ntemplate <typename T>\nstruct cuda_memory {\n T* memory;\n cuda_memory(T* memory)\n : memory(memory) {}\n T* get() const {\n return memory;\n }\n ~cuda_memory() {\n cudaFree(memory);\n }\n};\n\ntemplate <typename E>\nauto cuda_allocate(const E& expr, bool copy = false) -> cuda_memory<value_t<E>> {\n value_t<E>* memory;\n\n auto cuda_status = cudaMalloc(&memory, etl::size(expr) * sizeof(value_t<E>));\n\n if (cuda_status != cudaSuccess) {\n std::cout << \"cuda: Failed to allocate GPU memory: \" << cudaGetErrorString(cuda_status) << std::endl;\n std::cout << \" Tried to allocate \" << etl::size(expr) * sizeof(value_t<E>) << \"B\" << std::endl;\n exit(EXIT_FAILURE);\n }\n\n if (copy) {\n cudaMemcpy(memory, expr.memory_start(), etl::size(expr) * sizeof(value_t<E>), cudaMemcpyHostToDevice);\n }\n\n return {memory};\n}\n\ntemplate <typename E>\nauto cuda_allocate_copy(const E& expr) -> cuda_memory<value_t<E>> {\n return cuda_allocate(expr, true);\n}\n\ntemplate <typename E>\nauto cuda_allocate(E* ptr, std::size_t n, bool copy = false) -> cuda_memory<E> {\n E* memory;\n\n auto cuda_status = cudaMalloc(&memory, n * sizeof(E));\n\n if (cuda_status != cudaSuccess) {\n std::cout << \"cuda: Failed to allocate GPU memory: \" << cudaGetErrorString(cuda_status) << std::endl;\n std::cout << \" Tried to allocate \" << n * sizeof(E) << \"B\" << std::endl;\n exit(EXIT_FAILURE);\n }\n\n if (copy) {\n cudaMemcpy(memory, ptr, n * sizeof(E), cudaMemcpyHostToDevice);\n }\n\n return {memory};\n}\n\ntemplate <typename E>\nauto cuda_allocate_copy(E* ptr, std::size_t n) -> cuda_memory<E> {\n return cuda_allocate(ptr, n, true);\n}\n\n} \/\/end of namespace cublas\n\n} \/\/end of namespace impl\n\n} \/\/end of namespace etl\n<commit_msg>Improve cuda_memory wrapper<commit_after>\/\/=======================================================================\n\/\/ Copyright (c) 2014-2015 Baptiste Wicht\n\/\/ Distributed under the terms of the MIT License.\n\/\/ (See accompanying file LICENSE or copy at\n\/\/ http:\/\/opensource.org\/licenses\/MIT)\n\/\/=======================================================================\n\n#pragma once\n\n#include \"cuda_runtime.h\"\n\nnamespace etl {\n\nnamespace impl {\n\nnamespace cuda {\n\ntemplate <typename T>\nstruct cuda_memory {\n T* memory;\n\n cuda_memory(T* memory) : memory(memory) {}\n\n T* get() const {\n return memory;\n }\n\n bool is_set() const {\n return memory;\n }\n\n ~cuda_memory() {\n cudaFree(memory);\n }\n};\n\ntemplate <typename E>\nauto cuda_allocate(const E& expr, bool copy = false) -> cuda_memory<value_t<E>> {\n value_t<E>* memory;\n\n auto cuda_status = cudaMalloc(&memory, etl::size(expr) * sizeof(value_t<E>));\n\n if (cuda_status != cudaSuccess) {\n std::cout << \"cuda: Failed to allocate GPU memory: \" << cudaGetErrorString(cuda_status) << std::endl;\n std::cout << \" Tried to allocate \" << etl::size(expr) * sizeof(value_t<E>) << \"B\" << std::endl;\n exit(EXIT_FAILURE);\n }\n\n if (copy) {\n cudaMemcpy(memory, expr.memory_start(), etl::size(expr) * sizeof(value_t<E>), cudaMemcpyHostToDevice);\n }\n\n return {memory};\n}\n\ntemplate <typename E>\nauto cuda_allocate_copy(const E& expr) -> cuda_memory<value_t<E>> {\n return cuda_allocate(expr, true);\n}\n\ntemplate <typename E>\nauto cuda_allocate(E* ptr, std::size_t n, bool copy = false) -> cuda_memory<E> {\n E* memory;\n\n auto cuda_status = cudaMalloc(&memory, n * sizeof(E));\n\n if (cuda_status != cudaSuccess) {\n std::cout << \"cuda: Failed to allocate GPU memory: \" << cudaGetErrorString(cuda_status) << std::endl;\n std::cout << \" Tried to allocate \" << n * sizeof(E) << \"B\" << std::endl;\n exit(EXIT_FAILURE);\n }\n\n if (copy) {\n cudaMemcpy(memory, ptr, n * sizeof(E), cudaMemcpyHostToDevice);\n }\n\n return {memory};\n}\n\ntemplate <typename E>\nauto cuda_allocate_copy(E* ptr, std::size_t n) -> cuda_memory<E> {\n return cuda_allocate(ptr, n, true);\n}\n\n} \/\/end of namespace cublas\n\n} \/\/end of namespace impl\n\n} \/\/end of namespace etl\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\/*!\n * \\brief Define traits to get vectorization information for types when no vector mode is available.\n *\/\ntemplate <typename T>\nstruct no_intrinsic_traits {\n static constexpr bool vectorizable = false; \/\/\/< Boolean flag indicating if the type is vectorizable or not\n static constexpr std::size_t size = 1; \/\/\/< Numbers of elements done at once\n static constexpr std::size_t alignment = alignof(T); \/\/\/< Necessary number of bytes of alignment for this type\n\n using intrinsic_type = T; \/\/\/< The intrinsic type\n};\n\n\/*!\n * \\brief Vectorization support when no vectorization is enabled.\n *\n * This class is purely here to ensure compilation, it will never be called at runtime\n *\/\nstruct no_vec {\n \/*!\n * \\brief The traits for this vectorization implementation\n *\/\n template <typename T>\n using traits = no_intrinsic_traits<T>;\n\n \/*!\n * \\brief The vector type for this vectorization implementation\n *\/\n template <typename T>\n using vec_type = typename traits<T>::intrinsic_type;\n\n \/*!\n * \\brief Unaligned store value to memory\n * \\param memory The target memory\n * \\param value The value to store\n *\/\n template <typename F, typename M>\n static inline void storeu(F* memory, M value) {\n cpp_unused(memory);\n cpp_unused(value);\n }\n\n \/*!\n * \\brief Aligned store value to memory\n * \\param memory The target memory\n * \\param value The value to store\n *\/\n template <typename F, typename M>\n static inline void store(F* memory, M value) {\n cpp_unused(memory);\n cpp_unused(value);\n }\n\n \/*!\n * \\brief Aligned load a vector from memory\n * \\param memory The target memory\n * \\return Vector of values from memory\n *\/\n template <typename F>\n static F load(const F* memory) {\n cpp_unused(memory);\n return F();\n }\n\n \/*!\n * \\brief Unaligned load a vector from memory\n * \\param memory The target memory\n * \\return Vector of values from memory\n *\/\n template <typename F>\n static F loadu(const F* memory) {\n cpp_unused(memory);\n return F();\n }\n\n \/*!\n * \\brief Create a vector containing the given value\n * \\param value The value\n * \\return Vector of value\n *\/\n template <typename F>\n static F set(F value) {\n cpp_unused(value);\n return F();\n }\n\n \/*!\n * \\brief Vector addition or lhs and rhs\n * \\param lhs The left hand side of the operation\n * \\param rhs The right hand side of the operation\n * \\return Vector of the results\n *\/\n template <typename M>\n static M add(M lhs, M rhs) {\n cpp_unused(lhs);\n cpp_unused(rhs);\n return M();\n }\n\n \/*!\n * \\brief Vector subtraction or lhs and rhs\n * \\param lhs The left hand side of the operation\n * \\param rhs The right hand side of the operation\n * \\return Vector of the results\n *\/\n template <typename M>\n static M sub(M lhs, M rhs) {\n cpp_unused(lhs);\n cpp_unused(rhs);\n return M();\n }\n\n \/*!\n * \\brief Vector multiplication of a and b and add the result to c\n * \\param a The left hand side of the multiplication\n * \\param b The right hand side of the multiplication\n * \\param c The right hand side of the addition\n * \\return Vector of the results\n *\/\n template <typename M>\n static M fmadd(M a, M b, M c) {\n cpp_unused(a);\n cpp_unused(b);\n cpp_unused(c);\n return M();\n }\n\n \/*!\n * \\brief Vector multiplication or lhs and rhs\n * \\param lhs The left hand side of the operation\n * \\param rhs The right hand side of the operation\n * \\return Vector of the results\n *\/\n template <typename M>\n static M mul(M lhs, M rhs) {\n cpp_unused(lhs);\n cpp_unused(rhs);\n return M();\n }\n\n \/*!\n * \\brief Vector division or lhs and rhs\n * \\param lhs The left hand side of the operation\n * \\param rhs The right hand side of the operation\n * \\return Vector of the results\n *\/\n template <typename M>\n static M div(M lhs, M rhs) {\n cpp_unused(lhs);\n cpp_unused(rhs);\n return M();\n }\n\n \/*!\n * \\brief Vector maximum or lhs and rhs\n * \\param lhs The left hand side of the operation\n * \\param rhs The right hand side of the operation\n * \\return Vector of the results\n *\/\n template <typename M>\n static M max(M lhs, M rhs) {\n cpp_unused(lhs);\n cpp_unused(rhs);\n return M();\n }\n\n \/*!\n * \\brief Vector minimum or lhs and rhs\n * \\param lhs The left hand side of the operation\n * \\param rhs The right hand side of the operation\n * \\return Vector of the results\n *\/\n template <typename M>\n static M min(M lhs, M rhs) {\n cpp_unused(lhs);\n cpp_unused(rhs);\n return M();\n }\n\n \/*!\n * \\brief Vector square root\n * \\param value The input values\n * \\return The square root of the input values\n *\/\n template <typename M>\n static M sqrt(M value) {\n cpp_unused(value);\n return M();\n }\n\n \/*!\n * \\brief Compute the negative value of the input\n * \\param value The input values\n * \\return The negative values of the input values\n *\/\n template <typename M>\n static M minus(M value) {\n cpp_unused(value);\n return M();\n }\n\n \/*!\n * \\brief Perform an horizontal sum of the given vector\n *\/\n template <typename T = float, typename M>\n static T hadd(M value) {\n cpp_unused(value);\n return T();\n }\n\n \/*!\n * \\brief Return a vector type filled with zeroes of the correct type\n *\/\n template<typename T>\n static T zero(){\n return T();\n }\n};\n\n} \/\/end of namespace etl\n<commit_msg>Fix no vectorization mode<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\/*!\n * \\brief Define traits to get vectorization information for types when no vector mode is available.\n *\/\ntemplate <typename T>\nstruct no_intrinsic_traits {\n static constexpr bool vectorizable = false; \/\/\/< Boolean flag indicating if the type is vectorizable or not\n static constexpr std::size_t size = 1; \/\/\/< Numbers of elements done at once\n static constexpr std::size_t alignment = alignof(T); \/\/\/< Necessary number of bytes of alignment for this type\n\n using intrinsic_type = T; \/\/\/< The intrinsic type\n};\n\n\/*!\n * \\brief Vectorization support when no vectorization is enabled.\n *\n * This class is purely here to ensure compilation, it will never be called at runtime\n *\/\nstruct no_vec {\n \/*!\n * \\brief The traits for this vectorization implementation\n *\/\n template <typename T>\n using traits = no_intrinsic_traits<T>;\n\n \/*!\n * \\brief The vector type for this vectorization implementation\n *\/\n template <typename T>\n using vec_type = typename traits<T>::intrinsic_type;\n\n \/*!\n * \\brief Unaligned store value to memory\n * \\param memory The target memory\n * \\param value The value to store\n *\/\n template <typename F, typename M>\n static inline void storeu(F* memory, M value) {\n cpp_unused(memory);\n cpp_unused(value);\n }\n\n \/*!\n * \\brief Aligned store value to memory\n * \\param memory The target memory\n * \\param value The value to store\n *\/\n template <typename F, typename M>\n static inline void store(F* memory, M value) {\n cpp_unused(memory);\n cpp_unused(value);\n }\n\n \/*!\n * \\brief Aligned load a vector from memory\n * \\param memory The target memory\n * \\return Vector of values from memory\n *\/\n template <typename F>\n static F load(const F* memory) {\n cpp_unused(memory);\n return F();\n }\n\n \/*!\n * \\brief Unaligned load a vector from memory\n * \\param memory The target memory\n * \\return Vector of values from memory\n *\/\n template <typename F>\n static F loadu(const F* memory) {\n cpp_unused(memory);\n return F();\n }\n\n \/*!\n * \\brief Create a vector containing the given value\n * \\param value The value\n * \\return Vector of value\n *\/\n template <typename F>\n static F set(F value) {\n cpp_unused(value);\n return F();\n }\n\n \/*!\n * \\brief Vector addition or lhs and rhs\n * \\param lhs The left hand side of the operation\n * \\param rhs The right hand side of the operation\n * \\return Vector of the results\n *\/\n template <typename M>\n static M add(M lhs, M rhs) {\n cpp_unused(lhs);\n cpp_unused(rhs);\n return M();\n }\n\n \/*!\n * \\brief Vector subtraction or lhs and rhs\n * \\param lhs The left hand side of the operation\n * \\param rhs The right hand side of the operation\n * \\return Vector of the results\n *\/\n template <typename M>\n static M sub(M lhs, M rhs) {\n cpp_unused(lhs);\n cpp_unused(rhs);\n return M();\n }\n\n \/*!\n * \\brief Vector multiplication of a and b and add the result to c\n * \\param a The left hand side of the multiplication\n * \\param b The right hand side of the multiplication\n * \\param c The right hand side of the addition\n * \\return Vector of the results\n *\/\n template <typename M>\n static M fmadd(M a, M b, M c) {\n cpp_unused(a);\n cpp_unused(b);\n cpp_unused(c);\n return M();\n }\n\n \/*!\n * \\brief Vector multiplication or lhs and rhs\n * \\param lhs The left hand side of the operation\n * \\param rhs The right hand side of the operation\n * \\return Vector of the results\n *\/\n template <typename M>\n static M mul(M lhs, M rhs) {\n cpp_unused(lhs);\n cpp_unused(rhs);\n return M();\n }\n\n \/*!\n * \\brief Vector division or lhs and rhs\n * \\param lhs The left hand side of the operation\n * \\param rhs The right hand side of the operation\n * \\return Vector of the results\n *\/\n template <typename M>\n static M div(M lhs, M rhs) {\n cpp_unused(lhs);\n cpp_unused(rhs);\n return M();\n }\n\n \/*!\n * \\brief Vector maximum or lhs and rhs\n * \\param lhs The left hand side of the operation\n * \\param rhs The right hand side of the operation\n * \\return Vector of the results\n *\/\n template <typename M>\n static M max(M lhs, M rhs) {\n cpp_unused(lhs);\n cpp_unused(rhs);\n return M();\n }\n\n \/*!\n * \\brief Vector minimum or lhs and rhs\n * \\param lhs The left hand side of the operation\n * \\param rhs The right hand side of the operation\n * \\return Vector of the results\n *\/\n template <typename M>\n static M min(M lhs, M rhs) {\n cpp_unused(lhs);\n cpp_unused(rhs);\n return M();\n }\n\n \/*!\n * \\brief Vector square root\n * \\param value The input values\n * \\return The square root of the input values\n *\/\n template <typename M>\n static M sqrt(M value) {\n cpp_unused(value);\n return M();\n }\n\n \/*!\n * \\brief Compute the negative value of the input\n * \\param value The input values\n * \\return The negative values of the input values\n *\/\n template <typename M>\n static M minus(M value) {\n cpp_unused(value);\n return M();\n }\n\n \/*!\n * \\brief Perform an horizontal sum of the given vector\n *\/\n template <typename M>\n static M hadd(M value) {\n cpp_unused(value);\n return M();\n }\n\n \/*!\n * \\brief Return a vector type filled with zeroes of the correct type\n *\/\n template<typename T>\n static T zero(){\n return T();\n }\n};\n\n} \/\/end of namespace etl\n<|endoftext|>"} {"text":"<commit_before>\/\/======================================================================\n\/\/-----------------------------------------------------------------------\n\/**\n * @file iutest_file.hpp\n * @brief iris unit test ファイルクラス ファイル\n *\n * @author t.shirayanagi\n * @par copyright\n * Copyright (C) 2011-2018, Takazumi Shirayanagi\\n\n * This software is released under the new BSD License,\n * see LICENSE\n*\/\n\/\/-----------------------------------------------------------------------\n\/\/======================================================================\n#ifndef INCG_IRIS_IUTEST_FILE_HPP_77D2C2B9_F504_4BB5_BA56_D97A2EB37DC6_\n#define INCG_IRIS_IUTEST_FILE_HPP_77D2C2B9_F504_4BB5_BA56_D97A2EB37DC6_\n\n\/\/======================================================================\n\/\/ include\n#include \"iutest_internal_defs.hpp\"\n#include \"iutest_stream.hpp\"\n\nnamespace iutest\n{\n\n\/\/======================================================================\n\/\/ class\n\/**\n * @brief ファイルクラスインターフェイス\n*\/\nclass IFile : public detail::IOutStream, public detail::IInStream\n{\npublic:\n \/\/! ファイルオープンモードフラグ\n enum OpenFlag\n {\n OpenRead = 0x00000001, \/\/!< 読み込み\n OpenWrite = 0x00000002, \/\/!< 書き込み\n OpenAppend = 0x00000003 \/\/!< 追記\n };\npublic:\n virtual ~IFile() {}\npublic:\n \/\/! 開く\n virtual bool Open(const char* filename, int mode) = 0;\n \/\/! 閉じる\n virtual void Close() = 0;\n};\n\nnamespace detail\n{\n\n\/**\n * @brief ファイル処理クラスインターフェイス\n*\/\nclass IFileSystem\n{\npublic:\n IFileSystem()\n {\n SetInstance(this);\n }\n virtual ~IFileSystem()\n {\n SetInstance(NULL);\n }\n\npublic:\n virtual void Initialize() {}\n\npublic:\n static IFileSystem* GetInstance() { return GetInstanceVariable().pInstance; }\n\npublic:\n static IFile* New()\n {\n IFileSystem* fs = GetInstance();\n if( fs == NULL )\n {\n return NULL;\n }\n IFile* p = fs->Create();\n return p;\n }\n static void Free(IFile* ptr)\n {\n IFileSystem* fs = GetInstance();\n if( fs == NULL )\n {\n return;\n }\n fs->Delete(ptr);\n }\n\n static bool ReadAll(const char* filename, ::std::string& dst)\n {\n IFile* fp = detail::IFileSystem::New();\n if(fp == NULL)\n {\n return false;\n }\n\n if(!fp->Open(filename, IFile::OpenRead))\n {\n detail::IFileSystem::Free(fp);\n return false;\n }\n\n dst = fp->ReadAll();\n detail::IFileSystem::Free(fp);\n return true;\n }\n\nprivate:\n virtual IFile* Create() = 0;\n virtual void Delete(IFile*) = 0;\n\nprivate:\n struct InstanceVariable\n {\n IFileSystem* pInstance;\n };\n\n static InstanceVariable& GetInstanceVariable() { static InstanceVariable v; return v; }\n static void SetInstance(IFileSystem* pFileSystem) { GetInstanceVariable().pInstance = pFileSystem; }\n};\n\n} \/\/ end of namespace detail\n} \/\/ end of namespace iutest\n\nnamespace iutest\n{\n\n\/**\n * @brief ファイル処理クラスインターフェイス\n*\/\ntemplate<typename FILE>\nclass FileSystem : public detail::IFileSystem\n{\nprivate:\n virtual IFile* Create() IUTEST_CXX_OVERRIDE { return new FILE; }\n virtual void Delete(IFile* ptr) IUTEST_CXX_OVERRIDE { detail::Delete<FILE>(static_cast<FILE*>(ptr)); }\n};\n\n\n#if IUTEST_HAS_FOPEN\n\n\/**\n * @brief 標準ファイルクラス\n*\/\nclass StdioFile : public IFile\n{\nprotected:\n FILE* m_fp;\npublic:\n StdioFile() IUTEST_CXX_NOEXCEPT_SPEC : m_fp(NULL) {}\n virtual ~StdioFile() { Close(); }\npublic:\n \/**\n * @brief 開く\n * @param [in] filename = ファイルパス\n * @param [in] mode = モード\n * @return 成否\n *\/\n virtual bool Open(const char* filename, int mode) IUTEST_CXX_OVERRIDE\n {\n Close();\nIUTEST_PRAGMA_CRT_SECURE_WARN_DISABLE_BEGIN()\n switch( mode )\n {\n case IFile::OpenRead:\n m_fp = fopen(filename, \"rb\");\n break;\n case IFile::OpenWrite:\n m_fp = fopen(filename, \"wb\");\n break;\n case IFile::OpenAppend:\n m_fp = fopen(filename, \"ab\");\n break;\n default:\n break;\n }\nIUTEST_PRAGMA_CRT_SECURE_WARN_DISABLE_END()\n return m_fp != NULL;\n }\n \/**\n * @brief 閉じる\n *\/\n virtual void Close() IUTEST_CXX_OVERRIDE\n {\n if( m_fp != NULL )\n {\n fclose(m_fp);\n m_fp = NULL;\n }\n }\n \/**\n * @brief 書き込み\n * @param [in] buf = 書き込みバッファ\n * @param [in] size = バッファサイズ\n * @param [in] cnt = 書き込み回数\n *\/\n virtual bool Write(const void* buf, size_t size, size_t cnt) IUTEST_CXX_OVERRIDE\n {\n if( fwrite(buf, size, cnt, m_fp) < cnt )\n {\n return false;\n }\n return true;\n }\n\n \/**\n * @brief 読み込み\n * @param [in] buf = 読み込みバッファ\n * @param [in] size = 読み込みデータサイズ\n * @param [in] cnt = 読み込み回数\n *\/\n virtual bool Read(void* buf, size_t size, size_t cnt) IUTEST_CXX_OVERRIDE\n {\n if( fread(buf, size, cnt, m_fp) < cnt )\n {\n return false;\n }\n return true;\n }\n\n \/\/! サイズ取得\n virtual size_t GetSize() IUTEST_CXX_OVERRIDE\n {\n#if IUTEST_HAS_FILE_STAT\n return GetSize(m_fp);\n#else\n return GetSizeBySeekSet(m_fp);\n#endif\n }\n\npublic:\n static size_t GetSize(FILE* fp)\n {\n if( fp == NULL )\n {\n return 0;\n }\n#if IUTEST_HAS_FILE_STAT\n internal::posix::StatStruct st;\n if (internal::posix::Stat(fp, &st) != 0)\n {\n return 0;\n }\n return st.st_size;\n#else\n IUTEST_UNUSED_VAR(fp);\n return static_cast<size_t>(-1);\n#endif\n }\n static size_t GetSizeBySeekSet(FILE* fp)\n {\n if( fp == NULL )\n {\n return 0;\n }\n const long pre = ftell(fp);\n if( pre != -1 )\n {\n if( fseek(fp, 0, SEEK_END) == 0 )\n {\n const size_t size = static_cast<size_t>(ftell(fp));\n IUTEST_UNUSED_RETURN(fseek(fp, pre, SEEK_SET));\n return size;\n }\n }\n return static_cast<size_t>(-1);\n }\n};\n\nclass StdErrorFile : public StdioFile\n{\npublic:\n StdErrorFile() IUTEST_CXX_NOEXCEPT_SPEC {}\n virtual ~StdErrorFile() { Close(); }\npublic:\n \/**\n * @brief 開く\n * @param [in] filename = ファイルパス\n * @param [in] mode = モード\n * @return 成否\n *\/\n virtual bool Open(const char* , int ) IUTEST_CXX_OVERRIDE\n {\n m_fp = stderr;\n return true;\n }\n \/**\n * @brief 閉じる\n *\/\n virtual void Close() IUTEST_CXX_OVERRIDE\n {\n m_fp = NULL;\n }\n};\n\n#endif\n\n#if IUTEST_HAS_STRINGSTREAM\n\n\/**\n * @brief 文字列バッファ書き込み IFile インターフェースクラス\n*\/\nclass StringStreamFile : public IFile\n{\npublic:\n virtual ~StringStreamFile() { Close(); }\npublic:\n \/**\n * @brief 開く\n * @return 成否\n *\/\n virtual bool Open(const char* , int ) IUTEST_CXX_OVERRIDE\n {\n ss.clear();\n return true;\n }\n\n \/**\n * @brief 閉じる\n *\/\n virtual void Close() IUTEST_CXX_OVERRIDE\n {\n }\n\n \/**\n * @brief 書き込み\n * @param [in] buf = 書き込みバッファ\n * @param [in] size = バッファサイズ\n * @param [in] cnt = 書き込み回数\n *\/\n virtual bool Write(const void* buf, size_t size, size_t cnt) IUTEST_CXX_OVERRIDE\n {\n for( size_t i=0; i < cnt; ++i )\n {\n ss.write(static_cast<const char*>(buf), size);\n }\n return true;\n }\n\n \/**\n * @brief 読み込み\n * @param [in] buf = 読み込みバッファ\n * @param [in] size = 読み込みデータサイズ\n * @param [in] cnt = 読み込み回数\n *\/\n virtual bool Read(void* buf, size_t size, size_t cnt) IUTEST_CXX_OVERRIDE\n {\n char* p = static_cast<char*>(buf);\n for( size_t i = 0; i < cnt; ++i )\n {\n ss.read(p, size);\n p += size;\n }\n return true;\n }\n\n \/\/! サイズ取得\n virtual size_t GetSize() IUTEST_CXX_OVERRIDE\n {\n ::std::stringstream::pos_type pre = ss.tellg();\n ss.seekg(0, ::std::ios::end);\n ::std::stringstream::pos_type size = ss.tellg();\n ss.seekg(pre, ::std::ios::beg);\n return static_cast<size_t>(size);\n }\n\n \/\/! 全読み込み\n virtual ::std::string ReadAll() IUTEST_CXX_OVERRIDE\n {\n return ss.str();\n }\nprotected:\n ::std::stringstream ss;\n};\n\n#endif\n\nnamespace detail\n{\n\n\/**\n * @brief 何もしない IFile インターフェースクラス\n*\/\nclass NoEffectFile : public IFile\n{\npublic:\n virtual bool Open(const char*, int) IUTEST_CXX_OVERRIDE { return true; }\n virtual void Close() IUTEST_CXX_OVERRIDE {}\n virtual bool Write(const void*, size_t, size_t) IUTEST_CXX_OVERRIDE { return true; }\n virtual bool Read(void*, size_t, size_t) IUTEST_CXX_OVERRIDE { return true; }\n virtual size_t GetSize() IUTEST_CXX_OVERRIDE { return 0; }\n};\n\n} \/\/ end of namespace detail\n} \/\/ end of namespace iutest\n\n#endif \/\/ INCG_IRIS_IUTEST_FILE_HPP_77D2C2B9_F504_4BB5_BA56_D97A2EB37DC6_\n<commit_msg>fix file get size #128<commit_after>\/\/======================================================================\n\/\/-----------------------------------------------------------------------\n\/**\n * @file iutest_file.hpp\n * @brief iris unit test ファイルクラス ファイル\n *\n * @author t.shirayanagi\n * @par copyright\n * Copyright (C) 2011-2018, Takazumi Shirayanagi\\n\n * This software is released under the new BSD License,\n * see LICENSE\n*\/\n\/\/-----------------------------------------------------------------------\n\/\/======================================================================\n#ifndef INCG_IRIS_IUTEST_FILE_HPP_77D2C2B9_F504_4BB5_BA56_D97A2EB37DC6_\n#define INCG_IRIS_IUTEST_FILE_HPP_77D2C2B9_F504_4BB5_BA56_D97A2EB37DC6_\n\n\/\/======================================================================\n\/\/ include\n#include \"iutest_internal_defs.hpp\"\n#include \"iutest_stream.hpp\"\n\nnamespace iutest\n{\n\n\/\/======================================================================\n\/\/ class\n\/**\n * @brief ファイルクラスインターフェイス\n*\/\nclass IFile : public detail::IOutStream, public detail::IInStream\n{\npublic:\n \/\/! ファイルオープンモードフラグ\n enum OpenFlag\n {\n OpenRead = 0x00000001, \/\/!< 読み込み\n OpenWrite = 0x00000002, \/\/!< 書き込み\n OpenAppend = 0x00000003 \/\/!< 追記\n };\npublic:\n virtual ~IFile() {}\npublic:\n \/\/! 開く\n virtual bool Open(const char* filename, int mode) = 0;\n \/\/! 閉じる\n virtual void Close() = 0;\n};\n\nnamespace detail\n{\n\n\/**\n * @brief ファイル処理クラスインターフェイス\n*\/\nclass IFileSystem\n{\npublic:\n IFileSystem()\n {\n SetInstance(this);\n }\n virtual ~IFileSystem()\n {\n SetInstance(NULL);\n }\n\npublic:\n virtual void Initialize() {}\n\npublic:\n static IFileSystem* GetInstance() { return GetInstanceVariable().pInstance; }\n\npublic:\n static IFile* New()\n {\n IFileSystem* fs = GetInstance();\n if( fs == NULL )\n {\n return NULL;\n }\n IFile* p = fs->Create();\n return p;\n }\n static void Free(IFile* ptr)\n {\n IFileSystem* fs = GetInstance();\n if( fs == NULL )\n {\n return;\n }\n fs->Delete(ptr);\n }\n\n static bool ReadAll(const char* filename, ::std::string& dst)\n {\n IFile* fp = detail::IFileSystem::New();\n if(fp == NULL)\n {\n return false;\n }\n\n if(!fp->Open(filename, IFile::OpenRead))\n {\n detail::IFileSystem::Free(fp);\n return false;\n }\n\n dst = fp->ReadAll();\n detail::IFileSystem::Free(fp);\n return true;\n }\n\nprivate:\n virtual IFile* Create() = 0;\n virtual void Delete(IFile*) = 0;\n\nprivate:\n struct InstanceVariable\n {\n IFileSystem* pInstance;\n };\n\n static InstanceVariable& GetInstanceVariable() { static InstanceVariable v; return v; }\n static void SetInstance(IFileSystem* pFileSystem) { GetInstanceVariable().pInstance = pFileSystem; }\n};\n\n} \/\/ end of namespace detail\n} \/\/ end of namespace iutest\n\nnamespace iutest\n{\n\n\/**\n * @brief ファイル処理クラスインターフェイス\n*\/\ntemplate<typename FILE>\nclass FileSystem : public detail::IFileSystem\n{\nprivate:\n virtual IFile* Create() IUTEST_CXX_OVERRIDE { return new FILE; }\n virtual void Delete(IFile* ptr) IUTEST_CXX_OVERRIDE { detail::Delete<FILE>(static_cast<FILE*>(ptr)); }\n};\n\n\n#if IUTEST_HAS_FOPEN\n\n\/**\n * @brief 標準ファイルクラス\n*\/\nclass StdioFile : public IFile\n{\nprotected:\n FILE* m_fp;\npublic:\n StdioFile() IUTEST_CXX_NOEXCEPT_SPEC : m_fp(NULL) {}\n virtual ~StdioFile() { Close(); }\npublic:\n \/**\n * @brief 開く\n * @param [in] filename = ファイルパス\n * @param [in] mode = モード\n * @return 成否\n *\/\n virtual bool Open(const char* filename, int mode) IUTEST_CXX_OVERRIDE\n {\n Close();\nIUTEST_PRAGMA_CRT_SECURE_WARN_DISABLE_BEGIN()\n switch( mode )\n {\n case IFile::OpenRead:\n m_fp = fopen(filename, \"rb\");\n break;\n case IFile::OpenWrite:\n m_fp = fopen(filename, \"wb\");\n break;\n case IFile::OpenAppend:\n m_fp = fopen(filename, \"ab\");\n break;\n default:\n break;\n }\nIUTEST_PRAGMA_CRT_SECURE_WARN_DISABLE_END()\n return m_fp != NULL;\n }\n \/**\n * @brief 閉じる\n *\/\n virtual void Close() IUTEST_CXX_OVERRIDE\n {\n if( m_fp != NULL )\n {\n fclose(m_fp);\n m_fp = NULL;\n }\n }\n \/**\n * @brief 書き込み\n * @param [in] buf = 書き込みバッファ\n * @param [in] size = バッファサイズ\n * @param [in] cnt = 書き込み回数\n *\/\n virtual bool Write(const void* buf, size_t size, size_t cnt) IUTEST_CXX_OVERRIDE\n {\n if( fwrite(buf, size, cnt, m_fp) < cnt )\n {\n return false;\n }\n return true;\n }\n\n \/**\n * @brief 読み込み\n * @param [in] buf = 読み込みバッファ\n * @param [in] size = 読み込みデータサイズ\n * @param [in] cnt = 読み込み回数\n *\/\n virtual bool Read(void* buf, size_t size, size_t cnt) IUTEST_CXX_OVERRIDE\n {\n if( fread(buf, size, cnt, m_fp) < cnt )\n {\n return false;\n }\n return true;\n }\n\n \/\/! サイズ取得\n virtual size_t GetSize() IUTEST_CXX_OVERRIDE\n {\n#if IUTEST_HAS_FILE_STAT\n return GetSize(m_fp);\n#else\n return GetSizeBySeekSet(m_fp);\n#endif\n }\n\npublic:\n static size_t GetSize(FILE* fp)\n {\n if( fp == NULL )\n {\n return 0;\n }\n#if IUTEST_HAS_FILE_STAT\n internal::posix::StatStruct st;\n if (internal::posix::Stat(fp, &st) != 0)\n {\n return GetSizeBySeekSet(fp);\n }\n return st.st_size;\n#else\n IUTEST_UNUSED_VAR(fp);\n return 0;\n#endif\n }\n static size_t GetSizeBySeekSet(FILE* fp)\n {\n if( fp == NULL )\n {\n return 0;\n }\n const long pre = ftell(fp);\n if( (pre != -1) && (fseek(fp, 0, SEEK_END) == 0) )\n {\n const size_t size = static_cast<size_t>(ftell(fp));\n IUTEST_UNUSED_RETURN(fseek(fp, pre, SEEK_SET));\n return size;\n }\n return 0;\n }\n};\n\nclass StdErrorFile : public StdioFile\n{\npublic:\n StdErrorFile() IUTEST_CXX_NOEXCEPT_SPEC {}\n virtual ~StdErrorFile() { Close(); }\npublic:\n \/**\n * @brief 開く\n * @param [in] filename = ファイルパス\n * @param [in] mode = モード\n * @return 成否\n *\/\n virtual bool Open(const char* , int ) IUTEST_CXX_OVERRIDE\n {\n m_fp = stderr;\n return true;\n }\n \/**\n * @brief 閉じる\n *\/\n virtual void Close() IUTEST_CXX_OVERRIDE\n {\n m_fp = NULL;\n }\n};\n\n#endif\n\n#if IUTEST_HAS_STRINGSTREAM\n\n\/**\n * @brief 文字列バッファ書き込み IFile インターフェースクラス\n*\/\nclass StringStreamFile : public IFile\n{\npublic:\n virtual ~StringStreamFile() { Close(); }\npublic:\n \/**\n * @brief 開く\n * @return 成否\n *\/\n virtual bool Open(const char* , int ) IUTEST_CXX_OVERRIDE\n {\n ss.clear();\n return true;\n }\n\n \/**\n * @brief 閉じる\n *\/\n virtual void Close() IUTEST_CXX_OVERRIDE\n {\n }\n\n \/**\n * @brief 書き込み\n * @param [in] buf = 書き込みバッファ\n * @param [in] size = バッファサイズ\n * @param [in] cnt = 書き込み回数\n *\/\n virtual bool Write(const void* buf, size_t size, size_t cnt) IUTEST_CXX_OVERRIDE\n {\n for( size_t i=0; i < cnt; ++i )\n {\n ss.write(static_cast<const char*>(buf), size);\n }\n return true;\n }\n\n \/**\n * @brief 読み込み\n * @param [in] buf = 読み込みバッファ\n * @param [in] size = 読み込みデータサイズ\n * @param [in] cnt = 読み込み回数\n *\/\n virtual bool Read(void* buf, size_t size, size_t cnt) IUTEST_CXX_OVERRIDE\n {\n char* p = static_cast<char*>(buf);\n for( size_t i = 0; i < cnt; ++i )\n {\n ss.read(p, size);\n p += size;\n }\n return true;\n }\n\n \/\/! サイズ取得\n virtual size_t GetSize() IUTEST_CXX_OVERRIDE\n {\n ::std::stringstream::pos_type pre = ss.tellg();\n ss.seekg(0, ::std::ios::end);\n ::std::stringstream::pos_type size = ss.tellg();\n ss.seekg(pre, ::std::ios::beg);\n return static_cast<size_t>(size);\n }\n\n \/\/! 全読み込み\n virtual ::std::string ReadAll() IUTEST_CXX_OVERRIDE\n {\n return ss.str();\n }\nprotected:\n ::std::stringstream ss;\n};\n\n#endif\n\nnamespace detail\n{\n\n\/**\n * @brief 何もしない IFile インターフェースクラス\n*\/\nclass NoEffectFile : public IFile\n{\npublic:\n virtual bool Open(const char*, int) IUTEST_CXX_OVERRIDE { return true; }\n virtual void Close() IUTEST_CXX_OVERRIDE {}\n virtual bool Write(const void*, size_t, size_t) IUTEST_CXX_OVERRIDE { return true; }\n virtual bool Read(void*, size_t, size_t) IUTEST_CXX_OVERRIDE { return true; }\n virtual size_t GetSize() IUTEST_CXX_OVERRIDE { return 0; }\n};\n\n} \/\/ end of namespace detail\n} \/\/ end of namespace iutest\n\n#endif \/\/ INCG_IRIS_IUTEST_FILE_HPP_77D2C2B9_F504_4BB5_BA56_D97A2EB37DC6_\n<|endoftext|>"} {"text":"<commit_before>\/*\n\nCopyright (c) 2007, Un Shyam\nAll rights reserved.\n\nRedistribution and use in source and binary forms, with or without\nmodification, are permitted provided that the following conditions\nare met:\n\n * Redistributions of source code must retain the above copyright\n notice, this list of conditions and the following disclaimer.\n * Redistributions in binary form must reproduce the above copyright\n notice, this list of conditions and the following disclaimer in\n the documentation and\/or other materials provided with the distribution.\n * Neither the name of the author nor the names of its\n contributors may be used to endorse or promote products derived\n from this software without specific prior written permission.\n\nTHIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS \"AS IS\"\nAND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE\nIMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE\nARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE\nLIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR\nCONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF\nSUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS\nINTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN\nCONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)\nARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE\nPOSSIBILITY OF SUCH DAMAGE.\n\n*\/\n\n#ifndef TORRENT_DISABLE_ENCRYPTION\n\n#ifndef TORRENT_PE_CRYPTO_HPP_INCLUDED\n#define TORRENT_PE_CRYPTO_HPP_INCLUDED\n\n#include <openssl\/dh.h>\n#include <openssl\/engine.h>\n#include <openssl\/rc4.h>\n\n#include \"libtorrent\/peer_id.hpp\" \/\/ For sha1_hash\n#include \"libtorrent\/assert.hpp\"\n\nnamespace libtorrent\n{\n\tclass dh_key_exchange\n\t{\n\tpublic:\n\t\tdh_key_exchange();\n\t\t~dh_key_exchange();\n\t\tbool good() const { return m_dh; }\n\n\t\t\/\/ Get local public key, always 96 bytes\n\t\tchar const* get_local_key() const;\n\n\t\t\/\/ read remote_pubkey, generate and store shared secret in\n\t\t\/\/ m_dh_secret.\n\t\tint compute_secret(const char* remote_pubkey);\n\n\t\tchar const* get_secret() const { return m_dh_secret; }\n\n\t\tsha1_hash const& get_hash_xor_mask() const { return m_xor_mask; }\n\t\t\n\tprivate:\n\t\tint get_local_key_size() const\n\t\t{\n\t\t\tTORRENT_ASSERT(m_dh);\n\t\t\treturn BN_num_bytes(m_dh->pub_key);\n\t\t}\n\n\t\tDH* m_dh;\n\n\t\tchar m_dh_local_key[96];\n\t\tchar m_dh_secret[96];\n\t\tsha1_hash m_xor_mask;\n\t};\n\t\n\tclass RC4_handler \/\/ Non copyable\n\t{\n\tpublic:\n\t\t\/\/ Input longkeys must be 20 bytes\n\t\tRC4_handler(const sha1_hash& rc4_local_longkey,\n\t\t\t\t\t const sha1_hash& rc4_remote_longkey)\n\t\t\t\n\t\t{\n\t\t\tRC4_set_key(&m_local_key, 20,\n\t\t\t\t\t\t reinterpret_cast<unsigned char const*>(rc4_local_longkey.begin()));\n\t\t\tRC4_set_key(&m_remote_key, 20,\n\t\t\t\t\t\t reinterpret_cast<unsigned char const*>(rc4_remote_longkey.begin()));\n\n\t\t\t\/\/ Discard first 1024 bytes\n\t\t\tchar buf[1024];\n\t\t\tencrypt(buf, 1024);\n\t\t\tdecrypt(buf, 1024);\n\t\t};\n\t\t\n\t\t~RC4_handler() {};\n\n\t\tvoid encrypt(char* pos, int len)\n\t\t{\n\t\t\tTORRENT_ASSERT(len >= 0);\n\t\t\tTORRENT_ASSERT(pos);\n\n\t\t\tRC4 (&m_local_key, len, reinterpret_cast<unsigned char const*>(pos),\n\t\t\t\t reinterpret_cast<unsigned char*>(pos));\n\t\t}\n\n\t\tvoid decrypt(char* pos, int len)\n\t\t{\n\t\t\tTORRENT_ASSERT(len >= 0);\n\t\t\tTORRENT_ASSERT(pos);\n\n\t\t\tRC4 (&m_remote_key, len, reinterpret_cast<unsigned char const*>(pos),\n\t\t\t\t reinterpret_cast<unsigned char*>(pos));\n\t\t}\n\n\tprivate:\n\t\tRC4_KEY m_local_key; \/\/ Key to encrypt outgoing data\n\t\tRC4_KEY m_remote_key; \/\/ Key to decrypt incoming data\n\t};\n\t\n} \/\/ namespace libtorrent\n\n#endif \/\/ TORRENT_PE_CRYPTO_HPP_INCLUDED\n#endif \/\/ TORRENT_DISABLE_ENCRYPTION\n\n<commit_msg>formatting fixes for pe_crypto.cpp<commit_after>\/*\n\nCopyright (c) 2007, Un Shyam\nAll rights reserved.\n\nRedistribution and use in source and binary forms, with or without\nmodification, are permitted provided that the following conditions\nare met:\n\n * Redistributions of source code must retain the above copyright\n notice, this list of conditions and the following disclaimer.\n * Redistributions in binary form must reproduce the above copyright\n notice, this list of conditions and the following disclaimer in\n the documentation and\/or other materials provided with the distribution.\n * Neither the name of the author nor the names of its\n contributors may be used to endorse or promote products derived\n from this software without specific prior written permission.\n\nTHIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS \"AS IS\"\nAND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE\nIMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE\nARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE\nLIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR\nCONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF\nSUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS\nINTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN\nCONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)\nARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE\nPOSSIBILITY OF SUCH DAMAGE.\n\n*\/\n\n#ifndef TORRENT_DISABLE_ENCRYPTION\n\n#ifndef TORRENT_PE_CRYPTO_HPP_INCLUDED\n#define TORRENT_PE_CRYPTO_HPP_INCLUDED\n\n#include <openssl\/dh.h>\n#include <openssl\/engine.h>\n#include <openssl\/rc4.h>\n\n#include \"libtorrent\/peer_id.hpp\" \/\/ For sha1_hash\n#include \"libtorrent\/assert.hpp\"\n\nnamespace libtorrent\n{\n\tclass dh_key_exchange\n\t{\n\tpublic:\n\t\tdh_key_exchange();\n\t\t~dh_key_exchange();\n\t\tbool good() const { return m_dh; }\n\n\t\t\/\/ Get local public key, always 96 bytes\n\t\tchar const* get_local_key() const;\n\n\t\t\/\/ read remote_pubkey, generate and store shared secret in\n\t\t\/\/ m_dh_secret.\n\t\tint compute_secret(const char* remote_pubkey);\n\n\t\tchar const* get_secret() const { return m_dh_secret; }\n\n\t\tsha1_hash const& get_hash_xor_mask() const { return m_xor_mask; }\n\t\t\n\tprivate:\n\t\tint get_local_key_size() const\n\t\t{\n\t\t\tTORRENT_ASSERT(m_dh);\n\t\t\treturn BN_num_bytes(m_dh->pub_key);\n\t\t}\n\n\t\tDH* m_dh;\n\n\t\tchar m_dh_local_key[96];\n\t\tchar m_dh_secret[96];\n\t\tsha1_hash m_xor_mask;\n\t};\n\t\n\tclass RC4_handler \/\/ Non copyable\n\t{\n\tpublic:\n\t\t\/\/ Input longkeys must be 20 bytes\n\t\tRC4_handler(const sha1_hash& rc4_local_longkey,\n\t\t\tconst sha1_hash& rc4_remote_longkey)\n\t\t{\n\t\t\tRC4_set_key(&m_local_key, 20,\n\t\t\t\treinterpret_cast<unsigned char const*>(rc4_local_longkey.begin()));\n\t\t\tRC4_set_key(&m_remote_key, 20,\n\t\t\t\treinterpret_cast<unsigned char const*>(rc4_remote_longkey.begin()));\n\n\t\t\t\/\/ Discard first 1024 bytes\n\t\t\tchar buf[1024];\n\t\t\tencrypt(buf, 1024);\n\t\t\tdecrypt(buf, 1024);\n\t\t};\n\t\t\n\t\t~RC4_handler() {};\n\n\t\tvoid encrypt(char* pos, int len)\n\t\t{\n\t\t\tTORRENT_ASSERT(len >= 0);\n\t\t\tTORRENT_ASSERT(pos);\n\n\t\t\tRC4(&m_local_key, len, reinterpret_cast<unsigned char const*>(pos),\n\t\t\t\treinterpret_cast<unsigned char*>(pos));\n\t\t}\n\n\t\tvoid decrypt(char* pos, int len)\n\t\t{\n\t\t\tTORRENT_ASSERT(len >= 0);\n\t\t\tTORRENT_ASSERT(pos);\n\n\t\t\tRC4(&m_remote_key, len, reinterpret_cast<unsigned char const*>(pos),\n\t\t\t\treinterpret_cast<unsigned char*>(pos));\n\t\t}\n\n\tprivate:\n\t\tRC4_KEY m_local_key; \/\/ Key to encrypt outgoing data\n\t\tRC4_KEY m_remote_key; \/\/ Key to decrypt incoming data\n\t};\n\n} \/\/ namespace libtorrent\n\n#endif \/\/ TORRENT_PE_CRYPTO_HPP_INCLUDED\n#endif \/\/ TORRENT_DISABLE_ENCRYPTION\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#ifndef TORRENT_XML_PARSE_HPP\n#define TORRENT_XML_PARSE_HPP\n\n#include <cctype>\n#include <cstring>\n\nnamespace libtorrent\n{\n\tenum\n\t{\n\t\txml_start_tag,\n\t\txml_end_tag,\n\t\txml_empty_tag,\n\t\txml_declaration_tag,\n\t\txml_string,\n\t\txml_attribute,\n\t\txml_comment,\n\t\txml_parse_error\n\t};\n\n\t\/\/ callback(int type, char const* name, char const* val)\n\t\/\/ str2 is only used for attributes. name is element or attribute\n\t\/\/ name and val is attribute value\n\n\ttemplate <class CallbackType>\t\n\tvoid xml_parse(char* p, char* end, CallbackType callback)\n\t{\n\t\tfor(;p != end; ++p)\n\t\t{\n\t\t\tchar const* start = p;\n\t\t\tchar const* val_start = 0;\n\t\t\tint token;\n\t\t\t\/\/ look for tag start\n\t\t\tfor(; *p != '<' && p != end; ++p);\n\n\t\t\tif (p != start)\n\t\t\t{\n\t\t\t\tif (p != end)\n\t\t\t\t{\n\t\t\t\t\tTORRENT_ASSERT(*p == '<');\n\t\t\t\t\t*p = 0;\n\t\t\t\t}\n\t\t\t\ttoken = xml_string;\n\t\t\t\tcallback(token, start, val_start);\n\t\t\t\tif (p != end) *p = '<';\n\t\t\t}\n\n\t\t\tif (p == end) break;\n\t\t\n\t\t\t\/\/ skip '<'\n\t\t\t++p;\n\t\t\tif (p != end && p+8 < end && string_begins_no_case(\"![CDATA[\", p))\n\t\t\t{\n\t\t\t\t\/\/ CDATA. match '![CDATA['\n\t\t\t\tp += 8;\n\t\t\t\tstart = p;\n\t\t\t\twhile (p != end && !string_begins_no_case(\"]]>\", p-2)) ++p;\n\n\t\t\t\t\/\/ parse error\n\t\t\t\tif (p == end)\n\t\t\t\t{\n\t\t\t\t\ttoken = xml_parse_error;\n\t\t\t\t\tstart = \"unexpected end of file\";\n\t\t\t\t\tcallback(token, start, val_start);\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t\n\t\t\t\ttoken = xml_string;\n\t\t\t\tchar tmp = p[-2];\n\t\t\t\tp[-2] = 0;\n\t\t\t\tcallback(token, start, val_start);\n\t\t\t\tp[-2] = tmp;\n\t\t\t\tcontinue;\n\t\t\t}\n\n\t\t\t\/\/ parse the name of the tag.\n\t\t\tfor (start = p; p != end && *p != '>' && !isspace(*p); ++p);\n\n\t\t\tchar* tag_name_end = p;\n\n\t\t\t\/\/ skip the attributes for now\n\t\t\tfor (; p != end && *p != '>'; ++p);\n\n\t\t\t\/\/ parse error\n\t\t\tif (p == end)\n\t\t\t{\n\t\t\t\ttoken = xml_parse_error;\n\t\t\t\tstart = \"unexpected end of file\";\n\t\t\t\tcallback(token, start, val_start);\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\t\n\t\t\tTORRENT_ASSERT(*p == '>');\n\t\t\t\/\/ save the character that terminated the tag name\n\t\t\t\/\/ it could be both '>' and ' '.\n\t\t\tchar save = *tag_name_end;\n\t\t\t*tag_name_end = 0;\n\n\t\t\tchar* tag_end = p;\n\t\t\tif (*start == '\/')\n\t\t\t{\n\t\t\t\t++start;\n\t\t\t\ttoken = xml_end_tag;\n\t\t\t\tcallback(token, start, val_start);\n\t\t\t}\n\t\t\telse if (*(p-1) == '\/')\n\t\t\t{\n\t\t\t\t*(p-1) = 0;\n\t\t\t\ttoken = xml_empty_tag;\n\t\t\t\tcallback(token, start, val_start);\n\t\t\t\t*(p-1) = '\/';\n\t\t\t\ttag_end = p - 1;\n\t\t\t}\n\t\t\telse if (*start == '?' && *(p-1) == '?')\n\t\t\t{\n\t\t\t\t*(p-1) = 0;\n\t\t\t\t++start;\n\t\t\t\ttoken = xml_declaration_tag;\n\t\t\t\tcallback(token, start, val_start);\n\t\t\t\t*(p-1) = '?';\n\t\t\t\ttag_end = p - 1;\n\t\t\t}\n\t\t\telse if (start + 5 < p && std::memcmp(start, \"!--\", 3) == 0 && std::memcmp(p-2, \"--\", 2) == 0)\n\t\t\t{\n\t\t\t\tstart += 3;\n\t\t\t\t*(p-2) = 0;\n\t\t\t\ttoken = xml_comment;\n\t\t\t\tcallback(token, start, val_start);\n\t\t\t\t*(p-2) = '-';\n\t\t\t\ttag_end = p - 2;\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\ttoken = xml_start_tag;\n\t\t\t\tcallback(token, start, val_start);\n\t\t\t}\n\n\t\t\t*tag_name_end = save;\n\n\t\t\t\/\/ parse attributes\n\t\t\tfor (char* i = tag_name_end; i < tag_end; ++i)\n\t\t\t{\n\t\t\t\t\/\/ find start of attribute name\n\t\t\t\tfor (; i != tag_end && isspace(*i); ++i);\n\t\t\t\tif (i == tag_end) break;\n\t\t\t\tstart = i;\n\t\t\t\t\/\/ find end of attribute name\n\t\t\t\tfor (; i != tag_end && *i != '=' && !isspace(*i); ++i);\n\t\t\t\tchar* name_end = i;\n\n\t\t\t\t\/\/ look for equality sign\n\t\t\t\tfor (; i != tag_end && *i != '='; ++i);\n\n\t\t\t\tif (i == tag_end)\n\t\t\t\t{\n\t\t\t\t\ttoken = xml_parse_error;\n\t\t\t\t\tval_start = 0;\n\t\t\t\t\tstart = \"garbage inside element brackets\";\n\t\t\t\t\tcallback(token, start, val_start);\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\n\t\t\t\t++i;\n\t\t\t\tfor (; i != tag_end && isspace(*i); ++i);\n\t\t\t\t\/\/ check for parse error (values must be quoted)\n\t\t\t\tif (i == tag_end || (*i != '\\'' && *i != '\\\"'))\n\t\t\t\t{\n\t\t\t\t\ttoken = xml_parse_error;\n\t\t\t\t\tval_start = 0;\n\t\t\t\t\tstart = \"unquoted attribute value\";\n\t\t\t\t\tcallback(token, start, val_start);\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t\tchar quote = *i;\n\t\t\t\t++i;\n\t\t\t\tval_start = i;\n\t\t\t\tfor (; i != tag_end && *i != quote; ++i);\n\t\t\t\t\/\/ parse error (missing end quote)\n\t\t\t\tif (i == tag_end)\n\t\t\t\t{\n\t\t\t\t\ttoken = xml_parse_error;\n\t\t\t\t\tval_start = 0;\n\t\t\t\t\tstart = \"missing end quote on attribute\";\n\t\t\t\t\tcallback(token, start, val_start);\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t\tsave = *i;\n\t\t\t\t*i = 0;\n\t\t\t\t*name_end = 0;\n\t\t\t\ttoken = xml_attribute;\n\t\t\t\tcallback(token, start, val_start);\n\t\t\t\t*name_end = '=';\n\t\t\t\t*i = save;\n\t\t\t}\n\t\t}\n\t}\n\n}\n\n\n#endif\n\n<commit_msg>fix windows isspace issue<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#ifndef TORRENT_XML_PARSE_HPP\n#define TORRENT_XML_PARSE_HPP\n\n#include <cctype>\n#include <cstring>\n\nnamespace libtorrent\n{\n\tenum\n\t{\n\t\txml_start_tag,\n\t\txml_end_tag,\n\t\txml_empty_tag,\n\t\txml_declaration_tag,\n\t\txml_string,\n\t\txml_attribute,\n\t\txml_comment,\n\t\txml_parse_error\n\t};\n\n\t\/\/ callback(int type, char const* name, char const* val)\n\t\/\/ str2 is only used for attributes. name is element or attribute\n\t\/\/ name and val is attribute value\n\n\ttemplate <class CallbackType>\t\n\tvoid xml_parse(char* p, char* end, CallbackType callback)\n\t{\n\t\tfor(;p != end; ++p)\n\t\t{\n\t\t\tchar const* start = p;\n\t\t\tchar const* val_start = 0;\n\t\t\tint token;\n\t\t\t\/\/ look for tag start\n\t\t\tfor(; *p != '<' && p != end; ++p);\n\n\t\t\tif (p != start)\n\t\t\t{\n\t\t\t\tif (p != end)\n\t\t\t\t{\n\t\t\t\t\tTORRENT_ASSERT(*p == '<');\n\t\t\t\t\t*p = 0;\n\t\t\t\t}\n\t\t\t\ttoken = xml_string;\n\t\t\t\tcallback(token, start, val_start);\n\t\t\t\tif (p != end) *p = '<';\n\t\t\t}\n\n\t\t\tif (p == end) break;\n\t\t\n\t\t\t\/\/ skip '<'\n\t\t\t++p;\n\t\t\tif (p != end && p+8 < end && string_begins_no_case(\"![CDATA[\", p))\n\t\t\t{\n\t\t\t\t\/\/ CDATA. match '![CDATA['\n\t\t\t\tp += 8;\n\t\t\t\tstart = p;\n\t\t\t\twhile (p != end && !string_begins_no_case(\"]]>\", p-2)) ++p;\n\n\t\t\t\t\/\/ parse error\n\t\t\t\tif (p == end)\n\t\t\t\t{\n\t\t\t\t\ttoken = xml_parse_error;\n\t\t\t\t\tstart = \"unexpected end of file\";\n\t\t\t\t\tcallback(token, start, val_start);\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t\n\t\t\t\ttoken = xml_string;\n\t\t\t\tchar tmp = p[-2];\n\t\t\t\tp[-2] = 0;\n\t\t\t\tcallback(token, start, val_start);\n\t\t\t\tp[-2] = tmp;\n\t\t\t\tcontinue;\n\t\t\t}\n\n\t\t\t\/\/ parse the name of the tag.\n\t\t\tfor (start = p; p != end && *p != '>' && !is_space(*p); ++p);\n\n\t\t\tchar* tag_name_end = p;\n\n\t\t\t\/\/ skip the attributes for now\n\t\t\tfor (; p != end && *p != '>'; ++p);\n\n\t\t\t\/\/ parse error\n\t\t\tif (p == end)\n\t\t\t{\n\t\t\t\ttoken = xml_parse_error;\n\t\t\t\tstart = \"unexpected end of file\";\n\t\t\t\tcallback(token, start, val_start);\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\t\n\t\t\tTORRENT_ASSERT(*p == '>');\n\t\t\t\/\/ save the character that terminated the tag name\n\t\t\t\/\/ it could be both '>' and ' '.\n\t\t\tchar save = *tag_name_end;\n\t\t\t*tag_name_end = 0;\n\n\t\t\tchar* tag_end = p;\n\t\t\tif (*start == '\/')\n\t\t\t{\n\t\t\t\t++start;\n\t\t\t\ttoken = xml_end_tag;\n\t\t\t\tcallback(token, start, val_start);\n\t\t\t}\n\t\t\telse if (*(p-1) == '\/')\n\t\t\t{\n\t\t\t\t*(p-1) = 0;\n\t\t\t\ttoken = xml_empty_tag;\n\t\t\t\tcallback(token, start, val_start);\n\t\t\t\t*(p-1) = '\/';\n\t\t\t\ttag_end = p - 1;\n\t\t\t}\n\t\t\telse if (*start == '?' && *(p-1) == '?')\n\t\t\t{\n\t\t\t\t*(p-1) = 0;\n\t\t\t\t++start;\n\t\t\t\ttoken = xml_declaration_tag;\n\t\t\t\tcallback(token, start, val_start);\n\t\t\t\t*(p-1) = '?';\n\t\t\t\ttag_end = p - 1;\n\t\t\t}\n\t\t\telse if (start + 5 < p && std::memcmp(start, \"!--\", 3) == 0 && std::memcmp(p-2, \"--\", 2) == 0)\n\t\t\t{\n\t\t\t\tstart += 3;\n\t\t\t\t*(p-2) = 0;\n\t\t\t\ttoken = xml_comment;\n\t\t\t\tcallback(token, start, val_start);\n\t\t\t\t*(p-2) = '-';\n\t\t\t\ttag_end = p - 2;\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\ttoken = xml_start_tag;\n\t\t\t\tcallback(token, start, val_start);\n\t\t\t}\n\n\t\t\t*tag_name_end = save;\n\n\t\t\t\/\/ parse attributes\n\t\t\tfor (char* i = tag_name_end; i < tag_end; ++i)\n\t\t\t{\n\t\t\t\t\/\/ find start of attribute name\n\t\t\t\tfor (; i != tag_end && isspace(*i); ++i);\n\t\t\t\tif (i == tag_end) break;\n\t\t\t\tstart = i;\n\t\t\t\t\/\/ find end of attribute name\n\t\t\t\tfor (; i != tag_end && *i != '=' && !isspace(*i); ++i);\n\t\t\t\tchar* name_end = i;\n\n\t\t\t\t\/\/ look for equality sign\n\t\t\t\tfor (; i != tag_end && *i != '='; ++i);\n\n\t\t\t\tif (i == tag_end)\n\t\t\t\t{\n\t\t\t\t\ttoken = xml_parse_error;\n\t\t\t\t\tval_start = 0;\n\t\t\t\t\tstart = \"garbage inside element brackets\";\n\t\t\t\t\tcallback(token, start, val_start);\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\n\t\t\t\t++i;\n\t\t\t\tfor (; i != tag_end && isspace(*i); ++i);\n\t\t\t\t\/\/ check for parse error (values must be quoted)\n\t\t\t\tif (i == tag_end || (*i != '\\'' && *i != '\\\"'))\n\t\t\t\t{\n\t\t\t\t\ttoken = xml_parse_error;\n\t\t\t\t\tval_start = 0;\n\t\t\t\t\tstart = \"unquoted attribute value\";\n\t\t\t\t\tcallback(token, start, val_start);\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t\tchar quote = *i;\n\t\t\t\t++i;\n\t\t\t\tval_start = i;\n\t\t\t\tfor (; i != tag_end && *i != quote; ++i);\n\t\t\t\t\/\/ parse error (missing end quote)\n\t\t\t\tif (i == tag_end)\n\t\t\t\t{\n\t\t\t\t\ttoken = xml_parse_error;\n\t\t\t\t\tval_start = 0;\n\t\t\t\t\tstart = \"missing end quote on attribute\";\n\t\t\t\t\tcallback(token, start, val_start);\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t\tsave = *i;\n\t\t\t\t*i = 0;\n\t\t\t\t*name_end = 0;\n\t\t\t\ttoken = xml_attribute;\n\t\t\t\tcallback(token, start, val_start);\n\t\t\t\t*name_end = '=';\n\t\t\t\t*i = save;\n\t\t\t}\n\t\t}\n\t}\n\n}\n\n\n#endif\n\n<|endoftext|>"} {"text":"<commit_before>\/* bzflag\n * Copyright (c) 1993 - 2002 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#include \"PNGImageFile.h\"\n#include <string>\n#include <iostream>\n#include \"pack.h\"\n#include \"..\/zlib\/zlib.h\"\n\n#ifdef WIN32\n#include <winsock2.h>\n#endif\n\n\n\n\/\/\n\/\/ PNGImageFile\n\/\/\n\nunsigned char PNGImageFile::pngHeader[8] = { 137, 80, 78, 71, 13, 10, 26, 10 };\n\nPNGImageFile::PNGImageFile(std::istream* stream) : ImageFile(stream), valid(true) \n{\n\tchar buffer[8];\n\tstream->read(buffer, 8);\n\tif (strncmp((char*)pngHeader, buffer, 8) != 0) {\n\t\tvalid = false;\n\t\treturn;\n\t}\n\n\tPNGChunk *c = PNGChunk::readChunk(stream);\n\tif (c->getType() != PNGChunk::IHDR) {\n\t\tvalid = false;\n\t\tdelete c;\n\t\treturn;\n\t}\n\n\tunsigned char* data = c->getData();\n\tint width, height;\n\tdata = (unsigned char *)nboUnpackInt(data, width);\n\tdata = (unsigned char *)nboUnpackInt(data, height);\n\n\tdata = (unsigned char *)nboUnpackUByte(data, bitDepth);\n\tdata = (unsigned char *)nboUnpackUByte(data, colorDepth);\n\tdata = (unsigned char *)nboUnpackUByte(data, compressionMethod);\n\tdata = (unsigned char *)nboUnpackUByte(data, filterMethod);\n\tdata = (unsigned char *)nboUnpackUByte(data, interlaceMethod);\n\n\tint lineBufferSize;\n\n\tswitch (colorDepth) {\n\t\tcase 0:\n\t\t\tlineBufferSize = (width * (8\/bitDepth))+1;\n\t\tbreak;\n\n\t\tcase 2:\n\t\t\tlineBufferSize = (width * 3 * (8\/bitDepth))+1;\n\t\tbreak;\n\n\t\tcase 3:\n\t\t\tlineBufferSize = (width * (8\/bitDepth))+1;\n\t\tbreak;\n\n\t\tcase 4:\n\t\t\tlineBufferSize = (width * 2 * (8\/bitDepth))+1;\n\t\tbreak;\n\n\t\tcase 6:\n\t\t\tlineBufferSize = (width * 4 * (8\/bitDepth))+1;\n\t\tbreak;\n\t}\n\tlineBuffers[0] = new unsigned char[lineBufferSize];\n\tlineBuffers[1] = new unsigned char[lineBufferSize];\n\tactiveBufferIndex = 0;\n\n\tinit(3, width, height);\n\tvalid = true;\n}\n\nPNGImageFile::~PNGImageFile()\n{\n\tif (valid) {\n\t\tdelete lineBuffers[0];\n\t\tdelete lineBuffers[1];\n\t}\n}\n\nstd::string\t\t\t\tPNGImageFile::getExtension()\n{\n\treturn \".png\";\n}\n\nbool\t\t\t\t\tPNGImageFile::read(void* buffer)\n{\n\tPNGChunk *c;\n\tint\tbufferPos = 0;\n\t\n\tc = PNGChunk::readChunk(getStream());\n\twhile ((c->getType() != PNGChunk::IDAT) && (c->getType() != PNGChunk::IEND)) {\n\t\tif (c->getType() == PNGChunk::PLTE)\n\t\t\treadPalette(c);\n\t\tdelete c;\n\t\tc = PNGChunk::readChunk(getStream());\n\t}\n\n\tunsigned char *line = getLineBuffer();\n\n\tint err;\n\tz_stream stream;\n\tstream.next_out = line;\n\tstream.avail_out = lineBufferSize;\n\tstream.zalloc = (alloc_func)NULL;\n\tstream.zfree = (free_func)NULL;\n\n\twhile (c->getType() == PNGChunk::IDAT) {\n\n\t\tstream.next_in = c->getData();\n\t\tstream.avail_in = c->getLength();\n\n\t\terr = inflateInit(&stream);\n\t\tif (err != Z_OK) {\n\t\t\tdelete[] line;\n\t\t\tdelete c;\n\t\t\treturn false;\n\t\t}\n\n\t\terr = inflate(&stream, Z_FINISH);\n\t\twhile (err == Z_BUF_ERROR) {\n\t\t\t\/\/ignore filter bit for now, assume None!!!\n\t\t\t\/\/also assume rgb (2)\n\t\t\tmemcpy( ((unsigned char *)buffer)+bufferPos, line+1, lineBufferSize+1 );\n\n\t\t\tswitchLineBuffers();\n\t\t\tline = getLineBuffer();\n\t\t\tstream.next_out = line;\n\t\t\tstream.avail_out = lineBufferSize;\n\t\t\terr = inflate(&stream, Z_FINISH);\n\t\t}\n\t\tif (err != Z_STREAM_END) {\n\t\t\tdelete[] line;\n\t\t\tdelete c;\n\t\t\treturn false;\n\t\t}\n\t\tinflateEnd(&stream);\n\n\t\tdelete c;\n\t\tc = PNGChunk::readChunk(getStream());\n\t}\n\n\tdelete[] line;\n\n\n\tdelete c;\n\treturn true;\n}\n\nPNGPalette* PNGImageFile::readPalette(PNGChunk *c)\n{\n\tint numColors = c->getLength() \/ sizeof(PNGRGB);\n\tPNGPalette *p = new PNGPalette(numColors);\n\tPNGRGB rgb;\n\n\tunsigned char *pData = c->getData();\n\tfor (int i = 0; i < numColors; i++) {\n\t\tpData = (unsigned char *)nboUnpackUByte(pData, rgb.red);\n\t\tpData = (unsigned char *)nboUnpackUByte(pData, rgb.green);\n\t\tpData = (unsigned char *)nboUnpackUByte(pData, rgb.blue);\n\t\tp->add(rgb);\n\t}\n\treturn p;\n}\n\nunsigned char *PNGImageFile::getLineBuffer(bool active)\n{\n\treturn lineBuffers[active ? activeBufferIndex : (1 - activeBufferIndex)];\n}\n\nvoid PNGImageFile::switchLineBuffers()\n{\n\tactiveBufferIndex = 1 - activeBufferIndex;\n}\n\n\n\n\nPNGPalette::PNGPalette(int nc)\n{\n\tcurColor = 0;\n\tnumColors = nc;\n\tcolors = new PNGRGB[nc];\n}\n\nPNGPalette::~PNGPalette()\n{\n\tdelete [] colors;\n}\n\nvoid PNGPalette::add(PNGRGB& color)\n{\n\tcolors[curColor++] = color;\n}\n\nint PNGChunk::IHDR = 'IHDR';\nint PNGChunk::sRGB = 'sRGB';\nint PNGChunk::PLTE = 'PLTE';\nint PNGChunk::IDAT = 'IDAT';\nint PNGChunk::IEND = 'IEND';\n\nPNGChunk *PNGChunk::readChunk(std::istream *stream)\n{\n\tPNGChunk *c = new PNGChunk();\n\tstream->read((char *) &c->length, 4);\n\tc->length = ntohl(c->length);\n\tstream->read((char *) &c->type, 4);\n\tc->type = ntohl(c->type);\n\tif (c->length > 0) {\n\t\tc->data = new unsigned char[c->length];\n\t\tstream->read((char*) c->data, c->length);\n\t}\n\tstream->read((char *) &c->crc, 4);\n\tc->crc = ntohl(c->crc);\n\treturn c;\n}\n\nPNGChunk::PNGChunk()\n: length(0), type(0), data(NULL), crc(0)\n{\n}\n\nPNGChunk::~PNGChunk()\n{\n\tif (data != NULL)\n\t\tdelete[] data;\n}\n\nint PNGChunk::getLength()\n{\n\treturn length;\n}\n\nint PNGChunk::getType()\n{\n\treturn type;\n}\n\nunsigned char *PNGChunk::getData()\n{\n\treturn data;\n}\n<commit_msg>Fixed buffer overrun causing audio crash<commit_after>\/* bzflag\n * Copyright (c) 1993 - 2002 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#include \"PNGImageFile.h\"\n#include <string>\n#include <iostream>\n#include \"pack.h\"\n#include \"..\/zlib\/zlib.h\"\n\n#ifdef WIN32\n#include <winsock2.h>\n#endif\n\n\n\n\/\/\n\/\/ PNGImageFile\n\/\/\n\nunsigned char PNGImageFile::pngHeader[8] = { 137, 80, 78, 71, 13, 10, 26, 10 };\n\nPNGImageFile::PNGImageFile(std::istream* stream) : ImageFile(stream), valid(true) \n{\n\tchar buffer[8];\n\tstream->read(buffer, 8);\n\tif (strncmp((char*)pngHeader, buffer, 8) != 0) {\n\t\tvalid = false;\n\t\treturn;\n\t}\n\n\tPNGChunk *c = PNGChunk::readChunk(stream);\n\tif (c->getType() != PNGChunk::IHDR) {\n\t\tvalid = false;\n\t\tdelete c;\n\t\treturn;\n\t}\n\n\tunsigned char* data = c->getData();\n\tint width, height;\n\tdata = (unsigned char *)nboUnpackInt(data, width);\n\tdata = (unsigned char *)nboUnpackInt(data, height);\n\n\tdata = (unsigned char *)nboUnpackUByte(data, bitDepth);\n\tdata = (unsigned char *)nboUnpackUByte(data, colorDepth);\n\tdata = (unsigned char *)nboUnpackUByte(data, compressionMethod);\n\tdata = (unsigned char *)nboUnpackUByte(data, filterMethod);\n\tdata = (unsigned char *)nboUnpackUByte(data, interlaceMethod);\n\n\tswitch (colorDepth) {\n\t\tcase 0:\n\t\t\tlineBufferSize = (width * (8\/bitDepth))+1;\n\t\tbreak;\n\n\t\tcase 2:\n\t\t\tlineBufferSize = (width * 3 * (8\/bitDepth))+1;\n\t\tbreak;\n\n\t\tcase 3:\n\t\t\tlineBufferSize = (width * (8\/bitDepth))+1;\n\t\tbreak;\n\n\t\tcase 4:\n\t\t\tlineBufferSize = (width * 2 * (8\/bitDepth))+1;\n\t\tbreak;\n\n\t\tcase 6:\n\t\t\tlineBufferSize = (width * 4 * (8\/bitDepth))+1;\n\t\tbreak;\n\t}\n\n\tlineBuffers[0] = new unsigned char[lineBufferSize];\n\tlineBuffers[1] = new unsigned char[lineBufferSize];\n\tactiveBufferIndex = 0;\n\n\tinit(3, width, height);\n\tvalid = true;\n}\n\nPNGImageFile::~PNGImageFile()\n{\n\tif (valid) {\n\t\tdelete lineBuffers[0];\n\t\tdelete lineBuffers[1];\n\t}\n}\n\nstd::string\t\t\t\tPNGImageFile::getExtension()\n{\n\treturn \".png\";\n}\n\nbool\t\t\t\t\tPNGImageFile::read(void* buffer)\n{\n\tPNGChunk *c;\n\tint\tbufferPos = 0;\n\t\n\tc = PNGChunk::readChunk(getStream());\n\twhile ((c->getType() != PNGChunk::IDAT) && (c->getType() != PNGChunk::IEND)) {\n\t\tif (c->getType() == PNGChunk::PLTE)\n\t\t\treadPalette(c);\n\t\tdelete c;\n\t\tc = PNGChunk::readChunk(getStream());\n\t}\n\n\tunsigned char *line = getLineBuffer();\n\n\tint err;\n\tz_stream stream;\n\tstream.next_out = line;\n\tstream.avail_out = lineBufferSize;\n\tstream.zalloc = (alloc_func)NULL;\n\tstream.zfree = (free_func)NULL;\n\n\twhile (c->getType() == PNGChunk::IDAT) {\n\n\t\tstream.next_in = c->getData();\n\t\tstream.avail_in = c->getLength();\n\n\t\terr = inflateInit(&stream);\n\t\tif (err != Z_OK) {\n\t\t\tdelete[] line;\n\t\t\tdelete c;\n\t\t\treturn false;\n\t\t}\n\n\t\terr = inflate(&stream, Z_FINISH);\n\t\twhile (err == Z_BUF_ERROR) {\n\t\t\t\/\/ignore filter bit for now, assume None!!!\n\t\t\t\/\/also assume rgb (2)\n\t\t\tmemcpy( ((unsigned char *)buffer)+bufferPos, line+1, lineBufferSize-1 );\n\t\t\tbufferPos += lineBufferSize-1;\n\n\t\t\tswitchLineBuffers();\n\t\t\tline = getLineBuffer();\n\t\t\tstream.next_out = line;\n\t\t\tstream.avail_out = lineBufferSize;\n\t\t\terr = inflate(&stream, Z_FINISH);\n\t\t}\n\t\tif (err != Z_STREAM_END) {\n\t\t\tdelete[] line;\n\t\t\tdelete c;\n\t\t\treturn false;\n\t\t}\n\t\tinflateEnd(&stream);\n\n\t\tdelete c;\n\t\tc = PNGChunk::readChunk(getStream());\n\t}\n\n\tdelete[] line;\n\n\n\tdelete c;\n\treturn true;\n}\n\nPNGPalette* PNGImageFile::readPalette(PNGChunk *c)\n{\n\tint numColors = c->getLength() \/ sizeof(PNGRGB);\n\tPNGPalette *p = new PNGPalette(numColors);\n\tPNGRGB rgb;\n\n\tunsigned char *pData = c->getData();\n\tfor (int i = 0; i < numColors; i++) {\n\t\tpData = (unsigned char *)nboUnpackUByte(pData, rgb.red);\n\t\tpData = (unsigned char *)nboUnpackUByte(pData, rgb.green);\n\t\tpData = (unsigned char *)nboUnpackUByte(pData, rgb.blue);\n\t\tp->add(rgb);\n\t}\n\treturn p;\n}\n\nunsigned char *PNGImageFile::getLineBuffer(bool active)\n{\n\treturn lineBuffers[active ? activeBufferIndex : (1 - activeBufferIndex)];\n}\n\nvoid PNGImageFile::switchLineBuffers()\n{\n\tactiveBufferIndex = 1 - activeBufferIndex;\n}\n\n\n\n\nPNGPalette::PNGPalette(int nc)\n{\n\tcurColor = 0;\n\tnumColors = nc;\n\tcolors = new PNGRGB[nc];\n}\n\nPNGPalette::~PNGPalette()\n{\n\tdelete [] colors;\n}\n\nvoid PNGPalette::add(PNGRGB& color)\n{\n\tcolors[curColor++] = color;\n}\n\nint PNGChunk::IHDR = 'IHDR';\nint PNGChunk::sRGB = 'sRGB';\nint PNGChunk::PLTE = 'PLTE';\nint PNGChunk::IDAT = 'IDAT';\nint PNGChunk::IEND = 'IEND';\n\nPNGChunk *PNGChunk::readChunk(std::istream *stream)\n{\n\tPNGChunk *c = new PNGChunk();\n\tstream->read((char *) &c->length, 4);\n\tc->length = ntohl(c->length);\n\tstream->read((char *) &c->type, 4);\n\tc->type = ntohl(c->type);\n\tif (c->length > 0) {\n\t\tc->data = new unsigned char[c->length];\n\t\tstream->read((char*) c->data, c->length);\n\t}\n\tstream->read((char *) &c->crc, 4);\n\tc->crc = ntohl(c->crc);\n\treturn c;\n}\n\nPNGChunk::PNGChunk()\n: length(0), type(0), data(NULL), crc(0)\n{\n}\n\nPNGChunk::~PNGChunk()\n{\n\tif (data != NULL)\n\t\tdelete[] data;\n}\n\nint PNGChunk::getLength()\n{\n\treturn length;\n}\n\nint PNGChunk::getType()\n{\n\treturn type;\n}\n\nunsigned char *PNGChunk::getData()\n{\n\treturn data;\n}\n<|endoftext|>"} {"text":"<commit_before>#ifndef CPPMATH_VECTOR_INL\n#define CPPMATH_VECTOR_INL\n\n#include \"Vector.hpp\"\n#include \"..\/TypeTraits.hpp\" \/\/ almostEquals\n#include \"Point2.hpp\"\n\n#define _FOREACH_VECTOR(var, op) for (size_t (var) = 0; (var) < N; ++(var)) { op }\n\nnamespace geometry\n{\n template <typename T, size_t N>\n Vector<T, N>::Vector(const T& val)\n {\n fill(val);\n }\n\n template <typename T, size_t N>\n template <typename T2>\n Vector<T, N>::Vector(const other_type<T2>& vec)\n {\n _FOREACH_VECTOR(i, _data[i] = static_cast<T>(vec[i]);)\n }\n\n template <typename T, size_t N>\n template <typename First, typename... Args>\n Vector<T, N>::Vector(const First& first, const Args&... args)\n {\n fill(first, args...);\n }\n\n template <typename T, size_t N>\n template <typename F>\n void Vector<T, N>::foreach(F callback)\n {\n _FOREACH_VECTOR(i, callback(_data + i);)\n }\n\n template <typename T, size_t N>\n double Vector<T, N>::abs() const\n {\n return sqrt(dot(*this));\n }\n\n template <typename T, size_t N>\n double Vector<T, N>::abs_sqr() const\n {\n return dot(*this);\n }\n\n template <typename T, size_t N>\n void Vector<T, N>::normalize()\n {\n *this \/= abs();\n }\n\n template <typename T, size_t N>\n Vector<T, N> Vector<T, N>::normalized() const\n {\n return *this \/ abs();\n }\n\n template <typename T, size_t N>\n T Vector<T, N>::dot(const type& vec) const\n {\n T tmp = 0;\n _FOREACH_VECTOR(i, tmp += _data[i] * vec[i];)\n return tmp;\n }\n\n template <typename T, size_t N>\n T Vector<T, N>::project(const type& vec) const\n {\n return dot(vec.normalized());\n }\n\n template <typename T, size_t N>\n Vector<T, N> Vector<T, N>::signs() const\n {\n type vec;\n _FOREACH_VECTOR(i, vec[i] = math::sign(_data[i]);)\n return vec;\n }\n\n template <typename T, size_t N>\n Vector<T, N>& Vector<T, N>::fill(const T& val)\n {\n _FOREACH_VECTOR(i, _data[i] = val;)\n return *this;\n }\n\n template <typename T, size_t N>\n template <typename... Args>\n Vector<T, N>& Vector<T, N>::fill(const Args&... args)\n {\n _fill<0>(args...);\n return *this;\n }\n\n template <typename T, size_t N>\n Vector<T, N>& Vector<T, N>::set(const T& val)\n {\n return fill(val);\n }\n\n template <typename T, size_t N>\n template <typename... Args>\n Vector<T, N>& Vector<T, N>::set(const Args&... args)\n {\n return fill(args...);\n }\n\n template <typename T, size_t N>\n bool Vector<T, N>::almostEquals(const type& p) const\n {\n _FOREACH_VECTOR(i,\n if (!math::almostEquals(_data[i], p[i]))\n return false;\n )\n return true;\n }\n\n template <typename T, size_t N>\n bool Vector<T, N>::almostEquals(const type& p, T tolerance) const\n {\n _FOREACH_VECTOR(i,\n if (!math::almostEquals(_data[i], p[i], tolerance))\n return false;\n )\n }\n\n template <typename T, size_t N>\n template <size_t M, typename>\n const Point2<T>& Vector<T, N>::asPoint() const\n {\n return *reinterpret_cast<const Point2<T>*>(this);\n }\n\n template <typename T, size_t N>\n template <size_t M, typename>\n Point2<T>& Vector<T, N>::asPoint()\n {\n return *reinterpret_cast<Point2<T>*>(this);\n }\n\n template <typename T, size_t N>\n template <size_t M, typename>\n T Vector<T, N>::cross(const type& rhs) const\n {\n return rhs.y * this->x - rhs.x * this->y;\n }\n\n template <typename T, size_t N>\n template <size_t M, typename>\n bool Vector<T, N>::crossAlmostZero(const type& rhs) const\n {\n return math::almostEquals(rhs.y * this->x, rhs.x * this->y);\n }\n\n template <typename T, size_t N>\n template <size_t M, typename>\n Vector<T, N> Vector<T, N>::cross(const type& rhs) const\n {\n type vec;\n _FOREACH_VECTOR(i,\n vec[i] = _data[i] * rhs[(i+1) % N] - _data[(i+1) % N] * rhs[i];\n )\n return vec;\n }\n\n template <typename T, size_t N>\n template <size_t M, typename>\n double Vector<T, N>::dir() const\n {\n \/\/angle between 2 vectors: dot(vec1, vec2) \/ abs(vec1) * abs(vec2)\n \/\/-> direction = angle between vec(x, y) and the x-axis vec(1, 0)\n return acos(this->x \/ abs()) \/ M_PI * 180;\n }\n\n template <typename T, size_t N>\n template <size_t M, typename>\n Vector<T, N> Vector<T, N>::fromDirection(float len, float dir)\n {\n return type(len * cos(dir * M_PI \/ 180), len * sin(dir * M_PI \/ 180));\n }\n\n\n template <typename T, size_t N>\n template <typename T2>\n Vector<T, N>::ResVec<T2> Vector<T, N>::operator+(const other_type<T2>& p) const\n {\n ResVec<T2> vec(*this);\n vec += p;\n return vec;\n }\n\n template <typename T, size_t N>\n template <typename T2>\n Vector<T, N>& Vector<T, N>::operator+=(const other_type<T2>& p)\n {\n _FOREACH_VECTOR(i, _data[i] += p[i];)\n return *this;\n }\n\n template <typename T, size_t N>\n Vector<T, N> Vector<T, N>::operator-() const\n {\n type vec(*this);\n _FOREACH_VECTOR(i, vec[i] = -vec[i];)\n return vec;\n }\n\n template <typename T, size_t N>\n template <typename T2>\n Vector<T, N>::ResVec<T2> Vector<T, N>::operator-(const other_type<T2>& p) const\n {\n ResVec<T2> vec(*this);\n _FOREACH_VECTOR(i, vec[i] -= p[i];)\n return vec;\n }\n\n template <typename T, size_t N>\n template <typename T2>\n Vector<T, N>& Vector<T, N>::operator-=(const other_type<T2>& p)\n {\n _FOREACH_VECTOR(i, _data[i] -= p[i];)\n return *this;\n }\n\n template <typename T, size_t N>\n template <typename T2>\n Vector<T, N>::ResVec<T2> Vector<T, N>::operator*(const other_type<T2>& p) const\n {\n ResVec<T2> vec(*this);\n _FOREACH_VECTOR(i, vec[i] *= p[i];)\n return vec;\n }\n\n template <typename T, size_t N>\n template <typename T2>\n Vector<T, N>::ResVec<T2> Vector<T, N>::operator*(const T2& val) const\n {\n ResVec<T2> vec(*this);\n _FOREACH_VECTOR(i, vec[i] *= val;)\n return vec;\n }\n\n template <typename T, size_t N>\n template <typename T2>\n Vector<T, N>& Vector<T, N>::operator*=(const Vector<T2, N>& p)\n {\n _FOREACH_VECTOR(i, _data[i] *= p[i];)\n return *this;\n }\n\n template <typename T, size_t N>\n template <typename T2>\n Vector<T, N>& Vector<T, N>::operator*=(const T2& val)\n {\n _FOREACH_VECTOR(i, _data[i] *= val;)\n return *this;\n }\n\n template <typename T, size_t N>\n template <typename T2>\n Vector<T, N>::ResVec<T2> Vector<T, N>::operator\/(const other_type<T2>& p) const\n {\n ResVec<T2> vec(*this);\n _FOREACH_VECTOR(i, vec[i] \/= p[i];)\n return vec;\n }\n\n template <typename T, size_t N>\n template <typename T2>\n Vector<T, N>::ResVec<T2> Vector<T, N>::operator\/(const T2& val) const\n {\n ResVec<T2> vec(*this);\n _FOREACH_VECTOR(i, vec[i] \/= val;)\n return vec;\n }\n\n template <typename T, size_t N>\n template <typename T2>\n Vector<T, N>& Vector<T, N>::operator\/=(const Vector<T2, N>& p)\n {\n _FOREACH_VECTOR(i, _data[i] \/= p[i];)\n return *this;\n }\n\n template <typename T, size_t N>\n template <typename T2>\n Vector<T, N>& Vector<T, N>::operator\/=(const T2& val)\n {\n _FOREACH_VECTOR(i, _data[i] \/= val;)\n return *this;\n }\n\n template <typename T, size_t N>\n bool Vector<T, N>::operator<(const type& p) const\n {\n _FOREACH_VECTOR(i,\n if (_data[i] >= p[i])\n return false;\n )\n return true;\n }\n\n template <typename T, size_t N>\n bool Vector<T, N>::operator>(const type& p) const\n {\n _FOREACH_VECTOR(i,\n if (_data[i] <= p[i])\n return false;\n )\n return true;\n }\n\n template <typename T, size_t N>\n bool Vector<T, N>::operator<=(const type& p) const\n {\n return !(*this > p);\n }\n\n template <typename T, size_t N>\n bool Vector<T, N>::operator>=(const type& p) const\n {\n return !(*this < p);\n }\n\n template <typename T, size_t N>\n bool Vector<T, N>::operator!=(const type& p) const\n {\n _FOREACH_VECTOR(i,\n if (_data[i] != p[i])\n return true;\n )\n return false;\n }\n\n template <typename T, size_t N>\n bool Vector<T, N>::operator==(const type& p) const\n {\n return !(*this != p);\n }\n\n \/\/ template <typename T, size_t N>\n \/\/ Vector<T, N>::operator bool() const\n \/\/ {\n \/\/ assert(false);\n \/\/ _FOREACH_VECTOR(i,\n \/\/ if (_data[i])\n \/\/ return true;\n \/\/ )\n \/\/ return false;\n \/\/ }\n\n template <typename T, size_t N>\n template <typename T2>\n Vector<T, N>::operator Vector<T2, N>() const\n {\n Vector<T2, N> vec;\n _FOREACH_VECTOR(i, vec[i] = static_cast<T2>(_data[i]);)\n return vec;\n }\n\n template <typename T, size_t N>\n const T& Vector<T, N>::operator[](size_t i) const\n {\n return VectorData<T, N>::_data[i];\n }\n\n template <typename T, size_t N>\n T& Vector<T, N>::operator[](size_t i)\n {\n return _data[i];\n }\n\n template <typename T, size_t N>\n template <size_t i, typename U, typename... Args>\n void Vector<T, N>::_fill(const U& val, const Args&... rest)\n {\n _data[i] = val;\n _fill<i + 1>(rest...);\n }\n\n template <typename T, size_t N>\n template <size_t i, typename U>\n void Vector<T, N>::_fill(const U& val)\n {\n _data[i] = val;\n }\n}\n\n#endif\n<commit_msg>Fix <= and >= operators<commit_after>#ifndef CPPMATH_VECTOR_INL\n#define CPPMATH_VECTOR_INL\n\n#include \"Vector.hpp\"\n#include \"..\/TypeTraits.hpp\" \/\/ almostEquals\n#include \"Point2.hpp\"\n\n#define _FOREACH_VECTOR(var, op) for (size_t (var) = 0; (var) < N; ++(var)) { op }\n\nnamespace geometry\n{\n template <typename T, size_t N>\n Vector<T, N>::Vector(const T& val)\n {\n fill(val);\n }\n\n template <typename T, size_t N>\n template <typename T2>\n Vector<T, N>::Vector(const other_type<T2>& vec)\n {\n _FOREACH_VECTOR(i, _data[i] = static_cast<T>(vec[i]);)\n }\n\n template <typename T, size_t N>\n template <typename First, typename... Args>\n Vector<T, N>::Vector(const First& first, const Args&... args)\n {\n fill(first, args...);\n }\n\n template <typename T, size_t N>\n template <typename F>\n void Vector<T, N>::foreach(F callback)\n {\n _FOREACH_VECTOR(i, callback(_data + i);)\n }\n\n template <typename T, size_t N>\n double Vector<T, N>::abs() const\n {\n return sqrt(dot(*this));\n }\n\n template <typename T, size_t N>\n double Vector<T, N>::abs_sqr() const\n {\n return dot(*this);\n }\n\n template <typename T, size_t N>\n void Vector<T, N>::normalize()\n {\n *this \/= abs();\n }\n\n template <typename T, size_t N>\n Vector<T, N> Vector<T, N>::normalized() const\n {\n return *this \/ abs();\n }\n\n template <typename T, size_t N>\n T Vector<T, N>::dot(const type& vec) const\n {\n T tmp = 0;\n _FOREACH_VECTOR(i, tmp += _data[i] * vec[i];)\n return tmp;\n }\n\n template <typename T, size_t N>\n T Vector<T, N>::project(const type& vec) const\n {\n return dot(vec.normalized());\n }\n\n template <typename T, size_t N>\n Vector<T, N> Vector<T, N>::signs() const\n {\n type vec;\n _FOREACH_VECTOR(i, vec[i] = math::sign(_data[i]);)\n return vec;\n }\n\n template <typename T, size_t N>\n Vector<T, N>& Vector<T, N>::fill(const T& val)\n {\n _FOREACH_VECTOR(i, _data[i] = val;)\n return *this;\n }\n\n template <typename T, size_t N>\n template <typename... Args>\n Vector<T, N>& Vector<T, N>::fill(const Args&... args)\n {\n _fill<0>(args...);\n return *this;\n }\n\n template <typename T, size_t N>\n Vector<T, N>& Vector<T, N>::set(const T& val)\n {\n return fill(val);\n }\n\n template <typename T, size_t N>\n template <typename... Args>\n Vector<T, N>& Vector<T, N>::set(const Args&... args)\n {\n return fill(args...);\n }\n\n template <typename T, size_t N>\n bool Vector<T, N>::almostEquals(const type& p) const\n {\n _FOREACH_VECTOR(i,\n if (!math::almostEquals(_data[i], p[i]))\n return false;\n )\n return true;\n }\n\n template <typename T, size_t N>\n bool Vector<T, N>::almostEquals(const type& p, T tolerance) const\n {\n _FOREACH_VECTOR(i,\n if (!math::almostEquals(_data[i], p[i], tolerance))\n return false;\n )\n }\n\n template <typename T, size_t N>\n template <size_t M, typename>\n const Point2<T>& Vector<T, N>::asPoint() const\n {\n return *reinterpret_cast<const Point2<T>*>(this);\n }\n\n template <typename T, size_t N>\n template <size_t M, typename>\n Point2<T>& Vector<T, N>::asPoint()\n {\n return *reinterpret_cast<Point2<T>*>(this);\n }\n\n template <typename T, size_t N>\n template <size_t M, typename>\n T Vector<T, N>::cross(const type& rhs) const\n {\n return rhs.y * this->x - rhs.x * this->y;\n }\n\n template <typename T, size_t N>\n template <size_t M, typename>\n bool Vector<T, N>::crossAlmostZero(const type& rhs) const\n {\n return math::almostEquals(rhs.y * this->x, rhs.x * this->y);\n }\n\n template <typename T, size_t N>\n template <size_t M, typename>\n Vector<T, N> Vector<T, N>::cross(const type& rhs) const\n {\n type vec;\n _FOREACH_VECTOR(i,\n vec[i] = _data[i] * rhs[(i+1) % N] - _data[(i+1) % N] * rhs[i];\n )\n return vec;\n }\n\n template <typename T, size_t N>\n template <size_t M, typename>\n double Vector<T, N>::dir() const\n {\n \/\/angle between 2 vectors: dot(vec1, vec2) \/ abs(vec1) * abs(vec2)\n \/\/-> direction = angle between vec(x, y) and the x-axis vec(1, 0)\n return acos(this->x \/ abs()) \/ M_PI * 180;\n }\n\n template <typename T, size_t N>\n template <size_t M, typename>\n Vector<T, N> Vector<T, N>::fromDirection(float len, float dir)\n {\n return type(len * cos(dir * M_PI \/ 180), len * sin(dir * M_PI \/ 180));\n }\n\n\n template <typename T, size_t N>\n template <typename T2>\n Vector<T, N>::ResVec<T2> Vector<T, N>::operator+(const other_type<T2>& p) const\n {\n ResVec<T2> vec(*this);\n vec += p;\n return vec;\n }\n\n template <typename T, size_t N>\n template <typename T2>\n Vector<T, N>& Vector<T, N>::operator+=(const other_type<T2>& p)\n {\n _FOREACH_VECTOR(i, _data[i] += p[i];)\n return *this;\n }\n\n template <typename T, size_t N>\n Vector<T, N> Vector<T, N>::operator-() const\n {\n type vec(*this);\n _FOREACH_VECTOR(i, vec[i] = -vec[i];)\n return vec;\n }\n\n template <typename T, size_t N>\n template <typename T2>\n Vector<T, N>::ResVec<T2> Vector<T, N>::operator-(const other_type<T2>& p) const\n {\n ResVec<T2> vec(*this);\n _FOREACH_VECTOR(i, vec[i] -= p[i];)\n return vec;\n }\n\n template <typename T, size_t N>\n template <typename T2>\n Vector<T, N>& Vector<T, N>::operator-=(const other_type<T2>& p)\n {\n _FOREACH_VECTOR(i, _data[i] -= p[i];)\n return *this;\n }\n\n template <typename T, size_t N>\n template <typename T2>\n Vector<T, N>::ResVec<T2> Vector<T, N>::operator*(const other_type<T2>& p) const\n {\n ResVec<T2> vec(*this);\n _FOREACH_VECTOR(i, vec[i] *= p[i];)\n return vec;\n }\n\n template <typename T, size_t N>\n template <typename T2>\n Vector<T, N>::ResVec<T2> Vector<T, N>::operator*(const T2& val) const\n {\n ResVec<T2> vec(*this);\n _FOREACH_VECTOR(i, vec[i] *= val;)\n return vec;\n }\n\n template <typename T, size_t N>\n template <typename T2>\n Vector<T, N>& Vector<T, N>::operator*=(const Vector<T2, N>& p)\n {\n _FOREACH_VECTOR(i, _data[i] *= p[i];)\n return *this;\n }\n\n template <typename T, size_t N>\n template <typename T2>\n Vector<T, N>& Vector<T, N>::operator*=(const T2& val)\n {\n _FOREACH_VECTOR(i, _data[i] *= val;)\n return *this;\n }\n\n template <typename T, size_t N>\n template <typename T2>\n Vector<T, N>::ResVec<T2> Vector<T, N>::operator\/(const other_type<T2>& p) const\n {\n ResVec<T2> vec(*this);\n _FOREACH_VECTOR(i, vec[i] \/= p[i];)\n return vec;\n }\n\n template <typename T, size_t N>\n template <typename T2>\n Vector<T, N>::ResVec<T2> Vector<T, N>::operator\/(const T2& val) const\n {\n ResVec<T2> vec(*this);\n _FOREACH_VECTOR(i, vec[i] \/= val;)\n return vec;\n }\n\n template <typename T, size_t N>\n template <typename T2>\n Vector<T, N>& Vector<T, N>::operator\/=(const Vector<T2, N>& p)\n {\n _FOREACH_VECTOR(i, _data[i] \/= p[i];)\n return *this;\n }\n\n template <typename T, size_t N>\n template <typename T2>\n Vector<T, N>& Vector<T, N>::operator\/=(const T2& val)\n {\n _FOREACH_VECTOR(i, _data[i] \/= val;)\n return *this;\n }\n\n template <typename T, size_t N>\n bool Vector<T, N>::operator<(const type& p) const\n {\n _FOREACH_VECTOR(i,\n if (_data[i] >= p[i])\n return false;\n )\n return true;\n }\n\n template <typename T, size_t N>\n bool Vector<T, N>::operator>(const type& p) const\n {\n _FOREACH_VECTOR(i,\n if (_data[i] <= p[i])\n return false;\n )\n return true;\n }\n\n template <typename T, size_t N>\n bool Vector<T, N>::operator<=(const type& p) const\n {\n _FOREACH_VECTOR(i,\n if (_data[i] > p[i])\n return false;\n )\n return true;\n }\n\n template <typename T, size_t N>\n bool Vector<T, N>::operator>=(const type& p) const\n {\n _FOREACH_VECTOR(i,\n if (_data[i] < p[i])\n return false;\n )\n return true;\n }\n\n template <typename T, size_t N>\n bool Vector<T, N>::operator!=(const type& p) const\n {\n _FOREACH_VECTOR(i,\n if (_data[i] != p[i])\n return true;\n )\n return false;\n }\n\n template <typename T, size_t N>\n bool Vector<T, N>::operator==(const type& p) const\n {\n return !(*this != p);\n }\n\n \/\/ template <typename T, size_t N>\n \/\/ Vector<T, N>::operator bool() const\n \/\/ {\n \/\/ assert(false);\n \/\/ _FOREACH_VECTOR(i,\n \/\/ if (_data[i])\n \/\/ return true;\n \/\/ )\n \/\/ return false;\n \/\/ }\n\n template <typename T, size_t N>\n template <typename T2>\n Vector<T, N>::operator Vector<T2, N>() const\n {\n Vector<T2, N> vec;\n _FOREACH_VECTOR(i, vec[i] = static_cast<T2>(_data[i]);)\n return vec;\n }\n\n template <typename T, size_t N>\n const T& Vector<T, N>::operator[](size_t i) const\n {\n return VectorData<T, N>::_data[i];\n }\n\n template <typename T, size_t N>\n T& Vector<T, N>::operator[](size_t i)\n {\n return _data[i];\n }\n\n template <typename T, size_t N>\n template <size_t i, typename U, typename... Args>\n void Vector<T, N>::_fill(const U& val, const Args&... rest)\n {\n _data[i] = val;\n _fill<i + 1>(rest...);\n }\n\n template <typename T, size_t N>\n template <size_t i, typename U>\n void Vector<T, N>::_fill(const U& val)\n {\n _data[i] = val;\n }\n}\n\n#endif\n<|endoftext|>"} {"text":"<commit_before>\/\/ Copyright (C) 2010-2012 Joshua Boyce.\r\n\/\/ See the file COPYING for copying permission.\r\n\r\n#pragma once\r\n\r\n#include <array>\r\n#include <memory>\r\n#include <string>\r\n#include <vector>\r\n#include <cassert>\r\n#include <cstddef>\r\n#include <exception>\r\n#include <type_traits>\r\n\r\n#include <windows.h>\r\n\r\n#include \"hadesmem\/error.hpp\"\r\n#include \"hadesmem\/protect.hpp\"\r\n#include \"hadesmem\/detail\/read_impl.hpp\"\r\n#include \"hadesmem\/detail\/type_traits.hpp\"\r\n#include \"hadesmem\/detail\/query_region.hpp\"\r\n#include \"hadesmem\/detail\/protect_guard.hpp\"\r\n#include \"hadesmem\/detail\/static_assert.hpp\"\r\n\r\nnamespace hadesmem\r\n{\r\n\r\nclass Process;\r\n\r\nnamespace detail\r\n{\r\n\r\ntemplate <typename T>\r\nT ReadUnchecked(Process const& process, PVOID address)\r\n{\r\n HADESMEM_STATIC_ASSERT(detail::IsTriviallyCopyable<T>::value);\r\n \r\n T data;\r\n ReadUnchecked(process, address, std::addressof(data), sizeof(data));\r\n return data;\r\n}\r\n\r\n}\r\n\r\ntemplate <typename T>\r\nT Read(Process const& process, PVOID address)\r\n{\r\n HADESMEM_STATIC_ASSERT(detail::IsTriviallyCopyable<T>::value);\r\n \r\n T data;\r\n detail::Read(process, address, std::addressof(data), sizeof(data));\r\n return data;\r\n}\r\n\r\ntemplate <typename T, std::size_t N>\r\nstd::array<T, N> Read(Process const& process, PVOID address)\r\n{\r\n HADESMEM_STATIC_ASSERT(detail::IsTriviallyCopyable<T>::value);\r\n\r\n HADESMEM_STATIC_ASSERT(detail::IsDefaultConstructible<T>::value);\r\n\r\n std::array<T, N> data;\r\n detail::Read(process, address, data.data(), sizeof(T) * N);\r\n return data;\r\n}\r\n\r\n\/\/ TODO: Clean up this function.\r\ntemplate <typename T>\r\nstd::basic_string<T> ReadString(Process const& process, PVOID address, \r\n std::size_t chunk_len = 128)\r\n{\r\n HADESMEM_STATIC_ASSERT(detail::IsCharType<T>::value);\r\n\r\n assert(chunk_len != 0);\r\n\r\n detail::ProtectGuard protect_guard(&process, address, \r\n detail::ProtectGuardType::kRead);\r\n\r\n std::basic_string<T> data;\r\n\r\n PBYTE cur_address = static_cast<PBYTE>(address);\r\n MEMORY_BASIC_INFORMATION const mbi = detail::Query(process, address);\r\n PBYTE const region_end = static_cast<PBYTE>(mbi.BaseAddress) + \r\n mbi.RegionSize;\r\n\r\n for (;;)\r\n {\r\n std::size_t cur_chunk_len = 0;\r\n std::size_t cur_chunk_size = 0;\r\n\r\n if (cur_address + (chunk_len * sizeof(T)) > region_end)\r\n {\r\n cur_chunk_size = reinterpret_cast<std::size_t>(region_end - \r\n reinterpret_cast<DWORD_PTR>(cur_address));\r\n cur_chunk_len = (cur_chunk_size - (cur_chunk_size % sizeof(T))) \/ \r\n sizeof(T);\r\n }\r\n else\r\n {\r\n cur_chunk_size = chunk_len * sizeof(T);\r\n cur_chunk_len = chunk_len;\r\n }\r\n\r\n std::vector<BYTE> buf(cur_chunk_size);\r\n detail::Read(process, cur_address, buf.data(), cur_chunk_size);\r\n\r\n T const* buf_beg = static_cast<T const*>(static_cast<void const*>(\r\n buf.data()));\r\n T const* buf_end = buf_beg + cur_chunk_len;\r\n for (T current = *buf_beg; current != T() && buf_beg != buf_end; \r\n current = *++buf_beg)\r\n {\r\n data.push_back(current);\r\n }\r\n\r\n if (buf_beg != buf_end || cur_address + cur_chunk_size == region_end)\r\n {\r\n break;\r\n }\r\n\r\n cur_address += cur_chunk_size;\r\n }\r\n\r\n protect_guard.Restore();\r\n\r\n return data;\r\n}\r\n\r\ntemplate <typename T>\r\nstd::vector<T> ReadVector(Process const& process, PVOID address, \r\n std::size_t size)\r\n{\r\n HADESMEM_STATIC_ASSERT(detail::IsTriviallyCopyable<T>::value);\r\n\r\n HADESMEM_STATIC_ASSERT(detail::IsDefaultConstructible<T>::value);\r\n \r\n std::vector<T> data(size);\r\n detail::Read(process, address, data.data(), sizeof(T) * size);\r\n return data;\r\n}\r\n\r\n}\r\n<commit_msg>* Clean up ReadString a bit.<commit_after>\/\/ Copyright (C) 2010-2012 Joshua Boyce.\r\n\/\/ See the file COPYING for copying permission.\r\n\r\n#pragma once\r\n\r\n#include <array>\r\n#include <memory>\r\n#include <string>\r\n#include <vector>\r\n#include <cassert>\r\n#include <cstddef>\r\n#include <exception>\r\n#include <type_traits>\r\n\r\n#include <windows.h>\r\n\r\n#include \"hadesmem\/error.hpp\"\r\n#include \"hadesmem\/protect.hpp\"\r\n#include \"hadesmem\/detail\/read_impl.hpp\"\r\n#include \"hadesmem\/detail\/type_traits.hpp\"\r\n#include \"hadesmem\/detail\/query_region.hpp\"\r\n#include \"hadesmem\/detail\/protect_guard.hpp\"\r\n#include \"hadesmem\/detail\/static_assert.hpp\"\r\n\r\nnamespace hadesmem\r\n{\r\n\r\nclass Process;\r\n\r\nnamespace detail\r\n{\r\n\r\ntemplate <typename T>\r\nT ReadUnchecked(Process const& process, PVOID address)\r\n{\r\n HADESMEM_STATIC_ASSERT(detail::IsTriviallyCopyable<T>::value);\r\n \r\n T data;\r\n ReadUnchecked(process, address, std::addressof(data), sizeof(data));\r\n return data;\r\n}\r\n\r\n}\r\n\r\ntemplate <typename T>\r\nT Read(Process const& process, PVOID address)\r\n{\r\n HADESMEM_STATIC_ASSERT(detail::IsTriviallyCopyable<T>::value);\r\n \r\n T data;\r\n detail::Read(process, address, std::addressof(data), sizeof(data));\r\n return data;\r\n}\r\n\r\ntemplate <typename T, std::size_t N>\r\nstd::array<T, N> Read(Process const& process, PVOID address)\r\n{\r\n HADESMEM_STATIC_ASSERT(detail::IsTriviallyCopyable<T>::value);\r\n\r\n HADESMEM_STATIC_ASSERT(detail::IsDefaultConstructible<T>::value);\r\n\r\n std::array<T, N> data;\r\n detail::Read(process, address, data.data(), sizeof(T) * N);\r\n return data;\r\n}\r\n\r\n\/\/ TODO: Rewrite majority of function to not depend on T, then move the logic \r\n\/\/ to an implementation file.\r\ntemplate <typename T>\r\nstd::basic_string<T> ReadString(Process const& process, PVOID address, \r\n std::size_t chunk_len = 128)\r\n{\r\n HADESMEM_STATIC_ASSERT(detail::IsCharType<T>::value);\r\n\r\n assert(chunk_len != 0);\r\n\r\n detail::ProtectGuard protect_guard(&process, address, \r\n detail::ProtectGuardType::kRead);\r\n\r\n std::basic_string<T> data;\r\n\r\n MEMORY_BASIC_INFORMATION const mbi = detail::Query(process, address);\r\n PVOID const region_end = static_cast<PBYTE>(mbi.BaseAddress) + \r\n mbi.RegionSize;\r\n\r\n T* cur = static_cast<T*>(address);\r\n while (cur + 1 < region_end)\r\n {\r\n std::size_t const len_to_end = reinterpret_cast<DWORD_PTR>(region_end) - \r\n reinterpret_cast<DWORD_PTR>(cur);\r\n std::size_t const buf_len_bytes = (std::min)(chunk_len * sizeof(T), \r\n len_to_end);\r\n std::size_t const buf_len = buf_len_bytes \/ sizeof(T);\r\n\r\n std::vector<T> buf(buf_len);\r\n detail::Read(process, cur, buf.data(), buf.size() * sizeof(T));\r\n\r\n auto const iter = std::find(std::begin(buf), std::end(buf), T());\r\n std::copy(std::begin(buf), iter, std::back_inserter(data));\r\n\r\n if (iter != std::end(buf))\r\n {\r\n protect_guard.Restore();\r\n return data;\r\n }\r\n\r\n cur += buf_len;\r\n }\r\n\r\n BOOST_THROW_EXCEPTION(Error() << \r\n ErrorString(\"Attempt to read across a region boundary.\"));\r\n}\r\n\r\ntemplate <typename T>\r\nstd::vector<T> ReadVector(Process const& process, PVOID address, \r\n std::size_t size)\r\n{\r\n HADESMEM_STATIC_ASSERT(detail::IsTriviallyCopyable<T>::value);\r\n\r\n HADESMEM_STATIC_ASSERT(detail::IsDefaultConstructible<T>::value);\r\n \r\n std::vector<T> data(size);\r\n detail::Read(process, address, data.data(), sizeof(T) * size);\r\n return data;\r\n}\r\n\r\n}\r\n<|endoftext|>"} {"text":"<commit_before>\/*\nCopyright 2011-2014 Rogier van Dalen.\n\nThis file is part of Rogier van Dalen's Range library for C++.\n\nThis library is free software: you can redistribute it and\/or modify\nit under the terms of the GNU General Public License as published by\nthe Free Software Foundation, either version 2 of the License, or\n(at your option) any later version.\n\nThis 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 General Public License for more details.\n\nYou should have received a copy of the GNU General Public License\nalong with this program. If not, see <http:\/\/www.gnu.org\/licenses\/>.\n*\/\n\n#ifndef RANGE_ITERATOR_RANGE_HPP_INCLUDED\n#define RANGE_ITERATOR_RANGE_HPP_INCLUDED\n\n#include <cassert>\n#include <iterator>\n#include <type_traits>\n\n#include <boost\/utility.hpp>\n#include <boost\/mpl\/if.hpp>\n#include <boost\/mpl\/and.hpp>\n\n#include \"utility\/returns.hpp\"\n\n#include \"core.hpp\"\n\nnamespace range {\n\n\/**\nRange that internally two iterators with the same type to denote its begin and\nend.\nThe type of iterator determines which operations are possible.\n\nThere is a sharp difference between an iterator_range based on input iterators\non the one hand, and forward iterators or higher on the other hand.\nAn iterator_range based on input iterators can not be copied.\nTherefore, it does not have a copy constructor; first() and drop() only take\nan rvalue, as does chop(), which is the most useful operation.\nAn iterator_range based on forward iterators can be copied without any problems.\n\ndefault_direction (range) just returns front.\n\nempty (range) is always defined.\n\nsize (range) is defined only for random-access iterators.\nThe result type of size (range) is the unsigned version of the distance between\ntwo iterators.\n\nfirst (front, range) is defined for all types of iterators; but\nfirst (back, range) is defined only for bidirectional iterators.\n\ndrop (front, range) is defined for input and forward iterators.\ndrop (back, range) is defined only for bidirectional iterators.\ndrop (front, n, range) and drop (back, n, range) are defined only for\nrandom-access iterators.\n\nThe code for operations on this class is worth looking at, because it\nembodies the difference between ranges and iterators.\nRanges only shrink, never grow.\nIn terms of the code, this means that \\c begin is only ever incremented, not\ndecremented, and \\c end is only ever decremented.\nAlso, ranges' ends are known, so it can be asserted that they are non-empty or\nhave at least a certain size for \\c first() and \\c drop().\nThis can be seen in the assertions.\n\n\\tparam Iterator\n The underlying iterator type.\n This must be an input iterator, or a forward iterator or higher.\n The things called \"output iterators\" are not supported.\n*\/\n\ntemplate <class Iterator, class Enable = void>\n class iterator_range;\n\nnamespace iterator_range_detail {\n\n \/**\n Base class for both iterator_range's that can be copied, and ones that\n can't.\n *\/\n template <class Iterator> class iterator_range_base {\n typedef typename std::iterator_traits <Iterator>::iterator_category\n iterator_tag;\n static_assert (\n std::is_base_of <std::input_iterator_tag, iterator_tag>::value ||\n std::is_base_of <std::forward_iterator_tag, iterator_tag>::value,\n \"The iterator must be an input iterator or a forward iterator.\");\n public:\n iterator_range_base (Iterator const & begin, Iterator const & end)\n : begin_ (begin), end_ (end) {}\n\n iterator_range_base() = default;\n\n iterator_range_base (iterator_range_base const &) = default;\n\n \/\/ Use any move or copy constructor available, to make sure that moving\n \/\/ is defined.\n iterator_range_base (iterator_range_base && that)\n : begin_ (std::move (that.begin())), end_ (std::move (that.end())) {}\n\n iterator_range_base & operator = (iterator_range_base const &)\n = default;\n\n iterator_range_base & operator = (iterator_range_base && that) {\n this->begin_ = std::move (that.begin());\n this->end_ = std::move (that.end());\n return *this;\n }\n\n Iterator const & begin() const { return begin_; }\n Iterator & begin() { return begin_; }\n\n Iterator const & end() const { return end_; }\n Iterator & end() { return end_; }\n\n private:\n Iterator begin_;\n Iterator end_;\n };\n\n} \/\/ namespace iterator_range_detail\n\n\/\/ Implementation for forward and higher iterators: copy is possible.\ntemplate <class Iterator>\n class iterator_range <Iterator, typename boost::enable_if <\n std::is_base_of <std::forward_iterator_tag, typename\n std::iterator_traits <Iterator>::iterator_category>\n >::type>\n: public iterator_range_detail::iterator_range_base <Iterator>\n{\n typedef iterator_range_detail::iterator_range_base <Iterator> base;\npublic:\n iterator_range() = default;\n iterator_range (iterator_range const &) = default;\n iterator_range (iterator_range &&) = default;\n\n iterator_range (Iterator const & begin, Iterator const & end)\n : base (begin, end) {}\n\n iterator_range & operator = (iterator_range const &) = default;\n iterator_range & operator = (iterator_range &&) = default;\n};\n\n\/\/ Implementation for input iterators: copy is not possible; move is.\ntemplate <class Iterator>\n class iterator_range <Iterator, typename boost::enable_if <\n boost::mpl::and_ <\n std::is_base_of <std::input_iterator_tag, typename\n std::iterator_traits <Iterator>::iterator_category>,\n boost::mpl::not_ <\n std::is_base_of <std::forward_iterator_tag, typename\n std::iterator_traits <Iterator>::iterator_category>>\n >>::type>\n: public iterator_range_detail::iterator_range_base <Iterator>\n{\n typedef iterator_range_detail::iterator_range_base <Iterator> base;\npublic:\n iterator_range() = default;\n \/\/ For input iterators, delete the copy constructor and provide only a\n \/\/ move constructor.\n iterator_range (iterator_range const &) = delete;\n iterator_range (iterator_range &&) = default;\n\n iterator_range (Iterator const & begin, Iterator const & end)\n : base (begin, end) {}\n\n iterator_range & operator = (iterator_range const &) = delete;\n iterator_range & operator = (iterator_range &&) = default;\n};\n\ntemplate <class IteratorTag, qualification qualifier>\n struct iterator_range_tag;\n\ntemplate <class Iterator, qualification qualifier>\n struct tag_of_qualified <iterator_range <Iterator>, qualifier>\n{\n typedef iterator_range_tag <typename\n std::iterator_traits <Iterator>::iterator_category, qualifier> type;\n};\n\nnamespace operation {\n\n \/\/ empty\n template <class IteratorTag, qualification qualifier>\n struct empty <iterator_range_tag <IteratorTag, qualifier>,\n direction::front>\n {\n template <class Range> bool operator() (\n direction::front, Range && range) const\n { return range.begin() == range.end(); }\n };\n\n \/\/ size\n template <class IteratorTag, qualification qualifier>\n struct size <iterator_range_tag <IteratorTag, qualifier>,\n direction::front,\n typename boost::enable_if <std::is_base_of <\n std::random_access_iterator_tag, IteratorTag>>::type>\n {\n \/\/ The distance type is usually signed.\n \/\/ However, we know that the size of the range is non-negative,\n \/\/ so we turn this into an unsigned type.\n template <class Iterator> struct unsigned_distance {\n typedef decltype (\n std::declval <Iterator>() - std::declval <Iterator>())\n distance_type;\n typedef typename std::make_unsigned <distance_type>::type type;\n };\n\n template <class Iterator>\n typename unsigned_distance <Iterator>::type operator() (\n direction::front, iterator_range <Iterator> const & range) const\n {\n auto distance = range.end() - range.begin();\n assert (distance >= 0);\n return typename unsigned_distance <Iterator>::type (distance);\n }\n };\n\n \/*\n first (front, range).\n This is defined explicitly for forward iterators.\n (Explain why that makes sense and chop is defined for input iterators.)\n *\/\n template <class IteratorTag, qualification qualifier>\n struct first <iterator_range_tag <IteratorTag, qualifier>,\n direction::front,\n typename boost::enable_if <std::is_base_of <\n std::forward_iterator_tag, IteratorTag>>::type>\n {\n template <class Range> auto operator() (\n direction::front, Range && range) const\n -> decltype (*range.begin())\n {\n assert (!::range::empty (range));\n return *range.begin();\n }\n };\n\n \/\/ first (back, range): only defined for bidirectional iterators.\n template <class IteratorTag, qualification qualifier>\n struct first <iterator_range_tag <IteratorTag, qualifier>,\n direction::back,\n typename boost::enable_if <std::is_base_of <\n std::bidirectional_iterator_tag, IteratorTag>>::type>\n {\n template <class Range> auto operator() (\n direction::back, Range && range) const\n -> decltype (*range.begin())\n {\n assert (!::range::empty (range));\n return *boost::prior (range.end());\n }\n };\n\n \/\/ drop (front, one, range): defined for forward iterators.\n template <class IteratorTag, qualification qualifier>\n struct drop_one <iterator_range_tag <IteratorTag, qualifier>,\n direction::front,\n typename boost::enable_if <std::is_base_of <\n std::forward_iterator_tag, IteratorTag>>::type>\n {\n template <class Increment, class Iterator>\n iterator_range <Iterator> operator() (\n direction::front, Increment const &,\n iterator_range <Iterator> const & range) const\n {\n assert (!::range::empty (range));\n return iterator_range <Iterator> (\n boost::next (range.begin()), range.end());\n }\n };\n\n \/\/ drop (back, one, range): only defined for bidirectional iterators.\n template <class IteratorTag, qualification qualifier>\n struct drop_one <iterator_range_tag <IteratorTag, qualifier>,\n direction::back,\n typename boost::enable_if <std::is_base_of <\n std::bidirectional_iterator_tag, IteratorTag>>::type>\n {\n template <class Increment, class Iterator>\n iterator_range <Iterator> operator() (\n direction::back, Increment const &,\n iterator_range <Iterator> const & range) const\n {\n assert (!::range::empty (range));\n return iterator_range <Iterator> (\n range.begin(), boost::prior (range.end()));\n }\n };\n\n \/\/ drop (front, n, range): only defined for random-access iterators.\n template <class IteratorTag, class Increment, qualification qualifier>\n struct drop <iterator_range_tag <IteratorTag, qualifier>,\n direction::front, Increment,\n typename boost::enable_if <std::is_base_of <\n std::random_access_iterator_tag, IteratorTag>>::type>\n {\n template <class Iterator> iterator_range <Iterator>\n operator() (direction::front, Increment const & increment,\n iterator_range <Iterator> const & range) const\n {\n assert (increment >= 0);\n typedef decltype (::range::size (range)) size_type;\n assert (size_type (increment) <= ::range::size (range));\n return iterator_range <Iterator> (\n range.begin() + increment, range.end());\n }\n };\n\n \/\/ drop (back, n, range): only defined for random-access iterators.\n template <class IteratorTag, class Increment, qualification qualifier>\n struct drop <iterator_range_tag <IteratorTag, qualifier>,\n direction::back, Increment,\n typename boost::enable_if <std::is_base_of <\n std::random_access_iterator_tag, IteratorTag>>::type>\n {\n template <class Iterator> iterator_range <Iterator>\n operator() (direction::back, Increment const & increment,\n iterator_range <Iterator> const & range) const\n {\n assert (increment >= 0);\n typedef decltype (::range::size (range)) size_type;\n assert (size_type (increment) <= ::range::size (range));\n return iterator_range <Iterator> (\n range.begin(), range.end() - increment);\n }\n };\n\n namespace iterator_range_detail {\n\n template <class Iterator> struct chop_element\n : boost::mpl::if_ <\n std::is_base_of <std::forward_iterator_tag,\n typename std::iterator_traits <Iterator>::iterator_category>,\n decltype (* std::declval <Iterator>() ++),\n typename std::iterator_traits <Iterator>::value_type> {};\n\n } \/\/ namespace iterator_range_detail\n\n \/*\n Input iterators need special handling.\n Dereferencing an input iterator returns something that can be convertible to\n the value_type, which may apparently become impossible to use after it is\n incremented.\n Therefore, it should be converted to the value type straight away.\n\n For forward iterators and up, this should not be a problem.\n The default implementation of \\a chop then works.\n\n This is only defined for rvalue ranges.\n *\/\n template <class IteratorTag>\n struct chop <iterator_range_tag <IteratorTag, temporary>,\n direction::front, typename boost::disable_if <std::is_base_of <\n std::forward_iterator_tag, IteratorTag>>::type>\n {\n template <class Iterator> struct result {\n typedef chopped <\n typename std::iterator_traits <Iterator>::value_type,\n iterator_range <Iterator>> type;\n };\n\n \/\/ rvalue range only.\n template <class Iterator>\n typename result <Iterator>::type\n operator() (direction::front, iterator_range <Iterator> && range)\n const\n {\n typedef typename std::iterator_traits <Iterator>::value_type\n value_type;\n value_type first = *range.begin() ++;\n return typename result <Iterator>::type (\n static_cast <value_type &&> (first), std::move (range));\n }\n };\n\n \/*\n The equivalent of chop_in_place is supplied automatically, but this is a\n more direct implementation.\n (Note that no performance improvements have been observed.)\n *\/\n template <class IteratorTag>\n struct chop_in_place <iterator_range_tag <IteratorTag, reference>,\n direction::front>\n {\n template <class Iterator>\n typename iterator_range_detail::chop_element <Iterator>::type\n operator() (direction::front const &,\n iterator_range <Iterator> & range) const\n { return * range.begin() ++; }\n };\n\n}} \/\/ namespace range::operation\n\n#endif \/\/ RANGE_ITERATOR_RANGE_HPP_INCLUDED\n<commit_msg>Improve iterator_range slightly<commit_after>\/*\nCopyright 2011-2014 Rogier van Dalen.\n\nThis file is part of Rogier van Dalen's Range library for C++.\n\nThis library is free software: you can redistribute it and\/or modify\nit under the terms of the GNU General Public License as published by\nthe Free Software Foundation, either version 2 of the License, or\n(at your option) any later version.\n\nThis 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 General Public License for more details.\n\nYou should have received a copy of the GNU General Public License\nalong with this program. If not, see <http:\/\/www.gnu.org\/licenses\/>.\n*\/\n\n#ifndef RANGE_ITERATOR_RANGE_HPP_INCLUDED\n#define RANGE_ITERATOR_RANGE_HPP_INCLUDED\n\n#include <cassert>\n#include <iterator>\n#include <type_traits>\n\n#include <boost\/utility.hpp>\n#include <boost\/mpl\/if.hpp>\n#include <boost\/mpl\/and.hpp>\n\n#include \"utility\/returns.hpp\"\n\n#include \"core.hpp\"\n\nnamespace range {\n\n\/**\nRange that internally contains two iterators with the same type to denote its\nbegin and end.\nThe type of iterator determines which operations are possible.\n\nThere is a sharp difference between an iterator_range based on input iterators\non the one hand, and forward iterators or higher on the other hand.\nAn iterator_range based on input iterators can not be copied.\nTherefore, it does not have a copy constructor; first() and drop() only take\nan rvalue, as does chop(), which is the most useful operation.\nAn iterator_range based on forward iterators can be copied without any problems.\n\ndefault_direction (range) just returns front.\n\nempty (range) is always defined.\n\nsize (range) is defined only for random-access iterators.\nThe result type of size (range) is the unsigned version of the distance between\ntwo iterators.\n\nfirst (front, range) is defined for all types of iterators; but\nfirst (back, range) is defined only for bidirectional iterators.\n\ndrop (front, range) is defined for input and forward iterators.\ndrop (back, range) is defined only for bidirectional iterators.\ndrop (front, n, range) and drop (back, n, range) are defined only for\nrandom-access iterators.\n\nThe code for operations on this class is worth looking at, because it\nembodies the difference between ranges and iterators.\nRanges only shrink, never grow.\nIn terms of the code, this means that \\c begin is only ever incremented, not\ndecremented, and \\c end is only ever decremented.\nAlso, ranges' ends are known, so it can be asserted that they are non-empty or\nhave at least a certain size for \\c first() and \\c drop().\nThis can be seen in the assertions.\n\n\\tparam Iterator\n The underlying iterator type.\n This must be an input iterator, or a forward iterator or higher.\n The things called \"output iterators\" are not supported.\n*\/\n\ntemplate <class Iterator, class Enable = void>\n class iterator_range;\n\nnamespace iterator_range_detail {\n\n \/**\n Base class for both iterator_range's that can be copied, and ones that\n can't.\n *\/\n template <class Iterator> class iterator_range_base {\n typedef typename std::iterator_traits <Iterator>::iterator_category\n iterator_tag;\n static_assert (\n std::is_base_of <std::input_iterator_tag, iterator_tag>::value ||\n std::is_base_of <std::forward_iterator_tag, iterator_tag>::value,\n \"The iterator must be an input iterator or a forward iterator.\");\n public:\n typedef Iterator iterator_type;\n\n typedef typename std::make_unsigned <typename\n std::iterator_traits <Iterator>::difference_type>::type size_type;\n\n typedef typename std::iterator_traits <Iterator>::value_type value_type;\n\n iterator_range_base (Iterator const & begin, Iterator const & end)\n : begin_ (begin), end_ (end) {}\n\n iterator_range_base() = default;\n\n iterator_range_base (iterator_range_base const &) = default;\n\n \/\/ Use any move or copy constructor available, to make sure that moving\n \/\/ is defined.\n iterator_range_base (iterator_range_base && that)\n : begin_ (std::move (that.begin())), end_ (std::move (that.end())) {}\n\n iterator_range_base & operator = (iterator_range_base const &)\n = default;\n\n iterator_range_base & operator = (iterator_range_base && that) {\n this->begin_ = std::move (that.begin());\n this->end_ = std::move (that.end());\n return *this;\n }\n\n Iterator const & begin() const { return begin_; }\n Iterator & begin() { return begin_; }\n\n Iterator const & end() const { return end_; }\n Iterator & end() { return end_; }\n\n private:\n Iterator begin_;\n Iterator end_;\n };\n\n} \/\/ namespace iterator_range_detail\n\n\/\/ Implementation for forward and higher iterators: copy is possible.\ntemplate <class Iterator>\n class iterator_range <Iterator, typename boost::enable_if <\n std::is_base_of <std::forward_iterator_tag, typename\n std::iterator_traits <Iterator>::iterator_category>\n >::type>\n: public iterator_range_detail::iterator_range_base <Iterator>\n{\n typedef iterator_range_detail::iterator_range_base <Iterator> base;\npublic:\n iterator_range() = default;\n iterator_range (iterator_range const &) = default;\n iterator_range (iterator_range &&) = default;\n\n iterator_range (Iterator const & begin, Iterator const & end)\n : base (begin, end) {}\n\n iterator_range & operator = (iterator_range const &) = default;\n iterator_range & operator = (iterator_range &&) = default;\n};\n\n\/\/ Implementation for input iterators: copy is not possible; move is.\ntemplate <class Iterator>\n class iterator_range <Iterator, typename boost::enable_if <\n boost::mpl::and_ <\n std::is_base_of <std::input_iterator_tag, typename\n std::iterator_traits <Iterator>::iterator_category>,\n boost::mpl::not_ <\n std::is_base_of <std::forward_iterator_tag, typename\n std::iterator_traits <Iterator>::iterator_category>>\n >>::type>\n: public iterator_range_detail::iterator_range_base <Iterator>\n{\n typedef iterator_range_detail::iterator_range_base <Iterator> base;\npublic:\n iterator_range() = default;\n \/\/ For input iterators, delete the copy constructor and provide only a\n \/\/ move constructor.\n iterator_range (iterator_range const &) = delete;\n iterator_range (iterator_range &&) = default;\n\n iterator_range (Iterator const & begin, Iterator const & end)\n : base (begin, end) {}\n\n iterator_range & operator = (iterator_range const &) = delete;\n iterator_range & operator = (iterator_range &&) = default;\n};\n\ntemplate <class IteratorTag, qualification qualifier>\n struct iterator_range_tag;\n\ntemplate <class Iterator, qualification qualifier>\n struct tag_of_qualified <iterator_range <Iterator>, qualifier>\n{\n typedef iterator_range_tag <typename\n std::iterator_traits <Iterator>::iterator_category, qualifier> type;\n};\n\nnamespace operation {\n\n \/\/ empty\n template <class IteratorTag, qualification qualifier>\n struct empty <iterator_range_tag <IteratorTag, qualifier>,\n direction::front>\n {\n template <class Range> bool operator() (\n direction::front, Range const & range) const\n { return range.begin() == range.end(); }\n };\n\n \/\/ size\n template <class IteratorTag, qualification qualifier>\n struct size <iterator_range_tag <IteratorTag, qualifier>,\n direction::front,\n typename boost::enable_if <std::is_base_of <\n std::random_access_iterator_tag, IteratorTag>>::type>\n {\n template <class Iterator>\n typename iterator_range <Iterator>::size_type operator() (\n direction::front, iterator_range <Iterator> const & range) const\n {\n auto distance = range.end() - range.begin();\n assert (distance >= 0);\n return typename iterator_range <Iterator>::size_type (distance);\n }\n };\n\n \/*\n first (front, range).\n This is defined explicitly for forward iterators.\n (Explain why that makes sense and chop is defined for input iterators.)\n *\/\n template <class IteratorTag, qualification qualifier>\n struct first <iterator_range_tag <IteratorTag, qualifier>,\n direction::front,\n typename boost::enable_if <std::is_base_of <\n std::forward_iterator_tag, IteratorTag>>::type>\n {\n template <class Range> auto operator() (\n direction::front, Range const & range) const\n -> decltype (*range.begin())\n {\n assert (!::range::empty (range));\n return *range.begin();\n }\n };\n\n \/\/ first (back, range): only defined for bidirectional iterators.\n template <class IteratorTag, qualification qualifier>\n struct first <iterator_range_tag <IteratorTag, qualifier>,\n direction::back,\n typename boost::enable_if <std::is_base_of <\n std::bidirectional_iterator_tag, IteratorTag>>::type>\n {\n template <class Range> auto operator() (\n direction::back, Range const & range) const\n -> decltype (*range.begin())\n {\n assert (!::range::empty (range));\n return *boost::prior (range.end());\n }\n };\n\n \/\/ drop (front, one, range): defined for forward iterators.\n template <class IteratorTag, qualification qualifier>\n struct drop_one <iterator_range_tag <IteratorTag, qualifier>,\n direction::front,\n typename boost::enable_if <std::is_base_of <\n std::forward_iterator_tag, IteratorTag>>::type>\n {\n template <class Increment, class Iterator>\n iterator_range <Iterator> operator() (\n direction::front, Increment const &,\n iterator_range <Iterator> const & range) const\n {\n assert (!::range::empty (range));\n return iterator_range <Iterator> (\n boost::next (range.begin()), range.end());\n }\n };\n\n \/\/ drop (back, one, range): only defined for bidirectional iterators.\n template <class IteratorTag, qualification qualifier>\n struct drop_one <iterator_range_tag <IteratorTag, qualifier>,\n direction::back,\n typename boost::enable_if <std::is_base_of <\n std::bidirectional_iterator_tag, IteratorTag>>::type>\n {\n template <class Increment, class Iterator>\n iterator_range <Iterator> operator() (\n direction::back, Increment const &,\n iterator_range <Iterator> const & range) const\n {\n assert (!::range::empty (range));\n return iterator_range <Iterator> (\n range.begin(), boost::prior (range.end()));\n }\n };\n\n \/\/ drop (front, n, range): only defined for random-access iterators.\n template <class IteratorTag, class Increment, qualification qualifier>\n struct drop <iterator_range_tag <IteratorTag, qualifier>,\n direction::front, Increment,\n typename boost::enable_if <std::is_base_of <\n std::random_access_iterator_tag, IteratorTag>>::type>\n {\n template <class Iterator> iterator_range <Iterator>\n operator() (direction::front, Increment const & increment_,\n iterator_range <Iterator> const & range) const\n {\n typename iterator_range <Iterator>::size_type\n increment (increment_);\n assert (increment >= 0);\n assert (increment <= ::range::size (range));\n return iterator_range <Iterator> (\n range.begin() + increment, range.end());\n }\n };\n\n \/\/ drop (back, n, range): only defined for random-access iterators.\n template <class IteratorTag, class Increment, qualification qualifier>\n struct drop <iterator_range_tag <IteratorTag, qualifier>,\n direction::back, Increment,\n typename boost::enable_if <std::is_base_of <\n std::random_access_iterator_tag, IteratorTag>>::type>\n {\n template <class Iterator> iterator_range <Iterator>\n operator() (direction::back, Increment const & increment_,\n iterator_range <Iterator> const & range) const\n {\n typename iterator_range <Iterator>::size_type\n increment (increment_);\n assert (increment >= 0);\n assert (increment <= ::range::size (range));\n return iterator_range <Iterator> (\n range.begin(), range.end() - increment);\n }\n };\n\n namespace iterator_range_detail {\n\n template <class Iterator> struct chop_element\n : boost::mpl::if_ <\n std::is_base_of <std::forward_iterator_tag,\n typename std::iterator_traits <Iterator>::iterator_category>,\n decltype (* std::declval <Iterator>() ++),\n typename std::iterator_traits <Iterator>::value_type> {};\n\n } \/\/ namespace iterator_range_detail\n\n \/*\n Input iterators need special handling.\n Dereferencing an input iterator returns something that can be convertible to\n the value_type, which may apparently become impossible to use after it is\n incremented.\n Therefore, it should be converted to the value type straight away.\n\n For forward iterators and up, this should not be a problem.\n The default implementation of \\a chop then works.\n\n This is only defined for rvalue ranges.\n *\/\n template <class IteratorTag>\n struct chop <iterator_range_tag <IteratorTag, temporary>,\n direction::front, typename boost::disable_if <std::is_base_of <\n std::forward_iterator_tag, IteratorTag>>::type>\n {\n template <class IteratorRange> struct result {\n typedef chopped <typename IteratorRange::value_type, IteratorRange>\n type;\n };\n\n \/\/ rvalue range only.\n template <class Iterator>\n typename result <iterator_range <Iterator>>::type\n operator() (direction::front, iterator_range <Iterator> && range)\n const\n {\n typedef typename iterator_range <Iterator>::value_type value_type;\n value_type first = *range.begin() ++;\n return typename result <iterator_range <Iterator>>::type (\n static_cast <value_type &&> (first), std::move (range));\n }\n };\n\n \/*\n The equivalent of chop_in_place is supplied automatically, but this is a\n more direct implementation.\n (Note that no performance improvements have been observed.)\n *\/\n template <class IteratorTag>\n struct chop_in_place <iterator_range_tag <IteratorTag, reference>,\n direction::front>\n {\n template <class Iterator>\n typename iterator_range_detail::chop_element <Iterator>::type\n operator() (direction::front const &,\n iterator_range <Iterator> & range) const\n { return * range.begin() ++; }\n };\n\n}} \/\/ namespace range::operation\n\n#endif \/\/ RANGE_ITERATOR_RANGE_HPP_INCLUDED\n<|endoftext|>"} {"text":"<commit_before>\/\/============================================================================\n\/\/ include\/vsmc\/utility\/cstring.hpp\n\/\/----------------------------------------------------------------------------\n\/\/\n\/\/ vSMC: Scalable Monte Carlo\n\/\/\n\/\/ This file is distributed under the 2-clauses BSD License.\n\/\/ See LICENSE for details.\n\/\/============================================================================\n\n#ifndef VSMC_UTILITY_CSTRING_HPP\n#define VSMC_UTILITY_CSTRING_HPP\n\n#include <vsmc\/internal\/common.hpp>\n#include <vsmc\/utility\/cpuid.hpp>\n\n\/\/\/ \\brief Shall functions in this module do runtime dispatch\n\/\/\/ \\ingroup Config\n#ifndef VSMC_CSTRING_RUNTIME_DISPACH\n#define VSMC_CSTRING_RUNTIME_DISPACH 0\n#endif\n\n#ifdef __SSE2__\n#include <emmintrin.h>\n\n#define VSMC_DEFINE_UTILITY_CSTRING_MEMCPY_SSE2(da, sa, nt, store, load) \\\ntemplate <> \\\ninline void *memcpy_sse2<da, sa, nt> ( \\\n void *dst, const void *src, std::size_t n) \\\n{ \\\n double *dstd = static_cast<double *>(dst); \\\n const double *srcd = static_cast<const double *>(src); \\\n \\\n std::size_t nm = n \/ 32; \\\n for (std::size_t i = 0; i != nm; ++i, dstd += 4, srcd += 4) { \\\n __m128d m1 = _mm_##load##_pd(srcd); \\\n __m128d m2 = _mm_##load##_pd(srcd + 2); \\\n _mm_##store##_pd(dstd, m1); \\\n _mm_##store##_pd(dstd + 2, m2); \\\n } \\\n internal::memcpy_generic(dstd, srcd, n % 32); \\\n \\\n return dst; \\\n}\n\n#endif \/\/ __SSE2__\n\n#ifdef __AVX__\n#include <immintrin.h>\n\n#define VSMC_DEFINE_UTILITY_CSTRING_MEMCPY_AVX(da, sa, nt, store, load) \\\ntemplate <> \\\ninline void *memcpy_avx<da, sa, nt> ( \\\n void *dst, const void *src, std::size_t n) \\\n{ \\\n double *dstd = static_cast<double *>(dst); \\\n const double *srcd = static_cast<const double *>(src); \\\n \\\n std::size_t nm = n \/ 64; \\\n for (std::size_t i = 0; i != nm; ++i, dstd += 8, srcd += 8) { \\\n __m256d m1 = _mm256_##load##_pd(srcd); \\\n __m256d m2 = _mm256_##load##_pd(srcd + 4); \\\n _mm256_##store##_pd(dstd, m1); \\\n _mm256_##store##_pd(dstd + 4, m2); \\\n } \\\n internal::memcpy_generic(dstd, srcd, n % 64); \\\n \\\n return dst; \\\n}\n\n#endif \/\/ __AVX__\n\n#define VSMC_DEFINE_UTILITY_CSTRING_MEMCPY(align, small, SIMD, simd) \\\ninline unsigned memcpy_is_aligned_##simd (const void *ptr) \\\n{return reinterpret_cast<uintptr_t>(ptr) % align == 0 ? 1 : 0;} \\\n \\\ntemplate <bool, bool, bool> \\\ninline void *memcpy_##simd (void *, const void *, std::size_t); \\\n \\\nVSMC_DEFINE_UTILITY_CSTRING_MEMCPY_##SIMD(true, true, true, stream, load) \\\nVSMC_DEFINE_UTILITY_CSTRING_MEMCPY_##SIMD(true, false, true, stream, loadu)\\\nVSMC_DEFINE_UTILITY_CSTRING_MEMCPY_##SIMD(true, true, false, store, load) \\\nVSMC_DEFINE_UTILITY_CSTRING_MEMCPY_##SIMD(true, false, false, store, loadu)\\\nVSMC_DEFINE_UTILITY_CSTRING_MEMCPY_##SIMD(false, true, false, storeu, load) \\\nVSMC_DEFINE_UTILITY_CSTRING_MEMCPY_##SIMD(false, false, false, storeu, loadu)\\\n \\\ninline void *memcpy_##simd (void *dst, const void *src, std::size_t n) \\\n{ \\\n if (n < small) \\\n return internal::memcpy_generic(dst, src, n); \\\n \\\n unsigned flag_nt = CStringNonTemporalThreshold::instance().over(n); \\\n unsigned flag_dst = internal::memcpy_is_aligned_##simd(dst); \\\n unsigned flag_src = internal::memcpy_is_aligned_##simd(src); \\\n unsigned flag = (flag_dst << 2) | (flag_src << 1) | (flag_nt & flag_dst);\\\n \\\n switch (flag) { \\\n case 7 : return memcpy_##simd<true, true, true >(dst, src, n); \\\n case 5 : return memcpy_##simd<true, false, true >(dst, src, n); \\\n case 6 : return memcpy_##simd<true, true, false>(dst, src, n); \\\n case 4 : return memcpy_##simd<true, false, false>(dst, src, n); \\\n case 2 : return memcpy_##simd<false, true, false>(dst, src, n); \\\n default : return memcpy_##simd<false, false, false>(dst, src, n); \\\n } \\\n}\n\nnamespace vsmc {\n\n\/\/\/ \\brief The threshold of buffer size above which `memcpy` use non-temporal\n\/\/\/ instructions.\n\/\/\/ \\ingroup CString\nclass CStringNonTemporalThreshold\n{\n public :\n\n \/\/\/ \\brief Singleton instance\n \/\/\/\n \/\/\/ \\note If any `memcpy` functions in this module is to be called from\n \/\/\/ multiple thread, then this member function need to be called at least\n \/\/\/ once before entering threads.\n static CStringNonTemporalThreshold &instance ()\n {\n static CStringNonTemporalThreshold ntt;\n\n return ntt;\n }\n\n \/\/\/ \\brief Set the threshold to default\n \/\/\/\n \/\/\/ \\details\n \/\/\/ By default, we set a pretty high threshold (the LLC size).\n void set ()\n {\n unsigned max_ecx = CPUID::max_cache_index();\n if (max_ecx >= 3)\n threshold_ = CPUID::cache_param(3).size();\n else if (max_ecx >= 2)\n threshold_ = CPUID::cache_param(2).size();\n else\n threshold_ = 1UL << 18; \/\/ 256K\n }\n\n \/\/\/ \\brief Set the threshold to a specific size\n void set (std::size_t threshold) {threshold_ = threshold;}\n\n \/\/\/ \\brief Get the threshold\n std::size_t get () const {return threshold_;}\n\n \/\/\/ \\brief Give number of bytes, return flag indicate if it is over the\n \/\/\/ threshold\n unsigned over (std::size_t n) const {return n > threshold_ ? 1 : 0;}\n\n private :\n\n std::size_t threshold_;\n\n CStringNonTemporalThreshold () : threshold_(0) {set();}\n\n CStringNonTemporalThreshold (const CStringNonTemporalThreshold &);\n\n CStringNonTemporalThreshold &operator= (\n const CStringNonTemporalThreshold &);\n}; \/\/ class CStringNonTemporalThreshold\n\nnamespace internal {\n\ninline void *memcpy_char (void *dst, const void *src, std::size_t n)\n{\n char *dstc = static_cast<char *>(dst);\n const char *srcc = static_cast<const char *>(src);\n for (std::size_t i = 0; i != n; ++i, ++dstc, ++srcc)\n *dstc = *srcc;\n\n return dst;\n}\n\ninline void *memcpy_generic (void *dst, const void *src, std::size_t n)\n{\n double *dstd = static_cast<double *>(dst);\n const double *srcd = static_cast<const double *>(src);\n std::size_t nd = n \/ 8;\n for (std::size_t i = 0; i != nd; ++i, ++dstd, ++srcd)\n *dstd = *srcd;\n memcpy_char(dstd, srcd, n % 8);\n\n return dst;\n}\n\n#ifdef __SSE2__\nVSMC_DEFINE_UTILITY_CSTRING_MEMCPY(16, 32, SSE2, sse2)\n#endif\n\n#ifdef __AVX__\nVSMC_DEFINE_UTILITY_CSTRING_MEMCPY(32, 64, AVX, avx)\n#endif\n\nclass CStringRuntimeDispatch\n{\n public :\n\n static CStringRuntimeDispatch &instance ()\n {\n static CStringRuntimeDispatch dispatch;\n\n return dispatch;\n }\n\n void *memcpy (void *dst, const void *src, std::size_t n) const\n {return memcpy_(dst, src, n);}\n\n private :\n\n void *(*memcpy_) (void *, const void *, std::size_t);\n\n CStringRuntimeDispatch ()\n {\n#ifdef __AVX__\n if (CPUID::has_feature<CPUIDFeatureAVX>()) {\n memcpy_ = memcpy_avx;\n\n return;\n }\n#endif\n\n#ifdef __SSE2__\n if (CPUID::has_feature<CPUIDFeatureSSE2>()) {\n memcpy_ = memcpy_sse2;\n\n return;\n }\n#endif\n\n memcpy_ = memcpy_generic;\n }\n\n CStringRuntimeDispatch (const CStringRuntimeDispatch &);\n\n CStringRuntimeDispatch &operator= (const CStringRuntimeDispatch &);\n}; \/\/ class CStringRuntimeDispatc\n\n} \/\/ namespace vsmc::internal\n\n\/\/\/ \\brief SIMD optimized `memcpy` with non-temporal store for large buffers\n\/\/\/ \\ingroup CString\ninline void *memcpy (void *dst, const void *src, std::size_t n)\n{\n#if VSMC_CSTRING_RUNTIME_DISPATCH\n return internal::CStringRuntimeDispatch::instance().memcpy(dst, src, n);\n#else\n#if defined(__AVX__)\n return internal::memcpy_avx(dst, src, n);\n#elif defined(__SSE2__)\n return internal::memcpy_sse2(dst, src, n);\n#else\n return internal::memcpy_generic(dst, src, n);\n#endif\n#endif\n}\n\n} \/\/ namespace vsmc\n\n#endif \/\/ VSMC_UTILITY_CSTRING_HPP\n<commit_msg>zeroupper before leaving AVX memcpy<commit_after>\/\/============================================================================\n\/\/ include\/vsmc\/utility\/cstring.hpp\n\/\/----------------------------------------------------------------------------\n\/\/\n\/\/ vSMC: Scalable Monte Carlo\n\/\/\n\/\/ This file is distributed under the 2-clauses BSD License.\n\/\/ See LICENSE for details.\n\/\/============================================================================\n\n#ifndef VSMC_UTILITY_CSTRING_HPP\n#define VSMC_UTILITY_CSTRING_HPP\n\n#include <vsmc\/internal\/common.hpp>\n#include <vsmc\/utility\/cpuid.hpp>\n\n\/\/\/ \\brief Shall functions in this module do runtime dispatch\n\/\/\/ \\ingroup Config\n#ifndef VSMC_CSTRING_RUNTIME_DISPACH\n#define VSMC_CSTRING_RUNTIME_DISPACH 0\n#endif\n\n#ifdef __SSE2__\n#include <emmintrin.h>\n\n#define VSMC_DEFINE_UTILITY_CSTRING_MEMCPY_SSE2(da, sa, nt, store, load) \\\ntemplate <> \\\ninline void *memcpy_sse2<da, sa, nt> ( \\\n void *dst, const void *src, std::size_t n) \\\n{ \\\n double *dstd = static_cast<double *>(dst); \\\n const double *srcd = static_cast<const double *>(src); \\\n \\\n std::size_t nm = n \/ 32; \\\n for (std::size_t i = 0; i != nm; ++i, dstd += 4, srcd += 4) { \\\n __m128d m1 = _mm_##load##_pd(srcd); \\\n __m128d m2 = _mm_##load##_pd(srcd + 2); \\\n _mm_##store##_pd(dstd, m1); \\\n _mm_##store##_pd(dstd + 2, m2); \\\n } \\\n internal::memcpy_generic(dstd, srcd, n % 32); \\\n \\\n return dst; \\\n}\n\n#endif \/\/ __SSE2__\n\n#ifdef __AVX__\n#include <immintrin.h>\n\n#define VSMC_DEFINE_UTILITY_CSTRING_MEMCPY_AVX(da, sa, nt, store, load) \\\ntemplate <> \\\ninline void *memcpy_avx<da, sa, nt> ( \\\n void *dst, const void *src, std::size_t n) \\\n{ \\\n double *dstd = static_cast<double *>(dst); \\\n const double *srcd = static_cast<const double *>(src); \\\n \\\n std::size_t nm = n \/ 64; \\\n for (std::size_t i = 0; i != nm; ++i, dstd += 8, srcd += 8) { \\\n __m256d m1 = _mm256_##load##_pd(srcd); \\\n __m256d m2 = _mm256_##load##_pd(srcd + 4); \\\n _mm256_##store##_pd(dstd, m1); \\\n _mm256_##store##_pd(dstd + 4, m2); \\\n } \\\n internal::memcpy_generic(dstd, srcd, n % 64); \\\n _mm256_zeroupper(); \\\n \\\n return dst; \\\n}\n\n#endif \/\/ __AVX__\n\n#define VSMC_DEFINE_UTILITY_CSTRING_MEMCPY(align, small, SIMD, simd) \\\ninline unsigned memcpy_is_aligned_##simd (const void *ptr) \\\n{return reinterpret_cast<uintptr_t>(ptr) % align == 0 ? 1 : 0;} \\\n \\\ntemplate <bool, bool, bool> \\\ninline void *memcpy_##simd (void *, const void *, std::size_t); \\\n \\\nVSMC_DEFINE_UTILITY_CSTRING_MEMCPY_##SIMD(true, true, true, stream, load) \\\nVSMC_DEFINE_UTILITY_CSTRING_MEMCPY_##SIMD(true, false, true, stream, loadu)\\\nVSMC_DEFINE_UTILITY_CSTRING_MEMCPY_##SIMD(true, true, false, store, load) \\\nVSMC_DEFINE_UTILITY_CSTRING_MEMCPY_##SIMD(true, false, false, store, loadu)\\\nVSMC_DEFINE_UTILITY_CSTRING_MEMCPY_##SIMD(false, true, false, storeu, load) \\\nVSMC_DEFINE_UTILITY_CSTRING_MEMCPY_##SIMD(false, false, false, storeu, loadu)\\\n \\\ninline void *memcpy_##simd (void *dst, const void *src, std::size_t n) \\\n{ \\\n if (n < small) \\\n return internal::memcpy_generic(dst, src, n); \\\n \\\n unsigned flag_nt = CStringNonTemporalThreshold::instance().over(n); \\\n unsigned flag_dst = internal::memcpy_is_aligned_##simd(dst); \\\n unsigned flag_src = internal::memcpy_is_aligned_##simd(src); \\\n unsigned flag = (flag_dst << 2) | (flag_src << 1) | (flag_nt & flag_dst);\\\n \\\n switch (flag) { \\\n case 7 : return memcpy_##simd<true, true, true >(dst, src, n); \\\n case 5 : return memcpy_##simd<true, false, true >(dst, src, n); \\\n case 6 : return memcpy_##simd<true, true, false>(dst, src, n); \\\n case 4 : return memcpy_##simd<true, false, false>(dst, src, n); \\\n case 2 : return memcpy_##simd<false, true, false>(dst, src, n); \\\n default : return memcpy_##simd<false, false, false>(dst, src, n); \\\n } \\\n}\n\nnamespace vsmc {\n\n\/\/\/ \\brief The threshold of buffer size above which `memcpy` use non-temporal\n\/\/\/ instructions.\n\/\/\/ \\ingroup CString\nclass CStringNonTemporalThreshold\n{\n public :\n\n \/\/\/ \\brief Singleton instance\n \/\/\/\n \/\/\/ \\note If any `memcpy` functions in this module is to be called from\n \/\/\/ multiple thread, then this member function need to be called at least\n \/\/\/ once before entering threads.\n static CStringNonTemporalThreshold &instance ()\n {\n static CStringNonTemporalThreshold ntt;\n\n return ntt;\n }\n\n \/\/\/ \\brief Set the threshold to default\n \/\/\/\n \/\/\/ \\details\n \/\/\/ By default, we set a pretty high threshold (the LLC size).\n void set ()\n {\n unsigned max_ecx = CPUID::max_cache_index();\n if (max_ecx >= 3)\n threshold_ = CPUID::cache_param(3).size();\n else if (max_ecx >= 2)\n threshold_ = CPUID::cache_param(2).size();\n else\n threshold_ = 1UL << 18; \/\/ 256K\n }\n\n \/\/\/ \\brief Set the threshold to a specific size\n void set (std::size_t threshold) {threshold_ = threshold;}\n\n \/\/\/ \\brief Get the threshold\n std::size_t get () const {return threshold_;}\n\n \/\/\/ \\brief Give number of bytes, return flag indicate if it is over the\n \/\/\/ threshold\n unsigned over (std::size_t n) const {return n > threshold_ ? 1 : 0;}\n\n private :\n\n std::size_t threshold_;\n\n CStringNonTemporalThreshold () : threshold_(0) {set();}\n\n CStringNonTemporalThreshold (const CStringNonTemporalThreshold &);\n\n CStringNonTemporalThreshold &operator= (\n const CStringNonTemporalThreshold &);\n}; \/\/ class CStringNonTemporalThreshold\n\nnamespace internal {\n\ninline void *memcpy_char (void *dst, const void *src, std::size_t n)\n{\n char *dstc = static_cast<char *>(dst);\n const char *srcc = static_cast<const char *>(src);\n for (std::size_t i = 0; i != n; ++i, ++dstc, ++srcc)\n *dstc = *srcc;\n\n return dst;\n}\n\ninline void *memcpy_generic (void *dst, const void *src, std::size_t n)\n{\n double *dstd = static_cast<double *>(dst);\n const double *srcd = static_cast<const double *>(src);\n std::size_t nd = n \/ 8;\n for (std::size_t i = 0; i != nd; ++i, ++dstd, ++srcd)\n *dstd = *srcd;\n memcpy_char(dstd, srcd, n % 8);\n\n return dst;\n}\n\n#ifdef __SSE2__\nVSMC_DEFINE_UTILITY_CSTRING_MEMCPY(16, 32, SSE2, sse2)\n#endif\n\n#ifdef __AVX__\nVSMC_DEFINE_UTILITY_CSTRING_MEMCPY(32, 64, AVX, avx)\n#endif\n\nclass CStringRuntimeDispatch\n{\n public :\n\n static CStringRuntimeDispatch &instance ()\n {\n static CStringRuntimeDispatch dispatch;\n\n return dispatch;\n }\n\n void *memcpy (void *dst, const void *src, std::size_t n) const\n {return memcpy_(dst, src, n);}\n\n private :\n\n void *(*memcpy_) (void *, const void *, std::size_t);\n\n CStringRuntimeDispatch ()\n {\n#ifdef __AVX__\n if (CPUID::has_feature<CPUIDFeatureAVX>()) {\n memcpy_ = memcpy_avx;\n\n return;\n }\n#endif\n\n#ifdef __SSE2__\n if (CPUID::has_feature<CPUIDFeatureSSE2>()) {\n memcpy_ = memcpy_sse2;\n\n return;\n }\n#endif\n\n memcpy_ = memcpy_generic;\n }\n\n CStringRuntimeDispatch (const CStringRuntimeDispatch &);\n\n CStringRuntimeDispatch &operator= (const CStringRuntimeDispatch &);\n}; \/\/ class CStringRuntimeDispatc\n\n} \/\/ namespace vsmc::internal\n\n\/\/\/ \\brief SIMD optimized `memcpy` with non-temporal store for large buffers\n\/\/\/ \\ingroup CString\ninline void *memcpy (void *dst, const void *src, std::size_t n)\n{\n#if VSMC_CSTRING_RUNTIME_DISPATCH\n return internal::CStringRuntimeDispatch::instance().memcpy(dst, src, n);\n#else\n#if defined(__AVX__)\n return internal::memcpy_avx(dst, src, n);\n#elif defined(__SSE2__)\n return internal::memcpy_sse2(dst, src, n);\n#else\n return internal::memcpy_generic(dst, src, n);\n#endif\n#endif\n}\n\n} \/\/ namespace vsmc\n\n#endif \/\/ VSMC_UTILITY_CSTRING_HPP\n<|endoftext|>"} {"text":"<commit_before>#include \"classificator_loader.hpp\"\n#include \"classificator.hpp\"\n#include \"drawing_rules.hpp\"\n\n#include \"..\/defines.hpp\"\n\n#include \"..\/platform\/platform.hpp\"\n\n#include \"..\/coding\/reader_streambuf.hpp\"\n\n#include \"..\/base\/logging.hpp\"\n\n#include \"..\/std\/fstream.hpp\"\n\n\nnamespace classificator\n{\n void ReadCommon(Reader * classificator,\n Reader * visibility,\n Reader * types)\n {\n Classificator & c = classif();\n c.Clear();\n\n {\n \/\/LOG(LINFO, (\"Reading classificator\"));\n ReaderStreamBuf buffer(classificator);\n\n istream s(&buffer);\n c.ReadClassificator(s);\n }\n\n {\n \/\/LOG(LINFO, (\"Reading visibility\"));\n ReaderStreamBuf buffer(visibility);\n\n istream s(&buffer);\n c.ReadVisibility(s);\n }\n\n {\n \/\/LOG(LINFO, (\"Reading types mapping\"));\n ReaderStreamBuf buffer(types);\n\n istream s(&buffer);\n c.ReadTypesMapping(s);\n }\n }\n\n void ReadVisibility(string const & fPath)\n {\n ifstream s(fPath.c_str());\n classif().ReadVisibility(s);\n }\n\n void Load()\n {\n LOG(LINFO, (\"Reading of classificator started\"));\n\n Platform & p = GetPlatform();\n\n ReadCommon(p.GetReader(\"classificator.txt\"),\n p.GetReader(\"visibility.txt\"),\n p.GetReader(\"types.txt\"));\n\n \/\/LOG(LINFO, (\"Reading of drawing rules\"));\n drule::RulesHolder & rules = drule::rules();\n\n try\n {\n \/\/ Load from protobuffer binary file.\n ReaderStreamBuf buffer(p.GetReader(DRAWING_RULES_BIN_FILE));\n\n istream s(&buffer);\n rules.LoadFromBinaryProto(s);\n }\n catch (Reader::OpenException const &)\n {\n try\n {\n \/\/ Load from protobuffer text file.\n string buffer;\n ModelReaderPtr(p.GetReader(DRAWING_RULES_TXT_FILE)).ReadAsString(buffer);\n\n rules.LoadFromTextProto(buffer);\n }\n catch (Reader::OpenException const &)\n {\n LOG(LERROR, (\"No drawing rules found\"));\n }\n }\n\n LOG(LINFO, (\"Reading of classificator finished\"));\n }\n}\n<commit_msg>Do not halt when drules_proto.bin is absent. Reading drules_proto.txt.<commit_after>#include \"classificator_loader.hpp\"\n#include \"classificator.hpp\"\n#include \"drawing_rules.hpp\"\n\n#include \"..\/defines.hpp\"\n\n#include \"..\/platform\/platform.hpp\"\n\n#include \"..\/coding\/reader_streambuf.hpp\"\n\n#include \"..\/base\/logging.hpp\"\n\n#include \"..\/std\/fstream.hpp\"\n\n\nnamespace classificator\n{\n void ReadCommon(Reader * classificator,\n Reader * visibility,\n Reader * types)\n {\n Classificator & c = classif();\n c.Clear();\n\n {\n \/\/LOG(LINFO, (\"Reading classificator\"));\n ReaderStreamBuf buffer(classificator);\n\n istream s(&buffer);\n c.ReadClassificator(s);\n }\n\n {\n \/\/LOG(LINFO, (\"Reading visibility\"));\n ReaderStreamBuf buffer(visibility);\n\n istream s(&buffer);\n c.ReadVisibility(s);\n }\n\n {\n \/\/LOG(LINFO, (\"Reading types mapping\"));\n ReaderStreamBuf buffer(types);\n\n istream s(&buffer);\n c.ReadTypesMapping(s);\n }\n }\n\n void ReadVisibility(string const & fPath)\n {\n ifstream s(fPath.c_str());\n classif().ReadVisibility(s);\n }\n\n void Load()\n {\n LOG(LINFO, (\"Reading of classificator started\"));\n\n Platform & p = GetPlatform();\n\n ReadCommon(p.GetReader(\"classificator.txt\"),\n p.GetReader(\"visibility.txt\"),\n p.GetReader(\"types.txt\"));\n\n \/\/LOG(LINFO, (\"Reading of drawing rules\"));\n drule::RulesHolder & rules = drule::rules();\n\n try\n {\n \/\/ Load from proto buffer binary file.\n ReaderStreamBuf buffer(p.GetReader(DRAWING_RULES_BIN_FILE));\n\n istream s(&buffer);\n rules.LoadFromBinaryProto(s);\n }\n catch (FileAbsentException const &)\n {\n \/\/ Load from proto buffer text file.\n string buffer;\n ModelReaderPtr(p.GetReader(DRAWING_RULES_TXT_FILE)).ReadAsString(buffer);\n\n rules.LoadFromTextProto(buffer);\n }\n\n LOG(LINFO, (\"Reading of classificator finished\"));\n }\n}\n<|endoftext|>"} {"text":"<commit_before>#include <string>\n\n#include \"pbfgraphbuilder.h\"\n#include \"mjolnir\/graphbuilder.h\"\n#include \"config.h\"\n\n\/\/ For OSM pbf reader\nusing namespace valhalla::mjolnir;\n\n#include <ostream>\n#include <boost\/program_options.hpp>\n#include <boost\/filesystem\/operations.hpp>\n#include <boost\/property_tree\/ptree.hpp>\n#include <boost\/property_tree\/json_parser.hpp>\n\n#include <valhalla\/midgard\/point2.h>\n#include <valhalla\/midgard\/aabb2.h>\n#include <valhalla\/midgard\/polyline2.h>\n\nnamespace bpo = boost::program_options;\nusing namespace valhalla::midgard;\n\nboost::filesystem::path config_file_path;\nstd::string input_file;\n\nbool ParseArguments(int argc, char *argv[]) {\n\n bpo::options_description options(\n \"pbfgraphbuilder \" VERSION \"\\n\"\n \"\\n\"\n \" Usage: pbfgraphbuilder [options] <protocolbuffer_input_file>\\n\"\n \"\\n\"\n \"pbfgraphbuilder is a program that creates the route graph from a osm.pbf \"\n \"extract or osm2pgsql import. You should use the lua scripts provided for \"\n \"either method. The scripts are located in the .\/import\/osm2pgsql directory. \"\n \"Moreover, sample json cofigs are located in .\/import\/configs directory.\"\n \"\\n\"\n \"\\n\");\n\n options.add_options()\n (\"help,h\", \"Print this help message.\")\n (\"version,v\", \"Print the version of this software.\")\n (\"config,c\",\n boost::program_options::value<boost::filesystem::path>(&config_file_path)->required(),\n \"Path to the json configuration file.\")\n \/\/ positional arguments\n (\"input_file\", boost::program_options::value<std::string>(&input_file));\n\n bpo::positional_options_description pos_options;\n pos_options.add(\"input_file\", 1);\n\n bpo::variables_map vm;\n try {\n bpo::store(bpo::command_line_parser(argc, argv).options(options).positional(pos_options).run(), vm);\n bpo::notify(vm);\n\n } catch (std::exception &e) {\n std::cerr << \"Unable to parse command line options because: \" << e.what()\n << \"\\n\" << \"This is a bug, please report it at \" PACKAGE_BUGREPORT\n << \"\\n\";\n return false;\n }\n\n if (vm.count(\"help\")) {\n std::cout << options << \"\\n\";\n return true;\n }\n\n if (vm.count(\"version\")) {\n std::cout << \"pbfgraphbuilder \" << VERSION << \"\\n\";\n return true;\n }\n\n if (vm.count(\"config\")) {\n if (boost::filesystem::is_regular_file(config_file_path))\n return true;\n else\n std::cerr << \"Configuration file is required\\n\\n\" << options << \"\\n\\n\";\n }\n\n return false;\n}\n\n\nint main(int argc, char** argv) {\n\n if (!ParseArguments(argc, argv))\n return EXIT_FAILURE;\n\n \/\/check what type of input we are getting\n boost::property_tree::ptree pt;\n boost::property_tree::read_json(config_file_path.c_str(), pt);\n std::string input_type = pt.get<std::string>(\"input.type\");\n\n std::cout << \"Sizeof Edge = \" << sizeof(Edge) << std::endl;\n\n \/\/we only support protobuf at present\n if(input_type == \"protocolbuffer\"){\n \/\/ Read the OSM protocol buffer file. Callbacks for nodes, ways, and\n \/\/ relations are defined within the GraphConstructor class\n GraphBuilder graphbuilder(pt, input_file);\n graphbuilder.Build();\n }\/*else if(\"postgres\"){\n \/\/TODO\n if (v.first == \"host\")\n host = v.second.get_value<std::string>();\n else if (v.first == \"port\")\n port = v.second.get_value<unsigned int>();\n else if (v.first == \"username\")\n username = v.second.get_value<std::string>();\n else if (v.first == \"password\")\n password = v.second.get_value<std::string>();\n else\n return false; \/\/unknown value;\n }*\/\n\n return EXIT_SUCCESS;\n}\n\n<commit_msg>Remove cout statement<commit_after>#include <string>\n\n#include \"pbfgraphbuilder.h\"\n#include \"mjolnir\/graphbuilder.h\"\n#include \"config.h\"\n\n\/\/ For OSM pbf reader\nusing namespace valhalla::mjolnir;\n\n#include <ostream>\n#include <boost\/program_options.hpp>\n#include <boost\/filesystem\/operations.hpp>\n#include <boost\/property_tree\/ptree.hpp>\n#include <boost\/property_tree\/json_parser.hpp>\n\n#include <valhalla\/midgard\/point2.h>\n#include <valhalla\/midgard\/aabb2.h>\n#include <valhalla\/midgard\/polyline2.h>\n\nnamespace bpo = boost::program_options;\nusing namespace valhalla::midgard;\n\nboost::filesystem::path config_file_path;\nstd::string input_file;\n\nbool ParseArguments(int argc, char *argv[]) {\n\n bpo::options_description options(\n \"pbfgraphbuilder \" VERSION \"\\n\"\n \"\\n\"\n \" Usage: pbfgraphbuilder [options] <protocolbuffer_input_file>\\n\"\n \"\\n\"\n \"pbfgraphbuilder is a program that creates the route graph from a osm.pbf \"\n \"extract or osm2pgsql import. You should use the lua scripts provided for \"\n \"either method. The scripts are located in the .\/import\/osm2pgsql directory. \"\n \"Moreover, sample json cofigs are located in .\/import\/configs directory.\"\n \"\\n\"\n \"\\n\");\n\n options.add_options()\n (\"help,h\", \"Print this help message.\")\n (\"version,v\", \"Print the version of this software.\")\n (\"config,c\",\n boost::program_options::value<boost::filesystem::path>(&config_file_path)->required(),\n \"Path to the json configuration file.\")\n \/\/ positional arguments\n (\"input_file\", boost::program_options::value<std::string>(&input_file));\n\n bpo::positional_options_description pos_options;\n pos_options.add(\"input_file\", 1);\n\n bpo::variables_map vm;\n try {\n bpo::store(bpo::command_line_parser(argc, argv).options(options).positional(pos_options).run(), vm);\n bpo::notify(vm);\n\n } catch (std::exception &e) {\n std::cerr << \"Unable to parse command line options because: \" << e.what()\n << \"\\n\" << \"This is a bug, please report it at \" PACKAGE_BUGREPORT\n << \"\\n\";\n return false;\n }\n\n if (vm.count(\"help\")) {\n std::cout << options << \"\\n\";\n return true;\n }\n\n if (vm.count(\"version\")) {\n std::cout << \"pbfgraphbuilder \" << VERSION << \"\\n\";\n return true;\n }\n\n if (vm.count(\"config\")) {\n if (boost::filesystem::is_regular_file(config_file_path))\n return true;\n else\n std::cerr << \"Configuration file is required\\n\\n\" << options << \"\\n\\n\";\n }\n\n return false;\n}\n\n\nint main(int argc, char** argv) {\n\n if (!ParseArguments(argc, argv))\n return EXIT_FAILURE;\n\n \/\/check what type of input we are getting\n boost::property_tree::ptree pt;\n boost::property_tree::read_json(config_file_path.c_str(), pt);\n std::string input_type = pt.get<std::string>(\"input.type\");\n\n \/\/we only support protobuf at present\n if(input_type == \"protocolbuffer\"){\n \/\/ Read the OSM protocol buffer file. Callbacks for nodes, ways, and\n \/\/ relations are defined within the GraphConstructor class\n GraphBuilder graphbuilder(pt, input_file);\n graphbuilder.Build();\n }\/*else if(\"postgres\"){\n \/\/TODO\n if (v.first == \"host\")\n host = v.second.get_value<std::string>();\n else if (v.first == \"port\")\n port = v.second.get_value<unsigned int>();\n else if (v.first == \"username\")\n username = v.second.get_value<std::string>();\n else if (v.first == \"password\")\n password = v.second.get_value<std::string>();\n else\n return false; \/\/unknown value;\n }*\/\n\n return EXIT_SUCCESS;\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#include <swtypes.hxx>\n#include <wordcountdialog.hxx>\n#include <docstat.hxx>\n#include <dialog.hrc>\n#include <cmdid.h>\n#include <swmodule.hxx>\n#include <wview.hxx>\n#include <swwait.hxx>\n#include <wrtsh.hxx>\n#include <comphelper\/string.hxx>\n#include <sfx2\/viewfrm.hxx>\n#include <svl\/cjkoptions.hxx>\n#include <vcl\/msgbox.hxx>\n\nIMPL_LINK_NOARG(SwWordCountFloatDlg, CloseHdl)\n{ \n SfxViewFrame* pVFrame = ::GetActiveView()->GetViewFrame();\n if (pVFrame != NULL)\n {\n pVFrame->ToggleChildWindow(FN_WORDCOUNT_DIALOG);\n }\n return 0;\n}\n\nSwWordCountFloatDlg::~SwWordCountFloatDlg()\n{\n ViewShell::SetCareWin( 0 );\n}\n\nnamespace\n{\n void setValue(FixedText *pWidget, sal_uLong nValue)\n {\n rtl::OUString sValue(rtl::OUString::valueOf(static_cast<sal_Int64>(nValue)));\n pWidget->SetText(sValue);\n }\n}\n\nvoid SwWordCountFloatDlg::SetValues(const SwDocStat& rCurrent, const SwDocStat& rDoc)\n{\n setValue(m_pCurrentWordFT, rCurrent.nWord);\n setValue(m_pCurrentCharacterFT, rCurrent.nChar);\n setValue(m_pCurrentCharacterExcludingSpacesFT, rCurrent.nCharExcludingSpaces);\n setValue(m_pCurrentCjkcharsFT, rCurrent.nAsianWord);\n setValue(m_pDocWordFT, rDoc.nWord);\n setValue(m_pDocCharacterFT, rDoc.nChar);\n setValue(m_pDocCharacterExcludingSpacesFT, rDoc.nCharExcludingSpaces);\n setValue(m_pDocCjkcharsFT, rDoc.nAsianWord);\n\n bool bShowCJK = (SvtCJKOptions().IsAnyEnabled() || rDoc.nAsianWord);\n bool bToggleCJK = m_pCurrentCjkcharsFT->IsVisible() != bShowCJK;\n if (bToggleCJK)\n {\n showCJK(bShowCJK);\n setInitialLayoutSize(); \/\/force resize of dialog\n }\n}\n\nvoid SwWordCountFloatDlg::showCJK(bool bShowCJK)\n{\n m_pCurrentCjkcharsFT->Show(bShowCJK);\n m_pDocCjkcharsFT->Show(bShowCJK);\n m_pCjkcharsLabelFT->Show(bShowCJK);\n}\n\nSwWordCountFloatDlg::SwWordCountFloatDlg(SfxBindings* _pBindings,\n SfxChildWindow* pChild,\n Window *pParent,\n SfxChildWinInfo* pInfo)\n : SfxModelessDialog(_pBindings, pChild, pParent, \"WordCountDialog\", \"modules\/swriter\/ui\/wordcount.ui\")\n{\n get(m_pCurrentWordFT, \"selectwords\");\n get(m_pCurrentCharacterFT, \"selectchars\");\n get(m_pCurrentCharacterExcludingSpacesFT, \"selectcharsnospaces\");\n get(m_pCurrentCjkcharsFT, \"selectcjkchars\");\n\n get(m_pDocWordFT, \"docwords\");\n get(m_pDocCharacterFT, \"docchars\");\n get(m_pDocCharacterExcludingSpacesFT, \"doccharsnospaces\");\n get(m_pDocCjkcharsFT, \"doccjkchars\");\n\n get(m_pCjkcharsLabelFT, \"cjkcharsft\");\n\n get(m_pClosePB, \"close\");\n\n long nPrefWidth = m_pCurrentWordFT->get_preferred_size().Width();\n\n m_pCurrentWordFT->set_width_request(nPrefWidth);\n m_pCurrentCharacterFT->set_width_request(nPrefWidth);\n m_pCurrentCharacterExcludingSpacesFT->set_width_request(nPrefWidth);\n m_pCurrentCjkcharsFT->set_width_request(nPrefWidth);\n m_pDocWordFT->set_width_request(nPrefWidth);\n m_pDocCharacterFT->set_width_request(nPrefWidth);\n m_pDocCharacterExcludingSpacesFT->set_width_request(nPrefWidth);\n m_pDocCjkcharsFT->set_width_request(nPrefWidth);\n\n showCJK(SvtCJKOptions().IsAnyEnabled());\n\n Initialize(pInfo);\n\n m_pClosePB->SetClickHdl(LINK(this, SwWordCountFloatDlg, CloseHdl));\n m_pClosePB->GrabFocus();\n}\n\nvoid SwWordCountFloatDlg::Activate()\n{\n SfxModelessDialog::Activate();\n}\n\nvoid SwWordCountFloatDlg::UpdateCounts()\n{\n SwWrtShell &rSh = ::GetActiveView()->GetWrtShell();\n SwDocStat aCurrCnt;\n SwDocStat aDocStat;\n {\n SwWait aWait( *::GetActiveView()->GetDocShell(), sal_True );\n rSh.StartAction();\n rSh.CountWords( aCurrCnt );\n aDocStat = rSh.GetUpdatedDocStat();\n rSh.EndAction();\n }\n SetValues(aCurrCnt, aDocStat);\n}\n\nvoid SwWordCountFloatDlg::SetCounts(const SwDocStat &rCurrCnt, const SwDocStat &rDocStat)\n{\n SetValues(rCurrCnt, rDocStat);\n}\n\n\/* vim:set shiftwidth=4 softtabstop=4 expandtab: *\/\n<commit_msg>warning C4805: '!=': unsafe mix of bool and sal_Bool<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 <swtypes.hxx>\n#include <wordcountdialog.hxx>\n#include <docstat.hxx>\n#include <dialog.hrc>\n#include <cmdid.h>\n#include <swmodule.hxx>\n#include <wview.hxx>\n#include <swwait.hxx>\n#include <wrtsh.hxx>\n#include <comphelper\/string.hxx>\n#include <sfx2\/viewfrm.hxx>\n#include <svl\/cjkoptions.hxx>\n#include <vcl\/msgbox.hxx>\n\nIMPL_LINK_NOARG(SwWordCountFloatDlg, CloseHdl)\n{ \n SfxViewFrame* pVFrame = ::GetActiveView()->GetViewFrame();\n if (pVFrame != NULL)\n {\n pVFrame->ToggleChildWindow(FN_WORDCOUNT_DIALOG);\n }\n return 0;\n}\n\nSwWordCountFloatDlg::~SwWordCountFloatDlg()\n{\n ViewShell::SetCareWin( 0 );\n}\n\nnamespace\n{\n void setValue(FixedText *pWidget, sal_uLong nValue)\n {\n rtl::OUString sValue(rtl::OUString::valueOf(static_cast<sal_Int64>(nValue)));\n pWidget->SetText(sValue);\n }\n}\n\nvoid SwWordCountFloatDlg::SetValues(const SwDocStat& rCurrent, const SwDocStat& rDoc)\n{\n setValue(m_pCurrentWordFT, rCurrent.nWord);\n setValue(m_pCurrentCharacterFT, rCurrent.nChar);\n setValue(m_pCurrentCharacterExcludingSpacesFT, rCurrent.nCharExcludingSpaces);\n setValue(m_pCurrentCjkcharsFT, rCurrent.nAsianWord);\n setValue(m_pDocWordFT, rDoc.nWord);\n setValue(m_pDocCharacterFT, rDoc.nChar);\n setValue(m_pDocCharacterExcludingSpacesFT, rDoc.nCharExcludingSpaces);\n setValue(m_pDocCjkcharsFT, rDoc.nAsianWord);\n\n bool bShowCJK = (SvtCJKOptions().IsAnyEnabled() || rDoc.nAsianWord);\n bool bToggleCJK = m_pCurrentCjkcharsFT->IsVisible() != static_cast<sal_Bool>(bShowCJK);\n if (bToggleCJK)\n {\n showCJK(bShowCJK);\n setInitialLayoutSize(); \/\/force resize of dialog\n }\n}\n\nvoid SwWordCountFloatDlg::showCJK(bool bShowCJK)\n{\n m_pCurrentCjkcharsFT->Show(bShowCJK);\n m_pDocCjkcharsFT->Show(bShowCJK);\n m_pCjkcharsLabelFT->Show(bShowCJK);\n}\n\nSwWordCountFloatDlg::SwWordCountFloatDlg(SfxBindings* _pBindings,\n SfxChildWindow* pChild,\n Window *pParent,\n SfxChildWinInfo* pInfo)\n : SfxModelessDialog(_pBindings, pChild, pParent, \"WordCountDialog\", \"modules\/swriter\/ui\/wordcount.ui\")\n{\n get(m_pCurrentWordFT, \"selectwords\");\n get(m_pCurrentCharacterFT, \"selectchars\");\n get(m_pCurrentCharacterExcludingSpacesFT, \"selectcharsnospaces\");\n get(m_pCurrentCjkcharsFT, \"selectcjkchars\");\n\n get(m_pDocWordFT, \"docwords\");\n get(m_pDocCharacterFT, \"docchars\");\n get(m_pDocCharacterExcludingSpacesFT, \"doccharsnospaces\");\n get(m_pDocCjkcharsFT, \"doccjkchars\");\n\n get(m_pCjkcharsLabelFT, \"cjkcharsft\");\n\n get(m_pClosePB, \"close\");\n\n long nPrefWidth = m_pCurrentWordFT->get_preferred_size().Width();\n\n m_pCurrentWordFT->set_width_request(nPrefWidth);\n m_pCurrentCharacterFT->set_width_request(nPrefWidth);\n m_pCurrentCharacterExcludingSpacesFT->set_width_request(nPrefWidth);\n m_pCurrentCjkcharsFT->set_width_request(nPrefWidth);\n m_pDocWordFT->set_width_request(nPrefWidth);\n m_pDocCharacterFT->set_width_request(nPrefWidth);\n m_pDocCharacterExcludingSpacesFT->set_width_request(nPrefWidth);\n m_pDocCjkcharsFT->set_width_request(nPrefWidth);\n\n showCJK(SvtCJKOptions().IsAnyEnabled());\n\n Initialize(pInfo);\n\n m_pClosePB->SetClickHdl(LINK(this, SwWordCountFloatDlg, CloseHdl));\n m_pClosePB->GrabFocus();\n}\n\nvoid SwWordCountFloatDlg::Activate()\n{\n SfxModelessDialog::Activate();\n}\n\nvoid SwWordCountFloatDlg::UpdateCounts()\n{\n SwWrtShell &rSh = ::GetActiveView()->GetWrtShell();\n SwDocStat aCurrCnt;\n SwDocStat aDocStat;\n {\n SwWait aWait( *::GetActiveView()->GetDocShell(), sal_True );\n rSh.StartAction();\n rSh.CountWords( aCurrCnt );\n aDocStat = rSh.GetUpdatedDocStat();\n rSh.EndAction();\n }\n SetValues(aCurrCnt, aDocStat);\n}\n\nvoid SwWordCountFloatDlg::SetCounts(const SwDocStat &rCurrCnt, const SwDocStat &rDocStat)\n{\n SetValues(rCurrCnt, rDocStat);\n}\n\n\/* vim:set shiftwidth=4 softtabstop=4 expandtab: *\/\n<|endoftext|>"} {"text":"<commit_before>\/***************************************************************************\n**\n** Copyright (C) 2010 Nokia Corporation and\/or its subsidiary(-ies).\n** All rights reserved.\n** Contact: Nokia Corporation (directui@nokia.com)\n**\n** This file is part of mcompositor.\n**\n** If you have questions regarding the use of this file, please contact\n** Nokia at directui@nokia.com.\n**\n** This library is free software; you can redistribute it and\/or\n** modify it under the terms of the GNU Lesser General Public\n** License version 2.1 as published by the Free Software Foundation\n** and appearing in the file LICENSE.LGPL included in the packaging\n** of this file.\n**\n****************************************************************************\/\n\n#define GLX_GLXEXT_PROTOTYPES 1\n#define GLX_EXT_texture_from_pixmap 1\n\n#include \"mtexturepixmapitem.h\"\n#include \"mtexturepixmapitem_p.h\"\n\n#include <QPainterPath>\n#include <QRect>\n#include <QGLContext>\n#include <QX11Info>\n#include <vector>\n\n#include <X11\/Xlib.h>\n#include <X11\/extensions\/Xcomposite.h>\n#include <X11\/extensions\/Xrender.h>\n\n#include <GL\/gl.h>\n#include <GL\/glu.h>\n#include <GL\/glx.h>\n#include <GL\/glxext.h>\n\n#if defined(GLX_VERSION_1_3)\n#ifndef GLX_TEXTURE_2D_BIT_EXT\n#define GLX_TEXTURE_2D_BIT_EXT 0x00000002\n#define GLX_TEXTURE_RECTANGLE_BIT_EXT 0x00000004\n#define GLX_BIND_TO_TEXTURE_RGB_EXT 0x20D0\n#define GLX_BIND_TO_TEXTURE_RGBA_EXT 0x20D1\n#define GLX_BIND_TO_MIPMAP_TEXTURE_EXT 0x20D2\n#define GLX_BIND_TO_TEXTURE_TARGETS_EXT 0x20D3\n#define GLX_Y_INVERTED_EXT 0x20D4\n#define GLX_TEXTURE_FORMAT_EXT 0x20D5\n#define GLX_TEXTURE_TARGET_EXT 0x20D6\n#define GLX_MIPMAP_TEXTURE_EXT 0x20D7\n#define GLX_TEXTURE_FORMAT_NONE_EXT 0x20D8\n#define GLX_TEXTURE_FORMAT_RGB_EXT 0x20D9\n#define GLX_TEXTURE_FORMAT_RGBA_EXT 0x20DA\n#define GLX_TEXTURE_2D_EXT 0x20DC\n#define GLX_TEXTURE_RECTANGLE_EXT 0x20DD\n#define GLX_FRONT_LEFT_EXT 0x20DE\n#endif\n\ntypedef void (*_glx_bind)(Display *, GLXDrawable, int , const int *);\ntypedef void (*_glx_release)(Display *, GLXDrawable, int);\nstatic _glx_bind glXBindTexImageEXT = 0;\nstatic _glx_release glXReleaseTexImageEXT = 0;\nstatic GLXFBConfig config = 0;\nstatic GLXFBConfig configAlpha = 0;\n\nstatic bool hasTextureFromPixmap()\n{\n static bool hasTfp = false;\n\n if (!hasTfp) {\n hasTfp = true;\n\n QList<QByteArray> exts = QByteArray(glXQueryExtensionsString(QX11Info::display(), QX11Info::appScreen())).split(' ');\n if (exts.contains(\"GLX_EXT_texture_from_pixmap\")) {\n glXBindTexImageEXT = (_glx_bind) glXGetProcAddress((const GLubyte *)\"glXBindTexImageEXT\");\n glXReleaseTexImageEXT = (_glx_release) glXGetProcAddress((const GLubyte *)\"glXReleaseTexImageEXT\");\n }\n }\n return glXBindTexImageEXT && glXReleaseTexImageEXT;\n}\n#endif\n\nvoid MTexturePixmapItem::init()\n{\n MWindowPropertyCache *pc = propertyCache();\n if (isValid() && !pc->isMapped()) {\n qWarning(\"MTexturePixmapItem::%s(): Failed getting offscreen pixmap\",\n __func__);\n return;\n } else if (!isValid()) \n return;\n\n d->glpixmap = 0;\n\n d->custom_tfp = !hasTextureFromPixmap();\n saveBackingStore();\n\n if (d->custom_tfp) {\n initCustomTfp();\n return;\n }\n const int pixmapAttribs[] = {\n GLX_TEXTURE_TARGET_EXT, GLX_TEXTURE_2D_EXT,\n GLX_TEXTURE_FORMAT_EXT, propertyCache()->hasAlpha() ?\n GLX_TEXTURE_FORMAT_RGBA_EXT : GLX_TEXTURE_FORMAT_RGB_EXT,\n None\n };\n\n if ((!pc->hasAlpha() && !config) || (pc->hasAlpha() && !configAlpha)) {\n Display *display = QX11Info::display();\n int screen = QX11Info::appScreen();\n\n int pixmap_config[] = {\n pc->hasAlpha() ? GLX_BIND_TO_TEXTURE_RGBA_EXT :\n GLX_BIND_TO_TEXTURE_RGB_EXT, True,\n GLX_DRAWABLE_TYPE, GLX_PIXMAP_BIT,\n GLX_BIND_TO_TEXTURE_TARGETS_EXT, GLX_TEXTURE_2D_BIT_EXT,\n GLX_DOUBLEBUFFER, True,\n GLX_Y_INVERTED_EXT, GLX_DONT_CARE,\n None\n };\n\n int c = 0;\n GLXFBConfig *configs = 0;\n configs = glXChooseFBConfig(display, screen, pixmap_config, &c);\n if (!configs) {\n qWarning(\"No appropriate GLXFBconfig found!\"\n \"Falling back to custom texture to pixmap \");\n d->custom_tfp = true;\n initCustomTfp();\n return;\n }\n\n int inverted;\n glXGetFBConfigAttrib(display, configs[0], GLX_Y_INVERTED_EXT, &inverted);\n if (pc->hasAlpha()) {\n configAlpha = configs[0];\n d->inverted_texture = inverted ? true : false;\n } else {\n config = configs[0];\n d->inverted_texture = inverted ? true : false;\n }\n XFree(configs);\n }\n\n glGenTextures(1, &d->textureId);\n glEnable(GL_TEXTURE_2D);\n glBindTexture(GL_TEXTURE_2D, d->textureId);\n d->glpixmap = glXCreatePixmap(QX11Info::display(), pc->hasAlpha() ?\n configAlpha : config, d->windowp, pixmapAttribs);\n\n glTexParameteri(GL_TEXTURE_2D, GL_TEXTURE_MAG_FILTER, GL_LINEAR);\n glTexParameteri(GL_TEXTURE_2D, GL_TEXTURE_MIN_FILTER, GL_LINEAR);\n\n glTexParameteri(GL_TEXTURE_2D, GL_TEXTURE_WRAP_S, GL_CLAMP_TO_EDGE);\n glTexParameteri(GL_TEXTURE_2D, GL_TEXTURE_WRAP_T, GL_CLAMP_TO_EDGE);\n\n glXBindTexImageEXT(QX11Info::display(), d->glpixmap, GLX_FRONT_LEFT_EXT, NULL);\n}\n\nMTexturePixmapItem::MTexturePixmapItem(Window window,\n MWindowPropertyCache *pc,\n QGraphicsItem *parent)\n : MCompositeWindow(window, pc, parent),\n d(new MTexturePixmapPrivate(window, this))\n{\n init();\n}\n\nvoid MTexturePixmapItem::saveBackingStore()\n{\n d->saveBackingStore();\n}\n\nvoid MTexturePixmapItem::rebindPixmap()\n{\n const int pixmapAttribs[] = {\n GLX_TEXTURE_TARGET_EXT, GLX_TEXTURE_2D_EXT,\n GLX_TEXTURE_FORMAT_EXT, propertyCache()->hasAlpha() ?\n GLX_TEXTURE_FORMAT_RGBA_EXT : GLX_TEXTURE_FORMAT_RGB_EXT,\n None\n };\n\n if (!d->custom_tfp) {\n Display *display = QX11Info::display();\n glXReleaseTexImageEXT(display, d->glpixmap, GLX_FRONT_LEFT_EXT);\n glXDestroyPixmap(display, d->glpixmap);\n d->glpixmap = glXCreatePixmap(display, propertyCache()->hasAlpha() ?\n configAlpha : config,\n d->windowp, pixmapAttribs);\n glBindTexture(GL_TEXTURE_2D, d->textureId);\n glXBindTexImageEXT(display, d->glpixmap, GLX_FRONT_LEFT_EXT, NULL);\n }\n}\n\nvoid MTexturePixmapItem::enableDirectFbRendering()\n{\n if (d->item->propertyCache())\n d->item->propertyCache()->damageTracking(false);\n\n if ((d->direct_fb_render || d->glpixmap == 0) && !d->custom_tfp)\n return;\n\n d->direct_fb_render = true;\n \/\/ Just free the off-screen surface but re-use the\n \/\/ existing texture id, so don't delete it yet.\n\n if (!d->custom_tfp) {\n glXReleaseTexImageEXT(QX11Info::display(), d->glpixmap, GLX_FRONT_LEFT_EXT);\n glXDestroyPixmap(QX11Info::display(), d->glpixmap);\n d->glpixmap = 0;\n }\n\n if (d->windowp) {\n XFreePixmap(QX11Info::display(), d->windowp);\n d->windowp = 0;\n }\n XCompositeUnredirectWindow(QX11Info::display(), window(),\n CompositeRedirectManual);\n XSync(QX11Info::display(), FALSE);\n}\n\nvoid MTexturePixmapItem::enableRedirectedRendering()\n{\n if (d->item->propertyCache())\n d->item->propertyCache()->damageTracking(true);\n\n if ((!d->direct_fb_render || d->glpixmap != 0) && !d->custom_tfp)\n return;\n\n d->direct_fb_render = false;\n XCompositeRedirectWindow(QX11Info::display(), window(),\n CompositeRedirectManual);\n XSync(QX11Info::display(), FALSE);\n saveBackingStore();\n updateWindowPixmap();\n}\n\nbool MTexturePixmapItem::isDirectRendered() const\n{\n return d->direct_fb_render;\n}\n\nMTexturePixmapItem::~MTexturePixmapItem()\n{\n cleanup();\n delete d;\n}\n\nvoid MTexturePixmapItem::initCustomTfp()\n{\n glGenTextures(1, &d->ctextureId);\n\n glBindTexture(GL_TEXTURE_2D, d->ctextureId);\n glTexParameteri(GL_TEXTURE_2D, GL_TEXTURE_MIN_FILTER, GL_LINEAR);\n glTexParameteri(GL_TEXTURE_2D, GL_TEXTURE_MAG_FILTER, GL_LINEAR);\n\n d->inverted_texture = false;\n}\n\nvoid MTexturePixmapItem::cleanup()\n{\n if (!d->custom_tfp) {\n glXReleaseTexImageEXT(QX11Info::display(), d->glpixmap, GLX_FRONT_LEFT_EXT);\n glXDestroyPixmap(QX11Info::display(), d->glpixmap);\n glDeleteTextures(1, &d->textureId);\n } else\n glDeleteTextures(1, &d->ctextureId);\n\n if (d->windowp)\n XFreePixmap(QX11Info::display(), d->windowp);\n}\n\nvoid MTexturePixmapItem::updateWindowPixmap(XRectangle *rects, int num,\n Time when)\n{\n Q_UNUSED(rects);\n Q_UNUSED(num);\n\n if (isWindowTransitioning() || d->direct_fb_render || !windowVisible())\n return;\n\n \/\/ Our very own custom texture from pixmap\n if (d->custom_tfp && d->windowp) {\n QPixmap qp = QPixmap::fromX11Pixmap(d->windowp);\n\n QT_TRY {\n QImage img = d->glwidget->convertToGLFormat(qp.toImage());\n glBindTexture(GL_TEXTURE_2D, d->ctextureId);\n glTexImage2D(GL_TEXTURE_2D, 0, GL_RGBA, img.width(), img.height(), 0,\n GL_RGBA, GL_UNSIGNED_BYTE, img.bits());\n } QT_CATCH(std::bad_alloc e) {\n \/* XGetImage() failed, the window has been unmapped. *\/;\n }\n }\n update();\n}\n\nvoid MTexturePixmapItem::paint(QPainter *painter,\n const QStyleOptionGraphicsItem *option,\n QWidget *widget)\n{\n Q_UNUSED(option)\n Q_UNUSED(widget)\n\n#if QT_VERSION < 0x040600\n if (painter->paintEngine()->type() != QPaintEngine::OpenGL)\n return;\n#else\n if (painter->paintEngine()->type() != QPaintEngine::OpenGL2 &&\n painter->paintEngine()->type() != QPaintEngine::OpenGL) {\n return;\n }\n#endif\n\n#if (QT_VERSION >= 0x040600)\n painter->beginNativePainting();\n#endif\n\n glEnable(GL_TEXTURE_2D);\n if (propertyCache()->hasAlpha() || (opacity() < 1.0f && !dimmedEffect()) ) {\n glEnable(GL_BLEND);\n glBlendFunc(GL_SRC_ALPHA, GL_ONE_MINUS_SRC_ALPHA);\n glColor4f(1.0, 1.0, 1.0, opacity());\n }\n\n glBindTexture(GL_TEXTURE_2D, d->custom_tfp ? d->ctextureId : d->textureId);\n\n const QRegion &shape = propertyCache()->shapeRegion();\n bool shape_on = !QRegion(boundingRect().toRect()).subtracted(shape).isEmpty();\n bool scissor_on = d->damageRegion.numRects() > 1 || shape_on;\n \n if (scissor_on)\n glEnable(GL_SCISSOR_TEST);\n \n \/\/ Damage regions taking precedence over shape rects \n if (d->damageRegion.numRects() > 1) {\n for (int i = 0; i < d->damageRegion.numRects(); ++i) {\n glScissor(d->damageRegion.rects().at(i).x(),\n d->brect.height() -\n (d->damageRegion.rects().at(i).y() +\n d->damageRegion.rects().at(i).height()),\n d->damageRegion.rects().at(i).width(),\n d->damageRegion.rects().at(i).height());\n d->drawTexture(painter->combinedTransform(), boundingRect(), opacity()); \n }\n } else if (shape_on) {\n \/\/ draw a shaped window using glScissor\n for (int i = 0; i < shape.numRects(); ++i) {\n glScissor(shape.rects().at(i).x(),\n d->brect.height() -\n (shape.rects().at(i).y() +\n shape.rects().at(i).height()),\n shape.rects().at(i).width(),\n shape.rects().at(i).height());\n d->drawTexture(painter->combinedTransform(),\n boundingRect(), opacity());\n }\n } else\n d->drawTexture(painter->combinedTransform(), boundingRect(), opacity());\n \n if (scissor_on)\n glDisable(GL_SCISSOR_TEST);\n\n glDisable(GL_BLEND);\n\n#if (QT_VERSION >= 0x040600)\n painter->endNativePainting();\n#endif\n\n}\n\nvoid MTexturePixmapItem::windowRaised()\n{\n d->windowRaised();\n}\n\nvoid MTexturePixmapItem::resize(int w, int h)\n{\n d->resize(w, h);\n}\n\nQSizeF MTexturePixmapItem::sizeHint(Qt::SizeHint, const QSizeF &) const\n{\n return boundingRect().size();\n}\n\nQRectF MTexturePixmapItem::boundingRect() const\n{\n return d->brect;\n}\n\nvoid MTexturePixmapItem::clearTexture()\n{\n glBindTexture(GL_TEXTURE_2D, d->custom_tfp ? d->ctextureId : d->textureId);\n glTexImage2D(GL_TEXTURE_2D, 0, GL_RGBA, 0, 0, 0, GL_RGBA,\n GL_UNSIGNED_BYTE, 0);\n\n glClearColor(0.0, 0.0, 0.0, 0.0);\n glClear(GL_COLOR_BUFFER_BIT | GL_DEPTH_BUFFER_BIT);\n}\n<commit_msg>Fixes: http:\/\/bugs.meego.com\/show_bug.cgi?id=8957 Changes: On the GLX backend, ensure that the window's pixmap is not null before rebinding it. RevBy: TrustMe<commit_after>\/***************************************************************************\n**\n** Copyright (C) 2010 Nokia Corporation and\/or its subsidiary(-ies).\n** All rights reserved.\n** Contact: Nokia Corporation (directui@nokia.com)\n**\n** This file is part of mcompositor.\n**\n** If you have questions regarding the use of this file, please contact\n** Nokia at directui@nokia.com.\n**\n** This library is free software; you can redistribute it and\/or\n** modify it under the terms of the GNU Lesser General Public\n** License version 2.1 as published by the Free Software Foundation\n** and appearing in the file LICENSE.LGPL included in the packaging\n** of this file.\n**\n****************************************************************************\/\n\n#define GLX_GLXEXT_PROTOTYPES 1\n#define GLX_EXT_texture_from_pixmap 1\n\n#include \"mtexturepixmapitem.h\"\n#include \"mtexturepixmapitem_p.h\"\n\n#include <QPainterPath>\n#include <QRect>\n#include <QGLContext>\n#include <QX11Info>\n#include <vector>\n\n#include <X11\/Xlib.h>\n#include <X11\/extensions\/Xcomposite.h>\n#include <X11\/extensions\/Xrender.h>\n\n#include <GL\/gl.h>\n#include <GL\/glu.h>\n#include <GL\/glx.h>\n#include <GL\/glxext.h>\n\n#if defined(GLX_VERSION_1_3)\n#ifndef GLX_TEXTURE_2D_BIT_EXT\n#define GLX_TEXTURE_2D_BIT_EXT 0x00000002\n#define GLX_TEXTURE_RECTANGLE_BIT_EXT 0x00000004\n#define GLX_BIND_TO_TEXTURE_RGB_EXT 0x20D0\n#define GLX_BIND_TO_TEXTURE_RGBA_EXT 0x20D1\n#define GLX_BIND_TO_MIPMAP_TEXTURE_EXT 0x20D2\n#define GLX_BIND_TO_TEXTURE_TARGETS_EXT 0x20D3\n#define GLX_Y_INVERTED_EXT 0x20D4\n#define GLX_TEXTURE_FORMAT_EXT 0x20D5\n#define GLX_TEXTURE_TARGET_EXT 0x20D6\n#define GLX_MIPMAP_TEXTURE_EXT 0x20D7\n#define GLX_TEXTURE_FORMAT_NONE_EXT 0x20D8\n#define GLX_TEXTURE_FORMAT_RGB_EXT 0x20D9\n#define GLX_TEXTURE_FORMAT_RGBA_EXT 0x20DA\n#define GLX_TEXTURE_2D_EXT 0x20DC\n#define GLX_TEXTURE_RECTANGLE_EXT 0x20DD\n#define GLX_FRONT_LEFT_EXT 0x20DE\n#endif\n\ntypedef void (*_glx_bind)(Display *, GLXDrawable, int , const int *);\ntypedef void (*_glx_release)(Display *, GLXDrawable, int);\nstatic _glx_bind glXBindTexImageEXT = 0;\nstatic _glx_release glXReleaseTexImageEXT = 0;\nstatic GLXFBConfig config = 0;\nstatic GLXFBConfig configAlpha = 0;\n\nstatic bool hasTextureFromPixmap()\n{\n static bool hasTfp = false;\n\n if (!hasTfp) {\n hasTfp = true;\n\n QList<QByteArray> exts = QByteArray(glXQueryExtensionsString(QX11Info::display(), QX11Info::appScreen())).split(' ');\n if (exts.contains(\"GLX_EXT_texture_from_pixmap\")) {\n glXBindTexImageEXT = (_glx_bind) glXGetProcAddress((const GLubyte *)\"glXBindTexImageEXT\");\n glXReleaseTexImageEXT = (_glx_release) glXGetProcAddress((const GLubyte *)\"glXReleaseTexImageEXT\");\n }\n }\n return glXBindTexImageEXT && glXReleaseTexImageEXT;\n}\n#endif\n\nvoid MTexturePixmapItem::init()\n{\n MWindowPropertyCache *pc = propertyCache();\n if (isValid() && !pc->isMapped()) {\n qWarning(\"MTexturePixmapItem::%s(): Failed getting offscreen pixmap\",\n __func__);\n return;\n } else if (!isValid()) \n return;\n\n d->glpixmap = 0;\n\n d->custom_tfp = !hasTextureFromPixmap();\n saveBackingStore();\n\n if (d->custom_tfp) {\n initCustomTfp();\n return;\n }\n const int pixmapAttribs[] = {\n GLX_TEXTURE_TARGET_EXT, GLX_TEXTURE_2D_EXT,\n GLX_TEXTURE_FORMAT_EXT, propertyCache()->hasAlpha() ?\n GLX_TEXTURE_FORMAT_RGBA_EXT : GLX_TEXTURE_FORMAT_RGB_EXT,\n None\n };\n\n if ((!pc->hasAlpha() && !config) || (pc->hasAlpha() && !configAlpha)) {\n Display *display = QX11Info::display();\n int screen = QX11Info::appScreen();\n\n int pixmap_config[] = {\n pc->hasAlpha() ? GLX_BIND_TO_TEXTURE_RGBA_EXT :\n GLX_BIND_TO_TEXTURE_RGB_EXT, True,\n GLX_DRAWABLE_TYPE, GLX_PIXMAP_BIT,\n GLX_BIND_TO_TEXTURE_TARGETS_EXT, GLX_TEXTURE_2D_BIT_EXT,\n GLX_DOUBLEBUFFER, True,\n GLX_Y_INVERTED_EXT, GLX_DONT_CARE,\n None\n };\n\n int c = 0;\n GLXFBConfig *configs = 0;\n configs = glXChooseFBConfig(display, screen, pixmap_config, &c);\n if (!configs) {\n qWarning(\"No appropriate GLXFBconfig found!\"\n \"Falling back to custom texture to pixmap \");\n d->custom_tfp = true;\n initCustomTfp();\n return;\n }\n\n int inverted;\n glXGetFBConfigAttrib(display, configs[0], GLX_Y_INVERTED_EXT, &inverted);\n if (pc->hasAlpha()) {\n configAlpha = configs[0];\n d->inverted_texture = inverted ? true : false;\n } else {\n config = configs[0];\n d->inverted_texture = inverted ? true : false;\n }\n XFree(configs);\n }\n\n glGenTextures(1, &d->textureId);\n glEnable(GL_TEXTURE_2D);\n glBindTexture(GL_TEXTURE_2D, d->textureId);\n d->glpixmap = glXCreatePixmap(QX11Info::display(), pc->hasAlpha() ?\n configAlpha : config, d->windowp, pixmapAttribs);\n\n glTexParameteri(GL_TEXTURE_2D, GL_TEXTURE_MAG_FILTER, GL_LINEAR);\n glTexParameteri(GL_TEXTURE_2D, GL_TEXTURE_MIN_FILTER, GL_LINEAR);\n\n glTexParameteri(GL_TEXTURE_2D, GL_TEXTURE_WRAP_S, GL_CLAMP_TO_EDGE);\n glTexParameteri(GL_TEXTURE_2D, GL_TEXTURE_WRAP_T, GL_CLAMP_TO_EDGE);\n\n glXBindTexImageEXT(QX11Info::display(), d->glpixmap, GLX_FRONT_LEFT_EXT, NULL);\n}\n\nMTexturePixmapItem::MTexturePixmapItem(Window window,\n MWindowPropertyCache *pc,\n QGraphicsItem *parent)\n : MCompositeWindow(window, pc, parent),\n d(new MTexturePixmapPrivate(window, this))\n{\n init();\n}\n\nvoid MTexturePixmapItem::saveBackingStore()\n{\n d->saveBackingStore();\n}\n\nvoid MTexturePixmapItem::rebindPixmap()\n{\n const int pixmapAttribs[] = {\n GLX_TEXTURE_TARGET_EXT, GLX_TEXTURE_2D_EXT,\n GLX_TEXTURE_FORMAT_EXT, propertyCache()->hasAlpha() ?\n GLX_TEXTURE_FORMAT_RGBA_EXT : GLX_TEXTURE_FORMAT_RGB_EXT,\n None\n };\n\n if (!d->custom_tfp && d->windowp) {\n Display *display = QX11Info::display();\n glXReleaseTexImageEXT(display, d->glpixmap, GLX_FRONT_LEFT_EXT);\n glXDestroyPixmap(display, d->glpixmap);\n d->glpixmap = glXCreatePixmap(display, propertyCache()->hasAlpha() ?\n configAlpha : config,\n d->windowp, pixmapAttribs);\n glBindTexture(GL_TEXTURE_2D, d->textureId);\n glXBindTexImageEXT(display, d->glpixmap, GLX_FRONT_LEFT_EXT, NULL);\n }\n}\n\nvoid MTexturePixmapItem::enableDirectFbRendering()\n{\n if (d->item->propertyCache())\n d->item->propertyCache()->damageTracking(false);\n\n if ((d->direct_fb_render || d->glpixmap == 0) && !d->custom_tfp)\n return;\n\n d->direct_fb_render = true;\n \/\/ Just free the off-screen surface but re-use the\n \/\/ existing texture id, so don't delete it yet.\n\n if (!d->custom_tfp) {\n glXReleaseTexImageEXT(QX11Info::display(), d->glpixmap, GLX_FRONT_LEFT_EXT);\n glXDestroyPixmap(QX11Info::display(), d->glpixmap);\n d->glpixmap = 0;\n }\n\n if (d->windowp) {\n XFreePixmap(QX11Info::display(), d->windowp);\n d->windowp = 0;\n }\n XCompositeUnredirectWindow(QX11Info::display(), window(),\n CompositeRedirectManual);\n XSync(QX11Info::display(), FALSE);\n}\n\nvoid MTexturePixmapItem::enableRedirectedRendering()\n{\n if (d->item->propertyCache())\n d->item->propertyCache()->damageTracking(true);\n\n if ((!d->direct_fb_render || d->glpixmap != 0) && !d->custom_tfp)\n return;\n\n d->direct_fb_render = false;\n XCompositeRedirectWindow(QX11Info::display(), window(),\n CompositeRedirectManual);\n XSync(QX11Info::display(), FALSE);\n saveBackingStore();\n updateWindowPixmap();\n}\n\nbool MTexturePixmapItem::isDirectRendered() const\n{\n return d->direct_fb_render;\n}\n\nMTexturePixmapItem::~MTexturePixmapItem()\n{\n cleanup();\n delete d;\n}\n\nvoid MTexturePixmapItem::initCustomTfp()\n{\n glGenTextures(1, &d->ctextureId);\n\n glBindTexture(GL_TEXTURE_2D, d->ctextureId);\n glTexParameteri(GL_TEXTURE_2D, GL_TEXTURE_MIN_FILTER, GL_LINEAR);\n glTexParameteri(GL_TEXTURE_2D, GL_TEXTURE_MAG_FILTER, GL_LINEAR);\n\n d->inverted_texture = false;\n}\n\nvoid MTexturePixmapItem::cleanup()\n{\n if (!d->custom_tfp) {\n glXReleaseTexImageEXT(QX11Info::display(), d->glpixmap, GLX_FRONT_LEFT_EXT);\n glXDestroyPixmap(QX11Info::display(), d->glpixmap);\n glDeleteTextures(1, &d->textureId);\n } else\n glDeleteTextures(1, &d->ctextureId);\n\n if (d->windowp)\n XFreePixmap(QX11Info::display(), d->windowp);\n}\n\nvoid MTexturePixmapItem::updateWindowPixmap(XRectangle *rects, int num,\n Time when)\n{\n Q_UNUSED(rects);\n Q_UNUSED(num);\n\n if (isWindowTransitioning() || d->direct_fb_render || !windowVisible())\n return;\n\n \/\/ Our very own custom texture from pixmap\n if (d->custom_tfp && d->windowp) {\n QPixmap qp = QPixmap::fromX11Pixmap(d->windowp);\n\n QT_TRY {\n QImage img = d->glwidget->convertToGLFormat(qp.toImage());\n glBindTexture(GL_TEXTURE_2D, d->ctextureId);\n glTexImage2D(GL_TEXTURE_2D, 0, GL_RGBA, img.width(), img.height(), 0,\n GL_RGBA, GL_UNSIGNED_BYTE, img.bits());\n } QT_CATCH(std::bad_alloc e) {\n \/* XGetImage() failed, the window has been unmapped. *\/;\n }\n }\n update();\n}\n\nvoid MTexturePixmapItem::paint(QPainter *painter,\n const QStyleOptionGraphicsItem *option,\n QWidget *widget)\n{\n Q_UNUSED(option)\n Q_UNUSED(widget)\n\n#if QT_VERSION < 0x040600\n if (painter->paintEngine()->type() != QPaintEngine::OpenGL)\n return;\n#else\n if (painter->paintEngine()->type() != QPaintEngine::OpenGL2 &&\n painter->paintEngine()->type() != QPaintEngine::OpenGL) {\n return;\n }\n#endif\n\n#if (QT_VERSION >= 0x040600)\n painter->beginNativePainting();\n#endif\n\n glEnable(GL_TEXTURE_2D);\n if (propertyCache()->hasAlpha() || (opacity() < 1.0f && !dimmedEffect()) ) {\n glEnable(GL_BLEND);\n glBlendFunc(GL_SRC_ALPHA, GL_ONE_MINUS_SRC_ALPHA);\n glColor4f(1.0, 1.0, 1.0, opacity());\n }\n\n glBindTexture(GL_TEXTURE_2D, d->custom_tfp ? d->ctextureId : d->textureId);\n\n const QRegion &shape = propertyCache()->shapeRegion();\n bool shape_on = !QRegion(boundingRect().toRect()).subtracted(shape).isEmpty();\n bool scissor_on = d->damageRegion.numRects() > 1 || shape_on;\n \n if (scissor_on)\n glEnable(GL_SCISSOR_TEST);\n \n \/\/ Damage regions taking precedence over shape rects \n if (d->damageRegion.numRects() > 1) {\n for (int i = 0; i < d->damageRegion.numRects(); ++i) {\n glScissor(d->damageRegion.rects().at(i).x(),\n d->brect.height() -\n (d->damageRegion.rects().at(i).y() +\n d->damageRegion.rects().at(i).height()),\n d->damageRegion.rects().at(i).width(),\n d->damageRegion.rects().at(i).height());\n d->drawTexture(painter->combinedTransform(), boundingRect(), opacity()); \n }\n } else if (shape_on) {\n \/\/ draw a shaped window using glScissor\n for (int i = 0; i < shape.numRects(); ++i) {\n glScissor(shape.rects().at(i).x(),\n d->brect.height() -\n (shape.rects().at(i).y() +\n shape.rects().at(i).height()),\n shape.rects().at(i).width(),\n shape.rects().at(i).height());\n d->drawTexture(painter->combinedTransform(),\n boundingRect(), opacity());\n }\n } else\n d->drawTexture(painter->combinedTransform(), boundingRect(), opacity());\n \n if (scissor_on)\n glDisable(GL_SCISSOR_TEST);\n\n glDisable(GL_BLEND);\n\n#if (QT_VERSION >= 0x040600)\n painter->endNativePainting();\n#endif\n\n}\n\nvoid MTexturePixmapItem::windowRaised()\n{\n d->windowRaised();\n}\n\nvoid MTexturePixmapItem::resize(int w, int h)\n{\n d->resize(w, h);\n}\n\nQSizeF MTexturePixmapItem::sizeHint(Qt::SizeHint, const QSizeF &) const\n{\n return boundingRect().size();\n}\n\nQRectF MTexturePixmapItem::boundingRect() const\n{\n return d->brect;\n}\n\nvoid MTexturePixmapItem::clearTexture()\n{\n glBindTexture(GL_TEXTURE_2D, d->custom_tfp ? d->ctextureId : d->textureId);\n glTexImage2D(GL_TEXTURE_2D, 0, GL_RGBA, 0, 0, 0, GL_RGBA,\n GL_UNSIGNED_BYTE, 0);\n\n glClearColor(0.0, 0.0, 0.0, 0.0);\n glClear(GL_COLOR_BUFFER_BIT | GL_DEPTH_BUFFER_BIT);\n}\n<|endoftext|>"} {"text":"<commit_before>#pragma once\n#include \"..\/..\/src\/signal_handlers.h\"\n#include \"..\/..\/src\/utils\/dstring.h\"\n#include \"..\/..\/src\/utils\/dstring_factory.h\"\n#include <pwd.h>\n#include <errno.h>\n#include <string.h>\n#include <unistd.h>\n#include <signal.h>\n#include <sys\/time.h>\n#include <sys\/types.h>\n#include <sys\/resource.h>\n\n\n\n\n\n\n\nnamespace doormat {\n using ::signals_handlers::set;\n using ::signals_handlers::block_all;\n using ::signals_handlers::unblock_all;\n using ::dstring;\n using ::dstring_factory;\n}<commit_msg>do not exports dstring anymore<commit_after>#pragma once\n#include \"..\/..\/src\/signal_handlers.h\"\n#include \"..\/..\/src\/utils\/dstring.h\"\n#include \"..\/..\/src\/utils\/dstring_factory.h\"\n#include <pwd.h>\n#include <errno.h>\n#include <string.h>\n#include <unistd.h>\n#include <signal.h>\n#include <sys\/time.h>\n#include <sys\/types.h>\n#include <sys\/resource.h>\n\n\n\n\n\n\n\nnamespace doormat {\n using ::signals_handlers::set;\n using ::signals_handlers::block_all;\n\tusing ::signals_handlers::unblock_all;\n}\n<|endoftext|>"} {"text":"<commit_before>\/\/=======================================================================\n\/\/ Copyright (c) 2014-2016 Baptiste Wicht\n\/\/ Distributed under the terms of the MIT License.\n\/\/ (See accompanying file LICENSE or copy at\n\/\/ http:\/\/opensource.org\/licenses\/MIT)\n\/\/=======================================================================\n\n\/*!\n * \\file\n * \\brief Contains allocation utilities\n *\/\n\n#pragma once\n\n#include <memory>\n\nnamespace etl {\n\n\/*!\n * \\brief Allocated for aligned memory\n * \\tparam Expr The expression typoe\n * \\tparam A The alignment\n *\/\ntemplate <typename Expr, std::size_t A>\nstruct aligned_allocator {\n \/*!\n * \\brief Allocate a block of memory of *size* elements\n * \\param size The number of elements\n * \\return A pointer to the allocated memory\n *\/\n template <typename T>\n static T* allocate(std::size_t size) {\n auto required_bytes = sizeof(T) * size;\n auto offset = (A - 1) + sizeof(uintptr_t);\n auto orig = malloc(required_bytes + offset);\n\n if (!orig) {\n return nullptr;\n }\n\n auto aligned = reinterpret_cast<void**>((reinterpret_cast<size_t>(orig) + offset) & ~(A - 1));\n aligned[-1] = orig;\n return reinterpret_cast<T*>(aligned);\n }\n\n \/*!\n * \\brief Release the memory\n * \\param ptr The pointer to the memory to be released\n *\/\n template <typename T>\n static void release(T* ptr) {\n \/\/Note the const_cast is only to allow compilation\n free((reinterpret_cast<void**>(const_cast<std::remove_const_t<T>*>(ptr)))[-1]);\n }\n};\n\n\/*!\n * \\brief Allocate an array of the given size for the given type\n * \\param size The number of elements\n * \\return An unique pointer to the memory\n *\/\ntemplate <typename T>\nauto allocate(std::size_t size) {\n return std::make_unique<T[]>(size);\n}\n\n\/*!\n * \\brief Allocate an aligned rray of the given size for the given type\n * \\param size The number of elements\n * \\return A pointer to the aligned memory\n *\/\ntemplate <typename T>\nT* aligned_allocate(std::size_t size) {\n return aligned_allocator<void, 32>::allocate<T>(size);\n}\n\n\/*!\n * \\brief Release some aligned memory\n * \\param ptr The ptr to the aligned memory\n *\/\ntemplate <typename T>\nvoid aligned_release(T* ptr) {\n return aligned_allocator<void, 32>::release<T>(ptr);\n}\n\n\/*!\n * \\brief RAII wrapper for allocated aligned memory\n *\/\ntemplate <typename T>\nstruct aligned_ptr {\n T* ptr; \/\/\/< The raw pointer\n\n \/*!\n * \\brief Build an aligned_ptr managing the given pointer\n *\/\n aligned_ptr(T* ptr) : ptr(ptr) {}\n\n aligned_ptr(const aligned_ptr& rhs) = delete;\n aligned_ptr& operator=(const aligned_ptr& rhs) = delete;\n\n \/*!\n * \\brief Move construct an aligned_ptr\n * \\param rhs The pointer to move\n *\/\n aligned_ptr(aligned_ptr&& rhs) : ptr(rhs.ptr) {\n rhs.ptr = nullptr;\n }\n\n \/*!\n * \\brief Move assign an aligned_ptr\n * \\param rhs The pointer to move\n * \\return the aligned_ptr\n *\/\n aligned_ptr& operator=(aligned_ptr&& rhs){\n if(this != &rhs){\n ptr = rhs.ptr;\n rhs.ptr = nullptr;\n }\n\n return *this;\n }\n\n \/*!\n * \\brief Returns a reference to the element at psition i\n *\/\n inline T& operator[](std::size_t i){\n return ptr[i];\n }\n\n \/*!\n * \\brief Returns a reference to the element at psition i\n *\/\n inline const T& operator[](std::size_t i) const {\n return ptr[i];\n }\n\n \/*!\n * \\brief Destruct the aligned_ptr and release the aligned memory\n *\/\n ~aligned_ptr(){\n if(ptr){\n aligned_release(ptr);\n }\n }\n\n \/*!\n * \\brief Returns the raw underlying pointer\n *\/\n T* get(){\n return ptr;\n }\n};\n\n\/*!\n * \\brief Allocate an aligned rray of the given size for the given type\n * \\param size The number of elements\n * \\return A pointer to the aligned memory\n *\/\ntemplate <typename T>\naligned_ptr<T> aligned_allocate_auto(std::size_t size) {\n return {aligned_allocate<T>(size)};\n}\n\n} \/\/end of namespace etl\n<commit_msg>Make the constructor explicit<commit_after>\/\/=======================================================================\n\/\/ Copyright (c) 2014-2016 Baptiste Wicht\n\/\/ Distributed under the terms of the MIT License.\n\/\/ (See accompanying file LICENSE or copy at\n\/\/ http:\/\/opensource.org\/licenses\/MIT)\n\/\/=======================================================================\n\n\/*!\n * \\file\n * \\brief Contains allocation utilities\n *\/\n\n#pragma once\n\n#include <memory>\n\nnamespace etl {\n\n\/*!\n * \\brief Allocated for aligned memory\n * \\tparam Expr The expression typoe\n * \\tparam A The alignment\n *\/\ntemplate <typename Expr, std::size_t A>\nstruct aligned_allocator {\n \/*!\n * \\brief Allocate a block of memory of *size* elements\n * \\param size The number of elements\n * \\return A pointer to the allocated memory\n *\/\n template <typename T>\n static T* allocate(std::size_t size) {\n auto required_bytes = sizeof(T) * size;\n auto offset = (A - 1) + sizeof(uintptr_t);\n auto orig = malloc(required_bytes + offset);\n\n if (!orig) {\n return nullptr;\n }\n\n auto aligned = reinterpret_cast<void**>((reinterpret_cast<size_t>(orig) + offset) & ~(A - 1));\n aligned[-1] = orig;\n return reinterpret_cast<T*>(aligned);\n }\n\n \/*!\n * \\brief Release the memory\n * \\param ptr The pointer to the memory to be released\n *\/\n template <typename T>\n static void release(T* ptr) {\n \/\/Note the const_cast is only to allow compilation\n free((reinterpret_cast<void**>(const_cast<std::remove_const_t<T>*>(ptr)))[-1]);\n }\n};\n\n\/*!\n * \\brief Allocate an array of the given size for the given type\n * \\param size The number of elements\n * \\return An unique pointer to the memory\n *\/\ntemplate <typename T>\nauto allocate(std::size_t size) {\n return std::make_unique<T[]>(size);\n}\n\n\/*!\n * \\brief Allocate an aligned rray of the given size for the given type\n * \\param size The number of elements\n * \\return A pointer to the aligned memory\n *\/\ntemplate <typename T>\nT* aligned_allocate(std::size_t size) {\n return aligned_allocator<void, 32>::allocate<T>(size);\n}\n\n\/*!\n * \\brief Release some aligned memory\n * \\param ptr The ptr to the aligned memory\n *\/\ntemplate <typename T>\nvoid aligned_release(T* ptr) {\n return aligned_allocator<void, 32>::release<T>(ptr);\n}\n\n\/*!\n * \\brief RAII wrapper for allocated aligned memory\n *\/\ntemplate <typename T>\nstruct aligned_ptr {\n T* ptr; \/\/\/< The raw pointer\n\n \/*!\n * \\brief Build an aligned_ptr managing the given pointer\n *\/\n explicit aligned_ptr(T* ptr) : ptr(ptr) {}\n\n aligned_ptr(const aligned_ptr& rhs) = delete;\n aligned_ptr& operator=(const aligned_ptr& rhs) = delete;\n\n \/*!\n * \\brief Move construct an aligned_ptr\n * \\param rhs The pointer to move\n *\/\n aligned_ptr(aligned_ptr&& rhs) : ptr(rhs.ptr) {\n rhs.ptr = nullptr;\n }\n\n \/*!\n * \\brief Move assign an aligned_ptr\n * \\param rhs The pointer to move\n * \\return the aligned_ptr\n *\/\n aligned_ptr& operator=(aligned_ptr&& rhs){\n if(this != &rhs){\n ptr = rhs.ptr;\n rhs.ptr = nullptr;\n }\n\n return *this;\n }\n\n \/*!\n * \\brief Returns a reference to the element at psition i\n *\/\n inline T& operator[](std::size_t i){\n return ptr[i];\n }\n\n \/*!\n * \\brief Returns a reference to the element at psition i\n *\/\n inline const T& operator[](std::size_t i) const {\n return ptr[i];\n }\n\n \/*!\n * \\brief Destruct the aligned_ptr and release the aligned memory\n *\/\n ~aligned_ptr(){\n if(ptr){\n aligned_release(ptr);\n }\n }\n\n \/*!\n * \\brief Returns the raw underlying pointer\n *\/\n T* get(){\n return ptr;\n }\n};\n\n\/*!\n * \\brief Allocate an aligned rray of the given size for the given type\n * \\param size The number of elements\n * \\return A pointer to the aligned memory\n *\/\ntemplate <typename T>\naligned_ptr<T> aligned_allocate_auto(std::size_t size) {\n return aligned_ptr<T>{aligned_allocate<T>(size)};\n}\n\n} \/\/end of namespace etl\n<|endoftext|>"} {"text":"<commit_before>\/\/=======================================================================\n\/\/ Copyright (c) 2014-2015 Baptiste Wicht\n\/\/ Distributed under the terms of the MIT License.\n\/\/ (See accompanying file LICENSE or copy at\n\/\/ http:\/\/opensource.org\/licenses\/MIT)\n\/\/=======================================================================\n\n#ifndef ETL_MMUL_EXPR_HPP\n#define ETL_MMUL_EXPR_HPP\n\n#include <algorithm>\n\n#include \"impl\/mmul.hpp\"\n\n#include \"traits_lite.hpp\"\n\nnamespace etl {\n\nnamespace detail {\n\ntemplate<typename A, typename B, typename C, cpp::disable_if_all_u<etl_traits<A>::is_fast, etl_traits<B>::is_fast, etl_traits<C>::is_fast> = cpp::detail::dummy>\nvoid check_mmul_sizes(const A& a, const B& b, C& c){\n cpp_assert(\n dim<1>(a) == dim<0>(b) \/\/interior dimensions\n && dim<0>(a) == dim<0>(c) \/\/exterior dimension 1\n && dim<1>(b) == dim<1>(c), \/\/exterior dimension 2\n \"Invalid sizes for multiplication\");\n cpp_unused(a);\n cpp_unused(b);\n cpp_unused(c);\n}\n\ntemplate<typename A, typename B, typename C, cpp::enable_if_all_u<etl_traits<A>::is_fast, etl_traits<B>::is_fast, etl_traits<C>::is_fast> = cpp::detail::dummy>\nvoid check_mmul_sizes(const A&, const B&, C&){\n static_assert(\n etl_traits<A>::template dim<1>() == etl_traits<B>::template dim<0>() \/\/interior dimensions\n && etl_traits<A>::template dim<0>() == etl_traits<C>::template dim<0>() \/\/exterior dimension 1\n && etl_traits<B>::template dim<1>() == etl_traits<C>::template dim<1>(), \/\/exterior dimension 2\n \"Invalid sizes for multiplication\");\n}\n\n} \/\/end of namespace detail\n\ntemplate<typename T, template<typename...> class Impl>\nstruct basic_mmul_expr {\n template<typename A, typename B, class Enable = void>\n struct result_type_builder {\n using type = dyn_matrix<value_t<A>>;\n };\n\n template<typename A, typename B>\n struct result_type_builder<A, B, std::enable_if_t<decay_traits<A>::is_fast && decay_traits<B>::is_fast>> {\n using type = fast_dyn_matrix<typename std::decay_t<A>::value_type, decay_traits<A>::template dim<0>(), decay_traits<B>::template dim<1>()>;\n };\n\n template<typename A, typename B>\n using result_type = typename result_type_builder<A, B>::type;\n\n template<typename A, typename B, cpp_enable_if(decay_traits<A>::is_fast && decay_traits<B>::is_fast)>\n static result_type<A,B>* allocate(A&&, B&&){\n return new result_type<A, B>();\n }\n\n template<typename A, typename B, cpp_disable_if(decay_traits<A>::is_fast && decay_traits<B>::is_fast)>\n static result_type<A,B>* allocate(A&& a, B&& b){\n return new result_type<A, B>(decay_traits<A>::dim(a, 0), decay_traits<B>::dim(b, 1));\n }\n\n template<typename A, typename B, typename C>\n static void apply(A&& a, B&& b, C&& c){\n static_assert(is_etl_expr<A>::value && is_etl_expr<B>::value && is_etl_expr<C>::value, \"Matrix multiplication only supported for ETL expressions\");\n static_assert(decay_traits<A>::dimensions() == 2 && decay_traits<B>::dimensions() == 2 && decay_traits<C>::dimensions() == 2, \"Matrix multiplication only works in 2D\");\n detail::check_mmul_sizes(a,b,c);\n\n Impl<A,B,C,void>::apply(std::forward<A>(a), std::forward<B>(b), std::forward<C>(c));\n }\n\n static std::string desc() noexcept {\n return \"mmul\";\n }\n\n template<typename A, typename B>\n static std::size_t size(const A& a, const B& b){\n return decay_traits<A>::dim(a, 0) * decay_traits<B>::dim(b, 1);\n }\n\n template<typename A, typename B>\n static std::size_t dim(const A& a, const B& b, std::size_t d){\n if(d == 0){\n return decay_traits<A>::dim(a, 0);\n } else {\n return decay_traits<B>::dim(b, 1);\n }\n }\n\n template<typename A, typename B>\n static constexpr std::size_t size(){\n return etl_traits<A>::template dim<0>() * etl_traits<B>::template dim<1>();\n }\n\n template<typename A, typename B, std::size_t D>\n static constexpr std::size_t dim(){\n return D == 0 ? etl_traits<A>::template dim<0>() : etl_traits<B>::template dim<1>();\n }\n\n static constexpr std::size_t dimensions(){\n return 2;\n }\n};\n\ntemplate<typename T>\nusing mmul_expr = basic_mmul_expr<T, detail::mmul_impl>;\n\ntemplate<typename T>\nusing strassen_mmul_expr = basic_mmul_expr<T, detail::strassen_mmul_impl>;\n\n} \/\/end of namespace etl\n\n#endif\n<commit_msg>Cleanup<commit_after>\/\/=======================================================================\n\/\/ Copyright (c) 2014-2015 Baptiste Wicht\n\/\/ Distributed under the terms of the MIT License.\n\/\/ (See accompanying file LICENSE or copy at\n\/\/ http:\/\/opensource.org\/licenses\/MIT)\n\/\/=======================================================================\n\n#ifndef ETL_MMUL_EXPR_HPP\n#define ETL_MMUL_EXPR_HPP\n\n#include <algorithm>\n\n#include \"impl\/mmul.hpp\"\n\n#include \"traits_lite.hpp\"\n\nnamespace etl {\n\nnamespace detail {\n\ntemplate<typename A, typename B, typename C, cpp::disable_if_all_u<etl_traits<A>::is_fast, etl_traits<B>::is_fast, etl_traits<C>::is_fast> = cpp::detail::dummy>\nvoid check_mmul_sizes(const A& a, const B& b, C& c){\n cpp_assert(\n dim<1>(a) == dim<0>(b) \/\/interior dimensions\n && dim<0>(a) == dim<0>(c) \/\/exterior dimension 1\n && dim<1>(b) == dim<1>(c), \/\/exterior dimension 2\n \"Invalid sizes for multiplication\");\n cpp_unused(a);\n cpp_unused(b);\n cpp_unused(c);\n}\n\ntemplate<typename A, typename B, typename C, cpp::enable_if_all_u<etl_traits<A>::is_fast, etl_traits<B>::is_fast, etl_traits<C>::is_fast> = cpp::detail::dummy>\nvoid check_mmul_sizes(const A&, const B&, C&){\n static_assert(\n etl_traits<A>::template dim<1>() == etl_traits<B>::template dim<0>() \/\/interior dimensions\n && etl_traits<A>::template dim<0>() == etl_traits<C>::template dim<0>() \/\/exterior dimension 1\n && etl_traits<B>::template dim<1>() == etl_traits<C>::template dim<1>(), \/\/exterior dimension 2\n \"Invalid sizes for multiplication\");\n}\n\n} \/\/end of namespace detail\n\ntemplate<typename T, template<typename...> class Impl>\nstruct basic_mmul_expr {\n template<typename A, typename B, class Enable = void>\n struct result_type_builder {\n using type = dyn_matrix<value_t<A>>;\n };\n\n template<typename A, typename B>\n struct result_type_builder<A, B, std::enable_if_t<decay_traits<A>::is_fast && decay_traits<B>::is_fast>> {\n using type = fast_dyn_matrix<typename std::decay_t<A>::value_type, decay_traits<A>::template dim<0>(), decay_traits<B>::template dim<1>()>;\n };\n\n template<typename A, typename B>\n using result_type = typename result_type_builder<A, B>::type;\n\n template<typename A, typename B, cpp_enable_if(decay_traits<A>::is_fast && decay_traits<B>::is_fast)>\n static result_type<A,B>* allocate(A&&, B&&){\n return new result_type<A, B>();\n }\n\n template<typename A, typename B, cpp_disable_if(decay_traits<A>::is_fast && decay_traits<B>::is_fast)>\n static result_type<A,B>* allocate(A&& a, B&& b){\n return new result_type<A, B>(etl::dim<0>(a), etl::dim<1>(b));\n }\n\n template<typename A, typename B, typename C>\n static void apply(A&& a, B&& b, C&& c){\n static_assert(is_etl_expr<A>::value && is_etl_expr<B>::value && is_etl_expr<C>::value, \"Matrix multiplication only supported for ETL expressions\");\n static_assert(decay_traits<A>::dimensions() == 2 && decay_traits<B>::dimensions() == 2 && decay_traits<C>::dimensions() == 2, \"Matrix multiplication only works in 2D\");\n detail::check_mmul_sizes(a,b,c);\n\n Impl<A,B,C,void>::apply(std::forward<A>(a), std::forward<B>(b), std::forward<C>(c));\n }\n\n static std::string desc() noexcept {\n return \"mmul\";\n }\n\n template<typename A, typename B>\n static std::size_t size(const A& a, const B& b){\n return etl::dim<0>(a) * etl::dim<1>(b);\n }\n\n template<typename A, typename B>\n static std::size_t dim(const A& a, const B& b, std::size_t d){\n if(d == 0){\n return etl::dim<0>(a);\n } else {\n return etl::dim<1>(b);\n }\n }\n\n template<typename A, typename B>\n static constexpr std::size_t size(){\n return etl_traits<A>::template dim<0>() * etl_traits<B>::template dim<1>();\n }\n\n template<typename A, typename B, std::size_t D>\n static constexpr std::size_t dim(){\n return D == 0 ? etl_traits<A>::template dim<0>() : etl_traits<B>::template dim<1>();\n }\n\n static constexpr std::size_t dimensions(){\n return 2;\n }\n};\n\ntemplate<typename T>\nusing mmul_expr = basic_mmul_expr<T, detail::mmul_impl>;\n\ntemplate<typename T>\nusing strassen_mmul_expr = basic_mmul_expr<T, detail::strassen_mmul_impl>;\n\n} \/\/end of namespace etl\n\n#endif\n<|endoftext|>"} {"text":"<commit_before>\/\/=======================================================================\n\/\/ Copyright (c) 2014-2017 Baptiste Wicht\n\/\/ Distributed under the terms of the MIT License.\n\/\/ (See accompanying file LICENSE or copy at\n\/\/ http:\/\/opensource.org\/licenses\/MIT)\n\/\/=======================================================================\n\n\/*!\n * \\file\n * \\brief Contains forward declarations and using declarations for\n * the various value types.\n *\/\n\n#pragma once\n\n#include <cstddef>\n#include \"cpp_utils\/array_wrapper.hpp\"\n#include \"cpp_utils\/aligned_vector.hpp\"\n#include \"cpp_utils\/aligned_array.hpp\"\n\nnamespace etl {\n\ntemplate <typename T>\nstatic constexpr size_t alloc_size_vec(size_t size) {\n return padding\n ? size + (size % default_intrinsic_traits<T>::size == 0 ? 0 : (default_intrinsic_traits<T>::size - (size % default_intrinsic_traits<T>::size)))\n : size;\n}\n\n#ifdef ETL_ADVANCED_PADDING\n\ntemplate <typename T>\nstatic constexpr size_t alloc_size_mat(size_t size, size_t last) {\n return size == 0 ? 0 :\n (padding\n ? (size \/ last) * (last + (last % default_intrinsic_traits<T>::size == 0 ? 0 : (default_intrinsic_traits<T>::size - last % default_intrinsic_traits<T>::size)))\n : size);\n}\n\n#else\n\ntemplate <typename T>\nstatic constexpr size_t alloc_size_mat(size_t size, size_t \/*last*\/) {\n return size == 0 ? 0 : alloc_size_vec<T>(size);\n}\n\n#endif\n\ntemplate <typename T, size_t... Dims>\nstatic constexpr size_t alloc_size_mat() {\n return alloc_size_mat<T>(mul_all<Dims...>(), nth_size<sizeof...(Dims) - 1, 0, Dims...>::value);\n}\n\ntemplate <typename T, typename ST, order SO, size_t... Dims>\nstruct fast_matrix_impl;\n\ntemplate <typename T, typename ST, order SO, size_t... Dims>\nstruct custom_fast_matrix_impl;\n\ntemplate <typename T, order SO, size_t D = 2>\nstruct dyn_matrix_impl;\n\ntemplate <typename T, order SO, size_t D = 2>\nstruct custom_dyn_matrix_impl;\n\ntemplate <typename T, sparse_storage SS, size_t D>\nstruct sparse_matrix_impl;\n\ntemplate <typename Stream>\nstruct serializer;\n\ntemplate <typename Stream>\nstruct deserializer;\n\n\/*!\n * \\brief Symmetric matrix adapter\n * \\tparam Matrix The adapted matrix\n *\/\ntemplate <typename Matrix>\nstruct symmetric_matrix;\n\n\/*!\n * \\brief Hermitian matrix adapter\n * \\tparam Matrix The adapted matrix\n *\/\ntemplate <typename Matrix>\nstruct hermitian_matrix;\n\n\/*!\n * \\brief Diagonal matrix adapter\n * \\tparam Matrix The adapted matrix\n *\/\ntemplate <typename Matrix>\nstruct diagonal_matrix;\n\n\/*!\n * \\brief Upper triangular matrix adapter\n * \\tparam Matrix The adapted matrix\n *\/\ntemplate <typename Matrix>\nstruct upper_matrix;\n\n\/*!\n * \\brief Strictly upper triangular matrix adapter\n * \\tparam Matrix The adapted matrix\n *\/\ntemplate <typename Matrix>\nstruct strictly_upper_matrix;\n\n\/*!\n * \\brief Uni upper triangular matrix adapter\n * \\tparam Matrix The adapted matrix\n *\/\ntemplate <typename Matrix>\nstruct uni_upper_matrix;\n\n\/*!\n * \\brief Lower triangular matrix adapter\n * \\tparam Matrix The adapted matrix\n *\/\ntemplate <typename Matrix>\nstruct lower_matrix;\n\n\/*!\n * \\brief Strictly lower triangular matrix adapter\n * \\tparam Matrix The adapted matrix\n *\/\ntemplate <typename Matrix>\nstruct strictly_lower_matrix;\n\n\/*!\n * \\brief Uni lower triangular matrix adapter\n * \\tparam Matrix The adapted matrix\n *\/\ntemplate <typename Matrix>\nstruct uni_lower_matrix;\n\n\/*!\n * \\brief A static matrix with fixed dimensions, in row-major order\n *\/\ntemplate <typename T, size_t... Dims>\nusing fast_matrix = fast_matrix_impl<T, cpp::aligned_array<T, alloc_size_mat<T, Dims...>(), default_intrinsic_traits<T>::alignment>, order::RowMajor, Dims...>;\n\n\/*!\n * \\brief A static matrix with fixed dimensions, in column-major order\n *\/\ntemplate <typename T, size_t... Dims>\nusing fast_matrix_cm = fast_matrix_impl<T, cpp::aligned_array<T, alloc_size_mat<T, Dims...>(), default_intrinsic_traits<T>::alignment>, order::ColumnMajor, Dims...>;\n\n\/*!\n * \\brief A static vector with fixed dimensions, in row-major order\n *\/\ntemplate <typename T, size_t Rows>\nusing fast_vector = fast_matrix_impl<T, cpp::aligned_array<T, alloc_size_vec<T>(Rows), default_intrinsic_traits<T>::alignment>, order::RowMajor, Rows>;\n\n\/*!\n * \\brief A static vector with fixed dimensions, in column-major order\n *\/\ntemplate <typename T, size_t Rows>\nusing fast_vector_cm = fast_matrix_impl<T, cpp::aligned_array<T, alloc_size_vec<T>(Rows), default_intrinsic_traits<T>::alignment>, order::ColumnMajor, Rows>;\n\n\/*!\n * \\brief A hybrid vector with fixed dimensions, in row-major order\n *\/\ntemplate <typename T, size_t Rows>\nusing fast_dyn_vector = fast_matrix_impl<T, cpp::aligned_vector<T, default_intrinsic_traits<T>::alignment>, order::RowMajor, Rows>;\n\n\/*!\n * \\brief A hybrid matrix with fixed dimensions, in row-major order\n *\/\ntemplate <typename T, size_t... Dims>\nusing fast_dyn_matrix = fast_matrix_impl<T, cpp::aligned_vector<T, default_intrinsic_traits<T>::alignment>, order::RowMajor, Dims...>;\n\n\/*!\n * \\brief A hybrid matrix with fixed dimensions, in specified order\n *\/\ntemplate <typename T, order SO, size_t... Dims>\nusing fast_dyn_matrix_o = fast_matrix_impl<T, cpp::aligned_vector<T, default_intrinsic_traits<T>::alignment>, SO, Dims...>;\n\n\/*!\n * \\brief A dynamic matrix, in row-major order, of D dimensions\n *\/\ntemplate <typename T, size_t D = 2>\nusing dyn_matrix = dyn_matrix_impl<T, order::RowMajor, D>;\n\n\/*!\n * \\brief A dynamic matrix, in column-major order, of D dimensions\n *\/\ntemplate <typename T, size_t D = 2>\nusing dyn_matrix_cm = dyn_matrix_impl<T, order::ColumnMajor, D>;\n\n\/*!\n * \\brief A dynamic matrix, in specific storage order, of D dimensions\n *\/\ntemplate <typename T, order SO, size_t D = 2>\nusing dyn_matrix_o = dyn_matrix_impl<T, SO, D>;\n\n\/*!\n * \\brief A dynamic vector, in row-major order\n *\/\ntemplate <typename T>\nusing dyn_vector = dyn_matrix_impl<T, order::RowMajor, 1>;\n\n\/*!\n * \\brief A dynamic matrix, in row-major order, of D dimensions\n *\/\ntemplate <typename T, size_t D = 2>\nusing custom_dyn_matrix = custom_dyn_matrix_impl<T, order::RowMajor, D>;\n\n\/*!\n * \\brief A dynamic matrix, in column-major order, of D dimensions\n *\/\ntemplate <typename T, size_t D = 2>\nusing custom_dyn_matrix_cm = custom_dyn_matrix_impl<T, order::ColumnMajor, D>;\n\n\/*!\n * \\brief A dynamic vector, in row-major order\n *\/\ntemplate <typename T>\nusing custom_dyn_vector = custom_dyn_matrix_impl<T, order::RowMajor, 1>;\n\n\/*!\n * \\brief A hybrid vector with fixed dimensions, in row-major order\n *\/\ntemplate <typename T, size_t Rows>\nusing custom_fast_vector = custom_fast_matrix_impl<T, cpp::array_wrapper<T>, order::RowMajor, Rows>;\n\n\/*!\n * \\brief A hybrid matrix with fixed dimensions, in row-major order\n *\/\ntemplate <typename T, size_t... Dims>\nusing custom_fast_matrix = custom_fast_matrix_impl<T, cpp::array_wrapper<T>, order::RowMajor, Dims...>;\n\n\/*!\n * \\brief A sparse matrix, of D dimensions\n *\/\ntemplate <typename T, size_t D = 2>\nusing sparse_matrix = sparse_matrix_impl<T, sparse_storage::COO, D>;\n\n} \/\/end of namespace etl\n<commit_msg>Complete the doc<commit_after>\/\/=======================================================================\n\/\/ Copyright (c) 2014-2017 Baptiste Wicht\n\/\/ Distributed under the terms of the MIT License.\n\/\/ (See accompanying file LICENSE or copy at\n\/\/ http:\/\/opensource.org\/licenses\/MIT)\n\/\/=======================================================================\n\n\/*!\n * \\file\n * \\brief Contains forward declarations and using declarations for\n * the various value types.\n *\/\n\n#pragma once\n\n#include <cstddef>\n#include \"cpp_utils\/array_wrapper.hpp\"\n#include \"cpp_utils\/aligned_vector.hpp\"\n#include \"cpp_utils\/aligned_array.hpp\"\n\nnamespace etl {\n\n\/*!\n * \\brief Compute the real size to allocate for a vector of the\n * given size and type\n * \\param size The number of elements of the vector\n * \\tparam T The type contained in the vector\n * \\return The size to be allocated\n *\/\ntemplate <typename T>\nstatic constexpr size_t alloc_size_vec(size_t size) {\n return padding\n ? size + (size % default_intrinsic_traits<T>::size == 0 ? 0 : (default_intrinsic_traits<T>::size - (size % default_intrinsic_traits<T>::size)))\n : size;\n}\n\n#ifdef ETL_ADVANCED_PADDING\n\n\/*!\n * \\brief Compute the real allocated size for a 2D matrix\n * \\tparam T the type of the elements of the matrix\n * \\param size The size of the matrix\n * \\param last The last dimension of the matrix\n * \\return the allocated size for the matrix\n *\/\ntemplate <typename T>\nstatic constexpr size_t alloc_size_mat(size_t size, size_t last) {\n return size == 0 ? 0 :\n (padding\n ? (size \/ last) * (last + (last % default_intrinsic_traits<T>::size == 0 ? 0 : (default_intrinsic_traits<T>::size - last % default_intrinsic_traits<T>::size)))\n : size);\n}\n\n#else\n\n\/*!\n * \\brief Compute the real allocated size for a 2D matrix\n * \\tparam T the type of the elements of the matrix\n * \\param size The size of the matrix\n * \\param last The last dimension of the matrix\n * \\return the allocated size for the matrix\n *\/\ntemplate <typename T>\nstatic constexpr size_t alloc_size_mat(size_t size, size_t last) {\n cpp_unused(last);\n return size == 0 ? 0 : alloc_size_vec<T>(size);\n}\n\n#endif\n\n\/*!\n * \\brief Compute the real allocated size for a matrix\n * \\tparam T the type of the elements of the matrix\n * \\tparam Dims The dimensions of the matrix\n * \\return the allocated size for the matrix\n *\/\ntemplate <typename T, size_t... Dims>\nstatic constexpr size_t alloc_size_mat() {\n return alloc_size_mat<T>(mul_all<Dims...>(), nth_size<sizeof...(Dims) - 1, 0, Dims...>::value);\n}\n\ntemplate <typename T, typename ST, order SO, size_t... Dims>\nstruct fast_matrix_impl;\n\ntemplate <typename T, typename ST, order SO, size_t... Dims>\nstruct custom_fast_matrix_impl;\n\ntemplate <typename T, order SO, size_t D = 2>\nstruct dyn_matrix_impl;\n\ntemplate <typename T, order SO, size_t D = 2>\nstruct custom_dyn_matrix_impl;\n\ntemplate <typename T, sparse_storage SS, size_t D>\nstruct sparse_matrix_impl;\n\ntemplate <typename Stream>\nstruct serializer;\n\ntemplate <typename Stream>\nstruct deserializer;\n\n\/*!\n * \\brief Symmetric matrix adapter\n * \\tparam Matrix The adapted matrix\n *\/\ntemplate <typename Matrix>\nstruct symmetric_matrix;\n\n\/*!\n * \\brief Hermitian matrix adapter\n * \\tparam Matrix The adapted matrix\n *\/\ntemplate <typename Matrix>\nstruct hermitian_matrix;\n\n\/*!\n * \\brief Diagonal matrix adapter\n * \\tparam Matrix The adapted matrix\n *\/\ntemplate <typename Matrix>\nstruct diagonal_matrix;\n\n\/*!\n * \\brief Upper triangular matrix adapter\n * \\tparam Matrix The adapted matrix\n *\/\ntemplate <typename Matrix>\nstruct upper_matrix;\n\n\/*!\n * \\brief Strictly upper triangular matrix adapter\n * \\tparam Matrix The adapted matrix\n *\/\ntemplate <typename Matrix>\nstruct strictly_upper_matrix;\n\n\/*!\n * \\brief Uni upper triangular matrix adapter\n * \\tparam Matrix The adapted matrix\n *\/\ntemplate <typename Matrix>\nstruct uni_upper_matrix;\n\n\/*!\n * \\brief Lower triangular matrix adapter\n * \\tparam Matrix The adapted matrix\n *\/\ntemplate <typename Matrix>\nstruct lower_matrix;\n\n\/*!\n * \\brief Strictly lower triangular matrix adapter\n * \\tparam Matrix The adapted matrix\n *\/\ntemplate <typename Matrix>\nstruct strictly_lower_matrix;\n\n\/*!\n * \\brief Uni lower triangular matrix adapter\n * \\tparam Matrix The adapted matrix\n *\/\ntemplate <typename Matrix>\nstruct uni_lower_matrix;\n\n\/*!\n * \\brief A static matrix with fixed dimensions, in row-major order\n *\/\ntemplate <typename T, size_t... Dims>\nusing fast_matrix = fast_matrix_impl<T, cpp::aligned_array<T, alloc_size_mat<T, Dims...>(), default_intrinsic_traits<T>::alignment>, order::RowMajor, Dims...>;\n\n\/*!\n * \\brief A static matrix with fixed dimensions, in column-major order\n *\/\ntemplate <typename T, size_t... Dims>\nusing fast_matrix_cm = fast_matrix_impl<T, cpp::aligned_array<T, alloc_size_mat<T, Dims...>(), default_intrinsic_traits<T>::alignment>, order::ColumnMajor, Dims...>;\n\n\/*!\n * \\brief A static vector with fixed dimensions, in row-major order\n *\/\ntemplate <typename T, size_t Rows>\nusing fast_vector = fast_matrix_impl<T, cpp::aligned_array<T, alloc_size_vec<T>(Rows), default_intrinsic_traits<T>::alignment>, order::RowMajor, Rows>;\n\n\/*!\n * \\brief A static vector with fixed dimensions, in column-major order\n *\/\ntemplate <typename T, size_t Rows>\nusing fast_vector_cm = fast_matrix_impl<T, cpp::aligned_array<T, alloc_size_vec<T>(Rows), default_intrinsic_traits<T>::alignment>, order::ColumnMajor, Rows>;\n\n\/*!\n * \\brief A hybrid vector with fixed dimensions, in row-major order\n *\/\ntemplate <typename T, size_t Rows>\nusing fast_dyn_vector = fast_matrix_impl<T, cpp::aligned_vector<T, default_intrinsic_traits<T>::alignment>, order::RowMajor, Rows>;\n\n\/*!\n * \\brief A hybrid matrix with fixed dimensions, in row-major order\n *\/\ntemplate <typename T, size_t... Dims>\nusing fast_dyn_matrix = fast_matrix_impl<T, cpp::aligned_vector<T, default_intrinsic_traits<T>::alignment>, order::RowMajor, Dims...>;\n\n\/*!\n * \\brief A hybrid matrix with fixed dimensions, in specified order\n *\/\ntemplate <typename T, order SO, size_t... Dims>\nusing fast_dyn_matrix_o = fast_matrix_impl<T, cpp::aligned_vector<T, default_intrinsic_traits<T>::alignment>, SO, Dims...>;\n\n\/*!\n * \\brief A dynamic matrix, in row-major order, of D dimensions\n *\/\ntemplate <typename T, size_t D = 2>\nusing dyn_matrix = dyn_matrix_impl<T, order::RowMajor, D>;\n\n\/*!\n * \\brief A dynamic matrix, in column-major order, of D dimensions\n *\/\ntemplate <typename T, size_t D = 2>\nusing dyn_matrix_cm = dyn_matrix_impl<T, order::ColumnMajor, D>;\n\n\/*!\n * \\brief A dynamic matrix, in specific storage order, of D dimensions\n *\/\ntemplate <typename T, order SO, size_t D = 2>\nusing dyn_matrix_o = dyn_matrix_impl<T, SO, D>;\n\n\/*!\n * \\brief A dynamic vector, in row-major order\n *\/\ntemplate <typename T>\nusing dyn_vector = dyn_matrix_impl<T, order::RowMajor, 1>;\n\n\/*!\n * \\brief A dynamic matrix, in row-major order, of D dimensions\n *\/\ntemplate <typename T, size_t D = 2>\nusing custom_dyn_matrix = custom_dyn_matrix_impl<T, order::RowMajor, D>;\n\n\/*!\n * \\brief A dynamic matrix, in column-major order, of D dimensions\n *\/\ntemplate <typename T, size_t D = 2>\nusing custom_dyn_matrix_cm = custom_dyn_matrix_impl<T, order::ColumnMajor, D>;\n\n\/*!\n * \\brief A dynamic vector, in row-major order\n *\/\ntemplate <typename T>\nusing custom_dyn_vector = custom_dyn_matrix_impl<T, order::RowMajor, 1>;\n\n\/*!\n * \\brief A hybrid vector with fixed dimensions, in row-major order\n *\/\ntemplate <typename T, size_t Rows>\nusing custom_fast_vector = custom_fast_matrix_impl<T, cpp::array_wrapper<T>, order::RowMajor, Rows>;\n\n\/*!\n * \\brief A hybrid matrix with fixed dimensions, in row-major order\n *\/\ntemplate <typename T, size_t... Dims>\nusing custom_fast_matrix = custom_fast_matrix_impl<T, cpp::array_wrapper<T>, order::RowMajor, Dims...>;\n\n\/*!\n * \\brief A sparse matrix, of D dimensions\n *\/\ntemplate <typename T, size_t D = 2>\nusing sparse_matrix = sparse_matrix_impl<T, sparse_storage::COO, D>;\n\n} \/\/end of namespace etl\n<|endoftext|>"} {"text":"<commit_before>#ifndef CTHREADRINGBUF\n#define CTHREADRINGBUF\n#include<atomic>\n#include<memory>\t\/\/allocator\n#include<vector>\n#include<utility>\t\/\/forward, move\n#include\"CSemaphore.hpp\"\n#include\"..\/algorithm\/algorithm.hpp\"\t\/\/for_each_val\n#include\"..\/tool\/CScopeGuard.hpp\"\n\nnamespace nThread\n{\n\t\/\/a fixed-sized and cannot overwrite when buffer is full\n\t\/\/T must meet the requirements of MoveAssignable and MoveConstructible \n\ttemplate<class T>\n\tclass CThreadRingBuf\n\t{\n\tpublic:\n\t\tusing allocator_type=std::allocator<T>;\n\t\tusing size_type=typename std::allocator<T>::size_type;\n\t\tusing value_type=T;\n\tprivate:\n\t\tusing pointer=typename std::allocator<T>::pointer;\n\t\tstatic allocator_type alloc_;\n\t\tconst pointer begin_;\n\t\tstd::vector<std::atomic<bool>> complete_;\n\t\tstd::atomic<size_type> read_subscript_;\n\t\tCSemaphore sema_;\n\t\tsize_type size_;\n\t\tstd::atomic<size_type> use_construct_;\n\t\tstd::atomic<size_type> write_subscript_;\n\t\t\/\/can only be used when your write will not overwrite the data\n\t\ttemplate<class TFwdRef>\n\t\tvoid write_(TFwdRef &&val)\n\t\t{\n\t\t\tsema_.signal();\n\t\t\tconst auto write{write_subscript_++};\n\t\t\twhile(complete_[write%size()].load(std::memory_order_acquire))\n\t\t\t\t;\n\t\t\tif(write<size()&&use_construct_++<size())\n\t\t\t\talloc_.construct(begin_+write,std::forward<TFwdRef>(val));\n\t\t\telse\n\t\t\t\tbegin_[write%size()]=std::forward<TFwdRef>(val);\n\t\t\tcomplete_[write%size()].store(true,std::memory_order_release);\n\t\t}\n\tpublic:\n\t\texplicit CThreadRingBuf(const size_type size)\n\t\t\t:begin_{alloc_.allocate(size)},complete_(size),size_{size}{}\n\t\tinline size_type available() const noexcept\n\t\t{\n\t\t\treturn static_cast<size_type>(sema_.count());\n\t\t}\n\t\tvalue_type read()\n\t\t{\n\t\t\tsema_.wait();\n\t\t\tconst auto read{(read_subscript_++)%size()};\n\t\t\twhile(!complete_[read].load(std::memory_order_acquire))\n\t\t\t\t;\n\t\t\tnTool::CScopeGuard sg{[&]{complete_[read].store(false,std::memory_order_release);}};\n\t\t\treturn std::move(begin_[read]);\n\t\t}\n\t\tinline size_type size() const noexcept\n\t\t{\n\t\t\treturn size_;\n\t\t}\n\t\tinline void write(const T &val)\n\t\t{\n\t\t\twrite_(val);\n\t\t}\n\t\tinline void write(T &&val)\n\t\t{\n\t\t\twrite_(std::move(val));\n\t\t}\n\t\t~CThreadRingBuf()\n\t\t{\n\t\t\tnAlgorithm::for_each_val(begin_,begin_+size(),[&](const auto p){alloc_.destroy(p);});\n\t\t\talloc_.deallocate(begin_,size());\n\t\t}\n\t};\n\n\ttemplate<class T>\n\ttypename CThreadRingBuf<T>::allocator_type CThreadRingBuf<T>::alloc_;\n}\n\n#endif<commit_msg>replace move to move_if_noexcept<commit_after>#ifndef CTHREADRINGBUF\n#define CTHREADRINGBUF\n#include<atomic>\n#include<memory>\t\/\/allocator\n#include<vector>\n#include<utility>\t\/\/forward, move, move_if_noexcept\n#include\"CSemaphore.hpp\"\n#include\"..\/algorithm\/algorithm.hpp\"\t\/\/for_each_val\n#include\"..\/tool\/CScopeGuard.hpp\"\n\nnamespace nThread\n{\n\t\/\/a fixed-sized and cannot overwrite when buffer is full\n\ttemplate<class T>\n\tclass CThreadRingBuf\n\t{\n\tpublic:\n\t\tusing allocator_type=std::allocator<T>;\n\t\tusing size_type=typename std::allocator<T>::size_type;\n\t\tusing value_type=T;\n\tprivate:\n\t\tusing pointer=typename std::allocator<T>::pointer;\n\t\tstatic allocator_type alloc_;\n\t\tconst pointer begin_;\n\t\tstd::vector<std::atomic<bool>> complete_;\n\t\tstd::atomic<size_type> read_subscript_;\n\t\tCSemaphore sema_;\n\t\tsize_type size_;\n\t\tstd::atomic<size_type> use_construct_;\n\t\tstd::atomic<size_type> write_subscript_;\n\t\t\/\/can only be used when your write will not overwrite the data\n\t\ttemplate<class TFwdRef>\n\t\tvoid write_(TFwdRef &&val)\n\t\t{\n\t\t\tsema_.signal();\n\t\t\tconst auto write{write_subscript_++};\n\t\t\twhile(complete_[write%size()].load(std::memory_order_acquire))\n\t\t\t\t;\n\t\t\tif(write<size()&&use_construct_++<size())\n\t\t\t\talloc_.construct(begin_+write,std::forward<TFwdRef>(val));\n\t\t\telse\n\t\t\t\tbegin_[write%size()]=std::forward<TFwdRef>(val);\n\t\t\tcomplete_[write%size()].store(true,std::memory_order_release);\n\t\t}\n\tpublic:\n\t\texplicit CThreadRingBuf(const size_type size)\n\t\t\t:begin_{alloc_.allocate(size)},complete_(size),size_{size}{}\n\t\tinline size_type available() const noexcept\n\t\t{\n\t\t\treturn static_cast<size_type>(sema_.count());\n\t\t}\n\t\tvalue_type read()\n\t\t{\n\t\t\tsema_.wait();\n\t\t\tconst auto read{(read_subscript_++)%size()};\n\t\t\twhile(!complete_[read].load(std::memory_order_acquire))\n\t\t\t\t;\n\t\t\tnTool::CScopeGuard sg{[&]{complete_[read].store(false,std::memory_order_release);}};\n\t\t\treturn std::move_if_noexcept(begin_[read]);\n\t\t}\n\t\tinline size_type size() const noexcept\n\t\t{\n\t\t\treturn size_;\n\t\t}\n\t\tinline void write(const T &val)\n\t\t{\n\t\t\twrite_(val);\n\t\t}\n\t\tinline void write(T &&val)\n\t\t{\n\t\t\twrite_(std::move(val));\n\t\t}\n\t\t~CThreadRingBuf()\n\t\t{\n\t\t\tnAlgorithm::for_each_val(begin_,begin_+size(),[&](const auto p){alloc_.destroy(p);});\n\t\t\talloc_.deallocate(begin_,size());\n\t\t}\n\t};\n\n\ttemplate<class T>\n\ttypename CThreadRingBuf<T>::allocator_type CThreadRingBuf<T>::alloc_;\n}\n\n#endif<|endoftext|>"} {"text":"<commit_before>\/** \\file jsonv\/forward.hpp\n * \n * Copyright (c) 2012-2014 by Travis Gockel. All rights reserved.\n *\n * This program is free software: you can redistribute it and\/or modify it under the terms of the Apache License\n * as published by the Apache Software Foundation, either version 2 of the License, or (at your option) any later\n * version.\n *\n * \\author Travis Gockel (travis@gockelhut.com)\n**\/\n#ifndef __JSONV_FORWARD_HPP_INCLUDED__\n#define __JSONV_FORWARD_HPP_INCLUDED__\n\nnamespace jsonv\n{\n\nclass encoder;\nenum class kind : unsigned char;\nclass kind_error;\nclass parse_error;\nclass parse_options;\nclass path;\nclass path_element;\nenum class path_element_kind : unsigned char;\nclass tokenizer;\nenum class token_kind : unsigned int;\nclass value;\nstruct version;\n\n}\n\n#endif\/*__JSONV_FORWARD_HPP_INCLUDED__*\/\n<commit_msg>Adds serialization classes to forwards.<commit_after>\/** \\file jsonv\/forward.hpp\n * \n * Copyright (c) 2012-2014 by Travis Gockel. All rights reserved.\n *\n * This program is free software: you can redistribute it and\/or modify it under the terms of the Apache License\n * as published by the Apache Software Foundation, either version 2 of the License, or (at your option) any later\n * version.\n *\n * \\author Travis Gockel (travis@gockelhut.com)\n**\/\n#ifndef __JSONV_FORWARD_HPP_INCLUDED__\n#define __JSONV_FORWARD_HPP_INCLUDED__\n\nnamespace jsonv\n{\n\nclass adapter;\nclass encoder;\nclass extractor;\nclass extraction_context;\nclass formats;\nenum class kind : unsigned char;\nclass kind_error;\nclass parse_error;\nclass parse_options;\nclass path;\nclass path_element;\nenum class path_element_kind : unsigned char;\nclass serializer;\nclass serialization_context;\nclass tokenizer;\nenum class token_kind : unsigned int;\nclass value;\nstruct version;\n\n}\n\n#endif\/*__JSONV_FORWARD_HPP_INCLUDED__*\/\n<|endoftext|>"} {"text":"<commit_before>\/*! \\file kernel\/userver.hh\n *******************************************************************************\n\n File: userver.h\\n\n Definition of the USystem class.\n\n This file is part of\n %URBI Kernel, version __kernelversion__\\n\n (c) Jean-Christophe Baillie, 2004-2005.\n\n Permission to use, copy, modify, and redistribute this software for\n non-commercial use is hereby granted.\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 For more information, comments, bug reports: http:\/\/www.urbiforge.net\n\n **************************************************************************** *\/\n\n#ifndef KERNEL_USERVER_HH\n# define KERNEL_USERVER_HH\n\n# include <cstdarg>\n# include <sstream>\n\n# include <libport\/config.h>\n# if ! defined LIBPORT_URBI_ENV_AIBO\n# include <boost\/thread.hpp>\n# endif\n\n# include <libport\/fwd.hh>\n# include <libport\/compiler.hh>\n# include <libport\/file-library.hh>\n# include <libport\/ufloat.h>\n# include <libport\/utime.hh>\n\n# include \"kernel\/fwd.hh\"\n# include \"kernel\/utypes.hh\"\n\nnamespace runner\n{\n class Runner;\n}\n\nnamespace scheduler\n{\n class Scheduler;\n}\n\nextern const char* DISPLAY_FORMAT;\nextern const char* DISPLAY_FORMAT1;\nextern const char* DISPLAY_FORMAT2;\n\n\n\/\/\/ Global variable for the server\nextern class UServer* urbiserver;\n\n\n\/\/! UServer class: handles all URBI system processing.\n\/*! There must be one UServer defined in the program and it must be overloaded\n to make it specific to the particular robot.\n\n UServer is used to store the UConnection list and the UDevice list.\n This object does all the internal processing of URBI and handles the pool\n of UCommand's.\n*\/\nclass UServer\n{\npublic:\n UServer(const char* mainName);\n virtual ~UServer ();\n\npublic:\n \/\/! Initialization of the server. Displays the header message & init stuff\n \/*! This function must be called once the server is operational and\n able to print messages. It is a requirement for URBI compliance to print\n the header at start, so this function *must* be called. Beside, it also\n do initalization work for the devices and system variables.\n *\/\n void initialize ();\n\n \/\/\/ Process the jobs.\n \/\/\/ \\return the time when should be called again.\n libport::utime_t work ();\n\n \/\/\/ Set the system.args list in URBI.\n void main (int argc, const char* argv[]);\n\n\n \/\/\/ Package information about this server.\n static const libport::PackageInfo& package_info ();\n\n \/\/! Displays a formatted error message.\n \/*! This function uses the virtual URobot::display() function to make the\n message printing robot-specific.\n \n It formats the output in a standard URBI way by adding an ERROR key\n between brackets at the end.\n *\/\n void error (const char* s, ...)\n __attribute__ ((__format__ (__printf__, 2, 3)));\n\n \/\/! Displays a formatted message.\n \/*! This function uses the virtual URobot::display() function to make the\n message printing robot-specific.\n \n It formats the output in a standard URBI way by adding an empty key\n between brackets at the end. If you want to specify a key, use the\n echoKey() function.\n \\param s is the formatted string containing the message.\n \\sa echoKey()\n *\/\n void echo (const char* s, ...)\n __attribute__ ((__format__ (__printf__, 2, 3)));\n\n\n \/\/! Display a formatted message, with a key.\n \/*! This function uses the virtual URobot::display() function to make the\n message printing robot-specific.\n It formats the output in a standard URBI way by adding a key between\n brackets at the end. This key can be \"\" or NULL.It can be used to\n visually extract information from the flux of messages printed by\n the server.\n \\param key is the message key. Maxlength = 5 chars.\n \\param s is the formatted string containing the message.\n \\param args Arguments for the format string.\n *\/\n void vecho_key (const char* key, const char* s, va_list args)\n __attribute__ ((__format__ (__printf__, 3, 0)));\n void echoKey (const char* key, const char* s, ...)\n __attribute__ ((__format__ (__printf__, 3, 4)));\n\n \/\/\/ Send debugging data.\n \/*! This function uses the virtual URobot::display() function to make the\n message printing robot-specific.\n\n \\param s is the formatted string containing the message\n \\param args Arguments for the format string.\n *\/\n void vdebug (const char* s, va_list args)\n __attribute__ ((__format__ (__printf__, 2, 0)));\n void debug (const char* s, ...)\n __attribute__ ((__format__ (__printf__, 2, 3)));\n\n \/\/! Overload this function to return the running time of the server.\n \/*! The running time of the server must be in milliseconds.\n *\/\n virtual libport::utime_t getTime () = 0;\n\n \/\/! Overload this function to return the remaining power of the robot\n \/*! The remaining power is expressed as percentage. 0 for empty batteries\n and 1 for full power.\n *\/\n virtual ufloat getPower () = 0;\n\n \/\/! Overload this function to return a specific header for your URBI server\n \/*! Used to give some information specific to your server in the standardized\n header which is displayed on the server output at start and in the\n connection when a new connection is created.\\n\n Typical custom header should be like:\n\n *** URBI version xx.xx for \\<robotname\\> robot\\\\n\\n\n *** (c) Copyright \\<year\\> \\<name\\>\\\\n\n\n The function should return in header the line corresponding to 'line'\n or an empty string (not NULL!) when there is no line any more.\n Each line is supposed to end with a carriage return \\\\n and each line should\n start with three empty spaces. This complicated method is necessary to allow\n the connection to stamp every line with the standard URBI prefix [time:tag].\n\n \\param line is the requested line number\n \\param header the custom header\n \\param maxlength the maximum length allowed for the header (the parameter\n has been malloc'ed for that size). Typical size is 1024 octets and\n should be enough for any reasonable header.\n *\/\n virtual void getCustomHeader (int line, char* header,\n\t\t\t\t int maxlength) = 0;\n\n \/\/\/ Path to explore when looking for .u files.\n libport::file_library search_path;\n\n \/\/\/ Return the full file name, handle paths.\n \/\/\/ Return \\a f on failure.\n virtual std::string find_file (const libport::path& path);\n\n \/\/\/ Type of UCommandQueue\n enum QueueType {\n \/\/\/ The UComandQueue contains URBI code.\n QUEUE_URBI,\n \/\/\/ THe UCommandQueu contains data, not to be messed with.\n QUEUE_DATA\n };\n\n \/\/\/ Load a file into the connection.\n \/\/\/ Returns UFAIL if anything goes wrong, USUCCESS otherwise.\n virtual UErrorValue loadFile (const std::string& file_name,\n\t\t\t\tUQueue& loadQueue,\n\t\t\t\tQueueType t=QUEUE_URBI);\n\n \/\/\/ Load \\a fn in the ghostqueue.\n UErrorValue load_init_file(const char* fn);\n\n \/\/\/ Save content to a file\n \/\/\/ This function must be redefined by the robot-specific server.\n \/\/\/ Returns UFAIL if anything goes wrong, USUCCESS otherwise.\n virtual UErrorValue saveFile (const std::string& filename,\n\t\t\t\tconst std::string& content) = 0;\n\n void mark (UString* stopTag);\n\n \/\/! Overload this function to specify how your system will reboot\n virtual void reboot () = 0;\n\n \/\/! Overload this function to specify how your system will shutdown\n virtual void shutdown ();\n\n \/\/! Function called before work\n \/*! Redefine this virtual function if you need to do pre-processing before\n the work function starts.\n *\/\n virtual void beforeWork ();\n\n \/\/! Function called after work\n \/*! Redefine this virtual function if you need to do post-processing\n before the work function ends.\n *\/\n virtual void afterWork ();\n\n \/\/\/ Display a message on the robot console.\n void display (const char*);\n \/\/\/ Display a set of messages on the robot console.\n void display (const char**);\n\n \/\/! Accessor for lastTime_.\n libport::utime_t lastTime ();\n\n \/\/! Update lastTime_ to current time.\n \/\/! Update the server's time using the robot-specific implementation\n \/*! It is necessary to have an update of the server time to\n increase the performance of successive calls to getTime.\n It allows also to see a whole processing session (like the\n processing of the command tree) as occuring AT the same time,\n from the server's point of view.\n *\/\n void updateTime ();\n\n\n \/*--------------.\n | Connections. |\n `--------------*\/\n\n \/\/\/ Add a new connection to the connection list.\n \/\/\/ Take ownership on c. Also perform some error testing on the connection\n \/\/\/ value and UError return code\n \/\/\/ \\precondition c != 0\n void connection_add(UConnection* c);\n\n \/\/\/ Remove from the connection list.\n \/\/\/ This function perform also some error testing on the connection\n \/\/\/ value and UError return code\n \/\/\/ Destroy \\a c.\n void connection_remove(UConnection* c);\n\n \/\/ A usual connection to stop dependencies.\n UConnection& getGhostConnection();\n\n\n \/*--------------------.\n | Scheduler, runner. |\n `--------------------*\/\npublic:\n const scheduler::Scheduler& getScheduler () const;\n scheduler::Scheduler& getScheduler ();\n\n runner::Runner& getCurrentRunner () const;\n\nprotected:\n \/\/! Overload this function to specify how your robot is displaying messages.\n virtual void effectiveDisplay (const char*) = 0;\n\nprivate:\n \/\/ Pointer to stop the header dependency.\n scheduler::Scheduler* scheduler_;\n\n\nprivate:\n \/\/\/ \\{ Various parts of @c UServer::work.\n \/\/\/ Scan currently opened connections for ongoing work\n void work_handle_connections_ ();\n \/\/\/ Scan currently opened connections for deleting marked commands or\n \/\/\/ killall order\n void work_handle_stopall_ ();\n void work_test_cpuoverload_ ();\n \/\/\/ \\}\n\npublic:\n \/\/\/ Shows debug or not.\n bool debugOutput;\n\n# if ! defined LIBPORT_URBI_ENV_AIBO\n \/\/\/ Used to synchronize message reception.\n boost::recursive_mutex mutex;\n# endif\n\nprivate:\n \/\/\/ Name of the main device.\n std::string mainName_;\n\npublic:\n \/\/\/ Stops all commands in all connections.\n bool stopall;\n\n\n\n enum\n {\n \/\/\/ Urbi TCP Port.\n TCP_PORT = 54000,\n \/\/\/ Used by echo() & error().\n \/\/ FIXME: Because of this stupid hard limit, we can't produce\n \/\/ large outputs! We should move to using C++. Or some scheme\n \/\/ that is robust to the size of the message.\n MAXSIZE_INTERNALMESSAGE = 8192,\n };\n\nprivate:\n \/\/\/ Store the time on the last call to updateTime().\n libport::utime_t lastTime_;\n\n \/\/\/ List of active connections: includes one UGhostConnection.\n \/\/ FIXME: This is meant to become a runner::Job and move out of this class.\n std::list<UConnection*> connections_;\n\n \/\/\/ The ghost connection used for URBI.INI.\n UGhostConnection* ghost_;\n};\n\n\/*-------------------------.\n| Freestanding functions. |\n`-------------------------*\/\n\n\/\/\/ Send debugging messages via ::urbiserver.\nvoid vdebug (const char* fmt, va_list args)\n __attribute__ ((__format__ (__printf__, 1, 0)));\n\n\/\/\/ Send debugging messages via ::urbiserver.\nvoid debug (const char* fmt, ...)\n __attribute__ ((__format__ (__printf__, 1, 2)));\n\n\/\/ Send debugging messages.\n# if URBI_DEBUG\n\/\/ Must be invoked with two pairs of parens.\n# define DEBUG(Msg) debug Msg\n# else\n# define DEBUG(Msg) ((void) 0)\n# endif\n\n# include <kernel\/userver.hxx>\n\n#endif \/\/ !KERNEL_USERVER_HH\n<commit_msg>Do not repeat what is in fwd.hh<commit_after>\/*! \\file kernel\/userver.hh\n *******************************************************************************\n\n File: userver.h\\n\n Definition of the USystem class.\n\n This file is part of\n %URBI Kernel, version __kernelversion__\\n\n (c) Jean-Christophe Baillie, 2004-2005.\n\n Permission to use, copy, modify, and redistribute this software for\n non-commercial use is hereby granted.\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 For more information, comments, bug reports: http:\/\/www.urbiforge.net\n\n **************************************************************************** *\/\n\n#ifndef KERNEL_USERVER_HH\n# define KERNEL_USERVER_HH\n\n# include <cstdarg>\n# include <sstream>\n\n# include <libport\/config.h>\n# if ! defined LIBPORT_URBI_ENV_AIBO\n# include <boost\/thread.hpp>\n# endif\n\n# include <libport\/fwd.hh>\n# include <libport\/compiler.hh>\n# include <libport\/file-library.hh>\n# include <libport\/ufloat.h>\n# include <libport\/utime.hh>\n\n# include \"kernel\/fwd.hh\"\n# include \"kernel\/utypes.hh\"\n\n# include \"runner\/fwd.hh\"\n# include \"scheduler\/fwd.hh\"\n\nextern const char* DISPLAY_FORMAT;\nextern const char* DISPLAY_FORMAT1;\nextern const char* DISPLAY_FORMAT2;\n\n\n\/\/\/ Global variable for the server\nextern class UServer* urbiserver;\n\n\n\/\/! UServer class: handles all URBI system processing.\n\/*! There must be one UServer defined in the program and it must be overloaded\n to make it specific to the particular robot.\n\n UServer is used to store the UConnection list and the UDevice list.\n This object does all the internal processing of URBI and handles the pool\n of UCommand's.\n*\/\nclass UServer\n{\npublic:\n UServer(const char* mainName);\n virtual ~UServer ();\n\npublic:\n \/\/! Initialization of the server. Displays the header message & init stuff\n \/*! This function must be called once the server is operational and\n able to print messages. It is a requirement for URBI compliance to print\n the header at start, so this function *must* be called. Beside, it also\n do initalization work for the devices and system variables.\n *\/\n void initialize ();\n\n \/\/\/ Process the jobs.\n \/\/\/ \\return the time when should be called again.\n libport::utime_t work ();\n\n \/\/\/ Set the system.args list in URBI.\n void main (int argc, const char* argv[]);\n\n\n \/\/\/ Package information about this server.\n static const libport::PackageInfo& package_info ();\n\n \/\/! Displays a formatted error message.\n \/*! This function uses the virtual URobot::display() function to make the\n message printing robot-specific.\n \n It formats the output in a standard URBI way by adding an ERROR key\n between brackets at the end.\n *\/\n void error (const char* s, ...)\n __attribute__ ((__format__ (__printf__, 2, 3)));\n\n \/\/! Displays a formatted message.\n \/*! This function uses the virtual URobot::display() function to make the\n message printing robot-specific.\n \n It formats the output in a standard URBI way by adding an empty key\n between brackets at the end. If you want to specify a key, use the\n echoKey() function.\n \\param s is the formatted string containing the message.\n \\sa echoKey()\n *\/\n void echo (const char* s, ...)\n __attribute__ ((__format__ (__printf__, 2, 3)));\n\n\n \/\/! Display a formatted message, with a key.\n \/*! This function uses the virtual URobot::display() function to make the\n message printing robot-specific.\n It formats the output in a standard URBI way by adding a key between\n brackets at the end. This key can be \"\" or NULL.It can be used to\n visually extract information from the flux of messages printed by\n the server.\n \\param key is the message key. Maxlength = 5 chars.\n \\param s is the formatted string containing the message.\n \\param args Arguments for the format string.\n *\/\n void vecho_key (const char* key, const char* s, va_list args)\n __attribute__ ((__format__ (__printf__, 3, 0)));\n void echoKey (const char* key, const char* s, ...)\n __attribute__ ((__format__ (__printf__, 3, 4)));\n\n \/\/\/ Send debugging data.\n \/*! This function uses the virtual URobot::display() function to make the\n message printing robot-specific.\n\n \\param s is the formatted string containing the message\n \\param args Arguments for the format string.\n *\/\n void vdebug (const char* s, va_list args)\n __attribute__ ((__format__ (__printf__, 2, 0)));\n void debug (const char* s, ...)\n __attribute__ ((__format__ (__printf__, 2, 3)));\n\n \/\/! Overload this function to return the running time of the server.\n \/*! The running time of the server must be in milliseconds.\n *\/\n virtual libport::utime_t getTime () = 0;\n\n \/\/! Overload this function to return the remaining power of the robot\n \/*! The remaining power is expressed as percentage. 0 for empty batteries\n and 1 for full power.\n *\/\n virtual ufloat getPower () = 0;\n\n \/\/! Overload this function to return a specific header for your URBI server\n \/*! Used to give some information specific to your server in the standardized\n header which is displayed on the server output at start and in the\n connection when a new connection is created.\\n\n Typical custom header should be like:\n\n *** URBI version xx.xx for \\<robotname\\> robot\\\\n\\n\n *** (c) Copyright \\<year\\> \\<name\\>\\\\n\n\n The function should return in header the line corresponding to 'line'\n or an empty string (not NULL!) when there is no line any more.\n Each line is supposed to end with a carriage return \\\\n and each line should\n start with three empty spaces. This complicated method is necessary to allow\n the connection to stamp every line with the standard URBI prefix [time:tag].\n\n \\param line is the requested line number\n \\param header the custom header\n \\param maxlength the maximum length allowed for the header (the parameter\n has been malloc'ed for that size). Typical size is 1024 octets and\n should be enough for any reasonable header.\n *\/\n virtual void getCustomHeader (int line, char* header,\n\t\t\t\t int maxlength) = 0;\n\n \/\/\/ Path to explore when looking for .u files.\n libport::file_library search_path;\n\n \/\/\/ Return the full file name, handle paths.\n \/\/\/ Return \\a f on failure.\n virtual std::string find_file (const libport::path& path);\n\n \/\/\/ Type of UCommandQueue\n enum QueueType {\n \/\/\/ The UComandQueue contains URBI code.\n QUEUE_URBI,\n \/\/\/ THe UCommandQueu contains data, not to be messed with.\n QUEUE_DATA\n };\n\n \/\/\/ Load a file into the connection.\n \/\/\/ Returns UFAIL if anything goes wrong, USUCCESS otherwise.\n virtual UErrorValue loadFile (const std::string& file_name,\n\t\t\t\tUQueue& loadQueue,\n\t\t\t\tQueueType t=QUEUE_URBI);\n\n \/\/\/ Load \\a fn in the ghostqueue.\n UErrorValue load_init_file(const char* fn);\n\n \/\/\/ Save content to a file\n \/\/\/ This function must be redefined by the robot-specific server.\n \/\/\/ Returns UFAIL if anything goes wrong, USUCCESS otherwise.\n virtual UErrorValue saveFile (const std::string& filename,\n\t\t\t\tconst std::string& content) = 0;\n\n void mark (UString* stopTag);\n\n \/\/! Overload this function to specify how your system will reboot\n virtual void reboot () = 0;\n\n \/\/! Overload this function to specify how your system will shutdown\n virtual void shutdown ();\n\n \/\/! Function called before work\n \/*! Redefine this virtual function if you need to do pre-processing before\n the work function starts.\n *\/\n virtual void beforeWork ();\n\n \/\/! Function called after work\n \/*! Redefine this virtual function if you need to do post-processing\n before the work function ends.\n *\/\n virtual void afterWork ();\n\n \/\/\/ Display a message on the robot console.\n void display (const char*);\n \/\/\/ Display a set of messages on the robot console.\n void display (const char**);\n\n \/\/! Accessor for lastTime_.\n libport::utime_t lastTime ();\n\n \/\/! Update lastTime_ to current time.\n \/\/! Update the server's time using the robot-specific implementation\n \/*! It is necessary to have an update of the server time to\n increase the performance of successive calls to getTime.\n It allows also to see a whole processing session (like the\n processing of the command tree) as occuring AT the same time,\n from the server's point of view.\n *\/\n void updateTime ();\n\n\n \/*--------------.\n | Connections. |\n `--------------*\/\n\n \/\/\/ Add a new connection to the connection list.\n \/\/\/ Take ownership on c. Also perform some error testing on the connection\n \/\/\/ value and UError return code\n \/\/\/ \\precondition c != 0\n void connection_add(UConnection* c);\n\n \/\/\/ Remove from the connection list.\n \/\/\/ This function perform also some error testing on the connection\n \/\/\/ value and UError return code\n \/\/\/ Destroy \\a c.\n void connection_remove(UConnection* c);\n\n \/\/ A usual connection to stop dependencies.\n UConnection& getGhostConnection();\n\n\n \/*--------------------.\n | Scheduler, runner. |\n `--------------------*\/\npublic:\n const scheduler::Scheduler& getScheduler () const;\n scheduler::Scheduler& getScheduler ();\n\n runner::Runner& getCurrentRunner () const;\n\nprotected:\n \/\/! Overload this function to specify how your robot is displaying messages.\n virtual void effectiveDisplay (const char*) = 0;\n\nprivate:\n \/\/ Pointer to stop the header dependency.\n scheduler::Scheduler* scheduler_;\n\n\nprivate:\n \/\/\/ \\{ Various parts of @c UServer::work.\n \/\/\/ Scan currently opened connections for ongoing work\n void work_handle_connections_ ();\n \/\/\/ Scan currently opened connections for deleting marked commands or\n \/\/\/ killall order\n void work_handle_stopall_ ();\n void work_test_cpuoverload_ ();\n \/\/\/ \\}\n\npublic:\n \/\/\/ Shows debug or not.\n bool debugOutput;\n\n# if ! defined LIBPORT_URBI_ENV_AIBO\n \/\/\/ Used to synchronize message reception.\n boost::recursive_mutex mutex;\n# endif\n\nprivate:\n \/\/\/ Name of the main device.\n std::string mainName_;\n\npublic:\n \/\/\/ Stops all commands in all connections.\n bool stopall;\n\n\n\n enum\n {\n \/\/\/ Urbi TCP Port.\n TCP_PORT = 54000,\n \/\/\/ Used by echo() & error().\n \/\/ FIXME: Because of this stupid hard limit, we can't produce\n \/\/ large outputs! We should move to using C++. Or some scheme\n \/\/ that is robust to the size of the message.\n MAXSIZE_INTERNALMESSAGE = 8192,\n };\n\nprivate:\n \/\/\/ Store the time on the last call to updateTime().\n libport::utime_t lastTime_;\n\n \/\/\/ List of active connections: includes one UGhostConnection.\n \/\/ FIXME: This is meant to become a runner::Job and move out of this class.\n std::list<UConnection*> connections_;\n\n \/\/\/ The ghost connection used for URBI.INI.\n UGhostConnection* ghost_;\n};\n\n\/*-------------------------.\n| Freestanding functions. |\n`-------------------------*\/\n\n\/\/\/ Send debugging messages via ::urbiserver.\nvoid vdebug (const char* fmt, va_list args)\n __attribute__ ((__format__ (__printf__, 1, 0)));\n\n\/\/\/ Send debugging messages via ::urbiserver.\nvoid debug (const char* fmt, ...)\n __attribute__ ((__format__ (__printf__, 1, 2)));\n\n\/\/ Send debugging messages.\n# if URBI_DEBUG\n\/\/ Must be invoked with two pairs of parens.\n# define DEBUG(Msg) debug Msg\n# else\n# define DEBUG(Msg) ((void) 0)\n# endif\n\n# include <kernel\/userver.hxx>\n\n#endif \/\/ !KERNEL_USERVER_HH\n<|endoftext|>"} {"text":"<commit_before>\/\/\/ \\file libport\/ufloat.hh\n\/\/\/ \\brief Definition of the ufloat classes.\n\n#ifndef LIBPORT_UFLOAT_HH\n# define LIBPORT_UFLOAT_HH\n\n# include <libport\/config.h>\n\n# include <float.h>\n# include <exception>\n\n\/*-----------------.\n| Ufloat support. |\n`-----------------*\/\n\n# ifdef LIBPORT_URBI_UFLOAT_FLOAT\nnamespace libport\n{\n typedef float ufloat;\n# define UFLT_EPSILON FLT_EPSILON\n\n inline long long to_long_long (ufloat u);\n}\n# endif\n\n# ifdef LIBPORT_URBI_UFLOAT_DOUBLE\nnamespace libport\n{\n typedef double ufloat;\n# define UFLT_EPSILON DBL_EPSILON\n\n inline long long to_long_long (ufloat u);\n}\n# endif\n\n# ifdef LIBPORT_URBI_UFLOAT_LONG\n# include <libport\/ulong-fixed-point.hh>\n# endif\n\n# ifdef LIBPORT_URBI_UFLOAT_LONG_LONG\n# include <libport\/ull-fixed-point.hh>\n# endif\n\n# ifdef LIBPORT_URBI_UFLOAT_FLOATING\n# include <libport\/uffloat.hh>\n# endif\n\n\nnamespace libport\n{\n static const ufloat PI(3.14159265358979323846264338327950288);\n static const ufloat UINFINITY(999999999999999.0);\n}\n\n\n\/*-------------------.\n| Ufloat tabulated. |\n`-------------------*\/\n\n# ifdef LIBPORT_URBI_UFLOAT_TABULATED\nnamespace libport\n{\n \/** @return the tabulated sinus of given @a angle in radian, using linear\n * interpolation. *\/\n ufloat tabulatedSin(ufloat angle);\n\n \/** @return the tabulated cosinus of given @a angle in radian, using linear\n * interpolation. *\/\n ufloat tabulatedCos(ufloat angle);\n\n \/** @return the tabulated arcsinus of given @a angle, in radian, using\n * linear interpolation. *\/\n ufloat tabulatedASin(ufloat angle);\n\n \/** @return the tabulated arccosinus of given @a angle, in radian, using\n * linear interpolation. *\/\n inline ufloat tabulatedACos(ufloat angle);\n\n inline ufloat sin(ufloat angle);\n inline ufloat cos(ufloat angle);\n inline ufloat tan(ufloat angle);\n\n inline ufloat asin(ufloat angle);\n inline ufloat acos(ufloat angle);\n}\n# endif\n\n# include <libport\/config.h>\n\/* round is not C++ standard (not even POSIX) and neither gnulib nor Boost\n * provide one. So here is my quick replacement. *\/\n# ifndef LIBPORT_HAVE_ROUND\n# include <cmath>\nnamespace libport\n{\n inline float round (float d);\n inline double round (double d);\n inline long double round (long double d);\n\n}\n# endif \/* !LIBPORT_HAVE_ROUND *\/\n\n\/* trunc is not C++ standard (not even POSIX) and although gnulib says it\n * provides a replacement in its manual, in fact it doesn't, nor does Boost.\n * So here is my quick replacement. *\/\n# ifndef LIBPORT_HAVE_TRUNC\n# include <cmath>\nnamespace libport\n{\n inline double trunc (double d);\n}\n# endif \/* !LIBPORT_HAVE_TRUNC *\/\n\n\/* Float to int converter. *\/\nnamespace libport\n{\n struct bad_numeric_cast : public std::exception {};\n\n \/\/\/ Convert a libport::ufloat to a int. Raise\n \/\/\/ libport::bad_numeric_cast if the provided argument is not\n \/\/\/ directly convertible to an integer.\n int ufloat_to_int(ufloat val);\n long long ufloat_to_long_long(ufloat val);\n\n} \/\/ namespace libport\n\n# include <libport\/ufloat.hxx>\n\n#endif \/\/ !LIBPORT_UFLOAT_HH\n<commit_msg>Missing API.<commit_after>\/\/\/ \\file libport\/ufloat.hh\n\/\/\/ \\brief Definition of the ufloat classes.\n\n#ifndef LIBPORT_UFLOAT_HH\n# define LIBPORT_UFLOAT_HH\n\n# include <libport\/config.h>\n# include <libport\/export.hh>\n\n# include <cfloat>\n# include <exception>\n\n\/*-----------------.\n| Ufloat support. |\n`-----------------*\/\n\n# ifdef LIBPORT_URBI_UFLOAT_FLOAT\nnamespace libport\n{\n typedef float ufloat;\n# define UFLT_EPSILON FLT_EPSILON\n\n inline long long to_long_long (ufloat u);\n}\n# endif\n\n# ifdef LIBPORT_URBI_UFLOAT_DOUBLE\nnamespace libport\n{\n typedef double ufloat;\n# define UFLT_EPSILON DBL_EPSILON\n\n inline long long to_long_long (ufloat u);\n}\n# endif\n\n# ifdef LIBPORT_URBI_UFLOAT_LONG\n# include <libport\/ulong-fixed-point.hh>\n# endif\n\n# ifdef LIBPORT_URBI_UFLOAT_LONG_LONG\n# include <libport\/ull-fixed-point.hh>\n# endif\n\n# ifdef LIBPORT_URBI_UFLOAT_FLOATING\n# include <libport\/uffloat.hh>\n# endif\n\n\nnamespace libport\n{\n static const ufloat PI(3.14159265358979323846264338327950288);\n static const ufloat UINFINITY(999999999999999.0);\n}\n\n\n\/*-------------------.\n| Ufloat tabulated. |\n`-------------------*\/\n\n# ifdef LIBPORT_URBI_UFLOAT_TABULATED\nnamespace libport\n{\n \/** @return the tabulated sinus of given @a angle in radian, using linear\n * interpolation. *\/\n ufloat tabulatedSin(ufloat angle);\n\n \/** @return the tabulated cosinus of given @a angle in radian, using linear\n * interpolation. *\/\n ufloat tabulatedCos(ufloat angle);\n\n \/** @return the tabulated arcsinus of given @a angle, in radian, using\n * linear interpolation. *\/\n ufloat tabulatedASin(ufloat angle);\n\n \/** @return the tabulated arccosinus of given @a angle, in radian, using\n * linear interpolation. *\/\n inline ufloat tabulatedACos(ufloat angle);\n\n inline ufloat sin(ufloat angle);\n inline ufloat cos(ufloat angle);\n inline ufloat tan(ufloat angle);\n\n inline ufloat asin(ufloat angle);\n inline ufloat acos(ufloat angle);\n}\n# endif\n\n# include <libport\/config.h>\n\/* round is not C++ standard (not even POSIX) and neither gnulib nor Boost\n * provide one. So here is my quick replacement. *\/\n# ifndef LIBPORT_HAVE_ROUND\n# include <cmath>\nnamespace libport\n{\n inline float round (float d);\n inline double round (double d);\n inline long double round (long double d);\n\n}\n# endif \/* !LIBPORT_HAVE_ROUND *\/\n\n\/* trunc is not C++ standard (not even POSIX) and although gnulib says it\n * provides a replacement in its manual, in fact it doesn't, nor does Boost.\n * So here is my quick replacement. *\/\n# ifndef LIBPORT_HAVE_TRUNC\n# include <cmath>\nnamespace libport\n{\n inline double trunc (double d);\n}\n# endif \/* !LIBPORT_HAVE_TRUNC *\/\n\n\/* Float to int converter. *\/\nnamespace libport\n{\n struct bad_numeric_cast : public std::exception {};\n\n \/\/\/ Convert a libport::ufloat to a int. Raise\n \/\/\/ libport::bad_numeric_cast if the provided argument is not\n \/\/\/ directly convertible to an integer.\n LIBPORT_API int ufloat_to_int(ufloat val);\n LIBPORT_API long long ufloat_to_long_long(ufloat val);\n\n} \/\/ namespace libport\n\n# include <libport\/ufloat.hxx>\n\n#endif \/\/ !LIBPORT_UFLOAT_HH\n<|endoftext|>"} {"text":"<commit_before>\/*\n * eos - A 3D Morphable Model fitting library written in modern C++11\/14.\n *\n * File: matlab\/include\/mexplus_eos_types.hpp\n *\n * Copyright 2016 Patrik Huber\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n *\/\n#pragma once\n\n#ifndef MEXPLUS_EOS_TYPES_HPP_\n#define MEXPLUS_EOS_TYPES_HPP_\n\n#include \"eos\/core\/Mesh.hpp\"\n#include \"eos\/fitting\/RenderingParameters.hpp\"\n\n#include \"mexplus\/mxarray.h\"\n\n#include \"glm\/vec2.hpp\"\n#include \"glm\/vec3.hpp\"\n#include \"glm\/vec4.hpp\"\n#include \"glm\/gtc\/quaternion.hpp\"\n#include \"glm\/mat4x4.hpp\"\n\n#include \"Eigen\/Core\"\n\n#include \"mex.h\"\n\n\/**\n * @file\n * @brief Contains mexplus template specialisations to convert eos data\n * structures into Matlab.\n *\n * Note 1: These all copy the data, which I believe might be necessary, since\n * Matlab may unload a mex module (with all its allocated data) at any given\n * time.\n * Note 2: They all return double vectors and matrices, even when the data given\n * are floats. We can think about changing that if it's a speed issue, however,\n * I think double is Matlab's default data type.\n *\/\n\nnamespace mexplus {\n\n\/**\n * @brief Converts a glm::tquat<float> to a Matlab vector.\n *\n * @param[in] quat The quaternion to convert.\n * @return An 1x4 Matlab vector.\n *\/\ntemplate<>\nmxArray* MxArray::from(const glm::tquat<float>& quat)\n{\n\tMxArray out_array(MxArray::Numeric<double>(1, 4));\n\tfor (int c = 0; c < 4; ++c) {\n\t\tout_array.set(c, quat[c]);\n\t}\n\treturn out_array.release();\n};\n\n\/**\n * @brief Converts a glm::tmat4x4<float> to a Matlab matrix.\n *\n * @param[in] mat The matrix to convert.\n * @return A 4x4 Matlab matrix.\n *\/\ntemplate<>\nmxArray* MxArray::from(const glm::tmat4x4<float>& mat)\n{\n\tMxArray out_array(MxArray::Numeric<double>(4, 4));\n\tfor (int r = 0; r < 4; ++r) {\n\t\tfor (int c = 0; c < 4; ++c) {\n\t\t\tout_array.set(r, c, mat[c][r]);\n\t\t}\n\t}\n\treturn out_array.release();\n};\n\n\/**\n * @brief Converts an std::vector of glm::tvec2<float> to a Matlab matrix.\n *\n * This function converts a whole vector of vec2's to an n x 2 Matlab matrix,\n * where n is data.size(). It is mainly used to pass texture coordinates of\n * a Mesh to Matlab.\n *\n * We specialise for std::vector<glm::tvec2<float>> directly (and not for\n * glm::tvec2<float>) because otherwise a cell array of vec2's would be\n * generated. Luckily, even if a tvec2 specialisation was to exist too,\n * this one would take precedence to convert a vector<tvec2>.\n *\n * @param[in] data The data to convert.\n * @return An n x 2 Matlab matrix.\n *\/\ntemplate<>\nmxArray* MxArray::from(const std::vector<glm::tvec2<float>>& data)\n{\n\tMxArray out_array(MxArray::Numeric<double>(data.size(), 2));\n\tfor (int r = 0; r < data.size(); ++r) {\n\t\tfor (int c = 0; c < 2; ++c) {\n\t\t\tout_array.set(r, c, data[r][c]);\n\t\t}\n\t}\n\treturn out_array.release();\n};\n\n\/**\n * @brief Converts an std::vector of glm::tvec3<float> to a Matlab matrix.\n *\n * This function converts a whole vector of vec3's to an n x 3 Matlab matrix,\n * where n is data.size(). It is mainly used to pass vertex colour data of\n * a Mesh to Matlab.\n *\n * See template<> mxArray* MxArray::from(const std::vector<glm::tvec2<float>>&)\n * for more details.\n *\n * @param[in] data The data to convert.\n * @return An n x 3 Matlab matrix.\n *\/\ntemplate<>\nmxArray* MxArray::from(const std::vector<glm::tvec3<float>>& data)\n{\n\tMxArray out_array(MxArray::Numeric<double>(data.size(), 3));\n\tfor (int r = 0; r < data.size(); ++r) {\n\t\tfor (int c = 0; c < 3; ++c) {\n\t\t\tout_array.set(r, c, data[r][c]);\n\t\t}\n\t}\n\treturn out_array.release();\n};\n\n\/**\n * @brief Converts an std::vector of glm::tvec4<float> to a Matlab matrix.\n *\n * This function converts a whole vector of vec4's to an n x 4 Matlab matrix,\n * where n is data.size(). It is mainly used to pass vertex data of a Mesh\n * to Matlab.\n *\n * See template<> mxArray* MxArray::from(const std::vector<glm::tvec2<float>>&)\n * for more details.\n *\n * @param[in] data The data to convert.\n * @return An n x 4 Matlab matrix.\n *\/\ntemplate<>\nmxArray* MxArray::from(const std::vector<glm::tvec4<float>>& data)\n{\n\tMxArray out_array(MxArray::Numeric<double>(data.size(), 4));\n\tfor (int r = 0; r < data.size(); ++r) {\n\t\tfor (int c = 0; c < 4; ++c) {\n\t\t\tout_array.set(r, c, data[r][c]);\n\t\t}\n\t}\n\treturn out_array.release();\n};\n\n\/**\n * @brief Converts an std::vector of std::array<int, 3> to a Matlab matrix.\n *\n * This function converts a whole vector of array<int, 3>'s to an n x 3 Matlab\n * matrix, where n is data.size(). It is mainly used to pass triangle indices\n * data of a Mesh to Matlab.\n *\n * We specialise for vector<array<int, 3>> directly (and not for array<int, 3>)\n * because otherwise a cell array of arrays would be generated. Luckily, even\n * if an array<int, 3> specialisation was to exist too, this one would take\n * precedence to convert a vector<array<int, 3>>.\n *\n * @param[in] data The data to convert.\n * @return An n x 3 Matlab matrix.\n *\/\ntemplate<>\nmxArray* MxArray::from(const std::vector<std::array<int, 3>>& data)\n{\n\tMxArray out_array(MxArray::Numeric<int>(data.size(), 3));\n\tfor (int r = 0; r < data.size(); ++r) {\n\t\tfor (int c = 0; c < 3; ++c) {\n\t\t\tout_array.set(r, c, data[r][c]);\n\t\t}\n\t}\n\treturn out_array.release();\n};\n\n\/**\n * @brief Define a template specialisation for eos::render::Mesh.\n *\n * This converts an eos::render::Mesh into a Matlab struct.\n * \n * @param[in] mesh The Mesh that will be returned to Matlab.\n * @return An mxArray containing a Matlab struct with all vertex, colour, texcoords and triangle data.\n *\/\ntemplate<>\nmxArray* MxArray::from(const eos::core::Mesh& mesh)\n{\n\t\/\/ C++ counts the vertex indices starting at zero, Matlab starts counting\n\t\/\/ at one - therefore, add +1 to all triangle indices:\n\tauto tvi_1based = mesh.tvi;\n\tfor (auto&& t : tvi_1based) {\n\t\tfor (auto&& idx : t) {\n\t\t\tidx += 1;\n\t\t}\n\t}\n\t\/\/ Same for tci:\n\tauto tci_1based = mesh.tci;\n\tfor (auto&& t : tci_1based) {\n\t\tfor (auto&& idx : t) {\n\t\t\tidx += 1;\n\t\t}\n\t}\n\n\tMxArray out_array(MxArray::Struct());\n\tout_array.set(\"vertices\", mesh.vertices);\n\tout_array.set(\"colors\", mesh.colors);\n\tout_array.set(\"texcoords\", mesh.texcoords);\n\tout_array.set(\"tvi\", tvi_1based);\n\tout_array.set(\"tci\", tci_1based);\n\n\treturn out_array.release();\n};\n\n\/**\n * @brief Define a template specialisation for eos::fitting::RenderingParameters.\n *\n * This converts an eos::fitting::RenderingParameters into a Matlab struct.\n * \n * @param[in] rendering_parameters The RenderingParameters that will be returned to Matlab.\n * @return An mxArray containing a Matlab struct with all required parameters.\n *\/\ntemplate<>\nmxArray* MxArray::from(const eos::fitting::RenderingParameters& rendering_parameters) {\n\n\tMxArray out_array(MxArray::Struct());\n\t\n\tconst std::string camera_type = [&rendering_parameters]() {\n\t\tif (rendering_parameters.get_camera_type() == eos::fitting::CameraType::Orthographic)\n\t\t{\n\t\t\treturn \"Orthographic\";\n\t\t}\n\t\telse if (rendering_parameters.get_camera_type() == eos::fitting::CameraType::Perspective) {\n\t\t\treturn \"Perspective\";\n\t\t}\n\t\telse {\n\t\t\treturn \"unknown\";\n\t\t}\n\t}();\n\n\t\/\/ Since we don't expose get_opencv_viewport(), and Matlab doesn't have glm::project()\n\t\/\/ anyway, we'll make a 4x4 viewport matrix available. Matlab seems to have the same\n\t\/\/ convention as OpenCV (top-left is the image origin).\n\tauto viewport = eos::fitting::get_opencv_viewport(rendering_parameters.get_screen_width(), rendering_parameters.get_screen_height());\n\tglm::mat4x4 viewport_matrix; \/\/ Identity matrix\n\tviewport_matrix[0][0] = 0.5f * viewport[2];\n\tviewport_matrix[3][0] = 0.5f * viewport[2] + viewport[0];\n\tviewport_matrix[1][1] = 0.5f * viewport[3];\n\tviewport_matrix[3][1] = 0.5f * viewport[3] + viewport[1];\n\tviewport_matrix[2][2] = 0.5f;\n\tviewport_matrix[3][2] = 0.5f;\n\n\tout_array.set(\"camera_type\", camera_type);\n\tout_array.set(\"rotation_quaternion\", rendering_parameters.get_rotation());\n\tout_array.set(\"modelview\", rendering_parameters.get_modelview());\n\tout_array.set(\"projection\", rendering_parameters.get_projection());\n\tout_array.set(\"viewport\", viewport_matrix);\n\tout_array.set(\"screen_width\", rendering_parameters.get_screen_width());\n\tout_array.set(\"screen_height\", rendering_parameters.get_screen_height());\n\n\treturn out_array.release();\n};\n\n} \/* namespace mexplus *\/\n\n#endif \/* MEXPLUS_EOS_TYPES_HPP_ *\/\n<commit_msg>Added missing includes<commit_after>\/*\n * eos - A 3D Morphable Model fitting library written in modern C++11\/14.\n *\n * File: matlab\/include\/mexplus_eos_types.hpp\n *\n * Copyright 2016 Patrik Huber\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n *\/\n#pragma once\n\n#ifndef MEXPLUS_EOS_TYPES_HPP_\n#define MEXPLUS_EOS_TYPES_HPP_\n\n#include \"eos\/core\/Mesh.hpp\"\n#include \"eos\/fitting\/RenderingParameters.hpp\"\n\n#include \"mexplus\/mxarray.h\"\n\n#include \"glm\/vec2.hpp\"\n#include \"glm\/vec3.hpp\"\n#include \"glm\/vec4.hpp\"\n#include \"glm\/gtc\/quaternion.hpp\"\n#include \"glm\/mat4x4.hpp\"\n\n#include \"Eigen\/Core\"\n\n#include \"mex.h\"\n\n#include <array>\n#include <vector>\n\n\/**\n * @file\n * @brief Contains mexplus template specialisations to convert eos data\n * structures into Matlab.\n *\n * Note 1: These all copy the data, which I believe might be necessary, since\n * Matlab may unload a mex module (with all its allocated data) at any given\n * time.\n * Note 2: They all return double vectors and matrices, even when the data given\n * are floats. We can think about changing that if it's a speed issue, however,\n * I think double is Matlab's default data type.\n *\/\n\nnamespace mexplus {\n\n\/**\n * @brief Converts a glm::tquat<float> to a Matlab vector.\n *\n * @param[in] quat The quaternion to convert.\n * @return An 1x4 Matlab vector.\n *\/\ntemplate<>\nmxArray* MxArray::from(const glm::tquat<float>& quat)\n{\n\tMxArray out_array(MxArray::Numeric<double>(1, 4));\n\tfor (int c = 0; c < 4; ++c) {\n\t\tout_array.set(c, quat[c]);\n\t}\n\treturn out_array.release();\n};\n\n\/**\n * @brief Converts a glm::tmat4x4<float> to a Matlab matrix.\n *\n * @param[in] mat The matrix to convert.\n * @return A 4x4 Matlab matrix.\n *\/\ntemplate<>\nmxArray* MxArray::from(const glm::tmat4x4<float>& mat)\n{\n\tMxArray out_array(MxArray::Numeric<double>(4, 4));\n\tfor (int r = 0; r < 4; ++r) {\n\t\tfor (int c = 0; c < 4; ++c) {\n\t\t\tout_array.set(r, c, mat[c][r]);\n\t\t}\n\t}\n\treturn out_array.release();\n};\n\n\/**\n * @brief Converts an std::vector of glm::tvec2<float> to a Matlab matrix.\n *\n * This function converts a whole vector of vec2's to an n x 2 Matlab matrix,\n * where n is data.size(). It is mainly used to pass texture coordinates of\n * a Mesh to Matlab.\n *\n * We specialise for std::vector<glm::tvec2<float>> directly (and not for\n * glm::tvec2<float>) because otherwise a cell array of vec2's would be\n * generated. Luckily, even if a tvec2 specialisation was to exist too,\n * this one would take precedence to convert a vector<tvec2>.\n *\n * @param[in] data The data to convert.\n * @return An n x 2 Matlab matrix.\n *\/\ntemplate<>\nmxArray* MxArray::from(const std::vector<glm::tvec2<float>>& data)\n{\n\tMxArray out_array(MxArray::Numeric<double>(data.size(), 2));\n\tfor (int r = 0; r < data.size(); ++r) {\n\t\tfor (int c = 0; c < 2; ++c) {\n\t\t\tout_array.set(r, c, data[r][c]);\n\t\t}\n\t}\n\treturn out_array.release();\n};\n\n\/**\n * @brief Converts an std::vector of glm::tvec3<float> to a Matlab matrix.\n *\n * This function converts a whole vector of vec3's to an n x 3 Matlab matrix,\n * where n is data.size(). It is mainly used to pass vertex colour data of\n * a Mesh to Matlab.\n *\n * See template<> mxArray* MxArray::from(const std::vector<glm::tvec2<float>>&)\n * for more details.\n *\n * @param[in] data The data to convert.\n * @return An n x 3 Matlab matrix.\n *\/\ntemplate<>\nmxArray* MxArray::from(const std::vector<glm::tvec3<float>>& data)\n{\n\tMxArray out_array(MxArray::Numeric<double>(data.size(), 3));\n\tfor (int r = 0; r < data.size(); ++r) {\n\t\tfor (int c = 0; c < 3; ++c) {\n\t\t\tout_array.set(r, c, data[r][c]);\n\t\t}\n\t}\n\treturn out_array.release();\n};\n\n\/**\n * @brief Converts an std::vector of glm::tvec4<float> to a Matlab matrix.\n *\n * This function converts a whole vector of vec4's to an n x 4 Matlab matrix,\n * where n is data.size(). It is mainly used to pass vertex data of a Mesh\n * to Matlab.\n *\n * See template<> mxArray* MxArray::from(const std::vector<glm::tvec2<float>>&)\n * for more details.\n *\n * @param[in] data The data to convert.\n * @return An n x 4 Matlab matrix.\n *\/\ntemplate<>\nmxArray* MxArray::from(const std::vector<glm::tvec4<float>>& data)\n{\n\tMxArray out_array(MxArray::Numeric<double>(data.size(), 4));\n\tfor (int r = 0; r < data.size(); ++r) {\n\t\tfor (int c = 0; c < 4; ++c) {\n\t\t\tout_array.set(r, c, data[r][c]);\n\t\t}\n\t}\n\treturn out_array.release();\n};\n\n\/**\n * @brief Converts an std::vector of std::array<int, 3> to a Matlab matrix.\n *\n * This function converts a whole vector of array<int, 3>'s to an n x 3 Matlab\n * matrix, where n is data.size(). It is mainly used to pass triangle indices\n * data of a Mesh to Matlab.\n *\n * We specialise for vector<array<int, 3>> directly (and not for array<int, 3>)\n * because otherwise a cell array of arrays would be generated. Luckily, even\n * if an array<int, 3> specialisation was to exist too, this one would take\n * precedence to convert a vector<array<int, 3>>.\n *\n * @param[in] data The data to convert.\n * @return An n x 3 Matlab matrix.\n *\/\ntemplate<>\nmxArray* MxArray::from(const std::vector<std::array<int, 3>>& data)\n{\n\tMxArray out_array(MxArray::Numeric<int>(data.size(), 3));\n\tfor (int r = 0; r < data.size(); ++r) {\n\t\tfor (int c = 0; c < 3; ++c) {\n\t\t\tout_array.set(r, c, data[r][c]);\n\t\t}\n\t}\n\treturn out_array.release();\n};\n\n\/**\n * @brief Define a template specialisation for eos::render::Mesh.\n *\n * This converts an eos::render::Mesh into a Matlab struct.\n * \n * @param[in] mesh The Mesh that will be returned to Matlab.\n * @return An mxArray containing a Matlab struct with all vertex, colour, texcoords and triangle data.\n *\/\ntemplate<>\nmxArray* MxArray::from(const eos::core::Mesh& mesh)\n{\n\t\/\/ C++ counts the vertex indices starting at zero, Matlab starts counting\n\t\/\/ at one - therefore, add +1 to all triangle indices:\n\tauto tvi_1based = mesh.tvi;\n\tfor (auto&& t : tvi_1based) {\n\t\tfor (auto&& idx : t) {\n\t\t\tidx += 1;\n\t\t}\n\t}\n\t\/\/ Same for tci:\n\tauto tci_1based = mesh.tci;\n\tfor (auto&& t : tci_1based) {\n\t\tfor (auto&& idx : t) {\n\t\t\tidx += 1;\n\t\t}\n\t}\n\n\tMxArray out_array(MxArray::Struct());\n\tout_array.set(\"vertices\", mesh.vertices);\n\tout_array.set(\"colors\", mesh.colors);\n\tout_array.set(\"texcoords\", mesh.texcoords);\n\tout_array.set(\"tvi\", tvi_1based);\n\tout_array.set(\"tci\", tci_1based);\n\n\treturn out_array.release();\n};\n\n\/**\n * @brief Define a template specialisation for eos::fitting::RenderingParameters.\n *\n * This converts an eos::fitting::RenderingParameters into a Matlab struct.\n * \n * @param[in] rendering_parameters The RenderingParameters that will be returned to Matlab.\n * @return An mxArray containing a Matlab struct with all required parameters.\n *\/\ntemplate<>\nmxArray* MxArray::from(const eos::fitting::RenderingParameters& rendering_parameters) {\n\n\tMxArray out_array(MxArray::Struct());\n\t\n\tconst std::string camera_type = [&rendering_parameters]() {\n\t\tif (rendering_parameters.get_camera_type() == eos::fitting::CameraType::Orthographic)\n\t\t{\n\t\t\treturn \"Orthographic\";\n\t\t}\n\t\telse if (rendering_parameters.get_camera_type() == eos::fitting::CameraType::Perspective) {\n\t\t\treturn \"Perspective\";\n\t\t}\n\t\telse {\n\t\t\treturn \"unknown\";\n\t\t}\n\t}();\n\n\t\/\/ Since we don't expose get_opencv_viewport(), and Matlab doesn't have glm::project()\n\t\/\/ anyway, we'll make a 4x4 viewport matrix available. Matlab seems to have the same\n\t\/\/ convention as OpenCV (top-left is the image origin).\n\tauto viewport = eos::fitting::get_opencv_viewport(rendering_parameters.get_screen_width(), rendering_parameters.get_screen_height());\n\tglm::mat4x4 viewport_matrix; \/\/ Identity matrix\n\tviewport_matrix[0][0] = 0.5f * viewport[2];\n\tviewport_matrix[3][0] = 0.5f * viewport[2] + viewport[0];\n\tviewport_matrix[1][1] = 0.5f * viewport[3];\n\tviewport_matrix[3][1] = 0.5f * viewport[3] + viewport[1];\n\tviewport_matrix[2][2] = 0.5f;\n\tviewport_matrix[3][2] = 0.5f;\n\n\tout_array.set(\"camera_type\", camera_type);\n\tout_array.set(\"rotation_quaternion\", rendering_parameters.get_rotation());\n\tout_array.set(\"modelview\", rendering_parameters.get_modelview());\n\tout_array.set(\"projection\", rendering_parameters.get_projection());\n\tout_array.set(\"viewport\", viewport_matrix);\n\tout_array.set(\"screen_width\", rendering_parameters.get_screen_width());\n\tout_array.set(\"screen_height\", rendering_parameters.get_screen_height());\n\n\treturn out_array.release();\n};\n\n} \/* namespace mexplus *\/\n\n#endif \/* MEXPLUS_EOS_TYPES_HPP_ *\/\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#ifndef _OCTREE_HPP_\n#define _OCTREE_HPP_\n\n#include <boost\/format.hpp>\n#include <boost\/utility.hpp>\n#include <vector>\n#include <iostream>\n#include <deque>\n\nnamespace mapnik {\n\t\n typedef uint8_t byte ;\n struct rgb\t\n {\n byte r;\n byte g;\n byte b;\n rgb(byte r_, byte b_, byte g_)\n : r(r_), g(g_), b(b_) {}\n };\n\n struct RGBPolicy\n {\n const static unsigned MAX_LEVELS = 6;\n inline static unsigned index_from_level(unsigned level, rgb const& c)\n {\n unsigned shift = (MAX_LEVELS + 1) - level;\n return (((c.r >> shift) & 1) << 2) \n | (((c.g >> shift) & 1) << 1) \n | ((c.b >> shift) & 1);\n }\n };\n\n template <typename T, typename InsertPolicy = RGBPolicy >\n class octree : private boost::noncopyable\n {\t\n struct node \n {\n node ()\n : reds(0),\n greens(0),\n blues(0),\n count(0),\n count2(0),\n index(0)\n {\n memset(&children_[0],0,sizeof(children_));\n }\n \n ~node () \n {\n for (unsigned i = 0;i < 8; ++i) {\n if (children_[i] != 0) delete children_[i],children_[i]=0;\n }\n }\t\n\n bool is_leaf() const { return count == 0; }\t\n node * children_[8];\t\n unsigned reds;\n unsigned greens;\n unsigned blues;\n unsigned count;\t\n unsigned count2;\t\n uint8_t index;\t\t\t\t\t\n };\n struct node_cmp\n {\n bool operator() ( const node * lhs,const node* rhs) const\n {\n return lhs->count2 < rhs->count2;\n }\n };\n\n std::deque<node*> reducible_[InsertPolicy::MAX_LEVELS];\n unsigned max_colors_;\n unsigned colors_;\n unsigned leaf_level_; \n \n public:\n explicit octree(unsigned max_colors=256) \n : max_colors_(max_colors),\n colors_(0),\n leaf_level_(InsertPolicy::MAX_LEVELS),\n root_(new node())\n {}\n \n ~octree() { delete root_;}\n\t\n void insert(T const& data) \n { \n unsigned level = 0;\n node * cur_node = root_;\n while (true) {\n cur_node->count2++;\n \n if ( cur_node->count > 0 || level == leaf_level_) \n { \n cur_node->reds += data.r;\n cur_node->greens += data.g;\n cur_node->blues += data.b;\n cur_node->count += 1;\n if (cur_node->count == 1) ++colors_;\n \/\/if (colors_ >= max_colors_ - 1)\n \/\/reduce(); \n break;\n }\n \n unsigned idx = InsertPolicy::index_from_level(level,data);\n if (cur_node->children_[idx] == 0) {\n cur_node->children_[idx] = new node();\n if (level < leaf_level_-1) \n {\n reducible_[level+1].push_back(cur_node->children_[idx]);\n }\n }\n cur_node = cur_node->children_[idx];\n ++level; \n }\n } \n \n int quantize(rgb const& c) const \n {\n unsigned level = 0;\n node * cur_node = root_;\n while (cur_node)\n {\n if (cur_node->count != 0) return cur_node->index;\n unsigned idx = InsertPolicy::index_from_level(level,c);\n cur_node = cur_node->children_[idx];\n ++level;\n } \n return -1;\n }\n\t\n void create_palette(std::vector<rgb> & palette)\n {\n reduce();\n palette.reserve(colors_);\n create_palette(palette, root_);\n }\n \n void reduce()\n {\t\n \/\/ sort reducible \n for (unsigned i=0;i<InsertPolicy::MAX_LEVELS;++i)\n {\n std::sort(reducible_[i].begin(), reducible_[i].end(),node_cmp());\n }\n \n while ( colors_ >= max_colors_ - 1)\n { \n while (leaf_level_ >0 && reducible_[leaf_level_-1].size() == 0) \n {\n --leaf_level_;\n }\n \n if (leaf_level_ < 1) continue;\n \n if ( reducible_[leaf_level_-1].size() == 0) return;\n \n typename std::deque<node*>::iterator pos = reducible_[leaf_level_-1].begin();\n node * cur_node = *pos;\n unsigned num_children = 0;\n for (unsigned idx=0; idx < 8; ++idx)\n {\n if (cur_node->children_[idx] != 0)\n {\n ++num_children;\n cur_node->reds += cur_node->children_[idx]->reds;\n cur_node->greens += cur_node->children_[idx]->greens;\n cur_node->blues += cur_node->children_[idx]->blues;\n cur_node->count += cur_node->children_[idx]->count;\n delete cur_node->children_[idx], cur_node->children_[idx]=0;\n }\n }\n \n reducible_[leaf_level_-1].erase(pos);\n if (num_children > 0 ) \n {\n colors_ -= (num_children - 1);\n }\n }\n }\n \n void create_palette(std::vector<rgb> & palette, node * itr) const\n {\n if (itr->count != 0)\n {\n unsigned count = itr->count;\n palette.push_back(rgb(uint8_t(itr->reds\/float(count)),\n uint8_t(itr->greens\/float(count)),\n uint8_t(itr->blues\/float(count))));\n itr->index = palette.size() - 1;\t\t\t\n }\n for (unsigned i=0; i < 8 ;++i)\n {\n if (itr->children_[i] != 0) \n create_palette(palette, itr->children_[i]);\n } \n }\n private:\t\n node * root_;\t\t\n };\n} \/\/ namespace mapnik\n\n#endif \/* _OCTREE_HPP_ *\/\n<commit_msg>+ add missing header cstdint.hpp<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#ifndef _OCTREE_HPP_\n#define _OCTREE_HPP_\n\n\/\/ boost\n#include <boost\/cstdint.hpp>\n#include <boost\/format.hpp>\n#include <boost\/utility.hpp>\n\n\/\/ stl\n#include <vector>\n#include <iostream>\n#include <deque>\n\nnamespace mapnik {\n\t\n typedef uint8_t byte ;\n struct rgb\t\n {\n byte r;\n byte g;\n byte b;\n rgb(byte r_, byte b_, byte g_)\n : r(r_), g(g_), b(b_) {}\n };\n\n struct RGBPolicy\n {\n const static unsigned MAX_LEVELS = 6;\n inline static unsigned index_from_level(unsigned level, rgb const& c)\n {\n unsigned shift = (MAX_LEVELS + 1) - level;\n return (((c.r >> shift) & 1) << 2) \n | (((c.g >> shift) & 1) << 1) \n | ((c.b >> shift) & 1);\n }\n };\n\n template <typename T, typename InsertPolicy = RGBPolicy >\n class octree : private boost::noncopyable\n {\t\n struct node \n {\n node ()\n : reds(0),\n greens(0),\n blues(0),\n count(0),\n count2(0),\n index(0)\n {\n memset(&children_[0],0,sizeof(children_));\n }\n \n ~node () \n {\n for (unsigned i = 0;i < 8; ++i) {\n if (children_[i] != 0) delete children_[i],children_[i]=0;\n }\n }\t\n\n bool is_leaf() const { return count == 0; }\t\n node * children_[8];\t\n unsigned reds;\n unsigned greens;\n unsigned blues;\n unsigned count;\t\n unsigned count2;\t\n uint8_t index;\t\t\t\t\t\n };\n struct node_cmp\n {\n bool operator() ( const node * lhs,const node* rhs) const\n {\n return lhs->count2 < rhs->count2;\n }\n };\n\n std::deque<node*> reducible_[InsertPolicy::MAX_LEVELS];\n unsigned max_colors_;\n unsigned colors_;\n unsigned leaf_level_; \n \n public:\n explicit octree(unsigned max_colors=256) \n : max_colors_(max_colors),\n colors_(0),\n leaf_level_(InsertPolicy::MAX_LEVELS),\n root_(new node())\n {}\n \n ~octree() { delete root_;}\n\t\n void insert(T const& data) \n { \n unsigned level = 0;\n node * cur_node = root_;\n while (true) {\n cur_node->count2++;\n \n if ( cur_node->count > 0 || level == leaf_level_) \n { \n cur_node->reds += data.r;\n cur_node->greens += data.g;\n cur_node->blues += data.b;\n cur_node->count += 1;\n if (cur_node->count == 1) ++colors_;\n \/\/if (colors_ >= max_colors_ - 1)\n \/\/reduce(); \n break;\n }\n \n unsigned idx = InsertPolicy::index_from_level(level,data);\n if (cur_node->children_[idx] == 0) {\n cur_node->children_[idx] = new node();\n if (level < leaf_level_-1) \n {\n reducible_[level+1].push_back(cur_node->children_[idx]);\n }\n }\n cur_node = cur_node->children_[idx];\n ++level; \n }\n } \n \n int quantize(rgb const& c) const \n {\n unsigned level = 0;\n node * cur_node = root_;\n while (cur_node)\n {\n if (cur_node->count != 0) return cur_node->index;\n unsigned idx = InsertPolicy::index_from_level(level,c);\n cur_node = cur_node->children_[idx];\n ++level;\n } \n return -1;\n }\n\t\n void create_palette(std::vector<rgb> & palette)\n {\n reduce();\n palette.reserve(colors_);\n create_palette(palette, root_);\n }\n \n void reduce()\n {\t\n \/\/ sort reducible \n for (unsigned i=0;i<InsertPolicy::MAX_LEVELS;++i)\n {\n std::sort(reducible_[i].begin(), reducible_[i].end(),node_cmp());\n }\n \n while ( colors_ >= max_colors_ - 1)\n { \n while (leaf_level_ >0 && reducible_[leaf_level_-1].size() == 0) \n {\n --leaf_level_;\n }\n \n if (leaf_level_ < 1) continue;\n \n if ( reducible_[leaf_level_-1].size() == 0) return;\n \n typename std::deque<node*>::iterator pos = reducible_[leaf_level_-1].begin();\n node * cur_node = *pos;\n unsigned num_children = 0;\n for (unsigned idx=0; idx < 8; ++idx)\n {\n if (cur_node->children_[idx] != 0)\n {\n ++num_children;\n cur_node->reds += cur_node->children_[idx]->reds;\n cur_node->greens += cur_node->children_[idx]->greens;\n cur_node->blues += cur_node->children_[idx]->blues;\n cur_node->count += cur_node->children_[idx]->count;\n delete cur_node->children_[idx], cur_node->children_[idx]=0;\n }\n }\n \n reducible_[leaf_level_-1].erase(pos);\n if (num_children > 0 ) \n {\n colors_ -= (num_children - 1);\n }\n }\n }\n \n void create_palette(std::vector<rgb> & palette, node * itr) const\n {\n if (itr->count != 0)\n {\n unsigned count = itr->count;\n palette.push_back(rgb(uint8_t(itr->reds\/float(count)),\n uint8_t(itr->greens\/float(count)),\n uint8_t(itr->blues\/float(count))));\n itr->index = palette.size() - 1;\t\t\t\n }\n for (unsigned i=0; i < 8 ;++i)\n {\n if (itr->children_[i] != 0) \n create_palette(palette, itr->children_[i]);\n } \n }\n private:\t\n node * root_;\t\t\n };\n} \/\/ namespace mapnik\n\n#endif \/* _OCTREE_HPP_ *\/\n<|endoftext|>"} {"text":"<commit_before>\/* -*- Mode: C++; tab-width: 4; indent-tabs-mode: nil; c-basic-offset: 4 -*- *\/\n\/*************************************************************************\n *\n * Copyright (c) 2015 Kohei Yoshida\n *\n * Permission is hereby granted, free of charge, to any person\n * obtaining a copy of this software and associated documentation\n * files (the \"Software\"), to deal in the Software without\n * restriction, including without limitation the rights to use,\n * copy, modify, merge, publish, distribute, sublicense, and\/or sell\n * copies of the Software, and to permit persons to whom the\n * Software is furnished to do so, subject to the following\n * conditions:\n *\n * The above copyright notice and this permission notice shall be\n * included in all copies or substantial portions of the Software.\n *\n * THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND,\n * EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES\n * OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND\n * NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT\n * HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY,\n * WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING\n * FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR\n * OTHER DEALINGS IN THE SOFTWARE.\n *\n ************************************************************************\/\n\n#ifndef INCLUDED_MDDS_TRIE_MAP_HPP\n#define INCLUDED_MDDS_TRIE_MAP_HPP\n\n#include <vector>\n#include <string>\n#include <deque>\n#include <map>\n\nnamespace mdds {\n\nnamespace trie {\n\n\/**\n * String trait that uses std::string as the key type.\n *\/\nstruct std_string_trait\n{\n typedef std::string string_type;\n typedef std::string buffer_type;\n typedef char char_type;\n\n static buffer_type init_buffer(const char_type* str, size_t length)\n {\n return buffer_type(str, length);\n }\n\n static void push_back(buffer_type& buffer, char_type c)\n {\n buffer.push_back(c);\n }\n\n static void pop_back(buffer_type& buffer)\n {\n buffer.pop_back();\n }\n\n static string_type to_string(const buffer_type& buf)\n {\n return buf;\n }\n};\n\n}\n\ntemplate<typename _KeyTrait, typename _ValueT>\nclass packed_trie_map;\n\n\/**\n * Trie map provides storage for multiple key-value pairs where keys are\n * either strings, or otherwise consist of arrays of characters. The keys\n * are stored in an ordered tree structure known as trie, or sometimes\n * referred to as prefix tree.\n *\/\ntemplate<typename _KeyTrait, typename _ValueT>\nclass trie_map\n{\n friend class packed_trie_map<_KeyTrait, _ValueT>;\n\npublic:\n typedef packed_trie_map<_KeyTrait, _ValueT> packed_type;\n typedef _KeyTrait key_trait_type;\n typedef typename key_trait_type::string_type string_type;\n typedef typename key_trait_type::buffer_type buffer_type;\n typedef typename key_trait_type::char_type char_type;\n typedef _ValueT value_type;\n typedef size_t size_type;\n typedef std::pair<string_type, value_type> key_value_type;\n\nprivate:\n\n struct trie_node\n {\n typedef std::map<char_type, trie_node> children_type;\n\n children_type children;\n value_type value;\n bool has_value;\n\n trie_node() : has_value(false) {}\n };\n\npublic:\n\n trie_map() = delete;\n\n \/**\n * Constructor.\n *\n * @param null_value null value to return when the find method fails to\n * find a matching entry.\n *\/\n trie_map(value_type null_value);\n\n \/**\n * Insert a new key-value pair.\n *\n * @param key pointer to the first character of a character array that\n * stores key value.\n * @param len length of the character array storing the key.\n * @param value value to associate with the key.\n *\/\n void insert(const char_type* key, size_type len, const value_type& value);\n\n \/**\n * Erase a key and the value associated with it.\n *\n * @param key pointer to the first character of a character array that\n * stores key value.\n * @param len length of the character array storing the key.\n *\n * @return true if a key is erased, false otherwise.\n *\/\n bool erase(const char_type* key, size_type len);\n\n \/**\n * Find a value associated with a specified string key.\n *\n * @param input pointer to a C-style string whose value represents the key\n * to match.\n * @param len length of the matching string value.\n *\n * @return value associated with the key, or the null value in case the\n * key is not found.\n *\/\n value_type find(const char_type* input, size_type len) const;\n\n \/**\n * Retrieve all key-value pairs whose keys start with specified prefix.\n * You can also retrieve all key-value pairs by passing a null prefix and\n * a length of zero.\n *\n * @param prefix pointer to a C-style string whose value represents the\n * prefix to match.\n * @param len length of the prefix value to match.\n *\n * @return list of all matching key-value pairs sorted by the key in\n * ascending order.\n *\/\n std::vector<key_value_type> prefix_search(const char_type* prefix, size_type len) const;\n\n \/**\n * Return the number of entries in the map.\n *\n * @return the number of entries in the map.\n *\/\n size_type size() const;\n\n \/**\n * Empty the container.\n *\/\n void clear();\n\n \/**\n * Create a compressed and immutable version of the container which\n * provides better search performance and requires much less memory\n * footprint.\n *\n * @return an instance of mdds::packed_trie_map with the same content.\n *\/\n packed_type pack() const;\n\nprivate:\n void insert_into_tree(\n trie_node& node, const char_type* key, const char_type* key_end, const value_type& value);\n\n const trie_node* find_prefix_node(\n const trie_node& node, const char_type* prefix, const char_type* prefix_end) const;\n\n void fill_child_node_items(\n std::vector<key_value_type>& items, buffer_type& buffer, const trie_node& node) const;\n\n void count_values(size_type& n, const trie_node& node) const;\n\nprivate:\n value_type m_null_value;\n trie_node m_root;\n};\n\n\/**\n * An immutable trie container that packs its content into a contiguous\n * array to achieve both space efficiency and lookup performance. The user\n * of this data structure must provide a pre-constructed list of key-value\n * entries that are sorted by the key in ascending order, or construct from\n * an instance of mdds::trie_map.\n *\n * Note that, since this container is immutable, the content of the\n * container cannot be modified once constructed.\n *\/\ntemplate<typename _KeyTrait, typename _ValueT>\nclass packed_trie_map\n{\npublic:\n typedef _KeyTrait key_trait_type;\n typedef typename key_trait_type::string_type string_type;\n typedef typename key_trait_type::buffer_type buffer_type;\n typedef typename key_trait_type::char_type char_type;\n typedef _ValueT value_type;\n typedef size_t size_type;\n typedef std::pair<string_type, value_type> key_value_type;\n\n \/**\n * Single key-value entry. Caller must provide at compile time a static\n * array of these entries.\n *\/\n struct entry\n {\n const char_type* key;\n size_type keylen;\n value_type value;\n\n entry(const char_type* _key, size_type _keylen, value_type _value) :\n key(_key), keylen(_keylen), value(_value) {}\n };\n\nprivate:\n struct trie_node\n {\n char_type key;\n const value_type* value;\n\n std::deque<trie_node*> children;\n\n trie_node(char_type _key) : key(_key), value(nullptr) {}\n };\n\n typedef std::deque<trie_node> node_pool_type;\n typedef std::vector<uintptr_t> packed_type;\n typedef std::deque<value_type> value_store_type;\n typedef std::vector<std::tuple<size_t, char_type>> child_offsets_type;\n\npublic:\n\n packed_trie_map() = delete;\n\n \/**\n * Constructor that initializes the content from a static list of\n * key-value entries. The caller <em>must<\/em> ensure that the key-value\n * entries are sorted in ascending order, else the behavior is undefined.\n *\n * @param entries pointer to the array of key-value entries.\n * @param entry_size size of the key-value entry array.\n * @param null_value null value to return when the find method fails to\n * find a matching entry.\n *\/\n packed_trie_map(const entry* entries, size_type entry_size, value_type null_value);\n\n \/**\n * Constructor to allow construction of an instance from the content of a\n * mdds::trie_map instance.\n *\n * @param other mdds::trie_map instance to build content from.\n *\/\n packed_trie_map(const trie_map<key_trait_type, value_type>& other);\n\n \/**\n * Find a value associated with a specified string key.\n *\n * @param input pointer to a C-style string whose value represents the key\n * to match.\n * @param len length of the matching string value.\n *\n * @return value associated with the key, or the null value in case the\n * key is not found.\n *\/\n value_type find(const char_type* input, size_type len) const;\n\n \/**\n * Retrieve all key-value pairs whose keys start with specified prefix.\n * You can also retrieve all key-value pairs by passing a null prefix and\n * a length of zero.\n *\n * @param prefix pointer to a C-style string whose value represents the\n * prefix to match.\n * @param len length of the prefix value to match.\n *\n * @return list of all matching key-value pairs sorted by the key in\n * ascending order.\n *\/\n std::vector<key_value_type> prefix_search(const char_type* prefix, size_type len) const;\n\n \/**\n * Return the number of entries in the map.\n *\n * @return the number of entries in the map.\n *\/\n size_type size() const;\n\nprivate:\n void traverse_range(\n trie_node& root, node_pool_type& node_pool, const entry* start, const entry* end,\n size_type pos);\n\n size_type compact_node(const trie_node& node);\n size_type compact_node(const typename trie_map<_KeyTrait, _ValueT>::trie_node& node);\n\n void push_child_offsets(size_type offset, const child_offsets_type& child_offsets);\n\n void compact(const trie_node& root);\n void compact(const typename trie_map<_KeyTrait, _ValueT>::trie_node& root);\n\n const uintptr_t* find_prefix_node(\n const uintptr_t* p, const char_type* prefix, const char_type* prefix_end) const;\n\n void fill_child_node_items(\n std::vector<key_value_type>& items, buffer_type& buffer, const uintptr_t* p) const;\n\n#ifdef MDDS_TRIE_MAP_DEBUG\n void dump_node(buffer_type& buffer, const trie_node& node) const;\n void dump_trie(const trie_node& root) const;\n void dump_packed_trie(const std::vector<uintptr_t>& packed) const;\n#endif\n\nprivate:\n value_type m_null_value;\n size_type m_entry_size;\n\n value_store_type m_value_store;\n packed_type m_packed;\n};\n\n}\n\n#include \"trie_map_def.inl\"\n\n#endif\n\n\/* vim:set shiftwidth=4 softtabstop=4 expandtab: *\/\n<commit_msg>More method docs for trie_map's.<commit_after>\/* -*- Mode: C++; tab-width: 4; indent-tabs-mode: nil; c-basic-offset: 4 -*- *\/\n\/*************************************************************************\n *\n * Copyright (c) 2015 Kohei Yoshida\n *\n * Permission is hereby granted, free of charge, to any person\n * obtaining a copy of this software and associated documentation\n * files (the \"Software\"), to deal in the Software without\n * restriction, including without limitation the rights to use,\n * copy, modify, merge, publish, distribute, sublicense, and\/or sell\n * copies of the Software, and to permit persons to whom the\n * Software is furnished to do so, subject to the following\n * conditions:\n *\n * The above copyright notice and this permission notice shall be\n * included in all copies or substantial portions of the Software.\n *\n * THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND,\n * EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES\n * OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND\n * NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT\n * HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY,\n * WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING\n * FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR\n * OTHER DEALINGS IN THE SOFTWARE.\n *\n ************************************************************************\/\n\n#ifndef INCLUDED_MDDS_TRIE_MAP_HPP\n#define INCLUDED_MDDS_TRIE_MAP_HPP\n\n#include <vector>\n#include <string>\n#include <deque>\n#include <map>\n\nnamespace mdds {\n\nnamespace trie {\n\n\/**\n * String trait that uses std::string as the key type. This trait can be\n * used with mdds::trie_map or mdds::packed_trie_map.\n *\/\nstruct std_string_trait\n{\n \/** type used to store a final string content. *\/\n typedef std::string string_type;\n\n \/**\n * type used to build an intermediate string value, from which a final\n * string object is to be created.\n *\/\n typedef std::string buffer_type;\n\n \/**\n * type that represents a single character inside a string or a buffer\n * object. A string object is expected to store a series of characters of\n * this type.\n *\/\n typedef char char_type;\n\n \/**\n * Function called to create and initialize a buffer object from a given\n * initial string value.\n *\n * @param str pointer to the first character of string value.\n * @param length length of the string value.\n *\n * @return buffer object containing the specified string value.\n *\/\n static buffer_type init_buffer(const char_type* str, size_t length)\n {\n return buffer_type(str, length);\n }\n\n \/**\n * Function called to append a single character to the end of a string\n * buffer.\n *\n * @param buffer buffer object to append character to.\n * @param c character to append to the buffer.\n *\/\n static void push_back(buffer_type& buffer, char_type c)\n {\n buffer.push_back(c);\n }\n\n \/**\n * Function called to remove a single character from the tail of an\n * existing string buffer.\n *\n * @param buffer buffer object to remove character from.\n *\/\n static void pop_back(buffer_type& buffer)\n {\n buffer.pop_back();\n }\n\n \/**\n * Function called to create a final string object from an existing\n * buffer.\n *\n * @param buf buffer object to create a final string object from.\n *\n * @return string object whose content is created from the buffer object.\n *\/\n static string_type to_string(const buffer_type& buf)\n {\n return buf;\n }\n};\n\n}\n\ntemplate<typename _KeyTrait, typename _ValueT>\nclass packed_trie_map;\n\n\/**\n * Trie map provides storage for multiple key-value pairs where keys are\n * either strings, or otherwise consist of arrays of characters. The keys\n * are stored in an ordered tree structure known as trie, or sometimes\n * referred to as prefix tree.\n *\/\ntemplate<typename _KeyTrait, typename _ValueT>\nclass trie_map\n{\n friend class packed_trie_map<_KeyTrait, _ValueT>;\n\npublic:\n typedef packed_trie_map<_KeyTrait, _ValueT> packed_type;\n typedef _KeyTrait key_trait_type;\n typedef typename key_trait_type::string_type string_type;\n typedef typename key_trait_type::buffer_type buffer_type;\n typedef typename key_trait_type::char_type char_type;\n typedef _ValueT value_type;\n typedef size_t size_type;\n typedef std::pair<string_type, value_type> key_value_type;\n\nprivate:\n\n struct trie_node\n {\n typedef std::map<char_type, trie_node> children_type;\n\n children_type children;\n value_type value;\n bool has_value;\n\n trie_node() : has_value(false) {}\n };\n\npublic:\n\n \/**\n * Not implemented.\n *\/\n trie_map() = delete;\n\n \/**\n * Constructor.\n *\n * @param null_value null value to return when the find method fails to\n * find a matching entry.\n *\/\n trie_map(value_type null_value);\n\n \/**\n * Insert a new key-value pair.\n *\n * @param key pointer to the first character of a character array that\n * stores key value.\n * @param len length of the character array storing the key.\n * @param value value to associate with the key.\n *\/\n void insert(const char_type* key, size_type len, const value_type& value);\n\n \/**\n * Erase a key and the value associated with it.\n *\n * @param key pointer to the first character of a character array that\n * stores key value.\n * @param len length of the character array storing the key.\n *\n * @return true if a key is erased, false otherwise.\n *\/\n bool erase(const char_type* key, size_type len);\n\n \/**\n * Find a value associated with a specified string key.\n *\n * @param input pointer to a C-style string whose value represents the key\n * to match.\n * @param len length of the matching string value.\n *\n * @return value associated with the key, or the null value in case the\n * key is not found.\n *\/\n value_type find(const char_type* input, size_type len) const;\n\n \/**\n * Retrieve all key-value pairs whose keys start with specified prefix.\n * You can also retrieve all key-value pairs by passing a null prefix and\n * a length of zero.\n *\n * @param prefix pointer to a C-style string whose value represents the\n * prefix to match.\n * @param len length of the prefix value to match.\n *\n * @return list of all matching key-value pairs sorted by the key in\n * ascending order.\n *\/\n std::vector<key_value_type> prefix_search(const char_type* prefix, size_type len) const;\n\n \/**\n * Return the number of entries in the map.\n *\n * @return the number of entries in the map.\n *\/\n size_type size() const;\n\n \/**\n * Empty the container.\n *\/\n void clear();\n\n \/**\n * Create a compressed and immutable version of the container which\n * provides better search performance and requires much less memory\n * footprint.\n *\n * @return an instance of mdds::packed_trie_map with the same content.\n *\/\n packed_type pack() const;\n\nprivate:\n void insert_into_tree(\n trie_node& node, const char_type* key, const char_type* key_end, const value_type& value);\n\n const trie_node* find_prefix_node(\n const trie_node& node, const char_type* prefix, const char_type* prefix_end) const;\n\n void fill_child_node_items(\n std::vector<key_value_type>& items, buffer_type& buffer, const trie_node& node) const;\n\n void count_values(size_type& n, const trie_node& node) const;\n\nprivate:\n value_type m_null_value;\n trie_node m_root;\n};\n\n\/**\n * An immutable trie container that packs its content into a contiguous\n * array to achieve both space efficiency and lookup performance. The user\n * of this data structure must provide a pre-constructed list of key-value\n * entries that are sorted by the key in ascending order, or construct from\n * an instance of mdds::trie_map.\n *\n * Note that, since this container is immutable, the content of the\n * container cannot be modified once constructed.\n *\/\ntemplate<typename _KeyTrait, typename _ValueT>\nclass packed_trie_map\n{\npublic:\n typedef _KeyTrait key_trait_type;\n typedef typename key_trait_type::string_type string_type;\n typedef typename key_trait_type::buffer_type buffer_type;\n typedef typename key_trait_type::char_type char_type;\n typedef _ValueT value_type;\n typedef size_t size_type;\n typedef std::pair<string_type, value_type> key_value_type;\n\n \/**\n * Single key-value entry. Caller must provide at compile time a static\n * array of these entries.\n *\/\n struct entry\n {\n const char_type* key;\n size_type keylen;\n value_type value;\n\n entry(const char_type* _key, size_type _keylen, value_type _value) :\n key(_key), keylen(_keylen), value(_value) {}\n };\n\nprivate:\n struct trie_node\n {\n char_type key;\n const value_type* value;\n\n std::deque<trie_node*> children;\n\n trie_node(char_type _key) : key(_key), value(nullptr) {}\n };\n\n typedef std::deque<trie_node> node_pool_type;\n typedef std::vector<uintptr_t> packed_type;\n typedef std::deque<value_type> value_store_type;\n typedef std::vector<std::tuple<size_t, char_type>> child_offsets_type;\n\npublic:\n\n \/**\n * Not implemented.\n *\/\n packed_trie_map() = delete;\n\n \/**\n * Constructor that initializes the content from a static list of\n * key-value entries. The caller <em>must<\/em> ensure that the key-value\n * entries are sorted in ascending order, else the behavior is undefined.\n *\n * @param entries pointer to the array of key-value entries.\n * @param entry_size size of the key-value entry array.\n * @param null_value null value to return when the find method fails to\n * find a matching entry.\n *\/\n packed_trie_map(const entry* entries, size_type entry_size, value_type null_value);\n\n \/**\n * Constructor to allow construction of an instance from the content of a\n * mdds::trie_map instance.\n *\n * @param other mdds::trie_map instance to build content from.\n *\/\n packed_trie_map(const trie_map<key_trait_type, value_type>& other);\n\n \/**\n * Find a value associated with a specified string key.\n *\n * @param input pointer to a C-style string whose value represents the key\n * to match.\n * @param len length of the matching string value.\n *\n * @return value associated with the key, or the null value in case the\n * key is not found.\n *\/\n value_type find(const char_type* input, size_type len) const;\n\n \/**\n * Retrieve all key-value pairs whose keys start with specified prefix.\n * You can also retrieve all key-value pairs by passing a null prefix and\n * a length of zero.\n *\n * @param prefix pointer to a C-style string whose value represents the\n * prefix to match.\n * @param len length of the prefix value to match.\n *\n * @return list of all matching key-value pairs sorted by the key in\n * ascending order.\n *\/\n std::vector<key_value_type> prefix_search(const char_type* prefix, size_type len) const;\n\n \/**\n * Return the number of entries in the map.\n *\n * @return the number of entries in the map.\n *\/\n size_type size() const;\n\nprivate:\n void traverse_range(\n trie_node& root, node_pool_type& node_pool, const entry* start, const entry* end,\n size_type pos);\n\n size_type compact_node(const trie_node& node);\n size_type compact_node(const typename trie_map<_KeyTrait, _ValueT>::trie_node& node);\n\n void push_child_offsets(size_type offset, const child_offsets_type& child_offsets);\n\n void compact(const trie_node& root);\n void compact(const typename trie_map<_KeyTrait, _ValueT>::trie_node& root);\n\n const uintptr_t* find_prefix_node(\n const uintptr_t* p, const char_type* prefix, const char_type* prefix_end) const;\n\n void fill_child_node_items(\n std::vector<key_value_type>& items, buffer_type& buffer, const uintptr_t* p) const;\n\n#ifdef MDDS_TRIE_MAP_DEBUG\n void dump_node(buffer_type& buffer, const trie_node& node) const;\n void dump_trie(const trie_node& root) const;\n void dump_packed_trie(const std::vector<uintptr_t>& packed) const;\n#endif\n\nprivate:\n value_type m_null_value;\n size_type m_entry_size;\n\n value_store_type m_value_store;\n packed_type m_packed;\n};\n\n}\n\n#include \"trie_map_def.inl\"\n\n#endif\n\n\/* vim:set shiftwidth=4 softtabstop=4 expandtab: *\/\n<|endoftext|>"} {"text":"<commit_before>\/**\n *\t\\file\n *\/\n \n \n#include <rleahylib\/rleahylib.hpp>\n#include <client.hpp>\n#include <packet.hpp>\n#include <functional>\n\n\nnamespace MCPP {\n\n\n\t\/**\n\t *\tEncapsulates information about a packet\n\t *\tbeing received from a client.\n\t *\/\n\tclass ReceiveEvent {\n\t\n\t\n\t\tpublic:\n\t\t\n\t\t\n\t\t\t\/**\n\t\t\t *\tThe client from which the packet was\n\t\t\t *\treceived.\n\t\t\t *\/\n\t\t\tSmartPointer<Client> & From;\n\t\t\t\/**\n\t\t\t *\tThe packet which was received.\n\t\t\t *\/\n\t\t\tPacket & Data;\n\t\n\t\n\t};\n\n\n\t\/**\n\t *\tProvides the facilities for routing\n\t *\tincoming packets to handlers.\n\t *\/\n\tclass PacketRouter {\n\t\n\t\n\t\tpublic:\n\t\t\n\t\t\n\t\t\t\/**\n\t\t\t *\tThe type of callback which may subscribe\n\t\t\t *\tto receive events.\n\t\t\t *\/\n\t\t\ttypedef std::function<void (ReceiveEvent)> Type;\n\t\n\t\n\t\tprivate:\n\t\t\n\t\t\n\t\t\t\/\/\tRoutes\n\t\t\tType play_routes [PacketImpl::LargestID+1];\n\t\t\tType status_routes [PacketImpl::LargestID+1];\n\t\t\tType login_routes [PacketImpl::LargestID+1];\n\t\t\tType handshake_routes [PacketImpl::LargestID+1];\n\t\t\t\n\t\t\t\n\t\t\tinline void destroy () noexcept;\n\t\t\tinline void init () noexcept;\n\t\t\t\n\t\t\t\n\t\tpublic:\n\t\t\n\t\t\n\t\t\t\/**\n\t\t\t *\tCreates a new packet router with no\n\t\t\t *\troutes.\n\t\t\t *\/\n\t\t\tPacketRouter () noexcept;\n\t\t\t\n\t\t\t\n\t\t\t\/**\n\t\t\t *\tCleans up a packet router.\n\t\t\t *\/\n\t\t\t~PacketRouter () noexcept;\n\t\t\t\n\t\t\t\n\t\t\t\/**\n\t\t\t *\tFetches a packet route.\n\t\t\t *\n\t\t\t *\t\\param [in] id\n\t\t\t *\t\tThe ID of the packet whole route\n\t\t\t *\t\tshall be retrieved.\n\t\t\t *\t\\param [it] state\n\t\t\t *\t\tThe state of the packet whose route\n\t\t\t *\t\tshall be retreived.\n\t\t\t *\n\t\t\t *\t\\return\n\t\t\t *\t\tA reference to the requested route.\n\t\t\t *\/\n\t\t\tType & operator () (UInt32 id, ProtocolState state) noexcept;\n\t\t\t\/**\n\t\t\t *\tFetches a packet route.\n\t\t\t *\n\t\t\t *\t\\param [in] id\n\t\t\t *\t\tThe ID of the packet whole route\n\t\t\t *\t\tshall be retrieved.\n\t\t\t *\t\\param [it] state\n\t\t\t *\t\tThe state of the packet whose route\n\t\t\t *\t\tshall be retreived.\n\t\t\t *\n\t\t\t *\t\\return\n\t\t\t *\t\tA reference to the requested route.\n\t\t\t *\/\n\t\t\tconst Type & operator () (UInt32 id, ProtocolState state) const noexcept;\n\t\t\t\n\t\t\t\n\t\t\t\/**\n\t\t\t *\tDispatches a packet to the appropriate\n\t\t\t *\thandler.\n\t\t\t *\n\t\t\t *\t\\param [in] event\n\t\t\t *\t\tThe event object which represents\n\t\t\t *\t\tthis receive event.\n\t\t\t *\t\\param [in] state\n\t\t\t *\t\tThe state the protocol is in.\n\t\t\t *\/\n\t\t\tvoid operator () (ReceiveEvent event, ProtocolState state) const;\n\t\t\t\n\t\t\t\n\t\t\t\/**\n\t\t\t *\tClears all handlers.\n\t\t\t *\/\n\t\t\tvoid Clear () noexcept;\n\t\n\t\n\t};\n\n\n}\n<commit_msg>Packet Router Header Fix<commit_after>\/**\n *\t\\file\n *\/\n \n \n#pragma once\n \n \n#include <rleahylib\/rleahylib.hpp>\n#include <client.hpp>\n#include <packet.hpp>\n#include <functional>\n\n\nnamespace MCPP {\n\n\n\t\/**\n\t *\tEncapsulates information about a packet\n\t *\tbeing received from a client.\n\t *\/\n\tclass ReceiveEvent {\n\t\n\t\n\t\tpublic:\n\t\t\n\t\t\n\t\t\t\/**\n\t\t\t *\tThe client from which the packet was\n\t\t\t *\treceived.\n\t\t\t *\/\n\t\t\tSmartPointer<Client> & From;\n\t\t\t\/**\n\t\t\t *\tThe packet which was received.\n\t\t\t *\/\n\t\t\tPacket & Data;\n\t\n\t\n\t};\n\n\n\t\/**\n\t *\tProvides the facilities for routing\n\t *\tincoming packets to handlers.\n\t *\/\n\tclass PacketRouter {\n\t\n\t\n\t\tpublic:\n\t\t\n\t\t\n\t\t\t\/**\n\t\t\t *\tThe type of callback which may subscribe\n\t\t\t *\tto receive events.\n\t\t\t *\/\n\t\t\ttypedef std::function<void (ReceiveEvent)> Type;\n\t\n\t\n\t\tprivate:\n\t\t\n\t\t\n\t\t\t\/\/\tRoutes\n\t\t\tType play_routes [PacketImpl::LargestID+1];\n\t\t\tType status_routes [PacketImpl::LargestID+1];\n\t\t\tType login_routes [PacketImpl::LargestID+1];\n\t\t\tType handshake_routes [PacketImpl::LargestID+1];\n\t\t\t\n\t\t\t\n\t\t\tinline void destroy () noexcept;\n\t\t\tinline void init () noexcept;\n\t\t\t\n\t\t\t\n\t\tpublic:\n\t\t\n\t\t\n\t\t\t\/**\n\t\t\t *\tCreates a new packet router with no\n\t\t\t *\troutes.\n\t\t\t *\/\n\t\t\tPacketRouter () noexcept;\n\t\t\t\n\t\t\t\n\t\t\t\/**\n\t\t\t *\tCleans up a packet router.\n\t\t\t *\/\n\t\t\t~PacketRouter () noexcept;\n\t\t\t\n\t\t\t\n\t\t\t\/**\n\t\t\t *\tFetches a packet route.\n\t\t\t *\n\t\t\t *\t\\param [in] id\n\t\t\t *\t\tThe ID of the packet whole route\n\t\t\t *\t\tshall be retrieved.\n\t\t\t *\t\\param [it] state\n\t\t\t *\t\tThe state of the packet whose route\n\t\t\t *\t\tshall be retreived.\n\t\t\t *\n\t\t\t *\t\\return\n\t\t\t *\t\tA reference to the requested route.\n\t\t\t *\/\n\t\t\tType & operator () (UInt32 id, ProtocolState state) noexcept;\n\t\t\t\/**\n\t\t\t *\tFetches a packet route.\n\t\t\t *\n\t\t\t *\t\\param [in] id\n\t\t\t *\t\tThe ID of the packet whole route\n\t\t\t *\t\tshall be retrieved.\n\t\t\t *\t\\param [it] state\n\t\t\t *\t\tThe state of the packet whose route\n\t\t\t *\t\tshall be retreived.\n\t\t\t *\n\t\t\t *\t\\return\n\t\t\t *\t\tA reference to the requested route.\n\t\t\t *\/\n\t\t\tconst Type & operator () (UInt32 id, ProtocolState state) const noexcept;\n\t\t\t\n\t\t\t\n\t\t\t\/**\n\t\t\t *\tDispatches a packet to the appropriate\n\t\t\t *\thandler.\n\t\t\t *\n\t\t\t *\t\\param [in] event\n\t\t\t *\t\tThe event object which represents\n\t\t\t *\t\tthis receive event.\n\t\t\t *\t\\param [in] state\n\t\t\t *\t\tThe state the protocol is in.\n\t\t\t *\/\n\t\t\tvoid operator () (ReceiveEvent event, ProtocolState state) const;\n\t\t\t\n\t\t\t\n\t\t\t\/**\n\t\t\t *\tClears all handlers.\n\t\t\t *\/\n\t\t\tvoid Clear () noexcept;\n\t\n\t\n\t};\n\n\n}\n<|endoftext|>"} {"text":"<commit_before>#include \"testing\/testing.hpp\"\n\n#include \"routing_common\/car_model_coefs.hpp\"\n#include \"routing_common\/maxspeed_conversion.hpp\"\n#include \"routing_common\/vehicle_model.hpp\"\n\n#include \"indexer\/classificator.hpp\"\n#include \"indexer\/classificator_loader.hpp\"\n#include \"indexer\/feature.hpp\"\n\n#include \"platform\/measurement_utils.hpp\"\n\n#include \"base\/macros.hpp\"\n#include \"base\/math.hpp\"\n\n#include <cstdint>\n#include <vector>\n\nusing namespace routing;\nusing namespace std;\n\nnamespace\n{\nHighwayBasedSpeeds const kDefaultSpeeds = {\n {HighwayType::HighwayTrunk, InOutCitySpeedKMpH(100.0 \/* in city *\/, 150.0 \/* out city *\/)},\n {HighwayType::HighwayPrimary, InOutCitySpeedKMpH(90.0 \/* in city *\/, 120.0 \/* out city *\/)},\n {HighwayType::HighwaySecondary,\n InOutCitySpeedKMpH(SpeedKMpH(80.0 \/* weight *\/, 70.0 \/* eta *\/) \/* in and out city*\/)},\n {HighwayType::HighwayResidential,\n InOutCitySpeedKMpH(SpeedKMpH(45.0 \/* weight *\/, 55.0 \/* eta *\/) \/* in city *\/,\n SpeedKMpH(50.0 \/* weight *\/, 60.0 \/* eta *\/) \/* out city *\/)},\n {HighwayType::HighwayService,\n InOutCitySpeedKMpH(SpeedKMpH(47.0 \/* weight *\/, 36.0 \/* eta *\/) \/* in city *\/,\n SpeedKMpH(50.0 \/* weight *\/, 40.0 \/* eta *\/) \/* out city *\/)}};\n\nHighwayBasedFactors const kDefaultFactors = {\n {HighwayType::HighwayTrunk, InOutCityFactor(1.0)},\n {HighwayType::HighwayPrimary, InOutCityFactor(1.0)},\n {HighwayType::HighwaySecondary, InOutCityFactor(1.0)},\n {HighwayType::HighwayResidential, InOutCityFactor(0.5)}};\n\nVehicleModel::LimitsInitList const kTestLimits = {{{\"highway\", \"trunk\"}, true},\n {{\"highway\", \"primary\"}, true},\n {{\"highway\", \"secondary\"}, true},\n {{\"highway\", \"residential\"}, true},\n {{\"highway\", \"service\"}, false}};\n\nVehicleModel::SurfaceInitList const kCarSurface = {\n {{\"psurface\", \"paved_good\"}, {0.8 \/* weightFactor *\/, 0.9 \/* etaFactor *\/}},\n {{\"psurface\", \"paved_bad\"}, {0.4, 0.5}},\n {{\"psurface\", \"unpaved_good\"}, {0.6, 0.8}},\n {{\"psurface\", \"unpaved_bad\"}, {0.2, 0.2}}};\n\nclass VehicleModelTest\n{\npublic:\n VehicleModelTest() { classificator::Load(); }\n};\n\nclass TestVehicleModel : public VehicleModel\n{\n friend void CheckOneWay(initializer_list<uint32_t> const & types, bool expectedValue);\n friend void CheckPassThroughAllowed(initializer_list<uint32_t> const & types, bool expectedValue);\n friend void CheckSpeedWithParams(initializer_list<uint32_t> const & types,\n SpeedParams const & params, SpeedKMpH const & expectedSpeed);\n\npublic:\n TestVehicleModel()\n : VehicleModel(classif(), kTestLimits, kCarSurface, {kDefaultSpeeds, kDefaultFactors})\n {\n }\n\n \/\/ We are not going to use offroad routing in these tests.\n SpeedKMpH const & GetOffroadSpeed() const override { return kDummy; }\n\nprivate:\n static SpeedKMpH const kDummy;\n};\n\nSpeedKMpH const TestVehicleModel::kDummy = {0.0 \/* weight *\/, 0.0 \/* eta *\/};\n\nuint32_t GetType(char const * s0, char const * s1 = 0, char const * s2 = 0)\n{\n char const * const t[] = {s0, s1, s2};\n size_t const size = (s0 != 0) + size_t(s1 != 0) + size_t(s2 != 0);\n return classif().GetTypeByPath(vector<string>(t, t + size));\n}\n\nuint32_t GetOnewayType()\n{\n return GetType(\"hwtag\", \"oneway\");\n}\n\nvoid CheckSpeedWithParams(initializer_list<uint32_t> const & types, SpeedParams const & params,\n SpeedKMpH const & expectedSpeed)\n{\n TestVehicleModel vehicleModel;\n feature::TypesHolder h;\n for (uint32_t t : types)\n h.Add(t);\n\n TEST_EQUAL(vehicleModel.GetTypeSpeed(h, params), expectedSpeed, ());\n}\n\nvoid CheckSpeed(initializer_list<uint32_t> const & types, InOutCitySpeedKMpH const & expectedSpeed)\n{\n SpeedParams const inCity(true \/* forward *\/, true \/* in city *\/, Maxspeed());\n CheckSpeedWithParams(types, inCity, expectedSpeed.m_inCity);\n SpeedParams const outCity(true \/* forward *\/, false \/* in city *\/, Maxspeed());\n CheckSpeedWithParams(types, outCity, expectedSpeed.m_outCity);\n}\n\nvoid CheckOneWay(initializer_list<uint32_t> const & types, bool expectedValue)\n{\n TestVehicleModel vehicleModel;\n feature::TypesHolder h;\n for (uint32_t t : types)\n h.Add(t);\n\n TEST_EQUAL(vehicleModel.HasOneWayType(h), expectedValue, ());\n}\n\nvoid CheckPassThroughAllowed(initializer_list<uint32_t> const & types, bool expectedValue)\n{\n TestVehicleModel vehicleModel;\n feature::TypesHolder h;\n for (uint32_t t : types)\n h.Add(t);\n\n TEST_EQUAL(vehicleModel.HasPassThroughType(h), expectedValue, ());\n}\n} \/\/ namespace\n\nUNIT_CLASS_TEST(VehicleModelTest, VehicleModel_MaxSpeed)\n{\n TestVehicleModel vehicleModel;\n TEST_EQUAL(vehicleModel.GetMaxWeightSpeed(), 150.0, ());\n}\n\nUNIT_CLASS_TEST(VehicleModelTest, VehicleModel_Speed)\n{\n {\n CheckSpeed({GetType(\"highway\", \"secondary\", \"bridge\")}, kDefaultSpeeds.at(HighwayType::HighwaySecondary));\n CheckSpeed({GetType(\"highway\", \"secondary\", \"tunnel\")}, kDefaultSpeeds.at(HighwayType::HighwaySecondary));\n CheckSpeed({GetType(\"highway\", \"secondary\")}, kDefaultSpeeds.at(HighwayType::HighwaySecondary));\n }\n\n CheckSpeed({GetType(\"highway\", \"trunk\")},\n {SpeedKMpH(100.0 \/* weight *\/, 100.0 \/* eta *\/) \/* in city *\/,\n SpeedKMpH(150.0 \/* weight *\/, 150.0 \/* eta *\/) \/* out of city *\/});\n CheckSpeed({GetType(\"highway\", \"primary\")}, {SpeedKMpH(90.0, 90.0), SpeedKMpH(120.0, 120.0)});\n CheckSpeed({GetType(\"highway\", \"residential\")}, {SpeedKMpH(22.5, 27.5), SpeedKMpH(25.0, 30.0)});\n}\n\nUNIT_CLASS_TEST(VehicleModelTest, VehicleModel_Speed_MultiTypes)\n{\n uint32_t const typeTunnel = GetType(\"highway\", \"secondary\", \"tunnel\");\n uint32_t const typeSecondary = GetType(\"highway\", \"secondary\");\n uint32_t const typeHighway = GetType(\"highway\");\n\n CheckSpeed({typeTunnel, typeSecondary}, kDefaultSpeeds.at(HighwayType::HighwaySecondary));\n CheckSpeed({typeTunnel, typeHighway}, kDefaultSpeeds.at(HighwayType::HighwaySecondary));\n CheckSpeed({typeHighway, typeTunnel}, kDefaultSpeeds.at(HighwayType::HighwaySecondary));\n}\n\nUNIT_CLASS_TEST(VehicleModelTest, VehicleModel_OneWay)\n{\n uint32_t const typeBridge = GetType(\"highway\", \"secondary\", \"bridge\");\n uint32_t const typeOneway = GetOnewayType();\n\n CheckSpeed({typeBridge, typeOneway}, kDefaultSpeeds.at(HighwayType::HighwaySecondary));\n CheckOneWay({typeBridge, typeOneway}, true);\n CheckSpeed({typeOneway, typeBridge}, kDefaultSpeeds.at(HighwayType::HighwaySecondary));\n CheckOneWay({typeOneway, typeBridge}, true);\n\n CheckOneWay({typeOneway}, true);\n}\n\nUNIT_CLASS_TEST(VehicleModelTest, VehicleModel_DifferentSpeeds)\n{\n uint32_t const typeSecondary = GetType(\"highway\", \"secondary\");\n uint32_t const typePrimary = GetType(\"highway\", \"primary\");\n uint32_t const typeOneway = GetOnewayType();\n\n CheckSpeed({typeSecondary, typePrimary}, kDefaultSpeeds.at(HighwayType::HighwaySecondary));\n\n CheckSpeed({typeSecondary, typePrimary, typeOneway}, kDefaultSpeeds.at(HighwayType::HighwaySecondary));\n CheckOneWay({typePrimary, typeOneway, typeSecondary}, true);\n}\n\nUNIT_CLASS_TEST(VehicleModelTest, VehicleModel_PassThroughAllowed)\n{\n CheckPassThroughAllowed({GetType(\"highway\", \"secondary\")}, true);\n CheckPassThroughAllowed({GetType(\"highway\", \"primary\")}, true);\n CheckPassThroughAllowed({GetType(\"highway\", \"service\")}, false);\n}\n\nUNIT_CLASS_TEST(VehicleModelTest, VehicleModel_SpeedFactor)\n{\n uint32_t const secondary = GetType(\"highway\", \"secondary\");\n uint32_t const residential = GetType(\"highway\", \"residential\");\n uint32_t const pavedGood = GetType(\"psurface\", \"paved_good\");\n uint32_t const pavedBad = GetType(\"psurface\", \"paved_bad\");\n uint32_t const unpavedGood = GetType(\"psurface\", \"unpaved_good\");\n uint32_t const unpavedBad = GetType(\"psurface\", \"unpaved_bad\");\n\n CheckSpeed({secondary, pavedGood},\n {SpeedKMpH(64.0 \/* weight *\/, 63.0 \/* eta *\/) \/* in city *\/,\n SpeedKMpH(64.0 \/* weight *\/, 63.0 \/* eta *\/) \/* out of city *\/});\n CheckSpeed({secondary, pavedBad}, {SpeedKMpH(32.0, 35.0), SpeedKMpH(32.0, 35.0)});\n CheckSpeed({secondary, unpavedGood}, {SpeedKMpH(48.0, 56.0), SpeedKMpH(48.0, 56.0)});\n CheckSpeed({secondary, unpavedBad}, {SpeedKMpH(16.0, 14.0), SpeedKMpH(16.0, 14.0)});\n\n CheckSpeed({residential, pavedGood}, {SpeedKMpH(18.0, 24.75), SpeedKMpH(20.0, 27.0)});\n CheckSpeed({residential, pavedBad}, {SpeedKMpH(9.0, 13.75), SpeedKMpH(10.0, 15.0)});\n CheckSpeed({residential, unpavedGood}, {SpeedKMpH(13.5, 22.0), SpeedKMpH(15.0, 24.0)});\n CheckSpeed({residential, unpavedBad}, {SpeedKMpH(4.5, 5.5), SpeedKMpH(5.0, 6.0)});\n}\n\nUNIT_CLASS_TEST(VehicleModelTest, VehicleModel_MaxspeedFactor)\n{\n uint32_t const secondary = GetType(\"highway\", \"secondary\");\n uint32_t const residential = GetType(\"highway\", \"residential\");\n uint32_t const primary = GetType(\"highway\", \"primary\");\n uint32_t const pavedGood = GetType(\"psurface\", \"paved_good\");\n uint32_t const unpavedBad = GetType(\"psurface\", \"unpaved_bad\");\n\n Maxspeed const maxspeed90 =\n Maxspeed(measurement_utils::Units::Metric, 90 \/* forward speed *\/, kInvalidSpeed);\n CheckSpeedWithParams({secondary, unpavedBad},\n SpeedParams(true \/* forward *\/, false \/* in city *\/, maxspeed90),\n SpeedKMpH(18.0));\n\n CheckSpeedWithParams({primary, pavedGood},\n SpeedParams(true \/* forward *\/, false \/* in city *\/, maxspeed90),\n SpeedKMpH(72.0, 81.0));\n\n Maxspeed const maxspeed9070 =\n Maxspeed(measurement_utils::Units::Metric, 90 \/* forward speed *\/, 70);\n CheckSpeedWithParams({primary, pavedGood},\n SpeedParams(true \/* forward *\/, false \/* in city *\/, maxspeed9070),\n SpeedKMpH(72.0, 81.0));\n CheckSpeedWithParams({primary, pavedGood},\n SpeedParams(false \/* forward *\/, false \/* in city *\/, maxspeed9070),\n SpeedKMpH(56.0, 63.0));\n\n Maxspeed const maxspeed60 =\n Maxspeed(measurement_utils::Units::Metric, 60 \/* forward speed *\/, kInvalidSpeed);\n CheckSpeedWithParams({residential, pavedGood},\n SpeedParams(true \/* forward *\/, false \/* in city *\/, maxspeed60),\n SpeedKMpH(24.0, 27.0));\n}\n\nUNIT_TEST(VehicleModel_MultiplicationOperatorTest)\n{\n SpeedKMpH const speed(90 \/* weight *\/, 100 \/* eta *\/);\n SpeedFactor const factor(1.0, 1.1);\n SpeedKMpH const lResult = speed * factor;\n SpeedKMpH const rResult = factor * speed;\n TEST_EQUAL(lResult, rResult, ());\n TEST(base::AlmostEqualAbs(lResult.m_weight, 90.0, 1e-7), ());\n TEST(base::AlmostEqualAbs(lResult.m_eta, 110.0, 1e-7), ());\n}\n\nUNIT_TEST(VehicleModel_CarModelValidation)\n{\n vector<HighwayType> const carRoadTypes = {\n HighwayType::HighwayLivingStreet, HighwayType::HighwayMotorway,\n HighwayType::HighwayMotorwayLink, HighwayType::HighwayPrimary,\n HighwayType::HighwayPrimaryLink, HighwayType::HighwayResidential,\n HighwayType::HighwayRoad, HighwayType::HighwaySecondary,\n HighwayType::HighwaySecondaryLink, HighwayType::HighwayService,\n HighwayType::HighwayTertiary, HighwayType::HighwayTertiaryLink,\n HighwayType::HighwayTrack, HighwayType::HighwayTrunk,\n HighwayType::HighwayTrunkLink, HighwayType::HighwayUnclassified,\n HighwayType::ManMadePier, HighwayType::RailwayRailMotorVehicle,\n HighwayType::RouteFerryMotorcar, HighwayType::RouteFerryMotorVehicle,\n HighwayType::RouteShuttleTrain};\n\n for (auto const hwType : carRoadTypes)\n {\n auto const factorIt = kHighwayBasedFactors.find(hwType);\n TEST(factorIt != kHighwayBasedFactors.cend(), (hwType));\n TEST(factorIt->second.IsValid(), (hwType, factorIt->second));\n\n auto const speedIt = kHighwayBasedSpeeds.find(hwType);\n TEST(speedIt != kHighwayBasedSpeeds.cend(), (hwType));\n TEST(speedIt->second.IsValid(), (hwType, speedIt->second));\n }\n}\n<commit_msg>[routing] Fixing routing common tests after updating car model.<commit_after>#include \"testing\/testing.hpp\"\n\n#include \"routing_common\/car_model_coefs.hpp\"\n#include \"routing_common\/maxspeed_conversion.hpp\"\n#include \"routing_common\/vehicle_model.hpp\"\n\n#include \"indexer\/classificator.hpp\"\n#include \"indexer\/classificator_loader.hpp\"\n#include \"indexer\/feature.hpp\"\n\n#include \"platform\/measurement_utils.hpp\"\n\n#include \"base\/macros.hpp\"\n#include \"base\/math.hpp\"\n\n#include <cstdint>\n#include <vector>\n\nusing namespace routing;\nusing namespace std;\n\nnamespace\n{\nHighwayBasedSpeeds const kDefaultSpeeds = {\n {HighwayType::HighwayTrunk, InOutCitySpeedKMpH(100.0 \/* in city *\/, 150.0 \/* out city *\/)},\n {HighwayType::HighwayPrimary, InOutCitySpeedKMpH(90.0 \/* in city *\/, 120.0 \/* out city *\/)},\n {HighwayType::HighwaySecondary,\n InOutCitySpeedKMpH(SpeedKMpH(80.0 \/* weight *\/, 70.0 \/* eta *\/) \/* in and out city*\/)},\n {HighwayType::HighwayResidential,\n InOutCitySpeedKMpH(SpeedKMpH(45.0 \/* weight *\/, 55.0 \/* eta *\/) \/* in city *\/,\n SpeedKMpH(50.0 \/* weight *\/, 60.0 \/* eta *\/) \/* out city *\/)},\n {HighwayType::HighwayService,\n InOutCitySpeedKMpH(SpeedKMpH(47.0 \/* weight *\/, 36.0 \/* eta *\/) \/* in city *\/,\n SpeedKMpH(50.0 \/* weight *\/, 40.0 \/* eta *\/) \/* out city *\/)}};\n\nHighwayBasedFactors const kDefaultFactors = {\n {HighwayType::HighwayTrunk, InOutCityFactor(1.0)},\n {HighwayType::HighwayPrimary, InOutCityFactor(1.0)},\n {HighwayType::HighwaySecondary, InOutCityFactor(1.0)},\n {HighwayType::HighwayResidential, InOutCityFactor(0.5)}};\n\nVehicleModel::LimitsInitList const kTestLimits = {{{\"highway\", \"trunk\"}, true},\n {{\"highway\", \"primary\"}, true},\n {{\"highway\", \"secondary\"}, true},\n {{\"highway\", \"residential\"}, true},\n {{\"highway\", \"service\"}, false}};\n\nVehicleModel::SurfaceInitList const kCarSurface = {\n {{\"psurface\", \"paved_good\"}, {0.8 \/* weightFactor *\/, 0.9 \/* etaFactor *\/}},\n {{\"psurface\", \"paved_bad\"}, {0.4, 0.5}},\n {{\"psurface\", \"unpaved_good\"}, {0.6, 0.8}},\n {{\"psurface\", \"unpaved_bad\"}, {0.2, 0.2}}};\n\nclass VehicleModelTest\n{\npublic:\n VehicleModelTest() { classificator::Load(); }\n};\n\nclass TestVehicleModel : public VehicleModel\n{\n friend void CheckOneWay(initializer_list<uint32_t> const & types, bool expectedValue);\n friend void CheckPassThroughAllowed(initializer_list<uint32_t> const & types, bool expectedValue);\n friend void CheckSpeedWithParams(initializer_list<uint32_t> const & types,\n SpeedParams const & params, SpeedKMpH const & expectedSpeed);\n\npublic:\n TestVehicleModel()\n : VehicleModel(classif(), kTestLimits, kCarSurface, {kDefaultSpeeds, kDefaultFactors})\n {\n }\n\n \/\/ We are not going to use offroad routing in these tests.\n SpeedKMpH const & GetOffroadSpeed() const override { return kDummy; }\n\nprivate:\n static SpeedKMpH const kDummy;\n};\n\nSpeedKMpH const TestVehicleModel::kDummy = {0.0 \/* weight *\/, 0.0 \/* eta *\/};\n\nuint32_t GetType(char const * s0, char const * s1 = 0, char const * s2 = 0)\n{\n char const * const t[] = {s0, s1, s2};\n size_t const size = (s0 != 0) + size_t(s1 != 0) + size_t(s2 != 0);\n return classif().GetTypeByPath(vector<string>(t, t + size));\n}\n\nuint32_t GetOnewayType()\n{\n return GetType(\"hwtag\", \"oneway\");\n}\n\nvoid CheckSpeedWithParams(initializer_list<uint32_t> const & types, SpeedParams const & params,\n SpeedKMpH const & expectedSpeed)\n{\n TestVehicleModel vehicleModel;\n feature::TypesHolder h;\n for (uint32_t t : types)\n h.Add(t);\n\n TEST_EQUAL(vehicleModel.GetTypeSpeed(h, params), expectedSpeed, ());\n}\n\nvoid CheckSpeed(initializer_list<uint32_t> const & types, InOutCitySpeedKMpH const & expectedSpeed)\n{\n SpeedParams const inCity(true \/* forward *\/, true \/* in city *\/, Maxspeed());\n CheckSpeedWithParams(types, inCity, expectedSpeed.m_inCity);\n SpeedParams const outCity(true \/* forward *\/, false \/* in city *\/, Maxspeed());\n CheckSpeedWithParams(types, outCity, expectedSpeed.m_outCity);\n}\n\nvoid CheckOneWay(initializer_list<uint32_t> const & types, bool expectedValue)\n{\n TestVehicleModel vehicleModel;\n feature::TypesHolder h;\n for (uint32_t t : types)\n h.Add(t);\n\n TEST_EQUAL(vehicleModel.HasOneWayType(h), expectedValue, ());\n}\n\nvoid CheckPassThroughAllowed(initializer_list<uint32_t> const & types, bool expectedValue)\n{\n TestVehicleModel vehicleModel;\n feature::TypesHolder h;\n for (uint32_t t : types)\n h.Add(t);\n\n TEST_EQUAL(vehicleModel.HasPassThroughType(h), expectedValue, ());\n}\n} \/\/ namespace\n\nUNIT_CLASS_TEST(VehicleModelTest, VehicleModel_MaxSpeed)\n{\n TestVehicleModel vehicleModel;\n TEST_EQUAL(vehicleModel.GetMaxWeightSpeed(), 150.0, ());\n}\n\nUNIT_CLASS_TEST(VehicleModelTest, VehicleModel_Speed)\n{\n {\n CheckSpeed({GetType(\"highway\", \"secondary\", \"bridge\")}, kDefaultSpeeds.at(HighwayType::HighwaySecondary));\n CheckSpeed({GetType(\"highway\", \"secondary\", \"tunnel\")}, kDefaultSpeeds.at(HighwayType::HighwaySecondary));\n CheckSpeed({GetType(\"highway\", \"secondary\")}, kDefaultSpeeds.at(HighwayType::HighwaySecondary));\n }\n\n CheckSpeed({GetType(\"highway\", \"trunk\")},\n {SpeedKMpH(100.0 \/* weight *\/, 100.0 \/* eta *\/) \/* in city *\/,\n SpeedKMpH(150.0 \/* weight *\/, 150.0 \/* eta *\/) \/* out of city *\/});\n CheckSpeed({GetType(\"highway\", \"primary\")}, {SpeedKMpH(90.0, 90.0), SpeedKMpH(120.0, 120.0)});\n CheckSpeed({GetType(\"highway\", \"residential\")}, {SpeedKMpH(45, 27.5), SpeedKMpH(50.0, 30.0)});\n}\n\nUNIT_CLASS_TEST(VehicleModelTest, VehicleModel_Speed_MultiTypes)\n{\n uint32_t const typeTunnel = GetType(\"highway\", \"secondary\", \"tunnel\");\n uint32_t const typeSecondary = GetType(\"highway\", \"secondary\");\n uint32_t const typeHighway = GetType(\"highway\");\n\n CheckSpeed({typeTunnel, typeSecondary}, kDefaultSpeeds.at(HighwayType::HighwaySecondary));\n CheckSpeed({typeTunnel, typeHighway}, kDefaultSpeeds.at(HighwayType::HighwaySecondary));\n CheckSpeed({typeHighway, typeTunnel}, kDefaultSpeeds.at(HighwayType::HighwaySecondary));\n}\n\nUNIT_CLASS_TEST(VehicleModelTest, VehicleModel_OneWay)\n{\n uint32_t const typeBridge = GetType(\"highway\", \"secondary\", \"bridge\");\n uint32_t const typeOneway = GetOnewayType();\n\n CheckSpeed({typeBridge, typeOneway}, kDefaultSpeeds.at(HighwayType::HighwaySecondary));\n CheckOneWay({typeBridge, typeOneway}, true);\n CheckSpeed({typeOneway, typeBridge}, kDefaultSpeeds.at(HighwayType::HighwaySecondary));\n CheckOneWay({typeOneway, typeBridge}, true);\n\n CheckOneWay({typeOneway}, true);\n}\n\nUNIT_CLASS_TEST(VehicleModelTest, VehicleModel_DifferentSpeeds)\n{\n uint32_t const typeSecondary = GetType(\"highway\", \"secondary\");\n uint32_t const typePrimary = GetType(\"highway\", \"primary\");\n uint32_t const typeOneway = GetOnewayType();\n\n CheckSpeed({typeSecondary, typePrimary}, kDefaultSpeeds.at(HighwayType::HighwaySecondary));\n\n CheckSpeed({typeSecondary, typePrimary, typeOneway}, kDefaultSpeeds.at(HighwayType::HighwaySecondary));\n CheckOneWay({typePrimary, typeOneway, typeSecondary}, true);\n}\n\nUNIT_CLASS_TEST(VehicleModelTest, VehicleModel_PassThroughAllowed)\n{\n CheckPassThroughAllowed({GetType(\"highway\", \"secondary\")}, true);\n CheckPassThroughAllowed({GetType(\"highway\", \"primary\")}, true);\n CheckPassThroughAllowed({GetType(\"highway\", \"service\")}, false);\n}\n\nUNIT_CLASS_TEST(VehicleModelTest, VehicleModel_SpeedFactor)\n{\n uint32_t const secondary = GetType(\"highway\", \"secondary\");\n uint32_t const residential = GetType(\"highway\", \"residential\");\n uint32_t const pavedGood = GetType(\"psurface\", \"paved_good\");\n uint32_t const pavedBad = GetType(\"psurface\", \"paved_bad\");\n uint32_t const unpavedGood = GetType(\"psurface\", \"unpaved_good\");\n uint32_t const unpavedBad = GetType(\"psurface\", \"unpaved_bad\");\n\n CheckSpeed({secondary, pavedGood},\n {SpeedKMpH(64.0 \/* weight *\/, 63.0 \/* eta *\/) \/* in city *\/,\n SpeedKMpH(64.0 \/* weight *\/, 63.0 \/* eta *\/) \/* out of city *\/});\n CheckSpeed({secondary, pavedBad}, {SpeedKMpH(32.0, 35.0), SpeedKMpH(32.0, 35.0)});\n CheckSpeed({secondary, unpavedGood}, {SpeedKMpH(48.0, 56.0), SpeedKMpH(48.0, 56.0)});\n CheckSpeed({secondary, unpavedBad}, {SpeedKMpH(16.0, 14.0), SpeedKMpH(16.0, 14.0)});\n\n CheckSpeed({residential, pavedGood}, {SpeedKMpH(36.0, 24.75), SpeedKMpH(40.0, 27.0)});\n CheckSpeed({residential, pavedBad}, {SpeedKMpH(18.0, 13.75), SpeedKMpH(20.0, 15.0)});\n CheckSpeed({residential, unpavedGood}, {SpeedKMpH(27, 22.0), SpeedKMpH(30.0, 24.0)});\n CheckSpeed({residential, unpavedBad}, {SpeedKMpH(9, 5.5), SpeedKMpH(10.0, 6.0)});\n}\n\nUNIT_CLASS_TEST(VehicleModelTest, VehicleModel_MaxspeedFactor)\n{\n uint32_t const secondary = GetType(\"highway\", \"secondary\");\n uint32_t const residential = GetType(\"highway\", \"residential\");\n uint32_t const primary = GetType(\"highway\", \"primary\");\n uint32_t const pavedGood = GetType(\"psurface\", \"paved_good\");\n uint32_t const unpavedBad = GetType(\"psurface\", \"unpaved_bad\");\n\n Maxspeed const maxspeed90 =\n Maxspeed(measurement_utils::Units::Metric, 90 \/* forward speed *\/, kInvalidSpeed);\n CheckSpeedWithParams({secondary, unpavedBad},\n SpeedParams(true \/* forward *\/, false \/* in city *\/, maxspeed90),\n SpeedKMpH(18.0));\n\n CheckSpeedWithParams({primary, pavedGood},\n SpeedParams(true \/* forward *\/, false \/* in city *\/, maxspeed90),\n SpeedKMpH(72.0, 81.0));\n\n Maxspeed const maxspeed9070 =\n Maxspeed(measurement_utils::Units::Metric, 90 \/* forward speed *\/, 70);\n CheckSpeedWithParams({primary, pavedGood},\n SpeedParams(true \/* forward *\/, false \/* in city *\/, maxspeed9070),\n SpeedKMpH(72.0, 81.0));\n CheckSpeedWithParams({primary, pavedGood},\n SpeedParams(false \/* forward *\/, false \/* in city *\/, maxspeed9070),\n SpeedKMpH(56.0, 63.0));\n\n Maxspeed const maxspeed60 =\n Maxspeed(measurement_utils::Units::Metric, 60 \/* forward speed *\/, kInvalidSpeed);\n CheckSpeedWithParams({residential, pavedGood},\n SpeedParams(true \/* forward *\/, false \/* in city *\/, maxspeed60),\n SpeedKMpH(24.0, 27.0));\n}\n\nUNIT_TEST(VehicleModel_MultiplicationOperatorTest)\n{\n SpeedKMpH const speed(90 \/* weight *\/, 100 \/* eta *\/);\n SpeedFactor const factor(1.0, 1.1);\n SpeedKMpH const lResult = speed * factor;\n SpeedKMpH const rResult = factor * speed;\n TEST_EQUAL(lResult, rResult, ());\n TEST(base::AlmostEqualAbs(lResult.m_weight, 90.0, 1e-7), ());\n TEST(base::AlmostEqualAbs(lResult.m_eta, 110.0, 1e-7), ());\n}\n\nUNIT_TEST(VehicleModel_CarModelValidation)\n{\n vector<HighwayType> const carRoadTypes = {\n HighwayType::HighwayLivingStreet, HighwayType::HighwayMotorway,\n HighwayType::HighwayMotorwayLink, HighwayType::HighwayPrimary,\n HighwayType::HighwayPrimaryLink, HighwayType::HighwayResidential,\n HighwayType::HighwayRoad, HighwayType::HighwaySecondary,\n HighwayType::HighwaySecondaryLink, HighwayType::HighwayService,\n HighwayType::HighwayTertiary, HighwayType::HighwayTertiaryLink,\n HighwayType::HighwayTrack, HighwayType::HighwayTrunk,\n HighwayType::HighwayTrunkLink, HighwayType::HighwayUnclassified,\n HighwayType::ManMadePier, HighwayType::RailwayRailMotorVehicle,\n HighwayType::RouteFerryMotorcar, HighwayType::RouteFerryMotorVehicle,\n HighwayType::RouteShuttleTrain};\n\n for (auto const hwType : carRoadTypes)\n {\n auto const factorIt = kHighwayBasedFactors.find(hwType);\n TEST(factorIt != kHighwayBasedFactors.cend(), (hwType));\n TEST(factorIt->second.IsValid(), (hwType, factorIt->second));\n\n auto const speedIt = kHighwayBasedSpeeds.find(hwType);\n TEST(speedIt != kHighwayBasedSpeeds.cend(), (hwType));\n TEST(speedIt->second.IsValid(), (hwType, speedIt->second));\n }\n}\n<|endoftext|>"} {"text":"<commit_before>\/*\n* 2013+ Copyright (c) Andrey Kashin <kashin.andrej@gmail.com>\n* All rights reserved.\n*\n* This program is free software; you can redistribute it and\/or modify\n* it under the terms of the GNU Lesser General Public License as published by\n* the Free Software Foundation; either version 2 of the License, or\n* (at your option) any later version.\n*\n* This program is distributed in the hope that it will be useful,\n* but WITHOUT ANY WARRANTY; without even the implied warranty of\n* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the\n* GNU Lesser General Public License for more details.\n*\/\n\n#ifndef UPDATER_HPP\n#define UPDATER_HPP\n\n#include <stack>\n#include <stdexcept>\n\n#include \"call_tree.hpp\"\n\nnamespace react {\n\n\/*!\n * \\brief Class for interactive building of call tree\n *\n * Allows you to log actions in call-tree manner.\n *\/\nclass call_tree_updater_t {\npublic:\n\t\/*!\n\t * \\brief Call tree node type\n\t *\/\n\ttypedef call_tree_t::node_t node_t;\n\n\t\/*!\n\t * \\brief Pointer to call tree node type\n\t *\/\n\ttypedef call_tree_t::p_node_t p_node_t;\n\n\t\/*!\n\t * \\brief Time point type\n\t *\/\n\ttypedef std::chrono::time_point<std::chrono::system_clock> time_point_t;\n\n\t\/*!\n\t * \\brief Initializes updater without target tree\n\t * \\param max_depth Maximum monitored depth of call stack\n\t *\/\n\tcall_tree_updater_t(const size_t max_depth = DEFAULT_DEPTH):\n\t\tcurrent_node(0), call_tree(NULL), depth(0), max_depth(max_depth) {\n\t\tmeasurements.emplace(std::chrono::system_clock::now(), +call_tree_t::NO_NODE);\n\t}\n\n\t\/*!\n\t * \\brief Initializes updater with target tree\n\t * \\param call_tree Tree used to monitor updates\n\t * \\param max_depth Maximum monitored depth of call stack\n\t *\/\n\tcall_tree_updater_t(concurrent_call_tree_t &call_tree,\n\t\t\tconst size_t max_depth = DEFAULT_DEPTH):\n\t\tcurrent_node(0), call_tree(NULL), depth(0), max_depth(max_depth) {\n\t\tset_call_tree(call_tree);\n\t\tmeasurements.emplace(std::chrono::system_clock::now(), +call_tree_t::NO_NODE);\n\t}\n\n\t\/*!\n\t * \\brief Checks if all actions were correctly finished.\n\t *\/\n\tvirtual ~call_tree_updater_t() {\n\t\tcheck_for_extra_measurements();\n\t}\n\n\t\/*!\n\t * \\brief Sets target tree for updates\n\t * \\param call_tree Tree used to monitor updates\n\t *\/\n\tvoid set_call_tree(concurrent_call_tree_t &call_tree) {\n\t\tcheck_for_extra_measurements();\n\t\tcurrent_node = call_tree.get_call_tree().root;\n\t\tthis->call_tree = &call_tree;\n\t\tdepth = 0;\n\t}\n\n\t\/*!\n\t * \\brief Resets current call tree\n\t *\/\n\tvoid reset_call_tree() {\n\t\tcheck_for_extra_measurements();\n\t\tcurrent_node = call_tree_t::NO_NODE;\n\t\tthis->call_tree = NULL;\n\t\tdepth = 0;\n\t}\n\n\t\/*!\n\t * \\brief Checks whether tree for updates is set\n\t * \\return whether updater target tree was set\n\t *\/\n\tbool has_call_tree() const {\n\t\treturn (call_tree != NULL);\n\t}\n\n\t\/*!\n\t * \\brief Starts new branch in tree with action \\a action_code\n\t * \\param action_code Code of new action\n\t *\/\n\tvirtual void start(const int action_code) {\n\t\tstart(action_code, std::chrono::system_clock::now());\n\t}\n\n\t\/*!\n\t * \\brief Starts new branch in tree with action \\a action_code and with specified start time\n\t * \\param action_code Code of new action\n\t * \\param start_time Action start time\n\t *\/\n\tvoid start(const int action_code, const time_point_t& start_time) {\n\t\t++depth;\n\t\tif (get_depth() > max_depth) {\n\t\t\treturn;\n\t\t}\n\n\t\tcall_tree->lock();\n\t\tp_node_t next_node = call_tree->get_call_tree().add_new_link_if_missing(current_node, action_code);\n\t\tcall_tree->unlock();\n\n\t\tmeasurements.emplace(start_time, current_node);\n\t\tcurrent_node = next_node;\n\t}\n\n\t\/*!\n\t * \\brief Stops last action. Updates total consumed time in call-tree.\n\t * \\param action_code Code of finished action\n\t *\/\n\tvirtual void stop(const int action_code) {\n\t\tif (get_depth() > max_depth) {\n\t\t\t--depth;\n\t\t\treturn;\n\t\t}\n\n\t\tstd::lock_guard<concurrent_call_tree_t> guard(*call_tree);\n\n\t\tint expected_code = call_tree->get_call_tree().get_node_action_code(current_node);\n\t\tif (expected_code != action_code) {\n\t\t\tstd::string expected_action_name = get_action_name(expected_code);\n\t\t\tstd::string found_action_name = get_action_name(action_code);\n\t\t\tthrow std::logic_error(\"Stopping wrong action. Expected: \" + expected_action_name + \", Found: \" + found_action_name);\n\t\t}\n\t\tpop_measurement();\n\t}\n\n\t\/*!\n\t * \\brief Sets max monitored call stack depth to \\a max_depth\n\t * \\param max_depth Max monitored call stack depth\n\t *\/\n\tvoid set_max_depth(const size_t max_depth) {\n\t\tif (depth != 0) {\n\t\t\tthrow std::logic_error(\"can't change max_depth during update\");\n\t\t}\n\n\t\tthis->max_depth = max_depth;\n\t}\n\n\t\/*!\n\t * \\brief Gets current call stack depth\n\t * \\return Current call stack depth\n\t *\/\n\tsize_t get_depth() const {\n\t\treturn depth;\n\t}\n\n\t\/*!\n\t * \\brief Returns name of action with \\a action_code\n\t * \\return Name of action with \\a action_code\n\t *\/\n\tstd::string get_action_name(int action_code) const {\n\t\treturn call_tree->get_call_tree().get_actions_set().get_action_name(action_code);\n\t}\n\n\t\/*!\n\t * \\brief Returns name of action in current node\n\t * \\return Current's node action name\n\t *\/\n\tstd::string get_current_node_action_name() const {\n\t\treturn get_action_name(call_tree->get_call_tree().get_node_action_code(current_node));\n\t}\n\nprivate:\n\t\/*!\n\t * \\internal\n\t *\n\t * \\brief Returns delta between two time_points\n\t *\/\n\ttemplate<class Period = std::chrono::microseconds>\n\tint64_t delta(const time_point_t& start, const time_point_t& end) const {\n\t\treturn (std::chrono::duration_cast<Period> (end - start)).count();\n\t}\n\n\t\/*!\n\t * \\internal\n\t *\n\t * \\brief Assures that updater is empty\n\t *\/\n\tvoid check_for_extra_measurements() {\n\t\tif (depth != 0) {\n\t\t\tstd::string error_message;\n\t\t\tif (!call_tree) {\n\t\t\t\terror_message = \"~time_stats_updater(): extra measurements, tree is NULL\\n\";\n\t\t\t} else {\n\t\t\t\terror_message = \"~time_stats_updater(): extra measurements:\\n\";\n\t\t\t\twhile (!measurements.empty()) {\n\t\t\t\t\terror_message += get_current_node_action_name() + '\\n';\n\t\t\t\t\tpop_measurement();\n\t\t\t\t}\n\t\t\t}\n\t\t\tstd::cerr << error_message << std::endl;\n\t\t\tthrow std::logic_error(error_message);\n\t\t}\n\t}\n\n\t\/*!\n\t * \\brief Represents single call measurement\n\t *\/\n\tstruct measurement {\n\t\t\/*!\n\t\t * \\brief Initializes measurement with specified start time and pointer to previous node in call stack\n\t\t * \\param time Start time\n\t\t * \\param previous_node Pointer to previous node in call stack\n\t\t *\/\n\t\tmeasurement(const time_point_t& time, p_node_t previous_node): start_time(time),\n\t\t\tprevious_node(previous_node) {}\n\n\t\t\/*!\n\t\t * \\brief Start time of the measurement\n\t\t *\/\n\t\ttime_point_t start_time;\n\n\t\t\/*!\n\t\t * \\brief Pointer to previous node in call stack\n\t\t *\/\n\t\tp_node_t previous_node;\n\t};\n\n\t\/*!\n\t * \\brief Removes measurement from top of call stack and updates corresponding node in call-tree\n\t * \\param stop_time End time of the measurement\n\t *\/\n\tvoid pop_measurement(const time_point_t& stop_time = std::chrono::system_clock::now()) {\n\t\tmeasurement previous_measurement = measurements.top();\n\t\tmeasurements.pop();\n\t\tcall_tree->get_call_tree().set_node_start_time(current_node, delta(time_point_t(), previous_measurement.start_time));\n\t\tcall_tree->get_call_tree().set_node_stop_time(current_node, delta(time_point_t(), stop_time));\n\t\tcurrent_node = previous_measurement.previous_node;\n\t\t--depth;\n\t}\n\n\t\/*!\n\t * \\brief Current position in call-tree\n\t *\/\n\tp_node_t current_node;\n\n\t\/*!\n\t * \\brief Call stack\n\t *\/\n\tstd::stack<measurement> measurements;\n\n\t\/*!\n\t * \\brief Target call-tree\n\t *\/\n\tconcurrent_call_tree_t* call_tree;\n\n\t\/*!\n\t * \\brief Current call stack depth\n\t *\/\n\tsize_t depth;\n\n\t\/*!\n\t * \\brief Maximum monitored call stack depth\n\t *\/\n\tsize_t max_depth;\n\n\t\/*!\n\t * \\brief Default monitored call stack depth\n\t *\/\n\tstatic const size_t DEFAULT_DEPTH = -1;\n};\n\nclass dummy_call_tree_updater_t : public call_tree_updater_t {\npublic:\n\tdummy_call_tree_updater_t() {}\n\t~dummy_call_tree_updater_t() {}\n\n\tvoid start(int) {}\n\tvoid stop(int) {}\n};\n\n\/*!\n * \\brief Auxiliary class for logging actions with variable place of stop time (branching\/end of function\/end of scope)\n *\/\nclass action_guard_t {\npublic:\n\t\/*!\n\t * \\brief Initializes guard and starts action with \\a action_code\n\t * \\param updater Updater whos start is called\n\t * \\param action_code Code of new action\n\t *\/\n\taction_guard_t(call_tree_updater_t *updater, const int action_code):\n\t\tupdater(updater), action_code(action_code), is_stopped(false) {\n\t\tif (updater) {\n\t\t\tupdater->start(action_code);\n\t\t}\n\t}\n\n\t\/*!\n\t * \\brief Stops action if it is not already stopped\n\t *\/\n\t~action_guard_t() {\n\t\tif (!is_stopped && updater) {\n\t\t\tupdater->stop(action_code);\n\t\t}\n\t}\n\n\t\/*!\n\t * \\brief Allows to stop action manually\n\t *\/\n\tvoid stop() {\n\t\tif (is_stopped) {\n\t\t\tthrow std::logic_error(\"action \" + updater->get_action_name(action_code) + \" is already stopped\");\n\t\t}\n\n\t\tif (updater) {\n\t\t\tupdater->stop(action_code);\n\t\t\tis_stopped = true;\n\t\t}\n\t}\n\nprivate:\n\t\/*!\n\t * \\brief Updater whos start\/stop are called\n\t *\/\n\tcall_tree_updater_t *updater;\n\n\t\/*!\n\t * \\brief Action code of guarded action\n\t *\/\n\tconst int action_code;\n\n\t\/*!\n\t * \\brief Shows if action is already stopped\n\t *\/\n\tbool is_stopped;\n};\n\n} \/\/ namespace react\n\n#endif \/\/ UPDATER_HPP\n<commit_msg>core: updater<commit_after>\/*\n* 2013+ Copyright (c) Andrey Kashin <kashin.andrej@gmail.com>\n* All rights reserved.\n*\n* This program is free software; you can redistribute it and\/or modify\n* it under the terms of the GNU Lesser General Public License as published by\n* the Free Software Foundation; either version 2 of the License, or\n* (at your option) any later version.\n*\n* This program is distributed in the hope that it will be useful,\n* but WITHOUT ANY WARRANTY; without even the implied warranty of\n* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the\n* GNU Lesser General Public License for more details.\n*\/\n\n#ifndef UPDATER_HPP\n#define UPDATER_HPP\n\n#include <stack>\n#include <stdexcept>\n\n#include \"call_tree.hpp\"\n\nnamespace react {\n\n\/*!\n * \\brief Class for interactive building of call tree\n *\n * Allows you to log actions in call-tree manner.\n *\/\nclass call_tree_updater_t {\npublic:\n\t\/*!\n\t * \\brief Call tree node type\n\t *\/\n\ttypedef call_tree_t::node_t node_t;\n\n\t\/*!\n\t * \\brief Pointer to call tree node type\n\t *\/\n\ttypedef call_tree_t::p_node_t p_node_t;\n\n\t\/*!\n\t * \\brief Time point type\n\t *\/\n\ttypedef std::chrono::time_point<std::chrono::system_clock> time_point_t;\n\n\t\/*!\n\t * \\brief Default monitored call stack depth\n\t *\/\n\tstatic const size_t DEFAULT_MAX_TRACE_DEPTH = -1;\n\n\t\/*!\n\t * \\brief Initializes updater without target tree\n\t * \\param max_depth Maximum monitored depth of call stack\n\t *\/\n\tcall_tree_updater_t(const size_t max_depth = DEFAULT_MAX_TRACE_DEPTH):\n\t\tcurrent_node(+call_tree_t::NO_NODE), call_tree(NULL),\n\t\ttrace_depth(0), max_trace_depth(max_depth) {\n\t\tmeasurements.emplace(std::chrono::system_clock::now(), +call_tree_t::NO_NODE);\n\t}\n\n\t\/*!\n\t * \\brief Initializes updater with target tree\n\t * \\param call_tree Tree used to monitor updates\n\t * \\param max_depth Maximum monitored depth of call stack\n\t *\/\n\tcall_tree_updater_t(concurrent_call_tree_t &call_tree,\n\t\t\tconst size_t max_depth = DEFAULT_MAX_TRACE_DEPTH):\n\t\tcurrent_node(+call_tree_t::NO_NODE), call_tree(NULL),\n\t\ttrace_depth(0), max_trace_depth(max_depth) {\n\t\tset_call_tree(call_tree);\n\t\tmeasurements.emplace(std::chrono::system_clock::now(), +call_tree_t::NO_NODE);\n\t}\n\n\t\/*!\n\t * \\brief Checks if all actions were correctly finished.\n\t *\/\n\t~call_tree_updater_t() {\n\t\ttry {\n\t\t\tcheck_for_extra_measurements();\n\t\t} catch (std::logic_error &e) {\n\t\t\tstd::cerr << e.what() << std::endl;\n\t\t}\n\t}\n\n\t\/*!\n\t * \\brief Sets target tree for updates\n\t * \\param call_tree Tree used to monitor updates\n\t *\/\n\tvoid set_call_tree(concurrent_call_tree_t &call_tree) {\n\t\tcheck_for_extra_measurements();\n\t\tcurrent_node = call_tree.get_call_tree().root;\n\t\tthis->call_tree = &call_tree;\n\t\ttrace_depth = 0;\n\t}\n\n\t\/*!\n\t * \\brief Resets current call tree\n\t *\/\n\tvoid reset_call_tree() {\n\t\tcheck_for_extra_measurements();\n\t\tcurrent_node = call_tree_t::NO_NODE;\n\t\tthis->call_tree = NULL;\n\t\ttrace_depth = 0;\n\t}\n\n\t\/*!\n\t * \\brief Checks whether tree for updates is set\n\t * \\return whether updater target tree was set\n\t *\/\n\tbool has_call_tree() const {\n\t\treturn (call_tree != NULL);\n\t}\n\n\t\/*!\n\t * \\brief Starts new branch in tree with action \\a action_code\n\t * \\param action_code Code of new action\n\t *\/\n\tvoid start(const int action_code) {\n\t\tstart(action_code, std::chrono::system_clock::now());\n\t}\n\n\t\/*!\n\t * \\brief Starts new branch in tree with action \\a action_code and with specified start time\n\t * \\param action_code Code of new action\n\t * \\param start_time Action start time\n\t *\/\n\tvoid start(const int action_code, const time_point_t& start_time) {\n\t\tif (!action_code_is_valid(action_code)) {\n\t\t\tthrow std::invalid_argument(\n\t\t\t\t\t\t\"Can't start action: action code is invalid: \" + std::to_string(action_code)\n\t\t\t\t\t\t);\n\t\t}\n\n\t\t++trace_depth;\n\t\tif (get_trace_depth() > max_trace_depth) {\n\t\t\treturn;\n\t\t}\n\n\t\tp_node_t next_node = call_tree_t::NO_NODE;\n\t\t{\n\t\t\tstd::lock_guard<concurrent_call_tree_t> guard(*call_tree);\n\t\t\tnext_node = call_tree->get_call_tree().add_new_link(current_node, action_code);\n\t\t}\n\n\t\tmeasurements.emplace(start_time, current_node);\n\t\tcurrent_node = next_node;\n\t}\n\n\t\/*!\n\t * \\brief Stops last action. Updates total consumed time in call-tree.\n\t * \\param action_code Code of finished action\n\t *\/\n\tvoid stop(const int action_code) {\n\t\tif (!action_code_is_valid(action_code)) {\n\t\t\tthrow std::invalid_argument(\n\t\t\t\t\t\t\"Can't stop action: action code is invalid: \" + std::to_string(action_code)\n\t\t\t\t\t\t);\n\t\t}\n\n\t\tif (get_trace_depth() > max_trace_depth) {\n\t\t\t--trace_depth;\n\t\t\treturn;\n\t\t}\n\n\t\tstd::lock_guard<concurrent_call_tree_t> guard(*call_tree);\n\n\t\tint expected_code = call_tree->get_call_tree().get_node_action_code(current_node);\n\t\tif (expected_code != action_code) {\n\t\t\tstd::string expected_action_name = get_action_name(expected_code);\n\t\t\tstd::string found_action_name = get_action_name(action_code);\n\t\t\tthrow std::logic_error(\"Stopping wrong action. Expected: \" + expected_action_name + \", Found: \" + found_action_name);\n\t\t}\n\t\tpop_measurement();\n\t}\n\n\t\/*!\n\t * \\brief Gets max allowed call stack depth\n\t * \\return Max allowed call stack depth\n\t *\/\n\tsize_t get_max_trace_depth() const {\n\t\treturn max_trace_depth;\n\t}\n\n\t\/*!\n\t * \\brief Sets max monitored call stack depth to \\a max_depth\n\t * \\param max_depth Max monitored call stack depth\n\t *\/\n\tvoid set_max_trace_depth(const size_t max_depth) {\n\t\tif (trace_depth != 0) {\n\t\t\tthrow std::logic_error(\"can't change max_depth during update\");\n\t\t}\n\n\t\tthis->max_trace_depth = max_depth;\n\t}\n\n\t\/*!\n\t * \\brief Gets current call stack depth\n\t * \\return Current call stack depth\n\t *\/\n\tsize_t get_actual_trace_depth() const {\n\t\treturn measurements.size() - 1;\n\t}\n\n\t\/*!\n\t * \\brief Gets current intended call stack depth\n\t * \\return Current intended call stack depth\n\t *\/\n\tsize_t get_trace_depth() const {\n\t\treturn trace_depth;\n\t}\n\n\t\/*!\n\t * \\brief Returns name of action with \\a action_code\n\t * \\return Name of action with \\a action_code\n\t *\/\n\tstd::string get_action_name(int action_code) const {\n\t\tif (!has_call_tree()) {\n\t\t\tthrow std::logic_error(\"Can't get action name: tree is not set\");\n\t\t}\n\n\t\treturn call_tree->get_call_tree().get_actions_set().get_action_name(action_code);\n\t}\n\n\t\/*!\n\t * \\brief Checks whether \\a action_code is registred in actions_set\n\t * \\return True if \\a action_code is registred, false otherwise\n\t *\/\n\tbool action_code_is_valid(int action_code) {\n\t\tif (!has_call_tree()) {\n\t\t\tthrow std::logic_error(\"Can't check action_code validity: tree is not set\");\n\t\t}\n\n\t\treturn call_tree->get_call_tree().get_actions_set().code_is_valid(action_code);\n\t}\n\n\t\/*!\n\t * \\brief Returns updater's current node or NO_NODE if call tree is not set\n\t * \\return Pointer to updater's current node\n\t *\/\n\tp_node_t get_current_node() const {\n\t\treturn current_node;\n\t}\n\n\t\/*!\n\t * \\brief Returns name of action in current node\n\t * \\return Current's node action name\n\t *\/\n\tstd::string get_current_node_action_name() const {\n\t\tif (!has_call_tree()) {\n\t\t\tthrow std::logic_error(\"Can't get action name: tree is not set\");\n\t\t}\n\n\t\treturn get_action_name(call_tree->get_call_tree().get_node_action_code(current_node));\n\t}\n\nprivate:\n\t\/*!\n\t * \\internal\n\t *\n\t * \\brief Returns delta between two time_points\n\t *\/\n\ttemplate<class Period = std::chrono::microseconds>\n\tint64_t delta(const time_point_t& start, const time_point_t& end) const {\n\t\treturn (std::chrono::duration_cast<Period> (end - start)).count();\n\t}\n\n\t\/*!\n\t * \\internal\n\t *\n\t * \\brief Assures that updater is empty\n\t *\/\n\tvoid check_for_extra_measurements() {\n\t\tif (get_trace_depth() != 0) {\n\t\t\tstd::string error_message;\n\t\t\tif (!call_tree) {\n\t\t\t\terror_message = \"~time_stats_updater(): extra measurements, tree is NULL\\n\";\n\t\t\t} else {\n\t\t\t\terror_message = \"~time_stats_updater(): extra measurements:\\n\";\n\t\t\t\tif (get_actual_trace_depth() != get_trace_depth()) {\n\t\t\t\t\terror_message +=\n\t\t\t\t\t\t\tstd::to_string(get_trace_depth() - get_actual_trace_depth())\n\t\t\t\t\t\t\t+ \" untracked actions due to max depth\\n\";\n\t\t\t\t}\n\t\t\t\twhile (get_actual_trace_depth() > 0) {\n\t\t\t\t\terror_message += get_current_node_action_name() + '\\n';\n\t\t\t\t\tpop_measurement();\n\t\t\t\t}\n\t\t\t}\n\t\t\tthrow std::logic_error(error_message);\n\t\t}\n\t}\n\n\t\/*!\n\t * \\brief Represents single call measurement\n\t *\/\n\tstruct measurement {\n\t\t\/*!\n\t\t * \\brief Initializes measurement with specified start time and pointer to previous node in call stack\n\t\t * \\param time Start time\n\t\t * \\param previous_node Pointer to previous node in call stack\n\t\t *\/\n\t\tmeasurement(const time_point_t& time, p_node_t previous_node): start_time(time),\n\t\t\tprevious_node(previous_node) {}\n\n\t\t\/*!\n\t\t * \\brief Start time of the measurement\n\t\t *\/\n\t\ttime_point_t start_time;\n\n\t\t\/*!\n\t\t * \\brief Pointer to previous node in call stack\n\t\t *\/\n\t\tp_node_t previous_node;\n\t};\n\n\t\/*!\n\t * \\brief Removes measurement from top of call stack and updates corresponding node in call-tree\n\t * \\param stop_time End time of the measurement\n\t *\/\n\tvoid pop_measurement(const time_point_t& stop_time = std::chrono::system_clock::now()) {\n\t\tmeasurement previous_measurement = measurements.top();\n\t\tmeasurements.pop();\n\t\tcall_tree->get_call_tree().set_node_start_time(current_node, delta(time_point_t(), previous_measurement.start_time));\n\t\tcall_tree->get_call_tree().set_node_stop_time(current_node, delta(time_point_t(), stop_time));\n\t\tcurrent_node = previous_measurement.previous_node;\n\t\t--trace_depth;\n\t}\n\n\t\/*!\n\t * \\brief Current position in call-tree\n\t *\/\n\tp_node_t current_node;\n\n\t\/*!\n\t * \\brief Call stack\n\t *\/\n\tstd::stack<measurement> measurements;\n\n\t\/*!\n\t * \\brief Target call-tree\n\t *\/\n\tconcurrent_call_tree_t* call_tree;\n\n\t\/*!\n\t * \\brief Current call stack depth\n\t *\/\n\tsize_t trace_depth;\n\n\t\/*!\n\t * \\brief Maximum monitored call stack depth\n\t *\/\n\tsize_t max_trace_depth;\n};\n\n\/*!\n * \\brief Auxiliary class for logging actions with variable place of stop time (branching\/end of function\/end of scope)\n *\/\nclass action_guard_t {\npublic:\n\t\/*!\n\t * \\brief Initializes guard and starts action with \\a action_code\n\t * \\param updater Updater whos start is called\n\t * \\param action_code Code of new action\n\t *\/\n\taction_guard_t(call_tree_updater_t *updater, const int action_code):\n\t\tupdater(updater), action_code(action_code), is_stopped(false) {\n\t\tif (updater) {\n\t\t\tupdater->start(action_code);\n\t\t}\n\t}\n\n\t\/*!\n\t * \\brief Stops action if it is not already stopped\n\t *\/\n\t~action_guard_t() {\n\t\tif (!is_stopped && updater) {\n\t\t\tupdater->stop(action_code);\n\t\t}\n\t}\n\n\t\/*!\n\t * \\brief Allows to stop action manually\n\t *\/\n\tvoid stop() {\n\t\tif (is_stopped) {\n\t\t\tstd::string error_message;\n\n\t\t\tif (updater) {\n\t\t\t\terror_message = \"action \"\n\t\t\t\t\t\t+ updater->get_action_name(action_code)\n\t\t\t\t\t\t+ \" is already stopped\";\n\t\t\t} else {\n\t\t\t\terror_message = \"action \"\n\t\t\t\t\t\t+ std::to_string(action_code)\n\t\t\t\t\t\t+ \" is already stopped\";\n\t\t\t}\n\n\t\t\tthrow std::logic_error(error_message);\n\t\t}\n\n\t\tif (updater) {\n\t\t\tupdater->stop(action_code);\n\t\t}\n\t\tis_stopped = true;\n\t}\n\nprivate:\n\t\/*!\n\t * \\brief Updater whos start\/stop are called\n\t *\/\n\tcall_tree_updater_t *updater;\n\n\t\/*!\n\t * \\brief Action code of guarded action\n\t *\/\n\tconst int action_code;\n\n\t\/*!\n\t * \\brief Shows if action is already stopped\n\t *\/\n\tbool is_stopped;\n};\n\n} \/\/ namespace react\n\n#endif \/\/ UPDATER_HPP\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#define UNICODE\n#define _UNICODE\n\n#include <cstddef>\n\n#define WIN32_LEAN_AND_MEAN\n#if defined _MSC_VER\n#pragma warning(push, 1)\n#endif\n#include <windows.h>\n#include <shellapi.h>\n#if defined _MSC_VER\n#pragma warning(pop)\n#endif\n\n#include <tchar.h>\n\n#include <malloc.h>\n#include <string.h>\n#include <stdlib.h>\n#include <systools\/win32\/uwinapi.h>\n\n#include \"rtl\/string.h\"\n#include <sal\/macros.h>\n\n#include \"..\/..\/..\/source\/inc\/exithelper.hxx\"\n#include \"..\/extendloaderenvironment.hxx\"\n\n#define PIPE_PREFIX TEXT(\"\\\\\\\\.\\\\pipe\\\\OSL_PIPE_\")\n#define PIPE_POSTFIX TEXT(\"_SingleOfficeIPC_\")\n#define PIPE_TERMINATION_SEQUENCE \"InternalIPC::ProcessingDone\"\n\nBOOL WINAPI ConvertSidToStringSid( PSID pSid, LPTSTR* StringSid )\n{\n PSID_IDENTIFIER_AUTHORITY psia;\n DWORD dwSubAuthorities;\n DWORD dwSidRev=SID_REVISION;\n DWORD dwCounter;\n DWORD dwSidSize;\n\n \/\/ Validate the binary SID.\n\n if(!IsValidSid(pSid)) return FALSE;\n\n \/\/ Get the identifier authority value from the SID.\n\n psia = GetSidIdentifierAuthority(pSid);\n\n \/\/ Get the number of subauthorities in the SID.\n\n dwSubAuthorities = *GetSidSubAuthorityCount(pSid);\n\n \/\/ Compute the buffer length.\n \/\/ S-SID_REVISION- + IdentifierAuthority- + subauthorities- + NULL\n\n dwSidSize=(15 + 12 + (12 * dwSubAuthorities) + 1) * sizeof(TCHAR);\n\n *StringSid = (LPTSTR)LocalAlloc( LMEM_FIXED, dwSidSize );\n\n \/\/ Add 'S' prefix and revision number to the string.\n\n dwSidSize=wsprintf(*StringSid, TEXT(\"S-%lu-\"), dwSidRev );\n\n \/\/ Add a SID identifier authority to the string.\n\n if ( (psia->Value[0] != 0) || (psia->Value[1] != 0) )\n {\n dwSidSize+=wsprintf(*StringSid + lstrlen(*StringSid),\n TEXT(\"0x%02hx%02hx%02hx%02hx%02hx%02hx\"),\n (USHORT)psia->Value[0],\n (USHORT)psia->Value[1],\n (USHORT)psia->Value[2],\n (USHORT)psia->Value[3],\n (USHORT)psia->Value[4],\n (USHORT)psia->Value[5]);\n }\n else\n {\n dwSidSize+=wsprintf(*StringSid + lstrlen(*StringSid),\n TEXT(\"%lu\"),\n (ULONG)(psia->Value[5] ) +\n (ULONG)(psia->Value[4] << 8) +\n (ULONG)(psia->Value[3] << 16) +\n (ULONG)(psia->Value[2] << 24) );\n }\n\n \/\/ Add SID subauthorities to the string.\n for (dwCounter=0 ; dwCounter < dwSubAuthorities ; dwCounter++)\n {\n dwSidSize+=wsprintf(*StringSid + dwSidSize, TEXT(\"-%lu\"),\n *GetSidSubAuthority(pSid, dwCounter) );\n }\n\n return TRUE;\n}\n\n\n\/\/---------------------------------------------------------------------------\n\nstatic LPTSTR *GetCommandArgs( int *pArgc )\n{\n#ifdef UNICODE\n return CommandLineToArgvW( GetCommandLineW(), pArgc );\n#else\n *pArgc = __argc;\n return __argv;\n#endif\n}\n\n\/\/---------------------------------------------------------------------------\n\nnamespace {\n\nbool writeArgument(HANDLE pipe, char prefix, WCHAR const * argument) {\n CHAR szBuffer[4096];\n int n = WideCharToMultiByte(\n CP_UTF8, 0, argument, -1, szBuffer, sizeof (szBuffer), NULL, NULL);\n char b[1 + 2 * ((sizeof szBuffer) - 1)]; \/\/ hopefully does not overflow\n b[0] = prefix;\n char * p = b + 1;\n for (int i = 0; i < n - 1; ++i) { \/\/ cannot underflow (n >= 0)\n char c = szBuffer[i];\n switch (c) {\n case '\\0':\n *p++ = '\\\\';\n *p++ = '0';\n break;\n case ',':\n *p++ = '\\\\';\n *p++ = ',';\n break;\n case '\\\\':\n *p++ = '\\\\';\n *p++ = '\\\\';\n break;\n default:\n *p++ = c;\n break;\n }\n }\n DWORD w;\n return WriteFile(pipe, b, p - b, &w, NULL);\n}\n\n}\n\n#ifdef __MINGW32__\nint WINAPI WinMain( HINSTANCE hInstance, HINSTANCE, LPSTR, int )\n#else\nint WINAPI _tWinMain( HINSTANCE, HINSTANCE, LPTSTR, int )\n#endif\n{\n TCHAR szTargetFileName[MAX_PATH] = TEXT(\"\");\n TCHAR szIniDirectory[MAX_PATH];\n TCHAR szPerfTuneIniFile[MAX_PATH] = TEXT(\"\");\n STARTUPINFO aStartupInfo;\n\n desktop_win32::extendLoaderEnvironment(szTargetFileName, szIniDirectory);\n\n ZeroMemory( &aStartupInfo, sizeof(aStartupInfo) );\n aStartupInfo.cb = sizeof(aStartupInfo);\n\n GetStartupInfo( &aStartupInfo );\n \/\/ Get image path with same name but with .bin extension\n\n TCHAR szModuleFileName[MAX_PATH];\n\n GetModuleFileName( NULL, szModuleFileName, MAX_PATH );\n _TCHAR *lpLastSlash = _tcsrchr( szModuleFileName, '\\\\' );\n if ( lpLastSlash )\n {\n size_t len = lpLastSlash - szModuleFileName + 1;\n _tcsncpy( szPerfTuneIniFile, szModuleFileName, len );\n _tcsncpy( szPerfTuneIniFile + len, _T(\"perftune.ini\"), SAL_N_ELEMENTS(szPerfTuneIniFile) - len );\n }\n\n \/\/ Create process with same command line, environment and stdio handles which\n \/\/ are directed to the created pipes\n\n DWORD dwExitCode = (DWORD)-1;\n\n BOOL fSuccess = FALSE;\n LPTSTR lpCommandLine = NULL;\n int argc = 0;\n LPTSTR * argv = NULL;\n bool bFirst = true;\n WCHAR cwd[MAX_PATH];\n DWORD cwdLen = GetCurrentDirectoryW(MAX_PATH, cwd);\n if (cwdLen >= MAX_PATH) {\n cwdLen = 0;\n }\n\n do\n {\n TCHAR szKey[32];\n\n GetPrivateProfileString(\n TEXT(\"PerformanceTuning\"),\n TEXT(\"FastPipeCommunication\"),\n TEXT(\"0\"),\n szKey,\n SAL_N_ELEMENTS(szKey),\n szPerfTuneIniFile\n );\n\n if ( 0 == _tcscmp( szKey, TEXT(\"1\") ) )\n {\n HANDLE hProcessToken;\n\n if ( OpenProcessToken( GetCurrentProcess(), TOKEN_QUERY, &hProcessToken ) )\n {\n TCHAR szPipeName[4096];\n\n\n DWORD dwTokenLength = 0;\n\n\n fSuccess = GetTokenInformation( hProcessToken, TokenUser, NULL, dwTokenLength, &dwTokenLength );\n\n PVOID pTokenInfo = _alloca(dwTokenLength);\n fSuccess = GetTokenInformation( hProcessToken, TokenUser, pTokenInfo, dwTokenLength, &dwTokenLength );\n CloseHandle( hProcessToken );\n\n PSID pSid = ((PTOKEN_USER)pTokenInfo)->User.Sid;\n LPTSTR szUserIdent = NULL;\n TCHAR szSUPD[11] = TEXT(\"0\");\n\n fSuccess = ConvertSidToStringSid( pSid, &szUserIdent );\n\n _tcsncpy( szPipeName, PIPE_PREFIX, SAL_N_ELEMENTS(szPipeName) );\n _tcsncat( szPipeName, szUserIdent, SAL_N_ELEMENTS(szPipeName) - _tcslen(szPipeName) - 1 );\n _tcsncat( szPipeName, PIPE_POSTFIX, SAL_N_ELEMENTS(szPipeName) - _tcslen(szPipeName) - 1 );\n _tcsncat( szPipeName, _ultot( SUPD, szSUPD, 10), SAL_N_ELEMENTS(szPipeName) - _tcslen(szPipeName) - 1 );\n\n LocalFree( szUserIdent );\n\n HANDLE hPipe = CreateFile(\n szPipeName,\n GENERIC_READ|GENERIC_WRITE,\n FILE_SHARE_READ | FILE_SHARE_WRITE,\n NULL,\n OPEN_EXISTING,\n FILE_ATTRIBUTE_NORMAL,\n NULL);\n\n if ( INVALID_HANDLE_VALUE != hPipe )\n {\n DWORD dwBytesWritten;\n int argc = 0;\n LPWSTR *argv = CommandLineToArgvW( GetCommandLine(), &argc );\n\n fSuccess = WriteFile( hPipe, RTL_CONSTASCII_STRINGPARAM(\"InternalIPC::Arguments\"), &dwBytesWritten, NULL );\n if (fSuccess) {\n if (cwdLen > 0) {\n fSuccess = writeArgument(hPipe, '2', cwd);\n } else {\n fSuccess = WriteFile(\n hPipe, RTL_CONSTASCII_STRINGPARAM(\"0\"),\n &dwBytesWritten, NULL);\n }\n }\n for ( int argn = 1; fSuccess && argn < argc; argn++ )\n {\n fSuccess = writeArgument(hPipe, ',', argv[argn]);\n }\n\n if ( fSuccess )\n {\n fSuccess = WriteFile( hPipe, \"\", 1, &dwBytesWritten, NULL );\n if ( fSuccess )\n {\n DWORD dwBytesRead = 0;\n char *pBuffer = (char *)_alloca( sizeof(PIPE_TERMINATION_SEQUENCE) );\n fSuccess = ReadFile( hPipe, pBuffer, sizeof(PIPE_TERMINATION_SEQUENCE) - 1, &dwBytesRead, NULL );\n if ( fSuccess )\n {\n pBuffer[dwBytesRead] = 0;\n if ( 0 != strcmp( PIPE_TERMINATION_SEQUENCE, pBuffer ) )\n fSuccess = FALSE;\n }\n }\n }\n\n CloseHandle( hPipe );\n\n return fSuccess ? 0 : -1;\n }\n\n }\n }\n\n if ( bFirst ) {\n argv = GetCommandArgs(&argc);\n std::size_t n = wcslen(argv[0]) + 2;\n for (int i = 1; i < argc; ++i) {\n n += wcslen(argv[i]) + 3;\n }\n n += MY_LENGTH(L\" \\\"-env:OOO_CWD=2\") + 4 * cwdLen +\n MY_LENGTH(L\"\\\"\") + 1;\n \/\/ 4 * cwdLen: each char preceded by backslash, each trailing\n \/\/ backslash doubled\n lpCommandLine = new WCHAR[n];\n }\n WCHAR * p = desktop_win32::commandLineAppend(\n lpCommandLine, MY_STRING(L\"\\\"\"));\n p = desktop_win32::commandLineAppend(p, argv[0]);\n for (int i = 1; i < argc; ++i) {\n if (bFirst || ::desktop::ExitHelper::E_NORMAL_RESTART == dwExitCode || wcsncmp(argv[i], MY_STRING(L\"-env:\")) == 0) {\n p = desktop_win32::commandLineAppend(p, MY_STRING(L\"\\\" \\\"\"));\n p = desktop_win32::commandLineAppend(p, argv[i]);\n }\n }\n\n p = desktop_win32::commandLineAppend(\n p, MY_STRING(L\"\\\" \\\"-env:OOO_CWD=\"));\n if (cwdLen == 0) {\n p = desktop_win32::commandLineAppend(p, MY_STRING(L\"0\"));\n } else {\n p = desktop_win32::commandLineAppend(p, MY_STRING(L\"2\"));\n p = desktop_win32::commandLineAppendEncoded(p, cwd);\n }\n desktop_win32::commandLineAppend(p, MY_STRING(L\"\\\"\"));\n bFirst = false;\n\n TCHAR szParentProcessId[64]; \/\/ This is more than large enough for a 128 bit decimal value\n BOOL bHeadlessMode( FALSE );\n\n {\n \/\/ Check command line arguments for \"--headless\" parameter. We only\n \/\/ set the environment variable \"ATTACHED_PARENT_PROCESSID\" for the headless\n \/\/ mode as self-destruction of the soffice.bin process can lead to\n \/\/ certain side-effects (log-off can result in data-loss, \".lock\" is not deleted.\n \/\/ See 138244 for more information.\n int argc;\n LPTSTR *argv = GetCommandArgs( &argc );\n\n if ( argc > 1 )\n {\n int n;\n\n for ( n = 1; n < argc; n++ )\n {\n if ( 0 == _tcsnicmp( argv[n], _T(\"-headless\"), 9 ) ||\n 0 == _tcsnicmp( argv[n], _T(\"--headless\"), 9 ) )\n {\n bHeadlessMode = TRUE;\n }\n }\n }\n }\n\n if ( _ltot( (long)GetCurrentProcessId(),szParentProcessId, 10 ) && bHeadlessMode )\n SetEnvironmentVariable( TEXT(\"ATTACHED_PARENT_PROCESSID\"), szParentProcessId );\n\n PROCESS_INFORMATION aProcessInfo;\n\n fSuccess = CreateProcess(\n szTargetFileName,\n lpCommandLine,\n NULL,\n NULL,\n TRUE,\n 0,\n NULL,\n szIniDirectory,\n &aStartupInfo,\n &aProcessInfo );\n\n if ( fSuccess )\n {\n DWORD dwWaitResult;\n\n do\n {\n \/\/ On Windows XP it seems as the desktop calls WaitForInputIdle after \"OpenWidth\" so we have to do so\n \/\/ as if we where processing any messages\n\n dwWaitResult = MsgWaitForMultipleObjects( 1, &aProcessInfo.hProcess, FALSE, INFINITE, QS_ALLEVENTS );\n\n if ( WAIT_OBJECT_0 + 1 == dwWaitResult )\n {\n MSG msg;\n\n PeekMessage( &msg, NULL, 0, 0, PM_REMOVE );\n }\n } while ( WAIT_OBJECT_0 + 1 == dwWaitResult );\n\n dwExitCode = 0;\n GetExitCodeProcess( aProcessInfo.hProcess, &dwExitCode );\n\n CloseHandle( aProcessInfo.hProcess );\n CloseHandle( aProcessInfo.hThread );\n }\n } while ( false );\n delete[] lpCommandLine;\n\n return fSuccess ? dwExitCode : -1;\n}\n\n\/* vim:set shiftwidth=4 softtabstop=4 expandtab: *\/\n<commit_msg>WaE: hInstance arg unused under mingw32<commit_after>\/* -*- Mode: C++; tab-width: 4; indent-tabs-mode: nil; c-basic-offset: 4 -*- *\/\n\/*************************************************************************\n *\n * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.\n *\n * Copyright 2000, 2010 Oracle and\/or its affiliates.\n *\n * OpenOffice.org - a multi-platform office productivity suite\n *\n * This file is part of OpenOffice.org.\n *\n * OpenOffice.org is free software: you can redistribute it and\/or modify\n * it under the terms of the GNU Lesser General Public License version 3\n * only, as published by the Free Software Foundation.\n *\n * OpenOffice.org is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the\n * GNU Lesser General Public License version 3 for more details\n * (a copy is included in the LICENSE file that accompanied this code).\n *\n * You should have received a copy of the GNU Lesser General Public License\n * version 3 along with OpenOffice.org. If not, see\n * <http:\/\/www.openoffice.org\/license.html>\n * for a copy of the LGPLv3 License.\n *\n ************************************************************************\/\n\n#define UNICODE\n#define _UNICODE\n\n#include <cstddef>\n\n#define WIN32_LEAN_AND_MEAN\n#if defined _MSC_VER\n#pragma warning(push, 1)\n#endif\n#include <windows.h>\n#include <shellapi.h>\n#if defined _MSC_VER\n#pragma warning(pop)\n#endif\n\n#include <tchar.h>\n\n#include <malloc.h>\n#include <string.h>\n#include <stdlib.h>\n#include <systools\/win32\/uwinapi.h>\n\n#include \"rtl\/string.h\"\n#include <sal\/macros.h>\n\n#include \"..\/..\/..\/source\/inc\/exithelper.hxx\"\n#include \"..\/extendloaderenvironment.hxx\"\n\n#define PIPE_PREFIX TEXT(\"\\\\\\\\.\\\\pipe\\\\OSL_PIPE_\")\n#define PIPE_POSTFIX TEXT(\"_SingleOfficeIPC_\")\n#define PIPE_TERMINATION_SEQUENCE \"InternalIPC::ProcessingDone\"\n\nBOOL WINAPI ConvertSidToStringSid( PSID pSid, LPTSTR* StringSid )\n{\n PSID_IDENTIFIER_AUTHORITY psia;\n DWORD dwSubAuthorities;\n DWORD dwSidRev=SID_REVISION;\n DWORD dwCounter;\n DWORD dwSidSize;\n\n \/\/ Validate the binary SID.\n\n if(!IsValidSid(pSid)) return FALSE;\n\n \/\/ Get the identifier authority value from the SID.\n\n psia = GetSidIdentifierAuthority(pSid);\n\n \/\/ Get the number of subauthorities in the SID.\n\n dwSubAuthorities = *GetSidSubAuthorityCount(pSid);\n\n \/\/ Compute the buffer length.\n \/\/ S-SID_REVISION- + IdentifierAuthority- + subauthorities- + NULL\n\n dwSidSize=(15 + 12 + (12 * dwSubAuthorities) + 1) * sizeof(TCHAR);\n\n *StringSid = (LPTSTR)LocalAlloc( LMEM_FIXED, dwSidSize );\n\n \/\/ Add 'S' prefix and revision number to the string.\n\n dwSidSize=wsprintf(*StringSid, TEXT(\"S-%lu-\"), dwSidRev );\n\n \/\/ Add a SID identifier authority to the string.\n\n if ( (psia->Value[0] != 0) || (psia->Value[1] != 0) )\n {\n dwSidSize+=wsprintf(*StringSid + lstrlen(*StringSid),\n TEXT(\"0x%02hx%02hx%02hx%02hx%02hx%02hx\"),\n (USHORT)psia->Value[0],\n (USHORT)psia->Value[1],\n (USHORT)psia->Value[2],\n (USHORT)psia->Value[3],\n (USHORT)psia->Value[4],\n (USHORT)psia->Value[5]);\n }\n else\n {\n dwSidSize+=wsprintf(*StringSid + lstrlen(*StringSid),\n TEXT(\"%lu\"),\n (ULONG)(psia->Value[5] ) +\n (ULONG)(psia->Value[4] << 8) +\n (ULONG)(psia->Value[3] << 16) +\n (ULONG)(psia->Value[2] << 24) );\n }\n\n \/\/ Add SID subauthorities to the string.\n for (dwCounter=0 ; dwCounter < dwSubAuthorities ; dwCounter++)\n {\n dwSidSize+=wsprintf(*StringSid + dwSidSize, TEXT(\"-%lu\"),\n *GetSidSubAuthority(pSid, dwCounter) );\n }\n\n return TRUE;\n}\n\n\n\/\/---------------------------------------------------------------------------\n\nstatic LPTSTR *GetCommandArgs( int *pArgc )\n{\n#ifdef UNICODE\n return CommandLineToArgvW( GetCommandLineW(), pArgc );\n#else\n *pArgc = __argc;\n return __argv;\n#endif\n}\n\n\/\/---------------------------------------------------------------------------\n\nnamespace {\n\nbool writeArgument(HANDLE pipe, char prefix, WCHAR const * argument) {\n CHAR szBuffer[4096];\n int n = WideCharToMultiByte(\n CP_UTF8, 0, argument, -1, szBuffer, sizeof (szBuffer), NULL, NULL);\n char b[1 + 2 * ((sizeof szBuffer) - 1)]; \/\/ hopefully does not overflow\n b[0] = prefix;\n char * p = b + 1;\n for (int i = 0; i < n - 1; ++i) { \/\/ cannot underflow (n >= 0)\n char c = szBuffer[i];\n switch (c) {\n case '\\0':\n *p++ = '\\\\';\n *p++ = '0';\n break;\n case ',':\n *p++ = '\\\\';\n *p++ = ',';\n break;\n case '\\\\':\n *p++ = '\\\\';\n *p++ = '\\\\';\n break;\n default:\n *p++ = c;\n break;\n }\n }\n DWORD w;\n return WriteFile(pipe, b, p - b, &w, NULL);\n}\n\n}\n\n#ifdef __MINGW32__\nint WINAPI WinMain( HINSTANCE, HINSTANCE, LPSTR, int )\n#else\nint WINAPI _tWinMain( HINSTANCE, HINSTANCE, LPTSTR, int )\n#endif\n{\n TCHAR szTargetFileName[MAX_PATH] = TEXT(\"\");\n TCHAR szIniDirectory[MAX_PATH];\n TCHAR szPerfTuneIniFile[MAX_PATH] = TEXT(\"\");\n STARTUPINFO aStartupInfo;\n\n desktop_win32::extendLoaderEnvironment(szTargetFileName, szIniDirectory);\n\n ZeroMemory( &aStartupInfo, sizeof(aStartupInfo) );\n aStartupInfo.cb = sizeof(aStartupInfo);\n\n GetStartupInfo( &aStartupInfo );\n \/\/ Get image path with same name but with .bin extension\n\n TCHAR szModuleFileName[MAX_PATH];\n\n GetModuleFileName( NULL, szModuleFileName, MAX_PATH );\n _TCHAR *lpLastSlash = _tcsrchr( szModuleFileName, '\\\\' );\n if ( lpLastSlash )\n {\n size_t len = lpLastSlash - szModuleFileName + 1;\n _tcsncpy( szPerfTuneIniFile, szModuleFileName, len );\n _tcsncpy( szPerfTuneIniFile + len, _T(\"perftune.ini\"), SAL_N_ELEMENTS(szPerfTuneIniFile) - len );\n }\n\n \/\/ Create process with same command line, environment and stdio handles which\n \/\/ are directed to the created pipes\n\n DWORD dwExitCode = (DWORD)-1;\n\n BOOL fSuccess = FALSE;\n LPTSTR lpCommandLine = NULL;\n int argc = 0;\n LPTSTR * argv = NULL;\n bool bFirst = true;\n WCHAR cwd[MAX_PATH];\n DWORD cwdLen = GetCurrentDirectoryW(MAX_PATH, cwd);\n if (cwdLen >= MAX_PATH) {\n cwdLen = 0;\n }\n\n do\n {\n TCHAR szKey[32];\n\n GetPrivateProfileString(\n TEXT(\"PerformanceTuning\"),\n TEXT(\"FastPipeCommunication\"),\n TEXT(\"0\"),\n szKey,\n SAL_N_ELEMENTS(szKey),\n szPerfTuneIniFile\n );\n\n if ( 0 == _tcscmp( szKey, TEXT(\"1\") ) )\n {\n HANDLE hProcessToken;\n\n if ( OpenProcessToken( GetCurrentProcess(), TOKEN_QUERY, &hProcessToken ) )\n {\n TCHAR szPipeName[4096];\n\n\n DWORD dwTokenLength = 0;\n\n\n fSuccess = GetTokenInformation( hProcessToken, TokenUser, NULL, dwTokenLength, &dwTokenLength );\n\n PVOID pTokenInfo = _alloca(dwTokenLength);\n fSuccess = GetTokenInformation( hProcessToken, TokenUser, pTokenInfo, dwTokenLength, &dwTokenLength );\n CloseHandle( hProcessToken );\n\n PSID pSid = ((PTOKEN_USER)pTokenInfo)->User.Sid;\n LPTSTR szUserIdent = NULL;\n TCHAR szSUPD[11] = TEXT(\"0\");\n\n fSuccess = ConvertSidToStringSid( pSid, &szUserIdent );\n\n _tcsncpy( szPipeName, PIPE_PREFIX, SAL_N_ELEMENTS(szPipeName) );\n _tcsncat( szPipeName, szUserIdent, SAL_N_ELEMENTS(szPipeName) - _tcslen(szPipeName) - 1 );\n _tcsncat( szPipeName, PIPE_POSTFIX, SAL_N_ELEMENTS(szPipeName) - _tcslen(szPipeName) - 1 );\n _tcsncat( szPipeName, _ultot( SUPD, szSUPD, 10), SAL_N_ELEMENTS(szPipeName) - _tcslen(szPipeName) - 1 );\n\n LocalFree( szUserIdent );\n\n HANDLE hPipe = CreateFile(\n szPipeName,\n GENERIC_READ|GENERIC_WRITE,\n FILE_SHARE_READ | FILE_SHARE_WRITE,\n NULL,\n OPEN_EXISTING,\n FILE_ATTRIBUTE_NORMAL,\n NULL);\n\n if ( INVALID_HANDLE_VALUE != hPipe )\n {\n DWORD dwBytesWritten;\n int argc = 0;\n LPWSTR *argv = CommandLineToArgvW( GetCommandLine(), &argc );\n\n fSuccess = WriteFile( hPipe, RTL_CONSTASCII_STRINGPARAM(\"InternalIPC::Arguments\"), &dwBytesWritten, NULL );\n if (fSuccess) {\n if (cwdLen > 0) {\n fSuccess = writeArgument(hPipe, '2', cwd);\n } else {\n fSuccess = WriteFile(\n hPipe, RTL_CONSTASCII_STRINGPARAM(\"0\"),\n &dwBytesWritten, NULL);\n }\n }\n for ( int argn = 1; fSuccess && argn < argc; argn++ )\n {\n fSuccess = writeArgument(hPipe, ',', argv[argn]);\n }\n\n if ( fSuccess )\n {\n fSuccess = WriteFile( hPipe, \"\", 1, &dwBytesWritten, NULL );\n if ( fSuccess )\n {\n DWORD dwBytesRead = 0;\n char *pBuffer = (char *)_alloca( sizeof(PIPE_TERMINATION_SEQUENCE) );\n fSuccess = ReadFile( hPipe, pBuffer, sizeof(PIPE_TERMINATION_SEQUENCE) - 1, &dwBytesRead, NULL );\n if ( fSuccess )\n {\n pBuffer[dwBytesRead] = 0;\n if ( 0 != strcmp( PIPE_TERMINATION_SEQUENCE, pBuffer ) )\n fSuccess = FALSE;\n }\n }\n }\n\n CloseHandle( hPipe );\n\n return fSuccess ? 0 : -1;\n }\n\n }\n }\n\n if ( bFirst ) {\n argv = GetCommandArgs(&argc);\n std::size_t n = wcslen(argv[0]) + 2;\n for (int i = 1; i < argc; ++i) {\n n += wcslen(argv[i]) + 3;\n }\n n += MY_LENGTH(L\" \\\"-env:OOO_CWD=2\") + 4 * cwdLen +\n MY_LENGTH(L\"\\\"\") + 1;\n \/\/ 4 * cwdLen: each char preceded by backslash, each trailing\n \/\/ backslash doubled\n lpCommandLine = new WCHAR[n];\n }\n WCHAR * p = desktop_win32::commandLineAppend(\n lpCommandLine, MY_STRING(L\"\\\"\"));\n p = desktop_win32::commandLineAppend(p, argv[0]);\n for (int i = 1; i < argc; ++i) {\n if (bFirst || ::desktop::ExitHelper::E_NORMAL_RESTART == dwExitCode || wcsncmp(argv[i], MY_STRING(L\"-env:\")) == 0) {\n p = desktop_win32::commandLineAppend(p, MY_STRING(L\"\\\" \\\"\"));\n p = desktop_win32::commandLineAppend(p, argv[i]);\n }\n }\n\n p = desktop_win32::commandLineAppend(\n p, MY_STRING(L\"\\\" \\\"-env:OOO_CWD=\"));\n if (cwdLen == 0) {\n p = desktop_win32::commandLineAppend(p, MY_STRING(L\"0\"));\n } else {\n p = desktop_win32::commandLineAppend(p, MY_STRING(L\"2\"));\n p = desktop_win32::commandLineAppendEncoded(p, cwd);\n }\n desktop_win32::commandLineAppend(p, MY_STRING(L\"\\\"\"));\n bFirst = false;\n\n TCHAR szParentProcessId[64]; \/\/ This is more than large enough for a 128 bit decimal value\n BOOL bHeadlessMode( FALSE );\n\n {\n \/\/ Check command line arguments for \"--headless\" parameter. We only\n \/\/ set the environment variable \"ATTACHED_PARENT_PROCESSID\" for the headless\n \/\/ mode as self-destruction of the soffice.bin process can lead to\n \/\/ certain side-effects (log-off can result in data-loss, \".lock\" is not deleted.\n \/\/ See 138244 for more information.\n int argc;\n LPTSTR *argv = GetCommandArgs( &argc );\n\n if ( argc > 1 )\n {\n int n;\n\n for ( n = 1; n < argc; n++ )\n {\n if ( 0 == _tcsnicmp( argv[n], _T(\"-headless\"), 9 ) ||\n 0 == _tcsnicmp( argv[n], _T(\"--headless\"), 9 ) )\n {\n bHeadlessMode = TRUE;\n }\n }\n }\n }\n\n if ( _ltot( (long)GetCurrentProcessId(),szParentProcessId, 10 ) && bHeadlessMode )\n SetEnvironmentVariable( TEXT(\"ATTACHED_PARENT_PROCESSID\"), szParentProcessId );\n\n PROCESS_INFORMATION aProcessInfo;\n\n fSuccess = CreateProcess(\n szTargetFileName,\n lpCommandLine,\n NULL,\n NULL,\n TRUE,\n 0,\n NULL,\n szIniDirectory,\n &aStartupInfo,\n &aProcessInfo );\n\n if ( fSuccess )\n {\n DWORD dwWaitResult;\n\n do\n {\n \/\/ On Windows XP it seems as the desktop calls WaitForInputIdle after \"OpenWidth\" so we have to do so\n \/\/ as if we where processing any messages\n\n dwWaitResult = MsgWaitForMultipleObjects( 1, &aProcessInfo.hProcess, FALSE, INFINITE, QS_ALLEVENTS );\n\n if ( WAIT_OBJECT_0 + 1 == dwWaitResult )\n {\n MSG msg;\n\n PeekMessage( &msg, NULL, 0, 0, PM_REMOVE );\n }\n } while ( WAIT_OBJECT_0 + 1 == dwWaitResult );\n\n dwExitCode = 0;\n GetExitCodeProcess( aProcessInfo.hProcess, &dwExitCode );\n\n CloseHandle( aProcessInfo.hProcess );\n CloseHandle( aProcessInfo.hThread );\n }\n } while ( false );\n delete[] lpCommandLine;\n\n return fSuccess ? dwExitCode : -1;\n}\n\n\/* vim:set shiftwidth=4 softtabstop=4 expandtab: *\/\n<|endoftext|>"} {"text":"<commit_before>\/** \n * @file llnamelistctrl.cpp\n * @brief A list of names, automatically refreshed from name cache.\n *\n * $LicenseInfo:firstyear=2003&license=viewergpl$\n * \n * Copyright (c) 2003-2009, Linden Research, Inc.\n * \n * Second Life Viewer Source Code\n * The source code in this file (\"Source Code\") is provided by Linden Lab\n * to you under the terms of the GNU General Public License, version 2.0\n * (\"GPL\"), unless you have obtained a separate licensing agreement\n * (\"Other License\"), formally executed by you and Linden Lab. Terms of\n * the GPL can be found in doc\/GPL-license.txt in this distribution, or\n * online at http:\/\/secondlifegrid.net\/programs\/open_source\/licensing\/gplv2\n * \n * There are special exceptions to the terms and conditions of the GPL as\n * it is applied to this Source Code. View the full text of the exception\n * in the file doc\/FLOSS-exception.txt in this software distribution, or\n * online at\n * http:\/\/secondlifegrid.net\/programs\/open_source\/licensing\/flossexception\n * \n * By copying, modifying or distributing this software, you acknowledge\n * that you have read and understood your obligations described above,\n * and agree to abide by those obligations.\n * \n * ALL LINDEN LAB SOURCE CODE IS PROVIDED \"AS IS.\" LINDEN LAB MAKES NO\n * WARRANTIES, EXPRESS, IMPLIED OR OTHERWISE, REGARDING ITS ACCURACY,\n * COMPLETENESS OR PERFORMANCE.\n * $\/LicenseInfo$\n *\/\n\n#include \"llviewerprecompiledheaders.h\"\n\n#include \"llnamelistctrl.h\"\n\n#include <boost\/tokenizer.hpp>\n\n#include \"llcachename.h\"\n#include \"llfloaterreg.h\"\n#include \"llinventory.h\"\n#include \"llscrolllistitem.h\"\n#include \"llscrolllistcell.h\"\n#include \"llscrolllistcolumn.h\"\n#include \"llsdparam.h\"\n#include \"lltooltip.h\"\n\nstatic LLDefaultChildRegistry::Register<LLNameListCtrl> r(\"name_list\");\n\nvoid LLNameListCtrl::NameTypeNames::declareValues()\n{\n\tdeclare(\"INDIVIDUAL\", LLNameListCtrl::INDIVIDUAL);\n\tdeclare(\"GROUP\", LLNameListCtrl::GROUP);\n\tdeclare(\"SPECIAL\", LLNameListCtrl::SPECIAL);\n}\n\nLLNameListCtrl::Params::Params()\n:\tname_column(\"\"),\n\tallow_calling_card_drop(\"allow_calling_card_drop\", false)\n{\n\tname = \"name_list\";\n}\n\nLLNameListCtrl::LLNameListCtrl(const LLNameListCtrl::Params& p)\n:\tLLScrollListCtrl(p),\n\tmNameColumnIndex(p.name_column.column_index),\n\tmNameColumn(p.name_column.column_name),\n\tmAllowCallingCardDrop(p.allow_calling_card_drop)\n{}\n\n\/\/ public\nvoid LLNameListCtrl::addNameItem(const LLUUID& agent_id, EAddPosition pos,\n\t\t\t\t\t\t\t\t BOOL enabled, std::string& suffix)\n{\n\t\/\/llinfos << \"LLNameListCtrl::addNameItem \" << agent_id << llendl;\n\n\tNameItem item;\n\titem.value = agent_id;\n\titem.enabled = enabled;\n\titem.target = INDIVIDUAL;\n\n\taddNameItemRow(item, pos);\n}\n\n\/\/ virtual, public\nBOOL LLNameListCtrl::handleDragAndDrop( \n\t\tS32 x, S32 y, MASK mask,\n\t\tBOOL drop,\n\t\tEDragAndDropType cargo_type, void *cargo_data, \n\t\tEAcceptance *accept,\n\t\tstd::string& tooltip_msg)\n{\n\tif (!mAllowCallingCardDrop)\n\t{\n\t\treturn FALSE;\n\t}\n\n\tBOOL handled = FALSE;\n\n\tif (cargo_type == DAD_CALLINGCARD)\n\t{\n\t\tif (drop)\n\t\t{\n\t\t\tLLInventoryItem* item = (LLInventoryItem *)cargo_data;\n\t\t\taddNameItem(item->getCreatorUUID());\n\t\t}\n\n\t\t*accept = ACCEPT_YES_MULTI;\n\t}\n\telse\n\t{\n\t\t*accept = ACCEPT_NO;\n\t\tif (tooltip_msg.empty())\n\t\t{\n\t\t\tif (!getToolTip().empty())\n\t\t\t{\n\t\t\t\ttooltip_msg = getToolTip();\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\t\/\/ backwards compatable English tooltip (should be overridden in xml)\n\t\t\t\ttooltip_msg.assign(\"Drag a calling card here\\nto add a resident.\");\n\t\t\t}\n\t\t}\n\t}\n\n\thandled = TRUE;\n\tlldebugst(LLERR_USER_INPUT) << \"dragAndDrop handled by LLNameListCtrl \" << getName() << llendl;\n\n\treturn handled;\n}\n\nvoid LLNameListCtrl::showInspector(const LLUUID& avatar_id, bool is_group)\n{\n\tif (is_group)\n\t\tLLFloaterReg::showInstance(\"inspect_group\", LLSD().with(\"group_id\", avatar_id));\n\telse\n\t\tLLFloaterReg::showInstance(\"inspect_avatar\", LLSD().with(\"avatar_id\", avatar_id));\n}\n\n\/\/virtual\nBOOL LLNameListCtrl::handleToolTip(S32 x, S32 y, MASK mask)\n{\n\tBOOL handled = FALSE;\n\tS32 column_index = getColumnIndexFromOffset(x);\n\tLLScrollListItem* hit_item = hitItem(x, y);\n\tif (hit_item\n\t\t&& column_index == mNameColumnIndex)\n\t{\n\t\t\/\/ ...this is the column with the avatar name\n\t\tLLUUID avatar_id = hit_item->getUUID();\n\t\tif (avatar_id.notNull())\n\t\t{\n\t\t\t\/\/ ...valid avatar id\n\t\t\tLLScrollListCell* hit_cell = hit_item->getColumn(column_index);\n\t\t\tif (hit_cell)\n\t\t\t{\n\t\t\t\tS32 row_index = getItemIndex(hit_item);\n\t\t\t\tLLRect cell_rect = getCellRect(row_index, column_index);\n\t\t\t\t\/\/ Convert rect local to screen coordinates\n\t\t\t\tLLRect sticky_rect;\n\t\t\t\tlocalRectToScreen(cell_rect, &sticky_rect);\n\n\t\t\t\t\/\/ Spawn at right side of cell\n\t\t\t\tLLCoordGL pos( sticky_rect.mRight - 16, sticky_rect.mTop + (sticky_rect.getHeight()-16)\/2 );\n\t\t\t\tLLPointer<LLUIImage> icon = LLUI::getUIImage(\"Info_Small\");\n\n\t\t\t\t\/\/ Should we show a group or an avatar inspector?\n\t\t\t\tbool is_group = hit_item->getValue()[\"is_group\"].asBoolean();\n\n\t\t\t\tLLToolTip::Params params;\n\t\t\t\tparams.background_visible( false );\n\t\t\t\tparams.click_callback( boost::bind(&LLNameListCtrl::showInspector, this, avatar_id, is_group) );\n\t\t\t\tparams.delay_time(0.0f);\t\t\/\/ spawn instantly on hover\n\t\t\t\tparams.image( icon );\n\t\t\t\tparams.message(\"\");\n\t\t\t\tparams.padding(0);\n\t\t\t\tparams.pos(pos);\n\t\t\t\tparams.sticky_rect(sticky_rect);\n\n\t\t\t\tLLToolTipMgr::getInstance()->show(params);\n\t\t\t\thandled = TRUE;\n\t\t\t}\n\t\t}\n\t}\n\tif (!handled)\n\t{\n\t\thandled = LLScrollListCtrl::handleToolTip(x, y, mask);\n\t}\n\treturn handled;\n}\n\n\/\/ public\nvoid LLNameListCtrl::addGroupNameItem(const LLUUID& group_id, EAddPosition pos,\n\t\t\t\t\t\t\t\t\t BOOL enabled)\n{\n\tNameItem item;\n\titem.value = group_id;\n\titem.enabled = enabled;\n\titem.target = GROUP;\n\n\taddNameItemRow(item, pos);\n}\n\n\/\/ public\nvoid LLNameListCtrl::addGroupNameItem(LLNameListCtrl::NameItem& item, EAddPosition pos)\n{\n\titem.target = GROUP;\n\taddNameItemRow(item, pos);\n}\n\nvoid LLNameListCtrl::addNameItem(LLNameListCtrl::NameItem& item, EAddPosition pos)\n{\n\titem.target = INDIVIDUAL;\n\taddNameItemRow(item, pos);\n}\n\nLLScrollListItem* LLNameListCtrl::addElement(const LLSD& element, EAddPosition pos, void* userdata)\n{\n\tLLNameListCtrl::NameItem item_params;\n\tLLParamSDParser::instance().readSD(element, item_params);\n\titem_params.userdata = userdata;\n\treturn addNameItemRow(item_params, pos);\n}\n\n\nLLScrollListItem* LLNameListCtrl::addNameItemRow(\n\tconst LLNameListCtrl::NameItem& name_item,\n\tEAddPosition pos,\n\tstd::string& suffix)\n{\n\tLLUUID id = name_item.value().asUUID();\n\tLLNameListItem* item = NULL;\n\n\t\/\/ Store item type so that we can invoke the proper inspector.\n\t\/\/ *TODO Vadim: Is there a more proper way of storing additional item data?\n\t{\n\t\tLLNameListCtrl::NameItem item_p(name_item);\n\t\titem_p.value = LLSD().with(\"uuid\", id).with(\"is_group\", name_item.target() == GROUP);\n\t\titem = new LLNameListItem(item_p);\n\t\tLLScrollListCtrl::addRow(item, item_p, pos);\n\t}\n\n\tif (!item) return NULL;\n\n\t\/\/ use supplied name by default\n\tstd::string fullname = name_item.name;\n\tswitch(name_item.target)\n\t{\n\tcase GROUP:\n\t\tgCacheName->getGroupName(id, fullname);\n\t\t\/\/ fullname will be \"nobody\" if group not found\n\t\tbreak;\n\tcase SPECIAL:\n\t\t\/\/ just use supplied name\n\t\tbreak;\n\tcase INDIVIDUAL:\n\t\t{\n\t\t\tstd::string name;\n\t\t\tif (gCacheName->getFullName(id, name))\n\t\t\t{\n\t\t\t\tfullname = name;\n\t\t\t}\n\t\t\tbreak;\n\t\t}\n\tdefault:\n\t\tbreak;\n\t}\n\t\n\t\/\/ Append optional suffix.\n\tif (!suffix.empty())\n\t{\n\t\tfullname.append(suffix);\n\t}\n\n\tLLScrollListCell* cell = item->getColumn(mNameColumnIndex);\n\tif (cell)\n\t{\n\t\tcell->setValue(fullname);\n\t}\n\n\tdirtyColumns();\n\n\t\/\/ this column is resizable\n\tLLScrollListColumn* columnp = getColumn(mNameColumnIndex);\n\tif (columnp && columnp->mHeader)\n\t{\n\t\tcolumnp->mHeader->setHasResizableElement(TRUE);\n\t}\n\n\treturn item;\n}\n\n\/\/ public\nvoid LLNameListCtrl::removeNameItem(const LLUUID& agent_id)\n{\n\t\/\/ Find the item specified with agent_id.\n\tS32 idx = -1;\n\tfor (item_list::iterator it = getItemList().begin(); it != getItemList().end(); it++)\n\t{\n\t\tLLScrollListItem* item = *it;\n\t\tif (item->getUUID() == agent_id)\n\t\t{\n\t\t\tidx = getItemIndex(item);\n\t\t\tbreak;\n\t\t}\n\t}\n\n\t\/\/ Remove it.\n\tif (idx >= 0)\n\t{\n\t\tselectNthItem(idx); \/\/ not sure whether this is needed, taken from previous implementation\n\t\tdeleteSingleItem(idx);\n\t}\n}\n\n\/\/ public\nvoid LLNameListCtrl::refresh(const LLUUID& id, const std::string& first, \n\t\t\t\t\t\t\t const std::string& last, BOOL is_group)\n{\n\t\/\/llinfos << \"LLNameListCtrl::refresh \" << id << \" '\" << first << \" \"\n\t\/\/\t<< last << \"'\" << llendl;\n\n\tstd::string fullname;\n\tif (!is_group)\n\t{\n\t\tfullname = first + \" \" + last;\n\t}\n\telse\n\t{\n\t\tfullname = first;\n\t}\n\n\t\/\/ TODO: scan items for that ID, fix if necessary\n\titem_list::iterator iter;\n\tfor (iter = getItemList().begin(); iter != getItemList().end(); iter++)\n\t{\n\t\tLLScrollListItem* item = *iter;\n\t\tif (item->getUUID() == id)\n\t\t{\n\t\t\tLLScrollListCell* cell = (LLScrollListCell*)item->getColumn(0);\n\t\t\tcell = item->getColumn(mNameColumnIndex);\n\t\t\tif (cell)\n\t\t\t{\n\t\t\t\tcell->setValue(fullname);\n\t\t\t}\n\t\t}\n\t}\n\n\tdirtyColumns();\n}\n\n\n\/\/ static\nvoid LLNameListCtrl::refreshAll(const LLUUID& id, const std::string& first,\n\t\t\t\t\t\t\t\tconst std::string& last, BOOL is_group)\n{\n\tLLInstanceTracker<LLNameListCtrl>::instance_iter it;\n\tfor (it = beginInstances(); it != endInstances(); ++it)\n\t{\n\t\tLLNameListCtrl& ctrl = *it;\n\t\tctrl.refresh(id, first, last, is_group);\n\t}\n}\n\nvoid LLNameListCtrl::updateColumns()\n{\n\tLLScrollListCtrl::updateColumns();\n\n\tif (!mNameColumn.empty())\n\t{\n\t\tLLScrollListColumn* name_column = getColumn(mNameColumn);\n\t\tif (name_column)\n\t\t{\n\t\t\tmNameColumnIndex = name_column->mIndex;\n\t\t}\n\t}\n}\n<commit_msg>fix for normal EXT-3807 ABOUT LAND\/OBJECTS: (i) icon is badly positioned<commit_after>\/** \n * @file llnamelistctrl.cpp\n * @brief A list of names, automatically refreshed from name cache.\n *\n * $LicenseInfo:firstyear=2003&license=viewergpl$\n * \n * Copyright (c) 2003-2009, Linden Research, Inc.\n * \n * Second Life Viewer Source Code\n * The source code in this file (\"Source Code\") is provided by Linden Lab\n * to you under the terms of the GNU General Public License, version 2.0\n * (\"GPL\"), unless you have obtained a separate licensing agreement\n * (\"Other License\"), formally executed by you and Linden Lab. Terms of\n * the GPL can be found in doc\/GPL-license.txt in this distribution, or\n * online at http:\/\/secondlifegrid.net\/programs\/open_source\/licensing\/gplv2\n * \n * There are special exceptions to the terms and conditions of the GPL as\n * it is applied to this Source Code. View the full text of the exception\n * in the file doc\/FLOSS-exception.txt in this software distribution, or\n * online at\n * http:\/\/secondlifegrid.net\/programs\/open_source\/licensing\/flossexception\n * \n * By copying, modifying or distributing this software, you acknowledge\n * that you have read and understood your obligations described above,\n * and agree to abide by those obligations.\n * \n * ALL LINDEN LAB SOURCE CODE IS PROVIDED \"AS IS.\" LINDEN LAB MAKES NO\n * WARRANTIES, EXPRESS, IMPLIED OR OTHERWISE, REGARDING ITS ACCURACY,\n * COMPLETENESS OR PERFORMANCE.\n * $\/LicenseInfo$\n *\/\n\n#include \"llviewerprecompiledheaders.h\"\n\n#include \"llnamelistctrl.h\"\n\n#include <boost\/tokenizer.hpp>\n\n#include \"llcachename.h\"\n#include \"llfloaterreg.h\"\n#include \"llinventory.h\"\n#include \"llscrolllistitem.h\"\n#include \"llscrolllistcell.h\"\n#include \"llscrolllistcolumn.h\"\n#include \"llsdparam.h\"\n#include \"lltooltip.h\"\n\nstatic LLDefaultChildRegistry::Register<LLNameListCtrl> r(\"name_list\");\n\nvoid LLNameListCtrl::NameTypeNames::declareValues()\n{\n\tdeclare(\"INDIVIDUAL\", LLNameListCtrl::INDIVIDUAL);\n\tdeclare(\"GROUP\", LLNameListCtrl::GROUP);\n\tdeclare(\"SPECIAL\", LLNameListCtrl::SPECIAL);\n}\n\nLLNameListCtrl::Params::Params()\n:\tname_column(\"\"),\n\tallow_calling_card_drop(\"allow_calling_card_drop\", false)\n{\n\tname = \"name_list\";\n}\n\nLLNameListCtrl::LLNameListCtrl(const LLNameListCtrl::Params& p)\n:\tLLScrollListCtrl(p),\n\tmNameColumnIndex(p.name_column.column_index),\n\tmNameColumn(p.name_column.column_name),\n\tmAllowCallingCardDrop(p.allow_calling_card_drop)\n{}\n\n\/\/ public\nvoid LLNameListCtrl::addNameItem(const LLUUID& agent_id, EAddPosition pos,\n\t\t\t\t\t\t\t\t BOOL enabled, std::string& suffix)\n{\n\t\/\/llinfos << \"LLNameListCtrl::addNameItem \" << agent_id << llendl;\n\n\tNameItem item;\n\titem.value = agent_id;\n\titem.enabled = enabled;\n\titem.target = INDIVIDUAL;\n\n\taddNameItemRow(item, pos);\n}\n\n\/\/ virtual, public\nBOOL LLNameListCtrl::handleDragAndDrop( \n\t\tS32 x, S32 y, MASK mask,\n\t\tBOOL drop,\n\t\tEDragAndDropType cargo_type, void *cargo_data, \n\t\tEAcceptance *accept,\n\t\tstd::string& tooltip_msg)\n{\n\tif (!mAllowCallingCardDrop)\n\t{\n\t\treturn FALSE;\n\t}\n\n\tBOOL handled = FALSE;\n\n\tif (cargo_type == DAD_CALLINGCARD)\n\t{\n\t\tif (drop)\n\t\t{\n\t\t\tLLInventoryItem* item = (LLInventoryItem *)cargo_data;\n\t\t\taddNameItem(item->getCreatorUUID());\n\t\t}\n\n\t\t*accept = ACCEPT_YES_MULTI;\n\t}\n\telse\n\t{\n\t\t*accept = ACCEPT_NO;\n\t\tif (tooltip_msg.empty())\n\t\t{\n\t\t\tif (!getToolTip().empty())\n\t\t\t{\n\t\t\t\ttooltip_msg = getToolTip();\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\t\/\/ backwards compatable English tooltip (should be overridden in xml)\n\t\t\t\ttooltip_msg.assign(\"Drag a calling card here\\nto add a resident.\");\n\t\t\t}\n\t\t}\n\t}\n\n\thandled = TRUE;\n\tlldebugst(LLERR_USER_INPUT) << \"dragAndDrop handled by LLNameListCtrl \" << getName() << llendl;\n\n\treturn handled;\n}\n\nvoid LLNameListCtrl::showInspector(const LLUUID& avatar_id, bool is_group)\n{\n\tif (is_group)\n\t\tLLFloaterReg::showInstance(\"inspect_group\", LLSD().with(\"group_id\", avatar_id));\n\telse\n\t\tLLFloaterReg::showInstance(\"inspect_avatar\", LLSD().with(\"avatar_id\", avatar_id));\n}\n\n\/\/virtual\nBOOL LLNameListCtrl::handleToolTip(S32 x, S32 y, MASK mask)\n{\n\tBOOL handled = FALSE;\n\tS32 column_index = getColumnIndexFromOffset(x);\n\tLLScrollListItem* hit_item = hitItem(x, y);\n\tif (hit_item\n\t\t&& column_index == mNameColumnIndex)\n\t{\n\t\t\/\/ ...this is the column with the avatar name\n\t\tLLUUID avatar_id = hit_item->getUUID();\n\t\tif (avatar_id.notNull())\n\t\t{\n\t\t\t\/\/ ...valid avatar id\n\n\t\t\tLLScrollListCell* hit_cell = hit_item->getColumn(column_index);\n\t\t\tif (hit_cell)\n\t\t\t{\n\t\t\t\tS32 row_index = getItemIndex(hit_item);\n\t\t\t\tLLRect cell_rect = getCellRect(row_index, column_index);\n\t\t\t\t\/\/ Convert rect local to screen coordinates\n\t\t\t\tLLRect sticky_rect;\n\t\t\t\tlocalRectToScreen(cell_rect, &sticky_rect);\n\n\t\t\t\t\/\/ Spawn at right side of cell\n\t\t\t\tLLPointer<LLUIImage> icon = LLUI::getUIImage(\"Info_Small\");\n\t\t\t\tLLCoordGL pos( sticky_rect.mRight - 16, sticky_rect.mTop - (sticky_rect.getHeight() - icon->getHeight())\/2 );\n\n\t\t\t\t\/\/ Should we show a group or an avatar inspector?\n\t\t\t\tbool is_group = hit_item->getValue()[\"is_group\"].asBoolean();\n\n\t\t\t\tLLToolTip::Params params;\n\t\t\t\tparams.background_visible( false );\n\t\t\t\tparams.click_callback( boost::bind(&LLNameListCtrl::showInspector, this, avatar_id, is_group) );\n\t\t\t\tparams.delay_time(0.0f);\t\t\/\/ spawn instantly on hover\n\t\t\t\tparams.image( icon );\n\t\t\t\tparams.message(\"\");\n\t\t\t\tparams.padding(0);\n\t\t\t\tparams.pos(pos);\n\t\t\t\tparams.sticky_rect(sticky_rect);\n\n\t\t\t\tLLToolTipMgr::getInstance()->show(params);\n\t\t\t\thandled = TRUE;\n\t\t\t}\n\t\t}\n\t}\n\tif (!handled)\n\t{\n\t\thandled = LLScrollListCtrl::handleToolTip(x, y, mask);\n\t}\n\treturn handled;\n}\n\n\/\/ public\nvoid LLNameListCtrl::addGroupNameItem(const LLUUID& group_id, EAddPosition pos,\n\t\t\t\t\t\t\t\t\t BOOL enabled)\n{\n\tNameItem item;\n\titem.value = group_id;\n\titem.enabled = enabled;\n\titem.target = GROUP;\n\n\taddNameItemRow(item, pos);\n}\n\n\/\/ public\nvoid LLNameListCtrl::addGroupNameItem(LLNameListCtrl::NameItem& item, EAddPosition pos)\n{\n\titem.target = GROUP;\n\taddNameItemRow(item, pos);\n}\n\nvoid LLNameListCtrl::addNameItem(LLNameListCtrl::NameItem& item, EAddPosition pos)\n{\n\titem.target = INDIVIDUAL;\n\taddNameItemRow(item, pos);\n}\n\nLLScrollListItem* LLNameListCtrl::addElement(const LLSD& element, EAddPosition pos, void* userdata)\n{\n\tLLNameListCtrl::NameItem item_params;\n\tLLParamSDParser::instance().readSD(element, item_params);\n\titem_params.userdata = userdata;\n\treturn addNameItemRow(item_params, pos);\n}\n\n\nLLScrollListItem* LLNameListCtrl::addNameItemRow(\n\tconst LLNameListCtrl::NameItem& name_item,\n\tEAddPosition pos,\n\tstd::string& suffix)\n{\n\tLLUUID id = name_item.value().asUUID();\n\tLLNameListItem* item = NULL;\n\n\t\/\/ Store item type so that we can invoke the proper inspector.\n\t\/\/ *TODO Vadim: Is there a more proper way of storing additional item data?\n\t{\n\t\tLLNameListCtrl::NameItem item_p(name_item);\n\t\titem_p.value = LLSD().with(\"uuid\", id).with(\"is_group\", name_item.target() == GROUP);\n\t\titem = new LLNameListItem(item_p);\n\t\tLLScrollListCtrl::addRow(item, item_p, pos);\n\t}\n\n\tif (!item) return NULL;\n\n\t\/\/ use supplied name by default\n\tstd::string fullname = name_item.name;\n\tswitch(name_item.target)\n\t{\n\tcase GROUP:\n\t\tgCacheName->getGroupName(id, fullname);\n\t\t\/\/ fullname will be \"nobody\" if group not found\n\t\tbreak;\n\tcase SPECIAL:\n\t\t\/\/ just use supplied name\n\t\tbreak;\n\tcase INDIVIDUAL:\n\t\t{\n\t\t\tstd::string name;\n\t\t\tif (gCacheName->getFullName(id, name))\n\t\t\t{\n\t\t\t\tfullname = name;\n\t\t\t}\n\t\t\tbreak;\n\t\t}\n\tdefault:\n\t\tbreak;\n\t}\n\t\n\t\/\/ Append optional suffix.\n\tif (!suffix.empty())\n\t{\n\t\tfullname.append(suffix);\n\t}\n\n\tLLScrollListCell* cell = item->getColumn(mNameColumnIndex);\n\tif (cell)\n\t{\n\t\tcell->setValue(fullname);\n\t}\n\n\tdirtyColumns();\n\n\t\/\/ this column is resizable\n\tLLScrollListColumn* columnp = getColumn(mNameColumnIndex);\n\tif (columnp && columnp->mHeader)\n\t{\n\t\tcolumnp->mHeader->setHasResizableElement(TRUE);\n\t}\n\n\treturn item;\n}\n\n\/\/ public\nvoid LLNameListCtrl::removeNameItem(const LLUUID& agent_id)\n{\n\t\/\/ Find the item specified with agent_id.\n\tS32 idx = -1;\n\tfor (item_list::iterator it = getItemList().begin(); it != getItemList().end(); it++)\n\t{\n\t\tLLScrollListItem* item = *it;\n\t\tif (item->getUUID() == agent_id)\n\t\t{\n\t\t\tidx = getItemIndex(item);\n\t\t\tbreak;\n\t\t}\n\t}\n\n\t\/\/ Remove it.\n\tif (idx >= 0)\n\t{\n\t\tselectNthItem(idx); \/\/ not sure whether this is needed, taken from previous implementation\n\t\tdeleteSingleItem(idx);\n\t}\n}\n\n\/\/ public\nvoid LLNameListCtrl::refresh(const LLUUID& id, const std::string& first, \n\t\t\t\t\t\t\t const std::string& last, BOOL is_group)\n{\n\t\/\/llinfos << \"LLNameListCtrl::refresh \" << id << \" '\" << first << \" \"\n\t\/\/\t<< last << \"'\" << llendl;\n\n\tstd::string fullname;\n\tif (!is_group)\n\t{\n\t\tfullname = first + \" \" + last;\n\t}\n\telse\n\t{\n\t\tfullname = first;\n\t}\n\n\t\/\/ TODO: scan items for that ID, fix if necessary\n\titem_list::iterator iter;\n\tfor (iter = getItemList().begin(); iter != getItemList().end(); iter++)\n\t{\n\t\tLLScrollListItem* item = *iter;\n\t\tif (item->getUUID() == id)\n\t\t{\n\t\t\tLLScrollListCell* cell = (LLScrollListCell*)item->getColumn(0);\n\t\t\tcell = item->getColumn(mNameColumnIndex);\n\t\t\tif (cell)\n\t\t\t{\n\t\t\t\tcell->setValue(fullname);\n\t\t\t}\n\t\t}\n\t}\n\n\tdirtyColumns();\n}\n\n\n\/\/ static\nvoid LLNameListCtrl::refreshAll(const LLUUID& id, const std::string& first,\n\t\t\t\t\t\t\t\tconst std::string& last, BOOL is_group)\n{\n\tLLInstanceTracker<LLNameListCtrl>::instance_iter it;\n\tfor (it = beginInstances(); it != endInstances(); ++it)\n\t{\n\t\tLLNameListCtrl& ctrl = *it;\n\t\tctrl.refresh(id, first, last, is_group);\n\t}\n}\n\nvoid LLNameListCtrl::updateColumns()\n{\n\tLLScrollListCtrl::updateColumns();\n\n\tif (!mNameColumn.empty())\n\t{\n\t\tLLScrollListColumn* name_column = getColumn(mNameColumn);\n\t\tif (name_column)\n\t\t{\n\t\t\tmNameColumnIndex = name_column->mIndex;\n\t\t}\n\t}\n}\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\/framework\/op_gen_lib.h\"\n\n#include <vector>\n#include \"tensorflow\/core\/lib\/core\/errors.h\"\n#include \"tensorflow\/core\/lib\/strings\/str_util.h\"\n#include \"tensorflow\/core\/lib\/strings\/strcat.h\"\n\nnamespace tensorflow {\n\nstring WordWrap(StringPiece prefix, StringPiece str, int width) {\n const string indent_next_line = \"\\n\" + Spaces(prefix.size());\n width -= prefix.size();\n string result;\n strings::StrAppend(&result, prefix);\n\n while (!str.empty()) {\n if (static_cast<int>(str.size()) <= width) {\n \/\/ Remaining text fits on one line.\n strings::StrAppend(&result, str);\n break;\n }\n auto space = str.rfind(' ', width);\n if (space == StringPiece::npos) {\n \/\/ Rather make a too-long line and break at a space.\n space = str.find(' ');\n if (space == StringPiece::npos) {\n strings::StrAppend(&result, str);\n break;\n }\n }\n \/\/ Breaking at character at position <space>.\n StringPiece to_append = str.substr(0, space);\n str.remove_prefix(space + 1);\n \/\/ Remove spaces at break.\n while (to_append.ends_with(\" \")) {\n to_append.remove_suffix(1);\n }\n while (str.Consume(\" \")) {\n }\n\n \/\/ Go on to the next line.\n strings::StrAppend(&result, to_append);\n if (!str.empty()) strings::StrAppend(&result, indent_next_line);\n }\n\n return result;\n}\n\nbool ConsumeEquals(StringPiece* description) {\n if (description->Consume(\"=\")) {\n while (description->Consume(\" \")) { \/\/ Also remove spaces after \"=\".\n }\n return true;\n }\n return false;\n}\n\nStatus OpGenOverrideMap::LoadFileList(Env* env, const string& filenames) {\n std::vector<string> v = str_util::Split(filenames, \",\");\n for (const string& f : v) {\n TF_RETURN_IF_ERROR(LoadFile(env, f));\n }\n return Status::OK();\n}\n\nStatus OpGenOverrideMap::LoadFile(Env* env, const string& filename) {\n if (filename.empty()) return Status::OK();\n string contents;\n TF_RETURN_IF_ERROR(ReadFileToString(env, filename, &contents));\n OpGenOverrides all;\n protobuf::TextFormat::ParseFromString(contents, &all);\n for (const auto& one : all.op()) {\n map_[one.name()] = one;\n }\n return Status::OK();\n}\n\nstatic void StringReplace(const string& from, const string& to, string* s) {\n std::vector<string> rest = str_util::Split(*s, from);\n *s = str_util::Join(rest, to.c_str());\n}\n\nstatic void RenameInDocs(const string& from, const string& to, OpDef* op_def) {\n const string from_quoted = strings::StrCat(\"`\", from, \"`\");\n const string to_quoted = strings::StrCat(\"`\", to, \"`\");\n for (int i = 0; i < op_def->input_arg_size(); ++i) {\n if (!op_def->input_arg(i).description().empty()) {\n StringReplace(from_quoted, to_quoted,\n op_def->mutable_input_arg(i)->mutable_description());\n }\n }\n for (int i = 0; i < op_def->output_arg_size(); ++i) {\n if (!op_def->output_arg(i).description().empty()) {\n StringReplace(from_quoted, to_quoted,\n op_def->mutable_output_arg(i)->mutable_description());\n }\n }\n for (int i = 0; i < op_def->attr_size(); ++i) {\n if (!op_def->attr(i).description().empty()) {\n StringReplace(from_quoted, to_quoted,\n op_def->mutable_attr(i)->mutable_description());\n }\n }\n if (!op_def->summary().empty()) {\n StringReplace(from_quoted, to_quoted, op_def->mutable_summary());\n }\n if (!op_def->description().empty()) {\n StringReplace(from_quoted, to_quoted, op_def->mutable_summary());\n }\n}\n\nconst OpGenOverride* OpGenOverrideMap::ApplyOverride(OpDef* op_def) const {\n \/\/ Look up\n const auto iter = map_.find(op_def->name());\n if (iter == map_.end()) return nullptr;\n const OpGenOverride& proto = iter->second;\n\n \/\/ Apply overrides from `proto`.\n if (!proto.rename_to().empty()) {\n op_def->set_name(proto.rename_to());\n RenameInDocs(proto.name(), proto.rename_to(), op_def);\n }\n for (const auto& attr_default : proto.attr_default()) {\n bool found = false;\n for (int i = 0; i < op_def->attr_size(); ++i) {\n if (op_def->attr(i).name() == attr_default.name()) {\n *op_def->mutable_attr(i)->mutable_default_value() =\n attr_default.value();\n found = true;\n break;\n }\n }\n if (!found) {\n LOG(WARNING) << proto.name() << \" can't find attr \" << attr_default.name()\n << \" to override default\";\n }\n }\n for (const auto& attr_rename : proto.attr_rename()) {\n bool found = false;\n for (int i = 0; i < op_def->attr_size(); ++i) {\n if (op_def->attr(i).name() == attr_rename.from()) {\n *op_def->mutable_attr(i)->mutable_name() = attr_rename.to();\n found = true;\n break;\n }\n }\n if (found) {\n RenameInDocs(attr_rename.from(), attr_rename.to(), op_def);\n } else {\n LOG(WARNING) << proto.name() << \" can't find attr \" << attr_rename.from()\n << \" to rename\";\n }\n }\n for (const auto& input_rename : proto.input_rename()) {\n bool found = false;\n for (int i = 0; i < op_def->input_arg_size(); ++i) {\n if (op_def->input_arg(i).name() == input_rename.from()) {\n *op_def->mutable_input_arg(i)->mutable_name() = input_rename.to();\n found = true;\n break;\n }\n }\n if (found) {\n RenameInDocs(input_rename.from(), input_rename.to(), op_def);\n } else {\n LOG(WARNING) << proto.name() << \" can't find input \"\n << input_rename.from() << \" to rename\";\n }\n }\n for (const auto& output_rename : proto.output_rename()) {\n bool found = false;\n for (int i = 0; i < op_def->output_arg_size(); ++i) {\n if (op_def->output_arg(i).name() == output_rename.from()) {\n *op_def->mutable_output_arg(i)->mutable_name() = output_rename.to();\n found = true;\n break;\n }\n }\n if (found) {\n RenameInDocs(output_rename.from(), output_rename.to(), op_def);\n } else {\n LOG(WARNING) << proto.name() << \" can't find output \"\n << output_rename.from() << \" to rename\";\n }\n }\n\n return &proto;\n}\n\n} \/\/ namespace tensorflow\n<commit_msg>Fix bug with doc updates for ops with renames in the C++ API. Change: 146301808<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\/framework\/op_gen_lib.h\"\n\n#include <vector>\n#include \"tensorflow\/core\/lib\/core\/errors.h\"\n#include \"tensorflow\/core\/lib\/strings\/str_util.h\"\n#include \"tensorflow\/core\/lib\/strings\/strcat.h\"\n\nnamespace tensorflow {\n\nstring WordWrap(StringPiece prefix, StringPiece str, int width) {\n const string indent_next_line = \"\\n\" + Spaces(prefix.size());\n width -= prefix.size();\n string result;\n strings::StrAppend(&result, prefix);\n\n while (!str.empty()) {\n if (static_cast<int>(str.size()) <= width) {\n \/\/ Remaining text fits on one line.\n strings::StrAppend(&result, str);\n break;\n }\n auto space = str.rfind(' ', width);\n if (space == StringPiece::npos) {\n \/\/ Rather make a too-long line and break at a space.\n space = str.find(' ');\n if (space == StringPiece::npos) {\n strings::StrAppend(&result, str);\n break;\n }\n }\n \/\/ Breaking at character at position <space>.\n StringPiece to_append = str.substr(0, space);\n str.remove_prefix(space + 1);\n \/\/ Remove spaces at break.\n while (to_append.ends_with(\" \")) {\n to_append.remove_suffix(1);\n }\n while (str.Consume(\" \")) {\n }\n\n \/\/ Go on to the next line.\n strings::StrAppend(&result, to_append);\n if (!str.empty()) strings::StrAppend(&result, indent_next_line);\n }\n\n return result;\n}\n\nbool ConsumeEquals(StringPiece* description) {\n if (description->Consume(\"=\")) {\n while (description->Consume(\" \")) { \/\/ Also remove spaces after \"=\".\n }\n return true;\n }\n return false;\n}\n\nStatus OpGenOverrideMap::LoadFileList(Env* env, const string& filenames) {\n std::vector<string> v = str_util::Split(filenames, \",\");\n for (const string& f : v) {\n TF_RETURN_IF_ERROR(LoadFile(env, f));\n }\n return Status::OK();\n}\n\nStatus OpGenOverrideMap::LoadFile(Env* env, const string& filename) {\n if (filename.empty()) return Status::OK();\n string contents;\n TF_RETURN_IF_ERROR(ReadFileToString(env, filename, &contents));\n OpGenOverrides all;\n protobuf::TextFormat::ParseFromString(contents, &all);\n for (const auto& one : all.op()) {\n map_[one.name()] = one;\n }\n return Status::OK();\n}\n\nstatic void StringReplace(const string& from, const string& to, string* s) {\n \/\/ Split *s into pieces delimited by `from`.\n std::vector<string> split;\n string::size_type pos = 0;\n while (pos < s->size()) {\n auto found = s->find(from, pos);\n if (found == string::npos) {\n split.push_back(s->substr(pos));\n break;\n } else {\n split.push_back(s->substr(pos, found - pos));\n pos = found + from.size();\n }\n }\n \/\/ Join the pieces back together with a new delimiter.\n *s = str_util::Join(split, to.c_str());\n}\n\nstatic void RenameInDocs(const string& from, const string& to, OpDef* op_def) {\n const string from_quoted = strings::StrCat(\"`\", from, \"`\");\n const string to_quoted = strings::StrCat(\"`\", to, \"`\");\n for (int i = 0; i < op_def->input_arg_size(); ++i) {\n if (!op_def->input_arg(i).description().empty()) {\n StringReplace(from_quoted, to_quoted,\n op_def->mutable_input_arg(i)->mutable_description());\n }\n }\n for (int i = 0; i < op_def->output_arg_size(); ++i) {\n if (!op_def->output_arg(i).description().empty()) {\n StringReplace(from_quoted, to_quoted,\n op_def->mutable_output_arg(i)->mutable_description());\n }\n }\n for (int i = 0; i < op_def->attr_size(); ++i) {\n if (!op_def->attr(i).description().empty()) {\n StringReplace(from_quoted, to_quoted,\n op_def->mutable_attr(i)->mutable_description());\n }\n }\n if (!op_def->summary().empty()) {\n StringReplace(from_quoted, to_quoted, op_def->mutable_summary());\n }\n if (!op_def->description().empty()) {\n StringReplace(from_quoted, to_quoted, op_def->mutable_description());\n }\n}\n\nconst OpGenOverride* OpGenOverrideMap::ApplyOverride(OpDef* op_def) const {\n \/\/ Look up\n const auto iter = map_.find(op_def->name());\n if (iter == map_.end()) return nullptr;\n const OpGenOverride& proto = iter->second;\n\n \/\/ Apply overrides from `proto`.\n if (!proto.rename_to().empty()) {\n op_def->set_name(proto.rename_to());\n RenameInDocs(proto.name(), proto.rename_to(), op_def);\n }\n for (const auto& attr_default : proto.attr_default()) {\n bool found = false;\n for (int i = 0; i < op_def->attr_size(); ++i) {\n if (op_def->attr(i).name() == attr_default.name()) {\n *op_def->mutable_attr(i)->mutable_default_value() =\n attr_default.value();\n found = true;\n break;\n }\n }\n if (!found) {\n LOG(WARNING) << proto.name() << \" can't find attr \" << attr_default.name()\n << \" to override default\";\n }\n }\n for (const auto& attr_rename : proto.attr_rename()) {\n bool found = false;\n for (int i = 0; i < op_def->attr_size(); ++i) {\n if (op_def->attr(i).name() == attr_rename.from()) {\n *op_def->mutable_attr(i)->mutable_name() = attr_rename.to();\n found = true;\n break;\n }\n }\n if (found) {\n RenameInDocs(attr_rename.from(), attr_rename.to(), op_def);\n } else {\n LOG(WARNING) << proto.name() << \" can't find attr \" << attr_rename.from()\n << \" to rename\";\n }\n }\n for (const auto& input_rename : proto.input_rename()) {\n bool found = false;\n for (int i = 0; i < op_def->input_arg_size(); ++i) {\n if (op_def->input_arg(i).name() == input_rename.from()) {\n *op_def->mutable_input_arg(i)->mutable_name() = input_rename.to();\n found = true;\n break;\n }\n }\n if (found) {\n RenameInDocs(input_rename.from(), input_rename.to(), op_def);\n } else {\n LOG(WARNING) << proto.name() << \" can't find input \"\n << input_rename.from() << \" to rename\";\n }\n }\n for (const auto& output_rename : proto.output_rename()) {\n bool found = false;\n for (int i = 0; i < op_def->output_arg_size(); ++i) {\n if (op_def->output_arg(i).name() == output_rename.from()) {\n *op_def->mutable_output_arg(i)->mutable_name() = output_rename.to();\n found = true;\n break;\n }\n }\n if (found) {\n RenameInDocs(output_rename.from(), output_rename.to(), op_def);\n } else {\n LOG(WARNING) << proto.name() << \" can't find output \"\n << output_rename.from() << \" to rename\";\n }\n }\n\n return &proto;\n}\n\n} \/\/ namespace tensorflow\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 <dirent.h>\n#include <errno.h>\n#include <fcntl.h>\n#include <fnmatch.h>\n#include <stdio.h>\n#include <stdlib.h>\n#include <sys\/mman.h>\n#include <sys\/stat.h>\n#include <sys\/time.h>\n#include <sys\/types.h>\n#include <time.h>\n#include <unistd.h>\n\n#ifdef __FreeBSD__\n#include <pthread_np.h>\n#endif\n\n#include <thread>\n#include <vector>\n\n#include \"tensorflow\/core\/platform\/default\/posix_file_system.h\"\n#include \"tensorflow\/core\/platform\/env.h\"\n#include \"tensorflow\/core\/platform\/load_library.h\"\n#include \"tensorflow\/core\/platform\/logging.h\"\n#include \"tensorflow\/core\/platform\/mutex.h\"\n#include \"tensorflow\/core\/platform\/ram_file_system.h\"\n#include \"tensorflow\/core\/protobuf\/error_codes.pb.h\"\n\nnamespace tensorflow {\n\nnamespace {\n\nmutex name_mutex(tensorflow::LINKER_INITIALIZED);\n\nstd::map<std::thread::id, string>& GetThreadNameRegistry()\n TF_EXCLUSIVE_LOCKS_REQUIRED(name_mutex) {\n static auto* thread_name_registry = new std::map<std::thread::id, string>();\n return *thread_name_registry;\n}\n\nclass StdThread : public Thread {\n public:\n \/\/ thread_options is ignored.\n StdThread(const ThreadOptions& thread_options, const string& name,\n std::function<void()> fn)\n : thread_(fn) {\n mutex_lock l(name_mutex);\n GetThreadNameRegistry().emplace(thread_.get_id(), name);\n }\n\n ~StdThread() override {\n std::thread::id thread_id = thread_.get_id();\n thread_.join();\n mutex_lock l(name_mutex);\n GetThreadNameRegistry().erase(thread_id);\n }\n\n private:\n std::thread thread_;\n};\n\nclass PosixEnv : public Env {\n public:\n PosixEnv() {}\n\n ~PosixEnv() override { LOG(FATAL) << \"Env::Default() must not be destroyed\"; }\n\n bool MatchPath(const string& path, const string& pattern) override {\n return fnmatch(pattern.c_str(), path.c_str(), FNM_PATHNAME) == 0;\n }\n\n void SleepForMicroseconds(int64 micros) override {\n while (micros > 0) {\n timespec sleep_time;\n sleep_time.tv_sec = 0;\n sleep_time.tv_nsec = 0;\n\n if (micros >= 1e6) {\n sleep_time.tv_sec =\n std::min<int64>(micros \/ 1e6, std::numeric_limits<time_t>::max());\n micros -= static_cast<int64>(sleep_time.tv_sec) * 1e6;\n }\n if (micros < 1e6) {\n sleep_time.tv_nsec = 1000 * micros;\n micros = 0;\n }\n while (nanosleep(&sleep_time, &sleep_time) != 0 && errno == EINTR) {\n \/\/ Ignore signals and wait for the full interval to elapse.\n }\n }\n }\n\n Thread* StartThread(const ThreadOptions& thread_options, const string& name,\n std::function<void()> fn) override {\n return new StdThread(thread_options, name, fn);\n }\n\n int32 GetCurrentThreadId() override {\n#ifdef __APPLE__\n uint64_t tid64;\n pthread_threadid_np(nullptr, &tid64);\n return static_cast<int32>(tid64);\n#elif defined(__FreeBSD__)\n return pthread_getthreadid_np();\n#else\n return static_cast<int32>(pthread_self());\n#endif\n }\n\n bool GetCurrentThreadName(string* name) override {\n {\n mutex_lock l(name_mutex);\n auto thread_name =\n GetThreadNameRegistry().find(std::this_thread::get_id());\n if (thread_name != GetThreadNameRegistry().end()) {\n *name = thread_name->second;\n return true;\n }\n }\n#if defined(__ANDROID__) || defined(__EMSCRIPTEN__)\n return false;\n#else\n char buf[100];\n#ifdef __FreeBSD__\n int res = 0;\n pthread_get_name_np(pthread_self(), buf, static_cast<size_t>(100));\n#else\n int res = pthread_getname_np(pthread_self(), buf, static_cast<size_t>(100));\n#endif\n if (res != 0) {\n return false;\n }\n *name = buf;\n return true;\n#endif\n }\n\n void SchedClosure(std::function<void()> closure) override {\n \/\/ TODO(b\/27290852): Spawning a new thread here is wasteful, but\n \/\/ needed to deal with the fact that many `closure` functions are\n \/\/ blocking in the current codebase.\n std::thread closure_thread(closure);\n closure_thread.detach();\n }\n\n void SchedClosureAfter(int64 micros, std::function<void()> closure) override {\n \/\/ TODO(b\/27290852): Consuming a thread here is wasteful, but this\n \/\/ code is (currently) only used in the case where a step fails\n \/\/ (AbortStep). This could be replaced by a timer thread\n SchedClosure([this, micros, closure]() {\n SleepForMicroseconds(micros);\n closure();\n });\n }\n\n Status LoadLibrary(const char* library_filename, void** handle) override {\n return tensorflow::internal::LoadLibrary(library_filename, handle);\n }\n\n Status GetSymbolFromLibrary(void* handle, const char* symbol_name,\n void** symbol) override {\n return tensorflow::internal::GetSymbolFromLibrary(handle, symbol_name,\n symbol);\n }\n\n string FormatLibraryFileName(const string& name,\n const string& version) override {\n return tensorflow::internal::FormatLibraryFileName(name, version);\n }\n\n string GetRunfilesDir() override {\n string bin_path = this->GetExecutablePath();\n string runfiles_suffix = \".runfiles\/org_tensorflow\";\n std::size_t pos = bin_path.find(runfiles_suffix);\n\n \/\/ Sometimes (when executing under python) bin_path returns the full path to\n \/\/ the python scripts under runfiles. Get the substring.\n if (pos != std::string::npos) {\n return bin_path.substr(0, pos + runfiles_suffix.length());\n }\n\n \/\/ See if we have the executable path. if executable.runfiles exists, return\n \/\/ that folder.\n string runfiles_path = bin_path + runfiles_suffix;\n Status s = this->IsDirectory(runfiles_path);\n if (s.ok()) {\n return runfiles_path;\n }\n\n \/\/ If nothing can be found, return something close.\n return bin_path.substr(0, bin_path.find_last_of(\"\/\\\\\"));\n }\n\n private:\n void GetLocalTempDirectories(std::vector<string>* list) override;\n};\n\n} \/\/ namespace\n\n#if defined(PLATFORM_POSIX) || defined(__APPLE__) || defined(__ANDROID__)\nREGISTER_FILE_SYSTEM(\"\", PosixFileSystem);\nREGISTER_FILE_SYSTEM(\"file\", LocalPosixFileSystem);\nREGISTER_FILE_SYSTEM(\"ram\", RamFileSystem);\n\nEnv* Env::Default() {\n static Env* default_env = new PosixEnv;\n return default_env;\n}\n#endif\n\nvoid PosixEnv::GetLocalTempDirectories(std::vector<string>* list) {\n list->clear();\n \/\/ Directories, in order of preference. If we find a dir that\n \/\/ exists, we stop adding other less-preferred dirs\n const char* candidates[] = {\n \/\/ Non-null only during unittest\/regtest\n getenv(\"TEST_TMPDIR\"),\n\n \/\/ Explicitly-supplied temp dirs\n getenv(\"TMPDIR\"),\n getenv(\"TMP\"),\n\n#if defined(__ANDROID__)\n \"\/data\/local\/tmp\",\n#endif\n\n \/\/ If all else fails\n \"\/tmp\",\n };\n\n for (const char* d : candidates) {\n if (!d || d[0] == '\\0') continue; \/\/ Empty env var\n\n \/\/ Make sure we don't surprise anyone who's expecting a '\/'\n string dstr = d;\n if (dstr[dstr.size() - 1] != '\/') {\n dstr += \"\/\";\n }\n\n struct stat statbuf;\n if (!stat(d, &statbuf) && S_ISDIR(statbuf.st_mode) &&\n !access(dstr.c_str(), 0)) {\n \/\/ We found a dir that exists and is accessible - we're done.\n list->push_back(dstr);\n return;\n }\n }\n}\n\nint setenv(const char* name, const char* value, int overwrite) {\n return ::setenv(name, value, overwrite);\n}\n\nint unsetenv(const char* name) { return ::unsetenv(name); }\n\n} \/\/ namespace tensorflow\n<commit_msg>Switch tensorflow::Env() to use pthread_create() to start threads instead of std::thread.<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 <dirent.h>\n#include <errno.h>\n#include <fcntl.h>\n#include <fnmatch.h>\n#include <stdio.h>\n#include <stdlib.h>\n#include <sys\/mman.h>\n#include <sys\/stat.h>\n#include <sys\/time.h>\n#include <sys\/types.h>\n#include <time.h>\n#include <unistd.h>\n\n#ifdef __FreeBSD__\n#include <pthread_np.h>\n#endif\n\n#include <thread>\n#include <vector>\n\n#include \"tensorflow\/core\/platform\/default\/posix_file_system.h\"\n#include \"tensorflow\/core\/platform\/env.h\"\n#include \"tensorflow\/core\/platform\/load_library.h\"\n#include \"tensorflow\/core\/platform\/logging.h\"\n#include \"tensorflow\/core\/platform\/mutex.h\"\n#include \"tensorflow\/core\/platform\/ram_file_system.h\"\n#include \"tensorflow\/core\/protobuf\/error_codes.pb.h\"\n\nnamespace tensorflow {\n\nnamespace {\n\nmutex name_mutex(tensorflow::LINKER_INITIALIZED);\n\nstd::map<std::thread::id, string>& GetThreadNameRegistry()\n TF_EXCLUSIVE_LOCKS_REQUIRED(name_mutex) {\n static auto* thread_name_registry = new std::map<std::thread::id, string>();\n return *thread_name_registry;\n}\n\n\/\/ We use the pthread API instead of std::thread so we can control stack sizes.\nclass PThread : public Thread {\n public:\n PThread(const ThreadOptions& thread_options, const std::string& name,\n std::function<void()> fn) {\n ThreadParams* params = new ThreadParams;\n params->name = name;\n params->fn = std::move(fn);\n pthread_attr_t attributes;\n pthread_attr_init(&attributes);\n if (thread_options.stack_size != 0) {\n pthread_attr_setstacksize(&attributes, thread_options.stack_size);\n }\n int ret = pthread_create(&thread_, &attributes, &ThreadFn, params);\n \/\/ There is no mechanism for the thread creation API to fail, so we CHECK.\n CHECK_EQ(ret, 0) << \"Thread creation via pthread_create() failed.\";\n pthread_attr_destroy(&attributes);\n }\n\n ~PThread() override { pthread_join(thread_, nullptr); }\n\n private:\n struct ThreadParams {\n std::string name;\n std::function<void()> fn;\n };\n static void* ThreadFn(void* params_arg) {\n std::unique_ptr<ThreadParams> params(\n reinterpret_cast<ThreadParams*>(params_arg));\n {\n mutex_lock l(name_mutex);\n GetThreadNameRegistry().emplace(std::this_thread::get_id(), params->name);\n }\n params->fn();\n {\n mutex_lock l(name_mutex);\n GetThreadNameRegistry().erase(std::this_thread::get_id());\n }\n return nullptr;\n }\n\n pthread_t thread_;\n};\n\nclass PosixEnv : public Env {\n public:\n PosixEnv() {}\n\n ~PosixEnv() override { LOG(FATAL) << \"Env::Default() must not be destroyed\"; }\n\n bool MatchPath(const string& path, const string& pattern) override {\n return fnmatch(pattern.c_str(), path.c_str(), FNM_PATHNAME) == 0;\n }\n\n void SleepForMicroseconds(int64 micros) override {\n while (micros > 0) {\n timespec sleep_time;\n sleep_time.tv_sec = 0;\n sleep_time.tv_nsec = 0;\n\n if (micros >= 1e6) {\n sleep_time.tv_sec =\n std::min<int64>(micros \/ 1e6, std::numeric_limits<time_t>::max());\n micros -= static_cast<int64>(sleep_time.tv_sec) * 1e6;\n }\n if (micros < 1e6) {\n sleep_time.tv_nsec = 1000 * micros;\n micros = 0;\n }\n while (nanosleep(&sleep_time, &sleep_time) != 0 && errno == EINTR) {\n \/\/ Ignore signals and wait for the full interval to elapse.\n }\n }\n }\n\n Thread* StartThread(const ThreadOptions& thread_options, const string& name,\n std::function<void()> fn) override {\n return new PThread(thread_options, name, fn);\n }\n\n int32 GetCurrentThreadId() override {\n#ifdef __APPLE__\n uint64_t tid64;\n pthread_threadid_np(nullptr, &tid64);\n return static_cast<int32>(tid64);\n#elif defined(__FreeBSD__)\n return pthread_getthreadid_np();\n#else\n return static_cast<int32>(pthread_self());\n#endif\n }\n\n bool GetCurrentThreadName(string* name) override {\n {\n mutex_lock l(name_mutex);\n auto thread_name =\n GetThreadNameRegistry().find(std::this_thread::get_id());\n if (thread_name != GetThreadNameRegistry().end()) {\n *name = thread_name->second;\n return true;\n }\n }\n#if defined(__ANDROID__) || defined(__EMSCRIPTEN__)\n return false;\n#else\n char buf[100];\n#ifdef __FreeBSD__\n int res = 0;\n pthread_get_name_np(pthread_self(), buf, static_cast<size_t>(100));\n#else\n int res = pthread_getname_np(pthread_self(), buf, static_cast<size_t>(100));\n#endif\n if (res != 0) {\n return false;\n }\n *name = buf;\n return true;\n#endif\n }\n\n void SchedClosure(std::function<void()> closure) override {\n \/\/ TODO(b\/27290852): Spawning a new thread here is wasteful, but\n \/\/ needed to deal with the fact that many `closure` functions are\n \/\/ blocking in the current codebase.\n std::thread closure_thread(closure);\n closure_thread.detach();\n }\n\n void SchedClosureAfter(int64 micros, std::function<void()> closure) override {\n \/\/ TODO(b\/27290852): Consuming a thread here is wasteful, but this\n \/\/ code is (currently) only used in the case where a step fails\n \/\/ (AbortStep). This could be replaced by a timer thread\n SchedClosure([this, micros, closure]() {\n SleepForMicroseconds(micros);\n closure();\n });\n }\n\n Status LoadLibrary(const char* library_filename, void** handle) override {\n return tensorflow::internal::LoadLibrary(library_filename, handle);\n }\n\n Status GetSymbolFromLibrary(void* handle, const char* symbol_name,\n void** symbol) override {\n return tensorflow::internal::GetSymbolFromLibrary(handle, symbol_name,\n symbol);\n }\n\n string FormatLibraryFileName(const string& name,\n const string& version) override {\n return tensorflow::internal::FormatLibraryFileName(name, version);\n }\n\n string GetRunfilesDir() override {\n string bin_path = this->GetExecutablePath();\n string runfiles_suffix = \".runfiles\/org_tensorflow\";\n std::size_t pos = bin_path.find(runfiles_suffix);\n\n \/\/ Sometimes (when executing under python) bin_path returns the full path to\n \/\/ the python scripts under runfiles. Get the substring.\n if (pos != std::string::npos) {\n return bin_path.substr(0, pos + runfiles_suffix.length());\n }\n\n \/\/ See if we have the executable path. if executable.runfiles exists, return\n \/\/ that folder.\n string runfiles_path = bin_path + runfiles_suffix;\n Status s = this->IsDirectory(runfiles_path);\n if (s.ok()) {\n return runfiles_path;\n }\n\n \/\/ If nothing can be found, return something close.\n return bin_path.substr(0, bin_path.find_last_of(\"\/\\\\\"));\n }\n\n private:\n void GetLocalTempDirectories(std::vector<string>* list) override;\n};\n\n} \/\/ namespace\n\n#if defined(PLATFORM_POSIX) || defined(__APPLE__) || defined(__ANDROID__)\nREGISTER_FILE_SYSTEM(\"\", PosixFileSystem);\nREGISTER_FILE_SYSTEM(\"file\", LocalPosixFileSystem);\nREGISTER_FILE_SYSTEM(\"ram\", RamFileSystem);\n\nEnv* Env::Default() {\n static Env* default_env = new PosixEnv;\n return default_env;\n}\n#endif\n\nvoid PosixEnv::GetLocalTempDirectories(std::vector<string>* list) {\n list->clear();\n \/\/ Directories, in order of preference. If we find a dir that\n \/\/ exists, we stop adding other less-preferred dirs\n const char* candidates[] = {\n \/\/ Non-null only during unittest\/regtest\n getenv(\"TEST_TMPDIR\"),\n\n \/\/ Explicitly-supplied temp dirs\n getenv(\"TMPDIR\"),\n getenv(\"TMP\"),\n\n#if defined(__ANDROID__)\n \"\/data\/local\/tmp\",\n#endif\n\n \/\/ If all else fails\n \"\/tmp\",\n };\n\n for (const char* d : candidates) {\n if (!d || d[0] == '\\0') continue; \/\/ Empty env var\n\n \/\/ Make sure we don't surprise anyone who's expecting a '\/'\n string dstr = d;\n if (dstr[dstr.size() - 1] != '\/') {\n dstr += \"\/\";\n }\n\n struct stat statbuf;\n if (!stat(d, &statbuf) && S_ISDIR(statbuf.st_mode) &&\n !access(dstr.c_str(), 0)) {\n \/\/ We found a dir that exists and is accessible - we're done.\n list->push_back(dstr);\n return;\n }\n }\n}\n\nint setenv(const char* name, const char* value, int overwrite) {\n return ::setenv(name, value, overwrite);\n}\n\nint unsetenv(const char* name) { return ::unsetenv(name); }\n\n} \/\/ namespace tensorflow\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 \"attribute_writer_factory.h\"\n#include \"emptysearchview.h\"\n#include \"fast_access_doc_subdb.h\"\n#include \"fast_access_document_retriever.h\"\n#include \"document_subdb_initializer.h\"\n#include \"reconfig_params.h\"\n#include \"i_document_subdb_owner.h\"\n#include <vespa\/searchcore\/proton\/attribute\/attribute_collection_spec_factory.h>\n#include <vespa\/searchcore\/proton\/attribute\/attribute_factory.h>\n#include <vespa\/searchcore\/proton\/attribute\/attribute_manager_initializer.h>\n#include <vespa\/searchcore\/proton\/attribute\/filter_attribute_manager.h>\n#include <vespa\/searchcore\/proton\/attribute\/sequential_attributes_initializer.h>\n#include <vespa\/searchcore\/proton\/common\/alloc_config.h>\n#include <vespa\/searchcore\/proton\/matching\/sessionmanager.h>\n#include <vespa\/searchcore\/proton\/reprocessing\/attribute_reprocessing_initializer.h>\n#include <vespa\/searchcore\/proton\/reprocessing\/reprocess_documents_task.h>\n#include <vespa\/searchlib\/docstore\/document_store_visitor_progress.h>\n#include <vespa\/log\/log.h>\nLOG_SETUP(\".proton.server.fast_access_doc_subdb\");\n\nusing proton::matching::SessionManager;\nusing search::AttributeGuard;\nusing search::AttributeVector;\nusing search::SerialNum;\nusing search::index::Schema;\nusing proton::initializer::InitializerTask;\nusing searchcorespi::IFlushTarget;\n\nnamespace proton {\n\nnamespace {\n\nstruct AttributeGuardComp\n{\n vespalib::string name;\n\n AttributeGuardComp(const vespalib::string &n)\n : name(n)\n { }\n\n bool operator()(const AttributeGuard &rhs) const {\n return name == rhs->getName();\n };\n};\n\nproton::IAttributeManager::SP\nextractAttributeManager(const FastAccessFeedView::SP &feedView)\n{\n const IAttributeWriter::SP &writer = feedView->getAttributeWriter();\n return writer->getAttributeManager();\n}\n\n}\n\nInitializerTask::SP\nFastAccessDocSubDB::createAttributeManagerInitializer(const DocumentDBConfig &configSnapshot,\n SerialNum configSerialNum,\n InitializerTask::SP documentMetaStoreInitTask,\n DocumentMetaStore::SP documentMetaStore,\n std::shared_ptr<AttributeManager::SP> attrMgrResult) const\n{\n AllocStrategy alloc_strategy = configSnapshot.get_alloc_config().make_alloc_strategy(_subDbType);\n IAttributeFactory::SP attrFactory = std::make_shared<AttributeFactory>();\n AttributeManager::SP baseAttrMgr =\n std::make_shared<AttributeManager>(_baseDir + \"\/attribute\",\n getSubDbName(),\n configSnapshot.getTuneFileDocumentDBSP()->_attr,\n _fileHeaderContext,\n _writeService.attributeFieldWriter(),\n _writeService.shared(),\n attrFactory,\n _hwInfo);\n return std::make_shared<AttributeManagerInitializer>(configSerialNum,\n documentMetaStoreInitTask,\n documentMetaStore,\n baseAttrMgr,\n (_hasAttributes ? configSnapshot.getAttributesConfig() : AttributesConfig()),\n alloc_strategy,\n _fastAccessAttributesOnly,\n _writeService.master(),\n attrMgrResult);\n}\n\nvoid\nFastAccessDocSubDB::setupAttributeManager(AttributeManager::SP attrMgrResult)\n{\n if (_addMetrics) {\n \/\/ register attribute metrics\n std::vector<AttributeGuard> list;\n attrMgrResult->getAttributeListAll(list);\n for (const auto &attr : list) {\n const AttributeVector &v = *attr;\n _metricsWireService.addAttribute(_subAttributeMetrics, v.getName());\n }\n }\n _initAttrMgr = attrMgrResult;\n}\n\n\nAttributeCollectionSpec::UP\nFastAccessDocSubDB::createAttributeSpec(const AttributesConfig &attrCfg, const AllocStrategy& alloc_strategy, SerialNum serialNum) const\n{\n uint32_t docIdLimit(_dms->getCommittedDocIdLimit());\n AttributeCollectionSpecFactory factory(alloc_strategy, _fastAccessAttributesOnly);\n return factory.create(attrCfg, docIdLimit, serialNum);\n}\n\nvoid\nFastAccessDocSubDB::initFeedView(IAttributeWriter::SP writer, const DocumentDBConfig &configSnapshot)\n{\n \/\/ Called by executor thread\n auto feedView = std::make_shared<FastAccessFeedView>(\n getStoreOnlyFeedViewContext(configSnapshot),\n getFeedViewPersistentParams(),\n FastAccessFeedView::Context(std::move(writer), _docIdLimit));\n\n _fastAccessFeedView.set(feedView);\n _iFeedView.set(_fastAccessFeedView.get());\n}\n\nAttributeManager::SP\nFastAccessDocSubDB::getAndResetInitAttributeManager()\n{\n AttributeManager::SP retval = _initAttrMgr;\n _initAttrMgr.reset();\n return retval;\n}\n\nIFlushTarget::List\nFastAccessDocSubDB::getFlushTargetsInternal()\n{\n IFlushTarget::List retval(Parent::getFlushTargetsInternal());\n IFlushTarget::List tmp(getAttributeManager()->getFlushTargets());\n retval.insert(retval.end(), tmp.begin(), tmp.end());\n return retval;\n}\n\nvoid\nFastAccessDocSubDB::pruneRemovedFields(SerialNum serialNum)\n{\n getAttributeManager()->pruneRemovedFields(serialNum);\n}\n\nvoid\nFastAccessDocSubDB::reconfigureAttributeMetrics(const proton::IAttributeManager &newMgr,\n const proton::IAttributeManager &oldMgr)\n{\n std::set<vespalib::string> toAdd;\n std::set<vespalib::string> toRemove;\n std::vector<AttributeGuard> newList;\n std::vector<AttributeGuard> oldList;\n newMgr.getAttributeList(newList);\n oldMgr.getAttributeList(oldList);\n for (const auto &newAttr : newList) {\n if (std::find_if(oldList.begin(),\n oldList.end(),\n AttributeGuardComp(newAttr->getName())) ==\n oldList.end()) {\n toAdd.insert(newAttr->getName());\n }\n }\n for (const auto &oldAttr : oldList) {\n if (std::find_if(newList.begin(),\n newList.end(),\n AttributeGuardComp(oldAttr->getName())) ==\n newList.end()) {\n toRemove.insert(oldAttr->getName());\n }\n }\n for (const auto &attrName : toAdd) {\n LOG(debug, \"reconfigureAttributeMetrics(): addAttribute='%s'\", attrName.c_str());\n _metricsWireService.addAttribute(_subAttributeMetrics, attrName);\n }\n for (const auto &attrName : toRemove) {\n LOG(debug, \"reconfigureAttributeMetrics(): removeAttribute='%s'\", attrName.c_str());\n _metricsWireService.removeAttribute(_subAttributeMetrics, attrName);\n }\n}\n\nIReprocessingTask::UP\nFastAccessDocSubDB::createReprocessingTask(IReprocessingInitializer &initializer,\n const std::shared_ptr<const document::DocumentTypeRepo> &docTypeRepo) const\n{\n uint32_t docIdLimit = _metaStoreCtx->get().getCommittedDocIdLimit();\n assert(docIdLimit > 0);\n return std::make_unique<ReprocessDocumentsTask>(initializer, getSummaryManager(), docTypeRepo,\n getSubDbName(), docIdLimit);\n}\n\nFastAccessDocSubDB::FastAccessDocSubDB(const Config &cfg, const Context &ctx)\n : Parent(cfg._storeOnlyCfg, ctx._storeOnlyCtx),\n _hasAttributes(cfg._hasAttributes),\n _fastAccessAttributesOnly(cfg._fastAccessAttributesOnly),\n _initAttrMgr(),\n _fastAccessFeedView(),\n _subAttributeMetrics(ctx._subAttributeMetrics),\n _addMetrics(cfg._addMetrics),\n _metricsWireService(ctx._metricsWireService),\n _docIdLimit(0)\n{ }\n\nFastAccessDocSubDB::~FastAccessDocSubDB() = default;\n\nDocumentSubDbInitializer::UP\nFastAccessDocSubDB::createInitializer(const DocumentDBConfig &configSnapshot, SerialNum configSerialNum,\n const IndexConfig &indexCfg) const\n{\n auto result = Parent::createInitializer(configSnapshot, configSerialNum, indexCfg);\n auto attrMgrInitTask = createAttributeManagerInitializer(configSnapshot, configSerialNum,\n result->getDocumentMetaStoreInitTask(),\n result->result().documentMetaStore()->documentMetaStore(),\n result->writableResult().writableAttributeManager());\n result->addDependency(attrMgrInitTask);\n return result;\n}\n\nvoid\nFastAccessDocSubDB::setup(const DocumentSubDbInitializerResult &initResult)\n{\n Parent::setup(initResult);\n setupAttributeManager(initResult.attributeManager());\n _docIdLimit.set(_dms->getCommittedDocIdLimit());\n}\n\nvoid\nFastAccessDocSubDB::initViews(const DocumentDBConfig &configSnapshot,\n const SessionManager::SP &sessionManager)\n{\n \/\/ Called by executor thread\n (void) sessionManager;\n _iSearchView.set(std::make_shared<EmptySearchView>());\n auto writer = std::make_shared<AttributeWriter>(getAndResetInitAttributeManager());\n {\n std::lock_guard<std::mutex> guard(_configMutex);\n initFeedView(std::move(writer), configSnapshot);\n }\n}\n\nIReprocessingTask::List\nFastAccessDocSubDB::applyConfig(const DocumentDBConfig &newConfigSnapshot, const DocumentDBConfig &oldConfigSnapshot,\n SerialNum serialNum, const ReconfigParams ¶ms, IDocumentDBReferenceResolver &resolver)\n{\n (void) resolver;\n\n AllocStrategy alloc_strategy = newConfigSnapshot.get_alloc_config().make_alloc_strategy(_subDbType);\n reconfigure(newConfigSnapshot.getStoreConfig(), alloc_strategy);\n IReprocessingTask::List tasks;\n \/*\n * If attribute manager should change then document retriever\n * might have to rewrite a different set of fields. If document\n * type repo has changed then the new repo is needed to handle\n * documents using new fields, e.g. when moving documents from notready\n * to ready document sub db.\n *\/\n if (params.shouldAttributeManagerChange() ||\n params.shouldAttributeWriterChange() ||\n newConfigSnapshot.getDocumentTypeRepoSP().get() != oldConfigSnapshot.getDocumentTypeRepoSP().get()) {\n FastAccessDocSubDBConfigurer configurer(_fastAccessFeedView,\n std::make_unique<AttributeWriterFactory>(), getSubDbName());\n proton::IAttributeManager::SP oldMgr = extractAttributeManager(_fastAccessFeedView.get());\n AttributeCollectionSpec::UP attrSpec =\n createAttributeSpec(newConfigSnapshot.getAttributesConfig(), alloc_strategy, serialNum);\n IReprocessingInitializer::UP initializer =\n configurer.reconfigure(newConfigSnapshot, oldConfigSnapshot, *attrSpec);\n if (initializer->hasReprocessors()) {\n tasks.push_back(IReprocessingTask::SP(createReprocessingTask(*initializer,\n newConfigSnapshot.getDocumentTypeRepoSP()).release()));\n }\n if (_addMetrics) {\n proton::IAttributeManager::SP newMgr = extractAttributeManager(_fastAccessFeedView.get());\n reconfigureAttributeMetrics(*newMgr, *oldMgr);\n }\n _iFeedView.set(_fastAccessFeedView.get());\n if (isNodeRetired()) {\n reconfigureAttributesConsideringNodeState();\n }\n }\n return tasks;\n}\n\nproton::IAttributeManager::SP\nFastAccessDocSubDB::getAttributeManager() const\n{\n return extractAttributeManager(_fastAccessFeedView.get());\n}\n\nIDocumentRetriever::UP\nFastAccessDocSubDB::getDocumentRetriever()\n{\n FastAccessFeedView::SP feedView = _fastAccessFeedView.get();\n proton::IAttributeManager::SP attrMgr = extractAttributeManager(feedView);\n return std::make_unique<FastAccessDocumentRetriever>(feedView, attrMgr);\n}\n\nvoid\nFastAccessDocSubDB::onReplayDone()\n{\n \/\/ Called by document db executor thread\n Parent::onReplayDone();\n \/\/ Normalize attribute vector sizes\n uint32_t docIdLimit = _metaStoreCtx->get().getCommittedDocIdLimit();\n assert(docIdLimit > 0);\n _docIdLimit.set(docIdLimit);\n IFeedView::SP feedView = _iFeedView.get();\n IAttributeWriter::SP attrWriter = static_cast<FastAccessFeedView &>(*feedView).getAttributeWriter();\n attrWriter->onReplayDone(docIdLimit);\n}\n\n\nvoid\nFastAccessDocSubDB::onReprocessDone(SerialNum serialNum)\n{\n IFeedView::SP feedView = _iFeedView.get();\n IAttributeWriter::SP attrWriter = static_cast<FastAccessFeedView &>(*feedView).getAttributeWriter();\n attrWriter->forceCommit(serialNum, std::shared_ptr<vespalib::IDestructorCallback>());\n _writeService.attributeFieldWriter().sync_all();\n _writeService.summary().sync();\n Parent::onReprocessDone(serialNum);\n}\n\n\nSerialNum\nFastAccessDocSubDB::getOldestFlushedSerial()\n{\n SerialNum lowest(Parent::getOldestFlushedSerial());\n proton::IAttributeManager::SP attrMgr(getAttributeManager());\n lowest = std::min(lowest, attrMgr->getOldestFlushedSerialNumber());\n return lowest;\n}\n\nSerialNum\nFastAccessDocSubDB::getNewestFlushedSerial()\n{\n SerialNum highest(Parent::getNewestFlushedSerial());\n proton::IAttributeManager::SP attrMgr(getAttributeManager());\n highest = std::max(highest, attrMgr->getNewestFlushedSerialNumber());\n return highest;\n}\n\n} \/\/ namespace proton\n<commit_msg>Avoid sync_all<commit_after>\/\/ Copyright Yahoo. Licensed under the terms of the Apache 2.0 license. See LICENSE in the project root.\n\n#include \"attribute_writer_factory.h\"\n#include \"emptysearchview.h\"\n#include \"fast_access_doc_subdb.h\"\n#include \"fast_access_document_retriever.h\"\n#include \"document_subdb_initializer.h\"\n#include \"reconfig_params.h\"\n#include \"i_document_subdb_owner.h\"\n#include <vespa\/searchcore\/proton\/attribute\/attribute_collection_spec_factory.h>\n#include <vespa\/searchcore\/proton\/attribute\/attribute_factory.h>\n#include <vespa\/searchcore\/proton\/attribute\/attribute_manager_initializer.h>\n#include <vespa\/searchcore\/proton\/attribute\/filter_attribute_manager.h>\n#include <vespa\/searchcore\/proton\/attribute\/sequential_attributes_initializer.h>\n#include <vespa\/searchcore\/proton\/common\/alloc_config.h>\n#include <vespa\/searchcore\/proton\/matching\/sessionmanager.h>\n#include <vespa\/searchcore\/proton\/reprocessing\/attribute_reprocessing_initializer.h>\n#include <vespa\/searchcore\/proton\/reprocessing\/reprocess_documents_task.h>\n#include <vespa\/searchlib\/docstore\/document_store_visitor_progress.h>\n#include <vespa\/vespalib\/util\/destructor_callbacks.h>\n\n#include <vespa\/log\/log.h>\nLOG_SETUP(\".proton.server.fast_access_doc_subdb\");\n\nusing proton::matching::SessionManager;\nusing search::AttributeGuard;\nusing search::AttributeVector;\nusing search::SerialNum;\nusing search::index::Schema;\nusing proton::initializer::InitializerTask;\nusing searchcorespi::IFlushTarget;\n\nnamespace proton {\n\nnamespace {\n\nstruct AttributeGuardComp\n{\n vespalib::string name;\n\n AttributeGuardComp(const vespalib::string &n)\n : name(n)\n { }\n\n bool operator()(const AttributeGuard &rhs) const {\n return name == rhs->getName();\n };\n};\n\nproton::IAttributeManager::SP\nextractAttributeManager(const FastAccessFeedView::SP &feedView)\n{\n const IAttributeWriter::SP &writer = feedView->getAttributeWriter();\n return writer->getAttributeManager();\n}\n\n}\n\nInitializerTask::SP\nFastAccessDocSubDB::createAttributeManagerInitializer(const DocumentDBConfig &configSnapshot,\n SerialNum configSerialNum,\n InitializerTask::SP documentMetaStoreInitTask,\n DocumentMetaStore::SP documentMetaStore,\n std::shared_ptr<AttributeManager::SP> attrMgrResult) const\n{\n AllocStrategy alloc_strategy = configSnapshot.get_alloc_config().make_alloc_strategy(_subDbType);\n IAttributeFactory::SP attrFactory = std::make_shared<AttributeFactory>();\n AttributeManager::SP baseAttrMgr =\n std::make_shared<AttributeManager>(_baseDir + \"\/attribute\",\n getSubDbName(),\n configSnapshot.getTuneFileDocumentDBSP()->_attr,\n _fileHeaderContext,\n _writeService.attributeFieldWriter(),\n _writeService.shared(),\n attrFactory,\n _hwInfo);\n return std::make_shared<AttributeManagerInitializer>(configSerialNum,\n documentMetaStoreInitTask,\n documentMetaStore,\n baseAttrMgr,\n (_hasAttributes ? configSnapshot.getAttributesConfig() : AttributesConfig()),\n alloc_strategy,\n _fastAccessAttributesOnly,\n _writeService.master(),\n attrMgrResult);\n}\n\nvoid\nFastAccessDocSubDB::setupAttributeManager(AttributeManager::SP attrMgrResult)\n{\n if (_addMetrics) {\n \/\/ register attribute metrics\n std::vector<AttributeGuard> list;\n attrMgrResult->getAttributeListAll(list);\n for (const auto &attr : list) {\n const AttributeVector &v = *attr;\n _metricsWireService.addAttribute(_subAttributeMetrics, v.getName());\n }\n }\n _initAttrMgr = attrMgrResult;\n}\n\n\nAttributeCollectionSpec::UP\nFastAccessDocSubDB::createAttributeSpec(const AttributesConfig &attrCfg, const AllocStrategy& alloc_strategy, SerialNum serialNum) const\n{\n uint32_t docIdLimit(_dms->getCommittedDocIdLimit());\n AttributeCollectionSpecFactory factory(alloc_strategy, _fastAccessAttributesOnly);\n return factory.create(attrCfg, docIdLimit, serialNum);\n}\n\nvoid\nFastAccessDocSubDB::initFeedView(IAttributeWriter::SP writer, const DocumentDBConfig &configSnapshot)\n{\n \/\/ Called by executor thread\n auto feedView = std::make_shared<FastAccessFeedView>(\n getStoreOnlyFeedViewContext(configSnapshot),\n getFeedViewPersistentParams(),\n FastAccessFeedView::Context(std::move(writer), _docIdLimit));\n\n _fastAccessFeedView.set(feedView);\n _iFeedView.set(_fastAccessFeedView.get());\n}\n\nAttributeManager::SP\nFastAccessDocSubDB::getAndResetInitAttributeManager()\n{\n AttributeManager::SP retval = _initAttrMgr;\n _initAttrMgr.reset();\n return retval;\n}\n\nIFlushTarget::List\nFastAccessDocSubDB::getFlushTargetsInternal()\n{\n IFlushTarget::List retval(Parent::getFlushTargetsInternal());\n IFlushTarget::List tmp(getAttributeManager()->getFlushTargets());\n retval.insert(retval.end(), tmp.begin(), tmp.end());\n return retval;\n}\n\nvoid\nFastAccessDocSubDB::pruneRemovedFields(SerialNum serialNum)\n{\n getAttributeManager()->pruneRemovedFields(serialNum);\n}\n\nvoid\nFastAccessDocSubDB::reconfigureAttributeMetrics(const proton::IAttributeManager &newMgr,\n const proton::IAttributeManager &oldMgr)\n{\n std::set<vespalib::string> toAdd;\n std::set<vespalib::string> toRemove;\n std::vector<AttributeGuard> newList;\n std::vector<AttributeGuard> oldList;\n newMgr.getAttributeList(newList);\n oldMgr.getAttributeList(oldList);\n for (const auto &newAttr : newList) {\n if (std::find_if(oldList.begin(),\n oldList.end(),\n AttributeGuardComp(newAttr->getName())) ==\n oldList.end()) {\n toAdd.insert(newAttr->getName());\n }\n }\n for (const auto &oldAttr : oldList) {\n if (std::find_if(newList.begin(),\n newList.end(),\n AttributeGuardComp(oldAttr->getName())) ==\n newList.end()) {\n toRemove.insert(oldAttr->getName());\n }\n }\n for (const auto &attrName : toAdd) {\n LOG(debug, \"reconfigureAttributeMetrics(): addAttribute='%s'\", attrName.c_str());\n _metricsWireService.addAttribute(_subAttributeMetrics, attrName);\n }\n for (const auto &attrName : toRemove) {\n LOG(debug, \"reconfigureAttributeMetrics(): removeAttribute='%s'\", attrName.c_str());\n _metricsWireService.removeAttribute(_subAttributeMetrics, attrName);\n }\n}\n\nIReprocessingTask::UP\nFastAccessDocSubDB::createReprocessingTask(IReprocessingInitializer &initializer,\n const std::shared_ptr<const document::DocumentTypeRepo> &docTypeRepo) const\n{\n uint32_t docIdLimit = _metaStoreCtx->get().getCommittedDocIdLimit();\n assert(docIdLimit > 0);\n return std::make_unique<ReprocessDocumentsTask>(initializer, getSummaryManager(), docTypeRepo,\n getSubDbName(), docIdLimit);\n}\n\nFastAccessDocSubDB::FastAccessDocSubDB(const Config &cfg, const Context &ctx)\n : Parent(cfg._storeOnlyCfg, ctx._storeOnlyCtx),\n _hasAttributes(cfg._hasAttributes),\n _fastAccessAttributesOnly(cfg._fastAccessAttributesOnly),\n _initAttrMgr(),\n _fastAccessFeedView(),\n _subAttributeMetrics(ctx._subAttributeMetrics),\n _addMetrics(cfg._addMetrics),\n _metricsWireService(ctx._metricsWireService),\n _docIdLimit(0)\n{ }\n\nFastAccessDocSubDB::~FastAccessDocSubDB() = default;\n\nDocumentSubDbInitializer::UP\nFastAccessDocSubDB::createInitializer(const DocumentDBConfig &configSnapshot, SerialNum configSerialNum,\n const IndexConfig &indexCfg) const\n{\n auto result = Parent::createInitializer(configSnapshot, configSerialNum, indexCfg);\n auto attrMgrInitTask = createAttributeManagerInitializer(configSnapshot, configSerialNum,\n result->getDocumentMetaStoreInitTask(),\n result->result().documentMetaStore()->documentMetaStore(),\n result->writableResult().writableAttributeManager());\n result->addDependency(attrMgrInitTask);\n return result;\n}\n\nvoid\nFastAccessDocSubDB::setup(const DocumentSubDbInitializerResult &initResult)\n{\n Parent::setup(initResult);\n setupAttributeManager(initResult.attributeManager());\n _docIdLimit.set(_dms->getCommittedDocIdLimit());\n}\n\nvoid\nFastAccessDocSubDB::initViews(const DocumentDBConfig &configSnapshot,\n const SessionManager::SP &sessionManager)\n{\n \/\/ Called by executor thread\n (void) sessionManager;\n _iSearchView.set(std::make_shared<EmptySearchView>());\n auto writer = std::make_shared<AttributeWriter>(getAndResetInitAttributeManager());\n {\n std::lock_guard<std::mutex> guard(_configMutex);\n initFeedView(std::move(writer), configSnapshot);\n }\n}\n\nIReprocessingTask::List\nFastAccessDocSubDB::applyConfig(const DocumentDBConfig &newConfigSnapshot, const DocumentDBConfig &oldConfigSnapshot,\n SerialNum serialNum, const ReconfigParams ¶ms, IDocumentDBReferenceResolver &resolver)\n{\n (void) resolver;\n\n AllocStrategy alloc_strategy = newConfigSnapshot.get_alloc_config().make_alloc_strategy(_subDbType);\n reconfigure(newConfigSnapshot.getStoreConfig(), alloc_strategy);\n IReprocessingTask::List tasks;\n \/*\n * If attribute manager should change then document retriever\n * might have to rewrite a different set of fields. If document\n * type repo has changed then the new repo is needed to handle\n * documents using new fields, e.g. when moving documents from notready\n * to ready document sub db.\n *\/\n if (params.shouldAttributeManagerChange() ||\n params.shouldAttributeWriterChange() ||\n newConfigSnapshot.getDocumentTypeRepoSP().get() != oldConfigSnapshot.getDocumentTypeRepoSP().get()) {\n FastAccessDocSubDBConfigurer configurer(_fastAccessFeedView,\n std::make_unique<AttributeWriterFactory>(), getSubDbName());\n proton::IAttributeManager::SP oldMgr = extractAttributeManager(_fastAccessFeedView.get());\n AttributeCollectionSpec::UP attrSpec =\n createAttributeSpec(newConfigSnapshot.getAttributesConfig(), alloc_strategy, serialNum);\n IReprocessingInitializer::UP initializer =\n configurer.reconfigure(newConfigSnapshot, oldConfigSnapshot, *attrSpec);\n if (initializer->hasReprocessors()) {\n tasks.push_back(IReprocessingTask::SP(createReprocessingTask(*initializer,\n newConfigSnapshot.getDocumentTypeRepoSP()).release()));\n }\n if (_addMetrics) {\n proton::IAttributeManager::SP newMgr = extractAttributeManager(_fastAccessFeedView.get());\n reconfigureAttributeMetrics(*newMgr, *oldMgr);\n }\n _iFeedView.set(_fastAccessFeedView.get());\n if (isNodeRetired()) {\n reconfigureAttributesConsideringNodeState();\n }\n }\n return tasks;\n}\n\nproton::IAttributeManager::SP\nFastAccessDocSubDB::getAttributeManager() const\n{\n return extractAttributeManager(_fastAccessFeedView.get());\n}\n\nIDocumentRetriever::UP\nFastAccessDocSubDB::getDocumentRetriever()\n{\n FastAccessFeedView::SP feedView = _fastAccessFeedView.get();\n proton::IAttributeManager::SP attrMgr = extractAttributeManager(feedView);\n return std::make_unique<FastAccessDocumentRetriever>(feedView, attrMgr);\n}\n\nvoid\nFastAccessDocSubDB::onReplayDone()\n{\n \/\/ Called by document db executor thread\n Parent::onReplayDone();\n \/\/ Normalize attribute vector sizes\n uint32_t docIdLimit = _metaStoreCtx->get().getCommittedDocIdLimit();\n assert(docIdLimit > 0);\n _docIdLimit.set(docIdLimit);\n IFeedView::SP feedView = _iFeedView.get();\n IAttributeWriter::SP attrWriter = static_cast<FastAccessFeedView &>(*feedView).getAttributeWriter();\n attrWriter->onReplayDone(docIdLimit);\n}\n\n\nvoid\nFastAccessDocSubDB::onReprocessDone(SerialNum serialNum)\n{\n IFeedView::SP feedView = _iFeedView.get();\n IAttributeWriter::SP attrWriter = static_cast<FastAccessFeedView &>(*feedView).getAttributeWriter();\n vespalib::Gate gate;\n {\n auto onDone = std::make_shared<vespalib::GateCallback>(gate);\n attrWriter->forceCommit(serialNum, onDone);\n _writeService.summary().execute(vespalib::makeLambdaTask([done = std::move(onDone)]() { (void) done; }));\n }\n gate.await();\n Parent::onReprocessDone(serialNum);\n}\n\n\nSerialNum\nFastAccessDocSubDB::getOldestFlushedSerial()\n{\n SerialNum lowest(Parent::getOldestFlushedSerial());\n proton::IAttributeManager::SP attrMgr(getAttributeManager());\n lowest = std::min(lowest, attrMgr->getOldestFlushedSerialNumber());\n return lowest;\n}\n\nSerialNum\nFastAccessDocSubDB::getNewestFlushedSerial()\n{\n SerialNum highest(Parent::getNewestFlushedSerial());\n proton::IAttributeManager::SP attrMgr(getAttributeManager());\n highest = std::max(highest, attrMgr->getNewestFlushedSerialNumber());\n return highest;\n}\n\n} \/\/ namespace proton\n<|endoftext|>"} {"text":"<commit_before>\/*\n * Copyright(c) Sophist Solutions, Inc. 1990-2012. All rights reserved\n *\/\n#ifndef _Stroika_Foundation_Containers_Tally_Array_inl_\n#define _Stroika_Foundation_Containers_Tally_Array_inl_ 1\n\n\/*\n ********************************************************************************\n ***************************** Implementation Details ***************************\n ********************************************************************************\n *\/\n\n#include \"Private\/Array.h\"\n\n#include \"..\/..\/Memory\/BlockAllocated.h\"\n\n\nnamespace Stroika {\n namespace Foundation {\n namespace Containers {\n namespace Concrete {\n\n\n using namespace Private;\n\n\n template <typename T>\n class Tally_Array<T>::Rep_ : public Tally<T>::_IRep {\n private:\n typedef typename Tally<T>::_IRep inherited;\n\n public:\n Rep_ ();\n\n public:\n DECLARE_USE_BLOCK_ALLOCATION (Rep_);\n\n \/\/ Iterable<T>::_IRep overrides\n public:\n#if qCompilerAndStdLib_IllUnderstoodTemplateConfusionOverTBug\n virtual typename Iterable<TallyEntry<T>>::_SharedPtrIRep Clone () const override {\n return typename Iterable<TallyEntry<T>>::_SharedPtrIRep (new Rep_ (*this));\n }\n#else\n virtual typename Iterable<TallyEntry<T>>::_SharedPtrIRep Clone () const override;\n#endif \/\/ qCompilerAndStdLib_IllUnderstoodTemplateConfusionOverTBug\n\n virtual size_t GetLength () const override;\n virtual bool IsEmpty () const override;\n virtual Iterator<TallyEntry<T>> MakeIterator () const override;\n virtual void Apply (typename Rep_::_APPLY_ARGTYPE doToElement) const override;\n virtual Iterator<TallyEntry<T>> ApplyUntilTrue (typename Rep_::_APPLYUNTIL_ARGTYPE doToElement) const override;\n\n \/\/ Tally<T>::_IRep overrides\n public:\n virtual bool Contains (T item) const override;\n virtual void Compact () override;\n virtual void RemoveAll () override;\n virtual void Add (T item, size_t count) override;\n virtual void Remove (T item, size_t count) override;\n virtual size_t TallyOf (T item) const override;\n virtual shared_ptr<typename Iterator<T>::IRep> MakeBagIterator () const override;\n virtual typename Tally<T>::TallyMutator MakeTallyMutator () override;\n\n private:\n nonvirtual void RemoveAt_ (size_t index);\n\n private:\n Array_Patch<TallyEntry<T>> fData_;\n\n DEFINE_CONSTEXPR_CONSTANT(size_t, kNotFound_, (size_t) - 1);\n\n nonvirtual size_t Find_ (TallyEntry<T>& item) const;\n\n friend class Tally_Array<T>::MutatorRep_;\n };\n\n\n template <typename T>\n class Tally_Array<T>::MutatorRep_ : public Tally<T>::TallyMutator::IRep {\n private:\n typedef typename Tally<T>::TallyMutator::IRep inherited;\n\n public:\n MutatorRep_ (typename Tally_Array<T>::Rep_& owner);\n\n public:\n DECLARE_USE_BLOCK_ALLOCATION (MutatorRep_);\n\n public:\n virtual bool More (TallyEntry<T>* current, bool advance) override;\n virtual bool StrongEquals (const typename Iterator<TallyEntry<T> >::IRep* rhs) const override;\n virtual shared_ptr<typename Iterator<TallyEntry<T> >::IRep> Clone () const override;\n\n public:\n virtual void RemoveCurrent () override;\n virtual void UpdateCount (size_t newCount) override;\n\n private:\n ForwardArrayMutator_Patch<TallyEntry<T> > fIterator;\n friend class Tally_Array<T>::Rep_;\n };\n\n\n \/*\n ********************************************************************************\n *************************** Tally_Array<T>::MutatorRep_ ************************\n ********************************************************************************\n *\/\n template <class T>\n Tally_Array<T>::MutatorRep_::MutatorRep_ (typename Tally_Array<T>::Rep_& owner)\n : inherited ()\n , fIterator (owner.fData_)\n {\n }\n template <class T>\n bool Tally_Array<T>::MutatorRep_::More (TallyEntry<T>* current, bool advance)\n {\n return (fIterator.More (current, advance));\n }\n template <typename T>\n bool Tally_Array<T>::MutatorRep_::StrongEquals (const typename Iterator<TallyEntry<T> >::IRep* rhs) const\n {\n AssertNotImplemented ();\n return false;\n }\n template <typename T>\n shared_ptr<typename Iterator<TallyEntry<T> >::IRep> Tally_Array<T>::MutatorRep_::Clone () const\n {\n return shared_ptr<typename Iterator<TallyEntry<T> >::IRep> (new MutatorRep_ (*this));\n }\n template <typename T>\n void Tally_Array<T>::MutatorRep_::RemoveCurrent ()\n {\n fIterator.RemoveCurrent ();\n }\n template <typename T>\n void Tally_Array<T>::MutatorRep_::UpdateCount (size_t newCount)\n {\n if (newCount == 0) {\n fIterator.RemoveCurrent ();\n }\n else {\n TallyEntry<T> c = fIterator.Current ();\n c.fCount = newCount;\n fIterator.UpdateCurrent (c);\n }\n }\n\n\n \/*\n ********************************************************************************\n *************************** Tally_Array<T>::Rep_ *******************************\n ********************************************************************************\n *\/\n template <typename T>\n inline Tally_Array<T>::Rep_::Rep_ ()\n : inherited ()\n , fData_ ()\n {\n }\n template <typename T>\n size_t Tally_Array<T>::Rep_::GetLength () const\n {\n return (fData_.GetLength ());\n }\n template <typename T>\n bool Tally_Array<T>::Rep_::IsEmpty () const\n {\n return (fData_.GetLength () == 0);\n }\n template <typename T>\n Iterator<TallyEntry<T>> Tally_Array<T>::Rep_::MakeIterator () const\n {\n \/\/ const cast cuz this mutator won't really be used to change anything - except stuff like\n \/\/ link list of owned iterators\n Iterator<TallyEntry<T>> tmp = Iterator<TallyEntry<T>> (typename Iterator<TallyEntry<T>>::SharedByValueRepType (shared_ptr<typename Iterator<TallyEntry<T>>::IRep> (new MutatorRep_ (*const_cast<Rep_*> (this)))));\n tmp++; \/\/tmphack - redo iterator impl itself\n return tmp;\n }\n template <typename T>\n void Tally_Array<T>::Rep_::Apply (typename Rep_::_APPLY_ARGTYPE doToElement) const\n {\n return _Apply (doToElement);\n }\n template <typename T>\n Iterator<TallyEntry<T>> Tally_Array<T>::Rep_::ApplyUntilTrue (typename Rep_::_APPLYUNTIL_ARGTYPE doToElement) const\n {\n return _ApplyUntilTrue (doToElement);\n }\n template <typename T>\n bool Tally_Array<T>::Rep_::Contains (T item) const\n {\n TallyEntry<T> tmp (item);\n return (bool (Find_ (tmp) != kNotFound_));\n }\n template <typename T>\n void Tally_Array<T>::Rep_::Compact ()\n {\n fData_.Compact ();\n }\n#if !qCompilerAndStdLib_IllUnderstoodTemplateConfusionOverTBug\n template <typename T>\n typename Iterable<TallyEntry<T>>::_SharedPtrIRep Tally_Array<T>::Rep_::Clone () const\n {\n return typename Iterable<TallyEntry<T>>::_SharedPtrIRep (new Rep_ (*this));\n }\n#endif\n template <typename T>\n void Tally_Array<T>::Rep_::Add (T item, size_t count)\n {\n TallyEntry<T> tmp (item, count);\n size_t index = Find_ (tmp);\n if (index == kNotFound_) {\n fData_.InsertAt (tmp, GetLength ());\n }\n else {\n tmp.fCount += count;\n fData_.SetAt (tmp, index);\n }\n }\n template <typename T>\n void Tally_Array<T>::Rep_::Remove (T item, size_t count)\n {\n TallyEntry<T> tmp (item);\n size_t index = Find_ (tmp);\n if (index != kNotFound_) {\n Assert (index < GetLength ());\n Assert (tmp.fCount >= count);\n tmp.fCount -= count;\n if (tmp.fCount == 0) {\n RemoveAt_ (index);\n }\n else {\n fData_.SetAt (tmp, index);\n }\n }\n }\n template <typename T>\n void Tally_Array<T>::Rep_::RemoveAll ()\n {\n fData_.RemoveAll ();\n }\n template <typename T>\n size_t Tally_Array<T>::Rep_::TallyOf (T item) const\n {\n TallyEntry<T> tmp (item);\n size_t index = Find_ (tmp);\n Require (index >= 0);\n Require (index < GetLength ());\n return (tmp.fCount);\n }\n template <typename T>\n shared_ptr<typename Iterator<T>::IRep> Tally_Array<T>::Rep_::MakeBagIterator () const\n {\n return shared_ptr<typename Iterator<T>::IRep> (new typename Tally_Array<T>::_TallyEntryToItemIterator (MakeIterator ()));\n }\n template <typename T>\n typename Tally<T>::TallyMutator Tally_Array<T>::Rep_::MakeTallyMutator ()\n {\n return TallyMutator (new MutatorRep_ (*this));\n }\n template <typename T>\n void Tally_Array<T>::Rep_::RemoveAt_ (size_t index)\n {\n fData_.RemoveAt (index);\n }\n template <typename T>\n size_t Tally_Array<T>::Rep_::Find_ (TallyEntry<T>& item) const\n {\n size_t length = fData_.GetLength ();\n for (size_t i = 0; i < length; i++) {\n if (fData_.GetAt (i).fItem == item.fItem) {\n item = fData_.GetAt (i);\n return (i);\n }\n }\n return kNotFound_;\n }\n\n\n \/*\n ********************************************************************************\n ********************************* Tally_Array<T> *******************************\n ********************************************************************************\n *\/\n template <typename T>\n Tally_Array<T>::Tally_Array ()\n : Tally<T> (new Rep_ ())\n {\n }\n template <typename T> Tally_Array<T>::Tally_Array (const T* start, const T* end)\n : Tally<T> (new Rep_ ())\n {\n SetCapacity (size);\n AddItems (start, end);\n }\n template <typename T>\n inline Tally_Array<T>::Tally_Array (const Tally_Array<T>& src) :\n Tally<T> (src)\n {\n }\n template <typename T>\n Tally_Array<T>::Tally_Array (const Tally<T>& src) :\n Tally<T> (new Rep_ ())\n {\n SetCapacity (src.GetLength ());\n operator+= (src);\n }\n template <typename T>\n inline Tally_Array<T>& Tally_Array<T>::operator= (const Tally_Array<T>& src)\n {\n Tally<T>::operator= (src);\n return (*this);\n }\n template <typename T>\n inline const typename Tally_Array<T>::Rep_& Tally_Array<T>::GetRep_ () const\n {\n return reinterpret_cast<const Tally_Array<T>::Rep_&> (this->_GetRep ());\n }\n template <typename T>\n inline typename Tally_Array<T>::Rep_& Tally_Array<T>::GetRep_ ()\n {\n return reinterpret_cast<Tally_Array<T>::Rep_&> (this->_GetRep ());\n }\n template <typename T>\n size_t Tally_Array<T>::GetCapacity () const\n {\n return (this->GetRep ().fData_.GetCapacity ());\n }\n template <typename T>\n void Tally_Array<T>::SetCapacity (size_t slotsAlloced)\n {\n this->GetRep ().fData_.SetCapacity (slotsAlloced);\n }\n\n\n }\n }\n }\n}\n\n\n#endif \/* _Stroika_Foundation_Containers_Tally_Array_inl_ *\/\n\n\n<commit_msg>fixed call to Tally_Array CTOR - no more AddItems - just Add()<commit_after>\/*\n * Copyright(c) Sophist Solutions, Inc. 1990-2012. All rights reserved\n *\/\n#ifndef _Stroika_Foundation_Containers_Tally_Array_inl_\n#define _Stroika_Foundation_Containers_Tally_Array_inl_ 1\n\n\/*\n ********************************************************************************\n ***************************** Implementation Details ***************************\n ********************************************************************************\n *\/\n\n#include \"Private\/Array.h\"\n\n#include \"..\/..\/Memory\/BlockAllocated.h\"\n\n\nnamespace Stroika {\n namespace Foundation {\n namespace Containers {\n namespace Concrete {\n\n\n using namespace Private;\n\n\n template <typename T>\n class Tally_Array<T>::Rep_ : public Tally<T>::_IRep {\n private:\n typedef typename Tally<T>::_IRep inherited;\n\n public:\n Rep_ ();\n\n public:\n DECLARE_USE_BLOCK_ALLOCATION (Rep_);\n\n \/\/ Iterable<T>::_IRep overrides\n public:\n#if qCompilerAndStdLib_IllUnderstoodTemplateConfusionOverTBug\n virtual typename Iterable<TallyEntry<T>>::_SharedPtrIRep Clone () const override {\n return typename Iterable<TallyEntry<T>>::_SharedPtrIRep (new Rep_ (*this));\n }\n#else\n virtual typename Iterable<TallyEntry<T>>::_SharedPtrIRep Clone () const override;\n#endif \/\/ qCompilerAndStdLib_IllUnderstoodTemplateConfusionOverTBug\n\n virtual size_t GetLength () const override;\n virtual bool IsEmpty () const override;\n virtual Iterator<TallyEntry<T>> MakeIterator () const override;\n virtual void Apply (typename Rep_::_APPLY_ARGTYPE doToElement) const override;\n virtual Iterator<TallyEntry<T>> ApplyUntilTrue (typename Rep_::_APPLYUNTIL_ARGTYPE doToElement) const override;\n\n \/\/ Tally<T>::_IRep overrides\n public:\n virtual bool Contains (T item) const override;\n virtual void Compact () override;\n virtual void RemoveAll () override;\n virtual void Add (T item, size_t count) override;\n virtual void Remove (T item, size_t count) override;\n virtual size_t TallyOf (T item) const override;\n virtual shared_ptr<typename Iterator<T>::IRep> MakeBagIterator () const override;\n virtual typename Tally<T>::TallyMutator MakeTallyMutator () override;\n\n private:\n nonvirtual void RemoveAt_ (size_t index);\n\n private:\n Array_Patch<TallyEntry<T>> fData_;\n\n DEFINE_CONSTEXPR_CONSTANT(size_t, kNotFound_, (size_t) - 1);\n\n nonvirtual size_t Find_ (TallyEntry<T>& item) const;\n\n friend class Tally_Array<T>::MutatorRep_;\n };\n\n\n template <typename T>\n class Tally_Array<T>::MutatorRep_ : public Tally<T>::TallyMutator::IRep {\n private:\n typedef typename Tally<T>::TallyMutator::IRep inherited;\n\n public:\n MutatorRep_ (typename Tally_Array<T>::Rep_& owner);\n\n public:\n DECLARE_USE_BLOCK_ALLOCATION (MutatorRep_);\n\n public:\n virtual bool More (TallyEntry<T>* current, bool advance) override;\n virtual bool StrongEquals (const typename Iterator<TallyEntry<T> >::IRep* rhs) const override;\n virtual shared_ptr<typename Iterator<TallyEntry<T> >::IRep> Clone () const override;\n\n public:\n virtual void RemoveCurrent () override;\n virtual void UpdateCount (size_t newCount) override;\n\n private:\n ForwardArrayMutator_Patch<TallyEntry<T> > fIterator;\n friend class Tally_Array<T>::Rep_;\n };\n\n\n \/*\n ********************************************************************************\n *************************** Tally_Array<T>::MutatorRep_ ************************\n ********************************************************************************\n *\/\n template <class T>\n Tally_Array<T>::MutatorRep_::MutatorRep_ (typename Tally_Array<T>::Rep_& owner)\n : inherited ()\n , fIterator (owner.fData_)\n {\n }\n template <class T>\n bool Tally_Array<T>::MutatorRep_::More (TallyEntry<T>* current, bool advance)\n {\n return (fIterator.More (current, advance));\n }\n template <typename T>\n bool Tally_Array<T>::MutatorRep_::StrongEquals (const typename Iterator<TallyEntry<T> >::IRep* rhs) const\n {\n AssertNotImplemented ();\n return false;\n }\n template <typename T>\n shared_ptr<typename Iterator<TallyEntry<T> >::IRep> Tally_Array<T>::MutatorRep_::Clone () const\n {\n return shared_ptr<typename Iterator<TallyEntry<T> >::IRep> (new MutatorRep_ (*this));\n }\n template <typename T>\n void Tally_Array<T>::MutatorRep_::RemoveCurrent ()\n {\n fIterator.RemoveCurrent ();\n }\n template <typename T>\n void Tally_Array<T>::MutatorRep_::UpdateCount (size_t newCount)\n {\n if (newCount == 0) {\n fIterator.RemoveCurrent ();\n }\n else {\n TallyEntry<T> c = fIterator.Current ();\n c.fCount = newCount;\n fIterator.UpdateCurrent (c);\n }\n }\n\n\n \/*\n ********************************************************************************\n *************************** Tally_Array<T>::Rep_ *******************************\n ********************************************************************************\n *\/\n template <typename T>\n inline Tally_Array<T>::Rep_::Rep_ ()\n : inherited ()\n , fData_ ()\n {\n }\n template <typename T>\n size_t Tally_Array<T>::Rep_::GetLength () const\n {\n return (fData_.GetLength ());\n }\n template <typename T>\n bool Tally_Array<T>::Rep_::IsEmpty () const\n {\n return (fData_.GetLength () == 0);\n }\n template <typename T>\n Iterator<TallyEntry<T>> Tally_Array<T>::Rep_::MakeIterator () const\n {\n \/\/ const cast cuz this mutator won't really be used to change anything - except stuff like\n \/\/ link list of owned iterators\n Iterator<TallyEntry<T>> tmp = Iterator<TallyEntry<T>> (typename Iterator<TallyEntry<T>>::SharedByValueRepType (shared_ptr<typename Iterator<TallyEntry<T>>::IRep> (new MutatorRep_ (*const_cast<Rep_*> (this)))));\n tmp++; \/\/tmphack - redo iterator impl itself\n return tmp;\n }\n template <typename T>\n void Tally_Array<T>::Rep_::Apply (typename Rep_::_APPLY_ARGTYPE doToElement) const\n {\n return _Apply (doToElement);\n }\n template <typename T>\n Iterator<TallyEntry<T>> Tally_Array<T>::Rep_::ApplyUntilTrue (typename Rep_::_APPLYUNTIL_ARGTYPE doToElement) const\n {\n return _ApplyUntilTrue (doToElement);\n }\n template <typename T>\n bool Tally_Array<T>::Rep_::Contains (T item) const\n {\n TallyEntry<T> tmp (item);\n return (bool (Find_ (tmp) != kNotFound_));\n }\n template <typename T>\n void Tally_Array<T>::Rep_::Compact ()\n {\n fData_.Compact ();\n }\n#if !qCompilerAndStdLib_IllUnderstoodTemplateConfusionOverTBug\n template <typename T>\n typename Iterable<TallyEntry<T>>::_SharedPtrIRep Tally_Array<T>::Rep_::Clone () const\n {\n return typename Iterable<TallyEntry<T>>::_SharedPtrIRep (new Rep_ (*this));\n }\n#endif\n template <typename T>\n void Tally_Array<T>::Rep_::Add (T item, size_t count)\n {\n TallyEntry<T> tmp (item, count);\n size_t index = Find_ (tmp);\n if (index == kNotFound_) {\n fData_.InsertAt (tmp, GetLength ());\n }\n else {\n tmp.fCount += count;\n fData_.SetAt (tmp, index);\n }\n }\n template <typename T>\n void Tally_Array<T>::Rep_::Remove (T item, size_t count)\n {\n TallyEntry<T> tmp (item);\n size_t index = Find_ (tmp);\n if (index != kNotFound_) {\n Assert (index < GetLength ());\n Assert (tmp.fCount >= count);\n tmp.fCount -= count;\n if (tmp.fCount == 0) {\n RemoveAt_ (index);\n }\n else {\n fData_.SetAt (tmp, index);\n }\n }\n }\n template <typename T>\n void Tally_Array<T>::Rep_::RemoveAll ()\n {\n fData_.RemoveAll ();\n }\n template <typename T>\n size_t Tally_Array<T>::Rep_::TallyOf (T item) const\n {\n TallyEntry<T> tmp (item);\n size_t index = Find_ (tmp);\n Require (index >= 0);\n Require (index < GetLength ());\n return (tmp.fCount);\n }\n template <typename T>\n shared_ptr<typename Iterator<T>::IRep> Tally_Array<T>::Rep_::MakeBagIterator () const\n {\n return shared_ptr<typename Iterator<T>::IRep> (new typename Tally_Array<T>::_TallyEntryToItemIterator (MakeIterator ()));\n }\n template <typename T>\n typename Tally<T>::TallyMutator Tally_Array<T>::Rep_::MakeTallyMutator ()\n {\n return TallyMutator (new MutatorRep_ (*this));\n }\n template <typename T>\n void Tally_Array<T>::Rep_::RemoveAt_ (size_t index)\n {\n fData_.RemoveAt (index);\n }\n template <typename T>\n size_t Tally_Array<T>::Rep_::Find_ (TallyEntry<T>& item) const\n {\n size_t length = fData_.GetLength ();\n for (size_t i = 0; i < length; i++) {\n if (fData_.GetAt (i).fItem == item.fItem) {\n item = fData_.GetAt (i);\n return (i);\n }\n }\n return kNotFound_;\n }\n\n\n \/*\n ********************************************************************************\n ********************************* Tally_Array<T> *******************************\n ********************************************************************************\n *\/\n template <typename T>\n Tally_Array<T>::Tally_Array ()\n : Tally<T> (new Rep_ ())\n {\n }\n template <typename T> Tally_Array<T>::Tally_Array (const T* start, const T* end)\n : Tally<T> (new Rep_ ())\n {\n SetCapacity (size);\n Add (start, end);\n }\n template <typename T>\n inline Tally_Array<T>::Tally_Array (const Tally_Array<T>& src) :\n Tally<T> (src)\n {\n }\n template <typename T>\n Tally_Array<T>::Tally_Array (const Tally<T>& src) :\n Tally<T> (new Rep_ ())\n {\n SetCapacity (src.GetLength ());\n operator+= (src);\n }\n template <typename T>\n inline Tally_Array<T>& Tally_Array<T>::operator= (const Tally_Array<T>& src)\n {\n Tally<T>::operator= (src);\n return (*this);\n }\n template <typename T>\n inline const typename Tally_Array<T>::Rep_& Tally_Array<T>::GetRep_ () const\n {\n return reinterpret_cast<const Tally_Array<T>::Rep_&> (this->_GetRep ());\n }\n template <typename T>\n inline typename Tally_Array<T>::Rep_& Tally_Array<T>::GetRep_ ()\n {\n return reinterpret_cast<Tally_Array<T>::Rep_&> (this->_GetRep ());\n }\n template <typename T>\n size_t Tally_Array<T>::GetCapacity () const\n {\n return (this->GetRep ().fData_.GetCapacity ());\n }\n template <typename T>\n void Tally_Array<T>::SetCapacity (size_t slotsAlloced)\n {\n this->GetRep ().fData_.SetCapacity (slotsAlloced);\n }\n\n\n }\n }\n }\n}\n\n\n#endif \/* _Stroika_Foundation_Containers_Tally_Array_inl_ *\/\n\n\n<|endoftext|>"} {"text":"<commit_before>\/\/ Copyright Microsoft Corporation\n\/\/ Copyright Oberon microsystems, Inc\n\/\/ Copyright GHI Electronics, 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 \"STM32F4.h\"\n#include <stdio.h>\n\n#define TOTAL_DEPLOYMENT_CONTROLLERS 1\n\n#ifndef STM32F4_FLASH\n#define STM32F4_FLASH ((FLASH_TypeDef *) FLASH_R_BASE)\n#endif\n\nstruct DeploymentSector {\n uint32_t id;\n uint32_t address;\n uint32_t size;\n};\n\n#if STM32F4_SUPPLY_VOLTAGE_MV < 2100\n#error 16 bit Flash programming not allowed for voltages below 2.1V\n#endif\n#if STM32F4_AHB_CLOCK_HZ < 1000000\n#error Flash programming not allowed for HCLK below 1MHz\n#endif\n\nTinyCLR_Result STM32F4_Flash_GetSectorSizeForAddress(const TinyCLR_Storage_Controller* self, uint32_t address, int32_t& size);\n\nstatic const DeploymentSector deploymentSectors[] = DEPLOYMENT_SECTORS;\nstatic uint64_t deploymentSectorAddress[SIZEOF_ARRAY(deploymentSectors)];\nstatic size_t deploymentSectorSize[SIZEOF_ARRAY(deploymentSectors)];\n\nstatic const uint32_t STM32F4_FLASH_KEY1 = 0x45670123;\nstatic const uint32_t STM32F4_FLASH_KEY2 = 0xcdef89ab;\n\nstatic TinyCLR_Storage_Controller deploymentControllers[TOTAL_DEPLOYMENT_CONTROLLERS];\nstatic TinyCLR_Api_Info deploymentApi[TOTAL_DEPLOYMENT_CONTROLLERS];\nstatic TinyCLR_Storage_Descriptor deploymentDescriptor;\nTinyCLR_Startup_DeploymentConfiguration deploymentConfiguration;\n\nconst TinyCLR_Api_Info* STM32F4_Deployment_GetApi() {\n for (int32_t i = 0; i < TOTAL_DEPLOYMENT_CONTROLLERS; i++) {\n deploymentControllers[i].ApiInfo = &deploymentApi[i];\n deploymentControllers[i].Acquire = &STM32F4_Flash_Acquire;\n deploymentControllers[i].Release = &STM32F4_Flash_Release;\n deploymentControllers[i].Open = &STM32F4_Flash_Open;\n deploymentControllers[i].Close = &STM32F4_Flash_Close;\n deploymentControllers[i].Read = &STM32F4_Flash_Read;\n deploymentControllers[i].Write = &STM32F4_Flash_Write;\n deploymentControllers[i].Erase = &STM32F4_Flash_Erase;\n deploymentControllers[i].IsErased = &STM32F4_Flash_IsErased;\n deploymentControllers[i].GetDescriptor = &STM32F4_Flash_GetDescriptor;\n deploymentControllers[i].IsPresent = &STM32F4_Flash_IsPresent;\n deploymentControllers[i].SetPresenceChangedHandler = &STM32F4_Flash_SetPresenceChangedHandler;\n\n deploymentApi[i].Author = \"GHI Electronics, LLC\";\n deploymentApi[i].Name = \"GHIElectronics.TinyCLR.NativeApis.STM32F4.StorageController\";\n deploymentApi[i].Type = TinyCLR_Api_Type::StorageController;\n deploymentApi[i].Version = 0;\n deploymentApi[i].Implementation = &deploymentControllers[i];\n deploymentApi[i].State = nullptr;\n }\n\n STM32F4_Deplpoyment_Reset();\n\n return (const TinyCLR_Api_Info*)&deploymentApi;\n}\n\nTinyCLR_Result __section(\"SectionForFlashOperations\") STM32F4_Flash_Read(const TinyCLR_Storage_Controller* self, uint64_t address, size_t& count, uint8_t* data, uint64_t timeout) {\n int32_t bytePerSector = 0;\n\n if (data == nullptr) return TinyCLR_Result::ArgumentNull;\n if (STM32F4_Flash_GetSectorSizeForAddress(self, address, bytePerSector) != TinyCLR_Result::Success)\n return TinyCLR_Result::IndexOutOfRange;\n\n uint32_t* addressStart = reinterpret_cast<uint32_t*>(address);\n uint32_t* addressEnd = reinterpret_cast<uint32_t*>(address + count);\n uint32_t* pBuf = (uint32_t*)data;\n\n while (addressStart < addressEnd) {\n *pBuf++ = *addressStart++;\n }\n\n return TinyCLR_Result::Success;\n}\n\nTinyCLR_Result __section(\"SectionForFlashOperations\") STM32F4_Flash_Write(const TinyCLR_Storage_Controller* self, uint64_t address, size_t& count, const uint8_t* data, uint64_t timeout) {\n int32_t bytePerSector = 0;\n\n if (data == nullptr) return TinyCLR_Result::ArgumentNull;\n if (STM32F4_Flash_GetSectorSizeForAddress(self, address, bytePerSector) != TinyCLR_Result::Success)\n return TinyCLR_Result::IndexOutOfRange;\n\n if (STM32F4_FLASH->CR & FLASH_CR_LOCK) { \/\/ unlock\n STM32F4_FLASH->KEYR = STM32F4_FLASH_KEY1;\n STM32F4_FLASH->KEYR = STM32F4_FLASH_KEY2;\n }\n\n uint32_t* addressStart = reinterpret_cast<uint32_t*>(address);\n uint32_t* addressEnd = reinterpret_cast<uint32_t*>(address + count);\n uint32_t* pBuf = (uint32_t*)data;\n\n \/\/ enable programming\n STM32F4_FLASH->CR = FLASH_CR_PG | FLASH_CR_PSIZE_1;\n\n while (addressStart < addressEnd) {\n if (*addressStart != *pBuf) {\n \/\/ write data\n *addressStart = *pBuf;\n \/\/ wait for completion\n while (STM32F4_FLASH->SR & FLASH_SR_BSY);\n \/\/ check\n if (*addressStart != *pBuf) {\n return TinyCLR_Result::InvalidOperation;\n }\n }\n addressStart++;\n pBuf++;\n }\n\n \/\/ reset & lock the controller\n STM32F4_FLASH->CR = FLASH_CR_LOCK;\n\n return TinyCLR_Result::Success;\n}\n\nTinyCLR_Result __section(\"SectionForFlashOperations\") STM32F4_Flash_IsErased(const TinyCLR_Storage_Controller* self, uint64_t address, size_t& count, bool& erased) {\n auto sector = address; \/\/address is sector. Use sector for clear\n\n if (sector >= SIZEOF_ARRAY(deploymentSectors)) return TinyCLR_Result::IndexOutOfRange;\n\n uint32_t* addressStart = reinterpret_cast<uint32_t*>(deploymentSectors[sector].address);\n uint32_t* addressEnd = reinterpret_cast<uint32_t*>(deploymentSectors[sector].address + deploymentSectors[sector].size);\n\n erased = true;\n\n while (addressStart < addressEnd) {\n if (*addressStart != 0xFFFFFFFF) {\n erased = false;\n\n break;\n }\n\n addressStart++;\n }\n\n return TinyCLR_Result::Success;\n}\n\nTinyCLR_Result __section(\"SectionForFlashOperations\") STM32F4_Flash_Erase(const TinyCLR_Storage_Controller* self, uint64_t address, size_t& count, uint64_t timeout) {\n auto sector = address; \/\/address is sector. Use sector for clear\n\n if (sector >= SIZEOF_ARRAY(deploymentSectors)) return TinyCLR_Result::IndexOutOfRange;\n\n uint32_t num = deploymentSectors[sector].id;\n\n if (num > 11) num += 4;\n\n if (STM32F4_FLASH->CR & FLASH_CR_LOCK) { \/\/ unlock\n STM32F4_FLASH->KEYR = STM32F4_FLASH_KEY1;\n STM32F4_FLASH->KEYR = STM32F4_FLASH_KEY2;\n }\n\n \/\/ enable erasing\n uint32_t cr = num * FLASH_CR_SNB_0 | FLASH_CR_SER;\n STM32F4_FLASH->CR = cr;\n \/\/ start erase\n cr |= FLASH_CR_STRT;\n STM32F4_FLASH->CR = cr;\n \/\/ assure busy flag is set up (see STM32F4 errata)\n STM32F4_FLASH->CR = cr;\n \/\/ wait for completion\n while (STM32F4_FLASH->SR & FLASH_SR_BSY);\n\n \/\/ reset & lock the controller\n STM32F4_FLASH->CR = FLASH_CR_LOCK;\n\n TinyCLR_Result::Success;\n}\n\nTinyCLR_Result STM32F4_Flash_Acquire(const TinyCLR_Storage_Controller* self) {\n deploymentDescriptor.CanReadDirect = true;\n deploymentDescriptor.CanWriteDirect = true;\n deploymentDescriptor.CanExecuteDirect = true;\n deploymentDescriptor.EraseBeforeWrite = true;\n deploymentDescriptor.Removable = false;\n deploymentDescriptor.RegionsRepeat = false;\n deploymentDescriptor.RegionCount = SIZEOF_ARRAY(deploymentSectors);\n deploymentDescriptor.RegionAddresses = reinterpret_cast<const uint64_t*>(deploymentSectorAddress);\n deploymentDescriptor.RegionSizes = reinterpret_cast<const size_t*>(deploymentSectorSize);\n\n deploymentConfiguration.RegionCount = SIZEOF_ARRAY(deploymentSectors);\n deploymentConfiguration.RegionAddresses = reinterpret_cast<const uint64_t*>(deploymentSectorAddress);\n deploymentConfiguration.RegionSizes = reinterpret_cast<const size_t*>(deploymentSectorSize);\n\n return TinyCLR_Result::Success;\n}\n\nTinyCLR_Result STM32F4_Flash_Release(const TinyCLR_Storage_Controller* self) {\n return TinyCLR_Result::Success;\n}\n\nTinyCLR_Result STM32F4_Flash_Open(const TinyCLR_Storage_Controller* self) {\n return TinyCLR_Result::Success;\n}\n\nTinyCLR_Result STM32F4_Flash_Close(const TinyCLR_Storage_Controller* self) {\n return TinyCLR_Result::Success;\n}\n\nTinyCLR_Result STM32F4_Flash_GetSectorSizeForAddress(const TinyCLR_Storage_Controller* self, uint32_t address, int32_t& size) {\n int32_t sectors = SIZEOF_ARRAY(deploymentSectors);\n\n size = 0;\n\n for (int32_t i = 0; i < sectors; i++) {\n if (address >= deploymentSectors[i].address && address < deploymentSectors[i].address + deploymentSectors[i].size) {\n size = deploymentSectors[i].size;\n\n break;\n }\n }\n\n return size > 0 ? TinyCLR_Result::Success : TinyCLR_Result::ArgumentInvalid;\n}\n\nTinyCLR_Result STM32F4_Flash_SetPresenceChangedHandler(const TinyCLR_Storage_Controller* self, TinyCLR_Storage_PresenceChangedHandler handler) {\n return TinyCLR_Result::NotImplemented;\n}\n\nTinyCLR_Result STM32F4_Flash_IsPresent(const TinyCLR_Storage_Controller* self, bool& present) {\n return TinyCLR_Result::NotImplemented;\n}\n\nTinyCLR_Result STM32F4_Flash_GetDescriptor(const TinyCLR_Storage_Controller* self, const TinyCLR_Storage_Descriptor*& descriptor) {\n descriptor = &deploymentDescriptor;\n\n return descriptor->RegionCount > 0 ? TinyCLR_Result::Success : TinyCLR_Result::NotImplemented;\n}\n\nvoid STM32F4_Deplpoyment_Reset() {\n for (int32_t i = 0; i < SIZEOF_ARRAY(deploymentSectors); i++) {\n deploymentSectorAddress[i] = deploymentSectors[i].address;\n deploymentSectorSize[i] = deploymentSectors[i].size;\n }\n\n}<commit_msg>Tweak<commit_after>\/\/ Copyright Microsoft Corporation\n\/\/ Copyright Oberon microsystems, Inc\n\/\/ Copyright GHI Electronics, 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 \"STM32F4.h\"\n#include <stdio.h>\n\n#define TOTAL_DEPLOYMENT_CONTROLLERS 1\n\n#ifndef STM32F4_FLASH\n#define STM32F4_FLASH ((FLASH_TypeDef *) FLASH_R_BASE)\n#endif\n\nstruct DeploymentSector {\n uint32_t id;\n uint32_t address;\n uint32_t size;\n};\n\n#if STM32F4_SUPPLY_VOLTAGE_MV < 2100\n#error 16 bit Flash programming not allowed for voltages below 2.1V\n#endif\n#if STM32F4_AHB_CLOCK_HZ < 1000000\n#error Flash programming not allowed for HCLK below 1MHz\n#endif\n\nTinyCLR_Result STM32F4_Flash_GetSectorSizeForAddress(const TinyCLR_Storage_Controller* self, uint32_t address, int32_t& size);\n\nstatic const DeploymentSector deploymentSectors[] = DEPLOYMENT_SECTORS;\nstatic uint64_t deploymentSectorAddress[SIZEOF_ARRAY(deploymentSectors)];\nstatic size_t deploymentSectorSize[SIZEOF_ARRAY(deploymentSectors)];\n\nstatic const uint32_t STM32F4_FLASH_KEY1 = 0x45670123;\nstatic const uint32_t STM32F4_FLASH_KEY2 = 0xcdef89ab;\n\nstatic TinyCLR_Storage_Controller deploymentControllers[TOTAL_DEPLOYMENT_CONTROLLERS];\nstatic TinyCLR_Api_Info deploymentApi[TOTAL_DEPLOYMENT_CONTROLLERS];\nstatic TinyCLR_Storage_Descriptor deploymentDescriptor;\nTinyCLR_Startup_DeploymentConfiguration deploymentConfiguration;\n\nconst TinyCLR_Api_Info* STM32F4_Deployment_GetApi() {\n for (int32_t i = 0; i < TOTAL_DEPLOYMENT_CONTROLLERS; i++) {\n deploymentControllers[i].ApiInfo = &deploymentApi[i];\n deploymentControllers[i].Acquire = &STM32F4_Flash_Acquire;\n deploymentControllers[i].Release = &STM32F4_Flash_Release;\n deploymentControllers[i].Open = &STM32F4_Flash_Open;\n deploymentControllers[i].Close = &STM32F4_Flash_Close;\n deploymentControllers[i].Read = &STM32F4_Flash_Read;\n deploymentControllers[i].Write = &STM32F4_Flash_Write;\n deploymentControllers[i].Erase = &STM32F4_Flash_Erase;\n deploymentControllers[i].IsErased = &STM32F4_Flash_IsErased;\n deploymentControllers[i].GetDescriptor = &STM32F4_Flash_GetDescriptor;\n deploymentControllers[i].IsPresent = &STM32F4_Flash_IsPresent;\n deploymentControllers[i].SetPresenceChangedHandler = &STM32F4_Flash_SetPresenceChangedHandler;\n\n deploymentApi[i].Author = \"GHI Electronics, LLC\";\n deploymentApi[i].Name = \"GHIElectronics.TinyCLR.NativeApis.STM32F4.StorageController\";\n deploymentApi[i].Type = TinyCLR_Api_Type::StorageController;\n deploymentApi[i].Version = 0;\n deploymentApi[i].Implementation = &deploymentControllers[i];\n deploymentApi[i].State = nullptr;\n }\n\n STM32F4_Deplpoyment_Reset();\n\n return (const TinyCLR_Api_Info*)&deploymentApi;\n}\n\nTinyCLR_Result __section(\"SectionForFlashOperations\") STM32F4_Flash_Read(const TinyCLR_Storage_Controller* self, uint64_t address, size_t& count, uint8_t* data, uint64_t timeout) {\n int32_t bytePerSector = 0;\n\n if (data == nullptr) return TinyCLR_Result::ArgumentNull;\n if (STM32F4_Flash_GetSectorSizeForAddress(self, address, bytePerSector) != TinyCLR_Result::Success)\n return TinyCLR_Result::IndexOutOfRange;\n\n uint32_t* addressStart = reinterpret_cast<uint32_t*>(address);\n uint32_t* addressEnd = reinterpret_cast<uint32_t*>(address + count);\n uint32_t* pBuf = (uint32_t*)data;\n\n while (addressStart < addressEnd) {\n *pBuf++ = *addressStart++;\n }\n\n return TinyCLR_Result::Success;\n}\n\nTinyCLR_Result __section(\"SectionForFlashOperations\") STM32F4_Flash_Write(const TinyCLR_Storage_Controller* self, uint64_t address, size_t& count, const uint8_t* data, uint64_t timeout) {\n int32_t bytePerSector = 0;\n\n if (data == nullptr) return TinyCLR_Result::ArgumentNull;\n if (STM32F4_Flash_GetSectorSizeForAddress(self, address, bytePerSector) != TinyCLR_Result::Success)\n return TinyCLR_Result::IndexOutOfRange;\n\n if (STM32F4_FLASH->CR & FLASH_CR_LOCK) { \/\/ unlock\n STM32F4_FLASH->KEYR = STM32F4_FLASH_KEY1;\n STM32F4_FLASH->KEYR = STM32F4_FLASH_KEY2;\n }\n\n uint32_t* addressStart = reinterpret_cast<uint32_t*>(address);\n uint32_t* addressEnd = reinterpret_cast<uint32_t*>(address + count);\n uint32_t* pBuf = (uint32_t*)data;\n\n \/\/ enable programming\n STM32F4_FLASH->CR = FLASH_CR_PG | FLASH_CR_PSIZE_1;\n\n while (addressStart < addressEnd) {\n if (*addressStart != *pBuf) {\n \/\/ write data\n *addressStart = *pBuf;\n \/\/ wait for completion\n while (STM32F4_FLASH->SR & FLASH_SR_BSY);\n \/\/ check\n if (*addressStart != *pBuf) {\n return TinyCLR_Result::InvalidOperation;\n }\n }\n addressStart++;\n pBuf++;\n }\n\n \/\/ reset & lock the controller\n STM32F4_FLASH->CR = FLASH_CR_LOCK;\n\n return TinyCLR_Result::Success;\n}\n\nTinyCLR_Result __section(\"SectionForFlashOperations\") STM32F4_Flash_IsErased(const TinyCLR_Storage_Controller* self, uint64_t address, size_t& count, bool& erased) {\n auto sector = address; \/\/address is sector. Use sector for clear\n\n if (sector >= SIZEOF_ARRAY(deploymentSectors)) return TinyCLR_Result::IndexOutOfRange;\n\n uint32_t* addressStart = reinterpret_cast<uint32_t*>(deploymentSectors[sector].address);\n uint32_t* addressEnd = reinterpret_cast<uint32_t*>(deploymentSectors[sector].address + deploymentSectors[sector].size);\n\n erased = true;\n\n while (addressStart < addressEnd) {\n if (*addressStart != 0xFFFFFFFF) {\n erased = false;\n\n break;\n }\n\n addressStart++;\n }\n\n return TinyCLR_Result::Success;\n}\n\nTinyCLR_Result __section(\"SectionForFlashOperations\") STM32F4_Flash_Erase(const TinyCLR_Storage_Controller* self, uint64_t address, size_t& count, uint64_t timeout) {\n auto sector = address; \/\/address is sector. Use sector for clear\n\n if (sector >= SIZEOF_ARRAY(deploymentSectors)) return TinyCLR_Result::IndexOutOfRange;\n\n uint32_t num = deploymentSectors[sector].id;\n\n if (num > 11) num += 4;\n\n if (STM32F4_FLASH->CR & FLASH_CR_LOCK) { \/\/ unlock\n STM32F4_FLASH->KEYR = STM32F4_FLASH_KEY1;\n STM32F4_FLASH->KEYR = STM32F4_FLASH_KEY2;\n }\n\n \/\/ enable erasing\n uint32_t cr = num * FLASH_CR_SNB_0 | FLASH_CR_SER;\n STM32F4_FLASH->CR = cr;\n \/\/ start erase\n cr |= FLASH_CR_STRT;\n STM32F4_FLASH->CR = cr;\n \/\/ assure busy flag is set up (see STM32F4 errata)\n STM32F4_FLASH->CR = cr;\n \/\/ wait for completion\n while (STM32F4_FLASH->SR & FLASH_SR_BSY);\n\n \/\/ reset & lock the controller\n STM32F4_FLASH->CR = FLASH_CR_LOCK;\n\n TinyCLR_Result::Success;\n}\n\nTinyCLR_Result STM32F4_Flash_Acquire(const TinyCLR_Storage_Controller* self) {\n deploymentDescriptor.CanReadDirect = true;\n deploymentDescriptor.CanWriteDirect = true;\n deploymentDescriptor.CanExecuteDirect = true;\n deploymentDescriptor.EraseBeforeWrite = true;\n deploymentDescriptor.Removable = false;\n deploymentDescriptor.RegionsRepeat = false;\n\n deploymentDescriptor.RegionCount = SIZEOF_ARRAY(deploymentSectors);\n deploymentDescriptor.RegionAddresses = reinterpret_cast<const uint64_t*>(deploymentSectorAddress);\n deploymentDescriptor.RegionSizes = reinterpret_cast<const size_t*>(deploymentSectorSize);\n\n deploymentConfiguration.RegionCount = deploymentDescriptor.RegionCount;\n deploymentConfiguration.RegionAddresses = deploymentDescriptor.RegionAddresses;\n deploymentConfiguration.RegionSizes = deploymentDescriptor.RegionSizes;\n\n return TinyCLR_Result::Success;\n}\n\nTinyCLR_Result STM32F4_Flash_Release(const TinyCLR_Storage_Controller* self) {\n return TinyCLR_Result::Success;\n}\n\nTinyCLR_Result STM32F4_Flash_Open(const TinyCLR_Storage_Controller* self) {\n return TinyCLR_Result::Success;\n}\n\nTinyCLR_Result STM32F4_Flash_Close(const TinyCLR_Storage_Controller* self) {\n return TinyCLR_Result::Success;\n}\n\nTinyCLR_Result STM32F4_Flash_GetSectorSizeForAddress(const TinyCLR_Storage_Controller* self, uint32_t address, int32_t& size) {\n int32_t sectors = SIZEOF_ARRAY(deploymentSectors);\n\n size = 0;\n\n for (int32_t i = 0; i < sectors; i++) {\n if (address >= deploymentSectors[i].address && address < deploymentSectors[i].address + deploymentSectors[i].size) {\n size = deploymentSectors[i].size;\n\n break;\n }\n }\n\n return size > 0 ? TinyCLR_Result::Success : TinyCLR_Result::ArgumentInvalid;\n}\n\nTinyCLR_Result STM32F4_Flash_SetPresenceChangedHandler(const TinyCLR_Storage_Controller* self, TinyCLR_Storage_PresenceChangedHandler handler) {\n return TinyCLR_Result::NotImplemented;\n}\n\nTinyCLR_Result STM32F4_Flash_IsPresent(const TinyCLR_Storage_Controller* self, bool& present) {\n return TinyCLR_Result::NotImplemented;\n}\n\nTinyCLR_Result STM32F4_Flash_GetDescriptor(const TinyCLR_Storage_Controller* self, const TinyCLR_Storage_Descriptor*& descriptor) {\n descriptor = &deploymentDescriptor;\n\n return descriptor->RegionCount > 0 ? TinyCLR_Result::Success : TinyCLR_Result::NotImplemented;\n}\n\nvoid STM32F4_Deplpoyment_Reset() {\n for (int32_t i = 0; i < SIZEOF_ARRAY(deploymentSectors); i++) {\n deploymentSectorAddress[i] = deploymentSectors[i].address;\n deploymentSectorSize[i] = deploymentSectors[i].size;\n }\n\n}<|endoftext|>"} {"text":"<commit_before>\/*\n Copyright (C) 2009-2011 qiuu\n Copyright (C) 2016 Clownacy\n\n This library is free software; you can redistribute it and\/or\n modify it under the terms of the GNU Lesser General Public\n License as published by the Free Software Foundation; either\n version 2.1 of the License, or (at your option) any later version.\n\n This library is distributed in the hope that it will be useful,\n but WITHOUT ANY WARRANTY; without even the implied warranty of\n MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU\n Lesser General Public License for more details.\n\n You should have received a copy of the GNU Lesser General Public\n License along with this library; if not, write to the Free Software\n Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301\n USA\n*\/\n\n#include <cstdio>\n#include <cstdint>\n#include <cstring>\n#include <SDL2\/SDL.h>\n\n#include \"Screen.h\"\n#ifdef _WIN32\n#include \"WinAPI.h\"\n#include <windows.h>\n#endif\n\n#ifdef _WIN32\n#define ADJUSTED_SCREEN_HEIGHT (SCREEN_HEIGHT + GetSystemMetrics(SM_CYMENU))\n#else\n#define ADJUSTED_SCREEN_HEIGHT SCREEN_HEIGHT\n#endif\n\nScreen::Screen(void)\n{\n\tif (SDL_Init(SDL_INIT_VIDEO)<0)\n\t\tthis->ShowInternalError(\"Unable to init SDL video\\n\\n\", SDL_GetError());\n\n\tatexit(SDL_Quit);\n\n\tthis->window = SDL_CreateWindow(\"Captain PlaneEd v1.0.1+\", SDL_WINDOWPOS_UNDEFINED, SDL_WINDOWPOS_UNDEFINED, SCREEN_WIDTH, ADJUSTED_SCREEN_HEIGHT, SDL_WINDOW_SHOWN | SDL_WINDOW_RESIZABLE);\n\tif (this->window == NULL)\n\t\tthis->ShowInternalError(\"Unable to init SDL Window\\n\\n\", SDL_GetError());\n\n\tthis->renderer = SDL_CreateRenderer(window, -1, SDL_RENDERER_TARGETTEXTURE | SDL_RENDERER_ACCELERATED);\n\tif (this->renderer == NULL)\n\t\tthis->ShowInternalError(\"Unable to init SDL Renderer\\n\\n\", SDL_GetError());\n\n\tSDL_RenderSetLogicalSize(renderer, SCREEN_WIDTH, SCREEN_HEIGHT);\n\n\tSDL_SetHint(SDL_HINT_RENDER_SCALE_QUALITY, \"nearest\");\n\tthis->texture = SDL_CreateTexture(this->renderer, SDL_PIXELFORMAT_RGB24, SDL_TEXTUREACCESS_TARGET, SCREEN_WIDTH, SCREEN_HEIGHT);\n\tif (this->texture==NULL)\n\t\tthis->ShowInternalError(\"Unable to init screen SDL Texture\\n\\n\", SDL_GetError());\n\n\tthis->background_colour = {.r = 0, .g = 0, .b = 0, .a = 0};\n\n#ifdef _WIN32\n\t\/\/ Windows-only crap to generate a menu bar\n\tWinAPI::SaveHWND(this->window);\n\tWinAPI::CreateMenuBar();\n#endif\n}\n\nvoid Screen::ProcessDisplay(void)\n{\n\tSDL_SetRenderTarget(this->renderer, NULL);\n\tSDL_SetRenderDrawColor(this->renderer, 0, 0, 0, 0xFF);\n\tSDL_RenderClear(this->renderer);\n\tSDL_RenderCopy(this->renderer, this->texture, NULL, NULL);\n\n\tSDL_RenderPresent(this->renderer);\n}\n\nvoid Screen::Clear(void)\n{\n\tSDL_SetRenderDrawColor(this->renderer, this->background_colour.r, this->background_colour.g, this->background_colour.b, 0xFF);\n\tSDL_RenderFillRect(this->renderer, NULL);\n}\n\nvoid Screen::ShowInformation(const char* const message)\n{\n\tSDL_ShowSimpleMessageBox(SDL_MESSAGEBOX_INFORMATION, \"Information\", message, this->window);\n}\n\nvoid Screen::ShowInformation(const char* const message_part1, const char* const message_part2)\n{\n\tchar* const whole_message = new char[strlen(message_part1)+strlen(message_part2)+1];\n\tsprintf(whole_message, \"%s%s\", message_part1, message_part2);\n\tthis->ShowInformation(whole_message);\n\tdelete[] whole_message;\n}\n\nvoid Screen::ShowWarning(const char* const message)\n{\n\tSDL_ShowSimpleMessageBox(SDL_MESSAGEBOX_WARNING, \"Warning\", message, this->window);\n}\n\nvoid Screen::ShowError(const char* const message)\n{\n\tSDL_ShowSimpleMessageBox(SDL_MESSAGEBOX_ERROR, \"Error\", message, this->window);\n\texit(1);\n}\n\nvoid Screen::ShowInternalError(const char* const message)\n{\n\tSDL_ShowSimpleMessageBox(SDL_MESSAGEBOX_ERROR, \"Internal Error\", message, this->window);\n\texit(1);\n}\n\nvoid Screen::ShowInternalError(const char* const message_part1, const char* const message_part2)\n{\n\tchar* const whole_message = new char[strlen(message_part1)+strlen(message_part2)+1];\n\tsprintf(whole_message, \"%s%s\", message_part1, message_part2);\n\tthis->ShowInternalError(whole_message);\n\tdelete[] whole_message;\n}\n<commit_msg>Bump the version number<commit_after>\/*\n Copyright (C) 2009-2011 qiuu\n Copyright (C) 2016 Clownacy\n\n This library is free software; you can redistribute it and\/or\n modify it under the terms of the GNU Lesser General Public\n License as published by the Free Software Foundation; either\n version 2.1 of the License, or (at your option) any later version.\n\n This library is distributed in the hope that it will be useful,\n but WITHOUT ANY WARRANTY; without even the implied warranty of\n MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU\n Lesser General Public License for more details.\n\n You should have received a copy of the GNU Lesser General Public\n License along with this library; if not, write to the Free Software\n Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301\n USA\n*\/\n\n#include <cstdio>\n#include <cstdint>\n#include <cstring>\n#include <SDL2\/SDL.h>\n\n#include \"Screen.h\"\n#ifdef _WIN32\n#include \"WinAPI.h\"\n#include <windows.h>\n#endif\n\n#ifdef _WIN32\n#define ADJUSTED_SCREEN_HEIGHT (SCREEN_HEIGHT + GetSystemMetrics(SM_CYMENU))\n#else\n#define ADJUSTED_SCREEN_HEIGHT SCREEN_HEIGHT\n#endif\n\nScreen::Screen(void)\n{\n\tif (SDL_Init(SDL_INIT_VIDEO)<0)\n\t\tthis->ShowInternalError(\"Unable to init SDL video\\n\\n\", SDL_GetError());\n\n\tatexit(SDL_Quit);\n\n\tthis->window = SDL_CreateWindow(\"Captain PlaneEd v1.1\", SDL_WINDOWPOS_UNDEFINED, SDL_WINDOWPOS_UNDEFINED, SCREEN_WIDTH, ADJUSTED_SCREEN_HEIGHT, SDL_WINDOW_SHOWN | SDL_WINDOW_RESIZABLE);\n\tif (this->window == NULL)\n\t\tthis->ShowInternalError(\"Unable to init SDL Window\\n\\n\", SDL_GetError());\n\n\tthis->renderer = SDL_CreateRenderer(window, -1, SDL_RENDERER_TARGETTEXTURE | SDL_RENDERER_ACCELERATED);\n\tif (this->renderer == NULL)\n\t\tthis->ShowInternalError(\"Unable to init SDL Renderer\\n\\n\", SDL_GetError());\n\n\tSDL_RenderSetLogicalSize(renderer, SCREEN_WIDTH, SCREEN_HEIGHT);\n\n\tSDL_SetHint(SDL_HINT_RENDER_SCALE_QUALITY, \"nearest\");\n\tthis->texture = SDL_CreateTexture(this->renderer, SDL_PIXELFORMAT_RGB24, SDL_TEXTUREACCESS_TARGET, SCREEN_WIDTH, SCREEN_HEIGHT);\n\tif (this->texture==NULL)\n\t\tthis->ShowInternalError(\"Unable to init screen SDL Texture\\n\\n\", SDL_GetError());\n\n\tthis->background_colour = {.r = 0, .g = 0, .b = 0, .a = 0};\n\n#ifdef _WIN32\n\t\/\/ Windows-only crap to generate a menu bar\n\tWinAPI::SaveHWND(this->window);\n\tWinAPI::CreateMenuBar();\n#endif\n}\n\nvoid Screen::ProcessDisplay(void)\n{\n\tSDL_SetRenderTarget(this->renderer, NULL);\n\tSDL_SetRenderDrawColor(this->renderer, 0, 0, 0, 0xFF);\n\tSDL_RenderClear(this->renderer);\n\tSDL_RenderCopy(this->renderer, this->texture, NULL, NULL);\n\n\tSDL_RenderPresent(this->renderer);\n}\n\nvoid Screen::Clear(void)\n{\n\tSDL_SetRenderDrawColor(this->renderer, this->background_colour.r, this->background_colour.g, this->background_colour.b, 0xFF);\n\tSDL_RenderFillRect(this->renderer, NULL);\n}\n\nvoid Screen::ShowInformation(const char* const message)\n{\n\tSDL_ShowSimpleMessageBox(SDL_MESSAGEBOX_INFORMATION, \"Information\", message, this->window);\n}\n\nvoid Screen::ShowInformation(const char* const message_part1, const char* const message_part2)\n{\n\tchar* const whole_message = new char[strlen(message_part1)+strlen(message_part2)+1];\n\tsprintf(whole_message, \"%s%s\", message_part1, message_part2);\n\tthis->ShowInformation(whole_message);\n\tdelete[] whole_message;\n}\n\nvoid Screen::ShowWarning(const char* const message)\n{\n\tSDL_ShowSimpleMessageBox(SDL_MESSAGEBOX_WARNING, \"Warning\", message, this->window);\n}\n\nvoid Screen::ShowError(const char* const message)\n{\n\tSDL_ShowSimpleMessageBox(SDL_MESSAGEBOX_ERROR, \"Error\", message, this->window);\n\texit(1);\n}\n\nvoid Screen::ShowInternalError(const char* const message)\n{\n\tSDL_ShowSimpleMessageBox(SDL_MESSAGEBOX_ERROR, \"Internal Error\", message, this->window);\n\texit(1);\n}\n\nvoid Screen::ShowInternalError(const char* const message_part1, const char* const message_part2)\n{\n\tchar* const whole_message = new char[strlen(message_part1)+strlen(message_part2)+1];\n\tsprintf(whole_message, \"%s%s\", message_part1, message_part2);\n\tthis->ShowInternalError(whole_message);\n\tdelete[] whole_message;\n}\n<|endoftext|>"} {"text":"<commit_before>#ifndef _SENSOR_NODE_\n#define _SENSOR_NODE_\n\n#include <Homie.h>\n#include \"BME280_Impl.hpp\"\n#include \"DHTxx_Impl.hpp\"\n#include \"SHT30_Impl.hpp\"\n\nclass Sensor {\n public:\n Sensor();\n virtual ~Sensor();\n\n void setup();\n bool publish();\n\n private:\n \/\/ taken from adafruit DHT library\n float computeHeatIndex(float temperature, float relativeHumidity) const;\n \/\/ Sättigungsdampfdruck in hPa\n double SDD(float temperature) const;\n \/\/ Dampfdruck in hPa\n double DD(float temperature, float relativeHumidity) const;\n \/\/ Taupunkt in °C\n float TD(float temperature, float relativeHumidity) const;\n \/\/ absolute Feuchte in g Wasserdampf pro m3 Luft\n float AF(float temperature, float relativeHumidity) const;\n \/\/ check and update the health state. publish health state if it has changed.\n void checkHealth();\n\n SensorInterface *sensor;\n SensorInterface::SensorState ss;\n unsigned long errors;\n static constexpr char* dht11 = \"dht11\";\n static constexpr char* dht21 = \"dht21\";\n static constexpr char* dht22 = \"dht22\";\n static constexpr char* bme280 = \"bme280\";\n static constexpr char* sht30 = \"sht30\";\n HomieSetting<const char*> typeSetting;\n HomieNode *sensorStateNode;\n HomieNode *temperatureNode;\n HomieNode *humidityNode;\n HomieNode *preasureNode;\n};\n\ninline Sensor::Sensor()\n : sensor(NULL)\n , ss(SensorInterface::unknown)\n , errors(0)\n , typeSetting(\"type\", \"Type of the sensor. Use either \\\"dht11\\\", \\\"dht21\\\", \\\"dht22\\\", \\\"bme280\\\" or \\\"sht30\\\"\")\n , sensorStateNode(NULL)\n , temperatureNode(NULL)\n , humidityNode(NULL)\n , preasureNode(NULL) {\n typeSetting.setDefaultValue(dht11).setValidator([] (const char* candidate) {\n return (String(candidate) == dht11) ||\n (String(candidate) == dht21) ||\n (String(candidate) == dht22) ||\n (String(candidate) == bme280) ||\n (String(candidate) == sht30);\n });\n\n sensorStateNode = new HomieNode(\"healthState\", \"healthState\");\n temperatureNode = new HomieNode(\"temperature\", \"temperature\");\n humidityNode = new HomieNode(\"humidity\", \"humidity\");\n preasureNode = new HomieNode(\"preasure\", \"preasure\");\n\n sensorStateNode->advertise(\"health\");\n sensorStateNode->advertise(\"errors\");\n temperatureNode->advertise(\"absolut\");\n temperatureNode->advertise(\"heatindex\");\n humidityNode->advertise(\"relative\");\n humidityNode->advertise(\"absolute\");\n preasureNode->advertise(\"preasure\");\n}\n\ninline Sensor::~Sensor() {\n delete preasureNode;\n delete humidityNode;\n delete temperatureNode;\n delete sensorStateNode;\n delete sensor;\n}\n\ninline float Sensor::computeHeatIndex(float temperature, float percentHumidity) const {\n \/\/ Using both Rothfusz and Steadman's equations\n \/\/ http:\/\/www.wpc.ncep.noaa.gov\/html\/heatindex_equation.shtml\n\n\n \/\/ to fahrenheit\n temperature = temperature * 1.8 + 32;\n\n float hi = 0.5 * (temperature + 61.0 + ((temperature - 68.0) * 1.2) + (percentHumidity * 0.094));\n\n if (hi > 79) {\n hi = -42.379 +\n 2.04901523 * temperature +\n 10.14333127 * percentHumidity +\n -0.22475541 * temperature * percentHumidity +\n -0.00683783 * pow(temperature, 2) +\n -0.05481717 * pow(percentHumidity, 2) +\n 0.00122874 * pow(temperature, 2) * percentHumidity +\n 0.00085282 * temperature * pow(percentHumidity, 2) +\n -0.00000199 * pow(temperature, 2) * pow(percentHumidity, 2);\n\n if ((percentHumidity < 13) && (temperature >= 80.0) && (temperature <= 112.0))\n hi -= ((13.0 - percentHumidity) * 0.25) * sqrt((17.0 - abs(temperature - 95.0)) * 0.05882);\n\n else if ((percentHumidity > 85.0) && (temperature >= 80.0) && (temperature <= 87.0))\n hi += ((percentHumidity - 85.0) * 0.1) * ((87.0 - temperature) * 0.2);\n }\n\n hi = (hi - 32) * 0.55555;\n return hi;\n}\n\ninline double Sensor::SDD(float temperature) const {\n float a = (temperature >= 0) ? 7.5 : 7.6;\n float b = (temperature >= 0) ? 237.3 : 240.7;\n float exponent = ((a * temperature) \/ (b + temperature));\n float sdd = 6.1078 * pow(10, exponent);\n return sdd;\n}\n\ninline double Sensor::DD(float temperature, float relativeHumidity) const {\n double dd = relativeHumidity \/ 100 * SDD(temperature);\n return dd;\n}\n\ninline float Sensor::TD(float temperature, float relativeHumidity) const {\n float a = (temperature >= 0) ? 7.5 : 7.6;\n float b = (temperature >= 0) ? 237.3 : 240.7;\n float v = log10(DD(temperature, relativeHumidity) \/ 6.1078);\n float td = b * v \/ (a - v);\n return td;\n}\n\ninline float Sensor::AF(float temperature, float relativeHumidity) const {\n double dd = DD(temperature, relativeHumidity);\n float af = 216.686912909 * dd \/ (temperature + 273.15);\n return af;\n}\n\ninline void Sensor::checkHealth() {\n SensorInterface::SensorState state = sensor->state();\n String health = [](SensorInterface::SensorState state) {\n if (state == SensorInterface::ok)\n return \"ok\";\n if (state == SensorInterface::read_error)\n return \"read_error\";\n return \"unknown\";\n }(state);\n\n if (state != ss) {\n ss = state;\n sensorStateNode->setProperty(\"health\").setRetained(true).send(health);\n }\n if (ss != SensorInterface::ok) {\n errors++;\n sensorStateNode->setProperty(\"errors\").setRetained(true).send(String(errors));\n }\n}\n\ninline void Sensor::setup() {\n String type(typeSetting.get());\n if (type == dht11) {\n sensor = new DHTxx_Impl(2, DHTxx_Impl::TYPE11);\n } else if (type == dht21) {\n sensor = new DHTxx_Impl(2, DHTxx_Impl::TYPE21);\n } else if (type == dht22) {\n sensor = new DHTxx_Impl(2, DHTxx_Impl::TYPE22);\n } else if (type == bme280) {\n sensor = new BME280_Impl();\n } else if (type == sht30) {\n sensor = new SHT30_Impl();\n } else {\n sensor = new SensorInterface();\n }\n}\n\ninline bool Sensor::publish() {\n checkHealth();\n if (ss != SensorInterface::ok) {\n return false;\n }\n\n float temperature = sensor->temperature();\n float humidity = sensor->humidity();\n float preasure = sensor->preasure();\n\n String t(temperature);\n String h(humidity);\n String p(preasure);\n String hi(computeHeatIndex(temperature, humidity));\n String sdd(SDD(temperature));\n String dd(DD(temperature, humidity));\n String td(TD(temperature, humidity));\n String af(AF(temperature, humidity));\n\n Homie.getLogger() << \"Sensor reading: \" << endl <<\n \" • errors : \" << errors << endl <<\n \" • temperature : \" << t << \" °C\" << endl <<\n \" • preasure : \" << p << \" hPa\" << endl <<\n \" • relative humidity : \" << h << \" %\" << endl <<\n \" • heat index: : \" << hi << \" °C\" << endl <<\n \" • dew point temperature : \" << td << \" °C\" << endl <<\n \" • absolute humidty : \" << af << \" g\/m³\" << endl;\n\n temperatureNode->setProperty(\"absolute\").setRetained(false).send(t);\n temperatureNode->setProperty(\"heatindex\").setRetained(false).send(hi);\n humidityNode->setProperty(\"relative\").setRetained(false).send(h);\n humidityNode->setProperty(\"absolute\").setRetained(false).send(af);\n preasureNode->setProperty(\"preasure\").setRetained(false).send(p);\n\n return true;\n}\n\n#endif\n<commit_msg>Various fixes<commit_after>#ifndef _SENSOR_NODE_\n#define _SENSOR_NODE_\n\n#include <Homie.h>\n#include \"BME280_Impl.hpp\"\n#include \"DHTxx_Impl.hpp\"\n#include \"SHT30_Impl.hpp\"\n\nclass Sensor {\n public:\n Sensor();\n virtual ~Sensor();\n\n void setup();\n bool publish();\n\n private:\n \/\/ taken from adafruit DHT library\n float computeHeatIndex(float temperature, float relativeHumidity) const;\n \/\/ Sättigungsdampfdruck in hPa\n double SDD(float temperature) const;\n \/\/ Dampfdruck in hPa\n double DD(float temperature, float relativeHumidity) const;\n \/\/ Taupunkt in °C\n float TD(float temperature, float relativeHumidity) const;\n \/\/ absolute Feuchte in g Wasserdampf pro m3 Luft\n float AF(float temperature, float relativeHumidity) const;\n \/\/ check and update the health state. publish health state if it has changed.\n void checkHealth();\n\n SensorInterface *sensor;\n SensorInterface::SensorState ss;\n unsigned long errors;\n static const constexpr char* dht11 = \"dht11\";\n static const constexpr char* dht21 = \"dht21\";\n static const constexpr char* dht22 = \"dht22\";\n static const constexpr char* bme280 = \"bme280\";\n static const constexpr char* sht30 = \"sht30\";\n HomieSetting<const char*> typeSetting;\n HomieNode *sensorStateNode;\n HomieNode *temperatureNode;\n HomieNode *humidityNode;\n HomieNode *pressureNode;\n};\n\ninline Sensor::Sensor()\n : sensor(NULL)\n , ss(SensorInterface::unknown)\n , errors(0)\n , typeSetting(\"type\", \"Type of the sensor. Use either \\\"dht11\\\", \\\"dht21\\\", \\\"dht22\\\", \\\"bme280\\\" or \\\"sht30\\\"\")\n , sensorStateNode(NULL)\n , temperatureNode(NULL)\n , humidityNode(NULL)\n , pressureNode(NULL) {\n typeSetting.setDefaultValue(dht11).setValidator([] (const char* candidate) {\n return (String(candidate) == dht11) ||\n (String(candidate) == dht21) ||\n (String(candidate) == dht22) ||\n (String(candidate) == bme280) ||\n (String(candidate) == sht30);\n });\n\n sensorStateNode = new HomieNode(\"healthState\", \"healthState\");\n temperatureNode = new HomieNode(\"temperature\", \"temperature\");\n humidityNode = new HomieNode(\"humidity\", \"humidity\");\n pressureNode = new HomieNode(\"pressure\", \"pressure\");\n\n sensorStateNode->advertise(\"health\");\n sensorStateNode->advertise(\"errors\");\n temperatureNode->advertise(\"absolut\");\n temperatureNode->advertise(\"heatindex\");\n humidityNode->advertise(\"relative\");\n humidityNode->advertise(\"absolute\");\n pressureNode->advertise(\"pressure\");\n}\n\ninline Sensor::~Sensor() {\n delete pressureNode;\n delete humidityNode;\n delete temperatureNode;\n delete sensorStateNode;\n delete sensor;\n}\n\ninline float Sensor::computeHeatIndex(float temperature, float percentHumidity) const {\n \/\/ Using both Rothfusz and Steadman's equations\n \/\/ http:\/\/www.wpc.ncep.noaa.gov\/html\/heatindex_equation.shtml\n\n\n \/\/ to fahrenheit\n temperature = temperature * 1.8 + 32;\n\n float hi = 0.5 * (temperature + 61.0 + ((temperature - 68.0) * 1.2) + (percentHumidity * 0.094));\n\n if (hi > 79) {\n hi = -42.379 +\n 2.04901523 * temperature +\n 10.14333127 * percentHumidity +\n -0.22475541 * temperature * percentHumidity +\n -0.00683783 * pow(temperature, 2) +\n -0.05481717 * pow(percentHumidity, 2) +\n 0.00122874 * pow(temperature, 2) * percentHumidity +\n 0.00085282 * temperature * pow(percentHumidity, 2) +\n -0.00000199 * pow(temperature, 2) * pow(percentHumidity, 2);\n\n if ((percentHumidity < 13) && (temperature >= 80.0) && (temperature <= 112.0))\n hi -= ((13.0 - percentHumidity) * 0.25) * sqrt((17.0 - abs(temperature - 95.0)) * 0.05882);\n\n else if ((percentHumidity > 85.0) && (temperature >= 80.0) && (temperature <= 87.0))\n hi += ((percentHumidity - 85.0) * 0.1) * ((87.0 - temperature) * 0.2);\n }\n\n hi = (hi - 32) * 0.55555;\n return hi;\n}\n\ninline double Sensor::SDD(float temperature) const {\n float a = (temperature >= 0) ? 7.5 : 7.6;\n float b = (temperature >= 0) ? 237.3 : 240.7;\n float exponent = ((a * temperature) \/ (b + temperature));\n float sdd = 6.1078 * pow(10, exponent);\n return sdd;\n}\n\ninline double Sensor::DD(float temperature, float relativeHumidity) const {\n double dd = relativeHumidity \/ 100 * SDD(temperature);\n return dd;\n}\n\ninline float Sensor::TD(float temperature, float relativeHumidity) const {\n float a = (temperature >= 0) ? 7.5 : 7.6;\n float b = (temperature >= 0) ? 237.3 : 240.7;\n float v = log10(DD(temperature, relativeHumidity) \/ 6.1078);\n float td = b * v \/ (a - v);\n return td;\n}\n\ninline float Sensor::AF(float temperature, float relativeHumidity) const {\n double dd = DD(temperature, relativeHumidity);\n float af = 216.686912909 * dd \/ (temperature + 273.15);\n return af;\n}\n\ninline void Sensor::checkHealth() {\n SensorInterface::SensorState state = SensorInterface::unknown;\n if(sensor) {\n state = sensor->state();\n }\n String health = [](SensorInterface::SensorState state) {\n if (state == SensorInterface::ok)\n return \"ok\";\n if (state == SensorInterface::read_error)\n return \"read_error\";\n return \"unknown\";\n }(state);\n\n if (state != ss) {\n ss = state;\n sensorStateNode->setProperty(\"health\").setRetained(true).send(health);\n }\n if (ss != SensorInterface::ok) {\n Homie.getLogger() << \"Sensor health check failed: \" << health << endl;\n errors++;\n sensorStateNode->setProperty(\"errors\").setRetained(true).send(String(errors));\n }\n}\n\ninline void Sensor::setup() {\n String type(typeSetting.get());\n if (type == dht11) {\n sensor = new DHTxx_Impl(2, DHTxx_Impl::TYPE11);\n } else if (type == dht21) {\n sensor = new DHTxx_Impl(2, DHTxx_Impl::TYPE21);\n } else if (type == dht22) {\n sensor = new DHTxx_Impl(2, DHTxx_Impl::TYPE22);\n } else if (type == bme280) {\n sensor = new BME280_Impl();\n } else if (type == sht30) {\n sensor = new SHT30_Impl();\n } else {\n sensor = new SensorInterface();\n }\n}\n\ninline bool Sensor::publish() {\n checkHealth();\n if (ss != SensorInterface::ok) {\n return false;\n }\n\n float temperature = sensor->temperature();\n float humidity = sensor->humidity();\n float preasure = sensor->preasure();\n\n String t(temperature);\n String h(humidity);\n String p(preasure);\n String hi(computeHeatIndex(temperature, humidity));\n String sdd(SDD(temperature));\n String dd(DD(temperature, humidity));\n String td(TD(temperature, humidity));\n String af(AF(temperature, humidity));\n\n Homie.getLogger() << \"Sensor reading: \" << endl <<\n \" • errors : \" << errors << endl <<\n \" • temperature : \" << t << \" °C\" << endl <<\n \" • pressure : \" << p << \" hPa\" << endl <<\n \" • relative humidity : \" << h << \" %\" << endl <<\n \" • heat index: : \" << hi << \" °C\" << endl <<\n \" • dew point temperature : \" << td << \" °C\" << endl <<\n \" • absolute humidty : \" << af << \" g\/m³\" << endl;\n\n temperatureNode->setProperty(\"absolute\").setRetained(false).send(t);\n temperatureNode->setProperty(\"heatindex\").setRetained(false).send(hi);\n humidityNode->setProperty(\"relative\").setRetained(false).send(h);\n humidityNode->setProperty(\"absolute\").setRetained(false).send(af);\n pressureNode->setProperty(\"pressure\").setRetained(false).send(p);\n\n return true;\n}\n\n#endif\n<|endoftext|>"} {"text":"<commit_before>\n#include \"include\/Shapes.h\"\n\ndouble sumOfArea(const std::vector<Shape *> & shapes) {\n\n double total =0;\n\n for (Shape *shapePoint: shapes)\n total += shapePoint->area();\n\n return total;\n\n}\n\ndouble sumOfPerimeter(const std::vector<Shape *> & shapes){\n\n double total = 0;\n\n for (Shape *shapePoint: shapes)\n total += shapePoint->perimeter();\n\n return total;\n\n}\n\nShape* theLargestArea(const std::vector<Shape *> & shapes){\n\n Shape *largestShape = nullptr;\n double largestArea = 0;\n\n for (Shape *shapePoint: shapes)\n if(shapePoint->area() >= largestArea){\n largestArea = shapePoint->area();\n largestShape = shapePoint;\n }\n\n return largestShape;\n\n}\n\ndouble distanceOfVertexs(const vertex vertex_1, const vertex vertex_2) {\n double diff_X, diff_Y, distance;\n\n diff_X = vertex_1.x - vertex_2.x;\n diff_Y = vertex_1.y - vertex_2.y;\n\n distance = sqrt(((diff_X * diff_X) + (diff_Y * diff_Y)));\n\n return distance;\n}\n\nvoid sortByDecreasingPerimeter(std::vector<Shape *> & shapes) {\n \/\/ use the shakeSort\n int left = 0;\n int right = shapes.size()-1;\n int shift = 0;\n Shape *temp;\n\n while(left < right){\n for(int i = left; i < right; i++) {\n if(shapes[i]->perimeter() < shapes[i+1]->perimeter()){\n temp = shapes[i];\n shapes[i] = shapes[i+1];\n shapes[i+1] = temp;\n shift = i;\n }\n }\n right = shift;\n for(int i = right; i > left; i--){\n if(shapes[i]->perimeter() > shapes[i-1]->perimeter()){\n temp = shapes[i];\n shapes[i] = shapes[i-1];\n shapes[i-1] = temp;\n shift = i;\n }\n }\n left = shift;\n }\n}\n<commit_msg>Delete Shapes.cpp<commit_after><|endoftext|>"} {"text":"<commit_before>\/*\n * Copyright 2015-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\/fibers\/FiberManagerMap.h>\n\n#include <memory>\n#include <unordered_map>\n\n#include <folly\/Function.h>\n#include <folly\/Synchronized.h>\n#include <folly\/ThreadLocal.h>\n\nnamespace folly {\nnamespace fibers {\n\nnamespace {\n\ntemplate <typename EventBaseT>\nFunction<void()> makeOnEventBaseDestructionCallback(EventBaseT& evb);\n\ntemplate <typename EventBaseT>\nclass GlobalCache {\n public:\n static FiberManager& get(EventBaseT& evb, const FiberManager::Options& opts) {\n return instance().getImpl(evb, opts);\n }\n\n static std::unique_ptr<FiberManager> erase(EventBaseT& evb) {\n return instance().eraseImpl(evb);\n }\n\n private:\n GlobalCache() {}\n\n \/\/ Leak this intentionally. During shutdown, we may call getFiberManager,\n \/\/ and want access to the fiber managers during that time.\n static GlobalCache& instance() {\n static auto ret = new GlobalCache();\n return *ret;\n }\n\n FiberManager& getImpl(EventBaseT& evb, const FiberManager::Options& opts) {\n std::lock_guard<std::mutex> lg(mutex_);\n\n auto& fmPtrRef = map_[&evb];\n\n if (!fmPtrRef) {\n auto loopController = std::make_unique<EventBaseLoopController>();\n loopController->attachEventBase(evb);\n evb.runOnDestruction(makeOnEventBaseDestructionCallback(evb));\n fmPtrRef =\n std::make_unique<FiberManager>(std::move(loopController), opts);\n }\n\n return *fmPtrRef;\n }\n\n std::unique_ptr<FiberManager> eraseImpl(EventBaseT& evb) {\n std::lock_guard<std::mutex> lg(mutex_);\n\n DCHECK_EQ(map_.count(&evb), 1u);\n\n auto ret = std::move(map_[&evb]);\n map_.erase(&evb);\n return ret;\n }\n\n std::mutex mutex_;\n std::unordered_map<EventBaseT*, std::unique_ptr<FiberManager>> map_;\n};\n\nconstexpr size_t kEraseListMaxSize = 64;\n\ntemplate <typename EventBaseT>\nclass ThreadLocalCache {\n public:\n static FiberManager& get(EventBaseT& evb, const FiberManager::Options& opts) {\n return instance()->getImpl(evb, opts);\n }\n\n static void erase(EventBaseT& evb) {\n for (auto& localInstance : instance().accessAllThreads()) {\n localInstance.eraseInfo_.withWLock([&](auto& info) {\n if (info.eraseList.size() >= kEraseListMaxSize) {\n info.eraseAll = true;\n } else {\n info.eraseList.push_back(&evb);\n }\n localInstance.eraseRequested_ = true;\n });\n }\n }\n\n private:\n ThreadLocalCache() {}\n\n struct ThreadLocalCacheTag {};\n using ThreadThreadLocalCache =\n ThreadLocal<ThreadLocalCache, ThreadLocalCacheTag>;\n\n \/\/ Leak this intentionally. During shutdown, we may call getFiberManager,\n \/\/ and want access to the fiber managers during that time.\n static ThreadThreadLocalCache& instance() {\n static auto ret =\n new ThreadThreadLocalCache([]() { return new ThreadLocalCache(); });\n return *ret;\n }\n\n FiberManager& getImpl(EventBaseT& evb, const FiberManager::Options& opts) {\n eraseImpl();\n\n auto& fmPtrRef = map_[&evb];\n if (!fmPtrRef) {\n fmPtrRef = &GlobalCache<EventBaseT>::get(evb, opts);\n }\n\n DCHECK(fmPtrRef != nullptr);\n\n return *fmPtrRef;\n }\n\n void eraseImpl() {\n if (!eraseRequested_.load()) {\n return;\n }\n\n eraseInfo_.withWLock([&](auto& info) {\n if (info.eraseAll) {\n map_.clear();\n } else {\n for (auto evbPtr : info.eraseList) {\n map_.erase(evbPtr);\n }\n }\n\n info.eraseList.clear();\n info.eraseAll = false;\n eraseRequested_ = false;\n });\n }\n\n std::unordered_map<EventBaseT*, FiberManager*> map_;\n std::atomic<bool> eraseRequested_{false};\n\n struct EraseInfo {\n bool eraseAll{false};\n std::vector<EventBaseT*> eraseList;\n };\n\n folly::Synchronized<EraseInfo> eraseInfo_;\n};\n\ntemplate <typename EventBaseT>\nFunction<void()> makeOnEventBaseDestructionCallback(EventBaseT& evb) {\n return [&evb] {\n auto fm = GlobalCache<EventBaseT>::erase(evb);\n DCHECK(fm.get() != nullptr);\n ThreadLocalCache<EventBaseT>::erase(evb);\n };\n}\n\n} \/\/ namespace\n\nFiberManager& getFiberManager(\n EventBase& evb,\n const FiberManager::Options& opts) {\n return ThreadLocalCache<EventBase>::get(evb, opts);\n}\n\nFiberManager& getFiberManager(\n VirtualEventBase& evb,\n const FiberManager::Options& opts) {\n return ThreadLocalCache<VirtualEventBase>::get(evb, opts);\n}\n} \/\/ namespace fibers\n} \/\/ namespace folly\n<commit_msg>Don't hold GlobalCache mutex while scheduling OnDestruction callback<commit_after>\/*\n * Copyright 2015-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\/fibers\/FiberManagerMap.h>\n\n#include <memory>\n#include <unordered_map>\n\n#include <folly\/Function.h>\n#include <folly\/ScopeGuard.h>\n#include <folly\/Synchronized.h>\n#include <folly\/ThreadLocal.h>\n\nnamespace folly {\nnamespace fibers {\n\nnamespace {\n\ntemplate <typename EventBaseT>\nFunction<void()> makeOnEventBaseDestructionCallback(EventBaseT& evb);\n\ntemplate <typename EventBaseT>\nclass GlobalCache {\n public:\n static FiberManager& get(EventBaseT& evb, const FiberManager::Options& opts) {\n return instance().getImpl(evb, opts);\n }\n\n static std::unique_ptr<FiberManager> erase(EventBaseT& evb) {\n return instance().eraseImpl(evb);\n }\n\n private:\n GlobalCache() {}\n\n \/\/ Leak this intentionally. During shutdown, we may call getFiberManager,\n \/\/ and want access to the fiber managers during that time.\n static GlobalCache& instance() {\n static auto ret = new GlobalCache();\n return *ret;\n }\n\n FiberManager& getImpl(EventBaseT& evb, const FiberManager::Options& opts) {\n bool constructed = false;\n SCOPE_EXIT {\n if (constructed) {\n evb.runOnDestruction(makeOnEventBaseDestructionCallback(evb));\n }\n };\n\n std::lock_guard<std::mutex> lg(mutex_);\n\n auto& fmPtrRef = map_[&evb];\n\n if (!fmPtrRef) {\n constructed = true;\n auto loopController = std::make_unique<EventBaseLoopController>();\n loopController->attachEventBase(evb);\n fmPtrRef =\n std::make_unique<FiberManager>(std::move(loopController), opts);\n }\n\n return *fmPtrRef;\n }\n\n std::unique_ptr<FiberManager> eraseImpl(EventBaseT& evb) {\n std::lock_guard<std::mutex> lg(mutex_);\n\n DCHECK_EQ(map_.count(&evb), 1u);\n\n auto ret = std::move(map_[&evb]);\n map_.erase(&evb);\n return ret;\n }\n\n std::mutex mutex_;\n std::unordered_map<EventBaseT*, std::unique_ptr<FiberManager>> map_;\n};\n\nconstexpr size_t kEraseListMaxSize = 64;\n\ntemplate <typename EventBaseT>\nclass ThreadLocalCache {\n public:\n static FiberManager& get(EventBaseT& evb, const FiberManager::Options& opts) {\n return instance()->getImpl(evb, opts);\n }\n\n static void erase(EventBaseT& evb) {\n for (auto& localInstance : instance().accessAllThreads()) {\n localInstance.eraseInfo_.withWLock([&](auto& info) {\n if (info.eraseList.size() >= kEraseListMaxSize) {\n info.eraseAll = true;\n } else {\n info.eraseList.push_back(&evb);\n }\n localInstance.eraseRequested_ = true;\n });\n }\n }\n\n private:\n ThreadLocalCache() {}\n\n struct ThreadLocalCacheTag {};\n using ThreadThreadLocalCache =\n ThreadLocal<ThreadLocalCache, ThreadLocalCacheTag>;\n\n \/\/ Leak this intentionally. During shutdown, we may call getFiberManager,\n \/\/ and want access to the fiber managers during that time.\n static ThreadThreadLocalCache& instance() {\n static auto ret =\n new ThreadThreadLocalCache([]() { return new ThreadLocalCache(); });\n return *ret;\n }\n\n FiberManager& getImpl(EventBaseT& evb, const FiberManager::Options& opts) {\n eraseImpl();\n\n auto& fmPtrRef = map_[&evb];\n if (!fmPtrRef) {\n fmPtrRef = &GlobalCache<EventBaseT>::get(evb, opts);\n }\n\n DCHECK(fmPtrRef != nullptr);\n\n return *fmPtrRef;\n }\n\n void eraseImpl() {\n if (!eraseRequested_.load()) {\n return;\n }\n\n eraseInfo_.withWLock([&](auto& info) {\n if (info.eraseAll) {\n map_.clear();\n } else {\n for (auto evbPtr : info.eraseList) {\n map_.erase(evbPtr);\n }\n }\n\n info.eraseList.clear();\n info.eraseAll = false;\n eraseRequested_ = false;\n });\n }\n\n std::unordered_map<EventBaseT*, FiberManager*> map_;\n std::atomic<bool> eraseRequested_{false};\n\n struct EraseInfo {\n bool eraseAll{false};\n std::vector<EventBaseT*> eraseList;\n };\n\n folly::Synchronized<EraseInfo> eraseInfo_;\n};\n\ntemplate <typename EventBaseT>\nFunction<void()> makeOnEventBaseDestructionCallback(EventBaseT& evb) {\n return [&evb] {\n auto fm = GlobalCache<EventBaseT>::erase(evb);\n DCHECK(fm.get() != nullptr);\n ThreadLocalCache<EventBaseT>::erase(evb);\n };\n}\n\n} \/\/ namespace\n\nFiberManager& getFiberManager(\n EventBase& evb,\n const FiberManager::Options& opts) {\n return ThreadLocalCache<EventBase>::get(evb, opts);\n}\n\nFiberManager& getFiberManager(\n VirtualEventBase& evb,\n const FiberManager::Options& opts) {\n return ThreadLocalCache<VirtualEventBase>::get(evb, opts);\n}\n} \/\/ namespace fibers\n} \/\/ namespace folly\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 \"itkGradientDescentObjectOptimizerBase.h\"\n#include \"itkObjectToObjectMetric.h\"\n#include \"itkImage.h\"\n#include \"itkTestingMacros.h\"\n\n\/* Create a simple metric to use for testing here. *\/\ntemplate< class TFixedObject, class TMovingObject >\nclass ITK_EXPORT GradientDescentObjectOptimizerBaseTestMetric:\n public itk::ObjectToObjectMetric\n{\npublic:\n \/** Standard class typedefs. *\/\n typedef GradientDescentObjectOptimizerBaseTestMetric Self;\n typedef itk::ObjectToObjectMetric Superclass;\n typedef itk::SmartPointer< Self > Pointer;\n typedef itk::SmartPointer< const Self > ConstPointer;\n\n typedef typename Superclass::MeasureType MeasureType;\n typedef typename Superclass::DerivativeType DerivativeType;\n typedef typename Superclass::ParametersType ParametersType;\n typedef typename Superclass::ParametersValueType ParametersValueType;\n\n itkTypeMacro(GradientDescentObjectOptimizerBaseTestMetric, ObjectToObjectMetric);\n\n itkNewMacro(Self);\n\n \/\/ Pure virtual functions that all Metrics must provide\n unsigned int GetNumberOfParameters() const { return 5; }\n\n using Superclass::GetValue;\n MeasureType GetValue()\n {\n return itk::NumericTraits< MeasureType >::One;\n }\n\n using Superclass::GetValueAndDerivative;\n void GetValueAndDerivative( MeasureType & value, DerivativeType & derivative )\n {\n value = itk::NumericTraits< MeasureType >::One;\n derivative.Fill( itk::NumericTraits< ParametersValueType >::Zero );\n }\n\n unsigned int GetNumberOfLocalParameters() const\n { return 0; }\n\n bool HasLocalSupport() const\n { return false; }\n\n void UpdateTransformParameters( DerivativeType &, ParametersValueType ) {}\n\n const ParametersType & GetParameters() const\n { return m_Parameters; }\n\n void Initialize(void) throw ( itk::ExceptionObject ) {}\n\n void PrintSelf(std::ostream& os, itk::Indent indent) const\n { Superclass::PrintSelf( os, indent ); }\n\nprotected:\n GradientDescentObjectOptimizerBaseTestMetric() {}\n ~GradientDescentObjectOptimizerBaseTestMetric() {}\/\/purposely not implemented\n\nprivate:\n GradientDescentObjectOptimizerBaseTestMetric( const Self& ); \/\/purposely not implemented\n void operator = ( const Self& ); \/\/purposely not implemented\n\n ParametersType m_Parameters;\n};\n\n\/* Define a simple derived optimizer class.\n * \\class GradientDescentObjectOptimizerBaseTestOptimizer *\/\nclass GradientDescentObjectOptimizerBaseTestOptimizer\n : public itk::GradientDescentObjectOptimizerBase\n{\npublic:\n \/** Standard \"Self\" typedef. *\/\n typedef GradientDescentObjectOptimizerBaseTestOptimizer Self;\n typedef GradientDescentObjectOptimizerBase Superclass;\n typedef itk::SmartPointer< Self > Pointer;\n typedef itk::SmartPointer< const Self > ConstPointer;\n\n \/** Method for creation through the object factory. *\/\n itkNewMacro(Self);\n\n \/** Run-time type information (and related methods). *\/\n itkTypeMacro( GradientDescentObjectOptimizerBaseTestOptimizer,\n GradientDescentObjectOptimizerBase);\n\n \/* Provide an override for the pure virtual StartOptimization *\/\n void StartOptimization()\n {\n std::cout << \"StartOptimization called.\" << std::endl;\n }\n\n void ResumeOptimization()\n {\n std::cout << \"StartOptimization called.\" << std::endl;\n }\n\n void ModifyGradient()\n {\n std::cout << \"ModifyGradient called.\" << std::endl;\n }\n\n void ModifyGradientOverSubRange (const IndexRangeType& )\n {\n std::cout << \"ModifyGradientOverSubRange called.\" << std::endl;\n }\n\nprotected:\n GradientDescentObjectOptimizerBaseTestOptimizer(){}\n ~GradientDescentObjectOptimizerBaseTestOptimizer(){}\n\nprivate:\n GradientDescentObjectOptimizerBaseTestOptimizer(const Self& ); \/\/purposely not implemented\n void operator = (const Self&); \/\/purposely not implemented\n\n};\n\n\/**\n *\/\nint itkGradientDescentObjectOptimizerBaseTest(int , char* [])\n{\n const int ImageDimension = 2;\n typedef itk::Image<double, ImageDimension> ImageType;\n\n typedef GradientDescentObjectOptimizerBaseTestMetric<ImageType,ImageType> MetricType;\n\n MetricType::Pointer metric = MetricType::New();\n GradientDescentObjectOptimizerBaseTestOptimizer::Pointer optimizer = GradientDescentObjectOptimizerBaseTestOptimizer::New();\n\n \/* exercise some methods *\/\n optimizer->SetMetric( metric );\n if( optimizer->GetMetric() != metric )\n {\n std::cerr << \"Set\/GetMetric failed.\" << std::endl;\n return EXIT_FAILURE;\n }\n\n std::cout << \"value: \" << optimizer->GetValue() << std::endl;\n\n optimizer->SetNumberOfThreads( 1 );\n\n TRY_EXPECT_NO_EXCEPTION( optimizer->StartOptimization() );\n\n std::cout << \"Printing self..\" << std::endl;\n std::cout << optimizer << std::endl;\n\n std::cout << \"Test passed.\" << std::endl;\n return EXIT_SUCCESS;\n}\n<commit_msg>BUG: Fix another error in GradientDescentObjectOptimizerBaseTest.<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 \"itkGradientDescentObjectOptimizerBase.h\"\n#include \"itkObjectToObjectMetric.h\"\n#include \"itkImage.h\"\n#include \"itkTestingMacros.h\"\n\n\/* Create a simple metric to use for testing here. *\/\ntemplate< class TFixedObject, class TMovingObject >\nclass ITK_EXPORT GradientDescentObjectOptimizerBaseTestMetric:\n public itk::ObjectToObjectMetric\n{\npublic:\n \/** Standard class typedefs. *\/\n typedef GradientDescentObjectOptimizerBaseTestMetric Self;\n typedef itk::ObjectToObjectMetric Superclass;\n typedef itk::SmartPointer< Self > Pointer;\n typedef itk::SmartPointer< const Self > ConstPointer;\n\n typedef typename Superclass::MeasureType MeasureType;\n typedef typename Superclass::DerivativeType DerivativeType;\n typedef typename Superclass::ParametersType ParametersType;\n typedef typename Superclass::ParametersValueType ParametersValueType;\n\n itkTypeMacro(GradientDescentObjectOptimizerBaseTestMetric, ObjectToObjectMetric);\n\n itkNewMacro(Self);\n\n \/\/ Pure virtual functions that all Metrics must provide\n unsigned int GetNumberOfParameters() const { return 5; }\n\n MeasureType GetValue() const\n {\n return itk::NumericTraits< MeasureType >::One;\n }\n\n void GetValueAndDerivative( MeasureType & value, DerivativeType & derivative ) const\n {\n value = itk::NumericTraits< MeasureType >::One;\n derivative.Fill( itk::NumericTraits< ParametersValueType >::Zero );\n }\n\n unsigned int GetNumberOfLocalParameters() const\n { return 0; }\n\n bool HasLocalSupport() const\n { return false; }\n\n void UpdateTransformParameters( DerivativeType &, ParametersValueType ) {}\n\n const ParametersType & GetParameters() const\n { return m_Parameters; }\n\n void Initialize(void) throw ( itk::ExceptionObject ) {}\n\n void PrintSelf(std::ostream& os, itk::Indent indent) const\n { Superclass::PrintSelf( os, indent ); }\n\nprotected:\n GradientDescentObjectOptimizerBaseTestMetric() {}\n ~GradientDescentObjectOptimizerBaseTestMetric() {}\/\/purposely not implemented\n\nprivate:\n GradientDescentObjectOptimizerBaseTestMetric( const Self& ); \/\/purposely not implemented\n void operator = ( const Self& ); \/\/purposely not implemented\n\n ParametersType m_Parameters;\n};\n\n\/* Define a simple derived optimizer class.\n * \\class GradientDescentObjectOptimizerBaseTestOptimizer *\/\nclass GradientDescentObjectOptimizerBaseTestOptimizer\n : public itk::GradientDescentObjectOptimizerBase\n{\npublic:\n \/** Standard \"Self\" typedef. *\/\n typedef GradientDescentObjectOptimizerBaseTestOptimizer Self;\n typedef GradientDescentObjectOptimizerBase Superclass;\n typedef itk::SmartPointer< Self > Pointer;\n typedef itk::SmartPointer< const Self > ConstPointer;\n\n \/** Method for creation through the object factory. *\/\n itkNewMacro(Self);\n\n \/** Run-time type information (and related methods). *\/\n itkTypeMacro( GradientDescentObjectOptimizerBaseTestOptimizer,\n GradientDescentObjectOptimizerBase);\n\n \/* Provide an override for the pure virtual StartOptimization *\/\n void StartOptimization()\n {\n std::cout << \"StartOptimization called.\" << std::endl;\n }\n\n void ResumeOptimization()\n {\n std::cout << \"StartOptimization called.\" << std::endl;\n }\n\n void ModifyGradient()\n {\n std::cout << \"ModifyGradient called.\" << std::endl;\n }\n\n void ModifyGradientOverSubRange (const IndexRangeType& )\n {\n std::cout << \"ModifyGradientOverSubRange called.\" << std::endl;\n }\n\nprotected:\n GradientDescentObjectOptimizerBaseTestOptimizer(){}\n ~GradientDescentObjectOptimizerBaseTestOptimizer(){}\n\nprivate:\n GradientDescentObjectOptimizerBaseTestOptimizer(const Self& ); \/\/purposely not implemented\n void operator = (const Self&); \/\/purposely not implemented\n\n};\n\n\/**\n *\/\nint itkGradientDescentObjectOptimizerBaseTest(int , char* [])\n{\n const int ImageDimension = 2;\n typedef itk::Image<double, ImageDimension> ImageType;\n\n typedef GradientDescentObjectOptimizerBaseTestMetric<ImageType,ImageType> MetricType;\n\n MetricType::Pointer metric = MetricType::New();\n GradientDescentObjectOptimizerBaseTestOptimizer::Pointer optimizer = GradientDescentObjectOptimizerBaseTestOptimizer::New();\n\n \/* exercise some methods *\/\n optimizer->SetMetric( metric );\n if( optimizer->GetMetric() != metric )\n {\n std::cerr << \"Set\/GetMetric failed.\" << std::endl;\n return EXIT_FAILURE;\n }\n\n std::cout << \"value: \" << optimizer->GetValue() << std::endl;\n\n optimizer->SetNumberOfThreads( 1 );\n\n TRY_EXPECT_NO_EXCEPTION( optimizer->StartOptimization() );\n\n std::cout << \"Printing self..\" << std::endl;\n std::cout << optimizer << std::endl;\n\n std::cout << \"Test passed.\" << std::endl;\n return EXIT_SUCCESS;\n}\n<|endoftext|>"} {"text":"<commit_before>\/\/ trance escape_sequence.hpp - Generic Escape Sequence Manipulator\n\/\/\n\/\/ Copyright (c) 2011 - 2011 Kohei Takahashi (Flast)\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 IG_TRANCE_IOSTREAMS_ESCAPE_SEQUENCE_HPP_ONCE_\n#define IG_TRANCE_IOSTREAMS_ESCAPE_SEQUENCE_HPP_ONCE_\n\n#include <trance\/config.hpp>\n\n#include <iosfwd>\n\n#include <boost\/cstdint.hpp>\n\n#include <boost\/preprocessor\/dec.hpp>\n#include <boost\/preprocessor\/iterate.hpp>\n\nnamespace trance\n{\n\nnamespace iostreams\n{\n\n\/\/#define STRING_MANIPS_COUNT 1\n\/\/#define STRING_MANIPS \\\n\/\/ ( \\\n\/\/ ( reset, \"\\x1b[0m\" ), \\\n\/\/()) \\\n\/\/\n\/\/#define BOOST_PP_ITERATION_PARAMS_1 \\\n\/\/ ( 3, ( 0, BOOST_PP_DEC( STRING_MANIPS_COUNT ), <trance\/iostreams\/detail\/manip_string.hpp> ) )\n\/\/#include BOOST_PP_ITERATE()\n\/\/#undef STRING_MANIPS\n\/\/#undef STRING_MANIPS_COUNT\n\nstruct attribute\n{\n typedef ::boost::uint32_t value_type;\n\n BOOST_STATIC_CONSTEXPR value_type reset = ~static_cast< ::boost::uint32_t >( 0u ); \/\/ [0m\n\n BOOST_STATIC_CONSTEXPR value_type highlight = 1u << 0; \/\/ [1m\n \/\/BOOST_STATIC_CONSTEXPR value_type ??? = 1u << 1; \/\/ [2m\n BOOST_STATIC_CONSTEXPR value_type underline = 1u << 3; \/\/ [4m\n \/\/BOOST_STATIC_CONSTEXPR value_type blink = 1u << 4; \/\/ [5m\n BOOST_STATIC_CONSTEXPR value_type inverse = 1u << 6; \/\/ [7m\n \/\/BOOST_STATIC_CONSTEXPR value_type invisible = 1u << 7; \/\/ [8m or [16m\n BOOST_STATIC_CONSTEXPR value_type _effect_mask = ( 1u << 8 ) - 1;\n\n BOOST_STATIC_CONSTEXPR value_type black = 1u << 8; \/\/ [30m\n BOOST_STATIC_CONSTEXPR value_type red = 1u << 9; \/\/ [31m or [17m\n BOOST_STATIC_CONSTEXPR value_type green = 1u << 10; \/\/ [32m or [18m\n BOOST_STATIC_CONSTEXPR value_type yellow = 1u << 11; \/\/ [33m or [19m\n BOOST_STATIC_CONSTEXPR value_type blue = 1u << 12; \/\/ [34m or [20m\n BOOST_STATIC_CONSTEXPR value_type purple = 1u << 13; \/\/ [35m or [21m\n BOOST_STATIC_CONSTEXPR value_type cyan = 1u << 14; \/\/ [36m or [22m\n BOOST_STATIC_CONSTEXPR value_type white = 1u << 15; \/\/ [37m or [23m\n BOOST_STATIC_CONSTEXPR value_type _color_mask = ( ( 1u << 8 ) - 1 ) << 8;\n\n BOOST_STATIC_CONSTEXPR value_type back_black = 1u << 16; \/\/ [40m\n BOOST_STATIC_CONSTEXPR value_type back_red = 1u << 17; \/\/ [41m\n BOOST_STATIC_CONSTEXPR value_type back_green = 1u << 18; \/\/ [42m\n BOOST_STATIC_CONSTEXPR value_type back_yellow = 1u << 19; \/\/ [43m\n BOOST_STATIC_CONSTEXPR value_type back_blue = 1u << 20; \/\/ [44m\n BOOST_STATIC_CONSTEXPR value_type back_purple = 1u << 21; \/\/ [45m\n BOOST_STATIC_CONSTEXPR value_type back_cyan = 1u << 22; \/\/ [46m\n BOOST_STATIC_CONSTEXPR value_type back_white = 1u << 23; \/\/ [47m\n BOOST_STATIC_CONSTEXPR value_type _backcolor_mask = ( ( 1u << 8 ) - 1 ) << 16;\n};\n\nnamespace iostreams_detail\n{\n\nstruct _attribute_forwarder\n{ attribute::value_type _M_value; };\n\ninline size_t\n_find_ntz( ::boost::uint8_t _x )\n{\n ::std::size_t i = 0;\n for ( ; !( _x & 1 ); ++i, _x >>= 1 );\n return i;\n}\n\ntemplate < typename _CharT, typename _Traits >\ninline ::std::basic_ostream< _CharT, _Traits > &\noperator<<( ::std::basic_ostream< _CharT, _Traits > &_ostr,\n const _attribute_forwarder &_af ) TRANCE_NOEXCEPT\n{\n _CharT _buf[ 16 ] = { '\\x1b', '[' };\n ::std::size_t idx = 2;\n if ( _af._M_value == attribute::reset )\n { _buf[ idx++ ] = '0'; }\n else\n {\n if ( ::boost::uint8_t _tmp = _af._M_value & attribute::_effect_mask )\n {\n _CharT c = '1';\n for ( ; _tmp; _tmp >>= 1, ++c )\n {\n if ( _tmp & 1 )\n {\n if ( idx != 2 )\n { _buf[ idx++ ] = ';'; }\n _buf[ idx++ ] = c;\n }\n }\n }\n if ( ::boost::uint8_t _tmp = ( _af._M_value & attribute::_color_mask ) >> 8 )\n {\n if ( idx != 2 )\n { _buf[ idx++ ] = ';'; }\n _buf[ idx++ ] = '3';\n _buf[ idx++ ] = '0' + _find_ntz( _tmp );\n }\n if ( ::boost::uint8_t _tmp = ( _af._M_value & attribute::_backcolor_mask ) >> 16 )\n {\n if ( idx != 2 )\n { _buf[ idx++ ] = ';'; }\n _buf[ idx++ ] = '4';\n _buf[ idx++ ] = '0' + _find_ntz( _tmp );\n }\n }\n\n _buf[ idx ] = 'm';\n _ostr << _buf;\n return _ostr;\n}\n\n} \/\/ iostreams_detail\n\ninline iostreams_detail::_attribute_forwarder\nchattr( attribute::value_type attr = attribute::reset ) TRANCE_NOEXCEPT\n{ return { attr }; }\n\n} \/\/ namespace iostreams\n\n} \/\/ namespace trance\n\n\n#endif \/\/ IG_TRANCE_IOSTREAMS_ESCAPE_SEQUENCE_HPP_ONCE_\n\n<commit_msg>code refactoring<commit_after>\/\/ trance escape_sequence.hpp - Generic Escape Sequence Manipulator\n\/\/\n\/\/ Copyright (c) 2011 - 2011 Kohei Takahashi (Flast)\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 IG_TRANCE_IOSTREAMS_ESCAPE_SEQUENCE_HPP_ONCE_\n#define IG_TRANCE_IOSTREAMS_ESCAPE_SEQUENCE_HPP_ONCE_\n\n#include <trance\/config.hpp>\n\n#include <iosfwd>\n\n#include <boost\/cstdint.hpp>\n\n#include <boost\/preprocessor\/dec.hpp>\n#include <boost\/preprocessor\/iterate.hpp>\n\nnamespace trance\n{\n\nnamespace iostreams\n{\n\n\/\/#define STRING_MANIPS_COUNT 1\n\/\/#define STRING_MANIPS \\\n\/\/ ( \\\n\/\/ ( reset, \"\\x1b[0m\" ), \\\n\/\/()) \\\n\/\/\n\/\/#define BOOST_PP_ITERATION_PARAMS_1 \\\n\/\/ ( 3, ( 0, BOOST_PP_DEC( STRING_MANIPS_COUNT ), <trance\/iostreams\/detail\/manip_string.hpp> ) )\n\/\/#include BOOST_PP_ITERATE()\n\/\/#undef STRING_MANIPS\n\/\/#undef STRING_MANIPS_COUNT\n\nstruct attribute\n{\n typedef ::boost::uint32_t value_type;\n\n BOOST_STATIC_CONSTEXPR value_type reset = ~static_cast< ::boost::uint32_t >( 0u ); \/\/ [0m\n\n BOOST_STATIC_CONSTEXPR value_type highlight = 1u << 0; \/\/ [1m\n \/\/BOOST_STATIC_CONSTEXPR value_type ??? = 1u << 1; \/\/ [2m\n BOOST_STATIC_CONSTEXPR value_type underline = 1u << 3; \/\/ [4m\n \/\/BOOST_STATIC_CONSTEXPR value_type blink = 1u << 4; \/\/ [5m\n BOOST_STATIC_CONSTEXPR value_type inverse = 1u << 6; \/\/ [7m\n \/\/BOOST_STATIC_CONSTEXPR value_type invisible = 1u << 7; \/\/ [8m or [16m\n BOOST_STATIC_CONSTEXPR value_type _effect_mask = ( 1u << 8 ) - 1;\n\n BOOST_STATIC_CONSTEXPR value_type black = 1u << 8; \/\/ [30m\n BOOST_STATIC_CONSTEXPR value_type red = 1u << 9; \/\/ [31m or [17m\n BOOST_STATIC_CONSTEXPR value_type green = 1u << 10; \/\/ [32m or [18m\n BOOST_STATIC_CONSTEXPR value_type yellow = 1u << 11; \/\/ [33m or [19m\n BOOST_STATIC_CONSTEXPR value_type blue = 1u << 12; \/\/ [34m or [20m\n BOOST_STATIC_CONSTEXPR value_type purple = 1u << 13; \/\/ [35m or [21m\n BOOST_STATIC_CONSTEXPR value_type cyan = 1u << 14; \/\/ [36m or [22m\n BOOST_STATIC_CONSTEXPR value_type white = 1u << 15; \/\/ [37m or [23m\n BOOST_STATIC_CONSTEXPR value_type _color_mask = ( ( 1u << 8 ) - 1 ) << 8;\n\n BOOST_STATIC_CONSTEXPR value_type back_black = 1u << 16; \/\/ [40m\n BOOST_STATIC_CONSTEXPR value_type back_red = 1u << 17; \/\/ [41m\n BOOST_STATIC_CONSTEXPR value_type back_green = 1u << 18; \/\/ [42m\n BOOST_STATIC_CONSTEXPR value_type back_yellow = 1u << 19; \/\/ [43m\n BOOST_STATIC_CONSTEXPR value_type back_blue = 1u << 20; \/\/ [44m\n BOOST_STATIC_CONSTEXPR value_type back_purple = 1u << 21; \/\/ [45m\n BOOST_STATIC_CONSTEXPR value_type back_cyan = 1u << 22; \/\/ [46m\n BOOST_STATIC_CONSTEXPR value_type back_white = 1u << 23; \/\/ [47m\n BOOST_STATIC_CONSTEXPR value_type _backcolor_mask = ( ( 1u << 8 ) - 1 ) << 16;\n};\n\nnamespace iostreams_detail\n{\n\nstruct _attribute_forwarder\n{ attribute::value_type _M_value; };\n\ninline size_t\n_find_ntz( ::boost::uint8_t _x ) TRANCE_NOEXCEPT\n{\n ::std::size_t i = 0;\n for ( ; !( _x & 1 ); ++i, _x >>= 1 );\n return i;\n}\n\ninline ::boost::uint8_t\n_mask( attribute::value_type _x ) TRANCE_NOEXCEPT\n{ return _x & ( ( 1u << 8 ) - 1 ); }\n\n#define INSERT_SEMICOLON_WHEN( begin, itr ) \\\n if ( begin == itr ) {} else *itr++ =';'\n\ntemplate < typename _CharT >\ninline void\n_insert_when( ::boost::uint8_t pred,\n _CharT * const begin, _CharT *&itr, const _CharT value ) TRANCE_NOEXCEPT\n{\n if ( !pred )\n { return; }\n\n INSERT_SEMICOLON_WHEN( begin, itr );\n *itr++ = value;\n *itr++ = '0' + _find_ntz( pred );\n}\n\ntemplate < typename _CharT, typename _Traits >\ninline ::std::basic_ostream< _CharT, _Traits > &\noperator<<( ::std::basic_ostream< _CharT, _Traits > &_ostr,\n const _attribute_forwarder &_af ) TRANCE_NOEXCEPT\n{\n _CharT _buf[ 16 ] = { '\\x1b', '[' };\n _CharT *itr = _buf + 2;\n if ( _af._M_value == attribute::reset )\n { *itr++ = '0'; }\n else\n {\n if ( ::boost::uint8_t _tmp = _mask( _af._M_value ) )\n {\n for ( _CharT c = '1'; _tmp; _tmp >>= 1, ++c )\n {\n if ( _tmp & ~1 )\n { continue; }\n\n INSERT_SEMICOLON_WHEN( _buf, itr );\n *itr++ = c;\n }\n }\n _insert_when( _mask( _af._M_value >> 8 ), _buf, itr, '3' );\n _insert_when( _mask( _af._M_value >> 16 ), _buf, itr, '4' );\n }\n\n *itr = 'm';\n _ostr << _buf;\n return _ostr;\n}\n#undef INSERT_SEMICOLON_WHEN\n\n} \/\/ iostreams_detail\n\ninline iostreams_detail::_attribute_forwarder\nchattr( attribute::value_type attr = attribute::reset ) TRANCE_NOEXCEPT\n{ return { attr }; }\n\n} \/\/ namespace iostreams\n\n} \/\/ namespace trance\n\n\n#endif \/\/ IG_TRANCE_IOSTREAMS_ESCAPE_SEQUENCE_HPP_ONCE_\n\n<|endoftext|>"} {"text":"<commit_before>#include <ROOT\/RField.hxx>\n\n#include \"gtest\/gtest.h\"\n\n#include \"CustomStruct.hxx\"\n\nusing RFieldBase = ROOT::Experimental::Detail::RFieldBase;\n\nTEST(RNTuple, TypeName)\n{\n EXPECT_STREQ(\"float\", ROOT::Experimental::RField<float>::TypeName().c_str());\n EXPECT_STREQ(\"std::vector<std::string>\", ROOT::Experimental::RField<std::vector<std::string>>::TypeName().c_str());\n EXPECT_STREQ(\"CustomStruct\", ROOT::Experimental::RField<CustomStruct>::TypeName().c_str());\n}\n\n\nTEST(RNTuple, CreateField)\n{\n auto field = RFieldBase::Create(\"test\", \"vector<unsigned int>\");\n EXPECT_STREQ(\"std::vector<std::uint32_t>\", field->GetType().c_str());\n}\n<commit_msg>[ntuple] minor unit test improvement<commit_after>#include <ROOT\/RField.hxx>\n#include <ROOT\/RFieldValue.hxx>\n\n#include \"gtest\/gtest.h\"\n\n#include <memory>\n\n#include \"CustomStruct.hxx\"\n\nusing RFieldBase = ROOT::Experimental::Detail::RFieldBase;\nusing RFieldValue = ROOT::Experimental::Detail::RFieldValue;\n\nTEST(RNTuple, TypeName)\n{\n EXPECT_STREQ(\"float\", ROOT::Experimental::RField<float>::TypeName().c_str());\n EXPECT_STREQ(\"std::vector<std::string>\", ROOT::Experimental::RField<std::vector<std::string>>::TypeName().c_str());\n EXPECT_STREQ(\"CustomStruct\", ROOT::Experimental::RField<CustomStruct>::TypeName().c_str());\n}\n\n\nTEST(RNTuple, CreateField)\n{\n auto field = std::unique_ptr<RFieldBase>(RFieldBase::Create(\"test\", \"vector<unsigned int>\"));\n EXPECT_STREQ(\"std::vector<std::uint32_t>\", field->GetType().c_str());\n auto value = field->GenerateValue();\n field->DestroyValue(value);\n}\n<|endoftext|>"} {"text":"<commit_before>\n\/\/ Code partially copyright Edd Dawson 2007\n\/\/\n\/\/ Boost Software License - Version 1.0 - August 17th, 2003\n\/\/\n\/\/ Permission is hereby granted, free of charge, to any person or organization\n\/\/ obtaining a copy of the software and accompanying documentation covered by\n\/\/ this license (the \"Software\") to use, reproduce, display, distribute,\n\/\/ execute, and transmit the Software, and to prepare derivative works of the\n\/\/ Software, and to permit third-parties to whom the Software is furnished to\n\/\/ do so, all subject to the following:\n\/\/\n\/\/ The copyright notices in the Software and this entire statement, including\n\/\/ the above license grant, this restriction and the following disclaimer,\n\/\/ must be included in all copies of the Software, in whole or in part, and\n\/\/ all derivative works of the Software, unless such copies or derivative\n\/\/ works are solely in the form of machine-executable object code generated by\n\/\/ a source language processor.\n\/\/\n\/\/ THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\n\/\/ IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\n\/\/ FITNESS FOR A PARTICULAR PURPOSE, TITLE AND NON-INFRINGEMENT. IN NO EVENT\n\/\/ SHALL THE COPYRIGHT HOLDERS OR ANYONE DISTRIBUTING THE SOFTWARE BE LIABLE\n\/\/ FOR ANY DAMAGES OR OTHER LIABILITY, WHETHER IN CONTRACT, TORT OR OTHERWISE,\n\/\/ ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER\n\/\/ DEALINGS IN THE SOFTWARE.\n\n\n#include \"libmesh_config.h\"\n#include \"print_trace.h\"\n\n#if defined(HAVE_GCC_ABI_DEMANGLE) && defined(HAVE_GLIBC_BACKTRACE)\n\n#include <iostream>\n#include <string>\n#include <execinfo.h> \n#include <cxxabi.h>\n\nstd::string abi_demangle(const char *name)\n{\n int status = 0;\n char *d = 0;\n std::string fullname = name;\n size_t namestart = fullname.find('(');\n if (namestart == std::string::npos)\n return fullname;\n else\n namestart++;\n size_t nameend = fullname.find('+');\n if (nameend == std::string::npos ||\n nameend <= namestart)\n return fullname;\n std::string funcname = fullname.substr(namestart, nameend - namestart);\n std::string goodname = funcname;\n try { if ( (d = abi::__cxa_demangle(funcname.c_str(), 0, 0, &status)) ) goodname = d; }\n catch(...) { }\n std::free(d);\n\/*\n std::string ret = fullname.substr(0, namestart);\n ret.append(goodname);\n ret.append(fullname.substr(nameend, fullname.length() - nameend));\n return ret;\n*\/\n return goodname;\n}\n\nvoid print_trace(std::ostream &out)\n{\n void *addresses[10];\n char **strings;\n\n int size = backtrace(addresses, 10);\n strings = backtrace_symbols(addresses, size);\n out << \"Stack frames: \" << size << std::endl;\n for(int i = 0; i < size; i++)\n {\n\/\/ out << i << \": \" << (int)addresses[i] << std::endl;\n\/\/ out << abi_demangle(strings[i]) << std::endl;\n out << i << \": \" << abi_demangle(strings[i]) << std::endl;\n }\n free(strings);\n}\n\n#else\n\nvoid print_trace(void) {}\n\n#endif\n\n#if 0 \/\/ MAC OS X code??\n\n#include <dlfcn.h>\n#include <cxxabi.h>\n#include <iostream>\n#include <string>\n#include <cstdlib>\n#include <cstring>\n\nstd::string abi_demangle(const char *name)\n{\n int status = 0;\n char *d = 0;\n std::string ret = name;\n try { if ( (d = abi::__cxa_demangle(name, 0, 0, &status)) ) ret = d; }\n catch(...) { }\n std::free(d);\n return ret;\n}\n\nvoid print_trace(void)\n{\nstd::cerr << \"Trying print_trace()\" << std::endl;\n Dl_info info;\n void **frame = static_cast<void **>(__builtin_frame_address(0));\n void **bp = static_cast<void **>(*frame);\n void *ip = frame[1];\n\n while(bp && ip && dladdr(ip, &info))\n {\n std::cout << ip << \": \" << abi_demangle(info.dli_sname) << \" in \" <<\ninfo.dli_fname << '\\n';\n\n if(info.dli_sname && !strcmp(info.dli_sname, \"main\")) break;\n\n ip = bp[1];\n bp = static_cast<void**>(bp[0]);\n }\n char *dlerr = dlerror();\n if (dlerr)\n std::cout << \"dlerror() = \" << dlerr << std::endl;\n}\n\n#endif\n<commit_msg>Fix --disable-tracefiles<commit_after>\n\/\/ Code partially copyright Edd Dawson 2007\n\/\/\n\/\/ Boost Software License - Version 1.0 - August 17th, 2003\n\/\/\n\/\/ Permission is hereby granted, free of charge, to any person or organization\n\/\/ obtaining a copy of the software and accompanying documentation covered by\n\/\/ this license (the \"Software\") to use, reproduce, display, distribute,\n\/\/ execute, and transmit the Software, and to prepare derivative works of the\n\/\/ Software, and to permit third-parties to whom the Software is furnished to\n\/\/ do so, all subject to the following:\n\/\/\n\/\/ The copyright notices in the Software and this entire statement, including\n\/\/ the above license grant, this restriction and the following disclaimer,\n\/\/ must be included in all copies of the Software, in whole or in part, and\n\/\/ all derivative works of the Software, unless such copies or derivative\n\/\/ works are solely in the form of machine-executable object code generated by\n\/\/ a source language processor.\n\/\/\n\/\/ THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\n\/\/ IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\n\/\/ FITNESS FOR A PARTICULAR PURPOSE, TITLE AND NON-INFRINGEMENT. IN NO EVENT\n\/\/ SHALL THE COPYRIGHT HOLDERS OR ANYONE DISTRIBUTING THE SOFTWARE BE LIABLE\n\/\/ FOR ANY DAMAGES OR OTHER LIABILITY, WHETHER IN CONTRACT, TORT OR OTHERWISE,\n\/\/ ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER\n\/\/ DEALINGS IN THE SOFTWARE.\n\n\n#include \"libmesh_config.h\"\n#include \"print_trace.h\"\n\n#if defined(HAVE_GCC_ABI_DEMANGLE) && defined(HAVE_GLIBC_BACKTRACE)\n\n#include <iostream>\n#include <string>\n#include <execinfo.h> \n#include <cxxabi.h>\n\nstd::string abi_demangle(const char *name)\n{\n int status = 0;\n char *d = 0;\n std::string fullname = name;\n size_t namestart = fullname.find('(');\n if (namestart == std::string::npos)\n return fullname;\n else\n namestart++;\n size_t nameend = fullname.find('+');\n if (nameend == std::string::npos ||\n nameend <= namestart)\n return fullname;\n std::string funcname = fullname.substr(namestart, nameend - namestart);\n std::string goodname = funcname;\n try { if ( (d = abi::__cxa_demangle(funcname.c_str(), 0, 0, &status)) ) goodname = d; }\n catch(...) { }\n std::free(d);\n\/*\n std::string ret = fullname.substr(0, namestart);\n ret.append(goodname);\n ret.append(fullname.substr(nameend, fullname.length() - nameend));\n return ret;\n*\/\n return goodname;\n}\n\nvoid print_trace(std::ostream &out)\n{\n void *addresses[10];\n char **strings;\n\n int size = backtrace(addresses, 10);\n strings = backtrace_symbols(addresses, size);\n out << \"Stack frames: \" << size << std::endl;\n for(int i = 0; i < size; i++)\n {\n\/\/ out << i << \": \" << (int)addresses[i] << std::endl;\n\/\/ out << abi_demangle(strings[i]) << std::endl;\n out << i << \": \" << abi_demangle(strings[i]) << std::endl;\n }\n free(strings);\n}\n\n#else\n\nvoid print_trace(std::ostream &) {}\n\n#endif\n\n#if 0 \/\/ MAC OS X code??\n\n#include <dlfcn.h>\n#include <cxxabi.h>\n#include <iostream>\n#include <string>\n#include <cstdlib>\n#include <cstring>\n\nstd::string abi_demangle(const char *name)\n{\n int status = 0;\n char *d = 0;\n std::string ret = name;\n try { if ( (d = abi::__cxa_demangle(name, 0, 0, &status)) ) ret = d; }\n catch(...) { }\n std::free(d);\n return ret;\n}\n\nvoid print_trace(void)\n{\nstd::cerr << \"Trying print_trace()\" << std::endl;\n Dl_info info;\n void **frame = static_cast<void **>(__builtin_frame_address(0));\n void **bp = static_cast<void **>(*frame);\n void *ip = frame[1];\n\n while(bp && ip && dladdr(ip, &info))\n {\n std::cout << ip << \": \" << abi_demangle(info.dli_sname) << \" in \" <<\ninfo.dli_fname << '\\n';\n\n if(info.dli_sname && !strcmp(info.dli_sname, \"main\")) break;\n\n ip = bp[1];\n bp = static_cast<void**>(bp[0]);\n }\n char *dlerr = dlerror();\n if (dlerr)\n std::cout << \"dlerror() = \" << dlerr << std::endl;\n}\n\n#endif\n<|endoftext|>"} {"text":"<commit_before>\/*\r\nThe MIT License (MIT)\r\n\r\nCopyright (c) 2013 winlin\r\n\r\nPermission is hereby granted, free of charge, to any person obtaining a copy of\r\nthis software and associated documentation files (the \"Software\"), to deal in\r\nthe Software without restriction, including without limitation the rights to\r\nuse, copy, modify, merge, publish, distribute, sublicense, and\/or sell copies of\r\nthe Software, and to permit persons to whom the Software is furnished to do so,\r\nsubject to the following conditions:\r\n\r\nThe above copyright notice and this permission notice shall be included in all\r\ncopies or substantial portions of the Software.\r\n\r\nTHE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\r\nIMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS\r\nFOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR\r\nCOPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER\r\nIN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN\r\nCONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.\r\n*\/\r\n\r\n#ifndef SRS_CORE_PROTOCOL_HPP\r\n#define SRS_CORE_PROTOCOL_HPP\r\n\r\n\/*\r\n#include <srs_core_protocol.hpp>\r\n*\/\r\n\r\n#include <srs_core.hpp>\r\n\r\n#include <st.h>\r\n\r\nclass SrsMessage;\r\n\r\n\/**\r\n* the protocol provides the rtmp-message-protocol services,\r\n* to recv RTMP message from RTMP chunk stream,\r\n* and to send out RTMP message over RTMP chunk stream.\r\n*\/\r\nclass SrsProtocol\r\n{\r\nprivate:\r\n\tst_netfd_t stfd;\r\npublic:\r\n\tSrsProtocol(st_netfd_t client_stfd);\r\n\tvirtual ~SrsProtocol();\r\npublic:\r\n\tvirtual int recv_message(SrsMessage** pmsg);\r\n};\r\n\r\nclass SrsMessage\r\n{\r\npublic:\r\n\tSrsMessage();\r\n\tvirtual ~SrsMessage();\r\npublic:\r\n};\r\n\r\n#endif<commit_msg>add rtmp specification<commit_after>\/*\r\nThe MIT License (MIT)\r\n\r\nCopyright (c) 2013 winlin\r\n\r\nPermission is hereby granted, free of charge, to any person obtaining a copy of\r\nthis software and associated documentation files (the \"Software\"), to deal in\r\nthe Software without restriction, including without limitation the rights to\r\nuse, copy, modify, merge, publish, distribute, sublicense, and\/or sell copies of\r\nthe Software, and to permit persons to whom the Software is furnished to do so,\r\nsubject to the following conditions:\r\n\r\nThe above copyright notice and this permission notice shall be included in all\r\ncopies or substantial portions of the Software.\r\n\r\nTHE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\r\nIMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS\r\nFOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR\r\nCOPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER\r\nIN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN\r\nCONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.\r\n*\/\r\n\r\n#ifndef SRS_CORE_PROTOCOL_HPP\r\n#define SRS_CORE_PROTOCOL_HPP\r\n\r\n\/*\r\n#include <srs_core_protocol.hpp>\r\n*\/\r\n\r\n#include <srs_core.hpp>\r\n\r\n#include <st.h>\r\n\r\nclass SrsMessage;\r\n\r\n\/**\r\n* the protocol provides the rtmp-message-protocol services,\r\n* to recv RTMP message from RTMP chunk stream,\r\n* and to send out RTMP message over RTMP chunk stream.\r\n*\/\r\nclass SrsProtocol\r\n{\r\nprivate:\r\n\tst_netfd_t stfd;\r\npublic:\r\n\tSrsProtocol(st_netfd_t client_stfd);\r\n\tvirtual ~SrsProtocol();\r\npublic:\r\n\tvirtual int recv_message(SrsMessage** pmsg);\r\n};\r\n\r\nclass SrsMessage\r\n{\r\npublic:\r\n\tint8_t message_type;\r\n\tint24_t payload_length;\r\npublic:\r\n\tSrsMessage();\r\n\tvirtual ~SrsMessage();\r\npublic:\r\n};\r\n\r\n#endif<|endoftext|>"} {"text":"<commit_before>\/\/===- llvm\/unittest\/ADT\/DeltaAlgorithmTest.cpp ---------------------------===\/\/\n\/\/\n\/\/ The LLVM Compiler Infrastructure\n\/\/\n\/\/ This file is distributed under the University of Illinois Open Source\n\/\/ License. See LICENSE.TXT for details.\n\/\/\n\/\/===----------------------------------------------------------------------===\/\/\n\n#include \"gtest\/gtest.h\"\n#include \"llvm\/ADT\/DeltaAlgorithm.h\"\n#include <algorithm>\n#include <cstdarg>\nusing namespace llvm;\n\nstd::ostream &operator<<(std::ostream &OS,\n const std::set<unsigned> &S) {\n OS << \"{\";\n for (std::set<unsigned>::const_iterator it = S.begin(),\n ie = S.end(); it != ie; ++it) {\n if (it != S.begin())\n OS << \",\";\n OS << *it;\n }\n OS << \"}\";\n return OS;\n}\n\nnamespace {\n\nclass FixedDeltaAlgorithm : public DeltaAlgorithm {\n changeset_ty FailingSet;\n unsigned NumTests;\n\nprotected:\n virtual bool ExecuteOneTest(const changeset_ty &Changes) {\n ++NumTests;\n return std::includes(Changes.begin(), Changes.end(),\n FailingSet.begin(), FailingSet.end());\n }\n\npublic:\n FixedDeltaAlgorithm(const changeset_ty &_FailingSet)\n : FailingSet(_FailingSet),\n NumTests(0) {}\n\n unsigned getNumTests() const { return NumTests; }\n};\n\nstd::set<unsigned> fixed_set(unsigned N, ...) {\n std::set<unsigned> S;\n va_list ap;\n va_start(ap, N);\n for (unsigned i = 0; i != N; ++i)\n S.insert(va_arg(ap, unsigned));\n va_end(ap);\n return S;\n}\n\nstd::set<unsigned> range(unsigned Start, unsigned End) {\n std::set<unsigned> S;\n while (Start != End)\n S.insert(Start++);\n return S;\n}\n\nstd::set<unsigned> range(unsigned N) {\n return range(0, N);\n}\n\nTEST(DeltaAlgorithmTest, Basic) {\n \/\/ P = {3,5,7} \\in S\n \/\/ [0, 20) should minimize to {3,5,7} in a reasonable number of tests.\n std::set<unsigned> Fails = fixed_set(3, 3, 5, 7);\n FixedDeltaAlgorithm FDA(Fails);\n EXPECT_EQ(fixed_set(3, 3, 5, 7), FDA.Run(range(20)));\n EXPECT_GE(33U, FDA.getNumTests());\n\n \/\/ P = {3,5,7} \\in S\n \/\/ [10, 20) should minimize to [10,20)\n EXPECT_EQ(range(10,20), FDA.Run(range(10,20)));\n\n \/\/ P = [0,4) \\in S\n \/\/ [0, 4) should minimize to [0,4) in 11 tests.\n \/\/\n \/\/ 11 = |{ {},\n \/\/ {0}, {1}, {2}, {3},\n \/\/ {1, 2, 3}, {0, 2, 3}, {0, 1, 3}, {0, 1, 2}, \n \/\/ {0, 1}, {2, 3} }|\n FDA = FixedDeltaAlgorithm(range(10));\n EXPECT_EQ(range(4), FDA.Run(range(4)));\n EXPECT_EQ(11U, FDA.getNumTests()); \n}\n\n}\n\n<commit_msg>Define the new operator<< for sets into namespace std, so that argument-dependent lookup can find it. This is another case where an LLVM bug (not making operator<< visible) was masked by a GCC bug (looking in the global namespace when it shouldn't).<commit_after>\/\/===- llvm\/unittest\/ADT\/DeltaAlgorithmTest.cpp ---------------------------===\/\/\n\/\/\n\/\/ The LLVM Compiler Infrastructure\n\/\/\n\/\/ This file is distributed under the University of Illinois Open Source\n\/\/ License. See LICENSE.TXT for details.\n\/\/\n\/\/===----------------------------------------------------------------------===\/\/\n\n#include \"gtest\/gtest.h\"\n#include \"llvm\/ADT\/DeltaAlgorithm.h\"\n#include <algorithm>\n#include <cstdarg>\nusing namespace llvm;\n\nnamespace std {\n\nstd::ostream &operator<<(std::ostream &OS,\n const std::set<unsigned> &S) {\n OS << \"{\";\n for (std::set<unsigned>::const_iterator it = S.begin(),\n ie = S.end(); it != ie; ++it) {\n if (it != S.begin())\n OS << \",\";\n OS << *it;\n }\n OS << \"}\";\n return OS;\n}\n\n}\n\nnamespace {\n\nclass FixedDeltaAlgorithm : public DeltaAlgorithm {\n changeset_ty FailingSet;\n unsigned NumTests;\n\nprotected:\n virtual bool ExecuteOneTest(const changeset_ty &Changes) {\n ++NumTests;\n return std::includes(Changes.begin(), Changes.end(),\n FailingSet.begin(), FailingSet.end());\n }\n\npublic:\n FixedDeltaAlgorithm(const changeset_ty &_FailingSet)\n : FailingSet(_FailingSet),\n NumTests(0) {}\n\n unsigned getNumTests() const { return NumTests; }\n};\n\nstd::set<unsigned> fixed_set(unsigned N, ...) {\n std::set<unsigned> S;\n va_list ap;\n va_start(ap, N);\n for (unsigned i = 0; i != N; ++i)\n S.insert(va_arg(ap, unsigned));\n va_end(ap);\n return S;\n}\n\nstd::set<unsigned> range(unsigned Start, unsigned End) {\n std::set<unsigned> S;\n while (Start != End)\n S.insert(Start++);\n return S;\n}\n\nstd::set<unsigned> range(unsigned N) {\n return range(0, N);\n}\n\nTEST(DeltaAlgorithmTest, Basic) {\n \/\/ P = {3,5,7} \\in S\n \/\/ [0, 20) should minimize to {3,5,7} in a reasonable number of tests.\n std::set<unsigned> Fails = fixed_set(3, 3, 5, 7);\n FixedDeltaAlgorithm FDA(Fails);\n EXPECT_EQ(fixed_set(3, 3, 5, 7), FDA.Run(range(20)));\n EXPECT_GE(33U, FDA.getNumTests());\n\n \/\/ P = {3,5,7} \\in S\n \/\/ [10, 20) should minimize to [10,20)\n EXPECT_EQ(range(10,20), FDA.Run(range(10,20)));\n\n \/\/ P = [0,4) \\in S\n \/\/ [0, 4) should minimize to [0,4) in 11 tests.\n \/\/\n \/\/ 11 = |{ {},\n \/\/ {0}, {1}, {2}, {3},\n \/\/ {1, 2, 3}, {0, 2, 3}, {0, 1, 3}, {0, 1, 2}, \n \/\/ {0, 1}, {2, 3} }|\n FDA = FixedDeltaAlgorithm(range(10));\n EXPECT_EQ(range(4), FDA.Run(range(4)));\n EXPECT_EQ(11U, FDA.getNumTests()); \n}\n\n}\n\n<|endoftext|>"} {"text":"<commit_before>\/\/===- unittest\/Support\/YAMLParserTest ------------------------------------===\/\/\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\/SmallString.h\"\n#include \"llvm\/ADT\/Twine.h\"\n#include \"llvm\/Support\/Casting.h\"\n#include \"llvm\/Support\/SourceMgr.h\"\n#include \"llvm\/Support\/YAMLParser.h\"\n#include \"gtest\/gtest.h\"\n\nnamespace llvm {\n\n\/\/ Checks that the given input gives a parse error. Makes sure that an error\n\/\/ text is available and the parse fails.\nstatic void ExpectParseError(StringRef Message, StringRef Input) {\n SourceMgr SM;\n yaml::Stream Stream(Input, SM);\n EXPECT_FALSE(Stream.validate()) << Message << \": \" << Input;\n EXPECT_TRUE(Stream.failed()) << Message << \": \" << Input;\n}\n\n\/\/ Checks that the given input can be parsed without error.\nstatic void ExpectParseSuccess(StringRef Message, StringRef Input) {\n SourceMgr SM;\n yaml::Stream Stream(Input, SM);\n EXPECT_TRUE(Stream.validate()) << Message << \": \" << Input;\n}\n\nTEST(YAMLParser, ParsesEmptyArray) {\n ExpectParseSuccess(\"Empty array\", \"[]\");\n}\n\nTEST(YAMLParser, FailsIfNotClosingArray) {\n ExpectParseError(\"Not closing array\", \"[\");\n ExpectParseError(\"Not closing array\", \" [ \");\n ExpectParseError(\"Not closing array\", \" [x\");\n}\n\nTEST(YAMLParser, ParsesEmptyArrayWithWhitespace) {\n ExpectParseSuccess(\"Array with spaces\", \" [ ] \");\n ExpectParseSuccess(\"All whitespaces\", \"\\t\\r\\n[\\t\\n \\t\\r ]\\t\\r \\n\\n\");\n}\n\nTEST(YAMLParser, ParsesEmptyObject) {\n ExpectParseSuccess(\"Empty object\", \"[{}]\");\n}\n\nTEST(YAMLParser, ParsesObject) {\n ExpectParseSuccess(\"Object with an entry\", \"[{\\\"a\\\":\\\"\/b\\\"}]\");\n}\n\nTEST(YAMLParser, ParsesMultipleKeyValuePairsInObject) {\n ExpectParseSuccess(\"Multiple key, value pairs\",\n \"[{\\\"a\\\":\\\"\/b\\\",\\\"c\\\":\\\"d\\\",\\\"e\\\":\\\"f\\\"}]\");\n}\n\nTEST(YAMLParser, FailsIfNotClosingObject) {\n ExpectParseError(\"Missing close on empty\", \"[{]\");\n ExpectParseError(\"Missing close after pair\", \"[{\\\"a\\\":\\\"b\\\"]\");\n}\n\nTEST(YAMLParser, FailsIfMissingColon) {\n ExpectParseError(\"Missing colon between key and value\", \"[{\\\"a\\\"\\\"\/b\\\"}]\");\n ExpectParseError(\"Missing colon between key and value\", \"[{\\\"a\\\" \\\"b\\\"}]\");\n}\n\nTEST(YAMLParser, FailsOnMissingQuote) {\n ExpectParseError(\"Missing open quote\", \"[{a\\\":\\\"b\\\"}]\");\n ExpectParseError(\"Missing closing quote\", \"[{\\\"a\\\":\\\"b}]\");\n}\n\nTEST(YAMLParser, ParsesEscapedQuotes) {\n ExpectParseSuccess(\"Parses escaped string in key and value\",\n \"[{\\\"a\\\":\\\"\\\\\\\"b\\\\\\\" \\\\\\\" \\\\\\\"\\\"}]\");\n}\n\nTEST(YAMLParser, ParsesEmptyString) {\n ExpectParseSuccess(\"Parses empty string in value\", \"[{\\\"a\\\":\\\"\\\"}]\");\n}\n\nTEST(YAMLParser, ParsesMultipleObjects) {\n ExpectParseSuccess(\n \"Multiple objects in array\",\n \"[\"\n \" { \\\"a\\\" : \\\"b\\\" },\"\n \" { \\\"a\\\" : \\\"b\\\" },\"\n \" { \\\"a\\\" : \\\"b\\\" }\"\n \"]\");\n}\n\nTEST(YAMLParser, FailsOnMissingComma) {\n ExpectParseError(\n \"Missing comma\",\n \"[\"\n \" { \\\"a\\\" : \\\"b\\\" }\"\n \" { \\\"a\\\" : \\\"b\\\" }\"\n \"]\");\n}\n\nTEST(YAMLParser, ParsesSpacesInBetweenTokens) {\n ExpectParseSuccess(\n \"Various whitespace between tokens\",\n \" \\t \\n\\n \\r [ \\t \\n\\n \\r\"\n \" \\t \\n\\n \\r { \\t \\n\\n \\r\\\"a\\\"\\t \\n\\n \\r :\"\n \" \\t \\n\\n \\r \\\"b\\\"\\t \\n\\n \\r } \\t \\n\\n \\r,\\t \\n\\n \\r\"\n \" \\t \\n\\n \\r { \\t \\n\\n \\r\\\"a\\\"\\t \\n\\n \\r :\"\n \" \\t \\n\\n \\r \\\"b\\\"\\t \\n\\n \\r } \\t \\n\\n \\r]\\t \\n\\n \\r\");\n}\n\nTEST(YAMLParser, ParsesArrayOfArrays) {\n ExpectParseSuccess(\"Array of arrays\", \"[[]]\");\n}\n\nTEST(YAMLParser, HandlesEndOfFileGracefully) {\n ExpectParseError(\"In string starting with EOF\", \"[\\\"\");\n ExpectParseError(\"In string hitting EOF\", \"[\\\" \");\n ExpectParseError(\"In string escaping EOF\", \"[\\\" \\\\\");\n ExpectParseError(\"In array starting with EOF\", \"[\");\n ExpectParseError(\"In array element starting with EOF\", \"[[], \");\n ExpectParseError(\"In array hitting EOF\", \"[[] \");\n ExpectParseError(\"In array hitting EOF\", \"[[]\");\n ExpectParseError(\"In object hitting EOF\", \"{\\\"\\\"\");\n}\n\n\/\/ Checks that the given string can be parsed into an identical string inside\n\/\/ of an array.\nstatic void ExpectCanParseString(StringRef String) {\n std::string StringInArray = (llvm::Twine(\"[\\\"\") + String + \"\\\"]\").str();\n SourceMgr SM;\n yaml::Stream Stream(StringInArray, SM);\n yaml::SequenceNode *ParsedSequence\n = dyn_cast<yaml::SequenceNode>(Stream.begin()->getRoot());\n StringRef ParsedString\n = dyn_cast<yaml::ScalarNode>(\n static_cast<yaml::Node*>(ParsedSequence->begin()))->getRawValue();\n ParsedString = ParsedString.substr(1, ParsedString.size() - 2);\n EXPECT_EQ(String, ParsedString.str());\n}\n\n\/\/ Checks that parsing the given string inside an array fails.\nstatic void ExpectCannotParseString(StringRef String) {\n std::string StringInArray = (llvm::Twine(\"[\\\"\") + String + \"\\\"]\").str();\n ExpectParseError((Twine(\"When parsing string \\\"\") + String + \"\\\"\").str(),\n StringInArray);\n}\n\nTEST(YAMLParser, ParsesStrings) {\n ExpectCanParseString(\"\");\n ExpectCannotParseString(\"\\\\\");\n ExpectCannotParseString(\"\\\"\");\n ExpectCanParseString(\" \");\n ExpectCanParseString(\"\\\\ \");\n ExpectCanParseString(\"\\\\\\\"\");\n ExpectCannotParseString(\"\\\"\\\\\");\n ExpectCannotParseString(\" \\\\\");\n ExpectCanParseString(\"\\\\\\\\\");\n ExpectCannotParseString(\"\\\\\\\\\\\\\");\n ExpectCanParseString(\"\\\\\\\\\\\\\\\\\");\n ExpectCanParseString(\"\\\\\\\" \");\n ExpectCannotParseString(\"\\\\\\\\\\\" \");\n ExpectCanParseString(\"\\\\\\\\\\\\\\\" \");\n ExpectCanParseString(\" \\\\\\\\ \\\\\\\" \\\\\\\\\\\\\\\" \");\n}\n\nTEST(YAMLParser, WorksWithIteratorAlgorithms) {\n SourceMgr SM;\n yaml::Stream Stream(\"[\\\"1\\\", \\\"2\\\", \\\"3\\\", \\\"4\\\", \\\"5\\\", \\\"6\\\"]\", SM);\n yaml::SequenceNode *Array\n = dyn_cast<yaml::SequenceNode>(Stream.begin()->getRoot());\n EXPECT_EQ(6, std::distance(Array->begin(), Array->end()));\n}\n\n} \/\/ end namespace llvm\n<commit_msg>Suppress stderr noise when test case runs.<commit_after>\/\/===- unittest\/Support\/YAMLParserTest ------------------------------------===\/\/\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\/SmallString.h\"\n#include \"llvm\/ADT\/Twine.h\"\n#include \"llvm\/Support\/Casting.h\"\n#include \"llvm\/Support\/SourceMgr.h\"\n#include \"llvm\/Support\/YAMLParser.h\"\n#include \"gtest\/gtest.h\"\n\nnamespace llvm {\n\nstatic void SuppressDiagnosticsOutput(const SMDiagnostic &, void *) {\n \/\/ Prevent SourceMgr from writing errors to stderr \n \/\/ to reduce noise in unit test runs.\n}\n\n\/\/ Checks that the given input gives a parse error. Makes sure that an error\n\/\/ text is available and the parse fails.\nstatic void ExpectParseError(StringRef Message, StringRef Input) {\n SourceMgr SM;\n yaml::Stream Stream(Input, SM);\n SM.setDiagHandler(SuppressDiagnosticsOutput);\n EXPECT_FALSE(Stream.validate()) << Message << \": \" << Input;\n EXPECT_TRUE(Stream.failed()) << Message << \": \" << Input;\n}\n\n\/\/ Checks that the given input can be parsed without error.\nstatic void ExpectParseSuccess(StringRef Message, StringRef Input) {\n SourceMgr SM;\n yaml::Stream Stream(Input, SM);\n EXPECT_TRUE(Stream.validate()) << Message << \": \" << Input;\n}\n\nTEST(YAMLParser, ParsesEmptyArray) {\n ExpectParseSuccess(\"Empty array\", \"[]\");\n}\n\nTEST(YAMLParser, FailsIfNotClosingArray) {\n ExpectParseError(\"Not closing array\", \"[\");\n ExpectParseError(\"Not closing array\", \" [ \");\n ExpectParseError(\"Not closing array\", \" [x\");\n}\n\nTEST(YAMLParser, ParsesEmptyArrayWithWhitespace) {\n ExpectParseSuccess(\"Array with spaces\", \" [ ] \");\n ExpectParseSuccess(\"All whitespaces\", \"\\t\\r\\n[\\t\\n \\t\\r ]\\t\\r \\n\\n\");\n}\n\nTEST(YAMLParser, ParsesEmptyObject) {\n ExpectParseSuccess(\"Empty object\", \"[{}]\");\n}\n\nTEST(YAMLParser, ParsesObject) {\n ExpectParseSuccess(\"Object with an entry\", \"[{\\\"a\\\":\\\"\/b\\\"}]\");\n}\n\nTEST(YAMLParser, ParsesMultipleKeyValuePairsInObject) {\n ExpectParseSuccess(\"Multiple key, value pairs\",\n \"[{\\\"a\\\":\\\"\/b\\\",\\\"c\\\":\\\"d\\\",\\\"e\\\":\\\"f\\\"}]\");\n}\n\nTEST(YAMLParser, FailsIfNotClosingObject) {\n ExpectParseError(\"Missing close on empty\", \"[{]\");\n ExpectParseError(\"Missing close after pair\", \"[{\\\"a\\\":\\\"b\\\"]\");\n}\n\nTEST(YAMLParser, FailsIfMissingColon) {\n ExpectParseError(\"Missing colon between key and value\", \"[{\\\"a\\\"\\\"\/b\\\"}]\");\n ExpectParseError(\"Missing colon between key and value\", \"[{\\\"a\\\" \\\"b\\\"}]\");\n}\n\nTEST(YAMLParser, FailsOnMissingQuote) {\n ExpectParseError(\"Missing open quote\", \"[{a\\\":\\\"b\\\"}]\");\n ExpectParseError(\"Missing closing quote\", \"[{\\\"a\\\":\\\"b}]\");\n}\n\nTEST(YAMLParser, ParsesEscapedQuotes) {\n ExpectParseSuccess(\"Parses escaped string in key and value\",\n \"[{\\\"a\\\":\\\"\\\\\\\"b\\\\\\\" \\\\\\\" \\\\\\\"\\\"}]\");\n}\n\nTEST(YAMLParser, ParsesEmptyString) {\n ExpectParseSuccess(\"Parses empty string in value\", \"[{\\\"a\\\":\\\"\\\"}]\");\n}\n\nTEST(YAMLParser, ParsesMultipleObjects) {\n ExpectParseSuccess(\n \"Multiple objects in array\",\n \"[\"\n \" { \\\"a\\\" : \\\"b\\\" },\"\n \" { \\\"a\\\" : \\\"b\\\" },\"\n \" { \\\"a\\\" : \\\"b\\\" }\"\n \"]\");\n}\n\nTEST(YAMLParser, FailsOnMissingComma) {\n ExpectParseError(\n \"Missing comma\",\n \"[\"\n \" { \\\"a\\\" : \\\"b\\\" }\"\n \" { \\\"a\\\" : \\\"b\\\" }\"\n \"]\");\n}\n\nTEST(YAMLParser, ParsesSpacesInBetweenTokens) {\n ExpectParseSuccess(\n \"Various whitespace between tokens\",\n \" \\t \\n\\n \\r [ \\t \\n\\n \\r\"\n \" \\t \\n\\n \\r { \\t \\n\\n \\r\\\"a\\\"\\t \\n\\n \\r :\"\n \" \\t \\n\\n \\r \\\"b\\\"\\t \\n\\n \\r } \\t \\n\\n \\r,\\t \\n\\n \\r\"\n \" \\t \\n\\n \\r { \\t \\n\\n \\r\\\"a\\\"\\t \\n\\n \\r :\"\n \" \\t \\n\\n \\r \\\"b\\\"\\t \\n\\n \\r } \\t \\n\\n \\r]\\t \\n\\n \\r\");\n}\n\nTEST(YAMLParser, ParsesArrayOfArrays) {\n ExpectParseSuccess(\"Array of arrays\", \"[[]]\");\n}\n\nTEST(YAMLParser, HandlesEndOfFileGracefully) {\n ExpectParseError(\"In string starting with EOF\", \"[\\\"\");\n ExpectParseError(\"In string hitting EOF\", \"[\\\" \");\n ExpectParseError(\"In string escaping EOF\", \"[\\\" \\\\\");\n ExpectParseError(\"In array starting with EOF\", \"[\");\n ExpectParseError(\"In array element starting with EOF\", \"[[], \");\n ExpectParseError(\"In array hitting EOF\", \"[[] \");\n ExpectParseError(\"In array hitting EOF\", \"[[]\");\n ExpectParseError(\"In object hitting EOF\", \"{\\\"\\\"\");\n}\n\n\/\/ Checks that the given string can be parsed into an identical string inside\n\/\/ of an array.\nstatic void ExpectCanParseString(StringRef String) {\n std::string StringInArray = (llvm::Twine(\"[\\\"\") + String + \"\\\"]\").str();\n SourceMgr SM;\n yaml::Stream Stream(StringInArray, SM);\n yaml::SequenceNode *ParsedSequence\n = dyn_cast<yaml::SequenceNode>(Stream.begin()->getRoot());\n StringRef ParsedString\n = dyn_cast<yaml::ScalarNode>(\n static_cast<yaml::Node*>(ParsedSequence->begin()))->getRawValue();\n ParsedString = ParsedString.substr(1, ParsedString.size() - 2);\n EXPECT_EQ(String, ParsedString.str());\n}\n\n\/\/ Checks that parsing the given string inside an array fails.\nstatic void ExpectCannotParseString(StringRef String) {\n std::string StringInArray = (llvm::Twine(\"[\\\"\") + String + \"\\\"]\").str();\n ExpectParseError((Twine(\"When parsing string \\\"\") + String + \"\\\"\").str(),\n StringInArray);\n}\n\nTEST(YAMLParser, ParsesStrings) {\n ExpectCanParseString(\"\");\n ExpectCannotParseString(\"\\\\\");\n ExpectCannotParseString(\"\\\"\");\n ExpectCanParseString(\" \");\n ExpectCanParseString(\"\\\\ \");\n ExpectCanParseString(\"\\\\\\\"\");\n ExpectCannotParseString(\"\\\"\\\\\");\n ExpectCannotParseString(\" \\\\\");\n ExpectCanParseString(\"\\\\\\\\\");\n ExpectCannotParseString(\"\\\\\\\\\\\\\");\n ExpectCanParseString(\"\\\\\\\\\\\\\\\\\");\n ExpectCanParseString(\"\\\\\\\" \");\n ExpectCannotParseString(\"\\\\\\\\\\\" \");\n ExpectCanParseString(\"\\\\\\\\\\\\\\\" \");\n ExpectCanParseString(\" \\\\\\\\ \\\\\\\" \\\\\\\\\\\\\\\" \");\n}\n\nTEST(YAMLParser, WorksWithIteratorAlgorithms) {\n SourceMgr SM;\n yaml::Stream Stream(\"[\\\"1\\\", \\\"2\\\", \\\"3\\\", \\\"4\\\", \\\"5\\\", \\\"6\\\"]\", SM);\n yaml::SequenceNode *Array\n = dyn_cast<yaml::SequenceNode>(Stream.begin()->getRoot());\n EXPECT_EQ(6, std::distance(Array->begin(), Array->end()));\n}\n\n} \/\/ end namespace llvm\n<|endoftext|>"} {"text":"<commit_before>\n#include <benchmark\/benchmark.h>\n\n#include <glkernel\/Kernel.h>\n#include <glkernel\/sample.h>\n\nstatic void BM_possion_quad(benchmark::State& state) {\n auto dkernel = glkernel::dkernel2{state.range(0), state.range(0)};\n\n for (auto _ : state)\n glkernel::sample::poisson_square(dkernel);\n\n state.SetComplexityN(state.range(0));\n}\n\nstatic void BM_jittered_quad(benchmark::State& state) {\n auto dkernel = glkernel::dkernel2{state.range(0), state.range(0)};\n\n\n for (auto _ : state)\n glkernel::sample::multi_jittered(dkernel);\n\n state.SetComplexityN(state.range(0));\n}\n\nstatic void BM_rooks_quad(benchmark::State& state) {\n auto dkernel = glkernel::dkernel2{state.range(0), state.range(0)};\n\n\n for (auto _ : state)\n glkernel::sample::n_rooks(dkernel);\n\n state.SetComplexityN(state.range(0));\n}\n\nstatic void BM_stratified_quad(benchmark::State& state) {\n auto dkernel = glkernel::dkernel2{state.range(0), state.range(0)};\n\n\n for (auto _ : state)\n glkernel::sample::stratified(dkernel);\n\n state.SetComplexityN(state.range(0));\n}\n\nstatic void BM_hammersley_quad(benchmark::State& state) {\n auto dkernel = glkernel::dkernel2{state.range(0), state.range(0)};\n\n\n for (auto _ : state)\n glkernel::sample::hammersley(dkernel);\n\n state.SetComplexityN(state.range(0));\n}\n\nstatic void BM_hammersley_sphere_quad(benchmark::State& state) {\n auto dkernel = glkernel::dkernel3{state.range(0), state.range(0)};\n\n\n for (auto _ : state)\n glkernel::sample::hammersley_sphere(dkernel);\n\n state.SetComplexityN(state.range(0));\n}\n\nstatic void BM_halton_quad(benchmark::State& state) {\n auto dkernel = glkernel::dkernel2{state.range(0), state.range(0)};\n\n\n for (auto _ : state)\n glkernel::sample::halton(dkernel, 2, 3);\n\n state.SetComplexityN(state.range(0));\n}\n\nstatic void BM_halton_sphere_quad(benchmark::State& state) {\n auto dkernel = glkernel::dkernel3{state.range(0), state.range(0)};\n\n\n for (auto _ : state)\n glkernel::sample::halton_sphere(dkernel, 2, 3);\n\n state.SetComplexityN(state.range(0));\n}\n\nstatic void BM_best_candidate_quad(benchmark::State& state) {\n auto dkernel = glkernel::dkernel3{state.range(0), state.range(0)};\n\n\n for (auto _ : state)\n glkernel::sample::best_candidate(dkernel);\n\n state.SetComplexityN(state.range(0));\n}\n\nstatic void BM_golden_point_set_quad(benchmark::State& state) {\n auto dkernel = glkernel::dkernel2{state.range(0), state.range(0)};\n\n\n for (auto _ : state)\n glkernel::sample::golden_point_set(dkernel);\n\n state.SetComplexityN(state.range(0));\n}\n\nBENCHMARK(BM_poisson_quad)->RangeMultiplier(2)->Range(2, 64)->Complexity();\nBENCHMARK(BM_jittered_quad)->RangeMultiplier(2)->Range(2, 64)->Complexity();\nBENCHMARK(BM_rooks_quad)->RangeMultiplier(2)->Range(2, 64)->Complexity();\nBENCHMARK(BM_stratified_quad)->RangeMultiplier(2)->Range(2, 64)->Complexity();\nBENCHMARK(BM_hammersley_quad)->RangeMultiplier(2)->Range(2, 64)->Complexity();\nBENCHMARK(BM_hammersley_sphere_quad)->RangeMultiplier(2)->Range(2, 64)->Complexity();\nBENCHMARK(BM_halton_quad)->RangeMultiplier(2)->Range(2, 64)->Complexity();\nBENCHMARK(BM_halton_sphere_quad)->RangeMultiplier(2)->Range(2, 64)->Complexity();\nBENCHMARK(BM_best_candidate_quad)->RangeMultiplier(2)->Range(2, 64)->Complexity();\nBENCHMARK(BM_golden_point_set_quad)->RangeMultiplier(2)->Range(2, 64)->Complexity();\n<commit_msg>fixing benchmark names<commit_after>\n#include <benchmark\/benchmark.h>\n\n#include <glkernel\/Kernel.h>\n#include <glkernel\/sample.h>\n\nstatic void BM_poisson_quad(benchmark::State& state) {\n auto dkernel = glkernel::dkernel2{state.range(0), state.range(0)};\n\n for (auto _ : state)\n glkernel::sample::poisson_square(dkernel);\n\n state.SetComplexityN(state.range(0));\n}\n\nstatic void BM_jittered_quad(benchmark::State& state) {\n auto dkernel = glkernel::dkernel2{state.range(0), state.range(0)};\n\n\n for (auto _ : state)\n glkernel::sample::multi_jittered(dkernel);\n\n state.SetComplexityN(state.range(0));\n}\n\nstatic void BM_rooks_quad(benchmark::State& state) {\n auto dkernel = glkernel::dkernel2{state.range(0), state.range(0)};\n\n\n for (auto _ : state)\n glkernel::sample::n_rooks(dkernel);\n\n state.SetComplexityN(state.range(0));\n}\n\nstatic void BM_stratified_quad(benchmark::State& state) {\n auto dkernel = glkernel::dkernel2{state.range(0), state.range(0)};\n\n\n for (auto _ : state)\n glkernel::sample::stratified(dkernel);\n\n state.SetComplexityN(state.range(0));\n}\n\nstatic void BM_hammersley_quad(benchmark::State& state) {\n auto dkernel = glkernel::dkernel2{state.range(0), state.range(0)};\n\n\n for (auto _ : state)\n glkernel::sample::hammersley(dkernel);\n\n state.SetComplexityN(state.range(0));\n}\n\nstatic void BM_hammersley_sphere_quad(benchmark::State& state) {\n auto dkernel = glkernel::dkernel3{state.range(0), state.range(0)};\n\n\n for (auto _ : state)\n glkernel::sample::hammersley_sphere(dkernel);\n\n state.SetComplexityN(state.range(0));\n}\n\nstatic void BM_halton_quad(benchmark::State& state) {\n auto dkernel = glkernel::dkernel2{state.range(0), state.range(0)};\n\n\n for (auto _ : state)\n glkernel::sample::halton(dkernel, 2, 3);\n\n state.SetComplexityN(state.range(0));\n}\n\nstatic void BM_halton_sphere_quad(benchmark::State& state) {\n auto dkernel = glkernel::dkernel3{state.range(0), state.range(0)};\n\n\n for (auto _ : state)\n glkernel::sample::halton_sphere(dkernel, 2, 3);\n\n state.SetComplexityN(state.range(0));\n}\n\nstatic void BM_best_candidate_quad(benchmark::State& state) {\n auto dkernel = glkernel::dkernel3{state.range(0), state.range(0)};\n\n\n for (auto _ : state)\n glkernel::sample::best_candidate(dkernel);\n\n state.SetComplexityN(state.range(0));\n}\n\nstatic void BM_golden_point_set_quad(benchmark::State& state) {\n auto dkernel = glkernel::dkernel2{state.range(0), state.range(0)};\n\n\n for (auto _ : state)\n glkernel::sample::golden_point_set(dkernel);\n\n state.SetComplexityN(state.range(0));\n}\n\nBENCHMARK(BM_poisson_quad)->RangeMultiplier(2)->Range(2, 64)->Complexity();\nBENCHMARK(BM_jittered_quad)->RangeMultiplier(2)->Range(2, 64)->Complexity();\nBENCHMARK(BM_rooks_quad)->RangeMultiplier(2)->Range(2, 64)->Complexity();\nBENCHMARK(BM_stratified_quad)->RangeMultiplier(2)->Range(2, 64)->Complexity();\nBENCHMARK(BM_hammersley_quad)->RangeMultiplier(2)->Range(2, 64)->Complexity();\nBENCHMARK(BM_hammersley_sphere_quad)->RangeMultiplier(2)->Range(2, 64)->Complexity();\nBENCHMARK(BM_halton_quad)->RangeMultiplier(2)->Range(2, 64)->Complexity();\nBENCHMARK(BM_halton_sphere_quad)->RangeMultiplier(2)->Range(2, 64)->Complexity();\nBENCHMARK(BM_best_candidate_quad)->RangeMultiplier(2)->Range(2, 64)->Complexity();\nBENCHMARK(BM_golden_point_set_quad)->RangeMultiplier(2)->Range(2, 64)->Complexity();\n<|endoftext|>"} {"text":"<commit_before>#include \"ncv.h\"\n#include \"core\/clamp.h\"\n#include \"core\/timer.h\"\n#include \"core\/logger.h\"\n#include \"model\/conv_network.h\"\n#include <boost\/program_options.hpp>\n\nint main(int argc, char *argv[])\n{\n ncv::init();\n\n using namespace ncv;\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()(\"inputs,i\",\n boost::program_options::value<string_t>()->default_value(\"rgba\"),\n \"number of inputs [luma, rgba]\");\n po_desc.add_options()(\"rows,ir\",\n boost::program_options::value<size_t>()->default_value(32),\n \"number of input rows [16, 64]\");\n po_desc.add_options()(\"cols,ic\",\n boost::program_options::value<size_t>()->default_value(32),\n \"number of input columns [16, 64]\");\n po_desc.add_options()(\"outputs,o\",\n boost::program_options::value<size_t>()->default_value(10),\n \"number of input rows [1, 100]\");\n po_desc.add_options()(\"network,n\",\n boost::program_options::value<string_t>(),\n \"convolution network parameters\");\n po_desc.add_options()(\"samples,s\",\n boost::program_options::value<size_t>()->default_value(10000),\n \"number of random samples [1K, 1M]\");\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(\"network\") ||\n po_vm.count(\"help\"))\n {\n std::cout << po_desc;\n return EXIT_FAILURE;\n }\n\n const color_mode cmd_color = text::from_string<color_mode>(po_vm[\"inputs\"].as<string_t>());\n const size_t cmd_rows = math::clamp(po_vm[\"rows\"].as<size_t>(), 16, 64);\n const size_t cmd_cols = math::clamp(po_vm[\"cols\"].as<size_t>(), 16, 64);\n const size_t cmd_outputs = math::clamp(po_vm[\"outputs\"].as<size_t>(), 1, 100);\n const string_t cmd_network = po_vm[\"network\"].as<string_t>();\n const size_t cmd_samples = math::clamp(po_vm[\"samples\"].as<size_t>(), 1000, 1000 * 1000);\n\n \/\/ create convolution network\n ncv::conv_network_t network(cmd_network);\n network.resize(cmd_rows, cmd_cols, cmd_outputs, cmd_color);\n\n \/\/ create random samples\n tensor3ds_t samples(cmd_samples, tensor3d_t(cmd_color == color_mode::luma ? 1 : 3, cmd_rows, cmd_cols));\n for (tensor3d_t& sample : samples)\n {\n sample.random(-1.0, +1.0);\n }\n\n \/\/ process the samples\n ncv::timer_t timer;\n\n size_t count = 0;\n for (tensor3d_t& sample : samples)\n {\n const vector_t output = network.value(sample);\n count += output.size();\n }\n\n log_info() << \"<<< processed [\" << (count \/ cmd_outputs) << \"] samples in \" << timer.elapsed() << \".\";\n\n \/\/ OK\n log_info() << done;\n return EXIT_SUCCESS;\n}\n<commit_msg>fix command line tags<commit_after>#include \"ncv.h\"\n#include \"core\/clamp.h\"\n#include \"core\/timer.h\"\n#include \"core\/logger.h\"\n#include \"model\/conv_network.h\"\n#include <boost\/program_options.hpp>\n\nint main(int argc, char *argv[])\n{\n ncv::init();\n\n using namespace ncv;\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()(\"inputs,i\",\n boost::program_options::value<string_t>()->default_value(\"rgba\"),\n \"number of inputs [luma, rgba]\");\n po_desc.add_options()(\"rows,r\",\n boost::program_options::value<size_t>()->default_value(32),\n \"number of input rows [16, 64]\");\n po_desc.add_options()(\"cols,c\",\n boost::program_options::value<size_t>()->default_value(32),\n \"number of input columns [16, 64]\");\n po_desc.add_options()(\"outputs,o\",\n boost::program_options::value<size_t>()->default_value(10),\n \"number of input rows [1, 100]\");\n po_desc.add_options()(\"network,n\",\n boost::program_options::value<string_t>(),\n \"convolution network parameters\");\n po_desc.add_options()(\"samples,s\",\n boost::program_options::value<size_t>()->default_value(10000),\n \"number of random samples [1K, 1M]\");\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(\"network\") ||\n po_vm.count(\"help\"))\n {\n std::cout << po_desc;\n return EXIT_FAILURE;\n }\n\n const color_mode cmd_color = text::from_string<color_mode>(po_vm[\"inputs\"].as<string_t>());\n const size_t cmd_rows = math::clamp(po_vm[\"rows\"].as<size_t>(), 16, 64);\n const size_t cmd_cols = math::clamp(po_vm[\"cols\"].as<size_t>(), 16, 64);\n const size_t cmd_outputs = math::clamp(po_vm[\"outputs\"].as<size_t>(), 1, 100);\n const string_t cmd_network = po_vm[\"network\"].as<string_t>();\n const size_t cmd_samples = math::clamp(po_vm[\"samples\"].as<size_t>(), 1000, 1000 * 1000);\n\n \/\/ create convolution network\n ncv::conv_network_t network(cmd_network);\n network.resize(cmd_rows, cmd_cols, cmd_outputs, cmd_color);\n\n \/\/ create random samples\n tensor3ds_t samples(cmd_samples, tensor3d_t(cmd_color == color_mode::luma ? 1 : 3, cmd_rows, cmd_cols));\n for (tensor3d_t& sample : samples)\n {\n sample.random(-1.0, +1.0);\n }\n\n \/\/ process the samples\n ncv::timer_t timer;\n\n size_t count = 0;\n for (tensor3d_t& sample : samples)\n {\n const vector_t output = network.value(sample);\n count += output.size();\n }\n\n log_info() << \"<<< processed [\" << (count \/ cmd_outputs) << \"] samples in \" << timer.elapsed() << \".\";\n\n \/\/ OK\n log_info() << done;\n return EXIT_SUCCESS;\n}\n<|endoftext|>"} {"text":"<commit_before>\/*\nFor more information, please see: http:\/\/software.sci.utah.edu\n\nThe MIT License\n\nCopyright (c) 2012 Scientific Computing and Imaging Institute,\nUniversity of Utah.\n\nLicense for the specific language governing rights and limitations under\nPermission is hereby granted, free of charge, to any person obtaining a\ncopy of this software and associated documentation files (the \"Software\"),\nto deal in the Software without restriction, including without limitation\nthe rights to use, copy, modify, merge, publish, distribute, sublicense,\nand\/or sell copies of the Software, and to permit persons to whom the\nSoftware is furnished to do so, subject to the following conditions:\n\nThe above copyright notice and this permission notice shall be included\nin all copies or substantial portions of the Software.\n\nTHE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS\nOR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\nFITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL\nTHE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\nLIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING\nFROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER\nDEALINGS IN THE SOFTWARE.\n\nAuthor : Moritz Dannhauer\nLast modification : March 16 2014\nToDo: Padding is always enabled because of exit() in cleaver lib\n*\/\n\n\/\/\/TODO: fix include path to remove Externals\/ part\n\n#include <Externals\/cleaver\/lib\/FloatField.h>\n#include <Externals\/cleaver\/lib\/vec3.h>\n#include <Externals\/cleaver\/lib\/BoundingBox.h>\n#include <Externals\/cleaver\/lib\/Cleaver.h>\n#include <Externals\/cleaver\/lib\/InverseField.h>\n#include <Externals\/cleaver\/lib\/PaddedVolume.h>\n#include <Externals\/cleaver\/lib\/Volume.h>\n#include <Core\/Algorithms\/Base\/AlgorithmPreconditions.h>\n#include <Core\/Algorithms\/Field\/InterfaceWithCleaverAlgorithm.h>\n#include <Core\/Algorithms\/Base\/AlgorithmVariableNames.h>\n#include <Core\/GeometryPrimitives\/Vector.h>\n#include <Core\/Datatypes\/Legacy\/Field\/Field.h>\n#include <Core\/Datatypes\/Legacy\/Field\/VField.h>\n#include <Core\/Datatypes\/Legacy\/Field\/VMesh.h>\n#include <Core\/Datatypes\/Legacy\/Field\/FieldInformation.h>\n#include <iostream>\n#include <Core\/GeometryPrimitives\/Point.h>\n#include <Core\/Utils\/StringUtil.h>\n#include <boost\/scoped_ptr.hpp>\n#include <Core\/Logging\/Log.h>\n#include <Core\/Math\/MiscMath.h>\n\nusing namespace SCIRun::Core::Algorithms;\nusing namespace SCIRun::Core::Algorithms::Fields;\nusing namespace SCIRun::Core::Geometry;\nusing namespace SCIRun;\nusing namespace SCIRun::Core;\nusing namespace SCIRun::Core::Logging;\n\nAlgorithmParameterName InterfaceWithCleaverAlgorithm::Verbose(\"VerboseCheckBox\");\nAlgorithmParameterName InterfaceWithCleaverAlgorithm::Padding(\"PaddingCheckBox\");\nAlgorithmParameterName InterfaceWithCleaverAlgorithm::VolumeScalingOption(\"VolumeScalingOption\");\nAlgorithmParameterName InterfaceWithCleaverAlgorithm::VolumeScalingX(\"VolumeScalingSpinBox_X\");\nAlgorithmParameterName InterfaceWithCleaverAlgorithm::VolumeScalingY(\"VolumeScalingSpinBox_Y\");\nAlgorithmParameterName InterfaceWithCleaverAlgorithm::VolumeScalingZ(\"VolumeScalingSpinBox_Z\");\n\nInterfaceWithCleaverAlgorithm::InterfaceWithCleaverAlgorithm()\n{\n addParameter(Verbose,true);\n addParameter(Padding,true);\n add_option(VolumeScalingOption, \"Relative size\", \"Absolute size|Relative size|None\");\n addParameter(VolumeScalingX,1.0);\n addParameter(VolumeScalingY,1.0); \n addParameter(VolumeScalingZ,1.0); \n}\n\nboost::shared_ptr<Cleaver::ScalarField> InterfaceWithCleaverAlgorithm::makeCleaverFieldFromLatVol(FieldHandle field )\n{\n VMesh* vmesh = field->vmesh();\n VField* vfield = field->vfield();\n VMesh::dimension_type dims;\n vmesh->get_dimensions( dims ); \n \n float* ptr = static_cast<float*>(vfield->fdata_pointer());\n \n auto cleaverField = boost::make_shared<Cleaver::FloatField>(dims[0], dims[1], dims[2], ptr); \n \n BBox bbox=vmesh->get_bounding_box();\n Point bmin, bmax;\n if (bbox.valid())\n {\n bmin = bbox.min();\n bmax = bbox.max();\n }\n Cleaver::BoundingBox bb = Cleaver::BoundingBox(Cleaver::vec3::zero, Cleaver::vec3(dims[0],dims[1],dims[2]));\n cleaverField->setBounds(bb);\n const Transform &transform = vmesh->get_transform();\n \n int x_spacing=fabs(transform.get_mat_val(0,0)), y_spacing=fabs(transform.get_mat_val(1,1)), z_spacing=fabs(transform.get_mat_val(2,2));\n if (IsNan(x_spacing)) x_spacing=1;\n if (IsNan(y_spacing)) y_spacing=1;\n if (IsNan(z_spacing)) z_spacing=1;\n \n cleaverField->setScale(Cleaver::vec3(x_spacing,y_spacing,z_spacing));\n \n return cleaverField;\n}\n\nFieldHandle InterfaceWithCleaverAlgorithm::run(const std::vector<FieldHandle>& input) const\n{\n FieldHandle output; \n std::vector<FieldHandle> inputs;\n std::copy_if(input.begin(), input.end(), std::back_inserter(inputs), [](FieldHandle f) { return f; });\n\n if (inputs.empty())\n {\n THROW_ALGORITHM_INPUT_ERROR(\" No input fields given \");\n return FieldHandle();\n }\n if (inputs.size()<2)\n {\n THROW_ALGORITHM_INPUT_ERROR(\" At least 2 indicator functions stored as float values are needed to run cleaver! \" );\n return FieldHandle();\n }\n \n std::vector<boost::shared_ptr<Cleaver::ScalarField>> fields; \n\n VMesh::dimension_type dims; int x=0,y=0,z=0; \n for (size_t p=0; p<inputs.size(); p++)\n {\n FieldHandle input = inputs[p];\n VMesh* imesh1 = input->vmesh();\n\n if( !imesh1->is_structuredmesh() )\n {\n THROW_ALGORITHM_INPUT_ERROR(\"needs to be structured mesh!\"); \n } \n else\n {\n VField* vfield1 = input->vfield();\n if (!vfield1->is_scalar())\n {\n THROW_ALGORITHM_INPUT_ERROR(\"values at the node needs to be scalar!\");\n return FieldHandle();\n }\n\n imesh1->get_dimensions( dims ); \n if (p==0)\n {\n x=dims[0]; y=dims[1]; z=dims[2];\n if (x<1 || y<1 || z<1)\n {\n THROW_ALGORITHM_INPUT_ERROR(\" Size of input fields should be non-zero !\");\n }\n }\n else\n {\n if ( dims[0]!=x || dims[1]!=y || dims[2]!=z)\n {\n THROW_ALGORITHM_INPUT_ERROR(\" Size of input fields is inconsistent !\");\n }\n }\n\n if (dims.size()!=3)\n {\n THROW_ALGORITHM_INPUT_ERROR(\"need a three dimensional indicator function\");\n return FieldHandle();\n } \n\n \/\/0 = constant, 1 = linear\n if (1 != vfield1->basis_order())\n {\n THROW_ALGORITHM_INPUT_ERROR(\"Input data need to be defined on input mesh nodes.\");\n } \n \n if (vfield1->is_float())\n { \n float* ptr = static_cast<float*>(vfield1->fdata_pointer());\n\tif (ptr)\n {\t\n fields.push_back(makeCleaverFieldFromLatVol(input));\n }\n else\n {\n THROW_ALGORITHM_INPUT_ERROR(\" float field is NULL pointer\");\n return FieldHandle();\n }\n } else\n {\n THROW_ALGORITHM_INPUT_ERROR(\" Input field needs to be a structured mesh (best would be a LatVol) with float values defnied on mesh nodes. \"); \n }\n\n }\n\n }\n\n boost::shared_ptr<Cleaver::Volume> volume(new Cleaver::Volume(toVectorOfRawPointers(fields)));\n\n const double xScale = get(VolumeScalingX).toDouble();\n const double yScale = get(VolumeScalingY).toDouble();\n const double zScale = get(VolumeScalingZ).toDouble();\n\n if (xScale > 0 && yScale > 0 && zScale > 0)\n {\n const std::string scaling = get_option(VolumeScalingOption);\n if (\"Absolute size\" == scaling) \n {\n volume->setSize(xScale, yScale,zScale);\n }\n else if (\"Relative size\" == scaling)\n {\n double newX = xScale*volume->size().x;\n double newY = yScale*volume->size().y;\n double newZ = zScale*volume->size().z;\n volume->setSize(newX, newY, newZ);\n }\n else \/\/ None\n {\n volume->setSize(dims[0],dims[1],dims[2]);\n }\n }\n else\n {\n THROW_ALGORITHM_INPUT_ERROR(\" Invalid Scaling. Use Input sizes.\");\n }\n \n \/\/\/ Padding is now optional! \n boost::shared_ptr<Cleaver::AbstractVolume> paddedVolume(volume);\n const bool verbose = get(Verbose).toBool();\n const bool pad = get(Padding).toBool();\n if (pad)\n paddedVolume.reset(new Cleaver::PaddedVolume(volume.get()));\n \n std::cout << \"Creating Mesh with Volume Size \" << paddedVolume->size().toString() << std::endl;\n \n boost::scoped_ptr<Cleaver::TetMesh> mesh(Cleaver::createMeshFromVolume(paddedVolume.get(), verbose));\n\n auto nr_of_tets = mesh->tets.size();\n auto nr_of_verts = mesh->verts.size();\n\n if (nr_of_tets==0 || nr_of_verts==0)\n {\n THROW_ALGORITHM_INPUT_ERROR(\" Number of resulting tetrahedral nodes or elements is 0. If you disabled padding enable it and execute again. \");\n }\n\n FieldInformation fi(\"TetVolMesh\",0,\"double\"); \/\/\/create output field\n \n output = CreateField(fi);\n auto omesh = output->vmesh();\n auto ofield = output->vfield();\n\n omesh->node_reserve(nr_of_verts);\n omesh->elem_reserve(nr_of_tets);\n\n for (auto i=0; i<nr_of_verts; i++)\n {\n omesh->add_point(Point(mesh->verts[i]->pos().x,mesh->verts[i]->pos().y,mesh->verts[i]->pos().z));\n }\n\n VMesh::Node::array_type vdata;\n vdata.resize(4);\n std::vector<double> values(nr_of_tets);\n\n for (auto i=0; i<nr_of_tets; i++)\n { \n vdata[0]=mesh->tets[i]->verts[0]->tm_v_index;\n vdata[1]=mesh->tets[i]->verts[1]->tm_v_index;\n vdata[2]=mesh->tets[i]->verts[2]->tm_v_index;\n vdata[3]=mesh->tets[i]->verts[3]->tm_v_index;\n omesh->add_elem(vdata);\n auto mat_label = mesh->tets[i]->mat_label;\n values[i]=mat_label;\n }\n ofield->resize_values();\n ofield->set_values(values);\n mesh->computeAngles();\n std::ostringstream ostr1;\n ostr1 << \"Number of tetrahedral elements:\" << nr_of_tets << std::endl;\n ostr1 << \"Number of tetrahedral nodes:\" << nr_of_verts << std::endl;\n ostr1 << \"Worst Angle (min):\" << mesh->min_angle << std::endl;\n ostr1 << \"Worst Angle (max):\" << mesh->max_angle << std::endl;\n ostr1 << \"Volume:\" << volume->size().toString() << std::endl;\n\n remark(ostr1.str()); \n\n return output;\n}\n\nAlgorithmOutput InterfaceWithCleaverAlgorithm::run_generic(const AlgorithmInput& input) const\n{ \n auto inputfields = input.getList<Field>(Variables::InputFields);\n\n FieldHandle output_fld = run(inputfields); \n if ( !output_fld ) \n THROW_ALGORITHM_PROCESSING_ERROR(\"Null returned on legacy run call.\");\n\n AlgorithmOutput output;\n output[Variables::OutputField] = output_fld;\n return output;\n}\n<commit_msg>Delete unused code<commit_after>\/*\nFor more information, please see: http:\/\/software.sci.utah.edu\n\nThe MIT License\n\nCopyright (c) 2012 Scientific Computing and Imaging Institute,\nUniversity of Utah.\n\nLicense for the specific language governing rights and limitations under\nPermission is hereby granted, free of charge, to any person obtaining a\ncopy of this software and associated documentation files (the \"Software\"),\nto deal in the Software without restriction, including without limitation\nthe rights to use, copy, modify, merge, publish, distribute, sublicense,\nand\/or sell copies of the Software, and to permit persons to whom the\nSoftware is furnished to do so, subject to the following conditions:\n\nThe above copyright notice and this permission notice shall be included\nin all copies or substantial portions of the Software.\n\nTHE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS\nOR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\nFITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL\nTHE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\nLIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING\nFROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER\nDEALINGS IN THE SOFTWARE.\n\nAuthor : Moritz Dannhauer\nLast modification : March 16 2014\nToDo: Padding is always enabled because of exit() in cleaver lib\n*\/\n\n\/\/\/TODO: fix include path to remove Externals\/ part\n\n#include <Externals\/cleaver\/lib\/FloatField.h>\n#include <Externals\/cleaver\/lib\/vec3.h>\n#include <Externals\/cleaver\/lib\/BoundingBox.h>\n#include <Externals\/cleaver\/lib\/Cleaver.h>\n#include <Externals\/cleaver\/lib\/InverseField.h>\n#include <Externals\/cleaver\/lib\/PaddedVolume.h>\n#include <Externals\/cleaver\/lib\/Volume.h>\n#include <Core\/Algorithms\/Base\/AlgorithmPreconditions.h>\n#include <Core\/Algorithms\/Field\/InterfaceWithCleaverAlgorithm.h>\n#include <Core\/Algorithms\/Base\/AlgorithmVariableNames.h>\n#include <Core\/GeometryPrimitives\/Vector.h>\n#include <Core\/Datatypes\/Legacy\/Field\/Field.h>\n#include <Core\/Datatypes\/Legacy\/Field\/VField.h>\n#include <Core\/Datatypes\/Legacy\/Field\/VMesh.h>\n#include <Core\/Datatypes\/Legacy\/Field\/FieldInformation.h>\n#include <iostream>\n#include <Core\/GeometryPrimitives\/Point.h>\n#include <Core\/Utils\/StringUtil.h>\n#include <boost\/scoped_ptr.hpp>\n#include <Core\/Logging\/Log.h>\n#include <Core\/Math\/MiscMath.h>\n\nusing namespace SCIRun::Core::Algorithms;\nusing namespace SCIRun::Core::Algorithms::Fields;\nusing namespace SCIRun::Core::Geometry;\nusing namespace SCIRun;\nusing namespace SCIRun::Core;\nusing namespace SCIRun::Core::Logging;\n\nAlgorithmParameterName InterfaceWithCleaverAlgorithm::Verbose(\"VerboseCheckBox\");\nAlgorithmParameterName InterfaceWithCleaverAlgorithm::Padding(\"PaddingCheckBox\");\nAlgorithmParameterName InterfaceWithCleaverAlgorithm::VolumeScalingOption(\"VolumeScalingOption\");\nAlgorithmParameterName InterfaceWithCleaverAlgorithm::VolumeScalingX(\"VolumeScalingSpinBox_X\");\nAlgorithmParameterName InterfaceWithCleaverAlgorithm::VolumeScalingY(\"VolumeScalingSpinBox_Y\");\nAlgorithmParameterName InterfaceWithCleaverAlgorithm::VolumeScalingZ(\"VolumeScalingSpinBox_Z\");\n\nInterfaceWithCleaverAlgorithm::InterfaceWithCleaverAlgorithm()\n{\n addParameter(Verbose,true);\n addParameter(Padding,true);\n add_option(VolumeScalingOption, \"Relative size\", \"Absolute size|Relative size|None\");\n addParameter(VolumeScalingX,1.0);\n addParameter(VolumeScalingY,1.0); \n addParameter(VolumeScalingZ,1.0); \n}\n\nboost::shared_ptr<Cleaver::ScalarField> InterfaceWithCleaverAlgorithm::makeCleaverFieldFromLatVol(FieldHandle field )\n{\n VMesh* vmesh = field->vmesh();\n VField* vfield = field->vfield();\n VMesh::dimension_type dims;\n vmesh->get_dimensions( dims ); \n \n float* ptr = static_cast<float*>(vfield->fdata_pointer());\n \n auto cleaverField = boost::make_shared<Cleaver::FloatField>(dims[0], dims[1], dims[2], ptr); \n Cleaver::BoundingBox bb(Cleaver::vec3::zero, Cleaver::vec3(dims[0],dims[1],dims[2]));\n cleaverField->setBounds(bb);\n const Transform &transform = vmesh->get_transform();\n \n int x_spacing=fabs(transform.get_mat_val(0,0)), y_spacing=fabs(transform.get_mat_val(1,1)), z_spacing=fabs(transform.get_mat_val(2,2));\n if (IsNan(x_spacing)) x_spacing=1;\n if (IsNan(y_spacing)) y_spacing=1;\n if (IsNan(z_spacing)) z_spacing=1;\n \n cleaverField->setScale(Cleaver::vec3(x_spacing,y_spacing,z_spacing));\n \n return cleaverField;\n}\n\nFieldHandle InterfaceWithCleaverAlgorithm::run(const std::vector<FieldHandle>& input) const\n{\n FieldHandle output; \n std::vector<FieldHandle> inputs;\n std::copy_if(input.begin(), input.end(), std::back_inserter(inputs), [](FieldHandle f) { return f; });\n\n if (inputs.empty())\n {\n THROW_ALGORITHM_INPUT_ERROR(\" No input fields given \");\n return FieldHandle();\n }\n if (inputs.size()<2)\n {\n THROW_ALGORITHM_INPUT_ERROR(\" At least 2 indicator functions stored as float values are needed to run cleaver! \" );\n return FieldHandle();\n }\n \n std::vector<boost::shared_ptr<Cleaver::ScalarField>> fields; \n\n VMesh::dimension_type dims; int x=0,y=0,z=0; \n for (size_t p=0; p<inputs.size(); p++)\n {\n FieldHandle input = inputs[p];\n VMesh* imesh1 = input->vmesh();\n\n if( !imesh1->is_structuredmesh() )\n {\n THROW_ALGORITHM_INPUT_ERROR(\"needs to be structured mesh!\"); \n } \n else\n {\n VField* vfield1 = input->vfield();\n if (!vfield1->is_scalar())\n {\n THROW_ALGORITHM_INPUT_ERROR(\"values at the node needs to be scalar!\");\n return FieldHandle();\n }\n\n imesh1->get_dimensions( dims ); \n if (p==0)\n {\n x=dims[0]; y=dims[1]; z=dims[2];\n if (x<1 || y<1 || z<1)\n {\n THROW_ALGORITHM_INPUT_ERROR(\" Size of input fields should be non-zero !\");\n }\n }\n else\n {\n if ( dims[0]!=x || dims[1]!=y || dims[2]!=z)\n {\n THROW_ALGORITHM_INPUT_ERROR(\" Size of input fields is inconsistent !\");\n }\n }\n\n if (dims.size()!=3)\n {\n THROW_ALGORITHM_INPUT_ERROR(\"need a three dimensional indicator function\");\n return FieldHandle();\n } \n\n \/\/0 = constant, 1 = linear\n if (1 != vfield1->basis_order())\n {\n THROW_ALGORITHM_INPUT_ERROR(\"Input data need to be defined on input mesh nodes.\");\n } \n \n if (vfield1->is_float())\n { \n float* ptr = static_cast<float*>(vfield1->fdata_pointer());\n\tif (ptr)\n {\t\n fields.push_back(makeCleaverFieldFromLatVol(input));\n }\n else\n {\n THROW_ALGORITHM_INPUT_ERROR(\" float field is NULL pointer\");\n return FieldHandle();\n }\n } else\n {\n THROW_ALGORITHM_INPUT_ERROR(\" Input field needs to be a structured mesh (best would be a LatVol) with float values defnied on mesh nodes. \"); \n }\n\n }\n\n }\n\n boost::shared_ptr<Cleaver::Volume> volume(new Cleaver::Volume(toVectorOfRawPointers(fields)));\n\n const double xScale = get(VolumeScalingX).toDouble();\n const double yScale = get(VolumeScalingY).toDouble();\n const double zScale = get(VolumeScalingZ).toDouble();\n\n if (xScale > 0 && yScale > 0 && zScale > 0)\n {\n const std::string scaling = get_option(VolumeScalingOption);\n if (\"Absolute size\" == scaling) \n {\n volume->setSize(xScale, yScale,zScale);\n }\n else if (\"Relative size\" == scaling)\n {\n double newX = xScale*volume->size().x;\n double newY = yScale*volume->size().y;\n double newZ = zScale*volume->size().z;\n volume->setSize(newX, newY, newZ);\n }\n else \/\/ None\n {\n volume->setSize(dims[0],dims[1],dims[2]);\n }\n }\n else\n {\n THROW_ALGORITHM_INPUT_ERROR(\" Invalid Scaling. Use Input sizes.\");\n }\n \n \/\/\/ Padding is now optional! \n boost::shared_ptr<Cleaver::AbstractVolume> paddedVolume(volume);\n const bool verbose = get(Verbose).toBool();\n const bool pad = get(Padding).toBool();\n if (pad)\n paddedVolume.reset(new Cleaver::PaddedVolume(volume.get()));\n \n std::cout << \"Creating Mesh with Volume Size \" << paddedVolume->size().toString() << std::endl;\n \n boost::scoped_ptr<Cleaver::TetMesh> mesh(Cleaver::createMeshFromVolume(paddedVolume.get(), verbose));\n\n auto nr_of_tets = mesh->tets.size();\n auto nr_of_verts = mesh->verts.size();\n\n if (nr_of_tets==0 || nr_of_verts==0)\n {\n THROW_ALGORITHM_INPUT_ERROR(\" Number of resulting tetrahedral nodes or elements is 0. If you disabled padding enable it and execute again. \");\n }\n\n FieldInformation fi(\"TetVolMesh\",0,\"double\"); \/\/\/create output field\n \n output = CreateField(fi);\n auto omesh = output->vmesh();\n auto ofield = output->vfield();\n\n omesh->node_reserve(nr_of_verts);\n omesh->elem_reserve(nr_of_tets);\n\n for (auto i=0; i<nr_of_verts; i++)\n {\n omesh->add_point(Point(mesh->verts[i]->pos().x,mesh->verts[i]->pos().y,mesh->verts[i]->pos().z));\n }\n\n VMesh::Node::array_type vdata;\n vdata.resize(4);\n std::vector<double> values(nr_of_tets);\n\n for (auto i=0; i<nr_of_tets; i++)\n { \n vdata[0]=mesh->tets[i]->verts[0]->tm_v_index;\n vdata[1]=mesh->tets[i]->verts[1]->tm_v_index;\n vdata[2]=mesh->tets[i]->verts[2]->tm_v_index;\n vdata[3]=mesh->tets[i]->verts[3]->tm_v_index;\n omesh->add_elem(vdata);\n auto mat_label = mesh->tets[i]->mat_label;\n values[i]=mat_label;\n }\n ofield->resize_values();\n ofield->set_values(values);\n mesh->computeAngles();\n std::ostringstream ostr1;\n ostr1 << \"Number of tetrahedral elements:\" << nr_of_tets << std::endl;\n ostr1 << \"Number of tetrahedral nodes:\" << nr_of_verts << std::endl;\n ostr1 << \"Worst Angle (min):\" << mesh->min_angle << std::endl;\n ostr1 << \"Worst Angle (max):\" << mesh->max_angle << std::endl;\n ostr1 << \"Volume:\" << volume->size().toString() << std::endl;\n\n remark(ostr1.str()); \n\n return output;\n}\n\nAlgorithmOutput InterfaceWithCleaverAlgorithm::run_generic(const AlgorithmInput& input) const\n{ \n auto inputfields = input.getList<Field>(Variables::InputFields);\n\n FieldHandle output_fld = run(inputfields); \n if ( !output_fld ) \n THROW_ALGORITHM_PROCESSING_ERROR(\"Null returned on legacy run call.\");\n\n AlgorithmOutput output;\n output[Variables::OutputField] = output_fld;\n return output;\n}\n<|endoftext|>"} {"text":"<commit_before>\/** @file mixed_logit.test.cc\n *\n * A \"stress\" test driver for mixed logit.\n *\n * @author Dongryeol Lee (dongryel@cc.gatech.edu)\n *\/\n\n\/\/ for BOOST testing\n#define BOOST_TEST_MAIN\n\n#include <boost\/test\/unit_test.hpp>\n#include <numeric>\n#include <time.h>\n#include \"core\/table\/table.h\"\n#include \"core\/tree\/gen_metric_tree.h\"\n#include \"mlpack\/mixed_logit_dcm\/mixed_logit_dcm_argument_parser.h\"\n#include \"mlpack\/mixed_logit_dcm\/mixed_logit_dcm_dev.h\"\n\nnamespace mlpack {\nnamespace mixed_logit_dcm {\n\nint num_attributes_;\nint num_people_;\nstd::vector<int> num_discrete_choices_;\n\nclass TestMixedLogitDCM {\n\n private:\n\n template<typename TableType>\n void GenerateRandomDataset_(\n TableType *random_attribute_dataset,\n TableType *random_discrete_choice_set_info_dataset) {\n\n \/\/ Find the total number of discrete choices.\n int total_num_attributes =\n std::accumulate(\n mlpack::mixed_logit_dcm::num_discrete_choices_.begin(),\n mlpack::mixed_logit_dcm::num_discrete_choices_.end(), 0);\n\n random_attribute_dataset->Init(\n mlpack::mixed_logit_dcm::num_attributes_, total_num_attributes);\n\n for(int j = 0; j < total_num_attributes; j++) {\n core::table::DensePoint point;\n random_attribute_dataset->get(j, &point);\n for(int i = 0; i < mlpack::mixed_logit_dcm::num_attributes_; i++) {\n point[i] = core::math::Random(0.1, 1.0);\n }\n }\n\n random_discrete_choice_set_info_dataset->Init(\n 2, mlpack::mixed_logit_dcm::num_people_);\n for(int j = 0; j < mlpack::mixed_logit_dcm::num_people_; j++) {\n core::table::DensePoint point;\n random_discrete_choice_set_info_dataset->get(j, &point);\n\n \/\/ This is the discrete choice index of the given person.\n point[0] = core::math::RandInt(\n mlpack::mixed_logit_dcm::num_discrete_choices_[j]);\n\n \/\/ This is the number of discrete choices for the given\n \/\/ person.\n point[1] = mlpack::mixed_logit_dcm::num_discrete_choices_[j];\n }\n }\n\n public:\n\n int StressTestMain() {\n for(int i = 0; i < 20; i++) {\n for(int k = 0; k < 2; k++) {\n\n \/\/ Randomly choose the number of attributes and the number\n \/\/ of people and the number of discrete choices per each\n \/\/ person.\n mlpack::mixed_logit_dcm::num_attributes_ = core::math::RandInt(5, 20);\n mlpack::mixed_logit_dcm::num_people_ = core::math::RandInt(50, 101);\n mlpack::mixed_logit_dcm::num_discrete_choices_.resize(\n mlpack::mixed_logit_dcm::num_people_);\n\n switch(k) {\n case 0:\n\n \/\/ Test the constant distribution.\n StressTest();\n break;\n case 1:\n\n \/\/ Test the Gaussian distribution.\n StressTest();\n break;\n }\n }\n }\n return 0;\n }\n\n int StressTest() {\n\n typedef core::table::Table <\n core::tree::GenMetricTree <\n core::tree::AbstractStatistic > > TableType;\n\n \/\/ The list of arguments.\n std::vector< std::string > args;\n\n \/\/ Push in the reference dataset name.\n std::string attributes_in(\"random_attributes.csv\");\n args.push_back(std::string(\"--attributes_in=\") + attributes_in);\n\n \/\/ Push in the discrete choice set info name.\n std::string discrete_choice_set_info_in(\n \"random_discrete_choice_set_info.csv\");\n args.push_back(\n std::string(\"--discrete_choice_set_info_in=\") +\n discrete_choice_set_info_in);\n\n \/\/ Print out the header of the trial.\n std::cout << \"\\n==================\\n\";\n std::cout << \"Test trial begin\\n\";\n std::cout << \"Number of attributes: \" <<\n mlpack::mixed_logit_dcm::num_attributes_ << \"\\n\";\n std::cout << \"Number of people: \" <<\n mlpack::mixed_logit_dcm::num_people_ << \"\\n\";\n\n \/\/ Generate the random dataset and save it.\n TableType random_attribute_table;\n TableType random_discrete_choice_set_info_table;\n GenerateRandomDataset_(\n &random_attribute_table, &random_discrete_choice_set_info_table);\n random_attribute_table.Save(attributes_in);\n random_discrete_choice_set_info_table.Save(discrete_choice_set_info_in);\n\n \/\/ Parse the mixed logit DCM arguments.\n mlpack::mixed_logit_dcm::MixedLogitDCMArguments<TableType> arguments;\n boost::program_options::variables_map vm;\n mlpack::mixed_logit_dcm::MixedLogitDCMArgumentParser::\n ConstructBoostVariableMap(args, &vm);\n mlpack::mixed_logit_dcm::MixedLogitDCMArgumentParser::ParseArguments(\n vm, &arguments);\n\n \/\/ Call the mixed logit driver.\n mlpack::mixed_logit_dcm::MixedLogitDCM<TableType> instance;\n instance.Init(arguments);\n\n \/\/ Compute the result.\n mlpack::mixed_logit_dcm::MixedLogitDCMResult result;\n instance.Compute(arguments, &result);\n\n return 0;\n };\n};\n}\n}\n\nBOOST_AUTO_TEST_SUITE(TestSuiteMixedLogitDCM)\nBOOST_AUTO_TEST_CASE(TestCaseMixedLogitDCM) {\n\n \/\/ Call the tests.\n mlpack::mixed_logit_dcm::TestMixedLogitDCM dcm_test;\n dcm_test.StressTestMain();\n\n std::cout << \"All tests passed!\\n\";\n}\nBOOST_AUTO_TEST_SUITE_END()\n<commit_msg>Almost there.<commit_after>\/** @file mixed_logit.test.cc\n *\n * A \"stress\" test driver for mixed logit.\n *\n * @author Dongryeol Lee (dongryel@cc.gatech.edu)\n *\/\n\n\/\/ for BOOST testing\n#define BOOST_TEST_MAIN\n\n#include <boost\/test\/unit_test.hpp>\n#include <numeric>\n#include <time.h>\n#include \"core\/table\/table.h\"\n#include \"core\/tree\/gen_metric_tree.h\"\n#include \"mlpack\/mixed_logit_dcm\/mixed_logit_dcm_argument_parser.h\"\n#include \"mlpack\/mixed_logit_dcm\/mixed_logit_dcm_dev.h\"\n\nnamespace mlpack {\nnamespace mixed_logit_dcm {\n\nint num_attributes_;\nint num_people_;\nstd::vector<int> num_discrete_choices_;\n\nclass TestMixedLogitDCM {\n\n private:\n\n template<typename TableType>\n void GenerateRandomDataset_(\n TableType *random_attribute_dataset,\n TableType *random_discrete_choice_set_info_dataset) {\n\n \/\/ Find the total number of discrete choices.\n int total_num_attributes =\n std::accumulate(\n mlpack::mixed_logit_dcm::num_discrete_choices_.begin(),\n mlpack::mixed_logit_dcm::num_discrete_choices_.end(), 0);\n\n random_attribute_dataset->Init(\n mlpack::mixed_logit_dcm::num_attributes_, total_num_attributes);\n\n for(int j = 0; j < total_num_attributes; j++) {\n core::table::DensePoint point;\n random_attribute_dataset->get(j, &point);\n for(int i = 0; i < mlpack::mixed_logit_dcm::num_attributes_; i++) {\n point[i] = core::math::Random(0.1, 1.0);\n }\n }\n\n random_discrete_choice_set_info_dataset->Init(\n 2, mlpack::mixed_logit_dcm::num_people_);\n for(int j = 0; j < mlpack::mixed_logit_dcm::num_people_; j++) {\n core::table::DensePoint point;\n random_discrete_choice_set_info_dataset->get(j, &point);\n\n \/\/ This is the discrete choice index of the given person.\n point[0] = core::math::RandInt(\n mlpack::mixed_logit_dcm::num_discrete_choices_[j]);\n\n \/\/ This is the number of discrete choices for the given\n \/\/ person.\n point[1] = mlpack::mixed_logit_dcm::num_discrete_choices_[j];\n }\n }\n\n public:\n\n int StressTestMain() {\n for(int i = 0; i < 20; i++) {\n for(int k = 0; k < 2; k++) {\n\n \/\/ Randomly choose the number of attributes and the number\n \/\/ of people and the number of discrete choices per each\n \/\/ person.\n mlpack::mixed_logit_dcm::num_attributes_ = core::math::RandInt(5, 20);\n mlpack::mixed_logit_dcm::num_people_ = core::math::RandInt(50, 101);\n mlpack::mixed_logit_dcm::num_discrete_choices_.resize(\n mlpack::mixed_logit_dcm::num_people_);\n for(int j = 0; j < mlpack::mixed_logit_dcm::num_people_; j++) {\n mlpack::mixed_logit_dcm::num_discrete_choices_[j] =\n core::math::RandInt(3, 7);\n }\n\n switch(k) {\n case 0:\n\n \/\/ Test the constant distribution.\n StressTest();\n break;\n case 1:\n\n \/\/ Test the Gaussian distribution.\n StressTest();\n break;\n }\n }\n }\n return 0;\n }\n\n int StressTest() {\n\n typedef core::table::Table <\n core::tree::GenMetricTree <\n core::tree::AbstractStatistic > > TableType;\n\n \/\/ The list of arguments.\n std::vector< std::string > args;\n\n \/\/ Push in the reference dataset name.\n std::string attributes_in(\"random_attributes.csv\");\n args.push_back(std::string(\"--attributes_in=\") + attributes_in);\n\n \/\/ Push in the discrete choice set info name.\n std::string discrete_choice_set_info_in(\n \"random_discrete_choice_set_info.csv\");\n args.push_back(\n std::string(\"--discrete_choice_set_info_in=\") +\n discrete_choice_set_info_in);\n\n \/\/ Print out the header of the trial.\n std::cout << \"\\n==================\\n\";\n std::cout << \"Test trial begin\\n\";\n std::cout << \"Number of attributes: \" <<\n mlpack::mixed_logit_dcm::num_attributes_ << \"\\n\";\n std::cout << \"Number of people: \" <<\n mlpack::mixed_logit_dcm::num_people_ << \"\\n\";\n\n \/\/ Generate the random dataset and save it.\n TableType random_attribute_table;\n TableType random_discrete_choice_set_info_table;\n GenerateRandomDataset_(\n &random_attribute_table, &random_discrete_choice_set_info_table);\n random_attribute_table.Save(attributes_in);\n random_discrete_choice_set_info_table.Save(discrete_choice_set_info_in);\n\n \/\/ Parse the mixed logit DCM arguments.\n mlpack::mixed_logit_dcm::MixedLogitDCMArguments<TableType> arguments;\n boost::program_options::variables_map vm;\n mlpack::mixed_logit_dcm::MixedLogitDCMArgumentParser::\n ConstructBoostVariableMap(args, &vm);\n mlpack::mixed_logit_dcm::MixedLogitDCMArgumentParser::ParseArguments(\n vm, &arguments);\n\n \/\/ Call the mixed logit driver.\n mlpack::mixed_logit_dcm::MixedLogitDCM<TableType> instance;\n instance.Init(arguments);\n\n \/\/ Compute the result.\n mlpack::mixed_logit_dcm::MixedLogitDCMResult result;\n instance.Compute(arguments, &result);\n\n return 0;\n };\n};\n}\n}\n\nBOOST_AUTO_TEST_SUITE(TestSuiteMixedLogitDCM)\nBOOST_AUTO_TEST_CASE(TestCaseMixedLogitDCM) {\n\n \/\/ Call the tests.\n mlpack::mixed_logit_dcm::TestMixedLogitDCM dcm_test;\n dcm_test.StressTestMain();\n\n std::cout << \"All tests passed!\\n\";\n}\nBOOST_AUTO_TEST_SUITE_END()\n<|endoftext|>"} {"text":"<commit_before>\/* IBM_PROLOG_BEGIN_TAG *\/\n\/* This is an automatically generated prolog. *\/\n\/* *\/\n\/* $Source: src\/import\/chips\/p9\/procedures\/hwp\/memory\/lib\/dimm\/ddr4\/latch_wr_vref.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 latch_wr_vref.C\n\/\/\/ @brief Latches WR VREF according to JEDEC spec\n\/\/\/\n\/\/ *HWP HWP Owner: Stephen Glancy <sglancy@us.ibm.com>\n\/\/ *HWP HWP Backup: Brian Silver <bsilver@us.ibm.com>\n\/\/ *HWP Team: Memory\n\/\/ *HWP Level: 2\n\/\/ *HWP Consumed by: FSP:HB Memory\n\n#include <vector>\n#include <fapi2.H>\n#include <c_str.H>\n#include <lib\/dimm\/ddr4\/mrs_load_ddr4.H>\n#include <lib\/dimm\/ddr4\/latch_wr_vref.H>\n#include <lib\/dimm\/rank.H>\n\nusing fapi2::TARGET_TYPE_MCBIST;\nusing fapi2::TARGET_TYPE_DIMM;\n\nnamespace mss\n{\n\nnamespace ddr4\n{\n\n\/\/\/\n\/\/\/ @brief Add latching commands for WR VREF to the instruction array - allows for custom MR06 data\n\/\/\/ @param[in] i_target, a fapi2::Target<TARGET_TYPE_DIMM>\n\/\/\/ @param[in] i_mrs06, base MRS 06 allows the user to setup custom values and pass it in\n\/\/\/ @param[in] i_rank, rank on which to latch MRS 06\n\/\/\/ @param[in,out] a vector of CCS instructions we should add to\n\/\/\/ @return FAPI2_RC_SUCCESS if and only if ok\n\/\/\/\nfapi2::ReturnCode add_latch_wr_vref_commands( const fapi2::Target<fapi2::TARGET_TYPE_DIMM>& i_target,\n const mrs06_data& i_mrs06,\n const uint64_t& i_rank,\n std::vector< ccs::instruction_t<fapi2::TARGET_TYPE_MCBIST> >& io_inst)\n{\n \/\/ JEDEC has a 3 step latching process for WR VREF\n \/\/ 1) enter into VREFDQ training mode, with the desired range value is XXXXXX\n \/\/ 2) set the VREFDQ value while in training mode - this actually latches the value\n \/\/ 3) exit VREFDQ training mode and go into normal operation mode\n\n \/\/ Adds both VREFDQ train enables\n \/\/ Note: this isn't general - assumes Nimbus via MCBIST instruction here BRS\n auto l_mr_override = i_mrs06;\n\n \/\/ Add both to the CCS program - JEDEC step 1\n enable_vref_train_enable(l_mr_override);\n FAPI_TRY( mrs_engine(i_target, l_mr_override, i_rank, mss::tvrefdqe(i_target), io_inst) );\n\n \/\/ Add both to the CCS program - JEDEC step 2\n FAPI_TRY( mrs_engine(i_target, l_mr_override, i_rank, mss::tvrefdqe(i_target), io_inst) );\n\n \/\/ Hits VREFDQ train disable - putting the DRAM's back in mainline mode\n \/\/ Add both to the CCS program - JEDEC step 3\n disable_vref_train_enable(l_mr_override);\n FAPI_TRY( mrs_engine(i_target, l_mr_override, i_rank, mss::tvrefdqe(i_target), io_inst) );\n\nfapi_try_exit:\n return fapi2::current_err;\n}\n\n\/\/\/\n\/\/\/ @brief Add latching commands for WR VREF to the instruction array\n\/\/\/ @param[in] i_target, a fapi2::Target<TARGET_TYPE_MCA>\n\/\/\/ @param[in] i_rank_pair, rank pair on which to latch MRS 06 - hits all ranks in the rank pair\n\/\/\/ @param[in] i_train_range, VREF range to setup\n\/\/\/ @param[in] i_train_value, VREF value to setup\n\/\/\/ @param[in,out] a vector of CCS instructions we should add to\n\/\/\/ @return FAPI2_RC_SUCCESS if and only if ok\n\/\/\/\nfapi2::ReturnCode latch_wr_vref_commands_by_rank_pair( const fapi2::Target<fapi2::TARGET_TYPE_MCA>& i_target,\n const uint64_t& i_rank_pair,\n const uint8_t& i_train_range,\n const uint8_t& i_train_value)\n{\n \/\/ Declares variables\n const auto l_mcbist = find_target<fapi2::TARGET_TYPE_MCBIST>(i_target);\n const auto l_dimms = mss::find_targets<fapi2::TARGET_TYPE_DIMM>(i_target);\n mss::ccs::program<fapi2::TARGET_TYPE_MCBIST, fapi2::TARGET_TYPE_MCA> l_program;\n std::vector<uint64_t> l_ranks;\n\n \/\/ Gets the ranks on which to latch the VREF's\n FAPI_TRY(mss::rank::get_ranks_in_pair( i_target, i_rank_pair, l_ranks));\n\n \/\/ Adds in latching commands for all ranks\n for( const auto& l_rank : l_ranks)\n {\n \/\/ Skips this rank if no rank is configured\n if( l_rank == NO_RANK)\n {\n continue;\n }\n\n \/\/ Sets up the DIMM target\n const auto l_dimm = (l_rank < MAX_RANK_PER_DIMM) ? l_dimms[0] : l_dimms[1];\n\n \/\/ Adds the latching commands to the CCS program for this current rank\n FAPI_TRY(setup_latch_wr_vref_commands_by_rank(l_dimm,\n l_rank,\n i_train_range,\n i_train_value,\n l_program.iv_instructions));\n }\n\n \/\/ Executes the CCS commands\n FAPI_TRY( mss::ccs::execute(l_mcbist, l_program, i_target) );\n\nfapi_try_exit:\n return fapi2::current_err;\n}\n\n\/\/\/\n\/\/\/ @brief Add latching commands for WR VREF to the instruction array by a given rank\n\/\/\/ @param[in] i_target, a fapi2::Target<TARGET_TYPE_MCA>\n\/\/\/ @param[in] i_rank, rank on which to latch MRS 06 - hits all ranks in the rank pair\n\/\/\/ @param[in] i_train_range, VREF range to setup\n\/\/\/ @param[in] i_train_value, VREF value to setup\n\/\/\/ @param[in,out] a vector of CCS instructions we should add to\n\/\/\/ @return FAPI2_RC_SUCCESS if and only if ok\n\/\/\/\nfapi2::ReturnCode setup_latch_wr_vref_commands_by_rank( const fapi2::Target<fapi2::TARGET_TYPE_DIMM>& i_target,\n const uint64_t& i_rank,\n const uint8_t& i_train_range,\n const uint8_t& i_train_value,\n std::vector< ccs::instruction_t<fapi2::TARGET_TYPE_MCBIST> >& io_inst)\n{\n \/\/ Check to make sure our ctor worked ok\n mrs06_data l_mrs06( i_target, fapi2::current_err );\n FAPI_TRY( fapi2::current_err, \"Unable to construct MRS06 data from attributes\");\n\n \/\/ Setup training range if the value is not the default\n if(i_train_range != wr_vref_override::USE_DEFAULT_WR_VREF_SETTINGS)\n {\n FAPI_INF(\"%s Overriding vrefdq train %s data to be 0x%02x for rank %lu\", mss::c_str(i_target), \"range\", i_train_value,\n i_rank);\n\n \/\/ Sets up the MR information\n for(uint64_t i = 0; i < MAX_RANK_PER_DIMM; ++i)\n {\n l_mrs06.iv_vrefdq_train_range[i] = i_train_range;\n }\n }\n\n \/\/ Setup training value if the value is not the default\n if(i_train_value != wr_vref_override::USE_DEFAULT_WR_VREF_SETTINGS)\n {\n FAPI_INF(\"%s Overriding vrefdq train %s data to be 0x%02x for rank %lu\", mss::c_str(i_target), \"value\", i_train_value,\n i_rank);\n\n \/\/ Sets up the MR information\n for(uint64_t i = 0; i < MAX_RANK_PER_DIMM; ++i)\n {\n l_mrs06.iv_vrefdq_train_value[i] = i_train_value;\n }\n }\n\n \/\/ Adds the latching commands\n FAPI_TRY(add_latch_wr_vref_commands(i_target,\n l_mrs06,\n i_rank,\n io_inst));\n\nfapi_try_exit:\n return fapi2::current_err;\n}\n\n} \/\/ close namespace DDR4\n} \/\/ close namespace mss\n<commit_msg>Fix 1R dual-drop bugs<commit_after>\/* IBM_PROLOG_BEGIN_TAG *\/\n\/* This is an automatically generated prolog. *\/\n\/* *\/\n\/* $Source: src\/import\/chips\/p9\/procedures\/hwp\/memory\/lib\/dimm\/ddr4\/latch_wr_vref.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 latch_wr_vref.C\n\/\/\/ @brief Latches WR VREF according to JEDEC spec\n\/\/\/\n\/\/ *HWP HWP Owner: Stephen Glancy <sglancy@us.ibm.com>\n\/\/ *HWP HWP Backup: Brian Silver <bsilver@us.ibm.com>\n\/\/ *HWP Team: Memory\n\/\/ *HWP Level: 2\n\/\/ *HWP Consumed by: FSP:HB Memory\n\n#include <vector>\n#include <fapi2.H>\n#include <c_str.H>\n#include <lib\/dimm\/ddr4\/mrs_load_ddr4.H>\n#include <lib\/dimm\/ddr4\/latch_wr_vref.H>\n#include <lib\/dimm\/rank.H>\n\nusing fapi2::TARGET_TYPE_MCBIST;\nusing fapi2::TARGET_TYPE_DIMM;\n\nnamespace mss\n{\n\nnamespace ddr4\n{\n\n\/\/\/\n\/\/\/ @brief Add latching commands for WR VREF to the instruction array - allows for custom MR06 data\n\/\/\/ @param[in] i_target, a fapi2::Target<TARGET_TYPE_DIMM>\n\/\/\/ @param[in] i_mrs06, base MRS 06 allows the user to setup custom values and pass it in\n\/\/\/ @param[in] i_rank, rank on which to latch MRS 06\n\/\/\/ @param[in,out] a vector of CCS instructions we should add to\n\/\/\/ @return FAPI2_RC_SUCCESS if and only if ok\n\/\/\/\nfapi2::ReturnCode add_latch_wr_vref_commands( const fapi2::Target<fapi2::TARGET_TYPE_DIMM>& i_target,\n const mrs06_data& i_mrs06,\n const uint64_t& i_rank,\n std::vector< ccs::instruction_t<fapi2::TARGET_TYPE_MCBIST> >& io_inst)\n{\n \/\/ JEDEC has a 3 step latching process for WR VREF\n \/\/ 1) enter into VREFDQ training mode, with the desired range value is XXXXXX\n \/\/ 2) set the VREFDQ value while in training mode - this actually latches the value\n \/\/ 3) exit VREFDQ training mode and go into normal operation mode\n\n \/\/ Adds both VREFDQ train enables\n \/\/ Note: this isn't general - assumes Nimbus via MCBIST instruction here BRS\n auto l_mr_override = i_mrs06;\n\n \/\/ Add both to the CCS program - JEDEC step 1\n enable_vref_train_enable(l_mr_override);\n FAPI_TRY( mrs_engine(i_target, l_mr_override, i_rank, mss::tvrefdqe(i_target), io_inst) );\n\n \/\/ Add both to the CCS program - JEDEC step 2\n FAPI_TRY( mrs_engine(i_target, l_mr_override, i_rank, mss::tvrefdqe(i_target), io_inst) );\n\n \/\/ Hits VREFDQ train disable - putting the DRAM's back in mainline mode\n \/\/ Add both to the CCS program - JEDEC step 3\n disable_vref_train_enable(l_mr_override);\n FAPI_TRY( mrs_engine(i_target, l_mr_override, i_rank, mss::tvrefdqe(i_target), io_inst) );\n\nfapi_try_exit:\n return fapi2::current_err;\n}\n\n\/\/\/\n\/\/\/ @brief Add latching commands for WR VREF to the instruction array\n\/\/\/ @param[in] i_target, a fapi2::Target<TARGET_TYPE_MCA>\n\/\/\/ @param[in] i_rank_pair, rank pair on which to latch MRS 06 - hits all ranks in the rank pair\n\/\/\/ @param[in] i_train_range, VREF range to setup\n\/\/\/ @param[in] i_train_value, VREF value to setup\n\/\/\/ @param[in,out] a vector of CCS instructions we should add to\n\/\/\/ @return FAPI2_RC_SUCCESS if and only if ok\n\/\/\/\nfapi2::ReturnCode latch_wr_vref_commands_by_rank_pair( const fapi2::Target<fapi2::TARGET_TYPE_MCA>& i_target,\n const uint64_t& i_rank_pair,\n const uint8_t& i_train_range,\n const uint8_t& i_train_value)\n{\n \/\/ Declares variables\n const auto l_mcbist = find_target<fapi2::TARGET_TYPE_MCBIST>(i_target);\n \/\/ Warning: l_dimm is not a valid Target and will crash Cronus if used before it gets filled in by mss::rank::get_dimm_target_from_rank\n fapi2::Target<fapi2::TARGET_TYPE_DIMM> l_dimm;\n mss::ccs::program<fapi2::TARGET_TYPE_MCBIST, fapi2::TARGET_TYPE_MCA> l_program;\n std::vector<uint64_t> l_ranks;\n\n \/\/ Gets the ranks on which to latch the VREF's\n FAPI_TRY(mss::rank::get_ranks_in_pair( i_target, i_rank_pair, l_ranks));\n\n \/\/ Adds in latching commands for all ranks\n for (const auto& l_rank : l_ranks)\n {\n \/\/ Skips this rank if no rank is configured\n if (l_rank == NO_RANK)\n {\n continue;\n }\n\n \/\/ Ensures we get a valid DIMM target \/ rank combo\n FAPI_TRY( mss::rank::get_dimm_target_from_rank(i_target, l_rank, l_dimm) );\n\n \/\/ Adds the latching commands to the CCS program for this current rank\n FAPI_TRY(setup_latch_wr_vref_commands_by_rank(l_dimm,\n l_rank,\n i_train_range,\n i_train_value,\n l_program.iv_instructions));\n }\n\n \/\/ Executes the CCS commands\n FAPI_TRY( mss::ccs::execute(l_mcbist, l_program, i_target) );\n\nfapi_try_exit:\n return fapi2::current_err;\n}\n\n\/\/\/\n\/\/\/ @brief Add latching commands for WR VREF to the instruction array by a given rank\n\/\/\/ @param[in] i_target, a fapi2::Target<TARGET_TYPE_MCA>\n\/\/\/ @param[in] i_rank, rank on which to latch MRS 06 - hits all ranks in the rank pair\n\/\/\/ @param[in] i_train_range, VREF range to setup\n\/\/\/ @param[in] i_train_value, VREF value to setup\n\/\/\/ @param[in,out] a vector of CCS instructions we should add to\n\/\/\/ @return FAPI2_RC_SUCCESS if and only if ok\n\/\/\/\nfapi2::ReturnCode setup_latch_wr_vref_commands_by_rank( const fapi2::Target<fapi2::TARGET_TYPE_DIMM>& i_target,\n const uint64_t& i_rank,\n const uint8_t& i_train_range,\n const uint8_t& i_train_value,\n std::vector< ccs::instruction_t<fapi2::TARGET_TYPE_MCBIST> >& io_inst)\n{\n \/\/ Check to make sure our ctor worked ok\n mrs06_data l_mrs06( i_target, fapi2::current_err );\n FAPI_TRY( fapi2::current_err, \"Unable to construct MRS06 data from attributes\");\n\n \/\/ Setup training range if the value is not the default\n if(i_train_range != wr_vref_override::USE_DEFAULT_WR_VREF_SETTINGS)\n {\n FAPI_INF(\"%s Overriding vrefdq train %s data to be 0x%02x for rank %lu\", mss::c_str(i_target), \"range\", i_train_value,\n i_rank);\n\n \/\/ Sets up the MR information\n for(uint64_t i = 0; i < MAX_RANK_PER_DIMM; ++i)\n {\n l_mrs06.iv_vrefdq_train_range[i] = i_train_range;\n }\n }\n\n \/\/ Setup training value if the value is not the default\n if(i_train_value != wr_vref_override::USE_DEFAULT_WR_VREF_SETTINGS)\n {\n FAPI_INF(\"%s Overriding vrefdq train %s data to be 0x%02x for rank %lu\", mss::c_str(i_target), \"value\", i_train_value,\n i_rank);\n\n \/\/ Sets up the MR information\n for(uint64_t i = 0; i < MAX_RANK_PER_DIMM; ++i)\n {\n l_mrs06.iv_vrefdq_train_value[i] = i_train_value;\n }\n }\n\n \/\/ Adds the latching commands\n FAPI_TRY(add_latch_wr_vref_commands(i_target,\n l_mrs06,\n i_rank,\n io_inst));\n\nfapi_try_exit:\n return fapi2::current_err;\n}\n\n} \/\/ close namespace DDR4\n} \/\/ close namespace mss\n<|endoftext|>"} {"text":"<commit_before>#include \"Wren++.h\"\n#include <cstdlib> \/\/ for malloc\n#include <cstring> \/\/ for strcmp, memcpy\n#include <cassert>\n#include <iostream>\n\nnamespace\n{\n\nstruct BoundState\n{\n std::unordered_map< std::size_t, WrenForeignMethodFn > methods{};\n std::unordered_map< std::size_t, WrenForeignClassMethods > classes{};\n};\n\nWrenForeignMethodFn foreignMethodProvider(WrenVM* vm,\n const char* module,\n const char* className,\n bool isStatic,\n const char* signature)\n{\n auto* boundState = (BoundState*)wrenGetUserData(vm);\n auto it = boundState->methods.find(wrenpp::detail::hashMethodSignature(module, className, isStatic, signature));\n if (it == boundState->methods.end())\n {\n return NULL;\n }\n\n return it->second;\n}\n\nWrenForeignClassMethods foreignClassProvider(WrenVM* vm, const char* m, const char* c)\n{\n auto* boundState = (BoundState*)wrenGetUserData(vm);\n auto it = boundState->classes.find(wrenpp::detail::hashClassSignature(m, c));\n if (it == boundState->classes.end())\n {\n return WrenForeignClassMethods{ nullptr, nullptr };\n }\n\n return it->second;\n}\n\ninline const char* errorTypeToString(WrenErrorType type)\n{\n switch (type)\n {\n case WREN_ERROR_COMPILE: return \"WREN_ERROR_COMPILE\";\n case WREN_ERROR_RUNTIME: return \"WREN_ERROR_RUNTIME\";\n case WREN_ERROR_STACK_TRACE: return \"WREN_ERROR_STACK_TRACE\";\n default: assert(false); return \"\";\n }\n}\n\nchar* loadModuleFnWrapper(WrenVM* vm, const char* mod)\n{\n return wrenpp::VM::loadModuleFn(mod);\n}\n\nvoid writeFnWrapper(WrenVM* vm, const char* text)\n{\n wrenpp::VM::writeFn(text);\n}\n\nvoid errorFnWrapper(WrenVM*, WrenErrorType type, const char* module, int line, const char* message)\n{\n wrenpp::VM::errorFn(type, module, line, message);\n}\n\nvoid* reallocateFnWrapper(void* memory, std::size_t newSize)\n{\n return wrenpp::VM::reallocateFn(memory, newSize);\n}\n\n}\n\nnamespace wrenpp\n{\n\nnamespace detail\n{\nvoid registerFunction(WrenVM* vm, const std::string& mod, const std::string& cName, bool isStatic, std::string sig, WrenForeignMethodFn function)\n{\n BoundState* boundState = (BoundState*)wrenGetUserData(vm);\n std::size_t hash = detail::hashMethodSignature(mod.c_str(), cName.c_str(), isStatic, sig.c_str());\n boundState->methods.insert(std::make_pair(hash, function));\n}\n\nvoid registerClass(WrenVM* vm, const std::string& mod, std::string cName, WrenForeignClassMethods methods)\n{\n BoundState* boundState = (BoundState*)wrenGetUserData(vm);\n std::size_t hash = detail::hashClassSignature(mod.c_str(), cName.c_str());\n boundState->classes.insert(std::make_pair(hash, methods));\n}\n\n}\n\nValue::Value(bool val)\n : valueType_{ WREN_TYPE_BOOL }, string_{ nullptr }\n{\n set_(val);\n}\n\nValue::Value(float val)\n : valueType_{ WREN_TYPE_NUM }, string_{ nullptr }\n{\n set_(val);\n}\n\nValue::Value(double val)\n : valueType_{ WREN_TYPE_NUM }, string_{ nullptr }\n{\n set_(val);\n}\n\nValue::Value(int val)\n : valueType_{ WREN_TYPE_NUM }, string_{ nullptr }\n{\n set_(val);\n}\n\nValue::Value(unsigned int val)\n : valueType_{ WREN_TYPE_NUM }, string_{ nullptr }\n{\n set_(val);\n}\n\nValue::Value(const char* str)\n : valueType_{ WREN_TYPE_STRING }, string_{ nullptr }\n{\n string_ = (char*)VM::reallocateFn(nullptr, std::strlen(str) + 1);\n std::strcpy(string_, str);\n}\n\nValue::~Value()\n{\n if (string_)\n {\n VM::reallocateFn(string_, 0u);\n }\n}\n\nMethod::Method(VM* vm, WrenHandle* variable, WrenHandle* method)\n : vm_(vm),\n method_(method),\n variable_(variable)\n{}\n\nMethod::Method(Method&& other)\n : vm_(other.vm_),\n method_(other.method_),\n variable_(other.variable_)\n{\n other.vm_ = nullptr;\n other.method_ = nullptr;\n other.variable_ = nullptr;\n}\n\nMethod::~Method()\n{\n if (vm_)\n {\n assert(method_ && variable_);\n wrenReleaseHandle(vm_->vm(), method_);\n wrenReleaseHandle(vm_->vm(), variable_);\n }\n}\n\nMethod& Method::operator=(Method&& rhs)\n{\n vm_ = rhs.vm_;\n method_ = rhs.method_;\n variable_ = rhs.variable_;\n rhs.vm_ = nullptr;\n rhs.method_ = nullptr;\n rhs.variable_ = nullptr;\n\n return *this;\n}\n\nClassContext ModuleContext::beginClass(std::string c)\n{\n return ClassContext(c, *this);\n}\n\nvoid ModuleContext::endModule() {}\n\nModuleContext& ClassContext::endClass()\n{\n return module_;\n}\n\nClassContext::ClassContext(std::string c, ModuleContext& mod)\n : module_(mod),\n class_(c)\n{}\n\nClassContext& ClassContext::bindCFunction(bool isStatic, std::string signature, WrenForeignMethodFn function)\n{\n detail::registerFunction(module_.vm_, module_.name_, class_, isStatic, signature, function);\n return *this;\n}\n\n\/*\n * Returns the source as a heap-allocated string.\n * Uses malloc, because our reallocateFn is set to default:\n * it uses malloc, realloc and free.\n * *\/\nLoadModuleFn VM::loadModuleFn = [](const char* mod) -> char*\n{\n std::string path(mod);\n path += \".wren\";\n std::string source;\n try\n {\n source = wrenpp::detail::fileToString(path);\n }\n catch (const std::exception&)\n {\n return NULL;\n }\n char* buffer = (char*)malloc(source.size());\n assert(buffer != nullptr);\n memcpy(buffer, source.c_str(), source.size());\n return buffer;\n};\n\nWriteFn VM::writeFn = [](const char* text) -> void\n{\n std::cout << text;\n};\n\nErrorFn VM::errorFn = [](WrenErrorType type, const char* module, int line, const char* message) -> void\n{\n const char* typeStr = errorTypeToString(type);\n std::cout << typeStr << \" in \" << module << \":\" << line << \" > \" << message << std::endl;\n};\n\nReallocateFn VM::reallocateFn = std::realloc;\n\nstd::size_t VM::initialHeapSize = 0xA00000u;\n\nstd::size_t VM::minHeapSize = 0x100000u;\n\nint VM::heapGrowthPercent = 50;\n\nstd::size_t VM::chunkSize = 0x500000u;\n\nVM::VM()\n : vm_{ nullptr }\n{\n WrenConfiguration configuration{};\n wrenInitConfiguration(&configuration);\n configuration.reallocateFn = reallocateFnWrapper;\n configuration.initialHeapSize = initialHeapSize;\n configuration.minHeapSize = minHeapSize;\n configuration.heapGrowthPercent = heapGrowthPercent;\n configuration.bindForeignMethodFn = foreignMethodProvider;\n configuration.loadModuleFn = loadModuleFnWrapper;\n configuration.bindForeignClassFn = foreignClassProvider;\n configuration.writeFn = writeFnWrapper;\n configuration.errorFn = errorFnWrapper;\n configuration.userData = new BoundState();\n\n vm_ = wrenNewVM(&configuration);\n}\n\nVM::VM(VM&& other)\n : vm_{ other.vm_ }\n{\n other.vm_ = nullptr;\n}\n\nVM& VM::operator=(VM&& rhs)\n{\n vm_ = rhs.vm_;\n rhs.vm_ = nullptr;\n return *this;\n}\n\nVM::~VM()\n{\n if (vm_ != nullptr)\n {\n delete (BoundState*)wrenGetUserData(vm_);\n wrenFreeVM(vm_);\n }\n}\n\nWrenVM* VM::vm()\n{\n return vm_;\n}\n\nResult VM::executeModule(const std::string& mod)\n{\n const std::string source(loadModuleFn(mod.c_str()));\n auto res = wrenInterpret(vm_, source.c_str());\n\n if (res == WrenInterpretResult::WREN_RESULT_COMPILE_ERROR)\n {\n return Result::CompileError;\n }\n\n if (res == WrenInterpretResult::WREN_RESULT_RUNTIME_ERROR)\n {\n return Result::RuntimeError;\n }\n\n return Result::Success;\n}\n\nResult VM::executeString(const std::string& code)\n{\n auto res = wrenInterpret(vm_, code.c_str());\n\n if (res == WrenInterpretResult::WREN_RESULT_COMPILE_ERROR)\n {\n return Result::CompileError;\n }\n\n if (res == WrenInterpretResult::WREN_RESULT_RUNTIME_ERROR)\n {\n return Result::RuntimeError;\n }\n\n return Result::Success;\n}\n\nvoid VM::collectGarbage()\n{\n wrenCollectGarbage(vm_);\n}\n\nMethod VM::method(\n const std::string& mod,\n const std::string& var,\n const std::string& sig\n)\n{\n wrenEnsureSlots(vm_, 1);\n wrenGetVariable(vm_, mod.c_str(), var.c_str(), 0);\n WrenHandle* variable = wrenGetSlotHandle(vm_, 0);\n WrenHandle* handle = wrenMakeCallHandle(vm_, sig.c_str());\n return Method(this, variable, handle);\n}\n\nModuleContext VM::beginModule(std::string name)\n{\n return ModuleContext(vm_, name);\n}\n\n}\n<commit_msg>Default error print must allow null module name<commit_after>#include \"Wren++.h\"\n#include <cstdlib> \/\/ for malloc\n#include <cstring> \/\/ for strcmp, memcpy\n#include <cassert>\n#include <iostream>\n\nnamespace\n{\n\nstruct BoundState\n{\n std::unordered_map< std::size_t, WrenForeignMethodFn > methods{};\n std::unordered_map< std::size_t, WrenForeignClassMethods > classes{};\n};\n\nWrenForeignMethodFn foreignMethodProvider(WrenVM* vm,\n const char* module,\n const char* className,\n bool isStatic,\n const char* signature)\n{\n auto* boundState = (BoundState*)wrenGetUserData(vm);\n auto it = boundState->methods.find(wrenpp::detail::hashMethodSignature(module, className, isStatic, signature));\n if (it == boundState->methods.end())\n {\n return NULL;\n }\n\n return it->second;\n}\n\nWrenForeignClassMethods foreignClassProvider(WrenVM* vm, const char* m, const char* c)\n{\n auto* boundState = (BoundState*)wrenGetUserData(vm);\n auto it = boundState->classes.find(wrenpp::detail::hashClassSignature(m, c));\n if (it == boundState->classes.end())\n {\n return WrenForeignClassMethods{ nullptr, nullptr };\n }\n\n return it->second;\n}\n\ninline const char* errorTypeToString(WrenErrorType type)\n{\n switch (type)\n {\n case WREN_ERROR_COMPILE: return \"WREN_ERROR_COMPILE\";\n case WREN_ERROR_RUNTIME: return \"WREN_ERROR_RUNTIME\";\n case WREN_ERROR_STACK_TRACE: return \"WREN_ERROR_STACK_TRACE\";\n default: assert(false); return \"\";\n }\n}\n\nchar* loadModuleFnWrapper(WrenVM* vm, const char* mod)\n{\n return wrenpp::VM::loadModuleFn(mod);\n}\n\nvoid writeFnWrapper(WrenVM* vm, const char* text)\n{\n wrenpp::VM::writeFn(text);\n}\n\nvoid errorFnWrapper(WrenVM*, WrenErrorType type, const char* module, int line, const char* message)\n{\n wrenpp::VM::errorFn(type, module, line, message);\n}\n\nvoid* reallocateFnWrapper(void* memory, std::size_t newSize)\n{\n return wrenpp::VM::reallocateFn(memory, newSize);\n}\n\n}\n\nnamespace wrenpp\n{\n\nnamespace detail\n{\nvoid registerFunction(WrenVM* vm, const std::string& mod, const std::string& cName, bool isStatic, std::string sig, WrenForeignMethodFn function)\n{\n BoundState* boundState = (BoundState*)wrenGetUserData(vm);\n std::size_t hash = detail::hashMethodSignature(mod.c_str(), cName.c_str(), isStatic, sig.c_str());\n boundState->methods.insert(std::make_pair(hash, function));\n}\n\nvoid registerClass(WrenVM* vm, const std::string& mod, std::string cName, WrenForeignClassMethods methods)\n{\n BoundState* boundState = (BoundState*)wrenGetUserData(vm);\n std::size_t hash = detail::hashClassSignature(mod.c_str(), cName.c_str());\n boundState->classes.insert(std::make_pair(hash, methods));\n}\n\n}\n\nValue::Value(bool val)\n : valueType_{ WREN_TYPE_BOOL }, string_{ nullptr }\n{\n set_(val);\n}\n\nValue::Value(float val)\n : valueType_{ WREN_TYPE_NUM }, string_{ nullptr }\n{\n set_(val);\n}\n\nValue::Value(double val)\n : valueType_{ WREN_TYPE_NUM }, string_{ nullptr }\n{\n set_(val);\n}\n\nValue::Value(int val)\n : valueType_{ WREN_TYPE_NUM }, string_{ nullptr }\n{\n set_(val);\n}\n\nValue::Value(unsigned int val)\n : valueType_{ WREN_TYPE_NUM }, string_{ nullptr }\n{\n set_(val);\n}\n\nValue::Value(const char* str)\n : valueType_{ WREN_TYPE_STRING }, string_{ nullptr }\n{\n string_ = (char*)VM::reallocateFn(nullptr, std::strlen(str) + 1);\n std::strcpy(string_, str);\n}\n\nValue::~Value()\n{\n if (string_)\n {\n VM::reallocateFn(string_, 0u);\n }\n}\n\nMethod::Method(VM* vm, WrenHandle* variable, WrenHandle* method)\n : vm_(vm),\n method_(method),\n variable_(variable)\n{}\n\nMethod::Method(Method&& other)\n : vm_(other.vm_),\n method_(other.method_),\n variable_(other.variable_)\n{\n other.vm_ = nullptr;\n other.method_ = nullptr;\n other.variable_ = nullptr;\n}\n\nMethod::~Method()\n{\n if (vm_)\n {\n assert(method_ && variable_);\n wrenReleaseHandle(vm_->vm(), method_);\n wrenReleaseHandle(vm_->vm(), variable_);\n }\n}\n\nMethod& Method::operator=(Method&& rhs)\n{\n vm_ = rhs.vm_;\n method_ = rhs.method_;\n variable_ = rhs.variable_;\n rhs.vm_ = nullptr;\n rhs.method_ = nullptr;\n rhs.variable_ = nullptr;\n\n return *this;\n}\n\nClassContext ModuleContext::beginClass(std::string c)\n{\n return ClassContext(c, *this);\n}\n\nvoid ModuleContext::endModule() {}\n\nModuleContext& ClassContext::endClass()\n{\n return module_;\n}\n\nClassContext::ClassContext(std::string c, ModuleContext& mod)\n : module_(mod),\n class_(c)\n{}\n\nClassContext& ClassContext::bindCFunction(bool isStatic, std::string signature, WrenForeignMethodFn function)\n{\n detail::registerFunction(module_.vm_, module_.name_, class_, isStatic, signature, function);\n return *this;\n}\n\n\/*\n * Returns the source as a heap-allocated string.\n * Uses malloc, because our reallocateFn is set to default:\n * it uses malloc, realloc and free.\n * *\/\nLoadModuleFn VM::loadModuleFn = [](const char* mod) -> char*\n{\n std::string path(mod);\n path += \".wren\";\n std::string source;\n try\n {\n source = wrenpp::detail::fileToString(path);\n }\n catch (const std::exception&)\n {\n return NULL;\n }\n char* buffer = (char*)malloc(source.size());\n assert(buffer != nullptr);\n memcpy(buffer, source.c_str(), source.size());\n return buffer;\n};\n\nWriteFn VM::writeFn = [](const char* text) -> void\n{\n std::cout << text;\n};\n\nErrorFn VM::errorFn = [](WrenErrorType type, const char* module_name, int line, const char* message) -> void\n{\n const char* typeStr = errorTypeToString(type);\n if (module_name)\n {\n std::cout << typeStr << \" in \" << module_name << \":\" << line << \"> \" << message << std::endl;\n }\n else\n {\n std::cout << typeStr << \"> \" << message << std::endl;\n }\n};\n\nReallocateFn VM::reallocateFn = std::realloc;\n\nstd::size_t VM::initialHeapSize = 0xA00000u;\n\nstd::size_t VM::minHeapSize = 0x100000u;\n\nint VM::heapGrowthPercent = 50;\n\nstd::size_t VM::chunkSize = 0x500000u;\n\nVM::VM()\n : vm_{ nullptr }\n{\n WrenConfiguration configuration{};\n wrenInitConfiguration(&configuration);\n configuration.reallocateFn = reallocateFnWrapper;\n configuration.initialHeapSize = initialHeapSize;\n configuration.minHeapSize = minHeapSize;\n configuration.heapGrowthPercent = heapGrowthPercent;\n configuration.bindForeignMethodFn = foreignMethodProvider;\n configuration.loadModuleFn = loadModuleFnWrapper;\n configuration.bindForeignClassFn = foreignClassProvider;\n configuration.writeFn = writeFnWrapper;\n configuration.errorFn = errorFnWrapper;\n configuration.userData = new BoundState();\n\n vm_ = wrenNewVM(&configuration);\n}\n\nVM::VM(VM&& other)\n : vm_{ other.vm_ }\n{\n other.vm_ = nullptr;\n}\n\nVM& VM::operator=(VM&& rhs)\n{\n vm_ = rhs.vm_;\n rhs.vm_ = nullptr;\n return *this;\n}\n\nVM::~VM()\n{\n if (vm_ != nullptr)\n {\n delete (BoundState*)wrenGetUserData(vm_);\n wrenFreeVM(vm_);\n }\n}\n\nWrenVM* VM::vm()\n{\n return vm_;\n}\n\nResult VM::executeModule(const std::string& mod)\n{\n const std::string source(loadModuleFn(mod.c_str()));\n auto res = wrenInterpret(vm_, source.c_str());\n\n if (res == WrenInterpretResult::WREN_RESULT_COMPILE_ERROR)\n {\n return Result::CompileError;\n }\n\n if (res == WrenInterpretResult::WREN_RESULT_RUNTIME_ERROR)\n {\n return Result::RuntimeError;\n }\n\n return Result::Success;\n}\n\nResult VM::executeString(const std::string& code)\n{\n auto res = wrenInterpret(vm_, code.c_str());\n\n if (res == WrenInterpretResult::WREN_RESULT_COMPILE_ERROR)\n {\n return Result::CompileError;\n }\n\n if (res == WrenInterpretResult::WREN_RESULT_RUNTIME_ERROR)\n {\n return Result::RuntimeError;\n }\n\n return Result::Success;\n}\n\nvoid VM::collectGarbage()\n{\n wrenCollectGarbage(vm_);\n}\n\nMethod VM::method(\n const std::string& mod,\n const std::string& var,\n const std::string& sig\n)\n{\n wrenEnsureSlots(vm_, 1);\n wrenGetVariable(vm_, mod.c_str(), var.c_str(), 0);\n WrenHandle* variable = wrenGetSlotHandle(vm_, 0);\n WrenHandle* handle = wrenMakeCallHandle(vm_, sig.c_str());\n return Method(this, variable, handle);\n}\n\nModuleContext VM::beginModule(std::string name)\n{\n return ModuleContext(vm_, name);\n}\n\n}\n<|endoftext|>"} {"text":"<commit_before>\/*=========================================================================\n\n Program: Visualization Toolkit\n Module: vtkPointSet.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 \"vtkPointSet.h\"\n\n#include \"vtkCell.h\"\n#include \"vtkGarbageCollector.h\"\n#include \"vtkGenericCell.h\"\n#include \"vtkInformation.h\"\n#include \"vtkInformationVector.h\"\n#include \"vtkPointLocator.h\"\n#include \"vtkPointSetCellIterator.h\"\n\n#include \"vtkSmartPointer.h\"\n#define VTK_CREATE(type, name) \\\n vtkSmartPointer<type> name = vtkSmartPointer<type>::New()\n\n#include <set>\n\n\nvtkCxxSetObjectMacro(vtkPointSet,Points,vtkPoints);\n\nvtkPointSet::vtkPointSet ()\n{\n this->Points = NULL;\n this->Locator = NULL;\n}\n\n\/\/----------------------------------------------------------------------------\nvtkPointSet::~vtkPointSet ()\n{\n this->Cleanup();\n\n if ( this->Locator )\n {\n this->Locator->UnRegister(this);\n this->Locator = NULL;\n }\n}\n\n\/\/----------------------------------------------------------------------------\n\/\/ Copy the geometric structure of an input point set object.\nvoid vtkPointSet::CopyStructure(vtkDataSet *ds)\n{\n vtkPointSet *ps=static_cast<vtkPointSet *>(ds);\n\n if ( this->Points != ps->Points )\n {\n if ( this->Locator )\n {\n this->Locator->Initialize();\n }\n this->SetPoints(ps->Points);\n }\n}\n\n\/\/----------------------------------------------------------------------------\nvoid vtkPointSet::Cleanup()\n{\n if ( this->Points )\n {\n this->Points->UnRegister(this);\n this->Points = NULL;\n }\n}\n\n\/\/----------------------------------------------------------------------------\nvoid vtkPointSet::Initialize()\n{\n vtkDataSet::Initialize();\n\n this->Cleanup();\n\n if ( this->Locator )\n {\n this->Locator->Initialize();\n }\n}\n\/\/----------------------------------------------------------------------------\nvoid vtkPointSet::ComputeBounds()\n{\n double *bounds;\n\n if ( this->Points )\n {\n if ( this->GetMTime() >= this->ComputeTime )\n {\n bounds = this->Points->GetBounds();\n for (int i=0; i<6; i++)\n {\n this->Bounds[i] = bounds[i];\n }\n this->ComputeTime.Modified();\n }\n }\n}\n\n\/\/----------------------------------------------------------------------------\nunsigned long int vtkPointSet::GetMTime()\n{\n unsigned long int dsTime = vtkDataSet::GetMTime();\n\n if ( this->Points )\n {\n if ( this->Points->GetMTime() > dsTime )\n {\n dsTime = this->Points->GetMTime();\n }\n }\n\n \/\/ don't get locator's mtime because its an internal object that cannot be\n \/\/ modified directly from outside. Causes problems due to FindCell()\n \/\/ SetPoints() method.\n\n return dsTime;\n}\n\n\/\/----------------------------------------------------------------------------\nvtkIdType vtkPointSet::FindPoint(double x[3])\n{\n if ( !this->Points )\n {\n return -1;\n }\n\n if ( !this->Locator )\n {\n this->Locator = vtkPointLocator::New();\n this->Locator->Register(this);\n this->Locator->Delete();\n this->Locator->SetDataSet(this);\n }\n\n if ( this->Points->GetMTime() > this->Locator->GetMTime() )\n {\n this->Locator->SetDataSet(this);\n }\n\n return this->Locator->FindClosestPoint(x);\n}\n\n\/\/the furthest the walk can be - prevents aimless wandering\n#define VTK_MAX_WALK 12\n\n\/\/-----------------------------------------------------------------------------\n\/\/ Used internally by FindCell to walk through neighbors from a starting cell.\n\/\/ The arguments are the same as those for FindCell. In addition, visitedCells\n\/\/ keeps a list of cells already traversed. If we run into such already\n\/\/ visited, the walk terminates since we assume we already walked from that cell\n\/\/ and found nothing. The ptIds and neighbors lists are buffers used\n\/\/ internally. They are passed in so that they do not have to be continuously\n\/\/ reallocated.\nstatic vtkIdType FindCellWalk(vtkPointSet *self, double x[3], vtkCell *cell,\n vtkGenericCell *gencell, vtkIdType cellId,\n double tol2, int &subId, double pcoords[3],\n double *weights,\n std::set<vtkIdType> &visitedCells,\n vtkIdList *ptIds, vtkIdList *neighbors)\n{\n for (int walk = 0; walk < VTK_MAX_WALK; walk++)\n {\n \/\/ Check to see if we already visited this cell.\n if (visitedCells.find(cellId) != visitedCells.end()) break;\n visitedCells.insert(cellId);\n\n \/\/ Get information for the cell.\n if (!cell)\n {\n if (gencell)\n {\n self->GetCell(cellId, gencell);\n cell = gencell;\n }\n else\n {\n cell = self->GetCell(cellId);\n }\n }\n\n \/\/ Check to see if the cell contains the point.\n double closestPoint[3];\n double dist2;\n if ( (cell->EvaluatePosition(x, closestPoint, subId,\n pcoords, dist2, weights) == 1)\n && (dist2 <= tol2) )\n {\n return cellId;\n }\n\n \/\/ This is not the right cell. Find the next one.\n cell->CellBoundary(subId, pcoords, ptIds);\n self->GetCellNeighbors(cellId, ptIds, neighbors);\n \/\/ If there is no next one, exit.\n if (neighbors->GetNumberOfIds() < 1) break;\n \/\/ Set the next cell as the current one and iterate.\n cellId = neighbors->GetId(0);\n cell = NULL;\n }\n\n \/\/ Could not find a cell.\n return -1;\n}\n\n\/\/-----------------------------------------------------------------------------\nstatic vtkIdType FindCellWalk(vtkPointSet *self, double x[3],\n vtkGenericCell *gencell, vtkIdList *cellIds,\n double tol2, int &subId, double pcoords[3],\n double *weights,\n std::set<vtkIdType> &visitedCells,\n vtkIdList *ptIds, vtkIdList *neighbors)\n{\n for (vtkIdType i = 0; i < cellIds->GetNumberOfIds(); i++)\n {\n vtkIdType cellId = cellIds->GetId(i);\n vtkIdType foundCell = FindCellWalk(self, x, NULL, gencell, cellId,\n tol2, subId, pcoords, weights,\n visitedCells, ptIds, neighbors);\n if (foundCell >= 0) return foundCell;\n }\n return -1;\n}\n\n\/\/----------------------------------------------------------------------------\nvtkIdType vtkPointSet::FindCell(double x[3], vtkCell *cell,\n vtkGenericCell *gencell, vtkIdType cellId,\n double tol2, int& subId, double pcoords[3],\n double *weights)\n{\n vtkIdType foundCell;\n\n \/\/ make sure everything is up to snuff\n if ( !this->Points || this->Points->GetNumberOfPoints() < 1)\n {\n return -1;\n }\n\n \/\/ Check to see if the point is within the bounds of the data. This is not\n \/\/ a strict check, but it is fast.\n double bounds[6];\n this->GetBounds(bounds);\n double tol = sqrt(tol2);\n if ( (x[0] < bounds[0] - tol) || (x[0] > bounds[1] + tol)\n || (x[1] < bounds[2] - tol) || (x[1] > bounds[3] + tol)\n || (x[2] < bounds[4] - tol) || (x[2] > bounds[5] + tol) )\n {\n return -1;\n }\n\n if ( !this->Locator )\n {\n this->Locator = vtkPointLocator::New();\n this->Locator->Register(this);\n this->Locator->Delete();\n this->Locator->SetDataSet(this);\n this->Locator->BuildLocator();\n }\n\n if ( this->Points->GetMTime() > this->Locator->GetMTime() )\n {\n this->Locator->SetDataSet(this);\n this->Locator->BuildLocator();\n }\n\n std::set<vtkIdType> visitedCells;\n VTK_CREATE(vtkIdList, ptIds);\n ptIds->Allocate(8, 100);\n VTK_CREATE(vtkIdList, neighbors);\n neighbors->Allocate(8, 100);\n\n \/\/ If we are given a starting cell, try that.\n if (cell && (cellId >= 0))\n {\n foundCell = FindCellWalk(this, x, cell, gencell, cellId,\n tol2, subId, pcoords, weights,\n visitedCells, ptIds, neighbors);\n if (foundCell >= 0) return foundCell;\n }\n\n VTK_CREATE(vtkIdList, cellIds);\n cellIds->Allocate(8,100);\n\n \/\/ Now find the point closest to the coordinates given and search from the\n \/\/ adjacent cells.\n vtkIdType ptId = this->Locator->FindClosestPoint(x);\n if (ptId < 0) return -1;\n this->GetPointCells(ptId, cellIds);\n foundCell = FindCellWalk(this, x, gencell, cellIds,\n tol2, subId, pcoords, weights,\n visitedCells, ptIds, neighbors);\n if (foundCell >= 0) return foundCell;\n\n \/\/ It is possible that the toplogy is not fully connected. That is, two\n \/\/ points in the point list could be coincident. Handle that by looking\n \/\/ at every point within the tolerance and consider all cells connected.\n \/\/ It has been suggested that we should really do this coincident point\n \/\/ check at every point as we walk through neighbors, which would happen\n \/\/ in FindCellWalk. If that were ever implemented, this step might become\n \/\/ unnecessary.\n double ptCoord[3];\n this->GetPoint(ptId, ptCoord);\n VTK_CREATE(vtkIdList, coincidentPtIds);\n coincidentPtIds->Allocate(8, 100);\n this->Locator->FindPointsWithinRadius(tol2, ptCoord, coincidentPtIds);\n coincidentPtIds->DeleteId(ptId); \/\/ Already searched this one.\n for (vtkIdType i = 0; i < coincidentPtIds->GetNumberOfIds(); i++)\n {\n this->GetPointCells(coincidentPtIds->GetId(i), cellIds);\n foundCell = FindCellWalk(this, x, gencell, cellIds,\n tol2, subId, pcoords, weights,\n visitedCells, ptIds, neighbors);\n if (foundCell >= 0) return foundCell;\n }\n\n \/\/ Could not find the cell.\n return -1;\n}\n\n\/\/----------------------------------------------------------------------------\nvtkCellIterator *vtkPointSet::NewCellIterator()\n{\n vtkPointSetCellIterator *iter = vtkPointSetCellIterator::New();\n iter->SetPointSet(this);\n return iter;\n}\n\n\/\/----------------------------------------------------------------------------\nvtkIdType vtkPointSet::FindCell(double x[3], vtkCell *cell, vtkIdType cellId,\n double tol2, int& subId,double pcoords[3],\n double *weights)\n{\n return\n this->FindCell( x, cell, NULL, cellId, tol2, subId, pcoords, weights );\n}\n\n#undef VTK_MAX_WALK\n\n\n\/\/----------------------------------------------------------------------------\nvoid vtkPointSet::Squeeze()\n{\n if ( this->Points )\n {\n this->Points->Squeeze();\n }\n vtkDataSet::Squeeze();\n}\n\n\/\/----------------------------------------------------------------------------\nvoid vtkPointSet::ReportReferences(vtkGarbageCollector* collector)\n{\n this->Superclass::ReportReferences(collector);\n vtkGarbageCollectorReport(collector, this->Locator, \"Locator\");\n}\n\n\/\/----------------------------------------------------------------------------\nunsigned long vtkPointSet::GetActualMemorySize()\n{\n unsigned long size=this->vtkDataSet::GetActualMemorySize();\n if ( this->Points )\n {\n size += this->Points->GetActualMemorySize();\n }\n return size;\n}\n\n\/\/----------------------------------------------------------------------------\nvoid vtkPointSet::ShallowCopy(vtkDataObject *dataObject)\n{\n vtkPointSet *pointSet = vtkPointSet::SafeDownCast(dataObject);\n\n if ( pointSet != NULL )\n {\n this->SetPoints(pointSet->GetPoints());\n }\n\n \/\/ Do superclass\n this->vtkDataSet::ShallowCopy(dataObject);\n}\n\n\/\/----------------------------------------------------------------------------\nvoid vtkPointSet::DeepCopy(vtkDataObject *dataObject)\n{\n vtkPointSet *pointSet = vtkPointSet::SafeDownCast(dataObject);\n\n if ( pointSet != NULL )\n {\n vtkPoints* newPoints;\n vtkPoints* pointsToCopy = pointSet->GetPoints();\n if (pointsToCopy)\n {\n newPoints = pointsToCopy->NewInstance();\n newPoints->SetDataType(pointsToCopy->GetDataType());\n newPoints->DeepCopy(pointsToCopy);\n }\n else\n {\n newPoints = vtkPoints::New();\n }\n this->SetPoints(newPoints);\n newPoints->Delete();\n }\n\n \/\/ Do superclass\n this->vtkDataSet::DeepCopy(dataObject);\n}\n\n\/\/----------------------------------------------------------------------------\nvtkPointSet* vtkPointSet::GetData(vtkInformation* info)\n{\n return info? vtkPointSet::SafeDownCast(info->Get(DATA_OBJECT())) : 0;\n}\n\n\/\/----------------------------------------------------------------------------\nvtkPointSet* vtkPointSet::GetData(vtkInformationVector* v, int i)\n{\n return vtkPointSet::GetData(v->GetInformationObject(i));\n}\n\n\/\/----------------------------------------------------------------------------\nvoid vtkPointSet::PrintSelf(ostream& os, vtkIndent indent)\n{\n this->Superclass::PrintSelf(os,indent);\n\n os << indent << \"Number Of Points: \" << this->GetNumberOfPoints() << \"\\n\";\n os << indent << \"Point Coordinates: \" << this->Points << \"\\n\";\n os << indent << \"Locator: \" << this->Locator << \"\\n\";\n}\n\n\/\/----------------------------------------------------------------------------\nvoid vtkPointSet::Register(vtkObjectBase* o)\n{\n this->RegisterInternal(o, 1);\n}\n\n\/\/----------------------------------------------------------------------------\nvoid vtkPointSet::UnRegister(vtkObjectBase* o)\n{\n this->UnRegisterInternal(o, 1);\n}\n<commit_msg>The wrong MTime was being checked in vtkPointSet::FindCell. Fixed.<commit_after>\/*=========================================================================\n\n Program: Visualization Toolkit\n Module: vtkPointSet.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 \"vtkPointSet.h\"\n\n#include \"vtkCell.h\"\n#include \"vtkGarbageCollector.h\"\n#include \"vtkGenericCell.h\"\n#include \"vtkInformation.h\"\n#include \"vtkInformationVector.h\"\n#include \"vtkPointLocator.h\"\n#include \"vtkPointSetCellIterator.h\"\n\n#include \"vtkSmartPointer.h\"\n#define VTK_CREATE(type, name) \\\n vtkSmartPointer<type> name = vtkSmartPointer<type>::New()\n\n#include <set>\n\n\nvtkCxxSetObjectMacro(vtkPointSet,Points,vtkPoints);\n\nvtkPointSet::vtkPointSet ()\n{\n this->Points = NULL;\n this->Locator = NULL;\n}\n\n\/\/----------------------------------------------------------------------------\nvtkPointSet::~vtkPointSet ()\n{\n this->Cleanup();\n\n if ( this->Locator )\n {\n this->Locator->UnRegister(this);\n this->Locator = NULL;\n }\n}\n\n\/\/----------------------------------------------------------------------------\n\/\/ Copy the geometric structure of an input point set object.\nvoid vtkPointSet::CopyStructure(vtkDataSet *ds)\n{\n vtkPointSet *ps=static_cast<vtkPointSet *>(ds);\n\n if ( this->Points != ps->Points )\n {\n if ( this->Locator )\n {\n this->Locator->Initialize();\n }\n this->SetPoints(ps->Points);\n }\n}\n\n\/\/----------------------------------------------------------------------------\nvoid vtkPointSet::Cleanup()\n{\n if ( this->Points )\n {\n this->Points->UnRegister(this);\n this->Points = NULL;\n }\n}\n\n\/\/----------------------------------------------------------------------------\nvoid vtkPointSet::Initialize()\n{\n vtkDataSet::Initialize();\n\n this->Cleanup();\n\n if ( this->Locator )\n {\n this->Locator->Initialize();\n }\n}\n\/\/----------------------------------------------------------------------------\nvoid vtkPointSet::ComputeBounds()\n{\n double *bounds;\n\n if ( this->Points )\n {\n if ( this->GetMTime() >= this->ComputeTime )\n {\n bounds = this->Points->GetBounds();\n for (int i=0; i<6; i++)\n {\n this->Bounds[i] = bounds[i];\n }\n this->ComputeTime.Modified();\n }\n }\n}\n\n\/\/----------------------------------------------------------------------------\nunsigned long int vtkPointSet::GetMTime()\n{\n unsigned long int dsTime = vtkDataSet::GetMTime();\n\n if ( this->Points )\n {\n if ( this->Points->GetMTime() > dsTime )\n {\n dsTime = this->Points->GetMTime();\n }\n }\n\n \/\/ don't get locator's mtime because its an internal object that cannot be\n \/\/ modified directly from outside. Causes problems due to FindCell()\n \/\/ SetPoints() method.\n\n return dsTime;\n}\n\n\/\/----------------------------------------------------------------------------\nvtkIdType vtkPointSet::FindPoint(double x[3])\n{\n if ( !this->Points )\n {\n return -1;\n }\n\n if ( !this->Locator )\n {\n this->Locator = vtkPointLocator::New();\n this->Locator->Register(this);\n this->Locator->Delete();\n this->Locator->SetDataSet(this);\n }\n\n if ( this->Points->GetMTime() > this->Locator->GetMTime() )\n {\n this->Locator->SetDataSet(this);\n }\n\n return this->Locator->FindClosestPoint(x);\n}\n\n\/\/the furthest the walk can be - prevents aimless wandering\n#define VTK_MAX_WALK 12\n\n\/\/-----------------------------------------------------------------------------\n\/\/ Used internally by FindCell to walk through neighbors from a starting cell.\n\/\/ The arguments are the same as those for FindCell. In addition, visitedCells\n\/\/ keeps a list of cells already traversed. If we run into such already\n\/\/ visited, the walk terminates since we assume we already walked from that cell\n\/\/ and found nothing. The ptIds and neighbors lists are buffers used\n\/\/ internally. They are passed in so that they do not have to be continuously\n\/\/ reallocated.\nstatic vtkIdType FindCellWalk(vtkPointSet *self, double x[3], vtkCell *cell,\n vtkGenericCell *gencell, vtkIdType cellId,\n double tol2, int &subId, double pcoords[3],\n double *weights,\n std::set<vtkIdType> &visitedCells,\n vtkIdList *ptIds, vtkIdList *neighbors)\n{\n for (int walk = 0; walk < VTK_MAX_WALK; walk++)\n {\n \/\/ Check to see if we already visited this cell.\n if (visitedCells.find(cellId) != visitedCells.end()) break;\n visitedCells.insert(cellId);\n\n \/\/ Get information for the cell.\n if (!cell)\n {\n if (gencell)\n {\n self->GetCell(cellId, gencell);\n cell = gencell;\n }\n else\n {\n cell = self->GetCell(cellId);\n }\n }\n\n \/\/ Check to see if the cell contains the point.\n double closestPoint[3];\n double dist2;\n if ( (cell->EvaluatePosition(x, closestPoint, subId,\n pcoords, dist2, weights) == 1)\n && (dist2 <= tol2) )\n {\n return cellId;\n }\n\n \/\/ This is not the right cell. Find the next one.\n cell->CellBoundary(subId, pcoords, ptIds);\n self->GetCellNeighbors(cellId, ptIds, neighbors);\n \/\/ If there is no next one, exit.\n if (neighbors->GetNumberOfIds() < 1) break;\n \/\/ Set the next cell as the current one and iterate.\n cellId = neighbors->GetId(0);\n cell = NULL;\n }\n\n \/\/ Could not find a cell.\n return -1;\n}\n\n\/\/-----------------------------------------------------------------------------\nstatic vtkIdType FindCellWalk(vtkPointSet *self, double x[3],\n vtkGenericCell *gencell, vtkIdList *cellIds,\n double tol2, int &subId, double pcoords[3],\n double *weights,\n std::set<vtkIdType> &visitedCells,\n vtkIdList *ptIds, vtkIdList *neighbors)\n{\n for (vtkIdType i = 0; i < cellIds->GetNumberOfIds(); i++)\n {\n vtkIdType cellId = cellIds->GetId(i);\n vtkIdType foundCell = FindCellWalk(self, x, NULL, gencell, cellId,\n tol2, subId, pcoords, weights,\n visitedCells, ptIds, neighbors);\n if (foundCell >= 0) return foundCell;\n }\n return -1;\n}\n\n\/\/----------------------------------------------------------------------------\nvtkIdType vtkPointSet::FindCell(double x[3], vtkCell *cell,\n vtkGenericCell *gencell, vtkIdType cellId,\n double tol2, int& subId, double pcoords[3],\n double *weights)\n{\n vtkIdType foundCell;\n\n \/\/ make sure everything is up to snuff\n if ( !this->Points || this->Points->GetNumberOfPoints() < 1)\n {\n return -1;\n }\n\n \/\/ Check to see if the point is within the bounds of the data. This is not\n \/\/ a strict check, but it is fast.\n double bounds[6];\n this->GetBounds(bounds);\n double tol = sqrt(tol2);\n if ( (x[0] < bounds[0] - tol) || (x[0] > bounds[1] + tol)\n || (x[1] < bounds[2] - tol) || (x[1] > bounds[3] + tol)\n || (x[2] < bounds[4] - tol) || (x[2] > bounds[5] + tol) )\n {\n return -1;\n }\n\n if ( !this->Locator )\n {\n this->Locator = vtkPointLocator::New();\n this->Locator->Register(this);\n this->Locator->Delete();\n this->Locator->SetDataSet(this);\n this->Locator->BuildLocator();\n }\n\n if ( this->Points->GetMTime() > this->Locator->GetBuildTime() )\n {\n this->Locator->SetDataSet(this);\n this->Locator->BuildLocator();\n }\n\n std::set<vtkIdType> visitedCells;\n VTK_CREATE(vtkIdList, ptIds);\n ptIds->Allocate(8, 100);\n VTK_CREATE(vtkIdList, neighbors);\n neighbors->Allocate(8, 100);\n\n \/\/ If we are given a starting cell, try that.\n if (cell && (cellId >= 0))\n {\n foundCell = FindCellWalk(this, x, cell, gencell, cellId,\n tol2, subId, pcoords, weights,\n visitedCells, ptIds, neighbors);\n if (foundCell >= 0) return foundCell;\n }\n\n VTK_CREATE(vtkIdList, cellIds);\n cellIds->Allocate(8,100);\n\n \/\/ Now find the point closest to the coordinates given and search from the\n \/\/ adjacent cells.\n vtkIdType ptId = this->Locator->FindClosestPoint(x);\n if (ptId < 0) return -1;\n this->GetPointCells(ptId, cellIds);\n foundCell = FindCellWalk(this, x, gencell, cellIds,\n tol2, subId, pcoords, weights,\n visitedCells, ptIds, neighbors);\n if (foundCell >= 0) return foundCell;\n\n \/\/ It is possible that the toplogy is not fully connected. That is, two\n \/\/ points in the point list could be coincident. Handle that by looking\n \/\/ at every point within the tolerance and consider all cells connected.\n \/\/ It has been suggested that we should really do this coincident point\n \/\/ check at every point as we walk through neighbors, which would happen\n \/\/ in FindCellWalk. If that were ever implemented, this step might become\n \/\/ unnecessary.\n double ptCoord[3];\n this->GetPoint(ptId, ptCoord);\n VTK_CREATE(vtkIdList, coincidentPtIds);\n coincidentPtIds->Allocate(8, 100);\n this->Locator->FindPointsWithinRadius(tol2, ptCoord, coincidentPtIds);\n coincidentPtIds->DeleteId(ptId); \/\/ Already searched this one.\n for (vtkIdType i = 0; i < coincidentPtIds->GetNumberOfIds(); i++)\n {\n this->GetPointCells(coincidentPtIds->GetId(i), cellIds);\n foundCell = FindCellWalk(this, x, gencell, cellIds,\n tol2, subId, pcoords, weights,\n visitedCells, ptIds, neighbors);\n if (foundCell >= 0) return foundCell;\n }\n\n \/\/ Could not find the cell.\n return -1;\n}\n\n\/\/----------------------------------------------------------------------------\nvtkCellIterator *vtkPointSet::NewCellIterator()\n{\n vtkPointSetCellIterator *iter = vtkPointSetCellIterator::New();\n iter->SetPointSet(this);\n return iter;\n}\n\n\/\/----------------------------------------------------------------------------\nvtkIdType vtkPointSet::FindCell(double x[3], vtkCell *cell, vtkIdType cellId,\n double tol2, int& subId,double pcoords[3],\n double *weights)\n{\n return\n this->FindCell( x, cell, NULL, cellId, tol2, subId, pcoords, weights );\n}\n\n#undef VTK_MAX_WALK\n\n\n\/\/----------------------------------------------------------------------------\nvoid vtkPointSet::Squeeze()\n{\n if ( this->Points )\n {\n this->Points->Squeeze();\n }\n vtkDataSet::Squeeze();\n}\n\n\/\/----------------------------------------------------------------------------\nvoid vtkPointSet::ReportReferences(vtkGarbageCollector* collector)\n{\n this->Superclass::ReportReferences(collector);\n vtkGarbageCollectorReport(collector, this->Locator, \"Locator\");\n}\n\n\/\/----------------------------------------------------------------------------\nunsigned long vtkPointSet::GetActualMemorySize()\n{\n unsigned long size=this->vtkDataSet::GetActualMemorySize();\n if ( this->Points )\n {\n size += this->Points->GetActualMemorySize();\n }\n return size;\n}\n\n\/\/----------------------------------------------------------------------------\nvoid vtkPointSet::ShallowCopy(vtkDataObject *dataObject)\n{\n vtkPointSet *pointSet = vtkPointSet::SafeDownCast(dataObject);\n\n if ( pointSet != NULL )\n {\n this->SetPoints(pointSet->GetPoints());\n }\n\n \/\/ Do superclass\n this->vtkDataSet::ShallowCopy(dataObject);\n}\n\n\/\/----------------------------------------------------------------------------\nvoid vtkPointSet::DeepCopy(vtkDataObject *dataObject)\n{\n vtkPointSet *pointSet = vtkPointSet::SafeDownCast(dataObject);\n\n if ( pointSet != NULL )\n {\n vtkPoints* newPoints;\n vtkPoints* pointsToCopy = pointSet->GetPoints();\n if (pointsToCopy)\n {\n newPoints = pointsToCopy->NewInstance();\n newPoints->SetDataType(pointsToCopy->GetDataType());\n newPoints->DeepCopy(pointsToCopy);\n }\n else\n {\n newPoints = vtkPoints::New();\n }\n this->SetPoints(newPoints);\n newPoints->Delete();\n }\n\n \/\/ Do superclass\n this->vtkDataSet::DeepCopy(dataObject);\n}\n\n\/\/----------------------------------------------------------------------------\nvtkPointSet* vtkPointSet::GetData(vtkInformation* info)\n{\n return info? vtkPointSet::SafeDownCast(info->Get(DATA_OBJECT())) : 0;\n}\n\n\/\/----------------------------------------------------------------------------\nvtkPointSet* vtkPointSet::GetData(vtkInformationVector* v, int i)\n{\n return vtkPointSet::GetData(v->GetInformationObject(i));\n}\n\n\/\/----------------------------------------------------------------------------\nvoid vtkPointSet::PrintSelf(ostream& os, vtkIndent indent)\n{\n this->Superclass::PrintSelf(os,indent);\n\n os << indent << \"Number Of Points: \" << this->GetNumberOfPoints() << \"\\n\";\n os << indent << \"Point Coordinates: \" << this->Points << \"\\n\";\n os << indent << \"Locator: \" << this->Locator << \"\\n\";\n}\n\n\/\/----------------------------------------------------------------------------\nvoid vtkPointSet::Register(vtkObjectBase* o)\n{\n this->RegisterInternal(o, 1);\n}\n\n\/\/----------------------------------------------------------------------------\nvoid vtkPointSet::UnRegister(vtkObjectBase* o)\n{\n this->UnRegisterInternal(o, 1);\n}\n<|endoftext|>"} {"text":"<commit_before>\/****************************************************************************\n *\n * Copyright 2017 Proyectos y Sistemas de Mantenimiento SL (eProsima).\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 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\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\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\"\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 \"microRTPS_transport.h\"\n#include \"microRTPS_client.h\"\n\n#include <inttypes.h>\n#include <cstdio>\n#include <cstdlib>\n#include <ctime>\n#include <termios.h>\n\n#include <px4_platform_common\/px4_config.h>\n#include <px4_platform_common\/getopt.h>\n#include <px4_platform_common\/cli.h>\n#include <px4_platform_common\/module.h>\n#include <px4_platform_common\/posix.h>\n#include <px4_platform_common\/tasks.h>\n#include <px4_platform_common\/time.h>\n\nextern \"C\" __EXPORT int micrortps_client_main(int argc, char *argv[]);\n\nstatic int _rtps_task = -1;\nbool _should_exit_task = false;\nTransport_node *transport_node = nullptr;\nstruct options _options;\n\nstatic void usage(const char *name)\n{\n\tPRINT_MODULE_USAGE_NAME(\"micrortps_client\", \"communication\");\n\tPRINT_MODULE_USAGE_COMMAND(\"start\");\n\n\tPRINT_MODULE_USAGE_PARAM_STRING('t', \"UART\", \"UART|UDP\", \"Transport protocol\", true);\n\tPRINT_MODULE_USAGE_PARAM_STRING('d', \"\/dev\/ttyACM0\", \"<file:dev>\", \"Select Serial Device\", true);\n\tPRINT_MODULE_USAGE_PARAM_INT('b', 460800, 9600, 3000000, \"Baudrate (can also be p:<param_name>)\", true);\n\tPRINT_MODULE_USAGE_PARAM_INT('p', -1, 1, 1000, \"Poll timeout for UART in ms\", true);\n\tPRINT_MODULE_USAGE_PARAM_INT('l', 10000, -1, 100000, \"Limit number of iterations until the program exits (-1=infinite)\",\n\t\t\t\t true);\n\tPRINT_MODULE_USAGE_PARAM_INT('w', 1, 1, 1000, \"Time in ms for which each iteration sleeps\", true);\n\tPRINT_MODULE_USAGE_PARAM_INT('r', 2019, 0, 65536, \"Select UDP Network Port for receiving (local)\", true);\n\tPRINT_MODULE_USAGE_PARAM_INT('s', 2020, 0, 65536, \"Select UDP Network Port for sending (remote)\", true);\n\tPRINT_MODULE_USAGE_PARAM_STRING('i', \"127.0.0.1\", \"<x.x.x.x>\", \"Select IP address (remote)\", true);\n\tPRINT_MODULE_USAGE_PARAM_FLAG('f', \"Activate UART link SW flow control\", true);\n\tPRINT_MODULE_USAGE_PARAM_FLAG('h', \"Activate UART link HW flow control\", true);\n\tPRINT_MODULE_USAGE_PARAM_FLAG('v', \"Add more verbosity\", true);\n\n\tPRINT_MODULE_USAGE_COMMAND(\"stop\");\n\tPRINT_MODULE_USAGE_COMMAND(\"status\");\n}\n\nstatic int parse_options(int argc, char *argv[])\n{\n\tint ch;\n\tint myoptind = 1;\n\tconst char *myoptarg = nullptr;\n\n\twhile ((ch = px4_getopt(argc, argv, \"t:d:l:w:b:p:r:s:i:fhv\", &myoptind, &myoptarg)) != EOF) {\n\t\tswitch (ch) {\n\t\tcase 't': _options.transport = strcmp(myoptarg, \"UDP\") == 0 ?\n\t\t\t\t\t\t\t options::eTransports::UDP\n\t\t\t\t\t\t\t : options::eTransports::UART; break;\n\n\t\tcase 'd': if (nullptr != myoptarg) strcpy(_options.device, myoptarg); break;\n\n\t\tcase 'l': _options.loops = strtol(myoptarg, nullptr, 10); break;\n\n\t\tcase 'w': _options.sleep_ms = strtoul(myoptarg, nullptr, 10); break;\n\n\t\tcase 'b': {\n\t\t\t\tint baudrate = 0;\n\n\t\t\t\tif (px4_get_parameter_value(myoptarg, baudrate) != 0) {\n\t\t\t\t\tPX4_ERR(\"baudrate parsing failed\");\n\t\t\t\t}\n\n\t\t\t\tif (baudrate < 9600 || baudrate > 3000000) {\n\t\t\t\t\tPX4_ERR(\"invalid baud rate '%s'\", myoptarg);\n\t\t\t\t}\n\n\t\t\t\t_options.baudrate = baudrate;\n\n\t\t\t\tbreak;\n\t\t\t}\n\n\t\tcase 'r': _options.recv_port = strtoul(myoptarg, nullptr, 10); break;\n\n\t\tcase 's': _options.send_port = strtoul(myoptarg, nullptr, 10); break;\n\n\t\tcase 'i': if (nullptr != myoptarg) strcpy(_options.ip, myoptarg); break;\n\n\t\tcase 'f': _options.sw_flow_control = true; \t\t\t\tbreak;\n\n\t\tcase 'h': _options.hw_flow_control = true; \t\t\t\tbreak;\n\n\t\tcase 'v': _options.verbose_debug = true; \t\t\t\tbreak;\n\n\t\tdefault:\n\t\t\tusage(argv[1]);\n\t\t\treturn -1;\n\t\t}\n\t}\n\n\tif (_options.poll_ms < 1) {\n\t\t_options.poll_ms = 1;\n\t\tPX4_ERR(\"poll timeout too low, using 1 ms\");\n\t}\n\n\tif (_options.hw_flow_control && _options.sw_flow_control) {\n\t\tPX4_ERR(\"HW and SW flow control set. Please set only one or another\");\n\t\treturn -1;\n\t}\n\n\treturn 0;\n}\n\nstatic int micrortps_start(int argc, char *argv[])\n{\n\tif (0 > parse_options(argc, argv)) {\n\t\tPX4_INFO(\"EXITING...\");\n\t\t_rtps_task = -1;\n\t\treturn -1;\n\t}\n\n\tswitch (_options.transport) {\n\tcase options::eTransports::UART: {\n\t\t\ttransport_node = new UART_node(_options.device, _options.baudrate, _options.poll_ms,\n\t\t\t\t\t\t _options.sw_flow_control, _options.hw_flow_control, _options.verbose_debug);\n\t\t\tPX4_INFO(\"UART transport: device: %s; baudrate: %d; sleep: %dms; poll: %dms; flow_control: %s\",\n\t\t\t\t _options.device, _options.baudrate, _options.sleep_ms, _options.poll_ms,\n\t\t\t\t _options.sw_flow_control ? \"SW enabled\" : (_options.hw_flow_control ? \"HW enabled\" : \"No\"));\n\t\t}\n\t\tbreak;\n\n\tcase options::eTransports::UDP: {\n\t\t\ttransport_node = new UDP_node(_options.ip, _options.recv_port, _options.send_port,\n\t\t\t\t\t\t _options.verbose_debug);\n\t\t\tPX4_INFO(\"UDP transport: ip address: %s; recv port: %u; send port: %u; sleep: %dms\",\n\t\t\t\t _options.ip, _options.recv_port, _options.send_port, _options.sleep_ms);\n\n\t\t}\n\t\tbreak;\n\n\tdefault:\n\t\t_rtps_task = -1;\n\t\tPX4_INFO(\"EXITING...\");\n\t\treturn -1;\n\t}\n\n\tif (0 > transport_node->init()) {\n\t\tPX4_INFO(\"EXITING...\");\n\t\t_rtps_task = -1;\n\t\treturn -1;\n\t}\n\n\tstruct timespec begin;\n\n\tstruct timespec end;\n\n\tuint64_t total_read = 0, received = 0;\n\n\tint loop = 0;\n\n\tmicrortps_start_topics(begin, total_read, received, loop);\n\n\tpx4_clock_gettime(CLOCK_REALTIME, &end);\n\n\tdouble elapsed_secs = static_cast<double>(end.tv_sec - begin.tv_sec + (end.tv_nsec - begin.tv_nsec) \/ 1e9);\n\n\tPX4_INFO(\"RECEIVED: %\" PRIu64 \" messages in %d LOOPS, %\" PRIu64 \" bytes in %.03f seconds - %.02fKB\/s\",\n\t\t received, loop, total_read, elapsed_secs, static_cast<double>(total_read \/ (1e3 * elapsed_secs)));\n\n\tdelete transport_node;\n\n\ttransport_node = nullptr;\n\n\tPX4_INFO(\"Stopped!\");\n\n\tfflush(stdout);\n\n\t_rtps_task = -1;\n\n\treturn 0;\n}\n\nint micrortps_client_main(int argc, char *argv[])\n{\n\tif (argc < 2) {\n\t\tusage(argv[0]);\n\t\treturn -1;\n\t}\n\n\tif (!strcmp(argv[1], \"start\")) {\n\t\tif (_rtps_task != -1) {\n\t\t\tPX4_INFO(\"Already running\");\n\t\t\treturn -1;\n\t\t}\n\n\t\t_rtps_task = px4_task_spawn_cmd(\"micrortps_client\",\n\t\t\t\t\t\tSCHED_DEFAULT,\n\t\t\t\t\t\tSCHED_PRIORITY_DEFAULT,\n\t\t\t\t\t\t2650,\n\t\t\t\t\t\t(px4_main_t) micrortps_start,\n\t\t\t\t\t\t(char *const *)argv);\n\n\t\tif (_rtps_task < 0) {\n\t\t\tPX4_WARN(\"Could not start task\");\n\t\t\t_rtps_task = -1;\n\t\t\treturn -1;\n\t\t}\n\n\t\treturn 0;\n\t}\n\n\tif (!strcmp(argv[1], \"status\")) {\n\t\tif (_rtps_task == -1) {\n\t\t\tPX4_INFO(\"Not running\");\n\n\t\t} else {\n\t\t\tPX4_INFO(\"Running\");\n\t\t}\n\n\t\treturn 0;\n\t}\n\n\tif (!strcmp(argv[1], \"stop\")) {\n\t\tif (_rtps_task == -1) {\n\t\t\tPX4_INFO(\"Not running\");\n\t\t\treturn -1;\n\t\t}\n\n\t\t_should_exit_task = true;\n\n\t\tif (nullptr != transport_node) { transport_node->close(); }\n\n\t\t_rtps_task = -1;\n\t\treturn 0;\n\t}\n\n\tusage(argv[0]);\n\treturn -1;\n}\n<commit_msg>RTPS client remove redundant baudrate check<commit_after>\/****************************************************************************\n *\n * Copyright 2017 Proyectos y Sistemas de Mantenimiento SL (eProsima).\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 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\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\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\"\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 \"microRTPS_transport.h\"\n#include \"microRTPS_client.h\"\n\n#include <inttypes.h>\n#include <cstdio>\n#include <cstdlib>\n#include <ctime>\n#include <termios.h>\n\n#include <px4_platform_common\/px4_config.h>\n#include <px4_platform_common\/getopt.h>\n#include <px4_platform_common\/cli.h>\n#include <px4_platform_common\/module.h>\n#include <px4_platform_common\/posix.h>\n#include <px4_platform_common\/tasks.h>\n#include <px4_platform_common\/time.h>\n\nextern \"C\" __EXPORT int micrortps_client_main(int argc, char *argv[]);\n\nstatic int _rtps_task = -1;\nbool _should_exit_task = false;\nTransport_node *transport_node = nullptr;\nstruct options _options;\n\nstatic void usage(const char *name)\n{\n\tPRINT_MODULE_USAGE_NAME(\"micrortps_client\", \"communication\");\n\tPRINT_MODULE_USAGE_COMMAND(\"start\");\n\n\tPRINT_MODULE_USAGE_PARAM_STRING('t', \"UART\", \"UART|UDP\", \"Transport protocol\", true);\n\tPRINT_MODULE_USAGE_PARAM_STRING('d', \"\/dev\/ttyACM0\", \"<file:dev>\", \"Select Serial Device\", true);\n\tPRINT_MODULE_USAGE_PARAM_INT('b', 460800, 9600, 3000000, \"Baudrate (can also be p:<param_name>)\", true);\n\tPRINT_MODULE_USAGE_PARAM_INT('p', -1, 1, 1000, \"Poll timeout for UART in ms\", true);\n\tPRINT_MODULE_USAGE_PARAM_INT('l', 10000, -1, 100000, \"Limit number of iterations until the program exits (-1=infinite)\",\n\t\t\t\t true);\n\tPRINT_MODULE_USAGE_PARAM_INT('w', 1, 1, 1000, \"Time in ms for which each iteration sleeps\", true);\n\tPRINT_MODULE_USAGE_PARAM_INT('r', 2019, 0, 65536, \"Select UDP Network Port for receiving (local)\", true);\n\tPRINT_MODULE_USAGE_PARAM_INT('s', 2020, 0, 65536, \"Select UDP Network Port for sending (remote)\", true);\n\tPRINT_MODULE_USAGE_PARAM_STRING('i', \"127.0.0.1\", \"<x.x.x.x>\", \"Select IP address (remote)\", true);\n\tPRINT_MODULE_USAGE_PARAM_FLAG('f', \"Activate UART link SW flow control\", true);\n\tPRINT_MODULE_USAGE_PARAM_FLAG('h', \"Activate UART link HW flow control\", true);\n\tPRINT_MODULE_USAGE_PARAM_FLAG('v', \"Add more verbosity\", true);\n\n\tPRINT_MODULE_USAGE_COMMAND(\"stop\");\n\tPRINT_MODULE_USAGE_COMMAND(\"status\");\n}\n\nstatic int parse_options(int argc, char *argv[])\n{\n\tint ch;\n\tint myoptind = 1;\n\tconst char *myoptarg = nullptr;\n\n\twhile ((ch = px4_getopt(argc, argv, \"t:d:l:w:b:p:r:s:i:fhv\", &myoptind, &myoptarg)) != EOF) {\n\t\tswitch (ch) {\n\t\tcase 't': _options.transport = strcmp(myoptarg, \"UDP\") == 0 ?\n\t\t\t\t\t\t\t options::eTransports::UDP\n\t\t\t\t\t\t\t : options::eTransports::UART; break;\n\n\t\tcase 'd': if (nullptr != myoptarg) strcpy(_options.device, myoptarg); break;\n\n\t\tcase 'l': _options.loops = strtol(myoptarg, nullptr, 10); break;\n\n\t\tcase 'w': _options.sleep_ms = strtoul(myoptarg, nullptr, 10); break;\n\n\t\tcase 'b': {\n\t\t\t\tint baudrate = 0;\n\n\t\t\t\tif (px4_get_parameter_value(myoptarg, baudrate) != 0) {\n\t\t\t\t\tPX4_ERR(\"baudrate parsing failed\");\n\t\t\t\t}\n\n\t\t\t\t_options.baudrate = baudrate;\n\n\t\t\t\tbreak;\n\t\t\t}\n\n\t\tcase 'r': _options.recv_port = strtoul(myoptarg, nullptr, 10); break;\n\n\t\tcase 's': _options.send_port = strtoul(myoptarg, nullptr, 10); break;\n\n\t\tcase 'i': if (nullptr != myoptarg) strcpy(_options.ip, myoptarg); break;\n\n\t\tcase 'f': _options.sw_flow_control = true; \t\t\t\tbreak;\n\n\t\tcase 'h': _options.hw_flow_control = true; \t\t\t\tbreak;\n\n\t\tcase 'v': _options.verbose_debug = true; \t\t\t\tbreak;\n\n\t\tdefault:\n\t\t\tusage(argv[1]);\n\t\t\treturn -1;\n\t\t}\n\t}\n\n\tif (_options.poll_ms < 1) {\n\t\t_options.poll_ms = 1;\n\t\tPX4_ERR(\"poll timeout too low, using 1 ms\");\n\t}\n\n\tif (_options.hw_flow_control && _options.sw_flow_control) {\n\t\tPX4_ERR(\"HW and SW flow control set. Please set only one or another\");\n\t\treturn -1;\n\t}\n\n\treturn 0;\n}\n\nstatic int micrortps_start(int argc, char *argv[])\n{\n\tif (0 > parse_options(argc, argv)) {\n\t\tPX4_INFO(\"EXITING...\");\n\t\t_rtps_task = -1;\n\t\treturn -1;\n\t}\n\n\tswitch (_options.transport) {\n\tcase options::eTransports::UART: {\n\t\t\ttransport_node = new UART_node(_options.device, _options.baudrate, _options.poll_ms,\n\t\t\t\t\t\t _options.sw_flow_control, _options.hw_flow_control, _options.verbose_debug);\n\t\t\tPX4_INFO(\"UART transport: device: %s; baudrate: %d; sleep: %dms; poll: %dms; flow_control: %s\",\n\t\t\t\t _options.device, _options.baudrate, _options.sleep_ms, _options.poll_ms,\n\t\t\t\t _options.sw_flow_control ? \"SW enabled\" : (_options.hw_flow_control ? \"HW enabled\" : \"No\"));\n\t\t}\n\t\tbreak;\n\n\tcase options::eTransports::UDP: {\n\t\t\ttransport_node = new UDP_node(_options.ip, _options.recv_port, _options.send_port,\n\t\t\t\t\t\t _options.verbose_debug);\n\t\t\tPX4_INFO(\"UDP transport: ip address: %s; recv port: %u; send port: %u; sleep: %dms\",\n\t\t\t\t _options.ip, _options.recv_port, _options.send_port, _options.sleep_ms);\n\n\t\t}\n\t\tbreak;\n\n\tdefault:\n\t\t_rtps_task = -1;\n\t\tPX4_INFO(\"EXITING...\");\n\t\treturn -1;\n\t}\n\n\tif (0 > transport_node->init()) {\n\t\tPX4_INFO(\"EXITING...\");\n\t\t_rtps_task = -1;\n\t\treturn -1;\n\t}\n\n\tstruct timespec begin;\n\n\tstruct timespec end;\n\n\tuint64_t total_read = 0, received = 0;\n\n\tint loop = 0;\n\n\tmicrortps_start_topics(begin, total_read, received, loop);\n\n\tpx4_clock_gettime(CLOCK_REALTIME, &end);\n\n\tdouble elapsed_secs = static_cast<double>(end.tv_sec - begin.tv_sec + (end.tv_nsec - begin.tv_nsec) \/ 1e9);\n\n\tPX4_INFO(\"RECEIVED: %\" PRIu64 \" messages in %d LOOPS, %\" PRIu64 \" bytes in %.03f seconds - %.02fKB\/s\",\n\t\t received, loop, total_read, elapsed_secs, static_cast<double>(total_read \/ (1e3 * elapsed_secs)));\n\n\tdelete transport_node;\n\n\ttransport_node = nullptr;\n\n\tPX4_INFO(\"Stopped!\");\n\n\tfflush(stdout);\n\n\t_rtps_task = -1;\n\n\treturn 0;\n}\n\nint micrortps_client_main(int argc, char *argv[])\n{\n\tif (argc < 2) {\n\t\tusage(argv[0]);\n\t\treturn -1;\n\t}\n\n\tif (!strcmp(argv[1], \"start\")) {\n\t\tif (_rtps_task != -1) {\n\t\t\tPX4_INFO(\"Already running\");\n\t\t\treturn -1;\n\t\t}\n\n\t\t_rtps_task = px4_task_spawn_cmd(\"micrortps_client\",\n\t\t\t\t\t\tSCHED_DEFAULT,\n\t\t\t\t\t\tSCHED_PRIORITY_DEFAULT,\n\t\t\t\t\t\t2650,\n\t\t\t\t\t\t(px4_main_t) micrortps_start,\n\t\t\t\t\t\t(char *const *)argv);\n\n\t\tif (_rtps_task < 0) {\n\t\t\tPX4_WARN(\"Could not start task\");\n\t\t\t_rtps_task = -1;\n\t\t\treturn -1;\n\t\t}\n\n\t\treturn 0;\n\t}\n\n\tif (!strcmp(argv[1], \"status\")) {\n\t\tif (_rtps_task == -1) {\n\t\t\tPX4_INFO(\"Not running\");\n\n\t\t} else {\n\t\t\tPX4_INFO(\"Running\");\n\t\t}\n\n\t\treturn 0;\n\t}\n\n\tif (!strcmp(argv[1], \"stop\")) {\n\t\tif (_rtps_task == -1) {\n\t\t\tPX4_INFO(\"Not running\");\n\t\t\treturn -1;\n\t\t}\n\n\t\t_should_exit_task = true;\n\n\t\tif (nullptr != transport_node) { transport_node->close(); }\n\n\t\t_rtps_task = -1;\n\t\treturn 0;\n\t}\n\n\tusage(argv[0]);\n\treturn -1;\n}\n<|endoftext|>"} {"text":"<commit_before>\/* IBM_PROLOG_BEGIN_TAG *\/\n\/* This is an automatically generated prolog. *\/\n\/* *\/\n\/* $Source: src\/usr\/isteps\/istep08\/call_proc_check_secondary_sbe_seeprom_complete.C $ *\/\n\/* *\/\n\/* OpenPOWER HostBoot Project *\/\n\/* *\/\n\/* Contributors Listed Below - COPYRIGHT 2020,2021 *\/\n\/* [+] International Business Machines Corp. *\/\n\/* *\/\n\/* *\/\n\/* Licensed under the Apache License, Version 2.0 (the \"License\"); *\/\n\/* you may not use this file except in compliance with the License. *\/\n\/* You may obtain a copy of the License at *\/\n\/* *\/\n\/* http:\/\/www.apache.org\/licenses\/LICENSE-2.0 *\/\n\/* *\/\n\/* Unless required by applicable law or agreed to in writing, software *\/\n\/* distributed under the License is distributed on an \"AS IS\" BASIS, *\/\n\/* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or *\/\n\/* implied. See the License for the specific language governing *\/\n\/* permissions and limitations under the License. *\/\n\/* *\/\n\/* IBM_PROLOG_END_TAG *\/\n\/**\n * @file call_proc_check_secondary_sbe_seeprom_complete.C\n *\n * Support file for IStep: proc_check_secondary_sbe_seeprom_complete\n * Secondary SBE\n *\n *\/\n\n\/******************************************************************************\/\n\/\/ Includes\n\/******************************************************************************\/\n\n#include <hbotcompid.H> \/\/ HWPF_COMP_ID\n#include <attributeenums.H> \/\/ TYPE_PROC\n#include <isteps\/hwpisteperror.H> \/\/ISTEP_ERROR:IStepError\n#include <istepHelperFuncs.H> \/\/ captureError\n#include <fapi2\/plat_hwp_invoker.H>\n#include <nest\/nestHwpHelperFuncs.H>\n#include <sbeio\/sbe_retry_handler.H>\n#include <sbeio\/sbeioif.H>\n#include <errl\/errludtarget.H>\n#include <spi\/spi.H> \/\/ for SPI lock support\n#include <p10_getecid.H>\n#include <util\/utilmbox_scratch.H>\n#include <hwas\/hwasPlat.H>\n\nusing namespace ISTEP;\nusing namespace ISTEP_ERROR;\nusing namespace ISTEPS_TRACE;\nusing namespace TARGETING;\nusing namespace ERRORLOG;\nusing namespace SBEIO;\n\nnamespace ISTEP_08\n{\n\n\/\/******************************************************************************\n\/\/ call_proc_check_secondary_sbe_seeprom_complete function\n\/\/******************************************************************************\nvoid* call_proc_check_secondary_sbe_seeprom_complete( void *io_pArgs )\n{\n IStepError l_stepError;\n errlHndl_t l_errl = nullptr;\n\n TRACFCOMP(g_trac_isteps_trace, ENTER_MRK\"call_proc_check_secondary_sbe_seeprom_complete\");\n\n \/\/\n \/\/ get the master Proc target, we want to IGNORE this one.\n \/\/\n Target* l_pMasterProcTarget = nullptr;\n targetService().masterProcChipTargetHandle(l_pMasterProcTarget);\n\n \/\/\n \/\/ get a list of all the procs in the system\n \/\/\n TargetHandleList l_cpuTargetList;\n getAllChips(l_cpuTargetList, TYPE_PROC);\n\n TRACFCOMP(g_trac_isteps_trace,\n \"proc_check_secondary_sbe_seeprom_complete: %d procs in the system.\",\n l_cpuTargetList.size());\n\n \/\/ loop thru all the cpus\n for (const auto & l_cpu_target: l_cpuTargetList)\n {\n if ( l_cpu_target == l_pMasterProcTarget )\n {\n TRACFCOMP(g_trac_isteps_trace,\n \"Master SBE found, HUID %.8X, \"\n \"skipping to look for Slave SBEs.\",\n get_huid(l_cpu_target));\n \/\/ we are just checking the Slave SBEs, skip the master\n continue;\n }\n\n const fapi2::Target<fapi2::TARGET_TYPE_PROC_CHIP> l_fapi2ProcTarget(\n const_cast<Target*> (l_cpu_target));\n\n TRACFCOMP(g_trac_isteps_trace,\n \"Running p10_get_sbe_msg_register HWP\"\n \" on processor target %.8X\",\n get_huid(l_cpu_target));\n\n \/\/Note no PLID passed in\n SbeRetryHandler l_SBEobj = SbeRetryHandler(\n SbeRetryHandler::SBE_MODE_OF_OPERATION::ATTEMPT_REBOOT);\n\n l_SBEobj.setSbeRestartMethod(SbeRetryHandler::\n SBE_RESTART_METHOD::START_CBS);\n\n \/\/ We want to tell the retry handler that we have just powered\n \/\/ on the sbe, to distinguish this case from other cases where\n \/\/ we have determined there is something wrong w\/ the sbe and\n \/\/ want to diagnose the problem\n l_SBEobj.setInitialPowerOn(true);\n\n l_SBEobj.main_sbe_handler(l_cpu_target);\n\n \/\/ We will judge whether or not the SBE had a successful\n \/\/ boot if it made it to runtime\n if(l_SBEobj.isSbeAtRuntime())\n {\n \/\/ Set attribute indicating that SBE is started\n l_cpu_target->setAttr<ATTR_SBE_IS_STARTED>(1);\n\n \/\/ Make the FIFO call to get and apply the SBE Capabilities\n \/\/ for secondary SBEs\n l_errl = getFifoSbeCapabilities(l_cpu_target);\n if (l_errl)\n {\n TRACFCOMP(g_trac_isteps_trace, ERR_MRK\n \"proc_check_secondary_sbe_seeprom_complete: \"\n \" getFifoSbeCapabilities(proc 0x%.8X) failed\",\n get_huid(l_cpu_target));\n\n \/\/ allow istep to continue to SBE update\n \/\/ prevent reconfig loop by removing deconfig\n l_errl->removeGardAndDeconfigure();\n \/\/ Ensure the error log is visible.\n if ( l_errl->sev() < ERRORLOG::ERRL_SEV_PREDICTIVE )\n {\n l_errl->setSev( ERRORLOG::ERRL_SEV_PREDICTIVE );\n }\n l_errl->collectTrace(\"ISTEPS_TRACE\", 256);\n errlCommit(l_errl, ISTEP_COMP_ID); \/\/ commit error and move on\n }\n\n \/\/ Switch to using SBE SCOM\n ScomSwitches l_switches =\n l_cpu_target->getAttr<ATTR_SCOM_SWITCHES>();\n ScomSwitches l_switches_before = l_switches;\n\n \/\/ Turn on SBE SCOM and turn off FSI SCOM.\n l_switches.useFsiScom = 0;\n l_switches.useSbeScom = 1;\n\n TRACFCOMP(g_trac_isteps_trace,\n \"proc_check_secondary_sbe_seeprom_complete: changing SCOM\"\n \" switches from 0x%.2X to 0x%.2X for proc 0x%.8X\",\n l_switches_before,\n l_switches,\n get_huid(l_cpu_target));\n l_cpu_target->setAttr<ATTR_SCOM_SWITCHES>(l_switches);\n\n TRACFCOMP(g_trac_isteps_trace,\n \"SUCCESS : proc_check_secondary_sbe_seeprom_complete\"\n \" completed ok for proc 0x%.8X\",\n get_huid(l_cpu_target));\n\n \/\/ Ensure that the mailbox scratch registers 1 and 2 match what we\n \/\/ calculated for functional state\n\n const auto l_scratch = Util::readScratchRegs(l_cpu_target);\n\n TRACFCOMP(g_trac_isteps_trace,\n \"proc_check_secondary_sbe_seeprom_complete: \"\n \"Checking SBE functional state scratch registers on processor 0x%08x\",\n get_huid(l_cpu_target));\n\n l_errl = HWAS::HWASPlatVerification().verifyDeconfiguration(l_cpu_target, l_scratch);\n\n \/\/ This shouldn't ever fail because Hostboot pushes the values to\n \/\/ the secondary SBEs, so if it does then make the error\n \/\/ UNRECOVERABLE.\n if (l_errl)\n {\n l_errl->setSev(ERRORLOG::ERRL_SEV_UNRECOVERABLE);\n l_errl->collectTrace(\"ISTEPS_TRACE\", 256);\n captureError(l_errl, l_stepError, HWPF_COMP_ID, l_cpu_target);\n }\n }\n else\n {\n TRACFCOMP(g_trac_isteps_trace,\n \"FAILURE : proc_check_secondary_sbe_seeprom_complete\"\n \"SBE for proc 0x%.8X did not reach runtime\",\n get_huid(l_cpu_target));\n \/*@\n * @reasoncode RC_FAILED_TO_BOOT_SBE\n * @severity ERRORLOG::ERRL_SEV_UNRECOVERABLE\n * @moduleid MOD_CHECK_SECONDARY_SBE_SEEPROM_COMPLETE\n * @userdata1 HUID of proc that failed to boot its SBE\n * @userdata2 Unused\n * @devdesc Failed to boot a slave SBE\n * @custdesc Processor Error\n *\/\n l_errl = new ErrlEntry(ERRL_SEV_UNRECOVERABLE,\n MOD_CHECK_SECONDARY_SBE_SEEPROM_COMPLETE,\n RC_FAILED_TO_BOOT_SBE,\n get_huid(l_cpu_target),\n 0);\n l_errl->collectTrace(\"ISTEPS_TRACE\", 256);\n captureError(l_errl, l_stepError, HWPF_COMP_ID, l_cpu_target);\n\n\n }\n\n\/* @TODO-RTC:100963 This should only be called when the SBE has completely\n crashed. There is a path in OpenPower where HB may get an\n attention and need to call it. For now, though, just associate\n with this story for tracking.\n\n \/\/ Not a way to pass in -soft_err, assuming that is default behavior\n TRACFCOMP( ISTEPS_TRACE::g_trac_isteps_trace,\n \"Running p9_extract_sbe_rc HWP\"\n \" on processor target %.8X\",\n TARGETING::get_huid(l_cpu_target) );\n\n**\/\n \/\/ Enable HB SPI operations to this slave processor after SBE boot\n l_errl = SPI::spiLockProcessor(l_cpu_target, false);\n if (l_errl)\n {\n \/\/ This would be a firmware bug that would be hard to\n \/\/ find later so terminate with this failure\n TRACFCOMP(g_trac_isteps_trace,\n \"ERROR : SPI unlock failed to target %.8X\"\n TRACE_ERR_FMT,\n get_huid(l_cpu_target),\n TRACE_ERR_ARGS(l_errl));\n captureError(l_errl, l_stepError, HWPF_COMP_ID, l_cpu_target);\n break;\n }\n \/\/ Need to switch SPI control register back to FSI_ACCESS mode\n \/\/ since SBE will flip the access mode into PIB_ACCESS\n l_errl = SPI::spiSetAccessMode(l_cpu_target, SPI::FSI_ACCESS);\n if (l_errl)\n {\n \/\/ This would be another hard to find firmware bug so terminate\n \/\/ with this failure\n TRACFCOMP(g_trac_isteps_trace,\n \"ERROR: SPI access mode switch to FSI_ACCESS failed for target %.8X\"\n TRACE_ERR_FMT,\n get_huid(l_cpu_target),\n TRACE_ERR_ARGS(l_errl));\n captureError(l_errl, l_stepError, HWPF_COMP_ID, l_cpu_target);\n break;\n }\n\n } \/\/ end of going through all slave processors\n\n \/\/ Once the sbes are up correctly, fetch all the proc ECIDs and\n \/\/ store them in an attribute.\n for (const auto & l_cpu_target: l_cpuTargetList)\n {\n const fapi2::Target<fapi2::TARGET_TYPE_PROC_CHIP> l_fapi2ProcTarget(\n const_cast<Target*> (l_cpu_target));\n\n TRACFCOMP(g_trac_isteps_trace,\n \"Running p10_getecid HWP\"\n \" on processor target %.8X\",\n get_huid(l_cpu_target));\n\n \/\/ p10_getecid should set the fuse string to proper length\n fapi2::variable_buffer l_fuseString(p10_getecid_fuseString_len);\n\n \/\/ Invoke the HWP\n FAPI_INVOKE_HWP(l_errl,\n p10_getecid,\n l_fapi2ProcTarget,\n l_fuseString);\n\n if (l_errl)\n {\n if (l_cpu_target->getAttr<ATTR_HWAS_STATE>().functional)\n {\n TRACFCOMP(g_trac_isteps_trace,\n \"ERROR : p10_getecid failed, returning errorlog target %.8X\"\n TRACE_ERR_FMT,\n get_huid(l_cpu_target),\n TRACE_ERR_ARGS(l_errl));\n\n captureError(l_errl, l_stepError, HWPF_COMP_ID, l_cpu_target);\n }\n else \/\/ Not functional, proc deconfigured, don't report error\n {\n TRACFCOMP(g_trac_isteps_trace,\n \"ERROR : p10_getecid failed, proc target %.8X deconfigured\",\n get_huid(l_cpu_target));\n delete l_errl;\n l_errl = nullptr;\n }\n }\n else\n {\n TRACFCOMP(g_trac_isteps_trace,\n \"SUCCESS : proc_getecid completed ok target %.8X\",\n get_huid(l_cpu_target));\n\n \/\/ Update HDAT_EC to account for anything lower than the minor EC\n auto l_miniEC = l_cpu_target->getAttr<ATTR_MINI_EC>();\n if( l_miniEC != 0 )\n {\n auto l_hdatEC = l_cpu_target->getAttr<ATTR_HDAT_EC>();\n auto l_EC = l_cpu_target->getAttr<ATTR_EC>();\n auto l_newHdatEC = l_EC + l_miniEC;\n TRACFCOMP(g_trac_isteps_trace,\n \"MINI_EC=%d, HDAT_EC changing from %d->%d\",\n l_miniEC, l_hdatEC, l_newHdatEC);\n l_cpu_target->setAttr<ATTR_HDAT_EC>(l_newHdatEC);\n }\n }\n\n } \/\/ end of going through all processors\n\n TRACFCOMP(g_trac_isteps_trace, EXIT_MRK\"call_proc_check_secondary_sbe_seeprom_complete\");\n return l_stepError.getErrorHandle();\n}\n\n};\n<commit_msg>Unlock SPI mutex before checking for SBE boot completion<commit_after>\/* IBM_PROLOG_BEGIN_TAG *\/\n\/* This is an automatically generated prolog. *\/\n\/* *\/\n\/* $Source: src\/usr\/isteps\/istep08\/call_proc_check_secondary_sbe_seeprom_complete.C $ *\/\n\/* *\/\n\/* OpenPOWER HostBoot Project *\/\n\/* *\/\n\/* Contributors Listed Below - COPYRIGHT 2020,2021 *\/\n\/* [+] International Business Machines Corp. *\/\n\/* *\/\n\/* *\/\n\/* Licensed under the Apache License, Version 2.0 (the \"License\"); *\/\n\/* you may not use this file except in compliance with the License. *\/\n\/* You may obtain a copy of the License at *\/\n\/* *\/\n\/* http:\/\/www.apache.org\/licenses\/LICENSE-2.0 *\/\n\/* *\/\n\/* Unless required by applicable law or agreed to in writing, software *\/\n\/* distributed under the License is distributed on an \"AS IS\" BASIS, *\/\n\/* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or *\/\n\/* implied. See the License for the specific language governing *\/\n\/* permissions and limitations under the License. *\/\n\/* *\/\n\/* IBM_PROLOG_END_TAG *\/\n\/**\n * @file call_proc_check_secondary_sbe_seeprom_complete.C\n *\n * Support file for IStep: proc_check_secondary_sbe_seeprom_complete\n * Secondary SBE\n *\n *\/\n\n\/******************************************************************************\/\n\/\/ Includes\n\/******************************************************************************\/\n\n#include <hbotcompid.H> \/\/ HWPF_COMP_ID\n#include <attributeenums.H> \/\/ TYPE_PROC\n#include <isteps\/hwpisteperror.H> \/\/ISTEP_ERROR:IStepError\n#include <istepHelperFuncs.H> \/\/ captureError\n#include <fapi2\/plat_hwp_invoker.H>\n#include <nest\/nestHwpHelperFuncs.H>\n#include <sbeio\/sbe_retry_handler.H>\n#include <sbeio\/sbeioif.H>\n#include <errl\/errludtarget.H>\n#include <spi\/spi.H> \/\/ for SPI lock support\n#include <p10_getecid.H>\n#include <util\/utilmbox_scratch.H>\n#include <hwas\/hwasPlat.H>\n\nusing namespace ISTEP;\nusing namespace ISTEP_ERROR;\nusing namespace ISTEPS_TRACE;\nusing namespace TARGETING;\nusing namespace ERRORLOG;\nusing namespace SBEIO;\n\nnamespace ISTEP_08\n{\n\n\/\/******************************************************************************\n\/\/ call_proc_check_secondary_sbe_seeprom_complete function\n\/\/******************************************************************************\nvoid* call_proc_check_secondary_sbe_seeprom_complete( void *io_pArgs )\n{\n IStepError l_stepError;\n errlHndl_t l_errl = nullptr;\n\n TRACFCOMP(g_trac_isteps_trace, ENTER_MRK\"call_proc_check_secondary_sbe_seeprom_complete\");\n\n \/\/\n \/\/ get the master Proc target, we want to IGNORE this one.\n \/\/\n Target* l_pMasterProcTarget = nullptr;\n targetService().masterProcChipTargetHandle(l_pMasterProcTarget);\n\n \/\/\n \/\/ get a list of all the procs in the system\n \/\/\n TargetHandleList l_cpuTargetList;\n getAllChips(l_cpuTargetList, TYPE_PROC);\n\n TRACFCOMP(g_trac_isteps_trace,\n \"proc_check_secondary_sbe_seeprom_complete: %d procs in the system.\",\n l_cpuTargetList.size());\n\n \/\/ loop thru all the cpus\n for (const auto & l_cpu_target: l_cpuTargetList)\n {\n if ( l_cpu_target == l_pMasterProcTarget )\n {\n TRACFCOMP(g_trac_isteps_trace,\n \"Master SBE found, HUID %.8X, \"\n \"skipping to look for Slave SBEs.\",\n get_huid(l_cpu_target));\n \/\/ we are just checking the Slave SBEs, skip the master\n continue;\n }\n\n const fapi2::Target<fapi2::TARGET_TYPE_PROC_CHIP> l_fapi2ProcTarget(\n const_cast<Target*> (l_cpu_target));\n\n TRACFCOMP(g_trac_isteps_trace,\n \"Running p10_get_sbe_msg_register HWP\"\n \" on processor target %.8X\",\n get_huid(l_cpu_target));\n\n \/\/Note no PLID passed in\n SbeRetryHandler l_SBEobj = SbeRetryHandler(\n SbeRetryHandler::SBE_MODE_OF_OPERATION::ATTEMPT_REBOOT);\n\n l_SBEobj.setSbeRestartMethod(SbeRetryHandler::\n SBE_RESTART_METHOD::START_CBS);\n\n \/\/ We want to tell the retry handler that we have just powered\n \/\/ on the sbe, to distinguish this case from other cases where\n \/\/ we have determined there is something wrong w\/ the sbe and\n \/\/ want to diagnose the problem\n l_SBEobj.setInitialPowerOn(true);\n\n \/\/ Enable HB SPI operations to this slave processor before\n \/\/ checking for success because we may end up doing SPI\n \/\/ operations (writing MVPD) as part of the recovery.\n l_errl = SPI::spiLockProcessor(l_cpu_target, false);\n if (l_errl)\n {\n \/\/ This would be a firmware bug that would be hard to\n \/\/ find later so terminate with this failure\n TRACFCOMP(g_trac_isteps_trace,\n \"ERROR : SPI unlock failed to target %.8X\"\n TRACE_ERR_FMT,\n get_huid(l_cpu_target),\n TRACE_ERR_ARGS(l_errl));\n captureError(l_errl, l_stepError, HWPF_COMP_ID, l_cpu_target);\n break;\n }\n\n \/\/ Poll for SBE boot complete\n l_SBEobj.main_sbe_handler(l_cpu_target);\n\n \/\/ We will judge whether or not the SBE had a successful\n \/\/ boot if it made it to runtime\n if(l_SBEobj.isSbeAtRuntime())\n {\n \/\/ Set attribute indicating that SBE is started\n l_cpu_target->setAttr<ATTR_SBE_IS_STARTED>(1);\n\n \/\/ Make the FIFO call to get and apply the SBE Capabilities\n \/\/ for secondary SBEs\n l_errl = getFifoSbeCapabilities(l_cpu_target);\n if (l_errl)\n {\n TRACFCOMP(g_trac_isteps_trace, ERR_MRK\n \"proc_check_secondary_sbe_seeprom_complete: \"\n \" getFifoSbeCapabilities(proc 0x%.8X) failed\",\n get_huid(l_cpu_target));\n\n \/\/ allow istep to continue to SBE update\n \/\/ prevent reconfig loop by removing deconfig\n l_errl->removeGardAndDeconfigure();\n \/\/ Ensure the error log is visible.\n if ( l_errl->sev() < ERRORLOG::ERRL_SEV_PREDICTIVE )\n {\n l_errl->setSev( ERRORLOG::ERRL_SEV_PREDICTIVE );\n }\n l_errl->collectTrace(\"ISTEPS_TRACE\", 256);\n errlCommit(l_errl, ISTEP_COMP_ID); \/\/ commit error and move on\n }\n\n \/\/ Switch to using SBE SCOM\n ScomSwitches l_switches =\n l_cpu_target->getAttr<ATTR_SCOM_SWITCHES>();\n ScomSwitches l_switches_before = l_switches;\n\n \/\/ Turn on SBE SCOM and turn off FSI SCOM.\n l_switches.useFsiScom = 0;\n l_switches.useSbeScom = 1;\n\n TRACFCOMP(g_trac_isteps_trace,\n \"proc_check_secondary_sbe_seeprom_complete: changing SCOM\"\n \" switches from 0x%.2X to 0x%.2X for proc 0x%.8X\",\n l_switches_before,\n l_switches,\n get_huid(l_cpu_target));\n l_cpu_target->setAttr<ATTR_SCOM_SWITCHES>(l_switches);\n\n TRACFCOMP(g_trac_isteps_trace,\n \"SUCCESS : proc_check_secondary_sbe_seeprom_complete\"\n \" completed ok for proc 0x%.8X\",\n get_huid(l_cpu_target));\n\n \/\/ Ensure that the mailbox scratch registers 1 and 2 match what we\n \/\/ calculated for functional state\n\n const auto l_scratch = Util::readScratchRegs(l_cpu_target);\n\n TRACFCOMP(g_trac_isteps_trace,\n \"proc_check_secondary_sbe_seeprom_complete: \"\n \"Checking SBE functional state scratch registers on processor 0x%08x\",\n get_huid(l_cpu_target));\n\n l_errl = HWAS::HWASPlatVerification().verifyDeconfiguration(l_cpu_target, l_scratch);\n\n \/\/ This shouldn't ever fail because Hostboot pushes the values to\n \/\/ the secondary SBEs, so if it does then make the error\n \/\/ UNRECOVERABLE.\n if (l_errl)\n {\n l_errl->setSev(ERRORLOG::ERRL_SEV_UNRECOVERABLE);\n l_errl->collectTrace(\"ISTEPS_TRACE\", 256);\n captureError(l_errl, l_stepError, HWPF_COMP_ID, l_cpu_target);\n }\n }\n else\n {\n TRACFCOMP(g_trac_isteps_trace,\n \"FAILURE : proc_check_secondary_sbe_seeprom_complete\"\n \"SBE for proc 0x%.8X did not reach runtime\",\n get_huid(l_cpu_target));\n \/*@\n * @reasoncode RC_FAILED_TO_BOOT_SBE\n * @severity ERRORLOG::ERRL_SEV_UNRECOVERABLE\n * @moduleid MOD_CHECK_SECONDARY_SBE_SEEPROM_COMPLETE\n * @userdata1 HUID of proc that failed to boot its SBE\n * @userdata2 Unused\n * @devdesc Failed to boot a slave SBE\n * @custdesc Processor Error\n *\/\n l_errl = new ErrlEntry(ERRL_SEV_UNRECOVERABLE,\n MOD_CHECK_SECONDARY_SBE_SEEPROM_COMPLETE,\n RC_FAILED_TO_BOOT_SBE,\n get_huid(l_cpu_target),\n 0);\n l_errl->collectTrace(\"ISTEPS_TRACE\", 256);\n captureError(l_errl, l_stepError, HWPF_COMP_ID, l_cpu_target);\n\n\n }\n\n\/* @TODO-RTC:100963 This should only be called when the SBE has completely\n crashed. There is a path in OpenPower where HB may get an\n attention and need to call it. For now, though, just associate\n with this story for tracking.\n\n \/\/ Not a way to pass in -soft_err, assuming that is default behavior\n TRACFCOMP( ISTEPS_TRACE::g_trac_isteps_trace,\n \"Running p9_extract_sbe_rc HWP\"\n \" on processor target %.8X\",\n TARGETING::get_huid(l_cpu_target) );\n\n**\/\n \/\/ Need to switch SPI control register back to FSI_ACCESS mode\n \/\/ since SBE will flip the access mode into PIB_ACCESS\n l_errl = SPI::spiSetAccessMode(l_cpu_target, SPI::FSI_ACCESS);\n if (l_errl)\n {\n \/\/ This would be another hard to find firmware bug so terminate\n \/\/ with this failure\n TRACFCOMP(g_trac_isteps_trace,\n \"ERROR: SPI access mode switch to FSI_ACCESS failed for target %.8X\"\n TRACE_ERR_FMT,\n get_huid(l_cpu_target),\n TRACE_ERR_ARGS(l_errl));\n captureError(l_errl, l_stepError, HWPF_COMP_ID, l_cpu_target);\n break;\n }\n\n } \/\/ end of going through all slave processors\n\n \/\/ Once the sbes are up correctly, fetch all the proc ECIDs and\n \/\/ store them in an attribute.\n for (const auto & l_cpu_target: l_cpuTargetList)\n {\n const fapi2::Target<fapi2::TARGET_TYPE_PROC_CHIP> l_fapi2ProcTarget(\n const_cast<Target*> (l_cpu_target));\n\n TRACFCOMP(g_trac_isteps_trace,\n \"Running p10_getecid HWP\"\n \" on processor target %.8X\",\n get_huid(l_cpu_target));\n\n \/\/ p10_getecid should set the fuse string to proper length\n fapi2::variable_buffer l_fuseString(p10_getecid_fuseString_len);\n\n \/\/ Invoke the HWP\n FAPI_INVOKE_HWP(l_errl,\n p10_getecid,\n l_fapi2ProcTarget,\n l_fuseString);\n\n if (l_errl)\n {\n if (l_cpu_target->getAttr<ATTR_HWAS_STATE>().functional)\n {\n TRACFCOMP(g_trac_isteps_trace,\n \"ERROR : p10_getecid failed, returning errorlog target %.8X\"\n TRACE_ERR_FMT,\n get_huid(l_cpu_target),\n TRACE_ERR_ARGS(l_errl));\n\n captureError(l_errl, l_stepError, HWPF_COMP_ID, l_cpu_target);\n }\n else \/\/ Not functional, proc deconfigured, don't report error\n {\n TRACFCOMP(g_trac_isteps_trace,\n \"ERROR : p10_getecid failed, proc target %.8X deconfigured\",\n get_huid(l_cpu_target));\n delete l_errl;\n l_errl = nullptr;\n }\n }\n else\n {\n TRACFCOMP(g_trac_isteps_trace,\n \"SUCCESS : proc_getecid completed ok target %.8X\",\n get_huid(l_cpu_target));\n\n \/\/ Update HDAT_EC to account for anything lower than the minor EC\n auto l_miniEC = l_cpu_target->getAttr<ATTR_MINI_EC>();\n if( l_miniEC != 0 )\n {\n auto l_hdatEC = l_cpu_target->getAttr<ATTR_HDAT_EC>();\n auto l_EC = l_cpu_target->getAttr<ATTR_EC>();\n auto l_newHdatEC = l_EC + l_miniEC;\n TRACFCOMP(g_trac_isteps_trace,\n \"MINI_EC=%d, HDAT_EC changing from %d->%d\",\n l_miniEC, l_hdatEC, l_newHdatEC);\n l_cpu_target->setAttr<ATTR_HDAT_EC>(l_newHdatEC);\n }\n }\n\n } \/\/ end of going through all processors\n\n TRACFCOMP(g_trac_isteps_trace, EXIT_MRK\"call_proc_check_secondary_sbe_seeprom_complete\");\n return l_stepError.getErrorHandle();\n}\n\n};\n<|endoftext|>"} {"text":"<commit_before>\/\/ Copyright (c) 2013 Intel Corporation. All rights reserved.\n\/\/ Use of this source code is governed by a BSD-style license that can be\n\/\/ found in the LICENSE file.\n\n#include \"xwalk\/application\/browser\/application_tizen.h\"\n\n#include <set>\n#include <string>\n#include <vector>\n\n#include \"content\/public\/browser\/web_contents.h\"\n#include \"content\/public\/browser\/render_process_host.h\"\n\n#include \"xwalk\/runtime\/browser\/ui\/native_app_window.h\"\n#include \"xwalk\/runtime\/common\/xwalk_common_messages.h\"\n\n#if defined(USE_OZONE)\n#include \"base\/message_loop\/message_pump_ozone.h\"\n#include \"content\/public\/browser\/render_view_host.h\"\n#include \"ui\/events\/event.h\"\n#include \"ui\/events\/event_constants.h\"\n#include \"ui\/events\/keycodes\/keyboard_codes_posix.h\"\n#include \"xwalk\/application\/common\/manifest_handlers\/tizen_setting_handler.h\"\n#endif\n\n#include \"xwalk\/application\/common\/application_manifest_constants.h\"\n#include \"xwalk\/application\/common\/manifest_handlers\/navigation_handler.h\"\n\nnamespace xwalk {\n\nnamespace widget_keys = application_widget_keys;\n\nnamespace application {\n\nnamespace {\nconst char kAsterisk[] = \"*\";\n} \/\/ namespace\n\n\nApplicationTizen::ApplicationTizen(\n scoped_refptr<ApplicationData> data,\n RuntimeContext* runtime_context,\n Application::Observer* observer)\n : Application(data, runtime_context, observer) {\n#if defined(USE_OZONE)\n base::MessagePumpOzone::Current()->AddObserver(this);\n#endif\n}\n\nApplicationTizen::~ApplicationTizen() {\n#if defined(USE_OZONE)\n base::MessagePumpOzone::Current()->RemoveObserver(this);\n#endif\n}\n\nvoid ApplicationTizen::Hide() {\n DCHECK(runtimes_.size());\n std::set<Runtime*>::iterator it = runtimes_.begin();\n for (; it != runtimes_.end(); ++it) {\n if ((*it)->window())\n (*it)->window()->Hide();\n }\n}\n\nvoid ApplicationTizen::InitSecurityPolicy() {\n \/\/ On Tizen, CSP mode has higher priority, and WARP will be disabled\n \/\/ if the application is under CSP mode.\n if (!data_->HasCSPDefined()) {\n Application::InitSecurityPolicy();\n return;\n }\n\n if (data_->GetPackageType() != Package::WGT)\n return;\n\n \/\/ Always enable security mode when under CSP mode.\n security_mode_enabled_ = true;\n NavigationInfo* info = static_cast<NavigationInfo*>(\n data_->GetManifestData(widget_keys::kAllowNavigationKey));\n if (info) {\n const std::vector<std::string>& allowed_list = info->GetAllowedDomains();\n for (std::vector<std::string>::const_iterator it = allowed_list.begin();\n it != allowed_list.end(); ++it) {\n \/\/ If the policy is \"*\", it represents that any external link is allowed\n \/\/ to navigate to.\n if ((*it) == kAsterisk) {\n security_mode_enabled_ = false;\n return;\n }\n\n \/\/ If the policy start with \"*.\", like this: *.domain,\n \/\/ means that can access to all subdomains for 'domain',\n \/\/ otherwise, the host of request url should exactly the same\n \/\/ as policy.\n bool subdomains = ((*it).find(\"*.\") == 0);\n std::string host = subdomains ? (*it).substr(2) : (*it);\n AddSecurityPolicy(GURL(\"http:\/\/\" + host), subdomains);\n AddSecurityPolicy(GURL(\"https:\/\/\" + host), subdomains);\n }\n }\n DCHECK(render_process_host_);\n render_process_host_->Send(\n new ViewMsg_EnableSecurityMode(\n ApplicationData::GetBaseURLFromApplicationId(id()),\n SecurityPolicy::CSP));\n}\n\n#if defined(USE_OZONE)\nbase::EventStatus ApplicationTizen::WillProcessEvent(\n const base::NativeEvent& event) {\n return base::EVENT_CONTINUE;\n}\n\nvoid ApplicationTizen::DidProcessEvent(\n const base::NativeEvent& event) {\n ui::Event* ui_event = static_cast<ui::Event*>(event);\n if (!ui_event->IsKeyEvent() || ui_event->type() != ui::ET_KEY_PRESSED)\n return;\n\n ui::KeyEvent* key_event = static_cast<ui::KeyEvent*>(ui_event);\n\n \/\/ FIXME: Most Wayland devices don't have similar hardware button for 'back'\n \/\/ and 'memu' as Tizen Mobile, even that hardare buttons could be different\n \/\/ across different kinds of Wayland platforms.\n \/\/ Here use external keyboard button 'Backspace' & 'HOME' to emulate 'back'\n \/\/ and 'menu' key. Should change this if there is customized key binding.\n if (key_event->key_code() != ui::VKEY_BACK &&\n key_event->key_code() != ui::VKEY_HOME)\n return;\n\n TizenSettingInfo* info = static_cast<TizenSettingInfo*>(\n data()->GetManifestData(widget_keys::kTizenSettingKey));\n if (info && !info->hwkey_enabled())\n return;\n\n for (std::set<xwalk::Runtime*>::iterator it = runtimes_.begin();\n it != runtimes_.end(); ++it) {\n (*it)->web_contents()->GetRenderViewHost()->Send(new ViewMsg_HWKeyPressed(\n (*it)->web_contents()->GetRoutingID(), key_event->key_code()));\n }\n}\n#endif\n\n} \/\/ namespace application\n} \/\/ namespace xwalk\n<commit_msg>[Tizen][Runtime] Add default csp support for tizen.<commit_after>\/\/ Copyright (c) 2013 Intel Corporation. All rights reserved.\n\/\/ Use of this source code is governed by a BSD-style license that can be\n\/\/ found in the LICENSE file.\n\n#include \"xwalk\/application\/browser\/application_tizen.h\"\n\n#include <set>\n#include <string>\n#include <vector>\n\n#include \"content\/public\/browser\/web_contents.h\"\n#include \"content\/public\/browser\/render_process_host.h\"\n\n#include \"xwalk\/runtime\/browser\/ui\/native_app_window.h\"\n#include \"xwalk\/runtime\/common\/xwalk_common_messages.h\"\n\n#if defined(USE_OZONE)\n#include \"base\/message_loop\/message_pump_ozone.h\"\n#include \"content\/public\/browser\/render_view_host.h\"\n#include \"ui\/events\/event.h\"\n#include \"ui\/events\/event_constants.h\"\n#include \"ui\/events\/keycodes\/keyboard_codes_posix.h\"\n#include \"xwalk\/application\/common\/manifest_handlers\/tizen_setting_handler.h\"\n#endif\n\n#include \"xwalk\/application\/common\/application_manifest_constants.h\"\n#include \"xwalk\/application\/common\/manifest_handlers\/csp_handler.h\"\n#include \"xwalk\/application\/common\/manifest_handlers\/navigation_handler.h\"\n\nnamespace xwalk {\n\nnamespace widget_keys = application_widget_keys;\n\nnamespace application {\n\nnamespace {\nconst char kAsterisk[] = \"*\";\n\nconst char kDirectiveValueSelf[] = \"'self'\";\nconst char kDirectiveValueNone[] = \"'none'\";\n\nconst char kDirectiveNameDefault[] = \"default-src\";\nconst char kDirectiveNameScript[] = \"script-src\";\nconst char kDirectiveNameStyle[] = \"style-src\";\nconst char kDirectiveNameObject[] = \"object-src\";\n\nCSPInfo* GetDefaultCSPInfo() {\n static CSPInfo default_csp_info;\n if (default_csp_info.GetDirectives().empty()) {\n std::vector<std::string> directive_all;\n std::vector<std::string> directive_self;\n std::vector<std::string> directive_none;\n directive_all.push_back(kAsterisk);\n directive_self.push_back(kDirectiveValueSelf);\n directive_none.push_back(kDirectiveValueNone);\n\n default_csp_info.SetDirective(kDirectiveNameDefault, directive_all);\n default_csp_info.SetDirective(kDirectiveNameScript, directive_self);\n default_csp_info.SetDirective(kDirectiveNameStyle, directive_self);\n default_csp_info.SetDirective(kDirectiveNameObject, directive_none);\n }\n\n return (new CSPInfo(default_csp_info));\n}\n\n} \/\/ namespace\n\n\nApplicationTizen::ApplicationTizen(\n scoped_refptr<ApplicationData> data,\n RuntimeContext* runtime_context,\n Application::Observer* observer)\n : Application(data, runtime_context, observer) {\n#if defined(USE_OZONE)\n base::MessagePumpOzone::Current()->AddObserver(this);\n#endif\n}\n\nApplicationTizen::~ApplicationTizen() {\n#if defined(USE_OZONE)\n base::MessagePumpOzone::Current()->RemoveObserver(this);\n#endif\n}\n\nvoid ApplicationTizen::Hide() {\n DCHECK(runtimes_.size());\n std::set<Runtime*>::iterator it = runtimes_.begin();\n for (; it != runtimes_.end(); ++it) {\n if ((*it)->window())\n (*it)->window()->Hide();\n }\n}\n\nvoid ApplicationTizen::InitSecurityPolicy() {\n \/\/ On Tizen, CSP mode has higher priority, and WARP will be disabled\n \/\/ if the application is under CSP mode.\n if (!data_->HasCSPDefined()) {\n Application::InitSecurityPolicy();\n return;\n }\n\n if (data_->GetPackageType() != Package::WGT)\n return;\n\n CSPInfo* csp_info =\n static_cast<CSPInfo*>(data_->GetManifestData(widget_keys::kCSPKey));\n if (!csp_info || csp_info->GetDirectives().empty())\n data_->SetManifestData(widget_keys::kCSPKey, GetDefaultCSPInfo());\n\n \/\/ Always enable security mode when under CSP mode.\n security_mode_enabled_ = true;\n NavigationInfo* info = static_cast<NavigationInfo*>(\n data_->GetManifestData(widget_keys::kAllowNavigationKey));\n if (info) {\n const std::vector<std::string>& allowed_list = info->GetAllowedDomains();\n for (std::vector<std::string>::const_iterator it = allowed_list.begin();\n it != allowed_list.end(); ++it) {\n \/\/ If the policy is \"*\", it represents that any external link is allowed\n \/\/ to navigate to.\n if ((*it) == kAsterisk) {\n security_mode_enabled_ = false;\n return;\n }\n\n \/\/ If the policy start with \"*.\", like this: *.domain,\n \/\/ means that can access to all subdomains for 'domain',\n \/\/ otherwise, the host of request url should exactly the same\n \/\/ as policy.\n bool subdomains = ((*it).find(\"*.\") == 0);\n std::string host = subdomains ? (*it).substr(2) : (*it);\n AddSecurityPolicy(GURL(\"http:\/\/\" + host), subdomains);\n AddSecurityPolicy(GURL(\"https:\/\/\" + host), subdomains);\n }\n }\n DCHECK(render_process_host_);\n render_process_host_->Send(\n new ViewMsg_EnableSecurityMode(\n ApplicationData::GetBaseURLFromApplicationId(id()),\n SecurityPolicy::CSP));\n}\n\n#if defined(USE_OZONE)\nbase::EventStatus ApplicationTizen::WillProcessEvent(\n const base::NativeEvent& event) {\n return base::EVENT_CONTINUE;\n}\n\nvoid ApplicationTizen::DidProcessEvent(\n const base::NativeEvent& event) {\n ui::Event* ui_event = static_cast<ui::Event*>(event);\n if (!ui_event->IsKeyEvent() || ui_event->type() != ui::ET_KEY_PRESSED)\n return;\n\n ui::KeyEvent* key_event = static_cast<ui::KeyEvent*>(ui_event);\n\n \/\/ FIXME: Most Wayland devices don't have similar hardware button for 'back'\n \/\/ and 'memu' as Tizen Mobile, even that hardare buttons could be different\n \/\/ across different kinds of Wayland platforms.\n \/\/ Here use external keyboard button 'Backspace' & 'HOME' to emulate 'back'\n \/\/ and 'menu' key. Should change this if there is customized key binding.\n if (key_event->key_code() != ui::VKEY_BACK &&\n key_event->key_code() != ui::VKEY_HOME)\n return;\n\n TizenSettingInfo* info = static_cast<TizenSettingInfo*>(\n data()->GetManifestData(widget_keys::kTizenSettingKey));\n if (info && !info->hwkey_enabled())\n return;\n\n for (std::set<xwalk::Runtime*>::iterator it = runtimes_.begin();\n it != runtimes_.end(); ++it) {\n (*it)->web_contents()->GetRenderViewHost()->Send(new ViewMsg_HWKeyPressed(\n (*it)->web_contents()->GetRoutingID(), key_event->key_code()));\n }\n}\n#endif\n\n} \/\/ namespace application\n} \/\/ namespace xwalk\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-2011 Francois Beaune\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 \"projectbuilder.h\"\n\n\/\/ appleseed.studio headers.\n#include \"mainwindow\/project\/assemblyinstancecollectionitem.h\"\n#include \"mainwindow\/project\/exceptioninvalidentityname.h\"\n#include \"mainwindow\/project\/texturecollectionitem.h\"\n#include \"mainwindow\/project\/textureinstancecollectionitem.h\"\n\n\/\/ appleseed.renderer headers.\n#include \"renderer\/api\/object.h\"\n#include \"renderer\/api\/project.h\"\n#include \"renderer\/api\/scene.h\"\n#include \"renderer\/api\/texture.h\"\n\n\/\/ appleseed.foundation headers.\n#include \"foundation\/math\/matrix.h\"\n#include \"foundation\/math\/transform.h\"\n#include \"foundation\/utility\/containers\/specializedarrays.h\"\n#include \"foundation\/utility\/searchpaths.h\"\n#include \"foundation\/utility\/foreach.h\"\n#include \"foundation\/utility\/string.h\"\n\n\/\/ boost headers.\n#include \"boost\/filesystem\/path.hpp\"\n\n\/\/ Standard headers.\n#include <memory>\n\nusing namespace boost;\nusing namespace foundation;\nusing namespace renderer;\nusing namespace std;\n\nnamespace appleseed {\nnamespace studio {\n\nProjectBuilder::ProjectBuilder(\n Project& project,\n ProjectTree& project_tree)\n : m_project(project)\n , m_project_tree(project_tree)\n{\n}\n\nvoid ProjectBuilder::notify_project_modification() const\n{\n emit signal_project_modified();\n}\n\nvoid ProjectBuilder::insert_assembly(\n const string& name) const\n{\n auto_release_ptr<Assembly> assembly(\n AssemblyFactory::create(name.c_str(), ParamArray()));\n\n m_project_tree.get_assembly_collection_item().add_item(assembly.get());\n\n m_project.get_scene()->assemblies().insert(assembly);\n\n notify_project_modification();\n}\n\nvoid ProjectBuilder::insert_assembly_instance(\n const string& name,\n Assembly& assembly) const\n{\n auto_release_ptr<AssemblyInstance> assembly_instance(\n AssemblyInstanceFactory::create(\n name.c_str(),\n assembly,\n Transformd(Matrix4d::identity())));\n\n m_project_tree.add_item(assembly_instance.get());\n\n Scene* scene = m_project.get_scene();\n scene->assembly_instances().insert(assembly_instance);\n scene->bump_geometry_version_id();\n\n notify_project_modification();\n}\n\nvoid ProjectBuilder::remove_assembly_instance(\n const UniqueID assembly_instance_id) const\n{\n m_project_tree\n .get_assembly_instance_collection_item()\n .remove_item(assembly_instance_id);\n\n Scene* scene = m_project.get_scene();\n scene->assembly_instances().remove(assembly_instance_id);\n scene->bump_geometry_version_id();\n\n notify_project_modification();\n}\n\nvoid ProjectBuilder::insert_objects(\n Assembly& assembly,\n const string& path) const\n{\n const string base_object_name = filesystem::path(path).replace_extension().filename();\n\n const MeshObjectArray mesh_objects =\n MeshObjectReader().read(\n path.c_str(),\n base_object_name.c_str(),\n ParamArray());\n\n for (size_t i = 0; i < mesh_objects.size(); ++i)\n {\n MeshObject* object = mesh_objects[i];\n\n object->get_parameters().insert(\"filename\", filesystem::path(path).filename());\n object->get_parameters().insert(\"__common_base_name\", base_object_name);\n\n m_project_tree.get_assembly_collection_item().get_item(assembly).add_item(object);\n\n const size_t object_index =\n assembly.objects().insert(auto_release_ptr<Object>(object));\n\n const string object_instance_name = string(object->get_name()) + \"_inst\";\n \n auto_release_ptr<ObjectInstance> object_instance(\n ObjectInstanceFactory::create(\n object_instance_name.c_str(),\n *object,\n object_index,\n Transformd(Matrix4d::identity()),\n StringArray()));\n\n m_project_tree.get_assembly_collection_item().get_item(assembly).add_item(object_instance.get());\n\n assembly.object_instances().insert(object_instance);\n }\n\n assembly.bump_version_id();\n\n if (!mesh_objects.empty())\n notify_project_modification();\n}\n\nnamespace\n{\n auto_release_ptr<Texture> create_texture(\n const string& path)\n {\n const string texture_name = filesystem::path(path).replace_extension().filename();\n\n ParamArray texture_params;\n texture_params.insert(\"filename\", path);\n texture_params.insert(\"color_space\", \"srgb\");\n\n SearchPaths search_paths;\n return auto_release_ptr<Texture>(\n DiskTexture2dFactory().create(\n texture_name.c_str(),\n texture_params,\n search_paths));\n }\n\n auto_release_ptr<TextureInstance> create_texture_instance(\n const string& texture_name,\n const size_t texture_index)\n {\n const string texture_instance_name = texture_name + \"_inst\";\n\n ParamArray texture_instance_params;\n texture_instance_params.insert(\"addressing_mode\", \"clamp\");\n texture_instance_params.insert(\"filtering_mode\", \"bilinear\");\n\n return auto_release_ptr<TextureInstance>(\n TextureInstanceFactory::create(\n texture_instance_name.c_str(),\n texture_instance_params,\n texture_index));\n }\n}\n\nvoid ProjectBuilder::insert_textures(\n Assembly& assembly,\n const string& path) const\n{\n auto_release_ptr<Texture> texture = create_texture(path);\n const string texture_name = texture->get_name();\n\n m_project_tree.get_assembly_collection_item().get_item(assembly).add_item(texture.get());\n\n const size_t texture_index = assembly.textures().insert(texture);\n\n auto_release_ptr<TextureInstance> texture_instance =\n create_texture_instance(texture_name, texture_index);\n\n m_project_tree.get_assembly_collection_item().get_item(assembly).add_item(texture_instance.get());\n\n assembly.texture_instances().insert(texture_instance);\n\n notify_project_modification();\n}\n\nvoid ProjectBuilder::insert_textures(\n const string& path) const\n{\n const Scene& scene = *m_project.get_scene();\n\n auto_release_ptr<Texture> texture = create_texture(path);\n const string texture_name = texture->get_name();\n\n m_project_tree.add_item(texture.get());\n\n const size_t texture_index = scene.textures().insert(texture);\n\n auto_release_ptr<TextureInstance> texture_instance =\n create_texture_instance(texture_name, texture_index);\n\n m_project_tree.add_item(texture_instance.get());\n\n scene.texture_instances().insert(texture_instance);\n\n notify_project_modification();\n}\n\nstring ProjectBuilder::get_entity_name(const Dictionary& values)\n{\n if (!values.strings().exist(EntityEditorFormFactoryBase::NameParameter))\n throw ExceptionInvalidEntityName();\n\n const string name = trim_both(\n values.get<string>(EntityEditorFormFactoryBase::NameParameter));\n\n if (!is_valid_entity_name(name))\n throw ExceptionInvalidEntityName();\n\n return name;\n}\n\nbool ProjectBuilder::is_valid_entity_name(const string& name)\n{\n return !name.empty();\n}\n\n} \/\/ namespace studio\n} \/\/ namespace appleseed\n<commit_msg>minor code simplification.<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-2011 Francois Beaune\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 \"projectbuilder.h\"\n\n\/\/ appleseed.studio headers.\n#include \"mainwindow\/project\/assemblyinstancecollectionitem.h\"\n#include \"mainwindow\/project\/exceptioninvalidentityname.h\"\n#include \"mainwindow\/project\/texturecollectionitem.h\"\n#include \"mainwindow\/project\/textureinstancecollectionitem.h\"\n\n\/\/ appleseed.renderer headers.\n#include \"renderer\/api\/object.h\"\n#include \"renderer\/api\/project.h\"\n#include \"renderer\/api\/scene.h\"\n#include \"renderer\/api\/texture.h\"\n\n\/\/ appleseed.foundation headers.\n#include \"foundation\/math\/matrix.h\"\n#include \"foundation\/math\/transform.h\"\n#include \"foundation\/utility\/containers\/specializedarrays.h\"\n#include \"foundation\/utility\/searchpaths.h\"\n#include \"foundation\/utility\/foreach.h\"\n#include \"foundation\/utility\/string.h\"\n\n\/\/ boost headers.\n#include \"boost\/filesystem\/path.hpp\"\n\n\/\/ Standard headers.\n#include <memory>\n\nusing namespace boost;\nusing namespace foundation;\nusing namespace renderer;\nusing namespace std;\n\nnamespace appleseed {\nnamespace studio {\n\nProjectBuilder::ProjectBuilder(\n Project& project,\n ProjectTree& project_tree)\n : m_project(project)\n , m_project_tree(project_tree)\n{\n}\n\nvoid ProjectBuilder::notify_project_modification() const\n{\n emit signal_project_modified();\n}\n\nvoid ProjectBuilder::insert_assembly(\n const string& name) const\n{\n auto_release_ptr<Assembly> assembly(\n AssemblyFactory::create(name.c_str(), ParamArray()));\n\n m_project_tree.add_item(assembly.get());\n\n m_project.get_scene()->assemblies().insert(assembly);\n\n notify_project_modification();\n}\n\nvoid ProjectBuilder::insert_assembly_instance(\n const string& name,\n Assembly& assembly) const\n{\n auto_release_ptr<AssemblyInstance> assembly_instance(\n AssemblyInstanceFactory::create(\n name.c_str(),\n assembly,\n Transformd(Matrix4d::identity())));\n\n m_project_tree.add_item(assembly_instance.get());\n\n Scene* scene = m_project.get_scene();\n scene->assembly_instances().insert(assembly_instance);\n scene->bump_geometry_version_id();\n\n notify_project_modification();\n}\n\nvoid ProjectBuilder::remove_assembly_instance(\n const UniqueID assembly_instance_id) const\n{\n m_project_tree\n .get_assembly_instance_collection_item()\n .remove_item(assembly_instance_id);\n\n Scene* scene = m_project.get_scene();\n scene->assembly_instances().remove(assembly_instance_id);\n scene->bump_geometry_version_id();\n\n notify_project_modification();\n}\n\nvoid ProjectBuilder::insert_objects(\n Assembly& assembly,\n const string& path) const\n{\n const string base_object_name = filesystem::path(path).replace_extension().filename();\n\n const MeshObjectArray mesh_objects =\n MeshObjectReader().read(\n path.c_str(),\n base_object_name.c_str(),\n ParamArray());\n\n for (size_t i = 0; i < mesh_objects.size(); ++i)\n {\n MeshObject* object = mesh_objects[i];\n\n object->get_parameters().insert(\"filename\", filesystem::path(path).filename());\n object->get_parameters().insert(\"__common_base_name\", base_object_name);\n\n m_project_tree.get_assembly_collection_item().get_item(assembly).add_item(object);\n\n const size_t object_index =\n assembly.objects().insert(auto_release_ptr<Object>(object));\n\n const string object_instance_name = string(object->get_name()) + \"_inst\";\n \n auto_release_ptr<ObjectInstance> object_instance(\n ObjectInstanceFactory::create(\n object_instance_name.c_str(),\n *object,\n object_index,\n Transformd(Matrix4d::identity()),\n StringArray()));\n\n m_project_tree.get_assembly_collection_item().get_item(assembly).add_item(object_instance.get());\n\n assembly.object_instances().insert(object_instance);\n }\n\n assembly.bump_version_id();\n\n if (!mesh_objects.empty())\n notify_project_modification();\n}\n\nnamespace\n{\n auto_release_ptr<Texture> create_texture(\n const string& path)\n {\n const string texture_name = filesystem::path(path).replace_extension().filename();\n\n ParamArray texture_params;\n texture_params.insert(\"filename\", path);\n texture_params.insert(\"color_space\", \"srgb\");\n\n SearchPaths search_paths;\n return auto_release_ptr<Texture>(\n DiskTexture2dFactory().create(\n texture_name.c_str(),\n texture_params,\n search_paths));\n }\n\n auto_release_ptr<TextureInstance> create_texture_instance(\n const string& texture_name,\n const size_t texture_index)\n {\n const string texture_instance_name = texture_name + \"_inst\";\n\n ParamArray texture_instance_params;\n texture_instance_params.insert(\"addressing_mode\", \"clamp\");\n texture_instance_params.insert(\"filtering_mode\", \"bilinear\");\n\n return auto_release_ptr<TextureInstance>(\n TextureInstanceFactory::create(\n texture_instance_name.c_str(),\n texture_instance_params,\n texture_index));\n }\n}\n\nvoid ProjectBuilder::insert_textures(\n Assembly& assembly,\n const string& path) const\n{\n auto_release_ptr<Texture> texture = create_texture(path);\n const string texture_name = texture->get_name();\n\n m_project_tree.get_assembly_collection_item().get_item(assembly).add_item(texture.get());\n\n const size_t texture_index = assembly.textures().insert(texture);\n\n auto_release_ptr<TextureInstance> texture_instance =\n create_texture_instance(texture_name, texture_index);\n\n m_project_tree.get_assembly_collection_item().get_item(assembly).add_item(texture_instance.get());\n\n assembly.texture_instances().insert(texture_instance);\n\n notify_project_modification();\n}\n\nvoid ProjectBuilder::insert_textures(\n const string& path) const\n{\n const Scene& scene = *m_project.get_scene();\n\n auto_release_ptr<Texture> texture = create_texture(path);\n const string texture_name = texture->get_name();\n\n m_project_tree.add_item(texture.get());\n\n const size_t texture_index = scene.textures().insert(texture);\n\n auto_release_ptr<TextureInstance> texture_instance =\n create_texture_instance(texture_name, texture_index);\n\n m_project_tree.add_item(texture_instance.get());\n\n scene.texture_instances().insert(texture_instance);\n\n notify_project_modification();\n}\n\nstring ProjectBuilder::get_entity_name(const Dictionary& values)\n{\n if (!values.strings().exist(EntityEditorFormFactoryBase::NameParameter))\n throw ExceptionInvalidEntityName();\n\n const string name = trim_both(\n values.get<string>(EntityEditorFormFactoryBase::NameParameter));\n\n if (!is_valid_entity_name(name))\n throw ExceptionInvalidEntityName();\n\n return name;\n}\n\nbool ProjectBuilder::is_valid_entity_name(const string& name)\n{\n return !name.empty();\n}\n\n} \/\/ namespace studio\n} \/\/ namespace appleseed\n<|endoftext|>"} {"text":"<commit_before>\/*\n * Copyright (c) 2014 Samsung Electronics Co., Ltd.\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n *\n *\/\n\n\/\/ EXTERNAL INCLUDES\n#include <math.h>\n\n\/\/ INTERNAL INCLUDES\n#include \"..\/shared\/view.h\"\n\n#include <dali\/dali.h>\n#include <dali-toolkit\/dali-toolkit.h>\n\nusing namespace Dali;\n\n\/\/ LOCAL STUFF\nnamespace\n{\n\nconst char * const TOOLBAR_IMAGE( DALI_IMAGE_DIR \"top-bar.png\" );\nconst char * const APPLICATION_TITLE_HIGHP( \"Dissolve Effect(highp)\" );\nconst char * const APPLICATION_TITLE_MEDIUMP( \"Dissolve Effect(mediump)\" );\nconst char * const EFFECT_HIGHP_IMAGE( DALI_IMAGE_DIR \"icon-highp.png\" );\nconst char * const EFFECT_MEDIUMP_IMAGE( DALI_IMAGE_DIR \"icon-mediump.png\" );\nconst char * const PLAY_ICON( DALI_IMAGE_DIR \"icon-play.png\" );\nconst char * const STOP_ICON( DALI_IMAGE_DIR \"icon-stop.png\" );\n\nconst char* IMAGES[] =\n{\n DALI_IMAGE_DIR \"gallery-large-1.jpg\",\n DALI_IMAGE_DIR \"gallery-large-2.jpg\",\n DALI_IMAGE_DIR \"gallery-large-3.jpg\",\n DALI_IMAGE_DIR \"gallery-large-4.jpg\",\n DALI_IMAGE_DIR \"gallery-large-5.jpg\",\n DALI_IMAGE_DIR \"gallery-large-6.jpg\",\n DALI_IMAGE_DIR \"gallery-large-7.jpg\",\n DALI_IMAGE_DIR \"gallery-large-8.jpg\",\n DALI_IMAGE_DIR \"gallery-large-9.jpg\",\n DALI_IMAGE_DIR \"gallery-large-10.jpg\",\n DALI_IMAGE_DIR \"gallery-large-11.jpg\",\n DALI_IMAGE_DIR \"gallery-large-12.jpg\",\n DALI_IMAGE_DIR \"gallery-large-13.jpg\",\n DALI_IMAGE_DIR \"gallery-large-14.jpg\",\n DALI_IMAGE_DIR \"gallery-large-15.jpg\",\n DALI_IMAGE_DIR \"gallery-large-16.jpg\",\n DALI_IMAGE_DIR \"gallery-large-17.jpg\",\n DALI_IMAGE_DIR \"gallery-large-18.jpg\",\n DALI_IMAGE_DIR \"gallery-large-19.jpg\",\n DALI_IMAGE_DIR \"gallery-large-20.jpg\",\n DALI_IMAGE_DIR \"gallery-large-21.jpg\",\n};\n\nconst int NUM_IMAGES( sizeof(IMAGES) \/ sizeof(IMAGES[0]) );\n\n\/\/ The duration of the current image staying on screen when slideshow is on\nconst int VIEWINGTIME = 2000; \/\/ 2 seconds\n\nconst float TRANSITION_DURATION = 2.5f; \/\/2.5 second\n\nconst float INITIAL_DEPTH = -10.0f;\n} \/\/ namespace\n\nclass DissolveEffectApp : public ConnectionTracker\n{\npublic:\n\n \/**\n * Constructor\n * @param application class, stored as reference\n *\/\n DissolveEffectApp( Application& application );\n\n ~DissolveEffectApp();\n\nprivate:\n\n \/**\n * This method gets called once the main loop of application is up and running\n *\/\n void OnInit( Application& application );\n \/**\n * PanGesture callback. This method gets called when the pan gesture is detected.\n * @param[in] actor The actor receiving the pan gesture.\n * @param[in] gesture The detected pan gesture.\n *\/\n void OnPanGesture( Actor actor, const PanGesture& gesture );\n\n \/**\n * Set up the animations for transition\n * @param[in] position The point ( locates within rectange {(0,0),(0,1),(1,0),(1,1)} ) passing through the central line of the dissolve effect\n * @param[in] displacement The direction of the central line of the dissolve effect\n *\/\n void StartTransition(Vector2 position, Vector2 displacement);\n \/**\n * Callback function of effect-switch button\n * Change the precision of the effect shader when the effect button is clicked\n * @param[in] button The handle of the clicked button\n *\/\n bool OnEffectButtonClicked( Toolkit::Button button );\n \/**\n * Callback function of slideshow button\n * Start or stop the automatical image display when the slideshow button is clicked\n * @param[in] button The handle of the clicked button\n *\/\n bool OnSildeshowButtonClicked( Toolkit::Button button );\n \/**\n * Callback function of cube transition completed signal\n * @param[in] effect The cube effect used for the transition\n * @param[in] imageActor The target imageActor of the completed transition\n *\/\n void OnTransitionCompleted(Animation& source);\n \/**\n * Callback function of timer tick\n * The timer is used to count the image display duration after cube transition in slideshow,\n *\/\n bool OnTimerTick();\n\n \/**\n * Main key event handler\n *\/\n void OnKeyEvent(const KeyEvent& event);\n\nprivate:\n Application& mApplication;\n Toolkit::View mView;\n Toolkit::ToolBar mToolBar;\n Layer mContent;\n Toolkit::TextView mTitleActor;\n\n ImageActor mCurrentImage;\n ImageActor mNextImage;\n unsigned int mIndex;\n Constraint mSizeConstraint;\n\n Toolkit::DissolveEffect mCurrentImageEffect;\n Toolkit::DissolveEffect mNextImageEffect;\n bool mUseHighPrecision;\n Animation mAnimation;\n\n PanGestureDetector mPanGestureDetector;\n bool mIsTransiting;\n\n bool mSlideshow;\n Timer mViewTimer;\n bool mTimerReady;\n unsigned int mCentralLineIndex;\n\n Image mIconPlay;\n Image mIconStop;\n Toolkit::PushButton mPlayStopButton;\n\n Image mIconHighP;\n Image mIconMediumP;\n Toolkit::PushButton mEffectChangeButton;\n};\n\nDissolveEffectApp::DissolveEffectApp( Application& application )\n: mApplication( application ),\n mIndex( 0 ),\n mUseHighPrecision(true),\n mIsTransiting( false ),\n mSlideshow( false ),\n mTimerReady( false ),\n mCentralLineIndex( 0 )\n{\n mApplication.InitSignal().Connect( this, &DissolveEffectApp::OnInit );\n}\n\nDissolveEffectApp::~DissolveEffectApp()\n{\n \/\/Nothing to do\n}\n\nvoid DissolveEffectApp::OnInit( Application& application )\n{\n Stage::GetCurrent().KeyEventSignal().Connect(this, &DissolveEffectApp::OnKeyEvent);\n\n \/\/ Creates a default view with a default tool bar, the view is added to the stage.\n mContent = DemoHelper::CreateView( application, mView,mToolBar, \"\", TOOLBAR_IMAGE, \"\" );\n\n \/\/ Add an effect-changing button on the right of the tool bar.\n mIconHighP = ResourceImage::New( EFFECT_HIGHP_IMAGE );\n mIconMediumP = ResourceImage::New( EFFECT_MEDIUMP_IMAGE );\n mEffectChangeButton = Toolkit::PushButton::New();\n mEffectChangeButton.SetBackgroundImage(mIconHighP);\n mEffectChangeButton.ClickedSignal().Connect( this, &DissolveEffectApp::OnEffectButtonClicked );\n mToolBar.AddControl( mEffectChangeButton, DemoHelper::DEFAULT_VIEW_STYLE.mToolBarButtonPercentage, Toolkit::Alignment::HorizontalRight, DemoHelper::DEFAULT_MODE_SWITCH_PADDING );\n\n \/\/ Add title to the tool bar.\n mTitleActor = Toolkit::TextView::New();\n mTitleActor.SetText( APPLICATION_TITLE_HIGHP );\n mTitleActor.SetStyleToCurrentText(DemoHelper::GetDefaultTextStyle());\n mToolBar.AddControl( mTitleActor, DemoHelper::DEFAULT_VIEW_STYLE.mToolBarTitlePercentage, Toolkit::Alignment::HorizontalCenter );\n\n \/\/ Add an slide-show button on the right of the title\n mIconPlay = ResourceImage::New( PLAY_ICON );\n mIconStop = ResourceImage::New( STOP_ICON );\n mPlayStopButton = Toolkit::PushButton::New();\n mPlayStopButton.SetBackgroundImage( mIconPlay );\n mPlayStopButton.ClickedSignal().Connect( this, &DissolveEffectApp::OnSildeshowButtonClicked );\n mToolBar.AddControl( mPlayStopButton, DemoHelper::DEFAULT_VIEW_STYLE.mToolBarButtonPercentage, Toolkit::Alignment::HorizontalCenter, DemoHelper::DEFAULT_PLAY_PADDING );\n\n \/\/ use pan gesture to detect the cursor or finger movement\n mPanGestureDetector = PanGestureDetector::New();\n mPanGestureDetector.DetectedSignal().Connect( this, &DissolveEffectApp::OnPanGesture );\n\n \/\/ create the dissolve effect object\n mCurrentImageEffect = Toolkit::DissolveEffect::New(mUseHighPrecision);\n mNextImageEffect = Toolkit::DissolveEffect::New(mUseHighPrecision);\n\n\n mViewTimer = Timer::New( VIEWINGTIME );\n mViewTimer.TickSignal().Connect( this, &DissolveEffectApp::OnTimerTick );\n mTimerReady = true;\n\n mSizeConstraint= Constraint::New<Vector3>( Actor::SCALE, LocalSource( Actor::SIZE ), ParentSource( Actor::SIZE ), ScaleToFitKeepAspectRatioConstraint() );\n\n \/\/ show the first image\n mCurrentImage = ImageActor::New( ResourceImage::New( IMAGES[mIndex] ) );\n mCurrentImage.SetPositionInheritanceMode(USE_PARENT_POSITION_PLUS_LOCAL_POSITION);\n mCurrentImage.ApplyConstraint( mSizeConstraint );\n mContent.Add(mCurrentImage);\n mPanGestureDetector.Attach( mCurrentImage );\n}\n\n\/\/ signal handler, called when the pan gesture is detected\nvoid DissolveEffectApp::OnPanGesture( Actor actor, const PanGesture& gesture )\n{\n \/\/ does not response when the animation has not finished\n if( mIsTransiting || mSlideshow )\n {\n return;\n }\n\n if( gesture.state == Gesture::Continuing )\n {\n if( gesture.displacement.x < 0)\n {\n mIndex = (mIndex + 1)%NUM_IMAGES;\n }\n else\n {\n mIndex = (mIndex + NUM_IMAGES -1)%NUM_IMAGES;\n }\n\n Image image = ResourceImage::New( IMAGES[ mIndex ] );\n mNextImage = ImageActor::New( image );\n mNextImage.SetPositionInheritanceMode(USE_PARENT_POSITION_PLUS_LOCAL_POSITION);\n mNextImage.ApplyConstraint( mSizeConstraint );\n mNextImage.SetZ(INITIAL_DEPTH);\n mContent.Add(mNextImage);\n Vector2 size = Vector2( mCurrentImage.GetCurrentSize() );\n StartTransition( gesture.position \/ size, gesture.displacement * Vector2(1.0, size.x\/size.y));\n }\n}\n\nvoid DissolveEffectApp::StartTransition(Vector2 position, Vector2 displacement)\n{\n mAnimation = Animation::New(TRANSITION_DURATION);\n\n mCurrentImageEffect.SetCentralLine(position,displacement);\n mCurrentImageEffect.SetDistortion(0.0f);\n mCurrentImage.SetShaderEffect(mCurrentImageEffect);\n mAnimation.AnimateTo( Property(mCurrentImageEffect, mCurrentImageEffect.GetDistortionPropertyName()), 1.0f, AlphaFunctions::Linear );\n\n mNextImage.SetOpacity(0.0f);\n mAnimation.OpacityTo( mNextImage, 1.0, AlphaFunctions::Linear );\n\n if(mUseHighPrecision)\n {\n mNextImageEffect.SetCentralLine(position,-displacement);\n mNextImageEffect.SetDistortion(1.0f);\n mNextImage.SetShaderEffect(mNextImageEffect);\n mAnimation.AnimateTo( Property(mNextImageEffect, mNextImageEffect.GetDistortionPropertyName()), 0.0f, AlphaFunctions::Linear );\n }\n else\n {\n mAnimation.MoveTo(mNextImage, Vector3(0.0f, 0.0f, 0.0f), AlphaFunctions::Linear);\n }\n\n mAnimation.FinishedSignal().Connect( this, &DissolveEffectApp::OnTransitionCompleted );\n mAnimation.Play();\n mIsTransiting = true;\n}\n\nvoid DissolveEffectApp::OnKeyEvent(const KeyEvent& event)\n{\n if(event.state == KeyEvent::Down)\n {\n if( IsKey( event, Dali::DALI_KEY_ESCAPE) || IsKey( event, Dali::DALI_KEY_BACK) )\n {\n mApplication.Quit();\n }\n }\n}\n\nbool DissolveEffectApp::OnEffectButtonClicked( Toolkit::Button button )\n{\n mUseHighPrecision = !mUseHighPrecision;\n mCurrentImageEffect = Toolkit::DissolveEffect::New(mUseHighPrecision);\n if(mUseHighPrecision)\n {\n mTitleActor.SetText( APPLICATION_TITLE_HIGHP );\n mEffectChangeButton.SetBackgroundImage(mIconHighP);\n }\n else\n {\n mTitleActor.SetText( APPLICATION_TITLE_MEDIUMP );\n mEffectChangeButton.SetBackgroundImage(mIconMediumP);\n }\n mTitleActor.SetStyleToCurrentText(DemoHelper::GetDefaultTextStyle());\n\n return true;\n}\n\nbool DissolveEffectApp::OnSildeshowButtonClicked( Toolkit::Button button )\n{\n mSlideshow = !mSlideshow;\n if( mSlideshow )\n {\n mPlayStopButton.SetBackgroundImage( mIconStop );\n mPanGestureDetector.Detach( mContent );\n mViewTimer.Start();\n mTimerReady = false;\n }\n else\n {\n mPlayStopButton.SetBackgroundImage( mIconPlay );\n mTimerReady = true;\n mPanGestureDetector.Attach( mContent );\n }\n return true;\n}\n\nvoid DissolveEffectApp::OnTransitionCompleted( Animation& source )\n{\n mCurrentImage.RemoveShaderEffect();\n mNextImage.RemoveShaderEffect();\n mContent.Remove(mCurrentImage);\n mPanGestureDetector.Detach( mCurrentImage );\n mCurrentImage = mNextImage;\n mPanGestureDetector.Attach( mCurrentImage );\n mIsTransiting = false;\n\n if( mSlideshow)\n {\n mViewTimer.Start();\n mTimerReady = false;\n }\n}\n\nbool DissolveEffectApp::OnTimerTick()\n{\n mTimerReady = true;\n if(mSlideshow)\n {\n mIndex = (mIndex + 1)%NUM_IMAGES;\n Image image = ResourceImage::New( IMAGES[ mIndex ] );\n mNextImage = ImageActor::New( image );\n mNextImage.SetPositionInheritanceMode(USE_PARENT_POSITION_PLUS_LOCAL_POSITION);\n mNextImage.ApplyConstraint( mSizeConstraint );\n mNextImage.SetZ(INITIAL_DEPTH);\n mContent.Add(mNextImage);\n switch(mCentralLineIndex%4)\n {\n case 0:\n {\n StartTransition(Vector2(1.0f,0.5f), Vector2(-1.0f, 0.0f));\n break;\n }\n case 1:\n {\n StartTransition(Vector2(0.5f,0.0f), Vector2(0.0f, 1.0f));\n break;\n }\n case 2:\n {\n StartTransition(Vector2(0.0f,0.5f), Vector2(1.0f, 0.0f));\n break;\n }\n default:\n {\n StartTransition(Vector2(0.5f,1.0f), Vector2(0.0f, -1.0f));\n break;\n }\n\n }\n mCentralLineIndex++;\n }\n return false; \/\/return false to stop the timer\n}\n\n\/\/ Entry point for Linux & SLP applications\nint main( int argc, char **argv )\n{\n Application application = Application::New( &argc, &argv );\n DissolveEffectApp test( application );\n application.MainLoop();\n\n return 0;\n}\n<commit_msg>Fixed dissolve effect first image appearing smaller than viewport<commit_after>\/*\n * Copyright (c) 2014 Samsung Electronics Co., Ltd.\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n *\n *\/\n\n\/\/ EXTERNAL INCLUDES\n#include <math.h>\n\n\/\/ INTERNAL INCLUDES\n#include \"..\/shared\/view.h\"\n\n#include <dali\/dali.h>\n#include <dali-toolkit\/dali-toolkit.h>\n\nusing namespace Dali;\n\n\/\/ LOCAL STUFF\nnamespace\n{\n\nconst char * const TOOLBAR_IMAGE( DALI_IMAGE_DIR \"top-bar.png\" );\nconst char * const APPLICATION_TITLE_HIGHP( \"Dissolve Effect(highp)\" );\nconst char * const APPLICATION_TITLE_MEDIUMP( \"Dissolve Effect(mediump)\" );\nconst char * const EFFECT_HIGHP_IMAGE( DALI_IMAGE_DIR \"icon-highp.png\" );\nconst char * const EFFECT_MEDIUMP_IMAGE( DALI_IMAGE_DIR \"icon-mediump.png\" );\nconst char * const PLAY_ICON( DALI_IMAGE_DIR \"icon-play.png\" );\nconst char * const STOP_ICON( DALI_IMAGE_DIR \"icon-stop.png\" );\n\nconst char* IMAGES[] =\n{\n DALI_IMAGE_DIR \"gallery-large-1.jpg\",\n DALI_IMAGE_DIR \"gallery-large-2.jpg\",\n DALI_IMAGE_DIR \"gallery-large-3.jpg\",\n DALI_IMAGE_DIR \"gallery-large-4.jpg\",\n DALI_IMAGE_DIR \"gallery-large-5.jpg\",\n DALI_IMAGE_DIR \"gallery-large-6.jpg\",\n DALI_IMAGE_DIR \"gallery-large-7.jpg\",\n DALI_IMAGE_DIR \"gallery-large-8.jpg\",\n DALI_IMAGE_DIR \"gallery-large-9.jpg\",\n DALI_IMAGE_DIR \"gallery-large-10.jpg\",\n DALI_IMAGE_DIR \"gallery-large-11.jpg\",\n DALI_IMAGE_DIR \"gallery-large-12.jpg\",\n DALI_IMAGE_DIR \"gallery-large-13.jpg\",\n DALI_IMAGE_DIR \"gallery-large-14.jpg\",\n DALI_IMAGE_DIR \"gallery-large-15.jpg\",\n DALI_IMAGE_DIR \"gallery-large-16.jpg\",\n DALI_IMAGE_DIR \"gallery-large-17.jpg\",\n DALI_IMAGE_DIR \"gallery-large-18.jpg\",\n DALI_IMAGE_DIR \"gallery-large-19.jpg\",\n DALI_IMAGE_DIR \"gallery-large-20.jpg\",\n DALI_IMAGE_DIR \"gallery-large-21.jpg\",\n};\n\nconst int NUM_IMAGES( sizeof(IMAGES) \/ sizeof(IMAGES[0]) );\n\n\/\/ The duration of the current image staying on screen when slideshow is on\nconst int VIEWINGTIME = 2000; \/\/ 2 seconds\n\nconst float TRANSITION_DURATION = 2.5f; \/\/2.5 second\n\nconst float INITIAL_DEPTH = -10.0f;\n} \/\/ namespace\n\nclass DissolveEffectApp : public ConnectionTracker\n{\npublic:\n\n \/**\n * Constructor\n * @param application class, stored as reference\n *\/\n DissolveEffectApp( Application& application );\n\n ~DissolveEffectApp();\n\nprivate:\n\n \/**\n * This method gets called once the main loop of application is up and running\n *\/\n void OnInit( Application& application );\n \/**\n * PanGesture callback. This method gets called when the pan gesture is detected.\n * @param[in] actor The actor receiving the pan gesture.\n * @param[in] gesture The detected pan gesture.\n *\/\n void OnPanGesture( Actor actor, const PanGesture& gesture );\n\n \/**\n * Set up the animations for transition\n * @param[in] position The point ( locates within rectange {(0,0),(0,1),(1,0),(1,1)} ) passing through the central line of the dissolve effect\n * @param[in] displacement The direction of the central line of the dissolve effect\n *\/\n void StartTransition(Vector2 position, Vector2 displacement);\n \/**\n * Callback function of effect-switch button\n * Change the precision of the effect shader when the effect button is clicked\n * @param[in] button The handle of the clicked button\n *\/\n bool OnEffectButtonClicked( Toolkit::Button button );\n \/**\n * Callback function of slideshow button\n * Start or stop the automatical image display when the slideshow button is clicked\n * @param[in] button The handle of the clicked button\n *\/\n bool OnSildeshowButtonClicked( Toolkit::Button button );\n \/**\n * Callback function of cube transition completed signal\n * @param[in] effect The cube effect used for the transition\n * @param[in] imageActor The target imageActor of the completed transition\n *\/\n void OnTransitionCompleted(Animation& source);\n \/**\n * Callback function of timer tick\n * The timer is used to count the image display duration after cube transition in slideshow,\n *\/\n bool OnTimerTick();\n\n \/**\n * Main key event handler\n *\/\n void OnKeyEvent(const KeyEvent& event);\n\nprivate:\n Application& mApplication;\n Toolkit::View mView;\n Toolkit::ToolBar mToolBar;\n Layer mContent;\n Toolkit::TextView mTitleActor;\n Actor mParent;\n\n ImageActor mCurrentImage;\n ImageActor mNextImage;\n unsigned int mIndex;\n Constraint mSizeConstraint;\n\n Toolkit::DissolveEffect mCurrentImageEffect;\n Toolkit::DissolveEffect mNextImageEffect;\n bool mUseHighPrecision;\n Animation mAnimation;\n\n PanGestureDetector mPanGestureDetector;\n bool mIsTransiting;\n\n bool mSlideshow;\n Timer mViewTimer;\n bool mTimerReady;\n unsigned int mCentralLineIndex;\n\n Image mIconPlay;\n Image mIconStop;\n Toolkit::PushButton mPlayStopButton;\n\n Image mIconHighP;\n Image mIconMediumP;\n Toolkit::PushButton mEffectChangeButton;\n};\n\nDissolveEffectApp::DissolveEffectApp( Application& application )\n: mApplication( application ),\n mIndex( 0 ),\n mUseHighPrecision(true),\n mIsTransiting( false ),\n mSlideshow( false ),\n mTimerReady( false ),\n mCentralLineIndex( 0 )\n{\n mApplication.InitSignal().Connect( this, &DissolveEffectApp::OnInit );\n}\n\nDissolveEffectApp::~DissolveEffectApp()\n{\n \/\/Nothing to do\n}\n\nvoid DissolveEffectApp::OnInit( Application& application )\n{\n Stage::GetCurrent().KeyEventSignal().Connect(this, &DissolveEffectApp::OnKeyEvent);\n\n \/\/ Creates a default view with a default tool bar, the view is added to the stage.\n mContent = DemoHelper::CreateView( application, mView,mToolBar, \"\", TOOLBAR_IMAGE, \"\" );\n\n \/\/ Add an effect-changing button on the right of the tool bar.\n mIconHighP = ResourceImage::New( EFFECT_HIGHP_IMAGE );\n mIconMediumP = ResourceImage::New( EFFECT_MEDIUMP_IMAGE );\n mEffectChangeButton = Toolkit::PushButton::New();\n mEffectChangeButton.SetBackgroundImage(mIconHighP);\n mEffectChangeButton.ClickedSignal().Connect( this, &DissolveEffectApp::OnEffectButtonClicked );\n mToolBar.AddControl( mEffectChangeButton, DemoHelper::DEFAULT_VIEW_STYLE.mToolBarButtonPercentage, Toolkit::Alignment::HorizontalRight, DemoHelper::DEFAULT_MODE_SWITCH_PADDING );\n\n \/\/ Add title to the tool bar.\n mTitleActor = Toolkit::TextView::New();\n mTitleActor.SetText( APPLICATION_TITLE_HIGHP );\n mTitleActor.SetStyleToCurrentText(DemoHelper::GetDefaultTextStyle());\n mToolBar.AddControl( mTitleActor, DemoHelper::DEFAULT_VIEW_STYLE.mToolBarTitlePercentage, Toolkit::Alignment::HorizontalCenter );\n\n \/\/ Add an slide-show button on the right of the title\n mIconPlay = ResourceImage::New( PLAY_ICON );\n mIconStop = ResourceImage::New( STOP_ICON );\n mPlayStopButton = Toolkit::PushButton::New();\n mPlayStopButton.SetBackgroundImage( mIconPlay );\n mPlayStopButton.ClickedSignal().Connect( this, &DissolveEffectApp::OnSildeshowButtonClicked );\n mToolBar.AddControl( mPlayStopButton, DemoHelper::DEFAULT_VIEW_STYLE.mToolBarButtonPercentage, Toolkit::Alignment::HorizontalCenter, DemoHelper::DEFAULT_PLAY_PADDING );\n\n \/\/ use pan gesture to detect the cursor or finger movement\n mPanGestureDetector = PanGestureDetector::New();\n mPanGestureDetector.DetectedSignal().Connect( this, &DissolveEffectApp::OnPanGesture );\n\n \/\/ create the dissolve effect object\n mCurrentImageEffect = Toolkit::DissolveEffect::New(mUseHighPrecision);\n mNextImageEffect = Toolkit::DissolveEffect::New(mUseHighPrecision);\n\n mViewTimer = Timer::New( VIEWINGTIME );\n mViewTimer.TickSignal().Connect( this, &DissolveEffectApp::OnTimerTick );\n mTimerReady = true;\n\n \/\/ Set size to stage size to avoid seeing a black border on transition\n mParent = Actor::New();\n mParent.SetSize( Stage::GetCurrent().GetSize() );\n mParent.SetPositionInheritanceMode( USE_PARENT_POSITION );\n mContent.Add( mParent );\n\n mSizeConstraint= Constraint::New<Vector3>( Actor::SCALE, LocalSource( Actor::SIZE ), ParentSource( Actor::SIZE ), ScaleToFitKeepAspectRatioConstraint() );\n\n \/\/ show the first image\n mCurrentImage = ImageActor::New( ResourceImage::New( IMAGES[mIndex] ) );\n mCurrentImage.SetPositionInheritanceMode(USE_PARENT_POSITION_PLUS_LOCAL_POSITION);\n mCurrentImage.ApplyConstraint( mSizeConstraint );\n mParent.Add( mCurrentImage );\n\n mPanGestureDetector.Attach( mCurrentImage );\n}\n\n\/\/ signal handler, called when the pan gesture is detected\nvoid DissolveEffectApp::OnPanGesture( Actor actor, const PanGesture& gesture )\n{\n \/\/ does not response when the animation has not finished\n if( mIsTransiting || mSlideshow )\n {\n return;\n }\n\n if( gesture.state == Gesture::Continuing )\n {\n if( gesture.displacement.x < 0)\n {\n mIndex = (mIndex + 1)%NUM_IMAGES;\n }\n else\n {\n mIndex = (mIndex + NUM_IMAGES -1)%NUM_IMAGES;\n }\n\n Image image = ResourceImage::New( IMAGES[ mIndex ] );\n mNextImage = ImageActor::New( image );\n mNextImage.SetPositionInheritanceMode(USE_PARENT_POSITION_PLUS_LOCAL_POSITION);\n mNextImage.ApplyConstraint( mSizeConstraint );\n mNextImage.SetZ(INITIAL_DEPTH);\n mParent.Add( mNextImage );\n Vector2 size = Vector2( mCurrentImage.GetCurrentSize() );\n StartTransition( gesture.position \/ size, gesture.displacement * Vector2(1.0, size.x\/size.y));\n }\n}\n\nvoid DissolveEffectApp::StartTransition(Vector2 position, Vector2 displacement)\n{\n mAnimation = Animation::New(TRANSITION_DURATION);\n\n mCurrentImageEffect.SetCentralLine(position,displacement);\n mCurrentImageEffect.SetDistortion(0.0f);\n mCurrentImage.SetShaderEffect(mCurrentImageEffect);\n mAnimation.AnimateTo( Property(mCurrentImageEffect, mCurrentImageEffect.GetDistortionPropertyName()), 1.0f, AlphaFunctions::Linear );\n\n mNextImage.SetOpacity(0.0f);\n mAnimation.OpacityTo( mNextImage, 1.0, AlphaFunctions::Linear );\n\n if(mUseHighPrecision)\n {\n mNextImageEffect.SetCentralLine(position,-displacement);\n mNextImageEffect.SetDistortion(1.0f);\n mNextImage.SetShaderEffect(mNextImageEffect);\n mAnimation.AnimateTo( Property(mNextImageEffect, mNextImageEffect.GetDistortionPropertyName()), 0.0f, AlphaFunctions::Linear );\n }\n else\n {\n mAnimation.MoveTo(mNextImage, Vector3(0.0f, 0.0f, 0.0f), AlphaFunctions::Linear);\n }\n\n mAnimation.FinishedSignal().Connect( this, &DissolveEffectApp::OnTransitionCompleted );\n mAnimation.Play();\n mIsTransiting = true;\n}\n\nvoid DissolveEffectApp::OnKeyEvent(const KeyEvent& event)\n{\n if(event.state == KeyEvent::Down)\n {\n if( IsKey( event, Dali::DALI_KEY_ESCAPE) || IsKey( event, Dali::DALI_KEY_BACK) )\n {\n mApplication.Quit();\n }\n }\n}\n\nbool DissolveEffectApp::OnEffectButtonClicked( Toolkit::Button button )\n{\n mUseHighPrecision = !mUseHighPrecision;\n mCurrentImageEffect = Toolkit::DissolveEffect::New(mUseHighPrecision);\n if(mUseHighPrecision)\n {\n mTitleActor.SetText( APPLICATION_TITLE_HIGHP );\n mEffectChangeButton.SetBackgroundImage(mIconHighP);\n }\n else\n {\n mTitleActor.SetText( APPLICATION_TITLE_MEDIUMP );\n mEffectChangeButton.SetBackgroundImage(mIconMediumP);\n }\n mTitleActor.SetStyleToCurrentText(DemoHelper::GetDefaultTextStyle());\n\n return true;\n}\n\nbool DissolveEffectApp::OnSildeshowButtonClicked( Toolkit::Button button )\n{\n mSlideshow = !mSlideshow;\n if( mSlideshow )\n {\n mPlayStopButton.SetBackgroundImage( mIconStop );\n mPanGestureDetector.Detach( mParent );\n mViewTimer.Start();\n mTimerReady = false;\n }\n else\n {\n mPlayStopButton.SetBackgroundImage( mIconPlay );\n mTimerReady = true;\n mPanGestureDetector.Attach( mParent );\n }\n return true;\n}\n\nvoid DissolveEffectApp::OnTransitionCompleted( Animation& source )\n{\n mCurrentImage.RemoveShaderEffect();\n mNextImage.RemoveShaderEffect();\n mParent.Remove( mCurrentImage );\n mPanGestureDetector.Detach( mCurrentImage );\n mCurrentImage = mNextImage;\n mPanGestureDetector.Attach( mCurrentImage );\n mIsTransiting = false;\n\n if( mSlideshow)\n {\n mViewTimer.Start();\n mTimerReady = false;\n }\n}\n\nbool DissolveEffectApp::OnTimerTick()\n{\n mTimerReady = true;\n if(mSlideshow)\n {\n mIndex = (mIndex + 1)%NUM_IMAGES;\n Image image = ResourceImage::New( IMAGES[ mIndex ] );\n mNextImage = ImageActor::New( image );\n mNextImage.SetPositionInheritanceMode(USE_PARENT_POSITION_PLUS_LOCAL_POSITION);\n mNextImage.ApplyConstraint( mSizeConstraint );\n mNextImage.SetZ(INITIAL_DEPTH);\n mParent.Add( mNextImage );\n switch( mCentralLineIndex%4 )\n {\n case 0:\n {\n StartTransition(Vector2(1.0f,0.5f), Vector2(-1.0f, 0.0f));\n break;\n }\n case 1:\n {\n StartTransition(Vector2(0.5f,0.0f), Vector2(0.0f, 1.0f));\n break;\n }\n case 2:\n {\n StartTransition(Vector2(0.0f,0.5f), Vector2(1.0f, 0.0f));\n break;\n }\n default:\n {\n StartTransition(Vector2(0.5f,1.0f), Vector2(0.0f, -1.0f));\n break;\n }\n\n }\n mCentralLineIndex++;\n }\n return false; \/\/return false to stop the timer\n}\n\n\/\/ Entry point for Linux & SLP applications\nint main( int argc, char **argv )\n{\n Application application = Application::New( &argc, &argv );\n DissolveEffectApp test( application );\n application.MainLoop();\n\n return 0;\n}\n<|endoftext|>"} {"text":"<commit_before>#include \"Piezas.h\"\n#include <vector>\n\/** CLASS Piezas\n * Class for representing a Piezas vertical board, which is roughly based\n * on the game \"Connect Four\" where pieces are placed in a column and \n * fall to the bottom of the column, or on top of other pieces already in\n * that column. For an illustration of the board, see:\n * https:\/\/en.wikipedia.org\/wiki\/Connect_Four\n *\n * Board coordinates [row,col] should match with:\n * [2,0][2,1][2,2][2,3]\n * [1,0][1,1][1,2][1,3]\n * [0,0][0,1][0,2][0,3]\n * So that a piece dropped in column 2 should take [0,2] and the next one\n * dropped in column 2 should take [1,2].\n**\/\n\n\n\/**\n * Constructor sets an empty board (default 3 rows, 4 columns) and \n * specifies it is X's turn first\n**\/\nPiezas::Piezas();\n{\n for (int i = 0; i < BOARD_ROWS; i++)\n {\n for (int j = 0; j < BOARD_COLS; j++)\n {\n board[i][j] = Blank;\n }\n }\n turn = X;\n}\n\n\/**\n * Resets each board location to the Blank Piece value, with a board of the\n * same size as previously specified\n**\/\nvoid Piezas::reset();\n{\n for (int i = 0; i < BOARD_ROWS; i++)\n {\n for (int j = 0; j < BOARD_COLS; j++)\n {\n board[i][j] = Blank;\n }\n }\n}\n\n\/**\n * Places a piece of the current turn on the board, returns what\n * piece is placed, and toggles which Piece's turn it is. dropPiece does \n * NOT allow to place a piece in a location where a column is full.\n * In that case, placePiece returns Piece Blank value \n * Out of bounds coordinates return the Piece Invalid value\n * Trying to drop a piece where it cannot be placed loses the player's turn\n**\/ \nPiece Piezas::dropPiece(int column);\n{\n if (column >= BOARD_COLS || column < 0)\n {\n if (turn == X)\n {\n turn = O;\n }\n else\n {\n turn = X;\n }\n return Invalid;\n }\n if (board[2][column] != Blank)\n {\n if (turn == X)\n {\n turn = O;\n }\n else\n {\n turn = X;\n }\n return Blank;\n }\n for (int i = 0; i < BOARD_ROWS; i++)\n {\n if (board[i][column] == Blank)\n {\n board[i][column] = turn;\n break;\n }\n }\n if (turn == X)\n {\n turn = O;\n return X;\n }\n else\n {\n turn = X;\n return O;\n }\n}\n\n\/**\n * Returns what piece is at the provided coordinates, or Blank if there\n * are no pieces there, or Invalid if the coordinates are out of bounds\n**\/\nPiece Piezas::pieceAt(int row, int column);\n{\n if (row >= BOARD_ROWS || row < 0 || column >= BOARD_COLS || column < 0)\n {\n return Invalid;\n }\n return board[row][column];\n}\n\n\/**\n * Returns which Piece has won, if there is a winner, Invalid if the game\n * is not over, or Blank if the board is filled and no one has won (\"tie\").\n * For a game to be over, all locations on the board must be filled with X's \n * and O's (i.e. no remaining Blank spaces). The winner is which player has\n * the most adjacent pieces in a single line. Lines can go either vertically\n * or horizontally. If both X's and O's have the same max number of pieces in a\n * line, it is a tie.\n**\/\nPiece Piezas::gameState();\n{\n \n}\n<commit_msg>Piezas v1, all functions programmed<commit_after>#include \"Piezas.h\"\n#include <vector>\n\/** CLASS Piezas\n * Class for representing a Piezas vertical board, which is roughly based\n * on the game \"Connect Four\" where pieces are placed in a column and \n * fall to the bottom of the column, or on top of other pieces already in\n * that column. For an illustration of the board, see:\n * https:\/\/en.wikipedia.org\/wiki\/Connect_Four\n *\n * Board coordinates [row,col] should match with:\n * [2,0][2,1][2,2][2,3]\n * [1,0][1,1][1,2][1,3]\n * [0,0][0,1][0,2][0,3]\n * So that a piece dropped in column 2 should take [0,2] and the next one\n * dropped in column 2 should take [1,2].\n**\/\n\n\n\/**\n * Constructor sets an empty board (default 3 rows, 4 columns) and \n * specifies it is X's turn first\n**\/\nPiezas::Piezas();\n{\n for (int i = 0; i < BOARD_ROWS; i++)\n {\n for (int j = 0; j < BOARD_COLS; j++)\n {\n board[i][j] = Blank;\n }\n }\n turn = X;\n}\n\n\/**\n * Resets each board location to the Blank Piece value, with a board of the\n * same size as previously specified\n**\/\nvoid Piezas::reset();\n{\n for (int i = 0; i < BOARD_ROWS; i++)\n {\n for (int j = 0; j < BOARD_COLS; j++)\n {\n board[i][j] = Blank;\n }\n }\n}\n\n\/**\n * Places a piece of the current turn on the board, returns what\n * piece is placed, and toggles which Piece's turn it is. dropPiece does \n * NOT allow to place a piece in a location where a column is full.\n * In that case, placePiece returns Piece Blank value \n * Out of bounds coordinates return the Piece Invalid value\n * Trying to drop a piece where it cannot be placed loses the player's turn\n**\/ \nPiece Piezas::dropPiece(int column);\n{\n if (column >= BOARD_COLS || column < 0)\n {\n if (turn == X)\n {\n turn = O;\n }\n else\n {\n turn = X;\n }\n return Invalid;\n }\n if (board[2][column] != Blank)\n {\n if (turn == X)\n {\n turn = O;\n }\n else\n {\n turn = X;\n }\n return Blank;\n }\n for (int i = 0; i < BOARD_ROWS; i++)\n {\n if (board[i][column] == Blank)\n {\n board[i][column] = turn;\n break;\n }\n }\n if (turn == X)\n {\n turn = O;\n return X;\n }\n else\n {\n turn = X;\n return O;\n }\n}\n\n\/**\n * Returns what piece is at the provided coordinates, or Blank if there\n * are no pieces there, or Invalid if the coordinates are out of bounds\n**\/\nPiece Piezas::pieceAt(int row, int column);\n{\n if (row >= BOARD_ROWS || row < 0 || column >= BOARD_COLS || column < 0)\n {\n return Invalid;\n }\n return board[row][column];\n}\n\n\/**\n * Returns which Piece has won, if there is a winner, Invalid if the game\n * is not over, or Blank if the board is filled and no one has won (\"tie\").\n * For a game to be over, all locations on the board must be filled with X's \n * and O's (i.e. no remaining Blank spaces). The winner is which player has\n * the most adjacent pieces in a single line. Lines can go either vertically\n * or horizontally. If both X's and O's have the same max number of pieces in a\n * line, it is a tie.\n**\/\nPiece Piezas::gameState();\n{\n for (int i = 0; i < BOARD_COLS; i++)\n {\n if (board[2][i] == Blank)\n return Invalid;\n }\n int xs = 0;\n int os = 0;\n piece prev = Invalid;\n int inarow = 0;\n for (int i = 0; i < BOARD_ROWS; i++)\n {\n for (int j = 0; j < BOARD_COLS; j++)\n {\n if (board[i][j] == prev)\n {\n inarow++;\n if (board[i][j] == X && xs < inarow)\n {\n xs = inarow;\n }\n if (board[i][j] == O && os < inarow)\n {\n os = inarow;\n }\n }\n else\n {\n prev = board[i][j];\n inarow = 0;\n }\n }\n prev = Invalid;\n inarow = 0;\n }\n for (int i = 0; i < BOARD_COLS; i++)\n {\n for (int j = 0; j < BOARD_ROWS; j++)\n {\n if (board[j][i] == prev)\n {\n inarow++;\n if (board[j][i] == X && xs < inarow)\n {\n xs = inarow;\n }\n if (board[j][i] == O && os < inarow)\n {\n os = inarow;\n }\n }\n else\n {\n prev = board[j][i];\n inarow = 0;\n }\n }\n prev = Invalid;\n inarow = 0;\n }\n if (xs == os)\n {\n return Blank;\n }\n if (xs > os)\n {\n return X;\n }\n if (os > xs)\n {\n return O;\n }\n}\n<|endoftext|>"} {"text":"<commit_before> #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){\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\nvoid waitForFileEvents()\n{\n \/\/ on osx there is a latency between 0.2 and 0.5s for file events...\n#ifdef __APPLE__\n\tsleep(1);\n#endif\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\tSleep(100);\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 \/\/ 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 \/\/ 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(0) ;\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 \/\/ 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 FileMonitor::addFile(getPath(\"existing.txt\"), &listener) ;\n waitForFileEvents();\n FileMonitor::updates(0) ;\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 FileMonitor::addFile(getPath(\"existing.txt\"), &listener) ;\n\twaitForFileEvents();\n\tFileMonitor::updates(0) ;\n\n \/\/ change the file content..\n createAFilledFile(getPath(\"existing.txt\"), 10) ;\n waitForFileEvents();\n FileMonitor::updates(0) ;\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 FileMonitor::addFile(getPath(\"existing.txt\"), &listener) ;\n FileMonitor::updates(0) ;\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) ;\n createAFilledFile(getPath(\"existing.txt\"), 200) ;\n\n waitForFileEvents();\n FileMonitor::updates(0) ;\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 FileMonitor::addFile(getPath(\"existing.txt\"), &listener1) ;\n FileMonitor::addFile(getPath(\"existing.txt\"), &listener2) ;\n FileMonitor::updates(0) ;\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) ;\n\n FileMonitor::removeFileListener(getPath(\"existing.txt\"), &listener1) ;\n\n waitForFileEvents();\n FileMonitor::updates(0) ;\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 FileMonitor::addFile(getPath(\"existing.txt\"), &listener1) ;\n FileMonitor::addFile(getPath(\"existing.txt\"), &listener2) ;\n FileMonitor::updates(0) ;\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) ;\n\n FileMonitor::removeListener(&listener1) ;\n\n waitForFileEvents();\n FileMonitor::updates(0) ;\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 FileMonitor::addFile(getPath(\"\"),\"existing.txt\", &listener) ;\n waitForFileEvents();\n FileMonitor::updates(0) ;\n\n \/\/ change the file content..\n createAFilledFile(getPath(\"existing.txt\"), 10) ;\n\n waitForFileEvents();\n FileMonitor::updates(0) ;\n EXPECT_EQ( listener.m_files.size(), 1u) ;\n\n FileMonitor::removeListener(&listener) ;\n}\n<commit_msg>FileMonitor_test update: no more wait on Mac, and use of timeouts in tests.<commit_after> #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){\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\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\tSleep(100);\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 \/\/ 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 \/\/ 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 \/\/ 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 FileMonitor::addFile(getPath(\"existing.txt\"), &listener) ;\n waitForFileEvents();\n FileMonitor::updates(2) ;\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 FileMonitor::addFile(getPath(\"existing.txt\"), &listener) ;\n \/\/waitForFileEvents();\n \/\/FileMonitor::updates(2) ;\n\n \/\/ change the file content..\n createAFilledFile(getPath(\"existing.txt\"), 10) ;\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 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) ;\n createAFilledFile(getPath(\"existing.txt\"), 200) ;\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 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) ;\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 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) ;\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 FileMonitor::addFile(getPath(\"\"),\"existing.txt\", &listener) ;\n \/\/waitForFileEvents();\n \/\/FileMonitor::updates(2) ;\n\n \/\/ change the file content..\n createAFilledFile(getPath(\"existing.txt\"), 10) ;\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 2016-2019 Chris Conway (Koderz). All Rights Reserved.\n\n\n#include \"RuntimeMeshStaticMeshConverter.h\"\n\n\n#include \"EngineGlobals.h\"\n#include \"Engine\/StaticMesh.h\"\n#include \"PhysicsEngine\/BodySetup.h\"\n\n\nint32 URuntimeMeshStaticMeshConverter::CopyVertexOrGetIndex(const FStaticMeshLODResources& LOD, const FStaticMeshSection& Section, TMap<int32, int32>& MeshToSectionVertexMap, int32 VertexIndex, FRuntimeMeshRenderableMeshData& NewMeshData)\n{\n\tint32* FoundIndex = MeshToSectionVertexMap.Find(VertexIndex);\n\tif (FoundIndex != nullptr)\n\t{\n\t\treturn *FoundIndex;\n\t}\n\telse\n\t{\n\t\t\/\/ Copy Position\n\t\tint32 NewVertexIndex = NewMeshData.Positions.Add(LOD.VertexBuffers.PositionVertexBuffer.VertexPosition(VertexIndex));\n\n\t\t\/\/ Copy Tangents\n\t\tNewMeshData.Tangents.Add(\n\t\t\tLOD.VertexBuffers.StaticMeshVertexBuffer.VertexTangentX(VertexIndex),\n\t\t\tLOD.VertexBuffers.StaticMeshVertexBuffer.VertexTangentY(VertexIndex),\n\t\t\tLOD.VertexBuffers.StaticMeshVertexBuffer.VertexTangentZ(VertexIndex));\n\n\t\t\/\/ Copy UV's\n\t\tfor (uint32 UVIndex = 0; UVIndex < LOD.VertexBuffers.StaticMeshVertexBuffer.GetNumTexCoords(); UVIndex++)\n\t\t{\n\t\t\tNewMeshData.TexCoords.Add(LOD.VertexBuffers.StaticMeshVertexBuffer.GetVertexUV(VertexIndex, UVIndex), UVIndex);\n\t\t}\n\n\t\t\/\/ Copy Color\n\t\tif (LOD.bHasColorVertexData)\n\t\t{\n\t\t\tNewMeshData.Colors.Add(LOD.VertexBuffers.ColorVertexBuffer.VertexColor(VertexIndex));\n\t\t}\n\n\t\tMeshToSectionVertexMap.Add(VertexIndex, NewVertexIndex);\n\t\treturn NewVertexIndex;\n\t}\n}\n\nint32 URuntimeMeshStaticMeshConverter::CopyVertexOrGetIndex(const FStaticMeshLODResources& LOD, const FStaticMeshSection& Section, TMap<int32, int32>& MeshToSectionVertexMap, int32 VertexIndex, int32 NumUVChannels, FRuntimeMeshCollisionData& NewMeshData)\n{\n\tint32* FoundIndex = MeshToSectionVertexMap.Find(VertexIndex);\n\tif (FoundIndex != nullptr)\n\t{\n\t\treturn *FoundIndex;\n\t}\n\telse\n\t{\n\t\t\/\/ Copy Position\n\t\tint32 NewVertexIndex = NewMeshData.Vertices.Add(LOD.VertexBuffers.PositionVertexBuffer.VertexPosition(VertexIndex));\n\t\t\n\t\t\/\/ Copy UV's\n\t\tfor (int32 UVIndex = 0; UVIndex < NumUVChannels; UVIndex++)\n\t\t{\n\t\t\tNewMeshData.TexCoords.Add(UVIndex, LOD.VertexBuffers.StaticMeshVertexBuffer.GetVertexUV(VertexIndex, UVIndex));\n\t\t}\n\t\t\n\t\tMeshToSectionVertexMap.Add(VertexIndex, NewVertexIndex);\n\t\treturn NewVertexIndex;\n\t}\n}\n\nbool URuntimeMeshStaticMeshConverter::CopyStaticMeshSectionToRenderableMeshData(UStaticMesh* StaticMesh, int32 LODIndex, int32 SectionId, FRuntimeMeshRenderableMeshData& OutMeshData)\n{\n\t\/\/ Check valid static mesh\n\tif (StaticMesh == nullptr || StaticMesh->IsPendingKill())\n\t{\n\t\treturn false;\n\t}\n\n\t\/\/ Check mesh data is accessible\n\tif (!((GIsEditor || StaticMesh->bAllowCPUAccess) && StaticMesh->RenderData != nullptr))\n\t{\n\t\treturn false;\n\t}\n\n\t\/\/ Check valid LOD\n\tif (!StaticMesh->RenderData->LODResources.IsValidIndex(LODIndex))\n\t{\n\t\treturn false;\n\t}\n\n\tconst FStaticMeshLODResources& LOD = StaticMesh->RenderData->LODResources[LODIndex];\n\n\t\/\/ Check valid section\n\tif (!LOD.Sections.IsValidIndex(SectionId))\n\t{\n\t\treturn false;\n\t}\n\n\tOutMeshData = FRuntimeMeshRenderableMeshData(\n\t\tLOD.VertexBuffers.StaticMeshVertexBuffer.GetUseHighPrecisionTangentBasis(),\n\t\tLOD.VertexBuffers.StaticMeshVertexBuffer.GetUseFullPrecisionUVs(),\n\t\tLOD.VertexBuffers.StaticMeshVertexBuffer.GetNumTexCoords(),\n\t\tLOD.IndexBuffer.Is32Bit());\n\t\n\t\/\/ Map from vert buffer for whole mesh to vert buffer for section of interest\n\tTMap<int32, int32> MeshToSectionVertMap;\n\n\tconst FStaticMeshSection& Section = LOD.Sections[SectionId];\n\tconst uint32 OnePastLastIndex = Section.FirstIndex + Section.NumTriangles * 3;\n\tFIndexArrayView Indices = LOD.IndexBuffer.GetArrayView();\n\t\n\t\/\/ Iterate over section index buffer, copying verts as needed\n\tfor (uint32 i = Section.FirstIndex; i < OnePastLastIndex; i++)\n\t{\n\t\tuint32 MeshVertIndex = Indices[i];\n\n\t\t\/\/ See if we have this vert already in our section vert buffer, and copy vert in if not \n\t\tint32 SectionVertIndex = CopyVertexOrGetIndex(LOD, Section, MeshToSectionVertMap, MeshVertIndex, OutMeshData);\n\n\t\t\/\/ Add to index buffer\n\t\tOutMeshData.Triangles.Add(SectionVertIndex);\n\t}\n\n\t\/\/ Lets copy the adjacency information too for tessellation \n\t\/\/ At this point all vertices should be copied so it should work to just copy\/convert the indices.\n\tif (LOD.bHasAdjacencyInfo && LOD.AdditionalIndexBuffers->AdjacencyIndexBuffer.GetNumIndices() > 0)\n\t{\n\t\tFIndexArrayView AdjacencyIndices = LOD.AdditionalIndexBuffers->AdjacencyIndexBuffer.GetArrayView();\n\n\t\t\/\/ We multiply these by 4 as the adjacency data is 12 indices per triangle instead of the normal 3\n\t\tuint32 StartIndex = Section.FirstIndex * 4;\n\t\tuint32 NumIndices = Section.NumTriangles * 3 * 4;\n\n\t\tfor (uint32 Index = 0; Index < NumIndices; Index++)\n\t\t{\n\t\t\tOutMeshData.AdjacencyTriangles.Add(MeshToSectionVertMap[AdjacencyIndices[Index]]);\n\t\t}\n\t}\n\n\treturn true;\n}\n\nbool URuntimeMeshStaticMeshConverter::CopyStaticMeshCollisionToCollisionSettings(UStaticMesh* StaticMesh, FRuntimeMeshCollisionSettings& OutCollisionSettings)\n{\n\t\/\/ Check valid static mesh\n\tif (StaticMesh == nullptr || StaticMesh->IsPendingKill())\n\t{\n\t\treturn false;\n\t}\n\n\t\/\/ Check mesh data is accessible\n\tif (!((GIsEditor || StaticMesh->bAllowCPUAccess) && StaticMesh->RenderData != nullptr))\n\t{\n\t\treturn false;\n\t}\n\n\t\/\/ Do we have a body setup to copy?\n\tif (StaticMesh->BodySetup == nullptr)\n\t{\n\t\treturn false;\n\t}\n\n\t\/\/ Copy convex elements\n\tconst auto& SourceConvexElems = StaticMesh->BodySetup->AggGeom.ConvexElems;\n\tfor (int32 ConvexIndex = 0; ConvexIndex < SourceConvexElems.Num(); ConvexIndex++)\n\t{\n\t\tOutCollisionSettings.ConvexElements.Emplace(\n\t\t\tSourceConvexElems[ConvexIndex].VertexData, \n\t\t\tSourceConvexElems[ConvexIndex].ElemBox);\n\t}\n\n\t\/\/ Copy boxes\n\tconst auto& SourceBoxes = StaticMesh->BodySetup->AggGeom.BoxElems;\n\tfor (int32 BoxIndex = 0; BoxIndex < SourceBoxes.Num(); BoxIndex++)\n\t{\n\t\tOutCollisionSettings.Boxes.Emplace(\n\t\t\tSourceBoxes[BoxIndex].Center,\n\t\t\tSourceBoxes[BoxIndex].Rotation,\n\t\t\tSourceBoxes[BoxIndex].X,\n\t\t\tSourceBoxes[BoxIndex].Y,\n\t\t\tSourceBoxes[BoxIndex].Z);\n\t}\n\n\t\/\/ Copy spheres\n\tconst auto& SourceSpheres = StaticMesh->BodySetup->AggGeom.SphereElems;\n\tfor (int32 SphereIndex = 0; SphereIndex < SourceSpheres.Num(); SphereIndex++)\n\t{\n\t\tOutCollisionSettings.Spheres.Emplace(\n\t\t\tSourceSpheres[SphereIndex].Center, \n\t\t\tSourceSpheres[SphereIndex].Radius);\n\t}\n\n\t\/\/ Copy capsules\n\tconst auto& SourceCapsules = StaticMesh->BodySetup->AggGeom.SphylElems;\n\tfor (int32 CapsuleIndex = 0; CapsuleIndex < SourceCapsules.Num(); CapsuleIndex++)\n\t{\n\t\tOutCollisionSettings.Capsules.Emplace(\n\t\t\tSourceCapsules[CapsuleIndex].Center,\n\t\t\tSourceCapsules[CapsuleIndex].Rotation,\n\t\t\tSourceCapsules[CapsuleIndex].Radius,\n\t\t\tSourceCapsules[CapsuleIndex].Length);\n\t}\n\n\treturn true;\n}\n\nbool URuntimeMeshStaticMeshConverter::CopyStaticMeshLODToCollisionData(UStaticMesh* StaticMesh, int32 LODIndex, FRuntimeMeshCollisionData& OutCollisionData)\n{\n\t\/\/ Check valid static mesh\n\tif (StaticMesh == nullptr || StaticMesh->IsPendingKill())\n\t{\n\t\treturn false;\n\t}\n\n\t\/\/ Check mesh data is accessible\n\tif (!((GIsEditor || StaticMesh->bAllowCPUAccess) && StaticMesh->RenderData != nullptr))\n\t{\n\t\treturn false;\n\t}\n\n\t\/\/ Check valid LOD\n\tif (!StaticMesh->RenderData->LODResources.IsValidIndex(LODIndex))\n\t{\n\t\treturn false;\n\t}\n\n\tconst FStaticMeshLODResources& LOD = StaticMesh->RenderData->LODResources[LODIndex];\n\n\tuint32 NumUVChannels = LOD.VertexBuffers.StaticMeshVertexBuffer.GetNumTexCoords();\n\t\n\tOutCollisionData.Vertices.Empty();\n\tOutCollisionData.TexCoords.Empty();\n\tOutCollisionData.MaterialIndices.Empty();\n\tOutCollisionData.Triangles.Empty();\n\tOutCollisionData.TexCoords.SetNumChannels(NumUVChannels);\n\n\t\/\/ Map from vert buffer for whole mesh to vert buffer for section of interest\n\tTMap<int32, int32> MeshToSectionVertMap;\n\n\tint32 TempIndices[3] = { 0, 0, 0 };\n\n\tint32 SectionId = 0;\n\tfor (const FStaticMeshSection& Section : LOD.Sections)\n\t{\n\t\tconst uint32 OnePastLastIndex = Section.FirstIndex + Section.NumTriangles;\n\t\tFIndexArrayView Indices = LOD.IndexBuffer.GetArrayView();\n\t\t\n\t\tint32 StartTriangle = OutCollisionData.Triangles.Num();\n\n\t\t\/\/ Iterate over section index buffer, copying verts as needed\n\t\tfor (uint32 TriIndex = Section.FirstIndex; TriIndex < OnePastLastIndex; TriIndex++)\n\t\t{\n\t\t\tfor (int32 Index = 0; Index < 3; Index++)\n\t\t\t{\n\t\t\t\tuint32 MeshVertIndex = Indices[TriIndex * 3 + Index];\n\n\t\t\t\t\/\/ See if we have this vert already in our section vert buffer, and copy vert in if not \n\t\t\t\tint32 SectionVertIndex = CopyVertexOrGetIndex(LOD, Section, MeshToSectionVertMap, MeshVertIndex, NumUVChannels, OutCollisionData);\n\n\t\t\t\tTempIndices[Index] = MeshVertIndex;\n\t\t\t}\n\n\t\t\t\/\/ Add to index buffer\n\t\t\tOutCollisionData.Triangles.Add(TempIndices[0], TempIndices[1], TempIndices[2]);\n\t\t\tOutCollisionData.MaterialIndices.Add(Section.MaterialIndex);\n\t\t}\n\n\t\t\/\/ Add the collision section\n\t\tOutCollisionData.CollisionSources.Emplace(StartTriangle, OutCollisionData.Triangles.Num() - 1, nullptr, SectionId, ERuntimeMeshCollisionFaceSourceType::Renderable);\n\n\t\tSectionId++;\n\t}\n\n\treturn true;\n}\n\n\n\n<commit_msg>Fix `AdjacencyTriangles` bug<commit_after>\/\/ Copyright 2016-2019 Chris Conway (Koderz). All Rights Reserved.\n\n\n#include \"RuntimeMeshStaticMeshConverter.h\"\n\n\n#include \"EngineGlobals.h\"\n#include \"Engine\/StaticMesh.h\"\n#include \"PhysicsEngine\/BodySetup.h\"\n\n\nint32 URuntimeMeshStaticMeshConverter::CopyVertexOrGetIndex(const FStaticMeshLODResources& LOD, const FStaticMeshSection& Section, TMap<int32, int32>& MeshToSectionVertexMap, int32 VertexIndex, FRuntimeMeshRenderableMeshData& NewMeshData)\n{\n\tint32* FoundIndex = MeshToSectionVertexMap.Find(VertexIndex);\n\tif (FoundIndex != nullptr)\n\t{\n\t\treturn *FoundIndex;\n\t}\n\telse\n\t{\n\t\t\/\/ Copy Position\n\t\tint32 NewVertexIndex = NewMeshData.Positions.Add(LOD.VertexBuffers.PositionVertexBuffer.VertexPosition(VertexIndex));\n\n\t\t\/\/ Copy Tangents\n\t\tNewMeshData.Tangents.Add(\n\t\t\tLOD.VertexBuffers.StaticMeshVertexBuffer.VertexTangentX(VertexIndex),\n\t\t\tLOD.VertexBuffers.StaticMeshVertexBuffer.VertexTangentY(VertexIndex),\n\t\t\tLOD.VertexBuffers.StaticMeshVertexBuffer.VertexTangentZ(VertexIndex));\n\n\t\t\/\/ Copy UV's\n\t\tfor (uint32 UVIndex = 0; UVIndex < LOD.VertexBuffers.StaticMeshVertexBuffer.GetNumTexCoords(); UVIndex++)\n\t\t{\n\t\t\tNewMeshData.TexCoords.Add(LOD.VertexBuffers.StaticMeshVertexBuffer.GetVertexUV(VertexIndex, UVIndex), UVIndex);\n\t\t}\n\n\t\t\/\/ Copy Color\n\t\tif (LOD.bHasColorVertexData)\n\t\t{\n\t\t\tNewMeshData.Colors.Add(LOD.VertexBuffers.ColorVertexBuffer.VertexColor(VertexIndex));\n\t\t}\n\n\t\tMeshToSectionVertexMap.Add(VertexIndex, NewVertexIndex);\n\t\treturn NewVertexIndex;\n\t}\n}\n\nint32 URuntimeMeshStaticMeshConverter::CopyVertexOrGetIndex(const FStaticMeshLODResources& LOD, const FStaticMeshSection& Section, TMap<int32, int32>& MeshToSectionVertexMap, int32 VertexIndex, int32 NumUVChannels, FRuntimeMeshCollisionData& NewMeshData)\n{\n\tint32* FoundIndex = MeshToSectionVertexMap.Find(VertexIndex);\n\tif (FoundIndex != nullptr)\n\t{\n\t\treturn *FoundIndex;\n\t}\n\telse\n\t{\n\t\t\/\/ Copy Position\n\t\tint32 NewVertexIndex = NewMeshData.Vertices.Add(LOD.VertexBuffers.PositionVertexBuffer.VertexPosition(VertexIndex));\n\t\t\n\t\t\/\/ Copy UV's\n\t\tfor (int32 UVIndex = 0; UVIndex < NumUVChannels; UVIndex++)\n\t\t{\n\t\t\tNewMeshData.TexCoords.Add(UVIndex, LOD.VertexBuffers.StaticMeshVertexBuffer.GetVertexUV(VertexIndex, UVIndex));\n\t\t}\n\t\t\n\t\tMeshToSectionVertexMap.Add(VertexIndex, NewVertexIndex);\n\t\treturn NewVertexIndex;\n\t}\n}\n\nbool URuntimeMeshStaticMeshConverter::CopyStaticMeshSectionToRenderableMeshData(UStaticMesh* StaticMesh, int32 LODIndex, int32 SectionId, FRuntimeMeshRenderableMeshData& OutMeshData)\n{\n\t\/\/ Check valid static mesh\n\tif (StaticMesh == nullptr || StaticMesh->IsPendingKill())\n\t{\n\t\treturn false;\n\t}\n\n\t\/\/ Check mesh data is accessible\n\tif (!((GIsEditor || StaticMesh->bAllowCPUAccess) && StaticMesh->RenderData != nullptr))\n\t{\n\t\treturn false;\n\t}\n\n\t\/\/ Check valid LOD\n\tif (!StaticMesh->RenderData->LODResources.IsValidIndex(LODIndex))\n\t{\n\t\treturn false;\n\t}\n\n\tconst FStaticMeshLODResources& LOD = StaticMesh->RenderData->LODResources[LODIndex];\n\n\t\/\/ Check valid section\n\tif (!LOD.Sections.IsValidIndex(SectionId))\n\t{\n\t\treturn false;\n\t}\n\n\tOutMeshData = FRuntimeMeshRenderableMeshData(\n\t\tLOD.VertexBuffers.StaticMeshVertexBuffer.GetUseHighPrecisionTangentBasis(),\n\t\tLOD.VertexBuffers.StaticMeshVertexBuffer.GetUseFullPrecisionUVs(),\n\t\tLOD.VertexBuffers.StaticMeshVertexBuffer.GetNumTexCoords(),\n\t\tLOD.IndexBuffer.Is32Bit());\n\t\n\t\/\/ Map from vert buffer for whole mesh to vert buffer for section of interest\n\tTMap<int32, int32> MeshToSectionVertMap;\n\n\tconst FStaticMeshSection& Section = LOD.Sections[SectionId];\n\tconst uint32 OnePastLastIndex = Section.FirstIndex + Section.NumTriangles * 3;\n\tFIndexArrayView Indices = LOD.IndexBuffer.GetArrayView();\n\t\n\t\/\/ Iterate over section index buffer, copying verts as needed\n\tfor (uint32 i = Section.FirstIndex; i < OnePastLastIndex; i++)\n\t{\n\t\tuint32 MeshVertIndex = Indices[i];\n\n\t\t\/\/ See if we have this vert already in our section vert buffer, and copy vert in if not \n\t\tint32 SectionVertIndex = CopyVertexOrGetIndex(LOD, Section, MeshToSectionVertMap, MeshVertIndex, OutMeshData);\n\n\t\t\/\/ Add to index buffer\n\t\tOutMeshData.Triangles.Add(SectionVertIndex);\n\t}\n\n\t\/\/ Lets copy the adjacency information too for tessellation \n\t\/\/ At this point all vertices should be copied so it should work to just copy\/convert the indices.\n\tif (LOD.bHasAdjacencyInfo && LOD.AdditionalIndexBuffers->AdjacencyIndexBuffer.GetNumIndices() > 0)\n\t{\n\t\tFIndexArrayView AdjacencyIndices = LOD.AdditionalIndexBuffers->AdjacencyIndexBuffer.GetArrayView();\n\n\t\t\/\/ We multiply these by 4 as the adjacency data is 12 indices per triangle instead of the normal 3\n\t\tuint32 StartIndex = Section.FirstIndex * 4;\n\t\tuint32 NumIndices = Section.NumTriangles * 3 * 4;\n\n\t\tfor (uint32 Index = 0; Index < NumIndices; Index++)\n\t\t{\n\t\t\tOutMeshData.AdjacencyTriangles.Add(MeshToSectionVertMap[AdjacencyIndices[StartIndex + Index]]);\n\t\t}\n\t}\n\n\treturn true;\n}\n\nbool URuntimeMeshStaticMeshConverter::CopyStaticMeshCollisionToCollisionSettings(UStaticMesh* StaticMesh, FRuntimeMeshCollisionSettings& OutCollisionSettings)\n{\n\t\/\/ Check valid static mesh\n\tif (StaticMesh == nullptr || StaticMesh->IsPendingKill())\n\t{\n\t\treturn false;\n\t}\n\n\t\/\/ Check mesh data is accessible\n\tif (!((GIsEditor || StaticMesh->bAllowCPUAccess) && StaticMesh->RenderData != nullptr))\n\t{\n\t\treturn false;\n\t}\n\n\t\/\/ Do we have a body setup to copy?\n\tif (StaticMesh->BodySetup == nullptr)\n\t{\n\t\treturn false;\n\t}\n\n\t\/\/ Copy convex elements\n\tconst auto& SourceConvexElems = StaticMesh->BodySetup->AggGeom.ConvexElems;\n\tfor (int32 ConvexIndex = 0; ConvexIndex < SourceConvexElems.Num(); ConvexIndex++)\n\t{\n\t\tOutCollisionSettings.ConvexElements.Emplace(\n\t\t\tSourceConvexElems[ConvexIndex].VertexData, \n\t\t\tSourceConvexElems[ConvexIndex].ElemBox);\n\t}\n\n\t\/\/ Copy boxes\n\tconst auto& SourceBoxes = StaticMesh->BodySetup->AggGeom.BoxElems;\n\tfor (int32 BoxIndex = 0; BoxIndex < SourceBoxes.Num(); BoxIndex++)\n\t{\n\t\tOutCollisionSettings.Boxes.Emplace(\n\t\t\tSourceBoxes[BoxIndex].Center,\n\t\t\tSourceBoxes[BoxIndex].Rotation,\n\t\t\tSourceBoxes[BoxIndex].X,\n\t\t\tSourceBoxes[BoxIndex].Y,\n\t\t\tSourceBoxes[BoxIndex].Z);\n\t}\n\n\t\/\/ Copy spheres\n\tconst auto& SourceSpheres = StaticMesh->BodySetup->AggGeom.SphereElems;\n\tfor (int32 SphereIndex = 0; SphereIndex < SourceSpheres.Num(); SphereIndex++)\n\t{\n\t\tOutCollisionSettings.Spheres.Emplace(\n\t\t\tSourceSpheres[SphereIndex].Center, \n\t\t\tSourceSpheres[SphereIndex].Radius);\n\t}\n\n\t\/\/ Copy capsules\n\tconst auto& SourceCapsules = StaticMesh->BodySetup->AggGeom.SphylElems;\n\tfor (int32 CapsuleIndex = 0; CapsuleIndex < SourceCapsules.Num(); CapsuleIndex++)\n\t{\n\t\tOutCollisionSettings.Capsules.Emplace(\n\t\t\tSourceCapsules[CapsuleIndex].Center,\n\t\t\tSourceCapsules[CapsuleIndex].Rotation,\n\t\t\tSourceCapsules[CapsuleIndex].Radius,\n\t\t\tSourceCapsules[CapsuleIndex].Length);\n\t}\n\n\treturn true;\n}\n\nbool URuntimeMeshStaticMeshConverter::CopyStaticMeshLODToCollisionData(UStaticMesh* StaticMesh, int32 LODIndex, FRuntimeMeshCollisionData& OutCollisionData)\n{\n\t\/\/ Check valid static mesh\n\tif (StaticMesh == nullptr || StaticMesh->IsPendingKill())\n\t{\n\t\treturn false;\n\t}\n\n\t\/\/ Check mesh data is accessible\n\tif (!((GIsEditor || StaticMesh->bAllowCPUAccess) && StaticMesh->RenderData != nullptr))\n\t{\n\t\treturn false;\n\t}\n\n\t\/\/ Check valid LOD\n\tif (!StaticMesh->RenderData->LODResources.IsValidIndex(LODIndex))\n\t{\n\t\treturn false;\n\t}\n\n\tconst FStaticMeshLODResources& LOD = StaticMesh->RenderData->LODResources[LODIndex];\n\n\tuint32 NumUVChannels = LOD.VertexBuffers.StaticMeshVertexBuffer.GetNumTexCoords();\n\t\n\tOutCollisionData.Vertices.Empty();\n\tOutCollisionData.TexCoords.Empty();\n\tOutCollisionData.MaterialIndices.Empty();\n\tOutCollisionData.Triangles.Empty();\n\tOutCollisionData.TexCoords.SetNumChannels(NumUVChannels);\n\n\t\/\/ Map from vert buffer for whole mesh to vert buffer for section of interest\n\tTMap<int32, int32> MeshToSectionVertMap;\n\n\tint32 TempIndices[3] = { 0, 0, 0 };\n\n\tint32 SectionId = 0;\n\tfor (const FStaticMeshSection& Section : LOD.Sections)\n\t{\n\t\tconst uint32 OnePastLastIndex = Section.FirstIndex + Section.NumTriangles;\n\t\tFIndexArrayView Indices = LOD.IndexBuffer.GetArrayView();\n\t\t\n\t\tint32 StartTriangle = OutCollisionData.Triangles.Num();\n\n\t\t\/\/ Iterate over section index buffer, copying verts as needed\n\t\tfor (uint32 TriIndex = Section.FirstIndex; TriIndex < OnePastLastIndex; TriIndex++)\n\t\t{\n\t\t\tfor (int32 Index = 0; Index < 3; Index++)\n\t\t\t{\n\t\t\t\tuint32 MeshVertIndex = Indices[TriIndex * 3 + Index];\n\n\t\t\t\t\/\/ See if we have this vert already in our section vert buffer, and copy vert in if not \n\t\t\t\tint32 SectionVertIndex = CopyVertexOrGetIndex(LOD, Section, MeshToSectionVertMap, MeshVertIndex, NumUVChannels, OutCollisionData);\n\n\t\t\t\tTempIndices[Index] = MeshVertIndex;\n\t\t\t}\n\n\t\t\t\/\/ Add to index buffer\n\t\t\tOutCollisionData.Triangles.Add(TempIndices[0], TempIndices[1], TempIndices[2]);\n\t\t\tOutCollisionData.MaterialIndices.Add(Section.MaterialIndex);\n\t\t}\n\n\t\t\/\/ Add the collision section\n\t\tOutCollisionData.CollisionSources.Emplace(StartTriangle, OutCollisionData.Triangles.Num() - 1, nullptr, SectionId, ERuntimeMeshCollisionFaceSourceType::Renderable);\n\n\t\tSectionId++;\n\t}\n\n\treturn true;\n}\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 <sstream>\n#include <QVariant>\n#include <QSet>\n#include <QSqlError>\n#include \"com\/centreon\/broker\/exceptions\/msg.hh\"\n#include \"com\/centreon\/broker\/logging\/logging.hh\"\n#include \"com\/centreon\/broker\/notification\/loaders\/contactgroup_loader.hh\"\n\nusing namespace com::centreon::broker::notification;\nusing namespace com::centreon::broker::notification::objects;\n\ncontactgroup_loader::contactgroup_loader() {}\n\n\/**\n * Load the nodegroups from the database.\n *\n * @param[in] db An open connection to the database.\n * @param[out] output A nodegroup builder object to register the nodegroups.\n *\/\nvoid contactgroup_loader::load(\n QSqlDatabase* db, contactgroup_builder* output) {\n \/\/ If we don't have any db or output, don't do anything.\n if (!db || !output)\n return;\n\n logging::debug(logging::medium)\n << \"notification: loading contact groups from the database\";\n\n QSqlQuery query(*db);\n\n \/\/ Performance improvement, as we never go back.\n query.setForwardOnly(true);\n\n \/\/ Get contactgroups.\n if (!query.exec(\"SELECT cg_id, cg_name, cg_alias FROM cfg_contactgroups\"))\n throw (exceptions::msg()\n << \"notification: cannot load contact groups from database: \"\n << query.lastError().text());\n\n while (query.next()) {\n unsigned int id = query.value(0).toUInt();\n objects::contactgroup::ptr ctg(new objects::contactgroup);\n ctg->set_name(query.value(1).toString().toStdString());\n ctg->set_alias(query.value(2).toString().toStdString());\n output->add_contactgroup(id, ctg);\n }\n\n \/\/ Get contactgroup contact relations.\n if (!query.exec(\"SELECT contact_contact_id, contactgroup_cg_id\"\n \" FROM cfg_contactgroups_contacts_relations\"))\n throw (exceptions::msg()\n << \"notification: cannot load memberships of contact groups \"\n \"from database: \"\n << query.lastError().text());\n\n while (query.next()) {\n\n }\n}\n<commit_msg>Notification: Fix an oversight in contactgroup_loader.<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 <sstream>\n#include <QVariant>\n#include <QSet>\n#include <QSqlError>\n#include \"com\/centreon\/broker\/exceptions\/msg.hh\"\n#include \"com\/centreon\/broker\/logging\/logging.hh\"\n#include \"com\/centreon\/broker\/notification\/loaders\/contactgroup_loader.hh\"\n\nusing namespace com::centreon::broker::notification;\nusing namespace com::centreon::broker::notification::objects;\n\ncontactgroup_loader::contactgroup_loader() {}\n\n\/**\n * Load the nodegroups from the database.\n *\n * @param[in] db An open connection to the database.\n * @param[out] output A nodegroup builder object to register the nodegroups.\n *\/\nvoid contactgroup_loader::load(\n QSqlDatabase* db, contactgroup_builder* output) {\n \/\/ If we don't have any db or output, don't do anything.\n if (!db || !output)\n return;\n\n logging::debug(logging::medium)\n << \"notification: loading contact groups from the database\";\n\n QSqlQuery query(*db);\n\n \/\/ Performance improvement, as we never go back.\n query.setForwardOnly(true);\n\n \/\/ Get contactgroups.\n if (!query.exec(\"SELECT cg_id, cg_name, cg_alias FROM cfg_contactgroups\"))\n throw (exceptions::msg()\n << \"notification: cannot load contact groups from database: \"\n << query.lastError().text());\n\n while (query.next()) {\n unsigned int id = query.value(0).toUInt();\n objects::contactgroup::ptr ctg(new objects::contactgroup);\n ctg->set_name(query.value(1).toString().toStdString());\n ctg->set_alias(query.value(2).toString().toStdString());\n output->add_contactgroup(id, ctg);\n }\n\n \/\/ Get contactgroup contact relations.\n if (!query.exec(\"SELECT contact_contact_id, contactgroup_cg_id\"\n \" FROM cfg_contactgroups_contacts_relations\"))\n throw (exceptions::msg()\n << \"notification: cannot load memberships of contact groups \"\n \"from database: \"\n << query.lastError().text());\n\n while (query.next())\n output->add_contactgroup_contact_relation(\n query.value(0).toUInt(), query.value(1).toUInt());\n}\n<|endoftext|>"} {"text":"<commit_before><commit_msg>Update sample for latest changes.<commit_after><|endoftext|>"} {"text":"<commit_before><commit_msg>MS:<commit_after><|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 \"mitkContourModelLiveWireInteractor.h\"\n\n#include \"mitkToolManager.h\"\n\n#include \"mitkBaseRenderer.h\"\n#include \"mitkRenderingManager.h\"\n\n#include <mitkPositionEvent.h>\n#include <mitkStateEvent.h>\n\n#include <mitkInteractionConst.h>\n\n\nmitk::ContourModelLiveWireInteractor::ContourModelLiveWireInteractor(DataNode* dataNode)\n:ContourModelInteractor(dataNode)\n{\n m_LiveWireFilter = mitk::ImageLiveWireContourModelFilter::New();\n\n mitk::ContourModel::Pointer m_ContourLeft = mitk::ContourModel::New();\n mitk::ContourModel::Pointer m_ContourRight = mitk::ContourModel::New();\n m_NextActiveVertexDown.Fill(0);\n m_NextActiveVertexUp.Fill(0);\n}\n\n\nmitk::ContourModelLiveWireInteractor::~ContourModelLiveWireInteractor()\n{\n}\n\n\n\nbool mitk::ContourModelLiveWireInteractor::OnCheckPointClick( Action* action, const StateEvent* stateEvent)\n{\n const PositionEvent* positionEvent = dynamic_cast<const PositionEvent*>(stateEvent->GetEvent());\n if (!positionEvent) {\n this->HandleEvent( new mitk::StateEvent(EIDNO, stateEvent->GetEvent()) );\n return false;\n }\n\n\n\n mitk::StateEvent* newStateEvent = NULL;\n\n int timestep = stateEvent->GetEvent()->GetSender()->GetTimeStep();\n\n mitk::ContourModel *contour = dynamic_cast<mitk::ContourModel *>(\n m_DataNode->GetData() );\n\n\n contour->Deselect();\n\n \/*\n * Check distance to any vertex.\n * Transition YES if click close to a vertex\n *\/\n mitk::Point3D click = positionEvent->GetWorldPosition();\n\n\n if (contour->SelectVertexAt(click, 1.5, timestep) )\n {\n contour->SetSelectedVertexAsControlPoint();\n\n assert( stateEvent->GetEvent()->GetSender()->GetRenderWindow() );\n mitk::RenderingManager::GetInstance()->RequestUpdate( stateEvent->GetEvent()->GetSender()->GetRenderWindow() );\n newStateEvent = new mitk::StateEvent(EIDYES, stateEvent->GetEvent());\n m_lastMousePosition = click;\n\n\n mitk::ContourModel *contour = dynamic_cast<mitk::ContourModel *>( m_DataNode->GetData() );\n\n \/\/\n m_ContourLeft = mitk::ContourModel::New();\n\n \/\/get coordinates of next active vertex downwards from selected vertex\n int downIndex = SplitContourFromSelectedVertex( contour, m_ContourLeft, false, timestep);\n\n mitk::ContourModel::VertexIterator itDown = contour->IteratorBegin() + downIndex;\n m_NextActiveVertexDown = (*itDown)->Coordinates;\n\n\n \/\/\n m_ContourRight = mitk::ContourModel::New();\n\n \/\/get coordinates of next active vertex upwards from selected vertex\n int upIndex = SplitContourFromSelectedVertex( contour, m_ContourRight, true, timestep);\n\n mitk::ContourModel::VertexIterator itUp = contour->IteratorBegin() + upIndex;\n m_NextActiveVertexUp = (*itUp)->Coordinates;\n\n }\n else\n {\n newStateEvent = new mitk::StateEvent(EIDNO, stateEvent->GetEvent());\n }\n\n this->HandleEvent( newStateEvent );\n\n return true;\n}\n\n\n\nbool mitk::ContourModelLiveWireInteractor::OnDeletePoint( Action* action, const StateEvent* stateEvent)\n{\n\n int timestep = stateEvent->GetEvent()->GetSender()->GetTimeStep();\n\n mitk::ContourModel *contour = dynamic_cast<mitk::ContourModel *>( m_DataNode->GetData() );\n\n if(contour->GetSelectedVertex())\n {\n\n mitk::ContourModel::Pointer newContour = mitk::ContourModel::New();\n newContour->Expand(contour->GetTimeSteps());\n newContour->Concatenate( m_ContourLeft, timestep );\n\n\n \/\/recompute contour between neighbored two active control points\n this->m_LiveWireFilter->SetStartPoint( m_NextActiveVertexDown );\n this->m_LiveWireFilter->SetEndPoint( m_NextActiveVertexUp );\n this->m_LiveWireFilter->Update();\n\n mitk::ContourModel::Pointer liveWireContour = mitk::ContourModel::New();\n liveWireContour = this->m_LiveWireFilter->GetOutput();\n\n\n \/\/insert new liveWire computed points\n newContour->Concatenate( liveWireContour, timestep );\n\n newContour->Concatenate( m_ContourRight, timestep );\n\n newContour->SetIsClosed(contour->IsClosed(timestep), timestep);\n\n m_DataNode->SetData(newContour);\n\n\n assert( stateEvent->GetEvent()->GetSender()->GetRenderWindow() );\n mitk::RenderingManager::GetInstance()->RequestUpdate( stateEvent->GetEvent()->GetSender()->GetRenderWindow() );\n\n }\n return true;\n}\n\n\n\n\nbool mitk::ContourModelLiveWireInteractor::OnMovePoint( Action* action, const StateEvent* stateEvent)\n{\n const PositionEvent* positionEvent = dynamic_cast<const PositionEvent*>(stateEvent->GetEvent());\n if (!positionEvent) return false;\n\n int timestep = stateEvent->GetEvent()->GetSender()->GetTimeStep();\n\n mitk::ContourModel *contour = dynamic_cast<mitk::ContourModel *>( m_DataNode->GetData() );\n\n mitk::ContourModel::Pointer newContour = mitk::ContourModel::New();\n newContour->Expand(contour->GetTimeSteps());\n\n \/*++++++++++++++ concatenate LEFT ++++++++++++++++++++++++++++++*\/\n newContour->Concatenate( m_ContourLeft, timestep );\n\n\n mitk::Point3D currentPosition = positionEvent->GetWorldPosition();\n\n\n \/*+++++++++++++++ start computation ++++++++++++++++++++*\/\n \/\/recompute contour between previous active vertex and selected vertex\n this->m_LiveWireFilter->SetStartPoint( m_NextActiveVertexDown );\n this->m_LiveWireFilter->SetEndPoint( currentPosition );\n this->m_LiveWireFilter->Update();\n\n mitk::ContourModel::Pointer liveWireContour = mitk::ContourModel::New();\n liveWireContour = this->m_LiveWireFilter->GetOutput();\n\n \/\/remove point at current position because it is included in next livewire segment too.\n liveWireContour->RemoveVertexAt( liveWireContour->GetNumberOfVertices(timestep) - 1, timestep);\n\n \/*++++++++++++++ concatenate LIVEWIRE ++++++++++++++++++++++++++++++*\/\n \/\/insert new liveWire computed points\n newContour->Concatenate( liveWireContour, timestep );\n\n\n \/\/recompute contour between selected vertex and next active vertex\n this->m_LiveWireFilter->SetStartPoint( currentPosition );\n this->m_LiveWireFilter->SetEndPoint( m_NextActiveVertexUp );\n this->m_LiveWireFilter->Update();\n\n liveWireContour = this->m_LiveWireFilter->GetOutput();\n\n \/\/make point at mouse position active again, so it is drawn\n const_cast<mitk::ContourModel::VertexType*>( liveWireContour->GetVertexAt(0, timestep) )->IsControlPoint = true;\n\n \/*++++++++++++++ concatenate RIGHT ++++++++++++++++++++++++++++++*\/\n \/\/insert new liveWire computed points\n newContour->Concatenate( liveWireContour, timestep );\n \/*------------------------------------------------*\/\n\n\n newContour->Concatenate( m_ContourRight, timestep );\n\n newContour->SetIsClosed(contour->IsClosed(timestep), timestep);\n newContour->Deselect();\/\/just to make sure\n m_DataNode->SetData(newContour);\n\n this->m_lastMousePosition = positionEvent->GetWorldPosition();\n\n assert( positionEvent->GetSender()->GetRenderWindow() );\n mitk::RenderingManager::GetInstance()->RequestUpdate( positionEvent->GetSender()->GetRenderWindow() );\n\n return true;\n}\n\n\n\nint mitk::ContourModelLiveWireInteractor::SplitContourFromSelectedVertex(mitk::ContourModel* sourceContour, mitk::ContourModel* destinationContour, bool fromSelectedUpwards, int timestep)\n{\n\n mitk::ContourModel::VertexIterator end =sourceContour->IteratorEnd();\n mitk::ContourModel::VertexIterator begin =sourceContour->IteratorBegin();\n\n \/\/search next active control point to left and rigth and set as start and end point for filter\n mitk::ContourModel::VertexIterator itSelected = sourceContour->IteratorBegin();\n\n\n \/\/move iterator to position\n while((*itSelected) != sourceContour->GetSelectedVertex())\n {\n itSelected++;\n }\n\n\n if(fromSelectedUpwards)\n {\n mitk::ContourModel::VertexIterator itUp = itSelected;\n\n if(itUp != end)\n {\n itUp++;\/\/step once up otherwise the the loop breaks immediately\n }\n\n while( itUp != end && !((*itUp)->IsControlPoint)){ itUp++; }\n\n mitk::ContourModel::VertexIterator it = itUp;\n\n \/\/copy the rest of the original contour\n while(it != end)\n {\n destinationContour->AddVertex( (*it)->Coordinates, (*it)->IsControlPoint, timestep);\n it++;\n }\n\n \/\/return the offset of iterator at one before next-vertex-upwards\n if(itUp != begin)\n {\n return itUp._Myoff - 1;\n }\n else\n {\n return itUp._Myoff;\n }\n\n }\n else \/\/downwards\n {\n mitk::ContourModel::VertexIterator itDown = itSelected;\n\n if(itDown != begin)\n {\n itDown--;\/\/step once down otherwise the the loop breaks immediately\n }\n\n while( itDown != begin && !((*itDown)->IsControlPoint)){ itDown--; }\n\n mitk::ContourModel::VertexIterator it = sourceContour->IteratorBegin();\n\n if(it != end)\/\/if not empty\n {\n \/\/always add the first vertex\n destinationContour->AddVertex( (*it)->Coordinates, (*it)->IsControlPoint, timestep);\n it++;\n }\n\n \/\/copy from begin to itDown\n while(it <= itDown)\n {\n destinationContour->AddVertex( (*it)->Coordinates, (*it)->IsControlPoint, timestep);\n it++;\n }\n\n \/\/add vertex at itDown - it's not considered during while loop\n if( it != begin && it != end)\n {\n \/\/destinationContour->AddVertex( (*it)->Coordinates, (*it)->IsControlPoint, timestep);\n }\n\n \/\/return the offset of iterator at one after next-vertex-downwards\n if( itDown != end)\n {\n return itDown._Myoff + 1;\/\/index of next vertex\n }\n else\n {\n return itDown._Myoff - 1;\n }\n }\n}\n<commit_msg>Fix deleting and moving first controlpoint.<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 \"mitkContourModelLiveWireInteractor.h\"\n\n#include \"mitkToolManager.h\"\n\n#include \"mitkBaseRenderer.h\"\n#include \"mitkRenderingManager.h\"\n\n#include <mitkPositionEvent.h>\n#include <mitkStateEvent.h>\n\n#include <mitkInteractionConst.h>\n\n\nmitk::ContourModelLiveWireInteractor::ContourModelLiveWireInteractor(DataNode* dataNode)\n:ContourModelInteractor(dataNode)\n{\n m_LiveWireFilter = mitk::ImageLiveWireContourModelFilter::New();\n\n mitk::ContourModel::Pointer m_ContourLeft = mitk::ContourModel::New();\n mitk::ContourModel::Pointer m_ContourRight = mitk::ContourModel::New();\n m_NextActiveVertexDown.Fill(0);\n m_NextActiveVertexUp.Fill(0);\n}\n\n\nmitk::ContourModelLiveWireInteractor::~ContourModelLiveWireInteractor()\n{\n}\n\n\n\nbool mitk::ContourModelLiveWireInteractor::OnCheckPointClick( Action* action, const StateEvent* stateEvent)\n{\n const PositionEvent* positionEvent = dynamic_cast<const PositionEvent*>(stateEvent->GetEvent());\n if (!positionEvent) {\n this->HandleEvent( new mitk::StateEvent(EIDNO, stateEvent->GetEvent()) );\n return false;\n }\n\n\n\n mitk::StateEvent* newStateEvent = NULL;\n\n int timestep = stateEvent->GetEvent()->GetSender()->GetTimeStep();\n\n mitk::ContourModel *contour = dynamic_cast<mitk::ContourModel *>(\n m_DataNode->GetData() );\n\n\n contour->Deselect();\n\n \/*\n * Check distance to any vertex.\n * Transition YES if click close to a vertex\n *\/\n mitk::Point3D click = positionEvent->GetWorldPosition();\n\n\n if (contour->SelectVertexAt(click, 1.5, timestep) )\n {\n contour->SetSelectedVertexAsControlPoint();\n\n assert( stateEvent->GetEvent()->GetSender()->GetRenderWindow() );\n mitk::RenderingManager::GetInstance()->RequestUpdate( stateEvent->GetEvent()->GetSender()->GetRenderWindow() );\n newStateEvent = new mitk::StateEvent(EIDYES, stateEvent->GetEvent());\n m_lastMousePosition = click;\n\n\n mitk::ContourModel *contour = dynamic_cast<mitk::ContourModel *>( m_DataNode->GetData() );\n\n \/\/\n m_ContourLeft = mitk::ContourModel::New();\n\n \/\/get coordinates of next active vertex downwards from selected vertex\n int downIndex = SplitContourFromSelectedVertex( contour, m_ContourLeft, false, timestep);\n\n mitk::ContourModel::VertexIterator itDown = contour->IteratorBegin() + downIndex;\n m_NextActiveVertexDown = (*itDown)->Coordinates;\n\n\n \/\/\n m_ContourRight = mitk::ContourModel::New();\n\n \/\/get coordinates of next active vertex upwards from selected vertex\n int upIndex = SplitContourFromSelectedVertex( contour, m_ContourRight, true, timestep);\n\n mitk::ContourModel::VertexIterator itUp = contour->IteratorBegin() + upIndex;\n m_NextActiveVertexUp = (*itUp)->Coordinates;\n\n }\n else\n {\n newStateEvent = new mitk::StateEvent(EIDNO, stateEvent->GetEvent());\n }\n\n this->HandleEvent( newStateEvent );\n\n return true;\n}\n\n\n\nbool mitk::ContourModelLiveWireInteractor::OnDeletePoint( Action* action, const StateEvent* stateEvent)\n{\n\n int timestep = stateEvent->GetEvent()->GetSender()->GetTimeStep();\n\n mitk::ContourModel *contour = dynamic_cast<mitk::ContourModel *>( m_DataNode->GetData() );\n\n if(contour->GetSelectedVertex())\n {\n\n mitk::ContourModel::Pointer newContour = mitk::ContourModel::New();\n newContour->Expand(contour->GetTimeSteps());\n newContour->Concatenate( m_ContourLeft, timestep );\n\n\n \/\/recompute contour between neighbored two active control points\n this->m_LiveWireFilter->SetStartPoint( m_NextActiveVertexDown );\n this->m_LiveWireFilter->SetEndPoint( m_NextActiveVertexUp );\n this->m_LiveWireFilter->Update();\n\n mitk::ContourModel::Pointer liveWireContour = mitk::ContourModel::New();\n liveWireContour = this->m_LiveWireFilter->GetOutput();\n\n\n \/\/insert new liveWire computed points\n newContour->Concatenate( liveWireContour, timestep );\n\n newContour->Concatenate( m_ContourRight, timestep );\n\n newContour->SetIsClosed(contour->IsClosed(timestep), timestep);\n\n m_DataNode->SetData(newContour);\n\n\n assert( stateEvent->GetEvent()->GetSender()->GetRenderWindow() );\n mitk::RenderingManager::GetInstance()->RequestUpdate( stateEvent->GetEvent()->GetSender()->GetRenderWindow() );\n\n }\n return true;\n}\n\n\n\n\nbool mitk::ContourModelLiveWireInteractor::OnMovePoint( Action* action, const StateEvent* stateEvent)\n{\n const PositionEvent* positionEvent = dynamic_cast<const PositionEvent*>(stateEvent->GetEvent());\n if (!positionEvent) return false;\n\n int timestep = stateEvent->GetEvent()->GetSender()->GetTimeStep();\n\n mitk::ContourModel *contour = dynamic_cast<mitk::ContourModel *>( m_DataNode->GetData() );\n\n mitk::ContourModel::Pointer newContour = mitk::ContourModel::New();\n newContour->Expand(contour->GetTimeSteps());\n\n \/*++++++++++++++ concatenate LEFT ++++++++++++++++++++++++++++++*\/\n newContour->Concatenate( m_ContourLeft, timestep );\n\n\n mitk::Point3D currentPosition = positionEvent->GetWorldPosition();\n\n\n \/*+++++++++++++++ start computation ++++++++++++++++++++*\/\n \/\/recompute contour between previous active vertex and selected vertex\n this->m_LiveWireFilter->SetStartPoint( m_NextActiveVertexDown );\n this->m_LiveWireFilter->SetEndPoint( currentPosition );\n this->m_LiveWireFilter->Update();\n\n mitk::ContourModel::Pointer liveWireContour = mitk::ContourModel::New();\n liveWireContour = this->m_LiveWireFilter->GetOutput();\n\n \/\/remove point at current position because it is included in next livewire segment too.\n liveWireContour->RemoveVertexAt( liveWireContour->GetNumberOfVertices(timestep) - 1, timestep);\n\n \/*++++++++++++++ concatenate LIVEWIRE ++++++++++++++++++++++++++++++*\/\n \/\/insert new liveWire computed points\n newContour->Concatenate( liveWireContour, timestep );\n\n\n \/\/recompute contour between selected vertex and next active vertex\n this->m_LiveWireFilter->SetStartPoint( currentPosition );\n this->m_LiveWireFilter->SetEndPoint( m_NextActiveVertexUp );\n this->m_LiveWireFilter->Update();\n\n liveWireContour = this->m_LiveWireFilter->GetOutput();\n\n \/\/make point at mouse position active again, so it is drawn\n const_cast<mitk::ContourModel::VertexType*>( liveWireContour->GetVertexAt(0, timestep) )->IsControlPoint = true;\n\n \/*++++++++++++++ concatenate RIGHT ++++++++++++++++++++++++++++++*\/\n \/\/insert new liveWire computed points\n newContour->Concatenate( liveWireContour, timestep );\n \/*------------------------------------------------*\/\n\n\n newContour->Concatenate( m_ContourRight, timestep );\n\n newContour->SetIsClosed(contour->IsClosed(timestep), timestep);\n newContour->Deselect();\/\/just to make sure\n m_DataNode->SetData(newContour);\n\n this->m_lastMousePosition = positionEvent->GetWorldPosition();\n\n assert( positionEvent->GetSender()->GetRenderWindow() );\n mitk::RenderingManager::GetInstance()->RequestUpdate( positionEvent->GetSender()->GetRenderWindow() );\n\n return true;\n}\n\n\n\nint mitk::ContourModelLiveWireInteractor::SplitContourFromSelectedVertex(mitk::ContourModel* sourceContour, mitk::ContourModel* destinationContour, bool fromSelectedUpwards, int timestep)\n{\n\n mitk::ContourModel::VertexIterator end =sourceContour->IteratorEnd();\n mitk::ContourModel::VertexIterator begin =sourceContour->IteratorBegin();\n\n \/\/search next active control point to left and rigth and set as start and end point for filter\n mitk::ContourModel::VertexIterator itSelected = sourceContour->IteratorBegin();\n\n\n \/\/move iterator to position\n while((*itSelected) != sourceContour->GetSelectedVertex())\n {\n itSelected++;\n }\n\n \/\/CASE search upwards for next control point\n if(fromSelectedUpwards)\n {\n mitk::ContourModel::VertexIterator itUp = itSelected;\n\n if(itUp != end)\n {\n itUp++;\/\/step once up otherwise the the loop breaks immediately\n }\n\n while( itUp != end && !((*itUp)->IsControlPoint)){ itUp++; }\n\n mitk::ContourModel::VertexIterator it = itUp;\n\n\n if(itSelected != begin)\n {\n \/\/copy the rest of the original contour\n while(it != end)\n {\n destinationContour->AddVertex( (*it)->Coordinates, (*it)->IsControlPoint, timestep);\n it++;\n }\n }\n \/\/else do not copy the contour\n\n\n \/\/return the offset of iterator at one before next-vertex-upwards\n if(itUp != begin)\n {\n return itUp._Myoff - 1;\n }\n else\n {\n return itUp._Myoff;\n }\n\n }\n else \/\/CASE search downwards for next control point\n {\n mitk::ContourModel::VertexIterator itDown = itSelected;\n mitk::ContourModel::VertexIterator it = sourceContour->IteratorBegin();\n\n if( itSelected != begin )\n {\n if(itDown != begin)\n {\n itDown--;\/\/step once down otherwise the the loop breaks immediately\n }\n\n while( itDown != begin && !((*itDown)->IsControlPoint)){ itDown--; }\n\n if(it != end)\/\/if not empty\n {\n \/\/always add the first vertex\n destinationContour->AddVertex( (*it)->Coordinates, (*it)->IsControlPoint, timestep);\n it++;\n }\n \/\/copy from begin to itDown\n while(it <= itDown)\n {\n destinationContour->AddVertex( (*it)->Coordinates, (*it)->IsControlPoint, timestep);\n it++;\n }\n }\n else\n {\n \/\/if selected vertex is the first element search from end of contour downwards\n itDown = end;\n itDown--;\n while(!((*itDown)->IsControlPoint)){itDown--;}\n\n \/\/move one forward as we don't want the first control point\n it++;\n \/\/move iterator to second control point\n while( (it!=end) && !((*it)->IsControlPoint) ){it++;}\n \/\/copy from begin to itDown\n while(it <= itDown)\n {\n \/\/copy the contour from second control point to itDown\n destinationContour->AddVertex( (*it)->Coordinates, (*it)->IsControlPoint, timestep);\n it++;\n }\n }\n\n\n \/\/add vertex at itDown - it's not considered during while loop\n if( it != begin && it != end)\n {\n \/\/destinationContour->AddVertex( (*it)->Coordinates, (*it)->IsControlPoint, timestep);\n }\n\n \/\/return the offset of iterator at one after next-vertex-downwards\n if( itDown != end)\n {\n return itDown._Myoff;\/\/ + 1;\/\/index of next vertex\n }\n else\n {\n return itDown._Myoff - 1;\n }\n }\n}\n<|endoftext|>"} {"text":"<commit_before>\/* -------------------------------------------------------------------------- *\n * OpenSim: SimpleOptimizationExample.cpp *\n * -------------------------------------------------------------------------- *\n * The OpenSim API is a toolkit for musculoskeletal modeling and simulation. *\n * See http:\/\/opensim.stanford.edu and the NOTICE file for more information. *\n * OpenSim is developed at Stanford University and supported by the US *\n * National Institutes of Health (U54 GM072970, R24 HD065690) and by DARPA *\n * through the Warrior Web program. *\n * *\n * Copyright (c) 2005-2012 Stanford University and the Authors *\n * Author(s): Ayman Habib *\n * *\n * Licensed under the Apache License, Version 2.0 (the \"License\"); you may *\n * not use this file except in compliance with the License. You may obtain a *\n * copy of the License at http:\/\/www.apache.org\/licenses\/LICENSE-2.0. *\n * *\n * Unless required by applicable law or agreed to in writing, software *\n * distributed under the License is distributed on an \"AS IS\" BASIS, *\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. *\n * See the License for the specific language governing permissions and *\n * limitations under the License. *\n * -------------------------------------------------------------------------- *\/\n\n\/* \n * Example of an OpenSim program that tries to find the elbow flexion angle that maximizes\n * the muscle moment arm of BICshort in the Arm26 model.\n *\/\n\n\/\/==============================================================================\n\/\/==============================================================================\n#include <OpenSim\/OpenSim.h>\n#include <ctime> \/\/ clock(), clock_t, CLOCKS_PER_SEC\n\nusing namespace OpenSim;\nusing namespace SimTK;\nusing namespace std;\n\n\/\/ step count for troubleshooting\nint stepCount = 0;\n\ndouble bestSoFar = Infinity;\n\nclass ExampleOptimizationSystem : public OptimizerSystem {\n public:\n\n \/* Constructor class. Parameters passed are accessed in the objectiveFunc() class. *\/\n ExampleOptimizationSystem(int numParameters, State& s, Model& aModel): \n numKnobs(numParameters), OptimizerSystem(numParameters), si(s), osimModel(aModel){}\n \n int objectiveFunc( const Vector &newControls, bool new_coefficients, Real& f ) const override {\n\n \/\/ make a copy of out initial states\n State s = si;\n\n \/\/ Update the coordinate value of r_elbow_flex\n OpenSim::Coordinate& elbowFlexCoord = osimModel.updCoordinateSet().get(\"r_elbow_flex\");\n elbowFlexCoord.setValue(s, newControls[0]);\n \/\/ Now equilibrate muscles at this configuration\n const Set<Muscle> &muscleSet = osimModel.getMuscles();\n \/\/ Make sure other muscle states are initialized the same with 1.0 activation, 0.1 fiberLength followed by equilibrium computation\n for(int i=0; i< muscleSet.getSize(); i++ ){\n muscleSet[i].setActivation(s, 1.0);\n const ActivationFiberLengthMuscle* afl = ActivationFiberLengthMuscle::safeDownCast(&muscleSet[i]);\n if (afl) afl->setFiberLength(s, .1);\n }\n \/\/ Make sure the muscles states are in equilibrium\n osimModel.equilibrateMuscles(s);\n\n const OpenSim::Muscle& bicShort = osimModel.getMuscles().get(\"BICshort\");\n \/\/ Compute moment arm of BICshort, flip sign since the optimizer tries to minimize rather than maximize\n f = -bicShort.computeMomentArm(s, elbowFlexCoord);\n\n stepCount++;\n \n if( f < bestSoFar){\n bestSoFar = f;\n cout << \"\\nobjective evaluation #: \" << stepCount << \" elbow flexion angle = \" << newControls[0]*SimTK_RADIAN_TO_DEGREE << \" BICshort moment arm = \" << -f << std::endl;\n } \n\n return(0);\n\n } \n\nprivate:\n int numKnobs;\n State& si;\n Model& osimModel;\n };\n\n\/\/______________________________________________________________________________\n\/**\n * Define an optimization problem that finds a set of muscle controls to maximize \n * the forward velocity of the forearm\/hand segment mass center. \n *\/\nint main()\n{\n try {\n std::clock_t startTime = std::clock(); \n \n \/\/ Create a new OpenSim model\n \/\/ Similar to arm26 model but without wrapping surfaces for better performance\n Model osimModel(\"Arm26_Optimize.osim\");\n \n \/\/ Initialize the system and get the state representing the state system\n State& si = osimModel.initSystem();\n\n \/\/ initialize the starting shoulder angle\n const CoordinateSet& coords = osimModel.getCoordinateSet();\n coords.get(\"r_shoulder_elev\").setValue(si, 0.0);\n\n \/\/ Set the initial muscle activations \n const Set<Muscle> &muscleSet = osimModel.getMuscles();\n for(int i=0; i< muscleSet.getSize(); i++ ){\n muscleSet[i].setActivation(si, 1.0);\n const ActivationFiberLengthMuscle* afl = ActivationFiberLengthMuscle::safeDownCast(&muscleSet[i]);\n afl->setFiberLength(si, .1);\n }\n OpenSim::Coordinate& elbowFlexCoord = osimModel.updCoordinateSet().get(\"r_elbow_flex\");\n elbowFlexCoord.setValue(si, 1.0);\n \/\/osimModel.getMultibodySystem().realize(si, Stage::Velocity);\n \/\/ Make sure the muscles states are in equilibrium\n osimModel.equilibrateMuscles(si);\n \n \/\/ Initialize the optimizer system we've defined.\n ExampleOptimizationSystem sys(1, si, osimModel);\n Real f = NaN;\n \n \/* Define initial values and bounds for the controls to optimize *\/\n\n Vector controls(1, 1.0); \/\/ 1 radian for default value\n Vector lower_bounds(1, elbowFlexCoord.getRangeMin());\n Vector upper_bounds(1, elbowFlexCoord.getRangeMax());\n\n sys.setParameterLimits( lower_bounds, upper_bounds );\n \n \/\/ Create an optimizer. Pass in our OptimizerSystem\n \/\/ and the name of the optimization algorithm.\n Optimizer opt(sys, SimTK::LBFGSB);\n\n \/\/ Specify settings for the optimizer\n opt.setConvergenceTolerance(0.000001);\n opt.useNumericalGradient(true);\n opt.setMaxIterations(1000);\n opt.setLimitedMemoryHistory(500);\n \n \/\/ Optimize it!\n f = opt.optimize(controls); \/\/ f=-0.049390301058364026\n \n cout << \"Elapsed time = \" << (std::clock()-startTime)\/CLOCKS_PER_SEC << \"s\" << endl;\n \n cout << \"OpenSim example completed successfully.\\n\";\n }\n catch (const std::exception& ex)\n {\n std::cout << ex.what() << std::endl;\n return 1;\n }\n \n \/\/ End of main() routine.\n return 0;\n}\n<commit_msg>Initialization order. Unused variable.<commit_after>\/* -------------------------------------------------------------------------- *\n * OpenSim: SimpleOptimizationExample.cpp *\n * -------------------------------------------------------------------------- *\n * The OpenSim API is a toolkit for musculoskeletal modeling and simulation. *\n * See http:\/\/opensim.stanford.edu and the NOTICE file for more information. *\n * OpenSim is developed at Stanford University and supported by the US *\n * National Institutes of Health (U54 GM072970, R24 HD065690) and by DARPA *\n * through the Warrior Web program. *\n * *\n * Copyright (c) 2005-2012 Stanford University and the Authors *\n * Author(s): Ayman Habib *\n * *\n * Licensed under the Apache License, Version 2.0 (the \"License\"); you may *\n * not use this file except in compliance with the License. You may obtain a *\n * copy of the License at http:\/\/www.apache.org\/licenses\/LICENSE-2.0. *\n * *\n * Unless required by applicable law or agreed to in writing, software *\n * distributed under the License is distributed on an \"AS IS\" BASIS, *\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. *\n * See the License for the specific language governing permissions and *\n * limitations under the License. *\n * -------------------------------------------------------------------------- *\/\n\n\/* \n * Example of an OpenSim program that tries to find the elbow flexion angle that maximizes\n * the muscle moment arm of BICshort in the Arm26 model.\n *\/\n\n\/\/==============================================================================\n\/\/==============================================================================\n#include <OpenSim\/OpenSim.h>\n#include <ctime> \/\/ clock(), clock_t, CLOCKS_PER_SEC\n\nusing namespace OpenSim;\nusing namespace SimTK;\nusing namespace std;\n\n\/\/ step count for troubleshooting\nint stepCount = 0;\n\ndouble bestSoFar = Infinity;\n\nclass ExampleOptimizationSystem : public OptimizerSystem {\n public:\n\n \/* Constructor class. Parameters passed are accessed in the objectiveFunc() class. *\/\n ExampleOptimizationSystem(int numParameters, State& s, Model& aModel): \n OptimizerSystem(numParameters), \n numKnobs(numParameters), \n si(s), \n osimModel(aModel){}\n \n int objectiveFunc( const Vector &newControls, bool new_coefficients, Real& f ) const override {\n\n \/\/ make a copy of out initial states\n State s = si;\n\n \/\/ Update the coordinate value of r_elbow_flex\n OpenSim::Coordinate& elbowFlexCoord = osimModel.updCoordinateSet().get(\"r_elbow_flex\");\n elbowFlexCoord.setValue(s, newControls[0]);\n \/\/ Now equilibrate muscles at this configuration\n const Set<Muscle> &muscleSet = osimModel.getMuscles();\n \/\/ Make sure other muscle states are initialized the same with 1.0 activation, 0.1 fiberLength followed by equilibrium computation\n for(int i=0; i< muscleSet.getSize(); i++ ){\n muscleSet[i].setActivation(s, 1.0);\n const ActivationFiberLengthMuscle* afl = ActivationFiberLengthMuscle::safeDownCast(&muscleSet[i]);\n if (afl) afl->setFiberLength(s, .1);\n }\n \/\/ Make sure the muscles states are in equilibrium\n osimModel.equilibrateMuscles(s);\n\n const OpenSim::Muscle& bicShort = osimModel.getMuscles().get(\"BICshort\");\n \/\/ Compute moment arm of BICshort, flip sign since the optimizer tries to minimize rather than maximize\n f = -bicShort.computeMomentArm(s, elbowFlexCoord);\n\n stepCount++;\n \n if( f < bestSoFar){\n bestSoFar = f;\n cout << \"\\nobjective evaluation #: \" << stepCount << \" elbow flexion angle = \" << newControls[0]*SimTK_RADIAN_TO_DEGREE << \" BICshort moment arm = \" << -f << std::endl;\n } \n\n return(0);\n\n } \n\nprivate:\n int numKnobs;\n State& si;\n Model& osimModel;\n };\n\n\/\/______________________________________________________________________________\n\/**\n * Define an optimization problem that finds a set of muscle controls to maximize \n * the forward velocity of the forearm\/hand segment mass center. \n *\/\nint main()\n{\n try {\n std::clock_t startTime = std::clock(); \n \n \/\/ Create a new OpenSim model\n \/\/ Similar to arm26 model but without wrapping surfaces for better performance\n Model osimModel(\"Arm26_Optimize.osim\");\n \n \/\/ Initialize the system and get the state representing the state system\n State& si = osimModel.initSystem();\n\n \/\/ initialize the starting shoulder angle\n const CoordinateSet& coords = osimModel.getCoordinateSet();\n coords.get(\"r_shoulder_elev\").setValue(si, 0.0);\n\n \/\/ Set the initial muscle activations \n const Set<Muscle> &muscleSet = osimModel.getMuscles();\n for(int i=0; i< muscleSet.getSize(); i++ ){\n muscleSet[i].setActivation(si, 1.0);\n const ActivationFiberLengthMuscle* afl = ActivationFiberLengthMuscle::safeDownCast(&muscleSet[i]);\n afl->setFiberLength(si, .1);\n }\n OpenSim::Coordinate& elbowFlexCoord = osimModel.updCoordinateSet().get(\"r_elbow_flex\");\n elbowFlexCoord.setValue(si, 1.0);\n \/\/osimModel.getMultibodySystem().realize(si, Stage::Velocity);\n \/\/ Make sure the muscles states are in equilibrium\n osimModel.equilibrateMuscles(si);\n \n \/\/ Initialize the optimizer system we've defined.\n ExampleOptimizationSystem sys(1, si, osimModel);\n \/\/ Real f = NaN;\n \n \/* Define initial values and bounds for the controls to optimize *\/\n\n Vector controls(1, 1.0); \/\/ 1 radian for default value\n Vector lower_bounds(1, elbowFlexCoord.getRangeMin());\n Vector upper_bounds(1, elbowFlexCoord.getRangeMax());\n\n sys.setParameterLimits( lower_bounds, upper_bounds );\n \n \/\/ Create an optimizer. Pass in our OptimizerSystem\n \/\/ and the name of the optimization algorithm.\n Optimizer opt(sys, SimTK::LBFGSB);\n\n \/\/ Specify settings for the optimizer\n opt.setConvergenceTolerance(0.000001);\n opt.useNumericalGradient(true);\n opt.setMaxIterations(1000);\n opt.setLimitedMemoryHistory(500);\n \n \/\/ Optimize it!\n \/*f = *\/opt.optimize(controls); \/\/ f=-0.049390301058364026\n \n cout << \"Elapsed time = \" << (std::clock()-startTime)\/CLOCKS_PER_SEC << \"s\" << endl;\n \n cout << \"OpenSim example completed successfully.\\n\";\n }\n catch (const std::exception& ex)\n {\n std::cout << ex.what() << std::endl;\n return 1;\n }\n \n \/\/ End of main() routine.\n return 0;\n}\n<|endoftext|>"} {"text":"<commit_before>\/**\n * @file Result.hpp\n * @author Nicolas Di Prima <nicolas@di-prima.fr>\n * @date 2016\/05\/22\n * @copyright 2016, Nicolas Di Prima. All rights reserved.\n *\n * Redistribution and use in source and binary forms, with or without\n * modification, are permitted provided that the following conditions\n * are met:\n *\n * 1. Redistributions of source code must retain the above copyright\n * notice, this list of conditions and the following disclaimer.\n * 2. Redistributions in binary form must reproduce the above copyright\n * notice, this list of conditions and the following disclaimer in the\n * documentation and\/or other materials provided with the distribution.\n * 3. Neither the name of the author nor the names of his 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 REGENTS 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 AUTHORS 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 * @brief define a templated type as place holder for a result of a given\n * type or an error.\n *\n * The main idea is to provide code and APIs as simple to read and maintain\n * as possible. It is too often difficult to determine what a given function\n * may do, the kind of error it may throw etc...\n *\n * Uses this type to wrap the return values of your function.\n *\n * For example:\n *\n * @code{cpp}\n * \/\/ from the following line:\n * int devide_1(int input_1, int input_2, int* output);\n *\n * \/\/ to the function\n * Result<int> devide_2(int input_1, int input_2) {\n * if (!input_2) {\n * return std::domain_error(\"division by zero\");\n * }\n * return input_1 \/ input_2;\n * }\n * @encode\n *\n * And it is also very simple to use:\n *\n * @code{cpp}\n * \/\/ you can simply unwrap it (will throw if error)\n * int res = divide_2(2, 2).unwrap();\n * @encode\n * @code{cpp}\n * \/\/ override with you own exception if needed\n * int res = divide_2(2, 0).except(std::logic_error(\"silly me!\"));\n * @encode\n *\n *\/\n#ifndef RESULT_HPP_\n# define RESULT_HPP_\n\n# include <exception>\n# include <stdexcept>\n# include <utility>\n# include <type_traits>\n\n# include <boost\/variant\/variant.hpp>\n# include <boost\/variant\/get.hpp>\n\n\/* Helper Macros *********************************************************** *\/\n\n\/\/\/ @macro TRY\n\/\/\/ @brief helper to unwrap a Result without throwing an exception (but\n\/\/\/ propagating the error.\n\/\/\/\n\/\/\/ @code{cpp}\n\/\/\/ Result<int> my_func1();\n\/\/\/ Result<int> my_func2() {\n\/\/\/ int i = TRY(my_func1());\n\/\/\/ return i % 2;\n\/\/\/ }\n\/\/\/ @encode\n\/\/\/\n\/\/\/ include this header file with defined **DONT_DEFINE_TRY_MACRO** if you\n\/\/\/ want to define you own one (i.e. add more information along your\n\/\/\/ exception (such as a stack trace?)).\n\/\/\/\n# if !defined(DONT_DEFINE_TRY_MACRO)\n# define TRY(expr) \\\n ({ \\\n auto res = expr; \\\n if (res.is_error()) { \\\n return res; \\\n } \\\n res.unwrap(); \\\n })\n# endif \/\/ ! DONT_DEFINE_TRY_MACRO\n\n\/* Result Class ************************************************************ *\/\n\n\/**\n * @class Result\n * @brief placeholder for variant type (result or error)\n *\/\ntemplate<typename R, typename E = std::exception>\nclass Result {\n static_assert( std::is_base_of<std::exception, E>::value\n , \"expecting error type to be base of std::exception\"\n );\n\n static_assert( std::is_move_constructible<R>::value\n || std::is_copy_constructible<R>::value\n , \"The result type must be move constructible or copy constructible\"\n );\n\n public:\n using return_type = R;\n using error_type = E;\n\n public:\n \/\/\/ @brief Constructors\n \/\/\/ @{\n Result() = delete;\n Result(Result const&) = delete;\n Result(Result&&) = default;\n\n \/\/ non explicit constructor for the return_type\n Result(return_type&&);\n \/\/ non explicit constructor for the error_type\n Result(error_type&&);\n\n \/\/\/ @brief create a result containing a result object\n \/\/\/\n \/\/\/ This is the only way to create a valid Result.\n \/\/\/\n \/\/\/ @code{cpp}\n \/\/\/ Result<int> my_func() {\n \/\/\/ return Result<int>::Ok(42);\n \/\/\/ }\n \/\/\/ @endcode\n static Result<return_type, error_type> Ok(return_type&&) noexcept(false);\n\n \/\/\/ @brief create a result containing an error object\n \/\/\/\n \/\/\/ This is the only way to create an error Result\n \/\/\/\n \/\/\/ @code{cpp}\n \/\/\/ Result<int> my_func() {\n \/\/\/ return Result<int>::Err(std::logic_error(\"no answer\"));\n \/\/\/ }\n \/\/\/ @encode\n static Result<return_type, error_type> Err(error_type&&) noexcept(false);\n \/\/\/ @}\n\n \/\/\/ @brief Destructor\n \/\/\/ @{\n ~Result() = default;\n \/\/\/ @}\n\n \/\/\/ @brief assignments\n \/\/\/ @{\n Result& operator=(Result const&) = delete;\n Result& operator=(Result&&) = default;\n \/\/\/ @}\n\n \/\/\/ @brief const accessors\n \/\/\/\n \/\/\/ these member function does not modify the underlying state\n \/\/\/\n \/\/\/ @{\n\n \/\/\/ simple function to check if the given Result contains\n \/\/\/ a result.\n bool is_ok() const noexcept;\n\n \/\/\/ simple function to check if the given Result contains\n \/\/\/ an error.\n bool is_error() const noexcept;\n \/\/\/ @}\n\n \/\/\/ @brief non-const accessors (will move the content)\n \/\/\/\n \/\/\/ It means: do not reuse the object...\n \/\/\/\n \/\/\/ @{\n\n \/\/\/ @brief map the result with the given function\n \/\/\/\n \/\/\/ If the given Result contains a return value (not an error)\n \/\/\/ then the given function will be called.\n \/\/\/\n \/\/\/ NB: the function validity is not checked.\n \/\/\/\n \/\/\/ @code{cpp}\n \/\/\/ Result<int> my_func();\n \/\/\/ struct my_data { int i_; my_data(int i) : i_(i) {} };\n \/\/\/ my_data c = my_func()\n \/\/\/ .map_res([](int&& i) { return my_data(i); })\n \/\/\/ .unwrap();\n \/\/\/ @endcode\n template<typename RR, typename F>\n Result<RR, error_type> map_res(F);\n\n \/\/\/ @brief map the error of the given result\n \/\/\/\n \/\/\/ you can update the error with more information or change its type\n template<typename EE, typename F>\n Result<return_type, EE> map_err(F);\n\n \/\/\/ @brief if the Result is successful, call the next function\n template<typename RR, typename F>\n Result<RR, error_type> and_then(F f) {\n if (this->is_error()) {\n return Result<RR, error_type>::Err(this->get_error());\n }\n return f(this->get_return());\n }\n \/\/\/ @brief if the Result has error, call the next function\n template<typename RR, typename F>\n Result<RR, error_type> or_else(F f) {\n if (this->is_ok()) {\n return Result<RR, error_type>::Ok(this->get_return());\n }\n return f(this->get_return());\n }\n\n \/\/\/ @brief get the result (or throw the underlying error)\n return_type unwrap() noexcept(false);\n\n \/\/\/ @brief expected an error (consume the error)\n template<class EE>\n return_type expect(EE const& err) noexcept(false);\n \/\/\/ @}\n\n private:\n\n \/\/ private getters\n return_type get_return() const noexcept(false);\n error_type get_error() const noexcept(false);\n\n \/\/ assertions\n void expect_valid_state() const noexcept(false);\n void expect_return() const noexcept(false);\n void expect_error() const noexcept(false);\n\n private:\n boost::variant<return_type, error_type> internal_;\n};\n\n\/* ***************************************************************************\n * *\n * Implementation *\n * *\n *************************************************************************** *\/\n\n\/* Public members ********************************************************** *\/\n\n\/* Constructors *\/\n\ntemplate<typename R, typename E>\nResult<R, E> Result<R, E>::Ok(R&& ret) noexcept(false) {\n return Result<R, E>(std::move(ret));\n}\ntemplate<typename R, typename E>\nResult<R, E> Result<R, E>::Err(E&& err) noexcept(false) {\n return Result<R, E>(std::move(err));\n}\n\n\/* Const accessors *\/\n\ntemplate<typename R, typename E>\nbool Result<R, E>::is_ok() const noexcept { return this->internal_.which() == 0; }\ntemplate<typename R, typename E>\nbool Result<R, E>::is_error() const noexcept { return this->internal_.which() == 1; }\n\n\/* Non-const accessors *\/\n\ntemplate<typename R, typename E>\ntemplate<typename RR, typename F>\nResult<RR, E> Result<R, E>::map_res(F f) {\n if (this->is_error()) { return Result<RR, E>::Err(this->get_error()); }\n return Result<RR, E>::Ok(f(this->get_return()));\n}\n\ntemplate<typename R, typename E>\ntemplate<typename EE, typename F>\nResult<R, EE> Result<R, E>::map_err(F f) {\n if (this->is_ok()) { return Result<R, EE>::Ok(this->get_return()); }\n return Result<R, EE>::Err(f(this->get_error()));\n}\n\ntemplate<typename R, typename E>\nR Result<R, E>::unwrap() noexcept(false) {\n if (this->is_error()) { throw this->get_error(); }\n return this->get_return();\n}\n\ntemplate<typename R, typename E>\ntemplate<class EE>\nR Result<R, E>::expect(EE const& err) noexcept(false) {\n static_assert( std::is_base_of<std::exception, EE>::value\n , \"expectation can only fail with std::exception or inherited types\"\n );\n this->expect_valid_state();\n if (this->is_error()) { throw err; }\n return this->get_return();\n}\n\n\/* Private members ********************************************************* *\/\n\n\/* constructors *\/\n\ntemplate<typename R, typename E>\nResult<R, E>::Result(R&& ret) : internal_(std::move(ret)) { }\ntemplate<typename R, typename E>\nResult<R, E>::Result(E&& err) : internal_(std::move(err)) { }\n\n\/* Getters *\/\n\ntemplate<typename R, typename E>\nR Result<R, E>::get_return() const noexcept(false) {\n this->expect_valid_state();\n this->expect_return();\n return boost::get<return_type>(this->internal_);\n}\ntemplate<typename R, typename E>\nE Result<R, E>::get_error() const noexcept(false) {\n this->expect_valid_state();\n this->expect_error();\n return boost::get<error_type>(this->internal_);\n}\n\n\/* Assertions *\/\n\ntemplate<typename R, typename E>\nvoid Result<R, E>::expect_valid_state() const noexcept(false) {\n if (this->internal_.empty()) {\n \/\/ if this happens, it means the underlying boost variant\n \/\/ is empty. This should never happen!\n throw\n std::logic_error(\"this object is not in a valid state\");\n }\n}\ntemplate<typename R, typename E>\nvoid Result<R, E>::expect_return() const noexcept(false) {\n if (this->is_error()) {\n throw std::logic_error(\"attempt to read the return of an error\");\n }\n}\ntemplate<typename R, typename E>\nvoid Result<R, E>::expect_error() const noexcept(false) {\n if (this->is_ok()) {\n throw std::logic_error(\"attempt to read the error of a valid result\");\n }\n}\n\n#endif \/* ! RESULT_HPP_ *\/\n\n\/* vim: set ts=2 sw=2 et: *\/\n<commit_msg>allow copy constructor of the result type<commit_after>\/**\n * @file Result.hpp\n * @author Nicolas Di Prima <nicolas@di-prima.fr>\n * @date 2016\/05\/22\n * @copyright 2016, Nicolas Di Prima. All rights reserved.\n *\n * Redistribution and use in source and binary forms, with or without\n * modification, are permitted provided that the following conditions\n * are met:\n *\n * 1. Redistributions of source code must retain the above copyright\n * notice, this list of conditions and the following disclaimer.\n * 2. Redistributions in binary form must reproduce the above copyright\n * notice, this list of conditions and the following disclaimer in the\n * documentation and\/or other materials provided with the distribution.\n * 3. Neither the name of the author nor the names of his 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 REGENTS 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 AUTHORS 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 * @brief define a templated type as place holder for a result of a given\n * type or an error.\n *\n * The main idea is to provide code and APIs as simple to read and maintain\n * as possible. It is too often difficult to determine what a given function\n * may do, the kind of error it may throw etc...\n *\n * Uses this type to wrap the return values of your function.\n *\n * For example:\n *\n * @code{cpp}\n * \/\/ from the following line:\n * int devide_1(int input_1, int input_2, int* output);\n *\n * \/\/ to the function\n * Result<int> devide_2(int input_1, int input_2) {\n * if (!input_2) {\n * return std::domain_error(\"division by zero\");\n * }\n * return input_1 \/ input_2;\n * }\n * @encode\n *\n * And it is also very simple to use:\n *\n * @code{cpp}\n * \/\/ you can simply unwrap it (will throw if error)\n * int res = divide_2(2, 2).unwrap();\n * @encode\n * @code{cpp}\n * \/\/ override with you own exception if needed\n * int res = divide_2(2, 0).except(std::logic_error(\"silly me!\"));\n * @encode\n *\n *\/\n#ifndef RESULT_HPP_\n# define RESULT_HPP_\n\n# include <exception>\n# include <stdexcept>\n# include <utility>\n# include <type_traits>\n\n# include <boost\/variant\/variant.hpp>\n# include <boost\/variant\/get.hpp>\n\n\/* Helper Macros *********************************************************** *\/\n\n\/\/\/ @macro TRY\n\/\/\/ @brief helper to unwrap a Result without throwing an exception (but\n\/\/\/ propagating the error.\n\/\/\/\n\/\/\/ @code{cpp}\n\/\/\/ Result<int> my_func1();\n\/\/\/ Result<int> my_func2() {\n\/\/\/ int i = TRY(my_func1());\n\/\/\/ return i % 2;\n\/\/\/ }\n\/\/\/ @encode\n\/\/\/\n\/\/\/ include this header file with defined **DONT_DEFINE_TRY_MACRO** if you\n\/\/\/ want to define you own one (i.e. add more information along your\n\/\/\/ exception (such as a stack trace?)).\n\/\/\/\n# if !defined(DONT_DEFINE_TRY_MACRO)\n# define TRY(expr) \\\n ({ \\\n auto res = expr; \\\n if (res.is_error()) { \\\n return res; \\\n } \\\n res.unwrap(); \\\n })\n# endif \/\/ ! DONT_DEFINE_TRY_MACRO\n\n\/* Result Class ************************************************************ *\/\n\n\/**\n * @class Result\n * @brief placeholder for variant type (result or error)\n *\/\ntemplate<typename R, typename E = std::exception>\nclass Result {\n static_assert( std::is_base_of<std::exception, E>::value\n , \"expecting error type to be base of std::exception\"\n );\n\n static_assert( std::is_move_constructible<R>::value\n || std::is_copy_constructible<R>::value\n , \"The result type must be move constructible or copy constructible\"\n );\n\n public:\n using return_type = R;\n using error_type = E;\n\n public:\n \/\/\/ @brief Constructors\n \/\/\/ @{\n Result() = delete;\n Result(Result const&) = delete;\n Result(Result&&) = default;\n\n \/\/ non explicit constructor for the return_type\n Result(return_type&&);\n Result(return_type&);\n \/\/ non explicit constructor for the error_type\n Result(error_type&&);\n\n \/\/\/ @brief create a result containing a result object\n \/\/\/\n \/\/\/ This is the only way to create a valid Result.\n \/\/\/\n \/\/\/ @code{cpp}\n \/\/\/ Result<int> my_func() {\n \/\/\/ return Result<int>::Ok(42);\n \/\/\/ }\n \/\/\/ @endcode\n static Result<return_type, error_type> Ok(return_type&&) noexcept(false);\n\n \/\/\/ @brief create a result containing an error object\n \/\/\/\n \/\/\/ This is the only way to create an error Result\n \/\/\/\n \/\/\/ @code{cpp}\n \/\/\/ Result<int> my_func() {\n \/\/\/ return Result<int>::Err(std::logic_error(\"no answer\"));\n \/\/\/ }\n \/\/\/ @encode\n static Result<return_type, error_type> Err(error_type&&) noexcept(false);\n \/\/\/ @}\n\n \/\/\/ @brief Destructor\n \/\/\/ @{\n ~Result() = default;\n \/\/\/ @}\n\n \/\/\/ @brief assignments\n \/\/\/ @{\n Result& operator=(Result const&) = delete;\n Result& operator=(Result&&) = default;\n \/\/\/ @}\n\n \/\/\/ @brief const accessors\n \/\/\/\n \/\/\/ these member function does not modify the underlying state\n \/\/\/\n \/\/\/ @{\n\n \/\/\/ simple function to check if the given Result contains\n \/\/\/ a result.\n bool is_ok() const noexcept;\n\n \/\/\/ simple function to check if the given Result contains\n \/\/\/ an error.\n bool is_error() const noexcept;\n \/\/\/ @}\n\n \/\/\/ @brief non-const accessors (will move the content)\n \/\/\/\n \/\/\/ It means: do not reuse the object...\n \/\/\/\n \/\/\/ @{\n\n \/\/\/ @brief map the result with the given function\n \/\/\/\n \/\/\/ If the given Result contains a return value (not an error)\n \/\/\/ then the given function will be called.\n \/\/\/\n \/\/\/ NB: the function validity is not checked.\n \/\/\/\n \/\/\/ @code{cpp}\n \/\/\/ Result<int> my_func();\n \/\/\/ struct my_data { int i_; my_data(int i) : i_(i) {} };\n \/\/\/ my_data c = my_func()\n \/\/\/ .map_res([](int&& i) { return my_data(i); })\n \/\/\/ .unwrap();\n \/\/\/ @endcode\n template<typename RR, typename F>\n Result<RR, error_type> map_res(F);\n\n \/\/\/ @brief map the error of the given result\n \/\/\/\n \/\/\/ you can update the error with more information or change its type\n template<typename EE, typename F>\n Result<return_type, EE> map_err(F);\n\n \/\/\/ @brief if the Result is successful, call the next function\n template<typename RR, typename F>\n Result<RR, error_type> and_then(F f) {\n if (this->is_error()) {\n return Result<RR, error_type>::Err(this->get_error());\n }\n return f(this->get_return());\n }\n \/\/\/ @brief if the Result has error, call the next function\n template<typename RR, typename F>\n Result<RR, error_type> or_else(F f) {\n if (this->is_ok()) {\n return Result<RR, error_type>::Ok(this->get_return());\n }\n return f(this->get_return());\n }\n\n \/\/\/ @brief get the result (or throw the underlying error)\n return_type unwrap() noexcept(false);\n\n \/\/\/ @brief expected an error (consume the error)\n template<class EE>\n return_type expect(EE const& err) noexcept(false);\n \/\/\/ @}\n\n private:\n\n \/\/ private getters\n return_type get_return() const noexcept(false);\n error_type get_error() const noexcept(false);\n\n \/\/ assertions\n void expect_valid_state() const noexcept(false);\n void expect_return() const noexcept(false);\n void expect_error() const noexcept(false);\n\n private:\n boost::variant<return_type, error_type> internal_;\n};\n\n\/* ***************************************************************************\n * *\n * Implementation *\n * *\n *************************************************************************** *\/\n\n\/* Public members ********************************************************** *\/\n\n\/* Constructors *\/\n\ntemplate<typename R, typename E>\nResult<R, E> Result<R, E>::Ok(R&& ret) noexcept(false) {\n return Result<R, E>(std::move(ret));\n}\ntemplate<typename R, typename E>\nResult<R, E> Result<R, E>::Err(E&& err) noexcept(false) {\n return Result<R, E>(std::move(err));\n}\n\n\/* Const accessors *\/\n\ntemplate<typename R, typename E>\nbool Result<R, E>::is_ok() const noexcept { return this->internal_.which() == 0; }\ntemplate<typename R, typename E>\nbool Result<R, E>::is_error() const noexcept { return this->internal_.which() == 1; }\n\n\/* Non-const accessors *\/\n\ntemplate<typename R, typename E>\ntemplate<typename RR, typename F>\nResult<RR, E> Result<R, E>::map_res(F f) {\n if (this->is_error()) { return Result<RR, E>::Err(this->get_error()); }\n return Result<RR, E>::Ok(f(this->get_return()));\n}\n\ntemplate<typename R, typename E>\ntemplate<typename EE, typename F>\nResult<R, EE> Result<R, E>::map_err(F f) {\n if (this->is_ok()) { return Result<R, EE>::Ok(this->get_return()); }\n return Result<R, EE>::Err(f(this->get_error()));\n}\n\ntemplate<typename R, typename E>\nR Result<R, E>::unwrap() noexcept(false) {\n if (this->is_error()) { throw this->get_error(); }\n return this->get_return();\n}\n\ntemplate<typename R, typename E>\ntemplate<class EE>\nR Result<R, E>::expect(EE const& err) noexcept(false) {\n static_assert( std::is_base_of<std::exception, EE>::value\n , \"expectation can only fail with std::exception or inherited types\"\n );\n this->expect_valid_state();\n if (this->is_error()) { throw err; }\n return this->get_return();\n}\n\n\/* Private members ********************************************************* *\/\n\n\/* constructors *\/\n\ntemplate<typename R, typename E>\nResult<R, E>::Result(R&& ret) : internal_(std::move(ret)) { }\ntemplate<typename R, typename E>\nResult<R, E>::Result(R& ret) : internal_(ret) { }\ntemplate<typename R, typename E>\nResult<R, E>::Result(E&& err) : internal_(std::move(err)) { }\n\n\/* Getters *\/\n\ntemplate<typename R, typename E>\nR Result<R, E>::get_return() const noexcept(false) {\n this->expect_valid_state();\n this->expect_return();\n return boost::get<return_type>(this->internal_);\n}\ntemplate<typename R, typename E>\nE Result<R, E>::get_error() const noexcept(false) {\n this->expect_valid_state();\n this->expect_error();\n return boost::get<error_type>(this->internal_);\n}\n\n\/* Assertions *\/\n\ntemplate<typename R, typename E>\nvoid Result<R, E>::expect_valid_state() const noexcept(false) {\n if (this->internal_.empty()) {\n \/\/ if this happens, it means the underlying boost variant\n \/\/ is empty. This should never happen!\n throw\n std::logic_error(\"this object is not in a valid state\");\n }\n}\ntemplate<typename R, typename E>\nvoid Result<R, E>::expect_return() const noexcept(false) {\n if (this->is_error()) {\n throw std::logic_error(\"attempt to read the return of an error\");\n }\n}\ntemplate<typename R, typename E>\nvoid Result<R, E>::expect_error() const noexcept(false) {\n if (this->is_ok()) {\n throw std::logic_error(\"attempt to read the error of a valid result\");\n }\n}\n\n#endif \/* ! RESULT_HPP_ *\/\n\n\/* vim: set ts=2 sw=2 et: *\/\n<|endoftext|>"} {"text":"<commit_before>\/* Copyright (C) 2005, 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 \"Server.h\"\n\nServer *g_sServer;\n\nServer::Server() {\n\tm_qtsServer = new QTcpServer(this);\n\n\tconnect(m_qtsServer, SIGNAL(newConnection()), this, SLOT(newClient()));\n\n\tif (! m_qtsServer->listen(QHostAddress::Any, 64738))\n\t\tqFatal(\"Server: Listen failed\");\n}\n\nvoid Server::newClient() {\n\tConnection *cCon = new Connection(this, m_qtsServer->nextPendingConnection());\n\n\tshort id;\n\n\tfor(id=1;id<32000;id++)\n\t\tif (! g_sServer->m_qmConnections.contains(id))\n\t\t\tbreak;\n\n\tPlayer *pPlayer = Player::add(id);\n\tm_qmPlayers[cCon] = pPlayer;\n\n\tconnect(cCon, SIGNAL(connectionClosed(Connection *)), this, SLOT(connectionClosed(Connection *)));\n\tconnect(cCon, SIGNAL(message(QByteArray &, Connection *)), this, SLOT(message(QByteArray &, Connection *)));\n}\n\nvoid Server::connectionClosed(Connection *c) {\n\tPlayer *pPlayer = m_qmPlayers.value(c);\n\n\tif (pPlayer->m_sState == Player::Authenticated) {\n\t\tMessageServerLeave mslMsg;\n\t\tmslMsg.m_sPlayerId=pPlayer->m_sId;\n\t\tsendExcept(&mslMsg, c);\n\t}\n\n\tm_qmConnections.remove(pPlayer->m_sId);\n\tm_qmPlayers.remove(c);\n\n\tqWarning(\"Connection closed\");\n\n\tPlayer::remove(pPlayer);\n\n\tdelete pPlayer;\n\tc->deleteLater();\n}\n\nvoid Server::message(QByteArray &qbaMsg, Connection *cCon) {\n\t Message *mMsg = Message::networkToMessage(qbaMsg);\n\t if (mMsg) {\n\t\tmMsg->process(cCon);\n\t } else {\n\t\tcCon->disconnect();\n\t }\n}\n\nvoid Server::sendAll(Message *mMsg) {\n\tsendExcept(mMsg, NULL);\n}\n\nvoid Server::sendExcept(Message *mMsg, Connection *cCon) {\n\tQMapIterator<Connection *, Player *> iPlayers(m_qmPlayers);\n\twhile (iPlayers.hasNext()) {\n\t\tiPlayers.next();\n\t\tif (iPlayers.key() != cCon)\n\t\t\tiPlayers.key()->sendMessage(mMsg);\n\t}\n}\n\n#define MSG_SETUP(st) \\\n Player *pSrcPlayer = g_sServer->m_qmPlayers[cCon]; \\\n Player *pDstPlayer = Player::get(m_sPlayerId); \\\n if (pSrcPlayer->m_sState != st) \\\n \treturn\n\nvoid MessageServerJoin::process(Connection *cCon) {\n\tMSG_SETUP(Player::Connected);\n\n\tpSrcPlayer->m_qsName = m_qsPlayerName;\n\tm_sPlayerId = pSrcPlayer->m_sId;\n\tg_sServer->m_qmConnections[pSrcPlayer->m_sId] = cCon;\n\n\tg_sServer->sendExcept(this, cCon);\n\n\tpSrcPlayer->m_sState = Player::Authenticated;\n\n\tqWarning(\"Player %d:%s joined\", pSrcPlayer->m_sId, m_qsPlayerName.toLatin1().constData());\n\n\tMessageServerJoin msjMsg;\n\n\tQMapIterator<Connection *, Player *> iPlayers(g_sServer->m_qmPlayers);\n\twhile (iPlayers.hasNext()) {\n\t\tiPlayers.next();\n\t\tPlayer *pPlayer = iPlayers.value();\n\t\tmsjMsg.m_sPlayerId = pPlayer->m_sId;\n\t\tmsjMsg.m_qsPlayerName = pPlayer->m_qsName;\n\t\tcCon->sendMessage(&msjMsg);\n\t\tqWarning(\"Notifying of %s\", pPlayer->m_qsName.toLatin1().constData());\n\n\t\tif (pPlayer->m_bMute) {\n\t\t\tMessagePlayerMute mpmMsg;\n\t\t\tmpmMsg.m_sPlayerId = pPlayer->m_sId;\n\t\t\tmpmMsg.m_bMute = pPlayer->m_bMute;\n\t\t\tcCon->sendMessage(&mpmMsg);\n\t\t\tqWarning(\"which is mute\");\n\t\t}\n\t\tif (pPlayer->m_bDeaf) {\n\t\t\tMessagePlayerDeaf mpdMsg;\n\t\t\tmpdMsg.m_sPlayerId = pPlayer->m_sId;\n\t\t\tmpdMsg.m_bDeaf = pPlayer->m_bDeaf;\n\t\t\tcCon->sendMessage(&mpdMsg);\n\t\t\tqWarning(\"which is deaf\");\n\t\t}\n\t}\n}\n\nvoid MessageServerLeave::process(Connection *) {\n}\n\nvoid MessageSpeex::process(Connection *cCon) {\n\tMSG_SETUP(Player::Authenticated);\n\n\tm_sPlayerId = pSrcPlayer->m_sId;\n\t\n\tif (pSrcPlayer->m_bMute)\n\t\treturn;\n\n\tQMapIterator<Connection *, Player *> iPlayers(g_sServer->m_qmPlayers);\n\twhile (iPlayers.hasNext()) {\n\t\tiPlayers.next();\n\t\tPlayer *pPlayer = iPlayers.value();\n\t\tif (! pPlayer->m_bDeaf && pPlayer != pSrcPlayer)\n\t\t\tiPlayers.key()->sendMessage(this);\n\t}\n}\n\nvoid MessagePlayerMute::process(Connection *cCon) {\n\tMSG_SETUP(Player::Authenticated);\n\n\tpDstPlayer->m_bMute = m_bMute;\n\n\tg_sServer->sendAll(this);\n}\n\nvoid MessagePlayerDeaf::process(Connection *cCon) {\n\tMSG_SETUP(Player::Authenticated);\n\n\tpDstPlayer->m_bDeaf = m_bDeaf;\n\n\tg_sServer->sendAll(this);\n}\n\nvoid MessagePlayerKick::process(Connection *cCon) {\n\tMSG_SETUP(Player::Authenticated);\n\n\tcCon = g_sServer->m_qmConnections[m_sPlayerId];\n\tcCon->sendMessage(this);\n\tcCon->disconnect();\n}\n<commit_msg>remove debug output<commit_after>\/* Copyright (C) 2005, 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 \"Server.h\"\n\nServer *g_sServer;\n\nServer::Server() {\n\tm_qtsServer = new QTcpServer(this);\n\n\tconnect(m_qtsServer, SIGNAL(newConnection()), this, SLOT(newClient()));\n\n\tif (! m_qtsServer->listen(QHostAddress::Any, 64738))\n\t\tqFatal(\"Server: Listen failed\");\n}\n\nvoid Server::newClient() {\n\tConnection *cCon = new Connection(this, m_qtsServer->nextPendingConnection());\n\n\tshort id;\n\n\tfor(id=1;id<32000;id++)\n\t\tif (! g_sServer->m_qmConnections.contains(id))\n\t\t\tbreak;\n\n\tPlayer *pPlayer = Player::add(id);\n\tm_qmPlayers[cCon] = pPlayer;\n\n\tconnect(cCon, SIGNAL(connectionClosed(Connection *)), this, SLOT(connectionClosed(Connection *)));\n\tconnect(cCon, SIGNAL(message(QByteArray &, Connection *)), this, SLOT(message(QByteArray &, Connection *)));\n}\n\nvoid Server::connectionClosed(Connection *c) {\n\tPlayer *pPlayer = m_qmPlayers.value(c);\n\n\tif (pPlayer->m_sState == Player::Authenticated) {\n\t\tMessageServerLeave mslMsg;\n\t\tmslMsg.m_sPlayerId=pPlayer->m_sId;\n\t\tsendExcept(&mslMsg, c);\n\t}\n\n\tm_qmConnections.remove(pPlayer->m_sId);\n\tm_qmPlayers.remove(c);\n\n\tqWarning(\"Connection closed\");\n\n\tPlayer::remove(pPlayer);\n\n\tdelete pPlayer;\n\tc->deleteLater();\n}\n\nvoid Server::message(QByteArray &qbaMsg, Connection *cCon) {\n\t Message *mMsg = Message::networkToMessage(qbaMsg);\n\t if (mMsg) {\n\t\tmMsg->process(cCon);\n\t } else {\n\t\tcCon->disconnect();\n\t }\n}\n\nvoid Server::sendAll(Message *mMsg) {\n\tsendExcept(mMsg, NULL);\n}\n\nvoid Server::sendExcept(Message *mMsg, Connection *cCon) {\n\tQMapIterator<Connection *, Player *> iPlayers(m_qmPlayers);\n\twhile (iPlayers.hasNext()) {\n\t\tiPlayers.next();\n\t\tif (iPlayers.key() != cCon)\n\t\t\tiPlayers.key()->sendMessage(mMsg);\n\t}\n}\n\n#define MSG_SETUP(st) \\\n Player *pSrcPlayer = g_sServer->m_qmPlayers[cCon]; \\\n Player *pDstPlayer = Player::get(m_sPlayerId); \\\n if (pSrcPlayer->m_sState != st) \\\n \treturn\n\nvoid MessageServerJoin::process(Connection *cCon) {\n\tMSG_SETUP(Player::Connected);\n\n\tpSrcPlayer->m_qsName = m_qsPlayerName;\n\tm_sPlayerId = pSrcPlayer->m_sId;\n\tg_sServer->m_qmConnections[pSrcPlayer->m_sId] = cCon;\n\n\tg_sServer->sendExcept(this, cCon);\n\n\tpSrcPlayer->m_sState = Player::Authenticated;\n\n\tqWarning(\"Player %d:%s joined\", pSrcPlayer->m_sId, m_qsPlayerName.toLatin1().constData());\n\n\tMessageServerJoin msjMsg;\n\n\tQMapIterator<Connection *, Player *> iPlayers(g_sServer->m_qmPlayers);\n\twhile (iPlayers.hasNext()) {\n\t\tiPlayers.next();\n\t\tPlayer *pPlayer = iPlayers.value();\n\t\tmsjMsg.m_sPlayerId = pPlayer->m_sId;\n\t\tmsjMsg.m_qsPlayerName = pPlayer->m_qsName;\n\t\tcCon->sendMessage(&msjMsg);\n\n\t\tif (pPlayer->m_bMute) {\n\t\t\tMessagePlayerMute mpmMsg;\n\t\t\tmpmMsg.m_sPlayerId = pPlayer->m_sId;\n\t\t\tmpmMsg.m_bMute = pPlayer->m_bMute;\n\t\t\tcCon->sendMessage(&mpmMsg);\n\t\t}\n\t\tif (pPlayer->m_bDeaf) {\n\t\t\tMessagePlayerDeaf mpdMsg;\n\t\t\tmpdMsg.m_sPlayerId = pPlayer->m_sId;\n\t\t\tmpdMsg.m_bDeaf = pPlayer->m_bDeaf;\n\t\t\tcCon->sendMessage(&mpdMsg);\n\t\t}\n\t}\n}\n\nvoid MessageServerLeave::process(Connection *) {\n}\n\nvoid MessageSpeex::process(Connection *cCon) {\n\tMSG_SETUP(Player::Authenticated);\n\n\tm_sPlayerId = pSrcPlayer->m_sId;\n\t\n\tif (pSrcPlayer->m_bMute)\n\t\treturn;\n\n\tQMapIterator<Connection *, Player *> iPlayers(g_sServer->m_qmPlayers);\n\twhile (iPlayers.hasNext()) {\n\t\tiPlayers.next();\n\t\tPlayer *pPlayer = iPlayers.value();\n\t\tif (! pPlayer->m_bDeaf && pPlayer != pSrcPlayer)\n\t\t\tiPlayers.key()->sendMessage(this);\n\t}\n}\n\nvoid MessagePlayerMute::process(Connection *cCon) {\n\tMSG_SETUP(Player::Authenticated);\n\n\tpDstPlayer->m_bMute = m_bMute;\n\n\tg_sServer->sendAll(this);\n}\n\nvoid MessagePlayerDeaf::process(Connection *cCon) {\n\tMSG_SETUP(Player::Authenticated);\n\n\tpDstPlayer->m_bDeaf = m_bDeaf;\n\n\tg_sServer->sendAll(this);\n}\n\nvoid MessagePlayerKick::process(Connection *cCon) {\n\tMSG_SETUP(Player::Authenticated);\n\n\tcCon = g_sServer->m_qmConnections[m_sPlayerId];\n\tcCon->sendMessage(this);\n\tcCon->disconnect();\n}\n<|endoftext|>"} {"text":"<commit_before>\/*************************************************************************\n *\n * $RCSfile: MDatabaseMetaDataHelper.hxx,v $\n *\n * $Revision: 1.4 $\n *\n * last change: $Author: obo $ $Date: 2004-03-17 10:42:12 $\n *\n * The Contents of this file are made available subject to the terms of\n * either of the following licenses\n *\n * - GNU Lesser General Public License Version 2.1\n * - Sun Industry Standards Source License Version 1.1\n *\n * Sun Microsystems Inc., October, 2000\n *\n * GNU Lesser General Public License Version 2.1\n * =============================================\n * Copyright 2000 by Sun Microsystems, Inc.\n * 901 San Antonio Road, Palo Alto, CA 94303, USA\n *\n * This library is free software; you can redistribute it and\/or\n * modify it under the terms of the GNU Lesser General Public\n * License version 2.1, as published by the Free Software Foundation.\n *\n * This library is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU\n * Lesser General Public License for more details.\n *\n * You should have received a copy of the GNU Lesser General Public\n * License along with this library; if not, write to the Free Software\n * Foundation, Inc., 59 Temple Place, Suite 330, Boston,\n * MA 02111-1307 USA\n *\n *\n * Sun Industry Standards Source License Version 1.1\n * =================================================\n * The contents of this file are subject to the Sun Industry Standards\n * Source License Version 1.1 (the \"License\"); You may not use this file\n * except in compliance with the License. You may obtain a copy of the\n * License at http:\/\/www.openoffice.org\/license.html.\n *\n * Software provided under this License is provided on an \"AS IS\" basis,\n * WITHOUT WARRANTY OF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING,\n * WITHOUT LIMITATION, WARRANTIES THAT THE SOFTWARE IS FREE OF DEFECTS,\n * MERCHANTABLE, FIT FOR A PARTICULAR PURPOSE, OR NON-INFRINGING.\n * See the License for the specific provisions governing your rights and\n * obligations concerning the Software.\n *\n * The Initial Developer of the Original Code is: Sun Microsystems, Inc.\n *\n * Copyright: 2000 by Sun Microsystems, Inc.\n *\n * All Rights Reserved.\n *\n * Contributor(s): _______________________________________\n *\n *\n ************************************************************************\/\n\n#ifndef _CONNECTIVITY_MAB_DATABASEMETADATAHELPER_HXX_\n#define _CONNECTIVITY_MAB_DATABASEMETADATAHELPER_HXX_\n\n \/*\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_SDBC_XRESULTSETMETADATASUPPLIER_HPP_\n#include <com\/sun\/star\/sdbc\/XResultSetMetaDataSupplier.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_SDBC_XCOLUMNLOCATE_HPP_\n#include <com\/sun\/star\/sdbc\/XColumnLocate.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_XWARNINGSSUPPLIER_HPP_\n#include <com\/sun\/star\/sdbc\/XWarningsSupplier.hpp>\n#endif\n#ifndef _COM_SUN_STAR_SDBC_XRESULTSETUPDATE_HPP_\n#include <com\/sun\/star\/sdbc\/XResultSetUpdate.hpp>\n#endif\n#ifndef _COM_SUN_STAR_SDBC_XROWUPDATE_HPP_\n#include <com\/sun\/star\/sdbc\/XRowUpdate.hpp>\n#endif\n#ifndef _CPPUHELPER_COMPBASE7_HXX_\n#include <cppuhelper\/compbase7.hxx>\n#endif\n*\/\n#ifndef _COMPHELPER_PROPERTY_ARRAY_HELPER_HXX_\n#include <comphelper\/proparrhlp.hxx>\n#endif\n \/*\n#ifndef _CONNECTIVITY_FILE_ASTATEMENT_HXX_\n#include \"file\/FStatement.hxx\"\n#endif\n#ifndef _CONNECTIVITY_COMMONTOOLS_HXX_\n#include \"connectivity\/CommonTools.hxx\"\n#endif\n*\/\n#ifndef _COMPHELPER_PROPERTYCONTAINER_HXX_\n#include <comphelper\/propertycontainer.hxx>\n#endif\n\n#ifndef _CONNECTIVITY_FDATABASEMETADATARESULTSET_HXX_\n#include \"FDatabaseMetaDataResultSet.hxx\"\n#endif\n\n#ifndef _CONNECTIVITY_MAB_CONNECTION_HXX_\n#include <MConnection.hxx>\n#endif\n#ifndef _COM_SUN_STAR_UNO_SEQUENCE_HXX_\n#include <com\/sun\/star\/uno\/Sequence.hxx>\n#endif\n\n\nnamespace connectivity\n{\n namespace mozab\n {\n class MDatabaseMetaDataHelper\n {\n public:\n MDatabaseMetaDataHelper( );\n ~MDatabaseMetaDataHelper();\n\n sal_Bool getTableStrings( OConnection* _pCon,\n ::std::vector< ::rtl::OUString >& _rStrings,\n ::std::vector< ::rtl::OUString >& _rTypes,\n sal_Bool forceLoad = sal_False );\n\n sal_Bool getTables( OConnection* _pCon,\n const ::rtl::OUString& tableNamePattern,\n const ::com::sun::star::uno::Sequence< ::rtl::OUString >& types,\n ODatabaseMetaDataResultSet::ORows& _rRows);\n\n const ::rtl::OUString& getErrorString() { return m_aErrorString; }\n\n sal_Bool testLDAPConnection( OConnection* _pCon );\n\n private:\n sal_Bool m_bProfileExists ;\n ::std::vector< ::rtl::OUString > m_aTableNames;\n ::std::vector< ::rtl::OUString > m_aTableTypes;\n ::rtl::OUString m_aErrorString;\n\n void setAbSpecificError( OConnection* _pCon, sal_Bool bGivenURI );\n };\n }\n\n}\n#endif \/\/ _CONNECTIVITY_MAB_DATABASEMETADATAHELPER_HXX_\n\n<commit_msg>INTEGRATION: CWS mozab04 (1.4.2); FILE MERGED 2004\/04\/12 10:15:54 windly 1.4.2.1: #i6883# make mozab driver threadsafe<commit_after>\/*************************************************************************\n *\n * $RCSfile: MDatabaseMetaDataHelper.hxx,v $\n *\n * $Revision: 1.5 $\n *\n * last change: $Author: hjs $ $Date: 2004-06-25 18:31:40 $\n *\n * The Contents of this file are made available subject to the terms of\n * either of the following licenses\n *\n * - GNU Lesser General Public License Version 2.1\n * - Sun Industry Standards Source License Version 1.1\n *\n * Sun Microsystems Inc., October, 2000\n *\n * GNU Lesser General Public License Version 2.1\n * =============================================\n * Copyright 2000 by Sun Microsystems, Inc.\n * 901 San Antonio Road, Palo Alto, CA 94303, USA\n *\n * This library is free software; you can redistribute it and\/or\n * modify it under the terms of the GNU Lesser General Public\n * License version 2.1, as published by the Free Software Foundation.\n *\n * This library is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU\n * Lesser General Public License for more details.\n *\n * You should have received a copy of the GNU Lesser General Public\n * License along with this library; if not, write to the Free Software\n * Foundation, Inc., 59 Temple Place, Suite 330, Boston,\n * MA 02111-1307 USA\n *\n *\n * Sun Industry Standards Source License Version 1.1\n * =================================================\n * The contents of this file are subject to the Sun Industry Standards\n * Source License Version 1.1 (the \"License\"); You may not use this file\n * except in compliance with the License. You may obtain a copy of the\n * License at http:\/\/www.openoffice.org\/license.html.\n *\n * Software provided under this License is provided on an \"AS IS\" basis,\n * WITHOUT WARRANTY OF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING,\n * WITHOUT LIMITATION, WARRANTIES THAT THE SOFTWARE IS FREE OF DEFECTS,\n * MERCHANTABLE, FIT FOR A PARTICULAR PURPOSE, OR NON-INFRINGING.\n * See the License for the specific provisions governing your rights and\n * obligations concerning the Software.\n *\n * The Initial Developer of the Original Code is: Sun Microsystems, Inc.\n *\n * Copyright: 2000 by Sun Microsystems, Inc.\n *\n * All Rights Reserved.\n *\n * Contributor(s): _______________________________________\n *\n *\n ************************************************************************\/\n\n#ifndef _CONNECTIVITY_MAB_DATABASEMETADATAHELPER_HXX_\n#define _CONNECTIVITY_MAB_DATABASEMETADATAHELPER_HXX_\n\n \/*\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_SDBC_XRESULTSETMETADATASUPPLIER_HPP_\n#include <com\/sun\/star\/sdbc\/XResultSetMetaDataSupplier.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_SDBC_XCOLUMNLOCATE_HPP_\n#include <com\/sun\/star\/sdbc\/XColumnLocate.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_XWARNINGSSUPPLIER_HPP_\n#include <com\/sun\/star\/sdbc\/XWarningsSupplier.hpp>\n#endif\n#ifndef _COM_SUN_STAR_SDBC_XRESULTSETUPDATE_HPP_\n#include <com\/sun\/star\/sdbc\/XResultSetUpdate.hpp>\n#endif\n#ifndef _COM_SUN_STAR_SDBC_XROWUPDATE_HPP_\n#include <com\/sun\/star\/sdbc\/XRowUpdate.hpp>\n#endif\n#ifndef _CPPUHELPER_COMPBASE7_HXX_\n#include <cppuhelper\/compbase7.hxx>\n#endif\n*\/\n#ifndef _COMPHELPER_PROPERTY_ARRAY_HELPER_HXX_\n#include <comphelper\/proparrhlp.hxx>\n#endif\n \/*\n#ifndef _CONNECTIVITY_FILE_ASTATEMENT_HXX_\n#include \"file\/FStatement.hxx\"\n#endif\n#ifndef _CONNECTIVITY_COMMONTOOLS_HXX_\n#include \"connectivity\/CommonTools.hxx\"\n#endif\n*\/\n#ifndef _COMPHELPER_PROPERTYCONTAINER_HXX_\n#include <comphelper\/propertycontainer.hxx>\n#endif\n\n#ifndef _CONNECTIVITY_FDATABASEMETADATARESULTSET_HXX_\n#include \"FDatabaseMetaDataResultSet.hxx\"\n#endif\n\n#ifndef _CONNECTIVITY_MAB_CONNECTION_HXX_\n#include <MConnection.hxx>\n#endif\n#ifndef _COM_SUN_STAR_UNO_SEQUENCE_HXX_\n#include <com\/sun\/star\/uno\/Sequence.hxx>\n#endif\n\n\nnamespace connectivity\n{\n namespace mozab\n {\n class MDatabaseMetaDataHelper\n {\n public:\n MDatabaseMetaDataHelper( );\n ~MDatabaseMetaDataHelper();\n\n \/\/PROXIED_FUNCTION\n sal_Bool getTableStrings( OConnection* _pCon,\n ::std::vector< ::rtl::OUString >& _rStrings,\n ::std::vector< ::rtl::OUString >& _rTypes);\n\n sal_Bool getTables( OConnection* _pCon,\n const ::rtl::OUString& tableNamePattern,\n const ::com::sun::star::uno::Sequence< ::rtl::OUString >& types,\n ODatabaseMetaDataResultSet::ORows& _rRows);\n\n const ::rtl::OUString& getErrorString() { return m_aErrorString; }\n\n sal_Bool testLDAPConnection( OConnection* _pCon );\n sal_Bool NewAddressBook( OConnection* _pCon,const ::rtl::OUString & aTableName);\n\n private:\n sal_Bool m_bProfileExists ;\n ::std::vector< ::rtl::OUString > m_aTableNames;\n ::std::vector< ::rtl::OUString > m_aTableTypes;\n ::rtl::OUString m_aErrorString;\n void setAbSpecificError( OConnection* _pCon, sal_Bool bGivenURI );\n };\n }\n\n}\n#endif \/\/ _CONNECTIVITY_MAB_DATABASEMETADATAHELPER_HXX_\n\n<|endoftext|>"} {"text":"<commit_before>\/\/ -*- C++ -*-\n\/\/===----------------------------------------------------------------------===\/\/\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\/\/ <regex>\n\n\/\/ template <class charT> struct regex_traits;\n\n\/\/ charT translate_nocase(charT c) const;\n\n\/\/ REQUIRES: locale.en_US.UTF-8\n\n\/\/ XFAIL: with_system_cxx_lib=macosx10.7\n\/\/ XFAIL: with_system_cxx_lib=macosx10.8\n\n\/\/ TODO: investigation needed\n\/\/ XFAIL: linux-gnu\n\n#include <regex>\n#include <cassert>\n\n#include \"test_macros.h\"\n#include \"platform_support.h\"\n\nint main()\n{\n {\n std::regex_traits<char> t;\n assert(t.translate_nocase(' ') == ' ');\n assert(t.translate_nocase('A') == 'a');\n assert(t.translate_nocase('\\x07') == '\\x07');\n assert(t.translate_nocase('.') == '.');\n assert(t.translate_nocase('a') == 'a');\n assert(t.translate_nocase('1') == '1');\n assert(t.translate_nocase('\\xDA') == '\\xDA');\n assert(t.translate_nocase('\\xFA') == '\\xFA');\n t.imbue(std::locale(LOCALE_en_US_UTF_8));\n assert(t.translate_nocase(' ') == ' ');\n assert(t.translate_nocase('A') == 'a');\n assert(t.translate_nocase('\\x07') == '\\x07');\n assert(t.translate_nocase('.') == '.');\n assert(t.translate_nocase('a') == 'a');\n assert(t.translate_nocase('1') == '1');\n assert(t.translate_nocase('\\xDA') == '\\xFA');\n assert(t.translate_nocase('\\xFA') == '\\xFA');\n }\n {\n std::regex_traits<wchar_t> t;\n assert(t.translate_nocase(L' ') == L' ');\n assert(t.translate_nocase(L'A') == L'a');\n assert(t.translate_nocase(L'\\x07') == L'\\x07');\n assert(t.translate_nocase(L'.') == L'.');\n assert(t.translate_nocase(L'a') == L'a');\n assert(t.translate_nocase(L'1') == L'1');\n assert(t.translate_nocase(L'\\xDA') == L'\\xDA');\n assert(t.translate_nocase(L'\\xFA') == L'\\xFA');\n t.imbue(std::locale(LOCALE_en_US_UTF_8));\n assert(t.translate_nocase(L' ') == L' ');\n assert(t.translate_nocase(L'A') == L'a');\n assert(t.translate_nocase(L'\\x07') == L'\\x07');\n assert(t.translate_nocase(L'.') == L'.');\n assert(t.translate_nocase(L'a') == L'a');\n assert(t.translate_nocase(L'1') == L'1');\n assert(t.translate_nocase(L'\\xDA') == L'\\xFA');\n assert(t.translate_nocase(L'\\xFA') == L'\\xFA');\n }\n}\n<commit_msg>[test] [re.traits] Remove asserts failing due to invalid UTF-8<commit_after>\/\/ -*- C++ -*-\n\/\/===----------------------------------------------------------------------===\/\/\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\/\/ <regex>\n\n\/\/ template <class charT> struct regex_traits;\n\n\/\/ charT translate_nocase(charT c) const;\n\n\/\/ REQUIRES: locale.en_US.UTF-8\n\n\/\/ XFAIL: with_system_cxx_lib=macosx10.7\n\/\/ XFAIL: with_system_cxx_lib=macosx10.8\n\n#include <regex>\n#include <cassert>\n\n#include \"test_macros.h\"\n#include \"platform_support.h\"\n\nint main()\n{\n {\n std::regex_traits<char> t;\n assert(t.translate_nocase(' ') == ' ');\n assert(t.translate_nocase('A') == 'a');\n assert(t.translate_nocase('\\x07') == '\\x07');\n assert(t.translate_nocase('.') == '.');\n assert(t.translate_nocase('a') == 'a');\n assert(t.translate_nocase('1') == '1');\n assert(t.translate_nocase('\\xDA') == '\\xDA');\n assert(t.translate_nocase('\\xFA') == '\\xFA');\n t.imbue(std::locale(LOCALE_en_US_UTF_8));\n assert(t.translate_nocase(' ') == ' ');\n assert(t.translate_nocase('A') == 'a');\n assert(t.translate_nocase('\\x07') == '\\x07');\n assert(t.translate_nocase('.') == '.');\n assert(t.translate_nocase('a') == 'a');\n assert(t.translate_nocase('1') == '1');\n }\n {\n std::regex_traits<wchar_t> t;\n assert(t.translate_nocase(L' ') == L' ');\n assert(t.translate_nocase(L'A') == L'a');\n assert(t.translate_nocase(L'\\x07') == L'\\x07');\n assert(t.translate_nocase(L'.') == L'.');\n assert(t.translate_nocase(L'a') == L'a');\n assert(t.translate_nocase(L'1') == L'1');\n assert(t.translate_nocase(L'\\xDA') == L'\\xDA');\n assert(t.translate_nocase(L'\\xFA') == L'\\xFA');\n t.imbue(std::locale(LOCALE_en_US_UTF_8));\n assert(t.translate_nocase(L' ') == L' ');\n assert(t.translate_nocase(L'A') == L'a');\n assert(t.translate_nocase(L'\\x07') == L'\\x07');\n assert(t.translate_nocase(L'.') == L'.');\n assert(t.translate_nocase(L'a') == L'a');\n assert(t.translate_nocase(L'1') == L'1');\n assert(t.translate_nocase(L'\\xDA') == L'\\xFA');\n assert(t.translate_nocase(L'\\xFA') == L'\\xFA');\n }\n}\n<|endoftext|>"} {"text":"<commit_before><commit_msg>Parse delegate options in a separate function<commit_after><|endoftext|>"} {"text":"<commit_before>\/*\n * Funambol is a mobile platform developed by Funambol, Inc.\n * Copyright (C) 2003 - 2007 Funambol, Inc.\n *\n * This program is free software; you can redistribute it and\/or modify it under\n * the terms of the GNU Affero General Public License version 3 as published by\n * the Free Software Foundation with the addition of the following permission\n * added to Section 15 as permitted in Section 7(a): FOR ANY PART OF THE COVERED\n * WORK IN WHICH THE COPYRIGHT IS OWNED BY FUNAMBOL, FUNAMBOL DISCLAIMS THE\n * WARRANTY OF NON INFRINGEMENT OF THIRD PARTY RIGHTS.\n *\n * This program is distributed in the hope that it will be useful, but WITHOUT\n * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS\n * FOR A PARTICULAR PURPOSE. See the GNU General Public License for more\n * details.\n *\n * You should have received a copy of the GNU Affero General Public License\n * along with this program; if not, see http:\/\/www.gnu.org\/licenses or write to\n * the Free Software Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston,\n * MA 02110-1301 USA.\n *\n * You can contact Funambol, Inc. headquarters at 643 Bair Island Road, Suite\n * 305, Redwood City, CA 94063, USA, or at email address info@funambol.com.\n *\n * The interactive user interfaces in modified source and object code versions\n * of this program must display Appropriate Legal Notices, as required under\n * Section 5 of the GNU Affero General Public License version 3.\n *\n * In accordance with Section 7(b) of the GNU Affero General Public License\n * version 3, these Appropriate Legal Notices must retain the display of the\n * \"Powered by Funambol\" logo. If the display of the logo is not reasonably\n * feasible for technical reasons, the Appropriate Legal Notices must display\n * the words \"Powered by Funambol\".\n *\/\n\n#include <cppunit\/extensions\/TestFactoryRegistry.h>\n#include <cppunit\/extensions\/HelperMacros.h>\n\n#include \"base\/fscapi.h\"\n#include \"base\/Log.h\"\n#include \"base\/util\/StringBuffer.h\"\n#include \"base\/globalsdef.h\"\n\n#include \"spds\/SyncManagerConfig.h\"\n#include \"spds\/SyncReport.h\"\n#include \"spds\/SyncManager.h\"\n#include \"spds\/spdsutils.h\"\n#include \"spds\/SyncMLBuilder.h\"\n\nUSE_NAMESPACE\n\n#define TEST_SERVER_URL \"http:\/\/my.funambol\/sync\"\n\n#ifdef _WIN32\n# define TESTDIR \".\"\n#else\n# define TESTDIR \"testcases\"\n#endif\n\n\nclass ServerDevInfTest : public CppUnit::TestFixture {\n\n CPPUNIT_TEST_SUITE(ServerDevInfTest);\n\n CPPUNIT_TEST(testAskServerDevInf);\n CPPUNIT_TEST(testPrepareServerDevInf);\n CPPUNIT_TEST(testFormatServerDevInf);\n CPPUNIT_TEST(testProcessServerDevInf1);\n CPPUNIT_TEST(testProcessServerDevInf2);\n\n CPPUNIT_TEST_SUITE_END();\n\npublic:\n void setUp() {\n\n report.setSyncSourceReports(config);\n\n }\n\n void tearDown() {\n\n }\n\nprivate:\n\n SyncManagerConfig config;\n SyncReport report;\n\n\n \/\/\n \/\/ Test: syncManager::askServerDevInf()\n \/\/ ------------------------------------\n void testAskServerDevInf() {\n\n bool ret = false;\n SyncManager syncManager(config, report);\n\n \/\/ Server url unchanged for tests 1. 2. 3.\n config.setSyncURL (TEST_SERVER_URL);\n config.setServerLastSyncURL(TEST_SERVER_URL);\n\n\n \/\/ 1. No Server swv available in config: expect true\n config.setForceServerDevInfo(false);\n config.setServerSwv(\"\");\n ret = syncManager.askServerDevInf();\n CPPUNIT_ASSERT(ret);\n\n \/\/ 2. Server swv available in config: expect false\n config.setForceServerDevInfo(false);\n config.setServerSwv(\"8.0.0\");\n ret = syncManager.askServerDevInf();\n CPPUNIT_ASSERT(!ret);\n\n \/\/ 3. Force it via the config flag: expect true\n config.setForceServerDevInfo(true);\n config.setServerSwv(\"8.0.0\");\n ret = syncManager.askServerDevInf();\n CPPUNIT_ASSERT(ret);\n\n \/\/ 4. Change the server URL: expect true\n config.setForceServerDevInfo(false);\n config.setServerSwv(\"8.0.0\");\n StringBuffer urlModified = config.getSyncURL();\n urlModified.append(\"_mod\");\n config.setServerLastSyncURL(urlModified.c_str());\n ret = syncManager.askServerDevInf();\n CPPUNIT_ASSERT(ret);\n }\n\n\n \/\/\n \/\/ Test: syncMLBuilder::prepareServerDevInf()\n \/\/ ------------------------------------------\n void testPrepareServerDevInf() {\n\n SyncMLBuilder syncMLBuilder;\n AbstractCommand* command = syncMLBuilder.prepareServerDevInf();\n CPPUNIT_ASSERT(command);\n\n \/\/ Check it's a Get\n StringBuffer name = command->getName();\n CPPUNIT_ASSERT(name == GET);\n Get* get = (Get*)command;\n CPPUNIT_ASSERT(get);\n\n\n \/\/ Check the meta type = \"application\/vnd.syncml-devinf+xml\"\n Meta* meta = get->getMeta();\n CPPUNIT_ASSERT(meta);\n StringBuffer type = meta->getType();\n CPPUNIT_ASSERT(type == DEVINF_FORMAT);\n\n ArrayList* items = get->getItems();\n CPPUNIT_ASSERT(items);\n\n \/\/ Expect only 1 item\n CPPUNIT_ASSERT_EQUAL(1, items->size());\n Item* item = (Item*)items->get(0);\n CPPUNIT_ASSERT(item);\n\n \/\/ Check the target locURI = \".\/devinf12\"\n Target* target = item->getTarget();\n CPPUNIT_ASSERT(target);\n\n StringBuffer locURI = target->getLocURI();\n CPPUNIT_ASSERT(locURI == DEVINF_URI);\n\n\n delete command;\n }\n\n \/\/\n \/\/ Test: format the Get command to obtain the Server capabilities\n \/\/ --------------------------------------------------------------\n void testFormatServerDevInf() {\n\n SyncMLBuilder syncMLBuilder;\n ArrayList commands;\n AbstractCommand* get = syncMLBuilder.prepareServerDevInf();\n CPPUNIT_ASSERT(get);\n \n commands.add(*get);\n delete get;\n SyncML* syncml = syncMLBuilder.prepareInitObject(NULL, NULL, &commands);\n CPPUNIT_ASSERT(syncml);\n\n char* msg = syncMLBuilder.prepareMsg(syncml);\n CPPUNIT_ASSERT(msg);\n\n\n \/\/ Check if this part of XML is included in the SyncML msg\n int cmdID = 1;\n StringBuffer expected;\n expected.sprintf(\"<Get><CmdID>%d<\/CmdID><Meta><Type xmlns=\\\"syncml:metinf\\\">%s<\/Type><\/Meta><Item><Target><LocURI>%s<\/LocURI><\/Target><\/Item><\/Get>\", \n cmdID, DEVINF_FORMAT, DEVINF_URI);\n \n StringBuffer syncmlMsg(msg);\n syncmlMsg.replaceAll(\"\\n\",\"\");\n size_t pos = syncmlMsg.find(expected);\n CPPUNIT_ASSERT(pos != StringBuffer::npos);\n\n delete [] msg;\n deleteSyncML(&syncml);\n }\n\n\n\n \/\/\n \/\/ Test: syncMLProcessor::processServerDevInf()\n \/\/ This is a sample XML with devInf Results from Funambol Server\n \/\/ -------------------------------------------------------------\n void testProcessServerDevInf1() {\n\n \/\/ Load and parse the sample XML with <Results> command from Server\n config.setSyncURL(TEST_SERVER_URL);\n processDevInf(\"devInfResults.xml\");\n\n \/\/ Check the config has been filled as expected\n StringBuffer url1 = config.getSyncURL();\n StringBuffer url2 = config.getServerLastSyncURL();\n CPPUNIT_ASSERT(url1 == url2);\n\n int iVal;\n bool bVal;\n StringBuffer value;\n value = config.getServerSwv(); CPPUNIT_ASSERT(value == \"7.1.1\");\n value = config.getServerFwv(); CPPUNIT_ASSERT(value == \"-\");\n value = config.getServerHwv(); CPPUNIT_ASSERT(value == \"-\");\n value = config.getServerMan(); CPPUNIT_ASSERT(value == \"Funambol\");\n value = config.getServerMod(); CPPUNIT_ASSERT(value == \"DS Server ComEd\");\n value = config.getServerOem(); CPPUNIT_ASSERT(value == \"-\");\n value = config.getServerDevID(); CPPUNIT_ASSERT(value == \"funambol\");\n value = config.getServerDevType(); CPPUNIT_ASSERT(value == \"server\");\n value = config.getServerVerDTD(); CPPUNIT_ASSERT(value == \"1.2\");\n bVal = config.getServerUtc(); CPPUNIT_ASSERT(bVal == true);\n bVal = config.getServerLoSupport(); CPPUNIT_ASSERT(bVal == true);\n bVal = config.getServerNocSupport(); CPPUNIT_ASSERT(bVal == true);\n iVal = config.getServerSmartSlowSync(); CPPUNIT_ASSERT(iVal == 1);\n\n }\n\n\n \/\/\n \/\/ Test: syncMLProcessor::processServerDevInf()\n \/\/ This is a sample XML with devInf Results from OMA specs\n \/\/ -------------------------------------------------------\n void testProcessServerDevInf2() {\n\n \/\/ Load and parse the sample XML with <Results> command from Server\n config.setSyncURL(TEST_SERVER_URL);\n processDevInf(\"devInfResults2.xml\");\n\n \/\/ Check the config has been filled as expected\n StringBuffer url1 = config.getSyncURL();\n StringBuffer url2 = config.getServerLastSyncURL();\n CPPUNIT_ASSERT(url1 == url2);\n\n int iVal;\n bool bVal;\n StringBuffer value;\n value = config.getServerSwv(); CPPUNIT_ASSERT(value == \"1.0.0\");\n value = config.getServerFwv(); CPPUNIT_ASSERT(value == \"1.0.1\");\n value = config.getServerHwv(); CPPUNIT_ASSERT(value == \"1.0.2\");\n value = config.getServerMan(); CPPUNIT_ASSERT(value == \"Small Factory, Ltd.\");\n value = config.getServerMod(); CPPUNIT_ASSERT(value == \"Tiny Server\");\n value = config.getServerOem(); CPPUNIT_ASSERT(value == \"Tiny Shop\");\n value = config.getServerDevID(); CPPUNIT_ASSERT(value == \"485749KR\");\n value = config.getServerDevType(); CPPUNIT_ASSERT(value == \"Server\");\n value = config.getServerVerDTD(); CPPUNIT_ASSERT(value == \"1.2\");\n bVal = config.getServerUtc(); CPPUNIT_ASSERT(bVal == true);\n bVal = config.getServerLoSupport(); CPPUNIT_ASSERT(bVal == true);\n bVal = config.getServerNocSupport(); CPPUNIT_ASSERT(bVal == true);\n iVal = config.getServerSmartSlowSync(); CPPUNIT_ASSERT(iVal == 2);\n }\n\n\n \/**\n * Utility: will process Server devInf from file 'filename', \n * store data in the config\n *\/\n void processDevInf(const StringBuffer& filename) {\n\n StringBuffer xml;\n loadTestFile(filename.c_str(), xml);\n\n ArrayList commands;\n Parser::getCommands(commands, xml);\n CPPUNIT_ASSERT_MESSAGE(\"Failed to parse devInf Results\", (commands.size() == 1) );\n\n \/\/ Process the Server devInf\n SyncMLProcessor syncMLProcessor;\n AbstractCommand* cmd = (AbstractCommand*)commands.get(0);\n bool found = syncMLProcessor.processServerDevInf(cmd, config);\n CPPUNIT_ASSERT(found);\n }\n\n\n \/**\n * Load a SyncML message from file, parse and reformat it\n * and return the original message and the converted one.\n *\/\n void loadTestFile(const char* fileName, StringBuffer& ret) {\n char* message;\n size_t len;\n\n StringBuffer path;\n path.sprintf(\"%s\/%s\", TESTDIR, fileName);\n\n bool fileLoaded = readFile(path, &message, &len, false);\n CPPUNIT_ASSERT_MESSAGE(\"Failed to load XML\", fileLoaded);\n \n ret = message;\n delete [] message;\n }\n\n\n};\n\n\nCPPUNIT_TEST_SUITE_REGISTRATION( ServerDevInfTest );\n<commit_msg>fixed ServerDevInfTest: if XSmartSlowSync not defined by Server, its value is 0 (smartslow not supported)<commit_after>\/*\n * Funambol is a mobile platform developed by Funambol, Inc.\n * Copyright (C) 2003 - 2007 Funambol, Inc.\n *\n * This program is free software; you can redistribute it and\/or modify it under\n * the terms of the GNU Affero General Public License version 3 as published by\n * the Free Software Foundation with the addition of the following permission\n * added to Section 15 as permitted in Section 7(a): FOR ANY PART OF THE COVERED\n * WORK IN WHICH THE COPYRIGHT IS OWNED BY FUNAMBOL, FUNAMBOL DISCLAIMS THE\n * WARRANTY OF NON INFRINGEMENT OF THIRD PARTY RIGHTS.\n *\n * This program is distributed in the hope that it will be useful, but WITHOUT\n * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS\n * FOR A PARTICULAR PURPOSE. See the GNU General Public License for more\n * details.\n *\n * You should have received a copy of the GNU Affero General Public License\n * along with this program; if not, see http:\/\/www.gnu.org\/licenses or write to\n * the Free Software Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston,\n * MA 02110-1301 USA.\n *\n * You can contact Funambol, Inc. headquarters at 643 Bair Island Road, Suite\n * 305, Redwood City, CA 94063, USA, or at email address info@funambol.com.\n *\n * The interactive user interfaces in modified source and object code versions\n * of this program must display Appropriate Legal Notices, as required under\n * Section 5 of the GNU Affero General Public License version 3.\n *\n * In accordance with Section 7(b) of the GNU Affero General Public License\n * version 3, these Appropriate Legal Notices must retain the display of the\n * \"Powered by Funambol\" logo. If the display of the logo is not reasonably\n * feasible for technical reasons, the Appropriate Legal Notices must display\n * the words \"Powered by Funambol\".\n *\/\n\n#include <cppunit\/extensions\/TestFactoryRegistry.h>\n#include <cppunit\/extensions\/HelperMacros.h>\n\n#include \"base\/fscapi.h\"\n#include \"base\/Log.h\"\n#include \"base\/util\/StringBuffer.h\"\n#include \"base\/globalsdef.h\"\n\n#include \"spds\/SyncManagerConfig.h\"\n#include \"spds\/SyncReport.h\"\n#include \"spds\/SyncManager.h\"\n#include \"spds\/spdsutils.h\"\n#include \"spds\/SyncMLBuilder.h\"\n\nUSE_NAMESPACE\n\n#define TEST_SERVER_URL \"http:\/\/my.funambol\/sync\"\n\n#ifdef _WIN32\n# define TESTDIR \".\"\n#else\n# define TESTDIR \"testcases\"\n#endif\n\n\nclass ServerDevInfTest : public CppUnit::TestFixture {\n\n CPPUNIT_TEST_SUITE(ServerDevInfTest);\n\n CPPUNIT_TEST(testAskServerDevInf);\n CPPUNIT_TEST(testPrepareServerDevInf);\n CPPUNIT_TEST(testFormatServerDevInf);\n CPPUNIT_TEST(testProcessServerDevInf1);\n CPPUNIT_TEST(testProcessServerDevInf2);\n\n CPPUNIT_TEST_SUITE_END();\n\npublic:\n void setUp() {\n\n report.setSyncSourceReports(config);\n\n }\n\n void tearDown() {\n\n }\n\nprivate:\n\n SyncManagerConfig config;\n SyncReport report;\n\n\n \/\/\n \/\/ Test: syncManager::askServerDevInf()\n \/\/ ------------------------------------\n void testAskServerDevInf() {\n\n bool ret = false;\n SyncManager syncManager(config, report);\n\n \/\/ Server url unchanged for tests 1. 2. 3.\n config.setSyncURL (TEST_SERVER_URL);\n config.setServerLastSyncURL(TEST_SERVER_URL);\n\n\n \/\/ 1. No Server swv available in config: expect true\n config.setForceServerDevInfo(false);\n config.setServerSwv(\"\");\n ret = syncManager.askServerDevInf();\n CPPUNIT_ASSERT(ret);\n\n \/\/ 2. Server swv available in config: expect false\n config.setForceServerDevInfo(false);\n config.setServerSwv(\"8.0.0\");\n ret = syncManager.askServerDevInf();\n CPPUNIT_ASSERT(!ret);\n\n \/\/ 3. Force it via the config flag: expect true\n config.setForceServerDevInfo(true);\n config.setServerSwv(\"8.0.0\");\n ret = syncManager.askServerDevInf();\n CPPUNIT_ASSERT(ret);\n\n \/\/ 4. Change the server URL: expect true\n config.setForceServerDevInfo(false);\n config.setServerSwv(\"8.0.0\");\n StringBuffer urlModified = config.getSyncURL();\n urlModified.append(\"_mod\");\n config.setServerLastSyncURL(urlModified.c_str());\n ret = syncManager.askServerDevInf();\n CPPUNIT_ASSERT(ret);\n }\n\n\n \/\/\n \/\/ Test: syncMLBuilder::prepareServerDevInf()\n \/\/ ------------------------------------------\n void testPrepareServerDevInf() {\n\n SyncMLBuilder syncMLBuilder;\n AbstractCommand* command = syncMLBuilder.prepareServerDevInf();\n CPPUNIT_ASSERT(command);\n\n \/\/ Check it's a Get\n StringBuffer name = command->getName();\n CPPUNIT_ASSERT(name == GET);\n Get* get = (Get*)command;\n CPPUNIT_ASSERT(get);\n\n\n \/\/ Check the meta type = \"application\/vnd.syncml-devinf+xml\"\n Meta* meta = get->getMeta();\n CPPUNIT_ASSERT(meta);\n StringBuffer type = meta->getType();\n CPPUNIT_ASSERT(type == DEVINF_FORMAT);\n\n ArrayList* items = get->getItems();\n CPPUNIT_ASSERT(items);\n\n \/\/ Expect only 1 item\n CPPUNIT_ASSERT_EQUAL(1, items->size());\n Item* item = (Item*)items->get(0);\n CPPUNIT_ASSERT(item);\n\n \/\/ Check the target locURI = \".\/devinf12\"\n Target* target = item->getTarget();\n CPPUNIT_ASSERT(target);\n\n StringBuffer locURI = target->getLocURI();\n CPPUNIT_ASSERT(locURI == DEVINF_URI);\n\n\n delete command;\n }\n\n \/\/\n \/\/ Test: format the Get command to obtain the Server capabilities\n \/\/ --------------------------------------------------------------\n void testFormatServerDevInf() {\n\n SyncMLBuilder syncMLBuilder;\n ArrayList commands;\n AbstractCommand* get = syncMLBuilder.prepareServerDevInf();\n CPPUNIT_ASSERT(get);\n \n commands.add(*get);\n delete get;\n SyncML* syncml = syncMLBuilder.prepareInitObject(NULL, NULL, &commands);\n CPPUNIT_ASSERT(syncml);\n\n char* msg = syncMLBuilder.prepareMsg(syncml);\n CPPUNIT_ASSERT(msg);\n\n\n \/\/ Check if this part of XML is included in the SyncML msg\n int cmdID = 1;\n StringBuffer expected;\n expected.sprintf(\"<Get><CmdID>%d<\/CmdID><Meta><Type xmlns=\\\"syncml:metinf\\\">%s<\/Type><\/Meta><Item><Target><LocURI>%s<\/LocURI><\/Target><\/Item><\/Get>\", \n cmdID, DEVINF_FORMAT, DEVINF_URI);\n \n StringBuffer syncmlMsg(msg);\n syncmlMsg.replaceAll(\"\\n\",\"\");\n size_t pos = syncmlMsg.find(expected);\n CPPUNIT_ASSERT(pos != StringBuffer::npos);\n\n delete [] msg;\n deleteSyncML(&syncml);\n }\n\n\n\n \/\/\n \/\/ Test: syncMLProcessor::processServerDevInf()\n \/\/ This is a sample XML with devInf Results from Funambol Server\n \/\/ -------------------------------------------------------------\n void testProcessServerDevInf1() {\n\n \/\/ Load and parse the sample XML with <Results> command from Server\n config.setSyncURL(TEST_SERVER_URL);\n processDevInf(\"devInfResults.xml\");\n\n \/\/ Check the config has been filled as expected\n StringBuffer url1 = config.getSyncURL();\n StringBuffer url2 = config.getServerLastSyncURL();\n CPPUNIT_ASSERT(url1 == url2);\n\n int iVal;\n bool bVal;\n StringBuffer value;\n value = config.getServerSwv(); CPPUNIT_ASSERT(value == \"7.1.1\");\n value = config.getServerFwv(); CPPUNIT_ASSERT(value == \"-\");\n value = config.getServerHwv(); CPPUNIT_ASSERT(value == \"-\");\n value = config.getServerMan(); CPPUNIT_ASSERT(value == \"Funambol\");\n value = config.getServerMod(); CPPUNIT_ASSERT(value == \"DS Server ComEd\");\n value = config.getServerOem(); CPPUNIT_ASSERT(value == \"-\");\n value = config.getServerDevID(); CPPUNIT_ASSERT(value == \"funambol\");\n value = config.getServerDevType(); CPPUNIT_ASSERT(value == \"server\");\n value = config.getServerVerDTD(); CPPUNIT_ASSERT(value == \"1.2\");\n bVal = config.getServerUtc(); CPPUNIT_ASSERT(bVal == true);\n bVal = config.getServerLoSupport(); CPPUNIT_ASSERT(bVal == true);\n bVal = config.getServerNocSupport(); CPPUNIT_ASSERT(bVal == true);\n iVal = config.getServerSmartSlowSync(); CPPUNIT_ASSERT(iVal == 1);\n\n }\n\n\n \/\/\n \/\/ Test: syncMLProcessor::processServerDevInf()\n \/\/ This is a sample XML with devInf Results from OMA specs\n \/\/ -------------------------------------------------------\n void testProcessServerDevInf2() {\n\n \/\/ Load and parse the sample XML with <Results> command from Server\n config.setSyncURL(TEST_SERVER_URL);\n processDevInf(\"devInfResults2.xml\");\n\n \/\/ Check the config has been filled as expected\n StringBuffer url1 = config.getSyncURL();\n StringBuffer url2 = config.getServerLastSyncURL();\n CPPUNIT_ASSERT(url1 == url2);\n\n int iVal;\n bool bVal;\n StringBuffer value;\n value = config.getServerSwv(); CPPUNIT_ASSERT(value == \"1.0.0\");\n value = config.getServerFwv(); CPPUNIT_ASSERT(value == \"1.0.1\");\n value = config.getServerHwv(); CPPUNIT_ASSERT(value == \"1.0.2\");\n value = config.getServerMan(); CPPUNIT_ASSERT(value == \"Small Factory, Ltd.\");\n value = config.getServerMod(); CPPUNIT_ASSERT(value == \"Tiny Server\");\n value = config.getServerOem(); CPPUNIT_ASSERT(value == \"Tiny Shop\");\n value = config.getServerDevID(); CPPUNIT_ASSERT(value == \"485749KR\");\n value = config.getServerDevType(); CPPUNIT_ASSERT(value == \"Server\");\n value = config.getServerVerDTD(); CPPUNIT_ASSERT(value == \"1.2\");\n bVal = config.getServerUtc(); CPPUNIT_ASSERT(bVal == true);\n bVal = config.getServerLoSupport(); CPPUNIT_ASSERT(bVal == true);\n bVal = config.getServerNocSupport(); CPPUNIT_ASSERT(bVal == true);\n iVal = config.getServerSmartSlowSync(); CPPUNIT_ASSERT(iVal == 0);\n }\n\n\n \/**\n * Utility: will process Server devInf from file 'filename', \n * store data in the config\n *\/\n void processDevInf(const StringBuffer& filename) {\n\n StringBuffer xml;\n loadTestFile(filename.c_str(), xml);\n\n ArrayList commands;\n Parser::getCommands(commands, xml);\n CPPUNIT_ASSERT_MESSAGE(\"Failed to parse devInf Results\", (commands.size() == 1) );\n\n \/\/ Process the Server devInf\n SyncMLProcessor syncMLProcessor;\n AbstractCommand* cmd = (AbstractCommand*)commands.get(0);\n bool found = syncMLProcessor.processServerDevInf(cmd, config);\n CPPUNIT_ASSERT(found);\n }\n\n\n \/**\n * Load a SyncML message from file, parse and reformat it\n * and return the original message and the converted one.\n *\/\n void loadTestFile(const char* fileName, StringBuffer& ret) {\n char* message;\n size_t len;\n\n StringBuffer path;\n path.sprintf(\"%s\/%s\", TESTDIR, fileName);\n\n bool fileLoaded = readFile(path, &message, &len, false);\n CPPUNIT_ASSERT_MESSAGE(\"Failed to load XML\", fileLoaded);\n \n ret = message;\n delete [] message;\n }\n\n\n};\n\n\nCPPUNIT_TEST_SUITE_REGISTRATION( ServerDevInfTest );\n<|endoftext|>"} {"text":"<commit_before>\/*\n *\n * Copyright 2016, Google Inc.\n * All rights reserved.\n *\n * Redistribution and use in source and binary forms, with or without\n * modification, are permitted provided that the following conditions are\n * met:\n *\n * * Redistributions of source code must retain the above copyright\n * notice, this list of conditions and the following disclaimer.\n * * Redistributions in binary form must reproduce the above\n * copyright notice, this list of conditions and the following disclaimer\n * in the documentation and\/or other materials provided with the\n * distribution.\n * * Neither the name of Google Inc. nor the names of its\n * contributors may be used to endorse or promote products derived from\n * this software without specific prior written permission.\n *\n * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS\n * \"AS IS\" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT\n * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR\n * A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT\n * OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,\n * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT\n * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,\n * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY\n * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT\n * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE\n * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.\n *\n *\/\n\n#include <memory>\n#include <mutex>\n\n#include <grpc++\/channel.h>\n#include <grpc++\/client_context.h>\n#include <grpc++\/create_channel.h>\n#include <grpc++\/generic\/async_generic_service.h>\n#include <grpc++\/generic\/generic_stub.h>\n#include <grpc++\/impl\/codegen\/proto_utils.h>\n#include <grpc++\/server.h>\n#include <grpc++\/server_builder.h>\n#include <grpc++\/server_context.h>\n#include <grpc++\/support\/config.h>\n#include <grpc++\/support\/slice.h>\n#include <grpc\/grpc.h>\n#include <grpc\/support\/thd.h>\n#include <grpc\/support\/time.h>\n#include <gtest\/gtest.h>\n\n#include \"src\/cpp\/common\/channel_filter.h\"\n#include \"src\/proto\/grpc\/testing\/echo.grpc.pb.h\"\n#include \"test\/core\/util\/port.h\"\n#include \"test\/core\/util\/test_config.h\"\n#include \"test\/cpp\/util\/byte_buffer_proto_helper.h\"\n\nusing grpc::testing::EchoRequest;\nusing grpc::testing::EchoResponse;\nusing std::chrono::system_clock;\n\nnamespace grpc {\nnamespace testing {\nnamespace {\n\nvoid* tag(int i) { return (void*)(intptr_t)i; }\n\nvoid verify_ok(CompletionQueue* cq, int i, bool expect_ok) {\n bool ok;\n void* got_tag;\n EXPECT_TRUE(cq->Next(&got_tag, &ok));\n EXPECT_EQ(expect_ok, ok);\n EXPECT_EQ(tag(i), got_tag);\n}\n\nnamespace {\n\nint global_num_connections = 0;\nint global_num_calls = 0;\nmutex global_mu;\n\nvoid IncrementConnectionCounter() {\n unique_lock<mutex> lock(global_mu);\n ++global_num_connections;\n}\n\nvoid ResetConnectionCounter() {\n unique_lock<mutex> lock(global_mu);\n global_num_connections = 0;\n}\n\nint GetConnectionCounterValue() {\n unique_lock<mutex> lock(global_mu);\n return global_num_connections;\n}\n\nvoid IncrementCallCounter() {\n unique_lock<mutex> lock(global_mu);\n ++global_num_calls;\n}\n\nvoid ResetCallCounter() {\n unique_lock<mutex> lock(global_mu);\n global_num_calls = 0;\n}\n\nint GetCallCounterValue() {\n unique_lock<mutex> lock(global_mu);\n return global_num_calls;\n}\n\n} \/\/ namespace\n\nclass ChannelDataImpl : public ChannelData {\n public:\n ChannelDataImpl(const grpc_channel_args& args, const char* peer)\n : ChannelData(args, peer) {\n IncrementConnectionCounter();\n }\n};\n\nclass CallDataImpl : public CallData {\n public:\n explicit CallDataImpl(const ChannelDataImpl& channel_data)\n : CallData(channel_data) {}\n\n void StartTransportStreamOp(grpc_exec_ctx* exec_ctx, grpc_call_element* elem,\n TransportStreamOp* op) GRPC_OVERRIDE {\n \/\/ Incrementing the counter could be done from the ctor, but we want\n \/\/ to test that the individual methods are actually called correctly.\n if (op->recv_initial_metadata() != nullptr) IncrementCallCounter();\n grpc_call_next_op(exec_ctx, elem, op->op());\n }\n};\n\nclass FilterEnd2endTest : public ::testing::Test {\n protected:\n FilterEnd2endTest() : server_host_(\"localhost\") {}\n\n void SetUp() GRPC_OVERRIDE {\n int port = grpc_pick_unused_port_or_die();\n server_address_ << server_host_ << \":\" << port;\n \/\/ Setup server\n ServerBuilder builder;\n builder.AddListeningPort(server_address_.str(),\n InsecureServerCredentials());\n builder.RegisterAsyncGenericService(&generic_service_);\n srv_cq_ = builder.AddCompletionQueue();\n server_ = builder.BuildAndStart();\n }\n\n void TearDown() GRPC_OVERRIDE {\n server_->Shutdown();\n void* ignored_tag;\n bool ignored_ok;\n cli_cq_.Shutdown();\n srv_cq_->Shutdown();\n while (cli_cq_.Next(&ignored_tag, &ignored_ok))\n ;\n while (srv_cq_->Next(&ignored_tag, &ignored_ok))\n ;\n }\n\n void ResetStub() {\n std::shared_ptr<Channel> channel =\n CreateChannel(server_address_.str(), InsecureChannelCredentials());\n generic_stub_.reset(new GenericStub(channel));\n ResetConnectionCounter();\n ResetCallCounter();\n }\n\n void server_ok(int i) { verify_ok(srv_cq_.get(), i, true); }\n void client_ok(int i) { verify_ok(&cli_cq_, i, true); }\n void server_fail(int i) { verify_ok(srv_cq_.get(), i, false); }\n void client_fail(int i) { verify_ok(&cli_cq_, i, false); }\n\n void SendRpc(int num_rpcs) {\n const grpc::string kMethodName(\"\/grpc.cpp.test.util.EchoTestService\/Echo\");\n for (int i = 0; i < num_rpcs; i++) {\n EchoRequest send_request;\n EchoRequest recv_request;\n EchoResponse send_response;\n EchoResponse recv_response;\n Status recv_status;\n\n ClientContext cli_ctx;\n GenericServerContext srv_ctx;\n GenericServerAsyncReaderWriter stream(&srv_ctx);\n\n \/\/ The string needs to be long enough to test heap-based slice.\n send_request.set_message(\"Hello world. Hello world. Hello world.\");\n std::unique_ptr<GenericClientAsyncReaderWriter> call =\n generic_stub_->Call(&cli_ctx, kMethodName, &cli_cq_, tag(1));\n client_ok(1);\n std::unique_ptr<ByteBuffer> send_buffer =\n SerializeToByteBuffer(&send_request);\n call->Write(*send_buffer, tag(2));\n \/\/ Send ByteBuffer can be destroyed after calling Write.\n send_buffer.reset();\n client_ok(2);\n call->WritesDone(tag(3));\n client_ok(3);\n\n generic_service_.RequestCall(&srv_ctx, &stream, srv_cq_.get(),\n srv_cq_.get(), tag(4));\n\n verify_ok(srv_cq_.get(), 4, true);\n EXPECT_EQ(server_host_, srv_ctx.host().substr(0, server_host_.length()));\n EXPECT_EQ(kMethodName, srv_ctx.method());\n ByteBuffer recv_buffer;\n stream.Read(&recv_buffer, tag(5));\n server_ok(5);\n EXPECT_TRUE(ParseFromByteBuffer(&recv_buffer, &recv_request));\n EXPECT_EQ(send_request.message(), recv_request.message());\n\n send_response.set_message(recv_request.message());\n send_buffer = SerializeToByteBuffer(&send_response);\n stream.Write(*send_buffer, tag(6));\n send_buffer.reset();\n server_ok(6);\n\n stream.Finish(Status::OK, tag(7));\n server_ok(7);\n\n recv_buffer.Clear();\n call->Read(&recv_buffer, tag(8));\n client_ok(8);\n EXPECT_TRUE(ParseFromByteBuffer(&recv_buffer, &recv_response));\n\n call->Finish(&recv_status, tag(9));\n client_ok(9);\n\n EXPECT_EQ(send_response.message(), recv_response.message());\n EXPECT_TRUE(recv_status.ok());\n }\n }\n\n CompletionQueue cli_cq_;\n std::unique_ptr<ServerCompletionQueue> srv_cq_;\n std::unique_ptr<grpc::testing::EchoTestService::Stub> stub_;\n std::unique_ptr<grpc::GenericStub> generic_stub_;\n std::unique_ptr<Server> server_;\n AsyncGenericService generic_service_;\n const grpc::string server_host_;\n std::ostringstream server_address_;\n};\n\nTEST_F(FilterEnd2endTest, SimpleRpc) {\n ResetStub();\n EXPECT_EQ(0, GetConnectionCounterValue());\n EXPECT_EQ(0, GetCallCounterValue());\n SendRpc(1);\n EXPECT_EQ(1, GetConnectionCounterValue());\n EXPECT_EQ(1, GetCallCounterValue());\n}\n\nTEST_F(FilterEnd2endTest, SequentialRpcs) {\n ResetStub();\n EXPECT_EQ(0, GetConnectionCounterValue());\n EXPECT_EQ(0, GetCallCounterValue());\n SendRpc(10);\n EXPECT_EQ(1, GetConnectionCounterValue());\n EXPECT_EQ(10, GetCallCounterValue());\n}\n\n\/\/ One ping, one pong.\nTEST_F(FilterEnd2endTest, SimpleBidiStreaming) {\n ResetStub();\n EXPECT_EQ(0, GetConnectionCounterValue());\n EXPECT_EQ(0, GetCallCounterValue());\n\n const grpc::string kMethodName(\n \"\/grpc.cpp.test.util.EchoTestService\/BidiStream\");\n EchoRequest send_request;\n EchoRequest recv_request;\n EchoResponse send_response;\n EchoResponse recv_response;\n Status recv_status;\n ClientContext cli_ctx;\n GenericServerContext srv_ctx;\n GenericServerAsyncReaderWriter srv_stream(&srv_ctx);\n\n cli_ctx.set_compression_algorithm(GRPC_COMPRESS_GZIP);\n send_request.set_message(\"Hello\");\n std::unique_ptr<GenericClientAsyncReaderWriter> cli_stream =\n generic_stub_->Call(&cli_ctx, kMethodName, &cli_cq_, tag(1));\n client_ok(1);\n\n generic_service_.RequestCall(&srv_ctx, &srv_stream, srv_cq_.get(),\n srv_cq_.get(), tag(2));\n\n verify_ok(srv_cq_.get(), 2, true);\n EXPECT_EQ(server_host_, srv_ctx.host().substr(0, server_host_.length()));\n EXPECT_EQ(kMethodName, srv_ctx.method());\n\n std::unique_ptr<ByteBuffer> send_buffer =\n SerializeToByteBuffer(&send_request);\n cli_stream->Write(*send_buffer, tag(3));\n send_buffer.reset();\n client_ok(3);\n\n ByteBuffer recv_buffer;\n srv_stream.Read(&recv_buffer, tag(4));\n server_ok(4);\n EXPECT_TRUE(ParseFromByteBuffer(&recv_buffer, &recv_request));\n EXPECT_EQ(send_request.message(), recv_request.message());\n\n send_response.set_message(recv_request.message());\n send_buffer = SerializeToByteBuffer(&send_response);\n srv_stream.Write(*send_buffer, tag(5));\n send_buffer.reset();\n server_ok(5);\n\n cli_stream->Read(&recv_buffer, tag(6));\n client_ok(6);\n EXPECT_TRUE(ParseFromByteBuffer(&recv_buffer, &recv_response));\n EXPECT_EQ(send_response.message(), recv_response.message());\n\n cli_stream->WritesDone(tag(7));\n client_ok(7);\n\n srv_stream.Read(&recv_buffer, tag(8));\n server_fail(8);\n\n srv_stream.Finish(Status::OK, tag(9));\n server_ok(9);\n\n cli_stream->Finish(&recv_status, tag(10));\n client_ok(10);\n\n EXPECT_EQ(send_response.message(), recv_response.message());\n EXPECT_TRUE(recv_status.ok());\n\n EXPECT_EQ(1, GetCallCounterValue());\n EXPECT_EQ(1, GetConnectionCounterValue());\n}\n\n} \/\/ namespace\n} \/\/ namespace testing\n} \/\/ namespace grpc\n\nint main(int argc, char** argv) {\n grpc_test_init(argc, argv);\n ::testing::InitGoogleTest(&argc, argv);\n grpc::RegisterChannelFilter<grpc::testing::ChannelDataImpl,\n grpc::testing::CallDataImpl>(\n \"test-filter\", GRPC_SERVER_CHANNEL, INT_MAX, nullptr);\n return RUN_ALL_TESTS();\n}\n<commit_msg>Move use of nullptr into grpc namespace, so that the hack in config.h can be used.<commit_after>\/*\n *\n * Copyright 2016, Google Inc.\n * All rights reserved.\n *\n * Redistribution and use in source and binary forms, with or without\n * modification, are permitted provided that the following conditions are\n * met:\n *\n * * Redistributions of source code must retain the above copyright\n * notice, this list of conditions and the following disclaimer.\n * * Redistributions in binary form must reproduce the above\n * copyright notice, this list of conditions and the following disclaimer\n * in the documentation and\/or other materials provided with the\n * distribution.\n * * Neither the name of Google Inc. nor the names of its\n * contributors may be used to endorse or promote products derived from\n * this software without specific prior written permission.\n *\n * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS\n * \"AS IS\" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT\n * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR\n * A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT\n * OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,\n * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT\n * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,\n * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY\n * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT\n * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE\n * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.\n *\n *\/\n\n#include <memory>\n#include <mutex>\n\n#include <grpc++\/channel.h>\n#include <grpc++\/client_context.h>\n#include <grpc++\/create_channel.h>\n#include <grpc++\/generic\/async_generic_service.h>\n#include <grpc++\/generic\/generic_stub.h>\n#include <grpc++\/impl\/codegen\/proto_utils.h>\n#include <grpc++\/server.h>\n#include <grpc++\/server_builder.h>\n#include <grpc++\/server_context.h>\n#include <grpc++\/support\/config.h>\n#include <grpc++\/support\/slice.h>\n#include <grpc\/grpc.h>\n#include <grpc\/support\/thd.h>\n#include <grpc\/support\/time.h>\n#include <gtest\/gtest.h>\n\n#include \"src\/cpp\/common\/channel_filter.h\"\n#include \"src\/proto\/grpc\/testing\/echo.grpc.pb.h\"\n#include \"test\/core\/util\/port.h\"\n#include \"test\/core\/util\/test_config.h\"\n#include \"test\/cpp\/util\/byte_buffer_proto_helper.h\"\n\nusing grpc::testing::EchoRequest;\nusing grpc::testing::EchoResponse;\nusing std::chrono::system_clock;\n\nnamespace grpc {\nnamespace testing {\nnamespace {\n\nvoid* tag(int i) { return (void*)(intptr_t)i; }\n\nvoid verify_ok(CompletionQueue* cq, int i, bool expect_ok) {\n bool ok;\n void* got_tag;\n EXPECT_TRUE(cq->Next(&got_tag, &ok));\n EXPECT_EQ(expect_ok, ok);\n EXPECT_EQ(tag(i), got_tag);\n}\n\nnamespace {\n\nint global_num_connections = 0;\nint global_num_calls = 0;\nmutex global_mu;\n\nvoid IncrementConnectionCounter() {\n unique_lock<mutex> lock(global_mu);\n ++global_num_connections;\n}\n\nvoid ResetConnectionCounter() {\n unique_lock<mutex> lock(global_mu);\n global_num_connections = 0;\n}\n\nint GetConnectionCounterValue() {\n unique_lock<mutex> lock(global_mu);\n return global_num_connections;\n}\n\nvoid IncrementCallCounter() {\n unique_lock<mutex> lock(global_mu);\n ++global_num_calls;\n}\n\nvoid ResetCallCounter() {\n unique_lock<mutex> lock(global_mu);\n global_num_calls = 0;\n}\n\nint GetCallCounterValue() {\n unique_lock<mutex> lock(global_mu);\n return global_num_calls;\n}\n\n} \/\/ namespace\n\nclass ChannelDataImpl : public ChannelData {\n public:\n ChannelDataImpl(const grpc_channel_args& args, const char* peer)\n : ChannelData(args, peer) {\n IncrementConnectionCounter();\n }\n};\n\nclass CallDataImpl : public CallData {\n public:\n explicit CallDataImpl(const ChannelDataImpl& channel_data)\n : CallData(channel_data) {}\n\n void StartTransportStreamOp(grpc_exec_ctx* exec_ctx, grpc_call_element* elem,\n TransportStreamOp* op) GRPC_OVERRIDE {\n \/\/ Incrementing the counter could be done from the ctor, but we want\n \/\/ to test that the individual methods are actually called correctly.\n if (op->recv_initial_metadata() != nullptr) IncrementCallCounter();\n grpc_call_next_op(exec_ctx, elem, op->op());\n }\n};\n\nclass FilterEnd2endTest : public ::testing::Test {\n protected:\n FilterEnd2endTest() : server_host_(\"localhost\") {}\n\n void SetUp() GRPC_OVERRIDE {\n int port = grpc_pick_unused_port_or_die();\n server_address_ << server_host_ << \":\" << port;\n \/\/ Setup server\n ServerBuilder builder;\n builder.AddListeningPort(server_address_.str(),\n InsecureServerCredentials());\n builder.RegisterAsyncGenericService(&generic_service_);\n srv_cq_ = builder.AddCompletionQueue();\n server_ = builder.BuildAndStart();\n }\n\n void TearDown() GRPC_OVERRIDE {\n server_->Shutdown();\n void* ignored_tag;\n bool ignored_ok;\n cli_cq_.Shutdown();\n srv_cq_->Shutdown();\n while (cli_cq_.Next(&ignored_tag, &ignored_ok))\n ;\n while (srv_cq_->Next(&ignored_tag, &ignored_ok))\n ;\n }\n\n void ResetStub() {\n std::shared_ptr<Channel> channel =\n CreateChannel(server_address_.str(), InsecureChannelCredentials());\n generic_stub_.reset(new GenericStub(channel));\n ResetConnectionCounter();\n ResetCallCounter();\n }\n\n void server_ok(int i) { verify_ok(srv_cq_.get(), i, true); }\n void client_ok(int i) { verify_ok(&cli_cq_, i, true); }\n void server_fail(int i) { verify_ok(srv_cq_.get(), i, false); }\n void client_fail(int i) { verify_ok(&cli_cq_, i, false); }\n\n void SendRpc(int num_rpcs) {\n const grpc::string kMethodName(\"\/grpc.cpp.test.util.EchoTestService\/Echo\");\n for (int i = 0; i < num_rpcs; i++) {\n EchoRequest send_request;\n EchoRequest recv_request;\n EchoResponse send_response;\n EchoResponse recv_response;\n Status recv_status;\n\n ClientContext cli_ctx;\n GenericServerContext srv_ctx;\n GenericServerAsyncReaderWriter stream(&srv_ctx);\n\n \/\/ The string needs to be long enough to test heap-based slice.\n send_request.set_message(\"Hello world. Hello world. Hello world.\");\n std::unique_ptr<GenericClientAsyncReaderWriter> call =\n generic_stub_->Call(&cli_ctx, kMethodName, &cli_cq_, tag(1));\n client_ok(1);\n std::unique_ptr<ByteBuffer> send_buffer =\n SerializeToByteBuffer(&send_request);\n call->Write(*send_buffer, tag(2));\n \/\/ Send ByteBuffer can be destroyed after calling Write.\n send_buffer.reset();\n client_ok(2);\n call->WritesDone(tag(3));\n client_ok(3);\n\n generic_service_.RequestCall(&srv_ctx, &stream, srv_cq_.get(),\n srv_cq_.get(), tag(4));\n\n verify_ok(srv_cq_.get(), 4, true);\n EXPECT_EQ(server_host_, srv_ctx.host().substr(0, server_host_.length()));\n EXPECT_EQ(kMethodName, srv_ctx.method());\n ByteBuffer recv_buffer;\n stream.Read(&recv_buffer, tag(5));\n server_ok(5);\n EXPECT_TRUE(ParseFromByteBuffer(&recv_buffer, &recv_request));\n EXPECT_EQ(send_request.message(), recv_request.message());\n\n send_response.set_message(recv_request.message());\n send_buffer = SerializeToByteBuffer(&send_response);\n stream.Write(*send_buffer, tag(6));\n send_buffer.reset();\n server_ok(6);\n\n stream.Finish(Status::OK, tag(7));\n server_ok(7);\n\n recv_buffer.Clear();\n call->Read(&recv_buffer, tag(8));\n client_ok(8);\n EXPECT_TRUE(ParseFromByteBuffer(&recv_buffer, &recv_response));\n\n call->Finish(&recv_status, tag(9));\n client_ok(9);\n\n EXPECT_EQ(send_response.message(), recv_response.message());\n EXPECT_TRUE(recv_status.ok());\n }\n }\n\n CompletionQueue cli_cq_;\n std::unique_ptr<ServerCompletionQueue> srv_cq_;\n std::unique_ptr<grpc::testing::EchoTestService::Stub> stub_;\n std::unique_ptr<grpc::GenericStub> generic_stub_;\n std::unique_ptr<Server> server_;\n AsyncGenericService generic_service_;\n const grpc::string server_host_;\n std::ostringstream server_address_;\n};\n\nTEST_F(FilterEnd2endTest, SimpleRpc) {\n ResetStub();\n EXPECT_EQ(0, GetConnectionCounterValue());\n EXPECT_EQ(0, GetCallCounterValue());\n SendRpc(1);\n EXPECT_EQ(1, GetConnectionCounterValue());\n EXPECT_EQ(1, GetCallCounterValue());\n}\n\nTEST_F(FilterEnd2endTest, SequentialRpcs) {\n ResetStub();\n EXPECT_EQ(0, GetConnectionCounterValue());\n EXPECT_EQ(0, GetCallCounterValue());\n SendRpc(10);\n EXPECT_EQ(1, GetConnectionCounterValue());\n EXPECT_EQ(10, GetCallCounterValue());\n}\n\n\/\/ One ping, one pong.\nTEST_F(FilterEnd2endTest, SimpleBidiStreaming) {\n ResetStub();\n EXPECT_EQ(0, GetConnectionCounterValue());\n EXPECT_EQ(0, GetCallCounterValue());\n\n const grpc::string kMethodName(\n \"\/grpc.cpp.test.util.EchoTestService\/BidiStream\");\n EchoRequest send_request;\n EchoRequest recv_request;\n EchoResponse send_response;\n EchoResponse recv_response;\n Status recv_status;\n ClientContext cli_ctx;\n GenericServerContext srv_ctx;\n GenericServerAsyncReaderWriter srv_stream(&srv_ctx);\n\n cli_ctx.set_compression_algorithm(GRPC_COMPRESS_GZIP);\n send_request.set_message(\"Hello\");\n std::unique_ptr<GenericClientAsyncReaderWriter> cli_stream =\n generic_stub_->Call(&cli_ctx, kMethodName, &cli_cq_, tag(1));\n client_ok(1);\n\n generic_service_.RequestCall(&srv_ctx, &srv_stream, srv_cq_.get(),\n srv_cq_.get(), tag(2));\n\n verify_ok(srv_cq_.get(), 2, true);\n EXPECT_EQ(server_host_, srv_ctx.host().substr(0, server_host_.length()));\n EXPECT_EQ(kMethodName, srv_ctx.method());\n\n std::unique_ptr<ByteBuffer> send_buffer =\n SerializeToByteBuffer(&send_request);\n cli_stream->Write(*send_buffer, tag(3));\n send_buffer.reset();\n client_ok(3);\n\n ByteBuffer recv_buffer;\n srv_stream.Read(&recv_buffer, tag(4));\n server_ok(4);\n EXPECT_TRUE(ParseFromByteBuffer(&recv_buffer, &recv_request));\n EXPECT_EQ(send_request.message(), recv_request.message());\n\n send_response.set_message(recv_request.message());\n send_buffer = SerializeToByteBuffer(&send_response);\n srv_stream.Write(*send_buffer, tag(5));\n send_buffer.reset();\n server_ok(5);\n\n cli_stream->Read(&recv_buffer, tag(6));\n client_ok(6);\n EXPECT_TRUE(ParseFromByteBuffer(&recv_buffer, &recv_response));\n EXPECT_EQ(send_response.message(), recv_response.message());\n\n cli_stream->WritesDone(tag(7));\n client_ok(7);\n\n srv_stream.Read(&recv_buffer, tag(8));\n server_fail(8);\n\n srv_stream.Finish(Status::OK, tag(9));\n server_ok(9);\n\n cli_stream->Finish(&recv_status, tag(10));\n client_ok(10);\n\n EXPECT_EQ(send_response.message(), recv_response.message());\n EXPECT_TRUE(recv_status.ok());\n\n EXPECT_EQ(1, GetCallCounterValue());\n EXPECT_EQ(1, GetConnectionCounterValue());\n}\n\nvoid RegisterFilter() {\n grpc::RegisterChannelFilter<ChannelDataImpl, CallDataImpl>(\n \"test-filter\", GRPC_SERVER_CHANNEL, INT_MAX, nullptr);\n}\n\n} \/\/ namespace\n} \/\/ namespace testing\n} \/\/ namespace grpc\n\nint main(int argc, char** argv) {\n grpc_test_init(argc, argv);\n ::testing::InitGoogleTest(&argc, argv);\n grpc::testing::RegisterFilter();\n return RUN_ALL_TESTS();\n}\n<|endoftext|>"} {"text":"<commit_before>#include <thread>\n#include <memory>\n\n#include \"Daemon.h\"\n\n#include \"Config.h\"\n#include \"Log.h\"\n#include \"Base.h\"\n#include \"version.h\"\n#include \"Transports.h\"\n#include \"NTCPSession.h\"\n#include \"RouterInfo.h\"\n#include \"RouterContext.h\"\n#include \"Tunnel.h\"\n#include \"NetDb.h\"\n#include \"Garlic.h\"\n#include \"util.h\"\n#include \"Streaming.h\"\n#include \"Destination.h\"\n#include \"HTTPServer.h\"\n#include \"I2PControl.h\"\n#include \"ClientContext.h\"\n#include \"Crypto.h\"\n\n#ifdef USE_UPNP\n#include \"UPnP.h\"\n#endif\n\nnamespace i2p\n{\n\tnamespace util\n\t{\n\t\tclass Daemon_Singleton::Daemon_Singleton_Private\n\t\t{\n\t\tpublic:\n\t\t\tDaemon_Singleton_Private() {};\n\t\t\t~Daemon_Singleton_Private() {};\n\n\t\t\tstd::unique_ptr<i2p::util::HTTPServer> httpServer;\n\t\t\tstd::unique_ptr<i2p::client::I2PControlService> m_I2PControlService;\n\n#ifdef USE_UPNP\n\t\t\ti2p::transport::UPnP m_UPnP;\n#endif\t\n\t\t};\n\n\t\tDaemon_Singleton::Daemon_Singleton() : running(1), d(*new Daemon_Singleton_Private()) {};\n\t\tDaemon_Singleton::~Daemon_Singleton() {\n\t\t\tdelete &d;\n\t\t};\n\n\t\tbool Daemon_Singleton::IsService () const\n\t\t{\n\t\t\tbool service = false;\n#ifndef _WIN32\n\t\t\ti2p::config::GetOption(\"service\", service);\n#endif\n\t\t\treturn service;\n\t\t}\n\n\t\tbool Daemon_Singleton::init(int argc, char* argv[])\n\t\t{\n\t\t\ti2p::config::Init();\n\t\t\ti2p::config::ParseCmdline(argc, argv);\n\n\t\t\tstd::string config = i2p::util::filesystem::GetConfigFile().string();\n\t\t\tstd::string tunconf = i2p::util::filesystem::GetTunnelsConfigFile().string();\n\t\t\tstd::string datadir = i2p::util::filesystem::GetDataDir().string();\n\n\t\t\tLogPrint(eLogInfo, \"i2pd v\", VERSION, \" starting\");\n\t\t\tLogPrint(eLogDebug, \"FS: main config file: \", config);\n\t\t\tLogPrint(eLogDebug, \"FS: tunnels config: \", tunconf);\n\t\t\tLogPrint(eLogDebug, \"FS: data directory: \", datadir);\n\n\t\t\ti2p::config::ParseConfig(config);\n\t\t\ti2p::config::Finalize();\n\n\t\t\ti2p::crypto::InitCrypto ();\n\t\t\ti2p::context.Init ();\n\n\t\t\ti2p::config::GetOption(\"daemon\", isDaemon);\n\n\t\t\t\/\/ temporary hack\n\t\t\tstd::string logs = \"\";\n\t\t\ti2p::config::GetOption(\"log\", logs);\n\t\t\tif (isDaemon || logs != \"\") isLogging = true;\n\n\t\t\tuint16_t port; i2p::config::GetOption(\"port\", port);\n\t\t\tif (port)\n\t\t\t{\t\n\t\t\t\tLogPrint(eLogInfo, \"Daemon: accepting incoming connections at port \", port);\n\t\t\t\ti2p::context.UpdatePort (port);\n\t\t\t}\t\n\n\t\t\tstd::string host; i2p::config::GetOption(\"host\", host);\n\t\t\tif (host != \"\") \n\t\t\t{\n\t\t\t\tLogPrint(eLogInfo, \"Daemon: address for incoming connections is \", host);\n\t\t\t\ti2p::context.UpdateAddress (boost::asio::ip::address::from_string (host));\t\n\t\t\t}\n\n\t\t\tbool ipv6; i2p::config::GetOption(\"ipv6\", ipv6);\n\t\t\tbool transit; i2p::config::GetOption(\"notransit\", transit);\n\t\t\ti2p::context.SetSupportsV6 (ipv6);\n\t\t\ti2p::context.SetAcceptsTunnels (!transit);\n\n\t\t\tbool isFloodfill; i2p::config::GetOption(\"floodfill\", isFloodfill);\n\t\t\tchar bandwidth; i2p::config::GetOption(\"bandwidth\", bandwidth);\n\n\t\t\tif (isFloodfill) \n\t\t\t{\n\t\t\t\tLogPrint(eLogInfo, \"Daemon: router will be floodfill\");\n\t\t\t\ti2p::context.SetFloodfill (true);\n\t\t\t}\t\n\t\t\tif (bandwidth != '-')\n\t\t\t{\n\t\t\t\tLogPrint(eLogInfo, \"Daemon: bandwidth set to \", bandwidth);\n\t\t\t\tif (bandwidth > 'O') \n\t\t\t\t\ti2p::context.SetExtraBandwidth (); \n\t\t\t\telse if (bandwidth > 'L')\n\t\t\t\t\ti2p::context.SetHighBandwidth (); \n\t\t\t\telse \n\t\t\t\t\ti2p::context.SetLowBandwidth ();\n\t\t\t}\t\n\t\t\telse if (isFloodfill) \n\t\t\t{\n\t\t\t\tLogPrint(eLogInfo, \"Daemon: floodfill bandwidth set to 'extra'\");\n\t\t\t\ti2p::context.SetExtraBandwidth ();\n\t\t\t} \n\t\t\telse\n\t\t\t\ti2p::context.SetLowBandwidth ();\n\n\t\t\treturn true;\n\t\t}\n\t\t\t\n\t\tbool Daemon_Singleton::start()\n\t\t{\n\t\t\tstd::string loglevel = \"\"; i2p::config::GetOption(\"loglevel\", loglevel);\n\t\t\t\n\t\t\tif (isLogging)\n\t\t\t{\n\t\t\t\t\/\/ set default to stdout\n\t\t\t\tstd::string logfile = \"\"; i2p::config::GetOption(\"logfile\", logfile);\n\t\t\t\t\n\t\t\t\tif (logfile == \"\")\n\t\t\t\t{\n\t\t\t\t\t\/\/ can't log to stdout, use autodetect of logfile\n\t\t\t\t\tlogfile = IsService () ? \"\/var\/log\" : i2p::util::filesystem::GetDataDir().string();\n#ifndef _WIN32\n\t\t\t\t\tlogfile.append(\"\/i2pd.log\");\n#else\n\t\t\t\t\tlogfile.append(\"\\\\i2pd.log\");\n#endif\n\t\t\t\t}\n\t\t\t\tStartLog (logfile);\n\t\t\t}\n\t\t\telse\n\t\t\t\tStartLog (\"\");\n\t\t\tSetLogLevel(loglevel);\n\t\t\t\n\t\t\tbool http; i2p::config::GetOption(\"http.enabled\", http);\n\t\t\tif (http) {\n\t\t\t\tstd::string httpAddr; i2p::config::GetOption(\"http.address\", httpAddr);\n\t\t\t\tuint16_t httpPort; i2p::config::GetOption(\"http.port\", httpPort);\n\t\t\t\tLogPrint(eLogInfo, \"Daemon: starting HTTP Server at \", httpAddr, \":\", httpPort);\n\t\t\t\td.httpServer = std::unique_ptr<i2p::util::HTTPServer>(new i2p::util::HTTPServer(httpAddr, httpPort));\n\t\t\t\td.httpServer->Start();\n\t\t\t}\n\n\t\t\tLogPrint(eLogInfo, \"Daemon: starting NetDB\");\n\t\t\ti2p::data::netdb.Start();\n\n#ifdef USE_UPNP\n\t\t\tLogPrint(eLogInfo, \"Daemon: starting UPnP\");\n\t\t\td.m_UPnP.Start ();\n#endif\t\t\t\n\t\t\tLogPrint(eLogInfo, \"Daemon: starting Transports\");\n\t\t\ti2p::transport::transports.Start();\n\n\t\t\tLogPrint(eLogInfo, \"Daemon: starting Tunnels\");\n\t\t\ti2p::tunnel::tunnels.Start();\n\n\t\t\tLogPrint(eLogInfo, \"Daemon: starting Client\");\n\t\t\ti2p::client::context.Start ();\n\n\t\t\t\/\/ I2P Control Protocol\n\t\t\tbool i2pcontrol; i2p::config::GetOption(\"i2pcontrol.enabled\", i2pcontrol);\n\t\t\tif (i2pcontrol) {\n\t\t\t\tstd::string i2pcpAddr; i2p::config::GetOption(\"i2pcontrol.address\", i2pcpAddr);\n\t\t\t\tuint16_t i2pcpPort; i2p::config::GetOption(\"i2pcontrol.port\", i2pcpPort);\n\t\t\t\tLogPrint(eLogInfo, \"Daemon: starting I2PControl at \", i2pcpAddr, \":\", i2pcpPort);\n\t\t\t\td.m_I2PControlService = std::unique_ptr<i2p::client::I2PControlService>(new i2p::client::I2PControlService (i2pcpAddr, i2pcpPort));\n\t\t\t\td.m_I2PControlService->Start ();\n\t\t\t}\n\t\t\treturn true;\n\t\t}\n\n\t\tbool Daemon_Singleton::stop()\n\t\t{\n\t\t\tLogPrint(eLogInfo, \"Daemon: shutting down\");\n\t\t\tLogPrint(eLogInfo, \"Daemon: stopping Client\");\n\t\t\ti2p::client::context.Stop();\n\t\t\tLogPrint(eLogInfo, \"Daemon: stopping Tunnels\");\n\t\t\ti2p::tunnel::tunnels.Stop();\n#ifdef USE_UPNP\n\t\t\tLogPrint(eLogInfo, \"Daemon: stopping UPnP\");\n\t\t\td.m_UPnP.Stop ();\n#endif\t\t\t\n\t\t\tLogPrint(eLogInfo, \"Daemon: stopping Transports\");\n\t\t\ti2p::transport::transports.Stop();\n\t\t\tLogPrint(eLogInfo, \"Daemon: stopping NetDB\");\n\t\t\ti2p::data::netdb.Stop();\n\t\t\tLogPrint(eLogInfo, \"Daemon: stopping HTTP Server\");\n\t\t\td.httpServer->Stop();\n\t\t\td.httpServer = nullptr;\n\t\t\tif (d.m_I2PControlService)\n\t\t\t{\n\t\t\t\tLogPrint(eLogInfo, \"Daemon: stopping I2PControl\");\n\t\t\t\td.m_I2PControlService->Stop ();\n\t\t\t\td.m_I2PControlService = nullptr;\n\t\t\t}\t\n\t\t\ti2p::crypto::TerminateCrypto ();\n\t\t\tStopLog ();\n\n\t\t\treturn true;\n\t\t}\n\t}\n}\n<commit_msg>* Daemon.cpp : move logs init to single place<commit_after>#include <thread>\n#include <memory>\n\n#include \"Daemon.h\"\n\n#include \"Config.h\"\n#include \"Log.h\"\n#include \"Base.h\"\n#include \"version.h\"\n#include \"Transports.h\"\n#include \"NTCPSession.h\"\n#include \"RouterInfo.h\"\n#include \"RouterContext.h\"\n#include \"Tunnel.h\"\n#include \"NetDb.h\"\n#include \"Garlic.h\"\n#include \"util.h\"\n#include \"Streaming.h\"\n#include \"Destination.h\"\n#include \"HTTPServer.h\"\n#include \"I2PControl.h\"\n#include \"ClientContext.h\"\n#include \"Crypto.h\"\n\n#ifdef USE_UPNP\n#include \"UPnP.h\"\n#endif\n\nnamespace i2p\n{\n\tnamespace util\n\t{\n\t\tclass Daemon_Singleton::Daemon_Singleton_Private\n\t\t{\n\t\tpublic:\n\t\t\tDaemon_Singleton_Private() {};\n\t\t\t~Daemon_Singleton_Private() {};\n\n\t\t\tstd::unique_ptr<i2p::util::HTTPServer> httpServer;\n\t\t\tstd::unique_ptr<i2p::client::I2PControlService> m_I2PControlService;\n\n#ifdef USE_UPNP\n\t\t\ti2p::transport::UPnP m_UPnP;\n#endif\t\n\t\t};\n\n\t\tDaemon_Singleton::Daemon_Singleton() : running(1), d(*new Daemon_Singleton_Private()) {};\n\t\tDaemon_Singleton::~Daemon_Singleton() {\n\t\t\tdelete &d;\n\t\t};\n\n\t\tbool Daemon_Singleton::IsService () const\n\t\t{\n\t\t\tbool service = false;\n#ifndef _WIN32\n\t\t\ti2p::config::GetOption(\"service\", service);\n#endif\n\t\t\treturn service;\n\t\t}\n\n\t\tbool Daemon_Singleton::init(int argc, char* argv[])\n\t\t{\n\t\t\ti2p::config::Init();\n\t\t\ti2p::config::ParseCmdline(argc, argv);\n\n\t\t\tstd::string config = i2p::util::filesystem::GetConfigFile().string();\n\t\t\tstd::string tunconf = i2p::util::filesystem::GetTunnelsConfigFile().string();\n\t\t\tstd::string datadir = i2p::util::filesystem::GetDataDir().string();\n\n\t\t\ti2p::config::ParseConfig(config);\n\t\t\ti2p::config::Finalize();\n\n\t\t\ti2p::crypto::InitCrypto ();\n\t\t\ti2p::context.Init ();\n\n\t\t\ti2p::config::GetOption(\"daemon\", isDaemon);\n\n\t\t\t\/\/ TODO: move log init here\n\n\t\t\tLogPrint(eLogInfo, \"i2pd v\", VERSION, \" starting\");\n\t\t\tLogPrint(eLogDebug, \"FS: main config file: \", config);\n\t\t\tLogPrint(eLogDebug, \"FS: tunnels config: \", tunconf);\n\t\t\tLogPrint(eLogDebug, \"FS: data directory: \", datadir);\n\n\t\t\tuint16_t port; i2p::config::GetOption(\"port\", port);\n\t\t\tif (port)\n\t\t\t{\t\n\t\t\t\tLogPrint(eLogInfo, \"Daemon: accepting incoming connections at port \", port);\n\t\t\t\ti2p::context.UpdatePort (port);\n\t\t\t}\t\n\n\t\t\tstd::string host; i2p::config::GetOption(\"host\", host);\n\t\t\tif (host != \"\") \n\t\t\t{\n\t\t\t\tLogPrint(eLogInfo, \"Daemon: address for incoming connections is \", host);\n\t\t\t\ti2p::context.UpdateAddress (boost::asio::ip::address::from_string (host));\t\n\t\t\t}\n\n\t\t\tbool ipv6; i2p::config::GetOption(\"ipv6\", ipv6);\n\t\t\tbool transit; i2p::config::GetOption(\"notransit\", transit);\n\t\t\ti2p::context.SetSupportsV6 (ipv6);\n\t\t\ti2p::context.SetAcceptsTunnels (!transit);\n\n\t\t\tbool isFloodfill; i2p::config::GetOption(\"floodfill\", isFloodfill);\n\t\t\tchar bandwidth; i2p::config::GetOption(\"bandwidth\", bandwidth);\n\n\t\t\tif (isFloodfill) \n\t\t\t{\n\t\t\t\tLogPrint(eLogInfo, \"Daemon: router will be floodfill\");\n\t\t\t\ti2p::context.SetFloodfill (true);\n\t\t\t}\t\n\t\t\tif (bandwidth != '-')\n\t\t\t{\n\t\t\t\tLogPrint(eLogInfo, \"Daemon: bandwidth set to \", bandwidth);\n\t\t\t\tif (bandwidth > 'O') \n\t\t\t\t\ti2p::context.SetExtraBandwidth (); \n\t\t\t\telse if (bandwidth > 'L')\n\t\t\t\t\ti2p::context.SetHighBandwidth (); \n\t\t\t\telse \n\t\t\t\t\ti2p::context.SetLowBandwidth ();\n\t\t\t}\t\n\t\t\telse if (isFloodfill) \n\t\t\t{\n\t\t\t\tLogPrint(eLogInfo, \"Daemon: floodfill bandwidth set to 'extra'\");\n\t\t\t\ti2p::context.SetExtraBandwidth ();\n\t\t\t} \n\t\t\telse\n\t\t\t\ti2p::context.SetLowBandwidth ();\n\n\t\t\treturn true;\n\t\t}\n\t\t\t\n\t\tbool Daemon_Singleton::start()\n\t\t{\n\t\t\tstd::string logs = \"\"; i2p::config::GetOption(\"log\", logs);\n\t\t\tstd::string logfile = \"\"; i2p::config::GetOption(\"logfile\", logfile);\n\t\t\tstd::string loglevel = \"\"; i2p::config::GetOption(\"loglevel\", loglevel);\n\t\t\t\n\t\t\t\/\/ temporary hack\n\t\t\tif (isDaemon || logs != \"\") isLogging = true;\n\n\t\t\tif (isLogging)\n\t\t\t{\n\t\t\t\tif (logfile == \"\")\n\t\t\t\t{\n\t\t\t\t\t\/\/ use autodetect of logfile\n\t\t\t\t\tlogfile = IsService () ? \"\/var\/log\" : i2p::util::filesystem::GetDataDir().string();\n#ifndef _WIN32\n\t\t\t\t\tlogfile.append(\"\/i2pd.log\");\n#else\n\t\t\t\t\tlogfile.append(\"\\\\i2pd.log\");\n#endif\n\t\t\t\t}\n\t\t\t\tStartLog (logfile);\n\t\t\t} else {\n\t\t\t\t\/\/ use stdout\n\t\t\t\tStartLog (\"\");\n\t\t\t}\n\t\t\tSetLogLevel(loglevel);\n\t\t\t\n\t\t\tbool http; i2p::config::GetOption(\"http.enabled\", http);\n\t\t\tif (http) {\n\t\t\t\tstd::string httpAddr; i2p::config::GetOption(\"http.address\", httpAddr);\n\t\t\t\tuint16_t httpPort; i2p::config::GetOption(\"http.port\", httpPort);\n\t\t\t\tLogPrint(eLogInfo, \"Daemon: starting HTTP Server at \", httpAddr, \":\", httpPort);\n\t\t\t\td.httpServer = std::unique_ptr<i2p::util::HTTPServer>(new i2p::util::HTTPServer(httpAddr, httpPort));\n\t\t\t\td.httpServer->Start();\n\t\t\t}\n\n\t\t\tLogPrint(eLogInfo, \"Daemon: starting NetDB\");\n\t\t\ti2p::data::netdb.Start();\n\n#ifdef USE_UPNP\n\t\t\tLogPrint(eLogInfo, \"Daemon: starting UPnP\");\n\t\t\td.m_UPnP.Start ();\n#endif\t\t\t\n\t\t\tLogPrint(eLogInfo, \"Daemon: starting Transports\");\n\t\t\ti2p::transport::transports.Start();\n\n\t\t\tLogPrint(eLogInfo, \"Daemon: starting Tunnels\");\n\t\t\ti2p::tunnel::tunnels.Start();\n\n\t\t\tLogPrint(eLogInfo, \"Daemon: starting Client\");\n\t\t\ti2p::client::context.Start ();\n\n\t\t\t\/\/ I2P Control Protocol\n\t\t\tbool i2pcontrol; i2p::config::GetOption(\"i2pcontrol.enabled\", i2pcontrol);\n\t\t\tif (i2pcontrol) {\n\t\t\t\tstd::string i2pcpAddr; i2p::config::GetOption(\"i2pcontrol.address\", i2pcpAddr);\n\t\t\t\tuint16_t i2pcpPort; i2p::config::GetOption(\"i2pcontrol.port\", i2pcpPort);\n\t\t\t\tLogPrint(eLogInfo, \"Daemon: starting I2PControl at \", i2pcpAddr, \":\", i2pcpPort);\n\t\t\t\td.m_I2PControlService = std::unique_ptr<i2p::client::I2PControlService>(new i2p::client::I2PControlService (i2pcpAddr, i2pcpPort));\n\t\t\t\td.m_I2PControlService->Start ();\n\t\t\t}\n\t\t\treturn true;\n\t\t}\n\n\t\tbool Daemon_Singleton::stop()\n\t\t{\n\t\t\tLogPrint(eLogInfo, \"Daemon: shutting down\");\n\t\t\tLogPrint(eLogInfo, \"Daemon: stopping Client\");\n\t\t\ti2p::client::context.Stop();\n\t\t\tLogPrint(eLogInfo, \"Daemon: stopping Tunnels\");\n\t\t\ti2p::tunnel::tunnels.Stop();\n#ifdef USE_UPNP\n\t\t\tLogPrint(eLogInfo, \"Daemon: stopping UPnP\");\n\t\t\td.m_UPnP.Stop ();\n#endif\t\t\t\n\t\t\tLogPrint(eLogInfo, \"Daemon: stopping Transports\");\n\t\t\ti2p::transport::transports.Stop();\n\t\t\tLogPrint(eLogInfo, \"Daemon: stopping NetDB\");\n\t\t\ti2p::data::netdb.Stop();\n\t\t\tLogPrint(eLogInfo, \"Daemon: stopping HTTP Server\");\n\t\t\td.httpServer->Stop();\n\t\t\td.httpServer = nullptr;\n\t\t\tif (d.m_I2PControlService)\n\t\t\t{\n\t\t\t\tLogPrint(eLogInfo, \"Daemon: stopping I2PControl\");\n\t\t\t\td.m_I2PControlService->Stop ();\n\t\t\t\td.m_I2PControlService = nullptr;\n\t\t\t}\t\n\t\t\ti2p::crypto::TerminateCrypto ();\n\t\t\tStopLog ();\n\n\t\t\treturn true;\n\t\t}\n\t}\n}\n<|endoftext|>"} {"text":"<commit_before>\/\/ Copyright (c) 2021 by Robert Bosch GmbH. All rights reserved.\n\/\/\n\/\/ Licensed under the Apache License, Version 2.0 (the \"License\");\n\/\/ you may not use this file except in compliance with the License.\n\/\/ You may obtain a copy of the License at\n\/\/\n\/\/ http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n\/\/\n\/\/ Unless required by applicable law or agreed to in writing, software\n\/\/ distributed under the License is distributed on an \"AS IS\" BASIS,\n\/\/ WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n\/\/ See the License for the specific language governing permissions and\n\/\/ limitations under the License.\n\n#include \"test.hpp\"\n\n#include \"iceoryx_posh\/roudi\/memory\/iceoryx_roudi_memory_manager.hpp\"\n\nusing namespace ::testing;\n\nusing iox::roudi::IceOryxRouDiMemoryManager;\n\nnamespace iox\n{\nnamespace test\n{\n\n\/\/\/ @brief This test file verifies that the BaseClass IceoryxRouDiMemoryManager is tested\nclass IceoryxRoudiMemoryManager_test : public Test\n{\n public:\n IceOryxRouDiMemoryManager* m_roudiMemoryManagerTest{nullptr};\n\n void SetUp() override\n {\n auto config = iox::RouDiConfig_t().setDefaults();\n m_roudiMemoryManagerTest = new IceOryxRouDiMemoryManager(config);\n }\n\n void TearDown() override\n {\n delete m_roudiMemoryManagerTest;\n }\n};\n\n\/\/\/ @brief test to check function introspectionMemoryManager\nTEST_F(IceoryxRoudiMemoryManager_test, IntrospectionMemoryManagerNotInitialized)\n{\n auto result = m_roudiMemoryManagerTest->introspectionMemoryManager();\n EXPECT_THAT(result, Eq(iox::cxx::nullopt_t()));\n}\n\n\/\/\/ @brief test to check function segmentManager\nTEST_F(IceoryxRoudiMemoryManager_test, segmentManagerNotInitialized)\n{\n auto resultTest = m_roudiMemoryManagerTest->segmentManager();\n EXPECT_THAT(resultTest, Eq(iox::cxx::nullopt_t()));\n}\n\n\/\/\/ @brief test to check function portPool\nTEST_F(IceoryxRoudiMemoryManager_test, portPoolNotInitialized)\n{\n auto testResult = m_roudiMemoryManagerTest->portPool();\n EXPECT_THAT(testResult, Eq(iox::cxx::nullopt_t()));\n}\n\n} \/\/ namespace test \n} \/\/ iox\n<commit_msg>iox-#454 fix review findings<commit_after>\/\/ Copyright (c) 2021 by Robert Bosch GmbH. All rights reserved.\n\/\/\n\/\/ Licensed under the Apache License, Version 2.0 (the \"License\");\n\/\/ you may not use this file except in compliance with the License.\n\/\/ You may obtain a copy of the License at\n\/\/\n\/\/ http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n\/\/\n\/\/ Unless required by applicable law or agreed to in writing, software\n\/\/ distributed under the License is distributed on an \"AS IS\" BASIS,\n\/\/ WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n\/\/ See the License for the specific language governing permissions and\n\/\/ limitations under the License.\n\n#include \"test.hpp\"\n\n#include \"iceoryx_posh\/roudi\/memory\/iceoryx_roudi_memory_manager.hpp\"\n\nusing namespace ::testing;\n\nusing iox::roudi::IceOryxRouDiMemoryManager;\n\nnamespace iox\n{\nnamespace test\n{\n\n\/\/\/ @brief This test file verifies that the BaseClass IceoryxRouDiMemoryManager is tested\nclass IceoryxRoudiMemoryManager_test : public Test\n{\n public:\n std::unique_ptr<IceOryxRouDiMemoryManager> m_roudiMemoryManagerTest;\n\n void SetUp() override\n {\n auto config = iox::RouDiConfig_t().setDefaults();\n m_roudiMemoryManagerTest = std::unique_ptr<IceOryxRouDiMemoryManager>(new IceOryxRouDiMemoryManager(config));\n }\n\n void TearDown() override\n {\n }\n};\n\n\/\/\/ @brief test to check function introspectionMemoryManager\nTEST_F(IceoryxRoudiMemoryManager_test, IntrospectionMemoryManagerNotInitialized)\n{\n auto result = m_roudiMemoryManagerTest->introspectionMemoryManager();\n EXPECT_THAT(result, Eq(iox::cxx::nullopt_t()));\n}\n\n\/\/\/ @brief test to check function segmentManager\nTEST_F(IceoryxRoudiMemoryManager_test, segmentManagerNotInitialized)\n{\n auto resultTest = m_roudiMemoryManagerTest->segmentManager();\n EXPECT_THAT(resultTest, Eq(iox::cxx::nullopt_t()));\n}\n\n\/\/\/ @brief test to check function portPool\nTEST_F(IceoryxRoudiMemoryManager_test, portPoolNotInitialized)\n{\n auto testResult = m_roudiMemoryManagerTest->portPool();\n EXPECT_THAT(testResult, Eq(iox::cxx::nullopt_t()));\n}\n\n} \/\/ namespace test \n} \/\/ iox\n<|endoftext|>"} {"text":"<commit_before>#include <stdio.h>\r\n#include <iostream>\r\n#include \"MatrixStore.hpp\"\r\n\r\nint main(){\r\n\r\n\tclass MatrixStore<double> MatA(3, 3); MatA.Zeros();\r\n\tclass MatrixStore<double> MatB(3, 3); MatB.Zeros();\r\n\r\n\tfor(unsigned int q=0; q<MatA.ColNum; q++){\r\n\t\tfor(unsigned int p=0; p<MatA.RowNum; p++){\r\n\t\t\tMatA(p, q) = (MatA.ColNum)*p + q;\r\n\t\t}\r\n\t}\r\n\r\n\tprintm(MatA); printf(\"\\n\");\r\n\r\n\tMatB(':', 0) = MatA(':', 1);\r\n\/\/\tMatB(':', 1) = MatA(':', 2);\r\n\/\/\tMatB(':', 2) = MatA(':', 0);\r\n\r\n\tprintm(MatB); printf(\"\\n\");\r\n\r\n\tMatB(0, ':') = MatA(0, ':');\r\n\/\/\tMatB(1, ':') = MatA(1, ':');\r\n\tMatB(2, ':') = MatA(2, ':');\r\n\r\n\tprintm(MatB);\r\n\r\n\treturn 0;\r\n}\r\n<commit_msg>Delete main.cpp<commit_after><|endoftext|>"} {"text":"<commit_before>\/*\n-----------------------------------------------------------------------------\nThis source file is part of OGRE\n(Object-oriented Graphics Rendering Engine)\nFor the latest info, see http:\/\/www.ogre3d.org\n\nCopyright (c) 2000-2014 Torus Knot Software Ltd\n\nPermission is hereby granted, free of charge, to any person obtaining a copy\nof this software and associated documentation files (the \"Software\"), to deal\nin the Software without restriction, including without limitation the rights\nto use, copy, modify, merge, publish, distribute, sublicense, and\/or sell\ncopies of the Software, and to permit persons to whom the Software is\nfurnished to do so, subject to the following conditions:\n\nThe above copyright notice and this permission notice shall be included in\nall copies or substantial portions of the Software.\n\nTHE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\nIMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\nFITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE\nAUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\nLIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,\nOUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN\nTHE SOFTWARE.\n-----------------------------------------------------------------------------\n*\/\n#include \"OgreStableHeaders.h\"\n#include \"OgreException.h\"\n#include \"OgreScriptLexer.h\"\n\nnamespace Ogre{\n\n\tScriptLexer::ScriptLexer()\n\t{\n\t}\n\n\tScriptTokenListPtr ScriptLexer::tokenize(const String &str, const String &source)\n\t{\n\t\t\/\/ State enums\n\t\tenum{ READY = 0, COMMENT, MULTICOMMENT, WORD, QUOTE, VAR, POSSIBLECOMMENT };\n\n\t\t\/\/ Set up some constant characters of interest\n\t\tconst wchar_t varopener = '$', quote = '\\\"', slash = '\/', backslash = '\\\\', openbrace = '{', closebrace = '}', colon = ':', star = '*', cr = '\\r', lf = '\\n';\n\t\tchar c = 0, lastc = 0;\n\n\t\tString lexeme;\n\t\tuint32 line = 1, state = READY, lastQuote = 0;\n\t\tScriptTokenListPtr tokens(OGRE_NEW_T(ScriptTokenList, MEMCATEGORY_GENERAL)(), SPFM_DELETE_T);\n\n\t\t\/\/ Iterate over the input\n\t\tString::const_iterator i = str.begin(), end = str.end();\n\t\twhile(i != end)\n\t\t{\n\t\t\tlastc = c;\n\t\t\tc = *i;\n\n\t\t\tif(c == quote)\n\t\t\t\tlastQuote = line;\n\n\t\t\tswitch(state)\n\t\t\t{\n\t\t\tcase READY:\n\t\t\t\tif(c == slash && lastc == slash)\n\t\t\t\t{\n\t\t\t\t\t\/\/ Comment start, clear out the lexeme\n\t\t\t\t\tlexeme = \"\";\n\t\t\t\t\tstate = COMMENT;\n\t\t\t\t}\n\t\t\t\telse if(c == star && lastc == slash)\n\t\t\t\t{\n\t\t\t\t\tlexeme = \"\";\n\t\t\t\t\tstate = MULTICOMMENT;\n\t\t\t\t}\n\t\t\t\telse if(c == quote)\n\t\t\t\t{\n\t\t\t\t\t\/\/ Clear out the lexeme ready to be filled with quotes!\n\t\t\t\t\tlexeme = c;\n\t\t\t\t\tstate = QUOTE;\n\t\t\t\t}\n\t\t\t\telse if(c == varopener)\n\t\t\t\t{\n\t\t\t\t\t\/\/ Set up to read in a variable\n\t\t\t\t\tlexeme = c;\n\t\t\t\t\tstate = VAR;\n\t\t\t\t}\n\t\t\t\telse if(isNewline(c))\n\t\t\t\t{\n\t\t\t\t\tlexeme = c;\n\t\t\t\t\tsetToken(lexeme, line, source, tokens.get());\n\t\t\t\t}\n\t\t\t\telse if(!isWhitespace(c))\n\t\t\t\t{\n\t\t\t\t\tlexeme = c;\n\t\t\t\t\tif(c == slash)\n\t\t\t\t\t\tstate = POSSIBLECOMMENT;\n\t\t\t\t\telse\n\t\t\t\t\t\tstate = WORD;\n\t\t\t\t}\n\t\t\t\tbreak;\n\t\t\tcase COMMENT:\n\t\t\t\tif(isNewline(c))\n\t\t\t\t{\n\t\t\t\t\tlexeme = c;\n\t\t\t\t\tsetToken(lexeme, line, source, tokens.get());\n\t\t\t\t\tstate = READY;\n\t\t\t\t}\n\t\t\t\tbreak;\n\t\t\tcase MULTICOMMENT:\n\t\t\t\tif(c == slash && lastc == star)\n\t\t\t\t\tstate = READY;\n\t\t\t\tbreak;\n\t\t\tcase POSSIBLECOMMENT:\n\t\t\t\tif(c == slash && lastc == slash)\n\t\t\t\t{\n\t\t\t\t\tlexeme = \"\";\n\t\t\t\t\tstate = COMMENT;\n\t\t\t\t\tbreak;\t\n\t\t\t\t}\n\t\t\t\telse if(c == star && lastc == slash)\n\t\t\t\t{\n\t\t\t\t\tlexeme = \"\";\n\t\t\t\t\tstate = MULTICOMMENT;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t\telse\n\t\t\t\t{\n\t\t\t\t\tstate = WORD;\n\t\t\t\t}\n\t\t\tcase WORD:\n\t\t\t\tif(isNewline(c))\n\t\t\t\t{\n\t\t\t\t\tsetToken(lexeme, line, source, tokens.get());\n\t\t\t\t\tlexeme = c;\n\t\t\t\t\tsetToken(lexeme, line, source, tokens.get());\n\t\t\t\t\tstate = READY;\n\t\t\t\t}\n\t\t\t\telse if(isWhitespace(c))\n\t\t\t\t{\n\t\t\t\t\tsetToken(lexeme, line, source, tokens.get());\n\t\t\t\t\tstate = READY;\n\t\t\t\t}\n\t\t\t\telse if(c == openbrace || c == closebrace || c == colon)\n\t\t\t\t{\n\t\t\t\t\tsetToken(lexeme, line, source, tokens.get());\n\t\t\t\t\tlexeme = c;\n\t\t\t\t\tsetToken(lexeme, line, source, tokens.get());\n\t\t\t\t\tstate = READY;\n\t\t\t\t}\n\t\t\t\telse\n\t\t\t\t{\n\t\t\t\t\tlexeme += c;\n\t\t\t\t}\n\t\t\t\tbreak;\n\t\t\tcase QUOTE:\n\t\t\t\tif(c != backslash)\n\t\t\t\t{\n\t\t\t\t\t\/\/ Allow embedded quotes with escaping\n\t\t\t\t\tif(c == quote && lastc == backslash)\n\t\t\t\t\t{\n\t\t\t\t\t\tlexeme += c;\n\t\t\t\t\t}\n\t\t\t\t\telse if(c == quote)\n\t\t\t\t\t{\n\t\t\t\t\t\tlexeme += c;\n\t\t\t\t\t\tsetToken(lexeme, line, source, tokens.get());\n\t\t\t\t\t\tstate = READY;\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\/\/ Backtrack here and allow a backslash normally within the quote\n\t\t\t\t\t\tif(lastc == backslash)\n\t\t\t\t\t\t\tlexeme = lexeme + \"\\\\\" + c;\n\t\t\t\t\t\telse\n\t\t\t\t\t\t\tlexeme += c;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\tbreak;\n\t\t\tcase VAR:\n\t\t\t\tif(isNewline(c))\n\t\t\t\t{\n\t\t\t\t\tsetToken(lexeme, line, source, tokens.get());\n\t\t\t\t\tlexeme = c;\n\t\t\t\t\tsetToken(lexeme, line, source, tokens.get());\n\t\t\t\t\tstate = READY;\n\t\t\t\t}\n\t\t\t\telse if(isWhitespace(c))\n\t\t\t\t{\n\t\t\t\t\tsetToken(lexeme, line, source, tokens.get());\n\t\t\t\t\tstate = READY;\n\t\t\t\t}\n\t\t\t\telse if(c == openbrace || c == closebrace || c == colon)\n\t\t\t\t{\n\t\t\t\t\tsetToken(lexeme, line, source, tokens.get());\n\t\t\t\t\tlexeme = c;\n\t\t\t\t\tsetToken(lexeme, line, source, tokens.get());\n\t\t\t\t\tstate = READY;\n\t\t\t\t}\n\t\t\t\telse\n\t\t\t\t{\n\t\t\t\t\tlexeme += c;\n\t\t\t\t}\n\t\t\t\tbreak;\n\t\t\t}\n\n\t\t\t\/\/ Separate check for newlines just to track line numbers\n\t\t\tif(c == cr || (c == lf && lastc != cr))\n\t\t\t\tline++;\n\t\t\t\n\t\t\ti++;\n\t\t}\n\n\t\t\/\/ Check for valid exit states\n\t\tif(state == WORD || state == VAR)\n\t\t{\n\t\t\tif(!lexeme.empty())\n\t\t\t\tsetToken(lexeme, line, source, tokens.get());\n\t\t}\n\t\telse\n\t\t{\n\t\t\tif(state == QUOTE)\n\t\t\t{\n\t\t\t\tOGRE_EXCEPT(Exception::ERR_INVALID_STATE, \n\t\t\t\t\tOgre::String(\"no matching \\\" found for \\\" at line \") + \n\t\t\t\t\t\tOgre::StringConverter::toString(lastQuote),\n\t\t\t\t\t\"ScriptLexer::tokenize\");\n\t\t\t}\n\t\t}\n\n\t\treturn tokens;\n\t}\n\n\tvoid ScriptLexer::setToken(const Ogre::String &lexeme, Ogre::uint32 line, const String &source, Ogre::ScriptTokenList *tokens)\n\t{\n\t\tconst char openBracket = '{', closeBracket = '}', colon = ':',\n\t\t\tquote = '\\\"', var = '$';\n\n\t\tScriptTokenPtr token(OGRE_NEW_T(ScriptToken, MEMCATEGORY_GENERAL)(), SPFM_DELETE_T);\n\t\ttoken->lexeme = lexeme;\n\t\ttoken->line = line;\n\t\ttoken->file = source;\n\t\tbool ignore = false;\n\n\t\t\/\/ Check the user token map first\n\t\tif(lexeme.size() == 1 && isNewline(lexeme[0]))\n\t\t{\n\t\t\ttoken->type = TID_NEWLINE;\n\t\t\tif(!tokens->empty() && tokens->back()->type == TID_NEWLINE)\n\t\t\t\tignore = true;\n\t\t}\n\t\telse if(lexeme.size() == 1 && lexeme[0] == openBracket)\n\t\t\ttoken->type = TID_LBRACKET;\n\t\telse if(lexeme.size() == 1 && lexeme[0] == closeBracket)\n\t\t\ttoken->type = TID_RBRACKET;\n\t\telse if(lexeme.size() == 1 && lexeme[0] == colon)\n\t\t\ttoken->type = TID_COLON;\n\t\telse if(lexeme[0] == var)\n\t\t\ttoken->type = TID_VARIABLE;\n\t\telse\n\t\t{\n\t\t\t\/\/ This is either a non-zero length phrase or quoted phrase\n\t\t\tif(lexeme.size() >= 2 && lexeme[0] == quote && lexeme[lexeme.size() - 1] == quote)\n\t\t\t{\n\t\t\t\ttoken->type = TID_QUOTE;\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\ttoken->type = TID_WORD;\n\t\t\t}\n\t\t}\n\n\t\tif(!ignore)\n\t\t\ttokens->push_back(token);\n\t}\n\n\tbool ScriptLexer::isWhitespace(Ogre::String::value_type c) const\n\t{\n\t\treturn c == ' ' || c == '\\r' || c == '\\t';\n\t}\n\n\tbool ScriptLexer::isNewline(Ogre::String::value_type c) const\n\t{\n\t\treturn c == '\\n' || c == '\\r';\n\t}\n\n}\n\n<commit_msg>Corrected spaces\/tabs of script lexer code for future merge<commit_after>\/*\n-----------------------------------------------------------------------------\nThis source file is part of OGRE\n(Object-oriented Graphics Rendering Engine)\nFor the latest info, see http:\/\/www.ogre3d.org\n\nCopyright (c) 2000-2014 Torus Knot Software Ltd\n\nPermission is hereby granted, free of charge, to any person obtaining a copy\nof this software and associated documentation files (the \"Software\"), to deal\nin the Software without restriction, including without limitation the rights\nto use, copy, modify, merge, publish, distribute, sublicense, and\/or sell\ncopies of the Software, and to permit persons to whom the Software is\nfurnished to do so, subject to the following conditions:\n\nThe above copyright notice and this permission notice shall be included in\nall copies or substantial portions of the Software.\n\nTHE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\nIMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\nFITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE\nAUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\nLIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,\nOUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN\nTHE SOFTWARE.\n-----------------------------------------------------------------------------\n*\/\n#include \"OgreStableHeaders.h\"\n#include \"OgreException.h\"\n#include \"OgreScriptLexer.h\"\n\nnamespace Ogre{\n\n ScriptLexer::ScriptLexer()\n {\n }\n\n ScriptTokenListPtr ScriptLexer::tokenize(const String &str, const String &source)\n {\n \/\/ State enums\n enum{ READY = 0, COMMENT, MULTICOMMENT, WORD, QUOTE, VAR, POSSIBLECOMMENT };\n\n \/\/ Set up some constant characters of interest\n const wchar_t varopener = '$', quote = '\\\"', slash = '\/', backslash = '\\\\', openbrace = '{', closebrace = '}', colon = ':', star = '*', cr = '\\r', lf = '\\n';\n char c = 0, lastc = 0;\n\n String lexeme;\n uint32 line = 1, state = READY, lastQuote = 0;\n ScriptTokenListPtr tokens(OGRE_NEW_T(ScriptTokenList, MEMCATEGORY_GENERAL)(), SPFM_DELETE_T);\n\n \/\/ Iterate over the input\n String::const_iterator i = str.begin(), end = str.end();\n while(i != end)\n {\n lastc = c;\n c = *i;\n\n if(c == quote)\n lastQuote = line;\n\n switch(state)\n {\n case READY:\n if(c == slash && lastc == slash)\n {\n \/\/ Comment start, clear out the lexeme\n lexeme = \"\";\n state = COMMENT;\n }\n else if(c == star && lastc == slash)\n {\n lexeme = \"\";\n state = MULTICOMMENT;\n }\n else if(c == quote)\n {\n \/\/ Clear out the lexeme ready to be filled with quotes!\n lexeme = c;\n state = QUOTE;\n }\n else if(c == varopener)\n {\n \/\/ Set up to read in a variable\n lexeme = c;\n state = VAR;\n }\n else if(isNewline(c))\n {\n lexeme = c;\n setToken(lexeme, line, source, tokens.get());\n }\n else if(!isWhitespace(c))\n {\n lexeme = c;\n if(c == slash)\n state = POSSIBLECOMMENT;\n else\n state = WORD;\n }\n break;\n case COMMENT:\n if(isNewline(c))\n {\n lexeme = c;\n setToken(lexeme, line, source, tokens.get());\n state = READY;\n }\n break;\n case MULTICOMMENT:\n if(c == slash && lastc == star)\n state = READY;\n break;\n case POSSIBLECOMMENT:\n if(c == slash && lastc == slash)\n {\n lexeme = \"\";\n state = COMMENT;\n break;\t\n }\n else if(c == star && lastc == slash)\n {\n lexeme = \"\";\n state = MULTICOMMENT;\n break;\n }\n else\n {\n state = WORD;\n }\n case WORD:\n if(isNewline(c))\n {\n setToken(lexeme, line, source, tokens.get());\n lexeme = c;\n setToken(lexeme, line, source, tokens.get());\n state = READY;\n }\n else if(isWhitespace(c))\n {\n setToken(lexeme, line, source, tokens.get());\n state = READY;\n }\n else if(c == openbrace || c == closebrace || c == colon)\n {\n setToken(lexeme, line, source, tokens.get());\n lexeme = c;\n setToken(lexeme, line, source, tokens.get());\n state = READY;\n }\n else\n {\n lexeme += c;\n }\n break;\n case QUOTE:\n if(c != backslash)\n {\n \/\/ Allow embedded quotes with escaping\n if(c == quote && lastc == backslash)\n {\n lexeme += c;\n }\n else if(c == quote)\n {\n lexeme += c;\n setToken(lexeme, line, source, tokens.get());\n state = READY;\n }\n else\n {\n \/\/ Backtrack here and allow a backslash normally within the quote\n if(lastc == backslash)\n lexeme = lexeme + \"\\\\\" + c;\n else\n lexeme += c;\n }\n }\n break;\n case VAR:\n if(isNewline(c))\n {\n setToken(lexeme, line, source, tokens.get());\n lexeme = c;\n setToken(lexeme, line, source, tokens.get());\n state = READY;\n }\n else if(isWhitespace(c))\n {\n setToken(lexeme, line, source, tokens.get());\n state = READY;\n }\n else if(c == openbrace || c == closebrace || c == colon)\n {\n setToken(lexeme, line, source, tokens.get());\n lexeme = c;\n setToken(lexeme, line, source, tokens.get());\n state = READY;\n }\n else\n {\n lexeme += c;\n }\n break;\n }\n\n \/\/ Separate check for newlines just to track line numbers\n if(c == cr || (c == lf && lastc != cr))\n line++;\n\n i++;\n }\n\n \/\/ Check for valid exit states\n if(state == WORD || state == VAR)\n {\n if(!lexeme.empty())\n setToken(lexeme, line, source, tokens.get());\n }\n else\n {\n if(state == QUOTE)\n {\n OGRE_EXCEPT(Exception::ERR_INVALID_STATE, \n Ogre::String(\"no matching \\\" found for \\\" at line \") + \n Ogre::StringConverter::toString(lastQuote),\n \"ScriptLexer::tokenize\");\n }\n }\n\n return tokens;\n }\n\n void ScriptLexer::setToken(const Ogre::String &lexeme, Ogre::uint32 line, const String &source, Ogre::ScriptTokenList *tokens)\n {\n const char openBracket = '{', closeBracket = '}', colon = ':',\n quote = '\\\"', var = '$';\n\n ScriptTokenPtr token(OGRE_NEW_T(ScriptToken, MEMCATEGORY_GENERAL)(), SPFM_DELETE_T);\n token->lexeme = lexeme;\n token->line = line;\n token->file = source;\n bool ignore = false;\n\n \/\/ Check the user token map first\n if(lexeme.size() == 1 && isNewline(lexeme[0]))\n {\n token->type = TID_NEWLINE;\n if(!tokens->empty() && tokens->back()->type == TID_NEWLINE)\n ignore = true;\n }\n else if(lexeme.size() == 1 && lexeme[0] == openBracket)\n token->type = TID_LBRACKET;\n else if(lexeme.size() == 1 && lexeme[0] == closeBracket)\n token->type = TID_RBRACKET;\n else if(lexeme.size() == 1 && lexeme[0] == colon)\n token->type = TID_COLON;\n else if(lexeme[0] == var)\n token->type = TID_VARIABLE;\n else\n {\n \/\/ This is either a non-zero length phrase or quoted phrase\n if(lexeme.size() >= 2 && lexeme[0] == quote && lexeme[lexeme.size() - 1] == quote)\n {\n token->type = TID_QUOTE;\n }\n else\n {\n token->type = TID_WORD;\n }\n }\n\n if(!ignore)\n tokens->push_back(token);\n }\n\n bool ScriptLexer::isWhitespace(Ogre::String::value_type c) const\n {\n return c == ' ' || c == '\\r' || c == '\\t';\n }\n\n bool ScriptLexer::isNewline(Ogre::String::value_type c) const\n {\n return c == '\\n' || c == '\\r';\n }\n\n}\n\n<|endoftext|>"} {"text":"<commit_before>\/*\n Source File : PDFParserTokenizer.cpp\n\n\n Copyright 2011 Gal Kahana PDFWriter\n\n Licensed under the Apache License, Version 2.0 (the \"License\");\n you may not use this file except in compliance with the License.\n You may obtain a copy of the License at\n\n http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n\n Unless required by applicable law or agreed to in writing, software\n distributed under the License is distributed on an \"AS IS\" BASIS,\n WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n See the License for the specific language governing permissions and\n limitations under the License.\n\n \n*\/\n#include \"PDFParserTokenizer.h\"\n#include \"IByteReader.h\"\n#include \"OutputStringBufferStream.h\"\n\nusing namespace PDFHummus;\nusing namespace IOBasicTypes;\n\nPDFParserTokenizer::PDFParserTokenizer(void)\n{\n\tmStream = NULL;\n\tResetReadState();\n}\n\nPDFParserTokenizer::~PDFParserTokenizer(void)\n{\n}\n\nvoid PDFParserTokenizer::SetReadStream(IByteReader* inSourceStream)\n{\n\tmStream = inSourceStream;\n\tResetReadState();\n}\n\nvoid PDFParserTokenizer::ResetReadState()\n{\n\tmHasTokenBuffer = false;\n\tmStreamPositionTracker = 0;\n\tmRecentTokenPosition = 0;\n}\n\n\nvoid PDFParserTokenizer::ResetReadState(const PDFParserTokenizer& inExternalTokenizer)\n{\n\tmTokenBuffer = inExternalTokenizer.mTokenBuffer;\n\tmHasTokenBuffer = inExternalTokenizer.mHasTokenBuffer;\n\tmStreamPositionTracker = inExternalTokenizer.mStreamPositionTracker;\n\tmRecentTokenPosition = inExternalTokenizer.mRecentTokenPosition;\n}\n\nstatic const Byte scBackSlash[] = {'\\\\'};\nstatic const std::string scStream = \"stream\";\nstatic const char scCR = '\\r';\nstatic const char scLF = '\\n';\nBoolAndString PDFParserTokenizer::GetNextToken()\n{\n\tBoolAndString result;\n\tByte buffer;\n\tOutputStringBufferStream tokenBuffer;\n\t\n\tif(!mStream || (!mStream->NotEnded() && !mHasTokenBuffer))\n\t{\n\t\tresult.first = false;\n\t\treturn result;\n\t}\n\n\tdo\n\t{\n\t\tSkipTillToken();\n\t\tif(!mStream->NotEnded())\n\t\t{\n\t\t\tresult.first = false;\n\t\t\tbreak;\n\t\t}\n\n\n\t\t\/\/ before reading the first byte save the token position, for external queries\n\t\tmRecentTokenPosition = mStreamPositionTracker;\n\n\t\t\/\/ get the first byte of the token\n\t\tif(GetNextByteForToken(buffer) != PDFHummus::eSuccess)\n\t\t{\n\t\t\tresult.first = false;\n\t\t\tbreak;\n\t\t}\n\t\ttokenBuffer.Write(&buffer,1);\n\n\t\tresult.first = true; \/\/ will only be changed to false in case of read error\n\n\t\t\/\/ now determine how to continue based on the first byte of the token (there are some special cases)\n\t\tswitch(buffer)\n\t\t{\n\t\t\n\t\t\tcase '%':\n\t\t\t{\n\t\t\t\t\/\/ for a comment, the token goes on till the end of line marker [not including]\n\t\t\t\twhile(mStream->NotEnded())\n\t\t\t\t{\n\t\t\t\t\tif(GetNextByteForToken(buffer) != PDFHummus::eSuccess)\n\t\t\t\t\t{\t\n\t\t\t\t\t\tresult.first = false;\n\t\t\t\t\t\tbreak;\n\t\t\t\t\t}\n\t\t\t\t\tif(0xD == buffer|| 0xA == buffer)\n\t\t\t\t\t\tbreak;\n\t\t\t\t\ttokenBuffer.Write(&buffer,1);\n\t\t\t\t}\n\t\t\t\tresult.second = tokenBuffer.ToString();\n\t\t\t\tbreak;\n\t\t\t}\n\n\t\t\tcase '(':\n\t\t\t{\n\t\t\t\t\/\/ for a literal string, the token goes on until the balanced-closing right paranthesis\n\t\t\t\tint balanceLevel = 1;\n\t\t\t\tbool backSlashEncountered = false;\n\t\t\t\twhile(balanceLevel > 0 && mStream->NotEnded())\n\t\t\t\t{\n\t\t\t\t\tif(GetNextByteForToken(buffer) != PDFHummus::eSuccess)\n\t\t\t\t\t{\t\n\t\t\t\t\t\tresult.first = false;\n\t\t\t\t\t\tbreak;\n\t\t\t\t\t}\n\t\t\t\n\t\t\t\t\tif(backSlashEncountered)\n\t\t\t\t\t{\n\t\t\t\t\t\tbackSlashEncountered = false;\n\t\t\t\t\t\tif(0xA == buffer || 0xD == buffer)\n\t\t\t\t\t\t{\n\t\t\t\t\t\t\t\/\/ ignore backslash and newline. might also need to read extra\n\t\t\t\t\t\t\t\/\/ for cr-ln\n\t\t\t\t\t\t\tif(0xD == buffer && mStream->NotEnded())\n\t\t\t\t\t\t\t{\n\t\t\t\t\t\t\t\tif(GetNextByteForToken(buffer) != PDFHummus::eSuccess)\n\t\t\t\t\t\t\t\t{\n\t\t\t\t\t\t\t\t\tresult.first = false;\n\t\t\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\tif(buffer != 0xA)\n\t\t\t\t\t\t\t\t\tSaveTokenBuffer(buffer);\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t}\n\t\t\t\t\t\telse\n\t\t\t\t\t\t{\n\t\t\t\t\t\t\ttokenBuffer.Write(scBackSlash,1);\t\t\t\t\t\n\t\t\t\t\t\t\ttokenBuffer.Write(&buffer,1);\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t\telse\n\t\t\t\t\t{\n\t\t\t\t\t\tif('\\\\' == buffer)\n\t\t\t\t\t\t{\n\t\t\t\t\t\t\tbackSlashEncountered = true; \n\t\t\t\t\t\t\tcontinue;\n\t\t\t\t\t\t}\n\t\t\t\t\t\telse if('(' == buffer)\n\t\t\t\t\t\t\t++balanceLevel;\n\t\t\t\t\t\telse if(')' == buffer)\n\t\t\t\t\t\t\t--balanceLevel;\n\t\t\t\t\t\ttokenBuffer.Write(&buffer,1);\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\tif(result.first)\n\t\t\t\t\tresult.second = tokenBuffer.ToString();\n\t\t\t\tbreak;\n\t\t\t}\n\n\t\t\tcase '<':\n\t\t\t{\n\t\t\t\t\/\/ k. this might be a dictionary start marker or a hax string start. depending on whether it has a < following it or not\n\n\t\t\t\t\/\/ Hex string, read till end of hex string marker\n\t\t\t\tif(!mStream->NotEnded())\n\t\t\t\t{\n\t\t\t\t\tresult.second = tokenBuffer.ToString();\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\n\t\t\t\tif(GetNextByteForToken(buffer) != PDFHummus::eSuccess)\n\t\t\t\t{\t\n\t\t\t\t\t\tresult.first = false;\n\t\t\t\t\t\tbreak;\n\t\t\t\t}\n\n\t\t\t\tif('<' == buffer)\n\t\t\t\t{\n\t\t\t\t\t\/\/ Dictionary start marker\n\t\t\t\t\ttokenBuffer.Write(&buffer,1);\n\t\t\t\t\tresult.second = tokenBuffer.ToString();\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t\telse\n\t\t\t\t{\n\t\t\t\t\t\/\/ Hex string \n\n\t\t\t\t\ttokenBuffer.Write(&buffer,1);\n\n\t\t\t\t\twhile(mStream->NotEnded())\n\t\t\t\t\t{\n\t\t\t\t\t\tif(GetNextByteForToken(buffer) != PDFHummus::eSuccess)\n\t\t\t\t\t\t{\t\n\t\t\t\t\t\t\tresult.first = false;\n\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\t}\n\n\t\t\t\t\t\tif(!IsPDFWhiteSpace(buffer))\n\t\t\t\t\t\t\ttokenBuffer.Write(&buffer,1);\n\t\t\t\t\t\tif('>' == buffer)\n\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\tresult.second = tokenBuffer.ToString();\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\tcase '[': \/\/ for all array or executable tokanizers, the tokanizer is just the mark\n\t\t\tcase ']':\n\t\t\tcase '{':\n\t\t\tcase '}':\n\t\t\t\tresult.second = tokenBuffer.ToString();\n\t\t\t\tbreak;\n\t\t\tcase '>': \/\/ parse end dictionary marker as a single entity or a hex string end marker\n\t\t\t{\n\t\t\t\tif(!mStream->NotEnded()) \/\/ this means a loose end string marker...wierd\n\t\t\t\t{\n\t\t\t\t\tresult.second = tokenBuffer.ToString();\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\n\t\t\t\tif(GetNextByteForToken(buffer) != PDFHummus::eSuccess)\n\t\t\t\t{\t\n\t\t\t\t\tresult.first = false;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\n\t\t\t\tif('>' == buffer)\n\t\t\t\t{\n\t\t\t\t\ttokenBuffer.Write(&buffer,1);\n\t\t\t\t\tresult.second = tokenBuffer.ToString();\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t\telse\n\t\t\t\t{\n\t\t\t\t\t\/\/ hex string loose end\n\t\t\t\t\tSaveTokenBuffer(buffer);\n\t\t\t\t\tresult.second = tokenBuffer.ToString();\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\n\t\t\t\tbreak;\n\t\t\t}\n\n\t\t\tdefault: \/\/ regular token. read till next breaker or whitespace\n\t\t\t{\n\t\t\t\twhile(mStream->NotEnded())\n\t\t\t\t{\n\t\t\t\t\tif(GetNextByteForToken(buffer) != PDFHummus::eSuccess)\n\t\t\t\t\t{\t\n\t\t\t\t\t\tresult.first = false;\n\t\t\t\t\t\tbreak;\n\t\t\t\t\t}\n\t\t\t\t\tif(IsPDFWhiteSpace(buffer))\n\t\t\t\t\t{\n\t\t\t\t\t\tbreak;\n\t\t\t\t\t}\n\t\t\t\t\telse if(IsPDFEntityBreaker(buffer))\n\t\t\t\t\t{\n\t\t\t\t\t\tSaveTokenBuffer(buffer); \/\/ for a non-space breaker, save the token for next token read\n\t\t\t\t\t\tbreak;\n\t\t\t\t\t}\n\t\t\t\t\telse\n\t\t\t\t\t\ttokenBuffer.Write(&buffer,1);\n\t\t\t\t}\n\t\t\t\tresult.second = tokenBuffer.ToString();\n\t\t\t\t\n\t\t\t\tif(result.first && mStream->NotEnded() && scStream == result.second)\n\t\t\t\t{\n\t\t\t\t\t\/\/ k. a bit of a special case here for streams. the reading changes after the keyword \"stream\", \n\t\t\t\t\t\/\/ essentially forcing the next content to start after either CR, CR-LF or LF. so there might be a little\n\t\t\t\t\t\/\/ skip to do here.\n\t\t\t\t\t\/\/ if indeed there's a \"stream\", so the last buffer read should have been either CR or LF, which means (respectively)\n\t\t\t\t\t\/\/ that we should either skip one more \"LF\" or do nothing (based on what was parsed)\n\t\t\t\t\t\n\t\t\t\t\t\/\/ verify that when whitespaces are finished buffer is either CR or LF, and behave accordingly\n\t\t\t\t\twhile(mStream->NotEnded()) {\n\t\t\t\t\t\tif (!IsPDFWhiteSpace(buffer)) {\n\t\t\t\t\t\t\tresult.first = false; \/\/ something wrong! not whitespace\n\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\t}\n\n\t\t\t\t\t\tif (scCR == buffer) \/\/ CR. should be CR-LF or CR alone\n\t\t\t\t\t\t{\n\t\t\t\t\t\t\tif (GetNextByteForToken(buffer) == PDFHummus::eSuccess)\n\t\t\t\t\t\t\t{\n\t\t\t\t\t\t\t\t\/\/ if CR-LF treat as a single line, otherwise put back token nicely cause CR is alone\n\t\t\t\t\t\t\t\tif (buffer != scLF)\n\t\t\t\t\t\t\t\t\tSaveTokenBuffer(buffer);\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\tresult.first = true;\n\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\t}\n\t\t\t\t\t\telse if (scLF == buffer) {\n\t\t\t\t\t\t\tresult.first = true; \n\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\t} \/\/ else - some other white space\n\n\t\t\t\t\t\tif (GetNextByteForToken(buffer) != PDFHummus::eSuccess) {\n\t\t\t\t\t\t\tresult.first = false; \/\/can't read but not eof. fail\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\tbreak;\n\t\t\t}\n\n\t\t}\n\n\t}while(false);\n\n\n\n\treturn result;\n}\n\nvoid PDFParserTokenizer::SkipTillToken()\n{\n\tByte buffer = 0;\n\n\tif(!mStream)\n\t\treturn;\n\n\t\/\/ skip till hitting first non space, or segment end\n\twhile(mStream->NotEnded())\n\t{\n\t\tif(GetNextByteForToken(buffer) != PDFHummus::eSuccess)\n\t\t\tbreak;\n\n\t\tif(!IsPDFWhiteSpace(buffer))\n\t\t{\n\t\t\tSaveTokenBuffer(buffer);\n\t\t\tbreak;\n\t\t}\n\t}\n}\n\nEStatusCode PDFParserTokenizer::GetNextByteForToken(Byte& outByte)\n{\n\t++mStreamPositionTracker; \/\/ advance position tracker, because we are reading the next byte.\n\tif(mHasTokenBuffer)\n\t{\n\t\toutByte = mTokenBuffer;\n\t\tmHasTokenBuffer = false;\n\t\treturn PDFHummus::eSuccess;\n\t}\n\telse\n\t\treturn (mStream->Read(&outByte,1) != 1) ? PDFHummus::eFailure:PDFHummus::eSuccess;\n}\n\nstatic const Byte scWhiteSpaces[] = {0,0x9,0xA,0xC,0xD,0x20};\nbool PDFParserTokenizer::IsPDFWhiteSpace(Byte inCharacter)\n{\n\tbool isWhiteSpace = false;\n\tfor(int i=0; i < 6 && !isWhiteSpace; ++i)\n\t\tisWhiteSpace = (scWhiteSpaces[i] == inCharacter);\n\treturn isWhiteSpace;\n}\n\nvoid PDFParserTokenizer::SaveTokenBuffer(Byte inToSave)\n{\n\tmHasTokenBuffer = true;\n\tmTokenBuffer = inToSave;\n\t--mStreamPositionTracker; \/\/ decreasing position trakcer, because it is as if the byte is put back in the stream\n}\n\nIOBasicTypes::LongFilePositionType PDFParserTokenizer::GetReadBufferSize()\n{\n\treturn mHasTokenBuffer ? 1 : 0;\n}\n\nstatic const Byte scEntityBreakers[] = {'(',')','<','>',']','[','{','}','\/','%'};\nbool PDFParserTokenizer::IsPDFEntityBreaker(Byte inCharacter)\n{\n\tbool isEntityBreak = false;\n\tfor(int i=0; i < 10 && !isEntityBreak; ++i)\n\t\tisEntityBreak = (scEntityBreakers[i] == inCharacter);\n\treturn isEntityBreak;\n}\n\nLongFilePositionType PDFParserTokenizer::GetRecentTokenPosition()\n{\n\treturn mRecentTokenPosition;\n}<commit_msg>allow zero length hex strings<commit_after>\/*\n Source File : PDFParserTokenizer.cpp\n\n\n Copyright 2011 Gal Kahana PDFWriter\n\n Licensed under the Apache License, Version 2.0 (the \"License\");\n you may not use this file except in compliance with the License.\n You may obtain a copy of the License at\n\n http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n\n Unless required by applicable law or agreed to in writing, software\n distributed under the License is distributed on an \"AS IS\" BASIS,\n WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n See the License for the specific language governing permissions and\n limitations under the License.\n\n \n*\/\n#include \"PDFParserTokenizer.h\"\n#include \"IByteReader.h\"\n#include \"OutputStringBufferStream.h\"\n\nusing namespace PDFHummus;\nusing namespace IOBasicTypes;\n\nPDFParserTokenizer::PDFParserTokenizer(void)\n{\n\tmStream = NULL;\n\tResetReadState();\n}\n\nPDFParserTokenizer::~PDFParserTokenizer(void)\n{\n}\n\nvoid PDFParserTokenizer::SetReadStream(IByteReader* inSourceStream)\n{\n\tmStream = inSourceStream;\n\tResetReadState();\n}\n\nvoid PDFParserTokenizer::ResetReadState()\n{\n\tmHasTokenBuffer = false;\n\tmStreamPositionTracker = 0;\n\tmRecentTokenPosition = 0;\n}\n\n\nvoid PDFParserTokenizer::ResetReadState(const PDFParserTokenizer& inExternalTokenizer)\n{\n\tmTokenBuffer = inExternalTokenizer.mTokenBuffer;\n\tmHasTokenBuffer = inExternalTokenizer.mHasTokenBuffer;\n\tmStreamPositionTracker = inExternalTokenizer.mStreamPositionTracker;\n\tmRecentTokenPosition = inExternalTokenizer.mRecentTokenPosition;\n}\n\nstatic const Byte scBackSlash[] = {'\\\\'};\nstatic const std::string scStream = \"stream\";\nstatic const char scCR = '\\r';\nstatic const char scLF = '\\n';\nBoolAndString PDFParserTokenizer::GetNextToken()\n{\n\tBoolAndString result;\n\tByte buffer;\n\tOutputStringBufferStream tokenBuffer;\n\t\n\tif(!mStream || (!mStream->NotEnded() && !mHasTokenBuffer))\n\t{\n\t\tresult.first = false;\n\t\treturn result;\n\t}\n\n\tdo\n\t{\n\t\tSkipTillToken();\n\t\tif(!mStream->NotEnded())\n\t\t{\n\t\t\tresult.first = false;\n\t\t\tbreak;\n\t\t}\n\n\n\t\t\/\/ before reading the first byte save the token position, for external queries\n\t\tmRecentTokenPosition = mStreamPositionTracker;\n\n\t\t\/\/ get the first byte of the token\n\t\tif(GetNextByteForToken(buffer) != PDFHummus::eSuccess)\n\t\t{\n\t\t\tresult.first = false;\n\t\t\tbreak;\n\t\t}\n\t\ttokenBuffer.Write(&buffer,1);\n\n\t\tresult.first = true; \/\/ will only be changed to false in case of read error\n\n\t\t\/\/ now determine how to continue based on the first byte of the token (there are some special cases)\n\t\tswitch(buffer)\n\t\t{\n\t\t\n\t\t\tcase '%':\n\t\t\t{\n\t\t\t\t\/\/ for a comment, the token goes on till the end of line marker [not including]\n\t\t\t\twhile(mStream->NotEnded())\n\t\t\t\t{\n\t\t\t\t\tif(GetNextByteForToken(buffer) != PDFHummus::eSuccess)\n\t\t\t\t\t{\t\n\t\t\t\t\t\tresult.first = false;\n\t\t\t\t\t\tbreak;\n\t\t\t\t\t}\n\t\t\t\t\tif(0xD == buffer|| 0xA == buffer)\n\t\t\t\t\t\tbreak;\n\t\t\t\t\ttokenBuffer.Write(&buffer,1);\n\t\t\t\t}\n\t\t\t\tresult.second = tokenBuffer.ToString();\n\t\t\t\tbreak;\n\t\t\t}\n\n\t\t\tcase '(':\n\t\t\t{\n\t\t\t\t\/\/ for a literal string, the token goes on until the balanced-closing right paranthesis\n\t\t\t\tint balanceLevel = 1;\n\t\t\t\tbool backSlashEncountered = false;\n\t\t\t\twhile(balanceLevel > 0 && mStream->NotEnded())\n\t\t\t\t{\n\t\t\t\t\tif(GetNextByteForToken(buffer) != PDFHummus::eSuccess)\n\t\t\t\t\t{\t\n\t\t\t\t\t\tresult.first = false;\n\t\t\t\t\t\tbreak;\n\t\t\t\t\t}\n\t\t\t\n\t\t\t\t\tif(backSlashEncountered)\n\t\t\t\t\t{\n\t\t\t\t\t\tbackSlashEncountered = false;\n\t\t\t\t\t\tif(0xA == buffer || 0xD == buffer)\n\t\t\t\t\t\t{\n\t\t\t\t\t\t\t\/\/ ignore backslash and newline. might also need to read extra\n\t\t\t\t\t\t\t\/\/ for cr-ln\n\t\t\t\t\t\t\tif(0xD == buffer && mStream->NotEnded())\n\t\t\t\t\t\t\t{\n\t\t\t\t\t\t\t\tif(GetNextByteForToken(buffer) != PDFHummus::eSuccess)\n\t\t\t\t\t\t\t\t{\n\t\t\t\t\t\t\t\t\tresult.first = false;\n\t\t\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\tif(buffer != 0xA)\n\t\t\t\t\t\t\t\t\tSaveTokenBuffer(buffer);\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t}\n\t\t\t\t\t\telse\n\t\t\t\t\t\t{\n\t\t\t\t\t\t\ttokenBuffer.Write(scBackSlash,1);\t\t\t\t\t\n\t\t\t\t\t\t\ttokenBuffer.Write(&buffer,1);\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t\telse\n\t\t\t\t\t{\n\t\t\t\t\t\tif('\\\\' == buffer)\n\t\t\t\t\t\t{\n\t\t\t\t\t\t\tbackSlashEncountered = true; \n\t\t\t\t\t\t\tcontinue;\n\t\t\t\t\t\t}\n\t\t\t\t\t\telse if('(' == buffer)\n\t\t\t\t\t\t\t++balanceLevel;\n\t\t\t\t\t\telse if(')' == buffer)\n\t\t\t\t\t\t\t--balanceLevel;\n\t\t\t\t\t\ttokenBuffer.Write(&buffer,1);\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\tif(result.first)\n\t\t\t\t\tresult.second = tokenBuffer.ToString();\n\t\t\t\tbreak;\n\t\t\t}\n\n\t\t\tcase '<':\n\t\t\t{\n\t\t\t\t\/\/ k. this might be a dictionary start marker or a hax string start. depending on whether it has a < following it or not\n\n\t\t\t\t\/\/ Hex string, read till end of hex string marker\n\t\t\t\tif(!mStream->NotEnded())\n\t\t\t\t{\n\t\t\t\t\tresult.second = tokenBuffer.ToString();\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\n\t\t\t\tif(GetNextByteForToken(buffer) != PDFHummus::eSuccess)\n\t\t\t\t{\t\n\t\t\t\t\t\tresult.first = false;\n\t\t\t\t\t\tbreak;\n\t\t\t\t}\n\n\t\t\t\tif('<' == buffer)\n\t\t\t\t{\n\t\t\t\t\t\/\/ Dictionary start marker\n\t\t\t\t\ttokenBuffer.Write(&buffer,1);\n\t\t\t\t\tresult.second = tokenBuffer.ToString();\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t\telse\n\t\t\t\t{\n\t\t\t\t\t\/\/ Hex string \n\n\t\t\t\t\ttokenBuffer.Write(&buffer,1);\n\n\t\t\t\t\twhile(mStream->NotEnded() && buffer != '>')\n\t\t\t\t\t{\n\t\t\t\t\t\tif(GetNextByteForToken(buffer) != PDFHummus::eSuccess)\n\t\t\t\t\t\t{\t\n\t\t\t\t\t\t\tresult.first = false;\n\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\t}\n\n\t\t\t\t\t\tif(!IsPDFWhiteSpace(buffer))\n\t\t\t\t\t\t\ttokenBuffer.Write(&buffer,1);\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\tresult.second = tokenBuffer.ToString();\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\tcase '[': \/\/ for all array or executable tokanizers, the tokanizer is just the mark\n\t\t\tcase ']':\n\t\t\tcase '{':\n\t\t\tcase '}':\n\t\t\t\tresult.second = tokenBuffer.ToString();\n\t\t\t\tbreak;\n\t\t\tcase '>': \/\/ parse end dictionary marker as a single entity or a hex string end marker\n\t\t\t{\n\t\t\t\tif(!mStream->NotEnded()) \/\/ this means a loose end string marker...wierd\n\t\t\t\t{\n\t\t\t\t\tresult.second = tokenBuffer.ToString();\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\n\t\t\t\tif(GetNextByteForToken(buffer) != PDFHummus::eSuccess)\n\t\t\t\t{\t\n\t\t\t\t\tresult.first = false;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\n\t\t\t\tif('>' == buffer)\n\t\t\t\t{\n\t\t\t\t\ttokenBuffer.Write(&buffer,1);\n\t\t\t\t\tresult.second = tokenBuffer.ToString();\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t\telse\n\t\t\t\t{\n\t\t\t\t\t\/\/ hex string loose end\n\t\t\t\t\tSaveTokenBuffer(buffer);\n\t\t\t\t\tresult.second = tokenBuffer.ToString();\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\n\t\t\t\tbreak;\n\t\t\t}\n\n\t\t\tdefault: \/\/ regular token. read till next breaker or whitespace\n\t\t\t{\n\t\t\t\twhile(mStream->NotEnded())\n\t\t\t\t{\n\t\t\t\t\tif(GetNextByteForToken(buffer) != PDFHummus::eSuccess)\n\t\t\t\t\t{\t\n\t\t\t\t\t\tresult.first = false;\n\t\t\t\t\t\tbreak;\n\t\t\t\t\t}\n\t\t\t\t\tif(IsPDFWhiteSpace(buffer))\n\t\t\t\t\t{\n\t\t\t\t\t\tbreak;\n\t\t\t\t\t}\n\t\t\t\t\telse if(IsPDFEntityBreaker(buffer))\n\t\t\t\t\t{\n\t\t\t\t\t\tSaveTokenBuffer(buffer); \/\/ for a non-space breaker, save the token for next token read\n\t\t\t\t\t\tbreak;\n\t\t\t\t\t}\n\t\t\t\t\telse\n\t\t\t\t\t\ttokenBuffer.Write(&buffer,1);\n\t\t\t\t}\n\t\t\t\tresult.second = tokenBuffer.ToString();\n\t\t\t\t\n\t\t\t\tif(result.first && mStream->NotEnded() && scStream == result.second)\n\t\t\t\t{\n\t\t\t\t\t\/\/ k. a bit of a special case here for streams. the reading changes after the keyword \"stream\", \n\t\t\t\t\t\/\/ essentially forcing the next content to start after either CR, CR-LF or LF. so there might be a little\n\t\t\t\t\t\/\/ skip to do here.\n\t\t\t\t\t\/\/ if indeed there's a \"stream\", so the last buffer read should have been either CR or LF, which means (respectively)\n\t\t\t\t\t\/\/ that we should either skip one more \"LF\" or do nothing (based on what was parsed)\n\t\t\t\t\t\n\t\t\t\t\t\/\/ verify that when whitespaces are finished buffer is either CR or LF, and behave accordingly\n\t\t\t\t\twhile(mStream->NotEnded()) {\n\t\t\t\t\t\tif (!IsPDFWhiteSpace(buffer)) {\n\t\t\t\t\t\t\tresult.first = false; \/\/ something wrong! not whitespace\n\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\t}\n\n\t\t\t\t\t\tif (scCR == buffer) \/\/ CR. should be CR-LF or CR alone\n\t\t\t\t\t\t{\n\t\t\t\t\t\t\tif (GetNextByteForToken(buffer) == PDFHummus::eSuccess)\n\t\t\t\t\t\t\t{\n\t\t\t\t\t\t\t\t\/\/ if CR-LF treat as a single line, otherwise put back token nicely cause CR is alone\n\t\t\t\t\t\t\t\tif (buffer != scLF)\n\t\t\t\t\t\t\t\t\tSaveTokenBuffer(buffer);\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\tresult.first = true;\n\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\t}\n\t\t\t\t\t\telse if (scLF == buffer) {\n\t\t\t\t\t\t\tresult.first = true; \n\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\t} \/\/ else - some other white space\n\n\t\t\t\t\t\tif (GetNextByteForToken(buffer) != PDFHummus::eSuccess) {\n\t\t\t\t\t\t\tresult.first = false; \/\/can't read but not eof. fail\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\tbreak;\n\t\t\t}\n\n\t\t}\n\n\t}while(false);\n\n\n\n\treturn result;\n}\n\nvoid PDFParserTokenizer::SkipTillToken()\n{\n\tByte buffer = 0;\n\n\tif(!mStream)\n\t\treturn;\n\n\t\/\/ skip till hitting first non space, or segment end\n\twhile(mStream->NotEnded())\n\t{\n\t\tif(GetNextByteForToken(buffer) != PDFHummus::eSuccess)\n\t\t\tbreak;\n\n\t\tif(!IsPDFWhiteSpace(buffer))\n\t\t{\n\t\t\tSaveTokenBuffer(buffer);\n\t\t\tbreak;\n\t\t}\n\t}\n}\n\nEStatusCode PDFParserTokenizer::GetNextByteForToken(Byte& outByte)\n{\n\t++mStreamPositionTracker; \/\/ advance position tracker, because we are reading the next byte.\n\tif(mHasTokenBuffer)\n\t{\n\t\toutByte = mTokenBuffer;\n\t\tmHasTokenBuffer = false;\n\t\treturn PDFHummus::eSuccess;\n\t}\n\telse\n\t\treturn (mStream->Read(&outByte,1) != 1) ? PDFHummus::eFailure:PDFHummus::eSuccess;\n}\n\nstatic const Byte scWhiteSpaces[] = {0,0x9,0xA,0xC,0xD,0x20};\nbool PDFParserTokenizer::IsPDFWhiteSpace(Byte inCharacter)\n{\n\tbool isWhiteSpace = false;\n\tfor(int i=0; i < 6 && !isWhiteSpace; ++i)\n\t\tisWhiteSpace = (scWhiteSpaces[i] == inCharacter);\n\treturn isWhiteSpace;\n}\n\nvoid PDFParserTokenizer::SaveTokenBuffer(Byte inToSave)\n{\n\tmHasTokenBuffer = true;\n\tmTokenBuffer = inToSave;\n\t--mStreamPositionTracker; \/\/ decreasing position trakcer, because it is as if the byte is put back in the stream\n}\n\nIOBasicTypes::LongFilePositionType PDFParserTokenizer::GetReadBufferSize()\n{\n\treturn mHasTokenBuffer ? 1 : 0;\n}\n\nstatic const Byte scEntityBreakers[] = {'(',')','<','>',']','[','{','}','\/','%'};\nbool PDFParserTokenizer::IsPDFEntityBreaker(Byte inCharacter)\n{\n\tbool isEntityBreak = false;\n\tfor(int i=0; i < 10 && !isEntityBreak; ++i)\n\t\tisEntityBreak = (scEntityBreakers[i] == inCharacter);\n\treturn isEntityBreak;\n}\n\nLongFilePositionType PDFParserTokenizer::GetRecentTokenPosition()\n{\n\treturn mRecentTokenPosition;\n}<|endoftext|>"} {"text":"<commit_before>\/**\n * @file \n * \n * @ingroup pwg2_forward_scripts\n *\/\n\n\/** \n * Run first pass of the analysis - that is read in ESD and produce AOD\n * \n * @param esddir ESD input directory. Any file matching the pattern \n * *AliESDs*.root are added to the chain \n * @param nEvents Number of events to process. If 0 or less, then \n * all events are analysed\n * @param proof Run in proof mode \n * @param mc Run over MC data\n *\n * If PROOF mode is selected, then Terminate will be run on the master node \n * in any case. \n * \n *\n * @ingroup pwg2_forward_scripts\n *\/\nvoid MakeAOD(const char* esddir, \n\t Int_t nEvents=-1, \n\t Int_t proof=0,\n\t Bool_t mc=false)\n{\n \/\/ --- Libraries to load -------------------------------------------\n gROOT->Macro(\"$ALICE_ROOT\/PWG2\/FORWARD\/analysis2\/scripts\/LoadLibs.C\");\n\n \/\/ --- Check for proof mode, and possibly upload pars --------------\n if (proof> 0) { \n gROOT->LoadMacro(\"$ALICE_ROOT\/PWG2\/FORWARD\/analysis2\/scripts\/LoadPars.C\");\n LoadPars(proof);\n }\n \n \/\/ --- Our data chain ----------------------------------------------\n gROOT->LoadMacro(\"$ALICE_ROOT\/PWG2\/FORWARD\/analysis2\/scripts\/MakeChain.C\");\n TChain* chain = MakeChain(\"ESD\", esddir,true);\n \/\/ If 0 or less events is select, choose all \n if (nEvents <= 0) nEvents = chain->GetEntries();\n\n \/\/ --- Creating the manager and handlers ---------------------------\n AliAnalysisManager *mgr = new AliAnalysisManager(\"Forward Train\", \n\t\t\t\t\t\t \"Forward multiplicity\");\n AliAnalysisManager::SetCommonFileName(\"forward.root\");\n\n \/\/ --- ESD input handler -------------------------------------------\n AliESDInputHandler *esdHandler = new AliESDInputHandler();\n esdHandler->SetInactiveBranches(\/\/ \"AliESDRun \" \n\t\t\t\t \/\/ \"AliESDHeader \"\n\t\t\t\t \/\/ \"AliESDZDC \"\n\t\t\t\t \/\/ \"AliESDFMD \"\n\t\t\t\t \/\/ \"AliESDVZERO \" \n\t\t\t\t \"AliESDTZERO \" \n\t\t\t\t \"TPCVertex \" \n\t\t\t\t \/\/ \"SPDVertex \"\n\t\t\t\t \/\/ \"PrimaryVertex \"\n\t\t\t\t \/\/ \"AliMultiplicity \"\n\t\t\t\t \"PHOSTrigger \"\n\t\t\t\t \"EMCALTrigger \"\n\t\t\t\t \"SPDPileupVertices \" \n\t\t\t\t \"TrkPileupVertices \" \n\t\t\t\t \/\/ \"Tracks \"\n\t\t\t\t \"MuonTracks \" \n\t\t\t\t \"PmdTracks \"\n\t\t\t\t \"TrdTracks \"\n\t\t\t\t \"V0s \" \n\t\t\t\t \"Cascades \" \n\t\t\t\t \"Kinks \" \n\t\t\t\t \"CaloClusters \"\n\t\t\t\t \"EMCALLCells \"\n\t\t\t\t \"PHOSCells \"\n\t\t\t\t \"AliRawDataErrorLogs \"\n\t\t\t\t \"ALIESDCACORDE \" \n\t\t\t\t \"HLTGlobalTrigger\");\n mgr->SetInputEventHandler(esdHandler); \n \n \/\/ --- Monte Carlo handler -----------------------------------------\n if (mc) {\n AliMCEventHandler* mcHandler = new AliMCEventHandler();\n mgr->SetMCtruthEventHandler(mcHandler);\n mcHandler->SetReadTR(true); \n }\n\n \/\/ --- AOD output handler ------------------------------------------\n AliAODHandler* aodHandler = new AliAODHandler();\n mgr->SetOutputEventHandler(aodHandler);\n aodHandler->SetOutputFileName(\"AliAODs.root\");\n\n \/\/ --- Add tasks ---------------------------------------------------\n \/\/ Physics selection \n gROOT->LoadMacro(\"$ALICE_ROOT\/ANALYSIS\/macros\/AddTaskPhysicsSelection.C\");\n AddTaskPhysicsSelection(mc, kTRUE, kTRUE);\n\n#if 1\n \/\/ Centrality \n gROOT->LoadMacro(\"$ALICE_ROOT\/PWG2\/FORWARD\/analysis2\/scripts\/Compile.C\");\n \/\/ gDebug = 10;\n Compile(\"$ALICE_ROOT\/PWG2\/FORWARD\/analysis2\/AddTaskCopyHeader.C\",\"\");\n \/\/ gDebug = 10;\n Compile(\"$ALICE_ROOT\/PWG2\/FORWARD\/analysis2\/scripts\/AliESDCentrality.C\",\"\");\n \/\/ gDebug = 0;\n AddTaskCopyHeader();\n\n\n \/\/ Central multiplicity\n \/\/ Compile(\"$ALICE_ROOT\/PWG2\/FORWARD\/analysis2\/AddTaskCentralMult.C\",\"\");\n \/\/ AddTaskCentralMult();\n#endif\n\n \/\/ FMD \n gROOT->LoadMacro(\"$ALICE_ROOT\/PWG2\/FORWARD\/analysis2\/AddTaskFMD.C\");\n AddTaskFMD(mc);\n\n \n \/\/ --- Run the analysis --------------------------------------------\n TStopwatch t;\n if (!mgr->InitAnalysis()) {\n Error(\"MakeAOD\", \"Failed to initialize analysis train!\");\n return;\n }\n \/\/ Skip terminate if we're so requested and not in Proof or full mode\n mgr->SetSkipTerminate(false);\n \/\/ Some informative output \n mgr->PrintStatus();\n \/\/ mgr->SetDebugLevel(3);\n if (mgr->GetDebugLevel() < 1 && !proof) \n mgr->SetUseProgressBar(kTRUE,100);\n\n \/\/ Run the train \n t.Start();\n Printf(\"=== RUNNING ANALYSIS ==================================\");\n mgr->StartAnalysis(proof ? \"proof\" : \"local\", chain, nEvents);\n t.Stop();\n t.Print();\n}\n\/\/\n\/\/ EOF\n\/\/\n<commit_msg>Add SPD cluster method<commit_after>\/**\n * @file \n * \n * @ingroup pwg2_forward_scripts\n *\/\n\n\/** \n * Run first pass of the analysis - that is read in ESD and produce AOD\n * \n * @param esddir ESD input directory. Any file matching the pattern \n * *AliESDs*.root are added to the chain \n * @param nEvents Number of events to process. If 0 or less, then \n * all events are analysed\n * @param proof Run in proof mode \n * @param mc Run over MC data\n *\n * If PROOF mode is selected, then Terminate will be run on the master node \n * in any case. \n * \n *\n * @ingroup pwg2_forward_scripts\n *\/\nvoid MakeAOD(const char* esddir, \n\t Int_t nEvents=-1, \n\t Int_t proof=0,\n\t Bool_t mc=false)\n{\n \/\/ --- Libraries to load -------------------------------------------\n gROOT->Macro(\"$ALICE_ROOT\/PWG2\/FORWARD\/analysis2\/scripts\/LoadLibs.C\");\n\n \/\/ --- Check for proof mode, and possibly upload pars --------------\n if (proof> 0) { \n gROOT->LoadMacro(\"$ALICE_ROOT\/PWG2\/FORWARD\/analysis2\/scripts\/LoadPars.C\");\n LoadPars(proof);\n }\n \n \/\/ --- Our data chain ----------------------------------------------\n gROOT->LoadMacro(\"$ALICE_ROOT\/PWG2\/FORWARD\/analysis2\/scripts\/MakeChain.C\");\n TChain* chain = MakeChain(\"ESD\", esddir,true);\n \/\/ If 0 or less events is select, choose all \n if (nEvents <= 0) nEvents = chain->GetEntries();\n\n \/\/ --- Creating the manager and handlers ---------------------------\n AliAnalysisManager *mgr = new AliAnalysisManager(\"Forward Train\", \n\t\t\t\t\t\t \"Forward multiplicity\");\n AliAnalysisManager::SetCommonFileName(\"forward.root\");\n\n \/\/ --- ESD input handler -------------------------------------------\n AliESDInputHandler *esdHandler = new AliESDInputHandler();\n esdHandler->SetInactiveBranches(\/\/ \"AliESDRun \" \n\t\t\t\t \/\/ \"AliESDHeader \"\n\t\t\t\t \/\/ \"AliESDZDC \"\n\t\t\t\t \/\/ \"AliESDFMD \"\n\t\t\t\t \/\/ \"AliESDVZERO \" \n\t\t\t\t \"AliESDTZERO \" \n\t\t\t\t \"TPCVertex \" \n\t\t\t\t \/\/ \"SPDVertex \"\n\t\t\t\t \/\/ \"PrimaryVertex \"\n\t\t\t\t \/\/ \"AliMultiplicity \"\n\t\t\t\t \"PHOSTrigger \"\n\t\t\t\t \"EMCALTrigger \"\n\t\t\t\t \"SPDPileupVertices \" \n\t\t\t\t \"TrkPileupVertices \" \n\t\t\t\t \/\/ \"Tracks \"\n\t\t\t\t \"MuonTracks \" \n\t\t\t\t \"PmdTracks \"\n\t\t\t\t \"TrdTracks \"\n\t\t\t\t \"V0s \" \n\t\t\t\t \"Cascades \" \n\t\t\t\t \"Kinks \" \n\t\t\t\t \"CaloClusters \"\n\t\t\t\t \"EMCALLCells \"\n\t\t\t\t \"PHOSCells \"\n\t\t\t\t \"AliRawDataErrorLogs \"\n\t\t\t\t \"ALIESDCACORDE \" \n\t\t\t\t \"HLTGlobalTrigger\");\n mgr->SetInputEventHandler(esdHandler); \n \n \/\/ --- Monte Carlo handler -----------------------------------------\n if (mc) {\n AliMCEventHandler* mcHandler = new AliMCEventHandler();\n mgr->SetMCtruthEventHandler(mcHandler);\n mcHandler->SetReadTR(true); \n }\n\n \/\/ --- AOD output handler ------------------------------------------\n AliAODHandler* aodHandler = new AliAODHandler();\n mgr->SetOutputEventHandler(aodHandler);\n aodHandler->SetOutputFileName(\"AliAODs.root\");\n\n \/\/ --- Add tasks ---------------------------------------------------\n \/\/ Physics selection \n gROOT->LoadMacro(\"$ALICE_ROOT\/ANALYSIS\/macros\/AddTaskPhysicsSelection.C\");\n AddTaskPhysicsSelection(mc, kTRUE, kTRUE);\n\n#if 1\n \/\/ Centrality \n gROOT->LoadMacro(\"$ALICE_ROOT\/PWG2\/FORWARD\/analysis2\/scripts\/Compile.C\");\n Compile(\"$ALICE_ROOT\/PWG2\/FORWARD\/analysis2\/AddTaskCopyHeader.C\",\"\");\n \/\/ Compile(\"$ALICE_ROOT\/PWG2\/FORWARD\/analysis2\/scripts\/AliESDCentrality.C\",\"\");\n AddTaskCopyHeader();\n\n\n \/\/ Central multiplicity\n \/\/ Compile(\"$ALICE_ROOT\/PWG2\/FORWARD\/analysis2\/AddTaskCentralMult.C\",\"\");\n \/\/ AddTaskCentralMult();\n#endif\n\n \/\/ FMD \n gROOT->LoadMacro(\"$ALICE_ROOT\/PWG2\/FORWARD\/analysis2\/AddTaskFMD.C\");\n AddTaskFMD(mc);\n\n \/\/ Central \n gROOT->LoadMacro(\"$ALICE_ROOT\/PWG2\/FORWARD\/analysis2\/AddTaskCentral.C\");\n AddTaskCentral();\n \n \/\/ --- Run the analysis --------------------------------------------\n TStopwatch t;\n if (!mgr->InitAnalysis()) {\n Error(\"MakeAOD\", \"Failed to initialize analysis train!\");\n return;\n }\n \/\/ Skip terminate if we're so requested and not in Proof or full mode\n mgr->SetSkipTerminate(false);\n \/\/ Some informative output \n mgr->PrintStatus();\n \/\/ mgr->SetDebugLevel(3);\n if (mgr->GetDebugLevel() < 1 && !proof) \n mgr->SetUseProgressBar(kTRUE,100);\n\n \/\/ Run the train \n t.Start();\n Printf(\"=== RUNNING ANALYSIS ==================================\");\n mgr->StartAnalysis(proof ? \"proof\" : \"local\", chain, nEvents);\n t.Stop();\n t.Print();\n}\n\/\/\n\/\/ EOF\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 \"updateoperation.h\"\n#include <vespa\/document\/base\/exceptions.h>\n#include <vespa\/document\/update\/documentupdate.h>\n#include <cassert>\n\n#include <vespa\/log\/log.h>\nLOG_SETUP(\".proton.feedoperation.updateoperation\");\n\n\nusing document::BucketId;\nusing document::DocumentType;\nusing document::DocumentTypeRepo;\nusing document::DocumentUpdate;\nusing storage::spi::Timestamp;\nusing vespalib::make_string;\n\nnamespace proton {\n\nUpdateOperation::UpdateOperation()\n : UpdateOperation(FeedOperation::UPDATE)\n{\n}\n\nUpdateOperation::UpdateOperation(Type type)\n : DocumentOperation(type),\n _upd()\n{\n}\n\n\nUpdateOperation::UpdateOperation(Type type, const BucketId &bucketId,\n const Timestamp ×tamp, const DocumentUpdate::SP &upd)\n : DocumentOperation(type, bucketId, timestamp),\n _upd(upd)\n{\n}\n\n\nUpdateOperation::UpdateOperation(const BucketId &bucketId, const Timestamp ×tamp, const DocumentUpdate::SP &upd)\n : UpdateOperation(FeedOperation::UPDATE, bucketId, timestamp, upd)\n{\n}\n\nvoid\nUpdateOperation::serializeUpdate(vespalib::nbostream &os) const\n{\n assert(getType() == UPDATE);\n _upd->serializeHEAD(os);\n}\n\nvoid\nUpdateOperation::deserializeUpdate(vespalib::nbostream &is, const document::DocumentTypeRepo &repo)\n{\n document::ByteBuffer buf(is.peek(), is.size());\n DocumentUpdate::UP update = (getType() == UPDATE_42) ? DocumentUpdate::create42(repo, buf) : DocumentUpdate::createHEAD(repo, buf);\n is.adjustReadPos(buf.getPos());\n _upd = std::move(update);\n}\n\nvoid\nUpdateOperation::serialize(vespalib::nbostream &os) const\n{\n assertValidBucketId(_upd->getId());\n DocumentOperation::serialize(os);\n serializeUpdate(os);\n}\n\n\nvoid\nUpdateOperation::deserialize(vespalib::nbostream &is, const DocumentTypeRepo &repo)\n{\n DocumentOperation::deserialize(is, repo);\n try {\n deserializeUpdate(is, repo);\n } catch (document::DocumentTypeNotFoundException &e) {\n LOG(warning, \"Failed deserialize update operation using unknown document type '%s'\",\n e.getDocumentTypeName().c_str());\n \/\/ Ignore this piece of data\n is.clear();\n }\n}\n\nvoid\nUpdateOperation::deserializeUpdate(const DocumentTypeRepo &repo)\n{\n vespalib::nbostream stream;\n serializeUpdate(stream);\n deserializeUpdate(stream, repo);\n}\n\nvespalib::string UpdateOperation::toString() const {\n return make_string(\"%s(%s, %s)\",\n ((getType() == FeedOperation::UPDATE_42) ? \"Update42\" : \"Update\"),\n _upd.get() ?\n _upd->getId().getScheme().toString().c_str() : \"NULL\",\n docArgsToString().c_str());\n}\n\n} \/\/ namespace proton\n<commit_msg>Add missing bytebuffer.h include<commit_after>\/\/ Copyright 2017 Yahoo Holdings. Licensed under the terms of the Apache 2.0 license. See LICENSE in the project root.\n#include \"updateoperation.h\"\n#include <vespa\/document\/base\/exceptions.h>\n#include <vespa\/document\/update\/documentupdate.h>\n#include <vespa\/document\/util\/bytebuffer.h>\n#include <cassert>\n\n#include <vespa\/log\/log.h>\nLOG_SETUP(\".proton.feedoperation.updateoperation\");\n\n\nusing document::BucketId;\nusing document::DocumentType;\nusing document::DocumentTypeRepo;\nusing document::DocumentUpdate;\nusing storage::spi::Timestamp;\nusing vespalib::make_string;\n\nnamespace proton {\n\nUpdateOperation::UpdateOperation()\n : UpdateOperation(FeedOperation::UPDATE)\n{\n}\n\nUpdateOperation::UpdateOperation(Type type)\n : DocumentOperation(type),\n _upd()\n{\n}\n\n\nUpdateOperation::UpdateOperation(Type type, const BucketId &bucketId,\n const Timestamp ×tamp, const DocumentUpdate::SP &upd)\n : DocumentOperation(type, bucketId, timestamp),\n _upd(upd)\n{\n}\n\n\nUpdateOperation::UpdateOperation(const BucketId &bucketId, const Timestamp ×tamp, const DocumentUpdate::SP &upd)\n : UpdateOperation(FeedOperation::UPDATE, bucketId, timestamp, upd)\n{\n}\n\nvoid\nUpdateOperation::serializeUpdate(vespalib::nbostream &os) const\n{\n assert(getType() == UPDATE);\n _upd->serializeHEAD(os);\n}\n\nvoid\nUpdateOperation::deserializeUpdate(vespalib::nbostream &is, const document::DocumentTypeRepo &repo)\n{\n document::ByteBuffer buf(is.peek(), is.size());\n DocumentUpdate::UP update = (getType() == UPDATE_42) ? DocumentUpdate::create42(repo, buf) : DocumentUpdate::createHEAD(repo, buf);\n is.adjustReadPos(buf.getPos());\n _upd = std::move(update);\n}\n\nvoid\nUpdateOperation::serialize(vespalib::nbostream &os) const\n{\n assertValidBucketId(_upd->getId());\n DocumentOperation::serialize(os);\n serializeUpdate(os);\n}\n\n\nvoid\nUpdateOperation::deserialize(vespalib::nbostream &is, const DocumentTypeRepo &repo)\n{\n DocumentOperation::deserialize(is, repo);\n try {\n deserializeUpdate(is, repo);\n } catch (document::DocumentTypeNotFoundException &e) {\n LOG(warning, \"Failed deserialize update operation using unknown document type '%s'\",\n e.getDocumentTypeName().c_str());\n \/\/ Ignore this piece of data\n is.clear();\n }\n}\n\nvoid\nUpdateOperation::deserializeUpdate(const DocumentTypeRepo &repo)\n{\n vespalib::nbostream stream;\n serializeUpdate(stream);\n deserializeUpdate(stream, repo);\n}\n\nvespalib::string UpdateOperation::toString() const {\n return make_string(\"%s(%s, %s)\",\n ((getType() == FeedOperation::UPDATE_42) ? \"Update42\" : \"Update\"),\n _upd.get() ?\n _upd->getId().getScheme().toString().c_str() : \"NULL\",\n docArgsToString().c_str());\n}\n\n} \/\/ namespace proton\n<|endoftext|>"} {"text":"<commit_before>\/*\n * Copyright (c) 2015 Juniper Networks, Inc. All rights reserved.\n *\/\n\n#include \"base\/os.h\"\n#include \"testing\/gunit.h\"\n\n#include <base\/logging.h>\n#include <io\/event_manager.h>\n#include <io\/test\/event_manager_test.h>\n#include <tbb\/task.h>\n#include <base\/task.h>\n\n#include <cmn\/agent_cmn.h>\n\n#include \"cfg\/cfg_init.h\"\n#include \"cfg\/cfg_interface.h\"\n#include \"pkt\/pkt_init.h\"\n#include \"services\/services_init.h\"\n#include \"vrouter\/ksync\/ksync_init.h\"\n#include \"oper\/interface_common.h\"\n#include \"oper\/nexthop.h\"\n#include \"oper\/tunnel_nh.h\"\n#include \"route\/route.h\"\n#include \"oper\/vrf.h\"\n#include \"oper\/mpls.h\"\n#include \"oper\/vm.h\"\n#include \"oper\/vn.h\"\n#include \"filter\/acl.h\"\n#include \"openstack\/instance_service_server.h\"\n#include \"test_cmn_util.h\"\n#include \"vr_types.h\"\n\n#include \"openstack\/instance_service_server.h\"\n#include \"xmpp\/xmpp_init.h\"\n#include \"xmpp\/test\/xmpp_test_util.h\"\n#include \"vr_types.h\"\n#include \"control_node_mock.h\"\n#include \"xml\/xml_pugi.h\"\n#include \"controller\/controller_peer.h\"\n#include \"controller\/controller_export.h\"\n#include \"controller\/controller_vrf_export.h\"\n\n#include \"ovs_tor_agent\/ovsdb_client\/ovsdb_route_peer.h\"\n#include \"ovs_tor_agent\/ovsdb_client\/physical_switch_ovsdb.h\"\n#include \"ovs_tor_agent\/ovsdb_client\/logical_switch_ovsdb.h\"\n#include \"ovs_tor_agent\/ovsdb_client\/physical_port_ovsdb.h\"\n#include \"ovs_tor_agent\/ovsdb_client\/unicast_mac_local_ovsdb.h\"\n#include \"test_ovs_agent_init.h\"\n#include \"test-xml\/test_xml.h\"\n#include \"test-xml\/test_xml_oper.h\"\n#include \"test_xml_physical_device.h\"\n#include \"test_xml_ovsdb.h\"\n\n#include \"test_ovs_agent_util.h\"\n\n#include <ovsdb_types.h>\n\nusing namespace pugi;\nusing namespace OVSDB;\nusing namespace boost::uuids;\n\nEventManager evm1;\nServerThread *thread1;\ntest::ControlNodeMock *bgp_peer1;\n\nEventManager evm2;\nServerThread *thread2;\ntest::ControlNodeMock *bgp_peer2;\n\nvoid RouterIdDepInit(Agent *agent) {\n Agent::GetInstance()->controller()->Connect();\n}\n\nclass UnicastLocalRouteTest : public ::testing::Test {\nprotected:\n UnicastLocalRouteTest() {\n }\n\n UnicastMacLocalEntry *FindUcastLocal(const string &logical_switch,\n const string &mac) {\n UnicastMacLocalOvsdb *table =\n tcp_session_->client_idl()->unicast_mac_local_ovsdb();\n UnicastMacLocalEntry key(table, logical_switch, mac);\n UnicastMacLocalEntry *entry =\n static_cast<UnicastMacLocalEntry *> (table->Find(&key));\n return entry;\n }\n\n virtual void SetUp() {\n agent_ = Agent::GetInstance();\n init_ = static_cast<TestOvsAgentInit *>(client->agent_init());\n peer_manager_ = init_->ovs_peer_manager();\n WAIT_FOR(100, 10000,\n (tcp_session_ = static_cast<OvsdbClientTcpSession *>\n (init_->ovsdb_client()->NextSession(NULL))) != NULL);\n WAIT_FOR(100, 10000,\n (tcp_session_->client_idl() != NULL));\n WAIT_FOR(100, 10000, (tcp_session_->status() == string(\"Established\")));\n\n AgentUtXmlTest test(\"controller\/src\/vnsw\/agent\/ovs_tor_agent\/ovsdb_\"\n \"client\/test\/xml\/ucast-local-test-setup.xml\");\n \/\/ set current session in test context\n OvsdbTestSetSessionContext(tcp_session_);\n AgentUtXmlOperInit(&test);\n AgentUtXmlPhysicalDeviceInit(&test);\n AgentUtXmlOvsdbInit(&test);\n if (test.Load() == true) {\n test.ReadXml();\n string str;\n test.ToString(&str);\n cout << str << endl;\n test.Run();\n }\n }\n\n virtual void TearDown() {\n AgentUtXmlTest test(\"controller\/src\/vnsw\/agent\/ovs_tor_agent\/ovsdb_\"\n \"client\/test\/xml\/ucast-local-test-teardown.xml\");\n \/\/ set current session in test context\n AgentUtXmlOperInit(&test);\n AgentUtXmlPhysicalDeviceInit(&test);\n AgentUtXmlOvsdbInit(&test);\n if (test.Load() == true) {\n test.ReadXml();\n string str;\n test.ToString(&str);\n cout << str << endl;\n test.Run();\n }\n client->WaitForIdle();\n }\n\n Agent *agent_;\n TestOvsAgentInit *init_;\n OvsPeerManager *peer_manager_;\n OvsdbClientTcpSession *tcp_session_;\n};\n\nTEST_F(UnicastLocalRouteTest, UnicastLocalBasic) {\n LogicalSwitchTable *table =\n tcp_session_->client_idl()->logical_switch_table();\n LogicalSwitchEntry key(table, UuidToString(MakeUuid(1)));\n LogicalSwitchEntry *entry = static_cast<LogicalSwitchEntry *>\n (table->Find(&key));\n EXPECT_TRUE((entry != NULL));\n if (entry != NULL) {\n WAIT_FOR(10, 10000,\n (true == add_ucast_mac_local(entry->name(),\n \"00:00:00:00:01:01\",\n \"11.11.11.11\")));\n \/\/ Wait for entry to add\n WAIT_FOR(100, 10000,\n (NULL != FindUcastLocal(entry->name(), \"00:00:00:00:01:01\")));\n\n OvsdbUnicastMacLocalReq *req = new OvsdbUnicastMacLocalReq();\n req->HandleRequest();\n client->WaitForIdle();\n req->Release();\n\n WAIT_FOR(10, 10000,\n (true == del_ucast_mac_local(entry->name(),\n \"00:00:00:00:01:01\")));\n \/\/ Wait for entry to del\n WAIT_FOR(100, 10000,\n (NULL == FindUcastLocal(entry->name(), \"00:00:00:00:01:01\")));\n }\n}\n\nTEST_F(UnicastLocalRouteTest, tunnel_nh_1) {\n IpAddress server = Ip4Address::from_string(\"1.1.1.1\");\n OvsPeer *peer = peer_manager_->Allocate(server);\n EXPECT_TRUE(peer->export_to_controller());\n\n MacAddress mac(\"00:00:00:00:00:01\");\n Ip4Address tor_ip = Ip4Address::from_string(\"2.2.2.1\");\n Ip4Address server_ip = Ip4Address::from_string(\"0.0.0.0\");\n AddVrf(\"vrf1\", 1);\n client->WaitForIdle();\n\n VrfEntry *vrf = VrfGet(\"vrf1\");\n WAIT_FOR(100, 100, (vrf->GetBridgeRouteTable() != NULL));\n peer->AddOvsRoute(vrf, 100, \"dummy\", mac, tor_ip, true);\n WAIT_FOR(1000, 100, (EvpnRouteGet(\"vrf1\", mac, server_ip, 100) != NULL));\n client->WaitForIdle();\n\n EvpnRouteEntry *rt = EvpnRouteGet(\"vrf1\", mac, server_ip, 100);\n const AgentPath *path = rt->GetActivePath();\n EXPECT_TRUE(path->tunnel_dest() == tor_ip);\n const TunnelNH *nh = dynamic_cast<const TunnelNH *>(rt->GetActiveNextHop());\n EXPECT_TRUE(nh != NULL);\n EXPECT_TRUE(*nh->GetDip() == tor_ip);\n\n AddEncapList(\"MPLSoUDP\", \"vxlan\", NULL);\n client->WaitForIdle();\n WAIT_FOR(1000, 100, (EvpnRouteGet(\"vrf1\", mac, server_ip, 100) != NULL));\n\n rt = EvpnRouteGet(\"vrf1\", mac, server_ip, 100);\n path = rt->GetActivePath();\n EXPECT_TRUE(path->tunnel_dest() == tor_ip);\n nh = dynamic_cast<const TunnelNH *>(rt->GetActiveNextHop());\n EXPECT_TRUE(nh != NULL);\n EXPECT_TRUE(*nh->GetDip() == tor_ip);\n\n peer->DeleteOvsRoute(vrf, 100, mac, true);\n client->WaitForIdle();\n \/\/ Change tunnel-type order\n peer_manager_->Free(peer);\n client->WaitForIdle();\n}\n\nint main(int argc, char *argv[]) {\n GETUSERARGS();\n \/\/ override with true to initialize ovsdb server and client\n ksync_init = true;\n client = OvsTestInit(init_file, ksync_init);\n int ret = RUN_ALL_TESTS();\n TestShutdown();\n return ret;\n}\n<commit_msg>Fix test_ovs_unicast_local UT<commit_after>\/*\n * Copyright (c) 2015 Juniper Networks, Inc. All rights reserved.\n *\/\n\n#include \"base\/os.h\"\n#include \"testing\/gunit.h\"\n\n#include <base\/logging.h>\n#include <io\/event_manager.h>\n#include <io\/test\/event_manager_test.h>\n#include <tbb\/task.h>\n#include <base\/task.h>\n\n#include <cmn\/agent_cmn.h>\n\n#include \"cfg\/cfg_init.h\"\n#include \"cfg\/cfg_interface.h\"\n#include \"pkt\/pkt_init.h\"\n#include \"services\/services_init.h\"\n#include \"vrouter\/ksync\/ksync_init.h\"\n#include \"oper\/interface_common.h\"\n#include \"oper\/nexthop.h\"\n#include \"oper\/tunnel_nh.h\"\n#include \"route\/route.h\"\n#include \"oper\/vrf.h\"\n#include \"oper\/mpls.h\"\n#include \"oper\/vm.h\"\n#include \"oper\/vn.h\"\n#include \"filter\/acl.h\"\n#include \"openstack\/instance_service_server.h\"\n#include \"test_cmn_util.h\"\n#include \"vr_types.h\"\n\n#include \"openstack\/instance_service_server.h\"\n#include \"xmpp\/xmpp_init.h\"\n#include \"xmpp\/test\/xmpp_test_util.h\"\n#include \"vr_types.h\"\n#include \"control_node_mock.h\"\n#include \"xml\/xml_pugi.h\"\n#include \"controller\/controller_peer.h\"\n#include \"controller\/controller_export.h\"\n#include \"controller\/controller_vrf_export.h\"\n\n#include \"ovs_tor_agent\/ovsdb_client\/ovsdb_route_peer.h\"\n#include \"ovs_tor_agent\/ovsdb_client\/physical_switch_ovsdb.h\"\n#include \"ovs_tor_agent\/ovsdb_client\/logical_switch_ovsdb.h\"\n#include \"ovs_tor_agent\/ovsdb_client\/physical_port_ovsdb.h\"\n#include \"ovs_tor_agent\/ovsdb_client\/unicast_mac_local_ovsdb.h\"\n#include \"test_ovs_agent_init.h\"\n#include \"test-xml\/test_xml.h\"\n#include \"test-xml\/test_xml_oper.h\"\n#include \"test_xml_physical_device.h\"\n#include \"test_xml_ovsdb.h\"\n\n#include \"test_ovs_agent_util.h\"\n\n#include <ovsdb_types.h>\n\nusing namespace pugi;\nusing namespace OVSDB;\nusing namespace boost::uuids;\n\nEventManager evm1;\nServerThread *thread1;\ntest::ControlNodeMock *bgp_peer1;\n\nEventManager evm2;\nServerThread *thread2;\ntest::ControlNodeMock *bgp_peer2;\n\nvoid RouterIdDepInit(Agent *agent) {\n Agent::GetInstance()->controller()->Connect();\n}\n\nclass UnicastLocalRouteTest : public ::testing::Test {\nprotected:\n UnicastLocalRouteTest() {\n }\n\n UnicastMacLocalEntry *FindUcastLocal(const string &logical_switch,\n const string &mac) {\n UnicastMacLocalOvsdb *table =\n tcp_session_->client_idl()->unicast_mac_local_ovsdb();\n UnicastMacLocalEntry key(table, logical_switch, mac);\n UnicastMacLocalEntry *entry =\n static_cast<UnicastMacLocalEntry *> (table->Find(&key));\n return entry;\n }\n\n virtual void SetUp() {\n agent_ = Agent::GetInstance();\n init_ = static_cast<TestOvsAgentInit *>(client->agent_init());\n peer_manager_ = init_->ovs_peer_manager();\n WAIT_FOR(100, 10000,\n (tcp_session_ = static_cast<OvsdbClientTcpSession *>\n (init_->ovsdb_client()->NextSession(NULL))) != NULL);\n WAIT_FOR(100, 10000,\n (tcp_session_->client_idl() != NULL));\n WAIT_FOR(100, 10000, (tcp_session_->status() == string(\"Established\")));\n\n AgentUtXmlTest test(\"controller\/src\/vnsw\/agent\/ovs_tor_agent\/ovsdb_\"\n \"client\/test\/xml\/ucast-local-test-setup.xml\");\n \/\/ set current session in test context\n OvsdbTestSetSessionContext(tcp_session_);\n AgentUtXmlOperInit(&test);\n AgentUtXmlPhysicalDeviceInit(&test);\n AgentUtXmlOvsdbInit(&test);\n if (test.Load() == true) {\n test.ReadXml();\n string str;\n test.ToString(&str);\n cout << str << endl;\n test.Run();\n }\n }\n\n virtual void TearDown() {\n AgentUtXmlTest test(\"controller\/src\/vnsw\/agent\/ovs_tor_agent\/ovsdb_\"\n \"client\/test\/xml\/ucast-local-test-teardown.xml\");\n \/\/ set current session in test context\n AgentUtXmlOperInit(&test);\n AgentUtXmlPhysicalDeviceInit(&test);\n AgentUtXmlOvsdbInit(&test);\n if (test.Load() == true) {\n test.ReadXml();\n string str;\n test.ToString(&str);\n cout << str << endl;\n test.Run();\n }\n client->WaitForIdle();\n }\n\n Agent *agent_;\n TestOvsAgentInit *init_;\n OvsPeerManager *peer_manager_;\n OvsdbClientTcpSession *tcp_session_;\n};\n\nTEST_F(UnicastLocalRouteTest, UnicastLocalBasic) {\n LogicalSwitchTable *table =\n tcp_session_->client_idl()->logical_switch_table();\n LogicalSwitchEntry key(table, UuidToString(MakeUuid(1)));\n LogicalSwitchEntry *entry = static_cast<LogicalSwitchEntry *>\n (table->Find(&key));\n EXPECT_TRUE((entry != NULL));\n if (entry != NULL) {\n WAIT_FOR(10, 10000,\n (true == add_ucast_mac_local(entry->name(),\n \"00:00:00:00:01:01\",\n \"11.11.11.11\")));\n \/\/ Wait for entry to add\n WAIT_FOR(100, 10000,\n (NULL != FindUcastLocal(entry->name(), \"00:00:00:00:01:01\")));\n\n OvsdbUnicastMacLocalReq *req = new OvsdbUnicastMacLocalReq();\n req->HandleRequest();\n client->WaitForIdle();\n req->Release();\n\n WAIT_FOR(10, 10000,\n (true == del_ucast_mac_local(entry->name(),\n \"00:00:00:00:01:01\")));\n \/\/ Wait for entry to del\n WAIT_FOR(100, 10000,\n (NULL == FindUcastLocal(entry->name(), \"00:00:00:00:01:01\")));\n }\n}\n\nTEST_F(UnicastLocalRouteTest, tunnel_nh_1) {\n IpAddress server = Ip4Address::from_string(\"1.1.1.1\");\n OvsPeer *peer = peer_manager_->Allocate(server);\n EXPECT_TRUE(peer->export_to_controller());\n\n MacAddress mac(\"00:00:00:00:00:01\");\n Ip4Address tor_ip = Ip4Address::from_string(\"2.2.2.1\");\n Ip4Address server_ip = Ip4Address::from_string(\"0.0.0.0\");\n AddVrf(\"vrf1\", 1);\n client->WaitForIdle();\n\n VrfEntry *vrf = VrfGet(\"vrf1\");\n WAIT_FOR(100, 100, (vrf->GetBridgeRouteTable() != NULL));\n peer->AddOvsRoute(vrf, 100, \"dummy\", mac, tor_ip, true);\n WAIT_FOR(1000, 100, (EvpnRouteGet(\"vrf1\", mac, server_ip, 100) != NULL));\n client->WaitForIdle();\n\n EvpnRouteEntry *rt = EvpnRouteGet(\"vrf1\", mac, server_ip, 100);\n const AgentPath *path = rt->GetActivePath();\n EXPECT_TRUE(path->tunnel_dest() == tor_ip);\n const TunnelNH *nh = dynamic_cast<const TunnelNH *>(rt->GetActiveNextHop());\n EXPECT_TRUE(nh != NULL);\n EXPECT_TRUE(*nh->GetDip() == tor_ip);\n\n AddEncapList(\"MPLSoUDP\", \"vxlan\", NULL);\n client->WaitForIdle();\n WAIT_FOR(1000, 100, (EvpnRouteGet(\"vrf1\", mac, server_ip, 100) != NULL));\n\n rt = EvpnRouteGet(\"vrf1\", mac, server_ip, 100);\n path = rt->GetActivePath();\n EXPECT_TRUE(path->tunnel_dest() == tor_ip);\n nh = dynamic_cast<const TunnelNH *>(rt->GetActiveNextHop());\n EXPECT_TRUE(nh != NULL);\n EXPECT_TRUE(*nh->GetDip() == tor_ip);\n\n peer->DeleteOvsRoute(vrf, 100, mac, true);\n client->WaitForIdle();\n \/\/ Change tunnel-type order\n peer_manager_->Free(peer);\n client->WaitForIdle();\n}\n\nint main(int argc, char *argv[]) {\n GETUSERARGS();\n \/\/ override with true to initialize ovsdb server and client\n ksync_init = true;\n client = OvsTestInit(init_file, ksync_init);\n\n \/\/ override signal handler to default for SIGCHLD, for system() api\n \/\/ to work and return exec status appropriately\n signal(SIGCHLD, SIG_DFL);\n\n int ret = RUN_ALL_TESTS();\n TestShutdown();\n return ret;\n}\n<|endoftext|>"} {"text":"<commit_before>#include \"ngraph.h\"\n#include <cstdlib>\n#include <stdint.h>\n#include <iostream>\n#include <PCU.h>\nnamespace agi {\n\nNgraph::Ngraph() {\n isHyperGraph=false;\n num_global_verts=0;\n num_local_verts=0;\n num_ghost_verts=0;\n \n num_types=0;\n local_weights=NULL;\n local_coords=NULL;\n for (int i=0;i<MAX_TYPES;i++) {\n edge_ids[i] = NULL;\n edge_weights[i] = NULL;\n num_global_edges[i]=0;\n num_local_edges[i]=0;\n degree_list[i]=NULL;\n edge_list[i]=NULL;\n num_global_pins[i]=0;\n num_local_pins[i]=0;\n pin_degree_list[i]=NULL;\n pin_list[i]=NULL;\n }\n\n local_unmap = NULL;\n ghost_unmap=NULL;\n owners = NULL;\n}\n\nNgraph::~Ngraph() {\n if (local_weights)\n delete [] local_weights;\n if (local_coords)\n delete [] local_coords;\n for (int i=0;i<MAX_TYPES;i++) {\n if (edge_ids[i])\n delete [] edge_ids[i];\n if (edge_weights[i])\n delete [] edge_weights[i];\n if (degree_list[i])\n delete [] degree_list[i];\n if (edge_list[i])\n delete [] edge_list[i];\n if (pin_degree_list[i])\n delete [] pin_degree_list[i];\n if (pin_list[i])\n delete [] pin_list[i];\n }\n if (local_unmap)\n delete [] local_unmap;\n if (ghost_unmap)\n delete [] ghost_unmap;\n if (owners)\n delete [] owners;\n}\n \nconst wgt_t& Ngraph::weight(GraphVertex* vtx) const {\n uintptr_t index = (uintptr_t)(vtx)-1;\n if (index>=numTotalVtxs()){\n printf(\"[ERROR] invalid vertex given to weight(vtx)\\n\");\n throw 1;\n } \n else if (index>=num_local_verts) {\n printf(\"[ERROR] weights unknown for ghost vertices\\n\");\n throw 2;\n }\n return local_weights[index];\n}\nconst coord_t& Ngraph::coord(GraphVertex* vtx) const {\n uintptr_t index = (uintptr_t)(vtx)-1;\n if (index>=numTotalVtxs()){\n printf(\"[ERROR] invalid vertex given to coord(vtx)\\n\");\n throw 1;\n } \n else if (index>=num_local_verts) {\n printf(\"[ERROR] coordinates unknown for ghost vertices\\n\");\n throw 2;\n }\n return local_coords[index];\n}\n\n\nint Ngraph::owner(GraphVertex* vtx) const {\n uintptr_t index = (uintptr_t)(vtx)-1;\n if (index>=num_local_verts+num_ghost_verts) {\n fprintf(stderr,\"[ERROR] invalid vertex given to owner(vtx)\\n\");\n return -1;\n }\n if (index<num_local_verts)\n return PCU_Comm_Self();\n index-=num_local_verts;\n return owners[index];\n}\n\nlid_t Ngraph::localID(GraphVertex* vtx) const {\n return (uintptr_t)(vtx)-1;\n\n}\ngid_t Ngraph::globalID(GraphVertex* vtx) const {\n return local_unmap[(uintptr_t)(vtx)-1];\n}\n\nGraphVertex* Ngraph::find(GraphVertex* vtx) const {\n return findGID(globalID(vtx));\n}\n\n\nwgt_t Ngraph::weight(GraphEdge* edge) const {\n uintptr_t id = (uintptr_t)(edge)-1;\n etype type = id%num_types;\n id\/=num_types;\n return edge_weights[type][edge_list[type][id]];\n}\n\nlid_t Ngraph::u(lid_t e) const {\n bool found = false;\n lid_t index = 0;\n lid_t bound_low=0;\n lid_t bound_high = numLocalVtxs();\n while (!found) {\n index = (bound_high+bound_low)\/2;\n if (degree_list[0][index]<= e&& degree_list[0][index+1]>e) \n found=true;\n else if (degree_list[0][index]<=e)\n bound_low=index;\n else\n bound_high=index;\n\n }\n return index;\n}\n\nGraphVertex* Ngraph::v(GraphEdge* edge) const {\n if (isHyperGraph) {\n fprintf(stderr,\"v(edge) not supported in hypergraph mode\");\n return NULL;\n }\n uintptr_t id = (uintptr_t)(edge)-1;\n etype type = id%num_types;\n id\/=num_types;\n return reinterpret_cast<GraphVertex*>(edge_list[type][id]+1);\n}\n\n\nlid_t Ngraph::degree(GraphVertex* vtx,etype type) const {\n uintptr_t index =(uintptr_t)(vtx)-1;\n return degree_list[type][index+1]-degree_list[type][index];\n}\n \nEdgeIterator* Ngraph::edges(GraphVertex* vtx,etype type) const {\n uintptr_t index = (uintptr_t)(vtx)-1;\n EdgeIterator* eitr = new EdgeIterator(type,num_types,(lid_t*)degree_list[type][index],degree(vtx,type));\n return eitr;\n}\n\nlid_t Ngraph::degree(GraphEdge* edge) const {\n uintptr_t id = (uintptr_t)(edge)-1;\n etype type = id%num_types;\n id\/=num_types;\n lid_t index = edge_list[type][id];\n return pin_degree_list[type][index+1]-pin_degree_list[type][index];\n}\n\nPinIterator* Ngraph::pins(GraphEdge* edge) const {\n uintptr_t id = (uintptr_t)(edge)-1;\n etype type = id%num_types;\n id\/=num_types;\n lid_t index = edge_list[type][id];\n return reinterpret_cast<PinIterator*>(pin_list[type]+\n pin_degree_list[type][index]);\n}\n\n\nVertexIterator* Ngraph::begin() const {\n return reinterpret_cast<VertexIterator*>((char*)1);\n}\nGraphVertex* Ngraph::findGID(gid_t gid) const {\n return reinterpret_cast<GraphVertex*>((char*)(vtx_mapping.find(gid)->second));\n}\n\nEdgeIterator* Ngraph::begin(etype t) const {\n return new EdgeIterator(t,num_types,edge_list[t],num_local_edges[t]);\n}\n \nGraphVertex* Ngraph::iterate(VertexIterator*& itr) const {\n uintptr_t index = (uintptr_t)(itr);\n if (index==num_local_verts+1) {\n itr=NULL;\n return NULL;\n }\n GraphVertex* vtx = reinterpret_cast<GraphVertex*>((lid_t*)index);\n itr = reinterpret_cast<VertexIterator*>((char*)(index+1));\n return vtx;\n}\nGraphEdge* Ngraph::iterate(EdgeIterator*& itr) const {\n if (itr->loc>=itr->end)\n return NULL;\n uintptr_t index = (uintptr_t)itr->loc;\n itr->loc = (gid_t*)(index+num_types);\n return (GraphEdge*)(index);\n}\nGraphVertex* Ngraph::iterate(PinIterator*& itr) const {\n lid_t* e = reinterpret_cast<lid_t*>(itr);\n uintptr_t id = *e+1;\n GraphVertex* vtx = reinterpret_cast<GraphVertex*>((char*)id);\n itr = reinterpret_cast<PinIterator*>(++e);\n return vtx;\n}\n\nvoid Ngraph::destroy(EdgeIterator* itr) const {\n delete itr;\n}\n\nbool Ngraph::isEqual(GraphVertex* u,GraphVertex* v) const {\n return u==v;\n}\n \n\/\/Protected functions\n\nvoid Ngraph::makeEdgeArray(etype t, int count) {\n edge_ids[t] = new gid_t[count];\n edge_weights[t] = new wgt_t[count];\n}\n\nvoid Ngraph::setEdge(lid_t lid,gid_t gid, wgt_t w,etype t) {\n edge_ids[t][lid] = gid;\n edge_weights[t][lid] = w;\n edge_mapping[t][gid]=lid;\n \n}\n \/*\nvoid Ngraph::create_csr(int nv, int ne, int* srcs,\n int* dsts, int* wgts) {\n num_verts = nv;\n num_edges = ne;\n weights = new double[num_verts];\n out_vertices = new int[num_edges];\n out_weights = new double[num_edges];\n out_degree_list = new int[num_verts+1];\n\n for (size_t i = 0; i < num_edges; ++i)\n out_vertices[i] = 0;\n for (size_t i = 0; i < num_edges; ++i)\n out_weights[i] = 0;\n for (size_t i = 0; i < num_verts+1; ++i)\n out_degree_list[i] = 0;\n\n int* temp_counts = new int[num_verts];\n for (size_t i = 0; i < num_verts; ++i)\n temp_counts[i] = 0;\n for (size_t i = 0; i < num_edges; ++i)\n ++temp_counts[srcs[i]];\n for (size_t i = 0; i < num_verts; ++i)\n out_degree_list[i+1] = out_degree_list[i] + temp_counts[i];\n std::copy(out_degree_list, out_degree_list + num_verts, temp_counts);\n for (size_t i = 0; i < num_edges; ++i) {\n out_vertices[temp_counts[srcs[i]]] = dsts[i];\n out_weights[temp_counts[srcs[i]]++] = wgts[i];\n }\n \n delete [] temp_counts;\n\n}\n *\/\n\nvoid destroyGraph(Ngraph* g) {delete g;}\n}\n<commit_msg>Fix iterations over edges starting at begin()<commit_after>#include \"ngraph.h\"\n#include <cstdlib>\n#include <stdint.h>\n#include <iostream>\n#include <PCU.h>\nnamespace agi {\n\nNgraph::Ngraph() {\n isHyperGraph=false;\n num_global_verts=0;\n num_local_verts=0;\n num_ghost_verts=0;\n \n num_types=0;\n local_weights=NULL;\n local_coords=NULL;\n for (int i=0;i<MAX_TYPES;i++) {\n edge_ids[i] = NULL;\n edge_weights[i] = NULL;\n num_global_edges[i]=0;\n num_local_edges[i]=0;\n degree_list[i]=NULL;\n edge_list[i]=NULL;\n num_global_pins[i]=0;\n num_local_pins[i]=0;\n pin_degree_list[i]=NULL;\n pin_list[i]=NULL;\n }\n\n local_unmap = NULL;\n ghost_unmap=NULL;\n owners = NULL;\n}\n\nNgraph::~Ngraph() {\n if (local_weights)\n delete [] local_weights;\n if (local_coords)\n delete [] local_coords;\n for (int i=0;i<MAX_TYPES;i++) {\n if (edge_ids[i])\n delete [] edge_ids[i];\n if (edge_weights[i])\n delete [] edge_weights[i];\n if (degree_list[i])\n delete [] degree_list[i];\n if (edge_list[i])\n delete [] edge_list[i];\n if (pin_degree_list[i])\n delete [] pin_degree_list[i];\n if (pin_list[i])\n delete [] pin_list[i];\n }\n if (local_unmap)\n delete [] local_unmap;\n if (ghost_unmap)\n delete [] ghost_unmap;\n if (owners)\n delete [] owners;\n}\n \nconst wgt_t& Ngraph::weight(GraphVertex* vtx) const {\n uintptr_t index = (uintptr_t)(vtx)-1;\n if (index>=numTotalVtxs()){\n printf(\"[ERROR] invalid vertex given to weight(vtx)\\n\");\n throw 1;\n } \n else if (index>=num_local_verts) {\n printf(\"[ERROR] weights unknown for ghost vertices\\n\");\n throw 2;\n }\n return local_weights[index];\n}\nconst coord_t& Ngraph::coord(GraphVertex* vtx) const {\n uintptr_t index = (uintptr_t)(vtx)-1;\n if (index>=numTotalVtxs()){\n printf(\"[ERROR] invalid vertex given to coord(vtx)\\n\");\n throw 1;\n } \n else if (index>=num_local_verts) {\n printf(\"[ERROR] coordinates unknown for ghost vertices\\n\");\n throw 2;\n }\n return local_coords[index];\n}\n\n\nint Ngraph::owner(GraphVertex* vtx) const {\n uintptr_t index = (uintptr_t)(vtx)-1;\n if (index>=num_local_verts+num_ghost_verts) {\n fprintf(stderr,\"[ERROR] invalid vertex given to owner(vtx)\\n\");\n return -1;\n }\n if (index<num_local_verts)\n return PCU_Comm_Self();\n index-=num_local_verts;\n return owners[index];\n}\n\nlid_t Ngraph::localID(GraphVertex* vtx) const {\n return (uintptr_t)(vtx)-1;\n\n}\ngid_t Ngraph::globalID(GraphVertex* vtx) const {\n return local_unmap[(uintptr_t)(vtx)-1];\n}\n\nGraphVertex* Ngraph::find(GraphVertex* vtx) const {\n return findGID(globalID(vtx));\n}\n\n\nwgt_t Ngraph::weight(GraphEdge* edge) const {\n uintptr_t id = (uintptr_t)(edge)-1;\n etype type = id%num_types;\n id\/=num_types;\n return edge_weights[type][edge_list[type][id]];\n}\n\nlid_t Ngraph::u(lid_t e) const {\n bool found = false;\n lid_t index = 0;\n lid_t bound_low=0;\n lid_t bound_high = numLocalVtxs();\n while (!found) {\n index = (bound_high+bound_low)\/2;\n if (degree_list[0][index]<= e&& degree_list[0][index+1]>e) \n found=true;\n else if (degree_list[0][index]<=e)\n bound_low=index;\n else\n bound_high=index;\n\n }\n return index;\n}\n\nGraphVertex* Ngraph::v(GraphEdge* edge) const {\n if (isHyperGraph) {\n fprintf(stderr,\"v(edge) not supported in hypergraph mode\");\n return NULL;\n }\n uintptr_t id = (uintptr_t)(edge)-1;\n etype type = id%num_types;\n id\/=num_types;\n return reinterpret_cast<GraphVertex*>(edge_list[type][id]+1);\n}\n\n\nlid_t Ngraph::degree(GraphVertex* vtx,etype type) const {\n uintptr_t index =(uintptr_t)(vtx)-1;\n return degree_list[type][index+1]-degree_list[type][index];\n}\n \nEdgeIterator* Ngraph::edges(GraphVertex* vtx,etype type) const {\n uintptr_t index = (uintptr_t)(vtx)-1;\n EdgeIterator* eitr = new EdgeIterator(type,num_types,(lid_t*)degree_list[type][index],degree(vtx,type));\n return eitr;\n}\n\nlid_t Ngraph::degree(GraphEdge* edge) const {\n uintptr_t id = (uintptr_t)(edge)-1;\n etype type = id%num_types;\n id\/=num_types;\n lid_t index = edge_list[type][id];\n return pin_degree_list[type][index+1]-pin_degree_list[type][index];\n}\n\nPinIterator* Ngraph::pins(GraphEdge* edge) const {\n uintptr_t id = (uintptr_t)(edge)-1;\n etype type = id%num_types;\n id\/=num_types;\n lid_t index = edge_list[type][id];\n return reinterpret_cast<PinIterator*>(pin_list[type]+\n pin_degree_list[type][index]);\n}\n\n\nVertexIterator* Ngraph::begin() const {\n return reinterpret_cast<VertexIterator*>((char*)1);\n}\nGraphVertex* Ngraph::findGID(gid_t gid) const {\n return reinterpret_cast<GraphVertex*>((char*)(vtx_mapping.find(gid)->second));\n}\n\nEdgeIterator* Ngraph::begin(etype t) const {\n return new EdgeIterator(t,num_types,0,num_local_edges[t]);\n}\n \nGraphVertex* Ngraph::iterate(VertexIterator*& itr) const {\n uintptr_t index = (uintptr_t)(itr);\n if (index==num_local_verts+1) {\n itr=NULL;\n return NULL;\n }\n GraphVertex* vtx = reinterpret_cast<GraphVertex*>((lid_t*)index);\n itr = reinterpret_cast<VertexIterator*>((char*)(index+1));\n return vtx;\n}\nGraphEdge* Ngraph::iterate(EdgeIterator*& itr) const {\n if (itr->loc>=itr->end)\n return NULL;\n uintptr_t index = (uintptr_t)itr->loc;\n itr->loc = (gid_t*)(index+num_types);\n return (GraphEdge*)(index);\n}\nGraphVertex* Ngraph::iterate(PinIterator*& itr) const {\n lid_t* e = reinterpret_cast<lid_t*>(itr);\n uintptr_t id = *e+1;\n GraphVertex* vtx = reinterpret_cast<GraphVertex*>((char*)id);\n itr = reinterpret_cast<PinIterator*>(++e);\n return vtx;\n}\n\nvoid Ngraph::destroy(EdgeIterator* itr) const {\n delete itr;\n}\n\nbool Ngraph::isEqual(GraphVertex* u,GraphVertex* v) const {\n return u==v;\n}\n \n\/\/Protected functions\n\nvoid Ngraph::makeEdgeArray(etype t, int count) {\n edge_ids[t] = new gid_t[count];\n edge_weights[t] = new wgt_t[count];\n}\n\nvoid Ngraph::setEdge(lid_t lid,gid_t gid, wgt_t w,etype t) {\n edge_ids[t][lid] = gid;\n edge_weights[t][lid] = w;\n edge_mapping[t][gid]=lid;\n \n}\n \/*\nvoid Ngraph::create_csr(int nv, int ne, int* srcs,\n int* dsts, int* wgts) {\n num_verts = nv;\n num_edges = ne;\n weights = new double[num_verts];\n out_vertices = new int[num_edges];\n out_weights = new double[num_edges];\n out_degree_list = new int[num_verts+1];\n\n for (size_t i = 0; i < num_edges; ++i)\n out_vertices[i] = 0;\n for (size_t i = 0; i < num_edges; ++i)\n out_weights[i] = 0;\n for (size_t i = 0; i < num_verts+1; ++i)\n out_degree_list[i] = 0;\n\n int* temp_counts = new int[num_verts];\n for (size_t i = 0; i < num_verts; ++i)\n temp_counts[i] = 0;\n for (size_t i = 0; i < num_edges; ++i)\n ++temp_counts[srcs[i]];\n for (size_t i = 0; i < num_verts; ++i)\n out_degree_list[i+1] = out_degree_list[i] + temp_counts[i];\n std::copy(out_degree_list, out_degree_list + num_verts, temp_counts);\n for (size_t i = 0; i < num_edges; ++i) {\n out_vertices[temp_counts[srcs[i]]] = dsts[i];\n out_weights[temp_counts[srcs[i]]++] = wgts[i];\n }\n \n delete [] temp_counts;\n\n}\n *\/\n\nvoid destroyGraph(Ngraph* g) {delete g;}\n}\n<|endoftext|>"} {"text":"<commit_before>\/\/\/ \\file ROOT\/THistDrawingOpts.h\n\/\/\/ \\ingroup HistDraw ROOT7\n\/\/\/ \\author Axel Naumann <axel@cern.ch>\n\/\/\/ \\date 2015-09-04\n\/\/\/ \\warning This is part of the ROOT 7 prototype! It will change without notice. It might trigger earthquakes. Feedback\n\/\/\/ is welcome!\n\n\/*************************************************************************\n * Copyright (C) 1995-2015, 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_THistDrawingOpts\n#define ROOT7_THistDrawingOpts\n\n#include <ROOT\/TDrawingAttrs.hxx>\n#include <ROOT\/TStringEnumAttr.hxx>\n\nnamespace ROOT {\nnamespace Experimental {\n\ntemplate <int DIMENSION>\nclass THistDrawingOpts {\n static_assert(DIMENSION != 0, \"Cannot draw 0-dimensional histograms!\");\n static_assert(DIMENSION > 3, \"Cannot draw histograms with more than 3 dimensions!\");\n static_assert(DIMENSION < 3, \"This should have been handled by the specializations below?!\");\n};\n\n\/** \\class THistDrawingOpts<1>\n Drawing options for a 1D histogram.\n *\/\ntemplate <>\nclass THistDrawingOpts<1> {\n enum class EStyle { kBar, kText };\n static const TStringEnumAttrSet fgStyles;\n TDrawingAttrOrRef<TStringEnumAttr> fStyle{\"Hist.1D.Style\", 0, fgStyles};\n TDrawingAttrOrRef<TColor> fLineColor{\"Hist.1D.Line.Color\"};\n TDrawingAttrOrRef<int> fLineWidth{\"Hist.1D.Line.Width\"};\npublic:\n THistDrawingOpts() = default;\n};\n\nconst TStringEnumAttrSet THistDrawingOpts<1>::fgStyles{\"hist\", \"bar\", \"text\"};\n\n\n\/** \\class THistDrawingOpts<2>\n Drawing options for a 1D histogram.\n *\/\ntemplate <>\nclass THistDrawingOpts<2> {\n enum class EStyle { kBox, kSurf, kText };\n static const TStringEnumAttrSet fgStyles;\n TDrawingAttrOrRef<TStringEnumAttr> fStyle{\"Hist.2D.Style\", 0, fgStyles};\n TDrawingAttrOrRef<TColor> fLineColor{\"Hist.2D.Line.Color\"};\n TDrawingAttrOrRef<int> fLineWidth{\"Hist.2D.Line.Width\"};\npublic:\n THistDrawingOpts() = default;\n};\n\nconst TStringEnumAttrSet THistDrawingOpts<2>::fgStyles{\"box\", \"surf\", \"text\"};\n\n\n\/** \\class THistDrawingOpts<3>\n Drawing options for a 1D histogram.\n *\/\ntemplate <>\nclass THistDrawingOpts<3> {\n enum class EStyle { kBox, kIso };\n static const TStringEnumAttrSet fgStyles;\n TDrawingAttrOrRef<TStringEnumAttr> fStyle{\"Hist.3D.Style\", 0, fgStyles};\n TDrawingAttrOrRef<TColor> fLineColor{\"Hist.3D.Line.Color\"};\n TDrawingAttrOrRef<int> fLineWidth{\"Hist.3D.Line.Width\"};\npublic:\n THistDrawingOpts() = default;\n};\n\nconst TStringEnumAttrSet THistDrawingOpts<3>::fgStyles{\"box\", \"iso\"};\n\n} \/\/ namespace Experimental\n} \/\/ namespace ROOT\n\n#endif\n<commit_msg>Use function to \"hold\" style strings.<commit_after>\/\/\/ \\file ROOT\/THistDrawingOpts.h\n\/\/\/ \\ingroup HistDraw ROOT7\n\/\/\/ \\author Axel Naumann <axel@cern.ch>\n\/\/\/ \\date 2015-09-04\n\/\/\/ \\warning This is part of the ROOT 7 prototype! It will change without notice. It might trigger earthquakes. Feedback\n\/\/\/ is welcome!\n\n\/*************************************************************************\n * Copyright (C) 1995-2015, 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_THistDrawingOpts\n#define ROOT7_THistDrawingOpts\n\n#include <ROOT\/TDrawingAttrs.hxx>\n#include <ROOT\/TStringEnumAttr.hxx>\n\nnamespace ROOT {\nnamespace Experimental {\n\ntemplate <int DIMENSION>\nclass THistDrawingOpts {\n static_assert(DIMENSION != 0, \"Cannot draw 0-dimensional histograms!\");\n static_assert(DIMENSION > 3, \"Cannot draw histograms with more than 3 dimensions!\");\n static_assert(DIMENSION < 3, \"This should have been handled by the specializations below?!\");\n};\n\n\/** \\class THistDrawingOpts<1>\n Drawing options for a 1D histogram.\n *\/\ntemplate <>\nclass THistDrawingOpts<1> {\n enum class EStyle { kBar, kText };\n static const TStringEnumAttrSet &Styles() {\n static const TStringEnumAttrSet styles{\"hist\", \"bar\", \"text\"};\n return styles;\n }\n TDrawingAttrOrRef<TStringEnumAttr> fStyle{\"Hist.1D.Style\", 0, Styles()};\n TDrawingAttrOrRef<TColor> fLineColor{\"Hist.1D.Line.Color\"};\n TDrawingAttrOrRef<int> fLineWidth{\"Hist.1D.Line.Width\"};\npublic:\n THistDrawingOpts() = default;\n};\n\n\/** \\class THistDrawingOpts<2>\n Drawing options for a 1D histogram.\n *\/\ntemplate <>\nclass THistDrawingOpts<2> {\n enum class EStyle { kBox, kSurf, kText };\n static const TStringEnumAttrSet fgStyles;\n static const TStringEnumAttrSet &Styles() {\n static const TStringEnumAttrSet styles{\"box\", \"surf\", \"text\"};\n return styles;\n }\n TDrawingAttrOrRef<TStringEnumAttr> fStyle{\"Hist.2D.Style\", 0, Styles()};\n TDrawingAttrOrRef<TColor> fLineColor{\"Hist.2D.Line.Color\"};\n TDrawingAttrOrRef<int> fLineWidth{\"Hist.2D.Line.Width\"};\npublic:\n THistDrawingOpts() = default;\n};\n\n\/** \\class THistDrawingOpts<3>\n Drawing options for a 1D histogram.\n *\/\ntemplate <>\nclass THistDrawingOpts<3> {\n enum class EStyle { kBox, kIso };\n static const TStringEnumAttrSet &Styles() {\n static const TStringEnumAttrSet styles{\"box\", \"iso\"};\n return styles;\n }\n TDrawingAttrOrRef<TStringEnumAttr> fStyle{\"Hist.3D.Style\", 0, Styles()};\n TDrawingAttrOrRef<TColor> fLineColor{\"Hist.3D.Line.Color\"};\n TDrawingAttrOrRef<int> fLineWidth{\"Hist.3D.Line.Width\"};\npublic:\n THistDrawingOpts() = default;\n};\n\n} \/\/ namespace Experimental\n} \/\/ namespace ROOT\n\n#endif\n<|endoftext|>"} {"text":"<commit_before>#include \"singletons\/ircmanager.hpp\"\n#include \"asyncexec.hpp\"\n#include \"channel.hpp\"\n#include \"debug\/log.hpp\"\n#include \"messages\/messageparseargs.hpp\"\n#include \"singletons\/accountmanager.hpp\"\n#include \"singletons\/channelmanager.hpp\"\n#include \"singletons\/emotemanager.hpp\"\n#include \"singletons\/helper\/ircmessagehandler.hpp\"\n#include \"singletons\/resourcemanager.hpp\"\n#include \"singletons\/settingsmanager.hpp\"\n#include \"singletons\/windowmanager.hpp\"\n#include \"twitch\/twitchmessagebuilder.hpp\"\n#include \"twitch\/twitchuser.hpp\"\n#include \"util\/urlfetch.hpp\"\n\n#include <irccommand.h>\n#include <QJsonArray>\n#include <QJsonDocument>\n#include <QJsonObject>\n#include <QNetworkReply>\n#include <QNetworkRequest>\n\n#include <future>\n\nusing namespace chatterino::messages;\n\nnamespace chatterino {\nnamespace singletons {\n\nIrcManager::IrcManager(ChannelManager &_channelManager, ResourceManager &_resources,\n AccountManager &_accountManager)\n : channelManager(_channelManager)\n , resources(_resources)\n , accountManager(_accountManager)\n{\n this->messageSuffix.append(' ');\n this->messageSuffix.append(QChar(0x206D));\n\n this->account = accountManager.Twitch.getCurrent();\n accountManager.Twitch.userChanged.connect([this]() {\n this->setUser(accountManager.Twitch.getCurrent());\n\n debug::Log(\"[IrcManager] Reconnecting to Twitch IRC as new user {}\",\n this->account->getUserName());\n\n postToThread([this] { this->connect(); });\n });\n\n \/\/ Initialize the connections\n this->writeConnection.reset(new Communi::IrcConnection);\n this->writeConnection->moveToThread(QCoreApplication::instance()->thread());\n\n QObject::connect(this->writeConnection.get(), &Communi::IrcConnection::messageReceived, this,\n &IrcManager::writeConnectionMessageReceived);\n\n this->readConnection.reset(new Communi::IrcConnection);\n this->readConnection->moveToThread(QCoreApplication::instance()->thread());\n\n \/\/ Listen to read connection message signals\n QObject::connect(this->readConnection.get(), &Communi::IrcConnection::messageReceived, this,\n &IrcManager::messageReceived);\n QObject::connect(this->readConnection.get(), &Communi::IrcConnection::privateMessageReceived,\n this, &IrcManager::privateMessageReceived);\n\n QObject::connect(this->readConnection.get(), &Communi::IrcConnection::connected, this,\n &IrcManager::onConnected);\n QObject::connect(this->readConnection.get(), &Communi::IrcConnection::disconnected, this,\n &IrcManager::onDisconnected);\n\n \/\/ join and part chats on event\n ChannelManager::getInstance().ircJoin.connect(\n [this](const QString &name) { this->joinChannel(name); });\n ChannelManager::getInstance().ircPart.connect(\n [this](const QString &name) { this->partChannel(name); });\n}\n\nIrcManager &IrcManager::getInstance()\n{\n static IrcManager instance(ChannelManager::getInstance(),\n singletons::ResourceManager::getInstance(),\n AccountManager::getInstance());\n return instance;\n}\n\nvoid IrcManager::setUser(std::shared_ptr<twitch::TwitchUser> newAccount)\n{\n this->account = newAccount;\n}\n\nvoid IrcManager::connect()\n{\n this->disconnect();\n\n this->initializeConnection(this->writeConnection, false);\n this->initializeConnection(this->readConnection, true);\n\n \/\/ XXX(pajlada): Disabled the async_exec for now, because if we happen to run the\n \/\/ `beginConnecting` function in a different thread than last time, we won't be able to connect\n \/\/ because we can't clean up the previous connection properly\n \/\/ async_exec([this] { beginConnecting(); });\n this->beginConnecting();\n}\n\nvoid IrcManager::initializeConnection(const std::unique_ptr<Communi::IrcConnection> &connection,\n bool isReadConnection)\n{\n assert(this->account);\n\n QString username = this->account->getUserName();\n QString oauthClient = this->account->getOAuthClient();\n QString oauthToken = this->account->getOAuthToken();\n if (!oauthToken.startsWith(\"oauth:\")) {\n oauthToken.prepend(\"oauth:\");\n }\n\n connection->setUserName(username);\n connection->setNickName(username);\n connection->setRealName(username);\n\n if (!this->account->isAnon()) {\n connection->setPassword(oauthToken);\n\n this->refreshIgnoredUsers(username, oauthClient, oauthToken);\n }\n\n if (isReadConnection) {\n connection->sendCommand(\n Communi::IrcCommand::createCapability(\"REQ\", \"twitch.tv\/membership\"));\n connection->sendCommand(Communi::IrcCommand::createCapability(\"REQ\", \"twitch.tv\/commands\"));\n connection->sendCommand(Communi::IrcCommand::createCapability(\"REQ\", \"twitch.tv\/tags\"));\n } else {\n connection->sendCommand(Communi::IrcCommand::createCapability(\"REQ\", \"twitch.tv\/tags\"));\n\n connection->sendCommand(\n Communi::IrcCommand::createCapability(\"REQ\", \"twitch.tv\/membership\"));\n connection->sendCommand(Communi::IrcCommand::createCapability(\"REQ\", \"twitch.tv\/commands\"));\n }\n\n connection->setHost(\"irc.chat.twitch.tv\");\n connection->setPort(6667);\n}\n\nvoid IrcManager::refreshIgnoredUsers(const QString &username, const QString &oauthClient,\n const QString &oauthToken)\n{\n QString nextLink = \"https:\/\/api.twitch.tv\/kraken\/users\/\" + username + \"\/blocks?limit=\" + 100 +\n \"&client_id=\" + oauthClient;\n\n QNetworkAccessManager *manager = new QNetworkAccessManager();\n QNetworkRequest req(QUrl(nextLink + \"&oauth_token=\" + oauthToken));\n QNetworkReply *reply = manager->get(req);\n\n QObject::connect(reply, &QNetworkReply::finished, [=] {\n this->twitchBlockedUsersMutex.lock();\n this->twitchBlockedUsers.clear();\n this->twitchBlockedUsersMutex.unlock();\n\n QByteArray data = reply->readAll();\n QJsonDocument jsonDoc(QJsonDocument::fromJson(data));\n QJsonObject root = jsonDoc.object();\n\n \/\/ nextLink =\n \/\/ root.value(\"this->links\").toObject().value(\"next\").toString();\n\n auto blocks = root.value(\"blocks\").toArray();\n\n this->twitchBlockedUsersMutex.lock();\n for (QJsonValue block : blocks) {\n QJsonObject user = block.toObject().value(\"user\").toObject();\n \/\/ displaythis->name\n this->twitchBlockedUsers.insert(user.value(\"name\").toString().toLower(), true);\n }\n this->twitchBlockedUsersMutex.unlock();\n\n manager->deleteLater();\n });\n}\n\nvoid IrcManager::beginConnecting()\n{\n std::lock_guard<std::mutex> locker(this->connectionMutex);\n\n for (auto &channel : this->channelManager.getItems()) {\n this->writeConnection->sendRaw(\"JOIN #\" + channel->name);\n this->readConnection->sendRaw(\"JOIN #\" + channel->name);\n }\n\n this->writeConnection->open();\n this->readConnection->open();\n}\n\nvoid IrcManager::disconnect()\n{\n std::lock_guard<std::mutex> locker(this->connectionMutex);\n\n this->readConnection->close();\n this->writeConnection->close();\n}\n\nvoid IrcManager::sendMessage(const QString &channelName, QString message)\n{\n this->connectionMutex.lock();\n static int i = 0;\n\n if (this->writeConnection) {\n if (singletons::SettingManager::getInstance().allowDuplicateMessages && (++i % 2) == 0) {\n message.append(this->messageSuffix);\n }\n this->writeConnection->sendRaw(\"PRIVMSG #\" + channelName + \" :\" + message);\n }\n\n this->connectionMutex.unlock();\n}\n\nvoid IrcManager::joinChannel(const QString &channelName)\n{\n this->connectionMutex.lock();\n\n if (this->readConnection && this->writeConnection) {\n this->readConnection->sendRaw(\"JOIN #\" + channelName);\n this->writeConnection->sendRaw(\"JOIN #\" + channelName);\n }\n\n this->connectionMutex.unlock();\n}\n\nvoid IrcManager::partChannel(const QString &channelName)\n{\n this->connectionMutex.lock();\n\n if (this->readConnection && this->writeConnection) {\n this->readConnection->sendRaw(\"PART #\" + channelName);\n this->writeConnection->sendRaw(\"PART #\" + channelName);\n }\n\n this->connectionMutex.unlock();\n}\n\nvoid IrcManager::privateMessageReceived(Communi::IrcPrivateMessage *message)\n{\n this->onPrivateMessage.invoke(message);\n auto c = this->channelManager.getTwitchChannel(message->target().mid(1));\n\n if (!c) {\n return;\n }\n\n messages::MessageParseArgs args;\n\n twitch::TwitchMessageBuilder builder(c.get(), message, args);\n\n c->addMessage(builder.parse());\n}\n\nvoid IrcManager::messageReceived(Communi::IrcMessage *message)\n{\n if (message->type() == Communi::IrcMessage::Type::Private) {\n \/\/ We already have a handler for private messages\n return;\n }\n\n const QString &command = message->command();\n\n if (command == \"ROOMSTATE\") {\n helper::IrcMessageHandler::getInstance().handleRoomStateMessage(message);\n } else if (command == \"CLEARCHAT\") {\n helper::IrcMessageHandler::getInstance().handleClearChatMessage(message);\n } else if (command == \"USERSTATE\") {\n helper::IrcMessageHandler::getInstance().handleUserStateMessage(message);\n } else if (command == \"WHISPER\") {\n helper::IrcMessageHandler::getInstance().handleWhisperMessage(message);\n } else if (command == \"USERNOTICE\") {\n helper::IrcMessageHandler::getInstance().handleUserNoticeMessage(message);\n } else if (command == \"MODE\") {\n helper::IrcMessageHandler::getInstance().handleModeMessage(message);\n } else if (command == \"NOTICE\") {\n helper::IrcMessageHandler::getInstance().handleNoticeMessage(\n static_cast<Communi::IrcNoticeMessage *>(message));\n }\n}\n\nvoid IrcManager::writeConnectionMessageReceived(Communi::IrcMessage *message)\n{\n switch (message->type()) {\n case Communi::IrcMessage::Type::Notice: {\n helper::IrcMessageHandler::getInstance().handleWriteConnectionNoticeMessage(\n static_cast<Communi::IrcNoticeMessage *>(message));\n } break;\n }\n}\n\n\/\/ XXX: This does not fit in IrcManager\nbool IrcManager::isTwitchUserBlocked(QString const &username)\n{\n QMutexLocker locker(&this->twitchBlockedUsersMutex);\n\n auto iterator = this->twitchBlockedUsers.find(username);\n\n return iterator != this->twitchBlockedUsers.end();\n}\n\n\/\/ XXX: This does not fit in IrcManager\nbool IrcManager::tryAddIgnoredUser(QString const &username, QString &errorMessage)\n{\n assert(this->account);\n\n QUrl url(\"https:\/\/api.twitch.tv\/kraken\/users\/\" + this->account->getUserName() + \"\/blocks\/\" +\n username + \"?oauth_token=\" + this->account->getOAuthToken() +\n \"&client_id=\" + this->account->getOAuthClient());\n\n QNetworkRequest request(url);\n auto reply = this->networkAccessManager.put(request, QByteArray());\n reply->waitForReadyRead(10000);\n\n if (reply->error() == QNetworkReply::NoError) {\n this->twitchBlockedUsersMutex.lock();\n this->twitchBlockedUsers.insert(username, true);\n this->twitchBlockedUsersMutex.unlock();\n\n return true;\n }\n\n reply->deleteLater();\n\n errorMessage = \"Error while ignoring user \\\"\" + username + \"\\\": \" + reply->errorString();\n\n return false;\n}\n\n\/\/ XXX: This does not fit in IrcManager\nvoid IrcManager::addIgnoredUser(QString const &username)\n{\n QString errorMessage;\n if (!tryAddIgnoredUser(username, errorMessage)) {\n \/\/ TODO: Implement IrcManager::addIgnoredUser\n }\n}\n\n\/\/ XXX: This does not fit in IrcManager\nbool IrcManager::tryRemoveIgnoredUser(QString const &username, QString &errorMessage)\n{\n assert(this->account);\n\n QUrl url(\"https:\/\/api.twitch.tv\/kraken\/users\/\" + this->account->getUserName() + \"\/blocks\/\" +\n username + \"?oauth_token=\" + this->account->getOAuthToken() +\n \"&client_id=\" + this->account->getOAuthClient());\n\n QNetworkRequest request(url);\n auto reply = this->networkAccessManager.deleteResource(request);\n reply->waitForReadyRead(10000);\n\n if (reply->error() == QNetworkReply::NoError) {\n this->twitchBlockedUsersMutex.lock();\n this->twitchBlockedUsers.remove(username);\n this->twitchBlockedUsersMutex.unlock();\n\n return true;\n }\n\n reply->deleteLater();\n\n errorMessage = \"Error while unignoring user \\\"\" + username + \"\\\": \" + reply->errorString();\n\n return false;\n}\n\n\/\/ XXX: This does not fit in IrcManager\nvoid IrcManager::removeIgnoredUser(QString const &username)\n{\n QString errorMessage;\n if (!tryRemoveIgnoredUser(username, errorMessage)) {\n \/\/ TODO: Implement IrcManager::removeIgnoredUser\n }\n}\n\nvoid IrcManager::onConnected()\n{\n std::shared_ptr<Message> msg(Message::createSystemMessage(\"connected to chat\"));\n\n this->channelManager.doOnAll([msg](std::shared_ptr<Channel> channel) {\n assert(channel);\n channel->addMessage(msg);\n });\n}\n\nvoid IrcManager::onDisconnected()\n{\n std::shared_ptr<Message> msg(Message::createSystemMessage(\"disconnected from chat\"));\n\n this->channelManager.doOnAll([msg](std::shared_ptr<Channel> channel) {\n assert(channel);\n channel->addMessage(msg);\n });\n}\n\nCommuni::IrcConnection *IrcManager::getReadConnection()\n{\n return this->readConnection.get();\n}\n\n} \/\/ namespace chatterino\n}\n<commit_msg>Disable empty-string sending<commit_after>#include \"singletons\/ircmanager.hpp\"\n#include \"asyncexec.hpp\"\n#include \"channel.hpp\"\n#include \"debug\/log.hpp\"\n#include \"messages\/messageparseargs.hpp\"\n#include \"singletons\/accountmanager.hpp\"\n#include \"singletons\/channelmanager.hpp\"\n#include \"singletons\/emotemanager.hpp\"\n#include \"singletons\/helper\/ircmessagehandler.hpp\"\n#include \"singletons\/resourcemanager.hpp\"\n#include \"singletons\/settingsmanager.hpp\"\n#include \"singletons\/windowmanager.hpp\"\n#include \"twitch\/twitchmessagebuilder.hpp\"\n#include \"twitch\/twitchuser.hpp\"\n#include \"util\/urlfetch.hpp\"\n\n#include <irccommand.h>\n#include <QJsonArray>\n#include <QJsonDocument>\n#include <QJsonObject>\n#include <QNetworkReply>\n#include <QNetworkRequest>\n\n#include <future>\n\nusing namespace chatterino::messages;\n\nnamespace chatterino {\nnamespace singletons {\n\nIrcManager::IrcManager(ChannelManager &_channelManager, ResourceManager &_resources,\n AccountManager &_accountManager)\n : channelManager(_channelManager)\n , resources(_resources)\n , accountManager(_accountManager)\n{\n this->messageSuffix.append(' ');\n this->messageSuffix.append(QChar(0x206D));\n\n this->account = accountManager.Twitch.getCurrent();\n accountManager.Twitch.userChanged.connect([this]() {\n this->setUser(accountManager.Twitch.getCurrent());\n\n debug::Log(\"[IrcManager] Reconnecting to Twitch IRC as new user {}\",\n this->account->getUserName());\n\n postToThread([this] { this->connect(); });\n });\n\n \/\/ Initialize the connections\n this->writeConnection.reset(new Communi::IrcConnection);\n this->writeConnection->moveToThread(QCoreApplication::instance()->thread());\n\n QObject::connect(this->writeConnection.get(), &Communi::IrcConnection::messageReceived, this,\n &IrcManager::writeConnectionMessageReceived);\n\n this->readConnection.reset(new Communi::IrcConnection);\n this->readConnection->moveToThread(QCoreApplication::instance()->thread());\n\n \/\/ Listen to read connection message signals\n QObject::connect(this->readConnection.get(), &Communi::IrcConnection::messageReceived, this,\n &IrcManager::messageReceived);\n QObject::connect(this->readConnection.get(), &Communi::IrcConnection::privateMessageReceived,\n this, &IrcManager::privateMessageReceived);\n\n QObject::connect(this->readConnection.get(), &Communi::IrcConnection::connected, this,\n &IrcManager::onConnected);\n QObject::connect(this->readConnection.get(), &Communi::IrcConnection::disconnected, this,\n &IrcManager::onDisconnected);\n\n \/\/ join and part chats on event\n ChannelManager::getInstance().ircJoin.connect(\n [this](const QString &name) { this->joinChannel(name); });\n ChannelManager::getInstance().ircPart.connect(\n [this](const QString &name) { this->partChannel(name); });\n}\n\nIrcManager &IrcManager::getInstance()\n{\n static IrcManager instance(ChannelManager::getInstance(),\n singletons::ResourceManager::getInstance(),\n AccountManager::getInstance());\n return instance;\n}\n\nvoid IrcManager::setUser(std::shared_ptr<twitch::TwitchUser> newAccount)\n{\n this->account = newAccount;\n}\n\nvoid IrcManager::connect()\n{\n this->disconnect();\n\n this->initializeConnection(this->writeConnection, false);\n this->initializeConnection(this->readConnection, true);\n\n \/\/ XXX(pajlada): Disabled the async_exec for now, because if we happen to run the\n \/\/ `beginConnecting` function in a different thread than last time, we won't be able to connect\n \/\/ because we can't clean up the previous connection properly\n \/\/ async_exec([this] { beginConnecting(); });\n this->beginConnecting();\n}\n\nvoid IrcManager::initializeConnection(const std::unique_ptr<Communi::IrcConnection> &connection,\n bool isReadConnection)\n{\n assert(this->account);\n\n QString username = this->account->getUserName();\n QString oauthClient = this->account->getOAuthClient();\n QString oauthToken = this->account->getOAuthToken();\n if (!oauthToken.startsWith(\"oauth:\")) {\n oauthToken.prepend(\"oauth:\");\n }\n\n connection->setUserName(username);\n connection->setNickName(username);\n connection->setRealName(username);\n\n if (!this->account->isAnon()) {\n connection->setPassword(oauthToken);\n\n this->refreshIgnoredUsers(username, oauthClient, oauthToken);\n }\n\n if (isReadConnection) {\n connection->sendCommand(\n Communi::IrcCommand::createCapability(\"REQ\", \"twitch.tv\/membership\"));\n connection->sendCommand(Communi::IrcCommand::createCapability(\"REQ\", \"twitch.tv\/commands\"));\n connection->sendCommand(Communi::IrcCommand::createCapability(\"REQ\", \"twitch.tv\/tags\"));\n } else {\n connection->sendCommand(Communi::IrcCommand::createCapability(\"REQ\", \"twitch.tv\/tags\"));\n\n connection->sendCommand(\n Communi::IrcCommand::createCapability(\"REQ\", \"twitch.tv\/membership\"));\n connection->sendCommand(Communi::IrcCommand::createCapability(\"REQ\", \"twitch.tv\/commands\"));\n }\n\n connection->setHost(\"irc.chat.twitch.tv\");\n connection->setPort(6667);\n}\n\nvoid IrcManager::refreshIgnoredUsers(const QString &username, const QString &oauthClient,\n const QString &oauthToken)\n{\n QString nextLink = \"https:\/\/api.twitch.tv\/kraken\/users\/\" + username + \"\/blocks?limit=\" + 100 +\n \"&client_id=\" + oauthClient;\n\n QNetworkAccessManager *manager = new QNetworkAccessManager();\n QNetworkRequest req(QUrl(nextLink + \"&oauth_token=\" + oauthToken));\n QNetworkReply *reply = manager->get(req);\n\n QObject::connect(reply, &QNetworkReply::finished, [=] {\n this->twitchBlockedUsersMutex.lock();\n this->twitchBlockedUsers.clear();\n this->twitchBlockedUsersMutex.unlock();\n\n QByteArray data = reply->readAll();\n QJsonDocument jsonDoc(QJsonDocument::fromJson(data));\n QJsonObject root = jsonDoc.object();\n\n \/\/ nextLink =\n \/\/ root.value(\"this->links\").toObject().value(\"next\").toString();\n\n auto blocks = root.value(\"blocks\").toArray();\n\n this->twitchBlockedUsersMutex.lock();\n for (QJsonValue block : blocks) {\n QJsonObject user = block.toObject().value(\"user\").toObject();\n \/\/ displaythis->name\n this->twitchBlockedUsers.insert(user.value(\"name\").toString().toLower(), true);\n }\n this->twitchBlockedUsersMutex.unlock();\n\n manager->deleteLater();\n });\n}\n\nvoid IrcManager::beginConnecting()\n{\n std::lock_guard<std::mutex> locker(this->connectionMutex);\n\n for (auto &channel : this->channelManager.getItems()) {\n this->writeConnection->sendRaw(\"JOIN #\" + channel->name);\n this->readConnection->sendRaw(\"JOIN #\" + channel->name);\n }\n\n this->writeConnection->open();\n this->readConnection->open();\n}\n\nvoid IrcManager::disconnect()\n{\n std::lock_guard<std::mutex> locker(this->connectionMutex);\n\n this->readConnection->close();\n this->writeConnection->close();\n}\n\nvoid IrcManager::sendMessage(const QString &channelName, QString message)\n{\n QString trimmedMessage = message.trimmed();\n if (trimmedMessage.isEmpty()) {\n return;\n }\n\n this->connectionMutex.lock();\n static int i = 0;\n\n if (this->writeConnection) {\n if (singletons::SettingManager::getInstance().allowDuplicateMessages && (++i % 2) == 0) {\n trimmedMessage.append(this->messageSuffix);\n }\n this->writeConnection->sendRaw(\"PRIVMSG #\" + channelName + \" :\" + trimmedMessage);\n }\n\n this->connectionMutex.unlock();\n}\n\nvoid IrcManager::joinChannel(const QString &channelName)\n{\n this->connectionMutex.lock();\n\n if (this->readConnection && this->writeConnection) {\n this->readConnection->sendRaw(\"JOIN #\" + channelName);\n this->writeConnection->sendRaw(\"JOIN #\" + channelName);\n }\n\n this->connectionMutex.unlock();\n}\n\nvoid IrcManager::partChannel(const QString &channelName)\n{\n this->connectionMutex.lock();\n\n if (this->readConnection && this->writeConnection) {\n this->readConnection->sendRaw(\"PART #\" + channelName);\n this->writeConnection->sendRaw(\"PART #\" + channelName);\n }\n\n this->connectionMutex.unlock();\n}\n\nvoid IrcManager::privateMessageReceived(Communi::IrcPrivateMessage *message)\n{\n this->onPrivateMessage.invoke(message);\n auto c = this->channelManager.getTwitchChannel(message->target().mid(1));\n\n if (!c) {\n return;\n }\n\n messages::MessageParseArgs args;\n\n twitch::TwitchMessageBuilder builder(c.get(), message, args);\n\n c->addMessage(builder.parse());\n}\n\nvoid IrcManager::messageReceived(Communi::IrcMessage *message)\n{\n if (message->type() == Communi::IrcMessage::Type::Private) {\n \/\/ We already have a handler for private messages\n return;\n }\n\n const QString &command = message->command();\n\n if (command == \"ROOMSTATE\") {\n helper::IrcMessageHandler::getInstance().handleRoomStateMessage(message);\n } else if (command == \"CLEARCHAT\") {\n helper::IrcMessageHandler::getInstance().handleClearChatMessage(message);\n } else if (command == \"USERSTATE\") {\n helper::IrcMessageHandler::getInstance().handleUserStateMessage(message);\n } else if (command == \"WHISPER\") {\n helper::IrcMessageHandler::getInstance().handleWhisperMessage(message);\n } else if (command == \"USERNOTICE\") {\n helper::IrcMessageHandler::getInstance().handleUserNoticeMessage(message);\n } else if (command == \"MODE\") {\n helper::IrcMessageHandler::getInstance().handleModeMessage(message);\n } else if (command == \"NOTICE\") {\n helper::IrcMessageHandler::getInstance().handleNoticeMessage(\n static_cast<Communi::IrcNoticeMessage *>(message));\n }\n}\n\nvoid IrcManager::writeConnectionMessageReceived(Communi::IrcMessage *message)\n{\n switch (message->type()) {\n case Communi::IrcMessage::Type::Notice: {\n helper::IrcMessageHandler::getInstance().handleWriteConnectionNoticeMessage(\n static_cast<Communi::IrcNoticeMessage *>(message));\n } break;\n }\n}\n\n\/\/ XXX: This does not fit in IrcManager\nbool IrcManager::isTwitchUserBlocked(QString const &username)\n{\n QMutexLocker locker(&this->twitchBlockedUsersMutex);\n\n auto iterator = this->twitchBlockedUsers.find(username);\n\n return iterator != this->twitchBlockedUsers.end();\n}\n\n\/\/ XXX: This does not fit in IrcManager\nbool IrcManager::tryAddIgnoredUser(QString const &username, QString &errorMessage)\n{\n assert(this->account);\n\n QUrl url(\"https:\/\/api.twitch.tv\/kraken\/users\/\" + this->account->getUserName() + \"\/blocks\/\" +\n username + \"?oauth_token=\" + this->account->getOAuthToken() +\n \"&client_id=\" + this->account->getOAuthClient());\n\n QNetworkRequest request(url);\n auto reply = this->networkAccessManager.put(request, QByteArray());\n reply->waitForReadyRead(10000);\n\n if (reply->error() == QNetworkReply::NoError) {\n this->twitchBlockedUsersMutex.lock();\n this->twitchBlockedUsers.insert(username, true);\n this->twitchBlockedUsersMutex.unlock();\n\n return true;\n }\n\n reply->deleteLater();\n\n errorMessage = \"Error while ignoring user \\\"\" + username + \"\\\": \" + reply->errorString();\n\n return false;\n}\n\n\/\/ XXX: This does not fit in IrcManager\nvoid IrcManager::addIgnoredUser(QString const &username)\n{\n QString errorMessage;\n if (!tryAddIgnoredUser(username, errorMessage)) {\n \/\/ TODO: Implement IrcManager::addIgnoredUser\n }\n}\n\n\/\/ XXX: This does not fit in IrcManager\nbool IrcManager::tryRemoveIgnoredUser(QString const &username, QString &errorMessage)\n{\n assert(this->account);\n\n QUrl url(\"https:\/\/api.twitch.tv\/kraken\/users\/\" + this->account->getUserName() + \"\/blocks\/\" +\n username + \"?oauth_token=\" + this->account->getOAuthToken() +\n \"&client_id=\" + this->account->getOAuthClient());\n\n QNetworkRequest request(url);\n auto reply = this->networkAccessManager.deleteResource(request);\n reply->waitForReadyRead(10000);\n\n if (reply->error() == QNetworkReply::NoError) {\n this->twitchBlockedUsersMutex.lock();\n this->twitchBlockedUsers.remove(username);\n this->twitchBlockedUsersMutex.unlock();\n\n return true;\n }\n\n reply->deleteLater();\n\n errorMessage = \"Error while unignoring user \\\"\" + username + \"\\\": \" + reply->errorString();\n\n return false;\n}\n\n\/\/ XXX: This does not fit in IrcManager\nvoid IrcManager::removeIgnoredUser(QString const &username)\n{\n QString errorMessage;\n if (!tryRemoveIgnoredUser(username, errorMessage)) {\n \/\/ TODO: Implement IrcManager::removeIgnoredUser\n }\n}\n\nvoid IrcManager::onConnected()\n{\n std::shared_ptr<Message> msg(Message::createSystemMessage(\"connected to chat\"));\n\n this->channelManager.doOnAll([msg](std::shared_ptr<Channel> channel) {\n assert(channel);\n channel->addMessage(msg);\n });\n}\n\nvoid IrcManager::onDisconnected()\n{\n std::shared_ptr<Message> msg(Message::createSystemMessage(\"disconnected from chat\"));\n\n this->channelManager.doOnAll([msg](std::shared_ptr<Channel> channel) {\n assert(channel);\n channel->addMessage(msg);\n });\n}\n\nCommuni::IrcConnection *IrcManager::getReadConnection()\n{\n return this->readConnection.get();\n}\n\n} \/\/ namespace singletons\n} \/\/ namespace chatterino\n<|endoftext|>"} {"text":"<commit_before>#include <limits>\n#include <boost\/foreach.hpp>\n#include \"BasicOffense122.hpp\"\n\nusing namespace std;\nusing namespace Geometry2d;\n\nREGISTER_PLAY_CATEGORY(Gameplay::Plays::BasicOffense122, \"Playing\")\n\nnamespace Gameplay\n{\n\tnamespace Plays\n\t{\n\t\tREGISTER_CONFIGURABLE(BasicOffense122)\n\t}\n}\n\nConfigDouble *Gameplay::Plays::BasicOffense122::_offense_hysteresis;\nConfigDouble *Gameplay::Plays::BasicOffense122::_support_backoff_thresh;\nConfigDouble *Gameplay::Plays::BasicOffense122::_mark_hysteresis_coeff;\nConfigDouble *Gameplay::Plays::BasicOffense122::_support_avoid_teammate_radius;\nConfigDouble *Gameplay::Plays::BasicOffense122::_support_avoid_shot;\nConfigDouble *Gameplay::Plays::BasicOffense122::_offense_support_ratio;\nConfigDouble *Gameplay::Plays::BasicOffense122::_defense_support_ratio;\nConfigBool *Gameplay::Plays::BasicOffense122::_use_line_kick;\n\nvoid Gameplay::Plays::BasicOffense122::createConfiguration(Configuration *cfg)\n{\n\t_offense_hysteresis = new ConfigDouble(cfg, \"BasicOffense122\/Hystersis Coeff\", 0.50);\n\t_support_backoff_thresh = new ConfigDouble(cfg, \"BasicOffense122\/Support Backoff Dist\", 1.5);\n\t_mark_hysteresis_coeff = new ConfigDouble(cfg, \"BasicOffense122\/Mark Hystersis Coeff\", 0.9);\n\t_support_avoid_teammate_radius = new ConfigDouble(cfg, \"BasicOffense122\/Support Avoid Teammate Dist\", 0.5);\n\t_support_avoid_shot = new ConfigDouble(cfg, \"BasicOffense122\/Support Avoid Shot\", 0.2);\n\t_offense_support_ratio = new ConfigDouble(cfg, \"BasicOffense122\/Offense Support Ratio\", 0.7);\n\t_defense_support_ratio = new ConfigDouble(cfg, \"BasicOffense122\/Defense Support Ratio\", 0.9);\n\t_use_line_kick = new ConfigBool(cfg, \"BasicOffense122\/Enable Line Kick\", true);\n}\n\nGameplay::Plays::BasicOffense122::BasicOffense122(GameplayModule *gameplay):\nPlay(gameplay),\n_leftFullback(gameplay, Behaviors::Fullback::Left),\n_rightFullback(gameplay, Behaviors::Fullback::Right),\n_striker(gameplay),\n_support1(gameplay),\n_support2(gameplay)\n{\n\t_leftFullback.otherFullbacks.insert(&_rightFullback);\n\t_rightFullback.otherFullbacks.insert(&_leftFullback);\n\n\t\/\/ use constant value of mark threshold for now\n\t_support1.markLineThresh(1.0);\n\t_support2.markLineThresh(1.0);\n}\n\nfloat Gameplay::Plays::BasicOffense122::score ( Gameplay::GameplayModule* gameplay )\n{\n\t\/\/ only run if we are playing and not in a restart\n\tbool refApplicable = gameplay->state()->gameState.playing();\n\treturn refApplicable ? 0 : INFINITY;\n}\n\nbool Gameplay::Plays::BasicOffense122::run()\n{\n\t\/\/ handle assignments\n\tset<OurRobot *> available = _gameplay->playRobots();\n\n\t\/\/ project the ball forward (dampened)\n\tconst float proj_time = 0.75; \/\/ seconds to project\n\tconst float dampen_factor = 0.9; \/\/ accounts for slowing over time\n\tGeometry2d::Point ballProj = ball().pos + ball().vel * proj_time * dampen_factor;\n\n\t\/\/ Get a striker first to ensure there a robot that can kick\n\tassignNearestKicker(_striker.robot, available, ballProj);\n\n\t\/\/ defense first - get closest to goal to choose sides properly\n\tassignNearest(_leftFullback.robot, available, Geometry2d::Point(-Field_GoalWidth\/2, 0.0));\n\tassignNearest(_rightFullback.robot, available, Geometry2d::Point(Field_GoalWidth\/2, 0.0));\n\n\t\/\/ choose offense, we want closest robot to ball to be striker\n\tassignNearest(_support1.robot, available, ballProj);\n\tif (_support1.robot)\n\t\t_support1.robot->addText(\"Support 1\");\n\tassignNearest(_support2.robot, available, ballProj);\n\tif (_support2.robot)\n\t\t_support2.robot->addText(\"Support 2\");\n\n\t\/\/ determine whether to change offense players\n\tbool forward_reset = false;\n\tif (_striker.robot && _support1.robot && _support2.robot &&\n\t\t\t(_support1.robot->pos.distTo(ballProj) < *_offense_hysteresis * _striker.robot->pos.distTo(ballProj)\n\t\t\t\t|| _support2.robot->pos.distTo(ballProj) < *_offense_hysteresis * _striker.robot->pos.distTo(ballProj))) {\n\t\t_striker.robot = NULL;\n\t\t_support1.robot = NULL;\n\t\t_support2.robot = NULL;\n\t\t_striker.restart();\n\t\tforward_reset = true;\n\t}\n\n\t\/\/ find the nearest opponent to the striker\n\tOpponentRobot* closestRobotToStriker = 0;\n\tfloat closestDistToStriker = numeric_limits<float>::infinity();\n\tif (_striker.robot) {\n\t\tBOOST_FOREACH(OpponentRobot* opp, state()->opp) {\n\t\t\tif (opp) {\n\t\t\t\tfloat d = opp->pos.distTo(_striker.robot->pos);\n\t\t\t\tif (d < closestDistToStriker) {\n\t\t\t\t\tclosestDistToStriker = d;\n\t\t\t\t\tclosestRobotToStriker = opp;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\tbool striker_engaged = _striker.robot && closestDistToStriker < *_support_backoff_thresh;\n\n\t\/\/ pick as a mark target the furthest back opposing robot\n\t\/\/ and adjust mark ratio based on field position\n\t\/\/ find *two* furthest back opp robots\n\tOpponentRobot* bestOpp1 = NULL, *bestOpp2 = NULL;\n\tfloat bestDist1 = numeric_limits<float>::infinity(), bestDist2 = bestDist1;\n\tsize_t nrOppClose = 0;\n\tBOOST_FOREACH(OpponentRobot* opp, state()->opp)\n\t{\n\t\t\/\/ use distance from goal rather than just y coordinate to handle corners better\n\t\tconst float oppDistSq = opp->pos.magsq();\n\t\tif (opp && opp->visible &&\n\t\t\t\t oppDistSq > 0.1 &&\n\t\t\t\t !(striker_engaged && opp == closestRobotToStriker)\n\t\t\t\t ) {\n\t\t\tif (oppDistSq <= bestDist1) {\n\t\t\t\tbestDist2 = bestDist1;\n\t\t\t\tbestDist1 = oppDistSq;\n\t\t\t\tbestOpp2 = bestOpp1;\n\t\t\t\tbestOpp1 = opp;\n\t\t\t} else if (oppDistSq <= bestDist2) {\n\t\t\t\tbestDist2 = oppDistSq;\n\t\t\t\tbestOpp2 = opp;\n\t\t\t}\n\n\t\t\tif (oppDistSq < Field_Length * Field_Length \/ 4.0) {\n\t\t\t\t++nrOppClose;\n\t\t\t}\n\t\t}\n\t}\n\tif (!bestOpp1 && _support1.robot) {\n\t\t_support1.robot->addText(\"No mark target\");\n\t\tif(_striker.robot){\n\t\t\t\/\/ if nothing to mark, hang behind the striker on other side of the field\n\t\t\t_support1.robot->addText(\"Static Support\");\n\t\t\tPoint support_goal = _striker.robot->pos;\n\t\t\tsupport_goal.x *= -1.0;\n\t\t\tif (fabs(support_goal.x) < 0.2)\n\t\t\t{\n\t\t\t\tsupport_goal.x = (support_goal.x < 0.0) ? -1.0 : 1.0;\n\t\t\t}\n\n\t\t\tif (ballProj.y > Field_Length\/2.0 && nrOppClose)\n\t\t\t\tsupport_goal.y = max(support_goal.y * (double)*_offense_support_ratio, 0.3);\n\t\t\telse\n\t\t\t\tsupport_goal.y = max(support_goal.y * (double)*_defense_support_ratio, 0.3);\n\n\t\t\t_support1.robot->move(support_goal);\n\t\t\t_support1.robot->face(ballProj);\n\t\t}\n\t}\n\tif (!bestOpp2 && _support2.robot) {\n\t\t_support2.robot->addText(\"No mark target\");\n\t\t\/\/TODO: something useful like wait for a rebound kick\n\t}\n\tbool marking_active_1 = bestOpp1 != 0;\n\tbool marking_active_2 = bestOpp2 != 0;\n\n\t\/\/ use hysteresis for changing of the robot\n\tfloat cur_dist1 = (_support1.markRobot()) ?\t_support1.markRobot()->pos.distTo(ballProj) : numeric_limits<float>::infinity();\n\tfloat cur_dist2 = (_support2.markRobot()) ?\t_support2.markRobot()->pos.distTo(ballProj) : numeric_limits<float>::infinity();\n\tif (bestOpp1 && bestOpp1->visible && (forward_reset || bestDist1 < cur_dist1 * cur_dist1 * (float)*_mark_hysteresis_coeff))\n\t\t_support1.markRobot(bestOpp1);\n\tif (bestOpp2 && bestOpp2->visible && (forward_reset || bestDist2 < cur_dist2 * cur_dist2 * (float)*_mark_hysteresis_coeff))\n\t\t_support2.markRobot(bestOpp2);\n\n\t\/\/ if we are further away, we can mark further from robot\n\tif (ballProj.y > Field_Length\/2.0 && nrOppClose) {\n\t\t_support1.ratio(*_offense_support_ratio);\n\t\t_support2.ratio(*_offense_support_ratio);\n\t}\n\telse {\n\t\t_support1.ratio(*_defense_support_ratio);\n\t\t_support2.ratio(*_defense_support_ratio);\n\t}\n\n\t\/\/ adjust obstacles on striker and support\n\tif (_striker.robot) {\n\t\tunsigned striker = _striker.robot->shell();\n\t\tif (_support1.robot)\n\t\t\t_support1.robot->avoidTeammateRadius(striker, *_support_avoid_teammate_radius);\n\t\tif (_support2.robot)\n\t\t\t_support2.robot->avoidTeammateRadius(striker, *_support_avoid_teammate_radius);\n\n\t\t\/\/ get out of ways of shots\n\t\tif (_striker.robot->pos.nearPoint(ballProj, *_support_avoid_shot)) {\n\t\t\tPolygon shot_obs;\n\t\t\tshot_obs.vertices.push_back(Geometry2d::Point(Field_GoalWidth \/ 2, Field_Length));\n\t\t\tshot_obs.vertices.push_back(Geometry2d::Point(-Field_GoalWidth \/ 2, Field_Length));\n\t\t\tshot_obs.vertices.push_back(ballProj);\n\t\t\tif(_support1.robot)\n\t\t\t\t_support1.robot->localObstacles(ObstaclePtr(new PolygonObstacle(shot_obs)));\n\t\t\tif(_support1.robot)\n\t\t\t\t_support2.robot->localObstacles(ObstaclePtr(new PolygonObstacle(shot_obs)));\n\t\t}\n\t}\n\n\t\/\/ manually reset any kickers so they keep kicking\n\tif (_striker.done())\n\t\t_striker.restart();\n\n\t\/\/ set flags for inner behaviors\n\t_striker.use_line_kick = *_use_line_kick;\n\tif (_striker.robot)\n\t{\n\t\t_striker.calculateChipPower(_striker.robot->pos.distTo(ball().pos));\n\t}\n\n\t\/\/ execute behaviors\n\tif (_striker.robot) _striker.run();\n\tif (marking_active_1 && _support1.robot) _support1.run();\n\tif (marking_active_2 && _support2.robot) _support2.run();\n\tif (_leftFullback.robot) _leftFullback.run();\n\tif (_rightFullback.robot) _rightFullback.run();\n\n\treturn true;\n}\n<commit_msg>Fixed null check in BasicOffense122<commit_after>#include <limits>\n#include <boost\/foreach.hpp>\n#include \"BasicOffense122.hpp\"\n\nusing namespace std;\nusing namespace Geometry2d;\n\nREGISTER_PLAY_CATEGORY(Gameplay::Plays::BasicOffense122, \"Playing\")\n\nnamespace Gameplay\n{\n\tnamespace Plays\n\t{\n\t\tREGISTER_CONFIGURABLE(BasicOffense122)\n\t}\n}\n\nConfigDouble *Gameplay::Plays::BasicOffense122::_offense_hysteresis;\nConfigDouble *Gameplay::Plays::BasicOffense122::_support_backoff_thresh;\nConfigDouble *Gameplay::Plays::BasicOffense122::_mark_hysteresis_coeff;\nConfigDouble *Gameplay::Plays::BasicOffense122::_support_avoid_teammate_radius;\nConfigDouble *Gameplay::Plays::BasicOffense122::_support_avoid_shot;\nConfigDouble *Gameplay::Plays::BasicOffense122::_offense_support_ratio;\nConfigDouble *Gameplay::Plays::BasicOffense122::_defense_support_ratio;\nConfigBool *Gameplay::Plays::BasicOffense122::_use_line_kick;\n\nvoid Gameplay::Plays::BasicOffense122::createConfiguration(Configuration *cfg)\n{\n\t_offense_hysteresis = new ConfigDouble(cfg, \"BasicOffense122\/Hystersis Coeff\", 0.50);\n\t_support_backoff_thresh = new ConfigDouble(cfg, \"BasicOffense122\/Support Backoff Dist\", 1.5);\n\t_mark_hysteresis_coeff = new ConfigDouble(cfg, \"BasicOffense122\/Mark Hystersis Coeff\", 0.9);\n\t_support_avoid_teammate_radius = new ConfigDouble(cfg, \"BasicOffense122\/Support Avoid Teammate Dist\", 0.5);\n\t_support_avoid_shot = new ConfigDouble(cfg, \"BasicOffense122\/Support Avoid Shot\", 0.2);\n\t_offense_support_ratio = new ConfigDouble(cfg, \"BasicOffense122\/Offense Support Ratio\", 0.7);\n\t_defense_support_ratio = new ConfigDouble(cfg, \"BasicOffense122\/Defense Support Ratio\", 0.9);\n\t_use_line_kick = new ConfigBool(cfg, \"BasicOffense122\/Enable Line Kick\", true);\n}\n\nGameplay::Plays::BasicOffense122::BasicOffense122(GameplayModule *gameplay):\nPlay(gameplay),\n_leftFullback(gameplay, Behaviors::Fullback::Left),\n_rightFullback(gameplay, Behaviors::Fullback::Right),\n_striker(gameplay),\n_support1(gameplay),\n_support2(gameplay)\n{\n\t_leftFullback.otherFullbacks.insert(&_rightFullback);\n\t_rightFullback.otherFullbacks.insert(&_leftFullback);\n\n\t\/\/ use constant value of mark threshold for now\n\t_support1.markLineThresh(1.0);\n\t_support2.markLineThresh(1.0);\n}\n\nfloat Gameplay::Plays::BasicOffense122::score ( Gameplay::GameplayModule* gameplay )\n{\n\t\/\/ only run if we are playing and not in a restart\n\tbool refApplicable = gameplay->state()->gameState.playing();\n\treturn refApplicable ? 0 : INFINITY;\n}\n\nbool Gameplay::Plays::BasicOffense122::run()\n{\n\t\/\/ handle assignments\n\tset<OurRobot *> available = _gameplay->playRobots();\n\n\t\/\/ project the ball forward (dampened)\n\tconst float proj_time = 0.75; \/\/ seconds to project\n\tconst float dampen_factor = 0.9; \/\/ accounts for slowing over time\n\tGeometry2d::Point ballProj = ball().pos + ball().vel * proj_time * dampen_factor;\n\n\t\/\/ Get a striker first to ensure there a robot that can kick\n\tassignNearestKicker(_striker.robot, available, ballProj);\n\n\t\/\/ defense first - get closest to goal to choose sides properly\n\tassignNearest(_leftFullback.robot, available, Geometry2d::Point(-Field_GoalWidth\/2, 0.0));\n\tassignNearest(_rightFullback.robot, available, Geometry2d::Point(Field_GoalWidth\/2, 0.0));\n\n\t\/\/ choose offense, we want closest robot to ball to be striker\n\tassignNearest(_support1.robot, available, ballProj);\n\tif (_support1.robot)\n\t\t_support1.robot->addText(\"Support 1\");\n\tassignNearest(_support2.robot, available, ballProj);\n\tif (_support2.robot)\n\t\t_support2.robot->addText(\"Support 2\");\n\n\t\/\/ determine whether to change offense players\n\tbool forward_reset = false;\n\tif (_striker.robot && _support1.robot && _support2.robot &&\n\t\t\t(_support1.robot->pos.distTo(ballProj) < *_offense_hysteresis * _striker.robot->pos.distTo(ballProj)\n\t\t\t\t|| _support2.robot->pos.distTo(ballProj) < *_offense_hysteresis * _striker.robot->pos.distTo(ballProj))) {\n\t\t_striker.robot = NULL;\n\t\t_support1.robot = NULL;\n\t\t_support2.robot = NULL;\n\t\t_striker.restart();\n\t\tforward_reset = true;\n\t}\n\n\t\/\/ find the nearest opponent to the striker\n\tOpponentRobot* closestRobotToStriker = 0;\n\tfloat closestDistToStriker = numeric_limits<float>::infinity();\n\tif (_striker.robot) {\n\t\tBOOST_FOREACH(OpponentRobot* opp, state()->opp) {\n\t\t\tif (opp) {\n\t\t\t\tfloat d = opp->pos.distTo(_striker.robot->pos);\n\t\t\t\tif (d < closestDistToStriker) {\n\t\t\t\t\tclosestDistToStriker = d;\n\t\t\t\t\tclosestRobotToStriker = opp;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\tbool striker_engaged = _striker.robot && closestDistToStriker < *_support_backoff_thresh;\n\n\t\/\/ pick as a mark target the furthest back opposing robot\n\t\/\/ and adjust mark ratio based on field position\n\t\/\/ find *two* furthest back opp robots\n\tOpponentRobot* bestOpp1 = NULL, *bestOpp2 = NULL;\n\tfloat bestDist1 = numeric_limits<float>::infinity(), bestDist2 = bestDist1;\n\tsize_t nrOppClose = 0;\n\tBOOST_FOREACH(OpponentRobot* opp, state()->opp)\n\t{\n\t\t\/\/ use distance from goal rather than just y coordinate to handle corners better\n\t\tconst float oppDistSq = opp->pos.magsq();\n\t\tif (opp && opp->visible &&\n\t\t\t\t oppDistSq > 0.1 &&\n\t\t\t\t !(striker_engaged && opp == closestRobotToStriker)\n\t\t\t\t ) {\n\t\t\tif (oppDistSq <= bestDist1) {\n\t\t\t\tbestDist2 = bestDist1;\n\t\t\t\tbestDist1 = oppDistSq;\n\t\t\t\tbestOpp2 = bestOpp1;\n\t\t\t\tbestOpp1 = opp;\n\t\t\t} else if (oppDistSq <= bestDist2) {\n\t\t\t\tbestDist2 = oppDistSq;\n\t\t\t\tbestOpp2 = opp;\n\t\t\t}\n\n\t\t\tif (oppDistSq < Field_Length * Field_Length \/ 4.0) {\n\t\t\t\t++nrOppClose;\n\t\t\t}\n\t\t}\n\t}\n\tif (!bestOpp1 && _support1.robot) {\n\t\t_support1.robot->addText(\"No mark target\");\n\t\tif(_striker.robot){\n\t\t\t\/\/ if nothing to mark, hang behind the striker on other side of the field\n\t\t\t_support1.robot->addText(\"Static Support\");\n\t\t\tPoint support_goal = _striker.robot->pos;\n\t\t\tsupport_goal.x *= -1.0;\n\t\t\tif (fabs(support_goal.x) < 0.2)\n\t\t\t{\n\t\t\t\tsupport_goal.x = (support_goal.x < 0.0) ? -1.0 : 1.0;\n\t\t\t}\n\n\t\t\tif (ballProj.y > Field_Length\/2.0 && nrOppClose)\n\t\t\t\tsupport_goal.y = max(support_goal.y * (double)*_offense_support_ratio, 0.3);\n\t\t\telse\n\t\t\t\tsupport_goal.y = max(support_goal.y * (double)*_defense_support_ratio, 0.3);\n\n\t\t\t_support1.robot->move(support_goal);\n\t\t\t_support1.robot->face(ballProj);\n\t\t}\n\t}\n\tif (!bestOpp2 && _support2.robot) {\n\t\t_support2.robot->addText(\"No mark target\");\n\t\t\/\/TODO: something useful like wait for a rebound kick\n\t}\n\tbool marking_active_1 = bestOpp1 != 0;\n\tbool marking_active_2 = bestOpp2 != 0;\n\n\t\/\/ use hysteresis for changing of the robot\n\tfloat cur_dist1 = (_support1.markRobot()) ?\t_support1.markRobot()->pos.distTo(ballProj) : numeric_limits<float>::infinity();\n\tfloat cur_dist2 = (_support2.markRobot()) ?\t_support2.markRobot()->pos.distTo(ballProj) : numeric_limits<float>::infinity();\n\tif (bestOpp1 && bestOpp1->visible && (forward_reset || bestDist1 < cur_dist1 * cur_dist1 * (float)*_mark_hysteresis_coeff))\n\t\t_support1.markRobot(bestOpp1);\n\tif (bestOpp2 && bestOpp2->visible && (forward_reset || bestDist2 < cur_dist2 * cur_dist2 * (float)*_mark_hysteresis_coeff))\n\t\t_support2.markRobot(bestOpp2);\n\n\t\/\/ if we are further away, we can mark further from robot\n\tif (ballProj.y > Field_Length\/2.0 && nrOppClose) {\n\t\t_support1.ratio(*_offense_support_ratio);\n\t\t_support2.ratio(*_offense_support_ratio);\n\t}\n\telse {\n\t\t_support1.ratio(*_defense_support_ratio);\n\t\t_support2.ratio(*_defense_support_ratio);\n\t}\n\n\t\/\/ adjust obstacles on striker and support\n\tif (_striker.robot) {\n\t\tunsigned striker = _striker.robot->shell();\n\t\tif (_support1.robot)\n\t\t\t_support1.robot->avoidTeammateRadius(striker, *_support_avoid_teammate_radius);\n\t\tif (_support2.robot)\n\t\t\t_support2.robot->avoidTeammateRadius(striker, *_support_avoid_teammate_radius);\n\n\t\t\/\/ get out of ways of shots\n\t\tif (_striker.robot->pos.nearPoint(ballProj, *_support_avoid_shot)) {\n\t\t\tPolygon shot_obs;\n\t\t\tshot_obs.vertices.push_back(Geometry2d::Point(Field_GoalWidth \/ 2, Field_Length));\n\t\t\tshot_obs.vertices.push_back(Geometry2d::Point(-Field_GoalWidth \/ 2, Field_Length));\n\t\t\tshot_obs.vertices.push_back(ballProj);\n\t\t\tif(_support1.robot)\n\t\t\t\t_support1.robot->localObstacles(ObstaclePtr(new PolygonObstacle(shot_obs)));\n\t\t\tif(_support2.robot)\n\t\t\t\t_support2.robot->localObstacles(ObstaclePtr(new PolygonObstacle(shot_obs)));\n\t\t}\n\t}\n\n\t\/\/ manually reset any kickers so they keep kicking\n\tif (_striker.done())\n\t\t_striker.restart();\n\n\t\/\/ set flags for inner behaviors\n\t_striker.use_line_kick = *_use_line_kick;\n\tif (_striker.robot)\n\t{\n\t\t_striker.calculateChipPower(_striker.robot->pos.distTo(ball().pos));\n\t}\n\n\t\/\/ execute behaviors\n\tif (_striker.robot) _striker.run();\n\tif (marking_active_1 && _support1.robot) _support1.run();\n\tif (marking_active_2 && _support2.robot) _support2.run();\n\tif (_leftFullback.robot) _leftFullback.run();\n\tif (_rightFullback.robot) _rightFullback.run();\n\n\treturn true;\n}\n<|endoftext|>"} {"text":"<commit_before>\/**\n * @file\n * @author Jason Lingle\n * @date 2012.02.04\n * @brief Implementation of NetworkConnection class\n *\/\n\n#include <iostream>\n#include <cstdlib>\n#include <cassert>\n#include <algorithm>\n\n#include <SDL.h>\n\n#include \"network_connection.hxx\"\n#include \"network_assembly.hxx\"\n#include \"network_geraet.hxx\"\n#include \"antenna.hxx\"\n#include \"tuner.hxx\"\n#include \"io.hxx\"\n#include \"synchronous_control_geraet.hxx\"\n#include \"async_ack_geraet.hxx\"\n#include \"lat_disc_geraet.hxx\"\n\n#include \"xxx\/xnetobj.hxx\"\n\n#include \"src\/sim\/game_field.hxx\"\n#include \"src\/sim\/game_object.hxx\"\n#include \"src\/core\/lxn.hxx\"\n#include \"src\/exit_conditions.hxx\"\n\nusing namespace std;\n\n\/* How long to wait without hearing any response before\n * killing the connection.\n *\/\n#define DISCONNECT_TIME 2048\n\n\/* Maximum distance between reference and transient where we\n * still export that transient.\n *\/\n#define TRANSIENT_DIST 7.0f\n\nNetworkConnection::geraetNumMap_t* NetworkConnection::geraetNumMap;\n\nNetworkConnection::NetworkConnection(NetworkAssembly* assembly_,\n const Antenna::endpoint& endpoint_,\n bool incomming)\n: field(assembly_->field->width, assembly_->field->height),\n nextOutSeq(incomming? 0 : 1),\n greatestSeq(0),\n latency(128),\n lastIncommingTime(SDL_GetTicks()),\n status(incomming? Established : Connecting),\n timeSinceRetriedTransients(0),\n endpoint(endpoint_),\n parent(assembly_),\n scg(new SynchronousControlGeraet(this, incomming)),\n aag(new AsyncAckGeraet(this)),\n ldg(new LatDiscGeraet(this))\n{\n inchannels[0] = scg;\n outchannels[0] = scg;\n\n if (incomming)\n scg->transmitAck(0);\n\n \/\/Open standard channels\n scg->openChannel(aag, aag->num);\n scg->openChannel(ldg, ldg->num);\n\n parent->getTuner()->connect(endpoint, this);\n}\n\nNetworkConnection::~NetworkConnection() {\n parent->getTuner()->disconnect(endpoint);\n\n for (inchannels_t::const_iterator it = inchannels.begin();\n it != inchannels.end(); ++it)\n if (it->second->deletionStrategy != InputNetworkGeraet::DSIntrinsic)\n delete it->second;\n for (outchannels_t::const_iterator it = outchannels.begin();\n it != outchannels.end(); ++it)\n if (it->second->deletionStrategy == OutputNetworkGeraet::DSNormal)\n delete it->second;\n\n delete aag;\n delete scg;\n}\n\nvoid NetworkConnection::update(unsigned et) noth {\n field.update(et);\n for (inchannels_t::const_iterator it = inchannels.begin();\n it != inchannels.end(); ++it)\n it->second->inputUpdate(et);\n for (outchannels_t::const_iterator it = outchannels.begin();\n it != outchannels.end(); ++it)\n it->second->update(et);\n\n \/\/TODO: Only process objects if in Ready status\n timeSinceRetriedTransients += et;\n if (timeSinceRetriedTransients > 128) {\n candidateExports.insert(candidateExports.end(),\n ignoredExports.begin(),\n ignoredExports.end());\n ignoredExports.clear();\n timeSinceRetriedTransients = 0;\n }\n \/\/Export candidates that are close enough or non-transient\n while (!candidateExports.empty()) {\n GameObject* go = candidateExports.front();\n candidateExports.pop_front();\n if (!go->isTransient || distanceOf(go) < TRANSIENT_DIST*TRANSIENT_DIST) {\n actualExports.insert(go);\n createObjectExport(this, go);\n } else {\n ignoredExports.insert(go);\n }\n }\n\n if (lastIncommingTime + DISCONNECT_TIME < SDL_GetTicks()) {\n scg->closeConnection(\"Timed out\", \"timed_out\");\n }\n}\n\nvoid NetworkConnection::process(const Antenna::endpoint& source,\n Antenna* antenna, Tuner* tuner,\n const byte* data, unsigned datlen)\nnoth {\n if (datlen < 4) {\n \/\/Packet does not even have a header\n #ifdef DEBUG\n cerr << \"Warning: Dropping packet of length \" << datlen\n << \" from source \" << source << endl;\n #endif\n return;\n }\n\n channel chan;\n seq_t seq;\n io::read(data, seq);\n io::read(data, chan);\n datlen -= 4;\n cout << \"Receive seq=\" << seq << \" on chan=\" << chan\n << \" with length=\" << datlen << \" from \" << source << endl;\n\n \/\/Range check\n if (seq-greatestSeq < 1024 || greatestSeq-seq < 1024) {\n \/\/Dupe check\n if (recentlyReceived.count(seq) == 0) {\n \/\/Possibly update greatestSeq\n if (seq-greatestSeq < 1024)\n greatestSeq = seq;\n\n \/\/OK, add to set and queue, possibly trim both\n recentlyReceived.insert(seq);\n recentlyReceivedQueue.push_back(seq);\n if (recentlyReceivedQueue.size() > 1024) {\n recentlyReceived.erase(recentlyReceivedQueue.front());\n recentlyReceivedQueue.pop_front();\n }\n\n \/\/Update time of most recent receive\n lastIncommingTime = SDL_GetTicks();\n\n \/\/Accept packet; does the channel exist?\n inchannels_t::const_iterator it = inchannels.find(chan);\n if (it != inchannels.end()) {\n it->second->receive(seq, data, datlen);\n } else {\n #ifdef DEBUG\n cerr << \"Warning: Dropping packet to closed channel \" << chan\n << \" from source \" << source << endl;\n #endif\n }\n }\n } else {\n #ifdef DEBUG\n cerr << \"Warning: Dropping packet of seq \" << seq\n << \" due to range check; greatestSeq = \" << greatestSeq\n << \"; from source \" << source << endl;\n #endif\n }\n}\n\nNetworkConnection::seq_t NetworkConnection::seq() noth {\n \/\/Check for network collapse\n if (locked[nextOutSeq]) {\n \/\/Kill the connection\n \/\/First, unlock everything so infinite recursion does not result\n locked.reset();\n scg->closeConnection(\"Network collapse\", \"network_collapse\");\n }\n return nextOutSeq++;\n}\n\nNetworkConnection::seq_t NetworkConnection::writeHeader(byte*& dst,\n channel chan)\nnoth {\n seq_t s = seq();\n io::write(dst, s);\n io::write(dst, chan);\n return s;\n}\n\nvoid NetworkConnection::send(const byte* data, unsigned len) throw() {\n try {\n parent->antenna->send(endpoint, data, len);\n } catch (asio::system_error e) {\n cerr << \"Network system error: \" << e.what() << endl;\n status = Zombie;\n SL10N(disconnectReason, network, system_error);\n }\n}\n\nNetworkConnection::geraet_num\nNetworkConnection::registerGeraetCreator(geraet_creator fun,\n geraet_num preferred) {\n static bool hasInitialised = false;\n static geraet_num nextAuto = 32768;\n \/\/Allocate map if not done yet\n if (!hasInitialised) {\n geraetNumMap = new geraetNumMap_t;\n hasInitialised = true;\n }\n\n geraet_num number = preferred;\n\n if (number == (geraet_num)~(geraet_num)0)\n number = nextAuto++;\n\n if (geraetNumMap->count(number)) {\n cerr << \"FATAL: Duplicate Geraet number: \" << number << endl;\n exit(EXIT_PROGRAM_BUG);\n }\n\n geraetNumMap->insert(make_pair(number, fun));\n return number;\n}\n\nNetworkConnection::geraet_creator\nNetworkConnection::getGeraetCreator(geraet_num num) {\n assert(geraetNumMap->count(num));\n return (*geraetNumMap)[num];\n}\n\nvoid NetworkConnection::setReference(GameObject* go) throw() {\n remoteReferences.push_back(go);\n}\n\nvoid NetworkConnection::unsetReference(GameObject* go) throw() {\n vector<GameObject*>::iterator it =\n find(remoteReferences.begin(), remoteReferences.end(), go);\n if (it != remoteReferences.end())\n remoteReferences.erase(it);\n}\n\nfloat NetworkConnection::distanceOf(const GameObject* go) const throw() {\n float mindist = INFINITY;\n for (unsigned i=0; i<remoteReferences.size(); ++i) {\n const GameObject* that = remoteReferences[i];\n float dx = go->getX() - that->getX();\n float dy = go->getY() - that->getY();\n float d = dx*dx + dy*dy;\n if (d < mindist)\n mindist = d;\n }\n return mindist;\n}\n\nvoid NetworkConnection::objectAdded(GameObject* go) throw() {\n candidateExports.push_back(go);\n}\n\nvoid NetworkConnection::objectRemoved(GameObject* go) throw() {\n deque<GameObject*>::iterator dit =\n find(candidateExports.begin(), candidateExports.end(), go);\n if (dit != candidateExports.end())\n candidateExports.erase(dit);\n\n actualExports.erase(go);\n ignoredExports.erase(go);\n unsetReference(go);\n}\n<commit_msg>Fix NetworkConnection leaking LatDiscGeraete.<commit_after>\/**\n * @file\n * @author Jason Lingle\n * @date 2012.02.04\n * @brief Implementation of NetworkConnection class\n *\/\n\n#include <iostream>\n#include <cstdlib>\n#include <cassert>\n#include <algorithm>\n\n#include <SDL.h>\n\n#include \"network_connection.hxx\"\n#include \"network_assembly.hxx\"\n#include \"network_geraet.hxx\"\n#include \"antenna.hxx\"\n#include \"tuner.hxx\"\n#include \"io.hxx\"\n#include \"synchronous_control_geraet.hxx\"\n#include \"async_ack_geraet.hxx\"\n#include \"lat_disc_geraet.hxx\"\n\n#include \"xxx\/xnetobj.hxx\"\n\n#include \"src\/sim\/game_field.hxx\"\n#include \"src\/sim\/game_object.hxx\"\n#include \"src\/core\/lxn.hxx\"\n#include \"src\/exit_conditions.hxx\"\n\nusing namespace std;\n\n\/* How long to wait without hearing any response before\n * killing the connection.\n *\/\n#define DISCONNECT_TIME 2048\n\n\/* Maximum distance between reference and transient where we\n * still export that transient.\n *\/\n#define TRANSIENT_DIST 7.0f\n\nNetworkConnection::geraetNumMap_t* NetworkConnection::geraetNumMap;\n\nNetworkConnection::NetworkConnection(NetworkAssembly* assembly_,\n const Antenna::endpoint& endpoint_,\n bool incomming)\n: field(assembly_->field->width, assembly_->field->height),\n nextOutSeq(incomming? 0 : 1),\n greatestSeq(0),\n latency(128),\n lastIncommingTime(SDL_GetTicks()),\n status(incomming? Established : Connecting),\n timeSinceRetriedTransients(0),\n endpoint(endpoint_),\n parent(assembly_),\n scg(new SynchronousControlGeraet(this, incomming)),\n aag(new AsyncAckGeraet(this)),\n ldg(new LatDiscGeraet(this))\n{\n inchannels[0] = scg;\n outchannels[0] = scg;\n\n if (incomming)\n scg->transmitAck(0);\n\n \/\/Open standard channels\n scg->openChannel(aag, aag->num);\n scg->openChannel(ldg, ldg->num);\n\n parent->getTuner()->connect(endpoint, this);\n}\n\nNetworkConnection::~NetworkConnection() {\n parent->getTuner()->disconnect(endpoint);\n\n for (inchannels_t::const_iterator it = inchannels.begin();\n it != inchannels.end(); ++it)\n if (it->second->deletionStrategy != InputNetworkGeraet::DSIntrinsic)\n delete it->second;\n for (outchannels_t::const_iterator it = outchannels.begin();\n it != outchannels.end(); ++it)\n if (it->second->deletionStrategy == OutputNetworkGeraet::DSNormal)\n delete it->second;\n\n delete aag;\n delete scg;\n delete ldg;\n}\n\nvoid NetworkConnection::update(unsigned et) noth {\n field.update(et);\n for (inchannels_t::const_iterator it = inchannels.begin();\n it != inchannels.end(); ++it)\n it->second->inputUpdate(et);\n for (outchannels_t::const_iterator it = outchannels.begin();\n it != outchannels.end(); ++it)\n it->second->update(et);\n\n \/\/TODO: Only process objects if in Ready status\n timeSinceRetriedTransients += et;\n if (timeSinceRetriedTransients > 128) {\n candidateExports.insert(candidateExports.end(),\n ignoredExports.begin(),\n ignoredExports.end());\n ignoredExports.clear();\n timeSinceRetriedTransients = 0;\n }\n \/\/Export candidates that are close enough or non-transient\n while (!candidateExports.empty()) {\n GameObject* go = candidateExports.front();\n candidateExports.pop_front();\n if (!go->isTransient || distanceOf(go) < TRANSIENT_DIST*TRANSIENT_DIST) {\n actualExports.insert(go);\n createObjectExport(this, go);\n } else {\n ignoredExports.insert(go);\n }\n }\n\n if (lastIncommingTime + DISCONNECT_TIME < SDL_GetTicks()) {\n scg->closeConnection(\"Timed out\", \"timed_out\");\n }\n}\n\nvoid NetworkConnection::process(const Antenna::endpoint& source,\n Antenna* antenna, Tuner* tuner,\n const byte* data, unsigned datlen)\nnoth {\n if (datlen < 4) {\n \/\/Packet does not even have a header\n #ifdef DEBUG\n cerr << \"Warning: Dropping packet of length \" << datlen\n << \" from source \" << source << endl;\n #endif\n return;\n }\n\n channel chan;\n seq_t seq;\n io::read(data, seq);\n io::read(data, chan);\n datlen -= 4;\n \/\/Suppress messages from channel 1 since it is not interesting\n if (chan != 1)\n cout << \"Receive seq=\" << seq << \" on chan=\" << chan\n << \" with length=\" << datlen << \" from \" << source\n << \" (latency=\" << latency << \" ms)\" << endl;\n\n \/\/Range check\n if (seq-greatestSeq < 1024 || greatestSeq-seq < 1024) {\n \/\/Dupe check\n if (recentlyReceived.count(seq) == 0) {\n \/\/Possibly update greatestSeq\n if (seq-greatestSeq < 1024)\n greatestSeq = seq;\n\n \/\/OK, add to set and queue, possibly trim both\n recentlyReceived.insert(seq);\n recentlyReceivedQueue.push_back(seq);\n if (recentlyReceivedQueue.size() > 1024) {\n recentlyReceived.erase(recentlyReceivedQueue.front());\n recentlyReceivedQueue.pop_front();\n }\n\n \/\/Update time of most recent receive\n lastIncommingTime = SDL_GetTicks();\n\n \/\/Accept packet; does the channel exist?\n inchannels_t::const_iterator it = inchannels.find(chan);\n if (it != inchannels.end()) {\n it->second->receive(seq, data, datlen);\n } else {\n #ifdef DEBUG\n cerr << \"Warning: Dropping packet to closed channel \" << chan\n << \" from source \" << source << endl;\n #endif\n }\n }\n } else {\n #ifdef DEBUG\n cerr << \"Warning: Dropping packet of seq \" << seq\n << \" due to range check; greatestSeq = \" << greatestSeq\n << \"; from source \" << source << endl;\n #endif\n }\n}\n\nNetworkConnection::seq_t NetworkConnection::seq() noth {\n \/\/Check for network collapse\n if (locked[nextOutSeq]) {\n \/\/Kill the connection\n \/\/First, unlock everything so infinite recursion does not result\n locked.reset();\n scg->closeConnection(\"Network collapse\", \"network_collapse\");\n }\n return nextOutSeq++;\n}\n\nNetworkConnection::seq_t NetworkConnection::writeHeader(byte*& dst,\n channel chan)\nnoth {\n seq_t s = seq();\n io::write(dst, s);\n io::write(dst, chan);\n return s;\n}\n\nvoid NetworkConnection::send(const byte* data, unsigned len) throw() {\n try {\n parent->antenna->send(endpoint, data, len);\n } catch (asio::system_error e) {\n cerr << \"Network system error: \" << e.what() << endl;\n status = Zombie;\n SL10N(disconnectReason, network, system_error);\n }\n}\n\nNetworkConnection::geraet_num\nNetworkConnection::registerGeraetCreator(geraet_creator fun,\n geraet_num preferred) {\n static bool hasInitialised = false;\n static geraet_num nextAuto = 32768;\n \/\/Allocate map if not done yet\n if (!hasInitialised) {\n geraetNumMap = new geraetNumMap_t;\n hasInitialised = true;\n }\n\n geraet_num number = preferred;\n\n if (number == (geraet_num)~(geraet_num)0)\n number = nextAuto++;\n\n if (geraetNumMap->count(number)) {\n cerr << \"FATAL: Duplicate Geraet number: \" << number << endl;\n exit(EXIT_PROGRAM_BUG);\n }\n\n geraetNumMap->insert(make_pair(number, fun));\n return number;\n}\n\nNetworkConnection::geraet_creator\nNetworkConnection::getGeraetCreator(geraet_num num) {\n assert(geraetNumMap->count(num));\n return (*geraetNumMap)[num];\n}\n\nvoid NetworkConnection::setReference(GameObject* go) throw() {\n remoteReferences.push_back(go);\n}\n\nvoid NetworkConnection::unsetReference(GameObject* go) throw() {\n vector<GameObject*>::iterator it =\n find(remoteReferences.begin(), remoteReferences.end(), go);\n if (it != remoteReferences.end())\n remoteReferences.erase(it);\n}\n\nfloat NetworkConnection::distanceOf(const GameObject* go) const throw() {\n float mindist = INFINITY;\n for (unsigned i=0; i<remoteReferences.size(); ++i) {\n const GameObject* that = remoteReferences[i];\n float dx = go->getX() - that->getX();\n float dy = go->getY() - that->getY();\n float d = dx*dx + dy*dy;\n if (d < mindist)\n mindist = d;\n }\n return mindist;\n}\n\nvoid NetworkConnection::objectAdded(GameObject* go) throw() {\n candidateExports.push_back(go);\n}\n\nvoid NetworkConnection::objectRemoved(GameObject* go) throw() {\n deque<GameObject*>::iterator dit =\n find(candidateExports.begin(), candidateExports.end(), go);\n if (dit != candidateExports.end())\n candidateExports.erase(dit);\n\n actualExports.erase(go);\n ignoredExports.erase(go);\n unsetReference(go);\n}\n<|endoftext|>"} {"text":"<commit_before>\/\/\n\/\/ Copyright (c) 2012 Kim Walisch, <kim.walisch@gmail.com>.\n\/\/ All rights reserved.\n\/\/\n\/\/ This file is part of primesieve.\n\/\/ Homepage: http:\/\/primesieve.googlecode.com\n\/\/\n\/\/ Redistribution and use in source and binary forms, with or without\n\/\/ modification, are permitted provided that the following conditions\n\/\/ are met:\n\/\/\n\/\/ * Redistributions of source code must retain the above copyright\n\/\/ notice, this list of conditions and the following disclaimer.\n\/\/ * Redistributions in binary form must reproduce the above\n\/\/ copyright notice, this list of conditions and the following\n\/\/ disclaimer in the documentation and\/or other materials provided\n\/\/ with the distribution.\n\/\/ * Neither the name of the author nor the names of its\n\/\/ contributors may be used to endorse or promote products derived\n\/\/ from this software without specific prior written permission.\n\/\/\n\/\/ THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS\n\/\/ \"AS IS\" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT\n\/\/ LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS\n\/\/ FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE\n\/\/ COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT,\n\/\/ INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES\n\/\/ (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR\n\/\/ SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)\n\/\/ HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT,\n\/\/ STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)\n\/\/ ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED\n\/\/ OF THE POSSIBILITY OF SUCH DAMAGE.\n\n#include \"PrimeNumberFinder.h\"\n#include \"PrimeSieve.h\"\n#include \"SieveOfEratosthenes.h\"\n#include \"config.h\"\n#include \"bithacks.h\"\n\n#include <stdint.h>\n#include <algorithm>\n#include <cstdlib>\n#include <iostream>\n#include <sstream>\n\n#if defined(_OPENMP)\n #include <omp.h>\n#endif\n\nnamespace soe {\n\n\/\/\/ Bit patterns corresponding to prime k-tuplets\n\/\/\/ within bytes of the sieve array.\nconst uint32_t PrimeNumberFinder::kTupletBitmasks_[6][5] =\n{\n { 0x06, 0x18, 0xc0, END }, \/\/ Twin primes\n { 0x07, 0x0e, 0x1c, 0x38, END }, \/\/ Prime triplets\n { 0x1e, END }, \/\/ Prime quadruplets\n { 0x1f, 0x3e, END }, \/\/ Prime quintuplets\n { 0x3f, END }, \/\/ Prime sextuplets\n { 0xfe, END } \/\/ Prime septuplets\n};\n\nPrimeNumberFinder::PrimeNumberFinder(PrimeSieve& ps) :\n SieveOfEratosthenes(\n std::max<uint64_t>(7, ps.getStart()),\n ps.getStop(),\n ps.getPreSieveLimit(),\n ps.getSieveSize()),\n ps_(ps),\n kTupletByteCounts_(NULL)\n{\n static_assert(PrimeSieve::COUNTS_SIZE == 7, \"PrimeSieve::COUNTS_SIZE == 7\");\n if (ps_.testFlags(ps_.COUNT_KTUPLETS))\n initLookupTables();\n}\n\nPrimeNumberFinder::~PrimeNumberFinder() {\n if (kTupletByteCounts_ != NULL) {\n for (int i = 0; i < 6; i++)\n delete[] kTupletByteCounts_[i];\n delete[] kTupletByteCounts_;\n }\n}\n\n\/**\n * Check if PrimeNumberFinder requires a PrimeNumberGenerator\n * object to generate its sieving primes.\n *\/\nbool PrimeNumberFinder::needGenerator() const {\n return getPreSieveLimit() < getSquareRoot();\n}\n\n\/**\n * Initialize the lookup tables needed to count prime k-tuplets\n * (twin primes, prime triplets, ...) per byte.\n *\/\nvoid PrimeNumberFinder::initLookupTables() {\n kTupletByteCounts_ = new uint32_t*[6];\n for (uint32_t i = 0; i < 6; i++) {\n kTupletByteCounts_[i] = NULL;\n if (ps_.isFlag(ps_.COUNT_TWINS << i)) {\n kTupletByteCounts_[i] = new uint32_t[256];\n for (uint32_t j = 0; j < 256; j++) {\n uint32_t bitmaskCount = 0;\n for (const uint32_t* b = kTupletBitmasks_[i]; *b <= j; b++) {\n if ((j & *b) == *b)\n bitmaskCount++;\n }\n kTupletByteCounts_[i][j] = bitmaskCount;\n }\n }\n }\n}\n\n\/**\n * Generate\/count the primes and prime k-tuplets within the current\n * segment i.e. [segmentLow_+7, segmentHigh_].\n *\/\nvoid PrimeNumberFinder::analyseSieve(const uint8_t* sieve, uint32_t sieveSize) {\n if (ps_.testFlags(ps_.COUNT_FLAGS))\n count(sieve, sieveSize);\n if (ps_.testFlags(ps_.GENERATE_FLAGS))\n generate(sieve, sieveSize);\n if (ps_.isFlag(ps_.CALCULATE_STATUS))\n ps_()->calcStatus(sieveSize * NUMBERS_PER_BYTE);\n}\n\n\/**\n * Count the primes and prime k-tuplets within\n * the current segment.\n *\/\nvoid PrimeNumberFinder::count(const uint8_t* sieve, uint32_t sieveSize) {\n \/\/ count prime numbers (1 bits within the sieve array)\n if (ps_.isFlag(ps_.COUNT_PRIMES)) {\n const uint64_t* sieve64 = reinterpret_cast<const uint64_t*>(sieve);\n uint32_t sieveSize64 = sieveSize \/ 8;\n uint32_t bytesLeft = sieveSize % 8;\n \/\/ see bithacks.h\n uint32_t primeCount = popcount_lauradoux(sieve64, sieveSize64);\n if (bytesLeft > 0)\n primeCount += popcount_kernighan(&sieve[sieveSize - bytesLeft], bytesLeft);\n \/\/ add up to total prime count\n ps_.counts_[0] += primeCount;\n }\n \/\/ count prime k-tuplets (i=0 twins, i=1 triplets, ...)\n \/\/ using lookup tables\n for (uint32_t i = 0; i < 6; i++) {\n if (ps_.isFlag(ps_.COUNT_TWINS << i)) {\n uint32_t kCount = 0;\n for (uint32_t j = 0; j < sieveSize; j++)\n kCount += kTupletByteCounts_[i][sieve[j]];\n ps_.counts_[i+1] += kCount;\n }\n }\n}\n\n\/**\n * Generate the primes or prime k-tuplets (twin primes, prime\n * triplets, ...) within the current segment.\n *\/\nvoid PrimeNumberFinder::generate(const uint8_t* sieve, uint32_t sieveSize) {\n if (ps_.testFlags(ps_.PRINT_KTUPLETS)) {\n const uint64_t segmentLow = getSegmentLow();\n \/\/ i = 0 twins, i = 1 triplets, ...\n uint32_t i = 0;\n for (; !ps_.isFlag(ps_.PRINT_TWINS << i); i++)\n ;\n \/\/ print prime k-tuplets to std::cout\n for (uint32_t j = 0; j < sieveSize; j++) {\n for (const uint32_t* bitmask = kTupletBitmasks_[i]; *bitmask <= sieve[j]; bitmask++) {\n if ((sieve[j] & *bitmask) == *bitmask) {\n std::ostringstream kTuplet;\n kTuplet << \"(\";\n uint32_t bits = *bitmask;\n uint64_t offset = segmentLow + j * NUMBERS_PER_BYTE;\n for (; bits & (bits - 1); bits &= bits - 1)\n kTuplet << offset + getFirstSetBitValue(bits) << \", \";\n kTuplet << offset + getFirstSetBitValue(bits) << \")\\n\";\n std::cout << kTuplet.str();\n }\n }\n }\n }\n else\n#if defined(_OPENMP)\n #pragma omp critical (generate)\n#endif\n {\n \/\/ GENERATE_PRIMES() is defined in SieveOfEratosthenes.h\n if (ps_.isFlag(ps_.CALLBACK32_PRIMES)) GENERATE_PRIMES(ps_.callback32_, uint32_t)\n else if (ps_.isFlag(ps_.CALLBACK32_OOP_PRIMES)) GENERATE_PRIMES(callback32_OOP, uint32_t)\n else if (ps_.isFlag(ps_.CALLBACK64_PRIMES)) GENERATE_PRIMES(ps_.callback64_, uint64_t)\n else if (ps_.isFlag(ps_.CALLBACK64_OOP_PRIMES)) GENERATE_PRIMES(callback64_OOP, uint64_t)\n else if (ps_.isFlag(ps_.PRINT_PRIMES)) GENERATE_PRIMES(print, uint64_t)\n }\n}\n\nvoid PrimeNumberFinder::callback32_OOP(uint32_t prime) const {\n ps_.callback32_OOP_(prime, ps_.cbObj_);\n}\n\nvoid PrimeNumberFinder::callback64_OOP(uint64_t prime) const {\n ps_.callback64_OOP_(prime, ps_.cbObj_);\n}\n\nvoid PrimeNumberFinder::print(uint64_t prime) const {\n std::cout << prime << '\\n';\n}\n\n} \/\/ namespace soe\n<commit_msg>minor modification<commit_after>\/\/\n\/\/ Copyright (c) 2012 Kim Walisch, <kim.walisch@gmail.com>.\n\/\/ All rights reserved.\n\/\/\n\/\/ This file is part of primesieve.\n\/\/ Homepage: http:\/\/primesieve.googlecode.com\n\/\/\n\/\/ Redistribution and use in source and binary forms, with or without\n\/\/ modification, are permitted provided that the following conditions\n\/\/ are met:\n\/\/\n\/\/ * Redistributions of source code must retain the above copyright\n\/\/ notice, this list of conditions and the following disclaimer.\n\/\/ * Redistributions in binary form must reproduce the above\n\/\/ copyright notice, this list of conditions and the following\n\/\/ disclaimer in the documentation and\/or other materials provided\n\/\/ with the distribution.\n\/\/ * Neither the name of the author nor the names of its\n\/\/ contributors may be used to endorse or promote products derived\n\/\/ from this software without specific prior written permission.\n\/\/\n\/\/ THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS\n\/\/ \"AS IS\" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT\n\/\/ LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS\n\/\/ FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE\n\/\/ COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT,\n\/\/ INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES\n\/\/ (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR\n\/\/ SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)\n\/\/ HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT,\n\/\/ STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)\n\/\/ ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED\n\/\/ OF THE POSSIBILITY OF SUCH DAMAGE.\n\n#include \"PrimeNumberFinder.h\"\n#include \"PrimeSieve.h\"\n#include \"SieveOfEratosthenes.h\"\n#include \"config.h\"\n#include \"bithacks.h\"\n\n#include <stdint.h>\n#include <algorithm>\n#include <cstdlib>\n#include <iostream>\n#include <sstream>\n\n#if defined(_OPENMP)\n #include <omp.h>\n#endif\n\nnamespace soe {\n\n\/\/\/ Bit patterns corresponding to prime k-tuplets\n\/\/\/ within bytes of the sieve array.\nconst uint32_t PrimeNumberFinder::kTupletBitmasks_[6][5] =\n{\n { 0x06, 0x18, 0xc0, END }, \/\/ Twin primes\n { 0x07, 0x0e, 0x1c, 0x38, END }, \/\/ Prime triplets\n { 0x1e, END }, \/\/ Prime quadruplets\n { 0x1f, 0x3e, END }, \/\/ Prime quintuplets\n { 0x3f, END }, \/\/ Prime sextuplets\n { 0xfe, END } \/\/ Prime septuplets\n};\n\nPrimeNumberFinder::PrimeNumberFinder(PrimeSieve& ps) :\n SieveOfEratosthenes(\n std::max<uint64_t>(7, ps.getStart()),\n ps.getStop(),\n ps.getPreSieveLimit(),\n ps.getSieveSize()),\n ps_(ps),\n kTupletByteCounts_(NULL)\n{\n static_assert(PrimeSieve::COUNTS_SIZE == 7, \"PrimeSieve::COUNTS_SIZE == 7\");\n if (ps_.testFlags(ps_.COUNT_KTUPLETS))\n initLookupTables();\n}\n\nPrimeNumberFinder::~PrimeNumberFinder() {\n if (kTupletByteCounts_ != NULL) {\n for (int i = 0; i < 6; i++)\n delete[] kTupletByteCounts_[i];\n delete[] kTupletByteCounts_;\n }\n}\n\n\/**\n * Check if PrimeNumberFinder requires a PrimeNumberGenerator\n * object to generate its sieving primes.\n *\/\nbool PrimeNumberFinder::needGenerator() const {\n return getPreSieveLimit() < getSquareRoot();\n}\n\n\/**\n * Initialize the lookup tables needed to count prime k-tuplets\n * (twin primes, prime triplets, ...) per byte.\n *\/\nvoid PrimeNumberFinder::initLookupTables() {\n kTupletByteCounts_ = new uint32_t*[6];\n for (uint32_t i = 0; i < 6; i++) {\n kTupletByteCounts_[i] = NULL;\n if (ps_.isFlag(ps_.COUNT_TWINS << i)) {\n kTupletByteCounts_[i] = new uint32_t[256];\n for (uint32_t j = 0; j < 256; j++) {\n uint32_t bitmaskCount = 0;\n for (const uint32_t* b = kTupletBitmasks_[i]; *b <= j; b++) {\n if ((j & *b) == *b)\n bitmaskCount++;\n }\n kTupletByteCounts_[i][j] = bitmaskCount;\n }\n }\n }\n}\n\n\/**\n * Generate\/count the primes and prime k-tuplets within the current\n * segment i.e. [segmentLow_+7, segmentHigh_].\n *\/\nvoid PrimeNumberFinder::analyseSieve(const uint8_t* sieve, uint32_t sieveSize) {\n if (ps_.testFlags(ps_.COUNT_FLAGS))\n count(sieve, sieveSize);\n if (ps_.testFlags(ps_.GENERATE_FLAGS))\n generate(sieve, sieveSize);\n if (ps_.isFlag(ps_.CALCULATE_STATUS))\n ps_.calcStatus(sieveSize * NUMBERS_PER_BYTE);\n}\n\n\/**\n * Count the primes and prime k-tuplets within\n * the current segment.\n *\/\nvoid PrimeNumberFinder::count(const uint8_t* sieve, uint32_t sieveSize) {\n \/\/ count prime numbers (1 bits within the sieve array)\n if (ps_.isFlag(ps_.COUNT_PRIMES)) {\n const uint64_t* sieve64 = reinterpret_cast<const uint64_t*>(sieve);\n uint32_t sieveSize64 = sieveSize \/ 8;\n uint32_t bytesLeft = sieveSize % 8;\n \/\/ see bithacks.h\n uint32_t primeCount = popcount_lauradoux(sieve64, sieveSize64);\n if (bytesLeft > 0)\n primeCount += popcount_kernighan(&sieve[sieveSize - bytesLeft], bytesLeft);\n \/\/ add up to total prime count\n ps_.counts_[0] += primeCount;\n }\n \/\/ count prime k-tuplets (i=0 twins, i=1 triplets, ...)\n \/\/ using lookup tables\n for (uint32_t i = 0; i < 6; i++) {\n if (ps_.isFlag(ps_.COUNT_TWINS << i)) {\n uint32_t kCount = 0;\n for (uint32_t j = 0; j < sieveSize; j++)\n kCount += kTupletByteCounts_[i][sieve[j]];\n ps_.counts_[i+1] += kCount;\n }\n }\n}\n\n\/**\n * Generate the primes or prime k-tuplets (twin primes, prime\n * triplets, ...) within the current segment.\n *\/\nvoid PrimeNumberFinder::generate(const uint8_t* sieve, uint32_t sieveSize) {\n if (ps_.testFlags(ps_.PRINT_KTUPLETS)) {\n const uint64_t segmentLow = getSegmentLow();\n \/\/ i = 0 twins, i = 1 triplets, ...\n uint32_t i = 0;\n for (; !ps_.isFlag(ps_.PRINT_TWINS << i); i++)\n ;\n \/\/ print prime k-tuplets to std::cout\n for (uint32_t j = 0; j < sieveSize; j++) {\n for (const uint32_t* bitmask = kTupletBitmasks_[i]; *bitmask <= sieve[j]; bitmask++) {\n if ((sieve[j] & *bitmask) == *bitmask) {\n std::ostringstream kTuplet;\n kTuplet << \"(\";\n uint32_t bits = *bitmask;\n uint64_t offset = segmentLow + j * NUMBERS_PER_BYTE;\n for (; bits & (bits - 1); bits &= bits - 1)\n kTuplet << offset + getFirstSetBitValue(bits) << \", \";\n kTuplet << offset + getFirstSetBitValue(bits) << \")\\n\";\n std::cout << kTuplet.str();\n }\n }\n }\n }\n else\n#if defined(_OPENMP)\n #pragma omp critical (generate)\n#endif\n {\n \/\/ GENERATE_PRIMES() is defined in SieveOfEratosthenes.h\n if (ps_.isFlag(ps_.CALLBACK32_PRIMES)) GENERATE_PRIMES(ps_.callback32_, uint32_t)\n else if (ps_.isFlag(ps_.CALLBACK32_OOP_PRIMES)) GENERATE_PRIMES(callback32_OOP, uint32_t)\n else if (ps_.isFlag(ps_.CALLBACK64_PRIMES)) GENERATE_PRIMES(ps_.callback64_, uint64_t)\n else if (ps_.isFlag(ps_.CALLBACK64_OOP_PRIMES)) GENERATE_PRIMES(callback64_OOP, uint64_t)\n else if (ps_.isFlag(ps_.PRINT_PRIMES)) GENERATE_PRIMES(print, uint64_t)\n }\n}\n\nvoid PrimeNumberFinder::callback32_OOP(uint32_t prime) const {\n ps_.callback32_OOP_(prime, ps_.cbObj_);\n}\n\nvoid PrimeNumberFinder::callback64_OOP(uint64_t prime) const {\n ps_.callback64_OOP_(prime, ps_.cbObj_);\n}\n\nvoid PrimeNumberFinder::print(uint64_t prime) const {\n std::cout << prime << '\\n';\n}\n\n} \/\/ namespace soe\n<|endoftext|>"} {"text":"<commit_before>#include \"earth_shape.h\"\n#include \"himan_common.h\"\n\nusing namespace himan;\n\nearth_shape::earth_shape() : itsA(MissingDouble()), itsB(MissingDouble())\n{\n}\n\nearth_shape::earth_shape(double r) : itsA(r), itsB(r)\n{\n}\n\nearth_shape::earth_shape(double theA, double theB) : itsA(theA), itsB(theB)\n{\n}\n\nbool earth_shape::operator==(const earth_shape& other) const\n{\n\treturn (itsA == other.itsA && itsB == other.itsB);\n}\n\nbool earth_shape::operator!=(const earth_shape& other) const\n{\n return !(*this == other);\n}\n\ndouble earth_shape::A() const\n{\n\treturn itsA;\n}\n\nvoid earth_shape::A(double theA)\n{\n\titsA = theA;\n}\n\ndouble earth_shape::B() const\n{\n\treturn itsB;\n}\n\nvoid earth_shape::B(double theB)\n{\n\titsB = theB;\n}\n\ndouble earth_shape::F() const\n{\n\treturn (itsA - itsB) \/ itsA;\n}\n\nstd::ostream& himan::earth_shape::Write(std::ostream& file) const\n{\n file << \"<\" << ClassName() << \">\" << std::endl;\n file << \"__itsA__ \" << std::fixed << itsA << std::endl;\n file << \"__itsB__ \" << std::fixed << itsB << std::endl;\n\n return file;\n}\n\n<commit_msg>Modify operator== so that comparison between default constructed objects return true<commit_after>#include \"earth_shape.h\"\n#include \"himan_common.h\"\n\nusing namespace himan;\n\nearth_shape::earth_shape() : itsA(MissingDouble()), itsB(MissingDouble())\n{\n}\n\nearth_shape::earth_shape(double r) : itsA(r), itsB(r)\n{\n}\n\nearth_shape::earth_shape(double theA, double theB) : itsA(theA), itsB(theB)\n{\n}\n\nbool earth_shape::operator==(const earth_shape& other) const\n{\n\tif (itsA == other.itsA && itsB == other.itsB)\n\t{\n\t\treturn true;\n\t}\n\n\t\/\/ Check for missing values so that we can compare with default constructor\n\treturn ((IsMissing(itsA) && IsMissing(other.itsA)) && (IsMissing(itsB) && IsMissing(other.itsB)));\n}\n\nbool earth_shape::operator!=(const earth_shape& other) const\n{\n\treturn !(*this == other);\n}\n\ndouble earth_shape::A() const\n{\n\treturn itsA;\n}\n\nvoid earth_shape::A(double theA)\n{\n\titsA = theA;\n}\n\ndouble earth_shape::B() const\n{\n\treturn itsB;\n}\n\nvoid earth_shape::B(double theB)\n{\n\titsB = theB;\n}\n\ndouble earth_shape::F() const\n{\n\treturn (itsA - itsB) \/ itsA;\n}\n\nstd::ostream& himan::earth_shape::Write(std::ostream& file) const\n{\n\tfile << \"<\" << ClassName() << \">\" << std::endl;\n\tfile << \"__itsA__ \" << std::fixed << itsA << std::endl;\n\tfile << \"__itsB__ \" << std::fixed << itsB << std::endl;\n\n\treturn file;\n}\n<|endoftext|>"} {"text":"<commit_before>\/\/ @(#)root\/build:$Name: $:$Id: mainroot.cxx,v 1.2 2006\/03\/21 00:21:00 rdm Exp $\n\/\/ Author: Axel Naumann 21\/03\/06\n\n\/*************************************************************************\n * Copyright (C) 1995-2006, 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\nextern \"C\" {\n#if defined(__sun) && defined(__SUNPRO_CC)\n#include <signal.h>\n#endif\n#include \"def.h\"\n}\n\n#include <string>\n\nextern \"C\" int main_orig(int argc, char **argv);\nextern \"C\" int unlink (const char *FILENAME);\n\nint rootBuild = 0;\n\nint isDict = 0;\nint newFile = 0;\nstd::string currentDependencies;\nstd::string currentFileBase;\n\nextern \"C\"\nvoid ROOT_newFile()\n{\n newFile = 1;\n}\n\nvoid ROOT_flush()\n{\n if (!currentFileBase.empty()) {\n fwrite(\")\\n\", 2, 1, stdout); \/\/ closing \"$(wildcard\"\n bool haveOldNonDict = !isDict;\n if (haveOldNonDict) {\n currentFileBase += \"o\";\n fwrite(currentFileBase.c_str(), currentFileBase.length(), 1, stdout);\n currentDependencies += '\\n';\n fwrite(currentDependencies.c_str(), currentDependencies.length(), 1, stdout);\n }\n }\n currentFileBase.clear();\n currentDependencies.clear();\n}\n\nextern \"C\"\nvoid ROOT_adddep(char* buf, size_t len)\n{\n char* posColon = 0;\n if (newFile)\n posColon = strstr(buf, \".o: \");\n\n if (!posColon) {\n fwrite(buf, len, 1, stdout);\n currentDependencies += buf;\n return;\n }\n\n\/* isDict:\n sed -e 's@^\\(.*\\)\\.o[ :]*\\(.*\\)\\@\n \\1.d: $\\(wildcard \\2\\)\\@\\1.cxx: $\\(wildcard \\2\\)@' \n -e 's@^#.*$@@' \n -e '\/^$\/d'\n | tr '@' '\\n'\nelse\n sed -e 's@^\\(.*\\)\\.o[ :]*\\(.*\\)@\n \\1.d: $\\(wildcard \\2\\)\\@\\1.o: \\2@' \n -e 's@^#.*$@@' \n -e '\/^$\/d' $1.tmp \n | tr '@' '\\n'\n*\/\n \/\/ flush out the old dependencies\n ROOT_flush();\n\n newFile = 0;\n\n buf[0] = ' ';\n if (isDict) {\n posColon[1]=0;\n strcat(posColon, \"cxx\");\n fwrite(buf, (posColon - buf)+4, 1, stdout); \/\/ .cxx\n }\n\n posColon[1]='d';\n fwrite(buf, (posColon - buf)+2, 1, stdout); \/\/ .d\n\n if (!isDict) {\n posColon[1] = 0;\n currentFileBase = buf + 1;\n currentDependencies = posColon + 2;\n }\n fwrite(\": $(wildcard \", 13, 1, stdout);\n fwrite(posColon + 4, len - (posColon + 4 - buf), 1, stdout);\n}\n\nint main(int argc, char **argv)\n{\n if (argc<3 || strcmp(argv[1], \"-R\")) \n return main_orig(argc, argv);\n\n rootBuild = 1;\n int skip = 2;\n const char* outname = argv[2]+skip;\n while (outname[0] == ' ') outname = argv[2] + (++skip);\n if (outname)\n isDict = (strstr(outname, \"\/G__\") != 0 && strstr(outname, \".cxx\"));\n\n argv[1] = argv[0]; \/\/ keep program name\n int ret = main_orig(argc-1, &argv[1]);\n if (ret) {\n \/\/ delete output file\n unlink(outname);\n } else\n ROOT_flush();\n return ret;\n}\n<commit_msg>Fix a compilation problem on FreeBSD 6.1.<commit_after>\/\/ @(#)root\/build:$Name: $:$Id: mainroot.cxx,v 1.3 2006\/03\/23 14:00:18 rdm Exp $\n\/\/ Author: Axel Naumann 21\/03\/06\n\n\/*************************************************************************\n * Copyright (C) 1995-2006, 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 <string>\n\nextern \"C\" {\n#if defined(__sun) && defined(__SUNPRO_CC)\n#include <signal.h>\n#endif\n#include \"def.h\"\n}\n\nextern \"C\" int main_orig(int argc, char **argv);\nextern \"C\" int unlink (const char *FILENAME);\n\nint rootBuild = 0;\n\nint isDict = 0;\nint newFile = 0;\nstd::string currentDependencies;\nstd::string currentFileBase;\n\nextern \"C\"\nvoid ROOT_newFile()\n{\n newFile = 1;\n}\n\nvoid ROOT_flush()\n{\n if (!currentFileBase.empty()) {\n fwrite(\")\\n\", 2, 1, stdout); \/\/ closing \"$(wildcard\"\n bool haveOldNonDict = !isDict;\n if (haveOldNonDict) {\n currentFileBase += \"o\";\n fwrite(currentFileBase.c_str(), currentFileBase.length(), 1, stdout);\n currentDependencies += '\\n';\n fwrite(currentDependencies.c_str(), currentDependencies.length(), 1, stdout);\n }\n }\n currentFileBase.clear();\n currentDependencies.clear();\n}\n\nextern \"C\"\nvoid ROOT_adddep(char* buf, size_t len)\n{\n char* posColon = 0;\n if (newFile)\n posColon = strstr(buf, \".o: \");\n\n if (!posColon) {\n fwrite(buf, len, 1, stdout);\n currentDependencies += buf;\n return;\n }\n\n\/* isDict:\n sed -e 's@^\\(.*\\)\\.o[ :]*\\(.*\\)\\@\n \\1.d: $\\(wildcard \\2\\)\\@\\1.cxx: $\\(wildcard \\2\\)@'\n -e 's@^#.*$@@'\n -e '\/^$\/d'\n | tr '@' '\\n'\nelse\n sed -e 's@^\\(.*\\)\\.o[ :]*\\(.*\\)@\n \\1.d: $\\(wildcard \\2\\)\\@\\1.o: \\2@'\n -e 's@^#.*$@@'\n -e '\/^$\/d' $1.tmp\n | tr '@' '\\n'\n*\/\n \/\/ flush out the old dependencies\n ROOT_flush();\n\n newFile = 0;\n\n buf[0] = ' ';\n if (isDict) {\n posColon[1]=0;\n strcat(posColon, \"cxx\");\n fwrite(buf, (posColon - buf)+4, 1, stdout); \/\/ .cxx\n }\n\n posColon[1]='d';\n fwrite(buf, (posColon - buf)+2, 1, stdout); \/\/ .d\n\n if (!isDict) {\n posColon[1] = 0;\n currentFileBase = buf + 1;\n currentDependencies = posColon + 2;\n }\n fwrite(\": $(wildcard \", 13, 1, stdout);\n fwrite(posColon + 4, len - (posColon + 4 - buf), 1, stdout);\n}\n\nint main(int argc, char **argv)\n{\n if (argc<3 || strcmp(argv[1], \"-R\"))\n return main_orig(argc, argv);\n\n rootBuild = 1;\n int skip = 2;\n const char* outname = argv[2]+skip;\n while (outname[0] == ' ') outname = argv[2] + (++skip);\n if (outname)\n isDict = (strstr(outname, \"\/G__\") != 0 && strstr(outname, \".cxx\"));\n\n argv[1] = argv[0]; \/\/ keep program name\n int ret = main_orig(argc-1, &argv[1]);\n if (ret) {\n \/\/ delete output file\n unlink(outname);\n } else\n ROOT_flush();\n return ret;\n}\n<|endoftext|>"} {"text":"<commit_before>#include <cstdio>\n#include <cstring>\n#include <mosquittopp.h>\n\nvoid print_error(const char *topic, char **topics, int topic_count)\n{\n\tint i;\n\tprintf(\"TOPIC: %s\\n\", topic);\n\tprintf(\"TOKENS: \", topic);\n\tfor(i=0; i<topic_count; i++){\n\t\tprintf(\"%s\", topics[i]);\n\t\tif(i+1<topic_count){\n\t\t\tprintf(\"\/\");\n\t\t}\n\t}\n\tprintf(\"\\n\");\n}\n\nint main(int argc, char *argv[])\n{\n\tchar **topics;\n\tint topic_count;\n\n\tif(mosqpp::sub_topic_tokenise(\"topic\", &topics, &topic_count)){\n\t\tprintf(\"Out of memory.\\n\");\n\t\treturn 1;\n\t}\n\tif(topic_count != 1 || strcmp(topics[0], \"topic\")){\n\t\tprint_error(\"topic\", topics, topic_count);\n\t\treturn 1;\n\t}\n\n\tif(mosqpp::sub_topic_tokenise(\"a\/deep\/topic\/hierarchy\", &topics, &topic_count)){\n\t\tprintf(\"Out of memory.\\n\");\n\t\treturn 1;\n\t}\n\tif(topic_count != 4\n\t\t\t|| strcmp(topics[0], \"a\")\n\t\t\t|| strcmp(topics[1], \"deep\")\n\t\t\t|| strcmp(topics[2], \"topic\")\n\t\t\t|| strcmp(topics[3], \"hierarchy\")){\n\t\tprint_error(\"a\/deep\/topic\/hierarchy\", topics, topic_count);\n\t\treturn 1;\n\t}\n\n\tif(mosqpp::sub_topic_tokenise(\"\/a\/deep\/topic\/hierarchy\", &topics, &topic_count)){\n\t\tprintf(\"Out of memory.\\n\");\n\t\treturn 1;\n\t}\n\tif(topic_count != 5\n\t\t\t|| topics[0]\n\t\t\t|| strcmp(topics[1], \"a\")\n\t\t\t|| strcmp(topics[2], \"deep\")\n\t\t\t|| strcmp(topics[3], \"topic\")\n\t\t\t|| strcmp(topics[4], \"hierarchy\")){\n\t\tprint_error(\"\/a\/deep\/topic\/hierarchy\", topics, topic_count);\n\t\treturn 1;\n\t}\n\n\tif(mosqpp::sub_topic_tokenise(\"a\/b\/c\", &topics, &topic_count)){\n\t\tprintf(\"Out of memory.\\n\");\n\t\treturn 1;\n\t}\n\tif(topic_count != 3\n\t\t\t|| strcmp(topics[0], \"a\")\n\t\t\t|| strcmp(topics[1], \"b\")\n\t\t\t|| strcmp(topics[2], \"c\")){\n\t\tprint_error(\"a\/b\/c\", topics, topic_count);\n\t\treturn 1;\n\t}\n\n\tif(mosqpp::sub_topic_tokenise(\"\/a\/b\/c\", &topics, &topic_count)){\n\t\tprintf(\"Out of memory.\\n\");\n\t\treturn 1;\n\t}\n\tif(topic_count != 4\n\t\t\t|| topics[0]\n\t\t\t|| strcmp(topics[1], \"a\")\n\t\t\t|| strcmp(topics[2], \"b\")\n\t\t\t|| strcmp(topics[3], \"c\")){\n\t\tprint_error(\"\/a\/b\/c\", topics, topic_count);\n\t\treturn 1;\n\t}\n\treturn 0;\n}\n\n<commit_msg>Test compilation fix.<commit_after>#include <cstdio>\n#include <cstring>\n#include <mosquittopp.h>\n\nvoid print_error(const char *topic, char **topics, int topic_count)\n{\n\tint i;\n\tprintf(\"TOPIC: %s\\n\", topic);\n\tprintf(\"TOKENS: \");\n\tfor(i=0; i<topic_count; i++){\n\t\tprintf(\"%s\", topics[i]);\n\t\tif(i+1<topic_count){\n\t\t\tprintf(\"\/\");\n\t\t}\n\t}\n\tprintf(\"\\n\");\n}\n\nint main(int argc, char *argv[])\n{\n\tchar **topics;\n\tint topic_count;\n\n\tif(mosqpp::sub_topic_tokenise(\"topic\", &topics, &topic_count)){\n\t\tprintf(\"Out of memory.\\n\");\n\t\treturn 1;\n\t}\n\tif(topic_count != 1 || strcmp(topics[0], \"topic\")){\n\t\tprint_error(\"topic\", topics, topic_count);\n\t\treturn 1;\n\t}\n\n\tif(mosqpp::sub_topic_tokenise(\"a\/deep\/topic\/hierarchy\", &topics, &topic_count)){\n\t\tprintf(\"Out of memory.\\n\");\n\t\treturn 1;\n\t}\n\tif(topic_count != 4\n\t\t\t|| strcmp(topics[0], \"a\")\n\t\t\t|| strcmp(topics[1], \"deep\")\n\t\t\t|| strcmp(topics[2], \"topic\")\n\t\t\t|| strcmp(topics[3], \"hierarchy\")){\n\t\tprint_error(\"a\/deep\/topic\/hierarchy\", topics, topic_count);\n\t\treturn 1;\n\t}\n\n\tif(mosqpp::sub_topic_tokenise(\"\/a\/deep\/topic\/hierarchy\", &topics, &topic_count)){\n\t\tprintf(\"Out of memory.\\n\");\n\t\treturn 1;\n\t}\n\tif(topic_count != 5\n\t\t\t|| topics[0]\n\t\t\t|| strcmp(topics[1], \"a\")\n\t\t\t|| strcmp(topics[2], \"deep\")\n\t\t\t|| strcmp(topics[3], \"topic\")\n\t\t\t|| strcmp(topics[4], \"hierarchy\")){\n\t\tprint_error(\"\/a\/deep\/topic\/hierarchy\", topics, topic_count);\n\t\treturn 1;\n\t}\n\n\tif(mosqpp::sub_topic_tokenise(\"a\/b\/c\", &topics, &topic_count)){\n\t\tprintf(\"Out of memory.\\n\");\n\t\treturn 1;\n\t}\n\tif(topic_count != 3\n\t\t\t|| strcmp(topics[0], \"a\")\n\t\t\t|| strcmp(topics[1], \"b\")\n\t\t\t|| strcmp(topics[2], \"c\")){\n\t\tprint_error(\"a\/b\/c\", topics, topic_count);\n\t\treturn 1;\n\t}\n\n\tif(mosqpp::sub_topic_tokenise(\"\/a\/b\/c\", &topics, &topic_count)){\n\t\tprintf(\"Out of memory.\\n\");\n\t\treturn 1;\n\t}\n\tif(topic_count != 4\n\t\t\t|| topics[0]\n\t\t\t|| strcmp(topics[1], \"a\")\n\t\t\t|| strcmp(topics[2], \"b\")\n\t\t\t|| strcmp(topics[3], \"c\")){\n\t\tprint_error(\"\/a\/b\/c\", topics, topic_count);\n\t\treturn 1;\n\t}\n\treturn 0;\n}\n\n<|endoftext|>"} {"text":"<commit_before>\/\/ Author: Enrico Guiraud, Danilo Piparo CERN 12\/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\/**\n \\defgroup dataframe Data Frame\nThe ROOT Data Frame allows to analyse data stored in TTrees with a high level interface.\n*\/\n\n#ifndef ROOT_TDATAFRAME\n#define ROOT_TDATAFRAME\n\n#include \"ROOT\/TActionResultProxy.hxx\"\n#include \"ROOT\/TDataFrameInterface.hxx\"\n#include \"ROOT\/TDFNodes.hxx\"\n#include \"ROOT\/TDFUtils.hxx\"\n#include \"TChain.h\"\n\n#include <memory>\n#include <iosfwd> \/\/ std::ostringstream\n#include <stdexcept>\n#include <string>\nclass TDirectory;\nclass TTree;\n\n#ifndef __ROOTCLING__\nR__LOAD_LIBRARY(libTreePlayer)\n#endif\n\nnamespace cling {\n\/\/ TDataFrame pretty-printing\nstd::string printValue(ROOT::Experimental::TDataFrame *tdf);\n}\n\nnamespace ROOT {\nnamespace Experimental {\n\nclass TDataFrame : public TDataFrameInterface<ROOT::Detail::TDataFrameImpl> {\nprivate:\n std::shared_ptr<TTree> fTree;\n void InitTree(TTree &tree, bool ownsTree);\n\npublic:\n TDataFrame(const std::string &treeName, const std::string &filenameglob, const BranchNames_t &defaultBranches = {});\n \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n \/\/\/ \\brief Build the dataframe\n \/\/\/ \\tparam FILENAMESCOLL The type of the file collection: only requirement: must have begin and end.\n \/\/\/ \\param[in] treeName Name of the tree contained in the directory\n \/\/\/ \\param[in] filenamescoll Collection of file names, for example a list of strings.\n \/\/\/ \\param[in] defaultBranches Collection of default branches.\n \/\/\/\n \/\/\/ The default branches are looked at in case no branch is specified in the\n \/\/\/ booking of actions or transformations.\n \/\/\/ See ROOT::Experimental::TDataFrameInterface for the documentation of the\n \/\/\/ methods available.\n template <\n typename FILENAMESCOLL,\n typename std::enable_if<ROOT::Internal::TDFTraitsUtils::TIsContainer<FILENAMESCOLL>::fgValue, int>::type = 0>\n TDataFrame(const std::string &treeName, const FILENAMESCOLL &filenamescoll,\n const BranchNames_t &defaultBranches = {});\n TDataFrame(const std::string &treeName, ::TDirectory *dirPtr, const BranchNames_t &defaultBranches = {});\n TDataFrame(TTree &tree, const BranchNames_t &defaultBranches = {});\n};\n\ntemplate <typename FILENAMESCOLL,\n typename std::enable_if<ROOT::Internal::TDFTraitsUtils::TIsContainer<FILENAMESCOLL>::fgValue, int>::type>\nTDataFrame::TDataFrame(const std::string &treeName, const FILENAMESCOLL &filenamescoll,\n const BranchNames_t &defaultBranches)\n : TDataFrameInterface<ROOT::Detail::TDataFrameImpl>(\n std::make_shared<ROOT::Detail::TDataFrameImpl>(nullptr, defaultBranches))\n{\n auto chain = new TChain(treeName.c_str());\n for (auto &fileName : filenamescoll) chain->Add(ROOT::Internal::ToConstCharPtr(fileName));\n fTree = std::make_shared<TTree>(static_cast<TTree *>(chain));\n fProxiedPtr->SetTree(chain);\n}\n\n} \/\/ end NS Experimental\n} \/\/ end NS ROOT\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\/ Print a TDataFrame at the prompt:\nnamespace cling {\ninline std::string printValue(ROOT::Experimental::TDataFrame *tdf)\n{\n auto df = tdf->GetDataFrameChecked();\n auto treeName = df->GetTreeName();\n auto defBranches = df->GetDefaultBranches();\n auto tmpBranches = df->GetTmpBranches();\n\n std::ostringstream ret;\n ret << \"A data frame built on top of the \" << treeName << \" dataset.\";\n if (!defBranches.empty()) {\n if (defBranches.size() == 1)\n ret << \"\\nDefault branch: \" << defBranches[0];\n else {\n ret << \"\\nDefault branches:\\n\";\n for (auto &&branch : defBranches) {\n ret << \" - \" << branch << \"\\n\";\n }\n }\n }\n\n return ret.str();\n}\n} \/\/ namespace cling\n\n#endif \/\/ ROOT_TDATAFRAME\n<commit_msg>[TDF] Remove protection inhibiting load of library during dictionary cration<commit_after>\/\/ Author: Enrico Guiraud, Danilo Piparo CERN 12\/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\/**\n \\defgroup dataframe Data Frame\nThe ROOT Data Frame allows to analyse data stored in TTrees with a high level interface.\n*\/\n\n#ifndef ROOT_TDATAFRAME\n#define ROOT_TDATAFRAME\n\n#include \"ROOT\/TActionResultProxy.hxx\"\n#include \"ROOT\/TDataFrameInterface.hxx\"\n#include \"ROOT\/TDFNodes.hxx\"\n#include \"ROOT\/TDFUtils.hxx\"\n#include \"TChain.h\"\n\n#include <memory>\n#include <iosfwd> \/\/ std::ostringstream\n#include <stdexcept>\n#include <string>\nclass TDirectory;\nclass TTree;\n\nR__LOAD_LIBRARY(libTreePlayer)\n\nnamespace cling {\n\/\/ TDataFrame pretty-printing\nstd::string printValue(ROOT::Experimental::TDataFrame *tdf);\n}\n\nnamespace ROOT {\nnamespace Experimental {\n\nclass TDataFrame : public TDataFrameInterface<ROOT::Detail::TDataFrameImpl> {\nprivate:\n std::shared_ptr<TTree> fTree;\n void InitTree(TTree &tree, bool ownsTree);\n\npublic:\n TDataFrame(const std::string &treeName, const std::string &filenameglob, const BranchNames_t &defaultBranches = {});\n \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n \/\/\/ \\brief Build the dataframe\n \/\/\/ \\tparam FILENAMESCOLL The type of the file collection: only requirement: must have begin and end.\n \/\/\/ \\param[in] treeName Name of the tree contained in the directory\n \/\/\/ \\param[in] filenamescoll Collection of file names, for example a list of strings.\n \/\/\/ \\param[in] defaultBranches Collection of default branches.\n \/\/\/\n \/\/\/ The default branches are looked at in case no branch is specified in the\n \/\/\/ booking of actions or transformations.\n \/\/\/ See ROOT::Experimental::TDataFrameInterface for the documentation of the\n \/\/\/ methods available.\n template <\n typename FILENAMESCOLL,\n typename std::enable_if<ROOT::Internal::TDFTraitsUtils::TIsContainer<FILENAMESCOLL>::fgValue, int>::type = 0>\n TDataFrame(const std::string &treeName, const FILENAMESCOLL &filenamescoll,\n const BranchNames_t &defaultBranches = {});\n TDataFrame(const std::string &treeName, ::TDirectory *dirPtr, const BranchNames_t &defaultBranches = {});\n TDataFrame(TTree &tree, const BranchNames_t &defaultBranches = {});\n};\n\ntemplate <typename FILENAMESCOLL,\n typename std::enable_if<ROOT::Internal::TDFTraitsUtils::TIsContainer<FILENAMESCOLL>::fgValue, int>::type>\nTDataFrame::TDataFrame(const std::string &treeName, const FILENAMESCOLL &filenamescoll,\n const BranchNames_t &defaultBranches)\n : TDataFrameInterface<ROOT::Detail::TDataFrameImpl>(\n std::make_shared<ROOT::Detail::TDataFrameImpl>(nullptr, defaultBranches))\n{\n auto chain = new TChain(treeName.c_str());\n for (auto &fileName : filenamescoll) chain->Add(ROOT::Internal::ToConstCharPtr(fileName));\n fTree = std::make_shared<TTree>(static_cast<TTree *>(chain));\n fProxiedPtr->SetTree(chain);\n}\n\n} \/\/ end NS Experimental\n} \/\/ end NS ROOT\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\/ Print a TDataFrame at the prompt:\nnamespace cling {\ninline std::string printValue(ROOT::Experimental::TDataFrame *tdf)\n{\n auto df = tdf->GetDataFrameChecked();\n auto treeName = df->GetTreeName();\n auto defBranches = df->GetDefaultBranches();\n auto tmpBranches = df->GetTmpBranches();\n\n std::ostringstream ret;\n ret << \"A data frame built on top of the \" << treeName << \" dataset.\";\n if (!defBranches.empty()) {\n if (defBranches.size() == 1)\n ret << \"\\nDefault branch: \" << defBranches[0];\n else {\n ret << \"\\nDefault branches:\\n\";\n for (auto &&branch : defBranches) {\n ret << \" - \" << branch << \"\\n\";\n }\n }\n }\n\n return ret.str();\n}\n} \/\/ namespace cling\n\n#endif \/\/ ROOT_TDATAFRAME\n<|endoftext|>"} {"text":"<commit_before>\/** \\file call_main.cpp\n *\n * Defines the \"vg call\" subcommand, which calls variation from an augmented graph\n *\/\n\n#include <omp.h>\n#include <unistd.h>\n#include <getopt.h>\n\n#include <list>\n#include <fstream>\n\n#include \"subcommand.hpp\"\n#include \"..\/path.hpp\"\n#include \"..\/graph_caller.hpp\"\n#include \"..\/xg.hpp\"\n#include <vg\/io\/stream.hpp>\n#include <vg\/io\/vpkg.hpp>\n\nusing namespace std;\nusing namespace vg;\nusing namespace vg::subcommand;\n\nvoid help_call2(char** argv) {\n cerr << \"usage: \" << argv[0] << \" call [options] <graph> > output.vcf\" << endl\n << \"Call variants or genotype known variants\" << endl\n << endl\n << \"support calling options:\" << endl\n << \" -k, --pack FILE Supports created from vg pack (input graph must be xg)\" << endl\n << \"general options:\" << endl\n << \" -v, --vcf FILE VCF file to genotype (must have been used to construct input graph with -a)\" << endl\n << \" -f, --ref-fasta FILE Reference fasta (required if VCF contains symbolic deletions or inversions)\" << endl\n << \" -i, --ins-fasta FILE Insertions fasta (required if VCF contains symbolic insertions)\" << endl\n << \" -s, --sample NAME Sample name [default=SAMPLE]\" << endl\n << \" -r, --snarls FILE Snarls (from vg snarls) to avoid recomputing.\" << endl\n << \" -p, --ref-path NAME Reference path to call on (multipile allowed. defaults to all paths)\" << endl\n << \" -t, --threads N number of threads to use\" << endl;\n} \n\nint main_call2(int argc, char** argv) {\n\n string pack_filename;\n string vcf_filename;\n string sample_name = \"SAMPLE\";\n string snarl_filename;\n string ref_fasta_filename;\n string ins_fasta_filename;\n vector<string> ref_paths;\n\n int c;\n optind = 2; \/\/ force optind past command positional argument\n while (true) {\n\n static const struct option long_options[] = {\n {\"pack\", required_argument, 0, 'k'},\n {\"vcf\", required_argument, 0, 'v'},\n {\"ref-fasta\", required_argument, 0, 'f'},\n {\"ins-fasta\", required_argument, 0, 'i'},\n {\"sample\", required_argument, 0, 's'}, \n {\"snarls\", required_argument, 0, 'r'},\n {\"ref-path\", required_argument, 0, 'p'},\n {\"threads\", required_argument, 0, 't'},\n {\"help\", no_argument, 0, 'h'},\n {0, 0, 0, 0}\n };\n\n int option_index = 0;\n\n c = getopt_long (argc, argv, \"k:v:f:i:s:r:p:t:h\",\n long_options, &option_index);\n\n \/\/ Detect the end of the options.\n if (c == -1)\n break;\n\n switch (c)\n {\n case 'k':\n pack_filename = optarg;\n break;\n case 'v':\n vcf_filename = optarg;\n break;\n case 'f':\n ref_fasta_filename = optarg;\n break;\n case 'i':\n ins_fasta_filename = optarg;\n break;\n case 's':\n sample_name = optarg;\n break;\n case 'r':\n snarl_filename = optarg;\n break;\n case 'p':\n ref_paths.push_back(optarg);\n break;\n case 't':\n {\n int num_threads = parse<int>(optarg);\n if (num_threads <= 0) {\n cerr << \"error:[vg call] Thread count (-t) set to \" << num_threads << \", must set to a positive integer.\" << endl;\n exit(1);\n }\n omp_set_num_threads(num_threads);\n break;\n }\n case 'h':\n case '?':\n \/* getopt_long already printed an error message. *\/\n help_call2(argv);\n exit(1);\n break;\n default:\n abort ();\n }\n }\n\n if (argc <= 2) {\n help_call2(argv);\n return 1;\n }\n\n \/\/ Read the graph\n unique_ptr<PathHandleGraph> graph;\n get_input_file(optind, argc, argv, [&](istream& in) {\n graph = vg::io::VPKG::load_one<PathHandleGraph>(in);\n });\n\n \/\/ Check our paths\n for (const string& ref_path : ref_paths) {\n if (!graph->has_path(ref_path)) {\n cerr << \"error [vg call]: Reference path \\\"\" << ref_path << \"\\\" not found in graph\" << endl;\n return 1;\n }\n }\n \/\/ No paths specified: use them all\n if (ref_paths.empty()) {\n graph->for_each_path_handle([&](path_handle_t path_handle) {\n const string& name = graph->get_path_name(path_handle);\n if (!Paths::is_alt(name)) {\n ref_paths.push_back(name);\n }\n });\n }\n\n \/\/ Load or compute the snarls\n unique_ptr<SnarlManager> snarl_manager; \n if (!snarl_filename.empty()) {\n ifstream snarl_file(snarl_filename.c_str());\n if (!snarl_file) {\n cerr << \"Error [vg call]: Unable to load snarls file: \" << snarl_filename << endl;\n return 1;\n }\n snarl_manager = vg::io::VPKG::load_one<SnarlManager>(snarl_file);\n } else {\n CactusSnarlFinder finder(*graph);\n snarl_manager = unique_ptr<SnarlManager>(new SnarlManager(std::move(finder.find_snarls())));\n }\n \n unique_ptr<GraphCaller> graph_caller;\n unique_ptr<SnarlCaller> snarl_caller;\n\n \/\/ Make a Packed Support Caller\n unique_ptr<Packer> packer;\n if (!pack_filename.empty()) {\n if (dynamic_cast<xg::XG*>(graph.get()) == nullptr) {\n cerr << \"error [vg call]: Packed support option requires input graph in XG format\" << endl;\n return 1;\n }\n \/\/ Load our packed supports (they must have come from vg pack on graph)\n packer = unique_ptr<Packer>(new Packer(dynamic_cast<xg::XG*>(graph.get())));\n packer->load_from_file(pack_filename);\n PackedSupportSnarlCaller* packed_caller = new PackedSupportSnarlCaller(*packer, *snarl_manager);\n snarl_caller = unique_ptr<SnarlCaller>(packed_caller);\n }\n\n if (!snarl_caller) {\n cerr << \"error [vg call]: pack file (-p) is required\" << endl;\n return 1;\n }\n\n vcflib::VariantCallFile variant_file;\n unique_ptr<FastaReference> ref_fasta;\n unique_ptr<FastaReference> ins_fasta;\n if (!vcf_filename.empty()) {\n \/\/ Genotype the VCF\n variant_file.parseSamples = false;\n variant_file.open(vcf_filename);\n if (!variant_file.is_open()) {\n cerr << \"error: [vg call] could not open \" << vcf_filename << endl;\n return 1;\n }\n\n \/\/ load up the fasta\n if (!ref_fasta_filename.empty()) {\n ref_fasta = unique_ptr<FastaReference>(new FastaReference);\n ref_fasta->open(ref_fasta_filename);\n }\n if (!ins_fasta_filename.empty()) {\n ins_fasta = unique_ptr<FastaReference>(new FastaReference);\n ins_fasta->open(ins_fasta_filename);\n }\n \n VCFGenotyper* vcf_genotyper = new VCFGenotyper(*graph, *snarl_caller,\n *snarl_manager, variant_file,\n sample_name, ref_paths,\n ref_fasta.get(),\n ins_fasta.get());\n graph_caller = unique_ptr<GraphCaller>(vcf_genotyper);\n } else {\n \/\/ de-novo caller (port of the old vg call code, which requires a support based caller)\n LegacyCaller* legacy_caller = new LegacyCaller(*dynamic_cast<PathPositionHandleGraph*>(graph.get()),\n *dynamic_cast<SupportBasedSnarlCaller*>(snarl_caller.get()),\n *snarl_manager,\n sample_name, ref_paths);\n graph_caller = unique_ptr<GraphCaller>(legacy_caller);\n }\n\n \/\/ Call the graph\n cout << graph_caller->vcf_header(*graph, ref_paths) << flush;\n graph_caller->call_top_level_snarls();\n \n return 0;\n}\n\n\/\/ Register subcommand\nstatic Subcommand vg_call2(\"call2\", \"call2 variants\", PIPELINE, 5, main_call2);\n\n<commit_msg>remove mistakenly committed file<commit_after><|endoftext|>"} {"text":"<commit_before>\/*************************************************************************\n *\n * OpenOffice.org - a multi-platform office productivity suite\n *\n * $RCSfile: previewadapter.hxx,v $\n *\n * $Revision: 1.5 $\n *\n * last change: $Author: rt $ $Date: 2005-09-08 23:47:32 $\n *\n * The Contents of this file are made available subject to\n * the terms of GNU Lesser General Public License Version 2.1.\n *\n *\n * GNU Lesser General Public License Version 2.1\n * =============================================\n * Copyright 2005 by Sun Microsystems, Inc.\n * 901 San Antonio Road, Palo Alto, CA 94303, USA\n *\n * This library is free software; you can redistribute it and\/or\n * modify it under the terms of the GNU Lesser General Public\n * License version 2.1, as published by the Free Software Foundation.\n *\n * This library is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU\n * Lesser General Public License for more details.\n *\n * You should have received a copy of the GNU Lesser General Public\n * License along with this library; if not, write to the Free Software\n * Foundation, Inc., 59 Temple Place, Suite 330, Boston,\n * MA 02111-1307 USA\n *\n ************************************************************************\/\n\n#ifndef _PREVIEWADAPTER_HXX_\n#define _PREVIEWADAPTER_HXX_\n\n#ifndef _SAL_TYPES_H_\n#include <sal\/types.h>\n#endif\n\n#ifndef _COM_SUN_STAR_UNO_SEQUENCE_HXX_\n#include <com\/sun\/star\/uno\/Sequence.hxx>\n#endif\n\n#ifndef _COM_SUN_STAR_UNO_RUNTIMEEXCEPTION_HPP_\n#include <com\/sun\/star\/uno\/RuntimeException.hpp>\n#endif\n\n#ifndef _COM_SUN_STAR_LANG_ILLEGALARGUMENTEXCEPTION_HPP_\n#include <com\/sun\/star\/lang\/IllegalArgumentException.hpp>\n#endif\n\n#ifndef _COM_SUN_STAR_UNO_ANY_HXX_\n#include <com\/sun\/star\/uno\/Any.hxx>\n#endif\n\n#include <windows.h>\n#include <memory>\n\n\/\/ forward declaration\nclass CPreviewAdapterImpl;\n\n\/\/---------------------------------------------\n\/\/ A kind of a facade for the preview class.\n\/\/ We want to hide the fact that the preview\n\/\/ window may only become visible if there is\n\/\/ a valid parent window (means, the FilePicker)\n\/\/ is in execution mode. So unless someone sets\n\/\/ the preview active with a valid parent\n\/\/ window the preview may not be visible\n\/\/---------------------------------------------\n\nclass CPreviewAdapter\n{\npublic:\n\n \/\/ ctor\n CPreviewAdapter(HINSTANCE instance);\n\n ~CPreviewAdapter();\n\n ::com::sun::star::uno::Sequence<sal_Int16> SAL_CALL getSupportedImageFormats();\n\n sal_Int32 SAL_CALL getTargetColorDepth();\n\n sal_Int32 SAL_CALL getAvailableWidth();\n\n sal_Int32 SAL_CALL getAvailableHeight();\n\n void SAL_CALL setImage(sal_Int16 aImageFormat, const ::com::sun::star::uno::Any& aImage)\n throw (::com::sun::star::lang::IllegalArgumentException, ::com::sun::star::uno::RuntimeException);\n\n sal_Bool SAL_CALL setShowState(sal_Bool bShowState);\n\n sal_Bool SAL_CALL getShowState();\n\n void SAL_CALL setParent(HWND parent);\n\n \/\/--------------------------------------\n \/\/ notification from parent\n \/\/--------------------------------------\n\n void SAL_CALL notifyParentShow(sal_Bool bShow);\n\n void SAL_CALL notifyParentSizeChanged();\n\n void SAL_CALL notifyParentWindowPosChanged(sal_Bool bIsVisible);\n\nprivate:\n \/\/ hide implementation details using the\n \/\/ bridge pattern\n std::auto_ptr<CPreviewAdapterImpl> m_pImpl;\n\n\/\/ prevent copy and assignment\nprivate:\n CPreviewAdapter(const CPreviewAdapter&);\n CPreviewAdapter& operator=(const CPreviewAdapter&);\n};\n\n\n#endif\n<commit_msg>INTEGRATION: CWS sb59 (1.5.100); FILE MERGED 2006\/08\/10 12:04:53 sb 1.5.100.1: #i67487# Made code warning-free (wntmsci10).<commit_after>\/*************************************************************************\n *\n * OpenOffice.org - a multi-platform office productivity suite\n *\n * $RCSfile: previewadapter.hxx,v $\n *\n * $Revision: 1.6 $\n *\n * last change: $Author: obo $ $Date: 2006-10-12 10:54:28 $\n *\n * The Contents of this file are made available subject to\n * the terms of GNU Lesser General Public License Version 2.1.\n *\n *\n * GNU Lesser General Public License Version 2.1\n * =============================================\n * Copyright 2005 by Sun Microsystems, Inc.\n * 901 San Antonio Road, Palo Alto, CA 94303, USA\n *\n * This library is free software; you can redistribute it and\/or\n * modify it under the terms of the GNU Lesser General Public\n * License version 2.1, as published by the Free Software Foundation.\n *\n * This library is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU\n * Lesser General Public License for more details.\n *\n * You should have received a copy of the GNU Lesser General Public\n * License along with this library; if not, write to the Free Software\n * Foundation, Inc., 59 Temple Place, Suite 330, Boston,\n * MA 02111-1307 USA\n *\n ************************************************************************\/\n\n#ifndef _PREVIEWADAPTER_HXX_\n#define _PREVIEWADAPTER_HXX_\n\n#ifndef _SAL_TYPES_H_\n#include <sal\/types.h>\n#endif\n\n#ifndef _COM_SUN_STAR_UNO_SEQUENCE_HXX_\n#include <com\/sun\/star\/uno\/Sequence.hxx>\n#endif\n\n#ifndef _COM_SUN_STAR_UNO_RUNTIMEEXCEPTION_HPP_\n#include <com\/sun\/star\/uno\/RuntimeException.hpp>\n#endif\n\n#ifndef _COM_SUN_STAR_LANG_ILLEGALARGUMENTEXCEPTION_HPP_\n#include <com\/sun\/star\/lang\/IllegalArgumentException.hpp>\n#endif\n\n#ifndef _COM_SUN_STAR_UNO_ANY_HXX_\n#include <com\/sun\/star\/uno\/Any.hxx>\n#endif\n\n#if defined _MSC_VER\n#pragma warning(push, 1)\n#endif\n#include <windows.h>\n#if defined _MSC_VER\n#pragma warning(pop)\n#endif\n#include <memory>\n\n\/\/ forward declaration\nclass CPreviewAdapterImpl;\n\n\/\/---------------------------------------------\n\/\/ A kind of a facade for the preview class.\n\/\/ We want to hide the fact that the preview\n\/\/ window may only become visible if there is\n\/\/ a valid parent window (means, the FilePicker)\n\/\/ is in execution mode. So unless someone sets\n\/\/ the preview active with a valid parent\n\/\/ window the preview may not be visible\n\/\/---------------------------------------------\n\nclass CPreviewAdapter\n{\npublic:\n\n \/\/ ctor\n CPreviewAdapter(HINSTANCE instance);\n\n ~CPreviewAdapter();\n\n ::com::sun::star::uno::Sequence<sal_Int16> SAL_CALL getSupportedImageFormats();\n\n sal_Int32 SAL_CALL getTargetColorDepth();\n\n sal_Int32 SAL_CALL getAvailableWidth();\n\n sal_Int32 SAL_CALL getAvailableHeight();\n\n void SAL_CALL setImage(sal_Int16 aImageFormat, const ::com::sun::star::uno::Any& aImage)\n throw (::com::sun::star::lang::IllegalArgumentException, ::com::sun::star::uno::RuntimeException);\n\n sal_Bool SAL_CALL setShowState(sal_Bool bShowState);\n\n sal_Bool SAL_CALL getShowState();\n\n void SAL_CALL setParent(HWND parent);\n\n \/\/--------------------------------------\n \/\/ notification from parent\n \/\/--------------------------------------\n\n void SAL_CALL notifyParentShow(bool bShow);\n\n void SAL_CALL notifyParentSizeChanged();\n\n void SAL_CALL notifyParentWindowPosChanged();\n\nprivate:\n \/\/ hide implementation details using the\n \/\/ bridge pattern\n std::auto_ptr<CPreviewAdapterImpl> m_pImpl;\n\n\/\/ prevent copy and assignment\nprivate:\n CPreviewAdapter(const CPreviewAdapter&);\n CPreviewAdapter& operator=(const CPreviewAdapter&);\n};\n\n\n#endif\n<|endoftext|>"} {"text":"<commit_before>\/***************************************************************************\n**\n** Copyright (C) 2010 Nokia Corporation and\/or its subsidiary(-ies).\n** All rights reserved.\n** Contact: Nokia Corporation (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 <QCoreApplication>\n#include <QTextCodec>\n#include <MLocale>\n#include <unicode\/uversion.h>\n\n#include \"pt_mcalendar.h\"\n\nvoid Pt_MCalendar::initTestCase()\n{\n static int argc = 0;\n static char *argv[1] = { (char *) \"\" };\n qap = new QCoreApplication(argc, argv);\n QTextCodec::setCodecForCStrings(QTextCodec::codecForName(\"UTF-8\"));\n QProcess process;\n process.start(\"sh -c \\\"dpkg -s libicu44 | grep Version | perl -pe 's\/^Version:[[:space:]]*([^[[:space:]]+)$\/$1\/g'\\\"\");\n if (!process.waitForFinished()) {\n qDebug() << \"cannot run process to check libicu44 package version , exiting ...\";\n exit(1);\n }\n icuPackageVersion = process.readAllStandardOutput();\n icuPackageVersion.replace(\"\\n\", \"\");\n qDebug() << \"libicu44 package version is:\" << icuPackageVersion;\n}\n\nvoid Pt_MCalendar::cleanupTestCase()\n{\n delete qap;\n}\n\nvoid Pt_MCalendar::init()\n{\n}\n\nvoid Pt_MCalendar::cleanup()\n{\n}\n\nvoid Pt_MCalendar::benchmarkFormatDateTimePosixFormatString_U_QDateTime()\n{\n QString language(\"en_US\"); \/\/ will be overridden\n QString lcMessages(\"en_US\"); \/\/ should not matter\n QString lcTime(\"ar_SA\"); \/\/ this overrides language\n QString lcNumeric(\"en_US\"); \/\/ should not matter\n MLocale locale(language);\n locale.setCategoryLocale(MLocale::MLcMessages, lcMessages);\n locale.setCategoryLocale(MLocale::MLcTime, lcTime);\n locale.setCategoryLocale(MLocale::MLcNumeric, lcNumeric);\n locale.setCalendarType(MLocale::GregorianCalendar);\n MCalendar mcal(locale);\n int year = 2008;\n int month = 7;\n int day = 21;\n int hour = 14;\n int minute = 31;\n int second = 3;\n mcal.setDate(year, month, day);\n mcal.setTime(hour, minute, second);\n QDate date(year, month, day);\n QTime time(hour, minute, second);\n QDateTime datetime(date, time, Qt::LocalTime);\n QLocale qlocale(language);\n QString format(\"%U\");\n QString result(\"٢٩\");\n QCOMPARE(locale.formatDateTime(mcal, format), result);\n QCOMPARE(locale.formatDateTime(datetime, format), result);\n\n QBENCHMARK {\n locale.formatDateTime(datetime, format);\n }\n}\n\nvoid Pt_MCalendar::benchmarkFormatDateTimePosixFormatString_U_MCalendar()\n{\n QString language(\"en_US\"); \/\/ will be overridden\n QString lcMessages(\"en_US\"); \/\/ should not matter\n QString lcTime(\"ar_SA\"); \/\/ this overrides language\n QString lcNumeric(\"en_US\"); \/\/ should not matter\n MLocale locale(language);\n locale.setCategoryLocale(MLocale::MLcMessages, lcMessages);\n locale.setCategoryLocale(MLocale::MLcTime, lcTime);\n locale.setCategoryLocale(MLocale::MLcNumeric, lcNumeric);\n locale.setCalendarType(MLocale::GregorianCalendar);\n MCalendar mcal(locale);\n int year = 2008;\n int month = 7;\n int day = 21;\n int hour = 14;\n int minute = 31;\n int second = 3;\n mcal.setDate(year, month, day);\n mcal.setTime(hour, minute, second);\n QDate date(year, month, day);\n QTime time(hour, minute, second);\n QDateTime datetime(date, time, Qt::LocalTime);\n QLocale qlocale(language);\n QString format(\"%U\");\n QString result(\"٢٩\");\n QCOMPARE(locale.formatDateTime(mcal, format), result);\n QCOMPARE(locale.formatDateTime(datetime, format), result);\n\n QBENCHMARK {\n locale.formatDateTime(mcal, format);\n }\n}\n\nvoid Pt_MCalendar::benchmarkFormatDateTimePosixFormatString_V_MCalendar()\n{\n QString language(\"en_US\"); \/\/ will be overridden\n QString lcMessages(\"en_US\"); \/\/ should not matter\n QString lcTime(\"ar_SA\"); \/\/ this overrides language\n QString lcNumeric(\"en_US\"); \/\/ should not matter\n MLocale locale(language);\n locale.setCategoryLocale(MLocale::MLcMessages, lcMessages);\n locale.setCategoryLocale(MLocale::MLcTime, lcTime);\n locale.setCategoryLocale(MLocale::MLcNumeric, lcNumeric);\n locale.setCalendarType(MLocale::GregorianCalendar);\n MCalendar mcal(locale);\n int year = 2008;\n int month = 7;\n int day = 21;\n int hour = 14;\n int minute = 31;\n int second = 3;\n mcal.setDate(year, month, day);\n mcal.setTime(hour, minute, second);\n QDate date(year, month, day);\n QTime time(hour, minute, second);\n QDateTime datetime(date, time, Qt::LocalTime);\n QLocale qlocale(language);\n QString format(\"%V\");\n QString result(\"٣٠\");\n QCOMPARE(locale.formatDateTime(mcal, format), result);\n QCOMPARE(locale.formatDateTime(datetime, format), result);\n\n QBENCHMARK {\n locale.formatDateTime(mcal, format);\n }\n}\n\nvoid Pt_MCalendar::benchmarkFormatDateTimePosixFormatString_r_MCalendar()\n{\n QString language(\"en_US\"); \/\/ will be overridden\n QString lcMessages(\"en_US\"); \/\/ should not matter\n QString lcTime(\"ar_SA\"); \/\/ this overrides language\n QString lcNumeric(\"en_US\"); \/\/ should not matter\n MLocale locale(language);\n locale.setCategoryLocale(MLocale::MLcMessages, lcMessages);\n locale.setCategoryLocale(MLocale::MLcTime, lcTime);\n locale.setCategoryLocale(MLocale::MLcNumeric, lcNumeric);\n locale.setCalendarType(MLocale::GregorianCalendar);\n MCalendar mcal(locale);\n int year = 2008;\n int month = 7;\n int day = 21;\n int hour = 14;\n int minute = 31;\n int second = 3;\n mcal.setDate(year, month, day);\n mcal.setTime(hour, minute, second);\n QDate date(year, month, day);\n QTime time(hour, minute, second);\n QDateTime datetime(date, time, Qt::LocalTime);\n QLocale qlocale(language);\n QString format(\"%r\");\n QString result(\"٢:٣١ م\");\n QCOMPARE(locale.formatDateTime(mcal, format), result);\n QCOMPARE(locale.formatDateTime(datetime, format), result);\n\n QBENCHMARK {\n locale.formatDateTime(mcal, format);\n }\n}\n\nvoid Pt_MCalendar::benchmarkFormatDateTimePosixFormatString_R_MCalendar()\n{\n QString language(\"en_US\"); \/\/ will be overridden\n QString lcMessages(\"en_US\"); \/\/ should not matter\n QString lcTime(\"ar_SA\"); \/\/ this overrides language\n QString lcNumeric(\"en_US\"); \/\/ should not matter\n MLocale locale(language);\n locale.setCategoryLocale(MLocale::MLcMessages, lcMessages);\n locale.setCategoryLocale(MLocale::MLcTime, lcTime);\n locale.setCategoryLocale(MLocale::MLcNumeric, lcNumeric);\n locale.setCalendarType(MLocale::GregorianCalendar);\n MCalendar mcal(locale);\n int year = 2008;\n int month = 7;\n int day = 21;\n int hour = 14;\n int minute = 31;\n int second = 3;\n mcal.setDate(year, month, day);\n mcal.setTime(hour, minute, second);\n QDate date(year, month, day);\n QTime time(hour, minute, second);\n QDateTime datetime(date, time, Qt::LocalTime);\n QLocale qlocale(language);\n QString format(\"%R\");\n QString result(\"١٤:٣١\");\n QCOMPARE(locale.formatDateTime(mcal, format), result);\n QCOMPARE(locale.formatDateTime(datetime, format), result);\n\n QBENCHMARK {\n locale.formatDateTime(mcal, format);\n }\n}\n\nvoid Pt_MCalendar::benchmarkFormatDateTimePosixFormatString_t_MCalendar()\n{\n QString language(\"en_US\"); \/\/ will be overridden\n QString lcMessages(\"en_US\"); \/\/ should not matter\n QString lcTime(\"ar_SA\"); \/\/ this overrides language\n QString lcNumeric(\"en_US\"); \/\/ should not matter\n MLocale locale(language);\n locale.setCategoryLocale(MLocale::MLcMessages, lcMessages);\n locale.setCategoryLocale(MLocale::MLcTime, lcTime);\n locale.setCategoryLocale(MLocale::MLcNumeric, lcNumeric);\n locale.setCalendarType(MLocale::GregorianCalendar);\n MCalendar mcal(locale);\n int year = 2008;\n int month = 7;\n int day = 21;\n int hour = 14;\n int minute = 31;\n int second = 3;\n mcal.setDate(year, month, day);\n mcal.setTime(hour, minute, second);\n QDate date(year, month, day);\n QTime time(hour, minute, second);\n QDateTime datetime(date, time, Qt::LocalTime);\n QLocale qlocale(language);\n QString format(\"%t\");\n QString result(\"\\t\");\n QCOMPARE(locale.formatDateTime(mcal, format), result);\n QCOMPARE(locale.formatDateTime(datetime, format), result);\n\n QBENCHMARK {\n locale.formatDateTime(mcal, format);\n }\n}\n\nvoid Pt_MCalendar::benchmarkIcuFormatString()\n{\n QString language(\"en_US\"); \/\/ will be overridden\n QString lcMessages(\"en_US\"); \/\/ should not matter\n QString lcTime(\"fi_FI\"); \/\/ this overrides language\n QString lcNumeric(\"en_US\"); \/\/ should not matter\n MLocale locale(language);\n locale.setCategoryLocale(MLocale::MLcMessages, lcMessages);\n locale.setCategoryLocale(MLocale::MLcTime, lcTime);\n locale.setCategoryLocale(MLocale::MLcNumeric, lcNumeric);\n locale.setCalendarType(MLocale::IslamicCalendar); \/\/ should not matter\n QCOMPARE(locale.icuFormatString(\n MLocale::DateFull,\n MLocale::TimeFull,\n MLocale::GregorianCalendar),\n QString(\"cccc d. MMMM y H:mm:ss zzzz\"));\n\n QBENCHMARK {\n locale.icuFormatString(\n MLocale::DateFull,\n MLocale::TimeFull,\n MLocale::GregorianCalendar);\n }\n}\n\nvoid Pt_MCalendar::benchmarkFormatDateTime()\n{\n QString language(\"en_US\"); \/\/ will be overridden\n QString lcMessages(\"en_US\"); \/\/ should not matter\n QString lcTime(\"fi_FI\"); \/\/ this overrides language\n QString lcNumeric(\"en_US\"); \/\/ should not matter\n MLocale locale(language);\n locale.setCategoryLocale(MLocale::MLcMessages, lcMessages);\n locale.setCategoryLocale(MLocale::MLcTime, lcTime);\n locale.setCategoryLocale(MLocale::MLcNumeric, lcNumeric);\n MCalendar::setSystemTimeZone(\"Europe\/Helsinki\");\n MCalendar calendar;\n calendar.setDateTime(QDateTime(QDate(2010, 7, 13),\n QTime(14, 51, 07, 0),\n Qt::LocalTime));\n\n QCOMPARE(locale.formatDateTime(\n calendar, MLocale::DateFull, MLocale::TimeFull),\n QString(\"tiistai 13. heinäkuuta 2010 14:51:07 Itä-Euroopan kesäaika\"));\n\n QBENCHMARK {\n locale.formatDateTime(\n calendar, MLocale::DateFull, MLocale::TimeFull);\n }\n}\n\nQTEST_APPLESS_MAIN(Pt_MCalendar);\n\n<commit_msg>Changes: fix benchmarks pt_mcalendar.cpp<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 <QCoreApplication>\n#include <QTextCodec>\n#include <MLocale>\n#include <unicode\/uversion.h>\n\n#include \"pt_mcalendar.h\"\n\nvoid Pt_MCalendar::initTestCase()\n{\n static int argc = 0;\n static char *argv[1] = { (char *) \"\" };\n qap = new QCoreApplication(argc, argv);\n QTextCodec::setCodecForCStrings(QTextCodec::codecForName(\"UTF-8\"));\n QProcess process;\n process.start(\"sh -c \\\"dpkg -s libicu44 | grep Version | perl -pe 's\/^Version:[[:space:]]*([^[[:space:]]+)$\/$1\/g'\\\"\");\n if (!process.waitForFinished()) {\n qDebug() << \"cannot run process to check libicu44 package version , exiting ...\";\n exit(1);\n }\n icuPackageVersion = process.readAllStandardOutput();\n icuPackageVersion.replace(\"\\n\", \"\");\n qDebug() << \"libicu44 package version is:\" << icuPackageVersion;\n}\n\nvoid Pt_MCalendar::cleanupTestCase()\n{\n delete qap;\n}\n\nvoid Pt_MCalendar::init()\n{\n}\n\nvoid Pt_MCalendar::cleanup()\n{\n}\n\nvoid Pt_MCalendar::benchmarkFormatDateTimePosixFormatString_U_QDateTime()\n{\n QString language(\"en_US\"); \/\/ will be overridden\n QString lcMessages(\"en_US\"); \/\/ should not matter\n QString lcTime(\"ar_SA\"); \/\/ this overrides language\n QString lcNumeric(\"ar_SA\"); \/\/ does matter, overrides localized numbers in dates\n MLocale locale(language);\n locale.setCategoryLocale(MLocale::MLcMessages, lcMessages);\n locale.setCategoryLocale(MLocale::MLcTime, lcTime);\n locale.setCategoryLocale(MLocale::MLcNumeric, lcNumeric);\n locale.setCalendarType(MLocale::GregorianCalendar);\n MCalendar mcal(locale);\n int year = 2008;\n int month = 7;\n int day = 21;\n int hour = 14;\n int minute = 31;\n int second = 3;\n mcal.setDate(year, month, day);\n mcal.setTime(hour, minute, second);\n QDate date(year, month, day);\n QTime time(hour, minute, second);\n QDateTime datetime(date, time, Qt::LocalTime);\n QLocale qlocale(language);\n QString format(\"%U\");\n QString result(\"٢٩\");\n QCOMPARE(locale.formatDateTime(mcal, format), result);\n QCOMPARE(locale.formatDateTime(datetime, format), result);\n\n QBENCHMARK {\n locale.formatDateTime(datetime, format);\n }\n}\n\nvoid Pt_MCalendar::benchmarkFormatDateTimePosixFormatString_U_MCalendar()\n{\n QString language(\"en_US\"); \/\/ will be overridden\n QString lcMessages(\"en_US\"); \/\/ should not matter\n QString lcTime(\"ar_SA\"); \/\/ this overrides language\n QString lcNumeric(\"ar_SA\"); \/\/ does matter, overrides localized numbers in dates\n MLocale locale(language);\n locale.setCategoryLocale(MLocale::MLcMessages, lcMessages);\n locale.setCategoryLocale(MLocale::MLcTime, lcTime);\n locale.setCategoryLocale(MLocale::MLcNumeric, lcNumeric);\n locale.setCalendarType(MLocale::GregorianCalendar);\n MCalendar mcal(locale);\n int year = 2008;\n int month = 7;\n int day = 21;\n int hour = 14;\n int minute = 31;\n int second = 3;\n mcal.setDate(year, month, day);\n mcal.setTime(hour, minute, second);\n QDate date(year, month, day);\n QTime time(hour, minute, second);\n QDateTime datetime(date, time, Qt::LocalTime);\n QLocale qlocale(language);\n QString format(\"%U\");\n QString result(\"٢٩\");\n QCOMPARE(locale.formatDateTime(mcal, format), result);\n QCOMPARE(locale.formatDateTime(datetime, format), result);\n\n QBENCHMARK {\n locale.formatDateTime(mcal, format);\n }\n}\n\nvoid Pt_MCalendar::benchmarkFormatDateTimePosixFormatString_V_MCalendar()\n{\n QString language(\"en_US\"); \/\/ will be overridden\n QString lcMessages(\"en_US\"); \/\/ should not matter\n QString lcTime(\"ar_SA\"); \/\/ this overrides language\n QString lcNumeric(\"ar_SA\"); \/\/ does matter, overrides localized numbers in dates\n MLocale locale(language);\n locale.setCategoryLocale(MLocale::MLcMessages, lcMessages);\n locale.setCategoryLocale(MLocale::MLcTime, lcTime);\n locale.setCategoryLocale(MLocale::MLcNumeric, lcNumeric);\n locale.setCalendarType(MLocale::GregorianCalendar);\n MCalendar mcal(locale);\n int year = 2008;\n int month = 7;\n int day = 21;\n int hour = 14;\n int minute = 31;\n int second = 3;\n mcal.setDate(year, month, day);\n mcal.setTime(hour, minute, second);\n QDate date(year, month, day);\n QTime time(hour, minute, second);\n QDateTime datetime(date, time, Qt::LocalTime);\n QLocale qlocale(language);\n QString format(\"%V\");\n QString result(\"٣٠\");\n QCOMPARE(locale.formatDateTime(mcal, format), result);\n QCOMPARE(locale.formatDateTime(datetime, format), result);\n\n QBENCHMARK {\n locale.formatDateTime(mcal, format);\n }\n}\n\nvoid Pt_MCalendar::benchmarkFormatDateTimePosixFormatString_r_MCalendar()\n{\n QString language(\"en_US\"); \/\/ will be overridden\n QString lcMessages(\"en_US\"); \/\/ should not matter\n QString lcTime(\"ar_SA\"); \/\/ this overrides language\n QString lcNumeric(\"ar_SA\"); \/\/ does matter, overrides localized numbers in dates\n MLocale locale(language);\n locale.setCategoryLocale(MLocale::MLcMessages, lcMessages);\n locale.setCategoryLocale(MLocale::MLcTime, lcTime);\n locale.setCategoryLocale(MLocale::MLcNumeric, lcNumeric);\n locale.setCalendarType(MLocale::GregorianCalendar);\n MCalendar mcal(locale);\n int year = 2008;\n int month = 7;\n int day = 21;\n int hour = 14;\n int minute = 31;\n int second = 3;\n mcal.setDate(year, month, day);\n mcal.setTime(hour, minute, second);\n QDate date(year, month, day);\n QTime time(hour, minute, second);\n QDateTime datetime(date, time, Qt::LocalTime);\n QLocale qlocale(language);\n QString format(\"%r\");\n QString result(\"٢:٣١ م\");\n QCOMPARE(locale.formatDateTime(mcal, format), result);\n QCOMPARE(locale.formatDateTime(datetime, format), result);\n\n QBENCHMARK {\n locale.formatDateTime(mcal, format);\n }\n}\n\nvoid Pt_MCalendar::benchmarkFormatDateTimePosixFormatString_R_MCalendar()\n{\n QString language(\"en_US\"); \/\/ will be overridden\n QString lcMessages(\"en_US\"); \/\/ should not matter\n QString lcTime(\"ar_SA\"); \/\/ this overrides language\n QString lcNumeric(\"ar_SA\"); \/\/ does matter, overrides localized numbers in dates\n MLocale locale(language);\n locale.setCategoryLocale(MLocale::MLcMessages, lcMessages);\n locale.setCategoryLocale(MLocale::MLcTime, lcTime);\n locale.setCategoryLocale(MLocale::MLcNumeric, lcNumeric);\n locale.setCalendarType(MLocale::GregorianCalendar);\n MCalendar mcal(locale);\n int year = 2008;\n int month = 7;\n int day = 21;\n int hour = 14;\n int minute = 31;\n int second = 3;\n mcal.setDate(year, month, day);\n mcal.setTime(hour, minute, second);\n QDate date(year, month, day);\n QTime time(hour, minute, second);\n QDateTime datetime(date, time, Qt::LocalTime);\n QLocale qlocale(language);\n QString format(\"%R\");\n QString result(\"١٤:٣١\");\n QCOMPARE(locale.formatDateTime(mcal, format), result);\n QCOMPARE(locale.formatDateTime(datetime, format), result);\n\n QBENCHMARK {\n locale.formatDateTime(mcal, format);\n }\n}\n\nvoid Pt_MCalendar::benchmarkFormatDateTimePosixFormatString_t_MCalendar()\n{\n QString language(\"en_US\"); \/\/ will be overridden\n QString lcMessages(\"en_US\"); \/\/ should not matter\n QString lcTime(\"ar_SA\"); \/\/ this overrides language\n QString lcNumeric(\"ar_SA\"); \/\/ does matter, overrides localized numbers in dates\n MLocale locale(language);\n locale.setCategoryLocale(MLocale::MLcMessages, lcMessages);\n locale.setCategoryLocale(MLocale::MLcTime, lcTime);\n locale.setCategoryLocale(MLocale::MLcNumeric, lcNumeric);\n locale.setCalendarType(MLocale::GregorianCalendar);\n MCalendar mcal(locale);\n int year = 2008;\n int month = 7;\n int day = 21;\n int hour = 14;\n int minute = 31;\n int second = 3;\n mcal.setDate(year, month, day);\n mcal.setTime(hour, minute, second);\n QDate date(year, month, day);\n QTime time(hour, minute, second);\n QDateTime datetime(date, time, Qt::LocalTime);\n QLocale qlocale(language);\n QString format(\"%t\");\n QString result(\"\\t\");\n QCOMPARE(locale.formatDateTime(mcal, format), result);\n QCOMPARE(locale.formatDateTime(datetime, format), result);\n\n QBENCHMARK {\n locale.formatDateTime(mcal, format);\n }\n}\n\nvoid Pt_MCalendar::benchmarkIcuFormatString()\n{\n QString language(\"en_US\"); \/\/ will be overridden\n QString lcMessages(\"en_US\"); \/\/ should not matter\n QString lcTime(\"fi_FI\"); \/\/ this overrides language\n QString lcNumeric(\"en_US\"); \/\/ should not matter, no localized numbers involved\n MLocale locale(language);\n locale.setCategoryLocale(MLocale::MLcMessages, lcMessages);\n locale.setCategoryLocale(MLocale::MLcTime, lcTime);\n locale.setCategoryLocale(MLocale::MLcNumeric, lcNumeric);\n locale.setCalendarType(MLocale::IslamicCalendar); \/\/ should not matter\n QCOMPARE(locale.icuFormatString(\n MLocale::DateFull,\n MLocale::TimeFull,\n MLocale::GregorianCalendar),\n QString(\"cccc d. MMMM y H:mm:ss zzzz\"));\n\n QBENCHMARK {\n locale.icuFormatString(\n MLocale::DateFull,\n MLocale::TimeFull,\n MLocale::GregorianCalendar);\n }\n}\n\nvoid Pt_MCalendar::benchmarkFormatDateTime()\n{\n QString language(\"en_US\"); \/\/ will be overridden\n QString lcMessages(\"en_US\"); \/\/ should not matter\n QString lcTime(\"fi_FI\"); \/\/ this overrides language\n QString lcNumeric(\"en_US\"); \/\/ should not matter, no localized numbers involved\n MLocale locale(language);\n locale.setCategoryLocale(MLocale::MLcMessages, lcMessages);\n locale.setCategoryLocale(MLocale::MLcTime, lcTime);\n locale.setCategoryLocale(MLocale::MLcNumeric, lcNumeric);\n MCalendar::setSystemTimeZone(\"Europe\/Helsinki\");\n MCalendar calendar;\n calendar.setDateTime(QDateTime(QDate(2010, 7, 13),\n QTime(14, 51, 07, 0),\n Qt::LocalTime));\n\n QCOMPARE(locale.formatDateTime(\n calendar, MLocale::DateFull, MLocale::TimeFull),\n QString(\"tiistai 13. heinäkuuta 2010 14:51:07 Itä-Euroopan kesäaika\"));\n\n QBENCHMARK {\n locale.formatDateTime(\n calendar, MLocale::DateFull, MLocale::TimeFull);\n }\n}\n\nQTEST_APPLESS_MAIN(Pt_MCalendar);\n\n<|endoftext|>"} {"text":"<commit_before>#include \"Component.h\"\n#include \"Simulation.h\"\n#include \"MooseApp.h\"\n\nunsigned int Component::subdomain_ids = 0;\nunsigned int Component::bc_ids = 0;\n\ntemplate<>\nInputParameters validParams<Component>()\n{\n InputParameters params = validParams<R7Object>();\n params.addPrivateParam<Simulation *>(\"_sim\");\n\n params.addParam<std::string>(\"physics_input_file\", \"Input file with physics\");\n params.addPrivateParam<std::string>(\"built_by_action\", \"add_component\");\n\n return params;\n}\n\n\/*\n * Class used by Component class to map vector variables through friendly names\n * i.e. friendly name = inlet:K_loss; variableName = K_loss, position = 1\n *\/\nRavenMapContainer::RavenMapContainer()\n{\n}\n\/*\n * CHANGE VARIABLENAME to ControllableName\n *\/\nRavenMapContainer::RavenMapContainer(const std::string & controllableParName, unsigned int & position):\n _controllableParName(controllableParName),\n _position(position)\n{\n}\nRavenMapContainer::~RavenMapContainer(){\n}\nconst std::string &\nRavenMapContainer::getControllableParName(){\n return _controllableParName;\n}\nunsigned int &\nRavenMapContainer::getControllableParPosition(){\n return _position;\n}\n\n\/*\n * Component implementation\n *\/\nstatic unsigned int comp_id = 0;\n\nstd::string\nComponent::genName(const std::string & prefix, unsigned int id, const std::string & suffix)\n{\n std::stringstream ss;\n ss << prefix << id << suffix;\n return ss.str();\n}\n\nstd::string\nComponent::genName(const std::string & prefix, const std::string & suffix)\n{\n std::stringstream ss;\n ss << prefix << \":\" << suffix;\n return ss.str();\n}\nstd::string\nComponent::genName(const std::string & prefix, const std::string & middle, const std::string & suffix)\n{\n std::stringstream ss;\n ss << prefix << middle << suffix;\n return ss.str();\n}\n\nstd::vector<std::string>\nComponent::split(const std::string & rname)\n{\n std::vector<std::string> splitted;\n MooseUtils::tokenize(rname, splitted, 1, \":\");\n\n std::string section_name(\"\");\n for (unsigned int i = 0; i < splitted.size() - 1; i++)\n {\n if (i > 0)\n section_name.append(\":\");\n section_name.append(splitted[i]);\n }\n std::string prop_name = splitted[splitted.size() - 1];\n\n \/\/ construct the 2 element array with section and property name\n std::vector<std::string> result(2);\n result[0] = section_name;\n result[1] = prop_name;\n\n return result;\n}\n\nComponent::Component(const std::string & name, InputParameters parameters) :\n R7Object(name, parameters),\n _id(comp_id++),\n _parent(parameters.have_parameter<Component *>(\"_parent\") ? getParam<Component *>(\"_parent\") : NULL),\n _sim(*getParam<Simulation *>(\"_sim\")),\n _factory(_app.getFactory()),\n _mesh(_sim.mesh()),\n _phys_mesh(_sim.physicalMesh()),\n\n _input_file_name(getParam<std::string>(\"physics_input_file\")),\n\n _zero(_sim._zero)\n{\n}\n\nComponent::~Component()\n{\n}\n\nvoid\nComponent::init()\n{\n}\n\nunsigned int\nComponent::getNextSubdomainId()\n{\n unsigned int sd_id = subdomain_ids++;\n _subdomains.push_back(sd_id);\n if (_parent)\n _parent->_subdomains.push_back(sd_id);\n return sd_id;\n}\n\nunsigned int\nComponent::getNextBCId()\n{\n unsigned int id = bc_ids++;\n return id;\n}\n\nvoid\nComponent::aliasParam(const std::string & rname, const std::string & name, Component * comp\/* = NULL*\/)\n{\n if (comp == NULL)\n _param_alias_map[rname] = std::pair<Component *, std::string>(this, name);\n else\n _param_alias_map[rname] = std::pair<Component *, std::string>(comp, name);\n}\n\nvoid\nComponent::aliasVectorParam(const std::string & rname, const std::string & name, unsigned int pos, Component * \/*comp = NULL*\/)\n{\n createVectorControllableParMapping(rname, name, pos);\n}\n\nvoid\nComponent::connectObject(const std::string & rname, const std::string & mooseName, const std::string & name)\n{\n RavenNameEntry rne(mooseName, name);\n _rname_map[rname][name].push_back(rne);\n}\n\nvoid\nComponent::connectObject(const std::string & rname, const std::string & mooseName, const std::string & name, const std::string & par_name)\n{\n RavenNameEntry rne(mooseName, par_name);\n _rname_map[rname][name].push_back(rne);\n}\n\n\nvoid\nComponent::createVectorControllableParMapping(const std::string & rname, const std::string & mooseName, unsigned int pos)\n{\n _rvect_map[rname] = RavenMapContainer(mooseName, pos);\n}\n<commit_msg>genName() is using ':' as a separator in all variants (refs idaholab\/relap-7#2293)<commit_after>#include \"Component.h\"\n#include \"Simulation.h\"\n#include \"MooseApp.h\"\n\nunsigned int Component::subdomain_ids = 0;\nunsigned int Component::bc_ids = 0;\n\ntemplate<>\nInputParameters validParams<Component>()\n{\n InputParameters params = validParams<R7Object>();\n params.addPrivateParam<Simulation *>(\"_sim\");\n\n params.addParam<std::string>(\"physics_input_file\", \"Input file with physics\");\n params.addPrivateParam<std::string>(\"built_by_action\", \"add_component\");\n\n return params;\n}\n\n\/*\n * Class used by Component class to map vector variables through friendly names\n * i.e. friendly name = inlet:K_loss; variableName = K_loss, position = 1\n *\/\nRavenMapContainer::RavenMapContainer()\n{\n}\n\/*\n * CHANGE VARIABLENAME to ControllableName\n *\/\nRavenMapContainer::RavenMapContainer(const std::string & controllableParName, unsigned int & position):\n _controllableParName(controllableParName),\n _position(position)\n{\n}\nRavenMapContainer::~RavenMapContainer(){\n}\nconst std::string &\nRavenMapContainer::getControllableParName(){\n return _controllableParName;\n}\nunsigned int &\nRavenMapContainer::getControllableParPosition(){\n return _position;\n}\n\n\/*\n * Component implementation\n *\/\nstatic unsigned int comp_id = 0;\n\nstd::string\nComponent::genName(const std::string & prefix, unsigned int id, const std::string & suffix)\n{\n std::stringstream ss;\n ss << prefix << \":\" << id << \":\" << suffix;\n return ss.str();\n}\n\nstd::string\nComponent::genName(const std::string & prefix, const std::string & suffix)\n{\n std::stringstream ss;\n ss << prefix << \":\" << suffix;\n return ss.str();\n}\nstd::string\nComponent::genName(const std::string & prefix, const std::string & middle, const std::string & suffix)\n{\n std::stringstream ss;\n ss << prefix << \":\" << middle << \":\" << suffix;\n return ss.str();\n}\n\nstd::vector<std::string>\nComponent::split(const std::string & rname)\n{\n std::vector<std::string> splitted;\n MooseUtils::tokenize(rname, splitted, 1, \":\");\n\n std::string section_name(\"\");\n for (unsigned int i = 0; i < splitted.size() - 1; i++)\n {\n if (i > 0)\n section_name.append(\":\");\n section_name.append(splitted[i]);\n }\n std::string prop_name = splitted[splitted.size() - 1];\n\n \/\/ construct the 2 element array with section and property name\n std::vector<std::string> result(2);\n result[0] = section_name;\n result[1] = prop_name;\n\n return result;\n}\n\nComponent::Component(const std::string & name, InputParameters parameters) :\n R7Object(name, parameters),\n _id(comp_id++),\n _parent(parameters.have_parameter<Component *>(\"_parent\") ? getParam<Component *>(\"_parent\") : NULL),\n _sim(*getParam<Simulation *>(\"_sim\")),\n _factory(_app.getFactory()),\n _mesh(_sim.mesh()),\n _phys_mesh(_sim.physicalMesh()),\n\n _input_file_name(getParam<std::string>(\"physics_input_file\")),\n\n _zero(_sim._zero)\n{\n}\n\nComponent::~Component()\n{\n}\n\nvoid\nComponent::init()\n{\n}\n\nunsigned int\nComponent::getNextSubdomainId()\n{\n unsigned int sd_id = subdomain_ids++;\n _subdomains.push_back(sd_id);\n if (_parent)\n _parent->_subdomains.push_back(sd_id);\n return sd_id;\n}\n\nunsigned int\nComponent::getNextBCId()\n{\n unsigned int id = bc_ids++;\n return id;\n}\n\nvoid\nComponent::aliasParam(const std::string & rname, const std::string & name, Component * comp\/* = NULL*\/)\n{\n if (comp == NULL)\n _param_alias_map[rname] = std::pair<Component *, std::string>(this, name);\n else\n _param_alias_map[rname] = std::pair<Component *, std::string>(comp, name);\n}\n\nvoid\nComponent::aliasVectorParam(const std::string & rname, const std::string & name, unsigned int pos, Component * \/*comp = NULL*\/)\n{\n createVectorControllableParMapping(rname, name, pos);\n}\n\nvoid\nComponent::connectObject(const std::string & rname, const std::string & mooseName, const std::string & name)\n{\n RavenNameEntry rne(mooseName, name);\n _rname_map[rname][name].push_back(rne);\n}\n\nvoid\nComponent::connectObject(const std::string & rname, const std::string & mooseName, const std::string & name, const std::string & par_name)\n{\n RavenNameEntry rne(mooseName, par_name);\n _rname_map[rname][name].push_back(rne);\n}\n\n\nvoid\nComponent::createVectorControllableParMapping(const std::string & rname, const std::string & mooseName, unsigned int pos)\n{\n _rvect_map[rname] = RavenMapContainer(mooseName, pos);\n}\n<|endoftext|>"} {"text":"<commit_before>#include <itkMesh.h>\n#include <itkTransformMeshFilter.h>\n#include <itkLBFGSOptimizer.h>\n\n#include \"itkGMMPointSetToPointSetRegistrationMethod.h\"\n#include \"itkPointSetPropertiesCalculator.h\"\n#include \"itkInitializeTransform.h\"\n#include \"itkInitializeMetric.h\"\n#include \"itkPointSetToPointSetMetrics.h\"\n\n#include \"itkIOutils.h\"\n#include \"argsCustomParsers.h\"\n\nconst unsigned int Dimension = 3;\ntypedef itk::Mesh<float, Dimension> MeshType;\ntypedef itk::PointSet<MeshType::PixelType, MeshType::PointDimension> PointSetType;\ntypedef itk::Transform <double, MeshType::PointDimension, MeshType::PointDimension> TransformType;\n\nint main(int argc, char** argv) {\n\n \/\/ parse input arguments\n args::ArgumentParser parser(\"GMM-based point set to point set registration.\", \"\");\n args::HelpFlag help(parser, \"help\", \"Display this help menu\", {'h', \"help\"});\n\n args::Group allRequired(parser, \"Required arguments:\", args::Group::Validators::All);\n\n args::ValueFlag<std::string> argFixedFileName(allRequired, \"fixed\", \"The fixed mesh (point-set) filename\", {'f', \"fixed\"});\n args::ValueFlag<std::string> argMovingFileName(allRequired, \"moving\", \"The moving mesh (point-set) filename\", {'m', \"moving\"});\n args::ValueFlag<std::string> argOutputFileName(parser, \"output\", \"The output mesh (point-set) filename\", {'o', \"output\"});\n\n args::ValueFlag<std::vector<double>, args::DoubleVectorReader> argScale(allRequired, \"scale\", \"The scale levels\", {\"scale\"});\n args::ValueFlag<size_t> argNumberOfIterations(parser, \"iterations\", \"The number of iterations\", {\"iterations\"}, 1000);\n args::Flag trace(parser, \"trace\", \"Optimizer iterations tracing\", {\"trace\"});\n\n const std::string transformDescription =\n \"The type of transform (That is number):\\n\"\n \" 0 : Translation\\n\"\n \" 1 : Versor3D\\n\"\n \" 2 : Similarity\\n\"\n \" 3 : ScaleSkewVersor3D\\n\";\n\n args::ValueFlag<size_t> argTypeOfTransform(parser, \"transform\", transformDescription, {'t', \"transform\"}, 0);\n \n const std::string metricDescription =\n \"The type of metric (That is number):\\n\"\n \" 0 : L2Rigid\\n\"\n \" 1 : L2\\n\"\n \" 2 : KC\\n\";\n\n args::ValueFlag<size_t> argTypeOfMetric(parser, \"metric\", metricDescription, {'M', \"metric\"}, 0);\n\n try {\n parser.ParseCLI(argc, argv);\n }\n catch (args::Help) {\n std::cout << parser;\n return EXIT_SUCCESS;\n }\n catch (args::ParseError e) {\n std::cerr << e.what() << std::endl;\n std::cerr << parser;\n return EXIT_FAILURE;\n }\n catch (args::ValidationError e) {\n std::cerr << e.what() << std::endl;\n std::cerr << parser;\n return EXIT_FAILURE;\n }\n\n std::string fixedFileName = args::get(argFixedFileName);\n std::string movingFileName = args::get(argMovingFileName);\n size_t numberOfIterations = args::get(argNumberOfIterations);\n size_t typeOfTransform = args::get(argTypeOfTransform);\n size_t typeOfMetric = args::get(argTypeOfMetric);\n\n std::cout << \"options\" << std::endl;\n std::cout << \"number of iterations \" << numberOfIterations << std::endl;\n std::cout << std::endl;\n\n \/\/--------------------------------------------------------------------\n \/\/ read meshes\n MeshType::Pointer fixedMesh = MeshType::New();\n if (!readMesh<MeshType>(fixedMesh, fixedFileName)) {\n return EXIT_FAILURE;\n }\n\n std::cout << fixedFileName << std::endl;\n std::cout << \"number of points \" << fixedMesh->GetNumberOfPoints() << std::endl;\n std::cout << std::endl;\n\n MeshType::Pointer movingMesh = MeshType::New();\n if (!readMesh<MeshType>(movingMesh, movingFileName)) {\n return EXIT_FAILURE;\n }\n\n std::cout << movingFileName << std::endl;\n std::cout << \"number of points \" << movingMesh->GetNumberOfPoints() << std::endl;\n std::cout << std::endl;\n\n PointSetType::Pointer fixedPointSet = PointSetType::New();\n fixedPointSet->SetPoints(fixedMesh->GetPoints());\n\n PointSetType::Pointer movingPointSet = PointSetType::New();\n movingPointSet->SetPoints(movingMesh->GetPoints());\n\n \/\/--------------------------------------------------------------------\n \/\/ initialize scales\n typedef itk::PointSetPropertiesCalculator<PointSetType> PointSetPropertiesCalculatorType;\n PointSetPropertiesCalculatorType::Pointer fixedPointSetCalculator = PointSetPropertiesCalculatorType::New();\n fixedPointSetCalculator->SetPointSet(fixedPointSet);\n fixedPointSetCalculator->Compute();\n fixedPointSetCalculator->PrintReport(std::cout);\n\n PointSetPropertiesCalculatorType::Pointer movingPointSetCalculator = PointSetPropertiesCalculatorType::New();\n movingPointSetCalculator->SetPointSet(movingPointSet);\n movingPointSetCalculator->Compute();\n movingPointSetCalculator->PrintReport(std::cout);\n\n itk::Array<double> scale(args::get(argScale).size());\n for (size_t n = 0; n < scale.size(); ++n) {\n scale[n] = args::get(argScale)[n] * movingPointSetCalculator->GetScale();\n }\n\n \/\/ initialize transform\n typedef itk::VersorRigid3DTransform<double> InitialTransformType;\n InitialTransformType::Pointer fixedInitialTransform = InitialTransformType::New();\n fixedInitialTransform->SetCenter(fixedPointSetCalculator->GetCenter());\n fixedInitialTransform->SetIdentity();\n\n InitialTransformType::Pointer movingInitialTransform = InitialTransformType::New();\n movingInitialTransform->SetCenter(movingPointSetCalculator->GetCenter());\n movingInitialTransform->SetIdentity();\n\n typedef itk::InitializeTransform<double> TransformInitializerType;\n TransformInitializerType::Pointer transformInitializer = TransformInitializerType::New();\n transformInitializer->SetMovingLandmark(movingPointSetCalculator->GetCenter());\n transformInitializer->SetFixedLandmark(fixedPointSetCalculator->GetCenter());\n transformInitializer->SetTypeOfTransform(typeOfTransform);\n transformInitializer->Update();\n TransformType::Pointer transform = transformInitializer->GetTransform();\n\n \/\/--------------------------------------------------------------------\n \/\/ initialize optimizer\n typedef itk::LBFGSOptimizer OptimizerType;\n OptimizerType::Pointer optimizer = OptimizerType::New();\n optimizer->SetMaximumNumberOfFunctionEvaluations(numberOfIterations);\n optimizer->SetScales(transformInitializer->GetScales());\n optimizer->SetTrace(trace);\n optimizer->MinimizeOn();\n\n \/\/--------------------------------------------------------------------\n \/\/ metric\n typedef itk::InitializeMetric<PointSetType, PointSetType> InitializeMetricType;\n InitializeMetricType::Pointer metricInitializer = InitializeMetricType::New();\n metricInitializer->SetTypeOfMetric(typeOfMetric);\n try {\n metricInitializer->Initialize();\n }\n catch (itk::ExceptionObject& excep) {\n std::cerr << excep << std::endl;\n return EXIT_FAILURE;\n }\n\n \/\/--------------------------------------------------------------------\n \/\/ perform registration\n typedef itk::GMMPointSetToPointSetRegistrationMethod<PointSetType, PointSetType> GMMPointSetToPointSetRegistrationMethodType;\n GMMPointSetToPointSetRegistrationMethodType::Pointer registration = GMMPointSetToPointSetRegistrationMethodType::New();\n registration->SetFixedPointSet(fixedPointSet);\n registration->SetFixedInitialTransform(fixedInitialTransform);\n registration->SetMovingPointSet(movingPointSet);\n registration->SetMovingInitialTransform(movingInitialTransform);\n registration->SetScale(scale);\n registration->SetOptimizer(optimizer);\n registration->SetMetric(metricInitializer->GetMetric());\n registration->SetTransform(transform);\n try {\n registration->Update();\n }\n catch (itk::ExceptionObject& excep) {\n std::cerr << excep << std::endl;\n return EXIT_FAILURE;\n }\n\n std::cout << std::endl;\n std::cout << \"optimizer \" << registration->GetOptimizer()->GetNameOfClass() << std::endl;\n std::cout << \" scales \" << registration->GetOptimizer()->GetScales() << std::endl;\n std::cout << std::endl;\n std::cout << \"transform \" << registration->GetTransform()->GetNameOfClass() << std::endl;\n std::cout << \"Initial transform parameters \" << registration->GetInitialTransformParameters() << std::endl;\n std::cout << \" Final transform parameters \" << registration->GetFinalTransformParameters() << std::endl;\n std::cout << std::endl;\n std::cout << \"metric \" << registration->GetMetric()->GetNameOfClass() << std::endl;\n std::cout << \" Initial metric parameters \" << registration->GetInitialMetricValues() << std::endl;\n std::cout << \" Final metric parameters \" << registration->GetFinalMetricValues() << std::endl;\n std::cout << std::endl;\n\n \/\/ transform moving mesh\n typedef itk::TransformMeshFilter<MeshType, MeshType, TransformType> TransformMeshFilterType;\n TransformMeshFilterType::Pointer transformMesh = TransformMeshFilterType::New();\n transformMesh->SetInput(movingMesh);\n transformMesh->SetTransform(transform);\n try {\n transformMesh->Update();\n }\n catch (itk::ExceptionObject& excep) {\n std::cerr << excep << std::endl;\n return EXIT_FAILURE;\n }\n\n if (argOutputFileName) {\n std::string fileName = args::get(argOutputFileName);\n std::cout << \"write output mesh to the file \" << fileName << std::endl;\n std::cout << std::endl;\n\n if (!writeMesh<MeshType>(transformMesh->GetOutput(), fileName)) {\n return EXIT_FAILURE;\n }\n }\n\n PointSetType::Pointer outputPointSet = transformMesh->GetOutput();\n\n \/\/ compute metrics\n typedef itk::PointSetToPointSetMetrics<PointSetType> PointSetToPointSetMetricsType;\n PointSetToPointSetMetricsType::Pointer metrics = PointSetToPointSetMetricsType::New();\n metrics->SetFixedPointSet(fixedPointSet);\n metrics->SetMovingPointSet(movingPointSet);\n metrics->Compute();\n metrics->PrintReport(std::cout);\n\n metrics->SetFixedPointSet(fixedPointSet);\n metrics->SetMovingPointSet(outputPointSet);\n metrics->Compute();\n metrics->PrintReport(std::cout);\n\n return EXIT_SUCCESS;\n}\n<commit_msg>refactoring<commit_after>#include <itkMesh.h>\n#include <itkTransformMeshFilter.h>\n#include <itkLBFGSOptimizer.h>\n\n#include \"itkGMMPointSetToPointSetRegistrationMethod.h\"\n#include \"itkPointSetPropertiesCalculator.h\"\n#include \"itkInitializeTransform.h\"\n#include \"itkInitializeMetric.h\"\n#include \"itkPointSetToPointSetMetrics.h\"\n\n#include \"itkIOutils.h\"\n#include \"argsCustomParsers.h\"\n\nconst unsigned int Dimension = 3;\ntypedef itk::Mesh<float, Dimension> MeshType;\ntypedef itk::PointSet<MeshType::PixelType, MeshType::PointDimension> PointSetType;\ntypedef itk::Transform <double, MeshType::PointDimension, MeshType::PointDimension> TransformType;\n\nint main(int argc, char** argv) {\n\n \/\/ parse input arguments\n args::ArgumentParser parser(\"GMM-based point set to point set registration.\", \"\");\n args::HelpFlag help(parser, \"help\", \"Display this help menu\", {'h', \"help\"});\n\n args::Group allRequired(parser, \"Required arguments:\", args::Group::Validators::All);\n\n args::ValueFlag<std::string> argFixedFileName(allRequired, \"fixed\", \"The fixed mesh (point-set) filename\", {'f', \"fixed\"});\n args::ValueFlag<std::string> argMovingFileName(allRequired, \"moving\", \"The moving mesh (point-set) filename\", {'m', \"moving\"});\n args::ValueFlag<std::string> argOutputFileName(parser, \"output\", \"The output mesh (point-set) filename\", {'o', \"output\"});\n\n args::ValueFlag<std::vector<double>, args::DoubleVectorReader> argScale(allRequired, \"scale\", \"The scale levels\", {\"scale\"});\n args::ValueFlag<size_t> argNumberOfIterations(parser, \"iterations\", \"The number of iterations\", {\"iterations\"}, 1000);\n args::Flag trace(parser, \"trace\", \"Optimizer iterations tracing\", {\"trace\"});\n\n const std::string transformDescription =\n \"The type of transform (That is number):\\n\"\n \" 0 : Translation\\n\"\n \" 1 : Versor3D\\n\"\n \" 2 : Similarity\\n\"\n \" 3 : ScaleSkewVersor3D\\n\";\n\n args::ValueFlag<size_t> argTypeOfTransform(parser, \"transform\", transformDescription, {'t', \"transform\"}, 0);\n \n const std::string metricDescription =\n \"The type of metric (That is number):\\n\"\n \" 0 : L2Rigid\\n\"\n \" 1 : L2\\n\"\n \" 2 : KC\\n\";\n\n args::ValueFlag<size_t> argTypeOfMetric(parser, \"metric\", metricDescription, {'M', \"metric\"}, 0);\n\n try {\n parser.ParseCLI(argc, argv);\n }\n catch (args::Help) {\n std::cout << parser;\n return EXIT_SUCCESS;\n }\n catch (args::ParseError e) {\n std::cerr << e.what() << std::endl;\n std::cerr << parser;\n return EXIT_FAILURE;\n }\n catch (args::ValidationError e) {\n std::cerr << e.what() << std::endl;\n std::cerr << parser;\n return EXIT_FAILURE;\n }\n\n std::string fixedFileName = args::get(argFixedFileName);\n std::string movingFileName = args::get(argMovingFileName);\n size_t numberOfIterations = args::get(argNumberOfIterations);\n size_t typeOfTransform = args::get(argTypeOfTransform);\n size_t typeOfMetric = args::get(argTypeOfMetric);\n\n std::cout << \"options\" << std::endl;\n std::cout << \"number of iterations \" << numberOfIterations << std::endl;\n std::cout << std::endl;\n\n \/\/--------------------------------------------------------------------\n \/\/ read meshes\n MeshType::Pointer fixedMesh = MeshType::New();\n if (!readMesh<MeshType>(fixedMesh, fixedFileName)) {\n return EXIT_FAILURE;\n }\n\n std::cout << fixedFileName << std::endl;\n std::cout << \"number of points \" << fixedMesh->GetNumberOfPoints() << std::endl;\n std::cout << std::endl;\n\n MeshType::Pointer movingMesh = MeshType::New();\n if (!readMesh<MeshType>(movingMesh, movingFileName)) {\n return EXIT_FAILURE;\n }\n\n std::cout << movingFileName << std::endl;\n std::cout << \"number of points \" << movingMesh->GetNumberOfPoints() << std::endl;\n std::cout << std::endl;\n\n PointSetType::Pointer fixedPointSet = PointSetType::New();\n fixedPointSet->SetPoints(fixedMesh->GetPoints());\n\n PointSetType::Pointer movingPointSet = PointSetType::New();\n movingPointSet->SetPoints(movingMesh->GetPoints());\n\n \/\/--------------------------------------------------------------------\n \/\/ initialize scales\n typedef itk::PointSetPropertiesCalculator<PointSetType> PointSetPropertiesCalculatorType;\n PointSetPropertiesCalculatorType::Pointer fixedPointSetCalculator = PointSetPropertiesCalculatorType::New();\n fixedPointSetCalculator->SetPointSet(fixedPointSet);\n fixedPointSetCalculator->Compute();\n fixedPointSetCalculator->PrintReport(std::cout);\n\n PointSetPropertiesCalculatorType::Pointer movingPointSetCalculator = PointSetPropertiesCalculatorType::New();\n movingPointSetCalculator->SetPointSet(movingPointSet);\n movingPointSetCalculator->Compute();\n movingPointSetCalculator->PrintReport(std::cout);\n\n itk::Array<double> scale(args::get(argScale).size());\n for (size_t n = 0; n < scale.size(); ++n) {\n scale[n] = args::get(argScale)[n] * movingPointSetCalculator->GetScale();\n }\n\n \/\/ initialize transform\n typedef itk::VersorRigid3DTransform<double> InitialTransformType;\n InitialTransformType::Pointer fixedInitialTransform = InitialTransformType::New();\n fixedInitialTransform->SetCenter(fixedPointSetCalculator->GetCenter());\n fixedInitialTransform->SetIdentity();\n\n InitialTransformType::Pointer movingInitialTransform = InitialTransformType::New();\n movingInitialTransform->SetCenter(movingPointSetCalculator->GetCenter());\n movingInitialTransform->SetIdentity();\n\n typedef itk::InitializeTransform<double> TransformInitializerType;\n TransformInitializerType::Pointer transformInitializer = TransformInitializerType::New();\n transformInitializer->SetMovingLandmark(movingPointSetCalculator->GetCenter());\n transformInitializer->SetFixedLandmark(fixedPointSetCalculator->GetCenter());\n transformInitializer->SetTypeOfTransform(typeOfTransform);\n transformInitializer->Update();\n TransformType::Pointer transform = transformInitializer->GetTransform();\n\n \/\/--------------------------------------------------------------------\n \/\/ initialize optimizer\n typedef itk::LBFGSOptimizer OptimizerType;\n OptimizerType::Pointer optimizer = OptimizerType::New();\n optimizer->SetMaximumNumberOfFunctionEvaluations(numberOfIterations);\n optimizer->SetScales(transformInitializer->GetScales());\n optimizer->SetTrace(trace);\n optimizer->MinimizeOn();\n\n \/\/--------------------------------------------------------------------\n \/\/ metric\n typedef itk::InitializeMetric<PointSetType, PointSetType> InitializeMetricType;\n InitializeMetricType::Pointer metricInitializer = InitializeMetricType::New();\n metricInitializer->SetTypeOfMetric(typeOfMetric);\n try {\n metricInitializer->Initialize();\n }\n catch (itk::ExceptionObject& excep) {\n std::cerr << excep << std::endl;\n return EXIT_FAILURE;\n }\n\n \/\/--------------------------------------------------------------------\n \/\/ perform registration\n typedef itk::GMMPointSetToPointSetRegistrationMethod<PointSetType, PointSetType> GMMPointSetToPointSetRegistrationMethodType;\n GMMPointSetToPointSetRegistrationMethodType::Pointer registration = GMMPointSetToPointSetRegistrationMethodType::New();\n registration->SetFixedPointSet(fixedPointSet);\n registration->SetFixedInitialTransform(fixedInitialTransform);\n registration->SetMovingPointSet(movingPointSet);\n registration->SetMovingInitialTransform(movingInitialTransform);\n registration->SetScale(scale);\n registration->SetOptimizer(optimizer);\n registration->SetMetric(metricInitializer->GetMetric());\n registration->SetTransform(transform);\n try {\n registration->Update();\n }\n catch (itk::ExceptionObject& excep) {\n std::cerr << excep << std::endl;\n return EXIT_FAILURE;\n }\n\n std::cout << std::endl;\n std::cout << \"optimizer \" << registration->GetOptimizer()->GetNameOfClass() << std::endl;\n std::cout << \" scales \" << registration->GetOptimizer()->GetScales() << std::endl;\n std::cout << std::endl;\n std::cout << \"transform \" << registration->GetTransform()->GetNameOfClass() << std::endl;\n std::cout << \"Initial transform parameters \" << registration->GetInitialTransformParameters() << std::endl;\n std::cout << \" Final transform parameters \" << registration->GetFinalTransformParameters() << std::endl;\n std::cout << std::endl;\n std::cout << \"metric \" << registration->GetMetric()->GetNameOfClass() << std::endl;\n std::cout << \" Initial metric values \" << registration->GetInitialMetricValues() << std::endl;\n std::cout << \" Final metric values \" << registration->GetFinalMetricValues() << std::endl;\n std::cout << std::endl;\n\n \/\/ transform moving mesh\n typedef itk::TransformMeshFilter<MeshType, MeshType, TransformType> TransformMeshFilterType;\n TransformMeshFilterType::Pointer transformMesh = TransformMeshFilterType::New();\n transformMesh->SetInput(movingMesh);\n transformMesh->SetTransform(transform);\n try {\n transformMesh->Update();\n }\n catch (itk::ExceptionObject& excep) {\n std::cerr << excep << std::endl;\n return EXIT_FAILURE;\n }\n\n if (argOutputFileName) {\n std::string fileName = args::get(argOutputFileName);\n std::cout << \"write output mesh to the file \" << fileName << std::endl;\n std::cout << std::endl;\n\n if (!writeMesh<MeshType>(transformMesh->GetOutput(), fileName)) {\n return EXIT_FAILURE;\n }\n }\n\n PointSetType::Pointer outputPointSet = transformMesh->GetOutput();\n\n \/\/ compute metrics\n typedef itk::PointSetToPointSetMetrics<PointSetType> PointSetToPointSetMetricsType;\n PointSetToPointSetMetricsType::Pointer metrics = PointSetToPointSetMetricsType::New();\n metrics->SetFixedPointSet(fixedPointSet);\n metrics->SetMovingPointSet(movingPointSet);\n metrics->Compute();\n metrics->PrintReport(std::cout);\n\n metrics->SetFixedPointSet(fixedPointSet);\n metrics->SetMovingPointSet(outputPointSet);\n metrics->Compute();\n metrics->PrintReport(std::cout);\n\n return EXIT_SUCCESS;\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 \"SphereMeshGenerator.h\"\n#include \"CastUniquePointer.h\"\n\n\/\/ libMesh includes\n#include \"libmesh\/mesh_generation.h\"\n\nregisterMooseObject(\"MooseApp\", SphereMeshGenerator);\n\nInputParameters\nSphereMeshGenerator::validParams()\n{\n InputParameters params = MeshGenerator::validParams();\n params.addClassDescription(\"Generate a 3-D sphere mesh centered on the origin\");\n params.addRequiredRangeCheckedParam<Real>(\"radius\", \"radius > 0.0\", \"Sphere radius\");\n params.addRequiredRangeCheckedParam<unsigned int>(\"nr\", \"nr > 0\", \"Number of radial elements\");\n\n MooseEnum types(\"HEX8 HEX27\", \"HEX8\");\n params.addParam<MooseEnum>(\"elem_type\", types, \"The type of element to generate\");\n params.addParam<unsigned int>(\"n_smooth\", 0, \"Number of smoothing operations\");\n return params;\n}\n\nSphereMeshGenerator::SphereMeshGenerator(const InputParameters & parameters)\n : MeshGenerator(parameters),\n _radius(getParam<Real>(\"radius\")),\n _nr(getParam<unsigned int>(\"nr\")),\n _elem_type(getParam<MooseEnum>(\"elem_type\")),\n _n_smooth(getParam<unsigned int>(\"n_smooth\"))\n{\n}\n\nstd::unique_ptr<MeshBase>\nSphereMeshGenerator::generate()\n{\n auto mesh = buildMeshBaseObject();\n mesh->set_mesh_dimension(3);\n mesh->set_spatial_dimension(3);\n\n ElemType et = Utility::string_to_enum<ElemType>(_elem_type);\n\n MeshTools::Generation::build_sphere(static_cast<UnstructuredMesh &>(*mesh),\n _radius,\n _nr,\n et,\n _n_smooth,\n false \/* dummy value; not used for 3-D meshes *\/);\n\n return dynamic_pointer_cast<MeshBase>(mesh);\n}\n<commit_msg>Add missing header file. Refs #22591<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 \"SphereMeshGenerator.h\"\n#include \"CastUniquePointer.h\"\n\n#include \"libmesh\/mesh_generation.h\"\n#include \"libmesh\/string_to_enum.h\"\n\nregisterMooseObject(\"MooseApp\", SphereMeshGenerator);\n\nInputParameters\nSphereMeshGenerator::validParams()\n{\n InputParameters params = MeshGenerator::validParams();\n params.addClassDescription(\"Generate a 3-D sphere mesh centered on the origin\");\n params.addRequiredRangeCheckedParam<Real>(\"radius\", \"radius > 0.0\", \"Sphere radius\");\n params.addRequiredRangeCheckedParam<unsigned int>(\"nr\", \"nr > 0\", \"Number of radial elements\");\n\n MooseEnum types(\"HEX8 HEX27\", \"HEX8\");\n params.addParam<MooseEnum>(\"elem_type\", types, \"The type of element to generate\");\n params.addParam<unsigned int>(\"n_smooth\", 0, \"Number of smoothing operations\");\n return params;\n}\n\nSphereMeshGenerator::SphereMeshGenerator(const InputParameters & parameters)\n : MeshGenerator(parameters),\n _radius(getParam<Real>(\"radius\")),\n _nr(getParam<unsigned int>(\"nr\")),\n _elem_type(getParam<MooseEnum>(\"elem_type\")),\n _n_smooth(getParam<unsigned int>(\"n_smooth\"))\n{\n}\n\nstd::unique_ptr<MeshBase>\nSphereMeshGenerator::generate()\n{\n auto mesh = buildMeshBaseObject();\n mesh->set_mesh_dimension(3);\n mesh->set_spatial_dimension(3);\n\n ElemType et = Utility::string_to_enum<ElemType>(_elem_type);\n\n MeshTools::Generation::build_sphere(static_cast<UnstructuredMesh &>(*mesh),\n _radius,\n _nr,\n et,\n _n_smooth,\n false \/* dummy value; not used for 3-D meshes *\/);\n\n return dynamic_pointer_cast<MeshBase>(mesh);\n}\n<|endoftext|>"} {"text":"<commit_before>\/*\n * This program is free software; you can redistribute it and\/or modify it under\n * the terms of the GNU General Public License as published by the Free Software\n * Foundation; version 3 of the License.\n *\n * This program is distributed in the hope that it will be useful, but WITHOUT\n * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS\n * FOR A PARTICULAR PURPOSE. See the GNU General Public License for more\n * details.\n *\/\n\n\n#include \"..\/dbmanager.h\"\n#include \"..\/iconmanager.h\"\n#include \"tablewidget.h\"\n\nTableWidget::TableWidget(QWidget *parent)\n : AbstractTabWidget(parent)\n{\n setupUi(this);\n\n setupWidgets();\n\n model = new QSqlTableModel(this);\n}\n\nTableWidget::TableWidget(QString table, QSqlDatabase *db, QWidget *parent)\n : AbstractTabWidget(parent)\n{\n setupUi(this);\n setupWidgets();\n setTable(table, db);\n}\n\nQIcon TableWidget::icon()\n{\n return IconManager::get(\"table\");\n}\n\nQString TableWidget::id()\n{\n return QString(\"t %1 on %2\")\n .arg(m_table)\n .arg(m_db->databaseName());\n}\n\nvoid TableWidget::refresh()\n{\n if(!m_db->isOpen())\n emit closeRequested();\n}\n\nvoid TableWidget::reload() {\n if(!m_db->isOpen())\n return;\n\n if(!m_db->tables(QSql::Tables).contains(m_table)\n && !m_db->tables(QSql::Views).contains(m_table)\n && !m_db->tables(QSql::SystemTables).contains(m_table)) {\n QMessageBox::critical(this,\n tr(\"Error\"),\n tr(\"Unable to open the table %1. \").append(\n tr(\"Check you have the necessary permissions.\"))\n .arg(m_table));\n emit closeRequested();\n return;\n }\n\n if (!tableView->setTable(m_table, m_db)) {\n emit closeRequested();\n }\n}\n\nvoid TableWidget::setTable( QString table, QSqlDatabase *db )\n{\n this->m_table = table;\n this->m_db = db;\n\n\/\/ reload();\n}\n\nvoid TableWidget::setupWidgets()\n{\n connect(tableView, SIGNAL(reloadRequested()), this, SLOT(reload()));\n}\n\nQString TableWidget::table()\n{\n return m_table;\n}\n<commit_msg>Gros bogue sur l'ouverture des tables<commit_after>\/*\n * This program is free software; you can redistribute it and\/or modify it under\n * the terms of the GNU General Public License as published by the Free Software\n * Foundation; version 3 of the License.\n *\n * This program is distributed in the hope that it will be useful, but WITHOUT\n * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS\n * FOR A PARTICULAR PURPOSE. See the GNU General Public License for more\n * details.\n *\/\n\n\n#include \"..\/dbmanager.h\"\n#include \"..\/iconmanager.h\"\n#include \"tablewidget.h\"\n\nTableWidget::TableWidget(QWidget *parent)\n : AbstractTabWidget(parent)\n{\n setupUi(this);\n\n setupWidgets();\n\n model = new QSqlTableModel(this);\n}\n\nTableWidget::TableWidget(QString table, QSqlDatabase *db, QWidget *parent)\n : AbstractTabWidget(parent)\n{\n setupUi(this);\n setupWidgets();\n setTable(table, db);\n}\n\nQIcon TableWidget::icon()\n{\n return IconManager::get(\"table\");\n}\n\nQString TableWidget::id()\n{\n return QString(\"t %1 on %2\")\n .arg(m_table)\n .arg(m_db->connectionName());\n}\n\nvoid TableWidget::refresh()\n{\n if(!m_db->isOpen())\n emit closeRequested();\n}\n\nvoid TableWidget::reload() {\n if(!m_db->isOpen())\n return;\n\n if(!m_db->tables(QSql::Tables).contains(m_table)\n && !m_db->tables(QSql::Views).contains(m_table)\n && !m_db->tables(QSql::SystemTables).contains(m_table)) {\n QMessageBox::critical(this,\n tr(\"Error\"),\n tr(\"Unable to open the table %1. \").append(\n tr(\"Check you have the necessary permissions.\"))\n .arg(m_table));\n emit closeRequested();\n return;\n }\n\n if (!tableView->setTable(m_table, m_db)) {\n emit closeRequested();\n }\n}\n\nvoid TableWidget::setTable( QString table, QSqlDatabase *db )\n{\n this->m_table = table;\n this->m_db = db;\n\n\/\/ reload();\n}\n\nvoid TableWidget::setupWidgets()\n{\n connect(tableView, SIGNAL(reloadRequested()), this, SLOT(reload()));\n}\n\nQString TableWidget::table()\n{\n return m_table;\n}\n<|endoftext|>"} {"text":"<commit_before>#include \"fplll.h\"\n\nFPLLL_BEGIN_NAMESPACE\n\n\/\/#define DEBUG_PRUNER_OPTIMIZE\n#define NUM_OPTIMIZATION_TOURS 3\n\ntemplate <class FT> void Pruner<FT>::optimize_coefficients_cost_vary_prob(\/*io*\/ vector<double> &pr)\n{\n\n FT old_c0, old_c1, new_c, min_c;\n vec b(n), best_b(n);\n\n \/\/ step 1 use half coefficients only\n optimize_coefficients_evec(pr);\n\n load_coefficients(b, pr);\n old_c0 = target_function(b);\n min_c = old_c0;\n\n#ifdef DEBUG_PRUNER_OPTIMIZE\n FT old_sc = single_enum_cost(b);\n FT old_prob = measure_metric(b);\n cerr << \"# [Stage ho] half-optimization done.\" << endl;\n cerr << \"# [Stage ho] all_enum_cost = \" << old_c0 << endl;\n cerr << \"# [Stage ho] single_enum_cost = \" << old_sc << endl;\n cerr << \"# [Stage ho] succ_probability = \" << old_prob << endl;\n#endif\n\n \/\/ step 2 use full coefficients if enabled\n if (!(flags & PRUNER_HALF))\n {\n int tours = 0;\n while (1)\n {\n tours++;\n\n \/\/ initial cost\n load_coefficients(b, pr);\n old_c0 = target_function(b);\n\n \/\/ step 2.1 full tuning\n optimize_coefficients_local_adjust_decr_single(pr);\n optimize_coefficients_local_adjust_incr_prob(pr);\n optimize_coefficients_local_adjust_smooth(pr);\n\n \/\/ update best after tuning\n load_coefficients(b, pr);\n old_c1 = target_function(b);\n if (old_c1 < min_c)\n {\n min_c = old_c1;\n best_b = b;\n }\n\n#ifdef DEBUG_PRUNER_OPTIMIZE\n old_sc = single_enum_cost(b);\n old_prob = measure_metric(b);\n cerr << \"# [Stage ft] full-tuning done.\" << endl;\n cerr << \"# [Stage ft] all_enum_cost = \" << old_c1 << endl;\n cerr << \"# [Stage ft] single_enum_cost = \" << old_sc << endl;\n cerr << \"# [Stage ft] succ_probability = \" << old_prob << endl;\n#endif\n\n \/\/ step 2.2 full optimization\n optimize_coefficients_full(pr);\n\n load_coefficients(b, pr);\n new_c = target_function(b);\n if (new_c < min_c)\n {\n min_c = new_c;\n best_b = b;\n }\n\n#ifdef DEBUG_PRUNER_OPTIMIZE\n old_sc = single_enum_cost(b);\n old_prob = measure_metric(b);\n cerr << \"# [Stage fo] full-optimization done.\" << endl;\n cerr << \"# [Stage fo] all_enum_cost = \" << new_c << endl;\n cerr << \"# [Stage fo] single_enum_cost = \" << old_sc << endl;\n cerr << \"# [Stage fo] succ_probability = \" << old_prob << endl;\n#endif\n\n \/\/ break if not improving\n if (new_c \/ old_c0 > 0.995 and tours > NUM_OPTIMIZATION_TOURS)\n break;\n }\n save_coefficients(pr, best_b);\n }\n else\n {\n save_coefficients(pr, b);\n }\n}\n\ntemplate <class FT>\nvoid Pruner<FT>::optimize_coefficients_cost_fixed_prob(\/*io*\/ vector<double> &pr)\n{\n vec b(n), best_b(n);\n FT prob;\n\n \/\/ step 1 call global optimization (without fixing succ. prob)\n optimize_coefficients_evec(pr);\n optimize_coefficients_local_adjust_smooth(pr);\n optimize_coefficients_full(pr);\n\n#ifdef DEBUG_PRUNER_OPTIMIZE\n load_coefficients(b, pr);\n cerr << \"# [Stage ho] half-optimization done.\" << endl;\n cerr << \"# [Stage ho] all_enum_cost = \" << repeated_enum_cost(b) << endl;\n cerr << \"# [Stage fo] single_enum_cost = \" << single_enum_cost(b) << endl;\n cerr << \"# [Stage ho] succ_probability = \" << measure_metric(b) << endl;\n cerr << b << endl;\n#endif\n\n \/\/ step 2 achieve target succ. prob\n optimize_coefficients_local_adjust_smooth(pr);\n load_coefficients(b, pr);\n prob = measure_metric(b);\n if (prob <= target)\n optimize_coefficients_incr_prob(pr);\n else\n {\n optimize_coefficients_decr_prob(pr);\n }\n\n \/\/ step 3: some local tweaking\n optimize_coefficients_local_adjust_smooth(pr);\n optimize_coefficients_local_adjust_prob(pr);\n\n#ifdef DEBUG_PRUNER_OPTIMIZE\n load_coefficients(b, pr);\n cerr << \"# [Stage fo] full-optimization done.\" << endl;\n cerr << \"# [Stage fo] all_enum_cost = \" << repeated_enum_cost(b) << endl;\n cerr << \"# [Stage fo] single_enum_cost = \" << single_enum_cost(b) << endl;\n cerr << \"# [Stage fo] succ_probability = \" << measure_metric(b) << endl;\n cerr << b << endl;\n#endif\n}\n\n\/**\n * optimize either overall cost or cost by fixing probability\n *\/\ntemplate <class FT> void Pruner<FT>::optimize_coefficients(\/*io*\/ vector<double> &pr)\n{\n if (opt_single)\n {\n optimize_coefficients_cost_fixed_prob(pr);\n }\n else\n {\n optimize_coefficients_cost_vary_prob(pr);\n }\n}\n\nFPLLL_END_NAMESPACE\n<commit_msg>fixing bug in cost_vary_prob()<commit_after>#include \"fplll.h\"\n\nFPLLL_BEGIN_NAMESPACE\n\n#define DEBUG_PRUNER_OPTIMIZE\n#define NUM_OPTIMIZATION_TOURS 3\n\ntemplate <class FT> void Pruner<FT>::optimize_coefficients_cost_vary_prob(\/*io*\/ vector<double> &pr)\n{\n\n FT old_c0, old_c1, new_c, min_c;\n vec b(n), best_b(n);\n\n \/\/ step 1 use half coefficients only\n optimize_coefficients_evec(pr);\n\n load_coefficients(b, pr);\n best_b = b;\n old_c0 = target_function(b);\n min_c = old_c0;\n\n#ifdef DEBUG_PRUNER_OPTIMIZE\n FT old_sc = single_enum_cost(b);\n FT old_prob = measure_metric(b);\n cerr << \"# [Stage ho] half-optimization done.\" << endl;\n cerr << \"# [Stage ho] all_enum_cost = \" << old_c0 << endl;\n cerr << \"# [Stage ho] single_enum_cost = \" << old_sc << endl;\n cerr << \"# [Stage ho] succ_probability = \" << old_prob << endl;\n#endif\n\n \/\/ step 2 use full coefficients if enabled\n if (!(flags & PRUNER_HALF))\n {\n int tours = 0;\n while (1)\n {\n tours++;\n\n \/\/ initial cost\n load_coefficients(b, pr);\n old_c0 = target_function(b);\n\n \/\/ step 2.1 full tuning\n optimize_coefficients_local_adjust_decr_single(pr);\n optimize_coefficients_local_adjust_incr_prob(pr);\n optimize_coefficients_local_adjust_smooth(pr);\n\n \/\/ update best after tuning\n load_coefficients(b, pr);\n old_c1 = target_function(b);\n if (old_c1 < min_c)\n {\n min_c = old_c1;\n best_b = b;\n }\n\n#ifdef DEBUG_PRUNER_OPTIMIZE\n old_sc = single_enum_cost(b);\n old_prob = measure_metric(b);\n cerr << \"# [Stage ft] full-tuning done.\" << endl;\n cerr << \"# [Stage ft] all_enum_cost = \" << old_c1 << endl;\n cerr << \"# [Stage ft] single_enum_cost = \" << old_sc << endl;\n cerr << \"# [Stage ft] succ_probability = \" << old_prob << endl;\n#endif\n\n \/\/ step 2.2 full optimization\n optimize_coefficients_full(pr);\n\n load_coefficients(b, pr);\n new_c = target_function(b);\n if (new_c < min_c)\n {\n min_c = new_c;\n best_b = b;\n }\n\n#ifdef DEBUG_PRUNER_OPTIMIZE\n old_sc = single_enum_cost(b);\n old_prob = measure_metric(b);\n cerr << \"# [Stage fo] full-optimization done.\" << endl;\n cerr << \"# [Stage fo] all_enum_cost = \" << new_c << endl;\n cerr << \"# [Stage fo] single_enum_cost = \" << old_sc << endl;\n cerr << \"# [Stage fo] succ_probability = \" << old_prob << endl;\n#endif\n\n \/\/ break if not improving\n if (new_c \/ old_c0 > 0.995 and tours > NUM_OPTIMIZATION_TOURS)\n break;\n }\n save_coefficients(pr, best_b);\n }\n else\n {\n save_coefficients(pr, b);\n }\n}\n\ntemplate <class FT>\nvoid Pruner<FT>::optimize_coefficients_cost_fixed_prob(\/*io*\/ vector<double> &pr)\n{\n vec b(n);\n FT prob;\n\n \/\/ step 1 call global optimization (without fixing succ. prob)\n optimize_coefficients_evec(pr);\n optimize_coefficients_local_adjust_smooth(pr);\n optimize_coefficients_full(pr);\n\n#ifdef DEBUG_PRUNER_OPTIMIZE\n load_coefficients(b, pr);\n cerr << \"# [Stage ho] half-optimization done.\" << endl;\n cerr << \"# [Stage ho] all_enum_cost = \" << repeated_enum_cost(b) << endl;\n cerr << \"# [Stage fo] single_enum_cost = \" << single_enum_cost(b) << endl;\n cerr << \"# [Stage ho] succ_probability = \" << measure_metric(b) << endl;\n cerr << b << endl;\n#endif\n\n \/\/ step 2 achieve target succ. prob\n optimize_coefficients_local_adjust_smooth(pr);\n load_coefficients(b, pr);\n prob = measure_metric(b);\n if (prob <= target)\n optimize_coefficients_incr_prob(pr);\n else\n {\n optimize_coefficients_decr_prob(pr);\n }\n\n \/\/ step 3: some local tweaking\n optimize_coefficients_local_adjust_smooth(pr);\n optimize_coefficients_local_adjust_prob(pr);\n\n#ifdef DEBUG_PRUNER_OPTIMIZE\n load_coefficients(b, pr);\n cerr << \"# [Stage fo] full-optimization done.\" << endl;\n cerr << \"# [Stage fo] all_enum_cost = \" << repeated_enum_cost(b) << endl;\n cerr << \"# [Stage fo] single_enum_cost = \" << single_enum_cost(b) << endl;\n cerr << \"# [Stage fo] succ_probability = \" << measure_metric(b) << endl;\n cerr << b << endl;\n#endif\n}\n\n\/**\n * optimize either overall cost or cost by fixing probability\n *\/\ntemplate <class FT> void Pruner<FT>::optimize_coefficients(\/*io*\/ vector<double> &pr)\n{\n if (opt_single)\n {\n optimize_coefficients_cost_fixed_prob(pr);\n }\n else\n {\n optimize_coefficients_cost_vary_prob(pr);\n }\n}\n\nFPLLL_END_NAMESPACE\n<|endoftext|>"} {"text":"<commit_before>\/\/ Copyright Daniel Wallin 2006. Use, modification and distribution is\n\/\/ subject to the Boost Software License, Version 1.0. (See accompanying\n\/\/ file LICENSE_1_0.txt or copy at http:\/\/www.boost.org\/LICENSE_1_0.txt)\n\n#include <boost\/python.hpp>\n#include <libtorrent\/session.hpp>\n\nusing namespace boost::python;\nusing namespace libtorrent;\n\nvoid bind_session_settings()\n{\n class_<session_settings>(\"session_settings\")\n .def_readwrite(\"user_agent\", &session_settings::user_agent)\n .def_readwrite(\"tracker_completion_timeout\", &session_settings::tracker_completion_timeout)\n .def_readwrite(\"tracker_receive_timeout\", &session_settings::tracker_receive_timeout)\n .def_readwrite(\"stop_tracker_timeout\", &session_settings::stop_tracker_timeout)\n .def_readwrite(\"tracker_maximum_response_length\", &session_settings::tracker_maximum_response_length)\n .def_readwrite(\"piece_timeout\", &session_settings::piece_timeout)\n .def_readwrite(\"request_timeout\", &session_settings::request_timeout)\n .def_readwrite(\"request_queue_time\", &session_settings::request_queue_time)\n .def_readwrite(\"max_allowed_in_request_queue\", &session_settings::max_allowed_in_request_queue)\n .def_readwrite(\"max_out_request_queue\", &session_settings::max_out_request_queue)\n .def_readwrite(\"whole_pieces_threshold\", &session_settings::whole_pieces_threshold)\n .def_readwrite(\"peer_timeout\", &session_settings::peer_timeout)\n .def_readwrite(\"urlseed_timeout\", &session_settings::urlseed_timeout)\n .def_readwrite(\"urlseed_pipeline_size\", &session_settings::urlseed_pipeline_size)\n .def_readwrite(\"urlseed_wait_retry\", &session_settings::urlseed_wait_retry)\n .def_readwrite(\"file_pool_size\", &session_settings::file_pool_size)\n .def_readwrite(\"allow_multiple_connections_per_ip\", &session_settings::allow_multiple_connections_per_ip)\n .def_readwrite(\"max_failcount\", &session_settings::max_failcount)\n .def_readwrite(\"min_reconnect_time\", &session_settings::min_reconnect_time)\n .def_readwrite(\"peer_connect_timeout\", &session_settings::peer_connect_timeout)\n .def_readwrite(\"ignore_limits_on_local_network\", &session_settings::ignore_limits_on_local_network)\n .def_readwrite(\"connection_speed\", &session_settings::connection_speed)\n .def_readwrite(\"send_redundant_have\", &session_settings::send_redundant_have)\n .def_readwrite(\"lazy_bitfields\", &session_settings::lazy_bitfields)\n .def_readwrite(\"inactivity_timeout\", &session_settings::inactivity_timeout)\n .def_readwrite(\"unchoke_interval\", &session_settings::unchoke_interval)\n .def_readwrite(\"optimistic_unchoke_multiplier\", &session_settings::optimistic_unchoke_multiplier)\n .def_readwrite(\"num_want\", &session_settings::num_want)\n .def_readwrite(\"initial_picker_threshold\", &session_settings::initial_picker_threshold)\n .def_readwrite(\"allowed_fast_set_size\", &session_settings::allowed_fast_set_size)\n .def_readwrite(\"max_outstanding_disk_bytes_per_connection\", &session_settings::max_outstanding_disk_bytes_per_connection)\n .def_readwrite(\"handshake_timeout\", &session_settings::handshake_timeout)\n#ifndef TORRENT_DISABLE_DHT\n .def_readwrite(\"use_dht_as_fallback\", &session_settings::use_dht_as_fallback)\n#endif\n .def_readwrite(\"free_torrent_hashes\", &session_settings::free_torrent_hashes)\n .def_readwrite(\"upnp_ignore_nonrouters\", &session_settings::upnp_ignore_nonrouters)\n .def_readwrite(\"send_buffer_watermark\", &session_settings::send_buffer_watermark)\n .def_readwrite(\"auto_upload_slots\", &session_settings::auto_upload_slots)\n .def_readwrite(\"auto_upload_slots_rate_based\", &session_settings::auto_upload_slots_rate_based)\n .def_readwrite(\"use_parole_mode\", &session_settings::use_parole_mode)\n .def_readwrite(\"cache_size\", &session_settings::cache_size)\n .def_readwrite(\"cache_buffer_chunk_size\", &session_settings::cache_buffer_chunk_size)\n .def_readwrite(\"cache_expiry\", &session_settings::cache_expiry)\n .def_readwrite(\"use_read_cache\", &session_settings::use_read_cache)\n .def_readwrite(\"disk_io_write_mode\", &session_settings::disk_io_write_mode)\n .def_readwrite(\"disk_io_read_mode\", &session_settings::disk_io_read_mode)\n .def_readwrite(\"coalesce_reads\", &session_settings::coalesce_reads)\n .def_readwrite(\"coalesce_writes\", &session_settings:coalesce_writes)\n .def_readwrite(\"outgoing_ports\", &session_settings::outgoing_ports)\n .def_readwrite(\"peer_tos\", &session_settings::peer_tos)\n .def_readwrite(\"active_downloads\", &session_settings::active_downloads)\n .def_readwrite(\"active_seeds\", &session_settings::active_seeds)\n .def_readwrite(\"active_limit\", &session_settings::active_limit)\n .def_readwrite(\"auto_manage_prefer_seeds\", &session_settings::automanaged_prefer_seeds)\n .def_readwrite(\"dont_count_slow_torrents\", &session_settings::dont_count_slow_torrents)\n .def_readwrite(\"auto_manage_interval\", &session_settings::auto_manage_interval)\n .def_readwrite(\"share_ratio_limit\", &session_settings::share_ratio_limit)\n .def_readwrite(\"seed_time_ratio_limit\", &session_settings::seed_time_ratio_limit)\n .def_readwrite(\"seed_time_limit\", &session_settings::seed_time_limit)\n .def_readwrite(\"peer_turnover\", &session_settings::peer_turnover)\n .def_readwrite(\"peer_turnover_cutoff\", &session_settings::peer_turnover_cutoff)\n .def_readwrite(\"close_redundant_connections\", &session_settings::close_redundant_connections)\n .def_readwrite(\"auto_scrape_interval\", &session_settings::auto_scrape_interval)\n .def_readwrite(\"auto_scrape_min_interval\", &session_settings::auto_scrape_min_interval)\n .def_readwrite(\"max_peerlist_size\", &session_settings::max_peerlist_size)\n .def_readwrite(\"max_paused_peerlist_size\", &session_settings::max_paused_peerlist_size)\n .def_readwrite(\"min_announce_interval\", &session_settings::min_announce_interval)\n .def_readwrite(\"prioritize_partial_pieces\", &session_settings::prioritize_partial_pieces)\n .def_readwrite(\"auto_manage_startup\", &session_settings::auto_manage_startup)\n .def_readwrite(\"rate_limit_ip_overhead\", &session_settings::rate_limit_ip_overhead)\n .def_readwrite(\"announce_to_all_trackers\", &session_settings::announce_to_all_trackers)\n .def_readwrite(\"prefer_udp_trackers\", &session_settings::prefer_udp_trackers)\n .def_readwrite(\"strict_super_seeding\", &session_settings::strict_super_seeding)\n .def_readwrite(\"seeding_piece_quota\", &session_settings::seeding_piece_quota)\n .def_readwrite(\"max_sparse_regions\", &session_settings::max_sparse_regions)\n#ifndef TORRENT_DISABLE_MLOCK\n .def_readwrite(\"lock_disk_cache\", &session_settings::lock_disk_cache)\n#endif\n .def_readwrite(\"max_rejects\", &session_settings::max_rejects)\n .def_readwrite(\"recv_socket_buffer_size\", &session_settings::recv_socket_buffer_size)\n .def_readwrite(\"send_socket_buffer_size\", &session_settings::send_socket_buffer_size)\n .def_readwrite(\"optimize_hashing_for_speed\", &session_settings::optimize_hashing_for_speed)\n .def_readwrite(\"file_checks_delay_per_block\", &session_settings::file_checks_delay_per_block)\n .def_readwrite(\"disk_cache_algorithm\", &session_settings::disk_cache_algorithm)\n .def_readwrite(\"read_cache_line_size\", &session_settings::read_cache_line_size)\n .def_readwrite(\"write_cache_line_size\", &session_settings::write_cache_line_size)\n ;\n\n enum_<proxy_settings::proxy_type>(\"proxy_type\")\n .value(\"none\", proxy_settings::none)\n .value(\"socks4\", proxy_settings::socks4)\n .value(\"socks5\", proxy_settings::socks5)\n .value(\"socks5_pw\", proxy_settings::socks5_pw)\n .value(\"http\", proxy_settings::http)\n .value(\"http_pw\", proxy_settings::http_pw)\n ;\n \n enum_<session_settings::disk_cache_algo_t(\"disk_cache_algo_t\")\n .value(\"lru\", session_settings::disk_cache_algo_t::lru)\n .value(\"largest_contiguous\", session_settings::disk_cache_algo_t::largest_contiguous)\n ;\n \n enum_<session_settings::io_buffer_mode_t(\"io_buffer_mode_t\")\n .value(\"enable_os_cache\", session_settings::io_buffer_mode_t::enable_os_cache)\n .value(\"disable_os_cache_for_aligned_files\", session_settings::io_buffer_mode_t:disable_os_cache_for_aligned_files)\n .value(\"disable_os_cache\", session_settings::io_buffer_mode_t::disable_os_cache)\n ;\n \n class_<proxy_settings>(\"proxy_settings\")\n .def_readwrite(\"hostname\", &proxy_settings::hostname)\n .def_readwrite(\"port\", &proxy_settings::port)\n .def_readwrite(\"password\", &proxy_settings::password)\n .def_readwrite(\"username\", &proxy_settings::username)\n .def_readwrite(\"type\", &proxy_settings::type)\n ;\n\n#ifndef TORRENT_DISABLE_DHT\n class_<dht_settings>(\"dht_settings\")\n .def_readwrite(\"max_peers_reply\", dht_settings::max_peers_reply)\n .def_readwrite(\"search_branching\", dht_settings::search_branching)\n .def_readwrite(\"service_port\", dht_settings::service_port)\n .def_readwrite(\"max_fail_count\", dht_settings::max_fail_count)\n ;\n#endif\n\n#ifndef TORRENT_DISABLE_ENCRYPTION\n enum_<pe_settings::enc_policy>(\"enc_policy\")\n .value(\"forced\", pe_settings::forced)\n .value(\"enabled\", pe_settings::enabled)\n .value(\"disabled\", pe_settings::disabled)\n ;\n\n enum_<pe_settings::enc_level>(\"enc_level\")\n .value(\"rc4\", pe_settings::rc4)\n .value(\"plaintext\", pe_settings::plaintext)\n .value(\"both\", pe_settings::both)\n ;\n\n class_<pe_settings>(\"pe_settings\")\n .def_readwrite(\"out_enc_policy\", &pe_settings::out_enc_policy)\n .def_readwrite(\"in_enc_policy\", &pe_settings::in_enc_policy)\n .def_readwrite(\"allowed_enc_level\", &pe_settings::allowed_enc_level)\n .def_readwrite(\"prefer_rc4\", &pe_settings::prefer_rc4)\n ;\n#endif\n\n}\n<commit_msg>Fix typo<commit_after>\/\/ Copyright Daniel Wallin 2006. Use, modification and distribution is\n\/\/ subject to the Boost Software License, Version 1.0. (See accompanying\n\/\/ file LICENSE_1_0.txt or copy at http:\/\/www.boost.org\/LICENSE_1_0.txt)\n\n#include <boost\/python.hpp>\n#include <libtorrent\/session.hpp>\n\nusing namespace boost::python;\nusing namespace libtorrent;\n\nvoid bind_session_settings()\n{\n class_<session_settings>(\"session_settings\")\n .def_readwrite(\"user_agent\", &session_settings::user_agent)\n .def_readwrite(\"tracker_completion_timeout\", &session_settings::tracker_completion_timeout)\n .def_readwrite(\"tracker_receive_timeout\", &session_settings::tracker_receive_timeout)\n .def_readwrite(\"stop_tracker_timeout\", &session_settings::stop_tracker_timeout)\n .def_readwrite(\"tracker_maximum_response_length\", &session_settings::tracker_maximum_response_length)\n .def_readwrite(\"piece_timeout\", &session_settings::piece_timeout)\n .def_readwrite(\"request_timeout\", &session_settings::request_timeout)\n .def_readwrite(\"request_queue_time\", &session_settings::request_queue_time)\n .def_readwrite(\"max_allowed_in_request_queue\", &session_settings::max_allowed_in_request_queue)\n .def_readwrite(\"max_out_request_queue\", &session_settings::max_out_request_queue)\n .def_readwrite(\"whole_pieces_threshold\", &session_settings::whole_pieces_threshold)\n .def_readwrite(\"peer_timeout\", &session_settings::peer_timeout)\n .def_readwrite(\"urlseed_timeout\", &session_settings::urlseed_timeout)\n .def_readwrite(\"urlseed_pipeline_size\", &session_settings::urlseed_pipeline_size)\n .def_readwrite(\"urlseed_wait_retry\", &session_settings::urlseed_wait_retry)\n .def_readwrite(\"file_pool_size\", &session_settings::file_pool_size)\n .def_readwrite(\"allow_multiple_connections_per_ip\", &session_settings::allow_multiple_connections_per_ip)\n .def_readwrite(\"max_failcount\", &session_settings::max_failcount)\n .def_readwrite(\"min_reconnect_time\", &session_settings::min_reconnect_time)\n .def_readwrite(\"peer_connect_timeout\", &session_settings::peer_connect_timeout)\n .def_readwrite(\"ignore_limits_on_local_network\", &session_settings::ignore_limits_on_local_network)\n .def_readwrite(\"connection_speed\", &session_settings::connection_speed)\n .def_readwrite(\"send_redundant_have\", &session_settings::send_redundant_have)\n .def_readwrite(\"lazy_bitfields\", &session_settings::lazy_bitfields)\n .def_readwrite(\"inactivity_timeout\", &session_settings::inactivity_timeout)\n .def_readwrite(\"unchoke_interval\", &session_settings::unchoke_interval)\n .def_readwrite(\"optimistic_unchoke_multiplier\", &session_settings::optimistic_unchoke_multiplier)\n .def_readwrite(\"num_want\", &session_settings::num_want)\n .def_readwrite(\"initial_picker_threshold\", &session_settings::initial_picker_threshold)\n .def_readwrite(\"allowed_fast_set_size\", &session_settings::allowed_fast_set_size)\n .def_readwrite(\"max_outstanding_disk_bytes_per_connection\", &session_settings::max_outstanding_disk_bytes_per_connection)\n .def_readwrite(\"handshake_timeout\", &session_settings::handshake_timeout)\n#ifndef TORRENT_DISABLE_DHT\n .def_readwrite(\"use_dht_as_fallback\", &session_settings::use_dht_as_fallback)\n#endif\n .def_readwrite(\"free_torrent_hashes\", &session_settings::free_torrent_hashes)\n .def_readwrite(\"upnp_ignore_nonrouters\", &session_settings::upnp_ignore_nonrouters)\n .def_readwrite(\"send_buffer_watermark\", &session_settings::send_buffer_watermark)\n .def_readwrite(\"auto_upload_slots\", &session_settings::auto_upload_slots)\n .def_readwrite(\"auto_upload_slots_rate_based\", &session_settings::auto_upload_slots_rate_based)\n .def_readwrite(\"use_parole_mode\", &session_settings::use_parole_mode)\n .def_readwrite(\"cache_size\", &session_settings::cache_size)\n .def_readwrite(\"cache_buffer_chunk_size\", &session_settings::cache_buffer_chunk_size)\n .def_readwrite(\"cache_expiry\", &session_settings::cache_expiry)\n .def_readwrite(\"use_read_cache\", &session_settings::use_read_cache)\n .def_readwrite(\"disk_io_write_mode\", &session_settings::disk_io_write_mode)\n .def_readwrite(\"disk_io_read_mode\", &session_settings::disk_io_read_mode)\n .def_readwrite(\"coalesce_reads\", &session_settings::coalesce_reads)\n .def_readwrite(\"coalesce_writes\", &session_settings:coalesce_writes)\n .def_readwrite(\"outgoing_ports\", &session_settings::outgoing_ports)\n .def_readwrite(\"peer_tos\", &session_settings::peer_tos)\n .def_readwrite(\"active_downloads\", &session_settings::active_downloads)\n .def_readwrite(\"active_seeds\", &session_settings::active_seeds)\n .def_readwrite(\"active_limit\", &session_settings::active_limit)\n .def_readwrite(\"auto_manage_prefer_seeds\", &session_settings::automanaged_prefer_seeds)\n .def_readwrite(\"dont_count_slow_torrents\", &session_settings::dont_count_slow_torrents)\n .def_readwrite(\"auto_manage_interval\", &session_settings::auto_manage_interval)\n .def_readwrite(\"share_ratio_limit\", &session_settings::share_ratio_limit)\n .def_readwrite(\"seed_time_ratio_limit\", &session_settings::seed_time_ratio_limit)\n .def_readwrite(\"seed_time_limit\", &session_settings::seed_time_limit)\n .def_readwrite(\"peer_turnover\", &session_settings::peer_turnover)\n .def_readwrite(\"peer_turnover_cutoff\", &session_settings::peer_turnover_cutoff)\n .def_readwrite(\"close_redundant_connections\", &session_settings::close_redundant_connections)\n .def_readwrite(\"auto_scrape_interval\", &session_settings::auto_scrape_interval)\n .def_readwrite(\"auto_scrape_min_interval\", &session_settings::auto_scrape_min_interval)\n .def_readwrite(\"max_peerlist_size\", &session_settings::max_peerlist_size)\n .def_readwrite(\"max_paused_peerlist_size\", &session_settings::max_paused_peerlist_size)\n .def_readwrite(\"min_announce_interval\", &session_settings::min_announce_interval)\n .def_readwrite(\"prioritize_partial_pieces\", &session_settings::prioritize_partial_pieces)\n .def_readwrite(\"auto_manage_startup\", &session_settings::auto_manage_startup)\n .def_readwrite(\"rate_limit_ip_overhead\", &session_settings::rate_limit_ip_overhead)\n .def_readwrite(\"announce_to_all_trackers\", &session_settings::announce_to_all_trackers)\n .def_readwrite(\"prefer_udp_trackers\", &session_settings::prefer_udp_trackers)\n .def_readwrite(\"strict_super_seeding\", &session_settings::strict_super_seeding)\n .def_readwrite(\"seeding_piece_quota\", &session_settings::seeding_piece_quota)\n .def_readwrite(\"max_sparse_regions\", &session_settings::max_sparse_regions)\n#ifndef TORRENT_DISABLE_MLOCK\n .def_readwrite(\"lock_disk_cache\", &session_settings::lock_disk_cache)\n#endif\n .def_readwrite(\"max_rejects\", &session_settings::max_rejects)\n .def_readwrite(\"recv_socket_buffer_size\", &session_settings::recv_socket_buffer_size)\n .def_readwrite(\"send_socket_buffer_size\", &session_settings::send_socket_buffer_size)\n .def_readwrite(\"optimize_hashing_for_speed\", &session_settings::optimize_hashing_for_speed)\n .def_readwrite(\"file_checks_delay_per_block\", &session_settings::file_checks_delay_per_block)\n .def_readwrite(\"disk_cache_algorithm\", &session_settings::disk_cache_algorithm)\n .def_readwrite(\"read_cache_line_size\", &session_settings::read_cache_line_size)\n .def_readwrite(\"write_cache_line_size\", &session_settings::write_cache_line_size)\n ;\n\n enum_<proxy_settings::proxy_type>(\"proxy_type\")\n .value(\"none\", proxy_settings::none)\n .value(\"socks4\", proxy_settings::socks4)\n .value(\"socks5\", proxy_settings::socks5)\n .value(\"socks5_pw\", proxy_settings::socks5_pw)\n .value(\"http\", proxy_settings::http)\n .value(\"http_pw\", proxy_settings::http_pw)\n ;\n \n enum_<session_settings::disk_cache_algo_t(\"disk_cache_algo_t\")\n .value(\"lru\", session_settings::disk_cache_algo_t::lru)\n .value(\"largest_contiguous\", session_settings::disk_cache_algo_t::largest_contiguous)\n ;\n \n enum_<session_settings::io_buffer_mode_t(\"io_buffer_mode_t\")\n .value(\"enable_os_cache\", session_settings::io_buffer_mode_t::enable_os_cache)\n .value(\"disable_os_cache_for_aligned_files\", session_settings::io_buffer_mode_t:disable_os_cache_for_aligned_files)\n .value(\"disable_os_cache\", session_settings::io_buffer_mode_t::disable_os_cache)\n ;\n \n class_<proxy_settings>(\"proxy_settings\")\n .def_readwrite(\"hostname\", &proxy_settings::hostname)\n .def_readwrite(\"port\", &proxy_settings::port)\n .def_readwrite(\"password\", &proxy_settings::password)\n .def_readwrite(\"username\", &proxy_settings::username)\n .def_readwrite(\"type\", &proxy_settings::type)\n ;\n\n#ifndef TORRENT_DISABLE_DHT\n class_<dht_settings>(\"dht_settings\")\n .def_readwrite(\"max_peers_reply\", &dht_settings::max_peers_reply)\n .def_readwrite(\"search_branching\", &dht_settings::search_branching)\n .def_readwrite(\"service_port\", &dht_settings::service_port)\n .def_readwrite(\"max_fail_count\", &dht_settings::max_fail_count)\n ;\n#endif\n\n#ifndef TORRENT_DISABLE_ENCRYPTION\n enum_<pe_settings::enc_policy>(\"enc_policy\")\n .value(\"forced\", pe_settings::forced)\n .value(\"enabled\", pe_settings::enabled)\n .value(\"disabled\", pe_settings::disabled)\n ;\n\n enum_<pe_settings::enc_level>(\"enc_level\")\n .value(\"rc4\", pe_settings::rc4)\n .value(\"plaintext\", pe_settings::plaintext)\n .value(\"both\", pe_settings::both)\n ;\n\n class_<pe_settings>(\"pe_settings\")\n .def_readwrite(\"out_enc_policy\", &pe_settings::out_enc_policy)\n .def_readwrite(\"in_enc_policy\", &pe_settings::in_enc_policy)\n .def_readwrite(\"allowed_enc_level\", &pe_settings::allowed_enc_level)\n .def_readwrite(\"prefer_rc4\", &pe_settings::prefer_rc4)\n ;\n#endif\n\n}\n<|endoftext|>"} {"text":"<commit_before>\/\/ Copyright 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<commit_msg>Update python bindings session_settings<commit_after>\/\/ Copyright Daniel Wallin 2006. Use, modification and distribution is\n\/\/ subject to the Boost Software License, Version 1.0. (See accompanying\n\/\/ file LICENSE_1_0.txt or copy at http:\/\/www.boost.org\/LICENSE_1_0.txt)\n\n#include <boost\/python.hpp>\n#include <libtorrent\/session.hpp>\n\nusing namespace boost::python;\nusing namespace libtorrent;\n\nvoid bind_session_settings()\n{\n class_<session_settings>(\"session_settings\")\n .def_readwrite(\"user_agent\", &session_settings::user_agent)\n .def_readwrite(\"tracker_completion_timeout\", &session_settings::tracker_completion_timeout)\n .def_readwrite(\"tracker_receive_timeout\", &session_settings::tracker_receive_timeout)\n .def_readwrite(\"stop_tracker_timeout\", &session_settings::stop_tracker_timeout)\n .def_readwrite(\"tracker_maximum_response_length\", &session_settings::tracker_maximum_response_length)\n .def_readwrite(\"piece_timeout\", &session_settings::piece_timeout)\n .def_readwrite(\"request_timeout\", &session_settings::request_timeout)\n .def_readwrite(\"request_queue_time\", &session_settings::request_queue_time)\n .def_readwrite(\"max_allowed_in_request_queue\", &session_settings::max_allowed_in_request_queue)\n .def_readwrite(\"max_out_request_queue\", &session_settings::max_out_request_queue)\n .def_readwrite(\"whole_pieces_threshold\", &session_settings::whole_pieces_threshold)\n .def_readwrite(\"peer_timeout\", &session_settings::peer_timeout)\n .def_readwrite(\"urlseed_timeout\", &session_settings::urlseed_timeout)\n .def_readwrite(\"urlseed_pipeline_size\", &session_settings::urlseed_pipeline_size)\n .def_readwrite(\"urlseed_wait_retry\", &session_settings::urlseed_wait_retry)\n .def_readwrite(\"file_pool_size\", &session_settings::file_pool_size)\n .def_readwrite(\"allow_multiple_connections_per_ip\", &session_settings::allow_multiple_connections_per_ip)\n .def_readwrite(\"max_failcount\", &session_settings::max_failcount)\n .def_readwrite(\"min_reconnect_time\", &session_settings::min_reconnect_time)\n .def_readwrite(\"peer_connect_timeout\", &session_settings::peer_connect_timeout)\n .def_readwrite(\"ignore_limits_on_local_network\", &session_settings::ignore_limits_on_local_network)\n .def_readwrite(\"connection_speed\", &session_settings::connection_speed)\n .def_readwrite(\"send_redundant_have\", &session_settings::send_redundant_have)\n .def_readwrite(\"lazy_bitfields\", &session_settings::lazy_bitfields)\n .def_readwrite(\"inactivity_timeout\", &session_settings::inactivity_timeout)\n .def_readwrite(\"unchoke_interval\", &session_settings::unchoke_interval)\n .def_readwrite(\"optimistic_unchoke_multiplier\", &session_settings::optimistic_unchoke_multiplier)\n .def_readwrite(\"num_want\", &session_settings::num_want)\n .def_readwrite(\"initial_picker_threshold\", &session_settings::initial_picker_threshold)\n .def_readwrite(\"allowed_fast_set_size\", &session_settings::allowed_fast_set_size)\n .def_readwrite(\"max_outstanding_disk_bytes_per_connection\", &session_settings::max_outstanding_disk_bytes_per_connection)\n .def_readwrite(\"handshake_timeout\", &session_settings::handshake_timeout)\n#ifndef TORRENT_DISABLE_DHT\n .def_readwrite(\"use_dht_as_fallback\", &session_settings::use_dht_as_fallback)\n#endif\n .def_readwrite(\"free_torrent_hashes\", &session_settings::free_torrent_hashes)\n .def_readwrite(\"upnp_ignore_nonrouters\", &session_settings::upnp_ignore_nonrouters)\n .def_readwrite(\"send_buffer_watermark\", &session_settings::send_buffer_watermark)\n .def_readwrite(\"auto_upload_slots\", &session_settings::auto_upload_slots)\n .def_readwrite(\"auto_upload_slots_rate_based\", &session_settings::auto_upload_slots_rate_based)\n .def_readwrite(\"use_parole_mode\", &session_settings::use_parole_mode)\n .def_readwrite(\"cache_size\", &session_settings::cache_size)\n .def_readwrite(\"cache_buffer_chunk_size\", &session_settings::cache_buffer_chunk_size)\n .def_readwrite(\"cache_expiry\", &session_settings::cache_expiry)\n .def_readwrite(\"use_read_cache\", &session_settings::use_read_cache)\n .def_readwrite(\"disk_io_write_mode\", &session_settings::disk_io_write_mode)\n .def_readwrite(\"disk_io_read_mode\", &session_settings::disk_io_read_mode)\n .def_readwrite(\"coalesce_reads\", &session_settings::coalesce_reads)\n .def_readwrite(\"coalesce_writes\", &session_settings:coalesce_writes)\n .def_readwrite(\"outgoing_ports\", &session_settings::outgoing_ports)\n .def_readwrite(\"peer_tos\", &session_settings::peer_tos)\n .def_readwrite(\"active_downloads\", &session_settings::active_downloads)\n .def_readwrite(\"active_seeds\", &session_settings::active_seeds)\n .def_readwrite(\"active_limit\", &session_settings::active_limit)\n .def_readwrite(\"auto_manage_prefer_seeds\", &session_settings::automanaged_prefer_seeds)\n .def_readwrite(\"dont_count_slow_torrents\", &session_settings::dont_count_slow_torrents)\n .def_readwrite(\"auto_manage_interval\", &session_settings::auto_manage_interval)\n .def_readwrite(\"share_ratio_limit\", &session_settings::share_ratio_limit)\n .def_readwrite(\"seed_time_ratio_limit\", &session_settings::seed_time_ratio_limit)\n .def_readwrite(\"seed_time_limit\", &session_settings::seed_time_limit)\n .def_readwrite(\"peer_turnover\", &session_settings::peer_turnover)\n .def_readwrite(\"peer_turnover_cutoff\", &session_settings::peer_turnover_cutoff)\n .def_readwrite(\"close_redundant_connections\", &session_settings::close_redundant_connections)\n .def_readwrite(\"auto_scrape_interval\", &session_settings::auto_scrape_interval)\n .def_readwrite(\"auto_scrape_min_interval\", &session_settings::auto_scrape_min_interval)\n .def_readwrite(\"max_peerlist_size\", &session_settings::max_peerlist_size)\n .def_readwrite(\"max_paused_peerlist_size\", &session_settings::max_paused_peerlist_size)\n .def_readwrite(\"min_announce_interval\", &session_settings::min_announce_interval)\n .def_readwrite(\"prioritize_partial_pieces\", &session_settings::prioritize_partial_pieces)\n .def_readwrite(\"auto_manage_startup\", &session_settings::auto_manage_startup)\n .def_readwrite(\"rate_limit_ip_overhead\", &session_settings::rate_limit_ip_overhead)\n .def_readwrite(\"announce_to_all_trackers\", &session_settings::announce_to_all_trackers)\n .def_readwrite(\"prefer_udp_trackers\", &session_settings::prefer_udp_trackers)\n .def_readwrite(\"strict_super_seeding\", &session_settings::strict_super_seeding)\n .def_readwrite(\"seeding_piece_quota\", &session_settings::seeding_piece_quota)\n .def_readwrite(\"max_sparse_regions\", &session_settings::max_sparse_regions)\n#ifndef TORRENT_DISABLE_MLOCK\n .def_readwrite(\"lock_disk_cache\", &session_settings::lock_disk_cache)\n#endif\n .def_readwrite(\"max_rejects\", &session_settings::max_rejects)\n .def_readwrite(\"recv_socket_buffer_size\", &session_settings::recv_socket_buffer_size)\n .def_readwrite(\"send_socket_buffer_size\", &session_settings::send_socket_buffer_size)\n .def_readwrite(\"optimize_hashing_for_speed\", &session_settings::optimize_hashing_for_speed)\n .def_readwrite(\"file_checks_delay_per_block\", &session_settings::file_checks_delay_per_block)\n .def_readwrite(\"disk_cache_algorithm\", &session_settings::disk_cache_algorithm)\n .def_readwrite(\"read_cache_line_size\", &session_settings::read_cache_line_size)\n .def_readwrite(\"write_cache_line_size\", &session_settings::write_cache_line_size)\n ;\n\n enum_<proxy_settings::proxy_type>(\"proxy_type\")\n .value(\"none\", proxy_settings::none)\n .value(\"socks4\", proxy_settings::socks4)\n .value(\"socks5\", proxy_settings::socks5)\n .value(\"socks5_pw\", proxy_settings::socks5_pw)\n .value(\"http\", proxy_settings::http)\n .value(\"http_pw\", proxy_settings::http_pw)\n ;\n \n enum_<session_settings::disk_cache_algo_t(\"disk_cache_algo_t\")\n .value(\"lru\", session_settings::disk_cache_algo_t::lru)\n .value(\"largest_contiguous\", session_settings::disk_cache_algo_t::largest_contiguous)\n ;\n \n enum_<session_settings::io_buffer_mode_t(\"io_buffer_mode_t\")\n .value(\"enable_os_cache\", session_settings::io_buffer_mode_t::enable_os_cache)\n .value(\"disable_os_cache_for_aligned_files\", session_settings::io_buffer_mode_t:disable_os_cache_for_aligned_files)\n .value(\"disable_os_cache\", session_settings::io_buffer_mode_t::disable_os_cache)\n ;\n \n class_<proxy_settings>(\"proxy_settings\")\n .def_readwrite(\"hostname\", &proxy_settings::hostname)\n .def_readwrite(\"port\", &proxy_settings::port)\n .def_readwrite(\"password\", &proxy_settings::password)\n .def_readwrite(\"username\", &proxy_settings::username)\n .def_readwrite(\"type\", &proxy_settings::type)\n ;\n\n#ifndef TORRENT_DISABLE_DHT\n class_<dht_settings>(\"dht_settings\")\n .def_readwrite(\"max_peers_reply\", dht_settings::max_peers_reply)\n .def_readwrite(\"search_branching\", dht_settings::search_branching)\n .def_readwrite(\"service_port\", dht_settings::service_port)\n .def_readwrite(\"max_fail_count\", dht_settings::max_fail_count)\n ;\n#endif\n\n#ifndef TORRENT_DISABLE_ENCRYPTION\n enum_<pe_settings::enc_policy>(\"enc_policy\")\n .value(\"forced\", pe_settings::forced)\n .value(\"enabled\", pe_settings::enabled)\n .value(\"disabled\", pe_settings::disabled)\n ;\n\n enum_<pe_settings::enc_level>(\"enc_level\")\n .value(\"rc4\", pe_settings::rc4)\n .value(\"plaintext\", pe_settings::plaintext)\n .value(\"both\", pe_settings::both)\n ;\n\n class_<pe_settings>(\"pe_settings\")\n .def_readwrite(\"out_enc_policy\", &pe_settings::out_enc_policy)\n .def_readwrite(\"in_enc_policy\", &pe_settings::in_enc_policy)\n .def_readwrite(\"allowed_enc_level\", &pe_settings::allowed_enc_level)\n .def_readwrite(\"prefer_rc4\", &pe_settings::prefer_rc4)\n ;\n#endif\n\n}\n<|endoftext|>"} {"text":"<commit_before><commit_msg>Add session_settings::peer_tos to bindings<commit_after><|endoftext|>"} {"text":"<commit_before>#include <rw.h>\n#include <skeleton.h>\n\n#include \"subrast.h\"\n\nrw::Camera *Camera;\nrw::Camera *SubCameras[4];\n\nvoid\nCameraSetViewWindow(rw::Camera *camera, float width, float height, float vw)\n{\n\trw::V2d viewWindow;\n\n\t\/\/ TODO: aspect ratio when fullscreen\n\tif(width > height){\n\t\tviewWindow.x = vw;\n\t\tviewWindow.y = vw \/ (width\/height);\n\t}else{\n\t\tviewWindow.x = vw \/ (height\/width);\n\t\tviewWindow.y = vw;\n\t}\n\n\tcamera->setViewWindow(&viewWindow);\n}\n\nvoid\nUpdateSubRasters(rw::Camera *mainCamera, rw::int32 mainWidth, rw::int32 mainHeight)\n{\n\trw::Rect rect[4];\n\tfloat width, height, border;\n\n\tborder = mainHeight*0.05f;\n\n\twidth = (mainWidth - border*3.0f) \/ 2.0f;\n\theight = (mainHeight - border*3.0f) \/ 2.0f;\n\n\t\/\/ top left\n\trect[0].x = border;\n\trect[0].y = border;\n\trect[0].w = width;\n\trect[0].h = height;\n\n\t\/\/ top right\n\trect[1].x = border*2 + width;\n\trect[1].y = border;\n\trect[1].w = width;\n\trect[1].h = height;\n\n\t\/\/ bottom left\n\trect[2].x = border;\n\trect[2].y = border*2 + height;\n\trect[2].w = width;\n\trect[2].h = height;\n\n\t\/\/ bottom left\n\trect[3].x = border*2 + width;\n\trect[3].y = border*2 + height;\n\trect[3].w = width;\n\trect[3].h = height;\n\n\tCameraSetViewWindow(SubCameras[0], width, height, 0.5f);\n\tfor(int i = 1; i < 4; i++)\n\t\tCameraSetViewWindow(SubCameras[i], width, height, 0.5f + 0.4f);\n\n\tfor(int i = 0; i < 4; i++){\n\t\tSubCameras[i]->frameBuffer->subRaster(mainCamera->frameBuffer, &rect[i]);\n\t\tSubCameras[i]->zBuffer->subRaster(mainCamera->zBuffer, &rect[i]);\n\t}\n}\n\nvoid\nPositionSubCameras(void)\n{\n\trw::Frame *frame;\n\trw::V3d pos;\n\tconst float dist = 2.5f;\n\n\t\/\/ perspective\n\tpos.x = pos.y = 0.0f;\n\tpos.z = -4.0f;\n\tframe = SubCameras[0]->getFrame();\n\tframe->translate(&pos, rw::COMBINEREPLACE);\n\n\t\/\/ look along z\n\tpos.x = pos.y = 0.0f;\n\tpos.z = -dist;\n\tframe = SubCameras[1]->getFrame();\n\tframe->translate(&pos, rw::COMBINEREPLACE);\n\n\t\/\/ look along x\n\tpos.x = -dist;\n\tpos.y = pos.z = 0.0f;\n\tframe = SubCameras[2]->getFrame();\n\tframe->rotate(&Yaxis, 90.0f, rw::COMBINEREPLACE);\n\tframe->translate(&pos, rw::COMBINEPOSTCONCAT);\n\n\t\/\/ look along y\n\tpos.x = pos.z = 0.0f;\n\tpos.y = -dist;\n\tframe = SubCameras[3]->getFrame();\n\tframe->rotate(&Xaxis, -90.0f, rw::COMBINEREPLACE);\n\tframe->translate(&pos, rw::COMBINEPOSTCONCAT);\n}\n\nvoid\nCreateCameras(rw::World *world)\n{\n\tCamera = sk::CameraCreate(sk::globals.width, sk::globals.height, 1);\n\tassert(Camera);\n\n\tfor(int i = 0; i < 4; i++){\n\t\tSubCameras[i] = sk::CameraCreate(0, 0, 1);\n\t\tassert(SubCameras[i]);\n\n\t\tSubCameras[i]->setNearPlane(0.1f);\n\t\tSubCameras[i]->setFarPlane(30.0f);\n\n\t\tworld->addCamera(SubCameras[i]);\n\n\t\tif(i > 0)\n\t\t\tSubCameras[i]->setProjection(rw::Camera::PARALLEL);\n\t}\n\n\tPositionSubCameras();\n}\n\nvoid\nDestroyCameras(rw::World *world)\n{\n\tif(Camera){\n\t\tworld->removeCamera(Camera);\n\t\tsk::CameraDestroy(Camera);\n\t\tCamera = nil;\n\t}\n\n\tfor(int i = 0; i < 4; i++)\n\t\tif(SubCameras[i]){\n\t\t\tworld->removeCamera(SubCameras[i]);\n\t\t\tsk::CameraDestroy(SubCameras[i]);\n\t\t\tSubCameras[i] = nil;\n\t\t}\n}\n<commit_msg>subrast: fix assert error at exit<commit_after>#include <rw.h>\n#include <skeleton.h>\n\n#include \"subrast.h\"\n\nrw::Camera *Camera;\nrw::Camera *SubCameras[4];\n\nvoid\nCameraSetViewWindow(rw::Camera *camera, float width, float height, float vw)\n{\n\trw::V2d viewWindow;\n\n\t\/\/ TODO: aspect ratio when fullscreen\n\tif(width > height){\n\t\tviewWindow.x = vw;\n\t\tviewWindow.y = vw \/ (width\/height);\n\t}else{\n\t\tviewWindow.x = vw \/ (height\/width);\n\t\tviewWindow.y = vw;\n\t}\n\n\tcamera->setViewWindow(&viewWindow);\n}\n\nvoid\nUpdateSubRasters(rw::Camera *mainCamera, rw::int32 mainWidth, rw::int32 mainHeight)\n{\n\trw::Rect rect[4];\n\tfloat width, height, border;\n\n\tborder = mainHeight*0.05f;\n\n\twidth = (mainWidth - border*3.0f) \/ 2.0f;\n\theight = (mainHeight - border*3.0f) \/ 2.0f;\n\n\t\/\/ top left\n\trect[0].x = border;\n\trect[0].y = border;\n\trect[0].w = width;\n\trect[0].h = height;\n\n\t\/\/ top right\n\trect[1].x = border*2 + width;\n\trect[1].y = border;\n\trect[1].w = width;\n\trect[1].h = height;\n\n\t\/\/ bottom left\n\trect[2].x = border;\n\trect[2].y = border*2 + height;\n\trect[2].w = width;\n\trect[2].h = height;\n\n\t\/\/ bottom left\n\trect[3].x = border*2 + width;\n\trect[3].y = border*2 + height;\n\trect[3].w = width;\n\trect[3].h = height;\n\n\tCameraSetViewWindow(SubCameras[0], width, height, 0.5f);\n\tfor(int i = 1; i < 4; i++)\n\t\tCameraSetViewWindow(SubCameras[i], width, height, 0.5f + 0.4f);\n\n\tfor(int i = 0; i < 4; i++){\n\t\tSubCameras[i]->frameBuffer->subRaster(mainCamera->frameBuffer, &rect[i]);\n\t\tSubCameras[i]->zBuffer->subRaster(mainCamera->zBuffer, &rect[i]);\n\t}\n}\n\nvoid\nPositionSubCameras(void)\n{\n\trw::Frame *frame;\n\trw::V3d pos;\n\tconst float dist = 2.5f;\n\n\t\/\/ perspective\n\tpos.x = pos.y = 0.0f;\n\tpos.z = -4.0f;\n\tframe = SubCameras[0]->getFrame();\n\tframe->translate(&pos, rw::COMBINEREPLACE);\n\n\t\/\/ look along z\n\tpos.x = pos.y = 0.0f;\n\tpos.z = -dist;\n\tframe = SubCameras[1]->getFrame();\n\tframe->translate(&pos, rw::COMBINEREPLACE);\n\n\t\/\/ look along x\n\tpos.x = -dist;\n\tpos.y = pos.z = 0.0f;\n\tframe = SubCameras[2]->getFrame();\n\tframe->rotate(&Yaxis, 90.0f, rw::COMBINEREPLACE);\n\tframe->translate(&pos, rw::COMBINEPOSTCONCAT);\n\n\t\/\/ look along y\n\tpos.x = pos.z = 0.0f;\n\tpos.y = -dist;\n\tframe = SubCameras[3]->getFrame();\n\tframe->rotate(&Xaxis, -90.0f, rw::COMBINEREPLACE);\n\tframe->translate(&pos, rw::COMBINEPOSTCONCAT);\n}\n\nvoid\nCreateCameras(rw::World *world)\n{\n\tCamera = sk::CameraCreate(sk::globals.width, sk::globals.height, 1);\n\tassert(Camera);\n\n\tfor(int i = 0; i < 4; i++){\n\t\tSubCameras[i] = sk::CameraCreate(0, 0, 1);\n\t\tassert(SubCameras[i]);\n\n\t\tSubCameras[i]->setNearPlane(0.1f);\n\t\tSubCameras[i]->setFarPlane(30.0f);\n\n\t\tworld->addCamera(SubCameras[i]);\n\n\t\tif(i > 0)\n\t\t\tSubCameras[i]->setProjection(rw::Camera::PARALLEL);\n\t}\n\n\tPositionSubCameras();\n}\n\nvoid\nDestroyCameras(rw::World *world)\n{\n\tif(Camera){\n\t\tsk::CameraDestroy(Camera);\n\t\tCamera = nil;\n\t}\n\n\tfor(int i = 0; i < 4; i++)\n\t\tif(SubCameras[i]){\n\t\t\tworld->removeCamera(SubCameras[i]);\n\t\t\tsk::CameraDestroy(SubCameras[i]);\n\t\t\tSubCameras[i] = nil;\n\t\t}\n}\n<|endoftext|>"} {"text":"<commit_before>#include \"osg\/Uniform\"\n\n#include \"osgDB\/Registry\"\n#include \"osgDB\/Input\"\n#include \"osgDB\/Output\"\n\nusing namespace osg;\nusing namespace osgDB;\nusing namespace std;\n\n\/\/ forward declare functions to use later.\nbool Uniform_readLocalData(Object& obj, Input& fr);\nbool Uniform_writeLocalData(const Object& obj, Output& fw);\n\n\/\/ register the read and write functions with the osgDB::Registry.\nRegisterDotOsgWrapperProxy g_UniformProxy\n(\n new osg::Uniform,\n \"Uniform\",\n \"Object Uniform\",\n &Uniform_readLocalData,\n &Uniform_writeLocalData\n);\n\n\nbool Uniform_readLocalData(Object& obj, Input& fr)\n{\n bool iteratorAdvanced = false;\n\n Uniform& uniform = static_cast<Uniform&>(obj);\n\n if (fr.matchSequence(\"type %w\"))\n {\n\tuniform.setType( Uniform::getTypeId(fr[1].getStr()) );\n\tfr+=2;\n\titeratorAdvanced = true;\n }\n\n if (fr.matchSequence(\"name %s\"))\n {\n uniform.setName(fr[1].getStr());\n fr+=2;\n iteratorAdvanced = true;\n }\n\n \/\/ TODO read uniform value based on type\n\n return iteratorAdvanced;\n}\n\n\nbool Uniform_writeLocalData(const Object& obj,Output& fw)\n{\n const Uniform& uniform = static_cast<const Uniform&>(obj);\n\n fw.indent() << \"type \" << Uniform::getTypename( uniform.getType() ) << std::endl;\n\n fw.indent() << \"name \"<< fw.wrapString(uniform.getName()) << std::endl;\n\n \/\/ TODO write uniform value based on type\n\n return true;\n}\n<commit_msg>Added more complete support for writing out data of Uniforms<commit_after>#include \"osg\/Uniform\"\n#include \"osg\/io_utils\"\n#include \"osg\/Notify\"\n\n#include \"osgDB\/Registry\"\n#include \"osgDB\/Input\"\n#include \"osgDB\/Output\"\n\nusing namespace osg;\nusing namespace osgDB;\nusing namespace std;\n\n\/\/ forward declare functions to use later.\nbool Uniform_readLocalData(Object& obj, Input& fr);\nbool Uniform_writeLocalData(const Object& obj, Output& fw);\n\n\/\/ register the read and write functions with the osgDB::Registry.\nRegisterDotOsgWrapperProxy g_UniformProxy\n(\n new osg::Uniform,\n \"Uniform\",\n \"Object Uniform\",\n &Uniform_readLocalData,\n &Uniform_writeLocalData\n);\n\n\nbool Uniform_readLocalData(Object& obj, Input& fr)\n{\n bool iteratorAdvanced = false;\n\n Uniform& uniform = static_cast<Uniform&>(obj);\n\n\n if (fr.matchSequence(\"name %s\"))\n {\n uniform.setName(fr[1].getStr());\n fr+=2;\n iteratorAdvanced = true;\n }\n\n \/\/ TODO read uniform value based on type\n\n if (fr.matchSequence(\"type %w\"))\n {\n\tuniform.setType( Uniform::getTypeId(fr[1].getStr()) );\n\tfr+=2;\n\titeratorAdvanced = true;\n }\n \n switch(uniform.getType())\n {\n case(osg::Uniform::FLOAT):\n {\n float value;\n if (fr[0].getFloat(value)) \n {\n uniform.set(value);\n\t fr+=1;\n\t iteratorAdvanced = true;\n }\n break;\n }\n case(osg::Uniform::FLOAT_VEC2):\n {\n osg::Vec2 value;\n if (fr[0].getFloat(value[0]) && fr[1].getFloat(value[1])) \n {\n uniform.set(value);\n\t fr+=2;\n\t iteratorAdvanced = true;\n }\n break;\n }\n case(osg::Uniform::FLOAT_VEC3):\n {\n osg::Vec3 value;\n if (fr[0].getFloat(value[0]) && fr[1].getFloat(value[1]) && fr[2].getFloat(value[2])) \n {\n uniform.set(value);\n\t fr+=3;\n\t iteratorAdvanced = true;\n }\n break;\n }\n case(osg::Uniform::FLOAT_VEC4):\n {\n osg::Vec4 value;\n if (fr[0].getFloat(value[0]) && fr[1].getFloat(value[1]) && fr[2].getFloat(value[2]) && fr[3].getFloat(value[3])) \n {\n uniform.set(value);\n\t fr+=4;\n\t iteratorAdvanced = true;\n }\n break;\n }\n case(osg::Uniform::INT):\n {\n int value;\n if (fr[0].getInt(value)) \n {\n uniform.set(value);\n\t fr+=1;\n\t iteratorAdvanced = true;\n }\n break;\n }\n case(osg::Uniform::INT_VEC2):\n {\n int value[2];\n if (fr[0].getInt(value[0]) && fr[1].getInt(value[1]))\n {\n uniform.set(value[0],value[1]);\n\t fr+=2;\n\t iteratorAdvanced = true;\n }\n break;\n }\n case(osg::Uniform::INT_VEC3):\n {\n int value[3];\n if (fr[0].getInt(value[0]) && fr[1].getInt(value[1]) && fr[2].getInt(value[2]))\n {\n uniform.set(value[0],value[1],value[2]);\n\t fr+=3;\n\t iteratorAdvanced = true;\n }\n break;\n }\n case(osg::Uniform::INT_VEC4):\n {\n int value[4];\n if (fr[0].getInt(value[0]) && fr[1].getInt(value[1]) && fr[2].getInt(value[2]) && fr[3].getInt(value[3]))\n {\n uniform.set(value[0],value[1],value[2],value[3]);\n\t fr+=4;\n\t iteratorAdvanced = true;\n }\n break;\n }\n case(osg::Uniform::BOOL):\n {\n int value;\n if (fr[0].getInt(value)) \n {\n uniform.set(value!=0 ? true:false);\n\t fr+=1;\n\t iteratorAdvanced = true;\n }\n break;\n }\n case(osg::Uniform::BOOL_VEC2):\n {\n int value[2];\n if (fr[0].getInt(value[0]) && fr[1].getInt(value[1]))\n {\n uniform.set(value[0]!=0 ? true:false, value[1]!=0 ? true:false);\n\t fr+=2;\n\t iteratorAdvanced = true;\n }\n break;\n }\n case(osg::Uniform::BOOL_VEC3):\n {\n int value[3];\n if (fr[0].getInt(value[0]) && fr[1].getInt(value[1]) && fr[2].getInt(value[2]))\n {\n uniform.set(value[0]!=0 ? true:false, value[1]!=0 ? true:false, value[2]!=0 ? true:false);\n\t fr+=3;\n\t iteratorAdvanced = true;\n }\n break;\n }\n case(osg::Uniform::BOOL_VEC4):\n {\n int value[4];\n if (fr[0].getInt(value[0]) && fr[1].getInt(value[1]) && fr[2].getInt(value[2]) && fr[3].getInt(value[3]))\n {\n uniform.set(value[0]!=0 ? true:false, value[1]!=0 ? true:false, value[2]!=0 ? true:false, value[3]!=0 ? true:false);\n\t fr+=4;\n\t iteratorAdvanced = true;\n }\n break;\n }\n case(osg::Uniform::FLOAT_MAT2):\n {\n osg::notify(osg::WARN)<<\"Warning : type not supported for reading.\"<<std::endl;\n break;\n }\n case(osg::Uniform::FLOAT_MAT3):\n {\n osg::notify(osg::WARN)<<\"Warning : type not supported for reading.\"<<std::endl;\n break;\n }\n case(osg::Uniform::FLOAT_MAT4):\n {\n osg::notify(osg::WARN)<<\"Warning : type not supported for reading.\"<<std::endl;\n break;\n }\n case(osg::Uniform::SAMPLER_1D):\n {\n osg::notify(osg::WARN)<<\"Warning : type not supported for reading.\"<<std::endl;\n break;\n }\n case(osg::Uniform::SAMPLER_2D):\n {\n osg::notify(osg::WARN)<<\"Warning : type not supported for reading.\"<<std::endl;\n break;\n }\n case(osg::Uniform::SAMPLER_3D):\n {\n osg::notify(osg::WARN)<<\"Warning : type not supported for reading.\"<<std::endl;\n break;\n }\n case(osg::Uniform::SAMPLER_CUBE):\n {\n osg::notify(osg::WARN)<<\"Warning : type not supported for reading.\"<<std::endl;\n break;\n }\n case(osg::Uniform::SAMPLER_1D_SHADOW):\n {\n osg::notify(osg::WARN)<<\"Warning : type not supported for reading.\"<<std::endl;\n break;\n }\n case(osg::Uniform::SAMPLER_2D_SHADOW):\n {\n osg::notify(osg::WARN)<<\"Warning : type not supported for reading.\"<<std::endl;\n break;\n }\n }\n\n return iteratorAdvanced;\n}\n\n\nbool Uniform_writeLocalData(const Object& obj,Output& fw)\n{\n const Uniform& uniform = static_cast<const Uniform&>(obj);\n\n\n fw.indent() << \"name \"<< fw.wrapString(uniform.getName()) << std::endl;\n\n fw.indent() << \"type \" << Uniform::getTypename( uniform.getType() ) << \" \";\n \n switch(uniform.getType())\n {\n case(osg::Uniform::FLOAT):\n {\n float value = 0.0f;\n uniform.get(value);\n fw << value; \n break;\n }\n case(osg::Uniform::FLOAT_VEC2):\n {\n Vec2 value;\n uniform.get(value);\n fw << value; \n break;\n }\n case(osg::Uniform::FLOAT_VEC3):\n {\n Vec3 value;\n uniform.get(value);\n fw << value; \n break;\n }\n case(osg::Uniform::FLOAT_VEC4):\n {\n Vec4 value;\n uniform.get(value);\n fw << value; \n break;\n }\n case(osg::Uniform::INT):\n {\n int value = 0;\n uniform.get(value);\n fw << value; \n break;\n }\n case(osg::Uniform::INT_VEC2):\n {\n int value[2];\n uniform.get(value[0],value[1]);\n fw << value[0]<<\" \"<<value[1];\n break;\n }\n case(osg::Uniform::INT_VEC3):\n {\n int value[3];\n uniform.get(value[0],value[1],value[2]);\n fw << value[0]<<\" \"<<value[1]<<\" \"<<value[2];\n break;\n }\n case(osg::Uniform::INT_VEC4):\n {\n int value[4];\n uniform.get(value[0],value[1],value[2],value[3]);\n fw << value[0]<<\" \"<<value[1]<<\" \"<<value[2]<<\" \"<<value[3];\n break;\n }\n case(osg::Uniform::BOOL):\n {\n bool value = 0;\n uniform.get(value);\n fw << value; \n break;\n }\n case(osg::Uniform::BOOL_VEC2):\n {\n bool value[2];\n uniform.get(value[0],value[1]);\n fw << value[0]<<\" \"<<value[1];\n break;\n }\n case(osg::Uniform::BOOL_VEC3):\n {\n bool value[3];\n uniform.get(value[0],value[1],value[2]);\n fw << value[0]<<\" \"<<value[1]<<\" \"<<value[2];\n break;\n }\n case(osg::Uniform::BOOL_VEC4):\n {\n bool value[4];\n uniform.get(value[0],value[1],value[2],value[3]);\n fw << value[0]<<\" \"<<value[1]<<\" \"<<value[2]<<\" \"<<value[3];\n break;\n }\n case(osg::Uniform::FLOAT_MAT2):\n {\n osg::notify(osg::WARN)<<\"Warning : type not supported for writing.\"<<std::endl;\n break;\n }\n case(osg::Uniform::FLOAT_MAT3):\n {\n osg::notify(osg::WARN)<<\"Warning : type not supported for writing.\"<<std::endl;\n break;\n }\n case(osg::Uniform::FLOAT_MAT4):\n {\n osg::notify(osg::WARN)<<\"Warning : type not supported for writing.\"<<std::endl;\n break;\n }\n case(osg::Uniform::SAMPLER_1D):\n {\n osg::notify(osg::WARN)<<\"Warning : type not supported for writing.\"<<std::endl;\n break;\n }\n case(osg::Uniform::SAMPLER_2D):\n {\n osg::notify(osg::WARN)<<\"Warning : type not supported for writing.\"<<std::endl;\n break;\n }\n case(osg::Uniform::SAMPLER_3D):\n {\n osg::notify(osg::WARN)<<\"Warning : type not supported for writing.\"<<std::endl;\n break;\n }\n case(osg::Uniform::SAMPLER_CUBE):\n {\n osg::notify(osg::WARN)<<\"Warning : type not supported for writing.\"<<std::endl;\n break;\n }\n case(osg::Uniform::SAMPLER_1D_SHADOW):\n {\n osg::notify(osg::WARN)<<\"Warning : type not supported for writing.\"<<std::endl;\n break;\n }\n case(osg::Uniform::SAMPLER_2D_SHADOW):\n {\n osg::notify(osg::WARN)<<\"Warning : type not supported for writing.\"<<std::endl;\n break;\n }\n }\n \n fw << std::endl;\n \n return true;\n}\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\/\/ \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 implied.\n\/\/ See the License for the specific language governing permissions and\n\/\/ limitations under the License.\n\n\/\/ Internal Includes\n#include <osvr\/Common\/ParseAlias.h>\n#include <osvr\/Util\/Verbosity.h>\n\n\/\/ Library\/third-party includes\n#include <json\/reader.h>\n#include <json\/writer.h>\n\n\/\/ Standard includes\n#include <sstream>\n\nnamespace osvr {\nnamespace common {\n\n \/\/\/ @brief Helper, converts old-style tracker source into normal. For a\n \/\/\/ little backward-compatibility.\n \/\/\/\n \/\/\/ @todo remove this method in the future.\n inline std::string getPathFromOldRouteSource(Json::Value obj) {\n std::ostringstream ret;\n if (obj.isObject() && obj.isMember(\"tracker\")) {\n auto tracker = obj[\"tracker\"].asString();\n if (tracker.front() != '\/') {\n ret << \"\/\";\n }\n ret << tracker;\n ret << \"\/tracker\";\n if (obj.isMember(\"sensor\")) {\n ret << \"\/\";\n ret << obj[\"sensor\"].asInt();\n }\n }\n return ret.str();\n }\n\n ParsedAlias::ParsedAlias(std::string const &src) : m_simple(true) {\n m_parse(src);\n }\n\n ParsedAlias::ParsedAlias(Json::Value src) : m_simple(true) { m_parse(src); }\n\n bool ParsedAlias::isValid() const { return !m_value.isNull(); }\n\n bool ParsedAlias::isSimple() const { return m_simple; }\n std::string ParsedAlias::getLeaf() const { return m_leaf().asString(); }\n void ParsedAlias::setLeaf(std::string const &leaf) { m_leaf() = leaf; }\n\n std::string ParsedAlias::getAlias() const {\n if (m_value.isString()) {\n return m_value.asString();\n }\n Json::FastWriter writer;\n writer.omitEndingLineFeed();\n return writer.write(m_value);\n }\n\n Json::Value ParsedAlias::getAliasValue() const { return m_value; }\n\n void ParsedAlias::m_parse(std::string const &src) {\n Json::Value val;\n Json::Reader reader;\n if (!reader.parse(src, val)) {\n \/\/ If it didn't parse as JSON, just assume it's a string.\n m_value = src;\n return;\n }\n m_parse(val);\n }\n\n static const char CHILD_KEY[] = \"child\";\n static const char SOURCE_KEY[] = \"source\";\n void ParsedAlias::m_parse(Json::Value &val) {\n if (val.isString()) {\n \/\/ Assume a string is just a string.\n m_value = val;\n return;\n }\n if (val.isObject()) {\n if (val.isMember(SOURCE_KEY)) {\n \/\/ Strip any initial \"source\" level\n m_parse(val[SOURCE_KEY]);\n return;\n }\n\n \/\/ Assume an object means a transform.\n m_simple = false;\n m_value = val;\n\n auto &leaf = m_leaf();\n if (leaf.isString()) {\n return;\n }\n\n auto trackerEquiv = getPathFromOldRouteSource(leaf);\n if (!trackerEquiv.empty()) {\n leaf = trackerEquiv;\n return;\n }\n\n OSVR_DEV_VERBOSE(\n \"Couldn't handle transform leaf: \" << leaf.toStyledString());\n }\n m_value = Json::nullValue;\n \/\/\/ @todo finish by throwing?\n }\n Json::Value &ParsedAlias::m_leaf() {\n Json::Value *current = &m_value;\n while (current->isObject() && current->isMember(CHILD_KEY)) {\n current = &(*current)[CHILD_KEY];\n }\n return *current;\n }\n Json::Value const &ParsedAlias::m_leaf() const {\n Json::Value const *current = &m_value;\n while (current->isObject() && current->isMember(CHILD_KEY)) {\n current = &(*current)[CHILD_KEY];\n }\n return *current;\n }\n\n} \/\/ namespace common\n} \/\/ namespace osvr<commit_msg>Make compatible with newer 0.y.z versions of jsoncpp.<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\/\/ \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 implied.\n\/\/ See the License for the specific language governing permissions and\n\/\/ limitations under the License.\n\n\/\/ Internal Includes\n#include <osvr\/Common\/ParseAlias.h>\n#include <osvr\/Util\/Verbosity.h>\n\n\/\/ Library\/third-party includes\n#include <json\/reader.h>\n#include <json\/writer.h>\n\n\/\/ Standard includes\n#include <sstream>\n\nnamespace osvr {\nnamespace common {\n\n \/\/\/ @brief Helper, converts old-style tracker source into normal. For a\n \/\/\/ little backward-compatibility.\n \/\/\/\n \/\/\/ @todo remove this method in the future.\n inline std::string getPathFromOldRouteSource(Json::Value obj) {\n std::ostringstream ret;\n if (obj.isObject() && obj.isMember(\"tracker\")) {\n auto tracker = obj[\"tracker\"].asString();\n if (tracker.front() != '\/') {\n ret << \"\/\";\n }\n ret << tracker;\n ret << \"\/tracker\";\n if (obj.isMember(\"sensor\")) {\n ret << \"\/\";\n ret << obj[\"sensor\"].asInt();\n }\n }\n return ret.str();\n }\n\n ParsedAlias::ParsedAlias(std::string const &src) : m_simple(true) {\n m_parse(src);\n }\n\n ParsedAlias::ParsedAlias(Json::Value src) : m_simple(true) { m_parse(src); }\n\n bool ParsedAlias::isValid() const { return !m_value.isNull(); }\n\n bool ParsedAlias::isSimple() const { return m_simple; }\n std::string ParsedAlias::getLeaf() const { return m_leaf().asString(); }\n void ParsedAlias::setLeaf(std::string const &leaf) { m_leaf() = leaf; }\n\n std::string ParsedAlias::getAlias() const {\n if (m_value.isString()) {\n return m_value.asString();\n }\n Json::FastWriter writer;\n std::string ret = writer.write(m_value);\n \/\/ Remove trailing line feed, if any.\n while (ret.back() == '\\n' || ret.back() == '\\r') {\n ret.pop_back();\n }\n return ret;\n }\n\n Json::Value ParsedAlias::getAliasValue() const { return m_value; }\n\n void ParsedAlias::m_parse(std::string const &src) {\n Json::Value val;\n Json::Reader reader;\n if (!reader.parse(src, val)) {\n \/\/ If it didn't parse as JSON, just assume it's a string.\n m_value = src;\n return;\n }\n m_parse(val);\n }\n\n static const char CHILD_KEY[] = \"child\";\n static const char SOURCE_KEY[] = \"source\";\n void ParsedAlias::m_parse(Json::Value &val) {\n if (val.isString()) {\n \/\/ Assume a string is just a string.\n m_value = val;\n return;\n }\n if (val.isObject()) {\n if (val.isMember(SOURCE_KEY)) {\n \/\/ Strip any initial \"source\" level\n m_parse(val[SOURCE_KEY]);\n return;\n }\n\n \/\/ Assume an object means a transform.\n m_simple = false;\n m_value = val;\n\n auto &leaf = m_leaf();\n if (leaf.isString()) {\n return;\n }\n\n auto trackerEquiv = getPathFromOldRouteSource(leaf);\n if (!trackerEquiv.empty()) {\n leaf = trackerEquiv;\n return;\n }\n\n OSVR_DEV_VERBOSE(\n \"Couldn't handle transform leaf: \" << leaf.toStyledString());\n }\n m_value = Json::nullValue;\n \/\/\/ @todo finish by throwing?\n }\n Json::Value &ParsedAlias::m_leaf() {\n Json::Value *current = &m_value;\n while (current->isObject() && current->isMember(CHILD_KEY)) {\n current = &(*current)[CHILD_KEY];\n }\n return *current;\n }\n Json::Value const &ParsedAlias::m_leaf() const {\n Json::Value const *current = &m_value;\n while (current->isObject() && current->isMember(CHILD_KEY)) {\n current = &(*current)[CHILD_KEY];\n }\n return *current;\n }\n\n} \/\/ namespace common\n} \/\/ namespace osvr<|endoftext|>"} {"text":"<commit_before>\/\/ Copyright (c) 2012 The Chromium Authors. All rights reserved.\n\/\/ Copyright (c) 2013 Adam Roben <adam@roben.org>. All rights reserved.\n\/\/ Use of this source code is governed by a BSD-style license that can be\n\/\/ found in the LICENSE-CHROMIUM file.\n\n#include \"browser\/inspectable_web_contents_impl.h\"\n\n#include \"browser\/browser_client.h\"\n#include \"browser\/browser_context.h\"\n#include \"browser\/browser_main_parts.h\"\n#include \"browser\/inspectable_web_contents_view.h\"\n\n#include \"base\/prefs\/pref_registry_simple.h\"\n#include \"base\/prefs\/pref_service.h\"\n#include \"base\/stringprintf.h\"\n#include \"base\/utf_string_conversions.h\"\n#include \"content\/public\/browser\/devtools_agent_host.h\"\n#include \"content\/public\/browser\/devtools_client_host.h\"\n#include \"content\/public\/browser\/devtools_http_handler.h\"\n#include \"content\/public\/browser\/devtools_manager.h\"\n#include \"content\/public\/browser\/web_contents_view.h\"\n#include \"content\/public\/browser\/render_view_host.h\"\n\nnamespace brightray {\n\nnamespace {\n\nconst char kDockSidePref[] = \"brightray.devtools.dockside\";\n\n}\n\n\/\/ Implemented separately on each platform.\nInspectableWebContentsView* CreateInspectableContentsView(InspectableWebContentsImpl*);\n\nvoid InspectableWebContentsImpl::RegisterPrefs(PrefRegistrySimple* registry) {\n registry->RegisterStringPref(kDockSidePref, \"bottom\");\n}\n\nInspectableWebContentsImpl::InspectableWebContentsImpl(content::WebContents* web_contents)\n : web_contents_(web_contents) {\n auto context = static_cast<BrowserContext*>(web_contents_->GetBrowserContext());\n dock_side_ = context->prefs()->GetString(kDockSidePref);\n\n view_.reset(CreateInspectableContentsView(this));\n}\n\nInspectableWebContentsImpl::~InspectableWebContentsImpl() {\n}\n\nInspectableWebContentsView* InspectableWebContentsImpl::GetView() const {\n return view_.get();\n}\n\ncontent::WebContents* InspectableWebContentsImpl::GetWebContents() const {\n return web_contents_.get();\n}\n\nvoid InspectableWebContentsImpl::ShowDevTools() {\n if (!devtools_web_contents_) {\n devtools_web_contents_.reset(content::WebContents::Create(content::WebContents::CreateParams(web_contents_->GetBrowserContext())));\n Observe(devtools_web_contents_.get());\n devtools_web_contents_->SetDelegate(this);\n\n agent_host_ = content::DevToolsAgentHost::GetOrCreateFor(web_contents_->GetRenderViewHost());\n frontend_host_.reset(content::DevToolsClientHost::CreateDevToolsFrontendHost(devtools_web_contents_.get(), this));\n\n auto handler = BrowserClient::Get()->browser_main_parts()->devtools_http_handler();\n auto url = handler->GetFrontendURL(nullptr);\n devtools_web_contents_->GetController().LoadURL(url, content::Referrer(), content::PAGE_TRANSITION_AUTO_TOPLEVEL, std::string());\n }\n\n view_->SetDockSide(dock_side_);\n view_->ShowDevTools();\n}\n\nvoid InspectableWebContentsImpl::UpdateFrontendDockSide() {\n auto javascript = base::StringPrintf(\"InspectorFrontendAPI.setDockSide(\\\"%s\\\")\", dock_side_.c_str());\n devtools_web_contents_->GetRenderViewHost()->ExecuteJavascriptInWebFrame(string16(), ASCIIToUTF16(javascript));\n}\n\nvoid InspectableWebContentsImpl::ActivateWindow() {\n}\n\nvoid InspectableWebContentsImpl::ChangeAttachedWindowHeight(unsigned height) {\n}\n\nvoid InspectableWebContentsImpl::CloseWindow() {\n view_->CloseDevTools();\n devtools_web_contents_.reset();\n web_contents_->GetView()->Focus();\n}\n\nvoid InspectableWebContentsImpl::MoveWindow(int x, int y) {\n}\n\nvoid InspectableWebContentsImpl::SetDockSide(const std::string& side) {\n if (!view_->SetDockSide(side))\n return;\n\n dock_side_ = side;\n\n auto context = static_cast<BrowserContext*>(web_contents_->GetBrowserContext());\n context->prefs()->SetString(kDockSidePref, side);\n\n UpdateFrontendDockSide();\n}\n\nvoid InspectableWebContentsImpl::OpenInNewTab(const std::string& url) {\n}\n\nvoid InspectableWebContentsImpl::SaveToFile(const std::string& url, const std::string& content, bool save_as) {\n}\n\nvoid InspectableWebContentsImpl::AppendToFile(const std::string& url, const std::string& content) {\n}\n\nvoid InspectableWebContentsImpl::RequestFileSystems() {\n}\n\nvoid InspectableWebContentsImpl::AddFileSystem() {\n}\n\nvoid InspectableWebContentsImpl::RemoveFileSystem(const std::string& file_system_path) {\n}\n\nvoid InspectableWebContentsImpl::InspectedContentsClosing() {\n}\n\nvoid InspectableWebContentsImpl::RenderViewCreated(content::RenderViewHost* render_view_host) {\n content::DevToolsClientHost::SetupDevToolsFrontendClient(web_contents()->GetRenderViewHost());\n content::DevToolsManager::GetInstance()->RegisterDevToolsClientHostFor(agent_host_, frontend_host_.get());\n}\n\nvoid InspectableWebContentsImpl::DidFinishLoad(int64, const GURL&, bool is_main_frame, content::RenderViewHost*) {\n if (!is_main_frame)\n return;\n\n UpdateFrontendDockSide();\n}\n\nvoid InspectableWebContentsImpl::WebContentsDestroyed(content::WebContents*) {\n content::DevToolsManager::GetInstance()->ClientHostClosing(frontend_host_.get());\n Observe(nullptr);\n agent_host_ = nullptr;\n frontend_host_.reset();\n}\n\nvoid InspectableWebContentsImpl::HandleKeyboardEvent(content::WebContents* source, const content::NativeWebKeyboardEvent& event) {\n auto delegate = web_contents_->GetDelegate();\n if (delegate)\n delegate->HandleKeyboardEvent(source, event);\n}\n\n}\n<commit_msg>Update for utf_string_conversions.h move in Chrome 29<commit_after>\/\/ Copyright (c) 2012 The Chromium Authors. All rights reserved.\n\/\/ Copyright (c) 2013 Adam Roben <adam@roben.org>. All rights reserved.\n\/\/ Use of this source code is governed by a BSD-style license that can be\n\/\/ found in the LICENSE-CHROMIUM file.\n\n#include \"browser\/inspectable_web_contents_impl.h\"\n\n#include \"browser\/browser_client.h\"\n#include \"browser\/browser_context.h\"\n#include \"browser\/browser_main_parts.h\"\n#include \"browser\/inspectable_web_contents_view.h\"\n\n#include \"base\/prefs\/pref_registry_simple.h\"\n#include \"base\/prefs\/pref_service.h\"\n#include \"base\/stringprintf.h\"\n#include \"base\/strings\/utf_string_conversions.h\"\n#include \"content\/public\/browser\/devtools_agent_host.h\"\n#include \"content\/public\/browser\/devtools_client_host.h\"\n#include \"content\/public\/browser\/devtools_http_handler.h\"\n#include \"content\/public\/browser\/devtools_manager.h\"\n#include \"content\/public\/browser\/web_contents_view.h\"\n#include \"content\/public\/browser\/render_view_host.h\"\n\nnamespace brightray {\n\nnamespace {\n\nconst char kDockSidePref[] = \"brightray.devtools.dockside\";\n\n}\n\n\/\/ Implemented separately on each platform.\nInspectableWebContentsView* CreateInspectableContentsView(InspectableWebContentsImpl*);\n\nvoid InspectableWebContentsImpl::RegisterPrefs(PrefRegistrySimple* registry) {\n registry->RegisterStringPref(kDockSidePref, \"bottom\");\n}\n\nInspectableWebContentsImpl::InspectableWebContentsImpl(content::WebContents* web_contents)\n : web_contents_(web_contents) {\n auto context = static_cast<BrowserContext*>(web_contents_->GetBrowserContext());\n dock_side_ = context->prefs()->GetString(kDockSidePref);\n\n view_.reset(CreateInspectableContentsView(this));\n}\n\nInspectableWebContentsImpl::~InspectableWebContentsImpl() {\n}\n\nInspectableWebContentsView* InspectableWebContentsImpl::GetView() const {\n return view_.get();\n}\n\ncontent::WebContents* InspectableWebContentsImpl::GetWebContents() const {\n return web_contents_.get();\n}\n\nvoid InspectableWebContentsImpl::ShowDevTools() {\n if (!devtools_web_contents_) {\n devtools_web_contents_.reset(content::WebContents::Create(content::WebContents::CreateParams(web_contents_->GetBrowserContext())));\n Observe(devtools_web_contents_.get());\n devtools_web_contents_->SetDelegate(this);\n\n agent_host_ = content::DevToolsAgentHost::GetOrCreateFor(web_contents_->GetRenderViewHost());\n frontend_host_.reset(content::DevToolsClientHost::CreateDevToolsFrontendHost(devtools_web_contents_.get(), this));\n\n auto handler = BrowserClient::Get()->browser_main_parts()->devtools_http_handler();\n auto url = handler->GetFrontendURL(nullptr);\n devtools_web_contents_->GetController().LoadURL(url, content::Referrer(), content::PAGE_TRANSITION_AUTO_TOPLEVEL, std::string());\n }\n\n view_->SetDockSide(dock_side_);\n view_->ShowDevTools();\n}\n\nvoid InspectableWebContentsImpl::UpdateFrontendDockSide() {\n auto javascript = base::StringPrintf(\"InspectorFrontendAPI.setDockSide(\\\"%s\\\")\", dock_side_.c_str());\n devtools_web_contents_->GetRenderViewHost()->ExecuteJavascriptInWebFrame(string16(), ASCIIToUTF16(javascript));\n}\n\nvoid InspectableWebContentsImpl::ActivateWindow() {\n}\n\nvoid InspectableWebContentsImpl::ChangeAttachedWindowHeight(unsigned height) {\n}\n\nvoid InspectableWebContentsImpl::CloseWindow() {\n view_->CloseDevTools();\n devtools_web_contents_.reset();\n web_contents_->GetView()->Focus();\n}\n\nvoid InspectableWebContentsImpl::MoveWindow(int x, int y) {\n}\n\nvoid InspectableWebContentsImpl::SetDockSide(const std::string& side) {\n if (!view_->SetDockSide(side))\n return;\n\n dock_side_ = side;\n\n auto context = static_cast<BrowserContext*>(web_contents_->GetBrowserContext());\n context->prefs()->SetString(kDockSidePref, side);\n\n UpdateFrontendDockSide();\n}\n\nvoid InspectableWebContentsImpl::OpenInNewTab(const std::string& url) {\n}\n\nvoid InspectableWebContentsImpl::SaveToFile(const std::string& url, const std::string& content, bool save_as) {\n}\n\nvoid InspectableWebContentsImpl::AppendToFile(const std::string& url, const std::string& content) {\n}\n\nvoid InspectableWebContentsImpl::RequestFileSystems() {\n}\n\nvoid InspectableWebContentsImpl::AddFileSystem() {\n}\n\nvoid InspectableWebContentsImpl::RemoveFileSystem(const std::string& file_system_path) {\n}\n\nvoid InspectableWebContentsImpl::InspectedContentsClosing() {\n}\n\nvoid InspectableWebContentsImpl::RenderViewCreated(content::RenderViewHost* render_view_host) {\n content::DevToolsClientHost::SetupDevToolsFrontendClient(web_contents()->GetRenderViewHost());\n content::DevToolsManager::GetInstance()->RegisterDevToolsClientHostFor(agent_host_, frontend_host_.get());\n}\n\nvoid InspectableWebContentsImpl::DidFinishLoad(int64, const GURL&, bool is_main_frame, content::RenderViewHost*) {\n if (!is_main_frame)\n return;\n\n UpdateFrontendDockSide();\n}\n\nvoid InspectableWebContentsImpl::WebContentsDestroyed(content::WebContents*) {\n content::DevToolsManager::GetInstance()->ClientHostClosing(frontend_host_.get());\n Observe(nullptr);\n agent_host_ = nullptr;\n frontend_host_.reset();\n}\n\nvoid InspectableWebContentsImpl::HandleKeyboardEvent(content::WebContents* source, const content::NativeWebKeyboardEvent& event) {\n auto delegate = web_contents_->GetDelegate();\n if (delegate)\n delegate->HandleKeyboardEvent(source, event);\n}\n\n}\n<|endoftext|>"} {"text":"<commit_before>\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\n\/\/ Copyright (c) 2013, Image Engine Design Inc. All rights reserved.\n\/\/\n\/\/ Redistribution and use in source and binary forms, with or without\n\/\/ modification, are permitted provided that the following conditions are\n\/\/ met:\n\/\/\n\/\/ * Redistributions of source code must retain the above\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 \"Gaffer\/Context.h\"\n\n#include \"GafferDispatchBindings\/ExecutableNodeBinding.h\"\n\n#include \"GafferScene\/OpenGLRender.h\"\n#include \"GafferScene\/InteractiveRender.h\"\n#include \"GafferScene\/Preview\/InteractiveRender.h\"\n\n#include \"GafferSceneBindings\/RenderBinding.h\"\n\nusing namespace boost::python;\n\nusing namespace Gaffer;\nusing namespace GafferBindings;\nusing namespace GafferDispatchBindings;\nusing namespace GafferScene;\n\nnamespace\n{\n\nclass ExecutableRenderWrapper : public ExecutableNodeWrapper<ExecutableRender>\n{\n\n\tpublic :\n\n\t\tExecutableRenderWrapper( PyObject *self, const std::string &name )\n\t\t\t:\tExecutableNodeWrapper<ExecutableRender>( self, name )\n\t\t{\n\t\t}\n\n\t\tvirtual IECore::RendererPtr createRenderer() const\n\t\t{\n\t\t\tif( this->isSubclassed() )\n\t\t\t{\n\t\t\t\tIECorePython::ScopedGILLock gilLock;\n\t\t\t\tboost::python::object f = this->methodOverride( \"_createRenderer\" );\n\t\t\t\tif( f )\n\t\t\t\t{\n\t\t\t\t\treturn extract<IECore::RendererPtr>( f() );\n\t\t\t\t}\n\t\t\t}\n\t\t\tthrow IECore::Exception( \"No _createRenderer method defined in Python.\" );\n\t\t}\n\n\t\tvirtual void outputWorldProcedural( const ScenePlug *scene, IECore::Renderer *renderer ) const\n\t\t{\n\t\t\tif( this->isSubclassed() )\n\t\t\t{\n\t\t\t\tIECorePython::ScopedGILLock gilLock;\n\t\t\t\tboost::python::object f = this->methodOverride( \"_outputWorldProcedural\" );\n\t\t\t\tif( f )\n\t\t\t\t{\n\t\t\t\t\tf( ScenePlugPtr( const_cast<ScenePlug *>( scene ) ), IECore::RendererPtr( renderer ) );\n\t\t\t\t\treturn;\n\t\t\t\t}\n\t\t\t}\n\t\t\treturn ExecutableRender::outputWorldProcedural( scene, renderer );\n\t\t}\n\n\t\tvirtual std::string command() const\n\t\t{\n\t\t\tif( this->isSubclassed() )\n\t\t\t{\n\t\t\t\tIECorePython::ScopedGILLock gilLock;\n\t\t\t\tboost::python::object f = this->methodOverride( \"_command\" );\n\t\t\t\tif( f )\n\t\t\t\t{\n\t\t\t\t\treturn extract<std::string>( f() );\n\t\t\t\t}\n\t\t\t}\n\t\t\treturn ExecutableRender::command();\n\t\t}\n\n};\n\nContextPtr interactiveRenderGetContext( InteractiveRender &r )\n{\n\treturn r.getContext();\n}\n\nContextPtr previewInteractiveRenderGetContext( Preview::InteractiveRender &r )\n{\n\treturn r.getContext();\n}\n\n} \/\/ namespace\n\nvoid GafferSceneBindings::bindRender()\n{\n\n\tExecutableNodeClass<ExecutableRender, ExecutableRenderWrapper>();\n\n\tExecutableNodeClass<OpenGLRender>();\n\n\t{\n\t\tscope s = GafferBindings::NodeClass<InteractiveRender>()\n\t\t\t.def( \"getContext\", &interactiveRenderGetContext )\n\t\t\t.def( \"setContext\", &InteractiveRender::setContext );\n\n\t\tenum_<InteractiveRender::State>( \"State\" )\n\t\t\t.value( \"Stopped\", InteractiveRender::Stopped )\n\t\t\t.value( \"Running\", InteractiveRender::Running )\n\t\t\t.value( \"Paused\", InteractiveRender::Paused )\n\t\t;\n\t}\n\n\t{\n\t\tobject previewModule( borrowed( PyImport_AddModule( \"GafferScene.Preview\" ) ) );\n\t\tscope().attr( \"Preview\" ) = previewModule;\n\n\t\tscope previewScope( previewModule );\n\n\t\tscope s = GafferBindings::NodeClass<GafferScene::Preview::InteractiveRender>()\n\t\t\t.def( \"getContext\", &previewInteractiveRenderGetContext )\n\t\t\t.def( \"setContext\", &GafferScene::Preview::InteractiveRender::setContext );\n\n\t\tenum_<GafferScene::Preview::InteractiveRender::State>( \"State\" )\n\t\t\t.value( \"Stopped\", GafferScene::Preview::InteractiveRender::Stopped )\n\t\t\t.value( \"Running\", GafferScene::Preview::InteractiveRender::Running )\n\t\t\t.value( \"Paused\", GafferScene::Preview::InteractiveRender::Paused )\n\t\t;\n\t}\n\n}\n<commit_msg>GafferScene module : Bind IECoreScenePreview::Renderer.<commit_after>\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\n\/\/ Copyright (c) 2013, Image Engine Design Inc. All rights reserved.\n\/\/\n\/\/ Redistribution and use in source and binary forms, with or without\n\/\/ modification, are permitted provided that the following conditions are\n\/\/ met:\n\/\/\n\/\/ * Redistributions of source code must retain the above\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 \"Gaffer\/Context.h\"\n\n#include \"GafferDispatchBindings\/ExecutableNodeBinding.h\"\n\n#include \"GafferScene\/OpenGLRender.h\"\n#include \"GafferScene\/InteractiveRender.h\"\n#include \"GafferScene\/Preview\/InteractiveRender.h\"\n#include \"GafferScene\/Private\/IECoreScenePreview\/Renderer.h\"\n\n#include \"GafferSceneBindings\/RenderBinding.h\"\n\nusing namespace boost::python;\n\nusing namespace IECoreScenePreview;\nusing namespace Gaffer;\nusing namespace GafferBindings;\nusing namespace GafferDispatchBindings;\nusing namespace GafferScene;\n\nnamespace\n{\n\nclass ExecutableRenderWrapper : public ExecutableNodeWrapper<ExecutableRender>\n{\n\n\tpublic :\n\n\t\tExecutableRenderWrapper( PyObject *self, const std::string &name )\n\t\t\t:\tExecutableNodeWrapper<ExecutableRender>( self, name )\n\t\t{\n\t\t}\n\n\t\tvirtual IECore::RendererPtr createRenderer() const\n\t\t{\n\t\t\tif( this->isSubclassed() )\n\t\t\t{\n\t\t\t\tIECorePython::ScopedGILLock gilLock;\n\t\t\t\tboost::python::object f = this->methodOverride( \"_createRenderer\" );\n\t\t\t\tif( f )\n\t\t\t\t{\n\t\t\t\t\treturn extract<IECore::RendererPtr>( f() );\n\t\t\t\t}\n\t\t\t}\n\t\t\tthrow IECore::Exception( \"No _createRenderer method defined in Python.\" );\n\t\t}\n\n\t\tvirtual void outputWorldProcedural( const ScenePlug *scene, IECore::Renderer *renderer ) const\n\t\t{\n\t\t\tif( this->isSubclassed() )\n\t\t\t{\n\t\t\t\tIECorePython::ScopedGILLock gilLock;\n\t\t\t\tboost::python::object f = this->methodOverride( \"_outputWorldProcedural\" );\n\t\t\t\tif( f )\n\t\t\t\t{\n\t\t\t\t\tf( ScenePlugPtr( const_cast<ScenePlug *>( scene ) ), IECore::RendererPtr( renderer ) );\n\t\t\t\t\treturn;\n\t\t\t\t}\n\t\t\t}\n\t\t\treturn ExecutableRender::outputWorldProcedural( scene, renderer );\n\t\t}\n\n\t\tvirtual std::string command() const\n\t\t{\n\t\t\tif( this->isSubclassed() )\n\t\t\t{\n\t\t\t\tIECorePython::ScopedGILLock gilLock;\n\t\t\t\tboost::python::object f = this->methodOverride( \"_command\" );\n\t\t\t\tif( f )\n\t\t\t\t{\n\t\t\t\t\treturn extract<std::string>( f() );\n\t\t\t\t}\n\t\t\t}\n\t\t\treturn ExecutableRender::command();\n\t\t}\n\n};\n\nContextPtr interactiveRenderGetContext( InteractiveRender &r )\n{\n\treturn r.getContext();\n}\n\nContextPtr previewInteractiveRenderGetContext( Preview::InteractiveRender &r )\n{\n\treturn r.getContext();\n}\n\nlist rendererTypes()\n{\n\tstd::vector<IECore::InternedString> t = Renderer::types();\n\tlist result;\n\tfor( std::vector<IECore::InternedString>::const_iterator it = t.begin(), eIt = t.end(); it != eIt; ++it )\n\t{\n\t\tresult.append( it->c_str() );\n\t}\n\treturn result;\n}\n\nIECoreScenePreview::Renderer::ObjectInterfacePtr rendererObject1( Renderer &renderer, const std::string &name, const IECore::Object *object )\n{\n\treturn renderer.object( name, object );\n}\n\nIECoreScenePreview::Renderer::ObjectInterfacePtr rendererObject2( Renderer &renderer, const std::string &name, object pythonSamples, object pythonTimes )\n{\n\tstd::vector<const IECore::Object *> samples;\n\tcontainer_utils::extend_container( samples, pythonSamples );\n\n\tstd::vector<float> times;\n\tcontainer_utils::extend_container( times, pythonTimes );\n\n\treturn renderer.object( name, samples, times );\n}\n\nvoid objectInterfaceTransform1( Renderer::ObjectInterface &objectInterface, const Imath::M44f &transform )\n{\n\tobjectInterface.transform( transform );\n}\n\nvoid objectInterfaceTransform2( Renderer::ObjectInterface &objectInterface, object pythonSamples, object pythonTimes )\n{\n\tstd::vector<Imath::M44f> samples;\n\tcontainer_utils::extend_container( samples, pythonSamples );\n\n\tstd::vector<float> times;\n\tcontainer_utils::extend_container( times, pythonTimes );\n\n\treturn objectInterface.transform( samples, times );\n}\n\n} \/\/ namespace\n\nvoid GafferSceneBindings::bindRender()\n{\n\n\tExecutableNodeClass<ExecutableRender, ExecutableRenderWrapper>();\n\n\tExecutableNodeClass<OpenGLRender>();\n\n\t{\n\t\tscope s = GafferBindings::NodeClass<InteractiveRender>()\n\t\t\t.def( \"getContext\", &interactiveRenderGetContext )\n\t\t\t.def( \"setContext\", &InteractiveRender::setContext );\n\n\t\tenum_<InteractiveRender::State>( \"State\" )\n\t\t\t.value( \"Stopped\", InteractiveRender::Stopped )\n\t\t\t.value( \"Running\", InteractiveRender::Running )\n\t\t\t.value( \"Paused\", InteractiveRender::Paused )\n\t\t;\n\t}\n\n\t{\n\t\tobject previewModule( borrowed( PyImport_AddModule( \"GafferScene.Preview\" ) ) );\n\t\tscope().attr( \"Preview\" ) = previewModule;\n\n\t\tscope previewScope( previewModule );\n\n\t\tscope s = GafferBindings::NodeClass<GafferScene::Preview::InteractiveRender>()\n\t\t\t.def( \"getContext\", &previewInteractiveRenderGetContext )\n\t\t\t.def( \"setContext\", &GafferScene::Preview::InteractiveRender::setContext );\n\n\t\tenum_<GafferScene::Preview::InteractiveRender::State>( \"State\" )\n\t\t\t.value( \"Stopped\", GafferScene::Preview::InteractiveRender::Stopped )\n\t\t\t.value( \"Running\", GafferScene::Preview::InteractiveRender::Running )\n\t\t\t.value( \"Paused\", GafferScene::Preview::InteractiveRender::Paused )\n\t\t;\n\t}\n\n\t{\n\t\tobject privateModule( borrowed( PyImport_AddModule( \"GafferScene.Private\" ) ) );\n\t\tscope().attr( \"Private\" ) = privateModule;\n\n\t\tobject ieCoreScenePreviewModule( borrowed( PyImport_AddModule( \"GafferScene.Private.IECoreScenePreview\" ) ) );\n\t\tscope().attr( \"Private\" ).attr( \"IECoreScenePreview\" ) = ieCoreScenePreviewModule;\n\n\t\tscope previewScope( ieCoreScenePreviewModule );\n\n\t\tIECorePython::RefCountedClass<Renderer, IECore::RefCounted> renderer( \"Renderer\" );\n\n\t\t{\n\t\t\tscope rendererScope( renderer );\n\n\t\t\tenum_<Renderer::RenderType>( \"RenderType\" )\n\t\t\t\t.value( \"Batch\", Renderer::Batch )\n\t\t\t\t.value( \"SceneDescription\", Renderer::SceneDescription )\n\t\t\t\t.value( \"Interactive\", Renderer::Interactive )\n\t\t\t;\n\n\t\t\tIECorePython::RefCountedClass<Renderer::AttributesInterface, IECore::RefCounted>( \"AttributesInterface\" );\n\n\t\t\tIECorePython::RefCountedClass<Renderer::ObjectInterface, IECore::RefCounted>( \"ObjectInterface\" )\n\t\t\t\t.def( \"transform\", objectInterfaceTransform1 )\n\t\t\t\t.def( \"transform\", objectInterfaceTransform2 )\n\t\t\t\t.def( \"attributes\", &Renderer::ObjectInterface::attributes )\n\t\t\t;\n\t\t}\n\n\t\trenderer\n\n\t\t\t.def( \"types\", &rendererTypes )\n\t\t\t.staticmethod( \"types\" )\n\t\t\t.def( \"create\", &Renderer::create, ( arg( \"type\" ), arg( \"renderType\" ) = Renderer::Batch, arg( \"fileName\" ) = \"\" ) )\n\t\t\t.staticmethod( \"create\" )\n\n\t\t\t.def( \"option\", &Renderer::option )\n\t\t\t.def( \"output\", &Renderer::output )\n\n\t\t\t.def( \"attributes\", &Renderer::attributes )\n\n\t\t\t.def( \"camera\", &Renderer::camera )\n\t\t\t.def( \"light\", &Renderer::light )\n\n\t\t\t.def( \"object\", &rendererObject1 )\n\t\t\t.def( \"object\", &rendererObject2 )\n\n\t\t\t.def( \"render\", &Renderer::render )\n\t\t\t.def( \"pause\", &Renderer::pause )\n\n\t\t;\n\n\t}\n\n}\n<|endoftext|>"} {"text":"<commit_before>\/**\n * \\ file InSndFilter.cpp\n *\/\n\n#include <ATK\/IO\/libsndfile\/InSndFileFilter.h>\n#include <ATK\/IO\/InWavFilter.h>\n\n#include <ATK\/config.h>\n\n#include <ATK\/Tools\/VolumeFilter.h>\n#include <ATK\/Tools\/SumFilter.h>\n\n#include <ATK\/Mock\/TriangleCheckerFilter.h>\n\n#define BOOST_TEST_NO_MAIN\n#include <boost\/test\/unit_test.hpp>\n\n#define PROCESSSIZE (1024)\n\nBOOST_AUTO_TEST_CASE( InSndFileFilter_InFloat_1k_test )\n{\n ATK::InSndFileFilter<float> generator(ATK_SOURCE_TREE \"\/tests\/data\/sinus1k.wav\");\n \n ATK::InWavFilter<float> filter(ATK_SOURCE_TREE \"\/tests\/data\/sinus1k.wav\");\n filter.set_output_sampling_rate(48000);\n\n ATK::VolumeFilter<float> gainfilter;\n gainfilter.set_input_sampling_rate(48000);\n gainfilter.set_volume(-1);\n\n ATK::SumFilter<float> sumfilter;\n sumfilter.set_input_sampling_rate(48000);\n \n ATK::TriangleCheckerFilter<float> checker;\n checker.set_input_sampling_rate(48000);\n checker.set_amplitude(0);\n checker.set_frequency(1000);\n \n gainfilter.set_input_port(0, &generator, 0);\n sumfilter.set_input_port(0, &gainfilter, 0);\n sumfilter.set_input_port(1, &filter, 0);\n \n checker.set_input_port(0, &sumfilter, 0);\n \n checker.process(PROCESSSIZE);\n}\n\nBOOST_AUTO_TEST_CASE( InSndFileFilter_InFloat_1k2k_test )\n{\n ATK::InSndFileFilter<float> generator(ATK_SOURCE_TREE \"\/tests\/data\/sinus1k2k.wav\");\n \n ATK::VolumeFilter<float> gainfilter1;\n gainfilter1.set_input_sampling_rate(48000);\n gainfilter1.set_volume(-1);\n gainfilter1.set_input_port(0, &generator, 0);\n\n ATK::VolumeFilter<float> gainfilter2;\n gainfilter2.set_input_sampling_rate(48000);\n gainfilter2.set_volume(-1);\n gainfilter2.set_input_port(0, &generator, 1);\n\n ATK::InWavFilter<float> filter(ATK_SOURCE_TREE \"\/tests\/data\/sinus1k2k.wav\");\n filter.set_output_sampling_rate(48000);\n \n ATK::SumFilter<float> sumfilter1;\n sumfilter1.set_input_sampling_rate(48000);\n sumfilter1.set_input_port(0, &gainfilter1, 0);\n sumfilter1.set_input_port(1, &filter, 0);\n \n ATK::SumFilter<float> sumfilter2;\n sumfilter2.set_input_sampling_rate(48000);\n sumfilter2.set_input_port(0, &gainfilter2, 0);\n sumfilter2.set_input_port(1, &filter, 1);\n \n ATK::SumFilter<float> sumfilter3;\n sumfilter3.set_input_sampling_rate(48000);\n sumfilter3.set_input_port(0, &sumfilter1, 0);\n sumfilter3.set_input_port(1, &sumfilter2, 0);\n \n ATK::TriangleCheckerFilter<float> checker;\n checker.set_input_sampling_rate(48000);\n checker.set_amplitude(0);\n checker.set_frequency(1000);\n \n checker.set_input_port(0, &sumfilter3, 0);\n \n checker.process(PROCESSSIZE);\n}\n\nBOOST_AUTO_TEST_CASE( InSndFileFilter_InDouble_1k_test )\n{\n ATK::InSndFileFilter<double> generator(ATK_SOURCE_TREE \"\/tests\/data\/sinus1k.wav\");\n \n ATK::InWavFilter<double> filter(ATK_SOURCE_TREE \"\/tests\/data\/sinus1k.wav\");\n filter.set_output_sampling_rate(48000);\n \n ATK::VolumeFilter<double> gainfilter;\n gainfilter.set_input_sampling_rate(48000);\n gainfilter.set_volume(-1);\n \n ATK::SumFilter<double> sumfilter;\n sumfilter.set_input_sampling_rate(48000);\n \n ATK::TriangleCheckerFilter<double> checker;\n checker.set_input_sampling_rate(48000);\n checker.set_amplitude(0);\n checker.set_frequency(1000);\n \n gainfilter.set_input_port(0, &generator, 0);\n sumfilter.set_input_port(0, &gainfilter, 0);\n sumfilter.set_input_port(1, &filter, 0);\n \n checker.set_input_port(0, &sumfilter, 0);\n \n checker.process(PROCESSSIZE);\n}\n\nBOOST_AUTO_TEST_CASE( InSndFileFilter_InDouble_1k2k_test )\n{\n ATK::InSndFileFilter<double> generator(ATK_SOURCE_TREE \"\/tests\/data\/sinus1k2k.wav\");\n \n ATK::VolumeFilter<double> gainfilter1;\n gainfilter1.set_input_sampling_rate(48000);\n gainfilter1.set_volume(-1);\n gainfilter1.set_input_port(0, &generator, 0);\n \n ATK::VolumeFilter<double> gainfilter2;\n gainfilter2.set_input_sampling_rate(48000);\n gainfilter2.set_volume(-1);\n gainfilter2.set_input_port(0, &generator, 1);\n \n ATK::InWavFilter<double> filter(ATK_SOURCE_TREE \"\/tests\/data\/sinus1k2k.wav\");\n filter.set_output_sampling_rate(48000);\n \n ATK::SumFilter<double> sumfilter1;\n sumfilter1.set_input_sampling_rate(48000);\n sumfilter1.set_input_port(0, &gainfilter1, 0);\n sumfilter1.set_input_port(1, &filter, 0);\n \n ATK::SumFilter<double> sumfilter2;\n sumfilter2.set_input_sampling_rate(48000);\n sumfilter2.set_input_port(0, &gainfilter2, 0);\n sumfilter2.set_input_port(1, &filter, 1);\n \n ATK::SumFilter<double> sumfilter3;\n sumfilter3.set_input_sampling_rate(48000);\n sumfilter3.set_input_port(0, &sumfilter1, 0);\n sumfilter3.set_input_port(1, &sumfilter2, 0);\n \n ATK::TriangleCheckerFilter<double> checker;\n checker.set_input_sampling_rate(48000);\n checker.set_amplitude(0);\n checker.set_frequency(1000);\n \n checker.set_input_port(0, &sumfilter3, 0);\n \n checker.process(PROCESSSIZE);\n}\n<commit_msg>More checks on input frames (libsndfile)<commit_after>\/**\n * \\ file InSndFilter.cpp\n *\/\n\n#include <ATK\/IO\/libsndfile\/InSndFileFilter.h>\n#include <ATK\/IO\/InWavFilter.h>\n\n#include <ATK\/config.h>\n\n#include <ATK\/Tools\/VolumeFilter.h>\n#include <ATK\/Tools\/SumFilter.h>\n\n#include <ATK\/Mock\/TriangleCheckerFilter.h>\n\n#define BOOST_TEST_NO_MAIN\n#include <boost\/test\/unit_test.hpp>\n\nconst size_t PROCESSSIZE = 1024;\n\nBOOST_AUTO_TEST_CASE( InSndFileFilter_InFloat_1k_test )\n{\n ATK::InSndFileFilter<float> generator(ATK_SOURCE_TREE \"\/tests\/data\/sinus1k.wav\");\n BOOST_CHECK_EQUAL(generator.get_frames(), PROCESSSIZE);\n \n ATK::InWavFilter<float> filter(ATK_SOURCE_TREE \"\/tests\/data\/sinus1k.wav\");\n filter.set_output_sampling_rate(48000);\n\n ATK::VolumeFilter<float> gainfilter;\n gainfilter.set_input_sampling_rate(48000);\n gainfilter.set_volume(-1);\n\n ATK::SumFilter<float> sumfilter;\n sumfilter.set_input_sampling_rate(48000);\n \n ATK::TriangleCheckerFilter<float> checker;\n checker.set_input_sampling_rate(48000);\n checker.set_amplitude(0);\n checker.set_frequency(1000);\n \n gainfilter.set_input_port(0, &generator, 0);\n sumfilter.set_input_port(0, &gainfilter, 0);\n sumfilter.set_input_port(1, &filter, 0);\n \n checker.set_input_port(0, &sumfilter, 0);\n \n checker.process(PROCESSSIZE);\n}\n\nBOOST_AUTO_TEST_CASE( InSndFileFilter_InFloat_1k2k_test )\n{\n ATK::InSndFileFilter<float> generator(ATK_SOURCE_TREE \"\/tests\/data\/sinus1k2k.wav\");\n \n ATK::VolumeFilter<float> gainfilter1;\n gainfilter1.set_input_sampling_rate(48000);\n gainfilter1.set_volume(-1);\n gainfilter1.set_input_port(0, &generator, 0);\n\n ATK::VolumeFilter<float> gainfilter2;\n gainfilter2.set_input_sampling_rate(48000);\n gainfilter2.set_volume(-1);\n gainfilter2.set_input_port(0, &generator, 1);\n\n ATK::InWavFilter<float> filter(ATK_SOURCE_TREE \"\/tests\/data\/sinus1k2k.wav\");\n filter.set_output_sampling_rate(48000);\n \n ATK::SumFilter<float> sumfilter1;\n sumfilter1.set_input_sampling_rate(48000);\n sumfilter1.set_input_port(0, &gainfilter1, 0);\n sumfilter1.set_input_port(1, &filter, 0);\n \n ATK::SumFilter<float> sumfilter2;\n sumfilter2.set_input_sampling_rate(48000);\n sumfilter2.set_input_port(0, &gainfilter2, 0);\n sumfilter2.set_input_port(1, &filter, 1);\n \n ATK::SumFilter<float> sumfilter3;\n sumfilter3.set_input_sampling_rate(48000);\n sumfilter3.set_input_port(0, &sumfilter1, 0);\n sumfilter3.set_input_port(1, &sumfilter2, 0);\n \n ATK::TriangleCheckerFilter<float> checker;\n checker.set_input_sampling_rate(48000);\n checker.set_amplitude(0);\n checker.set_frequency(1000);\n \n checker.set_input_port(0, &sumfilter3, 0);\n \n checker.process(PROCESSSIZE);\n}\n\nBOOST_AUTO_TEST_CASE( InSndFileFilter_InDouble_1k_test )\n{\n ATK::InSndFileFilter<double> generator(ATK_SOURCE_TREE \"\/tests\/data\/sinus1k.wav\");\n \n ATK::InWavFilter<double> filter(ATK_SOURCE_TREE \"\/tests\/data\/sinus1k.wav\");\n filter.set_output_sampling_rate(48000);\n \n ATK::VolumeFilter<double> gainfilter;\n gainfilter.set_input_sampling_rate(48000);\n gainfilter.set_volume(-1);\n \n ATK::SumFilter<double> sumfilter;\n sumfilter.set_input_sampling_rate(48000);\n \n ATK::TriangleCheckerFilter<double> checker;\n checker.set_input_sampling_rate(48000);\n checker.set_amplitude(0);\n checker.set_frequency(1000);\n \n gainfilter.set_input_port(0, &generator, 0);\n sumfilter.set_input_port(0, &gainfilter, 0);\n sumfilter.set_input_port(1, &filter, 0);\n \n checker.set_input_port(0, &sumfilter, 0);\n \n checker.process(PROCESSSIZE);\n}\n\nBOOST_AUTO_TEST_CASE( InSndFileFilter_InDouble_1k2k_test )\n{\n ATK::InSndFileFilter<double> generator(ATK_SOURCE_TREE \"\/tests\/data\/sinus1k2k.wav\");\n \n ATK::VolumeFilter<double> gainfilter1;\n gainfilter1.set_input_sampling_rate(48000);\n gainfilter1.set_volume(-1);\n gainfilter1.set_input_port(0, &generator, 0);\n \n ATK::VolumeFilter<double> gainfilter2;\n gainfilter2.set_input_sampling_rate(48000);\n gainfilter2.set_volume(-1);\n gainfilter2.set_input_port(0, &generator, 1);\n \n ATK::InWavFilter<double> filter(ATK_SOURCE_TREE \"\/tests\/data\/sinus1k2k.wav\");\n filter.set_output_sampling_rate(48000);\n \n ATK::SumFilter<double> sumfilter1;\n sumfilter1.set_input_sampling_rate(48000);\n sumfilter1.set_input_port(0, &gainfilter1, 0);\n sumfilter1.set_input_port(1, &filter, 0);\n \n ATK::SumFilter<double> sumfilter2;\n sumfilter2.set_input_sampling_rate(48000);\n sumfilter2.set_input_port(0, &gainfilter2, 0);\n sumfilter2.set_input_port(1, &filter, 1);\n \n ATK::SumFilter<double> sumfilter3;\n sumfilter3.set_input_sampling_rate(48000);\n sumfilter3.set_input_port(0, &sumfilter1, 0);\n sumfilter3.set_input_port(1, &sumfilter2, 0);\n \n ATK::TriangleCheckerFilter<double> checker;\n checker.set_input_sampling_rate(48000);\n checker.set_amplitude(0);\n checker.set_frequency(1000);\n \n checker.set_input_port(0, &sumfilter3, 0);\n \n checker.process(PROCESSSIZE);\n}\n<|endoftext|>"} {"text":"<commit_before>\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ File: lstmtraining.cpp\n\/\/ Description: Training program for LSTM-based networks.\n\/\/ Author: Ray Smith\n\/\/ Created: Fri May 03 11:05:06 PST 2013\n\/\/\n\/\/ (C) Copyright 2013, 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#ifdef GOOGLE_TESSERACT\n#include \"base\/commandlineflags.h\"\n#endif\n#include \"commontraining.h\"\n#include \"lstmtester.h\"\n#include \"lstmtrainer.h\"\n#include \"params.h\"\n#include \"strngs.h\"\n#include \"tprintf.h\"\n#include \"unicharset_training_utils.h\"\n\nINT_PARAM_FLAG(debug_interval, 0, \"How often to display the alignment.\");\nSTRING_PARAM_FLAG(net_spec, \"\", \"Network specification\");\nINT_PARAM_FLAG(net_mode, 192, \"Controls network behavior.\");\nINT_PARAM_FLAG(perfect_sample_delay, 0,\n \"How many imperfect samples between perfect ones.\");\nDOUBLE_PARAM_FLAG(target_error_rate, 0.01, \"Final error rate in percent.\");\nDOUBLE_PARAM_FLAG(weight_range, 0.1, \"Range of initial random weights.\");\nDOUBLE_PARAM_FLAG(learning_rate, 10.0e-4, \"Weight factor for new deltas.\");\nDOUBLE_PARAM_FLAG(momentum, 0.5, \"Decay factor for repeating deltas.\");\nDOUBLE_PARAM_FLAG(adam_beta, 0.999, \"Decay factor for repeating deltas.\");\nINT_PARAM_FLAG(max_image_MB, 6000, \"Max memory to use for images.\");\nSTRING_PARAM_FLAG(continue_from, \"\", \"Existing model to extend\");\nSTRING_PARAM_FLAG(model_output, \"lstmtrain\", \"Basename for output models\");\nSTRING_PARAM_FLAG(train_listfile, \"\",\n \"File listing training files in lstmf training format.\");\nSTRING_PARAM_FLAG(eval_listfile, \"\",\n \"File listing eval files in lstmf training format.\");\nBOOL_PARAM_FLAG(stop_training, false,\n \"Just convert the training model to a runtime model.\");\nBOOL_PARAM_FLAG(convert_to_int, false,\n \"Convert the recognition model to an integer model.\");\nBOOL_PARAM_FLAG(sequential_training, false,\n \"Use the training files sequentially instead of round-robin.\");\nINT_PARAM_FLAG(append_index, -1, \"Index in continue_from Network at which to\"\n \" attach the new network defined by net_spec\");\nBOOL_PARAM_FLAG(debug_network, false,\n \"Get info on distribution of weight values\");\nINT_PARAM_FLAG(max_iterations, 0, \"If set, exit after this many iterations\");\nSTRING_PARAM_FLAG(traineddata, \"\",\n \"Combined Dawgs\/Unicharset\/Recoder for language model\");\nSTRING_PARAM_FLAG(old_traineddata, \"\",\n \"When changing the character set, this specifies the old\"\n \" character set that is to be replaced\");\nBOOL_PARAM_FLAG(randomly_rotate, false,\n \"Train OSD and randomly turn training samples upside-down\");\n\n\/\/ Number of training images to train between calls to MaintainCheckpoints.\nconst int kNumPagesPerBatch = 100;\n\n\/\/ Apart from command-line flags, input is a collection of lstmf files, that\n\/\/ were previously created using tesseract with the lstm.train config file.\n\/\/ The program iterates over the inputs, feeding the data to the network,\n\/\/ until the error rate reaches a specified target or max_iterations is reached.\nint main(int argc, char **argv) {\n tesseract::CheckSharedLibraryVersion();\n ParseArguments(&argc, &argv);\n \/\/ Purify the model name in case it is based on the network string.\n if (FLAGS_model_output.empty()) {\n tprintf(\"Must provide a --model_output!\\n\");\n return EXIT_FAILURE;\n }\n if (FLAGS_traineddata.empty()) {\n tprintf(\"Must provide a --traineddata see training wiki\\n\");\n return EXIT_FAILURE;\n }\n STRING model_output = FLAGS_model_output.c_str();\n for (int i = 0; i < model_output.length(); ++i) {\n if (model_output[i] == '[' || model_output[i] == ']')\n model_output[i] = '-';\n if (model_output[i] == '(' || model_output[i] == ')')\n model_output[i] = '_';\n }\n\n \/\/ Check write permissions.\n STRING test_file = FLAGS_model_output.c_str();\n test_file += \"_wtest\";\n FILE* f = fopen(test_file.c_str(), \"wb\");\n if (f != nullptr) {\n fclose(f);\n remove(test_file.c_str());\n } else {\n tprintf(\"Error, model output cannot be written: %s\\n\", strerror(errno));\n return EXIT_FAILURE;\n }\n\n \/\/ Setup the trainer.\n STRING checkpoint_file = FLAGS_model_output.c_str();\n checkpoint_file += \"_checkpoint\";\n STRING checkpoint_bak = checkpoint_file + \".bak\";\n tesseract::LSTMTrainer trainer(\n nullptr, nullptr, nullptr, nullptr, FLAGS_model_output.c_str(),\n checkpoint_file.c_str(), FLAGS_debug_interval,\n static_cast<int64_t>(FLAGS_max_image_MB) * 1048576);\n trainer.InitCharSet(FLAGS_traineddata.c_str());\n\n \/\/ Reading something from an existing model doesn't require many flags,\n \/\/ so do it now and exit.\n if (FLAGS_stop_training || FLAGS_debug_network) {\n if (!trainer.TryLoadingCheckpoint(FLAGS_continue_from.c_str(), nullptr)) {\n tprintf(\"Failed to read continue from: %s\\n\",\n FLAGS_continue_from.c_str());\n return EXIT_FAILURE;\n }\n if (FLAGS_debug_network) {\n trainer.DebugNetwork();\n } else {\n if (FLAGS_convert_to_int) trainer.ConvertToInt();\n if (!trainer.SaveTraineddata(FLAGS_model_output.c_str())) {\n tprintf(\"Failed to write recognition model : %s\\n\",\n FLAGS_model_output.c_str());\n }\n }\n return EXIT_SUCCESS;\n }\n\n \/\/ Get the list of files to process.\n if (FLAGS_train_listfile.empty()) {\n tprintf(\"Must supply a list of training filenames! --train_listfile\\n\");\n return EXIT_FAILURE;\n }\n GenericVector<STRING> filenames;\n if (!tesseract::LoadFileLinesToStrings(FLAGS_train_listfile.c_str(),\n &filenames)) {\n tprintf(\"Failed to load list of training filenames from %s\\n\",\n FLAGS_train_listfile.c_str());\n return EXIT_FAILURE;\n }\n\n \/\/ Checkpoints always take priority if they are available.\n if (trainer.TryLoadingCheckpoint(checkpoint_file.string(), nullptr) ||\n trainer.TryLoadingCheckpoint(checkpoint_bak.string(), nullptr)) {\n tprintf(\"Successfully restored trainer from %s\\n\",\n checkpoint_file.string());\n } else {\n if (!FLAGS_continue_from.empty()) {\n \/\/ Load a past model file to improve upon.\n if (!trainer.TryLoadingCheckpoint(FLAGS_continue_from.c_str(),\n FLAGS_append_index >= 0\n ? FLAGS_continue_from.c_str()\n : FLAGS_old_traineddata.c_str())) {\n tprintf(\"Failed to continue from: %s\\n\", FLAGS_continue_from.c_str());\n return EXIT_FAILURE;\n }\n tprintf(\"Continuing from %s\\n\", FLAGS_continue_from.c_str());\n trainer.InitIterations();\n }\n if (FLAGS_continue_from.empty() || FLAGS_append_index >= 0) {\n if (FLAGS_append_index >= 0) {\n tprintf(\"Appending a new network to an old one!!\");\n if (FLAGS_continue_from.empty()) {\n tprintf(\"Must set --continue_from for appending!\\n\");\n return EXIT_FAILURE;\n }\n }\n \/\/ We are initializing from scratch.\n if (!trainer.InitNetwork(FLAGS_net_spec.c_str(), FLAGS_append_index,\n FLAGS_net_mode, FLAGS_weight_range,\n FLAGS_learning_rate, FLAGS_momentum,\n FLAGS_adam_beta)) {\n tprintf(\"Failed to create network from spec: %s\\n\",\n FLAGS_net_spec.c_str());\n return EXIT_FAILURE;\n }\n trainer.set_perfect_delay(FLAGS_perfect_sample_delay);\n }\n }\n if (!trainer.LoadAllTrainingData(filenames,\n FLAGS_sequential_training\n ? tesseract::CS_SEQUENTIAL\n : tesseract::CS_ROUND_ROBIN,\n FLAGS_randomly_rotate)) {\n tprintf(\"Load of images failed!!\\n\");\n return EXIT_FAILURE;\n }\n\n tesseract::LSTMTester tester(static_cast<int64_t>(FLAGS_max_image_MB) *\n 1048576);\n tesseract::TestCallback tester_callback = nullptr;\n if (!FLAGS_eval_listfile.empty()) {\n if (!tester.LoadAllEvalData(FLAGS_eval_listfile.c_str())) {\n tprintf(\"Failed to load eval data from: %s\\n\",\n FLAGS_eval_listfile.c_str());\n return EXIT_FAILURE;\n }\n tester_callback =\n NewPermanentTessCallback(&tester, &tesseract::LSTMTester::RunEvalAsync);\n }\n do {\n \/\/ Train a few.\n int iteration = trainer.training_iteration();\n for (int target_iteration = iteration + kNumPagesPerBatch;\n iteration < target_iteration &&\n (iteration < FLAGS_max_iterations || FLAGS_max_iterations == 0);\n iteration = trainer.training_iteration()) {\n trainer.TrainOnLine(&trainer, false);\n }\n STRING log_str;\n trainer.MaintainCheckpoints(tester_callback, &log_str);\n tprintf(\"%s\\n\", log_str.string());\n } while (trainer.best_error_rate() > FLAGS_target_error_rate &&\n (trainer.training_iteration() < FLAGS_max_iterations ||\n FLAGS_max_iterations == 0));\n delete tester_callback;\n tprintf(\"Finished! Error rate = %g\\n\", trainer.best_error_rate());\n return EXIT_SUCCESS;\n} \/* main *\/\n<commit_msg>lstmtraining: Remove dead code for purified model name<commit_after>\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ File: lstmtraining.cpp\n\/\/ Description: Training program for LSTM-based networks.\n\/\/ Author: Ray Smith\n\/\/ Created: Fri May 03 11:05:06 PST 2013\n\/\/\n\/\/ (C) Copyright 2013, 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#ifdef GOOGLE_TESSERACT\n#include \"base\/commandlineflags.h\"\n#endif\n#include \"commontraining.h\"\n#include \"lstmtester.h\"\n#include \"lstmtrainer.h\"\n#include \"params.h\"\n#include \"strngs.h\"\n#include \"tprintf.h\"\n#include \"unicharset_training_utils.h\"\n\nINT_PARAM_FLAG(debug_interval, 0, \"How often to display the alignment.\");\nSTRING_PARAM_FLAG(net_spec, \"\", \"Network specification\");\nINT_PARAM_FLAG(net_mode, 192, \"Controls network behavior.\");\nINT_PARAM_FLAG(perfect_sample_delay, 0,\n \"How many imperfect samples between perfect ones.\");\nDOUBLE_PARAM_FLAG(target_error_rate, 0.01, \"Final error rate in percent.\");\nDOUBLE_PARAM_FLAG(weight_range, 0.1, \"Range of initial random weights.\");\nDOUBLE_PARAM_FLAG(learning_rate, 10.0e-4, \"Weight factor for new deltas.\");\nDOUBLE_PARAM_FLAG(momentum, 0.5, \"Decay factor for repeating deltas.\");\nDOUBLE_PARAM_FLAG(adam_beta, 0.999, \"Decay factor for repeating deltas.\");\nINT_PARAM_FLAG(max_image_MB, 6000, \"Max memory to use for images.\");\nSTRING_PARAM_FLAG(continue_from, \"\", \"Existing model to extend\");\nSTRING_PARAM_FLAG(model_output, \"lstmtrain\", \"Basename for output models\");\nSTRING_PARAM_FLAG(train_listfile, \"\",\n \"File listing training files in lstmf training format.\");\nSTRING_PARAM_FLAG(eval_listfile, \"\",\n \"File listing eval files in lstmf training format.\");\nBOOL_PARAM_FLAG(stop_training, false,\n \"Just convert the training model to a runtime model.\");\nBOOL_PARAM_FLAG(convert_to_int, false,\n \"Convert the recognition model to an integer model.\");\nBOOL_PARAM_FLAG(sequential_training, false,\n \"Use the training files sequentially instead of round-robin.\");\nINT_PARAM_FLAG(append_index, -1, \"Index in continue_from Network at which to\"\n \" attach the new network defined by net_spec\");\nBOOL_PARAM_FLAG(debug_network, false,\n \"Get info on distribution of weight values\");\nINT_PARAM_FLAG(max_iterations, 0, \"If set, exit after this many iterations\");\nSTRING_PARAM_FLAG(traineddata, \"\",\n \"Combined Dawgs\/Unicharset\/Recoder for language model\");\nSTRING_PARAM_FLAG(old_traineddata, \"\",\n \"When changing the character set, this specifies the old\"\n \" character set that is to be replaced\");\nBOOL_PARAM_FLAG(randomly_rotate, false,\n \"Train OSD and randomly turn training samples upside-down\");\n\n\/\/ Number of training images to train between calls to MaintainCheckpoints.\nconst int kNumPagesPerBatch = 100;\n\n\/\/ Apart from command-line flags, input is a collection of lstmf files, that\n\/\/ were previously created using tesseract with the lstm.train config file.\n\/\/ The program iterates over the inputs, feeding the data to the network,\n\/\/ until the error rate reaches a specified target or max_iterations is reached.\nint main(int argc, char **argv) {\n tesseract::CheckSharedLibraryVersion();\n ParseArguments(&argc, &argv);\n if (FLAGS_model_output.empty()) {\n tprintf(\"Must provide a --model_output!\\n\");\n return EXIT_FAILURE;\n }\n if (FLAGS_traineddata.empty()) {\n tprintf(\"Must provide a --traineddata see training wiki\\n\");\n return EXIT_FAILURE;\n }\n\n \/\/ Check write permissions.\n STRING test_file = FLAGS_model_output.c_str();\n test_file += \"_wtest\";\n FILE* f = fopen(test_file.c_str(), \"wb\");\n if (f != nullptr) {\n fclose(f);\n remove(test_file.c_str());\n } else {\n tprintf(\"Error, model output cannot be written: %s\\n\", strerror(errno));\n return EXIT_FAILURE;\n }\n\n \/\/ Setup the trainer.\n STRING checkpoint_file = FLAGS_model_output.c_str();\n checkpoint_file += \"_checkpoint\";\n STRING checkpoint_bak = checkpoint_file + \".bak\";\n tesseract::LSTMTrainer trainer(\n nullptr, nullptr, nullptr, nullptr, FLAGS_model_output.c_str(),\n checkpoint_file.c_str(), FLAGS_debug_interval,\n static_cast<int64_t>(FLAGS_max_image_MB) * 1048576);\n trainer.InitCharSet(FLAGS_traineddata.c_str());\n\n \/\/ Reading something from an existing model doesn't require many flags,\n \/\/ so do it now and exit.\n if (FLAGS_stop_training || FLAGS_debug_network) {\n if (!trainer.TryLoadingCheckpoint(FLAGS_continue_from.c_str(), nullptr)) {\n tprintf(\"Failed to read continue from: %s\\n\",\n FLAGS_continue_from.c_str());\n return EXIT_FAILURE;\n }\n if (FLAGS_debug_network) {\n trainer.DebugNetwork();\n } else {\n if (FLAGS_convert_to_int) trainer.ConvertToInt();\n if (!trainer.SaveTraineddata(FLAGS_model_output.c_str())) {\n tprintf(\"Failed to write recognition model : %s\\n\",\n FLAGS_model_output.c_str());\n }\n }\n return EXIT_SUCCESS;\n }\n\n \/\/ Get the list of files to process.\n if (FLAGS_train_listfile.empty()) {\n tprintf(\"Must supply a list of training filenames! --train_listfile\\n\");\n return EXIT_FAILURE;\n }\n GenericVector<STRING> filenames;\n if (!tesseract::LoadFileLinesToStrings(FLAGS_train_listfile.c_str(),\n &filenames)) {\n tprintf(\"Failed to load list of training filenames from %s\\n\",\n FLAGS_train_listfile.c_str());\n return EXIT_FAILURE;\n }\n\n \/\/ Checkpoints always take priority if they are available.\n if (trainer.TryLoadingCheckpoint(checkpoint_file.string(), nullptr) ||\n trainer.TryLoadingCheckpoint(checkpoint_bak.string(), nullptr)) {\n tprintf(\"Successfully restored trainer from %s\\n\",\n checkpoint_file.string());\n } else {\n if (!FLAGS_continue_from.empty()) {\n \/\/ Load a past model file to improve upon.\n if (!trainer.TryLoadingCheckpoint(FLAGS_continue_from.c_str(),\n FLAGS_append_index >= 0\n ? FLAGS_continue_from.c_str()\n : FLAGS_old_traineddata.c_str())) {\n tprintf(\"Failed to continue from: %s\\n\", FLAGS_continue_from.c_str());\n return EXIT_FAILURE;\n }\n tprintf(\"Continuing from %s\\n\", FLAGS_continue_from.c_str());\n trainer.InitIterations();\n }\n if (FLAGS_continue_from.empty() || FLAGS_append_index >= 0) {\n if (FLAGS_append_index >= 0) {\n tprintf(\"Appending a new network to an old one!!\");\n if (FLAGS_continue_from.empty()) {\n tprintf(\"Must set --continue_from for appending!\\n\");\n return EXIT_FAILURE;\n }\n }\n \/\/ We are initializing from scratch.\n if (!trainer.InitNetwork(FLAGS_net_spec.c_str(), FLAGS_append_index,\n FLAGS_net_mode, FLAGS_weight_range,\n FLAGS_learning_rate, FLAGS_momentum,\n FLAGS_adam_beta)) {\n tprintf(\"Failed to create network from spec: %s\\n\",\n FLAGS_net_spec.c_str());\n return EXIT_FAILURE;\n }\n trainer.set_perfect_delay(FLAGS_perfect_sample_delay);\n }\n }\n if (!trainer.LoadAllTrainingData(filenames,\n FLAGS_sequential_training\n ? tesseract::CS_SEQUENTIAL\n : tesseract::CS_ROUND_ROBIN,\n FLAGS_randomly_rotate)) {\n tprintf(\"Load of images failed!!\\n\");\n return EXIT_FAILURE;\n }\n\n tesseract::LSTMTester tester(static_cast<int64_t>(FLAGS_max_image_MB) *\n 1048576);\n tesseract::TestCallback tester_callback = nullptr;\n if (!FLAGS_eval_listfile.empty()) {\n if (!tester.LoadAllEvalData(FLAGS_eval_listfile.c_str())) {\n tprintf(\"Failed to load eval data from: %s\\n\",\n FLAGS_eval_listfile.c_str());\n return EXIT_FAILURE;\n }\n tester_callback =\n NewPermanentTessCallback(&tester, &tesseract::LSTMTester::RunEvalAsync);\n }\n do {\n \/\/ Train a few.\n int iteration = trainer.training_iteration();\n for (int target_iteration = iteration + kNumPagesPerBatch;\n iteration < target_iteration &&\n (iteration < FLAGS_max_iterations || FLAGS_max_iterations == 0);\n iteration = trainer.training_iteration()) {\n trainer.TrainOnLine(&trainer, false);\n }\n STRING log_str;\n trainer.MaintainCheckpoints(tester_callback, &log_str);\n tprintf(\"%s\\n\", log_str.string());\n } while (trainer.best_error_rate() > FLAGS_target_error_rate &&\n (trainer.training_iteration() < FLAGS_max_iterations ||\n FLAGS_max_iterations == 0));\n delete tester_callback;\n tprintf(\"Finished! Error rate = %g\\n\", trainer.best_error_rate());\n return EXIT_SUCCESS;\n} \/* main *\/\n<|endoftext|>"} {"text":"<commit_before>\/*\n** Copyright (C) 2012 Aldebaran Robotics\n** See COPYING for the license\n*\/\n#include <iostream>\n#include <string>\n#include <cstring>\n#include <cstdlib>\n#include <queue>\n#include <qi\/log.hpp>\n#include <cerrno>\n\n#include <boost\/asio.hpp>\n\n#include <boost\/lexical_cast.hpp>\n\n#include \"transportserver.hpp\"\n#include \"transportsocket.hpp\"\n#include \"tcptransportsocket.hpp\"\n\n#include <qi\/eventloop.hpp>\n\n#include \"transportserverasio_p.hpp\"\n\nqiLogCategory(\"qimessaging.transportserver\");\n\nnamespace qi\n{\n const int ifsMonitoringTimeout = 5 * 1000 * 1000; \/\/ in usec\n\n void _onAccept(TransportServerImplPtr p,\n const boost::system::error_code& erc,\n#ifdef WITH_SSL\n boost::asio::ssl::stream<boost::asio::ip::tcp::socket>* s\n#else\n boost::asio::ip::tcp::socket* s\n#endif\n )\n {\n boost::shared_ptr<TransportServerAsioPrivate> ts = boost::dynamic_pointer_cast<TransportServerAsioPrivate>(p);\n ts->onAccept(erc, s);\n }\n\n void TransportServerAsioPrivate::onAccept(const boost::system::error_code& erc,\n#ifdef WITH_SSL\n boost::asio::ssl::stream<boost::asio::ip::tcp::socket>* s\n#else\n boost::asio::ip::tcp::socket* s\n#endif\n )\n {\n qiLogDebug() << this << \" onAccept\";\n if (!_live)\n {\n delete s;\n return;\n }\n if (erc)\n {\n qiLogDebug() << \"accept error \" << erc.message();\n delete s;\n self->acceptError(erc.value());\n delete _acceptor;\n _acceptor = 0;\n return;\n }\n qi::TransportSocketPtr socket = qi::TcpTransportSocketPtr(new TcpTransportSocket(context, _ssl, s));\n self->newConnection(socket);\n\n if (socket.unique()) {\n qiLogError() << \"bug: socket not stored by the newConnection handler (usecount:\" << socket.use_count() << \")\";\n }\n#ifdef WITH_SSL\n _s = new boost::asio::ssl::stream<boost::asio::ip::tcp::socket>(_acceptor->get_io_service(), _sslContext);\n#else\n _s = new boost::asio::ip::tcp::socket(_acceptor->get_io_service());\n#endif\n _acceptor->async_accept(_s->lowest_layer(),\n boost::bind(_onAccept, shared_from_this(), _1, _s));\n }\n\n void TransportServerAsioPrivate::close() {\n qiLogDebug() << this << \" close\";\n try\n {\n _asyncEndpoints.cancel();\n }\n catch (const std::runtime_error& e)\n {\n qiLogDebug() << e.what();\n }\n\n _live = false;\n _acceptor->close();\n }\n\n \/*\n * This asynchronous call will keep a shared ptr on the object to prevent\n * its destruction.\n *\/\n void _updateEndpoints(TransportServerImplPtr p)\n {\n boost::shared_ptr<TransportServerAsioPrivate> ts = boost::dynamic_pointer_cast<TransportServerAsioPrivate>(p);\n ts->updateEndpoints();\n }\n\n \/*\n * This function is used to detect and update endpoints when the transport\n * server is listening on 0.0.0.0.\n *\/\n void TransportServerAsioPrivate::updateEndpoints()\n {\n if (!_live)\n {\n return;\n }\n\n \/\/ TODO: implement OS networking notifications\n\n qiLogDebug() << \"Checking endpoints...\";\n std::vector<qi::Url> currentEndpoints;\n\n std::map<std::string, std::vector<std::string> > ifsMap = qi::os::hostIPAddrs();\n if (ifsMap.empty())\n {\n const char* s = \"Cannot get host addresses\";\n qiLogWarning() << s;\n }\n\n std::string protocol = _ssl ? \"tcps:\/\/\" : \"tcp:\/\/\";\n\n {\n for (std::map<std::string, std::vector<std::string> >::iterator interfaceIt = ifsMap.begin();\n interfaceIt != ifsMap.end();\n ++interfaceIt)\n {\n for (std::vector<std::string>::iterator addressIt = (*interfaceIt).second.begin();\n addressIt != (*interfaceIt).second.end();\n ++addressIt)\n {\n std::stringstream ss;\n ss << protocol << (*addressIt) << \":\" << _port;\n currentEndpoints.push_back(ss.str());\n }\n }\n }\n\n {\n boost::mutex::scoped_lock l(_endpointsMutex);\n if (_endpoints.size() != currentEndpoints.size() ||\n !std::equal(_endpoints.begin(), _endpoints.end(), currentEndpoints.begin()))\n {\n std::stringstream ss;\n std::vector<qi::Url>::iterator it;\n for (it = currentEndpoints.begin(); it != currentEndpoints.end(); ++it)\n ss << \"ep: \" << it->str() << std::endl;\n qiLogVerbose() << \"Updating endpoints...\" << this << std::endl << ss.str();\n _endpoints = currentEndpoints;\n _self->endpointsChanged();\n }\n\n }\n\n _asyncEndpoints = context->async(boost::bind(_updateEndpoints, shared_from_this()),\n ifsMonitoringTimeout);\n }\n\n qi::Future<void> TransportServerAsioPrivate::listen(const qi::Url& url)\n {\n qi::Url listenUrl = url;\n _ssl = listenUrl.protocol() == \"tcps\";\n using namespace boost::asio;\n#ifndef ANDROID\n \/\/ resolve endpoint\n ip::tcp::resolver r(_acceptor->get_io_service());\n ip::tcp::resolver::query q(listenUrl.host(), boost::lexical_cast<std::string>(listenUrl.port()),\n boost::asio::ip::tcp::resolver::query::all_matching);\n ip::tcp::resolver::iterator it = r.resolve(q);\n if (it == ip::tcp::resolver::iterator())\n {\n const char* s = \"Listen error: no endpoint.\";\n qiLogError() << s;\n return qi::makeFutureError<void>(s);\n }\n ip::tcp::endpoint ep = *it;\n#else\n ip::tcp::endpoint ep(boost::asio::ip::address::from_string(url.host()), url.port());\n#endif \/\/ #ifndef ANDROID\n\n qiLogDebug() << \"Will listen on \" << ep.address().to_string() << ' ' << ep.port();\n _acceptor->open(ep.protocol());\n#ifdef _WIN32\n boost::asio::socket_base::reuse_address option(false);\n#else\n boost::asio::socket_base::reuse_address option(true);\n fcntl(_acceptor->native(), F_SETFD, FD_CLOEXEC);\n#endif\n _acceptor->set_option(option);\n _acceptor->bind(ep);\n boost::system::error_code ec;\n _acceptor->listen(socket_base::max_connections, ec);\n if (ec)\n {\n qiLogError(\"qimessaging.server.listen\") << ec.message();\n return qi::makeFutureError<void>(ec.message());\n }\n _port = _acceptor->local_endpoint().port();\/\/ already in host byte orde\n qiLogDebug() << \"Effective port io_service\" << _port;\n if (listenUrl.port() == 0)\n {\n listenUrl = Url(listenUrl.protocol() + \":\/\/\" + listenUrl.host() + \":\"\n + boost::lexical_cast<std::string>(_port));\n }\n\n \/* Set endpoints *\/\n if (listenUrl.host() != \"0.0.0.0\")\n {\n boost::mutex::scoped_lock l(_endpointsMutex);\n _endpoints.push_back(listenUrl.str());\n }\n else\n {\n updateEndpoints();\n }\n\n {\n boost::mutex::scoped_lock l(_endpointsMutex);\n for (std::vector<qi::Url>::const_iterator it = _endpoints.begin();\n it != _endpoints.end();\n it++)\n {\n qiLogInfo() << \"TransportServer will listen on: \" << it->str();\n }\n }\n\n#ifdef WITH_SSL\n if (_ssl)\n {\n if (self->_identityCertificate.empty() || self->_identityKey.empty())\n {\n const char* s = \"SSL certificates missing, please call Session::setIdentity first\";\n qiLogError(\"qimessaging.server.listen\") << s;\n return qi::makeFutureError<void>(s);\n }\n\n _sslContext.set_options(\n boost::asio::ssl::context::default_workarounds\n | boost::asio::ssl::context::no_sslv2);\n _sslContext.use_certificate_chain_file(self->_identityCertificate.c_str());\n _sslContext.use_private_key_file(self->_identityKey.c_str(), boost::asio::ssl::context::pem);\n }\n\n _s = new boost::asio::ssl::stream<boost::asio::ip::tcp::socket>(_acceptor->get_io_service(), _sslContext);\n#else\n _s = new boost::asio::ip::tcp::socket(_acceptor->get_io_service());\n#endif\n _acceptor->async_accept(_s->lowest_layer(),\n boost::bind(_onAccept, shared_from_this(), _1, _s));\n _connectionPromise.setValue(0);\n return _connectionPromise.future();\n }\n\n TransportServerAsioPrivate::TransportServerAsioPrivate(TransportServer* self,\n EventLoop* ctx)\n : TransportServerImpl(self, ctx)\n , _self(self)\n , _acceptor(new boost::asio::ip::tcp::acceptor(*(boost::asio::io_service*)ctx->nativeHandle()))\n , _live(true)\n#ifdef WITH_SSL\n , _sslContext(*(boost::asio::io_service*)ctx->nativeHandle(), boost::asio::ssl::context::sslv23)\n#endif\n , _ssl(false)\n {\n }\n\n TransportServerAsioPrivate::~TransportServerAsioPrivate()\n {\n delete _acceptor;\n _acceptor = 0;\n }\n}\n<commit_msg>TransportServerAsio: fix segfault on close()<commit_after>\/*\n** Copyright (C) 2012 Aldebaran Robotics\n** See COPYING for the license\n*\/\n#include <iostream>\n#include <string>\n#include <cstring>\n#include <cstdlib>\n#include <queue>\n#include <qi\/log.hpp>\n#include <cerrno>\n\n#include <boost\/asio.hpp>\n\n#include <boost\/lexical_cast.hpp>\n\n#include \"transportserver.hpp\"\n#include \"transportsocket.hpp\"\n#include \"tcptransportsocket.hpp\"\n\n#include <qi\/eventloop.hpp>\n\n#include \"transportserverasio_p.hpp\"\n\nqiLogCategory(\"qimessaging.transportserver\");\n\nnamespace qi\n{\n const int ifsMonitoringTimeout = 5 * 1000 * 1000; \/\/ in usec\n\n void _onAccept(TransportServerImplPtr p,\n const boost::system::error_code& erc,\n#ifdef WITH_SSL\n boost::asio::ssl::stream<boost::asio::ip::tcp::socket>* s\n#else\n boost::asio::ip::tcp::socket* s\n#endif\n )\n {\n boost::shared_ptr<TransportServerAsioPrivate> ts = boost::dynamic_pointer_cast<TransportServerAsioPrivate>(p);\n ts->onAccept(erc, s);\n }\n\n void TransportServerAsioPrivate::onAccept(const boost::system::error_code& erc,\n#ifdef WITH_SSL\n boost::asio::ssl::stream<boost::asio::ip::tcp::socket>* s\n#else\n boost::asio::ip::tcp::socket* s\n#endif\n )\n {\n qiLogDebug() << this << \" onAccept\";\n if (!_live)\n {\n delete s;\n return;\n }\n if (erc)\n {\n qiLogDebug() << \"accept error \" << erc.message();\n delete s;\n self->acceptError(erc.value());\n delete _acceptor;\n _acceptor = 0;\n return;\n }\n qi::TransportSocketPtr socket = qi::TcpTransportSocketPtr(new TcpTransportSocket(context, _ssl, s));\n self->newConnection(socket);\n\n if (socket.unique()) {\n qiLogError() << \"bug: socket not stored by the newConnection handler (usecount:\" << socket.use_count() << \")\";\n }\n#ifdef WITH_SSL\n _s = new boost::asio::ssl::stream<boost::asio::ip::tcp::socket>(_acceptor->get_io_service(), _sslContext);\n#else\n _s = new boost::asio::ip::tcp::socket(_acceptor->get_io_service());\n#endif\n _acceptor->async_accept(_s->lowest_layer(),\n boost::bind(_onAccept, shared_from_this(), _1, _s));\n }\n\n void TransportServerAsioPrivate::close() {\n qiLogDebug() << this << \" close\";\n try\n {\n _asyncEndpoints.cancel();\n }\n catch (const std::runtime_error& e)\n {\n qiLogDebug() << e.what();\n }\n\n _live = false;\n if (_acceptor)\n _acceptor->close();\n }\n\n \/*\n * This asynchronous call will keep a shared ptr on the object to prevent\n * its destruction.\n *\/\n void _updateEndpoints(TransportServerImplPtr p)\n {\n boost::shared_ptr<TransportServerAsioPrivate> ts = boost::dynamic_pointer_cast<TransportServerAsioPrivate>(p);\n ts->updateEndpoints();\n }\n\n \/*\n * This function is used to detect and update endpoints when the transport\n * server is listening on 0.0.0.0.\n *\/\n void TransportServerAsioPrivate::updateEndpoints()\n {\n if (!_live)\n {\n return;\n }\n\n \/\/ TODO: implement OS networking notifications\n\n qiLogDebug() << \"Checking endpoints...\";\n std::vector<qi::Url> currentEndpoints;\n\n std::map<std::string, std::vector<std::string> > ifsMap = qi::os::hostIPAddrs();\n if (ifsMap.empty())\n {\n const char* s = \"Cannot get host addresses\";\n qiLogWarning() << s;\n }\n\n std::string protocol = _ssl ? \"tcps:\/\/\" : \"tcp:\/\/\";\n\n {\n for (std::map<std::string, std::vector<std::string> >::iterator interfaceIt = ifsMap.begin();\n interfaceIt != ifsMap.end();\n ++interfaceIt)\n {\n for (std::vector<std::string>::iterator addressIt = (*interfaceIt).second.begin();\n addressIt != (*interfaceIt).second.end();\n ++addressIt)\n {\n std::stringstream ss;\n ss << protocol << (*addressIt) << \":\" << _port;\n currentEndpoints.push_back(ss.str());\n }\n }\n }\n\n {\n boost::mutex::scoped_lock l(_endpointsMutex);\n if (_endpoints.size() != currentEndpoints.size() ||\n !std::equal(_endpoints.begin(), _endpoints.end(), currentEndpoints.begin()))\n {\n std::stringstream ss;\n std::vector<qi::Url>::iterator it;\n for (it = currentEndpoints.begin(); it != currentEndpoints.end(); ++it)\n ss << \"ep: \" << it->str() << std::endl;\n qiLogVerbose() << \"Updating endpoints...\" << this << std::endl << ss.str();\n _endpoints = currentEndpoints;\n _self->endpointsChanged();\n }\n\n }\n\n _asyncEndpoints = context->async(boost::bind(_updateEndpoints, shared_from_this()),\n ifsMonitoringTimeout);\n }\n\n qi::Future<void> TransportServerAsioPrivate::listen(const qi::Url& url)\n {\n qi::Url listenUrl = url;\n _ssl = listenUrl.protocol() == \"tcps\";\n using namespace boost::asio;\n#ifndef ANDROID\n \/\/ resolve endpoint\n ip::tcp::resolver r(_acceptor->get_io_service());\n ip::tcp::resolver::query q(listenUrl.host(), boost::lexical_cast<std::string>(listenUrl.port()),\n boost::asio::ip::tcp::resolver::query::all_matching);\n ip::tcp::resolver::iterator it = r.resolve(q);\n if (it == ip::tcp::resolver::iterator())\n {\n const char* s = \"Listen error: no endpoint.\";\n qiLogError() << s;\n return qi::makeFutureError<void>(s);\n }\n ip::tcp::endpoint ep = *it;\n#else\n ip::tcp::endpoint ep(boost::asio::ip::address::from_string(url.host()), url.port());\n#endif \/\/ #ifndef ANDROID\n\n qiLogDebug() << \"Will listen on \" << ep.address().to_string() << ' ' << ep.port();\n _acceptor->open(ep.protocol());\n#ifdef _WIN32\n boost::asio::socket_base::reuse_address option(false);\n#else\n boost::asio::socket_base::reuse_address option(true);\n fcntl(_acceptor->native(), F_SETFD, FD_CLOEXEC);\n#endif\n _acceptor->set_option(option);\n _acceptor->bind(ep);\n boost::system::error_code ec;\n _acceptor->listen(socket_base::max_connections, ec);\n if (ec)\n {\n qiLogError(\"qimessaging.server.listen\") << ec.message();\n return qi::makeFutureError<void>(ec.message());\n }\n _port = _acceptor->local_endpoint().port();\/\/ already in host byte orde\n qiLogDebug() << \"Effective port io_service\" << _port;\n if (listenUrl.port() == 0)\n {\n listenUrl = Url(listenUrl.protocol() + \":\/\/\" + listenUrl.host() + \":\"\n + boost::lexical_cast<std::string>(_port));\n }\n\n \/* Set endpoints *\/\n if (listenUrl.host() != \"0.0.0.0\")\n {\n boost::mutex::scoped_lock l(_endpointsMutex);\n _endpoints.push_back(listenUrl.str());\n }\n else\n {\n updateEndpoints();\n }\n\n {\n boost::mutex::scoped_lock l(_endpointsMutex);\n for (std::vector<qi::Url>::const_iterator it = _endpoints.begin();\n it != _endpoints.end();\n it++)\n {\n qiLogInfo() << \"TransportServer will listen on: \" << it->str();\n }\n }\n\n#ifdef WITH_SSL\n if (_ssl)\n {\n if (self->_identityCertificate.empty() || self->_identityKey.empty())\n {\n const char* s = \"SSL certificates missing, please call Session::setIdentity first\";\n qiLogError(\"qimessaging.server.listen\") << s;\n return qi::makeFutureError<void>(s);\n }\n\n _sslContext.set_options(\n boost::asio::ssl::context::default_workarounds\n | boost::asio::ssl::context::no_sslv2);\n _sslContext.use_certificate_chain_file(self->_identityCertificate.c_str());\n _sslContext.use_private_key_file(self->_identityKey.c_str(), boost::asio::ssl::context::pem);\n }\n\n _s = new boost::asio::ssl::stream<boost::asio::ip::tcp::socket>(_acceptor->get_io_service(), _sslContext);\n#else\n _s = new boost::asio::ip::tcp::socket(_acceptor->get_io_service());\n#endif\n _acceptor->async_accept(_s->lowest_layer(),\n boost::bind(_onAccept, shared_from_this(), _1, _s));\n _connectionPromise.setValue(0);\n return _connectionPromise.future();\n }\n\n TransportServerAsioPrivate::TransportServerAsioPrivate(TransportServer* self,\n EventLoop* ctx)\n : TransportServerImpl(self, ctx)\n , _self(self)\n , _acceptor(new boost::asio::ip::tcp::acceptor(*(boost::asio::io_service*)ctx->nativeHandle()))\n , _live(true)\n#ifdef WITH_SSL\n , _sslContext(*(boost::asio::io_service*)ctx->nativeHandle(), boost::asio::ssl::context::sslv23)\n#endif\n , _ssl(false)\n {\n }\n\n TransportServerAsioPrivate::~TransportServerAsioPrivate()\n {\n delete _acceptor;\n _acceptor = 0;\n }\n}\n<|endoftext|>"} {"text":"<commit_before>\/*\n Copyright (C) 2013 Martin Klapetek <mklapetek@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 \"persons-presence-model.h\"\n#include \"persons-model.h\"\n\n#include <TelepathyQt\/AccountManager>\n#include <TelepathyQt\/AccountFactory>\n#include <TelepathyQt\/ContactManager>\n#include <TelepathyQt\/PendingOperation>\n#include <TelepathyQt\/PendingReady>\n\n#include <KTp\/contact-factory.h>\n#include <KTp\/global-contact-manager.h>\n#include <KDebug>\n\nPersonsPresenceModel::PersonsPresenceModel(QObject *parent)\n: QIdentityProxyModel(parent)\n{\n Tp::AccountFactoryPtr accountFactory = Tp::AccountFactory::create(QDBusConnection::sessionBus(),\n Tp::Features() << Tp::Account::FeatureCore\n << Tp::Account::FeatureCapabilities\n << Tp::Account::FeatureProtocolInfo\n << Tp::Account::FeatureProfile);\n\n Tp::ConnectionFactoryPtr connectionFactory = Tp::ConnectionFactory::create(QDBusConnection::sessionBus(),\n Tp::Features() << Tp::Connection::FeatureCore\n << Tp::Connection::FeatureRoster\n << Tp::Connection::FeatureSelfContact);\n\n Tp::ContactFactoryPtr contactFactory = KTp::ContactFactory::create(Tp::Features() << Tp::Contact::FeatureAlias\n << Tp::Contact::FeatureSimplePresence\n << Tp::Contact::FeatureCapabilities\n << Tp::Contact::FeatureClientTypes);\n\n Tp::ChannelFactoryPtr channelFactory = Tp::ChannelFactory::create(QDBusConnection::sessionBus());\n\n m_accountManager = Tp::AccountManager::create(QDBusConnection::sessionBus(),\n accountFactory,\n connectionFactory,\n channelFactory,\n contactFactory);\n\n connect(m_accountManager->becomeReady(), SIGNAL(finished(Tp::PendingOperation*)),\n this, SLOT(onAccountManagerReady(Tp::PendingOperation*)));\n}\n\nPersonsPresenceModel::~PersonsPresenceModel()\n{\n\n}\n\nvoid PersonsPresenceModel::onAccountManagerReady(Tp::PendingOperation *op)\n{\n if (op->isError()) {\n kWarning() << \"Failed to initialize AccountManager:\" << op->errorName();\n kWarning() << op->errorMessage();\n\n return;\n }\n\n kDebug() << \"Account manager ready\";\n\n m_contactManager = new KTp::GlobalContactManager(m_accountManager, this);\n connect(m_contactManager, SIGNAL(allKnownContactsChanged(Tp::Contacts,Tp::Contacts)),\n this, SLOT(onAllKnownContactsChanged(Tp::Contacts,Tp::Contacts)));\n\n onAllKnownContactsChanged(m_contactManager->allKnownContacts(), Tp::Contacts());\n}\n\nvoid PersonsPresenceModel::onAllKnownContactsChanged(const Tp::Contacts &contactsAdded, const Tp::Contacts &contactsRemoved)\n{\n if (!m_contacts.isEmpty()) {\n Q_FOREACH (const Tp::ContactPtr &contact, contactsRemoved) {\n m_contacts.remove(contact->id());\n }\n }\n\n Q_FOREACH (const Tp::ContactPtr &contact, contactsAdded) {\n Tp::ContactPtr ktpContact = KTp::ContactPtr::qObjectCast(contact);\n m_contacts.insert(contact->id(), ktpContact);\n\n connect(ktpContact.data(), SIGNAL(presenceChanged(Tp::Presence)),\n this, SLOT(onContactChanged()));\n\n connect(ktpContact.data(), SIGNAL(capabilitiesChanged(Tp::ContactCapabilities)),\n this, SLOT(onContactChanged()));\n\n connect(ktpContact.data(), SIGNAL(invalidated()),\n this, SLOT(onContactChanged()));\n\n \/\/TODO: add other stuff here etc\n\n QModelIndex index = qobject_cast<PersonsModel*>(sourceModel())->findRecursively(PersonsModel::IMRole, contact->id());\n Q_EMIT dataChanged(index, index);\n if (index.parent().isValid()) {\n Q_EMIT dataChanged(index.parent(), index.parent());\n }\n }\n}\n\nvoid PersonsPresenceModel::onContactChanged()\n{\n QString id = qobject_cast<Tp::Contact*>(sender())->id();\n\n QModelIndex index = qobject_cast<PersonsModel*>(sourceModel())->findRecursively(PersonsModel::IMRole, id);\n Q_EMIT dataChanged(index, index);\n}\n\nQVariant PersonsPresenceModel::data(const QModelIndex &index, int role) const\n{\n if (!index.isValid()) {\n return QVariant();\n }\n\n if (role == PersonsModel::StatusRole) {\n if (index.data(PersonsModel::ResourceTypeRole).toUInt() == PersonsModel::Contact) {\n QString contactId = index.data(PersonsModel::IMRole).toString();\n if (m_presences.keys().contains(contactId)) {\n return m_presences.value(contactId)->presence().status();\n } else if (!contactId.isEmpty()) {\n return QLatin1String(\"offline\");\n } else if (contactId.isEmpty()) {\n return QLatin1String(\"unknown\");\n }\n } else if (index.data(PersonsModel::ResourceTypeRole).toUInt() == PersonsModel::Person) {\n return queryChildrenForData(index, role);\n }\n } else if (role == PersonsModel::IMAccountRole) {\n if (index.data(PersonsModel::ResourceTypeRole).toUInt() == PersonsModel::Contact) {\n QString contactId = index.data(PersonsModel::IMRole).toString();\n if (m_presences.keys().contains(contactId)) {\n return QVariant::fromValue<Tp::AccountPtr>(m_contactManager->accountForContact(m_presences.value(contactId)));\n } else {\n return QVariant();\n }\n } else if (index.data(PersonsModel::ResourceTypeRole).toUInt() == PersonsModel::Person) {\n return queryChildrenForData(index, role);\n }\n } else if (role == PersonsModel::IMContactRole) {\n if (index.data(PersonsModel::ResourceTypeRole).toUInt() == PersonsModel::Contact) {\n QString contactId = index.data(PersonsModel::IMRole).toString();\n if (m_presences.keys().contains(contactId)) {\n return QVariant::fromValue<Tp::ContactPtr>(m_presences.value(contactId));\n } else {\n return QVariant();\n }\n } else if (index.data(PersonsModel::ResourceTypeRole).toUInt() == PersonsModel::Person) {\n return queryChildrenForData(index, role);\n }\n }\n\n return QIdentityProxyModel::data(index, role);\n}\n\nQVariantList PersonsPresenceModel::queryChildrenForData(const QModelIndex &index, int role) const\n{\n QVariantList ret;\n for (int i = 0; i < rowCount(); i++) {\n QVariant value = index.child(i, 0).data(role);\n if (!value.isNull()) {\n ret += value;\n }\n }\n\n return ret;\n}\n<commit_msg>Emit dataChanged() also when the contacts get removed<commit_after>\/*\n Copyright (C) 2013 Martin Klapetek <mklapetek@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 \"persons-presence-model.h\"\n#include \"persons-model.h\"\n\n#include <TelepathyQt\/AccountManager>\n#include <TelepathyQt\/AccountFactory>\n#include <TelepathyQt\/ContactManager>\n#include <TelepathyQt\/PendingOperation>\n#include <TelepathyQt\/PendingReady>\n\n#include <KTp\/contact-factory.h>\n#include <KTp\/global-contact-manager.h>\n#include <KDebug>\n\nPersonsPresenceModel::PersonsPresenceModel(QObject *parent)\n: QIdentityProxyModel(parent)\n{\n Tp::AccountFactoryPtr accountFactory = Tp::AccountFactory::create(QDBusConnection::sessionBus(),\n Tp::Features() << Tp::Account::FeatureCore\n << Tp::Account::FeatureCapabilities\n << Tp::Account::FeatureProtocolInfo\n << Tp::Account::FeatureProfile);\n\n Tp::ConnectionFactoryPtr connectionFactory = Tp::ConnectionFactory::create(QDBusConnection::sessionBus(),\n Tp::Features() << Tp::Connection::FeatureCore\n << Tp::Connection::FeatureRoster\n << Tp::Connection::FeatureSelfContact);\n\n Tp::ContactFactoryPtr contactFactory = KTp::ContactFactory::create(Tp::Features() << Tp::Contact::FeatureAlias\n << Tp::Contact::FeatureSimplePresence\n << Tp::Contact::FeatureCapabilities\n << Tp::Contact::FeatureClientTypes);\n\n Tp::ChannelFactoryPtr channelFactory = Tp::ChannelFactory::create(QDBusConnection::sessionBus());\n\n m_accountManager = Tp::AccountManager::create(QDBusConnection::sessionBus(),\n accountFactory,\n connectionFactory,\n channelFactory,\n contactFactory);\n\n connect(m_accountManager->becomeReady(), SIGNAL(finished(Tp::PendingOperation*)),\n this, SLOT(onAccountManagerReady(Tp::PendingOperation*)));\n}\n\nPersonsPresenceModel::~PersonsPresenceModel()\n{\n\n}\n\nvoid PersonsPresenceModel::onAccountManagerReady(Tp::PendingOperation *op)\n{\n if (op->isError()) {\n kWarning() << \"Failed to initialize AccountManager:\" << op->errorName();\n kWarning() << op->errorMessage();\n\n return;\n }\n\n kDebug() << \"Account manager ready\";\n\n m_contactManager = new KTp::GlobalContactManager(m_accountManager, this);\n connect(m_contactManager, SIGNAL(allKnownContactsChanged(Tp::Contacts,Tp::Contacts)),\n this, SLOT(onAllKnownContactsChanged(Tp::Contacts,Tp::Contacts)));\n\n onAllKnownContactsChanged(m_contactManager->allKnownContacts(), Tp::Contacts());\n}\n\nvoid PersonsPresenceModel::onAllKnownContactsChanged(const Tp::Contacts &contactsAdded, const Tp::Contacts &contactsRemoved)\n{\n if (!m_contacts.isEmpty()) {\n Q_FOREACH (const Tp::ContactPtr &contact, contactsRemoved) {\n m_contacts.remove(contact->id());\n\n QModelIndex index = qobject_cast<PersonsModel*>(sourceModel())->findRecursively(PersonsModel::IMRole, contact->id());\n Q_EMIT dataChanged(index, index);\n }\n }\n\n Q_FOREACH (const Tp::ContactPtr &contact, contactsAdded) {\n Tp::ContactPtr ktpContact = KTp::ContactPtr::qObjectCast(contact);\n m_contacts.insert(contact->id(), ktpContact);\n\n connect(ktpContact.data(), SIGNAL(presenceChanged(Tp::Presence)),\n this, SLOT(onContactChanged()));\n\n connect(ktpContact.data(), SIGNAL(capabilitiesChanged(Tp::ContactCapabilities)),\n this, SLOT(onContactChanged()));\n\n connect(ktpContact.data(), SIGNAL(invalidated()),\n this, SLOT(onContactChanged()));\n\n \/\/TODO: add other stuff here etc\n\n QModelIndex index = qobject_cast<PersonsModel*>(sourceModel())->findRecursively(PersonsModel::IMRole, contact->id());\n Q_EMIT dataChanged(index, index);\n if (index.parent().isValid()) {\n Q_EMIT dataChanged(index.parent(), index.parent());\n }\n }\n}\n\nvoid PersonsPresenceModel::onContactChanged()\n{\n QString id = qobject_cast<Tp::Contact*>(sender())->id();\n\n QModelIndex index = qobject_cast<PersonsModel*>(sourceModel())->findRecursively(PersonsModel::IMRole, id);\n Q_EMIT dataChanged(index, index);\n}\n\nQVariant PersonsPresenceModel::data(const QModelIndex &index, int role) const\n{\n if (!index.isValid()) {\n return QVariant();\n }\n\n if (role == PersonsModel::StatusRole) {\n if (index.data(PersonsModel::ResourceTypeRole).toUInt() == PersonsModel::Contact) {\n QString contactId = index.data(PersonsModel::IMRole).toString();\n if (m_presences.keys().contains(contactId)) {\n return m_presences.value(contactId)->presence().status();\n } else if (!contactId.isEmpty()) {\n return QLatin1String(\"offline\");\n } else if (contactId.isEmpty()) {\n return QLatin1String(\"unknown\");\n }\n } else if (index.data(PersonsModel::ResourceTypeRole).toUInt() == PersonsModel::Person) {\n return queryChildrenForData(index, role);\n }\n } else if (role == PersonsModel::IMAccountRole) {\n if (index.data(PersonsModel::ResourceTypeRole).toUInt() == PersonsModel::Contact) {\n QString contactId = index.data(PersonsModel::IMRole).toString();\n if (m_presences.keys().contains(contactId)) {\n return QVariant::fromValue<Tp::AccountPtr>(m_contactManager->accountForContact(m_presences.value(contactId)));\n } else {\n return QVariant();\n }\n } else if (index.data(PersonsModel::ResourceTypeRole).toUInt() == PersonsModel::Person) {\n return queryChildrenForData(index, role);\n }\n } else if (role == PersonsModel::IMContactRole) {\n if (index.data(PersonsModel::ResourceTypeRole).toUInt() == PersonsModel::Contact) {\n QString contactId = index.data(PersonsModel::IMRole).toString();\n if (m_presences.keys().contains(contactId)) {\n return QVariant::fromValue<Tp::ContactPtr>(m_presences.value(contactId));\n } else {\n return QVariant();\n }\n } else if (index.data(PersonsModel::ResourceTypeRole).toUInt() == PersonsModel::Person) {\n return queryChildrenForData(index, role);\n }\n }\n\n return QIdentityProxyModel::data(index, role);\n}\n\nQVariantList PersonsPresenceModel::queryChildrenForData(const QModelIndex &index, int role) const\n{\n QVariantList ret;\n for (int i = 0; i < rowCount(); i++) {\n QVariant value = index.child(i, 0).data(role);\n if (!value.isNull()) {\n ret += value;\n }\n }\n\n return ret;\n}\n<|endoftext|>"} {"text":"<commit_before>#include \"query_result_widget.hh\"\n\nusing namespace GSQLiteui;\n\nQueryResultsWidget::QueryResultsWidget(statement_t&& s)\n : Glib::ObjectBase(\"gsqliteui_QueryResultsWidget\")\n , Gtk::TreeView()\n , statement(std::move(s))\n{\n auto cols = this->statement->columns();\n for(int i = 0; i < cols; i += 1) {\n Gtk::TreeModelColumn<Glib::ustring> col;\n this->columns.add(col);\n this->append_column(this->statement->origin_name(i), col);\n }\n\n this->store = Gtk::ListStore::create(this->columns);\n this->set_model(this->store);\n this->set_headers_visible(true);\n\n \/\/\/ TODO:\n \/\/\/ 1. Cancel on destruction\n \/\/\/ 2. Don't fill everything at once, instead do so as the user scrolls\n \/\/\/ …?\n \/\/\/ 4. Restrict the size of fields and ellipsize\n \/\/\/ 5. When row is selected expand and show full contents (?)\n \/\/\/ 6. Consider how to display the NULL columns (grayed out would be nice?)\n \/\/\/ 7. Lots more…\n this->statement->iterate([this, cols](Statement::result_t row){\n if(row->state().get_value() == Row::DONE) return false;\n auto iter = this->store->append();\n for(int i = 0; i < cols; i += 1){\n auto val = (*row)[i];\n if(val == nullptr) return true;\n switch(val->getType()){\n case SQLITE_TEXT:\n iter->set_value(i, Glib::ustring(\n reinterpret_cast<const char *>(\n **dynamic_cast<TextValue*>(val)\n )\n ));\n break;\n default:\n iter->set_value(i, Glib::ustring(\"<not implemented>\"));\n break;\n }\n }\n return true;\n });\n}\n\nQueryResultsWidget::~QueryResultsWidget(){\n}\n<commit_msg>Implement other data types<commit_after>#include \"query_result_widget.hh\"\n\nusing namespace GSQLiteui;\n\nQueryResultsWidget::QueryResultsWidget(statement_t&& s)\n : Glib::ObjectBase(\"gsqliteui_QueryResultsWidget\")\n , Gtk::TreeView()\n , statement(std::move(s))\n{\n auto cols = this->statement->columns();\n for(int i = 0; i < cols; i += 1) {\n Gtk::TreeModelColumn<Glib::ustring> col;\n this->columns.add(col);\n this->append_column(this->statement->origin_name(i), col);\n }\n\n this->store = Gtk::ListStore::create(this->columns);\n this->set_model(this->store);\n this->set_headers_visible(true);\n\n \/\/\/ TODO:\n \/\/\/ 1. Cancel on destruction\n \/\/\/ 2. Don't fill everything at once, instead do so as the user scrolls\n \/\/\/ …?\n \/\/\/ 4. Restrict the size of fields and ellipsize\n \/\/\/ 5. When row is selected expand and show full contents (?)\n \/\/\/ 6. Consider how to display the NULL columns (grayed out would be nice?)\n \/\/\/ 7. Lots more…\n this->statement->iterate([this, cols](Statement::result_t row){\n if(row->state().get_value() == Row::DONE) return false;\n auto iter = this->store->append();\n for(int i = 0; i < cols; i += 1){\n auto val = (*row)[i];\n if(val == nullptr) return true;\n switch(val->getType()){\n case SQLITE_TEXT:\n iter->set_value(i, Glib::ustring(\n reinterpret_cast<const char *>(\n **dynamic_cast<TextValue*>(val)\n )\n ));\n break;\n case SQLITE_INTEGER:\n iter->set_value(i, Glib::ustring(std::to_string(\n **dynamic_cast<IntValue*>(val)\n )));\n break;\n case SQLITE_FLOAT:\n iter->set_value(i, Glib::ustring(std::to_string(\n **dynamic_cast<FloatValue*>(val)\n )));\n break;\n case SQLITE_BLOB:\n iter->set_value(i, Glib::ustring(\"<Blob: not implemented>\"));\n break;\n }\n }\n return true;\n });\n}\n\nQueryResultsWidget::~QueryResultsWidget(){\n}\n<|endoftext|>"} {"text":"<commit_before>\/*\n For more information, please see: http:\/\/software.sci.utah.edu\n\n The MIT License\n\n Copyright (c) 2012 Scientific Computing and Imaging Institute,\n University of Utah.\n\n License for the specific language governing rights and limitations under\n Permission is hereby granted, free of charge, to any person obtaining a\n copy of this software and associated documentation files (the \"Software\"),\n to deal in the Software without restriction, including without limitation\n the rights to use, copy, modify, merge, publish, distribute, sublicense,\n and\/or sell copies of the Software, and to permit persons to whom the\n Software is furnished to do so, subject to the following conditions:\n\n The above copyright notice and this permission notice shall be included\n in all copies or substantial portions of the Software.\n\n THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS\n OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\n FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL\n THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\n LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING\n FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER\n DEALINGS IN THE SOFTWARE.\n*\/\n\n#include \"RenderWindow.h\"\n#include \"ui_RenderWindow.h\"\n#include \"Core\/Datatypes\/DenseMatrix.h\"\n\n#include <QVTKWidget.h>\n#include <vtkRenderer.h>\n#include <vtkRenderWindow.h>\n#include <vtkPolyDataMapper.h>\n#include <vtkArrowSource.h>\n#include <vtkVector.h>\n#include <vtkMatrix3x3.h>\n#include <vtkMatrix4x4.h>\n#include <vtkTransform.h>\n#include <vtkTextActor.h>\n#include <vtkTextProperty.h>\n\nusing namespace SCIRun::Domain::Datatypes;\n\n\/\/-----------------------------------------------------------------------------\nRenderWindow::RenderWindow(QWidget *parent) :\n QDialog(parent),\n ui(new Ui::RenderWindow),\n mVtkWidget(new QVTKWidget(this, QFlag(0)))\n{\n ui->setupUi(this);\n\n \/\/ Add VTK widget to vertical layout.\n ui->verticalLayout->addWidget(mVtkWidget);\n ui->verticalLayout->update();\n\n \/\/ Create renderer\n mRen = vtkSmartPointer<vtkRenderer>::New();\n mVtkWidget->GetRenderWindow()->AddRenderer(mRen);\n mVtkWidget->setSizePolicy(QSizePolicy::MinimumExpanding, QSizePolicy::MinimumExpanding);\n \/\/mRen->SetBackground(1.0,0.0,0.0);\n\n \/\/ Create arrow poly data\n mArrowSource = vtkSmartPointer<vtkArrowSource>::New();\n \/\/arrowSource->SetShaftRadius(1.0);\n \/\/arrowSource->SetTipLength(1.0);\n mArrowSource->Update();\n\n \/\/ Create data mapper (from visualization system to graphics system).\n mArrowMapper = vtkSmartPointer<vtkPolyDataMapper>::New();\n mArrowMapper->SetInputConnection(mArrowSource->GetOutputPort());\n\n \/\/setupDefaultVectorField();\n setupHelixVectorField();\n\n setText(\"This is a vector field!\");\n}\n\n\n\/\/-----------------------------------------------------------------------------\nRenderWindow::~RenderWindow()\n{\n delete mVtkWidget;\n delete ui;\n}\n\n\n\/\/-----------------------------------------------------------------------------\nvoid RenderWindow::setupDefaultVectorField()\n{\n \/\/ Read matrix and build scene with appropriate actors.\n const int numVecs = 6;\n double vpd[3][numVecs] = { \/\/ Vector position data\n { 0.0, 0.0, 0.0, 0.0, 1.0, 1.0 },\n { 0.0, 1.0, 0.0, 1.0, 1.0, 0.0 },\n { 0.0, 0.0, 1.0, 1.0, 0.0, 1.0 }\n };\n double vod[3][numVecs] = { \/\/ Vector orientation data\n { 1.0, 0.0, 0.0, 0.0, 1.0, 1.0 },\n { 0.0, 1.0, 0.0, 1.0, 1.0, 0.0 },\n { 0.0, 0.0, 1.0, 1.0, 0.0, 1.0 }\n };\n \n \/\/ Setup actors for each of the vectors...\n \/\/ There are better ways of representing vectors fields in VTK.\n\n \/\/ Need to construct 3x3 rotation matrices from orientation vector.\n for (int i = 0; i < numVecs; i++)\n {\n vtkSmartPointer<vtkTransform> orient = matFromVec(\n vtkVector3d(vod[0][i], vod[1][i], vod[2][i]),\n vtkVector3d(vpd[0][i], vpd[1][i], vpd[2][i]));\n\n vtkSmartPointer<vtkMatrix4x4> m = vtkSmartPointer<vtkMatrix4x4>::New();\n orient->GetMatrix(m);\n \/\/m->Print(std::cout);\n\n \/\/ Now we have appropriate transformation data, build actor.\n vtkSmartPointer<vtkActor> actor = vtkSmartPointer<vtkActor>::New();\n actor->SetMapper(mArrowMapper);\n actor->SetUserTransform(orient);\n \/\/actor->SetPosition(vpd[0][i], vpd[1][i], vpd[2][i]);\n mRen->AddActor(actor);\n }\n}\n\n\/\/-----------------------------------------------------------------------------\nvoid RenderWindow::setupHelixVectorField()\n{\n double t = 0.0;\n const double dt = 0.4;\n const double p2Off = 3.14159265 \/ 2.0f;\n vtkVector3d p1;\n vtkVector3d p2;\n vtkVector3d dp1;\n vtkVector3d dp2;\n const double heightMult = 2.0;\n const double r = 2.0; \/\/ Radius\n const int steps = 40;\n \n DenseMatrixGeneric<double> m(6, steps * 2);\n \n for (int i = 0; i < steps; i++)\n {\n p1.Set(cos(t) * r, t * heightMult, sin(t) * r);\n dp1.Set(-sin(t) * r, heightMult, cos(t) * r);\n p2.Set(cos(t + p2Off) * r, t * heightMult, sin(t + p2Off) * r);\n dp2.Set(-sin(t + p2Off) * r, heightMult, cos(t + p2Off) * r);\n\n int off = i * 2;\n\n m(0,off) = dp1.X();\n m(1,off) = dp1.Y();\n m(2,off) = dp1.Z();\n m(3,off) = p1.X();\n m(4,off) = p1.Y();\n m(5,off) = p1.Z();\n\n m(0,off+1) = dp2.X();\n m(1,off+1) = dp2.Y();\n m(2,off+1) = dp2.Z();\n m(3,off+1) = p2.X();\n m(4,off+1) = p2.Y();\n m(5,off+1) = p2.Z();\n\n t += dt;\n }\n\n setVectorField(m);\n}\n\n\/\/-----------------------------------------------------------------------------\nvoid RenderWindow::setText(const char* output)\n{\n vtkSmartPointer<vtkTextActor> txt = vtkSmartPointer<vtkTextActor>::New();\n txt->SetDisplayPosition(90, 50);\n txt->SetInput(output);\n\n vtkTextProperty* txtProp = txt->GetTextProperty();\n txtProp->SetFontSize(18);\n txtProp->BoldOn();\n\n mRen->AddActor2D(txt);\n}\n\n\/\/-----------------------------------------------------------------------------\nvoid RenderWindow::setVectorField(const DenseMatrixGeneric<double>& m)\n{\n if (m.nrows() != 6)\n throw std::runtime_error(\"Expecting a 6xn matrix.\");\n\n for (int i = 0; i < m.ncols(); i++)\n {\n \/\/ Extract direction\/position\n vtkVector3d dir(m(0,i), m(1,i), m(2,i));\n vtkVector3d pos(m(3,i), m(4,i), m(5,i));\n\n vtkSmartPointer<vtkTransform> orient = matFromVecR(dir, pos);\n\n \/\/vtkSmartPointer<vtkMatrix4x4> m = vtkSmartPointer<vtkMatrix4x4>::New();\n \/\/orient->GetMatrix(m);\n \/\/m->Print(std::cout);\n\n \/\/ Now we have appropriate transformation data, build actor.\n vtkSmartPointer<vtkActor> actor = vtkSmartPointer<vtkActor>::New();\n actor->SetMapper(mArrowMapper);\n actor->SetUserTransform(orient);\n \/\/actor->SetPosition(pos.X(), pos.Y(), pos.Z());\n mRen->AddActor(actor);\n }\n}\n\n\/\/-----------------------------------------------------------------------------\nvtkSmartPointer<vtkTransform> RenderWindow::matFromVec(const vtkVector3d& v,\n const vtkVector3d& pos)\n{\n \/\/ Find the maximal component in the vector. The construct a normal vector\n \/\/ which has a zero for the maximal component.\n float absX = fabs(v.GetX());\n float absY = fabs(v.GetY());\n float absZ = fabs(v.GetZ());\n\n vtkVector3d gen;\n if (absX > absY)\n {\n if (absZ > absX)\n {\n gen = vtkVector3d(1.0, 1.0, 0.0);\n }\n else\n {\n gen = vtkVector3d(0.0, 1.0, 1.0);\n }\n }\n else\n {\n if (absZ > absY)\n {\n gen = vtkVector3d(1.0, 1.0, 0.0);\n }\n else\n {\n gen = vtkVector3d(1.0, 0.0, 1.0);\n }\n }\n\n gen.Normalize();\n\n vtkVector3d at = v;\n at.Normalize();\n\n \/\/ Cross generated vector with 'at' vector.\n vtkVector3d right = gen.Cross(at);\n right.Normalize();\n vtkVector3d up = at.Cross(right);\n up.Normalize();\n\n double m[16];\n\n \/\/\/ @todo Combine two matrices below.\n \/\/ Assuming the matrix is row major. Although, this doesn't matter for\n \/\/ the identity (I^T = I)\n m[0 ] = 1.0; m[1 ] = 0.0; m[2 ] = 0.0; m[3 ] = 0.0;\n m[4 ] = 0.0; m[5 ] = 1.0; m[6 ] = 0.0; m[7 ] = 0.0;\n m[8 ] = 0.0; m[9 ] = 0.0; m[10] = 1.0; m[11] = 0.0;\n m[12] = 0.0; m[13] = 0.0; m[14] = 0.0; m[15] = 1.0;\n\n \/\/ Populate rotation. \n m[0 ] = right[0]; m[1 ] = up[0]; m[2 ] = at[0]; m[3 ] = pos.X();\n m[4 ] = right[1]; m[5 ] = up[1]; m[6 ] = at[1]; m[7 ] = pos.Y();\n m[8 ] = right[2]; m[9 ] = up[2]; m[10] = at[2]; m[11] = pos.Z();\n\n vtkSmartPointer<vtkTransform> t = vtkSmartPointer<vtkTransform>::New();\n t->SetMatrix(m);\n \/\/t->Inverse();\n\n return t;\n}\n\n\/\/-----------------------------------------------------------------------------\nvtkSmartPointer<vtkTransform> RenderWindow::matFromVecR(const vtkVector3d& x,\n const vtkVector3d& pos)\n{\n \/\/ Find the maximal component in the vector. The construct a normal vector\n \/\/ which has a zero for the maximal component.\n float absX = fabs(x.GetX());\n float absY = fabs(x.GetY());\n float absZ = fabs(x.GetZ());\n\n vtkVector3d gen;\n if (absX > absY)\n {\n if (absZ > absX)\n {\n gen = vtkVector3d(1.0, 1.0, 0.0);\n }\n else\n {\n gen = vtkVector3d(0.0, 1.0, 1.0);\n }\n }\n else\n {\n if (absZ > absY)\n {\n gen = vtkVector3d(1.0, 1.0, 0.0);\n }\n else\n {\n gen = vtkVector3d(1.0, 0.0, 1.0);\n }\n }\n\n gen.Normalize();\n\n vtkVector3d right = x;\n right.Normalize();\n\n \/\/ Cross generated vector with 'at' vector.\n vtkVector3d at = gen.Cross(right);\n at.Normalize();\n vtkVector3d up = at.Cross(right);\n up.Normalize();\n\n double m[16];\n\n \/\/\/ @todo Combine two matrices below.\n \/\/ Assuming the matrix is row major. Although, this doesn't matter for\n \/\/ the identity (I^T = I)\n m[0 ] = 1.0; m[1 ] = 0.0; m[2 ] = 0.0; m[3 ] = 0.0;\n m[4 ] = 0.0; m[5 ] = 1.0; m[6 ] = 0.0; m[7 ] = 0.0;\n m[8 ] = 0.0; m[9 ] = 0.0; m[10] = 1.0; m[11] = 0.0;\n m[12] = 0.0; m[13] = 0.0; m[14] = 0.0; m[15] = 1.0;\n\n \/\/ Populate rotation.\n m[0 ] = right[0]; m[1 ] = up[0]; m[2 ] = at[0]; m[3 ] = pos.X();\n m[4 ] = right[1]; m[5 ] = up[1]; m[6 ] = at[1]; m[7 ] = pos.Y();\n m[8 ] = right[2]; m[9 ] = up[2]; m[10] = at[2]; m[11] = pos.Z();\n\n vtkSmartPointer<vtkTransform> t = vtkSmartPointer<vtkTransform>::New();\n t->SetMatrix(m);\n \/\/t->Inverse();\n\n return t;\n}\n\n<commit_msg>Added math.h header file for 'fabs', 'sin', and 'cos'.<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 \"RenderWindow.h\"\n#include \"ui_RenderWindow.h\"\n#include \"Core\/Datatypes\/DenseMatrix.h\"\n\n#include <QVTKWidget.h>\n#include <vtkRenderer.h>\n#include <vtkRenderWindow.h>\n#include <vtkPolyDataMapper.h>\n#include <vtkArrowSource.h>\n#include <vtkVector.h>\n#include <vtkMatrix3x3.h>\n#include <vtkMatrix4x4.h>\n#include <vtkTransform.h>\n#include <vtkTextActor.h>\n#include <vtkTextProperty.h>\n#include <math.h>\n\nusing namespace SCIRun::Domain::Datatypes;\n\n\/\/-----------------------------------------------------------------------------\nRenderWindow::RenderWindow(QWidget *parent) :\n QDialog(parent),\n ui(new Ui::RenderWindow),\n mVtkWidget(new QVTKWidget(this, QFlag(0)))\n{\n ui->setupUi(this);\n\n \/\/ Add VTK widget to vertical layout.\n ui->verticalLayout->addWidget(mVtkWidget);\n ui->verticalLayout->update();\n\n \/\/ Create renderer\n mRen = vtkSmartPointer<vtkRenderer>::New();\n mVtkWidget->GetRenderWindow()->AddRenderer(mRen);\n mVtkWidget->setSizePolicy(QSizePolicy::MinimumExpanding, QSizePolicy::MinimumExpanding);\n \/\/mRen->SetBackground(1.0,0.0,0.0);\n\n \/\/ Create arrow poly data\n mArrowSource = vtkSmartPointer<vtkArrowSource>::New();\n \/\/arrowSource->SetShaftRadius(1.0);\n \/\/arrowSource->SetTipLength(1.0);\n mArrowSource->Update();\n\n \/\/ Create data mapper (from visualization system to graphics system).\n mArrowMapper = vtkSmartPointer<vtkPolyDataMapper>::New();\n mArrowMapper->SetInputConnection(mArrowSource->GetOutputPort());\n\n \/\/setupDefaultVectorField();\n setupHelixVectorField();\n\n setText(\"This is a vector field!\");\n}\n\n\n\/\/-----------------------------------------------------------------------------\nRenderWindow::~RenderWindow()\n{\n delete mVtkWidget;\n delete ui;\n}\n\n\n\/\/-----------------------------------------------------------------------------\nvoid RenderWindow::setupDefaultVectorField()\n{\n \/\/ Read matrix and build scene with appropriate actors.\n const int numVecs = 6;\n double vpd[3][numVecs] = { \/\/ Vector position data\n { 0.0, 0.0, 0.0, 0.0, 1.0, 1.0 },\n { 0.0, 1.0, 0.0, 1.0, 1.0, 0.0 },\n { 0.0, 0.0, 1.0, 1.0, 0.0, 1.0 }\n };\n double vod[3][numVecs] = { \/\/ Vector orientation data\n { 1.0, 0.0, 0.0, 0.0, 1.0, 1.0 },\n { 0.0, 1.0, 0.0, 1.0, 1.0, 0.0 },\n { 0.0, 0.0, 1.0, 1.0, 0.0, 1.0 }\n };\n \n \/\/ Setup actors for each of the vectors...\n \/\/ There are better ways of representing vectors fields in VTK.\n\n \/\/ Need to construct 3x3 rotation matrices from orientation vector.\n for (int i = 0; i < numVecs; i++)\n {\n vtkSmartPointer<vtkTransform> orient = matFromVec(\n vtkVector3d(vod[0][i], vod[1][i], vod[2][i]),\n vtkVector3d(vpd[0][i], vpd[1][i], vpd[2][i]));\n\n vtkSmartPointer<vtkMatrix4x4> m = vtkSmartPointer<vtkMatrix4x4>::New();\n orient->GetMatrix(m);\n \/\/m->Print(std::cout);\n\n \/\/ Now we have appropriate transformation data, build actor.\n vtkSmartPointer<vtkActor> actor = vtkSmartPointer<vtkActor>::New();\n actor->SetMapper(mArrowMapper);\n actor->SetUserTransform(orient);\n \/\/actor->SetPosition(vpd[0][i], vpd[1][i], vpd[2][i]);\n mRen->AddActor(actor);\n }\n}\n\n\/\/-----------------------------------------------------------------------------\nvoid RenderWindow::setupHelixVectorField()\n{\n double t = 0.0;\n const double dt = 0.4;\n const double p2Off = 3.14159265 \/ 2.0f;\n vtkVector3d p1;\n vtkVector3d p2;\n vtkVector3d dp1;\n vtkVector3d dp2;\n const double heightMult = 2.0;\n const double r = 2.0; \/\/ Radius\n const int steps = 40;\n \n DenseMatrixGeneric<double> m(6, steps * 2);\n \n for (int i = 0; i < steps; i++)\n {\n p1.Set(cos(t) * r, t * heightMult, sin(t) * r);\n dp1.Set(-sin(t) * r, heightMult, cos(t) * r);\n p2.Set(cos(t + p2Off) * r, t * heightMult, sin(t + p2Off) * r);\n dp2.Set(-sin(t + p2Off) * r, heightMult, cos(t + p2Off) * r);\n\n int off = i * 2;\n\n m(0,off) = dp1.X();\n m(1,off) = dp1.Y();\n m(2,off) = dp1.Z();\n m(3,off) = p1.X();\n m(4,off) = p1.Y();\n m(5,off) = p1.Z();\n\n m(0,off+1) = dp2.X();\n m(1,off+1) = dp2.Y();\n m(2,off+1) = dp2.Z();\n m(3,off+1) = p2.X();\n m(4,off+1) = p2.Y();\n m(5,off+1) = p2.Z();\n\n t += dt;\n }\n\n setVectorField(m);\n}\n\n\/\/-----------------------------------------------------------------------------\nvoid RenderWindow::setText(const char* output)\n{\n vtkSmartPointer<vtkTextActor> txt = vtkSmartPointer<vtkTextActor>::New();\n txt->SetDisplayPosition(90, 50);\n txt->SetInput(output);\n\n vtkTextProperty* txtProp = txt->GetTextProperty();\n txtProp->SetFontSize(18);\n txtProp->BoldOn();\n\n mRen->AddActor2D(txt);\n}\n\n\/\/-----------------------------------------------------------------------------\nvoid RenderWindow::setVectorField(const DenseMatrixGeneric<double>& m)\n{\n if (m.nrows() != 6)\n throw std::runtime_error(\"Expecting a 6xn matrix.\");\n\n for (int i = 0; i < m.ncols(); i++)\n {\n \/\/ Extract direction\/position\n vtkVector3d dir(m(0,i), m(1,i), m(2,i));\n vtkVector3d pos(m(3,i), m(4,i), m(5,i));\n\n vtkSmartPointer<vtkTransform> orient = matFromVecR(dir, pos);\n\n \/\/vtkSmartPointer<vtkMatrix4x4> m = vtkSmartPointer<vtkMatrix4x4>::New();\n \/\/orient->GetMatrix(m);\n \/\/m->Print(std::cout);\n\n \/\/ Now we have appropriate transformation data, build actor.\n vtkSmartPointer<vtkActor> actor = vtkSmartPointer<vtkActor>::New();\n actor->SetMapper(mArrowMapper);\n actor->SetUserTransform(orient);\n \/\/actor->SetPosition(pos.X(), pos.Y(), pos.Z());\n mRen->AddActor(actor);\n }\n}\n\n\/\/-----------------------------------------------------------------------------\nvtkSmartPointer<vtkTransform> RenderWindow::matFromVec(const vtkVector3d& v,\n const vtkVector3d& pos)\n{\n \/\/ Find the maximal component in the vector. The construct a normal vector\n \/\/ which has a zero for the maximal component.\n float absX = fabs(v.GetX());\n float absY = fabs(v.GetY());\n float absZ = fabs(v.GetZ());\n\n vtkVector3d gen;\n if (absX > absY)\n {\n if (absZ > absX)\n {\n gen = vtkVector3d(1.0, 1.0, 0.0);\n }\n else\n {\n gen = vtkVector3d(0.0, 1.0, 1.0);\n }\n }\n else\n {\n if (absZ > absY)\n {\n gen = vtkVector3d(1.0, 1.0, 0.0);\n }\n else\n {\n gen = vtkVector3d(1.0, 0.0, 1.0);\n }\n }\n\n gen.Normalize();\n\n vtkVector3d at = v;\n at.Normalize();\n\n \/\/ Cross generated vector with 'at' vector.\n vtkVector3d right = gen.Cross(at);\n right.Normalize();\n vtkVector3d up = at.Cross(right);\n up.Normalize();\n\n double m[16];\n\n \/\/\/ @todo Combine two matrices below.\n \/\/ Assuming the matrix is row major. Although, this doesn't matter for\n \/\/ the identity (I^T = I)\n m[0 ] = 1.0; m[1 ] = 0.0; m[2 ] = 0.0; m[3 ] = 0.0;\n m[4 ] = 0.0; m[5 ] = 1.0; m[6 ] = 0.0; m[7 ] = 0.0;\n m[8 ] = 0.0; m[9 ] = 0.0; m[10] = 1.0; m[11] = 0.0;\n m[12] = 0.0; m[13] = 0.0; m[14] = 0.0; m[15] = 1.0;\n\n \/\/ Populate rotation. \n m[0 ] = right[0]; m[1 ] = up[0]; m[2 ] = at[0]; m[3 ] = pos.X();\n m[4 ] = right[1]; m[5 ] = up[1]; m[6 ] = at[1]; m[7 ] = pos.Y();\n m[8 ] = right[2]; m[9 ] = up[2]; m[10] = at[2]; m[11] = pos.Z();\n\n vtkSmartPointer<vtkTransform> t = vtkSmartPointer<vtkTransform>::New();\n t->SetMatrix(m);\n \/\/t->Inverse();\n\n return t;\n}\n\n\/\/-----------------------------------------------------------------------------\nvtkSmartPointer<vtkTransform> RenderWindow::matFromVecR(const vtkVector3d& x,\n const vtkVector3d& pos)\n{\n \/\/ Find the maximal component in the vector. The construct a normal vector\n \/\/ which has a zero for the maximal component.\n float absX = fabs(x.GetX());\n float absY = fabs(x.GetY());\n float absZ = fabs(x.GetZ());\n\n vtkVector3d gen;\n if (absX > absY)\n {\n if (absZ > absX)\n {\n gen = vtkVector3d(1.0, 1.0, 0.0);\n }\n else\n {\n gen = vtkVector3d(0.0, 1.0, 1.0);\n }\n }\n else\n {\n if (absZ > absY)\n {\n gen = vtkVector3d(1.0, 1.0, 0.0);\n }\n else\n {\n gen = vtkVector3d(1.0, 0.0, 1.0);\n }\n }\n\n gen.Normalize();\n\n vtkVector3d right = x;\n right.Normalize();\n\n \/\/ Cross generated vector with 'at' vector.\n vtkVector3d at = gen.Cross(right);\n at.Normalize();\n vtkVector3d up = at.Cross(right);\n up.Normalize();\n\n double m[16];\n\n \/\/\/ @todo Combine two matrices below.\n \/\/ Assuming the matrix is row major. Although, this doesn't matter for\n \/\/ the identity (I^T = I)\n m[0 ] = 1.0; m[1 ] = 0.0; m[2 ] = 0.0; m[3 ] = 0.0;\n m[4 ] = 0.0; m[5 ] = 1.0; m[6 ] = 0.0; m[7 ] = 0.0;\n m[8 ] = 0.0; m[9 ] = 0.0; m[10] = 1.0; m[11] = 0.0;\n m[12] = 0.0; m[13] = 0.0; m[14] = 0.0; m[15] = 1.0;\n\n \/\/ Populate rotation.\n m[0 ] = right[0]; m[1 ] = up[0]; m[2 ] = at[0]; m[3 ] = pos.X();\n m[4 ] = right[1]; m[5 ] = up[1]; m[6 ] = at[1]; m[7 ] = pos.Y();\n m[8 ] = right[2]; m[9 ] = up[2]; m[10] = at[2]; m[11] = pos.Z();\n\n vtkSmartPointer<vtkTransform> t = vtkSmartPointer<vtkTransform>::New();\n t->SetMatrix(m);\n \/\/t->Inverse();\n\n return t;\n}\n\n<|endoftext|>"} {"text":"<commit_before>#include \"random_graph.hpp\"\n\nnamespace vg {\nnamespace unittest {\n\nVG randomGraph(int64_t seqSize, int64_t variantLen,\n int64_t variantCount){\n \/\/Create a random graph for a sequence of length seqSize\n \/\/variantLen is the mean length of a larger variation and variationCount\n \/\/is the number of variations in the graph\n\n VG graph;\n map<size_t, id_t> indexToNode;\n \/\/Index of original sequence to node that starts at that index\n\n string seq(seqSize, 'A');\/\/TODO: The graph is all As\n Node* n = graph.create_node(seq);\n indexToNode.insert(make_pair(0, n->id()));\n\n \/\/Get random number generator for lengths and variation types\n poisson_distribution<size_t> lengthDistribution(variantLen);\n uniform_int_distribution<int> variantDistribution(0, 4);\n uniform_int_distribution<int> indexDistribution(0, seqSize-1);\n random_device seed_source;\n default_random_engine generator(seed_source());\n\n auto splitNode = [&] (size_t index) -> pair<Node, Node> {\n \/\/Split graph at index. Split the node with the original sequence into\n \/\/the original node and a new node and connect the two\n\n auto n = --indexToNode.upper_bound(index);\/\/orig node containing pos\n size_t firstIndex = n->first; \/\/Index of first node\n size_t firstNodeID = n->second; \/\/Node ID of first node\n\n Node* firstNode = graph.get_node(firstNodeID);\n string origSeq = firstNode->sequence();\n if (index > firstIndex) {\n size_t nodeLength = index - firstIndex;\n\n firstNode->set_sequence(origSeq.substr(0, nodeLength));\/\/replace seq\n Node* newNode = graph.create_node(origSeq.substr(nodeLength));\n indexToNode.insert(make_pair(index, newNode->id()));\n\n\n \/\/Transfer outgoing edges from fist node to second node\n\n handle_t startFd = graph.get_handle(firstNodeID, false);\n handle_t endFd = graph.get_handle(newNode->id(), false);\n\n\n unordered_set<handle_t> nextHandles;\n auto addHandle = [&](const handle_t& h) ->bool {\n nextHandles.insert(h);\n return true;\n };\n graph.follow_edges(startFd, false, addHandle);\n\n for (handle_t h : nextHandles) {\n \/\/for each edge from start node, delete and add to new node\n graph.destroy_edge(startFd, h);\n graph.create_edge(endFd, h);\n }\n graph.create_edge(firstNode, newNode);\n return make_pair(*firstNode, *newNode);\n } else {\n\n auto n = --indexToNode.lower_bound(index);\n Node* prevNode = graph.get_node(n->second);\n return make_pair(*prevNode, *firstNode);\n }\n\n };\n\n enum VariationType {SNP = 0, POINT_INDEL = 1, STRUCTURAL_INDEL = 2,\n CNV = 3, INVERSION = 4};\n\n for (int j = 0; j < variantCount; j++) {\n \/\/add variants\n int startIndex = indexDistribution(generator);\n VariationType variationType = \n (VariationType) variantDistribution(generator);\n\n if (variationType == SNP) {\n\n if (startIndex == 0) {\n\n pair<Node, Node> endNodes = splitNode(startIndex+1);\n Node end = endNodes.second;\n Node* newNode = graph.create_node(\"G\");\/\/TODO: snp are all Gs\n graph.create_edge(newNode, &end);\n\n } else if (startIndex < seqSize-2) {\n\n pair<Node, Node> startNodes = splitNode(startIndex);\n pair<Node, Node> endNodes = splitNode(startIndex+1);\n\n Node start = startNodes.first;\n Node end = endNodes.second;\n Node* newNode = graph.create_node(\"G\");\n graph.create_edge(&start, newNode);\n graph.create_edge(newNode, &end);\n\n } else if (startIndex == seqSize -2) {\n\n pair<Node, Node> startNodes = splitNode(startIndex);\n\n Node start = startNodes.first;\n Node* newNode = graph.create_node(\"G\");\n graph.create_edge(&start, newNode);\n\n }\n } else if (variationType == POINT_INDEL) {\n \/\/Short indel - deletion of original\n\n if (startIndex > 0 && startIndex < seqSize-1) {\n pair<Node, Node> startNodes = splitNode(startIndex);\n pair<Node, Node> endNodes = splitNode(startIndex+1);\n\n Node start = startNodes.first;\n Node end = endNodes.second;\n graph.create_edge(&start, &end);\n\n }\n } else if (variationType == STRUCTURAL_INDEL) {\n \/\/long indel\n size_t length = lengthDistribution(generator);\n\n if (length > 0 && startIndex > 0 &&\n length + startIndex < seqSize-1) {\n\n pair<Node, Node> startNodes = splitNode(startIndex);\n pair<Node, Node> endNodes = splitNode(startIndex+length);\n\n Node start = startNodes.first;\n Node end = endNodes.second;\n graph.create_edge(&start, &end);\n\n }\n } else if (variationType == CNV) {\n \/\/Copy number variation\n size_t length = lengthDistribution(generator);\n\n if (length > 0 ) {\n if (startIndex == 0) {\n pair<Node, Node> endNodes = splitNode(startIndex+length);\n Node n = endNodes.first;\n\n auto nodePair = --indexToNode.upper_bound(0);\/\/first node\n size_t firstNodeID = nodePair->second;\n\n Node* firstNode = graph.get_node(firstNodeID);\n\n graph.create_edge(&n, firstNode);\n\n } else if ( length + startIndex < seqSize-1) {\n\n pair<Node, Node> startNodes = splitNode(startIndex);\n pair<Node, Node> endNodes = splitNode(startIndex+length);\n\n Node n1 = startNodes.second;\n Node n2 = endNodes.first;\n graph.create_edge(&n2, &n1);\n\n } else if ( length + startIndex == seqSize -1) {\n pair<Node, Node> startNodes = splitNode(startIndex);\n\n auto nodePair = --indexToNode.upper_bound(seqSize);\n \/\/last node\n size_t lastNodeID = nodePair->second;\n\n Node* lastNode = graph.get_node(lastNodeID);\n\n Node n = startNodes.second;\n graph.create_edge(lastNode, &n);\n }\n }\n } else if (variationType == INVERSION){\n \/\/Inversion\n size_t length = lengthDistribution(generator);\n if (length > 0) {\n if (startIndex == 0) {\n\n pair<Node, Node> endNodes = splitNode(startIndex+length);\n\n Node end = endNodes.second;\n Node n = endNodes.first;\n graph.create_edge(&n, &end, true, false);\n\n\n } else if ( length + startIndex < seqSize-1) {\n pair<Node, Node> startNodes = splitNode(startIndex);\n pair<Node, Node> endNodes = splitNode(startIndex+length);\n\n Node start = startNodes.first;\n Node end = endNodes.second;\n Node n1 = startNodes.second;\n Node n2 = endNodes.first;\n graph.create_edge(&start, &n2, false, true);\n graph.create_edge(&n1, &end, true, false);\n\n } else if (length + startIndex == seqSize - 1) {\n\n pair<Node, Node> startNodes = splitNode(startIndex);\n\n Node start = startNodes.first;\n Node n = startNodes.second;\n graph.create_edge(&start, &n, false, true);\n\n\n }\n }\n }\n }\n return graph;\n};\n\n}\n}\n<commit_msg>add random sequence to random graph<commit_after>#include \"random_graph.hpp\"\n\nnamespace vg {\nnamespace unittest {\n\nVG randomGraph(int64_t seqSize, int64_t variantLen,\n int64_t variantCount){\n \/\/Create a random graph for a sequence of length seqSize\n \/\/variantLen is the mean length of a larger variation and variationCount\n \/\/is the number of variations in the graph\n\n VG graph;\n map<size_t, id_t> indexToNode;\n \/\/Index of original sequence to node that starts at that index\n\n random_device seed_source;\n default_random_engine generator(seed_source());\n \n uniform_int_distribution<int> baseDistribution(0, 3);\n poisson_distribution<size_t> lengthDistribution(variantLen);\n uniform_int_distribution<int> variantDistribution(0, 4);\n uniform_int_distribution<int> indexDistribution(0, seqSize-1);\n \n \/\/ Init the string with placeholder bases\n string seq(seqSize, 'A');\n \/\/ Set the string to random bases\n string alphabet = \"ACGT\";\n for (size_t i = 0; i < seq.size(); i++) {\n seq[i] = alphabet[baseDistribution(generator)];\n }\n \n Node* n = graph.create_node(seq);\n indexToNode.insert(make_pair(0, n->id()));\n\n \/\/Get random number generator for lengths and variation types\n\n auto splitNode = [&] (size_t index) -> pair<Node, Node> {\n \/\/Split graph at index. Split the node with the original sequence into\n \/\/the original node and a new node and connect the two\n\n auto n = --indexToNode.upper_bound(index);\/\/orig node containing pos\n size_t firstIndex = n->first; \/\/Index of first node\n size_t firstNodeID = n->second; \/\/Node ID of first node\n\n Node* firstNode = graph.get_node(firstNodeID);\n string origSeq = firstNode->sequence();\n if (index > firstIndex) {\n size_t nodeLength = index - firstIndex;\n\n firstNode->set_sequence(origSeq.substr(0, nodeLength));\/\/replace seq\n Node* newNode = graph.create_node(origSeq.substr(nodeLength));\n indexToNode.insert(make_pair(index, newNode->id()));\n\n\n \/\/Transfer outgoing edges from fist node to second node\n\n handle_t startFd = graph.get_handle(firstNodeID, false);\n handle_t endFd = graph.get_handle(newNode->id(), false);\n\n\n unordered_set<handle_t> nextHandles;\n auto addHandle = [&](const handle_t& h) ->bool {\n nextHandles.insert(h);\n return true;\n };\n graph.follow_edges(startFd, false, addHandle);\n\n for (handle_t h : nextHandles) {\n \/\/for each edge from start node, delete and add to new node\n graph.destroy_edge(startFd, h);\n graph.create_edge(endFd, h);\n }\n graph.create_edge(firstNode, newNode);\n return make_pair(*firstNode, *newNode);\n } else {\n\n auto n = --indexToNode.lower_bound(index);\n Node* prevNode = graph.get_node(n->second);\n return make_pair(*prevNode, *firstNode);\n }\n\n };\n\n enum VariationType {SNP = 0, POINT_INDEL = 1, STRUCTURAL_INDEL = 2,\n CNV = 3, INVERSION = 4};\n\n for (int j = 0; j < variantCount; j++) {\n \/\/add variants\n int startIndex = indexDistribution(generator);\n VariationType variationType = \n (VariationType) variantDistribution(generator);\n\n if (variationType == SNP) {\n\n if (startIndex == 0) {\n\n pair<Node, Node> endNodes = splitNode(startIndex+1);\n Node end = endNodes.second;\n Node* newNode = graph.create_node(string(1, alphabet[baseDistribution(generator)]));\n graph.create_edge(newNode, &end);\n\n } else if (startIndex < seqSize-2) {\n\n pair<Node, Node> startNodes = splitNode(startIndex);\n pair<Node, Node> endNodes = splitNode(startIndex+1);\n\n Node start = startNodes.first;\n Node end = endNodes.second;\n Node* newNode = graph.create_node(string(1, alphabet[baseDistribution(generator)]));\n graph.create_edge(&start, newNode);\n graph.create_edge(newNode, &end);\n\n } else if (startIndex == seqSize -2) {\n\n pair<Node, Node> startNodes = splitNode(startIndex);\n\n Node start = startNodes.first;\n Node* newNode = graph.create_node(string(1, alphabet[baseDistribution(generator)]));\n graph.create_edge(&start, newNode);\n\n }\n } else if (variationType == POINT_INDEL) {\n \/\/Short indel - deletion of original\n\n if (startIndex > 0 && startIndex < seqSize-1) {\n pair<Node, Node> startNodes = splitNode(startIndex);\n pair<Node, Node> endNodes = splitNode(startIndex+1);\n\n Node start = startNodes.first;\n Node end = endNodes.second;\n graph.create_edge(&start, &end);\n\n }\n } else if (variationType == STRUCTURAL_INDEL) {\n \/\/long indel\n size_t length = lengthDistribution(generator);\n\n if (length > 0 && startIndex > 0 &&\n length + startIndex < seqSize-1) {\n\n pair<Node, Node> startNodes = splitNode(startIndex);\n pair<Node, Node> endNodes = splitNode(startIndex+length);\n\n Node start = startNodes.first;\n Node end = endNodes.second;\n graph.create_edge(&start, &end);\n\n }\n } else if (variationType == CNV) {\n \/\/Copy number variation\n size_t length = lengthDistribution(generator);\n\n if (length > 0 ) {\n if (startIndex == 0) {\n pair<Node, Node> endNodes = splitNode(startIndex+length);\n Node n = endNodes.first;\n\n auto nodePair = --indexToNode.upper_bound(0);\/\/first node\n size_t firstNodeID = nodePair->second;\n\n Node* firstNode = graph.get_node(firstNodeID);\n\n graph.create_edge(&n, firstNode);\n\n } else if ( length + startIndex < seqSize-1) {\n\n pair<Node, Node> startNodes = splitNode(startIndex);\n pair<Node, Node> endNodes = splitNode(startIndex+length);\n\n Node n1 = startNodes.second;\n Node n2 = endNodes.first;\n graph.create_edge(&n2, &n1);\n\n } else if ( length + startIndex == seqSize -1) {\n pair<Node, Node> startNodes = splitNode(startIndex);\n\n auto nodePair = --indexToNode.upper_bound(seqSize);\n \/\/last node\n size_t lastNodeID = nodePair->second;\n\n Node* lastNode = graph.get_node(lastNodeID);\n\n Node n = startNodes.second;\n graph.create_edge(lastNode, &n);\n }\n }\n } else if (variationType == INVERSION){\n \/\/Inversion\n size_t length = lengthDistribution(generator);\n if (length > 0) {\n if (startIndex == 0) {\n\n pair<Node, Node> endNodes = splitNode(startIndex+length);\n\n Node end = endNodes.second;\n Node n = endNodes.first;\n graph.create_edge(&n, &end, true, false);\n\n\n } else if ( length + startIndex < seqSize-1) {\n pair<Node, Node> startNodes = splitNode(startIndex);\n pair<Node, Node> endNodes = splitNode(startIndex+length);\n\n Node start = startNodes.first;\n Node end = endNodes.second;\n Node n1 = startNodes.second;\n Node n2 = endNodes.first;\n graph.create_edge(&start, &n2, false, true);\n graph.create_edge(&n1, &end, true, false);\n\n } else if (length + startIndex == seqSize - 1) {\n\n pair<Node, Node> startNodes = splitNode(startIndex);\n\n Node start = startNodes.first;\n Node n = startNodes.second;\n graph.create_edge(&start, &n, false, true);\n\n\n }\n }\n }\n }\n return graph;\n};\n\n}\n}\n<|endoftext|>"} {"text":"<commit_before><commit_msg>Quick 'low-risk-for-the-next-release' fix to increase theme install\/load perf (should be a 2-4x speedup). Bug should remain open until a better approach (background threads, perhaps) is used.<commit_after><|endoftext|>"} {"text":"<commit_before>\/\/ Copyright (c) 2009 The Chromium Authors. All rights reserved.\n\/\/ Use of this source code is governed by a BSD-style license that can be\n\/\/ found in the LICENSE file.\n\n#include \"chrome\/browser\/gtk\/browser_window_gtk.h\"\n\n#include \"base\/logging.h\"\n#include \"chrome\/browser\/browser.h\"\n#include \"chrome\/browser\/gtk\/browser_toolbar_view_gtk.h\"\n#include \"chrome\/browser\/renderer_host\/render_widget_host_view_gtk.h\"\n#include \"chrome\/browser\/tab_contents\/web_contents.h\"\n\nnamespace {\n\ngboolean MainWindowDestroyed(GtkWindow* window, BrowserWindowGtk* browser_win) {\n delete browser_win;\n return FALSE; \/\/ Don't stop this message.\n}\n\ngboolean MainWindowConfigured(GtkWindow* window, GdkEventConfigure* event,\n BrowserWindowGtk* browser_win) {\n gfx::Rect bounds = gfx::Rect(event->x, event->y, event->width, event->height);\n browser_win->OnBoundsChanged(bounds);\n return FALSE;\n}\n\ngboolean MainWindowStateChanged(GtkWindow* window, GdkEventWindowState* event,\n BrowserWindowGtk* browser_win) {\n browser_win->OnStateChanged(event->new_window_state);\n return FALSE;\n}\n\n\/\/ Using gtk_window_get_position\/size creates a race condition, so only use\n\/\/ this to get the initial bounds. After window creation, we pick up the\n\/\/ normal bounds by connecting to the configure-event signal.\ngfx::Rect GetInitialWindowBounds(GtkWindow* window) {\n gint x, y, width, height;\n gtk_window_get_position(window, &x, &y);\n gtk_window_get_size(window, &width, &height);\n return gfx::Rect(x, y, width, height);\n}\n\ngboolean FalseMachine(GtkWindow* window, GdkEventWindowState* event,\n BrowserWindowGtk* browser_win) {\n return FALSE;\n}\n\n} \/\/ namespace\n\nBrowserWindowGtk::BrowserWindowGtk(Browser* browser) : browser_(browser) {\n Init();\n}\n\nBrowserWindowGtk::~BrowserWindowGtk() {\n Close();\n}\n\nvoid BrowserWindowGtk::Init() {\n window_ = GTK_WINDOW(gtk_window_new(GTK_WINDOW_TOPLEVEL));\n gtk_window_set_title(window_, \"Chromium\");\n gtk_window_set_default_size(window_, 640, 480);\n g_signal_connect(G_OBJECT(window_), \"destroy\",\n G_CALLBACK(MainWindowDestroyed), this);\n g_signal_connect(G_OBJECT(window_), \"configure-event\",\n G_CALLBACK(MainWindowConfigured), this);\n g_signal_connect(G_OBJECT(window_), \"expose-event\",\n G_CALLBACK(FalseMachine), this);\n g_signal_connect(G_OBJECT(window_), \"window-state-event\",\n G_CALLBACK(MainWindowStateChanged), this);\n bounds_ = GetInitialWindowBounds(window_);\n\n vbox_ = gtk_vbox_new(FALSE, 0);\n\n toolbar_.reset(new BrowserToolbarGtk(browser_.get()));\n toolbar_->Init(browser_->profile());\n toolbar_->AddToolbarToBox(vbox_);\n\n gtk_container_add(GTK_CONTAINER(window_), vbox_);\n}\n\nvoid BrowserWindowGtk::Show() {\n \/\/ TODO(estade): fix this block. As it stands, it is a temporary hack to get\n \/\/ the browser displaying something.\n if (content_area_ == NULL) {\n WebContents* contents = (WebContents*)(browser_->GetTabContentsAt(0));\n content_area_ = ((RenderWidgetHostViewGtk*)contents->\n render_view_host()->view())->native_view();\n gtk_box_pack_start(GTK_BOX(vbox_), content_area_, TRUE, TRUE, 0);\n contents->NavigateToPendingEntry(false);\n }\n\n gtk_widget_show_all(GTK_WIDGET(window_));\n}\n\nvoid BrowserWindowGtk::SetBounds(const gfx::Rect& bounds) {\n gint x = static_cast<gint>(bounds.x());\n gint y = static_cast<gint>(bounds.y());\n gint width = static_cast<gint>(bounds.width());\n gint height = static_cast<gint>(bounds.height());\n\n gtk_window_move(window_, x, y);\n gtk_window_resize(window_, width, height);\n}\n\nvoid BrowserWindowGtk::Close() {\n if (!window_)\n return;\n\n gtk_widget_destroy(GTK_WIDGET(window_));\n window_ = NULL;\n}\n\nvoid BrowserWindowGtk::Activate() {\n gtk_window_present(window_);\n}\n\nvoid BrowserWindowGtk::FlashFrame() {\n \/\/ May not be respected by all window managers.\n gtk_window_set_urgency_hint(window_, TRUE);\n}\n\nvoid* BrowserWindowGtk::GetNativeHandle() {\n return window_;\n}\n\nBrowserWindowTesting* BrowserWindowGtk::GetBrowserWindowTesting() {\n NOTIMPLEMENTED();\n return NULL;\n}\n\nStatusBubble* BrowserWindowGtk::GetStatusBubble() {\n NOTIMPLEMENTED();\n return NULL;\n}\n\nvoid BrowserWindowGtk::SelectedTabToolbarSizeChanged(bool is_animating) {\n NOTIMPLEMENTED();\n}\n\nvoid BrowserWindowGtk::UpdateTitleBar() {\n NOTIMPLEMENTED();\n}\n\nvoid BrowserWindowGtk::UpdateLoadingAnimations(bool should_animate) {\n NOTIMPLEMENTED();\n}\n\nvoid BrowserWindowGtk::SetStarredState(bool is_starred) {\n NOTIMPLEMENTED();\n}\n\ngfx::Rect BrowserWindowGtk::GetNormalBounds() const {\n return bounds_;\n}\n\nbool BrowserWindowGtk::IsMaximized() {\n return (state_ & GDK_WINDOW_STATE_MAXIMIZED);\n}\n\nLocationBar* BrowserWindowGtk::GetLocationBar() const {\n NOTIMPLEMENTED();\n return NULL;\n}\n\nvoid BrowserWindowGtk::UpdateStopGoState(bool is_loading) {\n NOTIMPLEMENTED();\n}\n\nvoid BrowserWindowGtk::UpdateToolbar(TabContents* contents,\n bool should_restore_state) {\n NOTIMPLEMENTED();\n}\n\nvoid BrowserWindowGtk::FocusToolbar() {\n NOTIMPLEMENTED();\n}\n\nbool BrowserWindowGtk::IsBookmarkBarVisible() const {\n NOTIMPLEMENTED();\n return false;\n}\n\nvoid BrowserWindowGtk::ToggleBookmarkBar() {\n NOTIMPLEMENTED();\n}\n\nvoid BrowserWindowGtk::ShowAboutChromeDialog() {\n NOTIMPLEMENTED();\n}\n\nvoid BrowserWindowGtk::ShowBookmarkManager() {\n NOTIMPLEMENTED();\n}\n\nbool BrowserWindowGtk::IsBookmarkBubbleVisible() const {\n NOTIMPLEMENTED();\n return false;\n}\n\nvoid BrowserWindowGtk::ShowBookmarkBubble(const GURL& url,\n bool already_bookmarked) {\n NOTIMPLEMENTED();\n}\n\nvoid BrowserWindowGtk::ShowReportBugDialog() {\n NOTIMPLEMENTED();\n}\n\nvoid BrowserWindowGtk::ShowClearBrowsingDataDialog() {\n NOTIMPLEMENTED();\n}\n\nvoid BrowserWindowGtk::ShowImportDialog() {\n NOTIMPLEMENTED();\n}\n\nvoid BrowserWindowGtk::ShowSearchEnginesDialog() {\n NOTIMPLEMENTED();\n}\n\nvoid BrowserWindowGtk::ShowPasswordManager() {\n NOTIMPLEMENTED();\n}\n\nvoid BrowserWindowGtk::ShowSelectProfileDialog() {\n NOTIMPLEMENTED();\n}\n\nvoid BrowserWindowGtk::ShowNewProfileDialog() {\n NOTIMPLEMENTED();\n}\n\nvoid BrowserWindowGtk::ShowHTMLDialog(HtmlDialogContentsDelegate* delegate,\n void* parent_window) {\n NOTIMPLEMENTED();\n}\n\nvoid BrowserWindowGtk::DestroyBrowser() {\n browser_.reset();\n}\n\nvoid BrowserWindowGtk::OnBoundsChanged(const gfx::Rect& bounds) {\n bounds_ = bounds;\n}\n\nvoid BrowserWindowGtk::OnStateChanged(GdkWindowState state) {\n state_ = state;\n}\n<commit_msg>Remove dead code from last commit.<commit_after>\/\/ Copyright (c) 2009 The Chromium Authors. All rights reserved.\n\/\/ Use of this source code is governed by a BSD-style license that can be\n\/\/ found in the LICENSE file.\n\n#include \"chrome\/browser\/gtk\/browser_window_gtk.h\"\n\n#include \"base\/logging.h\"\n#include \"chrome\/browser\/browser.h\"\n#include \"chrome\/browser\/gtk\/browser_toolbar_view_gtk.h\"\n#include \"chrome\/browser\/renderer_host\/render_widget_host_view_gtk.h\"\n#include \"chrome\/browser\/tab_contents\/web_contents.h\"\n\nnamespace {\n\ngboolean MainWindowDestroyed(GtkWindow* window, BrowserWindowGtk* browser_win) {\n delete browser_win;\n return FALSE; \/\/ Don't stop this message.\n}\n\ngboolean MainWindowConfigured(GtkWindow* window, GdkEventConfigure* event,\n BrowserWindowGtk* browser_win) {\n gfx::Rect bounds = gfx::Rect(event->x, event->y, event->width, event->height);\n browser_win->OnBoundsChanged(bounds);\n return FALSE;\n}\n\ngboolean MainWindowStateChanged(GtkWindow* window, GdkEventWindowState* event,\n BrowserWindowGtk* browser_win) {\n browser_win->OnStateChanged(event->new_window_state);\n return FALSE;\n}\n\n\/\/ Using gtk_window_get_position\/size creates a race condition, so only use\n\/\/ this to get the initial bounds. After window creation, we pick up the\n\/\/ normal bounds by connecting to the configure-event signal.\ngfx::Rect GetInitialWindowBounds(GtkWindow* window) {\n gint x, y, width, height;\n gtk_window_get_position(window, &x, &y);\n gtk_window_get_size(window, &width, &height);\n return gfx::Rect(x, y, width, height);\n}\n\n} \/\/ namespace\n\nBrowserWindowGtk::BrowserWindowGtk(Browser* browser) : browser_(browser) {\n Init();\n}\n\nBrowserWindowGtk::~BrowserWindowGtk() {\n Close();\n}\n\nvoid BrowserWindowGtk::Init() {\n window_ = GTK_WINDOW(gtk_window_new(GTK_WINDOW_TOPLEVEL));\n gtk_window_set_title(window_, \"Chromium\");\n gtk_window_set_default_size(window_, 640, 480);\n g_signal_connect(G_OBJECT(window_), \"destroy\",\n G_CALLBACK(MainWindowDestroyed), this);\n g_signal_connect(G_OBJECT(window_), \"configure-event\",\n G_CALLBACK(MainWindowConfigured), this);\n g_signal_connect(G_OBJECT(window_), \"window-state-event\",\n G_CALLBACK(MainWindowStateChanged), this);\n bounds_ = GetInitialWindowBounds(window_);\n\n vbox_ = gtk_vbox_new(FALSE, 0);\n\n toolbar_.reset(new BrowserToolbarGtk(browser_.get()));\n toolbar_->Init(browser_->profile());\n toolbar_->AddToolbarToBox(vbox_);\n\n gtk_container_add(GTK_CONTAINER(window_), vbox_);\n}\n\nvoid BrowserWindowGtk::Show() {\n \/\/ TODO(estade): fix this block. As it stands, it is a temporary hack to get\n \/\/ the browser displaying something.\n if (content_area_ == NULL) {\n WebContents* contents = (WebContents*)(browser_->GetTabContentsAt(0));\n content_area_ = ((RenderWidgetHostViewGtk*)contents->\n render_view_host()->view())->native_view();\n gtk_box_pack_start(GTK_BOX(vbox_), content_area_, TRUE, TRUE, 0);\n contents->NavigateToPendingEntry(false);\n }\n\n gtk_widget_show_all(GTK_WIDGET(window_));\n}\n\nvoid BrowserWindowGtk::SetBounds(const gfx::Rect& bounds) {\n gint x = static_cast<gint>(bounds.x());\n gint y = static_cast<gint>(bounds.y());\n gint width = static_cast<gint>(bounds.width());\n gint height = static_cast<gint>(bounds.height());\n\n gtk_window_move(window_, x, y);\n gtk_window_resize(window_, width, height);\n}\n\nvoid BrowserWindowGtk::Close() {\n if (!window_)\n return;\n\n gtk_widget_destroy(GTK_WIDGET(window_));\n window_ = NULL;\n}\n\nvoid BrowserWindowGtk::Activate() {\n gtk_window_present(window_);\n}\n\nvoid BrowserWindowGtk::FlashFrame() {\n \/\/ May not be respected by all window managers.\n gtk_window_set_urgency_hint(window_, TRUE);\n}\n\nvoid* BrowserWindowGtk::GetNativeHandle() {\n return window_;\n}\n\nBrowserWindowTesting* BrowserWindowGtk::GetBrowserWindowTesting() {\n NOTIMPLEMENTED();\n return NULL;\n}\n\nStatusBubble* BrowserWindowGtk::GetStatusBubble() {\n NOTIMPLEMENTED();\n return NULL;\n}\n\nvoid BrowserWindowGtk::SelectedTabToolbarSizeChanged(bool is_animating) {\n NOTIMPLEMENTED();\n}\n\nvoid BrowserWindowGtk::UpdateTitleBar() {\n NOTIMPLEMENTED();\n}\n\nvoid BrowserWindowGtk::UpdateLoadingAnimations(bool should_animate) {\n NOTIMPLEMENTED();\n}\n\nvoid BrowserWindowGtk::SetStarredState(bool is_starred) {\n NOTIMPLEMENTED();\n}\n\ngfx::Rect BrowserWindowGtk::GetNormalBounds() const {\n return bounds_;\n}\n\nbool BrowserWindowGtk::IsMaximized() {\n return (state_ & GDK_WINDOW_STATE_MAXIMIZED);\n}\n\nLocationBar* BrowserWindowGtk::GetLocationBar() const {\n NOTIMPLEMENTED();\n return NULL;\n}\n\nvoid BrowserWindowGtk::UpdateStopGoState(bool is_loading) {\n NOTIMPLEMENTED();\n}\n\nvoid BrowserWindowGtk::UpdateToolbar(TabContents* contents,\n bool should_restore_state) {\n NOTIMPLEMENTED();\n}\n\nvoid BrowserWindowGtk::FocusToolbar() {\n NOTIMPLEMENTED();\n}\n\nbool BrowserWindowGtk::IsBookmarkBarVisible() const {\n NOTIMPLEMENTED();\n return false;\n}\n\nvoid BrowserWindowGtk::ToggleBookmarkBar() {\n NOTIMPLEMENTED();\n}\n\nvoid BrowserWindowGtk::ShowAboutChromeDialog() {\n NOTIMPLEMENTED();\n}\n\nvoid BrowserWindowGtk::ShowBookmarkManager() {\n NOTIMPLEMENTED();\n}\n\nbool BrowserWindowGtk::IsBookmarkBubbleVisible() const {\n NOTIMPLEMENTED();\n return false;\n}\n\nvoid BrowserWindowGtk::ShowBookmarkBubble(const GURL& url,\n bool already_bookmarked) {\n NOTIMPLEMENTED();\n}\n\nvoid BrowserWindowGtk::ShowReportBugDialog() {\n NOTIMPLEMENTED();\n}\n\nvoid BrowserWindowGtk::ShowClearBrowsingDataDialog() {\n NOTIMPLEMENTED();\n}\n\nvoid BrowserWindowGtk::ShowImportDialog() {\n NOTIMPLEMENTED();\n}\n\nvoid BrowserWindowGtk::ShowSearchEnginesDialog() {\n NOTIMPLEMENTED();\n}\n\nvoid BrowserWindowGtk::ShowPasswordManager() {\n NOTIMPLEMENTED();\n}\n\nvoid BrowserWindowGtk::ShowSelectProfileDialog() {\n NOTIMPLEMENTED();\n}\n\nvoid BrowserWindowGtk::ShowNewProfileDialog() {\n NOTIMPLEMENTED();\n}\n\nvoid BrowserWindowGtk::ShowHTMLDialog(HtmlDialogContentsDelegate* delegate,\n void* parent_window) {\n NOTIMPLEMENTED();\n}\n\nvoid BrowserWindowGtk::DestroyBrowser() {\n browser_.reset();\n}\n\nvoid BrowserWindowGtk::OnBoundsChanged(const gfx::Rect& bounds) {\n bounds_ = bounds;\n}\n\nvoid BrowserWindowGtk::OnStateChanged(GdkWindowState state) {\n state_ = state;\n}\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\/api\/atom_bindings.h\"\n\n#include <algorithm>\n#include <iostream>\n#include <string>\n\n#include \"atom\/common\/atom_version.h\"\n#include \"atom\/common\/chrome_version.h\"\n#include \"atom\/common\/native_mate_converters\/string16_converter.h\"\n#include \"atom\/common\/node_includes.h\"\n#include \"base\/logging.h\"\n#include \"base\/sys_info.h\"\n#include \"native_mate\/dictionary.h\"\n\nnamespace atom {\n\nnamespace {\n\n\/\/ Dummy class type that used for crashing the program.\nstruct DummyClass { bool crash; };\n\n\/\/ Called when there is a fatal error in V8, we just crash the process here so\n\/\/ we can get the stack trace.\nvoid FatalErrorCallback(const char* location, const char* message) {\n LOG(ERROR) << \"Fatal error in V8: \" << location << \" \" << message;\n AtomBindings::Crash();\n}\n\n} \/\/ namespace\n\n\nAtomBindings::AtomBindings(uv_loop_t* loop) {\n uv_async_init(loop, &call_next_tick_async_, OnCallNextTick);\n call_next_tick_async_.data = this;\n metrics_ = base::ProcessMetrics::CreateCurrentProcessMetrics();\n}\n\nAtomBindings::~AtomBindings() {\n uv_close(reinterpret_cast<uv_handle_t*>(&call_next_tick_async_), nullptr);\n}\n\nvoid AtomBindings::BindTo(v8::Isolate* isolate,\n v8::Local<v8::Object> process) {\n v8::V8::SetFatalErrorHandler(FatalErrorCallback);\n\n mate::Dictionary dict(isolate, process);\n dict.SetMethod(\"crash\", &AtomBindings::Crash);\n dict.SetMethod(\"hang\", &Hang);\n dict.SetMethod(\"log\", &Log);\n dict.SetMethod(\"getProcessMemoryInfo\", &GetProcessMemoryInfo);\n dict.SetMethod(\"getSystemMemoryInfo\", &GetSystemMemoryInfo);\n dict.SetMethod(\"getCPUUsage\",\n base::Bind(&AtomBindings::GetCPUUsage, base::Unretained(this)));\n dict.SetMethod(\"getIOCounters\", &GetIOCounters);\n#if defined(OS_POSIX)\n dict.SetMethod(\"setFdLimit\", &base::SetFdLimit);\n#endif\n dict.SetMethod(\"activateUvLoop\",\n base::Bind(&AtomBindings::ActivateUVLoop, base::Unretained(this)));\n\n#if defined(MAS_BUILD)\n dict.Set(\"mas\", true);\n#endif\n\n mate::Dictionary versions;\n if (dict.Get(\"versions\", &versions)) {\n \/\/ TODO(kevinsawicki): Make read-only in 2.0 to match node\n versions.Set(ATOM_PROJECT_NAME, ATOM_VERSION_STRING);\n versions.Set(\"chrome\", CHROME_VERSION_STRING);\n\n \/\/ TODO(kevinsawicki): Remove in 2.0\n versions.Set(\"atom-shell\", ATOM_VERSION_STRING);\n }\n}\n\nvoid AtomBindings::EnvironmentDestroyed(node::Environment* env) {\n auto it = std::find(pending_next_ticks_.begin(), pending_next_ticks_.end(),\n env);\n if (it != pending_next_ticks_.end())\n pending_next_ticks_.erase(it);\n}\n\nvoid AtomBindings::ActivateUVLoop(v8::Isolate* isolate) {\n node::Environment* env = node::Environment::GetCurrent(isolate);\n if (std::find(pending_next_ticks_.begin(), pending_next_ticks_.end(), env) !=\n pending_next_ticks_.end())\n return;\n\n pending_next_ticks_.push_back(env);\n uv_async_send(&call_next_tick_async_);\n}\n\n\/\/ static\nvoid AtomBindings::OnCallNextTick(uv_async_t* handle) {\n AtomBindings* self = static_cast<AtomBindings*>(handle->data);\n for (std::list<node::Environment*>::const_iterator it =\n self->pending_next_ticks_.begin();\n it != self->pending_next_ticks_.end(); ++it) {\n node::Environment* env = *it;\n \/\/ KickNextTick, copied from node.cc:\n node::Environment::AsyncCallbackScope callback_scope(env);\n if (callback_scope.in_makecallback())\n continue;\n node::Environment::TickInfo* tick_info = env->tick_info();\n if (tick_info->length() == 0)\n env->isolate()->RunMicrotasks();\n v8::Local<v8::Object> process = env->process_object();\n if (tick_info->length() == 0)\n tick_info->set_index(0);\n env->tick_callback_function()->Call(process, 0, nullptr).IsEmpty();\n }\n\n self->pending_next_ticks_.clear();\n}\n\n\/\/ static\nvoid AtomBindings::Log(const base::string16& message) {\n std::cout << message << std::flush;\n}\n\n\/\/ static\nvoid AtomBindings::Crash() {\n static_cast<DummyClass*>(nullptr)->crash = true;\n}\n\n\/\/ static\nvoid AtomBindings::Hang() {\n for (;;)\n base::PlatformThread::Sleep(base::TimeDelta::FromSeconds(1));\n}\n\n\/\/ static\nv8::Local<v8::Value> AtomBindings::GetProcessMemoryInfo(v8::Isolate* isolate) {\n std::unique_ptr<base::ProcessMetrics> metrics(\n base::ProcessMetrics::CreateCurrentProcessMetrics());\n\n mate::Dictionary dict = mate::Dictionary::CreateEmpty(isolate);\n dict.Set(\"workingSetSize\",\n static_cast<double>(metrics->GetWorkingSetSize() >> 10));\n dict.Set(\"peakWorkingSetSize\",\n static_cast<double>(metrics->GetPeakWorkingSetSize() >> 10));\n\n size_t private_bytes, shared_bytes;\n if (metrics->GetMemoryBytes(&private_bytes, &shared_bytes)) {\n dict.Set(\"privateBytes\", static_cast<double>(private_bytes >> 10));\n dict.Set(\"sharedBytes\", static_cast<double>(shared_bytes >> 10));\n }\n\n return dict.GetHandle();\n}\n\n\/\/ static\nv8::Local<v8::Value> AtomBindings::GetSystemMemoryInfo(v8::Isolate* isolate,\n mate::Arguments* args) {\n base::SystemMemoryInfoKB mem_info;\n if (!base::GetSystemMemoryInfo(&mem_info)) {\n args->ThrowError(\"Unable to retrieve system memory information\");\n return v8::Undefined(isolate);\n }\n\n mate::Dictionary dict = mate::Dictionary::CreateEmpty(isolate);\n dict.Set(\"total\", mem_info.total);\n dict.Set(\"free\", mem_info.free);\n\n \/\/ NB: These return bogus values on macOS\n#if !defined(OS_MACOSX)\n dict.Set(\"swapTotal\", mem_info.swap_total);\n dict.Set(\"swapFree\", mem_info.swap_free);\n#endif\n\n return dict.GetHandle();\n}\n\nv8::Local<v8::Value> AtomBindings::GetCPUUsage(v8::Isolate* isolate) {\n mate::Dictionary dict = mate::Dictionary::CreateEmpty(isolate);\n int processor_count = base::SysInfo::NumberOfProcessors();\n dict.Set(\"percentCPUUsage\",\n metrics_->GetPlatformIndependentCPUUsage() \/ processor_count);\n dict.Set(\"idleWakeupsPerSecond\", metrics_->GetIdleWakeupsPerSecond());\n\n return dict.GetHandle();\n}\n\n\/\/ static\nv8::Local<v8::Value> AtomBindings::GetIOCounters(v8::Isolate* isolate) {\n std::unique_ptr<base::ProcessMetrics> metrics(\n base::ProcessMetrics::CreateCurrentProcessMetrics());\n base::IoCounters io_counters;\n mate::Dictionary dict = mate::Dictionary::CreateEmpty(isolate);\n\n if (metrics->GetIOCounters(&io_counters)) {\n dict.Set(\"readOperationCount\", io_counters.ReadOperationCount);\n dict.Set(\"writeOperationCount\", io_counters.WriteOperationCount);\n dict.Set(\"otherOperationCount\", io_counters.OtherOperationCount);\n dict.Set(\"readTransferCount\", io_counters.ReadTransferCount);\n dict.Set(\"writeTransferCount\", io_counters.WriteTransferCount);\n dict.Set(\"otherTransferCount\", io_counters.OtherTransferCount);\n }\n\n return dict.GetHandle();\n}\n\n} \/\/ namespace atom\n<commit_msg>Fix free memory calculation.<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\/api\/atom_bindings.h\"\n\n#include <algorithm>\n#include <iostream>\n#include <string>\n\n#include \"atom\/common\/atom_version.h\"\n#include \"atom\/common\/chrome_version.h\"\n#include \"atom\/common\/native_mate_converters\/string16_converter.h\"\n#include \"atom\/common\/node_includes.h\"\n#include \"base\/logging.h\"\n#include \"base\/sys_info.h\"\n#include \"native_mate\/dictionary.h\"\n\nnamespace atom {\n\nnamespace {\n\n\/\/ Dummy class type that used for crashing the program.\nstruct DummyClass { bool crash; };\n\n\/\/ Called when there is a fatal error in V8, we just crash the process here so\n\/\/ we can get the stack trace.\nvoid FatalErrorCallback(const char* location, const char* message) {\n LOG(ERROR) << \"Fatal error in V8: \" << location << \" \" << message;\n AtomBindings::Crash();\n}\n\n} \/\/ namespace\n\n\nAtomBindings::AtomBindings(uv_loop_t* loop) {\n uv_async_init(loop, &call_next_tick_async_, OnCallNextTick);\n call_next_tick_async_.data = this;\n metrics_ = base::ProcessMetrics::CreateCurrentProcessMetrics();\n}\n\nAtomBindings::~AtomBindings() {\n uv_close(reinterpret_cast<uv_handle_t*>(&call_next_tick_async_), nullptr);\n}\n\nvoid AtomBindings::BindTo(v8::Isolate* isolate,\n v8::Local<v8::Object> process) {\n v8::V8::SetFatalErrorHandler(FatalErrorCallback);\n\n mate::Dictionary dict(isolate, process);\n dict.SetMethod(\"crash\", &AtomBindings::Crash);\n dict.SetMethod(\"hang\", &Hang);\n dict.SetMethod(\"log\", &Log);\n dict.SetMethod(\"getProcessMemoryInfo\", &GetProcessMemoryInfo);\n dict.SetMethod(\"getSystemMemoryInfo\", &GetSystemMemoryInfo);\n dict.SetMethod(\"getCPUUsage\",\n base::Bind(&AtomBindings::GetCPUUsage, base::Unretained(this)));\n dict.SetMethod(\"getIOCounters\", &GetIOCounters);\n#if defined(OS_POSIX)\n dict.SetMethod(\"setFdLimit\", &base::SetFdLimit);\n#endif\n dict.SetMethod(\"activateUvLoop\",\n base::Bind(&AtomBindings::ActivateUVLoop, base::Unretained(this)));\n\n#if defined(MAS_BUILD)\n dict.Set(\"mas\", true);\n#endif\n\n mate::Dictionary versions;\n if (dict.Get(\"versions\", &versions)) {\n \/\/ TODO(kevinsawicki): Make read-only in 2.0 to match node\n versions.Set(ATOM_PROJECT_NAME, ATOM_VERSION_STRING);\n versions.Set(\"chrome\", CHROME_VERSION_STRING);\n\n \/\/ TODO(kevinsawicki): Remove in 2.0\n versions.Set(\"atom-shell\", ATOM_VERSION_STRING);\n }\n}\n\nvoid AtomBindings::EnvironmentDestroyed(node::Environment* env) {\n auto it = std::find(pending_next_ticks_.begin(), pending_next_ticks_.end(),\n env);\n if (it != pending_next_ticks_.end())\n pending_next_ticks_.erase(it);\n}\n\nvoid AtomBindings::ActivateUVLoop(v8::Isolate* isolate) {\n node::Environment* env = node::Environment::GetCurrent(isolate);\n if (std::find(pending_next_ticks_.begin(), pending_next_ticks_.end(), env) !=\n pending_next_ticks_.end())\n return;\n\n pending_next_ticks_.push_back(env);\n uv_async_send(&call_next_tick_async_);\n}\n\n\/\/ static\nvoid AtomBindings::OnCallNextTick(uv_async_t* handle) {\n AtomBindings* self = static_cast<AtomBindings*>(handle->data);\n for (std::list<node::Environment*>::const_iterator it =\n self->pending_next_ticks_.begin();\n it != self->pending_next_ticks_.end(); ++it) {\n node::Environment* env = *it;\n \/\/ KickNextTick, copied from node.cc:\n node::Environment::AsyncCallbackScope callback_scope(env);\n if (callback_scope.in_makecallback())\n continue;\n node::Environment::TickInfo* tick_info = env->tick_info();\n if (tick_info->length() == 0)\n env->isolate()->RunMicrotasks();\n v8::Local<v8::Object> process = env->process_object();\n if (tick_info->length() == 0)\n tick_info->set_index(0);\n env->tick_callback_function()->Call(process, 0, nullptr).IsEmpty();\n }\n\n self->pending_next_ticks_.clear();\n}\n\n\/\/ static\nvoid AtomBindings::Log(const base::string16& message) {\n std::cout << message << std::flush;\n}\n\n\/\/ static\nvoid AtomBindings::Crash() {\n static_cast<DummyClass*>(nullptr)->crash = true;\n}\n\n\/\/ static\nvoid AtomBindings::Hang() {\n for (;;)\n base::PlatformThread::Sleep(base::TimeDelta::FromSeconds(1));\n}\n\n\/\/ static\nv8::Local<v8::Value> AtomBindings::GetProcessMemoryInfo(v8::Isolate* isolate) {\n std::unique_ptr<base::ProcessMetrics> metrics(\n base::ProcessMetrics::CreateCurrentProcessMetrics());\n\n mate::Dictionary dict = mate::Dictionary::CreateEmpty(isolate);\n dict.Set(\"workingSetSize\",\n static_cast<double>(metrics->GetWorkingSetSize() >> 10));\n dict.Set(\"peakWorkingSetSize\",\n static_cast<double>(metrics->GetPeakWorkingSetSize() >> 10));\n\n size_t private_bytes, shared_bytes;\n if (metrics->GetMemoryBytes(&private_bytes, &shared_bytes)) {\n dict.Set(\"privateBytes\", static_cast<double>(private_bytes >> 10));\n dict.Set(\"sharedBytes\", static_cast<double>(shared_bytes >> 10));\n }\n\n return dict.GetHandle();\n}\n\n\/\/ static\nv8::Local<v8::Value> AtomBindings::GetSystemMemoryInfo(v8::Isolate* isolate,\n mate::Arguments* args) {\n base::SystemMemoryInfoKB mem_info;\n if (!base::GetSystemMemoryInfo(&mem_info)) {\n args->ThrowError(\"Unable to retrieve system memory information\");\n return v8::Undefined(isolate);\n }\n\n mate::Dictionary dict = mate::Dictionary::CreateEmpty(isolate);\n dict.Set(\"total\", mem_info.total);\n\n \/\/ See Chromium's \"base\/process\/process_metrics.h\" for an explanation.\n int free =\n#if defined(OS_WIN)\n mem_info.avail_phys;\n#else\n mem_info.free;\n#endif\n dict.Set(\"free\", free);\n\n \/\/ NB: These return bogus values on macOS\n#if !defined(OS_MACOSX)\n dict.Set(\"swapTotal\", mem_info.swap_total);\n dict.Set(\"swapFree\", mem_info.swap_free);\n#endif\n\n return dict.GetHandle();\n}\n\nv8::Local<v8::Value> AtomBindings::GetCPUUsage(v8::Isolate* isolate) {\n mate::Dictionary dict = mate::Dictionary::CreateEmpty(isolate);\n int processor_count = base::SysInfo::NumberOfProcessors();\n dict.Set(\"percentCPUUsage\",\n metrics_->GetPlatformIndependentCPUUsage() \/ processor_count);\n dict.Set(\"idleWakeupsPerSecond\", metrics_->GetIdleWakeupsPerSecond());\n\n return dict.GetHandle();\n}\n\n\/\/ static\nv8::Local<v8::Value> AtomBindings::GetIOCounters(v8::Isolate* isolate) {\n std::unique_ptr<base::ProcessMetrics> metrics(\n base::ProcessMetrics::CreateCurrentProcessMetrics());\n base::IoCounters io_counters;\n mate::Dictionary dict = mate::Dictionary::CreateEmpty(isolate);\n\n if (metrics->GetIOCounters(&io_counters)) {\n dict.Set(\"readOperationCount\", io_counters.ReadOperationCount);\n dict.Set(\"writeOperationCount\", io_counters.WriteOperationCount);\n dict.Set(\"otherOperationCount\", io_counters.OtherOperationCount);\n dict.Set(\"readTransferCount\", io_counters.ReadTransferCount);\n dict.Set(\"writeTransferCount\", io_counters.WriteTransferCount);\n dict.Set(\"otherTransferCount\", io_counters.OtherTransferCount);\n }\n\n return dict.GetHandle();\n}\n\n} \/\/ namespace atom\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) 2020 Scientific Computing and Imaging Institute,\n University of Utah.\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#include <Modules\/Factory\/ModuleDescriptionLookup.h>\n#include <Modules\/Fields\/InterfaceWithCleaver.h>\n#include <Modules\/Fields\/RefineTetMeshLocally.h>\n#include <Modules\/Legacy\/Fields\/MapFieldDataFromElemToNode.h>\n#include <Modules\/Legacy\/Fields\/MapFieldDataFromNodeToElem.h>\n#include <Modules\/Legacy\/Fields\/CalculateVectorMagnitudes.h>\n#include <Modules\/Legacy\/Fields\/CalculateGradients.h>\n#include <Modules\/Legacy\/Fields\/ConvertFieldBasis.h>\n#include <Modules\/Legacy\/Fields\/GetFieldData.h>\n#include <Modules\/Legacy\/Fields\/SetFieldData.h>\n#include <Modules\/Legacy\/Fields\/ApplyMappingMatrix.h>\n#include <Modules\/Legacy\/Fields\/SplitFieldByConnectedRegion.h>\n#include <Modules\/Legacy\/Math\/SelectSubMatrix.h>\n#include <Modules\/Legacy\/Math\/ConvertMatrixType.h>\n#include <Modules\/BrainStimulator\/ElectrodeCoilSetup.h>\n#include <Modules\/BrainStimulator\/SetConductivitiesToTetMesh.h>\n#include <Modules\/BrainStimulator\/SetupRHSforTDCSandTMS.h>\n#include <Modules\/BrainStimulator\/GenerateROIStatistics.h>\n#include <Modules\/BrainStimulator\/SimulateForwardMagneticField.h>\n#include <Modules\/Legacy\/Math\/AddKnownsToLinearSystem.h>\n#include <Modules\/Legacy\/FiniteElements\/BuildTDCSMatrix.h>\n#include <Modules\/Legacy\/FiniteElements\/BuildFEVolRHS.h>\n#include <Modules\/Legacy\/Visualization\/GenerateStreamLines.h>\n#include <Modules\/Legacy\/Inverse\/BuildSurfaceLaplacianMatrix.h>\n#include <Modules\/Legacy\/Fields\/ConvertHexVolToTetVol.h>\n#include <Modules\/Legacy\/Fields\/ExtractSimpleIsosurface.h>\n#include <Modules\/Legacy\/Fields\/ClipVolumeByIsovalue.h>\n#include <Modules\/Math\/ComputePCA.h>\n#include <Modules\/Visualization\/ShowString.h>\n\nusing namespace SCIRun::Dataflow::Networks;\nusing namespace SCIRun::Modules;\nusing namespace SCIRun::Modules::Factory;\nusing namespace SCIRun::Modules::Math;\nusing namespace SCIRun::Modules::Fields;\nusing namespace SCIRun::Modules::FiniteElements;\nusing namespace SCIRun::Modules::BrainStimulator;\nusing namespace SCIRun::Modules::Visualization;\nusing namespace SCIRun::Modules::Inverse;\n\nvoid ModuleDescriptionLookup::addBrainSpecificModules()\n{\n addModuleDesc<ElectrodeCoilSetup>(\"ElectrodeCoilSetup\", \"BrainStimulator\", \"SCIRun\", \" in progress \", \" Place tDCS electrodes and TMS coils \");\n addModuleDesc<SetConductivitiesToMesh>(\"SetConductivitiesToMesh\", \"BrainStimulator\", \"SCIRun\", \"New module\", \" Sets conveniently conductivity profile for tetrahedral mesh \");\n addModuleDesc<GenerateROIStatistics>(\"GenerateROIStatistics\", \"BrainStimulator\", \"SCIRun\", \" in progress \", \" Roi statistics \");\n addModuleDesc<SetupTDCS>(\"SetupTDCS\", \"BrainStimulator\", \"SCIRun\", \" in progress \", \" set RHS for tDCS and TMS \");\n}\n\nvoid ModuleDescriptionLookup::addMoreModules()\n{\n addModuleDesc<AddKnownsToLinearSystem>(\"AddKnownsToLinearSystem\", \"Math\", \"SCIRun\", \"Real ported module\", \"...\");\n addModuleDesc<CalculateVectorMagnitudes>(\"CalculateVectorMagnitudes\", \"ChangeFieldData\", \"SCIRun\", \"Real ported module\", \"...\");\n addModuleDesc<CalculateGradients >(\"CalculateGradients\", \"ChangeFieldData\", \"SCIRun\", \"Real ported module\", \"...\");\n\taddModuleDesc<ConvertFieldBasis>(\"ConvertFieldBasis\", \"ChangeFieldData\", \"SCIRun\", \"Real ported module\", \"...\");\n addModuleDesc<GetFieldData>(\"GetFieldData\", \"ChangeFieldData\", \"SCIRun\", \"Real ported module\", \"...\");\n addModuleDesc<InterfaceWithCleaver>(\"InterfaceWithCleaver\", \"NewField\", \"SCIRun\", \"New module\", \"...\");\n addModuleDesc<SetFieldData>(\"SetFieldData\", \"ChangeFieldData\", \"SCIRun\", \"Real ported module\", \"...\");\n addModuleDesc<SelectSubMatrix>(\"SelectSubMatrix\", \"Math\", \"SCIRun\", \"Real ported module\", \"...\");\n addModuleDesc<MapFieldDataFromElemToNode>(\"MapFieldDataFromElemToNode\", \"ChangeFieldData\", \"SCIRun\", \"Real ported module\", \"...\");\n addModuleDesc<ApplyMappingMatrix>(\"ApplyMappingMatrix\", \"ChangeFieldData\", \"SCIRun\", \"Real ported module\", \"...\");\n addModuleDesc<ConvertMatrixType>(\"ConvertMatrixType\", \"Math\", \"SCIRun\", \"Real ported module\", \"...\");\n addModuleDesc<MapFieldDataFromNodeToElem>(\"MapFieldDataFromNodeToElem\", \"ChangeFieldData\", \"SCIRun\", \"Real ported module\", \"...\");\n addModuleDesc<BuildFEVolRHS>(\"BuildFEVolRHS\", \"FiniteElements\", \"SCIRun\", \"Real ported module\", \"...\");\n addModuleDesc<GenerateStreamLines>(\"in progress--needs testing\", \"...\");\n addModuleDesc<ConvertHexVolToTetVol>(\"ConvertHexVolToTetVol\", \"ChangeMesh\", \"SCIRun\", \"Real ported module\", \"...\");\n addModuleDesc<BuildSurfaceLaplacianMatrix>(\"BuildSurfaceLaplacianMatrix\",\"Inverse\",\"SCIRun\",\"...\",\"...\");\n addModuleDesc<ExtractIsosurface>(\"...\",\"...\");\n addModuleDesc<ExtractIsosurface>(\"ExtractSimpleIsosurface\", \"NewField\", \"SCIRun\", \"...\", \"...\");\n addModuleDesc<ComputePCA>(\"ComputePCA\",\"Math\",\"SCIRun\",\"...\",\"...\");\n addModuleDesc<ClipVolumeByIsovalue>(\"ClipVolumeByIsovalue\",\"NewField\",\"SCIRun\",\"...\",\"...\");\n addModuleDesc<RefineTetMeshLocally>(\"RefineTetMeshLocally\",\"ChangeMesh\",\"SCIRun\",\"...\",\"...\");\n addModuleDesc<ShowString>(\"in progress--needs testing\", \"...\");\n}\n<commit_msg>Duplicate module in factory<commit_after>\/*\n For more information, please see: http:\/\/software.sci.utah.edu\n\n The MIT License\n\n Copyright (c) 2020 Scientific Computing and Imaging Institute,\n University of Utah.\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#include <Modules\/Factory\/ModuleDescriptionLookup.h>\n#include <Modules\/Fields\/InterfaceWithCleaver.h>\n#include <Modules\/Fields\/RefineTetMeshLocally.h>\n#include <Modules\/Legacy\/Fields\/MapFieldDataFromElemToNode.h>\n#include <Modules\/Legacy\/Fields\/MapFieldDataFromNodeToElem.h>\n#include <Modules\/Legacy\/Fields\/CalculateVectorMagnitudes.h>\n#include <Modules\/Legacy\/Fields\/ConvertFieldBasis.h>\n#include <Modules\/Legacy\/Fields\/GetFieldData.h>\n#include <Modules\/Legacy\/Fields\/SetFieldData.h>\n#include <Modules\/Legacy\/Fields\/ApplyMappingMatrix.h>\n#include <Modules\/Legacy\/Fields\/SplitFieldByConnectedRegion.h>\n#include <Modules\/Legacy\/Math\/SelectSubMatrix.h>\n#include <Modules\/Legacy\/Math\/ConvertMatrixType.h>\n#include <Modules\/BrainStimulator\/ElectrodeCoilSetup.h>\n#include <Modules\/BrainStimulator\/SetConductivitiesToTetMesh.h>\n#include <Modules\/BrainStimulator\/SetupRHSforTDCSandTMS.h>\n#include <Modules\/BrainStimulator\/GenerateROIStatistics.h>\n#include <Modules\/BrainStimulator\/SimulateForwardMagneticField.h>\n#include <Modules\/Legacy\/Math\/AddKnownsToLinearSystem.h>\n#include <Modules\/Legacy\/FiniteElements\/BuildTDCSMatrix.h>\n#include <Modules\/Legacy\/FiniteElements\/BuildFEVolRHS.h>\n#include <Modules\/Legacy\/Visualization\/GenerateStreamLines.h>\n#include <Modules\/Legacy\/Inverse\/BuildSurfaceLaplacianMatrix.h>\n#include <Modules\/Legacy\/Fields\/ConvertHexVolToTetVol.h>\n#include <Modules\/Legacy\/Fields\/ExtractSimpleIsosurface.h>\n#include <Modules\/Legacy\/Fields\/ClipVolumeByIsovalue.h>\n#include <Modules\/Math\/ComputePCA.h>\n#include <Modules\/Visualization\/ShowString.h>\n\nusing namespace SCIRun::Dataflow::Networks;\nusing namespace SCIRun::Modules;\nusing namespace SCIRun::Modules::Factory;\nusing namespace SCIRun::Modules::Math;\nusing namespace SCIRun::Modules::Fields;\nusing namespace SCIRun::Modules::FiniteElements;\nusing namespace SCIRun::Modules::BrainStimulator;\nusing namespace SCIRun::Modules::Visualization;\nusing namespace SCIRun::Modules::Inverse;\n\nvoid ModuleDescriptionLookup::addBrainSpecificModules()\n{\n addModuleDesc<ElectrodeCoilSetup>(\"ElectrodeCoilSetup\", \"BrainStimulator\", \"SCIRun\", \" in progress \", \" Place tDCS electrodes and TMS coils \");\n addModuleDesc<SetConductivitiesToMesh>(\"SetConductivitiesToMesh\", \"BrainStimulator\", \"SCIRun\", \"New module\", \" Sets conveniently conductivity profile for tetrahedral mesh \");\n addModuleDesc<GenerateROIStatistics>(\"GenerateROIStatistics\", \"BrainStimulator\", \"SCIRun\", \" in progress \", \" Roi statistics \");\n addModuleDesc<SetupTDCS>(\"SetupTDCS\", \"BrainStimulator\", \"SCIRun\", \" in progress \", \" set RHS for tDCS and TMS \");\n}\n\nvoid ModuleDescriptionLookup::addMoreModules()\n{\n addModuleDesc<AddKnownsToLinearSystem>(\"AddKnownsToLinearSystem\", \"Math\", \"SCIRun\", \"Real ported module\", \"...\");\n addModuleDesc<CalculateVectorMagnitudes>(\"CalculateVectorMagnitudes\", \"ChangeFieldData\", \"SCIRun\", \"Real ported module\", \"...\");\n\taddModuleDesc<ConvertFieldBasis>(\"ConvertFieldBasis\", \"ChangeFieldData\", \"SCIRun\", \"Real ported module\", \"...\");\n addModuleDesc<GetFieldData>(\"GetFieldData\", \"ChangeFieldData\", \"SCIRun\", \"Real ported module\", \"...\");\n addModuleDesc<InterfaceWithCleaver>(\"InterfaceWithCleaver\", \"NewField\", \"SCIRun\", \"New module\", \"...\");\n addModuleDesc<SetFieldData>(\"SetFieldData\", \"ChangeFieldData\", \"SCIRun\", \"Real ported module\", \"...\");\n addModuleDesc<SelectSubMatrix>(\"SelectSubMatrix\", \"Math\", \"SCIRun\", \"Real ported module\", \"...\");\n addModuleDesc<MapFieldDataFromElemToNode>(\"MapFieldDataFromElemToNode\", \"ChangeFieldData\", \"SCIRun\", \"Real ported module\", \"...\");\n addModuleDesc<ApplyMappingMatrix>(\"ApplyMappingMatrix\", \"ChangeFieldData\", \"SCIRun\", \"Real ported module\", \"...\");\n addModuleDesc<ConvertMatrixType>(\"ConvertMatrixType\", \"Math\", \"SCIRun\", \"Real ported module\", \"...\");\n addModuleDesc<MapFieldDataFromNodeToElem>(\"MapFieldDataFromNodeToElem\", \"ChangeFieldData\", \"SCIRun\", \"Real ported module\", \"...\");\n addModuleDesc<BuildFEVolRHS>(\"BuildFEVolRHS\", \"FiniteElements\", \"SCIRun\", \"Real ported module\", \"...\");\n addModuleDesc<GenerateStreamLines>(\"in progress--needs testing\", \"...\");\n addModuleDesc<ConvertHexVolToTetVol>(\"ConvertHexVolToTetVol\", \"ChangeMesh\", \"SCIRun\", \"Real ported module\", \"...\");\n addModuleDesc<BuildSurfaceLaplacianMatrix>(\"BuildSurfaceLaplacianMatrix\",\"Inverse\",\"SCIRun\",\"...\",\"...\");\n addModuleDesc<ExtractIsosurface>(\"...\",\"...\");\n addModuleDesc<ExtractIsosurface>(\"ExtractSimpleIsosurface\", \"NewField\", \"SCIRun\", \"...\", \"...\");\n addModuleDesc<ComputePCA>(\"ComputePCA\",\"Math\",\"SCIRun\",\"...\",\"...\");\n addModuleDesc<ClipVolumeByIsovalue>(\"ClipVolumeByIsovalue\",\"NewField\",\"SCIRun\",\"...\",\"...\");\n addModuleDesc<RefineTetMeshLocally>(\"RefineTetMeshLocally\",\"ChangeMesh\",\"SCIRun\",\"...\",\"...\");\n addModuleDesc<ShowString>(\"in progress--needs testing\", \"...\");\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 \"PolylineCompressor.h\"\n#include \"..\/DataStructures\/SegmentInformation.h\"\n\n#include <osrm\/Coordinate.h>\n\nvoid PolylineCompressor::encodeVectorSignedNumber(std::vector<int> &numbers, std::string &output)\n const\n{\n const unsigned end = static_cast<unsigned>(numbers.size());\n for (unsigned i = 0; i < end; ++i)\n {\n numbers[i] <<= 1;\n if (numbers[i] < 0)\n {\n numbers[i] = ~(numbers[i]);\n }\n }\n for (const int number: numbers)\n {\n encodeNumber(number, output);\n }\n}\n\nvoid PolylineCompressor::encodeNumber(int number_to_encode, std::string &output) const\n{\n while (number_to_encode >= 0x20)\n {\n const int next_value = (0x20 | (number_to_encode & 0x1f)) + 63;\n output += static_cast<char>(next_value);\n if (92 == next_value)\n {\n output += static_cast<char>(next_value);\n }\n number_to_encode >>= 5;\n }\n\n number_to_encode += 63;\n output += static_cast<char>(number_to_encode);\n if (92 == number_to_encode)\n {\n output += static_cast<char>(number_to_encode);\n }\n}\n\nJSON::String PolylineCompressor::printEncodedString(const std::vector<SegmentInformation> &polyline) const\n{\n std::string output;\n std::vector<int> delta_numbers;\n if (!polyline.empty())\n {\n FixedPointCoordinate last_coordinate = polyline[0].location;\n delta_numbers.emplace_back(last_coordinate.lat);\n delta_numbers.emplace_back(last_coordinate.lon);\n for (const auto & segment : polyline)\n {\n if (segment.necessary)\n {\n int lat_diff = segment.location.lat - last_coordinate.lat;\n int lon_diff = segment.location.lon - last_coordinate.lon;\n delta_numbers.emplace_back(lat_diff);\n delta_numbers.emplace_back(lon_diff);\n last_coordinate = segment.location;\n }\n }\n encodeVectorSignedNumber(delta_numbers, output);\n }\n JSON::String return_value(output);\n return return_value;\n}\n\nJSON::Array PolylineCompressor::printUnencodedString(const std::vector<SegmentInformation> &polyline) const\n{\n JSON::Array json_geometry_array;\n for( const auto & segment : polyline)\n {\n if (segment.necessary)\n {\n std::string tmp, output;\n FixedPointCoordinate::convertInternalLatLonToString(segment.location.lat, tmp);\n output += (tmp + \",\");\n FixedPointCoordinate::convertInternalLatLonToString(segment.location.lon, tmp);\n output += tmp;\n json_geometry_array.values.push_back(output);\n }\n }\n return json_geometry_array;\n}\n<commit_msg>reformat to cut long line<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 \"PolylineCompressor.h\"\n#include \"..\/DataStructures\/SegmentInformation.h\"\n\n#include <osrm\/Coordinate.h>\n\nvoid PolylineCompressor::encodeVectorSignedNumber(std::vector<int> &numbers, std::string &output)\n const\n{\n const unsigned end = static_cast<unsigned>(numbers.size());\n for (unsigned i = 0; i < end; ++i)\n {\n numbers[i] <<= 1;\n if (numbers[i] < 0)\n {\n numbers[i] = ~(numbers[i]);\n }\n }\n for (const int number : numbers)\n {\n encodeNumber(number, output);\n }\n}\n\nvoid PolylineCompressor::encodeNumber(int number_to_encode, std::string &output) const\n{\n while (number_to_encode >= 0x20)\n {\n const int next_value = (0x20 | (number_to_encode & 0x1f)) + 63;\n output += static_cast<char>(next_value);\n if (92 == next_value)\n {\n output += static_cast<char>(next_value);\n }\n number_to_encode >>= 5;\n }\n\n number_to_encode += 63;\n output += static_cast<char>(number_to_encode);\n if (92 == number_to_encode)\n {\n output += static_cast<char>(number_to_encode);\n }\n}\n\nJSON::String PolylineCompressor::printEncodedString(const std::vector<SegmentInformation> &polyline)\n const\n{\n std::string output;\n std::vector<int> delta_numbers;\n if (!polyline.empty())\n {\n FixedPointCoordinate last_coordinate = polyline[0].location;\n delta_numbers.emplace_back(last_coordinate.lat);\n delta_numbers.emplace_back(last_coordinate.lon);\n for (const auto &segment : polyline)\n {\n if (segment.necessary)\n {\n int lat_diff = segment.location.lat - last_coordinate.lat;\n int lon_diff = segment.location.lon - last_coordinate.lon;\n delta_numbers.emplace_back(lat_diff);\n delta_numbers.emplace_back(lon_diff);\n last_coordinate = segment.location;\n }\n }\n encodeVectorSignedNumber(delta_numbers, output);\n }\n JSON::String return_value(output);\n return return_value;\n}\n\nJSON::Array\nPolylineCompressor::printUnencodedString(const std::vector<SegmentInformation> &polyline) const\n{\n JSON::Array json_geometry_array;\n for (const auto &segment : polyline)\n {\n if (segment.necessary)\n {\n std::string tmp, output;\n FixedPointCoordinate::convertInternalLatLonToString(segment.location.lat, tmp);\n output += (tmp + \",\");\n FixedPointCoordinate::convertInternalLatLonToString(segment.location.lon, tmp);\n output += tmp;\n json_geometry_array.values.push_back(output);\n }\n }\n return json_geometry_array;\n}\n<|endoftext|>"} {"text":"<commit_before>#include <ORM\/backends\/Sqlite3\/Sqlite3Query.hpp>\n#include <ORM\/backends\/Sqlite3\/Sqlite3Bdd.hpp>\n\n\nnamespace orm\n{\n Sqlite3Query::Sqlite3Query(Bdd& bdd,const std::string& query) : Query(bdd,query), statement(0)\n {\n int result = sqlite3_prepare_v2(static_cast<Sqlite3Bdd&>(bdd).dbConn,query.c_str(),query.size()+1, &statement, NULL);\n\n #if ORM_VERBOSITY & ORM_ERROR\n if (result != SQLITE_OK)\n {\n ORM_PRINT_ERROR(\"Sqlite3Query::Sqlite3Query(bdd,string&) Failed to make the statment : \"<<sqlite3_errstr(result));\n }\n #endif\n };\n\n Sqlite3Query::Sqlite3Query(Bdd& bdd,std::string&& query) : Query(bdd,query), statement(0)\n {\n int result = sqlite3_prepare_v2(static_cast<Sqlite3Bdd&>(bdd).dbConn,query.c_str(),query.size()+1, &statement, NULL);\n\n #if ORM_VERBOSITY & ORM_ERROR\n if (result != SQLITE_OK)\n {\n ORM_PRINT_ERROR(\"Sqlite3Query::Sqlite3Query(bdd,string&&) Failed to make the statment\")\n \/\/\/ \\todo <<sqlite3_errstr(result)<<std::endl;\n }\n #endif\n };\n\n Sqlite3Query::~Sqlite3Query()\n {\n if(statement)\n {\n int result = sqlite3_finalize(statement);\n\n #if ORM_VERBOSITY & ORM_ERROR\n if(result != SQLITE_OK)\n {\n ORM_PRINT_ERROR(\"Sqlite3Query::~Sqlite3Query() Failed to close the statement\")\n \/\/\/ \\todo <<sqlite3_errstr(result)<<std::endl;\n }\n #endif\n }\n };\n\n\n int Sqlite3Query::count()const\n {\n return sqlite3_data_count(statement);\n };\n\n bool Sqlite3Query::get(bool& value,const int& column)const\n {\n value = (bool)sqlite3_column_int(statement,column);\n return true;\n };\n\n bool Sqlite3Query::get(int& value,const int& column)const\n {\n value = sqlite3_column_int(statement,column);\n return true;\n };\n\n bool Sqlite3Query::getPk(int& value, const int& colum)const\n {\n if(sqlite3_column_type(statement,colum) == SQLITE_NULL)\n {\n value = -1;\n return false;\n }\n value = sqlite3_column_int(statement,colum);\n return true;\n }\n\n bool Sqlite3Query::get(unsigned int& value,const int& column)const\n {\n value = (unsigned int)sqlite3_column_int(statement,column);\n return true;\n };\n\n bool Sqlite3Query::get(long long int& value,const int& column)const\n { \n value = (long long int)sqlite3_column_int64(statement,column);\n return true;\n };\n\n bool Sqlite3Query::get(long long unsigned int& value,const int& column)const\n {\n value = (unsigned long long int)sqlite3_column_int64(statement,column);\n\n return true;\n };\n\n bool Sqlite3Query::get(float& value,const int& column)const\n {\n value = (float)sqlite3_column_double(statement,column);\n return true;\n };\n\n bool Sqlite3Query::get(double& value,const int& column)const\n {\n value = (double)sqlite3_column_double(statement,column);\n return true;\n };\n\n bool Sqlite3Query::get(long double& value,const int& column)const\n {\n value = (long double)sqlite3_column_double(statement,column);\n return true;\n };\n\n bool Sqlite3Query::get(std::string& value,const int& column)const\n {\n const unsigned char* res = sqlite3_column_text(statement,column);\n\n if (res)\n value = (const char*)res;\n else\n value = \"\";\n\n return true;\n };\n\n bool Sqlite3Query::next()\n {\n int result = sqlite3_step(statement);\n if(result == SQLITE_ROW)\n return true;\n\n ORM_PRINT_WARNING(\"Sqlite3Query::next() imposible to get next row\")\n \/\/\/\\ todo sqlite3_errstr(result)<<std::endl;\n\n return false;\n\n }\n\n bool Sqlite3Query::set(const bool& value,const unsigned int& column)\n {\n if(not prepared)\n return false;\n return (sqlite3_bind_int(statement,(int)column,(int)value)== SQLITE_OK);\n };\n\n bool Sqlite3Query::set(const int& value,const unsigned int& column)\n {\n if(not prepared)\n return false;\n return (sqlite3_bind_int(statement,(int)column,(int)value)== SQLITE_OK);\n };\n\n bool Sqlite3Query::set(const unsigned int& value,const unsigned int& column)\n {\n if(not prepared)\n return false;\n return (sqlite3_bind_int(statement,(int)column,(int)value)== SQLITE_OK);\n };\n\n bool Sqlite3Query::set(const long long int& value,const unsigned int& column)\n {\n if(not prepared)\n return false;\n return (sqlite3_bind_int64(statement,(int)column,(sqlite3_int64)value)== SQLITE_OK);\n };\n\n bool Sqlite3Query::set(const long long unsigned int& value,const unsigned int& column)\n {\n if(not prepared)\n return false;\n return (sqlite3_bind_int64(statement,(int)column,(sqlite3_int64)value)== SQLITE_OK);\n };\n\n bool Sqlite3Query::set(const float& value,const unsigned int& column)\n {\n if(not prepared)\n return false;\n return (sqlite3_bind_double(statement,(int)column,(double)value)== SQLITE_OK);\n };\n\n bool Sqlite3Query::set(const double& value,const unsigned int& column)\n {\n if(not prepared)\n return false;\n return (sqlite3_bind_double(statement,(int)column,(double)value)== SQLITE_OK);\n };\n\n bool Sqlite3Query::set(const long double& value,const unsigned int& column)\n {\n if(not prepared)\n return false;\n return (sqlite3_bind_double(statement,(int)column,(double)value)== SQLITE_OK);\n };\n\n bool Sqlite3Query::set(const std::string& value,const unsigned int& column)\n {\n if(not prepared)\n return false;\n return (sqlite3_bind_text(statement,(int)column,value.c_str(),-1,SQLITE_TRANSIENT)== SQLITE_OK);\n };\n\n bool Sqlite3Query::setNull(const int& value,const unsigned int& column)\n {\n if(not prepared)\n return false;\n return (sqlite3_bind_null(statement,(int)column)== SQLITE_OK);\n };\n\n void Sqlite3Query::executeQuery()\n {\n };\n \n};\n<commit_msg>remove sqlite3 error<commit_after>#include <ORM\/backends\/Sqlite3\/Sqlite3Query.hpp>\n#include <ORM\/backends\/Sqlite3\/Sqlite3Bdd.hpp>\n\n\nnamespace orm\n{\n Sqlite3Query::Sqlite3Query(Bdd& bdd,const std::string& query) : Query(bdd,query), statement(0)\n {\n int result = sqlite3_prepare_v2(static_cast<Sqlite3Bdd&>(bdd).dbConn,query.c_str(),query.size()+1, &statement, NULL);\n\n #if ORM_VERBOSITY & ORM_ERROR\n if (result != SQLITE_OK)\n {\n ORM_PRINT_ERROR(\"Sqlite3Query::Sqlite3Query(bdd,string&) Failed to make the statment\");\n \/\/\\todo: \"<<sqlite3_errstr(result));\n }\n #endif\n };\n\n Sqlite3Query::Sqlite3Query(Bdd& bdd,std::string&& query) : Query(bdd,query), statement(0)\n {\n int result = sqlite3_prepare_v2(static_cast<Sqlite3Bdd&>(bdd).dbConn,query.c_str(),query.size()+1, &statement, NULL);\n\n #if ORM_VERBOSITY & ORM_ERROR\n if (result != SQLITE_OK)\n {\n ORM_PRINT_ERROR(\"Sqlite3Query::Sqlite3Query(bdd,string&&) Failed to make the statment\")\n \/\/\/ \\todo <<sqlite3_errstr(result)<<std::endl;\n }\n #endif\n };\n\n Sqlite3Query::~Sqlite3Query()\n {\n if(statement)\n {\n int result = sqlite3_finalize(statement);\n\n #if ORM_VERBOSITY & ORM_ERROR\n if(result != SQLITE_OK)\n {\n ORM_PRINT_ERROR(\"Sqlite3Query::~Sqlite3Query() Failed to close the statement\")\n \/\/\/ \\todo <<sqlite3_errstr(result)<<std::endl;\n }\n #endif\n }\n };\n\n\n int Sqlite3Query::count()const\n {\n return sqlite3_data_count(statement);\n };\n\n bool Sqlite3Query::get(bool& value,const int& column)const\n {\n value = (bool)sqlite3_column_int(statement,column);\n return true;\n };\n\n bool Sqlite3Query::get(int& value,const int& column)const\n {\n value = sqlite3_column_int(statement,column);\n return true;\n };\n\n bool Sqlite3Query::getPk(int& value, const int& colum)const\n {\n if(sqlite3_column_type(statement,colum) == SQLITE_NULL)\n {\n value = -1;\n return false;\n }\n value = sqlite3_column_int(statement,colum);\n return true;\n }\n\n bool Sqlite3Query::get(unsigned int& value,const int& column)const\n {\n value = (unsigned int)sqlite3_column_int(statement,column);\n return true;\n };\n\n bool Sqlite3Query::get(long long int& value,const int& column)const\n { \n value = (long long int)sqlite3_column_int64(statement,column);\n return true;\n };\n\n bool Sqlite3Query::get(long long unsigned int& value,const int& column)const\n {\n value = (unsigned long long int)sqlite3_column_int64(statement,column);\n\n return true;\n };\n\n bool Sqlite3Query::get(float& value,const int& column)const\n {\n value = (float)sqlite3_column_double(statement,column);\n return true;\n };\n\n bool Sqlite3Query::get(double& value,const int& column)const\n {\n value = (double)sqlite3_column_double(statement,column);\n return true;\n };\n\n bool Sqlite3Query::get(long double& value,const int& column)const\n {\n value = (long double)sqlite3_column_double(statement,column);\n return true;\n };\n\n bool Sqlite3Query::get(std::string& value,const int& column)const\n {\n const unsigned char* res = sqlite3_column_text(statement,column);\n\n if (res)\n value = (const char*)res;\n else\n value = \"\";\n\n return true;\n };\n\n bool Sqlite3Query::next()\n {\n int result = sqlite3_step(statement);\n if(result == SQLITE_ROW)\n return true;\n\n ORM_PRINT_WARNING(\"Sqlite3Query::next() imposible to get next row\")\n \/\/\/\\ todo sqlite3_errstr(result)<<std::endl;\n\n return false;\n\n }\n\n bool Sqlite3Query::set(const bool& value,const unsigned int& column)\n {\n if(not prepared)\n return false;\n return (sqlite3_bind_int(statement,(int)column,(int)value)== SQLITE_OK);\n };\n\n bool Sqlite3Query::set(const int& value,const unsigned int& column)\n {\n if(not prepared)\n return false;\n return (sqlite3_bind_int(statement,(int)column,(int)value)== SQLITE_OK);\n };\n\n bool Sqlite3Query::set(const unsigned int& value,const unsigned int& column)\n {\n if(not prepared)\n return false;\n return (sqlite3_bind_int(statement,(int)column,(int)value)== SQLITE_OK);\n };\n\n bool Sqlite3Query::set(const long long int& value,const unsigned int& column)\n {\n if(not prepared)\n return false;\n return (sqlite3_bind_int64(statement,(int)column,(sqlite3_int64)value)== SQLITE_OK);\n };\n\n bool Sqlite3Query::set(const long long unsigned int& value,const unsigned int& column)\n {\n if(not prepared)\n return false;\n return (sqlite3_bind_int64(statement,(int)column,(sqlite3_int64)value)== SQLITE_OK);\n };\n\n bool Sqlite3Query::set(const float& value,const unsigned int& column)\n {\n if(not prepared)\n return false;\n return (sqlite3_bind_double(statement,(int)column,(double)value)== SQLITE_OK);\n };\n\n bool Sqlite3Query::set(const double& value,const unsigned int& column)\n {\n if(not prepared)\n return false;\n return (sqlite3_bind_double(statement,(int)column,(double)value)== SQLITE_OK);\n };\n\n bool Sqlite3Query::set(const long double& value,const unsigned int& column)\n {\n if(not prepared)\n return false;\n return (sqlite3_bind_double(statement,(int)column,(double)value)== SQLITE_OK);\n };\n\n bool Sqlite3Query::set(const std::string& value,const unsigned int& column)\n {\n if(not prepared)\n return false;\n return (sqlite3_bind_text(statement,(int)column,value.c_str(),-1,SQLITE_TRANSIENT)== SQLITE_OK);\n };\n\n bool Sqlite3Query::setNull(const int& value,const unsigned int& column)\n {\n if(not prepared)\n return false;\n return (sqlite3_bind_null(statement,(int)column)== SQLITE_OK);\n };\n\n void Sqlite3Query::executeQuery()\n {\n };\n \n};\n<|endoftext|>"} {"text":"<commit_before>#include <iostream>\n#include <string>\n\/*add the header if you need*\/\nusing namespace std;\n\n\/\/Abstract base class for Dessert Item hierarchy\nclass DessertItem\n{\nprivate:\n\/\/Name of the DessertItem object\n string name;\n\npublic:\n DessertItem(){}\n DessertItem(string name):name(name){}\n\/\/Empty virtual destructor for DessertItem class\n virtual ~DessertItem(){} \n\/\/returns Name of DessertItem \n string getName(){ return name;}\n virtual string getDetails() = 0;\n virtual double getCost() = 0;\n};\n\nclass IceCream : public DessertItem \n{\n \n \/* Write about IceCream Constructor\n IceCream(string name, double cost):DessertItem(name),cost(cost)\n *\/\n\n \/* Write about IceCream other member functions*\/\nprivate:\n double cost;\n};\n\nclass Topping : public IceCream \n{\n\n \/* Write about Topping Constructor\n Topping(string iceCreamName, double iceCreamCost,\n\tstring toppingName, double toppingCost)\n *\/\n\n \/* Write about Topping other member functions*\/\nprivate:\n string toppingName;\n double toppingCost;\n};\n\nclass Cookie : public DessertItem \n{\n \/* Write about Cookie Constructor\n Cookie(string name, int number, double pricePerDozen)\n *\/\n\n \/* Write about Cookie other member functions*\/\n\nprivate:\n\/\/Number of dozens of Cookie\n int number;\n double pricePerDozen;\n};\n\nclass Candy : public DessertItem \n{\npublic:\n \/* Write here about Candy Constructor\n Candy(string name, double weight, double pricePerGram)\n *\/\n \/* Write about Candy other member functions*\/\t\nprivate:\n\/\/Weight of Candy\n double weight;\n double pricePerGram;\n};\n\n\n\nclass Checkout {\n \n friend ostream &operator<<(std::ostream &, Checkout &);\n\n \n \/* Write about Checkout member functions\n 1. \"enterItem\" function to add the element into the list\n 2. \"removeItem\" function to remove the elemtent from the list\n 3. calculate the total cost and tax in the list\n 4. \"numberOfItems\" for number of Item in the list\n 5. \"clear\" clear all Items from list\n *\/\nprivate:\n list<DessertItem*> itemList;\n};\n\n\nostream &operator<<(ostream &output, Checkout &checkout){\n \n\/*Overloaded operator that output a receipt for the current list of items*\/\n\n}\n<commit_msg>HW5\/p1.hpp<commit_after>#include <iostream>\n#include <string>\n\/*add the header if you need*\/\n#include <list>\n#include <iomanip>\n#include <sstream>\nusing namespace std;\n\n\/\/Abstract base class for Dessert Item hierarchy\nclass DessertItem\n{\nprivate:\n\/\/Name of the DessertItem object\n string name;\n\npublic:\n DessertItem(){}\n DessertItem(string name):name(name){}\n\/\/Empty virtual destructor for DessertItem class\n virtual ~DessertItem(){}\n\/\/returns Name of DessertItem\n string getName(){ return name;}\n virtual string getDetails() = 0;\n virtual double getCost() = 0;\n};\n\nclass IceCream : public DessertItem\n{\npublic:\n \/* Write about IceCream Constructor\n IceCream(string name, double cost):DessertItem(name),cost(cost)\n *\/\n IceCream(string name, double cost):DessertItem(name), cost(cost)\n {\n\n }\n \/* Write about IceCream other member functions*\/\n string getDetails()\n {\n return \"\";\n }\n\n double getCost()\n {\n return cost;\n }\nprivate:\n double cost;\n};\n\nclass Topping : public IceCream\n{\npublic:\n \/* Write about Topping Constructor\n Topping(string iceCreamName, double iceCreamCost,\n\tstring toppingName, double toppingCost)\n *\/\n Topping(string iceCreamName, double iceCreamCost, string toppingName, double toppingCost)\n :IceCream(toppingName + \" Sundae with \" + iceCreamName, iceCreamCost), toppingName(toppingName), toppingCost(toppingCost)\n {\n\n }\n \/* Write about Topping other member functions*\/\n string getDetails()\n {\n return \"\";\n }\n\n double getCost()\n {\n return toppingCost + IceCream::getCost();\n }\nprivate:\n string toppingName;\n double toppingCost;\n};\n\nclass Cookie : public DessertItem\n{\npublic:\n \/* Write about Cookie Constructor\n Cookie(string name, int number, double pricePerDozen)\n *\/\n Cookie(string name, int number, double pricePerDozen)\n :DessertItem(name), number(number), pricePerDozen(pricePerDozen)\n {\n\n }\n \/* Write about Cookie other member functions*\/\n string getDetails()\n {\n return \"(\" + to_string(number) + \" dozen(s) * \" + (stringstream() << pricePerDozen).str() + \"\/dozen)\\n\";\n }\n\n double getCost()\n {\n return number * pricePerDozen;\n }\nprivate:\n\/\/Number of dozens of Cookie\n int number;\n double pricePerDozen;\n};\n\nclass Candy : public DessertItem\n{\npublic:\n \/* Write here about Candy Constructor\n Candy(string name, double weight, double pricePerGram)\n *\/\n Candy(string name, double weight, double pricePerGram)\n :DessertItem(name), weight(weight), pricePerGram(pricePerGram)\n {\n\n }\n \/* Write about Candy other member functions*\/\n string getDetails()\n {\n return \"(\" + (stringstream() << weight).str() + \" gram(s) * \" + (stringstream() << pricePerGram).str() + \"\/gram)\\n\";\n }\n\n double getCost()\n {\n return weight * pricePerGram;\n }\nprivate:\n\/\/Weight of Candy\n double weight;\n double pricePerGram;\n};\n\n\n\nclass Checkout {\n\n friend ostream &operator<<(std::ostream &, Checkout &);\n\n\n \/* Write about Checkout member functions\n 1. \"enterItem\" function to add the element into the list\n 2. \"removeItem\" function to remove the elemtent from the list\n 3. calculate the total cost and tax in the list\n 4. \"numberOfItems\" for number of Item in the list\n 5. \"clear\" clear all Items from list\n *\/\npublic:\n void enterItem(DessertItem *ptr)\n {\n itemList.push_back(ptr);\n }\n\n void removeItem(int idx)\n {\n auto it = itemList.begin();\n while(idx--){\n it++;\n }\n itemList.erase(it);\n }\n\n int numberOfItems() const\n {\n return itemList.size();\n }\n\n void clear()\n {\n itemList.clear();\n }\nprivate:\n list<DessertItem*> itemList;\n};\n\n\nostream &operator<<(ostream &output, Checkout &checkout){\n\n\/*Overloaded operator that output a receipt for the current list of items*\/\n output.setf(ios::fixed, ios::floatfield);\n output << setprecision(0);\n output << \"Welcome to OOP's shop\" << endl;\n output << \"------------------------------\" << endl;\n output << endl;\n output << \"Number of items: \" << checkout.numberOfItems() << endl;\n output << endl;\n double cost = 0;\n for(auto dessert:checkout.itemList){\n cost += dessert->getCost();\n cout << setw(50) << left << dessert->getName() << right << dessert->getCost() << endl;\n cout << dessert->getDetails();\n }\n output << endl;\n output << \"------------------------------\" << endl;\n output << setw(50) << left << \"Cost\" << right << cost << endl;\n output << setw(50) << left << \"Tax\" << right << cost \/ 20 << endl;\n output << endl;\n output << setw(50) << left << \"Total cost\" << right << cost * (1.05);\n return output;\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 \"chrome\/renderer\/media\/cast_rtp_stream.h\"\n\n#include \"base\/bind.h\"\n#include \"base\/logging.h\"\n#include \"base\/memory\/weak_ptr.h\"\n#include \"chrome\/renderer\/media\/cast_session.h\"\n#include \"chrome\/renderer\/media\/cast_udp_transport.h\"\n#include \"content\/public\/renderer\/media_stream_audio_sink.h\"\n#include \"content\/public\/renderer\/media_stream_video_sink.h\"\n#include \"media\/audio\/audio_parameters.h\"\n#include \"media\/base\/audio_bus.h\"\n#include \"media\/base\/audio_fifo.h\"\n#include \"media\/base\/bind_to_current_loop.h\"\n#include \"media\/base\/multi_channel_resampler.h\"\n#include \"media\/cast\/cast_config.h\"\n#include \"media\/cast\/cast_defines.h\"\n#include \"media\/cast\/cast_sender.h\"\n#include \"media\/cast\/transport\/cast_transport_config.h\"\n#include \"third_party\/WebKit\/public\/platform\/WebMediaStreamSource.h\"\n\nusing media::cast::AudioSenderConfig;\nusing media::cast::VideoSenderConfig;\n\nnamespace {\n\nconst char kCodecNameOpus[] = \"OPUS\";\nconst char kCodecNameVp8[] = \"VP8\";\n\n\/\/ This constant defines the number of sets of audio data to buffer\n\/\/ in the FIFO. If input audio and output data have different resampling\n\/\/ rates then buffer is necessary to avoid audio glitches.\n\/\/ See CastAudioSink::ResampleData() and CastAudioSink::OnSetFormat()\n\/\/ for more defaults.\nconst int kBufferAudioData = 2;\n\nCastRtpPayloadParams DefaultOpusPayload() {\n CastRtpPayloadParams payload;\n payload.ssrc = 1;\n payload.feedback_ssrc = 1;\n payload.payload_type = 127;\n payload.codec_name = kCodecNameOpus;\n payload.clock_rate = 48000;\n payload.channels = 2;\n payload.min_bitrate = payload.max_bitrate =\n media::cast::kDefaultAudioEncoderBitrate;\n return payload;\n}\n\nCastRtpPayloadParams DefaultVp8Payload() {\n CastRtpPayloadParams payload;\n payload.ssrc = 11;\n payload.feedback_ssrc = 12;\n payload.payload_type = 96;\n payload.codec_name = kCodecNameVp8;\n payload.clock_rate = 90000;\n payload.width = 1280;\n payload.height = 720;\n payload.min_bitrate = 50 * 1000;\n payload.max_bitrate = 2000 * 1000;\n return payload;\n}\n\nstd::vector<CastRtpParams> SupportedAudioParams() {\n \/\/ TODO(hclam): Fill in more codecs here.\n std::vector<CastRtpParams> supported_params;\n supported_params.push_back(CastRtpParams(DefaultOpusPayload()));\n return supported_params;\n}\n\nstd::vector<CastRtpParams> SupportedVideoParams() {\n \/\/ TODO(hclam): Fill in H264 here.\n std::vector<CastRtpParams> supported_params;\n supported_params.push_back(CastRtpParams(DefaultVp8Payload()));\n return supported_params;\n}\n\nbool ToAudioSenderConfig(const CastRtpParams& params,\n AudioSenderConfig* config) {\n config->sender_ssrc = params.payload.ssrc;\n config->incoming_feedback_ssrc = params.payload.feedback_ssrc;\n config->rtp_config.payload_type = params.payload.payload_type;\n config->use_external_encoder = false;\n config->frequency = params.payload.clock_rate;\n config->channels = params.payload.channels;\n config->bitrate = params.payload.max_bitrate;\n config->codec = media::cast::transport::kPcm16;\n if (params.payload.codec_name == kCodecNameOpus)\n config->codec = media::cast::transport::kOpus;\n else\n return false;\n return true;\n}\n\nbool ToVideoSenderConfig(const CastRtpParams& params,\n VideoSenderConfig* config) {\n config->sender_ssrc = params.payload.ssrc;\n config->incoming_feedback_ssrc = params.payload.feedback_ssrc;\n config->rtp_config.payload_type = params.payload.payload_type;\n config->use_external_encoder = false;\n config->width = params.payload.width;\n config->height = params.payload.height;\n config->min_bitrate = config->start_bitrate = params.payload.min_bitrate;\n config->max_bitrate = params.payload.max_bitrate;\n if (params.payload.codec_name == kCodecNameVp8)\n config->codec = media::cast::transport::kVp8;\n else\n return false;\n return true;\n}\n\n} \/\/ namespace\n\n\/\/ This class receives MediaStreamTrack events and video frames from a\n\/\/ MediaStreamTrack. Video frames are submitted to media::cast::FrameInput.\n\/\/\n\/\/ Threading: Video frames are received on the render thread.\nclass CastVideoSink : public base::SupportsWeakPtr<CastVideoSink>,\n public content::MediaStreamVideoSink {\n public:\n \/\/ |track| provides data for this sink.\n \/\/ |error_callback| is called if video formats don't match.\n CastVideoSink(const blink::WebMediaStreamTrack& track,\n const CastRtpStream::ErrorCallback& error_callback)\n : track_(track),\n sink_added_(false),\n error_callback_(error_callback) {}\n\n virtual ~CastVideoSink() {\n if (sink_added_)\n RemoveFromVideoTrack(this, track_);\n }\n\n \/\/ content::MediaStreamVideoSink implementation.\n virtual void OnVideoFrame(const scoped_refptr<media::VideoFrame>& frame)\n OVERRIDE {\n DCHECK(frame_input_);\n \/\/ TODO(hclam): Pass in the accurate capture time to have good\n \/\/ audio\/video sync.\n frame_input_->InsertRawVideoFrame(frame, base::TimeTicks::Now());\n }\n\n \/\/ Attach this sink to a video track represented by |track_|.\n \/\/ Data received from the track will be submitted to |frame_input|.\n void AddToTrack(\n const scoped_refptr<media::cast::VideoFrameInput>& frame_input) {\n DCHECK(!sink_added_);\n sink_added_ = true;\n\n frame_input_ = frame_input;\n AddToVideoTrack(this, track_);\n }\n\n private:\n blink::WebMediaStreamTrack track_;\n scoped_refptr<media::cast::VideoFrameInput> frame_input_;\n bool sink_added_;\n CastRtpStream::ErrorCallback error_callback_;\n\n DISALLOW_COPY_AND_ASSIGN(CastVideoSink);\n};\n\n\/\/ Receives audio data from a MediaStreamTrack. Data is submitted to\n\/\/ media::cast::FrameInput.\n\/\/\n\/\/ Threading: Audio frames are received on the real-time audio thread.\nclass CastAudioSink : public base::SupportsWeakPtr<CastAudioSink>,\n public content::MediaStreamAudioSink {\n public:\n \/\/ |track| provides data for this sink.\n \/\/ |error_callback| is called if audio formats don't match.\n CastAudioSink(const blink::WebMediaStreamTrack& track,\n const CastRtpStream::ErrorCallback& error_callback,\n int output_channels,\n int output_sample_rate)\n : track_(track),\n sink_added_(false),\n error_callback_(error_callback),\n weak_factory_(this),\n input_preroll_(0),\n output_channels_(output_channels),\n output_sample_rate_(output_sample_rate) {}\n\n virtual ~CastAudioSink() {\n if (sink_added_)\n RemoveFromAudioTrack(this, track_);\n }\n\n \/\/ Called on real-time audio thread.\n \/\/ content::MediaStreamAudioSink implementation.\n virtual void OnData(const int16* audio_data,\n int sample_rate,\n int number_of_channels,\n int number_of_frames) OVERRIDE {\n scoped_ptr<media::AudioBus> input_bus;\n if (resampler_) {\n input_bus = ResampleData(\n audio_data, sample_rate, number_of_channels, number_of_frames);\n if (!input_bus)\n return;\n } else {\n input_bus = media::AudioBus::Create(\n number_of_channels, number_of_frames);\n input_bus->FromInterleaved(\n audio_data, number_of_frames, number_of_channels);\n }\n\n \/\/ TODO(hclam): Pass in the accurate capture time to have good\n \/\/ audio \/ video sync.\n frame_input_->InsertAudio(input_bus.Pass(), base::TimeTicks::Now());\n }\n\n \/\/ Return a resampled audio data from input. This is called when the\n \/\/ input sample rate doesn't match the output.\n \/\/ The flow of data is as follows:\n \/\/ |audio_data| ->\n \/\/ AudioFifo |fifo_| ->\n \/\/ MultiChannelResampler |resampler|.\n \/\/\n \/\/ The resampler pulls data out of the FIFO and resample the data in\n \/\/ frequency domain. It might call |fifo_| for more than once. But no more\n \/\/ than |kBufferAudioData| times. We preroll audio data into the FIFO to\n \/\/ make sure there's enough data for resampling.\n scoped_ptr<media::AudioBus> ResampleData(\n const int16* audio_data,\n int sample_rate,\n int number_of_channels,\n int number_of_frames) {\n DCHECK_EQ(number_of_channels, output_channels_);\n fifo_input_bus_->FromInterleaved(\n audio_data, number_of_frames, number_of_channels);\n fifo_->Push(fifo_input_bus_.get());\n\n if (input_preroll_ < kBufferAudioData - 1) {\n ++input_preroll_;\n return scoped_ptr<media::AudioBus>();\n }\n\n scoped_ptr<media::AudioBus> output_bus(\n media::AudioBus::Create(\n output_channels_,\n output_sample_rate_ * fifo_input_bus_->frames() \/ sample_rate));\n\n \/\/ Resampler will then call ProvideData() below to fetch data from\n \/\/ |input_data_|.\n resampler_->Resample(output_bus->frames(), output_bus.get());\n return output_bus.Pass();\n }\n\n \/\/ Called on real-time audio thread.\n virtual void OnSetFormat(const media::AudioParameters& params) OVERRIDE {\n if (params.sample_rate() == output_sample_rate_)\n return;\n fifo_.reset(new media::AudioFifo(\n output_channels_,\n kBufferAudioData * params.frames_per_buffer()));\n fifo_input_bus_ = media::AudioBus::Create(\n params.channels(), params.frames_per_buffer());\n resampler_.reset(new media::MultiChannelResampler(\n output_channels_,\n static_cast<double>(params.sample_rate()) \/ output_sample_rate_,\n params.frames_per_buffer(),\n base::Bind(&CastAudioSink::ProvideData, base::Unretained(this))));\n }\n\n \/\/ Add this sink to the track. Data received from the track will be\n \/\/ submitted to |frame_input|.\n void AddToTrack(\n const scoped_refptr<media::cast::AudioFrameInput>& frame_input) {\n DCHECK(!sink_added_);\n sink_added_ = true;\n\n \/\/ This member is written here and then accessed on the IO thread\n \/\/ We will not get data until AddToAudioTrack is called so it is\n \/\/ safe to access this member now.\n frame_input_ = frame_input;\n AddToAudioTrack(this, track_);\n }\n\n void ProvideData(int frame_delay, media::AudioBus* output_bus) {\n fifo_->Consume(output_bus, 0, output_bus->frames());\n }\n\n private:\n blink::WebMediaStreamTrack track_;\n bool sink_added_;\n CastRtpStream::ErrorCallback error_callback_;\n base::WeakPtrFactory<CastAudioSink> weak_factory_;\n\n scoped_ptr<media::MultiChannelResampler> resampler_;\n scoped_ptr<media::AudioFifo> fifo_;\n scoped_ptr<media::AudioBus> fifo_input_bus_;\n int input_preroll_;\n const int output_channels_;\n const int output_sample_rate_;\n\n \/\/ This member is accessed on the real-time audio time.\n scoped_refptr<media::cast::AudioFrameInput> frame_input_;\n\n DISALLOW_COPY_AND_ASSIGN(CastAudioSink);\n};\n\nCastRtpParams::CastRtpParams(const CastRtpPayloadParams& payload_params)\n : payload(payload_params) {}\n\nCastCodecSpecificParams::CastCodecSpecificParams() {}\n\nCastCodecSpecificParams::~CastCodecSpecificParams() {}\n\nCastRtpPayloadParams::CastRtpPayloadParams()\n : payload_type(0),\n ssrc(0),\n feedback_ssrc(0),\n clock_rate(0),\n max_bitrate(0),\n min_bitrate(0),\n channels(0),\n width(0),\n height(0) {}\n\nCastRtpPayloadParams::~CastRtpPayloadParams() {}\n\nCastRtpParams::CastRtpParams() {}\n\nCastRtpParams::~CastRtpParams() {}\n\nCastRtpStream::CastRtpStream(const blink::WebMediaStreamTrack& track,\n const scoped_refptr<CastSession>& session)\n : track_(track), cast_session_(session), weak_factory_(this) {}\n\nCastRtpStream::~CastRtpStream() {}\n\nstd::vector<CastRtpParams> CastRtpStream::GetSupportedParams() {\n if (IsAudio())\n return SupportedAudioParams();\n else\n return SupportedVideoParams();\n}\n\nCastRtpParams CastRtpStream::GetParams() { return params_; }\n\nvoid CastRtpStream::Start(const CastRtpParams& params,\n const base::Closure& start_callback,\n const base::Closure& stop_callback,\n const ErrorCallback& error_callback) {\n stop_callback_ = stop_callback;\n error_callback_ = error_callback;\n\n if (IsAudio()) {\n AudioSenderConfig config;\n if (!ToAudioSenderConfig(params, &config)) {\n DidEncounterError(\"Invalid parameters for audio.\");\n return;\n }\n\n \/\/ In case of error we have to go through DidEncounterError() to stop\n \/\/ the streaming after reporting the error.\n audio_sink_.reset(new CastAudioSink(\n track_,\n media::BindToCurrentLoop(base::Bind(&CastRtpStream::DidEncounterError,\n weak_factory_.GetWeakPtr())),\n params.payload.channels,\n params.payload.clock_rate));\n cast_session_->StartAudio(\n config,\n base::Bind(&CastAudioSink::AddToTrack, audio_sink_->AsWeakPtr()));\n start_callback.Run();\n } else {\n VideoSenderConfig config;\n if (!ToVideoSenderConfig(params, &config)) {\n DidEncounterError(\"Invalid parameters for video.\");\n return;\n }\n \/\/ See the code for audio above for explanation of callbacks.\n video_sink_.reset(new CastVideoSink(\n track_,\n media::BindToCurrentLoop(base::Bind(&CastRtpStream::DidEncounterError,\n weak_factory_.GetWeakPtr()))));\n cast_session_->StartVideo(\n config,\n base::Bind(&CastVideoSink::AddToTrack, video_sink_->AsWeakPtr()));\n start_callback.Run();\n }\n}\n\nvoid CastRtpStream::Stop() {\n audio_sink_.reset();\n video_sink_.reset();\n stop_callback_.Run();\n}\n\nvoid CastRtpStream::ToggleLogging(bool enable) {\n cast_session_->ToggleLogging(IsAudio(), enable);\n}\n\nvoid CastRtpStream::GetRawEvents(\n const base::Callback<void(scoped_ptr<base::BinaryValue>)>& callback) {\n cast_session_->GetEventLogsAndReset(IsAudio(), callback);\n}\n\nvoid CastRtpStream::GetStats(\n const base::Callback<void(scoped_ptr<base::DictionaryValue>)>& callback) {\n cast_session_->GetStatsAndReset(IsAudio(), callback);\n}\n\nbool CastRtpStream::IsAudio() const {\n return track_.source().type() == blink::WebMediaStreamSource::TypeAudio;\n}\n\nvoid CastRtpStream::DidEncounterError(const std::string& message) {\n error_callback_.Run(message);\n Stop();\n}\n<commit_msg>Cast: Use VideoFrame::GetTimestamp() to calculate the timestamp<commit_after>\/\/ Copyright 2013 The Chromium Authors. All rights reserved.\n\/\/ Use of this source code is governed by a BSD-style license that can be\n\/\/ found in the LICENSE file.\n\n#include \"chrome\/renderer\/media\/cast_rtp_stream.h\"\n\n#include \"base\/bind.h\"\n#include \"base\/logging.h\"\n#include \"base\/memory\/weak_ptr.h\"\n#include \"chrome\/renderer\/media\/cast_session.h\"\n#include \"chrome\/renderer\/media\/cast_udp_transport.h\"\n#include \"content\/public\/renderer\/media_stream_audio_sink.h\"\n#include \"content\/public\/renderer\/media_stream_video_sink.h\"\n#include \"media\/audio\/audio_parameters.h\"\n#include \"media\/base\/audio_bus.h\"\n#include \"media\/base\/audio_fifo.h\"\n#include \"media\/base\/bind_to_current_loop.h\"\n#include \"media\/base\/multi_channel_resampler.h\"\n#include \"media\/cast\/cast_config.h\"\n#include \"media\/cast\/cast_defines.h\"\n#include \"media\/cast\/cast_sender.h\"\n#include \"media\/cast\/transport\/cast_transport_config.h\"\n#include \"third_party\/WebKit\/public\/platform\/WebMediaStreamSource.h\"\n\nusing media::cast::AudioSenderConfig;\nusing media::cast::VideoSenderConfig;\n\nnamespace {\n\nconst char kCodecNameOpus[] = \"OPUS\";\nconst char kCodecNameVp8[] = \"VP8\";\n\n\/\/ This constant defines the number of sets of audio data to buffer\n\/\/ in the FIFO. If input audio and output data have different resampling\n\/\/ rates then buffer is necessary to avoid audio glitches.\n\/\/ See CastAudioSink::ResampleData() and CastAudioSink::OnSetFormat()\n\/\/ for more defaults.\nconst int kBufferAudioData = 2;\n\nCastRtpPayloadParams DefaultOpusPayload() {\n CastRtpPayloadParams payload;\n payload.ssrc = 1;\n payload.feedback_ssrc = 1;\n payload.payload_type = 127;\n payload.codec_name = kCodecNameOpus;\n payload.clock_rate = 48000;\n payload.channels = 2;\n payload.min_bitrate = payload.max_bitrate =\n media::cast::kDefaultAudioEncoderBitrate;\n return payload;\n}\n\nCastRtpPayloadParams DefaultVp8Payload() {\n CastRtpPayloadParams payload;\n payload.ssrc = 11;\n payload.feedback_ssrc = 12;\n payload.payload_type = 96;\n payload.codec_name = kCodecNameVp8;\n payload.clock_rate = 90000;\n payload.width = 1280;\n payload.height = 720;\n payload.min_bitrate = 50 * 1000;\n payload.max_bitrate = 2000 * 1000;\n return payload;\n}\n\nstd::vector<CastRtpParams> SupportedAudioParams() {\n \/\/ TODO(hclam): Fill in more codecs here.\n std::vector<CastRtpParams> supported_params;\n supported_params.push_back(CastRtpParams(DefaultOpusPayload()));\n return supported_params;\n}\n\nstd::vector<CastRtpParams> SupportedVideoParams() {\n \/\/ TODO(hclam): Fill in H264 here.\n std::vector<CastRtpParams> supported_params;\n supported_params.push_back(CastRtpParams(DefaultVp8Payload()));\n return supported_params;\n}\n\nbool ToAudioSenderConfig(const CastRtpParams& params,\n AudioSenderConfig* config) {\n config->sender_ssrc = params.payload.ssrc;\n config->incoming_feedback_ssrc = params.payload.feedback_ssrc;\n config->rtp_config.payload_type = params.payload.payload_type;\n config->use_external_encoder = false;\n config->frequency = params.payload.clock_rate;\n config->channels = params.payload.channels;\n config->bitrate = params.payload.max_bitrate;\n config->codec = media::cast::transport::kPcm16;\n if (params.payload.codec_name == kCodecNameOpus)\n config->codec = media::cast::transport::kOpus;\n else\n return false;\n return true;\n}\n\nbool ToVideoSenderConfig(const CastRtpParams& params,\n VideoSenderConfig* config) {\n config->sender_ssrc = params.payload.ssrc;\n config->incoming_feedback_ssrc = params.payload.feedback_ssrc;\n config->rtp_config.payload_type = params.payload.payload_type;\n config->use_external_encoder = false;\n config->width = params.payload.width;\n config->height = params.payload.height;\n config->min_bitrate = config->start_bitrate = params.payload.min_bitrate;\n config->max_bitrate = params.payload.max_bitrate;\n if (params.payload.codec_name == kCodecNameVp8)\n config->codec = media::cast::transport::kVp8;\n else\n return false;\n return true;\n}\n\n} \/\/ namespace\n\n\/\/ This class receives MediaStreamTrack events and video frames from a\n\/\/ MediaStreamTrack. Video frames are submitted to media::cast::FrameInput.\n\/\/\n\/\/ Threading: Video frames are received on the render thread.\nclass CastVideoSink : public base::SupportsWeakPtr<CastVideoSink>,\n public content::MediaStreamVideoSink {\n public:\n \/\/ |track| provides data for this sink.\n \/\/ |error_callback| is called if video formats don't match.\n CastVideoSink(const blink::WebMediaStreamTrack& track,\n const CastRtpStream::ErrorCallback& error_callback)\n : track_(track),\n sink_added_(false),\n error_callback_(error_callback) {}\n\n virtual ~CastVideoSink() {\n if (sink_added_)\n RemoveFromVideoTrack(this, track_);\n }\n\n \/\/ content::MediaStreamVideoSink implementation.\n virtual void OnVideoFrame(const scoped_refptr<media::VideoFrame>& frame)\n OVERRIDE {\n DCHECK(frame_input_);\n\n \/\/ Capture time is calculated using the time when the first frame\n \/\/ is delivered. Doing so has less jitter because each frame has\n \/\/ a TimeDelta from the first frame. However there is a delay between\n \/\/ capture and delivery here for the first frame. We do not account\n \/\/ for this delay.\n if (first_frame_timestamp_.is_null())\n first_frame_timestamp_ = base::TimeTicks::Now();\n frame_input_->InsertRawVideoFrame(\n frame, first_frame_timestamp_ + frame->GetTimestamp());\n }\n\n \/\/ Attach this sink to a video track represented by |track_|.\n \/\/ Data received from the track will be submitted to |frame_input|.\n void AddToTrack(\n const scoped_refptr<media::cast::VideoFrameInput>& frame_input) {\n DCHECK(!sink_added_);\n sink_added_ = true;\n\n frame_input_ = frame_input;\n AddToVideoTrack(this, track_);\n }\n\n private:\n blink::WebMediaStreamTrack track_;\n scoped_refptr<media::cast::VideoFrameInput> frame_input_;\n bool sink_added_;\n CastRtpStream::ErrorCallback error_callback_;\n base::TimeTicks first_frame_timestamp_;\n\n DISALLOW_COPY_AND_ASSIGN(CastVideoSink);\n};\n\n\/\/ Receives audio data from a MediaStreamTrack. Data is submitted to\n\/\/ media::cast::FrameInput.\n\/\/\n\/\/ Threading: Audio frames are received on the real-time audio thread.\nclass CastAudioSink : public base::SupportsWeakPtr<CastAudioSink>,\n public content::MediaStreamAudioSink {\n public:\n \/\/ |track| provides data for this sink.\n \/\/ |error_callback| is called if audio formats don't match.\n CastAudioSink(const blink::WebMediaStreamTrack& track,\n const CastRtpStream::ErrorCallback& error_callback,\n int output_channels,\n int output_sample_rate)\n : track_(track),\n sink_added_(false),\n error_callback_(error_callback),\n weak_factory_(this),\n input_preroll_(0),\n output_channels_(output_channels),\n output_sample_rate_(output_sample_rate) {}\n\n virtual ~CastAudioSink() {\n if (sink_added_)\n RemoveFromAudioTrack(this, track_);\n }\n\n \/\/ Called on real-time audio thread.\n \/\/ content::MediaStreamAudioSink implementation.\n virtual void OnData(const int16* audio_data,\n int sample_rate,\n int number_of_channels,\n int number_of_frames) OVERRIDE {\n scoped_ptr<media::AudioBus> input_bus;\n if (resampler_) {\n input_bus = ResampleData(\n audio_data, sample_rate, number_of_channels, number_of_frames);\n if (!input_bus)\n return;\n } else {\n input_bus = media::AudioBus::Create(\n number_of_channels, number_of_frames);\n input_bus->FromInterleaved(\n audio_data, number_of_frames, number_of_channels);\n }\n\n \/\/ TODO(hclam): Pass in the accurate capture time to have good\n \/\/ audio \/ video sync.\n frame_input_->InsertAudio(input_bus.Pass(), base::TimeTicks::Now());\n }\n\n \/\/ Return a resampled audio data from input. This is called when the\n \/\/ input sample rate doesn't match the output.\n \/\/ The flow of data is as follows:\n \/\/ |audio_data| ->\n \/\/ AudioFifo |fifo_| ->\n \/\/ MultiChannelResampler |resampler|.\n \/\/\n \/\/ The resampler pulls data out of the FIFO and resample the data in\n \/\/ frequency domain. It might call |fifo_| for more than once. But no more\n \/\/ than |kBufferAudioData| times. We preroll audio data into the FIFO to\n \/\/ make sure there's enough data for resampling.\n scoped_ptr<media::AudioBus> ResampleData(\n const int16* audio_data,\n int sample_rate,\n int number_of_channels,\n int number_of_frames) {\n DCHECK_EQ(number_of_channels, output_channels_);\n fifo_input_bus_->FromInterleaved(\n audio_data, number_of_frames, number_of_channels);\n fifo_->Push(fifo_input_bus_.get());\n\n if (input_preroll_ < kBufferAudioData - 1) {\n ++input_preroll_;\n return scoped_ptr<media::AudioBus>();\n }\n\n scoped_ptr<media::AudioBus> output_bus(\n media::AudioBus::Create(\n output_channels_,\n output_sample_rate_ * fifo_input_bus_->frames() \/ sample_rate));\n\n \/\/ Resampler will then call ProvideData() below to fetch data from\n \/\/ |input_data_|.\n resampler_->Resample(output_bus->frames(), output_bus.get());\n return output_bus.Pass();\n }\n\n \/\/ Called on real-time audio thread.\n virtual void OnSetFormat(const media::AudioParameters& params) OVERRIDE {\n if (params.sample_rate() == output_sample_rate_)\n return;\n fifo_.reset(new media::AudioFifo(\n output_channels_,\n kBufferAudioData * params.frames_per_buffer()));\n fifo_input_bus_ = media::AudioBus::Create(\n params.channels(), params.frames_per_buffer());\n resampler_.reset(new media::MultiChannelResampler(\n output_channels_,\n static_cast<double>(params.sample_rate()) \/ output_sample_rate_,\n params.frames_per_buffer(),\n base::Bind(&CastAudioSink::ProvideData, base::Unretained(this))));\n }\n\n \/\/ Add this sink to the track. Data received from the track will be\n \/\/ submitted to |frame_input|.\n void AddToTrack(\n const scoped_refptr<media::cast::AudioFrameInput>& frame_input) {\n DCHECK(!sink_added_);\n sink_added_ = true;\n\n \/\/ This member is written here and then accessed on the IO thread\n \/\/ We will not get data until AddToAudioTrack is called so it is\n \/\/ safe to access this member now.\n frame_input_ = frame_input;\n AddToAudioTrack(this, track_);\n }\n\n void ProvideData(int frame_delay, media::AudioBus* output_bus) {\n fifo_->Consume(output_bus, 0, output_bus->frames());\n }\n\n private:\n blink::WebMediaStreamTrack track_;\n bool sink_added_;\n CastRtpStream::ErrorCallback error_callback_;\n base::WeakPtrFactory<CastAudioSink> weak_factory_;\n\n scoped_ptr<media::MultiChannelResampler> resampler_;\n scoped_ptr<media::AudioFifo> fifo_;\n scoped_ptr<media::AudioBus> fifo_input_bus_;\n int input_preroll_;\n const int output_channels_;\n const int output_sample_rate_;\n\n \/\/ This member is accessed on the real-time audio time.\n scoped_refptr<media::cast::AudioFrameInput> frame_input_;\n\n DISALLOW_COPY_AND_ASSIGN(CastAudioSink);\n};\n\nCastRtpParams::CastRtpParams(const CastRtpPayloadParams& payload_params)\n : payload(payload_params) {}\n\nCastCodecSpecificParams::CastCodecSpecificParams() {}\n\nCastCodecSpecificParams::~CastCodecSpecificParams() {}\n\nCastRtpPayloadParams::CastRtpPayloadParams()\n : payload_type(0),\n ssrc(0),\n feedback_ssrc(0),\n clock_rate(0),\n max_bitrate(0),\n min_bitrate(0),\n channels(0),\n width(0),\n height(0) {}\n\nCastRtpPayloadParams::~CastRtpPayloadParams() {}\n\nCastRtpParams::CastRtpParams() {}\n\nCastRtpParams::~CastRtpParams() {}\n\nCastRtpStream::CastRtpStream(const blink::WebMediaStreamTrack& track,\n const scoped_refptr<CastSession>& session)\n : track_(track), cast_session_(session), weak_factory_(this) {}\n\nCastRtpStream::~CastRtpStream() {}\n\nstd::vector<CastRtpParams> CastRtpStream::GetSupportedParams() {\n if (IsAudio())\n return SupportedAudioParams();\n else\n return SupportedVideoParams();\n}\n\nCastRtpParams CastRtpStream::GetParams() { return params_; }\n\nvoid CastRtpStream::Start(const CastRtpParams& params,\n const base::Closure& start_callback,\n const base::Closure& stop_callback,\n const ErrorCallback& error_callback) {\n stop_callback_ = stop_callback;\n error_callback_ = error_callback;\n\n if (IsAudio()) {\n AudioSenderConfig config;\n if (!ToAudioSenderConfig(params, &config)) {\n DidEncounterError(\"Invalid parameters for audio.\");\n return;\n }\n\n \/\/ In case of error we have to go through DidEncounterError() to stop\n \/\/ the streaming after reporting the error.\n audio_sink_.reset(new CastAudioSink(\n track_,\n media::BindToCurrentLoop(base::Bind(&CastRtpStream::DidEncounterError,\n weak_factory_.GetWeakPtr())),\n params.payload.channels,\n params.payload.clock_rate));\n cast_session_->StartAudio(\n config,\n base::Bind(&CastAudioSink::AddToTrack, audio_sink_->AsWeakPtr()));\n start_callback.Run();\n } else {\n VideoSenderConfig config;\n if (!ToVideoSenderConfig(params, &config)) {\n DidEncounterError(\"Invalid parameters for video.\");\n return;\n }\n \/\/ See the code for audio above for explanation of callbacks.\n video_sink_.reset(new CastVideoSink(\n track_,\n media::BindToCurrentLoop(base::Bind(&CastRtpStream::DidEncounterError,\n weak_factory_.GetWeakPtr()))));\n cast_session_->StartVideo(\n config,\n base::Bind(&CastVideoSink::AddToTrack, video_sink_->AsWeakPtr()));\n start_callback.Run();\n }\n}\n\nvoid CastRtpStream::Stop() {\n audio_sink_.reset();\n video_sink_.reset();\n stop_callback_.Run();\n}\n\nvoid CastRtpStream::ToggleLogging(bool enable) {\n cast_session_->ToggleLogging(IsAudio(), enable);\n}\n\nvoid CastRtpStream::GetRawEvents(\n const base::Callback<void(scoped_ptr<base::BinaryValue>)>& callback) {\n cast_session_->GetEventLogsAndReset(IsAudio(), callback);\n}\n\nvoid CastRtpStream::GetStats(\n const base::Callback<void(scoped_ptr<base::DictionaryValue>)>& callback) {\n cast_session_->GetStatsAndReset(IsAudio(), callback);\n}\n\nbool CastRtpStream::IsAudio() const {\n return track_.source().type() == blink::WebMediaStreamSource::TypeAudio;\n}\n\nvoid CastRtpStream::DidEncounterError(const std::string& message) {\n error_callback_.Run(message);\n Stop();\n}\n<|endoftext|>"} {"text":"<commit_before>\/*\n * This program is free software; you can redistribute it and\/or modify it under\n * the terms of the GNU General Public License as published by the Free Software\n * Foundation; version 3 of the License.\n *\n * This program is distributed in the hope that it will be useful, but WITHOUT\n * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS\n * FOR A PARTICULAR PURPOSE. See the GNU General Public License for more\n * details.\n *\/\n\n\n#include <QtSql>\n\n#include \"..\/dbmanager.h\"\n#include \"querytextedit.h\"\n\n#include \"..\/config.h\"\n\nQueryTextEdit::QueryTextEdit(QWidget *parent)\n : QTextEdit(parent)\n{\n syntax = new SqlHighlighter(this);\n\n setupCompleter();\n\n setFont(Config::editorFont);\n setFontPointSize(Config::editorFont.pointSize());\n\/\/ setOpenExternalLinks(true);\n\/\/ setOpenLinks(true);\n\/\/ setReadOnly(false);\n}\n\nvoid QueryTextEdit::cleanTables()\n{\n\n}\n\nvoid QueryTextEdit::focusInEvent(QFocusEvent *e)\n{\n completer->setWidget(this);\n QTextEdit::focusInEvent(e);\n}\n\nvoid QueryTextEdit::keyPressEvent(QKeyEvent *event)\n{\n if(Config::compCharCount == -1)\n return;\n\n \/\/ If the completer is actually shown, it handles some keys\n if(completer->popup()->isVisible())\n {\n switch(event->key())\n {\n case Qt::Key_Enter:\n case Qt::Key_Return:\n case Qt::Key_Escape:\n case Qt::Key_Tab:\n case Qt::Key_Backtab:\n event->ignore();\n return;\n default:\n break;\n }\n }\n\n\/\/ if(event->modifiers() == Qt::ControlModifier && event->key() == Qt::Key_Control)\n\/\/ {\n\/\/ scanTables();\n\/\/ return;\n\/\/ }\n\n \/\/ the shortcut to pop up the completer\n bool isShortcut = ((event->modifiers() & Qt::ControlModifier)\n && event->key() == Qt::Key_Space);\n if(!isShortcut)\n {\n\/\/ QString prevLine = \"\";\n\/\/ if(event->key() == Qt::Key_Enter || event->key() == Qt::Key_Return)\n\/\/ {\n\/\/ QTextCursor cursor = textCursor();\n\/\/ if(cursor.movePosition(QTextCursor::Up))\n\/\/ {\n\/\/ cursor.select(QTextCursor::LineUnderCursor);\n\/\/ prevLine = textCursor().selectedText();\n\/\/ }\n\/\/ }\n\n QTextEdit::keyPressEvent(event);\n\/\/ if(!prevLine.isEmpty())\n\/\/ for(int i=0; prevLine.at(i) == QChar(' '); i++)\n\/\/ insertPlainText(\" \");\n }\n\n QString completionPrefix = textUnderCursor();\n if(event->key() == Qt::Key_Backspace && !completionPrefix.isEmpty()\n && !completionPrefix.right(1).at(0).isLetterOrNumber())\n {\n completer->popup()->hide();\n event->accept();\n return;\n }\n\n bool ctrlOrShift = event->modifiers() &\n (Qt::ControlModifier | Qt::ShiftModifier);\n\n \/\/ if the user just pressed Control or Shift (nothing else)\n if(ctrlOrShift && event->text().isEmpty())\n return;\n\n bool hasModifier = (event->modifiers() != Qt::NoModifier) && !ctrlOrShift;\n\n \/\/ if lastChar is not a letter, the popup will not be shown\n QChar lastChar;\n if(!completionPrefix.isEmpty())\n lastChar = completionPrefix.right(1).at(0);\n\n bool followsTable = false;\n if(lastChar == '.')\n {\n QString table = completionPrefix.left(completionPrefix.length()-1);\n followsTable = tables.contains(table);\n }\n\n if(!isShortcut && ((!lastChar.isLetterOrNumber() && !followsTable) ||\n hasModifier ||\n event->text().isEmpty() ||\n completionPrefix.length() < Config::compCharCount))\n {\n completer->popup()->hide();\n return;\n }\n\n if(completionPrefix != completer->completionPrefix())\n {\n completer->setCompletionPrefix(completionPrefix);\n completer->popup()->setCurrentIndex(\n completer->completionModel()->index(0,0));\n }\n\n QRect cr = cursorRect();\n cr.setWidth(completer->popup()->sizeHintForColumn(0) +\n completer->popup()->verticalScrollBar()->width());\n\n completer->complete(cr);\n}\n\nvoid QueryTextEdit::insertCompletion(QString text)\n{\n if(completer->widget() != this)\n return;\n\n QTextCursor tc = textCursor();\n tc.select(QTextCursor::WordUnderCursor);\n tc.removeSelectedText();\n tc.insertHtml(text);\n}\n\nvoid QueryTextEdit::insertFromMimeData(const QMimeData *source) {\n QTextEdit::insertPlainText(source->text());\n}\n\nvoid QueryTextEdit::reloadCompleter()\n{\n SqlHighlighter::reloadKeywords();\n}\n\nvoid QueryTextEdit::reloadContext(QStringList tables,\n QMultiMap<QString, QString> fields)\n{\n if(!Config::editorSemantic)\n return;\n\n this->tables = tables;\n\n \/\/ The syntax highlighting must reload the context too\n syntax->reloadContext(tables, fields);\n\n \/\/ collects all items to show\n QStringList items = tables;\n items << fields.values();\n\n items << SqlHighlighter::sqlFunctionList();\n items << SqlHighlighter::sqlKeywordList();\n items << SqlHighlighter::sqlTypeList();\n\n \/\/ cleaning and sorting\n#if QT_VERSION >= 0x040500\n items.removeDuplicates();\n#endif\n\n QMap<QString, QString> m;\n foreach(QString i, items)\n m.insert(i.toLower(), i);\n\n items = m.values();\n completerContextModel->setStringList(items);\n completer->setModel(completerContextModel);\n}\n\n\/**\n * Replaces all tables by links\n *\/\nvoid QueryTextEdit::scanTables()\n{\n QString newstr;\n int pos = 0;\n QString text = toHtml();\n QTextCursor tc;\n foreach(QString table, tables)\n {\n pos = text.indexOf(table);\n while(pos != -1)\n {\n tc = textCursor();\n tc.setPosition(pos+1);\n tc.select(QTextCursor::WordUnderCursor);\n newstr = QString(\"<a href=\\\"table:\/\/%1\\\">%1<\/a>\").arg(table);\n tc.removeSelectedText();\n tc.insertHtml(newstr);\n text = toPlainText();\n pos += newstr.size();\n }\n }\n}\n\nvoid QueryTextEdit::setupCompleter()\n{\n completer = new QCompleter(this);\n completer->setCaseSensitivity(Qt::CaseInsensitive);\n completer->setWrapAround(false);\n completer->setWidget(this);\n completer->setCompletionMode(QCompleter::PopupCompletion);\n\n connect(completer, SIGNAL(activated(QString)),\n this, SLOT(insertCompletion(QString)));\n\n QStringList items;\n items << SqlHighlighter::sqlKeywordList()\n << SqlHighlighter::sqlFunctionList()\n << SqlHighlighter::sqlTypeList();\n completerContextModel = new QStringListModel(items, this);\n completer->setModel(completerContextModel);\n\n reloadContext(QStringList(), QMultiMap<QString, QString>());\n}\n\nQString QueryTextEdit::textUnderCursor() const\n{\n QTextCursor tc = textCursor();\n tc.select( QTextCursor::WordUnderCursor );\n return tc.selectedText();\n}\n<commit_msg>Fiabilisation auto-complément<commit_after>\/*\n * This program is free software; you can redistribute it and\/or modify it under\n * the terms of the GNU General Public License as published by the Free Software\n * Foundation; version 3 of the License.\n *\n * This program is distributed in the hope that it will be useful, but WITHOUT\n * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS\n * FOR A PARTICULAR PURPOSE. See the GNU General Public License for more\n * details.\n *\/\n\n\n#include <QtSql>\n\n#include \"..\/dbmanager.h\"\n#include \"querytextedit.h\"\n\n#include \"..\/config.h\"\n\nQueryTextEdit::QueryTextEdit(QWidget *parent)\n : QTextEdit(parent)\n{\n syntax = new SqlHighlighter(this);\n\n setupCompleter();\n\n setFont(Config::editorFont);\n setFontPointSize(Config::editorFont.pointSize());\n\/\/ setOpenExternalLinks(true);\n\/\/ setOpenLinks(true);\n\/\/ setReadOnly(false);\n}\n\nvoid QueryTextEdit::cleanTables()\n{\n\n}\n\nvoid QueryTextEdit::focusInEvent(QFocusEvent *e)\n{\n completer->setWidget(this);\n QTextEdit::focusInEvent(e);\n}\n\nvoid QueryTextEdit::keyPressEvent(QKeyEvent *event)\n{\n if(Config::compCharCount == -1)\n return;\n\n \/\/ If the completer is actually shown, it handles some keys\n if(completer->popup()->isVisible())\n {\n switch(event->key())\n {\n case Qt::Key_Enter:\n case Qt::Key_Return:\n case Qt::Key_Escape:\n case Qt::Key_Tab:\n case Qt::Key_Backtab:\n event->ignore();\n return;\n default:\n break;\n }\n }\n\n\/\/ if(event->modifiers() == Qt::ControlModifier && event->key() == Qt::Key_Control)\n\/\/ {\n\/\/ scanTables();\n\/\/ return;\n\/\/ }\n\n \/\/ the shortcut to pop up the completer\n bool isShortcut = ((event->modifiers() & Qt::ControlModifier)\n && event->key() == Qt::Key_Space);\n if(!isShortcut)\n {\n\/\/ QString prevLine = \"\";\n\/\/ if(event->key() == Qt::Key_Enter || event->key() == Qt::Key_Return)\n\/\/ {\n\/\/ QTextCursor cursor = textCursor();\n\/\/ if(cursor.movePosition(QTextCursor::Up))\n\/\/ {\n\/\/ cursor.select(QTextCursor::LineUnderCursor);\n\/\/ prevLine = textCursor().selectedText();\n\/\/ }\n\/\/ }\n\n QTextEdit::keyPressEvent(event);\n\/\/ if(!prevLine.isEmpty())\n\/\/ for(int i=0; prevLine.at(i) == QChar(' '); i++)\n\/\/ insertPlainText(\" \");\n }\n\n QString completionPrefix = textUnderCursor();\n if (event->key() == Qt::Key_Backspace && completer->popup()->isHidden()) {\n completer->popup()->hide();\n event->accept();\n return;\n }\n\n bool ctrlOrShift = event->modifiers() &\n (Qt::ControlModifier | Qt::ShiftModifier);\n\n \/\/ if the user just pressed Control or Shift (nothing else)\n if(ctrlOrShift && event->text().isEmpty())\n return;\n\n bool hasModifier = (event->modifiers() != Qt::NoModifier) && !ctrlOrShift;\n\n \/\/ if lastChar is not a letter, the popup will not be shown\n QChar lastChar;\n if(!completionPrefix.isEmpty())\n lastChar = completionPrefix.right(1).at(0);\n\n bool followsTable = false;\n if(lastChar == '.')\n {\n QString table = completionPrefix.left(completionPrefix.length()-1);\n followsTable = tables.contains(table);\n }\n\n if(!isShortcut && ((!lastChar.isLetterOrNumber() && !followsTable) ||\n hasModifier ||\n event->text().isEmpty() ||\n completionPrefix.length() < Config::compCharCount))\n {\n completer->popup()->hide();\n return;\n }\n\n if(completionPrefix != completer->completionPrefix())\n {\n completer->setCompletionPrefix(completionPrefix);\n completer->popup()->setCurrentIndex(\n completer->completionModel()->index(0,0));\n }\n\n QRect cr = cursorRect();\n cr.setWidth(completer->popup()->sizeHintForColumn(0) +\n completer->popup()->verticalScrollBar()->width());\n\n completer->complete(cr);\n}\n\nvoid QueryTextEdit::insertCompletion(QString text)\n{\n if(completer->widget() != this)\n return;\n\n QTextCursor tc = textCursor();\n tc.select(QTextCursor::WordUnderCursor);\n tc.removeSelectedText();\n tc.insertHtml(text);\n}\n\nvoid QueryTextEdit::insertFromMimeData(const QMimeData *source) {\n QTextEdit::insertPlainText(source->text());\n}\n\nvoid QueryTextEdit::reloadCompleter()\n{\n SqlHighlighter::reloadKeywords();\n}\n\nvoid QueryTextEdit::reloadContext(QStringList tables,\n QMultiMap<QString, QString> fields)\n{\n if(!Config::editorSemantic)\n return;\n\n this->tables = tables;\n\n \/\/ The syntax highlighting must reload the context too\n syntax->reloadContext(tables, fields);\n\n \/\/ collects all items to show\n QStringList items = tables;\n items << fields.values();\n\n items << SqlHighlighter::sqlFunctionList();\n items << SqlHighlighter::sqlKeywordList();\n items << SqlHighlighter::sqlTypeList();\n\n \/\/ cleaning and sorting\n#if QT_VERSION >= 0x040500\n items.removeDuplicates();\n#endif\n\n QMap<QString, QString> m;\n foreach(QString i, items)\n m.insert(i.toLower(), i);\n\n items = m.values();\n completerContextModel->setStringList(items);\n completer->setModel(completerContextModel);\n}\n\n\/**\n * Replaces all tables by links\n *\/\nvoid QueryTextEdit::scanTables()\n{\n QString newstr;\n int pos = 0;\n QString text = toHtml();\n QTextCursor tc;\n foreach(QString table, tables)\n {\n pos = text.indexOf(table);\n while(pos != -1)\n {\n tc = textCursor();\n tc.setPosition(pos+1);\n tc.select(QTextCursor::WordUnderCursor);\n newstr = QString(\"<a href=\\\"table:\/\/%1\\\">%1<\/a>\").arg(table);\n tc.removeSelectedText();\n tc.insertHtml(newstr);\n text = toPlainText();\n pos += newstr.size();\n }\n }\n}\n\nvoid QueryTextEdit::setupCompleter()\n{\n completer = new QCompleter(this);\n completer->setCaseSensitivity(Qt::CaseInsensitive);\n completer->setWrapAround(false);\n completer->setWidget(this);\n completer->setCompletionMode(QCompleter::PopupCompletion);\n\n connect(completer, SIGNAL(activated(QString)),\n this, SLOT(insertCompletion(QString)));\n\n QStringList items;\n items << SqlHighlighter::sqlKeywordList()\n << SqlHighlighter::sqlFunctionList()\n << SqlHighlighter::sqlTypeList();\n completerContextModel = new QStringListModel(items, this);\n completer->setModel(completerContextModel);\n\n reloadContext(QStringList(), QMultiMap<QString, QString>());\n}\n\nQString QueryTextEdit::textUnderCursor() const\n{\n QTextCursor tc = textCursor();\n tc.select( QTextCursor::WordUnderCursor );\n return tc.selectedText();\n}\n<|endoftext|>"} {"text":"<commit_before>#include \"writer\/verilog\/ticker.h\"\n\n#include \"iroha\/i_design.h\"\n#include \"writer\/module_template.h\"\n#include \"writer\/verilog\/state.h\"\n#include \"writer\/verilog\/table.h\"\n#include \"writer\/verilog\/module.h\"\n\nnamespace iroha {\nnamespace writer {\nnamespace verilog {\n\nTicker::Ticker(const IResource &res, const Table &table)\n : Resource(res, table) {\n}\n\nvoid Ticker::BuildResource() {\n string n = TickerName();\n ostream &rs = tab_.ResourceSectionStream();\n rs << \" reg [31:0] \" << n << \";\\n\";\n ostream &is = tab_.InitialValueSectionStream();\n is << \" \" << n << \" <= 0;\\n\";\n ostream &ss = tab_.StateOutputSectionStream();\n ss << \" \" << n << \" <= \" << n << \" + 1;\\n\";\n}\n\nvoid Ticker::BuildInsn(IInsn *insn, State *st) {\n ostream &os = st->StateBodySectionStream();\n string n = TickerName();\n os << \" $display(\\\"ticker:%d\\\", \" << n << \");\\n\";\n}\n\nstring Ticker::TickerName() {\n return \"ticker_\" + Util::Itoa(res_.GetTable()->GetId()) + \"_\" +\n Util::Itoa(res_.GetId());\n}\n\n} \/\/ namespace verilog\n} \/\/ namespace writer\n} \/\/ namespace iroha\n<commit_msg>ticker to generate an output value.<commit_after>#include \"writer\/verilog\/ticker.h\"\n\n#include \"iroha\/i_design.h\"\n#include \"writer\/module_template.h\"\n#include \"writer\/verilog\/insn_writer.h\"\n#include \"writer\/verilog\/state.h\"\n#include \"writer\/verilog\/table.h\"\n#include \"writer\/verilog\/module.h\"\n\nnamespace iroha {\nnamespace writer {\nnamespace verilog {\n\nTicker::Ticker(const IResource &res, const Table &table)\n : Resource(res, table) {\n}\n\nvoid Ticker::BuildResource() {\n string n = TickerName();\n ostream &rs = tab_.ResourceSectionStream();\n rs << \" reg [31:0] \" << n << \";\\n\";\n ostream &is = tab_.InitialValueSectionStream();\n is << \" \" << n << \" <= 0;\\n\";\n ostream &ss = tab_.StateOutputSectionStream();\n ss << \" \" << n << \" <= \" << n << \" + 1;\\n\";\n}\n\nvoid Ticker::BuildInsn(IInsn *insn, State *st) {\n string n = TickerName();\n if (insn->outputs_.size() > 0) {\n ostream &ws = tab_.InsnWireValueSectionStream();\n ws << \" assign \" << InsnWriter::InsnOutputWireName(*insn, 0)\n << \" = \" << n << \";\\n\";\n } else {\n ostream &os = st->StateBodySectionStream();\n os << \" $display(\\\"ticker:%d\\\", \" << n << \");\\n\";\n }\n}\n\nstring Ticker::TickerName() {\n return \"ticker_\" + Util::Itoa(res_.GetTable()->GetId()) + \"_\" +\n Util::Itoa(res_.GetId());\n}\n\n} \/\/ namespace verilog\n} \/\/ namespace writer\n} \/\/ namespace iroha\n<|endoftext|>"} {"text":"<commit_before>#include <GL\/glut.h>\n\nvoid init()\n{\n glClearColor(0.0, 0.0, 0.0, 1.0);\n glColor3f(1.0, 1.0, 1.0);\n\n glMatrixMode(GL_PROJECTION);\n glLoadIdentity();\n glOrtho(-1.0, 1.0, -1.0, 1.0, -1.0, 1.0);\n}\n\nvoid myDisplay()\n{\n glClear(GL_COLOR_BUFFER_BIT);\n glBegin(GL_POLYGON);\n glColor3f(1.0, 0.0, 0.0);\n glVertex2f(-0.5, -0.5);\n\n glColor3f(0.0, 1.0, 0.0);\n glVertex2f(-0.5, 0.5);\n\n glColor3f(0.0, 0.0, 1.0);\n glVertex2f(0.5, 0.5);\n\n glColor3f(1.0, 1.0, 0.0);\n glVertex2f(0.5, -0.5);\n glEnd();\n glFlush();\n}\n\nint main(int argc, char** argv)\n{\n glutInit(&argc, argv);\n glutInitDisplayMode(GLUT_SINGLE|GLUT_RGB);\n glutInitWindowSize(500, 500);\n glutInitWindowPosition(0,0);\n glutCreateWindow(\"Homework 1\");\n\n glutDisplayFunc(myDisplay);\n\n init();\n\n glutMainLoop();\n}\n<commit_msg>Added 4 squares in corners with colors specified in homework.<commit_after>#include <GL\/glut.h>\n\nvoid init()\n{\n glClearColor(0.0, 0.0, 0.0, 1.0);\n glColor3f(1.0, 1.0, 1.0);\n\n glMatrixMode(GL_PROJECTION);\n glLoadIdentity();\n glOrtho(-1.0, 1.0, -1.0, 1.0, -1.0, 1.0);\n}\n\n\/\/rainbow square\nvoid bottomLeftPolygon()\n{\n glViewport(0, 0, 250, 250);\n\n glBegin(GL_POLYGON);\n glColor3f(1.0, 0.0, 0.0);\n glVertex2f(-0.5, -0.5);\n\n glColor3f(0.0, 1.0, 0.0);\n glVertex2f(-0.5, 0.5);\n\n glColor3f(0.0, 0.0, 1.0);\n glVertex2f(0.5, 0.5);\n\n glColor3f(1.0, 1.0, 0.0);\n glVertex2f(0.5, -0.5);\n glEnd();\n}\n\n\/\/blue square\nvoid bottomRightPolygon()\n{\n glViewport(250, 0, 250, 250);\n\n glBegin(GL_POLYGON);\n glColor3f(0.0, 0.0, 1.0);\n glVertex2f(-0.5, -0.5);\n\n glColor3f(0.0, 0.0, 1.0);\n glVertex2f(-0.5, 0.5);\n\n glColor3f(0.0, 0.0, 1.0);\n glVertex2f(0.5, 0.5);\n\n glColor3f(0.0, 0.0, 1.0);\n glVertex2f(0.5, -0.5);\n glEnd();\n}\n\n\/\/green square\nvoid topLeftPolygon()\n{\n glViewport(0, 250, 250, 250);\n\n glBegin(GL_POLYGON);\n glColor3f(0.0, 1.0, 0.0);\n glVertex2f(-0.5, -0.5);\n\n glColor3f(0.0, 1.0, 0.0);\n glVertex2f(-0.5, 0.5);\n\n glColor3f(0.0, 1.0, 0.0);\n glVertex2f(0.5, 0.5);\n\n glColor3f(0.0, 1.0, 0.0);\n glVertex2f(0.5, -0.5);\n glEnd();\n}\n\n\/\/red square\nvoid topRightPolygon()\n{\n glViewport(250, 250, 250, 250);\n\n glBegin(GL_POLYGON);\n glColor3f(1.0, 0.0, 0.0);\n glVertex2f(-0.5, -0.5);\n\n glColor3f(1.0, 0.0, 0.0);\n glVertex2f(-0.5, 0.5);\n\n glColor3f(1.0, 0.0, 0.0);\n glVertex2f(0.5, 0.5);\n\n glColor3f(1.0, 0.0, 0.0);\n glVertex2f(0.5, -0.5);\n glEnd();\n}\n\nvoid myDisplay()\n{\n glClear(GL_COLOR_BUFFER_BIT);\n\n bottomLeftPolygon();\n bottomRightPolygon();\n topLeftPolygon();\n topRightPolygon();\n\n glFlush();\n}\n\nint main(int argc, char** argv)\n{\n glutInit(&argc, argv);\n glutInitDisplayMode(GLUT_SINGLE|GLUT_RGB);\n glutInitWindowSize(500, 500);\n glutInitWindowPosition(0,0);\n glutCreateWindow(\"Homework 1\");\n\n glutDisplayFunc(myDisplay);\n\n init();\n\n glutMainLoop();\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 \"base\/at_exit.h\"\n#include \"base\/command_line.h\"\n#include \"ui\/gfx\/geometry\/size.h\"\n#include \"ui\/gl\/gl_bindings.h\"\n#include \"ui\/gl\/gl_context.h\"\n#include \"ui\/gl\/gl_surface.h\"\n#include \"ui\/ozone\/public\/ozone_platform.h\"\n#include \"ui\/ozone\/public\/surface_factory_ozone.h\"\n\nint main(int argc, char** argv) {\n CommandLine::Init(argc, argv);\n base::AtExitManager exit_manager;\n\n ui::OzonePlatform::InitializeForUI();\n if (!gfx::GLSurface::InitializeOneOff())\n LOG(FATAL) << \"Failed to initialize GL\";\n\n gfx::AcceleratedWidget widget =\n ui::SurfaceFactoryOzone::GetInstance()->GetAcceleratedWidget();\n scoped_refptr<gfx::GLSurface> surface =\n gfx::GLSurface::CreateViewGLSurface(widget);\n if (!surface)\n LOG(FATAL) << \"Failed to create GL surface\";\n\n scoped_refptr<gfx::GLContext> context = gfx::GLContext::CreateGLContext(\n NULL, surface.get(), gfx::PreferIntegratedGpu);\n if (!context)\n LOG(FATAL) << \"Failed to create GL context\";\n\n const gfx::Size window_size(800, 600);\n int iterations = 120;\n\n surface->Resize(window_size);\n if (!context->MakeCurrent(surface.get()))\n LOG(FATAL) << \"Failed to make current on GL context\";\n\n for (int i = 0; i < iterations; ++i) {\n glViewport(0, 0, window_size.width(), window_size.height());\n glClear(GL_COLOR_BUFFER_BIT | GL_DEPTH_BUFFER_BIT);\n float fraction = static_cast<float>(i) \/ iterations;\n glClearColor(1 - fraction, fraction, 0.0, 1.0);\n\n if (!surface->SwapBuffers())\n LOG(FATAL) << \"Failed to swap buffers\";\n }\n\n return 0;\n}\n<commit_msg>ozone: Port egl_demo on top of PlatformWindow<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 \"base\/at_exit.h\"\n#include \"base\/command_line.h\"\n#include \"base\/message_loop\/message_loop.h\"\n#include \"ui\/gfx\/geometry\/size.h\"\n#include \"ui\/gl\/gl_bindings.h\"\n#include \"ui\/gl\/gl_context.h\"\n#include \"ui\/gl\/gl_surface.h\"\n#include \"ui\/ozone\/public\/ozone_platform.h\"\n#include \"ui\/ozone\/public\/surface_factory_ozone.h\"\n#include \"ui\/platform_window\/platform_window.h\"\n#include \"ui\/platform_window\/platform_window_delegate.h\"\n\nconst int kTestWindowWidth = 800;\nconst int kTestWindowHeight = 600;\n\nclass DemoWindow : public ui::PlatformWindowDelegate {\n public:\n DemoWindow() : widget_(gfx::kNullAcceleratedWidget) {\n platform_window_ = ui::OzonePlatform::GetInstance()->CreatePlatformWindow(\n this, gfx::Rect(kTestWindowWidth, kTestWindowHeight));\n }\n virtual ~DemoWindow() {}\n\n gfx::AcceleratedWidget GetAcceleratedWidget() {\n \/\/ TODO(spang): We should start rendering asynchronously.\n CHECK_NE(widget_, gfx::kNullAcceleratedWidget)\n << \"widget not available synchronously\";\n return widget_;\n }\n\n gfx::Size GetSize() { return platform_window_->GetBounds().size(); }\n\n \/\/ PlatformWindowDelegate:\n virtual void OnBoundsChanged(const gfx::Rect& new_bounds) OVERRIDE {}\n virtual void OnDamageRect(const gfx::Rect& damaged_region) OVERRIDE {}\n virtual void DispatchEvent(ui::Event* event) OVERRIDE {}\n virtual void OnCloseRequest() OVERRIDE {}\n virtual void OnClosed() OVERRIDE {}\n virtual void OnWindowStateChanged(\n ui::PlatformWindowState new_state) OVERRIDE {}\n virtual void OnLostCapture() OVERRIDE {}\n virtual void OnAcceleratedWidgetAvailable(\n gfx::AcceleratedWidget widget) OVERRIDE {\n CHECK_NE(widget, gfx::kNullAcceleratedWidget);\n widget_ = widget;\n }\n\n private:\n scoped_ptr<ui::PlatformWindow> platform_window_;\n gfx::AcceleratedWidget widget_;\n\n DISALLOW_COPY_AND_ASSIGN(DemoWindow);\n};\n\nint main(int argc, char** argv) {\n CommandLine::Init(argc, argv);\n base::AtExitManager exit_manager;\n\n base::MessageLoopForUI message_loop;\n\n ui::OzonePlatform::InitializeForUI();\n if (!gfx::GLSurface::InitializeOneOff())\n LOG(FATAL) << \"Failed to initialize GL\";\n\n DemoWindow window;\n\n scoped_refptr<gfx::GLSurface> surface =\n gfx::GLSurface::CreateViewGLSurface(window.GetAcceleratedWidget());\n if (!surface)\n LOG(FATAL) << \"Failed to create GL surface\";\n\n scoped_refptr<gfx::GLContext> context = gfx::GLContext::CreateGLContext(\n NULL, surface.get(), gfx::PreferIntegratedGpu);\n if (!context)\n LOG(FATAL) << \"Failed to create GL context\";\n\n gfx::Size window_size = window.GetSize();\n\n int iterations = 120;\n\n surface->Resize(window_size);\n if (!context->MakeCurrent(surface.get()))\n LOG(FATAL) << \"Failed to make current on GL context\";\n\n for (int i = 0; i < iterations; ++i) {\n glViewport(0, 0, window_size.width(), window_size.height());\n glClear(GL_COLOR_BUFFER_BIT | GL_DEPTH_BUFFER_BIT);\n float fraction = static_cast<float>(i) \/ iterations;\n glClearColor(1 - fraction, fraction, 0.0, 1.0);\n\n if (!surface->SwapBuffers())\n LOG(FATAL) << \"Failed to swap buffers\";\n }\n\n return 0;\n}\n<|endoftext|>"} {"text":"<commit_before>#include \"SimpleExample.h\"\n#include \"Utils.h\"\n#include <cmath>\n#include <limits>\n\nusing namespace std;\n\nSimpleExample::SimpleExample()\n:params(100)\n,scalars(2)\n{\n\n}\n\nvoid SimpleExample::from_prior(RNG& rng)\n{\n\tfor(double& x:params)\n\t\tx = rng.rand();\n\tcompute_scalars();\n}\n\ndouble SimpleExample::perturb(RNG& rng)\n{\n\tint which = rng.rand_int(params.size());\n\tparams[which] += rng.randh();\n\twrap(params[which], 0., 1.);\n\tcompute_scalars();\n\treturn 0.;\n}\n\nvoid SimpleExample::compute_scalars()\n{\n\tscalars[0] = 0.;\n\tscalars[1] = 0.;\n\tfor(const double& x: params)\n\t{\n\t\tscalars[0] += -pow(x - 0.5, 2);\n\t\tscalars[1] += -pow(sin(4.*M_PI*x), 2);\n\t}\n}\n\nvoid SimpleExample::write_text(std::ostream& out) const\n{\n\tfor(size_t i=0; i<params.size(); i++)\n\t\tout<<params[i]<<' ';\n}\n\n<commit_msg>Bolder proposal<commit_after>#include \"SimpleExample.h\"\n#include \"Utils.h\"\n#include <cmath>\n#include <limits>\n\nusing namespace std;\n\nSimpleExample::SimpleExample()\n:params(100)\n,scalars(2)\n{\n\n}\n\nvoid SimpleExample::from_prior(RNG& rng)\n{\n\tfor(double& x:params)\n\t\tx = rng.rand();\n\tcompute_scalars();\n}\n\ndouble SimpleExample::perturb(RNG& rng)\n{\n\tint which, count;\n\tif(rng.rand() <= 0.5)\n\t\tcount = 0;\n\telse\n\t\tcount = static_cast<int>(pow(10., 2.*rng.rand()));\n\n\tfor(int i=0; i<count; i++)\n\t{\n\t\twhich = rng.rand_int(params.size());\n\t\tparams[which] += rng.randh();\n\t\twrap(params[which], 0., 1.);\n\t}\n\n\tcompute_scalars();\n\treturn 0.;\n}\n\nvoid SimpleExample::compute_scalars()\n{\n\tscalars[0] = 0.;\n\tscalars[1] = 0.;\n\tfor(const double& x: params)\n\t{\n\t\tscalars[0] += -pow(x - 0.5, 2);\n\t\tscalars[1] += -pow(sin(4.*M_PI*x), 2);\n\t}\n}\n\nvoid SimpleExample::write_text(std::ostream& out) const\n{\n\tfor(size_t i=0; i<params.size(); i++)\n\t\tout<<params[i]<<' ';\n}\n\n<|endoftext|>"} {"text":"<commit_before>\/*\n * Copyright (C) 2003-2006 Funambol\n *\n * This program is free software; you can redistribute it and\/or modify\n * it under the terms of the GNU General Public License as published by\n * the Free Software Foundation; either version 2 of the License, or\n * (at your option) any later version.\n *\n * This program is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the\n * GNU General Public License for more details.\n *\n * You should have received a copy of the GNU General Public License\n * along with this program; if not, write to the Free Software\n * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA\n *\/\n\n#include <stdio.h>\n#include \"base\/Log.h\"\n#include \"base\/util\/utils.h\"\n\nlong utf8len(const wchar_t* s) {\n if ((s == NULL) || (wcslen(s) == 0)) {\n return 0;\n }\n \n long k = 0;\n \n \/\/ If the function succeeds (WideCharToMultiByte) \n \/\/ the return value is the required size, in bytes, \n \/\/ for a buffer that can receive the translated string.\n\n k = WideCharToMultiByte (CP_UTF8, 0, s, wcslen(s), NULL, 0, NULL, NULL);\n\n return (k != 0) ? (long)k : -1;\n}\n\nchar* wc2utf8(const wchar_t* s, char* d, unsigned long dsize) {\n \n \/\/\n \/\/ First of all, if s is NULL, just return NULL.\n \/\/ Then, if d is NULL, let's allocate the required memory to contain the\n \/\/ utf8 string.\n \/\/\n if (s == NULL) {\n return NULL;\n }\n \n if (d == NULL) {\n dsize = utf8len(s);\n d = new char[dsize+1];\n } \n \n unsigned long k = 0;\n \n k = WideCharToMultiByte (CP_UTF8, 0, s, wcslen(s), d, dsize, 0, 0);\t\n\t\n\td[dsize] = 0;\n \n \n return (k != 0) ? d : NULL;\n}\n\nwchar_t* utf82wc(const char* s, wchar_t* d, unsigned long dsize) {\n \n \/\/\n \/\/ First of all, if s is NULL, just return NULL.\n \/\/ Then, if d is NULL, let's allocate the required memory to contain the\n \/\/ wchar_t string.\n \/\/\n if (s == NULL) {\n return NULL;\n }\n\n if (d == NULL) {\n dsize = strlen(s);\n d = new wchar_t[dsize+1];\n }\n \n wmemset(d, 0, dsize + 1);\n\n int k = MultiByteToWideChar(CP_UTF8, 0, s, strlen(s), d, dsize + 1);\n \n return (k != 0) ? d : NULL;\n \n}\n\n\n\/*\n * Return a filename composed by the system temp dir and the name given \n * in input. If the file exists, try to add a digit 0-9.\n * If this fails too, return NULL (there's must be something wrong in\n * the calling program)\n *\n * @param name - a file name, without path\n * @return - a full pathname, allocated with new[], or NULL on error\n *\/\nwchar_t *mkTempFileName(const wchar_t *name)\n{\n wchar_t tmpPath[64];\n wchar_t* tmpFileName = new wchar_t[MAX_PATH]; \/\/ System constants for the path\n\n GetTempPath(64, tmpPath);\n int ret = GetTempFileName(tmpPath, TEXT(\"fun\"), 0, tmpFileName);\n \n if (ret == 0) { \/\/ function GetTempFileName fails \n delete [] tmpFileName; \n tmpFileName = NULL;\n }\n\n return tmpFileName;\n\n \/*\n\twchar_t *ret = new wchar_t[wcslen(TEMPROOT)+wcslen(name)+3] ;\n\twsprintf(ret, TEXT(\"%s\\\\%s\"), TEMPROOT, name);\n\tFILE *f;\n int i;\n\n\tfor (i=0; i<10 && (f=_wfopen(ret, TEXT(\"r\")))!=NULL; i++ ) {\n\t\tfclose(f);\n\t\twsprintf(ret, TEXT(\"%s\\\\%d%s\"), TEMPROOT, i, name);\n\t}\n\n\tif(i==10) {\n\t\t\/\/ Can't find a free temp file name !\n\t\tdelete [] ret;\n\t\treturn NULL;\n\t}\n \n\treturn ret;*\/\n}\n\n\nbool saveFile(const char *filename, const char *buffer, size_t len, bool binary)\n{\n\tconst char *mode = binary ? \"wb\" : \"w\" ;\n\n FILE *f = fopen(filename, mode);\n\n if(!f)\n return false;\n\n if (fwrite(buffer, sizeof(char), len, f) != len) {\n fclose(f);\n return false;\n }\n fclose(f);\n\n return true;\n}\n\nsize_t fgetsize(FILE *f)\n{\n size_t size;\n\n fseek(f, 0, SEEK_END);\n size=ftell(f);\n fseek(f, 0, SEEK_SET);\n return size;\n}\n\nbool readFile(const char* path, char **message, size_t *len, bool binary)\n{\n FILE *f;\n size_t msglen=0;\n char *msg=0;\n const char *mode = binary ? \"rb\" : \"r\" ;\n\n f = fopen(path, mode);\n if ( !f ) {\n return false;\n }\n msglen = fgetsize(f);\n msg = new char[msglen+1];\n\n fread(msg, msglen, sizeof(char), f);\n\n if(ferror(f)){\n delete [] msg;\n return false;\n }\n fclose(f);\n \/\/ Terminate the string, so that if it's a text file, the result is\n \/\/ a NULL terminated string\n msg[msglen]=0;\n *message= msg ;\n *len=msglen;\n\n return true;\n}\n\nlong int getLenEncoding(const wchar_t* s, const wchar_t* encoding) {\n\n\tif ((s == NULL) || (wcslen(s) == 0)) {\n return 0;\n }\n \n\tint i = 0;\n\tlong k = 0;\n\t\n\twhile(encodings[i].name) {\n\t\tif(wcscmpIgnoreCase(encodings[i].name, encoding)) {\n\t\t\tk = WideCharToMultiByte (encodings[i].codepage_id, 0, s, wcslen(s), NULL, 0, NULL, NULL);\n\t\t\tbreak;\n\t\t}\n\t\ti++;\n\t}\n\n return (k != 0) ? (long)k : -1;\n\t\n}\n\nchar* toMultibyte(const wchar_t *wc, const wchar_t *encoding) {\n\tif (wc == NULL) {\n return NULL;\n }\n \n unsigned long dsize = getLenEncoding(wc, encoding);\n\tif(dsize <= 0)\n\t\treturn NULL;\n\n char* ret = new char[dsize+1];\n \n \n unsigned long k = 0;\n int i = 0;\n\n\twhile(encodings[i].name) {\n\t\tif(wcscmpIgnoreCase(encodings[i].name, encoding)) {\n\t\t\tk = WideCharToMultiByte (encodings[i].codepage_id, 0, wc, wcslen(wc), ret, dsize, 0, 0);\t\n\t\t\tbreak;\n\t\t}\n\t\ti++;\n\t}\n\t\n\tret[dsize] = 0;\n \n\tif(k == 0) {\n\t\tdelete [] ret; ret = NULL;\n\t}\n return ret;\n}\n\nwchar_t* toWideChar(const char *mb, const wchar_t *encoding) {\n\n\tif (mb == NULL) {\n return NULL;\n }\n\n\t\n unsigned long dsize = strlen(mb);\n\twchar_t* ret = new wchar_t[dsize+1];\n \n wmemset(ret, 0, dsize + 1);\n\n\tunsigned long k = 0;\n int i = 0;\n\t\n\twhile(encodings[i].name) {\n\t\tif(wcscmpIgnoreCase(encodings[i].name, encoding)) {\n\t\t\tk = MultiByteToWideChar(encodings[i].codepage_id, 0, mb, strlen(mb), ret, dsize + 1);\n\t\t\tbreak;\n\t\t}\n\t\ti++;\n\t}\n \n if(k == 0) {\n\t\tdelete [] ret; ret = NULL;\n\t}\n return ret;\n}\n\n\n\n#ifdef __DEBUG__\n\n \/\/\n \/\/ This is required since in debug mode, new is rewritten\n \/\/ as new(__FILE__, __LINE__). See utils.h for details\n \/\/\n #undef new\n #undef delete\n\n #include <stddef.h>\n\n void *operator new(size_t s, char* file, int line) {\n wchar_t m[256];\n\n void* p = malloc(s);\n\n \/\/ \/** WARNING: this sloooooowwwwssss doooowwwwnnnn things\n wcsprintf(m, L\"%S:%d new - s:%ld, p:%lx\\n\", file, line, s, p);\n LOG.error(m);\n \/\/ **\/\n\n return p;\n }\n\n void *operator new(size_t s) {\n return ::operator new(s, \"\", 0);\n }\n\n void *operator new[](size_t s) {\n return ::operator new(s, \"\", 0);\n }\n\n void *operator new[](size_t s, char* file, int line) {\n return ::operator new(s, file, line);\n }\n\n void operator delete(void* p) {\n wchar_t m[216];\n\n \/\/ \/** WARNING: this sloooooowwwwssss doooowwwwnnnn things\n wcsprintf(m, L\"delete - p:%lx\\n\", (long)p);\n LOG.error(m);\n \/\/ **\/\n\n if (p) {\n free(p);\n }\n }\n\n void operator delete[] (void* p) {\n ::operator delete(p);\n }\n\n#endif\n\n<commit_msg>Thi file is not used anymore. See winmobileadapter.cpp<commit_after><|endoftext|>"} {"text":"<commit_before>\/*\n * Copyright (C) 2005-2022 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 \"otbWrapperApplication.h\"\n#include \"otbWrapperApplicationFactory.h\"\n\n#include \"otbStatisticsXMLFileWriter.h\"\n#include \"otbStreamingStatisticsVectorImageFilter.h\"\n#include <sstream>\n\nnamespace otb\n{\nnamespace Wrapper\n{\n\nclass ComputeImagesStatistics : public Application\n{\npublic:\n \/** Standard class typedefs. *\/\n typedef ComputeImagesStatistics Self;\n typedef Application Superclass;\n typedef itk::SmartPointer<Self> Pointer;\n typedef itk::SmartPointer<const Self> ConstPointer;\n\n \/** Standard macro *\/\n itkNewMacro(Self);\n\n itkTypeMacro(ComputeImagesStatistics, otb::Application);\n\nprivate:\n void DoInit() override\n {\n SetName(\"ComputeImagesStatistics\");\n SetDescription(\n \"Computes global mean and standard deviation for each band \"\n \"from a set of images and optionally saves the results in an XML file.\");\n SetDocLongDescription(\n \"This application computes a global mean and standard deviation \"\n \"for each band of a set of images and optionally saves the results in an XML file.\"\n \" The output XML is intended to be used as an input \"\n \"for the TrainImagesClassifier application to normalize samples before learning. \"\n \"You can also normalize the image with the XML file in the ImageClassifier application.\");\n\n SetDocLimitations(\n \"Each image of the set must contain the same bands as the others\"\n \" (i.e. same types, in the same order).\");\n SetDocAuthors(\"OTB-Team\");\n SetDocSeeAlso(\"Documentation of the TrainImagesClassifier and ImageClassifier application.\");\n\n AddDocTag(Tags::Learning);\n AddDocTag(Tags::Analysis);\n\n AddParameter(ParameterType_InputImageList, \"il\", \"Input images\");\n SetParameterDescription(\"il\", \"List of input image filenames.\");\n\n AddParameter(ParameterType_Float, \"bv\", \"Background Value\");\n SetParameterDescription(\"bv\", \"Background value to ignore in computation of statistics.\");\n MandatoryOff(\"bv\");\n\n AddParameter(ParameterType_OutputFilename, \"out\", \"Output XML file\");\n SetParameterDescription(\"out\", \"XML filename where the statistics are saved for future reuse.\");\n MandatoryOff(\"out\");\n\n AddParameter(ParameterType_String, \"mean\", \"Mean pixel Value\");\n SetParameterDescription(\"mean\", \"Mean pixel value\");\n SetParameterRole(\"mean\", Role_Output);\n\n AddParameter(ParameterType_String, \"min\", \"Min pixel Value\");\n SetParameterDescription(\"min\", \"Minimum pixel value\");\n SetParameterRole(\"min\", Role_Output);\n\n AddParameter(ParameterType_String, \"max\", \"Max pixel Value\");\n SetParameterDescription(\"max\", \"Maximum pixel value\");\n SetParameterRole(\"max\", Role_Output);\n\n AddParameter(ParameterType_String, \"std\", \"Standard deviation of pixel Value\");\n SetParameterDescription(\"std\", \"Standard deviation of pixel value\");\n SetParameterRole(\"std\", Role_Output);\n\n AddRAMParameter();\n\n \/\/ Doc example parameter settings\n SetDocExampleParameterValue(\"il\", \"QB_1_ortho.tif\");\n SetDocExampleParameterValue(\"out\", \"EstimateImageStatisticsQB1.xml\");\n\n SetOfficialDocLink();\n }\n\n void DoUpdateParameters() override\n {\n \/\/ Nothing to do here : all parameters are independent\n }\n\n void DoExecute() override\n {\n \/\/ Statistics estimator\n typedef otb::StreamingStatisticsVectorImageFilter<FloatVectorImageType> StreamingStatisticsVImageFilterType;\n\n \/\/ Samples\n typedef double ValueType;\n typedef itk::VariableLengthVector<ValueType> MeasurementType;\n typedef itk::VariableSizeMatrix<ValueType> MatrixValueType;\n\n unsigned int nbBands = 0;\n\n FloatVectorImageListType* imageList = GetParameterImageList(\"il\");\n FloatVectorImageListType::InternalContainerSizeType nbImages = imageList->Size();\n\n \/\/ Initialization, all image have same size and number of band\/component\n FloatVectorImageType* firstImage = imageList->GetNthElement(0);\n nbBands = firstImage->GetNumberOfComponentsPerPixel();\n\n \/\/ Build a Measurement Vector of mean\n MatrixValueType mean(nbBands, static_cast<unsigned int>(nbImages));\n mean.Fill(itk::NumericTraits<MatrixValueType::ValueType>::Zero);\n\n \/\/ Build a Measurement Vector of min\n MatrixValueType min(nbBands, static_cast<unsigned int>(nbImages));\n mean.Fill(itk::NumericTraits<MatrixValueType::ValueType>::max());\n\n \/\/ Build a Measurement Vector of max\n MatrixValueType max(nbBands, static_cast<unsigned int>(nbImages));\n max.Fill(itk::NumericTraits<MatrixValueType::ValueType>::min());\n\n \/\/ Build a Measurement Matrix of variance\n MatrixValueType variance(nbBands, static_cast<unsigned int>(nbImages));\n variance.Fill(itk::NumericTraits<MatrixValueType::ValueType>::Zero);\n\n \/\/ Build a Measurement Matrix of nbSamples\n MatrixValueType nbSamples(nbBands, static_cast<unsigned int>(nbImages));\n nbSamples.Fill(itk::NumericTraits<MatrixValueType::ValueType>::Zero);\n\n \/\/ Iterate over all input images\n for (unsigned int imageId = 0; imageId < nbImages; ++imageId)\n {\n FloatVectorImageType* image = imageList->GetNthElement(imageId);\n if (nbBands != image->GetNumberOfComponentsPerPixel())\n {\n itkExceptionMacro(<< \"The image #\" << imageId + 1 << \" has \" << image->GetNumberOfComponentsPerPixel() << \" bands, while the image #1 has \" << nbBands);\n }\n\n \/\/ Compute Statistics of each VectorImage\n StreamingStatisticsVImageFilterType::Pointer statsEstimator = StreamingStatisticsVImageFilterType::New();\n std::ostringstream processName;\n processName << \"Processing Image (\" << imageId + 1 << \"\/\" << imageList->Size() << \")\";\n AddProcess(statsEstimator->GetStreamer(), processName.str());\n statsEstimator->SetInput(image);\n statsEstimator->GetStreamer()->SetAutomaticAdaptativeStreaming(GetParameterInt(\"ram\"));\n\n if (HasValue(\"bv\"))\n {\n statsEstimator->SetIgnoreUserDefinedValue(true);\n statsEstimator->SetUserIgnoredValue(GetParameterFloat(\"bv\"));\n }\n statsEstimator->Update();\n\n MeasurementType nbRelevantPixels = statsEstimator->GetNbRelevantPixels();\n MeasurementType meanPerBand = statsEstimator->GetMean();\n MeasurementType minPerBand = statsEstimator->GetMinimum();\n MeasurementType maxPerBand = statsEstimator->GetMaximum();\n\n for (unsigned int itBand = 0; itBand < nbBands; itBand++)\n {\n mean(itBand, imageId) = meanPerBand[itBand];\n min(itBand, imageId) = minPerBand[itBand];\n max(itBand, imageId) = maxPerBand[itBand];\n variance(itBand, imageId) = (statsEstimator->GetCovariance())(itBand, itBand);\n nbSamples(itBand, imageId) = nbRelevantPixels[itBand];\n }\n }\n\n \/\/ Compute total mean and pooled variation for each band of the image list\n MeasurementType totalSamplesPerBand;\n totalSamplesPerBand.SetSize(nbBands);\n totalSamplesPerBand.Fill(itk::NumericTraits<MeasurementType::ValueType>::Zero);\n\n MeasurementType totalMeanPerBand;\n totalMeanPerBand.SetSize(nbBands);\n totalMeanPerBand.Fill(itk::NumericTraits<MeasurementType::ValueType>::Zero);\n\n MeasurementType totalMinPerBand;\n totalMinPerBand.SetSize(nbBands);\n totalMinPerBand.Fill(itk::NumericTraits<MeasurementType::ValueType>::max());\n\n MeasurementType totalMaxPerBand;\n totalMaxPerBand.SetSize(nbBands);\n totalMaxPerBand.Fill(itk::NumericTraits<MeasurementType::ValueType>::min());\n\n MeasurementType totalVariancePerBand;\n totalVariancePerBand.SetSize(nbBands);\n totalVariancePerBand.Fill(itk::NumericTraits<MeasurementType::ValueType>::Zero);\n\n for (unsigned int imageId = 0; imageId < nbImages; ++imageId)\n {\n for (unsigned int itBand = 0; itBand < nbBands; itBand++)\n {\n MeasurementType::ValueType nbSample = nbSamples(itBand, imageId);\n totalSamplesPerBand[itBand] += nbSample;\n totalMeanPerBand[itBand] += mean(itBand, imageId) * nbSample;\n totalMinPerBand[itBand] = std::min(totalMinPerBand[itBand], min(itBand, imageId));\n totalMaxPerBand[itBand] = std::max(totalMaxPerBand[itBand], max(itBand, imageId));\n totalVariancePerBand[itBand] += variance(itBand, imageId) * (nbSample - 1);\n }\n }\n\n \/\/ Check 0 division\n for (unsigned int itBand = 0; itBand < nbBands; itBand++)\n {\n MeasurementType::ValueType nbSample = totalSamplesPerBand[itBand];\n\n if (nbSample > nbImages)\n {\n totalVariancePerBand[itBand] \/= (nbSample - nbImages);\n }\n else\n {\n totalVariancePerBand[itBand] = itk::NumericTraits<ValueType>::Zero;\n }\n\n if (nbSample != 0)\n {\n totalMeanPerBand[itBand] \/= nbSample;\n }\n else\n {\n totalMeanPerBand[itBand] = itk::NumericTraits<ValueType>::Zero;\n totalMinPerBand[itBand] = itk::NumericTraits<ValueType>::Zero;\n totalMaxPerBand[itBand] = itk::NumericTraits<ValueType>::Zero;\n }\n }\n\n MeasurementType stddev;\n stddev.SetSize(nbBands);\n stddev.Fill(itk::NumericTraits<MeasurementType::ValueType>::Zero);\n for (unsigned int i = 0; i < totalVariancePerBand.GetSize(); ++i)\n {\n stddev[i] = std::sqrt(totalVariancePerBand[i]);\n }\n\n \/\/ Display the pixel value\n oss_mean << totalMeanPerBand;\n oss_min << totalMinPerBand;\n oss_max << totalMaxPerBand;\n oss_std << stddev;\n\n\/\/ \/\/ If the above doesn't work, we can do something like\n\/\/ const std::string separator = \",\";\n\/\/ std::ostringstream oss_mean, oss_min, oss_max, oss_std;\n\/\/ oss_mean << \"(\";\n\/\/ oss_min << \"(\";\n\/\/ oss_max << \"(\";\n\/\/ oss_std << \"(\";\n\/\/ for (unsigned int itBand = 0; itBand < nbBands; itBand++)\n\/\/ {\n\/\/ oss_mean << totalMeanPerBand[itBand] << separator;\n\/\/ oss_min << totalMinPerBand[itBand] << separator;\n\/\/ oss_max << totalMaxPerBand[itBand] << separator;\n\/\/ oss_std << stddev[itBand] << separator;\n\/\/ }\n\/\/ oss_mean.seekp(-1, oss_mean.cur);\n\/\/ oss_min.seekp(-1, oss_min.cur);\n\/\/ oss_max.seekp(-1, oss_max.cur);\n\/\/ oss_std.seekp(-1, oss_std.cur);\n\/\/ oss_mean << \")\";\n\/\/ oss_min << \")\";\n\/\/ oss_max << \")\";\n\/\/ oss_std << \")\";\n\n SetParameterString(\"mean\", oss_mean.str());\n SetParameterString(\"min\", oss_min.str());\n SetParameterString(\"max\", oss_max.str());\n SetParameterString(\"std\", oss_std.str());\n\n \/\/ Display image information in the dedicated logger\n otbAppLogINFO(<< oss.str());\n\n if (HasValue(\"out\"))\n {\n \/\/ Write the Statistics via the statistic writer\n typedef otb::StatisticsXMLFileWriter<MeasurementType> StatisticsWriter;\n StatisticsWriter::Pointer writer = StatisticsWriter::New();\n writer->SetFileName(GetParameterString(\"out\"));\n writer->AddInput(\"mean\", totalMeanPerBand);\n writer->AddInput(\"stddev\", stddev);\n writer->Update();\n }\n else\n {\n otbAppLogINFO(\"Mean: \" << mean << std::endl);\n otbAppLogINFO(\"Standard Deviation: \" << stddev << std::endl);\n }\n }\n\n itk::LightObject::Pointer m_FilterRef;\n};\n}\n}\n\nOTB_APPLICATION_EXPORT(otb::Wrapper::ComputeImagesStatistics)\n<commit_msg>ADD: role output for mean, min, max, std<commit_after>\/*\n * Copyright (C) 2005-2022 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 \"otbWrapperApplication.h\"\n#include \"otbWrapperApplicationFactory.h\"\n\n#include \"otbStatisticsXMLFileWriter.h\"\n#include \"otbStreamingStatisticsVectorImageFilter.h\"\n#include <sstream>\n\nnamespace otb\n{\nnamespace Wrapper\n{\n\nclass ComputeImagesStatistics : public Application\n{\npublic:\n \/** Standard class typedefs. *\/\n typedef ComputeImagesStatistics Self;\n typedef Application Superclass;\n typedef itk::SmartPointer<Self> Pointer;\n typedef itk::SmartPointer<const Self> ConstPointer;\n\n \/** Standard macro *\/\n itkNewMacro(Self);\n\n itkTypeMacro(ComputeImagesStatistics, otb::Application);\n\nprivate:\n void DoInit() override\n {\n SetName(\"ComputeImagesStatistics\");\n SetDescription(\n \"Computes global mean and standard deviation for each band \"\n \"from a set of images and optionally saves the results in an XML file.\");\n SetDocLongDescription(\n \"This application computes a global mean and standard deviation \"\n \"for each band of a set of images and optionally saves the results in an XML file.\"\n \" The output XML is intended to be used as an input \"\n \"for the TrainImagesClassifier application to normalize samples before learning. \"\n \"You can also normalize the image with the XML file in the ImageClassifier application.\");\n\n SetDocLimitations(\n \"Each image of the set must contain the same bands as the others\"\n \" (i.e. same types, in the same order).\");\n SetDocAuthors(\"OTB-Team\");\n SetDocSeeAlso(\"Documentation of the TrainImagesClassifier and ImageClassifier application.\");\n\n AddDocTag(Tags::Learning);\n AddDocTag(Tags::Analysis);\n\n AddParameter(ParameterType_InputImageList, \"il\", \"Input images\");\n SetParameterDescription(\"il\", \"List of input image filenames.\");\n\n AddParameter(ParameterType_Float, \"bv\", \"Background Value\");\n SetParameterDescription(\"bv\", \"Background value to ignore in computation of statistics.\");\n MandatoryOff(\"bv\");\n\n AddParameter(ParameterType_OutputFilename, \"out\", \"Output XML file\");\n SetParameterDescription(\"out\", \"XML filename where the statistics are saved for future reuse.\");\n MandatoryOff(\"out\");\n\n AddParameter(ParameterType_String, \"mean\", \"Mean pixel Value\");\n SetParameterDescription(\"mean\", \"Mean pixel value\");\n SetParameterRole(\"mean\", Role_Output);\n\n AddParameter(ParameterType_String, \"min\", \"Min pixel Value\");\n SetParameterDescription(\"min\", \"Minimum pixel value\");\n SetParameterRole(\"min\", Role_Output);\n\n AddParameter(ParameterType_String, \"max\", \"Max pixel Value\");\n SetParameterDescription(\"max\", \"Maximum pixel value\");\n SetParameterRole(\"max\", Role_Output);\n\n AddParameter(ParameterType_String, \"std\", \"Standard deviation of pixel Value\");\n SetParameterDescription(\"std\", \"Standard deviation of pixel value\");\n SetParameterRole(\"std\", Role_Output);\n\n AddRAMParameter();\n\n \/\/ Doc example parameter settings\n SetDocExampleParameterValue(\"il\", \"QB_1_ortho.tif\");\n SetDocExampleParameterValue(\"out\", \"EstimateImageStatisticsQB1.xml\");\n\n SetOfficialDocLink();\n }\n\n void DoUpdateParameters() override\n {\n \/\/ Nothing to do here : all parameters are independent\n }\n\n void DoExecute() override\n {\n \/\/ Statistics estimator\n typedef otb::StreamingStatisticsVectorImageFilter<FloatVectorImageType> StreamingStatisticsVImageFilterType;\n\n \/\/ Samples\n typedef double ValueType;\n typedef itk::VariableLengthVector<ValueType> MeasurementType;\n typedef itk::VariableSizeMatrix<ValueType> MatrixValueType;\n\n unsigned int nbBands = 0;\n\n FloatVectorImageListType* imageList = GetParameterImageList(\"il\");\n FloatVectorImageListType::InternalContainerSizeType nbImages = imageList->Size();\n\n \/\/ Initialization, all image have same size and number of band\/component\n FloatVectorImageType* firstImage = imageList->GetNthElement(0);\n nbBands = firstImage->GetNumberOfComponentsPerPixel();\n\n \/\/ Build a Measurement Vector of mean\n MatrixValueType mean(nbBands, static_cast<unsigned int>(nbImages));\n mean.Fill(itk::NumericTraits<MatrixValueType::ValueType>::Zero);\n\n \/\/ Build a Measurement Vector of min\n MatrixValueType min(nbBands, static_cast<unsigned int>(nbImages));\n mean.Fill(itk::NumericTraits<MatrixValueType::ValueType>::max());\n\n \/\/ Build a Measurement Vector of max\n MatrixValueType max(nbBands, static_cast<unsigned int>(nbImages));\n max.Fill(itk::NumericTraits<MatrixValueType::ValueType>::min());\n\n \/\/ Build a Measurement Matrix of variance\n MatrixValueType variance(nbBands, static_cast<unsigned int>(nbImages));\n variance.Fill(itk::NumericTraits<MatrixValueType::ValueType>::Zero);\n\n \/\/ Build a Measurement Matrix of nbSamples\n MatrixValueType nbSamples(nbBands, static_cast<unsigned int>(nbImages));\n nbSamples.Fill(itk::NumericTraits<MatrixValueType::ValueType>::Zero);\n\n \/\/ Iterate over all input images\n for (unsigned int imageId = 0; imageId < nbImages; ++imageId)\n {\n FloatVectorImageType* image = imageList->GetNthElement(imageId);\n if (nbBands != image->GetNumberOfComponentsPerPixel())\n {\n itkExceptionMacro(<< \"The image #\" << imageId + 1 << \" has \" << image->GetNumberOfComponentsPerPixel() << \" bands, while the image #1 has \" << nbBands);\n }\n\n \/\/ Compute Statistics of each VectorImage\n StreamingStatisticsVImageFilterType::Pointer statsEstimator = StreamingStatisticsVImageFilterType::New();\n std::ostringstream processName;\n processName << \"Processing Image (\" << imageId + 1 << \"\/\" << imageList->Size() << \")\";\n AddProcess(statsEstimator->GetStreamer(), processName.str());\n statsEstimator->SetInput(image);\n statsEstimator->GetStreamer()->SetAutomaticAdaptativeStreaming(GetParameterInt(\"ram\"));\n\n if (HasValue(\"bv\"))\n {\n statsEstimator->SetIgnoreUserDefinedValue(true);\n statsEstimator->SetUserIgnoredValue(GetParameterFloat(\"bv\"));\n }\n statsEstimator->Update();\n\n MeasurementType nbRelevantPixels = statsEstimator->GetNbRelevantPixels();\n MeasurementType meanPerBand = statsEstimator->GetMean();\n MeasurementType minPerBand = statsEstimator->GetMinimum();\n MeasurementType maxPerBand = statsEstimator->GetMaximum();\n\n for (unsigned int itBand = 0; itBand < nbBands; itBand++)\n {\n mean(itBand, imageId) = meanPerBand[itBand];\n min(itBand, imageId) = minPerBand[itBand];\n max(itBand, imageId) = maxPerBand[itBand];\n variance(itBand, imageId) = (statsEstimator->GetCovariance())(itBand, itBand);\n nbSamples(itBand, imageId) = nbRelevantPixels[itBand];\n }\n }\n\n \/\/ Compute total mean and pooled variation for each band of the image list\n MeasurementType totalSamplesPerBand;\n totalSamplesPerBand.SetSize(nbBands);\n totalSamplesPerBand.Fill(itk::NumericTraits<MeasurementType::ValueType>::Zero);\n\n MeasurementType totalMeanPerBand;\n totalMeanPerBand.SetSize(nbBands);\n totalMeanPerBand.Fill(itk::NumericTraits<MeasurementType::ValueType>::Zero);\n\n MeasurementType totalMinPerBand;\n totalMinPerBand.SetSize(nbBands);\n totalMinPerBand.Fill(itk::NumericTraits<MeasurementType::ValueType>::max());\n\n MeasurementType totalMaxPerBand;\n totalMaxPerBand.SetSize(nbBands);\n totalMaxPerBand.Fill(itk::NumericTraits<MeasurementType::ValueType>::min());\n\n MeasurementType totalVariancePerBand;\n totalVariancePerBand.SetSize(nbBands);\n totalVariancePerBand.Fill(itk::NumericTraits<MeasurementType::ValueType>::Zero);\n\n for (unsigned int imageId = 0; imageId < nbImages; ++imageId)\n {\n for (unsigned int itBand = 0; itBand < nbBands; itBand++)\n {\n MeasurementType::ValueType nbSample = nbSamples(itBand, imageId);\n totalSamplesPerBand[itBand] += nbSample;\n totalMeanPerBand[itBand] += mean(itBand, imageId) * nbSample;\n totalMinPerBand[itBand] = std::min(totalMinPerBand[itBand], min(itBand, imageId));\n totalMaxPerBand[itBand] = std::max(totalMaxPerBand[itBand], max(itBand, imageId));\n totalVariancePerBand[itBand] += variance(itBand, imageId) * (nbSample - 1);\n }\n }\n\n \/\/ Check 0 division\n for (unsigned int itBand = 0; itBand < nbBands; itBand++)\n {\n MeasurementType::ValueType nbSample = totalSamplesPerBand[itBand];\n\n if (nbSample > nbImages)\n {\n totalVariancePerBand[itBand] \/= (nbSample - nbImages);\n }\n else\n {\n totalVariancePerBand[itBand] = itk::NumericTraits<ValueType>::Zero;\n }\n\n if (nbSample != 0)\n {\n totalMeanPerBand[itBand] \/= nbSample;\n }\n else\n {\n totalMeanPerBand[itBand] = itk::NumericTraits<ValueType>::Zero;\n totalMinPerBand[itBand] = itk::NumericTraits<ValueType>::Zero;\n totalMaxPerBand[itBand] = itk::NumericTraits<ValueType>::Zero;\n }\n }\n\n MeasurementType stddev;\n stddev.SetSize(nbBands);\n stddev.Fill(itk::NumericTraits<MeasurementType::ValueType>::Zero);\n for (unsigned int i = 0; i < totalVariancePerBand.GetSize(); ++i)\n {\n stddev[i] = std::sqrt(totalVariancePerBand[i]);\n }\n\n \/\/ Display the pixel value\n std::ostringstream oss_mean, oss_min, oss_max, oss_std;\n oss_mean << totalMeanPerBand;\n oss_min << totalMinPerBand;\n oss_max << totalMaxPerBand;\n oss_std << stddev;\n\n\/\/ \/\/ If the above doesn't work, we can do something like\n\/\/ const std::string separator = \",\";\n\/\/ std::ostringstream oss_mean, oss_min, oss_max, oss_std;\n\/\/ oss_mean << \"(\";\n\/\/ oss_min << \"(\";\n\/\/ oss_max << \"(\";\n\/\/ oss_std << \"(\";\n\/\/ for (unsigned int itBand = 0; itBand < nbBands; itBand++)\n\/\/ {\n\/\/ oss_mean << totalMeanPerBand[itBand] << separator;\n\/\/ oss_min << totalMinPerBand[itBand] << separator;\n\/\/ oss_max << totalMaxPerBand[itBand] << separator;\n\/\/ oss_std << stddev[itBand] << separator;\n\/\/ }\n\/\/ oss_mean.seekp(-1, oss_mean.cur);\n\/\/ oss_min.seekp(-1, oss_min.cur);\n\/\/ oss_max.seekp(-1, oss_max.cur);\n\/\/ oss_std.seekp(-1, oss_std.cur);\n\/\/ oss_mean << \")\";\n\/\/ oss_min << \")\";\n\/\/ oss_max << \")\";\n\/\/ oss_std << \")\";\n\n SetParameterString(\"mean\", oss_mean.str());\n SetParameterString(\"min\", oss_min.str());\n SetParameterString(\"max\", oss_max.str());\n SetParameterString(\"std\", oss_std.str());\n\n if (HasValue(\"out\"))\n {\n \/\/ Write the Statistics via the statistic writer\n typedef otb::StatisticsXMLFileWriter<MeasurementType> StatisticsWriter;\n StatisticsWriter::Pointer writer = StatisticsWriter::New();\n writer->SetFileName(GetParameterString(\"out\"));\n writer->AddInput(\"mean\", totalMeanPerBand);\n writer->AddInput(\"stddev\", stddev);\n writer->Update();\n }\n else\n {\n otbAppLogINFO(\"Mean: \" << mean << std::endl);\n otbAppLogINFO(\"Standard Deviation: \" << stddev << std::endl);\n }\n }\n\n itk::LightObject::Pointer m_FilterRef;\n};\n}\n}\n\nOTB_APPLICATION_EXPORT(otb::Wrapper::ComputeImagesStatistics)\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 INCLUDED_SVX_SOURCE_DIALOG_IMAPIMP_HXX\n#define INCLUDED_SVX_SOURCE_DIALOG_IMAPIMP_HXX\n\n\/\/ ---------------\n\/\/ - IMapOwnData -\n\/\/ ---------------\n\nclass IMapOwnData\n{\npublic:\n\n Timer aTimer;\n Timer aTbxTimer;\n Graphic aUpdateGraphic;\n ImageMap aUpdateImageMap;\n TargetList aUpdateTargetList;\n void* pUpdateEditingObject;\n sal_Bool bExecState;\n\n IMapOwnData() : pUpdateEditingObject( NULL ) {}\n};\n\n\n#endif \/\/ _IMAPIMP_HXX\n\n\/* vim:set shiftwidth=4 softtabstop=4 expandtab: *\/\n<commit_msg>coverity#738872 Uninitialized scalar field<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 INCLUDED_SVX_SOURCE_DIALOG_IMAPIMP_HXX\n#define INCLUDED_SVX_SOURCE_DIALOG_IMAPIMP_HXX\n\n\/\/ ---------------\n\/\/ - IMapOwnData -\n\/\/ ---------------\n\nclass IMapOwnData\n{\npublic:\n\n Timer aTimer;\n Timer aTbxTimer;\n Graphic aUpdateGraphic;\n ImageMap aUpdateImageMap;\n TargetList aUpdateTargetList;\n void* pUpdateEditingObject;\n sal_Bool bExecState;\n\n IMapOwnData()\n : pUpdateEditingObject(NULL)\n , bExecState(false)\n {\n }\n};\n\n\n#endif \/\/ _IMAPIMP_HXX\n\n\/* vim:set shiftwidth=4 softtabstop=4 expandtab: *\/\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: optgdlg.hxx,v $\n * $Revision: 1.22 $\n *\n * This file is part of OpenOffice.org.\n *\n * OpenOffice.org is free software: you can redistribute it and\/or modify\n * it under the terms of the GNU Lesser General Public License version 3\n * only, as published by the Free Software Foundation.\n *\n * OpenOffice.org is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the\n * GNU Lesser General Public License version 3 for more details\n * (a copy is included in the LICENSE file that accompanied this code).\n *\n * You should have received a copy of the GNU Lesser General Public License\n * version 3 along with OpenOffice.org. If not, see\n * <http:\/\/www.openoffice.org\/license.html>\n * for a copy of the LGPLv3 License.\n *\n ************************************************************************\/\n#ifndef _OFA_OPTGDLG_HXX\n#define _OFA_OPTGDLG_HXX\n#include <vcl\/lstbox.hxx>\n#include <vcl\/group.hxx>\n#include <vcl\/field.hxx>\n#include <vcl\/fixed.hxx>\n#include <sfx2\/tabdlg.hxx>\n#include <svx\/langbox.hxx>\n#include <readonlyimage.hxx>\n#define FOLDERWEBVIEW_DEFAULTFILE \"folder.so\"\n\n\/\/ class OfaMiscTabPage --------------------------------------------------\n\nclass OfaMiscTabPage : public SfxTabPage\n{\n using TabPage::DeactivatePage;\nprivate:\n FixedLine aHelpFL;\n CheckBox aToolTipsCB;\n CheckBox aExtHelpCB;\n CheckBox aHelpAgentCB;\n PushButton aHelpAgentResetBtn;\n FixedText aHelpFormatFT;\n ListBox aHelpFormatLB;\n\n FixedLine aFileDlgFL;\n ReadOnlyImage aFileDlgROImage;\n CheckBox aFileDlgCB;\n\n FixedLine aPrintDlgFL;\n CheckBox aPrintDlgCB;\n\n FixedLine aDocStatusFL;\n CheckBox aDocStatusCB;\n\n FixedLine aTwoFigureFL;\n FixedText aInterpretFT;\n NumericField aYearValueField;\n FixedText aToYearFT;\n\n String aStrDateInfo;\n\n DECL_LINK( TwoFigureHdl, NumericField* );\n DECL_LINK( TwoFigureConfigHdl, NumericField* );\n DECL_LINK( HelpCheckHdl_Impl, CheckBox* );\n DECL_LINK( HelpAgentResetHdl_Impl, PushButton* );\nprotected:\n virtual int DeactivatePage( SfxItemSet* pSet = NULL );\n\npublic:\n OfaMiscTabPage( Window* pParent, const SfxItemSet& rSet );\n ~OfaMiscTabPage();\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\n\/\/ class OfaViewTabPage --------------------------------------------------\nclass SvtTabAppearanceCfg;\n\nclass OfaViewTabPage : public SfxTabPage\n{\nprivate:\n FixedLine aUserInterfaceFL;\n FixedText aWindowSizeFT;\n MetricField aWindowSizeMF;\n FixedText aIconSizeStyleFT;\n ListBox aIconSizeLB;\n ListBox aIconStyleLB;\n CheckBox m_aSystemFont;\n\n#if defined( UNX )\n CheckBox aFontAntiAliasing;\n FixedText aAAPointLimitLabel;\n NumericField aAAPointLimit;\n FixedText aAAPointLimitUnits;\n#endif\n\n FixedLine aMenuFL;\n CheckBox aMenuIconsCB;\n\n FixedLine aFontListsFL;\n CheckBox aFontShowCB;\n CheckBox aFontHistoryCB;\n\n FixedLine a3DGB;\n CheckBox a3DOpenGLCB;\n CheckBox a3DOpenGLFasterCB;\n CheckBox a3DDitheringCB;\n CheckBox a3DShowFullCB;\n\n FixedLine aRenderingFL;\n CheckBox aUseHardwareAccell;\n\n FixedLine aMouseFL;\n FixedText aMousePosFT;\n ListBox aMousePosLB;\n FixedText aMouseMiddleFT;\n ListBox aMouseMiddleLB;\n\n UINT16 nSizeLB_InitialSelection;\n UINT16 nStyleLB_InitialSelection;\n BOOL bSfxSymbolsAuto;\n\n SvtTabAppearanceCfg* pAppearanceCfg;\n\n DECL_LINK( OpenGLHdl, CheckBox* );\n#if defined( UNX )\n DECL_LINK( OnAntialiasingToggled, void* );\n#endif\npublic:\n OfaViewTabPage( Window* pParent, const SfxItemSet& rSet );\n ~OfaViewTabPage();\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\/* -----------------------------23.11.00 13:04--------------------------------\n\n ---------------------------------------------------------------------------*\/\nstruct LanguageConfig_Impl;\nclass OfaLanguagesTabPage : public SfxTabPage\n{\n FixedLine aUILanguageGB;\n ReadOnlyImage aLocaleSettingFI;\n FixedText aUserInterfaceFT;\n ListBox aUserInterfaceLB;\n FixedText aLocaleSettingFT;\n SvxLanguageBox aLocaleSettingLB;\n ReadOnlyImage aCurrencyFI;\n FixedText aDecimalSeparatorFT;\n CheckBox aDecimalSeparatorCB;\n FixedText aCurrencyFT;\n ListBox aCurrencyLB;\n\n FixedLine aLinguLanguageGB;\n ReadOnlyImage aWesternLanguageFI;\n FixedText aWesternLanguageFT;\n SvxLanguageBox aWesternLanguageLB;\n ReadOnlyImage aAsianLanguageFI;\n FixedText aAsianLanguageFT;\n SvxLanguageBox aAsianLanguageLB;\n ReadOnlyImage aComplexLanguageFI;\n FixedText aComplexLanguageFT;\n SvxLanguageBox aComplexLanguageLB;\n CheckBox aCurrentDocCB;\n FixedLine aEnhancedFL;\n ReadOnlyImage aAsianSupportFI;\n CheckBox aAsianSupportCB;\n ReadOnlyImage aCTLSupportFI;\n CheckBox aCTLSupportCB;\n\n const String sDecimalSeparatorLabel;\n\n sal_Bool m_bOldAsian;\n sal_Bool m_bOldCtl;\n LanguageConfig_Impl* pLangConfig;\n\n rtl::OUString m_sUserLocaleValue;\n\n DECL_LINK( SupportHdl, CheckBox* ) ;\n DECL_LINK( LocaleSettingHdl, SvxLanguageBox* ) ;\n\npublic:\n OfaLanguagesTabPage( Window* pParent, const SfxItemSet& rSet );\n ~OfaLanguagesTabPage();\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#endif \/\/ #ifndef _OFA_OPTGDLG_HXX\n\n\n<commit_msg>INTEGRATION: CWS canvas05 (1.20.276); FILE MERGED 2008\/04\/21 07:42:36 thb 1.20.276.3: RESYNC: (1.21-1.22); FILE MERGED 2008\/04\/07 14:36:29 thb 1.20.276.2: RESYNC: (1.20-1.21); FILE MERGED 2008\/01\/25 14:29:51 thb 1.20.276.1: #i81092# Adapted to canvas changes<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: optgdlg.hxx,v $\n * $Revision: 1.23 $\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 _OFA_OPTGDLG_HXX\n#define _OFA_OPTGDLG_HXX\n#include <vcl\/lstbox.hxx>\n#include <vcl\/group.hxx>\n#include <vcl\/field.hxx>\n#include <vcl\/fixed.hxx>\n#include <sfx2\/tabdlg.hxx>\n#include <svx\/langbox.hxx>\n#include <readonlyimage.hxx>\n#define FOLDERWEBVIEW_DEFAULTFILE \"folder.so\"\n\nclass CanvasSettings;\n\n\/\/ class OfaMiscTabPage --------------------------------------------------\n\nclass OfaMiscTabPage : public SfxTabPage\n{\n using TabPage::DeactivatePage;\nprivate:\n FixedLine aHelpFL;\n CheckBox aToolTipsCB;\n CheckBox aExtHelpCB;\n CheckBox aHelpAgentCB;\n PushButton aHelpAgentResetBtn;\n FixedText aHelpFormatFT;\n ListBox aHelpFormatLB;\n\n FixedLine aFileDlgFL;\n ReadOnlyImage aFileDlgROImage;\n CheckBox aFileDlgCB;\n\n FixedLine aPrintDlgFL;\n CheckBox aPrintDlgCB;\n\n FixedLine aDocStatusFL;\n CheckBox aDocStatusCB;\n\n FixedLine aTwoFigureFL;\n FixedText aInterpretFT;\n NumericField aYearValueField;\n FixedText aToYearFT;\n\n String aStrDateInfo;\n\n DECL_LINK( TwoFigureHdl, NumericField* );\n DECL_LINK( TwoFigureConfigHdl, NumericField* );\n DECL_LINK( HelpCheckHdl_Impl, CheckBox* );\n DECL_LINK( HelpAgentResetHdl_Impl, PushButton* );\nprotected:\n virtual int DeactivatePage( SfxItemSet* pSet = NULL );\n\npublic:\n OfaMiscTabPage( Window* pParent, const SfxItemSet& rSet );\n ~OfaMiscTabPage();\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\n\/\/ class OfaViewTabPage --------------------------------------------------\nclass SvtTabAppearanceCfg;\n\nclass OfaViewTabPage : public SfxTabPage\n{\nprivate:\n FixedLine aUserInterfaceFL;\n FixedText aWindowSizeFT;\n MetricField aWindowSizeMF;\n FixedText aIconSizeStyleFT;\n ListBox aIconSizeLB;\n ListBox aIconStyleLB;\n CheckBox m_aSystemFont;\n\n#if defined( UNX )\n CheckBox aFontAntiAliasing;\n FixedText aAAPointLimitLabel;\n NumericField aAAPointLimit;\n FixedText aAAPointLimitUnits;\n#endif\n\n FixedLine aMenuFL;\n CheckBox aMenuIconsCB;\n\n FixedLine aFontListsFL;\n CheckBox aFontShowCB;\n CheckBox aFontHistoryCB;\n\n FixedLine a3DGB;\n CheckBox a3DOpenGLCB;\n CheckBox a3DOpenGLFasterCB;\n CheckBox a3DDitheringCB;\n CheckBox a3DShowFullCB;\n\n FixedLine aRenderingFL;\n CheckBox aUseHardwareAccell;\n\n FixedLine aMouseFL;\n FixedText aMousePosFT;\n ListBox aMousePosLB;\n FixedText aMouseMiddleFT;\n ListBox aMouseMiddleLB;\n\n UINT16 nSizeLB_InitialSelection;\n UINT16 nStyleLB_InitialSelection;\n BOOL bSfxSymbolsAuto;\n\n SvtTabAppearanceCfg* pAppearanceCfg;\n CanvasSettings* pCanvasSettings;\n\n DECL_LINK( OpenGLHdl, CheckBox* );\n#if defined( UNX )\n DECL_LINK( OnAntialiasingToggled, void* );\n#endif\npublic:\n OfaViewTabPage( Window* pParent, const SfxItemSet& rSet );\n ~OfaViewTabPage();\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\/* -----------------------------23.11.00 13:04--------------------------------\n\n ---------------------------------------------------------------------------*\/\nstruct LanguageConfig_Impl;\nclass OfaLanguagesTabPage : public SfxTabPage\n{\n FixedLine aUILanguageGB;\n ReadOnlyImage aLocaleSettingFI;\n FixedText aUserInterfaceFT;\n ListBox aUserInterfaceLB;\n FixedText aLocaleSettingFT;\n SvxLanguageBox aLocaleSettingLB;\n ReadOnlyImage aCurrencyFI;\n FixedText aDecimalSeparatorFT;\n CheckBox aDecimalSeparatorCB;\n FixedText aCurrencyFT;\n ListBox aCurrencyLB;\n\n FixedLine aLinguLanguageGB;\n ReadOnlyImage aWesternLanguageFI;\n FixedText aWesternLanguageFT;\n SvxLanguageBox aWesternLanguageLB;\n ReadOnlyImage aAsianLanguageFI;\n FixedText aAsianLanguageFT;\n SvxLanguageBox aAsianLanguageLB;\n ReadOnlyImage aComplexLanguageFI;\n FixedText aComplexLanguageFT;\n SvxLanguageBox aComplexLanguageLB;\n CheckBox aCurrentDocCB;\n FixedLine aEnhancedFL;\n ReadOnlyImage aAsianSupportFI;\n CheckBox aAsianSupportCB;\n ReadOnlyImage aCTLSupportFI;\n CheckBox aCTLSupportCB;\n\n const String sDecimalSeparatorLabel;\n\n sal_Bool m_bOldAsian;\n sal_Bool m_bOldCtl;\n LanguageConfig_Impl* pLangConfig;\n\n rtl::OUString m_sUserLocaleValue;\n\n DECL_LINK( SupportHdl, CheckBox* ) ;\n DECL_LINK( LocaleSettingHdl, SvxLanguageBox* ) ;\n\npublic:\n OfaLanguagesTabPage( Window* pParent, const SfxItemSet& rSet );\n ~OfaLanguagesTabPage();\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#endif \/\/ #ifndef _OFA_OPTGDLG_HXX\n\n\n<|endoftext|>"} {"text":"<commit_before>\/*************************************************************************\n *\n * $RCSfile: postattr.cxx,v $\n *\n * $Revision: 1.2 $\n *\n * last change: $Author: er $ $Date: 2001-05-13 03:29: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\/\/ include ---------------------------------------------------------------\n\n#pragma hdrstop\n\n#define _SVX_POSTATTR_CXX\n#define ITEMID_AUTHOR 0\n#define ITEMID_DATE 0\n#define ITEMID_TEXT 0\n\n#include \"postattr.hxx\"\n#include \"itemtype.hxx\"\n\n\/\/ -----------------------------------------------------------------------\n\nTYPEINIT1_AUTOFACTORY(SvxPostItAuthorItem, SfxStringItem);\nTYPEINIT1_AUTOFACTORY(SvxPostItDateItem, SfxStringItem);\nTYPEINIT1_AUTOFACTORY(SvxPostItTextItem, SfxStringItem);\n\n\/\/ class SvxPostItAuthorItem ---------------------------------------------\n\nSvxPostItAuthorItem::SvxPostItAuthorItem( sal_uInt16 nWhich )\n{\n SetWhich( nWhich );\n}\n\n\/\/ -----------------------------------------------------------------------\n\nSvxPostItAuthorItem::SvxPostItAuthorItem( const XubString& rAuthor,\n sal_uInt16 nWhich ) :\n SfxStringItem( nWhich, rAuthor )\n{\n}\n\n\/\/------------------------------------------------------------------------\n\nSfxItemPresentation SvxPostItAuthorItem::GetPresentation\n(\n SfxItemPresentation ePres,\n SfxMapUnit eCoreUnit,\n SfxMapUnit ePresUnit,\n XubString& rText, const IntlWrapper *\n) const\n{\n switch ( ePres )\n {\n case SFX_ITEM_PRESENTATION_NONE:\n rText.Erase();\n return SFX_ITEM_PRESENTATION_NONE;\n case SFX_ITEM_PRESENTATION_NAMELESS:\n rText = GetValue();\n return SFX_ITEM_PRESENTATION_NAMELESS;\n case SFX_ITEM_PRESENTATION_COMPLETE:\n rText = SVX_RESSTR(RID_SVXITEMS_AUTHOR_COMPLETE);\n rText += GetValue();\n return SFX_ITEM_PRESENTATION_COMPLETE;\n }\n return SFX_ITEM_PRESENTATION_NONE;\n}\n\n\/\/ -----------------------------------------------------------------------\n\nSfxPoolItem* __EXPORT SvxPostItAuthorItem::Clone( SfxItemPool * ) const\n{\n return new SvxPostItAuthorItem( *this );\n}\n\n\/\/ class SvxPostItDateItem -----------------------------------------------\n\nSvxPostItDateItem::SvxPostItDateItem( sal_uInt16 nWhich )\n{\n SetWhich( nWhich );\n}\n\n\/\/ -----------------------------------------------------------------------\n\nSvxPostItDateItem::SvxPostItDateItem( const XubString& rDate, sal_uInt16 nWhich ) :\n\n SfxStringItem( nWhich, rDate )\n{\n}\n\n\/\/------------------------------------------------------------------------\n\nSfxItemPresentation SvxPostItDateItem::GetPresentation\n(\n SfxItemPresentation ePres,\n SfxMapUnit eCoreUnit,\n SfxMapUnit ePresUnit,\n XubString& rText, const IntlWrapper *\n) const\n{\n switch ( ePres )\n {\n case SFX_ITEM_PRESENTATION_NONE:\n rText.Erase();\n return SFX_ITEM_PRESENTATION_NONE;\n case SFX_ITEM_PRESENTATION_NAMELESS:\n rText = GetValue();\n return SFX_ITEM_PRESENTATION_NAMELESS;\n case SFX_ITEM_PRESENTATION_COMPLETE:\n rText = SVX_RESSTR(RID_SVXITEMS_DATE_COMPLETE);\n rText += GetValue();\n return SFX_ITEM_PRESENTATION_COMPLETE;\n }\n return SFX_ITEM_PRESENTATION_NONE;\n}\n\n\/\/ -----------------------------------------------------------------------\n\nSfxPoolItem* __EXPORT SvxPostItDateItem::Clone( SfxItemPool * ) const\n{\n return new SvxPostItDateItem( *this );\n}\n\n\/\/ class SvxPostItTextItem -----------------------------------------------\n\nSvxPostItTextItem::SvxPostItTextItem( sal_uInt16 nWhich )\n{\n SetWhich( nWhich );\n}\n\n\/\/ -----------------------------------------------------------------------\n\nSvxPostItTextItem::SvxPostItTextItem( const XubString& rText, sal_uInt16 nWhich ) :\n\n SfxStringItem( nWhich, rText )\n{\n}\n\n\/\/------------------------------------------------------------------------\n\nSfxItemPresentation SvxPostItTextItem::GetPresentation\n(\n SfxItemPresentation ePres,\n SfxMapUnit eCoreUnit,\n SfxMapUnit ePresUnit,\n XubString& rText, const IntlWrapper *\n) const\n{\n switch ( ePres )\n {\n case SFX_ITEM_PRESENTATION_NONE:\n rText.Erase();\n return SFX_ITEM_PRESENTATION_NONE;\n case SFX_ITEM_PRESENTATION_NAMELESS:\n rText = GetValue();\n return SFX_ITEM_PRESENTATION_NAMELESS;\n case SFX_ITEM_PRESENTATION_COMPLETE:\n rText = SVX_RESSTR(RID_SVXITEMS_TEXT_COMPLETE);\n rText += GetValue();\n return SFX_ITEM_PRESENTATION_COMPLETE;\n }\n return SFX_ITEM_PRESENTATION_NONE;\n}\n\n\/\/ -----------------------------------------------------------------------\n\nSfxPoolItem* __EXPORT SvxPostItTextItem::Clone( SfxItemPool * ) const\n{\n return new SvxPostItTextItem( *this );\n}\n\n\n<commit_msg>INTEGRATION: CWS ooo19126 (1.2.1658); FILE MERGED 2005\/09\/05 14:25:45 rt 1.2.1658.1: #i54170# Change license header: remove SISSL<commit_after>\/*************************************************************************\n *\n * OpenOffice.org - a multi-platform office productivity suite\n *\n * $RCSfile: postattr.cxx,v $\n *\n * $Revision: 1.3 $\n *\n * last change: $Author: rt $ $Date: 2005-09-08 23:39:05 $\n *\n * The Contents of this file are made available subject to\n * the terms of GNU Lesser General Public License Version 2.1.\n *\n *\n * GNU Lesser General Public License Version 2.1\n * =============================================\n * Copyright 2005 by Sun Microsystems, Inc.\n * 901 San Antonio Road, Palo Alto, CA 94303, USA\n *\n * This library is free software; you can redistribute it and\/or\n * modify it under the terms of the GNU Lesser General Public\n * License version 2.1, as published by the Free Software Foundation.\n *\n * This library is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU\n * Lesser General Public License for more details.\n *\n * You should have received a copy of the GNU Lesser General Public\n * License along with this library; if not, write to the Free Software\n * Foundation, Inc., 59 Temple Place, Suite 330, Boston,\n * MA 02111-1307 USA\n *\n ************************************************************************\/\n\n\/\/ include ---------------------------------------------------------------\n\n#pragma hdrstop\n\n#define _SVX_POSTATTR_CXX\n#define ITEMID_AUTHOR 0\n#define ITEMID_DATE 0\n#define ITEMID_TEXT 0\n\n#include \"postattr.hxx\"\n#include \"itemtype.hxx\"\n\n\/\/ -----------------------------------------------------------------------\n\nTYPEINIT1_AUTOFACTORY(SvxPostItAuthorItem, SfxStringItem);\nTYPEINIT1_AUTOFACTORY(SvxPostItDateItem, SfxStringItem);\nTYPEINIT1_AUTOFACTORY(SvxPostItTextItem, SfxStringItem);\n\n\/\/ class SvxPostItAuthorItem ---------------------------------------------\n\nSvxPostItAuthorItem::SvxPostItAuthorItem( sal_uInt16 nWhich )\n{\n SetWhich( nWhich );\n}\n\n\/\/ -----------------------------------------------------------------------\n\nSvxPostItAuthorItem::SvxPostItAuthorItem( const XubString& rAuthor,\n sal_uInt16 nWhich ) :\n SfxStringItem( nWhich, rAuthor )\n{\n}\n\n\/\/------------------------------------------------------------------------\n\nSfxItemPresentation SvxPostItAuthorItem::GetPresentation\n(\n SfxItemPresentation ePres,\n SfxMapUnit eCoreUnit,\n SfxMapUnit ePresUnit,\n XubString& rText, const IntlWrapper *\n) const\n{\n switch ( ePres )\n {\n case SFX_ITEM_PRESENTATION_NONE:\n rText.Erase();\n return SFX_ITEM_PRESENTATION_NONE;\n case SFX_ITEM_PRESENTATION_NAMELESS:\n rText = GetValue();\n return SFX_ITEM_PRESENTATION_NAMELESS;\n case SFX_ITEM_PRESENTATION_COMPLETE:\n rText = SVX_RESSTR(RID_SVXITEMS_AUTHOR_COMPLETE);\n rText += GetValue();\n return SFX_ITEM_PRESENTATION_COMPLETE;\n }\n return SFX_ITEM_PRESENTATION_NONE;\n}\n\n\/\/ -----------------------------------------------------------------------\n\nSfxPoolItem* __EXPORT SvxPostItAuthorItem::Clone( SfxItemPool * ) const\n{\n return new SvxPostItAuthorItem( *this );\n}\n\n\/\/ class SvxPostItDateItem -----------------------------------------------\n\nSvxPostItDateItem::SvxPostItDateItem( sal_uInt16 nWhich )\n{\n SetWhich( nWhich );\n}\n\n\/\/ -----------------------------------------------------------------------\n\nSvxPostItDateItem::SvxPostItDateItem( const XubString& rDate, sal_uInt16 nWhich ) :\n\n SfxStringItem( nWhich, rDate )\n{\n}\n\n\/\/------------------------------------------------------------------------\n\nSfxItemPresentation SvxPostItDateItem::GetPresentation\n(\n SfxItemPresentation ePres,\n SfxMapUnit eCoreUnit,\n SfxMapUnit ePresUnit,\n XubString& rText, const IntlWrapper *\n) const\n{\n switch ( ePres )\n {\n case SFX_ITEM_PRESENTATION_NONE:\n rText.Erase();\n return SFX_ITEM_PRESENTATION_NONE;\n case SFX_ITEM_PRESENTATION_NAMELESS:\n rText = GetValue();\n return SFX_ITEM_PRESENTATION_NAMELESS;\n case SFX_ITEM_PRESENTATION_COMPLETE:\n rText = SVX_RESSTR(RID_SVXITEMS_DATE_COMPLETE);\n rText += GetValue();\n return SFX_ITEM_PRESENTATION_COMPLETE;\n }\n return SFX_ITEM_PRESENTATION_NONE;\n}\n\n\/\/ -----------------------------------------------------------------------\n\nSfxPoolItem* __EXPORT SvxPostItDateItem::Clone( SfxItemPool * ) const\n{\n return new SvxPostItDateItem( *this );\n}\n\n\/\/ class SvxPostItTextItem -----------------------------------------------\n\nSvxPostItTextItem::SvxPostItTextItem( sal_uInt16 nWhich )\n{\n SetWhich( nWhich );\n}\n\n\/\/ -----------------------------------------------------------------------\n\nSvxPostItTextItem::SvxPostItTextItem( const XubString& rText, sal_uInt16 nWhich ) :\n\n SfxStringItem( nWhich, rText )\n{\n}\n\n\/\/------------------------------------------------------------------------\n\nSfxItemPresentation SvxPostItTextItem::GetPresentation\n(\n SfxItemPresentation ePres,\n SfxMapUnit eCoreUnit,\n SfxMapUnit ePresUnit,\n XubString& rText, const IntlWrapper *\n) const\n{\n switch ( ePres )\n {\n case SFX_ITEM_PRESENTATION_NONE:\n rText.Erase();\n return SFX_ITEM_PRESENTATION_NONE;\n case SFX_ITEM_PRESENTATION_NAMELESS:\n rText = GetValue();\n return SFX_ITEM_PRESENTATION_NAMELESS;\n case SFX_ITEM_PRESENTATION_COMPLETE:\n rText = SVX_RESSTR(RID_SVXITEMS_TEXT_COMPLETE);\n rText += GetValue();\n return SFX_ITEM_PRESENTATION_COMPLETE;\n }\n return SFX_ITEM_PRESENTATION_NONE;\n}\n\n\/\/ -----------------------------------------------------------------------\n\nSfxPoolItem* __EXPORT SvxPostItTextItem::Clone( SfxItemPool * ) const\n{\n return new SvxPostItTextItem( *this );\n}\n\n\n<|endoftext|>"} {"text":"<commit_before>\/*************************************************************************\n *\n * OpenOffice.org - a multi-platform office productivity suite\n *\n * $RCSfile: pamtyp.hxx,v $\n *\n * $Revision: 1.7 $\n *\n * last change: $Author: hr $ $Date: 2007-09-27 08:57: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 _PAMTYP_HXX\n#define _PAMTYP_HXX\n\n#ifndef _TXTCMP_HXX \/\/autogen\n#include <svtools\/txtcmp.hxx>\n#endif\n#ifndef _PAM_HXX\n#include <pam.hxx>\n#endif\n#ifndef _NODE_HXX\n#include <node.hxx>\n#endif\n#ifndef _STRING_HXX \/\/autogen\n#include <tools\/string.hxx>\n#endif\n\nclass SwpHints;\nstruct SwPosition;\nclass SwPaM;\nclass SwTxtAttr;\n\n\/\/ Funktions-Deklarationen fuer die Move\/Find-Methoden vom SwPaM\n\nvoid GoStartDoc( SwPosition*);\nvoid GoEndDoc( SwPosition*);\nvoid GoStartSection( SwPosition*);\nvoid GoEndSection( SwPosition*);\nBOOL GoInDoc( SwPaM&, SwMoveFn);\nBOOL GoInSection( SwPaM&, SwMoveFn);\nBOOL GoInNode( SwPaM&, SwMoveFn);\nBOOL GoInCntnt( SwPaM&, SwMoveFn);\nBOOL GoInCntntCells( SwPaM&, SwMoveFn);\nBOOL GoInCntntSkipHidden( SwPaM&, SwMoveFn);\nBOOL GoInCntntCellsSkipHidden( SwPaM&, SwMoveFn);\nconst SwTxtAttr* GetFrwrdTxtHint( const SwpHints&, USHORT&, xub_StrLen );\nconst SwTxtAttr* GetBkwrdTxtHint( const SwpHints&, USHORT&, xub_StrLen );\n\nBOOL GoNext(SwNode* pNd, SwIndex * pIdx, USHORT nMode );\nBOOL GoPrevious(SwNode* pNd, SwIndex * pIdx, USHORT nMode );\nSwCntntNode* GoNextNds( SwNodeIndex * pIdx, BOOL );\nSwCntntNode* GoPreviousNds( SwNodeIndex * pIdx, BOOL );\n\n\/\/ --------- Funktionsdefinitionen fuer die SwCrsrShell --------------\n\nBOOL GoPrevPara( SwPaM&, SwPosPara);\nBOOL GoCurrPara( SwPaM&, SwPosPara);\nBOOL GoNextPara( SwPaM&, SwPosPara);\nBOOL GoPrevSection( SwPaM&, SwPosSection);\nBOOL GoCurrSection( SwPaM&, SwPosSection);\nBOOL GoNextSection( SwPaM&, SwPosSection);\n\n\n\/\/ ------------ Typedefiniton fuer Funktionen ----------------------\n\ntypedef BOOL (*GoNd)( SwNode*, SwIndex*, USHORT );\ntypedef SwCntntNode* (*GoNds)( SwNodeIndex*, BOOL );\ntypedef void (*GoDoc)( SwPosition* );\ntypedef void (*GoSection)( SwPosition* );\ntypedef BOOL (SwPosition:: *CmpOp)( const SwPosition& ) const;\ntypedef const SwTxtAttr* (*GetHint)( const SwpHints&, USHORT&, xub_StrLen );\ntypedef int (utl::TextSearch:: *SearchTxt)( const String&, xub_StrLen*,\n xub_StrLen*, ::com::sun::star::util::SearchResult* );\ntypedef void (SwNodes:: *MvSection)( SwNodeIndex * ) const;\n\n\nstruct SwMoveFnCollection\n{\n GoNd fnNd;\n GoNds fnNds;\n GoDoc fnDoc;\n GoSection fnSections;\n CmpOp fnCmpOp;\n GetHint fnGetHint;\n SearchTxt fnSearch;\n MvSection fnSection;\n};\n\n\/\/ --------- Funktionsdefinitionen fuers Suchen --------------\nSwCntntNode* GetNode( SwPaM&, BOOL&, SwMoveFn, BOOL bInReadOnly = FALSE );\n\n\n\n#endif\n<commit_msg>INTEGRATION: CWS changefileheader (1.7.242); FILE MERGED 2008\/04\/01 15:57:11 thb 1.7.242.3: #i85898# Stripping all external header guards 2008\/04\/01 12:54:08 thb 1.7.242.2: #i85898# Stripping all external header guards 2008\/03\/31 16:54:15 rt 1.7.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: pamtyp.hxx,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#ifndef _PAMTYP_HXX\n#define _PAMTYP_HXX\n\n#include <svtools\/txtcmp.hxx>\n#include <pam.hxx>\n#include <node.hxx>\n#include <tools\/string.hxx>\n\nclass SwpHints;\nstruct SwPosition;\nclass SwPaM;\nclass SwTxtAttr;\n\n\/\/ Funktions-Deklarationen fuer die Move\/Find-Methoden vom SwPaM\n\nvoid GoStartDoc( SwPosition*);\nvoid GoEndDoc( SwPosition*);\nvoid GoStartSection( SwPosition*);\nvoid GoEndSection( SwPosition*);\nBOOL GoInDoc( SwPaM&, SwMoveFn);\nBOOL GoInSection( SwPaM&, SwMoveFn);\nBOOL GoInNode( SwPaM&, SwMoveFn);\nBOOL GoInCntnt( SwPaM&, SwMoveFn);\nBOOL GoInCntntCells( SwPaM&, SwMoveFn);\nBOOL GoInCntntSkipHidden( SwPaM&, SwMoveFn);\nBOOL GoInCntntCellsSkipHidden( SwPaM&, SwMoveFn);\nconst SwTxtAttr* GetFrwrdTxtHint( const SwpHints&, USHORT&, xub_StrLen );\nconst SwTxtAttr* GetBkwrdTxtHint( const SwpHints&, USHORT&, xub_StrLen );\n\nBOOL GoNext(SwNode* pNd, SwIndex * pIdx, USHORT nMode );\nBOOL GoPrevious(SwNode* pNd, SwIndex * pIdx, USHORT nMode );\nSwCntntNode* GoNextNds( SwNodeIndex * pIdx, BOOL );\nSwCntntNode* GoPreviousNds( SwNodeIndex * pIdx, BOOL );\n\n\/\/ --------- Funktionsdefinitionen fuer die SwCrsrShell --------------\n\nBOOL GoPrevPara( SwPaM&, SwPosPara);\nBOOL GoCurrPara( SwPaM&, SwPosPara);\nBOOL GoNextPara( SwPaM&, SwPosPara);\nBOOL GoPrevSection( SwPaM&, SwPosSection);\nBOOL GoCurrSection( SwPaM&, SwPosSection);\nBOOL GoNextSection( SwPaM&, SwPosSection);\n\n\n\/\/ ------------ Typedefiniton fuer Funktionen ----------------------\n\ntypedef BOOL (*GoNd)( SwNode*, SwIndex*, USHORT );\ntypedef SwCntntNode* (*GoNds)( SwNodeIndex*, BOOL );\ntypedef void (*GoDoc)( SwPosition* );\ntypedef void (*GoSection)( SwPosition* );\ntypedef BOOL (SwPosition:: *CmpOp)( const SwPosition& ) const;\ntypedef const SwTxtAttr* (*GetHint)( const SwpHints&, USHORT&, xub_StrLen );\ntypedef int (utl::TextSearch:: *SearchTxt)( const String&, xub_StrLen*,\n xub_StrLen*, ::com::sun::star::util::SearchResult* );\ntypedef void (SwNodes:: *MvSection)( SwNodeIndex * ) const;\n\n\nstruct SwMoveFnCollection\n{\n GoNd fnNd;\n GoNds fnNds;\n GoDoc fnDoc;\n GoSection fnSections;\n CmpOp fnCmpOp;\n GetHint fnGetHint;\n SearchTxt fnSearch;\n MvSection fnSection;\n};\n\n\/\/ --------- Funktionsdefinitionen fuers Suchen --------------\nSwCntntNode* GetNode( SwPaM&, BOOL&, SwMoveFn, BOOL bInReadOnly = FALSE );\n\n\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#include <vcl\/msgbox.hxx>\n#include <sfx2\/basedlgs.hxx>\n#include <sfx2\/viewfrm.hxx>\n#include <sfx2\/request.hxx>\n#include <sfx2\/app.hxx>\n#include <svx\/optgenrl.hxx>\n#include <docufld.hxx>\n#include <expfld.hxx>\n#include <view.hxx>\n#include <dbfld.hxx>\n#include <wrtsh.hxx>\n#include <flddb.hxx>\n#include <flddinf.hxx>\n#include <fldvar.hxx>\n#include <flddok.hxx>\n#include <fldfunc.hxx>\n#include <fldref.hxx>\n#include <fldedt.hxx>\n#include <crsskip.hxx>\n\n#include <cmdid.h>\n#include <helpid.h>\n#include <globals.hrc>\n#include <fldui.hrc>\n#include \"swabstdlg.hxx\"\n#include \"dialog.hrc\"\n\n#include <com\/sun\/star\/document\/XDocumentProperties.hpp>\n#include <com\/sun\/star\/document\/XDocumentPropertiesSupplier.hpp>\n\nnamespace swui\n{\n SwAbstractDialogFactory * GetFactory();\n}\n\nSwFldEditDlg::SwFldEditDlg(SwView& rVw)\n : SfxSingleTabDialog(&rVw.GetViewFrame()->GetWindow(), 0,\n \"EditFieldDialog\", \"modules\/swriter\/ui\/editfielddialog.ui\")\n , pSh(rVw.GetWrtShellPtr())\n{\n get(m_pPrevBT, \"prev\");\n get(m_pNextBT, \"next\");\n get(m_pAddressBT, \"edit\");\n\n SwFldMgr aMgr(pSh);\n\n SwField *pCurFld = aMgr.GetCurFld();\n if(!pCurFld)\n return;\n\n pSh->SetCareWin(this);\n\n if ( pSh->CrsrInsideInputFld() )\n {\n \/\/ move cursor to start of Input Field\n SwInputField* pInputFld = dynamic_cast<SwInputField*>(pCurFld);\n if ( pInputFld != NULL\n && pInputFld->GetFmtFld() != NULL )\n {\n pSh->GotoField( *(pInputFld->GetFmtFld()) );\n }\n }\n\n if ( ! pSh->HasSelection() )\n {\n pSh->Right(CRSR_SKIP_CHARS, true, 1, false);\n }\n\n pSh->NormalizePam();\n\n sal_uInt16 nGroup = aMgr.GetGroup(false, pCurFld->GetTypeId(), pCurFld->GetSubType());\n\n CreatePage(nGroup);\n\n GetOKButton()->SetClickHdl(LINK(this, SwFldEditDlg, OKHdl));\n\n m_pPrevBT->SetClickHdl(LINK(this, SwFldEditDlg, NextPrevHdl));\n m_pNextBT->SetClickHdl(LINK(this, SwFldEditDlg, NextPrevHdl));\n\n m_pAddressBT->SetClickHdl(LINK(this, SwFldEditDlg, AddressHdl));\n\n Init();\n}\n\n\/*--------------------------------------------------------------------\n Description: initialise controls\n --------------------------------------------------------------------*\/\nvoid SwFldEditDlg::Init()\n{\n SwFldPage* pTabPage = (SwFldPage*)GetTabPage();\n\n if( pTabPage )\n {\n SwFldMgr& rMgr = pTabPage->GetFldMgr();\n\n SwField *pCurFld = rMgr.GetCurFld();\n\n if(!pCurFld)\n return;\n\n \/\/ Traveling only when more than one field\n pSh->StartAction();\n pSh->CreateCrsr();\n\n sal_Bool bMove = rMgr.GoNext();\n if( bMove )\n rMgr.GoPrev();\n m_pNextBT->Enable(bMove);\n\n if( 0 != ( bMove = rMgr.GoPrev() ) )\n rMgr.GoNext();\n m_pPrevBT->Enable( bMove );\n\n if (pCurFld->GetTypeId() == TYP_EXTUSERFLD)\n m_pAddressBT->Show();\n\n pSh->DestroyCrsr();\n pSh->EndAction();\n }\n\n GetOKButton()->Enable( !pSh->IsReadOnlyAvailable() ||\n !pSh->HasReadonlySel() );\n}\n\nSfxTabPage* SwFldEditDlg::CreatePage(sal_uInt16 nGroup)\n{\n \/\/ create TabPage\n SfxTabPage* pTabPage = 0;\n\n switch (nGroup)\n {\n case GRP_DOC:\n pTabPage = SwFldDokPage::Create(get_content_area(), *(SfxItemSet*)0);\n break;\n case GRP_FKT:\n pTabPage = SwFldFuncPage::Create(get_content_area(), *(SfxItemSet*)0);\n break;\n case GRP_REF:\n pTabPage = SwFldRefPage::Create(get_content_area(), *(SfxItemSet*)0);\n break;\n case GRP_REG:\n {\n SfxObjectShell* pDocSh = SfxObjectShell::Current();\n SfxItemSet* pSet = new SfxItemSet( pDocSh->GetPool(), SID_DOCINFO, SID_DOCINFO );\n using namespace ::com::sun::star;\n uno::Reference<document::XDocumentPropertiesSupplier> xDPS(\n pDocSh->GetModel(), uno::UNO_QUERY_THROW);\n uno::Reference<document::XDocumentProperties> xDocProps\n = xDPS->getDocumentProperties();\n uno::Reference< beans::XPropertySet > xUDProps(\n xDocProps->getUserDefinedProperties(),\n uno::UNO_QUERY_THROW);\n pSet->Put( SfxUnoAnyItem( SID_DOCINFO, uno::makeAny(xUDProps) ) );\n pTabPage = SwFldDokInfPage::Create(get_content_area(), *pSet);\n break;\n }\n case GRP_DB:\n pTabPage = SwFldDBPage::Create(get_content_area(), *(SfxItemSet*)0);\n static_cast<SwFldDBPage*>(pTabPage)->SetWrtShell(*pSh);\n break;\n case GRP_VAR:\n pTabPage = SwFldVarPage::Create(get_content_area(), *(SfxItemSet*)0);\n break;\n\n }\n\n static_cast<SwFldPage*>(pTabPage)->SetWrtShell(pSh);\n\n SetTabPage(pTabPage);\n\n return pTabPage;\n}\n\nSwFldEditDlg::~SwFldEditDlg()\n{\n pSh->SetCareWin(NULL);\n pSh->EnterStdMode();\n}\n\nvoid SwFldEditDlg::EnableInsert(sal_Bool bEnable)\n{\n if( bEnable && pSh->IsReadOnlyAvailable() && pSh->HasReadonlySel() )\n bEnable = sal_False;\n GetOKButton()->Enable( bEnable );\n}\n\nvoid SwFldEditDlg::InsertHdl()\n{\n GetOKButton()->Click();\n}\n\n\/*--------------------------------------------------------------------\n Description: kick off changing of the field\n --------------------------------------------------------------------*\/\nIMPL_LINK_NOARG(SwFldEditDlg, OKHdl)\n{\n if (GetOKButton()->IsEnabled())\n {\n SfxTabPage* pTabPage = GetTabPage();\n if (pTabPage)\n {\n pTabPage->FillItemSet(*(SfxItemSet*)0);\n\n }\n EndDialog( RET_OK );\n }\n\n return 0;\n}\n\nshort SwFldEditDlg::Execute()\n{\n \/\/ without TabPage no dialog\n return GetTabPage() ? Dialog::Execute() : static_cast<short>(RET_CANCEL);\n}\n\n\/*--------------------------------------------------------------------\n Description: Traveling between fields of the same type\n --------------------------------------------------------------------*\/\nIMPL_LINK( SwFldEditDlg, NextPrevHdl, Button *, pButton )\n{\n bool bNext = pButton == m_pNextBT;\n\n pSh->EnterStdMode();\n\n SwFieldType *pOldTyp = 0;\n SwFldPage* pTabPage = (SwFldPage*)GetTabPage();\n\n \/\/#112462# FillItemSet may delete the current field\n \/\/that's why it has to be called before accessing the current field\n if( GetOKButton()->IsEnabled() )\n pTabPage->FillItemSet(*(SfxItemSet*)0);\n\n SwFldMgr& rMgr = pTabPage->GetFldMgr();\n SwField *pCurFld = rMgr.GetCurFld();\n if (pCurFld->GetTypeId() == TYP_DBFLD)\n pOldTyp = (SwDBFieldType*)pCurFld->GetTyp();\n\n rMgr.GoNextPrev( bNext, pOldTyp );\n pCurFld = rMgr.GetCurFld();\n\n \/* #108536# Only create selection if there is none\n already. Normalize PaM instead of swapping. *\/\n if ( ! pSh->HasSelection() )\n pSh->Right(CRSR_SKIP_CHARS, sal_True, 1, sal_False );\n\n pSh->NormalizePam();\n\n sal_uInt16 nGroup = rMgr.GetGroup(sal_False, pCurFld->GetTypeId(), pCurFld->GetSubType());\n\n if (nGroup != pTabPage->GetGroup())\n pTabPage = (SwFldPage*)CreatePage(nGroup);\n\n pTabPage->EditNewField();\n\n Init();\n\n return 0;\n}\n\nIMPL_LINK_NOARG(SwFldEditDlg, AddressHdl)\n{\n SwFldPage* pTabPage = (SwFldPage*)GetTabPage();\n SwFldMgr& rMgr = pTabPage->GetFldMgr();\n SwField *pCurFld = rMgr.GetCurFld();\n\n SfxItemSet aSet( pSh->GetAttrPool(),\n SID_FIELD_GRABFOCUS, SID_FIELD_GRABFOCUS,\n 0L );\n\n sal_uInt16 nEditPos = UNKNOWN_EDIT;\n\n switch(pCurFld->GetSubType())\n {\n case EU_FIRSTNAME: nEditPos = FIRSTNAME_EDIT; break;\n case EU_NAME: nEditPos = LASTNAME_EDIT; break;\n case EU_SHORTCUT: nEditPos = SHORTNAME_EDIT; break;\n case EU_COMPANY: nEditPos = COMPANY_EDIT; break;\n case EU_STREET: nEditPos = STREET_EDIT; break;\n case EU_TITLE: nEditPos = TITLE_EDIT; break;\n case EU_POSITION: nEditPos = POSITION_EDIT; break;\n case EU_PHONE_PRIVATE:nEditPos = TELPRIV_EDIT; break;\n case EU_PHONE_COMPANY:nEditPos = TELCOMPANY_EDIT; break;\n case EU_FAX: nEditPos = FAX_EDIT; break;\n case EU_EMAIL: nEditPos = EMAIL_EDIT; break;\n case EU_COUNTRY: nEditPos = COUNTRY_EDIT; break;\n case EU_ZIP: nEditPos = PLZ_EDIT; break;\n case EU_CITY: nEditPos = CITY_EDIT; break;\n case EU_STATE: nEditPos = STATE_EDIT; break;\n\n default: nEditPos = UNKNOWN_EDIT; break;\n\n }\n aSet.Put(SfxUInt16Item(SID_FIELD_GRABFOCUS, nEditPos));\n SwAbstractDialogFactory* pFact = swui::GetFactory();\n OSL_ENSURE(pFact, \"SwAbstractDialogFactory fail!\");\n\n SfxAbstractDialog* pDlg = pFact->CreateSfxDialog( this, aSet,\n pSh->GetView().GetViewFrame()->GetFrame().GetFrameInterface(),\n RC_DLG_ADDR );\n OSL_ENSURE(pDlg, \"Dialogdiet fail!\");\n if(RET_OK == pDlg->Execute())\n {\n pSh->UpdateFlds( *pCurFld );\n }\n delete pDlg;\n return 0;\n}\n\n\/* vim:set shiftwidth=4 softtabstop=4 expandtab: *\/\n<commit_msg>coverity#705015 Explicit null dereferenced<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 <vcl\/msgbox.hxx>\n#include <sfx2\/basedlgs.hxx>\n#include <sfx2\/viewfrm.hxx>\n#include <sfx2\/request.hxx>\n#include <sfx2\/app.hxx>\n#include <svx\/optgenrl.hxx>\n#include <docufld.hxx>\n#include <expfld.hxx>\n#include <view.hxx>\n#include <dbfld.hxx>\n#include <wrtsh.hxx>\n#include <flddb.hxx>\n#include <flddinf.hxx>\n#include <fldvar.hxx>\n#include <flddok.hxx>\n#include <fldfunc.hxx>\n#include <fldref.hxx>\n#include <fldedt.hxx>\n#include <crsskip.hxx>\n\n#include <cmdid.h>\n#include <helpid.h>\n#include <globals.hrc>\n#include <fldui.hrc>\n#include \"swabstdlg.hxx\"\n#include \"dialog.hrc\"\n\n#include <com\/sun\/star\/document\/XDocumentProperties.hpp>\n#include <com\/sun\/star\/document\/XDocumentPropertiesSupplier.hpp>\n\nnamespace swui\n{\n SwAbstractDialogFactory * GetFactory();\n}\n\nSwFldEditDlg::SwFldEditDlg(SwView& rVw)\n : SfxSingleTabDialog(&rVw.GetViewFrame()->GetWindow(), 0,\n \"EditFieldDialog\", \"modules\/swriter\/ui\/editfielddialog.ui\")\n , pSh(rVw.GetWrtShellPtr())\n{\n get(m_pPrevBT, \"prev\");\n get(m_pNextBT, \"next\");\n get(m_pAddressBT, \"edit\");\n\n SwFldMgr aMgr(pSh);\n\n SwField *pCurFld = aMgr.GetCurFld();\n if(!pCurFld)\n return;\n\n pSh->SetCareWin(this);\n\n if ( pSh->CrsrInsideInputFld() )\n {\n \/\/ move cursor to start of Input Field\n SwInputField* pInputFld = dynamic_cast<SwInputField*>(pCurFld);\n if ( pInputFld != NULL\n && pInputFld->GetFmtFld() != NULL )\n {\n pSh->GotoField( *(pInputFld->GetFmtFld()) );\n }\n }\n\n if ( ! pSh->HasSelection() )\n {\n pSh->Right(CRSR_SKIP_CHARS, true, 1, false);\n }\n\n pSh->NormalizePam();\n\n sal_uInt16 nGroup = aMgr.GetGroup(false, pCurFld->GetTypeId(), pCurFld->GetSubType());\n\n CreatePage(nGroup);\n\n GetOKButton()->SetClickHdl(LINK(this, SwFldEditDlg, OKHdl));\n\n m_pPrevBT->SetClickHdl(LINK(this, SwFldEditDlg, NextPrevHdl));\n m_pNextBT->SetClickHdl(LINK(this, SwFldEditDlg, NextPrevHdl));\n\n m_pAddressBT->SetClickHdl(LINK(this, SwFldEditDlg, AddressHdl));\n\n Init();\n}\n\n\/*--------------------------------------------------------------------\n Description: initialise controls\n --------------------------------------------------------------------*\/\nvoid SwFldEditDlg::Init()\n{\n SwFldPage* pTabPage = (SwFldPage*)GetTabPage();\n\n if( pTabPage )\n {\n SwFldMgr& rMgr = pTabPage->GetFldMgr();\n\n SwField *pCurFld = rMgr.GetCurFld();\n\n if(!pCurFld)\n return;\n\n \/\/ Traveling only when more than one field\n pSh->StartAction();\n pSh->CreateCrsr();\n\n sal_Bool bMove = rMgr.GoNext();\n if( bMove )\n rMgr.GoPrev();\n m_pNextBT->Enable(bMove);\n\n if( 0 != ( bMove = rMgr.GoPrev() ) )\n rMgr.GoNext();\n m_pPrevBT->Enable( bMove );\n\n if (pCurFld->GetTypeId() == TYP_EXTUSERFLD)\n m_pAddressBT->Show();\n\n pSh->DestroyCrsr();\n pSh->EndAction();\n }\n\n GetOKButton()->Enable( !pSh->IsReadOnlyAvailable() ||\n !pSh->HasReadonlySel() );\n}\n\nSfxTabPage* SwFldEditDlg::CreatePage(sal_uInt16 nGroup)\n{\n \/\/ create TabPage\n SfxTabPage* pTabPage = 0;\n\n switch (nGroup)\n {\n case GRP_DOC:\n pTabPage = SwFldDokPage::Create(get_content_area(), *(SfxItemSet*)0);\n break;\n case GRP_FKT:\n pTabPage = SwFldFuncPage::Create(get_content_area(), *(SfxItemSet*)0);\n break;\n case GRP_REF:\n pTabPage = SwFldRefPage::Create(get_content_area(), *(SfxItemSet*)0);\n break;\n case GRP_REG:\n {\n SfxObjectShell* pDocSh = SfxObjectShell::Current();\n SfxItemSet* pSet = new SfxItemSet( pDocSh->GetPool(), SID_DOCINFO, SID_DOCINFO );\n using namespace ::com::sun::star;\n uno::Reference<document::XDocumentPropertiesSupplier> xDPS(\n pDocSh->GetModel(), uno::UNO_QUERY_THROW);\n uno::Reference<document::XDocumentProperties> xDocProps\n = xDPS->getDocumentProperties();\n uno::Reference< beans::XPropertySet > xUDProps(\n xDocProps->getUserDefinedProperties(),\n uno::UNO_QUERY_THROW);\n pSet->Put( SfxUnoAnyItem( SID_DOCINFO, uno::makeAny(xUDProps) ) );\n pTabPage = SwFldDokInfPage::Create(get_content_area(), *pSet);\n break;\n }\n case GRP_DB:\n pTabPage = SwFldDBPage::Create(get_content_area(), *(SfxItemSet*)0);\n static_cast<SwFldDBPage*>(pTabPage)->SetWrtShell(*pSh);\n break;\n case GRP_VAR:\n pTabPage = SwFldVarPage::Create(get_content_area(), *(SfxItemSet*)0);\n break;\n\n }\n\n assert(pTabPage);\n\n if (pTabPage)\n {\n static_cast<SwFldPage*>(pTabPage)->SetWrtShell(pSh);\n SetTabPage(pTabPage);\n }\n\n return pTabPage;\n}\n\nSwFldEditDlg::~SwFldEditDlg()\n{\n pSh->SetCareWin(NULL);\n pSh->EnterStdMode();\n}\n\nvoid SwFldEditDlg::EnableInsert(sal_Bool bEnable)\n{\n if( bEnable && pSh->IsReadOnlyAvailable() && pSh->HasReadonlySel() )\n bEnable = sal_False;\n GetOKButton()->Enable( bEnable );\n}\n\nvoid SwFldEditDlg::InsertHdl()\n{\n GetOKButton()->Click();\n}\n\n\/*--------------------------------------------------------------------\n Description: kick off changing of the field\n --------------------------------------------------------------------*\/\nIMPL_LINK_NOARG(SwFldEditDlg, OKHdl)\n{\n if (GetOKButton()->IsEnabled())\n {\n SfxTabPage* pTabPage = GetTabPage();\n if (pTabPage)\n {\n pTabPage->FillItemSet(*(SfxItemSet*)0);\n\n }\n EndDialog( RET_OK );\n }\n\n return 0;\n}\n\nshort SwFldEditDlg::Execute()\n{\n \/\/ without TabPage no dialog\n return GetTabPage() ? Dialog::Execute() : static_cast<short>(RET_CANCEL);\n}\n\n\/*--------------------------------------------------------------------\n Description: Traveling between fields of the same type\n --------------------------------------------------------------------*\/\nIMPL_LINK( SwFldEditDlg, NextPrevHdl, Button *, pButton )\n{\n bool bNext = pButton == m_pNextBT;\n\n pSh->EnterStdMode();\n\n SwFieldType *pOldTyp = 0;\n SwFldPage* pTabPage = (SwFldPage*)GetTabPage();\n\n \/\/#112462# FillItemSet may delete the current field\n \/\/that's why it has to be called before accessing the current field\n if( GetOKButton()->IsEnabled() )\n pTabPage->FillItemSet(*(SfxItemSet*)0);\n\n SwFldMgr& rMgr = pTabPage->GetFldMgr();\n SwField *pCurFld = rMgr.GetCurFld();\n if (pCurFld->GetTypeId() == TYP_DBFLD)\n pOldTyp = (SwDBFieldType*)pCurFld->GetTyp();\n\n rMgr.GoNextPrev( bNext, pOldTyp );\n pCurFld = rMgr.GetCurFld();\n\n \/* #108536# Only create selection if there is none\n already. Normalize PaM instead of swapping. *\/\n if ( ! pSh->HasSelection() )\n pSh->Right(CRSR_SKIP_CHARS, sal_True, 1, sal_False );\n\n pSh->NormalizePam();\n\n sal_uInt16 nGroup = rMgr.GetGroup(sal_False, pCurFld->GetTypeId(), pCurFld->GetSubType());\n\n if (nGroup != pTabPage->GetGroup())\n pTabPage = (SwFldPage*)CreatePage(nGroup);\n\n pTabPage->EditNewField();\n\n Init();\n\n return 0;\n}\n\nIMPL_LINK_NOARG(SwFldEditDlg, AddressHdl)\n{\n SwFldPage* pTabPage = (SwFldPage*)GetTabPage();\n SwFldMgr& rMgr = pTabPage->GetFldMgr();\n SwField *pCurFld = rMgr.GetCurFld();\n\n SfxItemSet aSet( pSh->GetAttrPool(),\n SID_FIELD_GRABFOCUS, SID_FIELD_GRABFOCUS,\n 0L );\n\n sal_uInt16 nEditPos = UNKNOWN_EDIT;\n\n switch(pCurFld->GetSubType())\n {\n case EU_FIRSTNAME: nEditPos = FIRSTNAME_EDIT; break;\n case EU_NAME: nEditPos = LASTNAME_EDIT; break;\n case EU_SHORTCUT: nEditPos = SHORTNAME_EDIT; break;\n case EU_COMPANY: nEditPos = COMPANY_EDIT; break;\n case EU_STREET: nEditPos = STREET_EDIT; break;\n case EU_TITLE: nEditPos = TITLE_EDIT; break;\n case EU_POSITION: nEditPos = POSITION_EDIT; break;\n case EU_PHONE_PRIVATE:nEditPos = TELPRIV_EDIT; break;\n case EU_PHONE_COMPANY:nEditPos = TELCOMPANY_EDIT; break;\n case EU_FAX: nEditPos = FAX_EDIT; break;\n case EU_EMAIL: nEditPos = EMAIL_EDIT; break;\n case EU_COUNTRY: nEditPos = COUNTRY_EDIT; break;\n case EU_ZIP: nEditPos = PLZ_EDIT; break;\n case EU_CITY: nEditPos = CITY_EDIT; break;\n case EU_STATE: nEditPos = STATE_EDIT; break;\n\n default: nEditPos = UNKNOWN_EDIT; break;\n\n }\n aSet.Put(SfxUInt16Item(SID_FIELD_GRABFOCUS, nEditPos));\n SwAbstractDialogFactory* pFact = swui::GetFactory();\n OSL_ENSURE(pFact, \"SwAbstractDialogFactory fail!\");\n\n SfxAbstractDialog* pDlg = pFact->CreateSfxDialog( this, aSet,\n pSh->GetView().GetViewFrame()->GetFrame().GetFrameInterface(),\n RC_DLG_ADDR );\n OSL_ENSURE(pDlg, \"Dialogdiet fail!\");\n if(RET_OK == pDlg->Execute())\n {\n pSh->UpdateFlds( *pCurFld );\n }\n delete pDlg;\n return 0;\n}\n\n\/* vim:set shiftwidth=4 softtabstop=4 expandtab: *\/\n<|endoftext|>"} {"text":"<commit_before>\n#include \"..\/HuboJmc.hpp\"\n#include \"..\/HuboCanId.hpp\"\n#include \"HuboState\/State.hpp\"\n\nusing namespace HuboCan;\n\nvoid Hubo2PlusBasicJmc::update()\n{\n if(NULL == _pump)\n return;\n\n\/\/ _request_encoder_readings();\n _send_reference_commands();\n}\n\nvoid Hubo2PlusBasicJmc::_request_encoder_readings()\n{\n _frame.can_id = CMD_BYTE;\n\n _frame.data[0] = info.hardware_index;\n _frame.data[1] = GET_ENCODER;\n _frame.data[2] = 0;\n\n _frame.can_dlc = 3;\n\n _pump->add_frame(_frame, info.can_channel, 1);\n}\n\nvoid Hubo2PlusBasicJmc::_send_reference_commands()\n{\n \/\/ TODO\n}\n\nbool Hubo2PlusBasicJmc::decode(const can_frame_t &frame, size_t channel)\n{\n if( channel != info.can_channel )\n return false;\n\n if( frame.can_id - ENCODER_REPLY == info.hardware_index )\n {\n if(frame.can_dlc == 8)\n {\n\/\/ std::cout << \"jmc name: \" << info.name << \" | joint count: \" << joints.size() << std::endl;\n\n for(size_t i=0; i < joints.size(); ++i)\n {\n int32_t encoder = 0;\n for(int j=3; j >= 0; --j)\n {\n encoder = (encoder << 8) + frame.data[j + i*4];\n }\n\n size_t joint_index = joints[i]->info.software_index;\n\/\/ std::cout << \"joint_index: \" << joint_index << std::endl;\n _state->joints[joint_index].position =\n joints[i]->encoder2radian(encoder);\n\n \/\/ TODO: Decide if velocity should be computed here\n }\n return true;\n }\n return false;\n }\n\n\n\n return false;\n}\n<commit_msg>mysterious unrequested encoder readings...<commit_after>\n#include \"..\/HuboJmc.hpp\"\n#include \"..\/HuboCanId.hpp\"\n#include \"HuboState\/State.hpp\"\n\nusing namespace HuboCan;\n\nvoid Hubo2PlusBasicJmc::update()\n{\n if(NULL == _pump)\n return;\n\n \/\/ Somehow the JMCs are spewing out encoder readings even with this commented out\n \/\/ What the hell??\n\/\/ _request_encoder_readings();\n _send_reference_commands();\n}\n\nvoid Hubo2PlusBasicJmc::_request_encoder_readings()\n{\n _frame.can_id = CMD_BYTE;\n\n _frame.data[0] = info.hardware_index;\n _frame.data[1] = GET_ENCODER;\n _frame.data[2] = 0;\n\n _frame.can_dlc = 3;\n\n _pump->add_frame(_frame, info.can_channel, 1);\n}\n\nvoid Hubo2PlusBasicJmc::_send_reference_commands()\n{\n \/\/ TODO\n}\n\nbool Hubo2PlusBasicJmc::decode(const can_frame_t &frame, size_t channel)\n{\n if( channel != info.can_channel )\n return false;\n\n if( frame.can_id - ENCODER_REPLY == info.hardware_index )\n {\n if(frame.can_dlc == 8)\n {\n\/\/ std::cout << \"jmc name: \" << info.name << \" | joint count: \" << joints.size() << std::endl;\n\n for(size_t i=0; i < joints.size(); ++i)\n {\n int32_t encoder = 0;\n for(int j=3; j >= 0; --j)\n {\n encoder = (encoder << 8) + frame.data[j + i*4];\n }\n\n size_t joint_index = joints[i]->info.software_index;\n\/\/ std::cout << \"joint_index: \" << joint_index << std::endl;\n _state->joints[joint_index].position =\n joints[i]->encoder2radian(encoder);\n\n \/\/ TODO: Decide if velocity should be computed here\n }\n return true;\n }\n return false;\n }\n\n\n\n return false;\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\/profiles\/profile.h\"\n#include \"chrome\/browser\/sync\/profile_sync_service_harness.h\"\n#include \"chrome\/browser\/sync\/test\/integration\/bookmarks_helper.h\"\n#include \"chrome\/browser\/sync\/test\/integration\/sync_test.h\"\n\nusing bookmarks_helper::AddFolder;\nusing bookmarks_helper::AddURL;\nusing bookmarks_helper::GetBookmarkBarNode;\nusing bookmarks_helper::GetOtherNode;\nusing bookmarks_helper::ModelMatchesVerifier;\nusing bookmarks_helper::Move;\nusing bookmarks_helper::Remove;\nusing bookmarks_helper::SetTitle;\n\nclass SingleClientBookmarksSyncTest : public SyncTest {\n public:\n SingleClientBookmarksSyncTest() : SyncTest(SINGLE_CLIENT) {}\n virtual ~SingleClientBookmarksSyncTest() {}\n\n private:\n DISALLOW_COPY_AND_ASSIGN(SingleClientBookmarksSyncTest);\n};\n\n\/\/ This test is flaky; http:\/\/crbug.com\/105902.\nIN_PROC_BROWSER_TEST_F(SingleClientBookmarksSyncTest, FLAKY_OfflineToOnline) {\n ASSERT_TRUE(SetupSync()) << \"SetupSync() failed.\";\n\n DisableNetwork(GetProfile(0));\n const BookmarkNode* node = AddFolder(0, L\"title\");\n SetTitle(0, node, L\"new_title\");\n ASSERT_FALSE(GetClient(0)->AwaitFullSyncCompletion(\"Offline state change.\"));\n ASSERT_EQ(ProfileSyncService::Status::OFFLINE_UNSYNCED,\n GetClient(0)->GetStatus().summary);\n\n EnableNetwork(GetProfile(0));\n ASSERT_TRUE(GetClient(0)->AwaitFullSyncCompletion(\"Commit changes.\"));\n ASSERT_EQ(ProfileSyncService::Status::READY,\n GetClient(0)->GetStatus().summary);\n ASSERT_TRUE(ModelMatchesVerifier(0));\n}\n\nIN_PROC_BROWSER_TEST_F(SingleClientBookmarksSyncTest, Sanity) {\n ASSERT_TRUE(SetupClients()) << \"SetupClients() failed.\";\n\n \/\/ Starting state:\n \/\/ other_node\n \/\/ -> top\n \/\/ -> tier1_a\n \/\/ -> http:\/\/mail.google.com \"tier1_a_url0\"\n \/\/ -> http:\/\/www.pandora.com \"tier1_a_url1\"\n \/\/ -> http:\/\/www.facebook.com \"tier1_a_url2\"\n \/\/ -> tier1_b\n \/\/ -> http:\/\/www.nhl.com \"tier1_b_url0\"\n const BookmarkNode* top = AddFolder(0, GetOtherNode(0), 0, L\"top\");\n const BookmarkNode* tier1_a = AddFolder(0, top, 0, L\"tier1_a\");\n const BookmarkNode* tier1_b = AddFolder(0, top, 1, L\"tier1_b\");\n const BookmarkNode* tier1_a_url0 = AddURL(\n 0, tier1_a, 0, L\"tier1_a_url0\", GURL(\"http:\/\/mail.google.com\"));\n const BookmarkNode* tier1_a_url1 = AddURL(\n 0, tier1_a, 1, L\"tier1_a_url1\", GURL(\"http:\/\/www.pandora.com\"));\n const BookmarkNode* tier1_a_url2 = AddURL(\n 0, tier1_a, 2, L\"tier1_a_url2\", GURL(\"http:\/\/www.facebook.com\"));\n const BookmarkNode* tier1_b_url0 = AddURL(\n 0, tier1_b, 0, L\"tier1_b_url0\", GURL(\"http:\/\/www.nhl.com\"));\n\n ASSERT_TRUE(SetupSync()) << \"SetupSync() failed.\";\n ASSERT_TRUE(GetClient(0)->AwaitFullSyncCompletion(\n \"Waiting for initial sync completed.\"));\n ASSERT_TRUE(ModelMatchesVerifier(0));\n\n \/\/ Ultimately we want to end up with the following model; but this test is\n \/\/ more about the journey than the destination.\n \/\/\n \/\/ bookmark_bar\n \/\/ -> CNN (www.cnn.com)\n \/\/ -> tier1_a\n \/\/ -> tier1_a_url2 (www.facebook.com)\n \/\/ -> tier1_a_url1 (www.pandora.com)\n \/\/ -> Porsche (www.porsche.com)\n \/\/ -> Bank of America (www.bankofamerica.com)\n \/\/ -> Seattle Bubble\n \/\/ other_node\n \/\/ -> top\n \/\/ -> tier1_b\n \/\/ -> Wired News (www.wired.com)\n \/\/ -> tier2_b\n \/\/ -> tier1_b_url0\n \/\/ -> tier3_b\n \/\/ -> Toronto Maple Leafs (mapleleafs.nhl.com)\n \/\/ -> Wynn (www.wynnlasvegas.com)\n \/\/ -> tier1_a_url0\n const BookmarkNode* bar = GetBookmarkBarNode(0);\n const BookmarkNode* cnn = AddURL(0, bar, 0, L\"CNN\",\n GURL(\"http:\/\/www.cnn.com\"));\n ASSERT_TRUE(cnn != NULL);\n Move(0, tier1_a, bar, 1);\n ASSERT_TRUE(GetClient(0)->AwaitFullSyncCompletion(\"Bookmark moved.\"));\n ASSERT_TRUE(ModelMatchesVerifier(0));\n\n const BookmarkNode* porsche = AddURL(0, bar, 2, L\"Porsche\",\n GURL(\"http:\/\/www.porsche.com\"));\n \/\/ Rearrange stuff in tier1_a.\n ASSERT_EQ(tier1_a, tier1_a_url2->parent());\n ASSERT_EQ(tier1_a, tier1_a_url1->parent());\n Move(0, tier1_a_url2, tier1_a, 0);\n Move(0, tier1_a_url1, tier1_a, 2);\n ASSERT_TRUE(GetClient(0)->AwaitFullSyncCompletion(\n \"Rearrange stuff in tier1_a\"));\n ASSERT_TRUE(ModelMatchesVerifier(0));\n\n ASSERT_EQ(1, tier1_a_url0->parent()->GetIndexOf(tier1_a_url0));\n Move(0, tier1_a_url0, bar, bar->child_count());\n const BookmarkNode* boa = AddURL(0, bar, bar->child_count(),\n L\"Bank of America\", GURL(\"https:\/\/www.bankofamerica.com\"));\n ASSERT_TRUE(boa != NULL);\n Move(0, tier1_a_url0, top, top->child_count());\n const BookmarkNode* bubble = AddURL(\n 0, bar, bar->child_count(), L\"Seattle Bubble\",\n GURL(\"http:\/\/seattlebubble.com\"));\n ASSERT_TRUE(bubble != NULL);\n const BookmarkNode* wired = AddURL(0, bar, 2, L\"Wired News\",\n GURL(\"http:\/\/www.wired.com\"));\n const BookmarkNode* tier2_b = AddFolder(\n 0, tier1_b, 0, L\"tier2_b\");\n Move(0, tier1_b_url0, tier2_b, 0);\n Move(0, porsche, bar, 0);\n SetTitle(0, wired, L\"News Wired\");\n SetTitle(0, porsche, L\"ICanHazPorsche?\");\n ASSERT_TRUE(GetClient(0)->AwaitFullSyncCompletion(\"Change title.\"));\n ASSERT_TRUE(ModelMatchesVerifier(0));\n\n ASSERT_EQ(tier1_a_url0->id(), top->GetChild(top->child_count() - 1)->id());\n Remove(0, top, top->child_count() - 1);\n Move(0, wired, tier1_b, 0);\n Move(0, porsche, bar, 3);\n const BookmarkNode* tier3_b = AddFolder(0, tier2_b, 1, L\"tier3_b\");\n const BookmarkNode* leafs = AddURL(\n 0, tier1_a, 0, L\"Toronto Maple Leafs\", GURL(\"http:\/\/mapleleafs.nhl.com\"));\n const BookmarkNode* wynn = AddURL(0, bar, 1, L\"Wynn\",\n GURL(\"http:\/\/www.wynnlasvegas.com\"));\n\n Move(0, wynn, tier3_b, 0);\n Move(0, leafs, tier3_b, 0);\n ASSERT_TRUE(GetClient(0)->AwaitFullSyncCompletion(\n \"Move after addition of bookmarks.\"));\n ASSERT_TRUE(ModelMatchesVerifier(0));\n}\n<commit_msg>Depending on when the network change notification fires the client could go to OFFLINE or OFFLINE_UNSYNCED state. Update the code to reflect this.<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\/profiles\/profile.h\"\n#include \"chrome\/browser\/sync\/profile_sync_service_harness.h\"\n#include \"chrome\/browser\/sync\/test\/integration\/bookmarks_helper.h\"\n#include \"chrome\/browser\/sync\/test\/integration\/sync_test.h\"\n\nusing bookmarks_helper::AddFolder;\nusing bookmarks_helper::AddURL;\nusing bookmarks_helper::GetBookmarkBarNode;\nusing bookmarks_helper::GetOtherNode;\nusing bookmarks_helper::ModelMatchesVerifier;\nusing bookmarks_helper::Move;\nusing bookmarks_helper::Remove;\nusing bookmarks_helper::SetTitle;\n\nclass SingleClientBookmarksSyncTest : public SyncTest {\n public:\n SingleClientBookmarksSyncTest() : SyncTest(SINGLE_CLIENT) {}\n virtual ~SingleClientBookmarksSyncTest() {}\n\n private:\n DISALLOW_COPY_AND_ASSIGN(SingleClientBookmarksSyncTest);\n};\n\nIN_PROC_BROWSER_TEST_F(SingleClientBookmarksSyncTest, OfflineToOnline) {\n ASSERT_TRUE(SetupSync()) << \"SetupSync() failed.\";\n\n DisableNetwork(GetProfile(0));\n const BookmarkNode* node = AddFolder(0, L\"title\");\n SetTitle(0, node, L\"new_title\");\n ASSERT_FALSE(GetClient(0)->AwaitFullSyncCompletion(\"Offline state change.\"));\n ProfileSyncService::Status status = GetClient(0)->GetStatus();\n\n \/\/ Depending on when exactly the network change notification occurs the\n \/\/ client could go to OFFLINE_UNSYNCED or OFFLINE. OFFLINE_UNSYNCED indicates\n \/\/ client tried to sync a local change and could not connect to the server.\n \/\/ OFFLINE indicates client received a network change notification of\n \/\/ the disconnection even before it tried to sync.\n ASSERT_TRUE(ProfileSyncService::Status::OFFLINE_UNSYNCED == status.summary ||\n ProfileSyncService::Status::OFFLINE == status.summary);\n\n EnableNetwork(GetProfile(0));\n ASSERT_TRUE(GetClient(0)->AwaitFullSyncCompletion(\"Commit changes.\"));\n ASSERT_EQ(ProfileSyncService::Status::READY,\n GetClient(0)->GetStatus().summary);\n ASSERT_TRUE(ModelMatchesVerifier(0));\n}\n\nIN_PROC_BROWSER_TEST_F(SingleClientBookmarksSyncTest, Sanity) {\n ASSERT_TRUE(SetupClients()) << \"SetupClients() failed.\";\n\n \/\/ Starting state:\n \/\/ other_node\n \/\/ -> top\n \/\/ -> tier1_a\n \/\/ -> http:\/\/mail.google.com \"tier1_a_url0\"\n \/\/ -> http:\/\/www.pandora.com \"tier1_a_url1\"\n \/\/ -> http:\/\/www.facebook.com \"tier1_a_url2\"\n \/\/ -> tier1_b\n \/\/ -> http:\/\/www.nhl.com \"tier1_b_url0\"\n const BookmarkNode* top = AddFolder(0, GetOtherNode(0), 0, L\"top\");\n const BookmarkNode* tier1_a = AddFolder(0, top, 0, L\"tier1_a\");\n const BookmarkNode* tier1_b = AddFolder(0, top, 1, L\"tier1_b\");\n const BookmarkNode* tier1_a_url0 = AddURL(\n 0, tier1_a, 0, L\"tier1_a_url0\", GURL(\"http:\/\/mail.google.com\"));\n const BookmarkNode* tier1_a_url1 = AddURL(\n 0, tier1_a, 1, L\"tier1_a_url1\", GURL(\"http:\/\/www.pandora.com\"));\n const BookmarkNode* tier1_a_url2 = AddURL(\n 0, tier1_a, 2, L\"tier1_a_url2\", GURL(\"http:\/\/www.facebook.com\"));\n const BookmarkNode* tier1_b_url0 = AddURL(\n 0, tier1_b, 0, L\"tier1_b_url0\", GURL(\"http:\/\/www.nhl.com\"));\n\n ASSERT_TRUE(SetupSync()) << \"SetupSync() failed.\";\n ASSERT_TRUE(GetClient(0)->AwaitFullSyncCompletion(\n \"Waiting for initial sync completed.\"));\n ASSERT_TRUE(ModelMatchesVerifier(0));\n\n \/\/ Ultimately we want to end up with the following model; but this test is\n \/\/ more about the journey than the destination.\n \/\/\n \/\/ bookmark_bar\n \/\/ -> CNN (www.cnn.com)\n \/\/ -> tier1_a\n \/\/ -> tier1_a_url2 (www.facebook.com)\n \/\/ -> tier1_a_url1 (www.pandora.com)\n \/\/ -> Porsche (www.porsche.com)\n \/\/ -> Bank of America (www.bankofamerica.com)\n \/\/ -> Seattle Bubble\n \/\/ other_node\n \/\/ -> top\n \/\/ -> tier1_b\n \/\/ -> Wired News (www.wired.com)\n \/\/ -> tier2_b\n \/\/ -> tier1_b_url0\n \/\/ -> tier3_b\n \/\/ -> Toronto Maple Leafs (mapleleafs.nhl.com)\n \/\/ -> Wynn (www.wynnlasvegas.com)\n \/\/ -> tier1_a_url0\n const BookmarkNode* bar = GetBookmarkBarNode(0);\n const BookmarkNode* cnn = AddURL(0, bar, 0, L\"CNN\",\n GURL(\"http:\/\/www.cnn.com\"));\n ASSERT_TRUE(cnn != NULL);\n Move(0, tier1_a, bar, 1);\n ASSERT_TRUE(GetClient(0)->AwaitFullSyncCompletion(\"Bookmark moved.\"));\n ASSERT_TRUE(ModelMatchesVerifier(0));\n\n const BookmarkNode* porsche = AddURL(0, bar, 2, L\"Porsche\",\n GURL(\"http:\/\/www.porsche.com\"));\n \/\/ Rearrange stuff in tier1_a.\n ASSERT_EQ(tier1_a, tier1_a_url2->parent());\n ASSERT_EQ(tier1_a, tier1_a_url1->parent());\n Move(0, tier1_a_url2, tier1_a, 0);\n Move(0, tier1_a_url1, tier1_a, 2);\n ASSERT_TRUE(GetClient(0)->AwaitFullSyncCompletion(\n \"Rearrange stuff in tier1_a\"));\n ASSERT_TRUE(ModelMatchesVerifier(0));\n\n ASSERT_EQ(1, tier1_a_url0->parent()->GetIndexOf(tier1_a_url0));\n Move(0, tier1_a_url0, bar, bar->child_count());\n const BookmarkNode* boa = AddURL(0, bar, bar->child_count(),\n L\"Bank of America\", GURL(\"https:\/\/www.bankofamerica.com\"));\n ASSERT_TRUE(boa != NULL);\n Move(0, tier1_a_url0, top, top->child_count());\n const BookmarkNode* bubble = AddURL(\n 0, bar, bar->child_count(), L\"Seattle Bubble\",\n GURL(\"http:\/\/seattlebubble.com\"));\n ASSERT_TRUE(bubble != NULL);\n const BookmarkNode* wired = AddURL(0, bar, 2, L\"Wired News\",\n GURL(\"http:\/\/www.wired.com\"));\n const BookmarkNode* tier2_b = AddFolder(\n 0, tier1_b, 0, L\"tier2_b\");\n Move(0, tier1_b_url0, tier2_b, 0);\n Move(0, porsche, bar, 0);\n SetTitle(0, wired, L\"News Wired\");\n SetTitle(0, porsche, L\"ICanHazPorsche?\");\n ASSERT_TRUE(GetClient(0)->AwaitFullSyncCompletion(\"Change title.\"));\n ASSERT_TRUE(ModelMatchesVerifier(0));\n\n ASSERT_EQ(tier1_a_url0->id(), top->GetChild(top->child_count() - 1)->id());\n Remove(0, top, top->child_count() - 1);\n Move(0, wired, tier1_b, 0);\n Move(0, porsche, bar, 3);\n const BookmarkNode* tier3_b = AddFolder(0, tier2_b, 1, L\"tier3_b\");\n const BookmarkNode* leafs = AddURL(\n 0, tier1_a, 0, L\"Toronto Maple Leafs\", GURL(\"http:\/\/mapleleafs.nhl.com\"));\n const BookmarkNode* wynn = AddURL(0, bar, 1, L\"Wynn\",\n GURL(\"http:\/\/www.wynnlasvegas.com\"));\n\n Move(0, wynn, tier3_b, 0);\n Move(0, leafs, tier3_b, 0);\n ASSERT_TRUE(GetClient(0)->AwaitFullSyncCompletion(\n \"Move after addition of bookmarks.\"));\n ASSERT_TRUE(ModelMatchesVerifier(0));\n}\n<|endoftext|>"} {"text":"<commit_before>#include <catch.hpp>\n\n#include \"aux\/Aux.hpp\"\n#include \"Chip8.hpp\"\n#include \"CPU.hpp\"\n\nnamespace {\n\nusing namespace Core8;\n\nSCENARIO(\"CPUs can skip instructions if a register equals a constant value\", \"[conditional]\") {\n GIVEN(\"A CPU with some initialized registers\") {\n Aux::TestKit testKit;\n CPU& cpu = testKit.cpu;\n cpu.writeRegister(Chip8::Register::V1, 0x11);\n cpu.writeRegister(Chip8::Register::V4, 0x35);\n const auto pc0 = cpu.getPc();\n\n WHEN(\"the CPU executes a 3XNN opcode on matching register x constant\") {\n cpu.execute(0x3111);\n const auto pc1 = cpu.getPc();\n\n cpu.execute(0x3435);\n const auto pc2 = cpu.getPc();\n\n THEN(\"the CPUs program counter is updated\") {\n REQUIRE(pc1 == pc0 + Chip8::INSTRUCTION_BYTE_SIZE);\n REQUIRE(pc2 == pc0 + 2 * Chip8::INSTRUCTION_BYTE_SIZE);\n }\n }\n AND_WHEN(\"the CPU executes a 3XNN opcode on non-matching register x constant\") {\n cpu.execute(0x31FF);\n const auto pc1 = cpu.getPc();\n\n cpu.execute(0x34EE);\n const auto pc2 = cpu.getPc();\n\n THEN(\"the CPUs program counter is remains unchanged\") {\n REQUIRE(pc1 == pc0);\n REQUIRE(pc2 == pc0);\n }\n }\n }\n}\n\nSCENARIO(\"CPUs can skip instructions if a register differs from a constant\", \"[conditional]\") {\n GIVEN(\"A CPU with some initialized registers\") {\n Aux::TestKit testKit;\n CPU& cpu = testKit.cpu;\n cpu.writeRegister(Chip8::Register::VA, 0x1A);\n cpu.writeRegister(Chip8::Register::VB, 0x2B);\n const auto pc0 = cpu.getPc();\n\n WHEN(\"the CPU executes a 4XNN opcode on non-matching register x constant\") {\n cpu.execute(0x4AA1);\n const auto pc1 = cpu.getPc();\n\n cpu.execute(0x4BB2);\n const auto pc2 = cpu.getPc();\n\n THEN(\"the CPUs program counter is updated\") {\n REQUIRE(pc1 == pc0 + Chip8::INSTRUCTION_BYTE_SIZE);\n REQUIRE(pc2 == pc0 + 2 * Chip8::INSTRUCTION_BYTE_SIZE);\n }\n }\n AND_WHEN(\"the CPU executes a 4XNN opcode on matching register x constant\") {\n cpu.execute(0x4A1A);\n const auto pc1 = cpu.getPc();\n\n cpu.execute(0x4B2B);\n const auto pc2 = cpu.getPc();\n\n THEN(\"the CPUs program counter is remains unchanged\") {\n REQUIRE(pc1 == pc0);\n REQUIRE(pc2 == pc0);\n }\n }\n }\n}\n\nSCENARIO(\"CPUs can skip instructions if a register equals another\", \"[conditional]\") {\n GIVEN(\"A CPU with some initialized registers\") {\n Aux::TestKit testKit;\n CPU& cpu = testKit.cpu;\n cpu.writeRegister(Chip8::Register::V0, 0x47);\n cpu.writeRegister(Chip8::Register::VF, 0xE3);\n cpu.writeRegister(Chip8::Register::V2, 0x47);\n cpu.writeRegister(Chip8::Register::V3, 0xE3);\n cpu.writeRegister(Chip8::Register::V8, 0xE1);\n cpu.writeRegister(Chip8::Register::V9, 0xE0);\n const auto pc0 = cpu.getPc();\n\n WHEN(\"the CPU executes a 5XY0 opcode on matching registers\") {\n cpu.execute(0x5020);\n const auto pc1 = cpu.getPc();\n\n cpu.execute(0x5F30);\n const auto pc2 = cpu.getPc();\n\n THEN(\"the CPUs program counter is updated\") {\n REQUIRE(pc1 == pc0 + Chip8::INSTRUCTION_BYTE_SIZE);\n REQUIRE(pc2 == pc0 + 2 * Chip8::INSTRUCTION_BYTE_SIZE);\n }\n }\n AND_WHEN(\"the CPU executes a 5XY0 opcode on non-matching registers\") {\n cpu.execute(0x5080);\n const auto pc1 = cpu.getPc();\n\n cpu.execute(0x5F90);\n const auto pc2 = cpu.getPc();\n\n THEN(\"the CPUs program counter is remains unchanged\") {\n REQUIRE(pc1 == pc0);\n REQUIRE(pc2 == pc0);\n }\n }\n }\n}\n\nSCENARIO(\"CPUs can skip instructions if a register differs from another\", \"[conditional]\") {\n GIVEN(\"A CPU with some initialized registers\") {\n Aux::TestKit testKit;\n CPU& cpu = testKit.cpu;\n cpu.writeRegister(Chip8::Register::VA, 0xA1);\n cpu.writeRegister(Chip8::Register::VB, 0xB2);\n cpu.writeRegister(Chip8::Register::VC, 0xC3);\n cpu.writeRegister(Chip8::Register::VD, 0xC3);\n cpu.writeRegister(Chip8::Register::VE, 0xB2);\n cpu.writeRegister(Chip8::Register::VF, 0xA1);\n const auto pc0 = cpu.getPc();\n\n WHEN(\"the CPU executes a 9XY0 opcode on non-matching registers\") {\n cpu.execute(0x9AD0);\n const auto pc1 = cpu.getPc();\n\n cpu.execute(0x9BF0);\n const auto pc2 = cpu.getPc();\n\n THEN(\"the CPUs program counter is updated\") {\n REQUIRE(pc1 == pc0 + Chip8::INSTRUCTION_BYTE_SIZE);\n REQUIRE(pc2 == pc0 + 2 * Chip8::INSTRUCTION_BYTE_SIZE);\n }\n }\n AND_WHEN(\"the CPU executes a 9XY0 opcode on matching registers\") {\n cpu.execute(0x9CD0);\n const auto pc1 = cpu.getPc();\n\n cpu.execute(0x9EB0);\n const auto pc2 = cpu.getPc();\n\n THEN(\"the CPUs program counter is remains unchanged\") {\n REQUIRE(pc1 == pc0);\n REQUIRE(pc2 == pc0);\n }\n }\n }\n}\n\n} \/\/ unnamed namespace<commit_msg>Refactor conditional tests<commit_after>#include <catch.hpp>\n\n#include \"aux\/Aux.hpp\"\n#include \"Chip8.hpp\"\n#include \"CPU.hpp\"\n\nnamespace {\n\nstruct CpuFixture {\n Aux::TestKit testKit;\n Core8::CPU& cpu = testKit.cpu;\n};\n\nSCENARIO_METHOD(\n CpuFixture,\n \"CPU skips the next instruction with opcode 3XNN when \"\n \"register X is equal to the constant NN\",\n \"[conditional]\"\n) {\n GIVEN(\"A CPU with initialized register\") {\n cpu.writeRegister(Core8::Chip8::Register::V4, 0x35);\n const auto originalPc = cpu.getPc();\n\n WHEN(\"the CPU executes a 3XNN opcode where register X equals NN\") {\n cpu.execute(0x3435);\n\n THEN(\"the CPUs program counter is updated\") {\n REQUIRE(cpu.getPc() == originalPc + Core8::Chip8::INSTRUCTION_BYTE_SIZE);\n }\n }\n }\n}\n\nSCENARIO_METHOD(\n CpuFixture,\n \"CPU does not skip the next instruction with opcode 3XNN when \"\n \"register X is not equal to the constant NN\",\n \"[conditional]\"\n) {\n GIVEN(\"A CPU with initialized register\") {\n cpu.writeRegister(Core8::Chip8::Register::V4, 0x35);\n const auto originalPc = cpu.getPc();\n\n WHEN(\"the CPU executes a 3XNN opcode where register X is not equal to NN\") {\n cpu.execute(0x3434);\n\n THEN(\"the CPUs program counter is remains unchanged\") {\n REQUIRE(cpu.getPc() == originalPc);\n }\n }\n }\n}\n\nSCENARIO_METHOD(\n CpuFixture,\n \"CPU skips the next instruction with opcode 4XNN when \"\n \"register X is not equal to the constant NN\",\n \"[conditional]\"\n) {\n GIVEN(\"A CPU with initialized register\") {\n cpu.writeRegister(Core8::Chip8::Register::VA, 0x1A);\n const auto originalPc = cpu.getPc();\n\n WHEN(\"the CPU executes a 4XNN opcode where register X is not equal to NN\") {\n cpu.execute(0x4A1B);\n\n THEN(\"the CPUs program counter is updated\") {\n REQUIRE(cpu.getPc() == originalPc + Core8::Chip8::INSTRUCTION_BYTE_SIZE);\n }\n }\n }\n}\n\nSCENARIO_METHOD(\n CpuFixture,\n \"CPU does not skip the next instruction with opcode 4XNN when \"\n \"register X is equal to the constant NN\",\n \"[conditional]\"\n) {\n GIVEN(\"A CPU with initialized register\") {\n cpu.writeRegister(Core8::Chip8::Register::VA, 0x1A);\n const auto originalPc = cpu.getPc();\n\n WHEN(\"the CPU executes a 4XNN opcode where register X equals NN\") {\n cpu.execute(0x4A1A);\n\n THEN(\"the CPUs program counter is remains unchanged\") {\n REQUIRE(cpu.getPc() == originalPc);\n }\n }\n }\n}\n\nSCENARIO_METHOD(\n CpuFixture,\n \"CPU skips the next instruction with opcode 5XY0 when \"\n \"register X is equal to register Y\",\n \"[conditional]\"\n) {\n GIVEN(\"A CPU with initialized registers\") {\n cpu.writeRegister(Core8::Chip8::Register::V0, 0x47);\n cpu.writeRegister(Core8::Chip8::Register::VF, 0x47);\n const auto originalPc = cpu.getPc();\n\n WHEN(\"the CPU executes a 5XY0 opcode where register X equals register Y\") {\n cpu.execute(0x50F0);\n\n THEN(\"the CPUs program counter is updated\") {\n REQUIRE(cpu.getPc() == originalPc + Core8::Chip8::INSTRUCTION_BYTE_SIZE);\n }\n }\n }\n}\n\nSCENARIO_METHOD(\n CpuFixture,\n \"CPU does not skip the next instruction with opcode 5XY0 when \"\n \"register X is not equal to register Y\",\n \"[conditional]\"\n) {\n GIVEN(\"A CPU with initialized registers\") {\n cpu.writeRegister(Core8::Chip8::Register::V0, 0x47);\n cpu.writeRegister(Core8::Chip8::Register::VF, 0x48);\n const auto originalPc = cpu.getPc();\n\n WHEN(\"the CPU executes a 5XY0 opcode where register X is not equal to register Y\") {\n cpu.execute(0x50F0);\n\n THEN(\"the CPUs program counter is remains unchanged\") {\n REQUIRE(cpu.getPc() == originalPc);\n }\n }\n }\n}\n\nSCENARIO_METHOD(\n CpuFixture,\n \"CPU skips the next instruction with opcode 9XY0 when \"\n \"register X is not equal to register Y\",\n \"[conditional]\"\n) {\n GIVEN(\"A CPU with initialized registers\") {\n cpu.writeRegister(Core8::Chip8::Register::V0, 0xFF);\n cpu.writeRegister(Core8::Chip8::Register::VF, 0xFE);\n const auto originalPc = cpu.getPc();\n\n WHEN(\"the CPU executes a 9XY0 opcode where register X is not equal to register Y\") {\n cpu.execute(0x90F0);\n\n THEN(\"the CPUs program counter is updated\") {\n REQUIRE(cpu.getPc() == originalPc + Core8::Chip8::INSTRUCTION_BYTE_SIZE);\n }\n }\n }\n}\n\nSCENARIO_METHOD(\n CpuFixture,\n \"CPU does not skip the next instruction with opcode 9XY0 when \"\n \"register X is equal to register Y\",\n \"[conditional]\"\n) {\n GIVEN(\"A CPU with initialized registers\") {\n cpu.writeRegister(Core8::Chip8::Register::V0, 0xAD);\n cpu.writeRegister(Core8::Chip8::Register::VF, 0xAD);\n const auto originalPc = cpu.getPc();\n\n WHEN(\"the CPU executes a 9XY0 opcode where register X equals register Y\") {\n cpu.execute(0x90F0);\n\n THEN(\"the CPUs program counter is remains unchanged\") {\n REQUIRE(cpu.getPc() == originalPc);\n }\n }\n }\n}\n\n} \/\/ namespace<|endoftext|>"} {"text":"<commit_before>\n#include <nstd\/Debug.h>\n#include <nstd\/Process.h>\n#include <nstd\/Thread.h>\n#include <nstd\/Time.h>\n\nvoid testProcess()\n{\n \/\/ test start() and join()\n {\n Process process;\n#ifdef _WIN32\n uint32 id = process.start(_T(\"cmd \/C \\\"choice \/T 1 \/D N >NUL\\\"\"));\n#else\n uint32 id = process.start(_T(\"sleep 1\"));\n#endif\n ASSERT(id != 0);\n ASSERT(process.isRunning());\n uint32 exitCode = 0xfffa2;\n ASSERT(process.join(exitCode));\n ASSERT(!process.isRunning());\n#ifdef _WIN32\n ASSERT(exitCode == 2);\n#else\n ASSERT(exitCode == 0);\n#endif\n }\n\n \/\/ test open(), read() and join()\n {\n Process process;\n#ifdef _WIN32\n ASSERT(process.open(_T(\"cmd \/C dir\"), Process::stdoutStream));\n#else\n ASSERT(process.open(_T(\"ls\"), Process::stdoutStream));\n#endif\n ASSERT(process.isRunning());\n char buffer[123];\n ASSERT(process.read(buffer, sizeof(buffer)) > 0);\n uint32 exitCode = 0xfffa2;\n ASSERT(process.join(exitCode));\n ASSERT(!process.isRunning());\n ASSERT(exitCode == 0);\n }\n\n \/\/ test wait and interrupt\n {\n Process::interrupt();\n Process* processes[1];\n int64 start = Time::ticks();\n ASSERT(Process::wait(processes, 0) == 0);\n int64 waitDuration = Time::ticks() - start;\n ASSERT(waitDuration < 10);\n }\n {\n struct InterrupterThread\n {\n static uint32 proc(void*)\n {\n Thread::sleep(30);\n Process::interrupt();\n return 0;\n }\n };\n Thread thread;\n thread.start(InterrupterThread::proc, 0);\n Process* processes[1];\n int64 start = Time::ticks();\n ASSERT(Process::wait(processes, 0) == 0);\n int64 waitDuration = Time::ticks() - start;\n ASSERT(waitDuration > 20);\n }\n\n \/\/ test wait\n {\n Process process;\n Process process2;\n#ifdef _WIN32\n ASSERT(process.open(_T(\"cmd \/C dir\")) != 0);\n ASSERT(process2.start(_T(\"cmd \/C \\\"choice \/T 1 \/D N >NUL\\\"\")) != 0);\n#else\n ASSERT(process.open(_T(\"ls\")) != 0);\n ASSERT(process2.start(_T(\"sleep 1\")) != 0);\n#endif\n Process* processes[] = {&process2, &process};\n ASSERT(Process::wait(processes, 2) == &process);\n uint32 exitCode;\n ASSERT(process.join(exitCode));\n ASSERT(exitCode == 0);\n ASSERT(Process::wait(processes, 1) == &process2);\n ASSERT(process2.join(exitCode));\n#ifdef _WIN32\n ASSERT(exitCode == 2);\n#else\n ASSERT(exitCode == 0);\n#endif\n }\n}\n<commit_msg>Process: Make interrupt test less likely to fail<commit_after>\n#include <nstd\/Debug.h>\n#include <nstd\/Process.h>\n#include <nstd\/Thread.h>\n#include <nstd\/Time.h>\n\nvoid testProcess()\n{\n \/\/ test start() and join()\n {\n Process process;\n#ifdef _WIN32\n uint32 id = process.start(_T(\"cmd \/C \\\"choice \/T 1 \/D N >NUL\\\"\"));\n#else\n uint32 id = process.start(_T(\"sleep 1\"));\n#endif\n ASSERT(id != 0);\n ASSERT(process.isRunning());\n uint32 exitCode = 0xfffa2;\n ASSERT(process.join(exitCode));\n ASSERT(!process.isRunning());\n#ifdef _WIN32\n ASSERT(exitCode == 2);\n#else\n ASSERT(exitCode == 0);\n#endif\n }\n\n \/\/ test open(), read() and join()\n {\n Process process;\n#ifdef _WIN32\n ASSERT(process.open(_T(\"cmd \/C dir\"), Process::stdoutStream));\n#else\n ASSERT(process.open(_T(\"ls\"), Process::stdoutStream));\n#endif\n ASSERT(process.isRunning());\n char buffer[123];\n ASSERT(process.read(buffer, sizeof(buffer)) > 0);\n uint32 exitCode = 0xfffa2;\n ASSERT(process.join(exitCode));\n ASSERT(!process.isRunning());\n ASSERT(exitCode == 0);\n }\n\n \/\/ test wait and interrupt\n {\n Process::interrupt();\n Process* processes[1];\n int64 start = Time::ticks();\n ASSERT(Process::wait(processes, 0) == 0);\n int64 waitDuration = Time::ticks() - start;\n ASSERT(waitDuration < 10);\n }\n {\n struct InterrupterThread\n {\n static uint32 proc(void*)\n {\n Thread::sleep(50);\n Process::interrupt();\n return 0;\n }\n };\n Thread thread;\n thread.start(InterrupterThread::proc, 0);\n Process* processes[1];\n int64 start = Time::ticks();\n ASSERT(Process::wait(processes, 0) == 0);\n int64 waitDuration = Time::ticks() - start;\n ASSERT(waitDuration > 20);\n }\n\n \/\/ test wait\n {\n Process process;\n Process process2;\n#ifdef _WIN32\n ASSERT(process.open(_T(\"cmd \/C dir\")) != 0);\n ASSERT(process2.start(_T(\"cmd \/C \\\"choice \/T 1 \/D N >NUL\\\"\")) != 0);\n#else\n ASSERT(process.open(_T(\"ls\")) != 0);\n ASSERT(process2.start(_T(\"sleep 1\")) != 0);\n#endif\n Process* processes[] = {&process2, &process};\n ASSERT(Process::wait(processes, 2) == &process);\n uint32 exitCode;\n ASSERT(process.join(exitCode));\n ASSERT(exitCode == 0);\n ASSERT(Process::wait(processes, 1) == &process2);\n ASSERT(process2.join(exitCode));\n#ifdef _WIN32\n ASSERT(exitCode == 2);\n#else\n ASSERT(exitCode == 0);\n#endif\n }\n}\n<|endoftext|>"} {"text":"<commit_before>\/**\n Copyright 2016 Udey Rishi\n \n Licensed under the Apache License, Version 2.0 (the \"License\");\n you may not use this file except in compliance with the License.\n You may obtain a copy of the License at\n \n http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n \n Unless required by applicable law or agreed to in writing, software\n distributed under the License is distributed on an \"AS IS\" BASIS,\n WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n See the License for the specific language governing permissions and\n limitations under the License.\n*\/\n\n#include <catch.hpp>\n#include <core\/TruthTable.hpp>\n#include <sstream>\n\nusing namespace Logic;\n\nSCENARIO(\"TruthTableVariablesUInt behaves like a uint with range 0 <= x <= 64\", \"[TruthTableVariablesUInt]\") {\n GIVEN(\"A TruthTableVariablesUInt with some value\") {\n REQUIRE(TruthTableVariablesUInt(23) == 23);\n REQUIRE((uint8_t) TruthTableVariablesUInt(0) == 0);\n REQUIRE((uint8_t) TruthTableVariablesUInt() == 0);\n REQUIRE((uint8_t) TruthTableVariablesUInt(45) == 45);\n REQUIRE((uint32_t) TruthTableVariablesUInt(45) == 45);\n REQUIRE((uint64_t) TruthTableVariablesUInt(45) == 45);\n REQUIRE((int8_t) TruthTableVariablesUInt(45) == 45);\n REQUIRE((int32_t) TruthTableVariablesUInt(45) == 45);\n REQUIRE((int64_t) TruthTableVariablesUInt(45) == 45);\n REQUIRE((int64_t) TruthTableVariablesUInt(64) == 64);\n REQUIRE(TruthTableVariablesUInt(45) >= -52);\n REQUIRE(TruthTableVariablesUInt(45) > -52);\n REQUIRE(TruthTableVariablesUInt(45) > 0);\n REQUIRE(TruthTableVariablesUInt(45) >= 0);\n REQUIRE(TruthTableVariablesUInt(45) < 46);\n REQUIRE(TruthTableVariablesUInt(45) <= 46);\n REQUIRE(TruthTableVariablesUInt(45) < 123);\n REQUIRE(TruthTableVariablesUInt(45) <= 123);\n CHECK_THROWS_AS({ TruthTableVariablesUInt x(65); }, out_of_range);\n CHECK_THROWS_AS({ TruthTableVariablesUInt x(100); }, out_of_range);\n CHECK_THROWS_AS({ TruthTableVariablesUInt x(255); }, out_of_range);\n\n TruthTableVariablesUInt x = 34;\n WHEN(\"The pre-increment operator is used\") {\n THEN(\"Both the variable and the return value increase\") {\n TruthTableVariablesUInt y = ++x;\n REQUIRE(y == 35);\n REQUIRE(x == 35);\n }\n\n THEN(\"overflow_error is thrown if the value was 64\") {\n TruthTableVariablesUInt z(64);\n CHECK_THROWS_AS({ ++z; }, overflow_error);\n }\n }\n\n WHEN(\"The post-increment operator is used\") {\n THEN(\"Only the variable and NOT the return value increases\") {\n TruthTableVariablesUInt y = x++;\n REQUIRE(y == 34);\n REQUIRE(x == 35);\n }\n\n THEN(\"overflow_error is thrown if the value was 64\") {\n TruthTableVariablesUInt z(64);\n CHECK_THROWS_AS({ z++; }, overflow_error);\n }\n }\n\n WHEN(\"The pre-decrement operator is used\") {\n THEN(\"Both the variable's and the return value decrease\") {\n TruthTableVariablesUInt y = --x;\n REQUIRE(y == 33);\n REQUIRE(x == 33);\n }\n\n THEN(\"underflow_error is thrown if the value was 0\") {\n TruthTableVariablesUInt z(0);\n CHECK_THROWS_AS({ --z; }, underflow_error);\n }\n }\n\n WHEN(\"The post-decrement operator is used\") {\n THEN(\"Only the variable and NOT the return value decreases\") {\n TruthTableVariablesUInt y = x--;\n REQUIRE(y == 34);\n REQUIRE(x == 33);\n }\n\n THEN(\"underflow_error is thrown if the value was 0\") {\n TruthTableVariablesUInt z(0);\n CHECK_THROWS_AS({ z--; }, underflow_error);\n }\n }\n\n WHEN(\"The plus-equals operator is used\") {\n THEN(\"The value increments by the specified amount\") {\n x += 5;\n REQUIRE(x == 39);\n }\n\n THEN(\"overflow_error is thrown if the resulting value > 64\") {\n CHECK_THROWS_AS({ x += 31; }, overflow_error);\n }\n }\n\n WHEN(\"The minus-equals operator is used\") {\n THEN(\"The value decrements by the specified amount\") {\n x -= 5;\n REQUIRE(x == 29);\n }\n\n THEN(\"underflow_error is thrown if the resulting value < 0\") {\n CHECK_THROWS_AS({ x -= 35; }, underflow_error);\n }\n }\n\n WHEN(\"The plus operator is used\") {\n THEN(\"The value increments by the specified amount\") {\n REQUIRE(x + 5 == 39);\n }\n\n THEN(\"overflow_error is thrown if the resulting value > 64\") {\n CHECK_THROWS_AS({ x + 31; }, overflow_error);\n }\n }\n\n WHEN(\"The minus operator is used\") {\n THEN(\"The value decrements by the specified amount\") {\n REQUIRE(x - 5 == 29);\n }\n\n THEN(\"underflow_error is thrown if the resulting value < 0\") {\n CHECK_THROWS_AS({ x - 35; }, underflow_error);\n }\n }\n\n WHEN(\"The istream is used\") {\n THEN(\"The resulting object is created\") {\n TruthTableVariablesUInt y;\n istringstream(\"12\") >> y;\n REQUIRE(y == 12);\n }\n\n THEN(\"out_of_range error is thrown when the number is not between 0 and 64\") {\n TruthTableVariablesUInt y;\n CHECK_THROWS_AS({ istringstream(\"-1\") >> y; }, out_of_range);\n CHECK_THROWS_AS({ istringstream(\"65\") >> y; }, out_of_range);\n }\n }\n\n WHEN(\"The ostream is used\") {\n THEN(\"The resulting object is printed\") {\n TruthTableVariablesUInt y(12);\n ostringstream oss;\n oss << y;\n REQUIRE(oss.str() == \"12\");\n }\n }\n }\n}<commit_msg>Added tests for TruthTable<commit_after>\/**\n Copyright 2016 Udey Rishi\n\n Licensed under the Apache License, Version 2.0 (the \"License\");\n you may not use this file except in compliance with the License.\n You may obtain a copy of the License at\n\n http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n\n Unless required by applicable law or agreed to in writing, software\n distributed under the License is distributed on an \"AS IS\" BASIS,\n WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n See the License for the specific language governing permissions and\n limitations under the License.\n*\/\n\n#include <catch.hpp>\n#include <core\/TruthTable.hpp>\n#include <sstream>\n#include <Exceptions.hpp>\n\nusing namespace Logic;\n\nSCENARIO(\"TruthTableVariablesUInt behaves like a uint with range 0 <= x <= 64\", \"[TruthTableVariablesUInt]\") {\n GIVEN(\"A TruthTableVariablesUInt with some value\") {\n REQUIRE(TruthTableVariablesUInt(23) == 23);\n REQUIRE((uint8_t) TruthTableVariablesUInt(0) == 0);\n REQUIRE((uint8_t) TruthTableVariablesUInt() == 0);\n REQUIRE((uint8_t) TruthTableVariablesUInt(45) == 45);\n REQUIRE((uint32_t) TruthTableVariablesUInt(45) == 45);\n REQUIRE((uint64_t) TruthTableVariablesUInt(45) == 45);\n REQUIRE((int8_t) TruthTableVariablesUInt(45) == 45);\n REQUIRE((int32_t) TruthTableVariablesUInt(45) == 45);\n REQUIRE((int64_t) TruthTableVariablesUInt(45) == 45);\n REQUIRE((int64_t) TruthTableVariablesUInt(64) == 64);\n REQUIRE(TruthTableVariablesUInt(45) >= -52);\n REQUIRE(TruthTableVariablesUInt(45) > -52);\n REQUIRE(TruthTableVariablesUInt(45) > 0);\n REQUIRE(TruthTableVariablesUInt(45) >= 0);\n REQUIRE(TruthTableVariablesUInt(45) < 46);\n REQUIRE(TruthTableVariablesUInt(45) <= 46);\n REQUIRE(TruthTableVariablesUInt(45) < 123);\n REQUIRE(TruthTableVariablesUInt(45) <= 123);\n CHECK_THROWS_AS({ TruthTableVariablesUInt x(65); }, out_of_range);\n CHECK_THROWS_AS({ TruthTableVariablesUInt x(100); }, out_of_range);\n CHECK_THROWS_AS({ TruthTableVariablesUInt x(255); }, out_of_range);\n\n TruthTableVariablesUInt x = 34;\n WHEN(\"The pre-increment operator is used\") {\n THEN(\"Both the variable and the return value increase\") {\n TruthTableVariablesUInt y = ++x;\n REQUIRE(y == 35);\n REQUIRE(x == 35);\n }\n\n THEN(\"overflow_error is thrown if the value was 64\") {\n TruthTableVariablesUInt z(64);\n CHECK_THROWS_AS({ ++z; }, overflow_error);\n }\n }\n\n WHEN(\"The post-increment operator is used\") {\n THEN(\"Only the variable and NOT the return value increases\") {\n TruthTableVariablesUInt y = x++;\n REQUIRE(y == 34);\n REQUIRE(x == 35);\n }\n\n THEN(\"overflow_error is thrown if the value was 64\") {\n TruthTableVariablesUInt z(64);\n CHECK_THROWS_AS({ z++; }, overflow_error);\n }\n }\n\n WHEN(\"The pre-decrement operator is used\") {\n THEN(\"Both the variable's and the return value decrease\") {\n TruthTableVariablesUInt y = --x;\n REQUIRE(y == 33);\n REQUIRE(x == 33);\n }\n\n THEN(\"underflow_error is thrown if the value was 0\") {\n TruthTableVariablesUInt z(0);\n CHECK_THROWS_AS({ --z; }, underflow_error);\n }\n }\n\n WHEN(\"The post-decrement operator is used\") {\n THEN(\"Only the variable and NOT the return value decreases\") {\n TruthTableVariablesUInt y = x--;\n REQUIRE(y == 34);\n REQUIRE(x == 33);\n }\n\n THEN(\"underflow_error is thrown if the value was 0\") {\n TruthTableVariablesUInt z(0);\n CHECK_THROWS_AS({ z--; }, underflow_error);\n }\n }\n\n WHEN(\"The plus-equals operator is used\") {\n THEN(\"The value increments by the specified amount\") {\n x += 5;\n REQUIRE(x == 39);\n }\n\n THEN(\"overflow_error is thrown if the resulting value > 64\") {\n CHECK_THROWS_AS({ x += 31; }, overflow_error);\n }\n }\n\n WHEN(\"The minus-equals operator is used\") {\n THEN(\"The value decrements by the specified amount\") {\n x -= 5;\n REQUIRE(x == 29);\n }\n\n THEN(\"underflow_error is thrown if the resulting value < 0\") {\n CHECK_THROWS_AS({ x -= 35; }, underflow_error);\n }\n }\n\n WHEN(\"The plus operator is used\") {\n THEN(\"The value increments by the specified amount\") {\n REQUIRE(x + 5 == 39);\n }\n\n THEN(\"overflow_error is thrown if the resulting value > 64\") {\n CHECK_THROWS_AS({ x + 31; }, overflow_error);\n }\n }\n\n WHEN(\"The minus operator is used\") {\n THEN(\"The value decrements by the specified amount\") {\n REQUIRE(x - 5 == 29);\n }\n\n THEN(\"underflow_error is thrown if the resulting value < 0\") {\n CHECK_THROWS_AS({ x - 35; }, underflow_error);\n }\n }\n\n WHEN(\"The istream is used\") {\n THEN(\"The resulting object is created\") {\n TruthTableVariablesUInt y;\n istringstream(\"12\") >> y;\n REQUIRE(y == 12);\n }\n\n THEN(\"out_of_range error is thrown when the number is not between 0 and 64\") {\n TruthTableVariablesUInt y;\n CHECK_THROWS_AS({ istringstream(\"-1\") >> y; }, out_of_range);\n CHECK_THROWS_AS({ istringstream(\"65\") >> y; }, out_of_range);\n }\n }\n\n WHEN(\"The ostream is used\") {\n THEN(\"The resulting object is printed\") {\n TruthTableVariablesUInt y(12);\n ostringstream oss;\n oss << y;\n REQUIRE(oss.str() == \"12\");\n }\n }\n }\n}\n\n\/\/ TruthTableUInt is just a typedef right now, so tests is an overkill. Add if this is not true in the future\n\nSCENARIO(\"A TruthTable stores the variable and data properly\", \"[TruthTable]\") {\n GIVEN(\"A 3-variable TruthTable\") {\n TruthTable table({\"a\", \"ball\", \"cat\"});\n\n REQUIRE(table.size() == 8);\n REQUIRE(table.getVariables().size() == 3);\n REQUIRE(table.getVariables()[0] == \"a\");\n REQUIRE(table.getVariables()[1] == \"ball\");\n REQUIRE(table.getVariables()[2] == \"cat\");\n\n REQUIRE(TruthTable::getVariableValueInLine(0, 0) == 0);\n REQUIRE(TruthTable::getVariableValueInLine(1, 0) == 0);\n REQUIRE(TruthTable::getVariableValueInLine(2, 0) == 0);\n REQUIRE(TruthTable::getVariableValueInLine(3, 0) == 0);\n REQUIRE(TruthTable::getVariableValueInLine(4, 0) == 0);\n REQUIRE(TruthTable::getVariableValueInLine(0, 1) == 1);\n REQUIRE(TruthTable::getVariableValueInLine(1, 1) == 0);\n REQUIRE(TruthTable::getVariableValueInLine(2, 1) == 0);\n REQUIRE(TruthTable::getVariableValueInLine(3, 1) == 0);\n REQUIRE(TruthTable::getVariableValueInLine(4, 1) == 0);\n REQUIRE(TruthTable::getVariableValueInLine(0, 2) == 0);\n REQUIRE(TruthTable::getVariableValueInLine(1, 2) == 1);\n REQUIRE(TruthTable::getVariableValueInLine(2, 2) == 0);\n REQUIRE(TruthTable::getVariableValueInLine(3, 2) == 0);\n REQUIRE(TruthTable::getVariableValueInLine(4, 2) == 0);\n REQUIRE(TruthTable::getVariableValueInLine(0, 6) == 0);\n REQUIRE(TruthTable::getVariableValueInLine(1, 6) == 1);\n REQUIRE(TruthTable::getVariableValueInLine(2, 6) == 1);\n REQUIRE(TruthTable::getVariableValueInLine(3, 6) == 0);\n REQUIRE(TruthTable::getVariableValueInLine(4, 6) == 0);\n\n WHEN(\"The [] operator is used within table's range\") {\n THEN(\"The table's value can be set and retrieved at that index\") {\n for (TruthTableUInt i = 0; i < table.size(); ++i) {\n REQUIRE(!table[i]);\n }\n table[5] = !table[5];\n for (TruthTableUInt i = 0; i < table.size(); ++i) {\n if (i == 5) {\n REQUIRE(table[i]);\n } else {\n REQUIRE(!table[i]);\n }\n }\n table[4] = !table[5];\n for (TruthTableUInt i = 0; i < table.size(); ++i) {\n if (i == 5) {\n REQUIRE(table[i]);\n } else {\n REQUIRE(!table[i]);\n }\n }\n }\n }\n\n WHEN(\"The [] operator is used outside of table's range\") {\n THEN(\"out_of_range exception is thrown\") {\n CHECK_THROWS_AS({ table[8]; }, out_of_range);\n CHECK_THROWS_AS({ table[52]; }, out_of_range);\n CHECK_THROWS_AS({ table[8] = true; }, out_of_range);\n }\n }\n\n WHEN(\"You apply a condition on a variable\") {\n THEN(\"The correct resulting table is generated\") {\n \/\/ a & b;\n table[3] = true;\n table[7] = true;\n\n TruthTableCondition condition = table.conditionBuilder();\n condition.when(\"a\", true);\n condition.when(\"ball\", true);\n TruthTable result = condition.then();\n\n REQUIRE(result.size() == 2);\n REQUIRE(result.getVariables().size() == 1);\n REQUIRE(result.getVariables()[0] == \"cat\");\n REQUIRE(result[0] == true);\n REQUIRE(result[1] == true);\n }\n }\n\n WHEN(\"You apply a condition on a variable that does not exist\") {\n THEN(\"invalid_argument exception is thrown\") {\n CHECK_THROWS_AS({ table.conditionBuilder().when(\"b\", true); }, invalid_argument);\n }\n }\n\n WHEN(\"You apply a condition on a variable multiple times\") {\n THEN(\"The values overwrite, and the last one is kept\") {\n TruthTableCondition condition = table.conditionBuilder();\n condition.when(\"a\", true);\n condition.when(\"a\", false);\n TruthTable result = condition.then();\n REQUIRE(result.size() == 4);\n REQUIRE(result.getVariables().size() == 2);\n REQUIRE(result.getVariables()[0] == \"ball\");\n REQUIRE(result.getVariables()[1] == \"cat\");\n REQUIRE(result[0] == false);\n REQUIRE(result[1] == false);\n REQUIRE(result[2] == false);\n REQUIRE(result[3] == false);\n }\n }\n\n \/\/ TODO: This is the current behaviour. Maybe this can be better?\n WHEN(\"You apply a condition to all the variables\") {\n THEN(\"IllegalTruthTableException is thrown when creating the resulting table\") {\n TruthTableCondition condition = table.conditionBuilder();\n condition.when(\"a\", true);\n condition.when(\"ball\", true);\n condition.when(\"cat\", false);\n CHECK_THROWS_AS({ condition.then(); }, IllegalTruthTableException);\n }\n }\n }\n\n WHEN(\"You try to create a truthtable with no variables\") {\n THEN(\"invalid_argument exception is thrown\") {\n CHECK_THROWS_AS({ TruthTable({}); }, invalid_argument);\n }\n }\n\n WHEN(\"You try to create a truthtable with > 64 variables\") {\n THEN(\"invalid_argument exception is thrown\") {\n vector<string> vars;\n for (int i = 0; i < 65; ++i) {\n vars.push_back(string(1, 'a' + (char)i));\n }\n CHECK_THROWS_AS({ TruthTable x(vars); }, invalid_argument);\n vars.push_back(\"hello\");\n CHECK_THROWS_AS({ TruthTable x(vars); }, invalid_argument);\n }\n }\n\n WHEN(\"You try to create a truthtable with duplicate variables\") {\n THEN(\"invalid_argument exception is thrown\") {\n CHECK_THROWS_AS({ TruthTable({\"x\", \"hello\", \"x\"}); }, invalid_argument);\n }\n }\n}\n<|endoftext|>"} {"text":"<commit_before>\/*\n * Copyright (c) 2013-2014 Kajetan Swierk <k0zmo@outlook.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 *\/\n\n#include \"Logic\/NodeType.h\"\n#include \"Logic\/NodeFactory.h\"\n\n#include <opencv2\/imgproc\/imgproc.hpp>\n\nclass BinarizationNodeType : public NodeType\n{\npublic:\n BinarizationNodeType()\n : _threshold(128)\n , _inv(false)\n {\n }\n\n bool setProperty(PropertyID propId, const NodeProperty& newValue) override\n {\n switch(static_cast<pid>(propId))\n {\n case pid::Threshold:\n _threshold = newValue.toInt();\n return true;\n case pid::Invert:\n _inv = newValue.toBool();\n return true;\n }\n\n return false;\n }\n\n NodeProperty property(PropertyID propId) const override\n {\n switch(static_cast<pid>(propId))\n {\n case pid::Threshold: return _threshold;\n case pid::Invert: return _inv;\n }\n\n return NodeProperty();\n }\n\n ExecutionStatus execute(NodeSocketReader& reader, NodeSocketWriter& writer) override\n {\n \/\/ Read input sockets\n const cv::Mat& src = reader.readSocket(0).getImageMono();\n \/\/ Acquire output sockets\n cv::Mat& dst = writer.acquireSocket(0).getImageMono();\n\n \/\/ Validate inputs\n if(src.empty())\n return ExecutionStatus(EStatus::Ok);\n if(_threshold < 0 || _threshold > 255)\n return ExecutionStatus(EStatus::Error, \"Bad threshold value\");\n\n \/\/ Do stuff\n int type = _inv ? cv::THRESH_BINARY_INV : cv::THRESH_BINARY;\n cv::threshold(src, dst, (double) _threshold, 255, type);\n\n return ExecutionStatus(EStatus::Ok);\n }\n\n void configuration(NodeConfig& nodeConfig) const override\n {\n static const InputSocketConfig in_config[] = {\n { ENodeFlowDataType::ImageMono, \"source\", \"Source\", \"\" },\n { ENodeFlowDataType::Invalid, \"\", \"\", \"\" }\n };\n static const OutputSocketConfig out_config[] = {\n { ENodeFlowDataType::ImageMono, \"output\", \"Output\", \"\" },\n { ENodeFlowDataType::Invalid, \"\", \"\", \"\" }\n };\n static const PropertyConfig prop_config[] = {\n { EPropertyType::Integer, \"Threshold\", \"min:0, max:255\" },\n { EPropertyType::Boolean, \"Inverted\", \"\" },\n { EPropertyType::Unknown, \"\", \"\" }\n };\n\n nodeConfig.description = \"Applies a fixed-level threshold to each pixel element.\";\n nodeConfig.pInputSockets = in_config;\n nodeConfig.pOutputSockets = out_config;\n nodeConfig.pProperties = prop_config;\n }\n\nprivate:\n enum class pid\n {\n Threshold,\n Invert\n };\n\n int _threshold;\n bool _inv;\n};\n\nclass OtsuThresholdingNodeType : public NodeType\n{\npublic:\n ExecutionStatus execute(NodeSocketReader& reader, NodeSocketWriter& writer) override\n {\n \/\/ Read input sockets\n const cv::Mat& src = reader.readSocket(0).getImageMono();\n \/\/ Acquire output sockets\n cv::Mat& dst = writer.acquireSocket(0).getImageMono();\n\n \/\/ Validate inputs\n if(src.empty() || src.type() != CV_8U)\n return ExecutionStatus(EStatus::Ok);\n\n \/\/ Do stuff\n cv::threshold(src, dst, 0, 255, cv::THRESH_OTSU);\n\n return ExecutionStatus(EStatus::Ok);\n }\n\n void configuration(NodeConfig& nodeConfig) const override\n {\n static const InputSocketConfig in_config[] = {\n { ENodeFlowDataType::ImageMono, \"source\", \"Source\", \"\" },\n { ENodeFlowDataType::Invalid, \"\", \"\", \"\" }\n };\n static const OutputSocketConfig out_config[] = {\n { ENodeFlowDataType::ImageMono, \"output\", \"Output\", \"\" },\n { ENodeFlowDataType::Invalid, \"\", \"\", \"\" }\n };\n\n nodeConfig.description = \"Applies optimal threshold value using Otsu's algorithm to each pixel element.\";\n nodeConfig.pInputSockets = in_config;\n nodeConfig.pOutputSockets = out_config;\n }\n};\n\nREGISTER_NODE(\"Segmentation\/Otsu's thresholding\", OtsuThresholdingNodeType)\nREGISTER_NODE(\"Segmentation\/Binarization\", BinarizationNodeType)\n<commit_msg>updated image segmenting nodes for new node conf. interface [WIP]<commit_after>\/*\n * Copyright (c) 2013-2014 Kajetan Swierk <k0zmo@outlook.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 *\/\n\n#include \"Logic\/NodeType.h\"\n#include \"Logic\/NodeFactory.h\"\n\n#include <opencv2\/imgproc\/imgproc.hpp>\n\nclass BinarizationNodeType : public NodeType\n{\npublic:\n BinarizationNodeType()\n : _threshold(128)\n , _inv(false)\n {\n addInput(\"Source\", ENodeFlowDataType::ImageMono);\n addOutput(\"Output\", ENodeFlowDataType::ImageMono);\n addProperty(\"Threshold\", _threshold)\n .setValidator(make_validator<InclRangePropertyValidator<int>>(0, 255))\n .setUiHints(\"min:0, max:255\");\n addProperty(\"Inverted\", _inv);\n setDescription(\"Applies a fixed-level threshold to each pixel element.\");\n }\n\n ExecutionStatus execute(NodeSocketReader& reader, NodeSocketWriter& writer) override\n {\n \/\/ Read input sockets\n const cv::Mat& src = reader.readSocket(0).getImageMono();\n \/\/ Acquire output sockets\n cv::Mat& dst = writer.acquireSocket(0).getImageMono();\n\n \/\/ Validate inputs\n if(src.empty())\n return ExecutionStatus(EStatus::Ok);\n if(_threshold < 0 || _threshold > 255)\n return ExecutionStatus(EStatus::Error, \"Bad threshold value\");\n\n \/\/ Do stuff\n int type = _inv ? cv::THRESH_BINARY_INV : cv::THRESH_BINARY;\n cv::threshold(src, dst, (double) _threshold, 255, type);\n\n return ExecutionStatus(EStatus::Ok);\n }\n\nprivate:\n TypedNodeProperty<int> _threshold;\n TypedNodeProperty<bool> _inv;\n};\n\nclass OtsuThresholdingNodeType : public NodeType\n{\npublic:\n OtsuThresholdingNodeType()\n {\n addInput(\"Source\", ENodeFlowDataType::ImageMono);\n addOutput(\"Output\", ENodeFlowDataType::ImageMono);\n setDescription(\"Applies optimal threshold value using Otsu's algorithm to each pixel element.\");\n }\n\n ExecutionStatus execute(NodeSocketReader& reader, NodeSocketWriter& writer) override\n {\n \/\/ Read input sockets\n const cv::Mat& src = reader.readSocket(0).getImageMono();\n \/\/ Acquire output sockets\n cv::Mat& dst = writer.acquireSocket(0).getImageMono();\n\n \/\/ Validate inputs\n if(src.empty() || src.type() != CV_8U)\n return ExecutionStatus(EStatus::Ok);\n\n \/\/ Do stuff\n cv::threshold(src, dst, 0, 255, cv::THRESH_OTSU);\n\n return ExecutionStatus(EStatus::Ok);\n }\n};\n\nREGISTER_NODE(\"Segmentation\/Otsu's thresholding\", OtsuThresholdingNodeType)\nREGISTER_NODE(\"Segmentation\/Binarization\", BinarizationNodeType)\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 *\n * This library is free software; you can redistribute it and\/or\n * modify it under the terms of the GNU Lesser General Public\n * License as published by the Free Software Foundation; either\n * version 2.1 of the License, or (at your option) any later version.\n *\n * This library is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU\n * Lesser General Public License for more details.\n *\n * You should have received 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 \"cameracontrollercomponent.h\"\n\n#include <QtCore\/QSizeF>\n#include <QtGui\/QMatrix4x4>\n\n#include <core\/debughelper.h>\n#include <graphics\/camera.h>\n#include <graphics\/engine.h>\n#include <graphics\/frustrum.h>\n#include <graphics\/viewport.h>\n#include <graphics\/rendertarget.h>\n#include <graphics\/materialinstance.h>\n#include <engine\/gameobject.h>\n#include <engine\/asset.h>\n\nREGISTER_OBJECTTYPE( GluonEngine, CameraControllerComponent )\n\nusing namespace GluonEngine;\n\nclass CameraControllerComponent::CameraControllerComponentPrivate\n{\n public:\n CameraControllerComponentPrivate()\n {\n camera = 0;\n active = true;\n visibleArea = QSizeF( 100.0f, 100.0f );\n nearPlane = 1.0f;\n farPlane = 100.0f;\n material = 0;\n }\n\n GluonGraphics::Camera* camera;\n bool active;\n\n QSizeF visibleArea;\n float nearPlane;\n float farPlane;\n\n GluonGraphics::MaterialInstance* material;\n\n static GluonGraphics::Camera* activeCamera;\n};\n\nGluonGraphics::Camera* CameraControllerComponent::CameraControllerComponentPrivate::activeCamera = 0;\n\nCameraControllerComponent::CameraControllerComponent( QObject* parent )\n : Component( parent )\n , d( new CameraControllerComponentPrivate )\n{\n\n}\n\nCameraControllerComponent::CameraControllerComponent( const CameraControllerComponent& other )\n : Component( other )\n , d( other.d )\n{\n}\n\nCameraControllerComponent::~CameraControllerComponent()\n{\n delete d;\n}\n\nQString CameraControllerComponent::category() const\n{\n return QString( \"Graphics\" );\n}\n\nvoid CameraControllerComponent::initialize()\n{\n if( !d->camera )\n d->camera = new GluonGraphics::Camera();\n\n if( d->active )\n {\n GluonGraphics::Engine::instance()->setActiveCamera( d->camera );\n }\n\n if(!d->material)\n {\n d->material = GluonGraphics::Engine::instance()->mainRenderTarget()->materialInstance();\n }\n else\n {\n Asset* materialAsset = qobject_cast<Asset*>( d->material->parent() );\n if( materialAsset )\n materialAsset->load();\n GluonGraphics::Engine::instance()->mainRenderTarget()->setMaterialInstance(d->material);\n }\n\n d->camera->frustrum()->setOrthoAdjusted( d->visibleArea, GluonGraphics::Engine::instance()->currentViewport()->aspectRatio(), d->nearPlane, d->farPlane );\n}\n\nvoid CameraControllerComponent::start()\n{\n}\n\nvoid CameraControllerComponent::draw( int timeLapse )\n{\n Q_UNUSED( timeLapse )\n\n if( d->camera )\n d->camera->setViewMatrix( gameObject()->transform().inverted() );\n}\n\nvoid CameraControllerComponent::cleanup()\n{\n CameraControllerComponentPrivate::activeCamera = 0;\n GluonGraphics::Engine::instance()->setActiveCamera( 0 );\n\n delete d->camera;\n d->camera = 0;\n}\n\nbool CameraControllerComponent::isActive()\n{\n return d->active;\n}\n\nvoid CameraControllerComponent::setActive( bool active )\n{\n d->active = active;\n if( active && d->camera )\n {\n CameraControllerComponentPrivate::activeCamera = d->camera;\n GluonGraphics::Engine::instance()->setActiveCamera( d->camera );\n }\n}\n\nvoid CameraControllerComponent::setVisibleArea( const QSizeF& area )\n{\n d->visibleArea = area;\n\n if( d->camera )\n d->camera->frustrum()->setOrthoAdjusted( d->visibleArea, GluonGraphics::Engine::instance()->currentViewport()->aspectRatio(), d->nearPlane, d->farPlane );\n}\n\nQSizeF CameraControllerComponent::visibleArea()\n{\n return d->visibleArea;\n}\n\nfloat CameraControllerComponent::nearPlane()\n{\n return d->nearPlane;\n}\n\nfloat CameraControllerComponent::farPlane()\n{\n return d->farPlane;\n}\n\nGluonGraphics::MaterialInstance* CameraControllerComponent::renderTargetMaterial()\n{\n return d->material;\n}\n\nvoid CameraControllerComponent::setNearPlane( float near )\n{\n d->nearPlane = near;\n\n if( d->camera )\n d->camera->frustrum()->setOrthoAdjusted( d->visibleArea, GluonGraphics::Engine::instance()->currentViewport()->aspectRatio(), d->nearPlane, d->farPlane );\n}\n\nvoid CameraControllerComponent::setFarPlane( float far )\n{\n d->farPlane = far;\n\n if( d->camera )\n d->camera->frustrum()->setOrthoAdjusted( d->visibleArea, GluonGraphics::Engine::instance()->currentViewport()->aspectRatio(), d->nearPlane, d->farPlane );\n}\n\nvoid CameraControllerComponent::setRenderTargetMaterial( GluonGraphics::MaterialInstance* material )\n{\n d->material = material;\n\n GluonGraphics::Engine::instance()->mainRenderTarget()->setMaterialInstance(material);\n}\n\nQ_EXPORT_PLUGIN2( gluon_component_cameracontroller, GluonEngine::CameraControllerComponent );\n\n#include \"cameracontrollercomponent.moc\"\n<commit_msg>Check if the render target was created before setting its material.<commit_after>\/******************************************************************************\n * This file is part of the Gluon Development Platform\n * Copyright (c) 2010 Arjen Hiemstra <ahiemstra@heimr.nl>\n *\n * This library is free software; you can redistribute it and\/or\n * modify it under the terms of the GNU Lesser General Public\n * License as published by the Free Software Foundation; either\n * version 2.1 of the License, or (at your option) any later version.\n *\n * This library is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU\n * Lesser General Public License for more details.\n *\n * You should have received 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 \"cameracontrollercomponent.h\"\n\n#include <QtCore\/QSizeF>\n#include <QtGui\/QMatrix4x4>\n\n#include <core\/debughelper.h>\n#include <graphics\/camera.h>\n#include <graphics\/engine.h>\n#include <graphics\/frustrum.h>\n#include <graphics\/viewport.h>\n#include <graphics\/rendertarget.h>\n#include <graphics\/materialinstance.h>\n#include <engine\/gameobject.h>\n#include <engine\/asset.h>\n\nREGISTER_OBJECTTYPE( GluonEngine, CameraControllerComponent )\n\nusing namespace GluonEngine;\n\nclass CameraControllerComponent::CameraControllerComponentPrivate\n{\n public:\n CameraControllerComponentPrivate()\n {\n camera = 0;\n active = true;\n visibleArea = QSizeF( 100.0f, 100.0f );\n nearPlane = 1.0f;\n farPlane = 100.0f;\n material = 0;\n }\n\n GluonGraphics::Camera* camera;\n bool active;\n\n QSizeF visibleArea;\n float nearPlane;\n float farPlane;\n\n GluonGraphics::MaterialInstance* material;\n\n static GluonGraphics::Camera* activeCamera;\n};\n\nGluonGraphics::Camera* CameraControllerComponent::CameraControllerComponentPrivate::activeCamera = 0;\n\nCameraControllerComponent::CameraControllerComponent( QObject* parent )\n : Component( parent )\n , d( new CameraControllerComponentPrivate )\n{\n\n}\n\nCameraControllerComponent::CameraControllerComponent( const CameraControllerComponent& other )\n : Component( other )\n , d( other.d )\n{\n}\n\nCameraControllerComponent::~CameraControllerComponent()\n{\n delete d;\n}\n\nQString CameraControllerComponent::category() const\n{\n return QString( \"Graphics\" );\n}\n\nvoid CameraControllerComponent::initialize()\n{\n if( !d->camera )\n d->camera = new GluonGraphics::Camera();\n\n if( d->active )\n {\n GluonGraphics::Engine::instance()->setActiveCamera( d->camera );\n }\n\n if(!d->material)\n {\n d->material = GluonGraphics::Engine::instance()->mainRenderTarget()->materialInstance();\n }\n else\n {\n Asset* materialAsset = qobject_cast<Asset*>( d->material->parent() );\n if( materialAsset )\n materialAsset->load();\n GluonGraphics::Engine::instance()->mainRenderTarget()->setMaterialInstance(d->material);\n }\n\n d->camera->frustrum()->setOrthoAdjusted( d->visibleArea, GluonGraphics::Engine::instance()->currentViewport()->aspectRatio(), d->nearPlane, d->farPlane );\n}\n\nvoid CameraControllerComponent::start()\n{\n}\n\nvoid CameraControllerComponent::draw( int timeLapse )\n{\n Q_UNUSED( timeLapse )\n\n if( d->camera )\n d->camera->setViewMatrix( gameObject()->transform().inverted() );\n}\n\nvoid CameraControllerComponent::cleanup()\n{\n CameraControllerComponentPrivate::activeCamera = 0;\n GluonGraphics::Engine::instance()->setActiveCamera( 0 );\n\n delete d->camera;\n d->camera = 0;\n}\n\nbool CameraControllerComponent::isActive()\n{\n return d->active;\n}\n\nvoid CameraControllerComponent::setActive( bool active )\n{\n d->active = active;\n if( active && d->camera )\n {\n CameraControllerComponentPrivate::activeCamera = d->camera;\n GluonGraphics::Engine::instance()->setActiveCamera( d->camera );\n }\n}\n\nvoid CameraControllerComponent::setVisibleArea( const QSizeF& area )\n{\n d->visibleArea = area;\n\n if( d->camera )\n d->camera->frustrum()->setOrthoAdjusted( d->visibleArea, GluonGraphics::Engine::instance()->currentViewport()->aspectRatio(), d->nearPlane, d->farPlane );\n}\n\nQSizeF CameraControllerComponent::visibleArea()\n{\n return d->visibleArea;\n}\n\nfloat CameraControllerComponent::nearPlane()\n{\n return d->nearPlane;\n}\n\nfloat CameraControllerComponent::farPlane()\n{\n return d->farPlane;\n}\n\nGluonGraphics::MaterialInstance* CameraControllerComponent::renderTargetMaterial()\n{\n return d->material;\n}\n\nvoid CameraControllerComponent::setNearPlane( float near )\n{\n d->nearPlane = near;\n\n if( d->camera )\n d->camera->frustrum()->setOrthoAdjusted( d->visibleArea, GluonGraphics::Engine::instance()->currentViewport()->aspectRatio(), d->nearPlane, d->farPlane );\n}\n\nvoid CameraControllerComponent::setFarPlane( float far )\n{\n d->farPlane = far;\n\n if( d->camera )\n d->camera->frustrum()->setOrthoAdjusted( d->visibleArea, GluonGraphics::Engine::instance()->currentViewport()->aspectRatio(), d->nearPlane, d->farPlane );\n}\n\nvoid CameraControllerComponent::setRenderTargetMaterial( GluonGraphics::MaterialInstance* material )\n{\n d->material = material;\n\n GluonGraphics::RenderTarget *target = GluonGraphics::Engine::instance()->mainRenderTarget();\n if( target )\n target->setMaterialInstance(material);\n}\n\nQ_EXPORT_PLUGIN2( gluon_component_cameracontroller, GluonEngine::CameraControllerComponent );\n\n#include \"cameracontrollercomponent.moc\"\n<|endoftext|>"} {"text":"<commit_before>#include \"ExtendedInventoryScreen.h\"\n\n#include \"InventoryTransitions.h\"\n#include \"..\/..\/creative\/CreativeTab.h\"\n\n#include \"com\/mojang\/minecraftpe\/client\/MinecraftClient.h\"\n#include \"com\/mojang\/minecraftpe\/client\/gui\/NinePatchLayer.h\"\n#include \"com\/mojang\/minecraftpe\/client\/gui\/IntRectangle.h\"\n#include \"com\/mojang\/minecraftpe\/client\/gui\/ImageWithBackground.h\"\n#include \"com\/mojang\/minecraftpe\/client\/gui\/InventoryTab.h\"\n#include \"com\/mojang\/minecraftpe\/client\/settings\/Options.h\"\n#include \"com\/mojang\/minecraftpe\/client\/renderer\/Tessellator.h\"\n#include \"com\/mojang\/minecraftpe\/client\/renderer\/texture\/TextureGroup.h\"\n#include \"com\/mojang\/minecraftpe\/client\/renderer\/entity\/ItemRenderer.h\"\n#include \"com\/mojang\/minecraftpe\/client\/renderer\/ShaderColor.h\"\n#include \"com\/mojang\/minecraftpe\/world\/item\/ItemInstance.h\"\n\nExtendedInventoryScreen::ExtendedInventoryScreen(MinecraftClient& client, std::vector<CreativeTab*> creativeTabs)\n\t: Screen(client)\n{\n\tcloseButton = NULL;\n\tbackgroundLayer = NULL;\n\tleftButtonLayer = NULL;\n\trightButtonLayer = NULL;\n\townedTabs = creativeTabs;\n\ttestPane = NULL;\n}\n\nbool ExtendedInventoryScreen::renderGameBehind() const\n{\n\treturn mcClient->getOptions()->getFancyGraphics();\n}\n\nbool ExtendedInventoryScreen::closeOnPlayerHurt() const\n{\n\treturn true;\n}\n\nvoid ExtendedInventoryScreen::init()\n{\n\tif(!closeButton)\n\t{\n\t\tInventoryTransitions::init(this);\n\t\t\n\t\tNinePatchFactory factory (mcClient->getTextures(), \"gui\/spritesheet.png\");\n\t\t\n\t\tbackgroundLayer = std::shared_ptr<NinePatchLayer>(factory.createSymmetrical({34, 43, 14, 14}, 3, 3, 14.0F, 14.0F));\n\t\tleftButtonLayer = std::shared_ptr<NinePatchLayer>(factory.createSymmetrical({49, 43, 14, 14}, 3, 3, 14.0F, 14.0F));\n\t\trightButtonLayer = std::shared_ptr<NinePatchLayer>(factory.createSymmetrical({65, 55, 14, 14}, 3, 3, 14.0F, 14.0F));\n\t\t\n\t\tcloseButton = std::make_shared<ImageWithBackground>(2);\n\t\tcloseButton->init(mcClient->getTextures(), 28, 28, {49, 43, 14, 14}, {49, 43, 14, 14}, 2, 2, \"gui\/spritesheet.png\");\n\t\tcloseButton->setImageDef({mcClient->getTextures()->getTexture(\"gui\/spritesheet.png\", TextureLocation::Default), 0, 1, 18.0F, 18.0F, {60, 0, 18, 18}, true}, true);\n\t\t\n\t\tfor(int tab = 0; tab < ownedTabs.size(); tab++)\n\t\t{\n\t\t\trenderedTabs.emplace_back(createInventoryTab(tab + 3, ((tab < 4) ? false : true)));\n\t\t}\n\t\t\n\t\tselectedTabIndex = 0;\n\t\t\n\t\tbuttonList.emplace_back(closeButton);\n\t}\n}\n\nvoid ExtendedInventoryScreen::render(int i1, int i2, float f1)\n{\n\tif(renderGameBehind())\n\t\trenderBackground(1);\n\telse\n\t\trenderDirtBackground();\n\t\n\trenderToolBar(f1, 1.0F, false);\n\t\n\tfor(int tab = 0; tab < renderedTabs.size(); tab++)\n\t{\n\t\tif(tab != selectedTabIndex)\n\t\t{\n\t\t\trenderedTabs[tab]->renderBg(mcClient, i1, i2);\n\t\t\tdrawTabIcon(ownedTabs[tab], renderedTabs[tab], renderedTabs[tab]->pressed, false);\n\t\t}\n\t}\n\t\n\tbackgroundLayer->draw(Tessellator::instance, backgroundLayer->xPosition, backgroundLayer->yPosition);\n\t\n\trenderedTabs[selectedTabIndex]->renderBg(mcClient, i1, i2);\n\tdrawTabIcon(ownedTabs[selectedTabIndex], renderedTabs[selectedTabIndex], renderedTabs[selectedTabIndex]->pressed, true);\t\n\t\n\tInventoryTransitions::render(this, i1, i2, f1);\n\t\n\tScreen::render(i1, i2, f1);\n\t\n\tcurrentShaderColor.setColor(Color::WHITE);\n\t\n\tfill(backgroundLayer->xPosition + 5, backgroundLayer->yPosition + 4, width - 38, height - 27, {0.2F, 0.2F, 0.2F, 1.0F});\n\t\n\ttestPane->render(i1, i2, f1, mcClient);\n\t\n\trenderOnSelectItemNameText(width, mcClient->getFont(), height - 41);\n}\n\nvoid ExtendedInventoryScreen::setupPositions()\n{\n\tbackgroundLayer->xPosition = 31;\n\tbackgroundLayer->yPosition = 2;\n\tbackgroundLayer->setSize((float)(width - 26 - 28) - 4.0F - 6.0F, (float)height - 25.0F);\n\t\n\tcloseButton->xPosition = backgroundLayer->xPosition - 26;\n\tcloseButton->yPosition = backgroundLayer->yPosition;\n\t\n\tcloseButton->setSize(29, 28);\n\t\n\tfor(int tab = 0; tab < renderedTabs.size(); tab++)\n\t{\n\t\tif(!renderedTabs[tab]->isRight)\n\t\t{\n\t\t\trenderedTabs[tab]->xPosition = backgroundLayer->xPosition - 26;\n\t\t\trenderedTabs[tab]->yPosition = height - 25 - 29 - (tab * 31);\n\t\t}\n\t\telse\n\t\t{\n\t\t\trenderedTabs[tab]->xPosition = width - 6 - 29;\n\t\t\trenderedTabs[tab]->yPosition = height - 25 - 29 - ((tab - 4) * 31);\n\t\t}\n\t\trenderedTabs[tab]->width = 29;\n\t\trenderedTabs[tab]->height = 29;\n\t}\n\t\n\t\n\ttestPane->xPosition = backgroundLayer->xPosition + 11;\n\ttestPane->yPosition = backgroundLayer->yPosition + 8;\n\t\n\tInventoryTransitions::setupPositions(this);\n}\n\nvoid ExtendedInventoryScreen::_buttonClicked(Button& button)\n{\n\tInventoryTransitions::_buttonClicked(this, button);\n\t\n\tif(button.id == closeButton->id)\n\t\tInventoryTransitions::pushPreviousScreen(this);\n}\n\nvoid ExtendedInventoryScreen::_pointerReleased(int x, int y)\n{\n\tScreen::_pointerReleased(x, y);\n\t\n\tfor(int tab = 0; tab < renderedTabs.size(); tab++)\n\t{\n\t\tif(tab != selectedTabIndex && renderedTabs[tab]->isInside(x, y) && renderedTabs[tab]->pressed)\n\t\t\tselectedTabIndex = tab;\n\t\t\n\t\trenderedTabs[tab]->pressed = false;\n\t}\n}\n\nvoid ExtendedInventoryScreen::_pointerPressed(int x, int y)\n{\n\tScreen::_pointerPressed(x, y);\n\t\n\tfor(int tab = 0; tab < renderedTabs.size(); tab++)\n\t{\n\t\tif(renderedTabs[tab]->isInside(x, y))\n\t\t{\n\t\t\trenderedTabs[tab]->pressed = true;\n\t\t\treturn;\n\t\t}\n\t}\n}\n\nvoid ExtendedInventoryScreen::handleBackEvent(bool b1)\n{\n\tif(!b1)\n\t\tInventoryTransitions::pushPreviousScreen(this);\n}\n\nbool ExtendedInventoryScreen::isModal() const\n{\n\treturn true;\n}\n\nvoid ExtendedInventoryScreen::tick()\n{\n\t\n}\n\nstd::string ExtendedInventoryScreen::getScreenName()\n{\n\treturn \"extended_creative_screen\";\n}\n\nstd::shared_ptr<InventoryTab> ExtendedInventoryScreen::createInventoryTab(int id, bool isRight)\n{\n\tNinePatchLayer* buttonLayer = isRight ? rightButtonLayer.get() : leftButtonLayer.get();\n\tstd::shared_ptr<InventoryTab> button = std::make_shared<InventoryTab>(id, \"\", buttonLayer, isRight);\n\tbutton->setOverrideScreenRendering(true);\n\treturn button;\n}\n\nvoid ExtendedInventoryScreen::drawTabIcon(CreativeTab* ownedTab, std::shared_ptr<InventoryTab> imageButton, bool isPressed, bool isSelected)\n{\n\tItemRenderer::getInstance()->renderGuiItemNew(ownedTab->getTabIcon(), 0, ((float)imageButton->xPosition + (float)((imageButton->width \/ 2) - 8) + (isPressed ? 1.0F : 0.7F)), ((float)imageButton->yPosition + (float)((imageButton->height \/ 2) - 8)), 1.0F, (isSelected ? 1.0F : 0.7F), (((float)imageButton->width) - (isPressed ? 2.0F : 0.0F)) * 0.04F, false);\n}\n\nbool ExtendedInventoryScreen::addItem(Touch::InventoryPane& pane, int slot)\n{\n\treturn true;\n}\n\nbool ExtendedInventoryScreen::isAllowed(int slot)\n{\n\treturn true;\n}\n\nstd::vector<const ItemInstance*> ExtendedInventoryScreen::getItems(const Touch::InventoryPane& pane)\n{\n\treturn itemVector;\n}<commit_msg>woops I need this<commit_after>#include \"ExtendedInventoryScreen.h\"\n\n#include \"InventoryTransitions.h\"\n#include \"..\/..\/creative\/CreativeTab.h\"\n\n#include \"com\/mojang\/minecraftpe\/client\/MinecraftClient.h\"\n#include \"com\/mojang\/minecraftpe\/client\/gui\/NinePatchLayer.h\"\n#include \"com\/mojang\/minecraftpe\/client\/gui\/IntRectangle.h\"\n#include \"com\/mojang\/minecraftpe\/client\/gui\/ImageWithBackground.h\"\n#include \"com\/mojang\/minecraftpe\/client\/gui\/InventoryTab.h\"\n#include \"com\/mojang\/minecraftpe\/client\/settings\/Options.h\"\n#include \"com\/mojang\/minecraftpe\/client\/renderer\/Tessellator.h\"\n#include \"com\/mojang\/minecraftpe\/client\/renderer\/texture\/TextureGroup.h\"\n#include \"com\/mojang\/minecraftpe\/client\/renderer\/entity\/ItemRenderer.h\"\n#include \"com\/mojang\/minecraftpe\/client\/renderer\/ShaderColor.h\"\n#include \"com\/mojang\/minecraftpe\/world\/item\/ItemInstance.h\"\n\nExtendedInventoryScreen::ExtendedInventoryScreen(MinecraftClient& client, std::vector<CreativeTab*> creativeTabs)\n\t: Screen(client)\n{\n\tcloseButton = NULL;\n\tbackgroundLayer = NULL;\n\tleftButtonLayer = NULL;\n\trightButtonLayer = NULL;\n\townedTabs = creativeTabs;\n\ttestPane = NULL;\n}\n\nbool ExtendedInventoryScreen::renderGameBehind() const\n{\n\treturn mcClient->getOptions()->getFancyGraphics();\n}\n\nbool ExtendedInventoryScreen::closeOnPlayerHurt() const\n{\n\treturn true;\n}\n\nvoid ExtendedInventoryScreen::init()\n{\n\tif(!closeButton)\n\t{\n\t\tInventoryTransitions::init(this);\n\t\t\n\t\tNinePatchFactory factory (mcClient->getTextures(), \"gui\/spritesheet.png\");\n\t\t\n\t\tbackgroundLayer = std::shared_ptr<NinePatchLayer>(factory.createSymmetrical({34, 43, 14, 14}, 3, 3, 14.0F, 14.0F));\n\t\tleftButtonLayer = std::shared_ptr<NinePatchLayer>(factory.createSymmetrical({49, 43, 14, 14}, 3, 3, 14.0F, 14.0F));\n\t\trightButtonLayer = std::shared_ptr<NinePatchLayer>(factory.createSymmetrical({65, 55, 14, 14}, 3, 3, 14.0F, 14.0F));\n\t\t\n\t\tcloseButton = std::make_shared<ImageWithBackground>(2);\n\t\tcloseButton->init(mcClient->getTextures(), 28, 28, {49, 43, 14, 14}, {49, 43, 14, 14}, 2, 2, \"gui\/spritesheet.png\");\n\t\tcloseButton->setImageDef({mcClient->getTextures()->getTexture(\"gui\/spritesheet.png\", TextureLocation::Default), 0, 1, 18.0F, 18.0F, {60, 0, 18, 18}, true}, true);\n\t\t\n\t\tfor(int tab = 0; tab < ownedTabs.size(); tab++)\n\t\t{\n\t\t\trenderedTabs.emplace_back(createInventoryTab(tab + 3, ((tab < 4) ? false : true)));\n\t\t}\n\t\t\n\t\tselectedTabIndex = 0;\n\t\t\n\t\tbuttonList.emplace_back(closeButton);\n\t}\n}\n\nvoid ExtendedInventoryScreen::render(int i1, int i2, float f1)\n{\n\tif(renderGameBehind())\n\t\trenderBackground(1);\n\telse\n\t\trenderDirtBackground();\n\t\n\trenderToolBar(f1, 1.0F, false);\n\t\n\tfor(int tab = 0; tab < renderedTabs.size(); tab++)\n\t{\n\t\tif(tab != selectedTabIndex)\n\t\t{\n\t\t\trenderedTabs[tab]->renderBg(mcClient, i1, i2);\n\t\t\tdrawTabIcon(ownedTabs[tab], renderedTabs[tab], renderedTabs[tab]->pressed, false);\n\t\t}\n\t}\n\t\n\tbackgroundLayer->draw(Tessellator::instance, backgroundLayer->xPosition, backgroundLayer->yPosition);\n\t\n\trenderedTabs[selectedTabIndex]->renderBg(mcClient, i1, i2);\n\tdrawTabIcon(ownedTabs[selectedTabIndex], renderedTabs[selectedTabIndex], renderedTabs[selectedTabIndex]->pressed, true);\t\n\t\n\tInventoryTransitions::render(this, i1, i2, f1);\n\t\n\tScreen::render(i1, i2, f1);\n\t\n\tcurrentShaderColor.setColor(Color::WHITE);\n\t\n\tfill(backgroundLayer->xPosition + 5, backgroundLayer->yPosition + 4, width - 38, height - 27, {0.2F, 0.2F, 0.2F, 1.0F});\n\t\n\ttestPane->render(i1, i2, f1, mcClient);\n\t\n\trenderOnSelectItemNameText(width, mcClient->getFont(), height - 41);\n}\n\nvoid ExtendedInventoryScreen::setupPositions()\n{\n\tbackgroundLayer->xPosition = 31;\n\tbackgroundLayer->yPosition = 2;\n\tbackgroundLayer->setSize((float)(width - 26 - 28) - 4.0F - 6.0F, (float)height - 25.0F);\n\t\n\tcloseButton->xPosition = backgroundLayer->xPosition - 26;\n\tcloseButton->yPosition = backgroundLayer->yPosition;\n\t\n\tcloseButton->setSize(29, 28);\n\t\n\tfor(int tab = 0; tab < renderedTabs.size(); tab++)\n\t{\n\t\tif(!renderedTabs[tab]->isRight)\n\t\t{\n\t\t\trenderedTabs[tab]->xPosition = backgroundLayer->xPosition - 26;\n\t\t\trenderedTabs[tab]->yPosition = height - 25 - 29 - (tab * 31);\n\t\t}\n\t\telse\n\t\t{\n\t\t\trenderedTabs[tab]->xPosition = width - 6 - 29;\n\t\t\trenderedTabs[tab]->yPosition = height - 25 - 29 - ((tab - 4) * 31);\n\t\t}\n\t\trenderedTabs[tab]->width = 29;\n\t\trenderedTabs[tab]->height = 29;\n\t}\n\t\n\ttestPane = std::shared_ptr<Touch::InventoryPane>(new Touch::InventoryPane(this, *mcClient, {backgroundLayer->xPosition + 11, backgroundLayer->yPosition + 8, width - backgroundLayer->xPosition - 53, height - 41}, 1, 1.0F, 5, 26, 1, false, true, false));\n\t\n\ttestPane->xPosition = backgroundLayer->xPosition + 11;\n\ttestPane->yPosition = backgroundLayer->yPosition + 8;\n\ttestPane->width = width - backgroundLayer->xPosition - 53;\n\ttestPane->height = height - 41;\n\t\n\tInventoryTransitions::setupPositions(this);\n}\n\nvoid ExtendedInventoryScreen::_buttonClicked(Button& button)\n{\n\tInventoryTransitions::_buttonClicked(this, button);\n\t\n\tif(button.id == closeButton->id)\n\t\tInventoryTransitions::pushPreviousScreen(this);\n}\n\nvoid ExtendedInventoryScreen::_pointerReleased(int x, int y)\n{\n\tScreen::_pointerReleased(x, y);\n\t\n\tfor(int tab = 0; tab < renderedTabs.size(); tab++)\n\t{\n\t\tif(tab != selectedTabIndex && renderedTabs[tab]->isInside(x, y) && renderedTabs[tab]->pressed)\n\t\t\tselectedTabIndex = tab;\n\t\t\n\t\trenderedTabs[tab]->pressed = false;\n\t}\n}\n\nvoid ExtendedInventoryScreen::_pointerPressed(int x, int y)\n{\n\tScreen::_pointerPressed(x, y);\n\t\n\tfor(int tab = 0; tab < renderedTabs.size(); tab++)\n\t{\n\t\tif(renderedTabs[tab]->isInside(x, y))\n\t\t{\n\t\t\trenderedTabs[tab]->pressed = true;\n\t\t\treturn;\n\t\t}\n\t}\n}\n\nvoid ExtendedInventoryScreen::handleBackEvent(bool b1)\n{\n\tif(!b1)\n\t\tInventoryTransitions::pushPreviousScreen(this);\n}\n\nbool ExtendedInventoryScreen::isModal() const\n{\n\treturn true;\n}\n\nvoid ExtendedInventoryScreen::tick()\n{\n\t\n}\n\nstd::string ExtendedInventoryScreen::getScreenName()\n{\n\treturn \"extended_creative_screen\";\n}\n\nstd::shared_ptr<InventoryTab> ExtendedInventoryScreen::createInventoryTab(int id, bool isRight)\n{\n\tNinePatchLayer* buttonLayer = isRight ? rightButtonLayer.get() : leftButtonLayer.get();\n\tstd::shared_ptr<InventoryTab> button = std::make_shared<InventoryTab>(id, \"\", buttonLayer, isRight);\n\tbutton->setOverrideScreenRendering(true);\n\treturn button;\n}\n\nvoid ExtendedInventoryScreen::drawTabIcon(CreativeTab* ownedTab, std::shared_ptr<InventoryTab> imageButton, bool isPressed, bool isSelected)\n{\n\tItemRenderer::getInstance()->renderGuiItemNew(ownedTab->getTabIcon(), 0, ((float)imageButton->xPosition + (float)((imageButton->width \/ 2) - 8) + (isPressed ? 1.0F : 0.7F)), ((float)imageButton->yPosition + (float)((imageButton->height \/ 2) - 8)), 1.0F, (isSelected ? 1.0F : 0.7F), (((float)imageButton->width) - (isPressed ? 2.0F : 0.0F)) * 0.04F, false);\n}\n\nbool ExtendedInventoryScreen::addItem(Touch::InventoryPane& pane, int slot)\n{\n\treturn true;\n}\n\nbool ExtendedInventoryScreen::isAllowed(int slot)\n{\n\treturn true;\n}\n\nstd::vector<const ItemInstance*> ExtendedInventoryScreen::getItems(const Touch::InventoryPane& pane)\n{\n\tstd::vector<const ItemInstance*> itemVector = {new ItemInstance(4, 1, 0), new ItemInstance(98, 1, 0), new ItemInstance(98, 1, 1), new ItemInstance(4, 1, 0), new ItemInstance(98, 1, 0), new ItemInstance(98, 1, 1), new ItemInstance(4, 1, 0), new ItemInstance(98, 1, 0), new ItemInstance(98, 1, 1), new ItemInstance(4, 1, 0), new ItemInstance(98, 1, 0), new ItemInstance(98, 1, 1), new ItemInstance(4, 1, 0), new ItemInstance(98, 1, 0), new ItemInstance(98, 1, 1), new ItemInstance(4, 1, 0), new ItemInstance(98, 1, 0), new ItemInstance(98, 1, 1), new ItemInstance(4, 1, 0), new ItemInstance(98, 1, 0), new ItemInstance(98, 1, 1), new ItemInstance(4, 1, 0), new ItemInstance(98, 1, 0), new ItemInstance(98, 1, 1), new ItemInstance(4, 1, 0), new ItemInstance(98, 1, 0), new ItemInstance(98, 1, 1), new ItemInstance(4, 1, 0), new ItemInstance(98, 1, 0), new ItemInstance(98, 1, 1), new ItemInstance(4, 1, 0), new ItemInstance(98, 1, 0), new ItemInstance(98, 1, 1), new ItemInstance(4, 1, 0), new ItemInstance(98, 1, 0), new ItemInstance(98, 1, 1), new ItemInstance(4, 1, 0), new ItemInstance(98, 1, 0), new ItemInstance(98, 1, 1), new ItemInstance(4, 1, 0), new ItemInstance(98, 1, 0), new ItemInstance(98, 1, 1), new ItemInstance(4, 1, 0), new ItemInstance(98, 1, 0), new ItemInstance(98, 1, 1), new ItemInstance(4, 1, 0), new ItemInstance(98, 1, 0), new ItemInstance(98, 1, 1), new ItemInstance(4, 1, 0), new ItemInstance(98, 1, 0), new ItemInstance(98, 1, 1), new ItemInstance(4, 1, 0), new ItemInstance(98, 1, 0), new ItemInstance(98, 1, 1), new ItemInstance(4, 1, 0), new ItemInstance(98, 1, 0), new ItemInstance(98, 1, 1), new ItemInstance(4, 1, 0), new ItemInstance(98, 1, 0), new ItemInstance(98, 1, 1), new ItemInstance(4, 1, 0), new ItemInstance(98, 1, 0), new ItemInstance(98, 1, 1), new ItemInstance(4, 1, 0), new ItemInstance(98, 1, 0), new ItemInstance(98, 1, 1), new ItemInstance(4, 1, 0), new ItemInstance(98, 1, 0), new ItemInstance(98, 1, 1), new ItemInstance(4, 1, 0), new ItemInstance(98, 1, 0), new ItemInstance(98, 1, 1)};\n\treturn itemVector;\n}<|endoftext|>"} {"text":"<commit_before>\/*********************************************************************************\n *\n * Inviwo - Interactive Visualization Workshop\n *\n * Copyright (c) 2019-2021 Inviwo Foundation\n * All rights reserved.\n *\n * Redistribution and use in source and binary forms, with or without\n * modification, are permitted provided that the following conditions are met:\n *\n * 1. Redistributions of source code must retain the above copyright notice, this\n * list of conditions and the following disclaimer.\n * 2. Redistributions in binary form must reproduce the above copyright notice,\n * this list of conditions and the following disclaimer in the documentation\n * and\/or other materials provided with the distribution.\n *\n * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS \"AS IS\" AND\n * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED\n * WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE\n * DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE FOR\n * ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES\n * (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;\n * LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND\n * ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT\n * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS\n * SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.\n *\n *********************************************************************************\/\n\n#ifdef _MSC_VER\n#pragma comment(linker, \"\/SUBSYSTEM:CONSOLE\")\n#ifdef IVW_ENABLE_MSVC_MEM_LEAK_TEST\n#include <vld.h>\n#endif\n#endif\n\n#include <inviwo\/core\/common\/inviwoapplication.h>\n#include <inviwo\/core\/util\/logcentral.h>\n#include <inviwo\/core\/util\/consolelogger.h>\n#include <inviwo\/core\/common\/coremodulesharedlibrary.h>\n#include <modules\/base\/basemodulesharedlibrary.h>\n#include <inviwo\/dataframe\/dataframemodulesharedlibrary.h>\n#include <modules\/json\/jsonmodulesharedlibrary.h>\n#include <modules\/python3\/python3modulesharedlibrary.h>\n#include <inviwo\/dataframepython\/dataframepythonmodulesharedlibrary.h>\n\n#include <inviwo\/testutil\/configurablegtesteventlistener.h>\n\n#include <warn\/push>\n#include <warn\/ignore\/all>\n#include <gtest\/gtest.h>\n#include <warn\/pop>\n\nint main(int argc, char** argv) {\n using namespace inviwo;\n LogCentral::init();\n auto logger = std::make_shared<ConsoleLogger>();\n LogCentral::getPtr()->setVerbosity(LogVerbosity::Error);\n LogCentral::getPtr()->registerLogger(logger);\n InviwoApplication app(argc, argv, \"Inviwo-Unittests-DataFramePython\");\n\n {\n std::vector<std::unique_ptr<InviwoModuleFactoryObject>> modules;\n modules.emplace_back(createInviwoCore());\n modules.emplace_back(createBaseModule());\n modules.emplace_back(createJSONModule());\n modules.emplace_back(createDataFrameModule());\n modules.emplace_back(createPython3Module());\n modules.emplace_back(createDataFramePythonModule());\n app.registerModules(std::move(modules));\n }\n\n app.processFront();\n\n int ret = -1;\n {\n#ifdef IVW_ENABLE_MSVC_MEM_LEAK_TEST\n VLDDisable();\n ::testing::InitGoogleTest(&argc, argv);\n VLDEnable();\n#else\n ::testing::InitGoogleTest(&argc, argv);\n#endif\n inviwo::ConfigurableGTestEventListener::setup();\n ret = RUN_ALL_TESTS();\n }\n return ret;\n}\n<commit_msg>Testing: dependency fix in DataFramePython unit test<commit_after>\/*********************************************************************************\n *\n * Inviwo - Interactive Visualization Workshop\n *\n * Copyright (c) 2019-2021 Inviwo Foundation\n * All rights reserved.\n *\n * Redistribution and use in source and binary forms, with or without\n * modification, are permitted provided that the following conditions are met:\n *\n * 1. Redistributions of source code must retain the above copyright notice, this\n * list of conditions and the following disclaimer.\n * 2. Redistributions in binary form must reproduce the above copyright notice,\n * this list of conditions and the following disclaimer in the documentation\n * and\/or other materials provided with the distribution.\n *\n * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS \"AS IS\" AND\n * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED\n * WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE\n * DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE FOR\n * ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES\n * (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;\n * LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND\n * ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT\n * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS\n * SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.\n *\n *********************************************************************************\/\n\n#ifdef _MSC_VER\n#pragma comment(linker, \"\/SUBSYSTEM:CONSOLE\")\n#ifdef IVW_ENABLE_MSVC_MEM_LEAK_TEST\n#include <vld.h>\n#endif\n#endif\n\n#include <inviwo\/core\/common\/inviwoapplication.h>\n#include <inviwo\/core\/util\/logcentral.h>\n#include <inviwo\/core\/util\/consolelogger.h>\n#include <inviwo\/core\/common\/coremodulesharedlibrary.h>\n#include <modules\/base\/basemodulesharedlibrary.h>\n#include <inviwo\/dataframe\/dataframemodulesharedlibrary.h>\n#include <modules\/json\/jsonmodulesharedlibrary.h>\n#include <modules\/python3\/python3modulesharedlibrary.h>\n#include <inviwo\/dataframepython\/dataframepythonmodulesharedlibrary.h>\n#include <modules\/brushingandlinking\/brushingandlinkingmodulesharedlibrary.h>\n\n#include <inviwo\/testutil\/configurablegtesteventlistener.h>\n\n#include <warn\/push>\n#include <warn\/ignore\/all>\n#include <gtest\/gtest.h>\n#include <warn\/pop>\n\nint main(int argc, char** argv) {\n using namespace inviwo;\n LogCentral::init();\n auto logger = std::make_shared<ConsoleLogger>();\n LogCentral::getPtr()->setVerbosity(LogVerbosity::Error);\n LogCentral::getPtr()->registerLogger(logger);\n InviwoApplication app(argc, argv, \"Inviwo-Unittests-DataFramePython\");\n\n {\n std::vector<std::unique_ptr<InviwoModuleFactoryObject>> modules;\n modules.emplace_back(createInviwoCore());\n modules.emplace_back(createBaseModule());\n modules.emplace_back(createJSONModule());\n modules.emplace_back(createDataFrameModule());\n modules.emplace_back(createBrushingAndLinkingModule());\n modules.emplace_back(createPython3Module());\n modules.emplace_back(createDataFramePythonModule());\n app.registerModules(std::move(modules));\n }\n\n app.processFront();\n\n int ret = -1;\n {\n#ifdef IVW_ENABLE_MSVC_MEM_LEAK_TEST\n VLDDisable();\n ::testing::InitGoogleTest(&argc, argv);\n VLDEnable();\n#else\n ::testing::InitGoogleTest(&argc, argv);\n#endif\n inviwo::ConfigurableGTestEventListener::setup();\n ret = RUN_ALL_TESTS();\n }\n return ret;\n}\n<|endoftext|>"} {"text":"<commit_before>\/\/ This file is a part of the OpenSurgSim project.\n\/\/ Copyright 2013, SimQuest Solutions Inc.\n\/\/\n\/\/ Licensed under the Apache License, Version 2.0 (the \"License\");\n\/\/ you may not use this file except in compliance with the License.\n\/\/ You may obtain a copy of the License at\n\/\/\n\/\/ http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n\/\/\n\/\/ Unless required by applicable law or agreed to in writing, software\n\/\/ distributed under the License is distributed on an \"AS IS\" BASIS,\n\/\/ WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n\/\/ See the License for the specific language governing permissions and\n\/\/ limitations under the License.\n\n#include \"SurgSim\/Collision\/TriangleMeshTriangleMeshDcdContact.h\"\n#include \"SurgSim\/Collision\/UnitTests\/ContactCalculationTestsCommon.h\"\n#include \"SurgSim\/Framework\/Runtime.h\"\n#include \"SurgSim\/Framework\/Timer.h\"\n\nusing SurgSim::Math::MeshShape;\nusing SurgSim::Math::RigidTransform3d;\nusing SurgSim::Math::Vector3d;\n\nnamespace SurgSim\n{\nnamespace Collision\n{\n\nTEST(TriangleMeshTriangleMeshContactCalculationPerformanceTests, IntersectionTest)\n{\n\n\tauto runtime = std::make_shared<SurgSim::Framework::Runtime>(\"config.txt\");\n\tauto meshA = std::make_shared<MeshShape>();\n\tmeshA->load(\"MeshShapeData\/stapler_collision.ply\");\n\n\tauto meshB = std::make_shared<MeshShape>();\n\tmeshB->load(\"MeshShapeData\/wound_deformable.ply\");\n\n\tstd::shared_ptr<ShapeCollisionRepresentation> meshARep =\n\t\tstd::make_shared<ShapeCollisionRepresentation>(\"Collision Mesh 0\");\n\tmeshARep->setShape(meshA);\n\n\tstd::shared_ptr<ShapeCollisionRepresentation> meshBRep =\n\t\tstd::make_shared<ShapeCollisionRepresentation>(\"Collision Mesh 1\");\n\tmeshBRep->setShape(meshB);\n\n\tTriangleMeshTriangleMeshDcdContact calcContact;\n\tstd::shared_ptr<CollisionPair> pair = std::make_shared<CollisionPair>(meshARep, meshBRep);\n\n\tFramework::Timer timer;\n\tint loops = 100;\n\tsize_t contacts = 0;\n\tfor (int i = 0 ; i < loops; ++i)\n\t{\n\t\tpair->clearContacts();\n\t\tmeshARep->getCollisions().unsafeGet().clear();\n\t\tmeshBRep->getCollisions().unsafeGet().clear();\n\t\tRigidTransform3d pose = \n\t\t\tMath::makeRigidTransform(Math::makeRotationQuaternion(2.0 * M_PI * i \/ loops, Vector3d::UnitX().eval()),\n\t\t\tVector3d(i, -1.5 * i, 0.0));\n\t\tmeshARep->setLocalPose(pose);\n\t\tmeshBRep->setLocalPose(pose);\n\t\ttimer.beginFrame();\n\t\tcalcContact.calculateContact(pair);\n\t\ttimer.endFrame();\n\t\tcontacts += pair->getContacts().size();\n\t}\n\n\tRecordProperty(\"FrameRate\", boost::to_string(loops \/ timer.getCumulativeTime()));\n\tRecordProperty(\"Duration\", boost::to_string(timer.getCumulativeTime()));\n\tRecordProperty(\"Loops\", boost::to_string(loops));\n}\n\n}\n}\n<commit_msg>Fix cpplint warning<commit_after>\/\/ This file is a part of the OpenSurgSim project.\n\/\/ Copyright 2013, SimQuest Solutions Inc.\n\/\/\n\/\/ Licensed under the Apache License, Version 2.0 (the \"License\");\n\/\/ you may not use this file except in compliance with the License.\n\/\/ You may obtain a copy of the License at\n\/\/\n\/\/ http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n\/\/\n\/\/ Unless required by applicable law or agreed to in writing, software\n\/\/ distributed under the License is distributed on an \"AS IS\" BASIS,\n\/\/ WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n\/\/ See the License for the specific language governing permissions and\n\/\/ limitations under the License.\n\n#include \"SurgSim\/Collision\/TriangleMeshTriangleMeshDcdContact.h\"\n#include \"SurgSim\/Collision\/UnitTests\/ContactCalculationTestsCommon.h\"\n#include \"SurgSim\/Framework\/Runtime.h\"\n#include \"SurgSim\/Framework\/Timer.h\"\n\nusing SurgSim::Math::MeshShape;\nusing SurgSim::Math::RigidTransform3d;\nusing SurgSim::Math::Vector3d;\n\nnamespace SurgSim\n{\nnamespace Collision\n{\n\nTEST(TriangleMeshTriangleMeshContactCalculationPerformanceTests, IntersectionTest)\n{\n\n\tauto runtime = std::make_shared<SurgSim::Framework::Runtime>(\"config.txt\");\n\tauto meshA = std::make_shared<MeshShape>();\n\tmeshA->load(\"MeshShapeData\/stapler_collision.ply\");\n\n\tauto meshB = std::make_shared<MeshShape>();\n\tmeshB->load(\"MeshShapeData\/wound_deformable.ply\");\n\n\tstd::shared_ptr<ShapeCollisionRepresentation> meshARep =\n\t\tstd::make_shared<ShapeCollisionRepresentation>(\"Collision Mesh 0\");\n\tmeshARep->setShape(meshA);\n\n\tstd::shared_ptr<ShapeCollisionRepresentation> meshBRep =\n\t\tstd::make_shared<ShapeCollisionRepresentation>(\"Collision Mesh 1\");\n\tmeshBRep->setShape(meshB);\n\n\tTriangleMeshTriangleMeshDcdContact calcContact;\n\tstd::shared_ptr<CollisionPair> pair = std::make_shared<CollisionPair>(meshARep, meshBRep);\n\n\tFramework::Timer timer;\n\tint loops = 100;\n\tsize_t contacts = 0;\n\tfor (int i = 0 ; i < loops; ++i)\n\t{\n\t\tpair->clearContacts();\n\t\tmeshARep->getCollisions().unsafeGet().clear();\n\t\tmeshBRep->getCollisions().unsafeGet().clear();\n\t\tRigidTransform3d pose =\n\t\t\tMath::makeRigidTransform(Math::makeRotationQuaternion(2.0 * M_PI * i \/ loops, Vector3d::UnitX().eval()),\n\t\t\tVector3d(i, -1.5 * i, 0.0));\n\t\tmeshARep->setLocalPose(pose);\n\t\tmeshBRep->setLocalPose(pose);\n\t\ttimer.beginFrame();\n\t\tcalcContact.calculateContact(pair);\n\t\ttimer.endFrame();\n\t\tcontacts += pair->getContacts().size();\n\t}\n\n\tRecordProperty(\"FrameRate\", boost::to_string(loops \/ timer.getCumulativeTime()));\n\tRecordProperty(\"Duration\", boost::to_string(timer.getCumulativeTime()));\n\tRecordProperty(\"Loops\", boost::to_string(loops));\n}\n\n}\n}\n<|endoftext|>"} {"text":"<commit_before>\/*\n * Copyright (c) 2015, Nagoya University\n * All rights reserved.\n *\n * Redistribution and use in source and binary forms, with or without\n * modification, are permitted provided that the following conditions are met:\n *\n * * Redistributions of source code must retain the above copyright notice, this\n * list of conditions and the following disclaimer.\n *\n * * Redistributions in binary form must reproduce the above copyright notice,\n * this list of conditions and the following disclaimer in the documentation\n * and\/or other materials provided with the distribution.\n *\n * * Neither the name of Autoware nor the names of its\n * contributors may be used to endorse or promote products derived from\n * this software without specific prior written permission.\n *\n * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS \"AS IS\"\n * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE\n * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE\n * DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE\n * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL\n * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR\n * SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER\n * CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,\n * OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE\n * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.\n*\/\n\n#include <ros\/ros.h>\n#include <std_msgs\/String.h>\n#include <geometry_msgs\/PoseWithCovarianceStamped.h>\n#include <geometry_msgs\/PoseStamped.h>\n#include <tf\/transform_broadcaster.h>\n#include <tf\/transform_listener.h>\n#include <tf\/tf.h>\n#include <iostream>\n\n#include \"waypoint_follower\/libwaypoint_follower.h\"\n\nnamespace\n{\ngeometry_msgs::Twist _current_velocity;\n\nconst std::string SIMULATION_FRAME = \"sim_base_link\";\nconst std::string MAP_FRAME = \"map\";\n\ngeometry_msgs::Pose _initial_pose;\nbool _initial_set = false;\nbool _pose_set = false;\nbool _waypoint_set = false;\nWayPoints _current_waypoints;\nros::Publisher g_odometry_publisher;\nros::Publisher g_velocity_publisher;\n\nconstexpr int LOOP_RATE = 50; \/\/ 50Hz\n\nvoid CmdCallBack(const geometry_msgs::TwistStampedConstPtr &msg, double accel_rate)\n{\n\n static double previous_linear_velocity = 0;\n\n if(_current_velocity.linear.x < msg->twist.linear.x)\n {\n _current_velocity.linear.x = previous_linear_velocity + accel_rate \/ (double)LOOP_RATE;\n\n if(_current_velocity.linear.x > msg->twist.linear.x)\n {\n _current_velocity.linear.x = msg->twist.linear.x;\n }\n }\n else\n {\n _current_velocity.linear.x = previous_linear_velocity - accel_rate \/ (double)LOOP_RATE;\n\n if(_current_velocity.linear.x < msg->twist.linear.x)\n {\n _current_velocity.linear.x = msg->twist.linear.x;\n }\n }\n\n previous_linear_velocity = _current_velocity.linear.x;\n\n _current_velocity.angular.z = msg->twist.angular.z;\n\n\n \/\/_current_velocity = msg->twist;\n}\n\nvoid getTransformFromTF(const std::string parent_frame, const std::string child_frame, tf::StampedTransform &transform)\n{\n static tf::TransformListener listener;\n\n while (1)\n {\n try\n {\n listener.lookupTransform(parent_frame, child_frame, ros::Time(0), transform);\n break;\n }\n catch (tf::TransformException ex)\n {\n ROS_ERROR(\"%s\", ex.what());\n ros::Duration(1.0).sleep();\n }\n }\n}\n\nvoid initialposeCallback(const geometry_msgs::PoseWithCovarianceStampedConstPtr &input)\n{\n tf::StampedTransform transform;\n getTransformFromTF(MAP_FRAME, \"world\", transform);\n\n _initial_pose.position.x = input->pose.pose.position.x + transform.getOrigin().x();\n _initial_pose.position.y = input->pose.pose.position.y + transform.getOrigin().y();\n _initial_pose.position.z = input->pose.pose.position.z + transform.getOrigin().z();\n _initial_pose.orientation = input->pose.pose.orientation;\n\n _initial_set = true;\n _pose_set = false;\n}\n\nvoid callbackFromPoseStamped(const geometry_msgs::PoseStampedConstPtr &msg)\n{\n _initial_pose = msg->pose;\n _initial_set = true;\n}\n\nvoid waypointCallback(const waypoint_follower::laneConstPtr &msg)\n{\n \/\/ _path_og.setPath(msg);\n _current_waypoints.setPath(*msg);\n _waypoint_set = true;\n \/\/ROS_INFO_STREAM(\"waypoint subscribed\");\n}\n\nvoid publishOdometry()\n{\n static ros::Time current_time = ros::Time::now();\n static ros::Time last_time = ros::Time::now();\n static geometry_msgs::Pose pose;\n static double th = 0;\n static tf::TransformBroadcaster odom_broadcaster;\n\n if (!_pose_set)\n {\n pose.position = _initial_pose.position;\n pose.orientation = _initial_pose.orientation;\n th = tf::getYaw(pose.orientation);\n ROS_INFO_STREAM(\"pose set : (\" << pose.position.x << \" \" << pose.position.y << \" \" << pose.position.z << \" \" << th\n << \")\");\n _pose_set = true;\n }\n\n \/*int closest_waypoint = getClosestWaypoint(_current_waypoints.getCurrentWaypoints(), pose);\n if (closest_waypoint == -1)\n {\n ROS_INFO(\"cannot publish odometry because closest waypoint is -1.\");\n return;\n }\n else\n {\n pose.position.z = _current_waypoints.getWaypointPosition(closest_waypoint).z;\n }\n*\/if(_waypoint_set)\n pose.position.z = _current_waypoints.getWaypointPosition(1).z;\n\n double vx = _current_velocity.linear.x;\n double vth = _current_velocity.angular.z;\n current_time = ros::Time::now();\n\n \/\/ compute odometry in a typical way given the velocities of the robot\n double dt = (current_time - last_time).toSec();\n double delta_x = (vx * cos(th)) * dt;\n double delta_y = (vx * sin(th)) * dt;\n double delta_th = vth * dt;\n\n pose.position.x += delta_x;\n pose.position.y += delta_y;\n th += delta_th;\n pose.orientation = tf::createQuaternionMsgFromYaw(th);\n\n \/\/ std::cout << \"delta (x y th) : (\" << delta_x << \" \" << delta_y << \" \" << delta_th << \")\" << std::endl;\n \/\/ std::cout << \"current_velocity(linear.x angular.z) : (\" << _current_velocity.linear.x << \" \" <<\n \/\/ _current_velocity.angular.z << \")\"<< std::endl;\n \/\/ std::cout << \"current_pose : (\" << pose.position.x << \" \" << pose.position.y<< \" \" << pose.position.z << \" \" <<\n \/\/ th << \")\" << std::endl << std::endl;\n\n \/\/ first, we'll publish the transform over tf\n geometry_msgs::TransformStamped odom_trans;\n odom_trans.header.stamp = current_time;\n odom_trans.header.frame_id = MAP_FRAME;\n odom_trans.child_frame_id = SIMULATION_FRAME;\n\n odom_trans.transform.translation.x = pose.position.x;\n odom_trans.transform.translation.y = pose.position.y;\n odom_trans.transform.translation.z = pose.position.z;\n odom_trans.transform.rotation = pose.orientation;\n\n \/\/ send the transform\n odom_broadcaster.sendTransform(odom_trans);\n\n \/\/ next, we'll publish the odometry message over ROS\n std_msgs::Header h;\n h.stamp = current_time;\n h.frame_id = MAP_FRAME;\n\n geometry_msgs::PoseStamped ps;\n ps.header = h;\n ps.pose = pose;\n\n geometry_msgs::TwistStamped ts;\n ts.header = h;\n ts.twist.linear.x = vx;\n ts.twist.angular.z = vth;\n\n \/\/ publish the message\n g_odometry_publisher.publish(ps);\n g_velocity_publisher.publish(ts);\n\n last_time = current_time;\n}\n}\nint main(int argc, char **argv)\n{\n ros::init(argc, argv, \"wf_simulator\");\n\n ros::NodeHandle nh;\n ros::NodeHandle private_nh(\"~\");\n\n std::string initialize_source;\n private_nh.getParam(\"initialize_source\", initialize_source);\n ROS_INFO_STREAM(\"initialize_source : \" << initialize_source);\n\n double accel_rate;\n private_nh.param(\"accel_rate\",accel_rate,double(1.0));\n ROS_INFO_STREAM(\"accel_rate : \" << accel_rate);\n \/\/ publish topic\n g_odometry_publisher = nh.advertise<geometry_msgs::PoseStamped>(\"sim_pose\", 10);\n g_velocity_publisher = nh.advertise<geometry_msgs::TwistStamped>(\"sim_velocity\", 10);\n\n \/\/ subscribe topic\n ros::Subscriber cmd_subscriber = nh.subscribe<geometry_msgs::TwistStamped>(\"twist_cmd\", 10, boost::bind(CmdCallBack, _1, accel_rate));\n ros::Subscriber waypoint_subcscriber = nh.subscribe(\"base_waypoints\", 10, waypointCallback);\n ros::Subscriber initialpose_subscriber;\n\n if (initialize_source == \"Rviz\")\n {\n initialpose_subscriber = nh.subscribe(\"initialpose\", 10, initialposeCallback);\n }\n else if (initialize_source == \"ndt_localizer\")\n {\n initialpose_subscriber = nh.subscribe(\"ndt_pose\", 10, callbackFromPoseStamped);\n }\n else if (initialize_source == \"GNSS\")\n {\n initialpose_subscriber = nh.subscribe(\"gnss_pose\", 10, callbackFromPoseStamped);\n }\n else\n {\n ROS_INFO(\"Set pose initializer!!\");\n }\n\n ros::Rate loop_rate(LOOP_RATE);\n while (ros::ok())\n {\n ros::spinOnce(); \/\/ check subscribe topic\n\n \/*if (!_waypoint_set)\n {\n loop_rate.sleep();\n continue;\n }*\/\n\n if (!_initial_set)\n {\n loop_rate.sleep();\n continue;\n }\n\n publishOdometry();\n\n loop_rate.sleep();\n }\n\n return 0;\n}\n<commit_msg>Add subscription for closest waypoint<commit_after>\/*\n * Copyright (c) 2015, Nagoya University\n * All rights reserved.\n *\n * Redistribution and use in source and binary forms, with or without\n * modification, are permitted provided that the following conditions are met:\n *\n * * Redistributions of source code must retain the above copyright notice, this\n * list of conditions and the following disclaimer.\n *\n * * Redistributions in binary form must reproduce the above copyright notice,\n * this list of conditions and the following disclaimer in the documentation\n * and\/or other materials provided with the distribution.\n *\n * * Neither the name of Autoware nor the names of its\n * contributors may be used to endorse or promote products derived from\n * this software without specific prior written permission.\n *\n * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS \"AS IS\"\n * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE\n * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE\n * DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE\n * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL\n * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR\n * SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER\n * CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,\n * OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE\n * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.\n*\/\n\n#include <ros\/ros.h>\n#include <std_msgs\/String.h>\n#include <geometry_msgs\/PoseWithCovarianceStamped.h>\n#include <geometry_msgs\/PoseStamped.h>\n#include <tf\/transform_broadcaster.h>\n#include <tf\/transform_listener.h>\n#include <tf\/tf.h>\n#include <iostream>\n#include <std_msgs\/Int32.h>\n\n#include \"waypoint_follower\/libwaypoint_follower.h\"\n\nnamespace\n{\ngeometry_msgs::Twist _current_velocity;\n\nconst std::string SIMULATION_FRAME = \"sim_base_link\";\nconst std::string MAP_FRAME = \"map\";\n\ngeometry_msgs::Pose _initial_pose;\nbool _initial_set = false;\nbool _pose_set = false;\nbool _waypoint_set = false;\nbool g_is_closest_waypoint_subscribed = false;\nWayPoints _current_waypoints;\nros::Publisher g_odometry_publisher;\nros::Publisher g_velocity_publisher;\nint32_t g_closest_waypoint = -1;\n\nconstexpr int LOOP_RATE = 50; \/\/ 50Hz\n\nvoid CmdCallBack(const geometry_msgs::TwistStampedConstPtr &msg, double accel_rate)\n{\n\n static double previous_linear_velocity = 0;\n\n if(_current_velocity.linear.x < msg->twist.linear.x)\n {\n _current_velocity.linear.x = previous_linear_velocity + accel_rate \/ (double)LOOP_RATE;\n\n if(_current_velocity.linear.x > msg->twist.linear.x)\n {\n _current_velocity.linear.x = msg->twist.linear.x;\n }\n }\n else\n {\n _current_velocity.linear.x = previous_linear_velocity - accel_rate \/ (double)LOOP_RATE;\n\n if(_current_velocity.linear.x < msg->twist.linear.x)\n {\n _current_velocity.linear.x = msg->twist.linear.x;\n }\n }\n\n previous_linear_velocity = _current_velocity.linear.x;\n\n _current_velocity.angular.z = msg->twist.angular.z;\n\n\n \/\/_current_velocity = msg->twist;\n}\n\nvoid getTransformFromTF(const std::string parent_frame, const std::string child_frame, tf::StampedTransform &transform)\n{\n static tf::TransformListener listener;\n\n while (1)\n {\n try\n {\n listener.lookupTransform(parent_frame, child_frame, ros::Time(0), transform);\n break;\n }\n catch (tf::TransformException ex)\n {\n ROS_ERROR(\"%s\", ex.what());\n ros::Duration(1.0).sleep();\n }\n }\n}\n\nvoid initialposeCallback(const geometry_msgs::PoseWithCovarianceStampedConstPtr &input)\n{\n tf::StampedTransform transform;\n getTransformFromTF(MAP_FRAME, \"world\", transform);\n\n _initial_pose.position.x = input->pose.pose.position.x + transform.getOrigin().x();\n _initial_pose.position.y = input->pose.pose.position.y + transform.getOrigin().y();\n _initial_pose.position.z = input->pose.pose.position.z + transform.getOrigin().z();\n _initial_pose.orientation = input->pose.pose.orientation;\n\n _initial_set = true;\n _pose_set = false;\n}\n\nvoid callbackFromPoseStamped(const geometry_msgs::PoseStampedConstPtr &msg)\n{\n _initial_pose = msg->pose;\n _initial_set = true;\n}\n\nvoid waypointCallback(const waypoint_follower::laneConstPtr &msg)\n{\n \/\/ _path_og.setPath(msg);\n _current_waypoints.setPath(*msg);\n _waypoint_set = true;\n \/\/ROS_INFO_STREAM(\"waypoint subscribed\");\n}\n\nvoid callbackFromClosestWaypoint(const std_msgs::Int32ConstPtr &msg)\n{\n g_closest_waypoint = msg->data;\n g_is_closest_waypoint_subscribed = true;\n}\n\nvoid publishOdometry()\n{\n static ros::Time current_time = ros::Time::now();\n static ros::Time last_time = ros::Time::now();\n static geometry_msgs::Pose pose;\n static double th = 0;\n static tf::TransformBroadcaster odom_broadcaster;\n\n if (!_pose_set)\n {\n pose.position = _initial_pose.position;\n pose.orientation = _initial_pose.orientation;\n th = tf::getYaw(pose.orientation);\n ROS_INFO_STREAM(\"pose set : (\" << pose.position.x << \" \" << pose.position.y << \" \" << pose.position.z << \" \" << th\n << \")\");\n _pose_set = true;\n }\n\n \/*int closest_waypoint = getClosestWaypoint(_current_waypoints.getCurrentWaypoints(), pose);\n if (closest_waypoint == -1)\n {\n ROS_INFO(\"cannot publish odometry because closest waypoint is -1.\");\n return;\n }\n else\n {\n pose.position.z = _current_waypoints.getWaypointPosition(closest_waypoint).z;\n }\n*\/if(_waypoint_set && g_is_closest_waypoint_subscribed)\n pose.position.z = _current_waypoints.getWaypointPosition(g_closest_waypoint).z;\n\n double vx = _current_velocity.linear.x;\n double vth = _current_velocity.angular.z;\n current_time = ros::Time::now();\n\n \/\/ compute odometry in a typical way given the velocities of the robot\n double dt = (current_time - last_time).toSec();\n double delta_x = (vx * cos(th)) * dt;\n double delta_y = (vx * sin(th)) * dt;\n double delta_th = vth * dt;\n\n pose.position.x += delta_x;\n pose.position.y += delta_y;\n th += delta_th;\n pose.orientation = tf::createQuaternionMsgFromYaw(th);\n\n \/\/ std::cout << \"delta (x y th) : (\" << delta_x << \" \" << delta_y << \" \" << delta_th << \")\" << std::endl;\n \/\/ std::cout << \"current_velocity(linear.x angular.z) : (\" << _current_velocity.linear.x << \" \" <<\n \/\/ _current_velocity.angular.z << \")\"<< std::endl;\n \/\/ std::cout << \"current_pose : (\" << pose.position.x << \" \" << pose.position.y<< \" \" << pose.position.z << \" \" <<\n \/\/ th << \")\" << std::endl << std::endl;\n\n \/\/ first, we'll publish the transform over tf\n geometry_msgs::TransformStamped odom_trans;\n odom_trans.header.stamp = current_time;\n odom_trans.header.frame_id = MAP_FRAME;\n odom_trans.child_frame_id = SIMULATION_FRAME;\n\n odom_trans.transform.translation.x = pose.position.x;\n odom_trans.transform.translation.y = pose.position.y;\n odom_trans.transform.translation.z = pose.position.z;\n odom_trans.transform.rotation = pose.orientation;\n\n \/\/ send the transform\n odom_broadcaster.sendTransform(odom_trans);\n\n \/\/ next, we'll publish the odometry message over ROS\n std_msgs::Header h;\n h.stamp = current_time;\n h.frame_id = MAP_FRAME;\n\n geometry_msgs::PoseStamped ps;\n ps.header = h;\n ps.pose = pose;\n\n geometry_msgs::TwistStamped ts;\n ts.header = h;\n ts.twist.linear.x = vx;\n ts.twist.angular.z = vth;\n\n \/\/ publish the message\n g_odometry_publisher.publish(ps);\n g_velocity_publisher.publish(ts);\n\n last_time = current_time;\n}\n}\nint main(int argc, char **argv)\n{\n ros::init(argc, argv, \"wf_simulator\");\n\n ros::NodeHandle nh;\n ros::NodeHandle private_nh(\"~\");\n\n std::string initialize_source;\n private_nh.getParam(\"initialize_source\", initialize_source);\n ROS_INFO_STREAM(\"initialize_source : \" << initialize_source);\n\n double accel_rate;\n private_nh.param(\"accel_rate\",accel_rate,double(1.0));\n ROS_INFO_STREAM(\"accel_rate : \" << accel_rate);\n \/\/ publish topic\n g_odometry_publisher = nh.advertise<geometry_msgs::PoseStamped>(\"sim_pose\", 10);\n g_velocity_publisher = nh.advertise<geometry_msgs::TwistStamped>(\"sim_velocity\", 10);\n\n \/\/ subscribe topic\n ros::Subscriber cmd_subscriber = nh.subscribe<geometry_msgs::TwistStamped>(\"twist_cmd\", 10, boost::bind(CmdCallBack, _1, accel_rate));\n ros::Subscriber waypoint_subcscriber = nh.subscribe(\"base_waypoints\", 10, waypointCallback);\n ros::Subscriber closest_sub = nh.subscribe(\"closest_waypoint\", 10, callbackFromClosestWaypoint);\n ros::Subscriber initialpose_subscriber;\n\n if (initialize_source == \"Rviz\")\n {\n initialpose_subscriber = nh.subscribe(\"initialpose\", 10, initialposeCallback);\n }\n else if (initialize_source == \"ndt_localizer\")\n {\n initialpose_subscriber = nh.subscribe(\"ndt_pose\", 10, callbackFromPoseStamped);\n }\n else if (initialize_source == \"GNSS\")\n {\n initialpose_subscriber = nh.subscribe(\"gnss_pose\", 10, callbackFromPoseStamped);\n }\n else\n {\n ROS_INFO(\"Set pose initializer!!\");\n }\n\n ros::Rate loop_rate(LOOP_RATE);\n while (ros::ok())\n {\n ros::spinOnce(); \/\/ check subscribe topic\n\n \/*if (!_waypoint_set)\n {\n loop_rate.sleep();\n continue;\n }*\/\n\n if (!_initial_set)\n {\n loop_rate.sleep();\n continue;\n }\n\n publishOdometry();\n\n loop_rate.sleep();\n }\n\n return 0;\n}\n<|endoftext|>"} {"text":"<commit_before>#include \"Turret.h\"\n#include \"vision\/vision_processing.h\"\n#include \"ports.h\"\n\nconst int Zero_Max = 4;\nconst int Zero_Min = -1;\nconst int Left = 0;\nconst int Right = 1;\nconst float Turn_Speed = 0.1;\n\nvoid Turret::Align(int Target) {\n\twhile(Direction(Target)==Left)\n\t{\n\t\tJaguar turret_XY_control_jag.Set(-1*Turn_Speed);\n\t}\n\twhile(Direction(Target)==Right)\n\t{\n\t\tJaguar turret_XY_control_jag.Set(Turn_Speed);\n\t}\n}\n\nint Difference(int target) {\n\tint Picture_Center = ; \/\/Picture Width\/2\n\tint Target_Center_Mass_X = ;\/\/Add code Here\n\treturn (Picture_Center-Target_Center_Mass_X);\n}\nint Direction(int Target) {\n\tint Diff=Difference(Target);\n\tif((Diff<10)&&(Diff>-10))\n\t{\n\t\treturn 2;\n\t}\n\telse if (Diff>10)\n\t{\n\t\treturn Left;\n\t}\n\telse\n\t{\n\t\treturn Right;\n\t}\n}\n<commit_msg>Updated Turret.cpp to use new jag definitions<commit_after>#include \"Turret.h\"\n#include \"vision\/vision_processing.h\"\n#include \"ports.h\"\n\nconst int Zero_Max = 4;\nconst int Zero_Min = -1;\nconst int Left = 0;\nconst int Right = 1;\nconst float Turn_Speed = 0.1;\n\nvoid Turret::Align(int Target) {\n while(Direction(Target)==Left) {\n Jaguar turret_rotation_jag.Set(-1*Turn_Speed);\n }\n while(Direction(Target)==Right) {\n Jaguar turret_rotation_jag.Set(Turn_Speed);\n }\n}\n\nint Difference(int target) {\n int Picture_Center = ; \/\/Picture Width\/2\n int Target_Center_Mass_X = ;\/\/Add code Here\n return (Picture_Center-Target_Center_Mass_X);\n}\n\nint Direction(int Target) {\n int Diff=Difference(Target);\n if((Diff<10)&&(Diff>-10)) {\n return 2;\n }\n else if (Diff>10) {\n return Left;\n }\n else {\n return Right;\n }\n}\n\n<|endoftext|>"} {"text":"<commit_before>#include <signal.h>\n#include <stdio.h>\n#include <string.h>\n#include <stdlib.h>\n#include <memory>\n#include <pthread.h>\n#include <iostream>\n#include <X11\/Xlib.h>\n#include <X11\/Xutil.h>\n#include \"PlotWindow.h\"\n#include \"..\/Utility\/System.h\"\n#include \"cli.h\"\n#include \"gui.h\"\n\nvolatile bool quit = false;\nstatic void signalHandler(int){ quit = true; }\n\nint argc;\nchar **argv;\nconst char *arg0; \/\/ program name without path\nunsigned long terminalID = 0;\n\nint main(int argc, char *argv[])\n{\n\t::argc = argc;\n\t::argv = argv;\n\targ0 = argv[0];\n\tfor (const char *s = arg0; *s; ++s) if (*s == '\/') arg0 = s+1;\n\t\n\tconst char *t = getenv(\"WINDOWID\");\n\tif (t){ auto tt = atoll(t); if (tt > 0) terminalID = (unsigned long)tt; }\n\n\tstruct sigaction sa;\n\tmemset(&sa, 0, sizeof(struct sigaction));\n\tsa.sa_handler = signalHandler;\n\tsigaction(SIGINT, &sa, 0);\n\tsigaction(SIGPIPE, &sa, 0);\n\tsigaction(SIGQUIT, &sa, 0);\n\tsigaction(SIGTERM, &sa, 0);\n\n\tpthread_t guiID = 0, cliID = 0;\n\tif (0 != pthread_create(&cliID, NULL, cli, NULL))\n\t{\n\t\tfprintf(stderr, \"%s: can't create CLI thread\\n\", arg0);\n\t\texit(1);\n\t}\n\tif (0 != pthread_create(&guiID, NULL, gui, NULL))\n\t{\n\t\tfprintf(stderr, \"%s: can't create GUI thread\\n\", arg0);\n\t\tpthread_cancel(cliID);\n\t\texit(1);\n\t}\n\t\n\tpthread_join(guiID, NULL); quit = true;\n\tstruct timespec tv; tv.tv_nsec = 1000000000\/2; tv.tv_sec = 0;\n\tif (pthread_timedjoin_np(cliID, NULL, &tv)) pthread_cancel(cliID);\n\tprintf(\"\\n\");\n\n\treturn 0;\n}\n\n<commit_msg>Handle WINDOWID not being set<commit_after>#include <signal.h>\n#include <stdio.h>\n#include <string.h>\n#include <stdlib.h>\n#include <memory>\n#include <pthread.h>\n#include <iostream>\n#include <X11\/Xlib.h>\n#include <X11\/Xutil.h>\n#include \"PlotWindow.h\"\n#include \"..\/Utility\/System.h\"\n#include \"cli.h\"\n#include \"gui.h\"\n\nvolatile bool quit = false;\nstatic void signalHandler(int){ quit = true; }\n\nint argc;\nchar **argv;\nconst char *arg0; \/\/ program name without path\nunsigned long terminalID = 0;\n\nstatic long findTerminalID()\n{\n\tconst char *t = getenv(\"WINDOWID\");\n\tif (t)\n\t{\n\t\tauto tt = atoll(t);\n\t\tif (tt > 0) return (long)tt;\n\t}\n\t\n\t\/\/ Use the active window and hope that that is our terminal.\n\t\/\/ Matching by _NET_WM_PID did not work (because that is\n\t\/\/ the terminal's pid, not ours).\n\tDisplay *display = XOpenDisplay(0);\n\tif (!display) return 0;\n\n\tint dummy;\n\tWindow w = 0;\n\tXGetInputFocus(display, &w, &dummy);\n\tif (w == None || w == PointerRoot) w = 0;\n\n\tXCloseDisplay(display);\n\treturn w;\n};\n\nint main(int argc, char *argv[])\n{\n\t::argc = argc;\n\t::argv = argv;\n\targ0 = argv[0];\n\tfor (const char *s = arg0; *s; ++s) if (*s == '\/') arg0 = s+1;\n\t\n\tterminalID = findTerminalID();\n\n\tstruct sigaction sa;\n\tmemset(&sa, 0, sizeof(struct sigaction));\n\tsa.sa_handler = signalHandler;\n\tsigaction(SIGINT, &sa, 0);\n\tsigaction(SIGPIPE, &sa, 0);\n\tsigaction(SIGQUIT, &sa, 0);\n\tsigaction(SIGTERM, &sa, 0);\n\n\tpthread_t guiID = 0, cliID = 0;\n\tif (0 != pthread_create(&cliID, NULL, cli, NULL))\n\t{\n\t\tfprintf(stderr, \"%s: can't create CLI thread\\n\", arg0);\n\t\texit(1);\n\t}\n\tif (0 != pthread_create(&guiID, NULL, gui, NULL))\n\t{\n\t\tfprintf(stderr, \"%s: can't create GUI thread\\n\", arg0);\n\t\tpthread_cancel(cliID);\n\t\texit(1);\n\t}\n\t\n\tpthread_join(guiID, NULL); quit = true;\n\tstruct timespec tv; tv.tv_nsec = 1000000000\/2; tv.tv_sec = 0;\n\tif (pthread_timedjoin_np(cliID, NULL, &tv)) pthread_cancel(cliID);\n\tprintf(\"\\n\");\n\n\treturn 0;\n}\n\n<|endoftext|>"} {"text":"<commit_before>#include <windows.h>\n#include <SDL2\/SDL.h>\n#include <SDL2\/SDL_syswm.h>\n\n#include \"Common.h\"\n#include \"PrjHndl.h\"\n#include \"WinAPI.h\"\n\nnamespace WinAPI\n{\n\nHWND hWnd;\nHMENU hMenu;\nHMENU hSubMenu;\n\nvoid SaveHWND(SDL_Window* const window)\n{\n\tSDL_SysWMinfo info;\n\tSDL_VERSION(&info.version)\n\tSDL_GetWindowWMInfo(window,&info);\n\thWnd = info.info.win.window;\n}\n\nvoid CreateMenuBar(void)\n{\n\thMenu = CreateMenu();\n\thSubMenu = CreatePopupMenu();\n\tAppendMenu(hMenu, MF_STRING | MF_POPUP, (UINT)hSubMenu, \"&File\");\n\tAppendMenu(hSubMenu, MF_STRING, MENUBAR_FILE_OPENPROJECT, \"&Open project file\");\n\tAppendMenu(hSubMenu, MF_STRING | MF_GRAYED, MENUBAR_FILE_SAVE, \"&Save\");\n\tAppendMenu(hSubMenu, MF_STRING | MF_GRAYED, MENUBAR_FILE_CLOSE, \"&Close\");\n\tAppendMenu(hSubMenu, MF_STRING, MENUBAR_FILE_EXIT, \"&Exit\");\n\n\tSetMenu(hWnd, hMenu);\n\t\n\tSDL_EventState(SDL_SYSWMEVENT, SDL_ENABLE);\n}\n\nvoid HandleWindowsEvent(const SDL_Event* const event)\n{\n\tif (event->syswm.msg->msg.win.msg == WM_COMMAND)\n\t{\n\t\tswitch (LOWORD(event->syswm.msg->msg.win.wParam))\n\t\t{\n\t\t\tcase MENUBAR_FILE_OPENPROJECT:\n\t\t\t{\n\t\t\t\tchar filename[500] = \"\";\n\t\t\t\tif (WinAPI::OpenProjectFilePrompt(filename) == true)\n\t\t\t\t{\n\t\t\t\t\tif (CurProject != NULL)\n\t\t\t\t\t\tdelete CurProject;\n\t\t\t\t\tCurProject = new Project(filename, MainScreen);\n\n\t\t\t\t\tEnableMenuItem(hSubMenu, MENUBAR_FILE_SAVE, MF_ENABLED);\n\t\t\t\t\tEnableMenuItem(hSubMenu, MENUBAR_FILE_CLOSE, MF_ENABLED);\n\n\t\t\t\t\t\/\/Process initial display\n\t\t\t\t\tMainScreen->Fill(0, 0, 0);\n\t\t\t\t\tCurProject->Redraw();\n\t\t\t\t}\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\tcase MENUBAR_FILE_SAVE:\n\t\t\t{\n\t\t\t\tCurProject->Save();\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\tcase MENUBAR_FILE_CLOSE:\n\t\t\t{\n\t\t\t\tdelete CurProject;\n\t\t\t\tCurProject = NULL;\t\/\/ Deleting an object does not NULL this pointer, so we have to do it ourselves\n\t\t\t\tEnableMenuItem(hSubMenu, MENUBAR_FILE_SAVE, MF_GRAYED);\n\t\t\t\tEnableMenuItem(hSubMenu, MENUBAR_FILE_CLOSE, MF_GRAYED);\n\t\t\t\tMainScreen->Fill(0, 0, 0);\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\tcase MENUBAR_FILE_EXIT:\n\t\t\t{\n\t\t\t\texit(1);\n\t\t\t}\n\t\t}\n\t}\n}\n\nbool OpenProjectFilePrompt(char* const filepath)\n{\n\tOPENFILENAME ofn;\n memset(&ofn, 0, sizeof(ofn));\n ofn.lStructSize = sizeof(ofn);\n ofn.hwndOwner = hWnd;\n ofn.hInstance = NULL;\n ofn.lpstrFilter = TEXT(\"PlaneEd project file (*.txt)\\0*.txt\\0\\0\");\n ofn.nFilterIndex = 1;\n ofn.lpstrFile = filepath;\n ofn.nMaxFile = 500;\n ofn.Flags = OFN_FILEMUSTEXIST;\n bool bRes = GetOpenFileName(&ofn);\n\treturn bRes;\n}\n\n}\n<commit_msg>Neatening up menubar<commit_after>#include <windows.h>\n#include <SDL2\/SDL.h>\n#include <SDL2\/SDL_syswm.h>\n\n#include \"Common.h\"\n#include \"PrjHndl.h\"\n#include \"WinAPI.h\"\n\nnamespace WinAPI\n{\n\nHWND hWnd;\nHMENU hMenu;\nHMENU hSubMenu;\n\nvoid SaveHWND(SDL_Window* const window)\n{\n\tSDL_SysWMinfo info;\n\tSDL_VERSION(&info.version)\n\tSDL_GetWindowWMInfo(window,&info);\n\thWnd = info.info.win.window;\n}\n\nvoid CreateMenuBar(void)\n{\n\thMenu = CreateMenu();\n\thSubMenu = CreatePopupMenu();\n\tAppendMenu(hMenu, MF_STRING | MF_POPUP, (UINT)hSubMenu, \"&File\");\n\tAppendMenu(hSubMenu, MF_STRING, MENUBAR_FILE_OPENPROJECT, \"&Open\");\n\tAppendMenu(hSubMenu, MF_STRING | MF_GRAYED, MENUBAR_FILE_SAVE, \"&Save\");\n\tAppendMenu(hSubMenu, MF_STRING | MF_GRAYED, MENUBAR_FILE_CLOSE, \"&Close\");\n\tAppendMenu(hSubMenu, MF_SEPARATOR, 0, NULL);\n\tAppendMenu(hSubMenu, MF_STRING, MENUBAR_FILE_EXIT, \"&Exit\");\n\n\tSetMenu(hWnd, hMenu);\n\n\tSDL_EventState(SDL_SYSWMEVENT, SDL_ENABLE);\n}\n\nvoid HandleWindowsEvent(const SDL_Event* const event)\n{\n\tif (event->syswm.msg->msg.win.msg == WM_COMMAND)\n\t{\n\t\tswitch (LOWORD(event->syswm.msg->msg.win.wParam))\n\t\t{\n\t\t\tcase MENUBAR_FILE_OPENPROJECT:\n\t\t\t{\n\t\t\t\tchar filename[500] = \"\";\n\t\t\t\tif (WinAPI::OpenProjectFilePrompt(filename) == true)\n\t\t\t\t{\n\t\t\t\t\tif (CurProject != NULL)\n\t\t\t\t\t\tdelete CurProject;\n\t\t\t\t\tCurProject = new Project(filename, MainScreen);\n\n\t\t\t\t\tEnableMenuItem(hSubMenu, MENUBAR_FILE_SAVE, MF_ENABLED);\n\t\t\t\t\tEnableMenuItem(hSubMenu, MENUBAR_FILE_CLOSE, MF_ENABLED);\n\n\t\t\t\t\t\/\/Process initial display\n\t\t\t\t\tMainScreen->Fill(0, 0, 0);\n\t\t\t\t\tCurProject->Redraw();\n\t\t\t\t}\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\tcase MENUBAR_FILE_SAVE:\n\t\t\t{\n\t\t\t\tCurProject->Save();\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\tcase MENUBAR_FILE_CLOSE:\n\t\t\t{\n\t\t\t\tdelete CurProject;\n\t\t\t\tCurProject = NULL;\t\/\/ Deleting an object does not NULL this pointer, so we have to do it ourselves\n\t\t\t\tEnableMenuItem(hSubMenu, MENUBAR_FILE_SAVE, MF_GRAYED);\n\t\t\t\tEnableMenuItem(hSubMenu, MENUBAR_FILE_CLOSE, MF_GRAYED);\n\t\t\t\tMainScreen->Fill(0, 0, 0);\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\tcase MENUBAR_FILE_EXIT:\n\t\t\t{\n\t\t\t\texit(1);\n\t\t\t}\n\t\t}\n\t}\n}\n\nbool OpenProjectFilePrompt(char* const filepath)\n{\n\tOPENFILENAME ofn;\n memset(&ofn, 0, sizeof(ofn));\n ofn.lStructSize = sizeof(ofn);\n ofn.hwndOwner = hWnd;\n ofn.hInstance = NULL;\n ofn.lpstrFilter = TEXT(\"PlaneEd project file (*.txt)\\0*.txt\\0\\0\");\n ofn.nFilterIndex = 1;\n ofn.lpstrFile = filepath;\n ofn.nMaxFile = 500;\n ofn.Flags = OFN_FILEMUSTEXIST;\n bool bRes = GetOpenFileName(&ofn);\n\treturn bRes;\n}\n\n}\n<|endoftext|>"} {"text":"<commit_before>#include <boost\/gil\/gil_all.hpp>\n#include <boost\/gil\/extension\/io\/png_io.hpp>\n\n#include <util\/Logger.h>\n#include <util\/helpers.hpp>\n#include <gui\/OpenGl.h>\n#include <gui\/ContextSettings.h>\n#include <gui\/Keys.h>\n#include \"Window.h\"\n\nusing std::cout;\nusing std::endl;\nusing namespace boost::gil;\n\nusing namespace logger;\n\nnamespace gui {\n\nLogChannel winlog(\"winlog\", \"[Window] \");\n\nWindow::Window(\n\t\tstring caption,\n\t\tconst WindowMode& mode) :\n\tWindowType(caption, mode),\n\t_region(0, 0, mode.size.x, mode.size.y),\n\t_resolution(mode.size.x, mode.size.y),\n\t_saveFrameRequest(false),\n\t_frameNumber(0),\n\t_frameBuffer(0),\n\t_clear_r(0.5),\n\t_clear_g(0.5),\n\t_clear_b(0.5) {\n\n\tregisterInput(_painter, \"painter\");\n\n\t\/\/ register backward signals\n\t_painter.registerBackwardSlot(_resize);\n\t_painter.registerBackwardSlot(_keyDown);\n\t_painter.registerBackwardSlot(_keyUp);\n\t_painter.registerBackwardSlot(_mouseMove);\n\t_painter.registerBackwardSlot(_mouseDown);\n\t_painter.registerBackwardSlot(_mouseUp);\n\n\t\/\/ register backward callbacks\n\t_painter.registerBackwardCallback(&Window::onInputAdded, this);\n\t_painter.registerBackwardCallback(&Window::onModified, this);\n\t_painter.registerBackwardCallback(&Window::onSizeChanged, this);\n\n\t\/\/ initiate first redraw\n\tsetDirty();\n}\n\nWindow::~Window() {\n\n\tLOG_DEBUG(winlog) << \"[\" << getCaption() << \"] destructing...\" << endl;\n\n\tdeleteFrameBuffer();\n\n\tLOG_DEBUG(winlog) << \"[\" << getCaption() << \"] destructed\" << endl;\n}\n\nvoid\nWindow::createFrameBuffer() {\n\n\tdeleteFrameBuffer();\n\n\t_frameBuffer = new unsigned char[(int)_resolution.x*(int)_resolution.y*3];\n}\n\nvoid\nWindow::deleteFrameBuffer() {\n\n\tif (_frameBuffer) {\n\n\t\tdelete[] _frameBuffer;\n\t\t_frameBuffer = 0;\n\t}\n}\n\nvoid\nWindow::configureViewport() {\n\n\t\/\/ we want to draw everywhere\n\tglViewport(0, 0, _resolution.x, _resolution.y);\n\n\tglMatrixMode(GL_PROJECTION);\n\tglLoadIdentity();\n\n\t\/\/ OpenGl units = pixels\n\tglOrtho(0, _resolution.x, _resolution.y, 0, -1000, 1000); \/\/ x left, x right, y bottom, y top, z min, z max\n\n\tglMatrixMode(GL_MODELVIEW);\n\n\tLOG_ALL(winlog) << \"[\" << getCaption() << \"] set drawing area to \"\n\t << \"(0, 0, \" << _resolution.x << \", \" << _resolution.y << \")\"\n\t << std::endl;\n\n\tGL_ASSERT;\n}\n\nconst point<double>&\nWindow::getResolution() {\n\n\treturn _resolution;\n}\n\nvoid\nWindow::processResizeEvent(int width, int height) {\n\n\t_region.maxX = width;\n\t_region.maxY = height;\n\t_resolution.x = width;\n\t_resolution.y = height;\n\n\t{\n\t\t\/\/ ensure that our context is active\n\t\tOpenGl::Guard guard(this);\n\n\t\tconfigureViewport();\n\t\tcreateFrameBuffer();\n\t}\n}\n\nvoid\nWindow::processKeyUpEvent(const keys::Key& key, const Modifiers& modifiers) {\n\n\tKeyUp signal(key, modifiers);\n\t_keyUp(signal);\n}\n\nvoid\nWindow::processKeyDownEvent(const keys::Key& key, const Modifiers& modifiers) {\n\n\tKeyDown signal(key, modifiers);\n\t_keyDown(signal);\n}\n\nbool\nWindow::processButtonUpEvent(\n\t\tconst buttons::Button& button,\n\t\tconst util::point<double>& position,\n\t\tconst Modifiers& modifiers) {\n\n\tMouseUp signal(button, position, modifiers);\n\t_mouseUp(signal);\n}\n\nbool\nWindow::processButtonDownEvent(\n\t\tconst buttons::Button& button,\n\t\tconst util::point<double>& position,\n\t\tconst Modifiers& modifiers) {\n\n\tLOG_ALL(winlog) << \"[Window (\" << getCaption() << \")] \"\n\t << \"a mouse button was pressed\" << std::endl;\n\n\tMouseDown signal(button, position, modifiers);\n\t_mouseDown(signal);\n}\n\nbool\nWindow::processMouseMoveEvent(\n\t\tconst util::point<double>& position,\n\t\tconst Modifiers& modifiers) {\n\n\tMouseMove signal(position, modifiers);\n\t_mouseMove(signal);\n}\n\nGlContext*\nWindow::createGlContext() {\n\n\tLOG_ALL(winlog) << \"[\" << getCaption() << \"] creating a new GlContext\" << std::endl;\n\n\tGlContext* globalContext = OpenGl::getGlobalContext();\n\tglobalContext->activate();\n\n\tContextSettings settings;\n\n\t\/\/ create the context\n\tGlContext* glContext = new GlContext(this, settings, globalContext);\n\n\t\/\/ activate it\n\tglContext->activate();\n\n\tconfigureViewport();\n\n\t\/\/ return it\n\treturn glContext;\n}\n\nvoid\nWindow::redraw() {\n\n\t\/\/ They say OpenGl is thread safe. They are wrong.\n\tboost::mutex::scoped_lock lock(OpenGl::getMutex());\n\n\t\/\/ prepare painters\n\t_resize(_region);\n\n\t\/\/ ensure that our context is active\n\tOpenGl::Guard guard(this);\n\n\tclear();\n\n\tLOG_ALL(winlog) << \"[\" << getCaption() << \"] redrawing my content\" << endl;\n\n\tif (_painter) {\n\n\t\t\/\/ make sure the painter is up-to-date\n\t\tupdateInputs();\n\n\t\t\/\/ draw the updated painter\n\t\t_painter->draw(_region, point<double>(1.0, 1.0));\n\n\t} else {\n\n\t\tLOG_ALL(winlog) << \"[\" << getCaption() << \"] no content so far...\" << endl;\n\t}\n\n\tGL_ASSERT;\n\n\tflush();\n\n\tGL_ASSERT;\n}\n\nvoid\nWindow::clear() {\n\n\tglClearColor(_clear_r, _clear_g, _clear_b, 0.0);\n\n\tglClear(GL_COLOR_BUFFER_BIT | GL_DEPTH_BUFFER_BIT);\n\tGL_ASSERT;\n}\n\nvoid\nWindow::flush() {\n\n\tOpenGl::flush();\n}\n\nvoid\nWindow::requestFrameSave() {\n\n\t_saveFrameRequest = true;\n}\n\nvoid\nWindow::saveFrame() {\n\n\tif (closed())\n\t\treturn;\n\n\t\/\/ ensure that our context is active\n\tOpenGl::Guard guard(this);\n\n\tglReadPixels(\n\t\t\t0, 0,\n\t\t\t_resolution.x, _resolution.y,\n\t\t\tGL_RGB, GL_UNSIGNED_BYTE,\n\t\t\t_frameBuffer);\n\tGL_ASSERT;\n\n\trgb8c_view_t frameView =\n\t\t\tinterleaved_view(\n\t\t\t\t\t_resolution.x, _resolution.y,\n\t\t\t\t\t(const rgb8_pixel_t*)_frameBuffer,\n\t\t\t\t\t_resolution.x*3);\n\n\tpng_write_view(\n\t\t\t\".\/shots\/\" + getCaption() + to_string_with_leading_zeros(_frameNumber, 8) + \".png\",\n\t\t\tflipped_up_down_view(frameView));\n\n\t_frameNumber++;\n}\n\nvoid\nWindow::onInputAdded(const pipeline::InputAdded<gui::Painter>& signal) {\n\n\tsetDirty();\n}\n\nvoid\nWindow::onModified(const pipeline::Modified& signal) {\n\n\tsetDirty();\n}\n\nvoid\nWindow::onSizeChanged(const SizeChanged& signal) {\n\n\t\/\/ TODO:\n\t\/\/ Here, we could resize the window to fit the view. However, this should be\n\t\/\/ an optional feature.\n\n\tsetDirty();\n}\n\nvoid\nWindow::processCloseEvent(){\n\n\tLOG_DEBUG(winlog) << \"[\" << getCaption() << \"] invalidating my GlContext\" << endl;\n\n\t\/\/ ensure that our context is destructed\n\tOpenGl::Guard guard(0);\n\n\tLOG_DEBUG(winlog) << \"[\" << getCaption() << \"] closing window now\" << endl;\n\n\tclose();\n}\n\n} \/\/ namespace gui\n<commit_msg>made Window send Resize only when really resized (not for every redraw)<commit_after>#include <boost\/gil\/gil_all.hpp>\n#include <boost\/gil\/extension\/io\/png_io.hpp>\n\n#include <util\/Logger.h>\n#include <util\/helpers.hpp>\n#include <gui\/OpenGl.h>\n#include <gui\/ContextSettings.h>\n#include <gui\/Keys.h>\n#include \"Window.h\"\n\nusing std::cout;\nusing std::endl;\nusing namespace boost::gil;\n\nusing namespace logger;\n\nnamespace gui {\n\nLogChannel winlog(\"winlog\", \"[Window] \");\n\nWindow::Window(\n\t\tstring caption,\n\t\tconst WindowMode& mode) :\n\tWindowType(caption, mode),\n\t_region(0, 0, mode.size.x, mode.size.y),\n\t_resolution(mode.size.x, mode.size.y),\n\t_saveFrameRequest(false),\n\t_frameNumber(0),\n\t_frameBuffer(0),\n\t_clear_r(0.5),\n\t_clear_g(0.5),\n\t_clear_b(0.5) {\n\n\tregisterInput(_painter, \"painter\");\n\n\t\/\/ register backward signals\n\t_painter.registerBackwardSlot(_resize);\n\t_painter.registerBackwardSlot(_keyDown);\n\t_painter.registerBackwardSlot(_keyUp);\n\t_painter.registerBackwardSlot(_mouseMove);\n\t_painter.registerBackwardSlot(_mouseDown);\n\t_painter.registerBackwardSlot(_mouseUp);\n\n\t\/\/ register backward callbacks\n\t_painter.registerBackwardCallback(&Window::onInputAdded, this);\n\t_painter.registerBackwardCallback(&Window::onModified, this);\n\t_painter.registerBackwardCallback(&Window::onSizeChanged, this);\n\n\t\/\/ initiate first redraw\n\tsetDirty();\n}\n\nWindow::~Window() {\n\n\tLOG_DEBUG(winlog) << \"[\" << getCaption() << \"] destructing...\" << endl;\n\n\tdeleteFrameBuffer();\n\n\tLOG_DEBUG(winlog) << \"[\" << getCaption() << \"] destructed\" << endl;\n}\n\nvoid\nWindow::createFrameBuffer() {\n\n\tdeleteFrameBuffer();\n\n\t_frameBuffer = new unsigned char[(int)_resolution.x*(int)_resolution.y*3];\n}\n\nvoid\nWindow::deleteFrameBuffer() {\n\n\tif (_frameBuffer) {\n\n\t\tdelete[] _frameBuffer;\n\t\t_frameBuffer = 0;\n\t}\n}\n\nvoid\nWindow::configureViewport() {\n\n\t\/\/ we want to draw everywhere\n\tglViewport(0, 0, _resolution.x, _resolution.y);\n\n\tglMatrixMode(GL_PROJECTION);\n\tglLoadIdentity();\n\n\t\/\/ OpenGl units = pixels\n\tglOrtho(0, _resolution.x, _resolution.y, 0, -1000, 1000); \/\/ x left, x right, y bottom, y top, z min, z max\n\n\tglMatrixMode(GL_MODELVIEW);\n\n\tLOG_ALL(winlog) << \"[\" << getCaption() << \"] set drawing area to \"\n\t << \"(0, 0, \" << _resolution.x << \", \" << _resolution.y << \")\"\n\t << std::endl;\n\n\tGL_ASSERT;\n}\n\nconst point<double>&\nWindow::getResolution() {\n\n\treturn _resolution;\n}\n\nvoid\nWindow::processResizeEvent(int width, int height) {\n\n\t_region.maxX = width;\n\t_region.maxY = height;\n\t_resolution.x = width;\n\t_resolution.y = height;\n\n\t{\n\t\t\/\/ ensure that our context is active\n\t\tOpenGl::Guard guard(this);\n\n\t\tconfigureViewport();\n\t\tcreateFrameBuffer();\n\t}\n\n\t\/\/ prepare painters\n\t_resize(_region);\n}\n\nvoid\nWindow::processKeyUpEvent(const keys::Key& key, const Modifiers& modifiers) {\n\n\tKeyUp signal(key, modifiers);\n\t_keyUp(signal);\n}\n\nvoid\nWindow::processKeyDownEvent(const keys::Key& key, const Modifiers& modifiers) {\n\n\tKeyDown signal(key, modifiers);\n\t_keyDown(signal);\n}\n\nbool\nWindow::processButtonUpEvent(\n\t\tconst buttons::Button& button,\n\t\tconst util::point<double>& position,\n\t\tconst Modifiers& modifiers) {\n\n\tMouseUp signal(button, position, modifiers);\n\t_mouseUp(signal);\n}\n\nbool\nWindow::processButtonDownEvent(\n\t\tconst buttons::Button& button,\n\t\tconst util::point<double>& position,\n\t\tconst Modifiers& modifiers) {\n\n\tLOG_ALL(winlog) << \"[Window (\" << getCaption() << \")] \"\n\t << \"a mouse button was pressed\" << std::endl;\n\n\tMouseDown signal(button, position, modifiers);\n\t_mouseDown(signal);\n}\n\nbool\nWindow::processMouseMoveEvent(\n\t\tconst util::point<double>& position,\n\t\tconst Modifiers& modifiers) {\n\n\tMouseMove signal(position, modifiers);\n\t_mouseMove(signal);\n}\n\nGlContext*\nWindow::createGlContext() {\n\n\tLOG_ALL(winlog) << \"[\" << getCaption() << \"] creating a new GlContext\" << std::endl;\n\n\tGlContext* globalContext = OpenGl::getGlobalContext();\n\tglobalContext->activate();\n\n\tContextSettings settings;\n\n\t\/\/ create the context\n\tGlContext* glContext = new GlContext(this, settings, globalContext);\n\n\t\/\/ activate it\n\tglContext->activate();\n\n\tconfigureViewport();\n\n\t\/\/ return it\n\treturn glContext;\n}\n\nvoid\nWindow::redraw() {\n\n\t\/\/ They say OpenGl is thread safe. They are wrong.\n\tboost::mutex::scoped_lock lock(OpenGl::getMutex());\n\n\t\/\/ ensure that our context is active\n\tOpenGl::Guard guard(this);\n\n\tclear();\n\n\tLOG_ALL(winlog) << \"[\" << getCaption() << \"] redrawing my content\" << endl;\n\n\tif (_painter) {\n\n\t\t\/\/ make sure the painter is up-to-date\n\t\tupdateInputs();\n\n\t\t\/\/ draw the updated painter\n\t\t_painter->draw(_region, point<double>(1.0, 1.0));\n\n\t} else {\n\n\t\tLOG_ALL(winlog) << \"[\" << getCaption() << \"] no content so far...\" << endl;\n\t}\n\n\tGL_ASSERT;\n\n\tflush();\n\n\tGL_ASSERT;\n}\n\nvoid\nWindow::clear() {\n\n\tglClearColor(_clear_r, _clear_g, _clear_b, 0.0);\n\n\tglClear(GL_COLOR_BUFFER_BIT | GL_DEPTH_BUFFER_BIT);\n\tGL_ASSERT;\n}\n\nvoid\nWindow::flush() {\n\n\tOpenGl::flush();\n}\n\nvoid\nWindow::requestFrameSave() {\n\n\t_saveFrameRequest = true;\n}\n\nvoid\nWindow::saveFrame() {\n\n\tif (closed())\n\t\treturn;\n\n\t\/\/ ensure that our context is active\n\tOpenGl::Guard guard(this);\n\n\tglReadPixels(\n\t\t\t0, 0,\n\t\t\t_resolution.x, _resolution.y,\n\t\t\tGL_RGB, GL_UNSIGNED_BYTE,\n\t\t\t_frameBuffer);\n\tGL_ASSERT;\n\n\trgb8c_view_t frameView =\n\t\t\tinterleaved_view(\n\t\t\t\t\t_resolution.x, _resolution.y,\n\t\t\t\t\t(const rgb8_pixel_t*)_frameBuffer,\n\t\t\t\t\t_resolution.x*3);\n\n\tpng_write_view(\n\t\t\t\".\/shots\/\" + getCaption() + to_string_with_leading_zeros(_frameNumber, 8) + \".png\",\n\t\t\tflipped_up_down_view(frameView));\n\n\t_frameNumber++;\n}\n\nvoid\nWindow::onInputAdded(const pipeline::InputAdded<gui::Painter>& signal) {\n\n\tsetDirty();\n}\n\nvoid\nWindow::onModified(const pipeline::Modified& signal) {\n\n\tsetDirty();\n}\n\nvoid\nWindow::onSizeChanged(const SizeChanged& signal) {\n\n\t\/\/ TODO:\n\t\/\/ Here, we could resize the window to fit the view. However, this should be\n\t\/\/ an optional feature.\n\n\tsetDirty();\n}\n\nvoid\nWindow::processCloseEvent(){\n\n\tLOG_DEBUG(winlog) << \"[\" << getCaption() << \"] invalidating my GlContext\" << endl;\n\n\t\/\/ ensure that our context is destructed\n\tOpenGl::Guard guard(0);\n\n\tLOG_DEBUG(winlog) << \"[\" << getCaption() << \"] closing window now\" << endl;\n\n\tclose();\n}\n\n} \/\/ namespace gui\n<|endoftext|>"} {"text":"<commit_before>#include <isl\/set.h>\n#include <isl\/union_map.h>\n#include <isl\/union_set.h>\n#include <isl\/ast_build.h>\n#include <isl\/schedule.h>\n#include <isl\/schedule_node.h>\n\n#include <coli\/debug.h>\n#include <coli\/core.h>\n\n#include <String.h>\n#include <Halide.h>\n\n\nint main(int argc, char **argv)\n{\n\tisl_ctx *ctx = isl_ctx_alloc();\n\tcoli::program pgm(\"program0\");\n\tcoli::function fct(\"function0\", &pgm);\n\n\t\/\/ Declare the computations. Each computation has:\n\t\/\/ (1) a Halide expression,\n\t\/\/ (2) an isl set representing its iteration space, and\n\t\/\/ (3) is attached to a function.\n\tcoli::computation computation0(ctx, Halide::Expr((uint8_t) 3), \"{S0[i,j]: 0<=i<=1000 and 0<=j<=1000}\", &fct);\n\tcoli::computation computation1(ctx, Halide::Expr((uint8_t) 5), \"{S1[i,j]: 0<=i<=1023 and 0<=j<=1023}\", &fct);\n\tcoli::computation computation2(ctx, Halide::Expr((uint8_t) 7), \"{S2[i,j]: 0<=i<=1023 and 0<=j<=1023}\", &fct);\n\n\t\/\/ Create a memory buffer (2 dimensional).\n\tstd::vector<int> size1;\n\tsize1.push_back(10);\n\tsize1.push_back(10);\n\tcoli::buffer buf0(\"buf0\", 2, size1, Halide::Int(8), NULL, &fct);\n\n\t\/\/ Add the buffer as an argument to fct.\n\tfct.add_argument(buf0);\n\n\t\/\/ Map the computations to the buffers.\n\tcomputation0.SetAccess(\"{S0[i,j]->buf0[i, j]}\");\n\tcomputation1.SetAccess(\"{S1[i,j]->buf0[0, 0]}\");\n\tcomputation2.SetAccess(\"{S2[i,j]->buf0[i, j]}\");\n\n\t\/\/ Set the schedule of each computation.\n\tcomputation0.Tile(0,1,32,32);\n\tcomputation1.Schedule(\"{S1[i,j]->[2,i1,j1,i2,j3,j4]: i1=floor(i\/32) and j1=floor(j\/32) and i2=i and j3=floor(j\/4) and j4=j%4 and 0<=i<=1023 and 0<=j<=1023}\");\n\tcomputation2.Split(0, 32);\n\tcomputation2.Split(2, 32);\n\tcomputation2.Interchange(1, 2);\n\tpgm.tag_parallel_dimension(\"S0\", 1);\n\/\/\tpgm.tag_vector_dimension(\"S1\", 5);\n\n\tisl_union_map *schedule_map = pgm.get_schedule_map();\n\n\t\/\/ Create time space IR\n\tisl_union_set *time_space_representaion =\n\t\tcoli::create_time_space_representation(isl_union_set_copy(pgm.get_iteration_spaces()), isl_union_map_copy(schedule_map));\n\n\t\/\/ Generate code\n\tisl_ast_build *ast_build = isl_ast_build_alloc(ctx);\n\tisl_options_set_ast_build_atomic_upper_bound(ctx, 1);\n\tast_build = isl_ast_build_set_after_each_for(ast_build, &coli::for_halide_code_generator_after_for, NULL);\n\tast_build = isl_ast_build_set_at_each_domain(ast_build, &coli::stmt_halide_code_generator, NULL);\n\tisl_ast_node *program = isl_ast_build_node_from_schedule_map(ast_build, isl_union_map_copy(schedule_map));\n\tisl_ast_build_free(ast_build);\n\n\tif (DEBUG)\n\t\tcoli::isl_ast_node_dump_c_code(ctx, program);\n\n\tstd::vector<std::string> generated_stmts, iterators;\n\tHalide::Internal::Stmt halide_pgm = coli::generate_Halide_stmt_from_isl_node(pgm, program, 0, generated_stmts, iterators);\n\n\t\/\/ Dump IRs\n\tpgm.dump_ISIR();\n\tpgm.dump_schedule();\n\tIF_DEBUG(coli::str_dump(\"\\n\\nTime Space IR:\\n\")); IF_DEBUG(isl_union_set_dump(time_space_representaion)); IF_DEBUG(coli::str_dump(\"\\n\\n\"));\n\tcoli::halide_IR_dump(halide_pgm);\n\n\n\tHalide::Target target;\n\ttarget.os = Halide::Target::OSX;\n\ttarget.arch = Halide::Target::X86;\n\ttarget.bits = 64;\n\tstd::vector<Halide::Target::Feature> x86_features;\n\tx86_features.push_back(Halide::Target::AVX);\n\tx86_features.push_back(Halide::Target::SSE41);\n\ttarget.set_features(x86_features);\n\n\tHalide::Module::Module m(\"test1\", target);\n\tm.append(Halide::Internal::LoweredFunc(\"test1\", fct.get_args(), halide_pgm, Halide::Internal::LoweredFunc::External));\n\n\tHalide::compile_module_to_object(m, \"LLVM_generated_code.o\");\n\n\treturn 0;\n}\n<commit_msg>Use inline declaration of vector<commit_after>#include <isl\/set.h>\n#include <isl\/union_map.h>\n#include <isl\/union_set.h>\n#include <isl\/ast_build.h>\n#include <isl\/schedule.h>\n#include <isl\/schedule_node.h>\n\n#include <coli\/debug.h>\n#include <coli\/core.h>\n\n#include <String.h>\n#include <Halide.h>\n\n\nint main(int argc, char **argv)\n{\n\tisl_ctx *ctx = isl_ctx_alloc();\n\tcoli::program pgm(\"program0\");\n\tcoli::function fct(\"function0\", &pgm);\n\n\t\/\/ Declare the computations. Each computation has:\n\t\/\/ (1) a Halide expression,\n\t\/\/ (2) an isl set representing its iteration space, and\n\t\/\/ (3) is attached to a function.\n\tcoli::computation computation0(ctx, Halide::Expr((uint8_t) 3), \"{S0[i,j]: 0<=i<=1000 and 0<=j<=1000}\", &fct);\n\tcoli::computation computation1(ctx, Halide::Expr((uint8_t) 5), \"{S1[i,j]: 0<=i<=1023 and 0<=j<=1023}\", &fct);\n\tcoli::computation computation2(ctx, Halide::Expr((uint8_t) 7), \"{S2[i,j]: 0<=i<=1023 and 0<=j<=1023}\", &fct);\n\n\t\/\/ Create a memory buffer (2 dimensional).\n\tcoli::buffer buf0(\"buf0\", 2, {10,10}, Halide::Int(8), NULL, &fct);\n\n\t\/\/ Add the buffer as an argument to fct.\n\tfct.add_argument(buf0);\n\n\t\/\/ Map the computations to the buffers.\n\tcomputation0.SetAccess(\"{S0[i,j]->buf0[i, j]}\");\n\tcomputation1.SetAccess(\"{S1[i,j]->buf0[0, 0]}\");\n\tcomputation2.SetAccess(\"{S2[i,j]->buf0[i, j]}\");\n\n\t\/\/ Set the schedule of each computation.\n\tcomputation0.Tile(0,1,32,32);\n\tcomputation1.Schedule(\"{S1[i,j]->[2,i1,j1,i2,j3,j4]: i1=floor(i\/32) and j1=floor(j\/32) and i2=i and j3=floor(j\/4) and j4=j%4 and 0<=i<=1023 and 0<=j<=1023}\");\n\tcomputation2.Split(0, 32);\n\tcomputation2.Split(2, 32);\n\tcomputation2.Interchange(1, 2);\n\tpgm.tag_parallel_dimension(\"S0\", 1);\n\/\/\tpgm.tag_vector_dimension(\"S1\", 5);\n\n\tisl_union_map *schedule_map = pgm.get_schedule_map();\n\n\t\/\/ Create time space IR\n\tisl_union_set *time_space_representaion =\n\t\tcoli::create_time_space_representation(isl_union_set_copy(pgm.get_iteration_spaces()), isl_union_map_copy(schedule_map));\n\n\t\/\/ Generate code\n\tisl_ast_build *ast_build = isl_ast_build_alloc(ctx);\n\tisl_options_set_ast_build_atomic_upper_bound(ctx, 1);\n\tast_build = isl_ast_build_set_after_each_for(ast_build, &coli::for_halide_code_generator_after_for, NULL);\n\tast_build = isl_ast_build_set_at_each_domain(ast_build, &coli::stmt_halide_code_generator, NULL);\n\tisl_ast_node *program = isl_ast_build_node_from_schedule_map(ast_build, isl_union_map_copy(schedule_map));\n\tisl_ast_build_free(ast_build);\n\n\tif (DEBUG)\n\t\tcoli::isl_ast_node_dump_c_code(ctx, program);\n\n\tstd::vector<std::string> generated_stmts, iterators;\n\tHalide::Internal::Stmt halide_pgm = coli::generate_Halide_stmt_from_isl_node(pgm, program, 0, generated_stmts, iterators);\n\n\t\/\/ Dump IRs\n\tpgm.dump_ISIR();\n\tpgm.dump_schedule();\n\tIF_DEBUG(coli::str_dump(\"\\n\\nTime Space IR:\\n\")); IF_DEBUG(isl_union_set_dump(time_space_representaion)); IF_DEBUG(coli::str_dump(\"\\n\\n\"));\n\tcoli::halide_IR_dump(halide_pgm);\n\n\n\tHalide::Target target;\n\ttarget.os = Halide::Target::OSX;\n\ttarget.arch = Halide::Target::X86;\n\ttarget.bits = 64;\n\tstd::vector<Halide::Target::Feature> x86_features;\n\tx86_features.push_back(Halide::Target::AVX);\n\tx86_features.push_back(Halide::Target::SSE41);\n\ttarget.set_features(x86_features);\n\n\tHalide::Module::Module m(\"test1\", target);\n\tm.append(Halide::Internal::LoweredFunc(\"test1\", fct.get_args(), halide_pgm, Halide::Internal::LoweredFunc::External));\n\n\tHalide::compile_module_to_object(m, \"LLVM_generated_code.o\");\n\n\treturn 0;\n}\n<|endoftext|>"} {"text":"<commit_before>\/* IBM_PROLOG_BEGIN_TAG *\/\n\/* This is an automatically generated prolog. *\/\n\/* *\/\n\/* $Source: src\/import\/chips\/p9\/procedures\/hwp\/initfiles\/p9_psi_scom.C $ *\/\n\/* *\/\n\/* OpenPOWER HostBoot Project *\/\n\/* *\/\n\/* Contributors Listed Below - COPYRIGHT 2016,2019 *\/\n\/* [+] International Business Machines Corp. *\/\n\/* *\/\n\/* *\/\n\/* Licensed under the Apache License, Version 2.0 (the \"License\"); *\/\n\/* you may not use this file except in compliance with the License. *\/\n\/* You may obtain a copy of the License at *\/\n\/* *\/\n\/* http:\/\/www.apache.org\/licenses\/LICENSE-2.0 *\/\n\/* *\/\n\/* Unless required by applicable law or agreed to in writing, software *\/\n\/* distributed under the License is distributed on an \"AS IS\" BASIS, *\/\n\/* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or *\/\n\/* implied. See the License for the specific language governing *\/\n\/* permissions and limitations under the License. *\/\n\/* *\/\n\/* IBM_PROLOG_END_TAG *\/\n#include \"p9_psi_scom.H\"\n#include <stdint.h>\n#include <stddef.h>\n#include <fapi2.H>\n#include <attribute_ids.H>\n#include <target_types.H>\n#include <fapi2_attribute_service.H>\nusing namespace fapi2;\n\n#define LITERAL_BRIDGE_PSIHB_PSIHB_ERROR_MASK_REG_0b00000 0b00000\n#define LITERAL_BRIDGE_PSIHB_PSIHB_ERROR_MASK_REG_0x000 0x000\n#define LITERAL_BRIDGE_PSIHB_PSIHB_FIR_ACTION0_REG_0x0000000000000000 0x0000000000000000\n#define LITERAL_BRIDGE_PSIHB_PSIHB_FIR_ACTION1_REG_0xC629000000000000 0xC629000000000000\n#define LITERAL_BRIDGE_PSIHB_PSIHB_FIR_MASK_REG_0x3902FFF800000000 0x3902FFF800000000\n\nfapi2::ReturnCode p9_psi_scom(const fapi2::Target<fapi2::TARGET_TYPE_PROC_CHIP>& TGT0)\n{\n fapi2::ReturnCode l_rc = 0;\n\n do\n {\n fapi2::buffer<uint64_t> BRIDGE_PSIHB_PSIHB_ERROR_MASK_REG_scom0;\n l_rc = fapi2::getScom( TGT0, 0x501290full, BRIDGE_PSIHB_PSIHB_ERROR_MASK_REG_scom0 );\n\n if (l_rc)\n {\n FAPI_ERR(\"ERROR executing: getScom (0x501290f)\");\n break;\n }\n\n BRIDGE_PSIHB_PSIHB_ERROR_MASK_REG_scom0.insert<uint64_t> (LITERAL_BRIDGE_PSIHB_PSIHB_ERROR_MASK_REG_0x000, 0, 16, 48 );\n BRIDGE_PSIHB_PSIHB_ERROR_MASK_REG_scom0.insert<uint64_t> (LITERAL_BRIDGE_PSIHB_PSIHB_ERROR_MASK_REG_0x000, 16, 12, 36 );\n BRIDGE_PSIHB_PSIHB_ERROR_MASK_REG_scom0.insert<uint64_t> (LITERAL_BRIDGE_PSIHB_PSIHB_ERROR_MASK_REG_0x000, 0, 4, 32 );\n BRIDGE_PSIHB_PSIHB_ERROR_MASK_REG_scom0.insert<uint64_t> (LITERAL_BRIDGE_PSIHB_PSIHB_ERROR_MASK_REG_0x000, 32, 12, 20 );\n BRIDGE_PSIHB_PSIHB_ERROR_MASK_REG_scom0.insert<uint64_t> (LITERAL_BRIDGE_PSIHB_PSIHB_ERROR_MASK_REG_0x000, 0, 4, 16 );\n BRIDGE_PSIHB_PSIHB_ERROR_MASK_REG_scom0.insert<uint64_t> (LITERAL_BRIDGE_PSIHB_PSIHB_ERROR_MASK_REG_0x000, 48, 5, 11 );\n BRIDGE_PSIHB_PSIHB_ERROR_MASK_REG_scom0.insert<uint64_t> (LITERAL_BRIDGE_PSIHB_PSIHB_ERROR_MASK_REG_0b00000, 0, 16,\n 48 );\n BRIDGE_PSIHB_PSIHB_ERROR_MASK_REG_scom0.insert<uint64_t> (LITERAL_BRIDGE_PSIHB_PSIHB_ERROR_MASK_REG_0b00000, 16, 12,\n 36 );\n BRIDGE_PSIHB_PSIHB_ERROR_MASK_REG_scom0.insert<uint64_t> (LITERAL_BRIDGE_PSIHB_PSIHB_ERROR_MASK_REG_0b00000, 0, 4, 32 );\n BRIDGE_PSIHB_PSIHB_ERROR_MASK_REG_scom0.insert<uint64_t> (LITERAL_BRIDGE_PSIHB_PSIHB_ERROR_MASK_REG_0b00000, 32, 12,\n 20 );\n BRIDGE_PSIHB_PSIHB_ERROR_MASK_REG_scom0.insert<uint64_t> (LITERAL_BRIDGE_PSIHB_PSIHB_ERROR_MASK_REG_0b00000, 0, 4, 16 );\n BRIDGE_PSIHB_PSIHB_ERROR_MASK_REG_scom0.insert<uint64_t> (LITERAL_BRIDGE_PSIHB_PSIHB_ERROR_MASK_REG_0b00000, 48, 5,\n 11 );\n\n fapi2::buffer<uint64_t> BRIDGE_PSIHB_PSIHB_FIR_ACTION0_REG_scom0;\n l_rc = fapi2::getScom( TGT0, 0x5012906ull, BRIDGE_PSIHB_PSIHB_FIR_ACTION0_REG_scom0 );\n\n if (l_rc)\n {\n FAPI_ERR(\"ERROR executing: getScom (0x5012906)\");\n break;\n }\n\n BRIDGE_PSIHB_PSIHB_FIR_ACTION0_REG_scom0.insert<uint64_t>\n (LITERAL_BRIDGE_PSIHB_PSIHB_FIR_ACTION0_REG_0x0000000000000000, 0, 29, 35 );\n BRIDGE_PSIHB_PSIHB_FIR_ACTION0_REG_scom0.insert<uint64_t>\n (LITERAL_BRIDGE_PSIHB_PSIHB_FIR_ACTION0_REG_0x0000000000000000, 0, 21, 14 );\n\n fapi2::buffer<uint64_t> BRIDGE_PSIHB_PSIHB_FIR_ACTION1_REG_scom0;\n l_rc = fapi2::getScom( TGT0, 0x5012907ull, BRIDGE_PSIHB_PSIHB_FIR_ACTION1_REG_scom0 );\n\n if (l_rc)\n {\n FAPI_ERR(\"ERROR executing: getScom (0x5012907)\");\n break;\n }\n\n BRIDGE_PSIHB_PSIHB_FIR_ACTION1_REG_scom0.insert<uint64_t>\n (LITERAL_BRIDGE_PSIHB_PSIHB_FIR_ACTION1_REG_0xC629000000000000, 0, 29, 35 );\n BRIDGE_PSIHB_PSIHB_FIR_ACTION1_REG_scom0.insert<uint64_t>\n (LITERAL_BRIDGE_PSIHB_PSIHB_FIR_ACTION1_REG_0xC629000000000000, 0, 21, 14 );\n\n fapi2::buffer<uint64_t> BRIDGE_PSIHB_PSIHB_FIR_MASK_REG_scom0;\n l_rc = fapi2::getScom( TGT0, 0x5012903ull, BRIDGE_PSIHB_PSIHB_FIR_MASK_REG_scom0 );\n\n if (l_rc)\n {\n FAPI_ERR(\"ERROR executing: getScom (0x5012903)\");\n break;\n }\n\n BRIDGE_PSIHB_PSIHB_FIR_MASK_REG_scom0.insert<uint64_t> (LITERAL_BRIDGE_PSIHB_PSIHB_FIR_MASK_REG_0x3902FFF800000000, 0,\n 29, 35 );\n BRIDGE_PSIHB_PSIHB_FIR_MASK_REG_scom0.insert<uint64_t> (LITERAL_BRIDGE_PSIHB_PSIHB_FIR_MASK_REG_0x3902FFF800000000, 0,\n 17, 18 );\n\n\n l_rc = fapi2::putScom( TGT0, 0x5012903ull, BRIDGE_PSIHB_PSIHB_FIR_MASK_REG_scom0 );\n\n if (l_rc)\n {\n FAPI_ERR(\"ERROR executing: putScom (0x5012903)\");\n break;\n }\n\n l_rc = fapi2::putScom( TGT0, 0x5012906ull, BRIDGE_PSIHB_PSIHB_FIR_ACTION0_REG_scom0 );\n\n if (l_rc)\n {\n FAPI_ERR(\"ERROR executing: putScom (0x5012906)\");\n break;\n }\n\n l_rc = fapi2::putScom( TGT0, 0x5012907ull, BRIDGE_PSIHB_PSIHB_FIR_ACTION1_REG_scom0 );\n\n if (l_rc)\n {\n FAPI_ERR(\"ERROR executing: putScom (0x5012907)\");\n break;\n }\n\n l_rc = fapi2::putScom( TGT0, 0x501290full, BRIDGE_PSIHB_PSIHB_ERROR_MASK_REG_scom0 );\n\n if (l_rc)\n {\n FAPI_ERR(\"ERROR executing: putScom (0x501290f)\");\n break;\n }\n\n }\n while(0);\n\n return l_rc;\n}\n<commit_msg>updates for memory integration<commit_after>\/* IBM_PROLOG_BEGIN_TAG *\/\n\/* This is an automatically generated prolog. *\/\n\/* *\/\n\/* $Source: src\/import\/chips\/p9\/procedures\/hwp\/initfiles\/p9_psi_scom.C $ *\/\n\/* *\/\n\/* OpenPOWER HostBoot Project *\/\n\/* *\/\n\/* Contributors Listed Below - COPYRIGHT 2016,2019 *\/\n\/* [+] International Business Machines Corp. *\/\n\/* *\/\n\/* *\/\n\/* Licensed under the Apache License, Version 2.0 (the \"License\"); *\/\n\/* you may not use this file except in compliance with the License. *\/\n\/* You may obtain a copy of the License at *\/\n\/* *\/\n\/* http:\/\/www.apache.org\/licenses\/LICENSE-2.0 *\/\n\/* *\/\n\/* Unless required by applicable law or agreed to in writing, software *\/\n\/* distributed under the License is distributed on an \"AS IS\" BASIS, *\/\n\/* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or *\/\n\/* implied. See the License for the specific language governing *\/\n\/* permissions and limitations under the License. *\/\n\/* *\/\n\/* IBM_PROLOG_END_TAG *\/\n#include \"p9_psi_scom.H\"\n#include <stdint.h>\n#include <stddef.h>\n#include <fapi2.H>\n#include <attribute_ids.H>\n#include <target_types.H>\n#include <fapi2_attribute_service.H>\nusing namespace fapi2;\n\n#define LITERAL_BRIDGE_PSIHB_PSIHB_ERROR_MASK_REG_0b00000 0b00000\n#define LITERAL_BRIDGE_PSIHB_PSIHB_ERROR_MASK_REG_0x000 0x000\n#define LITERAL_BRIDGE_PSIHB_PSIHB_FIR_ACTION0_REG_0b00000000000000000000000000000 0b00000000000000000000000000000\n#define LITERAL_BRIDGE_PSIHB_PSIHB_FIR_ACTION1_REG_0b11000110001010010000000000000 0b11000110001010010000000000000\n#define LITERAL_BRIDGE_PSIHB_PSIHB_FIR_MASK_REG_0b00111001000000101111111111111 0b00111001000000101111111111111\n\nfapi2::ReturnCode p9_psi_scom(const fapi2::Target<fapi2::TARGET_TYPE_PROC_CHIP>& TGT0)\n{\n fapi2::ReturnCode l_rc = 0;\n\n do\n {\n fapi2::buffer<uint64_t> BRIDGE_PSIHB_PSIHB_ERROR_MASK_REG_scom0;\n l_rc = fapi2::getScom( TGT0, 0x501290full, BRIDGE_PSIHB_PSIHB_ERROR_MASK_REG_scom0 );\n\n if (l_rc)\n {\n FAPI_ERR(\"ERROR executing: getScom (0x501290f)\");\n break;\n }\n\n BRIDGE_PSIHB_PSIHB_ERROR_MASK_REG_scom0.insert<uint64_t> (LITERAL_BRIDGE_PSIHB_PSIHB_ERROR_MASK_REG_0x000, 16, 12, 27 );\n BRIDGE_PSIHB_PSIHB_ERROR_MASK_REG_scom0.insert<uint64_t> (LITERAL_BRIDGE_PSIHB_PSIHB_ERROR_MASK_REG_0x000, 32, 12, 43 );\n BRIDGE_PSIHB_PSIHB_ERROR_MASK_REG_scom0.insert<uint64_t> (LITERAL_BRIDGE_PSIHB_PSIHB_ERROR_MASK_REG_0x000, 48, 5, 59 );\n BRIDGE_PSIHB_PSIHB_ERROR_MASK_REG_scom0.insert<uint64_t> (LITERAL_BRIDGE_PSIHB_PSIHB_ERROR_MASK_REG_0b00000, 16, 12,\n 27 );\n BRIDGE_PSIHB_PSIHB_ERROR_MASK_REG_scom0.insert<uint64_t> (LITERAL_BRIDGE_PSIHB_PSIHB_ERROR_MASK_REG_0b00000, 32, 12,\n 43 );\n BRIDGE_PSIHB_PSIHB_ERROR_MASK_REG_scom0.insert<uint64_t> (LITERAL_BRIDGE_PSIHB_PSIHB_ERROR_MASK_REG_0b00000, 48, 5,\n 59 );\n\n fapi2::buffer<uint64_t> BRIDGE_PSIHB_PSIHB_FIR_ACTION0_REG_scom0;\n l_rc = fapi2::getScom( TGT0, 0x5012906ull, BRIDGE_PSIHB_PSIHB_FIR_ACTION0_REG_scom0 );\n\n if (l_rc)\n {\n FAPI_ERR(\"ERROR executing: getScom (0x5012906)\");\n break;\n }\n\n BRIDGE_PSIHB_PSIHB_FIR_ACTION0_REG_scom0.insert<uint64_t>\n (LITERAL_BRIDGE_PSIHB_PSIHB_FIR_ACTION0_REG_0b00000000000000000000000000000, 0, 29, 14 );\n\n fapi2::buffer<uint64_t> BRIDGE_PSIHB_PSIHB_FIR_ACTION1_REG_scom0;\n l_rc = fapi2::getScom( TGT0, 0x5012907ull, BRIDGE_PSIHB_PSIHB_FIR_ACTION1_REG_scom0 );\n\n if (l_rc)\n {\n FAPI_ERR(\"ERROR executing: getScom (0x5012907)\");\n break;\n }\n\n BRIDGE_PSIHB_PSIHB_FIR_ACTION1_REG_scom0.insert<uint64_t>\n (LITERAL_BRIDGE_PSIHB_PSIHB_FIR_ACTION1_REG_0b11000110001010010000000000000, 0, 29, 14 );\n\n fapi2::buffer<uint64_t> BRIDGE_PSIHB_PSIHB_FIR_MASK_REG_scom0;\n l_rc = fapi2::getScom( TGT0, 0x5012903ull, BRIDGE_PSIHB_PSIHB_FIR_MASK_REG_scom0 );\n\n if (l_rc)\n {\n FAPI_ERR(\"ERROR executing: getScom (0x5012903)\");\n break;\n }\n\n BRIDGE_PSIHB_PSIHB_FIR_MASK_REG_scom0.insert<uint64_t>\n (LITERAL_BRIDGE_PSIHB_PSIHB_FIR_MASK_REG_0b00111001000000101111111111111, 0, 29, 18 );\n\n\n l_rc = fapi2::putScom( TGT0, 0x5012903ull, BRIDGE_PSIHB_PSIHB_FIR_MASK_REG_scom0 );\n\n if (l_rc)\n {\n FAPI_ERR(\"ERROR executing: putScom (0x5012903)\");\n break;\n }\n\n l_rc = fapi2::putScom( TGT0, 0x5012906ull, BRIDGE_PSIHB_PSIHB_FIR_ACTION0_REG_scom0 );\n\n if (l_rc)\n {\n FAPI_ERR(\"ERROR executing: putScom (0x5012906)\");\n break;\n }\n\n l_rc = fapi2::putScom( TGT0, 0x5012907ull, BRIDGE_PSIHB_PSIHB_FIR_ACTION1_REG_scom0 );\n\n if (l_rc)\n {\n FAPI_ERR(\"ERROR executing: putScom (0x5012907)\");\n break;\n }\n\n l_rc = fapi2::putScom( TGT0, 0x501290full, BRIDGE_PSIHB_PSIHB_ERROR_MASK_REG_scom0 );\n\n if (l_rc)\n {\n FAPI_ERR(\"ERROR executing: putScom (0x501290f)\");\n break;\n }\n\n }\n while(0);\n\n return l_rc;\n}\n<|endoftext|>"} {"text":"<commit_before>\/* IBM_PROLOG_BEGIN_TAG *\/\n\/* This is an automatically generated prolog. *\/\n\/* *\/\n\/* $Source: chips\/p9\/utils\/imageProcs\/p9_scan_compression.H $ *\/\n\/* *\/\n\/* IBM CONFIDENTIAL *\/\n\/* *\/\n\/* EKB Project *\/\n\/* *\/\n\/* COPYRIGHT 2016 *\/\n\/* [+] International Business Machines Corp. *\/\n\/* *\/\n\/* *\/\n\/* The source code for this program is not published or otherwise *\/\n\/* divested of its trade secrets, irrespective of what has been *\/\n\/* deposited with the U.S. Copyright Office. *\/\n\/* *\/\n\/* IBM_PROLOG_END_TAG *\/\n#ifndef __P9_SCAN_COMPRESSION_H__\n#define __P9_SCAN_COMPRESSION_H__\n\n\/\/\/ This header declares and documents the entry points defined in\n\/\/\/ p9_scan_compression.C. Some constants are also required by the scan\n\/\/\/ decompression HOMER assembly procedures.\n\n#ifndef __ASSEMBLER__\n\n#include <stdint.h>\n\n\/\/\/ Compressed Scan Chain Data Structure Format\n\/\/\/\n\/\/\/ The compressed scan ring data structure must be 8-byte aligned in\n\/\/\/ memory. The container data structure consists of this 24-byte header\n\/\/\/ followed by an arbitrary number of 8 byte doublewords containing the\n\/\/\/ compressed scan data. Images are always stored and processed in\n\/\/\/ big-endian byte order. This container format is common across all\n\/\/\/ decompression algorithms.\n\/\/\/\n\/\/\/ Bytes - Content\n\/\/\/\n\/\/\/ 0:3 - A 32-bit \"magic number\" that identifies and validates the\n\/\/\/ compression algorithm and algorithm version used to compress the data.\n\/\/\/\n\/\/\/ 4:7 - The 32-bit size of the entire data structure in \\e bytes. Thi\n\/\/\/ consists of this 24-byte header plus the compressed scan data. This value\n\/\/\/ is always a multiple of 8.\n\/\/\/\n\/\/\/ 8:11 - This 32-bit value is reserved to the compression\n\/\/\/ algorithm. Typically this field is used to record the 'size' of the\n\/\/\/ compressed string in units specific to each algorithm.\n\/\/\/\n\/\/\/ 12:15 - The length of the original scan chain in \\e bits.\n\/\/\/\n\/\/\/ 16:23 - The 64 bit scan Region and type details\n\/\/\/\n\/\/\/\n\/\/\/ 24:27 - The 32 high-order bits of the value written to the Scan Select\n\/\/\/ register to set up the scan. The Scan Select register only defines these\n\/\/\/ bits. (Planned to use scan scom register value)\n\/\/\/\n\/\/\/ 28 - The Scan Chain Data Structure version number\n\/\/\/\n\/\/\/ 29 - Flush-optimize : Is this byte is non-zero, the ring state to be\n\/\/\/ modified is the flush state of the ring.\n\/\/\/\n\/\/\/ 30 - The ring ID uniquely identifying the repair ring name.\n\/\/\/\n\/\/\/ 31 - The 7-bit pervasive chiplet Id + Multicast bit of the chiplet to\n\/\/\/ scan. This value is loaded directly into P0. The decompression\n\/\/\/ algorithms provide two entry points - one that uses this value as the\n\/\/\/ chiplet Id, and another that allows the caller to specify the chiplet Id\n\/\/\/ in the call.\n\ntypedef struct\n{\n\n \/\/\/ Magic number - See \\ref scan_compression_magic\n uint32_t iv_magic;\n\n \/\/\/ Total size in bytes, including the container header\n uint32_t iv_size;\n\n \/\/\/ Reserved to the algorithm\n uint32_t iv_algorithmReserved;\n\n \/\/\/ Length of the original scan chain in bits\n uint32_t iv_length;\n\n \/\/\/ 64 bit scan select register value\n uint64_t iv_scanSelect;\n\n \/\/\/ Data structure (header) version\n uint8_t iv_headerVersion;\n\n \/\/\/ Flush-state optimization\n \/\/\/\n \/\/\/ Normally, modifying the state of the ring requires XOR-ing the\n \/\/\/ difference state (the compressed state) with the current ring state as\n \/\/\/ it will appear in the Scan Data Register. If the current state of the\n \/\/\/ ring is the scan-0 flush state, then by definition the Scan Data\n \/\/\/ Register is always 0. Therefore we can simply write the difference to\n \/\/\/ the Scan Data Register rather than using a read-XOR-write.\n uint8_t iv_flushOptimization;\n\n \/\/\/ Ring ID uniquely identifying the repair name. (See the list of ring\n \/\/\/ name vs ring IDs in p8_ring_identification.c).\n uint8_t iv_ringId;\n\n \/\/\/ 7-bit pervasive chiplet Id + Multicast bit\n \/\/\/\n \/\/\/ This field is right-justified in an 8-byte aligned doubleword so that\n \/\/\/ the P0 register can be directly updated from the doubelword value in a\n \/\/\/ data register.\n uint8_t iv_chipletId;\n\n} CompressedScanData;\n\n\n\/\/\/ Endian-translate a CompressedScanData structure\n\/\/\/\n\/\/\/ \\param o_data A pointer to a CompressedScanData structure to receive the\n\/\/\/ endian-translated form of \\a i_data.\n\/\/\/\n\/\/\/ \\param i_data A pointer to the original CompressedScanData structure.\n\/\/\/\n\/\/\/ This API performs an endian-converting copy of a CompressedScanData\n\/\/\/ structure. This copy is guaranteed to be done in such a way that \\a i_data\n\/\/\/ and \\a o_data may be the same pointer for in-place conversion. Due to the\n\/\/\/ symmetry of reverse, translating a structure twice is always guaranteed to\n\/\/\/ return the origial structure to its original byte order.\nvoid\ncompressed_scan_data_translate(CompressedScanData* o_data,\n CompressedScanData* i_data);\n\n\n\/\/\/ Compress a scan string using the RS4 compression algorithm\n\/\/\/\n\/\/\/ \\param[in,out] io_data This is a pointer to a memory area which must be\n\/\/\/ large enough to hold the worst-case result of compressing \\a i_string (see\n\/\/\/ below). Note that the CompressedScanData is always created in big-endian\n\/\/\/ format, however the caller can use compresed_scan_data_translate() to\n\/\/\/ create a copy of the header in host format.\n\/\/\/\n\/\/\/ \\param[in] i_dataSize The size of \\a io_data in bytes.\n\/\/\/\n\/\/\/ \\param[out] o_imageSize The effective size of the entire compressed scan\n\/\/\/ data structure (header + compressed data) created in \\a io_data, in bytes.\n\/\/\/ This value will always be a multiple of 8.\n\/\/\/\n\/\/\/ \\param[in] i_data_str The string to compress. Scan data to compress is\n\/\/\/ left-justified in this input string.\n\/\/\/\n\/\/\/ \\param[in] i_care_str The care mask that identifies which bits in the\n\/\/\/ i_data_str that need to be scanned (written). String is left-justified.\n\/\/\/\n\/\/\/ \\param[in] i_length The length of the input string in \\e bits. It is\n\/\/\/ assumed the \\a i_string contains at least (\\a i_length + 7) \/ 8 bytes.\n\/\/\/\n\/\/\/ \\param[in] i_scanSelect The 64-bit value written to the Scan Select\n\/\/\/ register to set up for the scan.\n\/\/\/\n\/\/\/ \\param[in] i_ringId The ring ID that uniquely identifies the ring name of\n\/\/\/ a repair ring. (See p8_ring_identification.c for more info.)\n\/\/\/\n\/\/\/ \\param[in] i_chipletId The 7-bit value for the iv_chipletId field of the\n\/\/\/ CompressedScanData.\n\/\/\/\n\/\/\/ \\param[in] i_flushOptimization This input parameter should be set to a\n\/\/\/ non-0 value if it is known that this ring difference will be applied to a\n\/\/\/ scan-0 flush state. This will improve the performance of the\n\/\/\/ decompress-scan routine. If the initial state of the ring is unknown, set\n\/\/\/ this parameter to 0.\n\/\/\/\n\/\/\/ This API is required for integration with PHYP which does not support\n\/\/\/ malloc(). Applications in environments supporting malloc() can use\n\/\/\/ rs4_compress() instead.\n\/\/\/\n\/\/\/ The worst-case compression for RS4 requires 2 nibbles of control overhead\n\/\/\/ per 15 nibbles of data (17\/15), plus a maximum of 2 nibbles of termination.\n\/\/\/ We always require this worst-case amount of memory including the header and\n\/\/\/ any rounding required to guarantee that the data size is a multiple of 8\n\/\/\/ bytes. The final image size is also rounded up to a multiple of 8 bytes.\n\/\/\/ If the \\a i_dataSize is less than this amount (based on \\a i_length) the\n\/\/\/ call will fail.\n\/\/\/\n\/\/\/ \\returns See \\ref scan_compression_codes\nint\n_rs4_compress(CompressedScanData* io_data,\n uint32_t i_dataSize,\n uint32_t* o_imageSize,\n const uint8_t* i_data_str,\n const uint8_t* i_care_str,\n const uint32_t i_length,\n const uint64_t i_scanSelect,\n const uint8_t i_ringId,\n const uint8_t i_chipletId,\n const uint8_t i_flushOptimization);\n\n\n\/\/\/ Compress a scan string using the RS4 compression algorithm\n\/\/\/\n\/\/\/ \\param[out] o_data This algorithm uses malloc() to allocate memory for the\n\/\/\/ compresed data, and returns a pointer to this memory in \\a o_data. After\n\/\/\/ the call this memory is owned by the caller who is responsible for\n\/\/\/ free()-ing the data area once it is no longer required. Note that the\n\/\/\/ CompressedScanData is always created in big-endian format, however the\n\/\/\/ caller can use compresed_scan_data_translate() to create a copy of the\n\/\/\/ header in host format.\n\/\/\/\n\/\/\/ \\param[out] o_size The effective size of the entire compressed scan data\n\/\/\/ structure (header + compressed data) pointed to by \\a o_data, in bytes.\n\/\/\/ This value will always be a multiple of 8.\n\/\/\/\n\/\/\/ \\param[in] i_data_str The string to compress. Scan data to compress is\n\/\/\/ left-justified in this input string.\n\/\/\/\n\/\/\/ \\param[in] i_care_str The care mask that identifies which bits in the\n\/\/\/ i_data_str that need to be scanned (written). String is left-justified.\n\/\/\/\n\/\/\/ \\param[in] i_length The length of the input string in \\e bits. It is\n\/\/\/ assumed the \\a i_string contains at least (\\a i_length + 7) \/ 8 bytes.\n\/\/\/\n\/\/\/ \\param[in] i_scanSelect The 64-bit value written to the Scan Select\n\/\/\/ register to set up for the scan. Only the 32 high-order bits are actually\n\/\/\/ stored.\n\/\/\/\n\/\/\/ \\param[in] i_ringId The ring ID that uniquely identifies the ring name of\n\/\/\/ a repair ring. (See p8_ring_identification.c for more info.)\n\/\/\/\n\/\/\/ \\param[in] i_chipletId The 7-bit value for the iv_chipletId field of the\n\/\/\/ CompressedScanData.\n\/\/\/\n\/\/\/ \\param[in] i_flushOptimization This input parameter should be set to a\n\/\/\/ non-0 value if it is known that this ring difference will be applied to a\n\/\/\/ scan-0 flush state. This will improve the performance of the\n\/\/\/ decompress-scan routine. If the initial state of the ring is unknown, set\n\/\/\/ this parameter to 0.\n\/\/\/\n\/\/\/ \\returns See \\ref scan_compression_codes\nint\nrs4_compress(CompressedScanData** o_data,\n uint32_t* o_size,\n const uint8_t* i_data_str,\n const uint8_t* i_care_str,\n const uint32_t i_length,\n const uint64_t i_scanSelect,\n const uint8_t i_ringId,\n const uint8_t i_chipletId,\n const uint8_t i_flushOptimization);\n\n\n\/\/\/ Decompress a scan string compressed using the RS4 compression algorithm\n\/\/\/\n\/\/\/ \\param[in,out] io_string A caller-supplied data area to contain the\n\/\/\/ decompressed string. The \\a i_stringSize must be large enough to contain\n\/\/\/ the decompressed string, which is the size of the original string in bits\n\/\/\/ rounded up to the nearest byte.\n\/\/\/\n\/\/\/ \\param[in] i_stringSize The size (in bytes) of \\a i_string.\n\/\/\/\n\/\/\/ \\param[out] o_length The length of the decompressed string in \\e bits.\n\/\/\/\n\/\/\/ \\param[in] i_data A pointer to the CompressedScanData header + data to be\n\/\/\/ decompressed.\n\/\/\/\n\/\/\/ This API is required for integration with PHYP which does not support\n\/\/\/ malloc(). Applications in environments supporting malloc() can use\n\/\/\/ rs4_decompress() instead.\n\/\/\/\n\/\/\/ \\returns See \\ref scan_compression_codes\nint\n_rs4_decompress(uint8_t* i_string,\n uint32_t i_stringSize,\n uint32_t* o_length,\n const CompressedScanData* i_data);\n\n\n\/\/\/ Decompress a scan string compressed using the RS4 compression algorithm\n\/\/\/\n\/\/\/ \\param[out] o_string The API malloc()-s this data area to contain the\n\/\/\/ decompressed string. After this call the caller owns \\a o_string and is\n\/\/\/ responsible for free()-ing this data area once it is no longer required.\n\/\/\/\n\/\/\/ \\param[out] o_length The length of the decompressed string in \\e bits.\n\/\/\/ The caller may assume that \\a o_string contains at least (\\a o_length + 7)\n\/\/\/ \/ 8 \\e bytes.\n\/\/\/\n\/\/\/ \\param[in] i_data A pointer to the CompressedScanData header + data to be\n\/\/\/ decompressed.\n\/\/\/\n\/\/\/ \\returns See \\ref scan_compression_codes\nint\nrs4_decompress(uint8_t** o_string,\n uint32_t* o_length,\n const CompressedScanData* i_data);\n\n\n\/\/\/ Determine if an RS4 compressed scan string is all 0\n\/\/\/\n\/\/\/ \\param[in] i_data A pointer to the CompressedScanData header + data to be\n\/\/\/\n\/\/\/ \\param[out] o_redundant Set to 1 if the RS4 string is the compressed form\n\/\/\/ of a scan string that is all 0; Otherwise set to 0.\n\/\/\/\n\/\/\/ \\returns See \\ref scan _compression_code\nint\nrs4_redundant(const CompressedScanData* i_data, int* o_redundant);\n\n\n#endif \/\/ __ASSEMBLER__\n\n\n\/\/\/ The current version of the CompressedScanData structure\n\/\/\/\n\/\/\/ This constant is required to be a #define to guarantee consistency between\n\/\/\/ the header format and cmopiled code.\n#define COMPRESSED_SCAN_DATA_VERSION 1\n\n\/\/\/ The size of the CompressedScanData structure\n#define COMPRESSED_SCAN_DATA_SIZE (uint8_t)24\n\n\n\/\/\/ \\defgroup scan_compression_magic Scan Compression Magic Numbers\n\/\/\/\/\/\n\/\/\/ @ {\n\n\/\/\/ RS4 Magic\n#define RS4_MAGIC (uint32_t)0x52533401 \/* \"RS4\" + Version 0x01 *\/\n\n\/\/\/ @}\n\n\n\/\/\/ \\defgroup scan_compression_codes Scan Compression Return Codes\n\/\/\/\n\/\/\/ @{\n\n\/\/\/ Normal return code\n#define SCAN_COMPRESSION_OK (uint8_t)0\n\n\/\/\/ The (de)compression algorithm could not allocate enough memory for the\n\/\/\/ (de)compression.\n#define SCAN_COMPRESSION_NO_MEMORY (uint8_t)1\n\n\/\/\/ Magic number mismatch on scan decompression\n#define SCAN_DECOMPRESSION_MAGIC_ERROR (uint8_t)2\n\n\/\/\/ Decompression size error\n\/\/\/\n\/\/\/ Decompression produced a string of a size different than indicated in the\n\/\/\/ header, indicating either a bug or data corruption. Note that the entire\n\/\/\/ application should be considered corrupted if this error occurs since it\n\/\/\/ may not be discovered until after the decompression buffer is\n\/\/\/ overrun. This error may also be returned by rs4_redundant() in the event\n\/\/\/ of inconsistencies in the compressed string.\n#define SCAN_DECOMPRESSION_SIZE_ERROR (uint8_t)3\n\n\/\/\/ A buffer would overflow\n\/\/\/\n\/\/\/ Either the caller-supplied memory buffer to _rs4_decompress() was too\n\/\/\/ small to contain the decompressed string, or a caller-supplied buffer to\n\/\/\/ _rs4_compress() was not large enough to hold the worst-case compressed\n\/\/\/ string.\n#define SCAN_COMPRESSION_BUFFER_OVERFLOW (uint8_t)4\n\n\/\/\/ @}\n\n#endif \/\/ __P9_SCAN_COMPRESSION_H__\n<commit_msg>p9_scan_compression: RS4v2 compression error return fix<commit_after>\/* IBM_PROLOG_BEGIN_TAG *\/\n\/* This is an automatically generated prolog. *\/\n\/* *\/\n\/* $Source: chips\/p9\/utils\/imageProcs\/p9_scan_compression.H $ *\/\n\/* *\/\n\/* IBM CONFIDENTIAL *\/\n\/* *\/\n\/* EKB Project *\/\n\/* *\/\n\/* COPYRIGHT 2016 *\/\n\/* [+] International Business Machines Corp. *\/\n\/* *\/\n\/* *\/\n\/* The source code for this program is not published or otherwise *\/\n\/* divested of its trade secrets, irrespective of what has been *\/\n\/* deposited with the U.S. Copyright Office. *\/\n\/* *\/\n\/* IBM_PROLOG_END_TAG *\/\n#ifndef __P9_SCAN_COMPRESSION_H__\n#define __P9_SCAN_COMPRESSION_H__\n\n\/\/\/ This header declares and documents the entry points defined in\n\/\/\/ p9_scan_compression.C. Some constants are also required by the scan\n\/\/\/ decompression HOMER assembly procedures.\n\n#ifndef __ASSEMBLER__\n\n#include <stdint.h>\n\n\/\/\/ Compressed Scan Chain Data Structure Format\n\/\/\/\n\/\/\/ The compressed scan ring data structure must be 8-byte aligned in\n\/\/\/ memory. The container data structure consists of this 24-byte header\n\/\/\/ followed by an arbitrary number of 8 byte doublewords containing the\n\/\/\/ compressed scan data. Images are always stored and processed in\n\/\/\/ big-endian byte order. This container format is common across all\n\/\/\/ decompression algorithms.\n\/\/\/\n\/\/\/ Bytes - Content\n\/\/\/\n\/\/\/ 0:3 - A 32-bit \"magic number\" that identifies and validates the\n\/\/\/ compression algorithm and algorithm version used to compress the data.\n\/\/\/\n\/\/\/ 4:7 - The 32-bit size of the entire data structure in \\e bytes. Thi\n\/\/\/ consists of this 24-byte header plus the compressed scan data. This value\n\/\/\/ is always a multiple of 8.\n\/\/\/\n\/\/\/ 8:11 - This 32-bit value is reserved to the compression\n\/\/\/ algorithm. Typically this field is used to record the 'size' of the\n\/\/\/ compressed string in units specific to each algorithm.\n\/\/\/\n\/\/\/ 12:15 - The length of the original scan chain in \\e bits.\n\/\/\/\n\/\/\/ 16:23 - The 64 bit scan Region and type details\n\/\/\/\n\/\/\/\n\/\/\/ 24:27 - The 32 high-order bits of the value written to the Scan Select\n\/\/\/ register to set up the scan. The Scan Select register only defines these\n\/\/\/ bits. (Planned to use scan scom register value)\n\/\/\/\n\/\/\/ 28 - The Scan Chain Data Structure version number\n\/\/\/\n\/\/\/ 29 - Flush-optimize : Is this byte is non-zero, the ring state to be\n\/\/\/ modified is the flush state of the ring.\n\/\/\/\n\/\/\/ 30 - The ring ID uniquely identifying the repair ring name.\n\/\/\/\n\/\/\/ 31 - The 7-bit pervasive chiplet Id + Multicast bit of the chiplet to\n\/\/\/ scan. This value is loaded directly into P0. The decompression\n\/\/\/ algorithms provide two entry points - one that uses this value as the\n\/\/\/ chiplet Id, and another that allows the caller to specify the chiplet Id\n\/\/\/ in the call.\n\ntypedef struct\n{\n\n \/\/\/ Magic number - See \\ref scan_compression_magic\n uint32_t iv_magic;\n\n \/\/\/ Total size in bytes, including the container header\n uint32_t iv_size;\n\n \/\/\/ Reserved to the algorithm\n uint32_t iv_algorithmReserved;\n\n \/\/\/ Length of the original scan chain in bits\n uint32_t iv_length;\n\n \/\/\/ 64 bit scan select register value\n uint64_t iv_scanSelect;\n\n \/\/\/ Data structure (header) version\n uint8_t iv_headerVersion;\n\n \/\/\/ Flush-state optimization\n \/\/\/\n \/\/\/ Normally, modifying the state of the ring requires XOR-ing the\n \/\/\/ difference state (the compressed state) with the current ring state as\n \/\/\/ it will appear in the Scan Data Register. If the current state of the\n \/\/\/ ring is the scan-0 flush state, then by definition the Scan Data\n \/\/\/ Register is always 0. Therefore we can simply write the difference to\n \/\/\/ the Scan Data Register rather than using a read-XOR-write.\n uint8_t iv_flushOptimization;\n\n \/\/\/ Ring ID uniquely identifying the repair name. (See the list of ring\n \/\/\/ name vs ring IDs in p8_ring_identification.c).\n uint8_t iv_ringId;\n\n \/\/\/ 7-bit pervasive chiplet Id + Multicast bit\n \/\/\/\n \/\/\/ This field is right-justified in an 8-byte aligned doubleword so that\n \/\/\/ the P0 register can be directly updated from the doubelword value in a\n \/\/\/ data register.\n uint8_t iv_chipletId;\n\n} CompressedScanData;\n\n\n\/\/\/ Endian-translate a CompressedScanData structure\n\/\/\/\n\/\/\/ \\param o_data A pointer to a CompressedScanData structure to receive the\n\/\/\/ endian-translated form of \\a i_data.\n\/\/\/\n\/\/\/ \\param i_data A pointer to the original CompressedScanData structure.\n\/\/\/\n\/\/\/ This API performs an endian-converting copy of a CompressedScanData\n\/\/\/ structure. This copy is guaranteed to be done in such a way that \\a i_data\n\/\/\/ and \\a o_data may be the same pointer for in-place conversion. Due to the\n\/\/\/ symmetry of reverse, translating a structure twice is always guaranteed to\n\/\/\/ return the origial structure to its original byte order.\nvoid\ncompressed_scan_data_translate(CompressedScanData* o_data,\n CompressedScanData* i_data);\n\n\n\/\/\/ Compress a scan string using the RS4 compression algorithm\n\/\/\/\n\/\/\/ \\param[in,out] io_data This is a pointer to a memory area which must be\n\/\/\/ large enough to hold the worst-case result of compressing \\a i_string (see\n\/\/\/ below). Note that the CompressedScanData is always created in big-endian\n\/\/\/ format, however the caller can use compresed_scan_data_translate() to\n\/\/\/ create a copy of the header in host format.\n\/\/\/\n\/\/\/ \\param[in] i_dataSize The size of \\a io_data in bytes.\n\/\/\/\n\/\/\/ \\param[out] o_imageSize The effective size of the entire compressed scan\n\/\/\/ data structure (header + compressed data) created in \\a io_data, in bytes.\n\/\/\/ This value will always be a multiple of 8.\n\/\/\/\n\/\/\/ \\param[in] i_data_str The string to compress. Scan data to compress is\n\/\/\/ left-justified in this input string.\n\/\/\/\n\/\/\/ \\param[in] i_care_str The care mask that identifies which bits in the\n\/\/\/ i_data_str that need to be scanned (written). String is left-justified.\n\/\/\/\n\/\/\/ \\param[in] i_length The length of the input string in \\e bits. It is\n\/\/\/ assumed the \\a i_string contains at least (\\a i_length + 7) \/ 8 bytes.\n\/\/\/\n\/\/\/ \\param[in] i_scanSelect The 64-bit value written to the Scan Select\n\/\/\/ register to set up for the scan.\n\/\/\/\n\/\/\/ \\param[in] i_ringId The ring ID that uniquely identifies the ring name of\n\/\/\/ a repair ring. (See p8_ring_identification.c for more info.)\n\/\/\/\n\/\/\/ \\param[in] i_chipletId The 7-bit value for the iv_chipletId field of the\n\/\/\/ CompressedScanData.\n\/\/\/\n\/\/\/ \\param[in] i_flushOptimization This input parameter should be set to a\n\/\/\/ non-0 value if it is known that this ring difference will be applied to a\n\/\/\/ scan-0 flush state. This will improve the performance of the\n\/\/\/ decompress-scan routine. If the initial state of the ring is unknown, set\n\/\/\/ this parameter to 0.\n\/\/\/\n\/\/\/ This API is required for integration with PHYP which does not support\n\/\/\/ malloc(). Applications in environments supporting malloc() can use\n\/\/\/ rs4_compress() instead.\n\/\/\/\n\/\/\/ The worst-case compression for RS4 requires 2 nibbles of control overhead\n\/\/\/ per 15 nibbles of data (17\/15), plus a maximum of 2 nibbles of termination.\n\/\/\/ We always require this worst-case amount of memory including the header and\n\/\/\/ any rounding required to guarantee that the data size is a multiple of 8\n\/\/\/ bytes. The final image size is also rounded up to a multiple of 8 bytes.\n\/\/\/ If the \\a i_dataSize is less than this amount (based on \\a i_length) the\n\/\/\/ call will fail.\n\/\/\/\n\/\/\/ \\returns See \\ref scan_compression_codes\nint\n_rs4_compress(CompressedScanData* io_data,\n uint32_t i_dataSize,\n uint32_t* o_imageSize,\n const uint8_t* i_data_str,\n const uint8_t* i_care_str,\n const uint32_t i_length,\n const uint64_t i_scanSelect,\n const uint8_t i_ringId,\n const uint8_t i_chipletId,\n const uint8_t i_flushOptimization);\n\n\n\/\/\/ Compress a scan string using the RS4 compression algorithm\n\/\/\/\n\/\/\/ \\param[out] o_data This algorithm uses malloc() to allocate memory for the\n\/\/\/ compresed data, and returns a pointer to this memory in \\a o_data. After\n\/\/\/ the call this memory is owned by the caller who is responsible for\n\/\/\/ free()-ing the data area once it is no longer required. Note that the\n\/\/\/ CompressedScanData is always created in big-endian format, however the\n\/\/\/ caller can use compresed_scan_data_translate() to create a copy of the\n\/\/\/ header in host format.\n\/\/\/\n\/\/\/ \\param[out] o_size The effective size of the entire compressed scan data\n\/\/\/ structure (header + compressed data) pointed to by \\a o_data, in bytes.\n\/\/\/ This value will always be a multiple of 8.\n\/\/\/\n\/\/\/ \\param[in] i_data_str The string to compress. Scan data to compress is\n\/\/\/ left-justified in this input string.\n\/\/\/\n\/\/\/ \\param[in] i_care_str The care mask that identifies which bits in the\n\/\/\/ i_data_str that need to be scanned (written). String is left-justified.\n\/\/\/\n\/\/\/ \\param[in] i_length The length of the input string in \\e bits. It is\n\/\/\/ assumed the \\a i_string contains at least (\\a i_length + 7) \/ 8 bytes.\n\/\/\/\n\/\/\/ \\param[in] i_scanSelect The 64-bit value written to the Scan Select\n\/\/\/ register to set up for the scan. Only the 32 high-order bits are actually\n\/\/\/ stored.\n\/\/\/\n\/\/\/ \\param[in] i_ringId The ring ID that uniquely identifies the ring name of\n\/\/\/ a repair ring. (See p8_ring_identification.c for more info.)\n\/\/\/\n\/\/\/ \\param[in] i_chipletId The 7-bit value for the iv_chipletId field of the\n\/\/\/ CompressedScanData.\n\/\/\/\n\/\/\/ \\param[in] i_flushOptimization This input parameter should be set to a\n\/\/\/ non-0 value if it is known that this ring difference will be applied to a\n\/\/\/ scan-0 flush state. This will improve the performance of the\n\/\/\/ decompress-scan routine. If the initial state of the ring is unknown, set\n\/\/\/ this parameter to 0.\n\/\/\/\n\/\/\/ \\returns See \\ref scan_compression_codes\nint\nrs4_compress(CompressedScanData** o_data,\n uint32_t* o_size,\n const uint8_t* i_data_str,\n const uint8_t* i_care_str,\n const uint32_t i_length,\n const uint64_t i_scanSelect,\n const uint8_t i_ringId,\n const uint8_t i_chipletId,\n const uint8_t i_flushOptimization);\n\n\n\/\/\/ Decompress a scan string compressed using the RS4 compression algorithm\n\/\/\/\n\/\/\/ \\param[in,out] io_string A caller-supplied data area to contain the\n\/\/\/ decompressed string. The \\a i_stringSize must be large enough to contain\n\/\/\/ the decompressed string, which is the size of the original string in bits\n\/\/\/ rounded up to the nearest byte.\n\/\/\/\n\/\/\/ \\param[in] i_stringSize The size (in bytes) of \\a i_string.\n\/\/\/\n\/\/\/ \\param[out] o_length The length of the decompressed string in \\e bits.\n\/\/\/\n\/\/\/ \\param[in] i_data A pointer to the CompressedScanData header + data to be\n\/\/\/ decompressed.\n\/\/\/\n\/\/\/ This API is required for integration with PHYP which does not support\n\/\/\/ malloc(). Applications in environments supporting malloc() can use\n\/\/\/ rs4_decompress() instead.\n\/\/\/\n\/\/\/ \\returns See \\ref scan_compression_codes\nint\n_rs4_decompress(uint8_t* i_string,\n uint32_t i_stringSize,\n uint32_t* o_length,\n const CompressedScanData* i_data);\n\n\n\/\/\/ Decompress a scan string compressed using the RS4 compression algorithm\n\/\/\/\n\/\/\/ \\param[out] o_string The API malloc()-s this data area to contain the\n\/\/\/ decompressed string. After this call the caller owns \\a o_string and is\n\/\/\/ responsible for free()-ing this data area once it is no longer required.\n\/\/\/\n\/\/\/ \\param[out] o_length The length of the decompressed string in \\e bits.\n\/\/\/ The caller may assume that \\a o_string contains at least (\\a o_length + 7)\n\/\/\/ \/ 8 \\e bytes.\n\/\/\/\n\/\/\/ \\param[in] i_data A pointer to the CompressedScanData header + data to be\n\/\/\/ decompressed.\n\/\/\/\n\/\/\/ \\returns See \\ref scan_compression_codes\nint\nrs4_decompress(uint8_t** o_string,\n uint32_t* o_length,\n const CompressedScanData* i_data);\n\n\n\/\/\/ Determine if an RS4 compressed scan string is all 0\n\/\/\/\n\/\/\/ \\param[in] i_data A pointer to the CompressedScanData header + data to be\n\/\/\/\n\/\/\/ \\param[out] o_redundant Set to 1 if the RS4 string is the compressed form\n\/\/\/ of a scan string that is all 0; Otherwise set to 0.\n\/\/\/\n\/\/\/ \\returns See \\ref scan _compression_code\nint\nrs4_redundant(const CompressedScanData* i_data, int* o_redundant);\n\n\n#endif \/\/ __ASSEMBLER__\n\n\n\/\/\/ The current version of the CompressedScanData structure\n\/\/\/\n\/\/\/ This constant is required to be a #define to guarantee consistency between\n\/\/\/ the header format and cmopiled code.\n#define COMPRESSED_SCAN_DATA_VERSION 1\n\n\/\/\/ The size of the CompressedScanData structure\n#define COMPRESSED_SCAN_DATA_SIZE (uint8_t)24\n\n\n\/\/\/ \\defgroup scan_compression_magic Scan Compression Magic Numbers\n\/\/\/\/\/\n\/\/\/ @ {\n\n\/\/\/ RS4 Magic\n#define RS4_MAGIC (uint32_t)0x52533401 \/* \"RS4\" + Version 0x01 *\/\n\n\/\/\/ @}\n\n\n\/\/\/ \\defgroup scan_compression_codes Scan Compression Return Codes\n\/\/\/\n\/\/\/ @{\n\n\/\/\/ Normal return code\n#define SCAN_COMPRESSION_OK (uint8_t)0\n\n\/\/\/ The (de)compression algorithm could not allocate enough memory for the\n\/\/\/ (de)compression.\n#define SCAN_COMPRESSION_NO_MEMORY (uint8_t)1\n\n\/\/\/ Magic number mismatch on scan decompression\n#define SCAN_DECOMPRESSION_MAGIC_ERROR (uint8_t)2\n\n\/\/\/ Decompression size error\n\/\/\/\n\/\/\/ Decompression produced a string of a size different than indicated in the\n\/\/\/ header, indicating either a bug or data corruption. Note that the entire\n\/\/\/ application should be considered corrupted if this error occurs since it\n\/\/\/ may not be discovered until after the decompression buffer is\n\/\/\/ overrun. This error may also be returned by rs4_redundant() in the event\n\/\/\/ of inconsistencies in the compressed string.\n#define SCAN_DECOMPRESSION_SIZE_ERROR (uint8_t)3\n\n\/\/\/ A buffer would overflow\n\/\/\/\n\/\/\/ Either the caller-supplied memory buffer to _rs4_decompress() was too\n\/\/\/ small to contain the decompressed string, or a caller-supplied buffer to\n\/\/\/ _rs4_compress() was not large enough to hold the worst-case compressed\n\/\/\/ string.\n#define SCAN_COMPRESSION_BUFFER_OVERFLOW (uint8_t)4\n\n\/\/\/ Inconsistent input data\n\/\/\/\n\/\/\/ 1 in data is masked by 0 in care mask\n#define SCAN_COMPRESSION_INPUT_ERROR 5\n\n\/\/\/ Invalid transition in state machine\n#define SCAN_COMPRESSION_STATE_ERROR 6\n\n\/\/\/ @}\n\n#endif \/\/ __P9_SCAN_COMPRESSION_H__\n<|endoftext|>"} {"text":"<commit_before>\/*************************************************************************\n *\n * OpenOffice.org - a multi-platform office productivity suite\n *\n * $RCSfile: b3dcolor.hxx,v $\n *\n * $Revision: 1.2 $\n *\n * last change: $Author: vg $ $Date: 2007-04-11 20:31:44 $\n *\n * The Contents of this file are made available subject to\n * the terms of GNU Lesser General Public License Version 2.1.\n *\n *\n * GNU Lesser General Public License Version 2.1\n * =============================================\n * Copyright 2005 by Sun Microsystems, Inc.\n * 901 San Antonio Road, Palo Alto, CA 94303, USA\n *\n * This library is free software; you can redistribute it and\/or\n * modify it under the terms of the GNU Lesser General Public\n * License version 2.1, as published by the Free Software Foundation.\n *\n * This library is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU\n * Lesser General Public License for more details.\n *\n * You should have received a copy of the GNU Lesser General Public\n * License along with this library; if not, write to the Free Software\n * Foundation, Inc., 59 Temple Place, Suite 330, Boston,\n * MA 02111-1307 USA\n *\n ************************************************************************\/\n\n#ifndef _B3D_B3DCOLOR_HXX\n#define _B3D_B3DCOLOR_HXX\n\n#ifndef _TOOLS_COLOR_HXX\n#include <tools\/color.hxx>\n#endif\n\n\/*************************************************************************\n|*\n|* Farbklasse fuer 3D. Besitzt einige Funktionen mehr, als die normale\n|* Farbe\n|*\n\\************************************************************************\/\n\nclass B3dColor : public Color\n{\npublic:\n B3dColor() : Color() {}\n B3dColor( ColorData nColor ) : Color(nColor) {}\n B3dColor( UINT8 nRed, UINT8 nGreen, UINT8 nBlue )\n : Color(nRed, nGreen, nBlue) {}\n B3dColor( UINT8 nTransparency, UINT8 nRed, UINT8 nGreen, UINT8 nBlue )\n : Color(nTransparency, nRed, nGreen, nBlue) {}\n B3dColor( const ResId& rResId ) : Color(rResId) {}\n B3dColor( const Color& rCol ) : Color(rCol) {}\n\n void CalcInBetween(Color& rOld1, Color& rOld2, double t);\n void CalcMiddle(Color& rOld1, Color& rOld2);\n void CalcMiddle(Color& rOld1, Color& rOld2, Color& rOld3);\n ULONG GetDistance(Color& rOld);\n\n \/\/ Addition, Subtraktion mit clamping\n B3dColor& operator+= (const B3dColor&);\n B3dColor& operator-= (const B3dColor&);\n B3dColor operator+ (const B3dColor&) const;\n B3dColor operator- (const B3dColor&) const;\n\n \/\/ Multiplikation als Gewichtung, Anwendung einer Lampe\n \/\/ auf eine Farbe, Lampe als 2.Faktor\n B3dColor& operator*= (const B3dColor&);\n B3dColor operator* (const B3dColor&) const;\n\n \/\/ Multiplikation mit Faktor im Bereich [0.0 .. 1.0]\n B3dColor& operator*= (const double);\n B3dColor operator* (const double) const;\n\n \/\/ Zuweisung\n void operator=(const Color& rCol) { mnColor = rCol.GetColor(); }\n};\n\n#endif \/\/ _B3D_B3DCOLOR_HXX\n<commit_msg>INTEGRATION: CWS changefileheader (1.2.86); FILE MERGED 2008\/04\/01 15:19:26 thb 1.2.86.2: #i85898# Stripping all external header guards 2008\/03\/31 13:39:30 rt 1.2.86.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: b3dcolor.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 _B3D_B3DCOLOR_HXX\n#define _B3D_B3DCOLOR_HXX\n\n#include <tools\/color.hxx>\n\n\/*************************************************************************\n|*\n|* Farbklasse fuer 3D. Besitzt einige Funktionen mehr, als die normale\n|* Farbe\n|*\n\\************************************************************************\/\n\nclass B3dColor : public Color\n{\npublic:\n B3dColor() : Color() {}\n B3dColor( ColorData nColor ) : Color(nColor) {}\n B3dColor( UINT8 nRed, UINT8 nGreen, UINT8 nBlue )\n : Color(nRed, nGreen, nBlue) {}\n B3dColor( UINT8 nTransparency, UINT8 nRed, UINT8 nGreen, UINT8 nBlue )\n : Color(nTransparency, nRed, nGreen, nBlue) {}\n B3dColor( const ResId& rResId ) : Color(rResId) {}\n B3dColor( const Color& rCol ) : Color(rCol) {}\n\n void CalcInBetween(Color& rOld1, Color& rOld2, double t);\n void CalcMiddle(Color& rOld1, Color& rOld2);\n void CalcMiddle(Color& rOld1, Color& rOld2, Color& rOld3);\n ULONG GetDistance(Color& rOld);\n\n \/\/ Addition, Subtraktion mit clamping\n B3dColor& operator+= (const B3dColor&);\n B3dColor& operator-= (const B3dColor&);\n B3dColor operator+ (const B3dColor&) const;\n B3dColor operator- (const B3dColor&) const;\n\n \/\/ Multiplikation als Gewichtung, Anwendung einer Lampe\n \/\/ auf eine Farbe, Lampe als 2.Faktor\n B3dColor& operator*= (const B3dColor&);\n B3dColor operator* (const B3dColor&) const;\n\n \/\/ Multiplikation mit Faktor im Bereich [0.0 .. 1.0]\n B3dColor& operator*= (const double);\n B3dColor operator* (const double) const;\n\n \/\/ Zuweisung\n void operator=(const Color& rCol) { mnColor = rCol.GetColor(); }\n};\n\n#endif \/\/ _B3D_B3DCOLOR_HXX\n<|endoftext|>"} {"text":"<commit_before>\/\/ (C) Copyright Gennadiy Rozental 2004.\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 : basic_cstring i\/o implementation\n\/\/ ***************************************************************************\n\n#ifndef BASIC_CSTRING_IO_HPP\n#define BASIC_CSTRING_IO_HPP\n\n\/\/ Boost.Test\n#include <boost\/test\/detail\/basic_cstring\/basic_cstring.hpp>\n\n\/\/ STL\n#include <iosfwd>\n#include <string>\n\n\/\/____________________________________________________________________________\/\/\n\nnamespace boost {\n\nnamespace unit_test {\n\n#if BOOST_WORKAROUND(__GNUC__, < 3) && !defined(__SGI_STL_PORT) && !defined(_STLPORT_VERSION)\n\ntemplate<typename CharT>\ninline std::ostream&\noperator<<( std::ostream& os, basic_cstring<CharT> const& str )\n{\n typedef typename ut_detail::bcs_base_char<CharT> char_type;\n char_type const* const beg = reinterpret_cast<char_type const* const>( str.begin() );\n char_type const* const end = reinterpret_cast<char_type const* const>( str.end() );\n os << std::basic_string<char_type>( beg, end - beg );\n\n return os;\n}\n\n#else\n\ntemplate<typename CharT1, typename Tr,typename CharT2>\ninline std::basic_ostream<CharT1,Tr>&\noperator<<( std::basic_ostream<CharT1,Tr>& os, basic_cstring<CharT2> const& str )\n{\n CharT1 const* const beg = reinterpret_cast<CharT1 const* const>( str.begin() ); \/\/!!\n CharT1 const* const end = reinterpret_cast<CharT1 const* const>( str.end() );\n os << std::basic_string<CharT1,Tr>( beg, end - beg );\n\n return os;\n}\n\n#endif\n\n\/\/____________________________________________________________________________\/\/\n\n\n} \/\/ namespace unit_test\n\n} \/\/ namespace boost\n\n\/\/ ***************************************************************************\n\/\/ Revision History :\n\/\/ \n\/\/ $Log$\n\/\/ Revision 1.5 2004\/06\/29 04:31:49 rogeeff\n\/\/ gcc 2.95 fix\n\/\/\n\/\/ Revision 1.4 2004\/06\/05 11:02:15 rogeeff\n\/\/ std::traits usage reworked\n\/\/\n\/\/ Revision 1.3 2004\/05\/27 06:24:44 rogeeff\n\/\/ workaround for gcc 2.95 io\n\/\/\n\/\/ Revision 1.2 2004\/05\/21 06:19:35 rogeeff\n\/\/ licence update\n\/\/\n\/\/ Revision 1.1 2004\/05\/11 11:00:55 rogeeff\n\/\/ basic_cstring introduced and used everywhere\n\/\/ class properties reworked\n\/\/\n\/\/ ***************************************************************************\n\n#endif \/\/ BASIC_CSTRING_IO_HPP\n<commit_msg>typo fix<commit_after>\/\/ (C) Copyright Gennadiy Rozental 2004.\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 : basic_cstring i\/o implementation\n\/\/ ***************************************************************************\n\n#ifndef BASIC_CSTRING_IO_HPP\n#define BASIC_CSTRING_IO_HPP\n\n\/\/ Boost.Test\n#include <boost\/test\/detail\/basic_cstring\/basic_cstring.hpp>\n\n\/\/ STL\n#include <iosfwd>\n#include <string>\n\n\/\/____________________________________________________________________________\/\/\n\nnamespace boost {\n\nnamespace unit_test {\n\n#if BOOST_WORKAROUND(__GNUC__, < 3) && !defined(__SGI_STL_PORT) && !defined(_STLPORT_VERSION)\n\ntemplate<typename CharT>\ninline std::ostream&\noperator<<( std::ostream& os, basic_cstring<CharT> const& str )\n{\n typedef typename ut_detail::bcs_base_char<CharT>::type char_type;\n char_type const* const beg = reinterpret_cast<char_type const* const>( str.begin() );\n char_type const* const end = reinterpret_cast<char_type const* const>( str.end() );\n os << std::basic_string<char_type>( beg, end - beg );\n\n return os;\n}\n\n#else\n\ntemplate<typename CharT1, typename Tr,typename CharT2>\ninline std::basic_ostream<CharT1,Tr>&\noperator<<( std::basic_ostream<CharT1,Tr>& os, basic_cstring<CharT2> const& str )\n{\n CharT1 const* const beg = reinterpret_cast<CharT1 const* const>( str.begin() ); \/\/!!\n CharT1 const* const end = reinterpret_cast<CharT1 const* const>( str.end() );\n os << std::basic_string<CharT1,Tr>( beg, end - beg );\n\n return os;\n}\n\n#endif\n\n\/\/____________________________________________________________________________\/\/\n\n\n} \/\/ namespace unit_test\n\n} \/\/ namespace boost\n\n\/\/ ***************************************************************************\n\/\/ Revision History :\n\/\/ \n\/\/ $Log$\n\/\/ Revision 1.6 2004\/06\/30 07:52:56 rogeeff\n\/\/ typo fix\n\/\/\n\/\/ Revision 1.5 2004\/06\/29 04:31:49 rogeeff\n\/\/ gcc 2.95 fix\n\/\/\n\/\/ Revision 1.4 2004\/06\/05 11:02:15 rogeeff\n\/\/ std::traits usage reworked\n\/\/\n\/\/ Revision 1.3 2004\/05\/27 06:24:44 rogeeff\n\/\/ workaround for gcc 2.95 io\n\/\/\n\/\/ Revision 1.2 2004\/05\/21 06:19:35 rogeeff\n\/\/ licence update\n\/\/\n\/\/ Revision 1.1 2004\/05\/11 11:00:55 rogeeff\n\/\/ basic_cstring introduced and used everywhere\n\/\/ class properties reworked\n\/\/\n\/\/ ***************************************************************************\n\n#endif \/\/ BASIC_CSTRING_IO_HPP\n<|endoftext|>"} {"text":"<commit_before>\/*********************************************************************\n * Software License Agreement (BSD License)\n *\n * Copyright (c) 2009, Willow Garage, Inc.\n * All rights reserved.\n *\n * Redistribution and use in source and binary forms, with or without\n * modification, are permitted provided that the following conditions\n * are met:\n *\n * * Redistributions of source code must retain the above copyright\n * notice, this list of conditions and the following disclaimer.\n * * Redistributions in binary form must reproduce the above\n * copyright notice, this list of conditions and the following\n * disclaimer in the documentation and\/or other materials provided\n * with the distribution.\n * * Neither the name of 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#ifndef CONTROL_TOOLBOX__VISIBILITY_CONTROL_HPP_\n#define CONTROL_TOOLBOX__VISIBILITY_CONTROL_HPP_\n\n\/\/ This logic was borrowed (then namespaced) from the examples on the gcc wiki:\n\/\/ https:\/\/gcc.gnu.org\/wiki\/Visibility\n\n#if defined _WIN32 || defined __CYGWIN__\n #ifdef __GNUC__\n #define CONTROL_TOOLBOX_EXPORT __attribute__ ((dllexport))\n #define CONTROL_TOOLBOX_IMPORT __attribute__ ((dllimport))\n #else\n #define CONTROL_TOOLBOX_EXPORT __declspec(dllexport)\n #define CONTROL_TOOLBOX_IMPORT __declspec(dllimport)\n #endif\n #ifdef CONTROL_TOOLBOX_BUILDING_LIBRARY\n #define CONTROL_TOOLBOX_PUBLIC CONTROL_TOOLBOX_EXPORT\n #else\n #define CONTROL_TOOLBOX_PUBLIC CONTROL_TOOLBOX_IMPORT\n #endif\n #define CONTROL_TOOLBOX_PUBLIC_TYPE CONTROL_TOOLBOX_PUBLIC\n #define CONTROL_TOOLBOX_LOCAL\n#else\n #define CONTROL_TOOLBOX_EXPORT __attribute__ ((visibility(\"default\")))\n #define CONTROL_TOOLBOX_IMPORT\n #if __GNUC__ >= 4\n #define CONTROL_TOOLBOX_PUBLIC __attribute__ ((visibility(\"default\")))\n #define CONTROL_TOOLBOX_LOCAL __attribute__ ((visibility(\"hidden\")))\n #else\n #define CONTROL_TOOLBOX_PUBLIC\n #define CONTROL_TOOLBOX_LOCAL\n #endif\n #define CONTROL_TOOLBOX_PUBLIC_TYPE\n#endif\n\n#endif \/\/ CONTROL_TOOLBOX__VISIBILITY_CONTROL_HPP_<commit_msg>Update visibility_control.hpp<commit_after>\/*********************************************************************\n * Software License Agreement (BSD License)\n *\n * Copyright (c) 2009, Willow Garage, Inc.\n * All rights reserved.\n *\n * Redistribution and use in source and binary forms, with or without\n * modification, are permitted provided that the following conditions\n * are met:\n *\n * * Redistributions of source code must retain the above copyright\n * notice, this list of conditions and the following disclaimer.\n * * Redistributions in binary form must reproduce the above\n * copyright notice, this list of conditions and the following\n * disclaimer in the documentation and\/or other materials provided\n * with the distribution.\n * * Neither the name of 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#ifndef CONTROL_TOOLBOX__VISIBILITY_CONTROL_HPP_\n#define CONTROL_TOOLBOX__VISIBILITY_CONTROL_HPP_\n\n\/\/ This logic was borrowed (then namespaced) from the examples on the gcc wiki:\n\/\/ https:\/\/gcc.gnu.org\/wiki\/Visibility\n\n#if defined _WIN32 || defined __CYGWIN__\n #ifdef __GNUC__\n #define CONTROL_TOOLBOX_EXPORT __attribute__ ((dllexport))\n #define CONTROL_TOOLBOX_IMPORT __attribute__ ((dllimport))\n #else\n #define CONTROL_TOOLBOX_EXPORT __declspec(dllexport)\n #define CONTROL_TOOLBOX_IMPORT __declspec(dllimport)\n #endif\n #ifdef CONTROL_TOOLBOX_BUILDING_LIBRARY\n #define CONTROL_TOOLBOX_PUBLIC CONTROL_TOOLBOX_EXPORT\n #else\n #define CONTROL_TOOLBOX_PUBLIC CONTROL_TOOLBOX_IMPORT\n #endif\n #define CONTROL_TOOLBOX_PUBLIC_TYPE CONTROL_TOOLBOX_PUBLIC\n #define CONTROL_TOOLBOX_LOCAL\n#else\n #define CONTROL_TOOLBOX_EXPORT __attribute__ ((visibility(\"default\")))\n #define CONTROL_TOOLBOX_IMPORT\n #if __GNUC__ >= 4\n #define CONTROL_TOOLBOX_PUBLIC __attribute__ ((visibility(\"default\")))\n #define CONTROL_TOOLBOX_LOCAL __attribute__ ((visibility(\"hidden\")))\n #else\n #define CONTROL_TOOLBOX_PUBLIC\n #define CONTROL_TOOLBOX_LOCAL\n #endif\n #define CONTROL_TOOLBOX_PUBLIC_TYPE\n#endif\n\n#endif \/\/ CONTROL_TOOLBOX__VISIBILITY_CONTROL_HPP_\n<|endoftext|>"} {"text":"<commit_before>\/*\n * This is part of the FL library, a C++ Bayesian filtering library\n * (https:\/\/github.com\/filtering-library)\n *\n * Copyright (c) 2014 Jan Issac (jan.issac@gmail.com)\n * Copyright (c) 2014 Manuel Wuthrich (manuel.wuthrich@gmail.com)\n *\n * Max-Planck Institute for Intelligent Systems, AMD Lab\n * University of Southern California, CLMC Lab\n *\n * This Source Code Form is subject to the terms of the MIT License (MIT).\n * A copy of the license can be found in the LICENSE file distributed with this\n * source code.\n *\/\n\n\/**\n * \\file gaussian_filter.hpp\n * \\date October 2014\n * \\author Jan Issac (jan.issac@gmail.com)\n *\/\n\n#ifndef FL__FILTER__GAUSSIAN__GAUSSIAN_FILTER_HPP\n#define FL__FILTER__GAUSSIAN__GAUSSIAN_FILTER_HPP\n\n#include <fl\/filter\/gaussian\/gaussian_filter_kf.hpp>\n#include <fl\/filter\/gaussian\/gaussian_filter_ukf.hpp>\n#include <fl\/filter\/gaussian\/gaussian_filter_ukf_npn_aon.hpp>\n\n#endif\n<commit_msg>Added few Filter policy bases<commit_after>\/*\n * This is part of the FL library, a C++ Bayesian filtering library\n * (https:\/\/github.com\/filtering-library)\n *\n * Copyright (c) 2014 Jan Issac (jan.issac@gmail.com)\n * Copyright (c) 2014 Manuel Wuthrich (manuel.wuthrich@gmail.com)\n *\n * Max-Planck Institute for Intelligent Systems, AMD Lab\n * University of Southern California, CLMC Lab\n *\n * This Source Code Form is subject to the terms of the MIT License (MIT).\n * A copy of the license can be found in the LICENSE file distributed with this\n * source code.\n *\/\n\n\/**\n * \\file gaussian_filter.hpp\n * \\date October 2014\n * \\author Jan Issac (jan.issac@gmail.com)\n *\/\n\n#ifndef FL__FILTER__GAUSSIAN__GAUSSIAN_FILTER_HPP\n#define FL__FILTER__GAUSSIAN__GAUSSIAN_FILTER_HPP\n\nnamespace fl\n{\n\nstruct FadingMemoryPolicy \/\/ None, alpha, decay\n{\n};\n\nstruct ValidationGatePolicy \/\/ Eucledian, ellipsoid\n{\n};\n\nstruct UpdatePolicy \/\/ normal, joseph\n{\n\n};\n\n\n}\n\n#include <fl\/filter\/gaussian\/gaussian_filter_kf.hpp>\n#include <fl\/filter\/gaussian\/gaussian_filter_ukf.hpp>\n#include <fl\/filter\/gaussian\/gaussian_filter_ukf_npn_aon.hpp>\n\n#endif\n<|endoftext|>"} {"text":"<commit_before>\n\/*****************************************************************************\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++ — ConfigurationParser\n *\n * This file defines (Const)ConfigurationParser, a wrapper for ib_cfgparser_t,\n * and ConfigurationDirectivesRegistrar, a helper class for attaching\n * directives to an Engine.\n *\n * @remark Developers should be familiar with @ref ironbeepp to understand\n * aspects of this code, e.g., the public\/non-virtual inheritance.\n *\n * @sa Engine::register_configuration_directives()\n *\n * @author Christopher Alfeld <calfeld@qualys.com>\n *\/\n\n#ifndef __IBPP__CONFIGURATION_DIRECTIVES__\n#define __IBPP__CONFIGURATION_DIRECTIVES__\n\n#include <ironbeepp\/common_semantics.hpp>\n#include <ironbeepp\/list.hpp>\n#include <ironbeepp\/engine.hpp>\n\n#include <ostream>\n\n#include <boost\/function.hpp>\n\n\/\/ IronBee C\ntypedef struct ib_cfgparser_t ib_cfgparser_t;\n\nnamespace IronBee {\n\nclass MemoryPool;\nclass Site;\nclass Location;\nclass Context;\n\n\/**\n * Const ConfigurationParser; equivalent to a const pointer to ib_cfgparser_t.\n *\n * Provides operators ==, !=, <, >, <=, >= and evaluation as a boolean for\n * singularity via CommonSemantics.\n *\n * See ConfigurationParser for discussion of configuration_parsers.\n *\n * @tparam T Value type for configuration_parser.\n *\n * @sa ConfigurationParser\n * @sa ironbeepp\n * @sa ib_cfgparser_t\n * @nosubgrouping\n **\/\nclass ConstConfigurationParser :\n public CommonSemantics<ConstConfigurationParser>\n{\npublic:\n \/\/! C Type.\n typedef const ib_cfgparser_t* ib_type;\n\n \/**\n * Construct singular ConstConfigurationParser.\n *\n * All behavior of a singular ConstConfigurationParser is undefined\n * except for assignment, copying, comparison, and evaluate-as-bool.\n **\/\n ConstConfigurationParser();\n\n \/**\n * @name C Interoperability\n * Methods to access underlying C types.\n **\/\n \/\/\/@{\n\n \/\/! const ib_cfgparser_t accessor.\n \/\/ Intentionally inlined.\n ib_type ib() const\n {\n return m_ib;\n }\n\n \/\/! Construct ConfigurationParser from ib_cfgparser_t.\n explicit\n ConstConfigurationParser(ib_type ib_configuration_parser);\n\n \/\/\/@}\n\n \/\/! Associated engine.\n Engine engine() const;\n\n \/\/! Associated memory pool.\n MemoryPool memory_pool() const;\n\n \/\/! Current configuration context.\n Context current_context() const;\n\n \/\/! Current configuration site.\n Site current_site() const;\n\n \/\/! Current configuration location.\n Location current_location() const;\n\n \/\/! Current configuration block name.\n const char* current_block_name() const;\n\nprivate:\n ib_type m_ib;\n};\n\n\/**\n * ConfigurationParser; equivalent to a pointer to ib_cfgparser_t.\n *\n * ConfigurationParser can be treated as ConstConfigurationParser. See @ref\n * ironbeepp for details on IronBee++ object semantics.\n *\n * At present, ConfigurationParser provides no additional functionality over\n * ConstConfigurationParser except providing a non-const @c ib_cfgparser_t*\n * via ib().\n *\n * @sa ConstConfigurationParser\n * @sa ironbeepp\n * @sa ib_cfgparser_t\n * @nosubgrouping\n **\/\nclass ConfigurationParser :\n public ConstConfigurationParser\n{\npublic:\n \/\/! C Type.\n typedef ib_cfgparser_t* ib_type;\n\n \/**\n * Remove the constness of a ConstConfigurationParser.\n *\n * @warning This is as dangerous as a @c const_cast, use carefully.\n *\n * @param[in] configuration_parser ConstConfigurationParser to remove\n * const from.\n * @returns ConfigurationParser pointing to same underlying\n * configuration_parser as @a configuration_parser.\n **\/\n static ConfigurationParser remove_const(\n ConstConfigurationParser configuration_parser\n );\n\n \/**\n * Construct singular ConfigurationParser.\n *\n * All behavior of a singular ConfigurationParser is undefined except for\n * assignment, copying, comparison, and evaluate-as-bool.\n **\/\n ConfigurationParser();\n\n \/**\n * @name C Interoperability\n * Methods to access underlying C types.\n **\/\n \/\/\/@{\n\n \/\/! ib_cfgparser_t accessor.\n ib_type ib() const\n {\n return m_ib;\n }\n\n \/\/! Construct ConfigurationParser from ib_cfgparser_t.\n explicit\n ConfigurationParser(ib_type ib_configuration_parser);\n\n \/\/\/@}\n\nprivate:\n ib_type m_ib;\n};\n\n\/**\n * Output operator for ConfigurationParser.\n *\n * Outputs ConfigurationParser[@e value] where value is the current location\n * and current block name separated by :.\n *\n * @param[in] o Ostream to output to.\n * @param[in] configuration_parser ConfigurationParser to output.\n * @return @a o\n **\/\nstd::ostream& operator<<(\n std::ostream& o,\n const ConstConfigurationParser& configuration_parser\n);\n\n\/**\n * Helper class for Engine::register_configuration_directives().\n *\n * This class is returned by Engine::register_configuration_directives() and\n * provides methods to easily register multiple configuration directives.\n *\n * Example:\n * @code\n * engine.register_configuration_directives()\n * .param1(\"FirstConfig\", some_functional())\n * .param2(\"SecondConfig\", &some_function)\n * ;\n * @endcode\n **\/\nclass ConfigurationDirectivesRegistrar\n{\npublic:\n \/\/! Constructor. Use Engine::register_configuration_directives() instead.\n explicit\n ConfigurationDirectivesRegistrar(Engine engine);\n\n \/**\n * Start block handler.\n *\n * Takes configuration parser, directive name, and block parameter.\n **\/\n typedef boost::function<void(\n ConfigurationParser,\n const char*,\n const char*\n )> start_block_t;\n\n \/**\n * End block handler.\n *\n * Takes configuration parser and directive name.\n **\/\n typedef boost::function<void(\n ConfigurationParser,\n const char*\n )> end_block_t;\n\n \/**\n * Register block directive.\n *\n * @param[in] name Name of directive.\n * @param[in] start_function Function to call at start of block.\n * @param[in] end_function Function to call at end of block.\n * @returns *this\n **\/\n ConfigurationDirectivesRegistrar& block(\n const char* name,\n start_block_t start_function,\n end_block_t end_function\n );\n\n \/**\n * On-off handler.\n *\n * Takes configuration parser, directive name, and whether on or off.\n **\/\n typedef boost::function<void(\n ConfigurationParser,\n const char*,\n bool\n )> on_off_t;\n\n \/**\n * Register on-off directive.\n *\n * @param[in] name Name of directive.\n * @param[in] function Function to call when directive given.\n * @returns *this\n **\/\n ConfigurationDirectivesRegistrar& on_off(\n const char* name,\n on_off_t function\n );\n\n \/**\n * Single parameter handler.\n *\n * Takes configuration parser, directive name, and parameter.\n **\/\n typedef boost::function<void(\n ConfigurationParser,\n const char*,\n const char*\n )> param1_t;\n\n \/**\n * Register single parameter directive.\n *\n * @param[in] name Name of directive.\n * @param[in] function Function to call when directive given.\n * @returns *this\n **\/\n ConfigurationDirectivesRegistrar& param1(\n const char* name,\n param1_t function\n );\n\n \/**\n * Two parameter handler.\n *\n * Takes configuration parser, directive name, and two parameters.\n **\/\n typedef boost::function<void(\n ConfigurationParser,\n const char*,\n const char*,\n const char*\n )> param2_t;\n\n \/**\n * Register two parameter directive.\n *\n * @param[in] name Name of directive.\n * @param[in] function Function to call when directive given.\n * @returns *this\n **\/\n ConfigurationDirectivesRegistrar& param2(\n const char* name,\n param2_t function\n );\n\n \/**\n * Register many parameter directive.\n *\n * Takes configuration parameter, directive name, and list of parameters.\n **\/\n typedef boost::function<void(\n ConfigurationParser,\n const char*,\n List<const char*>\n )> list_t;\n\n \/**\n * Register many parameter directive.\n *\n * @param[in] name Name of directive.\n * @param[in] function Function to call when directive given.\n * @returns *this\n **\/\n ConfigurationDirectivesRegistrar& list(\n const char* name,\n list_t function\n );\n\n \/**\n * Opflag handler.\n *\n * Takes configuration parser, directive name, value of flags, and a mask\n * indicating which flags where set. I.e., if bit N in the mask is set,\n * then that flag was changed to bit N of the value.\n **\/\n typedef boost::function<void(\n ConfigurationParser,\n const char*,\n uint32_t,\n uint32_t\n )> op_flags_t;\n\n \/**\n * Register op flags parameter directive.\n *\n * Consider boost::assign for easy construction of @a value_map.\n *\n * @param[in] name Name of directive.\n * @param[in] function Function to call when directive given.\n * @param[in] value_map Map of flag name to bit index.\n * @returns *this\n **\/\n ConfigurationDirectivesRegistrar& op_flags(\n const char* name,\n op_flags_t function,\n std::map<std::string, int64_t> value_map\n );\n\nprivate:\n Engine m_engine;\n};\n\n} \/\/ IronBee\n\n#endif\n<commit_msg>IronBee++\/ConfigurationDirectives: Improve API doc for OpFlags.<commit_after>\n\/*****************************************************************************\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++ — ConfigurationParser\n *\n * This file defines (Const)ConfigurationParser, a wrapper for ib_cfgparser_t,\n * and ConfigurationDirectivesRegistrar, a helper class for attaching\n * directives to an Engine.\n *\n * @remark Developers should be familiar with @ref ironbeepp to understand\n * aspects of this code, e.g., the public\/non-virtual inheritance.\n *\n * @sa Engine::register_configuration_directives()\n *\n * @author Christopher Alfeld <calfeld@qualys.com>\n *\/\n\n#ifndef __IBPP__CONFIGURATION_DIRECTIVES__\n#define __IBPP__CONFIGURATION_DIRECTIVES__\n\n#include <ironbeepp\/common_semantics.hpp>\n#include <ironbeepp\/list.hpp>\n#include <ironbeepp\/engine.hpp>\n\n#include <ostream>\n\n#include <boost\/function.hpp>\n\n\/\/ IronBee C\ntypedef struct ib_cfgparser_t ib_cfgparser_t;\n\nnamespace IronBee {\n\nclass MemoryPool;\nclass Site;\nclass Location;\nclass Context;\n\n\/**\n * Const ConfigurationParser; equivalent to a const pointer to ib_cfgparser_t.\n *\n * Provides operators ==, !=, <, >, <=, >= and evaluation as a boolean for\n * singularity via CommonSemantics.\n *\n * See ConfigurationParser for discussion of configuration_parsers.\n *\n * @tparam T Value type for configuration_parser.\n *\n * @sa ConfigurationParser\n * @sa ironbeepp\n * @sa ib_cfgparser_t\n * @nosubgrouping\n **\/\nclass ConstConfigurationParser :\n public CommonSemantics<ConstConfigurationParser>\n{\npublic:\n \/\/! C Type.\n typedef const ib_cfgparser_t* ib_type;\n\n \/**\n * Construct singular ConstConfigurationParser.\n *\n * All behavior of a singular ConstConfigurationParser is undefined\n * except for assignment, copying, comparison, and evaluate-as-bool.\n **\/\n ConstConfigurationParser();\n\n \/**\n * @name C Interoperability\n * Methods to access underlying C types.\n **\/\n \/\/\/@{\n\n \/\/! const ib_cfgparser_t accessor.\n \/\/ Intentionally inlined.\n ib_type ib() const\n {\n return m_ib;\n }\n\n \/\/! Construct ConfigurationParser from ib_cfgparser_t.\n explicit\n ConstConfigurationParser(ib_type ib_configuration_parser);\n\n \/\/\/@}\n\n \/\/! Associated engine.\n Engine engine() const;\n\n \/\/! Associated memory pool.\n MemoryPool memory_pool() const;\n\n \/\/! Current configuration context.\n Context current_context() const;\n\n \/\/! Current configuration site.\n Site current_site() const;\n\n \/\/! Current configuration location.\n Location current_location() const;\n\n \/\/! Current configuration block name.\n const char* current_block_name() const;\n\nprivate:\n ib_type m_ib;\n};\n\n\/**\n * ConfigurationParser; equivalent to a pointer to ib_cfgparser_t.\n *\n * ConfigurationParser can be treated as ConstConfigurationParser. See @ref\n * ironbeepp for details on IronBee++ object semantics.\n *\n * At present, ConfigurationParser provides no additional functionality over\n * ConstConfigurationParser except providing a non-const @c ib_cfgparser_t*\n * via ib().\n *\n * @sa ConstConfigurationParser\n * @sa ironbeepp\n * @sa ib_cfgparser_t\n * @nosubgrouping\n **\/\nclass ConfigurationParser :\n public ConstConfigurationParser\n{\npublic:\n \/\/! C Type.\n typedef ib_cfgparser_t* ib_type;\n\n \/**\n * Remove the constness of a ConstConfigurationParser.\n *\n * @warning This is as dangerous as a @c const_cast, use carefully.\n *\n * @param[in] configuration_parser ConstConfigurationParser to remove\n * const from.\n * @returns ConfigurationParser pointing to same underlying\n * configuration_parser as @a configuration_parser.\n **\/\n static ConfigurationParser remove_const(\n ConstConfigurationParser configuration_parser\n );\n\n \/**\n * Construct singular ConfigurationParser.\n *\n * All behavior of a singular ConfigurationParser is undefined except for\n * assignment, copying, comparison, and evaluate-as-bool.\n **\/\n ConfigurationParser();\n\n \/**\n * @name C Interoperability\n * Methods to access underlying C types.\n **\/\n \/\/\/@{\n\n \/\/! ib_cfgparser_t accessor.\n ib_type ib() const\n {\n return m_ib;\n }\n\n \/\/! Construct ConfigurationParser from ib_cfgparser_t.\n explicit\n ConfigurationParser(ib_type ib_configuration_parser);\n\n \/\/\/@}\n\nprivate:\n ib_type m_ib;\n};\n\n\/**\n * Output operator for ConfigurationParser.\n *\n * Outputs ConfigurationParser[@e value] where value is the current location\n * and current block name separated by :.\n *\n * @param[in] o Ostream to output to.\n * @param[in] configuration_parser ConfigurationParser to output.\n * @return @a o\n **\/\nstd::ostream& operator<<(\n std::ostream& o,\n const ConstConfigurationParser& configuration_parser\n);\n\n\/**\n * Helper class for Engine::register_configuration_directives().\n *\n * This class is returned by Engine::register_configuration_directives() and\n * provides methods to easily register multiple configuration directives.\n *\n * Example:\n * @code\n * engine.register_configuration_directives()\n * .param1(\"FirstConfig\", some_functional())\n * .param2(\"SecondConfig\", &some_function)\n * ;\n * @endcode\n **\/\nclass ConfigurationDirectivesRegistrar\n{\npublic:\n \/\/! Constructor. Use Engine::register_configuration_directives() instead.\n explicit\n ConfigurationDirectivesRegistrar(Engine engine);\n\n \/**\n * Start block handler.\n *\n * Takes configuration parser, directive name, and block parameter.\n **\/\n typedef boost::function<void(\n ConfigurationParser,\n const char*,\n const char*\n )> start_block_t;\n\n \/**\n * End block handler.\n *\n * Takes configuration parser and directive name.\n **\/\n typedef boost::function<void(\n ConfigurationParser,\n const char*\n )> end_block_t;\n\n \/**\n * Register block directive.\n *\n * @param[in] name Name of directive.\n * @param[in] start_function Function to call at start of block.\n * @param[in] end_function Function to call at end of block.\n * @returns *this\n **\/\n ConfigurationDirectivesRegistrar& block(\n const char* name,\n start_block_t start_function,\n end_block_t end_function\n );\n\n \/**\n * On-off handler.\n *\n * Takes configuration parser, directive name, and whether on or off.\n **\/\n typedef boost::function<void(\n ConfigurationParser,\n const char*,\n bool\n )> on_off_t;\n\n \/**\n * Register on-off directive.\n *\n * @param[in] name Name of directive.\n * @param[in] function Function to call when directive given.\n * @returns *this\n **\/\n ConfigurationDirectivesRegistrar& on_off(\n const char* name,\n on_off_t function\n );\n\n \/**\n * Single parameter handler.\n *\n * Takes configuration parser, directive name, and parameter.\n **\/\n typedef boost::function<void(\n ConfigurationParser,\n const char*,\n const char*\n )> param1_t;\n\n \/**\n * Register single parameter directive.\n *\n * @param[in] name Name of directive.\n * @param[in] function Function to call when directive given.\n * @returns *this\n **\/\n ConfigurationDirectivesRegistrar& param1(\n const char* name,\n param1_t function\n );\n\n \/**\n * Two parameter handler.\n *\n * Takes configuration parser, directive name, and two parameters.\n **\/\n typedef boost::function<void(\n ConfigurationParser,\n const char*,\n const char*,\n const char*\n )> param2_t;\n\n \/**\n * Register two parameter directive.\n *\n * @param[in] name Name of directive.\n * @param[in] function Function to call when directive given.\n * @returns *this\n **\/\n ConfigurationDirectivesRegistrar& param2(\n const char* name,\n param2_t function\n );\n\n \/**\n * Register many parameter directive.\n *\n * Takes configuration parameter, directive name, and list of parameters.\n **\/\n typedef boost::function<void(\n ConfigurationParser,\n const char*,\n List<const char*>\n )> list_t;\n\n \/**\n * Register many parameter directive.\n *\n * @param[in] name Name of directive.\n * @param[in] function Function to call when directive given.\n * @returns *this\n **\/\n ConfigurationDirectivesRegistrar& list(\n const char* name,\n list_t function\n );\n\n \/**\n * Opflag handler.\n *\n * Takes configuration parser, directive name, value of flags, and a mask\n * indicating which flags where set. I.e., if bit N in the mask is set,\n * then that flag was changed to bit N of the value.\n **\/\n typedef boost::function<void(\n ConfigurationParser,\n const char*,\n uint32_t,\n uint32_t\n )> op_flags_t;\n\n \/**\n * Register op flags parameter directive.\n *\n * Consider boost::assign for easy construction of @a value_map.\n *\n * @param[in] name Name of directive.\n * @param[in] function Function to call when directive given.\n * @param[in] value_map Map of flag name to flag bits. If a flag name\n * is specified in the configuration, the bits in\n * its value are set to 1 in the mask and either\n * set to 1 or 0 in the value, depending on the\n * operation.\n * @returns *this\n **\/\n ConfigurationDirectivesRegistrar& op_flags(\n const char* name,\n op_flags_t function,\n std::map<std::string, int64_t> value_map\n );\n\nprivate:\n Engine m_engine;\n};\n\n} \/\/ IronBee\n\n#endif\n<|endoftext|>"} {"text":"<commit_before>\/*****************************************************************************\n *\n * This file is part of Mapnik (c++ mapping toolkit)\n *\n * Copyright (C) 2011 Artem Pavlenko\n *\n * This library is free software; you can redistribute it and\/or\n * modify it under the terms of the GNU Lesser General Public\n * License as published by the Free Software Foundation; either\n * version 2.1 of the License, or (at your option) any later version.\n *\n * This library is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU\n * Lesser General Public License for more details.\n *\n * You should have received a copy of the GNU Lesser General Public\n * License along with this library; if not, write to the Free Software\n * Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA\n *\n *****************************************************************************\/\n\n#ifndef MAPNIK_GEOMETRY_WKT_GENERATOR_HPP\n#define MAPNIK_GEOMETRY_WKT_GENERATOR_HPP\n\n\/\/ mapnik\n#include <mapnik\/global.hpp>\n#include <mapnik\/geometry.hpp>\n#include <mapnik\/vertex.hpp> \/\/ for CommandType::SEG_MOVETO\n\n\/\/ boost\n#include <boost\/tuple\/tuple.hpp>\n#include <boost\/spirit\/include\/karma.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\/include\/phoenix_function.hpp>\n#include <boost\/spirit\/include\/phoenix_statement.hpp>\n#include <boost\/fusion\/adapted\/std_tuple.hpp>\n#include <boost\/type_traits\/remove_pointer.hpp>\n#include <boost\/math\/special_functions\/trunc.hpp> \/\/ for vc++ and android whose c++11 libs lack std::trunct\n\nnamespace boost { namespace spirit { namespace traits {\n\n\/\/ make gcc and darwin toolsets happy.\ntemplate <>\nstruct is_container<mapnik::geometry_container>\n : mpl::false_\n{};\n\n}}}\n\nnamespace mapnik { namespace util {\n\nnamespace karma = boost::spirit::karma;\nnamespace phoenix = boost::phoenix;\n\nnamespace detail {\n\ntemplate <typename Geometry>\nstruct get_type\n{\n template <typename T>\n struct result { typedef int type; };\n\n int operator() (Geometry const& geom) const\n {\n return static_cast<int>(geom.type());\n }\n};\n\ntemplate <typename T>\nstruct get_first\n{\n typedef T geometry_type;\n\n template <typename U>\n struct result { typedef typename geometry_type::value_type const type; };\n\n typename geometry_type::value_type const operator() (geometry_type const& geom) const\n {\n typename geometry_type::value_type coord;\n geom.rewind(0);\n std::get<0>(coord) = geom.vertex(&std::get<1>(coord),&std::get<2>(coord));\n return coord;\n }\n};\n\ntemplate <typename T>\nstruct multi_geometry_\n{\n typedef T geometry_container;\n\n template <typename U>\n struct result { typedef bool type; };\n bool operator() (geometry_container const& geom) const\n {\n return geom.size() > 1 ? true : false;\n }\n};\n\ntemplate <typename T>\nstruct get_x\n{\n typedef T value_type;\n\n template <typename U>\n struct result { typedef double type; };\n\n double operator() (value_type const& val) const\n {\n return std::get<1>(val);\n }\n};\n\ntemplate <typename T>\nstruct get_y\n{\n typedef T value_type;\n\n template <typename U>\n struct result { typedef double type; };\n\n double operator() (value_type const& val) const\n {\n return std::get<2>(val);\n }\n};\n\ntemplate <typename T>\nstruct multi_geometry_type\n{\n typedef T geometry_container;\n\n template <typename U>\n struct result { typedef std::tuple<unsigned,bool> type; };\n\n std::tuple<unsigned,bool> operator() (geometry_container const& geom) const;\n};\n\n\ntemplate <typename T>\nstruct wkt_coordinate_policy : karma::real_policies<T>\n{\n typedef boost::spirit::karma::real_policies<T> base_type;\n static int floatfield(T n) { return base_type::fmtflags::fixed; }\n static unsigned precision(T n)\n {\n if (n == 0.0) return 0;\n using namespace boost::spirit;\n return static_cast<unsigned>(14 - boost::math::trunc(log10(traits::get_absolute_value(n))));\n }\n\n template <typename OutputIterator>\n static bool dot(OutputIterator& sink, T n, unsigned precision)\n {\n if (n == 0) return true;\n return base_type::dot(sink, n, precision);\n }\n\n template <typename OutputIterator>\n static bool fraction_part(OutputIterator& sink, T n\n , unsigned adjprec, unsigned precision)\n {\n if (n == 0) return true;\n return base_type::fraction_part(sink, n, adjprec, precision);\n }\n};\n\n}\n\ntemplate <typename OutputIterator, typename Geometry>\nstruct wkt_generator :\n karma::grammar<OutputIterator, Geometry const& ()>\n{\n typedef Geometry geometry_type;\n typedef typename boost::remove_pointer<typename geometry_type::value_type>::type coord_type;\n\n wkt_generator(bool single = false);\n \/\/ rules\n karma::rule<OutputIterator, geometry_type const& ()> wkt;\n karma::rule<OutputIterator, geometry_type const& ()> point;\n karma::rule<OutputIterator, geometry_type const& ()> linestring;\n karma::rule<OutputIterator, geometry_type const& ()> polygon;\n\n karma::rule<OutputIterator, geometry_type const& ()> coords;\n karma::rule<OutputIterator, karma::locals<unsigned,double,double>, geometry_type const& ()> coords2;\n karma::rule<OutputIterator, coord_type ()> point_coord;\n karma::rule<OutputIterator, karma::locals<double,double>, coord_type (unsigned&, double&, double& )> polygon_coord;\n\n \/\/ phoenix functions\n phoenix::function<detail::get_type<geometry_type> > _type;\n phoenix::function<detail::get_first<geometry_type> > _first;\n phoenix::function<detail::get_x<typename geometry_type::value_type> > _x;\n phoenix::function<detail::get_y<typename geometry_type::value_type> > _y;\n \/\/\n karma::real_generator<double, detail::wkt_coordinate_policy<double> > coordinate;\n};\n\n\ntemplate <typename OutputIterator, typename GeometryContainer>\nstruct wkt_multi_generator :\n karma::grammar<OutputIterator, karma::locals< std::tuple<unsigned,bool> >, GeometryContainer const& ()>\n{\n typedef GeometryContainer geometry_contaner;\n typedef boost::remove_pointer<typename geometry_container::value_type>::type geometry_type;\n\n wkt_multi_generator();\n \/\/ rules\n karma::rule<OutputIterator, karma::locals<std::tuple<unsigned,bool> >, GeometryContainer const& ()> wkt;\n karma::rule<OutputIterator, GeometryContainer const& ()> geometry;\n karma::rule<OutputIterator, geometry_type const& ()> single_geometry;\n karma::rule<OutputIterator, GeometryContainer const& ()> multi_geometry;\n wkt_generator<OutputIterator, geometry_type > path;\n \/\/ phoenix\n phoenix::function<detail::multi_geometry_<GeometryContainer> > is_multi;\n phoenix::function<detail::multi_geometry_type<GeometryContainer> > _multi_type;\n phoenix::function<detail::get_type<geometry_type> > _type;\n \/\/\n karma::symbols<unsigned, char const*> geometry_types;\n};\n\n}}\n\n\n#endif \/\/ MAPNIK_GEOMETRY_WKT_GENERATOR_HPP\n<commit_msg>fix wkt_multi_generator typedef - previously accidentally matched mapnik::geometry_container - bug spotted by @mojodna - refs #2098<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_GEOMETRY_WKT_GENERATOR_HPP\n#define MAPNIK_GEOMETRY_WKT_GENERATOR_HPP\n\n\/\/ mapnik\n#include <mapnik\/global.hpp>\n#include <mapnik\/geometry.hpp>\n#include <mapnik\/vertex.hpp> \/\/ for CommandType::SEG_MOVETO\n\n\/\/ boost\n#include <boost\/tuple\/tuple.hpp>\n#include <boost\/spirit\/include\/karma.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\/include\/phoenix_function.hpp>\n#include <boost\/spirit\/include\/phoenix_statement.hpp>\n#include <boost\/fusion\/adapted\/std_tuple.hpp>\n#include <boost\/type_traits\/remove_pointer.hpp>\n#include <boost\/math\/special_functions\/trunc.hpp> \/\/ for vc++ and android whose c++11 libs lack std::trunct\n\nnamespace boost { namespace spirit { namespace traits {\n\n\/\/ make gcc and darwin toolsets happy.\ntemplate <>\nstruct is_container<mapnik::geometry_container>\n : mpl::false_\n{};\n\n}}}\n\nnamespace mapnik { namespace util {\n\nnamespace karma = boost::spirit::karma;\nnamespace phoenix = boost::phoenix;\n\nnamespace detail {\n\ntemplate <typename Geometry>\nstruct get_type\n{\n template <typename T>\n struct result { typedef int type; };\n\n int operator() (Geometry const& geom) const\n {\n return static_cast<int>(geom.type());\n }\n};\n\ntemplate <typename T>\nstruct get_first\n{\n typedef T geometry_type;\n\n template <typename U>\n struct result { typedef typename geometry_type::value_type const type; };\n\n typename geometry_type::value_type const operator() (geometry_type const& geom) const\n {\n typename geometry_type::value_type coord;\n geom.rewind(0);\n std::get<0>(coord) = geom.vertex(&std::get<1>(coord),&std::get<2>(coord));\n return coord;\n }\n};\n\ntemplate <typename T>\nstruct multi_geometry_\n{\n typedef T geometry_container;\n\n template <typename U>\n struct result { typedef bool type; };\n bool operator() (geometry_container const& geom) const\n {\n return geom.size() > 1 ? true : false;\n }\n};\n\ntemplate <typename T>\nstruct get_x\n{\n typedef T value_type;\n\n template <typename U>\n struct result { typedef double type; };\n\n double operator() (value_type const& val) const\n {\n return std::get<1>(val);\n }\n};\n\ntemplate <typename T>\nstruct get_y\n{\n typedef T value_type;\n\n template <typename U>\n struct result { typedef double type; };\n\n double operator() (value_type const& val) const\n {\n return std::get<2>(val);\n }\n};\n\ntemplate <typename T>\nstruct multi_geometry_type\n{\n typedef T geometry_container;\n\n template <typename U>\n struct result { typedef std::tuple<unsigned,bool> type; };\n\n std::tuple<unsigned,bool> operator() (geometry_container const& geom) const;\n};\n\n\ntemplate <typename T>\nstruct wkt_coordinate_policy : karma::real_policies<T>\n{\n typedef boost::spirit::karma::real_policies<T> base_type;\n static int floatfield(T n) { return base_type::fmtflags::fixed; }\n static unsigned precision(T n)\n {\n if (n == 0.0) return 0;\n using namespace boost::spirit;\n return static_cast<unsigned>(14 - boost::math::trunc(log10(traits::get_absolute_value(n))));\n }\n\n template <typename OutputIterator>\n static bool dot(OutputIterator& sink, T n, unsigned precision)\n {\n if (n == 0) return true;\n return base_type::dot(sink, n, precision);\n }\n\n template <typename OutputIterator>\n static bool fraction_part(OutputIterator& sink, T n\n , unsigned adjprec, unsigned precision)\n {\n if (n == 0) return true;\n return base_type::fraction_part(sink, n, adjprec, precision);\n }\n};\n\n}\n\ntemplate <typename OutputIterator, typename Geometry>\nstruct wkt_generator :\n karma::grammar<OutputIterator, Geometry const& ()>\n{\n typedef Geometry geometry_type;\n typedef typename boost::remove_pointer<typename geometry_type::value_type>::type coord_type;\n\n wkt_generator(bool single = false);\n \/\/ rules\n karma::rule<OutputIterator, geometry_type const& ()> wkt;\n karma::rule<OutputIterator, geometry_type const& ()> point;\n karma::rule<OutputIterator, geometry_type const& ()> linestring;\n karma::rule<OutputIterator, geometry_type const& ()> polygon;\n\n karma::rule<OutputIterator, geometry_type const& ()> coords;\n karma::rule<OutputIterator, karma::locals<unsigned,double,double>, geometry_type const& ()> coords2;\n karma::rule<OutputIterator, coord_type ()> point_coord;\n karma::rule<OutputIterator, karma::locals<double,double>, coord_type (unsigned&, double&, double& )> polygon_coord;\n\n \/\/ phoenix functions\n phoenix::function<detail::get_type<geometry_type> > _type;\n phoenix::function<detail::get_first<geometry_type> > _first;\n phoenix::function<detail::get_x<typename geometry_type::value_type> > _x;\n phoenix::function<detail::get_y<typename geometry_type::value_type> > _y;\n \/\/\n karma::real_generator<double, detail::wkt_coordinate_policy<double> > coordinate;\n};\n\n\ntemplate <typename OutputIterator, typename GeometryContainer>\nstruct wkt_multi_generator :\n karma::grammar<OutputIterator, karma::locals< std::tuple<unsigned,bool> >, GeometryContainer const& ()>\n{\n typedef typename boost::remove_pointer<typename GeometryContainer::value_type>::type geometry_type;\n\n wkt_multi_generator();\n \/\/ rules\n karma::rule<OutputIterator, karma::locals<std::tuple<unsigned,bool> >, GeometryContainer const& ()> wkt;\n karma::rule<OutputIterator, GeometryContainer const& ()> geometry;\n karma::rule<OutputIterator, geometry_type const& ()> single_geometry;\n karma::rule<OutputIterator, GeometryContainer const& ()> multi_geometry;\n wkt_generator<OutputIterator, geometry_type > path;\n \/\/ phoenix\n phoenix::function<detail::multi_geometry_<GeometryContainer> > is_multi;\n phoenix::function<detail::multi_geometry_type<GeometryContainer> > _multi_type;\n phoenix::function<detail::get_type<geometry_type> > _type;\n \/\/\n karma::symbols<unsigned, char const*> geometry_types;\n};\n\n}}\n\n\n#endif \/\/ MAPNIK_GEOMETRY_WKT_GENERATOR_HPP\n<|endoftext|>"} {"text":"<commit_before>\/\/============================================================================\n\/\/ include\/vsmc\/rng\/uniform_real_distribution.hpp\n\/\/----------------------------------------------------------------------------\n\/\/\n\/\/ vSMC: Scalable Monte Carlo\n\/\/\n\/\/ This file is distribured under the 2-clauses BSD License.\n\/\/ See LICENSE for details.\n\/\/============================================================================\n\n#ifndef VSMC_UNIFORM_REAL_DISTRIBUTION_HPP\n#define VSMC_UNIFORM_REAL_DISTRIBUTION_HPP\n\n#include <vsmc\/rng\/internal\/common.hpp>\n#include <vsmc\/rng\/u01.h>\n\n#define VSMC_RUNTIME_ASSERT_RNG_UNIFORM_REAL_DISTRIBUITON_PARAM_CHECK(a, b) \\\n VSMC_RUNTIME_ASSERT((a <= b), \\\n (\"**UniformRealDistribution** CONSTRUCTED WITH INVALID \" \\\n \"MINIMUM AND MAXIMUM PARAMTER VALUES\"))\n\n#define VSMC_RUNTIME_ASSERT_RNG_UNIFORM_REAL_DISTRIBUTION_ENG_MIN(eng_min) \\\n VSMC_RUNTIME_ASSERT((eng_min == 0), \\\n (\"**UniformRealDistribution::operator()** \" \\\n \"ENGINE MEMBER FUNCTION min() RETURN A VALUE OTHER THAN ZERO\"))\n\n#define VSMC_RUNTIME_ASSERT_RNG_UNIFORM_REAL_DISTRIBUTION_ENG_MAX(eng_max) \\\n VSMC_RUNTIME_ASSERT((eng_max == uint32_t_max_ || eng_max == uint64_t_max_),\\\n (\"**UniformRealDistribution::operator()** \" \\\n \"ENGINE MEMBER FUNCTION max() RETURN A VALUE OTHER THAN \" \\\n \"THE MAXIMUM OF uint32_t OR uint64_t\"))\n\nnamespace vsmc {\n\nnamespace internal {\n\ntemplate<uint64_t, uint64_t> struct UniformRealDistributionFullRangeIntgerType;\n\ntemplate<>\nstruct UniformRealDistributionFullRangeIntgerType<0,\n static_cast<uint64_t>(static_cast<uint32_t>(~(static_cast<uint32_t>(0))))>\n{typedef uint32_t type;};\n\ntemplate<>\nstruct UniformRealDistributionFullRangeIntgerType<0,\n static_cast<uint64_t>(~(static_cast<uint64_t>(0)))>\n{typedef uint64_t type;};\n\n} \/\/ namespace vsmc::interal\n\n\/\/\/ \\brief Parameter type for open interval\n\/\/\/ \\ingroup RNG\nstruct Open {};\n\n\/\/\/ \\brief Parameter type for closed interval\n\/\/\/ \\ingroup RNG\nstruct Closed {};\n\n\/\/\/ \\brief Uniform real distribution with variants open\/closed variants\n\/\/\/ \\ingroup RNG\n\/\/\/\n\/\/\/ \\details\n\/\/\/ This distribution is almost identical to C++11\n\/\/\/ `std::uniform_real_distribution`. But it differs in two important aspects\n\/\/\/ - It allows the interval to be either open or closed on both sides.\n\/\/\/ - It requires that the uniform random number generator to produce integers\n\/\/\/ on the full range of either `uint32_t` or `uint64_t`.\ntemplate <typename FPType, typename Left, typename Right>\nclass UniformRealDistribution\n{\n private :\n\n typedef cxx11::integral_constant<std::size_t, sizeof(float)> f24;\n typedef cxx11::integral_constant<std::size_t, sizeof(double)> f53;\n typedef cxx11::integral_constant<std::size_t, sizeof(uint32_t)> u32;\n typedef cxx11::integral_constant<std::size_t, sizeof(uint64_t)> u64;\n\n public :\n\n typedef FPType result_type;\n\n class param_type\n {\n public :\n\n typedef FPType result_type;\n\n typedef UniformRealDistribution<FPType, Left, Right> distribution_type;\n\n explicit param_type (result_type a = 0, result_type b = 1) :\n a_(a), b_(b) {}\n\n result_type a () const {return a_;}\n result_type b () const {return b_;}\n\n friend inline bool operator== (\n const param_type ¶m1, const param_type ¶m2)\n {\n if (param1.a_ < param2.a_ || param1.a_ > param2.a_)\n return false;\n if (param1.b_ < param2.b_ || param1.b_ > param2.b_)\n return false;\n return true;\n }\n\n friend inline bool operator!= (\n const param_type param1, const param_type param2)\n {return !(param1 == param2);}\n\n template <typename CharT, typename Traits>\n friend inline std::basic_ostream<CharT, Traits> &operator<< (\n std::basic_ostream<CharT, Traits> &os, const param_type ¶m)\n {\n if (!os.good())\n return os;\n\n os << param.a_ << ' ' << param.b_;\n\n return os;\n }\n\n template <typename CharT, typename Traits>\n friend inline std::basic_istream<CharT, Traits> &operator>> (\n std::basic_istream<CharT, Traits> &is, param_type ¶m)\n {\n if (!is.good())\n return is;\n\n result_type a = 1;\n result_type b = 0;\n is >> std::ws >> a;\n is >> std::ws >> b;\n\n if (is.good()) {\n if (a <= b) {\n param.a_ = a;\n param.b_ = b;\n } else {\n is.setstate(std::ios_base::failbit);\n }\n }\n\n return is;\n }\n\n private :\n\n result_type a_;\n result_type b_;\n }; \/\/ class param_type\n\n explicit UniformRealDistribution (result_type a = 0, result_type b = 1) :\n a_(a), b_(b)\n {VSMC_RUNTIME_ASSERT_RNG_UNIFORM_REAL_DISTRIBUITON_PARAM_CHECK(a_, b_);}\n\n UniformRealDistribution (const param_type ¶m) :\n a_(param.a()), b_(param.b())\n {VSMC_RUNTIME_ASSERT_RNG_UNIFORM_REAL_DISTRIBUITON_PARAM_CHECK(a_, b_);}\n\n param_type param () const {return param_type(a_, b_);}\n\n void param (const param_type ¶m)\n {\n a_ = param.a();\n b_ = param.b();\n }\n\n void reset () const {}\n\n result_type a () const {return a_;}\n result_type b () const {return b_;}\n result_type min VSMC_MNE () const {return a_;}\n result_type max VSMC_MNE () const {return b_;}\n\n \/\/\/ \\brief Generate uniform random variates\n \/\/\/\n \/\/\/ \\tparam Eng Requirement:\n \/\/\/ ~~~{.cpp}\n \/\/\/ Eng::min() == 0 && (\n \/\/\/ Eng::max() == std::numeric_limits<uint32_t>::max() ||\n \/\/\/ Eng::max() == std::numeric_limits<uint64_t>::max()\n \/\/\/ )\n \/\/\/ ~~~\n template <typename Eng>\n result_type operator() (Eng &eng)\n {\n#if VSMC_HAS_CXX11LIB_RANDOM_CONSTEXPR_MINMAX\n\toperator()(eng, cxx11::true_type());\n#else\n\toperator()(eng, cxx11::false_type());\n#endif\n }\n\n \/\/\/ \\brief static dispatch based on `Eng::min()` and `Eng::max()`, both\n \/\/\/ need to be constant expression\n template <typename Eng>\n result_type operator() (Eng &eng, cxx11::true_type) const\n {\n typedef cxx11::integral_constant<std::size_t, sizeof(result_type)>\n fbits;\n typedef typename internal::UniformRealDistributionFullRangeIntgerType<\n Eng::min VSMC_MNE (), Eng::max VSMC_MNE ()>::type eng_uint_t;\n typedef cxx11::integral_constant<std::size_t, sizeof(eng_uint_t)>\n ubits;\n\n result_type u = u01(static_cast<eng_uint_t>(eng()), Left(), Right(),\n ubits(), fbits());\n\n return u * (b_ - a_) + a_;\n }\n\n \/\/\/ \\brief Dynamic dispatch based on `eng.min()` and `eng.max()`\n template <typename Eng>\n result_type operator() (Eng &eng, cxx11::false_type) const\n {\n typedef cxx11::integral_constant<std::size_t, sizeof(result_type)>\n fbits;\n\n static const uint64_t eng_max = static_cast<uint64_t>(\n eng.max VSMC_MNE ());\n\n VSMC_RUNTIME_ASSERT_RNG_UNIFORM_REAL_DISTRIBUTION_ENG_MIN(\n (eng.min VSMC_MNE ()));\n VSMC_RUNTIME_ASSERT_RNG_UNIFORM_REAL_DISTRIBUTION_ENG_MAX(eng_max);\n\n result_type u = 0;\n switch (eng_max) {\n case uint32_t_max_ :\n u = u01(static_cast<uint32_t>(eng()), Left(), Right(),\n u32(), fbits());\n break;\n case uint64_t_max_ :\n u = u01(static_cast<uint64_t>(eng()), Left(), Right(),\n u64(), fbits());\n break;\n default :\n return 0;\n }\n\n return u * (b_ - a_) + a_;\n }\n\n friend inline bool operator== (\n const UniformRealDistribution<FPType, Left, Right> &runif1,\n const UniformRealDistribution<FPType, Left, Right> &runif2)\n {\n if (runif1.a_ < runif2.a_ ||runif1.a_ > runif1.a_)\n return false;\n if (runif1.b_ < runif2.b_ ||runif1.b_ > runif1.b_)\n return false;\n return true;\n }\n\n friend inline bool operator!= (\n const UniformRealDistribution<FPType, Left, Right> &runif1,\n const UniformRealDistribution<FPType, Left, Right> &runif2)\n {return !(runif1 == runif2);}\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 UniformRealDistribution<FPType, Left, Right> &runif)\n {\n if (!os.good())\n return os;\n\n os << runif.a_ << ' ' << runif.b_;\n\n return os;\n }\n\n template <typename CharT, typename Traits>\n friend inline std::basic_istream<CharT, Traits> &operator>> (\n std::basic_istream<CharT, Traits> &is,\n UniformRealDistribution<FPType, Left, Right> &runif)\n {\n if (!is.good())\n return is;\n\n result_type a = 1;\n result_type b = 0;\n is >> std::ws >> a;\n is >> std::ws >> b;\n if (is.good()) {\n if (a <= b) {\n runif.a_ = a;\n runif.b_ = b;\n } else {\n is.setstate(std::ios_base::failbit);\n }\n }\n\n return is;\n }\n\n private :\n\n result_type a_;\n result_type b_;\n\n#if !VSMC_HAS_CXX11LIB_RANDOM_CONSTEXPR_MINMAX\n static VSMC_CONSTEXPR const uint64_t uint32_t_max_ = static_cast<uint64_t>(\n static_cast<uint32_t>(~(static_cast<uint32_t>(0))));\n static VSMC_CONSTEXPR const uint64_t uint64_t_max_ = static_cast<uint64_t>(\n ~(static_cast<uint64_t>(0)));\n#endif\n\n static float u01(uint32_t i, Open, Open, u32, f24)\n {return ::u01_open_open_32_24(i);}\n\n static float u01(uint32_t i, Open, Closed, u32, f24)\n {return ::u01_open_closed_32_24(i);}\n\n static float u01(uint32_t i, Closed, Open, u32, f24)\n {return ::u01_closed_open_32_24(i);}\n\n static float u01(uint32_t i, Closed, Closed, u32, f24)\n {return ::u01_closed_closed_32_24(i);}\n\n static double u01(uint32_t i, Open, Open, u32, f53)\n {return ::u01_open_open_32_53(i);}\n\n static double u01(uint32_t i, Open, Closed, u32, f53)\n {return ::u01_open_closed_32_53(i);}\n\n static double u01(uint32_t i, Closed, Open, u32, f53)\n {return ::u01_closed_open_32_53(i);}\n\n static double u01(uint32_t i, Closed, Closed, u32, f53)\n {return ::u01_closed_closed_32_53(i);}\n\n static float u01(uint64_t i, Open, Open, u64, f24)\n {return static_cast<float>(::u01_open_open_64_53(i));}\n\n static float u01(uint64_t i, Open, Closed, u64, f24)\n {return static_cast<float>(::u01_open_closed_64_53(i));}\n\n static float u01(uint64_t i, Closed, Open, u64, f24)\n {return static_cast<float>(::u01_closed_open_64_53(i));}\n\n static float u01(uint64_t i, Closed, Closed, u64, f24)\n {return static_cast<float>(::u01_closed_closed_64_53(i));}\n\n static double u01(uint64_t i, Open, Open, u64, f53)\n {return ::u01_open_open_64_53(i);}\n\n static double u01(uint64_t i, Open, Closed, u64, f53)\n {return ::u01_open_closed_64_53(i);}\n\n static double u01(uint64_t i, Closed, Open, u64, f53)\n {return ::u01_closed_open_64_53(i);}\n\n static double u01(uint64_t i, Closed, Closed, u64, f53)\n {return ::u01_closed_closed_64_53(i);}\n}; \/\/ class UniformRealDistributionBase\n\n} \/\/ namespace vsmc\n\n#endif \/\/ VSMC_UNIFORM_REAL_DISTRIBUTION_HPP\n<commit_msg>fix for dynamic dispatch<commit_after>\/\/============================================================================\n\/\/ include\/vsmc\/rng\/uniform_real_distribution.hpp\n\/\/----------------------------------------------------------------------------\n\/\/\n\/\/ vSMC: Scalable Monte Carlo\n\/\/\n\/\/ This file is distribured under the 2-clauses BSD License.\n\/\/ See LICENSE for details.\n\/\/============================================================================\n\n#ifndef VSMC_UNIFORM_REAL_DISTRIBUTION_HPP\n#define VSMC_UNIFORM_REAL_DISTRIBUTION_HPP\n\n#include <vsmc\/rng\/internal\/common.hpp>\n#include <vsmc\/rng\/u01.h>\n\n#define VSMC_RUNTIME_ASSERT_RNG_UNIFORM_REAL_DISTRIBUITON_PARAM_CHECK(a, b) \\\n VSMC_RUNTIME_ASSERT((a <= b), \\\n (\"**UniformRealDistribution** CONSTRUCTED WITH INVALID \" \\\n \"MINIMUM AND MAXIMUM PARAMTER VALUES\"))\n\n#define VSMC_RUNTIME_ASSERT_RNG_UNIFORM_REAL_DISTRIBUTION_ENG_MIN(eng_min) \\\n VSMC_RUNTIME_ASSERT((eng_min == 0), \\\n (\"**UniformRealDistribution::operator()** \" \\\n \"ENGINE MEMBER FUNCTION min() RETURN A VALUE OTHER THAN ZERO\"))\n\n#define VSMC_RUNTIME_ASSERT_RNG_UNIFORM_REAL_DISTRIBUTION_ENG_MAX(eng_max) \\\n VSMC_RUNTIME_ASSERT((eng_max == uint32_t_max_ || eng_max == uint64_t_max_),\\\n (\"**UniformRealDistribution::operator()** \" \\\n \"ENGINE MEMBER FUNCTION max() RETURN A VALUE OTHER THAN \" \\\n \"THE MAXIMUM OF uint32_t OR uint64_t\"))\n\nnamespace vsmc {\n\nnamespace internal {\n\ntemplate<uint64_t, uint64_t> struct UniformRealDistributionFullRangeIntgerType;\n\ntemplate<>\nstruct UniformRealDistributionFullRangeIntgerType<0,\n static_cast<uint64_t>(static_cast<uint32_t>(~(static_cast<uint32_t>(0))))>\n{typedef uint32_t type;};\n\ntemplate<>\nstruct UniformRealDistributionFullRangeIntgerType<0,\n static_cast<uint64_t>(~(static_cast<uint64_t>(0)))>\n{typedef uint64_t type;};\n\n} \/\/ namespace vsmc::interal\n\n\/\/\/ \\brief Parameter type for open interval\n\/\/\/ \\ingroup RNG\nstruct Open {};\n\n\/\/\/ \\brief Parameter type for closed interval\n\/\/\/ \\ingroup RNG\nstruct Closed {};\n\n\/\/\/ \\brief Uniform real distribution with variants open\/closed variants\n\/\/\/ \\ingroup RNG\n\/\/\/\n\/\/\/ \\details\n\/\/\/ This distribution is almost identical to C++11\n\/\/\/ `std::uniform_real_distribution`. But it differs in two important aspects\n\/\/\/ - It allows the interval to be either open or closed on both sides.\n\/\/\/ - It requires that the uniform random number generator to produce integers\n\/\/\/ on the full range of either `uint32_t` or `uint64_t`.\ntemplate <typename FPType, typename Left, typename Right>\nclass UniformRealDistribution\n{\n private :\n\n typedef cxx11::integral_constant<std::size_t, sizeof(float)> f24;\n typedef cxx11::integral_constant<std::size_t, sizeof(double)> f53;\n typedef cxx11::integral_constant<std::size_t, sizeof(uint32_t)> u32;\n typedef cxx11::integral_constant<std::size_t, sizeof(uint64_t)> u64;\n\n public :\n\n typedef FPType result_type;\n\n class param_type\n {\n public :\n\n typedef FPType result_type;\n\n typedef UniformRealDistribution<FPType, Left, Right> distribution_type;\n\n explicit param_type (result_type a = 0, result_type b = 1) :\n a_(a), b_(b) {}\n\n result_type a () const {return a_;}\n result_type b () const {return b_;}\n\n friend inline bool operator== (\n const param_type ¶m1, const param_type ¶m2)\n {\n if (param1.a_ < param2.a_ || param1.a_ > param2.a_)\n return false;\n if (param1.b_ < param2.b_ || param1.b_ > param2.b_)\n return false;\n return true;\n }\n\n friend inline bool operator!= (\n const param_type param1, const param_type param2)\n {return !(param1 == param2);}\n\n template <typename CharT, typename Traits>\n friend inline std::basic_ostream<CharT, Traits> &operator<< (\n std::basic_ostream<CharT, Traits> &os, const param_type ¶m)\n {\n if (!os.good())\n return os;\n\n os << param.a_ << ' ' << param.b_;\n\n return os;\n }\n\n template <typename CharT, typename Traits>\n friend inline std::basic_istream<CharT, Traits> &operator>> (\n std::basic_istream<CharT, Traits> &is, param_type ¶m)\n {\n if (!is.good())\n return is;\n\n result_type a = 1;\n result_type b = 0;\n is >> std::ws >> a;\n is >> std::ws >> b;\n\n if (is.good()) {\n if (a <= b) {\n param.a_ = a;\n param.b_ = b;\n } else {\n is.setstate(std::ios_base::failbit);\n }\n }\n\n return is;\n }\n\n private :\n\n result_type a_;\n result_type b_;\n }; \/\/ class param_type\n\n explicit UniformRealDistribution (result_type a = 0, result_type b = 1) :\n a_(a), b_(b)\n {VSMC_RUNTIME_ASSERT_RNG_UNIFORM_REAL_DISTRIBUITON_PARAM_CHECK(a_, b_);}\n\n UniformRealDistribution (const param_type ¶m) :\n a_(param.a()), b_(param.b())\n {VSMC_RUNTIME_ASSERT_RNG_UNIFORM_REAL_DISTRIBUITON_PARAM_CHECK(a_, b_);}\n\n param_type param () const {return param_type(a_, b_);}\n\n void param (const param_type ¶m)\n {\n a_ = param.a();\n b_ = param.b();\n }\n\n void reset () const {}\n\n result_type a () const {return a_;}\n result_type b () const {return b_;}\n result_type min VSMC_MNE () const {return a_;}\n result_type max VSMC_MNE () const {return b_;}\n\n \/\/\/ \\brief Generate uniform random variates\n \/\/\/\n \/\/\/ \\tparam Eng Requirement:\n \/\/\/ ~~~{.cpp}\n \/\/\/ Eng::min() == 0 && (\n \/\/\/ Eng::max() == std::numeric_limits<uint32_t>::max() ||\n \/\/\/ Eng::max() == std::numeric_limits<uint64_t>::max()\n \/\/\/ )\n \/\/\/ ~~~\n template <typename Eng>\n result_type operator() (Eng &eng)\n {\n#if VSMC_HAS_CXX11LIB_RANDOM_CONSTEXPR_MINMAX\n\toperator()(eng, cxx11::true_type());\n#else\n\toperator()(eng, cxx11::false_type());\n#endif\n }\n\n \/\/\/ \\brief static dispatch based on `Eng::min()` and `Eng::max()`, both\n \/\/\/ need to be constant expression\n template <typename Eng>\n result_type operator() (Eng &eng, cxx11::true_type) const\n {\n typedef cxx11::integral_constant<std::size_t, sizeof(result_type)>\n fbits;\n typedef typename internal::UniformRealDistributionFullRangeIntgerType<\n Eng::min VSMC_MNE (), Eng::max VSMC_MNE ()>::type eng_uint_t;\n typedef cxx11::integral_constant<std::size_t, sizeof(eng_uint_t)>\n ubits;\n\n result_type u = u01(static_cast<eng_uint_t>(eng()), Left(), Right(),\n ubits(), fbits());\n\n return u * (b_ - a_) + a_;\n }\n\n \/\/\/ \\brief Dynamic dispatch based on `eng.min()` and `eng.max()`\n template <typename Eng>\n result_type operator() (Eng &eng, cxx11::false_type) const\n {\n typedef cxx11::integral_constant<std::size_t, sizeof(result_type)>\n fbits;\n\n static const uint64_t eng_max = static_cast<uint64_t>(\n eng.max VSMC_MNE ());\n\n VSMC_RUNTIME_ASSERT_RNG_UNIFORM_REAL_DISTRIBUTION_ENG_MIN(\n (eng.min VSMC_MNE ()));\n VSMC_RUNTIME_ASSERT_RNG_UNIFORM_REAL_DISTRIBUTION_ENG_MAX(eng_max);\n\n result_type u = 0;\n switch (eng_max) {\n case uint32_t_max_ :\n u = u01(static_cast<uint32_t>(eng()), Left(), Right(),\n u32(), fbits());\n break;\n case uint64_t_max_ :\n u = u01(static_cast<uint64_t>(eng()), Left(), Right(),\n u64(), fbits());\n break;\n default :\n return 0;\n }\n\n return u * (b_ - a_) + a_;\n }\n\n friend inline bool operator== (\n const UniformRealDistribution<FPType, Left, Right> &runif1,\n const UniformRealDistribution<FPType, Left, Right> &runif2)\n {\n if (runif1.a_ < runif2.a_ ||runif1.a_ > runif1.a_)\n return false;\n if (runif1.b_ < runif2.b_ ||runif1.b_ > runif1.b_)\n return false;\n return true;\n }\n\n friend inline bool operator!= (\n const UniformRealDistribution<FPType, Left, Right> &runif1,\n const UniformRealDistribution<FPType, Left, Right> &runif2)\n {return !(runif1 == runif2);}\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 UniformRealDistribution<FPType, Left, Right> &runif)\n {\n if (!os.good())\n return os;\n\n os << runif.a_ << ' ' << runif.b_;\n\n return os;\n }\n\n template <typename CharT, typename Traits>\n friend inline std::basic_istream<CharT, Traits> &operator>> (\n std::basic_istream<CharT, Traits> &is,\n UniformRealDistribution<FPType, Left, Right> &runif)\n {\n if (!is.good())\n return is;\n\n result_type a = 1;\n result_type b = 0;\n is >> std::ws >> a;\n is >> std::ws >> b;\n if (is.good()) {\n if (a <= b) {\n runif.a_ = a;\n runif.b_ = b;\n } else {\n is.setstate(std::ios_base::failbit);\n }\n }\n\n return is;\n }\n\n private :\n\n result_type a_;\n result_type b_;\n\n static VSMC_CONSTEXPR const uint64_t uint32_t_max_ = static_cast<uint64_t>(\n static_cast<uint32_t>(~(static_cast<uint32_t>(0))));\n\n static VSMC_CONSTEXPR const uint64_t uint64_t_max_ = static_cast<uint64_t>(\n ~(static_cast<uint64_t>(0)));\n\n static float u01(uint32_t i, Open, Open, u32, f24)\n {return ::u01_open_open_32_24(i);}\n\n static float u01(uint32_t i, Open, Closed, u32, f24)\n {return ::u01_open_closed_32_24(i);}\n\n static float u01(uint32_t i, Closed, Open, u32, f24)\n {return ::u01_closed_open_32_24(i);}\n\n static float u01(uint32_t i, Closed, Closed, u32, f24)\n {return ::u01_closed_closed_32_24(i);}\n\n static double u01(uint32_t i, Open, Open, u32, f53)\n {return ::u01_open_open_32_53(i);}\n\n static double u01(uint32_t i, Open, Closed, u32, f53)\n {return ::u01_open_closed_32_53(i);}\n\n static double u01(uint32_t i, Closed, Open, u32, f53)\n {return ::u01_closed_open_32_53(i);}\n\n static double u01(uint32_t i, Closed, Closed, u32, f53)\n {return ::u01_closed_closed_32_53(i);}\n\n static float u01(uint64_t i, Open, Open, u64, f24)\n {return static_cast<float>(::u01_open_open_64_53(i));}\n\n static float u01(uint64_t i, Open, Closed, u64, f24)\n {return static_cast<float>(::u01_open_closed_64_53(i));}\n\n static float u01(uint64_t i, Closed, Open, u64, f24)\n {return static_cast<float>(::u01_closed_open_64_53(i));}\n\n static float u01(uint64_t i, Closed, Closed, u64, f24)\n {return static_cast<float>(::u01_closed_closed_64_53(i));}\n\n static double u01(uint64_t i, Open, Open, u64, f53)\n {return ::u01_open_open_64_53(i);}\n\n static double u01(uint64_t i, Open, Closed, u64, f53)\n {return ::u01_open_closed_64_53(i);}\n\n static double u01(uint64_t i, Closed, Open, u64, f53)\n {return ::u01_closed_open_64_53(i);}\n\n static double u01(uint64_t i, Closed, Closed, u64, f53)\n {return ::u01_closed_closed_64_53(i);}\n}; \/\/ class UniformRealDistributionBase\n\n} \/\/ namespace vsmc\n\n#endif \/\/ VSMC_UNIFORM_REAL_DISTRIBUTION_HPP\n<|endoftext|>"} {"text":"<commit_before>#include <vector>\n#include <stdlib.h>\n#include <stdio.h>\n#include <time.h>\n#include <iostream>\n#include <ros\/ros.h>\n#include <std_msgs\/String.h>\n#include <string>\n#include <std_msgs\/Int16.h>\n\/**\n* listens to the \"\/questions\" and \"\/balls\" topics and sends messages to the \"\/makeSound\", \"\/drive\" and \"\/display\" topic to make sounds, drive around and display various the question. \nSubscribes to:\n\t\/questions\n\t\/balls\n\t\nPublishes to:\n\t\/makeSound\n\t\/drive\n\t\/display\t\n*\/ \nclass mathasker{\n\tpublic: \n\n\tros::Subscriber sub;\n\tros::NodeHandle handle;\n\t \n\tros::Publisher display;\n\tros::Publisher sound;\n\tros::Publisher drive;\n\n\tros::Subscriber numberball;\n\tros::Subscriber launch;\n\n\tconst int balls[20]={1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19,20};\n\tstd::vector<int> available_balls;\n\n\tint find(std::vector<int> vec, int seek)\n\t{\n\t for (int i = 0; i < vec.size(); ++i)\n\t {\n\t if (vec[i] == seek) return i;\n\t }\n\t return -1;\n\t}\n\n\t\/\/written by bob, muchos bugs\n\t\/*void removecallback(std_msgs::Int16::ConstPtr &number){\n\t\tint lel = number->data;\n\t\tint index = find(balls, lel);\n\t\tif (index != -1){\n\t\t\tavailable_balls.erase(index);\t\n\t\t}\t\t\n\t}\n\n\t\/\/written by bob, muchos bugs\n\tvoid donelaunchingcallback(std_msgs::String::ConstPtr &msg){\n\t\tif (msg->data == \"donelaunching\"){\n\t\t\tfor(int i=1;i<20;i++){\n\t\t\t\tavailable_balls.push_back(balls[i]);\n\t\t\t}\n\t\t}\n\t}\n\t*\/\n\n\t\/* returns array of 3 integers first 2 are the once being summed third is the answer*\/\n\tint* addition2dig(){\n\t\tint* result =new int[3];\n\t\t\/\/select indexes \n\t\tint a;\n\t\tint b;\n\t\tdo{\n\t\t\ta=available_balls[rand()%available_balls.size()];\n\t\t\tb=available_balls[rand()%available_balls.size()];\n\t\t}while(a!=b);\n\t\t\tresult[2]=a*10+b; \n\t\t\tresult[1]=rand()%result[2];\n\t\t\tresult[0]=result[2]-result[1];\n\t\treturn result; \n\t}\n\n\n\tint* addition1dig(){\n\t\tint* result =new int[3];\n\t\tresult[2]=available_balls[rand()%available_balls.size()];\n\t\tif(result[2]!=0){\n\t\t\tresult[1]=rand()%result[2];\n\t\t}else{\n\t\t\tresult[1]=0;\n\t\t}\n\t\tresult[0]=result[2]-result[1];\n\t\treturn result; \n\t}\n\n\tint* substract1dig(){\n\t\tint* ans=addition1dig();\n\t\tint temp=ans[0];\n\t\tans[0]=ans[2];\n\t\tans[2]=temp;\n\t\treturn ans; \n\t}\n\tint* substract2dig(){\n\t\tint* ans=addition2dig();\n\t\tint temp=ans[0];\n\t\tans[0]=ans[2];\n\t\tans[2]=temp;\n\t\treturn ans; \t\t\n\t\t}\n\n\tvoid questioncallback(std_msgs::String request){\n\n\n\t\tint* questiondata;\n\t\tstd_msgs::String soundmsg;\n\t\tstd_msgs::String displaymsg;\n\t\tchar opperator='0';\n\n\t\tif(request.data.compare(\"1digitAdditionfs\")==0){\n\n\t\t\tquestiondata=addition1dig();\t\n\t\t\topperator='+';\n\t\t}\n\t\tif(request.data.compare(\"2digitAddition\")==0){\n\t\t\tquestiondata=addition2dig();\t\n\t\t\topperator='+';\n\t\t}\n\t\tif(request.data.compare(\"1digitSubstraction\")==0){\n\t\t\tquestiondata=substract1dig();\t\n\t\t\topperator='-';\n\t\t}\n\t\tif(request.data.compare(\"2digitSubstraction\")==0){\n\t\t\tquestiondata=substract2dig();\t\n\t\t\topperator='-';\n\t\t}\n\t\tif (opperator=='0'){\n\t\t\tstd::cout<<\"\/question:\"<<request<<\"is not understanable for the mathasker\"<<std::endl;\n\t\t\treturn;\n\t\t}\n\t\tstd::stringstream ss;\n\t\tss<<questiondata[0];\n\t\tswitch (opperator){\n\t\t\tcase '+': ss<<\":\";break;\n\t\t\tcase '-': ss<<\";\";break;\n\t\t\tcase 'x': ss<<\"<\";break;\n\t\t\tcase '\/': ss<<\"=\";break;\n\t\t}\n\t\tss<<questiondata[1];\n\t\tsoundmsg.data=ss.str();\t\n\t\tsound.publish(soundmsg);\n\t\tstd::stringstream ds;\n\t\tds<<\"s\"<<questiondata[0]<<opperator<<questiondata[1];\n\t\tdisplaymsg.data=ds.str();\n\t\tdisplay.publish(displaymsg);\n\t}\n\n\n\tmathasker():handle(\"~\"){\n\t\tsrand (time(NULL));\n\t\tdisplay=handle.advertise<std_msgs::String>(\"\/display\",100);\n\t\tsound=handle.advertise<std_msgs::String>(\"\/tawi\/media\/audio\",100);\n\t\tdrive=handle.advertise<std_msgs::String>(\"\/drive\",100);\n\t\tsub = handle.subscribe<std_msgs::String>(\"\/questions\", 100, &mathasker::questioncallback,this); \/\/question TRIGGER\n\t\t\/\/numberball = handle.subscribe<std_msgs::Int16>(\"\/tawi\/core\/number\", 10, &mathasker::removecallback,this); \/\/remove ball subscription\n\t\t\/\/launch = handle.subscribe<std_msgs::String>(\"\/tawi\/core\/launch\", 100, &mathasker::donelaunchcallback,this); \/\/done with launching subscription\n\t\tfor(int i=1;i<20;i++){\n\t\t\tavailable_balls.push_back(balls[i]);\n\t\t}\n\t}\n};\n\n\nint main(int argc, char **argv){\n\tros::init(argc, argv, \"audioDriver\");\n\tmathasker math;\n\tros::Rate hz(100);\n\n\twhile(ros::ok()){\t\n\t\tros::spinOnce();\n\t\thz.sleep();\n\t} \t\n}\n<commit_msg>fixed mofos<commit_after>#include <vector>\n#include <stdlib.h>\n#include <stdio.h>\n#include <time.h>\n#include <iostream>\n#include <ros\/ros.h>\n#include <std_msgs\/String.h>\n#include <string>\n#include <std_msgs\/Int16.h>\n\/**\n* listens to the \"\/questions\" and \"\/balls\" topics and sends messages to the \"\/makeSound\", \"\/drive\" and \"\/display\" topic to make sounds, drive around and display various the question. \nSubscribes to:\n\t\/questions\n\t\/balls\n\t\nPublishes to:\n\t\/makeSound\n\t\/drive\n\t\/display\t\n*\/ \nclass mathasker{\n\tpublic: \n\n\tros::Subscriber sub;\n\tros::NodeHandle handle;\n\t \n\tros::Publisher display;\n\tros::Publisher sound;\n\tros::Publisher drive;\n\n\tros::Subscriber numberball;\n\tros::Subscriber launch;\n\n\tconst int balls[20]={1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19,20};\n\tstd::vector<int> available_balls;\n\n\t\/\/written by bob, muchos bugs but working.\n\tvoid removecallback(std_msgs::Int16 number){\n\t\tint lel = number.data;\n\t\tprintf(\"removing number: %d \\n\", lel);\n\t\t\/\/int index = find(balls, lel);\n\t\tavailable_balls.erase(std::remove(available_balls.begin(), available_balls.end(), lel), available_balls.end());\n\t\t\/*if (index != -1){\n\t\t\tavailable_balls.erase(index);\t\n\t\t}*\/\n\t\tfor (int i=0; i<available_balls.size(); i++){\n\t\t\tprintf(\"%d, \", available_balls[i]);\n\t\t}\n\t\tprintf(\"\\n\");\n\t}\n\n\t\/\/written by bob, muchos bugs but working.\n\tvoid donelaunchcallback(std_msgs::String msg){\n\t\tif (msg.data == \"donelaunching\"){\n\t\t\tavailable_balls.clear();\n\t\t\tfor(int i=1;i<20;i++){\n\t\t\t\tavailable_balls.push_back(balls[i]);\n\t\t\t}\n\t\t}\n\t}\n\t\n\n\t\/* returns array of 3 integers first 2 are the once being summed third is the answer*\/\n\tint* addition2dig(){\n\t\tint* result =new int[3];\n\t\t\/\/select indexes \n\t\tint a;\n\t\tint b;\n\t\tdo{\n\t\t\ta=available_balls[rand()%available_balls.size()];\n\t\t\tb=available_balls[rand()%available_balls.size()];\n\t\t}while(a!=b);\n\t\t\tresult[2]=a*10+b; \n\t\t\tresult[1]=rand()%result[2];\n\t\t\tresult[0]=result[2]-result[1];\n\t\treturn result; \n\t}\n\n\n\tint* addition1dig(){\n\t\tint* result =new int[3];\n\t\tresult[2]=available_balls[rand()%available_balls.size()];\n\t\tif(result[2]!=0){\n\t\t\tresult[1]=rand()%result[2];\n\t\t}else{\n\t\t\tresult[1]=0;\n\t\t}\n\t\tresult[0]=result[2]-result[1];\n\t\treturn result; \n\t}\n\n\tint* substract1dig(){\n\t\tint* ans=addition1dig();\n\t\tint temp=ans[0];\n\t\tans[0]=ans[2];\n\t\tans[2]=temp;\n\t\treturn ans; \n\t}\n\tint* substract2dig(){\n\t\tint* ans=addition2dig();\n\t\tint temp=ans[0];\n\t\tans[0]=ans[2];\n\t\tans[2]=temp;\n\t\treturn ans; \t\t\n\t\t}\n\n\tvoid questioncallback(std_msgs::String request){\n\n\n\t\tint* questiondata;\n\t\tstd_msgs::String soundmsg;\n\t\tstd_msgs::String displaymsg;\n\t\tchar opperator='0';\n\n\t\tif(request.data.compare(\"1digitAdditionfs\")==0){\n\n\t\t\tquestiondata=addition1dig();\t\n\t\t\topperator='+';\n\t\t}\n\t\tif(request.data.compare(\"2digitAddition\")==0){\n\t\t\tquestiondata=addition2dig();\t\n\t\t\topperator='+';\n\t\t}\n\t\tif(request.data.compare(\"1digitSubstraction\")==0){\n\t\t\tquestiondata=substract1dig();\t\n\t\t\topperator='-';\n\t\t}\n\t\tif(request.data.compare(\"2digitSubstraction\")==0){\n\t\t\tquestiondata=substract2dig();\t\n\t\t\topperator='-';\n\t\t}\n\t\tif (opperator=='0'){\n\t\t\tstd::cout<<\"\/question:\"<<request<<\"is not understanable for the mathasker\"<<std::endl;\n\t\t\treturn;\n\t\t}\n\t\tstd::stringstream ss;\n\t\tss<<questiondata[0];\n\t\tswitch (opperator){\n\t\t\tcase '+': ss<<\":\";break;\n\t\t\tcase '-': ss<<\";\";break;\n\t\t\tcase 'x': ss<<\"<\";break;\n\t\t\tcase '\/': ss<<\"=\";break;\n\t\t}\n\t\tss<<questiondata[1];\n\t\tsoundmsg.data=ss.str();\t\n\t\tsound.publish(soundmsg);\n\t\tstd::stringstream ds;\n\t\tds<<\"s\"<<questiondata[0]<<opperator<<questiondata[1];\n\t\tdisplaymsg.data=ds.str();\n\t\tdisplay.publish(displaymsg);\n\t}\n\n\n\tmathasker():handle(\"~\"){\n\t\tsrand (time(NULL));\n\t\tdisplay=handle.advertise<std_msgs::String>(\"\/display\",100);\n\t\tsound=handle.advertise<std_msgs::String>(\"\/tawi\/media\/audio\",100);\n\t\tdrive=handle.advertise<std_msgs::String>(\"\/drive\",100);\n\t\tsub = handle.subscribe<std_msgs::String>(\"\/questions\", 100, &mathasker::questioncallback,this); \/\/question TRIGGER\n\t\tnumberball = handle.subscribe<std_msgs::Int16>(\"\/tawi\/core\/number\", 1, &mathasker::removecallback,this); \/\/remove ball subscription\n\t\tlaunch = handle.subscribe<std_msgs::String>(\"\/tawi\/core\/launch\", 100, &mathasker::donelaunchcallback,this); \/\/done with launching subscription\n\t\tfor(int i=1;i<20;i++){\n\t\t\tavailable_balls.push_back(balls[i]);\n\t\t}\n\t}\n};\n\n\nint main(int argc, char **argv){\n\tros::init(argc, argv, \"audioDriver\");\n\tmathasker math;\n\tros::Rate hz(100);\n\n\twhile(ros::ok()){\t\n\t\tros::spinOnce();\n\t\thz.sleep();\n\t} \t\n}\n<|endoftext|>"} {"text":"<commit_before>#ifndef ORG_EEROS_CONTROL_ETHERCAT_ELMOOUTPUT_\n#define ORG_EEROS_CONTROL_ETHERCAT_ELMOOUTPUT_\n\n#include <eeros\/control\/Blockio.hpp>\n#include <eeros\/control\/Input.hpp>\n#include <eeros\/core\/System.hpp>\n#include <EcMasterlibMain.hpp>\n#include <device\/Elmo.hpp>\n\nnamespace eeros {\nnamespace control {\n\n\/**\n * This block reads a Elmo drive over EtherCAT and outputs the position,\n * velocity and torque values onto three output signals. All values must be scaled \n * in order to get meaningful physical entities.\n *\n * @since v1.3\n *\/\n\nclass ElmoOutput : public Blockio<0,0,double,double> {\n \n public:\n \/**\n * Constructs a EtherCAT receive block instance which receives its output \n * signals from a Elmo drive.\n *\n * @param iface - reference to Elmo drive\n *\/\n ElmoInput(ecmasterlib::device::Elmo& iface) : iface(iface) { }\n \n \/**\n * Puts the drive inputs onto the output signals.\n *\/\n virtual void run() {\n using Mode = ecmasterlib::device::Elmo::Mode;\n const auto getValue = [](auto &input) { return input.getSignal().getValue(); };\n switch (elmo.getMode()) {\n case Mode::PROFILE_POSITION: \n elmo.setTargetPosition(getValue(position));\n elmo.setMaximumTorque(getValue(torqueMax)); \n break;\n case Mode::PROFILE_VELOCITY:\n elmo.setTargetVelocity(getValue(velocity));\n elmo.setMaximumTorque(getValue(torqueMax)); \n break;\n case Mode::PROFILE_TORQUE: \n elmo.setTargetTorque(getValue(torque));\n elmo.setMaximumTorque(getValue(torqueMax)); \n break; \n default:\n break;\n }\n }\n \n \/**\n * Gets the position input of the block.\n * \n * @return input\n *\/\n virtual Input<int32_t>& getPosIn() { return position; } \n \n \/**\n * Gets the velocity input of the block.\n * \n * @return input\n *\/\n virtual Input<int32_t>& getVelIn() { return velocity; }\n \n \/**\n * Gets the torque input of the block.\n * \n * @return input\n *\/\n virtual Input<int16_t>& getTorqueIn() { return torque; }\n \n \/**\n * Gets the maximum torque input of the block.\n * \n * @return input\n *\/\n virtual Input<int16_t>& getTorqueMaxIn(){ return torqueMax; }\n\n private:\n ecmasterlib::device::Elmo& iface;\n Input<int32_t> position, velocity;\n Input<int16_t> torque, torqueMax;\n};\n\n}\n}\n\n#endif \/\/ ORG_EEROS_CONTROL_ETHERCAT_ELMOOUTPUT_\n<commit_msg>Correct documentation<commit_after>#ifndef ORG_EEROS_CONTROL_ETHERCAT_ELMOOUTPUT_\n#define ORG_EEROS_CONTROL_ETHERCAT_ELMOOUTPUT_\n\n#include <eeros\/control\/Blockio.hpp>\n#include <eeros\/control\/Input.hpp>\n#include <eeros\/core\/System.hpp>\n#include <EcMasterlibMain.hpp>\n#include <device\/Elmo.hpp>\n\nnamespace eeros {\nnamespace control {\n\n\/**\n * This block reads input signals for position, velocity and torque and sends\n * them over EtherCAT to an Elmo drive. All values must be scaled from physical \n * entities to fit into the transmit frame of EtherCAT.\n *\n * @since v1.3\n *\/\n\nclass ElmoOutput : public Blockio<0,0,double,double> {\n \n public:\n \/**\n * Constructs an EtherCAT transmit block instance which sends its input \n * signals to an Elmo drive.\n *\n * @param iface - reference to Elmo drive\n *\/\n ElmoOutput(ecmasterlib::device::Elmo& iface) : iface(iface) { }\n \n \/**\n * Puts the signal inputs to the Elmo drive.\n *\/\n virtual void run() {\n using Mode = ecmasterlib::device::Elmo::Mode;\n const auto getValue = [](auto &input) { return input.getSignal().getValue(); };\n switch (elmo.getMode()) {\n case Mode::PROFILE_POSITION: \n elmo.setTargetPosition(getValue(position));\n elmo.setMaximumTorque(getValue(torqueMax)); \n break;\n case Mode::PROFILE_VELOCITY:\n elmo.setTargetVelocity(getValue(velocity));\n elmo.setMaximumTorque(getValue(torqueMax)); \n break;\n case Mode::PROFILE_TORQUE: \n elmo.setTargetTorque(getValue(torque));\n elmo.setMaximumTorque(getValue(torqueMax)); \n break; \n default:\n break;\n }\n }\n \n \/**\n * Gets the position input of the block.\n * \n * @return input\n *\/\n virtual Input<int32_t>& getPosIn() { return position; } \n \n \/**\n * Gets the velocity input of the block.\n * \n * @return input\n *\/\n virtual Input<int32_t>& getVelIn() { return velocity; }\n \n \/**\n * Gets the torque input of the block.\n * \n * @return input\n *\/\n virtual Input<int16_t>& getTorqueIn() { return torque; }\n \n \/**\n * Gets the maximum torque input of the block.\n * \n * @return input\n *\/\n virtual Input<int16_t>& getTorqueMaxIn(){ return torqueMax; }\n\n private:\n ecmasterlib::device::Elmo& iface;\n Input<int32_t> position, velocity;\n Input<int16_t> torque, torqueMax;\n};\n\n}\n}\n\n#endif \/\/ ORG_EEROS_CONTROL_ETHERCAT_ELMOOUTPUT_\n<|endoftext|>"} {"text":"<commit_before>\/*************************************************************************\n *\n * OpenOffice.org - a multi-platform office productivity suite\n *\n * $RCSfile: tabcol.hxx,v $\n *\n * $Revision: 1.4 $\n *\n * last change: $Author: rt $ $Date: 2005-09-09 02:18:53 $\n *\n * The Contents of this file are made available subject to\n * the terms of GNU Lesser General Public License Version 2.1.\n *\n *\n * GNU Lesser General Public License Version 2.1\n * =============================================\n * Copyright 2005 by Sun Microsystems, Inc.\n * 901 San Antonio Road, Palo Alto, CA 94303, USA\n *\n * This library is free software; you can redistribute it and\/or\n * modify it under the terms of the GNU Lesser General Public\n * License version 2.1, as published by the Free Software Foundation.\n *\n * This library is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU\n * Lesser General Public License for more details.\n *\n * You should have received a copy of the GNU Lesser General Public\n * License along with this library; if not, write to the Free Software\n * Foundation, Inc., 59 Temple Place, Suite 330, Boston,\n * MA 02111-1307 USA\n *\n ************************************************************************\/\n#ifndef _TABCOL_HXX\n#define _TABCOL_HXX\n\n#ifndef _SVSTDARR_HXX\n#define _SVSTDARR_LONGS\n#define _SVSTDARR_BOOLS\n#include <svtools\/svstdarr.hxx>\n#endif\n\n#ifndef INCLUDED_VECTOR\n#include <vector>\n#define INCLUDED_VECTOR\n#endif\n\n#ifndef INCLUDED_SWDLLAPI_H\n#include \"swdllapi.h\"\n#endif\n\nstruct SwTabColsEntry\n{\n long nPos;\n long nMin;\n long nMax;\n BOOL bHidden; \/\/Fuer jeden Eintrag ein Flag, Hidden oder nicht.\n \/\/Wenn das Flag Hidden TRUE ist liegt der Spalten-\n \/\/trenner nicht in der aktuellen Zeile; er muss\n \/\/mit gepflegt werden, darf aber nicht angezeigt\n \/\/werden.\n};\n\ntypedef std::vector< SwTabColsEntry > SwTabColsEntries;\n\nclass SW_DLLPUBLIC SwTabCols\n{\n long nLeftMin, \/\/Linker aeusserer Rand (Bezugspunkt) in\n \/\/Dokumentkordinaten.\n \/\/Alle anderen Werte relativ zu diesem Punkt!\n nLeft, \/\/Linker Rand der Tabelle.\n nRight, \/\/Rechter Rand der Tabelle.\n nRightMax; \/\/Maximaler rechter Rand der Tabelle.\n\n bool bLastRowAllowedToChange; \/\/ if the last row of the table frame\n \/\/ is split across pages, it may not\n \/\/ change its size\n\n SwTabColsEntries aData;\n\n \/\/fuer den CopyCTor\n const SwTabColsEntries& GetData() const { return aData; }\n\npublic:\n SwTabCols( USHORT nSize = 0 );\n SwTabCols( const SwTabCols& );\n SwTabCols &operator=( const SwTabCols& );\n BOOL operator==( const SwTabCols& rCmp ) const;\n long& operator[]( USHORT nPos ) { return aData[nPos].nPos; }\n long operator[]( USHORT nPos ) const { return aData[nPos].nPos; }\n USHORT Count() const { return aData.size(); }\n\n BOOL IsHidden( USHORT nPos ) const { return aData[nPos].bHidden; }\n void SetHidden( USHORT nPos, BOOL bValue ) { aData[nPos].bHidden = bValue; }\n\n void Insert( long nValue, BOOL bValue, USHORT nPos );\n void Insert( long nValue, long nMin, long nMax, BOOL bValue, USHORT nPos );\n void Remove( USHORT nPos, USHORT nAnz = 1 );\n\n const SwTabColsEntry& GetEntry( USHORT nPos ) const { return aData[nPos]; }\n SwTabColsEntry& GetEntry( USHORT nPos ) { return aData[nPos]; }\n\n long GetLeftMin() const { return nLeftMin; }\n long GetLeft() const { return nLeft; }\n long GetRight() const { return nRight; }\n long GetRightMax()const { return nRightMax;}\n\n void SetLeftMin ( long nNew ) { nLeftMin = nNew; }\n void SetLeft ( long nNew ) { nLeft = nNew; }\n void SetRight ( long nNew ) { nRight = nNew; }\n void SetRightMax( long nNew ) { nRightMax = nNew;}\n\n bool IsLastRowAllowedToChange() const { return bLastRowAllowedToChange; }\n void SetLastRowAllowedToChange( bool bNew ) { bLastRowAllowedToChange = bNew; }\n};\n\n#endif \/\/_TABCOL_HXX\n<commit_msg>INTEGRATION: CWS swwarnings (1.4.710); FILE MERGED 2007\/02\/22 15:05:39 tl 1.4.710.1: #i69287# warning-free code<commit_after>\/*************************************************************************\n *\n * OpenOffice.org - a multi-platform office productivity suite\n *\n * $RCSfile: tabcol.hxx,v $\n *\n * $Revision: 1.5 $\n *\n * last change: $Author: hr $ $Date: 2007-09-27 08:13: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#ifndef _TABCOL_HXX\n#define _TABCOL_HXX\n\n#ifndef _SVSTDARR_HXX\n#define _SVSTDARR_LONGS\n#define _SVSTDARR_BOOLS\n#include <svtools\/svstdarr.hxx>\n#endif\n\n#ifndef INCLUDED_VECTOR\n#include <vector>\n#define INCLUDED_VECTOR\n#endif\n\n#ifndef INCLUDED_SWDLLAPI_H\n#include \"swdllapi.h\"\n#endif\n\nstruct SwTabColsEntry\n{\n long nPos;\n long nMin;\n long nMax;\n BOOL bHidden; \/\/Fuer jeden Eintrag ein Flag, Hidden oder nicht.\n \/\/Wenn das Flag Hidden TRUE ist liegt der Spalten-\n \/\/trenner nicht in der aktuellen Zeile; er muss\n \/\/mit gepflegt werden, darf aber nicht angezeigt\n \/\/werden.\n};\n\ntypedef std::vector< SwTabColsEntry > SwTabColsEntries;\n\nclass SW_DLLPUBLIC SwTabCols\n{\n long nLeftMin, \/\/Linker aeusserer Rand (Bezugspunkt) in\n \/\/Dokumentkordinaten.\n \/\/Alle anderen Werte relativ zu diesem Punkt!\n nLeft, \/\/Linker Rand der Tabelle.\n nRight, \/\/Rechter Rand der Tabelle.\n nRightMax; \/\/Maximaler rechter Rand der Tabelle.\n\n bool bLastRowAllowedToChange; \/\/ if the last row of the table frame\n \/\/ is split across pages, it may not\n \/\/ change its size\n\n SwTabColsEntries aData;\n\n \/\/fuer den CopyCTor\n const SwTabColsEntries& GetData() const { return aData; }\n\npublic:\n SwTabCols( USHORT nSize = 0 );\n SwTabCols( const SwTabCols& );\n SwTabCols &operator=( const SwTabCols& );\n BOOL operator==( const SwTabCols& rCmp ) const;\n long& operator[]( USHORT nPos ) { return aData[nPos].nPos; }\n long operator[]( USHORT nPos ) const { return aData[nPos].nPos; }\n USHORT Count() const { return sal::static_int_cast< USHORT >(aData.size()); }\n\n BOOL IsHidden( USHORT nPos ) const { return aData[nPos].bHidden; }\n void SetHidden( USHORT nPos, BOOL bValue ) { aData[nPos].bHidden = bValue; }\n\n void Insert( long nValue, BOOL bValue, USHORT nPos );\n void Insert( long nValue, long nMin, long nMax, BOOL bValue, USHORT nPos );\n void Remove( USHORT nPos, USHORT nAnz = 1 );\n\n const SwTabColsEntry& GetEntry( USHORT nPos ) const { return aData[nPos]; }\n SwTabColsEntry& GetEntry( USHORT nPos ) { return aData[nPos]; }\n\n long GetLeftMin() const { return nLeftMin; }\n long GetLeft() const { return nLeft; }\n long GetRight() const { return nRight; }\n long GetRightMax()const { return nRightMax;}\n\n void SetLeftMin ( long nNew ) { nLeftMin = nNew; }\n void SetLeft ( long nNew ) { nLeft = nNew; }\n void SetRight ( long nNew ) { nRight = nNew; }\n void SetRightMax( long nNew ) { nRightMax = nNew;}\n\n bool IsLastRowAllowedToChange() const { return bLastRowAllowedToChange; }\n void SetLastRowAllowedToChange( bool bNew ) { bLastRowAllowedToChange = bNew; }\n};\n\n#endif \/\/_TABCOL_HXX\n<|endoftext|>"} {"text":"<commit_before>\/*************************************************************************\n *\n * OpenOffice.org - a multi-platform office productivity suite\n *\n * $RCSfile: usrfld.hxx,v $\n *\n * $Revision: 1.5 $\n *\n * last change: $Author: rt $ $Date: 2005-12-14 14:47:12 $\n *\n * The Contents of this file are made available subject to\n * the terms of GNU Lesser General Public License Version 2.1.\n *\n *\n * GNU Lesser General Public License Version 2.1\n * =============================================\n * Copyright 2005 by Sun Microsystems, Inc.\n * 901 San Antonio Road, Palo Alto, CA 94303, USA\n *\n * This library is free software; you can redistribute it and\/or\n * modify it under the terms of the GNU Lesser General Public\n * License version 2.1, as published by the Free Software Foundation.\n *\n * This library is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU\n * Lesser General Public License for more details.\n *\n * You should have received a copy of the GNU Lesser General Public\n * License along with this library; if not, write to the Free Software\n * Foundation, Inc., 59 Temple Place, Suite 330, Boston,\n * MA 02111-1307 USA\n *\n ************************************************************************\/\n#ifndef _USRFLD_HXX\n#define _USRFLD_HXX\n\n#ifndef INCLUDED_SWDLLAPI_H\n#include \"swdllapi.h\"\n#endif\n\n#ifndef _FLDBAS_HXX\n#include \"fldbas.hxx\"\n#endif\n\nclass SfxPoolItem;\nclass SwCalc;\nclass SwDoc;\n\n\/*--------------------------------------------------------------------\n Beschreibung: Benutzerfelder\n --------------------------------------------------------------------*\/\n\nclass SW_DLLPUBLIC SwUserFieldType : public SwValueFieldType\n{\n BOOL bValidValue : 1;\n BOOL bDeleted : 1;\n double nValue;\n String aName;\n String aContent;\n USHORT nType;\n\npublic:\n SwUserFieldType( SwDoc* pDocPtr, const String& );\n\n virtual const String& GetName() const;\n virtual SwFieldType* Copy() const;\n\n String Expand(sal_uInt32 nFmt, USHORT nSubType, USHORT nLng);\n\n String GetContent( sal_uInt32 nFmt = 0 );\n void SetContent( const String& rStr, sal_uInt32 nFmt = 0 );\n void CtrlSetContent( const String& rStr );\n\n inline BOOL IsValid() const;\n inline void ChgValid( BOOL bNew );\n\n virtual void Modify( SfxPoolItem* pOld, SfxPoolItem* pNew );\n\n double GetValue(SwCalc& rCalc); \/\/ Member nValue neu berrechnen\n inline double GetValue() const;\n inline void SetValue(const double nVal);\n\n inline USHORT GetType() const;\n inline void SetType(USHORT);\n\n BOOL IsDeleted() const { return bDeleted; }\n void SetDeleted( BOOL b ) { bDeleted = b; }\n\n virtual BOOL QueryValue( com::sun::star::uno::Any& rVal, BYTE nMId ) const;\n virtual BOOL PutValue( const com::sun::star::uno::Any& rVal, BYTE nMId );\n};\n\ninline BOOL SwUserFieldType::IsValid() const\n { return bValidValue; }\n\ninline void SwUserFieldType::ChgValid( BOOL bNew )\n { bValidValue = bNew; }\n\ninline double SwUserFieldType::GetValue() const\n { return nValue; }\n\ninline void SwUserFieldType::SetValue(const double nVal)\n { nValue = nVal; }\n\ninline USHORT SwUserFieldType::GetType() const\n { return nType; }\n\ninline void SwUserFieldType::SetType(USHORT nSub)\n{\n nType = nSub;\n EnableFormat(!(nSub & GSE_STRING));\n}\n\n\/*--------------------------------------------------------------------\n Beschreibung: Benutzerfelder\n --------------------------------------------------------------------*\/\n\nclass SwUserField : public SwValueField\n{\n USHORT nSubType;\n\npublic:\n SwUserField(SwUserFieldType*, USHORT nSub = 0, sal_uInt32 nFmt = 0);\n\n virtual USHORT GetSubType() const;\n virtual void SetSubType(USHORT nSub);\n\n virtual double GetValue() const;\n virtual void SetValue( const double& rVal );\n\n virtual String Expand() const;\n virtual SwField* Copy() const;\n virtual String GetCntnt(BOOL bName = FALSE) const;\n\n \/\/ Name kann nicht geaendert werden\n virtual const String& GetPar1() const;\n\n \/\/ Inhalt\n virtual String GetPar2() const;\n virtual void SetPar2(const String& rStr);\n virtual BOOL QueryValue( com::sun::star::uno::Any& rVal, BYTE nMId ) const;\n virtual BOOL PutValue( const com::sun::star::uno::Any& rVal, BYTE nMId );\n};\n\n#endif \/\/ _USRFLD_HXX\n<commit_msg>INTEGRATION: CWS os94 (1.5.616); FILE MERGED 2007\/03\/12 08:07:33 os 1.5.616.1: #i75235# unused methods removed<commit_after>\/*************************************************************************\n *\n * OpenOffice.org - a multi-platform office productivity suite\n *\n * $RCSfile: usrfld.hxx,v $\n *\n * $Revision: 1.6 $\n *\n * last change: $Author: rt $ $Date: 2007-04-25 08:58: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 _USRFLD_HXX\n#define _USRFLD_HXX\n\n#ifndef INCLUDED_SWDLLAPI_H\n#include \"swdllapi.h\"\n#endif\n\n#ifndef _FLDBAS_HXX\n#include \"fldbas.hxx\"\n#endif\n\nclass SfxPoolItem;\nclass SwCalc;\nclass SwDoc;\n\n\/*--------------------------------------------------------------------\n Beschreibung: Benutzerfelder\n --------------------------------------------------------------------*\/\n\nclass SW_DLLPUBLIC SwUserFieldType : public SwValueFieldType\n{\n BOOL bValidValue : 1;\n BOOL bDeleted : 1;\n double nValue;\n String aName;\n String aContent;\n USHORT nType;\n\npublic:\n SwUserFieldType( SwDoc* pDocPtr, const String& );\n\n virtual const String& GetName() const;\n virtual SwFieldType* Copy() const;\n\n String Expand(sal_uInt32 nFmt, USHORT nSubType, USHORT nLng);\n\n String GetContent( sal_uInt32 nFmt = 0 );\n void SetContent( const String& rStr, sal_uInt32 nFmt = 0 );\n\n inline BOOL IsValid() const;\n inline void ChgValid( BOOL bNew );\n\n virtual void Modify( SfxPoolItem* pOld, SfxPoolItem* pNew );\n\n double GetValue(SwCalc& rCalc); \/\/ Member nValue neu berrechnen\n inline double GetValue() const;\n inline void SetValue(const double nVal);\n\n inline USHORT GetType() const;\n inline void SetType(USHORT);\n\n BOOL IsDeleted() const { return bDeleted; }\n void SetDeleted( BOOL b ) { bDeleted = b; }\n\n virtual BOOL QueryValue( com::sun::star::uno::Any& rVal, BYTE nMId ) const;\n virtual BOOL PutValue( const com::sun::star::uno::Any& rVal, BYTE nMId );\n};\n\ninline BOOL SwUserFieldType::IsValid() const\n { return bValidValue; }\n\ninline void SwUserFieldType::ChgValid( BOOL bNew )\n { bValidValue = bNew; }\n\ninline double SwUserFieldType::GetValue() const\n { return nValue; }\n\ninline void SwUserFieldType::SetValue(const double nVal)\n { nValue = nVal; }\n\ninline USHORT SwUserFieldType::GetType() const\n { return nType; }\n\ninline void SwUserFieldType::SetType(USHORT nSub)\n{\n nType = nSub;\n EnableFormat(!(nSub & GSE_STRING));\n}\n\n\/*--------------------------------------------------------------------\n Beschreibung: Benutzerfelder\n --------------------------------------------------------------------*\/\n\nclass SwUserField : public SwValueField\n{\n USHORT nSubType;\n\npublic:\n SwUserField(SwUserFieldType*, USHORT nSub = 0, sal_uInt32 nFmt = 0);\n\n virtual USHORT GetSubType() const;\n virtual void SetSubType(USHORT nSub);\n\n virtual double GetValue() const;\n virtual void SetValue( const double& rVal );\n\n virtual String Expand() const;\n virtual SwField* Copy() const;\n virtual String GetCntnt(BOOL bName = FALSE) const;\n\n \/\/ Name kann nicht geaendert werden\n virtual const String& GetPar1() const;\n\n \/\/ Inhalt\n virtual String GetPar2() const;\n virtual void SetPar2(const String& rStr);\n virtual BOOL QueryValue( com::sun::star::uno::Any& rVal, BYTE nMId ) const;\n virtual BOOL PutValue( const com::sun::star::uno::Any& rVal, BYTE nMId );\n};\n\n#endif \/\/ _USRFLD_HXX\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 observation_model_interface.hpp\n * \\date October 2014\n * \\author Jan Issac (jan.issac@gmail.com)\n *\/\n\n#ifndef FL__MODEL__OBSERVATION__OBSERVATION_MODEL_INTERFACE_HPP\n#define FL__MODEL__OBSERVATION__OBSERVATION_MODEL_INTERFACE_HPP\n\n#include <fl\/util\/traits.hpp>\n\nnamespace fl\n{\n\n\/**\n * \\ingroup observation_models\n * \\interface ObservationModelInterface\n *\n *\n * Represents the generic observation model interface of the model function\n * \\f$h(x, w, \\theta)\\f$ where \\f$x\\f$ is the state,\n * \\f$w\\sim {\\cal N}(0, 1)\\f$ is a white noise term, and \\f$\\theta\\f$ the\n * model variable parameters.\n *\n * \\tparam Obsrv Measurement type \\f$y = h(x, w, \\theta)\\f$\n * \\tparam State State variate \\f$x\\f$\n * \\tparam Noise White noise variate term \\f$w\\sim {\\cal N}(0, I)\\f$\n * \\tparam Id Model id number\n *\/\ntemplate <\n typename Obsrv,\n typename State,\n typename Noise,\n int Id = 0\n>\nclass ObservationModelInterface\n : public internal::ObsrvModelType\n{\npublic:\n typedef internal::ObsrvModelType ModelType;\n\n \/**\n * Evaluates the model function \\f$y = h(x, w)\\f$ where \\f$x\\f$ is the state\n * and \\f$w\\sim {\\cal N}(0, 1)\\f$ is a white noise parameter. Put\n * differently, \\f$y = h(x, w)\\f$ is a sample from the conditional model\n * distribution \\f$p(y \\mid x)\\f$.\n *\n * \\param state The state variable \\f$x\\f$\n * \\param noise The noise term \\f$w\\f$\n * \\param delta_time Prediction time\n *\/\n virtual Obsrv predict_obsrv(const State& state,\n const Noise& noise,\n double delta_time) = 0;\n\n \/**\n * \\return Dimension of the state variable $\\f$x\\f$\n *\/\n virtual int state_dimension() const = 0;\n\n \/**\n * \\return Dimension of the noise term \\f$w\\f$\n *\/\n virtual int noise_dimension() const = 0;\n\n \/**\n * \\return Dimension of the measurement \\f$h(x, w)\\f$\n *\/\n virtual int obsrv_dimension() const = 0;\n\n \/**\n * \\return Model id number\n *\n * In case of multiple sensors of the same kind, this function returns the\n * id of the individual model.\n *\/\n virtual int id() const { return Id; }\n\n \/**\n * Sets the model id\n *\n * \\param new_id Model's new ID\n *\/\n virtual void id(int) { \/* const ID *\/ }\n};\n\n\/**\n * \\ingroup observation_models\n *\n * \\brief This is the observation model interface with additive noise. The noise\n * is represented as uncorrelated covariance matrix \\f$R\\f$. The model function\n * is of the form\n *\n * \\f$ y = h(x, \\theta) + w \\f$\n *\n * with noise term \\f$w \\sim {\\cal N}(0, R)\\f$. Since the noise is assumed to\n * be uncorrelated white noise, the \\f$R\\f$ matrix has a diagonal form \\f$diag(\n * \\sigma_1, \\sigma_2, \\ldots, \\sigma_M)\\f$. The representation of \\f$R\\f$ is a\n * vector containing the diagonal elements.\n *\n *\n * \\copydoc ObservationModelInterface\n *\/\ntemplate <\n typename Obsrv,\n typename State,\n typename Noise,\n int Id = 0\n>\nclass ANObservationModelInterface\n : public ObservationModelInterface<Obsrv, State, Noise, Id>\n{\npublic:\n \/**\n * Evaluates the model function \\f$y = h(x)\\f$ where \\f$x\\f$ is the state.\n *\n * \\param state The state variable \\f$x\\f$\n * \\param delta_time Prediction time\n *\/\n virtual Obsrv predict_obsrv(const State& state,\n double delta_time) = 0;\n\n \/**\n * \\return Noise covariance \\f$R = diag(\\sigma_1, \\sigma_2, \\ldots,\n * \\sigma_M)\\f$ as a column vector containing the \\f$\\sigma_i\\f$. The noise\n * covariance vector type is same as the noise variate type.\n *\/\n virtual Noise noise_covariance_vector() const = 0;\n};\n\ntemplate <\n typename Obsrv_,\n typename State_,\n typename Noise_,\n int Id = 0\n>\nclass ObservationFunction\n{\npublic:\n typedef Obsrv_ Obsrv;\n typedef State_ State;\n typedef Noise_ Noise;\n\n \/**\n * Evaluates the model function \\f$y = h(x, w)\\f$ where \\f$x\\f$ is the state\n * and \\f$w\\sim {\\cal N}(0, 1)\\f$ is a white noise parameter. Put\n * differently, \\f$y = h(x, w)\\f$ is a sample from the conditional model\n * distribution \\f$p(y \\mid x)\\f$.\n *\n * \\param state The state variable \\f$x\\f$\n * \\param noise The noise term \\f$w\\f$\n * \\param delta_time Prediction time\n *\/\n virtual Obsrv observation(const State& state,\n const Noise& noise) const = 0;\n\n \/**\n * \\return Dimension of the state variable $\\f$x\\f$\n *\/\n virtual int state_dimension() const = 0;\n\n \/**\n * \\return Dimension of the noise term \\f$w\\f$\n *\/\n virtual int noise_dimension() const = 0;\n\n \/**\n * \\return Dimension of the measurement \\f$h(x, w)\\f$\n *\/\n virtual int obsrv_dimension() const = 0;\n\n \/**\n * \\return Model id number\n *\n * In case of multiple sensors of the same kind, this function returns the\n * id of the individual model.\n *\/\n virtual int id() const { return Id; }\n\n \/**\n * Sets the model id\n *\n * \\param new_id Model's new ID\n *\/\n virtual void id(int) { \/* const ID *\/ }\n};\n\n}\n\n#endif\n<commit_msg>Moved ObservationFunction to the top as the main implementation until the old depricated version is removed<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 observation_model_interface.hpp\n * \\date October 2014\n * \\author Jan Issac (jan.issac@gmail.com)\n *\/\n\n#ifndef FL__MODEL__OBSERVATION__OBSERVATION_MODEL_INTERFACE_HPP\n#define FL__MODEL__OBSERVATION__OBSERVATION_MODEL_INTERFACE_HPP\n\n#include <fl\/util\/traits.hpp>\n\nnamespace fl\n{\n\n\ntemplate <\n typename Obsrv_,\n typename State_,\n typename Noise_,\n int Id = 0\n>\nclass ObservationFunction\n{\npublic:\n typedef Obsrv_ Obsrv;\n typedef State_ State;\n typedef Noise_ Noise;\n\n \/**\n * Evaluates the model function \\f$y = h(x, w)\\f$ where \\f$x\\f$ is the state\n * and \\f$w\\sim {\\cal N}(0, 1)\\f$ is a white noise parameter. Put\n * differently, \\f$y = h(x, w)\\f$ is a sample from the conditional model\n * distribution \\f$p(y \\mid x)\\f$.\n *\n * \\param state The state variable \\f$x\\f$\n * \\param noise The noise term \\f$w\\f$\n * \\param delta_time Prediction time\n *\/\n virtual Obsrv observation(const State& state,\n const Noise& noise) const = 0;\n\n \/**\n * \\return Dimension of the state variable $\\f$x\\f$\n *\/\n virtual int state_dimension() const = 0;\n\n \/**\n * \\return Dimension of the noise term \\f$w\\f$\n *\/\n virtual int noise_dimension() const = 0;\n\n \/**\n * \\return Dimension of the measurement \\f$h(x, w)\\f$\n *\/\n virtual int obsrv_dimension() const = 0;\n\n \/**\n * \\return Model id number\n *\n * In case of multiple sensors of the same kind, this function returns the\n * id of the individual model.\n *\/\n virtual int id() const { return Id; }\n\n \/**\n * Sets the model id\n *\n * \\param new_id Model's new ID\n *\/\n virtual void id(int) { \/* const ID *\/ }\n};\n\n\n\/**\n * \\ingroup observation_models\n * \\interface ObservationModelInterface\n *\n *\n * Represents the generic observation model interface of the model function\n * \\f$h(x, w, \\theta)\\f$ where \\f$x\\f$ is the state,\n * \\f$w\\sim {\\cal N}(0, 1)\\f$ is a white noise term, and \\f$\\theta\\f$ the\n * model variable parameters.\n *\n * \\tparam Obsrv Measurement type \\f$y = h(x, w, \\theta)\\f$\n * \\tparam State State variate \\f$x\\f$\n * \\tparam Noise White noise variate term \\f$w\\sim {\\cal N}(0, I)\\f$\n * \\tparam Id Model id number\n *\/\ntemplate <\n typename Obsrv,\n typename State,\n typename Noise,\n int Id = 0\n>\nclass ObservationModelInterface\n : public internal::ObsrvModelType\n{\npublic:\n typedef internal::ObsrvModelType ModelType;\n\n \/**\n * Evaluates the model function \\f$y = h(x, w)\\f$ where \\f$x\\f$ is the state\n * and \\f$w\\sim {\\cal N}(0, 1)\\f$ is a white noise parameter. Put\n * differently, \\f$y = h(x, w)\\f$ is a sample from the conditional model\n * distribution \\f$p(y \\mid x)\\f$.\n *\n * \\param state The state variable \\f$x\\f$\n * \\param noise The noise term \\f$w\\f$\n * \\param delta_time Prediction time\n *\/\n virtual Obsrv predict_obsrv(const State& state,\n const Noise& noise,\n double delta_time) = 0;\n\n \/**\n * \\return Dimension of the state variable $\\f$x\\f$\n *\/\n virtual int state_dimension() const = 0;\n\n \/**\n * \\return Dimension of the noise term \\f$w\\f$\n *\/\n virtual int noise_dimension() const = 0;\n\n \/**\n * \\return Dimension of the measurement \\f$h(x, w)\\f$\n *\/\n virtual int obsrv_dimension() const = 0;\n\n \/**\n * \\return Model id number\n *\n * In case of multiple sensors of the same kind, this function returns the\n * id of the individual model.\n *\/\n virtual int id() const { return Id; }\n\n \/**\n * Sets the model id\n *\n * \\param new_id Model's new ID\n *\/\n virtual void id(int) { \/* const ID *\/ }\n};\n\n\/**\n * \\ingroup observation_models\n *\n * \\brief This is the observation model interface with additive noise. The noise\n * is represented as uncorrelated covariance matrix \\f$R\\f$. The model function\n * is of the form\n *\n * \\f$ y = h(x, \\theta) + w \\f$\n *\n * with noise term \\f$w \\sim {\\cal N}(0, R)\\f$. Since the noise is assumed to\n * be uncorrelated white noise, the \\f$R\\f$ matrix has a diagonal form \\f$diag(\n * \\sigma_1, \\sigma_2, \\ldots, \\sigma_M)\\f$. The representation of \\f$R\\f$ is a\n * vector containing the diagonal elements.\n *\n *\n * \\copydoc ObservationModelInterface\n *\/\ntemplate <\n typename Obsrv,\n typename State,\n typename Noise,\n int Id = 0\n>\nclass ANObservationModelInterface\n : public ObservationModelInterface<Obsrv, State, Noise, Id>\n{\npublic:\n \/**\n * Evaluates the model function \\f$y = h(x)\\f$ where \\f$x\\f$ is the state.\n *\n * \\param state The state variable \\f$x\\f$\n * \\param delta_time Prediction time\n *\/\n virtual Obsrv predict_obsrv(const State& state,\n double delta_time) = 0;\n\n \/**\n * \\return Noise covariance \\f$R = diag(\\sigma_1, \\sigma_2, \\ldots,\n * \\sigma_M)\\f$ as a column vector containing the \\f$\\sigma_i\\f$. The noise\n * covariance vector type is same as the noise variate type.\n *\/\n virtual Noise noise_covariance_vector() const = 0;\n};\n\n}\n\n#endif\n<|endoftext|>"} {"text":"<commit_before><commit_msg>webdav: fix locking in webdav_ucp::Content::getResourceType()<commit_after><|endoftext|>"} {"text":"<commit_before>\/\/\/\n\/\/\/ @file S2_easy_libdivide.cpp\n\/\/\/ @brief This is an optimized version of S2_easy which uses\n\/\/\/ libdivide. libdivide allows to replace expensive integer\n\/\/\/ divides with comparatively cheap multiplication and\n\/\/\/ bitshifts.\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 <PiTable.hpp>\n#include <primecount-internal.hpp>\n#include <primesieve.hpp>\n#include <generate.hpp>\n#include <int128_t.hpp>\n#include <min.hpp>\n#include <imath.hpp>\n#include <S2Status.hpp>\n#include <S2.hpp>\n#include <json.hpp>\n\n#include <libdivide.h>\n#include <stdint.h>\n#include <vector>\n\n#ifdef _OPENMP\n #include <omp.h>\n#endif\n\nusing namespace std;\nusing namespace primecount;\n\nnamespace {\n\ntemplate <typename T>\nvoid backup(T x,\n int64_t y,\n int64_t z,\n int64_t c,\n int64_t start,\n int64_t pi_x13,\n T s2_easy,\n double percent,\n double time)\n{\n auto j = load_backup();\n\n j[\"S2_easy\"][\"x\"] = to_string(x);\n j[\"S2_easy\"][\"y\"] = y;\n j[\"S2_easy\"][\"z\"] = z;\n j[\"S2_easy\"][\"c\"] = c;\n j[\"S2_easy\"][\"start\"] = start;\n j[\"S2_easy\"][\"pi_x13\"] = pi_x13;\n j[\"S2_easy\"][\"s2_easy\"] = to_string(s2_easy);\n j[\"S2_easy\"][\"percent\"] = percent;\n j[\"S2_easy\"][\"seconds\"] = get_wtime() - time;\n\n store_backup(j);\n}\n\ntemplate <typename T>\nvoid print_resume(T x,\n int64_t start,\n int64_t pi_x13,\n T s2_easy,\n double seconds,\n double percent)\n{\n if (!print_variables())\n print_log(\"\");\n\n print_log(\"=== Resuming from \" + backup_file() + \" ===\");\n print_log(\"start\", start);\n print_log(\"pi_x13\", pi_x13);\n print_log(\"s2_easy\", s2_easy);\n print_log_seconds(seconds);\n print_status(percent, x);\n}\n\ntemplate <typename T>\nbool resume(T x,\n int64_t y,\n int64_t z,\n int64_t c,\n int64_t& start,\n int64_t& pi_x13,\n T& s2_easy,\n double& time)\n{\n auto j = load_backup();\n\n if (is_resume(j, \"S2_easy\", x, y, z))\n {\n double percent = j[\"S2_easy\"][\"percent\"];\n double seconds = j[\"S2_easy\"][\"seconds\"];\n\n start = j[\"S2_easy\"][\"start\"];\n pi_x13 = j[\"S2_easy\"][\"pi_x13\"];\n s2_easy = calculator::eval<T>(j[\"S2_easy\"][\"s2_easy\"]);\n time = get_wtime() - seconds;\n print_resume(x, start, pi_x13, s2_easy, seconds, percent);\n\n return true;\n }\n\n return false;\n}\n\nusing fastdiv_t = libdivide::divider<uint64_t, libdivide::BRANCHFREE>;\n\ntemplate <typename T>\nbool is_libdivide(T x)\n{\n return x <= numeric_limits<uint64_t>::max();\n}\n\ntemplate <typename Primes>\nvector<fastdiv_t>\nlibdivide_vector(Primes& primes)\n{\n return vector<fastdiv_t>(primes.begin(), primes.end());\n}\n\n\/\/\/ Calculate the contribution of the clustered easy\n\/\/\/ leaves and the sparse easy leaves.\n\/\/\/\ntemplate <typename T, typename Primes>\nT S2_easy_OpenMP(T x,\n int64_t y,\n int64_t z,\n int64_t c,\n Primes& primes,\n int threads,\n double& time)\n{\n T s2_easy = 0;\n int64_t start;\n int64_t pi_x13;\n double backup_time = get_wtime();\n bool is_resume = resume(x, y, z, c, start, pi_x13, s2_easy, time);\n\n if (is_resume && start >= pi_x13)\n return s2_easy;\n\n PiTable pi(y);\n S2Status status(x);\n auto fastdiv = libdivide_vector(primes);\n\n int64_t pi_sqrty = pi[isqrt(y)];\n int64_t x13 = iroot<3>(x);\n int64_t max_dist = 1;\n threads = ideal_num_threads(threads, x13, 1000);\n\n if (!is_resume)\n {\n start = max(c, pi_sqrty) + 1;\n pi_x13 = pi[x13];\n }\n\n while (start <= pi_x13)\n {\n int64_t stop = min(start + max_dist * threads, pi_x13);\n\n #pragma omp parallel for schedule(dynamic) num_threads(threads) reduction(+: s2_easy)\n for (int64_t b = start; b <= stop; b++)\n {\n int64_t prime = primes[b];\n T x2 = x \/ prime;\n int64_t min_trivial = min(x2 \/ prime, y);\n int64_t min_clustered = (int64_t) isqrt(x2);\n int64_t min_sparse = z \/ prime;\n\n min_clustered = in_between(prime, min_clustered, y);\n min_sparse = in_between(prime, min_sparse, y);\n\n int64_t l = pi[min_trivial];\n int64_t pi_min_clustered = pi[min_clustered];\n int64_t pi_min_sparse = pi[min_sparse];\n\n if (is_libdivide(x2))\n {\n \/\/ Find all clustered easy leaves:\n \/\/ n = primes[b] * primes[l]\n \/\/ x \/ n <= y && phi(x \/ n, b - 1) == phi(x \/ m, b - 1)\n \/\/ where phi(x \/ n, b - 1) = pi(x \/ n) - b + 2\n while (l > pi_min_clustered)\n {\n int64_t xn = (uint64_t) x2 \/ fastdiv[l];\n int64_t phi_xn = pi[xn] - b + 2;\n int64_t xm = (uint64_t) x2 \/ fastdiv[b + phi_xn - 1];\n int64_t l2 = pi[xm];\n s2_easy += phi_xn * (l - l2);\n l = l2;\n }\n\n \/\/ Find all sparse easy leaves:\n \/\/ n = primes[b] * primes[l]\n \/\/ x \/ n <= y && phi(x \/ n, b - 1) = pi(x \/ n) - b + 2\n for (; l > pi_min_sparse; l--)\n {\n int64_t xn = (uint64_t) x2 \/ fastdiv[l];\n s2_easy += pi[xn] - b + 2;\n }\n }\n else\n {\n \/\/ Find all clustered easy leaves:\n \/\/ n = primes[b] * primes[l]\n \/\/ x \/ n <= y && phi(x \/ n, b - 1) == phi(x \/ m, b - 1)\n \/\/ where phi(x \/ n, b - 1) = pi(x \/ n) - b + 2\n while (l > pi_min_clustered)\n {\n int64_t xn = (int64_t) (x2 \/ primes[l]);\n int64_t phi_xn = pi[xn] - b + 2;\n int64_t xm = (int64_t) (x2 \/ primes[b + phi_xn - 1]);\n int64_t l2 = pi[xm];\n s2_easy += phi_xn * (l - l2);\n l = l2;\n }\n\n \/\/ Find all sparse easy leaves:\n \/\/ n = primes[b] * primes[l]\n \/\/ x \/ n <= y && phi(x \/ n, b - 1) = pi(x \/ n) - b + 2\n for (; l > pi_min_sparse; l--)\n {\n int64_t xn = (int64_t) (x2 \/ primes[l]);\n s2_easy += pi[xn] - b + 2;\n }\n }\n\n if (is_print())\n status.print(b, pi_x13);\n }\n\n start = stop + 1;\n\n if (get_wtime() - backup_time < 300)\n max_dist *= 2;\n else\n {\n max_dist = ceil_div(max_dist, 2);\n double percent = status.getPercent(start, pi_x13, start, pi_x13);\n backup(x, y, z, c, start, pi_x13, s2_easy, percent, time);\n backup_time = get_wtime();\n }\n }\n\n backup(x, y, z, c, pi_x13, pi_x13, s2_easy, 100, time);\n\n return s2_easy;\n}\n\n} \/\/ namespace\n\nnamespace primecount {\n\nint64_t S2_easy(int64_t x,\n int64_t y,\n int64_t z,\n int64_t c,\n int threads)\n{\n#ifdef HAVE_MPI\n if (mpi_num_procs() > 1)\n return S2_easy_mpi(x, y, z, c, threads);\n#endif\n\n print(\"\");\n print(\"=== S2_easy(x, y) ===\");\n print(\"Computation of the easy special leaves\");\n print(x, y, c, threads);\n\n double time = get_wtime();\n auto primes = generate_primes<int32_t>(y);\n int64_t s2_easy = S2_easy_OpenMP((intfast64_t) x, y, z, c, primes, threads, time);\n\n print(\"S2_easy\", s2_easy, time);\n return s2_easy;\n}\n\n#ifdef HAVE_INT128_T\n\nint128_t S2_easy(int128_t x,\n int64_t y,\n int64_t z,\n int64_t c,\n int threads)\n{\n#ifdef HAVE_MPI\n if (mpi_num_procs() > 1)\n return S2_easy_mpi(x, y, z, c, threads);\n#endif\n\n print(\"\");\n print(\"=== S2_easy(x, y) ===\");\n print(\"Computation of the easy special leaves\");\n print(x, y, c, threads);\n\n double time = get_wtime();\n int128_t s2_easy;\n\n \/\/ uses less memory\n if (y <= numeric_limits<uint32_t>::max())\n {\n auto primes = generate_primes<uint32_t>(y);\n s2_easy = S2_easy_OpenMP((intfast128_t) x, y, z, c, primes, threads, time);\n }\n else\n {\n auto primes = generate_primes<int64_t>(y);\n s2_easy = S2_easy_OpenMP((intfast128_t) x, y, z, c, primes, threads, time);\n }\n\n print(\"S2_easy\", s2_easy, time);\n return s2_easy;\n}\n\n#endif\n\n} \/\/ namespace\n<commit_msg>Fix S2_easy logging<commit_after>\/\/\/\n\/\/\/ @file S2_easy_libdivide.cpp\n\/\/\/ @brief This is an optimized version of S2_easy which uses\n\/\/\/ libdivide. libdivide allows to replace expensive integer\n\/\/\/ divides with comparatively cheap multiplication and\n\/\/\/ bitshifts.\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 <PiTable.hpp>\n#include <primecount-internal.hpp>\n#include <primesieve.hpp>\n#include <generate.hpp>\n#include <int128_t.hpp>\n#include <min.hpp>\n#include <imath.hpp>\n#include <S2Status.hpp>\n#include <S2.hpp>\n#include <json.hpp>\n\n#include <libdivide.h>\n#include <stdint.h>\n#include <vector>\n\n#ifdef _OPENMP\n #include <omp.h>\n#endif\n\nusing namespace std;\nusing namespace primecount;\n\nnamespace {\n\ntemplate <typename T>\nvoid backup(T x,\n int64_t y,\n int64_t z,\n int64_t c,\n int64_t start,\n int64_t pi_x13,\n T s2_easy,\n double percent,\n double time)\n{\n auto j = load_backup();\n\n j[\"S2_easy\"][\"x\"] = to_string(x);\n j[\"S2_easy\"][\"y\"] = y;\n j[\"S2_easy\"][\"z\"] = z;\n j[\"S2_easy\"][\"c\"] = c;\n j[\"S2_easy\"][\"start\"] = start;\n j[\"S2_easy\"][\"pi_x13\"] = pi_x13;\n j[\"S2_easy\"][\"s2_easy\"] = to_string(s2_easy);\n j[\"S2_easy\"][\"percent\"] = percent;\n j[\"S2_easy\"][\"seconds\"] = get_wtime() - time;\n\n store_backup(j);\n}\n\ntemplate <typename T>\nvoid print_resume(T x,\n int64_t start,\n int64_t pi_x13,\n T s2_easy,\n double seconds,\n double percent)\n{\n if (!print_variables())\n print_log(\"\");\n\n print_log(\"=== Resuming from \" + backup_file() + \" ===\");\n print_log(\"start\", start);\n print_log(\"pi_x13\", pi_x13);\n print_log(\"s2_easy\", s2_easy);\n print_log_seconds(seconds);\n print_status(percent, x);\n}\n\ntemplate <typename T>\nbool resume(T x,\n int64_t y,\n int64_t z,\n int64_t c,\n int64_t& start,\n int64_t& pi_x13,\n T& s2_easy,\n double& time)\n{\n auto j = load_backup();\n\n if (is_resume(j, \"S2_easy\", x, y, z))\n {\n double percent = j[\"S2_easy\"][\"percent\"];\n double seconds = j[\"S2_easy\"][\"seconds\"];\n\n start = j[\"S2_easy\"][\"start\"];\n pi_x13 = j[\"S2_easy\"][\"pi_x13\"];\n s2_easy = calculator::eval<T>(j[\"S2_easy\"][\"s2_easy\"]);\n time = get_wtime() - seconds;\n print_resume(x, start, pi_x13, s2_easy, seconds, percent);\n\n return true;\n }\n\n return false;\n}\n\nusing fastdiv_t = libdivide::divider<uint64_t, libdivide::BRANCHFREE>;\n\ntemplate <typename T>\nbool is_libdivide(T x)\n{\n return x <= numeric_limits<uint64_t>::max();\n}\n\ntemplate <typename Primes>\nvector<fastdiv_t>\nlibdivide_vector(Primes& primes)\n{\n return vector<fastdiv_t>(primes.begin(), primes.end());\n}\n\n\/\/\/ Calculate the contribution of the clustered easy\n\/\/\/ leaves and the sparse easy leaves.\n\/\/\/\ntemplate <typename T, typename Primes>\nT S2_easy_OpenMP(T x,\n int64_t y,\n int64_t z,\n int64_t c,\n Primes& primes,\n int threads,\n double& time)\n{\n T s2_easy = 0;\n int64_t start;\n int64_t pi_x13;\n double backup_time = get_wtime();\n bool is_resume = resume(x, y, z, c, start, pi_x13, s2_easy, time);\n\n if (is_resume && start >= pi_x13)\n return s2_easy;\n\n PiTable pi(y);\n S2Status status(x);\n auto fastdiv = libdivide_vector(primes);\n\n int64_t pi_sqrty = pi[isqrt(y)];\n int64_t x13 = iroot<3>(x);\n int64_t max_dist = 1;\n threads = ideal_num_threads(threads, x13, 1000);\n\n if (!is_resume)\n {\n start = max(c, pi_sqrty) + 1;\n pi_x13 = pi[x13];\n }\n\n while (start <= pi_x13)\n {\n int64_t stop = min(start + max_dist * threads, pi_x13);\n\n #pragma omp parallel for schedule(dynamic) num_threads(threads) reduction(+: s2_easy)\n for (int64_t b = start; b <= stop; b++)\n {\n int64_t prime = primes[b];\n T x2 = x \/ prime;\n int64_t min_trivial = min(x2 \/ prime, y);\n int64_t min_clustered = (int64_t) isqrt(x2);\n int64_t min_sparse = z \/ prime;\n\n min_clustered = in_between(prime, min_clustered, y);\n min_sparse = in_between(prime, min_sparse, y);\n\n int64_t l = pi[min_trivial];\n int64_t pi_min_clustered = pi[min_clustered];\n int64_t pi_min_sparse = pi[min_sparse];\n\n if (is_libdivide(x2))\n {\n \/\/ Find all clustered easy leaves:\n \/\/ n = primes[b] * primes[l]\n \/\/ x \/ n <= y && phi(x \/ n, b - 1) == phi(x \/ m, b - 1)\n \/\/ where phi(x \/ n, b - 1) = pi(x \/ n) - b + 2\n while (l > pi_min_clustered)\n {\n int64_t xn = (uint64_t) x2 \/ fastdiv[l];\n int64_t phi_xn = pi[xn] - b + 2;\n int64_t xm = (uint64_t) x2 \/ fastdiv[b + phi_xn - 1];\n int64_t l2 = pi[xm];\n s2_easy += phi_xn * (l - l2);\n l = l2;\n }\n\n \/\/ Find all sparse easy leaves:\n \/\/ n = primes[b] * primes[l]\n \/\/ x \/ n <= y && phi(x \/ n, b - 1) = pi(x \/ n) - b + 2\n for (; l > pi_min_sparse; l--)\n {\n int64_t xn = (uint64_t) x2 \/ fastdiv[l];\n s2_easy += pi[xn] - b + 2;\n }\n }\n else\n {\n \/\/ Find all clustered easy leaves:\n \/\/ n = primes[b] * primes[l]\n \/\/ x \/ n <= y && phi(x \/ n, b - 1) == phi(x \/ m, b - 1)\n \/\/ where phi(x \/ n, b - 1) = pi(x \/ n) - b + 2\n while (l > pi_min_clustered)\n {\n int64_t xn = (int64_t) (x2 \/ primes[l]);\n int64_t phi_xn = pi[xn] - b + 2;\n int64_t xm = (int64_t) (x2 \/ primes[b + phi_xn - 1]);\n int64_t l2 = pi[xm];\n s2_easy += phi_xn * (l - l2);\n l = l2;\n }\n\n \/\/ Find all sparse easy leaves:\n \/\/ n = primes[b] * primes[l]\n \/\/ x \/ n <= y && phi(x \/ n, b - 1) = pi(x \/ n) - b + 2\n for (; l > pi_min_sparse; l--)\n {\n int64_t xn = (int64_t) (x2 \/ primes[l]);\n s2_easy += pi[xn] - b + 2;\n }\n }\n\n if (is_print())\n status.print(b, pi_x13);\n }\n\n start = stop + 1;\n\n if (get_wtime() - backup_time < 300)\n max_dist *= 2;\n else\n {\n max_dist = ceil_div(max_dist, 2);\n double percent = status.getPercent(start, pi_x13, start, pi_x13);\n backup(x, y, z, c, start, pi_x13, s2_easy, percent, time);\n backup_time = get_wtime();\n }\n }\n\n backup(x, y, z, c, pi_x13, pi_x13, s2_easy, 100, time);\n\n return s2_easy;\n}\n\n} \/\/ namespace\n\nnamespace primecount {\n\nint64_t S2_easy(int64_t x,\n int64_t y,\n int64_t z,\n int64_t c,\n int threads)\n{\n#ifdef HAVE_MPI\n if (mpi_num_procs() > 1)\n return S2_easy_mpi(x, y, z, c, threads);\n#endif\n\n print_log(\"\");\n print_log(\"=== S2_easy(x, y) ===\");\n print_log(\"Computation of the easy special leaves\");\n print_log(x, y, c, threads);\n\n double time = get_wtime();\n auto primes = generate_primes<int32_t>(y);\n int64_t s2_easy = S2_easy_OpenMP((intfast64_t) x, y, z, c, primes, threads, time);\n\n print_log(\"S2_easy\", s2_easy, time);\n return s2_easy;\n}\n\n#ifdef HAVE_INT128_T\n\nint128_t S2_easy(int128_t x,\n int64_t y,\n int64_t z,\n int64_t c,\n int threads)\n{\n#ifdef HAVE_MPI\n if (mpi_num_procs() > 1)\n return S2_easy_mpi(x, y, z, c, threads);\n#endif\n\n print_log(\"\");\n print_log(\"=== S2_easy(x, y) ===\");\n print_log(\"Computation of the easy special leaves\");\n print_log(x, y, c, threads);\n\n double time = get_wtime();\n int128_t s2_easy;\n\n \/\/ uses less memory\n if (y <= numeric_limits<uint32_t>::max())\n {\n auto primes = generate_primes<uint32_t>(y);\n s2_easy = S2_easy_OpenMP((intfast128_t) x, y, z, c, primes, threads, time);\n }\n else\n {\n auto primes = generate_primes<int64_t>(y);\n s2_easy = S2_easy_OpenMP((intfast128_t) x, y, z, c, primes, threads, time);\n }\n\n print_log(\"S2_easy\", s2_easy, time);\n return s2_easy;\n}\n\n#endif\n\n} \/\/ namespace\n<|endoftext|>"} {"text":"<commit_before>#include \"middling_player.hpp\"\n\n#include <ctime>\n#include <limits>\n\n#include <boost\/random\/discrete_distribution.hpp>\n\n#include \"logger.hpp\"\n#include \"walk_move.hpp\"\n#include \"wall_move.hpp\"\n#include \"exception.hpp\"\n\nstatic boost::log::sources::severity_logger<boost::log::trivial::severity_level> lg;\nstatic int kLookForward = 2;\nstatic int kMinimaxNodes = 0;\n\nnamespace Quoridor {\n\nMiddlingPlayer::MiddlingPlayer(std::shared_ptr<Game> game,\n std::shared_ptr<Pawn> pawn)\n : game_(game), pawn_(pawn), goal_nodes_()\n{\n lg.add_attribute(\"Tag\", blattrs::constant<std::string>(\"middling player\"));\n\n goal_nodes_ = game_->pawn_data(pawn_).goal_nodes;\n\n BOOST_LOG_DEBUG(lg) << \"created new MiddlingPlayer (\" << pawn_->color() << \")\";\n for (auto node : goal_nodes_) {\n BOOST_LOG_DEBUG(lg) << \"goal node: \" << node.row() << \":\" << node.col();\n }\n}\n\nMiddlingPlayer::~MiddlingPlayer()\n{\n}\n\nIMove *MiddlingPlayer::get_move()\n{\n boost::variant<Node, Wall> move;\n kMinimaxNodes = 0;\n double v = get_max_move(*game_, 0, -100, 100, &move);\n BOOST_LOG_DEBUG(lg) << \"got k \" << v << \" (analyzed \" << kMinimaxNodes\n << \" nodes)\";\n\n if (Node *node = boost::get<Node>(&move)) {\n BOOST_LOG_DEBUG(lg) << \"best move is \" << *node;\n return new WalkMove(*node);\n }\n else if (Wall *wall = boost::get<Wall>(&move)) {\n BOOST_LOG_DEBUG(lg) << \"best move is \" << *wall;\n return new WallMove(*wall);\n }\n\n return NULL;\n}\n\ndouble MiddlingPlayer::get_max_move(const Game &game, int depth,\n double a, double b, boost::variant<Node, Wall> *best_move)\n{\n ++kMinimaxNodes;\n\n std::vector<boost::variant<Node, Wall>> moves = game.possible_moves(pawn_);\n for (auto move : moves) {\n Game game_cp = game;\n if (Node *node = boost::get<Node>(&move)) {\n game_cp.move_pawn(*node);\n if (game_cp.is_finished()) {\n if (best_move != NULL) {\n *best_move = *node;\n }\n return a;\n }\n }\n else if (Wall *wall = boost::get<Wall>(&move)) {\n if (game_cp.add_wall(*wall) < 0) {\n continue;\n }\n }\n\n if (depth < kLookForward) {\n game_cp.switch_pawn();\n double val = get_min_move(game_cp, depth + 1, a, b);\n if (val > a) {\n a = val;\n if (best_move != NULL) {\n if (Node *node = boost::get<Node>(&move)) {\n *best_move = *node;\n }\n else if (Wall *wall = boost::get<Wall>(&move)) {\n *best_move = *wall;\n }\n }\n }\n if (b <= a) {\n return a;\n }\n }\n else {\n return evaluate(game_cp);\n }\n }\n\n return a;\n}\n\ndouble MiddlingPlayer::get_min_move(const Game &game, int depth,\n double a, double b)\n{\n ++kMinimaxNodes;\n\n std::vector<boost::variant<Node, Wall>> moves = game.possible_moves(pawn_);\n for (auto move : moves) {\n Game game_cp = game;\n if (Node *node = boost::get<Node>(&move)) {\n game_cp.move_pawn(*node);\n if (game_cp.is_finished()) {\n b = -1.0f;\n return b;\n }\n }\n else if (Wall *wall = boost::get<Wall>(&move)) {\n if (game_cp.add_wall(*wall) < 0) {\n continue;\n }\n }\n\n if (depth < kLookForward) {\n game_cp.switch_pawn();\n b = std::min(b, get_max_move(game_cp, depth + 1, a, b, NULL));\n if (b <= a) {\n return b;\n }\n }\n else {\n return evaluate(game_cp);\n }\n }\n\n return b;\n}\n\ndouble MiddlingPlayer::evaluate(const Game &game) const\n{\n double max_k = 0;\n size_t len = game.shortest_path(game.pawn_data(pawn_).node, goal_nodes_, NULL);\n double k = 1 \/ static_cast<double>(len);\n max_k = std::max(k, max_k);\n\n double rival_max_k = 0;\n for (auto pawn_data : game.pawn_data_list()) {\n if (pawn_data.pawn == pawn_) {\n continue;\n }\n len = game.shortest_path(pawn_data.node, pawn_data.goal_nodes, NULL);\n double k = 1 \/ static_cast<double>(len);\n rival_max_k = std::max(k, rival_max_k);\n }\n\n return max_k - rival_max_k;\n}\n\n} \/* namespace Quoridor *\/\n<commit_msg>Fix logging<commit_after>#include \"middling_player.hpp\"\n\n#include <ctime>\n#include <limits>\n\n#include <boost\/random\/discrete_distribution.hpp>\n\n#include \"logger.hpp\"\n#include \"walk_move.hpp\"\n#include \"wall_move.hpp\"\n#include \"exception.hpp\"\n\nstatic boost::log::sources::severity_logger<boost::log::trivial::severity_level> lg;\nstatic int kLookForward = 2;\nstatic int kMinimaxNodes = 0;\n\nnamespace Quoridor {\n\nMiddlingPlayer::MiddlingPlayer(std::shared_ptr<Game> game,\n std::shared_ptr<Pawn> pawn)\n : game_(game), pawn_(pawn), goal_nodes_()\n{\n lg.add_attribute(\"Tag\", blattrs::constant<std::string>(\"middling player\"));\n\n goal_nodes_ = game_->pawn_data(pawn_).goal_nodes;\n\n BOOST_LOG_DEBUG(lg) << \"created new MiddlingPlayer (\" << pawn_->color() << \")\";\n for (auto node : goal_nodes_) {\n BOOST_LOG_DEBUG(lg) << \"goal node: \" << node.row() << \":\" << node.col();\n }\n}\n\nMiddlingPlayer::~MiddlingPlayer()\n{\n}\n\nIMove *MiddlingPlayer::get_move()\n{\n boost::variant<Node, Wall> move;\n kMinimaxNodes = 0;\n double v = get_max_move(*game_, 0, -100, 100, &move);\n\n BOOST_LOG_DEBUG(lg) << \"best move: \" << move << \" (k \" << v\n << \", analyzed \" << kMinimaxNodes << \" nodes)\";\n\n if (Node *node = boost::get<Node>(&move)) {\n return new WalkMove(*node);\n }\n else if (Wall *wall = boost::get<Wall>(&move)) {\n return new WallMove(*wall);\n }\n\n return NULL;\n}\n\ndouble MiddlingPlayer::get_max_move(const Game &game, int depth,\n double a, double b, boost::variant<Node, Wall> *best_move)\n{\n ++kMinimaxNodes;\n\n std::vector<boost::variant<Node, Wall>> moves = game.possible_moves(pawn_);\n for (auto move : moves) {\n Game game_cp = game;\n if (Node *node = boost::get<Node>(&move)) {\n game_cp.move_pawn(*node);\n if (game_cp.is_finished()) {\n if (best_move != NULL) {\n *best_move = *node;\n }\n return a;\n }\n }\n else if (Wall *wall = boost::get<Wall>(&move)) {\n if (game_cp.add_wall(*wall) < 0) {\n continue;\n }\n }\n\n if (depth < kLookForward) {\n game_cp.switch_pawn();\n double val = get_min_move(game_cp, depth + 1, a, b);\n if (val > a) {\n a = val;\n if (best_move != NULL) {\n if (Node *node = boost::get<Node>(&move)) {\n *best_move = *node;\n }\n else if (Wall *wall = boost::get<Wall>(&move)) {\n *best_move = *wall;\n }\n }\n }\n if (b <= a) {\n return a;\n }\n }\n else {\n return evaluate(game_cp);\n }\n }\n\n return a;\n}\n\ndouble MiddlingPlayer::get_min_move(const Game &game, int depth,\n double a, double b)\n{\n ++kMinimaxNodes;\n\n std::vector<boost::variant<Node, Wall>> moves = game.possible_moves(pawn_);\n for (auto move : moves) {\n Game game_cp = game;\n if (Node *node = boost::get<Node>(&move)) {\n game_cp.move_pawn(*node);\n if (game_cp.is_finished()) {\n b = -1.0f;\n return b;\n }\n }\n else if (Wall *wall = boost::get<Wall>(&move)) {\n if (game_cp.add_wall(*wall) < 0) {\n continue;\n }\n }\n\n if (depth < kLookForward) {\n game_cp.switch_pawn();\n b = std::min(b, get_max_move(game_cp, depth + 1, a, b, NULL));\n if (b <= a) {\n return b;\n }\n }\n else {\n return evaluate(game_cp);\n }\n }\n\n return b;\n}\n\ndouble MiddlingPlayer::evaluate(const Game &game) const\n{\n double max_k = 0;\n size_t len = game.shortest_path(game.pawn_data(pawn_).node, goal_nodes_, NULL);\n double k = 1 \/ static_cast<double>(len);\n max_k = std::max(k, max_k);\n\n double rival_max_k = 0;\n for (auto pawn_data : game.pawn_data_list()) {\n if (pawn_data.pawn == pawn_) {\n continue;\n }\n len = game.shortest_path(pawn_data.node, pawn_data.goal_nodes, NULL);\n double k = 1 \/ static_cast<double>(len);\n rival_max_k = std::max(k, rival_max_k);\n }\n\n return max_k - rival_max_k;\n}\n\n} \/* namespace Quoridor *\/\n<|endoftext|>"} {"text":"<commit_before>#ifndef STAN_MATH_REV_SCAL_FUNCTOR_REDUCE_SUM_HPP\n#define STAN_MATH_REV_SCAL_FUNCTOR_REDUCE_SUM_HPP\n\n#include <stan\/math\/prim\/meta.hpp>\n#include <stan\/math\/rev\/fun\/typedefs.hpp>\n\n#include <tbb\/task_arena.h>\n#include <tbb\/parallel_reduce.h>\n#include <tbb\/blocked_range.h>\n\n#include <iostream>\n#include <iterator>\n#include <vector>\n\nnamespace stan {\nnamespace math {\nnamespace internal {\n\ntemplate <typename ReduceFunction, typename ReturnType, typename M,\n typename... Args>\nstruct reduce_sum_impl<ReduceFunction, require_var_t<ReturnType>, ReturnType, M,\n Args...> {\n struct recursive_reducer {\n size_t num_terms_;\n const std::vector<M>& vmapped_;\n std::tuple<const Args&...> args_tuple_;\n\n double sum_;\n Eigen::VectorXd args_adjoints_;\n\n recursive_reducer(size_t num_terms, const std::vector<M>& vmapped,\n const Args&... args)\n : num_terms_(num_terms),\n vmapped_(vmapped),\n args_tuple_(args...),\n sum_(0.0),\n args_adjoints_(Eigen::VectorXd::Zero(num_terms)) {}\n\n recursive_reducer(recursive_reducer& other, tbb::split)\n : num_terms_(other.num_terms_),\n vmapped_(other.vmapped_),\n args_tuple_(other.args_tuple_),\n sum_(other.sum_),\n args_adjoints_(other.args_adjoints_) {}\n\n template <typename T>\n T& deep_copy(T& arg) {\n return arg;\n }\n\n var deep_copy(const var& arg) { return var(arg.val()); }\n\n std::vector<var> deep_copy(const std::vector<var>& arg) {\n std::vector<var> copy(arg.size());\n for (size_t i = 0; i < arg.size(); ++i) {\n copy[i] = arg[i].val();\n }\n return copy;\n }\n\n template <int RowType, int ColType>\n Eigen::Matrix<var, RowType, ColType> deep_copy(\n const Eigen::Matrix<var, RowType, ColType>& arg) {\n Eigen::Matrix<var, RowType, ColType> copy(arg.size());\n for (size_t i = 0; i < arg.size(); ++i) {\n copy(i) = arg(i).val();\n }\n return copy;\n }\n\n template <typename... Pargs>\n void accumulate_adjoints(double* dest, const var& x, const Pargs&... args) {\n *dest += x.adj();\n accumulate_adjoints(dest + 1, args...);\n }\n\n template <typename... Pargs>\n void accumulate_adjoints(double* dest, const std::vector<var>& x,\n const Pargs&... args) {\n for (size_t i = 0; i < x.size(); ++i) {\n dest[i] += x[i].adj();\n }\n accumulate_adjoints(dest + x.size(), args...);\n }\n\n template <typename... Pargs, int RowType, int ColType>\n void accumulate_adjoints(double* dest,\n const Eigen::Matrix<var, RowType, ColType>& x,\n const Pargs&... args) {\n for (size_t i = 0; i < x.size(); ++i) {\n dest[i] += x(i).adj();\n }\n accumulate_adjoints(dest + x.size(), args...);\n }\n\n template <typename R, typename... Pargs>\n void accumulate_adjoints(double* dest, const R& x, const Pargs&... args) {\n accumulate_adjoints(dest, args...);\n }\n\n void accumulate_adjoints(double*) {}\n\n void operator()(const tbb::blocked_range<size_t>& r) {\n if (r.empty())\n return;\n\n auto start = vmapped_.begin();\n std::advance(start, r.begin());\n auto end = vmapped_.begin();\n std::advance(end, r.end());\n\n const std::vector<M> sub_slice(start, end);\n\n try {\n start_nested();\n\n \/\/ create a deep copy of all var's so that these are not\n \/\/ linked to any outer AD tree\n auto args_tuple_local_copy = apply(\n [&](auto&&... args) { return std::make_tuple(deep_copy(args)...); },\n args_tuple_);\n\n var sub_sum_v = apply(\n [&](auto&&... args) {\n return ReduceFunction()(r.begin(), r.end() - 1, sub_slice,\n args...);\n },\n args_tuple_local_copy);\n\n sub_sum_v.grad();\n\n sum_ += sub_sum_v.val();\n\n \/\/ This should accumulate the adjoints from args_tuple_local_copy into\n \/\/ the memory of args_adjoints_\n apply(\n [&](auto&&... args) {\n accumulate_adjoints(args_adjoints_.data(), args...);\n },\n args_tuple_local_copy);\n } catch (const std::exception& e) {\n recover_memory_nested();\n throw;\n }\n recover_memory_nested();\n }\n\n void join(const recursive_reducer& rhs) {\n sum_ += rhs.sum_;\n args_adjoints_ += rhs.args_adjoints_;\n }\n };\n\n \/\/ Fails to compile if type T does not have callable member size()\n template <typename T>\n using member_size_t = decltype(std::declval<T>().size());\n\n \/\/ TODO(Steve): add requires for generic containers\n template <typename Container,\n require_t<is_detected<Container, member_size_t>>...,\n require_t<is_var<value_type_t<Container>>>..., typename... Pargs>\n size_t count_var_impl(size_t count, const Container& x,\n const Pargs&... args) const {\n return count_var_impl(count + x.size(), args...);\n }\n\n template <typename Container,\n require_t<is_detected<Container, member_size_t>>...,\n require_t<std::is_arithmetic<value_type_t<Container>>>...,\n typename... Pargs>\n size_t count_var_impl(size_t count, const Container& x,\n const Pargs&... args) const {\n return count_var_impl(count, args...);\n }\n\n template <typename... Pargs>\n size_t count_var_impl(size_t count, const var& x,\n const Pargs&... args) const {\n return count_var_impl(count + 1, args...);\n }\n\n template <typename... Pargs, typename Arith, require_arithmetic_t<Arith>...>\n size_t count_var_impl(size_t count, Arith& x, const Pargs&... args) const {\n return count_var_impl(count, args...);\n }\n\n size_t count_var_impl(size_t count) const { return count; }\n\n \/**\n * Count the number of scalars of type T in the input argument list\n *\n * @tparam Pargs Types of input arguments\n * @return Number of scalars of type T in input\n *\/\n template <typename... Pargs>\n size_t count_var(const Pargs&... args) const {\n return count_var_impl(0, args...);\n }\n\n template <typename... Pargs>\n void save_varis(vari** dest, const var& x, const Pargs&... args) const {\n *dest = x.vi_;\n save_varis(dest + 1, args...);\n }\n\n template <typename... Pargs>\n void save_varis(vari** dest, const std::vector<var>& x,\n const Pargs&... args) const {\n for (size_t i = 0; i < x.size(); ++i) {\n dest[i] = x[i].vi_;\n }\n save_varis(dest + x.size(), args...);\n }\n\n template <typename... Pargs, int RowType, int ColType>\n void save_varis(vari** dest, const Eigen::Matrix<var, RowType, ColType>& x,\n const Pargs&... args) const {\n for (size_t i = 0; i < x.size(); ++i) {\n dest[i] = x(i).vi_;\n }\n save_varis(dest + x.size(), args...);\n }\n\n template <typename R, typename... Pargs>\n void save_varis(vari** dest, const R& x, const Pargs&... args) const {\n save_varis(dest, args...);\n }\n\n void save_varis(vari**) const {}\n\n var operator()(const std::vector<M>& vmapped, std::size_t grainsize,\n const Args&... args) const {\n const std::size_t num_jobs = vmapped.size();\n\n if (num_jobs == 0)\n return var(0.0);\n\n const std::size_t num_terms = count_var(args...);\n\n recursive_reducer worker(num_terms, vmapped, args...);\n\n#ifdef STAN_DETERMINISTIC\n tbb::static_partitioner partitioner;\n tbb::parallel_deterministic_reduce(\n tbb::blocked_range<std::size_t>(0, num_jobs, grainsize), worker,\n partitioner);\n#else\n tbb::parallel_reduce(\n tbb::blocked_range<std::size_t>(0, num_jobs, grainsize), worker);\n#endif\n\n vari** varis\n = ChainableStack::instance_->memalloc_.alloc_array<vari*>(num_terms);\n double* partials\n = ChainableStack::instance_->memalloc_.alloc_array<double>(num_terms);\n\n save_varis(varis, args...);\n\n for (size_t i = 0; i < num_terms; ++i) {\n partials[i] = worker.args_adjoints_(i);\n }\n\n return var(new precomputed_gradients_vari(worker.sum_, num_terms, varis,\n partials));\n }\n};\n} \/\/ namespace internal\n\n} \/\/ namespace math\n} \/\/ namespace stan\n\n#endif\n<commit_msg>Make accumulate adjoints accept more types<commit_after>#ifndef STAN_MATH_REV_SCAL_FUNCTOR_REDUCE_SUM_HPP\n#define STAN_MATH_REV_SCAL_FUNCTOR_REDUCE_SUM_HPP\n\n#include <stan\/math\/prim\/meta.hpp>\n#include <stan\/math\/rev\/fun\/typedefs.hpp>\n\n#include <tbb\/task_arena.h>\n#include <tbb\/parallel_reduce.h>\n#include <tbb\/blocked_range.h>\n\n#include <iostream>\n#include <iterator>\n#include <vector>\n\nnamespace stan {\nnamespace math {\nnamespace internal {\n\ntemplate <typename ReduceFunction, typename ReturnType, typename M,\n typename... Args>\nstruct reduce_sum_impl<ReduceFunction, require_var_t<ReturnType>, ReturnType, M,\n Args...> {\n struct recursive_reducer {\n size_t num_terms_;\n const std::vector<M>& vmapped_;\n std::tuple<const Args&...> args_tuple_;\n\n double sum_;\n Eigen::VectorXd args_adjoints_;\n\n recursive_reducer(size_t num_terms, const std::vector<M>& vmapped,\n const Args&... args)\n : num_terms_(num_terms),\n vmapped_(vmapped),\n args_tuple_(args...),\n sum_(0.0),\n args_adjoints_(Eigen::VectorXd::Zero(num_terms)) {}\n\n recursive_reducer(recursive_reducer& other, tbb::split)\n : num_terms_(other.num_terms_),\n vmapped_(other.vmapped_),\n args_tuple_(other.args_tuple_),\n sum_(other.sum_),\n args_adjoints_(other.args_adjoints_) {}\n\n template <typename T>\n T& deep_copy(T& arg) {\n return arg;\n }\n\n var deep_copy(const var& arg) { return var(arg.val()); }\n\n std::vector<var> deep_copy(const std::vector<var>& arg) {\n std::vector<var> copy(arg.size());\n for (size_t i = 0; i < arg.size(); ++i) {\n copy[i] = arg[i].val();\n }\n return copy;\n }\n\n template <int RowType, int ColType>\n Eigen::Matrix<var, RowType, ColType> deep_copy(\n const Eigen::Matrix<var, RowType, ColType>& arg) {\n Eigen::Matrix<var, RowType, ColType> copy(arg.size());\n for (size_t i = 0; i < arg.size(); ++i) {\n copy(i) = arg(i).val();\n }\n return copy;\n }\n\n template <typename... Pargs>\n void accumulate_adjoints(double* dest, const var& x, const Pargs&... args) {\n *dest += x.adj();\n accumulate_adjoints(dest + 1, args...);\n }\n\n \/\/ Works with anything that has operator[Integral] defined\n template <typename... Pargs, typename Vec, require_vector_like_vt<is_var, Vec>...>\n void accumulate_adjoints(double* dest, const Vec& x,\n const Pargs&... args) {\n for (size_t i = 0; i < x.size(); ++i) {\n dest[i] += x[i].adj();\n }\n accumulate_adjoints(dest + x.size(), args...);\n }\n \/\/ Fails to compile if type T does not have member operator(Integral)\n template <typename T>\n using operator_paren_access_t = decltype(std::declval<T>()(int{}));\n\n \/\/ Works on anything with a operator()\n template <typename... Pargs, typename Mat, require_t<is_detected<Mat, operator_paren_access_t>>...,\n require_t<is_var<value_type_t<Mat>>>...>\n void accumulate_adjoints(double* dest,\n const Mat& x,\n const Pargs&... args) {\n for (size_t i = 0; i < x.size(); ++i) {\n dest[i] += x(i).adj();\n }\n accumulate_adjoints(dest + x.size(), args...);\n }\n\n \/\/ Anything with a scalar type of Arithmetic gets tossed\n template <typename Arith, require_arithmetic_t<scalar_type_t<Arith>>..., typename... Pargs>\n void accumulate_adjoints(double* dest, Arith&& x, const Pargs&... args) {\n accumulate_adjoints(dest, args...);\n }\n\n void accumulate_adjoints(double*) {}\n\n void operator()(const tbb::blocked_range<size_t>& r) {\n if (r.empty())\n return;\n\n auto start = vmapped_.begin();\n std::advance(start, r.begin());\n auto end = vmapped_.begin();\n std::advance(end, r.end());\n\n const std::vector<M> sub_slice(start, end);\n\n try {\n start_nested();\n\n \/\/ create a deep copy of all var's so that these are not\n \/\/ linked to any outer AD tree\n auto args_tuple_local_copy = apply(\n [&](auto&&... args) { return std::make_tuple(deep_copy(args)...); },\n args_tuple_);\n\n var sub_sum_v = apply(\n [&](auto&&... args) {\n return ReduceFunction()(r.begin(), r.end() - 1, sub_slice,\n args...);\n },\n args_tuple_local_copy);\n\n sub_sum_v.grad();\n\n sum_ += sub_sum_v.val();\n\n \/\/ This should accumulate the adjoints from args_tuple_local_copy into\n \/\/ the memory of args_adjoints_\n apply(\n [&](auto&&... args) {\n accumulate_adjoints(args_adjoints_.data(), args...);\n },\n args_tuple_local_copy);\n } catch (const std::exception& e) {\n recover_memory_nested();\n throw;\n }\n recover_memory_nested();\n }\n\n void join(const recursive_reducer& rhs) {\n sum_ += rhs.sum_;\n args_adjoints_ += rhs.args_adjoints_;\n }\n };\n\n \/\/ Fails to compile if type T does not have callable member size()\n template <typename T>\n using member_size_t = decltype(std::declval<T>().size());\n\n \/\/ TODO(Steve): add requires for generic containers\n template <typename Container,\n require_t<is_detected<Container, member_size_t>>...,\n require_t<is_var<value_type_t<Container>>>..., typename... Pargs>\n size_t count_var_impl(size_t count, const Container& x,\n const Pargs&... args) const {\n return count_var_impl(count + x.size(), args...);\n }\n\n template <typename Container,\n require_t<is_detected<Container, member_size_t>>...,\n require_t<std::is_arithmetic<value_type_t<Container>>>...,\n typename... Pargs>\n size_t count_var_impl(size_t count, const Container& x,\n const Pargs&... args) const {\n return count_var_impl(count, args...);\n }\n\n template <typename... Pargs>\n size_t count_var_impl(size_t count, const var& x,\n const Pargs&... args) const {\n return count_var_impl(count + 1, args...);\n }\n\n template <typename... Pargs, typename Arith, require_arithmetic_t<Arith>...>\n size_t count_var_impl(size_t count, Arith& x, const Pargs&... args) const {\n return count_var_impl(count, args...);\n }\n\n size_t count_var_impl(size_t count) const { return count; }\n\n \/**\n * Count the number of scalars of type T in the input argument list\n *\n * @tparam Pargs Types of input arguments\n * @return Number of scalars of type T in input\n *\/\n template <typename... Pargs>\n size_t count_var(const Pargs&... args) const {\n return count_var_impl(0, args...);\n }\n\n template <typename... Pargs>\n void save_varis(vari** dest, const var& x, const Pargs&... args) const {\n *dest = x.vi_;\n save_varis(dest + 1, args...);\n }\n\n template <typename... Pargs>\n void save_varis(vari** dest, const std::vector<var>& x,\n const Pargs&... args) const {\n for (size_t i = 0; i < x.size(); ++i) {\n dest[i] = x[i].vi_;\n }\n save_varis(dest + x.size(), args...);\n }\n\n template <typename... Pargs, int RowType, int ColType>\n void save_varis(vari** dest, const Eigen::Matrix<var, RowType, ColType>& x,\n const Pargs&... args) const {\n for (size_t i = 0; i < x.size(); ++i) {\n dest[i] = x(i).vi_;\n }\n save_varis(dest + x.size(), args...);\n }\n\n template <typename R, typename... Pargs>\n void save_varis(vari** dest, const R& x, const Pargs&... args) const {\n save_varis(dest, args...);\n }\n\n void save_varis(vari**) const {}\n\n var operator()(const std::vector<M>& vmapped, std::size_t grainsize,\n const Args&... args) const {\n const std::size_t num_jobs = vmapped.size();\n\n if (num_jobs == 0)\n return var(0.0);\n\n const std::size_t num_terms = count_var(args...);\n\n recursive_reducer worker(num_terms, vmapped, args...);\n\n#ifdef STAN_DETERMINISTIC\n tbb::static_partitioner partitioner;\n tbb::parallel_deterministic_reduce(\n tbb::blocked_range<std::size_t>(0, num_jobs, grainsize), worker,\n partitioner);\n#else\n tbb::parallel_reduce(\n tbb::blocked_range<std::size_t>(0, num_jobs, grainsize), worker);\n#endif\n\n vari** varis\n = ChainableStack::instance_->memalloc_.alloc_array<vari*>(num_terms);\n double* partials\n = ChainableStack::instance_->memalloc_.alloc_array<double>(num_terms);\n\n save_varis(varis, args...);\n\n for (size_t i = 0; i < num_terms; ++i) {\n partials[i] = worker.args_adjoints_(i);\n }\n\n return var(new precomputed_gradients_vari(worker.sum_, num_terms, varis,\n partials));\n }\n};\n} \/\/ namespace internal\n\n} \/\/ namespace math\n} \/\/ namespace stan\n\n#endif\n<|endoftext|>"} {"text":"<commit_before>\/\/ Copyright 2021 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 \"src\/default_addresses.h\"\n\n#include \"src\/host_manager.hpp\"\n#include \"src\/nemora.hpp\"\n\n#include <arpa\/inet.h>\n#include <fmt\/format.h>\n\n#include <CLI\/CLI.hpp>\n#include <phosphor-logging\/log.hpp>\n\n#include <csignal>\n#include <cstdint>\n#include <iostream>\n#include <regex>\n#include <string>\n#include <thread>\n#include <unordered_map>\n#include <vector>\n\nusing fmt::format;\nusing phosphor::logging::level;\nusing phosphor::logging::log;\n\nnamespace\n{\nvolatile std::sig_atomic_t gSignalStatus;\n}\n\nvoid signal_handler(int signal)\n{\n gSignalStatus = signal;\n}\n\nvoid NemoraUdpPoll(Nemora* nemora)\n{\n while (!gSignalStatus)\n {\n nemora->UdpPoll();\n }\n}\n\nint main(int argc, char* argv[])\n{\n \/\/ Init arg parser\n CLI::App app(\"gBMC-side Nemora implementation (POST-code only)\");\n\n std::string udp_address_v4_str;\n auto* ipv4_option = app.add_option(\n \"--udp4\", udp_address_v4_str,\n \"Target IPv4 address for UDP communication, i.e., POST streaming.\",\n true);\n\n std::string udp_address_v6_str;\n auto* ipv6_option = app.add_option(\n \"--udp6\", udp_address_v6_str,\n \"Target IPv6 address for UDP communication, i.e., POST streaming.\",\n true);\n\n \/\/ interface is last, and required.\n std::string iface_name;\n app.add_option(\"interface\", iface_name,\n \"Network interface for TCP communication. Ex: eth0\")\n ->required();\n\n CLI11_PARSE(app, argc, argv);\n\n in_addr udp_address_v4;\n udp_address_v4.s_addr = htonl(DEFAULT_ADDRESSES_TARGET_IP);\n if (*ipv4_option &&\n !inet_pton(AF_INET, udp_address_v4_str.c_str(), &udp_address_v4))\n {\n std::cerr << \"Invalid IPv4 address supplied: \" << udp_address_v4_str\n << std::endl;\n }\n\n \/\/ The value from default_addresses.h is designed for LWIP which EC uses,\n \/\/ and needs to be translated to network byte order.\n in6_addr udp_address_v6;\n uint32_t default_addr_6[4] = DEFAULT_ADDRESSES_TARGET_IP6;\n\n auto htonl_inplace = [](uint32_t& i) { i = htonl(i); };\n std::for_each(std::begin(default_addr_6), std::end(default_addr_6),\n htonl_inplace);\n std::memcpy(udp_address_v6.s6_addr, default_addr_6, sizeof(default_addr_6));\n\n if (*ipv6_option &&\n !inet_pton(AF_INET6, udp_address_v6_str.c_str(), &udp_address_v6))\n {\n std::cerr << \"Invalid IPv6 address supplied: \" << udp_address_v6_str\n << std::endl;\n }\n\n log<level::INFO>(\"Start Nemora...\");\n Nemora nemora(iface_name, udp_address_v4, udp_address_v6);\n\n \/\/ Install a signal handler\n std::signal(SIGINT, signal_handler);\n\n std::thread udp(NemoraUdpPoll, &nemora);\n\n udp.join();\n\n return EXIT_SUCCESS;\n}\n<commit_msg>nemora-postd: update add_option function<commit_after>\/\/ Copyright 2021 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 \"src\/default_addresses.h\"\n\n#include \"src\/host_manager.hpp\"\n#include \"src\/nemora.hpp\"\n\n#include <arpa\/inet.h>\n#include <fmt\/format.h>\n\n#include <CLI\/CLI.hpp>\n#include <phosphor-logging\/log.hpp>\n\n#include <csignal>\n#include <cstdint>\n#include <iostream>\n#include <regex>\n#include <string>\n#include <thread>\n#include <unordered_map>\n#include <vector>\n\nusing fmt::format;\nusing phosphor::logging::level;\nusing phosphor::logging::log;\n\nnamespace\n{\nvolatile std::sig_atomic_t gSignalStatus;\n}\n\nvoid signal_handler(int signal)\n{\n gSignalStatus = signal;\n}\n\nvoid NemoraUdpPoll(Nemora* nemora)\n{\n while (!gSignalStatus)\n {\n nemora->UdpPoll();\n }\n}\n\nint main(int argc, char* argv[])\n{\n \/\/ Init arg parser\n CLI::App app(\"gBMC-side Nemora implementation (POST-code only)\");\n\n std::string udp_address_v4_str;\n auto* ipv4_option = app.add_option(\"--udp4\", udp_address_v4_str,\n \"Target IPv4 address for UDP \"\n \"communication, i.e., POST streaming.\")\n ->capture_default_str();\n\n std::string udp_address_v6_str;\n auto* ipv6_option = app.add_option(\"--udp6\", udp_address_v6_str,\n \"Target IPv6 address for UDP \"\n \"communication, i.e., POST streaming.\")\n ->capture_default_str();\n\n \/\/ interface is last, and required.\n std::string iface_name;\n app.add_option(\"interface\", iface_name,\n \"Network interface for TCP communication. Ex: eth0\")\n ->required();\n\n CLI11_PARSE(app, argc, argv);\n\n in_addr udp_address_v4;\n udp_address_v4.s_addr = htonl(DEFAULT_ADDRESSES_TARGET_IP);\n if (*ipv4_option &&\n !inet_pton(AF_INET, udp_address_v4_str.c_str(), &udp_address_v4))\n {\n std::cerr << \"Invalid IPv4 address supplied: \" << udp_address_v4_str\n << std::endl;\n }\n\n \/\/ The value from default_addresses.h is designed for LWIP which EC uses,\n \/\/ and needs to be translated to network byte order.\n in6_addr udp_address_v6;\n uint32_t default_addr_6[4] = DEFAULT_ADDRESSES_TARGET_IP6;\n\n auto htonl_inplace = [](uint32_t& i) { i = htonl(i); };\n std::for_each(std::begin(default_addr_6), std::end(default_addr_6),\n htonl_inplace);\n std::memcpy(udp_address_v6.s6_addr, default_addr_6, sizeof(default_addr_6));\n\n if (*ipv6_option &&\n !inet_pton(AF_INET6, udp_address_v6_str.c_str(), &udp_address_v6))\n {\n std::cerr << \"Invalid IPv6 address supplied: \" << udp_address_v6_str\n << std::endl;\n }\n\n log<level::INFO>(\"Start Nemora...\");\n Nemora nemora(iface_name, udp_address_v4, udp_address_v6);\n\n \/\/ Install a signal handler\n std::signal(SIGINT, signal_handler);\n\n std::thread udp(NemoraUdpPoll, &nemora);\n\n udp.join();\n\n return EXIT_SUCCESS;\n}\n<|endoftext|>"} {"text":"<commit_before>\/**\n * @file\n *\n * @brief A listener reacting to matches for the grammar rules defined in `YAML.g4`\n *\n * @copyright BSD License (see LICENSE.md or https:\/\/www.libelektra.org)\n *\/\n\n#include <iostream>\n\n#include \"YAMLBaseListener.h\"\n\nusing antlr::YAMLBaseListener;\nusing KeyContext = antlr::YAMLParser::KeyContext;\nusing ValueContext = antlr::YAMLParser::ValueContext;\n\nusing std::cout;\nusing std::endl;\n\nclass KeyListener : public YAMLBaseListener\n{\npublic:\n\tvoid exitKey (KeyContext * context)\n\t{\n\t\tcout << \"Found name “\" << context->getText () << \"”\" << endl;\n\t}\n\n\tvoid exitValue (ValueContext * context)\n\t{\n\t\tcout << \"Found value “\" << context->getText () << \"”\" << endl;\n\t}\n};\n<commit_msg>Yan LR: Use override specifier<commit_after>\/**\n * @file\n *\n * @brief A listener reacting to matches for the grammar rules defined in `YAML.g4`\n *\n * @copyright BSD License (see LICENSE.md or https:\/\/www.libelektra.org)\n *\/\n\n#include <iostream>\n\n#include \"YAMLBaseListener.h\"\n\nusing antlr::YAMLBaseListener;\nusing KeyContext = antlr::YAMLParser::KeyContext;\nusing ValueContext = antlr::YAMLParser::ValueContext;\n\nusing std::cout;\nusing std::endl;\n\nclass KeyListener : public YAMLBaseListener\n{\npublic:\n\tvoid exitKey (KeyContext * context) override\n\t{\n\t\tcout << \"Found name “\" << context->getText () << \"”\" << endl;\n\t}\n\n\tvoid exitValue (ValueContext * context) override\n\t{\n\t\tcout << \"Found value “\" << context->getText () << \"”\" << endl;\n\t}\n};\n<|endoftext|>"} {"text":"<commit_before>\/*****************************************************************************\n * \n * This file is part of Mapnik (c++ mapping toolkit)\n *\n * Copyright (C) 2010 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 <iostream>\n#include <sstream>\n#include <vector>\n\/\/#include <string>\n\n#include <mapnik\/marker.hpp>\n#include <mapnik\/marker_cache.hpp>\n#include <mapnik\/image_util.hpp>\n#include <mapnik\/graphics.hpp>\n#include <mapnik\/svg\/svg_path_adapter.hpp>\n#include <mapnik\/svg\/svg_renderer.hpp>\n#include <mapnik\/svg\/svg_path_attributes.hpp>\n\n#include <boost\/algorithm\/string.hpp>\n#include <boost\/filesystem\/operations.hpp>\n#include <boost\/program_options.hpp>\n\n#include \"agg_rasterizer_scanline_aa.h\"\n#include \"agg_basics.h\"\n#include \"agg_rendering_buffer.h\"\n#include \"agg_renderer_base.h\"\n#include \"agg_pixfmt_rgba.h\"\n#include \"agg_scanline_u.h\"\n\n\nint main (int argc,char** argv) \n{\n namespace po = boost::program_options;\n \n bool verbose=false;\n std::vector<std::string> svg_files;\n \n try\n {\n po::options_description desc(\"svg2png utility\");\n desc.add_options()\n (\"help,h\", \"produce usage message\")\n (\"version,V\",\"print version string\")\n (\"verbose,v\",\"verbose output\")\n (\"svg\",po::value<std::vector<std::string> >(),\"svg file to read\")\n ;\n \n po::positional_options_description p;\n p.add(\"svg\",-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 0.3.0\" << std::endl;\n return 1;\n }\n\n if (vm.count(\"help\")) \n {\n std::clog << desc << std::endl;\n return 1;\n }\n if (vm.count(\"verbose\")) \n {\n verbose = true;\n }\n\n if (vm.count(\"svg\"))\n {\n svg_files=vm[\"svg\"].as< std::vector<std::string> >();\n }\n else\n {\n std::clog << \"please provide an svg file!\" << std::endl;\n return -1;\n }\n\n std::vector<std::string>::const_iterator itr = svg_files.begin();\n if (itr == svg_files.end())\n {\n std::clog << \"no svg files to render\" << std::endl;\n return 0;\n }\n while (itr != svg_files.end())\n {\n\n std::string svg_name (*itr++);\n\n boost::optional<mapnik::marker_ptr> marker_ptr = mapnik::marker_cache::instance()->find(svg_name, false);\n if (marker_ptr) {\n \n mapnik::marker marker = **marker_ptr;\n if (marker.is_vector()) {\n \n typedef agg::pixfmt_rgba32_plain pixfmt;\n typedef agg::renderer_base<pixfmt> renderer_base;\n agg::rasterizer_scanline_aa<> ras_ptr;\n agg::scanline_u8 sl;\n\n double opacity = 1;\n double scale_factor_ = .95;\n int w = marker.width();\n int h = marker.height();\n mapnik::image_32 im(w,h);\n agg::rendering_buffer buf(im.raw_data(), w, h, w * 4);\n pixfmt pixf(buf);\n renderer_base renb(pixf);\n\n mapnik::box2d<double> const& bbox = (*marker.get_vector_data())->bounding_box();\n mapnik::coord<double,2> c = bbox.center();\n \/\/ center the svg marker on '0,0'\n agg::trans_affine mtx = agg::trans_affine_translation(-c.x,-c.y);\n \/\/ apply symbol transformation to get to map space\n mtx *= agg::trans_affine_scaling(scale_factor_);\n \/\/ render the marker at the center of the marker box\n mtx.translate(0.5 * w, 0.5 * h);\n\n mapnik::svg::vertex_stl_adapter<mapnik::svg::svg_path_storage> stl_storage((*marker.get_vector_data())->source());\n mapnik::svg::svg_path_adapter svg_path(stl_storage);\n mapnik::svg::svg_renderer<mapnik::svg::svg_path_adapter,\n agg::pod_bvector<mapnik::svg::path_attributes> > svg_renderer_this(svg_path,\n (*marker.get_vector_data())->attributes());\n\n svg_renderer_this.render(ras_ptr, sl, renb, mtx, opacity, bbox);\n\n boost::algorithm::ireplace_last(svg_name,\".svg\",\".png\");\n mapnik::save_to_file<mapnik::image_data_32>(im.data(),svg_name,\"png\");\n std::ostringstream s;\n s << \"open \" << svg_name;\n system(s.str().c_str());\n }\n }\n }\n }\n catch (...)\n {\n std::clog << \"Exception of unknown type!\" << std::endl;\n return -1;\n }\n\n return 0;\n}\n\n<commit_msg>handle return of system call<commit_after>\/*****************************************************************************\n * \n * This file is part of Mapnik (c++ mapping toolkit)\n *\n * Copyright (C) 2010 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 <iostream>\n#include <sstream>\n#include <vector>\n\/\/#include <string>\n\n#include <mapnik\/marker.hpp>\n#include <mapnik\/marker_cache.hpp>\n#include <mapnik\/image_util.hpp>\n#include <mapnik\/graphics.hpp>\n#include <mapnik\/svg\/svg_path_adapter.hpp>\n#include <mapnik\/svg\/svg_renderer.hpp>\n#include <mapnik\/svg\/svg_path_attributes.hpp>\n\n#include <boost\/algorithm\/string.hpp>\n#include <boost\/filesystem\/operations.hpp>\n#include <boost\/program_options.hpp>\n\n#include \"agg_rasterizer_scanline_aa.h\"\n#include \"agg_basics.h\"\n#include \"agg_rendering_buffer.h\"\n#include \"agg_renderer_base.h\"\n#include \"agg_pixfmt_rgba.h\"\n#include \"agg_scanline_u.h\"\n\n\nint main (int argc,char** argv) \n{\n namespace po = boost::program_options;\n \n bool verbose=false;\n std::vector<std::string> svg_files;\n \n try\n {\n po::options_description desc(\"svg2png utility\");\n desc.add_options()\n (\"help,h\", \"produce usage message\")\n (\"version,V\",\"print version string\")\n (\"verbose,v\",\"verbose output\")\n (\"svg\",po::value<std::vector<std::string> >(),\"svg file to read\")\n ;\n \n po::positional_options_description p;\n p.add(\"svg\",-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 0.3.0\" << std::endl;\n return 1;\n }\n\n if (vm.count(\"help\")) \n {\n std::clog << desc << std::endl;\n return 1;\n }\n if (vm.count(\"verbose\")) \n {\n verbose = true;\n }\n\n if (vm.count(\"svg\"))\n {\n svg_files=vm[\"svg\"].as< std::vector<std::string> >();\n }\n else\n {\n std::clog << \"please provide an svg file!\" << std::endl;\n return -1;\n }\n\n std::vector<std::string>::const_iterator itr = svg_files.begin();\n if (itr == svg_files.end())\n {\n std::clog << \"no svg files to render\" << std::endl;\n return 0;\n }\n while (itr != svg_files.end())\n {\n\n std::string svg_name (*itr++);\n\n boost::optional<mapnik::marker_ptr> marker_ptr = mapnik::marker_cache::instance()->find(svg_name, false);\n if (marker_ptr) {\n \n mapnik::marker marker = **marker_ptr;\n if (marker.is_vector()) {\n \n typedef agg::pixfmt_rgba32_plain pixfmt;\n typedef agg::renderer_base<pixfmt> renderer_base;\n agg::rasterizer_scanline_aa<> ras_ptr;\n agg::scanline_u8 sl;\n\n double opacity = 1;\n double scale_factor_ = .95;\n int w = marker.width();\n int h = marker.height();\n mapnik::image_32 im(w,h);\n agg::rendering_buffer buf(im.raw_data(), w, h, w * 4);\n pixfmt pixf(buf);\n renderer_base renb(pixf);\n\n mapnik::box2d<double> const& bbox = (*marker.get_vector_data())->bounding_box();\n mapnik::coord<double,2> c = bbox.center();\n \/\/ center the svg marker on '0,0'\n agg::trans_affine mtx = agg::trans_affine_translation(-c.x,-c.y);\n \/\/ apply symbol transformation to get to map space\n mtx *= agg::trans_affine_scaling(scale_factor_);\n \/\/ render the marker at the center of the marker box\n mtx.translate(0.5 * w, 0.5 * h);\n\n mapnik::svg::vertex_stl_adapter<mapnik::svg::svg_path_storage> stl_storage((*marker.get_vector_data())->source());\n mapnik::svg::svg_path_adapter svg_path(stl_storage);\n mapnik::svg::svg_renderer<mapnik::svg::svg_path_adapter,\n agg::pod_bvector<mapnik::svg::path_attributes> > svg_renderer_this(svg_path,\n (*marker.get_vector_data())->attributes());\n\n svg_renderer_this.render(ras_ptr, sl, renb, mtx, opacity, bbox);\n\n boost::algorithm::ireplace_last(svg_name,\".svg\",\".png\");\n mapnik::save_to_file<mapnik::image_data_32>(im.data(),svg_name,\"png\");\n std::ostringstream s;\n s << \"open \" << svg_name;\n return system(s.str().c_str());\n }\n }\n }\n }\n catch (...)\n {\n std::clog << \"Exception of unknown type!\" << std::endl;\n return -1;\n }\n\n return 0;\n}\n\n<|endoftext|>"} {"text":"<commit_before>void loadlibs () \n{\n gSystem->Load(\"$(ALICE_ROOT)\/lib\/tgt_$(ALICE_TARGET)\/libminicern\");\n gSystem->Load(\"$(ROOTSYS)\/lib\/libPhysics\");\n gSystem->Load(\"$(ROOTSYS)\/lib\/libEG\");\n gSystem->Load(\"$(ALICE_ROOT)\/lib\/tgt_$(ALICE_TARGET)\/libSTEER\");\n gSystem->Load(\"$(ALICE_ROOT)\/lib\/tgt_$(ALICE_TARGET)\/libTGeant3Dummy\");\n gSystem->Load(\"$(ALICE_ROOT)\/lib\/tgt_$(ALICE_TARGET)\/libdummypythia\");\n gSystem->Load(\"$(ROOTSYS)\/lib\/libEGPythia6\");\n gSystem->Load(\"$(ALICE_ROOT)\/lib\/tgt_$(ALICE_TARGET)\/libEVGEN\");\n gSystem->Load(\"$(ALICE_ROOT)\/lib\/tgt_$(ALICE_TARGET)\/libRALICE\");\n gSystem->Load(\"$(ALICE_ROOT)\/lib\/tgt_$(ALICE_TARGET)\/libFMD\");\n gSystem->Load(\"$(ALICE_ROOT)\/lib\/tgt_$(ALICE_TARGET)\/libMUON\");\n gSystem->Load(\"$(ALICE_ROOT)\/lib\/tgt_$(ALICE_TARGET)\/libPHOS\");\n gSystem->Load(\"$(ALICE_ROOT)\/lib\/tgt_$(ALICE_TARGET)\/libPMD\");\n gSystem->Load(\"$(ALICE_ROOT)\/lib\/tgt_$(ALICE_TARGET)\/libRICH\");\n gSystem->Load(\"$(ALICE_ROOT)\/lib\/tgt_$(ALICE_TARGET)\/libSTRUCT\");\n gSystem->Load(\"$(ALICE_ROOT)\/lib\/tgt_$(ALICE_TARGET)\/libTOF\");\n gSystem->Load(\"$(ALICE_ROOT)\/lib\/tgt_$(ALICE_TARGET)\/libTPC\");\n gSystem->Load(\"$(ALICE_ROOT)\/lib\/tgt_$(ALICE_TARGET)\/libTRD\");\n gSystem->Load(\"$(ALICE_ROOT)\/lib\/tgt_$(ALICE_TARGET)\/libZDC\");\n gSystem->Load(\"$(ALICE_ROOT)\/lib\/tgt_$(ALICE_TARGET)\/libITS\");\n gSystem->Load(\"$(ALICE_ROOT)\/lib\/tgt_$(ALICE_TARGET)\/libCASTOR\");\n gSystem->Load(\"$(ALICE_ROOT)\/lib\/tgt_$(ALICE_TARGET)\/libSTART\");\n}\n<commit_msg>Change libdummypythia to libdummypythia6<commit_after>void loadlibs () \n{\n gSystem->Load(\"$(ALICE_ROOT)\/lib\/tgt_$(ALICE_TARGET)\/libminicern\");\n gSystem->Load(\"$(ROOTSYS)\/lib\/libPhysics\");\n gSystem->Load(\"$(ROOTSYS)\/lib\/libEG\");\n gSystem->Load(\"$(ALICE_ROOT)\/lib\/tgt_$(ALICE_TARGET)\/libSTEER\");\n gSystem->Load(\"$(ALICE_ROOT)\/lib\/tgt_$(ALICE_TARGET)\/libTGeant3Dummy\");\n gSystem->Load(\"$(ALICE_ROOT)\/lib\/tgt_$(ALICE_TARGET)\/libdummypythia6\");\n gSystem->Load(\"$(ROOTSYS)\/lib\/libEGPythia6\");\n gSystem->Load(\"$(ALICE_ROOT)\/lib\/tgt_$(ALICE_TARGET)\/libEVGEN\");\n gSystem->Load(\"$(ALICE_ROOT)\/lib\/tgt_$(ALICE_TARGET)\/libRALICE\");\n gSystem->Load(\"$(ALICE_ROOT)\/lib\/tgt_$(ALICE_TARGET)\/libFMD\");\n gSystem->Load(\"$(ALICE_ROOT)\/lib\/tgt_$(ALICE_TARGET)\/libMUON\");\n gSystem->Load(\"$(ALICE_ROOT)\/lib\/tgt_$(ALICE_TARGET)\/libPHOS\");\n gSystem->Load(\"$(ALICE_ROOT)\/lib\/tgt_$(ALICE_TARGET)\/libPMD\");\n gSystem->Load(\"$(ALICE_ROOT)\/lib\/tgt_$(ALICE_TARGET)\/libRICH\");\n gSystem->Load(\"$(ALICE_ROOT)\/lib\/tgt_$(ALICE_TARGET)\/libSTRUCT\");\n gSystem->Load(\"$(ALICE_ROOT)\/lib\/tgt_$(ALICE_TARGET)\/libTOF\");\n gSystem->Load(\"$(ALICE_ROOT)\/lib\/tgt_$(ALICE_TARGET)\/libTPC\");\n gSystem->Load(\"$(ALICE_ROOT)\/lib\/tgt_$(ALICE_TARGET)\/libTRD\");\n gSystem->Load(\"$(ALICE_ROOT)\/lib\/tgt_$(ALICE_TARGET)\/libZDC\");\n gSystem->Load(\"$(ALICE_ROOT)\/lib\/tgt_$(ALICE_TARGET)\/libITS\");\n gSystem->Load(\"$(ALICE_ROOT)\/lib\/tgt_$(ALICE_TARGET)\/libCASTOR\");\n gSystem->Load(\"$(ALICE_ROOT)\/lib\/tgt_$(ALICE_TARGET)\/libSTART\");\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 \"google\/cloud\/spanner\/internal\/status_utils.h\"\n#include \"google\/cloud\/spanner\/database.h\"\n#include \"google\/cloud\/spanner\/testing\/status_utils.h\"\n#include <gmock\/gmock.h>\n\nnamespace google {\nnamespace cloud {\nnamespace spanner_internal {\nGOOGLE_CLOUD_CPP_INLINE_NAMESPACE_BEGIN\nnamespace {\n\nTEST(StatusUtils, SessionNotFound) {\n Status const session_not_found(StatusCode::kNotFound, \"Session not found\");\n EXPECT_TRUE(IsSessionNotFound(session_not_found));\n\n Status const other_not_found(StatusCode::kNotFound, \"Other not found\");\n EXPECT_FALSE(IsSessionNotFound(other_not_found));\n\n Status const not_not_found(StatusCode::kUnavailable, \"Session not found\");\n EXPECT_FALSE(IsSessionNotFound(not_not_found));\n}\n\nTEST(StatusUtils, SessionNotFoundResourceInfo) {\n auto db = spanner::Database(\"project\", \"instance\", \"database\");\n auto name = db.FullName() + \"\/sessions\/session\";\n EXPECT_TRUE(IsSessionNotFound(spanner_testing::SessionNotFoundError(name)));\n}\n\n} \/\/ namespace\nGOOGLE_CLOUD_CPP_INLINE_NAMESPACE_END\n} \/\/ namespace spanner_internal\n} \/\/ namespace cloud\n} \/\/ namespace google\n<commit_msg>test(spanner): additional test for IsSessionNotFound (#9939)<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 \"google\/cloud\/spanner\/internal\/status_utils.h\"\n#include \"google\/cloud\/spanner\/database.h\"\n#include \"google\/cloud\/spanner\/testing\/status_utils.h\"\n#include \"google\/cloud\/internal\/status_payload_keys.h\"\n#include <gmock\/gmock.h>\n\nnamespace google {\nnamespace cloud {\nnamespace spanner_internal {\nGOOGLE_CLOUD_CPP_INLINE_NAMESPACE_BEGIN\nnamespace {\n\nTEST(StatusUtils, SessionNotFound) {\n Status const session_not_found(StatusCode::kNotFound, \"Session not found\");\n EXPECT_TRUE(IsSessionNotFound(session_not_found)) << session_not_found;\n\n Status const other_not_found(StatusCode::kNotFound, \"Other not found\");\n EXPECT_FALSE(IsSessionNotFound(other_not_found)) << other_not_found;\n\n Status const not_not_found(StatusCode::kUnavailable, \"Session not found\");\n EXPECT_FALSE(IsSessionNotFound(not_not_found)) << not_not_found;\n}\n\nTEST(StatusUtils, SessionNotFoundResourceInfo) {\n auto db = spanner::Database(\"project\", \"instance\", \"database\");\n auto name = db.FullName() + \"\/sessions\/session\";\n auto not_found = spanner_testing::SessionNotFoundError(std::move(name));\n EXPECT_TRUE(IsSessionNotFound(not_found)) << not_found;\n\n \/\/ A status with the right ResourceInfo doesn't need a particular message.\n Status still_not_found(not_found.code(), \"foo bar\", not_found.error_info());\n std::string const key = internal::kStatusPayloadGrpcProto;\n auto payload = internal::GetPayload(not_found, key);\n ASSERT_TRUE(payload.has_value());\n internal::SetPayload(still_not_found, key, *std::move(payload));\n EXPECT_NE(not_found, still_not_found);\n EXPECT_TRUE(IsSessionNotFound(still_not_found)) << still_not_found;\n}\n\n} \/\/ namespace\nGOOGLE_CLOUD_CPP_INLINE_NAMESPACE_END\n} \/\/ namespace spanner_internal\n} \/\/ namespace cloud\n} \/\/ namespace google\n<|endoftext|>"} {"text":"<commit_before>\/\/ This file is part of the dune-hdd project:\n\/\/ http:\/\/users.dune-project.org\/projects\/dune-hdd\n\/\/ Copyright holders: Felix Schindler\n\/\/ License: BSD 2-Clause License (http:\/\/opensource.org\/licenses\/BSD-2-Clause)\n\n#define DUNE_STUFF_FUNCTIONS_DISABLE_CHECKS 1\n\n#ifndef DUNE_STUFF_TEST_MAIN_ENABLE_INFO_LOGGING\n# define DUNE_STUFF_TEST_MAIN_ENABLE_INFO_LOGGING 1\n#endif\n\n\/\/ This one has to come first (includes the config.h)!\n#include <dune\/stuff\/test\/main.hxx>\n\n#if HAVE_ALUGRID\n# include <dune\/stuff\/common\/disable_warnings.hh>\n# include <dune\/grid\/alugrid.hh>\n# include <dune\/stuff\/common\/reenable_warnings.hh>\n\n# include <dune\/stuff\/common\/exceptions.hh>\n\n# include <dune\/stuff\/common\/print.hh>\n# include <dune\/stuff\/common\/float_cmp.hh>\n\n# include <dune\/hdd\/playground\/linearelliptic\/testcases\/ESV2007.hh>\n\n# include \"linearelliptic-swipdg.hh\"\n\nusing namespace Dune;\nusing namespace HDD;\n\n\ntypedef Dune::ALUGrid< 2, 2, Dune::simplex, Dune::conforming > AluConform2dGridType;\n\ntypedef testing::Types< LinearElliptic::TestCases::ESV2007< AluConform2dGridType >\n > AluConform2dTestCases;\n\n\ntemplate< class TestCaseType >\nstruct linearelliptic_SWIPDG_discretization\n : public ::testing::Test\n{\n template< GDT::ChooseSpaceBackend space_backend, Stuff::LA::ChooseBackend la_backend >\n static void eoc_study()\n {\n const TestCaseType test_case;\n test_case.print_header(DSC_LOG_INFO);\n DSC_LOG_INFO << std::endl;\n LinearElliptic::Tests::SWIPDGStudy< TestCaseType, 1, space_backend, la_backend > eoc_study(test_case);\n Stuff::Test::check_eoc_study_for_success(eoc_study, eoc_study.run_eoc(DSC_LOG_INFO));\n } \/\/ ... eoc_study()\n\n# if HAVE_DUNE_FEM\n# if HAVE_DUNE_ISTL\n static void eoc_study_using_fem_and_istl()\n {\n eoc_study< GDT::ChooseSpaceBackend::fem, Stuff::LA::ChooseBackend::istl_sparse >();\n }\n# endif \/\/ HAVE_DUNE_ISTL\n\n# if HAVE_EIGEN\n static void eoc_study_using_fem_and_eigen_sparse()\n {\n eoc_study< GDT::ChooseSpaceBackend::fem, Stuff::LA::ChooseBackend::eigen_sparse >();\n }\n# endif \/\/ HAVE_EIGEN\n# endif \/\/ HAVE_DUNE_FEM\n\n\/\/ static void eoc_study_using_pdelab_and_istl()\n\/\/ {\n\/\/ eoc_study< GDT::ChooseSpaceBackend::pdelab, Stuff::LA::ChooseBackend::istl_sparse >();\n\/\/ }\n\n\/\/ static void eoc_study_using_pdelab_and_eigen_sparse()\n\/\/ {\n\/\/ eoc_study< GDT::ChooseSpaceBackend::pdelab, Stuff::LA::ChooseBackend::eigen_sparse >();\n\/\/ }\n}; \/\/ linearelliptic_SWIPDG_discretization\n\n\n# if HAVE_DUNE_FEM && (HAVE_DUNE_ISTL || HAVE_EIGEN)\nTYPED_TEST_CASE(linearelliptic_SWIPDG_discretization, AluConform2dTestCases);\n# if HAVE_DUNE_ISTL\nTYPED_TEST(linearelliptic_SWIPDG_discretization, eoc_study_using_fem_and_istl) {\n this->eoc_study_using_fem_and_istl();\n}\n# else \/\/ HAVE_DUNE_ISTL\nTYPED_TEST(DISABLED_linearelliptic_SWIPDG_discretization, eoc_study_using_fem_and_istl) {}\n# endif\n# if HAVE_EIGEN\nTYPED_TEST(linearelliptic_SWIPDG_discretization, eoc_study_using_fem_and_eigen_sparse) {\n this->eoc_study_using_fem_and_eigen_sparse();\n}\n# else \/\/ HAVE_EIGEN\nTYPED_TEST(DISABLED_linearelliptic_SWIPDG_discretization, eoc_study_using_fem_and_eigen_sparse) {}\n# endif \/\/ HAVE_EIGEN\n\/\/TYPED_TEST(linearelliptic_SWIPDG_discretization, eoc_study_using_pdelab_and_istl) {\n\/\/ this->eoc_study_using_pdelab_and_istl();\n\/\/}\n\/\/TYPED_TEST(linearelliptic_SWIPDG_discretization, eoc_study_using_pdelab_and_eigen_sparse) {\n\/\/ this->eoc_study_using_pdelab_and_eigen_sparse();\n\/\/}\n# endif \/\/ HAVE_DUNE_FEM && (HAVE_DUNE_ISTL || HAVE_EIGEN)\n#else \/\/ HAVE_ALUGRID\n\n\nTYPED_TEST(DISABLED_linearelliptic_SWIPDG_discretization, eoc_study_using_fem_and_istl) {}\nTYPED_TEST(DISABLED_linearelliptic_SWIPDG_discretization, eoc_study_using_fem_and_eigen_sparse) {}\n\n\n#endif \/\/ HAVE_ALUGRID\n<commit_msg>[test.linearelliptic-swipdg] whitespace<commit_after>\/\/ This file is part of the dune-hdd project:\n\/\/ http:\/\/users.dune-project.org\/projects\/dune-hdd\n\/\/ Copyright holders: Felix Schindler\n\/\/ License: BSD 2-Clause License (http:\/\/opensource.org\/licenses\/BSD-2-Clause)\n\n#define DUNE_STUFF_FUNCTIONS_DISABLE_CHECKS 1\n\n#ifndef DUNE_STUFF_TEST_MAIN_ENABLE_INFO_LOGGING\n# define DUNE_STUFF_TEST_MAIN_ENABLE_INFO_LOGGING 1\n#endif\n\n\/\/ This one has to come first (includes the config.h)!\n#include <dune\/stuff\/test\/main.hxx>\n\n#if HAVE_ALUGRID\n# include <dune\/stuff\/common\/disable_warnings.hh>\n# include <dune\/grid\/alugrid.hh>\n# include <dune\/stuff\/common\/reenable_warnings.hh>\n\n# include <dune\/stuff\/common\/exceptions.hh>\n\n# include <dune\/stuff\/common\/print.hh>\n# include <dune\/stuff\/common\/float_cmp.hh>\n\n# include <dune\/hdd\/playground\/linearelliptic\/testcases\/ESV2007.hh>\n\n# include \"linearelliptic-swipdg.hh\"\n\nusing namespace Dune;\nusing namespace HDD;\n\n\ntypedef ALUGrid< 2, 2, simplex, conforming > AluConform2dGridType;\n\ntypedef testing::Types< LinearElliptic::TestCases::ESV2007< AluConform2dGridType >\n > AluConform2dTestCases;\n\n\ntemplate< class TestCaseType >\nstruct linearelliptic_SWIPDG_discretization\n : public ::testing::Test\n{\n template< GDT::ChooseSpaceBackend space_backend, Stuff::LA::ChooseBackend la_backend >\n static void eoc_study()\n {\n const TestCaseType test_case;\n test_case.print_header(DSC_LOG_INFO);\n DSC_LOG_INFO << std::endl;\n LinearElliptic::Tests::SWIPDGStudy< TestCaseType, 1, space_backend, la_backend > eoc_study(test_case);\n Stuff::Test::check_eoc_study_for_success(eoc_study, eoc_study.run_eoc(DSC_LOG_INFO));\n } \/\/ ... eoc_study()\n\n# if HAVE_DUNE_FEM\n# if HAVE_DUNE_ISTL\n static void eoc_study_using_fem_and_istl()\n {\n eoc_study< GDT::ChooseSpaceBackend::fem, Stuff::LA::ChooseBackend::istl_sparse >();\n }\n# endif \/\/ HAVE_DUNE_ISTL\n\n# if HAVE_EIGEN\n static void eoc_study_using_fem_and_eigen_sparse()\n {\n eoc_study< GDT::ChooseSpaceBackend::fem, Stuff::LA::ChooseBackend::eigen_sparse >();\n }\n# endif \/\/ HAVE_EIGEN\n# endif \/\/ HAVE_DUNE_FEM\n\n\/\/ static void eoc_study_using_pdelab_and_istl()\n\/\/ {\n\/\/ eoc_study< GDT::ChooseSpaceBackend::pdelab, Stuff::LA::ChooseBackend::istl_sparse >();\n\/\/ }\n\n\/\/ static void eoc_study_using_pdelab_and_eigen_sparse()\n\/\/ {\n\/\/ eoc_study< GDT::ChooseSpaceBackend::pdelab, Stuff::LA::ChooseBackend::eigen_sparse >();\n\/\/ }\n}; \/\/ linearelliptic_SWIPDG_discretization\n\n\n# if HAVE_DUNE_FEM && (HAVE_DUNE_ISTL || HAVE_EIGEN)\n\nTYPED_TEST_CASE(linearelliptic_SWIPDG_discretization, AluConform2dTestCases);\n\n# if HAVE_DUNE_ISTL\nTYPED_TEST(linearelliptic_SWIPDG_discretization, eoc_study_using_fem_and_istl) {\n this->eoc_study_using_fem_and_istl();\n}\n# else \/\/ HAVE_DUNE_ISTL\nTYPED_TEST(DISABLED_linearelliptic_SWIPDG_discretization, eoc_study_using_fem_and_istl) {}\n# endif\n\n# if HAVE_EIGEN\nTYPED_TEST(linearelliptic_SWIPDG_discretization, eoc_study_using_fem_and_eigen_sparse) {\n this->eoc_study_using_fem_and_eigen_sparse();\n}\n# else \/\/ HAVE_EIGEN\nTYPED_TEST(DISABLED_linearelliptic_SWIPDG_discretization, eoc_study_using_fem_and_eigen_sparse) {}\n# endif \/\/ HAVE_EIGEN\n\n\/\/TYPED_TEST(linearelliptic_SWIPDG_discretization, eoc_study_using_pdelab_and_istl) {\n\/\/ this->eoc_study_using_pdelab_and_istl();\n\/\/}\n\n\/\/TYPED_TEST(linearelliptic_SWIPDG_discretization, eoc_study_using_pdelab_and_eigen_sparse) {\n\/\/ this->eoc_study_using_pdelab_and_eigen_sparse();\n\/\/}\n\n# endif \/\/ HAVE_DUNE_FEM && (HAVE_DUNE_ISTL || HAVE_EIGEN)\n#else \/\/ HAVE_ALUGRID\n\n\nTYPED_TEST(DISABLED_linearelliptic_SWIPDG_discretization, eoc_study_using_fem_and_istl) {}\nTYPED_TEST(DISABLED_linearelliptic_SWIPDG_discretization, eoc_study_using_fem_and_eigen_sparse) {}\n\n\n#endif \/\/ HAVE_ALUGRID\n<|endoftext|>"} {"text":"<commit_before>\/*\n * =====================================================================================\n *\n * Filename: main.cc\n *\n * Description: \n *\n * Version: 1.0\n * Created: 03\/20\/2008 12:34:14 AM EDT\n * Revision: none\n * Compiler: gcc\n *\n * Author: Nikolaos Vasiloglou (NV), nvasil@ieee.org\n * Company: Georgia Tech Fastlab-ESP Lab\n *\n * =====================================================================================\n *\/\n\n#include <string>\n#include \"fastlib\/fastlib.h\"\n#include \"mvu_objectives.h\"\n#include \"..\/l_bfgs\/l_bfgs.h\"\n\nint main(int argc, char *argv[]){\n fx_init(argc, argv);\n std::string optimized_function=fx_param_str(NULL, \"optfun\", \"mvu\");\n std::string data_file=fx_param_str_req(NULL, \"data_file\");\n Matrix data_mat;\n if (data::Load(data_file.c_str(), &data_mat)==SUCCESS_FAIL) {\n FATAL(\"Didn't manage to load %s\", data_file.c_str());\n }\n datanode *optfun_node=fx_param_node(NULL, \"optfun\");\n datanode *l_bfgs_node=fx_param_node(NULL, \"l_bfgs\");\n std::string result_file=fx_param_str(NULL, \"result_file\", \"result.csv\");\n bool done=false;\n \n if (optimized_function == \"mvu\") {\n MaxVariance opt_function;\n opt_function.Init(optfun_node, data_mat);\n LBfgs<MaxVariance> engine;\n engine.Init(&opt_function, l_bfgs_node);\n engine.ComputeLocalOptimumBFGS();\n Matrix result;\n engine.GetResults(&result);\n if (data::Save(result_file.c_str(), result)==SUCCESS_FAIL) {\n FATAL(\"Didn't manage to save %s\", result_file.c_str());\n }\n done=true;\n }\n if (optimized_function==\"mfu\") {\n MaxVarianceInequalityOnFurthest opt_function;\n opt_function.Init(optfun_node, data_mat);\n LBfgs<MaxVarianceInequalityOnFurthest> engine;\n engine.Init(&opt_function, l_bfgs_node);\n engine.ComputeLocalOptimumBFGS();\n Matrix result;\n engine.GetResults(&result);\n if (data::Save(result_file.c_str(), result)==SUCCESS_FAIL) {\n FATAL(\"Didn't manage to save %s\", result_file.c_str());\n }\n done=true;\n }\n if (optimized_function == \"mvuineq\"){\n MaxFurthestNeighbors opt_function;\n opt_function.Init(optfun_node, data_mat);\n LBfgs<MaxFurthestNeighbors> engine;\n engine.Init(&opt_function, l_bfgs_node);\n engine.ComputeLocalOptimumBFGS();\n Matrix result;\n engine.GetResults(&result);\n if (data::Save(result_file.c_str(), result)==SUCCESS_FAIL) {\n FATAL(\"Didn't manage to save %s\", result_file.c_str());\n }\n done=true;\n }\n if (done==false) {\n FATAL(\"The method you provided %s is not supported\", \n optimized_function.c_str());\n }\n fx_done();\n}\n<commit_msg>I need to get rid of some warnings, it is running<commit_after>\/*\n * =====================================================================================\n *\n * Filename: main.cc\n *\n * Description: \n *\n * Version: 1.0\n * Created: 03\/20\/2008 12:34:14 AM EDT\n * Revision: none\n * Compiler: gcc\n *\n * Author: Nikolaos Vasiloglou (NV), nvasil@ieee.org\n * Company: Georgia Tech Fastlab-ESP Lab\n *\n * =====================================================================================\n *\/\n\n#include <string>\n#include \"fastlib\/fastlib.h\"\n#include \"mvu_objectives.h\"\n#include \"..\/l_bfgs\/l_bfgs.h\"\n\nint main(int argc, char *argv[]){\n fx_init(argc, argv);\n std::string optimized_function=fx_param_str(NULL, \"optfun\", \"mvu\");\n std::string data_file=fx_param_str_req(NULL, \"data_file\");\n Matrix data_mat;\n if (data::Load(data_file.c_str(), &data_mat)==SUCCESS_FAIL) {\n FATAL(\"Didn't manage to load %s\", data_file.c_str());\n }\n datanode *optfun_node=fx_param_node(NULL, \"optfun\");\n datanode *l_bfgs_node=fx_param_node(NULL, \"l_bfgs\");\n \/\/we need to insert the number of points\n char buffer[128];\n sprintf(buffer, \"%i\", data_mat.n_cols());\n fx_set_param(l_bfgs_node, \"num_of_points\", buffer);\n std::string result_file=fx_param_str(NULL, \"result_file\", \"result.csv\");\n bool done=false;\n \n if (optimized_function == \"mvu\") {\n MaxVariance opt_function;\n opt_function.Init(optfun_node, data_mat);\n LBfgs<MaxVariance> engine;\n engine.Init(&opt_function, l_bfgs_node);\n engine.ComputeLocalOptimumBFGS();\n Matrix result;\n engine.GetResults(&result);\n if (data::Save(result_file.c_str(), result)==SUCCESS_FAIL) {\n FATAL(\"Didn't manage to save %s\", result_file.c_str());\n }\n engine.Destruct();\n done=true;\n }\n if (optimized_function==\"mfu\") {\n MaxVarianceInequalityOnFurthest opt_function;\n opt_function.Init(optfun_node, data_mat);\n LBfgs<MaxVarianceInequalityOnFurthest> engine;\n engine.Init(&opt_function, l_bfgs_node);\n engine.ComputeLocalOptimumBFGS();\n Matrix result;\n engine.GetResults(&result);\n if (data::Save(result_file.c_str(), result)==SUCCESS_FAIL) {\n FATAL(\"Didn't manage to save %s\", result_file.c_str());\n }\n engine.Destruct();\n done=true;\n }\n if (optimized_function == \"mvuineq\"){\n MaxFurthestNeighbors opt_function;\n opt_function.Init(optfun_node, data_mat);\n LBfgs<MaxFurthestNeighbors> engine;\n engine.Init(&opt_function, l_bfgs_node);\n engine.ComputeLocalOptimumBFGS();\n Matrix result;\n engine.GetResults(&result);\n if (data::Save(result_file.c_str(), result)==SUCCESS_FAIL) {\n FATAL(\"Didn't manage to save %s\", result_file.c_str());\n }\n engine.Destruct();\n done=true;\n }\n if (done==false) {\n FATAL(\"The method you provided %s is not supported\", \n optimized_function.c_str());\n }\n fx_done();\n}\n<|endoftext|>"} {"text":"<commit_before>\/* -*- Mode: C++; tab-width: 4; indent-tabs-mode: nil; c-basic-offset: 4 -*- *\/\n\/*\n * This file is part of the LibreOffice project.\n *\n * This Source Code Form is subject to the terms of the Mozilla Public\n * License, v. 2.0. If a copy of the MPL was not distributed with this\n * file, You can obtain one at http:\/\/mozilla.org\/MPL\/2.0\/.\n *\n * This file incorporates work covered by the following license notice:\n *\n * Licensed to the Apache Software Foundation (ASF) under one or more\n * contributor license agreements. See the NOTICE file distributed\n * with this work for additional information regarding copyright\n * ownership. The ASF licenses this file to you under the Apache\n * License, Version 2.0 (the \"License\"); you may not use this file\n * except in compliance with the License. You may obtain a copy of\n * the License at http:\/\/www.apache.org\/licenses\/LICENSE-2.0 .\n *\/\n\n#include \"vbalistbox.hxx\"\n#include \"vbanewfont.hxx\"\n#include <comphelper\/anytostring.hxx>\n#include <com\/sun\/star\/script\/ArrayWrapper.hpp>\n#include <com\/sun\/star\/form\/validation\/XValidatableFormComponent.hpp>\n#include <ooo\/vba\/msforms\/fmMultiSelect.hpp>\n\nusing namespace com::sun::star;\nusing namespace ooo::vba;\n\nconst static OUString TEXT( \"Text\" );\nconst static OUString SELECTEDITEMS( \"SelectedItems\" );\nconst static OUString ITEMS( \"StringItemList\" );\n\n\nScVbaListBox::ScVbaListBox( const uno::Reference< XHelperInterface >& xParent, const uno::Reference< uno::XComponentContext >& xContext, const uno::Reference< css::uno::XInterface >& xControl, const uno::Reference< frame::XModel >& xModel, AbstractGeometryAttributes* pGeomHelper )\n : ListBoxImpl_BASE(xParent, xContext, xControl, xModel, pGeomHelper)\n : m_nIndex(0)\n{\n mpListHelper.reset( new ListControlHelper( m_xProps ) );\n}\n\n\/\/ Attributes\nvoid SAL_CALL\nScVbaListBox::setListIndex( const uno::Any& _value ) throw (uno::RuntimeException, std::exception)\n{\n sal_Int32 nIndex = 0;\n _value >>= nIndex;\n uno::Reference< XPropValue > xPropVal( Selected( nIndex ), uno::UNO_QUERY_THROW );\n xPropVal->setValue( uno::makeAny( sal_True ) );\n}\n\nuno::Any SAL_CALL\nScVbaListBox::getListIndex() throw (uno::RuntimeException, std::exception)\n{\n uno::Sequence< sal_Int16 > sSelection;\n m_xProps->getPropertyValue( SELECTEDITEMS ) >>= sSelection;\n if ( sSelection.getLength() == 0 )\n return uno::Any( sal_Int32( -1 ) );\n return uno::Any( sSelection[ 0 ] );\n}\n\nuno::Any SAL_CALL\nScVbaListBox::getValue() throw (uno::RuntimeException, std::exception)\n{\n uno::Sequence< sal_Int16 > sSelection;\n uno::Sequence< OUString > sItems;\n m_xProps->getPropertyValue( SELECTEDITEMS ) >>= sSelection;\n m_xProps->getPropertyValue( ITEMS ) >>= sItems;\n if( getMultiSelect() )\n throw uno::RuntimeException( \"Attribute use invalid.\" , uno::Reference< uno::XInterface >() );\n uno::Any aRet;\n if ( sSelection.getLength() )\n aRet = uno::makeAny( sItems[ sSelection[ 0 ] ] );\n return aRet;\n}\n\nvoid SAL_CALL\nScVbaListBox::setValue( const uno::Any& _value ) throw (uno::RuntimeException, std::exception)\n{\n if( getMultiSelect() )\n {\n throw uno::RuntimeException( \"Attribute use invalid.\" , uno::Reference< uno::XInterface >() );\n }\n OUString sValue = getAnyAsString( _value );\n uno::Sequence< OUString > sList;\n m_xProps->getPropertyValue( ITEMS ) >>= sList;\n sal_Int16 nLength = static_cast<sal_Int16>( sList.getLength() );\n sal_Int16 nValue = -1;\n sal_Int16 i = 0;\n for( i = 0; i < nLength; i++ )\n {\n if( sList[i].equals( sValue ) )\n {\n nValue = i;\n break;\n }\n }\n if( nValue == -1 )\n throw uno::RuntimeException( \"Attribute use invalid.\" , uno::Reference< uno::XInterface >() );\n\n uno::Sequence< sal_Int16 > nSelectedIndices(1);\n uno::Sequence< sal_Int16 > nOldSelectedIndices;\n m_xProps->getPropertyValue( SELECTEDITEMS ) >>= nOldSelectedIndices;\n nSelectedIndices[ 0 ] = nValue;\n m_xProps->setPropertyValue( SELECTEDITEMS, uno::makeAny( nSelectedIndices ) );\n if ( nSelectedIndices != nOldSelectedIndices )\n fireClickEvent();\n}\n\nOUString SAL_CALL\nScVbaListBox::getText() throw (uno::RuntimeException, std::exception)\n{\n OUString result;\n getValue() >>= result;\n return result;\n}\n\nvoid SAL_CALL\nScVbaListBox::setText( const OUString& _text ) throw (uno::RuntimeException, std::exception)\n{\n setValue( uno::makeAny( _text ) ); \/\/ seems the same\n}\n\nsal_Int32 SAL_CALL\nScVbaListBox::getMultiSelect() throw (css::uno::RuntimeException, std::exception)\n{\n sal_Bool bMultiSelect = sal_False;\n m_xProps->getPropertyValue( \"MultiSelection\" ) >>= bMultiSelect;\n\n return bMultiSelect ? msforms::fmMultiSelect::fmMultiSelectMulti : msforms::fmMultiSelect::fmMultiSelectSingle;\n}\n\nvoid SAL_CALL\nScVbaListBox::setMultiSelect( sal_Int32 _multiselect ) throw (css::uno::RuntimeException, std::exception)\n{\n sal_Bool bBoolVal = false;\n switch ( _multiselect )\n {\n case msforms::fmMultiSelect::fmMultiSelectMulti:\n case msforms::fmMultiSelect::fmMultiSelectExtended:\n bBoolVal = sal_True;\n break;\n case msforms::fmMultiSelect::fmMultiSelectSingle:\n bBoolVal = sal_False;\n break;\n default:\n throw lang::IllegalArgumentException();\n break;\n }\n m_xProps->setPropertyValue( \"MultiSelection\" , uno::makeAny( bBoolVal ) );\n}\n\n\ncss::uno::Any SAL_CALL\nScVbaListBox::Selected( sal_Int32 index ) throw (css::uno::RuntimeException, std::exception)\n{\n uno::Sequence< OUString > sList;\n m_xProps->getPropertyValue( ITEMS ) >>= sList;\n sal_Int16 nLength = static_cast< sal_Int16 >( sList.getLength() );\n \/\/ no choice but to do a horror cast as internally\n \/\/ the indices are but sal_Int16\n sal_Int16 nIndex = static_cast< sal_Int16 >( index );\n if( nIndex < 0 || nIndex >= nLength )\n throw uno::RuntimeException( \"Error Number.\" , uno::Reference< uno::XInterface >() );\n m_nIndex = nIndex;\n return uno::makeAny( uno::Reference< XPropValue > ( new ScVbaPropValue( this ) ) );\n}\n\n\/\/ Methods\nvoid SAL_CALL\nScVbaListBox::AddItem( const uno::Any& pvargItem, const uno::Any& pvargIndex ) throw (uno::RuntimeException, std::exception)\n{\n mpListHelper->AddItem( pvargItem, pvargIndex );\n }\n\nvoid SAL_CALL\nScVbaListBox::removeItem( const uno::Any& index ) throw (uno::RuntimeException, std::exception)\n{\n mpListHelper->removeItem( index );\n}\n\nvoid SAL_CALL\nScVbaListBox::Clear( ) throw (uno::RuntimeException, std::exception)\n{\n mpListHelper->Clear();\n}\n\n\/\/ this is called when something like the following vba code is used\n\/\/ to set the selected state of particular entries in the Listbox\n\/\/ ListBox1.Selected( 3 ) = false\n\/\/PropListener\nvoid\nScVbaListBox::setValueEvent( const uno::Any& value )\n{\n sal_Bool bValue = sal_False;\n if( !(value >>= bValue) )\n throw uno::RuntimeException( \"Invalid type\\n. need boolean.\" , uno::Reference< uno::XInterface >() );\n uno::Sequence< sal_Int16 > nList;\n m_xProps->getPropertyValue( SELECTEDITEMS ) >>= nList;\n sal_Int16 nLength = static_cast<sal_Int16>( nList.getLength() );\n sal_Int16 nIndex = m_nIndex;\n for( sal_Int16 i = 0; i < nLength; i++ )\n {\n if( nList[i] == nIndex )\n {\n if( bValue )\n return;\n else\n {\n for( ; i < nLength - 1; i++ )\n {\n nList[i] = nList[i + 1];\n }\n nList.realloc( nLength - 1 );\n \/\/m_xProps->setPropertyValue( sSourceName, uno::makeAny( nList ) );\n fireClickEvent();\n m_xProps->setPropertyValue( SELECTEDITEMS, uno::makeAny( nList ) );\n return;\n }\n }\n }\n if( bValue )\n {\n if( getMultiSelect() )\n {\n nList.realloc( nLength + 1 );\n nList[nLength] = nIndex;\n }\n else\n {\n nList.realloc( 1 );\n nList[0] = nIndex;\n }\n \/\/m_xProps->setPropertyValue( sSourceName, uno::makeAny( nList ) );\n fireClickEvent();\n m_xProps->setPropertyValue( SELECTEDITEMS, uno::makeAny( nList ) );\n }\n}\n\n\/\/ this is called when something like the following vba code is used\n\/\/ to determine the selected state of particular entries in the Listbox\n\/\/ msgbox ListBox1.Selected( 3 )\n\ncss::uno::Any\nScVbaListBox::getValueEvent()\n{\n uno::Sequence< sal_Int16 > nList;\n m_xProps->getPropertyValue( \"SelectedItems\" ) >>= nList;\n sal_Int32 nLength = nList.getLength();\n sal_Int32 nIndex = m_nIndex;\n\n for( sal_Int32 i = 0; i < nLength; i++ )\n {\n if( nList[i] == nIndex )\n return uno::makeAny( sal_True );\n }\n\n return uno::makeAny( sal_False );\n}\n\nvoid SAL_CALL\nScVbaListBox::setRowSource( const OUString& _rowsource ) throw (uno::RuntimeException, std::exception)\n{\n ScVbaControl::setRowSource( _rowsource );\n mpListHelper->setRowSource( _rowsource );\n}\n\nsal_Int32 SAL_CALL\nScVbaListBox::getListCount() throw (uno::RuntimeException, std::exception)\n{\n return mpListHelper->getListCount();\n}\n\nuno::Any SAL_CALL\nScVbaListBox::List( const ::uno::Any& pvargIndex, const uno::Any& pvarColumn ) throw (uno::RuntimeException, std::exception)\n{\n return mpListHelper->List( pvargIndex, pvarColumn );\n}\n\nuno::Reference< msforms::XNewFont > SAL_CALL ScVbaListBox::getFont() throw (uno::RuntimeException, std::exception)\n{\n return new VbaNewFont( this, mxContext, m_xProps );\n}\n\nOUString\nScVbaListBox::getServiceImplName()\n{\n return OUString(\"ScVbaListBox\");\n}\n\nuno::Sequence< OUString >\nScVbaListBox::getServiceNames()\n{\n static uno::Sequence< OUString > aServiceNames;\n if ( aServiceNames.getLength() == 0 )\n {\n aServiceNames.realloc( 1 );\n aServiceNames[ 0 ] = \"ooo.vba.msforms.ScVbaListBox\";\n }\n return aServiceNames;\n}\n\n\/* vim:set shiftwidth=4 softtabstop=4 expandtab: *\/\n<commit_msg>fix colon<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 \"vbalistbox.hxx\"\n#include \"vbanewfont.hxx\"\n#include <comphelper\/anytostring.hxx>\n#include <com\/sun\/star\/script\/ArrayWrapper.hpp>\n#include <com\/sun\/star\/form\/validation\/XValidatableFormComponent.hpp>\n#include <ooo\/vba\/msforms\/fmMultiSelect.hpp>\n\nusing namespace com::sun::star;\nusing namespace ooo::vba;\n\nconst static OUString TEXT( \"Text\" );\nconst static OUString SELECTEDITEMS( \"SelectedItems\" );\nconst static OUString ITEMS( \"StringItemList\" );\n\n\nScVbaListBox::ScVbaListBox( const uno::Reference< XHelperInterface >& xParent, const uno::Reference< uno::XComponentContext >& xContext, const uno::Reference< css::uno::XInterface >& xControl, const uno::Reference< frame::XModel >& xModel, AbstractGeometryAttributes* pGeomHelper )\n : ListBoxImpl_BASE(xParent, xContext, xControl, xModel, pGeomHelper)\n , m_nIndex(0)\n{\n mpListHelper.reset( new ListControlHelper( m_xProps ) );\n}\n\n\/\/ Attributes\nvoid SAL_CALL\nScVbaListBox::setListIndex( const uno::Any& _value ) throw (uno::RuntimeException, std::exception)\n{\n sal_Int32 nIndex = 0;\n _value >>= nIndex;\n uno::Reference< XPropValue > xPropVal( Selected( nIndex ), uno::UNO_QUERY_THROW );\n xPropVal->setValue( uno::makeAny( sal_True ) );\n}\n\nuno::Any SAL_CALL\nScVbaListBox::getListIndex() throw (uno::RuntimeException, std::exception)\n{\n uno::Sequence< sal_Int16 > sSelection;\n m_xProps->getPropertyValue( SELECTEDITEMS ) >>= sSelection;\n if ( sSelection.getLength() == 0 )\n return uno::Any( sal_Int32( -1 ) );\n return uno::Any( sSelection[ 0 ] );\n}\n\nuno::Any SAL_CALL\nScVbaListBox::getValue() throw (uno::RuntimeException, std::exception)\n{\n uno::Sequence< sal_Int16 > sSelection;\n uno::Sequence< OUString > sItems;\n m_xProps->getPropertyValue( SELECTEDITEMS ) >>= sSelection;\n m_xProps->getPropertyValue( ITEMS ) >>= sItems;\n if( getMultiSelect() )\n throw uno::RuntimeException( \"Attribute use invalid.\" , uno::Reference< uno::XInterface >() );\n uno::Any aRet;\n if ( sSelection.getLength() )\n aRet = uno::makeAny( sItems[ sSelection[ 0 ] ] );\n return aRet;\n}\n\nvoid SAL_CALL\nScVbaListBox::setValue( const uno::Any& _value ) throw (uno::RuntimeException, std::exception)\n{\n if( getMultiSelect() )\n {\n throw uno::RuntimeException( \"Attribute use invalid.\" , uno::Reference< uno::XInterface >() );\n }\n OUString sValue = getAnyAsString( _value );\n uno::Sequence< OUString > sList;\n m_xProps->getPropertyValue( ITEMS ) >>= sList;\n sal_Int16 nLength = static_cast<sal_Int16>( sList.getLength() );\n sal_Int16 nValue = -1;\n sal_Int16 i = 0;\n for( i = 0; i < nLength; i++ )\n {\n if( sList[i].equals( sValue ) )\n {\n nValue = i;\n break;\n }\n }\n if( nValue == -1 )\n throw uno::RuntimeException( \"Attribute use invalid.\" , uno::Reference< uno::XInterface >() );\n\n uno::Sequence< sal_Int16 > nSelectedIndices(1);\n uno::Sequence< sal_Int16 > nOldSelectedIndices;\n m_xProps->getPropertyValue( SELECTEDITEMS ) >>= nOldSelectedIndices;\n nSelectedIndices[ 0 ] = nValue;\n m_xProps->setPropertyValue( SELECTEDITEMS, uno::makeAny( nSelectedIndices ) );\n if ( nSelectedIndices != nOldSelectedIndices )\n fireClickEvent();\n}\n\nOUString SAL_CALL\nScVbaListBox::getText() throw (uno::RuntimeException, std::exception)\n{\n OUString result;\n getValue() >>= result;\n return result;\n}\n\nvoid SAL_CALL\nScVbaListBox::setText( const OUString& _text ) throw (uno::RuntimeException, std::exception)\n{\n setValue( uno::makeAny( _text ) ); \/\/ seems the same\n}\n\nsal_Int32 SAL_CALL\nScVbaListBox::getMultiSelect() throw (css::uno::RuntimeException, std::exception)\n{\n sal_Bool bMultiSelect = sal_False;\n m_xProps->getPropertyValue( \"MultiSelection\" ) >>= bMultiSelect;\n\n return bMultiSelect ? msforms::fmMultiSelect::fmMultiSelectMulti : msforms::fmMultiSelect::fmMultiSelectSingle;\n}\n\nvoid SAL_CALL\nScVbaListBox::setMultiSelect( sal_Int32 _multiselect ) throw (css::uno::RuntimeException, std::exception)\n{\n sal_Bool bBoolVal = false;\n switch ( _multiselect )\n {\n case msforms::fmMultiSelect::fmMultiSelectMulti:\n case msforms::fmMultiSelect::fmMultiSelectExtended:\n bBoolVal = sal_True;\n break;\n case msforms::fmMultiSelect::fmMultiSelectSingle:\n bBoolVal = sal_False;\n break;\n default:\n throw lang::IllegalArgumentException();\n break;\n }\n m_xProps->setPropertyValue( \"MultiSelection\" , uno::makeAny( bBoolVal ) );\n}\n\n\ncss::uno::Any SAL_CALL\nScVbaListBox::Selected( sal_Int32 index ) throw (css::uno::RuntimeException, std::exception)\n{\n uno::Sequence< OUString > sList;\n m_xProps->getPropertyValue( ITEMS ) >>= sList;\n sal_Int16 nLength = static_cast< sal_Int16 >( sList.getLength() );\n \/\/ no choice but to do a horror cast as internally\n \/\/ the indices are but sal_Int16\n sal_Int16 nIndex = static_cast< sal_Int16 >( index );\n if( nIndex < 0 || nIndex >= nLength )\n throw uno::RuntimeException( \"Error Number.\" , uno::Reference< uno::XInterface >() );\n m_nIndex = nIndex;\n return uno::makeAny( uno::Reference< XPropValue > ( new ScVbaPropValue( this ) ) );\n}\n\n\/\/ Methods\nvoid SAL_CALL\nScVbaListBox::AddItem( const uno::Any& pvargItem, const uno::Any& pvargIndex ) throw (uno::RuntimeException, std::exception)\n{\n mpListHelper->AddItem( pvargItem, pvargIndex );\n }\n\nvoid SAL_CALL\nScVbaListBox::removeItem( const uno::Any& index ) throw (uno::RuntimeException, std::exception)\n{\n mpListHelper->removeItem( index );\n}\n\nvoid SAL_CALL\nScVbaListBox::Clear( ) throw (uno::RuntimeException, std::exception)\n{\n mpListHelper->Clear();\n}\n\n\/\/ this is called when something like the following vba code is used\n\/\/ to set the selected state of particular entries in the Listbox\n\/\/ ListBox1.Selected( 3 ) = false\n\/\/PropListener\nvoid\nScVbaListBox::setValueEvent( const uno::Any& value )\n{\n sal_Bool bValue = sal_False;\n if( !(value >>= bValue) )\n throw uno::RuntimeException( \"Invalid type\\n. need boolean.\" , uno::Reference< uno::XInterface >() );\n uno::Sequence< sal_Int16 > nList;\n m_xProps->getPropertyValue( SELECTEDITEMS ) >>= nList;\n sal_Int16 nLength = static_cast<sal_Int16>( nList.getLength() );\n sal_Int16 nIndex = m_nIndex;\n for( sal_Int16 i = 0; i < nLength; i++ )\n {\n if( nList[i] == nIndex )\n {\n if( bValue )\n return;\n else\n {\n for( ; i < nLength - 1; i++ )\n {\n nList[i] = nList[i + 1];\n }\n nList.realloc( nLength - 1 );\n \/\/m_xProps->setPropertyValue( sSourceName, uno::makeAny( nList ) );\n fireClickEvent();\n m_xProps->setPropertyValue( SELECTEDITEMS, uno::makeAny( nList ) );\n return;\n }\n }\n }\n if( bValue )\n {\n if( getMultiSelect() )\n {\n nList.realloc( nLength + 1 );\n nList[nLength] = nIndex;\n }\n else\n {\n nList.realloc( 1 );\n nList[0] = nIndex;\n }\n \/\/m_xProps->setPropertyValue( sSourceName, uno::makeAny( nList ) );\n fireClickEvent();\n m_xProps->setPropertyValue( SELECTEDITEMS, uno::makeAny( nList ) );\n }\n}\n\n\/\/ this is called when something like the following vba code is used\n\/\/ to determine the selected state of particular entries in the Listbox\n\/\/ msgbox ListBox1.Selected( 3 )\n\ncss::uno::Any\nScVbaListBox::getValueEvent()\n{\n uno::Sequence< sal_Int16 > nList;\n m_xProps->getPropertyValue( \"SelectedItems\" ) >>= nList;\n sal_Int32 nLength = nList.getLength();\n sal_Int32 nIndex = m_nIndex;\n\n for( sal_Int32 i = 0; i < nLength; i++ )\n {\n if( nList[i] == nIndex )\n return uno::makeAny( sal_True );\n }\n\n return uno::makeAny( sal_False );\n}\n\nvoid SAL_CALL\nScVbaListBox::setRowSource( const OUString& _rowsource ) throw (uno::RuntimeException, std::exception)\n{\n ScVbaControl::setRowSource( _rowsource );\n mpListHelper->setRowSource( _rowsource );\n}\n\nsal_Int32 SAL_CALL\nScVbaListBox::getListCount() throw (uno::RuntimeException, std::exception)\n{\n return mpListHelper->getListCount();\n}\n\nuno::Any SAL_CALL\nScVbaListBox::List( const ::uno::Any& pvargIndex, const uno::Any& pvarColumn ) throw (uno::RuntimeException, std::exception)\n{\n return mpListHelper->List( pvargIndex, pvarColumn );\n}\n\nuno::Reference< msforms::XNewFont > SAL_CALL ScVbaListBox::getFont() throw (uno::RuntimeException, std::exception)\n{\n return new VbaNewFont( this, mxContext, m_xProps );\n}\n\nOUString\nScVbaListBox::getServiceImplName()\n{\n return OUString(\"ScVbaListBox\");\n}\n\nuno::Sequence< OUString >\nScVbaListBox::getServiceNames()\n{\n static uno::Sequence< OUString > aServiceNames;\n if ( aServiceNames.getLength() == 0 )\n {\n aServiceNames.realloc( 1 );\n aServiceNames[ 0 ] = \"ooo.vba.msforms.ScVbaListBox\";\n }\n return aServiceNames;\n}\n\n\/* vim:set shiftwidth=4 softtabstop=4 expandtab: *\/\n<|endoftext|>"} {"text":"<commit_before>\/\/ *****************************************************************************\n\/\/\n\/\/ Copyright (c) 2014, Southwest Research Institute® (SwRI®)\n\/\/ All rights reserved.\n\/\/\n\/\/ Redistribution and use in source and binary forms, with or without\n\/\/ modification, are permitted provided that the following conditions are met:\n\/\/ * Redistributions of source code must retain the above copyright\n\/\/ notice, this list of conditions and the following disclaimer.\n\/\/ * Redistributions in binary form must reproduce the above copyright\n\/\/ notice, this list of conditions and the following disclaimer in the\n\/\/ documentation and\/or other materials provided with the distribution.\n\/\/ * Neither the name of Southwest Research Institute® (SwRI®) nor the\n\/\/ names of its contributors may be used to endorse or promote products\n\/\/ derived from this software without specific prior written permission.\n\/\/\n\/\/ THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS \"AS IS\"\n\/\/ AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE\n\/\/ IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE\n\/\/ ARE DISCLAIMED. IN NO EVENT SHALL <COPYRIGHT HOLDER> BE LIABLE FOR ANY\n\/\/ DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES\n\/\/ (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;\n\/\/ LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND\n\/\/ ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT\n\/\/ (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS\n\/\/ SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.\n\/\/\n\/\/ *****************************************************************************\n\n#include <image_util\/geometry_util.h>\n\n#include <cmath>\n#include <limits>\n#include <vector>\n\n#include <QPolygonF>\n#include <QPointF>\n\n#include <opencv2\/imgproc\/imgproc.hpp>\n\n#include <Eigen\/Dense>\n#include <Eigen\/SVD>\n\n#include <math_util\/constants.h>\n\nnamespace image_util\n{\n bool Intersects(const BoundingBox& box1, const BoundingBox& box2)\n {\n return (box1 & box2).area() > 0;\n }\n\n double GetOverlappingArea(const cv::Rect& rect, const cv::Mat& rigid_transform)\n {\n \/\/ List of points corresponding to the input rectangle.\n std::vector<cv::Vec2f> points;\n\n \/\/ List of points correspondng to the transformed rectangle.\n std::vector<cv::Vec2f> points_t;\n\n \/\/ Create a point for each corner of the input rectangle.\n points.push_back(cv::Vec2f(rect.x, rect.y));\n points.push_back(cv::Vec2f(rect.x + rect.width, rect.y));\n points.push_back(cv::Vec2f(rect.x + rect.width, rect.y + rect.height));\n points.push_back(cv::Vec2f(rect.x, rect.y + rect.height));\n\n \/\/ Transform the input points to the transformed points using the rigid\n \/\/ transform.\n cv::transform(cv::InputArray(points), cv::OutputArray(points_t), rigid_transform);\n\n \/\/ Use the QPolygon object to get the intersecting area of the input\n \/\/ rectangle and the transformed rectangle.\n\n \/\/ Build the polygon corresponding to the input rectangle.\n QPolygonF polygon;\n polygon << QPointF(points[0][0], points[0][1]);\n polygon << QPointF(points[1][0], points[1][1]);\n polygon << QPointF(points[2][0], points[2][1]);\n polygon << QPointF(points[3][0], points[3][1]);\n polygon << QPointF(points[0][0], points[0][1]);\n\n \/\/ Build the polygon corresponding to the transformed rectangle.\n QPolygonF transformed_polygon;\n transformed_polygon << QPointF(points_t[0][0], points_t[0][1]);\n transformed_polygon << QPointF(points_t[1][0], points_t[1][1]);\n transformed_polygon << QPointF(points_t[2][0], points_t[2][1]);\n transformed_polygon << QPointF(points_t[3][0], points_t[3][1]);\n transformed_polygon << QPointF(points_t[0][0], points_t[0][1]);\n\n \/\/ Get the polygon representing the intersection of the input rectangle and\n \/\/ the transformed rectangle.\n QPolygonF intersection = polygon.intersected(transformed_polygon);\n\n \/\/ If the intersection is empty, then just return 0 area.\n if (intersection.size() == 0)\n {\n return 0;\n }\n\n \/\/ Build an OpenCV contour to measure the area of the intersection.\n std::vector<cv::Point2f> contour;\n for (int i = 0; i < intersection.size(); i++)\n {\n contour.push_back(cv::Point2f(intersection[i].x(), intersection[i].y()));\n }\n\n \/\/ Scale the area based on the scale factor to get the correct value.\n return cv::contourArea(contour);\n }\n\n cv::Mat ProjectEllipsoid(const cv::Mat& ellipsoid)\n {\n cv::Mat ellipse;\n\n if (ellipsoid.rows == 3 && ellipsoid.cols == 3 && ellipsoid.type() == CV_32FC1)\n {\n if (ellipsoid.at<float>(2, 2) >= std::numeric_limits<double>::max() * 0.5)\n {\n ellipse.create(2, 2, CV_32FC1);\n ellipse.at<float>(0, 0) = ellipsoid.at<float>(0, 0);\n ellipse.at<float>(0, 1) = ellipsoid.at<float>(0, 1);\n ellipse.at<float>(1, 0) = ellipsoid.at<float>(1, 0);\n ellipse.at<float>(1, 1) = ellipsoid.at<float>(1, 1);\n\n return ellipse;\n }\n\n Eigen::Matrix3d A;\n for (size_t r = 0; r < 3; r++)\n {\n for (size_t c = 0; c < 3; c++)\n {\n A(r, c) = ellipsoid.at<float>(r, c);\n }\n }\n\n \/\/ Specify the main vector directions (x and y)\n Eigen::Vector3d ax1;\n Eigen::Vector3d ax2;\n ax1 << 1, 0, 0;\n ax2 << 0, 1, 0;\n\n \/\/ Initialize the normal vector (here the normal vector, in the state\n \/\/ space is in the theta direction).\n Eigen::Vector3d n_ax;\n n_ax << 0, 0, 1;\n\n \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n \/\/ Calculate A prime \/\/\n \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n Eigen::Matrix3d A_sym_temp = A.transpose() + A;\n\n \/\/ N_ax_temp = (n_ax*n_ax')\n Eigen::Matrix3d N_ax_temp = n_ax * n_ax.transpose();\n\n \/\/ A_prime_1 = A_sym_temp*N_ax_temp\n \/\/ = (A+A')*(n_ax*n_ax')\n Eigen::Matrix3d A_prime_1 = A_sym_temp * N_ax_temp;\n\n \/\/ A_prime_2 = A_prime_1*A_sym_temp\n \/\/ = (A+A')*(n_ax*n_ax')*(A+A')\n Eigen::Matrix3d A_prime_2 = A_prime_1 * A_sym_temp;\n\n \/\/ scale_1 = n_ax'*A\n Eigen::RowVector3d scale_1 = n_ax.transpose() * A;\n\n \/\/ scale_2 = (scale_1*n_ax)*-4\n \/\/ = (n_ax'*A*n_ax)*-4\n double scale = (scale_1 * n_ax)(0,0) * -4.0;\n\n \/\/ A_temp = scale*A_temp\n \/\/ = scale_2*A = -4*(n_ax'*A*n_ax)*A\n Eigen::Matrix3d A_temp = A * -4.0;\n\n \/\/ Aprime = A_prime_2 + A_temp\n \/\/ = (A+A')*(n_ax*n_ax')*(A+A') - 4*(n_ax'*A*n_ax)*A\n Eigen::Matrix3d Aprime = A_prime_2 + A_temp;\n\n \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n \/\/ Calculate C prime \/\/\n \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n \/\/ C_temp = n_ax'*A\n Eigen::RowVector3d C_temp = n_ax.transpose() * A;\n\n \/\/ Cprime = -4.0*C_temp*n_ax\n \/\/ = -4.0*n_ax'*A*n_ax\n double cp = (-4.0 * C_temp) * n_ax;\n\n \/\/ Bprime = Aprime\/Cprime;\n Eigen::Matrix3d Bprime = Aprime \/ cp;\n\n \/\/ Jp = axes_def;\n \/\/ = [ax1(:),ax2(:)] = [1,0;0,1;0,0];\n Eigen::Matrix<double, 3, 2> Jp;\n Jp << 1, 0,\n 0, 1,\n 0, 0;\n\n \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n \/\/ Calculate D prime \/\/\n \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n \/\/ Dprime_temp = Jp'*Bprime\n Eigen::Matrix<double, 2, 3> Dprime_temp = Jp.transpose() * Bprime;\n\n \/\/ Dprime = Dprime_temp * Jp\n \/\/ = Jp'*Bprime*Jp\n Eigen::Matrix2d Dprime = Dprime_temp * Jp;\n\n for (size_t r = 0; r < 2; r++)\n {\n for (size_t c = 0; c < 2; c++)\n {\n if (Dprime(r, c) != Dprime(r, c))\n {\n return ellipse;\n }\n }\n }\n\n ellipse.create(2, 2, CV_32FC1);\n ellipse.at<float>(0, 0) = Dprime(0, 0);\n ellipse.at<float>(0, 1) = Dprime(0, 1);\n ellipse.at<float>(1, 0) = Dprime(1, 0);\n ellipse.at<float>(1, 1) = Dprime(1, 1);\n }\n\n return ellipse;\n }\n\n std::vector<tf::Vector3> GetEllipsePoints(\n const cv::Mat& ellipse,\n const tf::Vector3& center,\n double scale,\n int32_t num_points)\n {\n std::vector<tf::Vector3> perimeter;\n\n if (ellipse.rows == 2 && ellipse.cols == 2 && ellipse.type() == CV_32FC1 &&\n num_points > 2)\n {\n Eigen::Matrix2d Dprime;\n Dprime(0, 0) = ellipse.at<float>(0, 0);\n Dprime(0, 1) = ellipse.at<float>(0, 1);\n Dprime(1, 0) = ellipse.at<float>(1, 0);\n Dprime(1, 1) = ellipse.at<float>(1, 1);\n\n Eigen::JacobiSVD<Eigen::Matrix2d> svd(Dprime, Eigen::ComputeFullV);\n\n Eigen::Vector2d Sigma = svd.singularValues();\n Eigen::Matrix2d Vt = svd.matrixV().transpose();\n\n double xprime_scale = std::sqrt(Sigma(0));\n double yprime_scale = std::sqrt(Sigma(1));\n\n if (xprime_scale <= 0 || yprime_scale <= 0)\n {\n return perimeter;\n }\n\n Eigen::MatrixX2d Xp1(num_points, 2);\n for (int32_t i = 0; i < num_points; i++)\n {\n double phi =\n (static_cast<double>(i) \/ static_cast<double>(num_points))\n * math_util::_2pi;\n\n Xp1(i, 0) = xprime_scale * std::cos(phi) * scale;\n Xp1(i, 1) = yprime_scale * std::sin(phi) * scale;\n }\n\n \/\/ Xell = Xp1*(V')'\n Eigen::MatrixX2d Xell = Xp1 * Vt;\n\n perimeter.resize(num_points);\n for (int32_t i = 0; i < num_points; i++)\n {\n perimeter[i].setX(Xell(i, 0) + center.x());\n perimeter[i].setY(Xell(i, 1) + center.y());\n }\n }\n\n return perimeter;\n }\n}\n<commit_msg>fix typo<commit_after>\/\/ *****************************************************************************\n\/\/\n\/\/ Copyright (c) 2014, Southwest Research Institute® (SwRI®)\n\/\/ All rights reserved.\n\/\/\n\/\/ Redistribution and use in source and binary forms, with or without\n\/\/ modification, are permitted provided that the following conditions are met:\n\/\/ * Redistributions of source code must retain the above copyright\n\/\/ notice, this list of conditions and the following disclaimer.\n\/\/ * Redistributions in binary form must reproduce the above copyright\n\/\/ notice, this list of conditions and the following disclaimer in the\n\/\/ documentation and\/or other materials provided with the distribution.\n\/\/ * Neither the name of Southwest Research Institute® (SwRI®) nor the\n\/\/ names of its contributors may be used to endorse or promote products\n\/\/ derived from this software without specific prior written permission.\n\/\/\n\/\/ THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS \"AS IS\"\n\/\/ AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE\n\/\/ IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE\n\/\/ ARE DISCLAIMED. IN NO EVENT SHALL <COPYRIGHT HOLDER> BE LIABLE FOR ANY\n\/\/ DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES\n\/\/ (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;\n\/\/ LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND\n\/\/ ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT\n\/\/ (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS\n\/\/ SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.\n\/\/\n\/\/ *****************************************************************************\n\n#include <image_util\/geometry_util.h>\n\n#include <cmath>\n#include <limits>\n#include <vector>\n\n#include <QPolygonF>\n#include <QPointF>\n\n#include <opencv2\/imgproc\/imgproc.hpp>\n\n#include <Eigen\/Dense>\n#include <Eigen\/SVD>\n\n#include <math_util\/constants.h>\n\nnamespace image_util\n{\n bool Intersects(const BoundingBox& box1, const BoundingBox& box2)\n {\n return (box1 & box2).area() > 0;\n }\n\n double GetOverlappingArea(const cv::Rect& rect, const cv::Mat& rigid_transform)\n {\n \/\/ List of points corresponding to the input rectangle.\n std::vector<cv::Vec2f> points;\n\n \/\/ List of points correspondng to the transformed rectangle.\n std::vector<cv::Vec2f> points_t;\n\n \/\/ Create a point for each corner of the input rectangle.\n points.push_back(cv::Vec2f(rect.x, rect.y));\n points.push_back(cv::Vec2f(rect.x + rect.width, rect.y));\n points.push_back(cv::Vec2f(rect.x + rect.width, rect.y + rect.height));\n points.push_back(cv::Vec2f(rect.x, rect.y + rect.height));\n\n \/\/ Transform the input points to the transformed points using the rigid\n \/\/ transform.\n cv::transform(cv::InputArray(points), cv::OutputArray(points_t), rigid_transform);\n\n \/\/ Use the QPolygon object to get the intersecting area of the input\n \/\/ rectangle and the transformed rectangle.\n\n \/\/ Build the polygon corresponding to the input rectangle.\n QPolygonF polygon;\n polygon << QPointF(points[0][0], points[0][1]);\n polygon << QPointF(points[1][0], points[1][1]);\n polygon << QPointF(points[2][0], points[2][1]);\n polygon << QPointF(points[3][0], points[3][1]);\n polygon << QPointF(points[0][0], points[0][1]);\n\n \/\/ Build the polygon corresponding to the transformed rectangle.\n QPolygonF transformed_polygon;\n transformed_polygon << QPointF(points_t[0][0], points_t[0][1]);\n transformed_polygon << QPointF(points_t[1][0], points_t[1][1]);\n transformed_polygon << QPointF(points_t[2][0], points_t[2][1]);\n transformed_polygon << QPointF(points_t[3][0], points_t[3][1]);\n transformed_polygon << QPointF(points_t[0][0], points_t[0][1]);\n\n \/\/ Get the polygon representing the intersection of the input rectangle and\n \/\/ the transformed rectangle.\n QPolygonF intersection = polygon.intersected(transformed_polygon);\n\n \/\/ If the intersection is empty, then just return 0 area.\n if (intersection.size() == 0)\n {\n return 0;\n }\n\n \/\/ Build an OpenCV contour to measure the area of the intersection.\n std::vector<cv::Point2f> contour;\n for (int i = 0; i < intersection.size(); i++)\n {\n contour.push_back(cv::Point2f(intersection[i].x(), intersection[i].y()));\n }\n\n \/\/ Scale the area based on the scale factor to get the correct value.\n return cv::contourArea(contour);\n }\n\n cv::Mat ProjectEllipsoid(const cv::Mat& ellipsoid)\n {\n cv::Mat ellipse;\n\n if (ellipsoid.rows == 3 && ellipsoid.cols == 3 && ellipsoid.type() == CV_32FC1)\n {\n if (ellipsoid.at<float>(2, 2) >= std::numeric_limits<double>::max() * 0.5)\n {\n ellipse.create(2, 2, CV_32FC1);\n ellipse.at<float>(0, 0) = ellipsoid.at<float>(0, 0);\n ellipse.at<float>(0, 1) = ellipsoid.at<float>(0, 1);\n ellipse.at<float>(1, 0) = ellipsoid.at<float>(1, 0);\n ellipse.at<float>(1, 1) = ellipsoid.at<float>(1, 1);\n\n return ellipse;\n }\n\n Eigen::Matrix3d A;\n for (size_t r = 0; r < 3; r++)\n {\n for (size_t c = 0; c < 3; c++)\n {\n A(r, c) = ellipsoid.at<float>(r, c);\n }\n }\n\n \/\/ Specify the main vector directions (x and y)\n Eigen::Vector3d ax1;\n Eigen::Vector3d ax2;\n ax1 << 1, 0, 0;\n ax2 << 0, 1, 0;\n\n \/\/ Initialize the normal vector (here the normal vector, in the state\n \/\/ space is in the theta direction).\n Eigen::Vector3d n_ax;\n n_ax << 0, 0, 1;\n\n \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n \/\/ Calculate A prime \/\/\n \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n Eigen::Matrix3d A_sym_temp = A.transpose() + A;\n\n \/\/ N_ax_temp = (n_ax*n_ax')\n Eigen::Matrix3d N_ax_temp = n_ax * n_ax.transpose();\n\n \/\/ A_prime_1 = A_sym_temp*N_ax_temp\n \/\/ = (A+A')*(n_ax*n_ax')\n Eigen::Matrix3d A_prime_1 = A_sym_temp * N_ax_temp;\n\n \/\/ A_prime_2 = A_prime_1*A_sym_temp\n \/\/ = (A+A')*(n_ax*n_ax')*(A+A')\n Eigen::Matrix3d A_prime_2 = A_prime_1 * A_sym_temp;\n\n \/\/ scale_1 = n_ax'*A\n Eigen::RowVector3d scale_1 = n_ax.transpose() * A;\n\n \/\/ scale_2 = (scale_1*n_ax)*-4\n \/\/ = (n_ax'*A*n_ax)*-4\n double scale = (scale_1 * n_ax)(0,0) * -4.0;\n\n \/\/ A_temp = scale*A_temp\n \/\/ = scale_2*A = -4*(n_ax'*A*n_ax)*A\n Eigen::Matrix3d A_temp = A * scale;\n\n \/\/ Aprime = A_prime_2 + A_temp\n \/\/ = (A+A')*(n_ax*n_ax')*(A+A') - 4*(n_ax'*A*n_ax)*A\n Eigen::Matrix3d Aprime = A_prime_2 + A_temp;\n\n \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n \/\/ Calculate C prime \/\/\n \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n \/\/ C_temp = n_ax'*A\n Eigen::RowVector3d C_temp = n_ax.transpose() * A;\n\n \/\/ Cprime = -4.0*C_temp*n_ax\n \/\/ = -4.0*n_ax'*A*n_ax\n double cp = (-4.0 * C_temp) * n_ax;\n\n \/\/ Bprime = Aprime\/Cprime;\n Eigen::Matrix3d Bprime = Aprime \/ cp;\n\n \/\/ Jp = axes_def;\n \/\/ = [ax1(:),ax2(:)] = [1,0;0,1;0,0];\n Eigen::Matrix<double, 3, 2> Jp;\n Jp << 1, 0,\n 0, 1,\n 0, 0;\n\n \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n \/\/ Calculate D prime \/\/\n \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n \/\/ Dprime_temp = Jp'*Bprime\n Eigen::Matrix<double, 2, 3> Dprime_temp = Jp.transpose() * Bprime;\n\n \/\/ Dprime = Dprime_temp * Jp\n \/\/ = Jp'*Bprime*Jp\n Eigen::Matrix2d Dprime = Dprime_temp * Jp;\n\n for (size_t r = 0; r < 2; r++)\n {\n for (size_t c = 0; c < 2; c++)\n {\n if (Dprime(r, c) != Dprime(r, c))\n {\n return ellipse;\n }\n }\n }\n\n ellipse.create(2, 2, CV_32FC1);\n ellipse.at<float>(0, 0) = Dprime(0, 0);\n ellipse.at<float>(0, 1) = Dprime(0, 1);\n ellipse.at<float>(1, 0) = Dprime(1, 0);\n ellipse.at<float>(1, 1) = Dprime(1, 1);\n }\n\n return ellipse;\n }\n\n std::vector<tf::Vector3> GetEllipsePoints(\n const cv::Mat& ellipse,\n const tf::Vector3& center,\n double scale,\n int32_t num_points)\n {\n std::vector<tf::Vector3> perimeter;\n\n if (ellipse.rows == 2 && ellipse.cols == 2 && ellipse.type() == CV_32FC1 &&\n num_points > 2)\n {\n Eigen::Matrix2d Dprime;\n Dprime(0, 0) = ellipse.at<float>(0, 0);\n Dprime(0, 1) = ellipse.at<float>(0, 1);\n Dprime(1, 0) = ellipse.at<float>(1, 0);\n Dprime(1, 1) = ellipse.at<float>(1, 1);\n\n Eigen::JacobiSVD<Eigen::Matrix2d> svd(Dprime, Eigen::ComputeFullV);\n\n Eigen::Vector2d Sigma = svd.singularValues();\n Eigen::Matrix2d Vt = svd.matrixV().transpose();\n\n double xprime_scale = std::sqrt(Sigma(0));\n double yprime_scale = std::sqrt(Sigma(1));\n\n if (xprime_scale <= 0 || yprime_scale <= 0)\n {\n return perimeter;\n }\n\n Eigen::MatrixX2d Xp1(num_points, 2);\n for (int32_t i = 0; i < num_points; i++)\n {\n double phi =\n (static_cast<double>(i) \/ static_cast<double>(num_points))\n * math_util::_2pi;\n\n Xp1(i, 0) = xprime_scale * std::cos(phi) * scale;\n Xp1(i, 1) = yprime_scale * std::sin(phi) * scale;\n }\n\n \/\/ Xell = Xp1*(V')'\n Eigen::MatrixX2d Xell = Xp1 * Vt;\n\n perimeter.resize(num_points);\n for (int32_t i = 0; i < num_points; i++)\n {\n perimeter[i].setX(Xell(i, 0) + center.x());\n perimeter[i].setY(Xell(i, 1) + center.y());\n }\n }\n\n return perimeter;\n }\n}\n<|endoftext|>"} {"text":"<commit_before>\/\/ MFEM Example 5\n\/\/\n\/\/ Compile with: make ex5\n\/\/\n\/\/ Sample runs: ex5 -m ..\/data\/square-disc.mesh\n\/\/ ex5 -m ..\/data\/star.mesh\n\/\/ ex5 -m ..\/data\/beam-tet.mesh\n\/\/ ex5 -m ..\/data\/beam-hex.mesh\n\/\/ ex5 -m ..\/data\/escher.mesh\n\/\/ ex5 -m ..\/data\/fichera.mesh\n\/\/\n\/\/ Description: This example code solves a simple 2D\/3D mixed Darcy problem\n\/\/ corresponding to the saddle point system\n\/\/ k*u + grad p = f\n\/\/ - div u = g\n\/\/ with natural boundary condition -p = <given pressure>.\n\/\/ Here, we use a given exact solution (u,p) and compute the\n\/\/ corresponding r.h.s. (f,g). We discretize with Raviart-Thomas\n\/\/ finite elements (velocity u) and piecewise discontinuous\n\/\/ polynomials (pressure p).\n\/\/\n\/\/ The example demonstrates the use of the BlockMatrix class, as\n\/\/ well as the collective saving of several grid functions in a\n\/\/ VisIt (visit.llnl.gov) and ParaView (paraview.org) formats.\n\/\/\n\/\/ We recommend viewing examples 1-4 before viewing this example.\n\n#include \"mfem.hpp\"\n#include <fstream>\n#include <iostream>\n#include <algorithm>\n\nusing namespace std;\nusing namespace mfem;\n\n\/\/ Define the analytical solution and forcing terms \/ boundary conditions\nvoid uFun_ex(const Vector & x, Vector & u);\ndouble pFun_ex(const Vector & x);\nvoid fFun(const Vector & x, Vector & f);\ndouble gFun(const Vector & x);\ndouble f_natural(const Vector & x);\n\nint main(int argc, char *argv[])\n{\n StopWatch chrono;\n\n \/\/ 1. Parse command-line options.\n const char *mesh_file = \"..\/data\/star.mesh\";\n int order = 1;\n bool visualization = 1;\n\n OptionsParser args(argc, argv);\n args.AddOption(&mesh_file, \"-m\", \"--mesh\",\n \"Mesh file to use.\");\n args.AddOption(&order, \"-o\", \"--order\",\n \"Finite element order (polynomial degree).\");\n args.AddOption(&visualization, \"-vis\", \"--visualization\", \"-no-vis\",\n \"--no-visualization\",\n \"Enable or disable GLVis visualization.\");\n args.Parse();\n if (!args.Good())\n {\n args.PrintUsage(cout);\n return 1;\n }\n args.PrintOptions(cout);\n\n \/\/ 2. Read the mesh from the given mesh file. We can handle triangular,\n \/\/ quadrilateral, tetrahedral, hexahedral, surface and volume meshes with\n \/\/ the same code.\n Mesh *mesh = new Mesh(mesh_file, 1, 1);\n int dim = mesh->Dimension();\n\n \/\/ 3. Refine the mesh to increase the resolution. In this example we do\n \/\/ 'ref_levels' of uniform refinement. We choose 'ref_levels' to be the\n \/\/ largest number that gives a final mesh with no more than 10,000\n \/\/ elements.\n {\n int ref_levels =\n (int)floor(log(10000.\/mesh->GetNE())\/log(2.)\/dim);\n for (int l = 0; l < ref_levels; l++)\n {\n mesh->UniformRefinement();\n }\n }\n\n \/\/ 4. Define a finite element space on the mesh. Here we use the\n \/\/ Raviart-Thomas finite elements of the specified order.\n FiniteElementCollection *hdiv_coll(new RT_FECollection(order, dim));\n FiniteElementCollection *l2_coll(new L2_FECollection(order, dim));\n\n FiniteElementSpace *R_space = new FiniteElementSpace(mesh, hdiv_coll);\n FiniteElementSpace *W_space = new FiniteElementSpace(mesh, l2_coll);\n\n \/\/ 5. Define the BlockStructure of the problem, i.e. define the array of\n \/\/ offsets for each variable. The last component of the Array is the sum\n \/\/ of the dimensions of each block.\n Array<int> block_offsets(3); \/\/ number of variables + 1\n block_offsets[0] = 0;\n block_offsets[1] = R_space->GetVSize();\n block_offsets[2] = W_space->GetVSize();\n block_offsets.PartialSum();\n\n std::cout << \"***********************************************************\\n\";\n std::cout << \"dim(R) = \" << block_offsets[1] - block_offsets[0] << \"\\n\";\n std::cout << \"dim(W) = \" << block_offsets[2] - block_offsets[1] << \"\\n\";\n std::cout << \"dim(R+W) = \" << block_offsets.Last() << \"\\n\";\n std::cout << \"***********************************************************\\n\";\n\n \/\/ 6. Define the coefficients, analytical solution, and rhs of the PDE.\n ConstantCoefficient k(1.0);\n\n VectorFunctionCoefficient fcoeff(dim, fFun);\n FunctionCoefficient fnatcoeff(f_natural);\n FunctionCoefficient gcoeff(gFun);\n\n VectorFunctionCoefficient ucoeff(dim, uFun_ex);\n FunctionCoefficient pcoeff(pFun_ex);\n\n \/\/ 7. Allocate memory (x, rhs) for the analytical solution and the right hand\n \/\/ side. Define the GridFunction u,p for the finite element solution and\n \/\/ linear forms fform and gform for the right hand side. The data\n \/\/ allocated by x and rhs are passed as a reference to the grid functions\n \/\/ (u,p) and the linear forms (fform, gform).\n BlockVector x(block_offsets), rhs(block_offsets);\n\n LinearForm *fform(new LinearForm);\n fform->Update(R_space, rhs.GetBlock(0), 0);\n fform->AddDomainIntegrator(new VectorFEDomainLFIntegrator(fcoeff));\n fform->AddBoundaryIntegrator(new VectorFEBoundaryFluxLFIntegrator(fnatcoeff));\n fform->Assemble();\n\n LinearForm *gform(new LinearForm);\n gform->Update(W_space, rhs.GetBlock(1), 0);\n gform->AddDomainIntegrator(new DomainLFIntegrator(gcoeff));\n gform->Assemble();\n\n \/\/ 8. Assemble the finite element matrices for the Darcy operator\n \/\/\n \/\/ D = [ M B^T ]\n \/\/ [ B 0 ]\n \/\/ where:\n \/\/\n \/\/ M = \\int_\\Omega k u_h \\cdot v_h d\\Omega u_h, v_h \\in R_h\n \/\/ B = -\\int_\\Omega \\div u_h q_h d\\Omega u_h \\in R_h, q_h \\in W_h\n BilinearForm *mVarf(new BilinearForm(R_space));\n MixedBilinearForm *bVarf(new MixedBilinearForm(R_space, W_space));\n\n mVarf->AddDomainIntegrator(new VectorFEMassIntegrator(k));\n mVarf->Assemble();\n mVarf->Finalize();\n SparseMatrix &M(mVarf->SpMat());\n\n bVarf->AddDomainIntegrator(new VectorFEDivergenceIntegrator);\n bVarf->Assemble();\n bVarf->Finalize();\n SparseMatrix & B(bVarf->SpMat());\n B *= -1.;\n SparseMatrix *BT = Transpose(B);\n\n BlockMatrix darcyMatrix(block_offsets);\n darcyMatrix.SetBlock(0,0, &M);\n darcyMatrix.SetBlock(0,1, BT);\n darcyMatrix.SetBlock(1,0, &B);\n\n \/\/ 9. Construct the operators for preconditioner\n \/\/\n \/\/ P = [ diag(M) 0 ]\n \/\/ [ 0 B diag(M)^-1 B^T ]\n \/\/\n \/\/ Here we use Symmetric Gauss-Seidel to approximate the inverse of the\n \/\/ pressure Schur Complement\n SparseMatrix *MinvBt = Transpose(B);\n Vector Md(M.Height());\n M.GetDiag(Md);\n for (int i = 0; i < Md.Size(); i++)\n {\n MinvBt->ScaleRow(i, 1.\/Md(i));\n }\n SparseMatrix *S = Mult(B, *MinvBt);\n\n Solver *invM, *invS;\n invM = new DSmoother(M);\n#ifndef MFEM_USE_SUITESPARSE\n invS = new GSSmoother(*S);\n#else\n invS = new UMFPackSolver(*S);\n#endif\n\n invM->iterative_mode = false;\n invS->iterative_mode = false;\n\n BlockDiagonalPreconditioner darcyPrec(block_offsets);\n darcyPrec.SetDiagonalBlock(0, invM);\n darcyPrec.SetDiagonalBlock(1, invS);\n\n \/\/ 10. Solve the linear system with MINRES.\n \/\/ Check the norm of the unpreconditioned residual.\n int maxIter(1000);\n double rtol(1.e-6);\n double atol(1.e-10);\n\n chrono.Clear();\n chrono.Start();\n MINRESSolver solver;\n solver.SetAbsTol(atol);\n solver.SetRelTol(rtol);\n solver.SetMaxIter(maxIter);\n solver.SetOperator(darcyMatrix);\n solver.SetPreconditioner(darcyPrec);\n solver.SetPrintLevel(1);\n x = 0.0;\n solver.Mult(rhs, x);\n chrono.Stop();\n\n if (solver.GetConverged())\n std::cout << \"MINRES converged in \" << solver.GetNumIterations()\n << \" iterations with a residual norm of \" << solver.GetFinalNorm() << \".\\n\";\n else\n std::cout << \"MINRES did not converge in \" << solver.GetNumIterations()\n << \" iterations. Residual norm is \" << solver.GetFinalNorm() << \".\\n\";\n std::cout << \"MINRES solver took \" << chrono.RealTime() << \"s. \\n\";\n\n \/\/ 11. Create the grid functions u and p. Compute the L2 error norms.\n GridFunction u, p;\n u.MakeRef(R_space, x.GetBlock(0), 0);\n p.MakeRef(W_space, x.GetBlock(1), 0);\n\n int order_quad = max(2, 2*order+1);\n const IntegrationRule *irs[Geometry::NumGeom];\n for (int i=0; i < Geometry::NumGeom; ++i)\n {\n irs[i] = &(IntRules.Get(i, order_quad));\n }\n\n double err_u = u.ComputeL2Error(ucoeff, irs);\n double norm_u = ComputeLpNorm(2., ucoeff, *mesh, irs);\n double err_p = p.ComputeL2Error(pcoeff, irs);\n double norm_p = ComputeLpNorm(2., pcoeff, *mesh, irs);\n\n std::cout << \"|| u_h - u_ex || \/ || u_ex || = \" << err_u \/ norm_u << \"\\n\";\n std::cout << \"|| p_h - p_ex || \/ || p_ex || = \" << err_p \/ norm_p << \"\\n\";\n\n \/\/ 12. Save the mesh and the solution. This output can be viewed later using\n \/\/ GLVis: \"glvis -m ex5.mesh -g sol_u.gf\" or \"glvis -m ex5.mesh -g\n \/\/ sol_p.gf\".\n {\n ofstream mesh_ofs(\"ex5.mesh\");\n mesh_ofs.precision(8);\n mesh->Print(mesh_ofs);\n\n ofstream u_ofs(\"sol_u.gf\");\n u_ofs.precision(8);\n u.Save(u_ofs);\n\n ofstream p_ofs(\"sol_p.gf\");\n p_ofs.precision(8);\n p.Save(p_ofs);\n }\n\n \/\/ 13. Save data in the VisIt format\n VisItDataCollection visit_dc(\"Example5\", mesh);\n visit_dc.RegisterField(\"velocity\", &u);\n visit_dc.RegisterField(\"pressure\", &p);\n visit_dc.Save();\n\n \/\/ 14. Save data in the ParaView format\n ParaViewDataCollection paraview_dc(\"PVExample5S\", mesh);\n paraview_dc.SetLevelsOfDetail(order);\n paraview_dc.SetCycle(1);\n paraview_dc.SetDataFormat(VTUFormat::BINARY);\n paraview_dc.SetCompression(true);\n paraview_dc.SetHighOrderOutput(true);\n paraview_dc.SetTime(0.0); \/\/ set the time\n paraview_dc.RegisterField(\"velocity\",&u);\n paraview_dc.RegisterField(\"pressure\",&p);\n paraview_dc.Save();\n\n \/\/ 15. Send the solution by socket to a GLVis server.\n if (visualization)\n {\n char vishost[] = \"localhost\";\n int visport = 19916;\n socketstream u_sock(vishost, visport);\n u_sock.precision(8);\n u_sock << \"solution\\n\" << *mesh << u << \"window_title 'Velocity'\" << endl;\n socketstream p_sock(vishost, visport);\n p_sock.precision(8);\n p_sock << \"solution\\n\" << *mesh << p << \"window_title 'Pressure'\" << endl;\n }\n\n \/\/ 16. Free the used memory.\n delete fform;\n delete gform;\n delete invM;\n delete invS;\n delete S;\n delete MinvBt;\n delete BT;\n delete mVarf;\n delete bVarf;\n delete W_space;\n delete R_space;\n delete l2_coll;\n delete hdiv_coll;\n delete mesh;\n\n return 0;\n}\n\n\nvoid uFun_ex(const Vector & x, Vector & u)\n{\n double xi(x(0));\n double yi(x(1));\n double zi(0.0);\n if (x.Size() == 3)\n {\n zi = x(2);\n }\n\n u(0) = - exp(xi)*sin(yi)*cos(zi);\n u(1) = - exp(xi)*cos(yi)*cos(zi);\n\n if (x.Size() == 3)\n {\n u(2) = exp(xi)*sin(yi)*sin(zi);\n }\n}\n\n\/\/ Change if needed\ndouble pFun_ex(const Vector & x)\n{\n double xi(x(0));\n double yi(x(1));\n double zi(0.0);\n\n if (x.Size() == 3)\n {\n zi = x(2);\n }\n\n return exp(xi)*sin(yi)*cos(zi);\n}\n\nvoid fFun(const Vector & x, Vector & f)\n{\n f = 0.0;\n}\n\ndouble gFun(const Vector & x)\n{\n if (x.Size() == 3)\n {\n return -pFun_ex(x);\n }\n else\n {\n return 0;\n }\n}\n\ndouble f_natural(const Vector & x)\n{\n return (-pFun_ex(x));\n}\n<commit_msg>Add ifdef for compression in ex5<commit_after>\/\/ MFEM Example 5\n\/\/\n\/\/ Compile with: make ex5\n\/\/\n\/\/ Sample runs: ex5 -m ..\/data\/square-disc.mesh\n\/\/ ex5 -m ..\/data\/star.mesh\n\/\/ ex5 -m ..\/data\/beam-tet.mesh\n\/\/ ex5 -m ..\/data\/beam-hex.mesh\n\/\/ ex5 -m ..\/data\/escher.mesh\n\/\/ ex5 -m ..\/data\/fichera.mesh\n\/\/\n\/\/ Description: This example code solves a simple 2D\/3D mixed Darcy problem\n\/\/ corresponding to the saddle point system\n\/\/ k*u + grad p = f\n\/\/ - div u = g\n\/\/ with natural boundary condition -p = <given pressure>.\n\/\/ Here, we use a given exact solution (u,p) and compute the\n\/\/ corresponding r.h.s. (f,g). We discretize with Raviart-Thomas\n\/\/ finite elements (velocity u) and piecewise discontinuous\n\/\/ polynomials (pressure p).\n\/\/\n\/\/ The example demonstrates the use of the BlockMatrix class, as\n\/\/ well as the collective saving of several grid functions in a\n\/\/ VisIt (visit.llnl.gov) and ParaView (paraview.org) formats.\n\/\/\n\/\/ We recommend viewing examples 1-4 before viewing this example.\n\n#include \"mfem.hpp\"\n#include <fstream>\n#include <iostream>\n#include <algorithm>\n\nusing namespace std;\nusing namespace mfem;\n\n\/\/ Define the analytical solution and forcing terms \/ boundary conditions\nvoid uFun_ex(const Vector & x, Vector & u);\ndouble pFun_ex(const Vector & x);\nvoid fFun(const Vector & x, Vector & f);\ndouble gFun(const Vector & x);\ndouble f_natural(const Vector & x);\n\nint main(int argc, char *argv[])\n{\n StopWatch chrono;\n\n \/\/ 1. Parse command-line options.\n const char *mesh_file = \"..\/data\/star.mesh\";\n int order = 1;\n bool visualization = 1;\n\n OptionsParser args(argc, argv);\n args.AddOption(&mesh_file, \"-m\", \"--mesh\",\n \"Mesh file to use.\");\n args.AddOption(&order, \"-o\", \"--order\",\n \"Finite element order (polynomial degree).\");\n args.AddOption(&visualization, \"-vis\", \"--visualization\", \"-no-vis\",\n \"--no-visualization\",\n \"Enable or disable GLVis visualization.\");\n args.Parse();\n if (!args.Good())\n {\n args.PrintUsage(cout);\n return 1;\n }\n args.PrintOptions(cout);\n\n \/\/ 2. Read the mesh from the given mesh file. We can handle triangular,\n \/\/ quadrilateral, tetrahedral, hexahedral, surface and volume meshes with\n \/\/ the same code.\n Mesh *mesh = new Mesh(mesh_file, 1, 1);\n int dim = mesh->Dimension();\n\n \/\/ 3. Refine the mesh to increase the resolution. In this example we do\n \/\/ 'ref_levels' of uniform refinement. We choose 'ref_levels' to be the\n \/\/ largest number that gives a final mesh with no more than 10,000\n \/\/ elements.\n {\n int ref_levels =\n (int)floor(log(10000.\/mesh->GetNE())\/log(2.)\/dim);\n for (int l = 0; l < ref_levels; l++)\n {\n mesh->UniformRefinement();\n }\n }\n\n \/\/ 4. Define a finite element space on the mesh. Here we use the\n \/\/ Raviart-Thomas finite elements of the specified order.\n FiniteElementCollection *hdiv_coll(new RT_FECollection(order, dim));\n FiniteElementCollection *l2_coll(new L2_FECollection(order, dim));\n\n FiniteElementSpace *R_space = new FiniteElementSpace(mesh, hdiv_coll);\n FiniteElementSpace *W_space = new FiniteElementSpace(mesh, l2_coll);\n\n \/\/ 5. Define the BlockStructure of the problem, i.e. define the array of\n \/\/ offsets for each variable. The last component of the Array is the sum\n \/\/ of the dimensions of each block.\n Array<int> block_offsets(3); \/\/ number of variables + 1\n block_offsets[0] = 0;\n block_offsets[1] = R_space->GetVSize();\n block_offsets[2] = W_space->GetVSize();\n block_offsets.PartialSum();\n\n std::cout << \"***********************************************************\\n\";\n std::cout << \"dim(R) = \" << block_offsets[1] - block_offsets[0] << \"\\n\";\n std::cout << \"dim(W) = \" << block_offsets[2] - block_offsets[1] << \"\\n\";\n std::cout << \"dim(R+W) = \" << block_offsets.Last() << \"\\n\";\n std::cout << \"***********************************************************\\n\";\n\n \/\/ 6. Define the coefficients, analytical solution, and rhs of the PDE.\n ConstantCoefficient k(1.0);\n\n VectorFunctionCoefficient fcoeff(dim, fFun);\n FunctionCoefficient fnatcoeff(f_natural);\n FunctionCoefficient gcoeff(gFun);\n\n VectorFunctionCoefficient ucoeff(dim, uFun_ex);\n FunctionCoefficient pcoeff(pFun_ex);\n\n \/\/ 7. Allocate memory (x, rhs) for the analytical solution and the right hand\n \/\/ side. Define the GridFunction u,p for the finite element solution and\n \/\/ linear forms fform and gform for the right hand side. The data\n \/\/ allocated by x and rhs are passed as a reference to the grid functions\n \/\/ (u,p) and the linear forms (fform, gform).\n BlockVector x(block_offsets), rhs(block_offsets);\n\n LinearForm *fform(new LinearForm);\n fform->Update(R_space, rhs.GetBlock(0), 0);\n fform->AddDomainIntegrator(new VectorFEDomainLFIntegrator(fcoeff));\n fform->AddBoundaryIntegrator(new VectorFEBoundaryFluxLFIntegrator(fnatcoeff));\n fform->Assemble();\n\n LinearForm *gform(new LinearForm);\n gform->Update(W_space, rhs.GetBlock(1), 0);\n gform->AddDomainIntegrator(new DomainLFIntegrator(gcoeff));\n gform->Assemble();\n\n \/\/ 8. Assemble the finite element matrices for the Darcy operator\n \/\/\n \/\/ D = [ M B^T ]\n \/\/ [ B 0 ]\n \/\/ where:\n \/\/\n \/\/ M = \\int_\\Omega k u_h \\cdot v_h d\\Omega u_h, v_h \\in R_h\n \/\/ B = -\\int_\\Omega \\div u_h q_h d\\Omega u_h \\in R_h, q_h \\in W_h\n BilinearForm *mVarf(new BilinearForm(R_space));\n MixedBilinearForm *bVarf(new MixedBilinearForm(R_space, W_space));\n\n mVarf->AddDomainIntegrator(new VectorFEMassIntegrator(k));\n mVarf->Assemble();\n mVarf->Finalize();\n SparseMatrix &M(mVarf->SpMat());\n\n bVarf->AddDomainIntegrator(new VectorFEDivergenceIntegrator);\n bVarf->Assemble();\n bVarf->Finalize();\n SparseMatrix & B(bVarf->SpMat());\n B *= -1.;\n SparseMatrix *BT = Transpose(B);\n\n BlockMatrix darcyMatrix(block_offsets);\n darcyMatrix.SetBlock(0,0, &M);\n darcyMatrix.SetBlock(0,1, BT);\n darcyMatrix.SetBlock(1,0, &B);\n\n \/\/ 9. Construct the operators for preconditioner\n \/\/\n \/\/ P = [ diag(M) 0 ]\n \/\/ [ 0 B diag(M)^-1 B^T ]\n \/\/\n \/\/ Here we use Symmetric Gauss-Seidel to approximate the inverse of the\n \/\/ pressure Schur Complement\n SparseMatrix *MinvBt = Transpose(B);\n Vector Md(M.Height());\n M.GetDiag(Md);\n for (int i = 0; i < Md.Size(); i++)\n {\n MinvBt->ScaleRow(i, 1.\/Md(i));\n }\n SparseMatrix *S = Mult(B, *MinvBt);\n\n Solver *invM, *invS;\n invM = new DSmoother(M);\n#ifndef MFEM_USE_SUITESPARSE\n invS = new GSSmoother(*S);\n#else\n invS = new UMFPackSolver(*S);\n#endif\n\n invM->iterative_mode = false;\n invS->iterative_mode = false;\n\n BlockDiagonalPreconditioner darcyPrec(block_offsets);\n darcyPrec.SetDiagonalBlock(0, invM);\n darcyPrec.SetDiagonalBlock(1, invS);\n\n \/\/ 10. Solve the linear system with MINRES.\n \/\/ Check the norm of the unpreconditioned residual.\n int maxIter(1000);\n double rtol(1.e-6);\n double atol(1.e-10);\n\n chrono.Clear();\n chrono.Start();\n MINRESSolver solver;\n solver.SetAbsTol(atol);\n solver.SetRelTol(rtol);\n solver.SetMaxIter(maxIter);\n solver.SetOperator(darcyMatrix);\n solver.SetPreconditioner(darcyPrec);\n solver.SetPrintLevel(1);\n x = 0.0;\n solver.Mult(rhs, x);\n chrono.Stop();\n\n if (solver.GetConverged())\n std::cout << \"MINRES converged in \" << solver.GetNumIterations()\n << \" iterations with a residual norm of \" << solver.GetFinalNorm() << \".\\n\";\n else\n std::cout << \"MINRES did not converge in \" << solver.GetNumIterations()\n << \" iterations. Residual norm is \" << solver.GetFinalNorm() << \".\\n\";\n std::cout << \"MINRES solver took \" << chrono.RealTime() << \"s. \\n\";\n\n \/\/ 11. Create the grid functions u and p. Compute the L2 error norms.\n GridFunction u, p;\n u.MakeRef(R_space, x.GetBlock(0), 0);\n p.MakeRef(W_space, x.GetBlock(1), 0);\n\n int order_quad = max(2, 2*order+1);\n const IntegrationRule *irs[Geometry::NumGeom];\n for (int i=0; i < Geometry::NumGeom; ++i)\n {\n irs[i] = &(IntRules.Get(i, order_quad));\n }\n\n double err_u = u.ComputeL2Error(ucoeff, irs);\n double norm_u = ComputeLpNorm(2., ucoeff, *mesh, irs);\n double err_p = p.ComputeL2Error(pcoeff, irs);\n double norm_p = ComputeLpNorm(2., pcoeff, *mesh, irs);\n\n std::cout << \"|| u_h - u_ex || \/ || u_ex || = \" << err_u \/ norm_u << \"\\n\";\n std::cout << \"|| p_h - p_ex || \/ || p_ex || = \" << err_p \/ norm_p << \"\\n\";\n\n \/\/ 12. Save the mesh and the solution. This output can be viewed later using\n \/\/ GLVis: \"glvis -m ex5.mesh -g sol_u.gf\" or \"glvis -m ex5.mesh -g\n \/\/ sol_p.gf\".\n {\n ofstream mesh_ofs(\"ex5.mesh\");\n mesh_ofs.precision(8);\n mesh->Print(mesh_ofs);\n\n ofstream u_ofs(\"sol_u.gf\");\n u_ofs.precision(8);\n u.Save(u_ofs);\n\n ofstream p_ofs(\"sol_p.gf\");\n p_ofs.precision(8);\n p.Save(p_ofs);\n }\n\n \/\/ 13. Save data in the VisIt format\n VisItDataCollection visit_dc(\"Example5\", mesh);\n visit_dc.RegisterField(\"velocity\", &u);\n visit_dc.RegisterField(\"pressure\", &p);\n visit_dc.Save();\n\n \/\/ 14. Save data in the ParaView format\n ParaViewDataCollection paraview_dc(\"PVExample5S\", mesh);\n paraview_dc.SetLevelsOfDetail(order);\n paraview_dc.SetCycle(1);\n paraview_dc.SetDataFormat(VTUFormat::BINARY);\n#ifdef MFEM_USE_GZSTREAM\n paraview_dc.SetCompression(true);\n#endif\n paraview_dc.SetHighOrderOutput(true);\n paraview_dc.SetTime(0.0); \/\/ set the time\n paraview_dc.RegisterField(\"velocity\",&u);\n paraview_dc.RegisterField(\"pressure\",&p);\n paraview_dc.Save();\n\n \/\/ 15. Send the solution by socket to a GLVis server.\n if (visualization)\n {\n char vishost[] = \"localhost\";\n int visport = 19916;\n socketstream u_sock(vishost, visport);\n u_sock.precision(8);\n u_sock << \"solution\\n\" << *mesh << u << \"window_title 'Velocity'\" << endl;\n socketstream p_sock(vishost, visport);\n p_sock.precision(8);\n p_sock << \"solution\\n\" << *mesh << p << \"window_title 'Pressure'\" << endl;\n }\n\n \/\/ 16. Free the used memory.\n delete fform;\n delete gform;\n delete invM;\n delete invS;\n delete S;\n delete MinvBt;\n delete BT;\n delete mVarf;\n delete bVarf;\n delete W_space;\n delete R_space;\n delete l2_coll;\n delete hdiv_coll;\n delete mesh;\n\n return 0;\n}\n\n\nvoid uFun_ex(const Vector & x, Vector & u)\n{\n double xi(x(0));\n double yi(x(1));\n double zi(0.0);\n if (x.Size() == 3)\n {\n zi = x(2);\n }\n\n u(0) = - exp(xi)*sin(yi)*cos(zi);\n u(1) = - exp(xi)*cos(yi)*cos(zi);\n\n if (x.Size() == 3)\n {\n u(2) = exp(xi)*sin(yi)*sin(zi);\n }\n}\n\n\/\/ Change if needed\ndouble pFun_ex(const Vector & x)\n{\n double xi(x(0));\n double yi(x(1));\n double zi(0.0);\n\n if (x.Size() == 3)\n {\n zi = x(2);\n }\n\n return exp(xi)*sin(yi)*cos(zi);\n}\n\nvoid fFun(const Vector & x, Vector & f)\n{\n f = 0.0;\n}\n\ndouble gFun(const Vector & x)\n{\n if (x.Size() == 3)\n {\n return -pFun_ex(x);\n }\n else\n {\n return 0;\n }\n}\n\ndouble f_natural(const Vector & x)\n{\n return (-pFun_ex(x));\n}\n<|endoftext|>"} {"text":"<commit_before>\/****************************************************************************\n *\n * Copyright (C) 2014 PX4 Development Team. All rights reserved.\n *\n * Redistribution and use in source and binary forms, with or without\n * modification, are permitted provided that the following conditions\n * are met:\n *\n * 1. Redistributions of source code must retain the above copyright\n * notice, this list of conditions and the following disclaimer.\n * 2. Redistributions in binary form must reproduce the above copyright\n * notice, this list of conditions and the following disclaimer in\n * the documentation and\/or other materials provided with the\n * distribution.\n * 3. Neither the name PX4 nor the names of its contributors may be\n * used to endorse or promote products derived from this software\n * without specific prior written permission.\n *\n * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS\n * \"AS IS\" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT\n * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS\n * FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE\n * COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT,\n * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING,\n * BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS\n * OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED\n * AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT\n * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN\n * ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE\n * POSSIBILITY OF SUCH DAMAGE.\n *\n ****************************************************************************\/\n\n\/**\n * @file publisher_main.cpp\n * Example publisher for ros and px4\n *\n * @author Thomas Gubler <thomasgubler@gmail.com>\n *\/\n#include <string.h>\n#include <cstdlib>\n#include \"publisher_example.h\"\n\nstatic bool thread_running = false; \/**< Deamon status flag *\/\nstatic int daemon_task; \/**< Handle of deamon task \/ thread *\/\nnamespace px4\n{\nbool task_should_exit = false;\n}\nusing namespace px4;\n\nPX4_MAIN_FUNCTION(publisher);\n\n#if !defined(__linux) && !(defined(__APPLE__) && defined(__MACH__))\nextern \"C\" __EXPORT int publisher_main(int argc, char *argv[])\n{\n\tpx4::init(argc, argv, \"publisher\");\n\n\tif (argc < 1) {\n\t\terrx(1, \"usage: publisher {start|stop|status}\");\n\t}\n\n\tif (!strcmp(argv[1], \"start\")) {\n\n\t\tif (thread_running) {\n\t\t\twarnx(\"already running\");\n\t\t\t\/* this is not an error *\/\n\t\t\texit(0);\n\t\t}\n\n\t\ttask_should_exit = false;\n\n\t\tdaemon_task = task_spawn_cmd(\"publisher\",\n\t\t\t\t SCHED_DEFAULT,\n\t\t\t\t SCHED_PRIORITY_MAX - 5,\n\t\t\t\t 2000,\n\t\t\t\t publisher_task_main,\n\t\t\t\t\t(argv) ? (const char **)&argv[2] : (const char **)NULL);\n\n\t\texit(0);\n\t}\n\n\tif (!strcmp(argv[1], \"stop\")) {\n\t\ttask_should_exit = true;\n\t\texit(0);\n\t}\n\n\tif (!strcmp(argv[1], \"status\")) {\n\t\tif (thread_running) {\n\t\t\twarnx(\"is running\");\n\n\t\t} else {\n\t\t\twarnx(\"not started\");\n\t\t}\n\n\t\texit(0);\n\t}\n\n\twarnx(\"unrecognized command\");\n\treturn 1;\n}\n#endif\n\nPX4_MAIN_FUNCTION(publisher)\n{\n\tPX4_INFO(\"starting\");\n\tPublisherExample p;\n\tthread_running = true;\n\tp.main();\n\n\tPX4_INFO(\"exiting.\");\n\tthread_running = false;\n\treturn 0;\n}\n<commit_msg>move px4::init call<commit_after>\/****************************************************************************\n *\n * Copyright (C) 2014 PX4 Development Team. All rights reserved.\n *\n * Redistribution and use in source and binary forms, with or without\n * modification, are permitted provided that the following conditions\n * are met:\n *\n * 1. Redistributions of source code must retain the above copyright\n * notice, this list of conditions and the following disclaimer.\n * 2. Redistributions in binary form must reproduce the above copyright\n * notice, this list of conditions and the following disclaimer in\n * the documentation and\/or other materials provided with the\n * distribution.\n * 3. Neither the name PX4 nor the names of its contributors may be\n * used to endorse or promote products derived from this software\n * without specific prior written permission.\n *\n * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS\n * \"AS IS\" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT\n * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS\n * FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE\n * COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT,\n * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING,\n * BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS\n * OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED\n * AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT\n * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN\n * ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE\n * POSSIBILITY OF SUCH DAMAGE.\n *\n ****************************************************************************\/\n\n\/**\n * @file publisher_main.cpp\n * Example publisher for ros and px4\n *\n * @author Thomas Gubler <thomasgubler@gmail.com>\n *\/\n#include <string.h>\n#include <cstdlib>\n#include \"publisher_example.h\"\n\nstatic bool thread_running = false; \/**< Deamon status flag *\/\nstatic int daemon_task; \/**< Handle of deamon task \/ thread *\/\nnamespace px4\n{\nbool task_should_exit = false;\n}\nusing namespace px4;\n\nPX4_MAIN_FUNCTION(publisher);\n\n#if !defined(__linux) && !(defined(__APPLE__) && defined(__MACH__))\nextern \"C\" __EXPORT int publisher_main(int argc, char *argv[])\n{\n\tif (argc < 1) {\n\t\terrx(1, \"usage: publisher {start|stop|status}\");\n\t}\n\n\tif (!strcmp(argv[1], \"start\")) {\n\n\t\tif (thread_running) {\n\t\t\twarnx(\"already running\");\n\t\t\t\/* this is not an error *\/\n\t\t\texit(0);\n\t\t}\n\n\t\ttask_should_exit = false;\n\n\t\tdaemon_task = task_spawn_cmd(\"publisher\",\n\t\t\t\t SCHED_DEFAULT,\n\t\t\t\t SCHED_PRIORITY_MAX - 5,\n\t\t\t\t 2000,\n\t\t\t\t publisher_task_main,\n\t\t\t\t\t(argv) ? (const char **)&argv[2] : (const char **)NULL);\n\n\t\texit(0);\n\t}\n\n\tif (!strcmp(argv[1], \"stop\")) {\n\t\ttask_should_exit = true;\n\t\texit(0);\n\t}\n\n\tif (!strcmp(argv[1], \"status\")) {\n\t\tif (thread_running) {\n\t\t\twarnx(\"is running\");\n\n\t\t} else {\n\t\t\twarnx(\"not started\");\n\t\t}\n\n\t\texit(0);\n\t}\n\n\twarnx(\"unrecognized command\");\n\treturn 1;\n}\n#endif\n\nPX4_MAIN_FUNCTION(publisher)\n{\n\tpx4::init(argc, argv, \"publisher\");\n\n\tPX4_INFO(\"starting\");\n\tPublisherExample p;\n\tthread_running = true;\n\tp.main();\n\n\tPX4_INFO(\"exiting.\");\n\tthread_running = false;\n\treturn 0;\n}\n<|endoftext|>"} {"text":"<commit_before>\/*=========================================================================\n\n Program: Visualization Toolkit\n Module: vtkStripper.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 \"vtkStripper.h\"\n\n\/\/ Construct object with MaximumLength set to 1000.\nvtkStripper::vtkStripper()\n{\n this->MaximumLength = 1000;\n}\n\nvoid vtkStripper::Execute()\n{\n int longestStrip, longestLine, cellId, i, j, numCells, numPts;\n int numLines, numStrips, nei;\n vtkCellArray *newStrips=NULL, *inStrips, *newLines=NULL, *inLines, *inPolys;\n int numTriPts, *triPts, numLinePts, *linePts;\n vtkIdList *cellIds;\n int *pts, neighbor=0, foundOne;\n vtkPolyData *Mesh;\n char *visited;\n int numStripPts, *stripPts;\n vtkPolyData *input=(vtkPolyData *)this->Input;\n vtkPolyData *output=(vtkPolyData *)this->Output;\n vtkPointData *pd=input->GetPointData();\n\n vtkDebugMacro(<<\"Executing triangle strip \/ poly-line filter\");\n\n \/\/ build cell structure\n inStrips = input->GetStrips();\n inLines = input->GetLines();\n inPolys = input->GetPolys();\n\n Mesh = vtkPolyData::New();\n Mesh->SetPoints(input->GetPoints());\n Mesh->SetLines(inLines);\n Mesh->SetPolys(inPolys);\n Mesh->SetStrips(inStrips);\n Mesh->BuildLinks();\n\n \/\/ check input\n if ( (numCells=Mesh->GetNumberOfCells()) < 1 )\n {\n vtkErrorMacro(<<\"No data to strip!\");\n return;\n }\n\n pts = new int[this->MaximumLength + 2]; \/\/working array\n cellIds = vtkIdList::New();\n cellIds->Allocate(this->MaximumLength + 2);\n\n \/\/ pre-load existing strips\n if ( inStrips->GetNumberOfCells() > 0 || inPolys->GetNumberOfCells() > 0 )\n {\n newStrips = vtkCellArray::New();\n newStrips->Allocate(newStrips->EstimateSize(numCells,6));\n for(inStrips->InitTraversal();inStrips->GetNextCell(numStripPts,stripPts);)\n {\n newStrips->InsertNextCell(numStripPts,stripPts);\n }\n }\n\n \/\/ pre-load existing poly-lines\n if ( inLines->GetNumberOfCells() > 0 )\n {\n newLines = vtkCellArray::New();\n newLines->Allocate(newStrips->EstimateSize(numCells,6));\n for (inLines->InitTraversal(); inLines->GetNextCell(numLinePts,linePts); )\n {\n if ( numLinePts > 2 )\n {\n newLines->InsertNextCell(numLinePts,linePts);\n }\n }\n }\n\n \/\/ array keeps track of data that's been visited\n visited = new char[numCells];\n for (i=0; i < numCells; i++) visited[i] = 0;\n \/\/\n \/\/ Loop over all cells and find one that hasn't been visited.\n \/\/ Start a triangle strip (or poly-line) and mark as visited, and \n \/\/ then find a neighbor that isn't visited. Add this to the strip \n \/\/ (or poly-line) and mark as visited (and so on).\n \/\/\n longestStrip = 0; numStrips = 0;\n longestLine = 0; numLines = 0;\n\n for ( cellId=0; cellId < numCells; cellId++)\n {\n if ((cellId % 1000) == 0) \n {\n this->UpdateProgress ((float) cellId \/ (float) numCells);\n }\n if ( ! visited[cellId] )\n {\n visited[cellId] = 1;\n if ( Mesh->GetCellType(cellId) == VTK_TRIANGLE )\n {\n\t\/\/\n\t\/\/ Got a starting point for the strip. Initialize. Find a neighbor\n\t\/\/ to extend strip.\n\t\/\/\n numStrips++;\n numPts = 3;\n\n Mesh->GetCellPoints(cellId,numTriPts,triPts);\n\n for (i=0; i<3; i++) \n {\n pts[1] = triPts[i];\n pts[2] = triPts[(i+1)%3];\n\n Mesh->GetCellEdgeNeighbors(cellId, pts[1], pts[2], cellIds);\n if ( cellIds->GetNumberOfIds() > 0 && \n !visited[neighbor=cellIds->GetId(0)] &&\n Mesh->GetCellType(neighbor) == VTK_TRIANGLE )\n {\n pts[0] = triPts[(i+2)%3];\n break;\n }\n }\n\t\/\/\n\t\/\/ If no unvisited neighbor, just create the strip of one triangle.\n\t\/\/\n if ( i >= 3 ) \n {\n pts[0] = triPts[0];;\n pts[1] = triPts[1];\n pts[2] = triPts[2];\n newStrips->InsertNextCell(3,pts);\n } \n else \/\/ continue strip \n { \n\t \/\/\n\t \/\/ Have a neighbor. March along grabbing new points\n\t \/\/\n while ( neighbor >= 0 )\n {\n visited[neighbor] = 1;\n Mesh->GetCellPoints(neighbor,numTriPts, triPts);\n\n for (i=0; i<3; i++)\n if ( triPts[i] != pts[numPts-2] && \n triPts[i] != pts[numPts-1] )\n break;\n\t \n\t \/\/ only add the triangle to the strip if it isn't degenerate.\n\t if (i < 3)\n\t {\n\t pts[numPts] = triPts[i];\n\t Mesh->GetCellEdgeNeighbors(neighbor, pts[numPts], \n\t\t\t\t\t pts[numPts-1], cellIds);\n\t numPts++;\n\t }\n\t \n\t if ( numPts > longestStrip ) longestStrip = numPts;\n\t \n\t \/\/ note: if updates value of neighbor\n\t \/\/ Note2: for a degenerate triangle this test will\n\t \/\/ correctly fail because the visited[neighbor] will\n\t \/\/ now be visited\n\t if ( cellIds->GetNumberOfIds() <= 0 || \n\t\t visited[neighbor=cellIds->GetId(0)] ||\n\t\t Mesh->GetCellType(neighbor) != VTK_TRIANGLE ||\n\t\t numPts >= (this->MaximumLength+2) )\n\t {\n\t newStrips->InsertNextCell(numPts,pts);\n\t neighbor = (-1);\n\t }\n\t } \/\/ while\n\t } \/\/ else continue strip\n\t} \/\/ if triangle\n \n else if ( Mesh->GetCellType(cellId) == VTK_LINE )\n {\n\t\/\/\n\t\/\/ Got a starting point for the line. Initialize. Find a neighbor\n\t\/\/ to extend poly-line.\n\t\/\/\n numLines++;\n numPts = 2;\n\n Mesh->GetCellPoints(cellId,numLinePts,linePts);\n\n for ( foundOne=i=0; !foundOne && i<2; i++) \n {\n pts[0] = linePts[i];\n pts[1] = linePts[(i+1)%2];\n Mesh->GetPointCells(pts[1], cellIds);\n for (j=0; j < cellIds->GetNumberOfIds(); j++ )\n {\n neighbor = cellIds->GetId(j);\n if ( neighbor != cellId && !visited[neighbor] &&\n Mesh->GetCellType(neighbor) == VTK_LINE )\n {\n foundOne = 1;\n break;\n }\n }\n }\n\t\/\/\n\t\/\/ If no unvisited neighbor, just create the poly-line from one line.\n\t\/\/\n if ( !foundOne ) \n {\n\t newLines->InsertNextCell(2,linePts);\n } \n else \/\/ continue poly-line\n { \n\t \/\/\n\t \/\/ Have a neighbor. March along grabbing new points\n\t \/\/\n while ( neighbor >= 0 )\n {\n visited[neighbor] = 1;\n Mesh->GetCellPoints(neighbor, numLinePts, linePts);\n\n for (i=0; i<2; i++)\n if ( linePts[i] != pts[numPts-1] )\n break;\n\n pts[numPts] = linePts[i];\n Mesh->GetPointCells(pts[numPts], cellIds);\n if ( ++numPts > longestLine ) longestLine = numPts;\n\n \/\/ get new neighbor\n for ( j=0; j < cellIds->GetNumberOfIds(); j++ )\n {\n nei = cellIds->GetId(j);\n if ( nei != neighbor && !visited[nei] &&\n Mesh->GetCellType(nei) == VTK_LINE )\n {\n neighbor = nei;\n break;\n }\n }\n\n if ( j >= cellIds->GetNumberOfIds() ||\n numPts >= (this->MaximumLength+1) )\n {\n newLines->InsertNextCell(numPts,pts);\n neighbor = (-1);\n }\n } \/\/ while\n } \/\/ else continue strip\n } \/\/ if line\n\n } \/\/ if not visited\n } \/\/ for all elements\n \/\/\n \/\/ Update output and release memory\n \/\/\n delete [] pts;\n delete [] visited;\n Mesh->Delete();\n Mesh = NULL;\n\n output->SetPoints(input->GetPoints());\n output->GetPointData()->PassData(pd);\n\n \/\/ output strips\n if ( newStrips )\n {\n newStrips->Squeeze();\n output->SetStrips(newStrips);\n newStrips->Delete();\n vtkDebugMacro (<<\"Reduced \" << numCells << \" cells to \" << numStrips \n << \" triangle strips \\n\\t(Average \" \n << (float)numCells\/numStrips \n << \" triangles per strip, longest strip = \"\n << ((longestStrip-2)>0?(longestStrip-2):0) << \" triangles)\");\n\n }\n\n \/\/ output poly-lines\n if ( newLines )\n {\n newLines->Squeeze();\n output->SetLines(newLines);\n newLines->Delete();\n vtkDebugMacro (<<\"Reduced \" << numCells << \" cells to \" << numLines \n << \" poly-lines \\n\\t(Average \" << (float)numCells\/numLines \n << \" lines per poly-line, longest poly-line = \"\n << ((longestLine-1)>0?(longestLine-1):0) << \" lines)\");\n\n }\n\n \/\/ pass through verts\n output->SetVerts(input->GetVerts());\n cellIds->Delete();\n\n}\n\nvoid vtkStripper::PrintSelf(ostream& os, vtkIndent indent)\n{\n vtkPolyDataToPolyDataFilter::PrintSelf(os,indent);\n\n os << indent << \"Maximum Length: \" << this->MaximumLength << \"\\n\";\n\n}\n\n<commit_msg>ENH: added abort logic<commit_after>\/*=========================================================================\n\n Program: Visualization Toolkit\n Module: vtkStripper.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 \"vtkStripper.h\"\n\n\/\/ Construct object with MaximumLength set to 1000.\nvtkStripper::vtkStripper()\n{\n this->MaximumLength = 1000;\n}\n\nvoid vtkStripper::Execute()\n{\n int longestStrip, longestLine, cellId, i, j, numCells, numPts;\n int numLines, numStrips, nei;\n vtkCellArray *newStrips=NULL, *inStrips, *newLines=NULL, *inLines, *inPolys;\n int numTriPts, *triPts, numLinePts, *linePts;\n vtkIdList *cellIds;\n int *pts, neighbor=0, foundOne;\n vtkPolyData *Mesh;\n char *visited;\n int numStripPts, *stripPts;\n vtkPolyData *input=(vtkPolyData *)this->Input;\n vtkPolyData *output=(vtkPolyData *)this->Output;\n vtkPointData *pd=input->GetPointData();\n\n vtkDebugMacro(<<\"Executing triangle strip \/ poly-line filter\");\n\n \/\/ build cell structure\n inStrips = input->GetStrips();\n inLines = input->GetLines();\n inPolys = input->GetPolys();\n\n Mesh = vtkPolyData::New();\n Mesh->SetPoints(input->GetPoints());\n Mesh->SetLines(inLines);\n Mesh->SetPolys(inPolys);\n Mesh->SetStrips(inStrips);\n Mesh->BuildLinks();\n\n \/\/ check input\n if ( (numCells=Mesh->GetNumberOfCells()) < 1 )\n {\n vtkErrorMacro(<<\"No data to strip!\");\n return;\n }\n\n pts = new int[this->MaximumLength + 2]; \/\/working array\n cellIds = vtkIdList::New();\n cellIds->Allocate(this->MaximumLength + 2);\n\n \/\/ pre-load existing strips\n if ( inStrips->GetNumberOfCells() > 0 || inPolys->GetNumberOfCells() > 0 )\n {\n newStrips = vtkCellArray::New();\n newStrips->Allocate(newStrips->EstimateSize(numCells,6));\n for(inStrips->InitTraversal();inStrips->GetNextCell(numStripPts,stripPts);)\n {\n newStrips->InsertNextCell(numStripPts,stripPts);\n }\n }\n\n \/\/ pre-load existing poly-lines\n if ( inLines->GetNumberOfCells() > 0 )\n {\n newLines = vtkCellArray::New();\n newLines->Allocate(newStrips->EstimateSize(numCells,6));\n for (inLines->InitTraversal(); inLines->GetNextCell(numLinePts,linePts); )\n {\n if ( numLinePts > 2 )\n {\n newLines->InsertNextCell(numLinePts,linePts);\n }\n }\n }\n\n \/\/ array keeps track of data that's been visited\n visited = new char[numCells];\n for (i=0; i < numCells; i++) visited[i] = 0;\n \/\/\n \/\/ Loop over all cells and find one that hasn't been visited.\n \/\/ Start a triangle strip (or poly-line) and mark as visited, and \n \/\/ then find a neighbor that isn't visited. Add this to the strip \n \/\/ (or poly-line) and mark as visited (and so on).\n \/\/\n longestStrip = 0; numStrips = 0;\n longestLine = 0; numLines = 0;\n\n for ( cellId=0; cellId < numCells; cellId++)\n {\n if ((cellId % 1000) == 0) \n {\n this->UpdateProgress ((float) cellId \/ (float) numCells);\n if (this->GetAbortExecute())\n {\n break;\n }\n }\n if ( ! visited[cellId] )\n {\n visited[cellId] = 1;\n if ( Mesh->GetCellType(cellId) == VTK_TRIANGLE )\n {\n\t\/\/\n\t\/\/ Got a starting point for the strip. Initialize. Find a neighbor\n\t\/\/ to extend strip.\n\t\/\/\n numStrips++;\n numPts = 3;\n\n Mesh->GetCellPoints(cellId,numTriPts,triPts);\n\n for (i=0; i<3; i++) \n {\n pts[1] = triPts[i];\n pts[2] = triPts[(i+1)%3];\n\n Mesh->GetCellEdgeNeighbors(cellId, pts[1], pts[2], cellIds);\n if ( cellIds->GetNumberOfIds() > 0 && \n !visited[neighbor=cellIds->GetId(0)] &&\n Mesh->GetCellType(neighbor) == VTK_TRIANGLE )\n {\n pts[0] = triPts[(i+2)%3];\n break;\n }\n }\n\t\/\/\n\t\/\/ If no unvisited neighbor, just create the strip of one triangle.\n\t\/\/\n if ( i >= 3 ) \n {\n pts[0] = triPts[0];;\n pts[1] = triPts[1];\n pts[2] = triPts[2];\n newStrips->InsertNextCell(3,pts);\n } \n else \/\/ continue strip \n { \n\t \/\/\n\t \/\/ Have a neighbor. March along grabbing new points\n\t \/\/\n while ( neighbor >= 0 )\n {\n visited[neighbor] = 1;\n Mesh->GetCellPoints(neighbor,numTriPts, triPts);\n\n for (i=0; i<3; i++)\n if ( triPts[i] != pts[numPts-2] && \n triPts[i] != pts[numPts-1] )\n break;\n\t \n\t \/\/ only add the triangle to the strip if it isn't degenerate.\n\t if (i < 3)\n\t {\n\t pts[numPts] = triPts[i];\n\t Mesh->GetCellEdgeNeighbors(neighbor, pts[numPts], \n\t\t\t\t\t pts[numPts-1], cellIds);\n\t numPts++;\n\t }\n\t \n\t if ( numPts > longestStrip ) longestStrip = numPts;\n\t \n\t \/\/ note: if updates value of neighbor\n\t \/\/ Note2: for a degenerate triangle this test will\n\t \/\/ correctly fail because the visited[neighbor] will\n\t \/\/ now be visited\n\t if ( cellIds->GetNumberOfIds() <= 0 || \n\t\t visited[neighbor=cellIds->GetId(0)] ||\n\t\t Mesh->GetCellType(neighbor) != VTK_TRIANGLE ||\n\t\t numPts >= (this->MaximumLength+2) )\n\t {\n\t newStrips->InsertNextCell(numPts,pts);\n\t neighbor = (-1);\n\t }\n\t } \/\/ while\n\t } \/\/ else continue strip\n\t} \/\/ if triangle\n \n else if ( Mesh->GetCellType(cellId) == VTK_LINE )\n {\n\t\/\/\n\t\/\/ Got a starting point for the line. Initialize. Find a neighbor\n\t\/\/ to extend poly-line.\n\t\/\/\n numLines++;\n numPts = 2;\n\n Mesh->GetCellPoints(cellId,numLinePts,linePts);\n\n for ( foundOne=i=0; !foundOne && i<2; i++) \n {\n pts[0] = linePts[i];\n pts[1] = linePts[(i+1)%2];\n Mesh->GetPointCells(pts[1], cellIds);\n for (j=0; j < cellIds->GetNumberOfIds(); j++ )\n {\n neighbor = cellIds->GetId(j);\n if ( neighbor != cellId && !visited[neighbor] &&\n Mesh->GetCellType(neighbor) == VTK_LINE )\n {\n foundOne = 1;\n break;\n }\n }\n }\n\t\/\/\n\t\/\/ If no unvisited neighbor, just create the poly-line from one line.\n\t\/\/\n if ( !foundOne ) \n {\n\t newLines->InsertNextCell(2,linePts);\n } \n else \/\/ continue poly-line\n { \n\t \/\/\n\t \/\/ Have a neighbor. March along grabbing new points\n\t \/\/\n while ( neighbor >= 0 )\n {\n visited[neighbor] = 1;\n Mesh->GetCellPoints(neighbor, numLinePts, linePts);\n\n for (i=0; i<2; i++)\n if ( linePts[i] != pts[numPts-1] )\n break;\n\n pts[numPts] = linePts[i];\n Mesh->GetPointCells(pts[numPts], cellIds);\n if ( ++numPts > longestLine ) longestLine = numPts;\n\n \/\/ get new neighbor\n for ( j=0; j < cellIds->GetNumberOfIds(); j++ )\n {\n nei = cellIds->GetId(j);\n if ( nei != neighbor && !visited[nei] &&\n Mesh->GetCellType(nei) == VTK_LINE )\n {\n neighbor = nei;\n break;\n }\n }\n\n if ( j >= cellIds->GetNumberOfIds() ||\n numPts >= (this->MaximumLength+1) )\n {\n newLines->InsertNextCell(numPts,pts);\n neighbor = (-1);\n }\n } \/\/ while\n } \/\/ else continue strip\n } \/\/ if line\n\n } \/\/ if not visited\n } \/\/ for all elements\n \/\/\n \/\/ Update output and release memory\n \/\/\n delete [] pts;\n delete [] visited;\n Mesh->Delete();\n Mesh = NULL;\n\n output->SetPoints(input->GetPoints());\n output->GetPointData()->PassData(pd);\n\n \/\/ output strips\n if ( newStrips )\n {\n newStrips->Squeeze();\n output->SetStrips(newStrips);\n newStrips->Delete();\n vtkDebugMacro (<<\"Reduced \" << numCells << \" cells to \" << numStrips \n << \" triangle strips \\n\\t(Average \" \n << (float)numCells\/numStrips \n << \" triangles per strip, longest strip = \"\n << ((longestStrip-2)>0?(longestStrip-2):0) << \" triangles)\");\n\n }\n\n \/\/ output poly-lines\n if ( newLines )\n {\n newLines->Squeeze();\n output->SetLines(newLines);\n newLines->Delete();\n vtkDebugMacro (<<\"Reduced \" << numCells << \" cells to \" << numLines \n << \" poly-lines \\n\\t(Average \" << (float)numCells\/numLines \n << \" lines per poly-line, longest poly-line = \"\n << ((longestLine-1)>0?(longestLine-1):0) << \" lines)\");\n\n }\n\n \/\/ pass through verts\n output->SetVerts(input->GetVerts());\n cellIds->Delete();\n\n}\n\nvoid vtkStripper::PrintSelf(ostream& os, vtkIndent indent)\n{\n vtkPolyDataToPolyDataFilter::PrintSelf(os,indent);\n\n os << indent << \"Maximum Length: \" << this->MaximumLength << \"\\n\";\n\n}\n\n<|endoftext|>"} {"text":"<commit_before>\/*\n * Copyright (C) 2004, 2006-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\/\/\/ \\brief Sample demonstration of URBI capabilities.\n\/*\n * This is a port to URBI of the Sony OPEN-R balltrackinghead example.\n * The algorithms used are as close as possible to the original version.\n *\/\n#include <libport\/cmath>\n\n#include <vector>\n\n#include <urbi\/uclient.hh>\n#include <urbi\/uconversion.hh>\n\n#ifndef LIBURBI_OPENR\n# include \"monitor.h\"\nMonitor* mon = NULL;\n#endif\n\n\/\/inline double fabs(double a) {return a>0?a:(a*-1);}\ninline double fsgn (double a)\n{\n return a>0?1:-1;\n}\n\nstruct PositionData\n{\n int frame;\n double value;\n bool operator == (int f) {return f==frame;}\n};\n\n\nclass BallTrackingHead\n{\n public:\n BallTrackingHead(const char * robotName);\n\n \/\/callback functions\n urbi::UCallbackAction getHead(bool pan, const urbi::UMessage &msg);\n urbi::UCallbackAction getImage(const urbi::UMessage &msg);\n\n private:\n \/\/\/ Client for image reception.\n urbi::UClient robotI;\n \/\/\/ Client for command sending.\n urbi::UClient robotC;\n \/\/\/ Client for command reception.\n \/\/\/ urbi::UClient robotG;\n\n \/\/joint value for the last few frames\n std::vector<PositionData> current_x, current_y;\n \/\/ base of current_x, current_y (currentx[i] = frame_base - i)\n int baseframeX, baseframeY;\n unsigned char image[500000]; \/\/uncompressed image\n double target_x, target_y; \/\/command to center the ball\n double expect_x, expect_y; \/\/values in last command, that should be reached\n\n\n void doSendCommand(double current_x, double current_y);\n\n static const int VSIZE = 10; \/\/size of the joint position list.\n static const int ball_treshold = 50;\n static const double factor_x; \/\/x field of view\n static const double factor_y; \/\/y field of view\n static const double maxcommand_x;\n static const double maxcommand_y;\n};\n\nconst double BallTrackingHead::factor_x = 0.9 * 56.9;\nconst double BallTrackingHead::factor_y = 0.9 * 45.2;\nconst double BallTrackingHead::maxcommand_x = 150.0;\nconst double BallTrackingHead::maxcommand_y = 150.0;\n\nint format=1;\n\nvoid BallTrackingHead::doSendCommand(double current_x, double current_y)\n{\n static int sframe=0;\n static unsigned int stime=0;\n double command_x=-1, command_y=-1;\n robotC.send(\"headPan.val = headPan.val + %lf\"\n \" & headTilt.val = headTilt.val + %lf,\",\n target_x, target_y);\n if (! (sframe % 1000))\n {\n if (stime)\n\trobotC.printf(\"!! csps %f\\n\",\n\t\t 1000000.0\/(float)(robotC.getCurrentTime()-stime));\n stime=robotC.getCurrentTime();\n }\n ++sframe;\n return;\n if (fabs(current_x-expect_x)< 100)\n {\n if (fabs(target_x - current_x) > maxcommand_x)\n\tcommand_x = current_x + maxcommand_x*fsgn(target_x - current_x);\n else\n\tcommand_x = target_x;\n if (fabs(command_x-current_x) > 0.0)\n {\n\trobotC.send(\"headPan.val = %lf,\",command_x);\n\texpect_x = command_x;\n }\n else\n\tcommand_x = -1;\n }\n if (fabs(current_y-expect_y)< 100)\n {\n if (fabs(target_y - current_y) > maxcommand_y)\n\tcommand_y = current_y + maxcommand_y*fsgn(target_y - current_y);\n else\n\tcommand_y = target_y;\n if (fabs(command_y-current_y) > 0.0)\n {\n\trobotC.send(\"headTilt.val = %lf,\",command_y);\n\texpect_y = command_y;\n }\n else\n\tcommand_y = -1;\n }\n\n if (command_x!=-1 || command_y!=-1)\n {\n if (! (sframe % 1000))\n\t{\n\t if (stime)\n\t robotC.printf(\"!! csps %f\\n\",\n\t\t\t 1000000.0\/(float)(robotC.getCurrentTime()-stime));\n\t stime=robotC.getCurrentTime();\n\t}\n ++sframe;\n }\n}\n\n\nurbi::UCallbackAction\nBallTrackingHead::getHead(bool pan, const urbi::UMessage &msg)\n{\n if (msg.type != urbi::MESSAGE_DATA\n || msg.value->type != urbi::DATA_DOUBLE)\n return urbi::URBI_CONTINUE;\n\n PositionData pd;\n pd.frame = msg.timestamp\/32;\n pd.value = msg.value->val;\n if (pan)\n {\n current_x.insert(current_x.begin(), pd);\n current_x.resize(VSIZE);\n }\n else\n {\n current_y.insert(current_y.begin(), pd);\n current_y.resize(VSIZE);\n }\n\n return urbi::URBI_CONTINUE;\n}\n\nurbi::UCallbackAction\nBallTrackingHead::getImage(const urbi::UMessage &msg)\n{\n static int framenum=0;\n static float interframe=0;\n static int frametime=0;\n\n if (msg.type != urbi::MESSAGE_DATA\n || msg.value->type != urbi::DATA_BINARY\n || msg.value->binary->type != urbi::BINARY_IMAGE)\n return urbi::URBI_CONTINUE;\n\n urbi::UImage& img = msg.value->binary->image;\n double cx=0, cy=0;\n \/*\n std::vector<PositionData>::iterator it =\n find(current_x.begin(), current_x.end(), msg.timestamp\/32);\n if (it==current_x.end())\n {\n return URBI_CONTINUE;\n }\n double cx = it->value;\n it = find(current_y.begin(), current_y.end(), msg.timestamp\/32);\n if (it==current_y.end())\n {\n return URBI_CONTINUE;\n }\n double cy = it->value;\n *\/\n if ((framenum % 50)==0)\n {\n if (!frametime)\n\tframetime=robotC.getCurrentTime();\n else\n\t{\n\t int dt=robotC.getCurrentTime()-frametime;\n\t frametime=robotC.getCurrentTime();\n\t if (interframe == 0)\n\t interframe=((float)dt)\/50.0;\n\t else\n\t interframe=interframe*0.5 + 0.5*((float)dt)\/50.0;\n\t robotC.printf(\"## %f fps\\n\",1000.0\/interframe);\n\t}\n }\n ++framenum;\n size_t imgsize = 500000;\n if (img.imageFormat == urbi::IMAGE_JPEG)\n {\n size_t w, h;\n urbi::convertJPEGtoYCrCb((const urbi::byte *) img.data,\n\t\t\t img.size, &image, imgsize, w, h);\n }\n else\n memcpy(image, img.data, img.width * img.height * 3);\n\n\n \/\/get ball centroid\n int xsum=0, ysum=0;\n int nummatch=0;\n int w = img.width;\n int h = img.height;\n for (unsigned i=0;i<img.width; ++i)\n for (unsigned j=0;j<img.height; ++j)\n {\n\tunsigned char cb = image[(i+j*w)*3+1];\n\tunsigned char cr = image[(i+j*w)*3+2];;\n\tif (150 <= cr && cr<=230\n\t && 120 <= cb && cb<=190)\n\t {\n\t ++nummatch;\n\t xsum+=i;\n\t ysum+=j;\n\t }\n }\n if (nummatch >= ball_treshold)\n {\n double bx= (double)xsum \/ (double)nummatch;\n double by= (double)ysum \/ (double)nummatch;\n double dbx = bx - (double)w \/ 2.0;\n double dby = by - (double)h \/ 2.0;\n\n double dx = (-1.0) * (factor_x \/ (double)w) * dbx;\n double dy = (-1.0) * (factor_y \/ (double)h) * dby;\n\n#ifndef LIBURBI_OPENR\n for (int j=0;j<h; ++j)\n\timage[(((int)bx)+w*j)*3]=255;\n for (int j=0;j<w; ++j)\n\timage[(((int)by)*w+j)*3]=255;\n#endif\n\n target_x = cx+dx;\n target_y = cy+dy;\n if (target_x > 90.0)\n\ttarget_x = 90.0;\n if (target_x < -90.0)\n\ttarget_x = -90.0;\n if (target_y > 60.0)\n\ttarget_y = 60.0;\n if (target_y < -30.0)\n\ttarget_y = -30.0;\n doSendCommand(cx, cy);\n\n }\n\n#ifndef LIBURBI_OPENR\n urbi::convertYCrCbtoRGB(image, w*h*3, image);\n if (!mon)\n mon = new Monitor(w, h, \"Image\");\n mon->setImage((bits8*)image, img.width*img.height*3);\n#endif\n\n return urbi::URBI_CONTINUE;\n}\n\n\nBallTrackingHead::BallTrackingHead(const char * robotname)\n : robotI (robotname),\n robotC (robotname)\n \/\/, robotG (robotname)\n{\n robotI.start();\n if (robotI.error())\n urbi::exit(1);\n robotC.start();\n if (robotC.error())\n urbi::exit(1);\n\n\n robotC.send(\"motoron;\");\n robotC.send(\"camera.format = 1;\");\n#ifdef LIBURBI_OPENR\n robotC.send(\"camera.resolution = 1;\");\n#else\n robotC.send(\"camera.resolution = 0;\");\n#endif\n robotC.send(\"camera.jpegfactor = 75;\");\n robotC.setCallback(*this, &BallTrackingHead::getImage,\"cam\");\n\n robotC.send(\"loop cam << camera.val, \");\n \/\/robotG.send(\"loop {pan << headPan.val& tilt << headTilt.val},\");\n}\n\n\nint\nmain(int argc, char * argv[])\n{\n const char* host = urbi::UClient::default_host();\n if (argc != 2)\n printf(\"usage: %s robotname\\n\", argv[0]);\n else\n host = argv[1];\n BallTrackingHead bt(host);\n \/\/ Help GCC understand we really want this variable to be \"used\".\n (void) bt;\n urbi::execute();\n}\n<commit_msg>Update call to convertJPEG*.<commit_after>\/*\n * Copyright (C) 2004, 2006-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\/\/\/ \\brief Sample demonstration of URBI capabilities.\n\/*\n * This is a port to URBI of the Sony OPEN-R balltrackinghead example.\n * The algorithms used are as close as possible to the original version.\n *\/\n#include <libport\/cmath>\n\n#include <vector>\n\n#include <urbi\/uclient.hh>\n#include <urbi\/uconversion.hh>\n\n#ifndef LIBURBI_OPENR\n# include \"monitor.h\"\nMonitor* mon = NULL;\n#endif\n\n\/\/inline double fabs(double a) {return a>0?a:(a*-1);}\ninline double fsgn (double a)\n{\n return a>0?1:-1;\n}\n\nstruct PositionData\n{\n int frame;\n double value;\n bool operator == (int f) {return f==frame;}\n};\n\n\nclass BallTrackingHead\n{\n public:\n BallTrackingHead(const char * robotName);\n\n \/\/callback functions\n urbi::UCallbackAction getHead(bool pan, const urbi::UMessage &msg);\n urbi::UCallbackAction getImage(const urbi::UMessage &msg);\n\n private:\n \/\/\/ Client for image reception.\n urbi::UClient robotI;\n \/\/\/ Client for command sending.\n urbi::UClient robotC;\n \/\/\/ Client for command reception.\n \/\/\/ urbi::UClient robotG;\n\n \/\/joint value for the last few frames\n std::vector<PositionData> current_x, current_y;\n \/\/ base of current_x, current_y (currentx[i] = frame_base - i)\n int baseframeX, baseframeY;\n unsigned char image[500000]; \/\/uncompressed image\n double target_x, target_y; \/\/command to center the ball\n double expect_x, expect_y; \/\/values in last command, that should be reached\n\n\n void doSendCommand(double current_x, double current_y);\n\n static const int VSIZE = 10; \/\/size of the joint position list.\n static const int ball_treshold = 50;\n static const double factor_x; \/\/x field of view\n static const double factor_y; \/\/y field of view\n static const double maxcommand_x;\n static const double maxcommand_y;\n};\n\nconst double BallTrackingHead::factor_x = 0.9 * 56.9;\nconst double BallTrackingHead::factor_y = 0.9 * 45.2;\nconst double BallTrackingHead::maxcommand_x = 150.0;\nconst double BallTrackingHead::maxcommand_y = 150.0;\n\nint format=1;\n\nvoid BallTrackingHead::doSendCommand(double current_x, double current_y)\n{\n static int sframe=0;\n static unsigned int stime=0;\n double command_x=-1, command_y=-1;\n robotC.send(\"headPan.val = headPan.val + %lf\"\n \" & headTilt.val = headTilt.val + %lf,\",\n target_x, target_y);\n if (! (sframe % 1000))\n {\n if (stime)\n\trobotC.printf(\"!! csps %f\\n\",\n\t\t 1000000.0\/(float)(robotC.getCurrentTime()-stime));\n stime=robotC.getCurrentTime();\n }\n ++sframe;\n return;\n if (fabs(current_x-expect_x)< 100)\n {\n if (fabs(target_x - current_x) > maxcommand_x)\n\tcommand_x = current_x + maxcommand_x*fsgn(target_x - current_x);\n else\n\tcommand_x = target_x;\n if (fabs(command_x-current_x) > 0.0)\n {\n\trobotC.send(\"headPan.val = %lf,\",command_x);\n\texpect_x = command_x;\n }\n else\n\tcommand_x = -1;\n }\n if (fabs(current_y-expect_y)< 100)\n {\n if (fabs(target_y - current_y) > maxcommand_y)\n\tcommand_y = current_y + maxcommand_y*fsgn(target_y - current_y);\n else\n\tcommand_y = target_y;\n if (fabs(command_y-current_y) > 0.0)\n {\n\trobotC.send(\"headTilt.val = %lf,\",command_y);\n\texpect_y = command_y;\n }\n else\n\tcommand_y = -1;\n }\n\n if (command_x!=-1 || command_y!=-1)\n {\n if (! (sframe % 1000))\n\t{\n\t if (stime)\n\t robotC.printf(\"!! csps %f\\n\",\n\t\t\t 1000000.0\/(float)(robotC.getCurrentTime()-stime));\n\t stime=robotC.getCurrentTime();\n\t}\n ++sframe;\n }\n}\n\n\nurbi::UCallbackAction\nBallTrackingHead::getHead(bool pan, const urbi::UMessage &msg)\n{\n if (msg.type != urbi::MESSAGE_DATA\n || msg.value->type != urbi::DATA_DOUBLE)\n return urbi::URBI_CONTINUE;\n\n PositionData pd;\n pd.frame = msg.timestamp\/32;\n pd.value = msg.value->val;\n if (pan)\n {\n current_x.insert(current_x.begin(), pd);\n current_x.resize(VSIZE);\n }\n else\n {\n current_y.insert(current_y.begin(), pd);\n current_y.resize(VSIZE);\n }\n\n return urbi::URBI_CONTINUE;\n}\n\nurbi::UCallbackAction\nBallTrackingHead::getImage(const urbi::UMessage &msg)\n{\n static int framenum=0;\n static float interframe=0;\n static int frametime=0;\n\n if (msg.type != urbi::MESSAGE_DATA\n || msg.value->type != urbi::DATA_BINARY\n || msg.value->binary->type != urbi::BINARY_IMAGE)\n return urbi::URBI_CONTINUE;\n\n urbi::UImage& img = msg.value->binary->image;\n double cx=0, cy=0;\n \/*\n std::vector<PositionData>::iterator it =\n find(current_x.begin(), current_x.end(), msg.timestamp\/32);\n if (it==current_x.end())\n {\n return URBI_CONTINUE;\n }\n double cx = it->value;\n it = find(current_y.begin(), current_y.end(), msg.timestamp\/32);\n if (it==current_y.end())\n {\n return URBI_CONTINUE;\n }\n double cy = it->value;\n *\/\n if ((framenum % 50)==0)\n {\n if (!frametime)\n\tframetime=robotC.getCurrentTime();\n else\n\t{\n\t int dt=robotC.getCurrentTime()-frametime;\n\t frametime=robotC.getCurrentTime();\n\t if (interframe == 0)\n\t interframe=((float)dt)\/50.0;\n\t else\n\t interframe=interframe*0.5 + 0.5*((float)dt)\/50.0;\n\t robotC.printf(\"## %f fps\\n\",1000.0\/interframe);\n\t}\n }\n ++framenum;\n size_t imgsize = 500000;\n if (img.imageFormat == urbi::IMAGE_JPEG)\n {\n size_t w, h;\n urbi::convertJPEGtoYCrCb((const urbi::byte *) img.data, img.size,\n (urbi::byte **) &image, imgsize\n , w, h);\n }\n else\n memcpy(image, img.data, img.width * img.height * 3);\n\n\n \/\/get ball centroid\n int xsum=0, ysum=0;\n int nummatch=0;\n int w = img.width;\n int h = img.height;\n for (unsigned i=0;i<img.width; ++i)\n for (unsigned j=0;j<img.height; ++j)\n {\n\tunsigned char cb = image[(i+j*w)*3+1];\n\tunsigned char cr = image[(i+j*w)*3+2];;\n\tif (150 <= cr && cr<=230\n\t && 120 <= cb && cb<=190)\n\t {\n\t ++nummatch;\n\t xsum+=i;\n\t ysum+=j;\n\t }\n }\n if (nummatch >= ball_treshold)\n {\n double bx= (double)xsum \/ (double)nummatch;\n double by= (double)ysum \/ (double)nummatch;\n double dbx = bx - (double)w \/ 2.0;\n double dby = by - (double)h \/ 2.0;\n\n double dx = (-1.0) * (factor_x \/ (double)w) * dbx;\n double dy = (-1.0) * (factor_y \/ (double)h) * dby;\n\n#ifndef LIBURBI_OPENR\n for (int j=0;j<h; ++j)\n\timage[(((int)bx)+w*j)*3]=255;\n for (int j=0;j<w; ++j)\n\timage[(((int)by)*w+j)*3]=255;\n#endif\n\n target_x = cx+dx;\n target_y = cy+dy;\n if (target_x > 90.0)\n\ttarget_x = 90.0;\n if (target_x < -90.0)\n\ttarget_x = -90.0;\n if (target_y > 60.0)\n\ttarget_y = 60.0;\n if (target_y < -30.0)\n\ttarget_y = -30.0;\n doSendCommand(cx, cy);\n\n }\n\n#ifndef LIBURBI_OPENR\n urbi::convertYCrCbtoRGB(image, w*h*3, image);\n if (!mon)\n mon = new Monitor(w, h, \"Image\");\n mon->setImage((bits8*)image, img.width*img.height*3);\n#endif\n\n return urbi::URBI_CONTINUE;\n}\n\n\nBallTrackingHead::BallTrackingHead(const char * robotname)\n : robotI (robotname),\n robotC (robotname)\n \/\/, robotG (robotname)\n{\n robotI.start();\n if (robotI.error())\n urbi::exit(1);\n robotC.start();\n if (robotC.error())\n urbi::exit(1);\n\n\n robotC.send(\"motoron;\");\n robotC.send(\"camera.format = 1;\");\n#ifdef LIBURBI_OPENR\n robotC.send(\"camera.resolution = 1;\");\n#else\n robotC.send(\"camera.resolution = 0;\");\n#endif\n robotC.send(\"camera.jpegfactor = 75;\");\n robotC.setCallback(*this, &BallTrackingHead::getImage,\"cam\");\n\n robotC.send(\"loop cam << camera.val, \");\n \/\/robotG.send(\"loop {pan << headPan.val& tilt << headTilt.val},\");\n}\n\n\nint\nmain(int argc, char * argv[])\n{\n const char* host = urbi::UClient::default_host();\n if (argc != 2)\n printf(\"usage: %s robotname\\n\", argv[0]);\n else\n host = argv[1];\n BallTrackingHead bt(host);\n \/\/ Help GCC understand we really want this variable to be \"used\".\n (void) bt;\n urbi::execute();\n}\n<|endoftext|>"} {"text":"<commit_before>\/* Copyright (c) 2011-2013, AOYAMA Kazuharu\n * All rights reserved.\n *\n * This software may be used and distributed according to the terms of\n * the New BSD License, which is incorporated herein by reference.\n *\/\n\n#include <QtCore>\n#include <sys\/sysctl.h>\n#include <sys\/types.h>\n#include <signal.h>\n#include \"processinfo.h\"\n\nnamespace TreeFrog {\n\n\nbool ProcessInfo::exists() const\n{\n return allConcurrentPids().contains(processId);\n}\n\n\nQString ProcessInfo::processName() const\n{\n QString ret;\n struct kinfo_proc kp;\n size_t bufSize = sizeof(struct kinfo_proc);\n int mib[4] = { CTL_KERN, KERN_PROC, KERN_PROC_PID, processId };\n \n if (sysctl(mib, 4, &kp, &bufSize, NULL, 0) == 0) {\n ret.append(kp.kp_proc.p_comm);\n }\n return ret;\n}\n\n\nQList<qint64> ProcessInfo::allConcurrentPids()\n{\n QList<qint64> ret;\n struct kinfo_proc *kp;\n size_t bufSize = 0;\n int mib[3] = { CTL_KERN, KERN_PROC, KERN_PROC_ALL };\n \n if (sysctl(mib, 3, NULL, &bufSize, NULL, 0) == 0) {\n kp = (struct kinfo_proc *) new char[bufSize];\n if (sysctl(mib, 3, kp, &bufSize, NULL, 0) == 0) { \n for (size_t i = 0; i < (bufSize \/ sizeof(struct kinfo_proc)); ++i) {\n qint64 pid = kp[i].kp_proc.p_pid;\n if (pid > 0)\n ret.prepend(pid);\n }\n }\n delete[] kp;\n }\n \n qSort(ret.begin(), ret.end()); \/\/ Sorts the items\n return ret;\n}\n\n\nvoid ProcessInfo::terminate()\n{\n if (processId > 0) {\n ::kill(processId, SIGTERM);\n }\n}\n\n\nvoid ProcessInfo::kill()\n{\n if (processId > 0) {\n ::kill(processId, SIGKILL);\n }\n processId = -1;\n}\n\n\nvoid ProcessInfo::restart()\n{\n if (processId > 0) {\n ::kill(processId, SIGHUP);\n }\n}\n\n} \/\/ namespace TreeFrog\n<commit_msg>added get-ppid function for OS X.<commit_after>\/* Copyright (c) 2011-2013, AOYAMA Kazuharu\n * All rights reserved.\n *\n * This software may be used and distributed according to the terms of\n * the New BSD License, which is incorporated herein by reference.\n *\/\n\n#include <QtCore>\n#include <sys\/sysctl.h>\n#include <sys\/types.h>\n#include <signal.h>\n#include \"processinfo.h\"\n\nnamespace TreeFrog {\n\n\nbool ProcessInfo::exists() const\n{\n return allConcurrentPids().contains(processId);\n}\n\n\nqint64 ProcessInfo::ppid() const\n{\n qint64 ppid = 0;\n struct kinfo_proc kp;\n size_t bufSize = sizeof(struct kinfo_proc);\n int mib[4] = { CTL_KERN, KERN_PROC, KERN_PROC_PID, processId };\n\n if (sysctl(mib, 4, &kp, &bufSize, NULL, 0) == 0) {\n ppid = kp.kp_eproc.e_ppid;\n }\n return ppid;\n}\n\n\nQString ProcessInfo::processName() const\n{\n QString ret;\n struct kinfo_proc kp;\n size_t bufSize = sizeof(struct kinfo_proc);\n int mib[4] = { CTL_KERN, KERN_PROC, KERN_PROC_PID, processId };\n\n if (sysctl(mib, 4, &kp, &bufSize, NULL, 0) == 0) {\n ret.append(kp.kp_proc.p_comm);\n }\n return ret;\n}\n\n\nQList<qint64> ProcessInfo::allConcurrentPids()\n{\n QList<qint64> ret;\n struct kinfo_proc *kp;\n size_t bufSize = 0;\n int mib[3] = { CTL_KERN, KERN_PROC, KERN_PROC_ALL };\n\n if (sysctl(mib, 3, NULL, &bufSize, NULL, 0) == 0) {\n kp = (struct kinfo_proc *) new char[bufSize];\n if (sysctl(mib, 3, kp, &bufSize, NULL, 0) == 0) { \n for (size_t i = 0; i < (bufSize \/ sizeof(struct kinfo_proc)); ++i) {\n qint64 pid = kp[i].kp_proc.p_pid;\n if (pid > 0)\n ret.prepend(pid);\n }\n }\n delete[] kp;\n }\n\n qSort(ret.begin(), ret.end()); \/\/ Sorts the items\n return ret;\n}\n\n\nvoid ProcessInfo::terminate()\n{\n if (processId > 0) {\n ::kill(processId, SIGTERM);\n }\n}\n\n\nvoid ProcessInfo::kill()\n{\n if (processId > 0) {\n ::kill(processId, SIGKILL);\n }\n processId = -1;\n}\n\n\nvoid ProcessInfo::restart()\n{\n if (processId > 0) {\n ::kill(processId, SIGHUP);\n }\n}\n\n} \/\/ namespace TreeFrog\n<|endoftext|>"} {"text":"<commit_before>#ifndef ALEPH_PERSISTENT_HOMOLOGY_PHI_PERSISTENCE_HH__\n#define ALEPH_PERSISTENT_HOMOLOGY_PHI_PERSISTENCE_HH__\n\n#include <aleph\/persistenceDiagrams\/PersistenceDiagram.hh>\n\n#include <aleph\/persistentHomology\/Calculation.hh>\n\n#include <aleph\/topology\/Conversions.hh>\n#include <aleph\/topology\/Intersections.hh>\n#include <aleph\/topology\/SimplicialComplex.hh>\n\n#include <initializer_list>\n#include <map>\n#include <stdexcept>\n#include <utility>\n#include <vector>\n\nnamespace aleph\n{\n\n\/**\n Partitions a simplicial complex according to its $\\phi$-persistence\n values. This follows the persistent intersection homology algorithm\n in:\n\n Persistent Intersection Homology\n Paul Bendich and John Harer\n\n The function expects a simplicial complex $K$ and a function $\\phi$\n that determines whether a simplex is proper or not. The function is\n going to create a new simplicial complex. This complex contains all\n proper simplices (in their original order) followed by all improper\n ones.\n*\/\n\ntemplate <class Simplex, class Function> std::pair<topology::SimplicialComplex<Simplex>, std::size_t> partition( const topology::SimplicialComplex<Simplex>& K, Function phi )\n{\n topology::SimplicialComplex<Simplex> L;\n\n for( auto&& simplex : K )\n {\n if( phi(simplex) )\n L.push_back( simplex );\n }\n\n auto s = L.size();\n\n for( auto&& simplex : K )\n {\n if( !phi(simplex) )\n L.push_back( simplex );\n }\n\n return std::make_pair( L, s );\n}\n\n\/**\n @class Perversity\n @brief Perversity model in the sense of intersection homology\n\n Models a perversity in the sense of intersection homology. The class\n ensures that all values satisfy\n\n \\f\n -1 \\leq p_k \\leq k-1\n \\f\n*\/\n\nclass Perversity\n{\npublic:\n\n \/**\n Creates a new perversity from a range of values. The values must be\n at least implicitly convertible to integers.\n *\/\n\n template <class InputIterator> Perversity( InputIterator begin, InputIterator end )\n : _values( begin, end )\n {\n for( std::size_t k = 0; k < _values.size(); k++ )\n {\n if( _values[k] < -1 )\n _values[k] = -1;\n \/\/ There is an index shift going on here: since $k$ runs from $0$\n \/\/ to $d-1$, there is no need to shift the upper bound.\n else if( _values[k] > static_cast<int>( k ) )\n _values[k] = static_cast<int>( k );\n }\n }\n\n \/** Creates a new perversity from an initializer list of values *\/\n Perversity( std::initializer_list<int> values )\n : Perversity( values.begin(), values.end() )\n {\n }\n\n \/**\n Queries the perversity value in a given dimension $d$. Invalid\n dimension values only cause the function to return a zero.\n *\/\n\n int operator()( std::size_t d ) const noexcept\n {\n if( d < _values.size() + 1 )\n return _values[ static_cast<std::size_t>( d-1 ) ];\n else\n return 0;\n }\n\nprivate:\n std::vector<int> _values;\n};\n\ntemplate <class Simplex> auto calculateIntersectionHomology( const aleph::topology::SimplicialComplex<Simplex>& K,\n const std::vector< aleph::topology::SimplicialComplex<Simplex> >& X,\n const Perversity& p ) -> std::vector< PersistenceDiagram<typename Simplex::DataType> >\n{\n \/\/ 0. Check consistency of strata\n \/\/ 1. Create allowability function based on the dimensionality of the\n \/\/ intersection of simplices with individual strata.\n \/\/ 2. Calculate $phi$-persistence\n \/\/ 3. Convert the result into a persistence diagram.\n\n \/\/ Check consistency of filtration -----------------------------------\n \/\/\n \/\/ The maximum dimension of each complex in the filtration has to\n \/\/ match the dimension of the simplicial complex.\n\n {\n std::size_t minDimension = K.dimension();\n std::size_t maxDimension = 0;\n\n for( auto&& x : X )\n {\n minDimension = std::min( minDimension, x.dimension() );\n maxDimension = std::max( maxDimension, x.dimension() );\n }\n\n if( maxDimension != K.dimension() )\n throw std::runtime_error( \"Invalid filtration\" );\n }\n\n \/\/ Check whether simplex is allowable --------------------------------\n\n std::map<Simplex, bool> phi;\n\n {\n auto d = K.dimension();\n\n for( auto&& s : K )\n {\n bool admissible = true;\n\n for( std::size_t k = 1; k <= d; k++ )\n {\n \/\/ The notation follows Bendich and Harer, so $i$ is actually\n \/\/ referring to a dimension instead of an index. Beware!\n auto i = s.dimension();\n auto intersection = aleph::topology::intersect( X.at( d - k ), s );\n auto dimension = intersection.empty() ? -1 : static_cast<long>( intersection.rbegin()->dimension() );\n admissible = admissible && intersection.empty() ? true : static_cast<long>( dimension ) <= ( long(i) - long(k) + long( p(k) ) );\n }\n\n phi[s] = admissible;\n }\n }\n\n \/\/ Partition according to allowable simplices ------------------------\n\n aleph::topology::SimplicialComplex<Simplex> L;\n std::size_t s = 0;\n\n std::tie( L, s ) =\n aleph::partition( K, [&phi] ( const Simplex& s )\n {\n return phi.at(s);\n } );\n\n \/\/ Calculate persistent intersection homology ------------------------\n\n auto boundaryMatrix = aleph::topology::makeBoundaryMatrix( L, s );\n using IndexType = typename decltype(boundaryMatrix)::Index;\n bool includeAllUnpairedCreators = true;\n auto pairing = aleph::calculatePersistencePairing( boundaryMatrix, includeAllUnpairedCreators, static_cast<IndexType>(s) );\n auto persistenceDiagrams = aleph::makePersistenceDiagrams( pairing, L );\n\n return persistenceDiagrams;\n}\n\n} \/\/ namespace aleph\n\n#endif\n<commit_msg>Output operator for perversities<commit_after>#ifndef ALEPH_PERSISTENT_HOMOLOGY_PHI_PERSISTENCE_HH__\n#define ALEPH_PERSISTENT_HOMOLOGY_PHI_PERSISTENCE_HH__\n\n#include <aleph\/persistenceDiagrams\/PersistenceDiagram.hh>\n\n#include <aleph\/persistentHomology\/Calculation.hh>\n\n#include <aleph\/topology\/Conversions.hh>\n#include <aleph\/topology\/Intersections.hh>\n#include <aleph\/topology\/SimplicialComplex.hh>\n\n#include <initializer_list>\n#include <map>\n#include <ostream>\n#include <stdexcept>\n#include <utility>\n#include <vector>\n\nnamespace aleph\n{\n\n\/**\n Partitions a simplicial complex according to its $\\phi$-persistence\n values. This follows the persistent intersection homology algorithm\n in:\n\n Persistent Intersection Homology\n Paul Bendich and John Harer\n\n The function expects a simplicial complex $K$ and a function $\\phi$\n that determines whether a simplex is proper or not. The function is\n going to create a new simplicial complex. This complex contains all\n proper simplices (in their original order) followed by all improper\n ones.\n*\/\n\ntemplate <class Simplex, class Function> std::pair<topology::SimplicialComplex<Simplex>, std::size_t> partition( const topology::SimplicialComplex<Simplex>& K, Function phi )\n{\n topology::SimplicialComplex<Simplex> L;\n\n for( auto&& simplex : K )\n {\n if( phi(simplex) )\n L.push_back( simplex );\n }\n\n auto s = L.size();\n\n for( auto&& simplex : K )\n {\n if( !phi(simplex) )\n L.push_back( simplex );\n }\n\n return std::make_pair( L, s );\n}\n\n\/**\n @class Perversity\n @brief Perversity model in the sense of intersection homology\n\n Models a perversity in the sense of intersection homology. The class\n ensures that all values satisfy\n\n \\f\n -1 \\leq p_k \\leq k-1\n \\f\n*\/\n\nclass Perversity\n{\npublic:\n\n \/**\n Creates a new perversity from a range of values. The values must be\n at least implicitly convertible to integers.\n *\/\n\n template <class InputIterator> Perversity( InputIterator begin, InputIterator end )\n : _values( begin, end )\n {\n for( std::size_t k = 0; k < _values.size(); k++ )\n {\n if( _values[k] < -1 )\n _values[k] = -1;\n \/\/ There is an index shift going on here: since $k$ runs from $0$\n \/\/ to $d-1$, there is no need to shift the upper bound.\n else if( _values[k] > static_cast<int>( k ) )\n _values[k] = static_cast<int>( k );\n }\n }\n\n \/** Creates a new perversity from an initializer list of values *\/\n Perversity( std::initializer_list<int> values )\n : Perversity( values.begin(), values.end() )\n {\n }\n\n \/**\n Queries the perversity value in a given dimension $d$. Invalid\n dimension values only cause the function to return a zero.\n *\/\n\n int operator()( std::size_t d ) const noexcept\n {\n if( d < _values.size() + 1 )\n return _values[ static_cast<std::size_t>( d-1 ) ];\n else\n return 0;\n }\n\n using const_iterator = typename std::vector<int>::const_iterator;\n\n const_iterator begin() const noexcept { return _values.begin(); }\n const_iterator end() const noexcept { return _values.end(); }\n\nprivate:\n std::vector<int> _values;\n};\n\nstd::ostream& operator<<( std::ostream& o, const Perversity p )\n{\n o << \"[\";\n\n for( auto it = p.begin(); it != p.end(); ++it )\n {\n if( it != p.begin() )\n o << \",\";\n\n o << *it;\n }\n\n o << \"]\";\n\n return o;\n}\n\ntemplate <class Simplex> auto calculateIntersectionHomology( const aleph::topology::SimplicialComplex<Simplex>& K,\n const std::vector< aleph::topology::SimplicialComplex<Simplex> >& X,\n const Perversity& p ) -> std::vector< PersistenceDiagram<typename Simplex::DataType> >\n{\n \/\/ 0. Check consistency of strata\n \/\/ 1. Create allowability function based on the dimensionality of the\n \/\/ intersection of simplices with individual strata.\n \/\/ 2. Calculate $phi$-persistence\n \/\/ 3. Convert the result into a persistence diagram.\n\n \/\/ Check consistency of filtration -----------------------------------\n \/\/\n \/\/ The maximum dimension of each complex in the filtration has to\n \/\/ match the dimension of the simplicial complex.\n\n {\n std::size_t minDimension = K.dimension();\n std::size_t maxDimension = 0;\n\n for( auto&& x : X )\n {\n minDimension = std::min( minDimension, x.dimension() );\n maxDimension = std::max( maxDimension, x.dimension() );\n }\n\n if( maxDimension != K.dimension() )\n throw std::runtime_error( \"Invalid filtration\" );\n }\n\n \/\/ Check whether simplex is allowable --------------------------------\n\n std::map<Simplex, bool> phi;\n\n {\n auto d = K.dimension();\n\n for( auto&& s : K )\n {\n bool admissible = true;\n\n for( std::size_t k = 1; k <= d; k++ )\n {\n \/\/ The notation follows Bendich and Harer, so $i$ is actually\n \/\/ referring to a dimension instead of an index. Beware!\n auto i = s.dimension();\n auto intersection = aleph::topology::intersect( X.at( d - k ), s );\n auto dimension = intersection.empty() ? -1 : static_cast<long>( intersection.rbegin()->dimension() );\n admissible = admissible && intersection.empty() ? true : static_cast<long>( dimension ) <= ( long(i) - long(k) + long( p(k) ) );\n }\n\n phi[s] = admissible;\n }\n }\n\n \/\/ Partition according to allowable simplices ------------------------\n\n aleph::topology::SimplicialComplex<Simplex> L;\n std::size_t s = 0;\n\n std::tie( L, s ) =\n aleph::partition( K, [&phi] ( const Simplex& s )\n {\n return phi.at(s);\n } );\n\n \/\/ Calculate persistent intersection homology ------------------------\n\n auto boundaryMatrix = aleph::topology::makeBoundaryMatrix( L, s );\n using IndexType = typename decltype(boundaryMatrix)::Index;\n bool includeAllUnpairedCreators = true;\n auto pairing = aleph::calculatePersistencePairing( boundaryMatrix, includeAllUnpairedCreators, static_cast<IndexType>(s) );\n auto persistenceDiagrams = aleph::makePersistenceDiagrams( pairing, L );\n\n return persistenceDiagrams;\n}\n\n} \/\/ namespace aleph\n\n#endif\n<|endoftext|>"} {"text":"<commit_before>\/\/ Copyright 2008 Google Inc. All Rights Reserved.\n\/\/ Author: manzagop@google.com (Pierre-Antoine Manzagol)\n\n#include <sstream>\n#include \"base\/google.h\"\n#include \"file\/base\/file.h\"\n#include \"third_party\/Torch3\/Allocator.h\"\n#include \"third_party\/Torch3\/ClassFormatDataSet.h\"\n#include \"third_party\/Torch3\/OneHotClassFormat.h\"\n#include \"third_party\/Torch3\/Measurer.h\"\n#include \"third_party\/Torch3\/MSEMeasurer.h\"\n#include \"third_party\/Torch3\/ClassMeasurer.h\"\n#include \"third_party\/Torch3\/ClassNLLMeasurer.h\"\n#include \"experimental\/torch3google\/GoogleMatDataSet.h\"\n#include \"experimental\/torch3google\/GoogleDiskXFile.h\"\n\n#include \"experimental\/popnnet\/mains\/helpers.h\"\n\nDEFINE_string(model_filename, \"\", \"the model filename\");\nDEFINE_string(test_data_file, \"\/home\/manzagop\/data\/mnist\/mnist_test.txt\", \"name of the test file\");\nDEFINE_string(expdir, \"reload\", \"location where to write the expdir folder\");\n\/\/ --- Task ---\nDEFINE_string(task, \"mnist\", \"name of the task\");\nDEFINE_int32(n_inputs, 784, \"number of inputs\");\nDEFINE_int32(n_classes, 10, \"number of targets\");\n\/\/ --- Stuff ---\nDEFINE_int32(max_load, -1, \"max number of examples to load for train\");\nDEFINE_bool(binary_mode, false, \"binary mode for files\");\n\n\nusing namespace Torch;\n\n\/\/ ************\n\/\/ *** MAIN ***\n\/\/ ************\nint main(int argc, char **argv)\n{\n InitGoogle(argv[0], &argc, &argv, true);\n File::Init();\n Allocator *allocator = new Allocator;\n\n CHECK(File::RecursivelyCreateDir(FLAGS_expdir.c_str(), mode_t(0755)));\n\n \/\/ data\n GoogleMatDataSet test_matdata(FLAGS_test_data_file.c_str(), FLAGS_n_inputs,1,false,\n FLAGS_max_load, FLAGS_binary_mode);\n ClassFormatDataSet test_data(&test_matdata,FLAGS_n_classes);\n OneHotClassFormat class_format(&test_data); \/\/ Not sure about this... what if not all classes were in the test set?\n\n \/\/ model\n CommunicatingStackedAutoencoder *csae = LoadCSAE(allocator, FLAGS_model_filename);\n\n \/\/ measurers\n MeasurerList measurers;\n\n string measurer_filename;\n measurer_filename = FLAGS_expdir + \"\/nll.txt\";\n GoogleDiskXFile *file_nll = new(allocator) GoogleDiskXFile(measurer_filename.c_str(),\"w\");\n ClassNLLMeasurer *measurer_nll = new(allocator) ClassNLLMeasurer(csae->outputs, &test_data,\n &class_format, file_nll);\n measurers.addNode(measurer_nll);\n\n measurer_filename = FLAGS_expdir + \"\/class.txt\";\n GoogleDiskXFile *file_class = new(allocator) GoogleDiskXFile(measurer_filename.c_str(),\"w\");\n ClassMeasurer *measurer_class = new(allocator) ClassMeasurer(csae->outputs, &test_data,\n &class_format, file_class);\n measurers.addNode(measurer_class);\n\n \/\/ trainer\n StochasticGradient trainer(csae, NULL);\n trainer.test(&measurers);\n\n delete allocator;\n return(0);\n\n}\n<commit_msg>Modifications to use Torch style arguments \/ options.<commit_after>\/\/ Copyright 2008 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\/\/\nconst char *help = \"\\\nsae_load\\n\\\n\\n\\\nThis program will load a model and test it on a dataset.\\n\\\n\\n\";\n\n#include <string>\n#include <sstream>\n\n#include \"CmdLine.h\"\n#include \"Allocator.h\"\n#include \"ClassFormatDataSet.h\"\n#include \"OneHotClassFormat.h\"\n#include \"Measurer.h\"\n#include \"MSEMeasurer.h\"\n#include \"ClassMeasurer.h\"\n#include \"ClassNLLMeasurer.h\"\n#include \"MatDataSet.h\"\n#include \"DiskXFile.h\"\n#include \"helpers.h\"\n\n\nusing namespace Torch;\n\n\/\/ ************\n\/\/ *** MAIN ***\n\/\/ ************\nint main(int argc, char **argv)\n{\n\n \/\/ === The command-line ===\n\n int flag_n_inputs;\n int flag_n_classes;\n char *flag_model_filename;\n char *flag_testdata_filename;\n\n char *flag_expdir;\n char *flag_task;\n int flag_max_load;\n bool flag_binary_mode;\n\n \/\/ Construct the command line\n CmdLine cmd;\n\n \/\/ Put the help line at the beginning\n cmd.info(help);\n\n cmd.addText(\"\\nArguments:\");\n\n cmd.addICmdArg(\"-n_inputs\", &flag_n_inputs, \"number of inputs\");\n cmd.addICmdArg(\"-n_classes\", &flag_n_classes, \"number of targets\");\n cmd.addSCmdArg(\"-model_filename\", &flag_model_filename, \"the model filename\");\n cmd.addSCmdArg(\"-testdata_filename\", &flag_testdata_filename, \"name of the test file\");\n\n cmd.addText(\"\\nOptions:\");\n cmd.addSCmdOption(\"-expdir\", &flag_expdir, \".\/\", \"Location where to write the expdir folder.\", true);\n cmd.addSCmdOption(\"-task\", &flag_task, \"\", \"name of the task\", true);\n cmd.addICmdOption(\"max_load\", &flag_max_load, -1, \"max number of examples to load for train\", true);\n cmd.addBCmdOption(\"binary_mode\", &flag_binary_mode, false, \"binary mode for files\", true);\n\n \/\/ Read the command line\n cmd.read(argc, argv);\n\n Allocator *allocator = new Allocator;\n\n std::string str_expdir = flag_expdir;\n if(str_expdir != \".\/\") {\n warning(\"Calling non portable mkdir!\");\n std::stringstream command;\n command << \"mkdir \" << flag_expdir;\n system(command.str().c_str());\n }\n\n \/\/ data\n MatDataSet test_matdata(flag_testdata_filename, flag_n_inputs,1,false,\n flag_max_load, flag_binary_mode);\n ClassFormatDataSet test_data(&test_matdata,flag_n_classes);\n OneHotClassFormat class_format(&test_data); \/\/ Not sure about this... what if not all classes were in the test set?\n\n \/\/ model\n CommunicatingStackedAutoencoder *csae = LoadCSAE(allocator, flag_model_filename);\n\n \/\/ measurers\n MeasurerList measurers;\n\n std::stringstream measurer_filename;\n measurer_filename << flag_expdir << \"\/nll.txt\";\n DiskXFile *file_nll = new(allocator) DiskXFile(measurer_filename.str().c_str(),\"w\");\n ClassNLLMeasurer *measurer_nll = new(allocator) ClassNLLMeasurer(csae->outputs, &test_data,\n &class_format, file_nll);\n measurers.addNode(measurer_nll);\n\n measurer_filename.str(\"\");\n measurer_filename.clear();\n\n measurer_filename << flag_expdir << \"\/class.txt\";\n DiskXFile *file_class = new(allocator) DiskXFile(measurer_filename.str().c_str(),\"w\");\n ClassMeasurer *measurer_class = new(allocator) ClassMeasurer(csae->outputs, &test_data,\n &class_format, file_class);\n measurers.addNode(measurer_class);\n\n \/\/ trainer\n StochasticGradient trainer(csae, NULL);\n trainer.test(&measurers);\n\n delete allocator;\n return(0);\n\n}\n<|endoftext|>"} {"text":"<commit_before>\/\/\n\/\/ Copyright (c) 2013-2014 Christoph Malek\n\/\/ See LICENSE for more information.\n\/\/\n\n#ifndef RJ_CORE_MAIN_MENU_LEVEL_SQUARES_HPP\n#define RJ_CORE_MAIN_MENU_LEVEL_SQUARES_HPP\n\n\n#include \"basic_component.hpp\"\n#include \"level_square.hpp\"\n#include <rectojump\/core\/render.hpp>\n#include <rectojump\/shared\/level_manager\/level_manager.hpp>\n\n#include <mlk\/signals_slots\/slot.h>\n\n\nnamespace rj\n{\n\tenum class scroll_dir : char\n\t{up, down, none};\n\n\ttemplate<typename Main_Menu>\n\tclass level_squares : public basic_component\n\t{\n\t\tMain_Menu& m_mainmenu;\n\n\t\tconst vec2f m_square_size{100, 100};\n\t\tstd::vector<level_square<Main_Menu>> m_squares;\n\t\tstd::size_t m_current_index{0};\n\n\t\tscroll_dir m_sdir{scroll_dir::none};\n\t\tfloat m_scrollstep{1.5f};\n\n\tpublic:\n\t\tmlk::slot<const level_id&> on_level_load;\n\n\t\tlevel_squares(Main_Menu& mm) :\n\t\t\tbasic_component{mm.get_gamehandler().get_game(), mm.get_font(), mm.get_center()},\n\t\t\tm_mainmenu{mm}\n\t\t{this->init();}\n\n\t\tvoid update(dur duration)\n\t\t{\n\t\t\tif(m_squares[m_current_index].get_position().y > m_center.y + 5.f) \/\/ 5: add some 'space'\n\t\t\t\tthis->scroll(scroll_dir::down);\n\t\t\telse if(m_squares[m_current_index].get_position().y < m_center.y - 5.f)\n\t\t\t\tthis->scroll(scroll_dir::up);\n\t\t\telse\n\t\t\t\tthis->scroll_stop();\n\n\t\t\tfor(auto& a : m_squares)\n\t\t\t{\n\t\t\t\ta.update(duration);\n\t\t\t\ta.deactivate();\n\n\t\t\t\tif(m_sdir == scroll_dir::down) a.move({0.f, -m_scrollstep});\n\t\t\t\telse if(m_sdir == scroll_dir::up) a.move({0.f, m_scrollstep});\n\t\t\t}\n\n\t\t\tm_squares[m_current_index].activate();\n\t\t}\n\n\t\tvoid render()\n\t\t{\n\t\t\tfor(auto& a : m_squares)\n\t\t\t\ta.render();\n\t\t}\n\n\t\tvoid scroll(scroll_dir dir) noexcept\n\t\t{m_sdir = dir;}\n\n\t\tvoid scroll_stop() noexcept\n\t\t{m_sdir = scroll_dir::none;}\n\n\t\tvoid on_key_up() noexcept\n\t\t{\n\t\t\tif(m_current_index <= 0)\n\t\t\t\tm_current_index = this->max_index();\n\t\t\telse\n\t\t\t\t--m_current_index;\n\t\t}\n\n\t\tvoid on_key_down() noexcept\n\t\t{\n\t\t\tif(m_current_index >= this->max_index())\n\t\t\t\tm_current_index = 0;\n\t\t\telse\n\t\t\t\t++m_current_index;\n\t\t}\n\n\t\tvoid call_current_event() override\n\t\t{on_level_load(\"\");}\n\n\tprivate:\n\t\tvoid init()\n\t\t{\n\t\t\tauto pos_y(0.f);\n\n\t\t\tfor(auto& a : m_mainmenu.get_gamehandler().get_levelmgr().get_levels())\n\t\t\t{\n\t\t\t\tauto& lv(a.second);\n\t\t\t\tauto& inf(lv.info);\n\n\t\t\t\tm_squares.emplace_back(m_mainmenu, vec2f{m_center.x, pos_y}, m_square_size,\n\t\t\t\t\t\t\t\t\t \"Name\", mlk::stl_string::str_format(\"Creator: %%\\nDate: %%\", inf.creator_name, inf.creation_date));\n\t\t\t\tpos_y += m_squares.back().get_height();\n\t\t\t}\n\t\t}\n\n\t\tstd::size_t num_items() const noexcept\n\t\t{return m_squares.size();}\n\n\t\tstd::size_t max_index() const noexcept\n\t\t{return this->num_items() - 1;}\n\t};\n}\n\n\n#endif \/\/ RJ_CORE_MAIN_MENU_LEVEL_SQUARES_HPP\n<commit_msg>level_sqaures: loading current selected level<commit_after>\/\/\n\/\/ Copyright (c) 2013-2014 Christoph Malek\n\/\/ See LICENSE for more information.\n\/\/\n\n#ifndef RJ_CORE_MAIN_MENU_LEVEL_SQUARES_HPP\n#define RJ_CORE_MAIN_MENU_LEVEL_SQUARES_HPP\n\n\n#include \"basic_component.hpp\"\n#include \"level_square.hpp\"\n#include <rectojump\/core\/render.hpp>\n#include <rectojump\/shared\/level_manager\/level_manager.hpp>\n\n#include <mlk\/signals_slots\/slot.h>\n\n\nnamespace rj\n{\n\tenum class scroll_dir : char\n\t{up, down, none};\n\n\ttemplate<typename Main_Menu>\n\tclass level_squares : public basic_component\n\t{\n\t\tMain_Menu& m_mainmenu;\n\n\t\tconst vec2f m_square_size{100, 100};\n\t\tstd::vector<level_square<Main_Menu>> m_squares;\n\t\tstd::size_t m_current_index{0};\n\n\t\tscroll_dir m_sdir{scroll_dir::none};\n\t\tfloat m_scrollstep{1.5f};\n\n\tpublic:\n\t\tmlk::slot<const level_id&> on_level_load;\n\n\t\tlevel_squares(Main_Menu& mm) :\n\t\t\tbasic_component{mm.get_gamehandler().get_game(), mm.get_font(), mm.get_center()},\n\t\t\tm_mainmenu{mm}\n\t\t{this->init();}\n\n\t\tvoid update(dur duration)\n\t\t{\n\t\t\tif(m_squares[m_current_index].get_position().y > m_center.y + 5.f) \/\/ 5: add some 'space'\n\t\t\t\tthis->scroll(scroll_dir::down);\n\t\t\telse if(m_squares[m_current_index].get_position().y < m_center.y - 5.f)\n\t\t\t\tthis->scroll(scroll_dir::up);\n\t\t\telse\n\t\t\t\tthis->scroll_stop();\n\n\t\t\tfor(auto& a : m_squares)\n\t\t\t{\n\t\t\t\ta.update(duration);\n\t\t\t\ta.deactivate();\n\n\t\t\t\tif(m_sdir == scroll_dir::down) a.move({0.f, -m_scrollstep});\n\t\t\t\telse if(m_sdir == scroll_dir::up) a.move({0.f, m_scrollstep});\n\t\t\t}\n\n\t\t\tm_squares[m_current_index].activate();\n\t\t}\n\n\t\tvoid render()\n\t\t{\n\t\t\tfor(auto& a : m_squares)\n\t\t\t\ta.render();\n\t\t}\n\n\t\tvoid scroll(scroll_dir dir) noexcept\n\t\t{m_sdir = dir;}\n\n\t\tvoid scroll_stop() noexcept\n\t\t{m_sdir = scroll_dir::none;}\n\n\t\tvoid on_key_up() noexcept\n\t\t{\n\t\t\tif(m_current_index <= 0)\n\t\t\t\tm_current_index = this->max_index();\n\t\t\telse\n\t\t\t\t--m_current_index;\n\t\t}\n\n\t\tvoid on_key_down() noexcept\n\t\t{\n\t\t\tif(m_current_index >= this->max_index())\n\t\t\t\tm_current_index = 0;\n\t\t\telse\n\t\t\t\t++m_current_index;\n\t\t}\n\n\t\tvoid call_current_event() override\n\t\t{on_level_load(m_squares[m_current_index].get_id());}\n\n\tprivate:\n\t\tvoid init()\n\t\t{\n\t\t\tauto pos_y(0.f);\n\n\t\t\tfor(auto& a : m_mainmenu.get_gamehandler().get_levelmgr().get_levels())\n\t\t\t{\n\t\t\t\tauto& id(a.first);\n\t\t\t\tauto& lv(a.second);\n\t\t\t\tauto& inf(lv.info);\n\n\t\t\t\tm_squares.emplace_back(m_mainmenu, vec2f{m_center.x, pos_y}, m_square_size,\n\t\t\t\t\t\t\t\t\t \"Name\", mlk::stl_string::str_format(\"Creator: %%\\nDate: %%\", inf.creator_name, inf.creation_date), id);\n\t\t\t\tpos_y += m_squares.back().get_height();\n\t\t\t}\n\t\t}\n\n\t\tstd::size_t num_items() const noexcept\n\t\t{return m_squares.size();}\n\n\t\tstd::size_t max_index() const noexcept\n\t\t{return this->num_items() - 1;}\n\t};\n}\n\n\n#endif \/\/ RJ_CORE_MAIN_MENU_LEVEL_SQUARES_HPP\n<|endoftext|>"} {"text":"<commit_before>\/\/ Filename: ppInstance.cxx\n\/\/ Created by: drose (19Jun09)\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 \"ppInstance.h\"\n#include \"startup.h\"\n#include \"p3d_plugin_config.h\"\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ Function: PPInstance::Constructor\n\/\/ Access: Public\n\/\/ Description: Creates a new instance of a Panda3D plugin window.\n\/\/ The create_data structure is supplied from NPAPI, and\n\/\/ defines the initial parameters specified in the HTML\n\/\/ document.\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nPPInstance::\nPPInstance(NPMIMEType pluginType, NPP instance, uint16 mode, \n int16 argc, char *argn[], char *argv[], NPSavedData *saved) {\n logfile << \"constructing \" << this << \"\\n\" << flush;\n _p3d_inst = NULL;\n\n _npp_instance = instance;\n _npp_mode = mode;\n\n \/\/ Copy the tokens and save them within this object.\n _tokens.reserve(argc);\n for (int i = 0; i < argc; ++i) {\n P3D_token token;\n token._keyword = strdup(argn[i]);\n token._value = strdup(argv[i]);\n logfile\n << \" \" << i << \": \" << token._keyword << \" = \" << token._value << \"\\n\";\n _tokens.push_back(token);\n }\n\n _started_instance_data = false;\n _got_instance_data = false;\n _got_window = false;\n\n if (!is_plugin_loaded()) {\n \/\/ Start the plugin DLL downloading.\n string url = P3D_PLUGIN_DOWNLOAD;\n url += P3D_PLUGIN_PLATFORM;\n url += \"\/\";\n url += get_plugin_basename();\n \n PPDownloadRequest *req = new PPDownloadRequest(PPDownloadRequest::RT_core_dll);\n browser->geturlnotify(_npp_instance, url.c_str(), NULL, req);\n }\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ Function: PPInstance::Destructor\n\/\/ Access: Public\n\/\/ Description: \n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nPPInstance::\n~PPInstance() {\n logfile\n << \"destructing \" << this << \", \" << _p3d_inst << \"\\n\" << flush;\n\n if (_p3d_inst != NULL) {\n P3D_instance_finish(_p3d_inst);\n _p3d_inst = NULL;\n }\n\n \/\/ Free the tokens we allocated.\n Tokens::iterator ti;\n for (ti = _tokens.begin(); ti != _tokens.end(); ++ti) {\n free((char *)(*ti)._keyword);\n free((char *)(*ti)._value);\n }\n _tokens.clear();\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ Function: PPInstance::set_window\n\/\/ Access: Public\n\/\/ Description: Stores or updates the window parameters.\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nvoid PPInstance::\nset_window(NPWindow *window) {\n if (window->x == _window.x &&\n window->y == _window.y &&\n window->width == _window.width &&\n window->height == _window.height) {\n \/\/ No changes.\n return;\n }\n\n _window = *window;\n _got_window = true;\n \n if (_p3d_inst == NULL) {\n create_instance();\n } else {\n send_window();\n }\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ Function: PPInstance::new_stream\n\/\/ Access: Public\n\/\/ Description: Receives notification of a new stream object, e.g. a\n\/\/ url request.\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nNPError PPInstance::\nnew_stream(NPMIMEType type, NPStream *stream, bool seekable, uint16 *stype) {\n if (stream->notifyData == NULL) {\n \/\/ This is an unsolicited stream. Assume the first unsolicited\n \/\/ stream we receive is the instance data; any other unsolicited\n \/\/ stream is an error.\n if (!_started_instance_data) {\n stream->notifyData = new PPDownloadRequest(PPDownloadRequest::RT_instance_data);\n *stype = NP_ASFILEONLY;\n _started_instance_data = true;\n return NPERR_NO_ERROR;\n }\n\n \/\/ This is an unexpected unsolicited stream. (Firefox seems to\n \/\/ give us the instance data twice for some reason.)\n return NPERR_GENERIC_ERROR;\n }\n\n PPDownloadRequest *req = (PPDownloadRequest *)(stream->notifyData);\n switch (req->_rtype) {\n case PPDownloadRequest::RT_core_dll:\n \/\/ This is the core API DLL (or dylib or whatever). We want to\n \/\/ download this to file so we can run it directly.\n *stype = NP_ASFILEONLY;\n return NPERR_NO_ERROR;\n\n case PPDownloadRequest::RT_user:\n \/\/ This is a request from the plugin. We'll receive this as a\n \/\/ stream.\n *stype = NP_NORMAL;\n return NPERR_NO_ERROR;\n\n default:\n \/\/ Don't know what this is.\n logfile << \"Unexpected request \" << (int)req->_rtype << \"\\n\";\n }\n\n return NPERR_GENERIC_ERROR;\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ Function: PPInstance::write_stream\n\/\/ Access: Public\n\/\/ Description: Called by the browser to feed data read from a URL or\n\/\/ whatever.\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nint PPInstance::\nwrite_stream(NPStream *stream, int offset, int len, void *buffer) {\n if (stream->notifyData == NULL) {\n logfile << \"Unexpected write_stream on \" << stream->url << \"\\n\";\n return 0;\n }\n\n PPDownloadRequest *req = (PPDownloadRequest *)(stream->notifyData);\n switch (req->_rtype) {\n case PPDownloadRequest::RT_user:\n P3D_instance_feed_url_stream(_p3d_inst, req->_user_id,\n P3D_RC_in_progress, 0,\n stream->end, buffer, len);\n return len;\n \n default:\n logfile << \"Unexpected write_stream on \" << stream->url << \"\\n\";\n break;\n }\n\n return 0;\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ Function: PPInstance::destroy_stream\n\/\/ Access: Public\n\/\/ Description: Called by the browser to mark the end of a stream;\n\/\/ the file has either been successfully downloaded or\n\/\/ failed.\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nNPError PPInstance::\ndestroy_stream(NPStream *stream, NPReason reason) {\n if (stream->notifyData == NULL) {\n logfile << \"Unexpected destroy_stream on \" << stream->url << \"\\n\";\n return NPERR_GENERIC_ERROR;\n }\n\n PPDownloadRequest *req = (PPDownloadRequest *)(stream->notifyData);\n switch (req->_rtype) {\n case PPDownloadRequest::RT_user:\n {\n P3D_result_code result_code = P3D_RC_done;\n if (reason != NPRES_DONE) {\n result_code = P3D_RC_generic_error;\n }\n assert(!req->_notified_done);\n P3D_instance_feed_url_stream(_p3d_inst, req->_user_id,\n result_code, 0, stream->end, NULL, 0);\n req->_notified_done = true;\n }\n break;\n\n default:\n break;\n }\n \n return NPERR_NO_ERROR;\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ Function: PPInstance::url_notify\n\/\/ Access: Public\n\/\/ Description: Called by the browser to announce the end of a\n\/\/ stream. This normally follows destroy_stream(),\n\/\/ unless the stream was never created in the first\n\/\/ place.\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nvoid PPInstance::\nurl_notify(const char *url, NPReason reason, void *notifyData) {\n if (notifyData == NULL) {\n return;\n }\n \n PPDownloadRequest *req = (PPDownloadRequest *)notifyData;\n switch (req->_rtype) {\n case PPDownloadRequest::RT_user:\n if (!req->_notified_done) {\n \/\/ We shouldn't have gotten here without notifying the stream\n \/\/ unless the stream never got started (and hence we never\n \/\/ called destroy_stream().\n logfile << \"Failure starting stream\\n\" << flush;\n assert(reason != NPRES_DONE);\n\n P3D_instance_feed_url_stream(_p3d_inst, req->_user_id,\n P3D_RC_generic_error, 0, 0, NULL, 0);\n req->_notified_done = true;\n }\n break;\n \n default:\n break;\n }\n \n delete req;\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ Function: PPInstance::stream_as_file\n\/\/ Access: Public\n\/\/ Description: Called by the browser to report the filename that\n\/\/ contains the fully-downloaded stream contents.\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nvoid PPInstance::\nstream_as_file(NPStream *stream, const char *fname) {\n if (stream->notifyData == NULL) {\n logfile << \"Unexpected stream_as_file on \" << stream->url << \"\\n\";\n return;\n }\n\n string filename = fname;\n#ifdef __APPLE__\n \/\/ Safari seems to want to report the filename in the old-style form\n \/\/ \"Macintosh HD:blah:blah:blah\" instead of the new-style form\n \/\/ \"\/blah\/blah\/blah\". How annoying.\n\n \/\/ TODO: Is \"Macintosh HD:\" the only possible prefix?\n if (filename.substr(0, 13) == \"Macintosh HD:\") {\n string fname2;\n for (size_t p = 12; p < filename.size(); ++p) {\n if (filename[p] == ':') {\n fname2 += '\/';\n } else {\n fname2 += filename[p];\n }\n }\n filename = fname2;\n logfile << \"converted filename to \" << filename << \"\\n\";\n }\n\n#endif \/\/ __APPLE__\n\n PPDownloadRequest *req = (PPDownloadRequest *)(stream->notifyData);\n switch (req->_rtype) {\n case PPDownloadRequest::RT_core_dll:\n {\n \/\/ This is the core API DLL (or dylib or whatever). Now that\n \/\/ we've downloaded it, we can load it.\n string override_filename = P3D_PLUGIN_P3D_PLUGIN;\n if (!override_filename.empty()) {\n filename = override_filename;\n }\n logfile << \"got plugin \" << filename << \"\\n\" << flush;\n if (!load_plugin(filename)) {\n logfile << \"Unable to launch core API.\\n\";\n break;\n }\n logfile << \"loaded core API\\n\";\n create_instance();\n }\n break;\n\n case PPDownloadRequest::RT_instance_data:\n \/\/ This is the instance data, e.g. the p3d filename. Now we can\n \/\/ launch the instance.\n _got_instance_data = true;\n _p3d_filename = filename;\n create_instance();\n break;\n\n default:\n \/\/ Don't know what this is.\n logfile << \"Unexpected stream_as_file, type \" << (int)req->_rtype << \"\\n\";\n }\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ Function: PPInstance::handle_request\n\/\/ Access: Public\n\/\/ Description: Handles a request from the plugin, forwarding\n\/\/ it to the browser as appropriate.\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nvoid PPInstance::\nhandle_request(P3D_request *request) {\n logfile << \"handle_request: \" << request << \", \" << request->_instance\n << \" within \" << this << \", \" << _p3d_inst << \"\\n\" << flush;\n assert(request->_instance == _p3d_inst);\n\n bool handled = false;\n\n switch (request->_request_type) {\n case P3D_RT_stop:\n logfile << \"Got P3D_RT_stop\\n\";\n if (_p3d_inst != NULL) {\n P3D_instance_finish(_p3d_inst);\n _p3d_inst = NULL;\n }\n \/\/ Guess the browser doesn't really care.\n handled = true;\n break;\n\n case P3D_RT_get_url:\n {\n logfile << \"Got P3D_RT_get_url: \" << request->_request._get_url._url\n << \"\\n\";\n \n PPDownloadRequest *req = \n new PPDownloadRequest(PPDownloadRequest::RT_user, \n request->_request._get_url._unique_id);\n browser->geturlnotify(_npp_instance, request->_request._get_url._url,\n NULL, req);\n }\n \n break;\n\n default:\n \/\/ Some request types are not handled.\n logfile << \"Unhandled request: \" << request->_request_type << \"\\n\";\n break;\n };\n\n P3D_request_finish(request, handled);\n}\n\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ Function: PPInstance::create_instance\n\/\/ Access: Private\n\/\/ Description: Actually creates the internal P3D_instance object, if\n\/\/ possible and needed.\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nvoid PPInstance::\ncreate_instance() {\n if (_p3d_inst != NULL) {\n \/\/ Already created.\n return;\n }\n\n if (!is_plugin_loaded()) {\n \/\/ Plugin is not loaded yet.\n return;\n }\n\n if (!_got_instance_data) {\n \/\/ No instance data yet.\n return;\n }\n\n if (!_got_window) {\n \/\/ No window yet.\n return;\n }\n\n logfile << \"within \" << this << \", creating new instance\\n\" << flush;\n _p3d_inst = P3D_new_instance(request_ready, this);\n logfile << \"within \" << this << \", created new instance \" << _p3d_inst \n << \"\\n\" << flush;\n\n if (_p3d_inst != NULL) {\n const P3D_token *tokens = NULL;\n if (!_tokens.empty()) {\n tokens = &_tokens[0];\n }\n P3D_instance_start(_p3d_inst, _p3d_filename.c_str(), tokens, _tokens.size());\n send_window();\n }\n}\n\n \n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ Function: PPInstance::send_window\n\/\/ Access: Private\n\/\/ Description: Actually issues the window parameters to the internal\n\/\/ P3D_instance object.\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nvoid PPInstance::\nsend_window() {\n assert(_p3d_inst != NULL);\n\n P3D_window_handle parent_window;\n#ifdef _WIN32\n parent_window._hwnd = (HWND)(_window.window);\n#endif\n\n \/\/ Actually, we set up the window starting at (0, 0), instead of\n \/\/ whatever Mozilla tells us, because the window handle we get is a\n \/\/ specially created window that is already aligned to where we want\n \/\/ our window to be.\n P3D_instance_setup_window\n (_p3d_inst, P3D_WT_embedded,\n 0, 0, _window.width, _window.height,\n parent_window);\n}\n<commit_msg>minor cleanup<commit_after>\/\/ Filename: ppInstance.cxx\n\/\/ Created by: drose (19Jun09)\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 \"ppInstance.h\"\n#include \"startup.h\"\n#include \"p3d_plugin_config.h\"\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ Function: PPInstance::Constructor\n\/\/ Access: Public\n\/\/ Description: Creates a new instance of a Panda3D plugin window.\n\/\/ The create_data structure is supplied from NPAPI, and\n\/\/ defines the initial parameters specified in the HTML\n\/\/ document.\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nPPInstance::\nPPInstance(NPMIMEType pluginType, NPP instance, uint16 mode, \n int16 argc, char *argn[], char *argv[], NPSavedData *saved) {\n logfile << \"constructing \" << this << \"\\n\" << flush;\n _p3d_inst = NULL;\n\n _npp_instance = instance;\n _npp_mode = mode;\n\n \/\/ Copy the tokens and save them within this object.\n _tokens.reserve(argc);\n for (int i = 0; i < argc; ++i) {\n P3D_token token;\n token._keyword = strdup(argn[i]);\n token._value = strdup(argv[i]);\n logfile\n << \" \" << i << \": \" << token._keyword << \" = \" << token._value << \"\\n\";\n _tokens.push_back(token);\n }\n\n _started_instance_data = false;\n _got_instance_data = false;\n _got_window = false;\n\n if (!is_plugin_loaded()) {\n \/\/ Start the plugin DLL downloading.\n string url = P3D_PLUGIN_DOWNLOAD;\n url += P3D_PLUGIN_PLATFORM;\n url += \"\/\";\n url += get_plugin_basename();\n \n PPDownloadRequest *req = new PPDownloadRequest(PPDownloadRequest::RT_core_dll);\n browser->geturlnotify(_npp_instance, url.c_str(), NULL, req);\n }\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ Function: PPInstance::Destructor\n\/\/ Access: Public\n\/\/ Description: \n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nPPInstance::\n~PPInstance() {\n logfile\n << \"destructing \" << this << \", \" << _p3d_inst << \"\\n\" << flush;\n\n if (_p3d_inst != NULL) {\n P3D_instance_finish(_p3d_inst);\n _p3d_inst = NULL;\n }\n\n \/\/ Free the tokens we allocated.\n Tokens::iterator ti;\n for (ti = _tokens.begin(); ti != _tokens.end(); ++ti) {\n free((char *)(*ti)._keyword);\n free((char *)(*ti)._value);\n }\n _tokens.clear();\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ Function: PPInstance::set_window\n\/\/ Access: Public\n\/\/ Description: Stores or updates the window parameters.\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nvoid PPInstance::\nset_window(NPWindow *window) {\n if (window->x == _window.x &&\n window->y == _window.y &&\n window->width == _window.width &&\n window->height == _window.height) {\n \/\/ No changes.\n return;\n }\n\n _window = *window;\n _got_window = true;\n \n if (_p3d_inst == NULL) {\n create_instance();\n } else {\n send_window();\n }\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ Function: PPInstance::new_stream\n\/\/ Access: Public\n\/\/ Description: Receives notification of a new stream object, e.g. a\n\/\/ url request.\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nNPError PPInstance::\nnew_stream(NPMIMEType type, NPStream *stream, bool seekable, uint16 *stype) {\n if (stream->notifyData == NULL) {\n \/\/ This is an unsolicited stream. Assume the first unsolicited\n \/\/ stream we receive is the instance data; any other unsolicited\n \/\/ stream is an error.\n if (!_started_instance_data) {\n stream->notifyData = new PPDownloadRequest(PPDownloadRequest::RT_instance_data);\n *stype = NP_ASFILEONLY;\n _started_instance_data = true;\n return NPERR_NO_ERROR;\n }\n\n \/\/ This is an unexpected unsolicited stream. (Firefox seems to\n \/\/ give us the instance data twice for some reason.)\n return NPERR_GENERIC_ERROR;\n }\n\n PPDownloadRequest *req = (PPDownloadRequest *)(stream->notifyData);\n switch (req->_rtype) {\n case PPDownloadRequest::RT_core_dll:\n \/\/ This is the core API DLL (or dylib or whatever). We want to\n \/\/ download this to file so we can run it directly.\n *stype = NP_ASFILEONLY;\n return NPERR_NO_ERROR;\n\n case PPDownloadRequest::RT_user:\n \/\/ This is a request from the plugin. We'll receive this as a\n \/\/ stream.\n *stype = NP_NORMAL;\n return NPERR_NO_ERROR;\n\n default:\n \/\/ Don't know what this is.\n logfile << \"Unexpected request \" << (int)req->_rtype << \"\\n\";\n }\n\n return NPERR_GENERIC_ERROR;\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ Function: PPInstance::write_stream\n\/\/ Access: Public\n\/\/ Description: Called by the browser to feed data read from a URL or\n\/\/ whatever.\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nint PPInstance::\nwrite_stream(NPStream *stream, int offset, int len, void *buffer) {\n if (stream->notifyData == NULL) {\n logfile << \"Unexpected write_stream on \" << stream->url << \"\\n\";\n return 0;\n }\n\n PPDownloadRequest *req = (PPDownloadRequest *)(stream->notifyData);\n switch (req->_rtype) {\n case PPDownloadRequest::RT_user:\n P3D_instance_feed_url_stream(_p3d_inst, req->_user_id,\n P3D_RC_in_progress, 0,\n stream->end, buffer, len);\n return len;\n \n default:\n logfile << \"Unexpected write_stream on \" << stream->url << \"\\n\";\n break;\n }\n\n return 0;\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ Function: PPInstance::destroy_stream\n\/\/ Access: Public\n\/\/ Description: Called by the browser to mark the end of a stream;\n\/\/ the file has either been successfully downloaded or\n\/\/ failed.\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nNPError PPInstance::\ndestroy_stream(NPStream *stream, NPReason reason) {\n if (stream->notifyData == NULL) {\n logfile << \"Unexpected destroy_stream on \" << stream->url << \"\\n\";\n return NPERR_GENERIC_ERROR;\n }\n\n PPDownloadRequest *req = (PPDownloadRequest *)(stream->notifyData);\n switch (req->_rtype) {\n case PPDownloadRequest::RT_user:\n {\n P3D_result_code result_code = P3D_RC_done;\n if (reason != NPRES_DONE) {\n result_code = P3D_RC_generic_error;\n }\n assert(!req->_notified_done);\n P3D_instance_feed_url_stream(_p3d_inst, req->_user_id,\n result_code, 0, stream->end, NULL, 0);\n req->_notified_done = true;\n }\n break;\n\n default:\n break;\n }\n \n return NPERR_NO_ERROR;\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ Function: PPInstance::url_notify\n\/\/ Access: Public\n\/\/ Description: Called by the browser to announce the end of a\n\/\/ stream. This normally follows destroy_stream(),\n\/\/ unless the stream was never created in the first\n\/\/ place.\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nvoid PPInstance::\nurl_notify(const char *url, NPReason reason, void *notifyData) {\n if (notifyData == NULL) {\n return;\n }\n \n PPDownloadRequest *req = (PPDownloadRequest *)notifyData;\n switch (req->_rtype) {\n case PPDownloadRequest::RT_user:\n if (!req->_notified_done) {\n \/\/ We shouldn't have gotten here without notifying the stream\n \/\/ unless the stream never got started (and hence we never\n \/\/ called destroy_stream().\n logfile << \"Failure starting stream\\n\" << flush;\n assert(reason != NPRES_DONE);\n\n P3D_instance_feed_url_stream(_p3d_inst, req->_user_id,\n P3D_RC_generic_error, 0, 0, NULL, 0);\n req->_notified_done = true;\n }\n break;\n \n default:\n break;\n }\n \n delete req;\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ Function: PPInstance::stream_as_file\n\/\/ Access: Public\n\/\/ Description: Called by the browser to report the filename that\n\/\/ contains the fully-downloaded stream contents.\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nvoid PPInstance::\nstream_as_file(NPStream *stream, const char *fname) {\n if (stream->notifyData == NULL) {\n logfile << \"Unexpected stream_as_file on \" << stream->url << \"\\n\";\n return;\n }\n\n string filename = fname;\n#ifdef __APPLE__\n \/\/ Safari seems to want to report the filename in the old-style form\n \/\/ \"Macintosh HD:blah:blah:blah\" instead of the new-style form\n \/\/ \"\/blah\/blah\/blah\". How annoying.\n\n \/\/ TODO: Is \"Macintosh HD:\" the only possible prefix?\n if (filename.substr(0, 13) == \"Macintosh HD:\") {\n string fname2;\n for (size_t p = 12; p < filename.size(); ++p) {\n if (filename[p] == ':') {\n fname2 += '\/';\n } else {\n fname2 += filename[p];\n }\n }\n filename = fname2;\n logfile << \"converted filename to \" << filename << \"\\n\";\n }\n\n#endif \/\/ __APPLE__\n\n PPDownloadRequest *req = (PPDownloadRequest *)(stream->notifyData);\n switch (req->_rtype) {\n case PPDownloadRequest::RT_core_dll:\n {\n \/\/ This is the core API DLL (or dylib or whatever). Now that\n \/\/ we've downloaded it, we can load it.\n string override_filename = P3D_PLUGIN_P3D_PLUGIN;\n if (!override_filename.empty()) {\n filename = override_filename;\n }\n logfile << \"got plugin \" << filename << \"\\n\" << flush;\n if (!load_plugin(filename)) {\n logfile << \"Unable to launch core API.\\n\";\n break;\n }\n logfile << \"loaded core API\\n\";\n create_instance();\n }\n break;\n\n case PPDownloadRequest::RT_instance_data:\n \/\/ This is the instance data, e.g. the p3d filename. Now we can\n \/\/ launch the instance.\n _got_instance_data = true;\n _p3d_filename = filename;\n create_instance();\n break;\n\n default:\n \/\/ Don't know what this is.\n logfile << \"Unexpected stream_as_file, type \" << (int)req->_rtype << \"\\n\";\n }\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ Function: PPInstance::handle_request\n\/\/ Access: Public\n\/\/ Description: Handles a request from the plugin, forwarding\n\/\/ it to the browser as appropriate.\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nvoid PPInstance::\nhandle_request(P3D_request *request) {\n logfile << \"handle_request: \" << request << \", \" << request->_instance\n << \" within \" << this << \", \" << _p3d_inst << \"\\n\" << flush;\n assert(request->_instance == _p3d_inst);\n\n bool handled = false;\n\n switch (request->_request_type) {\n case P3D_RT_stop:\n logfile << \"Got P3D_RT_stop\\n\";\n if (_p3d_inst != NULL) {\n P3D_instance_finish(_p3d_inst);\n _p3d_inst = NULL;\n }\n \/\/ Guess the browser doesn't really care.\n handled = true;\n break;\n\n case P3D_RT_get_url:\n {\n logfile << \"Got P3D_RT_get_url: \" << request->_request._get_url._url\n << \"\\n\";\n \n PPDownloadRequest *req = \n new PPDownloadRequest(PPDownloadRequest::RT_user, \n request->_request._get_url._unique_id);\n browser->geturlnotify(_npp_instance, request->_request._get_url._url,\n NULL, req);\n }\n \n break;\n\n default:\n \/\/ Some request types are not handled.\n logfile << \"Unhandled request: \" << request->_request_type << \"\\n\";\n break;\n };\n\n P3D_request_finish(request, handled);\n}\n\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ Function: PPInstance::create_instance\n\/\/ Access: Private\n\/\/ Description: Actually creates the internal P3D_instance object, if\n\/\/ possible and needed.\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nvoid PPInstance::\ncreate_instance() {\n if (_p3d_inst != NULL) {\n \/\/ Already created.\n return;\n }\n\n if (!is_plugin_loaded()) {\n \/\/ Plugin is not loaded yet.\n return;\n }\n\n if (!_got_instance_data) {\n \/\/ No instance data yet.\n return;\n }\n\n if (!_got_window) {\n \/\/ No window yet.\n return;\n }\n\n _p3d_inst = P3D_new_instance(request_ready, this);\n\n if (_p3d_inst != NULL) {\n const P3D_token *tokens = NULL;\n if (!_tokens.empty()) {\n tokens = &_tokens[0];\n }\n P3D_instance_start(_p3d_inst, _p3d_filename.c_str(), tokens, _tokens.size());\n send_window();\n }\n}\n\n \n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ Function: PPInstance::send_window\n\/\/ Access: Private\n\/\/ Description: Actually issues the window parameters to the internal\n\/\/ P3D_instance object.\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nvoid PPInstance::\nsend_window() {\n assert(_p3d_inst != NULL);\n\n P3D_window_handle parent_window;\n#ifdef _WIN32\n parent_window._hwnd = (HWND)(_window.window);\n#endif\n\n \/\/ Actually, we set up the window starting at (0, 0), instead of\n \/\/ whatever Mozilla tells us, because the window handle we get is a\n \/\/ specially created window that is already aligned to where we want\n \/\/ our window to be.\n P3D_instance_setup_window\n (_p3d_inst, P3D_WT_embedded,\n 0, 0, _window.width, _window.height,\n parent_window);\n}\n<|endoftext|>"} {"text":"<commit_before>\/\/--------------------------------------------------------------------*- C++ -*-\n\/\/ CLING - the C++ LLVM-based InterpreterG :)\n\/\/ author: Axel Naumann <axel@cern.ch>\n\/\/\n\/\/ This file is dual-licensed: you can choose to license it under the University\n\/\/ of Illinois Open Source License or the GNU Lesser General Public License. See\n\/\/ LICENSE.TXT for details.\n\/\/------------------------------------------------------------------------------\n\n#include \"ClingPragmas.h\"\n\n#include \"cling\/Interpreter\/Interpreter.h\"\n#include \"cling\/Utils\/Output.h\"\n#include \"cling\/Utils\/Paths.h\"\n\n#include \"clang\/AST\/ASTContext.h\"\n#include \"clang\/Basic\/TokenKinds.h\"\n#include \"clang\/Frontend\/CompilerInstance.h\"\n#include \"clang\/Lex\/Preprocessor.h\"\n#include \"clang\/Lex\/Token.h\"\n#include \"clang\/Parse\/Parser.h\"\n\nusing namespace cling;\nusing namespace clang;\n\nnamespace {\n typedef std::pair<bool, std::string> ParseResult_t;\n\n static ParseResult_t HandlePragmaHelper(Preprocessor &PP,\n const std::string &pragmaInst) {\n struct SkipToEOD_t {\n Preprocessor& m_PP;\n SkipToEOD_t(Preprocessor& PParg): m_PP(PParg) {}\n ~SkipToEOD_t() { m_PP.DiscardUntilEndOfDirective(); }\n } SkipToEOD(PP);\n\n Token Tok;\n PP.Lex(Tok);\n if (Tok.isNot(tok::l_paren)) {\n cling::errs() << \"cling:HandlePragmaHelper : expect '(' after #\"\n << pragmaInst;\n return ParseResult_t{false, \"\"};\n }\n std::string Literal;\n if (!PP.LexStringLiteral(Tok, Literal, pragmaInst.c_str(),\n false \/*allowMacroExpansion*\/)) {\n \/\/ already diagnosed.\n return ParseResult_t {false, \"\"};\n }\n utils::ExpandEnvVars(Literal);\n\n return ParseResult_t {true, Literal};\n }\n\n class PHLoad: public PragmaHandler {\n Interpreter& m_Interp;\n\n public:\n PHLoad(Interpreter& interp):\n PragmaHandler(\"load\"), m_Interp(interp) {}\n\n void HandlePragma(Preprocessor &PP,\n PragmaIntroducerKind Introducer,\n Token &FirstToken) override {\n \/\/ TODO: use Diagnostics!\n ParseResult_t Result = HandlePragmaHelper(PP, \"pragma cling load\");\n\n if (!Result.first)\n return;\n if (Result.second.empty()) {\n cling::errs() << \"Cannot load unnamed files.\\n\" ;\n return;\n }\n clang::Parser& P = m_Interp.getParser();\n Parser::ParserCurTokRestoreRAII savedCurToken(P);\n \/\/ After we have saved the token reset the current one to something which\n \/\/ is safe (semi colon usually means empty decl)\n Token& CurTok = const_cast<Token&>(P.getCurToken());\n CurTok.setKind(tok::semi);\n\n if (!m_Interp.isInSyntaxOnlyMode()) {\n \/\/ No need to load libraries if we're not executing anything.\n\n Preprocessor::CleanupAndRestoreCacheRAII cleanupRAII(PP);\n \/\/ We can't PushDeclContext, because we go up and the routine that pops\n \/\/ the DeclContext assumes that we drill down always.\n \/\/ We have to be on the global context. At that point we are in a\n \/\/ wrapper function so the parent context must be the global.\n TranslationUnitDecl* TU =\n m_Interp.getCI()->getASTContext().getTranslationUnitDecl();\n Sema::ContextAndScopeRAII pushedDCAndS(m_Interp.getSema(),\n TU, m_Interp.getSema().TUScope);\n Interpreter::PushTransactionRAII pushedT(&m_Interp);\n\n m_Interp.loadFile(Result.second, true \/*allowSharedLib*\/);\n }\n }\n };\n\n class PHAddIncPath: public PragmaHandler {\n Interpreter& m_Interp;\n\n public:\n PHAddIncPath(Interpreter& interp):\n PragmaHandler(\"add_include_path\"), m_Interp(interp) {}\n\n void HandlePragma(Preprocessor &PP,\n PragmaIntroducerKind Introducer,\n Token &FirstToken) override {\n \/\/ TODO: use Diagnostics!\n ParseResult_t Result = HandlePragmaHelper(PP,\n \"pragma cling add_include_path\");\n \/\/if the function HandlePragmaHelper returned false,\n if (!Result.first)\n return;\n if (!Result.second.empty())\n m_Interp.AddIncludePath(Result.second);\n }\n };\n\n class PHAddLibraryPath: public PragmaHandler {\n Interpreter& m_Interp;\n\n public:\n PHAddLibraryPath(Interpreter& interp):\n PragmaHandler(\"add_library_path\"), m_Interp(interp) {}\n\n void HandlePragma(Preprocessor &PP,\n PragmaIntroducerKind Introducer,\n Token &FirstToken) override {\n \/\/ TODO: use Diagnostics!\n ParseResult_t Result = HandlePragmaHelper(PP,\n \"pragma cling add_library_path\");\n \/\/if the function HandlePragmaHelper returned false,\n if (!Result.first)\n return;\n if (!Result.second.empty()) {\n \/\/ if HandlePragmaHelper returned success, this means that\n \/\/it also returned the path to be included\n InvocationOptions& Opts = m_Interp.getOptions();\n Opts.LibSearchPath.push_back(Result.second);\n }\n }\n };\n}\n\nvoid cling::addClingPragmas(Interpreter& interp) {\n Preprocessor& PP = interp.getCI()->getPreprocessor();\n \/\/ PragmaNamespace \/ PP takes ownership of sub-handlers.\n PP.AddPragmaHandler(\"cling\", new PHLoad(interp));\n PP.AddPragmaHandler(\"cling\", new PHAddIncPath(interp));\n PP.AddPragmaHandler(\"cling\", new PHAddLibraryPath(interp));\n}\n<commit_msg>Teach the pragma parser to parse non-string literals.<commit_after>\/\/--------------------------------------------------------------------*- C++ -*-\n\/\/ CLING - the C++ LLVM-based InterpreterG :)\n\/\/ author: Axel Naumann <axel@cern.ch>\n\/\/\n\/\/ This file is dual-licensed: you can choose to license it under the University\n\/\/ of Illinois Open Source License or the GNU Lesser General Public License. See\n\/\/ LICENSE.TXT for details.\n\/\/------------------------------------------------------------------------------\n\n#include \"ClingPragmas.h\"\n\n#include \"cling\/Interpreter\/Interpreter.h\"\n#include \"cling\/Utils\/Output.h\"\n#include \"cling\/Utils\/Paths.h\"\n\n#include \"clang\/AST\/ASTContext.h\"\n#include \"clang\/Basic\/TokenKinds.h\"\n#include \"clang\/Frontend\/CompilerInstance.h\"\n#include \"clang\/Lex\/Preprocessor.h\"\n#include \"clang\/Lex\/Token.h\"\n#include \"clang\/Parse\/Parser.h\"\n\n#include <cstdlib>\n\nusing namespace cling;\nusing namespace clang;\n\nnamespace {\n typedef std::pair<bool, std::string> ParseResult_t;\n\n static ParseResult_t HandlePragmaHelper(Preprocessor &PP,\n const std::string &pragmaInst,\n bool stringLiteralArg = true) {\n struct SkipToEOD_t {\n Preprocessor& m_PP;\n SkipToEOD_t(Preprocessor& PParg): m_PP(PParg) {}\n ~SkipToEOD_t() { m_PP.DiscardUntilEndOfDirective(); }\n } SkipToEOD(PP);\n\n Token Tok;\n PP.Lex(Tok);\n if (Tok.isNot(tok::l_paren)) {\n cling::errs() << \"cling::HandlePragmaHelper: expect '(' after #\"\n << pragmaInst << '\\n';\n return ParseResult_t{false, \"\"};\n }\n std::string Literal;\n if (stringLiteralArg) {\n if (!PP.LexStringLiteral(Tok, Literal, pragmaInst.c_str(),\n false \/*allowMacroExpansion*\/)) {\n \/\/ already diagnosed.\n return ParseResult_t {false, \"\"};\n }\n utils::ExpandEnvVars(Literal);\n } else {\n \/\/ integer literal\n PP.Lex(Tok);\n if (!Tok.isLiteral()) {\n cling::errs()\n << \"cling::HandlePragmaHelper: expect integer literal after #\"\n << pragmaInst << '\\n';\n return ParseResult_t {false, \"\"};\n }\n Literal = std::string(Tok.getLiteralData(), Tok.getLength());\n }\n\n return ParseResult_t {true, Literal};\n }\n\n class PHLoad: public PragmaHandler {\n Interpreter& m_Interp;\n\n public:\n PHLoad(Interpreter& interp):\n PragmaHandler(\"load\"), m_Interp(interp) {}\n\n void HandlePragma(Preprocessor &PP,\n PragmaIntroducerKind Introducer,\n Token &FirstToken) override {\n \/\/ TODO: use Diagnostics!\n ParseResult_t Result = HandlePragmaHelper(PP, \"pragma cling load\");\n\n if (!Result.first)\n return;\n if (Result.second.empty()) {\n cling::errs() << \"Cannot load unnamed files.\\n\" ;\n return;\n }\n clang::Parser& P = m_Interp.getParser();\n Parser::ParserCurTokRestoreRAII savedCurToken(P);\n \/\/ After we have saved the token reset the current one to something which\n \/\/ is safe (semi colon usually means empty decl)\n Token& CurTok = const_cast<Token&>(P.getCurToken());\n CurTok.setKind(tok::semi);\n\n if (!m_Interp.isInSyntaxOnlyMode()) {\n \/\/ No need to load libraries if we're not executing anything.\n\n Preprocessor::CleanupAndRestoreCacheRAII cleanupRAII(PP);\n \/\/ We can't PushDeclContext, because we go up and the routine that pops\n \/\/ the DeclContext assumes that we drill down always.\n \/\/ We have to be on the global context. At that point we are in a\n \/\/ wrapper function so the parent context must be the global.\n TranslationUnitDecl* TU =\n m_Interp.getCI()->getASTContext().getTranslationUnitDecl();\n Sema::ContextAndScopeRAII pushedDCAndS(m_Interp.getSema(),\n TU, m_Interp.getSema().TUScope);\n Interpreter::PushTransactionRAII pushedT(&m_Interp);\n\n m_Interp.loadFile(Result.second, true \/*allowSharedLib*\/);\n }\n }\n };\n\n class PHAddIncPath: public PragmaHandler {\n Interpreter& m_Interp;\n\n public:\n PHAddIncPath(Interpreter& interp):\n PragmaHandler(\"add_include_path\"), m_Interp(interp) {}\n\n void HandlePragma(Preprocessor &PP,\n PragmaIntroducerKind Introducer,\n Token &FirstToken) override {\n \/\/ TODO: use Diagnostics!\n ParseResult_t Result = HandlePragmaHelper(PP,\n \"pragma cling add_include_path\");\n \/\/if the function HandlePragmaHelper returned false,\n if (!Result.first)\n return;\n if (!Result.second.empty())\n m_Interp.AddIncludePath(Result.second);\n }\n };\n\n class PHAddLibraryPath: public PragmaHandler {\n Interpreter& m_Interp;\n\n public:\n PHAddLibraryPath(Interpreter& interp):\n PragmaHandler(\"add_library_path\"), m_Interp(interp) {}\n\n void HandlePragma(Preprocessor &PP,\n PragmaIntroducerKind Introducer,\n Token &FirstToken) override {\n \/\/ TODO: use Diagnostics!\n ParseResult_t Result = HandlePragmaHelper(PP,\n \"pragma cling add_library_path\");\n \/\/if the function HandlePragmaHelper returned false,\n if (!Result.first)\n return;\n if (!Result.second.empty()) {\n \/\/ if HandlePragmaHelper returned success, this means that\n \/\/it also returned the path to be included\n InvocationOptions& Opts = m_Interp.getOptions();\n Opts.LibSearchPath.push_back(Result.second);\n }\n }\n };\n}\n\nvoid cling::addClingPragmas(Interpreter& interp) {\n Preprocessor& PP = interp.getCI()->getPreprocessor();\n \/\/ PragmaNamespace \/ PP takes ownership of sub-handlers.\n PP.AddPragmaHandler(\"cling\", new PHLoad(interp));\n PP.AddPragmaHandler(\"cling\", new PHAddIncPath(interp));\n PP.AddPragmaHandler(\"cling\", new PHAddLibraryPath(interp));\n}\n<|endoftext|>"} {"text":"<commit_before>\/*\n * Copyright (C) 2008-2014 The QXmpp developers\n *\n * Author:\n * Jeremy Lainé\n *\n * Source:\n * https:\/\/github.com\/qxmpp-project\/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 <QObject>\n#include \"QXmppVCardIq.h\"\n#include \"util.h\"\n\nclass tst_QXmppVCardIq : public QObject\n{\n Q_OBJECT\n\nprivate slots:\n void testAddress_data();\n void testAddress();\n void testEmail_data();\n void testEmail();\n void testPhone_data();\n void testPhone();\n void testVCard();\n};\n\nvoid tst_QXmppVCardIq::testAddress_data()\n{\n QTest::addColumn<QByteArray>(\"xml\");\n QTest::addColumn<int>(\"type\");\n QTest::addColumn<QString>(\"country\");\n QTest::addColumn<QString>(\"locality\");\n QTest::addColumn<QString>(\"postcode\");\n QTest::addColumn<QString>(\"region\");\n QTest::addColumn<QString>(\"street\");\n\n QTest::newRow(\"none\") << QByteArray(\"<ADR\/>\") << int(QXmppVCardAddress::None) << \"\" << \"\" << \"\" << \"\" << \"\";\n QTest::newRow(\"HOME\") << QByteArray(\"<ADR><HOME\/><\/ADR>\") << int(QXmppVCardAddress::Home) << \"\" << \"\" << \"\" << \"\" << \"\";\n QTest::newRow(\"WORK\") << QByteArray(\"<ADR><WORK\/><\/ADR>\") << int(QXmppVCardAddress::Work) << \"\" << \"\" << \"\" << \"\" << \"\";\n QTest::newRow(\"POSTAL\") << QByteArray(\"<ADR><POSTAL\/><\/ADR>\") << int(QXmppVCardAddress::Postal) << \"\" << \"\" << \"\" << \"\" << \"\";\n QTest::newRow(\"PREF\") << QByteArray(\"<ADR><PREF\/><\/ADR>\") << int(QXmppVCardAddress::Preferred) << \"\" << \"\" << \"\" << \"\" << \"\";\n\n QTest::newRow(\"country\") << QByteArray(\"<ADR><CTRY>France<\/CTRY><\/ADR>\") << int(QXmppVCardAddress::None) << \"France\" << \"\" << \"\" << \"\" << \"\";\n QTest::newRow(\"locality\") << QByteArray(\"<ADR><LOCALITY>Paris<\/LOCALITY><\/ADR>\") << int(QXmppVCardAddress::None) << \"\" << \"Paris\" << \"\" << \"\" << \"\";\n QTest::newRow(\"postcode\") << QByteArray(\"<ADR><PCODE>75008<\/PCODE><\/ADR>\") << int(QXmppVCardAddress::None) << \"\" << \"\" << \"75008\" << \"\" << \"\";\n QTest::newRow(\"region\") << QByteArray(\"<ADR><REGION>Ile de France<\/REGION><\/ADR>\") << int(QXmppVCardAddress::None) << \"\" << \"\" << \"\" << \"Ile de France\" << \"\";\n QTest::newRow(\"street\") << QByteArray(\"<ADR><STREET>55 rue du faubourg Saint-Honoré<\/STREET><\/ADR>\") << int(QXmppVCardAddress::None) << \"\" << \"\" << \"\" << \"\" << QString::fromUtf8(\"55 rue du faubourg Saint-Honoré\");\n}\n\nvoid tst_QXmppVCardIq::testAddress()\n{\n QFETCH(QByteArray, xml);\n QFETCH(int, type);\n QFETCH(QString, country);\n QFETCH(QString, locality);\n QFETCH(QString, postcode);\n QFETCH(QString, region);\n QFETCH(QString, street);\n\n QXmppVCardAddress address;\n parsePacket(address, xml);\n QCOMPARE(int(address.type()), type);\n QCOMPARE(address.country(), country);\n QCOMPARE(address.locality(), locality);\n QCOMPARE(address.postcode(), postcode);\n QCOMPARE(address.region(), region);\n QCOMPARE(address.street(), street);\n serializePacket(address, xml);\n}\n\nvoid tst_QXmppVCardIq::testEmail_data()\n{\n QTest::addColumn<QByteArray>(\"xml\");\n QTest::addColumn<int>(\"type\");\n\n QTest::newRow(\"none\") << QByteArray(\"<EMAIL><USERID>foo.bar@example.com<\/USERID><\/EMAIL>\") << int(QXmppVCardEmail::None);\n QTest::newRow(\"HOME\") << QByteArray(\"<EMAIL><HOME\/><USERID>foo.bar@example.com<\/USERID><\/EMAIL>\") << int(QXmppVCardEmail::Home);\n QTest::newRow(\"WORK\") << QByteArray(\"<EMAIL><WORK\/><USERID>foo.bar@example.com<\/USERID><\/EMAIL>\") << int(QXmppVCardEmail::Work);\n QTest::newRow(\"INTERNET\") << QByteArray(\"<EMAIL><INTERNET\/><USERID>foo.bar@example.com<\/USERID><\/EMAIL>\") << int(QXmppVCardEmail::Internet);\n QTest::newRow(\"X400\") << QByteArray(\"<EMAIL><X400\/><USERID>foo.bar@example.com<\/USERID><\/EMAIL>\") << int(QXmppVCardEmail::X400);\n QTest::newRow(\"PREF\") << QByteArray(\"<EMAIL><PREF\/><USERID>foo.bar@example.com<\/USERID><\/EMAIL>\") << int(QXmppVCardEmail::Preferred);\n QTest::newRow(\"all\") << QByteArray(\"<EMAIL><HOME\/><WORK\/><INTERNET\/><PREF\/><X400\/><USERID>foo.bar@example.com<\/USERID><\/EMAIL>\") << int(QXmppVCardEmail::Home | QXmppVCardEmail::Work | QXmppVCardEmail::Internet | QXmppVCardEmail::Preferred | QXmppVCardEmail::X400);\n}\n\nvoid tst_QXmppVCardIq::testEmail()\n{\n QFETCH(QByteArray, xml);\n QFETCH(int, type);\n\n QXmppVCardEmail email;\n parsePacket(email, xml);\n QCOMPARE(email.address(), QLatin1String(\"foo.bar@example.com\"));\n QCOMPARE(int(email.type()), type);\n serializePacket(email, xml);\n}\n\nvoid tst_QXmppVCardIq::testPhone_data()\n{\n QTest::addColumn<QByteArray>(\"xml\");\n QTest::addColumn<int>(\"type\");\n\n QTest::newRow(\"none\") << QByteArray(\"<PHONE><NUMBER>12345<\/NUMBER><\/PHONE>\") << int(QXmppVCardPhone::None);\n QTest::newRow(\"HOME\") << QByteArray(\"<PHONE><HOME\/><NUMBER>12345<\/NUMBER><\/PHONE>\") << int(QXmppVCardPhone::Home);\n QTest::newRow(\"WORK\") << QByteArray(\"<PHONE><WORK\/><NUMBER>12345<\/NUMBER><\/PHONE>\") << int(QXmppVCardPhone::Work);\n QTest::newRow(\"VOICE\") << QByteArray(\"<PHONE><VOICE\/><NUMBER>12345<\/NUMBER><\/PHONE>\") << int(QXmppVCardPhone::Voice);\n QTest::newRow(\"FAX\") << QByteArray(\"<PHONE><FAX\/><NUMBER>12345<\/NUMBER><\/PHONE>\") << int(QXmppVCardPhone::Fax);\n QTest::newRow(\"PAGER\") << QByteArray(\"<PHONE><PAGER\/><NUMBER>12345<\/NUMBER><\/PHONE>\") << int(QXmppVCardPhone::Pager);\n QTest::newRow(\"MSG\") << QByteArray(\"<PHONE><MSG\/><NUMBER>12345<\/NUMBER><\/PHONE>\") << int(QXmppVCardPhone::Messaging);\n QTest::newRow(\"CELL\") << QByteArray(\"<PHONE><CELL\/><NUMBER>12345<\/NUMBER><\/PHONE>\") << int(QXmppVCardPhone::Cell);\n QTest::newRow(\"VIDEO\") << QByteArray(\"<PHONE><VIDEO\/><NUMBER>12345<\/NUMBER><\/PHONE>\") << int(QXmppVCardPhone::Video);\n QTest::newRow(\"BBS\") << QByteArray(\"<PHONE><BBS\/><NUMBER>12345<\/NUMBER><\/PHONE>\") << int(QXmppVCardPhone::BBS);\n QTest::newRow(\"MODEM\") << QByteArray(\"<PHONE><MODEM\/><NUMBER>12345<\/NUMBER><\/PHONE>\") << int(QXmppVCardPhone::Modem);\n QTest::newRow(\"IDSN\") << QByteArray(\"<PHONE><ISDN\/><NUMBER>12345<\/NUMBER><\/PHONE>\") << int(QXmppVCardPhone::ISDN);\n QTest::newRow(\"PCS\") << QByteArray(\"<PHONE><PCS\/><NUMBER>12345<\/NUMBER><\/PHONE>\") << int(QXmppVCardPhone::PCS);\n QTest::newRow(\"PREF\") << QByteArray(\"<PHONE><PREF\/><NUMBER>12345<\/NUMBER><\/PHONE>\") << int(QXmppVCardPhone::Preferred);\n}\n\nvoid tst_QXmppVCardIq::testPhone()\n{\n QFETCH(QByteArray, xml);\n QFETCH(int, type);\n\n QXmppVCardPhone phone;\n parsePacket(phone, xml);\n QCOMPARE(phone.number(), QLatin1String(\"12345\"));\n QCOMPARE(int(phone.type()), type);\n serializePacket(phone, xml);\n}\n\n\nvoid tst_QXmppVCardIq::testVCard()\n{\n const QByteArray xml(\n \"<iq id=\\\"vcard1\\\" type=\\\"set\\\">\"\n \"<vCard xmlns=\\\"vcard-temp\\\">\"\n \"<ADR><CTRY>France<\/CTRY><\/ADR>\"\n \"<BDAY>1983-09-14<\/BDAY>\"\n \"<DESC>I like XMPP.<\/DESC>\"\n \"<EMAIL><INTERNET\/><USERID>foo.bar@example.com<\/USERID><\/EMAIL>\"\n \"<FN>Foo Bar!<\/FN>\"\n \"<NICKNAME>FooBar<\/NICKNAME>\"\n \"<N><GIVEN>Foo<\/GIVEN><FAMILY>Wiz<\/FAMILY><MIDDLE>Baz<\/MIDDLE><\/N>\"\n \"<PHONE><HOME\/><NUMBER>12345<\/NUMBER><\/PHONE>\"\n \"<PHONE><WORK\/><NUMBER>67890<\/NUMBER><\/PHONE>\"\n \"<PHOTO>\"\n \"<TYPE>image\/png<\/TYPE>\"\n \"<BINVAL>\"\n \"iVBORw0KGgoAAAANSUhEUgAAAAgAAAAICAIAAABLbSncAAAAAXNSR0IArs4c6QAAAAlwSFlzAAA\"\n \"UIgAAFCIBjw1HyAAAAAd0SU1FB9oIHQInNvuJovgAAAAiSURBVAjXY2TQ+s\/AwMDAwPD\/GiMDlP\"\n \"WfgYGBiQEHGJwSAK2BBQ1f3uvpAAAAAElFTkSuQmCC\"\n \"<\/BINVAL>\"\n \"<\/PHOTO>\"\n \"<URL>https:\/\/github.com\/qxmpp-project\/qxmpp\/<\/URL>\"\n \"<ORG>\"\n \"<ORGNAME>QXmpp foundation<\/ORGNAME>\"\n \"<ORGUNIT>Main QXmpp dev unit<\/ORGUNIT>\"\n \"<\/ORG>\"\n \"<TITLE>Executive Director<\/TITLE>\"\n \"<ROLE>Patron Saint<\/ROLE>\"\n \"<\/vCard>\"\n \"<\/iq>\");\n\n QXmppVCardIq vcard;\n parsePacket(vcard, xml);\n QCOMPARE(vcard.addresses().size(), 1);\n QCOMPARE(vcard.addresses()[0].country(), QLatin1String(\"France\"));\n QCOMPARE(int(vcard.addresses()[0].type()), int(QXmppVCardEmail::None));\n QCOMPARE(vcard.birthday(), QDate(1983, 9, 14));\n QCOMPARE(vcard.description(), QLatin1String(\"I like XMPP.\"));\n QCOMPARE(vcard.email(), QLatin1String(\"foo.bar@example.com\"));\n QCOMPARE(vcard.emails().size(), 1);\n QCOMPARE(vcard.emails()[0].address(), QLatin1String(\"foo.bar@example.com\"));\n QCOMPARE(int(vcard.emails()[0].type()), int(QXmppVCardEmail::Internet));\n QCOMPARE(vcard.nickName(), QLatin1String(\"FooBar\"));\n QCOMPARE(vcard.fullName(), QLatin1String(\"Foo Bar!\"));\n QCOMPARE(vcard.firstName(), QLatin1String(\"Foo\"));\n QCOMPARE(vcard.middleName(), QLatin1String(\"Baz\"));\n QCOMPARE(vcard.lastName(), QLatin1String(\"Wiz\"));\n QCOMPARE(vcard.phones().size(), 2);\n QCOMPARE(vcard.phones()[0].number(), QLatin1String(\"12345\"));\n QCOMPARE(int(vcard.phones()[0].type()), int(QXmppVCardEmail::Home));\n QCOMPARE(vcard.phones()[1].number(), QLatin1String(\"67890\"));\n QCOMPARE(int(vcard.phones()[1].type()), int(QXmppVCardEmail::Work));\n QCOMPARE(vcard.photo(), QByteArray::fromBase64(\n \"iVBORw0KGgoAAAANSUhEUgAAAAgAAAAICAIAAABLbSncAAAAAXNSR0IArs4c6QAAAAlwSFlzAAA\"\n \"UIgAAFCIBjw1HyAAAAAd0SU1FB9oIHQInNvuJovgAAAAiSURBVAjXY2TQ+s\/AwMDAwPD\/GiMDlP\"\n \"WfgYGBiQEHGJwSAK2BBQ1f3uvpAAAAAElFTkSuQmCC\"));\n QCOMPARE(vcard.photoType(), QLatin1String(\"image\/png\"));\n QCOMPARE(vcard.url(), QLatin1String(\"https:\/\/github.com\/qxmpp-project\/qxmpp\/\"));\n\n const QXmppVCardOrganization &orgInfo = vcard.organization();\n QCOMPARE(orgInfo.organization(), QLatin1String(\"QXmpp foundation\"));\n QCOMPARE(orgInfo.unit(), QLatin1String(\"Main QXmpp dev unit\"));\n QCOMPARE(orgInfo.title(), QLatin1String(\"Executive Director\"));\n QCOMPARE(orgInfo.role(), QLatin1String(\"Patron Saint\"));\n\n serializePacket(vcard, xml);\n}\n\nQTEST_MAIN(tst_QXmppVCardIq)\n#include \"tst_qxmppvcardiq.moc\"\n<commit_msg>Covered eq operators for QXmppVCardAddress with tests.<commit_after>\/*\n * Copyright (C) 2008-2014 The QXmpp developers\n *\n * Author:\n * Jeremy Lainé\n *\n * Source:\n * https:\/\/github.com\/qxmpp-project\/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 <QObject>\n#include \"QXmppVCardIq.h\"\n#include \"util.h\"\n\nclass tst_QXmppVCardIq : public QObject\n{\n Q_OBJECT\n\nprivate slots:\n void testAddress_data();\n void testAddress();\n void testEmail_data();\n void testEmail();\n void testPhone_data();\n void testPhone();\n void testVCard();\n};\n\nvoid tst_QXmppVCardIq::testAddress_data()\n{\n QTest::addColumn<QByteArray>(\"xml\");\n QTest::addColumn<int>(\"type\");\n QTest::addColumn<QString>(\"country\");\n QTest::addColumn<QString>(\"locality\");\n QTest::addColumn<QString>(\"postcode\");\n QTest::addColumn<QString>(\"region\");\n QTest::addColumn<QString>(\"street\");\n QTest::addColumn<bool>(\"equalsEmpty\");\n\n QTest::newRow(\"none\") << QByteArray(\"<ADR\/>\") << int(QXmppVCardAddress::None) << \"\" << \"\" << \"\" << \"\" << \"\" << true;\n QTest::newRow(\"HOME\") << QByteArray(\"<ADR><HOME\/><\/ADR>\") << int(QXmppVCardAddress::Home) << \"\" << \"\" << \"\" << \"\" << \"\" << false;\n QTest::newRow(\"WORK\") << QByteArray(\"<ADR><WORK\/><\/ADR>\") << int(QXmppVCardAddress::Work) << \"\" << \"\" << \"\" << \"\" << \"\" << false;\n QTest::newRow(\"POSTAL\") << QByteArray(\"<ADR><POSTAL\/><\/ADR>\") << int(QXmppVCardAddress::Postal) << \"\" << \"\" << \"\" << \"\" << \"\" << false;\n QTest::newRow(\"PREF\") << QByteArray(\"<ADR><PREF\/><\/ADR>\") << int(QXmppVCardAddress::Preferred) << \"\" << \"\" << \"\" << \"\" << \"\" << false;\n\n QTest::newRow(\"country\") << QByteArray(\"<ADR><CTRY>France<\/CTRY><\/ADR>\") << int(QXmppVCardAddress::None) << \"France\" << \"\" << \"\" << \"\" << \"\" << false;\n QTest::newRow(\"locality\") << QByteArray(\"<ADR><LOCALITY>Paris<\/LOCALITY><\/ADR>\") << int(QXmppVCardAddress::None) << \"\" << \"Paris\" << \"\" << \"\" << \"\" << false;\n QTest::newRow(\"postcode\") << QByteArray(\"<ADR><PCODE>75008<\/PCODE><\/ADR>\") << int(QXmppVCardAddress::None) << \"\" << \"\" << \"75008\" << \"\" << \"\" << false;\n QTest::newRow(\"region\") << QByteArray(\"<ADR><REGION>Ile de France<\/REGION><\/ADR>\") << int(QXmppVCardAddress::None) << \"\" << \"\" << \"\" << \"Ile de France\" << \"\" << false;\n QTest::newRow(\"street\") << QByteArray(\"<ADR><STREET>55 rue du faubourg Saint-Honoré<\/STREET><\/ADR>\") << int(QXmppVCardAddress::None) << \"\" << \"\" << \"\" << \"\" << QString::fromUtf8(\"55 rue du faubourg Saint-Honoré\") << false;\n}\n\nvoid tst_QXmppVCardIq::testAddress()\n{\n QFETCH(QByteArray, xml);\n QFETCH(int, type);\n QFETCH(QString, country);\n QFETCH(QString, locality);\n QFETCH(QString, postcode);\n QFETCH(QString, region);\n QFETCH(QString, street);\n QFETCH(bool, equalsEmpty);\n\n QXmppVCardAddress address;\n parsePacket(address, xml);\n QCOMPARE(int(address.type()), type);\n QCOMPARE(address.country(), country);\n QCOMPARE(address.locality(), locality);\n QCOMPARE(address.postcode(), postcode);\n QCOMPARE(address.region(), region);\n QCOMPARE(address.street(), street);\n serializePacket(address, xml);\n\n QXmppVCardAddress addressCopy = address;\n QVERIFY2(addressCopy == address, \"QXmppVCardAddres::operator==() fails\");\n QVERIFY2(!(addressCopy != address), \"QXmppVCardAddres::operator!=() fails\");\n\n QXmppVCardAddress emptyAddress;\n QCOMPARE(emptyAddress == address, equalsEmpty);\n QCOMPARE(emptyAddress != address, !equalsEmpty);\n}\n\nvoid tst_QXmppVCardIq::testEmail_data()\n{\n QTest::addColumn<QByteArray>(\"xml\");\n QTest::addColumn<int>(\"type\");\n\n QTest::newRow(\"none\") << QByteArray(\"<EMAIL><USERID>foo.bar@example.com<\/USERID><\/EMAIL>\") << int(QXmppVCardEmail::None);\n QTest::newRow(\"HOME\") << QByteArray(\"<EMAIL><HOME\/><USERID>foo.bar@example.com<\/USERID><\/EMAIL>\") << int(QXmppVCardEmail::Home);\n QTest::newRow(\"WORK\") << QByteArray(\"<EMAIL><WORK\/><USERID>foo.bar@example.com<\/USERID><\/EMAIL>\") << int(QXmppVCardEmail::Work);\n QTest::newRow(\"INTERNET\") << QByteArray(\"<EMAIL><INTERNET\/><USERID>foo.bar@example.com<\/USERID><\/EMAIL>\") << int(QXmppVCardEmail::Internet);\n QTest::newRow(\"X400\") << QByteArray(\"<EMAIL><X400\/><USERID>foo.bar@example.com<\/USERID><\/EMAIL>\") << int(QXmppVCardEmail::X400);\n QTest::newRow(\"PREF\") << QByteArray(\"<EMAIL><PREF\/><USERID>foo.bar@example.com<\/USERID><\/EMAIL>\") << int(QXmppVCardEmail::Preferred);\n QTest::newRow(\"all\") << QByteArray(\"<EMAIL><HOME\/><WORK\/><INTERNET\/><PREF\/><X400\/><USERID>foo.bar@example.com<\/USERID><\/EMAIL>\") << int(QXmppVCardEmail::Home | QXmppVCardEmail::Work | QXmppVCardEmail::Internet | QXmppVCardEmail::Preferred | QXmppVCardEmail::X400);\n}\n\nvoid tst_QXmppVCardIq::testEmail()\n{\n QFETCH(QByteArray, xml);\n QFETCH(int, type);\n\n QXmppVCardEmail email;\n parsePacket(email, xml);\n QCOMPARE(email.address(), QLatin1String(\"foo.bar@example.com\"));\n QCOMPARE(int(email.type()), type);\n serializePacket(email, xml);\n}\n\nvoid tst_QXmppVCardIq::testPhone_data()\n{\n QTest::addColumn<QByteArray>(\"xml\");\n QTest::addColumn<int>(\"type\");\n\n QTest::newRow(\"none\") << QByteArray(\"<PHONE><NUMBER>12345<\/NUMBER><\/PHONE>\") << int(QXmppVCardPhone::None);\n QTest::newRow(\"HOME\") << QByteArray(\"<PHONE><HOME\/><NUMBER>12345<\/NUMBER><\/PHONE>\") << int(QXmppVCardPhone::Home);\n QTest::newRow(\"WORK\") << QByteArray(\"<PHONE><WORK\/><NUMBER>12345<\/NUMBER><\/PHONE>\") << int(QXmppVCardPhone::Work);\n QTest::newRow(\"VOICE\") << QByteArray(\"<PHONE><VOICE\/><NUMBER>12345<\/NUMBER><\/PHONE>\") << int(QXmppVCardPhone::Voice);\n QTest::newRow(\"FAX\") << QByteArray(\"<PHONE><FAX\/><NUMBER>12345<\/NUMBER><\/PHONE>\") << int(QXmppVCardPhone::Fax);\n QTest::newRow(\"PAGER\") << QByteArray(\"<PHONE><PAGER\/><NUMBER>12345<\/NUMBER><\/PHONE>\") << int(QXmppVCardPhone::Pager);\n QTest::newRow(\"MSG\") << QByteArray(\"<PHONE><MSG\/><NUMBER>12345<\/NUMBER><\/PHONE>\") << int(QXmppVCardPhone::Messaging);\n QTest::newRow(\"CELL\") << QByteArray(\"<PHONE><CELL\/><NUMBER>12345<\/NUMBER><\/PHONE>\") << int(QXmppVCardPhone::Cell);\n QTest::newRow(\"VIDEO\") << QByteArray(\"<PHONE><VIDEO\/><NUMBER>12345<\/NUMBER><\/PHONE>\") << int(QXmppVCardPhone::Video);\n QTest::newRow(\"BBS\") << QByteArray(\"<PHONE><BBS\/><NUMBER>12345<\/NUMBER><\/PHONE>\") << int(QXmppVCardPhone::BBS);\n QTest::newRow(\"MODEM\") << QByteArray(\"<PHONE><MODEM\/><NUMBER>12345<\/NUMBER><\/PHONE>\") << int(QXmppVCardPhone::Modem);\n QTest::newRow(\"IDSN\") << QByteArray(\"<PHONE><ISDN\/><NUMBER>12345<\/NUMBER><\/PHONE>\") << int(QXmppVCardPhone::ISDN);\n QTest::newRow(\"PCS\") << QByteArray(\"<PHONE><PCS\/><NUMBER>12345<\/NUMBER><\/PHONE>\") << int(QXmppVCardPhone::PCS);\n QTest::newRow(\"PREF\") << QByteArray(\"<PHONE><PREF\/><NUMBER>12345<\/NUMBER><\/PHONE>\") << int(QXmppVCardPhone::Preferred);\n}\n\nvoid tst_QXmppVCardIq::testPhone()\n{\n QFETCH(QByteArray, xml);\n QFETCH(int, type);\n\n QXmppVCardPhone phone;\n parsePacket(phone, xml);\n QCOMPARE(phone.number(), QLatin1String(\"12345\"));\n QCOMPARE(int(phone.type()), type);\n serializePacket(phone, xml);\n}\n\n\nvoid tst_QXmppVCardIq::testVCard()\n{\n const QByteArray xml(\n \"<iq id=\\\"vcard1\\\" type=\\\"set\\\">\"\n \"<vCard xmlns=\\\"vcard-temp\\\">\"\n \"<ADR><CTRY>France<\/CTRY><\/ADR>\"\n \"<BDAY>1983-09-14<\/BDAY>\"\n \"<DESC>I like XMPP.<\/DESC>\"\n \"<EMAIL><INTERNET\/><USERID>foo.bar@example.com<\/USERID><\/EMAIL>\"\n \"<FN>Foo Bar!<\/FN>\"\n \"<NICKNAME>FooBar<\/NICKNAME>\"\n \"<N><GIVEN>Foo<\/GIVEN><FAMILY>Wiz<\/FAMILY><MIDDLE>Baz<\/MIDDLE><\/N>\"\n \"<PHONE><HOME\/><NUMBER>12345<\/NUMBER><\/PHONE>\"\n \"<PHONE><WORK\/><NUMBER>67890<\/NUMBER><\/PHONE>\"\n \"<PHOTO>\"\n \"<TYPE>image\/png<\/TYPE>\"\n \"<BINVAL>\"\n \"iVBORw0KGgoAAAANSUhEUgAAAAgAAAAICAIAAABLbSncAAAAAXNSR0IArs4c6QAAAAlwSFlzAAA\"\n \"UIgAAFCIBjw1HyAAAAAd0SU1FB9oIHQInNvuJovgAAAAiSURBVAjXY2TQ+s\/AwMDAwPD\/GiMDlP\"\n \"WfgYGBiQEHGJwSAK2BBQ1f3uvpAAAAAElFTkSuQmCC\"\n \"<\/BINVAL>\"\n \"<\/PHOTO>\"\n \"<URL>https:\/\/github.com\/qxmpp-project\/qxmpp\/<\/URL>\"\n \"<ORG>\"\n \"<ORGNAME>QXmpp foundation<\/ORGNAME>\"\n \"<ORGUNIT>Main QXmpp dev unit<\/ORGUNIT>\"\n \"<\/ORG>\"\n \"<TITLE>Executive Director<\/TITLE>\"\n \"<ROLE>Patron Saint<\/ROLE>\"\n \"<\/vCard>\"\n \"<\/iq>\");\n\n QXmppVCardIq vcard;\n parsePacket(vcard, xml);\n QCOMPARE(vcard.addresses().size(), 1);\n QCOMPARE(vcard.addresses()[0].country(), QLatin1String(\"France\"));\n QCOMPARE(int(vcard.addresses()[0].type()), int(QXmppVCardEmail::None));\n QCOMPARE(vcard.birthday(), QDate(1983, 9, 14));\n QCOMPARE(vcard.description(), QLatin1String(\"I like XMPP.\"));\n QCOMPARE(vcard.email(), QLatin1String(\"foo.bar@example.com\"));\n QCOMPARE(vcard.emails().size(), 1);\n QCOMPARE(vcard.emails()[0].address(), QLatin1String(\"foo.bar@example.com\"));\n QCOMPARE(int(vcard.emails()[0].type()), int(QXmppVCardEmail::Internet));\n QCOMPARE(vcard.nickName(), QLatin1String(\"FooBar\"));\n QCOMPARE(vcard.fullName(), QLatin1String(\"Foo Bar!\"));\n QCOMPARE(vcard.firstName(), QLatin1String(\"Foo\"));\n QCOMPARE(vcard.middleName(), QLatin1String(\"Baz\"));\n QCOMPARE(vcard.lastName(), QLatin1String(\"Wiz\"));\n QCOMPARE(vcard.phones().size(), 2);\n QCOMPARE(vcard.phones()[0].number(), QLatin1String(\"12345\"));\n QCOMPARE(int(vcard.phones()[0].type()), int(QXmppVCardEmail::Home));\n QCOMPARE(vcard.phones()[1].number(), QLatin1String(\"67890\"));\n QCOMPARE(int(vcard.phones()[1].type()), int(QXmppVCardEmail::Work));\n QCOMPARE(vcard.photo(), QByteArray::fromBase64(\n \"iVBORw0KGgoAAAANSUhEUgAAAAgAAAAICAIAAABLbSncAAAAAXNSR0IArs4c6QAAAAlwSFlzAAA\"\n \"UIgAAFCIBjw1HyAAAAAd0SU1FB9oIHQInNvuJovgAAAAiSURBVAjXY2TQ+s\/AwMDAwPD\/GiMDlP\"\n \"WfgYGBiQEHGJwSAK2BBQ1f3uvpAAAAAElFTkSuQmCC\"));\n QCOMPARE(vcard.photoType(), QLatin1String(\"image\/png\"));\n QCOMPARE(vcard.url(), QLatin1String(\"https:\/\/github.com\/qxmpp-project\/qxmpp\/\"));\n\n const QXmppVCardOrganization &orgInfo = vcard.organization();\n QCOMPARE(orgInfo.organization(), QLatin1String(\"QXmpp foundation\"));\n QCOMPARE(orgInfo.unit(), QLatin1String(\"Main QXmpp dev unit\"));\n QCOMPARE(orgInfo.title(), QLatin1String(\"Executive Director\"));\n QCOMPARE(orgInfo.role(), QLatin1String(\"Patron Saint\"));\n\n serializePacket(vcard, xml);\n}\n\nQTEST_MAIN(tst_QXmppVCardIq)\n#include \"tst_qxmppvcardiq.moc\"\n<|endoftext|>"} {"text":"<commit_before>\/\/===- CodeGenTarget.cpp - CodeGen Target Class Wrapper ---------*- C++ -*-===\/\/\n\/\/\n\/\/ The LLVM Compiler Infrastructure\n\/\/\n\/\/ This file was developed by the LLVM research group and is distributed under\n\/\/ the University of Illinois Open Source License. See LICENSE.TXT for details.\n\/\/\n\/\/===----------------------------------------------------------------------===\/\/\n\/\/\n\/\/ This class wrap target description classes used by the various code\n\/\/ generation TableGen backends. This makes it easier to access the data and\n\/\/ provides a single place that needs to check it for validity. All of these\n\/\/ classes throw exceptions on error conditions.\n\/\/\n\/\/===----------------------------------------------------------------------===\/\/\n\n#include \"CodeGenTarget.h\"\n#include \"Record.h\"\n#include \"llvm\/ADT\/StringExtras.h\"\n#include \"llvm\/Support\/CommandLine.h\"\n#include <set>\nusing namespace llvm;\n\nstatic cl::opt<unsigned>\nAsmWriterNum(\"asmwriternum\", cl::init(0),\n cl::desc(\"Make -gen-asm-writer emit assembly writer #N\"));\n\n\/\/\/ getValueType - Return the MCV::ValueType that the specified TableGen record\n\/\/\/ corresponds to.\nMVT::ValueType llvm::getValueType(Record *Rec) {\n return (MVT::ValueType)Rec->getValueAsInt(\"Value\");\n}\n\nstd::string llvm::getName(MVT::ValueType T) {\n switch (T) {\n case MVT::Other: return \"UNKNOWN\";\n case MVT::i1: return \"i1\";\n case MVT::i8: return \"i8\";\n case MVT::i16: return \"i16\";\n case MVT::i32: return \"i32\";\n case MVT::i64: return \"i64\";\n case MVT::i128: return \"i128\";\n case MVT::f32: return \"f32\";\n case MVT::f64: return \"f64\";\n case MVT::f80: return \"f80\";\n case MVT::f128: return \"f128\";\n case MVT::isVoid:return \"void\";\n default: assert(0 && \"ILLEGAL VALUE TYPE!\"); return \"\";\n }\n}\n\nstd::string llvm::getEnumName(MVT::ValueType T) {\n switch (T) {\n case MVT::Other: return \"Other\";\n case MVT::i1: return \"i1\";\n case MVT::i8: return \"i8\";\n case MVT::i16: return \"i16\";\n case MVT::i32: return \"i32\";\n case MVT::i64: return \"i64\";\n case MVT::i128: return \"i128\";\n case MVT::f32: return \"f32\";\n case MVT::f64: return \"f64\";\n case MVT::f80: return \"f80\";\n case MVT::f128: return \"f128\";\n case MVT::isVoid:return \"isVoid\";\n default: assert(0 && \"ILLEGAL VALUE TYPE!\"); return \"\";\n }\n}\n\n\nstd::ostream &llvm::operator<<(std::ostream &OS, MVT::ValueType T) {\n return OS << getName(T);\n}\n\n\n\/\/\/ getTarget - Return the current instance of the Target class.\n\/\/\/\nCodeGenTarget::CodeGenTarget() : PointerType(MVT::Other) {\n std::vector<Record*> Targets = Records.getAllDerivedDefinitions(\"Target\");\n if (Targets.size() == 0)\n throw std::string(\"ERROR: No 'Target' subclasses defined!\");\n if (Targets.size() != 1)\n throw std::string(\"ERROR: Multiple subclasses of Target defined!\");\n TargetRec = Targets[0];\n\n \/\/ Read in all of the CalleeSavedRegisters...\n ListInit *LI = TargetRec->getValueAsListInit(\"CalleeSavedRegisters\");\n for (unsigned i = 0, e = LI->getSize(); i != e; ++i)\n if (DefInit *DI = dynamic_cast<DefInit*>(LI->getElement(i)))\n CalleeSavedRegisters.push_back(DI->getDef());\n else\n throw \"Target: \" + TargetRec->getName() +\n \" expected register definition in CalleeSavedRegisters list!\";\n\n PointerType = getValueType(TargetRec->getValueAsDef(\"PointerType\"));\n}\n\n\nconst std::string &CodeGenTarget::getName() const {\n return TargetRec->getName();\n}\n\nRecord *CodeGenTarget::getInstructionSet() const {\n return TargetRec->getValueAsDef(\"InstructionSet\");\n}\n\n\/\/\/ getAsmWriter - Return the AssemblyWriter definition for this target.\n\/\/\/\nRecord *CodeGenTarget::getAsmWriter() const {\n ListInit *LI = TargetRec->getValueAsListInit(\"AssemblyWriters\");\n if (AsmWriterNum >= LI->getSize())\n throw \"Target does not have an AsmWriter #\" + utostr(AsmWriterNum) + \"!\";\n DefInit *DI = dynamic_cast<DefInit*>(LI->getElement(AsmWriterNum));\n if (!DI) throw std::string(\"AssemblyWriter list should be a list of defs!\");\n return DI->getDef();\n}\n\nvoid CodeGenTarget::ReadRegisters() const {\n std::vector<Record*> Regs = Records.getAllDerivedDefinitions(\"Register\");\n if (Regs.empty())\n throw std::string(\"No 'Register' subclasses defined!\");\n\n Registers.reserve(Regs.size());\n Registers.assign(Regs.begin(), Regs.end());\n}\n\nCodeGenRegister::CodeGenRegister(Record *R) : TheDef(R) {\n DeclaredSpillSize = R->getValueAsInt(\"SpillSize\");\n DeclaredSpillAlignment = R->getValueAsInt(\"SpillAlignment\");\n}\n\nconst std::string &CodeGenRegister::getName() const {\n return TheDef->getName();\n}\n\nvoid CodeGenTarget::ReadRegisterClasses() const {\n std::vector<Record*> RegClasses =\n Records.getAllDerivedDefinitions(\"RegisterClass\");\n if (RegClasses.empty())\n throw std::string(\"No 'RegisterClass' subclasses defined!\");\n\n RegisterClasses.reserve(RegClasses.size());\n RegisterClasses.assign(RegClasses.begin(), RegClasses.end());\n}\n\nCodeGenRegisterClass::CodeGenRegisterClass(Record *R) : TheDef(R) {\n \/\/ Rename anonymous register classes.\n if (R->getName().size() > 9 && R->getName()[9] == '.') {\n static unsigned AnonCounter = 0;\n R->setName(\"AnonRegClass_\"+utostr(AnonCounter++));\n } \n \n Namespace = R->getValueAsString(\"Namespace\");\n SpillSize = R->getValueAsInt(\"Size\");\n SpillAlignment = R->getValueAsInt(\"Alignment\");\n VT = getValueType(R->getValueAsDef(\"RegType\"));\n\n MethodBodies = R->getValueAsCode(\"MethodBodies\");\n MethodProtos = R->getValueAsCode(\"MethodProtos\");\n \n ListInit *RegList = R->getValueAsListInit(\"MemberList\");\n for (unsigned i = 0, e = RegList->getSize(); i != e; ++i) {\n DefInit *RegDef = dynamic_cast<DefInit*>(RegList->getElement(i));\n if (!RegDef) throw \"Register class member is not a record!\";\n Record *Reg = RegDef->getDef();\n\n if (!Reg->isSubClassOf(\"Register\"))\n throw \"Register Class member '\" + Reg->getName() +\n \"' does not derive from the Register class!\";\n Elements.push_back(Reg);\n }\n}\n\nconst std::string &CodeGenRegisterClass::getName() const {\n return TheDef->getName();\n}\n\nvoid CodeGenTarget::ReadLegalValueTypes() const {\n const std::vector<CodeGenRegisterClass> &RCs = getRegisterClasses();\n for (unsigned i = 0, e = RCs.size(); i != e; ++i)\n LegalValueTypes.push_back(RCs[i].VT);\n}\n\n\nvoid CodeGenTarget::ReadInstructions() const {\n std::vector<Record*> Insts = Records.getAllDerivedDefinitions(\"Instruction\");\n\n if (Insts.empty())\n throw std::string(\"No 'Instruction' subclasses defined!\");\n\n std::string InstFormatName =\n getAsmWriter()->getValueAsString(\"InstFormatName\");\n\n for (unsigned i = 0, e = Insts.size(); i != e; ++i) {\n std::string AsmStr = Insts[i]->getValueAsString(InstFormatName);\n Instructions.insert(std::make_pair(Insts[i]->getName(),\n CodeGenInstruction(Insts[i], AsmStr)));\n }\n}\n\n\/\/\/ getPHIInstruction - Return the designated PHI instruction.\n\/\/\/\nconst CodeGenInstruction &CodeGenTarget::getPHIInstruction() const {\n Record *PHI = getInstructionSet()->getValueAsDef(\"PHIInst\");\n std::map<std::string, CodeGenInstruction>::const_iterator I =\n getInstructions().find(PHI->getName());\n if (I == Instructions.end())\n throw \"Could not find PHI instruction named '\" + PHI->getName() + \"'!\";\n return I->second;\n}\n\n\/\/\/ getInstructionsByEnumValue - Return all of the instructions defined by the\n\/\/\/ target, ordered by their enum value.\nvoid CodeGenTarget::\ngetInstructionsByEnumValue(std::vector<const CodeGenInstruction*>\n &NumberedInstructions) {\n\n \/\/ Print out the rest of the instructions now.\n unsigned i = 0;\n const CodeGenInstruction *PHI = &getPHIInstruction();\n NumberedInstructions.push_back(PHI);\n for (inst_iterator II = inst_begin(), E = inst_end(); II != E; ++II)\n if (&II->second != PHI)\n NumberedInstructions.push_back(&II->second);\n}\n\n\n\/\/\/ isLittleEndianEncoding - Return whether this target encodes its instruction\n\/\/\/ in little-endian format, i.e. bits laid out in the order [0..n]\n\/\/\/\nbool CodeGenTarget::isLittleEndianEncoding() const {\n return getInstructionSet()->getValueAsBit(\"isLittleEndianEncoding\");\n}\n\nCodeGenInstruction::CodeGenInstruction(Record *R, const std::string &AsmStr)\n : TheDef(R), AsmString(AsmStr) {\n Name = R->getValueAsString(\"Name\");\n Namespace = R->getValueAsString(\"Namespace\");\n\n isReturn = R->getValueAsBit(\"isReturn\");\n isBranch = R->getValueAsBit(\"isBranch\");\n isBarrier = R->getValueAsBit(\"isBarrier\");\n isCall = R->getValueAsBit(\"isCall\");\n isLoad = R->getValueAsBit(\"isLoad\");\n isStore = R->getValueAsBit(\"isStore\");\n isTwoAddress = R->getValueAsBit(\"isTwoAddress\");\n isConvertibleToThreeAddress = R->getValueAsBit(\"isConvertibleToThreeAddress\");\n isCommutable = R->getValueAsBit(\"isCommutable\");\n isTerminator = R->getValueAsBit(\"isTerminator\");\n hasDelaySlot = R->getValueAsBit(\"hasDelaySlot\");\n usesCustomDAGSchedInserter = R->getValueAsBit(\"usesCustomDAGSchedInserter\");\n hasVariableNumberOfOperands = false;\n \n DagInit *DI;\n try {\n DI = R->getValueAsDag(\"OperandList\");\n } catch (...) {\n \/\/ Error getting operand list, just ignore it (sparcv9).\n AsmString.clear();\n OperandList.clear();\n return;\n }\n\n unsigned MIOperandNo = 0;\n std::set<std::string> OperandNames;\n for (unsigned i = 0, e = DI->getNumArgs(); i != e; ++i) {\n DefInit *Arg = dynamic_cast<DefInit*>(DI->getArg(i));\n if (!Arg)\n throw \"Illegal operand for the '\" + R->getName() + \"' instruction!\";\n\n Record *Rec = Arg->getDef();\n MVT::ValueType Ty;\n std::string PrintMethod = \"printOperand\";\n unsigned NumOps = 1;\n if (Rec->isSubClassOf(\"RegisterClass\")) {\n Ty = getValueType(Rec->getValueAsDef(\"RegType\"));\n } else if (Rec->isSubClassOf(\"Operand\")) {\n Ty = getValueType(Rec->getValueAsDef(\"Type\"));\n PrintMethod = Rec->getValueAsString(\"PrintMethod\");\n NumOps = Rec->getValueAsInt(\"NumMIOperands\");\n } else if (Rec->getName() == \"variable_ops\") {\n hasVariableNumberOfOperands = true;\n continue;\n } else\n throw \"Unknown operand class '\" + Rec->getName() +\n \"' in instruction '\" + R->getName() + \"' instruction!\";\n\n \/\/ Check that the operand has a name and that it's unique.\n if (DI->getArgName(i).empty())\n throw \"In instruction '\" + R->getName() + \"', operand #\" + utostr(i) +\n \" has no name!\";\n if (!OperandNames.insert(DI->getArgName(i)).second)\n throw \"In instruction '\" + R->getName() + \"', operand #\" + utostr(i) +\n \" has the same name as a previous operand!\";\n \n OperandList.push_back(OperandInfo(Rec, Ty, DI->getArgName(i),\n PrintMethod, MIOperandNo, NumOps));\n MIOperandNo += NumOps;\n }\n}\n\n\n\n\/\/\/ getOperandNamed - Return the index of the operand with the specified\n\/\/\/ non-empty name. If the instruction does not have an operand with the\n\/\/\/ specified name, throw an exception.\n\/\/\/\nunsigned CodeGenInstruction::getOperandNamed(const std::string &Name) const {\n assert(!Name.empty() && \"Cannot search for operand with no name!\");\n for (unsigned i = 0, e = OperandList.size(); i != e; ++i)\n if (OperandList[i].Name == Name) return i;\n throw \"Instruction '\" + TheDef->getName() +\n \"' does not have an operand named '$\" + Name + \"'!\";\n}\n<commit_msg>Do not let getLegalValueTypes return a list with duplicates in it<commit_after>\/\/===- CodeGenTarget.cpp - CodeGen Target Class Wrapper ---------*- C++ -*-===\/\/\n\/\/\n\/\/ The LLVM Compiler Infrastructure\n\/\/\n\/\/ This file was developed by the LLVM research group and is distributed under\n\/\/ the University of Illinois Open Source License. See LICENSE.TXT for details.\n\/\/\n\/\/===----------------------------------------------------------------------===\/\/\n\/\/\n\/\/ This class wrap target description classes used by the various code\n\/\/ generation TableGen backends. This makes it easier to access the data and\n\/\/ provides a single place that needs to check it for validity. All of these\n\/\/ classes throw exceptions on error conditions.\n\/\/\n\/\/===----------------------------------------------------------------------===\/\/\n\n#include \"CodeGenTarget.h\"\n#include \"Record.h\"\n#include \"llvm\/ADT\/StringExtras.h\"\n#include \"llvm\/Support\/CommandLine.h\"\n#include <set>\n#include <algorithm>\nusing namespace llvm;\n\nstatic cl::opt<unsigned>\nAsmWriterNum(\"asmwriternum\", cl::init(0),\n cl::desc(\"Make -gen-asm-writer emit assembly writer #N\"));\n\n\/\/\/ getValueType - Return the MCV::ValueType that the specified TableGen record\n\/\/\/ corresponds to.\nMVT::ValueType llvm::getValueType(Record *Rec) {\n return (MVT::ValueType)Rec->getValueAsInt(\"Value\");\n}\n\nstd::string llvm::getName(MVT::ValueType T) {\n switch (T) {\n case MVT::Other: return \"UNKNOWN\";\n case MVT::i1: return \"i1\";\n case MVT::i8: return \"i8\";\n case MVT::i16: return \"i16\";\n case MVT::i32: return \"i32\";\n case MVT::i64: return \"i64\";\n case MVT::i128: return \"i128\";\n case MVT::f32: return \"f32\";\n case MVT::f64: return \"f64\";\n case MVT::f80: return \"f80\";\n case MVT::f128: return \"f128\";\n case MVT::isVoid:return \"void\";\n default: assert(0 && \"ILLEGAL VALUE TYPE!\"); return \"\";\n }\n}\n\nstd::string llvm::getEnumName(MVT::ValueType T) {\n switch (T) {\n case MVT::Other: return \"Other\";\n case MVT::i1: return \"i1\";\n case MVT::i8: return \"i8\";\n case MVT::i16: return \"i16\";\n case MVT::i32: return \"i32\";\n case MVT::i64: return \"i64\";\n case MVT::i128: return \"i128\";\n case MVT::f32: return \"f32\";\n case MVT::f64: return \"f64\";\n case MVT::f80: return \"f80\";\n case MVT::f128: return \"f128\";\n case MVT::isVoid:return \"isVoid\";\n default: assert(0 && \"ILLEGAL VALUE TYPE!\"); return \"\";\n }\n}\n\n\nstd::ostream &llvm::operator<<(std::ostream &OS, MVT::ValueType T) {\n return OS << getName(T);\n}\n\n\n\/\/\/ getTarget - Return the current instance of the Target class.\n\/\/\/\nCodeGenTarget::CodeGenTarget() : PointerType(MVT::Other) {\n std::vector<Record*> Targets = Records.getAllDerivedDefinitions(\"Target\");\n if (Targets.size() == 0)\n throw std::string(\"ERROR: No 'Target' subclasses defined!\");\n if (Targets.size() != 1)\n throw std::string(\"ERROR: Multiple subclasses of Target defined!\");\n TargetRec = Targets[0];\n\n \/\/ Read in all of the CalleeSavedRegisters...\n ListInit *LI = TargetRec->getValueAsListInit(\"CalleeSavedRegisters\");\n for (unsigned i = 0, e = LI->getSize(); i != e; ++i)\n if (DefInit *DI = dynamic_cast<DefInit*>(LI->getElement(i)))\n CalleeSavedRegisters.push_back(DI->getDef());\n else\n throw \"Target: \" + TargetRec->getName() +\n \" expected register definition in CalleeSavedRegisters list!\";\n\n PointerType = getValueType(TargetRec->getValueAsDef(\"PointerType\"));\n}\n\n\nconst std::string &CodeGenTarget::getName() const {\n return TargetRec->getName();\n}\n\nRecord *CodeGenTarget::getInstructionSet() const {\n return TargetRec->getValueAsDef(\"InstructionSet\");\n}\n\n\/\/\/ getAsmWriter - Return the AssemblyWriter definition for this target.\n\/\/\/\nRecord *CodeGenTarget::getAsmWriter() const {\n ListInit *LI = TargetRec->getValueAsListInit(\"AssemblyWriters\");\n if (AsmWriterNum >= LI->getSize())\n throw \"Target does not have an AsmWriter #\" + utostr(AsmWriterNum) + \"!\";\n DefInit *DI = dynamic_cast<DefInit*>(LI->getElement(AsmWriterNum));\n if (!DI) throw std::string(\"AssemblyWriter list should be a list of defs!\");\n return DI->getDef();\n}\n\nvoid CodeGenTarget::ReadRegisters() const {\n std::vector<Record*> Regs = Records.getAllDerivedDefinitions(\"Register\");\n if (Regs.empty())\n throw std::string(\"No 'Register' subclasses defined!\");\n\n Registers.reserve(Regs.size());\n Registers.assign(Regs.begin(), Regs.end());\n}\n\nCodeGenRegister::CodeGenRegister(Record *R) : TheDef(R) {\n DeclaredSpillSize = R->getValueAsInt(\"SpillSize\");\n DeclaredSpillAlignment = R->getValueAsInt(\"SpillAlignment\");\n}\n\nconst std::string &CodeGenRegister::getName() const {\n return TheDef->getName();\n}\n\nvoid CodeGenTarget::ReadRegisterClasses() const {\n std::vector<Record*> RegClasses =\n Records.getAllDerivedDefinitions(\"RegisterClass\");\n if (RegClasses.empty())\n throw std::string(\"No 'RegisterClass' subclasses defined!\");\n\n RegisterClasses.reserve(RegClasses.size());\n RegisterClasses.assign(RegClasses.begin(), RegClasses.end());\n}\n\nCodeGenRegisterClass::CodeGenRegisterClass(Record *R) : TheDef(R) {\n \/\/ Rename anonymous register classes.\n if (R->getName().size() > 9 && R->getName()[9] == '.') {\n static unsigned AnonCounter = 0;\n R->setName(\"AnonRegClass_\"+utostr(AnonCounter++));\n } \n \n Namespace = R->getValueAsString(\"Namespace\");\n SpillSize = R->getValueAsInt(\"Size\");\n SpillAlignment = R->getValueAsInt(\"Alignment\");\n VT = getValueType(R->getValueAsDef(\"RegType\"));\n\n MethodBodies = R->getValueAsCode(\"MethodBodies\");\n MethodProtos = R->getValueAsCode(\"MethodProtos\");\n \n ListInit *RegList = R->getValueAsListInit(\"MemberList\");\n for (unsigned i = 0, e = RegList->getSize(); i != e; ++i) {\n DefInit *RegDef = dynamic_cast<DefInit*>(RegList->getElement(i));\n if (!RegDef) throw \"Register class member is not a record!\";\n Record *Reg = RegDef->getDef();\n\n if (!Reg->isSubClassOf(\"Register\"))\n throw \"Register Class member '\" + Reg->getName() +\n \"' does not derive from the Register class!\";\n Elements.push_back(Reg);\n }\n}\n\nconst std::string &CodeGenRegisterClass::getName() const {\n return TheDef->getName();\n}\n\nvoid CodeGenTarget::ReadLegalValueTypes() const {\n const std::vector<CodeGenRegisterClass> &RCs = getRegisterClasses();\n for (unsigned i = 0, e = RCs.size(); i != e; ++i)\n LegalValueTypes.push_back(RCs[i].VT);\n \n \/\/ Remove duplicates.\n std::sort(LegalValueTypes.begin(), LegalValueTypes.end());\n LegalValueTypes.erase(std::unique(LegalValueTypes.begin(),\n LegalValueTypes.end()),\n LegalValueTypes.end());\n}\n\n\nvoid CodeGenTarget::ReadInstructions() const {\n std::vector<Record*> Insts = Records.getAllDerivedDefinitions(\"Instruction\");\n\n if (Insts.empty())\n throw std::string(\"No 'Instruction' subclasses defined!\");\n\n std::string InstFormatName =\n getAsmWriter()->getValueAsString(\"InstFormatName\");\n\n for (unsigned i = 0, e = Insts.size(); i != e; ++i) {\n std::string AsmStr = Insts[i]->getValueAsString(InstFormatName);\n Instructions.insert(std::make_pair(Insts[i]->getName(),\n CodeGenInstruction(Insts[i], AsmStr)));\n }\n}\n\n\/\/\/ getPHIInstruction - Return the designated PHI instruction.\n\/\/\/\nconst CodeGenInstruction &CodeGenTarget::getPHIInstruction() const {\n Record *PHI = getInstructionSet()->getValueAsDef(\"PHIInst\");\n std::map<std::string, CodeGenInstruction>::const_iterator I =\n getInstructions().find(PHI->getName());\n if (I == Instructions.end())\n throw \"Could not find PHI instruction named '\" + PHI->getName() + \"'!\";\n return I->second;\n}\n\n\/\/\/ getInstructionsByEnumValue - Return all of the instructions defined by the\n\/\/\/ target, ordered by their enum value.\nvoid CodeGenTarget::\ngetInstructionsByEnumValue(std::vector<const CodeGenInstruction*>\n &NumberedInstructions) {\n\n \/\/ Print out the rest of the instructions now.\n unsigned i = 0;\n const CodeGenInstruction *PHI = &getPHIInstruction();\n NumberedInstructions.push_back(PHI);\n for (inst_iterator II = inst_begin(), E = inst_end(); II != E; ++II)\n if (&II->second != PHI)\n NumberedInstructions.push_back(&II->second);\n}\n\n\n\/\/\/ isLittleEndianEncoding - Return whether this target encodes its instruction\n\/\/\/ in little-endian format, i.e. bits laid out in the order [0..n]\n\/\/\/\nbool CodeGenTarget::isLittleEndianEncoding() const {\n return getInstructionSet()->getValueAsBit(\"isLittleEndianEncoding\");\n}\n\nCodeGenInstruction::CodeGenInstruction(Record *R, const std::string &AsmStr)\n : TheDef(R), AsmString(AsmStr) {\n Name = R->getValueAsString(\"Name\");\n Namespace = R->getValueAsString(\"Namespace\");\n\n isReturn = R->getValueAsBit(\"isReturn\");\n isBranch = R->getValueAsBit(\"isBranch\");\n isBarrier = R->getValueAsBit(\"isBarrier\");\n isCall = R->getValueAsBit(\"isCall\");\n isLoad = R->getValueAsBit(\"isLoad\");\n isStore = R->getValueAsBit(\"isStore\");\n isTwoAddress = R->getValueAsBit(\"isTwoAddress\");\n isConvertibleToThreeAddress = R->getValueAsBit(\"isConvertibleToThreeAddress\");\n isCommutable = R->getValueAsBit(\"isCommutable\");\n isTerminator = R->getValueAsBit(\"isTerminator\");\n hasDelaySlot = R->getValueAsBit(\"hasDelaySlot\");\n usesCustomDAGSchedInserter = R->getValueAsBit(\"usesCustomDAGSchedInserter\");\n hasVariableNumberOfOperands = false;\n \n DagInit *DI;\n try {\n DI = R->getValueAsDag(\"OperandList\");\n } catch (...) {\n \/\/ Error getting operand list, just ignore it (sparcv9).\n AsmString.clear();\n OperandList.clear();\n return;\n }\n\n unsigned MIOperandNo = 0;\n std::set<std::string> OperandNames;\n for (unsigned i = 0, e = DI->getNumArgs(); i != e; ++i) {\n DefInit *Arg = dynamic_cast<DefInit*>(DI->getArg(i));\n if (!Arg)\n throw \"Illegal operand for the '\" + R->getName() + \"' instruction!\";\n\n Record *Rec = Arg->getDef();\n MVT::ValueType Ty;\n std::string PrintMethod = \"printOperand\";\n unsigned NumOps = 1;\n if (Rec->isSubClassOf(\"RegisterClass\")) {\n Ty = getValueType(Rec->getValueAsDef(\"RegType\"));\n } else if (Rec->isSubClassOf(\"Operand\")) {\n Ty = getValueType(Rec->getValueAsDef(\"Type\"));\n PrintMethod = Rec->getValueAsString(\"PrintMethod\");\n NumOps = Rec->getValueAsInt(\"NumMIOperands\");\n } else if (Rec->getName() == \"variable_ops\") {\n hasVariableNumberOfOperands = true;\n continue;\n } else\n throw \"Unknown operand class '\" + Rec->getName() +\n \"' in instruction '\" + R->getName() + \"' instruction!\";\n\n \/\/ Check that the operand has a name and that it's unique.\n if (DI->getArgName(i).empty())\n throw \"In instruction '\" + R->getName() + \"', operand #\" + utostr(i) +\n \" has no name!\";\n if (!OperandNames.insert(DI->getArgName(i)).second)\n throw \"In instruction '\" + R->getName() + \"', operand #\" + utostr(i) +\n \" has the same name as a previous operand!\";\n \n OperandList.push_back(OperandInfo(Rec, Ty, DI->getArgName(i),\n PrintMethod, MIOperandNo, NumOps));\n MIOperandNo += NumOps;\n }\n}\n\n\n\n\/\/\/ getOperandNamed - Return the index of the operand with the specified\n\/\/\/ non-empty name. If the instruction does not have an operand with the\n\/\/\/ specified name, throw an exception.\n\/\/\/\nunsigned CodeGenInstruction::getOperandNamed(const std::string &Name) const {\n assert(!Name.empty() && \"Cannot search for operand with no name!\");\n for (unsigned i = 0, e = OperandList.size(); i != e; ++i)\n if (OperandList[i].Name == Name) return i;\n throw \"Instruction '\" + TheDef->getName() +\n \"' does not have an operand named '$\" + Name + \"'!\";\n}\n<|endoftext|>"} {"text":"<commit_before>#include \"MPC.h\"\n#include <cppad\/cppad.hpp>\n#include <cppad\/ipopt\/solve.hpp>\n#include \"Eigen-3.3\/Eigen\/Core\"\n\nusing CppAD::AD;\n\nsize_t N = 15;\ndouble dt = 0.05;\n\n\/\/ This value assumes the model presented in the classroom is used.\n\/\/\n\/\/ It was obtained by measuring the radius formed by running the vehicle in the\n\/\/ simulator around in a circle with a constant steering angle and velocity on a\n\/\/ flat terrain.\n\/\/\n\/\/ Lf was tuned until the the radius formed by the simulating the model\n\/\/ presented in the classroom matched the previous radius.\n\/\/\n\/\/ This is the length from front to CoG that has a similar radius.\nconst double Lf = 2.67;\n\ndouble ref_v = 60;\n\nsize_t x_start = 0;\nsize_t y_start = x_start + N;\nsize_t psi_start = y_start + N;\nsize_t v_start = psi_start + N;\nsize_t cte_start = v_start + N;\nsize_t epsi_start = cte_start + N;\nsize_t delta_start = epsi_start + N;\nsize_t a_start = delta_start + N - 1;\n\nclass FG_eval {\n public:\n \/\/ Fitted polynomial coefficients\n Eigen::VectorXd coeffs;\n FG_eval(Eigen::VectorXd coeffs) { this->coeffs = coeffs; }\n\n typedef CPPAD_TESTVECTOR(AD<double>) ADvector;\n void operator()(ADvector& fg, const ADvector& vars) {\n \/\/ `fg` a vector of the cost constraints, `vars` is a vector of variable values (state & actuators)\n \/\/ NOTE: You'll probably go back and forth between this function and\n \/\/ the Solver function below.\n\n \/\/ The cost is stored is the first element of `fg`.\n \/\/ Any additions to the cost should be added to `fg[0]`.\n fg[0] = 0;\n\n \/\/ Reference State Cost\n \/\/ The part of the cost based on the reference state.\n for (int t = 0; t < N; t++) {\n fg[0] += 0.5 * CppAD::pow(vars[cte_start + t], 2);\n fg[0] += 5 * CppAD::pow(vars[epsi_start + t], 2);\n fg[0] += CppAD::pow(vars[v_start + t] - ref_v, 2);\n \/\/fg[0] += 0.01 * CppAD::pow(t * vars[v_start + t] * vars[psi_start + t], 2);\n }\n\n \/\/ Minimize the use of actuators.\n for (int t = 0; t < N - 1; t++) {\n fg[0] += 5000 * CppAD::pow(vars[delta_start + t], 2);\n fg[0] += CppAD::pow(vars[a_start + t], 2);\n }\n\n \/\/ Minimize the value gap between sequential actuations.\n for (int t = 0; t < N - 2; t++) {\n fg[0] += 5000 * CppAD::pow(vars[delta_start + t + 1] - vars[delta_start + t], 2);\n fg[0] += CppAD::pow(vars[a_start + t + 1] - vars[a_start + t], 2);\n }\n\n \/\/\n \/\/ Setup Constraints\n \/\/\n\n \/\/ Initial constraints\n \/\/\n \/\/ We add 1 to each of the starting indices due to cost being located at\n \/\/ index 0 of `fg`.\n \/\/ This bumps up the position of all the other values.\n fg[1 + x_start] = vars[x_start];\n fg[1 + y_start] = vars[y_start];\n fg[1 + psi_start] = vars[psi_start];\n fg[1 + v_start] = vars[v_start];\n fg[1 + cte_start] = vars[cte_start];\n fg[1 + epsi_start] = vars[epsi_start];\n\n \/\/ The rest of the constraints\n for (int t = 1; t < N; t++) {\n \/\/ The state at time t+1\n AD<double> x1 = vars[x_start + t];\n AD<double> y1 = vars[y_start + t];\n AD<double> psi1 = vars[psi_start + t];\n AD<double> v1 = vars[v_start + t];\n AD<double> cte1 = vars[cte_start + t];\n AD<double> epsi1 = vars[epsi_start + t];\n\n \/\/ The state at time t.\n AD<double> x0 = vars[x_start + t - 1];\n AD<double> y0 = vars[y_start + t - 1];\n AD<double> psi0 = vars[psi_start + t - 1];\n AD<double> v0 = vars[v_start + t - 1];\n AD<double> cte0 = vars[cte_start + t - 1];\n AD<double> epsi0 = vars[epsi_start + t - 1];\n\n \/\/ Only consider the actuation at time t.\n AD<double> delta0 = vars[delta_start + t - 1];\n AD<double> a0 = vars[a_start + t - 1];\n\n AD<double> f0 = coeffs[0] + coeffs[1] * x0 + coeffs[2] * x0 * x0 + coeffs[3] * x0 * x0 * x0;\n AD<double> psides0 = CppAD::atan(coeffs[1] + (2 * coeffs[2] * x0) + (3 * coeffs[3] * (x0*x0)));\n\n \/\/ Here's `x` to get you started.\n \/\/ The idea here is to constraint this value to be 0.\n \/\/\n \/\/ Recall the equations for the model:\n \/\/ x_[t+1] = x[t] + v[t] * cos(psi[t]) * dt\n \/\/ y_[t+1] = y[t] + v[t] * sin(psi[t]) * dt\n \/\/ psi_[t+1] = psi[t] + v[t] \/ Lf * delta[t] * dt\n \/\/ v_[t+1] = v[t] + a[t] * dt\n \/\/ cte[t+1] = f(x[t]) - y[t] + v[t] * sin(epsi[t]) * dt\n \/\/ epsi[t+1] = psi[t] - psides[t] + v[t] * delta[t] \/ Lf * dt\n AD<double> psi1c = psi0 + (v0 \/ Lf * delta0 * dt);\n fg[1 + x_start + t] = x1 - (x0 + (v0 * CppAD::cos(psi0) * dt));\n fg[1 + y_start + t] = y1 - (y0 + (v0 * CppAD::sin(psi0) * dt));\n fg[1 + psi_start + t] = psi1 - psi1c;\n fg[1 + v_start + t] = v1 - (v0 + (a0 * dt));\n fg[1 + cte_start + t] = cte1 - (f0 - y0 + (v0 * CppAD::sin(epsi0) * dt));\n fg[1 + epsi_start + t] = epsi1 - psi1c;\n }\n }\n};\n\n\/\/\n\/\/ MPC class definition implementation.\n\/\/\nMPC::MPC() {}\nMPC::~MPC() {}\n\nvector<double> MPC::Solve(Eigen::VectorXd state, Eigen::VectorXd coeffs) {\n typedef CPPAD_TESTVECTOR(double) Dvector;\n\n double x = state[0];\n double y = state[1];\n double psi = state[2];\n double v = state[3];\n double cte = state[4];\n double epsi = state[5];\n\n \/\/ Set the number of model variables\n size_t n_vars = (6 * N) + (2 * (N - 1));\n \/\/ Set the number of constraints\n size_t n_constraints = 6 * N;\n\n \/\/ Initial value of the independent variables.\n \/\/ SHOULD BE 0 besides initial state.\n Dvector vars(n_vars);\n for (int i = 0; i < n_vars; i++) {\n vars[i] = 0;\n }\n \/\/ Set the initial variable values\n vars[x_start] = x;\n vars[y_start] = y;\n vars[psi_start] = psi;\n vars[v_start] = v;\n vars[cte_start] = cte;\n vars[epsi_start] = epsi;\n\n Dvector vars_lowerbound(n_vars);\n Dvector vars_upperbound(n_vars);\n \/\/ Set all non-actuators upper and lowerlimits\n \/\/ to the max negative and positive values.\n for (int i = 0; i < delta_start; i++) {\n vars_lowerbound[i] = -1.0e19;\n vars_upperbound[i] = 1.0e19;\n }\n\n \/\/ The upper and lower limits of delta are set to -25 and 25\n \/\/ degrees (values in radians).\n for (int i = delta_start; i < a_start; i++) {\n vars_lowerbound[i] = -0.436332;\n vars_upperbound[i] = 0.436332;\n }\n\n \/\/ Acceleration\/decceleration upper and lower limits.\n for (int i = a_start; i < n_vars; i++) {\n vars_lowerbound[i] = -1.0;\n vars_upperbound[i] = 1.0;\n }\n\n \/\/ Lower and upper limits for the constraints\n \/\/ Should be 0 besides initial state.\n Dvector constraints_lowerbound(n_constraints);\n Dvector constraints_upperbound(n_constraints);\n for (int i = 0; i < n_constraints; i++) {\n constraints_lowerbound[i] = 0;\n constraints_upperbound[i] = 0;\n }\n constraints_lowerbound[x_start] = x;\n constraints_lowerbound[y_start] = y;\n constraints_lowerbound[psi_start] = psi;\n constraints_lowerbound[v_start] = v;\n constraints_lowerbound[cte_start] = cte;\n constraints_lowerbound[epsi_start] = epsi;\n\n constraints_upperbound[x_start] = x;\n constraints_upperbound[y_start] = y;\n constraints_upperbound[psi_start] = psi;\n constraints_upperbound[v_start] = v;\n constraints_upperbound[cte_start] = cte;\n constraints_upperbound[epsi_start] = epsi;\n\n \/\/ object that computes objective and constraints\n FG_eval fg_eval(coeffs);\n\n \/\/\n \/\/ NOTE: You don't have to worry about these options\n \/\/\n \/\/ options for IPOPT solver\n std::string options;\n \/\/ Uncomment this if you'd like more print information\n options += \"Integer print_level 0\\n\";\n \/\/ NOTE: Setting sparse to true allows the solver to take advantage\n \/\/ of sparse routines, this makes the computation MUCH FASTER. If you\n \/\/ can uncomment 1 of these and see if it makes a difference or not but\n \/\/ if you uncomment both the computation time should go up in orders of\n \/\/ magnitude.\n options += \"Sparse true forward\\n\";\n options += \"Sparse true reverse\\n\";\n \/\/ NOTE: Currently the solver has a maximum time limit of 0.5 seconds.\n \/\/ Change this as you see fit.\n options += \"Numeric max_cpu_time 0.5\\n\";\n\n \/\/ place to return solution\n CppAD::ipopt::solve_result<Dvector> solution;\n\n \/\/ solve the problem\n CppAD::ipopt::solve<Dvector, FG_eval>(\n options, vars, vars_lowerbound, vars_upperbound, constraints_lowerbound,\n constraints_upperbound, fg_eval, solution);\n\n \/\/ Cost\n auto cost = solution.obj_value;\n std::cout << \"Cost \" << cost << std::endl;\n\n \/\/ We'll return the following values:\n \/\/ 0 -> the immediate steering value (in Radians)\n \/\/ 1 -> the immediate throttle value\n \/\/ 2 -> amount of coordinate values (N)\n \/\/ 3 ... 3+N -> X coordinate values\n \/\/ 3+N+1 ... 3+N+1+N -> Y coordinate values\n vector<double> result;\n result.push_back(solution.x[delta_start]);\n result.push_back(solution.x[a_start]);\n result.push_back(N);\n for (int i = 0; i < N; ++i)\n {\n result.push_back(solution.x[x_start + i]);\n }\n for (int i = 0; i < N; ++i)\n {\n result.push_back(solution.x[y_start + i]);\n }\n return result;\n}\n<commit_msg>P5 - still drives well at 60 mph<commit_after>#include \"MPC.h\"\n#include <cppad\/cppad.hpp>\n#include <cppad\/ipopt\/solve.hpp>\n#include \"Eigen-3.3\/Eigen\/Core\"\n\nusing CppAD::AD;\n\nsize_t N = 15;\ndouble dt = 0.05;\n\n\/\/ This value assumes the model presented in the classroom is used.\n\/\/\n\/\/ It was obtained by measuring the radius formed by running the vehicle in the\n\/\/ simulator around in a circle with a constant steering angle and velocity on a\n\/\/ flat terrain.\n\/\/\n\/\/ Lf was tuned until the the radius formed by the simulating the model\n\/\/ presented in the classroom matched the previous radius.\n\/\/\n\/\/ This is the length from front to CoG that has a similar radius.\nconst double Lf = 2.67;\n\ndouble ref_v = 60;\n\nsize_t x_start = 0;\nsize_t y_start = x_start + N;\nsize_t psi_start = y_start + N;\nsize_t v_start = psi_start + N;\nsize_t cte_start = v_start + N;\nsize_t epsi_start = cte_start + N;\nsize_t delta_start = epsi_start + N;\nsize_t a_start = delta_start + N - 1;\n\nclass FG_eval {\n public:\n \/\/ Fitted polynomial coefficients\n Eigen::VectorXd coeffs;\n FG_eval(Eigen::VectorXd coeffs) { this->coeffs = coeffs; }\n\n typedef CPPAD_TESTVECTOR(AD<double>) ADvector;\n void operator()(ADvector& fg, const ADvector& vars) {\n \/\/ `fg` a vector of the cost constraints, `vars` is a vector of variable values (state & actuators)\n \/\/ NOTE: You'll probably go back and forth between this function and\n \/\/ the Solver function below.\n\n \/\/ The cost is stored is the first element of `fg`.\n \/\/ Any additions to the cost should be added to `fg[0]`.\n fg[0] = 0;\n\n \/\/ Reference State Cost\n \/\/ The part of the cost based on the reference state.\n for (int t = 0; t < N; t++) {\n fg[0] += 0.5 * CppAD::pow(vars[cte_start + t], 2);\n fg[0] += 5 * CppAD::pow(vars[epsi_start + t], 2);\n fg[0] += CppAD::pow(vars[v_start + t] - ref_v, 2);\n \/\/fg[0] += 0.01 * CppAD::pow(t * vars[v_start + t] * vars[psi_start + t], 2);\n }\n\n \/\/ Minimize the use of actuators.\n for (int t = 0; t < N - 1; t++) {\n fg[0] += 5000 * CppAD::pow(vars[delta_start + t], 2);\n fg[0] += CppAD::pow(vars[a_start + t], 2);\n }\n\n \/\/ Minimize the value gap between sequential actuations.\n for (int t = 0; t < N - 2; t++) {\n fg[0] += 500 * CppAD::pow(vars[delta_start + t + 1] - vars[delta_start + t], 2);\n fg[0] += CppAD::pow(vars[a_start + t + 1] - vars[a_start + t], 2);\n }\n\n \/\/\n \/\/ Setup Constraints\n \/\/\n\n \/\/ Initial constraints\n \/\/\n \/\/ We add 1 to each of the starting indices due to cost being located at\n \/\/ index 0 of `fg`.\n \/\/ This bumps up the position of all the other values.\n fg[1 + x_start] = vars[x_start];\n fg[1 + y_start] = vars[y_start];\n fg[1 + psi_start] = vars[psi_start];\n fg[1 + v_start] = vars[v_start];\n fg[1 + cte_start] = vars[cte_start];\n fg[1 + epsi_start] = vars[epsi_start];\n\n \/\/ The rest of the constraints\n for (int t = 1; t < N; t++) {\n \/\/ The state at time t+1\n AD<double> x1 = vars[x_start + t];\n AD<double> y1 = vars[y_start + t];\n AD<double> psi1 = vars[psi_start + t];\n AD<double> v1 = vars[v_start + t];\n AD<double> cte1 = vars[cte_start + t];\n AD<double> epsi1 = vars[epsi_start + t];\n\n \/\/ The state at time t.\n AD<double> x0 = vars[x_start + t - 1];\n AD<double> y0 = vars[y_start + t - 1];\n AD<double> psi0 = vars[psi_start + t - 1];\n AD<double> v0 = vars[v_start + t - 1];\n AD<double> cte0 = vars[cte_start + t - 1];\n AD<double> epsi0 = vars[epsi_start + t - 1];\n\n \/\/ Only consider the actuation at time t.\n AD<double> delta0 = vars[delta_start + t - 1];\n AD<double> a0 = vars[a_start + t - 1];\n\n AD<double> f0 = coeffs[0] + coeffs[1] * x0 + coeffs[2] * x0 * x0 + coeffs[3] * x0 * x0 * x0;\n AD<double> psides0 = CppAD::atan(coeffs[1] + (2 * coeffs[2] * x0) + (3 * coeffs[3] * (x0*x0)));\n\n \/\/ Here's `x` to get you started.\n \/\/ The idea here is to constraint this value to be 0.\n \/\/\n \/\/ Recall the equations for the model:\n \/\/ x_[t+1] = x[t] + v[t] * cos(psi[t]) * dt\n \/\/ y_[t+1] = y[t] + v[t] * sin(psi[t]) * dt\n \/\/ psi_[t+1] = psi[t] + v[t] \/ Lf * delta[t] * dt\n \/\/ v_[t+1] = v[t] + a[t] * dt\n \/\/ cte[t+1] = f(x[t]) - y[t] + v[t] * sin(epsi[t]) * dt\n \/\/ epsi[t+1] = psi[t] - psides[t] + v[t] * delta[t] \/ Lf * dt\n AD<double> psi1c = psi0 + (v0 \/ Lf * delta0 * dt);\n fg[1 + x_start + t] = x1 - (x0 + (v0 * CppAD::cos(psi0) * dt));\n fg[1 + y_start + t] = y1 - (y0 + (v0 * CppAD::sin(psi0) * dt));\n fg[1 + psi_start + t] = psi1 - psi1c;\n fg[1 + v_start + t] = v1 - (v0 + (a0 * dt));\n fg[1 + cte_start + t] = cte1 - (f0 - y0 + (v0 * CppAD::sin(epsi0) * dt));\n fg[1 + epsi_start + t] = epsi1 - psi1c;\n }\n }\n};\n\n\/\/\n\/\/ MPC class definition implementation.\n\/\/\nMPC::MPC() {}\nMPC::~MPC() {}\n\nvector<double> MPC::Solve(Eigen::VectorXd state, Eigen::VectorXd coeffs) {\n typedef CPPAD_TESTVECTOR(double) Dvector;\n\n double x = state[0];\n double y = state[1];\n double psi = state[2];\n double v = state[3];\n double cte = state[4];\n double epsi = state[5];\n\n \/\/ Set the number of model variables\n size_t n_vars = (6 * N) + (2 * (N - 1));\n \/\/ Set the number of constraints\n size_t n_constraints = 6 * N;\n\n \/\/ Initial value of the independent variables.\n \/\/ SHOULD BE 0 besides initial state.\n Dvector vars(n_vars);\n for (int i = 0; i < n_vars; i++) {\n vars[i] = 0;\n }\n \/\/ Set the initial variable values\n vars[x_start] = x;\n vars[y_start] = y;\n vars[psi_start] = psi;\n vars[v_start] = v;\n vars[cte_start] = cte;\n vars[epsi_start] = epsi;\n\n Dvector vars_lowerbound(n_vars);\n Dvector vars_upperbound(n_vars);\n \/\/ Set all non-actuators upper and lowerlimits\n \/\/ to the max negative and positive values.\n for (int i = 0; i < delta_start; i++) {\n vars_lowerbound[i] = -1.0e19;\n vars_upperbound[i] = 1.0e19;\n }\n\n \/\/ The upper and lower limits of delta are set to -25 and 25\n \/\/ degrees (values in radians).\n for (int i = delta_start; i < a_start; i++) {\n vars_lowerbound[i] = -0.436332;\n vars_upperbound[i] = 0.436332;\n }\n\n \/\/ Acceleration\/decceleration upper and lower limits.\n for (int i = a_start; i < n_vars; i++) {\n vars_lowerbound[i] = -1.0;\n vars_upperbound[i] = 1.0;\n }\n\n \/\/ Lower and upper limits for the constraints\n \/\/ Should be 0 besides initial state.\n Dvector constraints_lowerbound(n_constraints);\n Dvector constraints_upperbound(n_constraints);\n for (int i = 0; i < n_constraints; i++) {\n constraints_lowerbound[i] = 0;\n constraints_upperbound[i] = 0;\n }\n constraints_lowerbound[x_start] = x;\n constraints_lowerbound[y_start] = y;\n constraints_lowerbound[psi_start] = psi;\n constraints_lowerbound[v_start] = v;\n constraints_lowerbound[cte_start] = cte;\n constraints_lowerbound[epsi_start] = epsi;\n\n constraints_upperbound[x_start] = x;\n constraints_upperbound[y_start] = y;\n constraints_upperbound[psi_start] = psi;\n constraints_upperbound[v_start] = v;\n constraints_upperbound[cte_start] = cte;\n constraints_upperbound[epsi_start] = epsi;\n\n \/\/ object that computes objective and constraints\n FG_eval fg_eval(coeffs);\n\n \/\/\n \/\/ NOTE: You don't have to worry about these options\n \/\/\n \/\/ options for IPOPT solver\n std::string options;\n \/\/ Uncomment this if you'd like more print information\n options += \"Integer print_level 0\\n\";\n \/\/ NOTE: Setting sparse to true allows the solver to take advantage\n \/\/ of sparse routines, this makes the computation MUCH FASTER. If you\n \/\/ can uncomment 1 of these and see if it makes a difference or not but\n \/\/ if you uncomment both the computation time should go up in orders of\n \/\/ magnitude.\n options += \"Sparse true forward\\n\";\n options += \"Sparse true reverse\\n\";\n \/\/ NOTE: Currently the solver has a maximum time limit of 0.5 seconds.\n \/\/ Change this as you see fit.\n options += \"Numeric max_cpu_time 0.5\\n\";\n\n \/\/ place to return solution\n CppAD::ipopt::solve_result<Dvector> solution;\n\n \/\/ solve the problem\n CppAD::ipopt::solve<Dvector, FG_eval>(\n options, vars, vars_lowerbound, vars_upperbound, constraints_lowerbound,\n constraints_upperbound, fg_eval, solution);\n\n \/\/ Cost\n auto cost = solution.obj_value;\n std::cout << \"Cost \" << cost << std::endl;\n\n \/\/ We'll return the following values:\n \/\/ 0 -> the immediate steering value (in Radians)\n \/\/ 1 -> the immediate throttle value\n \/\/ 2 -> amount of coordinate values (N)\n \/\/ 3 ... 3+N -> X coordinate values\n \/\/ 3+N+1 ... 3+N+1+N -> Y coordinate values\n vector<double> result;\n result.push_back(solution.x[delta_start]);\n result.push_back(solution.x[a_start]);\n result.push_back(N);\n for (int i = 0; i < N; ++i)\n {\n result.push_back(solution.x[x_start + i]);\n }\n for (int i = 0; i < N; ++i)\n {\n result.push_back(solution.x[y_start + i]);\n }\n return result;\n}\n<|endoftext|>"} {"text":"<commit_before>#include \"Halide.h\"\n#include <cstdio>\n#include <algorithm>\n#include \"benchmark.h\"\n\nusing namespace Halide;\n\n\/\/ 32-bit windows defines powf as a macro, which won't work for us.\n#ifdef _WIN32\nextern \"C\" __declspec(dllexport) float pow_ref(float x, float y) {\n return pow(x, y);\n}\n#else\nextern \"C\" float pow_ref(float x, float y) {\n return powf(x, y);\n}\n#endif\n\nHalideExtern_2(float, pow_ref, float, float);\n\nint main(int argc, char **argv) {\n Func f, g, h;\n Var x, y;\n\n f(x, y) = pow_ref((x+1)\/512.0f, (y+1)\/512.0f);\n g(x, y) = pow((x+1)\/512.0f, (y+1)\/512.0f);\n h(x, y) = fast_pow((x+1)\/512.0f, (y+1)\/512.0f);\n f.vectorize(x, 8);\n g.vectorize(x, 8);\n h.vectorize(x, 8);\n\n Image<float> correct_result(2048, 768);\n Image<float> fast_result(2048, 768);\n Image<float> faster_result(2048, 768);\n\n f.realize(correct_result);\n g.realize(fast_result);\n h.realize(faster_result);\n\n const int trials = 5;\n const int iterations = 5;\n\n \/\/ All profiling runs are done into the same buffer, to avoid\n \/\/ cache weirdness.\n Image<float> timing_scratch(400, 400);\n double t1 = 1e3 * benchmark(trials, iterations, [&]() { f.realize(timing_scratch); });\n double t2 = 1e3 * benchmark(trials, iterations, [&]() { g.realize(timing_scratch); });\n double t3 = 1e3 * benchmark(trials, iterations, [&]() { h.realize(timing_scratch); });\n\n RDom r(correct_result);\n Func fast_error, faster_error;\n Expr fast_delta = correct_result(r.x, r.y) - fast_result(r.x, r.y);\n Expr faster_delta = correct_result(r.x, r.y) - faster_result(r.x, r.y);\n fast_error() += cast<double>(fast_delta * fast_delta);\n faster_error() += cast<double>(faster_delta * faster_delta);\n\n Image<double> fast_err = fast_error.realize();\n Image<double> faster_err = faster_error.realize();\n\n int timing_N = timing_scratch.width() * timing_scratch.height();\n int correctness_N = fast_result.width() * fast_result.height();\n fast_err(0) = sqrt(fast_err(0)\/correctness_N);\n faster_err(0) = sqrt(faster_err(0)\/correctness_N);\n\n printf(\"powf: %f ns per pixel\\n\"\n \"Halide's pow: %f ns per pixel (rms error = %0.10f)\\n\"\n \"Halide's fast_pow: %f ns per pixel (rms error = %0.10f)\\n\",\n 1000000*t1 \/ timing_N,\n 1000000*t2 \/ timing_N, fast_err(0),\n 1000000*t3 \/ timing_N, faster_err(0));\n\n if (fast_err(0) > 0.000001) {\n printf(\"Error for pow too large\\n\");\n return -1;\n }\n\n if (faster_err(0) > 0.0001) {\n printf(\"Error for fast_pow too large\\n\");\n return -1;\n }\n\n if (t1 < t2) {\n printf(\"powf is faster than Halide's pow\\n\");\n return -1;\n }\n\n if (t2 < t3) {\n printf(\"pow is faster than fast_pow\\n\");\n return -1;\n }\n\n printf(\"Success!\\n\");\n\n return 0;\n}\n<commit_msg>Our pows are so fast the test was bandwidth limited<commit_after>#include \"Halide.h\"\n#include <cstdio>\n#include <algorithm>\n#include \"benchmark.h\"\n\nusing namespace Halide;\n\n\/\/ 32-bit windows defines powf as a macro, which won't work for us.\n#ifdef _WIN32\nextern \"C\" __declspec(dllexport) float pow_ref(float x, float y) {\n return pow(x, y);\n}\n#else\nextern \"C\" float pow_ref(float x, float y) {\n return powf(x, y);\n}\n#endif\n\nHalideExtern_2(float, pow_ref, float, float);\n\nint main(int argc, char **argv) {\n Func f, g, h;\n Var x, y;\n\n Param<int> pows_per_pixel;\n\n RDom s(0, pows_per_pixel);\n f(x, y) = sum(pow_ref((x+1)\/512.0f, (y+1+s)\/512.0f));\n g(x, y) = sum(pow((x+1)\/512.0f, (y+1+s)\/512.0f));\n h(x, y) = sum(fast_pow((x+1)\/512.0f, (y+1+s)\/512.0f));\n f.vectorize(x, 8);\n g.vectorize(x, 8);\n h.vectorize(x, 8);\n\n Image<float> correct_result(2048, 768);\n Image<float> fast_result(2048, 768);\n Image<float> faster_result(2048, 768);\n\n pows_per_pixel.set(1);\n\n f.realize(correct_result);\n g.realize(fast_result);\n h.realize(faster_result);\n\n const int trials = 5;\n const int iterations = 5;\n pows_per_pixel.set(10);\n\n \/\/ All profiling runs are done into the same buffer, to avoid\n \/\/ cache weirdness.\n Image<float> timing_scratch(256, 256);\n double t1 = 1e3 * benchmark(trials, iterations, [&]() { f.realize(timing_scratch); });\n double t2 = 1e3 * benchmark(trials, iterations, [&]() { g.realize(timing_scratch); });\n double t3 = 1e3 * benchmark(trials, iterations, [&]() { h.realize(timing_scratch); });\n\n RDom r(correct_result);\n Func fast_error, faster_error;\n Expr fast_delta = correct_result(r.x, r.y) - fast_result(r.x, r.y);\n Expr faster_delta = correct_result(r.x, r.y) - faster_result(r.x, r.y);\n fast_error() += cast<double>(fast_delta * fast_delta);\n faster_error() += cast<double>(faster_delta * faster_delta);\n\n Image<double> fast_err = fast_error.realize();\n Image<double> faster_err = faster_error.realize();\n\n int timing_N = timing_scratch.width() * timing_scratch.height() * 10;\n int correctness_N = fast_result.width() * fast_result.height();\n fast_err(0) = sqrt(fast_err(0)\/correctness_N);\n faster_err(0) = sqrt(faster_err(0)\/correctness_N);\n\n printf(\"powf: %f ns per pixel\\n\"\n \"Halide's pow: %f ns per pixel (rms error = %0.10f)\\n\"\n \"Halide's fast_pow: %f ns per pixel (rms error = %0.10f)\\n\",\n 1000000*t1 \/ timing_N,\n 1000000*t2 \/ timing_N, fast_err(0),\n 1000000*t3 \/ timing_N, faster_err(0));\n\n if (fast_err(0) > 0.000001) {\n printf(\"Error for pow too large\\n\");\n return -1;\n }\n\n if (faster_err(0) > 0.0001) {\n printf(\"Error for fast_pow too large\\n\");\n return -1;\n }\n\n if (t1 < t2) {\n printf(\"powf is faster than Halide's pow\\n\");\n return -1;\n }\n\n if (t2 < t3) {\n printf(\"pow is faster than fast_pow\\n\");\n return -1;\n }\n\n printf(\"Success!\\n\");\n\n return 0;\n}\n<|endoftext|>"} {"text":"<commit_before>#include <celero\/Celero.h>\n\n#include <annis\/query.h>\n#include <annis\/annosearch\/exactannokeysearch.h>\n#include <annis\/annosearch\/exactannovaluesearch.h>\n#include <annis\/annosearch\/regexannosearch.h>\n\n#include <annis\/operators\/pointing.h>\n#include <annis\/operators\/precedence.h>\n\nusing namespace annis;\n\nCELERO_MAIN\n\nclass GUMFixture : public celero::TestFixture\n{\n public:\n GUMFixture()\n {\n }\n\n \/*\n virtual std::vector<std::pair<int64_t, uint64_t>> getExperimentValues() const override\n {\n std::vector<std::pair<int64_t, uint64_t>> problemSpace;\n problemSpace.push_back(std::make_pair(1, uint64_t(0)));\n\n return problemSpace;\n }\n *\/\n\n \/\/\/ Before each run, build a vector of random integers.\n virtual void setUp(int64_t experimentValue)\n {\n char* testDataEnv = std::getenv(\"ANNIS4_TEST_DATA\");\n std::string dataDir(\"data\");\n if (testDataEnv != NULL) {\n dataDir = testDataEnv;\n }\n db.load(dataDir + \"\/GUM\", true);\n }\n\n DB db;\n\n std::shared_ptr<Query> query_PosDepPos(QueryConfig config)\n {\n std::shared_ptr<Query> query = std::make_shared<Query>(db, config);\n\n query->addNode(std::make_shared<ExactAnnoKeySearch>(db, \"pos\"));\n query->addNode(std::make_shared<ExactAnnoKeySearch>(db, \"pos\"));\n\n Annotation edgeAnno = {db.strings.add(\"func\"), 0, db.strings.add(\"dep\")};\n query->addOperator(std::make_shared<Pointing>(db.edges, db.strings, \"\", \"dep\", edgeAnno), 0, 1);\n return query;\n }\n\n std::shared_ptr<Query> query_UsedTo(QueryConfig config)\n {\n std::shared_ptr<Query> query = std::make_shared<Query>(db, config);\n\n query->addNode(std::make_shared<RegexAnnoSearch>(db, \"pos\", \"NN.*\"));\n query->addNode(std::make_shared<ExactAnnoValueSearch>(db, \"annis4_internal\", \"tok\", \"used\"));\n query->addNode(std::make_shared<ExactAnnoValueSearch>(db, \"annis4_internal\", \"tok\", \"to\"));\n\n query->addOperator(std::make_shared<Precedence>(db, db.edges), 0, 1);\n query->addOperator(std::make_shared<Precedence>(db, db.edges), 1, 2);\n\n return query;\n }\n\n};\n\n\nBASELINE_F(PosDepPos, N1, GUMFixture, 10, 100)\n{\n QueryConfig config;\n config.numOfParallelTasks = 1;\n std::shared_ptr<Query> query = query_PosDepPos(config);\n int counter=0;\n while(query->next()) {\n counter++;\n }\n}\n\nBENCHMARK_F(PosDepPos, N2, GUMFixture, 10, 100)\n{\n QueryConfig config;\n config.numOfParallelTasks = 2;\n std::shared_ptr<Query> query = query_PosDepPos(config);\n int counter=0;\n while(query->next()) {\n counter++;\n }\n}\n\nBENCHMARK_F(PosDepPos, N3, GUMFixture, 10, 100)\n{\n QueryConfig config;\n config.numOfParallelTasks = 3;\n std::shared_ptr<Query> query = query_PosDepPos(config);\n int counter=0;\n while(query->next()) {\n counter++;\n }\n}\n\nBENCHMARK_F(PosDepPos, N4, GUMFixture, 10, 100)\n{\n QueryConfig config;\n config.numOfParallelTasks = 4;\n std::shared_ptr<Query> query = query_PosDepPos(config);\n int counter=0;\n while(query->next()) {\n counter++;\n }\n}\n\nBENCHMARK_F(PosDepPos, N5, GUMFixture, 10, 100)\n{\n QueryConfig config;\n config.numOfParallelTasks = 5;\n std::shared_ptr<Query> query = query_PosDepPos(config);\n int counter=0;\n while(query->next()) {\n counter++;\n }\n}\n\nBENCHMARK_F(PosDepPos, N6, GUMFixture, 10, 100)\n{\n QueryConfig config;\n config.numOfParallelTasks = 6;\n std::shared_ptr<Query> query = query_PosDepPos(config);\n int counter=0;\n while(query->next()) {\n counter++;\n }\n}\n\nBENCHMARK_F(PosDepPos, N7, GUMFixture, 10, 100)\n{\n QueryConfig config;\n config.numOfParallelTasks = 7;\n std::shared_ptr<Query> query = query_PosDepPos(config);\n int counter=0;\n while(query->next()) {\n counter++;\n }\n}\n\nBENCHMARK_F(PosDepPos, N8, GUMFixture, 10, 100)\n{\n QueryConfig config;\n config.numOfParallelTasks = 8;\n std::shared_ptr<Query> query = query_PosDepPos(config);\n int counter=0;\n while(query->next()) {\n counter++;\n }\n}\n\nBASELINE_F(UsedTo, N1, GUMFixture, 10, 100)\n{\n QueryConfig config;\n config.numOfParallelTasks = 1;\n std::shared_ptr<Query> query = query_UsedTo(config);\n int counter=0;\n while(query->next()) {\n counter++;\n }\n}\n\nBENCHMARK_F(UsedTo, N2, GUMFixture, 10, 100)\n{\n QueryConfig config;\n config.numOfParallelTasks = 2;\n std::shared_ptr<Query> query = query_UsedTo(config);\n int counter=0;\n while(query->next()) {\n counter++;\n }\n}\n\nBENCHMARK_F(UsedTo, N3, GUMFixture, 10, 100)\n{\n QueryConfig config;\n config.numOfParallelTasks = 3;\n std::shared_ptr<Query> query = query_UsedTo(config);\n int counter=0;\n while(query->next()) {\n counter++;\n }\n}\n\nBENCHMARK_F(UsedTo, N4, GUMFixture, 10, 100)\n{\n QueryConfig config;\n config.numOfParallelTasks = 4;\n std::shared_ptr<Query> query = query_UsedTo(config);\n int counter=0;\n while(query->next()) {\n counter++;\n }\n}\n\nBENCHMARK_F(UsedTo, N5, GUMFixture, 10, 100)\n{\n QueryConfig config;\n config.numOfParallelTasks = 5;\n std::shared_ptr<Query> query = query_UsedTo(config);\n int counter=0;\n while(query->next()) {\n counter++;\n }\n}\n\nBENCHMARK_F(UsedTo, N6, GUMFixture, 10, 100)\n{\n QueryConfig config;\n config.numOfParallelTasks = 6;\n std::shared_ptr<Query> query = query_UsedTo(config);\n int counter=0;\n while(query->next()) {\n counter++;\n }\n}\n\nBENCHMARK_F(UsedTo, N7, GUMFixture, 10, 100)\n{\n QueryConfig config;\n config.numOfParallelTasks = 7;\n std::shared_ptr<Query> query = query_UsedTo(config);\n int counter=0;\n while(query->next()) {\n counter++;\n }\n}\n\nBENCHMARK_F(UsedTo, N8, GUMFixture, 10, 100)\n{\n QueryConfig config;\n config.numOfParallelTasks = 8;\n std::shared_ptr<Query> query = query_UsedTo(config);\n int counter=0;\n while(query->next()) {\n counter++;\n }\n}\n\nBASELINE_F(CreateQuery, N1, GUMFixture, 10, 100)\n{\n QueryConfig config;\n config.numOfParallelTasks = 1;\n std::shared_ptr<Query> query = query_UsedTo(config);\n query->getBestPlan();\n}\n\nBENCHMARK_F(CreateQuery, N2, GUMFixture, 10, 100)\n{\n QueryConfig config;\n config.numOfParallelTasks = 2;\n std::shared_ptr<Query> query = query_UsedTo(config);\n query->getBestPlan();\n}\n\nBENCHMARK_F(CreateQuery, N3, GUMFixture, 10, 100)\n{\n QueryConfig config;\n config.numOfParallelTasks = 3;\n std::shared_ptr<Query> query = query_UsedTo(config);\n query->getBestPlan();\n}\n\nBENCHMARK_F(CreateQuery, N4, GUMFixture, 10, 100)\n{\n QueryConfig config;\n config.numOfParallelTasks = 4;\n std::shared_ptr<Query> query = query_UsedTo(config);\n query->getBestPlan();\n}\n\nBENCHMARK_F(CreateQuery, N5, GUMFixture, 10, 100)\n{\n QueryConfig config;\n config.numOfParallelTasks = 5;\n std::shared_ptr<Query> query = query_UsedTo(config);\n query->getBestPlan();\n}\n\nBENCHMARK_F(CreateQuery, N6, GUMFixture, 10, 100)\n{\n QueryConfig config;\n config.numOfParallelTasks = 6;\n std::shared_ptr<Query> query = query_UsedTo(config);\n query->getBestPlan();\n}\n\nBENCHMARK_F(CreateQuery, N7, GUMFixture, 10, 100)\n{\n QueryConfig config;\n config.numOfParallelTasks = 7;\n std::shared_ptr<Query> query = query_UsedTo(config);\n query->getBestPlan();\n}\n\nBENCHMARK_F(CreateQueryCreateQuery, N8, GUMFixture, 10, 100)\n{\n QueryConfig config;\n config.numOfParallelTasks = 8;\n std::shared_ptr<Query> query = query_UsedTo(config);\n query->getBestPlan();\n}\n\nBASELINE(CreateThreadPool, N1, 10, 1000)\n{\n ThreadPool t(1);\n}\n\nBENCHMARK(CreateThreadPool, N2, 10, 1000)\n{\n ThreadPool t(2);\n}\n\nBENCHMARK(CreateThreadPool, N3, 10, 1000)\n{\n ThreadPool t(3);\n}\n\nBENCHMARK(CreateThreadPool, N4, 10, 1000)\n{\n ThreadPool t(4);\n}\n\nBENCHMARK(CreateThreadPool, N5, 10, 1000)\n{\n ThreadPool t(5);\n}\n\nBENCHMARK(CreateThreadPool, N6, 10, 1000)\n{\n ThreadPool t(6);\n}\n\nBENCHMARK(CreateThreadPool, N7, 10, 1000)\n{\n ThreadPool t(7);\n}\n\nBENCHMARK(CreateThreadPool, N8, 10, 1000)\n{\n ThreadPool t(8);\n}\n\n<commit_msg>Fix benchmark group name.<commit_after>#include <celero\/Celero.h>\n\n#include <annis\/query.h>\n#include <annis\/annosearch\/exactannokeysearch.h>\n#include <annis\/annosearch\/exactannovaluesearch.h>\n#include <annis\/annosearch\/regexannosearch.h>\n\n#include <annis\/operators\/pointing.h>\n#include <annis\/operators\/precedence.h>\n\nusing namespace annis;\n\nCELERO_MAIN\n\nclass GUMFixture : public celero::TestFixture\n{\n public:\n GUMFixture()\n {\n }\n\n \/*\n virtual std::vector<std::pair<int64_t, uint64_t>> getExperimentValues() const override\n {\n std::vector<std::pair<int64_t, uint64_t>> problemSpace;\n problemSpace.push_back(std::make_pair(1, uint64_t(0)));\n\n return problemSpace;\n }\n *\/\n\n \/\/\/ Before each run, build a vector of random integers.\n virtual void setUp(int64_t experimentValue)\n {\n char* testDataEnv = std::getenv(\"ANNIS4_TEST_DATA\");\n std::string dataDir(\"data\");\n if (testDataEnv != NULL) {\n dataDir = testDataEnv;\n }\n db.load(dataDir + \"\/GUM\", true);\n }\n\n DB db;\n\n std::shared_ptr<Query> query_PosDepPos(QueryConfig config)\n {\n std::shared_ptr<Query> query = std::make_shared<Query>(db, config);\n\n query->addNode(std::make_shared<ExactAnnoKeySearch>(db, \"pos\"));\n query->addNode(std::make_shared<ExactAnnoKeySearch>(db, \"pos\"));\n\n Annotation edgeAnno = {db.strings.add(\"func\"), 0, db.strings.add(\"dep\")};\n query->addOperator(std::make_shared<Pointing>(db.edges, db.strings, \"\", \"dep\", edgeAnno), 0, 1);\n return query;\n }\n\n std::shared_ptr<Query> query_UsedTo(QueryConfig config)\n {\n std::shared_ptr<Query> query = std::make_shared<Query>(db, config);\n\n query->addNode(std::make_shared<RegexAnnoSearch>(db, \"pos\", \"NN.*\"));\n query->addNode(std::make_shared<ExactAnnoValueSearch>(db, \"annis4_internal\", \"tok\", \"used\"));\n query->addNode(std::make_shared<ExactAnnoValueSearch>(db, \"annis4_internal\", \"tok\", \"to\"));\n\n query->addOperator(std::make_shared<Precedence>(db, db.edges), 0, 1);\n query->addOperator(std::make_shared<Precedence>(db, db.edges), 1, 2);\n\n return query;\n }\n\n};\n\n\nBASELINE_F(PosDepPos, N1, GUMFixture, 10, 100)\n{\n QueryConfig config;\n config.numOfParallelTasks = 1;\n std::shared_ptr<Query> query = query_PosDepPos(config);\n int counter=0;\n while(query->next()) {\n counter++;\n }\n}\n\nBENCHMARK_F(PosDepPos, N2, GUMFixture, 10, 100)\n{\n QueryConfig config;\n config.numOfParallelTasks = 2;\n std::shared_ptr<Query> query = query_PosDepPos(config);\n int counter=0;\n while(query->next()) {\n counter++;\n }\n}\n\nBENCHMARK_F(PosDepPos, N3, GUMFixture, 10, 100)\n{\n QueryConfig config;\n config.numOfParallelTasks = 3;\n std::shared_ptr<Query> query = query_PosDepPos(config);\n int counter=0;\n while(query->next()) {\n counter++;\n }\n}\n\nBENCHMARK_F(PosDepPos, N4, GUMFixture, 10, 100)\n{\n QueryConfig config;\n config.numOfParallelTasks = 4;\n std::shared_ptr<Query> query = query_PosDepPos(config);\n int counter=0;\n while(query->next()) {\n counter++;\n }\n}\n\nBENCHMARK_F(PosDepPos, N5, GUMFixture, 10, 100)\n{\n QueryConfig config;\n config.numOfParallelTasks = 5;\n std::shared_ptr<Query> query = query_PosDepPos(config);\n int counter=0;\n while(query->next()) {\n counter++;\n }\n}\n\nBENCHMARK_F(PosDepPos, N6, GUMFixture, 10, 100)\n{\n QueryConfig config;\n config.numOfParallelTasks = 6;\n std::shared_ptr<Query> query = query_PosDepPos(config);\n int counter=0;\n while(query->next()) {\n counter++;\n }\n}\n\nBENCHMARK_F(PosDepPos, N7, GUMFixture, 10, 100)\n{\n QueryConfig config;\n config.numOfParallelTasks = 7;\n std::shared_ptr<Query> query = query_PosDepPos(config);\n int counter=0;\n while(query->next()) {\n counter++;\n }\n}\n\nBENCHMARK_F(PosDepPos, N8, GUMFixture, 10, 100)\n{\n QueryConfig config;\n config.numOfParallelTasks = 8;\n std::shared_ptr<Query> query = query_PosDepPos(config);\n int counter=0;\n while(query->next()) {\n counter++;\n }\n}\n\nBASELINE_F(UsedTo, N1, GUMFixture, 10, 100)\n{\n QueryConfig config;\n config.numOfParallelTasks = 1;\n std::shared_ptr<Query> query = query_UsedTo(config);\n int counter=0;\n while(query->next()) {\n counter++;\n }\n}\n\nBENCHMARK_F(UsedTo, N2, GUMFixture, 10, 100)\n{\n QueryConfig config;\n config.numOfParallelTasks = 2;\n std::shared_ptr<Query> query = query_UsedTo(config);\n int counter=0;\n while(query->next()) {\n counter++;\n }\n}\n\nBENCHMARK_F(UsedTo, N3, GUMFixture, 10, 100)\n{\n QueryConfig config;\n config.numOfParallelTasks = 3;\n std::shared_ptr<Query> query = query_UsedTo(config);\n int counter=0;\n while(query->next()) {\n counter++;\n }\n}\n\nBENCHMARK_F(UsedTo, N4, GUMFixture, 10, 100)\n{\n QueryConfig config;\n config.numOfParallelTasks = 4;\n std::shared_ptr<Query> query = query_UsedTo(config);\n int counter=0;\n while(query->next()) {\n counter++;\n }\n}\n\nBENCHMARK_F(UsedTo, N5, GUMFixture, 10, 100)\n{\n QueryConfig config;\n config.numOfParallelTasks = 5;\n std::shared_ptr<Query> query = query_UsedTo(config);\n int counter=0;\n while(query->next()) {\n counter++;\n }\n}\n\nBENCHMARK_F(UsedTo, N6, GUMFixture, 10, 100)\n{\n QueryConfig config;\n config.numOfParallelTasks = 6;\n std::shared_ptr<Query> query = query_UsedTo(config);\n int counter=0;\n while(query->next()) {\n counter++;\n }\n}\n\nBENCHMARK_F(UsedTo, N7, GUMFixture, 10, 100)\n{\n QueryConfig config;\n config.numOfParallelTasks = 7;\n std::shared_ptr<Query> query = query_UsedTo(config);\n int counter=0;\n while(query->next()) {\n counter++;\n }\n}\n\nBENCHMARK_F(UsedTo, N8, GUMFixture, 10, 100)\n{\n QueryConfig config;\n config.numOfParallelTasks = 8;\n std::shared_ptr<Query> query = query_UsedTo(config);\n int counter=0;\n while(query->next()) {\n counter++;\n }\n}\n\nBASELINE_F(CreateQuery, N1, GUMFixture, 10, 100)\n{\n QueryConfig config;\n config.numOfParallelTasks = 1;\n std::shared_ptr<Query> query = query_UsedTo(config);\n query->getBestPlan();\n}\n\nBENCHMARK_F(CreateQuery, N2, GUMFixture, 10, 100)\n{\n QueryConfig config;\n config.numOfParallelTasks = 2;\n std::shared_ptr<Query> query = query_UsedTo(config);\n query->getBestPlan();\n}\n\nBENCHMARK_F(CreateQuery, N3, GUMFixture, 10, 100)\n{\n QueryConfig config;\n config.numOfParallelTasks = 3;\n std::shared_ptr<Query> query = query_UsedTo(config);\n query->getBestPlan();\n}\n\nBENCHMARK_F(CreateQuery, N4, GUMFixture, 10, 100)\n{\n QueryConfig config;\n config.numOfParallelTasks = 4;\n std::shared_ptr<Query> query = query_UsedTo(config);\n query->getBestPlan();\n}\n\nBENCHMARK_F(CreateQuery, N5, GUMFixture, 10, 100)\n{\n QueryConfig config;\n config.numOfParallelTasks = 5;\n std::shared_ptr<Query> query = query_UsedTo(config);\n query->getBestPlan();\n}\n\nBENCHMARK_F(CreateQuery, N6, GUMFixture, 10, 100)\n{\n QueryConfig config;\n config.numOfParallelTasks = 6;\n std::shared_ptr<Query> query = query_UsedTo(config);\n query->getBestPlan();\n}\n\nBENCHMARK_F(CreateQuery, N7, GUMFixture, 10, 100)\n{\n QueryConfig config;\n config.numOfParallelTasks = 7;\n std::shared_ptr<Query> query = query_UsedTo(config);\n query->getBestPlan();\n}\n\nBENCHMARK_F(CreateQuery, N8, GUMFixture, 10, 100)\n{\n QueryConfig config;\n config.numOfParallelTasks = 8;\n std::shared_ptr<Query> query = query_UsedTo(config);\n query->getBestPlan();\n}\n\nBASELINE(CreateThreadPool, N1, 10, 1000)\n{\n ThreadPool t(1);\n}\n\nBENCHMARK(CreateThreadPool, N2, 10, 1000)\n{\n ThreadPool t(2);\n}\n\nBENCHMARK(CreateThreadPool, N3, 10, 1000)\n{\n ThreadPool t(3);\n}\n\nBENCHMARK(CreateThreadPool, N4, 10, 1000)\n{\n ThreadPool t(4);\n}\n\nBENCHMARK(CreateThreadPool, N5, 10, 1000)\n{\n ThreadPool t(5);\n}\n\nBENCHMARK(CreateThreadPool, N6, 10, 1000)\n{\n ThreadPool t(6);\n}\n\nBENCHMARK(CreateThreadPool, N7, 10, 1000)\n{\n ThreadPool t(7);\n}\n\nBENCHMARK(CreateThreadPool, N8, 10, 1000)\n{\n ThreadPool t(8);\n}\n\n<|endoftext|>"} {"text":"<commit_before>\/*ckwg +5\n * Copyright 2011 by Kitware, Inc. All Rights Reserved. Please refer to\n * KITWARE_LICENSE.TXT for licensing information, or contact General Counsel,\n * Kitware, Inc., 28 Corporate Drive, Clifton Park, NY 12065.\n *\/\n\n#include <vistk\/pipeline\/config.h>\n\n#include <boost\/python.hpp>\n#include <boost\/python\/suite\/indexing\/vector_indexing_suite.hpp>\n\n\/**\n * \\file config.cxx\n *\n * \\brief Python bindings for \\link vistk::config\\endlink.\n *\/\n\nusing namespace boost::python;\n\nstatic vistk::config_t empty_config();\nstatic vistk::config_t named_empty_config(vistk::config::key_t const& name);\nstatic vistk::config::value_t get_value(vistk::config_t self, vistk::config::key_t const& key);\nstatic vistk::config::value_t get_value_with_default(vistk::config_t self, vistk::config::key_t const& key, vistk::config::value_t const& def);\nstatic void translator(vistk::configuration_exception const& e);\n\nBOOST_PYTHON_MODULE(config)\n{\n register_exception_translator<\n vistk::configuration_exception>(translator);\n\n def(\"empty_config\", &vistk::config::empty_config\n , (arg(\"name\") = vistk::config::key_t())\n , \"Returns an empty configuration.\");\n\n class_<vistk::config::key_t>(\"ConfigKey\"\n , \"A key for a configuration.\");\n class_<vistk::config::keys_t>(\"ConfigKeys\"\n , \"A collection of keys for a configuration.\")\n .def(vector_indexing_suite<vistk::config::keys_t>())\n ;\n class_<vistk::config::value_t>(\"ConfigValue\"\n , \"A value in the configuration.\");\n\n class_<vistk::config, vistk::config_t, boost::noncopyable>(\"Config\", no_init)\n .def(\"subblock\", &vistk::config::subblock\n , (arg(\"name\"))\n , \"Returns a subblock from the configuration.\")\n .def(\"subblock_view\", &vistk::config::subblock_view\n , (arg(\"name\"))\n , \"Returns a linked subblock from the configuration.\")\n .def(\"get_value\", &get_value\n , (arg(\"key\"))\n , \"Retrieve a value from the configuration.\")\n .def(\"get_value\", &get_value_with_default\n , (arg(\"key\"), arg(\"default\"))\n , \"Retrieve a value from the configuration, using a default in case of failure.\")\n .def(\"set_value\", &vistk::config::set_value\n , (arg(\"key\"), arg(\"value\"))\n , \"Set a value in the configuration.\")\n .def(\"unset_value\", &vistk::config::unset_value\n , (arg(\"key\"))\n , \"Unset a value in the configuration.\")\n .def(\"is_read_only\", &vistk::config::is_read_only\n , (arg(\"key\"))\n , \"Check if a key is marked as read only.\")\n .def(\"mark_read_only\", &vistk::config::mark_read_only\n , (arg(\"key\"))\n , \"Mark a key as read only.\")\n .def(\"merge_config\", &vistk::config::merge_config\n , (arg(\"config\"))\n , \"Merge another configuration block into the current one.\")\n .def(\"available_values\", &vistk::config::available_values\n , \"Retrieves the list of available values in the configuration.\")\n .def(\"has_value\", &vistk::config::has_value\n , (arg(\"key\"))\n , \"Returns True if the key is set.\")\n .def_readonly(\"block_sep\", &vistk::config::block_sep\n , \"The string which separates block names from key names.\")\n .def_readonly(\"global_value\", &vistk::config::global_value\n , \"A special key which is automatically inherited on subblock requests.\")\n ;\n}\n\nvistk::config_t\nempty_config()\n{\n return vistk::config::empty_config();\n}\n\nvistk::config_t\nnamed_empty_config(vistk::config::key_t const& name)\n{\n return vistk::config::empty_config(name);\n}\n\nvistk::config::value_t\nget_value(vistk::config_t self, vistk::config::key_t const& key)\n{\n return self->get_value<vistk::config::value_t>(key);\n}\n\nvistk::config::value_t\nget_value_with_default(vistk::config_t self, vistk::config::key_t const& key, vistk::config::value_t const& def)\n{\n return self->get_value<vistk::config::value_t>(key, def);\n}\n\nvoid\ntranslator(vistk::configuration_exception const& e)\n{\n PyErr_SetString(PyExc_RuntimeError, e.what());\n}\n<commit_msg>Remove some unused code<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 <vistk\/pipeline\/config.h>\n\n#include <boost\/python.hpp>\n#include <boost\/python\/suite\/indexing\/vector_indexing_suite.hpp>\n\n\/**\n * \\file config.cxx\n *\n * \\brief Python bindings for \\link vistk::config\\endlink.\n *\/\n\nusing namespace boost::python;\n\nstatic vistk::config::value_t get_value(vistk::config_t self, vistk::config::key_t const& key);\nstatic vistk::config::value_t get_value_with_default(vistk::config_t self, vistk::config::key_t const& key, vistk::config::value_t const& def);\nstatic void translator(vistk::configuration_exception const& e);\n\nBOOST_PYTHON_MODULE(config)\n{\n register_exception_translator<\n vistk::configuration_exception>(translator);\n\n def(\"empty_config\", &vistk::config::empty_config\n , (arg(\"name\") = vistk::config::key_t())\n , \"Returns an empty configuration.\");\n\n class_<vistk::config::key_t>(\"ConfigKey\"\n , \"A key for a configuration.\");\n class_<vistk::config::keys_t>(\"ConfigKeys\"\n , \"A collection of keys for a configuration.\")\n .def(vector_indexing_suite<vistk::config::keys_t>())\n ;\n class_<vistk::config::value_t>(\"ConfigValue\"\n , \"A value in the configuration.\");\n\n class_<vistk::config, vistk::config_t, boost::noncopyable>(\"Config\", no_init)\n .def(\"subblock\", &vistk::config::subblock\n , (arg(\"name\"))\n , \"Returns a subblock from the configuration.\")\n .def(\"subblock_view\", &vistk::config::subblock_view\n , (arg(\"name\"))\n , \"Returns a linked subblock from the configuration.\")\n .def(\"get_value\", &get_value\n , (arg(\"key\"))\n , \"Retrieve a value from the configuration.\")\n .def(\"get_value\", &get_value_with_default\n , (arg(\"key\"), arg(\"default\"))\n , \"Retrieve a value from the configuration, using a default in case of failure.\")\n .def(\"set_value\", &vistk::config::set_value\n , (arg(\"key\"), arg(\"value\"))\n , \"Set a value in the configuration.\")\n .def(\"unset_value\", &vistk::config::unset_value\n , (arg(\"key\"))\n , \"Unset a value in the configuration.\")\n .def(\"is_read_only\", &vistk::config::is_read_only\n , (arg(\"key\"))\n , \"Check if a key is marked as read only.\")\n .def(\"mark_read_only\", &vistk::config::mark_read_only\n , (arg(\"key\"))\n , \"Mark a key as read only.\")\n .def(\"merge_config\", &vistk::config::merge_config\n , (arg(\"config\"))\n , \"Merge another configuration block into the current one.\")\n .def(\"available_values\", &vistk::config::available_values\n , \"Retrieves the list of available values in the configuration.\")\n .def(\"has_value\", &vistk::config::has_value\n , (arg(\"key\"))\n , \"Returns True if the key is set.\")\n .def_readonly(\"block_sep\", &vistk::config::block_sep\n , \"The string which separates block names from key names.\")\n .def_readonly(\"global_value\", &vistk::config::global_value\n , \"A special key which is automatically inherited on subblock requests.\")\n ;\n}\n\nvistk::config::value_t\nget_value(vistk::config_t self, vistk::config::key_t const& key)\n{\n return self->get_value<vistk::config::value_t>(key);\n}\n\nvistk::config::value_t\nget_value_with_default(vistk::config_t self, vistk::config::key_t const& key, vistk::config::value_t const& def)\n{\n return self->get_value<vistk::config::value_t>(key, def);\n}\n\nvoid\ntranslator(vistk::configuration_exception const& e)\n{\n PyErr_SetString(PyExc_RuntimeError, e.what());\n}\n<|endoftext|>"} {"text":"<commit_before>#include \"qnodeeditorsocketmodel.h\"\n\n#include \"graphicsnode.hpp\"\n#include \"graphicsnodescene.hpp\"\n\n#include \"qreactiveproxymodel.h\"\n\n#include <QtCore\/QDebug>\n\n#define REACTIVE_MODEL qobject_cast<QReactiveProxyModel*>(d_ptr->q_ptr->sourceModel())\n\nstruct NodeWrapper\n{\n GraphicsNode* m_pNode;\n\n \/\/ Keep aligned with the source row\n QVector<GraphicsNodeSocket*> m_lSourcesToSrc; \/\/TODO would a QHash make sense?\n QVector<GraphicsNodeSocket*> m_lSinksToSrc; \/\/TODO would a QHash make sense?\n\n \/\/ Keep aligned with the node row\n QVector<GraphicsNodeSocket*> m_lSources;\n QVector<GraphicsNodeSocket*> m_lSinks;\n};\n\nclass QNodeEditorSocketModelPrivate final : public QObject\n{\npublic:\n explicit QNodeEditorSocketModelPrivate(QObject* p) : QObject(p) {}\n\n QNodeEditorEdgeModel m_EdgeModel {this};\n QVector<NodeWrapper*> m_lWrappers;\n GraphicsNodeScene* m_pScene;\n\n \/\/ helper\n GraphicsNode* insertNode(int idx, const QString& title);\n NodeWrapper* getNode(const QModelIndex& idx, bool r = false) const;\n\n void insertSockets(const QModelIndex& parent, int first, int last);\n void updateSockets(const QModelIndex& parent, int first, int last);\n void removeSockets(const QModelIndex& parent, int first, int last);\n\n QNodeEditorSocketModel* q_ptr;\npublic Q_SLOTS:\n void slotRowsInserted(const QModelIndex& parent, int first, int last);\n};\n\nQNodeEditorSocketModel::QNodeEditorSocketModel( QReactiveProxyModel* rmodel, GraphicsNodeScene* scene ) : \n QIdentityProxyModel(rmodel), d_ptr(new QNodeEditorSocketModelPrivate(this))\n{\n Q_ASSERT(rmodel);\n\n d_ptr->q_ptr = this;\n d_ptr->m_pScene = scene;\n setSourceModel(rmodel);\n\n d_ptr->m_EdgeModel.setSourceModel(rmodel->connectionsModel());\n\n connect(this, &QAbstractItemModel::rowsInserted,\n d_ptr, &QNodeEditorSocketModelPrivate::slotRowsInserted);\n}\n\nQNodeEditorSocketModel::~QNodeEditorSocketModel()\n{\n \n}\n\nvoid QNodeEditorSocketModel::setSourceModel(QAbstractItemModel *sm)\n{\n \/\/ This models can only work with a QReactiveProxyModel (no proxies)\n Q_ASSERT(qobject_cast<QReactiveProxyModel*>(sm));\n\n QIdentityProxyModel::setSourceModel(sm);\n\n \/\/TODO clear (this can wait, it wont happen anyway)\n\n d_ptr->slotRowsInserted({}, 0, sourceModel()->rowCount() -1 );\n}\n\nint QNodeEditorSocketModel::sourceSocketCount(const QModelIndex& idx) const\n{\n auto nodew = d_ptr->getNode(idx);\n\n return nodew ? nodew->m_lSources.size() : 0;\n}\n\nint QNodeEditorSocketModel::sinkSocketCount(const QModelIndex& idx) const\n{\n auto nodew = d_ptr->getNode(idx);\n\n return nodew ? nodew->m_lSinks.size() : 0;\n}\n\nGraphicsNode* QNodeEditorSocketModel::getNode(const QModelIndex& idx, bool recursive)\n{\n if ((!idx.isValid()) || idx.model() != this)\n return Q_NULLPTR;\n\n auto i = (recursive && idx.parent().isValid()) ? idx.parent() : idx;\n\n auto nodew = d_ptr->getNode(i);\n\n return nodew ? nodew->m_pNode : Q_NULLPTR;\n}\n\nQVector<GraphicsNodeSocket*> QNodeEditorSocketModel::getSourceSockets(const QModelIndex& idx) const\n{\n auto nodew = d_ptr->getNode(idx);\n\n return nodew ? nodew->m_lSources : QVector<GraphicsNodeSocket*>();\n}\n\nQVector<GraphicsNodeSocket*> QNodeEditorSocketModel::getSinkSockets(const QModelIndex& idx) const\n{\n auto nodew = d_ptr->getNode(idx);\n\n return nodew ? nodew->m_lSinks : QVector<GraphicsNodeSocket*>();\n}\n\nGraphicsNodeSocket* QNodeEditorSocketModel::getSourceSocket(const QModelIndex& idx)\n{\n if (!idx.parent().isValid())\n return Q_NULLPTR;\n\n const auto nodew = d_ptr->getNode(idx, true);\n\n if (!nodew)\n return Q_NULLPTR;\n\n return nodew->m_lSourcesToSrc.size() > idx.row() ?\n nodew->m_lSourcesToSrc[idx.row()] : Q_NULLPTR;\n}\n\nGraphicsNodeSocket* QNodeEditorSocketModel::getSinkSocket(const QModelIndex& idx)\n{\n if (!idx.parent().isValid())\n return Q_NULLPTR;\n\n const auto nodew = d_ptr->getNode(idx, true);\n\n if (!nodew)\n return Q_NULLPTR;\n\n return nodew->m_lSinksToSrc.size() > idx.row() ?\n nodew->m_lSinksToSrc[idx.row()] : Q_NULLPTR;\n}\n\nQNodeEditorEdgeModel* QNodeEditorSocketModel::edgeModel() const\n{\n return &d_ptr->m_EdgeModel;\n}\n\nvoid QNodeEditorSocketModelPrivate::slotRowsInserted(const QModelIndex& parent, int first, int last)\n{\n if (last < first) return;\n\n if (!parent.isValid()) {\n \/\/ create new nodes\n for (int i = first; i <= last; i++) {\n const auto idx = q_ptr->index(i, 0);\n if (idx.isValid()) {\n insertNode(idx.row(), idx.data().toString());\n slotRowsInserted(idx, 0, q_ptr->rowCount(idx));\n }\n }\n }\n else if (!parent.parent().isValid())\n insertSockets(parent, first, last);\n}\n\nGraphicsNode* QNodeEditorSocketModelPrivate::insertNode(int idx, const QString& title)\n{\n qDebug() << \"\\n\\n\\nIN INSERT NODE!!!\" << idx;\n auto idx2 = q_ptr->index(idx, 0);\n\n Q_ASSERT(idx2.isValid());\n\n if (idx == 0 && m_lWrappers.size())\n Q_ASSERT(false);\n\n auto n = new GraphicsNode(q_ptr, idx2);\n n->setTitle(title);\n\n auto nw = new NodeWrapper{\n n, {}, {}, {}, {}\n };\n\n m_lWrappers.insert(idx, nw);\n\n m_pScene->addItem(n->graphicsItem());\n\n return n;\n}\n\nNodeWrapper* QNodeEditorSocketModelPrivate::getNode(const QModelIndex& idx, bool r) const\n{\n \/\/ for convenience\n auto i = idx.model() == q_ptr->sourceModel() ? q_ptr->mapFromSource(idx) : idx;\n\n if ((!i.isValid()) || i.model() != q_ptr)\n return Q_NULLPTR;\n\n if (i.parent().isValid() && r)\n i = i.parent();\n\n if (i.parent().isValid())\n return Q_NULLPTR;\n\n \/\/ This should have been taken care of already. If it isn't, either the\n \/\/ source model is buggy (it will cause crashes later anyway) or this\n \/\/ code is (and in that case, the state is already corrupted, ignoring that\n \/\/ will cause garbage data to be shown\/serialized).\n Q_ASSERT(m_lWrappers.size() > idx.row());\n\n return m_lWrappers[idx.row()];\n}\n\nvoid QNodeEditorSocketModelPrivate::insertSockets(const QModelIndex& parent, int first, int last)\n{\n qDebug() << \"IN QNodeEditorSocketModelPrivate::insertSockets\" << first << last;\n\n auto nodew = getNode(parent);\n Q_ASSERT(nodew);\n\n Q_ASSERT(parent.isValid() && (!parent.parent().isValid()) && parent.model() == q_ptr);\n\n for (int i = 0; i < q_ptr->rowCount(parent); i++) {\n const auto idx = q_ptr->index(i, 0, parent);\n\n \/\/ It doesn't attempt to insert the socket at the correct index as\n \/\/ many items will be rejected\n\n \/\/ SOURCES\n if (idx.flags() & Qt::ItemIsDragEnabled) {\n auto s = new GraphicsNodeSocket(\n idx,\n GraphicsNodeSocket::SocketType::SOURCE,\n idx.data().toString(),\n nodew->m_pNode,\n (QObject*) q_ptr->sourceModel(),\n i\n );\n nodew->m_lSourcesToSrc.resize(\n std::max(i+1,nodew->m_lSourcesToSrc.size())\n );\n nodew->m_lSourcesToSrc.insert(i, s);\n nodew->m_lSources << s;\n\n }\n\n \/\/ SINKS\n if (idx.flags() & (Qt::ItemIsDropEnabled | Qt::ItemIsEditable)) {\n auto s = new GraphicsNodeSocket(\n idx,\n GraphicsNodeSocket::SocketType::SINK,\n idx.data().toString(),\n nodew->m_pNode,\n (QObject*) q_ptr->sourceModel(),\n i\n );\n nodew->m_lSinksToSrc.resize(\n std::max(i+1,nodew->m_lSinksToSrc.size())\n );\n nodew->m_lSinksToSrc.insert(i, s);\n nodew->m_lSinks << s;\n }\n\n nodew->m_pNode->update();\n }\n}\n\nvoid QNodeEditorSocketModelPrivate::updateSockets(const QModelIndex& parent, int first, int last)\n{\n Q_UNUSED(parent)\n Q_UNUSED(first)\n Q_UNUSED(last)\n \/\/TODO\n}\n\nvoid QNodeEditorSocketModelPrivate::removeSockets(const QModelIndex& parent, int first, int last)\n{\n Q_UNUSED(parent)\n Q_UNUSED(first)\n Q_UNUSED(last)\n \/\/TODO\n}\n\nQNodeEditorEdgeModel::QNodeEditorEdgeModel(QNodeEditorSocketModelPrivate* parent)\n : QIdentityProxyModel(parent), d_ptr(parent)\n{\n \n}\n\nQNodeEditorEdgeModel::~QNodeEditorEdgeModel()\n{\n \n}\n\nbool QNodeEditorEdgeModel::canConnect(const QModelIndex& idx1, const QModelIndex& idx2) const\n{\n return true; \/\/TODO\n}\n\nbool QNodeEditorEdgeModel::connectSocket(const QModelIndex& idx1, const QModelIndex& idx2)\n{\n if (idx1.model() != d_ptr->q_ptr || idx2.model() != d_ptr->q_ptr)\n return false;\n\n auto m = REACTIVE_MODEL;\n\n m->connectIndices(\n d_ptr->q_ptr->mapToSource(idx1),\n d_ptr->q_ptr->mapToSource(idx2)\n );\n}\n\nQNodeEditorSocketModel* QNodeEditorEdgeModel::socketModel() const\n{\n return d_ptr->q_ptr;\n}\n<commit_msg>socketproxy: Force the QObjectModel value role to be synched.<commit_after>#include \"qnodeeditorsocketmodel.h\"\n\n#include \"graphicsnode.hpp\"\n#include \"graphicsnodescene.hpp\"\n\n#include \"qreactiveproxymodel.h\"\n\n#include <QtCore\/QDebug>\n\n#include \"qobjectmodel.h\" \/\/TODO remove\n\n#define REACTIVE_MODEL qobject_cast<QReactiveProxyModel*>(d_ptr->q_ptr->sourceModel())\n\nstruct NodeWrapper\n{\n GraphicsNode* m_pNode;\n\n \/\/ Keep aligned with the source row\n QVector<GraphicsNodeSocket*> m_lSourcesToSrc; \/\/TODO would a QHash make sense?\n QVector<GraphicsNodeSocket*> m_lSinksToSrc; \/\/TODO would a QHash make sense?\n\n \/\/ Keep aligned with the node row\n QVector<GraphicsNodeSocket*> m_lSources;\n QVector<GraphicsNodeSocket*> m_lSinks;\n};\n\nclass QNodeEditorSocketModelPrivate final : public QObject\n{\npublic:\n explicit QNodeEditorSocketModelPrivate(QObject* p) : QObject(p) {}\n\n QNodeEditorEdgeModel m_EdgeModel {this};\n QVector<NodeWrapper*> m_lWrappers;\n GraphicsNodeScene* m_pScene;\n\n \/\/ helper\n GraphicsNode* insertNode(int idx, const QString& title);\n NodeWrapper* getNode(const QModelIndex& idx, bool r = false) const;\n\n void insertSockets(const QModelIndex& parent, int first, int last);\n void updateSockets(const QModelIndex& parent, int first, int last);\n void removeSockets(const QModelIndex& parent, int first, int last);\n\n QNodeEditorSocketModel* q_ptr;\npublic Q_SLOTS:\n void slotRowsInserted(const QModelIndex& parent, int first, int last);\n};\n\nQNodeEditorSocketModel::QNodeEditorSocketModel( QReactiveProxyModel* rmodel, GraphicsNodeScene* scene ) : \n QIdentityProxyModel(rmodel), d_ptr(new QNodeEditorSocketModelPrivate(this))\n{\n Q_ASSERT(rmodel);\n\n rmodel->addConnectedRole(QObjectModel::Role::ValueRole);\n\n d_ptr->q_ptr = this;\n d_ptr->m_pScene = scene;\n setSourceModel(rmodel);\n\n d_ptr->m_EdgeModel.setSourceModel(rmodel->connectionsModel());\n\n connect(this, &QAbstractItemModel::rowsInserted,\n d_ptr, &QNodeEditorSocketModelPrivate::slotRowsInserted);\n}\n\nQNodeEditorSocketModel::~QNodeEditorSocketModel()\n{\n \n}\n\nvoid QNodeEditorSocketModel::setSourceModel(QAbstractItemModel *sm)\n{\n \/\/ This models can only work with a QReactiveProxyModel (no proxies)\n Q_ASSERT(qobject_cast<QReactiveProxyModel*>(sm));\n\n QIdentityProxyModel::setSourceModel(sm);\n\n \/\/TODO clear (this can wait, it wont happen anyway)\n\n d_ptr->slotRowsInserted({}, 0, sourceModel()->rowCount() -1 );\n}\n\nint QNodeEditorSocketModel::sourceSocketCount(const QModelIndex& idx) const\n{\n auto nodew = d_ptr->getNode(idx);\n\n return nodew ? nodew->m_lSources.size() : 0;\n}\n\nint QNodeEditorSocketModel::sinkSocketCount(const QModelIndex& idx) const\n{\n auto nodew = d_ptr->getNode(idx);\n\n return nodew ? nodew->m_lSinks.size() : 0;\n}\n\nGraphicsNode* QNodeEditorSocketModel::getNode(const QModelIndex& idx, bool recursive)\n{\n if ((!idx.isValid()) || idx.model() != this)\n return Q_NULLPTR;\n\n auto i = (recursive && idx.parent().isValid()) ? idx.parent() : idx;\n\n auto nodew = d_ptr->getNode(i);\n\n return nodew ? nodew->m_pNode : Q_NULLPTR;\n}\n\nQVector<GraphicsNodeSocket*> QNodeEditorSocketModel::getSourceSockets(const QModelIndex& idx) const\n{\n auto nodew = d_ptr->getNode(idx);\n\n return nodew ? nodew->m_lSources : QVector<GraphicsNodeSocket*>();\n}\n\nQVector<GraphicsNodeSocket*> QNodeEditorSocketModel::getSinkSockets(const QModelIndex& idx) const\n{\n auto nodew = d_ptr->getNode(idx);\n\n return nodew ? nodew->m_lSinks : QVector<GraphicsNodeSocket*>();\n}\n\nGraphicsNodeSocket* QNodeEditorSocketModel::getSourceSocket(const QModelIndex& idx)\n{\n if (!idx.parent().isValid())\n return Q_NULLPTR;\n\n const auto nodew = d_ptr->getNode(idx, true);\n\n if (!nodew)\n return Q_NULLPTR;\n\n return nodew->m_lSourcesToSrc.size() > idx.row() ?\n nodew->m_lSourcesToSrc[idx.row()] : Q_NULLPTR;\n}\n\nGraphicsNodeSocket* QNodeEditorSocketModel::getSinkSocket(const QModelIndex& idx)\n{\n if (!idx.parent().isValid())\n return Q_NULLPTR;\n\n const auto nodew = d_ptr->getNode(idx, true);\n\n if (!nodew)\n return Q_NULLPTR;\n\n return nodew->m_lSinksToSrc.size() > idx.row() ?\n nodew->m_lSinksToSrc[idx.row()] : Q_NULLPTR;\n}\n\nQNodeEditorEdgeModel* QNodeEditorSocketModel::edgeModel() const\n{\n return &d_ptr->m_EdgeModel;\n}\n\nvoid QNodeEditorSocketModelPrivate::slotRowsInserted(const QModelIndex& parent, int first, int last)\n{\n if (last < first) return;\n\n if (!parent.isValid()) {\n \/\/ create new nodes\n for (int i = first; i <= last; i++) {\n const auto idx = q_ptr->index(i, 0);\n if (idx.isValid()) {\n insertNode(idx.row(), idx.data().toString());\n slotRowsInserted(idx, 0, q_ptr->rowCount(idx));\n }\n }\n }\n else if (!parent.parent().isValid())\n insertSockets(parent, first, last);\n}\n\nGraphicsNode* QNodeEditorSocketModelPrivate::insertNode(int idx, const QString& title)\n{\n qDebug() << \"\\n\\n\\nIN INSERT NODE!!!\" << idx;\n auto idx2 = q_ptr->index(idx, 0);\n\n Q_ASSERT(idx2.isValid());\n\n if (idx == 0 && m_lWrappers.size())\n Q_ASSERT(false);\n\n auto n = new GraphicsNode(q_ptr, idx2);\n n->setTitle(title);\n\n auto nw = new NodeWrapper{\n n, {}, {}, {}, {}\n };\n\n m_lWrappers.insert(idx, nw);\n\n m_pScene->addItem(n->graphicsItem());\n\n return n;\n}\n\nNodeWrapper* QNodeEditorSocketModelPrivate::getNode(const QModelIndex& idx, bool r) const\n{\n \/\/ for convenience\n auto i = idx.model() == q_ptr->sourceModel() ? q_ptr->mapFromSource(idx) : idx;\n\n if ((!i.isValid()) || i.model() != q_ptr)\n return Q_NULLPTR;\n\n if (i.parent().isValid() && r)\n i = i.parent();\n\n if (i.parent().isValid())\n return Q_NULLPTR;\n\n \/\/ This should have been taken care of already. If it isn't, either the\n \/\/ source model is buggy (it will cause crashes later anyway) or this\n \/\/ code is (and in that case, the state is already corrupted, ignoring that\n \/\/ will cause garbage data to be shown\/serialized).\n Q_ASSERT(m_lWrappers.size() > idx.row());\n\n return m_lWrappers[idx.row()];\n}\n\nvoid QNodeEditorSocketModelPrivate::insertSockets(const QModelIndex& parent, int first, int last)\n{\n qDebug() << \"IN QNodeEditorSocketModelPrivate::insertSockets\" << first << last;\n\n auto nodew = getNode(parent);\n Q_ASSERT(nodew);\n\n Q_ASSERT(parent.isValid() && (!parent.parent().isValid()) && parent.model() == q_ptr);\n\n for (int i = 0; i < q_ptr->rowCount(parent); i++) {\n const auto idx = q_ptr->index(i, 0, parent);\n\n \/\/ It doesn't attempt to insert the socket at the correct index as\n \/\/ many items will be rejected\n\n \/\/ SOURCES\n if (idx.flags() & Qt::ItemIsDragEnabled) {\n auto s = new GraphicsNodeSocket(\n idx,\n GraphicsNodeSocket::SocketType::SOURCE,\n idx.data().toString(),\n nodew->m_pNode,\n (QObject*) q_ptr->sourceModel(),\n i\n );\n nodew->m_lSourcesToSrc.resize(\n std::max(i+1,nodew->m_lSourcesToSrc.size())\n );\n nodew->m_lSourcesToSrc.insert(i, s);\n nodew->m_lSources << s;\n\n }\n\n \/\/ SINKS\n if (idx.flags() & (Qt::ItemIsDropEnabled | Qt::ItemIsEditable)) {\n auto s = new GraphicsNodeSocket(\n idx,\n GraphicsNodeSocket::SocketType::SINK,\n idx.data().toString(),\n nodew->m_pNode,\n (QObject*) q_ptr->sourceModel(),\n i\n );\n nodew->m_lSinksToSrc.resize(\n std::max(i+1,nodew->m_lSinksToSrc.size())\n );\n nodew->m_lSinksToSrc.insert(i, s);\n nodew->m_lSinks << s;\n }\n\n nodew->m_pNode->update();\n }\n}\n\nvoid QNodeEditorSocketModelPrivate::updateSockets(const QModelIndex& parent, int first, int last)\n{\n Q_UNUSED(parent)\n Q_UNUSED(first)\n Q_UNUSED(last)\n \/\/TODO\n}\n\nvoid QNodeEditorSocketModelPrivate::removeSockets(const QModelIndex& parent, int first, int last)\n{\n Q_UNUSED(parent)\n Q_UNUSED(first)\n Q_UNUSED(last)\n \/\/TODO\n}\n\nQNodeEditorEdgeModel::QNodeEditorEdgeModel(QNodeEditorSocketModelPrivate* parent)\n : QIdentityProxyModel(parent), d_ptr(parent)\n{\n \n}\n\nQNodeEditorEdgeModel::~QNodeEditorEdgeModel()\n{\n \n}\n\nbool QNodeEditorEdgeModel::canConnect(const QModelIndex& idx1, const QModelIndex& idx2) const\n{\n return true; \/\/TODO\n}\n\nbool QNodeEditorEdgeModel::connectSocket(const QModelIndex& idx1, const QModelIndex& idx2)\n{\n if (idx1.model() != d_ptr->q_ptr || idx2.model() != d_ptr->q_ptr)\n return false;\n\n auto m = REACTIVE_MODEL;\n\n m->connectIndices(\n d_ptr->q_ptr->mapToSource(idx1),\n d_ptr->q_ptr->mapToSource(idx2)\n );\n}\n\nQNodeEditorSocketModel* QNodeEditorEdgeModel::socketModel() const\n{\n return d_ptr->q_ptr;\n}\n<|endoftext|>"} {"text":"<commit_before>\/\/ -*- Mode:C++ -*-\n\n\/**************************************************************************************************\/\n\/* *\/\n\/* Copyright (C) 2014 University of Hull *\/\n\/* *\/\n\/**************************************************************************************************\/\n\/* *\/\n\/* module : field\/connection\/manager.hpp *\/\n\/* project : *\/\n\/* description: *\/\n\/* *\/\n\/**************************************************************************************************\/\n\n#if !defined(UKACHULLDCS_08961_FIELD_CONNECTION_MANAGER_HPP)\n\n#define UKACHULLDCS_08961_FIELD_CONNECTION_MANAGER_HPP\n\n\/\/ includes, system\n\n#include <boost\/bimap\/bimap.hpp> \/\/ boost::bimaps::*\n#include <boost\/bimap\/unordered_multiset_of.hpp> \/\/ boost::bimaps::unordered_multiset_of<>\n#include <boost\/utility\/mutexed_singleton.hpp> \/\/ boost::mutexed_singleton<>\n\n\/\/ includes, project\n\n#include <field\/connection\/update.hpp>\n#include <support\/printable.hpp>\n\nnamespace field {\n\n class base;\n \n namespace connection {\n\n class base;\n \n \/\/ types, exported (class, enum, struct, union, typedef)\n\n class manager : public support::printable,\n public boost::mutexed_singleton<manager> {\n\n BOOST_SINGLETON_PLACEMENT_DECLARATION;\n \n public:\n\n typedef std::function<void ()> update_function_type;\n \n bool connect (::field::base* const \/* src *\/, ::field::base* const \/* dst *\/,\n update_function_type);\n bool disconnect(::field::base* const \/* src\/dst *\/);\n bool update (::field::base* const \/* src *\/);\n \n std::string status() const;\n \n virtual void print_on(std::ostream&) const;\n \n private:\n\n template <class, int, typename> friend class boost::mutexed_singleton;\n \n struct dst {};\n struct src {};\n struct upd {};\n \n typedef boost::bimaps::unordered_multiset_of<boost::bimaps::tagged<::field::base*, src>>\n connection_src_type;\n typedef boost::bimaps::unordered_multiset_of<boost::bimaps::tagged<::field::base*, dst>>\n connection_dst_type;\n typedef boost::bimaps::with_info<boost::bimaps::tagged<update_function_type, upd>>\n connection_upd_type;\n typedef boost::bimaps::unordered_multiset_of_relation<> connection_rel_type;\n typedef boost::bimaps::bimap<connection_src_type,\n connection_dst_type,\n connection_rel_type,\n connection_upd_type>\n connection_map_type;\n\n connection_map_type connection_map_;\n \n explicit manager(boost::restricted);\n\n template <typename, typename>\n void print_helper(::field::base*, std::ostream&) const;\n \n };\n \n \/\/ variables, exported (extern)\n\n \/\/ functions, inlined (inline)\n \n \/\/ functions, exported (extern)\n\n } \/\/ namespace connection {\n\n \/\/ functions, inlined (inline)\n\n template <typename T1, typename T2 = T1>\n bool connect (T1* const \/* src *\/, T2* const \/* dst *\/,\n std::function<void (T1* const, T2* const)> \/* upd *\/ =\n connection::update::assign<T1,T2>);\n \n template <typename T>\n bool disconnect(T* const \/* src\/dst *\/);\n \n} \/\/ namespace field {\n\n#include <field\/connection\/manager.inl>\n\n#endif \/\/ #if !defined(UKACHULLDCS_08961_FIELD_CONNECTION_MANAGER_HPP)\n<commit_msg>added: some documentation<commit_after>\/\/ -*- Mode:C++ -*-\n\n\/**************************************************************************************************\/\n\/* *\/\n\/* Copyright (C) 2014 University of Hull *\/\n\/* *\/\n\/**************************************************************************************************\/\n\/* *\/\n\/* module : field\/connection\/manager.hpp *\/\n\/* project : *\/\n\/* description: *\/\n\/* *\/\n\/**************************************************************************************************\/\n\n#if !defined(UKACHULLDCS_08961_FIELD_CONNECTION_MANAGER_HPP)\n\n#define UKACHULLDCS_08961_FIELD_CONNECTION_MANAGER_HPP\n\n\/\/ includes, system\n\n#include <boost\/bimap\/bimap.hpp> \/\/ boost::bimaps::*\n#include <boost\/bimap\/unordered_multiset_of.hpp> \/\/ boost::bimaps::unordered_multiset_of<>\n#include <boost\/utility\/mutexed_singleton.hpp> \/\/ boost::mutexed_singleton<>\n\n\/\/ includes, project\n\n#include <field\/connection\/update.hpp>\n#include <support\/printable.hpp>\n\nnamespace field {\n\n class base;\n \n namespace connection {\n\n class base;\n \n \/\/ types, exported (class, enum, struct, union, typedef)\n\n class manager : public support::printable,\n public boost::mutexed_singleton<manager> {\n\n BOOST_SINGLETON_PLACEMENT_DECLARATION;\n \n public:\n\n typedef std::function<void ()> update_function_type;\n \n bool connect (::field::base* const \/* src *\/, ::field::base* const \/* dst *\/,\n update_function_type);\n bool disconnect(::field::base* const \/* src\/dst *\/);\n bool update (::field::base* const \/* src *\/);\n \n std::string status() const;\n \n virtual void print_on(std::ostream&) const;\n \n private:\n\n template <class, int, typename> friend class boost::mutexed_singleton;\n \n struct dst {};\n struct src {};\n struct upd {};\n \n typedef boost::bimaps::unordered_multiset_of<boost::bimaps::tagged<::field::base*, src>>\n connection_src_type;\n typedef boost::bimaps::unordered_multiset_of<boost::bimaps::tagged<::field::base*, dst>>\n connection_dst_type;\n typedef boost::bimaps::with_info<boost::bimaps::tagged<update_function_type, upd>>\n connection_upd_type;\n typedef boost::bimaps::unordered_multiset_of_relation<> connection_rel_type;\n typedef boost::bimaps::bimap<connection_src_type,\n connection_dst_type,\n connection_rel_type,\n connection_upd_type>\n connection_map_type;\n\n connection_map_type connection_map_;\n \n explicit manager(boost::restricted);\n\n template <typename, typename>\n void print_helper(::field::base*, std::ostream&) const;\n \n };\n \n \/\/ variables, exported (extern)\n\n \/\/ functions, inlined (inline)\n \n \/\/ functions, exported (extern)\n\n } \/\/ namespace connection {\n\n \/\/ functions, inlined (inline)\n\n \/**\n * \\brief establishes a connection between a source and destination field\n *\n * ...\n *\n * \\param source field\n * \\param destination field\n * \\param update operator (dflt: assign)\n * \\return true if connection established\n *\n * \\thow nothing\n *\/\n template <typename T1, typename T2 = T1>\n bool connect (T1* const \/* src *\/, T2* const \/* dst *\/,\n std::function<void (T1* const, T2* const)> \/* upd *\/ =\n connection::update::assign<T1,T2>);\n\n \/**\n * \\brief breaks the connection of either a source or a destination field\n *\n * ...\n *\n * \\param source or destination field\n * \\return true if disconnected\n *\n * \\thow nothing\n *\/\n template <typename T>\n bool disconnect(T* const \/* src\/dst *\/);\n \n} \/\/ namespace field {\n\n#include <field\/connection\/manager.inl>\n\n#endif \/\/ #if !defined(UKACHULLDCS_08961_FIELD_CONNECTION_MANAGER_HPP)\n<|endoftext|>"} {"text":"<commit_before>\/\/ Copyright (c) 2011-2014 The Bitcoin developers\n\/\/ Copyright (c) 2014-2015 The Dash developers\n\/\/ Copyright (c) 2015-2018 The PIVX developers\n\/\/ Distributed under the MIT\/X11 software license, see the accompanying\n\/\/ file COPYING or http:\/\/www.opensource.org\/licenses\/mit-license.php.\n\n#include \"askpassphrasedialog.h\"\n#include \"ui_askpassphrasedialog.h\"\n#include <QGraphicsDropShadowEffect>\n\n#include \"guiconstants.h\"\n#include \"guiutil.h\"\n#include \"walletmodel.h\"\n#include \"qt\/pivx\/qtutils.h\"\n#include \"qt\/pivx\/loadingdialog.h\"\n#include \"qt\/pivx\/PIVXGUI.h\"\n#include <QDebug>\n\n#include <QKeyEvent>\n#include <QMessageBox>\n#include <QPushButton>\n#include <QWidget>\n\nAskPassphraseDialog::AskPassphraseDialog(Mode mode, QWidget* parent, WalletModel* model, Context context) : QDialog(parent, Qt::WindowSystemMenuHint | Qt::WindowTitleHint | Qt::WindowCloseButtonHint),\n ui(new Ui::AskPassphraseDialog),\n mode(mode),\n model(model),\n context(context),\n btnWatch(new QCheckBox()),\n fCapsLock(false)\n{\n ui->setupUi(this);\n this->setStyleSheet(GUIUtil::loadStyleSheet());\n\n ui->left->setProperty(\"cssClass\", \"container-dialog\");\n\n ui->labelTitle->setText(\"Change passphrase\");\n ui->labelTitle->setProperty(\"cssClass\", \"text-title-screen\");\n\n ui->warningLabel->setProperty(\"cssClass\", \"text-subtitle\");\n\n ui->btnEsc->setText(\"\");\n ui->btnEsc->setProperty(\"cssClass\", \"ic-close\");\n\n ui->pushButtonOk->setText(\"OK\");\n ui->pushButtonOk->setProperty(\"cssClass\", \"btn-primary\");\n\n initCssEditLine(ui->passEdit1);\n initCssEditLine(ui->passEdit2);\n initCssEditLine(ui->passEdit3);\n\n ui->passLabel1->setText(\"Current passphrase\");\n ui->passLabel1->setProperty(\"cssClass\", \"text-title\");\n\n ui->passLabel2->setText(\"New passphrase\");\n ui->passLabel2->setProperty(\"cssClass\", \"text-title\");\n\n ui->passLabel3->setText(\"Repeat passphrase\");\n ui->passLabel3->setProperty(\"cssClass\", \"text-title\");\n\n ui->capsLabel->setVisible(false);\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 setShadow(ui->layoutEdit);\n setShadow(ui->layoutEdit2);\n\n \/\/ Setup Caps Lock detection.\n ui->passEdit1->installEventFilter(this);\n ui->passEdit2->installEventFilter(this);\n ui->passEdit3->installEventFilter(this);\n\n this->model = model;\n\n QString title;\n switch (mode) {\n case Mode::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 ui->layoutEdit->hide();\n title = tr(\"Encrypt wallet\");\n initWatch(ui->layoutEdit2);\n break;\n case Mode::UnlockAnonymize:\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->layoutEdit2->hide();\n ui->passLabel3->hide();\n ui->passEdit3->hide();\n title = tr(\"Unlock wallet\\nfor staking\");\n initWatch(ui->layoutEdit);\n break;\n case Mode::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->layoutEdit2->hide();\n ui->passLabel3->hide();\n ui->passEdit3->hide();\n title = tr(\"Unlock wallet\");\n initWatch(ui->layoutEdit);\n break;\n case Mode::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->layoutEdit2->hide();\n ui->passLabel3->hide();\n ui->passEdit3->hide();\n title = tr(\"Decrypt wallet\");\n initWatch(ui->layoutEdit);\n break;\n case Mode::ChangePass: \/\/ Ask old passphrase + new passphrase x2\n title = tr(\"Change passphrase\");\n ui->warningLabel->setText(tr(\"Enter the old and new passphrase to the wallet.\"));\n initWatch(ui->layoutEdit);\n break;\n }\n\n ui->labelTitle->setText(title);\n\n textChanged();\n connect(btnWatch, SIGNAL(clicked()), this, SLOT(onWatchClicked()));\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 connect(ui->pushButtonOk, SIGNAL(clicked()), this, SLOT(accept()));\n connect(ui->btnEsc, SIGNAL(clicked()), this, SLOT(close()));\n}\n\nvoid AskPassphraseDialog::onWatchClicked(){\n int state = btnWatch->checkState();\n ui->passEdit3->setEchoMode(state == Qt::Checked ? QLineEdit::Normal : QLineEdit::Password );\n ui->passEdit2->setEchoMode(state== Qt::Checked ? QLineEdit::Normal : QLineEdit::Password );\n ui->passEdit1->setEchoMode(state == Qt::Checked ? QLineEdit::Normal : QLineEdit::Password );\n}\n\nAskPassphraseDialog::~AskPassphraseDialog()\n{\n \/\/ Attempt to overwrite text so that they do not linger around in memory\n ui->passEdit1->setText(QString(\" \").repeated(ui->passEdit1->text().size()));\n ui->passEdit2->setText(QString(\" \").repeated(ui->passEdit2->text().size()));\n ui->passEdit3->setText(QString(\" \").repeated(ui->passEdit3->text().size()));\n delete ui;\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 switch (mode) {\n case Mode::Encrypt: {\n if (newpass1.empty() || newpass2.empty()) {\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 PIV<\/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 if (newpass1 == newpass2) {\n newpassCache = newpass1;\n PIVXGUI* window = static_cast<PIVXGUI*>(parentWidget());\n LoadingDialog *dialog = new LoadingDialog(window);\n dialog->execute(this, 1);\n openDialogWithOpaqueBackgroundFullScreen(dialog, window);\n } else {\n QMessageBox::critical(this, tr(\"Wallet encryption failed\"),\n tr(\"The supplied passphrases do not match.\"));\n }\n } else {\n QDialog::reject(); \/\/ Cancelled\n }\n } break;\n case Mode::UnlockAnonymize:\n if (!model->setWalletLocked(false, oldpass, true)) {\n QMessageBox::critical(this, tr(\"Wallet unlock failed\"),\n tr(\"The passphrase entered for the wallet decryption was incorrect.\"));\n } else {\n QDialog::accept(); \/\/ Success\n }\n break;\n case Mode::Unlock:\n if (!model->setWalletLocked(false, oldpass, false)) {\n QMessageBox::critical(this, tr(\"Wallet unlock failed\"),\n tr(\"The passphrase entered for the wallet decryption was incorrect.\"));\n } else {\n QDialog::accept(); \/\/ Success\n }\n break;\n case Mode::Decrypt:\n if (!model->setWalletEncrypted(false, oldpass)) {\n QMessageBox::critical(this, tr(\"Wallet decryption failed\"),\n tr(\"The passphrase entered for the wallet decryption was incorrect.\"));\n } else {\n QDialog::accept(); \/\/ Success\n }\n break;\n case Mode::ChangePass:\n if (newpass1 == newpass2) {\n if (model->changePassphrase(oldpass, newpass1)) {\n QMessageBox::information(this, tr(\"Wallet encrypted\"),\n tr(\"Wallet passphrase was successfully changed.\"));\n QDialog::accept(); \/\/ Success\n } else {\n QMessageBox::critical(this, tr(\"Wallet encryption failed\"),\n tr(\"The passphrase entered for the wallet decryption was incorrect.\"));\n }\n } else {\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 case Mode::Encrypt: \/\/ New passphrase x2\n acceptable = !ui->passEdit2->text().isEmpty() && !ui->passEdit3->text().isEmpty();\n break;\n case Mode::UnlockAnonymize: \/\/ Old passphrase x1\n case Mode::Unlock: \/\/ Old passphrase x1\n case Mode::Decrypt:\n acceptable = !ui->passEdit1->text().isEmpty();\n break;\n case Mode::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->pushButtonOk->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 ui->capsLabel->setVisible(true);\n } else {\n ui->capsLabel->clear();\n ui->capsLabel->setVisible(false);\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 ui->capsLabel->setVisible(true);\n } else if (psz->isLetter()) {\n fCapsLock = false;\n ui->capsLabel->clear();\n ui->capsLabel->setVisible(false);\n }\n }\n }\n return QDialog::eventFilter(object, event);\n}\n\nvoid AskPassphraseDialog::warningMessage() {\n QMessageBox::warning(this, tr(\"Wallet encrypted\"),\n \"<qt>\" +\n tr(\"PIVX will close now to finish the encryption process. \"\n \"Remember that encrypting your wallet cannot fully protect \"\n \"your PIVs from being stolen by malware infecting your computer.\") +\n \"<br><br><b>\" +\n tr(\"IMPORTANT: Any previous backups you have made of your wallet file \"\n \"should be replaced with the newly generated, encrypted wallet file. \"\n \"For security reasons, previous backups of the unencrypted wallet file \"\n \"will become useless as soon as you start using the new, encrypted wallet.\") +\n \"<\/b><\/qt>\");\n QApplication::quit();\n}\n\nvoid AskPassphraseDialog::errorEncryptingWallet() {\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\nvoid AskPassphraseDialog::run(int type){\n if (type == 1) {\n if (!newpassCache.empty()) {\n if (model->setWalletEncrypted(true, newpassCache)) {\n QMetaObject::invokeMethod(this, \"warningMessage\", Qt::QueuedConnection);\n } else {\n QMetaObject::invokeMethod(this, \"errorEncryptingWallet\", Qt::QueuedConnection);\n }\n newpassCache.clear();\n QDialog::accept(); \/\/ Success\n }\n }\n}\nvoid AskPassphraseDialog::onError(int type, QString error){\n newpassCache = \"\";\n}\n\nvoid AskPassphraseDialog::initWatch(QWidget *parent) {\n btnWatch = new QCheckBox(parent);\n btnWatch->setProperty(\"cssClass\", \"btn-watch-password\");\n btnWatch->setChecked(false);\n QSize BUTTON_CONTACT_SIZE = QSize(24, 24);\n btnWatch->setMinimumSize(BUTTON_CONTACT_SIZE);\n btnWatch->setMaximumSize(BUTTON_CONTACT_SIZE);\n btnWatch->show();\n btnWatch->raise();\n\n int posXX = ui->layoutEdit->width() - 30;\n int posYY = 8;\n btnWatch->move(450, posYY);\n}<commit_msg>[GUI] hide dialog on loading action.<commit_after>\/\/ Copyright (c) 2011-2014 The Bitcoin developers\n\/\/ Copyright (c) 2014-2015 The Dash developers\n\/\/ Copyright (c) 2015-2018 The PIVX developers\n\/\/ Distributed under the MIT\/X11 software license, see the accompanying\n\/\/ file COPYING or http:\/\/www.opensource.org\/licenses\/mit-license.php.\n\n#include \"askpassphrasedialog.h\"\n#include \"ui_askpassphrasedialog.h\"\n#include <QGraphicsDropShadowEffect>\n\n#include \"guiconstants.h\"\n#include \"guiutil.h\"\n#include \"walletmodel.h\"\n#include \"qt\/pivx\/qtutils.h\"\n#include \"qt\/pivx\/loadingdialog.h\"\n#include \"qt\/pivx\/PIVXGUI.h\"\n#include <QDebug>\n\n#include <QKeyEvent>\n#include <QMessageBox>\n#include <QPushButton>\n#include <QWidget>\n\nAskPassphraseDialog::AskPassphraseDialog(Mode mode, QWidget* parent, WalletModel* model, Context context) : QDialog(parent, Qt::WindowSystemMenuHint | Qt::WindowTitleHint | Qt::WindowCloseButtonHint),\n ui(new Ui::AskPassphraseDialog),\n mode(mode),\n model(model),\n context(context),\n btnWatch(new QCheckBox()),\n fCapsLock(false)\n{\n ui->setupUi(this);\n this->setStyleSheet(GUIUtil::loadStyleSheet());\n\n ui->left->setProperty(\"cssClass\", \"container-dialog\");\n\n ui->labelTitle->setText(\"Change passphrase\");\n ui->labelTitle->setProperty(\"cssClass\", \"text-title-screen\");\n\n ui->warningLabel->setProperty(\"cssClass\", \"text-subtitle\");\n\n ui->btnEsc->setText(\"\");\n ui->btnEsc->setProperty(\"cssClass\", \"ic-close\");\n\n ui->pushButtonOk->setText(\"OK\");\n ui->pushButtonOk->setProperty(\"cssClass\", \"btn-primary\");\n\n initCssEditLine(ui->passEdit1);\n initCssEditLine(ui->passEdit2);\n initCssEditLine(ui->passEdit3);\n\n ui->passLabel1->setText(\"Current passphrase\");\n ui->passLabel1->setProperty(\"cssClass\", \"text-title\");\n\n ui->passLabel2->setText(\"New passphrase\");\n ui->passLabel2->setProperty(\"cssClass\", \"text-title\");\n\n ui->passLabel3->setText(\"Repeat passphrase\");\n ui->passLabel3->setProperty(\"cssClass\", \"text-title\");\n\n ui->capsLabel->setVisible(false);\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 setShadow(ui->layoutEdit);\n setShadow(ui->layoutEdit2);\n\n \/\/ Setup Caps Lock detection.\n ui->passEdit1->installEventFilter(this);\n ui->passEdit2->installEventFilter(this);\n ui->passEdit3->installEventFilter(this);\n\n this->model = model;\n\n QString title;\n switch (mode) {\n case Mode::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 ui->layoutEdit->hide();\n title = tr(\"Encrypt wallet\");\n initWatch(ui->layoutEdit2);\n break;\n case Mode::UnlockAnonymize:\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->layoutEdit2->hide();\n ui->passLabel3->hide();\n ui->passEdit3->hide();\n title = tr(\"Unlock wallet\\nfor staking\");\n initWatch(ui->layoutEdit);\n break;\n case Mode::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->layoutEdit2->hide();\n ui->passLabel3->hide();\n ui->passEdit3->hide();\n title = tr(\"Unlock wallet\");\n initWatch(ui->layoutEdit);\n break;\n case Mode::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->layoutEdit2->hide();\n ui->passLabel3->hide();\n ui->passEdit3->hide();\n title = tr(\"Decrypt wallet\");\n initWatch(ui->layoutEdit);\n break;\n case Mode::ChangePass: \/\/ Ask old passphrase + new passphrase x2\n title = tr(\"Change passphrase\");\n ui->warningLabel->setText(tr(\"Enter the old and new passphrase to the wallet.\"));\n initWatch(ui->layoutEdit);\n break;\n }\n\n ui->labelTitle->setText(title);\n\n textChanged();\n connect(btnWatch, SIGNAL(clicked()), this, SLOT(onWatchClicked()));\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 connect(ui->pushButtonOk, SIGNAL(clicked()), this, SLOT(accept()));\n connect(ui->btnEsc, SIGNAL(clicked()), this, SLOT(close()));\n}\n\nvoid AskPassphraseDialog::onWatchClicked(){\n int state = btnWatch->checkState();\n ui->passEdit3->setEchoMode(state == Qt::Checked ? QLineEdit::Normal : QLineEdit::Password );\n ui->passEdit2->setEchoMode(state== Qt::Checked ? QLineEdit::Normal : QLineEdit::Password );\n ui->passEdit1->setEchoMode(state == Qt::Checked ? QLineEdit::Normal : QLineEdit::Password );\n}\n\nAskPassphraseDialog::~AskPassphraseDialog()\n{\n \/\/ Attempt to overwrite text so that they do not linger around in memory\n ui->passEdit1->setText(QString(\" \").repeated(ui->passEdit1->text().size()));\n ui->passEdit2->setText(QString(\" \").repeated(ui->passEdit2->text().size()));\n ui->passEdit3->setText(QString(\" \").repeated(ui->passEdit3->text().size()));\n delete ui;\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 switch (mode) {\n case Mode::Encrypt: {\n if (newpass1.empty() || newpass2.empty()) {\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 PIV<\/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 if (newpass1 == newpass2) {\n newpassCache = newpass1;\n PIVXGUI* window = static_cast<PIVXGUI*>(parentWidget());\n LoadingDialog *dialog = new LoadingDialog(window);\n dialog->execute(this, 1);\n openDialogWithOpaqueBackgroundFullScreen(dialog, window);\n } else {\n QMessageBox::critical(this, tr(\"Wallet encryption failed\"),\n tr(\"The supplied passphrases do not match.\"));\n }\n } else {\n QDialog::reject(); \/\/ Cancelled\n }\n } break;\n case Mode::UnlockAnonymize:\n if (!model->setWalletLocked(false, oldpass, true)) {\n QMessageBox::critical(this, tr(\"Wallet unlock failed\"),\n tr(\"The passphrase entered for the wallet decryption was incorrect.\"));\n } else {\n QDialog::accept(); \/\/ Success\n }\n break;\n case Mode::Unlock:\n if (!model->setWalletLocked(false, oldpass, false)) {\n QMessageBox::critical(this, tr(\"Wallet unlock failed\"),\n tr(\"The passphrase entered for the wallet decryption was incorrect.\"));\n } else {\n QDialog::accept(); \/\/ Success\n }\n break;\n case Mode::Decrypt:\n if (!model->setWalletEncrypted(false, oldpass)) {\n QMessageBox::critical(this, tr(\"Wallet decryption failed\"),\n tr(\"The passphrase entered for the wallet decryption was incorrect.\"));\n } else {\n QDialog::accept(); \/\/ Success\n }\n break;\n case Mode::ChangePass:\n if (newpass1 == newpass2) {\n if (model->changePassphrase(oldpass, newpass1)) {\n QMessageBox::information(this, tr(\"Wallet encrypted\"),\n tr(\"Wallet passphrase was successfully changed.\"));\n QDialog::accept(); \/\/ Success\n } else {\n QMessageBox::critical(this, tr(\"Wallet encryption failed\"),\n tr(\"The passphrase entered for the wallet decryption was incorrect.\"));\n }\n } else {\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 case Mode::Encrypt: \/\/ New passphrase x2\n acceptable = !ui->passEdit2->text().isEmpty() && !ui->passEdit3->text().isEmpty();\n break;\n case Mode::UnlockAnonymize: \/\/ Old passphrase x1\n case Mode::Unlock: \/\/ Old passphrase x1\n case Mode::Decrypt:\n acceptable = !ui->passEdit1->text().isEmpty();\n break;\n case Mode::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->pushButtonOk->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 ui->capsLabel->setVisible(true);\n } else {\n ui->capsLabel->clear();\n ui->capsLabel->setVisible(false);\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 ui->capsLabel->setVisible(true);\n } else if (psz->isLetter()) {\n fCapsLock = false;\n ui->capsLabel->clear();\n ui->capsLabel->setVisible(false);\n }\n }\n }\n return QDialog::eventFilter(object, event);\n}\n\nvoid AskPassphraseDialog::warningMessage() {\n QMessageBox::warning(this, tr(\"Wallet encrypted\"),\n \"<qt>\" +\n tr(\"PIVX will close now to finish the encryption process. \"\n \"Remember that encrypting your wallet cannot fully protect \"\n \"your PIVs from being stolen by malware infecting your computer.\") +\n \"<br><br><b>\" +\n tr(\"IMPORTANT: Any previous backups you have made of your wallet file \"\n \"should be replaced with the newly generated, encrypted wallet file. \"\n \"For security reasons, previous backups of the unencrypted wallet file \"\n \"will become useless as soon as you start using the new, encrypted wallet.\") +\n \"<\/b><\/qt>\");\n QApplication::quit();\n}\n\nvoid AskPassphraseDialog::errorEncryptingWallet() {\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\nvoid AskPassphraseDialog::run(int type){\n if (type == 1) {\n if (!newpassCache.empty()) {\n QMetaObject::invokeMethod(this, \"hide\", Qt::QueuedConnection);\n if (model->setWalletEncrypted(true, newpassCache)) {\n QMetaObject::invokeMethod(this, \"warningMessage\", Qt::QueuedConnection);\n } else {\n QMetaObject::invokeMethod(this, \"errorEncryptingWallet\", Qt::QueuedConnection);\n }\n newpassCache.clear();\n QDialog::accept(); \/\/ Success\n }\n }\n}\nvoid AskPassphraseDialog::onError(int type, QString error){\n newpassCache = \"\";\n}\n\nvoid AskPassphraseDialog::initWatch(QWidget *parent) {\n btnWatch = new QCheckBox(parent);\n btnWatch->setProperty(\"cssClass\", \"btn-watch-password\");\n btnWatch->setChecked(false);\n QSize BUTTON_CONTACT_SIZE = QSize(24, 24);\n btnWatch->setMinimumSize(BUTTON_CONTACT_SIZE);\n btnWatch->setMaximumSize(BUTTON_CONTACT_SIZE);\n btnWatch->show();\n btnWatch->raise();\n\n int posXX = ui->layoutEdit->width() - 30;\n int posYY = 8;\n btnWatch->move(450, posYY);\n}<|endoftext|>"} {"text":"<commit_before>#include \"askpassphrasedialog.h\"\n#include \"ui_askpassphrasedialog.h\"\n\n#include \"guiconstants.h\"\n#include \"walletmodel.h\"\n\n#include <QMessageBox>\n#include <QPushButton>\n#include <QKeyEvent>\n\nAskPassphraseDialog::AskPassphraseDialog(Mode mode, QWidget *parent) :\n QDialog(parent),\n ui(new Ui::AskPassphraseDialog),\n mode(mode),\n model(0),\n fCapsLock(false)\n{\n ui->setupUi(this);\n ui->passEdit1->setMaxLength(MAX_PASSPHRASE_SIZE);\n ui->passEdit2->setMaxLength(MAX_PASSPHRASE_SIZE);\n ui->passEdit3->setMaxLength(MAX_PASSPHRASE_SIZE);\n \n \/\/ Setup Caps Lock detection.\n ui->passEdit1->installEventFilter(this);\n ui->passEdit2->installEventFilter(this);\n ui->passEdit3->installEventFilter(this);\n\n switch(mode)\n {\n case Encrypt: \/\/ Ask passphrase x2\n ui->passLabel1->hide();\n ui->passEdit1->hide();\n ui->warningLabel->setText(tr(\"Enter the new passphrase to the wallet.<br\/>Please use a passphrase of <b>10 or more random characters<\/b>, or <b>eight or more words<\/b>.\"));\n setWindowTitle(tr(\"Encrypt wallet\"));\n break;\n case Unlock: \/\/ Ask passphrase\n ui->warningLabel->setText(tr(\"This operation needs your wallet passphrase to unlock the wallet.\"));\n ui->passLabel2->hide();\n ui->passEdit2->hide();\n ui->passLabel3->hide();\n ui->passEdit3->hide();\n setWindowTitle(tr(\"Unlock wallet\"));\n break;\n case Decrypt: \/\/ Ask passphrase\n ui->warningLabel->setText(tr(\"This operation needs your wallet passphrase to decrypt the wallet.\"));\n ui->passLabel2->hide();\n ui->passEdit2->hide();\n ui->passLabel3->hide();\n ui->passEdit3->hide();\n setWindowTitle(tr(\"Decrypt wallet\"));\n break;\n case ChangePass: \/\/ Ask old passphrase + new passphrase x2\n setWindowTitle(tr(\"Change passphrase\"));\n ui->warningLabel->setText(tr(\"Enter the old and new passphrase to the wallet.\"));\n break;\n }\n\n textChanged();\n connect(ui->passEdit1, SIGNAL(textChanged(QString)), this, SLOT(textChanged()));\n connect(ui->passEdit2, SIGNAL(textChanged(QString)), this, SLOT(textChanged()));\n connect(ui->passEdit3, SIGNAL(textChanged(QString)), this, SLOT(textChanged()));\n}\n\nAskPassphraseDialog::~AskPassphraseDialog()\n{\n \/\/ Attempt to overwrite text so that they do not linger around in memory\n ui->passEdit1->setText(QString(\" \").repeated(ui->passEdit1->text().size()));\n ui->passEdit2->setText(QString(\" \").repeated(ui->passEdit2->text().size()));\n ui->passEdit3->setText(QString(\" \").repeated(ui->passEdit3->text().size()));\n 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 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 BITCOINS<\/b>!\\nAre 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 tr(\"Bitcoin will close now to finish the encryption process. Remember that encrypting your wallet cannot fully protect your bitcoins from being stolen by malware infecting your computer.\"));\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 succesfully 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 accepable\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 *, QEvent *event)\n{\n \/* Detect Caps Lock.\n * There is no good OS-independent way to check a key state in Qt, but we\n * can detect Caps Lock by checking for the following condition:\n * Shift key is down and the result is a lower case character, or\n * Shift key is not down and the result is an upper case character.\n *\/\n if (event->type() == QEvent::KeyPress) {\n QKeyEvent *ke = static_cast<QKeyEvent *>(event);\n QString str = ke->text();\n if (str.length() != 0) {\n const QChar *psz = str.unicode();\n bool fShift = (ke->modifiers() & Qt::ShiftModifier) != 0;\n if ((fShift && psz->isLower()) || (!fShift && psz->isUpper())) {\n fCapsLock = true;\n ui->capsLabel->setText(tr(\"Warning: The Caps Lock key is on.\"));\n } else if (psz->isLetter()) {\n fCapsLock = false;\n ui->capsLabel->clear();\n }\n }\n }\n return false;\n}\n<commit_msg>When encrypting the wallet, warn user that old backups will become useless.<commit_after>#include \"askpassphrasedialog.h\"\n#include \"ui_askpassphrasedialog.h\"\n\n#include \"guiconstants.h\"\n#include \"walletmodel.h\"\n\n#include <QMessageBox>\n#include <QPushButton>\n#include <QKeyEvent>\n\nAskPassphraseDialog::AskPassphraseDialog(Mode mode, QWidget *parent) :\n QDialog(parent),\n ui(new Ui::AskPassphraseDialog),\n mode(mode),\n model(0),\n fCapsLock(false)\n{\n ui->setupUi(this);\n ui->passEdit1->setMaxLength(MAX_PASSPHRASE_SIZE);\n ui->passEdit2->setMaxLength(MAX_PASSPHRASE_SIZE);\n ui->passEdit3->setMaxLength(MAX_PASSPHRASE_SIZE);\n \n \/\/ Setup Caps Lock detection.\n ui->passEdit1->installEventFilter(this);\n ui->passEdit2->installEventFilter(this);\n ui->passEdit3->installEventFilter(this);\n\n switch(mode)\n {\n case Encrypt: \/\/ Ask passphrase x2\n ui->passLabel1->hide();\n ui->passEdit1->hide();\n ui->warningLabel->setText(tr(\"Enter the new passphrase to the wallet.<br\/>Please use a passphrase of <b>10 or more random characters<\/b>, or <b>eight or more words<\/b>.\"));\n setWindowTitle(tr(\"Encrypt wallet\"));\n break;\n case Unlock: \/\/ Ask passphrase\n ui->warningLabel->setText(tr(\"This operation needs your wallet passphrase to unlock the wallet.\"));\n ui->passLabel2->hide();\n ui->passEdit2->hide();\n ui->passLabel3->hide();\n ui->passEdit3->hide();\n setWindowTitle(tr(\"Unlock wallet\"));\n break;\n case Decrypt: \/\/ Ask passphrase\n ui->warningLabel->setText(tr(\"This operation needs your wallet passphrase to decrypt the wallet.\"));\n ui->passLabel2->hide();\n ui->passEdit2->hide();\n ui->passLabel3->hide();\n ui->passEdit3->hide();\n setWindowTitle(tr(\"Decrypt wallet\"));\n break;\n case ChangePass: \/\/ Ask old passphrase + new passphrase x2\n setWindowTitle(tr(\"Change passphrase\"));\n ui->warningLabel->setText(tr(\"Enter the old and new passphrase to the wallet.\"));\n break;\n }\n\n textChanged();\n connect(ui->passEdit1, SIGNAL(textChanged(QString)), this, SLOT(textChanged()));\n connect(ui->passEdit2, SIGNAL(textChanged(QString)), this, SLOT(textChanged()));\n connect(ui->passEdit3, SIGNAL(textChanged(QString)), this, SLOT(textChanged()));\n}\n\nAskPassphraseDialog::~AskPassphraseDialog()\n{\n \/\/ Attempt to overwrite text so that they do not linger around in memory\n ui->passEdit1->setText(QString(\" \").repeated(ui->passEdit1->text().size()));\n ui->passEdit2->setText(QString(\" \").repeated(ui->passEdit2->text().size()));\n ui->passEdit3->setText(QString(\" \").repeated(ui->passEdit3->text().size()));\n 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 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 BITCOINS<\/b>!\\nAre 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(\"Bitcoin 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.\") + \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 succesfully 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 accepable\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 *, QEvent *event)\n{\n \/* Detect Caps Lock.\n * There is no good OS-independent way to check a key state in Qt, but we\n * can detect Caps Lock by checking for the following condition:\n * Shift key is down and the result is a lower case character, or\n * Shift key is not down and the result is an upper case character.\n *\/\n if (event->type() == QEvent::KeyPress) {\n QKeyEvent *ke = static_cast<QKeyEvent *>(event);\n QString str = ke->text();\n if (str.length() != 0) {\n const QChar *psz = str.unicode();\n bool fShift = (ke->modifiers() & Qt::ShiftModifier) != 0;\n if ((fShift && psz->isLower()) || (!fShift && psz->isUpper())) {\n fCapsLock = true;\n ui->capsLabel->setText(tr(\"Warning: The Caps Lock key is on.\"));\n } else if (psz->isLetter()) {\n fCapsLock = false;\n ui->capsLabel->clear();\n }\n }\n }\n return false;\n}\n<|endoftext|>"} {"text":"<commit_before>#include \"psqlwrapper.h\"\n\n#include <QDebug>\n#include <QSettings>\n#include <QSqlError>\n#include <QSqlQuery>\n#include <QVariant>\n\nbool PsqlWrapper::informationSchemaHidden = true;\nbool PsqlWrapper::pgCatalogHidden = true;\n\nPsqlWrapper::PsqlWrapper(QSqlDatabase *db)\n : QObject(NULL) {\n m_db = db;\n\n QSettings s;\n s.beginGroup(plid());\n informationSchemaHidden = s.value(\"informationSchemaHidden\", true).toBool();\n pgCatalogHidden = s.value(\"pgCatalogHidden\", true).toBool();\n s.endGroup();\n\n m_configDialog = new PsqlConfig(this);\n}\n\nSqlWrapper::WrapperFeatures PsqlWrapper::features() {\n return ODBC | Schemas;\n}\n\nSqlWrapper* PsqlWrapper::newInstance(QSqlDatabase *db) {\n return new PsqlWrapper(db);\n}\n\nvoid PsqlWrapper::save() {\n QSettings s;\n s.beginGroup(plid());\n s.setValue(\"informationSchemaHidden\", informationSchemaHidden);\n s.setValue(\"pgCatalogHidden\", pgCatalogHidden);\n s.endGroup();\n}\n\n\/**\n * Récupération d'un schéma\n *\/\nSqlSchema PsqlWrapper::schema(QString sch) {\n SqlSchema schema;\n\n if (!m_db) {\n return schema;\n }\n\n QString sql;\n sql += \"SELECT '\" + sch + \"', t.table_name, t.table_type, c.column_name, \";\n sql += \"c.is_nullable, c.data_type \";\n sql += \"FROM INFORMATION_SCHEMA.COLUMNS C \";\n sql += \"INNER JOIN INFORMATION_SCHEMA.TABLES T \";\n sql += \"ON C.TABLE_NAME = T.TABLE_NAME \";\n sql += \"AND C.TABLE_SCHEMA = T.TABLE_SCHEMA \";\n sql += \"WHERE t.table_catalog='\" + m_db->databaseName() + \"' \";\n sql += \"AND t.table_schema='\" + sch + \"' \";\n sql += \"ORDER BY table_name, ordinal_position \";\n\n QSqlQuery query(*m_db);\n if (!query.exec(sql)) {\n qDebug() << query.lastError().text();\n return schema;\n }\n\n bool ruptureTable = false;\n SqlTable t;\n while (query.next()) {\n schema.name = query.value(0).toString();\n schema.defaultSchema = schema.name == \"public\";\n\n \/\/ Tables\n ruptureTable = t.name != query.value(1).toString();\n\n if (ruptureTable) {\n if (t.name.length() > 0) {\n schema.tables << t;\n }\n\n t = SqlTable();\n t.name = query.value(1).toString();\n if (query.value(2).toString() == \"BASE TABLE\") {\n t.type = Table;\n } else if (query.value(2).toString() == \"VIEW\") {\n t.type = ViewTable;\n }\n }\n\n \/\/ Colonnes\n SqlColumn c;\n c.name = query.value(3).toString();\n c.permitsNull = query.value(4).toBool();\n c.primaryKey = false;\n t.columns << c;\n }\n\n if (t.name.length() > 0) {\n schema.tables << t;\n }\n\n return schema;\n}\n\n\/**\n * Récupération de la liste des tables\n *\/\nQList<SqlSchema> PsqlWrapper::schemas() {\n QList<SqlSchema> schemas;\n\n if (!m_db) {\n return schemas;\n }\n\n QString sql;\n sql += \"SELECT t.table_schema, t.table_name, t.table_type, c.column_name, \";\n sql += \"c.is_nullable, c.data_type \";\n sql += \"FROM INFORMATION_SCHEMA.COLUMNS C \";\n sql += \"INNER JOIN INFORMATION_SCHEMA.TABLES T \";\n sql += \"ON C.TABLE_NAME = T.TABLE_NAME \";\n sql += \"AND C.TABLE_SCHEMA = T.TABLE_SCHEMA \";\n sql += \"WHERE t.table_catalog='\" + m_db->databaseName() + \"' \";\n if (informationSchemaHidden) {\n sql += \"AND t.table_schema <> 'information_schema' \";\n }\n if (pgCatalogHidden) {\n sql += \"AND t.table_schema <> 'pg_catalog' \";\n }\n sql += \"ORDER BY table_schema, table_name, ordinal_position \";\n\n QSqlQuery query(*m_db);\n if (!query.exec(sql)) {\n qDebug() << query.lastError().text();\n return schemas;\n }\n\n bool first = true;\n bool ruptureSchema = false;\n bool ruptureTable = false;\n SqlSchema s;\n SqlTable t;\n while (query.next()) {\n \/\/ Schémas\n ruptureSchema = s.name != query.value(0).toString();\n\n if (ruptureSchema && s.name != \"\") {\n s.tables << t;\n schemas << s;\n }\n\n if (ruptureSchema) {\n s = SqlSchema();\n s.name = query.value(0).toString();\n s.defaultSchema = s.name == \"public\";\n }\n\n \/\/ Tables\n ruptureTable = t.name != query.value(1).toString();\n\n if (first || (ruptureTable && !ruptureSchema && t.name != \"\")) {\n first = false;\n s.tables << t;\n }\n\n if (ruptureTable) {\n t = SqlTable();\n t.name = query.value(1).toString();\n if (query.value(2).toString() == \"BASE TABLE\") {\n t.type = Table;\n } else if (query.value(2).toString() == \"VIEW\") {\n t.type = ViewTable;\n }\n }\n\n \/\/ Colonnes\n SqlColumn c;\n c.name = query.value(3).toString();\n c.permitsNull = query.value(4).toBool();\n c.primaryKey = false;\n c.defaultValue = query.value(6);\n t.columns << c;\n }\n\n if (s.name.length() > 0) {\n if (t.name.length() > 0) {\n s.tables << t;\n }\n schemas << s;\n }\n\n return schemas;\n}\n\nSqlTable PsqlWrapper::table(QString t) {\n SqlTable table;\n\n if (!m_db) {\n return table;\n }\n\n QString sql;\n sql += \"SELECT schemaname, typname, 'T', attname, attnotnull, attlen, attnum \";\n sql += \"FROM pg_attribute, pg_type, pg_tables \";\n sql += \"WHERE attrelid = typrelid \";\n sql += \"AND attname NOT IN ('cmin', 'cmax', 'ctid', 'oid', \";\n sql += \"'tableoid', 'xmin', 'xmax') \";\n sql += \"AND typname = tablename \";\n sql += \"AND typname = '\" + t + \"' \";\n\n\n sql += \"UNION \";\n\n sql += \"SELECT schemaname, typname, 'V', attname, attnotnull, attlen, attnum \";\n sql += \"FROM pg_attribute, pg_type, pg_views \";\n sql += \"WHERE attrelid = typrelid \";\n sql += \"AND attname NOT IN ('cmin', 'cmax', 'ctid', 'oid', \";\n sql += \"'tableoid', 'xmin', 'xmax') \";\n sql += \"AND typname = viewname \";\n sql += \"AND typname = '\" + t + \"' \";\n\n sql += \"ORDER BY schemaname, typname, attnum \";\n\n QSqlQuery query(*m_db);\n if (!query.exec(sql)) {\n qDebug() << query.lastError().text();\n return table;\n }\n\n bool first = true;\n while (query.next()) {\n if (first) {\n table.name = query.value(1).toString();\n if (query.value(2).toString() == \"T\") {\n table.type = Table;\n } else if (query.value(2).toString() == \"V\") {\n table.type = ViewTable;\n }\n first = false;\n }\n\n \/\/ Colonnes\n SqlColumn c;\n c.name = query.value(3).toString();\n c.permitsNull = query.value(4).toBool();\n c.primaryKey = false;\n table.columns << c;\n }\n\n return table;\n}\n\nQ_EXPORT_PLUGIN2(dbm_psql_wrapper, PsqlWrapper)\n<commit_msg>Problème table + schémas<commit_after>#include \"psqlwrapper.h\"\n\n#include <QDebug>\n#include <QSettings>\n#include <QSqlError>\n#include <QSqlQuery>\n#include <QVariant>\n\nbool PsqlWrapper::informationSchemaHidden = true;\nbool PsqlWrapper::pgCatalogHidden = true;\n\nPsqlWrapper::PsqlWrapper(QSqlDatabase *db)\n : QObject(NULL) {\n m_db = db;\n\n QSettings s;\n s.beginGroup(plid());\n informationSchemaHidden = s.value(\"informationSchemaHidden\", true).toBool();\n pgCatalogHidden = s.value(\"pgCatalogHidden\", true).toBool();\n s.endGroup();\n\n m_configDialog = new PsqlConfig(this);\n}\n\nSqlWrapper::WrapperFeatures PsqlWrapper::features() {\n return ODBC | Schemas;\n}\n\nSqlWrapper* PsqlWrapper::newInstance(QSqlDatabase *db) {\n return new PsqlWrapper(db);\n}\n\nvoid PsqlWrapper::save() {\n QSettings s;\n s.beginGroup(plid());\n s.setValue(\"informationSchemaHidden\", informationSchemaHidden);\n s.setValue(\"pgCatalogHidden\", pgCatalogHidden);\n s.endGroup();\n}\n\n\/**\n * Récupération d'un schéma\n *\/\nSqlSchema PsqlWrapper::schema(QString sch) {\n SqlSchema schema;\n\n if (!m_db) {\n return schema;\n }\n\n QString sql;\n sql += \"SELECT '\" + sch + \"', t.table_name, t.table_type, c.column_name, \";\n sql += \"c.is_nullable, c.data_type, c.column_default \";\n sql += \"FROM INFORMATION_SCHEMA.COLUMNS C \";\n sql += \"INNER JOIN INFORMATION_SCHEMA.TABLES T \";\n sql += \"ON C.TABLE_NAME = T.TABLE_NAME \";\n sql += \"AND C.TABLE_SCHEMA = T.TABLE_SCHEMA \";\n sql += \"WHERE t.table_catalog='\" + m_db->databaseName() + \"' \";\n sql += \"AND t.table_schema='\" + sch + \"' \";\n sql += \"ORDER BY table_name, ordinal_position \";\n\n QSqlQuery query(*m_db);\n if (!query.exec(sql)) {\n qDebug() << query.lastError().text();\n return schema;\n }\n\n bool ruptureTable = false;\n SqlTable t;\n while (query.next()) {\n schema.name = query.value(0).toString();\n schema.defaultSchema = schema.name == \"public\";\n\n \/\/ Tables\n ruptureTable = t.name != query.value(1).toString();\n\n if (ruptureTable) {\n if (t.name.length() > 0) {\n schema.tables << t;\n }\n\n t = SqlTable();\n t.name = query.value(1).toString();\n if (query.value(2).toString() == \"BASE TABLE\") {\n t.type = Table;\n } else if (query.value(2).toString() == \"VIEW\") {\n t.type = ViewTable;\n }\n }\n\n \/\/ Colonnes\n SqlColumn c;\n c.name = query.value(3).toString();\n c.permitsNull = query.value(4).toBool();\n c.primaryKey = false;\n t.columns << c;\n }\n\n if (t.name.length() > 0) {\n schema.tables << t;\n }\n\n return schema;\n}\n\n\/**\n * Récupération de la liste des tables\n *\/\nQList<SqlSchema> PsqlWrapper::schemas() {\n QList<SqlSchema> schemas;\n\n if (!m_db) {\n return schemas;\n }\n\n QString sql;\n sql += \"SELECT t.table_schema, t.table_name, t.table_type, c.column_name, \";\n sql += \"c.is_nullable, c.data_type, c.column_default \";\n sql += \"FROM INFORMATION_SCHEMA.COLUMNS C \";\n sql += \"INNER JOIN INFORMATION_SCHEMA.TABLES T \";\n sql += \"ON C.TABLE_NAME = T.TABLE_NAME \";\n sql += \"AND C.TABLE_SCHEMA = T.TABLE_SCHEMA \";\n sql += \"WHERE t.table_catalog='\" + m_db->databaseName() + \"' \";\n if (informationSchemaHidden) {\n sql += \"AND t.table_schema <> 'information_schema' \";\n }\n if (pgCatalogHidden) {\n sql += \"AND t.table_schema <> 'pg_catalog' \";\n }\n sql += \"ORDER BY table_schema, table_name, ordinal_position \";\n\n QSqlQuery query(*m_db);\n if (!query.exec(sql)) {\n qDebug() << query.lastError().text();\n return schemas;\n }\n\n bool first = true;\n bool ruptureSchema = false;\n bool ruptureTable = false;\n SqlSchema s;\n SqlTable t;\n while (query.next()) {\n \/\/ Schémas\n ruptureSchema = s.name != query.value(0).toString();\n\n if (ruptureSchema && s.name != \"\") {\n s.tables << t;\n schemas << s;\n }\n\n if (ruptureSchema) {\n s = SqlSchema();\n s.name = query.value(0).toString();\n s.defaultSchema = s.name == \"public\";\n }\n\n \/\/ Tables\n ruptureTable = t.name != query.value(1).toString();\n\n if (first || (ruptureTable && !ruptureSchema && t.name != \"\")) {\n first = false;\n s.tables << t;\n }\n\n if (ruptureTable) {\n t = SqlTable();\n t.name = query.value(1).toString();\n if (query.value(2).toString() == \"BASE TABLE\") {\n t.type = Table;\n } else if (query.value(2).toString() == \"VIEW\") {\n t.type = ViewTable;\n }\n }\n\n \/\/ Colonnes\n SqlColumn c;\n c.name = query.value(3).toString();\n c.permitsNull = query.value(4).toBool();\n c.primaryKey = false;\n c.defaultValue = query.value(6);\n t.columns << c;\n }\n\n if (s.name.length() > 0) {\n if (t.name.length() > 0) {\n s.tables << t;\n }\n schemas << s;\n }\n\n return schemas;\n}\n\nSqlTable PsqlWrapper::table(QString t) {\n SqlTable table;\n\n if (!m_db) {\n return table;\n }\n\n QString sch = \"\";\n if (t.contains(\".\")) {\n sch = t.left(t.indexOf(\".\"));\n t = t.right(t.indexOf(\".\") + 2);\n }\n\n qDebug() << sch << t;\n\n QString sql;\n sql += \"SELECT t.table_schema, t.table_name, t.table_type, c.column_name, \";\n sql += \"c.is_nullable, c.data_type, c.column_default \";\n sql += \"FROM INFORMATION_SCHEMA.COLUMNS C \";\n sql += \"INNER JOIN INFORMATION_SCHEMA.TABLES T \";\n sql += \"ON C.TABLE_NAME = T.TABLE_NAME \";\n sql += \"AND C.TABLE_SCHEMA = T.TABLE_SCHEMA \";\n sql += \"WHERE t.table_catalog='\" + m_db->databaseName() + \"' \";\n if (sch.length() > 0) {\n sql += \"AND t.table_schema = '\" + sch + \"'\";\n }\n sql += \"AND t.table_name = '\" + t + \"' \";\n sql += \"ORDER BY ordinal_position \";\n\n QSqlQuery query(*m_db);\n if (!query.exec(sql)) {\n qDebug() << query.lastError().text();\n return table;\n }\n\n bool first = true;\n while (query.next()) {\n if (first) {\n table.name = query.value(1).toString();\n if (query.value(2).toString() == \"T\") {\n table.type = Table;\n } else if (query.value(2).toString() == \"V\") {\n table.type = ViewTable;\n }\n first = false;\n }\n\n \/\/ Colonnes\n SqlColumn c;\n c.name = query.value(3).toString();\n c.permitsNull = query.value(4).toBool();\n c.primaryKey = false;\n table.columns << c;\n }\n\n return table;\n}\n\nQ_EXPORT_PLUGIN2(dbm_psql_wrapper, PsqlWrapper)\n<|endoftext|>"} {"text":"<commit_before>\/* -*- coding: utf-8; mode: c++; tab-width: 3; indent-tabs-mode: nil -*-\n\nCopyright 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::static_list\n\nnamespace abc {\n\n\/\/! Base for classes containing static lists of other (node) classes.\ntemplate <class TContainer, class TValue>\nclass static_list {\npublic:\n \/\/! Base class for nodes of static_list.\n class node {\n private:\n friend class static_list;\n friend class iterator;\n\n protected:\n \/\/! Constructor.\n node() {\n static_list::append(this);\n }\n node(node const &) {\n \/\/ Skip copying the source’s links.\n static_list::append(this);\n }\n\n \/\/! Destructor.\n ~node() {\n static_list::remove(this);\n }\n\n \/*! Assignment operator.\n\n @return\n *this.\n *\/\n node & operator=(node const &) {\n \/\/ Skip copying the source’s links.\n return *this;\n }\n\n private:\n \/*! Returns a pointer to the next node.\n\n @param pnPrev\n Pointer to the previous node.\n *\/\n node * get_next(node * pnPrev) {\n return reinterpret_cast<node *>(\n m_iPrevXorNext ^ reinterpret_cast<std::uintptr_t>(pnPrev)\n );\n }\n\n \/*! Returns a pointer to the previous node.\n\n @param pnNext\n Pointer to the next node.\n *\/\n node * get_prev(node * pnNext) {\n return reinterpret_cast<node *>(\n m_iPrevXorNext ^ reinterpret_cast<std::uintptr_t>(pnNext)\n );\n }\n\n \/*! Updates the previous\/next pointer.\n\n @param pnPrev\n Pointer to the previous node.\n @param pnNext\n Pointer to the next node.\n *\/\n void set_prev_next(node * pnPrev, node * pnNext) {\n m_iPrevXorNext = reinterpret_cast<std::uintptr_t>(pnPrev) ^\n reinterpret_cast<std::uintptr_t>(pnNext);\n }\n\n private:\n \/\/! Pointer to the previous node XOR pointer to the next node.\n std::uintptr_t m_iPrevXorNext;\n };\n\n \/\/! Iterator for static_list::node subclasses.\n class iterator : public std::iterator<std::bidirectional_iterator_tag, TValue> {\n public:\n \/*! Constructor.\n\n @param pnCurr\n Pointer to the current node.\n @param pnNext\n Pointer to the node following *pnCurr.\n *\/\n iterator(node * pnCurr, node * pnNext) :\n m_pnCurr(pnCurr),\n m_pnNext(pnNext) {\n }\n\n \/*! Dereferencing operator.\n\n @return\n Reference to the current node.\n *\/\n TValue & operator*() const {\n return *static_cast<TValue *>(m_pnCurr);\n }\n\n \/*! Dereferencing member access operator.\n\n @return\n Pointer to the current node.\n *\/\n TValue * operator->() const {\n return static_cast<TValue *>(m_pnCurr);\n }\n\n \/*! Preincrement operator.\n\n @return\n *this after it’s moved to the node following the one currently pointed to by.\n *\/\n iterator & operator++() {\n node * pnNewPrev = m_pnCurr;\n m_pnCurr = m_pnNext;\n m_pnNext = m_pnCurr->get_next(pnNewPrev);\n return *this;\n }\n\n \/*! Postincrement operator.\n\n @return\n Iterator pointing to the node following the one pointed to by this iterator.\n *\/\n iterator operator++(int) {\n node * pnNewPrev = m_pnCurr;\n m_pnCurr = m_pnNext;\n m_pnNext = m_pnCurr->get_next(pnNewPrev);\n return iterator(pnNewPrev, m_pnCurr);\n }\n\n \/*! Predecrement operator.\n\n @return\n *this after it’s moved to the node preceding the one currently pointed to by.\n *\/\n iterator & operator--() {\n node * pnNewNext = m_pnCurr;\n m_pnCurr = m_pnCurr->get_prev(m_pnNext);\n m_pnNext = pnNewNext;\n return *this;\n }\n\n \/*! Postdecrement operator.\n\n @return\n Iterator pointing to the node preceding the one pointed to by this iterator.\n *\/\n iterator operator--(int) {\n node * pnNewNextNext = m_pnNext;\n m_pnNext = m_pnCurr;\n m_pnCurr = m_pnCurr->get_prev(pnNewNextNext);\n return iterator(m_pnNext, pnNewNextNext);\n }\n\n\/\/ Relational operators.\n#define ABC_RELOP_IMPL(op) \\\n bool operator op(iterator const & it) const { \\\n return m_pnCurr op it.m_pnCurr; \\\n }\nABC_RELOP_IMPL(==)\nABC_RELOP_IMPL(!=)\n#undef ABC_RELOP_IMPL\n\n \/*! Returns the underlying iterator type.\n\n @return\n Pointer to the current node.\n *\/\n node * base() const {\n return m_pnCurr;\n }\n\n private:\n \/\/! Pointer to the current node.\n node * m_pnCurr;\n \/\/! Pointer to the next node.\n node * m_pnNext;\n };\n\n typedef std::reverse_iterator<iterator> reverse_iterator;\n\npublic:\n \/*! Returns a forward iterator to the start of the list.\n\n @return\n Iterator to the first node in the list.\n *\/\n static iterator begin() {\n node * pnFirst = TContainer::sm_pnFirst;\n return iterator(pnFirst, pnFirst ? pnFirst->get_next(nullptr) : nullptr);\n }\n\n \/*! Returns a forward iterator to the end of the list.\n\n @return\n Iterator to the beyond the last node in the list.\n *\/\n static iterator end() {\n return iterator(TContainer::sm_pnLast, nullptr);\n }\n\n \/*! Returns a reverse iterator to the end of the list.\n\n @return\n Reverse Iterator to the last node in the list.\n *\/\n static reverse_iterator rbegin() {\n return reverse_iterator(end());\n }\n\n \/*! Returns a reverse iterator to the start of the list.\n\n @return\n Reverse iterator to the before the first node in the list.\n *\/\n static reverse_iterator rend() {\n return reverse_iterator(begin());\n }\n\nprivate:\n \/*! Add a node to the end of the list.\n\n @param pn\n Pointer to the node to append.\n *\/\n static void append(node * pn) {\n pn->set_prev_next(nullptr, TContainer::sm_pnLast);\n if (!TContainer::sm_pnFirst) {\n TContainer::sm_pnFirst = pn;\n } else if (node * pnLast = TContainer::sm_pnLast) {\n pnLast->set_prev_next(pn, pnLast->get_next(nullptr));\n }\n TContainer::sm_pnLast = pn;\n }\n\n \/*! Removes a node from the list.\n\n @param pn\n Pointer to the node to remove.\n *\/\n static void remove(node * pn) {\n \/\/ Find pn in the list.\n for (\n node * pnCurr = TContainer::sm_pnFirst, * pnPrev = nullptr;\n pnCurr != TContainer::sm_pnLast;\n std::tie(pnPrev, pnCurr) = std::make_tuple(pnCurr, pnCurr->get_next(pnPrev))\n ) {\n if (pnCurr == pn) {\n node * pnNext = pn->get_next(pnPrev);\n if (pnPrev) {\n pnPrev->set_prev_next(pnPrev->get_prev(pn), pnNext);\n } else if (TContainer::sm_pnFirst == pn) {\n TContainer::sm_pnFirst = pnNext;\n }\n if (pnNext) {\n pnNext->set_prev_next(pnPrev, pnNext->get_next(pn));\n } else if (TContainer::sm_pnLast == pn) {\n TContainer::sm_pnLast = pnPrev;\n }\n pn->set_prev_next(nullptr, nullptr);\n break;\n }\n }\n }\n};\n\n} \/\/namespace abc\n\n\/*! Declares the static member variables for the specified abc::static_list-derived class.\n\n@param container\n Class derived from abc::static_list.\n*\/\n#define ABC_STATIC_LIST_DECLARE_SUBCLASS_STATIC_MEMBERS(container) \\\n static node * sm_pnFirst; \\\n static node * sm_pnLast;\n\n\/*! Defines the static member variables for the specified abc::static_list-derived class.\n\n@param container\n Class derived from abc::static_list.\n*\/\n#define ABC_STATIC_LIST_DEFINE_SUBCLASS_STATIC_MEMBERS(container) \\\n container::node * container::sm_pnFirst = nullptr; \\\n container::node * container::sm_pnLast = nullptr;\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n<commit_msg>Fix abc::static_list::iterator skipping last list element<commit_after>\/* -*- coding: utf-8; mode: c++; tab-width: 3; indent-tabs-mode: nil -*-\n\nCopyright 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::static_list\n\nnamespace abc {\n\n\/\/! Base for classes containing static lists of other (node) classes.\ntemplate <class TContainer, class TValue>\nclass static_list {\npublic:\n \/\/! Base class for nodes of static_list.\n class node {\n private:\n friend class static_list;\n friend class iterator;\n\n protected:\n \/\/! Constructor.\n node() {\n static_list::append(this);\n }\n node(node const &) {\n \/\/ Skip copying the source’s links.\n static_list::append(this);\n }\n\n \/\/! Destructor.\n ~node() {\n static_list::remove(this);\n }\n\n \/*! Assignment operator.\n\n @return\n *this.\n *\/\n node & operator=(node const &) {\n \/\/ Skip copying the source’s links.\n return *this;\n }\n\n private:\n \/*! Returns a pointer to the next node.\n\n @param pnPrev\n Pointer to the previous node.\n *\/\n node * get_next(node * pnPrev) {\n return reinterpret_cast<node *>(\n m_iPrevXorNext ^ reinterpret_cast<std::uintptr_t>(pnPrev)\n );\n }\n\n \/*! Returns a pointer to the previous node.\n\n @param pnNext\n Pointer to the next node.\n *\/\n node * get_prev(node * pnNext) {\n return reinterpret_cast<node *>(\n m_iPrevXorNext ^ reinterpret_cast<std::uintptr_t>(pnNext)\n );\n }\n\n \/*! Updates the previous\/next pointer.\n\n @param pnPrev\n Pointer to the previous node.\n @param pnNext\n Pointer to the next node.\n *\/\n void set_prev_next(node * pnPrev, node * pnNext) {\n m_iPrevXorNext = reinterpret_cast<std::uintptr_t>(pnPrev) ^\n reinterpret_cast<std::uintptr_t>(pnNext);\n }\n\n private:\n \/\/! Pointer to the previous node XOR pointer to the next node.\n std::uintptr_t m_iPrevXorNext;\n };\n\n \/\/! Iterator for static_list::node subclasses.\n class iterator : public std::iterator<std::bidirectional_iterator_tag, TValue> {\n public:\n \/*! Constructor.\n\n @param pnPrev\n Pointer to the node preceding *pnCurr.\n @param pnCurr\n Pointer to the current node.\n @param pnNext\n Pointer to the node following *pnCurr.\n *\/\n iterator(node * pnPrev, node * pnCurr, node * pnNext) :\n m_pnPrev(pnPrev),\n m_pnCurr(pnCurr),\n m_pnNext(pnNext) {\n }\n\n \/*! Dereferencing operator.\n\n @return\n Reference to the current node.\n *\/\n TValue & operator*() const {\n return *static_cast<TValue *>(m_pnCurr);\n }\n\n \/*! Dereferencing member access operator.\n\n @return\n Pointer to the current node.\n *\/\n TValue * operator->() const {\n return static_cast<TValue *>(m_pnCurr);\n }\n\n \/*! Preincrement operator.\n\n @return\n *this after it’s moved to the node following the one currently pointed to by.\n *\/\n iterator & operator++() {\n m_pnPrev = m_pnCurr;\n m_pnCurr = m_pnNext;\n m_pnNext = m_pnCurr ? m_pnCurr->get_next(m_pnPrev) : nullptr;\n return *this;\n }\n\n \/*! Postincrement operator.\n\n @return\n Iterator pointing to the node following the one pointed to by this iterator.\n *\/\n iterator operator++(int) {\n node * pnPrevPrev = m_pnPrev;\n operator++();\n return iterator(pnPrevPrev, m_pnPrev, m_pnCurr);\n }\n\n \/*! Predecrement operator.\n\n @return\n *this after it’s moved to the node preceding the one currently pointed to by.\n *\/\n iterator & operator--() {\n m_pnNext = m_pnCurr;\n m_pnCurr = m_pnPrev;\n m_pnPrev = m_pnCurr ? m_pnCurr->get_prev(m_pnNext) : nullptr;\n return *this;\n }\n\n \/*! Postdecrement operator.\n\n @return\n Iterator pointing to the node preceding the one pointed to by this iterator.\n *\/\n iterator operator--(int) {\n node * pnNextNext = m_pnNext;\n operator--();\n return iterator(m_pnCurr, m_pnNext, pnNextNext);\n }\n\n\/\/ Relational operators.\n#define ABC_RELOP_IMPL(op) \\\n bool operator op(iterator const & it) const { \\\n return m_pnCurr op it.m_pnCurr; \\\n }\nABC_RELOP_IMPL(==)\nABC_RELOP_IMPL(!=)\n#undef ABC_RELOP_IMPL\n\n \/*! Returns the underlying iterator type.\n\n @return\n Pointer to the current node.\n *\/\n node * base() const {\n return m_pnCurr;\n }\n\n private:\n \/\/! Pointer to the previous node.\n node * m_pnPrev;\n \/\/! Pointer to the current node.\n node * m_pnCurr;\n \/\/! Pointer to the next node.\n node * m_pnNext;\n };\n\n typedef std::reverse_iterator<iterator> reverse_iterator;\n\npublic:\n \/*! Returns a forward iterator to the start of the list.\n\n @return\n Iterator to the first node in the list.\n *\/\n static iterator begin() {\n node * pnFirst = TContainer::sm_pnFirst;\n return iterator(nullptr, pnFirst, pnFirst ? pnFirst->get_next(nullptr) : nullptr);\n }\n\n \/*! Returns a forward iterator to the end of the list.\n\n @return\n Iterator to the beyond the last node in the list.\n *\/\n static iterator end() {\n return iterator(TContainer::sm_pnLast, nullptr, nullptr);\n }\n\n \/*! Returns a reverse iterator to the end of the list.\n\n @return\n Reverse Iterator to the last node in the list.\n *\/\n static reverse_iterator rbegin() {\n return reverse_iterator(end());\n }\n\n \/*! Returns a reverse iterator to the start of the list.\n\n @return\n Reverse iterator to the before the first node in the list.\n *\/\n static reverse_iterator rend() {\n return reverse_iterator(begin());\n }\n\nprivate:\n \/*! Add a node to the end of the list.\n\n @param pn\n Pointer to the node to append.\n *\/\n static void append(node * pn) {\n pn->set_prev_next(nullptr, TContainer::sm_pnLast);\n if (!TContainer::sm_pnFirst) {\n TContainer::sm_pnFirst = pn;\n } else if (node * pnLast = TContainer::sm_pnLast) {\n pnLast->set_prev_next(pn, pnLast->get_next(nullptr));\n }\n TContainer::sm_pnLast = pn;\n }\n\n \/*! Removes a node from the list.\n\n @param pn\n Pointer to the node to remove.\n *\/\n static void remove(node * pn) {\n \/\/ Find pn in the list.\n for (\n node * pnCurr = TContainer::sm_pnFirst, * pnPrev = nullptr;\n pnCurr != TContainer::sm_pnLast;\n std::tie(pnPrev, pnCurr) = std::make_tuple(pnCurr, pnCurr->get_next(pnPrev))\n ) {\n if (pnCurr == pn) {\n node * pnNext = pn->get_next(pnPrev);\n if (pnPrev) {\n pnPrev->set_prev_next(pnPrev->get_prev(pn), pnNext);\n } else if (TContainer::sm_pnFirst == pn) {\n TContainer::sm_pnFirst = pnNext;\n }\n if (pnNext) {\n pnNext->set_prev_next(pnPrev, pnNext->get_next(pn));\n } else if (TContainer::sm_pnLast == pn) {\n TContainer::sm_pnLast = pnPrev;\n }\n pn->set_prev_next(nullptr, nullptr);\n break;\n }\n }\n }\n};\n\n} \/\/namespace abc\n\n\/*! Declares the static member variables for the specified abc::static_list-derived class.\n\n@param container\n Class derived from abc::static_list.\n*\/\n#define ABC_STATIC_LIST_DECLARE_SUBCLASS_STATIC_MEMBERS(container) \\\n static node * sm_pnFirst; \\\n static node * sm_pnLast;\n\n\/*! Defines the static member variables for the specified abc::static_list-derived class.\n\n@param container\n Class derived from abc::static_list.\n*\/\n#define ABC_STATIC_LIST_DEFINE_SUBCLASS_STATIC_MEMBERS(container) \\\n container::node * container::sm_pnFirst = nullptr; \\\n container::node * container::sm_pnLast = nullptr;\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n<|endoftext|>"} {"text":"<commit_before>\/* Copyright 2019 Axel Huebl, Benjamin Worpitz, René Widera\n *\n * This file is part of Alpaka.\n *\n * This Source Code Form is subject to the terms of the Mozilla Public\n * License, v. 2.0. If a copy of the MPL was not distributed with this\n * file, You can obtain one at http:\/\/mozilla.org\/MPL\/2.0\/.\n *\/\n\n#pragma once\n\n#include <alpaka\/vec\/Vec.hpp>\n#include <alpaka\/core\/Common.hpp>\n#include <alpaka\/core\/Unused.hpp>\n\n#include <alpaka\/dim\/Traits.hpp>\n#include <alpaka\/idx\/Traits.hpp>\n#include <alpaka\/queue\/Traits.hpp>\n\n#include <alpaka\/core\/BoostPredef.hpp>\n#include <alpaka\/core\/Debug.hpp>\n#if ALPAKA_DEBUG >= ALPAKA_DEBUG_FULL\n #include <alpaka\/workdiv\/Traits.hpp>\n#endif\n\n#include <type_traits>\n\n\/\/-----------------------------------------------------------------------------\n\/\/! The alpaka accelerator library.\nnamespace alpaka\n{\n \/\/-----------------------------------------------------------------------------\n \/\/! The kernel specifics.\n namespace kernel\n {\n \/\/-----------------------------------------------------------------------------\n \/\/! The kernel traits.\n namespace traits\n {\n \/\/#############################################################################\n \/\/! The kernel execution task creation trait.\n template<\n typename TAcc,\n typename TWorkDiv,\n typename TKernelFnObj,\n typename... TArgs\/*,\n typename TSfinae = void*\/>\n struct CreateTaskKernel;\n\n \/\/#############################################################################\n \/\/! The trait for getting the size of the block shared dynamic memory of a kernel.\n \/\/!\n \/\/! \\tparam TKernelFnObj The kernel function object.\n \/\/! \\tparam TAcc The accelerator.\n \/\/!\n \/\/! The default implementation returns 0.\n template<\n typename TKernelFnObj,\n typename TAcc,\n typename TSfinae = void>\n struct BlockSharedMemDynSizeBytes\n {\n#if BOOST_COMP_CLANG\n #pragma clang diagnostic push\n #pragma clang diagnostic ignored \"-Wdocumentation\" \/\/ clang does not support the syntax for variadic template arguments \"args,...\"\n#endif\n \/\/-----------------------------------------------------------------------------\n \/\/! \\param kernelFnObj The kernel object for which the block shared memory size should be calculated.\n \/\/! \\param blockThreadExtent The block thread extent.\n \/\/! \\param threadElemExtent The thread element extent.\n \/\/! \\tparam TArgs The kernel invocation argument types pack.\n \/\/! \\param args,... The kernel invocation arguments.\n \/\/! \\return The size of the shared memory allocated for a block in bytes.\n \/\/! The default version always returns zero.\n#if BOOST_COMP_CLANG\n #pragma clang diagnostic pop\n#endif\n ALPAKA_NO_HOST_ACC_WARNING\n template<\n typename TDim,\n typename... TArgs>\n ALPAKA_FN_HOST_ACC static auto getBlockSharedMemDynSizeBytes(\n TKernelFnObj const & kernelFnObj,\n vec::Vec<TDim, idx::Idx<TAcc>> const & blockThreadExtent,\n vec::Vec<TDim, idx::Idx<TAcc>> const & threadElemExtent,\n TArgs const & ... args)\n -> idx::Idx<TAcc>\n {\n alpaka::ignore_unused(kernelFnObj);\n alpaka::ignore_unused(blockThreadExtent);\n alpaka::ignore_unused(threadElemExtent);\n alpaka::ignore_unused(args...);\n\n return 0;\n }\n };\n }\n\n#if BOOST_COMP_CLANG\n #pragma clang diagnostic push\n #pragma clang diagnostic ignored \"-Wdocumentation\" \/\/ clang does not support the syntax for variadic template arguments \"args,...\"\n#endif\n \/\/-----------------------------------------------------------------------------\n \/\/! \\tparam TAcc The accelerator type.\n \/\/! \\param kernelFnObj The kernel object for which the block shared memory size should be calculated.\n \/\/! \\param blockThreadExtent The block thread extent.\n \/\/! \\param threadElemExtent The thread element extent.\n \/\/! \\param args,... The kernel invocation arguments.\n \/\/! \\return The size of the shared memory allocated for a block in bytes.\n \/\/! The default implementation always returns zero.\n#if BOOST_COMP_CLANG\n #pragma clang diagnostic pop\n#endif\n ALPAKA_NO_HOST_ACC_WARNING\n template<\n typename TAcc,\n typename TKernelFnObj,\n typename TDim,\n typename... TArgs>\n ALPAKA_FN_HOST_ACC auto getBlockSharedMemDynSizeBytes(\n TKernelFnObj const & kernelFnObj,\n vec::Vec<TDim, idx::Idx<TAcc>> const & blockThreadExtent,\n vec::Vec<TDim, idx::Idx<TAcc>> const & threadElemExtent,\n TArgs const & ... args)\n -> idx::Idx<TAcc>\n {\n return\n traits::BlockSharedMemDynSizeBytes<\n TKernelFnObj,\n TAcc>\n ::getBlockSharedMemDynSizeBytes(\n kernelFnObj,\n blockThreadExtent,\n threadElemExtent,\n args...);\n }\n\n#if BOOST_COMP_CLANG\n #pragma clang diagnostic push\n #pragma clang diagnostic ignored \"-Wdocumentation\" \/\/ clang does not support the syntax for variadic template arguments \"args,...\"\n#endif\n\n namespace detail\n {\n \/\/#############################################################################\n \/\/! Check that the return of TKernelFnObj is void\n template<\n typename TAcc,\n typename TSfinae = void>\n struct CheckFnReturnType\n {\n template<\n typename TKernelFnObj,\n typename... TArgs>\n void operator()(\n TKernelFnObj const &,\n TArgs const & ...)\n {\n static_assert(\n std::is_same<std::result_of_t<TKernelFnObj(TAcc const &, TArgs const & ...)>, void>::value,\n \"The TKernelFnObj is required to return void!\");\n }\n };\n }\n \/\/-----------------------------------------------------------------------------\n \/\/! Creates a kernel execution task.\n \/\/!\n \/\/! \\tparam TAcc The accelerator type.\n \/\/! \\param workDiv The index domain work division.\n \/\/! \\param kernelFnObj The kernel function object which should be executed.\n \/\/! \\param args,... The kernel invocation arguments.\n \/\/! \\return The kernel execution task.\n#if BOOST_COMP_CLANG\n #pragma clang diagnostic pop\n#endif\n template<\n typename TAcc,\n typename TWorkDiv,\n typename TKernelFnObj,\n typename... TArgs>\n ALPAKA_FN_HOST auto createTaskKernel(\n TWorkDiv const & workDiv,\n TKernelFnObj const & kernelFnObj,\n TArgs && ... args)\n {\n \/\/ check for void return type\n detail::CheckFnReturnType<TAcc>{}(kernelFnObj, args...);\n\n static_assert(\n dim::Dim<std::decay_t<TWorkDiv>>::value == dim::Dim<TAcc>::value,\n \"The dimensions of TAcc and TWorkDiv have to be identical!\");\n static_assert(\n std::is_same<idx::Idx<std::decay_t<TWorkDiv>>, idx::Idx<TAcc>>::value,\n \"The idx type of TAcc and the idx type of TWorkDiv have to be identical!\");\n\n#if ALPAKA_DEBUG >= ALPAKA_DEBUG_FULL\n std::cout << __func__\n << \" workDiv: \" << workDiv\n << \", kernelFnObj: \" << typeid(kernelFnObj).name()\n << std::endl;\n#endif\n return\n traits::CreateTaskKernel<\n TAcc,\n TWorkDiv,\n TKernelFnObj,\n TArgs...>::createTaskKernel(\n workDiv,\n kernelFnObj,\n std::forward<TArgs>(args)...);\n }\n\n#if BOOST_COMP_CLANG\n #pragma clang diagnostic push\n #pragma clang diagnostic ignored \"-Wdocumentation\" \/\/ clang does not support the syntax for variadic template arguments \"args,...\"\n#endif\n \/\/-----------------------------------------------------------------------------\n \/\/! Executes the given kernel in the given queue.\n \/\/!\n \/\/! \\tparam TAcc The accelerator type.\n \/\/! \\param queue The queue to enqueue the view copy task into.\n \/\/! \\param workDiv The index domain work division.\n \/\/! \\param kernelFnObj The kernel function object which should be executed.\n \/\/! \\param args,... The kernel invocation arguments.\n#if BOOST_COMP_CLANG\n #pragma clang diagnostic pop\n#endif\n template<\n typename TAcc,\n typename TQueue,\n typename TWorkDiv,\n typename TKernelFnObj,\n typename... TArgs>\n ALPAKA_FN_HOST auto exec(\n TQueue & queue,\n TWorkDiv const & workDiv,\n TKernelFnObj const & kernelFnObj,\n TArgs && ... args)\n -> void\n {\n queue::enqueue(\n queue,\n kernel::createTaskKernel<\n TAcc>(\n workDiv,\n kernelFnObj,\n std::forward<TArgs>(args)...));\n }\n }\n}\n<commit_msg>Use std::invoke_result_t instead of std::result_of_t when available<commit_after>\/* Copyright 2019 Axel Huebl, Benjamin Worpitz, René Widera\n *\n * This file is part of Alpaka.\n *\n * This Source Code Form is subject to the terms of the Mozilla Public\n * License, v. 2.0. If a copy of the MPL was not distributed with this\n * file, You can obtain one at http:\/\/mozilla.org\/MPL\/2.0\/.\n *\/\n\n#pragma once\n\n#include <alpaka\/vec\/Vec.hpp>\n#include <alpaka\/core\/Common.hpp>\n#include <alpaka\/core\/Unused.hpp>\n\n#include <alpaka\/dim\/Traits.hpp>\n#include <alpaka\/idx\/Traits.hpp>\n#include <alpaka\/queue\/Traits.hpp>\n\n#include <alpaka\/core\/BoostPredef.hpp>\n#include <alpaka\/core\/Debug.hpp>\n#if ALPAKA_DEBUG >= ALPAKA_DEBUG_FULL\n #include <alpaka\/workdiv\/Traits.hpp>\n#endif\n\n#include <type_traits>\n\n\/\/-----------------------------------------------------------------------------\n\/\/! The alpaka accelerator library.\nnamespace alpaka\n{\n \/\/-----------------------------------------------------------------------------\n \/\/! The kernel specifics.\n namespace kernel\n {\n \/\/-----------------------------------------------------------------------------\n \/\/! The kernel traits.\n namespace traits\n {\n \/\/#############################################################################\n \/\/! The kernel execution task creation trait.\n template<\n typename TAcc,\n typename TWorkDiv,\n typename TKernelFnObj,\n typename... TArgs\/*,\n typename TSfinae = void*\/>\n struct CreateTaskKernel;\n\n \/\/#############################################################################\n \/\/! The trait for getting the size of the block shared dynamic memory of a kernel.\n \/\/!\n \/\/! \\tparam TKernelFnObj The kernel function object.\n \/\/! \\tparam TAcc The accelerator.\n \/\/!\n \/\/! The default implementation returns 0.\n template<\n typename TKernelFnObj,\n typename TAcc,\n typename TSfinae = void>\n struct BlockSharedMemDynSizeBytes\n {\n#if BOOST_COMP_CLANG\n #pragma clang diagnostic push\n #pragma clang diagnostic ignored \"-Wdocumentation\" \/\/ clang does not support the syntax for variadic template arguments \"args,...\"\n#endif\n \/\/-----------------------------------------------------------------------------\n \/\/! \\param kernelFnObj The kernel object for which the block shared memory size should be calculated.\n \/\/! \\param blockThreadExtent The block thread extent.\n \/\/! \\param threadElemExtent The thread element extent.\n \/\/! \\tparam TArgs The kernel invocation argument types pack.\n \/\/! \\param args,... The kernel invocation arguments.\n \/\/! \\return The size of the shared memory allocated for a block in bytes.\n \/\/! The default version always returns zero.\n#if BOOST_COMP_CLANG\n #pragma clang diagnostic pop\n#endif\n ALPAKA_NO_HOST_ACC_WARNING\n template<\n typename TDim,\n typename... TArgs>\n ALPAKA_FN_HOST_ACC static auto getBlockSharedMemDynSizeBytes(\n TKernelFnObj const & kernelFnObj,\n vec::Vec<TDim, idx::Idx<TAcc>> const & blockThreadExtent,\n vec::Vec<TDim, idx::Idx<TAcc>> const & threadElemExtent,\n TArgs const & ... args)\n -> idx::Idx<TAcc>\n {\n alpaka::ignore_unused(kernelFnObj);\n alpaka::ignore_unused(blockThreadExtent);\n alpaka::ignore_unused(threadElemExtent);\n alpaka::ignore_unused(args...);\n\n return 0;\n }\n };\n }\n\n#if BOOST_COMP_CLANG\n #pragma clang diagnostic push\n #pragma clang diagnostic ignored \"-Wdocumentation\" \/\/ clang does not support the syntax for variadic template arguments \"args,...\"\n#endif\n \/\/-----------------------------------------------------------------------------\n \/\/! \\tparam TAcc The accelerator type.\n \/\/! \\param kernelFnObj The kernel object for which the block shared memory size should be calculated.\n \/\/! \\param blockThreadExtent The block thread extent.\n \/\/! \\param threadElemExtent The thread element extent.\n \/\/! \\param args,... The kernel invocation arguments.\n \/\/! \\return The size of the shared memory allocated for a block in bytes.\n \/\/! The default implementation always returns zero.\n#if BOOST_COMP_CLANG\n #pragma clang diagnostic pop\n#endif\n ALPAKA_NO_HOST_ACC_WARNING\n template<\n typename TAcc,\n typename TKernelFnObj,\n typename TDim,\n typename... TArgs>\n ALPAKA_FN_HOST_ACC auto getBlockSharedMemDynSizeBytes(\n TKernelFnObj const & kernelFnObj,\n vec::Vec<TDim, idx::Idx<TAcc>> const & blockThreadExtent,\n vec::Vec<TDim, idx::Idx<TAcc>> const & threadElemExtent,\n TArgs const & ... args)\n -> idx::Idx<TAcc>\n {\n return\n traits::BlockSharedMemDynSizeBytes<\n TKernelFnObj,\n TAcc>\n ::getBlockSharedMemDynSizeBytes(\n kernelFnObj,\n blockThreadExtent,\n threadElemExtent,\n args...);\n }\n\n#if BOOST_COMP_CLANG\n #pragma clang diagnostic push\n #pragma clang diagnostic ignored \"-Wdocumentation\" \/\/ clang does not support the syntax for variadic template arguments \"args,...\"\n#endif\n\n namespace detail\n {\n \/\/#############################################################################\n \/\/! Check that the return of TKernelFnObj is void\n template<\n typename TAcc,\n typename TSfinae = void>\n struct CheckFnReturnType\n {\n template<\n typename TKernelFnObj,\n typename... TArgs>\n void operator()(\n TKernelFnObj const &,\n TArgs const & ...)\n {\n#if defined(__cpp_lib_is_invocable) && __cpp_lib_is_invocable >= 201703\n using Result = std::invoke_result_t<TKernelFnObj, TAcc const &, TArgs const & ...>;\n#else\n using Result = std::result_of_t<TKernelFnObj(TAcc const &, TArgs const & ...)>;\n#endif\n static_assert(\n std::is_same<Result, void>::value,\n \"The TKernelFnObj is required to return void!\");\n }\n };\n }\n \/\/-----------------------------------------------------------------------------\n \/\/! Creates a kernel execution task.\n \/\/!\n \/\/! \\tparam TAcc The accelerator type.\n \/\/! \\param workDiv The index domain work division.\n \/\/! \\param kernelFnObj The kernel function object which should be executed.\n \/\/! \\param args,... The kernel invocation arguments.\n \/\/! \\return The kernel execution task.\n#if BOOST_COMP_CLANG\n #pragma clang diagnostic pop\n#endif\n template<\n typename TAcc,\n typename TWorkDiv,\n typename TKernelFnObj,\n typename... TArgs>\n ALPAKA_FN_HOST auto createTaskKernel(\n TWorkDiv const & workDiv,\n TKernelFnObj const & kernelFnObj,\n TArgs && ... args)\n {\n \/\/ check for void return type\n detail::CheckFnReturnType<TAcc>{}(kernelFnObj, args...);\n\n static_assert(\n dim::Dim<std::decay_t<TWorkDiv>>::value == dim::Dim<TAcc>::value,\n \"The dimensions of TAcc and TWorkDiv have to be identical!\");\n static_assert(\n std::is_same<idx::Idx<std::decay_t<TWorkDiv>>, idx::Idx<TAcc>>::value,\n \"The idx type of TAcc and the idx type of TWorkDiv have to be identical!\");\n\n#if ALPAKA_DEBUG >= ALPAKA_DEBUG_FULL\n std::cout << __func__\n << \" workDiv: \" << workDiv\n << \", kernelFnObj: \" << typeid(kernelFnObj).name()\n << std::endl;\n#endif\n return\n traits::CreateTaskKernel<\n TAcc,\n TWorkDiv,\n TKernelFnObj,\n TArgs...>::createTaskKernel(\n workDiv,\n kernelFnObj,\n std::forward<TArgs>(args)...);\n }\n\n#if BOOST_COMP_CLANG\n #pragma clang diagnostic push\n #pragma clang diagnostic ignored \"-Wdocumentation\" \/\/ clang does not support the syntax for variadic template arguments \"args,...\"\n#endif\n \/\/-----------------------------------------------------------------------------\n \/\/! Executes the given kernel in the given queue.\n \/\/!\n \/\/! \\tparam TAcc The accelerator type.\n \/\/! \\param queue The queue to enqueue the view copy task into.\n \/\/! \\param workDiv The index domain work division.\n \/\/! \\param kernelFnObj The kernel function object which should be executed.\n \/\/! \\param args,... The kernel invocation arguments.\n#if BOOST_COMP_CLANG\n #pragma clang diagnostic pop\n#endif\n template<\n typename TAcc,\n typename TQueue,\n typename TWorkDiv,\n typename TKernelFnObj,\n typename... TArgs>\n ALPAKA_FN_HOST auto exec(\n TQueue & queue,\n TWorkDiv const & workDiv,\n TKernelFnObj const & kernelFnObj,\n TArgs && ... args)\n -> void\n {\n queue::enqueue(\n queue,\n kernel::createTaskKernel<\n TAcc>(\n workDiv,\n kernelFnObj,\n std::forward<TArgs>(args)...));\n }\n }\n}\n<|endoftext|>"} {"text":"<commit_before>#ifndef APOLLO_CLASS_UTILITY_HPP_INCLUDED\n#define APOLLO_CLASS_UTILITY_HPP_INCLUDED APOLLO_CLASS_UTILITY_HPP_INCLUDED\n\n#include <apollo\/class.hpp>\n#include <apollo\/create_table.hpp>\n#include <apollo\/function.hpp>\n#include <apollo\/implicit_ctor.hpp>\n\nnamespace apollo {\n\nnamespace detail {\n\ntemplate <typename Cls, typename Parent>\nclass class_creator;\n\ntemplate <typename Derived>\nclass basic_classes_creator: public basic_table_setter<Derived>\n{\npublic:\n basic_classes_creator(lua_State* L, int table_idx)\n : basic_table_setter<Derived>(L, table_idx)\n { }\n\n template <typename Cls, typename... Bases, typename K>\n class_creator<Cls, Derived> cls(K&& key);\n};\n\nclass classes_creator: public basic_classes_creator<classes_creator>\n{\npublic:\n classes_creator(lua_State* L, int idx)\n : basic_classes_creator<classes_creator>(L, idx)\n { }\n};\n\ntemplate <typename T, typename Parent=void>\nclass class_creator: public basic_classes_creator<class_creator<T, Parent>> {\npublic:\n class_creator(lua_State* L, Parent* parent)\n : basic_classes_creator<class_creator<T, Parent>>(L, lua_gettop(L))\n , m_parent(parent)\n { }\n\n ~class_creator()\n {\n if (!m_parent)\n this->pop_table();\n }\n\n template<typename... Args>\n class_creator&& ctor(char const* name = \"new\")\n {\n return (*this)(name, get_raw_ctor_wrapper<T, Args...>());\n }\n\n \/\/ Implicit constructors \/\/\n\n template<typename... Args>\n class_creator&& implicit_ctor(char const* name)\n {\n implicit_only_ctor<Args...>();\n return ctor<Args...>(name);\n }\n\n template<typename F>\n class_creator&& implicit_ctor_f(char const* name, F f)\n {\n implicit_only_ctor_f(f);\n return (*this)(name, f);\n }\n\n template<typename... Args>\n class_creator&& implicit_only_ctor()\n {\n add_implicit_ctor(m_L, &ctor_wrapper<T, Args...>);\n return std::move(*this);\n }\n\n template<typename F>\n class_creator&& implicit_only_ctor_f(F f)\n {\n add_implicit_ctor(m_L, f);\n return std::move(*this);\n }\n\n \/\/ Misc \/\/\n\n typename std::add_rvalue_reference<Parent>::type end_cls()\n {\n m_parent->end_subtable();\n return std::move(*m_parent);\n \/\/ If you get an error about void here, you called end_cls() after\n \/\/ using export_class, but this is only neccessary to end the classes\n \/\/ created by .cls().\n }\n\nprivate:\n Parent* const m_parent; \/\/ variant class[es]_creator?\n\n};\n\ntemplate <typename Derived>\ntemplate <typename Cls, typename... Bases, typename K>\nclass_creator<Cls, Derived> basic_classes_creator<Derived>::cls(K&& key)\n{\n register_class<Cls, Bases...>(this->m_L);\n push_class_metatable<Cls>(this->m_L);\n this->top_subtable(std::forward<K>(key));\n return {this->m_L, static_cast<Derived*>(this)};\n}\n\n} \/\/ namespace detail\n\ntemplate <typename T>\nstruct converter<detail::class_creator<T>>\n : public converter<detail::table_setter>\n{};\n\ninline detail::classes_creator export_classes(lua_State* L, int into = 0)\n{\n if (!into) {\n lua_newtable(L);\n into = lua_gettop(L);\n }\n return detail::classes_creator(L, lua_absindex(L, into));\n}\n\ntemplate <typename T, typename... Bases>\ndetail::class_creator<T> export_class(lua_State* L)\n{\n register_class<T, Bases...>(L);\n push_class_metatable<T>(L);\n return detail::class_creator<T>(L, nullptr);\n}\n\n} \/\/ namespace apollo\n\n#endif \/\/ APOLLO_CLASS_UTILITY_HPP_INCLUDED\n<commit_msg>class_utility: Fix clang build.<commit_after>#ifndef APOLLO_CLASS_UTILITY_HPP_INCLUDED\n#define APOLLO_CLASS_UTILITY_HPP_INCLUDED APOLLO_CLASS_UTILITY_HPP_INCLUDED\n\n#include <apollo\/class.hpp>\n#include <apollo\/create_table.hpp>\n#include <apollo\/function.hpp>\n#include <apollo\/implicit_ctor.hpp>\n\nnamespace apollo {\n\nnamespace detail {\n\ntemplate <typename Cls, typename Parent>\nclass class_creator;\n\ntemplate <typename Derived>\nclass basic_classes_creator: public basic_table_setter<Derived>\n{\npublic:\n basic_classes_creator(lua_State* L, int table_idx)\n : basic_table_setter<Derived>(L, table_idx)\n { }\n\n template <typename Cls, typename... Bases, typename K>\n class_creator<Cls, Derived> cls(K&& key);\n};\n\nclass classes_creator: public basic_classes_creator<classes_creator>\n{\npublic:\n classes_creator(lua_State* L, int idx)\n : basic_classes_creator<classes_creator>(L, idx)\n { }\n};\n\ntemplate <typename T, typename Parent=void>\nclass class_creator: public basic_classes_creator<class_creator<T, Parent>> {\npublic:\n class_creator(lua_State* L, Parent* parent)\n : basic_classes_creator<class_creator<T, Parent>>(L, lua_gettop(L))\n , m_parent(parent)\n { }\n\n ~class_creator()\n {\n if (!m_parent)\n this->pop_table();\n }\n\n template<typename... Args>\n class_creator&& ctor(char const* name = \"new\")\n {\n return (*this)(name, get_raw_ctor_wrapper<T, Args...>());\n }\n\n \/\/ Implicit constructors \/\/\n\n template<typename... Args>\n class_creator&& implicit_ctor(char const* name)\n {\n implicit_only_ctor<Args...>();\n return ctor<Args...>(name);\n }\n\n template<typename F>\n class_creator&& implicit_ctor_f(char const* name, F f)\n {\n implicit_only_ctor_f(f);\n return (*this)(name, f);\n }\n\n template<typename... Args>\n class_creator&& implicit_only_ctor()\n {\n add_implicit_ctor(this->m_L, &ctor_wrapper<T, Args...>);\n return std::move(*this);\n }\n\n template<typename F>\n class_creator&& implicit_only_ctor_f(F f)\n {\n add_implicit_ctor(this->m_L, f);\n return std::move(*this);\n }\n\n \/\/ Misc \/\/\n\n typename std::add_rvalue_reference<Parent>::type end_cls()\n {\n m_parent->end_subtable();\n return std::move(*m_parent);\n \/\/ If you get an error about void here, you called end_cls() after\n \/\/ using export_class, but this is only neccessary to end the classes\n \/\/ created by .cls().\n }\n\nprivate:\n Parent* const m_parent; \/\/ variant class[es]_creator?\n\n};\n\ntemplate <typename Derived>\ntemplate <typename Cls, typename... Bases, typename K>\nclass_creator<Cls, Derived> basic_classes_creator<Derived>::cls(K&& key)\n{\n register_class<Cls, Bases...>(this->m_L);\n push_class_metatable<Cls>(this->m_L);\n this->top_subtable(std::forward<K>(key));\n return {this->m_L, static_cast<Derived*>(this)};\n}\n\n} \/\/ namespace detail\n\ntemplate <typename T>\nstruct converter<detail::class_creator<T>>\n : public converter<detail::table_setter>\n{};\n\ninline detail::classes_creator export_classes(lua_State* L, int into = 0)\n{\n if (!into) {\n lua_newtable(L);\n into = lua_gettop(L);\n }\n return detail::classes_creator(L, lua_absindex(L, into));\n}\n\ntemplate <typename T, typename... Bases>\ndetail::class_creator<T> export_class(lua_State* L)\n{\n register_class<T, Bases...>(L);\n push_class_metatable<T>(L);\n return detail::class_creator<T>(L, nullptr);\n}\n\n} \/\/ namespace apollo\n\n#endif \/\/ APOLLO_CLASS_UTILITY_HPP_INCLUDED\n<|endoftext|>"} {"text":"<commit_before>\/\/ (C) Copyright Gennadiy Rozental 2005-2014.\n\/\/ Distributed under the Boost Software License, Version 1.0.\n\/\/ (See accompanying file LICENSE_1_0.txt or copy at\n\/\/ http:\/\/www.boost.org\/LICENSE_1_0.txt)\n\n\/\/ See http:\/\/www.boost.org\/libs\/test for the library home page.\n\/\/\n\/\/!@file\n\/\/!@brief Defines Unit Test Framework mono-state interfaces.\n\/\/! The framework interfaces are based on Monostate design pattern.\n\/\/ ***************************************************************************\n\n#ifndef BOOST_TEST_FRAMEWORK_HPP_020805GER\n#define BOOST_TEST_FRAMEWORK_HPP_020805GER\n\n\/\/ Boost.Test\n#include <boost\/test\/detail\/global_typedef.hpp>\n#include <boost\/test\/detail\/fwd_decl.hpp>\n#include <boost\/test\/detail\/throw_exception.hpp>\n\n#include <boost\/test\/utils\/trivial_singleton.hpp>\n\n#include <boost\/test\/detail\/suppress_warnings.hpp>\n\n\/\/ STL\n#include <stdexcept>\n\n\/\/____________________________________________________________________________\/\/\n\nnamespace boost {\n\n\/\/\/ Main namespace for the Unit Test Framework interfaces and implementation\nnamespace unit_test {\n\n\/\/ ************************************************************************** \/\/\n\/\/ ************** init_unit_test_func ************** \/\/\n\/\/ ************************************************************************** \/\/\n\n\/\/\/ Test module initialization routine signature\n\n\/\/\/ Different depending on whether BOOST_TEST_ALTERNATIVE_INIT_API is defined or not\n#ifdef BOOST_TEST_ALTERNATIVE_INIT_API\ntypedef bool (*init_unit_test_func)();\n#else\ntypedef test_suite* (*init_unit_test_func)( int, char* [] );\n#endif\n\n\/\/ ************************************************************************** \/\/\n\/\/ ************** framework ************** \/\/\n\/\/ ************************************************************************** \/\/\n\n\/\/\/ Namespace of the Unit Test Framework mono-state\nnamespace framework {\n\n\/\/\/ @name Unit Test Framework initialization and shutdown\n\/\/\/ @{\n\n\/\/\/ @brief This function performs initialization of the framework mono-state.\n\/\/\/\n\/\/\/ It needs to be called every time before the test is started.\n\/\/\/ @param[in] init_func test module initialization routine\n\/\/\/ @param[in] argc command line arguments collection\n\/\/\/ @param[in] argv command line arguments collection\nBOOST_TEST_DECL void init( init_unit_test_func init_func, int argc, char* argv[] );\n\n\/\/\/ This function applies all the decorators and figures out default run status. This argument facilitates an\n\/\/\/ ability of the test cases to prepare some other test units (primarily used internally for self testing)\n\/\/\/ @param[in] tu Optional id of the test unit representing root of test tree. If absent, master test suite is used\nBOOST_TEST_DECL void finalize_setup_phase( test_unit_id tu = INV_TEST_UNIT_ID);\n\n\/\/\/ This function returns true when testing is in progress (setup is finished)\nBOOST_TEST_DECL bool test_in_progress();\n\n\/\/\/ This function shuts down the framework and clears up its mono-state.\n\/\/\/\n\/\/\/ It needs to be at the very end of test module execution\nBOOST_TEST_DECL void shutdown();\n\/\/\/ @}\n\n\/\/\/ @name Test unit registration\n\/\/\/ @{\n\n\/\/\/ Provides both read and write access to current \"leaf\" auto test suite during the test unit registration phase.\n\/\/\/\n\/\/\/ During auto-registration phase the framework maintain a FIFO queue of test units being registered. New test units become children\n\/\/\/ of the current \"leaf\" test suite and if this is test suite it is pushed back into queue and becomes a new leaf.\n\/\/\/ When test suite registration is completed, a test suite is popped from the back of the queue. Only automatically registered test suites\n\/\/\/ should be added to this queue. Master test suite is always a zero element in this queue, so if no other test suites are registered\n\/\/\/ all test cases are added to master test suite.\n\n\/\/\/ This function facilitates all three possible actions:\n\/\/\/ - if no argument are provided it returns the current queue leaf test suite\n\/\/\/ - if test suite is provided and no second argument are set, test suite is added to the queue\n\/\/\/ - if no test suite are provided and last argument is false, the semantic of this function is similar to queue pop: last element is popped from the queue\n\/\/\/ @param[in] ts test suite to push back to the queue\n\/\/\/ @param[in] push_or_pop should we push ts to the queue or pop leaf test suite instead\n\/\/\/ @returns a reference to the currently active\/\"leaf\" test suite\nBOOST_TEST_DECL test_suite& current_auto_test_suite( test_suite* ts = 0, bool push_or_pop = true );\n\n\/\/\/ This function add new test case into the global collection of test units the framework aware of.\n\n\/\/\/ This function also assignes unique test unit id for every test case. Later on one can use this id to locate\n\/\/\/ the test case if necessary. This is the way for the framework to maintain weak references between test units.\n\/\/\/ @param[in] tc test case to register\nBOOST_TEST_DECL void register_test_unit( test_case* tc );\n\n\/\/\/ This function add new test suite into the global collection of test units the framework aware of.\n\n\/\/\/ This function also assignes unique test unit id for every test suite. Later on one can use this id to locate\n\/\/\/ the test case if necessary. This is the way for the framework to maintain weak references between test units.\n\/\/\/ @param[in] ts test suite to register\nBOOST_TEST_DECL void register_test_unit( test_suite* ts );\n\n\/\/\/ This function removes the test unit from the collection of known test units and destroys the test unit object.\n\n\/\/\/ This function also assigns unique test unit id for every test case. Later on one can use this id to located\n\/\/\/ the test case if necessary. This is the way for the framework to maintain weak references between test units.\n\/\/\/ @param[in] tu test unit to deregister\nBOOST_TEST_DECL void deregister_test_unit( test_unit* tu );\n\n\/\/ This function clears up the framework mono-state.\n\n\/\/\/ Afer this call the framework can be reinitialized to perform a second test run during the same program lifetime\nBOOST_TEST_DECL void clear();\n\/\/\/ @}\n\n\/\/\/ @name Test observer registration\n\/\/\/ @{\n\/\/\/ Adds new test execution observer object into the framework's list of test observers.\n\n\/\/\/ Observer lifetime should exceed the the testing execution timeframe\n\/\/\/ @param[in] to test observer object to add\nBOOST_TEST_DECL void register_observer( test_observer& to );\n\n\/\/\/ Excldes the observer object form the framework's list of test observers\n\/\/\/ @param[in] to test observer object to exclude\nBOOST_TEST_DECL void deregister_observer( test_observer& to );\n\n\/\/\/ @}\n\n\/\/\/ @name Assertion\/uncaught exception context support\n\/\/\/ @{\n\/\/\/ Context accessor\nstruct BOOST_TEST_DECL context_generator {\n context_generator() : m_curr_frame( 0 ) {}\n\n \/\/\/ Is there any context?\n bool is_empty() const;\n\n \/\/\/ Give me next frame; empty - last frame\n const_string next() const;\n\nprivate:\n \/\/ Data members\n mutable unsigned m_curr_frame;\n};\n\n\/\/\/ Records context frame message\n\n\/\/\/ Some context frames are sticky - they can only explicitly cleared by specifying context id. Other (non sticky) context frames cleared after every assertion.\n\/\/\/ @param[in] context_descr context frame message\n\/\/\/ @param[in] sticky is this sticky frame or not\n\/\/\/ @returns id of the newly created frame\nBOOST_TEST_DECL int add_context( lazy_ostream const& context_descr, bool sticky );\n\/\/\/ Erases context frame (when test exits context scope)\n\n\/\/\/ If context_id is passed clears that specific context frame identified by this id, otherwise clears all non sticky contexts\nBOOST_TEST_DECL void clear_context( int context_id = -1 );\n\/\/\/ Produces an instance of small \"delegate\" object, which facilitates access to collected context\nBOOST_TEST_DECL context_generator get_context();\n\/\/\/ @}\n\n\/\/\/ @name Access to registered test units\n\/\/\/ @{\n\/\/\/ This function provides access to the master test suite.\n\n\/\/\/ There is only only master test suite per test module.\n\/\/\/ @returns a reference the master test suite instance\nBOOST_TEST_DECL master_test_suite_t& master_test_suite();\n\n\/\/\/ This function provides an access to the test case currently being executed\n\n\/\/\/ This function is only valid during test execution phase\n\/\/\/ @see current_test_case_id\nBOOST_TEST_DECL test_case const& current_test_case();\n\n\/\/\/ This function provides an access to an id of the test case currently being executed\n\n\/\/\/ This function safer than current_test_case, cause if wont throw if no test case is being executed.\n\/\/\/ @see current_test_case\nBOOST_TEST_DECL test_unit_id current_test_case_id(); \/* safe version of above *\/\n\n\/\/\/ This function provides access to a test unit by id and type combination. It will throw if no test unit located\n\/\/\/ @param[in] tu_id id of a test unit to locate\n\/\/\/ @param[in] tu_type type of a test unit to locate\n\/\/\/ @returns located test unit\nBOOST_TEST_DECL test_unit& get( test_unit_id tu_id, test_unit_type tu_type );\n\n\/\/\/ This function template provides access to a typed test unit by id\n\n\/\/\/ It will throw if you specify incorrect test unit type\n\/\/\/ @tparam UnitType compile time type of test unit to get (test_suite or test_case)\n\/\/\/ @param id id of test unit to get\ntemplate<typename UnitType>\ninline UnitType& get( test_unit_id id )\n{\n return static_cast<UnitType&>( get( id, static_cast<test_unit_type>(UnitType::type) ) );\n}\n\/\/\/@}\n\n\/\/\/ @name Test initiation interface\n\/\/\/ @{\n\n\/\/\/ Initiates test execution\n\n\/\/\/ This function is used to start the test execution from a specific \"root\" test unit.\n\/\/\/ If no root provided, test is started from master test suite. This second argument facilitates an ability of the test cases to\n\/\/\/ start some other test units (primarily used internally for self testing)\n\/\/\/ @param[in] tu Optional id of the test unit or test unit itself from which the test is started. If absent, master test suite is used\n\/\/\/ @param[in] continue_test true == continue test if it was already started, false == restart the test from scratch regardless\nBOOST_TEST_DECL void run( test_unit_id tu = INV_TEST_UNIT_ID, bool continue_test = true );\n\/\/\/ Initiates test execution. Same as other overload\nBOOST_TEST_DECL void run( test_unit const* tu, bool continue_test = true );\n\/\/\/ @}\n\n\/\/\/ @name Test events dispatchers\n\/\/\/ @{\n\/\/\/ Reports results of assertion to all test observers\nBOOST_TEST_DECL void assertion_result( unit_test::assertion_result ar );\n\/\/\/ Reports uncaught exception to all test observers\nBOOST_TEST_DECL void exception_caught( execution_exception const& );\n\/\/\/ Reports aborted test unit to all test observers\nBOOST_TEST_DECL void test_unit_aborted( test_unit const& );\n\/\/\/ @}\n\nnamespace impl {\n\/\/ exclusively for self test\nBOOST_TEST_DECL void setup_for_execution( test_unit const& );\n} \/\/ namespace impl\n\n\/\/ ************************************************************************** \/\/\n\/\/ ************** framework errors ************** \/\/\n\/\/ ************************************************************************** \/\/\n\n\/\/\/ This exception type is used to report internal Boost.Test framework errors\nstruct BOOST_TEST_DECL internal_error : public std::runtime_error {\n internal_error( const_string m ) : std::runtime_error( std::string( m.begin(), m.size() ) ) {}\n};\n\n\/\/____________________________________________________________________________\/\/\n\n\/\/\/ This exception type is used to report test module setup errors\nstruct BOOST_TEST_DECL setup_error : public std::runtime_error {\n setup_error( const_string m ) : std::runtime_error( std::string( m.begin(), m.size() ) ) {}\n};\n\n#define BOOST_TEST_SETUP_ASSERT( cond, msg ) \\\n if( cond ) {} \\\n else BOOST_TEST_IMPL_THROW( unit_test::framework::setup_error( msg ) )\n\n\/\/____________________________________________________________________________\/\/\n\nstruct nothing_to_test {}; \/\/ not really an error\n\n\/\/____________________________________________________________________________\/\/\n\n} \/\/ namespace framework\n} \/\/ unit_test\n} \/\/ namespace boost\n\n#include <boost\/test\/detail\/enable_warnings.hpp>\n\n#endif \/\/ BOOST_TEST_FRAMEWORK_HPP_020805GER\n\n<commit_msg>few comments fixed<commit_after>\/\/ (C) Copyright Gennadiy Rozental 2005-2014.\n\/\/ Distributed under the Boost Software License, Version 1.0.\n\/\/ (See accompanying file LICENSE_1_0.txt or copy at\n\/\/ http:\/\/www.boost.org\/LICENSE_1_0.txt)\n\n\/\/ See http:\/\/www.boost.org\/libs\/test for the library home page.\n\/\/\n\/\/!@file\n\/\/!@brief Defines Unit Test Framework mono-state interfaces.\n\/\/! The framework interfaces are based on Monostate design pattern.\n\/\/ ***************************************************************************\n\n#ifndef BOOST_TEST_FRAMEWORK_HPP_020805GER\n#define BOOST_TEST_FRAMEWORK_HPP_020805GER\n\n\/\/ Boost.Test\n#include <boost\/test\/detail\/global_typedef.hpp>\n#include <boost\/test\/detail\/fwd_decl.hpp>\n#include <boost\/test\/detail\/throw_exception.hpp>\n\n#include <boost\/test\/utils\/trivial_singleton.hpp>\n\n#include <boost\/test\/detail\/suppress_warnings.hpp>\n\n\/\/ STL\n#include <stdexcept>\n\n\/\/____________________________________________________________________________\/\/\n\nnamespace boost {\n\n\/\/\/ Main namespace for the Unit Test Framework interfaces and implementation\nnamespace unit_test {\n\n\/\/ ************************************************************************** \/\/\n\/\/ ************** init_unit_test_func ************** \/\/\n\/\/ ************************************************************************** \/\/\n\n\/\/\/ Test module initialization routine signature\n\n\/\/\/ Different depending on whether BOOST_TEST_ALTERNATIVE_INIT_API is defined or not\n#ifdef BOOST_TEST_ALTERNATIVE_INIT_API\ntypedef bool (*init_unit_test_func)();\n#else\ntypedef test_suite* (*init_unit_test_func)( int, char* [] );\n#endif\n\n\/\/ ************************************************************************** \/\/\n\/\/ ************** framework ************** \/\/\n\/\/ ************************************************************************** \/\/\n\n\/\/\/ Namespace of the Unit Test Framework mono-state\nnamespace framework {\n\n\/\/\/ @name Unit Test Framework initialization and shutdown\n\/\/\/ @{\n\n\/\/\/ @brief This function performs initialization of the framework mono-state.\n\/\/\/\n\/\/\/ It needs to be called every time before the test is started.\n\/\/\/ @param[in] init_func test module initialization routine\n\/\/\/ @param[in] argc command line arguments collection\n\/\/\/ @param[in] argv command line arguments collection\nBOOST_TEST_DECL void init( init_unit_test_func init_func, int argc, char* argv[] );\n\n\/\/\/ This function applies all the decorators and figures out default run status. This argument facilitates an\n\/\/\/ ability of the test cases to prepare some other test units (primarily used internally for self testing).\n\/\/\/ @param[in] tu Optional id of the test unit representing root of test tree. If absent, master test suite is used\nBOOST_TEST_DECL void finalize_setup_phase( test_unit_id tu = INV_TEST_UNIT_ID);\n\n\/\/\/ This function returns true when testing is in progress (setup is finished).\nBOOST_TEST_DECL bool test_in_progress();\n\n\/\/\/ This function shuts down the framework and clears up its mono-state.\n\/\/\/\n\/\/\/ It needs to be at the very end of test module execution\nBOOST_TEST_DECL void shutdown();\n\/\/\/ @}\n\n\/\/\/ @name Test unit registration\n\/\/\/ @{\n\n\/\/\/ Provides both read and write access to current \"leaf\" auto test suite during the test unit registration phase.\n\/\/\/\n\/\/\/ During auto-registration phase the framework maintain a FIFO queue of test units being registered. New test units become children\n\/\/\/ of the current \"leaf\" test suite and if this is test suite it is pushed back into queue and becomes a new leaf.\n\/\/\/ When test suite registration is completed, a test suite is popped from the back of the queue. Only automatically registered test suites\n\/\/\/ should be added to this queue. Master test suite is always a zero element in this queue, so if no other test suites are registered\n\/\/\/ all test cases are added to master test suite.\n\n\/\/\/ This function facilitates all three possible actions:\n\/\/\/ - if no argument are provided it returns the current queue leaf test suite\n\/\/\/ - if test suite is provided and no second argument are set, test suite is added to the queue\n\/\/\/ - if no test suite are provided and last argument is false, the semantic of this function is similar to queue pop: last element is popped from the queue\n\/\/\/ @param[in] ts test suite to push back to the queue\n\/\/\/ @param[in] push_or_pop should we push ts to the queue or pop leaf test suite instead\n\/\/\/ @returns a reference to the currently active\/\"leaf\" test suite\nBOOST_TEST_DECL test_suite& current_auto_test_suite( test_suite* ts = 0, bool push_or_pop = true );\n\n\/\/\/ This function add new test case into the global collection of test units the framework aware of.\n\n\/\/\/ This function also assignes unique test unit id for every test case. Later on one can use this id to locate\n\/\/\/ the test case if necessary. This is the way for the framework to maintain weak references between test units.\n\/\/\/ @param[in] tc test case to register\nBOOST_TEST_DECL void register_test_unit( test_case* tc );\n\n\/\/\/ This function add new test suite into the global collection of test units the framework aware of.\n\n\/\/\/ This function also assignes unique test unit id for every test suite. Later on one can use this id to locate\n\/\/\/ the test case if necessary. This is the way for the framework to maintain weak references between test units.\n\/\/\/ @param[in] ts test suite to register\nBOOST_TEST_DECL void register_test_unit( test_suite* ts );\n\n\/\/\/ This function removes the test unit from the collection of known test units and destroys the test unit object.\n\n\/\/\/ This function also assigns unique test unit id for every test case. Later on one can use this id to located\n\/\/\/ the test case if necessary. This is the way for the framework to maintain weak references between test units.\n\/\/\/ @param[in] tu test unit to deregister\nBOOST_TEST_DECL void deregister_test_unit( test_unit* tu );\n\n\/\/ This function clears up the framework mono-state.\n\n\/\/\/ Afer this call the framework can be reinitialized to perform a second test run during the same program lifetime.\nBOOST_TEST_DECL void clear();\n\/\/\/ @}\n\n\/\/\/ @name Test observer registration\n\/\/\/ @{\n\/\/\/ Adds new test execution observer object into the framework's list of test observers.\n\n\/\/\/ Observer lifetime should exceed the the testing execution timeframe\n\/\/\/ @param[in] to test observer object to add\nBOOST_TEST_DECL void register_observer( test_observer& to );\n\n\/\/\/ Excldes the observer object form the framework's list of test observers\n\/\/\/ @param[in] to test observer object to exclude\nBOOST_TEST_DECL void deregister_observer( test_observer& to );\n\n\/\/\/ @}\n\n\/\/\/ @name Assertion\/uncaught exception context support\n\/\/\/ @{\n\/\/\/ Context accessor\nstruct BOOST_TEST_DECL context_generator {\n context_generator() : m_curr_frame( 0 ) {}\n\n \/\/\/ Is there any context?\n bool is_empty() const;\n\n \/\/\/ Give me next frame; empty - last frame\n const_string next() const;\n\nprivate:\n \/\/ Data members\n mutable unsigned m_curr_frame;\n};\n\n\/\/\/ Records context frame message.\n\n\/\/\/ Some context frames are sticky - they can only explicitly cleared by specifying context id. Other (non sticky) context frames cleared after every assertion.\n\/\/\/ @param[in] context_descr context frame message\n\/\/\/ @param[in] sticky is this sticky frame or not\n\/\/\/ @returns id of the newly created frame\nBOOST_TEST_DECL int add_context( lazy_ostream const& context_descr, bool sticky );\n\/\/\/ Erases context frame (when test exits context scope)\n\n\/\/\/ If context_id is passed clears that specific context frame identified by this id, otherwise clears all non sticky contexts.\nBOOST_TEST_DECL void clear_context( int context_id = -1 );\n\/\/\/ Produces an instance of small \"delegate\" object, which facilitates access to collected context.\nBOOST_TEST_DECL context_generator get_context();\n\/\/\/ @}\n\n\/\/\/ @name Access to registered test units.\n\/\/\/ @{\n\/\/\/ This function provides access to the master test suite.\n\n\/\/\/ There is only only master test suite per test module.\n\/\/\/ @returns a reference the master test suite instance\nBOOST_TEST_DECL master_test_suite_t& master_test_suite();\n\n\/\/\/ This function provides an access to the test case currently being executed.\n\n\/\/\/ This function is only valid during test execution phase.\n\/\/\/ @see current_test_case_id\nBOOST_TEST_DECL test_case const& current_test_case();\n\n\/\/\/ This function provides an access to an id of the test case currently being executed.\n\n\/\/\/ This function safer than current_test_case, cause if wont throw if no test case is being executed.\n\/\/\/ @see current_test_case\nBOOST_TEST_DECL test_unit_id current_test_case_id(); \/* safe version of above *\/\n\n\/\/\/ This function provides access to a test unit by id and type combination. It will throw if no test unit located.\n\/\/\/ @param[in] tu_id id of a test unit to locate\n\/\/\/ @param[in] tu_type type of a test unit to locate\n\/\/\/ @returns located test unit\nBOOST_TEST_DECL test_unit& get( test_unit_id tu_id, test_unit_type tu_type );\n\n\/\/\/ This function template provides access to a typed test unit by id\n\n\/\/\/ It will throw if you specify incorrect test unit type\n\/\/\/ @tparam UnitType compile time type of test unit to get (test_suite or test_case)\n\/\/\/ @param id id of test unit to get\ntemplate<typename UnitType>\ninline UnitType& get( test_unit_id id )\n{\n return static_cast<UnitType&>( get( id, static_cast<test_unit_type>(UnitType::type) ) );\n}\n\/\/\/@}\n\n\/\/\/ @name Test initiation interface\n\/\/\/ @{\n\n\/\/\/ Initiates test execution\n\n\/\/\/ This function is used to start the test execution from a specific \"root\" test unit.\n\/\/\/ If no root provided, test is started from master test suite. This second argument facilitates an ability of the test cases to\n\/\/\/ start some other test units (primarily used internally for self testing).\n\/\/\/ @param[in] tu Optional id of the test unit or test unit itself from which the test is started. If absent, master test suite is used\n\/\/\/ @param[in] continue_test true == continue test if it was already started, false == restart the test from scratch regardless\nBOOST_TEST_DECL void run( test_unit_id tu = INV_TEST_UNIT_ID, bool continue_test = true );\n\/\/\/ Initiates test execution. Same as other overload\nBOOST_TEST_DECL void run( test_unit const* tu, bool continue_test = true );\n\/\/\/ @}\n\n\/\/\/ @name Test events dispatchers\n\/\/\/ @{\n\/\/\/ Reports results of assertion to all test observers\nBOOST_TEST_DECL void assertion_result( unit_test::assertion_result ar );\n\/\/\/ Reports uncaught exception to all test observers\nBOOST_TEST_DECL void exception_caught( execution_exception const& );\n\/\/\/ Reports aborted test unit to all test observers\nBOOST_TEST_DECL void test_unit_aborted( test_unit const& );\n\/\/\/ @}\n\nnamespace impl {\n\/\/ exclusively for self test\nBOOST_TEST_DECL void setup_for_execution( test_unit const& );\n} \/\/ namespace impl\n\n\/\/ ************************************************************************** \/\/\n\/\/ ************** framework errors ************** \/\/\n\/\/ ************************************************************************** \/\/\n\n\/\/\/ This exception type is used to report internal Boost.Test framework errors.\nstruct BOOST_TEST_DECL internal_error : public std::runtime_error {\n internal_error( const_string m ) : std::runtime_error( std::string( m.begin(), m.size() ) ) {}\n};\n\n\/\/____________________________________________________________________________\/\/\n\n\/\/\/ This exception type is used to report test module setup errors.\nstruct BOOST_TEST_DECL setup_error : public std::runtime_error {\n setup_error( const_string m ) : std::runtime_error( std::string( m.begin(), m.size() ) ) {}\n};\n\n#define BOOST_TEST_SETUP_ASSERT( cond, msg ) \\\n if( cond ) {} \\\n else BOOST_TEST_IMPL_THROW( unit_test::framework::setup_error( msg ) )\n\n\/\/____________________________________________________________________________\/\/\n\nstruct nothing_to_test {}; \/\/ not really an error\n\n\/\/____________________________________________________________________________\/\/\n\n} \/\/ namespace framework\n} \/\/ unit_test\n} \/\/ namespace boost\n\n#include <boost\/test\/detail\/enable_warnings.hpp>\n\n#endif \/\/ BOOST_TEST_FRAMEWORK_HPP_020805GER\n\n<|endoftext|>"} {"text":"<commit_before>#pragma once\n\n\/*\n * Factories for variable names.\n *\/\n\n#include <crab\/common\/types.hpp>\n\n#include <boost\/optional.hpp>\n#include <boost\/range\/iterator_range.hpp>\n\n#include <functional>\n#include <limits>\n#include <unordered_map>\n#include <vector>\n\nnamespace crab {\nnamespace cfg {\nnamespace var_factory_impl {\nnamespace indexed_string_impl {\ntemplate <typename T> inline std::string get_str(T e);\n\ntemplate <> inline std::string get_str(std::string e) { return e; }\n} \/\/ namespace indexed_string_impl\n\n\/\/ This variable factory creates a new variable associated to an\n\/\/ element of type T. It can also create variables that are not\n\/\/ associated to an element of type T. We call them shadow variables.\n\/\/\n\/\/ The factory uses a counter of type index_t to generate variable\n\/\/ id's that always increases.\ntemplate <class T> class variable_factory {\n typedef variable_factory<T> variable_factory_t;\n\npublic:\n class indexed_string {\n template <typename Any> friend class variable_factory;\n\n public:\n \/\/ FIXME: we should use some unlimited precision type to avoid\n \/\/ overflow. However, this change is a bit involving since we\n \/\/ need to change the algorithm api's in patricia_trees.hpp because\n \/\/ they assume ikos::index_t.\n typedef ikos::index_t index_t;\n\n private:\n boost::optional<T> _s;\n index_t _id;\n std::string _name; \/\/ optional string name associated with _id\n variable_factory *_vfac;\n\n \/\/ NOT IMPLEMENTED\n indexed_string();\n\n indexed_string(index_t id, variable_factory *vfac, std::string name = \"\")\n : _id(id), _name(name), _vfac(vfac) {}\n\n indexed_string(T s, index_t id, variable_factory *vfac)\n : _s(s), _id(id), _name(\"\"), _vfac(vfac) {}\n\n public:\n ~indexed_string() {}\n\n indexed_string(const indexed_string &is)\n : _s(is._s), _id(is._id), _name(is._name), _vfac(is._vfac) {}\n\n indexed_string &operator=(const indexed_string &is) {\n if (this != &is) {\n _s = is._s;\n _id = is._id;\n _name = is._name;\n _vfac = is._vfac;\n }\n return *this;\n }\n\n index_t index() const { return this->_id; }\n\n std::string str() const {\n if (_s) {\n return indexed_string_impl::get_str<T>(*_s);\n } else {\n if (_name != \"\") {\n return _name;\n } else {\n \/\/ unlikely prefix\n return \"@V_\" + std::to_string(_id);\n }\n }\n }\n\n boost::optional<T> get() const { return _s ? *_s : boost::optional<T>(); }\n\n variable_factory &get_var_factory() { return *_vfac; }\n\n bool operator<(indexed_string s) const { return (_id < s._id); }\n\n bool operator==(indexed_string s) const { return (_id == s._id); }\n\n void write(crab_os &o) const { o << str(); }\n\n friend crab_os &operator<<(crab_os &o, indexed_string s) {\n o << s.str();\n return o;\n }\n\n friend size_t hash_value(indexed_string s) {\n std::hash<index_t> hasher;\n return hasher(s.index());\n }\n };\n\npublic:\n typedef typename indexed_string::index_t index_t;\n\nprivate:\n typedef std::unordered_map<T, indexed_string> t_map_t;\n typedef std::unordered_map<index_t, indexed_string> shadow_map_t;\n\n index_t _next_id;\n t_map_t _map;\n shadow_map_t _shadow_map;\n std::vector<indexed_string> _shadow_vars;\n\n index_t get_and_increment_id(void) {\n if (_next_id == std::numeric_limits<index_t>::max()) {\n CRAB_ERROR(\"Reached limit of \", std::numeric_limits<index_t>::max(),\n \" variables\");\n }\n index_t res = _next_id;\n ++_next_id;\n return res;\n }\n\npublic:\n typedef indexed_string varname_t;\n typedef boost::iterator_range<typename std::vector<indexed_string>::iterator>\n var_range;\n typedef boost::iterator_range<\n typename std::vector<indexed_string>::const_iterator>\n const_var_range;\n\npublic:\n variable_factory() : _next_id(1) {}\n\n variable_factory(index_t start_id) : _next_id(start_id) {}\n\n variable_factory(const variable_factory_t &o) = delete;\n\n variable_factory_t &operator=(const variable_factory_t &o) = delete;\n\n virtual ~variable_factory() {}\n\n \/\/ hook for generating indexed_string's without being\n \/\/ associated with a particular T (w\/o caching).\n \/\/ XXX: do not use it unless strictly necessary.\n virtual indexed_string get(std::string name = \"\") {\n indexed_string is(get_and_increment_id(), this, name);\n _shadow_vars.push_back(is);\n return is;\n }\n\n \/\/ generate a shadow indexed_string's associated to some key\n virtual indexed_string get(index_t key, std::string name = \"\") {\n auto it = _shadow_map.find(key);\n if (it == _shadow_map.end()) {\n indexed_string is(get_and_increment_id(), this, name);\n _shadow_map.insert(typename shadow_map_t::value_type(key, is));\n _shadow_vars.push_back(is);\n return is;\n } else {\n return it->second;\n }\n }\n\n virtual indexed_string operator[](T s) {\n auto it = _map.find(s);\n if (it == _map.end()) {\n indexed_string is(s, get_and_increment_id(), this);\n _map.insert(typename t_map_t::value_type(s, is));\n return is;\n } else {\n return it->second;\n }\n }\n\n \/\/ return all the shadow variables created by the factory.\n virtual const_var_range get_shadow_vars() const {\n return boost::make_iterator_range(_shadow_vars.begin(), _shadow_vars.end());\n }\n};\n\n\/\/! Specialized factory for strings\nclass str_variable_factory : public variable_factory<std::string> {\n typedef variable_factory<std::string> variable_factory_t;\n\npublic:\n typedef variable_factory_t::varname_t varname_t;\n typedef variable_factory_t::const_var_range const_var_range;\n typedef variable_factory_t::index_t index_t;\n\n str_variable_factory() : variable_factory_t() {}\n};\n\n\/\/! Specialized factory for integers\nclass int_variable_factory {\npublic:\n typedef int varname_t;\n\n int_variable_factory() {}\n\n int_variable_factory(const int_variable_factory &o) = delete;\n\n int_variable_factory &operator=(const int_variable_factory &o) = delete;\n\n varname_t operator[](int v) { return v; }\n};\n\ninline int fresh_colour(int col_x, int col_y) {\n switch (col_x) {\n case 0:\n return col_y == 1 ? 2 : 1;\n case 1:\n return col_y == 0 ? 2 : 0;\n case 2:\n return col_y == 0 ? 1 : 0;\n default:\n CRAB_ERROR(\"Unreachable\");\n }\n}\n\n\/\/! Three-coloured variable allocation. So the number of variables\n\/\/ is bounded by 3|Tbl|, rather than always increasing.\nclass str_var_alloc_col {\n static const char **col_prefix;\n\npublic:\n typedef str_variable_factory::varname_t varname_t;\n static str_variable_factory vfac;\n\n str_var_alloc_col() : colour(0), next_id(0) {}\n\n str_var_alloc_col(const str_var_alloc_col &o)\n : colour(o.colour), next_id(o.next_id) {}\n\n str_var_alloc_col(const str_var_alloc_col &x, const str_var_alloc_col &y)\n : colour(fresh_colour(x.colour, y.colour)), next_id(0) {\n assert(colour != x.colour);\n assert(colour != y.colour);\n }\n\n str_var_alloc_col &operator=(const str_var_alloc_col &x) {\n colour = x.colour;\n next_id = x.next_id;\n return *this;\n }\n\n str_variable_factory::varname_t next() {\n std::string v = col_prefix[colour] + std::to_string(next_id++);\n return vfac[v];\n }\n\nprotected:\n int colour;\n int next_id;\n};\n\nclass int_var_alloc_col {\npublic:\n typedef int varname_t;\n static int_variable_factory vfac;\n\n int_var_alloc_col() : colour(0), next_id(0) {}\n\n int_var_alloc_col(const int_var_alloc_col &o)\n : colour(o.colour), next_id(o.next_id) {}\n\n int_var_alloc_col(const int_var_alloc_col &x, const int_var_alloc_col &y)\n : colour(fresh_colour(x.colour, y.colour)), next_id(0) {\n assert(colour != x.colour);\n assert(colour != y.colour);\n }\n\n int_var_alloc_col &operator=(const int_var_alloc_col &x) {\n colour = x.colour;\n next_id = x.next_id;\n return *this;\n }\n\n int_variable_factory::varname_t next() {\n int id = next_id++;\n return 3 * id + colour;\n }\n\nprotected:\n int colour;\n int next_id;\n};\n\n} \/\/ end namespace var_factory_impl\n} \/\/ end namespace cfg\n} \/\/ end namespace crab\n<commit_msg>refactor(var_factory): add namespace to index_t<commit_after>#pragma once\n\n\/*\n * Factories for variable names.\n *\/\n\n#include <crab\/common\/types.hpp>\n\n#include <boost\/optional.hpp>\n#include <boost\/range\/iterator_range.hpp>\n\n#include <functional>\n#include <limits>\n#include <unordered_map>\n#include <vector>\n\nnamespace crab {\nnamespace cfg {\nnamespace var_factory_impl {\nnamespace indexed_string_impl {\ntemplate <typename T> inline std::string get_str(T e);\n\ntemplate <> inline std::string get_str(std::string e) { return e; }\n} \/\/ namespace indexed_string_impl\n\n\/\/ This variable factory creates a new variable associated to an\n\/\/ element of type T. It can also create variables that are not\n\/\/ associated to an element of type T. We call them shadow variables.\n\/\/\n\/\/ The factory uses a counter of type index_t to generate variable\n\/\/ id's that always increases.\ntemplate <class T> class variable_factory {\n typedef variable_factory<T> variable_factory_t;\n\npublic:\n class indexed_string {\n template <typename Any> friend class variable_factory;\n boost::optional<T> _s;\n ikos::index_t _id;\n std::string _name; \/\/ optional string name associated with _id\n variable_factory *_vfac;\n\n \/\/ NOT IMPLEMENTED\n indexed_string();\n\n indexed_string(ikos::index_t id, variable_factory *vfac, std::string name = \"\")\n : _id(id), _name(name), _vfac(vfac) {}\n\n indexed_string(T s, ikos::index_t id, variable_factory *vfac)\n : _s(s), _id(id), _name(\"\"), _vfac(vfac) {}\n\n public:\n ~indexed_string() {}\n\n indexed_string(const indexed_string &is)\n : _s(is._s), _id(is._id), _name(is._name), _vfac(is._vfac) {}\n\n indexed_string &operator=(const indexed_string &is) {\n if (this != &is) {\n _s = is._s;\n _id = is._id;\n _name = is._name;\n _vfac = is._vfac;\n }\n return *this;\n }\n\n ikos::index_t index() const { return this->_id; }\n\n std::string str() const {\n if (_s) {\n return indexed_string_impl::get_str<T>(*_s);\n } else {\n if (_name != \"\") {\n return _name;\n } else {\n \/\/ unlikely prefix\n return \"@V_\" + std::to_string(_id);\n }\n }\n }\n\n boost::optional<T> get() const { return _s ? *_s : boost::optional<T>(); }\n\n variable_factory &get_var_factory() { return *_vfac; }\n\n bool operator<(indexed_string s) const { return (_id < s._id); }\n\n bool operator==(indexed_string s) const { return (_id == s._id); }\n\n void write(crab_os &o) const { o << str(); }\n\n friend crab_os &operator<<(crab_os &o, indexed_string s) {\n o << s.str();\n return o;\n }\n\n friend size_t hash_value(indexed_string s) {\n std::hash<ikos::index_t> hasher;\n return hasher(s.index());\n }\n };\n\nprivate:\n typedef std::unordered_map<T, indexed_string> t_map_t;\n typedef std::unordered_map<ikos::index_t, indexed_string> shadow_map_t;\n\n ikos::index_t _next_id;\n t_map_t _map;\n shadow_map_t _shadow_map;\n std::vector<indexed_string> _shadow_vars;\n\n ikos::index_t get_and_increment_id(void) {\n if (_next_id == std::numeric_limits<ikos::index_t>::max()) {\n CRAB_ERROR(\"Reached limit of \", std::numeric_limits<ikos::index_t>::max(),\n \" variables\");\n }\n ikos::index_t res = _next_id;\n ++_next_id;\n return res;\n }\n\npublic:\n typedef indexed_string varname_t;\n typedef boost::iterator_range<typename std::vector<indexed_string>::iterator>\n var_range;\n typedef boost::iterator_range<\n typename std::vector<indexed_string>::const_iterator>\n const_var_range;\n\npublic:\n variable_factory() : _next_id(1) {}\n\n variable_factory(ikos::index_t start_id) : _next_id(start_id) {}\n\n variable_factory(const variable_factory_t &o) = delete;\n\n variable_factory_t &operator=(const variable_factory_t &o) = delete;\n\n virtual ~variable_factory() {}\n\n \/\/ hook for generating indexed_string's without being\n \/\/ associated with a particular T (w\/o caching).\n \/\/ XXX: do not use it unless strictly necessary.\n virtual indexed_string get(std::string name = \"\") {\n indexed_string is(get_and_increment_id(), this, name);\n _shadow_vars.push_back(is);\n return is;\n }\n\n \/\/ generate a shadow indexed_string's associated to some key\n virtual indexed_string get(ikos::index_t key, std::string name = \"\") {\n auto it = _shadow_map.find(key);\n if (it == _shadow_map.end()) {\n indexed_string is(get_and_increment_id(), this, name);\n _shadow_map.insert(typename shadow_map_t::value_type(key, is));\n _shadow_vars.push_back(is);\n return is;\n } else {\n return it->second;\n }\n }\n\n virtual indexed_string operator[](T s) {\n auto it = _map.find(s);\n if (it == _map.end()) {\n indexed_string is(s, get_and_increment_id(), this);\n _map.insert(typename t_map_t::value_type(s, is));\n return is;\n } else {\n return it->second;\n }\n }\n\n \/\/ return all the shadow variables created by the factory.\n virtual const_var_range get_shadow_vars() const {\n return boost::make_iterator_range(_shadow_vars.begin(), _shadow_vars.end());\n }\n};\n\n\/\/! Specialized factory for strings\nclass str_variable_factory : public variable_factory<std::string> {\n typedef variable_factory<std::string> variable_factory_t;\n\npublic:\n typedef variable_factory_t::varname_t varname_t;\n typedef variable_factory_t::const_var_range const_var_range;\n\n str_variable_factory() : variable_factory_t() {}\n};\n\n\/\/! Specialized factory for integers\nclass int_variable_factory {\npublic:\n typedef ikos::index_t varname_t;\n\n int_variable_factory() {}\n\n int_variable_factory(const int_variable_factory &o) = delete;\n\n int_variable_factory &operator=(const int_variable_factory &o) = delete;\n\n varname_t operator[](ikos::index_t v) { return v; }\n};\n\ninline int fresh_colour(int col_x, int col_y) {\n switch (col_x) {\n case 0:\n return col_y == 1 ? 2 : 1;\n case 1:\n return col_y == 0 ? 2 : 0;\n case 2:\n return col_y == 0 ? 1 : 0;\n default:\n CRAB_ERROR(\"Unreachable\");\n }\n}\n\n\/\/! Three-coloured variable allocation. So the number of variables\n\/\/ is bounded by 3|Tbl|, rather than always increasing.\nclass str_var_alloc_col {\n static const char **col_prefix;\n\npublic:\n typedef str_variable_factory::varname_t varname_t;\n static str_variable_factory vfac;\n\n str_var_alloc_col() : colour(0), next_id(0) {}\n\n str_var_alloc_col(const str_var_alloc_col &o)\n : colour(o.colour), next_id(o.next_id) {}\n\n str_var_alloc_col(const str_var_alloc_col &x, const str_var_alloc_col &y)\n : colour(fresh_colour(x.colour, y.colour)), next_id(0) {\n assert(colour != x.colour);\n assert(colour != y.colour);\n }\n\n str_var_alloc_col &operator=(const str_var_alloc_col &x) {\n colour = x.colour;\n next_id = x.next_id;\n return *this;\n }\n\n str_variable_factory::varname_t next() {\n std::string v = col_prefix[colour] + std::to_string(next_id++);\n return vfac[v];\n }\n\nprotected:\n int colour;\n ikos::index_t next_id;\n};\n\nclass int_var_alloc_col {\npublic:\n typedef ikos::index_t varname_t;\n static int_variable_factory vfac;\n\n int_var_alloc_col() : colour(0), next_id(0) {}\n\n int_var_alloc_col(const int_var_alloc_col &o)\n : colour(o.colour), next_id(o.next_id) {}\n\n int_var_alloc_col(const int_var_alloc_col &x, const int_var_alloc_col &y)\n : colour(fresh_colour(x.colour, y.colour)), next_id(0) {\n assert(colour != x.colour);\n assert(colour != y.colour);\n }\n\n int_var_alloc_col &operator=(const int_var_alloc_col &x) {\n colour = x.colour;\n next_id = x.next_id;\n return *this;\n }\n\n int_variable_factory::varname_t next() {\n ikos::index_t id = next_id++;\n return 3 * id + colour;\n }\n\nprotected:\n int colour;\n ikos::index_t next_id;\n};\n\n} \/\/ end namespace var_factory_impl\n} \/\/ end namespace cfg\n} \/\/ end namespace crab\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\nnamespace etl {\n\n\/*!\n * \\brief A binary expression\n *\n * A binary expression has a left hand side expression and a right hand side expression and for each element applies a binary opeartor to both expressions.\n *\/\ntemplate <typename T, typename LeftExpr, typename BinaryOp, typename RightExpr>\nstruct binary_expr final :\n dim_testable<binary_expr<T, LeftExpr, BinaryOp, RightExpr>>,\n value_testable<binary_expr<T, LeftExpr, BinaryOp, RightExpr>>,\n iterable<binary_expr<T, LeftExpr, BinaryOp, RightExpr>>\n{\nprivate:\n static_assert(cpp::or_c<\n cpp::and_c<std::is_same<LeftExpr, scalar<T>>, std::is_same<RightExpr, scalar<T>>>,\n cpp::and_c<is_etl_expr<LeftExpr>, std::is_same<RightExpr, scalar<T>>>,\n cpp::and_c<is_etl_expr<RightExpr>, std::is_same<LeftExpr, scalar<T>>>,\n cpp::and_c<is_etl_expr<LeftExpr>, is_etl_expr<RightExpr>>>::value,\n \"One argument must be an ETL expression and the other one convertible to T\");\n\n using this_type = binary_expr<T, LeftExpr, BinaryOp, RightExpr>; \/\/\/< This type\n\n LeftExpr lhs; \/\/\/< The Left hand side expression\n RightExpr rhs; \/\/\/< The right hand side expression\n\n friend struct etl_traits<binary_expr>;\n friend struct optimizer<binary_expr>;\n friend struct optimizable<binary_expr>;\n friend struct transformer<binary_expr>;\n\npublic:\n using value_type = T; \/\/\/< The Value type\n using memory_type = void; \/\/\/< The memory type\n using const_memory_type = void; \/\/\/< The const memory type\n using iterator = etl::iterator<const this_type>; \/\/\/< The iterator type\n using const_iterator = etl::iterator<const this_type>; \/\/\/< The const iterator type\n\n \/*!\n * \\brief The vectorization type for V\n *\/\n template <typename V = default_vec>\n using vec_type = typename V::template vec_type<T>;\n\n \/\/Cannot be constructed with no args\n binary_expr() = delete;\n\n \/*!\n * \\brief Construct a new binary expression\n * \\param l The left hand side of the expression\n * \\param r The right hand side of the expression\n *\/\n binary_expr(LeftExpr l, RightExpr r)\n : lhs(std::forward<LeftExpr>(l)), rhs(std::forward<RightExpr>(r)) {\n \/\/Nothing else to init\n }\n\n \/*!\n * \\brief Copy construct a new binary expression\n * \\param e The expression from which to copy\n *\/\n binary_expr(const binary_expr& e) = default;\n\n \/*!\n * \\brief Move construct a new binary expression\n * \\param e The expression from which to move\n *\/\n binary_expr(binary_expr&& e) noexcept = default;\n\n \/\/Expressions are invariant\n binary_expr& operator=(const binary_expr& e) = delete;\n binary_expr& operator=(binary_expr&& e) = delete;\n\n \/*!\n * \\brief Test if this expression aliases with the given expression\n * \\param rhs The other expression to test\n * \\return true if the two expressions aliases, false otherwise\n *\/\n template <typename E>\n bool alias(const E& other) const noexcept {\n return lhs.alias(other) || rhs.alias(other);\n }\n\n \/\/Apply the expression\n\n \/*!\n * \\brief Returns the element at the given index\n * \\param i The index\n * \\return a reference to the element at the given index.\n *\/\n value_type operator[](std::size_t i) const {\n return BinaryOp::apply(lhs[i], rhs[i]);\n }\n\n \/*!\n * \\brief Returns the value at the given index\n * This function never alters the state of the container.\n * \\param i The index\n * \\return the value at the given index.\n *\/\n value_type read_flat(std::size_t i) const {\n return BinaryOp::apply(lhs.read_flat(i), rhs.read_flat(i));\n }\n\n \/*!\n * \\brief Perform several operations at once.\n * \\param i The index at which to perform the operation\n * \\tparam V The vectorization mode to use\n * \\return a vector containing several results of the expression\n *\/\n template <typename V = default_vec>\n ETL_STRONG_INLINE(vec_type<V>) load(std::size_t i) const {\n return BinaryOp::template load<V>(lhs.template load<V>(i), rhs.template load<V>(i));\n }\n\n \/*!\n * \\brief Perform several operations at once.\n * \\param i The index at which to perform the operation\n * \\tparam V The vectorization mode to use\n * \\return a vector containing several results of the expression\n *\/\n template <typename V = default_vec>\n ETL_STRONG_INLINE(vec_type<V>) loadu(std::size_t i) const {\n return BinaryOp::template load<V>(lhs.template loadu<V>(i), rhs.template loadu<V>(i));\n }\n\n \/*!\n * \\brief Returns the value at the given position (args...)\n * \\param args The position indices\n * \\return The value at the given position (args...)\n *\/\n template <typename... S, cpp_enable_if(sizeof...(S) == safe_dimensions<this_type>::value)>\n value_type operator()(S... args) const {\n static_assert(cpp::all_convertible_to<std::size_t, S...>::value, \"Invalid size types\");\n\n return BinaryOp::apply(lhs(args...), rhs(args...));\n }\n\n \/*!\n * \\brief Creates a sub view of the expression, effectively removing the first dimension and fixing it to the given index.\n * \\param i The index to use\n * \\return a sub view of the expression at position i.\n *\/\n template <bool B = (safe_dimensions<this_type>::value > 1), cpp_enable_if(B)>\n auto operator()(std::size_t i) {\n return sub(*this, i);\n }\n\n \/*!\n * \\brief Creates a sub view of the expression, effectively removing the first dimension and fixing it to the given index.\n * \\param i The index to use\n * \\return a sub view of the expression at position i.\n *\/\n template <bool B = (safe_dimensions<this_type>::value > 1), cpp_enable_if(B)>\n auto operator()(std::size_t i) const {\n return sub(*this, i);\n }\n\n \/*!\n * \\brief Creates a slice view of the matrix, effectively reducing the first dimension.\n * \\param first The first index to use\n * \\param last The last index to use\n * \\return a slice view of the matrix at position i.\n *\/\n auto slice(std::size_t first, std::size_t last) noexcept {\n return etl::slice(*this, first, last);\n }\n\n \/*!\n * \\brief Creates a slice view of the matrix, effectively reducing the first dimension.\n * \\param first The first index to use\n * \\param last The last index to use\n * \\return a slice view of the matrix at position i.\n *\/\n auto slice(std::size_t first, std::size_t last) const noexcept {\n return etl::slice(*this, first, last);\n }\n\n \/\/ Assignment functions\n\n \/*!\n * \\brief Assign to the given left-hand-side expression\n * \\param lhs The expression to which assign\n *\/\n template<typename L>\n void assign_to(L&& lhs) const {\n std_assign_evaluate(*this, lhs);\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 \/\/ Internals\n\n \/*!\n * \\brief Apply the given visitor to this expression and its descendants.\n * \\param visitor The visitor to apply\n *\/\n void visit(const detail::temporary_allocator_visitor& visitor) const {\n lhs.visit(visitor);\n rhs.visit(visitor);\n }\n\n \/*!\n * \\brief Apply the given visitor to this expression and its descendants.\n * \\param visitor The visitor to apply\n *\/\n void visit(const detail::back_propagate_visitor& visitor) const {\n lhs.visit(visitor);\n rhs.visit(visitor);\n }\n\n \/*!\n * \\brief Apply the given visitor to this expression and its descendants.\n * \\param visitor The visitor to apply\n *\/\n void visit(detail::evaluator_visitor& visitor) const {\n bool old_need_value = visitor.need_value;\n visitor.need_value = true;\n lhs.visit(visitor);\n visitor.need_value = true;\n rhs.visit(visitor);\n visitor.need_value = old_need_value;\n }\n\n \/*!\n * \\brief Prints the type of the binary expression to the 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 binary_expr& expr) {\n if (BinaryOp::desc_func) {\n return os << BinaryOp::desc() << \"(\" << expr.lhs << \", \" << expr.rhs << \")\";\n } else {\n return os << \"(\" << expr.lhs << ' ' << BinaryOp::desc() << ' ' << expr.rhs << \")\";\n }\n }\n};\n\n\/*!\n * \\brief Specialization for binary_expr.\n *\/\ntemplate <typename T, typename LeftExpr, typename BinaryOp, typename RightExpr>\nstruct etl_traits<etl::binary_expr<T, LeftExpr, BinaryOp, RightExpr>> {\n using expr_t = etl::binary_expr<T, LeftExpr, BinaryOp, RightExpr>; \/\/\/< The type of the expression\n using left_expr_t = std::decay_t<LeftExpr>; \/\/\/< The type of the left expression\n using right_expr_t = std::decay_t<RightExpr>; \/\/\/< The type of the right expression\n using value_type = T; \/\/\/< The value type\n\n static constexpr bool left_directed = cpp::not_u<etl_traits<left_expr_t>::is_generator>::value; \/\/\/< True if directed by the left expression, false otherwise\n\n using sub_expr_t = std::conditional_t<left_directed, left_expr_t, right_expr_t>; \/\/\/< The type of sub 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 = etl_traits<sub_expr_t>::is_fast; \/\/\/< Indicates if the expression is fast\n static constexpr bool is_linear = etl_traits<left_expr_t>::is_linear && etl_traits<right_expr_t>::is_linear && BinaryOp::linear; \/\/\/< Indicates if the expression is linear\n static constexpr bool is_thread_safe = etl_traits<left_expr_t>::is_thread_safe && etl_traits<right_expr_t>::is_thread_safe && BinaryOp::thread_safe; \/\/\/< Indicates if the expression is linear\n static constexpr bool is_value = false; \/\/\/< Indicates if the expression is of value type\n static constexpr bool is_direct = false; \/\/\/< Indicates if the expression has direct memory access\n static constexpr bool is_generator = etl_traits<left_expr_t>::is_generator && etl_traits<right_expr_t>::is_generator; \/\/\/< Indicates if the expression is a generator expression\n static constexpr bool needs_evaluator_visitor = etl_traits<left_expr_t>::needs_evaluator_visitor || etl_traits<right_expr_t>::needs_evaluator_visitor; \/\/\/< Indicaes if the expression needs an evaluator visitor\n static constexpr bool is_padded = is_linear && etl_traits<left_expr_t>::is_padded && etl_traits<right_expr_t>::is_padded; \/\/\/< Indicates if the expression is padded\n static constexpr bool is_aligned = is_linear && etl_traits<left_expr_t>::is_aligned && etl_traits<right_expr_t>::is_aligned; \/\/\/< Indicates if the expression is padded\n static constexpr order storage_order = etl_traits<left_expr_t>::is_generator ? etl_traits<right_expr_t>::storage_order : etl_traits<left_expr_t>::storage_order; \/\/\/< The expression 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 = cpp::bool_constant<\n etl_traits<left_expr_t>::template vectorizable<V>::value && etl_traits<right_expr_t>::template vectorizable<V>::value && BinaryOp::template vectorizable<V>::value>;\n\n \/*!\n * \\brief Get reference to the main sub expression\n * \\param v The binary expr\n * \\return a refernece to the main sub expression\n *\/\n template <bool B = left_directed, cpp_enable_if(B)>\n static constexpr auto& get(const expr_t& v) {\n return v.lhs;\n }\n\n \/*!\n * \\brief Get reference to the main sub expression\n * \\param v The binary expr\n * \\return a refernece to the main sub expression\n *\/\n template <bool B = left_directed, cpp_disable_if(B)>\n static constexpr auto& get(const expr_t& v) {\n return v.rhs;\n }\n\n \/*!\n * \\brief Returns the size of the given expression\n * \\param v The expression to get the size for\n * \\returns the size of the given expression\n *\/\n static std::size_t size(const expr_t& v) {\n return etl_traits<sub_expr_t>::size(get(v));\n }\n\n \/*!\n * \\brief Returns the dth dimension of the given expression\n * \\param v The expression\n * \\param d The dimension to get\n * \\return The dth dimension of the given expression\n *\/\n static std::size_t dim(const expr_t& v, std::size_t d) {\n return etl_traits<sub_expr_t>::dim(get(v), d);\n }\n\n \/*!\n * \\brief Returns the size of an expression of this fast type.\n * \\returns the size of an expression of this fast type.\n *\/\n static constexpr std::size_t size() {\n return etl_traits<sub_expr_t>::size();\n }\n\n \/*!\n * \\brief Returns the Dth dimension of an expression of this type\n * \\tparam D The dimension to get\n * \\return the Dth dimension of an expression of this type\n *\/\n template <std::size_t D>\n static constexpr std::size_t dim() {\n return etl_traits<sub_expr_t>::template dim<D>();\n }\n\n \/*!\n * \\brief Returns the number of expressions for this type\n * \\return the number of dimensions of this type\n *\/\n static constexpr std::size_t dimensions() {\n return etl_traits<sub_expr_t>::dimensions();\n }\n};\n\n} \/\/end of namespace etl\n<commit_msg>Fix the doc<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\nnamespace etl {\n\n\/*!\n * \\brief A binary expression\n *\n * A binary expression has a left hand side expression and a right hand side expression and for each element applies a binary opeartor to both expressions.\n *\/\ntemplate <typename T, typename LeftExpr, typename BinaryOp, typename RightExpr>\nstruct binary_expr final :\n dim_testable<binary_expr<T, LeftExpr, BinaryOp, RightExpr>>,\n value_testable<binary_expr<T, LeftExpr, BinaryOp, RightExpr>>,\n iterable<binary_expr<T, LeftExpr, BinaryOp, RightExpr>>\n{\nprivate:\n static_assert(cpp::or_c<\n cpp::and_c<std::is_same<LeftExpr, scalar<T>>, std::is_same<RightExpr, scalar<T>>>,\n cpp::and_c<is_etl_expr<LeftExpr>, std::is_same<RightExpr, scalar<T>>>,\n cpp::and_c<is_etl_expr<RightExpr>, std::is_same<LeftExpr, scalar<T>>>,\n cpp::and_c<is_etl_expr<LeftExpr>, is_etl_expr<RightExpr>>>::value,\n \"One argument must be an ETL expression and the other one convertible to T\");\n\n using this_type = binary_expr<T, LeftExpr, BinaryOp, RightExpr>; \/\/\/< This type\n\n LeftExpr lhs; \/\/\/< The Left hand side expression\n RightExpr rhs; \/\/\/< The right hand side expression\n\n friend struct etl_traits<binary_expr>;\n friend struct optimizer<binary_expr>;\n friend struct optimizable<binary_expr>;\n friend struct transformer<binary_expr>;\n\npublic:\n using value_type = T; \/\/\/< The Value type\n using memory_type = void; \/\/\/< The memory type\n using const_memory_type = void; \/\/\/< The const memory type\n using iterator = etl::iterator<const this_type>; \/\/\/< The iterator type\n using const_iterator = etl::iterator<const this_type>; \/\/\/< The const iterator type\n\n \/*!\n * \\brief The vectorization type for V\n *\/\n template <typename V = default_vec>\n using vec_type = typename V::template vec_type<T>;\n\n \/\/Cannot be constructed with no args\n binary_expr() = delete;\n\n \/*!\n * \\brief Construct a new binary expression\n * \\param l The left hand side of the expression\n * \\param r The right hand side of the expression\n *\/\n binary_expr(LeftExpr l, RightExpr r)\n : lhs(std::forward<LeftExpr>(l)), rhs(std::forward<RightExpr>(r)) {\n \/\/Nothing else to init\n }\n\n \/*!\n * \\brief Copy construct a new binary expression\n * \\param e The expression from which to copy\n *\/\n binary_expr(const binary_expr& e) = default;\n\n \/*!\n * \\brief Move construct a new binary expression\n * \\param e The expression from which to move\n *\/\n binary_expr(binary_expr&& e) noexcept = default;\n\n \/\/Expressions are invariant\n binary_expr& operator=(const binary_expr& e) = delete;\n binary_expr& operator=(binary_expr&& e) = delete;\n\n \/*!\n * \\brief Test if this expression aliases with the given expression\n * \\param other The other expression to test\n * \\return true if the two expressions aliases, false otherwise\n *\/\n template <typename E>\n bool alias(const E& other) const noexcept {\n return lhs.alias(other) || rhs.alias(other);\n }\n\n \/\/Apply the expression\n\n \/*!\n * \\brief Returns the element at the given index\n * \\param i The index\n * \\return a reference to the element at the given index.\n *\/\n value_type operator[](std::size_t i) const {\n return BinaryOp::apply(lhs[i], rhs[i]);\n }\n\n \/*!\n * \\brief Returns the value at the given index\n * This function never alters the state of the container.\n * \\param i The index\n * \\return the value at the given index.\n *\/\n value_type read_flat(std::size_t i) const {\n return BinaryOp::apply(lhs.read_flat(i), rhs.read_flat(i));\n }\n\n \/*!\n * \\brief Perform several operations at once.\n * \\param i The index at which to perform the operation\n * \\tparam V The vectorization mode to use\n * \\return a vector containing several results of the expression\n *\/\n template <typename V = default_vec>\n ETL_STRONG_INLINE(vec_type<V>) load(std::size_t i) const {\n return BinaryOp::template load<V>(lhs.template load<V>(i), rhs.template load<V>(i));\n }\n\n \/*!\n * \\brief Perform several operations at once.\n * \\param i The index at which to perform the operation\n * \\tparam V The vectorization mode to use\n * \\return a vector containing several results of the expression\n *\/\n template <typename V = default_vec>\n ETL_STRONG_INLINE(vec_type<V>) loadu(std::size_t i) const {\n return BinaryOp::template load<V>(lhs.template loadu<V>(i), rhs.template loadu<V>(i));\n }\n\n \/*!\n * \\brief Returns the value at the given position (args...)\n * \\param args The position indices\n * \\return The value at the given position (args...)\n *\/\n template <typename... S, cpp_enable_if(sizeof...(S) == safe_dimensions<this_type>::value)>\n value_type operator()(S... args) const {\n static_assert(cpp::all_convertible_to<std::size_t, S...>::value, \"Invalid size types\");\n\n return BinaryOp::apply(lhs(args...), rhs(args...));\n }\n\n \/*!\n * \\brief Creates a sub view of the expression, effectively removing the first dimension and fixing it to the given index.\n * \\param i The index to use\n * \\return a sub view of the expression at position i.\n *\/\n template <bool B = (safe_dimensions<this_type>::value > 1), cpp_enable_if(B)>\n auto operator()(std::size_t i) {\n return sub(*this, i);\n }\n\n \/*!\n * \\brief Creates a sub view of the expression, effectively removing the first dimension and fixing it to the given index.\n * \\param i The index to use\n * \\return a sub view of the expression at position i.\n *\/\n template <bool B = (safe_dimensions<this_type>::value > 1), cpp_enable_if(B)>\n auto operator()(std::size_t i) const {\n return sub(*this, i);\n }\n\n \/*!\n * \\brief Creates a slice view of the matrix, effectively reducing the first dimension.\n * \\param first The first index to use\n * \\param last The last index to use\n * \\return a slice view of the matrix at position i.\n *\/\n auto slice(std::size_t first, std::size_t last) noexcept {\n return etl::slice(*this, first, last);\n }\n\n \/*!\n * \\brief Creates a slice view of the matrix, effectively reducing the first dimension.\n * \\param first The first index to use\n * \\param last The last index to use\n * \\return a slice view of the matrix at position i.\n *\/\n auto slice(std::size_t first, std::size_t last) const noexcept {\n return etl::slice(*this, first, last);\n }\n\n \/\/ Assignment functions\n\n \/*!\n * \\brief Assign to the given left-hand-side expression\n * \\param lhs The expression to which assign\n *\/\n template<typename L>\n void assign_to(L&& lhs) const {\n std_assign_evaluate(*this, lhs);\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 \/\/ Internals\n\n \/*!\n * \\brief Apply the given visitor to this expression and its descendants.\n * \\param visitor The visitor to apply\n *\/\n void visit(const detail::temporary_allocator_visitor& visitor) const {\n lhs.visit(visitor);\n rhs.visit(visitor);\n }\n\n \/*!\n * \\brief Apply the given visitor to this expression and its descendants.\n * \\param visitor The visitor to apply\n *\/\n void visit(const detail::back_propagate_visitor& visitor) const {\n lhs.visit(visitor);\n rhs.visit(visitor);\n }\n\n \/*!\n * \\brief Apply the given visitor to this expression and its descendants.\n * \\param visitor The visitor to apply\n *\/\n void visit(detail::evaluator_visitor& visitor) const {\n bool old_need_value = visitor.need_value;\n visitor.need_value = true;\n lhs.visit(visitor);\n visitor.need_value = true;\n rhs.visit(visitor);\n visitor.need_value = old_need_value;\n }\n\n \/*!\n * \\brief Prints the type of the binary expression to the 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 binary_expr& expr) {\n if (BinaryOp::desc_func) {\n return os << BinaryOp::desc() << \"(\" << expr.lhs << \", \" << expr.rhs << \")\";\n } else {\n return os << \"(\" << expr.lhs << ' ' << BinaryOp::desc() << ' ' << expr.rhs << \")\";\n }\n }\n};\n\n\/*!\n * \\brief Specialization for binary_expr.\n *\/\ntemplate <typename T, typename LeftExpr, typename BinaryOp, typename RightExpr>\nstruct etl_traits<etl::binary_expr<T, LeftExpr, BinaryOp, RightExpr>> {\n using expr_t = etl::binary_expr<T, LeftExpr, BinaryOp, RightExpr>; \/\/\/< The type of the expression\n using left_expr_t = std::decay_t<LeftExpr>; \/\/\/< The type of the left expression\n using right_expr_t = std::decay_t<RightExpr>; \/\/\/< The type of the right expression\n using value_type = T; \/\/\/< The value type\n\n static constexpr bool left_directed = cpp::not_u<etl_traits<left_expr_t>::is_generator>::value; \/\/\/< True if directed by the left expression, false otherwise\n\n using sub_expr_t = std::conditional_t<left_directed, left_expr_t, right_expr_t>; \/\/\/< The type of sub 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 = etl_traits<sub_expr_t>::is_fast; \/\/\/< Indicates if the expression is fast\n static constexpr bool is_linear = etl_traits<left_expr_t>::is_linear && etl_traits<right_expr_t>::is_linear && BinaryOp::linear; \/\/\/< Indicates if the expression is linear\n static constexpr bool is_thread_safe = etl_traits<left_expr_t>::is_thread_safe && etl_traits<right_expr_t>::is_thread_safe && BinaryOp::thread_safe; \/\/\/< Indicates if the expression is linear\n static constexpr bool is_value = false; \/\/\/< Indicates if the expression is of value type\n static constexpr bool is_direct = false; \/\/\/< Indicates if the expression has direct memory access\n static constexpr bool is_generator = etl_traits<left_expr_t>::is_generator && etl_traits<right_expr_t>::is_generator; \/\/\/< Indicates if the expression is a generator expression\n static constexpr bool needs_evaluator_visitor = etl_traits<left_expr_t>::needs_evaluator_visitor || etl_traits<right_expr_t>::needs_evaluator_visitor; \/\/\/< Indicaes if the expression needs an evaluator visitor\n static constexpr bool is_padded = is_linear && etl_traits<left_expr_t>::is_padded && etl_traits<right_expr_t>::is_padded; \/\/\/< Indicates if the expression is padded\n static constexpr bool is_aligned = is_linear && etl_traits<left_expr_t>::is_aligned && etl_traits<right_expr_t>::is_aligned; \/\/\/< Indicates if the expression is padded\n static constexpr order storage_order = etl_traits<left_expr_t>::is_generator ? etl_traits<right_expr_t>::storage_order : etl_traits<left_expr_t>::storage_order; \/\/\/< The expression 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 = cpp::bool_constant<\n etl_traits<left_expr_t>::template vectorizable<V>::value && etl_traits<right_expr_t>::template vectorizable<V>::value && BinaryOp::template vectorizable<V>::value>;\n\n \/*!\n * \\brief Get reference to the main sub expression\n * \\param v The binary expr\n * \\return a refernece to the main sub expression\n *\/\n template <bool B = left_directed, cpp_enable_if(B)>\n static constexpr auto& get(const expr_t& v) {\n return v.lhs;\n }\n\n \/*!\n * \\brief Get reference to the main sub expression\n * \\param v The binary expr\n * \\return a refernece to the main sub expression\n *\/\n template <bool B = left_directed, cpp_disable_if(B)>\n static constexpr auto& get(const expr_t& v) {\n return v.rhs;\n }\n\n \/*!\n * \\brief Returns the size of the given expression\n * \\param v The expression to get the size for\n * \\returns the size of the given expression\n *\/\n static std::size_t size(const expr_t& v) {\n return etl_traits<sub_expr_t>::size(get(v));\n }\n\n \/*!\n * \\brief Returns the dth dimension of the given expression\n * \\param v The expression\n * \\param d The dimension to get\n * \\return The dth dimension of the given expression\n *\/\n static std::size_t dim(const expr_t& v, std::size_t d) {\n return etl_traits<sub_expr_t>::dim(get(v), d);\n }\n\n \/*!\n * \\brief Returns the size of an expression of this fast type.\n * \\returns the size of an expression of this fast type.\n *\/\n static constexpr std::size_t size() {\n return etl_traits<sub_expr_t>::size();\n }\n\n \/*!\n * \\brief Returns the Dth dimension of an expression of this type\n * \\tparam D The dimension to get\n * \\return the Dth dimension of an expression of this type\n *\/\n template <std::size_t D>\n static constexpr std::size_t dim() {\n return etl_traits<sub_expr_t>::template dim<D>();\n }\n\n \/*!\n * \\brief Returns the number of expressions for this type\n * \\return the number of dimensions of this type\n *\/\n static constexpr std::size_t dimensions() {\n return etl_traits<sub_expr_t>::dimensions();\n }\n};\n\n} \/\/end of namespace etl\n<|endoftext|>"} {"text":"<commit_before>\/*************************************************************************\n *\n * Copyright 2016 Realm Inc.\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n *\n **************************************************************************\/\n\n#ifndef REALM_COLUMN_TIMESTAMP_HPP\n#define REALM_COLUMN_TIMESTAMP_HPP\n\n#include <realm\/column.hpp>\n#include <realm\/timestamp.hpp>\n\nnamespace realm {\n\n\/\/ Inherits from ColumnTemplate to get a compare_values() that can be called without knowing the\n\/\/ column type\nclass TimestampColumn : public ColumnBaseSimple {\npublic:\n TimestampColumn(bool nullable, Allocator& alloc, ref_type ref, size_t col_ndx = npos);\n\n static ref_type create(Allocator& alloc, size_t size, bool nullable);\n static size_t get_size_from_ref(ref_type root_ref, Allocator& alloc) noexcept;\n\n \/\/\/ Get the number of entries in this column. This operation is relatively\n \/\/\/ slow.\n size_t size() const noexcept override;\n \/\/\/ Whether or not this column is nullable.\n bool is_nullable() const noexcept override;\n \/\/\/ Whether or not the value at \\a row_ndx is NULL. If the column is not\n \/\/\/ nullable, always returns false.\n bool is_null(size_t row_ndx) const noexcept override;\n \/\/\/ Sets the value at \\a row_ndx to be NULL.\n \/\/\/ \\throw LogicError Thrown if this column is not nullable.\n void set_null(size_t row_ndx) override;\n void insert_rows(size_t row_ndx, size_t num_rows_to_insert, size_t prior_num_rows, bool nullable) override;\n void erase_rows(size_t row_ndx, size_t num_rows_to_erase, size_t prior_num_rows,\n bool broken_reciprocal_backlinks) override;\n void move_last_row_over(size_t row_ndx, size_t prior_num_rows, bool broken_reciprocal_backlinks) override;\n void clear(size_t num_rows, bool broken_reciprocal_backlinks) override;\n void swap_rows(size_t row_ndx_1, size_t row_ndx_2) override;\n void destroy() noexcept override;\n\n bool has_search_index() const noexcept final\n {\n return bool(m_search_index);\n }\n StringIndex* get_search_index() noexcept final\n {\n return m_search_index.get();\n }\n StringIndex* get_search_index() const noexcept final\n {\n return m_search_index.get();\n }\n void destroy_search_index() noexcept override;\n void set_search_index_ref(ref_type ref, ArrayParent* parent, size_t ndx_in_parent,\n bool allow_duplicate_values) final;\n void populate_search_index();\n StringIndex* create_search_index() override;\n bool supports_search_index() const noexcept final\n {\n return true;\n }\n\n StringData get_index_data(size_t, StringIndex::StringConversionBuffer& buffer) const noexcept override;\n ref_type write(size_t slice_offset, size_t slice_size, size_t table_size, _impl::OutputStream&) const override;\n void update_from_parent(size_t old_baseline) noexcept override;\n void set_ndx_in_parent(size_t ndx) noexcept override;\n void refresh_accessor_tree(size_t new_col_ndx, const Spec&) override;\n\n void verify() const override;\n void to_dot(std::ostream&, StringData title = StringData()) const override;\n void do_dump_node_structure(std::ostream&, int level) const override;\n void leaf_to_dot(MemRef, ArrayParent*, size_t ndx_in_parent, std::ostream&) const override;\n\n void add(const Timestamp& ts = Timestamp{});\n Timestamp get(size_t row_ndx) const noexcept;\n void set(size_t row_ndx, const Timestamp& ts);\n bool compare(const TimestampColumn& c) const noexcept;\n int compare_values(size_t row1, size_t row2) const noexcept override;\n\n Timestamp maximum(size_t* result_index) const;\n Timestamp minimum(size_t* result_index) const;\n size_t count(Timestamp) const;\n void erase(size_t row_ndx, bool is_last);\n\n template <class Condition>\n size_t find(Timestamp value, size_t begin, size_t end) const noexcept\n {\n \/\/ FIXME: Here we can do all sorts of clever optimizations. Use bithack-search on seconds, then for each match\n \/\/ check nanoseconds, etc. Lots of possibilities. Below code is naive and slow but works.\n\n Condition cond;\n for (size_t t = begin; t < end; t++) {\n Timestamp ts = get(t);\n if (cond(ts, value, ts.is_null(), value.is_null()))\n return t;\n }\n return npos;\n }\n\n typedef Timestamp value_type;\n\nprivate:\n std::unique_ptr<BpTree<util::Optional<int64_t>>> m_seconds;\n std::unique_ptr<BpTree<int64_t>> m_nanoseconds;\n\n std::unique_ptr<StringIndex> m_search_index;\n bool m_nullable;\n\n template <class BT>\n class CreateHandler;\n\n template <class Condition>\n Timestamp minmax(size_t* result_index) const noexcept\n {\n \/\/ Condition is realm::Greater for maximum and realm::Less for minimum. Any non-null value is both larger\n \/\/ and smaller than a non-null value.\n if (size() == 0) {\n if (result_index)\n *result_index = npos;\n return Timestamp{};\n }\n\n Timestamp best = get(0);\n size_t best_index = 0;\n\n for (size_t i = 1; i < size(); ++i) {\n Timestamp candidate = get(i);\n if (best.is_null() && !candidate.is_null() || Condition()(candidate, best, candidate.is_null(), best.is_null())) {\n best = candidate;\n best_index = i;\n }\n }\n if (result_index)\n *result_index = best_index;\n return best;\n }\n};\n\n} \/\/ namespace realm\n\n#endif \/\/ REALM_COLUMN_TIMESTAMP_HPP\n<commit_msg>Jenkins warning<commit_after>\/*************************************************************************\n *\n * Copyright 2016 Realm Inc.\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n *\n **************************************************************************\/\n\n#ifndef REALM_COLUMN_TIMESTAMP_HPP\n#define REALM_COLUMN_TIMESTAMP_HPP\n\n#include <realm\/column.hpp>\n#include <realm\/timestamp.hpp>\n\nnamespace realm {\n\n\/\/ Inherits from ColumnTemplate to get a compare_values() that can be called without knowing the\n\/\/ column type\nclass TimestampColumn : public ColumnBaseSimple {\npublic:\n TimestampColumn(bool nullable, Allocator& alloc, ref_type ref, size_t col_ndx = npos);\n\n static ref_type create(Allocator& alloc, size_t size, bool nullable);\n static size_t get_size_from_ref(ref_type root_ref, Allocator& alloc) noexcept;\n\n \/\/\/ Get the number of entries in this column. This operation is relatively\n \/\/\/ slow.\n size_t size() const noexcept override;\n \/\/\/ Whether or not this column is nullable.\n bool is_nullable() const noexcept override;\n \/\/\/ Whether or not the value at \\a row_ndx is NULL. If the column is not\n \/\/\/ nullable, always returns false.\n bool is_null(size_t row_ndx) const noexcept override;\n \/\/\/ Sets the value at \\a row_ndx to be NULL.\n \/\/\/ \\throw LogicError Thrown if this column is not nullable.\n void set_null(size_t row_ndx) override;\n void insert_rows(size_t row_ndx, size_t num_rows_to_insert, size_t prior_num_rows, bool nullable) override;\n void erase_rows(size_t row_ndx, size_t num_rows_to_erase, size_t prior_num_rows,\n bool broken_reciprocal_backlinks) override;\n void move_last_row_over(size_t row_ndx, size_t prior_num_rows, bool broken_reciprocal_backlinks) override;\n void clear(size_t num_rows, bool broken_reciprocal_backlinks) override;\n void swap_rows(size_t row_ndx_1, size_t row_ndx_2) override;\n void destroy() noexcept override;\n\n bool has_search_index() const noexcept final\n {\n return bool(m_search_index);\n }\n StringIndex* get_search_index() noexcept final\n {\n return m_search_index.get();\n }\n StringIndex* get_search_index() const noexcept final\n {\n return m_search_index.get();\n }\n void destroy_search_index() noexcept override;\n void set_search_index_ref(ref_type ref, ArrayParent* parent, size_t ndx_in_parent,\n bool allow_duplicate_values) final;\n void populate_search_index();\n StringIndex* create_search_index() override;\n bool supports_search_index() const noexcept final\n {\n return true;\n }\n\n StringData get_index_data(size_t, StringIndex::StringConversionBuffer& buffer) const noexcept override;\n ref_type write(size_t slice_offset, size_t slice_size, size_t table_size, _impl::OutputStream&) const override;\n void update_from_parent(size_t old_baseline) noexcept override;\n void set_ndx_in_parent(size_t ndx) noexcept override;\n void refresh_accessor_tree(size_t new_col_ndx, const Spec&) override;\n\n void verify() const override;\n void to_dot(std::ostream&, StringData title = StringData()) const override;\n void do_dump_node_structure(std::ostream&, int level) const override;\n void leaf_to_dot(MemRef, ArrayParent*, size_t ndx_in_parent, std::ostream&) const override;\n\n void add(const Timestamp& ts = Timestamp{});\n Timestamp get(size_t row_ndx) const noexcept;\n void set(size_t row_ndx, const Timestamp& ts);\n bool compare(const TimestampColumn& c) const noexcept;\n int compare_values(size_t row1, size_t row2) const noexcept override;\n\n Timestamp maximum(size_t* result_index) const;\n Timestamp minimum(size_t* result_index) const;\n size_t count(Timestamp) const;\n void erase(size_t row_ndx, bool is_last);\n\n template <class Condition>\n size_t find(Timestamp value, size_t begin, size_t end) const noexcept\n {\n \/\/ FIXME: Here we can do all sorts of clever optimizations. Use bithack-search on seconds, then for each match\n \/\/ check nanoseconds, etc. Lots of possibilities. Below code is naive and slow but works.\n\n Condition cond;\n for (size_t t = begin; t < end; t++) {\n Timestamp ts = get(t);\n if (cond(ts, value, ts.is_null(), value.is_null()))\n return t;\n }\n return npos;\n }\n\n typedef Timestamp value_type;\n\nprivate:\n std::unique_ptr<BpTree<util::Optional<int64_t>>> m_seconds;\n std::unique_ptr<BpTree<int64_t>> m_nanoseconds;\n\n std::unique_ptr<StringIndex> m_search_index;\n bool m_nullable;\n\n template <class BT>\n class CreateHandler;\n\n template <class Condition>\n Timestamp minmax(size_t* result_index) const noexcept\n {\n \/\/ Condition is realm::Greater for maximum and realm::Less for minimum. Any non-null value is both larger\n \/\/ and smaller than a non-null value.\n if (size() == 0) {\n if (result_index)\n *result_index = npos;\n return Timestamp{};\n }\n\n Timestamp best = get(0);\n size_t best_index = 0;\n\n for (size_t i = 1; i < size(); ++i) {\n Timestamp candidate = get(i);\n if ((best.is_null() && !candidate.is_null()) || Condition()(candidate, best, candidate.is_null(), best.is_null())) {\n best = candidate;\n best_index = i;\n }\n }\n if (result_index)\n *result_index = best_index;\n return best;\n }\n};\n\n} \/\/ namespace realm\n\n#endif \/\/ REALM_COLUMN_TIMESTAMP_HPP\n<|endoftext|>"} {"text":"<commit_before>#ifndef LIBPORT_SINGLETON_PTR_HH\n# define LIBPORT_SINGLETON_PTR_HH\n\n# include <libport\/export.hh>\n\n# define STATIC_INSTANCE_(Cl, Name)\t\t\t\t\t\\\n class Cl ## Name;\t\t\t\t\t\t\t\\\n libport::SingletonPtr<Cl ## Name> Name;\t\t\t\t\\\n template<> Cl ## Name* libport::SingletonPtr<Cl ## Name>::ptr = 0\n\n\n# define STATIC_INSTANCE_DECL_(Cl, Name)\t\t\t\t\\\n class Cl ## Name\t\t\t\t\t\t\t\\\n : public Cl\t\t\t\t\t\t\t\t\\\n {};\t\t\t\t\t\t\t\t\t\\\n STATIC_INSTANCE_(Cl, Name)\n\n\n# define EXTERN_STATIC_INSTANCE_EX(Cl, Name, Api)\t\t\t\\\n class Api Cl ## Name\t\t\t\t\t\t\t\\\n : public Cl\t\t\t\t\t\t\t\t\\\n {};\t\t\t\t\t\t\t\t\t\\\n Api extern libport::SingletonPtr<Cl ## Name> Name;\n\n\n# define EXTERN_STATIC_INSTANCE(Cl, Name)\t\t\t\t\\\n EXTERN_STATIC_INSTANCE_EX(Cl, Name, \/* No API. *\/)\n\n\/\/ These _NS version are made to bypass vcxx error C2888\n\/\/ cf: http:\/\/msdn.microsoft.com\/en-us\/library\/27zksbks(VS.80).aspx\n\/\/ Symbol in libport cannot be defined inside urbi. This appeared\n\/\/ after changes done for liburbi Java.\n\/\/ Use them \"outside\" of any namespace.\n\n# define STATIC_INSTANCE_NS_EX(Cl, Name, NS, Api)\t\t\t\\\n namespace NS {\t\t\t\t\t\t\t\\\n Api libport::SingletonPtr<Cl ## Name> Name;\t\t\t\t\\\n }\t\t\t\t\t\t\t\t\t\\\n template<> Api NS::Cl ## Name*\t\t\t\t\t\\\n libport::SingletonPtr<NS::Cl ## Name>::ptr = 0\n\n# define STATIC_INSTANCE_NS(Cl, Name, NS)\t\t\t\t\\\n STATIC_INSTANCE_NS_EX(Cl, Name, NS, \/* No API *\/)\n\n# define STATIC_INSTANCE_DECL_NS(Cl, Name, NS)\t\t\t\t\\\n namespace NS {\t\t\t\t\t\t\t\\\n class Cl ## Name\t\t\t\t\t\t\t\\\n : public Cl\t\t\t\t\t\t\t\\\n {};\t\t\t\t\t\t\t\t\t\\\n }\t\t\t\t\t\t\t\t\t\\\n STATIC_INSTANCE_NS(Cl, Name, NS)\n\nnamespace libport\n{\n \/\/\/ Singleton smart pointer that creates the object on demand.\n template<typename T>\n class SingletonPtr\n {\n public:\n operator T* ();\n operator T& ();\n T* operator ->();\n\n private:\n static T* instance();\n LIBPORT_API static T* ptr;\n };\n\n} \/\/ namespace libport\n\n# include <libport\/singleton-ptr.hxx>\n\n#endif \/\/ !LIBPORT_SINGLETON_PTR_HH\n<commit_msg>Put the export declaration onto the class, not the static member.<commit_after>#ifndef LIBPORT_SINGLETON_PTR_HH\n# define LIBPORT_SINGLETON_PTR_HH\n\n# include <libport\/export.hh>\n\n# define STATIC_INSTANCE_(Cl, Name)\t\t\t\t\t\\\n class Cl ## Name;\t\t\t\t\t\t\t\\\n libport::SingletonPtr<Cl ## Name> Name;\t\t\t\t\\\n template<> Cl ## Name* libport::SingletonPtr<Cl ## Name>::ptr = 0\n\n\n# define STATIC_INSTANCE_DECL_(Cl, Name)\t\t\t\t\\\n class Cl ## Name\t\t\t\t\t\t\t\\\n : public Cl\t\t\t\t\t\t\t\t\\\n {};\t\t\t\t\t\t\t\t\t\\\n STATIC_INSTANCE_(Cl, Name)\n\n\n# define EXTERN_STATIC_INSTANCE_EX(Cl, Name, Api)\t\t\t\\\n class Api Cl ## Name\t\t\t\t\t\t\t\\\n : public Cl\t\t\t\t\t\t\t\t\\\n {};\t\t\t\t\t\t\t\t\t\\\n Api extern libport::SingletonPtr<Cl ## Name> Name;\n\n\n# define EXTERN_STATIC_INSTANCE(Cl, Name)\t\t\t\t\\\n EXTERN_STATIC_INSTANCE_EX(Cl, Name, \/* No API. *\/)\n\n\/\/ These _NS version are made to bypass vcxx error C2888\n\/\/ cf: http:\/\/msdn.microsoft.com\/en-us\/library\/27zksbks(VS.80).aspx\n\/\/ Symbol in libport cannot be defined inside urbi. This appeared\n\/\/ after changes done for liburbi Java.\n\/\/ Use them \"outside\" of any namespace.\n\n# define STATIC_INSTANCE_NS_EX(Cl, Name, NS, Api)\t\t\t\\\n namespace NS {\t\t\t\t\t\t\t\\\n Api libport::SingletonPtr<Cl ## Name> Name;\t\t\t\t\\\n }\t\t\t\t\t\t\t\t\t\\\n template<> Api NS::Cl ## Name*\t\t\t\t\t\\\n libport::SingletonPtr<NS::Cl ## Name>::ptr = 0\n\n# define STATIC_INSTANCE_NS(Cl, Name, NS)\t\t\t\t\\\n STATIC_INSTANCE_NS_EX(Cl, Name, NS, \/* No API *\/)\n\n# define STATIC_INSTANCE_DECL_NS(Cl, Name, NS)\t\t\t\t\\\n namespace NS {\t\t\t\t\t\t\t\\\n class Cl ## Name\t\t\t\t\t\t\t\\\n : public Cl\t\t\t\t\t\t\t\\\n {};\t\t\t\t\t\t\t\t\t\\\n }\t\t\t\t\t\t\t\t\t\\\n STATIC_INSTANCE_NS(Cl, Name, NS)\n\nnamespace libport\n{\n \/\/\/ Singleton smart pointer that creates the object on demand.\n template<typename T>\n class LIBPORT_API SingletonPtr\n {\n public:\n operator T* ();\n operator T& ();\n T* operator ->();\n\n private:\n static T* instance();\n static T* ptr;\n };\n\n} \/\/ namespace libport\n\n# include <libport\/singleton-ptr.hxx>\n\n#endif \/\/ !LIBPORT_SINGLETON_PTR_HH\n<|endoftext|>"} {"text":"<commit_before>#pragma once\n\n#include <math.h>\n\nnamespace lda_util {\n\n inline bool\n valid_probability_vector(const std::vector<float> &p){\n float sum = 0;\n for(auto x: p){\n if(std::isfinite(x) == false) return false;\n if(x < 0) return false;\n sum+=x;\n }\n return (std::abs(1 - sum) < 0.01);\n }\n\n template<typename T>\n std::set<T>\n unique_members(std::vector<std::vector<T>> nested_list){\n std::set<T> unique_values;\n for(std::vector<T> list: nested_list){\n for(T val: list){\n unique_values.insert(val);\n }\n }\n return unique_values;\n }\n\n template<typename T>\n T\n max_element(std::vector<std::vector<T>> nested_list){\n std::set<T> unique_values;\n for(std::vector<T> list: nested_list){\n for(T val: list){\n unique_values.insert(val);\n }\n }\n return *std::max_element(unique_values.begin(), unique_values.end());\n }\n\n template<typename T> void\n removeFirst(std::vector<T> &v, T element){\n auto it = std::find(v.begin(),v.end(), element);\n if (it != v.end()) {\n v.erase(it);\n }\n }\n\n \/\/ http:\/\/stackoverflow.com\/a\/1267878\/982745\n template< class T >\n std::vector<T>\n selectByIndex(const std::vector<T> &v, const std::vector<size_t> &index ) {\n std::vector<T> new_v;\n new_v.reserve(index.size());\n for(size_t i: index){\n new_v.push_back(v[i]);\n }\n\n return new_v;\n }\n\n\n template<class T>\n void\n normalize(std::vector<T> &v){\n Eigen::Map<Eigen::Matrix<T, Eigen::Dynamic, 1>> vec(v.data(), v.size());\n vec \/= vec.sum();\n }\n\n template<class T, class J>\n class defaultdict{\n J default_value;\n std::map<T, J> map;\n public:\n defaultdict(J val){\n default_value = val;\n map = std::map<T, J>();\n }\n\n J get(T t) {\n if(map.count(t) > 0){\n return map[t];\n }\n else{\n return default_value;\n }\n }\n\n void\n set(T t, J j){\n map[t] = j;\n }\n\n void\n incr(T t, J by){\n if(map.count(t) > 0){\n map[t] += by;\n }\n else{\n map[t] = by + default_value;\n }\n }\n\n void\n decr(T t, J by){\n if(map.count(t) > 0){\n map[t] -= by;\n }\n else{\n map[t] = default_value - by;\n }\n }\n\n bool\n contains(T t){\n return map.count(t) > 0;\n }\n };\n}<commit_msg>Add includes for stl<commit_after>#pragma once\n\n#include <math.h>\n#include <vector>\n#include <set>\n\nnamespace lda_util {\n\n inline bool\n valid_probability_vector(const std::vector<float> &p){\n float sum = 0;\n for(auto x: p){\n if(std::isfinite(x) == false) return false;\n if(x < 0) return false;\n sum+=x;\n }\n return (std::abs(1 - sum) < 0.01);\n }\n\n template<typename T>\n std::set<T>\n unique_members(std::vector<std::vector<T>> nested_list){\n std::set<T> unique_values;\n for(std::vector<T> list: nested_list){\n for(T val: list){\n unique_values.insert(val);\n }\n }\n return unique_values;\n }\n\n template<typename T>\n T\n max_element(std::vector<std::vector<T>> nested_list){\n std::set<T> unique_values;\n for(std::vector<T> list: nested_list){\n for(T val: list){\n unique_values.insert(val);\n }\n }\n return *std::max_element(unique_values.begin(), unique_values.end());\n }\n\n template<typename T> void\n removeFirst(std::vector<T> &v, T element){\n auto it = std::find(v.begin(),v.end(), element);\n if (it != v.end()) {\n v.erase(it);\n }\n }\n\n \/\/ http:\/\/stackoverflow.com\/a\/1267878\/982745\n template< class T >\n std::vector<T>\n selectByIndex(const std::vector<T> &v, const std::vector<size_t> &index ) {\n std::vector<T> new_v;\n new_v.reserve(index.size());\n for(size_t i: index){\n new_v.push_back(v[i]);\n }\n\n return new_v;\n }\n\n\n template<class T>\n void\n normalize(std::vector<T> &v){\n Eigen::Map<Eigen::Matrix<T, Eigen::Dynamic, 1>> vec(v.data(), v.size());\n vec \/= vec.sum();\n }\n\n template<class T, class J>\n class defaultdict{\n J default_value;\n std::map<T, J> map;\n public:\n defaultdict(J val){\n default_value = val;\n map = std::map<T, J>();\n }\n\n J get(T t) {\n if(map.count(t) > 0){\n return map[t];\n }\n else{\n return default_value;\n }\n }\n\n void\n set(T t, J j){\n map[t] = j;\n }\n\n void\n incr(T t, J by){\n if(map.count(t) > 0){\n map[t] += by;\n }\n else{\n map[t] = by + default_value;\n }\n }\n\n void\n decr(T t, J by){\n if(map.count(t) > 0){\n map[t] -= by;\n }\n else{\n map[t] = default_value - by;\n }\n }\n\n bool\n contains(T t){\n return map.count(t) > 0;\n }\n };\n}<|endoftext|>"} {"text":"<commit_before>\/*\n * Copyright © 2014 Intel Corporation\n *\n * Permission is hereby granted, free of charge, to any person obtaining a\n * copy of this software and associated documentation files (the \"Software\"),\n * to deal in the Software without restriction, including without limitation\n * the rights to use, copy, modify, merge, publish, distribute, sublicense,\n * and\/or sell copies of the Software, and to permit persons to whom the\n * Software is furnished to do so, subject to the following conditions:\n *\n * The above copyright notice and this permission notice (including the next\n * paragraph) shall be included in all copies or substantial portions of the\n * Software.\n *\n * THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\n * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\n * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL\n * THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\n * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING\n * FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS\n * IN THE SOFTWARE.\n *\/\n\n#include \"brw_vec4.h\"\n#include \"brw_vec4_live_variables.h\"\n#include \"brw_cfg.h\"\n\n\/** @file brw_vec4_dead_code_eliminate.cpp\n *\n * Dataflow-aware dead code elimination.\n *\n * Walks the instruction list from the bottom, removing instructions that\n * have results that both aren't used in later blocks and haven't been read\n * yet in the tail end of this block.\n *\/\n\nusing namespace brw;\n\nbool\nvec4_visitor::dead_code_eliminate()\n{\n bool progress = false;\n\n calculate_live_intervals();\n\n int num_vars = live_intervals->num_vars;\n BITSET_WORD *live = ralloc_array(NULL, BITSET_WORD, BITSET_WORDS(num_vars));\n BITSET_WORD *flag_live = ralloc_array(NULL, BITSET_WORD, 1);\n\n foreach_block_reverse_safe(block, cfg) {\n memcpy(live, live_intervals->block_data[block->num].liveout,\n sizeof(BITSET_WORD) * BITSET_WORDS(num_vars));\n memcpy(flag_live, live_intervals->block_data[block->num].flag_liveout,\n sizeof(BITSET_WORD));\n\n foreach_inst_in_block_reverse_safe(vec4_instruction, inst, block) {\n if ((inst->dst.file == VGRF && !inst->has_side_effects()) ||\n (inst->dst.is_null() && inst->writes_flag())){\n bool result_live[4] = { false };\n\n if (inst->dst.file == VGRF) {\n for (unsigned i = 0; i < regs_written(inst); i++) {\n for (int c = 0; c < 4; c++)\n result_live[c] |= BITSET_TEST(live,\n var_from_reg(alloc,\n byte_offset(inst->dst, i * REG_SIZE), c));\n }\n } else {\n for (unsigned c = 0; c < 4; c++)\n result_live[c] = BITSET_TEST(flag_live, c);\n }\n\n \/* If the instruction can't do writemasking, then it's all or\n * nothing.\n *\/\n if (!inst->can_do_writemask(devinfo)) {\n bool result = result_live[0] | result_live[1] |\n result_live[2] | result_live[3];\n result_live[0] = result;\n result_live[1] = result;\n result_live[2] = result;\n result_live[3] = result;\n }\n\n for (int c = 0; c < 4; c++) {\n if (!result_live[c] && inst->dst.writemask & (1 << c)) {\n inst->dst.writemask &= ~(1 << c);\n progress = true;\n\n if (inst->dst.writemask == 0) {\n if (inst->writes_accumulator || inst->writes_flag()) {\n inst->dst = dst_reg(retype(brw_null_reg(), inst->dst.type));\n } else {\n inst->opcode = BRW_OPCODE_NOP;\n break;\n }\n }\n }\n }\n }\n\n if (inst->dst.is_null() && inst->writes_flag()) {\n bool combined_live = false;\n for (unsigned c = 0; c < 4; c++)\n combined_live |= BITSET_TEST(flag_live, c);\n\n if (!combined_live) {\n inst->opcode = BRW_OPCODE_NOP;\n progress = true;\n }\n }\n\n if (inst->dst.file == VGRF && !inst->predicate) {\n for (unsigned i = 0; i < regs_written(inst); i++) {\n for (int c = 0; c < 4; c++) {\n if (inst->dst.writemask & (1 << c)) {\n BITSET_CLEAR(live,\n var_from_reg(alloc,\n byte_offset(inst->dst,\n i * REG_SIZE),\n c));\n }\n }\n }\n }\n\n if (inst->writes_flag() && !inst->predicate) {\n for (unsigned c = 0; c < 4; c++)\n BITSET_CLEAR(flag_live, c);\n }\n\n if (inst->opcode == BRW_OPCODE_NOP) {\n inst->remove(block);\n continue;\n }\n\n for (int i = 0; i < 3; i++) {\n if (inst->src[i].file == VGRF) {\n for (unsigned j = 0; j < regs_read(inst, i); j++) {\n for (int c = 0; c < 4; c++) {\n BITSET_SET(live, var_from_reg(alloc,\n byte_offset(inst->src[i],\n j * REG_SIZE),\n c));\n }\n }\n }\n }\n\n for (unsigned c = 0; c < 4; c++) {\n if (inst->reads_flag(c)) {\n BITSET_SET(flag_live, c);\n }\n }\n }\n }\n\n ralloc_free(live);\n ralloc_free(flag_live);\n\n if (progress)\n invalidate_live_intervals();\n\n return progress;\n}\n<commit_msg>i965\/vec4: zero allocated memory where needed<commit_after>\/*\n * Copyright © 2014 Intel Corporation\n *\n * Permission is hereby granted, free of charge, to any person obtaining a\n * copy of this software and associated documentation files (the \"Software\"),\n * to deal in the Software without restriction, including without limitation\n * the rights to use, copy, modify, merge, publish, distribute, sublicense,\n * and\/or sell copies of the Software, and to permit persons to whom the\n * Software is furnished to do so, subject to the following conditions:\n *\n * The above copyright notice and this permission notice (including the next\n * paragraph) shall be included in all copies or substantial portions of the\n * Software.\n *\n * THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\n * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\n * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL\n * THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\n * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING\n * FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS\n * IN THE SOFTWARE.\n *\/\n\n#include \"brw_vec4.h\"\n#include \"brw_vec4_live_variables.h\"\n#include \"brw_cfg.h\"\n\n\/** @file brw_vec4_dead_code_eliminate.cpp\n *\n * Dataflow-aware dead code elimination.\n *\n * Walks the instruction list from the bottom, removing instructions that\n * have results that both aren't used in later blocks and haven't been read\n * yet in the tail end of this block.\n *\/\n\nusing namespace brw;\n\nbool\nvec4_visitor::dead_code_eliminate()\n{\n bool progress = false;\n\n calculate_live_intervals();\n\n int num_vars = live_intervals->num_vars;\n BITSET_WORD *live = rzalloc_array(NULL, BITSET_WORD, BITSET_WORDS(num_vars));\n BITSET_WORD *flag_live = rzalloc_array(NULL, BITSET_WORD, 1);\n\n foreach_block_reverse_safe(block, cfg) {\n memcpy(live, live_intervals->block_data[block->num].liveout,\n sizeof(BITSET_WORD) * BITSET_WORDS(num_vars));\n memcpy(flag_live, live_intervals->block_data[block->num].flag_liveout,\n sizeof(BITSET_WORD));\n\n foreach_inst_in_block_reverse_safe(vec4_instruction, inst, block) {\n if ((inst->dst.file == VGRF && !inst->has_side_effects()) ||\n (inst->dst.is_null() && inst->writes_flag())){\n bool result_live[4] = { false };\n\n if (inst->dst.file == VGRF) {\n for (unsigned i = 0; i < regs_written(inst); i++) {\n for (int c = 0; c < 4; c++)\n result_live[c] |= BITSET_TEST(live,\n var_from_reg(alloc,\n byte_offset(inst->dst, i * REG_SIZE), c));\n }\n } else {\n for (unsigned c = 0; c < 4; c++)\n result_live[c] = BITSET_TEST(flag_live, c);\n }\n\n \/* If the instruction can't do writemasking, then it's all or\n * nothing.\n *\/\n if (!inst->can_do_writemask(devinfo)) {\n bool result = result_live[0] | result_live[1] |\n result_live[2] | result_live[3];\n result_live[0] = result;\n result_live[1] = result;\n result_live[2] = result;\n result_live[3] = result;\n }\n\n for (int c = 0; c < 4; c++) {\n if (!result_live[c] && inst->dst.writemask & (1 << c)) {\n inst->dst.writemask &= ~(1 << c);\n progress = true;\n\n if (inst->dst.writemask == 0) {\n if (inst->writes_accumulator || inst->writes_flag()) {\n inst->dst = dst_reg(retype(brw_null_reg(), inst->dst.type));\n } else {\n inst->opcode = BRW_OPCODE_NOP;\n break;\n }\n }\n }\n }\n }\n\n if (inst->dst.is_null() && inst->writes_flag()) {\n bool combined_live = false;\n for (unsigned c = 0; c < 4; c++)\n combined_live |= BITSET_TEST(flag_live, c);\n\n if (!combined_live) {\n inst->opcode = BRW_OPCODE_NOP;\n progress = true;\n }\n }\n\n if (inst->dst.file == VGRF && !inst->predicate) {\n for (unsigned i = 0; i < regs_written(inst); i++) {\n for (int c = 0; c < 4; c++) {\n if (inst->dst.writemask & (1 << c)) {\n BITSET_CLEAR(live,\n var_from_reg(alloc,\n byte_offset(inst->dst,\n i * REG_SIZE),\n c));\n }\n }\n }\n }\n\n if (inst->writes_flag() && !inst->predicate) {\n for (unsigned c = 0; c < 4; c++)\n BITSET_CLEAR(flag_live, c);\n }\n\n if (inst->opcode == BRW_OPCODE_NOP) {\n inst->remove(block);\n continue;\n }\n\n for (int i = 0; i < 3; i++) {\n if (inst->src[i].file == VGRF) {\n for (unsigned j = 0; j < regs_read(inst, i); j++) {\n for (int c = 0; c < 4; c++) {\n BITSET_SET(live, var_from_reg(alloc,\n byte_offset(inst->src[i],\n j * REG_SIZE),\n c));\n }\n }\n }\n }\n\n for (unsigned c = 0; c < 4; c++) {\n if (inst->reads_flag(c)) {\n BITSET_SET(flag_live, c);\n }\n }\n }\n }\n\n ralloc_free(live);\n ralloc_free(flag_live);\n\n if (progress)\n invalidate_live_intervals();\n\n return progress;\n}\n<|endoftext|>"} {"text":"<commit_before>\/*\n * Copyright 2018 The WebRTC project authors. All Rights Reserved.\n *\n * Use of this source code is governed by a BSD-style license\n * that can be found in the LICENSE file in the root of the source\n * tree. An additional intellectual property rights grant can be found\n * in the file PATENTS. All contributing project authors may\n * be found in the AUTHORS file in the root of the source tree.\n *\/\n#include \"test\/scenario\/network_node.h\"\n\n#include <algorithm>\n#include <vector>\n\n#include <memory>\n#include \"rtc_base\/numerics\/safe_minmax.h\"\n\nnamespace webrtc {\nnamespace test {\nnamespace {\nconstexpr char kDummyTransportName[] = \"dummy\";\nSimulatedNetwork::Config CreateSimulationConfig(\n NetworkSimulationConfig config) {\n SimulatedNetwork::Config sim_config;\n sim_config.link_capacity_kbps = config.bandwidth.kbps_or(0);\n sim_config.loss_percent = config.loss_rate * 100;\n sim_config.queue_delay_ms = config.delay.ms();\n sim_config.delay_standard_deviation_ms = config.delay_std_dev.ms();\n sim_config.packet_overhead = config.packet_overhead.bytes<int>();\n sim_config.codel_active_queue_management =\n config.codel_active_queue_management;\n sim_config.queue_length_packets =\n config.packet_queue_length_limit.value_or(0);\n return sim_config;\n}\n} \/\/ namespace\n\nSimulationNode::SimulationNode(NetworkSimulationConfig config,\n SimulatedNetwork* behavior,\n EmulatedNetworkNode* network_node)\n : config_(config), simulation_(behavior), network_node_(network_node) {}\n\nstd::unique_ptr<SimulatedNetwork> SimulationNode::CreateBehavior(\n NetworkSimulationConfig config) {\n SimulatedNetwork::Config sim_config = CreateSimulationConfig(config);\n return std::make_unique<SimulatedNetwork>(sim_config);\n}\n\nvoid SimulationNode::UpdateConfig(\n std::function<void(NetworkSimulationConfig*)> modifier) {\n modifier(&config_);\n SimulatedNetwork::Config sim_config = CreateSimulationConfig(config_);\n simulation_->SetConfig(sim_config);\n}\n\nvoid SimulationNode::PauseTransmissionUntil(Timestamp until) {\n simulation_->PauseTransmissionUntil(until.us());\n}\n\nColumnPrinter SimulationNode::ConfigPrinter() const {\n return ColumnPrinter::Lambda(\n \"propagation_delay capacity loss_rate\",\n [this](rtc::SimpleStringBuilder& sb) {\n sb.AppendFormat(\"%.3lf %.0lf %.2lf\", config_.delay.seconds<double>(),\n config_.bandwidth.bps() \/ 8.0, config_.loss_rate);\n });\n}\n\nNetworkNodeTransport::NetworkNodeTransport(Clock* sender_clock,\n Call* sender_call)\n : sender_clock_(sender_clock), sender_call_(sender_call) {}\n\nNetworkNodeTransport::~NetworkNodeTransport() = default;\n\nbool NetworkNodeTransport::SendRtp(const uint8_t* packet,\n size_t length,\n const PacketOptions& options) {\n int64_t send_time_ms = sender_clock_->TimeInMilliseconds();\n rtc::SentPacket sent_packet;\n sent_packet.packet_id = options.packet_id;\n sent_packet.info.included_in_feedback = options.included_in_feedback;\n sent_packet.info.included_in_allocation = options.included_in_allocation;\n sent_packet.send_time_ms = send_time_ms;\n sent_packet.info.packet_size_bytes = length;\n sent_packet.info.packet_type = rtc::PacketType::kData;\n sender_call_->OnSentPacket(sent_packet);\n\n rtc::CritScope crit(&crit_sect_);\n if (!endpoint_)\n return false;\n rtc::CopyOnWriteBuffer buffer(packet, length);\n endpoint_->SendPacket(local_address_, remote_address_, buffer,\n packet_overhead_.bytes());\n return true;\n}\n\nbool NetworkNodeTransport::SendRtcp(const uint8_t* packet, size_t length) {\n rtc::CopyOnWriteBuffer buffer(packet, length);\n rtc::CritScope crit(&crit_sect_);\n if (!endpoint_)\n return false;\n endpoint_->SendPacket(local_address_, remote_address_, buffer,\n packet_overhead_.bytes());\n return true;\n}\n\nvoid NetworkNodeTransport::Connect(EmulatedEndpoint* endpoint,\n const rtc::SocketAddress& receiver_address,\n DataSize packet_overhead) {\n rtc::NetworkRoute route;\n route.connected = true;\n \/\/ We assume that the address will be unique in the lower bytes.\n route.local_network_id = static_cast<uint16_t>(\n receiver_address.ipaddr().v4AddressAsHostOrderInteger());\n route.remote_network_id = static_cast<uint16_t>(\n receiver_address.ipaddr().v4AddressAsHostOrderInteger());\n {\n \/\/ Only IPv4 address is supported.\n RTC_CHECK_EQ(receiver_address.family(), AF_INET);\n rtc::CritScope crit(&crit_sect_);\n endpoint_ = endpoint;\n local_address_ = rtc::SocketAddress(endpoint_->GetPeerLocalAddress(), 0);\n remote_address_ = receiver_address;\n packet_overhead_ = packet_overhead;\n current_network_route_ = route;\n }\n\n sender_call_->GetTransportControllerSend()->OnNetworkRouteChanged(\n kDummyTransportName, route);\n}\n\nvoid NetworkNodeTransport::Disconnect() {\n rtc::CritScope crit(&crit_sect_);\n current_network_route_.connected = false;\n sender_call_->GetTransportControllerSend()->OnNetworkRouteChanged(\n kDummyTransportName, current_network_route_);\n current_network_route_ = {};\n endpoint_ = nullptr;\n}\n\n} \/\/ namespace test\n} \/\/ namespace webrtc\n<commit_msg>Adds transport overhead to route changes in scenario tests.<commit_after>\/*\n * Copyright 2018 The WebRTC project authors. All Rights Reserved.\n *\n * Use of this source code is governed by a BSD-style license\n * that can be found in the LICENSE file in the root of the source\n * tree. An additional intellectual property rights grant can be found\n * in the file PATENTS. All contributing project authors may\n * be found in the AUTHORS file in the root of the source tree.\n *\/\n#include \"test\/scenario\/network_node.h\"\n\n#include <algorithm>\n#include <vector>\n\n#include <memory>\n#include \"rtc_base\/net_helper.h\"\n#include \"rtc_base\/numerics\/safe_minmax.h\"\n\nnamespace webrtc {\nnamespace test {\nnamespace {\nconstexpr char kDummyTransportName[] = \"dummy\";\nSimulatedNetwork::Config CreateSimulationConfig(\n NetworkSimulationConfig config) {\n SimulatedNetwork::Config sim_config;\n sim_config.link_capacity_kbps = config.bandwidth.kbps_or(0);\n sim_config.loss_percent = config.loss_rate * 100;\n sim_config.queue_delay_ms = config.delay.ms();\n sim_config.delay_standard_deviation_ms = config.delay_std_dev.ms();\n sim_config.packet_overhead = config.packet_overhead.bytes<int>();\n sim_config.codel_active_queue_management =\n config.codel_active_queue_management;\n sim_config.queue_length_packets =\n config.packet_queue_length_limit.value_or(0);\n return sim_config;\n}\n} \/\/ namespace\n\nSimulationNode::SimulationNode(NetworkSimulationConfig config,\n SimulatedNetwork* behavior,\n EmulatedNetworkNode* network_node)\n : config_(config), simulation_(behavior), network_node_(network_node) {}\n\nstd::unique_ptr<SimulatedNetwork> SimulationNode::CreateBehavior(\n NetworkSimulationConfig config) {\n SimulatedNetwork::Config sim_config = CreateSimulationConfig(config);\n return std::make_unique<SimulatedNetwork>(sim_config);\n}\n\nvoid SimulationNode::UpdateConfig(\n std::function<void(NetworkSimulationConfig*)> modifier) {\n modifier(&config_);\n SimulatedNetwork::Config sim_config = CreateSimulationConfig(config_);\n simulation_->SetConfig(sim_config);\n}\n\nvoid SimulationNode::PauseTransmissionUntil(Timestamp until) {\n simulation_->PauseTransmissionUntil(until.us());\n}\n\nColumnPrinter SimulationNode::ConfigPrinter() const {\n return ColumnPrinter::Lambda(\n \"propagation_delay capacity loss_rate\",\n [this](rtc::SimpleStringBuilder& sb) {\n sb.AppendFormat(\"%.3lf %.0lf %.2lf\", config_.delay.seconds<double>(),\n config_.bandwidth.bps() \/ 8.0, config_.loss_rate);\n });\n}\n\nNetworkNodeTransport::NetworkNodeTransport(Clock* sender_clock,\n Call* sender_call)\n : sender_clock_(sender_clock), sender_call_(sender_call) {}\n\nNetworkNodeTransport::~NetworkNodeTransport() = default;\n\nbool NetworkNodeTransport::SendRtp(const uint8_t* packet,\n size_t length,\n const PacketOptions& options) {\n int64_t send_time_ms = sender_clock_->TimeInMilliseconds();\n rtc::SentPacket sent_packet;\n sent_packet.packet_id = options.packet_id;\n sent_packet.info.included_in_feedback = options.included_in_feedback;\n sent_packet.info.included_in_allocation = options.included_in_allocation;\n sent_packet.send_time_ms = send_time_ms;\n sent_packet.info.packet_size_bytes = length;\n sent_packet.info.packet_type = rtc::PacketType::kData;\n sender_call_->OnSentPacket(sent_packet);\n\n rtc::CritScope crit(&crit_sect_);\n if (!endpoint_)\n return false;\n rtc::CopyOnWriteBuffer buffer(packet, length);\n endpoint_->SendPacket(local_address_, remote_address_, buffer,\n packet_overhead_.bytes());\n return true;\n}\n\nbool NetworkNodeTransport::SendRtcp(const uint8_t* packet, size_t length) {\n rtc::CopyOnWriteBuffer buffer(packet, length);\n rtc::CritScope crit(&crit_sect_);\n if (!endpoint_)\n return false;\n endpoint_->SendPacket(local_address_, remote_address_, buffer,\n packet_overhead_.bytes());\n return true;\n}\n\nvoid NetworkNodeTransport::Connect(EmulatedEndpoint* endpoint,\n const rtc::SocketAddress& receiver_address,\n DataSize packet_overhead) {\n rtc::NetworkRoute route;\n route.connected = true;\n \/\/ We assume that the address will be unique in the lower bytes.\n route.local_network_id = static_cast<uint16_t>(\n receiver_address.ipaddr().v4AddressAsHostOrderInteger());\n route.remote_network_id = static_cast<uint16_t>(\n receiver_address.ipaddr().v4AddressAsHostOrderInteger());\n route.packet_overhead = packet_overhead.bytes() +\n receiver_address.ipaddr().overhead() +\n cricket::kUdpHeaderSize;\n {\n \/\/ Only IPv4 address is supported.\n RTC_CHECK_EQ(receiver_address.family(), AF_INET);\n rtc::CritScope crit(&crit_sect_);\n endpoint_ = endpoint;\n local_address_ = rtc::SocketAddress(endpoint_->GetPeerLocalAddress(), 0);\n remote_address_ = receiver_address;\n packet_overhead_ = packet_overhead;\n current_network_route_ = route;\n }\n\n sender_call_->GetTransportControllerSend()->OnNetworkRouteChanged(\n kDummyTransportName, route);\n}\n\nvoid NetworkNodeTransport::Disconnect() {\n rtc::CritScope crit(&crit_sect_);\n current_network_route_.connected = false;\n sender_call_->GetTransportControllerSend()->OnNetworkRouteChanged(\n kDummyTransportName, current_network_route_);\n current_network_route_ = {};\n endpoint_ = nullptr;\n}\n\n} \/\/ namespace test\n} \/\/ namespace webrtc\n<|endoftext|>"} {"text":"<commit_before>\/\/ See copyright notice in file Copyright in the root directory of this archive.\n\n#include \"MatternGVTManager.h\"\n#include \"SchedulingManager.h\"\n#include \"CommunicationManager.h\"\n#include \"TimeWarpSimulationManager.h\"\n#include \"MatternGVTMessage.h\"\n#include \"GVTUpdateMessage.h\"\n#include \"LazyOutputManager.h\"\n#include \"ObjectID.h\"\n#include <sstream>\nusing std::istringstream;\nusing std::ostringstream;\nusing std::cout;\nusing std::cerr;\nusing std::endl;\n\nMatternGVTManager::MatternGVTManager(TimeWarpSimulationManager *simMgr,\n unsigned int period) :\n GVTManagerImplementationBase(simMgr, period),\n objectRecord(new MatternObjectRecord()),\n gVTTokenPending(false)\n{\n ASSERT( mySimulationManager != NULL );\n ASSERT( mySimulationManager->getSchedulingManager() != NULL );\n myScheduler = mySimulationManager->getSchedulingManager();\n ASSERT( mySimulationManager->getCommunicationManager() != NULL );\n myCommunicationManager = mySimulationManager->getCommunicationManager();\n}\n\nMatternGVTManager::MatternGVTManager(TimeWarpSimulationManager *simMgr,\n unsigned int period, bool objectRecordDefined) :\n GVTManagerImplementationBase(simMgr, period),\n gVTTokenPending(false)\n{\n ASSERT( mySimulationManager != NULL );\n ASSERT( mySimulationManager->getSchedulingManager() != NULL );\n myScheduler = mySimulationManager->getSchedulingManager();\n ASSERT( mySimulationManager->getCommunicationManager() != NULL );\n myCommunicationManager = mySimulationManager->getCommunicationManager();\n}\n\n\nMatternGVTManager::~MatternGVTManager() {\n delete objectRecord;\n}\n\nbool MatternGVTManager::checkGVTPeriod() {\n if (!gVTTokenPending) {\n if(++gVTPeriodCounter == gVTPeriod){\n gVTPeriodCounter = 0;\n return true;\n }\n }\n return false;\n}\n\n\/\/ This is called before sending any event to keep track of the LTSE\nvoid MatternGVTManager::calculateGVTInfo(const VTime &receiveTime) {\n abort();\n}\n\n\/\/ This is called before sending an event to a remote simulation manager\nconst string MatternGVTManager::getGVTInfo(unsigned int srcSimMgr, unsigned int destSimMgr,\n const VTime &sendTime) {\n \/\/The timestamp information will be sent with the event, the color\n \/\/is the only information stored in GVTInfo\n int tokenColor = objectRecord->getColor();\n char c[2];\n sprintf(c,\"%d\", tokenColor);\n\n if(tokenColor == WHITE){\n \/\/Keep a count of all messages sent while the GVT Token is white\n objectRecord->incrementNumberOfWhiteMessages();\n } \n else{\n \/\/If the first round of GVT Control messages has passed our\n \/\/color is red so we should be monitoring the LTSE\n const VTime *minimumTime = (&sendTime);\n objectRecord->setMinTimeStamp(*minimumTime);\n }\n return c;\n}\n\n\/\/This is called when receiving a remote event\nvoid MatternGVTManager::updateEventRecord(const string &infoStream, unsigned int receivingSimMgr){\n \/\/ for mattern only color information will be present in the\n \/\/ info stream received from the kernel\n istringstream inputStream(infoStream);\n int tokenColor;\n inputStream >> tokenColor;\n\n if(tokenColor == WHITE) {\n objectRecord->decrementNumberOfWhiteMessages();\n }\n}\n\nvoid MatternGVTManager::calculateGVT() {\n \/\/ a few assumptions to state first:\n \/\/\n \/\/ a. SimulationManager(0) is assumed to be the initiator of the\n \/\/ gvt estimation procedure.\n \/\/\n \/\/ b. if numberOfSimulationManagers == 1, then the gVT is simply the\n \/\/ last scheduled event.\n ASSERT(mySimulationManager->getSimulationManagerID() == 0 );\n if (mySimulationManager->getNumberOfSimulationManagers() > 1) {\n \/\/ Okay, time to start off the gvt token.\n if (gVTTokenPending == false) {\n zeroWhiteMessagesAtStart=false;\n \/\/ Make sure there isn't a token already out there.\n const VTime *minimumTime = (&myScheduler->getLastEventScheduledTime());\n sendGVTToken(*minimumTime, mySimulationManager->getPositiveInfinity());\n\n objectRecord->setColor(RED);\n objectRecord->setNumberOfWhiteMessages(0);\n objectRecord->resetMinTimeStamp(mySimulationManager->getPositiveInfinity());\n gVTTokenPending = true;\n }\n } \n else { \/\/ numberOfSimulationManagers == 1\n \/\/ okay, we dont need to launch a distributed gvt estimation step\n \/\/ gVT is simply the last scheduled event's timestamp\n const VTime *minimumTime = (&myScheduler->getLastEventScheduledTime());\n setGVT(*minimumTime);\n cout << \"GVT = \" << getGVT() << endl;\n mySimulationManager->fossilCollect(getGVT());\n }\n}\n\n\/\/ ----------------------------------------------------------------\n\/\/ A GVTTokenMessage contains:\n\/\/ 1. VTime mClock; \/\/ minimum of the local clocks\n\/\/ 2. VTime mSend; \/\/ minimum of timestamps\n\/\/ 3. unsigned int count; \/\/ number of messages in transit\n\/\/ ----------------------------------------------------------------\nvoid MatternGVTManager::sendGVTToken(const VTime &lastScheduledEventTime,\n const VTime &minimumTimeStamp) {\n \/\/ My(malolan) changes here The guy, whom i am going to send to has to\n \/\/ know, how many white messages, i have sent and not the white messages\n \/\/ that, i have received so changing\n \/\/ objectRecordArray[myID].getNumberOfWhiteMessages() to\n \/\/ objectRecordArray[destination].getNumberOfWhiteMessages( send the\n \/\/ token to the next guy;\n unsigned int destination = 0;\n if (mySimulationManager->getSimulationManagerID()\n != mySimulationManager->getNumberOfSimulationManagers() - 1) {\n destination = mySimulationManager->getSimulationManagerID() + 1;\n }\n \/\/ increment the token iteration number\n objectRecord->incrementTokenIterationNumber();\n KernelMessage *messageToSend = new MatternGVTMessage(\n mySimulationManager->getSimulationManagerID(), destination,\n lastScheduledEventTime, minimumTimeStamp,\n objectRecord->getNumberOfWhiteMessages());\n ASSERT(myCommunicationManager != NULL);\n myCommunicationManager->sendMessage(messageToSend, destination);\n}\n\n\/\/ send out the latest gVT value to everyone\nvoid MatternGVTManager::sendGVTUpdate() {\n \/\/ send everybody except ourselves the gVT update message\n for (unsigned int c = 0; c < mySimulationManager->getNumberOfSimulationManagers(); c++) {\n if (mySimulationManager->getSimulationManagerID() != c) {\n KernelMessage *messageToSend =\n new GVTUpdateMessage(mySimulationManager->getSimulationManagerID(), c, getGVT());\n ASSERT(myCommunicationManager != NULL);\n myCommunicationManager->sendMessage(messageToSend, c);\n }\n }\n}\n\n\/\/ the MatternGVTManager must register the following message types with\n\/\/ the communication manager: GVTTokenMessage and GVTUpdateMessage\nvoid MatternGVTManager::registerWithCommunicationManager() {\n ASSERT(myCommunicationManager != NULL);\n myCommunicationManager->registerMessageType(GVTUpdateMessage::getGVTUpdateMessageType(), this);\n myCommunicationManager->registerMessageType(MatternGVTMessage::getMatternGVTMessageType(), this);\n}\n\n\/\/ the communication manager will call this method to deliver a\n\/\/ GVTTokenMessage or a GVTUpdateMessage.\nvoid MatternGVTManager::receiveKernelMessage(KernelMessage *msg) {\n ASSERT(msg != NULL);\n if (dynamic_cast<MatternGVTMessage *> (msg) != 0) {\n const MatternGVTMessage *gVTMessage = dynamic_cast<MatternGVTMessage *> (msg);\n const int count = gVTMessage->getNumMessagesInTransit();\n\n if (mySimulationManager->getSimulationManagerID() == 0) {\n \/\/ Initiator has received the control message.\n \/\/ Check to see if the count is zero and this is at least the second\n \/\/ round of the token. Continue until the count is 0 and all messages\n \/\/ in transit are accounted for.\n if (objectRecord->getTokenIterationNumber() > 1\n && (objectRecord->getNumberOfWhiteMessages() + count == 0)){\n\n \/\/ Need to remember the old gvt to compare it to the new.\n const VTime &oldGVT = getGVT();\n\n \/\/ Determine GVT.\n setGVT(MIN_FUNC(gVTMessage->getLastScheduledEventTime(),\n gVTMessage->getMinimumTimeStamp()));\n ASSERT(getGVT() >= oldGVT);\n\n \/\/ Send out the GVT update to the other simulation managers and reset to white.\n objectRecord->setTokenIterationNumber(0);\n objectRecord->setNumberOfWhiteMessages(0);\n objectRecord->setColor(WHITE);\n sendGVTUpdate();\n\n \/\/ End of this gvt calculation cycle.\n gVTTokenPending = false;\n \n \/\/ Only output the value and fossil collect when it actually changes.\n if(getGVT() > oldGVT){\n \/\/ Fossil collect now with the new GVT.\n \/\/cout << \"GVT = \" << getGVT() << endl;\n mySimulationManager->fossilCollect(getGVT());\n }\n } \n else {\n \/\/ Not yet ready to calculate gvt, send the token around again.\n objectRecord->setNumberOfWhiteMessages(objectRecord->getNumberOfWhiteMessages() + count);\n const VTime *lowEventTime = (&myScheduler->getLastEventScheduledTime());\n sendGVTToken(MIN_FUNC(gVTMessage->getLastScheduledEventTime(), *lowEventTime),\n MIN_FUNC(gVTMessage->getMinimumTimeStamp(), *objectRecord->getMinTimeStamp()));\n\n \/\/ This is reset to record the number of messages received since the last round.\n objectRecord->setNumberOfWhiteMessages(0);\n }\n } \n else {\n \/\/ The gvt token has been received by another simulation manager.\n \/\/ [a] Set color of this sim mgr to RED; set tMin = positive infinity.\n \/\/ [b] Pass on the token to processor(i mod n) + 1.\n if (objectRecord->getColor() == WHITE) {\n objectRecord->resetMinTimeStamp(mySimulationManager->getPositiveInfinity());\n objectRecord->setColor(RED);\n }\n\n \/\/ Add the the local white message count to the simulation's white message total.\n objectRecord->setNumberOfWhiteMessages(objectRecord->getNumberOfWhiteMessages() + count);\n\n const VTime *lowEventTime = (&myScheduler->getLastEventScheduledTime());\n sendGVTToken(MIN_FUNC(gVTMessage->getLastScheduledEventTime(),*lowEventTime),\n MIN_FUNC(gVTMessage->getMinimumTimeStamp(),*objectRecord->getMinTimeStamp()));\n\n \/\/ This is reset to record the number of messages received since the last round.\n objectRecord->setNumberOfWhiteMessages(0);\n }\n } \n else if (dynamic_cast<GVTUpdateMessage *> (msg) != 0) {\n const GVTUpdateMessage *gVTMessage = dynamic_cast<GVTUpdateMessage *> (msg);\n\n const VTime &oldGVT = getGVT();\n setGVT(gVTMessage->getNewGVT());\n ASSERT(getGVT() >= oldGVT);\n\n \/\/ Only fossil collect if the value has increased.\n if(getGVT() > oldGVT){\n \/\/ Fossil collect now with the new GVT.\n mySimulationManager->fossilCollect(getGVT());\n }\n\n \/\/ VERY IMPORTANT NOTE!!\n \/\/ The white message count is not reset here because by the time this\n \/\/ simulation manager gets the update token, it may have already received some\n \/\/ white messages from another simulation manager that already switched back\n \/\/ to white. These need to be taken into account for the next GVT calculation.\n objectRecord->setTokenIterationNumber(0);\n objectRecord->setColor(WHITE);\n } \n else {\n cerr << \"MatternGVTManager::receiveKernelMessage() received\"\n << \" unknown (\" << msg->getDataType() << \") message type\"\n << endl;\n cerr << \"Aborting simulation ...\" << endl;\n abort();\n }\n \/\/ We are done with this kernel message.\n delete msg;\n}\n\nconst VTime *MatternGVTManager::getEarliestEventTime(const VTime *lowEventTime) {\n if (mySimulationManager->getOutputMgrType() == LAZYMGR ||\n mySimulationManager->getOutputMgrType() == ADAPTIVEMGR) {\n LazyOutputManager *lmgr = static_cast<LazyOutputManager*>(mySimulationManager->getOutputManager());\n const VTime *lazyMinTime = &lmgr->getLazyQMinTime();\n lowEventTime = &MIN_FUNC(*lazyMinTime, *lowEventTime);\n }\n return lowEventTime;\n}\n\nvoid\nMatternGVTManager::ofcReset(){\n gVTTokenPending = false;\n gVTPeriodCounter = 0;\n objectRecord->setNumberOfWhiteMessages(0);\n objectRecord->setTokenIterationNumber(0);\n objectRecord->setColor(WHITE);\n}\n<commit_msg>similar optimization to a342b3a85a6ac396639feb7010904adcdd237e58 for receiving end, ~2% savings<commit_after>\/\/ See copyright notice in file Copyright in the root directory of this archive.\n\n#include \"MatternGVTManager.h\"\n#include \"SchedulingManager.h\"\n#include \"CommunicationManager.h\"\n#include \"TimeWarpSimulationManager.h\"\n#include \"MatternGVTMessage.h\"\n#include \"GVTUpdateMessage.h\"\n#include \"LazyOutputManager.h\"\n#include \"ObjectID.h\"\n#include <sstream>\nusing std::istringstream;\nusing std::ostringstream;\nusing std::cout;\nusing std::cerr;\nusing std::endl;\n\nMatternGVTManager::MatternGVTManager(TimeWarpSimulationManager *simMgr,\n unsigned int period) :\n GVTManagerImplementationBase(simMgr, period),\n objectRecord(new MatternObjectRecord()),\n gVTTokenPending(false)\n{\n ASSERT( mySimulationManager != NULL );\n ASSERT( mySimulationManager->getSchedulingManager() != NULL );\n myScheduler = mySimulationManager->getSchedulingManager();\n ASSERT( mySimulationManager->getCommunicationManager() != NULL );\n myCommunicationManager = mySimulationManager->getCommunicationManager();\n}\n\nMatternGVTManager::MatternGVTManager(TimeWarpSimulationManager *simMgr,\n unsigned int period, bool objectRecordDefined) :\n GVTManagerImplementationBase(simMgr, period),\n gVTTokenPending(false)\n{\n ASSERT( mySimulationManager != NULL );\n ASSERT( mySimulationManager->getSchedulingManager() != NULL );\n myScheduler = mySimulationManager->getSchedulingManager();\n ASSERT( mySimulationManager->getCommunicationManager() != NULL );\n myCommunicationManager = mySimulationManager->getCommunicationManager();\n}\n\n\nMatternGVTManager::~MatternGVTManager() {\n delete objectRecord;\n}\n\nbool MatternGVTManager::checkGVTPeriod() {\n if (!gVTTokenPending) {\n if(++gVTPeriodCounter == gVTPeriod){\n gVTPeriodCounter = 0;\n return true;\n }\n }\n return false;\n}\n\n\/\/ This is called before sending any event to keep track of the LTSE\nvoid MatternGVTManager::calculateGVTInfo(const VTime &receiveTime) {\n abort();\n}\n\n\/\/ This is called before sending an event to a remote simulation manager\nconst string MatternGVTManager::getGVTInfo(unsigned int srcSimMgr, unsigned int destSimMgr,\n const VTime &sendTime) {\n \/\/The timestamp information will be sent with the event, the color\n \/\/is the only information stored in GVTInfo\n int tokenColor = objectRecord->getColor();\n char c[2];\n sprintf(c,\"%d\", tokenColor);\n\n if(tokenColor == WHITE){\n \/\/Keep a count of all messages sent while the GVT Token is white\n objectRecord->incrementNumberOfWhiteMessages();\n } \n else{\n \/\/If the first round of GVT Control messages has passed our\n \/\/color is red so we should be monitoring the LTSE\n const VTime *minimumTime = (&sendTime);\n objectRecord->setMinTimeStamp(*minimumTime);\n }\n return c;\n}\n\n\/\/This is called when receiving a remote event\nvoid MatternGVTManager::updateEventRecord(const string &infoStream, unsigned int receivingSimMgr){\n \/\/ for mattern only color information will be present in the\n \/\/ info stream received from the kernel\n int tokenColor = atoi(infoStream.c_str());\n\n if(tokenColor == WHITE) {\n objectRecord->decrementNumberOfWhiteMessages();\n }\n}\n\nvoid MatternGVTManager::calculateGVT() {\n \/\/ a few assumptions to state first:\n \/\/\n \/\/ a. SimulationManager(0) is assumed to be the initiator of the\n \/\/ gvt estimation procedure.\n \/\/\n \/\/ b. if numberOfSimulationManagers == 1, then the gVT is simply the\n \/\/ last scheduled event.\n ASSERT(mySimulationManager->getSimulationManagerID() == 0 );\n if (mySimulationManager->getNumberOfSimulationManagers() > 1) {\n \/\/ Okay, time to start off the gvt token.\n if (gVTTokenPending == false) {\n zeroWhiteMessagesAtStart=false;\n \/\/ Make sure there isn't a token already out there.\n const VTime *minimumTime = (&myScheduler->getLastEventScheduledTime());\n sendGVTToken(*minimumTime, mySimulationManager->getPositiveInfinity());\n\n objectRecord->setColor(RED);\n objectRecord->setNumberOfWhiteMessages(0);\n objectRecord->resetMinTimeStamp(mySimulationManager->getPositiveInfinity());\n gVTTokenPending = true;\n }\n } \n else { \/\/ numberOfSimulationManagers == 1\n \/\/ okay, we dont need to launch a distributed gvt estimation step\n \/\/ gVT is simply the last scheduled event's timestamp\n const VTime *minimumTime = (&myScheduler->getLastEventScheduledTime());\n setGVT(*minimumTime);\n cout << \"GVT = \" << getGVT() << endl;\n mySimulationManager->fossilCollect(getGVT());\n }\n}\n\n\/\/ ----------------------------------------------------------------\n\/\/ A GVTTokenMessage contains:\n\/\/ 1. VTime mClock; \/\/ minimum of the local clocks\n\/\/ 2. VTime mSend; \/\/ minimum of timestamps\n\/\/ 3. unsigned int count; \/\/ number of messages in transit\n\/\/ ----------------------------------------------------------------\nvoid MatternGVTManager::sendGVTToken(const VTime &lastScheduledEventTime,\n const VTime &minimumTimeStamp) {\n \/\/ My(malolan) changes here The guy, whom i am going to send to has to\n \/\/ know, how many white messages, i have sent and not the white messages\n \/\/ that, i have received so changing\n \/\/ objectRecordArray[myID].getNumberOfWhiteMessages() to\n \/\/ objectRecordArray[destination].getNumberOfWhiteMessages( send the\n \/\/ token to the next guy;\n unsigned int destination = 0;\n if (mySimulationManager->getSimulationManagerID()\n != mySimulationManager->getNumberOfSimulationManagers() - 1) {\n destination = mySimulationManager->getSimulationManagerID() + 1;\n }\n \/\/ increment the token iteration number\n objectRecord->incrementTokenIterationNumber();\n KernelMessage *messageToSend = new MatternGVTMessage(\n mySimulationManager->getSimulationManagerID(), destination,\n lastScheduledEventTime, minimumTimeStamp,\n objectRecord->getNumberOfWhiteMessages());\n ASSERT(myCommunicationManager != NULL);\n myCommunicationManager->sendMessage(messageToSend, destination);\n}\n\n\/\/ send out the latest gVT value to everyone\nvoid MatternGVTManager::sendGVTUpdate() {\n \/\/ send everybody except ourselves the gVT update message\n for (unsigned int c = 0; c < mySimulationManager->getNumberOfSimulationManagers(); c++) {\n if (mySimulationManager->getSimulationManagerID() != c) {\n KernelMessage *messageToSend =\n new GVTUpdateMessage(mySimulationManager->getSimulationManagerID(), c, getGVT());\n ASSERT(myCommunicationManager != NULL);\n myCommunicationManager->sendMessage(messageToSend, c);\n }\n }\n}\n\n\/\/ the MatternGVTManager must register the following message types with\n\/\/ the communication manager: GVTTokenMessage and GVTUpdateMessage\nvoid MatternGVTManager::registerWithCommunicationManager() {\n ASSERT(myCommunicationManager != NULL);\n myCommunicationManager->registerMessageType(GVTUpdateMessage::getGVTUpdateMessageType(), this);\n myCommunicationManager->registerMessageType(MatternGVTMessage::getMatternGVTMessageType(), this);\n}\n\n\/\/ the communication manager will call this method to deliver a\n\/\/ GVTTokenMessage or a GVTUpdateMessage.\nvoid MatternGVTManager::receiveKernelMessage(KernelMessage *msg) {\n ASSERT(msg != NULL);\n if (dynamic_cast<MatternGVTMessage *> (msg) != 0) {\n const MatternGVTMessage *gVTMessage = dynamic_cast<MatternGVTMessage *> (msg);\n const int count = gVTMessage->getNumMessagesInTransit();\n\n if (mySimulationManager->getSimulationManagerID() == 0) {\n \/\/ Initiator has received the control message.\n \/\/ Check to see if the count is zero and this is at least the second\n \/\/ round of the token. Continue until the count is 0 and all messages\n \/\/ in transit are accounted for.\n if (objectRecord->getTokenIterationNumber() > 1\n && (objectRecord->getNumberOfWhiteMessages() + count == 0)){\n\n \/\/ Need to remember the old gvt to compare it to the new.\n const VTime &oldGVT = getGVT();\n\n \/\/ Determine GVT.\n setGVT(MIN_FUNC(gVTMessage->getLastScheduledEventTime(),\n gVTMessage->getMinimumTimeStamp()));\n ASSERT(getGVT() >= oldGVT);\n\n \/\/ Send out the GVT update to the other simulation managers and reset to white.\n objectRecord->setTokenIterationNumber(0);\n objectRecord->setNumberOfWhiteMessages(0);\n objectRecord->setColor(WHITE);\n sendGVTUpdate();\n\n \/\/ End of this gvt calculation cycle.\n gVTTokenPending = false;\n \n \/\/ Only output the value and fossil collect when it actually changes.\n if(getGVT() > oldGVT){\n \/\/ Fossil collect now with the new GVT.\n \/\/cout << \"GVT = \" << getGVT() << endl;\n mySimulationManager->fossilCollect(getGVT());\n }\n } \n else {\n \/\/ Not yet ready to calculate gvt, send the token around again.\n objectRecord->setNumberOfWhiteMessages(objectRecord->getNumberOfWhiteMessages() + count);\n const VTime *lowEventTime = (&myScheduler->getLastEventScheduledTime());\n sendGVTToken(MIN_FUNC(gVTMessage->getLastScheduledEventTime(), *lowEventTime),\n MIN_FUNC(gVTMessage->getMinimumTimeStamp(), *objectRecord->getMinTimeStamp()));\n\n \/\/ This is reset to record the number of messages received since the last round.\n objectRecord->setNumberOfWhiteMessages(0);\n }\n } \n else {\n \/\/ The gvt token has been received by another simulation manager.\n \/\/ [a] Set color of this sim mgr to RED; set tMin = positive infinity.\n \/\/ [b] Pass on the token to processor(i mod n) + 1.\n if (objectRecord->getColor() == WHITE) {\n objectRecord->resetMinTimeStamp(mySimulationManager->getPositiveInfinity());\n objectRecord->setColor(RED);\n }\n\n \/\/ Add the the local white message count to the simulation's white message total.\n objectRecord->setNumberOfWhiteMessages(objectRecord->getNumberOfWhiteMessages() + count);\n\n const VTime *lowEventTime = (&myScheduler->getLastEventScheduledTime());\n sendGVTToken(MIN_FUNC(gVTMessage->getLastScheduledEventTime(),*lowEventTime),\n MIN_FUNC(gVTMessage->getMinimumTimeStamp(),*objectRecord->getMinTimeStamp()));\n\n \/\/ This is reset to record the number of messages received since the last round.\n objectRecord->setNumberOfWhiteMessages(0);\n }\n } \n else if (dynamic_cast<GVTUpdateMessage *> (msg) != 0) {\n const GVTUpdateMessage *gVTMessage = dynamic_cast<GVTUpdateMessage *> (msg);\n\n const VTime &oldGVT = getGVT();\n setGVT(gVTMessage->getNewGVT());\n ASSERT(getGVT() >= oldGVT);\n\n \/\/ Only fossil collect if the value has increased.\n if(getGVT() > oldGVT){\n \/\/ Fossil collect now with the new GVT.\n mySimulationManager->fossilCollect(getGVT());\n }\n\n \/\/ VERY IMPORTANT NOTE!!\n \/\/ The white message count is not reset here because by the time this\n \/\/ simulation manager gets the update token, it may have already received some\n \/\/ white messages from another simulation manager that already switched back\n \/\/ to white. These need to be taken into account for the next GVT calculation.\n objectRecord->setTokenIterationNumber(0);\n objectRecord->setColor(WHITE);\n } \n else {\n cerr << \"MatternGVTManager::receiveKernelMessage() received\"\n << \" unknown (\" << msg->getDataType() << \") message type\"\n << endl;\n cerr << \"Aborting simulation ...\" << endl;\n abort();\n }\n \/\/ We are done with this kernel message.\n delete msg;\n}\n\nconst VTime *MatternGVTManager::getEarliestEventTime(const VTime *lowEventTime) {\n if (mySimulationManager->getOutputMgrType() == LAZYMGR ||\n mySimulationManager->getOutputMgrType() == ADAPTIVEMGR) {\n LazyOutputManager *lmgr = static_cast<LazyOutputManager*>(mySimulationManager->getOutputManager());\n const VTime *lazyMinTime = &lmgr->getLazyQMinTime();\n lowEventTime = &MIN_FUNC(*lazyMinTime, *lowEventTime);\n }\n return lowEventTime;\n}\n\nvoid\nMatternGVTManager::ofcReset(){\n gVTTokenPending = false;\n gVTPeriodCounter = 0;\n objectRecord->setNumberOfWhiteMessages(0);\n objectRecord->setTokenIterationNumber(0);\n objectRecord->setColor(WHITE);\n}\n<|endoftext|>"} {"text":"<commit_before>#include \"FWCore\/Framework\/interface\/Frameworkfwd.h\"\n#include \"FWCore\/Framework\/interface\/EDAnalyzer.h\"\n#include \"FWCore\/Framework\/interface\/Event.h\"\n#include \"FWCore\/Framework\/interface\/Run.h\"\n#include \"FWCore\/Framework\/interface\/MakerMacros.h\"\n#include \"FWCore\/Utilities\/interface\/InputTag.h\"\n#include \"FWCore\/Common\/interface\/TriggerNames.h\"\n#include \"DataFormats\/Common\/interface\/TriggerResults.h\"\n#include \"DataFormats\/Common\/interface\/Handle.h\"\n#include \"DataFormats\/PatCandidates\/interface\/TriggerObjectStandAlone.h\"\n\n#include \"PandaTree\/Objects\/interface\/Event.h\"\n\n#include \"..\/interface\/FillerBase.h\"\n#include \"..\/interface\/ObjectMap.h\"\n\n#include \"TFile.h\"\n#include \"TTree.h\"\n#include \"TH1D.h\"\n#include <vector>\n#include <utility>\n#include <chrono>\n\ntypedef std::chrono::steady_clock SClock;\ndouble toMS(SClock::duration const& interval)\n{\n return std::chrono::duration_cast<std::chrono::nanoseconds>(interval).count() * 1.e-6;\n}\n\nclass PandaProducer : public edm::EDAnalyzer {\npublic:\n explicit PandaProducer(edm::ParameterSet const&);\n ~PandaProducer();\n\nprivate:\n typedef edm::View<pat::TriggerObjectStandAlone> TriggerObjectView;\n\n void analyze(edm::Event const&, edm::EventSetup const&) override;\n void beginRun(edm::Run const&, edm::EventSetup const&) override;\n void endRun(edm::Run const&, edm::EventSetup const&) override;\n void beginJob() override;\n void endJob() override;\n\n std::vector<FillerBase*> fillers_;\n ObjectMapStore objectMaps_;\n\n VString selectEvents_;\n edm::EDGetTokenT<edm::TriggerResults> skimResultsToken_;\n edm::EDGetTokenT<edm::TriggerResults> hltResultsToken_;\n edm::EDGetTokenT<TriggerObjectView> triggerObjectsToken_;\n\n TFile* outputFile_{0};\n TTree* eventTree_{0};\n TTree* runTree_{0};\n TH1D* eventCounter_{0};\n panda::Event outEvent_;\n\n std::string outputName_;\n bool useTrigger_;\n \/\/ [[filter0, filter1, ...], ...] outer index runs over trigger objects\n std::vector<VString> triggerObjectNames_;\n unsigned printLevel_;\n\n std::vector<SClock::duration> timers_;\n SClock::time_point lastAnalyze_; \/\/! Time point of last return from analyze()\n unsigned long long nEvents_;\n};\n\nPandaProducer::PandaProducer(edm::ParameterSet const& _cfg) :\n selectEvents_(_cfg.getUntrackedParameter<VString>(\"SelectEvents\")),\n skimResultsToken_(consumes<edm::TriggerResults>(edm::InputTag(\"TriggerResults\"))), \/\/ no process name -> pick up the trigger results from the current process\n outputName_(_cfg.getUntrackedParameter<std::string>(\"outputFile\", \"panda.root\")),\n useTrigger_(_cfg.getUntrackedParameter<bool>(\"useTrigger\", true)),\n printLevel_(_cfg.getUntrackedParameter<unsigned>(\"printLevel\", 0)),\n timers_(),\n lastAnalyze_(),\n nEvents_(0)\n{\n auto&& coll(consumesCollector());\n\n auto& fillersCfg(_cfg.getUntrackedParameterSet(\"fillers\"));\n\n SClock::time_point start;\n\n for (auto& fillerName : fillersCfg.getParameterNames()) {\n if (fillerName == \"common\")\n continue;\n\n auto& fillerPSet(fillersCfg.getUntrackedParameterSet(fillerName));\n try {\n auto className(fillerPSet.getUntrackedParameter<std::string>(\"filler\") + \"Filler\");\n\n if (printLevel_ >= 1) {\n std::cout << \"[PandaProducer::PandaProducer] \" \n << \"Constructing \" << className << \"::\" << fillerName << std::endl;\n\n if (printLevel_ >= 3)\n start = SClock::now();\n }\n\n auto* filler(FillerFactoryStore::singleton()->makeFiller(className, fillerName, _cfg, coll));\n fillers_.push_back(filler);\n\n if (filler->enabled())\n filler->setObjectMap(objectMaps_[fillerName]);\n\n if (printLevel_ >= 1) {\n timers_.push_back(SClock::duration::zero());\n\n if (printLevel_ >= 3)\n std::cout << \"Initializing \" << fillerName << \" took \" << toMS(SClock::now() - start) << \" ms.\" << std::endl;\n }\n }\n catch (std::exception& ex) {\n std::cerr << \"[PandaProducer::PandaProducer] \" \n << \"Configuration error in \" << fillerName << \":\"\n << ex.what() << std::endl;\n throw;\n }\n }\n\n if (useTrigger_) {\n hltResultsToken_ = consumes<edm::TriggerResults>(edm::InputTag(\"TriggerResults\", \"\", \"HLT\"));\n triggerObjectsToken_ = consumes<TriggerObjectView>(edm::InputTag(fillersCfg.getUntrackedParameterSet(\"common\").getUntrackedParameter<std::string>(\"triggerObjects\")));\n }\n\n if (printLevel_ >= 1) {\n \/\/ timer for the CMSSW execution outside of this module\n timers_.push_back(SClock::duration::zero());\n }\n}\n\nPandaProducer::~PandaProducer()\n{\n for (auto* filler : fillers_)\n delete filler;\n}\n\nvoid\nPandaProducer::analyze(edm::Event const& _event, edm::EventSetup const& _setup)\n{\n eventCounter_->Fill(0.5);\n \n if (printLevel_ >= 1) {\n if (nEvents_ == 0) {\n if (printLevel_ >= 3)\n std::cout << \"[PandaProducer::analyze] \"\n << \"First event; CMSSW step time unknown\" << std::endl;\n\n }\n else {\n auto dt(SClock::now() - lastAnalyze_);\n if (printLevel_ >= 3)\n std::cout << \"[PandaProducer::analyze] \"\n << \"Previous (CMSSW) step took \" << toMS(dt) << \" ms\" << std::endl;\n\n timers_.back() += dt;\n }\n }\n\n ++nEvents_;\n\n SClock::time_point start;\n\n \/\/ Fill \"all events\" information\n for (unsigned iF(0); iF != fillers_.size(); ++iF) {\n auto* filler(fillers_[iF]);\n\n if (!filler->enabled())\n continue;\n\n try {\n if (printLevel_ >= 1) {\n start = SClock::now();\n\n if (printLevel_ >= 2)\n std::cout << \"[PandaProducer::analyze] \" \n << \"Calling \" << filler->getName() << \"->fillAll()\" << std::endl;\n }\n\n filler->fillAll(_event, _setup);\n\n if (printLevel_ >= 1) {\n auto dt(SClock::now() - start);\n\n if (printLevel_ >= 3) {\n std::cout << \"[PandaProducer::analyze] \" \n << \"Step \" << filler->getName() << \"->fillAll() took \" << toMS(dt) << \" ms\" << std::endl;\n }\n \n timers_[iF] += dt;\n }\n }\n catch (std::exception& ex) {\n std::cerr << \"[PandaProducer::analyze] \" \n << \"Error in \" << filler->getName() << \"::fillAll()\" << std::endl;\n throw;\n }\n }\n\n \/\/ If path names are given, check if at least one succeeded\n if (selectEvents_.size() != 0) {\n edm::Handle<edm::TriggerResults> triggerResults;\n if(_event.getByToken(skimResultsToken_, triggerResults)){\n auto& pathNames(_event.triggerNames(*triggerResults));\n unsigned iS(0);\n for (; iS != selectEvents_.size(); ++iS) {\n unsigned iP(pathNames.triggerIndex(selectEvents_[iS]));\n if (iP != pathNames.size() && triggerResults->accept(iP))\n break;\n }\n if (iS == selectEvents_.size())\n return;\n }\n }\n\n eventCounter_->Fill(1.5);\n\n \/\/ Now fill the event\n outEvent_.init();\n\n for (auto& mm : objectMaps_)\n mm.second.clearMaps();\n\n if (useTrigger_) {\n \/\/ Unpack trigger object names\n edm::Handle<edm::TriggerResults> triggerResultsHandle;\n _event.getByToken(hltResultsToken_, triggerResultsHandle);\n auto& triggerNames(_event.triggerNames(*triggerResultsHandle));\n\n edm::Handle<TriggerObjectView> triggerObjectsHandle;\n _event.getByToken(triggerObjectsToken_, triggerObjectsHandle);\n auto& triggerObjects(*triggerObjectsHandle);\n\n auto& objMap(objectMaps_[\"global\"].get<pat::TriggerObjectStandAlone, VString>());\n triggerObjectNames_.assign(triggerObjects.size(), VString());\n\n unsigned iObj(0);\n for (auto& obj : triggerObjects) {\n \/\/ need to create a copy to perform the non-const action of unpacking\n pat::TriggerObjectStandAlone copy(obj);\n copy.unpackPathNames(triggerNames);\n \n for (auto& label : obj.filterLabels())\n triggerObjectNames_[iObj].push_back(label);\n\n \/\/ link the pat trigger object to the list of labels\n objMap.add(triggerObjects.ptrAt(iObj), triggerObjectNames_[iObj]);\n ++iObj;\n }\n }\n\n outEvent_.runNumber = _event.id().run();\n outEvent_.lumiNumber = _event.luminosityBlock();\n outEvent_.eventNumber = _event.id().event();\n outEvent_.isData = _event.isRealData();\n\n for (unsigned iF(0); iF != fillers_.size(); ++iF) {\n auto* filler(fillers_[iF]);\n\n if (!filler->enabled())\n continue;\n\n try {\n if (printLevel_ >= 1) {\n if (printLevel_ >= 2)\n std::cout << \"[PandaProducer::fill] \" \n << \"Calling \" << filler->getName() << \"->fill()\" << std::endl;\n\n start = SClock::now();\n }\n\n filler->fill(outEvent_, _event, _setup);\n\n if (printLevel_ >= 1) {\n auto dt(SClock::now() - start);\n\n if (printLevel_ >= 3)\n std::cout << \"[PandaProducer::analyze] \" \n << \"Step \" << filler->getName() << \"->fill() took \" << toMS(dt) << \" ms\" << std::endl;\n\n timers_[iF] += dt;\n }\n }\n catch (std::exception& ex) {\n std::cerr << \"[PandaProducer::fill] \" \n << \"Error in \" << filler->getName() << \"::fill()\" << std::endl;\n throw;\n }\n }\n\n \/\/ Set inter-branch references\n for (unsigned iF(0); iF != fillers_.size(); ++iF) {\n auto* filler(fillers_[iF]);\n\n if (!filler->enabled())\n continue;\n\n try {\n if (printLevel_ >= 1) {\n if (printLevel_ >= 2)\n std::cout << \"[PandaProducer:fill] \"\n << \"Calling \" << filler->getName() << \"->setRefs()\" << std::endl;\n\n start = SClock::now();\n }\n\n filler->setRefs(objectMaps_);\n\n if (printLevel_ >= 1) {\n auto dt(SClock::now() - start);\n\n if (printLevel_ >= 3)\n std::cout << \"[PandaProducer::analyze] \" \n << \"Step \" << filler->getName() << \"->setRefs() took \" << toMS(dt) << \" ms\" << std::endl;\n\n timers_[iF] += dt;\n }\n }\n catch (std::exception& ex) {\n std::cerr << \"[PandaProducer:fill] \" \n << \"Error in \" << filler->getName() << \"::setRefs()\" << std::endl;\n throw;\n }\n }\n\n outEvent_.fill(*eventTree_);\n\n lastAnalyze_ = SClock::now();\n}\n\nvoid\nPandaProducer::beginRun(edm::Run const& _run, edm::EventSetup const& _setup)\n{\n outEvent_.run.init();\n\n outEvent_.run.runNumber = _run.run();\n\n for (auto* filler : fillers_) {\n if (!filler->enabled())\n continue;\n\n try {\n if (printLevel_ >= 2)\n std::cout << \"[PandaProducer::beginRun] \" \n << \"Calling \" << filler->getName() << \"->fillBeginRun()\" << std::endl;\n\n filler->fillBeginRun(outEvent_.run, _run, _setup);\n }\n catch (std::exception& ex) {\n std::cerr << \"[PandaProducer::beginRun] \"\n << \"Error in \" << filler->getName() << \"::fillBeginRun()\" << std::endl;\n throw;\n }\n }\n}\n\nvoid\nPandaProducer::endRun(edm::Run const& _run, edm::EventSetup const& _setup)\n{\n for (auto* filler : fillers_) {\n if (!filler->enabled())\n continue;\n\n try {\n if (printLevel_ >= 2) \n std::cout << \"[PandaProducer::endRun] \" \n << \"Calling \" << filler->getName() << \"->fillEndRun()\" << std::endl;\n\n filler->fillEndRun(outEvent_.run, _run, _setup);\n }\n catch (std::exception& ex) {\n std::cerr << \"[PandaProducer::endRun] \"\n << \"Error in \" << filler->getName() << \"::fillEndRun()\" << std::endl;\n throw;\n }\n }\n\n outEvent_.run.fill(*runTree_);\n}\n\nvoid \nPandaProducer::beginJob()\n{\n outputFile_ = TFile::Open(outputName_.c_str(), \"recreate\");\n eventTree_ = new TTree(\"events\", \"\");\n runTree_ = new TTree(\"runs\", \"\");\n\n panda::utils::BranchList eventBranches = {\"runNumber\", \"lumiNumber\", \"eventNumber\", \"isData\"};\n panda::utils::BranchList runBranches = {\"runNumber\"};\n for (auto* filler : fillers_) {\n if (filler->enabled())\n filler->branchNames(eventBranches, runBranches);\n }\n\n outEvent_.book(*eventTree_, eventBranches);\n outEvent_.run.book(*runTree_, runBranches);\n\n for (auto* filler : fillers_) {\n filler->addOutput(*outputFile_);\n }\n\n if (useTrigger_ && outputFile_->Get(\"hlt\")) {\n outEvent_.run.hlt.create();\n auto& hltTree(*static_cast<TTree*>(outputFile_->Get(\"hlt\")));\n hltTree.Branch(\"menu\", \"TString\", &outEvent_.run.hlt.menu);\n hltTree.Branch(\"paths\", \"std::vector<TString>\", &outEvent_.run.hlt.paths, 32000, 0);\n }\n\n eventCounter_ = new TH1D(\"eventcounter\", \"\", 2, 0., 2.);\n eventCounter_->SetDirectory(outputFile_);\n eventCounter_->GetXaxis()->SetBinLabel(1, \"all\");\n eventCounter_->GetXaxis()->SetBinLabel(2, \"selected\");\n}\n\nvoid \nPandaProducer::endJob()\n{\n \/\/ writes out all outputs that are still hanging in the directory\n outputFile_->cd();\n outputFile_->Write();\n delete outputFile_;\n\n if (printLevel_ >= 1) {\n std::cout << \"[PandaProducer::endJob] Timer summary\" << std::endl;\n for (unsigned iF(0); iF != fillers_.size(); ++iF) {\n std::cout << \" \" << fillers_[iF]->getName() << \" \";\n double time(toMS(timers_[iF]));\n if (time > 10000.)\n std::cout << std::fixed << std::setprecision(5) << time \/ nEvents_ \/ 1000. << \" s\/evt\";\n else\n std::cout << time \/ nEvents_ << \" ms\/evt\";\n std::cout << std::endl;\n }\n std::cout << \" Other CMSSW \";\n double time(toMS(timers_.back()));\n if (time > 10000.)\n std::cout << std::fixed << std::setprecision(5) << time \/ nEvents_ \/ 1000. << \" s\/evt\";\n else\n std::cout << time \/ nEvents_ << \" ms\/evt\";\n std::cout << std::endl;\n }\n}\n\nDEFINE_FWK_MODULE(PandaProducer);\n<commit_msg>switching s and ms was a bad idea<commit_after>#include \"FWCore\/Framework\/interface\/Frameworkfwd.h\"\n#include \"FWCore\/Framework\/interface\/EDAnalyzer.h\"\n#include \"FWCore\/Framework\/interface\/Event.h\"\n#include \"FWCore\/Framework\/interface\/Run.h\"\n#include \"FWCore\/Framework\/interface\/MakerMacros.h\"\n#include \"FWCore\/Utilities\/interface\/InputTag.h\"\n#include \"FWCore\/Common\/interface\/TriggerNames.h\"\n#include \"DataFormats\/Common\/interface\/TriggerResults.h\"\n#include \"DataFormats\/Common\/interface\/Handle.h\"\n#include \"DataFormats\/PatCandidates\/interface\/TriggerObjectStandAlone.h\"\n\n#include \"PandaTree\/Objects\/interface\/Event.h\"\n\n#include \"..\/interface\/FillerBase.h\"\n#include \"..\/interface\/ObjectMap.h\"\n\n#include \"TFile.h\"\n#include \"TTree.h\"\n#include \"TH1D.h\"\n#include <vector>\n#include <utility>\n#include <chrono>\n\ntypedef std::chrono::steady_clock SClock;\ndouble toMS(SClock::duration const& interval)\n{\n return std::chrono::duration_cast<std::chrono::nanoseconds>(interval).count() * 1.e-6;\n}\n\nclass PandaProducer : public edm::EDAnalyzer {\npublic:\n explicit PandaProducer(edm::ParameterSet const&);\n ~PandaProducer();\n\nprivate:\n typedef edm::View<pat::TriggerObjectStandAlone> TriggerObjectView;\n\n void analyze(edm::Event const&, edm::EventSetup const&) override;\n void beginRun(edm::Run const&, edm::EventSetup const&) override;\n void endRun(edm::Run const&, edm::EventSetup const&) override;\n void beginJob() override;\n void endJob() override;\n\n std::vector<FillerBase*> fillers_;\n ObjectMapStore objectMaps_;\n\n VString selectEvents_;\n edm::EDGetTokenT<edm::TriggerResults> skimResultsToken_;\n edm::EDGetTokenT<edm::TriggerResults> hltResultsToken_;\n edm::EDGetTokenT<TriggerObjectView> triggerObjectsToken_;\n\n TFile* outputFile_{0};\n TTree* eventTree_{0};\n TTree* runTree_{0};\n TH1D* eventCounter_{0};\n panda::Event outEvent_;\n\n std::string outputName_;\n bool useTrigger_;\n \/\/ [[filter0, filter1, ...], ...] outer index runs over trigger objects\n std::vector<VString> triggerObjectNames_;\n unsigned printLevel_;\n\n std::vector<SClock::duration> timers_;\n SClock::time_point lastAnalyze_; \/\/! Time point of last return from analyze()\n unsigned long long nEvents_;\n};\n\nPandaProducer::PandaProducer(edm::ParameterSet const& _cfg) :\n selectEvents_(_cfg.getUntrackedParameter<VString>(\"SelectEvents\")),\n skimResultsToken_(consumes<edm::TriggerResults>(edm::InputTag(\"TriggerResults\"))), \/\/ no process name -> pick up the trigger results from the current process\n outputName_(_cfg.getUntrackedParameter<std::string>(\"outputFile\", \"panda.root\")),\n useTrigger_(_cfg.getUntrackedParameter<bool>(\"useTrigger\", true)),\n printLevel_(_cfg.getUntrackedParameter<unsigned>(\"printLevel\", 0)),\n timers_(),\n lastAnalyze_(),\n nEvents_(0)\n{\n auto&& coll(consumesCollector());\n\n auto& fillersCfg(_cfg.getUntrackedParameterSet(\"fillers\"));\n\n SClock::time_point start;\n\n for (auto& fillerName : fillersCfg.getParameterNames()) {\n if (fillerName == \"common\")\n continue;\n\n auto& fillerPSet(fillersCfg.getUntrackedParameterSet(fillerName));\n try {\n auto className(fillerPSet.getUntrackedParameter<std::string>(\"filler\") + \"Filler\");\n\n if (printLevel_ >= 1) {\n std::cout << \"[PandaProducer::PandaProducer] \" \n << \"Constructing \" << className << \"::\" << fillerName << std::endl;\n\n if (printLevel_ >= 3)\n start = SClock::now();\n }\n\n auto* filler(FillerFactoryStore::singleton()->makeFiller(className, fillerName, _cfg, coll));\n fillers_.push_back(filler);\n\n if (filler->enabled())\n filler->setObjectMap(objectMaps_[fillerName]);\n\n if (printLevel_ >= 1) {\n timers_.push_back(SClock::duration::zero());\n\n if (printLevel_ >= 3)\n std::cout << \"Initializing \" << fillerName << \" took \" << toMS(SClock::now() - start) << \" ms.\" << std::endl;\n }\n }\n catch (std::exception& ex) {\n std::cerr << \"[PandaProducer::PandaProducer] \" \n << \"Configuration error in \" << fillerName << \":\"\n << ex.what() << std::endl;\n throw;\n }\n }\n\n if (useTrigger_) {\n hltResultsToken_ = consumes<edm::TriggerResults>(edm::InputTag(\"TriggerResults\", \"\", \"HLT\"));\n triggerObjectsToken_ = consumes<TriggerObjectView>(edm::InputTag(fillersCfg.getUntrackedParameterSet(\"common\").getUntrackedParameter<std::string>(\"triggerObjects\")));\n }\n\n if (printLevel_ >= 1) {\n \/\/ timer for the CMSSW execution outside of this module\n timers_.push_back(SClock::duration::zero());\n }\n}\n\nPandaProducer::~PandaProducer()\n{\n for (auto* filler : fillers_)\n delete filler;\n}\n\nvoid\nPandaProducer::analyze(edm::Event const& _event, edm::EventSetup const& _setup)\n{\n eventCounter_->Fill(0.5);\n \n if (printLevel_ >= 1) {\n if (nEvents_ == 0) {\n if (printLevel_ >= 3)\n std::cout << \"[PandaProducer::analyze] \"\n << \"First event; CMSSW step time unknown\" << std::endl;\n\n }\n else {\n auto dt(SClock::now() - lastAnalyze_);\n if (printLevel_ >= 3)\n std::cout << \"[PandaProducer::analyze] \"\n << \"Previous (CMSSW) step took \" << toMS(dt) << \" ms\" << std::endl;\n\n timers_.back() += dt;\n }\n }\n\n ++nEvents_;\n\n SClock::time_point start;\n\n \/\/ Fill \"all events\" information\n for (unsigned iF(0); iF != fillers_.size(); ++iF) {\n auto* filler(fillers_[iF]);\n\n if (!filler->enabled())\n continue;\n\n try {\n if (printLevel_ >= 1) {\n start = SClock::now();\n\n if (printLevel_ >= 2)\n std::cout << \"[PandaProducer::analyze] \" \n << \"Calling \" << filler->getName() << \"->fillAll()\" << std::endl;\n }\n\n filler->fillAll(_event, _setup);\n\n if (printLevel_ >= 1) {\n auto dt(SClock::now() - start);\n\n if (printLevel_ >= 3) {\n std::cout << \"[PandaProducer::analyze] \" \n << \"Step \" << filler->getName() << \"->fillAll() took \" << toMS(dt) << \" ms\" << std::endl;\n }\n \n timers_[iF] += dt;\n }\n }\n catch (std::exception& ex) {\n std::cerr << \"[PandaProducer::analyze] \" \n << \"Error in \" << filler->getName() << \"::fillAll()\" << std::endl;\n throw;\n }\n }\n\n \/\/ If path names are given, check if at least one succeeded\n if (selectEvents_.size() != 0) {\n edm::Handle<edm::TriggerResults> triggerResults;\n if(_event.getByToken(skimResultsToken_, triggerResults)){\n auto& pathNames(_event.triggerNames(*triggerResults));\n unsigned iS(0);\n for (; iS != selectEvents_.size(); ++iS) {\n unsigned iP(pathNames.triggerIndex(selectEvents_[iS]));\n if (iP != pathNames.size() && triggerResults->accept(iP))\n break;\n }\n if (iS == selectEvents_.size())\n return;\n }\n }\n\n eventCounter_->Fill(1.5);\n\n \/\/ Now fill the event\n outEvent_.init();\n\n for (auto& mm : objectMaps_)\n mm.second.clearMaps();\n\n if (useTrigger_) {\n \/\/ Unpack trigger object names\n edm::Handle<edm::TriggerResults> triggerResultsHandle;\n _event.getByToken(hltResultsToken_, triggerResultsHandle);\n auto& triggerNames(_event.triggerNames(*triggerResultsHandle));\n\n edm::Handle<TriggerObjectView> triggerObjectsHandle;\n _event.getByToken(triggerObjectsToken_, triggerObjectsHandle);\n auto& triggerObjects(*triggerObjectsHandle);\n\n auto& objMap(objectMaps_[\"global\"].get<pat::TriggerObjectStandAlone, VString>());\n triggerObjectNames_.assign(triggerObjects.size(), VString());\n\n unsigned iObj(0);\n for (auto& obj : triggerObjects) {\n \/\/ need to create a copy to perform the non-const action of unpacking\n pat::TriggerObjectStandAlone copy(obj);\n copy.unpackPathNames(triggerNames);\n \n for (auto& label : obj.filterLabels())\n triggerObjectNames_[iObj].push_back(label);\n\n \/\/ link the pat trigger object to the list of labels\n objMap.add(triggerObjects.ptrAt(iObj), triggerObjectNames_[iObj]);\n ++iObj;\n }\n }\n\n outEvent_.runNumber = _event.id().run();\n outEvent_.lumiNumber = _event.luminosityBlock();\n outEvent_.eventNumber = _event.id().event();\n outEvent_.isData = _event.isRealData();\n\n for (unsigned iF(0); iF != fillers_.size(); ++iF) {\n auto* filler(fillers_[iF]);\n\n if (!filler->enabled())\n continue;\n\n try {\n if (printLevel_ >= 1) {\n if (printLevel_ >= 2)\n std::cout << \"[PandaProducer::fill] \" \n << \"Calling \" << filler->getName() << \"->fill()\" << std::endl;\n\n start = SClock::now();\n }\n\n filler->fill(outEvent_, _event, _setup);\n\n if (printLevel_ >= 1) {\n auto dt(SClock::now() - start);\n\n if (printLevel_ >= 3)\n std::cout << \"[PandaProducer::analyze] \" \n << \"Step \" << filler->getName() << \"->fill() took \" << toMS(dt) << \" ms\" << std::endl;\n\n timers_[iF] += dt;\n }\n }\n catch (std::exception& ex) {\n std::cerr << \"[PandaProducer::fill] \" \n << \"Error in \" << filler->getName() << \"::fill()\" << std::endl;\n throw;\n }\n }\n\n \/\/ Set inter-branch references\n for (unsigned iF(0); iF != fillers_.size(); ++iF) {\n auto* filler(fillers_[iF]);\n\n if (!filler->enabled())\n continue;\n\n try {\n if (printLevel_ >= 1) {\n if (printLevel_ >= 2)\n std::cout << \"[PandaProducer:fill] \"\n << \"Calling \" << filler->getName() << \"->setRefs()\" << std::endl;\n\n start = SClock::now();\n }\n\n filler->setRefs(objectMaps_);\n\n if (printLevel_ >= 1) {\n auto dt(SClock::now() - start);\n\n if (printLevel_ >= 3)\n std::cout << \"[PandaProducer::analyze] \" \n << \"Step \" << filler->getName() << \"->setRefs() took \" << toMS(dt) << \" ms\" << std::endl;\n\n timers_[iF] += dt;\n }\n }\n catch (std::exception& ex) {\n std::cerr << \"[PandaProducer:fill] \" \n << \"Error in \" << filler->getName() << \"::setRefs()\" << std::endl;\n throw;\n }\n }\n\n outEvent_.fill(*eventTree_);\n\n lastAnalyze_ = SClock::now();\n}\n\nvoid\nPandaProducer::beginRun(edm::Run const& _run, edm::EventSetup const& _setup)\n{\n outEvent_.run.init();\n\n outEvent_.run.runNumber = _run.run();\n\n for (auto* filler : fillers_) {\n if (!filler->enabled())\n continue;\n\n try {\n if (printLevel_ >= 2)\n std::cout << \"[PandaProducer::beginRun] \" \n << \"Calling \" << filler->getName() << \"->fillBeginRun()\" << std::endl;\n\n filler->fillBeginRun(outEvent_.run, _run, _setup);\n }\n catch (std::exception& ex) {\n std::cerr << \"[PandaProducer::beginRun] \"\n << \"Error in \" << filler->getName() << \"::fillBeginRun()\" << std::endl;\n throw;\n }\n }\n}\n\nvoid\nPandaProducer::endRun(edm::Run const& _run, edm::EventSetup const& _setup)\n{\n for (auto* filler : fillers_) {\n if (!filler->enabled())\n continue;\n\n try {\n if (printLevel_ >= 2) \n std::cout << \"[PandaProducer::endRun] \" \n << \"Calling \" << filler->getName() << \"->fillEndRun()\" << std::endl;\n\n filler->fillEndRun(outEvent_.run, _run, _setup);\n }\n catch (std::exception& ex) {\n std::cerr << \"[PandaProducer::endRun] \"\n << \"Error in \" << filler->getName() << \"::fillEndRun()\" << std::endl;\n throw;\n }\n }\n\n outEvent_.run.fill(*runTree_);\n}\n\nvoid \nPandaProducer::beginJob()\n{\n outputFile_ = TFile::Open(outputName_.c_str(), \"recreate\");\n eventTree_ = new TTree(\"events\", \"\");\n runTree_ = new TTree(\"runs\", \"\");\n\n panda::utils::BranchList eventBranches = {\"runNumber\", \"lumiNumber\", \"eventNumber\", \"isData\"};\n panda::utils::BranchList runBranches = {\"runNumber\"};\n for (auto* filler : fillers_) {\n if (filler->enabled())\n filler->branchNames(eventBranches, runBranches);\n }\n\n outEvent_.book(*eventTree_, eventBranches);\n outEvent_.run.book(*runTree_, runBranches);\n\n for (auto* filler : fillers_) {\n filler->addOutput(*outputFile_);\n }\n\n if (useTrigger_ && outputFile_->Get(\"hlt\")) {\n outEvent_.run.hlt.create();\n auto& hltTree(*static_cast<TTree*>(outputFile_->Get(\"hlt\")));\n hltTree.Branch(\"menu\", \"TString\", &outEvent_.run.hlt.menu);\n hltTree.Branch(\"paths\", \"std::vector<TString>\", &outEvent_.run.hlt.paths, 32000, 0);\n }\n\n eventCounter_ = new TH1D(\"eventcounter\", \"\", 2, 0., 2.);\n eventCounter_->SetDirectory(outputFile_);\n eventCounter_->GetXaxis()->SetBinLabel(1, \"all\");\n eventCounter_->GetXaxis()->SetBinLabel(2, \"selected\");\n}\n\nvoid \nPandaProducer::endJob()\n{\n \/\/ writes out all outputs that are still hanging in the directory\n outputFile_->cd();\n outputFile_->Write();\n delete outputFile_;\n\n if (printLevel_ >= 1) {\n std::cout << \"[PandaProducer::endJob] Timer summary\" << std::endl;\n for (unsigned iF(0); iF != fillers_.size(); ++iF) {\n std::cout << \" \" << fillers_[iF]->getName() << \" \"\n << std::fixed << std::setprecision(3) << toMS(timers_[iF]) \/ nEvents_ << \" ms\/evt\"\n << std::endl;\n }\n std::cout << \" Other CMSSW \"\n << std::fixed << std::setprecision(3) << toMS(timers_.back()) \/ nEvents_ << \" ms\/evt\"\n << std::endl;\n }\n}\n\nDEFINE_FWK_MODULE(PandaProducer);\n<|endoftext|>"} {"text":"<commit_before>\/\/ Copyright (c) 2010-2020, Lawrence Livermore National Security, LLC. Produced\n\/\/ at the Lawrence Livermore National Laboratory. All Rights reserved. See files\n\/\/ LICENSE and NOTICE for details. LLNL-CODE-806117.\n\/\/\n\/\/ This file is part of the MFEM library. For more information and source code\n\/\/ availability visit https:\/\/mfem.org.\n\/\/\n\/\/ MFEM is free software; you can redistribute it and\/or modify it under the\n\/\/ terms of the BSD-3 license. We welcome feedback and contributions, see file\n\/\/ CONTRIBUTING.md for details.\n\n#include \"catch.hpp\"\n#include \"mfem.hpp\"\n#include <fstream>\n#include <iostream>\n\nusing namespace mfem;\n\nnamespace ea_kernels\n{\n\nvoid velocity_function(const Vector &x, Vector &v)\n{\n int dim = x.Size();\n switch (dim)\n {\n case 1: v(0) = 1.0; break;\n case 2: v(0) = x(1); v(1) = -x(0); break;\n case 3: v(0) = x(1); v(1) = -x(0); v(2) = x(0); break;\n }\n}\n\nvoid AddConvectionIntegrators(BilinearForm &k, VectorCoefficient &velocity,\n bool dg)\n{\n k.AddDomainIntegrator(new ConvectionIntegrator(velocity, -1.0));\n\n if (dg)\n {\n k.AddInteriorFaceIntegrator(\n new TransposeIntegrator(new DGTraceIntegrator(velocity, 1.0, -0.5)));\n k.AddBdrFaceIntegrator(\n new TransposeIntegrator(new DGTraceIntegrator(velocity, 1.0, -0.5)));\n }\n}\n\nvoid test_assembly_level(Mesh &&mesh, int order, bool dg, const int pb,\n const AssemblyLevel assembly)\n{\n mesh.EnsureNodes();\n mesh.SetCurvature(mesh.GetNodalFESpace()->GetOrder(0));\n int dim = mesh.Dimension();\n\n FiniteElementCollection *fec;\n if (dg)\n {\n fec = new L2_FECollection(order, dim, BasisType::GaussLobatto);\n }\n else\n {\n fec = new H1_FECollection(order, dim);\n }\n\n FiniteElementSpace fespace(&mesh, fec);\n\n BilinearForm k_test(&fespace);\n BilinearForm k_ref(&fespace);\n\n ConstantCoefficient one(1.0);\n VectorFunctionCoefficient vel_coeff(dim, velocity_function);\n\n if (pb==0) \/\/ Mass\n {\n k_ref.AddDomainIntegrator(new MassIntegrator(one));\n k_test.AddDomainIntegrator(new MassIntegrator(one));\n }\n else if (pb==1) \/\/ Convection\n {\n AddConvectionIntegrators(k_ref, vel_coeff, dg);\n AddConvectionIntegrators(k_test, vel_coeff, dg);\n }\n else if (pb==2) \/\/ Diffusion\n {\n k_ref.AddDomainIntegrator(new DiffusionIntegrator(one));\n k_test.AddDomainIntegrator(new DiffusionIntegrator(one));\n }\n\n k_ref.Assemble();\n k_ref.Finalize();\n\n k_test.SetAssemblyLevel(assembly);\n k_test.Assemble();\n\n GridFunction x(&fespace), y_ref(&fespace), y_test(&fespace);\n\n x.Randomize(1);\n\n k_ref.Mult(x,y_ref);\n k_test.Mult(x,y_test);\n\n y_test -= y_ref;\n\n REQUIRE(y_test.Norml2() < 1.e-12);\n\n delete fec;\n}\n\nTEST_CASE(\"Assembly Levels\", \"[AssemblyLevel]\")\n{\n for (AssemblyLevel assembly : {AssemblyLevel::PARTIAL,AssemblyLevel::ELEMENT,AssemblyLevel::FULL})\n {\n for (int pb : {0, 1, 2})\n {\n for (bool dg : {true, false})\n {\n SECTION(\"2D\")\n {\n for (int order : {2, 3, 4})\n {\n test_assembly_level(Mesh(\"..\/..\/data\/periodic-square.mesh\", 1, 1),\n order, dg, pb, assembly);\n test_assembly_level(Mesh(\"..\/..\/data\/periodic-hexagon.mesh\", 1, 1),\n order, dg, pb, assembly);\n test_assembly_level(Mesh(\"..\/..\/data\/star-q3.mesh\", 1, 1),\n order, dg, pb, assembly);\n }\n }\n\n SECTION(\"3D\")\n {\n int order = 2;\n test_assembly_level(Mesh(\"..\/..\/data\/periodic-cube.mesh\", 1, 1),\n order, dg, pb, assembly);\n test_assembly_level(Mesh(\"..\/..\/data\/fichera-q3.mesh\", 1, 1),\n order, dg, pb, assembly);\n }\n }\n\n \/\/ Test AMR cases (DG not implemented)\n SECTION(\"AMR 2D\")\n {\n for (int order : {2, 3, 4})\n {\n test_assembly_level(Mesh(\"..\/..\/data\/amr-quad.mesh\", 1, 1),\n order, false, 0, assembly);\n }\n }\n SECTION(\"AMR 3D\")\n {\n int order = 2;\n test_assembly_level(Mesh(\"..\/..\/data\/fichera-amr.mesh\", 1, 1),\n order, false, 0, assembly);\n }\n }\n }\n} \/\/ test case\n\n} \/\/ namespace pa_kernels\n<commit_msg>Fix testing of assembly levels.<commit_after>\/\/ Copyright (c) 2010-2020, Lawrence Livermore National Security, LLC. Produced\n\/\/ at the Lawrence Livermore National Laboratory. All Rights reserved. See files\n\/\/ LICENSE and NOTICE for details. LLNL-CODE-806117.\n\/\/\n\/\/ This file is part of the MFEM library. For more information and source code\n\/\/ availability visit https:\/\/mfem.org.\n\/\/\n\/\/ MFEM is free software; you can redistribute it and\/or modify it under the\n\/\/ terms of the BSD-3 license. We welcome feedback and contributions, see file\n\/\/ CONTRIBUTING.md for details.\n\n#include \"catch.hpp\"\n#include \"mfem.hpp\"\n#include <fstream>\n#include <iostream>\n\nusing namespace mfem;\n\nnamespace ea_kernels\n{\n\nvoid velocity_function(const Vector &x, Vector &v)\n{\n int dim = x.Size();\n switch (dim)\n {\n case 1: v(0) = 1.0; break;\n case 2: v(0) = x(1); v(1) = -x(0); break;\n case 3: v(0) = x(1); v(1) = -x(0); v(2) = x(0); break;\n }\n}\n\nvoid AddConvectionIntegrators(BilinearForm &k, VectorCoefficient &velocity,\n bool dg)\n{\n k.AddDomainIntegrator(new ConvectionIntegrator(velocity, -1.0));\n\n if (dg)\n {\n k.AddInteriorFaceIntegrator(\n new TransposeIntegrator(new DGTraceIntegrator(velocity, 1.0, -0.5)));\n k.AddBdrFaceIntegrator(\n new TransposeIntegrator(new DGTraceIntegrator(velocity, 1.0, -0.5)));\n }\n}\n\nvoid test_assembly_level(Mesh &&mesh, int order, bool dg, const int pb,\n const AssemblyLevel assembly)\n{\n mesh.EnsureNodes();\n mesh.SetCurvature(mesh.GetNodalFESpace()->GetOrder(0),\n mesh.GetNodalFESpace()->IsDGSpace());\n int dim = mesh.Dimension();\n\n FiniteElementCollection *fec;\n if (dg)\n {\n fec = new L2_FECollection(order, dim, BasisType::GaussLobatto);\n }\n else\n {\n fec = new H1_FECollection(order, dim);\n }\n\n FiniteElementSpace fespace(&mesh, fec);\n\n BilinearForm k_test(&fespace);\n BilinearForm k_ref(&fespace);\n\n ConstantCoefficient one(1.0);\n VectorFunctionCoefficient vel_coeff(dim, velocity_function);\n\n if (pb==0) \/\/ Mass\n {\n k_ref.AddDomainIntegrator(new MassIntegrator(one));\n k_test.AddDomainIntegrator(new MassIntegrator(one));\n }\n else if (pb==1) \/\/ Convection\n {\n AddConvectionIntegrators(k_ref, vel_coeff, dg);\n AddConvectionIntegrators(k_test, vel_coeff, dg);\n }\n else if (pb==2) \/\/ Diffusion\n {\n k_ref.AddDomainIntegrator(new DiffusionIntegrator(one));\n k_test.AddDomainIntegrator(new DiffusionIntegrator(one));\n }\n\n k_ref.Assemble();\n k_ref.Finalize();\n\n k_test.SetAssemblyLevel(assembly);\n k_test.Assemble();\n\n GridFunction x(&fespace), y_ref(&fespace), y_test(&fespace);\n\n x.Randomize(1);\n\n k_ref.Mult(x,y_ref);\n k_test.Mult(x,y_test);\n\n y_test -= y_ref;\n\n REQUIRE(y_test.Norml2() < 1.e-12);\n\n delete fec;\n}\n\nTEST_CASE(\"Assembly Levels\", \"[AssemblyLevel]\")\n{\n SECTION(\"Continuous Galerkin\")\n {\n const bool dg = false;\n SECTION(\"2D\")\n {\n for (AssemblyLevel assembly : {AssemblyLevel::PARTIAL,AssemblyLevel::ELEMENT,AssemblyLevel::FULL})\n {\n for (int pb : {0, 1, 2})\n {\n for (int order : {2, 3, 4})\n {\n test_assembly_level(Mesh(\"..\/..\/data\/inline-quad.mesh\", 1, 1),\n order, dg, pb, assembly);\n test_assembly_level(Mesh(\"..\/..\/data\/periodic-hexagon.mesh\", 1, 1),\n order, dg, pb, assembly);\n test_assembly_level(Mesh(\"..\/..\/data\/star-q3.mesh\", 1, 1),\n order, dg, pb, assembly);\n }\n }\n }\n }\n SECTION(\"3D\")\n {\n for (AssemblyLevel assembly : {AssemblyLevel::PARTIAL,AssemblyLevel::ELEMENT,AssemblyLevel::FULL})\n {\n for (int pb : {0, 1, 2})\n {\n int order = 2;\n test_assembly_level(Mesh(\"..\/..\/data\/inline-hex.mesh\", 1, 1),\n order, dg, pb, assembly);\n test_assembly_level(Mesh(\"..\/..\/data\/fichera-q3.mesh\", 1, 1),\n order, dg, pb, assembly);\n }\n }\n }\n SECTION(\"AMR 2D\")\n {\n for (AssemblyLevel assembly : {AssemblyLevel::PARTIAL,AssemblyLevel::ELEMENT,AssemblyLevel::FULL})\n {\n for (int pb : {0, 1, 2})\n {\n for (int order : {2, 3, 4})\n {\n test_assembly_level(Mesh(\"..\/..\/data\/amr-quad.mesh\", 1, 1),\n order, false, 0, assembly);\n }\n }\n }\n }\n SECTION(\"AMR 3D\")\n {\n for (AssemblyLevel assembly : {AssemblyLevel::PARTIAL,AssemblyLevel::ELEMENT,AssemblyLevel::FULL})\n {\n for (int pb : {0, 1, 2})\n {\n int order = 2;\n test_assembly_level(Mesh(\"..\/..\/data\/fichera-amr.mesh\", 1, 1),\n order, false, 0, assembly);\n }\n }\n }\n }\n\n SECTION(\"Discontinuous Galerkin\")\n {\n const bool dg = true;\n SECTION(\"2D\")\n {\n for (AssemblyLevel assembly : {AssemblyLevel::PARTIAL,AssemblyLevel::ELEMENT,AssemblyLevel::FULL})\n {\n for (int pb : {0, 1})\n {\n for (int order : {2, 3, 4})\n {\n test_assembly_level(Mesh(\"..\/..\/data\/periodic-square.mesh\", 1, 1),\n order, dg, pb, assembly);\n test_assembly_level(Mesh(\"..\/..\/data\/periodic-hexagon.mesh\", 1, 1),\n order, dg, pb, assembly);\n test_assembly_level(Mesh(\"..\/..\/data\/star-q3.mesh\", 1, 1),\n order, dg, pb, assembly);\n }\n }\n }\n }\n SECTION(\"3D\")\n {\n for (AssemblyLevel assembly : {AssemblyLevel::PARTIAL,AssemblyLevel::ELEMENT,AssemblyLevel::FULL})\n {\n for (int pb : {0, 1})\n {\n for (bool dg : {true, false})\n {\n int order = 2;\n test_assembly_level(Mesh(\"..\/..\/data\/periodic-cube.mesh\", 1, 1),\n order, dg, pb, assembly);\n test_assembly_level(Mesh(\"..\/..\/data\/fichera-q3.mesh\", 1, 1),\n order, dg, pb, assembly);\n }\n }\n }\n }\n }\n} \/\/ test case\n\n} \/\/ namespace pa_kernels\n<|endoftext|>"} {"text":"<commit_before>\/****************************************************************\/\n\/* DO NOT MODIFY THIS HEADER *\/\n\/* MOOSE - Multiphysics Object Oriented Simulation Environment *\/\n\/* *\/\n\/* (c) 2010 Battelle Energy Alliance, LLC *\/\n\/* ALL RIGHTS RESERVED *\/\n\/* *\/\n\/* Prepared by Battelle Energy Alliance, LLC *\/\n\/* Under Contract No. DE-AC07-05ID14517 *\/\n\/* With the U. S. Department of Energy *\/\n\/* *\/\n\/* See COPYRIGHT for full restrictions *\/\n\/****************************************************************\/\n\n#include \"ReportableData.h\"\n#include \"FEProblem.h\"\n\nReportableData::ReportableData(FEProblem & fe_problem) :\n Restartable(\"values\", \"ReportableData\", fe_problem),\n _names(declareRestartableData<std::vector<std::set<std::string> > >(\"reportable_names\", std::vector<std::set<std::string> >(libMesh::n_threads(), std::set<std::string>()))),\n _output(declareRestartableData<std::map<std::string, bool> >(\"reportable_output\"))\n{\n}\n\nvoid\nReportableData::init(const std::string & name, Real value, THREAD_ID tid, bool output)\n{\n \/\/ Check that the name was not already used\n if (hasReportableValue(name, tid))\n mooseError(\"A reportable value with the name \" << name << \" already exists\");\n\n \/\/ Declare the data as restartable\n if (_values.find(name) == _values.end())\n {\n _values[name] = &declareRestartableDataWithObjectName<ReportableValue>(name, \"reportable_values\");\n _values_old[name] = &declareRestartableDataWithObjectName<ReportableValue>(name, \"reportable_values_old\");\n }\n\n \/\/ Set the values\n getReportableValue(name) = value;\n getReportableValueOld(name) = value;\n\n \/\/ Output the output flag\n _output.insert(std::pair<std::string, bool>(name, output));\n\n \/\/ Update the name storage\n _names[tid].insert(name);\n}\n\nbool\nReportableData::hasReportableValue(const std::string & name, THREAD_ID tid)\n{\n \/\/ Return true if the supplied name was already defined on the thread\n return _names[tid].find(name) != _names[tid].end();\n}\n\n\nReportableValue &\nReportableData::getReportableValue(const std::string & name)\n{\n \/\/ If the stored value does not exists; create it, this allows getReportableValue to be called\n \/\/ without calling init\n if (_values.find(name) == _values.end())\n _values[name] = &declareRestartableDataWithObjectName<ReportableValue>(name, \"reportable_values\");\n\n return *_values[name];\n}\n\nReportableValue &\nReportableData::getReportableValueOld(const std::string & name)\n{\n if (_values.find(name) == _values.end())\n _values_old[name] = &declareRestartableDataWithObjectName<ReportableValue>(name, \"reportable_values_old\");\n\n return *_values_old[name];\n}\n\nvoid\nReportableData::storeValue(const std::string & name, Real value)\n{\n if (hasReportableValue(name))\n getReportableValue(name) = value;\n else\n mooseError(\"A ReportableValue with the name \" << name << \" does not exist, must initialize first\");\n}\n\n\nconst std::map<std::string, ReportableValue*> &\nReportableData::values() const\n{\n return _values;\n}\n\nvoid\nReportableData::copyValuesBack()\n{\n _values_old = _values;\n}\n\nbool\nReportableData::valueOutput(std::string name)\n{\n return _output[name];\n}\n<commit_msg>Fix ReportableData bug. Refs #2241<commit_after>\/****************************************************************\/\n\/* DO NOT MODIFY THIS HEADER *\/\n\/* MOOSE - Multiphysics Object Oriented Simulation Environment *\/\n\/* *\/\n\/* (c) 2010 Battelle Energy Alliance, LLC *\/\n\/* ALL RIGHTS RESERVED *\/\n\/* *\/\n\/* Prepared by Battelle Energy Alliance, LLC *\/\n\/* Under Contract No. DE-AC07-05ID14517 *\/\n\/* With the U. S. Department of Energy *\/\n\/* *\/\n\/* See COPYRIGHT for full restrictions *\/\n\/****************************************************************\/\n\n#include \"ReportableData.h\"\n#include \"FEProblem.h\"\n\nReportableData::ReportableData(FEProblem & fe_problem) :\n Restartable(\"values\", \"ReportableData\", fe_problem),\n _names(declareRestartableData<std::vector<std::set<std::string> > >(\"reportable_names\", std::vector<std::set<std::string> >(libMesh::n_threads(), std::set<std::string>()))),\n _output(declareRestartableData<std::map<std::string, bool> >(\"reportable_output\"))\n{\n}\n\nvoid\nReportableData::init(const std::string & name, Real value, THREAD_ID tid, bool output)\n{\n \/\/ Check that the name was not already used\n if (hasReportableValue(name, tid))\n mooseError(\"A reportable value with the name \" << name << \" already exists\");\n\n \/\/ Declare the data as restartable\n if (_values.find(name) == _values.end())\n {\n _values[name] = &declareRestartableDataWithObjectName<ReportableValue>(name, \"reportable_values\");\n }\n if (_values_old.find(name) == _values_old.end())\n {\n _values_old[name] = &declareRestartableDataWithObjectName<ReportableValue>(name, \"reportable_values_old\");\n }\n\n \/\/ Set the values\n getReportableValue(name) = value;\n getReportableValueOld(name) = value;\n\n \/\/ Output the output flag\n _output.insert(std::pair<std::string, bool>(name, output));\n\n \/\/ Update the name storage\n _names[tid].insert(name);\n}\n\nbool\nReportableData::hasReportableValue(const std::string & name, THREAD_ID tid)\n{\n \/\/ Return true if the supplied name was already defined on the thread\n return _names[tid].find(name) != _names[tid].end();\n}\n\n\nReportableValue &\nReportableData::getReportableValue(const std::string & name)\n{\n \/\/ If the stored value does not exists; create it, this allows getReportableValue to be called\n \/\/ without calling init\n if (_values.find(name) == _values.end())\n _values[name] = &declareRestartableDataWithObjectName<ReportableValue>(name, \"reportable_values\");\n\n return *_values[name];\n}\n\nReportableValue &\nReportableData::getReportableValueOld(const std::string & name)\n{\n if (_values_old.find(name) == _values_old.end())\n _values_old[name] = &declareRestartableDataWithObjectName<ReportableValue>(name, \"reportable_values_old\");\n\n return *_values_old[name];\n}\n\nvoid\nReportableData::storeValue(const std::string & name, Real value)\n{\n if (hasReportableValue(name))\n getReportableValue(name) = value;\n else\n mooseError(\"A ReportableValue with the name \" << name << \" does not exist, must initialize first\");\n}\n\n\nconst std::map<std::string, ReportableValue*> &\nReportableData::values() const\n{\n return _values;\n}\n\nvoid\nReportableData::copyValuesBack()\n{\n _values_old = _values;\n}\n\nbool\nReportableData::valueOutput(std::string name)\n{\n return _output[name];\n}\n<|endoftext|>"} {"text":"<commit_before>\/*\n * Copyright (c) 2014-2015 Advanced Micro Devices, Inc.\n * All rights reserved.\n *\n * For use for simulation and test purposes only\n *\n * Redistribution and use in source and binary forms, with or without\n * modification, are permitted provided that the following conditions are met:\n *\n * 1. Redistributions of source code must retain the above copyright notice,\n * this list of conditions and the following disclaimer.\n *\n * 2. Redistributions in binary form must reproduce the above copyright notice,\n * this list of conditions and the following disclaimer in the documentation\n * and\/or other materials provided with the distribution.\n *\n * 3. Neither the name of the copyright holder nor the names of its\n * contributors may be used to endorse or promote products derived from this\n * software without specific prior written permission.\n *\n * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS \"AS IS\"\n * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE\n * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE\n * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE\n * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR\n * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF\n * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS\n * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN\n * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)\n * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE\n * POSSIBILITY OF SUCH DAMAGE.\n *\/\n\n#define __STDC_FORMAT_MACROS\n#include <cinttypes>\n#include \"debug\/GPUCoalescer.hh\"\n#include \"debug\/GPUMem.hh\"\n#include \"debug\/GPUReg.hh\"\n#include \"gpu-compute\/compute_unit.hh\"\n#include \"gpu-compute\/global_memory_pipeline.hh\"\n#include \"gpu-compute\/gpu_dyn_inst.hh\"\n#include \"gpu-compute\/shader.hh\"\n#include \"gpu-compute\/vector_register_file.hh\"\n#include \"gpu-compute\/wavefront.hh\"\n\nGlobalMemPipeline::GlobalMemPipeline(const ComputeUnitParams* p) :\n computeUnit(nullptr), gmQueueSize(p->global_mem_queue_size),\n maxWaveRequests(p->max_wave_requests), inflightStores(0),\n inflightLoads(0)\n{\n}\n\nvoid\nGlobalMemPipeline::init(ComputeUnit *cu)\n{\n computeUnit = cu;\n globalMemSize = computeUnit->shader->globalMemSize;\n _name = computeUnit->name() + \".GlobalMemPipeline\";\n}\n\nbool\nGlobalMemPipeline::coalescerReady(GPUDynInstPtr mp) const\n{\n \/\/ We require one token from the coalescer's uncoalesced table to\n \/\/ proceed\n int token_count = 1;\n\n \/\/ Make sure the vector port has tokens. There is a single pool\n \/\/ of tokens so only one port in the vector port needs to be checked.\n \/\/ Lane 0 is chosen arbirarily.\n DPRINTF(GPUCoalescer, \"Checking for %d tokens\\n\", token_count);\n if (!mp->computeUnit()->getTokenManager()->haveTokens(token_count)) {\n DPRINTF(GPUCoalescer, \"Stalling inst because coalsr is busy!\\n\");\n return false;\n }\n\n return true;\n}\n\nvoid\nGlobalMemPipeline::acqCoalescerToken(GPUDynInstPtr mp)\n{\n \/\/ We require one token from the coalescer's uncoalesced table to\n \/\/ proceed\n int token_count = 1;\n\n DPRINTF(GPUCoalescer, \"Acquiring %d token(s)\\n\", token_count);\n assert(mp->computeUnit()->getTokenManager()->haveTokens(token_count));\n mp->computeUnit()->getTokenManager()->acquireTokens(token_count);\n}\n\nbool\nGlobalMemPipeline::outstandingReqsCheck(GPUDynInstPtr mp) const\n{\n \/\/ Ensure we haven't exceeded the maximum number of vmem requests\n \/\/ for this wavefront\n if ((mp->wavefront()->outstandingReqsRdGm\n + mp->wavefront()->outstandingReqsWrGm) >= maxWaveRequests) {\n return false;\n }\n\n return true;\n}\n\nvoid\nGlobalMemPipeline::exec()\n{\n \/\/ apply any returned global memory operations\n GPUDynInstPtr m = getNextReadyResp();\n\n bool accessVrf = true;\n Wavefront *w = nullptr;\n\n \/\/ check the VRF to see if the operands of a load (or load component\n \/\/ of an atomic) are accessible\n if (m && (m->isLoad() || m->isAtomicRet())) {\n w = m->wavefront();\n\n accessVrf = w->computeUnit->vrf[w->simdId]->\n canScheduleWriteOperandsFromLoad(w, m);\n\n }\n\n if (m && m->latency.rdy() && computeUnit->glbMemToVrfBus.rdy() &&\n accessVrf && (computeUnit->shader->coissue_return ||\n computeUnit->vectorGlobalMemUnit.rdy())) {\n\n w = m->wavefront();\n\n DPRINTF(GPUMem, \"CU%d: WF[%d][%d]: Completing global mem instr %s\\n\",\n m->cu_id, m->simdId, m->wfSlotId, m->disassemble());\n m->completeAcc(m);\n\n if (m->isLoad() || m->isAtomicRet()) {\n w->computeUnit->vrf[w->simdId]->\n scheduleWriteOperandsFromLoad(w, m);\n }\n\n completeRequest(m);\n\n Tick accessTime = curTick() - m->getAccessTime();\n\n \/\/ Decrement outstanding requests count\n computeUnit->shader->ScheduleAdd(&w->outstandingReqs, m->time, -1);\n if (m->isStore() || m->isAtomic() || m->isMemSync()) {\n computeUnit->shader->sampleStore(accessTime);\n computeUnit->shader->ScheduleAdd(&w->outstandingReqsWrGm,\n m->time, -1);\n }\n\n if (m->isLoad() || m->isAtomic() || m->isMemSync()) {\n computeUnit->shader->sampleLoad(accessTime);\n computeUnit->shader->ScheduleAdd(&w->outstandingReqsRdGm,\n m->time, -1);\n }\n\n w->validateRequestCounters();\n\n \/\/ Generate stats for round-trip time for vectory memory insts\n \/\/ going all the way to memory and stats for individual cache\n \/\/ blocks generated by the instruction.\n m->profileRoundTripTime(curTick(), InstMemoryHop::Complete);\n computeUnit->shader->sampleInstRoundTrip(m->getRoundTripTime());\n computeUnit->shader->sampleLineRoundTrip(m->getLineAddressTime());\n\n \/\/ Mark write bus busy for appropriate amount of time\n computeUnit->glbMemToVrfBus.set(m->time);\n if (!computeUnit->shader->coissue_return)\n w->computeUnit->vectorGlobalMemUnit.set(m->time);\n }\n\n \/\/ If pipeline has executed a global memory instruction\n \/\/ execute global memory packets and issue global\n \/\/ memory packets to DTLB\n if (!gmIssuedRequests.empty()) {\n GPUDynInstPtr mp = gmIssuedRequests.front();\n if (mp->isLoad() || mp->isAtomic()) {\n if (inflightLoads >= gmQueueSize) {\n return;\n } else {\n ++inflightLoads;\n }\n } else if (mp->isStore()) {\n if (inflightStores >= gmQueueSize) {\n return;\n } else {\n ++inflightStores;\n }\n }\n\n DPRINTF(GPUCoalescer, \"initiateAcc for %s seqNum %d\\n\",\n mp->disassemble(), mp->seqNum());\n \/\/ Memfences will not return tokens and must be issued so we should\n \/\/ not request one as this will deplete the token count until deadlock\n if (!mp->isMemSync()) {\n assert(mp->computeUnit()->getTokenManager()->haveTokens(1));\n mp->computeUnit()->getTokenManager()->acquireTokens(1);\n }\n mp->initiateAcc(mp);\n\n if (((mp->isMemSync() && !mp->isEndOfKernel()) || !mp->isMemSync())) {\n \/**\n * if we are not in out-of-order data delivery mode\n * then we keep the responses sorted in program order.\n * in order to do so we must reserve an entry in the\n * resp buffer before we issue the request to the mem\n * system. mem fence requests will not be stored here\n * because once they are issued from the GM pipeline,\n * they do not send any response back to it.\n *\/\n gmOrderedRespBuffer.insert(std::make_pair(mp->seqNum(),\n std::make_pair(mp, false)));\n }\n\n gmIssuedRequests.pop();\n\n DPRINTF(GPUMem, \"CU%d: WF[%d][%d] Popping 0 mem_op = \\n\",\n computeUnit->cu_id, mp->simdId, mp->wfSlotId);\n }\n}\n\nGPUDynInstPtr\nGlobalMemPipeline::getNextReadyResp()\n{\n if (!gmOrderedRespBuffer.empty()) {\n auto mem_req = gmOrderedRespBuffer.begin();\n\n if (mem_req->second.second) {\n return mem_req->second.first;\n }\n }\n\n return nullptr;\n}\n\nvoid\nGlobalMemPipeline::completeRequest(GPUDynInstPtr gpuDynInst)\n{\n if (gpuDynInst->isLoad() || gpuDynInst->isAtomic()) {\n assert(inflightLoads > 0);\n --inflightLoads;\n } else if (gpuDynInst->isStore()) {\n assert(inflightStores > 0);\n --inflightStores;\n }\n\n \/\/ we should only pop the oldest requst, and it\n \/\/ should be marked as done if we are here\n assert(gmOrderedRespBuffer.begin()->first == gpuDynInst->seqNum());\n assert(gmOrderedRespBuffer.begin()->second.first == gpuDynInst);\n assert(gmOrderedRespBuffer.begin()->second.second);\n \/\/ remove this instruction from the buffer by its\n \/\/ unique seq ID\n gmOrderedRespBuffer.erase(gpuDynInst->seqNum());\n}\n\nvoid\nGlobalMemPipeline::issueRequest(GPUDynInstPtr gpuDynInst)\n{\n gpuDynInst->setAccessTime(curTick());\n gpuDynInst->profileRoundTripTime(curTick(), InstMemoryHop::Initiate);\n gmIssuedRequests.push(gpuDynInst);\n}\n\nvoid\nGlobalMemPipeline::handleResponse(GPUDynInstPtr gpuDynInst)\n{\n auto mem_req = gmOrderedRespBuffer.find(gpuDynInst->seqNum());\n \/\/ if we are getting a response for this mem request,\n \/\/ then it ought to already be in the ordered response\n \/\/ buffer\n assert(mem_req != gmOrderedRespBuffer.end());\n mem_req->second.second = true;\n}\n\nvoid\nGlobalMemPipeline::regStats()\n{\n loadVrfBankConflictCycles\n .name(name() + \".load_vrf_bank_conflict_cycles\")\n .desc(\"total number of cycles GM data are delayed before updating \"\n \"the VRF\")\n ;\n}\n<commit_msg>gpu-compute: remove recvToken from GM pipe exec<commit_after>\/*\n * Copyright (c) 2014-2015 Advanced Micro Devices, Inc.\n * All rights reserved.\n *\n * For use for simulation and test purposes only\n *\n * Redistribution and use in source and binary forms, with or without\n * modification, are permitted provided that the following conditions are met:\n *\n * 1. Redistributions of source code must retain the above copyright notice,\n * this list of conditions and the following disclaimer.\n *\n * 2. Redistributions in binary form must reproduce the above copyright notice,\n * this list of conditions and the following disclaimer in the documentation\n * and\/or other materials provided with the distribution.\n *\n * 3. Neither the name of the copyright holder nor the names of its\n * contributors may be used to endorse or promote products derived from this\n * software without specific prior written permission.\n *\n * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS \"AS IS\"\n * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE\n * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE\n * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE\n * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR\n * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF\n * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS\n * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN\n * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)\n * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE\n * POSSIBILITY OF SUCH DAMAGE.\n *\/\n\n#define __STDC_FORMAT_MACROS\n#include <cinttypes>\n#include \"debug\/GPUCoalescer.hh\"\n#include \"debug\/GPUMem.hh\"\n#include \"debug\/GPUReg.hh\"\n#include \"gpu-compute\/compute_unit.hh\"\n#include \"gpu-compute\/global_memory_pipeline.hh\"\n#include \"gpu-compute\/gpu_dyn_inst.hh\"\n#include \"gpu-compute\/shader.hh\"\n#include \"gpu-compute\/vector_register_file.hh\"\n#include \"gpu-compute\/wavefront.hh\"\n\nGlobalMemPipeline::GlobalMemPipeline(const ComputeUnitParams* p) :\n computeUnit(nullptr), gmQueueSize(p->global_mem_queue_size),\n maxWaveRequests(p->max_wave_requests), inflightStores(0),\n inflightLoads(0)\n{\n}\n\nvoid\nGlobalMemPipeline::init(ComputeUnit *cu)\n{\n computeUnit = cu;\n globalMemSize = computeUnit->shader->globalMemSize;\n _name = computeUnit->name() + \".GlobalMemPipeline\";\n}\n\nbool\nGlobalMemPipeline::coalescerReady(GPUDynInstPtr mp) const\n{\n \/\/ We require one token from the coalescer's uncoalesced table to\n \/\/ proceed\n int token_count = 1;\n\n \/\/ Make sure the vector port has tokens. There is a single pool\n \/\/ of tokens so only one port in the vector port needs to be checked.\n \/\/ Lane 0 is chosen arbirarily.\n DPRINTF(GPUCoalescer, \"Checking for %d tokens\\n\", token_count);\n if (!mp->computeUnit()->getTokenManager()->haveTokens(token_count)) {\n DPRINTF(GPUCoalescer, \"Stalling inst because coalsr is busy!\\n\");\n return false;\n }\n\n return true;\n}\n\nvoid\nGlobalMemPipeline::acqCoalescerToken(GPUDynInstPtr mp)\n{\n \/\/ We require one token from the coalescer's uncoalesced table to\n \/\/ proceed\n int token_count = 1;\n\n DPRINTF(GPUCoalescer, \"Acquiring %d token(s)\\n\", token_count);\n assert(mp->computeUnit()->getTokenManager()->haveTokens(token_count));\n mp->computeUnit()->getTokenManager()->acquireTokens(token_count);\n}\n\nbool\nGlobalMemPipeline::outstandingReqsCheck(GPUDynInstPtr mp) const\n{\n \/\/ Ensure we haven't exceeded the maximum number of vmem requests\n \/\/ for this wavefront\n if ((mp->wavefront()->outstandingReqsRdGm\n + mp->wavefront()->outstandingReqsWrGm) >= maxWaveRequests) {\n return false;\n }\n\n return true;\n}\n\nvoid\nGlobalMemPipeline::exec()\n{\n \/\/ apply any returned global memory operations\n GPUDynInstPtr m = getNextReadyResp();\n\n bool accessVrf = true;\n Wavefront *w = nullptr;\n\n \/\/ check the VRF to see if the operands of a load (or load component\n \/\/ of an atomic) are accessible\n if (m && (m->isLoad() || m->isAtomicRet())) {\n w = m->wavefront();\n\n accessVrf = w->computeUnit->vrf[w->simdId]->\n canScheduleWriteOperandsFromLoad(w, m);\n\n }\n\n if (m && m->latency.rdy() && computeUnit->glbMemToVrfBus.rdy() &&\n accessVrf && (computeUnit->shader->coissue_return ||\n computeUnit->vectorGlobalMemUnit.rdy())) {\n\n w = m->wavefront();\n\n DPRINTF(GPUMem, \"CU%d: WF[%d][%d]: Completing global mem instr %s\\n\",\n m->cu_id, m->simdId, m->wfSlotId, m->disassemble());\n m->completeAcc(m);\n\n if (m->isLoad() || m->isAtomicRet()) {\n w->computeUnit->vrf[w->simdId]->\n scheduleWriteOperandsFromLoad(w, m);\n }\n\n completeRequest(m);\n\n Tick accessTime = curTick() - m->getAccessTime();\n\n \/\/ Decrement outstanding requests count\n computeUnit->shader->ScheduleAdd(&w->outstandingReqs, m->time, -1);\n if (m->isStore() || m->isAtomic() || m->isMemSync()) {\n computeUnit->shader->sampleStore(accessTime);\n computeUnit->shader->ScheduleAdd(&w->outstandingReqsWrGm,\n m->time, -1);\n }\n\n if (m->isLoad() || m->isAtomic() || m->isMemSync()) {\n computeUnit->shader->sampleLoad(accessTime);\n computeUnit->shader->ScheduleAdd(&w->outstandingReqsRdGm,\n m->time, -1);\n }\n\n w->validateRequestCounters();\n\n \/\/ Generate stats for round-trip time for vectory memory insts\n \/\/ going all the way to memory and stats for individual cache\n \/\/ blocks generated by the instruction.\n m->profileRoundTripTime(curTick(), InstMemoryHop::Complete);\n computeUnit->shader->sampleInstRoundTrip(m->getRoundTripTime());\n computeUnit->shader->sampleLineRoundTrip(m->getLineAddressTime());\n\n \/\/ Mark write bus busy for appropriate amount of time\n computeUnit->glbMemToVrfBus.set(m->time);\n if (!computeUnit->shader->coissue_return)\n w->computeUnit->vectorGlobalMemUnit.set(m->time);\n }\n\n \/\/ If pipeline has executed a global memory instruction\n \/\/ execute global memory packets and issue global\n \/\/ memory packets to DTLB\n if (!gmIssuedRequests.empty()) {\n GPUDynInstPtr mp = gmIssuedRequests.front();\n if (mp->isLoad() || mp->isAtomic()) {\n if (inflightLoads >= gmQueueSize) {\n return;\n } else {\n ++inflightLoads;\n }\n } else if (mp->isStore()) {\n if (inflightStores >= gmQueueSize) {\n return;\n } else {\n ++inflightStores;\n }\n }\n\n DPRINTF(GPUCoalescer, \"initiateAcc for %s seqNum %d\\n\",\n mp->disassemble(), mp->seqNum());\n mp->initiateAcc(mp);\n\n if (((mp->isMemSync() && !mp->isEndOfKernel()) || !mp->isMemSync())) {\n \/**\n * if we are not in out-of-order data delivery mode\n * then we keep the responses sorted in program order.\n * in order to do so we must reserve an entry in the\n * resp buffer before we issue the request to the mem\n * system. mem fence requests will not be stored here\n * because once they are issued from the GM pipeline,\n * they do not send any response back to it.\n *\/\n gmOrderedRespBuffer.insert(std::make_pair(mp->seqNum(),\n std::make_pair(mp, false)));\n }\n\n gmIssuedRequests.pop();\n\n DPRINTF(GPUMem, \"CU%d: WF[%d][%d] Popping 0 mem_op = \\n\",\n computeUnit->cu_id, mp->simdId, mp->wfSlotId);\n }\n}\n\nGPUDynInstPtr\nGlobalMemPipeline::getNextReadyResp()\n{\n if (!gmOrderedRespBuffer.empty()) {\n auto mem_req = gmOrderedRespBuffer.begin();\n\n if (mem_req->second.second) {\n return mem_req->second.first;\n }\n }\n\n return nullptr;\n}\n\nvoid\nGlobalMemPipeline::completeRequest(GPUDynInstPtr gpuDynInst)\n{\n if (gpuDynInst->isLoad() || gpuDynInst->isAtomic()) {\n assert(inflightLoads > 0);\n --inflightLoads;\n } else if (gpuDynInst->isStore()) {\n assert(inflightStores > 0);\n --inflightStores;\n }\n\n \/\/ we should only pop the oldest requst, and it\n \/\/ should be marked as done if we are here\n assert(gmOrderedRespBuffer.begin()->first == gpuDynInst->seqNum());\n assert(gmOrderedRespBuffer.begin()->second.first == gpuDynInst);\n assert(gmOrderedRespBuffer.begin()->second.second);\n \/\/ remove this instruction from the buffer by its\n \/\/ unique seq ID\n gmOrderedRespBuffer.erase(gpuDynInst->seqNum());\n}\n\nvoid\nGlobalMemPipeline::issueRequest(GPUDynInstPtr gpuDynInst)\n{\n gpuDynInst->setAccessTime(curTick());\n gpuDynInst->profileRoundTripTime(curTick(), InstMemoryHop::Initiate);\n gmIssuedRequests.push(gpuDynInst);\n}\n\nvoid\nGlobalMemPipeline::handleResponse(GPUDynInstPtr gpuDynInst)\n{\n auto mem_req = gmOrderedRespBuffer.find(gpuDynInst->seqNum());\n \/\/ if we are getting a response for this mem request,\n \/\/ then it ought to already be in the ordered response\n \/\/ buffer\n assert(mem_req != gmOrderedRespBuffer.end());\n mem_req->second.second = true;\n}\n\nvoid\nGlobalMemPipeline::regStats()\n{\n loadVrfBankConflictCycles\n .name(name() + \".load_vrf_bank_conflict_cycles\")\n .desc(\"total number of cycles GM data are delayed before updating \"\n \"the VRF\")\n ;\n}\n<|endoftext|>"} {"text":"<commit_before>\/\/===-- MipsMCCodeEmitter.cpp - Convert Mips Code to Machine Code ---------===\/\/\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 MipsMCCodeEmitter class.\n\/\/\n\/\/===----------------------------------------------------------------------===\/\/\n\/\/\n#define DEBUG_TYPE \"mccodeemitter\"\n#include \"MCTargetDesc\/MipsBaseInfo.h\"\n#include \"MCTargetDesc\/MipsFixupKinds.h\"\n#include \"MCTargetDesc\/MipsMCTargetDesc.h\"\n#include \"llvm\/ADT\/APFloat.h\"\n#include \"llvm\/ADT\/Statistic.h\"\n#include \"llvm\/MC\/MCCodeEmitter.h\"\n#include \"llvm\/MC\/MCExpr.h\"\n#include \"llvm\/MC\/MCInst.h\"\n#include \"llvm\/MC\/MCInstrInfo.h\"\n#include \"llvm\/MC\/MCRegisterInfo.h\"\n#include \"llvm\/MC\/MCSubtargetInfo.h\"\n#include \"llvm\/Support\/raw_ostream.h\"\n\nusing namespace llvm;\n\nnamespace {\nclass MipsMCCodeEmitter : public MCCodeEmitter {\n MipsMCCodeEmitter(const MipsMCCodeEmitter &); \/\/ DO NOT IMPLEMENT\n void operator=(const MipsMCCodeEmitter &); \/\/ DO NOT IMPLEMENT\n const MCInstrInfo &MCII;\n const MCSubtargetInfo &STI;\n MCContext &Ctx;\n bool IsLittleEndian;\n\npublic:\n MipsMCCodeEmitter(const MCInstrInfo &mcii, const MCSubtargetInfo &sti,\n MCContext &ctx, bool IsLittle) :\n MCII(mcii), STI(sti) , Ctx(ctx), IsLittleEndian(IsLittle) {}\n\n ~MipsMCCodeEmitter() {}\n\n void EmitByte(unsigned char C, raw_ostream &OS) const {\n OS << (char)C;\n }\n\n void EmitInstruction(uint64_t Val, unsigned Size, raw_ostream &OS) const {\n \/\/ Output the instruction encoding in little endian byte order.\n for (unsigned i = 0; i < Size; ++i) {\n unsigned Shift = IsLittleEndian ? i * 8 : (Size - 1 - i) * 8;\n EmitByte((Val >> Shift) & 0xff, OS);\n }\n }\n\n void EncodeInstruction(const MCInst &MI, raw_ostream &OS,\n SmallVectorImpl<MCFixup> &Fixups) const;\n\n \/\/ getBinaryCodeForInstr - TableGen'erated function for getting the\n \/\/ binary encoding for an instruction.\n uint64_t getBinaryCodeForInstr(const MCInst &MI,\n SmallVectorImpl<MCFixup> &Fixups) const;\n\n \/\/ getBranchJumpOpValue - Return binary encoding of the jump\n \/\/ target operand. If the machine operand requires relocation,\n \/\/ record the relocation and return zero.\n unsigned getJumpTargetOpValue(const MCInst &MI, unsigned OpNo,\n SmallVectorImpl<MCFixup> &Fixups) const;\n\n \/\/ getBranchTargetOpValue - Return binary encoding of the branch\n \/\/ target operand. If the machine operand requires relocation,\n \/\/ record the relocation and return zero.\n unsigned getBranchTargetOpValue(const MCInst &MI, unsigned OpNo,\n SmallVectorImpl<MCFixup> &Fixups) const;\n\n \/\/ getMachineOpValue - Return binary encoding of operand. If the machin\n \/\/ operand requires relocation, record the relocation and return zero.\n unsigned getMachineOpValue(const MCInst &MI,const MCOperand &MO,\n SmallVectorImpl<MCFixup> &Fixups) const;\n\n unsigned getMemEncoding(const MCInst &MI, unsigned OpNo,\n SmallVectorImpl<MCFixup> &Fixups) const;\n unsigned getSizeExtEncoding(const MCInst &MI, unsigned OpNo,\n SmallVectorImpl<MCFixup> &Fixups) const;\n unsigned getSizeInsEncoding(const MCInst &MI, unsigned OpNo,\n SmallVectorImpl<MCFixup> &Fixups) const;\n\n}; \/\/ class MipsMCCodeEmitter\n} \/\/ namespace\n\nMCCodeEmitter *llvm::createMipsMCCodeEmitterEB(const MCInstrInfo &MCII,\n const MCRegisterInfo &MRI,\n const MCSubtargetInfo &STI,\n MCContext &Ctx)\n{\n return new MipsMCCodeEmitter(MCII, STI, Ctx, false);\n}\n\nMCCodeEmitter *llvm::createMipsMCCodeEmitterEL(const MCInstrInfo &MCII,\n const MCRegisterInfo &MRI,\n const MCSubtargetInfo &STI,\n MCContext &Ctx)\n{\n return new MipsMCCodeEmitter(MCII, STI, Ctx, true);\n}\n\n\/\/\/ EncodeInstruction - Emit the instruction.\n\/\/\/ Size the instruction (currently only 4 bytes\nvoid MipsMCCodeEmitter::\nEncodeInstruction(const MCInst &MI, raw_ostream &OS,\n SmallVectorImpl<MCFixup> &Fixups) const\n{\n uint32_t Binary = getBinaryCodeForInstr(MI, Fixups);\n\n \/\/ Check for unimplemented opcodes.\n \/\/ Unfortunately in MIPS both NOT and SLL will come in with Binary == 0\n \/\/ so we have to special check for them.\n unsigned Opcode = MI.getOpcode();\n if ((Opcode != Mips::NOP) && (Opcode != Mips::SLL) && !Binary)\n llvm_unreachable(\"unimplemented opcode in EncodeInstruction()\");\n\n const MCInstrDesc &Desc = MCII.get(MI.getOpcode());\n uint64_t TSFlags = Desc.TSFlags;\n\n \/\/ Pseudo instructions don't get encoded and shouldn't be here\n \/\/ in the first place!\n if ((TSFlags & MipsII::FormMask) == MipsII::Pseudo)\n llvm_unreachable(\"Pseudo opcode found in EncodeInstruction()\");\n\n \/\/ For now all instructions are 4 bytes\n int Size = 4; \/\/ FIXME: Have Desc.getSize() return the correct value!\n\n EmitInstruction(Binary, Size, OS);\n}\n\n\/\/\/ getBranchTargetOpValue - Return binary encoding of the branch\n\/\/\/ target operand. If the machine operand requires relocation,\n\/\/\/ record the relocation and return zero.\nunsigned MipsMCCodeEmitter::\ngetBranchTargetOpValue(const MCInst &MI, unsigned OpNo,\n SmallVectorImpl<MCFixup> &Fixups) const {\n\n const MCOperand &MO = MI.getOperand(OpNo);\n\n \/\/ If the destination is an immediate, we have nothing to do.\n if (MO.isImm()) return MO.getImm();\n assert(MO.isExpr() &&\n \"getBranchTargetOpValue expects only expressions or immediates\");\n\n const MCExpr *Expr = MO.getExpr();\n Fixups.push_back(MCFixup::Create(0, Expr,\n MCFixupKind(Mips::fixup_Mips_PC16)));\n return 0;\n}\n\n\/\/\/ getJumpTargetOpValue - Return binary encoding of the jump\n\/\/\/ target operand. If the machine operand requires relocation,\n\/\/\/ record the relocation and return zero.\nunsigned MipsMCCodeEmitter::\ngetJumpTargetOpValue(const MCInst &MI, unsigned OpNo,\n SmallVectorImpl<MCFixup> &Fixups) const {\n\n const MCOperand &MO = MI.getOperand(OpNo);\n \/\/ If the destination is an immediate, we have nothing to do.\n if (MO.isImm()) return MO.getImm();\n assert(MO.isExpr() &&\n \"getJumpTargetOpValue expects only expressions or an immediate\");\n\n const MCExpr *Expr = MO.getExpr();\n Fixups.push_back(MCFixup::Create(0, Expr,\n MCFixupKind(Mips::fixup_Mips_26)));\n return 0;\n}\n\n\/\/\/ getMachineOpValue - Return binary encoding of operand. If the machine\n\/\/\/ operand requires relocation, record the relocation and return zero.\nunsigned MipsMCCodeEmitter::\ngetMachineOpValue(const MCInst &MI, const MCOperand &MO,\n SmallVectorImpl<MCFixup> &Fixups) const {\n if (MO.isReg()) {\n unsigned Reg = MO.getReg();\n unsigned RegNo = getMipsRegisterNumbering(Reg);\n return RegNo;\n } else if (MO.isImm()) {\n return static_cast<unsigned>(MO.getImm());\n } else if (MO.isFPImm()) {\n return static_cast<unsigned>(APFloat(MO.getFPImm())\n .bitcastToAPInt().getHiBits(32).getLimitedValue());\n }\n\n \/\/ MO must be an Expr.\n assert(MO.isExpr());\n\n const MCExpr *Expr = MO.getExpr();\n MCExpr::ExprKind Kind = Expr->getKind();\n\n if (Kind == MCExpr::Binary) {\n Expr = static_cast<const MCBinaryExpr*>(Expr)->getLHS();\n Kind = Expr->getKind();\n }\n\n assert (Kind == MCExpr::SymbolRef);\n\n Mips::Fixups FixupKind = Mips::Fixups(0);\n\n switch(cast<MCSymbolRefExpr>(Expr)->getKind()) {\n default: llvm_unreachable(\"Unknown fixup kind!\");\n break;\n case MCSymbolRefExpr::VK_Mips_GPOFF_HI :\n FixupKind = Mips::fixup_Mips_GPOFF_HI;\n break;\n case MCSymbolRefExpr::VK_Mips_GPOFF_LO :\n FixupKind = Mips::fixup_Mips_GPOFF_LO;\n break;\n case MCSymbolRefExpr::VK_Mips_GOT_PAGE :\n FixupKind = Mips::fixup_Mips_GOT_PAGE;\n break;\n case MCSymbolRefExpr::VK_Mips_GOT_OFST :\n FixupKind = Mips::fixup_Mips_GOT_OFST;\n break;\n case MCSymbolRefExpr::VK_Mips_GOT_DISP :\n FixupKind = Mips::fixup_Mips_GOT_DISP;\n break;\n case MCSymbolRefExpr::VK_Mips_GPREL:\n FixupKind = Mips::fixup_Mips_GPREL16;\n break;\n case MCSymbolRefExpr::VK_Mips_GOT_CALL:\n FixupKind = Mips::fixup_Mips_CALL16;\n break;\n case MCSymbolRefExpr::VK_Mips_GOT16:\n FixupKind = Mips::fixup_Mips_GOT_Global;\n break;\n case MCSymbolRefExpr::VK_Mips_GOT:\n FixupKind = Mips::fixup_Mips_GOT_Local;\n break;\n case MCSymbolRefExpr::VK_Mips_ABS_HI:\n FixupKind = Mips::fixup_Mips_HI16;\n break;\n case MCSymbolRefExpr::VK_Mips_ABS_LO:\n FixupKind = Mips::fixup_Mips_LO16;\n break;\n case MCSymbolRefExpr::VK_Mips_TLSGD:\n FixupKind = Mips::fixup_Mips_TLSGD;\n break;\n case MCSymbolRefExpr::VK_Mips_TLSLDM:\n FixupKind = Mips::fixup_Mips_TLSLDM;\n break;\n case MCSymbolRefExpr::VK_Mips_DTPREL_HI:\n FixupKind = Mips::fixup_Mips_DTPREL_HI;\n break;\n case MCSymbolRefExpr::VK_Mips_DTPREL_LO:\n FixupKind = Mips::fixup_Mips_DTPREL_LO;\n break;\n case MCSymbolRefExpr::VK_Mips_GOTTPREL:\n FixupKind = Mips::fixup_Mips_GOTTPREL;\n break;\n case MCSymbolRefExpr::VK_Mips_TPREL_HI:\n FixupKind = Mips::fixup_Mips_TPREL_HI;\n break;\n case MCSymbolRefExpr::VK_Mips_TPREL_LO:\n FixupKind = Mips::fixup_Mips_TPREL_LO;\n break;\n case MCSymbolRefExpr::VK_Mips_HIGHER:\n FixupKind = Mips::fixup_Mips_HIGHER;\n break;\n case MCSymbolRefExpr::VK_Mips_HIGHEST:\n FixupKind = Mips::fixup_Mips_HIGHEST;\n break;\n } \/\/ switch\n\n Fixups.push_back(MCFixup::Create(0, MO.getExpr(), MCFixupKind(FixupKind)));\n\n \/\/ All of the information is in the fixup.\n return 0;\n}\n\n\/\/\/ getMemEncoding - Return binary encoding of memory related operand.\n\/\/\/ If the offset operand requires relocation, record the relocation.\nunsigned\nMipsMCCodeEmitter::getMemEncoding(const MCInst &MI, unsigned OpNo,\n SmallVectorImpl<MCFixup> &Fixups) const {\n \/\/ Base register is encoded in bits 20-16, offset is encoded in bits 15-0.\n assert(MI.getOperand(OpNo).isReg());\n unsigned RegBits = getMachineOpValue(MI, MI.getOperand(OpNo),Fixups) << 16;\n unsigned OffBits = getMachineOpValue(MI, MI.getOperand(OpNo+1), Fixups);\n\n return (OffBits & 0xFFFF) | RegBits;\n}\n\nunsigned\nMipsMCCodeEmitter::getSizeExtEncoding(const MCInst &MI, unsigned OpNo,\n SmallVectorImpl<MCFixup> &Fixups) const {\n assert(MI.getOperand(OpNo).isImm());\n unsigned SizeEncoding = getMachineOpValue(MI, MI.getOperand(OpNo), Fixups);\n return SizeEncoding - 1;\n}\n\n\/\/ FIXME: should be called getMSBEncoding\n\/\/\nunsigned\nMipsMCCodeEmitter::getSizeInsEncoding(const MCInst &MI, unsigned OpNo,\n SmallVectorImpl<MCFixup> &Fixups) const {\n assert(MI.getOperand(OpNo-1).isImm());\n assert(MI.getOperand(OpNo).isImm());\n unsigned Position = getMachineOpValue(MI, MI.getOperand(OpNo-1), Fixups);\n unsigned Size = getMachineOpValue(MI, MI.getOperand(OpNo), Fixups);\n\n return Position + Size - 1;\n}\n\n#include \"MipsGenMCCodeEmitter.inc\"\n\n<commit_msg>Remove unused private fields to silence -Wunused-private-field.<commit_after>\/\/===-- MipsMCCodeEmitter.cpp - Convert Mips Code to Machine Code ---------===\/\/\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 MipsMCCodeEmitter class.\n\/\/\n\/\/===----------------------------------------------------------------------===\/\/\n\/\/\n#define DEBUG_TYPE \"mccodeemitter\"\n#include \"MCTargetDesc\/MipsBaseInfo.h\"\n#include \"MCTargetDesc\/MipsFixupKinds.h\"\n#include \"MCTargetDesc\/MipsMCTargetDesc.h\"\n#include \"llvm\/ADT\/APFloat.h\"\n#include \"llvm\/ADT\/Statistic.h\"\n#include \"llvm\/MC\/MCCodeEmitter.h\"\n#include \"llvm\/MC\/MCExpr.h\"\n#include \"llvm\/MC\/MCInst.h\"\n#include \"llvm\/MC\/MCInstrInfo.h\"\n#include \"llvm\/MC\/MCRegisterInfo.h\"\n#include \"llvm\/MC\/MCSubtargetInfo.h\"\n#include \"llvm\/Support\/raw_ostream.h\"\n\nusing namespace llvm;\n\nnamespace {\nclass MipsMCCodeEmitter : public MCCodeEmitter {\n MipsMCCodeEmitter(const MipsMCCodeEmitter &) LLVM_DELETED_FUNCTION;\n void operator=(const MipsMCCodeEmitter &) LLVM_DELETED_FUNCTION;\n const MCInstrInfo &MCII;\n bool IsLittleEndian;\n\npublic:\n MipsMCCodeEmitter(const MCInstrInfo &mcii, bool IsLittle) :\n MCII(mcii), IsLittleEndian(IsLittle) {}\n\n ~MipsMCCodeEmitter() {}\n\n void EmitByte(unsigned char C, raw_ostream &OS) const {\n OS << (char)C;\n }\n\n void EmitInstruction(uint64_t Val, unsigned Size, raw_ostream &OS) const {\n \/\/ Output the instruction encoding in little endian byte order.\n for (unsigned i = 0; i < Size; ++i) {\n unsigned Shift = IsLittleEndian ? i * 8 : (Size - 1 - i) * 8;\n EmitByte((Val >> Shift) & 0xff, OS);\n }\n }\n\n void EncodeInstruction(const MCInst &MI, raw_ostream &OS,\n SmallVectorImpl<MCFixup> &Fixups) const;\n\n \/\/ getBinaryCodeForInstr - TableGen'erated function for getting the\n \/\/ binary encoding for an instruction.\n uint64_t getBinaryCodeForInstr(const MCInst &MI,\n SmallVectorImpl<MCFixup> &Fixups) const;\n\n \/\/ getBranchJumpOpValue - Return binary encoding of the jump\n \/\/ target operand. If the machine operand requires relocation,\n \/\/ record the relocation and return zero.\n unsigned getJumpTargetOpValue(const MCInst &MI, unsigned OpNo,\n SmallVectorImpl<MCFixup> &Fixups) const;\n\n \/\/ getBranchTargetOpValue - Return binary encoding of the branch\n \/\/ target operand. If the machine operand requires relocation,\n \/\/ record the relocation and return zero.\n unsigned getBranchTargetOpValue(const MCInst &MI, unsigned OpNo,\n SmallVectorImpl<MCFixup> &Fixups) const;\n\n \/\/ getMachineOpValue - Return binary encoding of operand. If the machin\n \/\/ operand requires relocation, record the relocation and return zero.\n unsigned getMachineOpValue(const MCInst &MI,const MCOperand &MO,\n SmallVectorImpl<MCFixup> &Fixups) const;\n\n unsigned getMemEncoding(const MCInst &MI, unsigned OpNo,\n SmallVectorImpl<MCFixup> &Fixups) const;\n unsigned getSizeExtEncoding(const MCInst &MI, unsigned OpNo,\n SmallVectorImpl<MCFixup> &Fixups) const;\n unsigned getSizeInsEncoding(const MCInst &MI, unsigned OpNo,\n SmallVectorImpl<MCFixup> &Fixups) const;\n\n}; \/\/ class MipsMCCodeEmitter\n} \/\/ namespace\n\nMCCodeEmitter *llvm::createMipsMCCodeEmitterEB(const MCInstrInfo &MCII,\n const MCRegisterInfo &MRI,\n const MCSubtargetInfo &STI,\n MCContext &Ctx)\n{\n return new MipsMCCodeEmitter(MCII, false);\n}\n\nMCCodeEmitter *llvm::createMipsMCCodeEmitterEL(const MCInstrInfo &MCII,\n const MCRegisterInfo &MRI,\n const MCSubtargetInfo &STI,\n MCContext &Ctx)\n{\n return new MipsMCCodeEmitter(MCII, true);\n}\n\n\/\/\/ EncodeInstruction - Emit the instruction.\n\/\/\/ Size the instruction (currently only 4 bytes\nvoid MipsMCCodeEmitter::\nEncodeInstruction(const MCInst &MI, raw_ostream &OS,\n SmallVectorImpl<MCFixup> &Fixups) const\n{\n uint32_t Binary = getBinaryCodeForInstr(MI, Fixups);\n\n \/\/ Check for unimplemented opcodes.\n \/\/ Unfortunately in MIPS both NOT and SLL will come in with Binary == 0\n \/\/ so we have to special check for them.\n unsigned Opcode = MI.getOpcode();\n if ((Opcode != Mips::NOP) && (Opcode != Mips::SLL) && !Binary)\n llvm_unreachable(\"unimplemented opcode in EncodeInstruction()\");\n\n const MCInstrDesc &Desc = MCII.get(MI.getOpcode());\n uint64_t TSFlags = Desc.TSFlags;\n\n \/\/ Pseudo instructions don't get encoded and shouldn't be here\n \/\/ in the first place!\n if ((TSFlags & MipsII::FormMask) == MipsII::Pseudo)\n llvm_unreachable(\"Pseudo opcode found in EncodeInstruction()\");\n\n \/\/ For now all instructions are 4 bytes\n int Size = 4; \/\/ FIXME: Have Desc.getSize() return the correct value!\n\n EmitInstruction(Binary, Size, OS);\n}\n\n\/\/\/ getBranchTargetOpValue - Return binary encoding of the branch\n\/\/\/ target operand. If the machine operand requires relocation,\n\/\/\/ record the relocation and return zero.\nunsigned MipsMCCodeEmitter::\ngetBranchTargetOpValue(const MCInst &MI, unsigned OpNo,\n SmallVectorImpl<MCFixup> &Fixups) const {\n\n const MCOperand &MO = MI.getOperand(OpNo);\n\n \/\/ If the destination is an immediate, we have nothing to do.\n if (MO.isImm()) return MO.getImm();\n assert(MO.isExpr() &&\n \"getBranchTargetOpValue expects only expressions or immediates\");\n\n const MCExpr *Expr = MO.getExpr();\n Fixups.push_back(MCFixup::Create(0, Expr,\n MCFixupKind(Mips::fixup_Mips_PC16)));\n return 0;\n}\n\n\/\/\/ getJumpTargetOpValue - Return binary encoding of the jump\n\/\/\/ target operand. If the machine operand requires relocation,\n\/\/\/ record the relocation and return zero.\nunsigned MipsMCCodeEmitter::\ngetJumpTargetOpValue(const MCInst &MI, unsigned OpNo,\n SmallVectorImpl<MCFixup> &Fixups) const {\n\n const MCOperand &MO = MI.getOperand(OpNo);\n \/\/ If the destination is an immediate, we have nothing to do.\n if (MO.isImm()) return MO.getImm();\n assert(MO.isExpr() &&\n \"getJumpTargetOpValue expects only expressions or an immediate\");\n\n const MCExpr *Expr = MO.getExpr();\n Fixups.push_back(MCFixup::Create(0, Expr,\n MCFixupKind(Mips::fixup_Mips_26)));\n return 0;\n}\n\n\/\/\/ getMachineOpValue - Return binary encoding of operand. If the machine\n\/\/\/ operand requires relocation, record the relocation and return zero.\nunsigned MipsMCCodeEmitter::\ngetMachineOpValue(const MCInst &MI, const MCOperand &MO,\n SmallVectorImpl<MCFixup> &Fixups) const {\n if (MO.isReg()) {\n unsigned Reg = MO.getReg();\n unsigned RegNo = getMipsRegisterNumbering(Reg);\n return RegNo;\n } else if (MO.isImm()) {\n return static_cast<unsigned>(MO.getImm());\n } else if (MO.isFPImm()) {\n return static_cast<unsigned>(APFloat(MO.getFPImm())\n .bitcastToAPInt().getHiBits(32).getLimitedValue());\n }\n\n \/\/ MO must be an Expr.\n assert(MO.isExpr());\n\n const MCExpr *Expr = MO.getExpr();\n MCExpr::ExprKind Kind = Expr->getKind();\n\n if (Kind == MCExpr::Binary) {\n Expr = static_cast<const MCBinaryExpr*>(Expr)->getLHS();\n Kind = Expr->getKind();\n }\n\n assert (Kind == MCExpr::SymbolRef);\n\n Mips::Fixups FixupKind = Mips::Fixups(0);\n\n switch(cast<MCSymbolRefExpr>(Expr)->getKind()) {\n default: llvm_unreachable(\"Unknown fixup kind!\");\n break;\n case MCSymbolRefExpr::VK_Mips_GPOFF_HI :\n FixupKind = Mips::fixup_Mips_GPOFF_HI;\n break;\n case MCSymbolRefExpr::VK_Mips_GPOFF_LO :\n FixupKind = Mips::fixup_Mips_GPOFF_LO;\n break;\n case MCSymbolRefExpr::VK_Mips_GOT_PAGE :\n FixupKind = Mips::fixup_Mips_GOT_PAGE;\n break;\n case MCSymbolRefExpr::VK_Mips_GOT_OFST :\n FixupKind = Mips::fixup_Mips_GOT_OFST;\n break;\n case MCSymbolRefExpr::VK_Mips_GOT_DISP :\n FixupKind = Mips::fixup_Mips_GOT_DISP;\n break;\n case MCSymbolRefExpr::VK_Mips_GPREL:\n FixupKind = Mips::fixup_Mips_GPREL16;\n break;\n case MCSymbolRefExpr::VK_Mips_GOT_CALL:\n FixupKind = Mips::fixup_Mips_CALL16;\n break;\n case MCSymbolRefExpr::VK_Mips_GOT16:\n FixupKind = Mips::fixup_Mips_GOT_Global;\n break;\n case MCSymbolRefExpr::VK_Mips_GOT:\n FixupKind = Mips::fixup_Mips_GOT_Local;\n break;\n case MCSymbolRefExpr::VK_Mips_ABS_HI:\n FixupKind = Mips::fixup_Mips_HI16;\n break;\n case MCSymbolRefExpr::VK_Mips_ABS_LO:\n FixupKind = Mips::fixup_Mips_LO16;\n break;\n case MCSymbolRefExpr::VK_Mips_TLSGD:\n FixupKind = Mips::fixup_Mips_TLSGD;\n break;\n case MCSymbolRefExpr::VK_Mips_TLSLDM:\n FixupKind = Mips::fixup_Mips_TLSLDM;\n break;\n case MCSymbolRefExpr::VK_Mips_DTPREL_HI:\n FixupKind = Mips::fixup_Mips_DTPREL_HI;\n break;\n case MCSymbolRefExpr::VK_Mips_DTPREL_LO:\n FixupKind = Mips::fixup_Mips_DTPREL_LO;\n break;\n case MCSymbolRefExpr::VK_Mips_GOTTPREL:\n FixupKind = Mips::fixup_Mips_GOTTPREL;\n break;\n case MCSymbolRefExpr::VK_Mips_TPREL_HI:\n FixupKind = Mips::fixup_Mips_TPREL_HI;\n break;\n case MCSymbolRefExpr::VK_Mips_TPREL_LO:\n FixupKind = Mips::fixup_Mips_TPREL_LO;\n break;\n case MCSymbolRefExpr::VK_Mips_HIGHER:\n FixupKind = Mips::fixup_Mips_HIGHER;\n break;\n case MCSymbolRefExpr::VK_Mips_HIGHEST:\n FixupKind = Mips::fixup_Mips_HIGHEST;\n break;\n } \/\/ switch\n\n Fixups.push_back(MCFixup::Create(0, MO.getExpr(), MCFixupKind(FixupKind)));\n\n \/\/ All of the information is in the fixup.\n return 0;\n}\n\n\/\/\/ getMemEncoding - Return binary encoding of memory related operand.\n\/\/\/ If the offset operand requires relocation, record the relocation.\nunsigned\nMipsMCCodeEmitter::getMemEncoding(const MCInst &MI, unsigned OpNo,\n SmallVectorImpl<MCFixup> &Fixups) const {\n \/\/ Base register is encoded in bits 20-16, offset is encoded in bits 15-0.\n assert(MI.getOperand(OpNo).isReg());\n unsigned RegBits = getMachineOpValue(MI, MI.getOperand(OpNo),Fixups) << 16;\n unsigned OffBits = getMachineOpValue(MI, MI.getOperand(OpNo+1), Fixups);\n\n return (OffBits & 0xFFFF) | RegBits;\n}\n\nunsigned\nMipsMCCodeEmitter::getSizeExtEncoding(const MCInst &MI, unsigned OpNo,\n SmallVectorImpl<MCFixup> &Fixups) const {\n assert(MI.getOperand(OpNo).isImm());\n unsigned SizeEncoding = getMachineOpValue(MI, MI.getOperand(OpNo), Fixups);\n return SizeEncoding - 1;\n}\n\n\/\/ FIXME: should be called getMSBEncoding\n\/\/\nunsigned\nMipsMCCodeEmitter::getSizeInsEncoding(const MCInst &MI, unsigned OpNo,\n SmallVectorImpl<MCFixup> &Fixups) const {\n assert(MI.getOperand(OpNo-1).isImm());\n assert(MI.getOperand(OpNo).isImm());\n unsigned Position = getMachineOpValue(MI, MI.getOperand(OpNo-1), Fixups);\n unsigned Size = getMachineOpValue(MI, MI.getOperand(OpNo), Fixups);\n\n return Position + Size - 1;\n}\n\n#include \"MipsGenMCCodeEmitter.inc\"\n\n<|endoftext|>"} {"text":"<commit_before>#include <dropwhile.hpp>\n\n#include \"helpers.hpp\"\n\n#include <vector>\n#include <string>\n#include <iterator>\n\n#include \"catch.hpp\"\n\nusing iter::dropwhile;\n\nusing Vec = const std::vector<int>;\n\nTEST_CASE(\"dropwhile: skips initial elements\", \"[dropwhile]\") {\n Vec ns{1,2,3,4,5,6,7,8};\n auto d = dropwhile([](int i){return i < 5; }, ns);\n Vec v(std::begin(d), std::end(d));\n Vec vc = {5,6,7,8};\n REQUIRE( v == vc );\n}\n\nTEST_CASE(\"dropwhile: doesn't skip anything if it shouldn't\", \"[dropwhile]\") {\n Vec ns {3,4,5,6};\n auto d = dropwhile([](int i){return i < 3; }, ns);\n Vec v(std::begin(d), std::end(d));\n Vec vc = {3,4,5,6};\n REQUIRE( v == vc );\n}\n\nTEST_CASE(\"dropwhile: skips all elements when all are true under predicate\",\n \"[dropwhile]\") {\n Vec ns {3,4,5,6};\n auto d = dropwhile([](int i){return i != 0; }, ns);\n REQUIRE( std::begin(d) == std::end(d) );\n}\n\n<commit_msg>adds dropwhile empty test<commit_after>#include <dropwhile.hpp>\n\n#include \"helpers.hpp\"\n\n#include <vector>\n#include <string>\n#include <iterator>\n\n#include \"catch.hpp\"\n\nusing iter::dropwhile;\n\nusing Vec = const std::vector<int>;\n\nTEST_CASE(\"dropwhile: skips initial elements\", \"[dropwhile]\") {\n Vec ns{1,2,3,4,5,6,7,8};\n auto d = dropwhile([](int i){return i < 5; }, ns);\n Vec v(std::begin(d), std::end(d));\n Vec vc = {5,6,7,8};\n REQUIRE( v == vc );\n}\n\nTEST_CASE(\"dropwhile: doesn't skip anything if it shouldn't\", \"[dropwhile]\") {\n Vec ns {3,4,5,6};\n auto d = dropwhile([](int i){return i < 3; }, ns);\n Vec v(std::begin(d), std::end(d));\n Vec vc = {3,4,5,6};\n REQUIRE( v == vc );\n}\n\nTEST_CASE(\"dropwhile: skips all elements when all are true under predicate\",\n \"[dropwhile]\") {\n Vec ns {3,4,5,6};\n auto d = dropwhile([](int i){return i != 0; }, ns);\n REQUIRE( std::begin(d) == std::end(d) );\n}\n\nTEST_CASE(\"dropwhile: empty case is empty\", \"[dropwhile]\") {\n Vec ns{};\n auto d = dropwhile([](int i){return i != 0; }, ns);\n REQUIRE( std::begin(d) == std::end(d) );\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#include \"oox\/drawingml\/textliststyle.hxx\"\n\nnamespace oox { namespace drawingml {\n\nTextListStyle::TextListStyle()\n{\n for ( int i = 0; i < 9; i++ )\n {\n maListStyle.push_back( TextParagraphPropertiesPtr( new TextParagraphProperties() ) );\n maAggregationListStyle.push_back( TextParagraphPropertiesPtr( new TextParagraphProperties() ) );\n }\n}\n\nTextListStyle::~TextListStyle()\n{\n}\n\nvoid applyStyleList( const TextParagraphPropertiesVector& rSourceListStyle, TextParagraphPropertiesVector& rDestListStyle )\n{\n TextParagraphPropertiesVector::const_iterator aSourceListStyleIter( rSourceListStyle.begin() );\n TextParagraphPropertiesVector::iterator aDestListStyleIter( rDestListStyle.begin() );\n while( aSourceListStyleIter != rSourceListStyle.end() )\n {\n if ( aDestListStyleIter != rDestListStyle.end() )\n {\n (*aDestListStyleIter)->apply( **aSourceListStyleIter );\n aDestListStyleIter++;\n }\n else\n rDestListStyle.push_back( TextParagraphPropertiesPtr( new TextParagraphProperties( **aSourceListStyleIter ) ) );\n aSourceListStyleIter++;\n }\n}\n\nvoid TextListStyle::apply( const TextListStyle& rTextListStyle )\n{\n applyStyleList( rTextListStyle.getAggregationListStyle(), getAggregationListStyle() );\n applyStyleList( rTextListStyle.getListStyle(), getListStyle() );\n}\n\n#if OSL_DEBUG_LEVEL > 0\nvoid TextListStyle::dump( int nLevels ) const\n{\n for ( int i = 0; i < nLevels; i++ )\n {\n OSL_TRACE(\"level: %d\", i);\n maListStyle[ i ]->dump();\n }\n}\n#endif\n\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#include \"oox\/drawingml\/textliststyle.hxx\"\n\nnamespace oox { namespace drawingml {\n\nTextListStyle::TextListStyle()\n{\n for ( int i = 0; i < 9; i++ )\n {\n maListStyle.push_back( TextParagraphPropertiesPtr( new TextParagraphProperties() ) );\n maAggregationListStyle.push_back( TextParagraphPropertiesPtr( new TextParagraphProperties() ) );\n }\n}\n\nTextListStyle::~TextListStyle()\n{\n}\n\nvoid applyStyleList( const TextParagraphPropertiesVector& rSourceListStyle, TextParagraphPropertiesVector& rDestListStyle )\n{\n TextParagraphPropertiesVector::const_iterator aSourceListStyleIter( rSourceListStyle.begin() );\n TextParagraphPropertiesVector::iterator aDestListStyleIter( rDestListStyle.begin() );\n while( aSourceListStyleIter != rSourceListStyle.end() )\n {\n if ( aDestListStyleIter != rDestListStyle.end() )\n {\n (*aDestListStyleIter)->apply( **aSourceListStyleIter );\n ++aDestListStyleIter;\n }\n else\n rDestListStyle.push_back( TextParagraphPropertiesPtr( new TextParagraphProperties( **aSourceListStyleIter ) ) );\n ++aSourceListStyleIter;\n }\n}\n\nvoid TextListStyle::apply( const TextListStyle& rTextListStyle )\n{\n applyStyleList( rTextListStyle.getAggregationListStyle(), getAggregationListStyle() );\n applyStyleList( rTextListStyle.getListStyle(), getListStyle() );\n}\n\n#if OSL_DEBUG_LEVEL > 0\nvoid TextListStyle::dump( int nLevels ) const\n{\n for ( int i = 0; i < nLevels; i++ )\n {\n OSL_TRACE(\"level: %d\", i);\n maListStyle[ i ]->dump();\n }\n}\n#endif\n\n} }\n\n\/* vim:set shiftwidth=4 softtabstop=4 expandtab: *\/\n<|endoftext|>"} {"text":"<commit_before>\/*\n * DefaultPatternMatchCB.cc\n *\n * Copyright (C) 2008,2009,2014 Linas Vepstas\n *\n * Author: Linas Vepstas <linasvepstas@gmail.com> February 2008\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\/execution\/EvaluationLink.h>\n\n#include \"DefaultPatternMatchCB.h\"\n#include \"PatternMatchEngine.h\"\n\nusing namespace opencog;\n\n\/\/ #define DEBUG 1\n#if DEBUG\n #define dbgprt(f, varargs...) printf(f, ##varargs)\n#else\n #define dbgprt(f, varargs...)\n#endif\n\n\/* ======================================================== *\/\n\n\/\/ Find a good place to start the search.\n\/\/\n\/\/ The handle h points to a clause. In principle, it is enough to\n\/\/ simply find a constant in the clause, and just start there. In\n\/\/ practice, this can be an awful way to do things. So, for example,\n\/\/ most \"typical\" clauses will be of the form\n\/\/\n\/\/ EvaluationLink\n\/\/ PredicteNode \"blah\"\n\/\/ ListLink\n\/\/ VariableNode $var\n\/\/ ConceptNode \"item\"\n\/\/\n\/\/ Typically, the incoming set to \"blah\" will be huge, so starting the\n\/\/ search there would be a poor choice. Typically, the incoming set to\n\/\/ \"item\" will be much smaller, and so makes a better choice. The code\n\/\/ below tries to pass over \"blah\" and pick \"item\" instead. It does so\n\/\/ by comparing the size of the incoming sets of the two constants, and\n\/\/ picking the one with the smaller (\"thinner\") incoming set. Note that\n\/\/ this is a form of \"greedy\" search.\n\/\/\n\/\/ Note that the algo performs a full-depth search to find this. That's\n\/\/ OK, because typeical clauses are never deep.\n\/\/\n\/\/ Note that the size of the incoming set really is a better measure,\n\/\/ and not the depth. So, for example, if \"item\" has a huge incoming\n\/\/ set, but \"blah\" does not, then \"blah\" is a much better place to\n\/\/ start.\n\/\/\n\/\/ size_t& depth will be set to the depth of the thinnest constant found.\n\/\/ Handle& start will be set to the link containing that constant.\n\/\/ size_t& width will be set to the incoming-set size of the thinnest\n\/\/ constant found.\n\/\/ The returned value will be the constant at which to start the search.\n\/\/ If no constant is found, then the returned value is the undefnied\n\/\/ handle.\n\/\/\nHandle\nDefaultPatternMatchCB::find_starter(Handle h, size_t& depth,\n Handle& start, size_t& width)\n{\n\n\t\/\/ If its a node, then we are done. Don't modiy either depth or\n\t\/\/ start.\n\tType t = h->getType();\n\tif (classserver().isNode(t)) {\n\t\tif (t != VARIABLE_NODE) {\n\t\t\twidth = h->getIncomingSetSize();\n\t\t\treturn h;\n\t\t}\n\t\treturn Handle::UNDEFINED;\n\t}\n\n\tsize_t deepest = depth;\n\tstart = Handle::UNDEFINED;\n\tHandle hdeepest(Handle::UNDEFINED);\n\tsize_t thinnest = SIZE_MAX;\n\n\t\/\/ Iterate over all the handles in the outgoing set.\n\t\/\/ Find the deepest one that contains a constant, and start\n\t\/\/ the search there. If there are two at the same depth,\n\t\/\/ then start with the skinnier one.\n\tLinkPtr ll(LinkCast(h));\n\tconst std::vector<Handle> &vh = ll->getOutgoingSet();\n\tfor (size_t i = 0; i < vh.size(); i++) {\n\n\t\tsize_t brdepth = depth + 1;\n\t\tsize_t brwid = SIZE_MAX;\n\t\tHandle sbr(h);\n\t\tHandle s(find_starter(vh[i], brdepth, sbr, brwid));\n\n\t\tif (s != Handle::UNDEFINED\n\t\t and (brwid < thinnest\n\t\t or (brwid == thinnest and deepest < brdepth)))\n\t\t{\n\t\t\tdeepest = brdepth;\n\t\t\thdeepest = s;\n\t\t\tstart = sbr;\n\t\t\tthinnest = brwid;\n\t\t}\n\n\t}\n\tdepth = deepest;\n\twidth = thinnest;\n\treturn hdeepest;\n}\n\n\/**\n * Search for solutions\/groundings over all of the AtomSpace, using\n * some \"reasonable\" assumptions for what might be searched for. Or,\n * to put it bluntly, this search method *might* miss some possible\n * solutions, for certain \"unusual\" search types. The trade-off is\n * that this search algo should really be quite fast for \"normal\"\n * search types.\n *\n * This search algo makes the following (important) assumptions:\n *\n * 1) If there are no variables in the clauses, then this will search\n * over all links which have the same type as the first clause.\n * Clearly, this kind of search can fail if link_match() callback\n * was prepared to accept other link types as well.\n *\n * 2) If there are variables, then the search will begin at the first\n * non-variable node in the first clause. The search will proceed\n * by exploring the entire incoming-set for this node, but no farther.\n * If the node_match() callback is willing to accept a broader range\n * of node matches, esp for this initial node, then many possible\n * solutions will be missed.\n *\n * 3) If the clauses consist entirely of variables, the same search\n * as described in 1) will be performed.\n *\n * The above describes the limits to the \"typical\" search that this\n * algo can do well. In particular, if the constraint of 2) can be met,\n * then the search can be quite rapid, since incoming sets are often\n * quite small; and assumption 2) limits the search to \"nearby\",\n * connected atoms.\n *\n * Note that the default implementation of node_match() and link_match()\n * in this class does satisfy both 1) and 2), so this algo will work\n * correctly if these two methods are not overloaded.\n *\n * If you overload node_match(), and do so in a way that breaks\n * assumption 2), then you will scratch your head, thinking\n * \"why did my search fail to find this obvious solution?\" The answer\n * will be for you to create a new search algo, in a new class, that\n * overloads this one, and does what you want it to. This class should\n * probably *not* be modified, since it is quite efficient for the\n * \"normal\" case.\n *\/\nvoid DefaultPatternMatchCB::perform_search(PatternMatchEngine *pme,\n std::set<Handle> &vars,\n std::vector<Handle> &clauses,\n std::vector<Handle> &negations)\n{\n\t\/\/ In principle, we could start our search at some node, any node,\n\t\/\/ that is not a variable. In practice, the search begins by\n\t\/\/ iterating over the incoming set of the node, and so, if it is\n\t\/\/ large, a huge amount of effort might be wasted exploring\n\t\/\/ dead-ends. Thus, it pays off to start the search on the\n\t\/\/ node with the smallest (\"narrowest\" or \"thinnest\") incoming set\n\t\/\/ possible. Thus, we look at all the clauses, to find the\n\t\/\/ \"thinnest\" one.\n\t\/\/\n\t\/\/ Note also: the user is allowed to specify patterns that have\n\t\/\/ no constants in them at all. In this case, the search is\n\t\/\/ performed by looping over all links of the given types.\n\n\tsize_t thinnest = SIZE_MAX;\n\tsize_t deepest = 0;\n\tsize_t bestclause = 0;\n\tHandle best_start(Handle::UNDEFINED);\n\t_starter_pred = Handle::UNDEFINED;\n\n\tsize_t nc = clauses.size();\n\tfor (size_t i=0; i < nc; i++) {\n\t\tHandle h(clauses[i]);\n\t\tsize_t depth = 0;\n\t\tsize_t width = SIZE_MAX;\n\t\tHandle pred(Handle::UNDEFINED);\n\t\tHandle start(find_starter(h, depth, pred, width));\n\t\tif (start != Handle::UNDEFINED\n\t\t and (width < thinnest\n\t\t or (width == thinnest and depth > deepest)))\n\t\t{\n\t\t\tthinnest = width;\n\t\t\tdeepest = depth;\n\t\t\tbestclause = i;\n\t\t\tbest_start = start;\n\t\t\t_starter_pred = pred;\n\t\t}\n\t}\n\n\tif ((Handle::UNDEFINED != best_start) && (0 != vars.size()))\n\t{\n\t\t_root = clauses[bestclause];\n\t\tdbgprt(\"Search start node: %s\\n\", best_start->toShortString().c_str());\n\t\tdbgprt(\"Start pred is: %s\\n\", _starter_pred->toShortString().c_str());\n\t\tIncomingSet iset = get_incoming_set(best_start);\n\t\tsize_t sz = iset.size();\n\t\tfor (size_t i = 0; i < sz; i++) {\n\t\t\tHandle h(iset[i]);\n\t\t\tdbgprt(\"xxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxx\\n\");\n\t\t\tdbgprt(\"Loop candidate: %s\\n\", h->toShortString().c_str());\n\t\t\tbool rc = pme->do_candidate(_root, _starter_pred, h);\n\t\t\tif (rc) break;\n\t\t}\n\t}\n\telse\n\t{\n\t\t_root = clauses[0];\n\t\t_starter_pred = _root;\n\n\t\tdbgprt(\"Start pred is: %s\\n\", _starter_pred->toShortString().c_str());\n\t\t\/\/ Get type of the first item in the predicate list.\n\t\tType ptype = _root->getType();\n\n\t\t\/\/ Plunge into the deep end - start looking at all viable\n\t\t\/\/ candidates in the AtomSpace.\n\n\t\t\/\/ XXX TODO -- as a performance optimization, we should try all\n\t\t\/\/ the different clauses, and find the one with the smallest number\n\t\t\/\/ of atoms of that type, or otherwise try to find a small (\"thin\")\n\t\t\/\/ incoming set to search over.\n\t\tstd::list<Handle> handle_set;\n\t\t_atom_space->getHandlesByType(back_inserter(handle_set), ptype);\n\t\tstd::list<Handle>::iterator i = handle_set.begin();\n\t\tstd::list<Handle>::iterator iend = handle_set.end();\n\t\tfor (; i != iend; i++)\n\t\t{\n\t\t\tHandle h(*i);\n\t\t\tdbgprt(\"xxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxx\\n\");\n\t\t\tdbgprt(\"Loop candidate: %s\\n\", h->toShortString().c_str());\n\t\t\tbool rc = pme->do_candidate(_root, _starter_pred, h);\n\t\t\tif (rc) break;\n\t\t}\n\t}\n}\n\n\/* ======================================================== *\/\n\nbool DefaultPatternMatchCB::virtual_link_match(LinkPtr& lvirt, Handle& gargs)\n{\n\t\/\/ At this time, we expect all virutal links to be\n\t\/\/ EvaluationLinks having the structure\n\t\/\/\n\t\/\/ EvaluationLink\n\t\/\/ GroundedPredicateNode \"scm:blah\"\n\t\/\/ ListLink\n\t\/\/ Arg1Atom\n\t\/\/ Arg2Atom\n\t\/\/\n\t\/\/ XXX TODO s discussed on the mailing list, we should perhaps first\n\t\/\/ see if the following can be found in the atomspace:\n\t\/\/\n\t\/\/ EvaluationLink\n\t\/\/ PredicateNode \"blah\" ; not Grounded any more, and scm: stripped\n\t\/\/ ListLink\n\t\/\/ Arg1Atom\n\t\/\/ Arg2Atom\n\t\/\/\n\t\/\/ If it does, we should declare a match. If not, only then run the\n\t\/\/ do_evaluate callback. Alternately, perhaps the \n\t\/\/ EvaluationLink::do_evaluate() method should do this ??? Its a toss-up.\n\n\tHandle schema(lvirt->getOutgoingAtom(0));\n\tbool relation_holds = EvaluationLink::do_evaluate(_atom_space, schema, gargs);\n\n\t\/\/ Make a weak effort to clean up bad groundings. gargs is a\n\t\/\/ a grounded ListLink. We should probably look at it's children;\n\t\/\/ if any of those also do not have any incoming links, they too\n\t\/\/ should be removed. XXX FIXME.\n\t_atom_space->purgeAtom(gargs, false);\n\n\treturn not relation_holds;\n}\n\n\/* ===================== END OF FILE ===================== *\/\n<commit_msg>spell error fix<commit_after>\/*\n * DefaultPatternMatchCB.cc\n *\n * Copyright (C) 2008,2009,2014 Linas Vepstas\n *\n * Author: Linas Vepstas <linasvepstas@gmail.com> February 2008\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\/execution\/EvaluationLink.h>\n\n#include \"DefaultPatternMatchCB.h\"\n#include \"PatternMatchEngine.h\"\n\nusing namespace opencog;\n\n\/\/ #define DEBUG 1\n#if DEBUG\n #define dbgprt(f, varargs...) printf(f, ##varargs)\n#else\n #define dbgprt(f, varargs...)\n#endif\n\n\/* ======================================================== *\/\n\n\/\/ Find a good place to start the search.\n\/\/\n\/\/ The handle h points to a clause. In principle, it is enough to\n\/\/ simply find a constant in the clause, and just start there. In\n\/\/ practice, this can be an awful way to do things. So, for example,\n\/\/ most \"typical\" clauses will be of the form\n\/\/\n\/\/ EvaluationLink\n\/\/ PredicateNode \"blah\"\n\/\/ ListLink\n\/\/ VariableNode $var\n\/\/ ConceptNode \"item\"\n\/\/\n\/\/ Typically, the incoming set to \"blah\" will be huge, so starting the\n\/\/ search there would be a poor choice. Typically, the incoming set to\n\/\/ \"item\" will be much smaller, and so makes a better choice. The code\n\/\/ below tries to pass over \"blah\" and pick \"item\" instead. It does so\n\/\/ by comparing the size of the incoming sets of the two constants, and\n\/\/ picking the one with the smaller (\"thinner\") incoming set. Note that\n\/\/ this is a form of \"greedy\" search.\n\/\/\n\/\/ Note that the algo performs a full-depth search to find this. That's\n\/\/ OK, because typeical clauses are never deep.\n\/\/\n\/\/ Note that the size of the incoming set really is a better measure,\n\/\/ and not the depth. So, for example, if \"item\" has a huge incoming\n\/\/ set, but \"blah\" does not, then \"blah\" is a much better place to\n\/\/ start.\n\/\/\n\/\/ size_t& depth will be set to the depth of the thinnest constant found.\n\/\/ Handle& start will be set to the link containing that constant.\n\/\/ size_t& width will be set to the incoming-set size of the thinnest\n\/\/ constant found.\n\/\/ The returned value will be the constant at which to start the search.\n\/\/ If no constant is found, then the returned value is the undefnied\n\/\/ handle.\n\/\/\nHandle\nDefaultPatternMatchCB::find_starter(Handle h, size_t& depth,\n Handle& start, size_t& width)\n{\n\n\t\/\/ If its a node, then we are done. Don't modiy either depth or\n\t\/\/ start.\n\tType t = h->getType();\n\tif (classserver().isNode(t)) {\n\t\tif (t != VARIABLE_NODE) {\n\t\t\twidth = h->getIncomingSetSize();\n\t\t\treturn h;\n\t\t}\n\t\treturn Handle::UNDEFINED;\n\t}\n\n\tsize_t deepest = depth;\n\tstart = Handle::UNDEFINED;\n\tHandle hdeepest(Handle::UNDEFINED);\n\tsize_t thinnest = SIZE_MAX;\n\n\t\/\/ Iterate over all the handles in the outgoing set.\n\t\/\/ Find the deepest one that contains a constant, and start\n\t\/\/ the search there. If there are two at the same depth,\n\t\/\/ then start with the skinnier one.\n\tLinkPtr ll(LinkCast(h));\n\tconst std::vector<Handle> &vh = ll->getOutgoingSet();\n\tfor (size_t i = 0; i < vh.size(); i++) {\n\n\t\tsize_t brdepth = depth + 1;\n\t\tsize_t brwid = SIZE_MAX;\n\t\tHandle sbr(h);\n\t\tHandle s(find_starter(vh[i], brdepth, sbr, brwid));\n\n\t\tif (s != Handle::UNDEFINED\n\t\t and (brwid < thinnest\n\t\t or (brwid == thinnest and deepest < brdepth)))\n\t\t{\n\t\t\tdeepest = brdepth;\n\t\t\thdeepest = s;\n\t\t\tstart = sbr;\n\t\t\tthinnest = brwid;\n\t\t}\n\n\t}\n\tdepth = deepest;\n\twidth = thinnest;\n\treturn hdeepest;\n}\n\n\/**\n * Search for solutions\/groundings over all of the AtomSpace, using\n * some \"reasonable\" assumptions for what might be searched for. Or,\n * to put it bluntly, this search method *might* miss some possible\n * solutions, for certain \"unusual\" search types. The trade-off is\n * that this search algo should really be quite fast for \"normal\"\n * search types.\n *\n * This search algo makes the following (important) assumptions:\n *\n * 1) If there are no variables in the clauses, then this will search\n * over all links which have the same type as the first clause.\n * Clearly, this kind of search can fail if link_match() callback\n * was prepared to accept other link types as well.\n *\n * 2) If there are variables, then the search will begin at the first\n * non-variable node in the first clause. The search will proceed\n * by exploring the entire incoming-set for this node, but no farther.\n * If the node_match() callback is willing to accept a broader range\n * of node matches, esp for this initial node, then many possible\n * solutions will be missed.\n *\n * 3) If the clauses consist entirely of variables, the same search\n * as described in 1) will be performed.\n *\n * The above describes the limits to the \"typical\" search that this\n * algo can do well. In particular, if the constraint of 2) can be met,\n * then the search can be quite rapid, since incoming sets are often\n * quite small; and assumption 2) limits the search to \"nearby\",\n * connected atoms.\n *\n * Note that the default implementation of node_match() and link_match()\n * in this class does satisfy both 1) and 2), so this algo will work\n * correctly if these two methods are not overloaded.\n *\n * If you overload node_match(), and do so in a way that breaks\n * assumption 2), then you will scratch your head, thinking\n * \"why did my search fail to find this obvious solution?\" The answer\n * will be for you to create a new search algo, in a new class, that\n * overloads this one, and does what you want it to. This class should\n * probably *not* be modified, since it is quite efficient for the\n * \"normal\" case.\n *\/\nvoid DefaultPatternMatchCB::perform_search(PatternMatchEngine *pme,\n std::set<Handle> &vars,\n std::vector<Handle> &clauses,\n std::vector<Handle> &negations)\n{\n\t\/\/ In principle, we could start our search at some node, any node,\n\t\/\/ that is not a variable. In practice, the search begins by\n\t\/\/ iterating over the incoming set of the node, and so, if it is\n\t\/\/ large, a huge amount of effort might be wasted exploring\n\t\/\/ dead-ends. Thus, it pays off to start the search on the\n\t\/\/ node with the smallest (\"narrowest\" or \"thinnest\") incoming set\n\t\/\/ possible. Thus, we look at all the clauses, to find the\n\t\/\/ \"thinnest\" one.\n\t\/\/\n\t\/\/ Note also: the user is allowed to specify patterns that have\n\t\/\/ no constants in them at all. In this case, the search is\n\t\/\/ performed by looping over all links of the given types.\n\n\tsize_t thinnest = SIZE_MAX;\n\tsize_t deepest = 0;\n\tsize_t bestclause = 0;\n\tHandle best_start(Handle::UNDEFINED);\n\t_starter_pred = Handle::UNDEFINED;\n\n\tsize_t nc = clauses.size();\n\tfor (size_t i=0; i < nc; i++) {\n\t\tHandle h(clauses[i]);\n\t\tsize_t depth = 0;\n\t\tsize_t width = SIZE_MAX;\n\t\tHandle pred(Handle::UNDEFINED);\n\t\tHandle start(find_starter(h, depth, pred, width));\n\t\tif (start != Handle::UNDEFINED\n\t\t and (width < thinnest\n\t\t or (width == thinnest and depth > deepest)))\n\t\t{\n\t\t\tthinnest = width;\n\t\t\tdeepest = depth;\n\t\t\tbestclause = i;\n\t\t\tbest_start = start;\n\t\t\t_starter_pred = pred;\n\t\t}\n\t}\n\n\tif ((Handle::UNDEFINED != best_start) && (0 != vars.size()))\n\t{\n\t\t_root = clauses[bestclause];\n\t\tdbgprt(\"Search start node: %s\\n\", best_start->toShortString().c_str());\n\t\tdbgprt(\"Start pred is: %s\\n\", _starter_pred->toShortString().c_str());\n\t\tIncomingSet iset = get_incoming_set(best_start);\n\t\tsize_t sz = iset.size();\n\t\tfor (size_t i = 0; i < sz; i++) {\n\t\t\tHandle h(iset[i]);\n\t\t\tdbgprt(\"xxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxx\\n\");\n\t\t\tdbgprt(\"Loop candidate: %s\\n\", h->toShortString().c_str());\n\t\t\tbool rc = pme->do_candidate(_root, _starter_pred, h);\n\t\t\tif (rc) break;\n\t\t}\n\t}\n\telse\n\t{\n\t\t_root = clauses[0];\n\t\t_starter_pred = _root;\n\n\t\tdbgprt(\"Start pred is: %s\\n\", _starter_pred->toShortString().c_str());\n\t\t\/\/ Get type of the first item in the predicate list.\n\t\tType ptype = _root->getType();\n\n\t\t\/\/ Plunge into the deep end - start looking at all viable\n\t\t\/\/ candidates in the AtomSpace.\n\n\t\t\/\/ XXX TODO -- as a performance optimization, we should try all\n\t\t\/\/ the different clauses, and find the one with the smallest number\n\t\t\/\/ of atoms of that type, or otherwise try to find a small (\"thin\")\n\t\t\/\/ incoming set to search over.\n\t\tstd::list<Handle> handle_set;\n\t\t_atom_space->getHandlesByType(back_inserter(handle_set), ptype);\n\t\tstd::list<Handle>::iterator i = handle_set.begin();\n\t\tstd::list<Handle>::iterator iend = handle_set.end();\n\t\tfor (; i != iend; i++)\n\t\t{\n\t\t\tHandle h(*i);\n\t\t\tdbgprt(\"xxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxx\\n\");\n\t\t\tdbgprt(\"Loop candidate: %s\\n\", h->toShortString().c_str());\n\t\t\tbool rc = pme->do_candidate(_root, _starter_pred, h);\n\t\t\tif (rc) break;\n\t\t}\n\t}\n}\n\n\/* ======================================================== *\/\n\nbool DefaultPatternMatchCB::virtual_link_match(LinkPtr& lvirt, Handle& gargs)\n{\n\t\/\/ At this time, we expect all virutal links to be\n\t\/\/ EvaluationLinks having the structure\n\t\/\/\n\t\/\/ EvaluationLink\n\t\/\/ GroundedPredicateNode \"scm:blah\"\n\t\/\/ ListLink\n\t\/\/ Arg1Atom\n\t\/\/ Arg2Atom\n\t\/\/\n\t\/\/ XXX TODO s discussed on the mailing list, we should perhaps first\n\t\/\/ see if the following can be found in the atomspace:\n\t\/\/\n\t\/\/ EvaluationLink\n\t\/\/ PredicateNode \"blah\" ; not Grounded any more, and scm: stripped\n\t\/\/ ListLink\n\t\/\/ Arg1Atom\n\t\/\/ Arg2Atom\n\t\/\/\n\t\/\/ If it does, we should declare a match. If not, only then run the\n\t\/\/ do_evaluate callback. Alternately, perhaps the \n\t\/\/ EvaluationLink::do_evaluate() method should do this ??? Its a toss-up.\n\n\tHandle schema(lvirt->getOutgoingAtom(0));\n\tbool relation_holds = EvaluationLink::do_evaluate(_atom_space, schema, gargs);\n\n\t\/\/ Make a weak effort to clean up bad groundings. gargs is a\n\t\/\/ a grounded ListLink. We should probably look at it's children;\n\t\/\/ if any of those also do not have any incoming links, they too\n\t\/\/ should be removed. XXX FIXME.\n\t_atom_space->purgeAtom(gargs, false);\n\n\treturn not relation_holds;\n}\n\n\/* ===================== END OF FILE ===================== *\/\n<|endoftext|>"} {"text":"<commit_before>\/*************************************************************************\n *\n * OpenOffice.org - a multi-platform office productivity suite\n *\n * $RCSfile: AIndexes.hxx,v $\n *\n * $Revision: 1.9 $\n *\n * last change: $Author: obo $ $Date: 2006-07-10 14:34:14 $\n *\n * The Contents of this file are made available subject to\n * the terms of GNU Lesser General Public License Version 2.1.\n *\n *\n * GNU Lesser General Public License Version 2.1\n * =============================================\n * Copyright 2005 by Sun Microsystems, Inc.\n * 901 San Antonio Road, Palo Alto, CA 94303, USA\n *\n * This library is free software; you can redistribute it and\/or\n * modify it under the terms of the GNU Lesser General Public\n * License version 2.1, as published by the Free Software Foundation.\n *\n * This library is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU\n * Lesser General Public License for more details.\n *\n * You should have received a copy of the GNU Lesser General Public\n * License along with this library; if not, write to the Free Software\n * Foundation, Inc., 59 Temple Place, Suite 330, Boston,\n * MA 02111-1307 USA\n *\n ************************************************************************\/\n#ifndef _CONNECTIVITY_ADO_INDEXES_HXX_\n#define _CONNECTIVITY_ADO_INDEXES_HXX_\n\n#ifndef _CONNECTIVITY_SDBCX_COLLECTION_HXX_\n#include \"connectivity\/sdbcx\/VCollection.hxx\"\n#endif\n#ifndef _COM_SUN_STAR_SDBC_XDATABASEMETADATA_HPP_\n#include <com\/sun\/star\/sdbc\/XDatabaseMetaData.hpp>\n#endif\n#ifndef _CONNECTIVITY_ADO_AWRAPADOX_HXX_\n#include \"ado\/Awrapadox.hxx\"\n#endif\n\nnamespace connectivity\n{\n namespace ado\n {\n class OConnection;\n class OIndexes : public sdbcx::OCollection\n {\n WpADOIndexes m_aCollection;\n OConnection* m_pConnection;\n protected:\n virtual sdbcx::ObjectType createObject(const ::rtl::OUString& _rName);\n virtual void impl_refresh() throw(::com::sun::star::uno::RuntimeException);\n virtual ::com::sun::star::uno::Reference< ::com::sun::star::beans::XPropertySet > createDescriptor();\n virtual sdbcx::ObjectType appendObject( const ::rtl::OUString& _rForName, const ::com::sun::star::uno::Reference< ::com::sun::star::beans::XPropertySet >& descriptor );\n virtual void dropObject(sal_Int32 _nPos,const ::rtl::OUString _sElementName);\n public:\n OIndexes(::cppu::OWeakObject& _rParent,\n ::osl::Mutex& _rMutex,\n const TStringVector &_rVector,\n const WpADOIndexes& _rCollection,\n sal_Bool _bCase,\n OConnection* _pConnection)\n : sdbcx::OCollection(_rParent,_bCase,_rMutex,_rVector)\n , m_aCollection(_rCollection)\n , m_pConnection(_pConnection)\n {\n }\n };\n }\n}\n\n#endif \/\/ _CONNECTIVITY_ADO_INDEXES_HXX_\n\n<commit_msg>INTEGRATION: CWS changefileheader (1.9.262); FILE MERGED 2008\/04\/01 10:53:20 thb 1.9.262.2: #i85898# Stripping all external header guards 2008\/03\/28 15:24:11 rt 1.9.262.1: #i87441# Change license header to LPGL v3.<commit_after>\/*************************************************************************\n *\n * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.\n *\n * Copyright 2008 by Sun Microsystems, Inc.\n *\n * OpenOffice.org - a multi-platform office productivity suite\n *\n * $RCSfile: AIndexes.hxx,v $\n * $Revision: 1.10 $\n *\n * This file is part of OpenOffice.org.\n *\n * OpenOffice.org is free software: you can redistribute it and\/or modify\n * it under the terms of the GNU Lesser General Public License version 3\n * only, as published by the Free Software Foundation.\n *\n * OpenOffice.org is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the\n * GNU Lesser General Public License version 3 for more details\n * (a copy is included in the LICENSE file that accompanied this code).\n *\n * You should have received a copy of the GNU Lesser General Public License\n * version 3 along with OpenOffice.org. If not, see\n * <http:\/\/www.openoffice.org\/license.html>\n * for a copy of the LGPLv3 License.\n *\n ************************************************************************\/\n#ifndef _CONNECTIVITY_ADO_INDEXES_HXX_\n#define _CONNECTIVITY_ADO_INDEXES_HXX_\n\n#include \"connectivity\/sdbcx\/VCollection.hxx\"\n#include <com\/sun\/star\/sdbc\/XDatabaseMetaData.hpp>\n#include \"ado\/Awrapadox.hxx\"\n\nnamespace connectivity\n{\n namespace ado\n {\n class OConnection;\n class OIndexes : public sdbcx::OCollection\n {\n WpADOIndexes m_aCollection;\n OConnection* m_pConnection;\n protected:\n virtual sdbcx::ObjectType createObject(const ::rtl::OUString& _rName);\n virtual void impl_refresh() throw(::com::sun::star::uno::RuntimeException);\n virtual ::com::sun::star::uno::Reference< ::com::sun::star::beans::XPropertySet > createDescriptor();\n virtual sdbcx::ObjectType appendObject( const ::rtl::OUString& _rForName, const ::com::sun::star::uno::Reference< ::com::sun::star::beans::XPropertySet >& descriptor );\n virtual void dropObject(sal_Int32 _nPos,const ::rtl::OUString _sElementName);\n public:\n OIndexes(::cppu::OWeakObject& _rParent,\n ::osl::Mutex& _rMutex,\n const TStringVector &_rVector,\n const WpADOIndexes& _rCollection,\n sal_Bool _bCase,\n OConnection* _pConnection)\n : sdbcx::OCollection(_rParent,_bCase,_rMutex,_rVector)\n , m_aCollection(_rCollection)\n , m_pConnection(_pConnection)\n {\n }\n };\n }\n}\n\n#endif \/\/ _CONNECTIVITY_ADO_INDEXES_HXX_\n\n<|endoftext|>"} {"text":"<commit_before>#pragma once\n\n\/\/\n\/\/ Retains no ownership over the object\n\/\/\ntemplate <class T>\nstruct Out {\n explicit Out(T& obj) : _obj(obj) {\n }\n T& operator*() {\n return _obj;\n }\n T* operator->() {\n return &_obj;\n }\n\n private:\n T& _obj;\n};\n\ntemplate <class T>\nOut<T> out(T& obj) {\n return Out<T>(obj);\n}<commit_msg>Add hackish vector-out TODO:TMP<commit_after>#pragma once\n\n#include <type_traits>\n#include <vector>\n\n\/\/\n\/\/ Retains no ownership over the object\n\/\/\ntemplate <class T>\nstruct Out {\n explicit Out(T& obj) : _obj(obj) {\n }\n T& operator*() {\n return _obj;\n }\n T* operator->() {\n return &_obj;\n }\n\n private:\n T& _obj;\n};\n\ntemplate <class T>\nOut<T> out(T& obj) {\n return Out<T>(obj);\n}\n\n\/\/\n\/\/ Retains no ownership over the object\n\/\/\ntemplate <typename T>\nstruct Vout {\n explicit Vout(T& obj) : _obj(obj) {\n }\n\n T& operator*() {\n return _obj;\n }\n\n T* operator->() {\n return &_obj;\n }\n\n const T& operator*() const {\n return _obj;\n }\n\n typename T::value_type& operator[](int i) {\n return _obj[i];\n }\n\n private:\n T& _obj;\n};\n\ntemplate <typename T>\nVout<T> vout(T& obj) {\n return Vout<T>(obj);\n}<|endoftext|>"} {"text":"<commit_before>\/\/ Chapter 26, exercise 11: time the sum example from 26.6 with m being square\n\/\/ matrices with dimensions 100, 10,000, 1,000,000 and 10,000,000. Use random\n\/\/ elements in the range [-10:10). Rewrite the calculation of v to use a more\n\/\/ efficient (not O(N^2)) algorithm and compare timings.\n\/\/\n\/\/ Dimensions way too big for stupid methods (takes forever) and memory (matrix\n\/\/ of doubles with 100,000 elements per dimensions: 80 GB!), hence reduced\n\/\/ number of elements and allocated on heap\n\n#include<ctime>\n#include<iostream>\n#include<exception>\n#include<vector>\n#include<random>\n\n#include \"chapter24\/Matrix.h\"\n#include \"chapter24\/MatrixIO.h\"\n\nusing namespace std;\nusing namespace Numeric_lib;\n\n\/\/------------------------------------------------------------------------------\n\ninline int randint(int max) { return rand()%max; }\n\ninline int randint(int min, int max) { return randint(max-min)+min; }\n\n\/\/------------------------------------------------------------------------------\n\n\/\/ sum of elements in m[n]\ndouble row_sum(Matrix<double,2>* m, int n)\n{\n double sum = 0;\n for (Index i = 0; i<m->dim2(); ++i)\n sum += (*m)(n,i);\n return sum;\n}\n\n\/\/------------------------------------------------------------------------------\n\n\/\/ sum of elements in m[0:n)\ndouble row_accum(Matrix<double,2>* m, int n)\n{\n double s = 0;\n for (Index i = 0; i<n; ++i)\n s += row_sum(m,i);\n return s;\n}\n\n\/\/------------------------------------------------------------------------------\n\n\/\/ creates random nxn-matrix with elements in range [-10:10)\nMatrix<double,2>* random_matrix(int n)\n{\n Matrix<double,2>* m = new Matrix<double,2>(n,n);\n for (Index i = 0; i<m->dim1(); ++i)\n for (Index j = 0; j<m->dim2(); ++j)\n (*m)(i,j) = randint(-10,10);\n return m;\n}\n\n\/\/------------------------------------------------------------------------------\n\nint main()\ntry {\n srand(time(0));\n vector<int> dims = {100, 200, 400, 800, 1600, 3200};\n\n cout << \"With the dumb method:\\n\";\n \/\/ scales about with the square of the number of elements\n for (int i = 0; i<dims.size(); ++i) {\n clock_t t1 = clock();\n if (t1 == clock_t(-1))\n throw exception(\"sorry, no clock\");\n Matrix<double,2>* m = random_matrix(dims[i]);\n vector<double> v;\n for (Index idx = 0; idx<m->dim1(); ++idx)\n v.push_back(row_accum(m,idx+1));\n clock_t t2 = clock();\n if (t2 == clock_t(-1))\n throw exception(\"sorry, clock overflow\");\n cout << \"Size \" << setw(8) << dims[i] << \": \"\n << double(t2-t1)\/CLOCKS_PER_SEC << \" seconds\\n\";\n delete m;\n }\n\n dims.push_back(6400);\n dims.push_back(12800);\n\n cout << \"\\nWith the smart method:\\n\";\n \/\/ scales linearly with the number of elements\n for (int i = 0; i<dims.size(); ++i) {\n clock_t t1 = clock();\n if (t1 == clock_t(-1))\n throw exception(\"sorry, no clock\");\n Matrix<double,2>* m = random_matrix(dims[i]);\n vector<double> v;\n double sum = 0;\n for (Index idx = 0; idx<m->dim1(); ++idx) {\n sum += row_sum(m,idx);\n v.push_back(sum);\n }\n clock_t t2 = clock();\n if (t2 == clock_t(-1))\n throw exception(\"sorry, clock overflow\");\n cout << \"Size \" << setw(8) << dims[i] << \": \"\n << double(t2-t1)\/CLOCKS_PER_SEC << \" seconds\\n\";\n delete m;\n }\n\n}\ncatch (exception& e) {\n cerr << e.what() << endl;\n}\ncatch (...) {\n cerr << \"exception \\n\";\n}\n\n\/\/------------------------------------------------------------------------------\n<commit_msg>Allocation doesn't matter, matrix data is anyway on the heap<commit_after>\/\/ Chapter 26, exercise 11: time the sum example from 26.6 with m being square\n\/\/ matrices with dimensions 100, 10,000, 1,000,000 and 10,000,000. Use random\n\/\/ elements in the range [-10:10). Rewrite the calculation of v to use a more\n\/\/ efficient (not O(N^2)) algorithm and compare timings.\n\/\/\n\/\/ Dimensions way too big for stupid methods (takes forever) and memory (matrix\n\/\/ of doubles with 100,000 elements per dimensions: 80 GB!), hence reduced\n\/\/ number of elements\n\/\/\n\/\/ Also worth to mention: the version in the book passes the matrices by value,\n\/\/ leading to a lot of copies and unusably slow performance\n\n#include<ctime>\n#include<iostream>\n#include<exception>\n#include<vector>\n#include<random>\n\n#include \"chapter24\/Matrix.h\"\n#include \"chapter24\/MatrixIO.h\"\n\nusing namespace std;\nusing namespace Numeric_lib;\n\n\/\/------------------------------------------------------------------------------\n\ninline int randint(int max) { return rand()%max; }\n\ninline int randint(int min, int max) { return randint(max-min)+min; }\n\n\/\/------------------------------------------------------------------------------\n\n\/\/ sum of elements in m[n]\ndouble row_sum(const Matrix<double,2>& m, int n)\n{\n double sum = 0;\n for (Index i = 0; i<m.dim2(); ++i)\n sum += m(n,i);\n return sum;\n}\n\n\/\/------------------------------------------------------------------------------\n\n\/\/ sum of elements in m[0:n)\ndouble row_accum(const Matrix<double,2>& m, int n)\n{\n double s = 0;\n for (Index i = 0; i<n; ++i)\n s += row_sum(m,i);\n return s;\n}\n\n\/\/------------------------------------------------------------------------------\n\n\/\/ creates random nxn-matrix with elements in range [-10:10)\nMatrix<double,2> random_matrix(int n)\n{\n Matrix<double,2> m(n,n);\n for (Index i = 0; i<m.dim1(); ++i)\n for (Index j = 0; j<m.dim2(); ++j)\n m(i,j) = randint(-10,10);\n return m;\n}\n\n\/\/------------------------------------------------------------------------------\n\nint main()\ntry {\n srand(time(0));\n vector<int> dims = {100, 200, 400, 800, 1600, 3200};\n\n cout << \"With the dumb method:\\n\";\n \/\/ scales about with the square of the number of elements\n for (int i = 0; i<dims.size(); ++i) {\n clock_t t1 = clock();\n if (t1 == clock_t(-1))\n throw exception(\"sorry, no clock\");\n Matrix<double,2> m = random_matrix(dims[i]);\n vector<double> v;\n for (Index idx = 0; idx<m.dim1(); ++idx)\n v.push_back(row_accum(m,idx+1));\n clock_t t2 = clock();\n if (t2 == clock_t(-1))\n throw exception(\"sorry, clock overflow\");\n cout << \"Size \" << setw(8) << dims[i] << \": \"\n << double(t2-t1)\/CLOCKS_PER_SEC << \" seconds\\n\";\n }\n\n dims.push_back(6400);\n dims.push_back(12800);\n\n cout << \"\\nWith the smart method:\\n\";\n \/\/ scales linearly with the number of elements\n for (int i = 0; i<dims.size(); ++i) {\n clock_t t1 = clock();\n if (t1 == clock_t(-1))\n throw exception(\"sorry, no clock\");\n Matrix<double,2> m = random_matrix(dims[i]);\n vector<double> v;\n double sum = 0;\n for (Index idx = 0; idx<m.dim1(); ++idx) {\n sum += row_sum(m,idx);\n v.push_back(sum);\n }\n clock_t t2 = clock();\n if (t2 == clock_t(-1))\n throw exception(\"sorry, clock overflow\");\n cout << \"Size \" << setw(8) << dims[i] << \": \"\n << double(t2-t1)\/CLOCKS_PER_SEC << \" seconds\\n\";\n }\n\n}\ncatch (exception& e) {\n cerr << e.what() << endl;\n}\ncatch (...) {\n cerr << \"exception \\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 (qt-info@nokia.com)\n**\n** This file is part of the Qt Creator.\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** $QT_END_LICENSE$\n**\n****************************************************************************\/\n\n#include \"maemoruncontrol.h\"\n#include \"maemosshthread.h\"\n#include \"maemorunconfiguration.h\"\n\n#include <coreplugin\/icore.h>\n#include <coreplugin\/progressmanager\/progressmanager.h>\n#include <debugger\/debuggermanager.h>\n#include <extensionsystem\/pluginmanager.h>\n#include <projectexplorer\/toolchain.h>\n#include <utils\/qtcassert.h>\n\n#include <QtCore\/QDir>\n#include <QtCore\/QFileInfo>\n#include <QtCore\/QFuture>\n#include <QtCore\/QProcess>\n#include <QtCore\/QStringBuilder>\n\n#include <QtGui\/QMessageBox>\n\nnamespace Qt4ProjectManager {\nnamespace Internal {\n\nusing ProjectExplorer::RunConfiguration;\nusing ProjectExplorer::ToolChain;\n\nAbstractMaemoRunControl::AbstractMaemoRunControl(RunConfiguration *rc)\n : RunControl(rc)\n , m_runConfig(qobject_cast<MaemoRunConfiguration *>(rc))\n , m_devConfig(m_runConfig ? m_runConfig->deviceConfig() : MaemoDeviceConfig())\n{\n}\n\nAbstractMaemoRunControl::~AbstractMaemoRunControl()\n{\n}\n\nvoid AbstractMaemoRunControl::start()\n{\n m_stoppedByUser = false;\n emit started();\n startInitialCleanup();\n}\n\nvoid AbstractMaemoRunControl::startInitialCleanup()\n{\n emit addToOutputWindow(this, tr(\"Cleaning up remote leftovers first ...\"));\n const QStringList appsToKill\n = QStringList() << executableFileName() << QLatin1String(\"gdbserver\");\n killRemoteProcesses(appsToKill, true);\n}\n\nvoid AbstractMaemoRunControl::stop()\n{\n m_stoppedByUser = true;\n if (isCleaning())\n m_initialCleaner->stop();\n else if (isDeploying())\n m_sshDeployer->stop();\n else\n stopInternal();\n}\n\nvoid AbstractMaemoRunControl::handleInitialCleanupFinished()\n{\n if (m_stoppedByUser) {\n emit addToOutputWindow(this, tr(\"Initial cleanup canceled by user.\"));\n emit finished();\n } else if (m_initialCleaner->hasError()) {\n handleError(tr(\"Error running initial cleanup: %1.\")\n .arg(m_initialCleaner->error()));\n emit finished();\n } else {\n emit addToOutputWindow(this, tr(\"Initial cleanup done.\"));\n startInternal();\n }\n}\n\nvoid AbstractMaemoRunControl::startDeployment(bool forDebugging)\n{\n QTC_ASSERT(m_runConfig, return);\n\n if (!m_devConfig.isValid()) {\n handleError(tr(\"No device configuration set for run configuration.\"));\n emit finished();\n } else if (m_stoppedByUser) {\n emit finished();\n } else {\n m_deployables.clear();\n if (m_runConfig->currentlyNeedsDeployment(m_devConfig.host)) {\n m_deployables.append(Deployable(executableFileName(),\n QFileInfo(executableOnHost()).canonicalPath(),\n &MaemoRunConfiguration::wasDeployed));\n }\n if (forDebugging\n && m_runConfig->debuggingHelpersNeedDeployment(m_devConfig.host)) {\n const QFileInfo &info(m_runConfig->dumperLib());\n m_deployables.append(Deployable(info.fileName(), info.canonicalPath(),\n &MaemoRunConfiguration::debuggingHelpersDeployed));\n }\n\n deploy();\n }\n}\n\nvoid AbstractMaemoRunControl::deploy()\n{\n Core::ICore::instance()->progressManager()\n ->addTask(m_progress.future(), tr(\"Deploying\"),\n QLatin1String(\"Maemo.Deploy\"));\n if (!m_deployables.isEmpty()) {\n QList<SshDeploySpec> deploySpecs;\n QStringList files;\n foreach (const Deployable &deployable, m_deployables) {\n const QString srcFilePath\n = deployable.dir % QDir::separator() % deployable.fileName;\n const QString tgtFilePath\n = remoteDir() % QDir::separator() % deployable.fileName;\n files << srcFilePath;\n deploySpecs << SshDeploySpec(srcFilePath, tgtFilePath);\n }\n emit addToOutputWindow(this, tr(\"Files to deploy: %1.\").arg(files.join(\" \")));\n m_sshDeployer.reset(new MaemoSshDeployer(m_devConfig, deploySpecs));\n connect(m_sshDeployer.data(), SIGNAL(finished()),\n this, SLOT(handleDeployThreadFinished()));\n connect(m_sshDeployer.data(), SIGNAL(fileCopied(QString)),\n this, SLOT(handleFileCopied()));\n m_progress.setProgressRange(0, m_deployables.count());\n m_progress.setProgressValue(0);\n m_progress.reportStarted();\n m_sshDeployer->start();\n } else {\n m_progress.reportFinished();\n startExecution();\n }\n}\n\nvoid AbstractMaemoRunControl::handleFileCopied()\n{\n Deployable deployable = m_deployables.takeFirst();\n (m_runConfig->*deployable.updateTimestamp)(m_devConfig.host);\n m_progress.setProgressValue(m_progress.progressValue() + 1);\n}\n\nbool AbstractMaemoRunControl::isDeploying() const\n{\n return m_sshDeployer && m_sshDeployer->isRunning();\n}\n\nbool AbstractMaemoRunControl::isCleaning() const\n{\n return m_initialCleaner && m_initialCleaner->isRunning();\n}\n\nvoid AbstractMaemoRunControl::startExecution()\n{\n m_sshRunner.reset(new MaemoSshRunner(m_devConfig, remoteCall()));\n connect(m_sshRunner.data(), SIGNAL(finished()),\n this, SLOT(handleRunThreadFinished()));\n connect(m_sshRunner.data(), SIGNAL(remoteOutput(QString)),\n this, SLOT(handleRemoteOutput(QString)));\n emit addToOutputWindow(this, tr(\"Starting remote application.\"));\n m_sshRunner->start();\n}\n\nbool AbstractMaemoRunControl::isRunning() const\n{\n return isDeploying() || (m_sshRunner && m_sshRunner->isRunning());\n}\n\nvoid AbstractMaemoRunControl::stopRunning(bool forDebugging)\n{\n if (m_sshRunner && m_sshRunner->isRunning()) {\n m_sshRunner->stop();\n QStringList apps(executableFileName());\n if (forDebugging)\n apps << QLatin1String(\"gdbserver\");\n killRemoteProcesses(apps, false);\n }\n}\n\nvoid AbstractMaemoRunControl::killRemoteProcesses(const QStringList &apps,\n bool initialCleanup)\n{\n QString niceKill;\n QString brutalKill;\n foreach (const QString &app, apps) {\n niceKill += QString::fromLocal8Bit(\"pkill -x %1;\").arg(app);\n brutalKill += QString::fromLocal8Bit(\"pkill -x -9 %1;\").arg(app);\n }\n const QString remoteCall\n = niceKill + QLatin1String(\"sleep 1; \") + brutalKill;\n QScopedPointer<MaemoSshRunner> &runner\n = initialCleanup ? m_initialCleaner : m_sshStopper;\n runner.reset(new MaemoSshRunner(m_devConfig, remoteCall));\n if (initialCleanup)\n connect(runner.data(), SIGNAL(finished()),\n this, SLOT(handleInitialCleanupFinished()));\n runner->start();\n}\n\nvoid AbstractMaemoRunControl::handleDeployThreadFinished()\n{\n bool cancel;\n if (m_stoppedByUser) {\n emit addToOutputWindow(this, tr(\"Deployment canceled by user.\"));\n cancel = true;\n } else if (m_sshDeployer->hasError()) {\n handleError(tr(\"Deployment failed: %1\").arg(m_sshDeployer->error()));\n cancel = true;\n } else {\n emit addToOutputWindow(this, tr(\"Deployment finished.\"));\n cancel = false;\n }\n\n if (cancel) {\n m_progress.reportCanceled();\n m_progress.reportFinished();\n emit finished();\n } else {\n m_progress.reportFinished();\n startExecution();\n }\n}\n\nvoid AbstractMaemoRunControl::handleRunThreadFinished()\n{\n if (m_stoppedByUser) {\n emit addToOutputWindow(this,\n tr(\"Remote execution canceled due to user request.\"));\n } else if (m_sshRunner->hasError()) {\n emit addToOutputWindow(this, tr(\"Remote process exited with error: %1\")\n .arg(m_sshRunner->error()));\n } else {\n emit addToOutputWindow(this, tr(\"Remote process finished successfully.\"));\n }\n emit finished();\n}\n\nconst QString AbstractMaemoRunControl::executableOnHost() const\n{\n qDebug(\"runconfig->executable: %s\", qPrintable(m_runConfig->executable()));\n return m_runConfig->executable();\n}\n\nconst QString AbstractMaemoRunControl::sshPort() const\n{\n return m_devConfig.type == MaemoDeviceConfig::Physical\n ? QString::number(m_devConfig.sshPort)\n : m_runConfig->simulatorSshPort();\n}\n\nconst QString AbstractMaemoRunControl::executableFileName() const\n{\n return QFileInfo(executableOnHost()).fileName();\n}\n\nconst QString AbstractMaemoRunControl::remoteDir() const\n{\n return homeDirOnDevice(m_devConfig.uname);\n}\n\nconst QStringList AbstractMaemoRunControl::options() const\n{\n const bool usePassword\n = m_devConfig.authentication == MaemoDeviceConfig::Password;\n const QLatin1String opt(\"-o\");\n QStringList optionList;\n if (!usePassword)\n optionList << QLatin1String(\"-i\") << m_devConfig.keyFile;\n return optionList << opt\n << QString::fromLatin1(\"PasswordAuthentication=%1\").\n arg(usePassword ? \"yes\" : \"no\") << opt\n << QString::fromLatin1(\"PubkeyAuthentication=%1\").\n arg(usePassword ? \"no\" : \"yes\") << opt\n << QString::fromLatin1(\"ConnectTimeout=%1\").arg(m_devConfig.timeout)\n << opt << QLatin1String(\"CheckHostIP=no\")\n << opt << QLatin1String(\"StrictHostKeyChecking=no\");\n}\n\nconst QString AbstractMaemoRunControl::executableOnTarget() const\n{\n return QString::fromLocal8Bit(\"%1\/%2\").arg(remoteDir()).\n arg(executableFileName());\n}\n\nconst QString AbstractMaemoRunControl::targetCmdLinePrefix() const\n{\n return QString::fromLocal8Bit(\"chmod u+x %1; source \/etc\/profile; \").\n arg(executableOnTarget());\n}\n\nvoid AbstractMaemoRunControl::handleError(const QString &errString)\n{\n QMessageBox::critical(0, tr(\"Remote Execution Failure\"), errString);\n emit error(this, errString);\n}\n\n\nMaemoRunControl::MaemoRunControl(RunConfiguration *runConfiguration)\n : AbstractMaemoRunControl(runConfiguration)\n{\n}\n\nMaemoRunControl::~MaemoRunControl()\n{\n stop();\n}\n\nvoid MaemoRunControl::startInternal()\n{\n startDeployment(false);\n}\n\nQString MaemoRunControl::remoteCall() const\n{\n return QString::fromLocal8Bit(\"%1 %2 %3\")\n .arg(targetCmdLinePrefix()).arg(executableOnTarget())\n .arg(m_runConfig->arguments().join(\" \"));\n}\n\nvoid MaemoRunControl::stopInternal()\n{\n AbstractMaemoRunControl::stopRunning(false);\n}\n\nvoid MaemoRunControl::handleRemoteOutput(const QString &output)\n{\n emit addToOutputWindowInline(this, output);\n}\n\n\nMaemoDebugRunControl::MaemoDebugRunControl(RunConfiguration *runConfiguration)\n : AbstractMaemoRunControl(runConfiguration)\n , m_debuggerManager(ExtensionSystem::PluginManager::instance()\n ->getObject<Debugger::DebuggerManager>())\n , m_startParams(new Debugger::DebuggerStartParameters)\n{\n QTC_ASSERT(m_debuggerManager != 0, return);\n m_startParams->startMode = Debugger::StartRemote;\n m_startParams->executable = executableOnHost();\n m_startParams->remoteChannel\n = m_devConfig.host % QLatin1Char(':') % gdbServerPort();\n m_startParams->remoteArchitecture = QLatin1String(\"arm\");\n m_startParams->sysRoot = m_runConfig->sysRoot();\n m_startParams->toolChainType = ToolChain::GCC_MAEMO;\n m_startParams->debuggerCommand = m_runConfig->gdbCmd();\n m_startParams->dumperLibrary = m_runConfig->dumperLib();\n m_startParams->remoteDumperLib = QString::fromLocal8Bit(\"%1\/%2\")\n .arg(remoteDir()).arg(QFileInfo(m_runConfig->dumperLib()).fileName());\n\n connect(m_debuggerManager, SIGNAL(debuggingFinished()), this,\n SLOT(debuggingFinished()), Qt::QueuedConnection);\n connect(m_debuggerManager, SIGNAL(applicationOutputAvailable(QString)),\n this, SLOT(debuggerOutput(QString)), Qt::QueuedConnection);\n}\n\nMaemoDebugRunControl::~MaemoDebugRunControl()\n{\n disconnect(SIGNAL(addToOutputWindow(RunControl*,QString)));\n disconnect(SIGNAL(addToOutputWindowInline(RunControl*,QString)));\n stop();\n debuggingFinished();\n}\n\nvoid MaemoDebugRunControl::startInternal()\n{\n m_inferiorPid = -1;\n startDeployment(true);\n}\n\nQString MaemoDebugRunControl::remoteCall() const\n{\n return QString::fromLocal8Bit(\"%1 gdbserver :%2 %3 %4\")\n .arg(targetCmdLinePrefix()).arg(gdbServerPort())\n .arg(executableOnTarget()).arg(m_runConfig->arguments().join(\" \"));\n}\n\nvoid MaemoDebugRunControl::handleRemoteOutput(const QString &output)\n{\n qDebug(\"gdbserver's stderr output: %s\", output.toLatin1().data());\n if (m_inferiorPid != -1)\n return;\n const QString searchString(\"pid = \");\n const int searchStringLength = searchString.length();\n int pidStartPos = output.indexOf(searchString);\n const int pidEndPos = output.indexOf(\"\\n\", pidStartPos + searchStringLength);\n if (pidStartPos == -1 || pidEndPos == -1)\n return; \/\/ gdbserver has not started yet.\n pidStartPos += searchStringLength;\n QString pidString = output.mid(pidStartPos, pidEndPos - pidStartPos);\n qDebug(\"pidString = %s\", pidString.toLatin1().data());\n bool ok;\n const int pid = pidString.toInt(&ok);\n if (!ok) {\n handleError(tr(\"Debugging failed: Could not parse gdbserver output.\"));\n m_debuggerManager->exitDebugger();\n } else {\n m_inferiorPid = pid;\n startDebugging();\n }\n}\n\nvoid MaemoDebugRunControl::startDebugging()\n{\n m_debuggerManager->startNewDebugger(m_startParams);\n}\n\nvoid MaemoDebugRunControl::stopInternal()\n{\n m_debuggerManager->exitDebugger();\n}\n\nbool MaemoDebugRunControl::isRunning() const\n{\n return AbstractMaemoRunControl::isRunning()\n || m_debuggerManager->state() != Debugger::DebuggerNotReady;\n}\n\nvoid MaemoDebugRunControl::debuggingFinished()\n{\n AbstractMaemoRunControl::stopRunning(true);\n}\n\nvoid MaemoDebugRunControl::debuggerOutput(const QString &output)\n{\n emit addToOutputWindowInline(this, output);\n}\n\nQString MaemoDebugRunControl::gdbServerPort() const\n{\n return m_devConfig.type == MaemoDeviceConfig::Physical\n ? QString::number(m_devConfig.gdbServerPort)\n : m_runConfig->simulatorGdbServerPort();\n}\n\n} \/\/ namespace Internal\n} \/\/ namespace Qt4ProjectManager\n<commit_msg>Maemo: Change misleading status messages.<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 Creator.\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** $QT_END_LICENSE$\n**\n****************************************************************************\/\n\n#include \"maemoruncontrol.h\"\n#include \"maemosshthread.h\"\n#include \"maemorunconfiguration.h\"\n\n#include <coreplugin\/icore.h>\n#include <coreplugin\/progressmanager\/progressmanager.h>\n#include <debugger\/debuggermanager.h>\n#include <extensionsystem\/pluginmanager.h>\n#include <projectexplorer\/toolchain.h>\n#include <utils\/qtcassert.h>\n\n#include <QtCore\/QDir>\n#include <QtCore\/QFileInfo>\n#include <QtCore\/QFuture>\n#include <QtCore\/QProcess>\n#include <QtCore\/QStringBuilder>\n\n#include <QtGui\/QMessageBox>\n\nnamespace Qt4ProjectManager {\nnamespace Internal {\n\nusing ProjectExplorer::RunConfiguration;\nusing ProjectExplorer::ToolChain;\n\nAbstractMaemoRunControl::AbstractMaemoRunControl(RunConfiguration *rc)\n : RunControl(rc)\n , m_runConfig(qobject_cast<MaemoRunConfiguration *>(rc))\n , m_devConfig(m_runConfig ? m_runConfig->deviceConfig() : MaemoDeviceConfig())\n{\n}\n\nAbstractMaemoRunControl::~AbstractMaemoRunControl()\n{\n}\n\nvoid AbstractMaemoRunControl::start()\n{\n m_stoppedByUser = false;\n emit started();\n startInitialCleanup();\n}\n\nvoid AbstractMaemoRunControl::startInitialCleanup()\n{\n emit addToOutputWindow(this, tr(\"Cleaning up remote leftovers first ...\"));\n const QStringList appsToKill\n = QStringList() << executableFileName() << QLatin1String(\"gdbserver\");\n killRemoteProcesses(appsToKill, true);\n}\n\nvoid AbstractMaemoRunControl::stop()\n{\n m_stoppedByUser = true;\n if (isCleaning())\n m_initialCleaner->stop();\n else if (isDeploying())\n m_sshDeployer->stop();\n else\n stopInternal();\n}\n\nvoid AbstractMaemoRunControl::handleInitialCleanupFinished()\n{\n if (m_stoppedByUser) {\n emit addToOutputWindow(this, tr(\"Initial cleanup canceled by user.\"));\n emit finished();\n } else if (m_initialCleaner->hasError()) {\n handleError(tr(\"Error running initial cleanup: %1.\")\n .arg(m_initialCleaner->error()));\n emit finished();\n } else {\n emit addToOutputWindow(this, tr(\"Initial cleanup done.\"));\n startInternal();\n }\n}\n\nvoid AbstractMaemoRunControl::startDeployment(bool forDebugging)\n{\n QTC_ASSERT(m_runConfig, return);\n\n if (!m_devConfig.isValid()) {\n handleError(tr(\"No device configuration set for run configuration.\"));\n emit finished();\n } else if (m_stoppedByUser) {\n emit finished();\n } else {\n m_deployables.clear();\n if (m_runConfig->currentlyNeedsDeployment(m_devConfig.host)) {\n m_deployables.append(Deployable(executableFileName(),\n QFileInfo(executableOnHost()).canonicalPath(),\n &MaemoRunConfiguration::wasDeployed));\n }\n if (forDebugging\n && m_runConfig->debuggingHelpersNeedDeployment(m_devConfig.host)) {\n const QFileInfo &info(m_runConfig->dumperLib());\n m_deployables.append(Deployable(info.fileName(), info.canonicalPath(),\n &MaemoRunConfiguration::debuggingHelpersDeployed));\n }\n\n deploy();\n }\n}\n\nvoid AbstractMaemoRunControl::deploy()\n{\n Core::ICore::instance()->progressManager()\n ->addTask(m_progress.future(), tr(\"Deploying\"),\n QLatin1String(\"Maemo.Deploy\"));\n if (!m_deployables.isEmpty()) {\n QList<SshDeploySpec> deploySpecs;\n QStringList files;\n foreach (const Deployable &deployable, m_deployables) {\n const QString srcFilePath\n = deployable.dir % QDir::separator() % deployable.fileName;\n const QString tgtFilePath\n = remoteDir() % QDir::separator() % deployable.fileName;\n files << srcFilePath;\n deploySpecs << SshDeploySpec(srcFilePath, tgtFilePath);\n }\n emit addToOutputWindow(this, tr(\"Files to deploy: %1.\").arg(files.join(\" \")));\n m_sshDeployer.reset(new MaemoSshDeployer(m_devConfig, deploySpecs));\n connect(m_sshDeployer.data(), SIGNAL(finished()),\n this, SLOT(handleDeployThreadFinished()));\n connect(m_sshDeployer.data(), SIGNAL(fileCopied(QString)),\n this, SLOT(handleFileCopied()));\n m_progress.setProgressRange(0, m_deployables.count());\n m_progress.setProgressValue(0);\n m_progress.reportStarted();\n m_sshDeployer->start();\n } else {\n m_progress.reportFinished();\n startExecution();\n }\n}\n\nvoid AbstractMaemoRunControl::handleFileCopied()\n{\n Deployable deployable = m_deployables.takeFirst();\n (m_runConfig->*deployable.updateTimestamp)(m_devConfig.host);\n m_progress.setProgressValue(m_progress.progressValue() + 1);\n}\n\nbool AbstractMaemoRunControl::isDeploying() const\n{\n return m_sshDeployer && m_sshDeployer->isRunning();\n}\n\nbool AbstractMaemoRunControl::isCleaning() const\n{\n return m_initialCleaner && m_initialCleaner->isRunning();\n}\n\nvoid AbstractMaemoRunControl::startExecution()\n{\n m_sshRunner.reset(new MaemoSshRunner(m_devConfig, remoteCall()));\n connect(m_sshRunner.data(), SIGNAL(finished()),\n this, SLOT(handleRunThreadFinished()));\n connect(m_sshRunner.data(), SIGNAL(remoteOutput(QString)),\n this, SLOT(handleRemoteOutput(QString)));\n emit addToOutputWindow(this, tr(\"Starting remote application.\"));\n m_sshRunner->start();\n}\n\nbool AbstractMaemoRunControl::isRunning() const\n{\n return isDeploying() || (m_sshRunner && m_sshRunner->isRunning());\n}\n\nvoid AbstractMaemoRunControl::stopRunning(bool forDebugging)\n{\n if (m_sshRunner && m_sshRunner->isRunning()) {\n m_sshRunner->stop();\n QStringList apps(executableFileName());\n if (forDebugging)\n apps << QLatin1String(\"gdbserver\");\n killRemoteProcesses(apps, false);\n }\n}\n\nvoid AbstractMaemoRunControl::killRemoteProcesses(const QStringList &apps,\n bool initialCleanup)\n{\n QString niceKill;\n QString brutalKill;\n foreach (const QString &app, apps) {\n niceKill += QString::fromLocal8Bit(\"pkill -x %1;\").arg(app);\n brutalKill += QString::fromLocal8Bit(\"pkill -x -9 %1;\").arg(app);\n }\n const QString remoteCall\n = niceKill + QLatin1String(\"sleep 1; \") + brutalKill;\n QScopedPointer<MaemoSshRunner> &runner\n = initialCleanup ? m_initialCleaner : m_sshStopper;\n runner.reset(new MaemoSshRunner(m_devConfig, remoteCall));\n if (initialCleanup)\n connect(runner.data(), SIGNAL(finished()),\n this, SLOT(handleInitialCleanupFinished()));\n runner->start();\n}\n\nvoid AbstractMaemoRunControl::handleDeployThreadFinished()\n{\n bool cancel;\n if (m_stoppedByUser) {\n emit addToOutputWindow(this, tr(\"Deployment canceled by user.\"));\n cancel = true;\n } else if (m_sshDeployer->hasError()) {\n handleError(tr(\"Deployment failed: %1\").arg(m_sshDeployer->error()));\n cancel = true;\n } else {\n emit addToOutputWindow(this, tr(\"Deployment finished.\"));\n cancel = false;\n }\n\n if (cancel) {\n m_progress.reportCanceled();\n m_progress.reportFinished();\n emit finished();\n } else {\n m_progress.reportFinished();\n startExecution();\n }\n}\n\nvoid AbstractMaemoRunControl::handleRunThreadFinished()\n{\n if (m_stoppedByUser) {\n emit addToOutputWindow(this,\n tr(\"Remote execution canceled due to user request.\"));\n } else if (m_sshRunner->hasError()) {\n emit addToOutputWindow(this, tr(\"Error running remote process: %1\")\n .arg(m_sshRunner->error()));\n } else {\n emit addToOutputWindow(this, tr(\"Finished running remote process.\"));\n }\n emit finished();\n}\n\nconst QString AbstractMaemoRunControl::executableOnHost() const\n{\n qDebug(\"runconfig->executable: %s\", qPrintable(m_runConfig->executable()));\n return m_runConfig->executable();\n}\n\nconst QString AbstractMaemoRunControl::sshPort() const\n{\n return m_devConfig.type == MaemoDeviceConfig::Physical\n ? QString::number(m_devConfig.sshPort)\n : m_runConfig->simulatorSshPort();\n}\n\nconst QString AbstractMaemoRunControl::executableFileName() const\n{\n return QFileInfo(executableOnHost()).fileName();\n}\n\nconst QString AbstractMaemoRunControl::remoteDir() const\n{\n return homeDirOnDevice(m_devConfig.uname);\n}\n\nconst QStringList AbstractMaemoRunControl::options() const\n{\n const bool usePassword\n = m_devConfig.authentication == MaemoDeviceConfig::Password;\n const QLatin1String opt(\"-o\");\n QStringList optionList;\n if (!usePassword)\n optionList << QLatin1String(\"-i\") << m_devConfig.keyFile;\n return optionList << opt\n << QString::fromLatin1(\"PasswordAuthentication=%1\").\n arg(usePassword ? \"yes\" : \"no\") << opt\n << QString::fromLatin1(\"PubkeyAuthentication=%1\").\n arg(usePassword ? \"no\" : \"yes\") << opt\n << QString::fromLatin1(\"ConnectTimeout=%1\").arg(m_devConfig.timeout)\n << opt << QLatin1String(\"CheckHostIP=no\")\n << opt << QLatin1String(\"StrictHostKeyChecking=no\");\n}\n\nconst QString AbstractMaemoRunControl::executableOnTarget() const\n{\n return QString::fromLocal8Bit(\"%1\/%2\").arg(remoteDir()).\n arg(executableFileName());\n}\n\nconst QString AbstractMaemoRunControl::targetCmdLinePrefix() const\n{\n return QString::fromLocal8Bit(\"chmod u+x %1; source \/etc\/profile; \").\n arg(executableOnTarget());\n}\n\nvoid AbstractMaemoRunControl::handleError(const QString &errString)\n{\n QMessageBox::critical(0, tr(\"Remote Execution Failure\"), errString);\n emit error(this, errString);\n}\n\n\nMaemoRunControl::MaemoRunControl(RunConfiguration *runConfiguration)\n : AbstractMaemoRunControl(runConfiguration)\n{\n}\n\nMaemoRunControl::~MaemoRunControl()\n{\n stop();\n}\n\nvoid MaemoRunControl::startInternal()\n{\n startDeployment(false);\n}\n\nQString MaemoRunControl::remoteCall() const\n{\n return QString::fromLocal8Bit(\"%1 %2 %3\")\n .arg(targetCmdLinePrefix()).arg(executableOnTarget())\n .arg(m_runConfig->arguments().join(\" \"));\n}\n\nvoid MaemoRunControl::stopInternal()\n{\n AbstractMaemoRunControl::stopRunning(false);\n}\n\nvoid MaemoRunControl::handleRemoteOutput(const QString &output)\n{\n emit addToOutputWindowInline(this, output);\n}\n\n\nMaemoDebugRunControl::MaemoDebugRunControl(RunConfiguration *runConfiguration)\n : AbstractMaemoRunControl(runConfiguration)\n , m_debuggerManager(ExtensionSystem::PluginManager::instance()\n ->getObject<Debugger::DebuggerManager>())\n , m_startParams(new Debugger::DebuggerStartParameters)\n{\n QTC_ASSERT(m_debuggerManager != 0, return);\n m_startParams->startMode = Debugger::StartRemote;\n m_startParams->executable = executableOnHost();\n m_startParams->remoteChannel\n = m_devConfig.host % QLatin1Char(':') % gdbServerPort();\n m_startParams->remoteArchitecture = QLatin1String(\"arm\");\n m_startParams->sysRoot = m_runConfig->sysRoot();\n m_startParams->toolChainType = ToolChain::GCC_MAEMO;\n m_startParams->debuggerCommand = m_runConfig->gdbCmd();\n m_startParams->dumperLibrary = m_runConfig->dumperLib();\n m_startParams->remoteDumperLib = QString::fromLocal8Bit(\"%1\/%2\")\n .arg(remoteDir()).arg(QFileInfo(m_runConfig->dumperLib()).fileName());\n\n connect(m_debuggerManager, SIGNAL(debuggingFinished()), this,\n SLOT(debuggingFinished()), Qt::QueuedConnection);\n connect(m_debuggerManager, SIGNAL(applicationOutputAvailable(QString)),\n this, SLOT(debuggerOutput(QString)), Qt::QueuedConnection);\n}\n\nMaemoDebugRunControl::~MaemoDebugRunControl()\n{\n disconnect(SIGNAL(addToOutputWindow(RunControl*,QString)));\n disconnect(SIGNAL(addToOutputWindowInline(RunControl*,QString)));\n stop();\n debuggingFinished();\n}\n\nvoid MaemoDebugRunControl::startInternal()\n{\n m_inferiorPid = -1;\n startDeployment(true);\n}\n\nQString MaemoDebugRunControl::remoteCall() const\n{\n return QString::fromLocal8Bit(\"%1 gdbserver :%2 %3 %4\")\n .arg(targetCmdLinePrefix()).arg(gdbServerPort())\n .arg(executableOnTarget()).arg(m_runConfig->arguments().join(\" \"));\n}\n\nvoid MaemoDebugRunControl::handleRemoteOutput(const QString &output)\n{\n qDebug(\"gdbserver's stderr output: %s\", output.toLatin1().data());\n if (m_inferiorPid != -1)\n return;\n const QString searchString(\"pid = \");\n const int searchStringLength = searchString.length();\n int pidStartPos = output.indexOf(searchString);\n const int pidEndPos = output.indexOf(\"\\n\", pidStartPos + searchStringLength);\n if (pidStartPos == -1 || pidEndPos == -1)\n return; \/\/ gdbserver has not started yet.\n pidStartPos += searchStringLength;\n QString pidString = output.mid(pidStartPos, pidEndPos - pidStartPos);\n qDebug(\"pidString = %s\", pidString.toLatin1().data());\n bool ok;\n const int pid = pidString.toInt(&ok);\n if (!ok) {\n handleError(tr(\"Debugging failed: Could not parse gdbserver output.\"));\n m_debuggerManager->exitDebugger();\n } else {\n m_inferiorPid = pid;\n startDebugging();\n }\n}\n\nvoid MaemoDebugRunControl::startDebugging()\n{\n m_debuggerManager->startNewDebugger(m_startParams);\n}\n\nvoid MaemoDebugRunControl::stopInternal()\n{\n m_debuggerManager->exitDebugger();\n}\n\nbool MaemoDebugRunControl::isRunning() const\n{\n return AbstractMaemoRunControl::isRunning()\n || m_debuggerManager->state() != Debugger::DebuggerNotReady;\n}\n\nvoid MaemoDebugRunControl::debuggingFinished()\n{\n AbstractMaemoRunControl::stopRunning(true);\n}\n\nvoid MaemoDebugRunControl::debuggerOutput(const QString &output)\n{\n emit addToOutputWindowInline(this, output);\n}\n\nQString MaemoDebugRunControl::gdbServerPort() const\n{\n return m_devConfig.type == MaemoDeviceConfig::Physical\n ? QString::number(m_devConfig.gdbServerPort)\n : m_runConfig->simulatorGdbServerPort();\n}\n\n} \/\/ namespace Internal\n} \/\/ namespace Qt4ProjectManager\n<|endoftext|>"} {"text":"<commit_before>#include \"VTCriticalSection.h\"\n#include <pthread.h>\n\nstruct VT::CriticalSection::critical_section_data\n{\n pthread_mutex_t _criticalSection;\n};\n\nVT::CriticalSection::CriticalSection() : data( new critical_section_data() )\n{\n pthread_mutex_init( &data->_criticalSection, NULL );\n}\n\nVT::CriticalSection::~CriticalSection()\n{\n pthread_mutex_destroy( &data->_criticalSection );\n delete data;\n}\n\nvoid VT::CriticalSection::enter()\n{\n pthread_mutex_lock( &data->_criticalSection );\n}\n\nbool VT::CriticalSection::try_enter()\n{\n \/\/static_assert(0, \"Not implemented\");\n}\n\nvoid VT::CriticalSection::leave()\n{\n pthread_mutex_unlock( &data->_criticalSection );\n}\n<commit_msg>Linux mutex try lock<commit_after>#include \"VTCriticalSection.h\"\n#include <pthread.h>\n\nstruct VT::CriticalSection::critical_section_data\n{\n pthread_mutex_t _criticalSection;\n};\n\nVT::CriticalSection::CriticalSection() : data( new critical_section_data() )\n{\n pthread_mutex_init( &data->_criticalSection, NULL );\n}\n\nVT::CriticalSection::~CriticalSection()\n{\n pthread_mutex_destroy( &data->_criticalSection );\n delete data;\n}\n\nvoid VT::CriticalSection::enter()\n{\n pthread_mutex_lock( &data->_criticalSection );\n}\n\nbool VT::CriticalSection::try_enter()\n{\n return pthread_mutex_trylock( &data->_criticalSection ) == 0;\n}\n\nvoid VT::CriticalSection::leave()\n{\n pthread_mutex_unlock( &data->_criticalSection );\n}\n<|endoftext|>"} {"text":"<commit_before>#ifndef STAN_MATH_MIX_MAT_FUNCTOR_FINITE_DIFF_GRAD_HESSIAN_HPP\n#define STAN_MATH_MIX_MAT_FUNCTOR_FINITE_DIFF_GRAD_HESSIAN_HPP\n\n#include <stan\/math\/prim\/mat\/fun\/Eigen.hpp>\n#include <vector>\n#include <stan\/math\/rev\/core.hpp>\n#include <stan\/math\/mix\/mat\/functor\/hessian.hpp>\n\nnamespace stan {\n\n namespace agrad {\n\n \/** \n * Calculate the value and the gradient of the hessian of the specified\n * function at the specified argument using second-order autodiff and\n * first-order finite difference. \n *\n * <p>The functor must implement \n * \n * <code>\n * double\n * operator()(const\n * Eigen::Matrix<double, Eigen::Dynamic, 1>&)\n * <\/code>\n *\n * Reference:\n *\n * De Levie: An improved numerical approximation\n * for the first derivative, page 3 \n *\n * 4 calls to the function, f.\n *\n * @tparam F Type of function\n * @param[in] f Function\n * @param[in] x Argument to function\n * @param[out] fx Function applied to argument\n * @param[out] grad_hess_fx gradient of Hessian of function at argument\n * @param[in] epsilon perturbation size\n *\/\n template <typename F>\n void\n finite_diff_grad_hessian(const F& f,\n const Eigen::Matrix<double, -1, 1>& x,\n double& fx,\n Eigen::Matrix<double, -1, -1>& hess,\n std::vector<Eigen::Matrix<double, -1, -1> >& grad_hess_fx,\n const double epsilon = 1e-04) {\n using Eigen::Matrix;\n using Eigen::Dynamic;\n\n int d = x.size();\n double dummy_fx_eval;\n\n Matrix<double, Dynamic, 1> x_temp(x);\n Matrix<double, Dynamic, 1> grad_auto(d);\n Matrix<double, Dynamic, Dynamic> hess_auto(d, d);\n Matrix<double, Dynamic, Dynamic> hess_diff(d, d);\n\n hessian(f, x, fx, grad_auto, hess);\n for (int i = 0; i < d; ++i) {\n hess_diff.setZero();\n\n x_temp(i) = x(i) + 2.0 * epsilon;\n hessian(f, x_temp, dummy_fx_eval, grad_auto, hess_auto);\n hess_diff = -hess_auto;\n\n x_temp(i) = x(i) + -2.0 * epsilon;\n hessian(f, x_temp, dummy_fx_eval, grad_auto, hess_auto);\n hess_diff += hess_auto;\n\n x_temp(i) = x(i) + epsilon;\n hessian(f, x_temp, dummy_fx_eval, grad_auto, hess_auto);\n hess_diff += 8.0 * hess_auto;\n\n x_temp(i) = x(i) + -epsilon;\n hessian(f, x_temp, dummy_fx_eval, grad_auto, hess_auto);\n hess_diff -= 8.0 * hess_auto;\n\n x_temp(i) = x(i);\n hess_diff \/= 12.0 * epsilon;\n\n grad_hess_fx.push_back(hess_diff);\n }\n fx = f(x);\n }\n\n }\n}\n#endif\n<commit_msg>b f\/i-1271 last cpplint warning<commit_after>#ifndef STAN_MATH_MIX_MAT_FUNCTOR_FINITE_DIFF_GRAD_HESSIAN_HPP\n#define STAN_MATH_MIX_MAT_FUNCTOR_FINITE_DIFF_GRAD_HESSIAN_HPP\n\n#include <stan\/math\/prim\/mat\/fun\/Eigen.hpp>\n#include <stan\/math\/rev\/core.hpp>\n#include <stan\/math\/mix\/mat\/functor\/hessian.hpp>\n#include <vector>\n\nnamespace stan {\n\n namespace agrad {\n\n \/** \n * Calculate the value and the gradient of the hessian of the specified\n * function at the specified argument using second-order autodiff and\n * first-order finite difference. \n *\n * <p>The functor must implement \n * \n * <code>\n * double\n * operator()(const\n * Eigen::Matrix<double, Eigen::Dynamic, 1>&)\n * <\/code>\n *\n * Reference:\n *\n * De Levie: An improved numerical approximation\n * for the first derivative, page 3 \n *\n * 4 calls to the function, f.\n *\n * @tparam F Type of function\n * @param[in] f Function\n * @param[in] x Argument to function\n * @param[out] fx Function applied to argument\n * @param[out] grad_hess_fx gradient of Hessian of function at argument\n * @param[in] epsilon perturbation size\n *\/\n template <typename F>\n void\n finite_diff_grad_hessian(const F& f,\n const Eigen::Matrix<double, -1, 1>& x,\n double& fx,\n Eigen::Matrix<double, -1, -1>& hess,\n std::vector<Eigen::Matrix<double, -1, -1> >& grad_hess_fx,\n const double epsilon = 1e-04) {\n using Eigen::Matrix;\n using Eigen::Dynamic;\n\n int d = x.size();\n double dummy_fx_eval;\n\n Matrix<double, Dynamic, 1> x_temp(x);\n Matrix<double, Dynamic, 1> grad_auto(d);\n Matrix<double, Dynamic, Dynamic> hess_auto(d, d);\n Matrix<double, Dynamic, Dynamic> hess_diff(d, d);\n\n hessian(f, x, fx, grad_auto, hess);\n for (int i = 0; i < d; ++i) {\n hess_diff.setZero();\n\n x_temp(i) = x(i) + 2.0 * epsilon;\n hessian(f, x_temp, dummy_fx_eval, grad_auto, hess_auto);\n hess_diff = -hess_auto;\n\n x_temp(i) = x(i) + -2.0 * epsilon;\n hessian(f, x_temp, dummy_fx_eval, grad_auto, hess_auto);\n hess_diff += hess_auto;\n\n x_temp(i) = x(i) + epsilon;\n hessian(f, x_temp, dummy_fx_eval, grad_auto, hess_auto);\n hess_diff += 8.0 * hess_auto;\n\n x_temp(i) = x(i) + -epsilon;\n hessian(f, x_temp, dummy_fx_eval, grad_auto, hess_auto);\n hess_diff -= 8.0 * hess_auto;\n\n x_temp(i) = x(i);\n hess_diff \/= 12.0 * epsilon;\n\n grad_hess_fx.push_back(hess_diff);\n }\n fx = f(x);\n }\n\n }\n}\n#endif\n<|endoftext|>"} {"text":"<commit_before>\/* Copyright 2016-2017 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 <QtCore\/QTimer>\n#include <QtCore\/QEventLoop>\n\n#include <QtCore\/QThread>\n\n#include <trikKitInterpreterCommon\/trikbrick.h>\n\n#include <utils\/abstractTimer.h>\n#include <kitBase\/robotModel\/robotModelUtils.h>\n#include <trikKit\/robotModel\/parts\/trikShell.h>\n#include <trikKit\/robotModel\/parts\/trikLineSensor.h>\n#include <kitBase\/robotModel\/robotParts\/gyroscopeSensor.h>\n#include <kitBase\/robotModel\/robotParts\/encoderSensor.h>\n#include <kitBase\/robotModel\/robotParts\/random.h>\n#include <kitBase\/robotModel\/robotParts\/random.h>\n#include <twoDModel\/robotModel\/parts\/marker.h>\n#include <twoDModel\/engine\/model\/timeline.h>\n\/\/\/todo: temporary\n#include <trikKitInterpreterCommon\/robotModel\/twoD\/parts\/twoDDisplay.h>\n\nusing namespace trik;\n\nTrikBrick::TrikBrick(const QSharedPointer<robotModel::twoD::TrikTwoDRobotModel> &model)\n\t: mTwoDRobotModel(model)\n\t, mDisplay(model)\n\t, mKeys(model)\n\t, mSensorUpdater(model->timeline().produceTimer())\n{\n\tconnect(this, &TrikBrick::log, this, &TrikBrick::printToShell);\n\tmSensorUpdater->setRepeatable(true);\n\tmSensorUpdater->setInterval(model->updateIntervalForInterpretation()); \/\/ seems to be x2 of timeline tick\n\tconnect(mSensorUpdater.data(), &utils::AbstractTimer::timeout, [model](){\n\t\tmodel->updateSensorsValues(); \/\/\/ @todo: maybe connect to model directly?\n\t});\n}\n\nTrikBrick::~TrikBrick()\n{\n\tqDeleteAll(mMotors);\n\tqDeleteAll(mSensors);\n\tqDeleteAll(mEncoders);\n\tqDeleteAll(mLineSensors);\n\tqDeleteAll(mTimers);\n}\n\nvoid TrikBrick::reset()\n{\n\tmKeys.reset();\/\/\/@todo: reset motos\/device maps?\n\t\/\/mDisplay.reset(); - is actually needed? Crashes app at exit\n\temit stopWaiting();\n\tfor (const auto &m : mMotors) {\n\t\tm->powerOff();\n\t}\n\tfor (const auto &e : mEncoders) {\n\t\te->reset();\n\t}\n\tfor (const auto &t : mTimers) {\n\t\tt->stop();\n\t}\n\tqDeleteAll(mTimers);\n\tmTimers.clear();\n\tQMetaObject::invokeMethod(mSensorUpdater.data(), \"stop\"); \/\/ failproof against timer manipulation in another thread\n}\n\nvoid TrikBrick::printToShell(const QString &msg)\n{\n\tusing namespace kitBase::robotModel;\n\tusing namespace trik::robotModel;\n\tparts::TrikShell* sh = RobotModelUtils::findDevice<parts::TrikShell>(*mTwoDRobotModel, \"ShellPort\");\n\tif (sh == nullptr) {\n\t\tqDebug(\"Error: 2d model shell part was not found\");\n\t\treturn;\n\t}\n\tsh->print(msg);\n}\n\nvoid TrikBrick::init()\n{\n\tmDisplay.init();\n\/\/\tfor (const auto &m : mMotors) {\n\/\/\t\tm->powerOff();\n\/\/\t}\n\/\/\tfor (const auto &e : mEncoders) {\n\/\/\t\te->read();\n\/\/\t}\n\/\/\tfor (const auto &s : mSensors) {\n\/\/\t\ts->read();\n\/\/\t}\n\tmTwoDRobotModel->updateSensorsValues();\n\tmMotors.clear(); \/\/ needed? reset?\n\tmSensors.clear();\n\tmEncoders.clear();\n\tmKeys.init();\n\tmGyroscope.reset(); \/\/ for some reason it won't reconnect to the robot parts otherwise.\n\tQMetaObject::invokeMethod(mSensorUpdater.data(), \"start\"); \/\/ failproof against timer manipulation in another thread\n\t\/\/mSensorUpdater.start();\n}\n\nvoid TrikBrick::setCurrentDir(const QString &dir)\n{\n\tmCurrentDir = QFileInfo(dir).dir(); \/\/ maybe can be constructed directly\n}\n\nvoid TrikBrick::setCurrentInputs(const QString &f)\n{\n\tmIsExcerciseMode = true;\n\tif (f.isEmpty()) {\n\t\treturn; \/\/ no inputs has been passed, no need to complain\n\t}\n\tQString file(f);\n\tQFile in(file);\n\tif (!in.open(QIODevice::ReadOnly | QIODevice::Text)) {\n\t\temit warning(tr(\"Trying to read from file %1 failed\").arg(file)); \/\/ todo: remove? It's only in exercise.\n\t\t\/\/not really an error, usually\n\t}\n\n\tQStringList result;\n\n\twhile (!in.atEnd()) {\n\t\tconst auto line = in.readLine();\n\t\tresult << QString::fromUtf8(line);\n\t}\n\n\tmInputs = result;\n}\n\nvoid TrikBrick::say(const QString &msg) {\n\tusing namespace kitBase::robotModel;\n\tusing namespace trik::robotModel;\n\tparts::TrikShell* sh = RobotModelUtils::findDevice<parts::TrikShell>(*mTwoDRobotModel, \"ShellPort\");\n\tif (sh == nullptr) {\n\t\tqDebug(\"Error: 2d model shell part was not found\");\n\t\treturn;\n\t}\n\tQMetaObject::invokeMethod(sh, \"say\", Q_ARG(const QString &, msg));\n}\n\nvoid TrikBrick::stop() {\n\t\/\/\/ @todo: properly implement this?\n\tmTwoDRobotModel->stopRobot();\n\/\/\tfor (const auto &m : mMotors) {\n\/\/\t\tm->powerOff();\n\/\/\t}\n\/\/\tfor (const auto &e : mEncoders) {\n\/\/\t\te->reset();\n\/\/\t}\n}\n\ntrikControl::MotorInterface *TrikBrick::motor(const QString &port)\n{\n\tusing namespace kitBase::robotModel;\n\tif (!mMotors.contains(port)) {\n\t\trobotParts::Motor * mot =\n\t\t\t\tRobotModelUtils::findDevice<robotParts::Motor>(*mTwoDRobotModel, port);\n\t\tif (mot == nullptr) {\n\t\t\temit error(tr(\"No configured motor on port: %1\").arg(port));\n\t\t\treturn nullptr;\n\t\t}\n\t\tmMotors[port] = new TrikMotorEmu(mot);\n\t}\n\treturn mMotors[port];\n}\n\ntrikControl::MarkerInterface *TrikBrick::marker()\n{\n\tkitBase::robotModel::PortInfo markerPort = kitBase::robotModel::RobotModelUtils::findPort(*mTwoDRobotModel\n\t\t\t, \"MarkerPort\"\n\t\t\t, kitBase::robotModel::Direction::output);\n\tif (markerPort.isValid()) {\n\t\tusing Marker = twoDModel::robotModel::parts::Marker;\n\t\tMarker* marker = kitBase::robotModel::RobotModelUtils::findDevice<Marker>(*mTwoDRobotModel, markerPort);\n\t\tmTrikProxyMarker.reset(new TrikProxyMarker(marker));\n\t\treturn mTrikProxyMarker.data();\n\t}\n\n\treturn nullptr;\n}\n\ntrikControl::SensorInterface *TrikBrick::sensor(const QString &port)\n{\n\t\/\/testing\n\tusing namespace kitBase::robotModel;\n\tif (!mSensors.contains(port)) {\n\t\trobotParts::ScalarSensor * sens =\n\t\t\t\tRobotModelUtils::findDevice<robotParts::ScalarSensor>(*mTwoDRobotModel, port);\n\t\tif (sens == nullptr) {\n\t\t\temit error(tr(\"No configured sensor on port: %1\").arg(port));\n\t\t\treturn nullptr;\n\t\t}\n\t\tmSensors[port] = new TrikSensorEmu(sens);\n\t}\n\treturn mSensors[port];\n}\n\nQStringList TrikBrick::motorPorts(trikControl::MotorInterface::Type type) const\n{\n\tQ_UNUSED(type)\n\/\/\tQLOG_INFO() << \"Motor type is ignored\";\n\treturn mMotors.keys();\n}\n\nQStringList TrikBrick::sensorPorts(trikControl::SensorInterface::Type type) const\n{\n\tQ_UNUSED(type)\n\/\/\tQLOG_INFO() << \"Sensor type is ignored\";\n\treturn mMotors.keys();\n}\n\nQStringList TrikBrick::encoderPorts() const {\n\treturn mEncoders.keys();\n}\n\ntrikControl::VectorSensorInterface *TrikBrick::accelerometer() {\n\tusing namespace kitBase::robotModel;\n\tif (mAccelerometer.isNull()) {\n\t\tauto a = RobotModelUtils::findDevice<robotParts::AccelerometerSensor>(*mTwoDRobotModel\n\t\t\t\t, \"AccelerometerPort\");\n\t\tif (a == nullptr) {\n\t\t\temit error(tr(\"No configured accelerometer\"));\n\t\t\treturn nullptr;\n\t\t}\n\t\tmAccelerometer.reset(new TrikAccelerometerAdapter(a));\n\t}\n\n\treturn mAccelerometer.data();\n}\n\ntrikControl::GyroSensorInterface *TrikBrick::gyroscope() {\n\tusing namespace kitBase::robotModel;\n\tif (mGyroscope.isNull()) {\n\t\tauto a = RobotModelUtils::findDevice<robotParts::GyroscopeSensor>(*mTwoDRobotModel\n\t\t\t\t, \"GyroscopePort\");\n\t\tif (a == nullptr) {\n\t\t\temit error(tr(\"No configured gyroscope\"));\n\t\t\treturn nullptr;\n\t\t}\n\t\tmGyroscope.reset(new TrikGyroscopeAdapter(a, mTwoDRobotModel));\n\t}\n\n\treturn mGyroscope.data();\n}\n\ntrikControl::LineSensorInterface *TrikBrick::lineSensor(const QString &port) {\n\tusing namespace trik::robotModel::parts;\n\tusing namespace kitBase::robotModel;\n\tif (port == \"video0\") {\n\t\treturn lineSensor(\"LineSensorPort\"); \/\/ seems to be the case for 2d model\n\t}\n\n\tif (!mLineSensors.contains(port)) {\n\t\tTrikLineSensor * sens =\n\t\t\t\tRobotModelUtils::findDevice<TrikLineSensor>(*mTwoDRobotModel, port);\n\t\tif (sens == nullptr) {\n\t\t\temit error(tr(\"No configured LineSensor on port: %1\").arg(port));\n\t\t\treturn nullptr;\n\t\t}\n\t\tmLineSensors[port] = new TrikLineSensorAdapter(sens);\n\t}\n\n\treturn mLineSensors[port];\n}\n\ntrikControl::EncoderInterface *TrikBrick::encoder(const QString &port) {\n\tusing namespace kitBase::robotModel;\n\tif (!mEncoders.contains(port)) {\n\t\trobotParts::EncoderSensor * enc =\n\t\t\t\tRobotModelUtils::findDevice<robotParts::EncoderSensor>(*mTwoDRobotModel, port);\n\t\tif (enc == nullptr) {\n\t\t\temit error(tr(\"No configured encoder on port: %1\").arg(port));\n\t\t\treturn nullptr;\n\t\t}\n\n\t\tmEncoders[port] = new TrikEncoderAdapter(enc->port(), mTwoDRobotModel->engine());\n\t}\n\n\treturn mEncoders[port];\n}\n\ntrikControl::DisplayInterface *TrikBrick::display()\n{\n\/\/\ttrik::robotModel::parts::TrikDisplay * const display =\n\/\/\t\t\tkitBase::robotModel::RobotModelUtils::findDevice<trik::robotModel::parts::TrikDisplay>(*mTwoDRobotModel\n\/\/\t\t\t\t\t, \"DisplayPort\");\n\/\/\tif (display) {\n\/\/\t\tbool res = QMetaObject::invokeMethod(display,\n\/\/\t\t\"drawSmile\",\n\/\/\t\tQt::QueuedConnection, \/\/ connection type, auto?\n\/\/\t\tQ_ARG(bool, false));\n\/\/\t\t\/\/display->drawSmile(false);\n\/\/\t\tprintf(res ? \"true\" : \"false\");\n\/\/\t}\n\/\/\treturn nullptr;\n\treturn &mDisplay;\n}\n\ntrikControl::LedInterface *TrikBrick::led() {\n\tusing namespace trik::robotModel::parts;\n\tusing namespace kitBase::robotModel;\n\tif (mLed.isNull()) {\n\t\tauto l = RobotModelUtils::findDevice<TrikLed>(*mTwoDRobotModel, \"LedPort\");\n\t\tif (l == nullptr) {\n\t\t\temit error(tr(\"No configured led\"));\n\t\t\treturn nullptr;\n\t\t}\n\t\tmLed.reset(new TrikLedAdapter(l));\n\t}\n\n\treturn mLed.data();\n}\n\nint TrikBrick::random(int from, int to)\n{\n\tusing namespace kitBase::robotModel;\n\tauto r = RobotModelUtils::findDevice<robotParts::Random>(*mTwoDRobotModel, \"RandomPort\");\n\t\/\/ maybe store it later, like the others\n\tif (!r) {\n\t\temit error(tr(\"No cofigured random device\"));\n\t\treturn -1;\n\t}\n\n\treturn r->random(from, to);\n}\n\nvoid TrikBrick::wait(int milliseconds)\n{\n\tQEventLoop loop;\n\tauto &timeline = dynamic_cast<twoDModel::model::Timeline &> (mTwoDRobotModel->timeline());\n\n\tif (timeline.isStarted()) {\n\t\tQScopedPointer<utils::AbstractTimer> t(timeline.produceTimer());\n\t\tQTimer abortTimer;\n\t\tQMetaObject::Connection abortConnection;\n\n\t\tauto mainHandler = [this, &t, &loop, &timeline, &abortConnection]() {\n\t\t\tdisconnect(abortConnection);\n\t\t\tdisconnect(this, &TrikBrick::stopWaiting, nullptr, nullptr);\n\t\t\tdisconnect(&timeline, &twoDModel::model::Timeline::beforeStop, nullptr, nullptr);\n\t\t\tdisconnect(t.data(), &utils::AbstractTimer::timeout, nullptr, nullptr);\n\t\t\tloop.quit();\n\t\t};\n\n\t\tauto abortHandler = [mainHandler, &timeline]() {\n\t\t\tif (!timeline.isStarted()) {\n\t\t\t\tmainHandler();\n\t\t\t}\n\t\t};\n\n\t\tconnect(t.data(), &utils::AbstractTimer::timeout, mainHandler);\n\t\tconnect(this, &TrikBrick::stopWaiting, mainHandler);\n\n\t\t\/\/ timers that are produced by produceTimer() doesn't use stop singal\n\t\t\/\/ be careful, one who use just utils::AbstractTimer can stuck\n\t\tconnect(&timeline, &twoDModel::model::Timeline::beforeStop, mainHandler);\n\t\tabortConnection = connect(&abortTimer, &QTimer::timeout, abortHandler);\n\n\t\t\/\/ because timer is depends on twoDModel::model::Timeline\n\t\tif (timeline.isStarted()) {\n\t\t\tt->start(milliseconds);\n\t\t\tabortTimer.start(10);\n\t\t\tloop.exec();\n\t\t} else {\n\t\t\tmainHandler();\n\t\t}\n\t}\n}\n\nquint64 TrikBrick::time() const\n{\n\treturn mTwoDRobotModel->timeline().timestamp();\n}\n\nQStringList TrikBrick::readAll(const QString &path)\n{\n\tif (mIsExcerciseMode) {\n\t\treturn mInputs;\n\t}\n\t\/\/if (mCurrentDir) todo: check that the current working dir is a save dir\n\tQFileInfo normalizedPath(mCurrentDir.absoluteFilePath(path)); \/\/ absoluteDir?\n\tQString file = normalizedPath.filePath();\n\tQFile in(file);\n\tif (!in.open(QIODevice::ReadOnly | QIODevice::Text)) {\n\t\temit error(tr(\"Trying to read from file %1 failed\").arg(file));\n\t\treturn {};\n\t}\n\n\tQStringList result;\n\n\twhile (!in.atEnd()) {\n\t\tconst auto line = in.readLine();\n\t\tresult << QString::fromUtf8(line);\n\t}\n\n\treturn result;\n}\n\nutils::AbstractTimer *TrikBrick::timer(int milliseconds)\n{\n\tutils::AbstractTimer *result = mTwoDRobotModel->timeline().produceTimer();\n\tmTimers.append(result);\n\tresult->setRepeatable(true); \/\/ seems to be the case\n\tresult->start(milliseconds);\n\treturn result;\n}\n\n<commit_msg>Fix stack (local vars) access after return, that happend from ::timout signal handler sometimes<commit_after>\/* Copyright 2016-2017 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 <QtCore\/QTimer>\n#include <QtCore\/QEventLoop>\n\n#include <QtCore\/QThread>\n\n#include <trikKitInterpreterCommon\/trikbrick.h>\n\n#include <utils\/abstractTimer.h>\n#include <kitBase\/robotModel\/robotModelUtils.h>\n#include <trikKit\/robotModel\/parts\/trikShell.h>\n#include <trikKit\/robotModel\/parts\/trikLineSensor.h>\n#include <kitBase\/robotModel\/robotParts\/gyroscopeSensor.h>\n#include <kitBase\/robotModel\/robotParts\/encoderSensor.h>\n#include <kitBase\/robotModel\/robotParts\/random.h>\n#include <kitBase\/robotModel\/robotParts\/random.h>\n#include <twoDModel\/robotModel\/parts\/marker.h>\n#include <twoDModel\/engine\/model\/timeline.h>\n\/\/\/todo: temporary\n#include <trikKitInterpreterCommon\/robotModel\/twoD\/parts\/twoDDisplay.h>\n\nusing namespace trik;\n\nTrikBrick::TrikBrick(const QSharedPointer<robotModel::twoD::TrikTwoDRobotModel> &model)\n\t: mTwoDRobotModel(model)\n\t, mDisplay(model)\n\t, mKeys(model)\n\t, mSensorUpdater(model->timeline().produceTimer())\n{\n\tconnect(this, &TrikBrick::log, this, &TrikBrick::printToShell);\n\tmSensorUpdater->setRepeatable(true);\n\tmSensorUpdater->setInterval(model->updateIntervalForInterpretation()); \/\/ seems to be x2 of timeline tick\n\tconnect(mSensorUpdater.data(), &utils::AbstractTimer::timeout, [model](){\n\t\tmodel->updateSensorsValues(); \/\/\/ @todo: maybe connect to model directly?\n\t});\n}\n\nTrikBrick::~TrikBrick()\n{\n\tqDeleteAll(mMotors);\n\tqDeleteAll(mSensors);\n\tqDeleteAll(mEncoders);\n\tqDeleteAll(mLineSensors);\n\tqDeleteAll(mTimers);\n}\n\nvoid TrikBrick::reset()\n{\n\tmKeys.reset();\/\/\/@todo: reset motos\/device maps?\n\t\/\/mDisplay.reset(); - is actually needed? Crashes app at exit\n\temit stopWaiting();\n\tfor (const auto &m : mMotors) {\n\t\tm->powerOff();\n\t}\n\tfor (const auto &e : mEncoders) {\n\t\te->reset();\n\t}\n\tfor (const auto &t : mTimers) {\n\t\tt->stop();\n\t}\n\tqDeleteAll(mTimers);\n\tmTimers.clear();\n\tQMetaObject::invokeMethod(mSensorUpdater.data(), \"stop\"); \/\/ failproof against timer manipulation in another thread\n}\n\nvoid TrikBrick::printToShell(const QString &msg)\n{\n\tusing namespace kitBase::robotModel;\n\tusing namespace trik::robotModel;\n\tparts::TrikShell* sh = RobotModelUtils::findDevice<parts::TrikShell>(*mTwoDRobotModel, \"ShellPort\");\n\tif (sh == nullptr) {\n\t\tqDebug(\"Error: 2d model shell part was not found\");\n\t\treturn;\n\t}\n\tsh->print(msg);\n}\n\nvoid TrikBrick::init()\n{\n\tmDisplay.init();\n\/\/\tfor (const auto &m : mMotors) {\n\/\/\t\tm->powerOff();\n\/\/\t}\n\/\/\tfor (const auto &e : mEncoders) {\n\/\/\t\te->read();\n\/\/\t}\n\/\/\tfor (const auto &s : mSensors) {\n\/\/\t\ts->read();\n\/\/\t}\n\tmTwoDRobotModel->updateSensorsValues();\n\tmMotors.clear(); \/\/ needed? reset?\n\tmSensors.clear();\n\tmEncoders.clear();\n\tmKeys.init();\n\tmGyroscope.reset(); \/\/ for some reason it won't reconnect to the robot parts otherwise.\n\tQMetaObject::invokeMethod(mSensorUpdater.data(), \"start\"); \/\/ failproof against timer manipulation in another thread\n\t\/\/mSensorUpdater.start();\n}\n\nvoid TrikBrick::setCurrentDir(const QString &dir)\n{\n\tmCurrentDir = QFileInfo(dir).dir(); \/\/ maybe can be constructed directly\n}\n\nvoid TrikBrick::setCurrentInputs(const QString &f)\n{\n\tmIsExcerciseMode = true;\n\tif (f.isEmpty()) {\n\t\treturn; \/\/ no inputs has been passed, no need to complain\n\t}\n\tQString file(f);\n\tQFile in(file);\n\tif (!in.open(QIODevice::ReadOnly | QIODevice::Text)) {\n\t\temit warning(tr(\"Trying to read from file %1 failed\").arg(file)); \/\/ todo: remove? It's only in exercise.\n\t\t\/\/not really an error, usually\n\t}\n\n\tQStringList result;\n\n\twhile (!in.atEnd()) {\n\t\tconst auto line = in.readLine();\n\t\tresult << QString::fromUtf8(line);\n\t}\n\n\tmInputs = result;\n}\n\nvoid TrikBrick::say(const QString &msg) {\n\tusing namespace kitBase::robotModel;\n\tusing namespace trik::robotModel;\n\tparts::TrikShell* sh = RobotModelUtils::findDevice<parts::TrikShell>(*mTwoDRobotModel, \"ShellPort\");\n\tif (sh == nullptr) {\n\t\tqDebug(\"Error: 2d model shell part was not found\");\n\t\treturn;\n\t}\n\tQMetaObject::invokeMethod(sh, \"say\", Q_ARG(const QString &, msg));\n}\n\nvoid TrikBrick::stop() {\n\t\/\/\/ @todo: properly implement this?\n\tmTwoDRobotModel->stopRobot();\n\/\/\tfor (const auto &m : mMotors) {\n\/\/\t\tm->powerOff();\n\/\/\t}\n\/\/\tfor (const auto &e : mEncoders) {\n\/\/\t\te->reset();\n\/\/\t}\n}\n\ntrikControl::MotorInterface *TrikBrick::motor(const QString &port)\n{\n\tusing namespace kitBase::robotModel;\n\tif (!mMotors.contains(port)) {\n\t\trobotParts::Motor * mot =\n\t\t\t\tRobotModelUtils::findDevice<robotParts::Motor>(*mTwoDRobotModel, port);\n\t\tif (mot == nullptr) {\n\t\t\temit error(tr(\"No configured motor on port: %1\").arg(port));\n\t\t\treturn nullptr;\n\t\t}\n\t\tmMotors[port] = new TrikMotorEmu(mot);\n\t}\n\treturn mMotors[port];\n}\n\ntrikControl::MarkerInterface *TrikBrick::marker()\n{\n\tkitBase::robotModel::PortInfo markerPort = kitBase::robotModel::RobotModelUtils::findPort(*mTwoDRobotModel\n\t\t\t, \"MarkerPort\"\n\t\t\t, kitBase::robotModel::Direction::output);\n\tif (markerPort.isValid()) {\n\t\tusing Marker = twoDModel::robotModel::parts::Marker;\n\t\tMarker* marker = kitBase::robotModel::RobotModelUtils::findDevice<Marker>(*mTwoDRobotModel, markerPort);\n\t\tmTrikProxyMarker.reset(new TrikProxyMarker(marker));\n\t\treturn mTrikProxyMarker.data();\n\t}\n\n\treturn nullptr;\n}\n\ntrikControl::SensorInterface *TrikBrick::sensor(const QString &port)\n{\n\t\/\/testing\n\tusing namespace kitBase::robotModel;\n\tif (!mSensors.contains(port)) {\n\t\trobotParts::ScalarSensor * sens =\n\t\t\t\tRobotModelUtils::findDevice<robotParts::ScalarSensor>(*mTwoDRobotModel, port);\n\t\tif (sens == nullptr) {\n\t\t\temit error(tr(\"No configured sensor on port: %1\").arg(port));\n\t\t\treturn nullptr;\n\t\t}\n\t\tmSensors[port] = new TrikSensorEmu(sens);\n\t}\n\treturn mSensors[port];\n}\n\nQStringList TrikBrick::motorPorts(trikControl::MotorInterface::Type type) const\n{\n\tQ_UNUSED(type)\n\/\/\tQLOG_INFO() << \"Motor type is ignored\";\n\treturn mMotors.keys();\n}\n\nQStringList TrikBrick::sensorPorts(trikControl::SensorInterface::Type type) const\n{\n\tQ_UNUSED(type)\n\/\/\tQLOG_INFO() << \"Sensor type is ignored\";\n\treturn mMotors.keys();\n}\n\nQStringList TrikBrick::encoderPorts() const {\n\treturn mEncoders.keys();\n}\n\ntrikControl::VectorSensorInterface *TrikBrick::accelerometer() {\n\tusing namespace kitBase::robotModel;\n\tif (mAccelerometer.isNull()) {\n\t\tauto a = RobotModelUtils::findDevice<robotParts::AccelerometerSensor>(*mTwoDRobotModel\n\t\t\t\t, \"AccelerometerPort\");\n\t\tif (a == nullptr) {\n\t\t\temit error(tr(\"No configured accelerometer\"));\n\t\t\treturn nullptr;\n\t\t}\n\t\tmAccelerometer.reset(new TrikAccelerometerAdapter(a));\n\t}\n\n\treturn mAccelerometer.data();\n}\n\ntrikControl::GyroSensorInterface *TrikBrick::gyroscope() {\n\tusing namespace kitBase::robotModel;\n\tif (mGyroscope.isNull()) {\n\t\tauto a = RobotModelUtils::findDevice<robotParts::GyroscopeSensor>(*mTwoDRobotModel\n\t\t\t\t, \"GyroscopePort\");\n\t\tif (a == nullptr) {\n\t\t\temit error(tr(\"No configured gyroscope\"));\n\t\t\treturn nullptr;\n\t\t}\n\t\tmGyroscope.reset(new TrikGyroscopeAdapter(a, mTwoDRobotModel));\n\t}\n\n\treturn mGyroscope.data();\n}\n\ntrikControl::LineSensorInterface *TrikBrick::lineSensor(const QString &port) {\n\tusing namespace trik::robotModel::parts;\n\tusing namespace kitBase::robotModel;\n\tif (port == \"video0\") {\n\t\treturn lineSensor(\"LineSensorPort\"); \/\/ seems to be the case for 2d model\n\t}\n\n\tif (!mLineSensors.contains(port)) {\n\t\tTrikLineSensor * sens =\n\t\t\t\tRobotModelUtils::findDevice<TrikLineSensor>(*mTwoDRobotModel, port);\n\t\tif (sens == nullptr) {\n\t\t\temit error(tr(\"No configured LineSensor on port: %1\").arg(port));\n\t\t\treturn nullptr;\n\t\t}\n\t\tmLineSensors[port] = new TrikLineSensorAdapter(sens);\n\t}\n\n\treturn mLineSensors[port];\n}\n\ntrikControl::EncoderInterface *TrikBrick::encoder(const QString &port) {\n\tusing namespace kitBase::robotModel;\n\tif (!mEncoders.contains(port)) {\n\t\trobotParts::EncoderSensor * enc =\n\t\t\t\tRobotModelUtils::findDevice<robotParts::EncoderSensor>(*mTwoDRobotModel, port);\n\t\tif (enc == nullptr) {\n\t\t\temit error(tr(\"No configured encoder on port: %1\").arg(port));\n\t\t\treturn nullptr;\n\t\t}\n\n\t\tmEncoders[port] = new TrikEncoderAdapter(enc->port(), mTwoDRobotModel->engine());\n\t}\n\n\treturn mEncoders[port];\n}\n\ntrikControl::DisplayInterface *TrikBrick::display()\n{\n\/\/\ttrik::robotModel::parts::TrikDisplay * const display =\n\/\/\t\t\tkitBase::robotModel::RobotModelUtils::findDevice<trik::robotModel::parts::TrikDisplay>(*mTwoDRobotModel\n\/\/\t\t\t\t\t, \"DisplayPort\");\n\/\/\tif (display) {\n\/\/\t\tbool res = QMetaObject::invokeMethod(display,\n\/\/\t\t\"drawSmile\",\n\/\/\t\tQt::QueuedConnection, \/\/ connection type, auto?\n\/\/\t\tQ_ARG(bool, false));\n\/\/\t\t\/\/display->drawSmile(false);\n\/\/\t\tprintf(res ? \"true\" : \"false\");\n\/\/\t}\n\/\/\treturn nullptr;\n\treturn &mDisplay;\n}\n\ntrikControl::LedInterface *TrikBrick::led() {\n\tusing namespace trik::robotModel::parts;\n\tusing namespace kitBase::robotModel;\n\tif (mLed.isNull()) {\n\t\tauto l = RobotModelUtils::findDevice<TrikLed>(*mTwoDRobotModel, \"LedPort\");\n\t\tif (l == nullptr) {\n\t\t\temit error(tr(\"No configured led\"));\n\t\t\treturn nullptr;\n\t\t}\n\t\tmLed.reset(new TrikLedAdapter(l));\n\t}\n\n\treturn mLed.data();\n}\n\nint TrikBrick::random(int from, int to)\n{\n\tusing namespace kitBase::robotModel;\n\tauto r = RobotModelUtils::findDevice<robotParts::Random>(*mTwoDRobotModel, \"RandomPort\");\n\t\/\/ maybe store it later, like the others\n\tif (!r) {\n\t\temit error(tr(\"No cofigured random device\"));\n\t\treturn -1;\n\t}\n\n\treturn r->random(from, to);\n}\n\nvoid TrikBrick::wait(int milliseconds)\n{\n\tauto timeline = dynamic_cast<twoDModel::model::Timeline *> (&mTwoDRobotModel->timeline());\n\n\tif (timeline->isStarted()) {\n\t\tQSharedPointer<utils::AbstractTimer> t(timeline->produceTimer());\n\t\tQTimer abortTimer;\n\t\tQMetaObject::Connection abortConnection;\n\t\tQSharedPointer<QEventLoop> loop (new QEventLoop());\n\n\t\tauto mainHandler = [=]() {\n\t\t\tdisconnect(abortConnection);\n\t\t\tdisconnect(this, &TrikBrick::stopWaiting, nullptr, nullptr);\n\t\t\tdisconnect(timeline, &twoDModel::model::Timeline::beforeStop, nullptr, nullptr);\n\t\t\tdisconnect(t.data(), &utils::AbstractTimer::timeout, nullptr, nullptr);\n\t\t\tloop->quit();\n\t\t};\n\n\t\tauto abortHandler = [=]() {\n\t\t\tif (!timeline->isStarted()) {\n\t\t\t\tmainHandler();\n\t\t\t}\n\t\t};\n\n\t\tconnect(t.data(), &utils::AbstractTimer::timeout, mainHandler);\n\t\tconnect(this, &TrikBrick::stopWaiting, mainHandler);\n\n\t\t\/\/ timers that are produced by produceTimer() doesn't use stop singal\n\t\t\/\/ be careful, one who use just utils::AbstractTimer can stuck\n\t\tconnect(timeline, &twoDModel::model::Timeline::beforeStop, mainHandler);\n\t\tabortConnection = connect(&abortTimer, &QTimer::timeout, abortHandler);\n\n\t\t\/\/ because timer is depends on twoDModel::model::Timeline\n\t\tif (timeline->isStarted()) {\n\t\t\tt->start(milliseconds);\n\t\t\tabortTimer.start(10);\n\t\t\tloop->exec();\n\t\t} else {\n\t\t\tmainHandler();\n\t\t}\n\t}\n}\n\nquint64 TrikBrick::time() const\n{\n\treturn mTwoDRobotModel->timeline().timestamp();\n}\n\nQStringList TrikBrick::readAll(const QString &path)\n{\n\tif (mIsExcerciseMode) {\n\t\treturn mInputs;\n\t}\n\t\/\/if (mCurrentDir) todo: check that the current working dir is a save dir\n\tQFileInfo normalizedPath(mCurrentDir.absoluteFilePath(path)); \/\/ absoluteDir?\n\tQString file = normalizedPath.filePath();\n\tQFile in(file);\n\tif (!in.open(QIODevice::ReadOnly | QIODevice::Text)) {\n\t\temit error(tr(\"Trying to read from file %1 failed\").arg(file));\n\t\treturn {};\n\t}\n\n\tQStringList result;\n\n\twhile (!in.atEnd()) {\n\t\tconst auto line = in.readLine();\n\t\tresult << QString::fromUtf8(line);\n\t}\n\n\treturn result;\n}\n\nutils::AbstractTimer *TrikBrick::timer(int milliseconds)\n{\n\tutils::AbstractTimer *result = mTwoDRobotModel->timeline().produceTimer();\n\tmTimers.append(result);\n\tresult->setRepeatable(true); \/\/ seems to be the case\n\tresult->start(milliseconds);\n\treturn result;\n}\n\n<|endoftext|>"} {"text":"<commit_before>\/\/\n\/\/ This file is part of the Marble Desktop Globe.\n\/\/\n\/\/ This program is free software licensed under the GNU LGPL. You can\n\/\/ find a copy of this license in LICENSE.txt in the top directory of\n\/\/ the source code.\n\/\/\n\/\/ Copyright 2004-2007 Torsten Rahn <tackat@kde.org>\n\/\/ Copyright 2007 Inge Wallin <ingwa@kde.org>\n\/\/ Copyright 2008-2009 Patrick Spendrin <ps_ml@gmx.de>\n\/\/\n\n\n\/\/ Own\n#include \"GeoDataPlacemark.h\"\n\n\/\/ Private\n#include \"GeoDataPlacemark_p.h\"\n\n\/\/ Qt\n#include <QtCore\/QDataStream>\n#include <QtCore\/QDebug>\n\nnamespace Marble\n{\nGeoDataPlacemark::GeoDataPlacemark()\n : GeoDataFeature( new GeoDataPlacemarkPrivate )\n{\n}\n\nGeoDataPlacemark::GeoDataPlacemark( const GeoDataPlacemark& other )\n: GeoDataFeature( other )\n{\n}\n\nGeoDataPlacemark::GeoDataPlacemark( const GeoDataFeature& other )\n: GeoDataFeature( other )\n{\n}\n\nGeoDataPlacemark::GeoDataPlacemark( const QString& name )\n : GeoDataFeature( name )\n{\n}\n\nGeoDataPlacemark::~GeoDataPlacemark()\n{\n}\n\nbool GeoDataPlacemark::operator==( const GeoDataPlacemark& other ) const\n{ \n return p() == other.p();\n}\n\nGeoDataPlacemarkPrivate* GeoDataPlacemark::p() const\n{\n return static_cast<GeoDataPlacemarkPrivate*>(d);\n}\n\nGeoDataGeometry* GeoDataPlacemark::geometry() const\n{\n if( p()->m_geometry )\n return p()->m_geometry;\n else\n return &( p()->m_coordinate );\n}\n\nGeoDataCoordinates GeoDataPlacemark::coordinate() const\n{\n return static_cast<GeoDataCoordinates>( p()->m_coordinate );\n}\n\nvoid GeoDataPlacemark::coordinate( qreal& lon, qreal& lat, qreal& alt ) const\n{\n p()->m_coordinate.geoCoordinates( lon, lat );\n alt = p()->m_coordinate.altitude();\n}\n\nvoid GeoDataPlacemark::setCoordinate( qreal lon, qreal lat, qreal alt )\n{\n detach();\n p()->m_coordinate = GeoDataPoint( lon, lat, alt );\n}\n\nvoid GeoDataPlacemark::setCoordinate( const GeoDataPoint &point )\n{\n detach();\n p()->m_coordinate = GeoDataPoint( point );\n}\n\nvoid GeoDataPlacemark::setGeometry( const GeoDataPoint& point )\n{\n detach();\n p()->m_geometry = new GeoDataPoint( point );\n}\n\nvoid GeoDataPlacemark::setGeometry( const GeoDataLineString& point )\n{\n detach();\n p()->m_geometry = new GeoDataLineString( point );\n}\n\nvoid GeoDataPlacemark::setGeometry( const GeoDataLinearRing& point )\n{\n detach();\n p()->m_geometry = new GeoDataLinearRing( point );\n}\n\nvoid GeoDataPlacemark::setGeometry( const GeoDataPolygon& point )\n{\n detach();\n p()->m_geometry = new GeoDataPolygon( point );\n}\n\nvoid GeoDataPlacemark::setGeometry( const GeoDataMultiGeometry& point )\n{\n detach();\n p()->m_geometry = new GeoDataMultiGeometry( point );\n}\n\nqreal GeoDataPlacemark::area() const\n{\n return p()->m_area;\n}\n\nvoid GeoDataPlacemark::setArea( qreal area )\n{\n detach();\n p()->m_area = area;\n}\n\nqint64 GeoDataPlacemark::population() const\n{\n return p()->m_population;\n}\n\nvoid GeoDataPlacemark::setPopulation( qint64 population )\n{\n detach();\n p()->m_population = population;\n}\n\nconst QString GeoDataPlacemark::countryCode() const\n{\n return p()->m_countrycode;\n}\n\nvoid GeoDataPlacemark::setCountryCode( const QString &countrycode )\n{\n detach();\n p()->m_countrycode = countrycode;\n}\n\nvoid GeoDataPlacemark::pack( QDataStream& stream ) const\n{\n GeoDataFeature::pack( stream );\n\n stream << p()->m_countrycode;\n stream << p()->m_area;\n stream << p()->m_population;\n\n stream << p()->m_geometry->geometryId();\n p()->m_geometry->pack( stream );\n p()->m_coordinate.pack( stream );\n}\n\n\nvoid GeoDataPlacemark::unpack( QDataStream& stream )\n{\n detach();\n GeoDataFeature::unpack( stream );\n\n stream >> p()->m_countrycode;\n stream >> p()->m_area;\n stream >> p()->m_population;\n\n int geometryId;\n stream >> geometryId;\n switch( geometryId ) {\n case InvalidGeometryId:\n break;\n case GeoDataPointId:\n {\n GeoDataPoint* point = new GeoDataPoint;\n point->unpack( stream );\n delete p()->m_geometry;\n p()->m_geometry = point;\n }\n break;\n case GeoDataLineStringId:\n {\n GeoDataLineString* lineString = new GeoDataLineString;\n lineString->unpack( stream );\n delete p()->m_geometry;\n p()->m_geometry = lineString;\n }\n break;\n case GeoDataLinearRingId:\n {\n GeoDataLinearRing* linearRing = new GeoDataLinearRing;\n linearRing->unpack( stream );\n delete p()->m_geometry;\n p()->m_geometry = linearRing;\n }\n break;\n case GeoDataPolygonId:\n {\n GeoDataPolygon* polygon = new GeoDataPolygon;\n polygon->unpack( stream );\n delete p()->m_geometry;\n p()->m_geometry = polygon;\n }\n break;\n case GeoDataMultiGeometryId:\n {\n GeoDataMultiGeometry* multiGeometry = new GeoDataMultiGeometry;\n multiGeometry->unpack( stream );\n delete p()->m_geometry;\n p()->m_geometry = multiGeometry;\n }\n break;\n case GeoDataModelId:\n break;\n default: break;\n };\n p()->m_coordinate.unpack( stream );\n}\n\n}\n<commit_msg>delete the geometry also when resetting it<commit_after>\/\/\n\/\/ This file is part of the Marble Desktop Globe.\n\/\/\n\/\/ This program is free software licensed under the GNU LGPL. You can\n\/\/ find a copy of this license in LICENSE.txt in the top directory of\n\/\/ the source code.\n\/\/\n\/\/ Copyright 2004-2007 Torsten Rahn <tackat@kde.org>\n\/\/ Copyright 2007 Inge Wallin <ingwa@kde.org>\n\/\/ Copyright 2008-2009 Patrick Spendrin <ps_ml@gmx.de>\n\/\/\n\n\n\/\/ Own\n#include \"GeoDataPlacemark.h\"\n\n\/\/ Private\n#include \"GeoDataPlacemark_p.h\"\n\n\/\/ Qt\n#include <QtCore\/QDataStream>\n#include <QtCore\/QDebug>\n\nnamespace Marble\n{\nGeoDataPlacemark::GeoDataPlacemark()\n : GeoDataFeature( new GeoDataPlacemarkPrivate )\n{\n}\n\nGeoDataPlacemark::GeoDataPlacemark( const GeoDataPlacemark& other )\n: GeoDataFeature( other )\n{\n}\n\nGeoDataPlacemark::GeoDataPlacemark( const GeoDataFeature& other )\n: GeoDataFeature( other )\n{\n}\n\nGeoDataPlacemark::GeoDataPlacemark( const QString& name )\n : GeoDataFeature( name )\n{\n}\n\nGeoDataPlacemark::~GeoDataPlacemark()\n{\n}\n\nbool GeoDataPlacemark::operator==( const GeoDataPlacemark& other ) const\n{ \n return p() == other.p();\n}\n\nGeoDataPlacemarkPrivate* GeoDataPlacemark::p() const\n{\n return static_cast<GeoDataPlacemarkPrivate*>(d);\n}\n\nGeoDataGeometry* GeoDataPlacemark::geometry() const\n{\n if( p()->m_geometry )\n return p()->m_geometry;\n else\n return &( p()->m_coordinate );\n}\n\nGeoDataCoordinates GeoDataPlacemark::coordinate() const\n{\n return static_cast<GeoDataCoordinates>( p()->m_coordinate );\n}\n\nvoid GeoDataPlacemark::coordinate( qreal& lon, qreal& lat, qreal& alt ) const\n{\n p()->m_coordinate.geoCoordinates( lon, lat );\n alt = p()->m_coordinate.altitude();\n}\n\nvoid GeoDataPlacemark::setCoordinate( qreal lon, qreal lat, qreal alt )\n{\n detach();\n p()->m_coordinate = GeoDataPoint( lon, lat, alt );\n}\n\nvoid GeoDataPlacemark::setCoordinate( const GeoDataPoint &point )\n{\n detach();\n p()->m_coordinate = GeoDataPoint( point );\n}\n\nvoid GeoDataPlacemark::setGeometry( const GeoDataPoint& point )\n{\n detach();\n delete p()->m_geometry;\n p()->m_geometry = new GeoDataPoint( point );\n}\n\nvoid GeoDataPlacemark::setGeometry( const GeoDataLineString& point )\n{\n detach();\n delete p()->m_geometry;\n p()->m_geometry = new GeoDataLineString( point );\n}\n\nvoid GeoDataPlacemark::setGeometry( const GeoDataLinearRing& point )\n{\n detach();\n delete p()->m_geometry;\n p()->m_geometry = new GeoDataLinearRing( point );\n}\n\nvoid GeoDataPlacemark::setGeometry( const GeoDataPolygon& point )\n{\n detach();\n delete p()->m_geometry;\n p()->m_geometry = new GeoDataPolygon( point );\n}\n\nvoid GeoDataPlacemark::setGeometry( const GeoDataMultiGeometry& point )\n{\n detach();\n delete p()->m_geometry;\n p()->m_geometry = new GeoDataMultiGeometry( point );\n}\n\nqreal GeoDataPlacemark::area() const\n{\n return p()->m_area;\n}\n\nvoid GeoDataPlacemark::setArea( qreal area )\n{\n detach();\n p()->m_area = area;\n}\n\nqint64 GeoDataPlacemark::population() const\n{\n return p()->m_population;\n}\n\nvoid GeoDataPlacemark::setPopulation( qint64 population )\n{\n detach();\n p()->m_population = population;\n}\n\nconst QString GeoDataPlacemark::countryCode() const\n{\n return p()->m_countrycode;\n}\n\nvoid GeoDataPlacemark::setCountryCode( const QString &countrycode )\n{\n detach();\n p()->m_countrycode = countrycode;\n}\n\nvoid GeoDataPlacemark::pack( QDataStream& stream ) const\n{\n GeoDataFeature::pack( stream );\n\n stream << p()->m_countrycode;\n stream << p()->m_area;\n stream << p()->m_population;\n\n stream << p()->m_geometry->geometryId();\n p()->m_geometry->pack( stream );\n p()->m_coordinate.pack( stream );\n}\n\n\nvoid GeoDataPlacemark::unpack( QDataStream& stream )\n{\n detach();\n GeoDataFeature::unpack( stream );\n\n stream >> p()->m_countrycode;\n stream >> p()->m_area;\n stream >> p()->m_population;\n\n int geometryId;\n stream >> geometryId;\n switch( geometryId ) {\n case InvalidGeometryId:\n break;\n case GeoDataPointId:\n {\n GeoDataPoint* point = new GeoDataPoint;\n point->unpack( stream );\n delete p()->m_geometry;\n p()->m_geometry = point;\n }\n break;\n case GeoDataLineStringId:\n {\n GeoDataLineString* lineString = new GeoDataLineString;\n lineString->unpack( stream );\n delete p()->m_geometry;\n p()->m_geometry = lineString;\n }\n break;\n case GeoDataLinearRingId:\n {\n GeoDataLinearRing* linearRing = new GeoDataLinearRing;\n linearRing->unpack( stream );\n delete p()->m_geometry;\n p()->m_geometry = linearRing;\n }\n break;\n case GeoDataPolygonId:\n {\n GeoDataPolygon* polygon = new GeoDataPolygon;\n polygon->unpack( stream );\n delete p()->m_geometry;\n p()->m_geometry = polygon;\n }\n break;\n case GeoDataMultiGeometryId:\n {\n GeoDataMultiGeometry* multiGeometry = new GeoDataMultiGeometry;\n multiGeometry->unpack( stream );\n delete p()->m_geometry;\n p()->m_geometry = multiGeometry;\n }\n break;\n case GeoDataModelId:\n break;\n default: break;\n };\n p()->m_coordinate.unpack( stream );\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\/idle.h\"\n\n#include \"base\/basictypes.h\"\n\n#if defined(USE_X11)\n#include \"chrome\/browser\/idle_query_x11.h\"\n#endif\n\n#if !defined(OS_CHROMEOS)\n#include \"chrome\/browser\/screensaver_window_finder_x11.h\"\n#endif\n\nvoid CalculateIdleTime(IdleTimeCallback notify) {\n#if defined(USE_X11)\n chrome::IdleQueryX11 idle_query;\n notify.Run(idle_query.IdleTime());\n#endif\n}\n\nbool CheckIdleStateIsLocked() {\n \/\/ Usually the screensaver is used to lock the screen, so we do not need to\n \/\/ check if the workstation is locked.\n#if defined(OS_CHROMEOS)\n return false;\n#else\n return ScreensaverWindowFinder::ScreensaverWindowExists();\n#endif\n}\n<commit_msg>chrome: Check idle state for Ozone platform<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\/idle.h\"\n\n#include \"base\/basictypes.h\"\n\n#if defined(USE_X11)\n#include \"chrome\/browser\/idle_query_x11.h\"\n#endif\n\n#if !defined(OS_CHROMEOS)\n#include \"chrome\/browser\/screensaver_window_finder_x11.h\"\n#endif\n\nvoid CalculateIdleTime(IdleTimeCallback notify) {\n#if defined(USE_X11)\n chrome::IdleQueryX11 idle_query;\n notify.Run(idle_query.IdleTime());\n#endif\n}\n\nbool CheckIdleStateIsLocked() {\n \/\/ Usually the screensaver is used to lock the screen, so we do not need to\n \/\/ check if the workstation is locked.\n#if defined(OS_CHROMEOS)\n return false;\n#elif defined(USE_OZONE)\n return false;\n#else\n return ScreensaverWindowFinder::ScreensaverWindowExists();\n#endif\n}\n<|endoftext|>"} {"text":"<commit_before>\/** \\file Ex7.cpp\n * \\brief This example shows how to set and solve the weak form\n * of the Boussinesq appoximation of the Navier-Stokes Equation\n *\n * \\f{eqnarray*}\n * && \\mathbf{V} \\cdot \\nabla T - \\nabla \\cdot\\alpha \\nabla T = 0 \\\\\n * && \\mathbf{V} \\cdot \\nabla \\mathbf{V} - \\nabla \\cdot \\nu (\\nabla \\mathbf{V} +(\\nabla \\mathbf{V})^T)\n * +\\nabla P = \\beta T \\mathbf{j} \\\\\n * && \\nabla \\cdot \\mathbf{V} = 0\n * \\f}\n * in a unit box domain (in 2D and 3D) with given temperature 0 and 1 on\n * the left and right walls, respectively, and insulated walls elsewhere.\n * \\author Eugenio Aulisa\n *\/\n\n#include \"FemusInit.hpp\"\n#include \"MultiLevelProblem.hpp\"\n#include \"NumericVector.hpp\"\n#include \"VTKWriter.hpp\"\n#include \"GMVWriter.hpp\"\n#include \"NonLinearImplicitSystem.hpp\"\n#include \"adept.h\"\n\n\nusing namespace femus;\n\nbool SetBoundaryCondition(const std::vector < double >& x, const char SolName[], double& value, const int facename, const double time) {\n bool dirichlet = true; \/\/dirichlet\n value = 0.;\n return dirichlet;\n}\n\n\nbool SetRefinementFlag(const std::vector < double >& x, const int& elemgroupnumber, const int& level) {\n\n bool refine = 0;\n\n if (elemgroupnumber == 6 && level < 4) refine = 1;\n\n if (elemgroupnumber == 7 && level < 5) refine = 1;\n\n if (elemgroupnumber == 8 && level < 6) refine = 1;\n\n\/\/ if (elemgroupnumber==6 && level<1) refine=1;\n\/\/ if (elemgroupnumber==7 && level<2) refine=1;\n\/\/ if (elemgroupnumber==8 && level<3) refine=1;\n\n return refine;\n\n}\n\n\n\nvoid AssemblePoisson_AD(MultiLevelProblem& ml_prob); \/\/, unsigned level, const unsigned &levelMax, const bool &assembleMatrix );\n\n\nint main(int argc, char** args) {\n\n \/\/ init Petsc-MPI communicator\n FemusInit mpinit(argc, args, MPI_COMM_WORLD);\n\n \/\/ define multilevel mesh\n MultiLevelMesh mlMsh;\n \/\/ read coarse level mesh and generate finers level meshes\n double scalingFactor = 1.;\n \/\/mlMsh.ReadCoarseMesh(\".\/input\/cube_hex.neu\",\"seventh\",scalingFactor);\n \/\/mlMsh.ReadCoarseMesh(\".\/input\/square_quad.neu\", \"seventh\", scalingFactor);\n mlMsh.ReadCoarseMesh(\".\/input\/quadAMR.neu\", \"seventh\", scalingFactor);\n \/* \"seventh\" is the order of accuracy that is used in the gauss integration scheme\n probably in the furure it is not going to be an argument of this function *\/\n unsigned dim = mlMsh.GetDimension();\n\n\/\/ unsigned numberOfUniformLevels = 3;\n\/\/ unsigned numberOfSelectiveLevels = 0;\n\/\/ mlMsh.RefineMesh(numberOfUniformLevels , numberOfUniformLevels + numberOfSelectiveLevels, NULL);\n\n unsigned numberOfUniformLevels = 4;\n unsigned numberOfSelectiveLevels = 3;\n mlMsh.RefineMesh(numberOfUniformLevels + numberOfSelectiveLevels, numberOfUniformLevels , SetRefinementFlag);\n\n \/\/ erase all the coarse mesh levels\n \/\/mlMsh.EraseCoarseLevels(numberOfUniformLevels - 3);\n\n \/\/ print mesh info\n mlMsh.PrintInfo();\n\n MultiLevelSolution mlSol(&mlMsh);\n\n \/\/ add variables to mlSol\n\n mlSol.AddSolution(\"V\", LAGRANGE, SECOND);\n\n mlSol.AddSolution(\"U\", LAGRANGE, SECOND);\n\n mlSol.Initialize(\"All\");\n\n \/\/ attach the boundary condition function and generate boundary data\n mlSol.AttachSetBoundaryConditionFunction(SetBoundaryCondition);\n\n mlSol.GenerateBdc(\"All\");\n\n \/\/ define the multilevel problem attach the mlSol object to it\n MultiLevelProblem mlProb(&mlSol);\n\n \/\/ add system Poisson in mlProb as a Linear Implicit System\n NonLinearImplicitSystem& system = mlProb.add_system < NonLinearImplicitSystem > (\"Poisson\");\n\n \/\/ add solution \"u\" to system\n system.AddSolutionToSystemPDE(\"U\");\n\n \/\/system.SetMgSmoother(GMRES_SMOOTHER);\n system.SetMgSmoother(ASM_SMOOTHER); \/\/ Additive Swartz Method\n \/\/ attach the assembling function to system\n system.SetAssembleFunction(AssemblePoisson_AD);\n\n system.SetMaxNumberOfNonLinearIterations(10);\n system.SetMaxNumberOfLinearIterations(3);\n system.SetLinearConvergenceTolerance(1.e-12);\n system.SetNonLinearConvergenceTolerance(1.e-8);\n system.SetMgType(F_CYCLE); \/\/ Q1 What's F cycle\n\n system.SetNumberPreSmoothingStep(0); \/\/ Q2 What's Pre (post) smoothing step? Is related to smoothstep?\n system.SetNumberPostSmoothingStep(2);\n \/\/ initilaize and solve the system\n system.init();\n\n system.SetSolverFineGrids(GMRES);\n system.SetPreconditionerFineGrids(ILU_PRECOND);\n system.SetTolerances(1.e-3, 1.e-20, 1.e+50, 5);\n\n system.SetNumberOfSchurVariables(1);\n system.SetElementBlockNumber(4); \n \/\/system.SetDirichletBCsHandling(ELIMINATION); \/\/ Q3 What's BCsHandling?\n \/\/system.solve();\n system.MGsolve();\n\n \/\/ print solutions\n std::vector < std::string > variablesToBePrinted;\n variablesToBePrinted.push_back(\"All\");\n\n VTKWriter vtkIO(&mlSol);\n vtkIO.write(DEFAULT_OUTPUTDIR, \"biquadratic\", variablesToBePrinted);\n\n GMVWriter gmvIO(&mlSol);\n variablesToBePrinted.push_back(\"all\");\n gmvIO.SetDebugOutput(true);\n gmvIO.write(DEFAULT_OUTPUTDIR, \"biquadratic\", variablesToBePrinted);\n\n\n return 0;\n}\n\n\nvoid AssemblePoisson_AD(MultiLevelProblem& ml_prob) {\n \/\/ ml_prob is the global object from\/to where get\/set all the data\n \/\/ level is the level of the PDE system to be assembled\n \/\/ levelMax is the Maximum level of the MultiLevelProblem\n \/\/ assembleMatrix is a flag that tells if only the residual or also the matrix should be assembled\n\n \/\/ call the adept stack object\n adept::Stack& s = FemusInit::_adeptStack;\n\n \/\/ extract pointers to the several objects that we are going to use\n NonLinearImplicitSystem* mlPdeSys = &ml_prob.get_system<NonLinearImplicitSystem> (\"Poisson\"); \/\/ pointer to the linear implicit system named \"Poisson\"\n const unsigned level = mlPdeSys->GetLevelToAssemble();\n\n Mesh* msh = ml_prob._ml_msh->GetLevel(level); \/\/ pointer to the mesh (level) object\n elem* el = msh->el; \/\/ pointer to the elem object in msh (level)\n\n MultiLevelSolution* mlSol = ml_prob._ml_sol; \/\/ pointer to the multilevel solution object\n Solution* sol = ml_prob._ml_sol->GetSolutionLevel(level); \/\/ pointer to the solution (level) object\n\n\n LinearEquationSolver* pdeSys = mlPdeSys->_LinSolver[level]; \/\/ pointer to the equation (level) object\n SparseMatrix* KK = pdeSys->_KK; \/\/ pointer to the global stifness matrix object in pdeSys (level)\n NumericVector* RES = pdeSys->_RES; \/\/ pointer to the global residual vector object in pdeSys (level)\n\n const unsigned dim = msh->GetDimension(); \/\/ get the domain dimension of the problem\n unsigned dim2 = (3 * (dim - 1) + !(dim - 1)); \/\/ dim2 is the number of second order partial derivatives (1,3,6 depending on the dimension)\/\/ Q4 How to get the equation?\n unsigned iproc = msh->processor_id(); \/\/ get the process_id (for parallel computation)\n\n \/\/ reserve memory for the local standar vectors\n const unsigned maxSize = static_cast< unsigned >(ceil(pow(3, dim))); \/\/ conservative: based on line3, quad9, hex27\n\n \/\/solution variable\n unsigned solUIndex;\n solUIndex = mlSol->GetIndex(\"U\"); \/\/ get the position of \"U\" in the ml_sol object = 0\n unsigned solUType = mlSol->GetSolutionType(solUIndex); \/\/ get the finite element type for \"T\"\n\n\n\n unsigned solUPdeIndex;\n solUPdeIndex = mlPdeSys->GetSolPdeIndex(\"U\"); \/\/ get the position of \"U\" in the pdeSys object = 0\n\n std::cout << solUIndex << \" \" << solUPdeIndex << std::endl;\n\n\n vector < adept::adouble > solU; \/\/ local solution\n vector< adept::adouble > aResU; \/\/ local redidual vector\n\n vector < vector < double > > crdX(dim); \/\/ local coordinates\n unsigned crdXType = 2; \/\/ get the finite element type for \"x\", it is always 2 (LAGRANGE QUADRATIC)\n\n solU.reserve(maxSize);\n aResU.reserve(maxSize);\n\n for (unsigned k = 0; k < dim; k++) {\n crdX[k].reserve(maxSize);\n }\n\n vector <double> phi; \/\/ local test function\n vector <double> phi_x; \/\/ local test function first order partial derivatives\n vector <double> phi_xx; \/\/ local test function second order partial derivatives\n\n phi.reserve(maxSize);\n phi_x.reserve(maxSize * dim);\n phi_xx.reserve(maxSize * dim2);\n\n double weight; \/\/ gauss point weight\n\n vector< int > sysDof; \/\/ local to global pdeSys dofs\n sysDof.reserve(maxSize);\n\n vector< double > ResU; \/\/ local residual vector\n ResU.reserve(maxSize);\n\n vector < double > Jac;\n Jac.reserve(maxSize * maxSize);\n\n KK->zero(); \/\/ Set to zero all the entries of the Global Matrix\n\n \/\/ element loop: each process loops only on the elements that owns \/\/ Q5 What's the loop mean(mapping between parallel dof and mesh dof)?\n for (int iel = msh->_elementOffset[iproc]; iel < msh->_elementOffset[iproc + 1]; iel++) {\n\n short unsigned ielGeom = msh->GetElementType(iel); \/\/ element geometry type\n\n unsigned nDofsU = msh->GetElementDofNumber(iel, solUType); \/\/ number of solution element dofs\n unsigned nDofsX = msh->GetElementDofNumber(iel, crdXType); \/\/ number of solution element dofs\n\n \/\/ resize local arrays\n sysDof.resize(nDofsU);\n solU.resize(nDofsU);\n\n for (unsigned k = 0; k < dim; k++) {\n crdX[k].resize(nDofsX);\n }\n\n aResU.assign(nDofsU, 0);\n\n \/\/ local storage of global mapping and solution\n for (unsigned i = 0; i < nDofsU; i++) {\n unsigned solUDof = msh->GetSolutionDof(i, iel, solUType); \/\/ local to global mapping of the solution U\n solU[i] = (*sol->_Sol[solUIndex])(solUDof); \/\/ value of the solution U in the dofs\n sysDof[i] = pdeSys->GetSystemDof(solUIndex, solUPdeIndex, i, iel); \/\/ local to global mapping between solution U and system\n }\n\n \/\/ local storage of coordinates\n for (unsigned i = 0; i < nDofsX; i++) {\n unsigned coordXDof = msh->GetSolutionDof(i, iel, crdXType); \/\/ local to global mapping of the coordinate X[dim]\n\n for (unsigned k = 0; k < dim; k++) {\n crdX[k][i] = (*msh->_topology->_Sol[k])(coordXDof); \/\/ value of the solution X[dim] \/\/ Q6 Why does msh pointer to topology?\n }\n }\n\n s.new_recording();\n\n \/\/ *** Gauss point loop *** \/\/ \n for (unsigned ig = 0; ig < msh->_finiteElement[ielGeom][solUType]->GetGaussPointNumber(); ig++) {\n \/\/ *** get gauss point weight, test function and test function partial derivatives ***\n msh->_finiteElement[ielGeom][solUType]->Jacobian(crdX, ig, weight, phi, phi_x, phi_xx);\n\n adept::adouble solUig = 0; \/\/ solution U in the gauss point\n vector < adept::adouble > gradSolUig(dim, 0.); \/\/ gradient of solution U in the gauss point\n\n for (unsigned i = 0; i < nDofsU; i++) {\n solUig += phi[i] * solU[i];\n\n for (unsigned j = 0; j < dim; j++) {\n gradSolUig[j] += phi_x[i * dim + j] * solU[i]; \/\/ Q7 [i * dim + j]?\n }\n }\n\n double nu = 1.;\n\n \/\/ *** phiU_i loop ***\n for (unsigned i = 0; i < nDofsU; i++) {\n adept::adouble LaplaceU = 0.;\n\n for (unsigned j = 0; j < dim; j++) {\n LaplaceU += nu * phi_x[i * dim + j] * gradSolUig[j];\n }\n\n aResU[i] += (phi[i] - LaplaceU) * weight;\n\t\t\n } \/\/ end phiU_i loop\n } \/\/ end gauss point loop\n\n \/\/ } \/\/ endif single element not refined or fine grid loop\n\n \/\/--------------------------------------------------------------------------------------------------------\n \/\/ Add the local Matrix\/Vector into the global Matrix\/Vector\n\n \/\/copy the value of the adept::adoube aRes in double Res and store them in RES\n ResU.resize(nDofsU); \/\/resize\n\n for (int i = 0; i < nDofsU; i++) {\n ResU[i] = -aResU[i].value();\n }\n\n RES->add_vector_blocked(ResU, sysDof);\n\n \/\/Extarct and store the Jacobian\n\n Jac.resize(nDofsU * nDofsU);\n \/\/ define the dependent variables\n s.dependent(&aResU[0], nDofsU);\n\n \/\/ define the independent variables\n s.independent(&solU[0], nDofsU);\n\n \/\/ get the and store jacobian matrix (row-major)\n s.jacobian(&Jac[0] , true);\n KK->add_matrix_blocked(Jac, sysDof, sysDof);\n\n s.clear_independents();\n s.clear_dependents();\n\n } \/\/end element loop for each process\n\n RES->close();\n\n KK->close();\n\n \/\/ ***************** END ASSEMBLY *******************\n}\n\n\n\n\n<commit_msg>building AMR_ex2, incomplete.<commit_after>\/** \\file Ex7.cpp\n * \\brief This example shows how to set and solve the weak form\n * of the Boussinesq appoximation of the Navier-Stokes Equation\n *\n * \\f{eqnarray*}\n * && \\mathbf{V} \\cdot \\nabla T - \\nabla \\cdot\\alpha \\nabla T = 0 \\\\\n * && \\mathbf{V} \\cdot \\nabla \\mathbf{V} - \\nabla \\cdot \\nu (\\nabla \\mathbf{V} +(\\nabla \\mathbf{V})^T)\n * +\\nabla P = \\beta T \\mathbf{j} \\\\\n * && \\nabla \\cdot \\mathbf{V} = 0\n * \\f}\n * in a unit box domain (in 2D and 3D) with given temperature 0 and 1 on\n * the left and right walls, respectively, and insulated walls elsewhere.\n * \\author Eugenio Aulisa\n *\/\n\/** AMR_ex2\n * Solve\n * \\nabla u = 1\\\\\n * \\nabla v = u\\\\\n * u = 0 on boundary\\\\\n * v = 1 on boundary\n *\/\n\n#include \"FemusInit.hpp\"\n#include \"MultiLevelProblem.hpp\"\n#include \"NumericVector.hpp\"\n#include \"VTKWriter.hpp\"\n#include \"GMVWriter.hpp\"\n#include \"NonLinearImplicitSystem.hpp\"\n#include \"adept.h\"\n\n\nusing namespace femus;\n\nbool SetBoundaryCondition(const std::vector < double >& x, const char SolName[], double& value, const int facename, const double time) {\n bool dirichlet = true; \/\/dirichlet\n if (!strcmp(SolName, \"U\")) {\n value = 0.;\n } else if (!strcmp(SolName, \"V\")) {\n value = 1.;\n\n }\n return dirichlet;\n}\n\n\nbool SetRefinementFlag(const std::vector < double >& x, const int& elemgroupnumber, const int& level) {\n\n bool refine = 0;\n\n if (elemgroupnumber == 6 && level < 4) refine = 1;\n\n if (elemgroupnumber == 7 && level < 5) refine = 1;\n\n if (elemgroupnumber == 8 && level < 6) refine = 1;\n\n\/\/ if (elemgroupnumber==6 && level<1) refine=1;\n\/\/ if (elemgroupnumber==7 && level<2) refine=1;\n\/\/ if (elemgroupnumber==8 && level<3) refine=1;\n\n return refine;\n\n}\n\n\n\nvoid AssemblePoisson_AD(MultiLevelProblem& ml_prob); \/\/, unsigned level, const unsigned &levelMax, const bool &assembleMatrix );\n\n\nint main(int argc, char** args) {\n\n \/\/ init Petsc-MPI communicator\n FemusInit mpinit(argc, args, MPI_COMM_WORLD);\n\n \/\/ define multilevel mesh\n MultiLevelMesh mlMsh;\n \/\/ read coarse level mesh and generate finers level meshes\n double scalingFactor = 1.;\n \/\/mlMsh.ReadCoarseMesh(\".\/input\/cube_hex.neu\",\"seventh\",scalingFactor);\n \/\/mlMsh.ReadCoarseMesh(\".\/input\/square_quad.neu\", \"seventh\", scalingFactor);\n mlMsh.ReadCoarseMesh(\".\/input\/quadAMR.neu\", \"seventh\", scalingFactor);\n \/* \"seventh\" is the order of accuracy that is used in the gauss integration scheme\n probably in the furure it is not going to be an argument of this function *\/\n unsigned dim = mlMsh.GetDimension();\n\n\/\/ unsigned numberOfUniformLevels = 3;\n\/\/ unsigned numberOfSelectiveLevels = 0;\n\/\/ mlMsh.RefineMesh(numberOfUniformLevels , numberOfUniformLevels + numberOfSelectiveLevels, NULL);\n\n unsigned numberOfUniformLevels = 4;\n unsigned numberOfSelectiveLevels = 3;\n mlMsh.RefineMesh(numberOfUniformLevels + numberOfSelectiveLevels, numberOfUniformLevels , SetRefinementFlag);\n\n \/\/ erase all the coarse mesh levels\n \/\/mlMsh.EraseCoarseLevels(numberOfUniformLevels - 3);\n\n \/\/ print mesh info\n mlMsh.PrintInfo();\n\n MultiLevelSolution mlSol(&mlMsh);\n\n \/\/ add variables to mlSol\n\n mlSol.AddSolution(\"V\", LAGRANGE, SECOND);\n\n mlSol.AddSolution(\"U\", LAGRANGE, FIRST);\n\n mlSol.Initialize(\"All\");\n\n \/\/ attach the boundary condition function and generate boundary data\n mlSol.AttachSetBoundaryConditionFunction(SetBoundaryCondition);\n\n mlSol.GenerateBdc(\"All\");\n\n \/\/ define the multilevel problem attach the mlSol object to it\n MultiLevelProblem mlProb(&mlSol);\n\n \/\/ add system Poisson in mlProb as a Linear Implicit System\n NonLinearImplicitSystem& system = mlProb.add_system < NonLinearImplicitSystem > (\"Poisson\");\n\n \/\/ add solution \"u\" to system\n system.AddSolutionToSystemPDE(\"U\");\n system.AddSolutionToSystemPDE(\"V\");\n\n \/\/system.SetMgSmoother(GMRES_SMOOTHER);\n system.SetMgSmoother(ASM_SMOOTHER); \/\/ Additive Swartz Method\n \/\/ attach the assembling function to system\n system.SetAssembleFunction(AssemblePoisson_AD);\n\n system.SetMaxNumberOfNonLinearIterations(10);\n system.SetMaxNumberOfLinearIterations(3);\n system.SetLinearConvergenceTolerance(1.e-12);\n system.SetNonLinearConvergenceTolerance(1.e-8);\n system.SetMgType(F_CYCLE); \n\n system.SetNumberPreSmoothingStep(0); \n system.SetNumberPostSmoothingStep(2);\n \/\/ initilaize and solve the system\n system.init();\n\n system.SetSolverFineGrids(GMRES);\n system.SetPreconditionerFineGrids(ILU_PRECOND);\n system.SetTolerances(1.e-3, 1.e-20, 1.e+50, 5);\n\n system.SetNumberOfSchurVariables(1);\n system.SetElementBlockNumber(4); \n \/\/system.SetDirichletBCsHandling(ELIMINATION); \n \/\/system.solve();\n system.MGsolve();\n\n \/\/ print solutions\n std::vector < std::string > variablesToBePrinted;\n variablesToBePrinted.push_back(\"All\");\n\n VTKWriter vtkIO(&mlSol);\n vtkIO.write(DEFAULT_OUTPUTDIR, \"biquadratic\", variablesToBePrinted);\n\n GMVWriter gmvIO(&mlSol);\n variablesToBePrinted.push_back(\"all\");\n gmvIO.SetDebugOutput(true);\n gmvIO.write(DEFAULT_OUTPUTDIR, \"biquadratic\", variablesToBePrinted);\n\n\n return 0;\n}\n\n\nvoid AssemblePoisson_AD(MultiLevelProblem& ml_prob) {\n \/\/ ml_prob is the global object from\/to where get\/set all the data\n \/\/ level is the level of the PDE system to be assembled\n \/\/ levelMax is the Maximum level of the MultiLevelProblem\n \/\/ assembleMatrix is a flag that tells if only the residual or also the matrix should be assembled\n\n \/\/ call the adept stack object\n adept::Stack& s = FemusInit::_adeptStack;\n\n \/\/ extract pointers to the several objects that we are going to use\n NonLinearImplicitSystem* mlPdeSys = &ml_prob.get_system<NonLinearImplicitSystem> (\"Poisson\"); \/\/ pointer to the linear implicit system named \"Poisson\"\n const unsigned level = mlPdeSys->GetLevelToAssemble();\n\n Mesh* msh = ml_prob._ml_msh->GetLevel(level); \/\/ pointer to the mesh (level) object\n elem* el = msh->el; \/\/ pointer to the elem object in msh (level)\n\n MultiLevelSolution* mlSol = ml_prob._ml_sol; \/\/ pointer to the multilevel solution object\n Solution* sol = ml_prob._ml_sol->GetSolutionLevel(level); \/\/ pointer to the solution (level) object\n\n\n LinearEquationSolver* pdeSys = mlPdeSys->_LinSolver[level]; \/\/ pointer to the equation (level) object\n SparseMatrix* KK = pdeSys->_KK; \/\/ pointer to the global stifness matrix object in pdeSys (level)\n NumericVector* RES = pdeSys->_RES; \/\/ pointer to the global residual vector object in pdeSys (level)\n\n const unsigned dim = msh->GetDimension(); \/\/ get the domain dimension of the problem\n unsigned dim2 = (3 * (dim - 1) + !(dim - 1)); \/\/ dim2 is the number of second order partial derivatives (1,3,6 depending on the dimension)\n unsigned iproc = msh->processor_id(); \/\/ get the process_id (for parallel computation)\n\n \/\/ reserve memory for the local standar vectors\n const unsigned maxSize = static_cast< unsigned >(ceil(pow(3, dim))); \/\/ conservative: based on line3, quad9, hex27\n\n \/\/solution variable\n unsigned solUIndex;\n solUIndex = mlSol->GetIndex(\"U\"); \/\/ get the position of \"U\" in the ml_sol object = 0\n unsigned solUType = mlSol->GetSolutionType(solUIndex); \/\/ get the finite element type for \"T\" \n\n unsigned solUPdeIndex;\n solUPdeIndex = mlPdeSys->GetSolPdeIndex(\"U\"); \/\/ get the position of \"U\" in the pdeSys object = 0\n \n std::cout << solUIndex << \" \" << solUPdeIndex << std::endl;\n \n vector < adept::adouble > solU; \/\/ local solution\n vector< adept::adouble > aResU; \/\/ local redidual vector\n \n unsigned solVIndex;\n solVIndex = mlSol->GetIndex(\"V\"); \n unsigned solVType = mlSol->GetSolutionType(solVIndex);\n \n unsigned solVPdeIndex;\n solVPdeIndex = mlPdeSys->GetSolPdeIndex(\"V\");\n \n std::cout << solVIndex << \" \" << solVPdeIndex << std::endl;\n \n vector < adept::adouble > solV; \/\/ local solution\n vector< adept::adouble > aResV; \/\/ local redidual vector\n\n vector < vector < double > > crdX(dim); \/\/ local coordinates\n unsigned crdXType = 2; \/\/ get the finite element type for \"x\", it is always 2 (LAGRANGE QUADRATIC)\n\n solU.reserve(maxSize);\n aResU.reserve(maxSize);\n \n solV.reserve(maxSize);\n aResV.reserve(maxSize);\n\n for (unsigned k = 0; k < dim; k++) {\n crdX[k].reserve(maxSize);\n }\n\n vector <double> phi; \/\/ local test function\n vector <double> phi_x; \/\/ local test function first order partial derivatives\n vector <double> phi_xx; \/\/ local test function second order partial derivatives\n\n phi.reserve(maxSize);\n phi_x.reserve(maxSize * dim);\n phi_xx.reserve(maxSize * dim2);\n\n vector <double> phiV; \/\/ local test function\n vector <double> phiV_x; \/\/ local test function first order partial derivatives\n vector <double> phiV_xx; \/\/ local test function second order partial derivatives\n\n phiV.reserve(maxSize);\n phiV_x.reserve(maxSize * dim);\n phiV_xx.reserve(maxSize * dim2);\n \n double weight; \/\/ gauss point weight\n\n vector< int > sysDof; \/\/ local to global pdeSys dofs\n sysDof.reserve(maxSize);\n\n vector< double > Res; \/\/ local residual vector\n Res.reserve(maxSize);\n\n vector < double > Jac;\n Jac.reserve(maxSize * maxSize);\n\n KK->zero(); \/\/ Set to zero all the entries of the Global Matrix\n\n \/\/ element loop: each process loops only on the elements that owns \n for (int iel = msh->_elementOffset[iproc]; iel < msh->_elementOffset[iproc + 1]; iel++) {\n\n short unsigned ielGeom = msh->GetElementType(iel); \/\/ element geometry type\n\n unsigned nDofsU = msh->GetElementDofNumber(iel, solUType); \/\/ number of solution element dofs\n unsigned nDofsX = msh->GetElementDofNumber(iel, crdXType); \/\/ number of solution element dofs\n unsigned nDofsV = msh->GetElementDofNumber(iel, solVType);\n \/\/ resize local arrays\n sysDof.resize(nDofsU);\n solU.resize(nDofsU);\n \n sysDof.resize(nDofsV);\n solU.resize(nDofsV);\n\n for (unsigned k = 0; k < dim; k++) {\n crdX[k].resize(nDofsX);\n }\n\n aResU.assign(nDofsU, 0);\n \n aResV.assign(nDofsV, 0);\n\n \/\/ local storage of global mapping and solution\n for (unsigned i = 0; i < nDofsU; i++) {\n unsigned solUDof = msh->GetSolutionDof(i, iel, solUType); \/\/ local to global mapping of the solution U\n solU[i] = (*sol->_Sol[solUIndex])(solUDof); \/\/ value of the solution U in the dofs\n sysDof[i] = pdeSys->GetSystemDof(solUIndex, solUPdeIndex, i, iel); \/\/ local to global mapping between solution U and system\n }\n \n for (unsigned i = 0; i < nDofsV; i++) {\n unsigned solVDof = msh->GetSolutionDof(i, iel, solVType); \n solV[i] = (*sol->_Sol[solVIndex])(solVDof); \n sysDof[i+nDofsU] = pdeSys->GetSystemDof(solVIndex, solVPdeIndex, i, iel); \n }\n\n \/\/ local storage of coordinates\n for (unsigned i = 0; i < nDofsX; i++) {\n unsigned coordXDof = msh->GetSolutionDof(i, iel, crdXType); \/\/ local to global mapping of the coordinate X[dim]\n\n for (unsigned k = 0; k < dim; k++) {\n crdX[k][i] = (*msh->_topology->_Sol[k])(coordXDof); \/\/ value of the solution X[dim] \n }\n }\n\n s.new_recording();\n\n \/\/ *** Gauss point loop *** \/\/ \n for (unsigned ig = 0; ig < msh->_finiteElement[ielGeom][solUType]->GetGaussPointNumber(); ig++) {\n \/\/ *** get gauss point weight, test function and test function partial derivatives ***\n msh->_finiteElement[ielGeom][solUType]->Jacobian(crdX, ig, weight, phi, phi_x, phi_xx);\n msh->_finiteElement[ielGeom][solVType]->Jacobian(crdX, ig, weight, phiV, phiV_x, phiV_xx);\n \n adept::adouble solUig = 0; \/\/ solution U in the gauss point\n vector < adept::adouble > gradSolUig(dim, 0.); \/\/ gradient of solution U in the gauss point\n\n adept::adouble solVig = 0; \/\/ solution V in the gauss point\n vector < adept::adouble > gradSolVig(dim, 0.); \/\/ gradient of solution U in the gauss point\n\n for (unsigned i = 0; i < nDofsU; i++) {\n solUig += phi[i] * solU[i];\n\n for (unsigned j = 0; j < dim; j++) {\n gradSolUig[j] += phi_x[i * dim + j] * solU[i]; \n }\n }\n\n for (unsigned i = 0; i < nDofsV; i++) {\n solVig += phiV[i] * solV[i];\n\n for (unsigned j = 0; j < dim; j++) {\n gradSolVig[j] += phiV_x[i * dim + j] * solV[i]; \n }\n }\n double nu = 1.;\n\n \/\/ *** phiU_i loop ***\n for (unsigned i = 0; i < nDofsU; i++) {\n adept::adouble LaplaceU = 0.;\n\n for (unsigned j = 0; j < dim; j++) {\n LaplaceU += nu * phi_x[i * dim + j] * gradSolUig[j];\n }\n\n aResU[i] += (phi[i] - LaplaceU) * weight;\n\t\t\n } \/\/ end phiU_i loop\n \n for (unsigned i = 0; i < nDofsV; i++) {\n adept::adouble LaplaceV = 0.;\n\n for (unsigned j = 0; j < dim; j++) {\n LaplaceV += nu * phiV_x[i * dim + j] * gradSolVig[j];\n }\n\n aResV[i] += (phiV[i]*solU[i] - LaplaceV) * weight;\n\t\t\n } \/\/ end phiV_i loop\n \n } \/\/ end gauss point loop\n\n \n\n\n \/\/ } \/\/ endif single element not refined or fine grid loop\n\n \/\/--------------------------------------------------------------------------------------------------------\n \/\/ Add the local Matrix\/Vector into the global Matrix\/Vector\n \n \n \n \/\/copy the value of the adept::adoube aRes in double Res and store them in RES\n Res.resize(nDofsU*2); \/\/resize\n\n for (int i = 0; i < nDofsU; i++) {\n Res[i] = -aResU[i].value();\n }\n\n for (int i = 0; i < nDofsV; i++) {\n Res[i+nDofsU] = -aResV[i].value();\n }\n \n RES->add_vector_blocked(Res, sysDof);\n\n \/\/Extarct and store the Jacobian\n\n Jac.resize(nDofsU * nDofsU);\n \/\/ define the dependent variables\n s.dependent(&aResU[0], nDofsU);\n\n \/\/ define the independent variables\n s.independent(&solU[0], nDofsU);\n\n \/\/ get the and store jacobian matrix (row-major)\n s.jacobian(&Jac[0] , true);\n KK->add_matrix_blocked(Jac, sysDof, sysDof);\n\n s.clear_independents();\n s.clear_dependents();\n\n } \/\/end element loop for each process\n\n RES->close();\n\n KK->close();\n\n \/\/ ***************** END ASSEMBLY *******************\n}<|endoftext|>"} {"text":"<commit_before>\r\n#include \"CAssetManager.h\"\r\n\r\n\r\nnamespace ion\r\n{\r\n\r\n\tvoid CAssetManager::Init(CGraphicsAPI * GraphicsAPI)\r\n\t{}\r\n\r\n\tSharedPointer<Graphics::IShaderProgram> CAssetManager::LoadShader(string const & Name)\r\n\t{\r\n\t\tif (! GraphicsAPI)\r\n\t\t{\r\n\t\t\tLog::Error(\"CAssetManager being used without being initialized, Shader '%s' will not be loaded.\", Name);\r\n\t\t\treturn nullptr;\r\n\t\t}\r\n\r\n\t\tfor (string AssetPath : AssetPaths)\r\n\t\t{\r\n\t\t\tif (! File::Exists(AssetPath + ShaderPath + Name + \".vert\"))\r\n\t\t\t{\r\n\t\t\t\tcontinue;\r\n\t\t\t}\r\n\r\n\t\t\tSharedPointer<Graphics::IVertexShader> VertexShader = GraphicsAPI->CreateVertexShaderFromFile(AssetPath + ShaderPath + Name + \".vert\");\r\n\t\t\tSharedPointer<Graphics::IPixelShader> PixelShader = GraphicsAPI->CreatePixelShaderFromFile(AssetPath + ShaderPath + Name + \".frag\");\r\n\r\n\t\t\tif (! VertexShader)\r\n\t\t\t{\r\n\t\t\t\tLog::Error(\"Failed to compile vertex shader '%s'\", Name);\r\n\t\t\t\treturn nullptr;\r\n\t\t\t}\r\n\r\n\t\t\tif (! PixelShader)\r\n\t\t\t{\r\n\t\t\t\tLog::Error(\"Failed to compile pixel shader '%s'\", Name);\r\n\t\t\t\treturn nullptr;\r\n\t\t\t}\r\n\r\n\t\t\tSharedPointer<Graphics::IShaderProgram> ShaderProgram = GraphicsAPI->CreateShaderProgram();\r\n\t\t\tShaderProgram->SetVertexStage(VertexShader);\r\n\t\t\tShaderProgram->SetPixelStage(PixelShader);\r\n\r\n\t\t\treturn ShaderProgram;\r\n\t\t}\r\n\r\n\t\tLog::Error(\"Cannot find shader file in any asset directory: '%s'\", Name);\r\n\t\treturn nullptr;\r\n\t}\r\n\r\n\tSharedPointer<Graphics::ITexture2D> CAssetManager::LoadTexture(string const & FileName, Graphics::ITexture::EMipMaps const MipMaps)\r\n\t{\r\n\t\tif (! GraphicsAPI)\r\n\t\t{\r\n\t\t\tLog::Error(\"CAssetManager being used without being initialized, Texture '%s' will not be loaded.\", FileName);\r\n\t\t\treturn nullptr;\r\n\t\t}\r\n\r\n\t\tfor (string AssetPath : AssetPaths)\r\n\t\t{\r\n\t\t\tif (! File::Exists(AssetPath + TexturePath + FileName))\r\n\t\t\t{\r\n\t\t\t\tcontinue;\r\n\t\t\t}\r\n\r\n\t\t\tCImage * Image = CImage::Load(AssetPath + TexturePath + FileName);\r\n\t\t\tif (Image)\r\n\t\t\t{\r\n\t\t\t\treturn GraphicsAPI->CreateTexture2D(Image, MipMaps);\r\n\t\t\t}\r\n\t\t\telse\r\n\t\t\t{\r\n\t\t\t\treturn nullptr;\r\n\t\t\t}\r\n\t\t}\r\n\r\n\t\tLog::Error(\"Cannot find image file in any asset directory: '%s'\", FileName);\r\n\t\treturn nullptr;\r\n\t}\r\n\r\n\tSharedPointer<Graphics::ITexture3D> CAssetManager::Load3DTexture(const std::vector<string> & FileNames, Graphics::ITexture::EMipMaps const MipMaps)\r\n\t{\r\n\t\tif (! GraphicsAPI)\r\n\t\t{\r\n\t\t\tLog::Error(\"CAssetManager being used without being initialized, Textures will not be loaded\");\r\n\t\t\treturn nullptr;\r\n\t\t}\r\n\t\tstd::vector<CImage *> ImgArr;\r\n\t\tvec2u setSize(0,0);\r\n\t\t\r\n\r\n\t\tfor(string FileName : FileNames)\r\n\t\t{\r\n\t\t\tfor (string AssetPath : AssetPaths)\r\n\t\t\t{\r\n\t\t\t\tif (! File::Exists(AssetPath + TexturePath + FileName))\r\n\t\t\t\t{\r\n\t\t\t\t\tcontinue;\r\n\t\t\t\t}\r\n\r\n\t\t\t\tCImage * Image = CImage::Load(AssetPath + TexturePath + FileName);\r\n\r\n\t\t\t\tif (Image)\r\n\t\t\t\t{\r\n\t\t\t\t\tif(setSize[0] == 0)\r\n\t\t\t\t\t{\r\n\t\t\t\t\t\tsetSize = Image->GetSize();\r\n\t\t\t\t\t}\r\n\t\t\t\t\telse\r\n\t\t\t\t\t{\r\n\t\t\t\t\t\tassert(Image->GetSize() == setSize);\r\n\t\t\t\t\t}\r\n\t\t\t\t\tImgArr.push_back(Image);\r\n\t\t\t\t}\r\n\t\t\t\telse\r\n\t\t\t\t{\r\n\t\t\t\t\treturn nullptr;\r\n\t\t\t\t\tLog::Error(\"Cannot find image file in any asset directory: '%s'\", FileName);\r\n\r\n\t\t\t\t}\r\n\t\t\t}\r\n\t\t}\r\n\t\tGraphics::ITexture::EFormatComponents Format = Graphics::ITexture::EFormatComponents::R;\r\n\r\n\t\tswitch (ImgArr[0]->GetChannels())\r\n\t\t{\r\n\t\tcase 2:\r\n\t\t\tFormat = Graphics::ITexture::EFormatComponents::RG;\r\n\t\t\tbreak;\r\n\t\tcase 3:\r\n\t\t\tFormat = Graphics::ITexture::EFormatComponents::RGB;\r\n\t\t\tbreak;\r\n\t\tcase 4:\r\n\t\t\tFormat = Graphics::ITexture::EFormatComponents::RGBA;\r\n\t\t\tbreak;\r\n\t\t}\r\n\t\tvec3u size3D(setSize[0],setSize[1],ImgArr.size());\r\n\t\t\/\/Load and combine data\r\n\t\t\r\n\t\tSharedPointer<Graphics::ITexture3D> Texture3D = GraphicsAPI->CreateTexture3D(size3D,MipMaps,Format,Graphics::ITexture::EInternalFormatType::Fix8);\r\n\t\tfor(int i = 0; i < ImgArr.size(); i++)\r\n\t\t{\r\n\t\t\tCImage * ImagePtr = ImgArr[i];\r\n\t\t\tTexture3D->UploadSubRegion(\r\n\t\t\t\tImagePtr->GetData(),\r\n\t\t\t\tvec3u(0,0,i),\r\n\t\t\t\tvec3u(setSize[0],setSize[1],1),\r\n\t\t\t\tFormat,\r\n\t\t\t\tGraphics::EScalarType::UnsignedInt8);\r\n\t\t}\r\n\t\treturn Texture3D;\r\n\t}\r\n\r\n\tSharedPointer<Graphics::ITextureCubeMap> CAssetManager::LoadCubeMapTexture(string const & FileNameLeft, string const & FileNameRight, string const & FileNameUp, string const & FileNameDown, string const & FileNameFront, string const & FileNameBack, Graphics::ITexture::EMipMaps const MipMaps)\r\n\t{\r\n\t\tif (! GraphicsAPI)\r\n\t\t{\r\n\t\t\tLog::Error(\"CAssetManager being used without being initialized, Texture '%s' etc. will not be loaded.\", FileNameLeft);\r\n\t\t\treturn nullptr;\r\n\t\t}\r\n\r\n\t\tvector<string> FileNames;\r\n\t\tFileNames.push_back(FileNameLeft);\r\n\t\tFileNames.push_back(FileNameRight);\r\n\t\tFileNames.push_back(FileNameUp);\r\n\t\tFileNames.push_back(FileNameDown);\r\n\t\tFileNames.push_back(FileNameFront);\r\n\t\tFileNames.push_back(FileNameBack);\r\n\r\n\t\tvector<CImage *> Images;\r\n\t\tImages.resize(6, nullptr);\r\n\r\n\t\tfor (int i = 0; i < 6; ++ i)\r\n\t\t{\r\n\t\t\tfor (string AssetPath : AssetPaths)\r\n\t\t\t{\r\n\t\t\t\tif (! File::Exists(AssetPath + TexturePath + FileNames[i]))\r\n\t\t\t\t{\r\n\t\t\t\t\tcontinue;\r\n\t\t\t\t}\r\n\r\n\t\t\t\tCImage * Image = CImage::Load(AssetPath + TexturePath + FileNames[i]);\r\n\t\t\t\tif (Image)\r\n\t\t\t\t{\r\n\t\t\t\t\tImage->FlipY();\r\n\t\t\t\t\tImages[i] = Image;\r\n\t\t\t\t\tbreak;\r\n\t\t\t\t}\r\n\t\t\t\telse\r\n\t\t\t\t{\r\n\t\t\t\t\tLog::Error(\"Failed to open image: '%s'\", FileNames[i]);\r\n\t\t\t\t\treturn nullptr;\r\n\t\t\t\t}\r\n\t\t\t}\r\n\r\n\t\t\tif (! Images[i])\r\n\t\t\t{\r\n\t\t\t\tLog::Error(\"Cannot find image file in any asset directory: '%s'\", FileNames[i]);\r\n\t\t\t\treturn nullptr;\r\n\t\t\t}\r\n\t\t}\r\n\r\n\t\treturn GraphicsAPI->CreateTextureCubeMap(Images, MipMaps);\r\n\t}\r\n\r\n\tScene::CSimpleMesh * CAssetManager::LoadMesh(string const & FileName)\r\n\t{\r\n\t\tif (! GraphicsAPI)\r\n\t\t{\r\n\t\t\tLog::Error(\"CAssetManager being used without being initialized, Texture '%s' will not be loaded.\", FileName);\r\n\t\t\treturn nullptr;\r\n\t\t}\r\n\r\n\t\tfor (string AssetPath : AssetPaths)\r\n\t\t{\r\n\t\t\tif (! File::Exists(AssetPath + MeshPath + FileName))\r\n\t\t\t{\r\n\t\t\t\tcontinue;\r\n\t\t\t}\r\n\r\n\t\t\tvector<Scene::CSimpleMesh *> Shapes = Scene::CGeometryCreator::LoadOBJFile(AssetPath + MeshPath + FileName, AssetPath + MeshPath);\r\n\r\n\t\t\tif (Shapes.size() == 0)\r\n\t\t\t{\r\n\t\t\t\tLog::Error(\"Failed to load mesh: %s\", FileName);\r\n\t\t\t\treturn nullptr;\r\n\t\t\t}\r\n\t\t\telse if (Shapes.size() > 1)\r\n\t\t\t{\r\n\t\t\t\tLog::Error(\"Mesh contains %d shapes but only one was expected: %s\", Shapes.size(), FileName);\r\n\t\t\t}\r\n\r\n\t\t\treturn Shapes[0];\r\n\t\t}\r\n\r\n\t\tLog::Error(\"Cannot find mesh file in any asset directory: '%s'\", FileName);\r\n\t\treturn nullptr;\r\n\t}\r\n\r\n\tvector<Scene::CSimpleMesh *> CAssetManager::LoadMeshes(string const & FileName)\r\n\t{\r\n\t\tvector<Scene::CSimpleMesh *> Meshes;\r\n\r\n\t\tif (! GraphicsAPI)\r\n\t\t{\r\n\t\t\tLog::Error(\"CAssetManager being used without being initialized, Texture '%s' will not be loaded.\", FileName);\r\n\t\t\treturn Meshes;\r\n\t\t}\r\n\r\n\t\tfor (string AssetPath : AssetPaths)\r\n\t\t{\r\n\t\t\tif (! File::Exists(AssetPath + MeshPath + FileName))\r\n\t\t\t{\r\n\t\t\t\tcontinue;\r\n\t\t\t}\r\n\r\n\t\t\tMeshes = Scene::CGeometryCreator::LoadOBJFile(AssetPath + MeshPath + FileName, AssetPath + MeshPath);\r\n\r\n\t\t\tif (Meshes.size() == 0)\r\n\t\t\t{\r\n\t\t\t\tLog::Error(\"Failed to load mesh: %s\", FileName);\r\n\t\t\t\treturn Meshes;\r\n\t\t\t}\r\n\r\n\t\t\treturn Meshes;\r\n\t\t}\r\n\r\n\t\tLog::Error(\"Cannot find mesh file in any asset directory: '%s'\", FileName);\r\n\t\treturn Meshes;\r\n\t}\r\n\r\n\tvoid CAssetManager::AddAssetPath(string const & Path)\r\n\t{\r\n\t\tAssetPaths.push_back(Path + \"\/\");\r\n\t}\r\n\r\n\tvoid CAssetManager::SetTexturePath(string const & Path)\r\n\t{\r\n\t\tTexturePath = Path + \"\/\";\r\n\t}\r\n\r\n\tvoid CAssetManager::SetShaderPath(string const & Path)\r\n\t{\r\n\t\tShaderPath = Path + \"\/\";\r\n\t}\r\n\r\n\tvoid CAssetManager::SetMeshPath(string const & Path)\r\n\t{\r\n\t\tMeshPath = Path + \"\/\";\r\n\t}\r\n\r\n}\r\n<commit_msg>[ionApplication] Fix compiler warning<commit_after>\r\n#include \"CAssetManager.h\"\r\n\r\n\r\nnamespace ion\r\n{\r\n\r\n\tvoid CAssetManager::Init(CGraphicsAPI * GraphicsAPI)\r\n\t{}\r\n\r\n\tSharedPointer<Graphics::IShaderProgram> CAssetManager::LoadShader(string const & Name)\r\n\t{\r\n\t\tif (! GraphicsAPI)\r\n\t\t{\r\n\t\t\tLog::Error(\"CAssetManager being used without being initialized, Shader '%s' will not be loaded.\", Name);\r\n\t\t\treturn nullptr;\r\n\t\t}\r\n\r\n\t\tfor (string AssetPath : AssetPaths)\r\n\t\t{\r\n\t\t\tif (! File::Exists(AssetPath + ShaderPath + Name + \".vert\"))\r\n\t\t\t{\r\n\t\t\t\tcontinue;\r\n\t\t\t}\r\n\r\n\t\t\tSharedPointer<Graphics::IVertexShader> VertexShader = GraphicsAPI->CreateVertexShaderFromFile(AssetPath + ShaderPath + Name + \".vert\");\r\n\t\t\tSharedPointer<Graphics::IPixelShader> PixelShader = GraphicsAPI->CreatePixelShaderFromFile(AssetPath + ShaderPath + Name + \".frag\");\r\n\r\n\t\t\tif (! VertexShader)\r\n\t\t\t{\r\n\t\t\t\tLog::Error(\"Failed to compile vertex shader '%s'\", Name);\r\n\t\t\t\treturn nullptr;\r\n\t\t\t}\r\n\r\n\t\t\tif (! PixelShader)\r\n\t\t\t{\r\n\t\t\t\tLog::Error(\"Failed to compile pixel shader '%s'\", Name);\r\n\t\t\t\treturn nullptr;\r\n\t\t\t}\r\n\r\n\t\t\tSharedPointer<Graphics::IShaderProgram> ShaderProgram = GraphicsAPI->CreateShaderProgram();\r\n\t\t\tShaderProgram->SetVertexStage(VertexShader);\r\n\t\t\tShaderProgram->SetPixelStage(PixelShader);\r\n\r\n\t\t\treturn ShaderProgram;\r\n\t\t}\r\n\r\n\t\tLog::Error(\"Cannot find shader file in any asset directory: '%s'\", Name);\r\n\t\treturn nullptr;\r\n\t}\r\n\r\n\tSharedPointer<Graphics::ITexture2D> CAssetManager::LoadTexture(string const & FileName, Graphics::ITexture::EMipMaps const MipMaps)\r\n\t{\r\n\t\tif (! GraphicsAPI)\r\n\t\t{\r\n\t\t\tLog::Error(\"CAssetManager being used without being initialized, Texture '%s' will not be loaded.\", FileName);\r\n\t\t\treturn nullptr;\r\n\t\t}\r\n\r\n\t\tfor (string AssetPath : AssetPaths)\r\n\t\t{\r\n\t\t\tif (! File::Exists(AssetPath + TexturePath + FileName))\r\n\t\t\t{\r\n\t\t\t\tcontinue;\r\n\t\t\t}\r\n\r\n\t\t\tCImage * Image = CImage::Load(AssetPath + TexturePath + FileName);\r\n\t\t\tif (Image)\r\n\t\t\t{\r\n\t\t\t\treturn GraphicsAPI->CreateTexture2D(Image, MipMaps);\r\n\t\t\t}\r\n\t\t\telse\r\n\t\t\t{\r\n\t\t\t\treturn nullptr;\r\n\t\t\t}\r\n\t\t}\r\n\r\n\t\tLog::Error(\"Cannot find image file in any asset directory: '%s'\", FileName);\r\n\t\treturn nullptr;\r\n\t}\r\n\r\n\tSharedPointer<Graphics::ITexture3D> CAssetManager::Load3DTexture(const std::vector<string> & FileNames, Graphics::ITexture::EMipMaps const MipMaps)\r\n\t{\r\n\t\tif (! GraphicsAPI)\r\n\t\t{\r\n\t\t\tLog::Error(\"CAssetManager being used without being initialized, Textures will not be loaded\");\r\n\t\t\treturn nullptr;\r\n\t\t}\r\n\t\tstd::vector<CImage *> ImgArr;\r\n\t\tvec2u setSize(0,0);\r\n\t\t\r\n\r\n\t\tfor(string FileName : FileNames)\r\n\t\t{\r\n\t\t\tfor (string AssetPath : AssetPaths)\r\n\t\t\t{\r\n\t\t\t\tif (! File::Exists(AssetPath + TexturePath + FileName))\r\n\t\t\t\t{\r\n\t\t\t\t\tcontinue;\r\n\t\t\t\t}\r\n\r\n\t\t\t\tCImage * Image = CImage::Load(AssetPath + TexturePath + FileName);\r\n\r\n\t\t\t\tif (Image)\r\n\t\t\t\t{\r\n\t\t\t\t\tif(setSize[0] == 0)\r\n\t\t\t\t\t{\r\n\t\t\t\t\t\tsetSize = Image->GetSize();\r\n\t\t\t\t\t}\r\n\t\t\t\t\telse\r\n\t\t\t\t\t{\r\n\t\t\t\t\t\tassert(Image->GetSize() == setSize);\r\n\t\t\t\t\t}\r\n\t\t\t\t\tImgArr.push_back(Image);\r\n\t\t\t\t}\r\n\t\t\t\telse\r\n\t\t\t\t{\r\n\t\t\t\t\treturn nullptr;\r\n\t\t\t\t\tLog::Error(\"Cannot find image file in any asset directory: '%s'\", FileName);\r\n\r\n\t\t\t\t}\r\n\t\t\t}\r\n\t\t}\r\n\t\tGraphics::ITexture::EFormatComponents Format = Graphics::ITexture::EFormatComponents::R;\r\n\r\n\t\tswitch (ImgArr[0]->GetChannels())\r\n\t\t{\r\n\t\tcase 2:\r\n\t\t\tFormat = Graphics::ITexture::EFormatComponents::RG;\r\n\t\t\tbreak;\r\n\t\tcase 3:\r\n\t\t\tFormat = Graphics::ITexture::EFormatComponents::RGB;\r\n\t\t\tbreak;\r\n\t\tcase 4:\r\n\t\t\tFormat = Graphics::ITexture::EFormatComponents::RGBA;\r\n\t\t\tbreak;\r\n\t\t}\r\n\t\tvec3u size3D(setSize[0], setSize[1], (uint) ImgArr.size());\r\n\t\t\/\/Load and combine data\r\n\t\t\r\n\t\tSharedPointer<Graphics::ITexture3D> Texture3D = GraphicsAPI->CreateTexture3D(size3D,MipMaps,Format,Graphics::ITexture::EInternalFormatType::Fix8);\r\n\t\tfor(int i = 0; i < ImgArr.size(); i++)\r\n\t\t{\r\n\t\t\tCImage * ImagePtr = ImgArr[i];\r\n\t\t\tTexture3D->UploadSubRegion(\r\n\t\t\t\tImagePtr->GetData(),\r\n\t\t\t\tvec3u(0,0,i),\r\n\t\t\t\tvec3u(setSize[0],setSize[1],1),\r\n\t\t\t\tFormat,\r\n\t\t\t\tGraphics::EScalarType::UnsignedInt8);\r\n\t\t}\r\n\t\treturn Texture3D;\r\n\t}\r\n\r\n\tSharedPointer<Graphics::ITextureCubeMap> CAssetManager::LoadCubeMapTexture(string const & FileNameLeft, string const & FileNameRight, string const & FileNameUp, string const & FileNameDown, string const & FileNameFront, string const & FileNameBack, Graphics::ITexture::EMipMaps const MipMaps)\r\n\t{\r\n\t\tif (! GraphicsAPI)\r\n\t\t{\r\n\t\t\tLog::Error(\"CAssetManager being used without being initialized, Texture '%s' etc. will not be loaded.\", FileNameLeft);\r\n\t\t\treturn nullptr;\r\n\t\t}\r\n\r\n\t\tvector<string> FileNames;\r\n\t\tFileNames.push_back(FileNameLeft);\r\n\t\tFileNames.push_back(FileNameRight);\r\n\t\tFileNames.push_back(FileNameUp);\r\n\t\tFileNames.push_back(FileNameDown);\r\n\t\tFileNames.push_back(FileNameFront);\r\n\t\tFileNames.push_back(FileNameBack);\r\n\r\n\t\tvector<CImage *> Images;\r\n\t\tImages.resize(6, nullptr);\r\n\r\n\t\tfor (int i = 0; i < 6; ++ i)\r\n\t\t{\r\n\t\t\tfor (string AssetPath : AssetPaths)\r\n\t\t\t{\r\n\t\t\t\tif (! File::Exists(AssetPath + TexturePath + FileNames[i]))\r\n\t\t\t\t{\r\n\t\t\t\t\tcontinue;\r\n\t\t\t\t}\r\n\r\n\t\t\t\tCImage * Image = CImage::Load(AssetPath + TexturePath + FileNames[i]);\r\n\t\t\t\tif (Image)\r\n\t\t\t\t{\r\n\t\t\t\t\tImage->FlipY();\r\n\t\t\t\t\tImages[i] = Image;\r\n\t\t\t\t\tbreak;\r\n\t\t\t\t}\r\n\t\t\t\telse\r\n\t\t\t\t{\r\n\t\t\t\t\tLog::Error(\"Failed to open image: '%s'\", FileNames[i]);\r\n\t\t\t\t\treturn nullptr;\r\n\t\t\t\t}\r\n\t\t\t}\r\n\r\n\t\t\tif (! Images[i])\r\n\t\t\t{\r\n\t\t\t\tLog::Error(\"Cannot find image file in any asset directory: '%s'\", FileNames[i]);\r\n\t\t\t\treturn nullptr;\r\n\t\t\t}\r\n\t\t}\r\n\r\n\t\treturn GraphicsAPI->CreateTextureCubeMap(Images, MipMaps);\r\n\t}\r\n\r\n\tScene::CSimpleMesh * CAssetManager::LoadMesh(string const & FileName)\r\n\t{\r\n\t\tif (! GraphicsAPI)\r\n\t\t{\r\n\t\t\tLog::Error(\"CAssetManager being used without being initialized, Texture '%s' will not be loaded.\", FileName);\r\n\t\t\treturn nullptr;\r\n\t\t}\r\n\r\n\t\tfor (string AssetPath : AssetPaths)\r\n\t\t{\r\n\t\t\tif (! File::Exists(AssetPath + MeshPath + FileName))\r\n\t\t\t{\r\n\t\t\t\tcontinue;\r\n\t\t\t}\r\n\r\n\t\t\tvector<Scene::CSimpleMesh *> Shapes = Scene::CGeometryCreator::LoadOBJFile(AssetPath + MeshPath + FileName, AssetPath + MeshPath);\r\n\r\n\t\t\tif (Shapes.size() == 0)\r\n\t\t\t{\r\n\t\t\t\tLog::Error(\"Failed to load mesh: %s\", FileName);\r\n\t\t\t\treturn nullptr;\r\n\t\t\t}\r\n\t\t\telse if (Shapes.size() > 1)\r\n\t\t\t{\r\n\t\t\t\tLog::Error(\"Mesh contains %d shapes but only one was expected: %s\", Shapes.size(), FileName);\r\n\t\t\t}\r\n\r\n\t\t\treturn Shapes[0];\r\n\t\t}\r\n\r\n\t\tLog::Error(\"Cannot find mesh file in any asset directory: '%s'\", FileName);\r\n\t\treturn nullptr;\r\n\t}\r\n\r\n\tvector<Scene::CSimpleMesh *> CAssetManager::LoadMeshes(string const & FileName)\r\n\t{\r\n\t\tvector<Scene::CSimpleMesh *> Meshes;\r\n\r\n\t\tif (! GraphicsAPI)\r\n\t\t{\r\n\t\t\tLog::Error(\"CAssetManager being used without being initialized, Texture '%s' will not be loaded.\", FileName);\r\n\t\t\treturn Meshes;\r\n\t\t}\r\n\r\n\t\tfor (string AssetPath : AssetPaths)\r\n\t\t{\r\n\t\t\tif (! File::Exists(AssetPath + MeshPath + FileName))\r\n\t\t\t{\r\n\t\t\t\tcontinue;\r\n\t\t\t}\r\n\r\n\t\t\tMeshes = Scene::CGeometryCreator::LoadOBJFile(AssetPath + MeshPath + FileName, AssetPath + MeshPath);\r\n\r\n\t\t\tif (Meshes.size() == 0)\r\n\t\t\t{\r\n\t\t\t\tLog::Error(\"Failed to load mesh: %s\", FileName);\r\n\t\t\t\treturn Meshes;\r\n\t\t\t}\r\n\r\n\t\t\treturn Meshes;\r\n\t\t}\r\n\r\n\t\tLog::Error(\"Cannot find mesh file in any asset directory: '%s'\", FileName);\r\n\t\treturn Meshes;\r\n\t}\r\n\r\n\tvoid CAssetManager::AddAssetPath(string const & Path)\r\n\t{\r\n\t\tAssetPaths.push_back(Path + \"\/\");\r\n\t}\r\n\r\n\tvoid CAssetManager::SetTexturePath(string const & Path)\r\n\t{\r\n\t\tTexturePath = Path + \"\/\";\r\n\t}\r\n\r\n\tvoid CAssetManager::SetShaderPath(string const & Path)\r\n\t{\r\n\t\tShaderPath = Path + \"\/\";\r\n\t}\r\n\r\n\tvoid CAssetManager::SetMeshPath(string const & Path)\r\n\t{\r\n\t\tMeshPath = Path + \"\/\";\r\n\t}\r\n\r\n}\r\n<|endoftext|>"} {"text":"<commit_before>\/\/ Copyright (c) 2012 The Chromium Authors. All rights reserved.\n\/\/ Use of this source code is governed by a BSD-style license that can be\n\/\/ found in the LICENSE file.\n\n#include \"chrome\/nacl\/nacl_listener.h\"\n\n#include <errno.h>\n#include <stdlib.h>\n\n#if defined(OS_POSIX)\n#include <unistd.h>\n#endif\n\n#include \"base\/command_line.h\"\n#include \"base\/logging.h\"\n#include \"base\/memory\/scoped_ptr.h\"\n#include \"base\/message_loop\/message_loop.h\"\n#include \"base\/rand_util.h\"\n#include \"chrome\/common\/nacl_messages.h\"\n#include \"chrome\/nacl\/nacl_ipc_adapter.h\"\n#include \"chrome\/nacl\/nacl_validation_db.h\"\n#include \"chrome\/nacl\/nacl_validation_query.h\"\n#include \"ipc\/ipc_channel_handle.h\"\n#include \"ipc\/ipc_switches.h\"\n#include \"ipc\/ipc_sync_channel.h\"\n#include \"ipc\/ipc_sync_message_filter.h\"\n#include \"native_client\/src\/trusted\/service_runtime\/sel_main_chrome.h\"\n#include \"native_client\/src\/trusted\/validator\/nacl_file_info.h\"\n\n#if defined(OS_POSIX)\n#include \"base\/file_descriptor_posix.h\"\n#endif\n\n#if defined(OS_LINUX)\n#include \"content\/public\/common\/child_process_sandbox_support_linux.h\"\n#endif\n\n#if defined(OS_WIN)\n#include <fcntl.h>\n#include <io.h>\n\n#include \"content\/public\/common\/sandbox_init.h\"\n#endif\n\nnamespace {\n#if defined(OS_MACOSX)\n\n\/\/ On Mac OS X, shm_open() works in the sandbox but does not give us\n\/\/ an FD that we can map as PROT_EXEC. Rather than doing an IPC to\n\/\/ get an executable SHM region when CreateMemoryObject() is called,\n\/\/ we preallocate one on startup, since NaCl's sel_ldr only needs one\n\/\/ of them. This saves a round trip.\n\nbase::subtle::Atomic32 g_shm_fd = -1;\n\nint CreateMemoryObject(size_t size, int executable) {\n if (executable && size > 0) {\n int result_fd = base::subtle::NoBarrier_AtomicExchange(&g_shm_fd, -1);\n if (result_fd != -1) {\n \/\/ ftruncate() is disallowed by the Mac OS X sandbox and\n \/\/ returns EPERM. Luckily, we can get the same effect with\n \/\/ lseek() + write().\n if (lseek(result_fd, size - 1, SEEK_SET) == -1) {\n LOG(ERROR) << \"lseek() failed: \" << errno;\n return -1;\n }\n if (write(result_fd, \"\", 1) != 1) {\n LOG(ERROR) << \"write() failed: \" << errno;\n return -1;\n }\n return result_fd;\n }\n }\n \/\/ Fall back to NaCl's default implementation.\n return -1;\n}\n\n#elif defined(OS_LINUX)\n\nint CreateMemoryObject(size_t size, int executable) {\n return content::MakeSharedMemorySegmentViaIPC(size, executable);\n}\n\n#elif defined(OS_WIN)\n\nNaClListener* g_listener;\n\n\/\/ We wrap the function to convert the bool return value to an int.\nint BrokerDuplicateHandle(NaClHandle source_handle,\n uint32_t process_id,\n NaClHandle* target_handle,\n uint32_t desired_access,\n uint32_t options) {\n return content::BrokerDuplicateHandle(source_handle, process_id,\n target_handle, desired_access,\n options);\n}\n\nint AttachDebugExceptionHandler(const void* info, size_t info_size) {\n std::string info_string(reinterpret_cast<const char*>(info), info_size);\n bool result = false;\n if (!g_listener->Send(new NaClProcessMsg_AttachDebugExceptionHandler(\n info_string, &result)))\n return false;\n return result;\n}\n\n#endif\n\n} \/\/ namespace\n\nclass BrowserValidationDBProxy : public NaClValidationDB {\n public:\n explicit BrowserValidationDBProxy(NaClListener* listener)\n : listener_(listener) {\n }\n\n virtual bool QueryKnownToValidate(const std::string& signature) OVERRIDE {\n \/\/ Initialize to false so that if the Send fails to write to the return\n \/\/ value we're safe. For example if the message is (for some reason)\n \/\/ dispatched as an async message the return parameter will not be written.\n bool result = false;\n if (!listener_->Send(new NaClProcessMsg_QueryKnownToValidate(signature,\n &result))) {\n LOG(ERROR) << \"Failed to query NaCl validation cache.\";\n result = false;\n }\n return result;\n }\n\n virtual void SetKnownToValidate(const std::string& signature) OVERRIDE {\n \/\/ Caching is optional: NaCl will still work correctly if the IPC fails.\n if (!listener_->Send(new NaClProcessMsg_SetKnownToValidate(signature))) {\n LOG(ERROR) << \"Failed to update NaCl validation cache.\";\n }\n }\n\n virtual bool ResolveFileToken(struct NaClFileToken* file_token,\n int32* fd, std::string* path) OVERRIDE {\n *fd = -1;\n *path = \"\";\n if (file_token->lo == 0 && file_token->hi == 0) {\n return false;\n }\n IPC::PlatformFileForTransit ipc_fd = IPC::InvalidPlatformFileForTransit();\n base::FilePath ipc_path;\n if (!listener_->Send(new NaClProcessMsg_ResolveFileToken(file_token->lo,\n file_token->hi,\n &ipc_fd,\n &ipc_path))) {\n return false;\n }\n if (ipc_fd == IPC::InvalidPlatformFileForTransit()) {\n return false;\n }\n base::PlatformFile handle =\n IPC::PlatformFileForTransitToPlatformFile(ipc_fd);\n#if defined(OS_WIN)\n \/\/ On Windows, valid handles are 32 bit unsigned integers so this is safe.\n *fd = reinterpret_cast<uintptr_t>(handle);\n#else\n *fd = handle;\n#endif\n \/\/ It doesn't matter if the path is invalid UTF8 as long as it's consistent\n \/\/ and unforgeable.\n *path = ipc_path.AsUTF8Unsafe();\n return true;\n }\n\n private:\n \/\/ The listener never dies, otherwise this might be a dangling reference.\n NaClListener* listener_;\n};\n\n\nNaClListener::NaClListener() : shutdown_event_(true, false),\n io_thread_(\"NaCl_IOThread\"),\n#if defined(OS_LINUX)\n prereserved_sandbox_size_(0),\n#endif\n#if defined(OS_POSIX)\n number_of_cores_(-1), \/\/ unknown\/error\n#endif\n main_loop_(NULL) {\n io_thread_.StartWithOptions(\n base::Thread::Options(base::MessageLoop::TYPE_IO, 0));\n#if defined(OS_WIN)\n DCHECK(g_listener == NULL);\n g_listener = this;\n#endif\n}\n\nNaClListener::~NaClListener() {\n NOTREACHED();\n shutdown_event_.Signal();\n#if defined(OS_WIN)\n g_listener = NULL;\n#endif\n}\n\nbool NaClListener::Send(IPC::Message* msg) {\n DCHECK(main_loop_ != NULL);\n if (base::MessageLoop::current() == main_loop_) {\n \/\/ This thread owns the channel.\n return channel_->Send(msg);\n } else {\n \/\/ This thread does not own the channel.\n return filter_->Send(msg);\n }\n}\n\nvoid NaClListener::Listen() {\n std::string channel_name =\n CommandLine::ForCurrentProcess()->GetSwitchValueASCII(\n switches::kProcessChannelID);\n channel_.reset(new IPC::SyncChannel(\n this, io_thread_.message_loop_proxy().get(), &shutdown_event_));\n filter_ = new IPC::SyncMessageFilter(&shutdown_event_);\n channel_->AddFilter(filter_.get());\n channel_->Init(channel_name, IPC::Channel::MODE_CLIENT, true);\n main_loop_ = base::MessageLoop::current();\n main_loop_->Run();\n}\n\nbool NaClListener::OnMessageReceived(const IPC::Message& msg) {\n bool handled = true;\n IPC_BEGIN_MESSAGE_MAP(NaClListener, msg)\n IPC_MESSAGE_HANDLER(NaClProcessMsg_Start, OnStart)\n IPC_MESSAGE_UNHANDLED(handled = false)\n IPC_END_MESSAGE_MAP()\n return handled;\n}\n\nvoid NaClListener::OnStart(const nacl::NaClStartParams& params) {\n struct NaClChromeMainArgs *args = NaClChromeMainArgsCreate();\n if (args == NULL) {\n LOG(ERROR) << \"NaClChromeMainArgsCreate() failed\";\n return;\n }\n\n if (params.enable_ipc_proxy) {\n \/\/ Create the initial PPAPI IPC channel between the NaCl IRT and the\n \/\/ browser process. The IRT uses this channel to communicate with the\n \/\/ browser and to create additional IPC channels to renderer processes.\n IPC::ChannelHandle handle =\n IPC::Channel::GenerateVerifiedChannelID(\"nacl\");\n scoped_refptr<NaClIPCAdapter> ipc_adapter(\n new NaClIPCAdapter(handle, io_thread_.message_loop_proxy().get()));\n ipc_adapter->ConnectChannel();\n\n \/\/ Pass a NaClDesc to the untrusted side. This will hold a ref to the\n \/\/ NaClIPCAdapter.\n args->initial_ipc_desc = ipc_adapter->MakeNaClDesc();\n#if defined(OS_POSIX)\n handle.socket = base::FileDescriptor(\n ipc_adapter->TakeClientFileDescriptor(), true);\n#endif\n if (!Send(new NaClProcessHostMsg_PpapiChannelCreated(handle)))\n LOG(ERROR) << \"Failed to send IPC channel handle to NaClProcessHost.\";\n }\n\n std::vector<nacl::FileDescriptor> handles = params.handles;\n\n#if defined(OS_LINUX) || defined(OS_MACOSX)\n args->urandom_fd = dup(base::GetUrandomFD());\n if (args->urandom_fd < 0) {\n LOG(ERROR) << \"Failed to dup() the urandom FD\";\n return;\n }\n args->number_of_cores = number_of_cores_;\n args->create_memory_object_func = CreateMemoryObject;\n# if defined(OS_MACOSX)\n CHECK(handles.size() >= 1);\n g_shm_fd = nacl::ToNativeHandle(handles[handles.size() - 1]);\n handles.pop_back();\n# endif\n#endif\n\n if (params.uses_irt) {\n CHECK(handles.size() >= 1);\n NaClHandle irt_handle = nacl::ToNativeHandle(handles[handles.size() - 1]);\n handles.pop_back();\n\n#if defined(OS_WIN)\n args->irt_fd = _open_osfhandle(reinterpret_cast<intptr_t>(irt_handle),\n _O_RDONLY | _O_BINARY);\n if (args->irt_fd < 0) {\n LOG(ERROR) << \"_open_osfhandle() failed\";\n return;\n }\n#else\n args->irt_fd = irt_handle;\n#endif\n } else {\n \/\/ Otherwise, the IRT handle is not even sent.\n args->irt_fd = -1;\n }\n\n if (params.validation_cache_enabled) {\n \/\/ SHA256 block size.\n CHECK_EQ(params.validation_cache_key.length(), (size_t) 64);\n \/\/ The cache structure is not freed and exists until the NaCl process exits.\n args->validation_cache = CreateValidationCache(\n new BrowserValidationDBProxy(this), params.validation_cache_key,\n params.version);\n }\n\n CHECK(handles.size() == 1);\n args->imc_bootstrap_handle = nacl::ToNativeHandle(handles[0]);\n args->enable_exception_handling = params.enable_exception_handling;\n args->enable_debug_stub = params.enable_debug_stub;\n args->enable_dyncode_syscalls = params.enable_dyncode_syscalls;\n#if defined(OS_LINUX) || defined(OS_MACOSX)\n args->debug_stub_server_bound_socket_fd = nacl::ToNativeHandle(\n params.debug_stub_server_bound_socket);\n#endif\n#if defined(OS_WIN)\n args->broker_duplicate_handle_func = BrokerDuplicateHandle;\n args->attach_debug_exception_handler_func = AttachDebugExceptionHandler;\n#endif\n#if defined(OS_LINUX)\n args->prereserved_sandbox_size = prereserved_sandbox_size_;\n#endif\n NaClChromeMainStart(args);\n NOTREACHED();\n}\n<commit_msg>PNaCl security hardening: Bound the nexe's code segment size to 32MB<commit_after>\/\/ Copyright (c) 2012 The Chromium Authors. All rights reserved.\n\/\/ Use of this source code is governed by a BSD-style license that can be\n\/\/ found in the LICENSE file.\n\n#include \"chrome\/nacl\/nacl_listener.h\"\n\n#include <errno.h>\n#include <stdlib.h>\n\n#if defined(OS_POSIX)\n#include <unistd.h>\n#endif\n\n#include \"base\/command_line.h\"\n#include \"base\/logging.h\"\n#include \"base\/memory\/scoped_ptr.h\"\n#include \"base\/message_loop\/message_loop.h\"\n#include \"base\/rand_util.h\"\n#include \"chrome\/common\/nacl_messages.h\"\n#include \"chrome\/nacl\/nacl_ipc_adapter.h\"\n#include \"chrome\/nacl\/nacl_validation_db.h\"\n#include \"chrome\/nacl\/nacl_validation_query.h\"\n#include \"ipc\/ipc_channel_handle.h\"\n#include \"ipc\/ipc_switches.h\"\n#include \"ipc\/ipc_sync_channel.h\"\n#include \"ipc\/ipc_sync_message_filter.h\"\n#include \"native_client\/src\/trusted\/service_runtime\/sel_main_chrome.h\"\n#include \"native_client\/src\/trusted\/validator\/nacl_file_info.h\"\n\n#if defined(OS_POSIX)\n#include \"base\/file_descriptor_posix.h\"\n#endif\n\n#if defined(OS_LINUX)\n#include \"content\/public\/common\/child_process_sandbox_support_linux.h\"\n#endif\n\n#if defined(OS_WIN)\n#include <fcntl.h>\n#include <io.h>\n\n#include \"content\/public\/common\/sandbox_init.h\"\n#endif\n\nnamespace {\n#if defined(OS_MACOSX)\n\n\/\/ On Mac OS X, shm_open() works in the sandbox but does not give us\n\/\/ an FD that we can map as PROT_EXEC. Rather than doing an IPC to\n\/\/ get an executable SHM region when CreateMemoryObject() is called,\n\/\/ we preallocate one on startup, since NaCl's sel_ldr only needs one\n\/\/ of them. This saves a round trip.\n\nbase::subtle::Atomic32 g_shm_fd = -1;\n\nint CreateMemoryObject(size_t size, int executable) {\n if (executable && size > 0) {\n int result_fd = base::subtle::NoBarrier_AtomicExchange(&g_shm_fd, -1);\n if (result_fd != -1) {\n \/\/ ftruncate() is disallowed by the Mac OS X sandbox and\n \/\/ returns EPERM. Luckily, we can get the same effect with\n \/\/ lseek() + write().\n if (lseek(result_fd, size - 1, SEEK_SET) == -1) {\n LOG(ERROR) << \"lseek() failed: \" << errno;\n return -1;\n }\n if (write(result_fd, \"\", 1) != 1) {\n LOG(ERROR) << \"write() failed: \" << errno;\n return -1;\n }\n return result_fd;\n }\n }\n \/\/ Fall back to NaCl's default implementation.\n return -1;\n}\n\n#elif defined(OS_LINUX)\n\nint CreateMemoryObject(size_t size, int executable) {\n return content::MakeSharedMemorySegmentViaIPC(size, executable);\n}\n\n#elif defined(OS_WIN)\n\nNaClListener* g_listener;\n\n\/\/ We wrap the function to convert the bool return value to an int.\nint BrokerDuplicateHandle(NaClHandle source_handle,\n uint32_t process_id,\n NaClHandle* target_handle,\n uint32_t desired_access,\n uint32_t options) {\n return content::BrokerDuplicateHandle(source_handle, process_id,\n target_handle, desired_access,\n options);\n}\n\nint AttachDebugExceptionHandler(const void* info, size_t info_size) {\n std::string info_string(reinterpret_cast<const char*>(info), info_size);\n bool result = false;\n if (!g_listener->Send(new NaClProcessMsg_AttachDebugExceptionHandler(\n info_string, &result)))\n return false;\n return result;\n}\n\n#endif\n\n} \/\/ namespace\n\nclass BrowserValidationDBProxy : public NaClValidationDB {\n public:\n explicit BrowserValidationDBProxy(NaClListener* listener)\n : listener_(listener) {\n }\n\n virtual bool QueryKnownToValidate(const std::string& signature) OVERRIDE {\n \/\/ Initialize to false so that if the Send fails to write to the return\n \/\/ value we're safe. For example if the message is (for some reason)\n \/\/ dispatched as an async message the return parameter will not be written.\n bool result = false;\n if (!listener_->Send(new NaClProcessMsg_QueryKnownToValidate(signature,\n &result))) {\n LOG(ERROR) << \"Failed to query NaCl validation cache.\";\n result = false;\n }\n return result;\n }\n\n virtual void SetKnownToValidate(const std::string& signature) OVERRIDE {\n \/\/ Caching is optional: NaCl will still work correctly if the IPC fails.\n if (!listener_->Send(new NaClProcessMsg_SetKnownToValidate(signature))) {\n LOG(ERROR) << \"Failed to update NaCl validation cache.\";\n }\n }\n\n virtual bool ResolveFileToken(struct NaClFileToken* file_token,\n int32* fd, std::string* path) OVERRIDE {\n *fd = -1;\n *path = \"\";\n if (file_token->lo == 0 && file_token->hi == 0) {\n return false;\n }\n IPC::PlatformFileForTransit ipc_fd = IPC::InvalidPlatformFileForTransit();\n base::FilePath ipc_path;\n if (!listener_->Send(new NaClProcessMsg_ResolveFileToken(file_token->lo,\n file_token->hi,\n &ipc_fd,\n &ipc_path))) {\n return false;\n }\n if (ipc_fd == IPC::InvalidPlatformFileForTransit()) {\n return false;\n }\n base::PlatformFile handle =\n IPC::PlatformFileForTransitToPlatformFile(ipc_fd);\n#if defined(OS_WIN)\n \/\/ On Windows, valid handles are 32 bit unsigned integers so this is safe.\n *fd = reinterpret_cast<uintptr_t>(handle);\n#else\n *fd = handle;\n#endif\n \/\/ It doesn't matter if the path is invalid UTF8 as long as it's consistent\n \/\/ and unforgeable.\n *path = ipc_path.AsUTF8Unsafe();\n return true;\n }\n\n private:\n \/\/ The listener never dies, otherwise this might be a dangling reference.\n NaClListener* listener_;\n};\n\n\nNaClListener::NaClListener() : shutdown_event_(true, false),\n io_thread_(\"NaCl_IOThread\"),\n#if defined(OS_LINUX)\n prereserved_sandbox_size_(0),\n#endif\n#if defined(OS_POSIX)\n number_of_cores_(-1), \/\/ unknown\/error\n#endif\n main_loop_(NULL) {\n io_thread_.StartWithOptions(\n base::Thread::Options(base::MessageLoop::TYPE_IO, 0));\n#if defined(OS_WIN)\n DCHECK(g_listener == NULL);\n g_listener = this;\n#endif\n}\n\nNaClListener::~NaClListener() {\n NOTREACHED();\n shutdown_event_.Signal();\n#if defined(OS_WIN)\n g_listener = NULL;\n#endif\n}\n\nbool NaClListener::Send(IPC::Message* msg) {\n DCHECK(main_loop_ != NULL);\n if (base::MessageLoop::current() == main_loop_) {\n \/\/ This thread owns the channel.\n return channel_->Send(msg);\n } else {\n \/\/ This thread does not own the channel.\n return filter_->Send(msg);\n }\n}\n\nvoid NaClListener::Listen() {\n std::string channel_name =\n CommandLine::ForCurrentProcess()->GetSwitchValueASCII(\n switches::kProcessChannelID);\n channel_.reset(new IPC::SyncChannel(\n this, io_thread_.message_loop_proxy().get(), &shutdown_event_));\n filter_ = new IPC::SyncMessageFilter(&shutdown_event_);\n channel_->AddFilter(filter_.get());\n channel_->Init(channel_name, IPC::Channel::MODE_CLIENT, true);\n main_loop_ = base::MessageLoop::current();\n main_loop_->Run();\n}\n\nbool NaClListener::OnMessageReceived(const IPC::Message& msg) {\n bool handled = true;\n IPC_BEGIN_MESSAGE_MAP(NaClListener, msg)\n IPC_MESSAGE_HANDLER(NaClProcessMsg_Start, OnStart)\n IPC_MESSAGE_UNHANDLED(handled = false)\n IPC_END_MESSAGE_MAP()\n return handled;\n}\n\nvoid NaClListener::OnStart(const nacl::NaClStartParams& params) {\n struct NaClChromeMainArgs *args = NaClChromeMainArgsCreate();\n if (args == NULL) {\n LOG(ERROR) << \"NaClChromeMainArgsCreate() failed\";\n return;\n }\n\n if (params.enable_ipc_proxy) {\n \/\/ Create the initial PPAPI IPC channel between the NaCl IRT and the\n \/\/ browser process. The IRT uses this channel to communicate with the\n \/\/ browser and to create additional IPC channels to renderer processes.\n IPC::ChannelHandle handle =\n IPC::Channel::GenerateVerifiedChannelID(\"nacl\");\n scoped_refptr<NaClIPCAdapter> ipc_adapter(\n new NaClIPCAdapter(handle, io_thread_.message_loop_proxy().get()));\n ipc_adapter->ConnectChannel();\n\n \/\/ Pass a NaClDesc to the untrusted side. This will hold a ref to the\n \/\/ NaClIPCAdapter.\n args->initial_ipc_desc = ipc_adapter->MakeNaClDesc();\n#if defined(OS_POSIX)\n handle.socket = base::FileDescriptor(\n ipc_adapter->TakeClientFileDescriptor(), true);\n#endif\n if (!Send(new NaClProcessHostMsg_PpapiChannelCreated(handle)))\n LOG(ERROR) << \"Failed to send IPC channel handle to NaClProcessHost.\";\n }\n\n std::vector<nacl::FileDescriptor> handles = params.handles;\n\n#if defined(OS_LINUX) || defined(OS_MACOSX)\n args->urandom_fd = dup(base::GetUrandomFD());\n if (args->urandom_fd < 0) {\n LOG(ERROR) << \"Failed to dup() the urandom FD\";\n return;\n }\n args->number_of_cores = number_of_cores_;\n args->create_memory_object_func = CreateMemoryObject;\n# if defined(OS_MACOSX)\n CHECK(handles.size() >= 1);\n g_shm_fd = nacl::ToNativeHandle(handles[handles.size() - 1]);\n handles.pop_back();\n# endif\n#endif\n\n if (params.uses_irt) {\n CHECK(handles.size() >= 1);\n NaClHandle irt_handle = nacl::ToNativeHandle(handles[handles.size() - 1]);\n handles.pop_back();\n\n#if defined(OS_WIN)\n args->irt_fd = _open_osfhandle(reinterpret_cast<intptr_t>(irt_handle),\n _O_RDONLY | _O_BINARY);\n if (args->irt_fd < 0) {\n LOG(ERROR) << \"_open_osfhandle() failed\";\n return;\n }\n#else\n args->irt_fd = irt_handle;\n#endif\n } else {\n \/\/ Otherwise, the IRT handle is not even sent.\n args->irt_fd = -1;\n }\n\n if (params.validation_cache_enabled) {\n \/\/ SHA256 block size.\n CHECK_EQ(params.validation_cache_key.length(), (size_t) 64);\n \/\/ The cache structure is not freed and exists until the NaCl process exits.\n args->validation_cache = CreateValidationCache(\n new BrowserValidationDBProxy(this), params.validation_cache_key,\n params.version);\n }\n\n CHECK(handles.size() == 1);\n args->imc_bootstrap_handle = nacl::ToNativeHandle(handles[0]);\n args->enable_exception_handling = params.enable_exception_handling;\n args->enable_debug_stub = params.enable_debug_stub;\n args->enable_dyncode_syscalls = params.enable_dyncode_syscalls;\n if (!params.enable_dyncode_syscalls) {\n \/\/ Bound the initial nexe's code segment size under PNaCl to\n \/\/ reduce the chance of a code spraying attack succeeding (see\n \/\/ https:\/\/code.google.com\/p\/nativeclient\/issues\/detail?id=3572).\n \/\/ We assume that !params.enable_dyncode_syscalls is synonymous\n \/\/ with PNaCl. We can't apply this arbitrary limit outside of\n \/\/ PNaCl because it might break existing NaCl apps, and this limit\n \/\/ is only useful if the dyncode syscalls are disabled.\n args->initial_nexe_max_code_bytes = 32 << 20; \/\/ 32 MB\n }\n#if defined(OS_LINUX) || defined(OS_MACOSX)\n args->debug_stub_server_bound_socket_fd = nacl::ToNativeHandle(\n params.debug_stub_server_bound_socket);\n#endif\n#if defined(OS_WIN)\n args->broker_duplicate_handle_func = BrokerDuplicateHandle;\n args->attach_debug_exception_handler_func = AttachDebugExceptionHandler;\n#endif\n#if defined(OS_LINUX)\n args->prereserved_sandbox_size = prereserved_sandbox_size_;\n#endif\n NaClChromeMainStart(args);\n NOTREACHED();\n}\n<|endoftext|>"} {"text":"<commit_before>\/*\n For more information, please see: http:\/\/software.sci.utah.edu\n\n The MIT License\n\n Copyright (c) 2012 Scientific Computing and Imaging Institute,\n University of Utah.\n\n License for the specific language governing rights and limitations under\n Permission is hereby granted, free of charge, to any person obtaining a\n copy of this software and associated documentation files (the \"Software\"),\n to deal in the Software without restriction, including without limitation\n the rights to use, copy, modify, merge, publish, distribute, sublicense,\n and\/or sell copies of the Software, and to permit persons to whom the\n Software is furnished to do so, subject to the following conditions:\n\n The above copyright notice and this permission notice shall be included\n in all copies or substantial portions of the Software.\n\n THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS\n OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\n FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL\n THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\n LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING\n FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER\n DEALINGS IN THE SOFTWARE.\n*\/\n\n#include <gtest\/gtest.h>\n#include <gmock\/gmock.h>\n\n#include <Core\/Datatypes\/DenseMatrix.h>\n#include <Core\/Datatypes\/SparseRowMatrix.h>\n#include <Core\/Datatypes\/MatrixIO.h>\n#include <Core\/Datatypes\/MatrixComparison.h>\n\nusing namespace SCIRun::Core::Datatypes;\nusing namespace ::testing;\n\nnamespace\n{\n SparseRowMatrix matrix1()\n {\n SparseRowMatrix m(4,5);\n m.insert(0,0) = 1;\n m.insert(1,2) = -2;\n m.insert(2,3) = 0.5;\n return m;\n }\n SparseRowMatrix Zero()\n {\n SparseRowMatrix m(4,5);\n m.setZero();\n return m;\n }\n SparseRowMatrix id3()\n {\n SparseRowMatrix m(3,3);\n m.insert(0,0) = 1;\n m.insert(1,1) = 1;\n m.insert(2,2) = 1;\n return m;\n }\n SparseRowMatrix matrixTdcsGood()\n {\n SparseRowMatrix m(5,5);\n m.insert(1,1) = 1;\n m.insert(2,3) = 0.5;\n return m;\n }\n SparseRowMatrix matrixTdcsBad1()\n {\n SparseRowMatrix m(5,5);\n m.insert(2,2) = 1;\n m.insert(2,1) = 0.5;\n return m;\n }\n SparseRowMatrix matrixTdcsBad2()\n {\n SparseRowMatrix m(5,5);\n m.insert(2,2) = 1;\n m.insert(1,2) = 0.5;\n return m;\n }\n SparseRowMatrix matrixTdcsBad3()\n {\n SparseRowMatrix m(5,5);\n m.insert(2,2) = 1.1;\n return m;\n }\n}\n\n#define PRINT_MATRIX(x) \/\/std::cout << #x << \" = \\n\" << (x) << std::endl\n#define PRINT_MATRIX_BASE(x) \/\/std::cout << #x << \" = \\n\" << static_cast<const MatrixBase<double>&>((x)) << std::endl\n\n\nTEST(SparseRowMatrixTest, CanCreateBasicMatrix)\n{\n SparseRowMatrix m(matrix1());\n PRINT_MATRIX_BASE(m);\n}\n\nTEST(SparseRowMatrixTest, CanPrintInLegacyFormat)\n{\n SparseRowMatrix m(matrix1());\n std::string legacy = matrix_to_string(0.5 * m);\n EXPECT_EQ(\"0.5 0 0 0 0 \\n0 0 -1 0 0 \\n0 0 0 0.25 0 \\n0 0 0 0 0 \\n\", legacy);\n}\n\nTEST(SparseRowMatrixTest, CanDetermineSize)\n{\n SparseRowMatrix m(matrix1());\n EXPECT_EQ(4, m.nrows());\n EXPECT_EQ(5, m.ncols());\n}\n\nTEST(SparseRowMatrixTest, CanCopyConstruct)\n{\n SparseRowMatrix m(matrix1());\n SparseRowMatrix m2(m);\n EXPECT_EQ(m, m2);\n m.coeffRef(1,2) += 1;\n PRINT_MATRIX_BASE(m);\n PRINT_MATRIX_BASE(m2);\n EXPECT_NE(m, m2);\n}\n\nTEST(SparseRowMatrixTest, CanAssign)\n{\n SparseRowMatrix m(matrix1());\n \n SparseRowMatrix m2;\n EXPECT_NE(m, m2);\n m2 = m;\n EXPECT_EQ(m, m2);\n m.coeffRef(1,2) += 1;\n EXPECT_NE(m, m2);\n}\n\nTEST(SparseRowMatrixUnaryOperationTests, CanNegate)\n{\n SparseRowMatrix m(matrix1());\n\n PRINT_MATRIX_BASE(m);\n PRINT_MATRIX(-m);\n\n SparseRowMatrix n = - -m;\n EXPECT_EQ(m, n);\n SparseRowMatrix diff = m + (-m);\n EXPECT_EQ(diff, Zero());\n}\n\nTEST(SparseRowMatrixUnaryOperationTests, CanScalarMultiply)\n{\n SparseRowMatrix m(matrix1());\n\n PRINT_MATRIX_BASE(m);\n PRINT_MATRIX(2*m);\n PRINT_MATRIX(m*2);\n SparseRowMatrix x = 2*m;\n SparseRowMatrix y = m*2;\n EXPECT_EQ(x,y);\n}\n\nTEST(SparseRowMatrixUnaryOperationTests, CanTranspose)\n{\n SparseRowMatrix m(matrix1());\n\n PRINT_MATRIX_BASE(m);\n PRINT_MATRIX(m.transpose());\n\n SparseRowMatrix mtt = m.transpose().transpose();\n EXPECT_EQ(m,mtt);\n}\n\nTEST(SparseRowMatrixBinaryOperationTests, CanMultiply)\n{\n SparseRowMatrix m(matrix1());\n\n PRINT_MATRIX_BASE(m);\n PRINT_MATRIX(m * m.transpose());\n SparseRowMatrix prod = Zero() * m;\n EXPECT_EQ(prod, Zero());\n}\n\nTEST(SparseRowMatrixBinaryOperationTests, CanAdd)\n{\n SparseRowMatrix m(matrix1());\n\n PRINT_MATRIX_BASE(m);\n PRINT_MATRIX(m + m);\n SparseRowMatrix m2a = m + m;\n SparseRowMatrix m2b = 2*m;\n EXPECT_EQ(m2a, m2b);\n}\n\nTEST(SparseRowMatrixBinaryOperationTests, CanSubtract)\n{\n SparseRowMatrix m(matrix1());\n\n PRINT_MATRIX_BASE(m);\n PRINT_MATRIX(m - m);\n SparseRowMatrix diff = m - m;\n EXPECT_EQ(diff, Zero());\n}\n\n\/\/TODO: compare to v4.\n\/\/TEST(SparseRowMatrixBinaryOperationTests, WhatHappensWhenYouAddDifferentSizes)\n\/\/{\n\/\/ SparseRowMatrix sum = matrix1() + matrix1();\n\/\/ std::cout << sum.rows() << std::endl;\n\/\/ std::cout << sum.cols() << std::endl;\n\/\/ PRINT_MATRIX(sum);\n\/\/}\n\ntemplate <typename T>\nvoid printArray(const T* ts, size_t size)\n{\n std::copy(ts, ts + size, std::ostream_iterator<T>(std::cout, \" \"));\n std::cout << std::endl;\n}\n\nTEST(SparseRowMatrixTest, CheckingInternalArrays)\n{\n auto mat = matrix1();\n\n mat.makeCompressed();\n EXPECT_EQ(0, mat.innerNonZeroPtr());\n EXPECT_EQ(3, mat.nonZeros());\n EXPECT_NE(mat.rows(), mat.cols());\n EXPECT_EQ(mat.outerSize(), mat.rows());\n EXPECT_EQ(mat.innerSize(), mat.cols());\n\n std::vector<double> values(mat.valuePtr(), mat.valuePtr() + mat.nonZeros());\n EXPECT_THAT(values, ElementsAre(1, -2, 0.5));\n std::vector<long long> columns(mat.innerIndexPtr(), mat.innerIndexPtr() + mat.nonZeros());\n EXPECT_THAT(columns, ElementsAre(0,2,3));\n std::vector<long long> rows(mat.outerIndexPtr(), mat.outerIndexPtr() + mat.outerSize());\n EXPECT_THAT(rows, ElementsAre(0,1,2,3));\n}\n\nTEST(SparseRowMatrixTest, CheckingInternalArrays2)\n{\n SparseRowMatrix mat(id3());\n\n mat.makeCompressed();\n EXPECT_EQ(0, mat.innerNonZeroPtr());\n EXPECT_EQ(3, mat.nonZeros());\n EXPECT_EQ(mat.rows(), mat.cols());\n EXPECT_EQ(mat.outerSize(), mat.rows());\n EXPECT_EQ(mat.innerSize(), mat.cols());\n\n std::vector<double> values(mat.valuePtr(), mat.valuePtr() + mat.nonZeros());\n EXPECT_THAT(values, ElementsAre(1, 1, 1));\n std::vector<long long> columns(mat.innerIndexPtr(), mat.innerIndexPtr() + mat.nonZeros());\n EXPECT_THAT(columns, ElementsAre(0,1,2));\n std::vector<long long> rows(mat.outerIndexPtr(), mat.outerIndexPtr() + mat.outerSize());\n EXPECT_THAT(rows, ElementsAre(0,1,2));\n}\n\nbool hasNElements(const SparseRowMatrix::InnerIterator& it, int n)\n{\n SparseRowMatrix::InnerIterator copy(it);\n for (int i = 0; i < n && copy; ++i)\n ++copy;\n return !copy;\n}\n\nbool passesTdcsTest(const SparseRowMatrix& matrix)\n{\n for (int k=0; k < matrix.outerSize(); ++k)\n {\n for (SparseRowMatrix::InnerIterator it(matrix,k); it; ++it)\n {\n \/\/std::cout << \"value: \" << it.value() << std::endl;\n \/\/std::cout << \"row: \" << it.row() << std::endl;\n \/\/std::cout << \"col: \" << it.col() << std::endl;\n\n if (hasNElements(it, 1))\n {\n \/\/std::cout << \"has 1 element\" << std::endl;\n \/\/std::cout << \"value = \" << it.value() << std::endl;\n if (it.value() == 1)\n {\n \/\/std::cout << \"found a 1 \" << std::endl;\n return true;\n }\n }\n \/\/if (it.value() == 1\n \n \n \/\/it.value();\n \/\/it.row(); \/\/ row index\n \/\/it.col(); \/\/ col index (here it is equal to k)\n \n }\n }\n return false;\n}\n\nTEST(SparseRowMatrixTest, DISABLED_SearchingForSingleNonzeroInRowAndColumnOnTheDiagonal)\n{\n EXPECT_TRUE(passesTdcsTest(id3()));\n EXPECT_TRUE(passesTdcsTest(matrixTdcsGood()));\n \n EXPECT_FALSE(passesTdcsTest(Zero()));\n \n EXPECT_FALSE(passesTdcsTest(matrixTdcsBad1()));\n EXPECT_FALSE(passesTdcsTest(matrixTdcsBad2()));\n EXPECT_FALSE(passesTdcsTest(matrixTdcsBad3()));\n \n}\n\nTEST(SparseRowMatrixTest, GetRow)\n{\n SparseRowMatrix m(matrix1());\n\n Eigen::SparseVector<double> r1 = m.row(1);\n std::cout << r1 << std::endl;\n}\n\n\n\/*\nSparseRowMatrix matrix1()\n{\nSparseRowMatrix m(4,5);\nm.insert(0,0) = 1;\nm.insert(1,2) = -2;\nm.insert(2,3) = 0.5;\nreturn m;\n}\n*\/\n\nnamespace\n{\n bool isSymmetric(const DenseMatrix& m)\n {\n return m.isApprox(m.transpose());\n }\n\n bool isSymmetric(const SparseRowMatrix& m)\n {\n return m.isApprox(m.transpose());\n }\n\n bool isSymmetric()\n {\n for (int k = 0; k < m.outerSize(); ++k)\n {\n for (SparseRowMatrix::InnerIterator it(m,k); it; ++it)\n {\n std::cout << \" row = \" << it.row() << \" col = \" << it.col() << \" value = \" << it.value() << std::endl;\n }\n }\n }\n}\n\n\n\nTEST(SparseRowMatrixTest, Iteration)\n{\n auto m = matrix1();\n for (int k = 0; k < m.outerSize(); ++k)\n {\n for (SparseRowMatrix::InnerIterator it(m,k); it; ++it)\n {\n std::cout << \" row = \" << it.row() << \" col = \" << it.col() << \" value = \" << it.value() << std::endl;\n }\n }\n\n ASSERT_FALSE(isSymmetric(m));\n ASSERT_TRUE(isSymmetric(id3()));\n ASSERT_TRUE(isSymmetric(Zero()));\n}<commit_msg>Fix test code<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 <gtest\/gtest.h>\n#include <gmock\/gmock.h>\n\n#include <Core\/Datatypes\/DenseMatrix.h>\n#include <Core\/Datatypes\/SparseRowMatrix.h>\n#include <Core\/Datatypes\/MatrixIO.h>\n#include <Core\/Datatypes\/MatrixComparison.h>\n\nusing namespace SCIRun::Core::Datatypes;\nusing namespace ::testing;\n\nnamespace\n{\n SparseRowMatrix matrix1()\n {\n SparseRowMatrix m(4,5);\n m.insert(0,0) = 1;\n m.insert(1,2) = -2;\n m.insert(2,3) = 0.5;\n return m;\n }\n SparseRowMatrix Zero()\n {\n SparseRowMatrix m(4,5);\n m.setZero();\n return m;\n }\n SparseRowMatrix id3()\n {\n SparseRowMatrix m(3,3);\n m.insert(0,0) = 1;\n m.insert(1,1) = 1;\n m.insert(2,2) = 1;\n return m;\n }\n SparseRowMatrix matrixTdcsGood()\n {\n SparseRowMatrix m(5,5);\n m.insert(1,1) = 1;\n m.insert(2,3) = 0.5;\n return m;\n }\n SparseRowMatrix matrixTdcsBad1()\n {\n SparseRowMatrix m(5,5);\n m.insert(2,2) = 1;\n m.insert(2,1) = 0.5;\n return m;\n }\n SparseRowMatrix matrixTdcsBad2()\n {\n SparseRowMatrix m(5,5);\n m.insert(2,2) = 1;\n m.insert(1,2) = 0.5;\n return m;\n }\n SparseRowMatrix matrixTdcsBad3()\n {\n SparseRowMatrix m(5,5);\n m.insert(2,2) = 1.1;\n return m;\n }\n}\n\n#define PRINT_MATRIX(x) \/\/std::cout << #x << \" = \\n\" << (x) << std::endl\n#define PRINT_MATRIX_BASE(x) \/\/std::cout << #x << \" = \\n\" << static_cast<const MatrixBase<double>&>((x)) << std::endl\n\n\nTEST(SparseRowMatrixTest, CanCreateBasicMatrix)\n{\n SparseRowMatrix m(matrix1());\n PRINT_MATRIX_BASE(m);\n}\n\nTEST(SparseRowMatrixTest, CanPrintInLegacyFormat)\n{\n SparseRowMatrix m(matrix1());\n std::string legacy = matrix_to_string(0.5 * m);\n EXPECT_EQ(\"0.5 0 0 0 0 \\n0 0 -1 0 0 \\n0 0 0 0.25 0 \\n0 0 0 0 0 \\n\", legacy);\n}\n\nTEST(SparseRowMatrixTest, CanDetermineSize)\n{\n SparseRowMatrix m(matrix1());\n EXPECT_EQ(4, m.nrows());\n EXPECT_EQ(5, m.ncols());\n}\n\nTEST(SparseRowMatrixTest, CanCopyConstruct)\n{\n SparseRowMatrix m(matrix1());\n SparseRowMatrix m2(m);\n EXPECT_EQ(m, m2);\n m.coeffRef(1,2) += 1;\n PRINT_MATRIX_BASE(m);\n PRINT_MATRIX_BASE(m2);\n EXPECT_NE(m, m2);\n}\n\nTEST(SparseRowMatrixTest, CanAssign)\n{\n SparseRowMatrix m(matrix1());\n \n SparseRowMatrix m2;\n EXPECT_NE(m, m2);\n m2 = m;\n EXPECT_EQ(m, m2);\n m.coeffRef(1,2) += 1;\n EXPECT_NE(m, m2);\n}\n\nTEST(SparseRowMatrixUnaryOperationTests, CanNegate)\n{\n SparseRowMatrix m(matrix1());\n\n PRINT_MATRIX_BASE(m);\n PRINT_MATRIX(-m);\n\n SparseRowMatrix n = - -m;\n EXPECT_EQ(m, n);\n SparseRowMatrix diff = m + (-m);\n EXPECT_EQ(diff, Zero());\n}\n\nTEST(SparseRowMatrixUnaryOperationTests, CanScalarMultiply)\n{\n SparseRowMatrix m(matrix1());\n\n PRINT_MATRIX_BASE(m);\n PRINT_MATRIX(2*m);\n PRINT_MATRIX(m*2);\n SparseRowMatrix x = 2*m;\n SparseRowMatrix y = m*2;\n EXPECT_EQ(x,y);\n}\n\nTEST(SparseRowMatrixUnaryOperationTests, CanTranspose)\n{\n SparseRowMatrix m(matrix1());\n\n PRINT_MATRIX_BASE(m);\n PRINT_MATRIX(m.transpose());\n\n SparseRowMatrix mtt = m.transpose().transpose();\n EXPECT_EQ(m,mtt);\n}\n\nTEST(SparseRowMatrixBinaryOperationTests, CanMultiply)\n{\n SparseRowMatrix m(matrix1());\n\n PRINT_MATRIX_BASE(m);\n PRINT_MATRIX(m * m.transpose());\n SparseRowMatrix prod = Zero() * m;\n EXPECT_EQ(prod, Zero());\n}\n\nTEST(SparseRowMatrixBinaryOperationTests, CanAdd)\n{\n SparseRowMatrix m(matrix1());\n\n PRINT_MATRIX_BASE(m);\n PRINT_MATRIX(m + m);\n SparseRowMatrix m2a = m + m;\n SparseRowMatrix m2b = 2*m;\n EXPECT_EQ(m2a, m2b);\n}\n\nTEST(SparseRowMatrixBinaryOperationTests, CanSubtract)\n{\n SparseRowMatrix m(matrix1());\n\n PRINT_MATRIX_BASE(m);\n PRINT_MATRIX(m - m);\n SparseRowMatrix diff = m - m;\n EXPECT_EQ(diff, Zero());\n}\n\n\/\/TODO: compare to v4.\n\/\/TEST(SparseRowMatrixBinaryOperationTests, WhatHappensWhenYouAddDifferentSizes)\n\/\/{\n\/\/ SparseRowMatrix sum = matrix1() + matrix1();\n\/\/ std::cout << sum.rows() << std::endl;\n\/\/ std::cout << sum.cols() << std::endl;\n\/\/ PRINT_MATRIX(sum);\n\/\/}\n\ntemplate <typename T>\nvoid printArray(const T* ts, size_t size)\n{\n std::copy(ts, ts + size, std::ostream_iterator<T>(std::cout, \" \"));\n std::cout << std::endl;\n}\n\nTEST(SparseRowMatrixTest, CheckingInternalArrays)\n{\n auto mat = matrix1();\n\n mat.makeCompressed();\n EXPECT_EQ(0, mat.innerNonZeroPtr());\n EXPECT_EQ(3, mat.nonZeros());\n EXPECT_NE(mat.rows(), mat.cols());\n EXPECT_EQ(mat.outerSize(), mat.rows());\n EXPECT_EQ(mat.innerSize(), mat.cols());\n\n std::vector<double> values(mat.valuePtr(), mat.valuePtr() + mat.nonZeros());\n EXPECT_THAT(values, ElementsAre(1, -2, 0.5));\n std::vector<long long> columns(mat.innerIndexPtr(), mat.innerIndexPtr() + mat.nonZeros());\n EXPECT_THAT(columns, ElementsAre(0,2,3));\n std::vector<long long> rows(mat.outerIndexPtr(), mat.outerIndexPtr() + mat.outerSize());\n EXPECT_THAT(rows, ElementsAre(0,1,2,3));\n}\n\nTEST(SparseRowMatrixTest, CheckingInternalArrays2)\n{\n SparseRowMatrix mat(id3());\n\n mat.makeCompressed();\n EXPECT_EQ(0, mat.innerNonZeroPtr());\n EXPECT_EQ(3, mat.nonZeros());\n EXPECT_EQ(mat.rows(), mat.cols());\n EXPECT_EQ(mat.outerSize(), mat.rows());\n EXPECT_EQ(mat.innerSize(), mat.cols());\n\n std::vector<double> values(mat.valuePtr(), mat.valuePtr() + mat.nonZeros());\n EXPECT_THAT(values, ElementsAre(1, 1, 1));\n std::vector<long long> columns(mat.innerIndexPtr(), mat.innerIndexPtr() + mat.nonZeros());\n EXPECT_THAT(columns, ElementsAre(0,1,2));\n std::vector<long long> rows(mat.outerIndexPtr(), mat.outerIndexPtr() + mat.outerSize());\n EXPECT_THAT(rows, ElementsAre(0,1,2));\n}\n\nbool hasNElements(const SparseRowMatrix::InnerIterator& it, int n)\n{\n SparseRowMatrix::InnerIterator copy(it);\n for (int i = 0; i < n && copy; ++i)\n ++copy;\n return !copy;\n}\n\nbool passesTdcsTest(const SparseRowMatrix& matrix)\n{\n for (int k=0; k < matrix.outerSize(); ++k)\n {\n for (SparseRowMatrix::InnerIterator it(matrix,k); it; ++it)\n {\n \/\/std::cout << \"value: \" << it.value() << std::endl;\n \/\/std::cout << \"row: \" << it.row() << std::endl;\n \/\/std::cout << \"col: \" << it.col() << std::endl;\n\n if (hasNElements(it, 1))\n {\n \/\/std::cout << \"has 1 element\" << std::endl;\n \/\/std::cout << \"value = \" << it.value() << std::endl;\n if (it.value() == 1)\n {\n \/\/std::cout << \"found a 1 \" << std::endl;\n return true;\n }\n }\n \/\/if (it.value() == 1\n \n \n \/\/it.value();\n \/\/it.row(); \/\/ row index\n \/\/it.col(); \/\/ col index (here it is equal to k)\n \n }\n }\n return false;\n}\n\nTEST(SparseRowMatrixTest, DISABLED_SearchingForSingleNonzeroInRowAndColumnOnTheDiagonal)\n{\n EXPECT_TRUE(passesTdcsTest(id3()));\n EXPECT_TRUE(passesTdcsTest(matrixTdcsGood()));\n \n EXPECT_FALSE(passesTdcsTest(Zero()));\n \n EXPECT_FALSE(passesTdcsTest(matrixTdcsBad1()));\n EXPECT_FALSE(passesTdcsTest(matrixTdcsBad2()));\n EXPECT_FALSE(passesTdcsTest(matrixTdcsBad3()));\n \n}\n\nTEST(SparseRowMatrixTest, GetRow)\n{\n SparseRowMatrix m(matrix1());\n\n Eigen::SparseVector<double> r1 = m.row(1);\n std::cout << r1 << std::endl;\n}\n\n\n\/*\nSparseRowMatrix matrix1()\n{\nSparseRowMatrix m(4,5);\nm.insert(0,0) = 1;\nm.insert(1,2) = -2;\nm.insert(2,3) = 0.5;\nreturn m;\n}\n*\/\n\nnamespace\n{\n bool isSymmetric(const DenseMatrix& m)\n {\n return m.isApprox(m.transpose());\n }\n\n bool isSymmetric2(const SparseRowMatrix& m)\n {\n return m.isApprox(m.transpose());\n }\n\n bool isSymmetric(const SparseRowMatrix& m)\n {\n for (int k = 0; k < m.outerSize(); ++k)\n {\n for (SparseRowMatrix::InnerIterator it(m,k); it; ++it)\n {\n return false;\n std::cout << \" row = \" << it.row() << \" col = \" << it.col() << \" value = \" << it.value() << std::endl;\n }\n }\n }\n}\n\n\n\nTEST(SparseRowMatrixTest, Iteration)\n{\n auto m = matrix1();\n for (int k = 0; k < m.outerSize(); ++k)\n {\n for (SparseRowMatrix::InnerIterator it(m,k); it; ++it)\n {\n std::cout << \" row = \" << it.row() << \" col = \" << it.col() << \" value = \" << it.value() << std::endl;\n }\n }\n\n ASSERT_FALSE(isSymmetric(m));\n ASSERT_TRUE(isSymmetric(id3()));\n ASSERT_TRUE(isSymmetric(Zero()));\n}<|endoftext|>"} {"text":"<commit_before>#include \"test.hpp\"\n#include \"libtorrent\/socket.hpp\"\n#include \"libtorrent\/connection_queue.hpp\"\n#include \"libtorrent\/http_connection.hpp\"\n#include \"setup_transfer.hpp\"\n\n#include <fstream>\n#include <boost\/optional.hpp>\n\nusing namespace libtorrent;\n\nio_service ios;\nconnection_queue cq(ios);\n\nint connect_handler_called = 0;\nint handler_called = 0;\nint data_size = 0;\nint http_status = 0;\nasio::error_code error_code;\nchar data_buffer[4000];\n\nvoid print_http_header(http_parser const& p)\n{\n\tstd::cerr << \" < \" << p.status_code() << \" \" << p.message() << std::endl;\n\n\tfor (std::map<std::string, std::string>::const_iterator i\n\t\t= p.headers().begin(), end(p.headers().end()); i != end; ++i)\n\t{\n\t\tstd::cerr << \" < \" << i->first << \": \" << i->second << std::endl;\n\t}\n}\n\nvoid http_connect_handler(http_connection& c)\n{\n\t++connect_handler_called;\n\tTEST_CHECK(c.socket().is_open());\n\tstd::cerr << \"connected to: \" << c.socket().remote_endpoint() << std::endl;\n\tTEST_CHECK(c.socket().remote_endpoint().address() == address::from_string(\"127.0.0.1\"));\n}\n\nvoid http_handler(asio::error_code const& ec, http_parser const& parser, char const* data, int size)\n{\n\t++handler_called;\n\tdata_size = size;\n\terror_code = ec;\n\n\tif (parser.header_finished())\n\t{\n\t\thttp_status = parser.status_code();\n\t\tif (http_status == 200)\n\t\t{\n\t\t\tTEST_CHECK(memcmp(data, data_buffer, size) == 0);\n\t\t}\n\t}\n\tprint_http_header(parser);\n\n\tcq.close();\n}\n\nvoid reset_globals()\n{\n\tconnect_handler_called = 0;\n\thandler_called = 0;\n\tdata_size = 0;\n\thttp_status = 0;\n\terror_code = asio::error_code();\n}\n\nvoid run_test(std::string const& url, int size, int status, int connected\n\t, boost::optional<asio::error_code> ec, proxy_settings const& ps)\n{\n\treset_globals();\n\n\tstd::cerr << \" ===== TESTING: \" << url << \" =====\" << std::endl;\n\n\tboost::shared_ptr<http_connection> h(new http_connection(ios, cq\n\t\t, &::http_handler, true, &::http_connect_handler));\n\th->get(url, seconds(30), 0, &ps);\n\tios.reset();\n\tios.run();\n\n\tstd::cerr << \"connect_handler_called: \" << connect_handler_called << std::endl;\n\tstd::cerr << \"handler_called: \" << handler_called << std::endl;\n\tstd::cerr << \"status: \" << http_status << std::endl;\n\tstd::cerr << \"size: \" << data_size << std::endl;\n\tstd::cerr << \"error_code: \" << error_code.message() << std::endl;\n\tTEST_CHECK(connect_handler_called == connected);\n\tTEST_CHECK(handler_called == 1);\t\n\tTEST_CHECK(data_size == size || size == -1);\n\tTEST_CHECK(!ec || error_code == ec);\n\tTEST_CHECK(http_status == status || status == -1);\n}\n\nvoid run_suite(std::string const& protocol, proxy_settings const& ps)\n{\n\tif (ps.type != proxy_settings::none)\n\t{\n\t\tstart_proxy(ps.port, ps.type);\n\t}\n\tchar const* test_name[] = {\"no\", \"SOCKS4\", \"SOCKS5\"\n\t\t, \"SOCKS5 password protected\", \"HTTP\", \"HTTP password protected\"};\n\tstd::cout << \"\\n\\n********************** using \" << test_name[ps.type]\n\t\t<< \" proxy **********************\\n\" << std::endl;\n\n\ttypedef boost::optional<asio::error_code> err;\n\trun_test(protocol + \":\/\/127.0.0.1:8001\/redirect\", 3216, 200, 2, asio::error_code(), ps);\n\trun_test(protocol + \":\/\/127.0.0.1:8001\/infinite_redirect\", 0, 301, 6, asio::error_code(), ps);\n\trun_test(protocol + \":\/\/127.0.0.1:8001\/test_file\", 3216, 200, 1, asio::error_code(), ps);\n\trun_test(protocol + \":\/\/127.0.0.1:8001\/test_file.gz\", 3216, 200, 1, asio::error_code(), ps);\n\trun_test(protocol + \":\/\/127.0.0.1:8001\/non-existing-file\", -1, 404, 1, err(), ps);\n\t\/\/ if we're going through an http proxy, we won't get the same error as if the hostname\n\t\/\/ resolution failed\n\tif ((ps.type == proxy_settings::http || ps.type == proxy_settings::http_pw) && protocol != \"https\")\n\t\trun_test(protocol + \":\/\/non-existent-domain.se\/non-existing-file\", -1, 502, 1, err(), ps);\n\telse\n\t\trun_test(protocol + \":\/\/non-existent-domain.se\/non-existing-file\", -1, -1, 0, err(asio::error::host_not_found), ps);\n\n\tif (ps.type != proxy_settings::none)\n\t\tstop_proxy(ps.port);\n}\n\nint test_main()\n{\n\tstd::srand(std::time(0));\n\tstd::generate(data_buffer, data_buffer + sizeof(data_buffer), &std::rand);\n\tstd::ofstream(\"test_file\").write(data_buffer, 3216);\n\tstd::system(\"gzip -9 -c test_file > test_file.gz\");\n\t\n\tproxy_settings ps;\n\tps.hostname = \"127.0.0.1\";\n\tps.port = 8034;\n\tps.username = \"testuser\";\n\tps.password = \"testpass\";\n\t\n\tstart_web_server(8001);\n\tfor (int i = 0; i < 5; ++i)\n\t{\n\t\tps.type = (proxy_settings::proxy_type)i;\n\t\trun_suite(\"http\", ps);\n\t}\n\tstop_web_server(8001);\n\n#ifdef TORRENT_USE_OPENSSL\n\tstart_web_server(8001, true);\n\tfor (int i = 0; i < 5; ++i)\n\t{\n\t\tps.type = (proxy_settings::proxy_type)i;\n\t\trun_suite(\"https\", ps);\n\t}\n\tstop_web_server(8001);\n#endif\n\n\tstd::remove(\"test_file\");\n\treturn 0;\n}\n\n<commit_msg>fixed http_connection test<commit_after>#include \"test.hpp\"\n#include \"libtorrent\/socket.hpp\"\n#include \"libtorrent\/connection_queue.hpp\"\n#include \"libtorrent\/http_connection.hpp\"\n#include \"setup_transfer.hpp\"\n\n#include <fstream>\n#include <boost\/optional.hpp>\n\nusing namespace libtorrent;\n\nio_service ios;\nconnection_queue cq(ios);\n\nint connect_handler_called = 0;\nint handler_called = 0;\nint data_size = 0;\nint http_status = 0;\nasio::error_code error_code;\nchar data_buffer[4000];\n\nvoid print_http_header(http_parser const& p)\n{\n\tstd::cerr << \" < \" << p.status_code() << \" \" << p.message() << std::endl;\n\n\tfor (std::map<std::string, std::string>::const_iterator i\n\t\t= p.headers().begin(), end(p.headers().end()); i != end; ++i)\n\t{\n\t\tstd::cerr << \" < \" << i->first << \": \" << i->second << std::endl;\n\t}\n}\n\nvoid http_connect_handler(http_connection& c)\n{\n\t++connect_handler_called;\n\tTEST_CHECK(c.socket().is_open());\n\tstd::cerr << \"connected to: \" << c.socket().remote_endpoint() << std::endl;\n\tTEST_CHECK(c.socket().remote_endpoint().address() == address::from_string(\"127.0.0.1\"));\n}\n\nvoid http_handler(asio::error_code const& ec, http_parser const& parser, char const* data, int size)\n{\n\t++handler_called;\n\tdata_size = size;\n\terror_code = ec;\n\n\tif (parser.header_finished())\n\t{\n\t\thttp_status = parser.status_code();\n\t\tif (http_status == 200)\n\t\t{\n\t\t\tTEST_CHECK(memcmp(data, data_buffer, size) == 0);\n\t\t}\n\t}\n\tprint_http_header(parser);\n\n\tcq.close();\n}\n\nvoid reset_globals()\n{\n\tconnect_handler_called = 0;\n\thandler_called = 0;\n\tdata_size = 0;\n\thttp_status = 0;\n\terror_code = asio::error_code();\n}\n\nvoid run_test(std::string const& url, int size, int status, int connected\n\t, boost::optional<asio::error_code> ec, proxy_settings const& ps)\n{\n\treset_globals();\n\n\tstd::cerr << \" ===== TESTING: \" << url << \" =====\" << std::endl;\n\n\tboost::shared_ptr<http_connection> h(new http_connection(ios, cq\n\t\t, &::http_handler, true, &::http_connect_handler));\n\th->get(url, seconds(30), 0, &ps);\n\tios.reset();\n\tios.run();\n\n\tstd::cerr << \"connect_handler_called: \" << connect_handler_called << std::endl;\n\tstd::cerr << \"handler_called: \" << handler_called << std::endl;\n\tstd::cerr << \"status: \" << http_status << std::endl;\n\tstd::cerr << \"size: \" << data_size << std::endl;\n\tstd::cerr << \"error_code: \" << error_code.message() << std::endl;\n\tTEST_CHECK(connect_handler_called == connected);\n\tTEST_CHECK(handler_called == 1);\t\n\tTEST_CHECK(data_size == size || size == -1);\n\tTEST_CHECK(!ec || error_code == *ec);\n\tTEST_CHECK(http_status == status || status == -1);\n}\n\nvoid run_suite(std::string const& protocol, proxy_settings const& ps)\n{\n\tif (ps.type != proxy_settings::none)\n\t{\n\t\tstart_proxy(ps.port, ps.type);\n\t}\n\tchar const* test_name[] = {\"no\", \"SOCKS4\", \"SOCKS5\"\n\t\t, \"SOCKS5 password protected\", \"HTTP\", \"HTTP password protected\"};\n\tstd::cout << \"\\n\\n********************** using \" << test_name[ps.type]\n\t\t<< \" proxy **********************\\n\" << std::endl;\n\n\ttypedef boost::optional<asio::error_code> err;\n\trun_test(protocol + \":\/\/127.0.0.1:8001\/redirect\", 3216, 200, 2, asio::error_code(), ps);\n\trun_test(protocol + \":\/\/127.0.0.1:8001\/infinite_redirect\", 0, 301, 6, asio::error_code(), ps);\n\trun_test(protocol + \":\/\/127.0.0.1:8001\/test_file\", 3216, 200, 1, asio::error_code(), ps);\n\trun_test(protocol + \":\/\/127.0.0.1:8001\/test_file.gz\", 3216, 200, 1, asio::error_code(), ps);\n\trun_test(protocol + \":\/\/127.0.0.1:8001\/non-existing-file\", -1, 404, 1, err(), ps);\n\t\/\/ if we're going through an http proxy, we won't get the same error as if the hostname\n\t\/\/ resolution failed\n\tif ((ps.type == proxy_settings::http || ps.type == proxy_settings::http_pw) && protocol != \"https\")\n\t\trun_test(protocol + \":\/\/non-existent-domain.se\/non-existing-file\", -1, 502, 1, err(), ps);\n\telse\n\t\trun_test(protocol + \":\/\/non-existent-domain.se\/non-existing-file\", -1, -1, 0, err(asio::error::host_not_found), ps);\n\n\tif (ps.type != proxy_settings::none)\n\t\tstop_proxy(ps.port);\n}\n\nint test_main()\n{\n\tstd::srand(std::time(0));\n\tstd::generate(data_buffer, data_buffer + sizeof(data_buffer), &std::rand);\n\tstd::ofstream(\"test_file\").write(data_buffer, 3216);\n\tstd::system(\"gzip -9 -c test_file > test_file.gz\");\n\t\n\tproxy_settings ps;\n\tps.hostname = \"127.0.0.1\";\n\tps.port = 8034;\n\tps.username = \"testuser\";\n\tps.password = \"testpass\";\n\t\n\tstart_web_server(8001);\n\tfor (int i = 0; i < 5; ++i)\n\t{\n\t\tps.type = (proxy_settings::proxy_type)i;\n\t\trun_suite(\"http\", ps);\n\t}\n\tstop_web_server(8001);\n\n#ifdef TORRENT_USE_OPENSSL\n\tstart_web_server(8001, true);\n\tfor (int i = 0; i < 5; ++i)\n\t{\n\t\tps.type = (proxy_settings::proxy_type)i;\n\t\trun_suite(\"https\", ps);\n\t}\n\tstop_web_server(8001);\n#endif\n\n\tstd::remove(\"test_file\");\n\treturn 0;\n}\n\n<|endoftext|>"} {"text":"<commit_before>#include <bits\/stdc++.h>\n\nclass TupleOperations\n{\npublic:\n\n\tstd::tuple<int,int> sM(std::tuple<int,int> tupleToOperate,int coff){\n\t\tstd::get<0>(tupleToOperate)*=coff;\n\t\tstd::get<1>(tupleToOperate)*=coff;\n\t\treturn tupleToOperate;\n\t}\n\n\tstd::tuple<double,double> sM(std::tuple<double,double> tupleToOperate,int coff){\n\t\tstd::get<0>(tupleToOperate)\/=(double)(coff);\n\t\tstd::get<1>(tupleToOperate)\/=(double)(coff);\n\t\treturn tupleToOperate;\n\t}\n\n\tstd::tuple<int,int> aT(std::tuple<int,int> first,std::tuple<int,int> second){\n\t\tstd::get<0>(first)+=std::get<0>(second);\n\t\tstd::get<1>(first)+=std::get<1>(second);\n\t\treturn first;\n\t}\n\n\tstd::tuple<double,double> aT(std::tuple<double,double> first,std::tuple<double,double> second){\n\t\tstd::get<0>(first)+=std::get<0>(second);\n\t\tset::get<1>(first)+=std::get<1>(second);\n\t\treturn first;\n\t}\n\n\tstd::tuple<int,int> dT(std::tuple<int,int> tupleToOperate,int coff){\n\t\tstd::get<0>(tupleToOperate)\/=coff;\n\t\tstd::get<1>(tupleToOperate)\/=coff;\n\t\treturn tupleToOperate;\n\t}\n\n\tstd::tuple<double,double> dT(std::tuple<double,double> tupleToOperate,int coff){\n\t\tstd::get<0>(tupleToOperate)\/=(double)(coff);\n\t\tstd::get<1>(tupleToOperate)\/=(double)(coff);\n\t\treturn tupleToOperate;\n\t}\n};<commit_msg>Added operations for comapring integers and doubles within error range.<commit_after>#include <bits\/stdc++.h>\n\nclass TupleOperations\n{\npublic:\n\n\tbool isSameI(int _first,int _second){\n\t\tif(_first==_second){\n\t\t\treturn true;\n\t\t}\n\t\telse{\n\t\t\treturn false;\n\t\t}\n\t}\n\n\tbool isSameD(double _first,double _second){\n\t\tif(abs(_first-_second)<=1e-6){\n\t\t\treturn true;\n\t\t}\n\t\telse{\n\t\t\treturn false;\n\t\t}\n\t}\n\n\tstd::tuple<int,int> sM(std::tuple<int,int> tupleToOperate,int coff){\n\t\tstd::get<0>(tupleToOperate)*=coff;\n\t\tstd::get<1>(tupleToOperate)*=coff;\n\t\treturn tupleToOperate;\n\t}\n\n\tstd::tuple<double,double> sM(std::tuple<double,double> tupleToOperate,int coff){\n\t\tstd::get<0>(tupleToOperate)\/=(double)(coff);\n\t\tstd::get<1>(tupleToOperate)\/=(double)(coff);\n\t\treturn tupleToOperate;\n\t}\n\n\tstd::tuple<int,int> aT(std::tuple<int,int> first,std::tuple<int,int> second){\n\t\tstd::get<0>(first)+=std::get<0>(second);\n\t\tstd::get<1>(first)+=std::get<1>(second);\n\t\treturn first;\n\t}\n\n\tstd::tuple<double,double> aT(std::tuple<double,double> first,std::tuple<double,double> second){\n\t\tstd::get<0>(first)+=std::get<0>(second);\n\t\tstd::get<1>(first)+=std::get<1>(second);\n\t\treturn first;\n\t}\n\n\tstd::tuple<int,int> dT(std::tuple<int,int> tupleToOperate,int coff){\n\t\tstd::get<0>(tupleToOperate)\/=coff;\n\t\tstd::get<1>(tupleToOperate)\/=coff;\n\t\treturn tupleToOperate;\n\t}\n\n\tstd::tuple<double,double> dT(std::tuple<double,double> tupleToOperate,int coff){\n\t\tstd::get<0>(tupleToOperate)\/=(double)(coff);\n\t\tstd::get<1>(tupleToOperate)\/=(double)(coff);\n\t\treturn tupleToOperate;\n\t}\n};<|endoftext|>"} {"text":"<commit_before>\/\/=- NSErrorChecker.cpp - Coding conventions for uses of NSError -*- 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 a CheckNSError, a flow-insenstive check\n\/\/ that determines if an Objective-C class interface correctly returns\n\/\/ a non-void return type.\n\/\/\n\/\/ File under feature request PR 2600.\n\/\/\n\/\/===----------------------------------------------------------------------===\/\/\n\n#include \"ClangSACheckers.h\"\n#include \"clang\/AST\/Decl.h\"\n#include \"clang\/AST\/DeclObjC.h\"\n#include \"clang\/StaticAnalyzer\/Core\/BugReporter\/BugType.h\"\n#include \"clang\/StaticAnalyzer\/Core\/Checker.h\"\n#include \"clang\/StaticAnalyzer\/Core\/CheckerManager.h\"\n#include \"clang\/StaticAnalyzer\/Core\/PathSensitive\/CheckerContext.h\"\n#include \"clang\/StaticAnalyzer\/Core\/PathSensitive\/ProgramStateTrait.h\"\n#include \"llvm\/ADT\/SmallVector.h\"\n#include \"llvm\/Support\/raw_ostream.h\"\n\nusing namespace clang;\nusing namespace ento;\n\nstatic bool IsNSError(QualType T, IdentifierInfo *II);\nstatic bool IsCFError(QualType T, IdentifierInfo *II);\n\n\/\/===----------------------------------------------------------------------===\/\/\n\/\/ NSErrorMethodChecker\n\/\/===----------------------------------------------------------------------===\/\/\n\nnamespace {\nclass NSErrorMethodChecker\n : public Checker< check::ASTDecl<ObjCMethodDecl> > {\n mutable IdentifierInfo *II;\n\npublic:\n NSErrorMethodChecker() : II(0) { }\n\n void checkASTDecl(const ObjCMethodDecl *D,\n AnalysisManager &mgr, BugReporter &BR) const;\n};\n}\n\nvoid NSErrorMethodChecker::checkASTDecl(const ObjCMethodDecl *D,\n AnalysisManager &mgr,\n BugReporter &BR) const {\n if (!D->isThisDeclarationADefinition())\n return;\n if (!D->getResultType()->isVoidType())\n return;\n\n if (!II)\n II = &D->getASTContext().Idents.get(\"NSError\"); \n\n bool hasNSError = false;\n for (ObjCMethodDecl::param_const_iterator\n I = D->param_begin(), E = D->param_end(); I != E; ++I) {\n if (IsNSError((*I)->getType(), II)) {\n hasNSError = true;\n break;\n }\n }\n\n if (hasNSError) {\n const char *err = \"Method accepting NSError** \"\n \"should have a non-void return value to indicate whether or not an \"\n \"error occurred\";\n PathDiagnosticLocation L =\n PathDiagnosticLocation::create(D, BR.getSourceManager());\n BR.EmitBasicReport(D, \"Bad return type when passing NSError**\",\n \"Coding conventions (Apple)\", err, L);\n }\n}\n\n\/\/===----------------------------------------------------------------------===\/\/\n\/\/ CFErrorFunctionChecker\n\/\/===----------------------------------------------------------------------===\/\/\n\nnamespace {\nclass CFErrorFunctionChecker\n : public Checker< check::ASTDecl<FunctionDecl> > {\n mutable IdentifierInfo *II;\n\npublic:\n CFErrorFunctionChecker() : II(0) { }\n\n void checkASTDecl(const FunctionDecl *D,\n AnalysisManager &mgr, BugReporter &BR) const;\n};\n}\n\nvoid CFErrorFunctionChecker::checkASTDecl(const FunctionDecl *D,\n AnalysisManager &mgr,\n BugReporter &BR) const {\n if (!D->doesThisDeclarationHaveABody())\n return;\n if (!D->getResultType()->isVoidType())\n return;\n\n if (!II)\n II = &D->getASTContext().Idents.get(\"CFErrorRef\"); \n\n bool hasCFError = false;\n for (FunctionDecl::param_const_iterator\n I = D->param_begin(), E = D->param_end(); I != E; ++I) {\n if (IsCFError((*I)->getType(), II)) {\n hasCFError = true;\n break;\n }\n }\n\n if (hasCFError) {\n const char *err = \"Function accepting CFErrorRef* \"\n \"should have a non-void return value to indicate whether or not an \"\n \"error occurred\";\n PathDiagnosticLocation L =\n PathDiagnosticLocation::create(D, BR.getSourceManager());\n BR.EmitBasicReport(D, \"Bad return type when passing CFErrorRef*\",\n \"Coding conventions (Apple)\", err, L);\n }\n}\n\n\/\/===----------------------------------------------------------------------===\/\/\n\/\/ NSOrCFErrorDerefChecker\n\/\/===----------------------------------------------------------------------===\/\/\n\nnamespace {\n\nclass NSErrorDerefBug : public BugType {\npublic:\n NSErrorDerefBug() : BugType(\"NSError** null dereference\",\n \"Coding conventions (Apple)\") {}\n};\n\nclass CFErrorDerefBug : public BugType {\npublic:\n CFErrorDerefBug() : BugType(\"CFErrorRef* null dereference\",\n \"Coding conventions (Apple)\") {}\n};\n\n}\n\nnamespace {\nclass NSOrCFErrorDerefChecker\n : public Checker< check::Location,\n check::Event<ImplicitNullDerefEvent> > {\n mutable IdentifierInfo *NSErrorII, *CFErrorII;\npublic:\n bool ShouldCheckNSError, ShouldCheckCFError;\n NSOrCFErrorDerefChecker() : NSErrorII(0), CFErrorII(0),\n ShouldCheckNSError(0), ShouldCheckCFError(0) { }\n\n void checkLocation(SVal loc, bool isLoad, const Stmt *S,\n CheckerContext &C) const;\n void checkEvent(ImplicitNullDerefEvent event) const;\n};\n}\n\ntypedef llvm::ImmutableMap<SymbolRef, unsigned> ErrorOutFlag;\nREGISTER_TRAIT_WITH_PROGRAMSTATE(NSErrorOut, ErrorOutFlag)\nREGISTER_TRAIT_WITH_PROGRAMSTATE(CFErrorOut, ErrorOutFlag)\n\ntemplate <typename T>\nstatic bool hasFlag(SVal val, ProgramStateRef state) {\n if (SymbolRef sym = val.getAsSymbol())\n if (const unsigned *attachedFlags = state->get<T>(sym))\n return *attachedFlags;\n return false;\n}\n\ntemplate <typename T>\nstatic void setFlag(ProgramStateRef state, SVal val, CheckerContext &C) {\n \/\/ We tag the symbol that the SVal wraps.\n if (SymbolRef sym = val.getAsSymbol())\n C.addTransition(state->set<T>(sym, true));\n}\n\nstatic QualType parameterTypeFromSVal(SVal val, CheckerContext &C) {\n const StackFrameContext *\n SFC = C.getLocationContext()->getCurrentStackFrame();\n if (const loc::MemRegionVal* X = dyn_cast<loc::MemRegionVal>(&val)) {\n const MemRegion* R = X->getRegion();\n if (const VarRegion *VR = R->getAs<VarRegion>())\n if (const StackArgumentsSpaceRegion *\n stackReg = dyn_cast<StackArgumentsSpaceRegion>(VR->getMemorySpace()))\n if (stackReg->getStackFrame() == SFC)\n return VR->getValueType();\n }\n\n return QualType();\n}\n\nvoid NSOrCFErrorDerefChecker::checkLocation(SVal loc, bool isLoad,\n const Stmt *S,\n CheckerContext &C) const {\n if (!isLoad)\n return;\n if (loc.isUndef() || !isa<Loc>(loc))\n return;\n\n ASTContext &Ctx = C.getASTContext();\n ProgramStateRef state = C.getState();\n\n \/\/ If we are loading from NSError**\/CFErrorRef* parameter, mark the resulting\n \/\/ SVal so that we can later check it when handling the\n \/\/ ImplicitNullDerefEvent event.\n \/\/ FIXME: Cumbersome! Maybe add hook at construction of SVals at start of\n \/\/ function ?\n\n QualType parmT = parameterTypeFromSVal(loc, C);\n if (parmT.isNull())\n return;\n\n if (!NSErrorII)\n NSErrorII = &Ctx.Idents.get(\"NSError\");\n if (!CFErrorII)\n CFErrorII = &Ctx.Idents.get(\"CFErrorRef\");\n\n if (ShouldCheckNSError && IsNSError(parmT, NSErrorII)) {\n setFlag<NSErrorOut>(state, state->getSVal(cast<Loc>(loc)), C);\n return;\n }\n\n if (ShouldCheckCFError && IsCFError(parmT, CFErrorII)) {\n setFlag<CFErrorOut>(state, state->getSVal(cast<Loc>(loc)), C);\n return;\n }\n}\n\nvoid NSOrCFErrorDerefChecker::checkEvent(ImplicitNullDerefEvent event) const {\n if (event.IsLoad)\n return;\n\n SVal loc = event.Location;\n ProgramStateRef state = event.SinkNode->getState();\n BugReporter &BR = *event.BR;\n\n bool isNSError = hasFlag<NSErrorOut>(loc, state);\n bool isCFError = false;\n if (!isNSError)\n isCFError = hasFlag<CFErrorOut>(loc, state);\n\n if (!(isNSError || isCFError))\n return;\n\n \/\/ Storing to possible null NSError\/CFErrorRef out parameter.\n\n \/\/ Emit an error.\n std::string err;\n llvm::raw_string_ostream os(err);\n os << \"Potential null dereference. According to coding standards \";\n\n if (isNSError)\n os << \"in 'Creating and Returning NSError Objects' the parameter '\";\n else\n os << \"documented in CoreFoundation\/CFError.h the parameter '\";\n\n os << \"' may be null.\";\n\n BugType *bug = 0;\n if (isNSError)\n bug = new NSErrorDerefBug();\n else\n bug = new CFErrorDerefBug();\n BugReport *report = new BugReport(*bug, os.str(),\n event.SinkNode);\n BR.emitReport(report);\n}\n\nstatic bool IsNSError(QualType T, IdentifierInfo *II) {\n\n const PointerType* PPT = T->getAs<PointerType>();\n if (!PPT)\n return false;\n\n const ObjCObjectPointerType* PT =\n PPT->getPointeeType()->getAs<ObjCObjectPointerType>();\n\n if (!PT)\n return false;\n\n const ObjCInterfaceDecl *ID = PT->getInterfaceDecl();\n\n \/\/ FIXME: Can ID ever be NULL?\n if (ID)\n return II == ID->getIdentifier();\n\n return false;\n}\n\nstatic bool IsCFError(QualType T, IdentifierInfo *II) {\n const PointerType* PPT = T->getAs<PointerType>();\n if (!PPT) return false;\n\n const TypedefType* TT = PPT->getPointeeType()->getAs<TypedefType>();\n if (!TT) return false;\n\n return TT->getDecl()->getIdentifier() == II;\n}\n\nvoid ento::registerNSErrorChecker(CheckerManager &mgr) {\n mgr.registerChecker<NSErrorMethodChecker>();\n NSOrCFErrorDerefChecker *\n checker = mgr.registerChecker<NSOrCFErrorDerefChecker>();\n checker->ShouldCheckNSError = true;\n}\n\nvoid ento::registerCFErrorChecker(CheckerManager &mgr) {\n mgr.registerChecker<CFErrorFunctionChecker>();\n NSOrCFErrorDerefChecker *\n checker = mgr.registerChecker<NSOrCFErrorDerefChecker>();\n checker->ShouldCheckCFError = true;\n}\n<commit_msg>NSErrorChecker: remove quoting the parameter name in the diagnostic until we actually include it's name.<commit_after>\/\/=- NSErrorChecker.cpp - Coding conventions for uses of NSError -*- 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 a CheckNSError, a flow-insenstive check\n\/\/ that determines if an Objective-C class interface correctly returns\n\/\/ a non-void return type.\n\/\/\n\/\/ File under feature request PR 2600.\n\/\/\n\/\/===----------------------------------------------------------------------===\/\/\n\n#include \"ClangSACheckers.h\"\n#include \"clang\/AST\/Decl.h\"\n#include \"clang\/AST\/DeclObjC.h\"\n#include \"clang\/StaticAnalyzer\/Core\/BugReporter\/BugType.h\"\n#include \"clang\/StaticAnalyzer\/Core\/Checker.h\"\n#include \"clang\/StaticAnalyzer\/Core\/CheckerManager.h\"\n#include \"clang\/StaticAnalyzer\/Core\/PathSensitive\/CheckerContext.h\"\n#include \"clang\/StaticAnalyzer\/Core\/PathSensitive\/ProgramStateTrait.h\"\n#include \"llvm\/ADT\/SmallString.h\"\n#include \"llvm\/Support\/raw_ostream.h\"\n\nusing namespace clang;\nusing namespace ento;\n\nstatic bool IsNSError(QualType T, IdentifierInfo *II);\nstatic bool IsCFError(QualType T, IdentifierInfo *II);\n\n\/\/===----------------------------------------------------------------------===\/\/\n\/\/ NSErrorMethodChecker\n\/\/===----------------------------------------------------------------------===\/\/\n\nnamespace {\nclass NSErrorMethodChecker\n : public Checker< check::ASTDecl<ObjCMethodDecl> > {\n mutable IdentifierInfo *II;\n\npublic:\n NSErrorMethodChecker() : II(0) { }\n\n void checkASTDecl(const ObjCMethodDecl *D,\n AnalysisManager &mgr, BugReporter &BR) const;\n};\n}\n\nvoid NSErrorMethodChecker::checkASTDecl(const ObjCMethodDecl *D,\n AnalysisManager &mgr,\n BugReporter &BR) const {\n if (!D->isThisDeclarationADefinition())\n return;\n if (!D->getResultType()->isVoidType())\n return;\n\n if (!II)\n II = &D->getASTContext().Idents.get(\"NSError\"); \n\n bool hasNSError = false;\n for (ObjCMethodDecl::param_const_iterator\n I = D->param_begin(), E = D->param_end(); I != E; ++I) {\n if (IsNSError((*I)->getType(), II)) {\n hasNSError = true;\n break;\n }\n }\n\n if (hasNSError) {\n const char *err = \"Method accepting NSError** \"\n \"should have a non-void return value to indicate whether or not an \"\n \"error occurred\";\n PathDiagnosticLocation L =\n PathDiagnosticLocation::create(D, BR.getSourceManager());\n BR.EmitBasicReport(D, \"Bad return type when passing NSError**\",\n \"Coding conventions (Apple)\", err, L);\n }\n}\n\n\/\/===----------------------------------------------------------------------===\/\/\n\/\/ CFErrorFunctionChecker\n\/\/===----------------------------------------------------------------------===\/\/\n\nnamespace {\nclass CFErrorFunctionChecker\n : public Checker< check::ASTDecl<FunctionDecl> > {\n mutable IdentifierInfo *II;\n\npublic:\n CFErrorFunctionChecker() : II(0) { }\n\n void checkASTDecl(const FunctionDecl *D,\n AnalysisManager &mgr, BugReporter &BR) const;\n};\n}\n\nvoid CFErrorFunctionChecker::checkASTDecl(const FunctionDecl *D,\n AnalysisManager &mgr,\n BugReporter &BR) const {\n if (!D->doesThisDeclarationHaveABody())\n return;\n if (!D->getResultType()->isVoidType())\n return;\n\n if (!II)\n II = &D->getASTContext().Idents.get(\"CFErrorRef\"); \n\n bool hasCFError = false;\n for (FunctionDecl::param_const_iterator\n I = D->param_begin(), E = D->param_end(); I != E; ++I) {\n if (IsCFError((*I)->getType(), II)) {\n hasCFError = true;\n break;\n }\n }\n\n if (hasCFError) {\n const char *err = \"Function accepting CFErrorRef* \"\n \"should have a non-void return value to indicate whether or not an \"\n \"error occurred\";\n PathDiagnosticLocation L =\n PathDiagnosticLocation::create(D, BR.getSourceManager());\n BR.EmitBasicReport(D, \"Bad return type when passing CFErrorRef*\",\n \"Coding conventions (Apple)\", err, L);\n }\n}\n\n\/\/===----------------------------------------------------------------------===\/\/\n\/\/ NSOrCFErrorDerefChecker\n\/\/===----------------------------------------------------------------------===\/\/\n\nnamespace {\n\nclass NSErrorDerefBug : public BugType {\npublic:\n NSErrorDerefBug() : BugType(\"NSError** null dereference\",\n \"Coding conventions (Apple)\") {}\n};\n\nclass CFErrorDerefBug : public BugType {\npublic:\n CFErrorDerefBug() : BugType(\"CFErrorRef* null dereference\",\n \"Coding conventions (Apple)\") {}\n};\n\n}\n\nnamespace {\nclass NSOrCFErrorDerefChecker\n : public Checker< check::Location,\n check::Event<ImplicitNullDerefEvent> > {\n mutable IdentifierInfo *NSErrorII, *CFErrorII;\npublic:\n bool ShouldCheckNSError, ShouldCheckCFError;\n NSOrCFErrorDerefChecker() : NSErrorII(0), CFErrorII(0),\n ShouldCheckNSError(0), ShouldCheckCFError(0) { }\n\n void checkLocation(SVal loc, bool isLoad, const Stmt *S,\n CheckerContext &C) const;\n void checkEvent(ImplicitNullDerefEvent event) const;\n};\n}\n\ntypedef llvm::ImmutableMap<SymbolRef, unsigned> ErrorOutFlag;\nREGISTER_TRAIT_WITH_PROGRAMSTATE(NSErrorOut, ErrorOutFlag)\nREGISTER_TRAIT_WITH_PROGRAMSTATE(CFErrorOut, ErrorOutFlag)\n\ntemplate <typename T>\nstatic bool hasFlag(SVal val, ProgramStateRef state) {\n if (SymbolRef sym = val.getAsSymbol())\n if (const unsigned *attachedFlags = state->get<T>(sym))\n return *attachedFlags;\n return false;\n}\n\ntemplate <typename T>\nstatic void setFlag(ProgramStateRef state, SVal val, CheckerContext &C) {\n \/\/ We tag the symbol that the SVal wraps.\n if (SymbolRef sym = val.getAsSymbol())\n C.addTransition(state->set<T>(sym, true));\n}\n\nstatic QualType parameterTypeFromSVal(SVal val, CheckerContext &C) {\n const StackFrameContext *\n SFC = C.getLocationContext()->getCurrentStackFrame();\n if (const loc::MemRegionVal* X = dyn_cast<loc::MemRegionVal>(&val)) {\n const MemRegion* R = X->getRegion();\n if (const VarRegion *VR = R->getAs<VarRegion>())\n if (const StackArgumentsSpaceRegion *\n stackReg = dyn_cast<StackArgumentsSpaceRegion>(VR->getMemorySpace()))\n if (stackReg->getStackFrame() == SFC)\n return VR->getValueType();\n }\n\n return QualType();\n}\n\nvoid NSOrCFErrorDerefChecker::checkLocation(SVal loc, bool isLoad,\n const Stmt *S,\n CheckerContext &C) const {\n if (!isLoad)\n return;\n if (loc.isUndef() || !isa<Loc>(loc))\n return;\n\n ASTContext &Ctx = C.getASTContext();\n ProgramStateRef state = C.getState();\n\n \/\/ If we are loading from NSError**\/CFErrorRef* parameter, mark the resulting\n \/\/ SVal so that we can later check it when handling the\n \/\/ ImplicitNullDerefEvent event.\n \/\/ FIXME: Cumbersome! Maybe add hook at construction of SVals at start of\n \/\/ function ?\n\n QualType parmT = parameterTypeFromSVal(loc, C);\n if (parmT.isNull())\n return;\n\n if (!NSErrorII)\n NSErrorII = &Ctx.Idents.get(\"NSError\");\n if (!CFErrorII)\n CFErrorII = &Ctx.Idents.get(\"CFErrorRef\");\n\n if (ShouldCheckNSError && IsNSError(parmT, NSErrorII)) {\n setFlag<NSErrorOut>(state, state->getSVal(cast<Loc>(loc)), C);\n return;\n }\n\n if (ShouldCheckCFError && IsCFError(parmT, CFErrorII)) {\n setFlag<CFErrorOut>(state, state->getSVal(cast<Loc>(loc)), C);\n return;\n }\n}\n\nvoid NSOrCFErrorDerefChecker::checkEvent(ImplicitNullDerefEvent event) const {\n if (event.IsLoad)\n return;\n\n SVal loc = event.Location;\n ProgramStateRef state = event.SinkNode->getState();\n BugReporter &BR = *event.BR;\n\n bool isNSError = hasFlag<NSErrorOut>(loc, state);\n bool isCFError = false;\n if (!isNSError)\n isCFError = hasFlag<CFErrorOut>(loc, state);\n\n if (!(isNSError || isCFError))\n return;\n\n \/\/ Storing to possible null NSError\/CFErrorRef out parameter.\n llvm::SmallString<128> Buf;\n llvm::raw_svector_ostream os(Buf);\n\n os << \"Potential null dereference. According to coding standards \";\n os << (isNSError\n ? \"in 'Creating and Returning NSError Objects' the parameter\"\n : \"documented in CoreFoundation\/CFError.h the parameter\");\n\n os << \" may be null\";\n\n BugType *bug = 0;\n if (isNSError)\n bug = new NSErrorDerefBug();\n else\n bug = new CFErrorDerefBug();\n BugReport *report = new BugReport(*bug, os.str(),\n event.SinkNode);\n BR.emitReport(report);\n}\n\nstatic bool IsNSError(QualType T, IdentifierInfo *II) {\n\n const PointerType* PPT = T->getAs<PointerType>();\n if (!PPT)\n return false;\n\n const ObjCObjectPointerType* PT =\n PPT->getPointeeType()->getAs<ObjCObjectPointerType>();\n\n if (!PT)\n return false;\n\n const ObjCInterfaceDecl *ID = PT->getInterfaceDecl();\n\n \/\/ FIXME: Can ID ever be NULL?\n if (ID)\n return II == ID->getIdentifier();\n\n return false;\n}\n\nstatic bool IsCFError(QualType T, IdentifierInfo *II) {\n const PointerType* PPT = T->getAs<PointerType>();\n if (!PPT) return false;\n\n const TypedefType* TT = PPT->getPointeeType()->getAs<TypedefType>();\n if (!TT) return false;\n\n return TT->getDecl()->getIdentifier() == II;\n}\n\nvoid ento::registerNSErrorChecker(CheckerManager &mgr) {\n mgr.registerChecker<NSErrorMethodChecker>();\n NSOrCFErrorDerefChecker *\n checker = mgr.registerChecker<NSOrCFErrorDerefChecker>();\n checker->ShouldCheckNSError = true;\n}\n\nvoid ento::registerCFErrorChecker(CheckerManager &mgr) {\n mgr.registerChecker<CFErrorFunctionChecker>();\n NSOrCFErrorDerefChecker *\n checker = mgr.registerChecker<NSOrCFErrorDerefChecker>();\n checker->ShouldCheckCFError = true;\n}\n<|endoftext|>"} {"text":"<commit_before>\/\/ Bindings\n#include \"PyROOT.h\"\n#include \"Adapters.h\"\n#include \"Utility.h\"\n\n\/\/ ROOT\n#include \"TInterpreter.h\"\n#include \"TBaseClass.h\"\n#include \"TClass.h\"\n#include \"TClassEdit.h\"\n#include \"TDataType.h\"\n#include \"TDataMember.h\"\n#include \"TMethod.h\"\n#include \"TFunction.h\"\n#include \"TMethodArg.h\"\n#include \"TList.h\"\n#include \"TError.h\"\n\n\n\/\/- helper -------------------------------------------------------------------\nnamespace PyROOT {\n inline std::string UnqualifiedTypeName( const std::string name ) {\n return TClassEdit::ShortType(\n TClassEdit::CleanType( name.c_str(), 1 ).c_str(), 5 );\n }\n} \/\/ namespace PyROOT\n\n\/\/= TReturnTypeAdapter =======================================================\nstd::string PyROOT::TReturnTypeAdapter::Name( unsigned int mod ) const\n{\n\/\/ get the name of the return type that is being adapted\n std::string name = fName;\n\n if ( mod & Rflx::FINAL )\n name = Utility::ResolveTypedef( name );\n\n if ( ! ( mod & Rflx::QUALIFIED ) )\n name = UnqualifiedTypeName( fName );\n\n return name;\n}\n\n\n\/\/= TMemberAdapter ===========================================================\nPyROOT::TMemberAdapter::TMemberAdapter( TMethod* meth ) : fMember( meth )\n{\n \/* empty *\/\n}\n\n\/\/____________________________________________________________________________\nPyROOT::TMemberAdapter::operator TMethod*() const\n{\n\/\/ cast the adapter to a TMethod* being adapted, returns 0 on failure\n return dynamic_cast< TMethod* >( const_cast< TDictionary* >( fMember ) );\n}\n\n\/\/____________________________________________________________________________\nPyROOT::TMemberAdapter::TMemberAdapter( TFunction* func ) : fMember( func )\n{\n \/* empty *\/\n}\n\n\/\/____________________________________________________________________________\nPyROOT::TMemberAdapter::operator TFunction*() const\n{\n\/\/ cast the adapter to a TFunction* being adapted, returns 0 on failure\n return dynamic_cast< TFunction* >( const_cast< TDictionary* >( fMember ) );\n}\n\n\/\/____________________________________________________________________________\nPyROOT::TMemberAdapter::TMemberAdapter( TDataMember* mb ) : fMember( mb )\n{\n \/* empty *\/\n}\n\n\/\/____________________________________________________________________________\nPyROOT::TMemberAdapter::operator TDataMember*() const\n{\n\/\/ cast the adapter to a TDataMember* being adapted, returns 0 on failure\n return dynamic_cast< TDataMember* >( const_cast< TDictionary* >( fMember ) );\n}\n\n\/\/____________________________________________________________________________\nPyROOT::TMemberAdapter::TMemberAdapter( TMethodArg* ma ) : fMember( ma )\n{\n \/* empty *\/\n}\n\n\/\/____________________________________________________________________________\nPyROOT::TMemberAdapter::operator TMethodArg*() const\n{\n\/\/ cast the adapter to a TMethodArg* being adapted, returns 0 on failure\n return dynamic_cast< TMethodArg* >( const_cast< TDictionary* >( fMember ) );\n}\n\n\/\/____________________________________________________________________________\nstd::string PyROOT::TMemberAdapter::Name( unsigned int mod ) const\n{\n\/\/ Return name of the type described by fMember\n TMethodArg* arg = (TMethodArg*)*this;\n\n if ( arg ) {\n\n std::string name = arg->GetTypeNormalizedName();\n if ( mod & Rflx::FINAL )\n name = Utility::ResolveTypedef( name );\n\n if ( ! ( mod & Rflx::QUALIFIED ) )\n name = UnqualifiedTypeName( name );\n\n return name;\n\n } else if ( mod & Rflx::FINAL )\n return Utility::ResolveTypedef( fMember->GetName() );\n\n if ( fMember )\n return fMember->GetName();\n return \"<unknown>\"; \/\/ happens for classes w\/o dictionary\n}\n\n\/\/____________________________________________________________________________\nBool_t PyROOT::TMemberAdapter::IsConstant() const\n{\n\/\/ test if the adapted member is a const method\n return fMember->Property() & kIsConstMethod;\n}\n\n\/\/____________________________________________________________________________\nBool_t PyROOT::TMemberAdapter::IsConstructor() const\n{\n\/\/ test if the adapted member is a const method\n return ((TFunction*)fMember) ? (((TFunction*)fMember)->ExtraProperty() & kIsConstructor) : kFALSE;\n}\n\n\/\/____________________________________________________________________________\nBool_t PyROOT::TMemberAdapter::IsEnum() const\n{\n\/\/ test if the adapted member is of an enum type\n return fMember->Property() & kIsEnum;\n}\n\n\/\/____________________________________________________________________________\nBool_t PyROOT::TMemberAdapter::IsPublic() const\n{\n\/\/ test if the adapted member represents an public (data) member\n return fMember->Property() & kIsPublic;\n}\n\n\/\/____________________________________________________________________________\nBool_t PyROOT::TMemberAdapter::IsStatic() const\n{\n\/\/ test if the adapted member represents a class (data) member\n if ( DeclaringScope().IsNamespace() )\n return kTRUE;\n return fMember->Property() & kIsStatic;\n}\n\n\/\/____________________________________________________________________________\nsize_t PyROOT::TMemberAdapter::FunctionParameterSize( Bool_t required ) const\n{\n\/\/ get the total number of parameters that the adapted function\/method takes\n TFunction* func = (TFunction*)fMember;\n if ( ! func )\n return 0;\n\n if ( required == true )\n return func->GetNargs() - func->GetNargsOpt();\n\n return func->GetNargs();\n}\n\n\/\/____________________________________________________________________________\nPyROOT::TMemberAdapter PyROOT::TMemberAdapter::FunctionParameterAt( size_t nth ) const\n{\n\/\/ get the type info of the function parameter at position nth\n return (TMethodArg*)((TFunction*)fMember)->GetListOfMethodArgs()->At( nth );\n}\n\n\/\/____________________________________________________________________________\nstd::string PyROOT::TMemberAdapter::FunctionParameterNameAt( size_t nth ) const\n{\n\/\/ get the formal name, if available, of the function parameter at position nth\n const char* name =\n ((TMethodArg*)((TFunction*)fMember)->GetListOfMethodArgs()->At( nth ))->GetName();\n\n if ( name )\n return name;\n return \"\";\n}\n\n\/\/____________________________________________________________________________\nstd::string PyROOT::TMemberAdapter::FunctionParameterDefaultAt( size_t nth ) const\n{\n\/\/ get the default value, if available, of the function parameter at position nth\n TMethodArg* arg = (TMethodArg*)((TFunction*)fMember)->GetListOfMethodArgs()->At( nth );\n const char* def = arg->GetDefault();\n\n if ( ! def )\n return \"\";\n\n\/\/ special case for strings: \"some value\" -> \"\"some value\"\n if ( strstr( Utility::ResolveTypedef( arg->GetTypeNormalizedName() ).c_str(), \"char*\" ) ) {\n std::string sdef = \"\\\"\";\n sdef += def;\n sdef += \"\\\"\";\n return sdef;\n }\n\n return def;\n}\n\n\/\/____________________________________________________________________________\nPyROOT::TReturnTypeAdapter PyROOT::TMemberAdapter::ReturnType() const\n{\n\/\/ get the return type of the wrapped function\/method\n return TReturnTypeAdapter( ((TFunction*)fMember)->GetReturnTypeNormalizedName() );\n}\n\n\/\/____________________________________________________________________________\nPyROOT::TScopeAdapter PyROOT::TMemberAdapter::DeclaringScope() const\n{\n\/\/ get the declaring scope (class) of the wrapped function\/method\n TMethod* method = (TMethod*)*this;\n if ( method )\n return method->GetClass();\n\n TDataMember* data = (TDataMember*)*this;\n if ( data )\n return data->GetClass();\n\n\/\/ happens for free-standing functions (i.e. global scope)\n return std::string( \"\" );\n}\n\n\n\/\/= TBaseAdapter =============================================================\nstd::string PyROOT::TBaseAdapter::Name() const\n{\n\/\/ get the name of the base class that is being adapted\n return fBase->GetName();\n}\n\n\n\/\/= TScopeAdapter ============================================================\nPyROOT::TScopeAdapter::TScopeAdapter( TClass* klass ) : fClass( klass )\n{\n\/\/ wrap a class (scope)\n if ( fClass.GetClass() != 0 )\n fName = fClass->GetName();\n}\n\n\/\/____________________________________________________________________________\nPyROOT::TScopeAdapter::TScopeAdapter( const std::string& name ) :\n fClass( name.c_str() ), fName( name )\n{\n \/* empty *\/\n}\n\nPyROOT::TScopeAdapter::TScopeAdapter( const TMemberAdapter& mb ) :\n fClass( mb.Name( Rflx::SCOPED ).c_str() ),\n fName( mb.Name( Rflx::QUALIFIED | Rflx::SCOPED ) )\n{\n \/* empty *\/\n}\n\n\/\/____________________________________________________________________________\nPyROOT::TScopeAdapter PyROOT::TScopeAdapter::ByName( const std::string& name, Bool_t quiet )\n{\n\/\/ lookup a scope (class) by name\n Int_t oldEIL = gErrorIgnoreLevel;\n if ( quiet )\n gErrorIgnoreLevel = 3000;\n\n TClassRef klass( name.c_str() );\n\n gErrorIgnoreLevel = oldEIL;\n\n return klass.GetClass();\n}\n\n\/\/____________________________________________________________________________\nstd::string PyROOT::TScopeAdapter::Name( unsigned int mod ) const\n{\n\/\/ Return name of type described by fClass\n if ( ! fClass.GetClass() || ! fClass->Property() ) {\n \/\/ fundamental types have no class, and unknown classes have no property\n std::string name = fName;\n\n if ( mod & Rflx::FINAL )\n name = Utility::ResolveTypedef( name );\n\n if ( ! ( mod & Rflx::QUALIFIED ) )\n name = UnqualifiedTypeName( fName );\n\n return name;\n }\n\n std::string name = fClass->GetName();\n if ( mod & Rflx::FINAL )\n name = Utility::ResolveTypedef( name );\n\n if ( ! (mod & Rflx::SCOPED) ) {\n \/\/ remove scope from the name\n Int_t tpl_open = 0;\n for ( std::string::size_type pos = name.size() - 1; 0 < pos; --pos ) {\n std::string::value_type c = name[ pos ];\n\n \/\/ count '<' and '>' to be able to skip template contents\n if ( c == '>' )\n ++tpl_open;\n else if ( c == '<' )\n --tpl_open;\n else if ( tpl_open == 0 && c == ':' && 0 < pos && name[ pos-1 ] == ':' ) {\n \/\/ found scope, strip name from it\n name = name.substr( pos+1, std::string::npos );\n break;\n }\n }\n }\n\n return name;\n}\n\n\/\/____________________________________________________________________________\nsize_t PyROOT::TScopeAdapter::BaseSize() const\n{\n\/\/ get the total number of base classes that this class has\n if ( fClass.GetClass() && fClass->GetListOfBases() != 0 )\n return fClass->GetListOfBases()->GetSize();\n\n return 0;\n}\n\n\/\/____________________________________________________________________________\nPyROOT::TBaseAdapter PyROOT::TScopeAdapter::BaseAt( size_t nth ) const\n{\n\/\/ get the nth base of this class\n return (TBaseClass*)fClass->GetListOfBases()->At( nth );\n}\n\n\/\/____________________________________________________________________________\nsize_t PyROOT::TScopeAdapter::FunctionMemberSize() const\n{\n\/\/ get the total number of methods that this class has\n if ( fClass.GetClass() )\n return fClass->GetListOfMethods()->GetSize();\n\n return 0;\n}\n\n\/\/____________________________________________________________________________\nPyROOT::TMemberAdapter PyROOT::TScopeAdapter::FunctionMemberAt( size_t nth ) const\n{\n\/\/ get the nth method of this class\n return (TMethod*)fClass->GetListOfMethods()->At( nth );\n}\n\n\/\/____________________________________________________________________________\nsize_t PyROOT::TScopeAdapter::DataMemberSize() const\n{\n\/\/ get the total number of data members that this class has\n if ( fClass.GetClass() )\n return fClass->GetListOfDataMembers()->GetSize();\n\n return 0;\n}\n\n\/\/____________________________________________________________________________\nPyROOT::TMemberAdapter PyROOT::TScopeAdapter::DataMemberAt( size_t nth ) const\n{\n\/\/ get the nth data member of this class\n return (TDataMember*)fClass->GetListOfDataMembers()->At( nth );\n}\n\n\/\/____________________________________________________________________________\nPyROOT::TScopeAdapter::operator Bool_t() const\n{\n\/\/ check the validity of this scope (class)\n if ( fName.empty() )\n return false;\n\n Bool_t b = kFALSE;\n\n Int_t oldEIL = gErrorIgnoreLevel;\n gErrorIgnoreLevel = 3000;\n std::string scname = Name( Rflx::SCOPED );\n TClass* klass = TClass::GetClass( scname.c_str() );\n if ( klass && klass->GetClassInfo() ) \/\/ works for normal case w\/ dict\n b = gInterpreter->ClassInfo_IsValid( klass->GetClassInfo() );\n else { \/\/ special case for forward declared classes\n ClassInfo_t* ci = gInterpreter->ClassInfo_Factory( scname.c_str() );\n if ( ci ) {\n b = gInterpreter->ClassInfo_IsValid( ci );\n gInterpreter->ClassInfo_Delete( ci ); \/\/ we own the fresh class info\n }\n }\n gErrorIgnoreLevel = oldEIL;\n return b;\n}\n\n\/\/____________________________________________________________________________\nBool_t PyROOT::TScopeAdapter::IsComplete() const\n{\n\/\/ verify whether the dictionary of this class is fully available\n Bool_t b = kFALSE;\n\n Int_t oldEIL = gErrorIgnoreLevel;\n gErrorIgnoreLevel = 3000;\n std::string scname = Name( Rflx::SCOPED );\n TClass* klass = TClass::GetClass( scname.c_str() );\n if ( klass && klass->GetClassInfo() ) \/\/ works for normal case w\/ dict\n b = gInterpreter->ClassInfo_IsLoaded( klass->GetClassInfo() );\n else { \/\/ special case for forward declared classes\n ClassInfo_t* ci = gInterpreter->ClassInfo_Factory( scname.c_str() );\n if ( ci ) {\n b = gInterpreter->ClassInfo_IsLoaded( ci );\n gInterpreter->ClassInfo_Delete( ci ); \/\/ we own the fresh class info\n }\n }\n gErrorIgnoreLevel = oldEIL;\n return b;\n}\n\n\/\/____________________________________________________________________________\nBool_t PyROOT::TScopeAdapter::IsClass() const\n{\n\/\/ test if this scope represents a class\n if ( fClass.GetClass() ) {\n \/\/ some inverted logic: we don't have a TClass, but a builtin will be recognized, so\n \/\/ if it is NOT a builtin, it is a class or struct (but may be missing dictionary)\n return (fClass->Property() & kIsClass) || ! (fClass->Property() & kIsFundamental);\n }\n\n\/\/ no class can mean either is no class (i.e. builtin), or no dict but coming in\n\/\/ through PyCintex\/Reflex ... as a workaround, use TDataTypes that has a full\n\/\/ enumeration of builtin types\n return TDataType( Name( Rflx::FINAL | Rflx::SCOPED ).c_str() ).GetType() == kOther_t;\n}\n\n\/\/____________________________________________________________________________\nBool_t PyROOT::TScopeAdapter::IsStruct() const\n{\n\/\/ test if this scope represents a struct\n if ( fClass.GetClass() ) {\n \/\/ same logic as for IsClass() above ...\n return (fClass->Property() & kIsStruct) || ! (fClass->Property() & kIsFundamental);\n }\n\n\/\/ same logic as for IsClass() above ...\n return TDataType( Name( Rflx::FINAL | Rflx::SCOPED ).c_str() ).GetType() == kOther_t;\n}\n\n\/\/____________________________________________________________________________\nBool_t PyROOT::TScopeAdapter::IsNamespace() const\n{\n\/\/ test if this scope represents a namespace\n if ( fClass.GetClass() )\n return fClass->Property() & kIsNamespace;\n\n return kFALSE;\n}\n\n\/\/____________________________________________________________________________\nBool_t PyROOT::TScopeAdapter::IsAbstract() const\n{\n\/\/ test if this scope represents an abstract class\n if ( fClass.GetClass() )\n return fClass->Property() & kIsAbstract; \/\/ assume set only for classes\n\n return kFALSE;\n}\n<commit_msg>Avoid doing parsing 'just' to check validity in PyROOT::TScopeAdapter::operator bool<commit_after>\/\/ Bindings\n#include \"PyROOT.h\"\n#include \"Adapters.h\"\n#include \"Utility.h\"\n\n\/\/ ROOT\n#include \"TInterpreter.h\"\n#include \"TBaseClass.h\"\n#include \"TClass.h\"\n#include \"TClassEdit.h\"\n#include \"TDataType.h\"\n#include \"TDataMember.h\"\n#include \"TMethod.h\"\n#include \"TFunction.h\"\n#include \"TMethodArg.h\"\n#include \"TList.h\"\n#include \"TError.h\"\n\n\n\/\/- helper -------------------------------------------------------------------\nnamespace PyROOT {\n inline std::string UnqualifiedTypeName( const std::string name ) {\n return TClassEdit::ShortType(\n TClassEdit::CleanType( name.c_str(), 1 ).c_str(), 5 );\n }\n} \/\/ namespace PyROOT\n\n\/\/= TReturnTypeAdapter =======================================================\nstd::string PyROOT::TReturnTypeAdapter::Name( unsigned int mod ) const\n{\n\/\/ get the name of the return type that is being adapted\n std::string name = fName;\n\n if ( mod & Rflx::FINAL )\n name = Utility::ResolveTypedef( name );\n\n if ( ! ( mod & Rflx::QUALIFIED ) )\n name = UnqualifiedTypeName( fName );\n\n return name;\n}\n\n\n\/\/= TMemberAdapter ===========================================================\nPyROOT::TMemberAdapter::TMemberAdapter( TMethod* meth ) : fMember( meth )\n{\n \/* empty *\/\n}\n\n\/\/____________________________________________________________________________\nPyROOT::TMemberAdapter::operator TMethod*() const\n{\n\/\/ cast the adapter to a TMethod* being adapted, returns 0 on failure\n return dynamic_cast< TMethod* >( const_cast< TDictionary* >( fMember ) );\n}\n\n\/\/____________________________________________________________________________\nPyROOT::TMemberAdapter::TMemberAdapter( TFunction* func ) : fMember( func )\n{\n \/* empty *\/\n}\n\n\/\/____________________________________________________________________________\nPyROOT::TMemberAdapter::operator TFunction*() const\n{\n\/\/ cast the adapter to a TFunction* being adapted, returns 0 on failure\n return dynamic_cast< TFunction* >( const_cast< TDictionary* >( fMember ) );\n}\n\n\/\/____________________________________________________________________________\nPyROOT::TMemberAdapter::TMemberAdapter( TDataMember* mb ) : fMember( mb )\n{\n \/* empty *\/\n}\n\n\/\/____________________________________________________________________________\nPyROOT::TMemberAdapter::operator TDataMember*() const\n{\n\/\/ cast the adapter to a TDataMember* being adapted, returns 0 on failure\n return dynamic_cast< TDataMember* >( const_cast< TDictionary* >( fMember ) );\n}\n\n\/\/____________________________________________________________________________\nPyROOT::TMemberAdapter::TMemberAdapter( TMethodArg* ma ) : fMember( ma )\n{\n \/* empty *\/\n}\n\n\/\/____________________________________________________________________________\nPyROOT::TMemberAdapter::operator TMethodArg*() const\n{\n\/\/ cast the adapter to a TMethodArg* being adapted, returns 0 on failure\n return dynamic_cast< TMethodArg* >( const_cast< TDictionary* >( fMember ) );\n}\n\n\/\/____________________________________________________________________________\nstd::string PyROOT::TMemberAdapter::Name( unsigned int mod ) const\n{\n\/\/ Return name of the type described by fMember\n TMethodArg* arg = (TMethodArg*)*this;\n\n if ( arg ) {\n\n std::string name = arg->GetTypeNormalizedName();\n if ( mod & Rflx::FINAL )\n name = Utility::ResolveTypedef( name );\n\n if ( ! ( mod & Rflx::QUALIFIED ) )\n name = UnqualifiedTypeName( name );\n\n return name;\n\n } else if ( mod & Rflx::FINAL )\n return Utility::ResolveTypedef( fMember->GetName() );\n\n if ( fMember )\n return fMember->GetName();\n return \"<unknown>\"; \/\/ happens for classes w\/o dictionary\n}\n\n\/\/____________________________________________________________________________\nBool_t PyROOT::TMemberAdapter::IsConstant() const\n{\n\/\/ test if the adapted member is a const method\n return fMember->Property() & kIsConstMethod;\n}\n\n\/\/____________________________________________________________________________\nBool_t PyROOT::TMemberAdapter::IsConstructor() const\n{\n\/\/ test if the adapted member is a const method\n return ((TFunction*)fMember) ? (((TFunction*)fMember)->ExtraProperty() & kIsConstructor) : kFALSE;\n}\n\n\/\/____________________________________________________________________________\nBool_t PyROOT::TMemberAdapter::IsEnum() const\n{\n\/\/ test if the adapted member is of an enum type\n return fMember->Property() & kIsEnum;\n}\n\n\/\/____________________________________________________________________________\nBool_t PyROOT::TMemberAdapter::IsPublic() const\n{\n\/\/ test if the adapted member represents an public (data) member\n return fMember->Property() & kIsPublic;\n}\n\n\/\/____________________________________________________________________________\nBool_t PyROOT::TMemberAdapter::IsStatic() const\n{\n\/\/ test if the adapted member represents a class (data) member\n if ( DeclaringScope().IsNamespace() )\n return kTRUE;\n return fMember->Property() & kIsStatic;\n}\n\n\/\/____________________________________________________________________________\nsize_t PyROOT::TMemberAdapter::FunctionParameterSize( Bool_t required ) const\n{\n\/\/ get the total number of parameters that the adapted function\/method takes\n TFunction* func = (TFunction*)fMember;\n if ( ! func )\n return 0;\n\n if ( required == true )\n return func->GetNargs() - func->GetNargsOpt();\n\n return func->GetNargs();\n}\n\n\/\/____________________________________________________________________________\nPyROOT::TMemberAdapter PyROOT::TMemberAdapter::FunctionParameterAt( size_t nth ) const\n{\n\/\/ get the type info of the function parameter at position nth\n return (TMethodArg*)((TFunction*)fMember)->GetListOfMethodArgs()->At( nth );\n}\n\n\/\/____________________________________________________________________________\nstd::string PyROOT::TMemberAdapter::FunctionParameterNameAt( size_t nth ) const\n{\n\/\/ get the formal name, if available, of the function parameter at position nth\n const char* name =\n ((TMethodArg*)((TFunction*)fMember)->GetListOfMethodArgs()->At( nth ))->GetName();\n\n if ( name )\n return name;\n return \"\";\n}\n\n\/\/____________________________________________________________________________\nstd::string PyROOT::TMemberAdapter::FunctionParameterDefaultAt( size_t nth ) const\n{\n\/\/ get the default value, if available, of the function parameter at position nth\n TMethodArg* arg = (TMethodArg*)((TFunction*)fMember)->GetListOfMethodArgs()->At( nth );\n const char* def = arg->GetDefault();\n\n if ( ! def )\n return \"\";\n\n\/\/ special case for strings: \"some value\" -> \"\"some value\"\n if ( strstr( Utility::ResolveTypedef( arg->GetTypeNormalizedName() ).c_str(), \"char*\" ) ) {\n std::string sdef = \"\\\"\";\n sdef += def;\n sdef += \"\\\"\";\n return sdef;\n }\n\n return def;\n}\n\n\/\/____________________________________________________________________________\nPyROOT::TReturnTypeAdapter PyROOT::TMemberAdapter::ReturnType() const\n{\n\/\/ get the return type of the wrapped function\/method\n return TReturnTypeAdapter( ((TFunction*)fMember)->GetReturnTypeNormalizedName() );\n}\n\n\/\/____________________________________________________________________________\nPyROOT::TScopeAdapter PyROOT::TMemberAdapter::DeclaringScope() const\n{\n\/\/ get the declaring scope (class) of the wrapped function\/method\n TMethod* method = (TMethod*)*this;\n if ( method )\n return method->GetClass();\n\n TDataMember* data = (TDataMember*)*this;\n if ( data )\n return data->GetClass();\n\n\/\/ happens for free-standing functions (i.e. global scope)\n return std::string( \"\" );\n}\n\n\n\/\/= TBaseAdapter =============================================================\nstd::string PyROOT::TBaseAdapter::Name() const\n{\n\/\/ get the name of the base class that is being adapted\n return fBase->GetName();\n}\n\n\n\/\/= TScopeAdapter ============================================================\nPyROOT::TScopeAdapter::TScopeAdapter( TClass* klass ) : fClass( klass )\n{\n\/\/ wrap a class (scope)\n if ( fClass.GetClass() != 0 )\n fName = fClass->GetName();\n}\n\n\/\/____________________________________________________________________________\nPyROOT::TScopeAdapter::TScopeAdapter( const std::string& name ) :\n fClass( name.c_str() ), fName( name )\n{\n \/* empty *\/\n}\n\nPyROOT::TScopeAdapter::TScopeAdapter( const TMemberAdapter& mb ) :\n fClass( mb.Name( Rflx::SCOPED ).c_str() ),\n fName( mb.Name( Rflx::QUALIFIED | Rflx::SCOPED ) )\n{\n \/* empty *\/\n}\n\n\/\/____________________________________________________________________________\nPyROOT::TScopeAdapter PyROOT::TScopeAdapter::ByName( const std::string& name, Bool_t quiet )\n{\n\/\/ lookup a scope (class) by name\n Int_t oldEIL = gErrorIgnoreLevel;\n if ( quiet )\n gErrorIgnoreLevel = 3000;\n\n TClassRef klass( name.c_str() );\n\n gErrorIgnoreLevel = oldEIL;\n\n return klass.GetClass();\n}\n\n\/\/____________________________________________________________________________\nstd::string PyROOT::TScopeAdapter::Name( unsigned int mod ) const\n{\n\/\/ Return name of type described by fClass\n if ( ! fClass.GetClass() || ! fClass->Property() ) {\n \/\/ fundamental types have no class, and unknown classes have no property\n std::string name = fName;\n\n if ( mod & Rflx::FINAL )\n name = Utility::ResolveTypedef( name );\n\n if ( ! ( mod & Rflx::QUALIFIED ) )\n name = UnqualifiedTypeName( fName );\n\n return name;\n }\n\n std::string name = fClass->GetName();\n if ( mod & Rflx::FINAL )\n name = Utility::ResolveTypedef( name );\n\n if ( ! (mod & Rflx::SCOPED) ) {\n \/\/ remove scope from the name\n Int_t tpl_open = 0;\n for ( std::string::size_type pos = name.size() - 1; 0 < pos; --pos ) {\n std::string::value_type c = name[ pos ];\n\n \/\/ count '<' and '>' to be able to skip template contents\n if ( c == '>' )\n ++tpl_open;\n else if ( c == '<' )\n --tpl_open;\n else if ( tpl_open == 0 && c == ':' && 0 < pos && name[ pos-1 ] == ':' ) {\n \/\/ found scope, strip name from it\n name = name.substr( pos+1, std::string::npos );\n break;\n }\n }\n }\n\n return name;\n}\n\n\/\/____________________________________________________________________________\nsize_t PyROOT::TScopeAdapter::BaseSize() const\n{\n\/\/ get the total number of base classes that this class has\n if ( fClass.GetClass() && fClass->GetListOfBases() != 0 )\n return fClass->GetListOfBases()->GetSize();\n\n return 0;\n}\n\n\/\/____________________________________________________________________________\nPyROOT::TBaseAdapter PyROOT::TScopeAdapter::BaseAt( size_t nth ) const\n{\n\/\/ get the nth base of this class\n return (TBaseClass*)fClass->GetListOfBases()->At( nth );\n}\n\n\/\/____________________________________________________________________________\nsize_t PyROOT::TScopeAdapter::FunctionMemberSize() const\n{\n\/\/ get the total number of methods that this class has\n if ( fClass.GetClass() )\n return fClass->GetListOfMethods()->GetSize();\n\n return 0;\n}\n\n\/\/____________________________________________________________________________\nPyROOT::TMemberAdapter PyROOT::TScopeAdapter::FunctionMemberAt( size_t nth ) const\n{\n\/\/ get the nth method of this class\n return (TMethod*)fClass->GetListOfMethods()->At( nth );\n}\n\n\/\/____________________________________________________________________________\nsize_t PyROOT::TScopeAdapter::DataMemberSize() const\n{\n\/\/ get the total number of data members that this class has\n if ( fClass.GetClass() )\n return fClass->GetListOfDataMembers()->GetSize();\n\n return 0;\n}\n\n\/\/____________________________________________________________________________\nPyROOT::TMemberAdapter PyROOT::TScopeAdapter::DataMemberAt( size_t nth ) const\n{\n\/\/ get the nth data member of this class\n return (TDataMember*)fClass->GetListOfDataMembers()->At( nth );\n}\n\n\/\/____________________________________________________________________________\nPyROOT::TScopeAdapter::operator Bool_t() const\n{\n\/\/ check the validity of this scope (class)\n if ( fName.empty() )\n return false;\n\n Bool_t b = kFALSE;\n\n Int_t oldEIL = gErrorIgnoreLevel;\n gErrorIgnoreLevel = 3000;\n std::string scname = Name( Rflx::SCOPED );\n TClass* klass = TClass::GetClass( scname.c_str() );\n if ( klass && klass->HasInterpreterInfo() ) \/\/ works for normal case w\/ dict\n b = kTRUE;\n else { \/\/ special case for forward declared classes\n ClassInfo_t* ci = gInterpreter->ClassInfo_Factory( scname.c_str() );\n if ( ci ) {\n b = gInterpreter->ClassInfo_IsValid( ci );\n gInterpreter->ClassInfo_Delete( ci ); \/\/ we own the fresh class info\n }\n }\n gErrorIgnoreLevel = oldEIL;\n return b;\n}\n\n\/\/____________________________________________________________________________\nBool_t PyROOT::TScopeAdapter::IsComplete() const\n{\n\/\/ verify whether the dictionary of this class is fully available\n Bool_t b = kFALSE;\n\n Int_t oldEIL = gErrorIgnoreLevel;\n gErrorIgnoreLevel = 3000;\n std::string scname = Name( Rflx::SCOPED );\n TClass* klass = TClass::GetClass( scname.c_str() );\n if ( klass && klass->GetClassInfo() ) \/\/ works for normal case w\/ dict\n b = gInterpreter->ClassInfo_IsLoaded( klass->GetClassInfo() );\n else { \/\/ special case for forward declared classes\n ClassInfo_t* ci = gInterpreter->ClassInfo_Factory( scname.c_str() );\n if ( ci ) {\n b = gInterpreter->ClassInfo_IsLoaded( ci );\n gInterpreter->ClassInfo_Delete( ci ); \/\/ we own the fresh class info\n }\n }\n gErrorIgnoreLevel = oldEIL;\n return b;\n}\n\n\/\/____________________________________________________________________________\nBool_t PyROOT::TScopeAdapter::IsClass() const\n{\n\/\/ test if this scope represents a class\n if ( fClass.GetClass() ) {\n \/\/ some inverted logic: we don't have a TClass, but a builtin will be recognized, so\n \/\/ if it is NOT a builtin, it is a class or struct (but may be missing dictionary)\n return (fClass->Property() & kIsClass) || ! (fClass->Property() & kIsFundamental);\n }\n\n\/\/ no class can mean either is no class (i.e. builtin), or no dict but coming in\n\/\/ through PyCintex\/Reflex ... as a workaround, use TDataTypes that has a full\n\/\/ enumeration of builtin types\n return TDataType( Name( Rflx::FINAL | Rflx::SCOPED ).c_str() ).GetType() == kOther_t;\n}\n\n\/\/____________________________________________________________________________\nBool_t PyROOT::TScopeAdapter::IsStruct() const\n{\n\/\/ test if this scope represents a struct\n if ( fClass.GetClass() ) {\n \/\/ same logic as for IsClass() above ...\n return (fClass->Property() & kIsStruct) || ! (fClass->Property() & kIsFundamental);\n }\n\n\/\/ same logic as for IsClass() above ...\n return TDataType( Name( Rflx::FINAL | Rflx::SCOPED ).c_str() ).GetType() == kOther_t;\n}\n\n\/\/____________________________________________________________________________\nBool_t PyROOT::TScopeAdapter::IsNamespace() const\n{\n\/\/ test if this scope represents a namespace\n if ( fClass.GetClass() )\n return fClass->Property() & kIsNamespace;\n\n return kFALSE;\n}\n\n\/\/____________________________________________________________________________\nBool_t PyROOT::TScopeAdapter::IsAbstract() const\n{\n\/\/ test if this scope represents an abstract class\n if ( fClass.GetClass() )\n return fClass->Property() & kIsAbstract; \/\/ assume set only for classes\n\n return kFALSE;\n}\n<|endoftext|>"} {"text":"<commit_before>\/*\n This file is part of the blog resource.\n\n Copyright (c) 2007 Mike Arthur <mike@mikearthur.co.uk>\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 \"resourceblog.h\"\n\n#include <QDateTime>\n#include <QString>\n\n#include <KUrl>\n#include <KLocale>\n\n#include <kcal\/journal.h>\n#include <kcal\/calendarlocal.h>\n\n#include <kresources\/configwidget.h>\n\n#include <libkdepim\/progressmanager.h>\n\n#include <kblog\/blogposting.h>\n#include <kblog\/movabletype.h>\n#include <kblog\/livejournal.h>\n#include <kblog\/gdata.h>\n\nusing namespace KCal;\n\nResourceBlog::ResourceBlog()\n : ResourceCached(), mUseProgressManager( true ), mUseCacheFile( true )\n{\n init();\n}\n\nResourceBlog::ResourceBlog( const KConfigGroup &group )\n : ResourceCached( group ), mUseProgressManager( true ),\n mUseCacheFile( true )\n{\n init();\n readConfig( group );\n}\n\nResourceBlog::~ResourceBlog()\n{\n close();\n\n delete mLock;\n}\n\nvoid ResourceBlog::init()\n{\n mProgress = 0;\n\n mBlog = 0;\n\n setType( \"blog\" );\n\n mLock = new KABC::Lock( cacheFile() );\n\n enableChangeNotification();\n}\n\nvoid ResourceBlog::readConfig( const KConfigGroup &group )\n{\n kDebug( 5800 ) << \"ResourceBlog::readConfig()\";\n\n QString url = group.readEntry( \"URL\" );\n mUrl = KUrl( url );\n mUsername = group.readEntry( \"Username\" );\n mPassword = group.readEntry( \"Password\" );\n setAPI( group.readEntry( \"API\" ) );\n mBlogID = group.readEntry( \"BlogID\" );\n mBlog->setBlogId( mBlogID );\n mBlogName = group.readEntry( \"BlogName\" );\n mDownloadCount = group.readEntry( \"DownloadCount\" ).toInt();\n\n ResourceCached::readConfig( group );\n}\n\nvoid ResourceBlog::writeConfig( KConfigGroup &group )\n{\n kDebug( 5800 ) << \"ResourceBlog::writeConfig()\";\n\n group.writeEntry( \"URL\", mUrl.url() );\n group.writeEntry( \"Username\", mUsername );\n group.writeEntry( \"Password\", mPassword );\n group.writeEntry( \"API\", API() );\n group.writeEntry( \"BlogID\", mBlogID );\n group.writeEntry( \"BlogName\", mBlogName );\n group.writeEntry( \"DownloadCount\", mDownloadCount );\n\n ResourceCalendar::writeConfig( group );\n ResourceCached::writeConfig( group );\n}\n\nvoid ResourceBlog::setUrl( const KUrl &url )\n{\n mUrl = url;\n}\n\nKUrl ResourceBlog::url() const\n{\n return mUrl;\n}\n\nvoid ResourceBlog::setUsername( const QString &username )\n{\n mUsername = username;\n}\n\nQString ResourceBlog::username() const\n{\n return mUsername;\n}\n\nvoid ResourceBlog::setPassword( const QString &password )\n{\n mPassword = password;\n}\n\nQString ResourceBlog::password() const\n{\n return mPassword;\n}\n\nvoid ResourceBlog::setAPI( const QString &API )\n{\n kDebug( 5800 ) << \"ResourceBlog::setAPI(): \" << API;\n if ( API == \"Google Blogger Data\" ) {\n mBlog = new KBlog::GData( mUrl, this );\n } else if ( API == \"LiveJournal\" ) {\n mBlog = new KBlog::LiveJournal( mUrl, this );\n } else if ( API == \"Movable Type\" ) {\n mBlog = new KBlog::MovableType( mUrl, this );\n } else if ( API == \"MetaWeblog\" ) {\n mBlog = new KBlog::MetaWeblog( mUrl, this );\n } else if ( API == \"Blogger 1.0\" ) {\n mBlog = new KBlog::Blogger1( mUrl, this );\n } else {\n kError() << \"ResourceBlog::setAPI(): Unrecognised API: \" << API;\n return;\n }\n mBlog->setUsername( mUsername );\n mBlog->setPassword( mPassword );\n}\n\nQString ResourceBlog::API() const\n{\n if ( mBlog ) {\n if ( qobject_cast<KBlog::GData*>( mBlog ) ) {\n return \"Google Blogger Data\";\n }\n else if ( qobject_cast<KBlog::LiveJournal*>( mBlog ) ) {\n return \"LiveJournal\";\n }\n else if ( qobject_cast<KBlog::MovableType*>( mBlog ) ) {\n return \"Movable Type\";\n }\n else if ( qobject_cast<KBlog::MetaWeblog*>( mBlog ) ) {\n return \"MetaWeblog\";\n }\n else if ( qobject_cast<KBlog::Blogger1*>( mBlog ) ) {\n return \"Blogger 1.0\";\n }\n }\n return \"Unknown\";\n}\n\nvoid ResourceBlog::setDownloadCount( int downloadCount )\n{\n mDownloadCount = downloadCount;\n}\n\nint ResourceBlog::downloadCount() const\n{\n return mDownloadCount;\n}\n\nvoid ResourceBlog::setUseProgressManager( bool useProgressManager )\n{\n mUseProgressManager = useProgressManager;\n}\n\nbool ResourceBlog::useProgressManager() const\n{\n return mUseProgressManager;\n}\n\nvoid ResourceBlog::setUseCacheFile( bool useCacheFile )\n{\n mUseCacheFile = useCacheFile;\n}\n\nbool ResourceBlog::useCacheFile() const\n{\n return mUseCacheFile;\n}\n\nbool ResourceBlog::doLoad( bool )\n{\n kDebug( 5800 ) << \"ResourceBlog::load()\";\n\n if ( mUseCacheFile ) {\n disableChangeNotification();\n loadFromCache();\n enableChangeNotification();\n }\n\n clearChanges();\n\n if ( mBlog ) {\n if ( mLock->lock() ) {\n connect ( mBlog, SIGNAL( listedRecentPostings(\n const QList<KBlog::BlogPosting*> & ) ),\n this, SLOT( slotListedPostings(\n const QList<KBlog::BlogPosting*> & ) ) );\n connect ( mBlog, SIGNAL( error( const KBlog::Blog::ErrorType &,\n const QString & ) ),\n this, SLOT( slotError( const KBlog::Blog::ErrorType &,\n const QString & ) ) );\n\n if ( mUseProgressManager ) {\n mProgress = KPIM::ProgressManager::createProgressItem(\n KPIM::ProgressManager::getUniqueID(),\n i18n(\"Downloading blog posts\") );\n mProgress->setProgress( 0 );\n }\n mBlog->listRecentPostings( downloadCount() );\n mLock->unlock();\n return true;\n } else {\n kDebug( 5800 ) << \"ResourceBlog::load(): cache file is locked\"\n << \" - something else must be loading the file\";\n }\n }\n kError( 5800 ) << \"ResourceBlog::load(): null mBlog\";\n return false;\n}\n\nvoid ResourceBlog::slotListedPostings(\n const QList<KBlog::BlogPosting*> &postings )\n{\n \/\/ TODO: Delete postings?\n kDebug( 5800 ) << \"ResourceBlog::slotListedPostings() BEGIN\";\n QList<KBlog::BlogPosting*>::const_iterator i;\n for (i = postings.constBegin(); i != postings.constEnd(); ++i) {\n Journal* newJournal = (**i).journal( *mBlog );\n kDebug( 5800 ) << \"ResourceBlog::slotListedPostings(): 0: \" << newJournal->uid();\n Journal* existingJournal = journal( newJournal->uid() );\n if ( existingJournal ) {\n existingJournal->setSummary( newJournal->summary() );\n existingJournal->setCategories( newJournal->categories() );\n existingJournal->setDescription( newJournal->description() );\n existingJournal->setDtStart( newJournal->dtStart() );\n delete newJournal;\n }\n else {\n addJournal( newJournal );\n clearChange( newJournal );\n }\n }\n emit resourceChanged( this );\n if ( mProgress ) {\n mProgress->setComplete();\n mProgress = 0;\n }\n\n emit resourceLoaded( this );\n}\n\nvoid ResourceBlog::slotError( const KBlog::Blog::ErrorType &type,\n const QString &errorMessage )\n{\n kError( 5800 ) << \"ResourceBlog: \" << type << \": \" << errorMessage;\n Q_ASSERT(false);\n}\n\nvoid ResourceBlog::slotSavedPosting( KBlog::BlogPosting *posting )\n{\n kDebug( 5800 ) << \"ResourceBlog::slotSavedPosting: Posting saved with id\" <<\n posting->postingId();\n kDebug( 5800 ) << \"ResourceBlog::slotSavedPosting: Journal saved with id\" <<\n (*posting).journalId();\n if ( posting->status() == KBlog::BlogPosting::Created ) {\n mLastKnownPostID = posting->postingId().toInt();\n }\n clearChange( (*posting).journalId() );\n delete posting;\n\n Incidence::List changes = allChanges();\n if ( changes.begin() == changes.end() ) {\n kDebug( 5800 ) << \"ResourceBlog::slotSavedPosting: Saved to cache \";\n saveToCache();\n emit resourceSaved( this );\n }\n}\n\nvoid ResourceBlog::slotBlogInfoRetrieved( const QMap<QString,QString> &blogs )\n{\n kDebug( 5800 ) << \"ResourceBlog::slotBlogInfoRetrieved()\" << blogs;\n emit signalBlogInfoRetrieved( blogs );\n}\n\nbool ResourceBlog::doSave( bool )\n{\n kDebug( 5800 ) << \"ResourceBlog::doSave()\";\n\n if ( readOnly() || !hasChanges() ) {\n emit resourceSaved( this );\n return true;\n }\n\n if ( !mBlog ) {\n kError() << \"ResourceBlog::addJournal(): Blog not initialised.\";\n return false;\n }\n\n Incidence::List::Iterator i;\n Incidence::List added = addedIncidences();\n for ( i = added.begin(); i != added.end(); ++i ) {\n Journal* journal = dynamic_cast<Journal*>( *i );\n if ( !journal ) {\n return false;\n }\n KBlog::BlogPosting *posting = new KBlog::BlogPosting( *journal );\n connect ( mBlog, SIGNAL( createdPosting( KBlog::BlogPosting * ) ),\n this, SLOT( slotSavedPosting( KBlog::BlogPosting * ) ) );\n connect ( mBlog, SIGNAL( error( const KBlog::Blog::ErrorType &,\n const QString & ) ),\n this, SLOT( slotError( const KBlog::Blog::ErrorType &,\n const QString & ) ) );\n mBlog->createPosting( posting );\n kDebug( 5800 ) << \"ResourceBlog::doSave(): adding \" << journal->uid();\n }\n\n Incidence::List changed = changedIncidences();\n for( i = changed.begin(); i != changed.end(); ++i ) {\n Journal* journal = dynamic_cast<Journal*>( *i );\n if ( !journal ) {\n return false;\n }\n KBlog::BlogPosting *posting = new KBlog::BlogPosting( *journal );\n connect ( mBlog, SIGNAL( modifiedPosting( KBlog::BlogPosting * ) ),\n this, SLOT( slotSavedPosting( KBlog::BlogPosting * ) ) );\n connect ( mBlog, SIGNAL( error( const KBlog::Blog::ErrorType &,\n const QString & ) ),\n this, SLOT( slotError( const KBlog::Blog::ErrorType &,\n const QString & ) ) );\n mBlog->modifyPosting( posting );\n kDebug( 5800 ) << \"ResourceBlog::doSave(): changing \" << journal->uid();\n }\n\n Incidence::List deleted = deletedIncidences();\n for( i = deleted.begin(); i != deleted.end(); ++i ) {\n Journal* journal = dynamic_cast<Journal*>( *i );\n if ( !journal ) {\n return false;\n }\n KBlog::BlogPosting *posting = new KBlog::BlogPosting( *journal );\n connect ( mBlog, SIGNAL( removedPosting( KBlog::BlogPosting * ) ),\n this, SLOT( slotSavedPosting( KBlog::BlogPosting * ) ) );\n connect ( mBlog, SIGNAL( error( const KBlog::Blog::ErrorType &,\n const QString & ) ),\n this, SLOT( slotError( const KBlog::Blog::ErrorType &,\n const QString & ) ) );\n mBlog->removePosting( posting );\n kDebug( 5800 ) << \"ResourceBlog::doSave(): removing \" << journal->uid();\n \/\/FIXME: Just a hack at the moment until we have slotRemovePosting\n clearChange( journal );\n }\n\n return true;\n}\n\nKABC::Lock *ResourceBlog::lock ()\n{\n return mLock;\n}\n\nvoid ResourceBlog::dump() const\n{\n \/\/TODO\n ResourceCalendar::dump();\n kDebug( 5800 ) << \" URL: \" << mUrl.url();\n kDebug( 5800 ) << \" Username: \" << mUsername;\n kDebug( 5800 ) << \" API: \" << API();\n kDebug( 5800 ) << \" ReloadPolicy: \" << reloadPolicy();\n}\n\nvoid ResourceBlog::addInfoText( QString &txt ) const\n{\n \/\/TODO\n txt += \"<br>\";\n txt += i18n( \"URL: %1\", mUrl.prettyUrl() );\n txt += i18n( \"API: %1\", API() );\n}\n\nbool ResourceBlog::setValue( const QString &key, const QString &value )\n{\n \/\/TODO\n if ( key == \"URL\" ) {\n setUrl( KUrl( value ) );\n return true;\n } else if ( key == \"Username\" ) {\n setUsername( value );\n return true;\n } else if ( key == \"Password\" ) {\n setPassword( value );\n return true;\n } else if ( key == \"API\" ) {\n setAPI( value );\n return true;\n } else {\n return ResourceCached::setValue( key, value );\n }\n}\n\nbool ResourceBlog::listBlogs() {\n \/\/ Only children of Blogger 1.0 and Google Blogger Data support listBlogs()\n KBlog::Blogger1* blogger = qobject_cast<KBlog::Blogger1*>( mBlog );\n if ( blogger ) {\n connect ( blogger, SIGNAL( listedBlogs( const QMap<QString,QString> & ) ),\n this, SLOT( slotBlogInfoRetrieved(\n const QMap<QString,QString> & ) ) );\n blogger->listBlogs();\n return true;\n }\n KBlog::GData* gdata = qobject_cast<KBlog::GData*>( mBlog );\n if ( gdata ) {\n connect ( gdata, SIGNAL( listedBlogs( const QMap<QString,QString> & ) ),\n this, SLOT( slotBlogInfoRetrieved(\n const QMap<QString,QString> & ) ) );\n gdata->listBlogs();\n return true;\n }\n kError( 5800 ) << \"ResourceBlog::listBlogs(): \"\n << \"API does not support multiple blogs.\";\n return false;\n}\n\nvoid ResourceBlog::setBlog( const QString &id, const QString &name ) {\n mBlogID = id;\n mBlogName = name;\n kDebug( 5800 ) << \"ResourceBlog::setBlog( id=\" << mBlogID <<\n \", name=\" << mBlogName << \" )\";\n}\n\nQPair<QString, QString> ResourceBlog::blog() const {\n return qMakePair( mBlogID, mBlogName );\n}\n\n\n#include \"resourceblog.moc\"\n<commit_msg>Fix memory leak and update info text and dump()<commit_after>\/*\n This file is part of the blog resource.\n\n Copyright (c) 2007 Mike Arthur <mike@mikearthur.co.uk>\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 \"resourceblog.h\"\n\n#include <QDateTime>\n#include <QString>\n\n#include <KUrl>\n#include <KLocale>\n\n#include <kcal\/journal.h>\n#include <kcal\/calendarlocal.h>\n\n#include <kresources\/configwidget.h>\n\n#include <libkdepim\/progressmanager.h>\n\n#include <kblog\/blogposting.h>\n#include <kblog\/movabletype.h>\n#include <kblog\/livejournal.h>\n#include <kblog\/gdata.h>\n\nusing namespace KCal;\n\nResourceBlog::ResourceBlog()\n : ResourceCached(), mUseProgressManager( true ), mUseCacheFile( true )\n{\n init();\n}\n\nResourceBlog::ResourceBlog( const KConfigGroup &group )\n : ResourceCached( group ), mUseProgressManager( true ),\n mUseCacheFile( true )\n{\n init();\n readConfig( group );\n}\n\nResourceBlog::~ResourceBlog()\n{\n close();\n\n delete mLock;\n}\n\nvoid ResourceBlog::init()\n{\n mProgress = 0;\n\n mBlog = 0;\n\n setType( \"blog\" );\n\n mLock = new KABC::Lock( cacheFile() );\n\n enableChangeNotification();\n}\n\nvoid ResourceBlog::readConfig( const KConfigGroup &group )\n{\n kDebug( 5800 ) << \"ResourceBlog::readConfig()\";\n\n QString url = group.readEntry( \"URL\" );\n mUrl = KUrl( url );\n mUsername = group.readEntry( \"Username\" );\n mPassword = group.readEntry( \"Password\" );\n setAPI( group.readEntry( \"API\" ) );\n mBlogID = group.readEntry( \"BlogID\" );\n mBlog->setBlogId( mBlogID );\n mBlogName = group.readEntry( \"BlogName\" );\n mDownloadCount = group.readEntry( \"DownloadCount\" ).toInt();\n\n ResourceCached::readConfig( group );\n}\n\nvoid ResourceBlog::writeConfig( KConfigGroup &group )\n{\n kDebug( 5800 ) << \"ResourceBlog::writeConfig()\";\n\n group.writeEntry( \"URL\", mUrl.url() );\n group.writeEntry( \"Username\", mUsername );\n group.writeEntry( \"Password\", mPassword );\n group.writeEntry( \"API\", API() );\n group.writeEntry( \"BlogID\", mBlogID );\n group.writeEntry( \"BlogName\", mBlogName );\n group.writeEntry( \"DownloadCount\", mDownloadCount );\n\n ResourceCalendar::writeConfig( group );\n ResourceCached::writeConfig( group );\n}\n\nvoid ResourceBlog::setUrl( const KUrl &url )\n{\n mUrl = url;\n}\n\nKUrl ResourceBlog::url() const\n{\n return mUrl;\n}\n\nvoid ResourceBlog::setUsername( const QString &username )\n{\n mUsername = username;\n}\n\nQString ResourceBlog::username() const\n{\n return mUsername;\n}\n\nvoid ResourceBlog::setPassword( const QString &password )\n{\n mPassword = password;\n}\n\nQString ResourceBlog::password() const\n{\n return mPassword;\n}\n\nvoid ResourceBlog::setAPI( const QString &API )\n{\n kDebug( 5800 ) << \"ResourceBlog::setAPI(): \" << API;\n if ( API == \"Google Blogger Data\" ) {\n mBlog = new KBlog::GData( mUrl, this );\n } else if ( API == \"LiveJournal\" ) {\n mBlog = new KBlog::LiveJournal( mUrl, this );\n } else if ( API == \"Movable Type\" ) {\n mBlog = new KBlog::MovableType( mUrl, this );\n } else if ( API == \"MetaWeblog\" ) {\n mBlog = new KBlog::MetaWeblog( mUrl, this );\n } else if ( API == \"Blogger 1.0\" ) {\n mBlog = new KBlog::Blogger1( mUrl, this );\n } else {\n kError() << \"ResourceBlog::setAPI(): Unrecognised API: \" << API;\n return;\n }\n mBlog->setUsername( mUsername );\n mBlog->setPassword( mPassword );\n}\n\nQString ResourceBlog::API() const\n{\n if ( mBlog ) {\n if ( qobject_cast<KBlog::GData*>( mBlog ) ) {\n return \"Google Blogger Data\";\n }\n else if ( qobject_cast<KBlog::LiveJournal*>( mBlog ) ) {\n return \"LiveJournal\";\n }\n else if ( qobject_cast<KBlog::MovableType*>( mBlog ) ) {\n return \"Movable Type\";\n }\n else if ( qobject_cast<KBlog::MetaWeblog*>( mBlog ) ) {\n return \"MetaWeblog\";\n }\n else if ( qobject_cast<KBlog::Blogger1*>( mBlog ) ) {\n return \"Blogger 1.0\";\n }\n }\n return \"Unknown\";\n}\n\nvoid ResourceBlog::setDownloadCount( int downloadCount )\n{\n mDownloadCount = downloadCount;\n}\n\nint ResourceBlog::downloadCount() const\n{\n return mDownloadCount;\n}\n\nvoid ResourceBlog::setUseProgressManager( bool useProgressManager )\n{\n mUseProgressManager = useProgressManager;\n}\n\nbool ResourceBlog::useProgressManager() const\n{\n return mUseProgressManager;\n}\n\nvoid ResourceBlog::setUseCacheFile( bool useCacheFile )\n{\n mUseCacheFile = useCacheFile;\n}\n\nbool ResourceBlog::useCacheFile() const\n{\n return mUseCacheFile;\n}\n\nbool ResourceBlog::doLoad( bool )\n{\n kDebug( 5800 ) << \"ResourceBlog::load()\";\n\n if ( mUseCacheFile ) {\n disableChangeNotification();\n loadFromCache();\n enableChangeNotification();\n }\n\n clearChanges();\n\n if ( mBlog ) {\n if ( mLock->lock() ) {\n connect ( mBlog, SIGNAL( listedRecentPostings(\n const QList<KBlog::BlogPosting*> & ) ),\n this, SLOT( slotListedPostings(\n const QList<KBlog::BlogPosting*> & ) ) );\n connect ( mBlog, SIGNAL( error( const KBlog::Blog::ErrorType &,\n const QString & ) ),\n this, SLOT( slotError( const KBlog::Blog::ErrorType &,\n const QString & ) ) );\n\n if ( mUseProgressManager ) {\n mProgress = KPIM::ProgressManager::createProgressItem(\n KPIM::ProgressManager::getUniqueID(),\n i18n(\"Downloading blog posts\") );\n mProgress->setProgress( 0 );\n }\n mBlog->listRecentPostings( downloadCount() );\n mLock->unlock();\n return true;\n } else {\n kDebug( 5800 ) << \"ResourceBlog::load(): cache file is locked\"\n << \" - something else must be loading the file\";\n }\n }\n kError( 5800 ) << \"ResourceBlog::load(): null mBlog\";\n return false;\n}\n\nvoid ResourceBlog::slotListedPostings(\n const QList<KBlog::BlogPosting*> &postings )\n{\n kDebug( 5800 ) << \"ResourceBlog::slotListedPostings() BEGIN\";\n QList<KBlog::BlogPosting*>::const_iterator i;\n for (i = postings.constBegin(); i != postings.constEnd(); ++i) {\n Journal* newJournal = (**i).journal( *mBlog );\n delete *i;\n kDebug( 5800 ) << \"ResourceBlog::slotListedPostings(): 0: \" << newJournal->uid();\n Journal* existingJournal = journal( newJournal->uid() );\n if ( existingJournal ) {\n existingJournal->setSummary( newJournal->summary() );\n existingJournal->setCategories( newJournal->categories() );\n existingJournal->setDescription( newJournal->description() );\n existingJournal->setDtStart( newJournal->dtStart() );\n delete newJournal;\n }\n else {\n addJournal( newJournal );\n clearChange( newJournal );\n }\n }\n emit resourceChanged( this );\n if ( mProgress ) {\n mProgress->setComplete();\n mProgress = 0;\n }\n\n emit resourceLoaded( this );\n}\n\nvoid ResourceBlog::slotError( const KBlog::Blog::ErrorType &type,\n const QString &errorMessage )\n{\n kError( 5800 ) << \"ResourceBlog: \" << type << \": \" << errorMessage;\n Q_ASSERT(false);\n}\n\nvoid ResourceBlog::slotSavedPosting( KBlog::BlogPosting *posting )\n{\n kDebug( 5800 ) << \"ResourceBlog::slotSavedPosting: Posting saved with id\" <<\n posting->postingId();\n kDebug( 5800 ) << \"ResourceBlog::slotSavedPosting: Journal saved with id\" <<\n (*posting).journalId();\n if ( posting->status() == KBlog::BlogPosting::Created ) {\n mLastKnownPostID = posting->postingId().toInt();\n }\n clearChange( (*posting).journalId() );\n delete posting;\n\n Incidence::List changes = allChanges();\n if ( changes.begin() == changes.end() ) {\n kDebug( 5800 ) << \"ResourceBlog::slotSavedPosting: Saved to cache \";\n saveToCache();\n emit resourceSaved( this );\n }\n}\n\nvoid ResourceBlog::slotBlogInfoRetrieved( const QMap<QString,QString> &blogs )\n{\n kDebug( 5800 ) << \"ResourceBlog::slotBlogInfoRetrieved()\" << blogs;\n emit signalBlogInfoRetrieved( blogs );\n}\n\nbool ResourceBlog::doSave( bool )\n{\n kDebug( 5800 ) << \"ResourceBlog::doSave()\";\n\n if ( readOnly() || !hasChanges() ) {\n emit resourceSaved( this );\n return true;\n }\n\n if ( !mBlog ) {\n kError() << \"ResourceBlog::addJournal(): Blog not initialised.\";\n return false;\n }\n\n Incidence::List::Iterator i;\n Incidence::List added = addedIncidences();\n for ( i = added.begin(); i != added.end(); ++i ) {\n Journal* journal = dynamic_cast<Journal*>( *i );\n if ( !journal ) {\n return false;\n }\n KBlog::BlogPosting *posting = new KBlog::BlogPosting( *journal );\n connect ( mBlog, SIGNAL( createdPosting( KBlog::BlogPosting * ) ),\n this, SLOT( slotSavedPosting( KBlog::BlogPosting * ) ) );\n connect ( mBlog, SIGNAL( error( const KBlog::Blog::ErrorType &,\n const QString & ) ),\n this, SLOT( slotError( const KBlog::Blog::ErrorType &,\n const QString & ) ) );\n mBlog->createPosting( posting );\n kDebug( 5800 ) << \"ResourceBlog::doSave(): adding \" << journal->uid();\n }\n\n Incidence::List changed = changedIncidences();\n for( i = changed.begin(); i != changed.end(); ++i ) {\n Journal* journal = dynamic_cast<Journal*>( *i );\n if ( !journal ) {\n return false;\n }\n KBlog::BlogPosting *posting = new KBlog::BlogPosting( *journal );\n connect ( mBlog, SIGNAL( modifiedPosting( KBlog::BlogPosting * ) ),\n this, SLOT( slotSavedPosting( KBlog::BlogPosting * ) ) );\n connect ( mBlog, SIGNAL( error( const KBlog::Blog::ErrorType &,\n const QString & ) ),\n this, SLOT( slotError( const KBlog::Blog::ErrorType &,\n const QString & ) ) );\n mBlog->modifyPosting( posting );\n kDebug( 5800 ) << \"ResourceBlog::doSave(): changing \" << journal->uid();\n }\n\n Incidence::List deleted = deletedIncidences();\n for( i = deleted.begin(); i != deleted.end(); ++i ) {\n Journal* journal = dynamic_cast<Journal*>( *i );\n if ( !journal ) {\n return false;\n }\n KBlog::BlogPosting *posting = new KBlog::BlogPosting( *journal );\n connect ( mBlog, SIGNAL( removedPosting( KBlog::BlogPosting * ) ),\n this, SLOT( slotSavedPosting( KBlog::BlogPosting * ) ) );\n connect ( mBlog, SIGNAL( error( const KBlog::Blog::ErrorType &,\n const QString & ) ),\n this, SLOT( slotError( const KBlog::Blog::ErrorType &,\n const QString & ) ) );\n mBlog->removePosting( posting );\n kDebug( 5800 ) << \"ResourceBlog::doSave(): removing \" << journal->uid();\n \/\/FIXME: Just a hack at the moment until we have slotRemovePosting\n clearChange( journal );\n }\n\n return true;\n}\n\nKABC::Lock *ResourceBlog::lock ()\n{\n return mLock;\n}\n\nvoid ResourceBlog::dump() const\n{\n ResourceCalendar::dump();\n kDebug( 5800 ) << \" URL: \" << mUrl.url();\n kDebug( 5800 ) << \" Username: \" << mUsername;\n kDebug( 5800 ) << \" API: \" << API();\n kDebug( 5800 ) << \" ReloadPolicy: \" << reloadPolicy();\n kDebug( 5800 ) << \" BlogID: \" << mBlogID;\n kDebug( 5800 ) << \" BlogName: \" << mBlogName;\n kDebug( 5800 ) << \" DownloadCount: \" << mDownloadCount;\n}\n\nvoid ResourceBlog::addInfoText( QString &txt ) const\n{\n txt += \"<br>\";\n txt += i18n( \"URL: %1\", mUrl.prettyUrl() );\n txt += i18n( \"Username: %1\", mUsername );\n txt += i18n( \"API: %1\", API() );\n txt += i18n( \"BlogName: %1\", mBlogName );\n txt += i18n( \"DownloadCount: %1\", mDownloadCount );\n}\n\nbool ResourceBlog::setValue( const QString &key, const QString &value )\n{\n if ( key == \"URL\" ) {\n setUrl( KUrl( value ) );\n return true;\n } else if ( key == \"Username\" ) {\n setUsername( value );\n return true;\n } else if ( key == \"Password\" ) {\n setPassword( value );\n return true;\n } else if ( key == \"API\" ) {\n setAPI( value );\n return true;\n } else {\n return ResourceCached::setValue( key, value );\n }\n}\n\nbool ResourceBlog::listBlogs() {\n \/\/ Only children of Blogger 1.0 and Google Blogger Data support listBlogs()\n KBlog::Blogger1* blogger = qobject_cast<KBlog::Blogger1*>( mBlog );\n if ( blogger ) {\n connect ( blogger, SIGNAL( listedBlogs( const QMap<QString,QString> & ) ),\n this, SLOT( slotBlogInfoRetrieved(\n const QMap<QString,QString> & ) ) );\n blogger->listBlogs();\n return true;\n }\n KBlog::GData* gdata = qobject_cast<KBlog::GData*>( mBlog );\n if ( gdata ) {\n connect ( gdata, SIGNAL( listedBlogs( const QMap<QString,QString> & ) ),\n this, SLOT( slotBlogInfoRetrieved(\n const QMap<QString,QString> & ) ) );\n gdata->listBlogs();\n return true;\n }\n kError( 5800 ) << \"ResourceBlog::listBlogs(): \"\n << \"API does not support multiple blogs.\";\n return false;\n}\n\nvoid ResourceBlog::setBlog( const QString &id, const QString &name ) {\n mBlogID = id;\n mBlogName = name;\n kDebug( 5800 ) << \"ResourceBlog::setBlog( id=\" << mBlogID <<\n \", name=\" << mBlogName << \" )\";\n}\n\nQPair<QString, QString> ResourceBlog::blog() const {\n return qMakePair( mBlogID, mBlogName );\n}\n\n\n#include \"resourceblog.moc\"\n<|endoftext|>"} {"text":"<commit_before>\/*************************************************************************\n *\n * OpenOffice.org - a multi-platform office productivity suite\n *\n * $RCSfile: appendunixshellword.hxx,v $\n *\n * $Revision: 1.2 $\n *\n * last change: $Author: vg $ $Date: 2008-03-18 12:26: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 2008 by Sun Microsystems, Inc.\n * 901 San Antonio Road, Palo Alto, CA 94303, USA\n *\n * This library is free software; you can redistribute it and\/or\n * modify it under the terms of the GNU Lesser General Public\n * License version 2.1, as published by the Free Software Foundation.\n *\n * This library is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU\n * Lesser General Public License for more details.\n *\n * You should have received a copy of the GNU Lesser General Public\n * License along with this library; if 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_TOOLS_APPENDUNIXSHELLWORD_HXX\n#define INCLUDED_TOOLS_APPENDUNIXSHELLWORD_HXX\n\n#include \"sal\/config.h\"\n\n#if defined UNX\n\n#include \"tools\/toolsdllapi.h\"\n\nnamespace rtl {\n class OString;\n class OStringBuffer;\n}\n\nnamespace tools {\n\n\/\/ append arbitrary bytes as a properly quoted Unix-style shell word\n\/\/\n\/\/ @param accumulator\n\/\/ the string buffer to which the word is appended (without any surrounding\n\/\/ whitespace); must not be null\n\/\/\n\/\/ @param text\n\/\/ the text to add\nTOOLS_DLLPUBLIC void appendUnixShellWord(\n rtl::OStringBuffer * accumulator, rtl::OString const & text);\n\n}\n\n#endif\n\n#endif\n<commit_msg>INTEGRATION: CWS changefileheader (1.2.6); FILE MERGED 2008\/03\/28 15:41:07 rt 1.2.6.1: #i87441# Change license header to LPGL v3.<commit_after>\/*************************************************************************\n *\n * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.\n *\n * Copyright 2008 by Sun Microsystems, Inc.\n *\n * OpenOffice.org - a multi-platform office productivity suite\n *\n * $RCSfile: appendunixshellword.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_TOOLS_APPENDUNIXSHELLWORD_HXX\n#define INCLUDED_TOOLS_APPENDUNIXSHELLWORD_HXX\n\n#include \"sal\/config.h\"\n\n#if defined UNX\n\n#include \"tools\/toolsdllapi.h\"\n\nnamespace rtl {\n class OString;\n class OStringBuffer;\n}\n\nnamespace tools {\n\n\/\/ append arbitrary bytes as a properly quoted Unix-style shell word\n\/\/\n\/\/ @param accumulator\n\/\/ the string buffer to which the word is appended (without any surrounding\n\/\/ whitespace); must not be null\n\/\/\n\/\/ @param text\n\/\/ the text to add\nTOOLS_DLLPUBLIC void appendUnixShellWord(\n rtl::OStringBuffer * accumulator, rtl::OString const & text);\n\n}\n\n#endif\n\n#endif\n<|endoftext|>"} {"text":"<commit_before>\/*\n *\n * Copyright 2017, 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#ifdef GRPC_UV\n\n#include \"server.h\"\n\n#include <node.h>\n#include <nan.h>\n#include \"grpc\/grpc.h\"\n#include \"grpc\/support\/time.h\"\n\n#include \"call.h\"\n#include \"completion_queue.h\"\n\nnamespace grpc {\nnamespace node {\n\nusing Nan::Callback;\n\nusing v8::External;\nusing v8::Function;\nusing v8::FunctionTemplate;\nusing v8::Local;\nusing v8::MaybeLocal;\nusing v8::Object;\nusing v8::Value;\n\nstatic Callback *shutdown_callback = NULL;\n\nclass ServerShutdownOp : public Op {\n public:\n ServerShutdownOp(grpc_server *server): server(server) {\n }\n\n ~ServerShutdownOp() {\n }\n\n Local<Value> GetNodeValue() const {\n return Nan::New<External>(reinterpret_cast<void *>(server));\n }\n\n bool ParseOp(Local<Value> value, grpc_op *out) {\n return true;\n }\n bool IsFinalOp() {\n return false;\n }\n\n grpc_server *server;\n\n protected:\n std::string GetTypeString() const { return \"shutdown\"; }\n};\n\nServer::Server(grpc_server *server) : wrapped_server(server) {\n}\n\nServer::~Server() {\n this->ShutdownServer();\n}\n\nNAN_METHOD(ServerShutdownCallback) {\n if (!info[0]->IsNull()) {\n return Nan::ThrowError(\"forceShutdown failed somehow\");\n }\n MaybeLocal<Object> maybe_result = Nan::To<Object>(info[1]);\n Local<Object> result = maybe_result.ToLocalChecked();\n Local<Value> server_val = Nan::Get(\n result, Nan::New(\"shutdown\").ToLocalChecked()).ToLocalChecked();\n Local<External> server_extern = server_val.As<External>();\n grpc_server *server = reinterpret_cast<grpc_server *>(server_extern->Value());\n grpc_server_destroy(server);\n}\n\nvoid Server::ShutdownServer() {\n if (this->wrapped_server != NULL) {\n if (shutdown_callback == NULL) {\n Local<FunctionTemplate>callback_tpl =\n Nan::New<FunctionTemplate>(ServerShutdownCallback);\n shutdown_callback = new Callback(\n Nan::GetFunction(callback_tpl).ToLocalChecked());\n }\n\n ServerShutdownOp *op = new ServerShutdownOp(this->wrapped_server);\n unique_ptr<OpVec> ops(new OpVec());\n ops->push_back(unique_ptr<Op>(op));\n\n grpc_server_shutdown_and_notify(\n this->wrapped_server, GetCompletionQueue(),\n new struct tag(new Callback(**shutdown_callback), ops.release(), NULL));\n grpc_server_cancel_all_calls(this->wrapped_server);\n CompletionQueueNext();\n this->wrapped_server = NULL;\n }\n}\n\n} \/\/ namespace grpc\n} \/\/ namespace node\n\n#endif \/* GRPC_UV *\/\n<commit_msg>Drop support for io.js, fix minor issue with node extension<commit_after>\/*\n *\n * Copyright 2017, 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#ifdef GRPC_UV\n\n#include \"server.h\"\n\n#include <node.h>\n#include <nan.h>\n#include \"grpc\/grpc.h\"\n#include \"grpc\/support\/time.h\"\n\n#include \"call.h\"\n#include \"completion_queue.h\"\n\nnamespace grpc {\nnamespace node {\n\nusing Nan::Callback;\nusing Nan::MaybeLocal;\n\nusing v8::External;\nusing v8::Function;\nusing v8::FunctionTemplate;\nusing v8::Local;\nusing v8::Object;\nusing v8::Value;\n\nstatic Callback *shutdown_callback = NULL;\n\nclass ServerShutdownOp : public Op {\n public:\n ServerShutdownOp(grpc_server *server): server(server) {\n }\n\n ~ServerShutdownOp() {\n }\n\n Local<Value> GetNodeValue() const {\n return Nan::New<External>(reinterpret_cast<void *>(server));\n }\n\n bool ParseOp(Local<Value> value, grpc_op *out) {\n return true;\n }\n bool IsFinalOp() {\n return false;\n }\n\n grpc_server *server;\n\n protected:\n std::string GetTypeString() const { return \"shutdown\"; }\n};\n\nServer::Server(grpc_server *server) : wrapped_server(server) {\n}\n\nServer::~Server() {\n this->ShutdownServer();\n}\n\nNAN_METHOD(ServerShutdownCallback) {\n if (!info[0]->IsNull()) {\n return Nan::ThrowError(\"forceShutdown failed somehow\");\n }\n MaybeLocal<Object> maybe_result = Nan::To<Object>(info[1]);\n Local<Object> result = maybe_result.ToLocalChecked();\n Local<Value> server_val = Nan::Get(\n result, Nan::New(\"shutdown\").ToLocalChecked()).ToLocalChecked();\n Local<External> server_extern = server_val.As<External>();\n grpc_server *server = reinterpret_cast<grpc_server *>(server_extern->Value());\n grpc_server_destroy(server);\n}\n\nvoid Server::ShutdownServer() {\n if (this->wrapped_server != NULL) {\n if (shutdown_callback == NULL) {\n Local<FunctionTemplate>callback_tpl =\n Nan::New<FunctionTemplate>(ServerShutdownCallback);\n shutdown_callback = new Callback(\n Nan::GetFunction(callback_tpl).ToLocalChecked());\n }\n\n ServerShutdownOp *op = new ServerShutdownOp(this->wrapped_server);\n unique_ptr<OpVec> ops(new OpVec());\n ops->push_back(unique_ptr<Op>(op));\n\n grpc_server_shutdown_and_notify(\n this->wrapped_server, GetCompletionQueue(),\n new struct tag(new Callback(**shutdown_callback), ops.release(), NULL));\n grpc_server_cancel_all_calls(this->wrapped_server);\n CompletionQueueNext();\n this->wrapped_server = NULL;\n }\n}\n\n} \/\/ namespace grpc\n} \/\/ namespace node\n\n#endif \/* GRPC_UV *\/\n<|endoftext|>"} {"text":"<commit_before><commit_msg>fixed race condition in bandwidth manager<commit_after><|endoftext|>"} {"text":"<commit_before>\/*\n Copyright (c) 2009 Stephen Kelly <steveire@gmail.com>\n*\/\n\n#include \"parser.h\"\n\n#include <QPluginLoader>\n#include <QFile>\n\n#include \"interfaces\/taglibraryinterface.h\"\n#include \"grantlee.h\"\n#include \"template.h\"\n#include \"templateloader.h\"\n#include \"filter.h\"\n\n\nstatic const char * __scriptableLibName = \"grantlee_scriptabletags_library\";\n\nusing namespace Grantlee;\n\nnamespace Grantlee\n{\n\nclass ParserPrivate\n{\npublic:\n ParserPrivate(Parser *parser, const QList<Token> &tokenList)\n : q_ptr(parser),\n m_error(NoError),\n m_tokenList(tokenList),\n m_scriptableTagLibrary(0)\n {\n\n }\n\n NodeList extendNodeList(NodeList list, Node *node);\n\n QList<Token> m_tokenList;\n QHash<QString, AbstractNodeFactory*> m_nodeFactories;\n TagLibraryInterface *m_scriptableTagLibrary;\n\n QHash<QString, Filter*> m_filters;\n QHash<QString, TagLibraryInterface*> m_tags;\n NodeList m_nodeList;\n QStringList m_pluginDirs;\n\n Error m_error;\n QString m_errorString;\n\n QStringList m_libraryPaths;\n\n Q_DECLARE_PUBLIC(Parser);\n Parser *q_ptr;\n};\n\n}\n\nParser::Parser(const QList<Token> &tokenList, QObject *parent)\n : QObject(parent), d_ptr(new ParserPrivate(this, tokenList))\n{\n Q_D(Parser);\n\n TemplateLoader *tl = TemplateLoader::instance();\n\n d->m_pluginDirs = tl->pluginDirs();\n\n foreach(const QString libName, tl->defaultLibraries())\n {\n loadLib(libName);\n }\n\n}\n\nParser::~Parser()\n{\n qDeleteAll(d_ptr->m_nodeFactories);\n delete d_ptr->m_scriptableTagLibrary;\n delete d_ptr;\n}\n\nvoid Parser::loadLib(const QString &name)\n{\n Q_D(Parser);\n\n int pluginIndex = 0;\n QString libFileName;\n\n if (d->m_scriptableTagLibrary)\n {\n while (d->m_pluginDirs.size() > pluginIndex)\n {\n libFileName = d->m_pluginDirs.at(pluginIndex++) + name + \".qs\";\n\n QFile file(libFileName);\n if (!file.exists())\n continue;\n\n QHashIterator<QString, AbstractNodeFactory*> i(d->m_scriptableTagLibrary->nodeFactories(libFileName));\n while (i.hasNext())\n {\n i.next();\n d->m_nodeFactories[i.key()] = i.value();\n }\n\n QHashIterator<QString, Filter*> filterIter(d->m_scriptableTagLibrary->filters(libFileName));\n while (filterIter.hasNext())\n {\n filterIter.next();\n Filter *f = filterIter.value();\n f->setParent(this->parent());\n d->m_filters[filterIter.key()] = f;\n }\n\n return;\n }\n }\n\n pluginIndex = 0;\n\n QObject *plugin;\n while (d->m_pluginDirs.size() > pluginIndex)\n {\n libFileName = d->m_pluginDirs.at(pluginIndex++) + \"lib\" + name + \".so\";\n QPluginLoader loader( libFileName );\n\n plugin = loader.instance();\n if (plugin)\n break;\n }\n if (!plugin)\n return;\n\n TagLibraryInterface *tagLibrary = qobject_cast<TagLibraryInterface*>(plugin);\n if (!tagLibrary)\n return;\n\n if (name == __scriptableLibName)\n {\n d->m_scriptableTagLibrary = tagLibrary;\n return;\n }\n\n QHashIterator<QString, AbstractNodeFactory*> i(tagLibrary->nodeFactories());\n while (i.hasNext())\n {\n i.next();\n d->m_nodeFactories[i.key()] = i.value();\n }\n\n QHashIterator<QString, Filter*> filterIter(tagLibrary->filters());\n while (filterIter.hasNext())\n {\n filterIter.next();\n Filter *f = filterIter.value();\n f->setParent(this->parent());\n d->m_filters[filterIter.key()] = f;\n }\n delete tagLibrary;\n}\n\nNodeList ParserPrivate::extendNodeList(NodeList list, Node *node)\n{\n list.append(node);\n return list;\n}\n\nvoid Parser::skipPast(const QString &tag)\n{\n while (hasNextToken())\n {\n Token token = nextToken();\n if (token.tokenType == BlockToken && token.content.trimmed() == tag )\n return;\n }\n \/\/ Error. Unclosed tag\n}\n\nFilter *Parser::getFilter(const QString &name) const\n{\n Q_D(const Parser);\n return d->m_filters.value(name);\n}\n\nNodeList Parser::parse(QObject *parent)\n{\n return parse(QStringList(), parent);\n}\n\nNodeList Parser::parse(const QString &stopAt, QObject *parent)\n{\n parse(QStringList() << stopAt, parent);\n}\n\nNodeList Parser::parse(const QStringList &stopAt, QObject *parent)\n{\n Q_D(Parser);\n NodeList nodeList;\n\n while (hasNextToken())\n {\n Token token = nextToken();\n if (token.tokenType == TextToken)\n {\n nodeList = d->extendNodeList(nodeList, new TextNode(token.content, parent));\n } else if (token.tokenType == VariableToken)\n {\n if (token.content.isEmpty())\n {\n \/\/ Error. Empty variable\n QString message;\n if (hasNextToken())\n message = QString(\"Empty variable before \\\"%1\\\"\").arg(nextToken().content);\n else\n message = QString(\"Empty variable at end of input.\");\n setError(EmptyVariableError, message);\n return NodeList();\n }\n FilterExpression filterExpression(token.content, this);\n if (filterExpression.error() != NoError)\n {\n setError(filterExpression.error(), filterExpression.errorString());\n return NodeList();\n }\n nodeList = d->extendNodeList(nodeList, new VariableNode(filterExpression, parent));\n } else if (token.tokenType == BlockToken)\n {\n if (stopAt.contains(token.content))\n {\n \/\/ put the token back.\n prependToken(token);\n return nodeList;\n }\n\n QStringList tagContents = token.content.split(\" \");\n if (tagContents.size() == 0)\n {\n QString message;\n if (hasNextToken())\n message = QString(\"Empty block tag before \\\"%1\\\"\").arg(nextToken().content);\n else\n message = QString(\"Empty block tag at end of input.\");\n setError(EmptyBlockTagError, message);\n return NodeList();\n }\n QString command = tagContents.at(0);\n AbstractNodeFactory *nodeFactory = d->m_nodeFactories[command];\n\n \/\/ unknown tag.\n if (!nodeFactory)\n {\n setError(InvalidBlockTagError, QString(\"Unknown tag \\\"%1\\\"\").arg(command));\n continue;\n }\n\n \/\/ TODO: Make getNode take a Token instead?\n Node *n = nodeFactory->getNode(token.content, this, parent);\n\n if (!n)\n {\n setError(TagSyntaxError, QString(\"Failed to get node from %1\").arg(command));\n return NodeList();\n }\n\n if (NoError != nodeFactory->error())\n {\n setError(nodeFactory->error(), nodeFactory->errorString());\n return NodeList();\n }\n\n nodeList = d->extendNodeList(nodeList, n);\n }\n\n }\n\n if (stopAt.size() > 0)\n setError(UnclosedBlockTagError, QString(\"Unclosed tag in template. Expected one of: (%1)\").arg(stopAt.join(\" \")));\n\n return nodeList;\n\n}\n\nvoid Parser::setError(Error errorNumber, const QString& message)\n{\n Q_D(Parser);\n d->m_error = errorNumber;\n d->m_errorString = message;\n}\n\nError Grantlee::Parser::error() const\n{\n Q_D(const Parser);\n return d->m_error;\n}\n\nQString Parser::errorString() const\n{\n Q_D(const Parser);\n return d->m_errorString;\n}\n\nbool Parser::hasNextToken() const\n{\n Q_D(const Parser);\n return d->m_tokenList.size() > 0;\n}\n\nToken Parser::nextToken()\n{\n Q_D(Parser);\n return d->m_tokenList.takeAt(0);\n}\n\nvoid Parser::deleteNextToken()\n{\n Q_D(Parser);\n if (!d->m_tokenList.isEmpty())\n d->m_tokenList.removeAt(0);\n}\n\nvoid Parser::prependToken(const Token &token)\n{\n Q_D(Parser);\n d->m_tokenList.prepend(token);\n}\n\n<commit_msg>Don't delete the scriptabletags library in the parser. It needs to have the lifetime of the template being parsed.<commit_after>\/*\n Copyright (c) 2009 Stephen Kelly <steveire@gmail.com>\n*\/\n\n#include \"parser.h\"\n\n#include <QPluginLoader>\n#include <QFile>\n\n#include \"interfaces\/taglibraryinterface.h\"\n#include \"grantlee.h\"\n#include \"template.h\"\n#include \"templateloader.h\"\n#include \"filter.h\"\n\n\nstatic const char * __scriptableLibName = \"grantlee_scriptabletags_library\";\n\nusing namespace Grantlee;\n\nnamespace Grantlee\n{\n\nclass ParserPrivate\n{\npublic:\n ParserPrivate(Parser *parser, const QList<Token> &tokenList)\n : q_ptr(parser),\n m_error(NoError),\n m_tokenList(tokenList),\n m_scriptableTagLibrary(0)\n {\n\n }\n\n NodeList extendNodeList(NodeList list, Node *node);\n\n QList<Token> m_tokenList;\n QHash<QString, AbstractNodeFactory*> m_nodeFactories;\n TagLibraryInterface *m_scriptableTagLibrary;\n\n QHash<QString, Filter*> m_filters;\n QHash<QString, TagLibraryInterface*> m_tags;\n NodeList m_nodeList;\n QStringList m_pluginDirs;\n\n Error m_error;\n QString m_errorString;\n\n QStringList m_libraryPaths;\n\n Q_DECLARE_PUBLIC(Parser);\n Parser *q_ptr;\n};\n\n}\n\nParser::Parser(const QList<Token> &tokenList, QObject *parent)\n : QObject(parent), d_ptr(new ParserPrivate(this, tokenList))\n{\n Q_D(Parser);\n\n TemplateLoader *tl = TemplateLoader::instance();\n\n d->m_pluginDirs = tl->pluginDirs();\n\n foreach(const QString libName, tl->defaultLibraries())\n {\n loadLib(libName);\n }\n\n}\n\nParser::~Parser()\n{\n qDeleteAll(d_ptr->m_nodeFactories);\n delete d_ptr;\n}\n\nvoid Parser::loadLib(const QString &name)\n{\n Q_D(Parser);\n\n int pluginIndex = 0;\n QString libFileName;\n\n if (d->m_scriptableTagLibrary)\n {\n while (d->m_pluginDirs.size() > pluginIndex)\n {\n libFileName = d->m_pluginDirs.at(pluginIndex++) + name + \".qs\";\n\n QFile file(libFileName);\n if (!file.exists())\n continue;\n\n QHashIterator<QString, AbstractNodeFactory*> i(d->m_scriptableTagLibrary->nodeFactories(libFileName));\n while (i.hasNext())\n {\n i.next();\n d->m_nodeFactories[i.key()] = i.value();\n }\n\n QHashIterator<QString, Filter*> filterIter(d->m_scriptableTagLibrary->filters(libFileName));\n while (filterIter.hasNext())\n {\n filterIter.next();\n Filter *f = filterIter.value();\n f->setParent(this->parent());\n d->m_filters[filterIter.key()] = f;\n }\n\n return;\n }\n }\n\n pluginIndex = 0;\n\n QObject *plugin;\n while (d->m_pluginDirs.size() > pluginIndex)\n {\n libFileName = d->m_pluginDirs.at(pluginIndex++) + \"lib\" + name + \".so\";\n QPluginLoader loader( libFileName );\n\n plugin = loader.instance();\n if (plugin)\n break;\n }\n if (!plugin)\n return;\n\n TagLibraryInterface *tagLibrary = qobject_cast<TagLibraryInterface*>(plugin);\n if (!tagLibrary)\n return;\n\n if (name == __scriptableLibName)\n {\n d->m_scriptableTagLibrary = tagLibrary;\n plugin->setParent(this->parent());\n return;\n }\n\n QHashIterator<QString, AbstractNodeFactory*> i(tagLibrary->nodeFactories());\n while (i.hasNext())\n {\n i.next();\n d->m_nodeFactories[i.key()] = i.value();\n }\n\n QHashIterator<QString, Filter*> filterIter(tagLibrary->filters());\n while (filterIter.hasNext())\n {\n filterIter.next();\n Filter *f = filterIter.value();\n f->setParent(this->parent());\n d->m_filters[filterIter.key()] = f;\n }\n delete tagLibrary;\n}\n\nNodeList ParserPrivate::extendNodeList(NodeList list, Node *node)\n{\n list.append(node);\n return list;\n}\n\nvoid Parser::skipPast(const QString &tag)\n{\n while (hasNextToken())\n {\n Token token = nextToken();\n if (token.tokenType == BlockToken && token.content.trimmed() == tag )\n return;\n }\n \/\/ Error. Unclosed tag\n}\n\nFilter *Parser::getFilter(const QString &name) const\n{\n Q_D(const Parser);\n return d->m_filters.value(name);\n}\n\nNodeList Parser::parse(QObject *parent)\n{\n return parse(QStringList(), parent);\n}\n\nNodeList Parser::parse(const QString &stopAt, QObject *parent)\n{\n parse(QStringList() << stopAt, parent);\n}\n\nNodeList Parser::parse(const QStringList &stopAt, QObject *parent)\n{\n Q_D(Parser);\n NodeList nodeList;\n\n while (hasNextToken())\n {\n Token token = nextToken();\n if (token.tokenType == TextToken)\n {\n nodeList = d->extendNodeList(nodeList, new TextNode(token.content, parent));\n } else if (token.tokenType == VariableToken)\n {\n if (token.content.isEmpty())\n {\n \/\/ Error. Empty variable\n QString message;\n if (hasNextToken())\n message = QString(\"Empty variable before \\\"%1\\\"\").arg(nextToken().content);\n else\n message = QString(\"Empty variable at end of input.\");\n setError(EmptyVariableError, message);\n return NodeList();\n }\n FilterExpression filterExpression(token.content, this);\n if (filterExpression.error() != NoError)\n {\n setError(filterExpression.error(), filterExpression.errorString());\n return NodeList();\n }\n nodeList = d->extendNodeList(nodeList, new VariableNode(filterExpression, parent));\n } else if (token.tokenType == BlockToken)\n {\n if (stopAt.contains(token.content))\n {\n \/\/ put the token back.\n prependToken(token);\n return nodeList;\n }\n\n QStringList tagContents = token.content.split(\" \");\n if (tagContents.size() == 0)\n {\n QString message;\n if (hasNextToken())\n message = QString(\"Empty block tag before \\\"%1\\\"\").arg(nextToken().content);\n else\n message = QString(\"Empty block tag at end of input.\");\n setError(EmptyBlockTagError, message);\n return NodeList();\n }\n QString command = tagContents.at(0);\n AbstractNodeFactory *nodeFactory = d->m_nodeFactories[command];\n\n \/\/ unknown tag.\n if (!nodeFactory)\n {\n setError(InvalidBlockTagError, QString(\"Unknown tag \\\"%1\\\"\").arg(command));\n continue;\n }\n\n \/\/ TODO: Make getNode take a Token instead?\n Node *n = nodeFactory->getNode(token.content, this, parent);\n\n if (!n)\n {\n setError(TagSyntaxError, QString(\"Failed to get node from %1\").arg(command));\n return NodeList();\n }\n\n if (NoError != nodeFactory->error())\n {\n setError(nodeFactory->error(), nodeFactory->errorString());\n return NodeList();\n }\n\n nodeList = d->extendNodeList(nodeList, n);\n }\n\n }\n\n if (stopAt.size() > 0)\n setError(UnclosedBlockTagError, QString(\"Unclosed tag in template. Expected one of: (%1)\").arg(stopAt.join(\" \")));\n\n return nodeList;\n\n}\n\nvoid Parser::setError(Error errorNumber, const QString& message)\n{\n Q_D(Parser);\n d->m_error = errorNumber;\n d->m_errorString = message;\n}\n\nError Grantlee::Parser::error() const\n{\n Q_D(const Parser);\n return d->m_error;\n}\n\nQString Parser::errorString() const\n{\n Q_D(const Parser);\n return d->m_errorString;\n}\n\nbool Parser::hasNextToken() const\n{\n Q_D(const Parser);\n return d->m_tokenList.size() > 0;\n}\n\nToken Parser::nextToken()\n{\n Q_D(Parser);\n return d->m_tokenList.takeAt(0);\n}\n\nvoid Parser::deleteNextToken()\n{\n Q_D(Parser);\n if (!d->m_tokenList.isEmpty())\n d->m_tokenList.removeAt(0);\n}\n\nvoid Parser::prependToken(const Token &token)\n{\n Q_D(Parser);\n d->m_tokenList.prepend(token);\n}\n\n<|endoftext|>"} {"text":"<commit_before><commit_msg>cleanup: bios: Avoid duplicates for table pad\/checksum<commit_after><|endoftext|>"} {"text":"<commit_before>\/**************************************************************************\n * Copyright(c) 1998-1999, ALICE Experiment at CERN, All rights reserved. *\n * *\n * Author: The ALICE Off-line Project. *\n * Contributors are mentioned in the code where appropriate. *\n * *\n * Permission to use, copy, modify and distribute this software and its *\n * documentation strictly for non-commercial purposes is hereby granted *\n * without fee, provided that the above copyright notice appears in all *\n * copies and that both the copyright notice and this permission notice *\n * appear in the supporting documentation. The authors make no claims *\n * about the suitability of this software for any purpose. It is *\n * provided \"as is\" without express or implied warranty. *\n **************************************************************************\/\n\n\/\/-----------------------------------------------------------------\n\/\/ Implementation of the base class for track residuals\n\/\/\n\/\/\n\/\/-----------------------------------------------------------------\n\n#include \"AliTrackResiduals.h\"\n\n#include \"AliAlignObj.h\"\n#include \"AliAlignObjParams.h\"\n#include \"AliTrackPointArray.h\"\n\nClassImp(AliTrackResiduals)\n\n\/\/_____________________________________________________________________________\nAliTrackResiduals::AliTrackResiduals():\n fN(0),\n fLast(0),\n fAlignObj(0),\n fVolArray(0),\n fTrackArray(0),\n fChi2(0),\n fNdf(0),\n fMinNPoints(0),\n fIsOwner(kTRUE)\n{\n \/\/ Default constructor\n for (Int_t ipar=0; ipar<6; ipar++){\n fBFixed[ipar] = kFALSE;\n fFixed[ipar] = 0.;\n } \n}\n\n\/\/_____________________________________________________________________________\nAliTrackResiduals::AliTrackResiduals(Int_t ntracks):\n fN(ntracks),\n fLast(0),\n fAlignObj(0),\n fVolArray(0),\n fTrackArray(0),\n fChi2(0),\n fNdf(0),\n fMinNPoints(0),\n fIsOwner(kTRUE)\n{\n \/\/ Constructor\n if (ntracks > 0) {\n fVolArray = new AliTrackPointArray*[ntracks];\n fTrackArray = new AliTrackPointArray*[ntracks];\n for (Int_t itrack = 0; itrack < ntracks; itrack++)\n fVolArray[itrack] = fTrackArray[itrack] = 0x0;\n }\n\n for (Int_t ipar=0; ipar<6; ipar++){\n fBFixed[ipar] = kFALSE;\n fFixed[ipar] = 0.;\n } \n}\n\n\/\/_____________________________________________________________________________\nAliTrackResiduals::AliTrackResiduals(const AliTrackResiduals &res):\n TObject(res),\n fN(res.fN),\n fLast(res.fLast),\n fAlignObj(0),\n fVolArray(new AliTrackPointArray*[fN]),\n fTrackArray(new AliTrackPointArray*[fN]),\n fChi2(res.fChi2),\n fNdf(res.fNdf),\n fMinNPoints(res.fMinNPoints),\n fIsOwner(kTRUE)\n{\n \/\/ Copy constructor\n \/\/ By default the created copy owns the track point arrays\n\n if(res.fAlignObj) fAlignObj = (AliAlignObj *)res.fAlignObj->Clone();\n\n memset(fVolArray,0,sizeof(AliTrackPointArray*)*fN);\n memset(fTrackArray,0,sizeof(AliTrackPointArray*)*fN);\n\n for (Int_t itrack = 0; itrack < fN; itrack++)\n {\n\tif (res.fVolArray[itrack])\n\t fVolArray[itrack] = new AliTrackPointArray(*res.fVolArray[itrack]);\n\tif (res.fTrackArray[itrack])\n\t fTrackArray[itrack] = new AliTrackPointArray(*res.fTrackArray[itrack]);\n }\n\n}\n\n\/\/_____________________________________________________________________________\nAliTrackResiduals &AliTrackResiduals::operator =(const AliTrackResiduals& res)\n{\n \/\/ assignment operator\n \/\/ Does not copy the track point arrays\n if(this!=&res) {\n TObject::operator=(res);\n \n fN = res.fN;\n fLast = res.fLast;\n fAlignObj = res.fAlignObj;\n fVolArray = res.fVolArray;\n fTrackArray = res.fTrackArray;\n fChi2 = res.fChi2;\n fNdf = res.fNdf;\n fMinNPoints = res.fMinNPoints;\n fIsOwner = kFALSE;\n \n memcpy(fBFixed,res.fBFixed,sizeof(Float_t)*6);\n memcpy(fFixed,res.fFixed,sizeof(Float_t)*6);\n }\n return *this;\n}\n\n\/\/_____________________________________________________________________________\nAliTrackResiduals::~AliTrackResiduals()\n{\n \/\/ Destructor\n if (fAlignObj) delete fAlignObj;\n DeleteTrackPointArrays();\n}\n\n\/\/_____________________________________________________________________________\nvoid AliTrackResiduals::SetNTracks(Int_t ntracks)\n{\n \/\/ Set new size for the track point arrays.\n \/\/ Delete the old arrays and allocate the\n \/\/ new ones.\n DeleteTrackPointArrays();\n\n fN = ntracks;\n fLast = 0;\n fChi2 = 0;\n fNdf = 0;\n fIsOwner = kTRUE;\n\n if (ntracks > 0) {\n fVolArray = new AliTrackPointArray*[ntracks];\n fTrackArray = new AliTrackPointArray*[ntracks];\n for (Int_t itrack = 0; itrack < ntracks; itrack++)\n fVolArray[itrack] = fTrackArray[itrack] = 0x0;\n }\n else {\n fVolArray = fTrackArray = 0x0;\n }\n}\n\n\/\/_____________________________________________________________________________\nBool_t AliTrackResiduals::AddTrackPointArrays(AliTrackPointArray *volarray, AliTrackPointArray *trackarray)\n{\n \/\/ Adds pair of track space point and\n \/\/ track extrapolation point arrays\n if (!fVolArray || !fTrackArray) return kFALSE;\n\n if (!volarray || !trackarray) return kFALSE;\n\n if (volarray->GetNPoints() < fMinNPoints) return kFALSE;\n\n if (fLast >= fN) return kFALSE;\n\n fVolArray[fLast] = volarray;\n fTrackArray[fLast] = trackarray;\n fLast++;\n\n return kTRUE;\n}\n\n\/\/_____________________________________________________________________________\nvoid AliTrackResiduals::InitAlignObj()\n{\n \/\/ Create the alignment object \n \/\/ to be updated\n if (fAlignObj) delete fAlignObj;\n fAlignObj = new AliAlignObjParams;\n}\n\n\n\/\/_____________________________________________________________________________\nBool_t AliTrackResiduals::GetTrackPointArrays(Int_t i, AliTrackPointArray* &volarray, AliTrackPointArray* &trackarray) const\n{\n \/\/ Provide an access to a pair of track point arrays\n \/\/ with given index\n if (i >= fLast) {\n volarray = trackarray = 0x0;\n return kFALSE;\n }\n else {\n volarray = fVolArray[i];\n trackarray = fTrackArray[i];\n return kTRUE;\n }\n}\n\n\/\/_____________________________________________________________________________\nvoid AliTrackResiduals::DeleteTrackPointArrays()\n{\n \/\/ Deletes the track point arrays only in case\n \/\/ the object is their owner.\n \/\/ Called by the destructor and SetNTracks methods.\n if (fIsOwner) {\n if (fVolArray) {\n for (Int_t itrack = 0; itrack < fN; itrack++) {\n\tif (fVolArray[itrack]) delete fVolArray[itrack];\n }\n delete [] fVolArray;\n }\n if (fTrackArray) {\n for (Int_t itrack = 0; itrack < fN; itrack++) {\n\tif (fTrackArray[itrack]) delete fTrackArray[itrack];\n }\n delete [] fTrackArray;\n }\n }\n}\n\n\/\/_____________________________________________________\nInt_t AliTrackResiduals::GetNFreeParam(){ \n Int_t unfixedparam=6;\n for(Int_t j=0;j<6;j++){\n if(fBFixed[j]==kTRUE)unfixedparam--;\n }\n return unfixedparam;\n}\n<commit_msg>Fixing coverity 18641<commit_after>\/**************************************************************************\n * Copyright(c) 1998-1999, ALICE Experiment at CERN, All rights reserved. *\n * *\n * Author: The ALICE Off-line Project. *\n * Contributors are mentioned in the code where appropriate. *\n * *\n * Permission to use, copy, modify and distribute this software and its *\n * documentation strictly for non-commercial purposes is hereby granted *\n * without fee, provided that the above copyright notice appears in all *\n * copies and that both the copyright notice and this permission notice *\n * appear in the supporting documentation. The authors make no claims *\n * about the suitability of this software for any purpose. It is *\n * provided \"as is\" without express or implied warranty. *\n **************************************************************************\/\n\n\/\/-----------------------------------------------------------------\n\/\/ Implementation of the base class for track residuals\n\/\/\n\/\/\n\/\/-----------------------------------------------------------------\n\n#include \"AliTrackResiduals.h\"\n\n#include \"AliAlignObj.h\"\n#include \"AliAlignObjParams.h\"\n#include \"AliTrackPointArray.h\"\n\nClassImp(AliTrackResiduals)\n\n\/\/_____________________________________________________________________________\nAliTrackResiduals::AliTrackResiduals():\n fN(0),\n fLast(0),\n fAlignObj(0),\n fVolArray(0),\n fTrackArray(0),\n fChi2(0),\n fNdf(0),\n fMinNPoints(0),\n fIsOwner(kTRUE)\n{\n \/\/ Default constructor\n for (Int_t ipar=0; ipar<6; ipar++){\n fBFixed[ipar] = kFALSE;\n fFixed[ipar] = 0.;\n } \n}\n\n\/\/_____________________________________________________________________________\nAliTrackResiduals::AliTrackResiduals(Int_t ntracks):\n fN(ntracks),\n fLast(0),\n fAlignObj(0),\n fVolArray(0),\n fTrackArray(0),\n fChi2(0),\n fNdf(0),\n fMinNPoints(0),\n fIsOwner(kTRUE)\n{\n \/\/ Constructor\n if (ntracks > 0) {\n fVolArray = new AliTrackPointArray*[ntracks];\n fTrackArray = new AliTrackPointArray*[ntracks];\n for (Int_t itrack = 0; itrack < ntracks; itrack++)\n fVolArray[itrack] = fTrackArray[itrack] = 0x0;\n }\n\n for (Int_t ipar=0; ipar<6; ipar++){\n fBFixed[ipar] = kFALSE;\n fFixed[ipar] = 0.;\n } \n}\n\n\/\/_____________________________________________________________________________\nAliTrackResiduals::AliTrackResiduals(const AliTrackResiduals &res):\n TObject(res),\n fN(res.fN),\n fLast(res.fLast),\n fAlignObj(0),\n fVolArray(new AliTrackPointArray*[fN]),\n fTrackArray(new AliTrackPointArray*[fN]),\n fChi2(res.fChi2),\n fNdf(res.fNdf),\n fMinNPoints(res.fMinNPoints),\n fIsOwner(kTRUE)\n{\n \/\/ Copy constructor\n \/\/ By default the created copy owns the track point arrays\n\n if(res.fAlignObj) fAlignObj = (AliAlignObj *)res.fAlignObj->Clone();\n\n memset(fVolArray,0,sizeof(AliTrackPointArray*)*fN);\n memset(fTrackArray,0,sizeof(AliTrackPointArray*)*fN);\n\n for (Int_t itrack = 0; itrack < fN; itrack++)\n {\n\tif (res.fVolArray[itrack])\n\t fVolArray[itrack] = new AliTrackPointArray(*res.fVolArray[itrack]);\n\tif (res.fTrackArray[itrack])\n\t fTrackArray[itrack] = new AliTrackPointArray(*res.fTrackArray[itrack]);\n }\n\n}\n\n\/\/_____________________________________________________________________________\nAliTrackResiduals &AliTrackResiduals::operator =(const AliTrackResiduals& res)\n{\n \/\/ assignment operator\n \/\/ Does not copy the track point arrays\n if(this!=&res) {\n TObject::operator=(res);\n \n fN = res.fN;\n fLast = res.fLast;\n fAlignObj = res.fAlignObj;\n fVolArray = res.fVolArray;\n fTrackArray = res.fTrackArray;\n fChi2 = res.fChi2;\n fNdf = res.fNdf;\n fMinNPoints = res.fMinNPoints;\n fIsOwner = kFALSE;\n \n memcpy(fBFixed,res.fBFixed,sizeof(Bool_t)*6);\n memcpy(fFixed,res.fFixed,sizeof(Float_t)*6);\n }\n return *this;\n}\n\n\/\/_____________________________________________________________________________\nAliTrackResiduals::~AliTrackResiduals()\n{\n \/\/ Destructor\n if (fAlignObj) delete fAlignObj;\n DeleteTrackPointArrays();\n}\n\n\/\/_____________________________________________________________________________\nvoid AliTrackResiduals::SetNTracks(Int_t ntracks)\n{\n \/\/ Set new size for the track point arrays.\n \/\/ Delete the old arrays and allocate the\n \/\/ new ones.\n DeleteTrackPointArrays();\n\n fN = ntracks;\n fLast = 0;\n fChi2 = 0;\n fNdf = 0;\n fIsOwner = kTRUE;\n\n if (ntracks > 0) {\n fVolArray = new AliTrackPointArray*[ntracks];\n fTrackArray = new AliTrackPointArray*[ntracks];\n for (Int_t itrack = 0; itrack < ntracks; itrack++)\n fVolArray[itrack] = fTrackArray[itrack] = 0x0;\n }\n else {\n fVolArray = fTrackArray = 0x0;\n }\n}\n\n\/\/_____________________________________________________________________________\nBool_t AliTrackResiduals::AddTrackPointArrays(AliTrackPointArray *volarray, AliTrackPointArray *trackarray)\n{\n \/\/ Adds pair of track space point and\n \/\/ track extrapolation point arrays\n if (!fVolArray || !fTrackArray) return kFALSE;\n\n if (!volarray || !trackarray) return kFALSE;\n\n if (volarray->GetNPoints() < fMinNPoints) return kFALSE;\n\n if (fLast >= fN) return kFALSE;\n\n fVolArray[fLast] = volarray;\n fTrackArray[fLast] = trackarray;\n fLast++;\n\n return kTRUE;\n}\n\n\/\/_____________________________________________________________________________\nvoid AliTrackResiduals::InitAlignObj()\n{\n \/\/ Create the alignment object \n \/\/ to be updated\n if (fAlignObj) delete fAlignObj;\n fAlignObj = new AliAlignObjParams;\n}\n\n\n\/\/_____________________________________________________________________________\nBool_t AliTrackResiduals::GetTrackPointArrays(Int_t i, AliTrackPointArray* &volarray, AliTrackPointArray* &trackarray) const\n{\n \/\/ Provide an access to a pair of track point arrays\n \/\/ with given index\n if (i >= fLast) {\n volarray = trackarray = 0x0;\n return kFALSE;\n }\n else {\n volarray = fVolArray[i];\n trackarray = fTrackArray[i];\n return kTRUE;\n }\n}\n\n\/\/_____________________________________________________________________________\nvoid AliTrackResiduals::DeleteTrackPointArrays()\n{\n \/\/ Deletes the track point arrays only in case\n \/\/ the object is their owner.\n \/\/ Called by the destructor and SetNTracks methods.\n if (fIsOwner) {\n if (fVolArray) {\n for (Int_t itrack = 0; itrack < fN; itrack++) {\n\tif (fVolArray[itrack]) delete fVolArray[itrack];\n }\n delete [] fVolArray;\n }\n if (fTrackArray) {\n for (Int_t itrack = 0; itrack < fN; itrack++) {\n\tif (fTrackArray[itrack]) delete fTrackArray[itrack];\n }\n delete [] fTrackArray;\n }\n }\n}\n\n\/\/_____________________________________________________\nInt_t AliTrackResiduals::GetNFreeParam(){ \n Int_t unfixedparam=6;\n for(Int_t j=0;j<6;j++){\n if(fBFixed[j]==kTRUE)unfixedparam--;\n }\n return unfixedparam;\n}\n<|endoftext|>"} {"text":"<commit_before>#include \"base_draw_startmenue.h\"\n\nBase_draw_startmenue::Base_draw_startmenue(double *define_srsize_, int *gr_, int draw_x_, int draw_y_, int rota_cx_, int rota_cy_, double rota_radian_, \n\t\tint *menue_var_, int this_menue_var_) {\n\tp_define_srsize = define_srsize_;\n\tp_gr = gr_;\n\tdraw_x = draw_x_;\n\tdraw_y = draw_y_;\n\trota_cx = rota_cx_;\n\trota_cy = rota_cy_;\n\trota_radian = rota_radian_;\n\tmenue_var = menue_var_;\n\tthis_menue_var = this_menue_var_;\n}\n\nvoid Base_draw_startmenue::Drawgr() {\n\tif (*menue_var == this_menue_var) {\n\t\tDrawRotaGraph2(static_cast<int>(draw_x * *p_define_srsize), static_cast<int>(draw_y * *p_define_srsize), \n\t\t\tstatic_cast<int>(rota_cx * *p_define_srsize), static_cast<int>(rota_cy * *p_define_srsize), *p_define_srsize, rota_radian, *p_gr, true, false);\n\t}\n\telse if (*menue_var == this_menue_var + 1 || (this_menue_var == 0 && *menue_var == MAX_MENUE_NUMBER - 1)) {\n\t\tSetDrawBlendMode(DX_BLENDMODE_ALPHA, 128);\n\t\tDrawRotaGraph2(static_cast<int>(draw_x * *p_define_srsize), static_cast<int>(draw_y * *p_define_srsize + MOVE_MENUE_DIST), \n\t\t\tstatic_cast<int>(rota_cx * *p_define_srsize), static_cast<int>(rota_cy * *p_define_srsize), *p_define_srsize, rota_radian, *p_gr, true, false);\n\t\tSetDrawBlendMode(DX_BLENDMODE_NOBLEND, 0);\n\t}\n\telse if (*menue_var == this_menue_var - 1 || (this_menue_var == MAX_MENUE_NUMBER - 1 && *menue_var == 0)) {\n\t\tSetDrawBlendMode(DX_BLENDMODE_ALPHA, 128);\n\t\tDrawRotaGraph2(static_cast<int>(draw_x * *p_define_srsize), static_cast<int>(draw_y * *p_define_srsize - MOVE_MENUE_DIST), \n\t\t\tstatic_cast<int>(rota_cx * *p_define_srsize), static_cast<int>(rota_cy * *p_define_srsize), *p_define_srsize, rota_radian, *p_gr, true, false);\n\t\tSetDrawBlendMode(DX_BLENDMODE_NOBLEND, 0);\n\t}\n}<commit_msg>正常にスタートメニューが表示されるよう修正<commit_after>#include \"base_draw_startmenue.h\"\n\nBase_draw_startmenue::Base_draw_startmenue(double *define_srsize_, int *gr_, int draw_x_, int draw_y_, int rota_cx_, int rota_cy_, double rota_radian_, \n\t\tint *menue_var_, int this_menue_var_) {\n\tp_define_srsize = define_srsize_;\n\tp_gr = gr_;\n\tdraw_x = draw_x_;\n\tdraw_y = draw_y_;\n\trota_cx = rota_cx_;\n\trota_cy = rota_cy_;\n\trota_radian = rota_radian_;\n\tmenue_var = menue_var_;\n\tthis_menue_var = this_menue_var_;\n}\n\nvoid Base_draw_startmenue::Drawgr() {\n\tif (*menue_var == this_menue_var) {\n\t\tDrawRotaGraph2(static_cast<int>(draw_x * *p_define_srsize), static_cast<int>(draw_y * *p_define_srsize), \n\t\t\tstatic_cast<int>(rota_cx * *p_define_srsize), static_cast<int>(rota_cy * *p_define_srsize), *p_define_srsize, rota_radian, *p_gr, true, false);\n\t}\n\telse if (*menue_var == this_menue_var + 1 || (this_menue_var == MAX_MENUE_NUMBER - 1 && *menue_var == 0)) {\n\t\tSetDrawBlendMode(DX_BLENDMODE_ALPHA, 128);\n\t\tDrawRotaGraph2(static_cast<int>(draw_x * *p_define_srsize), static_cast<int>(draw_y * *p_define_srsize + MOVE_MENUE_DIST), \n\t\t\tstatic_cast<int>(rota_cx * *p_define_srsize), static_cast<int>(rota_cy * *p_define_srsize), *p_define_srsize, rota_radian, *p_gr, true, false);\n\t\tSetDrawBlendMode(DX_BLENDMODE_NOBLEND, 0);\n\t}\n\telse if (*menue_var == this_menue_var - 1 || (this_menue_var == 0 && *menue_var == MAX_MENUE_NUMBER - 1)) {\n\t\tSetDrawBlendMode(DX_BLENDMODE_ALPHA, 128);\n\t\tDrawRotaGraph2(static_cast<int>(draw_x * *p_define_srsize), static_cast<int>(draw_y * *p_define_srsize - MOVE_MENUE_DIST), \n\t\t\tstatic_cast<int>(rota_cx * *p_define_srsize), static_cast<int>(rota_cy * *p_define_srsize), *p_define_srsize, rota_radian, *p_gr, true, false);\n\t\tSetDrawBlendMode(DX_BLENDMODE_NOBLEND, 0);\n\t}\n}<|endoftext|>"} {"text":"<commit_before><commit_msg>Fix documentation.<commit_after><|endoftext|>"} {"text":"<commit_before>\/*\n * Software License Agreement (BSD License)\n *\n * Copyright (c) 2009, Willow Garage, Inc.\n * All rights reserved.\n *\n * Redistribution and use in source and binary forms, with or without\n * modification, are permitted provided that the following conditions\n * are met:\n *\n * * Redistributions of source code must retain the above copyright\n * notice, this list of conditions and the following disclaimer.\n * * Redistributions in binary form must reproduce the above\n * copyright notice, this list of conditions and the following\n * disclaimer in the documentation and\/or other materials provided\n * with the distribution.\n * * Neither the name of Willow Garage, Inc. nor the names of its\n * contributors may be used to endorse or promote products derived\n * from this software without specific prior written permission.\n *\n * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS\n * \"AS IS\" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT\n * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS\n * FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE\n * COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT,\n * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING,\n * BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;\n * LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER\n * CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT\n * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN\n * ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE\n * POSSIBILITY OF SUCH DAMAGE.\n *\n * $Id$\n *\n *\/\n\n#ifndef PCL_SAMPLE_CONSENSUS_IMPL_SAC_MODEL_PLANE_H_\n#define PCL_SAMPLE_CONSENSUS_IMPL_SAC_MODEL_PLANE_H_\n\n#include \"pcl\/sample_consensus\/sac_model_plane.h\"\n#include \"pcl\/common\/centroid.h\"\n#include \"pcl\/common\/eigen.h\"\n#include \"pcl\/common\/concatenate.h\"\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\ntemplate <typename PointT> bool\npcl::SampleConsensusModelPlane<PointT>::isSampleGood(const std::vector<int> &samples) const\n{\n \/\/ Get the values at the two points\n pcl::Array4fMapConst p0 = input_->points[samples[0]].getArray4fMap ();\n pcl::Array4fMapConst p1 = input_->points[samples[1]].getArray4fMap ();\n pcl::Array4fMapConst p2 = input_->points[samples[2]].getArray4fMap ();\n\n \/\/ Compute the segment values (in 3d) between p1 and p0\n Eigen::Array4f p1p0 = p1 - p0;\n\n \/\/ Compute the segment values (in 3d) between p2 and p0\n Eigen::Array4f p2p0 = p2 - p0;\n\n Eigen::Array4f dy1dy2 = p1p0 \/ p2p0;\n\n return ( (dy1dy2[0] != dy1dy2[1]) || (dy1dy2[2] != dy1dy2[1]) );\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\ntemplate <typename PointT> bool\npcl::SampleConsensusModelPlane<PointT>::computeModelCoefficients (\n const std::vector<int> &samples, Eigen::VectorXf &model_coefficients)\n{\n \/\/ Need 3 samples\n if (samples.size () != 3)\n {\n PCL_ERROR (\"[pcl::SampleConsensusModelPlane::computeModelCoefficients] Invalid set of samples given (%lu)!\\n\", (unsigned long)samples.size ());\n return (false);\n }\n\n pcl::Array4fMapConst p0 = input_->points[samples[0]].getArray4fMap ();\n pcl::Array4fMapConst p1 = input_->points[samples[1]].getArray4fMap ();\n pcl::Array4fMapConst p2 = input_->points[samples[2]].getArray4fMap ();\n\n \/\/ Compute the segment values (in 3d) between p1 and p0\n Eigen::Array4f p1p0 = p1 - p0;\n \/\/ Compute the segment values (in 3d) between p2 and p0\n Eigen::Array4f p2p0 = p2 - p0;\n\n \/\/ Avoid some crashes by checking for collinearity here\n Eigen::Array4f dy1dy2 = p1p0 \/ p2p0;\n if ( (dy1dy2[0] == dy1dy2[1]) && (dy1dy2[2] == dy1dy2[1]) ) \/\/ Check for collinearity\n return (false);\n\n \/\/ Compute the plane coefficients from the 3 given points in a straightforward manner\n \/\/ calculate the plane normal n = (p2-p1) x (p3-p1) = cross (p2-p1, p3-p1)\n model_coefficients.resize (4);\n model_coefficients[0] = p1p0[1] * p2p0[2] - p1p0[2] * p2p0[1];\n model_coefficients[1] = p1p0[2] * p2p0[0] - p1p0[0] * p2p0[2];\n model_coefficients[2] = p1p0[0] * p2p0[1] - p1p0[1] * p2p0[0];\n model_coefficients[3] = 0;\n\n \/\/ Normalize\n model_coefficients.normalize ();\n\n \/\/ ... + d = 0\n model_coefficients[3] = -1 * (model_coefficients.template head<4>().dot (p0.matrix ()));\n\n return (true);\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\ntemplate <typename PointT> void\npcl::SampleConsensusModelPlane<PointT>::getDistancesToModel (\n const Eigen::VectorXf &model_coefficients, std::vector<double> &distances)\n{\n \/\/ Needs a valid set of model coefficients\n if (model_coefficients.size () != 4)\n {\n PCL_ERROR (\"[pcl::SampleConsensusModelPlane::getDistancesToModel] Invalid number of model coefficients given (%lu)!\\n\", (unsigned long)model_coefficients.size ());\n return;\n }\n\n distances.resize (indices_->size ());\n\n \/\/ Iterate through the 3d points and calculate the distances from them to the plane\n for (size_t i = 0; i < indices_->size (); ++i)\n {\n \/\/ Calculate the distance from the point to the plane normal as the dot product\n \/\/ D = (P-A).N\/|N|\n \/*distances[i] = fabs (model_coefficients[0] * input_->points[(*indices_)[i]].x +\n model_coefficients[1] * input_->points[(*indices_)[i]].y +\n model_coefficients[2] * input_->points[(*indices_)[i]].z +\n model_coefficients[3]);*\/\n Eigen::Vector4f pt (input_->points[(*indices_)[i]].x,\n input_->points[(*indices_)[i]].y,\n input_->points[(*indices_)[i]].z,\n 1);\n distances[i] = fabs (model_coefficients.dot (pt));\n }\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\ntemplate <typename PointT> void\npcl::SampleConsensusModelPlane<PointT>::selectWithinDistance (\n const Eigen::VectorXf &model_coefficients, double threshold, std::vector<int> &inliers)\n{\n \/\/ Needs a valid set of model coefficients\n if (model_coefficients.size () != 4)\n {\n PCL_ERROR (\"[pcl::SampleConsensusModelPlane::selectWithinDistance] Invalid number of model coefficients given (%lu)!\\n\", (unsigned long)model_coefficients.size ());\n return;\n }\n\n int nr_p = 0;\n inliers.resize (indices_->size ());\n\n \/\/ Iterate through the 3d points and calculate the distances from them to the plane\n for (size_t i = 0; i < indices_->size (); ++i)\n {\n \/\/ Calculate the distance from the point to the plane normal as the dot product\n \/\/ D = (P-A).N\/|N|\n Eigen::Vector4f pt (input_->points[(*indices_)[i]].x,\n input_->points[(*indices_)[i]].y,\n input_->points[(*indices_)[i]].z,\n 1);\n if (fabs (model_coefficients.dot (pt)) < threshold)\n {\n \/\/ Returns the indices of the points whose distances are smaller than the threshold\n inliers[nr_p] = (*indices_)[i];\n nr_p++;\n }\n }\n inliers.resize (nr_p);\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\ntemplate <typename PointT> void\npcl::SampleConsensusModelPlane<PointT>::optimizeModelCoefficients (\n const std::vector<int> &inliers, const Eigen::VectorXf &model_coefficients, Eigen::VectorXf &optimized_coefficients)\n{\n \/\/ Needs a valid set of model coefficients\n if (model_coefficients.size () != 4)\n {\n PCL_ERROR (\"[pcl::SampleConsensusModelPlane::optimizeModelCoefficients] Invalid number of model coefficients given (%lu)!\\n\", (unsigned long)model_coefficients.size ());\n optimized_coefficients = model_coefficients;\n return;\n }\n\n \/\/ Need at least 3 points to estimate a plane\n if (inliers.size () < 4)\n {\n PCL_ERROR (\"[pcl::SampleConsensusModelPlane::optimizeModelCoefficients] Not enough inliers found to support a model (%lu)! Returning the same coefficients.\\n\", (unsigned long)inliers.size ());\n optimized_coefficients = model_coefficients;\n return;\n }\n\n Eigen::Vector4f plane_parameters;\n\n \/\/ Use Least-Squares to fit the plane through all the given sample points and find out its coefficients\n EIGEN_ALIGN16 Eigen::Matrix3f covariance_matrix;\n Eigen::Vector4f xyz_centroid;\n\n \/\/ Estimate the XYZ centroid\n compute3DCentroid (*input_, inliers, xyz_centroid);\n xyz_centroid[3] = 0;\n\n \/\/ Compute the 3x3 covariance matrix\n computeCovarianceMatrix (*input_, inliers, xyz_centroid, covariance_matrix);\n\n \/\/ Compute the model coefficients\n EIGEN_ALIGN16 Eigen::Vector3f eigen_values;\n EIGEN_ALIGN16 Eigen::Matrix3f eigen_vectors;\n pcl::eigen33 (covariance_matrix, eigen_vectors, eigen_values);\n\n \/\/ Hessian form (D = nc . p_plane (centroid here) + p)\n optimized_coefficients.resize (4);\n optimized_coefficients[0] = eigen_vectors (0, 0);\n optimized_coefficients[1] = eigen_vectors (1, 0);\n optimized_coefficients[2] = eigen_vectors (2, 0);\n optimized_coefficients[3] = 0;\n optimized_coefficients[3] = -1 * optimized_coefficients.dot (xyz_centroid);\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\ntemplate <typename PointT> void\npcl::SampleConsensusModelPlane<PointT>::projectPoints (\n const std::vector<int> &inliers, const Eigen::VectorXf &model_coefficients, PointCloud &projected_points, bool copy_data_fields)\n{\n \/\/ Needs a valid set of model coefficients\n if (model_coefficients.size () != 4)\n {\n PCL_ERROR (\"[pcl::SampleConsensusModelPlane::projectPoints] Invalid number of model coefficients given (%lu)!\\n\", (unsigned long)model_coefficients.size ());\n return;\n }\n\n projected_points.header = input_->header;\n projected_points.is_dense = input_->is_dense;\n\n Eigen::Vector4f mc (model_coefficients[0], model_coefficients[1], model_coefficients[2], 0);\n \/\/ Copy all the data fields from the input cloud to the projected one?\n if (copy_data_fields)\n {\n \/\/ Allocate enough space and copy the basics\n projected_points.points.resize (input_->points.size ());\n projected_points.width = input_->width;\n projected_points.height = input_->height;\n\n typedef typename pcl::traits::fieldList<PointT>::type FieldList;\n \/\/ Iterate over each point\n for (size_t i = 0; i < input_->points.size (); ++i)\n \/\/ Iterate over each dimension\n pcl::for_each_type <FieldList> (NdConcatenateFunctor <PointT, PointT> (input_->points[i], projected_points.points[i]));\n\n \/\/ Iterate through the 3d points and calculate the distances from them to the plane\n for (size_t i = 0; i < inliers.size (); ++i)\n {\n \/\/ Calculate the distance from the point to the plane\n Eigen::Vector4f p (input_->points[inliers[i]].x,\n input_->points[inliers[i]].y,\n input_->points[inliers[i]].z,\n 1);\n float distance_to_plane = model_coefficients.dot (p);\n\n pcl::Vector4fMap pp = projected_points.points[inliers[i]].getVector4fMap ();\n pp = p - mc * distance_to_plane; \/\/ mc[3] = 0, therefore the 3rd coordinate is safe\n }\n }\n else\n {\n \/\/ Allocate enough space and copy the basics\n projected_points.points.resize (inliers.size ());\n projected_points.width = inliers.size ();\n projected_points.height = 1;\n\n typedef typename pcl::traits::fieldList<PointT>::type FieldList;\n \/\/ Iterate over each point\n for (size_t i = 0; i < inliers.size (); ++i)\n \/\/ Iterate over each dimension\n pcl::for_each_type <FieldList> (NdConcatenateFunctor <PointT, PointT> (input_->points[inliers[i]], projected_points.points[i]));\n\n \/\/ Iterate through the 3d points and calculate the distances from them to the plane\n for (size_t i = 0; i < inliers.size (); ++i)\n {\n \/\/ Calculate the distance from the point to the plane\n Eigen::Vector4f p (input_->points[inliers[i]].x,\n input_->points[inliers[i]].y,\n input_->points[inliers[i]].z,\n 1);\n float distance_to_plane = model_coefficients.dot (p);\n\n pcl::Vector4fMap pp = projected_points.points[i].getVector4fMap ();\n pp = p - mc * distance_to_plane; \/\/ mc[3] = 0, therefore the 3rd coordinate is safe\n }\n }\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\ntemplate <typename PointT> bool\npcl::SampleConsensusModelPlane<PointT>::doSamplesVerifyModel (\n const std::set<int> &indices, const Eigen::VectorXf &model_coefficients, double threshold)\n{\n \/\/ Needs a valid set of model coefficients\n if (model_coefficients.size () != 4)\n {\n PCL_ERROR (\"[pcl::SampleConsensusModelPlane::doSamplesVerifyModel] Invalid number of model coefficients given (%lu)!\\n\", (unsigned long)model_coefficients.size ());\n return (false);\n }\n\n for (std::set<int>::const_iterator it = indices.begin (); it != indices.end (); ++it)\n {\n Eigen::Vector4f pt (input_->points[*it].x,\n input_->points[*it].y,\n input_->points[*it].z,\n 1);\n if (fabs (model_coefficients.dot (pt)) > threshold)\n return (false);\n }\n\n return (true);\n}\n\n#define PCL_INSTANTIATE_SampleConsensusModelPlane(T) template class PCL_EXPORTS pcl::SampleConsensusModelPlane<T>;\n\n#endif \/\/ PCL_SAMPLE_CONSENSUS_IMPL_SAC_MODEL_PLANE_H_\n\n<commit_msg>fixed issue #192 (error in projection of pcl::ProjectInliers with pcl::SACMODEL_PLANE)<commit_after>\/*\n * Software License Agreement (BSD License)\n *\n * Copyright (c) 2009, Willow Garage, Inc.\n * All rights reserved.\n *\n * Redistribution and use in source and binary forms, with or without\n * modification, are permitted provided that the following conditions\n * are met:\n *\n * * Redistributions of source code must retain the above copyright\n * notice, this list of conditions and the following disclaimer.\n * * Redistributions in binary form must reproduce the above\n * copyright notice, this list of conditions and the following\n * disclaimer in the documentation and\/or other materials provided\n * with the distribution.\n * * Neither the name of Willow Garage, Inc. nor the names of its\n * contributors may be used to endorse or promote products derived\n * from this software without specific prior written permission.\n *\n * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS\n * \"AS IS\" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT\n * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS\n * FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE\n * COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT,\n * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING,\n * BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;\n * LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER\n * CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT\n * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN\n * ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE\n * POSSIBILITY OF SUCH DAMAGE.\n *\n * $Id$\n *\n *\/\n\n#ifndef PCL_SAMPLE_CONSENSUS_IMPL_SAC_MODEL_PLANE_H_\n#define PCL_SAMPLE_CONSENSUS_IMPL_SAC_MODEL_PLANE_H_\n\n#include \"pcl\/sample_consensus\/sac_model_plane.h\"\n#include \"pcl\/common\/centroid.h\"\n#include \"pcl\/common\/eigen.h\"\n#include \"pcl\/common\/concatenate.h\"\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\ntemplate <typename PointT> bool\npcl::SampleConsensusModelPlane<PointT>::isSampleGood(const std::vector<int> &samples) const\n{\n \/\/ Get the values at the two points\n pcl::Array4fMapConst p0 = input_->points[samples[0]].getArray4fMap ();\n pcl::Array4fMapConst p1 = input_->points[samples[1]].getArray4fMap ();\n pcl::Array4fMapConst p2 = input_->points[samples[2]].getArray4fMap ();\n\n \/\/ Compute the segment values (in 3d) between p1 and p0\n Eigen::Array4f p1p0 = p1 - p0;\n\n \/\/ Compute the segment values (in 3d) between p2 and p0\n Eigen::Array4f p2p0 = p2 - p0;\n\n Eigen::Array4f dy1dy2 = p1p0 \/ p2p0;\n\n return ( (dy1dy2[0] != dy1dy2[1]) || (dy1dy2[2] != dy1dy2[1]) );\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\ntemplate <typename PointT> bool\npcl::SampleConsensusModelPlane<PointT>::computeModelCoefficients (\n const std::vector<int> &samples, Eigen::VectorXf &model_coefficients)\n{\n \/\/ Need 3 samples\n if (samples.size () != 3)\n {\n PCL_ERROR (\"[pcl::SampleConsensusModelPlane::computeModelCoefficients] Invalid set of samples given (%lu)!\\n\", (unsigned long)samples.size ());\n return (false);\n }\n\n pcl::Array4fMapConst p0 = input_->points[samples[0]].getArray4fMap ();\n pcl::Array4fMapConst p1 = input_->points[samples[1]].getArray4fMap ();\n pcl::Array4fMapConst p2 = input_->points[samples[2]].getArray4fMap ();\n\n \/\/ Compute the segment values (in 3d) between p1 and p0\n Eigen::Array4f p1p0 = p1 - p0;\n \/\/ Compute the segment values (in 3d) between p2 and p0\n Eigen::Array4f p2p0 = p2 - p0;\n\n \/\/ Avoid some crashes by checking for collinearity here\n Eigen::Array4f dy1dy2 = p1p0 \/ p2p0;\n if ( (dy1dy2[0] == dy1dy2[1]) && (dy1dy2[2] == dy1dy2[1]) ) \/\/ Check for collinearity\n return (false);\n\n \/\/ Compute the plane coefficients from the 3 given points in a straightforward manner\n \/\/ calculate the plane normal n = (p2-p1) x (p3-p1) = cross (p2-p1, p3-p1)\n model_coefficients.resize (4);\n model_coefficients[0] = p1p0[1] * p2p0[2] - p1p0[2] * p2p0[1];\n model_coefficients[1] = p1p0[2] * p2p0[0] - p1p0[0] * p2p0[2];\n model_coefficients[2] = p1p0[0] * p2p0[1] - p1p0[1] * p2p0[0];\n model_coefficients[3] = 0;\n\n \/\/ Normalize\n model_coefficients.normalize ();\n\n \/\/ ... + d = 0\n model_coefficients[3] = -1 * (model_coefficients.template head<4>().dot (p0.matrix ()));\n\n return (true);\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\ntemplate <typename PointT> void\npcl::SampleConsensusModelPlane<PointT>::getDistancesToModel (\n const Eigen::VectorXf &model_coefficients, std::vector<double> &distances)\n{\n \/\/ Needs a valid set of model coefficients\n if (model_coefficients.size () != 4)\n {\n PCL_ERROR (\"[pcl::SampleConsensusModelPlane::getDistancesToModel] Invalid number of model coefficients given (%lu)!\\n\", (unsigned long)model_coefficients.size ());\n return;\n }\n\n distances.resize (indices_->size ());\n\n \/\/ Iterate through the 3d points and calculate the distances from them to the plane\n for (size_t i = 0; i < indices_->size (); ++i)\n {\n \/\/ Calculate the distance from the point to the plane normal as the dot product\n \/\/ D = (P-A).N\/|N|\n \/*distances[i] = fabs (model_coefficients[0] * input_->points[(*indices_)[i]].x +\n model_coefficients[1] * input_->points[(*indices_)[i]].y +\n model_coefficients[2] * input_->points[(*indices_)[i]].z +\n model_coefficients[3]);*\/\n Eigen::Vector4f pt (input_->points[(*indices_)[i]].x,\n input_->points[(*indices_)[i]].y,\n input_->points[(*indices_)[i]].z,\n 1);\n distances[i] = fabs (model_coefficients.dot (pt));\n }\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\ntemplate <typename PointT> void\npcl::SampleConsensusModelPlane<PointT>::selectWithinDistance (\n const Eigen::VectorXf &model_coefficients, double threshold, std::vector<int> &inliers)\n{\n \/\/ Needs a valid set of model coefficients\n if (model_coefficients.size () != 4)\n {\n PCL_ERROR (\"[pcl::SampleConsensusModelPlane::selectWithinDistance] Invalid number of model coefficients given (%lu)!\\n\", (unsigned long)model_coefficients.size ());\n return;\n }\n\n int nr_p = 0;\n inliers.resize (indices_->size ());\n\n \/\/ Iterate through the 3d points and calculate the distances from them to the plane\n for (size_t i = 0; i < indices_->size (); ++i)\n {\n \/\/ Calculate the distance from the point to the plane normal as the dot product\n \/\/ D = (P-A).N\/|N|\n Eigen::Vector4f pt (input_->points[(*indices_)[i]].x,\n input_->points[(*indices_)[i]].y,\n input_->points[(*indices_)[i]].z,\n 1);\n if (fabs (model_coefficients.dot (pt)) < threshold)\n {\n \/\/ Returns the indices of the points whose distances are smaller than the threshold\n inliers[nr_p] = (*indices_)[i];\n nr_p++;\n }\n }\n inliers.resize (nr_p);\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\ntemplate <typename PointT> void\npcl::SampleConsensusModelPlane<PointT>::optimizeModelCoefficients (\n const std::vector<int> &inliers, const Eigen::VectorXf &model_coefficients, Eigen::VectorXf &optimized_coefficients)\n{\n \/\/ Needs a valid set of model coefficients\n if (model_coefficients.size () != 4)\n {\n PCL_ERROR (\"[pcl::SampleConsensusModelPlane::optimizeModelCoefficients] Invalid number of model coefficients given (%lu)!\\n\", (unsigned long)model_coefficients.size ());\n optimized_coefficients = model_coefficients;\n return;\n }\n\n \/\/ Need at least 3 points to estimate a plane\n if (inliers.size () < 4)\n {\n PCL_ERROR (\"[pcl::SampleConsensusModelPlane::optimizeModelCoefficients] Not enough inliers found to support a model (%lu)! Returning the same coefficients.\\n\", (unsigned long)inliers.size ());\n optimized_coefficients = model_coefficients;\n return;\n }\n\n Eigen::Vector4f plane_parameters;\n\n \/\/ Use Least-Squares to fit the plane through all the given sample points and find out its coefficients\n EIGEN_ALIGN16 Eigen::Matrix3f covariance_matrix;\n Eigen::Vector4f xyz_centroid;\n\n \/\/ Estimate the XYZ centroid\n compute3DCentroid (*input_, inliers, xyz_centroid);\n xyz_centroid[3] = 0;\n\n \/\/ Compute the 3x3 covariance matrix\n computeCovarianceMatrix (*input_, inliers, xyz_centroid, covariance_matrix);\n\n \/\/ Compute the model coefficients\n EIGEN_ALIGN16 Eigen::Vector3f eigen_values;\n EIGEN_ALIGN16 Eigen::Matrix3f eigen_vectors;\n pcl::eigen33 (covariance_matrix, eigen_vectors, eigen_values);\n\n \/\/ Hessian form (D = nc . p_plane (centroid here) + p)\n optimized_coefficients.resize (4);\n optimized_coefficients[0] = eigen_vectors (0, 0);\n optimized_coefficients[1] = eigen_vectors (1, 0);\n optimized_coefficients[2] = eigen_vectors (2, 0);\n optimized_coefficients[3] = 0;\n optimized_coefficients[3] = -1 * optimized_coefficients.dot (xyz_centroid);\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\ntemplate <typename PointT> void\npcl::SampleConsensusModelPlane<PointT>::projectPoints (\n const std::vector<int> &inliers, const Eigen::VectorXf &model_coefficients, PointCloud &projected_points, bool copy_data_fields)\n{\n \/\/ Needs a valid set of model coefficients\n if (model_coefficients.size () != 4)\n {\n PCL_ERROR (\"[pcl::SampleConsensusModelPlane::projectPoints] Invalid number of model coefficients given (%lu)!\\n\", (unsigned long)model_coefficients.size ());\n return;\n }\n\n projected_points.header = input_->header;\n projected_points.is_dense = input_->is_dense;\n\n Eigen::Vector4f mc (model_coefficients[0], model_coefficients[1], model_coefficients[2], 0);\n\n \/\/ normalize the vector perpendicular to the plane...\n mc.normalize ();\n \/\/ ... and store the resulting normal as a local copy of the model coefficients\n Eigen::Vector4f tmp_mc = model_coefficients;\n tmp_mc[0] = mc[0];\n tmp_mc[1] = mc[1];\n tmp_mc[2] = mc[2];\n\n \/\/ Copy all the data fields from the input cloud to the projected one?\n if (copy_data_fields)\n {\n \/\/ Allocate enough space and copy the basics\n projected_points.points.resize (input_->points.size ());\n projected_points.width = input_->width;\n projected_points.height = input_->height;\n\n typedef typename pcl::traits::fieldList<PointT>::type FieldList;\n \/\/ Iterate over each point\n for (size_t i = 0; i < input_->points.size (); ++i)\n \/\/ Iterate over each dimension\n pcl::for_each_type <FieldList> (NdConcatenateFunctor <PointT, PointT> (input_->points[i], projected_points.points[i]));\n\n \/\/ Iterate through the 3d points and calculate the distances from them to the plane\n for (size_t i = 0; i < inliers.size (); ++i)\n {\n \/\/ Calculate the distance from the point to the plane\n Eigen::Vector4f p (input_->points[inliers[i]].x,\n input_->points[inliers[i]].y,\n input_->points[inliers[i]].z,\n 1);\n \/\/ use normalized coefficients to calculate the scalar projection \n float distance_to_plane = tmp_mc.dot (p);\n\n pcl::Vector4fMap pp = projected_points.points[inliers[i]].getVector4fMap ();\n pp = p - mc * distance_to_plane; \/\/ mc[3] = 0, therefore the 3rd coordinate is safe\n }\n }\n else\n {\n \/\/ Allocate enough space and copy the basics\n projected_points.points.resize (inliers.size ());\n projected_points.width = inliers.size ();\n projected_points.height = 1;\n\n typedef typename pcl::traits::fieldList<PointT>::type FieldList;\n \/\/ Iterate over each point\n for (size_t i = 0; i < inliers.size (); ++i)\n \/\/ Iterate over each dimension\n pcl::for_each_type <FieldList> (NdConcatenateFunctor <PointT, PointT> (input_->points[inliers[i]], projected_points.points[i]));\n\n \/\/ Iterate through the 3d points and calculate the distances from them to the plane\n for (size_t i = 0; i < inliers.size (); ++i)\n {\n \/\/ Calculate the distance from the point to the plane\n Eigen::Vector4f p (input_->points[inliers[i]].x,\n input_->points[inliers[i]].y,\n input_->points[inliers[i]].z,\n 1);\n \/\/ use normalized coefficients to calculate the scalar projection \n float distance_to_plane = tmp_mc.dot (p);\n\n pcl::Vector4fMap pp = projected_points.points[i].getVector4fMap ();\n pp = p - mc * distance_to_plane; \/\/ mc[3] = 0, therefore the 3rd coordinate is safe\n }\n }\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\ntemplate <typename PointT> bool\npcl::SampleConsensusModelPlane<PointT>::doSamplesVerifyModel (\n const std::set<int> &indices, const Eigen::VectorXf &model_coefficients, double threshold)\n{\n \/\/ Needs a valid set of model coefficients\n if (model_coefficients.size () != 4)\n {\n PCL_ERROR (\"[pcl::SampleConsensusModelPlane::doSamplesVerifyModel] Invalid number of model coefficients given (%lu)!\\n\", (unsigned long)model_coefficients.size ());\n return (false);\n }\n\n for (std::set<int>::const_iterator it = indices.begin (); it != indices.end (); ++it)\n {\n Eigen::Vector4f pt (input_->points[*it].x,\n input_->points[*it].y,\n input_->points[*it].z,\n 1);\n if (fabs (model_coefficients.dot (pt)) > threshold)\n return (false);\n }\n\n return (true);\n}\n\n#define PCL_INSTANTIATE_SampleConsensusModelPlane(T) template class PCL_EXPORTS pcl::SampleConsensusModelPlane<T>;\n\n#endif \/\/ PCL_SAMPLE_CONSENSUS_IMPL_SAC_MODEL_PLANE_H_\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#include <smsclnt.h>\n#include <smuthdr.h> \/\/ CSmsHeader\n#include <rsendas.h>\n#include <rsendasmessage.h>\n#include <f32file.h>\n#include <mmsconst.h>\n#include <utf.h> \/\/ CnvUtfConverter\n\n#include \"qmessageservice.h\"\n#include \"qmessageservice_symbian_p.h\"\n#include \"qmtmengine_symbian_p.h\"\n#include \"qmessage_symbian_p.h\"\n\n\nQTM_BEGIN_NAMESPACE\n\nQMessageServicePrivate::QMessageServicePrivate(QMessageService* parent)\n : q_ptr(parent),\n _state(QMessageService::InactiveState),\n _active(false)\n{\n}\n \nQMessageServicePrivate::~QMessageServicePrivate()\n{\n}\n\nbool QMessageServicePrivate::sendSMS(QMessage &message)\n{\n return CMTMEngine::instance()->sendSMS(message);\n}\n\nbool QMessageServicePrivate::sendMMS(QMessage &message)\n{\n return CMTMEngine::instance()->sendMMS(message);\n}\n\nbool QMessageServicePrivate::sendEmail(QMessage &message)\n{\n return CMTMEngine::instance()->sendEmail(message);\n}\n\nbool QMessageServicePrivate::show(const QMessageId& id)\n{\n\treturn CMTMEngine::instance()->showMessage(id);\n}\n\nbool QMessageServicePrivate::compose(const QMessage &message)\n{\n\treturn CMTMEngine::instance()->composeMessage(message);\n}\n\nbool QMessageServicePrivate::queryMessages(const QMessageFilter &filter, const QMessageSortOrder &sortOrder, uint limit, uint offset) const\n{\n return CMTMEngine::instance()->queryMessages((QMessageServicePrivate&)*this, filter, sortOrder, limit, offset);\n}\n\nbool QMessageServicePrivate::queryMessages(const QMessageFilter &filter, const QString &body, QMessageDataComparator::MatchFlags matchFlags, const QMessageSortOrder &sortOrder, uint limit, uint offset) const\n{\n return CMTMEngine::instance()->queryMessages((QMessageServicePrivate&)*this, filter, body, matchFlags, sortOrder, limit, offset);\n}\n\nbool QMessageServicePrivate::countMessages(const QMessageFilter &filter)\n{\n return CMTMEngine::instance()->countMessages((QMessageServicePrivate&)*this, filter);\n}\n\nbool QMessageServicePrivate::retrieve(const QMessageId &messageId, const QMessageContentContainerId &id)\n{\n\treturn CMTMEngine::instance()->retrieve(messageId, id);\n}\n\nbool QMessageServicePrivate::retrieveBody(const QMessageId& id)\n{\n\treturn CMTMEngine::instance()->retrieveBody(id);\n}\n\nbool QMessageServicePrivate::retrieveHeader(const QMessageId& id)\n{\n\treturn CMTMEngine::instance()->retrieveHeader(id);\n}\n\nbool QMessageServicePrivate::exportUpdates(const QMessageAccountId &id)\n{\n return CMTMEngine::instance()->exportUpdates(id);\n}\n\nvoid QMessageServicePrivate::setFinished(bool successful)\n{\n if (!successful && (_error == QMessageManager::NoError)) {\n \/\/ We must report an error of some sort\n _error = QMessageManager::RequestIncomplete;\n }\n\n _state = QMessageService::FinishedState;\n emit q_ptr->stateChanged(_state);\n _active = false;\n}\n\nQMessageService::QMessageService(QObject *parent)\n : QObject(parent),\n d_ptr(new QMessageServicePrivate(this))\n{\n\tconnect(d_ptr, SIGNAL(stateChanged(QMessageService::State)), this, SIGNAL(stateChanged(QMessageService::State)));\n\tconnect(d_ptr, SIGNAL(messagesFound(const QMessageIdList&)), this, SIGNAL(messagesFound(const QMessageIdList&)));\n connect(d_ptr, SIGNAL(messagesCounted(int)), this, SIGNAL(messagesCounted(int)));\n\tconnect(d_ptr, SIGNAL(progressChanged(uint, uint)), this, SIGNAL(progressChanged(uint, uint)));\n}\n\nQMessageService::~QMessageService()\n{\n}\n\nbool QMessageService::queryMessages(const QMessageFilter &filter, const QMessageSortOrder &sortOrder, uint limit, uint offset)\n{\n if (d_ptr->_active) {\n return false;\n }\n \n d_ptr->_active = true;\n d_ptr->_error = QMessageManager::NoError;\n \n if (d_ptr->queryMessages(filter, sortOrder, limit, offset)) {\n d_ptr->_state = QMessageService::ActiveState;\n emit stateChanged(d_ptr->_state);\n } else {\n d_ptr->setFinished(false);\n }\n \n return d_ptr->_active;\n}\n\nbool QMessageService::queryMessages(const QMessageFilter &filter, const QString &body, QMessageDataComparator::MatchFlags matchFlags, const QMessageSortOrder &sortOrder, uint limit, uint offset)\n{\n if (d_ptr->_active) {\n return false;\n }\n\n d_ptr->_active = true;\n d_ptr->_error = QMessageManager::NoError;\n\n if (d_ptr->queryMessages(filter, body, matchFlags, sortOrder, limit, offset)) {\n d_ptr->_state = QMessageService::ActiveState;\n emit stateChanged(d_ptr->_state);\n } else {\n d_ptr->setFinished(false);\n }\n\n return d_ptr->_active;\n}\n\nbool QMessageService::countMessages(const QMessageFilter &filter)\n{\n if (d_ptr->_active) {\n return false;\n }\n \n d_ptr->_active = true;\n d_ptr->_error = QMessageManager::NoError;\n \n if (d_ptr->countMessages(filter)) {\n d_ptr->_state = QMessageService::ActiveState;\n emit stateChanged(d_ptr->_state);\n } else {\n d_ptr->setFinished(false);\n }\n \n return d_ptr->_active;\n}\n\nbool QMessageService::send(QMessage &message)\n{\n\tif (d_ptr->_active) {\n\t\treturn false;\n\t}\n\t\n\td_ptr->_active = true;\n\td_ptr->_error = QMessageManager::NoError;\n\t\n bool retVal = true;\t\n \n d_ptr->_state = QMessageService::ActiveState;\n emit stateChanged(d_ptr->_state);\n \n \/\/ Check message type\n if(message.type() == QMessage::AnyType || message.type() == QMessage::NoType) {\n d_ptr->_error = QMessageManager::ConstraintFailure;\n retVal = false;\n }\n\n QMessageAccountId accountId = message.parentAccountId();\n if (retVal) {\n \/\/ Check account\n if (!accountId.isValid()) {\n accountId = QMessageAccount::defaultAccount(message.type());\n if (!accountId.isValid()) {\n d_ptr->_error = QMessageManager::InvalidId;\n retVal = false;\n }\n }\n }\n\n QMessageAccount account(accountId);\n if (retVal) {\n \/\/ Check account\/message type compatibility\n if (!(account.messageTypes() & message.type())) {\n d_ptr->_error = QMessageManager::ConstraintFailure;\n retVal = false;\n }\n }\n \n if (retVal) {\n \/\/ Check recipients\n QMessageAddressList recipients = message.to() + message.bcc() + message.cc();\n if (recipients.isEmpty()) {\n d_ptr->_error = QMessageManager::ConstraintFailure;\n return false;\n }\n }\n \n QMessage outgoing(message);\n\n \/\/ Set default account if unset\n if (!outgoing.parentAccountId().isValid()) {\n outgoing.setParentAccountId(accountId);\n }\n \n if (retVal) {\n if (account.messageTypes() & QMessage::Sms) {\n retVal = d_ptr->sendSMS(outgoing);\n } else if (account.messageTypes() & QMessage::Mms) {\n retVal = d_ptr->sendMMS(outgoing);\n } else if (account.messageTypes() & QMessage::Email) {\n retVal = d_ptr->sendEmail(outgoing);\n }\n }\n \n d_ptr->setFinished(retVal);\n return retVal;\n}\n\nbool QMessageService::compose(const QMessage &message)\n{\n\tif (d_ptr->_active) {\n\t\treturn false;\n\t}\n\t\n\td_ptr->_active = true;\n\td_ptr->_error = QMessageManager::NoError;\n\t\n\tbool retVal = true;\n\td_ptr->_state = QMessageService::ActiveState;\n\temit stateChanged(d_ptr->_state);\n\t\n\tretVal = d_ptr->compose(message);\n\t\n d_ptr->setFinished(retVal);\n return retVal;\n}\n\nbool QMessageService::retrieveHeader(const QMessageId& id)\n{\n\tif (d_ptr->_active) {\n\t\treturn false;\n\t}\n\t\n if (!id.isValid()) {\n d_ptr->_error = QMessageManager::InvalidId;\n return false;\n }\n \n\td_ptr->_active = true;\n\td_ptr->_error = QMessageManager::NoError;\n\t\n\tbool retVal = true;\n\td_ptr->_state = QMessageService::ActiveState;\n\temit stateChanged(d_ptr->_state);\n\n\tretVal = d_ptr->retrieveHeader(id);\n\t\n d_ptr->setFinished(retVal);\n return retVal;\n}\n\nbool QMessageService::retrieveBody(const QMessageId& id)\n{\n\tif (d_ptr->_active) {\n\t\treturn false;\n\t}\n\t\n if (!id.isValid()) {\n d_ptr->_error = QMessageManager::InvalidId;\n return false;\n }\n \n\td_ptr->_active = true;\n\td_ptr->_error = QMessageManager::NoError;\n\t\n\tbool retVal = true;\n\td_ptr->_state = QMessageService::ActiveState;\n\temit stateChanged(d_ptr->_state);\n\n\tretVal = d_ptr->retrieveBody(id);\n\t\n d_ptr->setFinished(retVal);\n return retVal;\n}\n\nbool QMessageService::retrieve(const QMessageId &messageId, const QMessageContentContainerId& id)\n{\n\tif (d_ptr->_active) {\n\t\treturn false;\n\t}\n\t\n if (!messageId.isValid() || !id.isValid()) {\n d_ptr->_error = QMessageManager::InvalidId;\n return false;\n }\n \n\td_ptr->_active = true;\n\td_ptr->_error = QMessageManager::NoError;\n\n\tbool retVal = true;\n\td_ptr->_state = QMessageService::ActiveState;\n\temit stateChanged(d_ptr->_state);\n\n\tretVal = d_ptr->retrieve(messageId, id);\n\t\n d_ptr->setFinished(retVal);\n return retVal;\n}\n\nbool QMessageService::show(const QMessageId& id)\n{\n\tif (d_ptr->_active) {\n\t\treturn false;\n\t}\n\t\n if (!id.isValid()) {\n d_ptr->_error = QMessageManager::InvalidId;\n return false;\n }\n \n\td_ptr->_active = true;\n\td_ptr->_error = QMessageManager::NoError;\n\t\n\tbool retVal = true;\n\td_ptr->_state = QMessageService::ActiveState;\n\temit stateChanged(d_ptr->_state);\n\n retVal = d_ptr->show(id);\n \n d_ptr->setFinished(retVal);\n return retVal;\n}\n\nbool QMessageService::exportUpdates(const QMessageAccountId &id)\n{\n if (d_ptr->_active) {\n return false;\n }\n \n if (!id.isValid()) {\n d_ptr->_error = QMessageManager::InvalidId;\n return false;\n }\n \n d_ptr->_active = true;\n d_ptr->_error = QMessageManager::NoError;\n \n bool retVal = true;\n d_ptr->_state = QMessageService::ActiveState;\n emit stateChanged(d_ptr->_state);\n \n retVal = d_ptr->exportUpdates(id);\n \n d_ptr->setFinished(retVal);\n return retVal;\n}\n\nQMessageService::State QMessageService::state() const\n{\n\treturn d_ptr->_state;\n}\n\nvoid QMessageService::cancel()\n{\n}\n\nQMessageManager::Error QMessageService::error() const\n{\n return d_ptr->_error;\n}\n\n#include \"moc_qmessageservice_symbian_p.cpp\"\nQTM_END_NAMESPACE\n<commit_msg>Fixed message type recognition from parentAccount when message is send<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#include <smsclnt.h>\n#include <smuthdr.h> \/\/ CSmsHeader\n#include <rsendas.h>\n#include <rsendasmessage.h>\n#include <f32file.h>\n#include <mmsconst.h>\n#include <utf.h> \/\/ CnvUtfConverter\n\n#include \"qmessageservice.h\"\n#include \"qmessageservice_symbian_p.h\"\n#include \"qmtmengine_symbian_p.h\"\n#include \"qmessage_symbian_p.h\"\n\n\nQTM_BEGIN_NAMESPACE\n\nQMessageServicePrivate::QMessageServicePrivate(QMessageService* parent)\n : q_ptr(parent),\n _state(QMessageService::InactiveState),\n _active(false)\n{\n}\n \nQMessageServicePrivate::~QMessageServicePrivate()\n{\n}\n\nbool QMessageServicePrivate::sendSMS(QMessage &message)\n{\n return CMTMEngine::instance()->sendSMS(message);\n}\n\nbool QMessageServicePrivate::sendMMS(QMessage &message)\n{\n return CMTMEngine::instance()->sendMMS(message);\n}\n\nbool QMessageServicePrivate::sendEmail(QMessage &message)\n{\n return CMTMEngine::instance()->sendEmail(message);\n}\n\nbool QMessageServicePrivate::show(const QMessageId& id)\n{\n\treturn CMTMEngine::instance()->showMessage(id);\n}\n\nbool QMessageServicePrivate::compose(const QMessage &message)\n{\n\treturn CMTMEngine::instance()->composeMessage(message);\n}\n\nbool QMessageServicePrivate::queryMessages(const QMessageFilter &filter, const QMessageSortOrder &sortOrder, uint limit, uint offset) const\n{\n return CMTMEngine::instance()->queryMessages((QMessageServicePrivate&)*this, filter, sortOrder, limit, offset);\n}\n\nbool QMessageServicePrivate::queryMessages(const QMessageFilter &filter, const QString &body, QMessageDataComparator::MatchFlags matchFlags, const QMessageSortOrder &sortOrder, uint limit, uint offset) const\n{\n return CMTMEngine::instance()->queryMessages((QMessageServicePrivate&)*this, filter, body, matchFlags, sortOrder, limit, offset);\n}\n\nbool QMessageServicePrivate::countMessages(const QMessageFilter &filter)\n{\n return CMTMEngine::instance()->countMessages((QMessageServicePrivate&)*this, filter);\n}\n\nbool QMessageServicePrivate::retrieve(const QMessageId &messageId, const QMessageContentContainerId &id)\n{\n\treturn CMTMEngine::instance()->retrieve(messageId, id);\n}\n\nbool QMessageServicePrivate::retrieveBody(const QMessageId& id)\n{\n\treturn CMTMEngine::instance()->retrieveBody(id);\n}\n\nbool QMessageServicePrivate::retrieveHeader(const QMessageId& id)\n{\n\treturn CMTMEngine::instance()->retrieveHeader(id);\n}\n\nbool QMessageServicePrivate::exportUpdates(const QMessageAccountId &id)\n{\n return CMTMEngine::instance()->exportUpdates(id);\n}\n\nvoid QMessageServicePrivate::setFinished(bool successful)\n{\n if (!successful && (_error == QMessageManager::NoError)) {\n \/\/ We must report an error of some sort\n _error = QMessageManager::RequestIncomplete;\n }\n\n _state = QMessageService::FinishedState;\n emit q_ptr->stateChanged(_state);\n _active = false;\n}\n\nQMessageService::QMessageService(QObject *parent)\n : QObject(parent),\n d_ptr(new QMessageServicePrivate(this))\n{\n\tconnect(d_ptr, SIGNAL(stateChanged(QMessageService::State)), this, SIGNAL(stateChanged(QMessageService::State)));\n\tconnect(d_ptr, SIGNAL(messagesFound(const QMessageIdList&)), this, SIGNAL(messagesFound(const QMessageIdList&)));\n connect(d_ptr, SIGNAL(messagesCounted(int)), this, SIGNAL(messagesCounted(int)));\n\tconnect(d_ptr, SIGNAL(progressChanged(uint, uint)), this, SIGNAL(progressChanged(uint, uint)));\n}\n\nQMessageService::~QMessageService()\n{\n}\n\nbool QMessageService::queryMessages(const QMessageFilter &filter, const QMessageSortOrder &sortOrder, uint limit, uint offset)\n{\n if (d_ptr->_active) {\n return false;\n }\n \n d_ptr->_active = true;\n d_ptr->_error = QMessageManager::NoError;\n \n if (d_ptr->queryMessages(filter, sortOrder, limit, offset)) {\n d_ptr->_state = QMessageService::ActiveState;\n emit stateChanged(d_ptr->_state);\n } else {\n d_ptr->setFinished(false);\n }\n \n return d_ptr->_active;\n}\n\nbool QMessageService::queryMessages(const QMessageFilter &filter, const QString &body, QMessageDataComparator::MatchFlags matchFlags, const QMessageSortOrder &sortOrder, uint limit, uint offset)\n{\n if (d_ptr->_active) {\n return false;\n }\n\n d_ptr->_active = true;\n d_ptr->_error = QMessageManager::NoError;\n\n if (d_ptr->queryMessages(filter, body, matchFlags, sortOrder, limit, offset)) {\n d_ptr->_state = QMessageService::ActiveState;\n emit stateChanged(d_ptr->_state);\n } else {\n d_ptr->setFinished(false);\n }\n\n return d_ptr->_active;\n}\n\nbool QMessageService::countMessages(const QMessageFilter &filter)\n{\n if (d_ptr->_active) {\n return false;\n }\n \n d_ptr->_active = true;\n d_ptr->_error = QMessageManager::NoError;\n \n if (d_ptr->countMessages(filter)) {\n d_ptr->_state = QMessageService::ActiveState;\n emit stateChanged(d_ptr->_state);\n } else {\n d_ptr->setFinished(false);\n }\n \n return d_ptr->_active;\n}\n\nbool QMessageService::send(QMessage &message)\n{\n\tif (d_ptr->_active) {\n\t\treturn false;\n\t}\n\t\n\td_ptr->_active = true;\n\td_ptr->_error = QMessageManager::NoError;\n\t\n bool retVal = true;\t\n \n d_ptr->_state = QMessageService::ActiveState;\n emit stateChanged(d_ptr->_state);\n \n QMessageAccountId accountId = message.parentAccountId();\n QMessage::Type msgType = QMessage::NoType;\n\n \/\/ Check message type\n if (message.type() == QMessage::AnyType || message.type() == QMessage::NoType) {\n QMessage::TypeFlags types = QMessage::NoType;\n if (accountId.isValid()) {\n \/\/ ParentAccountId was defined => Message type can be read\n \/\/ from parent account\n QMessageAccount account = QMessageAccount(accountId);\n QMessage::TypeFlags types = account.messageTypes();\n if (types & QMessage::Sms) {\n msgType = QMessage::Sms;\n } else if (types & QMessage::Mms) {\n msgType = QMessage::Mms;\n } else if (types & QMessage::Email) {\n msgType = QMessage::Email;\n }\n }\n if (msgType == QMessage::NoType) {\n d_ptr->_error = QMessageManager::ConstraintFailure;\n retVal = false;\n }\n }\n\n if (retVal) {\n \/\/ Check account\n if (!accountId.isValid()) {\n accountId = QMessageAccount::defaultAccount(message.type());\n if (!accountId.isValid()) {\n d_ptr->_error = QMessageManager::InvalidId;\n retVal = false;\n }\n }\n }\n\n QMessageAccount account(accountId);\n if (retVal) {\n \/\/ Check account\/message type compatibility\n if (!(account.messageTypes() & message.type()) && (msgType == QMessage::NoType)) {\n d_ptr->_error = QMessageManager::ConstraintFailure;\n retVal = false;\n }\n }\n \n if (retVal) {\n \/\/ Check recipients\n QMessageAddressList recipients = message.to() + message.bcc() + message.cc();\n if (recipients.isEmpty()) {\n d_ptr->_error = QMessageManager::ConstraintFailure;\n return false;\n }\n }\n \n if (retVal) {\n QMessage outgoing(message);\n \n \/\/ Set default account if unset\n if (!outgoing.parentAccountId().isValid()) {\n outgoing.setParentAccountId(accountId);\n }\n \n if (outgoing.type() == QMessage::AnyType || outgoing.type() == QMessage::NoType) {\n outgoing.setType(msgType);\n }\n\n if (account.messageTypes() & QMessage::Sms) {\n retVal = d_ptr->sendSMS(outgoing);\n } else if (account.messageTypes() & QMessage::Mms) {\n retVal = d_ptr->sendMMS(outgoing);\n } else if (account.messageTypes() & QMessage::Email) {\n retVal = d_ptr->sendEmail(outgoing);\n }\n }\n \n d_ptr->setFinished(retVal);\n return retVal;\n}\n\nbool QMessageService::compose(const QMessage &message)\n{\n\tif (d_ptr->_active) {\n\t\treturn false;\n\t}\n\t\n\td_ptr->_active = true;\n\td_ptr->_error = QMessageManager::NoError;\n\t\n\tbool retVal = true;\n\td_ptr->_state = QMessageService::ActiveState;\n\temit stateChanged(d_ptr->_state);\n\t\n\tretVal = d_ptr->compose(message);\n\t\n d_ptr->setFinished(retVal);\n return retVal;\n}\n\nbool QMessageService::retrieveHeader(const QMessageId& id)\n{\n\tif (d_ptr->_active) {\n\t\treturn false;\n\t}\n\t\n if (!id.isValid()) {\n d_ptr->_error = QMessageManager::InvalidId;\n return false;\n }\n \n\td_ptr->_active = true;\n\td_ptr->_error = QMessageManager::NoError;\n\t\n\tbool retVal = true;\n\td_ptr->_state = QMessageService::ActiveState;\n\temit stateChanged(d_ptr->_state);\n\n\tretVal = d_ptr->retrieveHeader(id);\n\t\n d_ptr->setFinished(retVal);\n return retVal;\n}\n\nbool QMessageService::retrieveBody(const QMessageId& id)\n{\n\tif (d_ptr->_active) {\n\t\treturn false;\n\t}\n\t\n if (!id.isValid()) {\n d_ptr->_error = QMessageManager::InvalidId;\n return false;\n }\n \n\td_ptr->_active = true;\n\td_ptr->_error = QMessageManager::NoError;\n\t\n\tbool retVal = true;\n\td_ptr->_state = QMessageService::ActiveState;\n\temit stateChanged(d_ptr->_state);\n\n\tretVal = d_ptr->retrieveBody(id);\n\t\n d_ptr->setFinished(retVal);\n return retVal;\n}\n\nbool QMessageService::retrieve(const QMessageId &messageId, const QMessageContentContainerId& id)\n{\n\tif (d_ptr->_active) {\n\t\treturn false;\n\t}\n\t\n if (!messageId.isValid() || !id.isValid()) {\n d_ptr->_error = QMessageManager::InvalidId;\n return false;\n }\n \n\td_ptr->_active = true;\n\td_ptr->_error = QMessageManager::NoError;\n\n\tbool retVal = true;\n\td_ptr->_state = QMessageService::ActiveState;\n\temit stateChanged(d_ptr->_state);\n\n\tretVal = d_ptr->retrieve(messageId, id);\n\t\n d_ptr->setFinished(retVal);\n return retVal;\n}\n\nbool QMessageService::show(const QMessageId& id)\n{\n\tif (d_ptr->_active) {\n\t\treturn false;\n\t}\n\t\n if (!id.isValid()) {\n d_ptr->_error = QMessageManager::InvalidId;\n return false;\n }\n \n\td_ptr->_active = true;\n\td_ptr->_error = QMessageManager::NoError;\n\t\n\tbool retVal = true;\n\td_ptr->_state = QMessageService::ActiveState;\n\temit stateChanged(d_ptr->_state);\n\n retVal = d_ptr->show(id);\n \n d_ptr->setFinished(retVal);\n return retVal;\n}\n\nbool QMessageService::exportUpdates(const QMessageAccountId &id)\n{\n if (d_ptr->_active) {\n return false;\n }\n \n if (!id.isValid()) {\n d_ptr->_error = QMessageManager::InvalidId;\n return false;\n }\n \n d_ptr->_active = true;\n d_ptr->_error = QMessageManager::NoError;\n \n bool retVal = true;\n d_ptr->_state = QMessageService::ActiveState;\n emit stateChanged(d_ptr->_state);\n \n retVal = d_ptr->exportUpdates(id);\n \n d_ptr->setFinished(retVal);\n return retVal;\n}\n\nQMessageService::State QMessageService::state() const\n{\n\treturn d_ptr->_state;\n}\n\nvoid QMessageService::cancel()\n{\n}\n\nQMessageManager::Error QMessageService::error() const\n{\n return d_ptr->_error;\n}\n\n#include \"moc_qmessageservice_symbian_p.cpp\"\nQTM_END_NAMESPACE\n<|endoftext|>"} {"text":"<commit_before>#include \"State.h\"\r\n#include <iomanip>\r\n#include <ostream>\r\nusing namespace nspace;\r\nusing namespace std;\r\n\r\n\r\nnamespace nspace{\r\nstd::ostream& operator<<(std::ostream & out, const State & state){\r\n \r\n int width = 16;\r\n out << std::setw(20)<<\"index\\\\derivative\";\r\n out << \"||\";\r\n for(int i=0;i < state.derivatives(); i++){\r\n out << std::setw(width)<<i;\r\n out << \"|\";\r\n }\r\n out <<endl;\r\n out << setw((width+1)* state.derivatives() + 22)<< setfill('-')<< \"-\";\r\n out << setfill(' ')<<endl;\r\n for(int i=0; i < state.dimension(); i++){\r\n out << std::setw(20)<<i;\r\n out << \"||\";\r\n for(int d=0; d < state.derivatives(); d++){\r\n out << std::setw(width) << std::setprecision(5) << state(i,d);\r\n out <<\"|\";\r\n }\r\n out << std::endl;\r\n }\r\n return out;\r\n}\r\n\r\n}\r\n\r\nState::State(uint offset, uint dimension, uint derivatives, State & parent):_parent(&parent),_offset(offset),_derivatives(derivatives),_stateMatrix(parent._stateMatrix),_dimension(dimension){ }\r\n\r\nState::State():_parent(0),_derivatives(0),_offset(0),_dimension(0),_stateMatrix(0){ }<commit_msg>int -> uint<commit_after>#include \"State.h\"\r\n#include <iomanip>\r\n#include <ostream>\r\nusing namespace nspace;\r\nusing namespace std;\r\n\r\n\r\nnamespace nspace{\r\nstd::ostream& operator<<(std::ostream & out, const State & state){\r\n \r\n int width = 16;\r\n out << std::setw(20)<<\"index\\\\derivative\";\r\n out << \"||\";\r\n for(int i=0;i < state.derivatives(); i++){\r\n out << std::setw(width)<<i;\r\n out << \"|\";\r\n }\r\n out <<endl;\r\n out << setw((width+1)* state.derivatives() + 22)<< setfill('-')<< \"-\";\r\n out << setfill(' ')<<endl;\r\n for(uint i=0; i < state.dimension(); i++){\r\n out << std::setw(20)<<i;\r\n out << \"||\";\r\n for(uint d=0; d < state.derivatives(); d++){\r\n out << std::setw(width) << std::setprecision(5) << state(i,d);\r\n out <<\"|\";\r\n }\r\n out << std::endl;\r\n }\r\n return out;\r\n}\r\n\r\n}\r\n\r\nState::State(uint offset, uint dimension, uint derivatives, State & parent):_parent(&parent),_offset(offset),_derivatives(derivatives),_stateMatrix(parent._stateMatrix),_dimension(dimension){ }\r\n\r\nState::State():_parent(0),_derivatives(0),_offset(0),_dimension(0),_stateMatrix(0){ }<|endoftext|>"} {"text":"<commit_before>\/\/\/\n\/\/\/ @file ParallelPrimeSieve.cpp\n\/\/\/ @brief ParallelPrimeSieve sieves primes in parallel using\n\/\/\/ OpenMP 2.0 (2002) or later.\n\/\/\/\n\/\/\/ Copyright (C) 2013 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\/soe\/config.h>\n#include <primesieve\/soe\/ParallelPrimeSieve.h>\n#include <primesieve\/soe\/PrimeSieve.h>\n#include <primesieve\/soe\/imath.h>\n\n#include <stdint.h>\n#include <cstdlib>\n#include <cassert>\n#include <algorithm>\n\n#ifdef _OPENMP\n #include <omp.h>\n #include <primesieve\/soe\/ParallelPrimeSieve-lock.h>\n#endif\n\nusing namespace soe;\n\nParallelPrimeSieve::ParallelPrimeSieve() :\n numThreads_(DEFAULT_NUM_THREADS),\n shm_(NULL)\n{ }\n\nvoid ParallelPrimeSieve::init(SharedMemory& shm)\n{\n setStart(shm.start);\n setStop(shm.stop);\n setSieveSize(shm.sieveSize);\n setFlags(shm.flags);\n setNumThreads(shm.threads);\n shm_ = &shm;\n}\n\nint ParallelPrimeSieve::getNumThreads() const\n{\n if (numThreads_ == DEFAULT_NUM_THREADS) {\n \/\/ Use 1 thread to generate primes in arithmetic order\n return (isPrint() || isGenerate()) ? 1 : idealNumThreads();\n }\n return numThreads_;\n}\n\nvoid ParallelPrimeSieve::setNumThreads(int threads)\n{\n numThreads_ = getInBetween(1, threads, getMaxThreads());\n}\n\n\/\/\/ Get an ideal number of threads for the current\n\/\/\/ set start_ and stop_ numbers.\n\/\/\/\nint ParallelPrimeSieve::idealNumThreads() const\n{\n if (start_ > stop_)\n return 1;\n uint64_t threshold = std::max(config::MIN_THREAD_INTERVAL, isqrt(stop_) \/ 5);\n uint64_t threads = getInterval() \/ threshold;\n threads = getInBetween<uint64_t>(1, threads, getMaxThreads());\n return static_cast<int>(threads);\n}\n\n\/\/\/ Get an interval size that ensures a good load balance\n\/\/\/ when multiple threads are used.\n\/\/\/\nuint64_t ParallelPrimeSieve::getThreadInterval(int threads) const\n{\n assert(threads > 0);\n uint64_t unbalanced = getInterval() \/ threads;\n uint64_t balanced = isqrt(stop_) * 1000;\n uint64_t fastest = std::min(balanced, unbalanced);\n uint64_t threadInterval = getInBetween(config::MIN_THREAD_INTERVAL, fastest, config::MAX_THREAD_INTERVAL);\n uint64_t chunks = getInterval() \/ threadInterval;\n if (chunks < threads * 5u)\n threadInterval = std::max(config::MIN_THREAD_INTERVAL, unbalanced);\n threadInterval += 30 - threadInterval % 30;\n return threadInterval;\n}\n\n\/\/\/ Align n to modulo 30 + 2 to prevent prime k-tuplet\n\/\/\/ (twin primes, prime triplets, ...) gaps.\n\/\/\/\nuint64_t ParallelPrimeSieve::align(uint64_t n) const\n{\n if (n == start_)\n return start_;\n n = std::min(n + 32 - n % 30, stop_);\n return n;\n}\n\nbool ParallelPrimeSieve::tooMany(int threads) const\n{\n return (threads > 1 && getInterval() \/ threads < config::MIN_THREAD_INTERVAL);\n}\n\n#ifdef _OPENMP\n\nint ParallelPrimeSieve::getMaxThreads()\n{\n return omp_get_max_threads();\n}\n\ndouble ParallelPrimeSieve::getWallTime() const\n{\n return omp_get_wtime();\n}\n\n\/\/\/ Sieve the primes and prime k-tuplets within [start_, stop_]\n\/\/\/ in parallel using OpenMP multi-threading.\n\/\/\/\nvoid ParallelPrimeSieve::sieve()\n{\n reset();\n if (start_ > stop_)\n return;\n OmpInitLock ompInit(&lock_);\n\n int threads = getNumThreads();\n if (tooMany(threads))\n threads = idealNumThreads();\n\n if (threads == 1)\n PrimeSieve::sieve();\n else {\n uint64_t threadInterval = getThreadInterval(threads);\n uint64_t count0 = 0, count1 = 0, count2 = 0, count3 = 0, count4 = 0, count5 = 0, count6 = 0;\n double t1 = getWallTime();\n\n#if _OPENMP >= 200800 \/* OpenMP >= 3.0 (2008) *\/\n\n #pragma omp parallel for schedule(dynamic) num_threads(threads) \\\n reduction(+: count0, count1, count2, count3, count4, count5, count6)\n for (uint64_t n = start_; n < stop_; n += threadInterval) {\n PrimeSieve ps(*this, omp_get_thread_num());\n uint64_t threadStart = align(n);\n uint64_t threadStop = align(n + threadInterval);\n ps.sieve(threadStart, threadStop);\n count0 += ps.getCount(0);\n count1 += ps.getCount(1);\n count2 += ps.getCount(2);\n count3 += ps.getCount(3);\n count4 += ps.getCount(4);\n count5 += ps.getCount(5);\n count6 += ps.getCount(6);\n }\n\n#else \/* OpenMP 2.x *\/\n\n int64_t iters = 1 + (getInterval() - 1) \/ threadInterval;\n\n #pragma omp parallel for schedule(dynamic) num_threads(threads) \\\n reduction(+: count0, count1, count2, count3, count4, count5, count6)\n for (int64_t i = 0; i < iters; i++) {\n PrimeSieve ps(*this, omp_get_thread_num());\n uint64_t n = start_ + i * threadInterval;\n uint64_t threadStart = align(n);\n uint64_t threadStop = align(n + threadInterval);\n ps.sieve(threadStart, threadStop);\n count0 += ps.getCount(0);\n count1 += ps.getCount(1);\n count2 += ps.getCount(2);\n count3 += ps.getCount(3);\n count4 += ps.getCount(4);\n count5 += ps.getCount(5);\n count6 += ps.getCount(6);\n }\n\n#endif\n\n seconds_ = getWallTime() - t1;\n counts_[0] = count0;\n counts_[1] = count1;\n counts_[2] = count2;\n counts_[3] = count3;\n counts_[4] = count4;\n counts_[5] = count5;\n counts_[6] = count6;\n }\n\n \/\/ communicate the sieving results to the\n \/\/ primesieve GUI application\n if (shm_) {\n std::copy(counts_.begin(), counts_.end(), shm_->counts);\n shm_->seconds = seconds_;\n }\n}\n\n\/\/\/ Calculate the sieving status.\n\/\/\/ @param processed Sum of recently processed segments.\n\/\/\/\nbool ParallelPrimeSieve::updateStatus(uint64_t processed, bool waitForLock)\n{\n OmpLockGuard lock(getLock<omp_lock_t*>(), waitForLock);\n if (lock.isSet()) {\n PrimeSieve::updateStatus(processed, false);\n if (shm_)\n shm_->status = getStatus();\n }\n return lock.isSet();\n}\n\n\/\/\/ Used to synchronize threads for prime number generation\n\nvoid ParallelPrimeSieve::setLock()\n{\n omp_lock_t* lock = getLock<omp_lock_t*>();\n omp_set_lock(lock);\n}\n\nvoid ParallelPrimeSieve::unsetLock()\n{\n omp_lock_t* lock = getLock<omp_lock_t*>();\n omp_unset_lock(lock);\n}\n\n#endif \/* _OPENMP *\/\n\n\/\/\/ If OpenMP is disabled then ParallelPrimeSieve behaves like\n\/\/\/ the single threaded PrimeSieve.\n\/\/\/\n#if !defined(_OPENMP)\n\nint ParallelPrimeSieve::getMaxThreads()\n{\n return 1;\n}\n\nvoid ParallelPrimeSieve::sieve()\n{\n PrimeSieve::sieve();\n}\n\ndouble ParallelPrimeSieve::getWallTime() const\n{\n return PrimeSieve::getWallTime();\n}\n\nbool ParallelPrimeSieve::updateStatus(uint64_t processed, bool waitForLock)\n{\n return PrimeSieve::updateStatus(processed, waitForLock);\n}\n\nvoid ParallelPrimeSieve::setLock() { }\n\nvoid ParallelPrimeSieve::unsetLock() { }\n\n#endif\n<commit_msg>setNumThreads(-1) uses default number of threads.<commit_after>\/\/\/\n\/\/\/ @file ParallelPrimeSieve.cpp\n\/\/\/ @brief ParallelPrimeSieve sieves primes in parallel using\n\/\/\/ OpenMP 2.0 (2002) or later.\n\/\/\/\n\/\/\/ Copyright (C) 2013 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\/soe\/config.h>\n#include <primesieve\/soe\/ParallelPrimeSieve.h>\n#include <primesieve\/soe\/PrimeSieve.h>\n#include <primesieve\/soe\/imath.h>\n\n#include <stdint.h>\n#include <cstdlib>\n#include <cassert>\n#include <algorithm>\n\n#ifdef _OPENMP\n #include <omp.h>\n #include <primesieve\/soe\/ParallelPrimeSieve-lock.h>\n#endif\n\nusing namespace soe;\n\nParallelPrimeSieve::ParallelPrimeSieve() :\n numThreads_(DEFAULT_NUM_THREADS),\n shm_(NULL)\n{ }\n\nvoid ParallelPrimeSieve::init(SharedMemory& shm)\n{\n setStart(shm.start);\n setStop(shm.stop);\n setSieveSize(shm.sieveSize);\n setFlags(shm.flags);\n setNumThreads(shm.threads);\n shm_ = &shm;\n}\n\nint ParallelPrimeSieve::getNumThreads() const\n{\n \/\/ Use 1 thread if arithmetic order is important\n if (numThreads_ == DEFAULT_NUM_THREADS)\n return (isPrint() || isGenerate()) ? 1 : idealNumThreads();\n return numThreads_;\n}\n\nvoid ParallelPrimeSieve::setNumThreads(int threads)\n{\n numThreads_ = threads;\n if (numThreads_ != DEFAULT_NUM_THREADS)\n \tnumThreads_ = getInBetween(1, numThreads_, getMaxThreads());\n}\n\n\/\/\/ Get an ideal number of threads for the current\n\/\/\/ set start_ and stop_ numbers.\n\/\/\/\nint ParallelPrimeSieve::idealNumThreads() const\n{\n if (start_ > stop_)\n return 1;\n uint64_t threshold = std::max(config::MIN_THREAD_INTERVAL, isqrt(stop_) \/ 5);\n uint64_t threads = getInterval() \/ threshold;\n threads = getInBetween<uint64_t>(1, threads, getMaxThreads());\n return static_cast<int>(threads);\n}\n\n\/\/\/ Get an interval size that ensures a good load balance\n\/\/\/ when multiple threads are used.\n\/\/\/\nuint64_t ParallelPrimeSieve::getThreadInterval(int threads) const\n{\n assert(threads > 0);\n uint64_t unbalanced = getInterval() \/ threads;\n uint64_t balanced = isqrt(stop_) * 1000;\n uint64_t fastest = std::min(balanced, unbalanced);\n uint64_t threadInterval = getInBetween(config::MIN_THREAD_INTERVAL, fastest, config::MAX_THREAD_INTERVAL);\n uint64_t chunks = getInterval() \/ threadInterval;\n if (chunks < threads * 5u)\n threadInterval = std::max(config::MIN_THREAD_INTERVAL, unbalanced);\n threadInterval += 30 - threadInterval % 30;\n return threadInterval;\n}\n\n\/\/\/ Align n to modulo 30 + 2 to prevent prime k-tuplet\n\/\/\/ (twin primes, prime triplets, ...) gaps.\n\/\/\/\nuint64_t ParallelPrimeSieve::align(uint64_t n) const\n{\n if (n == start_)\n return start_;\n n = std::min(n + 32 - n % 30, stop_);\n return n;\n}\n\nbool ParallelPrimeSieve::tooMany(int threads) const\n{\n return (threads > 1 && getInterval() \/ threads < config::MIN_THREAD_INTERVAL);\n}\n\n#ifdef _OPENMP\n\nint ParallelPrimeSieve::getMaxThreads()\n{\n return omp_get_max_threads();\n}\n\ndouble ParallelPrimeSieve::getWallTime() const\n{\n return omp_get_wtime();\n}\n\n\/\/\/ Sieve the primes and prime k-tuplets within [start_, stop_]\n\/\/\/ in parallel using OpenMP multi-threading.\n\/\/\/\nvoid ParallelPrimeSieve::sieve()\n{\n reset();\n if (start_ > stop_)\n return;\n OmpInitLock ompInit(&lock_);\n\n int threads = getNumThreads();\n if (tooMany(threads))\n threads = idealNumThreads();\n\n if (threads == 1)\n PrimeSieve::sieve();\n else {\n uint64_t threadInterval = getThreadInterval(threads);\n uint64_t count0 = 0, count1 = 0, count2 = 0, count3 = 0, count4 = 0, count5 = 0, count6 = 0;\n double t1 = getWallTime();\n\n#if _OPENMP >= 200800 \/* OpenMP >= 3.0 (2008) *\/\n\n #pragma omp parallel for schedule(dynamic) num_threads(threads) \\\n reduction(+: count0, count1, count2, count3, count4, count5, count6)\n for (uint64_t n = start_; n < stop_; n += threadInterval) {\n PrimeSieve ps(*this, omp_get_thread_num());\n uint64_t threadStart = align(n);\n uint64_t threadStop = align(n + threadInterval);\n ps.sieve(threadStart, threadStop);\n count0 += ps.getCount(0);\n count1 += ps.getCount(1);\n count2 += ps.getCount(2);\n count3 += ps.getCount(3);\n count4 += ps.getCount(4);\n count5 += ps.getCount(5);\n count6 += ps.getCount(6);\n }\n\n#else \/* OpenMP 2.x *\/\n\n int64_t iters = 1 + (getInterval() - 1) \/ threadInterval;\n\n #pragma omp parallel for schedule(dynamic) num_threads(threads) \\\n reduction(+: count0, count1, count2, count3, count4, count5, count6)\n for (int64_t i = 0; i < iters; i++) {\n PrimeSieve ps(*this, omp_get_thread_num());\n uint64_t n = start_ + i * threadInterval;\n uint64_t threadStart = align(n);\n uint64_t threadStop = align(n + threadInterval);\n ps.sieve(threadStart, threadStop);\n count0 += ps.getCount(0);\n count1 += ps.getCount(1);\n count2 += ps.getCount(2);\n count3 += ps.getCount(3);\n count4 += ps.getCount(4);\n count5 += ps.getCount(5);\n count6 += ps.getCount(6);\n }\n\n#endif\n\n seconds_ = getWallTime() - t1;\n counts_[0] = count0;\n counts_[1] = count1;\n counts_[2] = count2;\n counts_[3] = count3;\n counts_[4] = count4;\n counts_[5] = count5;\n counts_[6] = count6;\n }\n\n \/\/ communicate the sieving results to the\n \/\/ primesieve GUI application\n if (shm_) {\n std::copy(counts_.begin(), counts_.end(), shm_->counts);\n shm_->seconds = seconds_;\n }\n}\n\n\/\/\/ Calculate the sieving status.\n\/\/\/ @param processed Sum of recently processed segments.\n\/\/\/\nbool ParallelPrimeSieve::updateStatus(uint64_t processed, bool waitForLock)\n{\n OmpLockGuard lock(getLock<omp_lock_t*>(), waitForLock);\n if (lock.isSet()) {\n PrimeSieve::updateStatus(processed, false);\n if (shm_)\n shm_->status = getStatus();\n }\n return lock.isSet();\n}\n\n\/\/\/ Used to synchronize threads for prime number generation\n\nvoid ParallelPrimeSieve::setLock()\n{\n omp_lock_t* lock = getLock<omp_lock_t*>();\n omp_set_lock(lock);\n}\n\nvoid ParallelPrimeSieve::unsetLock()\n{\n omp_lock_t* lock = getLock<omp_lock_t*>();\n omp_unset_lock(lock);\n}\n\n#endif \/* _OPENMP *\/\n\n\/\/\/ If OpenMP is disabled then ParallelPrimeSieve behaves like\n\/\/\/ the single threaded PrimeSieve.\n\/\/\/\n#if !defined(_OPENMP)\n\nint ParallelPrimeSieve::getMaxThreads()\n{\n return 1;\n}\n\nvoid ParallelPrimeSieve::sieve()\n{\n PrimeSieve::sieve();\n}\n\ndouble ParallelPrimeSieve::getWallTime() const\n{\n return PrimeSieve::getWallTime();\n}\n\nbool ParallelPrimeSieve::updateStatus(uint64_t processed, bool waitForLock)\n{\n return PrimeSieve::updateStatus(processed, waitForLock);\n}\n\nvoid ParallelPrimeSieve::setLock() { }\n\nvoid ParallelPrimeSieve::unsetLock() { }\n\n#endif\n<|endoftext|>"} {"text":"<commit_before>\/*\r\n * Copyright (c) 2015 WinT 3794 <http:\/\/wint3794.org>\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 <QDir>\r\n#include <QFile>\r\n#include <QTimer>\r\n#include <QMessageBox>\r\n#include <QApplication>\r\n\r\n#include <math.h>\r\n\r\n#include \"Settings.h\"\r\n#include \"GamepadManager.h\"\r\n\r\n\/* Maximum axis value *\/\r\n#define _MAX_VAL 32767\r\n\r\n\/* Location of community-maintained joystick mappings *\/\r\n#define _CONTROLLER_DB \":\/sdl\/database.txt\"\r\n\r\n\/* Used to create mappings from unsupported controllers *\/\r\n#if defined _WIN32 || defined _WIN64\r\n#define _GENERIC_MAPPINGS \":\/sdl\/generic\/windows.txt\"\r\n#elif defined __APPLE__\r\n#define _GENERIC_MAPPINGS \":\/sdl\/generic\/mac-osx.txt\"\r\n#elif defined __gnu_linux__\r\n#define _GENERIC_MAPPINGS \":\/sdl\/generic\/linux.txt\"\r\n#endif\r\n\r\n#define SDL_MAIN_HANDLED\r\n#define _INIT_CODE SDL_INIT_JOYSTICK | SDL_INIT_GAMECONTROLLER\r\n\r\nGamepadManager* GamepadManager::m_instance = nullptr;\r\n\r\n\/\/------------------------------------------------------------------------------\r\n\/\/ Class initialization functions\r\n\/\/------------------------------------------------------------------------------\r\n\r\nGamepadManager::GamepadManager()\r\n{\r\n SDL_SetHint (SDL_HINT_JOYSTICK_ALLOW_BACKGROUND_EVENTS, \"1\");\r\n\r\n if (SDL_Init (_INIT_CODE) != 0) {\r\n QMessageBox::critical (nullptr, tr (\"Fatal Error!\"),\r\n tr (\"SDL Init Error: %1\").arg (SDL_GetError()));\r\n\r\n exit (EXIT_FAILURE);\r\n }\r\n\r\n \/* Enable event states to use them in the event loop *\/\r\n SDL_JoystickEventState (SDL_ENABLE);\r\n SDL_GameControllerEventState (SDL_ENABLE);\r\n\r\n \/* Load community controller database *\/\r\n QFile db (_CONTROLLER_DB);\r\n if (db.open (QFile::ReadOnly)) {\r\n while (!db.atEnd())\r\n SDL_GameControllerAddMapping (\r\n QVariant (db.readLine()).toString().toStdString().c_str());\r\n\r\n db.close();\r\n }\r\n\r\n \/* Load generic mapping string, used for unsupported controllers *\/\r\n QFile generic (_GENERIC_MAPPINGS);\r\n if (generic.open (QFile::ReadOnly)) {\r\n m_genericMapping = (QString)generic.readAll();\r\n generic.close();\r\n }\r\n}\r\n\r\nGamepadManager::~GamepadManager()\r\n{\r\n for (int i = 0; i < SDL_NumJoysticks(); ++i)\r\n SDL_GameControllerClose (SDL_GameControllerOpen (i));\r\n\r\n SDL_Quit();\r\n}\r\n\r\nGamepadManager* GamepadManager::getInstance()\r\n{\r\n if (m_instance == nullptr)\r\n m_instance = new GamepadManager();\r\n\r\n return m_instance;\r\n}\r\n\r\n\/\/------------------------------------------------------------------------------\r\n\/\/ Functions that give information about a selected joystick\r\n\/\/------------------------------------------------------------------------------\r\n\r\nint GamepadManager::getNumAxes (int joystick)\r\n{\r\n return SDL_JoystickNumAxes (SDL_JoystickOpen (joystick));\r\n}\r\n\r\nint GamepadManager::getNumButtons (int joystick)\r\n{\r\n return SDL_JoystickNumButtons (SDL_JoystickOpen (joystick));\r\n}\r\n\r\nQString GamepadManager::getAxisName (int axis)\r\n{\r\n return QString (\"Axis %1\").arg (axis);\r\n}\r\n\r\nQString GamepadManager::getButtonName (int button)\r\n{\r\n return QString (\"Button %1\").arg (button);\r\n}\r\n\r\nQString GamepadManager::getJoystickName (int joystick)\r\n{\r\n QString name = (QString) SDL_GameControllerNameForIndex (joystick);\r\n return name.isEmpty() ? SDL_JoystickNameForIndex (joystick) : name;\r\n}\r\n\r\n\/\/------------------------------------------------------------------------------\r\n\/\/ Functions that give information about all joysticks\r\n\/\/------------------------------------------------------------------------------\r\n\r\nQStringList GamepadManager::joystickList()\r\n{\r\n QStringList list;\r\n\r\n for (int i = 0; i < SDL_NumJoysticks(); ++i)\r\n list.append (getJoystickName (i));\r\n\r\n return list;\r\n}\r\n\r\n\/\/------------------------------------------------------------------------------\r\n\/\/ Functions that need to be called after initalization of UI\r\n\/\/------------------------------------------------------------------------------\r\n\r\nvoid GamepadManager::init()\r\n{\r\n m_time = 20;\r\n m_tracker = -1;\r\n QTimer::singleShot (500, this, SLOT (readSdlEvents()));\r\n}\r\n\r\nvoid GamepadManager::setUpdateInterval (int time)\r\n{\r\n if (time >= 0)\r\n m_time = time;\r\n}\r\n\r\n\/\/------------------------------------------------------------------------------\r\n\/\/ Functions that control behaviour of a specific joystick\r\n\/\/------------------------------------------------------------------------------\r\n\r\nvoid GamepadManager::rumble (int joystick, int time)\r\n{\r\n SDL_InitSubSystem (SDL_INIT_HAPTIC);\r\n SDL_Haptic* haptic = SDL_HapticOpen (joystick);\r\n\r\n if (haptic != nullptr) {\r\n SDL_HapticRumbleInit (haptic);\r\n SDL_HapticRumblePlay (haptic, 1, time);\r\n }\r\n}\r\n\r\n\/\/------------------------------------------------------------------------------\r\n\/\/ Functions that transform SDL events into GamepadManager structures\/data\r\n\/\/------------------------------------------------------------------------------\r\n\r\nGM_Axis GamepadManager::getAxis (const SDL_Event* event)\r\n{\r\n GM_Axis axis;\r\n\r\n axis.rawId = event->caxis.axis;\r\n axis.joystick = getJoystick (event);\r\n axis.identifier = getAxisName (axis.rawId);\r\n axis.value = (double) (event->caxis.value) \/ _MAX_VAL;\r\n\r\n return axis;\r\n}\r\n\r\nGM_Button GamepadManager::getButton (const SDL_Event* event)\r\n{\r\n GM_Button button;\r\n\r\n button.rawId = event->cbutton.button;\r\n button.joystick = getJoystick (event);\r\n button.identifier = getButtonName (button.rawId);\r\n button.pressed = event->cbutton.state == SDL_PRESSED;\r\n\r\n return button;\r\n}\r\n\r\nGM_Joystick GamepadManager::getJoystick (const SDL_Event* event)\r\n{\r\n GM_Joystick stick;\r\n\r\n stick.id = getDynamicId (event->cdevice.which);\r\n stick.numAxes = getNumAxes (event->cdevice.which);\r\n stick.numButtons = getNumButtons (event->cdevice.which);\r\n stick.displayName = getJoystickName (event->cdevice.which);\r\n\r\n return stick;\r\n}\r\n\r\n\/\/------------------------------------------------------------------------------\r\n\/\/ SDL magic\r\n\/\/------------------------------------------------------------------------------\r\n\r\nint GamepadManager::getDynamicId (int id)\r\n{\r\n id = m_tracker - (id + 1);\r\n if (id < 0) id = abs (id);\r\n if (id >= SDL_NumJoysticks()) id -= 1;\r\n\r\n return id;\r\n}\r\n\r\nvoid GamepadManager::readSdlEvents()\r\n{\r\n SDL_Event event;\r\n while (SDL_PollEvent (&event)) {\r\n switch (event.type) {\r\n case SDL_CONTROLLERDEVICEADDED:\r\n ++m_tracker;\r\n onControllerAdded (&event);\r\n emit countChanged (joystickList());\r\n emit countChanged (SDL_NumJoysticks());\r\n break;\r\n case SDL_CONTROLLERDEVICEREMOVED:\r\n onControllerRemoved (&event);\r\n emit countChanged (joystickList());\r\n emit countChanged (SDL_NumJoysticks());\r\n break;\r\n case SDL_CONTROLLERAXISMOTION:\r\n onAxisEvent (&event);\r\n break;\r\n case SDL_CONTROLLERBUTTONDOWN:\r\n onButtonEvent (&event);\r\n break;\r\n case SDL_CONTROLLERBUTTONUP:\r\n onButtonEvent (&event);\r\n break;\r\n }\r\n }\r\n\r\n QTimer::singleShot (m_time, this, SLOT (readSdlEvents()));\r\n}\r\n\r\n\/\/------------------------------------------------------------------------------\r\n\/\/ Functions that react to SDL events\r\n\/\/------------------------------------------------------------------------------\r\n\r\nvoid GamepadManager::onAxisEvent (const SDL_Event* event)\r\n{\r\n emit axisEvent (getAxis (event));\r\n}\r\n\r\nvoid GamepadManager::onButtonEvent (const SDL_Event* event)\r\n{\r\n emit buttonEvent (getButton (event));\r\n}\r\n\r\nvoid GamepadManager::onControllerAdded (const SDL_Event* event)\r\n{\r\n if (!SDL_IsGameController (event->cdevice.which)) {\r\n SDL_Joystick* js = SDL_JoystickOpen (event->cdevice.which);\r\n\r\n if (js) {\r\n char guid[1024];\r\n SDL_JoystickGetGUIDString (SDL_JoystickGetGUID (js),\r\n guid,\r\n sizeof (guid));\r\n\r\n QString mapping = QString (\"%1,%2,%3\")\r\n .arg (guid)\r\n .arg (SDL_JoystickName (js))\r\n .arg (m_genericMapping);\r\n\r\n SDL_GameControllerAddMapping (mapping.toStdString().c_str());\r\n SDL_JoystickClose (js);\r\n }\r\n }\r\n\r\n SDL_GameControllerOpen (event->cdevice.which);\r\n}\r\n\r\nvoid GamepadManager::onControllerRemoved (const SDL_Event* event)\r\n{\r\n SDL_GameControllerClose (SDL_GameControllerOpen (event->cdevice.which));\r\n}\r\n<commit_msg>Fix undetected joysticks<commit_after>\/*\r\n * Copyright (c) 2015 WinT 3794 <http:\/\/wint3794.org>\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 <QDir>\r\n#include <QFile>\r\n#include <QTimer>\r\n#include <QMessageBox>\r\n#include <QApplication>\r\n\r\n#include <math.h>\r\n\r\n#include \"Settings.h\"\r\n#include \"GamepadManager.h\"\r\n\r\n\/* Maximum axis value *\/\r\n#define _MAX_VAL 32767\r\n\r\n\/* Location of community-maintained joystick mappings *\/\r\n#define _CONTROLLER_DB \":\/sdl\/database.txt\"\r\n\r\n\/* Used to create mappings from unsupported controllers *\/\r\n#if defined _WIN32 || defined _WIN64\r\n#define _GENERIC_MAPPINGS \":\/sdl\/generic\/windows.txt\"\r\n#elif defined __APPLE__\r\n#define _GENERIC_MAPPINGS \":\/sdl\/generic\/mac-osx.txt\"\r\n#elif defined __gnu_linux__\r\n#define _GENERIC_MAPPINGS \":\/sdl\/generic\/linux.txt\"\r\n#endif\r\n\r\n#define SDL_MAIN_HANDLED\r\n#define _INIT_CODE SDL_INIT_JOYSTICK | SDL_INIT_GAMECONTROLLER\r\n\r\nGamepadManager* GamepadManager::m_instance = nullptr;\r\n\r\n\/\/------------------------------------------------------------------------------\r\n\/\/ Class initialization functions\r\n\/\/------------------------------------------------------------------------------\r\n\r\nGamepadManager::GamepadManager()\r\n{\r\n SDL_SetHint (SDL_HINT_JOYSTICK_ALLOW_BACKGROUND_EVENTS, \"1\");\r\n\r\n if (SDL_Init (_INIT_CODE) != 0) {\r\n QMessageBox::critical (nullptr, tr (\"Fatal Error!\"),\r\n tr (\"SDL Init Error: %1\").arg (SDL_GetError()));\r\n\r\n exit (EXIT_FAILURE);\r\n }\r\n\r\n \/* Enable event states to use them in the event loop *\/\r\n SDL_JoystickEventState (SDL_ENABLE);\r\n SDL_GameControllerEventState (SDL_ENABLE);\r\n\r\n \/* Load community controller database *\/\r\n QFile db (_CONTROLLER_DB);\r\n if (db.open (QFile::ReadOnly)) {\r\n while (!db.atEnd())\r\n SDL_GameControllerAddMapping (\r\n QVariant (db.readLine()).toString().toStdString().c_str());\r\n\r\n db.close();\r\n }\r\n\r\n \/* Load generic mapping string, used for unsupported controllers *\/\r\n QFile generic (_GENERIC_MAPPINGS);\r\n if (generic.open (QFile::ReadOnly)) {\r\n m_genericMapping = (QString)generic.readAll();\r\n generic.close();\r\n }\r\n}\r\n\r\nGamepadManager::~GamepadManager()\r\n{\r\n for (int i = 0; i < SDL_NumJoysticks(); ++i)\r\n SDL_GameControllerClose (SDL_GameControllerOpen (i));\r\n\r\n SDL_Quit();\r\n}\r\n\r\nGamepadManager* GamepadManager::getInstance()\r\n{\r\n if (m_instance == nullptr)\r\n m_instance = new GamepadManager();\r\n\r\n return m_instance;\r\n}\r\n\r\n\/\/------------------------------------------------------------------------------\r\n\/\/ Functions that give information about a selected joystick\r\n\/\/------------------------------------------------------------------------------\r\n\r\nint GamepadManager::getNumAxes (int joystick)\r\n{\r\n return SDL_JoystickNumAxes (SDL_JoystickOpen (joystick));\r\n}\r\n\r\nint GamepadManager::getNumButtons (int joystick)\r\n{\r\n return SDL_JoystickNumButtons (SDL_JoystickOpen (joystick));\r\n}\r\n\r\nQString GamepadManager::getAxisName (int axis)\r\n{\r\n return QString (\"Axis %1\").arg (axis);\r\n}\r\n\r\nQString GamepadManager::getButtonName (int button)\r\n{\r\n return QString (\"Button %1\").arg (button);\r\n}\r\n\r\nQString GamepadManager::getJoystickName (int joystick)\r\n{\r\n QString name = (QString) SDL_GameControllerNameForIndex (joystick);\r\n return name.isEmpty() ? SDL_JoystickNameForIndex (joystick) : name;\r\n}\r\n\r\n\/\/------------------------------------------------------------------------------\r\n\/\/ Functions that give information about all joysticks\r\n\/\/------------------------------------------------------------------------------\r\n\r\nQStringList GamepadManager::joystickList()\r\n{\r\n QStringList list;\r\n\r\n for (int i = 0; i < SDL_NumJoysticks(); ++i)\r\n list.append (getJoystickName (i));\r\n\r\n return list;\r\n}\r\n\r\n\/\/------------------------------------------------------------------------------\r\n\/\/ Functions that need to be called after initalization of UI\r\n\/\/------------------------------------------------------------------------------\r\n\r\nvoid GamepadManager::init()\r\n{\r\n m_time = 20;\r\n m_tracker = -1;\r\n QTimer::singleShot (500, this, SLOT (readSdlEvents()));\r\n}\r\n\r\nvoid GamepadManager::setUpdateInterval (int time)\r\n{\r\n if (time >= 0)\r\n m_time = time;\r\n}\r\n\r\n\/\/------------------------------------------------------------------------------\r\n\/\/ Functions that control behaviour of a specific joystick\r\n\/\/------------------------------------------------------------------------------\r\n\r\nvoid GamepadManager::rumble (int joystick, int time)\r\n{\r\n SDL_InitSubSystem (SDL_INIT_HAPTIC);\r\n SDL_Haptic* haptic = SDL_HapticOpen (joystick);\r\n\r\n if (haptic != nullptr) {\r\n SDL_HapticRumbleInit (haptic);\r\n SDL_HapticRumblePlay (haptic, 1, time);\r\n }\r\n}\r\n\r\n\/\/------------------------------------------------------------------------------\r\n\/\/ Functions that transform SDL events into GamepadManager structures\/data\r\n\/\/------------------------------------------------------------------------------\r\n\r\nGM_Axis GamepadManager::getAxis (const SDL_Event* event)\r\n{\r\n GM_Axis axis;\r\n\r\n axis.rawId = event->caxis.axis;\r\n axis.joystick = getJoystick (event);\r\n axis.identifier = getAxisName (axis.rawId);\r\n axis.value = (double) (event->caxis.value) \/ _MAX_VAL;\r\n\r\n return axis;\r\n}\r\n\r\nGM_Button GamepadManager::getButton (const SDL_Event* event)\r\n{\r\n GM_Button button;\r\n\r\n button.rawId = event->cbutton.button;\r\n button.joystick = getJoystick (event);\r\n button.identifier = getButtonName (button.rawId);\r\n button.pressed = event->cbutton.state == SDL_PRESSED;\r\n\r\n return button;\r\n}\r\n\r\nGM_Joystick GamepadManager::getJoystick (const SDL_Event* event)\r\n{\r\n GM_Joystick stick;\r\n\r\n stick.id = getDynamicId (event->cdevice.which);\r\n stick.numAxes = getNumAxes (event->cdevice.which);\r\n stick.numButtons = getNumButtons (event->cdevice.which);\r\n stick.displayName = getJoystickName (event->cdevice.which);\r\n\r\n return stick;\r\n}\r\n\r\n\/\/------------------------------------------------------------------------------\r\n\/\/ SDL magic\r\n\/\/------------------------------------------------------------------------------\r\n\r\nint GamepadManager::getDynamicId (int id)\r\n{\r\n id = m_tracker - (id + 1);\r\n if (id < 0) id = abs (id);\r\n if (id >= SDL_NumJoysticks()) id -= 1;\r\n\r\n return id;\r\n}\r\n\r\nvoid GamepadManager::readSdlEvents()\r\n{\r\n SDL_Event event;\r\n while (SDL_PollEvent (&event)) {\r\n switch (event.type) {\r\n case SDL_JOYDEVICEADDED:\r\n ++m_tracker;\r\n onControllerAdded (&event);\r\n emit countChanged (joystickList());\r\n emit countChanged (SDL_NumJoysticks());\r\n break;\r\n case SDL_CONTROLLERDEVICEADDED:\r\n ++m_tracker;\r\n onControllerAdded (&event);\r\n emit countChanged (joystickList());\r\n emit countChanged (SDL_NumJoysticks());\r\n break;\r\n case SDL_CONTROLLERDEVICEREMOVED:\r\n onControllerRemoved (&event);\r\n emit countChanged (joystickList());\r\n emit countChanged (SDL_NumJoysticks());\r\n break;\r\n case SDL_CONTROLLERAXISMOTION:\r\n onAxisEvent (&event);\r\n break;\r\n case SDL_CONTROLLERBUTTONDOWN:\r\n onButtonEvent (&event);\r\n break;\r\n case SDL_CONTROLLERBUTTONUP:\r\n onButtonEvent (&event);\r\n break;\r\n }\r\n }\r\n\r\n QTimer::singleShot (m_time, this, SLOT (readSdlEvents()));\r\n}\r\n\r\n\/\/------------------------------------------------------------------------------\r\n\/\/ Functions that react to SDL events\r\n\/\/------------------------------------------------------------------------------\r\n\r\nvoid GamepadManager::onAxisEvent (const SDL_Event* event)\r\n{\r\n emit axisEvent (getAxis (event));\r\n}\r\n\r\nvoid GamepadManager::onButtonEvent (const SDL_Event* event)\r\n{\r\n emit buttonEvent (getButton (event));\r\n}\r\n\r\nvoid GamepadManager::onControllerAdded (const SDL_Event* event)\r\n{\r\n if (!SDL_IsGameController (event->cdevice.which)) {\r\n SDL_Joystick* js = SDL_JoystickOpen (event->cdevice.which);\r\n\r\n if (js) {\r\n char guid[1024];\r\n SDL_JoystickGetGUIDString (SDL_JoystickGetGUID (js),\r\n guid,\r\n sizeof (guid));\r\n\r\n QString mapping = QString (\"%1,%2,%3\")\r\n .arg (guid)\r\n .arg (SDL_JoystickName (js))\r\n .arg (m_genericMapping);\r\n\r\n SDL_GameControllerAddMapping (mapping.toStdString().c_str());\r\n SDL_JoystickClose (js);\r\n }\r\n }\r\n\r\n SDL_GameControllerOpen (event->cdevice.which);\r\n}\r\n\r\nvoid GamepadManager::onControllerRemoved (const SDL_Event* event)\r\n{\r\n SDL_GameControllerClose (SDL_GameControllerOpen (event->cdevice.which));\r\n}\r\n<|endoftext|>"} {"text":"<commit_before>\/*********************************************************************************\n * Nelder-Mead Optimierungsalgorithmus. *\n * Autor: Sonja Biedermann, a1402891 (Gruppe 7, Team 4) *\n * *\n * Minimiert eine gegebene Funktion f. *\n * Wendet dazu den Nelder-Mead Algorithmus an, der einen sich an die Funkions- *\n * landschaft anpassenden Simplex zum Minimum wandern lässt. *\n * *\n * Als Referenzen wurden folgende Quellen verwendet: *\n * http:\/\/mathfaculty.fullerton.edu\/mathews\/n2003\/neldermead\/NelderMeadProof.pdf *\n * https:\/\/en.wikipedia.org\/wiki\/Nelder%E2%80%93Mead_method *\n *********************************************************************************\/\n\n#pragma once\n#include <cmath>\n#include <tuple>\n#include <exception>\n\n#include \"Funktion.h\"\n#include \"point.hpp\"\n\nstruct invalid_value: public std::exception {\n char const* err = \"invalid value\";\n invalid_value(char const* e) : err{ e } {}\n char const* what() const noexcept { return err; }\n};\n\nclass nelder_mead_optimizer {\nprivate:\n Funktion& f;\n point b; \/\/ best\n point g; \/\/ good\n point w; \/\/ worst\n double eps;\n size_t iter_c = 0;\n\n double alpha_; \/\/ Alpha: Reflexionsfaktor, default: 1\n double gamma_; \/\/ Gamma: Expansionsfaktor, default: 2\n double beta_; \/\/ Rho: Kontrahierungsfaktor, default: .5\n double delta_; \/\/ Komprimierungsfaktor, default: .5\n\n bool is_done = false;\n\n point& min(point& p1, point& p2) {\n return f(p1.x, p1.y) < f(p2.x, p2.y) ? p1 : p2;\n }\n\n point& min(point& p1, point& p2, point& p3) {\n double z1 = f(p1.x, p1.y);\n double z2 = f(p2.x, p2.y);\n double z3 = f(p3.x, p3.y);\n return z1 < z2 ? (z1 < z3 ? p1 : p3) : (z2 < z3 ? p2 : p3);\n }\n\n void sort_points_by_fvalue() {\n std::swap(b, min(b, g, w));\n std::swap(g, min(g, w));\n }\n\n void do_step() {\n point m = (b + g) \/ 2; \/\/ mittelpunkt\n point r = m + alpha_ * (m - w); \/\/ reflektiere schlechtesten punkt\n\n if(f(r.x, r.y) < f(w.x, w.y)) {\n if(f(r.x, r.y) < f(b.x, b.y)) { \/\/ r besser as b: expandiere weiter\n point e = m + gamma_ * (m - w);\n w = min(e, r);\n return;\n }\n w = r;\n return;\n }\n\n point c;\n if(f(r.x, r.y) < f(w.x, w.y)) { \/\/ outside: näher an r\n if(f(c.x, c.y) < f(r.x, r.y)) {\n w = c;\n return;\n }\n } else { \/\/ inside: näher an w\n c = m + beta_ * (w - m);\n if(f(c.x, c.y) < f(w.x, w.y)) {\n w = c;\n return;\n }\n }\n\n g = b + delta_ * (g - b);\n w = b + delta_ * (w - b);\n }\n\npublic:\n nelder_mead_optimizer(Funktion& f, point const& p1, point const& p2, point const& p3, double eps = 0.00001,\n double alpha = 1, double gamma = 2, double beta = .5, double delta = .5)\n : f( f ), b{ p1 }, g{ p2 }, w{ p3 }, eps{ eps } {\n sort_points_by_fvalue();\n set_alpha(alpha);\n set_gamma(gamma);\n set_beta(beta);\n set_delta(delta);\n }\n\n double alpha() const { return alpha_; }\n double gamma() const { return gamma_; }\n double beta() const { return beta_; }\n double delta() const { return delta_; }\n\n size_t iteration_count() const { return iter_c; }\n point const& best_point() const { return b; }\n\n bool done() const { return is_done; }\n\n std::tuple<point, point, point> current_simplex() const {\n return std::make_tuple(b, g, w);\n }\n\n void set_alpha(double alpha) {\n if(!(alpha > 0)) {\n throw invalid_value(\"alpha value violates constraint alpha > 0\");\n }\n alpha_ = alpha;\n }\n\n void set_gamma(double gamma) {\n if(!(gamma > 1)) {\n throw invalid_value(\"gamma value violates constraint gamma > 1\");\n } else if(!(gamma > alpha_)) {\n throw invalid_value(\"gamma value violates constraint gamma > alpha\");\n }\n gamma_ = gamma;\n }\n\n void set_beta(double beta) {\n if(!(0 < beta && beta < 1)) {\n throw invalid_value(\"beta value violates constraint 0 < beta < 1\");\n }\n beta_ = beta;\n }\n\n void set_delta(double delta) {\n if(!(0 < delta && delta < 1)) {\n throw invalid_value(\"delta value violates constraint 0 < delta < 1\");\n }\n delta_ = delta;\n }\n\n void step() {\n if(is_done) { return; }\n do_step();\n ++iter_c;\n sort_points_by_fvalue();\n\n \/* Konvergenzkriterium: Differenz zwischen bestem und schlechtetestem Punkt\n * erreicht oder unterschreitet Epsilon. *\/\n if(std::abs(f(b.x, b.y) - f(w.x, w.y)) <= eps) { is_done = true; }\n }\n\n void optimize() { while(!is_done) { step(); } }\n};\n\/* vim: set ts=4 sw=4 tw=0 et :*\/\n<commit_msg>what the actual fuck<commit_after>\/*********************************************************************************\n * Nelder-Mead Optimierungsalgorithmus. *\n * Autor: Sonja Biedermann, a1402891 (Gruppe 7, Team 4) *\n * *\n * Minimiert eine gegebene Funktion f. *\n * Wendet dazu den Nelder-Mead Algorithmus an, der einen sich an die Funkions- *\n * landschaft anpassenden Simplex zum Minimum wandern lässt. *\n * *\n * Als Referenzen wurden folgende Quellen verwendet: *\n * http:\/\/mathfaculty.fullerton.edu\/mathews\/n2003\/neldermead\/NelderMeadProof.pdf *\n * https:\/\/en.wikipedia.org\/wiki\/Nelder%E2%80%93Mead_method *\n *********************************************************************************\/\n\n#pragma once\n#include <cmath>\n#include <tuple>\n#include <exception>\n\n#include \"Funktion.h\"\n#include \"point.hpp\"\n\nstruct invalid_value: public std::exception {\n char const* err = \"invalid value\";\n invalid_value(char const* e) : err{ e } {}\n char const* what() const noexcept { return err; }\n};\n\nclass nelder_mead_optimizer {\nprivate:\n Funktion& f;\n point b; \/\/ best\n point g; \/\/ good\n point w; \/\/ worst\n double eps;\n size_t iter_c = 0;\n\n double alpha_; \/\/ Alpha: Reflexionsfaktor, default: 1\n double gamma_; \/\/ Gamma: Expansionsfaktor, default: 2\n double beta_; \/\/ Rho: Kontrahierungsfaktor, default: .5\n double delta_; \/\/ Komprimierungsfaktor, default: .5\n\n bool is_done = false;\n\n point& min(point& p1, point& p2) {\n return f(p1.x, p1.y) < f(p2.x, p2.y) ? p1 : p2;\n }\n\n point& min(point& p1, point& p2, point& p3) {\n double z1 = f(p1.x, p1.y);\n double z2 = f(p2.x, p2.y);\n double z3 = f(p3.x, p3.y);\n return z1 < z2 ? (z1 < z3 ? p1 : p3) : (z2 < z3 ? p2 : p3);\n }\n\n void sort_points_by_fvalue() {\n std::swap(b, min(b, g, w));\n std::swap(g, min(g, w));\n }\n\n void do_step() {\n point m = (b + g) \/ 2; \/\/ mittelpunkt\n point r = m + alpha_ * (m - w); \/\/ reflektiere schlechtesten punkt\n\n if(f(r.x, r.y) < f(w.x, w.y)) {\n if(f(r.x, r.y) < f(b.x, b.y)) { \/\/ r besser as b: expandiere weiter\n point e = m + gamma_ * (m - w);\n w = min(e, r);\n return;\n }\n w = r;\n return;\n }\n\n point c;\n if(f(r.x, r.y) < f(w.x, w.y)) { \/\/ outside: näher an r\n c = m + beta_ * (r - m);\n if(f(c.x, c.y) < f(r.x, r.y)) {\n w = c;\n return;\n }\n } else { \/\/ inside: näher an w\n c = m + beta_ * (w - m);\n if(f(c.x, c.y) < f(w.x, w.y)) {\n w = c;\n return;\n }\n }\n\n g = b + delta_ * (g - b);\n w = b + delta_ * (w - b);\n }\n\npublic:\n nelder_mead_optimizer(Funktion& f, point const& p1, point const& p2, point const& p3, double eps = 0.00001,\n double alpha = 1, double gamma = 2, double beta = .5, double delta = .5)\n : f( f ), b{ p1 }, g{ p2 }, w{ p3 }, eps{ eps } {\n sort_points_by_fvalue();\n set_alpha(alpha);\n set_gamma(gamma);\n set_beta(beta);\n set_delta(delta);\n }\n\n double alpha() const { return alpha_; }\n double gamma() const { return gamma_; }\n double beta() const { return beta_; }\n double delta() const { return delta_; }\n\n size_t iteration_count() const { return iter_c; }\n point const& best_point() const { return b; }\n\n bool done() const { return is_done; }\n\n std::tuple<point, point, point> current_simplex() const {\n return std::make_tuple(b, g, w);\n }\n\n void set_alpha(double alpha) {\n if(!(alpha > 0)) {\n throw invalid_value(\"alpha value violates constraint alpha > 0\");\n }\n alpha_ = alpha;\n }\n\n void set_gamma(double gamma) {\n if(!(gamma > 1)) {\n throw invalid_value(\"gamma value violates constraint gamma > 1\");\n } else if(!(gamma > alpha_)) {\n throw invalid_value(\"gamma value violates constraint gamma > alpha\");\n }\n gamma_ = gamma;\n }\n\n void set_beta(double beta) {\n if(!(0 < beta && beta < 1)) {\n throw invalid_value(\"beta value violates constraint 0 < beta < 1\");\n }\n beta_ = beta;\n }\n\n void set_delta(double delta) {\n if(!(0 < delta && delta < 1)) {\n throw invalid_value(\"delta value violates constraint 0 < delta < 1\");\n }\n delta_ = delta;\n }\n\n void step() {\n if(is_done) { return; }\n do_step();\n ++iter_c;\n sort_points_by_fvalue();\n\n \/* Konvergenzkriterium: Differenz zwischen bestem und schlechtetestem Punkt\n * erreicht oder unterschreitet Epsilon. *\/\n if(std::abs(f(b.x, b.y) - f(w.x, w.y)) <= eps) { is_done = true; }\n }\n\n void optimize() { while(!is_done) { step(); } }\n};\n\/* vim: set ts=4 sw=4 tw=0 et :*\/\n<|endoftext|>"} {"text":"<commit_before>#include <project.h>\n\ndouble rad(double angle){\n return angle * (PI \/ 180.0);\n}\n\ndouble stairsLength(double height, double angle){\n double distance = height \/ sin(rad(angle));\n return sqrt(pow(distance, 2) - pow(height, 2));\n}\n\ndouble circleArea(double radius){\n return PI * pow(radius, 2);\n}\n\ndouble circlePerimeter(double radius){\n return 2 * PI * radius;\n}\n<commit_msg>Added opSide and adSide of triangle<commit_after>#include <project.h>\n\ndouble rad(double angle){\n return angle * (PI \/ 180.0);\n}\n\ndouble stairsLength(double height, double angle){\n double distance = height \/ sin(rad(angle));\n return sqrt(pow(distance, 2) - pow(height, 2));\n}\n\ndouble circleArea(double radius){\n return PI * pow(radius, 2);\n}\n\ndouble circlePerimeter(double radius){\n return 2 * PI * radius;\n}\n\ndouble triangleOpposite(double hypotenuse, double angle){\n return hypotenuse * sin(rad(angle));\n}\n\ndouble triangleAdjacent(double hypotenuse, double angle){\n return hypotenuse * cos(rad(angle));\n}\n<|endoftext|>"} {"text":"<commit_before>\/*=========================================================================\n\n Program: Insight Segmentation & Registration Toolkit\n Module: ShapeDetectApp.cxx\n Language: C++\n Date: $Date$\n Version: $Revision$\n\n Copyright (c) 2002 Insight Consortium. All rights reserved.\n See ITKCopyright.txt or http:\/\/www.itk.org\/HTML\/Copyright.htm for details.\n\n This software is distributed WITHOUT ANY WARRANTY; without even \n the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR \n PURPOSE. See the above copyright notices for more information.\n\n=========================================================================*\/\n#include \"ShapeDetectApp.h\"\n#include \"AppUtility.h\"\n\n#include \"RawVolumeReader.h\"\n#include \"itkImageRegionIterator.h\"\n#include \"itkImageMapper.h\"\n#include \"itkExceptionObject.h\"\n\n#include \"itkFastMarchingImageFilter.h\"\n\n#include \"vnl\/vnl_math.h\"\n\n#include <string>\n\n\nShapeDetectApp\n::ShapeDetectApp()\n{\n this->Initialize();\n}\n\n\nvoid\nShapeDetectApp\n::Initialize()\n{\n\n m_InputImage = InputImageType::New();\n m_EdgePotentialImage = ImageType::New();\n m_SegmentationMask = ImageType::New();\n m_DetectionFilter = DetectionFilterType::New();\n\n m_Sigma = 1.0;\n\n m_DumpPGMFiles = true;\n\n}\n\n\nvoid\nShapeDetectApp\n::Execute()\n{\n\n char currentLine[150];\n char buffer[150];\n unsigned int uNumbers[3];\n float fValue;\n char symbol;\n\n std::cout << std::endl;\n\n \/\/ Get input file name\n while(1)\n {\n std::cout << \"Input file name: \";\n std::cin.getline( currentLine, 150);\n if( sscanf( currentLine, \"%s\", buffer ) >= 1 ) break;\n std::cout << \"Error: filename expected.\" << std::endl;\n }\n m_InputFileName = buffer;\n\n \/\/ Get big endian flag\n while(1)\n {\n std::cout << \"Input image big endian? [y|n]: \";\n std::cin.getline( currentLine, 150 );\n if( sscanf( currentLine, \"%c\", &symbol ) >= 1 &&\n ( symbol == 'y' || symbol == 'n' ) ) break;\n std::cout << \"Error: 'y' or 'n' expected.\" << std::endl;\n } \n if( symbol == 'y' )\n {\n m_InputBigEndian = true;\n }\n else\n {\n m_InputBigEndian = false;\n }\n\n \/\/ Get input file size\n while(1)\n {\n std::cout << \"Input image size: \";\n std::cin.getline( currentLine, 150 );\n if( sscanf( currentLine, \"%d%d%d\", uNumbers, uNumbers+1, uNumbers+2 ) >= 3 ) break;\n std::cout << \"Error: three unsigned integers expected.\" << std::endl;\n } \n for( int j = 0; j < ImageDimension; j++ )\n {\n m_InputSize[j] = uNumbers[j];\n }\n\n\n \/\/ Read in input image\n if( !this->ReadImage( m_InputFileName.c_str(), m_InputSize, \n m_InputBigEndian, m_InputImage ) )\n {\n std::cout << \"Error while reading in input volume: \";\n std::cout << m_InputFileName.c_str() << std::endl;\n return;\n }\n\n \/\/ Get input file name\n while(1)\n {\n std::cout << \"PGM output directory: \";\n std::cin.getline( currentLine, 150);\n if( sscanf( currentLine, \"%s\", buffer ) >= 1 ) break;\n std::cout << \"Error: directory name expected.\" << std::endl;\n }\n m_PGMDirectory = buffer;\n\n if( m_DumpPGMFiles )\n {\n \/\/dump out the input image\n std::cout << \"Writing PGM files of the input volume.\" << std::endl;\n if( !WritePGMFiles<InputImageType>( \n m_InputImage, m_PGMDirectory.c_str(), \"input\" ))\n { \n std::cout << \"Error while writing PGM files.\";\n std::cout << \"Please make sure the path is valid.\" << std::endl; \n return; \n }\n }\n\n this->ComputeEdgePotentialMap();\n\n std::cout << std::endl << std::endl;\n \/\/ Set the initial seed\n while(1)\n {\n std::cout << \"Set initial seed index: \";\n std::cin.getline( currentLine, 150 );\n if( sscanf( currentLine, \"%d%d%d\", uNumbers, uNumbers+1, uNumbers+2 ) >= 3 ) break;\n std::cout << \"Error: three unsigned integers expected.\" << std::endl;\n } \n for( int j = 0; j < ImageDimension; j++ )\n {\n m_Seed[j] = uNumbers[j];\n }\n \n \n \/\/ run the filter\n std::cout << \"Generating time crossing map.\" << std::endl;\n this->ComputeTimeCrossingMap();\n\n\n while(1)\n {\n std::cout << std::endl << \"Command [s|t|d|x]: \";\n std::cin.getline( currentLine, 150 );\n if( sscanf( currentLine, \"%s\", buffer ) >= 1 )\n {\n \/\/ parse the command\n switch ( buffer[0] )\n {\n case 's' :\n if( sscanf( currentLine, \"%c%d%d%d\", &symbol, uNumbers, uNumbers+1, uNumbers+2 ) != 4 )\n {\n std::cout << \"Error: three unsigned integers expected\" << std::endl;\n continue;\n }\n for( int j = 0; j < ImageDimension; j++ )\n {\n m_Seed[j] = uNumbers[j];\n }\n std::cout << \"Re-generating time crossing map.\" << std::endl;\n this->ComputeTimeCrossingMap();\n this->ThresholdTimeCrossingMap();\n this->WriteSegmentationImage();\n break;\n case 't' :\n if( sscanf( currentLine, \"%c%f\", &symbol, &fValue ) != 2 )\n {\n std::cout << \"Error: one floating point value expected\" << std::endl;\n continue;\n }\n m_Threshold = fValue;;\n std::cout << \"Re-thresholding time crossing map.\" << std::endl;\n this->ThresholdTimeCrossingMap();\n this->WriteSegmentationImage();\n break;\n break;\n case 'd':\n std::cout << \"Seed: \" << m_Seed << \"Threshold: \" << m_Threshold << std::endl;\n break;\n case 'x' :\n std::cout << \"Goodbye. \" << std::endl;\n return;\n break;\n default :\n std::cout << \"Not a valid command.\" << std::endl;\n } \/\/end switch\n\n }\n \n } \/\/end while\n\n}\n\n\nvoid\nShapeDetectApp\n::ComputeTimeCrossingMap()\n{\n\n \/\/ connect edge potential map\n m_DetectionFilter->SetSpeedImage( m_EdgePotentialImage );\n \n \/\/ setup trial points\n typedef DetectionFilterType::NodeType NodeType;\n typedef DetectionFilterType::NodeContainer NodeContainer;\n\n NodeContainer::Pointer trialPoints = NodeContainer::New();\n\n NodeType node;\n \n node.SetValue( 0.0 );\n node.SetIndex( m_Seed );\n trialPoints->InsertElement(0, node);\n \n m_DetectionFilter->SetTrialPoints( trialPoints );\n\n \/\/ specify the size of the output image\n m_DetectionFilter->SetOutputSize( m_InputImage->GetBufferedRegion().GetSize() );\n\n \/\/ update the marcher\n m_DetectionFilter->Update();\n\n}\n\n\nvoid\nShapeDetectApp\n::ThresholdTimeCrossingMap()\n{\n\n \/\/ threshold the time crossing map\n m_SegmentationMask->SetLargestPossibleRegion(\n m_InputImage->GetLargestPossibleRegion() );\n m_SegmentationMask->SetBufferedRegion(\n m_InputImage->GetBufferedRegion() );\n m_SegmentationMask->Allocate();\n\n typedef itk::ImageRegionIterator<ImageType>\n Iterator;\n Iterator inIter( m_DetectionFilter->GetOutput(),\n m_DetectionFilter->GetOutput()->GetBufferedRegion() );\n\n Iterator outIter( m_SegmentationMask,\n m_SegmentationMask->GetBufferedRegion() );\n\n while( !inIter.IsAtEnd() )\n {\n if( inIter.Get() <= m_Threshold )\n {\n outIter.Set( 1 );\n }\n else\n {\n outIter.Set( 0 );\n }\n ++inIter;\n ++outIter;\n }\n\n}\n\nvoid\nShapeDetectApp\n::WriteSegmentationImage()\n{\n\n if( m_DumpPGMFiles )\n {\n \/\/dump out the segmented image\n if( !WritePGMFiles<ImageType>( m_SegmentationMask, m_PGMDirectory.c_str(), \"seg\" ) )\n { \n std::cout << \"Error while writing PGM files.\";\n std::cout << \"Please make sure the path is valid.\" << std::endl; \n return; \n }\n }\n\n}\n\n\nvoid\nShapeDetectApp\n::ComputeEdgePotentialMap()\n{\n\n \/\/ compute derivative of the input image\n DerivativeFilterPointer deriv = DerivativeFilterType::New();\n deriv->SetInput( m_InputImage );\n deriv->SetSigma( m_Sigma );\n deriv->Update();\n\n \/\/ allocate memory for the map\n m_EdgePotentialImage->SetLargestPossibleRegion(\n m_InputImage->GetLargestPossibleRegion() );\n m_EdgePotentialImage->SetBufferedRegion(\n m_InputImage->GetBufferedRegion() );\n m_EdgePotentialImage->Allocate();\n\n \/\/****\n \/\/FIXME - use an itk filter once API are consistent\n \/\/****\n \/\/ compute the magnitude \n typedef itk::ImageRegionIterator<DerivativeImageType> \n DerivativeIterator;\n typedef itk::ImageRegionIterator<ImageType>\n ImageIterator;\n\n DerivativeIterator derivIter( deriv->GetOutput(),\n deriv->GetOutput()->GetBufferedRegion() );\n ImageIterator mapIter( m_EdgePotentialImage,\n m_EdgePotentialImage->GetBufferedRegion() );\n\n while( !derivIter.IsAtEnd() )\n {\n\n float accum = 0;\n VectorType grad = derivIter.Get();\n\n for( int j = 0; j < ImageDimension; j++ )\n {\n accum += vnl_math_sqr( grad[j] );\n }\n \n accum = vnl_math_sqrt( accum );\n\/\/ mapIter.Set( 1.0 \/ ( 1.0 + accum ) );\n mapIter.Set( exp( -1.0 * accum ) );\n\n ++derivIter;\n ++mapIter;\n\n } \n\n\n if( m_DumpPGMFiles )\n {\n \/\/dump out the input image\n std::cout << \"Writing PGM files of the edge potential map.\" << std::endl;\n if( !WritePGMFiles<ImageType>( \n m_EdgePotentialImage, m_PGMDirectory.c_str(), \"map\" ))\n { \n std::cout << \"Error while writing PGM files.\";\n std::cout << \"Please make sure the path is valid.\" << std::endl; \n return; \n }\n } \n\n}\n\n\nbool \nShapeDetectApp\n::ReadImage(\nconst char * filename,\nconst SizeType& size,\nbool bigEndian,\nInputImageType::Pointer & imgPtr\n)\n{\n\n \/\/ Read in a raw volume\n typedef itk::RawVolumeReader<InputPixelType,InputImageType> ReaderType;\n ReaderType::Pointer reader = ReaderType::New();\n \n reader->SetFileName( filename );\n reader->SetBigEndian( bigEndian );\n reader->SetSize( size );\n reader->Execute();\n\n imgPtr = reader->GetImage();\n\n return true;\n}\n\n\n<commit_msg>ENH: Unused #include ImageMapper removed.<commit_after>\/*=========================================================================\n\n Program: Insight Segmentation & Registration Toolkit\n Module: ShapeDetectApp.cxx\n Language: C++\n Date: $Date$\n Version: $Revision$\n\n Copyright (c) 2002 Insight Consortium. All rights reserved.\n See ITKCopyright.txt or http:\/\/www.itk.org\/HTML\/Copyright.htm for details.\n\n This software is distributed WITHOUT ANY WARRANTY; without even \n the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR \n PURPOSE. See the above copyright notices for more information.\n\n=========================================================================*\/\n#include \"ShapeDetectApp.h\"\n#include \"AppUtility.h\"\n\n#include \"RawVolumeReader.h\"\n#include \"itkImageRegionIterator.h\"\n#include \"itkExceptionObject.h\"\n\n#include \"itkFastMarchingImageFilter.h\"\n\n#include \"vnl\/vnl_math.h\"\n\n#include <string>\n\n\nShapeDetectApp\n::ShapeDetectApp()\n{\n this->Initialize();\n}\n\n\nvoid\nShapeDetectApp\n::Initialize()\n{\n\n m_InputImage = InputImageType::New();\n m_EdgePotentialImage = ImageType::New();\n m_SegmentationMask = ImageType::New();\n m_DetectionFilter = DetectionFilterType::New();\n\n m_Sigma = 1.0;\n\n m_DumpPGMFiles = true;\n\n}\n\n\nvoid\nShapeDetectApp\n::Execute()\n{\n\n char currentLine[150];\n char buffer[150];\n unsigned int uNumbers[3];\n float fValue;\n char symbol;\n\n std::cout << std::endl;\n\n \/\/ Get input file name\n while(1)\n {\n std::cout << \"Input file name: \";\n std::cin.getline( currentLine, 150);\n if( sscanf( currentLine, \"%s\", buffer ) >= 1 ) break;\n std::cout << \"Error: filename expected.\" << std::endl;\n }\n m_InputFileName = buffer;\n\n \/\/ Get big endian flag\n while(1)\n {\n std::cout << \"Input image big endian? [y|n]: \";\n std::cin.getline( currentLine, 150 );\n if( sscanf( currentLine, \"%c\", &symbol ) >= 1 &&\n ( symbol == 'y' || symbol == 'n' ) ) break;\n std::cout << \"Error: 'y' or 'n' expected.\" << std::endl;\n } \n if( symbol == 'y' )\n {\n m_InputBigEndian = true;\n }\n else\n {\n m_InputBigEndian = false;\n }\n\n \/\/ Get input file size\n while(1)\n {\n std::cout << \"Input image size: \";\n std::cin.getline( currentLine, 150 );\n if( sscanf( currentLine, \"%d%d%d\", uNumbers, uNumbers+1, uNumbers+2 ) >= 3 ) break;\n std::cout << \"Error: three unsigned integers expected.\" << std::endl;\n } \n for( int j = 0; j < ImageDimension; j++ )\n {\n m_InputSize[j] = uNumbers[j];\n }\n\n\n \/\/ Read in input image\n if( !this->ReadImage( m_InputFileName.c_str(), m_InputSize, \n m_InputBigEndian, m_InputImage ) )\n {\n std::cout << \"Error while reading in input volume: \";\n std::cout << m_InputFileName.c_str() << std::endl;\n return;\n }\n\n \/\/ Get input file name\n while(1)\n {\n std::cout << \"PGM output directory: \";\n std::cin.getline( currentLine, 150);\n if( sscanf( currentLine, \"%s\", buffer ) >= 1 ) break;\n std::cout << \"Error: directory name expected.\" << std::endl;\n }\n m_PGMDirectory = buffer;\n\n if( m_DumpPGMFiles )\n {\n \/\/dump out the input image\n std::cout << \"Writing PGM files of the input volume.\" << std::endl;\n if( !WritePGMFiles<InputImageType>( \n m_InputImage, m_PGMDirectory.c_str(), \"input\" ))\n { \n std::cout << \"Error while writing PGM files.\";\n std::cout << \"Please make sure the path is valid.\" << std::endl; \n return; \n }\n }\n\n this->ComputeEdgePotentialMap();\n\n std::cout << std::endl << std::endl;\n \/\/ Set the initial seed\n while(1)\n {\n std::cout << \"Set initial seed index: \";\n std::cin.getline( currentLine, 150 );\n if( sscanf( currentLine, \"%d%d%d\", uNumbers, uNumbers+1, uNumbers+2 ) >= 3 ) break;\n std::cout << \"Error: three unsigned integers expected.\" << std::endl;\n } \n for( int j = 0; j < ImageDimension; j++ )\n {\n m_Seed[j] = uNumbers[j];\n }\n \n \n \/\/ run the filter\n std::cout << \"Generating time crossing map.\" << std::endl;\n this->ComputeTimeCrossingMap();\n\n\n while(1)\n {\n std::cout << std::endl << \"Command [s|t|d|x]: \";\n std::cin.getline( currentLine, 150 );\n if( sscanf( currentLine, \"%s\", buffer ) >= 1 )\n {\n \/\/ parse the command\n switch ( buffer[0] )\n {\n case 's' :\n if( sscanf( currentLine, \"%c%d%d%d\", &symbol, uNumbers, uNumbers+1, uNumbers+2 ) != 4 )\n {\n std::cout << \"Error: three unsigned integers expected\" << std::endl;\n continue;\n }\n for( int j = 0; j < ImageDimension; j++ )\n {\n m_Seed[j] = uNumbers[j];\n }\n std::cout << \"Re-generating time crossing map.\" << std::endl;\n this->ComputeTimeCrossingMap();\n this->ThresholdTimeCrossingMap();\n this->WriteSegmentationImage();\n break;\n case 't' :\n if( sscanf( currentLine, \"%c%f\", &symbol, &fValue ) != 2 )\n {\n std::cout << \"Error: one floating point value expected\" << std::endl;\n continue;\n }\n m_Threshold = fValue;;\n std::cout << \"Re-thresholding time crossing map.\" << std::endl;\n this->ThresholdTimeCrossingMap();\n this->WriteSegmentationImage();\n break;\n break;\n case 'd':\n std::cout << \"Seed: \" << m_Seed << \"Threshold: \" << m_Threshold << std::endl;\n break;\n case 'x' :\n std::cout << \"Goodbye. \" << std::endl;\n return;\n break;\n default :\n std::cout << \"Not a valid command.\" << std::endl;\n } \/\/end switch\n\n }\n \n } \/\/end while\n\n}\n\n\nvoid\nShapeDetectApp\n::ComputeTimeCrossingMap()\n{\n\n \/\/ connect edge potential map\n m_DetectionFilter->SetSpeedImage( m_EdgePotentialImage );\n \n \/\/ setup trial points\n typedef DetectionFilterType::NodeType NodeType;\n typedef DetectionFilterType::NodeContainer NodeContainer;\n\n NodeContainer::Pointer trialPoints = NodeContainer::New();\n\n NodeType node;\n \n node.SetValue( 0.0 );\n node.SetIndex( m_Seed );\n trialPoints->InsertElement(0, node);\n \n m_DetectionFilter->SetTrialPoints( trialPoints );\n\n \/\/ specify the size of the output image\n m_DetectionFilter->SetOutputSize( m_InputImage->GetBufferedRegion().GetSize() );\n\n \/\/ update the marcher\n m_DetectionFilter->Update();\n\n}\n\n\nvoid\nShapeDetectApp\n::ThresholdTimeCrossingMap()\n{\n\n \/\/ threshold the time crossing map\n m_SegmentationMask->SetLargestPossibleRegion(\n m_InputImage->GetLargestPossibleRegion() );\n m_SegmentationMask->SetBufferedRegion(\n m_InputImage->GetBufferedRegion() );\n m_SegmentationMask->Allocate();\n\n typedef itk::ImageRegionIterator<ImageType>\n Iterator;\n Iterator inIter( m_DetectionFilter->GetOutput(),\n m_DetectionFilter->GetOutput()->GetBufferedRegion() );\n\n Iterator outIter( m_SegmentationMask,\n m_SegmentationMask->GetBufferedRegion() );\n\n while( !inIter.IsAtEnd() )\n {\n if( inIter.Get() <= m_Threshold )\n {\n outIter.Set( 1 );\n }\n else\n {\n outIter.Set( 0 );\n }\n ++inIter;\n ++outIter;\n }\n\n}\n\nvoid\nShapeDetectApp\n::WriteSegmentationImage()\n{\n\n if( m_DumpPGMFiles )\n {\n \/\/dump out the segmented image\n if( !WritePGMFiles<ImageType>( m_SegmentationMask, m_PGMDirectory.c_str(), \"seg\" ) )\n { \n std::cout << \"Error while writing PGM files.\";\n std::cout << \"Please make sure the path is valid.\" << std::endl; \n return; \n }\n }\n\n}\n\n\nvoid\nShapeDetectApp\n::ComputeEdgePotentialMap()\n{\n\n \/\/ compute derivative of the input image\n DerivativeFilterPointer deriv = DerivativeFilterType::New();\n deriv->SetInput( m_InputImage );\n deriv->SetSigma( m_Sigma );\n deriv->Update();\n\n \/\/ allocate memory for the map\n m_EdgePotentialImage->SetLargestPossibleRegion(\n m_InputImage->GetLargestPossibleRegion() );\n m_EdgePotentialImage->SetBufferedRegion(\n m_InputImage->GetBufferedRegion() );\n m_EdgePotentialImage->Allocate();\n\n \/\/****\n \/\/FIXME - use an itk filter once API are consistent\n \/\/****\n \/\/ compute the magnitude \n typedef itk::ImageRegionIterator<DerivativeImageType> \n DerivativeIterator;\n typedef itk::ImageRegionIterator<ImageType>\n ImageIterator;\n\n DerivativeIterator derivIter( deriv->GetOutput(),\n deriv->GetOutput()->GetBufferedRegion() );\n ImageIterator mapIter( m_EdgePotentialImage,\n m_EdgePotentialImage->GetBufferedRegion() );\n\n while( !derivIter.IsAtEnd() )\n {\n\n float accum = 0;\n VectorType grad = derivIter.Get();\n\n for( int j = 0; j < ImageDimension; j++ )\n {\n accum += vnl_math_sqr( grad[j] );\n }\n \n accum = vnl_math_sqrt( accum );\n\/\/ mapIter.Set( 1.0 \/ ( 1.0 + accum ) );\n mapIter.Set( exp( -1.0 * accum ) );\n\n ++derivIter;\n ++mapIter;\n\n } \n\n\n if( m_DumpPGMFiles )\n {\n \/\/dump out the input image\n std::cout << \"Writing PGM files of the edge potential map.\" << std::endl;\n if( !WritePGMFiles<ImageType>( \n m_EdgePotentialImage, m_PGMDirectory.c_str(), \"map\" ))\n { \n std::cout << \"Error while writing PGM files.\";\n std::cout << \"Please make sure the path is valid.\" << std::endl; \n return; \n }\n } \n\n}\n\n\nbool \nShapeDetectApp\n::ReadImage(\nconst char * filename,\nconst SizeType& size,\nbool bigEndian,\nInputImageType::Pointer & imgPtr\n)\n{\n\n \/\/ Read in a raw volume\n typedef itk::RawVolumeReader<InputPixelType,InputImageType> ReaderType;\n ReaderType::Pointer reader = ReaderType::New();\n \n reader->SetFileName( filename );\n reader->SetBigEndian( bigEndian );\n reader->SetSize( size );\n reader->Execute();\n\n imgPtr = reader->GetImage();\n\n return true;\n}\n\n\n<|endoftext|>"} {"text":"<commit_before>#include \"csvreader.h\"\n#include <QFile>\n#include <QDateTime>\n#include <QString>\n#include <QByteArray>\n\/\/#include <QTextStream>\n#include <QDebug>\n\n\/\/+---------------------------------------------------------------------------+\n\/*\nQTextStream& operator>>( QTextStream &out, Header &header )\n{\n QString buffer = out.readLine();\n qDebug() << buffer;\n header.Version = buffer.section( ';', 0, 0 ).toInt();\n for(int i = 0; i < buffer.section( ';', 1, 1 ).size(); i++)\n header.Copyright[i] = (QChar)buffer.section( ';', 1, 1 )[i];\n for(int i = 0; i < buffer.section( ';', 2, 2 ).size(); i++)\n header.Symbol[i] = (QChar)buffer.section( ';', 2, 2 )[i];\n header.Period = buffer.section( ';', 3, 3 ).toInt();\n header.Digits = buffer.section( ';', 4, 4 ).toInt();\n header.TimeSign = QDateTime::fromString( buffer.section( ';', 5, 5 ), \"yyyy.MM.dd hh:mm:ss\" ).toMSecsSinceEpoch()\/1000;\n header.LastSync = QDateTime::fromString( buffer.section( ';', 6, 6 ), \"yyyy.MM.dd hh:mm:ss\" ).toMSecsSinceEpoch()\/1000;\n\n return out;\n}\nQTextStream& operator>>( QTextStream &out, History &history )\n{\n QString buffer = out.readLine();\n qDebug() << buffer;\n history.Time = QDateTime::fromString( buffer.section( ';', 0, 0 ), \"yyyy.MM.dd hh:mm:ss\" ).toMSecsSinceEpoch()\/1000;\n history.Open = buffer.section( ';', 1, 1 ).toDouble();\n history.High = buffer.section( ';', 2, 2 ).toDouble();\n history.Low = buffer.section( ';', 3, 3 ).toDouble();\n history.Close = buffer.section( ';', 4, 4 ).toDouble();\n history.Volume = buffer.section( ';', 5, 5 ).toInt();\n\n return out;\n} *\/\n\n\/\/+---------------------------------------------------------------------------+\nCsvReader::CsvReader(QObject *parent) : QObject(parent), historySize(0)\n{\n header = new Header;\n historyVector = new std::vector<History*>;\n}\n\nCsvReader::CsvReader(QString fName) : historySize(0), fileName(fName)\n{\n header = new Header;\n historyVector = new std::vector<History*>;\n}\n\nCsvReader::~CsvReader()\n{\n if( header != nullptr )\n delete header;\n if( (historyVector != nullptr) && !historyVector->empty() )\n {\n for(uint i = 0; i < historySize; i++)\n delete (*historyVector)[i];\n delete historyVector;\n }\n}\n\nHeader *CsvReader::readHeader(QFile &f)\n{\n QByteArray byteArr = f.readLine();\n QString buffer = byteArr.data();\n if( buffer == \"\")\n return nullptr;\n\n Header *header = new Header;\n header->Version = buffer.section( ';', 0, 0 ).toInt();\n for(int i = 0; i < buffer.section( ';', 1, 1 ).size(); i++)\n header->Copyright[i] = (QChar)buffer.section( ';', 1, 1 )[i];\n for(int i = 0; i < buffer.section( ';', 2, 2 ).size(); i++)\n header->Symbol[i] = (QChar)buffer.section( ';', 2, 2 )[i];\n header->Period = buffer.section( ';', 3, 3 ).toInt();\n header->Digits = buffer.section( ';', 4, 4 ).toInt();\n header->TimeSign = QDateTime::fromString( buffer.section( ';', 5, 5 ), \"yyyy.MM.dd hh:mm:ss\" ).toMSecsSinceEpoch()\/1000;\n header->LastSync = QDateTime::fromString( buffer.section( ';', 6, 6 ), \"yyyy.MM.dd hh:mm:ss\" ).toMSecsSinceEpoch()\/1000;\n\n return header;\n}\n\nHistory *CsvReader::readHistory(QFile &f)\n{\n QByteArray byteArr = f.readLine();\n QString buffer = byteArr.data();\n if( buffer == \"\")\n return nullptr;\n\n History *history = new History;\n history->Time = QDateTime::fromString( buffer.section( ';', 0, 0 ), \"yyyy.MM.dd hh:mm:ss\" ).toMSecsSinceEpoch()\/1000;\n history->Open = buffer.section( ';', 1, 1 ).toDouble();\n history->High = buffer.section( ';', 2, 2 ).toDouble();\n history->Low = buffer.section( ';', 3, 3 ).toDouble();\n history->Close = buffer.section( ';', 4, 4 ).toDouble();\n history->Volume = buffer.section( ';', 5, 5 ).toInt();\n\n return history;\n}\n\nvoid CsvReader::setFileName(QString fName)\n{\n fileName = fName;\n}\n\nQString CsvReader::getFileName() const\n{\n return fileName;\n}\n\nuint CsvReader::getHistorySize() const\n{\n return historySize;\n}\n\nbool CsvReader::readFromFile()\n{\n QFile file(fileName, this);\n\n if(file.open(QIODevice::ReadOnly))\n {\n fileExists = true;\n\n \/\/QTextStream input( &file );\n \/\/input.setAutoDetectUnicode( true );\n \/\/input >> header;\n\n header = readHeader( file );\n\n History *historyLine = readHistory( file );\n while( historyLine != nullptr )\n {\n historyVector->push_back( historyLine );\n historySize++;\n historyLine = readHistory( file );\n }\n \/*\n while( !file.atEnd() )\n {\n History *historyLine = new History;\n input >> *historyLine;\n historyVector->push_back(historyLine);\n historySize++;\n } *\/\n\n file.close();\n return fileExists;\n }\n else\n {\n fileExists = false;\n return fileExists;\n }\n}\n\nHeader *CsvReader::getHeaderStruct()\n{\n return header;\n}\n\nQString CsvReader::getHeaderString() const\n{\n if(fileExists)\n return QString(\"%1, %2, %3, %4, %5, %6, %7\")\n .arg( header->Version )\n .arg( QString(header->Copyright) )\n .arg( QString(header->Symbol) )\n .arg( header->Period )\n .arg( header->Digits )\n .arg( QDateTime::fromTime_t( header->TimeSign )\n .toString(\"yyyy.MM.dd hh:mm:ss\") )\n .arg( QDateTime::fromTime_t( header->LastSync )\n .toString(\"yyyy.MM.dd hh:mm:ss\") );\n return \"File not exists.\";\n}\n\nstd::vector<History*> *CsvReader::getHistoryVector()\n{\n return historyVector;\n}\n\nQString CsvReader::getHistoryString(uint numberPosition) const\n{\n if( fileExists )\n return QString(\"%1, %2, %3, %4, %5, %6\")\n .arg( QDateTime::fromTime_t( (*historyVector)[numberPosition]->Time )\n .toString(\"yyyy.MM.dd hh:mm:ss\") )\n .arg( (*historyVector)[numberPosition]->Open , header->Digits, 'f' )\n .arg( (*historyVector)[numberPosition]->High , header->Digits, 'f' )\n .arg( (*historyVector)[numberPosition]->Low , header->Digits, 'f' )\n .arg( (*historyVector)[numberPosition]->Close , header->Digits, 'f' )\n .arg( (*historyVector)[numberPosition]->Volume );\n return \"File not exists.\";\n}\n<commit_msg>- update;<commit_after>#include \"csvreader.h\"\n#include <QFile>\n#include <QDateTime>\n#include <QString>\n#include <QByteArray>\n\/\/#include <QTextStream>\n\n\/\/+---------------------------------------------------------------------------+\n\/*\nQTextStream& operator>>( QTextStream &out, Header &header )\n{\n QString buffer = out.readLine();\n qDebug() << buffer;\n header.Version = buffer.section( ';', 0, 0 ).toInt();\n for(int i = 0; i < buffer.section( ';', 1, 1 ).size(); i++)\n header.Copyright[i] = (QChar)buffer.section( ';', 1, 1 )[i];\n for(int i = 0; i < buffer.section( ';', 2, 2 ).size(); i++)\n header.Symbol[i] = (QChar)buffer.section( ';', 2, 2 )[i];\n header.Period = buffer.section( ';', 3, 3 ).toInt();\n header.Digits = buffer.section( ';', 4, 4 ).toInt();\n header.TimeSign = QDateTime::fromString( buffer.section( ';', 5, 5 ), \"yyyy.MM.dd hh:mm:ss\" ).toMSecsSinceEpoch()\/1000;\n header.LastSync = QDateTime::fromString( buffer.section( ';', 6, 6 ), \"yyyy.MM.dd hh:mm:ss\" ).toMSecsSinceEpoch()\/1000;\n\n return out;\n}\nQTextStream& operator>>( QTextStream &out, History &history )\n{\n QString buffer = out.readLine();\n qDebug() << buffer;\n history.Time = QDateTime::fromString( buffer.section( ';', 0, 0 ), \"yyyy.MM.dd hh:mm:ss\" ).toMSecsSinceEpoch()\/1000;\n history.Open = buffer.section( ';', 1, 1 ).toDouble();\n history.High = buffer.section( ';', 2, 2 ).toDouble();\n history.Low = buffer.section( ';', 3, 3 ).toDouble();\n history.Close = buffer.section( ';', 4, 4 ).toDouble();\n history.Volume = buffer.section( ';', 5, 5 ).toInt();\n\n return out;\n} *\/\n\n\/\/+---------------------------------------------------------------------------+\nCsvReader::CsvReader(QObject *parent) : QObject(parent), historySize(0)\n{\n header = new Header;\n historyVector = new std::vector<History*>;\n}\n\nCsvReader::CsvReader(QString fName) : historySize(0), fileName(fName)\n{\n header = new Header;\n historyVector = new std::vector<History*>;\n}\n\nCsvReader::~CsvReader()\n{\n if( header != nullptr )\n delete header;\n if( (historyVector != nullptr) && !historyVector->empty() )\n {\n for(uint i = 0; i < historySize; i++)\n delete (*historyVector)[i];\n delete historyVector;\n }\n}\n\nHeader *CsvReader::readHeader(QFile &f)\n{\n QByteArray byteArr = f.readLine();\n QString buffer = byteArr.data();\n if( buffer == \"\")\n return nullptr;\n\n Header *header = new Header;\n header->Version = buffer.section( ';', 0, 0 ).toInt();\n for(int i = 0; i < buffer.section( ';', 1, 1 ).size(); i++)\n header->Copyright[i] = (QChar)buffer.section( ';', 1, 1 )[i];\n for(int i = 0; i < buffer.section( ';', 2, 2 ).size(); i++)\n header->Symbol[i] = (QChar)buffer.section( ';', 2, 2 )[i];\n header->Period = buffer.section( ';', 3, 3 ).toInt();\n header->Digits = buffer.section( ';', 4, 4 ).toInt();\n header->TimeSign = QDateTime::fromString( buffer.section( ';', 5, 5 ), \"yyyy.MM.dd hh:mm:ss\" ).toMSecsSinceEpoch()\/1000;\n header->LastSync = QDateTime::fromString( buffer.section( ';', 6, 6 ), \"yyyy.MM.dd hh:mm:ss\" ).toMSecsSinceEpoch()\/1000;\n\n return header;\n}\n\nHistory *CsvReader::readHistory(QFile &f)\n{\n QByteArray byteArr = f.readLine();\n QString buffer = byteArr.data();\n if( buffer == \"\")\n return nullptr;\n\n History *history = new History;\n history->Time = QDateTime::fromString( buffer.section( ';', 0, 0 ), \"yyyy.MM.dd hh:mm:ss\" ).toMSecsSinceEpoch()\/1000;\n history->Open = buffer.section( ';', 1, 1 ).toDouble();\n history->High = buffer.section( ';', 2, 2 ).toDouble();\n history->Low = buffer.section( ';', 3, 3 ).toDouble();\n history->Close = buffer.section( ';', 4, 4 ).toDouble();\n history->Volume = buffer.section( ';', 5, 5 ).toInt();\n\n return history;\n}\n\nvoid CsvReader::setFileName(QString fName)\n{\n fileName = fName;\n}\n\nQString CsvReader::getFileName() const\n{\n return fileName;\n}\n\nuint CsvReader::getHistorySize() const\n{\n return historySize;\n}\n\nbool CsvReader::readFromFile()\n{\n QFile file(fileName, this);\n\n if(file.open(QIODevice::ReadOnly))\n {\n fileExists = true;\n\n \/\/QTextStream input( &file );\n \/\/input.setAutoDetectUnicode( true );\n \/\/input >> header;\n\n header = readHeader( file );\n\n History *historyLine = readHistory( file );\n while( historyLine != nullptr )\n {\n historyVector->push_back( historyLine );\n historySize++;\n historyLine = readHistory( file );\n }\n \/*\n while( !file.atEnd() )\n {\n History *historyLine = new History;\n input >> *historyLine;\n historyVector->push_back(historyLine);\n historySize++;\n } *\/\n\n file.close();\n return fileExists;\n }\n else\n {\n fileExists = false;\n return fileExists;\n }\n}\n\nHeader *CsvReader::getHeaderStruct()\n{\n return header;\n}\n\nQString CsvReader::getHeaderString() const\n{\n if(fileExists)\n return QString(\"%1, %2, %3, %4, %5, %6, %7\")\n .arg( header->Version )\n .arg( QString(header->Copyright) )\n .arg( QString(header->Symbol) )\n .arg( header->Period )\n .arg( header->Digits )\n .arg( QDateTime::fromTime_t( header->TimeSign )\n .toString(\"yyyy.MM.dd hh:mm:ss\") )\n .arg( QDateTime::fromTime_t( header->LastSync )\n .toString(\"yyyy.MM.dd hh:mm:ss\") );\n return \"File not exists.\";\n}\n\nstd::vector<History*> *CsvReader::getHistoryVector()\n{\n return historyVector;\n}\n\nQString CsvReader::getHistoryString(uint numberPosition) const\n{\n if( fileExists )\n return QString(\"%1, %2, %3, %4, %5, %6\")\n .arg( QDateTime::fromTime_t( (*historyVector)[numberPosition]->Time )\n .toString(\"yyyy.MM.dd hh:mm:ss\") )\n .arg( (*historyVector)[numberPosition]->Open , header->Digits, 'f' )\n .arg( (*historyVector)[numberPosition]->High , header->Digits, 'f' )\n .arg( (*historyVector)[numberPosition]->Low , header->Digits, 'f' )\n .arg( (*historyVector)[numberPosition]->Close , header->Digits, 'f' )\n .arg( (*historyVector)[numberPosition]->Volume );\n return \"File not exists.\";\n}\n<|endoftext|>"} {"text":"<commit_before>\/* IBM_PROLOG_BEGIN_TAG *\/\n\/* This is an automatically generated prolog. *\/\n\/* *\/\n\/* $Source: $ *\/\n\/* *\/\n\/* OpenPOWER HostBoot Project *\/\n\/* *\/\n\/* Contributors Listed Below - COPYRIGHT 2012,2014 *\/\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 buffer.H\n * @brief definitions for fapi2 variable integral buffers\n *\/\n\n#ifndef __FAPI2_INTEGRAL_BUFFER__\n#define __FAPI2_INTEGRAL_BUFFER__\n\n#include <buffer_base.H>\n#include <return_code.H>\n\nnamespace fapi2\n{\n \/\/\/ @brief Class representing a FAPI buffer<T>\n \/\/\/ @note Buffers support method chaining. So, rather than\n \/\/\/ this\n \/\/\/ @code\n \/\/\/ buffer<T> mask;\n \/\/\/ mask.setBit<B>();\n \/\/\/ mask.invert();\n \/\/\/ my_buffer &= mask;\n \/\/\/ @endcode\n \/\/\/ You can do\n \/\/\/ @code\n \/\/\/ my_buffer &= buffer<T>().setBit<B>.invert();\n \/\/\/ @endcode\n template <typename T>\n class buffer : public buffer_base<T>\n {\n public:\n \/\/\/ Shortcut typedef to map to our traits class\n typedef typename buffer_base<T, buffer>::bits_type bits_type;\n\n \/\/\/\n \/\/\/ @brief Integral buffer assignment constructor\n \/\/\/ @param[in] i_value initial value of the buffer\n \/\/\/ Meaningless for variable types and thus protected.\n \/\/\/\n inline buffer(T i_value = 0)\n {\n \/\/ Why not an initializer list? That would force buffer_base<T>\n \/\/ to have a ctor which took a T, and I want to avoid that in\n \/\/ the generic case: this makes it more clear that the two\n \/\/ ctor's (integral and container) behave very differently.\n \/\/ variable_buffers also have a ctor which takes a single\n \/\/ numerical value, and that represents a bit count, not an\n \/\/ initial value.\n this->iv_data = i_value;\n }\n\n\n \/\/\/ @name Bit\/Word Manipulation Functions\n \/\/\/@{\n\n \/\/\/\n \/\/\/ @brief Return the length of the buffer in bits\n \/\/\/ @return Length in bits\n \/\/\/\n inline constexpr uint32_t getBitLength(void) const\n { return bufferTraits<T>::bit_length(this->iv_data); }\n\n \/\/\/\n \/\/\/ @brief Return the length of the buffer in OT units\n \/\/\/ @return Length in OT units rounded up\n \/\/\/ @tparam OT the type to get the length of. For example, if one\n \/\/\/ wanted the length in double words, OT would be uint64_t\n \/\/\/ (getLength<uint64_t>().) Similarly, to get the length in words,\n \/\/\/ getLength<uin32_t>().\n \/\/\/\n template< typename OT >\n inline constexpr uint32_t getLength(void) const\n {\n return bufferTraits<T>::template size<OT>(this->iv_data);\n }\n\n \/\/\/\n \/\/\/ @brief Templated setBit for integral types\n \/\/\/ @tparam B the bit number to set.\n \/\/\/ @return buffer& Useful for method chaining\n \/\/\/ @note 0 is left-most\n \/\/\/ @note Example: fapi2::buffer<uint64_t>().setBit<3>();\n \/\/\/\n template <bits_type B>\n inline buffer& setBit(void)\n {\n static_assert((B >= 0) &&\n (B < bufferTraits<T>::bits_per_unit), \"failed range check\");\n\n \/\/ Force iv_data to be dependent on the template type to force\n \/\/ its look up in the second phase\n this->iv_data |= (static_cast<T>(1)) << (bufferTraits<T>::bits_per_unit - B - 1);\n return *this;\n }\n\n \/\/\/\n \/\/\/ @brief Clear a bit in buffer\n \/\/\/ @tparam B Bit in buffer to clear.\n \/\/\/ @return buffer& Useful for method chaining\n \/\/\/ @note Asserting that all the parameters are known at\n \/\/\/ compile time so this can be templated only. If that is not\n \/\/\/ the case we can add a function parameter version.\n \/\/\/\n template< bits_type B >\n inline buffer& clearBit(void)\n {\n static_assert((B >= 0) &&\n (B < bufferTraits<T>::bits_per_unit), \"failed range check\");\n\n this->iv_data &= buffer<T>().setBit<B>().invert();\n return *this;\n }\n\n \/\/\/\n \/\/\/ @brief Invert bit\n \/\/\/ @tparam B Bit in buffer to invert.\n \/\/\/ @return buffer& Useful for method chaining\n \/\/\/ @note Asserting that all the parameters are known at\n \/\/\/ compile time so this can be templated only. If that is not\n \/\/\/ the case we can add a function parameter version.\n \/\/\/\n template< bits_type B >\n inline buffer& flipBit(void)\n {\n static_assert((B >= 0) &&\n (B < bufferTraits<T>::bits_per_unit), \"failed range check\");\n\n this->iv_data ^= buffer<T>().setBit<B>();\n return *this;\n }\n\n \/\/\/\n \/\/\/ @brief Set a bit in the buffer\n \/\/\/ @param[in] i_bit the bit number to set.\n \/\/\/ @note 0 is left-most\n \/\/\/ @return FAPI2_RC_SUCCESS if OK\n \/\/\/\n inline fapi2::ReturnCode setBit(const bits_type& i_bit)\n {\n if (i_bit >= bufferTraits<T>::bits_per_unit)\n {\n return FAPI2_RC_INVALID_PARAMETER;\n }\n\n \/\/ Force iv_data to be dependent on the template type to force\n \/\/ its look up in the second phase\n this->iv_data |=\n (static_cast<T>(1)) << (bufferTraits<T>::bits_per_unit - i_bit - 1);\n return FAPI2_RC_SUCCESS;\n }\n\n \/\/\/\n \/\/\/ @brief Get the value of a bit in the buffer\n \/\/\/ @tparam B Bit in buffer to get.\n \/\/\/ @return true if bit is on, false if bit is off\n \/\/\/\n template< bits_type B >\n inline bool getBit(void) const\n {\n return buffer<T>().setBit<B>() & this->iv_data;\n }\n\n \/\/\/@}\n\n \/\/\/ @name Buffer Manipulation Functions\n \/\/\/@{\n\n \/\/ Note: Many (all?) of these are not needed and the compiler complains\n \/\/ as the cast to T yields a better operator. There are here mainly for\n \/\/ documenation purposes.\n\n \/\/\/\n \/\/\/ @brief operator>>()\n \/\/\/\n#ifdef DOXYGEN\n buffer<T>& operator>>(bits_type i_shiftnum);\n#endif\n\n \/\/\/\n \/\/\/ @brief operator<<()\n \/\/\/\n#ifdef DOXYGEN\n buffer<T>& operator<<(bits_type i_shiftnum);\n#endif\n\n \/\/\/\n \/\/\/ @brief operator+()\n \/\/\/\n#ifdef DOXYGEN\n buffer<T>& operator+(const T& rhs);\n#endif\n\n \/\/\/\n \/\/\/ @brief operator+=()\n \/\/\/\n#ifdef DOXYGEN\n buffer<T>& operator+=(const T& rhs);\n#endif\n\n \/\/\/\n \/\/\/ @brief operator|=()\n \/\/\/\n#ifdef DOXYGEN\n buffer<T>& operator|=(const T& rhs);\n#endif\n\n \/\/\/\n \/\/\/ @brief operator&=()\n \/\/\/\n#ifdef DOXYGEN\n buffer<T>& operator&=(const T& rhs);\n#endif\n\n \/\/\/\n \/\/\/ @brief operator|()\n \/\/\/\n#ifdef DOXYGEN\n buffer<T>& operator|(const T& rhs);\n#endif\n\n \/\/\/\n \/\/\/ @brief operator&()\n \/\/\/\n#ifdef DOXYGEN\n buffer<T>& operator&(const T& rhs);\n#endif\n\n \/\/\/\n \/\/\/ @brief operator^=()\n \/\/\/\n#ifdef DOXYGEN\n buffer<T>& operator^=(const T& rhs);\n#endif\n\n \/\/\/\n \/\/\/ @brief operator~()\n \/\/\/\n#ifdef DOXYGEN\n buffer<T>& operator~(const T& rhs) const;\n#endif\n\n \/\/\/\n \/\/\/ @brief operator==()\n \/\/\/\n#ifdef DOXYGEN\n bool operator==(const T& rhs) const;\n#endif\n\n \/\/\/\n \/\/\/ @brief operator!=()\n \/\/\/\n#ifdef DOXYGEN\n bool operator!=(const T& rhs) const;\n#endif\n\n \/\/\/\n \/\/\/ @brief Copy part of a OT into the DataBuffer\n \/\/\/ @tparam TS Start bit to insert into (target start)\n \/\/\/ @tparam L Length of bits to insert\n \/\/\/ @tparam SS Start bit in source\n \/\/\/ @tparam OT the type of the incoming (origin) data\n \/\/\/ @param[in] i_datain OT value to copy into DataBuffer\n \/\/\/ - data is taken left aligned\n \/\/\/ @note Asserting that all the parameters are known at\n \/\/\/ compile time so this can be templated only. If that is not\n \/\/\/ the case we can add a function parameter version.\n \/\/\/\n template<bits_type TS, bits_type L, bits_type SS, typename OT>\n inline void insert(const OT i_datain)\n {\n const bits_type target_length = parameterTraits<T>::bit_length;\n const bits_type source_length = parameterTraits<OT>::bit_length;\n\n \/\/ Error if input data don't make sense\n static_assert((TS + L) <= target_length,\n \"insert(): (Target Start + Len) is out of bounds\");\n static_assert((SS + L) <= source_length,\n \"insert(): (Source Start + Len) is out of bounds\");\n static_assert(TS < target_length,\n \"insert(): Target Start is out of bounds\");\n static_assert(SS < source_length,\n \"insert(): Source Start is out of bounds\");\n\n \/\/ Get mask value for Target buffer\n \/\/ Note: Need \"& ((T)-1) because bit shift left for Target buffer doesn't roll off\n T mask =((T(~0) << (target_length - L)) & T(~0)) >> TS;\n\n \/\/ Calculate the equivalent position of the input Source start for the size of the Target buffer.\n\n \/\/ Assume OT is smaller (sizeof(T) > sizeof(OT))\n uint64_t sourceShift = abs(TS - ((target_length - source_length) + SS));\n uint64_t sourceAlign = T(i_datain) << sourceShift;\n\n if (sizeof(T) == sizeof(OT))\n {\n sourceShift = abs(SS - TS);\n sourceAlign = (SS > TS) ? ((T)i_datain) << sourceShift : ((T)i_datain) >> sourceShift;\n }\n\n if (sizeof(T) < sizeof(OT))\n {\n sourceShift = source_length - target_length;\n if (SS <= sourceShift)\n {\n sourceShift = sourceShift + TS - SS;\n sourceAlign = ((OT)i_datain) >> sourceShift;\n }\n\n \/\/ (SS > sourceShift)\n else\n {\n if (sourceShift > TS)\n {\n sourceShift = SS - sourceShift - TS;\n sourceAlign = OT(i_datain) << sourceShift;\n }\n else\n {\n sourceShift = SS - sourceShift;\n sourceAlign = (sourceShift < TS) ? OT(i_datain) >> sourceShift : OT(i_datain);\n }\n }\n }\n\n this->iv_data = (this->iv_data & ~mask) | (sourceAlign & mask);\n return;\n }\n\n \/\/\/\n \/\/\/ @brief Copy in a right aligned value\n \/\/\/ @tparam SB Start bit to insert into\n \/\/\/ @tparam L Length of bits to insert\n \/\/\/ @tparam OT the type of the incoming (origin) data\n \/\/\/ @param[in] i_datain OT value to copy into DataBuffer\n \/\/\/ - data is taken right aligned\n \/\/\/ @note Data is assumed to be aligned on the word boundary of L\n \/\/\/ @note Asserting that all the parameters are known at\n \/\/\/ compile time so this can be templated only. If that is not\n \/\/\/ the case we can add a function parameter version.\n \/\/\/\n template<bits_type TS, bits_type L, typename OT>\n inline void insertFromRight(const OT i_datain)\n {\n \/\/ Error if input data don't make sense\n static_assert(L < parameterTraits<OT>::bit_length,\n \"insertFromRight(): Len >= input buffer\");\n static_assert(TS < parameterTraits<T>::bit_length,\n \"insertFromRight(): Target Start is out of bounds\");\n static_assert((TS + L) <= parameterTraits<T>::bit_length,\n \"InsertFromRight(): (Target Start + Len) is out of bounds\");\n\n this->insert<TS, L, parameterTraits<OT>::bit_length - L>(i_datain);\n return;\n }\n\n \/\/\/\n \/\/\/ @brief Copy data from this buffer into an OT\n \/\/\/ @tparam TS Start bit to insert into (target start)\n \/\/\/ @tparam L Length of bits to insert\n \/\/\/ @tparam SS Start bit in source\n \/\/\/ @tparam OT the type of the outgoing (target)\n \/\/\/ @param[out] o_out OT to copy into - data is placed left aligned\n \/\/\/ @note Asserting that all the parameters are known at\n \/\/\/ compile time so this can be templated only. If that is not\n \/\/\/ the case we can add a function parameter version.\n \/\/\/\n template<bits_type TS, bits_type L, bits_type SS, typename OT>\n inline void extract(OT& o_out)\n {\n \/\/ Extraction is just an insert into o_out\n\n buffer<OT> out(o_out);\n out.insert<TS, L, SS>(this->iv_data);\n o_out = out;\n return;\n }\n\n#if 0\n \/\/\/\n \/\/\/ @brief Copy data from this buffer into an OT and right justify\n \/\/\/ @tparam OT the type of the outgoing data - defaults to T\n \/\/\/ @tparam SB Start bit to insert into - defaults to 0\n \/\/\/ @tparam SS Start bit in o_out - default value is zero\n \/\/\/ @tparam L Length of bits to copy - defaults to sizeof(OT) * 8\n \/\/\/ @param[out] o_out OT to copy into - data is placed right aligned\n \/\/\/ @note Asserting that all the parameters are known at\n \/\/\/ compile time so this can be templated only. If that is not\n \/\/\/ the case we can add a function parameter version.\n \/\/\/ @post Data is copied from specified location to o_out, right\n \/\/\/ aligned. Data is only right aligned if L < sizeof(bits_type)\n \/\/\/\n template< typename OT = T, bits_type L = parameterTraits<OT>::bit_length,\n bits_type SB = 0, bits_type SS = 0 >\n void extractFromRight(OT& o_out);\n#endif\n \/\/\/@}\n };\n};\n\n#endif\n<commit_msg>Add fapi2::buffer<T>::extractToRight()<commit_after>\/* IBM_PROLOG_BEGIN_TAG *\/\n\/* This is an automatically generated prolog. *\/\n\/* *\/\n\/* $Source: $ *\/\n\/* *\/\n\/* OpenPOWER HostBoot Project *\/\n\/* *\/\n\/* Contributors Listed Below - COPYRIGHT 2012,2014 *\/\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 buffer.H\n * @brief definitions for fapi2 variable integral buffers\n *\/\n\n#ifndef __FAPI2_INTEGRAL_BUFFER__\n#define __FAPI2_INTEGRAL_BUFFER__\n\n#include <buffer_base.H>\n#include <return_code.H>\n\nnamespace fapi2\n{\n \/\/\/ @brief Class representing a FAPI buffer<T>\n \/\/\/ @note Buffers support method chaining. So, rather than\n \/\/\/ this\n \/\/\/ @code\n \/\/\/ buffer<T> mask;\n \/\/\/ mask.setBit<B>();\n \/\/\/ mask.invert();\n \/\/\/ my_buffer &= mask;\n \/\/\/ @endcode\n \/\/\/ You can do\n \/\/\/ @code\n \/\/\/ my_buffer &= buffer<T>().setBit<B>.invert();\n \/\/\/ @endcode\n template <typename T>\n class buffer : public buffer_base<T>\n {\n public:\n \/\/\/ Shortcut typedef to map to our traits class\n typedef typename buffer_base<T, buffer>::bits_type bits_type;\n\n \/\/\/\n \/\/\/ @brief Integral buffer assignment constructor\n \/\/\/ @param[in] i_value initial value of the buffer\n \/\/\/ Meaningless for variable types and thus protected.\n \/\/\/\n inline buffer(T i_value = 0)\n {\n \/\/ Why not an initializer list? That would force buffer_base<T>\n \/\/ to have a ctor which took a T, and I want to avoid that in\n \/\/ the generic case: this makes it more clear that the two\n \/\/ ctor's (integral and container) behave very differently.\n \/\/ variable_buffers also have a ctor which takes a single\n \/\/ numerical value, and that represents a bit count, not an\n \/\/ initial value.\n this->iv_data = i_value;\n }\n\n\n \/\/\/ @name Bit\/Word Manipulation Functions\n \/\/\/@{\n\n \/\/\/\n \/\/\/ @brief Return the length of the buffer in bits\n \/\/\/ @return Length in bits\n \/\/\/\n inline constexpr uint32_t getBitLength(void) const\n { return bufferTraits<T>::bit_length(this->iv_data); }\n\n \/\/\/\n \/\/\/ @brief Return the length of the buffer in OT units\n \/\/\/ @return Length in OT units rounded up\n \/\/\/ @tparam OT the type to get the length of. For example, if one\n \/\/\/ wanted the length in double words, OT would be uint64_t\n \/\/\/ (getLength<uint64_t>().) Similarly, to get the length in words,\n \/\/\/ getLength<uin32_t>().\n \/\/\/\n template< typename OT >\n inline constexpr uint32_t getLength(void) const\n {\n return bufferTraits<T>::template size<OT>(this->iv_data);\n }\n\n \/\/\/\n \/\/\/ @brief Templated setBit for integral types\n \/\/\/ @tparam B the bit number to set.\n \/\/\/ @return buffer& Useful for method chaining\n \/\/\/ @note 0 is left-most\n \/\/\/ @note Example: fapi2::buffer<uint64_t>().setBit<3>();\n \/\/\/\n template <bits_type B>\n inline buffer& setBit(void)\n {\n static_assert((B >= 0) &&\n (B < bufferTraits<T>::bits_per_unit), \"failed range check\");\n\n \/\/ Force iv_data to be dependent on the template type to force\n \/\/ its look up in the second phase\n this->iv_data |= (static_cast<T>(1)) << (bufferTraits<T>::bits_per_unit - B - 1);\n return *this;\n }\n\n \/\/\/\n \/\/\/ @brief Clear a bit in buffer\n \/\/\/ @tparam B Bit in buffer to clear.\n \/\/\/ @return buffer& Useful for method chaining\n \/\/\/ @note Asserting that all the parameters are known at\n \/\/\/ compile time so this can be templated only. If that is not\n \/\/\/ the case we can add a function parameter version.\n \/\/\/\n template< bits_type B >\n inline buffer& clearBit(void)\n {\n static_assert((B >= 0) &&\n (B < bufferTraits<T>::bits_per_unit), \"failed range check\");\n\n this->iv_data &= buffer<T>().setBit<B>().invert();\n return *this;\n }\n\n \/\/\/\n \/\/\/ @brief Invert bit\n \/\/\/ @tparam B Bit in buffer to invert.\n \/\/\/ @return buffer& Useful for method chaining\n \/\/\/ @note Asserting that all the parameters are known at\n \/\/\/ compile time so this can be templated only. If that is not\n \/\/\/ the case we can add a function parameter version.\n \/\/\/\n template< bits_type B >\n inline buffer& flipBit(void)\n {\n static_assert((B >= 0) &&\n (B < bufferTraits<T>::bits_per_unit), \"failed range check\");\n\n this->iv_data ^= buffer<T>().setBit<B>();\n return *this;\n }\n\n \/\/\/\n \/\/\/ @brief Set a bit in the buffer\n \/\/\/ @param[in] i_bit the bit number to set.\n \/\/\/ @note 0 is left-most\n \/\/\/ @return FAPI2_RC_SUCCESS if OK\n \/\/\/\n inline fapi2::ReturnCode setBit(const bits_type& i_bit)\n {\n if (i_bit >= bufferTraits<T>::bits_per_unit)\n {\n return FAPI2_RC_INVALID_PARAMETER;\n }\n\n \/\/ Force iv_data to be dependent on the template type to force\n \/\/ its look up in the second phase\n this->iv_data |=\n (static_cast<T>(1)) << (bufferTraits<T>::bits_per_unit - i_bit - 1);\n return FAPI2_RC_SUCCESS;\n }\n\n \/\/\/\n \/\/\/ @brief Get the value of a bit in the buffer\n \/\/\/ @tparam B Bit in buffer to get.\n \/\/\/ @return true if bit is on, false if bit is off\n \/\/\/\n template< bits_type B >\n inline bool getBit(void) const\n {\n return buffer<T>().setBit<B>() & this->iv_data;\n }\n\n \/\/\/@}\n\n \/\/\/ @name Buffer Manipulation Functions\n \/\/\/@{\n\n \/\/ Note: Many (all?) of these are not needed and the compiler complains\n \/\/ as the cast to T yields a better operator. There are here mainly for\n \/\/ documenation purposes.\n\n \/\/\/\n \/\/\/ @brief operator>>()\n \/\/\/\n#ifdef DOXYGEN\n buffer<T>& operator>>(bits_type i_shiftnum);\n#endif\n\n \/\/\/\n \/\/\/ @brief operator<<()\n \/\/\/\n#ifdef DOXYGEN\n buffer<T>& operator<<(bits_type i_shiftnum);\n#endif\n\n \/\/\/\n \/\/\/ @brief operator+()\n \/\/\/\n#ifdef DOXYGEN\n buffer<T>& operator+(const T& rhs);\n#endif\n\n \/\/\/\n \/\/\/ @brief operator+=()\n \/\/\/\n#ifdef DOXYGEN\n buffer<T>& operator+=(const T& rhs);\n#endif\n\n \/\/\/\n \/\/\/ @brief operator|=()\n \/\/\/\n#ifdef DOXYGEN\n buffer<T>& operator|=(const T& rhs);\n#endif\n\n \/\/\/\n \/\/\/ @brief operator&=()\n \/\/\/\n#ifdef DOXYGEN\n buffer<T>& operator&=(const T& rhs);\n#endif\n\n \/\/\/\n \/\/\/ @brief operator|()\n \/\/\/\n#ifdef DOXYGEN\n buffer<T>& operator|(const T& rhs);\n#endif\n\n \/\/\/\n \/\/\/ @brief operator&()\n \/\/\/\n#ifdef DOXYGEN\n buffer<T>& operator&(const T& rhs);\n#endif\n\n \/\/\/\n \/\/\/ @brief operator^=()\n \/\/\/\n#ifdef DOXYGEN\n buffer<T>& operator^=(const T& rhs);\n#endif\n\n \/\/\/\n \/\/\/ @brief operator~()\n \/\/\/\n#ifdef DOXYGEN\n buffer<T>& operator~(const T& rhs) const;\n#endif\n\n \/\/\/\n \/\/\/ @brief operator==()\n \/\/\/\n#ifdef DOXYGEN\n bool operator==(const T& rhs) const;\n#endif\n\n \/\/\/\n \/\/\/ @brief operator!=()\n \/\/\/\n#ifdef DOXYGEN\n bool operator!=(const T& rhs) const;\n#endif\n\n \/\/\/\n \/\/\/ @brief Copy part of a OT into the DataBuffer\n \/\/\/ @tparam TS Start bit to insert into (target start)\n \/\/\/ @tparam L Length of bits to insert\n \/\/\/ @tparam SS Start bit in source\n \/\/\/ @tparam OT the type of the incoming (origin) data\n \/\/\/ @param[in] i_datain OT value to copy into DataBuffer\n \/\/\/ - data is taken left aligned\n \/\/\/ @note Asserting that all the parameters are known at\n \/\/\/ compile time so this can be templated only. If that is not\n \/\/\/ the case we can add a function parameter version.\n \/\/\/\n template<bits_type TS, bits_type L, bits_type SS, typename OT>\n inline void insert(const OT i_datain)\n {\n const bits_type target_length = parameterTraits<T>::bit_length;\n const bits_type source_length = parameterTraits<OT>::bit_length;\n\n \/\/ Error if input data don't make sense\n static_assert((TS + L) <= target_length,\n \"insert(): (Target Start + Len) is out of bounds\");\n static_assert((SS + L) <= source_length,\n \"insert(): (Source Start + Len) is out of bounds\");\n static_assert(TS < target_length,\n \"insert(): Target Start is out of bounds\");\n static_assert(SS < source_length,\n \"insert(): Source Start is out of bounds\");\n\n \/\/ Get mask value for Target buffer\n \/\/ Note: Need \"& ((T)-1) because bit shift left for Target buffer doesn't roll off\n T mask =((T(~0) << (target_length - L)) & T(~0)) >> TS;\n\n \/\/ Calculate the equivalent position of the input Source start for the size of the Target buffer.\n\n \/\/ Assume OT is smaller (sizeof(T) > sizeof(OT))\n uint64_t sourceShift = abs(TS - ((target_length - source_length) + SS));\n uint64_t sourceAlign = T(i_datain) << sourceShift;\n\n if (sizeof(T) == sizeof(OT))\n {\n sourceShift = abs(SS - TS);\n sourceAlign = (SS > TS) ? ((T)i_datain) << sourceShift : ((T)i_datain) >> sourceShift;\n }\n\n if (sizeof(T) < sizeof(OT))\n {\n sourceShift = source_length - target_length;\n if (SS <= sourceShift)\n {\n sourceShift = sourceShift + TS - SS;\n sourceAlign = ((OT)i_datain) >> sourceShift;\n }\n\n \/\/ (SS > sourceShift)\n else\n {\n if (sourceShift > TS)\n {\n sourceShift = SS - sourceShift - TS;\n sourceAlign = OT(i_datain) << sourceShift;\n }\n else\n {\n sourceShift = SS - sourceShift;\n sourceAlign = (sourceShift < TS) ? OT(i_datain) >> sourceShift : OT(i_datain);\n }\n }\n }\n\n this->iv_data = (this->iv_data & ~mask) | (sourceAlign & mask);\n return;\n }\n\n \/\/\/\n \/\/\/ @brief Copy in a right aligned value\n \/\/\/ @tparam SB Start bit to insert into\n \/\/\/ @tparam L Length of bits to insert\n \/\/\/ @tparam OT the type of the incoming (origin) data\n \/\/\/ @param[in] i_datain OT value to copy into DataBuffer\n \/\/\/ - data is taken right aligned\n \/\/\/ @note Data is assumed to be aligned on the word boundary of L\n \/\/\/ @note Asserting that all the parameters are known at\n \/\/\/ compile time so this can be templated only. If that is not\n \/\/\/ the case we can add a function parameter version.\n \/\/\/\n template<bits_type TS, bits_type L, typename OT>\n inline void insertFromRight(const OT i_datain)\n {\n \/\/ Error if input data don't make sense\n static_assert(L < parameterTraits<OT>::bit_length,\n \"insertFromRight(): Len >= input buffer\");\n static_assert(TS < parameterTraits<T>::bit_length,\n \"insertFromRight(): Target Start is out of bounds\");\n static_assert((TS + L) <= parameterTraits<T>::bit_length,\n \"InsertFromRight(): (Target Start + Len) is out of bounds\");\n\n this->insert<TS, L, parameterTraits<OT>::bit_length - L>(i_datain);\n return;\n }\n\n \/\/\/\n \/\/\/ @brief Copy data from this buffer into an OT\n \/\/\/ @tparam TS Start bit to insert into (target start)\n \/\/\/ @tparam L Length of bits to insert\n \/\/\/ @tparam SS Start bit in source\n \/\/\/ @tparam OT the type of the outgoing (target)\n \/\/\/ @param[out] o_out OT to copy into - data is placed left aligned\n \/\/\/ @note Asserting that all the parameters are known at\n \/\/\/ compile time so this can be templated only. If that is not\n \/\/\/ the case we can add a function parameter version.\n \/\/\/\n template<bits_type TS, bits_type L, bits_type SS, typename OT>\n inline void extract(OT& o_out)\n {\n \/\/ Extraction is just an insert into o_out\n\n buffer<OT> out(o_out);\n out.insert<TS, L, SS>(this->iv_data);\n o_out = out;\n return;\n }\n\n \/\/\/\n \/\/\/ @brief Copy data from this buffer into an OT and right justify\n \/\/\/ @tparam SS Start bit to insert into (source start)\n \/\/\/ @tparam L Length of bits to insert\n \/\/\/ @tparam OT the type of the outgoing (target)\n \/\/\/ @param[out] o_out OT to copy into - data is placed right aligned\n \/\/\/ @note Asserting that all the parameters are known at\n \/\/\/ compile time so this can be templated only. If that is not\n \/\/\/ the case we can add a function parameter version.\n \/\/\/\n template<bits_type SS, bits_type L, typename OT>\n inline void extractToRight(OT& o_out)\n {\n extract<parameterTraits<OT>::bit_length - L, L, SS>(o_out);\n return;\n }\n\n \/\/\/@}\n };\n};\n\n#endif\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#include <xcodec\/xcodec_hash.h>\n\nenum FileAction {\n\tNone, Compress, Decompress, Hashes\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#define\tTACK_FLAG_CODEC_TIMING_SAMPLES\t(0x00000010)\n\nstatic void compress(const std::string&, int, int, XCodec *, unsigned, Timer *);\nstatic void decompress(const std::string&, int, int, XCodec *, unsigned, Timer *);\nstatic void hashes(int, int, 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);\nstatic void time_samples(const std::string&, 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 verbose;\n\tFileAction action;\n\tunsigned flags;\n\tint ch;\n\n\taction = None;\n\tflags = 0;\n\tverbose = false;\n\n\twhile ((ch = getopt(argc, argv, \"?cdhsvEQST\")) != -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 'h':\n\t\t\taction = Hashes;\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\tflags |= TACK_FLAG_CODEC_TIMING_SAMPLES;\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 (action == None)\n\t\tusage();\n\n\tif (action == Hashes && (flags & TACK_FLAG_BYTE_STATS) != 0)\n\t\tusage();\n\n\tif ((flags & TACK_FLAG_CODEC_TIMING) == 0 &&\n\t (flags & (TACK_FLAG_CODEC_TIMING_EACH | TACK_FLAG_CODEC_TIMING_SAMPLES)) != 0)\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\tprocess_files(argc, argv, action, &codec, flags);\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 void\nhashes(int ifd, int ofd, unsigned flags, Timer *timer)\n{\n\tBuffer input, output;\n\tBufferSegment *seg;\n\tunsigned o;\n\n\twhile (fill(ifd, &input)) {\n\t\tif ((flags & TACK_FLAG_CODEC_TIMING) != 0)\n\t\t\ttimer->start();\n\t\tXCodecHash xcodec_hash;\n\t\to = 0;\n\t\twhile (!input.empty()) {\n\t\t\tinput.moveout(&seg);\n\n\t\t\tconst uint8_t *p = seg->data();\n\t\t\tconst uint8_t *q = seg->end();\n\t\t\tfor (;;) {\n\t\t\t\twhile (o < XCODEC_SEGMENT_LENGTH && p != q) {\n\t\t\t\t\txcodec_hash.add(*p++);\n\t\t\t\t\to++;\n\t\t\t\t}\n\t\t\t\tif (o == XCODEC_SEGMENT_LENGTH) {\n\t\t\t\t\tuint64_t hash = xcodec_hash.mix();\n\t\t\t\t\txcodec_hash.reset();\n\t\t\t\t\thash = BigEndian::encode(hash);\n\t\t\t\t\toutput.append(&hash);\n\t\t\t\t\to = 0;\n\n\t\t\t\t\tif (p == q)\n\t\t\t\t\t\tbreak;\n\n\t\t\t\t\tcontinue;\n\t\t\t\t}\n\t\t\t\tASSERT(p == q);\n\t\t\t\tbreak;\n\t\t\t}\n\n\t\t\tseg->unref();\n\t\t}\n\t\tif ((flags & TACK_FLAG_CODEC_TIMING) != 0)\n\t\t\ttimer->stop();\n\t\tflush(ofd, &output);\n\t}\n\tASSERT(input.empty());\n\tASSERT(output.empty());\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\tif ((flags & TACK_FLAG_CODEC_TIMING_EACH) != 0) {\n\t\tASSERT(timer == NULL);\n\n\t\ttimer = new Timer();\n\t}\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\tcase Hashes:\n\t\thashes(ifd, ofd, flags, timer);\n\t\tbreak;\n\tdefault:\n\t\tNOTREACHED();\n\t}\n\n\tif ((flags & TACK_FLAG_CODEC_TIMING_EACH) != 0) {\n\t\tif ((flags & TACK_FLAG_CODEC_TIMING_SAMPLES) != 0)\n\t\t\ttime_samples(name, timer);\n\t\telse\n\t\t\ttime_stats(name, timer);\n\t\tdelete timer;\n\t}\n}\n\nstatic void\nprocess_files(int argc, char *argv[], FileAction action, XCodec *codec, unsigned flags)\n{\n\tTimer *timer;\n\tint ifd, ofd;\n\n\tif ((flags & TACK_FLAG_CODEC_TIMING) != 0 &&\n\t (flags & TACK_FLAG_CODEC_TIMING_EACH) == 0)\n\t\ttimer = new Timer();\n\telse\n\t\ttimer = NULL;\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\tif ((flags & TACK_FLAG_CODEC_TIMING) != 0 &&\n\t (flags & TACK_FLAG_CODEC_TIMING_EACH) == 0) {\n\t\tASSERT(timer != NULL);\n\t\tif ((flags & TACK_FLAG_CODEC_TIMING_SAMPLES) != 0)\n\t\t\ttime_samples(\"\", timer);\n\t\telse\n\t\t\ttime_stats(\"<total>\", timer);\n\t\tdelete timer;\n\t}\n}\n\nstatic void\ntime_samples(const std::string& name, Timer *timer)\n{\n\tstd::vector<uintmax_t> samples = timer->samples();\n\tstd::vector<uintmax_t>::iterator it;\n\n\tif (name == \"\") {\n\t\tfor (it = samples.begin(); it != samples.end(); ++it)\n\t\t\tfprintf(stderr, \"%ju\\n\", *it);\n\t} else {\n\t\tfor (it = samples.begin(); it != samples.end(); ++it)\n\t\t\tfprintf(stderr, \"%s,%ju\\n\", name.c_str(), *it);\n\t}\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\nstatic void\nusage(void)\n{\n\tfprintf(stderr,\n\"usage: tack [-svQ] [-T [-ES]] -c [file ...]\\n\"\n\" tack [-svQ] [-T [-ES]] -d [file ...]\\n\"\n\" tack [-vQ] [-T [-ES]] -h [file ...]\\n\");\n\texit(1);\n}\n<commit_msg>Don't print stats if we couldn't open anything.<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#include <xcodec\/xcodec_hash.h>\n\nenum FileAction {\n\tNone, Compress, Decompress, Hashes\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#define\tTACK_FLAG_CODEC_TIMING_SAMPLES\t(0x00000010)\n\nstatic void compress(const std::string&, int, int, XCodec *, unsigned, Timer *);\nstatic void decompress(const std::string&, int, int, XCodec *, unsigned, Timer *);\nstatic void hashes(int, int, 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);\nstatic void time_samples(const std::string&, 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 verbose;\n\tFileAction action;\n\tunsigned flags;\n\tint ch;\n\n\taction = None;\n\tflags = 0;\n\tverbose = false;\n\n\twhile ((ch = getopt(argc, argv, \"?cdhsvEQST\")) != -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 'h':\n\t\t\taction = Hashes;\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\tflags |= TACK_FLAG_CODEC_TIMING_SAMPLES;\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 (action == None)\n\t\tusage();\n\n\tif (action == Hashes && (flags & TACK_FLAG_BYTE_STATS) != 0)\n\t\tusage();\n\n\tif ((flags & TACK_FLAG_CODEC_TIMING) == 0 &&\n\t (flags & (TACK_FLAG_CODEC_TIMING_EACH | TACK_FLAG_CODEC_TIMING_SAMPLES)) != 0)\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\tprocess_files(argc, argv, action, &codec, flags);\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 void\nhashes(int ifd, int ofd, unsigned flags, Timer *timer)\n{\n\tBuffer input, output;\n\tBufferSegment *seg;\n\tunsigned o;\n\n\twhile (fill(ifd, &input)) {\n\t\tif ((flags & TACK_FLAG_CODEC_TIMING) != 0)\n\t\t\ttimer->start();\n\t\tXCodecHash xcodec_hash;\n\t\to = 0;\n\t\twhile (!input.empty()) {\n\t\t\tinput.moveout(&seg);\n\n\t\t\tconst uint8_t *p = seg->data();\n\t\t\tconst uint8_t *q = seg->end();\n\t\t\tfor (;;) {\n\t\t\t\twhile (o < XCODEC_SEGMENT_LENGTH && p != q) {\n\t\t\t\t\txcodec_hash.add(*p++);\n\t\t\t\t\to++;\n\t\t\t\t}\n\t\t\t\tif (o == XCODEC_SEGMENT_LENGTH) {\n\t\t\t\t\tuint64_t hash = xcodec_hash.mix();\n\t\t\t\t\txcodec_hash.reset();\n\t\t\t\t\thash = BigEndian::encode(hash);\n\t\t\t\t\toutput.append(&hash);\n\t\t\t\t\to = 0;\n\n\t\t\t\t\tif (p == q)\n\t\t\t\t\t\tbreak;\n\n\t\t\t\t\tcontinue;\n\t\t\t\t}\n\t\t\t\tASSERT(p == q);\n\t\t\t\tbreak;\n\t\t\t}\n\n\t\t\tseg->unref();\n\t\t}\n\t\tif ((flags & TACK_FLAG_CODEC_TIMING) != 0)\n\t\t\ttimer->stop();\n\t\tflush(ofd, &output);\n\t}\n\tASSERT(input.empty());\n\tASSERT(output.empty());\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\tif ((flags & TACK_FLAG_CODEC_TIMING_EACH) != 0) {\n\t\tASSERT(timer == NULL);\n\n\t\ttimer = new Timer();\n\t}\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\tcase Hashes:\n\t\thashes(ifd, ofd, flags, timer);\n\t\tbreak;\n\tdefault:\n\t\tNOTREACHED();\n\t}\n\n\tif ((flags & TACK_FLAG_CODEC_TIMING_EACH) != 0) {\n\t\tif ((flags & TACK_FLAG_CODEC_TIMING_SAMPLES) != 0)\n\t\t\ttime_samples(name, timer);\n\t\telse\n\t\t\ttime_stats(name, timer);\n\t\tdelete timer;\n\t}\n}\n\nstatic void\nprocess_files(int argc, char *argv[], FileAction action, XCodec *codec, unsigned flags)\n{\n\tTimer *timer;\n\tint ifd, ofd;\n\tbool opened;\n\n\tif ((flags & TACK_FLAG_CODEC_TIMING) != 0 &&\n\t (flags & TACK_FLAG_CODEC_TIMING_EACH) == 0)\n\t\ttimer = new Timer();\n\telse\n\t\ttimer = NULL;\n\n\tif (argc == 0) {\n\t\topened = true;\n\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\topened = false;\n\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\topened = true;\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\tif (opened) {\n\t\tif ((flags & TACK_FLAG_CODEC_TIMING) != 0 &&\n\t\t (flags & TACK_FLAG_CODEC_TIMING_EACH) == 0) {\n\t\t\tASSERT(timer != NULL);\n\t\t\tif ((flags & TACK_FLAG_CODEC_TIMING_SAMPLES) != 0)\n\t\t\t\ttime_samples(\"\", timer);\n\t\t\telse\n\t\t\t\ttime_stats(\"<total>\", timer);\n\t\t\tdelete timer;\n\t\t}\n\t}\n}\n\nstatic void\ntime_samples(const std::string& name, Timer *timer)\n{\n\tstd::vector<uintmax_t> samples = timer->samples();\n\tstd::vector<uintmax_t>::iterator it;\n\n\tif (name == \"\") {\n\t\tfor (it = samples.begin(); it != samples.end(); ++it)\n\t\t\tfprintf(stderr, \"%ju\\n\", *it);\n\t} else {\n\t\tfor (it = samples.begin(); it != samples.end(); ++it)\n\t\t\tfprintf(stderr, \"%s,%ju\\n\", name.c_str(), *it);\n\t}\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\nstatic void\nusage(void)\n{\n\tfprintf(stderr,\n\"usage: tack [-svQ] [-T [-ES]] -c [file ...]\\n\"\n\" tack [-svQ] [-T [-ES]] -d [file ...]\\n\"\n\" tack [-vQ] [-T [-ES]] -h [file ...]\\n\");\n\texit(1);\n}\n<|endoftext|>"} {"text":"<commit_before>\/\/===--- FrontendActions.cpp ----------------------------------------------===\/\/\n\/\/\n\/\/ The LLVM Compiler Infrastructure\n\/\/\n\/\/ This file is distributed under the University of Illinois Open Source\n\/\/ License. See LICENSE.TXT for details.\n\/\/\n\/\/===----------------------------------------------------------------------===\/\/\n\n#include \"clang\/Frontend\/FrontendActions.h\"\n#include \"clang\/AST\/ASTConsumer.h\"\n#include \"clang\/Lex\/Pragma.h\"\n#include \"clang\/Lex\/Preprocessor.h\"\n#include \"clang\/Parse\/Parser.h\"\n#include \"clang\/Basic\/FileManager.h\"\n#include \"clang\/Frontend\/ASTConsumers.h\"\n#include \"clang\/Frontend\/ASTUnit.h\"\n#include \"clang\/Frontend\/CompilerInstance.h\"\n#include \"clang\/Frontend\/FrontendDiagnostic.h\"\n#include \"clang\/Frontend\/Utils.h\"\n#include \"llvm\/ADT\/OwningPtr.h\"\n#include \"llvm\/Support\/raw_ostream.h\"\nusing namespace clang;\n\n\/\/===----------------------------------------------------------------------===\/\/\n\/\/ Custom Actions\n\/\/===----------------------------------------------------------------------===\/\/\n\nASTConsumer *InitOnlyAction::CreateASTConsumer(CompilerInstance &CI,\n llvm::StringRef InFile) {\n return new ASTConsumer();\n}\n\nvoid InitOnlyAction::ExecuteAction() {\n}\n\n\/\/===----------------------------------------------------------------------===\/\/\n\/\/ AST Consumer Actions\n\/\/===----------------------------------------------------------------------===\/\/\n\nASTConsumer *ASTPrintAction::CreateASTConsumer(CompilerInstance &CI,\n llvm::StringRef InFile) {\n if (llvm::raw_ostream *OS = CI.createDefaultOutputFile(false, InFile))\n return CreateASTPrinter(OS);\n return 0;\n}\n\nASTConsumer *ASTPrintXMLAction::CreateASTConsumer(CompilerInstance &CI,\n llvm::StringRef InFile) {\n if (llvm::raw_ostream *OS = CI.createDefaultOutputFile(false, InFile, \"xml\"))\n return CreateASTPrinterXML(OS);\n return 0;\n}\n\nASTConsumer *ASTDumpAction::CreateASTConsumer(CompilerInstance &CI,\n llvm::StringRef InFile) {\n return CreateASTDumper();\n}\n\nASTConsumer *ASTViewAction::CreateASTConsumer(CompilerInstance &CI,\n llvm::StringRef InFile) {\n return CreateASTViewer();\n}\n\nASTConsumer *DeclContextPrintAction::CreateASTConsumer(CompilerInstance &CI,\n llvm::StringRef InFile) {\n return CreateDeclContextPrinter();\n}\n\nASTConsumer *GeneratePCHAction::CreateASTConsumer(CompilerInstance &CI,\n llvm::StringRef InFile) {\n const std::string &Sysroot = CI.getHeaderSearchOpts().Sysroot;\n if (CI.getFrontendOpts().RelocatablePCH &&\n Sysroot.empty()) {\n CI.getDiagnostics().Report(diag::err_relocatable_without_without_isysroot);\n return 0;\n }\n\n llvm::raw_ostream *OS = CI.createDefaultOutputFile(true, InFile);\n if (!OS)\n return 0;\n\n if (CI.getFrontendOpts().RelocatablePCH)\n return CreatePCHGenerator(CI.getPreprocessor(), OS,\n CI.getInvocation().getFrontendOpts().ChainedPCH ?\n\t\t\t CI.getPCHReader() : 0,\n Sysroot.c_str());\n\n return CreatePCHGenerator(CI.getPreprocessor(), OS, CI.getPCHReader());\n}\n\nASTConsumer *InheritanceViewAction::CreateASTConsumer(CompilerInstance &CI,\n llvm::StringRef InFile) {\n return CreateInheritanceViewer(CI.getFrontendOpts().ViewClassInheritance);\n}\n\nASTConsumer *SyntaxOnlyAction::CreateASTConsumer(CompilerInstance &CI,\n llvm::StringRef InFile) {\n return new ASTConsumer();\n}\n\n\/\/===----------------------------------------------------------------------===\/\/\n\/\/ Preprocessor Actions\n\/\/===----------------------------------------------------------------------===\/\/\n\nvoid DumpRawTokensAction::ExecuteAction() {\n Preprocessor &PP = getCompilerInstance().getPreprocessor();\n SourceManager &SM = PP.getSourceManager();\n\n \/\/ Start lexing the specified input file.\n const llvm::MemoryBuffer *FromFile = SM.getBuffer(SM.getMainFileID());\n Lexer RawLex(SM.getMainFileID(), FromFile, SM, PP.getLangOptions());\n RawLex.SetKeepWhitespaceMode(true);\n\n Token RawTok;\n RawLex.LexFromRawLexer(RawTok);\n while (RawTok.isNot(tok::eof)) {\n PP.DumpToken(RawTok, true);\n llvm::errs() << \"\\n\";\n RawLex.LexFromRawLexer(RawTok);\n }\n}\n\nvoid DumpTokensAction::ExecuteAction() {\n Preprocessor &PP = getCompilerInstance().getPreprocessor();\n \/\/ Start preprocessing the specified input file.\n Token Tok;\n PP.EnterMainSourceFile();\n do {\n PP.Lex(Tok);\n PP.DumpToken(Tok, true);\n llvm::errs() << \"\\n\";\n } while (Tok.isNot(tok::eof));\n}\n\nvoid GeneratePTHAction::ExecuteAction() {\n CompilerInstance &CI = getCompilerInstance();\n if (CI.getFrontendOpts().OutputFile.empty() ||\n CI.getFrontendOpts().OutputFile == \"-\") {\n \/\/ FIXME: Don't fail this way.\n \/\/ FIXME: Verify that we can actually seek in the given file.\n llvm::report_fatal_error(\"PTH requires a seekable file for output!\");\n }\n llvm::raw_fd_ostream *OS =\n CI.createDefaultOutputFile(true, getCurrentFile());\n if (!OS) return;\n\n CacheTokens(CI.getPreprocessor(), OS);\n}\n\nvoid ParseOnlyAction::ExecuteAction() {\n Preprocessor &PP = getCompilerInstance().getPreprocessor();\n llvm::OwningPtr<Action> PA(new MinimalAction(PP));\n\n Parser P(PP, *PA);\n PP.EnterMainSourceFile();\n P.ParseTranslationUnit();\n}\n\nvoid PreprocessOnlyAction::ExecuteAction() {\n Preprocessor &PP = getCompilerInstance().getPreprocessor();\n\n \/\/ Ignore unknown pragmas.\n PP.AddPragmaHandler(0, new EmptyPragmaHandler());\n\n Token Tok;\n \/\/ Start parsing the specified input file.\n PP.EnterMainSourceFile();\n do {\n PP.Lex(Tok);\n } while (Tok.isNot(tok::eof));\n}\n\nvoid PrintParseAction::ExecuteAction() {\n CompilerInstance &CI = getCompilerInstance();\n Preprocessor &PP = getCompilerInstance().getPreprocessor();\n llvm::raw_ostream *OS = CI.createDefaultOutputFile(false, getCurrentFile());\n if (!OS) return;\n\n llvm::OwningPtr<Action> PA(CreatePrintParserActionsAction(PP, OS));\n\n Parser P(PP, *PA);\n PP.EnterMainSourceFile();\n P.ParseTranslationUnit();\n}\n\nvoid PrintPreprocessedAction::ExecuteAction() {\n CompilerInstance &CI = getCompilerInstance();\n \/\/ Output file needs to be set to 'Binary', to avoid converting Unix style\n \/\/ line feeds (<LF>) to Microsoft style line feeds (<CR><LF>).\n llvm::raw_ostream *OS = CI.createDefaultOutputFile(true, getCurrentFile());\n if (!OS) return;\n\n DoPrintPreprocessedInput(CI.getPreprocessor(), OS,\n CI.getPreprocessorOutputOpts());\n}\n<commit_msg>Really respect -chained-pch.<commit_after>\/\/===--- FrontendActions.cpp ----------------------------------------------===\/\/\n\/\/\n\/\/ The LLVM Compiler Infrastructure\n\/\/\n\/\/ This file is distributed under the University of Illinois Open Source\n\/\/ License. See LICENSE.TXT for details.\n\/\/\n\/\/===----------------------------------------------------------------------===\/\/\n\n#include \"clang\/Frontend\/FrontendActions.h\"\n#include \"clang\/AST\/ASTConsumer.h\"\n#include \"clang\/Lex\/Pragma.h\"\n#include \"clang\/Lex\/Preprocessor.h\"\n#include \"clang\/Parse\/Parser.h\"\n#include \"clang\/Basic\/FileManager.h\"\n#include \"clang\/Frontend\/ASTConsumers.h\"\n#include \"clang\/Frontend\/ASTUnit.h\"\n#include \"clang\/Frontend\/CompilerInstance.h\"\n#include \"clang\/Frontend\/FrontendDiagnostic.h\"\n#include \"clang\/Frontend\/Utils.h\"\n#include \"llvm\/ADT\/OwningPtr.h\"\n#include \"llvm\/Support\/raw_ostream.h\"\nusing namespace clang;\n\n\/\/===----------------------------------------------------------------------===\/\/\n\/\/ Custom Actions\n\/\/===----------------------------------------------------------------------===\/\/\n\nASTConsumer *InitOnlyAction::CreateASTConsumer(CompilerInstance &CI,\n llvm::StringRef InFile) {\n return new ASTConsumer();\n}\n\nvoid InitOnlyAction::ExecuteAction() {\n}\n\n\/\/===----------------------------------------------------------------------===\/\/\n\/\/ AST Consumer Actions\n\/\/===----------------------------------------------------------------------===\/\/\n\nASTConsumer *ASTPrintAction::CreateASTConsumer(CompilerInstance &CI,\n llvm::StringRef InFile) {\n if (llvm::raw_ostream *OS = CI.createDefaultOutputFile(false, InFile))\n return CreateASTPrinter(OS);\n return 0;\n}\n\nASTConsumer *ASTPrintXMLAction::CreateASTConsumer(CompilerInstance &CI,\n llvm::StringRef InFile) {\n if (llvm::raw_ostream *OS = CI.createDefaultOutputFile(false, InFile, \"xml\"))\n return CreateASTPrinterXML(OS);\n return 0;\n}\n\nASTConsumer *ASTDumpAction::CreateASTConsumer(CompilerInstance &CI,\n llvm::StringRef InFile) {\n return CreateASTDumper();\n}\n\nASTConsumer *ASTViewAction::CreateASTConsumer(CompilerInstance &CI,\n llvm::StringRef InFile) {\n return CreateASTViewer();\n}\n\nASTConsumer *DeclContextPrintAction::CreateASTConsumer(CompilerInstance &CI,\n llvm::StringRef InFile) {\n return CreateDeclContextPrinter();\n}\n\nASTConsumer *GeneratePCHAction::CreateASTConsumer(CompilerInstance &CI,\n llvm::StringRef InFile) {\n const std::string &Sysroot = CI.getHeaderSearchOpts().Sysroot;\n if (CI.getFrontendOpts().RelocatablePCH &&\n Sysroot.empty()) {\n CI.getDiagnostics().Report(diag::err_relocatable_without_without_isysroot);\n return 0;\n }\n\n llvm::raw_ostream *OS = CI.createDefaultOutputFile(true, InFile);\n if (!OS)\n return 0;\n\n const PCHReader *Chain = CI.getInvocation().getFrontendOpts().ChainedPCH ?\n CI.getPCHReader() : 0;\n const char *isysroot = CI.getFrontendOpts().RelocatablePCH ?\n Sysroot.c_str() : 0;\n return CreatePCHGenerator(CI.getPreprocessor(), OS, Chain, isysroot);\n}\n\nASTConsumer *InheritanceViewAction::CreateASTConsumer(CompilerInstance &CI,\n llvm::StringRef InFile) {\n return CreateInheritanceViewer(CI.getFrontendOpts().ViewClassInheritance);\n}\n\nASTConsumer *SyntaxOnlyAction::CreateASTConsumer(CompilerInstance &CI,\n llvm::StringRef InFile) {\n return new ASTConsumer();\n}\n\n\/\/===----------------------------------------------------------------------===\/\/\n\/\/ Preprocessor Actions\n\/\/===----------------------------------------------------------------------===\/\/\n\nvoid DumpRawTokensAction::ExecuteAction() {\n Preprocessor &PP = getCompilerInstance().getPreprocessor();\n SourceManager &SM = PP.getSourceManager();\n\n \/\/ Start lexing the specified input file.\n const llvm::MemoryBuffer *FromFile = SM.getBuffer(SM.getMainFileID());\n Lexer RawLex(SM.getMainFileID(), FromFile, SM, PP.getLangOptions());\n RawLex.SetKeepWhitespaceMode(true);\n\n Token RawTok;\n RawLex.LexFromRawLexer(RawTok);\n while (RawTok.isNot(tok::eof)) {\n PP.DumpToken(RawTok, true);\n llvm::errs() << \"\\n\";\n RawLex.LexFromRawLexer(RawTok);\n }\n}\n\nvoid DumpTokensAction::ExecuteAction() {\n Preprocessor &PP = getCompilerInstance().getPreprocessor();\n \/\/ Start preprocessing the specified input file.\n Token Tok;\n PP.EnterMainSourceFile();\n do {\n PP.Lex(Tok);\n PP.DumpToken(Tok, true);\n llvm::errs() << \"\\n\";\n } while (Tok.isNot(tok::eof));\n}\n\nvoid GeneratePTHAction::ExecuteAction() {\n CompilerInstance &CI = getCompilerInstance();\n if (CI.getFrontendOpts().OutputFile.empty() ||\n CI.getFrontendOpts().OutputFile == \"-\") {\n \/\/ FIXME: Don't fail this way.\n \/\/ FIXME: Verify that we can actually seek in the given file.\n llvm::report_fatal_error(\"PTH requires a seekable file for output!\");\n }\n llvm::raw_fd_ostream *OS =\n CI.createDefaultOutputFile(true, getCurrentFile());\n if (!OS) return;\n\n CacheTokens(CI.getPreprocessor(), OS);\n}\n\nvoid ParseOnlyAction::ExecuteAction() {\n Preprocessor &PP = getCompilerInstance().getPreprocessor();\n llvm::OwningPtr<Action> PA(new MinimalAction(PP));\n\n Parser P(PP, *PA);\n PP.EnterMainSourceFile();\n P.ParseTranslationUnit();\n}\n\nvoid PreprocessOnlyAction::ExecuteAction() {\n Preprocessor &PP = getCompilerInstance().getPreprocessor();\n\n \/\/ Ignore unknown pragmas.\n PP.AddPragmaHandler(0, new EmptyPragmaHandler());\n\n Token Tok;\n \/\/ Start parsing the specified input file.\n PP.EnterMainSourceFile();\n do {\n PP.Lex(Tok);\n } while (Tok.isNot(tok::eof));\n}\n\nvoid PrintParseAction::ExecuteAction() {\n CompilerInstance &CI = getCompilerInstance();\n Preprocessor &PP = getCompilerInstance().getPreprocessor();\n llvm::raw_ostream *OS = CI.createDefaultOutputFile(false, getCurrentFile());\n if (!OS) return;\n\n llvm::OwningPtr<Action> PA(CreatePrintParserActionsAction(PP, OS));\n\n Parser P(PP, *PA);\n PP.EnterMainSourceFile();\n P.ParseTranslationUnit();\n}\n\nvoid PrintPreprocessedAction::ExecuteAction() {\n CompilerInstance &CI = getCompilerInstance();\n \/\/ Output file needs to be set to 'Binary', to avoid converting Unix style\n \/\/ line feeds (<LF>) to Microsoft style line feeds (<CR><LF>).\n llvm::raw_ostream *OS = CI.createDefaultOutputFile(true, getCurrentFile());\n if (!OS) return;\n\n DoPrintPreprocessedInput(CI.getPreprocessor(), OS,\n CI.getPreprocessorOutputOpts());\n}\n<|endoftext|>"} {"text":"<commit_before>\/*\nCopyright (c) 2013 Khaled Mammou - Advanced Micro Devices, Inc.\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 <time.h>\n#include <stdlib.h>\n#include <stdio.h>\n#include <iostream>\n#include <fstream>\n#include <map>\n#include <string>\n#include <vector>\n\n#include \"SEA3D\/SEA3D.h\"\n#include \"SEA3D\/ByteArray.h\"\n\n#include \"o3dgc\/o3dgcCommon.h\"\n#include \"o3dgc\/o3dgcVector.h\"\n#include \"o3dgc\/o3dgcSC3DMCEncodeParams.h\"\n#include \"o3dgc\/o3dgcIndexedFaceSet.h\"\n#include \"o3dgc\/o3dgcSC3DMCEncoder.h\"\n#include \"o3dgc\/o3dgcSC3DMCDecoder.h\"\n#include \"o3dgc\/o3dgcTimer.h\"\n#include \"o3dgc\/o3dgcDVEncodeParams.h\"\n#include \"o3dgc\/o3dgcDynamicVectorEncoder.h\"\n#include \"o3dgc\/o3dgcDynamicVectorDecoder.h\"\n\n#ifdef _WIN32\n #include <io.h>\n #include <fcntl.h>\n#endif\n\nusing namespace o3dgc;\nusing namespace std;\n\nvoid print(string str) \n{\n\tfor (unsigned int i = 0; i < str.size(); i++) cout << str[i];\n\tcout << endl;\n}\n\nunsigned char * convertToGeometryGC(\n\tSEAGeometry * geo, \n\tunsigned int & bufferLen,\n\tint qcoord,\n int qtexCoord,\n int qnormal,\n\tint qcolor,\n int qweights\n\t) \n{\n\t\/\/ init\n\n\tunsigned int nIntAttributes = 0;\n\tunsigned int nFloatAttributes = 0;\n\n\tSC3DMCEncodeParams params;\n\tparams.SetStreamType(O3DGC_STREAM_TYPE_BINARY);\n\tIndexedFaceSet<unsigned int> ifs;\n\t\n\t\/\/ indexes\n\n\tifs.SetNCoordIndex((unsigned int)geo->numIndexes);\n\tifs.SetCoordIndex((unsigned int * const)geo->indexes);\n\n\tif (geo->numGroups > 1)\n\t{\n\t\tunsigned long *groups = (unsigned long*)malloc(sizeof(unsigned long) * geo->numIndexes);\n\n\t\tfor (unsigned int i = 0, offset = 0; i < geo->numGroups; i++) \n\t\t{\n\t\t\tunsigned int total = geo->counts[i];\n\n\t\t\ttotal += offset;\n\n\t\t\twhile (offset < total) \n\t\t\t{\n\t\t\t\tgroups[offset++] = i;\n\t\t\t}\n\t\t}\n\n\t\tifs.SetIndexBufferID( groups );\n\t}\n\n\t\/\/ position\n\n\tparams.SetCoordQuantBits(qcoord);\n params.SetCoordPredMode(O3DGC_SC3DMC_PARALLELOGRAM_PREDICTION);\n\tifs.SetNCoord(geo->numVertex);\n\tifs.SetCoord((float * const)geo->vertex);\n\n\t\/\/ normal\n\n\tif (geo->normal != NULL) \n\t{\n\t\tparams.SetNormalQuantBits(qnormal);\n\t\tparams.SetNormalPredMode(O3DGC_SC3DMC_SURF_NORMALS_PREDICTION);\n\t\tifs.SetNNormal(geo->numVertex);\n\t\tifs.SetNormal((float * const)geo->normal);\n\t}\n\n\t\/\/ uv\n\n\tif (geo->numUV > 0)\n\t{\n\t\tfor (unsigned int i = 0; i < geo->numUV; i++) \n\t\t{\n\t\t\tparams.SetFloatAttributeQuantBits(nFloatAttributes, qtexCoord);\n\t\t\tparams.SetFloatAttributePredMode(nFloatAttributes, O3DGC_SC3DMC_PARALLELOGRAM_PREDICTION);\n\t\t\tifs.SetNFloatAttribute(nFloatAttributes, geo->numVertex);\n\t\t\tifs.SetFloatAttributeDim(nFloatAttributes, 2);\n\t\t\tifs.SetFloatAttributeType(nFloatAttributes, O3DGC_IFS_FLOAT_ATTRIBUTE_TYPE_TEXCOORD);\n\t\t\tifs.SetFloatAttribute(nFloatAttributes, (float * const)geo->uv[i]);\n\t\t\tnFloatAttributes++;\n\t\t}\n\t}\n\n\t\/\/ joint \/ weight\n\n\tif (geo->jointPerVertex > 0)\n\t{\n ifs.SetNIntAttribute(nIntAttributes, geo->numVertex);\n\t\tifs.SetIntAttributeDim(nIntAttributes, geo->jointPerVertex);\n ifs.SetIntAttributeType(nIntAttributes, O3DGC_IFS_INT_ATTRIBUTE_TYPE_JOINT_ID);\n\t\tifs.SetIntAttribute(nIntAttributes, (long * const)geo->joint);\n nIntAttributes++;\n\n\t\tparams.SetFloatAttributeQuantBits(nFloatAttributes, qweights);\n\t\tparams.SetFloatAttributePredMode(nFloatAttributes, O3DGC_SC3DMC_DIFFERENTIAL_PREDICTION);\n ifs.SetNFloatAttribute(nFloatAttributes, geo->numVertex);\n\t\tifs.SetFloatAttributeDim(nFloatAttributes, geo->jointPerVertex);\n ifs.SetFloatAttributeType(nFloatAttributes, O3DGC_IFS_FLOAT_ATTRIBUTE_TYPE_WEIGHT);\n\t\tifs.SetFloatAttribute(nFloatAttributes, (float * const)geo->weight);\n nFloatAttributes++;\n\t}\n\n\t\/\/ compute Open3DGC geometry\n\n\tparams.SetNumIntAttributes(nIntAttributes);\n ifs.SetNumIntAttributes(nIntAttributes);\n\n\tparams.SetNumFloatAttributes(nFloatAttributes);\n ifs.SetNumFloatAttributes(nFloatAttributes);\n\n ifs.ComputeMinMax(O3DGC_SC3DMC_MAX_ALL_DIMS); \/\/ O3DGC_SC3DMC_DIAG_BB\n\n\tBinaryStream bstream((geo->numVertex * 3) * 8);\n\n\tSC3DMCEncoder<unsigned int> encoder;\n\n encoder.Encode(params, ifs, bstream);\n\n\t\/\/ create GeometryGC\n\n\tnIntAttributes = 0;\n\tnFloatAttributes = 0;\n\n\tunsigned char * s3dBuffer = bstream.GetBuffer();\n\tunsigned int s3dSize = bstream.GetSize();\n\n\tunsigned char * buffer = new unsigned char[s3dSize + 1024]; \/\/ 1024 is header buffer\n\tunsigned int bufferPos = 2; \/\/ first value is attribs\n\n\tint attribs = geo->isBig ? 1 : 0;\n\n\t\/\/ write groups\n\n\tif (geo->numGroups > 1) \n\t{\n\t\tattribs |= 2;\n\n\t\tbuffer[bufferPos++] = geo->numGroups;\n\n\t\tfor (unsigned int i = 0; i < geo->numGroups; i++)\n\t\t{\n\t\t\tunsigned int numTris = geo->counts[i];\n\n\t\t\tbuffer[bufferPos++] = numTris;\n\t\t\tbuffer[bufferPos++] = numTris >> 8;\n\n\t\t\tif (geo->isBig)\n\t\t\t{\n\t\t\t\tbuffer[bufferPos++] = numTris >> 16;\n\t\t\t\tbuffer[bufferPos++] = numTris >> 24;\n\t\t\t}\n\t\t}\n\t}\n\n\t\/\/ write uvs\n\n\tif (geo->numUV > 0) \n\t{\n\t\tattribs |= 4;\n\n\t\tbuffer[bufferPos++] = geo->numUV;\n\n\t\tfor (unsigned int i = 0; i < geo->numUV; i++)\n\t\t{\n\t\t\tbuffer[bufferPos++] = nFloatAttributes++;\n\t\t}\n\t}\n\n\t\/\/ write joint\/weight\n\n\tif (geo->jointPerVertex > 0)\n\t{\n\t\tattribs |= 32;\n\n\t\tbuffer[bufferPos++] = nIntAttributes++;\n\t\tbuffer[bufferPos++] = nFloatAttributes++;\n\t}\n\n\t\/\/ write buffer size\n\n\tbuffer[bufferPos++] = s3dSize;\n\tbuffer[bufferPos++] = s3dSize >> 8;\n\tbuffer[bufferPos++] = s3dSize >> 16;\n\tbuffer[bufferPos++] = s3dSize >> 24;\n\n\t\/\/ write attribs ( flags )\n\n\tbuffer[0] = attribs;\n\tbuffer[1] = attribs >> 8;\n\n\tmemcpy(buffer + bufferPos, s3dBuffer, s3dSize);\n\n\tbufferLen = s3dSize + bufferPos;\n\n\treturn buffer;\n\n}\n\nint main(int argc, char * argv[])\n{\n\tstring input, output;\n\n\tfloat \n\t\tqposition_quality = 1,\n\t\tqgradient_quality = 1;\n\n\tfor(int i = 1; i < argc; ++i)\n {\n if ( !strcmp(argv[i], \"-i\"))\n {\n if (++i < argc)\n {\n input = argv[i];\n }\n }\n\t\telse if ( !strcmp(argv[i], \"-o\"))\n {\n if (++i < argc)\n {\n output = argv[i];\n }\n }\n\t\telse if ( !strcmp(argv[i], \"-qp\"))\n {\n if (++i < argc)\n {\n qposition_quality = atof(argv[i]);\n }\n }\n\t\telse if ( !strcmp(argv[i], \"-qg\"))\n {\n if (++i < argc)\n {\n qgradient_quality = atof(argv[i]);\n }\n }\n\t}\n\n\tint qcoord = (int)(12 * qposition_quality);\n int qtexCoord = (int)(10 * qgradient_quality);\n int qnormal = (int)(10 * qgradient_quality);\n\tint qcolor = (int)(10 * qgradient_quality);\n int qweights = (int)(8 * qgradient_quality);\n\n\tif (qposition_quality < 0.1) qposition_quality = 0.1;\n\telse if (qposition_quality > 2) qposition_quality = 2;\n\n\tif (qgradient_quality < 0.1) qgradient_quality = 0.1;\n\telse if (qgradient_quality > 2) qgradient_quality = 2;\n\n\t\/\/input = \"D:\\\\Sunag\\\\Github\\\\sea3d_sdk\\\\Source\\\\O3DGC\\\\Debug\\\\Object002.geo\";\n\t\/\/input = \"D:\\\\Sunag\\\\Github\\\\sea3d_sdk\\\\Source\\\\O3DGC\\\\Debug\\\\temp-14.geo\";\n\t\/\/output = \"D:\\\\Sunag\\\\Github\\\\sea3d_sdk\\\\Source\\\\O3DGC\\\\Debug\\\\Object002.s3D\";\n\n\tif (input.empty() || output.empty())\n\t{\n\t\tcout << \"Convert SEAGeometry to SEAGeometryGC example: SEA3DLossyCompress.exe -i sea3d_geometry.geo -o sea3d_o3dgc.s3D\";\n\t\treturn 1;\n\t}\n\n\tByteArray istream;\n\tistream.fromFile( input.c_str() );\n\n\tSEAGeometry geo;\n\tgeo.read( istream );\n\n\tunsigned int geoGCSize;\n\tunsigned char * geoGCBuffer = convertToGeometryGC(&geo, geoGCSize, qcoord, qtexCoord, qnormal, qcolor, qweights);\n\n\tByteArray ostream;\n\tostream.fromBuffer(geoGCBuffer, geoGCSize);\n\tostream.saveFile( output.c_str() );\n\n}<commit_msg>fix quality<commit_after>\/*\nCopyright (c) 2013 Khaled Mammou - Advanced Micro Devices, Inc.\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 <time.h>\n#include <stdlib.h>\n#include <stdio.h>\n#include <iostream>\n#include <fstream>\n#include <map>\n#include <string>\n#include <vector>\n\n#include \"SEA3D\/SEA3D.h\"\n#include \"SEA3D\/ByteArray.h\"\n\n#include \"o3dgc\/o3dgcCommon.h\"\n#include \"o3dgc\/o3dgcVector.h\"\n#include \"o3dgc\/o3dgcSC3DMCEncodeParams.h\"\n#include \"o3dgc\/o3dgcIndexedFaceSet.h\"\n#include \"o3dgc\/o3dgcSC3DMCEncoder.h\"\n#include \"o3dgc\/o3dgcSC3DMCDecoder.h\"\n#include \"o3dgc\/o3dgcTimer.h\"\n#include \"o3dgc\/o3dgcDVEncodeParams.h\"\n#include \"o3dgc\/o3dgcDynamicVectorEncoder.h\"\n#include \"o3dgc\/o3dgcDynamicVectorDecoder.h\"\n\n#ifdef _WIN32\n #include <io.h>\n #include <fcntl.h>\n#endif\n\nusing namespace o3dgc;\nusing namespace std;\n\nvoid print(string str) \n{\n\tfor (unsigned int i = 0; i < str.size(); i++) cout << str[i];\n\tcout << endl;\n}\n\nunsigned char * convertToGeometryGC(\n\tSEAGeometry * geo, \n\tunsigned int & bufferLen,\n\tint qcoord,\n int qtexCoord,\n int qnormal,\n\tint qcolor,\n int qweights\n\t) \n{\n\t\/\/ init\n\n\tunsigned int nIntAttributes = 0;\n\tunsigned int nFloatAttributes = 0;\n\n\tSC3DMCEncodeParams params;\n\tparams.SetStreamType(O3DGC_STREAM_TYPE_BINARY);\n\tIndexedFaceSet<unsigned int> ifs;\n\t\n\t\/\/ indexes\n\n\tifs.SetNCoordIndex((unsigned int)geo->numIndexes);\n\tifs.SetCoordIndex((unsigned int * const)geo->indexes);\n\n\tif (geo->numGroups > 1)\n\t{\n\t\tunsigned long *groups = (unsigned long*)malloc(sizeof(unsigned long) * geo->numIndexes);\n\n\t\tfor (unsigned int i = 0, offset = 0; i < geo->numGroups; i++) \n\t\t{\n\t\t\tunsigned int total = geo->counts[i];\n\n\t\t\ttotal += offset;\n\n\t\t\twhile (offset < total) \n\t\t\t{\n\t\t\t\tgroups[offset++] = i;\n\t\t\t}\n\t\t}\n\n\t\tifs.SetIndexBufferID( groups );\n\t}\n\n\t\/\/ position\n\n\tparams.SetCoordQuantBits(qcoord);\n params.SetCoordPredMode(O3DGC_SC3DMC_PARALLELOGRAM_PREDICTION);\n\tifs.SetNCoord(geo->numVertex);\n\tifs.SetCoord((float * const)geo->vertex);\n\n\t\/\/ normal\n\n\tif (geo->normal != NULL) \n\t{\n\t\tparams.SetNormalQuantBits(qnormal);\n\t\tparams.SetNormalPredMode(O3DGC_SC3DMC_SURF_NORMALS_PREDICTION);\n\t\tifs.SetNNormal(geo->numVertex);\n\t\tifs.SetNormal((float * const)geo->normal);\n\t}\n\n\t\/\/ uv\n\n\tif (geo->numUV > 0)\n\t{\n\t\tfor (unsigned int i = 0; i < geo->numUV; i++) \n\t\t{\n\t\t\tparams.SetFloatAttributeQuantBits(nFloatAttributes, qtexCoord);\n\t\t\tparams.SetFloatAttributePredMode(nFloatAttributes, O3DGC_SC3DMC_PARALLELOGRAM_PREDICTION);\n\t\t\tifs.SetNFloatAttribute(nFloatAttributes, geo->numVertex);\n\t\t\tifs.SetFloatAttributeDim(nFloatAttributes, 2);\n\t\t\tifs.SetFloatAttributeType(nFloatAttributes, O3DGC_IFS_FLOAT_ATTRIBUTE_TYPE_TEXCOORD);\n\t\t\tifs.SetFloatAttribute(nFloatAttributes, (float * const)geo->uv[i]);\n\t\t\tnFloatAttributes++;\n\t\t}\n\t}\n\n\t\/\/ joint \/ weight\n\n\tif (geo->jointPerVertex > 0)\n\t{\n ifs.SetNIntAttribute(nIntAttributes, geo->numVertex);\n\t\tifs.SetIntAttributeDim(nIntAttributes, geo->jointPerVertex);\n ifs.SetIntAttributeType(nIntAttributes, O3DGC_IFS_INT_ATTRIBUTE_TYPE_JOINT_ID);\n\t\tifs.SetIntAttribute(nIntAttributes, (long * const)geo->joint);\n nIntAttributes++;\n\n\t\tparams.SetFloatAttributeQuantBits(nFloatAttributes, qweights);\n\t\tparams.SetFloatAttributePredMode(nFloatAttributes, O3DGC_SC3DMC_DIFFERENTIAL_PREDICTION);\n ifs.SetNFloatAttribute(nFloatAttributes, geo->numVertex);\n\t\tifs.SetFloatAttributeDim(nFloatAttributes, geo->jointPerVertex);\n ifs.SetFloatAttributeType(nFloatAttributes, O3DGC_IFS_FLOAT_ATTRIBUTE_TYPE_WEIGHT);\n\t\tifs.SetFloatAttribute(nFloatAttributes, (float * const)geo->weight);\n nFloatAttributes++;\n\t}\n\n\t\/\/ compute Open3DGC geometry\n\n\tparams.SetNumIntAttributes(nIntAttributes);\n ifs.SetNumIntAttributes(nIntAttributes);\n\n\tparams.SetNumFloatAttributes(nFloatAttributes);\n ifs.SetNumFloatAttributes(nFloatAttributes);\n\n ifs.ComputeMinMax(O3DGC_SC3DMC_MAX_ALL_DIMS); \/\/ O3DGC_SC3DMC_DIAG_BB\n\n\tBinaryStream bstream((geo->numVertex * 3) * 8);\n\n\tSC3DMCEncoder<unsigned int> encoder;\n\n encoder.Encode(params, ifs, bstream);\n\n\t\/\/ create GeometryGC\n\n\tnIntAttributes = 0;\n\tnFloatAttributes = 0;\n\n\tunsigned char * s3dBuffer = bstream.GetBuffer();\n\tunsigned int s3dSize = bstream.GetSize();\n\n\tunsigned char * buffer = new unsigned char[s3dSize + 1024]; \/\/ 1024 is header buffer\n\tunsigned int bufferPos = 2; \/\/ first value is attribs\n\n\tint attribs = geo->isBig ? 1 : 0;\n\n\t\/\/ write groups\n\n\tif (geo->numGroups > 1) \n\t{\n\t\tattribs |= 2;\n\n\t\tbuffer[bufferPos++] = geo->numGroups;\n\n\t\tfor (unsigned int i = 0; i < geo->numGroups; i++)\n\t\t{\n\t\t\tunsigned int numTris = geo->counts[i];\n\n\t\t\tbuffer[bufferPos++] = numTris;\n\t\t\tbuffer[bufferPos++] = numTris >> 8;\n\n\t\t\tif (geo->isBig)\n\t\t\t{\n\t\t\t\tbuffer[bufferPos++] = numTris >> 16;\n\t\t\t\tbuffer[bufferPos++] = numTris >> 24;\n\t\t\t}\n\t\t}\n\t}\n\n\t\/\/ write uvs\n\n\tif (geo->numUV > 0) \n\t{\n\t\tattribs |= 4;\n\n\t\tbuffer[bufferPos++] = geo->numUV;\n\n\t\tfor (unsigned int i = 0; i < geo->numUV; i++)\n\t\t{\n\t\t\tbuffer[bufferPos++] = nFloatAttributes++;\n\t\t}\n\t}\n\n\t\/\/ write joint\/weight\n\n\tif (geo->jointPerVertex > 0)\n\t{\n\t\tattribs |= 32;\n\n\t\tbuffer[bufferPos++] = nIntAttributes++;\n\t\tbuffer[bufferPos++] = nFloatAttributes++;\n\t}\n\n\t\/\/ write buffer size\n\n\tbuffer[bufferPos++] = s3dSize;\n\tbuffer[bufferPos++] = s3dSize >> 8;\n\tbuffer[bufferPos++] = s3dSize >> 16;\n\tbuffer[bufferPos++] = s3dSize >> 24;\n\n\t\/\/ write attribs ( flags )\n\n\tbuffer[0] = attribs;\n\tbuffer[1] = attribs >> 8;\n\n\tmemcpy(buffer + bufferPos, s3dBuffer, s3dSize);\n\n\tbufferLen = s3dSize + bufferPos;\n\n\treturn buffer;\n\n}\n\nint main(int argc, char * argv[])\n{\n\tstring input, output;\n\n\tdouble \n\t\tqposition_quality = 1,\n\t\tqgradient_quality = 1;\n\n\tfor(int i = 1; i < argc; ++i)\n {\n if ( !strcmp(argv[i], \"-i\"))\n {\n if (++i < argc)\n {\n input = argv[i];\n }\n }\n\t\telse if ( !strcmp(argv[i], \"-o\"))\n {\n if (++i < argc)\n {\n output = argv[i];\n }\n }\n\t\telse if ( !strcmp(argv[i], \"-qp\"))\n {\n if (++i < argc)\n {\n qposition_quality = atof(argv[i]);\n }\n }\n\t\telse if ( !strcmp(argv[i], \"-qg\"))\n {\n if (++i < argc)\n {\n qgradient_quality = atof(argv[i]);\n }\n }\n\t}\n\n\tint qcoord = (int)(12 * qposition_quality);\n int qtexCoord = (int)(15 * qgradient_quality);\n int qnormal = (int)(12 * qgradient_quality);\n\tint qcolor = (int)(12 * qgradient_quality);\n int qweights = (int)(10 * qgradient_quality);\n\n\tif (qposition_quality < 0.1) qposition_quality = 0.1;\n\telse if (qposition_quality > 2) qposition_quality = 2;\n\n\tif (qgradient_quality < 0.1) qgradient_quality = 0.1;\n\telse if (qgradient_quality > 2) qgradient_quality = 2;\n\n\t\/\/input = \"D:\\\\Sunag\\\\Github\\\\sea3d_sdk\\\\Source\\\\O3DGC\\\\Debug\\\\Object002.geo\";\n\t\/\/input = \"D:\\\\Sunag\\\\Github\\\\sea3d_sdk\\\\Source\\\\O3DGC\\\\Debug\\\\temp-14.geo\";\n\t\/\/output = \"D:\\\\Sunag\\\\Github\\\\sea3d_sdk\\\\Source\\\\O3DGC\\\\Debug\\\\Object002.s3D\";\n\n\tif (input.empty() || output.empty())\n\t{\n\t\tcout << \"Convert SEAGeometry to SEAGeometryGC example: SEA3DLossyCompress.exe -i sea3d_geometry.geo -o sea3d_o3dgc.s3D\";\n\t\treturn 1;\n\t}\n\n\tByteArray istream;\n\tistream.fromFile( input.c_str() );\n\n\tSEAGeometry geo;\n\tgeo.read( istream );\n\n\tunsigned int geoGCSize;\n\tunsigned char * geoGCBuffer = convertToGeometryGC(&geo, geoGCSize, qcoord, qtexCoord, qnormal, qcolor, qweights);\n\n\tByteArray ostream;\n\tostream.fromBuffer(geoGCBuffer, geoGCSize);\n\tostream.saveFile( output.c_str() );\n\n}<|endoftext|>"} {"text":"<commit_before>#pragma once\n#include <bts\/blockchain\/chain_database.hpp>\n#include <bts\/wallet\/wallet.hpp>\n#include <bts\/net\/node.hpp>\n#include <bts\/rpc\/rpc_client_api.hpp>\n#include <bts\/api\/common_api.hpp>\n#include <bts\/rpc_stubs\/common_api_client.hpp>\n#include <fc\/thread\/thread.hpp>\n#include <fc\/log\/logger_config.hpp>\n#include <memory>\n#include <boost\/program_options.hpp>\n\n\nnamespace bts { namespace rpc {\n class rpc_server;\n typedef std::shared_ptr<rpc_server> rpc_server_ptr;\n} }\nnamespace bts { namespace cli {\n class cli;\n}};\n\nnamespace bts { namespace client {\n\n using namespace bts::blockchain;\n using namespace bts::wallet;\n using namespace bts::mail;\n\n boost::program_options::variables_map parse_option_variables(int argc, char** argv);\n fc::path get_data_dir(const boost::program_options::variables_map& option_variables);\n fc::variant_object version_info();\n\n namespace detail { class client_impl; }\n\n using namespace bts::rpc;\n\n struct rpc_server_config\n {\n rpc_server_config()\n : enable(false),\n rpc_endpoint(fc::ip::endpoint::from_string(\"127.0.0.1:0\")),\n httpd_endpoint(fc::ip::endpoint::from_string(\"127.0.0.1:0\")),\n htdocs(\".\/htdocs\")\n {}\n\n bool enable;\n std::string rpc_user;\n std::string rpc_password;\n fc::ip::endpoint rpc_endpoint;\n fc::ip::endpoint httpd_endpoint;\n fc::path htdocs;\n\n bool is_valid() const; \/* Currently just checks if rpc port is set *\/\n };\n\n struct chain_server_config\n {\n chain_server_config()\n : enabled(false),\n listen_port(0)\n {}\n\n bool enabled;\n uint16_t listen_port;\n };\n\n struct config\n {\n config( ) : \n default_peers(vector<string>{\"104.131.204.143:\", \"54.77.61.238:\", \"54.207.13.136:\", \"54.169.39.185\"}), \n mail_server_enabled(false),\n wallet_enabled(true),\n ignore_console(false),\n use_upnp(true),\n maximum_number_of_connections(BTS_NET_DEFAULT_MAX_CONNECTIONS) ,\n delegate_server( fc::ip::endpoint::from_string(\"0.0.0.0:0\") ),\n default_delegate_peers( vector<string>({\"107.170.30.182:9988\"}) )\n {\n#ifdef BTS_TEST_NETWORK\n uint32_t port = BTS_NET_TEST_P2P_PORT + BTS_TEST_NETWORK_VERSION;\n#else\n uint32_t port = BTS_NET_DEFAULT_P2P_PORT;\n#endif\n default_peers[0] += fc::to_string( port );\n default_peers[1] += fc::to_string( port + 100 );\n default_peers[2] += fc::to_string( port + 200 );\n logging = fc::logging_config::default_config();\n }\n\n rpc_server_config rpc;\n vector<string> default_peers;\n vector<string> chain_servers;\n chain_server_config chain_server;\n bool mail_server_enabled;\n bool wallet_enabled;\n bool ignore_console;\n bool use_upnp;\n optional<fc::path> genesis_config;\n uint16_t maximum_number_of_connections;\n fc::logging_config logging;\n fc::ip::endpoint delegate_server;\n vector<string> default_delegate_peers;\n\n fc::optional<std::string> growl_notify_endpoint;\n fc::optional<std::string> growl_password;\n fc::optional<std::string> growl_bitshares_client_identifier;\n };\n\n\n \/**\n * @class client\n * @brief integrates the network, wallet, and blockchain\n *\n *\/\n class client : public bts::rpc_stubs::common_api_client,\n public std::enable_shared_from_this<client>\n {\n public:\n client();\n client(bts::net::simulated_network_ptr network_to_connect_to);\n\n void simulate_disconnect( bool state );\n\n virtual ~client();\n\n void start_networking(std::function<void()> network_started_callback = std::function<void()>());\n void configure_from_command_line(int argc, char** argv);\n fc::future<void> start();\n void open(const path& data_dir,\n optional<fc::path> genesis_file_path = optional<fc::path>(),\n std::function<void(float)> reindex_status_callback = std::function<void(float)>());\n\n void init_cli();\n void set_daemon_mode(bool daemon_mode);\n\n\n chain_database_ptr get_chain()const;\n wallet_ptr get_wallet()const;\n mail_server_ptr get_mail_server()const;\n bts::rpc::rpc_server_ptr get_rpc_server()const;\n bts::net::node_ptr get_node()const;\n fc::path get_data_dir()const;\n\n \/\/ returns true if the client is connected to the network\n bool is_connected() const;\n bts::net::node_id_t get_node_id() const;\n\n const config& configure(const fc::path& configuration_directory);\n\n \/\/ functions for taking command-line parameters and passing them on to the p2p node\n void listen_on_port( uint16_t port_to_listen, bool wait_if_not_available);\n void accept_incoming_p2p_connections(bool accept);\n void listen_to_p2p_network();\n static fc::ip::endpoint string_to_endpoint(const std::string& remote_endpoint);\n void add_node( const string& remote_endpoint );\n void connect_to_peer( const string& remote_endpoint );\n void connect_to_p2p_network();\n\n fc::ip::endpoint get_p2p_listening_endpoint() const;\n bool handle_message(const bts::net::message&, bool sync_mode);\n void sync_status(uint32_t item_type, uint32_t item_count);\n\n protected:\n virtual bts::api::common_api* get_impl() const override;\n\n private:\n unique_ptr<detail::client_impl> my;\n };\n\n typedef shared_ptr<client> client_ptr;\n\n \/* Message broadcast on the network to notify all clients of some important information\n (security vulnerability, new version, that sort of thing) *\/\n class client_notification\n {\n public:\n fc::time_point_sec timestamp;\n string message;\n fc::ecc::compact_signature signature;\n\n \/\/client_notification();\n fc::sha256 digest() const;\n void sign(const fc::ecc::private_key& key);\n fc::ecc::public_key signee() const;\n };\n typedef shared_ptr<client_notification> client_notification_ptr;\n\n} } \/\/ bts::client\n\nextern const std::string BTS_MESSAGE_MAGIC;\n\nFC_REFLECT(bts::client::client_notification, (timestamp)(message)(signature) )\nFC_REFLECT( bts::client::rpc_server_config, (enable)(rpc_user)(rpc_password)(rpc_endpoint)(httpd_endpoint)(htdocs) )\nFC_REFLECT( bts::client::chain_server_config, (enabled)(listen_port) )\nFC_REFLECT( bts::client::config,\n (rpc)(default_peers)(chain_servers)(chain_server)(mail_server_enabled)\n (wallet_enabled)(ignore_console)(logging)\n (delegate_server)\n (default_delegate_peers)\n (growl_notify_endpoint)\n (growl_password)\n (growl_bitshares_client_identifier) )\n\n<commit_msg>Fix seed node ports<commit_after>#pragma once\n#include <bts\/blockchain\/chain_database.hpp>\n#include <bts\/wallet\/wallet.hpp>\n#include <bts\/net\/node.hpp>\n#include <bts\/rpc\/rpc_client_api.hpp>\n#include <bts\/api\/common_api.hpp>\n#include <bts\/rpc_stubs\/common_api_client.hpp>\n#include <fc\/thread\/thread.hpp>\n#include <fc\/log\/logger_config.hpp>\n#include <memory>\n#include <boost\/program_options.hpp>\n\n\nnamespace bts { namespace rpc {\n class rpc_server;\n typedef std::shared_ptr<rpc_server> rpc_server_ptr;\n} }\nnamespace bts { namespace cli {\n class cli;\n}};\n\nnamespace bts { namespace client {\n\n using namespace bts::blockchain;\n using namespace bts::wallet;\n using namespace bts::mail;\n\n boost::program_options::variables_map parse_option_variables(int argc, char** argv);\n fc::path get_data_dir(const boost::program_options::variables_map& option_variables);\n fc::variant_object version_info();\n\n namespace detail { class client_impl; }\n\n using namespace bts::rpc;\n\n struct rpc_server_config\n {\n rpc_server_config()\n : enable(false),\n rpc_endpoint(fc::ip::endpoint::from_string(\"127.0.0.1:0\")),\n httpd_endpoint(fc::ip::endpoint::from_string(\"127.0.0.1:0\")),\n htdocs(\".\/htdocs\")\n {}\n\n bool enable;\n std::string rpc_user;\n std::string rpc_password;\n fc::ip::endpoint rpc_endpoint;\n fc::ip::endpoint httpd_endpoint;\n fc::path htdocs;\n\n bool is_valid() const; \/* Currently just checks if rpc port is set *\/\n };\n\n struct chain_server_config\n {\n chain_server_config()\n : enabled(false),\n listen_port(0)\n {}\n\n bool enabled;\n uint16_t listen_port;\n };\n\n struct config\n {\n config( ) : \n default_peers(vector<string>{\"104.131.204.143:\", \"54.77.61.238:\", \"54.207.13.136:\", \"54.169.39.185:\"}), \n mail_server_enabled(false),\n wallet_enabled(true),\n ignore_console(false),\n use_upnp(true),\n maximum_number_of_connections(BTS_NET_DEFAULT_MAX_CONNECTIONS) ,\n delegate_server( fc::ip::endpoint::from_string(\"0.0.0.0:0\") ),\n default_delegate_peers( vector<string>({\"107.170.30.182:9988\"}) )\n {\n#ifdef BTS_TEST_NETWORK\n uint32_t port = BTS_NET_TEST_P2P_PORT + BTS_TEST_NETWORK_VERSION;\n default_peers[0] += fc::to_string( port );\n default_peers[1] += fc::to_string( port + 100 );\n default_peers[2] += fc::to_string( port + 200 );\n#else\n uint32_t port = BTS_NET_DEFAULT_P2P_PORT;\n default_peers[0] += fc::to_string( port );\n default_peers[1] += fc::to_string( port );\n default_peers[2] += fc::to_string( port );\n default_peers[3] += fc::to_string( port );\n#endif\n logging = fc::logging_config::default_config();\n }\n\n rpc_server_config rpc;\n vector<string> default_peers;\n vector<string> chain_servers;\n chain_server_config chain_server;\n bool mail_server_enabled;\n bool wallet_enabled;\n bool ignore_console;\n bool use_upnp;\n optional<fc::path> genesis_config;\n uint16_t maximum_number_of_connections;\n fc::logging_config logging;\n fc::ip::endpoint delegate_server;\n vector<string> default_delegate_peers;\n\n fc::optional<std::string> growl_notify_endpoint;\n fc::optional<std::string> growl_password;\n fc::optional<std::string> growl_bitshares_client_identifier;\n };\n\n\n \/**\n * @class client\n * @brief integrates the network, wallet, and blockchain\n *\n *\/\n class client : public bts::rpc_stubs::common_api_client,\n public std::enable_shared_from_this<client>\n {\n public:\n client();\n client(bts::net::simulated_network_ptr network_to_connect_to);\n\n void simulate_disconnect( bool state );\n\n virtual ~client();\n\n void start_networking(std::function<void()> network_started_callback = std::function<void()>());\n void configure_from_command_line(int argc, char** argv);\n fc::future<void> start();\n void open(const path& data_dir,\n optional<fc::path> genesis_file_path = optional<fc::path>(),\n std::function<void(float)> reindex_status_callback = std::function<void(float)>());\n\n void init_cli();\n void set_daemon_mode(bool daemon_mode);\n\n\n chain_database_ptr get_chain()const;\n wallet_ptr get_wallet()const;\n mail_server_ptr get_mail_server()const;\n bts::rpc::rpc_server_ptr get_rpc_server()const;\n bts::net::node_ptr get_node()const;\n fc::path get_data_dir()const;\n\n \/\/ returns true if the client is connected to the network\n bool is_connected() const;\n bts::net::node_id_t get_node_id() const;\n\n const config& configure(const fc::path& configuration_directory);\n\n \/\/ functions for taking command-line parameters and passing them on to the p2p node\n void listen_on_port( uint16_t port_to_listen, bool wait_if_not_available);\n void accept_incoming_p2p_connections(bool accept);\n void listen_to_p2p_network();\n static fc::ip::endpoint string_to_endpoint(const std::string& remote_endpoint);\n void add_node( const string& remote_endpoint );\n void connect_to_peer( const string& remote_endpoint );\n void connect_to_p2p_network();\n\n fc::ip::endpoint get_p2p_listening_endpoint() const;\n bool handle_message(const bts::net::message&, bool sync_mode);\n void sync_status(uint32_t item_type, uint32_t item_count);\n\n protected:\n virtual bts::api::common_api* get_impl() const override;\n\n private:\n unique_ptr<detail::client_impl> my;\n };\n\n typedef shared_ptr<client> client_ptr;\n\n \/* Message broadcast on the network to notify all clients of some important information\n (security vulnerability, new version, that sort of thing) *\/\n class client_notification\n {\n public:\n fc::time_point_sec timestamp;\n string message;\n fc::ecc::compact_signature signature;\n\n \/\/client_notification();\n fc::sha256 digest() const;\n void sign(const fc::ecc::private_key& key);\n fc::ecc::public_key signee() const;\n };\n typedef shared_ptr<client_notification> client_notification_ptr;\n\n} } \/\/ bts::client\n\nextern const std::string BTS_MESSAGE_MAGIC;\n\nFC_REFLECT(bts::client::client_notification, (timestamp)(message)(signature) )\nFC_REFLECT( bts::client::rpc_server_config, (enable)(rpc_user)(rpc_password)(rpc_endpoint)(httpd_endpoint)(htdocs) )\nFC_REFLECT( bts::client::chain_server_config, (enabled)(listen_port) )\nFC_REFLECT( bts::client::config,\n (rpc)(default_peers)(chain_servers)(chain_server)(mail_server_enabled)\n (wallet_enabled)(ignore_console)(logging)\n (delegate_server)\n (default_delegate_peers)\n (growl_notify_endpoint)\n (growl_password)\n (growl_bitshares_client_identifier) )\n\n<|endoftext|>"} {"text":"<commit_before>\/* +---------------------------------------------------------------------------+\n | The Mobile Robot Programming Toolkit (MRPT) |\n | |\n | http:\/\/www.mrpt.org\/ |\n | |\n | Copyright (c) 2005-2013, Individual contributors, see AUTHORS file |\n | Copyright (c) 2005-2013, MAPIR group, University of Malaga |\n | Copyright (c) 2012-2013, University of Almeria |\n | All rights 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 copyright holders 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 LIMITED |\n | TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR|\n | PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDERS 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) |\n | HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, |\n | STRICT 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 <mrpt\/base.h>\n#include <gtest\/gtest.h>\n\nusing namespace mrpt;\nusing namespace mrpt::slam;\nusing namespace mrpt::utils;\nusing namespace mrpt::math;\nusing namespace std;\n\n\/\/ Defined in run_unittests.cpp\nnamespace mrpt { namespace utils {\n\textern std::string MRPT_GLOBAL_UNITTEST_SRC_DIR;\n }\n}\n\n\n\/\/ Load data from constant file and check for exact match.\nTEST(SerializeTestBase, LoadDemoFile)\n{\n\tstruct TRegs\n\t{\n\t\tuint8_t\t\tv1;\n\t\tint8_t\t\tv2;\n\t\tuint16_t\tv3;\n\t\tint16_t\t\tv4;\n\t\tuint32_t\tv5;\n\t\tint32_t\t\tv6;\n\t\tuint64_t\tv7;\n\t\tint64_t\t\tv8;\n\t\tstd::string \tv9;\n\t};\n\n\t\/\/ Reference data:\n\tTRegs\tR;\n\tR.v1 = 8;\n\tR.v2 = -3;\n\tR.v3 = 781;\n\tR.v4 = -888;\n\tR.v5 = 100000;\n\tR.v6 = -100000;\n\tR.v7 = 555666777;\n\tR.v8 = -555666777;\n\tR.v9 = \"an example test\";\n\n\t\/\/ Loaded data to compare with reference:\n\tTRegs\tL;\n\tconst string fil = MRPT_GLOBAL_UNITTEST_SRC_DIR + string(\"\/tests\/serialize_test_data.bin\");\n\n\tif (!mrpt::system::fileExists(fil))\n\t{\n\t\tcerr << \"WARNING: Skipping test due to missing file: \" << fil << \"\\n\";\n\t}\n\telse\n\t{\n\t\tCFileInputStream\tgg( fil );\n\t\tgg >> L.v1 >> L.v2 >> L.v3 >> L.v4 >> L.v5 >> L.v6 >> L.v7 >> L.v8 >> L.v9;\n\n\t\tEXPECT_EQ(R.v1,L.v1 );\n\t\tEXPECT_EQ(R.v2,L.v2 );\n\t\tEXPECT_EQ(R.v3,L.v3 );\n\t\tEXPECT_EQ(R.v4,L.v4 );\n\t\tEXPECT_EQ(R.v5,L.v5 );\n\t\tEXPECT_EQ(R.v6,L.v6 );\n\t\tEXPECT_EQ(R.v7,L.v7 );\n\t\tEXPECT_EQ(R.v8,L.v8 );\n\t\tEXPECT_EQ(R.v9,L.v9 );\n\t}\n}\n\n\/\/ Create a set of classes, then serialize and deserialize to test possible bugs:\nTEST(SerializeTestBase, WriteReadToMem)\n{\n\tconst mrpt::utils::TRuntimeClassId* lstClasses[] = {\n\t\t\/\/ Misc:\n\t\tCLASS_ID(CPose2D),\n\t\tCLASS_ID(CPose3D),\n\t\tCLASS_ID(CPose3DQuat),\n\t\tCLASS_ID(CPoint2D),\n\t\tCLASS_ID(CPoint3D),\n\t\t\/\/ Poses:\n\t\tCLASS_ID(CPose3DPDFGaussian),\n\t\tCLASS_ID(CPose3DQuatPDFGaussian)\n\t\t};\n\n\tfor (size_t i=0;i<sizeof(lstClasses)\/sizeof(lstClasses[0]);i++)\n\t{\n\t\ttry\n\t\t{\n\t\t\tCMemoryStream buf;\n\t\t\t{\n\t\t\t\tCSerializable* o = static_cast<CSerializable*>(lstClasses[i]->createObject());\n\t\t\t\tbuf << *o;\n\t\t\t\tdelete o;\n\t\t\t}\n\n\t\t\tCSerializablePtr recons;\n\t\t\tbuf.Seek(0);\n\t\t\tbuf >> recons;\n\t\t}\n\t\tcatch(std::exception &e)\n\t\t{\n\t\t\tGTEST_FAIL() <<\n\t\t\t\t\"Exception during serialization test for class '\"<< lstClasses[i]->className <<\"':\\n\" << e.what() << endl;\n\t\t}\n\t}\n}\n\n\/\/ Create a set of classes, then serialize and deserialize to test possible bugs:\nTEST(SerializeTestBase, CArray)\n{\n\ttry\n\t{\n\t\tCMemoryStream buf;\n\t\tCArrayDouble<5> a, b;\n\t\tfor (CArrayDouble<5>::Index i=0;i<a.size();i++) a[i] = i+10;\n\n\t\tbuf << a;\n\t\tbuf.Seek(0);\n\t\tbuf >> b;\n\n\t\tEXPECT_TRUE(a==b);\n\t}\n\tcatch(std::exception &e)\n\t{\n\t\tGTEST_FAIL() <<\n\t\t\t\"Exception:\\n\" << e.what() << endl;\n\t}\n\n}\n\n<commit_msg>New STL serialization unit test<commit_after>\/* +---------------------------------------------------------------------------+\n | The Mobile Robot Programming Toolkit (MRPT) |\n | |\n | http:\/\/www.mrpt.org\/ |\n | |\n | Copyright (c) 2005-2013, Individual contributors, see AUTHORS file |\n | Copyright (c) 2005-2013, MAPIR group, University of Malaga |\n | Copyright (c) 2012-2013, University of Almeria |\n | All rights 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 copyright holders 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 LIMITED |\n | TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR|\n | PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDERS 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) |\n | HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, |\n | STRICT 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 <mrpt\/base.h>\n#include <gtest\/gtest.h>\n\nusing namespace mrpt;\nusing namespace mrpt::slam;\nusing namespace mrpt::utils;\nusing namespace mrpt::math;\nusing namespace std;\n\n\/\/ Defined in run_unittests.cpp\nnamespace mrpt { namespace utils {\n\textern std::string MRPT_GLOBAL_UNITTEST_SRC_DIR;\n }\n}\n\n\n\/\/ Load data from constant file and check for exact match.\nTEST(SerializeTestBase, LoadDemoFile)\n{\n\tstruct TRegs\n\t{\n\t\tuint8_t\t\tv1;\n\t\tint8_t\t\tv2;\n\t\tuint16_t\tv3;\n\t\tint16_t\t\tv4;\n\t\tuint32_t\tv5;\n\t\tint32_t\t\tv6;\n\t\tuint64_t\tv7;\n\t\tint64_t\t\tv8;\n\t\tstd::string \tv9;\n\t};\n\n\t\/\/ Reference data:\n\tTRegs\tR;\n\tR.v1 = 8;\n\tR.v2 = -3;\n\tR.v3 = 781;\n\tR.v4 = -888;\n\tR.v5 = 100000;\n\tR.v6 = -100000;\n\tR.v7 = 555666777;\n\tR.v8 = -555666777;\n\tR.v9 = \"an example test\";\n\n\t\/\/ Loaded data to compare with reference:\n\tTRegs\tL;\n\tconst string fil = MRPT_GLOBAL_UNITTEST_SRC_DIR + string(\"\/tests\/serialize_test_data.bin\");\n\n\tif (!mrpt::system::fileExists(fil))\n\t{\n\t\tcerr << \"WARNING: Skipping test due to missing file: \" << fil << \"\\n\";\n\t}\n\telse\n\t{\n\t\tCFileInputStream\tgg( fil );\n\t\tgg >> L.v1 >> L.v2 >> L.v3 >> L.v4 >> L.v5 >> L.v6 >> L.v7 >> L.v8 >> L.v9;\n\n\t\tEXPECT_EQ(R.v1,L.v1 );\n\t\tEXPECT_EQ(R.v2,L.v2 );\n\t\tEXPECT_EQ(R.v3,L.v3 );\n\t\tEXPECT_EQ(R.v4,L.v4 );\n\t\tEXPECT_EQ(R.v5,L.v5 );\n\t\tEXPECT_EQ(R.v6,L.v6 );\n\t\tEXPECT_EQ(R.v7,L.v7 );\n\t\tEXPECT_EQ(R.v8,L.v8 );\n\t\tEXPECT_EQ(R.v9,L.v9 );\n\t}\n}\n\n\/\/ Create a set of classes, then serialize and deserialize to test possible bugs:\nTEST(SerializeTestBase, WriteReadToMem)\n{\n\tconst mrpt::utils::TRuntimeClassId* lstClasses[] = {\n\t\t\/\/ Misc:\n\t\tCLASS_ID(CPose2D),\n\t\tCLASS_ID(CPose3D),\n\t\tCLASS_ID(CPose3DQuat),\n\t\tCLASS_ID(CPoint2D),\n\t\tCLASS_ID(CPoint3D),\n\t\t\/\/ Poses:\n\t\tCLASS_ID(CPose3DPDFGaussian),\n\t\tCLASS_ID(CPose3DQuatPDFGaussian)\n\t\t};\n\n\tfor (size_t i=0;i<sizeof(lstClasses)\/sizeof(lstClasses[0]);i++)\n\t{\n\t\ttry\n\t\t{\n\t\t\tCMemoryStream buf;\n\t\t\t{\n\t\t\t\tCSerializable* o = static_cast<CSerializable*>(lstClasses[i]->createObject());\n\t\t\t\tbuf << *o;\n\t\t\t\tdelete o;\n\t\t\t}\n\n\t\t\tCSerializablePtr recons;\n\t\t\tbuf.Seek(0);\n\t\t\tbuf >> recons;\n\t\t}\n\t\tcatch(std::exception &e)\n\t\t{\n\t\t\tGTEST_FAIL() <<\n\t\t\t\t\"Exception during serialization test for class '\"<< lstClasses[i]->className <<\"':\\n\" << e.what() << endl;\n\t\t}\n\t}\n}\n\n\/\/ Create a set of classes, then serialize and deserialize to test possible bugs:\nTEST(SerializeTestBase, CArray)\n{\n\ttry\n\t{\n\t\tCMemoryStream buf;\n\t\tCArrayDouble<5> a, b;\n\t\tfor (CArrayDouble<5>::Index i=0;i<a.size();i++) a[i] = i+10;\n\n\t\tbuf << a;\n\t\tbuf.Seek(0);\n\t\tbuf >> b;\n\n\t\tEXPECT_TRUE(a==b);\n\t}\n\tcatch(std::exception &e)\n\t{\n\t\tGTEST_FAIL() <<\n\t\t\t\"Exception:\\n\" << e.what() << endl;\n\t}\n\n}\n\n\/\/ Serialize and deserialize complex STL types\nTEST(SerializeTestBase, STL_serialization)\n{\n\ttry\n\t{\n\t\t\/\/ std::vector<>\n\t\t{\n\t\t\tCMemoryStream buf;\n\n\t\t\tstd::vector<double> a,b;\n\t\t\ta.resize(30);\n\t\t\tfor (size_t i=0;i<a.size();i++) a[i]=50-i;\n\n\t\t\tbuf << a; buf.Seek(0); buf >> b;\n\t\t\tEXPECT_TRUE(a==b);\n\t\t}\n\n\t\t\/\/ std::list<...>\n\t\t{\n\t\t\tCMemoryStream buf;\n\n\t\t\tstd::list<std::map<double,std::set<std::string> > > a,b;\n\n\t\t\t\/\/ Fill with random:\n\t\t\tmrpt::random::CRandomGenerator rng;\n\t\t\tconst size_t N = rng.drawUniform(10,30);\n\t\t\tfor (size_t i=0;i<N;i++)\n\t\t\t{\n\t\t\t\tstd::map<double,std::set<std::string> > d;\n\t\t\t\tconst size_t M = rng.drawUniform(4,9);\n\t\t\t\tfor (size_t j=0;j<M;j++)\n\t\t\t\t{\n\t\t\t\t\tstd::set<std::string> & dd = d[ rng.drawGaussian1D_normalized() ];\n\t\t\t\t\tconst size_t L = rng.drawUniform(2,15);\n\t\t\t\t\tfor (size_t k=0;k<L;k++)\n\t\t\t\t\t\tdd.insert(mrpt::format(\"%f\", rng.drawGaussian1D_normalized() ));\n\t\t\t\t}\n\t\t\t\ta.push_back(d);\n\t\t\t}\n\n\n\t\t\tbuf << a; buf.Seek(0); buf >> b;\n\t\t\tEXPECT_TRUE(a==b);\n\t\t}\n\t}\n\tcatch(std::exception &e)\n\t{\n\t\tGTEST_FAIL() <<\n\t\t\t\"Exception:\\n\" << e.what() << endl;\n\t}\n\n}\n\n<|endoftext|>"} {"text":"<commit_before>\/\/ Copyright (c) 2013-2014 Flowgrammable.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,\n\/\/ software distributed under the License is distributed on an \"AS IS\"\n\/\/ BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express\n\/\/ or implied. See the License for the specific language governing\n\/\/ permissions and limitations under the License.\n\n#include <iostream>\n#include <fstream>\n#include <iterator>\n#include <string>\n#include <vector>\n#include <map>\n#include <assert.h>\n\n#include <freeflow\/sys\/socket.hpp>\n#include <freeflow\/sys\/json.hpp>\n\nusing namespace std;\nusing namespace freeflow;\nusing namespace json;\n\nnamespace cli {\n\nusing String_map = map<string, string>;\nusing String_list = vector<string>;\n\n\nstd::pair<std::string, std::string>\nparse_flag(const std::string& arg) {\n \/\/ If the argument is only '-', that's an error\n if (arg.size() == 1)\n throw std::runtime_error(\"parse error\");\n\n \/\/ Make sure that p points to the first non-flag character.\n std::size_t p = 1;\n if (arg[p] == '-')\n ++p;\n\n \/\/ If the flag is \"--\", that's an error.\n if (p == arg.size())\n throw std::runtime_error(\"parse error\");\n\n \/\/ Parse the name from the flag. If the flag is of the from\n \/\/ f=x, this parses out f. If the '=' is not present, this\n \/\/ returns the name f.\n std::string name;\n std::size_t n = arg.find_first_of('=', p);\n if (n != arg.npos)\n name = arg.substr(p, n - p);\n else\n return {arg.substr(p), \"true\"};\n\n \/\/ Parse the value. In a flag of the form f=x, this is everything\n \/\/ past the '='. If the value is empty, return as if it were \"null\".\n string value = arg.substr(n + 1);\n if (value.empty())\n return {std::move(name), \"null\"};\n else\n return {std::move(name), std::move(value)};\n}\n\n\/\/ Parses the command line inputs into flags and positional arguments\nvoid\nparse(int argc, char *argv[], String_map& opts, String_list& args) {\n for (int i = 0; i < argc; ++i) {\n if (argv[i][0] == '-')\n opts.insert(parse_flag(argv[i]));\n else\n args.push_back(argv[i]);\n }\n}\n\n} \/\/ namespace cli\n\nusing namespace cli;\n\nint\nmain(int argc, char *argv[]) {\n String_map opts;\n String_list args;\n \n parse(argc, argv, opts, args);\n \n std::cout << \"== options ==\\n\";\n for (auto &f : opts)\n std::cout << f.first << \" : \" << f.second << '\\n';\n \n std::cout << endl << \"== positional args ==\\n\";\n for (auto &s : args)\n std::cout << s << endl;\n \n return 0;\n}\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n<commit_msg>Speculative design for cli\/<commit_after>\/\/ Copyright (c) 2013-2014 Flowgrammable.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,\n\/\/ software distributed under the License is distributed on an \"AS IS\"\n\/\/ BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express\n\/\/ or implied. See the License for the specific language governing\n\/\/ permissions and limitations under the License.\n\n#include <iostream>\n#include <fstream>\n#include <iterator>\n#include <string>\n#include <vector>\n#include <map>\n#include <assert.h>\n\n#include <freeflow\/sys\/socket.hpp>\n#include <freeflow\/sys\/json.hpp>\n\nusing namespace std;\nusing namespace freeflow;\nusing namespace json;\n\nnamespace cli {\n\nusing String_map = map<string, string>;\nusing String_list = vector<string>;\n\n\nstd::pair<std::string, std::string>\nparse_flag(const std::string& arg) {\n \/\/ If the argument is only '-', that's an error\n if (arg.size() == 1)\n throw std::runtime_error(\"parse error\");\n\n \/\/ Make sure that p points to the first non-flag character.\n std::size_t p = 1;\n if (arg[p] == '-')\n ++p;\n\n \/\/ If the flag is \"--\", that's an error.\n if (p == arg.size())\n throw std::runtime_error(\"parse error\");\n\n \/\/ Parse the name from the flag. If the flag is of the from\n \/\/ f=x, this parses out f. If the '=' is not present, this\n \/\/ returns the name f.\n std::string name;\n std::size_t n = arg.find_first_of('=', p);\n if (n != arg.npos)\n name = arg.substr(p, n - p);\n else\n return {arg.substr(p), \"true\"};\n\n \/\/ Parse the value. In a flag of the form f=x, this is everything\n \/\/ past the '='. If the value is empty, return as if it were \"null\".\n string value = arg.substr(n + 1);\n if (value.empty())\n return {std::move(name), \"null\"};\n else\n return {std::move(name), std::move(value)};\n}\n\n\/\/ Parses the command line inputs into flags and positional arguments\nvoid\nparse(int argc, char *argv[], String_map& opts, String_list& args) {\n for (int i = 0; i < argc; ++i) {\n if (argv[i][0] == '-')\n opts.insert(parse_flag(argv[i]));\n else\n args.push_back(argv[i]);\n }\n}\n\n\/\/ struct Bool {\n\/\/ json::Value operator()(const std::string& s) const {\n \n\/\/ \/\/ Check that s is one of:\n\/\/ \/\/ - true | false\n\/\/ \/\/ - yes | no\n\/\/ \/\/ - on | off\n\n\/\/ \/\/ Throw an exception if it isnt?\n \n\/\/ return true;\n\/\/ }\n\/\/ };\n\n} \/\/ namespace cli\n\nusing namespace cli;\n\nint\nmain(int argc, char *argv[]) {\n String_map opts;\n String_list args;\n \n parse(argc, argv, opts, args);\n \n std::cout << \"== options ==\\n\";\n for (auto &f : opts)\n std::cout << f.first << \" : \" << f.second << '\\n';\n \n std::cout << endl << \"== positional args ==\\n\";\n for (auto &s : args)\n std::cout << s << endl;\n \n \/\/ { \n \/\/ Parameter<Bool> p1(\"flag\", \"f\", \"Indicate that flag is set\");\n\n \/\/ json::Value v1 = p1.get(opts);\n \/\/ }\n\n return 0;\n}\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n<|endoftext|>"} {"text":"<commit_before>\/\/ Copyright (c) 2013-2014 Flowgrammable.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,\n\/\/ software distributed under the License is distributed on an \"AS IS\"\n\/\/ BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express\n\/\/ or implied. See the License for the specific language governing\n\/\/ permissions and limitations under the License.\n\n\n\n#include <assert.h>\n\n#include <freeflow\/sys\/socket.hpp>\n#include <freeflow\/sys\/json.hpp>\n#include <freeflow\/sys\/cli.hpp>\n\n#include \"command.hpp\"\n\nusing namespace std;\nusing namespace freeflow;\n\n\nstruct Add_command : cli::Command {\n Add_command() \n : Command(\"add\", \"Add something to something else\")\n {\n declare(\"name\", cli::String_typed(), cli::REQUIRED, \"The name of the thing added\");\n declare(\"path\", cli::String_typed(), cli::REQUIRED, \"The path to the thing added\");\n declare(\"config\", cli::String_typed(), cli::REQUIRED, \"Path to a configuration file\");\n declare(\"version\", cli::String_typed(), cli::REQUIRED, \"The version of the thing added\");\n declare(\"flag\", cli::Bool_typed(), cli::REQUIRED, \"A mysterious flag\");\n }\n\n bool run(const cli::Arguments& args) { \n std::cout << \"Adding...\\n\";\n return true; \n }\n};\n\nstruct Del_command : cli::Command {\n Del_command() \n : Command(\"del\", \"Remove something from something else\")\n {\n declare(\"name\", cli::String_typed(), cli::REQUIRED, \"The name of the thing removed\");\n declare(\"path\", cli::String_typed(), cli::REQUIRED, \"The path to the thing being removed\");\n declare(\"config\", cli::String_typed(), cli::REQUIRED, \"Path to a configuration file\");\n }\n\n bool run(const cli::Arguments& args) {\n std::cout << \"Removing...\\n\";\n return true;\n }\n};\n\n\nint\nmain(int argc, char *argv[]) {\n bool success = true;\n \/\/ Create program options.\n cli::Parameters parms;\n parms.declare(\"flag, f\", cli::Bool_typed(), cli::REQUIRED, \"Just a flag\");\n parms.declare(\"number\", cli::Real_typed(), \"42\", \"Just a number\");\n parms.declare(\"name\", cli::String_typed(), \"some value\", \"The name of something\");\n parms.declare(\"config\", cli::String_typed(), cli::OPTIONAL, \"The path to a configuration file\");\n parms.declare(\"path\", cli::String_typed(), \"*default path*\", \"Path to something\");\n parms.declare(\"version, v\", cli::Real_typed(), cli::REQUIRED, \"Version of something\");\n\n \/\/ Create commands.\n cli::Commands cmds;\n cmds.declare<Add_command>();\n cmds.declare<Del_command>();\n\n\/\/ ---------------- Parse global arguments up to the command ---------------- \/\/\n \/\/ Initialize the parse state\n cli::Parse_state ps(argc, 0, argv);\n\n \/\/ Initialize the program arguments\n cli::Arguments program_args;\n\n \/\/ Parse the environment for program options\n const char* prefix = \"flog\";\n parse_env(parms, program_args, prefix);\n\n \/\/ Parse the command-line for program options up to the command\n parse_keyword_args(parms, program_args, ps);\n\n \/\/ Check program args\n success &= check_args(parms, program_args);\n\n \/\/ if (!success){ \n \/\/ program_args.display_errors(*cmd, prefix);\n \/\/ }\n\/\/ -------------------------------------------------------------------------- \/\/\n\n\/\/ ---------- Parse the command and its named\/positional arguments ---------- \/\/\n \/\/ Make sure a command name was provided\n if (ps.current == ps.argc) {\n std::cerr << \"error: a command must be provided\\n\";\n return -1;\n }\n \n \/\/ Make sure the command exists\n std::string cmd_name = ps.argv[ps.current];\n if (!cmds.count(cmd_name)) {\n std::cerr << \"error: command not recognized\\n\";\n return -1;\n }\n\n \/\/ FIXME: If this returns null, it will crash.\n cli::Parameters command_parms = cmds.find(cmd_name)->second->parms();\n cli::Arguments command_args;\n \/\/ Parse command args\n parse_args(command_parms, command_args, ps);\n\n \/\/ Check command args\n success &= check_args(command_parms, command_args);\n\n \/\/ if (!success){ \n \/\/ program_args.display_errors(*cmd, prefix);\n \/\/ }\n\n return 0;\n \/\/ \/\/ Parse arguments.\n \/\/ cli::Arguments args;\n \/\/ if (parse(parms, cmds, args, argc, argv, \"flog\"))\n \/\/ return 0;\n \/\/ else\n \/\/ return -1; \n\n \/\/ What command did I parse?\n}\n<commit_msg>worked on error handling for parsing<commit_after>\/\/ Copyright (c) 2013-2014 Flowgrammable.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,\n\/\/ software distributed under the License is distributed on an \"AS IS\"\n\/\/ BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express\n\/\/ or implied. See the License for the specific language governing\n\/\/ permissions and limitations under the License.\n\n\n\n#include <assert.h>\n\n#include <freeflow\/sys\/socket.hpp>\n#include <freeflow\/sys\/json.hpp>\n#include <freeflow\/sys\/cli.hpp>\n\n#include \"command.hpp\"\n\nusing namespace std;\nusing namespace freeflow;\n\n\nstruct Add_command : cli::Command {\n Add_command() \n : Command(\"add\", \"Add something to something else\")\n {\n declare(\"name\", cli::String_typed(), cli::REQUIRED, \"The name of the thing added\");\n declare(\"path\", cli::String_typed(), cli::REQUIRED, \"The path to the thing added\");\n declare(\"config\", cli::String_typed(), cli::REQUIRED, \"Path to a configuration file\");\n declare(\"version\", cli::String_typed(), cli::REQUIRED, \"The version of the thing added\");\n declare(\"flag\", cli::Bool_typed(), cli::REQUIRED, \"A mysterious flag\");\n }\n\n bool run(const cli::Arguments& args) { \n std::cout << \"Adding...\\n\";\n return true; \n }\n};\n\nstruct Del_command : cli::Command {\n Del_command() \n : Command(\"del\", \"Remove something from something else\")\n {\n declare(\"name\", cli::String_typed(), cli::REQUIRED, \"The name of the thing removed\");\n declare(\"path\", cli::String_typed(), cli::REQUIRED, \"The path to the thing being removed\");\n declare(\"config\", cli::String_typed(), cli::REQUIRED, \"Path to a configuration file\");\n }\n\n bool run(const cli::Arguments& args) {\n std::cout << \"Removing...\\n\";\n return true;\n }\n};\n\n\nint\nmain(int argc, char *argv[]) {\n bool success = true;\n \/\/ Create program options.\n cli::Parameters parms;\n parms.declare(\"flag, f\", cli::Bool_typed(), cli::REQUIRED, \"Just a flag\");\n parms.declare(\"number\", cli::Real_typed(), \"42\", \"Just a number\");\n parms.declare(\"name\", cli::String_typed(), \"some value\", \"The name of something\");\n parms.declare(\"config\", cli::String_typed(), cli::OPTIONAL, \"The path to a configuration file\");\n parms.declare(\"path\", cli::String_typed(), \"*default path*\", \"Path to something\");\n parms.declare(\"version, v\", cli::Real_typed(), cli::REQUIRED, \"Version of something\");\n\n \/\/ Create commands.\n cli::Commands cmds;\n cmds.declare<Add_command>();\n cmds.declare<Del_command>();\n\n\/\/ ---------------- Parse global arguments up to the command ---------------- \/\/\n \/\/ Initialize the parse state\n cli::Parse_state ps(argc, 1, argv);\n if (ps.argc == 1) {\n std::cerr << \"error: a command must be provided\\n\";\n return -1;\n }\n\n \/\/ Initialize the program arguments\n cli::Arguments program_args;\n\n \/\/ Parse the environment for program options\n const char* prefix = \"flog\";\n parse_env(parms, program_args, prefix);\n\n \/\/ Parse the command-line for program options up to the command\n parse_keyword_args(parms, program_args, ps);\n\n \/\/ Check program args\n success &= check_args(parms, program_args);\n\n \/\/ if (!success){ \n \/\/ program_args.display_errors(*cmd, prefix);\n \/\/ }\n\/\/ -------------------------------------------------------------------------- \/\/\n\n\/\/ ---------- Parse the command and its named\/positional arguments ---------- \/\/\n \/\/ Make sure a command name was provided\n if (ps.current == ps.argc) {\n std::cerr << \"error: a command must be provided\\n\";\n return -1;\n }\n \n \/\/ Make sure the command exists\n std::string cmd_name = ps.argv[ps.current];\n cout << cmd_name << endl;\n if (!cmds.count(cmd_name)) {\n std::cerr << \"error: command not recognized\\n\";\n return -1;\n }\n\n \/\/ FIXME: If this returns null, it will crash.\n cli::Command* cmd = cmds.find(cmd_name)->second;\n cli::Arguments command_args;\n \/\/ Parse command args\n parse_args(cmd->parms(), command_args, ps);\n\n \/\/ Check command args\n success &= check_args(cmd->parms(), command_args);\n\n if (!success){ \n \/\/program_args.display_errors(*cmd, prefix);\n std::cout << \"ERROR\\n\";\n return -1;\n }\n\n cmd->run(command_args);\n return 0;\n \/\/ \/\/ Parse arguments.\n \/\/ cli::Arguments args;\n \/\/ if (parse(parms, cmds, args, argc, argv, \"flog\"))\n \/\/ return 0;\n \/\/ else\n \/\/ return -1; \n\n \/\/ What command did I parse?\n}\n<|endoftext|>"} {"text":"<commit_before>#include \"FactorizationTest.h\"\n#include \"Utilities.h\"\n#include \"common\/SchedulerFactory.h\"\n#include \"elves\/common-factorization\/BigInt.h\"\n#include \"elves\/quadratic_sieve\/QuadraticSieve.h\"\n#include \"elves\/quadratic_sieve\/smp\/SmpQuadraticSieveElf.h\"\n#include \"elves\/quadratic_sieve\/cuda\/CudaQuadraticSieveElf.h\"\n\n#include <memory>\n#include <vector>\n#include <algorithm>\n#include <chrono>\n\nusing namespace std;\nusing namespace chrono;\n\ntypedef vector<uint64_t> PrimeList;\n\nconst PrimeList SMALL_PRIMES = { 2, 3, 5, 7, 11, 13, 17, 19, 23 };\nconst PrimeList PRIMES_BELOW_100 = { 2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53, 59, 61, 67, 71, 73, 79, 83, 89, 97 };\n\nINSTANTIATE_TEST_CASE_P(\n PrimePairs,\n FactorizationTest,\n testing::Values(\n \/\/make_pair(BigInt(\"37975227936943673922808872755445627854565536638199\"),\n \/\/ BigInt(\"40094690950920881030683735292761468389214899724061\"))\n \/\/make_pair(BigInt(\"9499938415355683567\"), BigInt(\"33172199367355317419\")),\n make_pair(BigInt(\"551226983117\"), BigInt(\"554724632351\")),\n make_pair(BigInt(\"15485863\"), BigInt(\"15534733\")),\n make_pair(BigInt(\"1313839\"), BigInt(\"1327901\")),\n make_pair(BigInt(\"547\"), BigInt(\"719\")),\n \tmake_pair(BigInt(\"13\"), BigInt(\"11\"))\n )\n);\n\nvoid FactorizationTest::SetUp()\n{\n auto inputPair = GetParam();\n p = inputPair.first;\n q = inputPair.second;\n product = p*q;\n}\n\nTEST_P(FactorizationTest, testFactorizationQuadraticSieve)\n{\n using namespace std::placeholders;\n auto start = high_resolution_clock::now();\n\n unique_ptr<QuadraticSieveElf> elf(new SmpQuadraticSieveElf());\n BigInt actualP, actualQ;\n tie(actualP, actualQ) = QuadraticSieveHelper::factor(product, bind(&QuadraticSieveElf::sieveSmoothSquares, elf.get(), _1, _2, _3, _4));\n\n\n auto end = high_resolution_clock::now();\n milliseconds elapsed = duration_cast<milliseconds>(end - start);\n std::cout << \"total time: \" << elapsed.count() \/ 1000.0 << \" seconds\" << endl;\n\n if(actualP > actualQ)\n swap(actualP, actualQ);\n\n ASSERT_EQ(p, actualP);\n ASSERT_EQ(q, actualQ);\n}\n\n#if 0\nTEST_P(FactorizationTest, testFactorizationCudaQuadraticSieve)\n{\n using namespace std::placeholders;\n auto start = high_resolution_clock::now();\n\n unique_ptr<QuadraticSieveElf> elf(new CudaQuadraticSieveElf());\n BigInt actualP, actualQ;\n tie(actualP, actualQ) = QuadraticSieveHelper::factor(product, bind(&QuadraticSieveElf::sieveSmoothSquares, elf.get(), _1, _2, _3, _4));\n\n\n auto end = high_resolution_clock::now();\n milliseconds elapsed = duration_cast<milliseconds>(end - start);\n std::cout << \"total time: \" << elapsed.count() \/ 1000.0 << \" seconds\" << endl;\n\n if(actualP > actualQ)\n swap(actualP, actualQ);\n\n ASSERT_EQ(p, actualP);\n ASSERT_EQ(q, actualQ);\n}\n#endif\n\nTEST(QuadraticSieveTest, testModularSquareRoot)\n{\n BigInt primeMod(\"104729\");\n\n vector<string> roots = {\"2\", \"12321\", \"4563\", \"34513\", \"13\", \"567856\", \"103729\"};\n\n for(const string& rootstring : roots)\n {\n BigInt expectedRoot(rootstring);\n BigInt n = (expectedRoot*expectedRoot) % primeMod;\n BigInt root = QuadraticSieveHelper::rootModPrime(n, primeMod);\n ASSERT_NE(0, root);\n ASSERT_EQ(n, (root*root)%primeMod);\n }\n}\n\nTEST(QuadraticSieveTest, testModularSquareRoot2)\n{\n BigInt primeMod(\"2909\");\n\n vector<string> roots = {\"305779185551528709018067\"};\n\n for(const string& rootstring : roots)\n {\n BigInt expectedRoot(rootstring);\n BigInt n = (expectedRoot*expectedRoot) % primeMod;\n BigInt root = QuadraticSieveHelper::rootModPrime(n, primeMod);\n ASSERT_NE(0, root);\n ASSERT_EQ(n, (root*root)%primeMod);\n }\n}\n\n\nTEST(QuadraticSieveTest, testModularSquareRootInvalid)\n{\n BigInt primeMod(\"7\");\n BigInt n(\"3\");\n\n ASSERT_THROW(QuadraticSieveHelper::rootModPrime(n, primeMod), logic_error);\n}\n\nTEST(QuadraticSieveTest, testExtensiveSquareRooting)\n{\n vector<string> primeStrings = {\"2\", \"3\", \"5\", \"7\", \"11\", \"13\", \"71\", \"229\", \"541\"};\n BigInt threshold(\"10000\");\n\n BigInt primePower;\n for(const string& primeString : primeStrings)\n {\n BigInt prime(primeString);\n BigInt primePower = prime;\n for(uint32_t power=1; primePower < threshold; power++, primePower*=prime)\n {\n map<BigInt, vector<BigInt>> rootsPerResidue;\n for(BigInt x=0; x<primePower; ++x)\n {\n BigInt residue = (x*x) % primePower;\n rootsPerResidue[residue].push_back(x);\n }\n\n for (auto& rpr: rootsPerResidue) {\n const BigInt& residue = rpr.first;\n const vector<BigInt>& expectedRoots = rpr.second;\n\n auto actualRoots = QuadraticSieveHelper::squareRootsModPrimePower(\n residue, prime, power);\n sort(actualRoots.begin(), actualRoots.end());\n\n ASSERT_EQ(expectedRoots.size(), actualRoots.size()) << \"Vectors x and y are of unequal length\";\n for (size_t i = 0; i < actualRoots.size(); ++i) {\n ASSERT_EQ(expectedRoots[i], actualRoots[i]) << \"Vectors x and y differ at index \" << i;\n }\n }\n }\n }\n}\n<commit_msg>Commented smallest prime<commit_after>#include \"FactorizationTest.h\"\n#include \"Utilities.h\"\n#include \"common\/SchedulerFactory.h\"\n#include \"elves\/common-factorization\/BigInt.h\"\n#include \"elves\/quadratic_sieve\/QuadraticSieve.h\"\n#include \"elves\/quadratic_sieve\/smp\/SmpQuadraticSieveElf.h\"\n#include \"elves\/quadratic_sieve\/cuda\/CudaQuadraticSieveElf.h\"\n\n#include <memory>\n#include <vector>\n#include <algorithm>\n#include <chrono>\n\nusing namespace std;\nusing namespace chrono;\n\ntypedef vector<uint64_t> PrimeList;\n\nconst PrimeList SMALL_PRIMES = { 2, 3, 5, 7, 11, 13, 17, 19, 23 };\nconst PrimeList PRIMES_BELOW_100 = { 2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53, 59, 61, 67, 71, 73, 79, 83, 89, 97 };\n\nINSTANTIATE_TEST_CASE_P(\n PrimePairs,\n FactorizationTest,\n testing::Values(\n \/\/make_pair(BigInt(\"37975227936943673922808872755445627854565536638199\"),\n \/\/ BigInt(\"40094690950920881030683735292761468389214899724061\"))\n \/\/make_pair(BigInt(\"9499938415355683567\"), BigInt(\"33172199367355317419\")),\n make_pair(BigInt(\"551226983117\"), BigInt(\"554724632351\")),\n make_pair(BigInt(\"15485863\"), BigInt(\"15534733\")),\n make_pair(BigInt(\"1313839\"), BigInt(\"1327901\")),\n make_pair(BigInt(\"547\"), BigInt(\"719\"))\n \t\/\/make_pair(BigInt(\"13\"), BigInt(\"11\")) \/\/ too small\n )\n);\n\nvoid FactorizationTest::SetUp()\n{\n auto inputPair = GetParam();\n p = inputPair.first;\n q = inputPair.second;\n product = p*q;\n}\n\nTEST_P(FactorizationTest, testFactorizationQuadraticSieve)\n{\n using namespace std::placeholders;\n auto start = high_resolution_clock::now();\n\n unique_ptr<QuadraticSieveElf> elf(new SmpQuadraticSieveElf());\n BigInt actualP, actualQ;\n tie(actualP, actualQ) = QuadraticSieveHelper::factor(product, bind(&QuadraticSieveElf::sieveSmoothSquares, elf.get(), _1, _2, _3, _4));\n\n\n auto end = high_resolution_clock::now();\n milliseconds elapsed = duration_cast<milliseconds>(end - start);\n std::cout << \"total time: \" << elapsed.count() \/ 1000.0 << \" seconds\" << endl;\n\n if(actualP > actualQ)\n swap(actualP, actualQ);\n\n ASSERT_EQ(p, actualP);\n ASSERT_EQ(q, actualQ);\n}\n\n#if 0\nTEST_P(FactorizationTest, testFactorizationCudaQuadraticSieve)\n{\n using namespace std::placeholders;\n auto start = high_resolution_clock::now();\n\n unique_ptr<QuadraticSieveElf> elf(new CudaQuadraticSieveElf());\n BigInt actualP, actualQ;\n tie(actualP, actualQ) = QuadraticSieveHelper::factor(product, bind(&QuadraticSieveElf::sieveSmoothSquares, elf.get(), _1, _2, _3, _4));\n\n\n auto end = high_resolution_clock::now();\n milliseconds elapsed = duration_cast<milliseconds>(end - start);\n std::cout << \"total time: \" << elapsed.count() \/ 1000.0 << \" seconds\" << endl;\n\n if(actualP > actualQ)\n swap(actualP, actualQ);\n\n ASSERT_EQ(p, actualP);\n ASSERT_EQ(q, actualQ);\n}\n#endif\n\nTEST(QuadraticSieveTest, testModularSquareRoot)\n{\n BigInt primeMod(\"104729\");\n\n vector<string> roots = {\"2\", \"12321\", \"4563\", \"34513\", \"13\", \"567856\", \"103729\"};\n\n for(const string& rootstring : roots)\n {\n BigInt expectedRoot(rootstring);\n BigInt n = (expectedRoot*expectedRoot) % primeMod;\n BigInt root = QuadraticSieveHelper::rootModPrime(n, primeMod);\n ASSERT_NE(0, root);\n ASSERT_EQ(n, (root*root)%primeMod);\n }\n}\n\nTEST(QuadraticSieveTest, testModularSquareRoot2)\n{\n BigInt primeMod(\"2909\");\n\n vector<string> roots = {\"305779185551528709018067\"};\n\n for(const string& rootstring : roots)\n {\n BigInt expectedRoot(rootstring);\n BigInt n = (expectedRoot*expectedRoot) % primeMod;\n BigInt root = QuadraticSieveHelper::rootModPrime(n, primeMod);\n ASSERT_NE(0, root);\n ASSERT_EQ(n, (root*root)%primeMod);\n }\n}\n\n\nTEST(QuadraticSieveTest, testModularSquareRootInvalid)\n{\n BigInt primeMod(\"7\");\n BigInt n(\"3\");\n\n ASSERT_THROW(QuadraticSieveHelper::rootModPrime(n, primeMod), logic_error);\n}\n\nTEST(QuadraticSieveTest, testExtensiveSquareRooting)\n{\n vector<string> primeStrings = {\"2\", \"3\", \"5\", \"7\", \"11\", \"13\", \"71\", \"229\", \"541\"};\n BigInt threshold(\"10000\");\n\n BigInt primePower;\n for(const string& primeString : primeStrings)\n {\n BigInt prime(primeString);\n BigInt primePower = prime;\n for(uint32_t power=1; primePower < threshold; power++, primePower*=prime)\n {\n map<BigInt, vector<BigInt>> rootsPerResidue;\n for(BigInt x=0; x<primePower; ++x)\n {\n BigInt residue = (x*x) % primePower;\n rootsPerResidue[residue].push_back(x);\n }\n\n for (auto& rpr: rootsPerResidue) {\n const BigInt& residue = rpr.first;\n const vector<BigInt>& expectedRoots = rpr.second;\n\n auto actualRoots = QuadraticSieveHelper::squareRootsModPrimePower(\n residue, prime, power);\n sort(actualRoots.begin(), actualRoots.end());\n\n ASSERT_EQ(expectedRoots.size(), actualRoots.size()) << \"Vectors x and y are of unequal length\";\n for (size_t i = 0; i < actualRoots.size(); ++i) {\n ASSERT_EQ(expectedRoots[i], actualRoots[i]) << \"Vectors x and y differ at index \" << i;\n }\n }\n }\n }\n}\n<|endoftext|>"} {"text":"<commit_before>\/*=========================================================================\n\nProgram: Medical Imaging & Interaction Toolkit\nLanguage: C++\nDate: $Date: 2009-07-14 19:11:20 +0200 (Tue, 14 Jul 2009) $\nVersion: $Revision: 18127 $\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#ifndef __mitkNrrdDiffusionImageReader_cpp\n#define __mitkNrrdDiffusionImageReader_cpp\n\n#include \"mitkNrrdDiffusionImageReader.h\"\n\n#include \"itkImageFileReader.h\"\n#include \"itkMetaDataObject.h\"\n#include \"itkNrrdImageIO.h\"\n\nnamespace mitk\n{\n\n template <class TPixelType>\n void NrrdDiffusionImageReader<TPixelType>\n ::GenerateData()\n {\n\n \/\/ Since everything is completely read in GenerateOutputInformation() it is stored\n \/\/ in a cache variable. A timestamp is associated.\n \/\/ If the timestamp of the cache variable is newer than the MTime, we only need to\n \/\/ assign the cache variable to the DataObject.\n \/\/ Otherwise, the tree must be read again from the file and OuputInformation must \n \/\/ be updated!\n if ( ( ! m_OutputCache ) || ( this->GetMTime( ) > m_CacheTime.GetMTime( ) ) )\n {\n this->GenerateOutputInformation();\n itkWarningMacro(\"Cache regenerated!\"); \n }\n\n if (!m_OutputCache)\n {\n itkWarningMacro(\"Tree cache is empty!\"); \n }\n\n static_cast<OutputType*>(this->GetOutput())\n ->SetVectorImage(m_OutputCache->GetVectorImage());\n static_cast<OutputType*>(this->GetOutput())\n ->SetB_Value(m_OutputCache->GetB_Value());\n static_cast<OutputType*>(this->GetOutput())\n ->SetDirections(m_OutputCache->GetDirections());\n static_cast<OutputType*>(this->GetOutput())\n ->InitializeFromVectorImage();\n }\n\n template <class TPixelType>\n void NrrdDiffusionImageReader<TPixelType>::GenerateOutputInformation()\n {\n typename OutputType::Pointer outputForCache = OutputType::New();\n if ( m_FileName == \"\") \n {\n throw itk::ImageFileReaderException(__FILE__, __LINE__, \"Sorry, the filename to be read is empty!\");\n }\n else\n {\n try\n {\n const std::string& locale = \"en_GB.UTF-8\";\n char *currLocale = setlocale( LC_ALL, NULL );\n\n if ( locale.compare(currLocale)!=0 )\n {\n try\n {\n MITK_INFO << \" ** Changing locale from \" << setlocale(LC_ALL, NULL) << \" to '\" << locale << \"'\";\n setlocale(LC_ALL, locale.c_str());\n }\n catch(...)\n {\n MITK_INFO << \"Could not activate locale \" << locale;\n }\n }\n\n itk::NrrdImageIO::Pointer io = itk::NrrdImageIO::New();\n typedef itk::ImageFileReader<ImageType> FileReaderType;\n typename FileReaderType::Pointer reader = FileReaderType::New();\n reader->SetImageIO(io);\n reader->SetFileName(this->m_FileName);\n reader->Update();\n\n typename ImageType::Pointer img = reader->GetOutput();\n\n itk::MetaDataDictionary imgMetaDictionary = img->GetMetaDataDictionary(); \n std::vector<std::string> imgMetaKeys = imgMetaDictionary.GetKeys();\n std::vector<std::string>::const_iterator itKey = imgMetaKeys.begin();\n std::string metaString;\n\n GradientDirectionType vect3d;\n m_DiffusionVectors = GradientDirectionContainerType::New();\n\n int numberOfImages = 0;\n int numberOfGradientImages = 0;\n bool readb0 = false;\n\n for (; itKey != imgMetaKeys.end(); itKey ++)\n {\n double x,y,z;\n\n itk::ExposeMetaData<std::string> (imgMetaDictionary, *itKey, metaString);\n if (itKey->find(\"DWMRI_gradient\") != std::string::npos)\n { \n std::cout << *itKey << \" ---> \" << metaString << std::endl;\n sscanf(metaString.c_str(), \"%lf %lf %lf\\n\", &x, &y, &z);\n MITK_INFO << \"read values: \" << x << \"; \" << y << \"; \" << z;\n vect3d[0] = x; vect3d[1] = y; vect3d[2] = z;\n m_DiffusionVectors->InsertElement( numberOfImages, vect3d );\n ++numberOfImages;\n \/\/ If the direction is 0.0, this is a reference image\n if (vect3d[0] < 0.1 &&\n vect3d[1] < 0.1 &&\n vect3d[2] < 0.1)\n {\n MITK_INFO << \"Reference image found..\";\n continue;\n }\n ++numberOfGradientImages;;\n }\n else if (itKey->find(\"DWMRI_b-value\") != std::string::npos)\n {\n std::cout << *itKey << \" ---> \" << metaString << std::endl; \n readb0 = true;\n m_B_Value = atof(metaString.c_str());\n }\n }\n\n std::cout << \"Number of gradient images: \"\n << numberOfGradientImages\n << \" and Number of reference images: \"\n << numberOfImages - numberOfGradientImages\n << std::endl;\n\n if(!readb0)\n {\n std::cerr << \"BValue not specified in header file\" << std::endl;\n }\n\n \/\/ This call updates the output information of the associated VesselTreeData\n outputForCache->SetVectorImage(img);\n outputForCache->SetB_Value(m_B_Value);\n outputForCache->SetDirections(m_DiffusionVectors);\n\n \/\/ Since we have already read the tree, we can store it in a cache variable\n \/\/ so that it can be assigned to the DataObject in GenerateData();\n m_OutputCache = outputForCache;\n m_CacheTime.Modified();\n }\n catch(std::exception& e)\n {\n throw itk::ImageFileReaderException(__FILE__, __LINE__, e.what()); \n }\n catch(...)\n {\n throw itk::ImageFileReaderException(__FILE__, __LINE__, \"Sorry, an error occurred while reading the requested vessel tree file!\");\n }\n }\n }\n\n\n template <class TPixelType>\n const char* NrrdDiffusionImageReader<TPixelType>\n ::GetFileName() const\n {\n return m_FileName.c_str();\n }\n\n template <class TPixelType>\n void NrrdDiffusionImageReader<TPixelType>\n ::SetFileName(const char* aFileName)\n {\n m_FileName = aFileName;\n }\n\n template <class TPixelType>\n const char* NrrdDiffusionImageReader<TPixelType>\n ::GetFilePrefix() const\n {\n return m_FilePrefix.c_str();\n }\n\n template <class TPixelType>\n void NrrdDiffusionImageReader<TPixelType>\n ::SetFilePrefix(const char* aFilePrefix)\n {\n m_FilePrefix = aFilePrefix;\n }\n\n template <class TPixelType>\n const char* NrrdDiffusionImageReader<TPixelType>\n ::GetFilePattern() const\n {\n return m_FilePattern.c_str();\n }\n\n template <class TPixelType>\n void NrrdDiffusionImageReader<TPixelType>\n ::SetFilePattern(const char* aFilePattern)\n {\n m_FilePattern = aFilePattern;\n }\n\n template <class TPixelType>\n bool NrrdDiffusionImageReader<TPixelType>\n ::CanReadFile(const std::string filename, const std::string \/*filePrefix*\/, const std::string \/*filePattern*\/) \n {\n \/\/ First check the extension\n if( filename == \"\" )\n {\n return false;\n }\n std::string ext = itksys::SystemTools::GetFilenameLastExtension(filename);\n ext = itksys::SystemTools::LowerCase(ext);\n\n if (ext == \".hdwi\" || ext == \".dwi\")\n {\n itk::NrrdImageIO::Pointer io = itk::NrrdImageIO::New();\n\n typedef itk::ImageFileReader<ImageType> FileReaderType;\n typename FileReaderType::Pointer reader = FileReaderType::New();\n reader->SetImageIO(io);\n reader->SetFileName(filename);\n reader->Update();\n typename ImageType::Pointer img = reader->GetOutput();\n itk::MetaDataDictionary imgMetaDictionary = img->GetMetaDataDictionary(); \n std::vector<std::string> imgMetaKeys = imgMetaDictionary.GetKeys();\n std::vector<std::string>::const_iterator itKey = imgMetaKeys.begin();\n std::string metaString;\n\n for (; itKey != imgMetaKeys.end(); itKey ++)\n {\n itk::ExposeMetaData<std::string> (imgMetaDictionary, *itKey, metaString);\n if (itKey->find(\"modality\") != std::string::npos)\n {\n if (metaString.find(\"DWMRI\") != std::string::npos) \n {\n return true;\n }\n }\n }\n }\n return false;\n }\n\n} \/\/namespace MITK\n\n#endif\n<commit_msg>FIX (#6271): fixed previous fix. comparison to 0 for reference image determination.<commit_after>\/*=========================================================================\n\nProgram: Medical Imaging & Interaction Toolkit\nLanguage: C++\nDate: $Date: 2009-07-14 19:11:20 +0200 (Tue, 14 Jul 2009) $\nVersion: $Revision: 18127 $\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#ifndef __mitkNrrdDiffusionImageReader_cpp\n#define __mitkNrrdDiffusionImageReader_cpp\n\n#include \"mitkNrrdDiffusionImageReader.h\"\n\n#include \"itkImageFileReader.h\"\n#include \"itkMetaDataObject.h\"\n#include \"itkNrrdImageIO.h\"\n\nnamespace mitk\n{\n\n template <class TPixelType>\n void NrrdDiffusionImageReader<TPixelType>\n ::GenerateData()\n {\n\n \/\/ Since everything is completely read in GenerateOutputInformation() it is stored\n \/\/ in a cache variable. A timestamp is associated.\n \/\/ If the timestamp of the cache variable is newer than the MTime, we only need to\n \/\/ assign the cache variable to the DataObject.\n \/\/ Otherwise, the tree must be read again from the file and OuputInformation must \n \/\/ be updated!\n if ( ( ! m_OutputCache ) || ( this->GetMTime( ) > m_CacheTime.GetMTime( ) ) )\n {\n this->GenerateOutputInformation();\n itkWarningMacro(\"Cache regenerated!\"); \n }\n\n if (!m_OutputCache)\n {\n itkWarningMacro(\"Tree cache is empty!\"); \n }\n\n static_cast<OutputType*>(this->GetOutput())\n ->SetVectorImage(m_OutputCache->GetVectorImage());\n static_cast<OutputType*>(this->GetOutput())\n ->SetB_Value(m_OutputCache->GetB_Value());\n static_cast<OutputType*>(this->GetOutput())\n ->SetDirections(m_OutputCache->GetDirections());\n static_cast<OutputType*>(this->GetOutput())\n ->InitializeFromVectorImage();\n }\n\n template <class TPixelType>\n void NrrdDiffusionImageReader<TPixelType>::GenerateOutputInformation()\n {\n typename OutputType::Pointer outputForCache = OutputType::New();\n if ( m_FileName == \"\") \n {\n throw itk::ImageFileReaderException(__FILE__, __LINE__, \"Sorry, the filename to be read is empty!\");\n }\n else\n {\n try\n {\n const std::string& locale = \"en_GB.UTF-8\";\n char *currLocale = setlocale( LC_ALL, NULL );\n\n if ( locale.compare(currLocale)!=0 )\n {\n try\n {\n MITK_INFO << \" ** Changing locale from \" << setlocale(LC_ALL, NULL) << \" to '\" << locale << \"'\";\n setlocale(LC_ALL, locale.c_str());\n }\n catch(...)\n {\n MITK_INFO << \"Could not activate locale \" << locale;\n }\n }\n\n itk::NrrdImageIO::Pointer io = itk::NrrdImageIO::New();\n typedef itk::ImageFileReader<ImageType> FileReaderType;\n typename FileReaderType::Pointer reader = FileReaderType::New();\n reader->SetImageIO(io);\n reader->SetFileName(this->m_FileName);\n reader->Update();\n\n typename ImageType::Pointer img = reader->GetOutput();\n\n itk::MetaDataDictionary imgMetaDictionary = img->GetMetaDataDictionary(); \n std::vector<std::string> imgMetaKeys = imgMetaDictionary.GetKeys();\n std::vector<std::string>::const_iterator itKey = imgMetaKeys.begin();\n std::string metaString;\n\n GradientDirectionType vect3d;\n m_DiffusionVectors = GradientDirectionContainerType::New();\n\n int numberOfImages = 0;\n int numberOfGradientImages = 0;\n bool readb0 = false;\n\n for (; itKey != imgMetaKeys.end(); itKey ++)\n {\n double x,y,z;\n\n itk::ExposeMetaData<std::string> (imgMetaDictionary, *itKey, metaString);\n if (itKey->find(\"DWMRI_gradient\") != std::string::npos)\n { \n std::cout << *itKey << \" ---> \" << metaString << std::endl;\n sscanf(metaString.c_str(), \"%lf %lf %lf\\n\", &x, &y, &z);\n MITK_INFO << \"read values: \" << x << \"; \" << y << \"; \" << z;\n vect3d[0] = x; vect3d[1] = y; vect3d[2] = z;\n m_DiffusionVectors->InsertElement( numberOfImages, vect3d );\n ++numberOfImages;\n \/\/ If the direction is 0.0, this is a reference image\n if (vect3d[0] == 0.0 &&\n vect3d[1] == 0.0 &&\n vect3d[2] == 0.0)\n {\n MITK_INFO << \"Reference image found..\";\n continue;\n }\n ++numberOfGradientImages;;\n }\n else if (itKey->find(\"DWMRI_b-value\") != std::string::npos)\n {\n std::cout << *itKey << \" ---> \" << metaString << std::endl; \n readb0 = true;\n m_B_Value = atof(metaString.c_str());\n }\n }\n\n std::cout << \"Number of gradient images: \"\n << numberOfGradientImages\n << \" and Number of reference images: \"\n << numberOfImages - numberOfGradientImages\n << std::endl;\n\n if(!readb0)\n {\n std::cerr << \"BValue not specified in header file\" << std::endl;\n }\n\n \/\/ This call updates the output information of the associated VesselTreeData\n outputForCache->SetVectorImage(img);\n outputForCache->SetB_Value(m_B_Value);\n outputForCache->SetDirections(m_DiffusionVectors);\n\n \/\/ Since we have already read the tree, we can store it in a cache variable\n \/\/ so that it can be assigned to the DataObject in GenerateData();\n m_OutputCache = outputForCache;\n m_CacheTime.Modified();\n }\n catch(std::exception& e)\n {\n throw itk::ImageFileReaderException(__FILE__, __LINE__, e.what()); \n }\n catch(...)\n {\n throw itk::ImageFileReaderException(__FILE__, __LINE__, \"Sorry, an error occurred while reading the requested vessel tree file!\");\n }\n }\n }\n\n\n template <class TPixelType>\n const char* NrrdDiffusionImageReader<TPixelType>\n ::GetFileName() const\n {\n return m_FileName.c_str();\n }\n\n template <class TPixelType>\n void NrrdDiffusionImageReader<TPixelType>\n ::SetFileName(const char* aFileName)\n {\n m_FileName = aFileName;\n }\n\n template <class TPixelType>\n const char* NrrdDiffusionImageReader<TPixelType>\n ::GetFilePrefix() const\n {\n return m_FilePrefix.c_str();\n }\n\n template <class TPixelType>\n void NrrdDiffusionImageReader<TPixelType>\n ::SetFilePrefix(const char* aFilePrefix)\n {\n m_FilePrefix = aFilePrefix;\n }\n\n template <class TPixelType>\n const char* NrrdDiffusionImageReader<TPixelType>\n ::GetFilePattern() const\n {\n return m_FilePattern.c_str();\n }\n\n template <class TPixelType>\n void NrrdDiffusionImageReader<TPixelType>\n ::SetFilePattern(const char* aFilePattern)\n {\n m_FilePattern = aFilePattern;\n }\n\n template <class TPixelType>\n bool NrrdDiffusionImageReader<TPixelType>\n ::CanReadFile(const std::string filename, const std::string \/*filePrefix*\/, const std::string \/*filePattern*\/) \n {\n \/\/ First check the extension\n if( filename == \"\" )\n {\n return false;\n }\n std::string ext = itksys::SystemTools::GetFilenameLastExtension(filename);\n ext = itksys::SystemTools::LowerCase(ext);\n\n if (ext == \".hdwi\" || ext == \".dwi\")\n {\n itk::NrrdImageIO::Pointer io = itk::NrrdImageIO::New();\n\n typedef itk::ImageFileReader<ImageType> FileReaderType;\n typename FileReaderType::Pointer reader = FileReaderType::New();\n reader->SetImageIO(io);\n reader->SetFileName(filename);\n reader->Update();\n typename ImageType::Pointer img = reader->GetOutput();\n itk::MetaDataDictionary imgMetaDictionary = img->GetMetaDataDictionary(); \n std::vector<std::string> imgMetaKeys = imgMetaDictionary.GetKeys();\n std::vector<std::string>::const_iterator itKey = imgMetaKeys.begin();\n std::string metaString;\n\n for (; itKey != imgMetaKeys.end(); itKey ++)\n {\n itk::ExposeMetaData<std::string> (imgMetaDictionary, *itKey, metaString);\n if (itKey->find(\"modality\") != std::string::npos)\n {\n if (metaString.find(\"DWMRI\") != std::string::npos) \n {\n return true;\n }\n }\n }\n }\n return false;\n }\n\n} \/\/namespace MITK\n\n#endif\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 <medTabbedViewContainers.h>\n\n#include <QUuid>\n#include <QtCore>\n#include <QShortcut>\n\n#include <medViewContainer.h>\n#include <medViewContainerSplitter.h>\n#include <medViewContainerManager.h>\n\n\nclass medTabbedViewContainersPrivate\n{\npublic:\n QShortcut *closeShortcut; \n QPushButton *addTabButton;\n};\n\nmedTabbedViewContainers::medTabbedViewContainers(QWidget *parent) : QTabWidget(parent), d(new medTabbedViewContainersPrivate)\n{\n this->setTabsClosable(true);\n this->setMovable(true);\n\n connect(this,SIGNAL(tabCloseRequested(int)),this,SLOT(resetTab(int)));\n\n d->addTabButton = new QPushButton(this);\n d->addTabButton->setObjectName(\"addTabButton\");\n d->addTabButton->setShortcut(Qt::ControlModifier + Qt::Key_T);\n this->setCornerWidget(d->addTabButton);\n \n connect(d->addTabButton,SIGNAL(clicked()), this, SLOT(addContainerInTab()));\n \n d->closeShortcut = new QShortcut(this);\n d->closeShortcut->setKey(Qt::ControlModifier + Qt::Key_W);\n connect(d->closeShortcut,SIGNAL(activated()),this,SLOT(resetCurrentTab()));\n\n connect(this, SIGNAL(tabCloseRequested(int)), this, SLOT(disconnectTabFromSplitter(int)));\n}\n\nmedTabbedViewContainers::~medTabbedViewContainers(void)\n{\n delete d;\n d = NULL;\n}\n\nvoid medTabbedViewContainers::lockTabs()\n{\n this->setTabsClosable(false);\n this->setMovable(false);\n d->addTabButton->hide();\n}\n\nvoid medTabbedViewContainers::unlockTabs()\n{\n this->setTabsClosable(true);\n this->setMovable(true);\n d->addTabButton->show();\n}\n\nvoid medTabbedViewContainers::resetCurrentTab()\n{\n int index = this->currentIndex();\n this->resetTab(index);\n}\n\nvoid medTabbedViewContainers::resetTab(int index)\n{\n this->removeTab(index);\n if(this->count() < 1)\n this->addContainerInTab();\n}\n\nvoid medTabbedViewContainers::addContainerInTab()\n{\n this->addContainerInTab(\"TODO find fancy name - RDE\");\n}\n\nvoid medTabbedViewContainers::addContainerInTab(const QString &name)\n{\n this->insertContainerInTab(this->count(), name);\n}\n\nvoid medTabbedViewContainers::insertContainerInTab(int index, const QString &name)\n{\n medViewContainerSplitter *splitter = new medViewContainerSplitter;\n int test = this->insertTab(index, splitter, name);\n this->setCurrentWidget(splitter);\n\/\/ this->setCurrentIndex(test);\n connect(splitter, SIGNAL(destroyed()), this, SLOT(repopulateCurrentTab()));\n connect(splitter, SIGNAL(newContainer(QUuid&)), this, SIGNAL(newContainer(QUuid&)));\n connect(splitter, SIGNAL(newContainer(QUuid&)), this, SLOT(addContainerToContainerInTab(QUuid&)));\n splitter->addViewContainer(new medViewContainer);\n}\n\nvoid medTabbedViewContainers::hideTabBar()\n{\n QTabBar *tabBar = this->tabBar();\n tabBar->hide();\n}\n\nvoid medTabbedViewContainers::repopulateCurrentTab()\n{\n int idx = this->currentIndex();\n qDebug()<< \"idx\" << idx;\n this->insertContainerInTab(idx, this->tabText(idx));\n qDebug()<< \"this->currentIndex()\" << this->currentIndex();\n}\n\nvoid medTabbedViewContainers::disconnectTabFromSplitter(int index)\n{\n medViewContainerSplitter* splitter = dynamic_cast<medViewContainerSplitter*>(this->sender());\n if(!splitter)\n return;\n\n splitter->disconnect(this);\n}\n\n<commit_msg>correction in medTabbedViewContainers::repopulateCurrentTab<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 <medTabbedViewContainers.h>\n\n#include <QUuid>\n#include <QtCore>\n#include <QShortcut>\n\n#include <medViewContainer.h>\n#include <medViewContainerSplitter.h>\n#include <medViewContainerManager.h>\n\n\nclass medTabbedViewContainersPrivate\n{\npublic:\n QShortcut *closeShortcut; \n QPushButton *addTabButton;\n};\n\nmedTabbedViewContainers::medTabbedViewContainers(QWidget *parent) : QTabWidget(parent), d(new medTabbedViewContainersPrivate)\n{\n this->setTabsClosable(true);\n this->setMovable(true);\n\n connect(this,SIGNAL(tabCloseRequested(int)),this,SLOT(resetTab(int)));\n\n d->addTabButton = new QPushButton(this);\n d->addTabButton->setObjectName(\"addTabButton\");\n d->addTabButton->setShortcut(Qt::ControlModifier + Qt::Key_T);\n this->setCornerWidget(d->addTabButton);\n \n connect(d->addTabButton,SIGNAL(clicked()), this, SLOT(addContainerInTab()));\n \n d->closeShortcut = new QShortcut(this);\n d->closeShortcut->setKey(Qt::ControlModifier + Qt::Key_W);\n connect(d->closeShortcut,SIGNAL(activated()),this,SLOT(resetCurrentTab()));\n\n connect(this, SIGNAL(tabCloseRequested(int)), this, SLOT(disconnectTabFromSplitter(int)));\n}\n\nmedTabbedViewContainers::~medTabbedViewContainers(void)\n{\n delete d;\n d = NULL;\n}\n\nvoid medTabbedViewContainers::lockTabs()\n{\n this->setTabsClosable(false);\n this->setMovable(false);\n d->addTabButton->hide();\n}\n\nvoid medTabbedViewContainers::unlockTabs()\n{\n this->setTabsClosable(true);\n this->setMovable(true);\n d->addTabButton->show();\n}\n\nvoid medTabbedViewContainers::resetCurrentTab()\n{\n int index = this->currentIndex();\n this->resetTab(index);\n}\n\nvoid medTabbedViewContainers::resetTab(int index)\n{\n this->removeTab(index);\n if(this->count() < 1)\n this->addContainerInTab();\n}\n\nvoid medTabbedViewContainers::addContainerInTab()\n{\n this->addContainerInTab(\"TODO find fancy name - RDE\");\n}\n\nvoid medTabbedViewContainers::addContainerInTab(const QString &name)\n{\n this->insertContainerInTab(this->count(), name);\n}\n\nvoid medTabbedViewContainers::insertContainerInTab(int index, const QString &name)\n{\n medViewContainerSplitter *splitter = new medViewContainerSplitter;\n int idx = this->insertTab(index, splitter, name);\n this->setCurrentIndex(idx);\n connect(splitter, SIGNAL(destroyed()), this, SLOT(repopulateCurrentTab()));\n connect(splitter, SIGNAL(newContainer(QUuid&)), this, SIGNAL(newContainer(QUuid&)));\n connect(splitter, SIGNAL(newContainer(QUuid&)), this, SLOT(addContainerToContainerInTab(QUuid&)));\n splitter->addViewContainer(new medViewContainer);\n}\n\nvoid medTabbedViewContainers::hideTabBar()\n{\n QTabBar *tabBar = this->tabBar();\n tabBar->hide();\n}\n\nvoid medTabbedViewContainers::repopulateCurrentTab()\n{\n int idx = this->currentIndex();\n QString tabText = this->tabText(idx);\n this->removeTab(idx);\n this->insertContainerInTab(idx, tabText);\n}\n\nvoid medTabbedViewContainers::disconnectTabFromSplitter(int index)\n{\n medViewContainerSplitter* splitter = dynamic_cast<medViewContainerSplitter*>(this->sender());\n if(!splitter)\n return;\n\n splitter->disconnect(this);\n}\n\n<|endoftext|>"} {"text":"<commit_before>\/**\r\n* @file SampleSet.cpp\r\n*\r\n* @author <a href=\"mailto:mellmann@informatik.hu-berlin.de\">Heinrich Mellmann<\/a>\r\n* Implementation of class SampleSet\r\n*\/\r\n\r\n#include \"SampleSet.h\"\r\n#include \"Tools\/Debug\/DebugDrawings.h\"\r\n#include \"Tools\/Debug\/NaoTHAssert.h\"\r\n#include \"Tools\/Math\/Common.h\"\r\n\r\nvoid SampleSet::sort(bool descending) \r\n{\r\n quicksort(descending?1:-1, 0, numberOfParticles-1);\r\n}\r\n\r\nvoid SampleSet::quicksort(int d, int low, int high) \r\n{\r\n int i = low;\r\n int j = high;\r\n\r\n Sample help;\r\n\r\n \/* compare value *\/\r\n double z = samples[(low + high) \/ 2].likelihood*d;\r\n\r\n \/* partition *\/\r\n do {\r\n \/* find member above ... *\/\r\n while(samples[i].likelihood*d > z) i++;\r\n\r\n \/* find element below ... *\/\r\n while(samples[j].likelihood*d < z) j--;\r\n\r\n if(i <= j) \r\n {\r\n \/* swap two elements *\/\r\n help = samples[i];\r\n samples[i] = samples[j]; \r\n samples[j] = help;\r\n\r\n i++; \r\n j--;\r\n }\/\/end if\r\n } while(i <= j);\r\n\r\n \/* recurse *\/\r\n if(low < j) \r\n quicksort(d, low, j);\r\n\r\n if(i < high) \r\n quicksort(d, i, high); \r\n}\/\/end quicksort\r\n\r\n\r\nvoid SampleSet::normalize(double offset)\r\n{\r\n double sum = 0.0;\r\n for(unsigned int i = 0; i < numberOfParticles; i++)\r\n {\r\n samples[i].likelihood = samples[i].likelihood;\r\n sum += samples[i].likelihood;\r\n }\r\n\r\n if(sum == 0) return;\r\n\r\n double offset_sum = 1.0+offset*numberOfParticles;\r\n\r\n for(unsigned int i = 0; i < numberOfParticles; i++)\r\n {\r\n samples[i].likelihood = ((samples[i].likelihood\/sum) + offset)\/offset_sum;\r\n }\r\n}\/\/end normalize\r\n\r\n\r\nvoid SampleSet::resetLikelihood()\r\n{\r\n double likelihood = 1.0\/static_cast<double>(numberOfParticles);\r\n for(unsigned int i = 0; i < numberOfParticles; i++)\r\n {\r\n samples[i].likelihood = likelihood;\r\n }\r\n}\/\/end resetLikelihood\r\n\r\n\r\n\/\/ TODO: make it more efficient (!!!)\r\nSample SampleSet::meanOfLargestCluster(Moments2<2>& moments) const\r\n{\r\n ASSERT(samples.size() > 0);\r\n\r\n \/\/ TODO: make it better\r\n std::vector<int> cluster(numberOfParticles);\r\n std::vector<Vector2<double> > averageTranslation(numberOfParticles);\r\n std::vector<Vector2<double> > averageRotation(numberOfParticles);\r\n unsigned int maxIndex = 0;\r\n double maxNumber = 0;\r\n\r\n for(unsigned int i = 0; i < numberOfParticles; i++)\r\n {\r\n if(samples[i].cluster >= 0 && samples[i].cluster < (int)numberOfParticles)\r\n {\r\n int idx = samples[i].cluster;\r\n cluster[idx]++;\r\n averageTranslation[idx] += samples[i].translation;\r\n averageRotation[idx].x += cos(samples[i].rotation);\r\n averageRotation[idx].y += sin(samples[i].rotation);\r\n\r\n if(maxNumber < cluster[idx])\r\n {\r\n maxIndex = idx;\r\n maxNumber = cluster[idx];\r\n }\r\n }\/\/end if\r\n }\/\/end for\r\n\r\n Sample result;\r\n result.translation = averageTranslation[maxIndex]\/maxNumber;\r\n result.rotation = averageRotation[maxIndex].angle();\r\n result.cluster = maxIndex;\r\n\r\n\r\n \/\/ calculate the covariance of the largest cluster\r\n for(unsigned int i = 0; i < numberOfParticles; i++)\r\n {\r\n const Sample& sample = samples[i];\r\n if(sample.cluster == (int)maxIndex)\r\n {\r\n moments.add(sample.translation);\r\n }\r\n }\/\/end for\r\n\r\n return result;\r\n}\/\/end meanOfLargestCluster\r\n\r\nconst Sample& SampleSet::getMostLikelySample() const\r\n{\r\n ASSERT(samples.size() > 0);\r\n\r\n double maxLikelihood = samples[0].likelihood;\r\n int maxIdx = 0;\r\n\r\n for(unsigned int i = 1; i < numberOfParticles; i++)\r\n {\r\n if(maxLikelihood < samples[i].likelihood) {\r\n maxLikelihood = samples[i].likelihood;\r\n maxIdx = i;\r\n }\r\n }\r\n\r\n return samples[maxIdx];\r\n}\r\n\r\nvoid SampleSet::drawCluster(unsigned int clusterId) const\r\n{\r\n ASSERT(samples.size() > 0);\r\n FIELD_DRAWING_CONTEXT;\r\n for (size_t i = 0; i < samples.size(); i++)\r\n {\r\n if (samples[i].cluster == (int)clusterId) {\r\n PEN(\"FFFFFF\", 20);\r\n } else { \r\n PEN(\"000000\", 20);\r\n }\r\n\r\n ARROW(samples[i].translation.x, samples[i].translation.y, \r\n samples[i].translation.x + 100*cos(samples[i].rotation), \r\n samples[i].translation.y + 100*sin(samples[i].rotation));\r\n }\r\n}\r\n\r\nvoid SampleSet::drawImportance(bool arrows) const\r\n{\r\n ASSERT(samples.size() > 0);\r\n FIELD_DRAWING_CONTEXT;\r\n\r\n \/\/ normalize the colors (black: less importent, red more importent)\r\n double minValue = samples[0].likelihood;\r\n double maxValue = samples[0].likelihood;\r\n for (unsigned int i = 1; i < samples.size(); i++)\r\n {\r\n maxValue = std::max(samples[i].likelihood, maxValue);\r\n minValue = std::min(samples[i].likelihood, minValue);\r\n }\r\n double colorDiff = log(maxValue) - log(minValue);\r\n\r\n for (size_t i = 0; i < samples.size(); i++)\r\n {\r\n DebugDrawings::Color color;\r\n if(colorDiff > 0) {\r\n color[0] = Math::clamp((log(samples[i].likelihood) - log(minValue))\/colorDiff,0.0,1.0);\r\n }\r\n \r\n PEN(color, 20);\r\n\r\n ARROW(samples[i].translation.x, samples[i].translation.y, \r\n samples[i].translation.x + 100*cos(samples[i].rotation), \r\n samples[i].translation.y + 100*sin(samples[i].rotation));\r\n }\/\/end for\r\n}\r\n\r\n<commit_msg>unused<commit_after>\/**\r\n* @file SampleSet.cpp\r\n*\r\n* @author <a href=\"mailto:mellmann@informatik.hu-berlin.de\">Heinrich Mellmann<\/a>\r\n* Implementation of class SampleSet\r\n*\/\r\n\r\n#include \"SampleSet.h\"\r\n#include \"Tools\/Debug\/DebugDrawings.h\"\r\n#include \"Tools\/Debug\/NaoTHAssert.h\"\r\n#include \"Tools\/Math\/Common.h\"\r\n\r\nvoid SampleSet::sort(bool descending) \r\n{\r\n quicksort(descending?1:-1, 0, numberOfParticles-1);\r\n}\r\n\r\nvoid SampleSet::quicksort(int d, int low, int high) \r\n{\r\n int i = low;\r\n int j = high;\r\n\r\n Sample help;\r\n\r\n \/* compare value *\/\r\n double z = samples[(low + high) \/ 2].likelihood*d;\r\n\r\n \/* partition *\/\r\n do {\r\n \/* find member above ... *\/\r\n while(samples[i].likelihood*d > z) i++;\r\n\r\n \/* find element below ... *\/\r\n while(samples[j].likelihood*d < z) j--;\r\n\r\n if(i <= j) \r\n {\r\n \/* swap two elements *\/\r\n help = samples[i];\r\n samples[i] = samples[j]; \r\n samples[j] = help;\r\n\r\n i++; \r\n j--;\r\n }\/\/end if\r\n } while(i <= j);\r\n\r\n \/* recurse *\/\r\n if(low < j) \r\n quicksort(d, low, j);\r\n\r\n if(i < high) \r\n quicksort(d, i, high); \r\n}\/\/end quicksort\r\n\r\n\r\nvoid SampleSet::normalize(double offset)\r\n{\r\n double sum = 0.0;\r\n for(unsigned int i = 0; i < numberOfParticles; i++)\r\n {\r\n samples[i].likelihood = samples[i].likelihood;\r\n sum += samples[i].likelihood;\r\n }\r\n\r\n if(sum == 0) return;\r\n\r\n double offset_sum = 1.0+offset*numberOfParticles;\r\n\r\n for(unsigned int i = 0; i < numberOfParticles; i++)\r\n {\r\n samples[i].likelihood = ((samples[i].likelihood\/sum) + offset)\/offset_sum;\r\n }\r\n}\/\/end normalize\r\n\r\n\r\nvoid SampleSet::resetLikelihood()\r\n{\r\n double likelihood = 1.0\/static_cast<double>(numberOfParticles);\r\n for(unsigned int i = 0; i < numberOfParticles; i++)\r\n {\r\n samples[i].likelihood = likelihood;\r\n }\r\n}\/\/end resetLikelihood\r\n\r\n\r\n\/\/ TODO: make it more efficient (!!!)\r\nSample SampleSet::meanOfLargestCluster(Moments2<2>& moments) const\r\n{\r\n ASSERT(samples.size() > 0);\r\n\r\n \/\/ TODO: make it better\r\n std::vector<int> cluster(numberOfParticles);\r\n std::vector<Vector2<double> > averageTranslation(numberOfParticles);\r\n std::vector<Vector2<double> > averageRotation(numberOfParticles);\r\n unsigned int maxIndex = 0;\r\n double maxNumber = 0;\r\n\r\n for(unsigned int i = 0; i < numberOfParticles; i++)\r\n {\r\n if(samples[i].cluster >= 0 && samples[i].cluster < (int)numberOfParticles)\r\n {\r\n int idx = samples[i].cluster;\r\n cluster[idx]++;\r\n averageTranslation[idx] += samples[i].translation;\r\n averageRotation[idx].x += cos(samples[i].rotation);\r\n averageRotation[idx].y += sin(samples[i].rotation);\r\n\r\n if(maxNumber < cluster[idx])\r\n {\r\n maxIndex = idx;\r\n maxNumber = cluster[idx];\r\n }\r\n }\/\/end if\r\n }\/\/end for\r\n\r\n Sample result;\r\n result.translation = averageTranslation[maxIndex]\/maxNumber;\r\n result.rotation = averageRotation[maxIndex].angle();\r\n result.cluster = maxIndex;\r\n\r\n\r\n \/\/ calculate the covariance of the largest cluster\r\n for(unsigned int i = 0; i < numberOfParticles; i++)\r\n {\r\n const Sample& sample = samples[i];\r\n if(sample.cluster == (int)maxIndex)\r\n {\r\n moments.add(sample.translation);\r\n }\r\n }\/\/end for\r\n\r\n return result;\r\n}\/\/end meanOfLargestCluster\r\n\r\nconst Sample& SampleSet::getMostLikelySample() const\r\n{\r\n ASSERT(samples.size() > 0);\r\n\r\n double maxLikelihood = samples[0].likelihood;\r\n int maxIdx = 0;\r\n\r\n for(unsigned int i = 1; i < numberOfParticles; i++)\r\n {\r\n if(maxLikelihood < samples[i].likelihood) {\r\n maxLikelihood = samples[i].likelihood;\r\n maxIdx = i;\r\n }\r\n }\r\n\r\n return samples[maxIdx];\r\n}\r\n\r\nvoid SampleSet::drawCluster(unsigned int clusterId) const\r\n{\r\n ASSERT(samples.size() > 0);\r\n FIELD_DRAWING_CONTEXT;\r\n for (size_t i = 0; i < samples.size(); i++)\r\n {\r\n if (samples[i].cluster == (int)clusterId) {\r\n PEN(\"FFFFFF\", 20);\r\n } else { \r\n PEN(\"000000\", 20);\r\n }\r\n\r\n ARROW(samples[i].translation.x, samples[i].translation.y, \r\n samples[i].translation.x + 100*cos(samples[i].rotation), \r\n samples[i].translation.y + 100*sin(samples[i].rotation));\r\n }\r\n}\r\n\r\nvoid SampleSet::drawImportance(bool \/*arrows*\/) const\r\n{\r\n ASSERT(samples.size() > 0);\r\n FIELD_DRAWING_CONTEXT;\r\n\r\n \/\/ normalize the colors (black: less importent, red more importent)\r\n double minValue = samples[0].likelihood;\r\n double maxValue = samples[0].likelihood;\r\n for (unsigned int i = 1; i < samples.size(); i++)\r\n {\r\n maxValue = std::max(samples[i].likelihood, maxValue);\r\n minValue = std::min(samples[i].likelihood, minValue);\r\n }\r\n double colorDiff = log(maxValue) - log(minValue);\r\n\r\n for (size_t i = 0; i < samples.size(); i++)\r\n {\r\n DebugDrawings::Color color;\r\n if(colorDiff > 0) {\r\n color[0] = Math::clamp((log(samples[i].likelihood) - log(minValue))\/colorDiff,0.0,1.0);\r\n }\r\n \r\n PEN(color, 20);\r\n\r\n ARROW(samples[i].translation.x, samples[i].translation.y, \r\n samples[i].translation.x + 100*cos(samples[i].rotation), \r\n samples[i].translation.y + 100*sin(samples[i].rotation));\r\n }\r\n}\r\n\r\n<|endoftext|>"} {"text":"<commit_before>\/*++\n\nModule Name:\n\n snap.cpp\n\nAbstract:\n\n Main entry point for the snap binary. Calls into the indexer, single-end aligner or\n paired-end aligner functions defined in other source files in this directory.\n\nAuthors:\n\n Matei Zaharia, February, 2012\n\nEnvironment:\n`\n User mode service.\n\nRevision History:\n\n Adapted from cSNAP, which was in turn adapted from the scala prototype\n\n--*\/\n\n#include \"stdafx.h\"\n#include \"options.h\"\n#include \"FASTA.h\"\n#include \"GenomeIndex.h\"\n#include \"SingleAligner.h\"\n#include \"PairedAligner.h\"\n#include \"exit.h\"\n#include \"SeedSequencer.h\"\n\n\nusing namespace std;\n\nconst char *SNAP_VERSION = \"0.16alpha.44\"; \n\nstatic void usage()\n{\n fprintf(stderr,\n \"Usage: snap <command> [<options>]\\n\"\n \"Commands:\\n\"\n \" index build a genome index\\n\"\n \" single align single-end reads\\n\"\n \" paired align paired-end reads\\n\"\n \"Type a command without arguments to see its help.\\n\");\n soft_exit(1);\n}\n\nint main(int argc, const char **argv)\n{\n printf(\"Welcome to SNAP version %s.\\n\\n\", SNAP_VERSION);\n\n InitializeSeedSequencers();\n\n if (argc < 2) {\n usage();\n } else if (strcmp(argv[1], \"index\") == 0) {\n GenomeIndex::runIndexer(argc - 2, argv + 2);\n } else if (strcmp(argv[1], \"single\") == 0 || strcmp(argv[1], \"paired\") == 0) {\n for (int i = 1; i < argc; \/* i is increased below *\/) {\n unsigned nArgsConsumed;\n if (strcmp(argv[i], \"single\") == 0) {\n SingleAlignerContext single;\n single.runAlignment(argc - (i + 1), argv + i + 1, SNAP_VERSION, &nArgsConsumed);\n } else if (strcmp(argv[i], \"paired\") == 0) {\n PairedAlignerContext paired;\n paired.runAlignment(argc - (i + 1), argv + i + 1, SNAP_VERSION, &nArgsConsumed);\n } else {\n fprintf(stderr, \"Invalid command: %s\\n\\n\", argv[i]);\n usage();\n }\n _ASSERT(nArgsConsumed > 0);\n i += nArgsConsumed + 1; \/\/ +1 for single or paired\n }\n } else {\n fprintf(stderr, \"Invalid command: %s\\n\\n\", argv[1]);\n usage();\n }\n}\n<commit_msg>0.16alpha.45: file i\/o fixes<commit_after>\/*++\n\nModule Name:\n\n snap.cpp\n\nAbstract:\n\n Main entry point for the snap binary. Calls into the indexer, single-end aligner or\n paired-end aligner functions defined in other source files in this directory.\n\nAuthors:\n\n Matei Zaharia, February, 2012\n\nEnvironment:\n`\n User mode service.\n\nRevision History:\n\n Adapted from cSNAP, which was in turn adapted from the scala prototype\n\n--*\/\n\n#include \"stdafx.h\"\n#include \"options.h\"\n#include \"FASTA.h\"\n#include \"GenomeIndex.h\"\n#include \"SingleAligner.h\"\n#include \"PairedAligner.h\"\n#include \"exit.h\"\n#include \"SeedSequencer.h\"\n\n\nusing namespace std;\n\nconst char *SNAP_VERSION = \"0.16alpha.45\"; \n\nstatic void usage()\n{\n fprintf(stderr,\n \"Usage: snap <command> [<options>]\\n\"\n \"Commands:\\n\"\n \" index build a genome index\\n\"\n \" single align single-end reads\\n\"\n \" paired align paired-end reads\\n\"\n \"Type a command without arguments to see its help.\\n\");\n soft_exit(1);\n}\n\nint main(int argc, const char **argv)\n{\n printf(\"Welcome to SNAP version %s.\\n\\n\", SNAP_VERSION);\n\n InitializeSeedSequencers();\n\n if (argc < 2) {\n usage();\n } else if (strcmp(argv[1], \"index\") == 0) {\n GenomeIndex::runIndexer(argc - 2, argv + 2);\n } else if (strcmp(argv[1], \"single\") == 0 || strcmp(argv[1], \"paired\") == 0) {\n for (int i = 1; i < argc; \/* i is increased below *\/) {\n unsigned nArgsConsumed;\n if (strcmp(argv[i], \"single\") == 0) {\n SingleAlignerContext single;\n single.runAlignment(argc - (i + 1), argv + i + 1, SNAP_VERSION, &nArgsConsumed);\n } else if (strcmp(argv[i], \"paired\") == 0) {\n PairedAlignerContext paired;\n paired.runAlignment(argc - (i + 1), argv + i + 1, SNAP_VERSION, &nArgsConsumed);\n } else {\n fprintf(stderr, \"Invalid command: %s\\n\\n\", argv[i]);\n usage();\n }\n _ASSERT(nArgsConsumed > 0);\n i += nArgsConsumed + 1; \/\/ +1 for single or paired\n }\n } else {\n fprintf(stderr, \"Invalid command: %s\\n\\n\", argv[1]);\n usage();\n }\n}\n<|endoftext|>"} {"text":"<commit_before>\/*\n * SRT - Secure, Reliable, Transport\n * Copyright (c) 2018 Haivision Systems Inc.\n * \n * This Source Code Form is subject to the terms of the Mozilla Public\n * License, v. 2.0. If a copy of the MPL was not distributed with this\n * file, You can obtain one at http:\/\/mozilla.org\/MPL\/2.0\/.\n * \n *\/\n\n\/\/ STL includes\n#include <algorithm>\n#include <map>\n#include <string>\n\n#include \"uriparser.hpp\"\n\n#ifdef TEST\n#define TEST1 1\n#endif\n\n#ifdef TEST1\n#include <iostream>\n#endif\n\nusing namespace std;\n\nmap<string, UriParser::Type> types;\n\nstruct UriParserInit\n{\n UriParserInit()\n {\n types[\"file\"] = UriParser::FILE;\n types[\"udp\"] = UriParser::UDP;\n types[\"tcp\"] = UriParser::TCP;\n types[\"srt\"] = UriParser::SRT;\n types[\"rtmp\"] = UriParser::RTMP;\n types[\"http\"] = UriParser::HTTP;\n types[\"rtp\"] = UriParser::RTP;\n types[\"\"] = UriParser::UNKNOWN;\n }\n} g_uriparser_init;\n\nUriParser::UriParser(const string& strUrl, DefaultExpect exp)\n{\n m_expect = exp;\n Parse(strUrl, exp);\n}\n\nUriParser::~UriParser(void)\n{\n}\n\nstring UriParser::makeUri()\n{\n \/\/ Reassemble parts into the URI\n string prefix = \"\";\n if (m_proto != \"\")\n {\n prefix = m_proto + \":\/\/\";\n }\n\n std::ostringstream out;\n\n out << prefix << m_host;\n if ((m_port == \"\" || m_port == \"0\") && m_expect == EXPECT_FILE)\n {\n \/\/ Do not add port\n }\n else\n {\n out << \":\" << m_port;\n }\n\n if (m_path != \"\")\n {\n if (m_path[0] != '\/')\n out << \"\/\";\n out << m_path;\n }\n\n if (!m_mapQuery.empty())\n {\n out << \"?\";\n\n query_it i = m_mapQuery.begin();\n for (;;)\n {\n out << i->first << \"=\" << i->second;\n ++i;\n if (i == m_mapQuery.end())\n break;\n out << \"&\";\n }\n }\n\n m_origUri = out.str();\n return m_origUri;\n}\n\nstring UriParser::proto(void) const\n{\n return m_proto;\n}\n\nUriParser::Type UriParser::type() const\n{\n return m_uriType;\n}\n\nstring UriParser::host(void) const\n{\n return m_host;\n}\n\nstring UriParser::port(void) const\n{\n return m_port;\n}\n\nunsigned short int UriParser::portno(void) const\n{\n \/\/ This returns port in numeric version. Fallback to 0.\n try\n {\n int i = atoi(m_port.c_str());\n if ( i <= 0 || i > 65535 )\n return 0;\n return i;\n }\n catch (...)\n {\n return 0;\n }\n}\n\nstring UriParser::path(void) const\n{\n return m_path;\n}\n\nstring UriParser::queryValue(const string& strKey) const\n{\n return m_mapQuery.at(strKey);\n}\n\nvoid UriParser::Parse(const string& strUrl, DefaultExpect exp)\n{\n int iQueryStart = -1;\n\n size_t idx = strUrl.find(\"?\");\n if (idx != string::npos)\n {\n m_host = strUrl.substr(0, idx);\n iQueryStart = idx + 1;\n }\n else\n {\n m_host = strUrl;\n }\n\n idx = m_host.find(\":\/\/\");\n if (idx != string::npos)\n {\n m_proto = m_host.substr(0, idx);\n transform(m_proto.begin(), m_proto.end(), m_proto.begin(), [](char c){ return tolower(c); });\n m_host = m_host.substr(idx + 3, m_host.size() - (idx + 3));\n }\n\n \/\/ Handle the IPv6 specification in square brackets.\n \/\/ This actually handles anything specified in [] so potentially\n \/\/ you can also specify the usual hostname here as well. If the\n \/\/ whole host results to have [] at edge positions, they are stripped,\n \/\/ otherwise they remain. In both cases the search for the colon\n \/\/ separating the port specification starts only after ].\n const size_t i6pos = m_host.find(\"[\");\n size_t i6end = string::npos;\n\n \/\/ Search for the \"path\" part only behind the closed bracket,\n \/\/ if both open and close brackets were found\n size_t path_since = 0;\n if (i6pos != string::npos)\n {\n i6end = m_host.find(\"]\", i6pos);\n if (i6end != string::npos)\n path_since = i6end;\n }\n\n idx = m_host.find(\"\/\", path_since);\n if (idx != string::npos)\n {\n m_path = m_host.substr(idx, m_host.size() - idx);\n m_host = m_host.substr(0, idx);\n }\n\n \/\/ Check special things in the HOST entry.\n size_t atp = m_host.find('@');\n if ( atp != string::npos )\n {\n string realhost = m_host.substr(atp+1);\n string prehost;\n if ( atp > 0 )\n {\n prehost = m_host.substr(0, atp-0);\n size_t colon = prehost.find(':');\n if ( colon != string::npos )\n {\n string pw = prehost.substr(colon+1);\n string user;\n if ( colon > 0 )\n user = prehost.substr(0, colon-0);\n m_mapQuery[\"user\"] = user;\n m_mapQuery[\"password\"] = pw;\n }\n else\n {\n m_mapQuery[\"user\"] = prehost;\n }\n }\n else\n {\n m_mapQuery[\"multicast\"] = \"1\";\n }\n m_host = realhost;\n }\n\n bool stripbrackets = false;\n size_t hostend = 0;\n if (i6pos != string::npos)\n {\n \/\/ IPv6 IP address. Find the terminating ]\n hostend = m_host.find(\"]\", i6pos);\n idx = m_host.rfind(\":\");\n if (hostend != string::npos)\n {\n \/\/ Found the end. But not necessarily it was\n \/\/ at the beginning. If it was at the beginning,\n \/\/ strip them from the host name.\n\n size_t lasthost = idx;\n if (idx != string::npos && idx < hostend)\n {\n idx = string::npos;\n lasthost = m_host.size();\n }\n\n if (i6pos == 0 && hostend == lasthost - 1)\n {\n stripbrackets = true;\n }\n }\n }\n else\n {\n idx = m_host.rfind(\":\");\n }\n\n if (idx != string::npos)\n {\n m_port = m_host.substr(idx + 1, m_host.size() - (idx + 1));\n\n \/\/ Extract host WITHOUT stripping brackets\n m_host = m_host.substr(0, idx);\n }\n\n if (stripbrackets)\n {\n if (!hostend)\n hostend = m_host.size() - 1;\n m_host = m_host.substr(1, hostend - 1);\n }\n\n if ( m_port == \"\" && m_host != \"\" )\n {\n \/\/ Check if the host-but-no-port has specified\n \/\/ a single integer number. If so\n \/\/ We need to use C86 strtol, cannot use C++11\n const char* beg = m_host.c_str();\n const char* end = m_host.c_str() + m_host.size();\n char* eos = 0;\n long val = strtol(beg, &eos, 10);\n if ( val > 0 && eos == end )\n {\n m_port = m_host;\n m_host = \"\";\n }\n }\n\n string strQueryPair;\n while (iQueryStart > -1)\n {\n idx = strUrl.find(\"&\", iQueryStart);\n if (idx != string::npos)\n {\n strQueryPair = strUrl.substr(iQueryStart, idx - iQueryStart);\n iQueryStart = idx + 1;\n }\n else\n {\n strQueryPair = strUrl.substr(iQueryStart, strUrl.size() - iQueryStart);\n iQueryStart = idx;\n }\n\n idx = strQueryPair.find(\"=\");\n if (idx != string::npos)\n {\n m_mapQuery[strQueryPair.substr(0, idx)] = strQueryPair.substr(idx + 1, strQueryPair.size() - (idx + 1));\n }\n }\n\n if ( m_proto == \"file\" )\n {\n if ( m_path.size() > 3 && m_path.substr(0, 3) == \"\/.\/\" )\n m_path = m_path.substr(3);\n }\n\n \/\/ Post-parse fixes\n \/\/ Treat empty protocol as a file. In this case, merge the host and path.\n if ( exp == EXPECT_FILE && m_proto == \"\" && m_port == \"\" )\n {\n m_proto = \"file\";\n m_path = m_host + m_path;\n m_host = \"\";\n }\n\n m_uriType = types[m_proto]; \/\/ default-constructed UNKNOWN will be used if not found (although also inserted)\n m_origUri = strUrl;\n}\n\n#ifdef TEST\n\n#include <vector>\n\nusing namespace std;\n\nint main( int argc, char** argv )\n{\n if ( argc < 2 ) \n {\n return 0;\n }\n UriParser parser (argv[1], UriParser::EXPECT_HOST);\n std::vector<std::string> args;\n\n if (argc > 2)\n {\n copy(argv+2, argv+argc, back_inserter(args));\n }\n\n\n (void)argc;\n\n cout << \"PARSING URL: \" << argv[1] << endl;\n cout << \"SCHEME INDEX: \" << int(parser.type()) << endl;\n cout << \"PROTOCOL: \" << parser.proto() << endl;\n cout << \"HOST: \" << parser.host() << endl;\n cout << \"PORT (string): \" << parser.port() << endl;\n cout << \"PORT (numeric): \" << parser.portno() << endl;\n cout << \"PATH: \" << parser.path() << endl;\n cout << \"PARAMETERS:\\n\";\n for (auto& p: parser.parameters()) \n {\n cout << \"\\t\" << p.first << \" = \" << p.second << endl;\n }\n\n if (!args.empty())\n {\n for (string& s: args)\n {\n vector<string> keyval;\n Split(s, '=', back_inserter(keyval));\n if (keyval.size() < 2)\n keyval.push_back(\"\");\n parser[keyval[0]] = keyval[1];\n }\n\n cout << \"REASSEMBLED: \" << parser.makeUri() << endl;\n }\n return 0;\n}\n\n#endif\n<commit_msg>[apps] UriParser: fixed protocol type detection (#2452).<commit_after>\/*\n * SRT - Secure, Reliable, Transport\n * Copyright (c) 2018 Haivision Systems Inc.\n * \n * This Source Code Form is subject to the terms of the Mozilla Public\n * License, v. 2.0. If a copy of the MPL was not distributed with this\n * file, You can obtain one at http:\/\/mozilla.org\/MPL\/2.0\/.\n * \n *\/\n\n\/\/ STL includes\n#include <algorithm>\n#include <map>\n#include <string>\n\n#include \"uriparser.hpp\"\n\n#ifdef TEST\n#define TEST1 1\n#endif\n\n#ifdef TEST1\n#include <iostream>\n#endif\n\nusing namespace std;\n\nmap<string, UriParser::Type> g_types;\n\n\/\/ Map construction using the initializer list is only available starting from C++11.\n\/\/ This dummy structure is used instead.\nstruct UriParserInit\n{\n UriParserInit()\n {\n g_types[\"file\"] = UriParser::FILE;\n g_types[\"udp\"] = UriParser::UDP;\n g_types[\"tcp\"] = UriParser::TCP;\n g_types[\"srt\"] = UriParser::SRT;\n g_types[\"rtmp\"] = UriParser::RTMP;\n g_types[\"http\"] = UriParser::HTTP;\n g_types[\"rtp\"] = UriParser::RTP;\n g_types[\"\"] = UriParser::UNKNOWN;\n }\n} g_uriparser_init;\n\nUriParser::UriParser(const string& strUrl, DefaultExpect exp)\n : m_uriType(UNKNOWN)\n{\n m_expect = exp;\n Parse(strUrl, exp);\n}\n\nUriParser::~UriParser(void)\n{\n}\n\nstring UriParser::makeUri()\n{\n \/\/ Reassemble parts into the URI\n string prefix = \"\";\n if (m_proto != \"\")\n {\n prefix = m_proto + \":\/\/\";\n }\n\n std::ostringstream out;\n\n out << prefix << m_host;\n if ((m_port == \"\" || m_port == \"0\") && m_expect == EXPECT_FILE)\n {\n \/\/ Do not add port\n }\n else\n {\n out << \":\" << m_port;\n }\n\n if (m_path != \"\")\n {\n if (m_path[0] != '\/')\n out << \"\/\";\n out << m_path;\n }\n\n if (!m_mapQuery.empty())\n {\n out << \"?\";\n\n query_it i = m_mapQuery.begin();\n for (;;)\n {\n out << i->first << \"=\" << i->second;\n ++i;\n if (i == m_mapQuery.end())\n break;\n out << \"&\";\n }\n }\n\n m_origUri = out.str();\n return m_origUri;\n}\n\nstring UriParser::proto(void) const\n{\n return m_proto;\n}\n\nUriParser::Type UriParser::type() const\n{\n return m_uriType;\n}\n\nstring UriParser::host(void) const\n{\n return m_host;\n}\n\nstring UriParser::port(void) const\n{\n return m_port;\n}\n\nunsigned short int UriParser::portno(void) const\n{\n \/\/ This returns port in numeric version. Fallback to 0.\n try\n {\n int i = atoi(m_port.c_str());\n if ( i <= 0 || i > 65535 )\n return 0;\n return i;\n }\n catch (...)\n {\n return 0;\n }\n}\n\nstring UriParser::path(void) const\n{\n return m_path;\n}\n\nstring UriParser::queryValue(const string& strKey) const\n{\n return m_mapQuery.at(strKey);\n}\n\nvoid UriParser::Parse(const string& strUrl, DefaultExpect exp)\n{\n int iQueryStart = -1;\n\n size_t idx = strUrl.find(\"?\");\n if (idx != string::npos)\n {\n m_host = strUrl.substr(0, idx);\n iQueryStart = idx + 1;\n }\n else\n {\n m_host = strUrl;\n }\n\n idx = m_host.find(\":\/\/\");\n if (idx != string::npos)\n {\n m_proto = m_host.substr(0, idx);\n transform(m_proto.begin(), m_proto.end(), m_proto.begin(), [](char c){ return tolower(c); });\n m_host = m_host.substr(idx + 3, m_host.size() - (idx + 3));\n }\n\n \/\/ Handle the IPv6 specification in square brackets.\n \/\/ This actually handles anything specified in [] so potentially\n \/\/ you can also specify the usual hostname here as well. If the\n \/\/ whole host results to have [] at edge positions, they are stripped,\n \/\/ otherwise they remain. In both cases the search for the colon\n \/\/ separating the port specification starts only after ].\n const size_t i6pos = m_host.find(\"[\");\n size_t i6end = string::npos;\n\n \/\/ Search for the \"path\" part only behind the closed bracket,\n \/\/ if both open and close brackets were found\n size_t path_since = 0;\n if (i6pos != string::npos)\n {\n i6end = m_host.find(\"]\", i6pos);\n if (i6end != string::npos)\n path_since = i6end;\n }\n\n idx = m_host.find(\"\/\", path_since);\n if (idx != string::npos)\n {\n m_path = m_host.substr(idx, m_host.size() - idx);\n m_host = m_host.substr(0, idx);\n }\n\n \/\/ Check special things in the HOST entry.\n size_t atp = m_host.find('@');\n if (atp != string::npos)\n {\n string realhost = m_host.substr(atp+1);\n string prehost;\n if ( atp > 0 )\n {\n prehost = m_host.substr(0, atp-0);\n size_t colon = prehost.find(':');\n if ( colon != string::npos )\n {\n string pw = prehost.substr(colon+1);\n string user;\n if ( colon > 0 )\n user = prehost.substr(0, colon-0);\n m_mapQuery[\"user\"] = user;\n m_mapQuery[\"password\"] = pw;\n }\n else\n {\n m_mapQuery[\"user\"] = prehost;\n }\n }\n else\n {\n m_mapQuery[\"multicast\"] = \"1\";\n }\n m_host = realhost;\n }\n\n bool stripbrackets = false;\n size_t hostend = 0;\n if (i6pos != string::npos)\n {\n \/\/ IPv6 IP address. Find the terminating ]\n hostend = m_host.find(\"]\", i6pos);\n idx = m_host.rfind(\":\");\n if (hostend != string::npos)\n {\n \/\/ Found the end. But not necessarily it was\n \/\/ at the beginning. If it was at the beginning,\n \/\/ strip them from the host name.\n\n size_t lasthost = idx;\n if (idx != string::npos && idx < hostend)\n {\n idx = string::npos;\n lasthost = m_host.size();\n }\n\n if (i6pos == 0 && hostend == lasthost - 1)\n {\n stripbrackets = true;\n }\n }\n }\n else\n {\n idx = m_host.rfind(\":\");\n }\n\n if (idx != string::npos)\n {\n m_port = m_host.substr(idx + 1, m_host.size() - (idx + 1));\n\n \/\/ Extract host WITHOUT stripping brackets\n m_host = m_host.substr(0, idx);\n }\n\n if (stripbrackets)\n {\n if (!hostend)\n hostend = m_host.size() - 1;\n m_host = m_host.substr(1, hostend - 1);\n }\n\n if ( m_port == \"\" && m_host != \"\" )\n {\n \/\/ Check if the host-but-no-port has specified\n \/\/ a single integer number. If so\n \/\/ We need to use C86 strtol, cannot use C++11\n const char* beg = m_host.c_str();\n const char* end = m_host.c_str() + m_host.size();\n char* eos = 0;\n long val = strtol(beg, &eos, 10);\n if ( val > 0 && eos == end )\n {\n m_port = m_host;\n m_host = \"\";\n }\n }\n\n string strQueryPair;\n while (iQueryStart > -1)\n {\n idx = strUrl.find(\"&\", iQueryStart);\n if (idx != string::npos)\n {\n strQueryPair = strUrl.substr(iQueryStart, idx - iQueryStart);\n iQueryStart = idx + 1;\n }\n else\n {\n strQueryPair = strUrl.substr(iQueryStart, strUrl.size() - iQueryStart);\n iQueryStart = idx;\n }\n\n idx = strQueryPair.find(\"=\");\n if (idx != string::npos)\n {\n m_mapQuery[strQueryPair.substr(0, idx)] = strQueryPair.substr(idx + 1, strQueryPair.size() - (idx + 1));\n }\n }\n\n if (m_proto == \"file\")\n {\n if ( m_path.size() > 3 && m_path.substr(0, 3) == \"\/.\/\" )\n m_path = m_path.substr(3);\n }\n\n \/\/ Post-parse fixes\n \/\/ Treat empty protocol as a file. In this case, merge the host and path.\n if (exp == EXPECT_FILE && m_proto == \"\" && m_port == \"\")\n {\n m_proto = \"file\";\n m_path = m_host + m_path;\n m_host = \"\";\n }\n\n const auto proto_it = g_types.find(m_proto);\n \/\/ Default-constructed UNKNOWN will be used if not found.\n if (proto_it != g_types.end())\n {\n m_uriType = proto_it->second;\n }\n m_origUri = strUrl;\n}\n\n#ifdef TEST\n\n#include <vector>\n\nusing namespace std;\n\nint main( int argc, char** argv )\n{\n if ( argc < 2 ) \n {\n return 0;\n }\n UriParser parser (argv[1], UriParser::EXPECT_HOST);\n std::vector<std::string> args;\n\n if (argc > 2)\n {\n copy(argv+2, argv+argc, back_inserter(args));\n }\n\n\n (void)argc;\n\n cout << \"PARSING URL: \" << argv[1] << endl;\n cout << \"SCHEME INDEX: \" << int(parser.type()) << endl;\n cout << \"PROTOCOL: \" << parser.proto() << endl;\n cout << \"HOST: \" << parser.host() << endl;\n cout << \"PORT (string): \" << parser.port() << endl;\n cout << \"PORT (numeric): \" << parser.portno() << endl;\n cout << \"PATH: \" << parser.path() << endl;\n cout << \"PARAMETERS:\\n\";\n for (auto& p: parser.parameters()) \n {\n cout << \"\\t\" << p.first << \" = \" << p.second << endl;\n }\n\n if (!args.empty())\n {\n for (string& s: args)\n {\n vector<string> keyval;\n Split(s, '=', back_inserter(keyval));\n if (keyval.size() < 2)\n keyval.push_back(\"\");\n parser[keyval[0]] = keyval[1];\n }\n\n cout << \"REASSEMBLED: \" << parser.makeUri() << endl;\n }\n return 0;\n}\n\n#endif\n<|endoftext|>"} {"text":"<commit_before>#ifndef _PITO_INTERCEPTOR_JAIL_ENVIRONMENT_HPP_\n#define _PITO_INTERCEPTOR_JAIL_ENVIRONMENT_HPP_\n\n#include \"config.hpp\"\n\n#include <unistd.h>\n#include <algorithm>\n\nextern \"C\" { \n extern char **environ;\n}\n\nnamespace pito { namespace interceptor { namespace jail {\n\n\/\/ LD_PRELOAD entry\nstd::string preload;\n\ntemplate <class CharIt>\nCharIt end(CharIt begin) {\n while (*begin != '\\0') ++begin;\n return begin;\n}\n\n\/\/ mac can't use the real getenv in the init\nchar *getenv(char const *key) {\n char const *keyEnd = end(key);\n for (char **envp = environ; *envp != 0; ++envp) {\n if (std::equal(*envp, *envp + (keyEnd - key), key) && \n '=' == (*envp)[keyEnd - key]) \n {\n return *envp + (keyEnd - key) + 1;\n }\n }\n return 0;\n}\n\nvoid enforceEnvironment() {\n \/\/ TODO: append to existing LD_PRELOAD \n \/\/ also consider modifying environ directly (might avoid extra LD_PRELOAD start)\n setenv(_LD_PRELOAD, preload.c_str(), 1);\n#ifdef APPLE\n setenv(\"DYLD_FORCE_FLAT_NAMESPACE\", \"YES\", 1);\n#endif\n}\n\nvoid enforceEnvironment(char * const *env) {\n}\n\n} } }\n#endif\n<commit_msg>robin says this might fix mac osx<commit_after>#ifndef _PITO_INTERCEPTOR_JAIL_ENVIRONMENT_HPP_\n#define _PITO_INTERCEPTOR_JAIL_ENVIRONMENT_HPP_\n\n#include \"config.hpp\"\n\n#include <algorithm>\n\n#ifdef APPLE\n#include <crt_externs.h>\n#define environ (* _NSGetEnviron())\n#else\n#include <unistd.h>\n#endif\n\nnamespace pito { namespace interceptor { namespace jail {\n\n\/\/ LD_PRELOAD entry\nstd::string preload;\n\ntemplate <class CharIt>\nCharIt end(CharIt begin) {\n while (*begin != '\\0') ++begin;\n return begin;\n}\n\n\/\/ mac can't use the real getenv in the init\nchar *getenv(char const *key) {\n char const *keyEnd = end(key);\n for (char **envp = environ; *envp != 0; ++envp) {\n if (std::equal(*envp, *envp + (keyEnd - key), key) && \n '=' == (*envp)[keyEnd - key]) \n {\n return *envp + (keyEnd - key) + 1;\n }\n }\n return 0;\n}\n\nvoid enforceEnvironment() {\n \/\/ TODO: append to existing LD_PRELOAD \n \/\/ also consider modifying environ directly (might avoid extra LD_PRELOAD start)\n setenv(_LD_PRELOAD, preload.c_str(), 1);\n#ifdef APPLE\n setenv(\"DYLD_FORCE_FLAT_NAMESPACE\", \"YES\", 1);\n#endif\n}\n\nvoid enforceEnvironment(char * const *env) {\n}\n\n} } }\n#endif\n<|endoftext|>"} {"text":"<commit_before>#include \"unittest\/gtest.hpp\"\n#include \"unittest\/server_test_helper.hpp\"\n#include \"unittest\/unittest_utils.hpp\"\n#include \"buffer_cache\/large_buf.hpp\"\n\nnamespace unittest {\n\nstruct large_buf_tester_t : public server_test_helper_t {\nprotected:\n static int64_t leaf_bytes(cache_t *cache) {\n return cache->get_block_size().value() - sizeof(large_buf_leaf);\n }\n\n void run_tests(cache_t *cache) {\n {\n#ifndef NDEBUG\n TRACEPOINT;\n#endif\n \/\/ This is expected to pass.\n run_unprepend_shift_babytest(cache, 4 * leaf_bytes(cache), leaf_bytes(cache) - 1);\n }\n {\n#ifndef NDEBUG\n TRACEPOINT;\n#endif\n \/\/ This is expected to fail (because our code is expected\n \/\/ to be broken), at the time of writing the test.\n run_unprepend_shift_babytest(cache, 4 * leaf_bytes(cache), leaf_bytes(cache));\n }\n {\n#ifndef NDEBUG\n TRACEPOINT;\n#endif\n run_pend_grind_test(cache);\n }\n }\n\nprivate:\n void run_unprepend_shift_babytest(cache_t *cache, int64_t initial_size, int64_t unprepend_amount) {\n int64_t leaf_size = leaf_bytes(cache);\n\n const int num_root_ref_inlined = 2;\n\n \/\/ Sanity check test parameters.\n ASSERT_LT(unprepend_amount, initial_size);\n ASSERT_LT(num_root_ref_inlined * leaf_size, initial_size - unprepend_amount);\n ASSERT_LE(initial_size, leaf_size * (leaf_size \/ sizeof(block_id_t)));\n\n\n repli_timestamp time = repli_timestamp_t::distant_past;\n\n boost::shared_ptr<transaction_t> txn(new transaction_t(cache, rwi_write, 0, time));\n\n union {\n large_buf_ref ref;\n char ref_bytes[sizeof(large_buf_ref) + num_root_ref_inlined * sizeof(block_id_t)];\n };\n\n std::vector<char> chars(initial_size);\n for (int64_t i = 0; i < initial_size; ++i) {\n \/\/ 23 is relatively prime to leaf_size, which should be 4080.\n chars[i] = 'A' + (i % 23);\n }\n \n {\n large_buf_t lb(txn, &ref, lbref_limit_t(sizeof(ref_bytes)), rwi_write);\n lb.allocate(initial_size);\n lb.fill_at(0, chars.data(), initial_size);\n }\n\n ASSERT_EQ(0, ref.offset);\n ASSERT_EQ(initial_size, ref.size);\n\n {\n large_buf_t lb(txn, &ref, lbref_limit_t(sizeof(ref_bytes)), rwi_write);\n co_acquire_large_buf_for_unprepend(&lb, unprepend_amount);\n int refsize_adjustment_out;\n lb.unprepend(unprepend_amount, &refsize_adjustment_out);\n ASSERT_EQ(0, refsize_adjustment_out);\n }\n\n chars.erase(chars.begin(), chars.begin() + unprepend_amount);\n\n \/\/ Makes sure that unprepend unshifts the way we expect. We\n \/\/ expect things to be shifted largely to the left.\n ASSERT_EQ(unprepend_amount % leaf_size, ref.offset);\n ASSERT_EQ(initial_size - unprepend_amount, ref.size);\n\n {\n large_buf_t lb(txn, &ref, lbref_limit_t(sizeof(ref_bytes)), rwi_read);\n co_acquire_large_buf(&lb);\n\n std::vector<char> chars_out(initial_size - unprepend_amount);\n lb.read_at(0, chars_out.data(), initial_size - unprepend_amount);\n\n ASSERT_TRUE(chars == chars_out);\n }\n }\n\n void run_pend_grind_test(cache_t *cache) {\n const int num_root_ref_inlined = 2;\n\n \/\/ Sanity check test parameters.\n\n\n repli_timestamp time = repli_timestamp_t::distant_past;\n\n boost::shared_ptr<transaction_t> txn(new transaction_t(cache, rwi_write, 0, time));\n\n union {\n large_buf_ref ref;\n char ref_bytes[sizeof(large_buf_ref) + num_root_ref_inlined * sizeof(block_id_t)];\n };\n\n std::vector<char> chars(5000);\n for (int64_t i = 0; i < 5000; ++i) {\n \/\/ 23 is relatively prime to leaf_size, which should be 4080.\n chars[i] = 'A' + (i % 23);\n }\n\n {\n large_buf_t lb(txn, &ref, lbref_limit_t(sizeof(ref_bytes)), rwi_write);\n lb.allocate(5000);\n lb.fill_at(0, chars.data(), 5000);\n }\n\n for (int i = 0; i < 10000; i++) {\n debugf(\"%d\\n\", i);\n {\n large_buf_t lb(txn, &ref, lbref_limit_t(sizeof(ref_bytes)), rwi_write);\n co_acquire_large_buf_for_unprepend(&lb, 100);\n int refsize_adjustment_out;\n lb.unprepend(100, &refsize_adjustment_out);\n debugf(\"unprepend: %d\\n\", refsize_adjustment_out);\n }\n {\n large_buf_t lb(txn, &ref, lbref_limit_t(sizeof(ref_bytes)), rwi_write);\n threadsafe_cond_t cond;\n co_acquire_large_buf(&lb, &cond);\n cond.wait();\n int refsize_adjustment_out;\n lb.append(100, &refsize_adjustment_out);\n debugf(\"append: %d\\n\", refsize_adjustment_out);\n }\n }\n }\n};\n\nTEST(LargeBufTest, all_tests) {\n large_buf_tester_t().run();\n}\n\n} \/\/ namespace unittest\n<commit_msg>Removed noise from large_buf_test.<commit_after>#include \"unittest\/gtest.hpp\"\n#include \"unittest\/server_test_helper.hpp\"\n#include \"unittest\/unittest_utils.hpp\"\n#include \"buffer_cache\/large_buf.hpp\"\n\nnamespace unittest {\n\nstruct large_buf_tester_t : public server_test_helper_t {\nprotected:\n static int64_t leaf_bytes(cache_t *cache) {\n return cache->get_block_size().value() - sizeof(large_buf_leaf);\n }\n\n void run_tests(cache_t *cache) {\n {\n \/\/ This is expected to pass.\n run_unprepend_shift_babytest(cache, 4 * leaf_bytes(cache), leaf_bytes(cache) - 1);\n }\n {\n \/\/ This is expected to fail (because our code is expected\n \/\/ to be broken), at the time of writing the test.\n run_unprepend_shift_babytest(cache, 4 * leaf_bytes(cache), leaf_bytes(cache));\n }\n {\n run_pend_grind_test(cache);\n }\n }\n\nprivate:\n void run_unprepend_shift_babytest(cache_t *cache, int64_t initial_size, int64_t unprepend_amount) {\n int64_t leaf_size = leaf_bytes(cache);\n\n const int num_root_ref_inlined = 2;\n\n \/\/ Sanity check test parameters.\n ASSERT_LT(unprepend_amount, initial_size);\n ASSERT_LT(num_root_ref_inlined * leaf_size, initial_size - unprepend_amount);\n ASSERT_LE(initial_size, leaf_size * (leaf_size \/ sizeof(block_id_t)));\n\n\n repli_timestamp time = repli_timestamp_t::distant_past;\n\n boost::shared_ptr<transaction_t> txn(new transaction_t(cache, rwi_write, 0, time));\n\n union {\n large_buf_ref ref;\n char ref_bytes[sizeof(large_buf_ref) + num_root_ref_inlined * sizeof(block_id_t)];\n };\n\n std::vector<char> chars(initial_size);\n for (int64_t i = 0; i < initial_size; ++i) {\n \/\/ 23 is relatively prime to leaf_size, which should be 4080.\n chars[i] = 'A' + (i % 23);\n }\n \n {\n large_buf_t lb(txn, &ref, lbref_limit_t(sizeof(ref_bytes)), rwi_write);\n lb.allocate(initial_size);\n lb.fill_at(0, chars.data(), initial_size);\n }\n\n ASSERT_EQ(0, ref.offset);\n ASSERT_EQ(initial_size, ref.size);\n\n {\n large_buf_t lb(txn, &ref, lbref_limit_t(sizeof(ref_bytes)), rwi_write);\n co_acquire_large_buf_for_unprepend(&lb, unprepend_amount);\n int refsize_adjustment_out;\n lb.unprepend(unprepend_amount, &refsize_adjustment_out);\n ASSERT_EQ(0, refsize_adjustment_out);\n }\n\n chars.erase(chars.begin(), chars.begin() + unprepend_amount);\n\n \/\/ Makes sure that unprepend unshifts the way we expect. We\n \/\/ expect things to be shifted largely to the left.\n ASSERT_EQ(unprepend_amount % leaf_size, ref.offset);\n ASSERT_EQ(initial_size - unprepend_amount, ref.size);\n\n {\n large_buf_t lb(txn, &ref, lbref_limit_t(sizeof(ref_bytes)), rwi_read);\n co_acquire_large_buf(&lb);\n\n std::vector<char> chars_out(initial_size - unprepend_amount);\n lb.read_at(0, chars_out.data(), initial_size - unprepend_amount);\n\n ASSERT_TRUE(chars == chars_out);\n }\n }\n\n void run_pend_grind_test(cache_t *cache) {\n const int num_root_ref_inlined = 2;\n\n \/\/ Sanity check test parameters.\n\n\n repli_timestamp time = repli_timestamp_t::distant_past;\n\n boost::shared_ptr<transaction_t> txn(new transaction_t(cache, rwi_write, 0, time));\n\n union {\n large_buf_ref ref;\n char ref_bytes[sizeof(large_buf_ref) + num_root_ref_inlined * sizeof(block_id_t)];\n };\n\n std::vector<char> chars(5000);\n for (int64_t i = 0; i < 5000; ++i) {\n \/\/ 23 is relatively prime to leaf_size, which should be 4080.\n chars[i] = 'A' + (i % 23);\n }\n\n {\n large_buf_t lb(txn, &ref, lbref_limit_t(sizeof(ref_bytes)), rwi_write);\n lb.allocate(5000);\n lb.fill_at(0, chars.data(), 5000);\n }\n\n for (int i = 0; i < 10000; i++) {\n SCOPED_TRACE(i);\n {\n large_buf_t lb(txn, &ref, lbref_limit_t(sizeof(ref_bytes)), rwi_write);\n co_acquire_large_buf_for_unprepend(&lb, 100);\n int refsize_adjustment_out;\n lb.unprepend(100, &refsize_adjustment_out);\n }\n {\n large_buf_t lb(txn, &ref, lbref_limit_t(sizeof(ref_bytes)), rwi_write);\n threadsafe_cond_t cond;\n co_acquire_large_buf(&lb, &cond);\n cond.wait();\n int refsize_adjustment_out;\n lb.append(100, &refsize_adjustment_out);\n }\n }\n }\n};\n\nTEST(LargeBufTest, all_tests) {\n large_buf_tester_t().run();\n}\n\n} \/\/ namespace unittest\n<|endoftext|>"} {"text":"<commit_before>\/\/ Copyright 2010-2014 RethinkDB, all rights reserved.\n#include \"unittest\/unittest_utils.hpp\"\n\n#include <stdlib.h>\n\n#include <functional>\n\n#include \"arch\/timing.hpp\"\n#include \"arch\/runtime\/starter.hpp\"\n#include \"rdb_protocol\/datum.hpp\"\n#include \"rdb_protocol\/protocol.hpp\"\n#include \"unittest\/gtest.hpp\"\n#include \"utils.hpp\"\n\nnamespace unittest {\n\nstd::string rand_string(int len) {\n std::string res;\n\n int seed = randint(RAND_MAX);\n\n while (len --> 0) {\n res.push_back((seed % 26) + 'A');\n seed ^= seed >> 17;\n seed += seed << 11;\n seed ^= seed >> 29;\n }\n\n return res;\n}\n\nstruct make_sindex_read_t {\n static read_t make_sindex_read(ql::datum_t key, const std::string &id) {\n ql::datum_range_t rng(key, key_range_t::closed, key, key_range_t::closed);\n return read_t(\n rget_read_t(\n boost::optional<changefeed_stamp_t>(),\n region_t::universe(),\n std::map<std::string, ql::wire_func_t>(),\n \"\",\n ql::batchspec_t::default_for(ql::batch_type_t::NORMAL),\n std::vector<ql::transform_variant_t>(),\n boost::optional<ql::terminal_variant_t>(),\n sindex_rangespec_t(id, boost::none, rng),\n sorting_t::UNORDERED),\n profile_bool_t::PROFILE,\n read_mode_t::SINGLE);\n }\n};\n\nread_t make_sindex_read(\n ql::datum_t key, const std::string &id) {\n return make_sindex_read_t::make_sindex_read(key, id);\n}\n\nserializer_filepath_t manual_serializer_filepath(const std::string &permanent_path,\n const std::string &temporary_path) {\n\n return serializer_filepath_t(permanent_path, temporary_path);\n}\n\n\nstatic const char *const temp_file_create_suffix = \".create\";\n\ntemp_file_t::temp_file_t() {\n for (;;) {\n char tmpl[] = \"\/tmp\/rdb_unittest.XXXXXX\";\n const int fd = mkstemp(tmpl);\n guarantee_err(fd != -1, \"Couldn't create a temporary file\");\n close(fd);\n\n \/\/ Check that both the permanent and temporary file paths are unused.\n const std::string tmpfilename = std::string(tmpl) + temp_file_create_suffix;\n if (::access(tmpfilename.c_str(), F_OK) == -1 && get_errno() == ENOENT) {\n filename = tmpl;\n break;\n } else {\n const int unlink_res = ::unlink(tmpl);\n EXPECT_EQ(0, unlink_res);\n }\n }\n}\n\ntemp_file_t::~temp_file_t() {\n \/\/ Unlink both possible locations of the file.\n const int res1 = ::unlink(name().temporary_path().c_str());\n EXPECT_TRUE(res1 == 0 || get_errno() == ENOENT);\n const int res2 = ::unlink(name().permanent_path().c_str());\n EXPECT_TRUE(res2 == 0 || get_errno() == ENOENT);\n}\n\nserializer_filepath_t temp_file_t::name() const {\n return manual_serializer_filepath(filename, filename + temp_file_create_suffix);\n}\n\ntemp_directory_t::temp_directory_t() {\n char tmpl[] = \"\/tmp\/rdb_unittest.XXXXXX\";\n char *res = mkdtemp(tmpl);\n guarantee_err(res != nullptr, \"Couldn't create a temporary directory\");\n directory = base_path_t(std::string(res));\n}\n\ntemp_directory_t::~temp_directory_t() {\n remove_directory_recursive(directory.path().c_str());\n}\n\nbase_path_t temp_directory_t::path() const {\n return directory;\n}\n\nvoid let_stuff_happen() {\n#ifdef VALGRIND\n nap(2000);\n#else\n nap(100);\n#endif\n}\n\nstd::set<ip_address_t> get_unittest_addresses() {\n return get_local_ips(std::set<ip_address_t>(),\n local_ip_filter_t::MATCH_FILTER_OR_LOOPBACK);\n}\n\nvoid run_in_thread_pool(const std::function<void()> &fun, int num_workers) {\n ::run_in_thread_pool(fun, num_workers);\n}\n\nkey_range_t quick_range(const char *bounds) {\n guarantee(strlen(bounds) == 3);\n char left = bounds[0];\n guarantee(bounds[1] == '-');\n char right = bounds[2];\n if (left != '*' && right != '*') {\n guarantee(left <= right);\n }\n key_range_t r;\n r.left = (left == '*')\n ? store_key_t()\n : store_key_t(std::string(1, left));\n r.right = (right == '*')\n ? key_range_t::right_bound_t()\n : key_range_t::right_bound_t(store_key_t(std::string(1, right+1)));\n return r;\n}\n\nregion_t quick_region(const char *bounds) {\n return region_t(quick_range(bounds));\n}\n\nstate_timestamp_t make_state_timestamp(int n) {\n state_timestamp_t t;\n t.num = n;\n return t;\n}\n\n} \/\/ namespace unittest\n<commit_msg>fixing unittest failures due to missing tmp dir<commit_after>\/\/ Copyright 2010-2014 RethinkDB, all rights reserved.\n#include \"unittest\/unittest_utils.hpp\"\n\n#include <stdlib.h>\n\n#include <functional>\n\n#include \"arch\/timing.hpp\"\n#include \"arch\/runtime\/starter.hpp\"\n#include \"rdb_protocol\/datum.hpp\"\n#include \"rdb_protocol\/protocol.hpp\"\n#include \"unittest\/gtest.hpp\"\n#include \"utils.hpp\"\n\nnamespace unittest {\n\nstd::string rand_string(int len) {\n std::string res;\n\n int seed = randint(RAND_MAX);\n\n while (len --> 0) {\n res.push_back((seed % 26) + 'A');\n seed ^= seed >> 17;\n seed += seed << 11;\n seed ^= seed >> 29;\n }\n\n return res;\n}\n\nstruct make_sindex_read_t {\n static read_t make_sindex_read(ql::datum_t key, const std::string &id) {\n ql::datum_range_t rng(key, key_range_t::closed, key, key_range_t::closed);\n return read_t(\n rget_read_t(\n boost::optional<changefeed_stamp_t>(),\n region_t::universe(),\n std::map<std::string, ql::wire_func_t>(),\n \"\",\n ql::batchspec_t::default_for(ql::batch_type_t::NORMAL),\n std::vector<ql::transform_variant_t>(),\n boost::optional<ql::terminal_variant_t>(),\n sindex_rangespec_t(id, boost::none, rng),\n sorting_t::UNORDERED),\n profile_bool_t::PROFILE,\n read_mode_t::SINGLE);\n }\n};\n\nread_t make_sindex_read(\n ql::datum_t key, const std::string &id) {\n return make_sindex_read_t::make_sindex_read(key, id);\n}\n\nserializer_filepath_t manual_serializer_filepath(const std::string &permanent_path,\n const std::string &temporary_path) {\n\n return serializer_filepath_t(permanent_path, temporary_path);\n}\n\n\nstatic const char *const temp_file_create_suffix = \".create\";\n\ntemp_file_t::temp_file_t() {\n for (;;) {\n char tmpl[] = \"\/tmp\/rdb_unittest.XXXXXX\";\n const int fd = mkstemp(tmpl);\n guarantee_err(fd != -1, \"Couldn't create a temporary file\");\n close(fd);\n\n \/\/ Check that both the permanent and temporary file paths are unused.\n const std::string tmpfilename = std::string(tmpl) + temp_file_create_suffix;\n if (::access(tmpfilename.c_str(), F_OK) == -1 && get_errno() == ENOENT) {\n filename = tmpl;\n break;\n } else {\n const int unlink_res = ::unlink(tmpl);\n EXPECT_EQ(0, unlink_res);\n }\n }\n}\n\ntemp_file_t::~temp_file_t() {\n \/\/ Unlink both possible locations of the file.\n const int res1 = ::unlink(name().temporary_path().c_str());\n EXPECT_TRUE(res1 == 0 || get_errno() == ENOENT);\n const int res2 = ::unlink(name().permanent_path().c_str());\n EXPECT_TRUE(res2 == 0 || get_errno() == ENOENT);\n}\n\nserializer_filepath_t temp_file_t::name() const {\n return manual_serializer_filepath(filename, filename + temp_file_create_suffix);\n}\n\ntemp_directory_t::temp_directory_t() {\n char tmpl[] = \"\/tmp\/rdb_unittest.XXXXXX\";\n char *res = mkdtemp(tmpl);\n guarantee_err(res != nullptr, \"Couldn't create a temporary directory\");\n directory = base_path_t(std::string(res));\n\n \/\/ Some usages of this directory may require an internal temporary directory\n recreate_temporary_directory(directory);\n}\n\ntemp_directory_t::~temp_directory_t() {\n remove_directory_recursive(directory.path().c_str());\n}\n\nbase_path_t temp_directory_t::path() const {\n return directory;\n}\n\nvoid let_stuff_happen() {\n#ifdef VALGRIND\n nap(2000);\n#else\n nap(100);\n#endif\n}\n\nstd::set<ip_address_t> get_unittest_addresses() {\n return get_local_ips(std::set<ip_address_t>(),\n local_ip_filter_t::MATCH_FILTER_OR_LOOPBACK);\n}\n\nvoid run_in_thread_pool(const std::function<void()> &fun, int num_workers) {\n ::run_in_thread_pool(fun, num_workers);\n}\n\nkey_range_t quick_range(const char *bounds) {\n guarantee(strlen(bounds) == 3);\n char left = bounds[0];\n guarantee(bounds[1] == '-');\n char right = bounds[2];\n if (left != '*' && right != '*') {\n guarantee(left <= right);\n }\n key_range_t r;\n r.left = (left == '*')\n ? store_key_t()\n : store_key_t(std::string(1, left));\n r.right = (right == '*')\n ? key_range_t::right_bound_t()\n : key_range_t::right_bound_t(store_key_t(std::string(1, right+1)));\n return r;\n}\n\nregion_t quick_region(const char *bounds) {\n return region_t(quick_range(bounds));\n}\n\nstate_timestamp_t make_state_timestamp(int n) {\n state_timestamp_t t;\n t.num = n;\n return t;\n}\n\n} \/\/ namespace unittest\n<|endoftext|>"} {"text":"<commit_before>#ifndef SHADOW_UTIL_UTIL_HPP\n#define SHADOW_UTIL_UTIL_HPP\n\n#include <algorithm>\n#include <cctype>\n#include <cfloat>\n#include <cmath>\n#include <cstring>\n#include <fstream>\n#include <iomanip>\n#include <iostream>\n#include <sstream>\n#include <stdexcept>\n#include <string>\n#include <vector>\n\nnamespace Util {\n\ntemplate <typename Dtype>\ninline int round(Dtype x) {\n return static_cast<int>(std::floor(x + 0.5));\n}\n\ninline float rand_uniform(float min, float max) {\n return (static_cast<float>(std::rand()) \/ RAND_MAX) * (max - min) + min;\n}\n\ntemplate <typename Dtype>\ninline Dtype constrain(Dtype min, Dtype max, Dtype value) {\n if (value < min) return min;\n if (value > max) return max;\n return value;\n}\n\ntemplate <typename Dtype>\ninline std::string str(Dtype val) {\n return std::to_string(val);\n}\n\ninline std::string format_int(int n, int width, char pad = ' ') {\n std::stringstream out;\n out << std::setw(width) << std::setfill(pad) << n;\n return out.str();\n}\n\ntemplate <typename Dtype>\ninline std::string format_vector(const std::vector<Dtype> &vector,\n const std::string &split = \",\",\n const std::string &prefix = \"\",\n const std::string &postfix = \"\") {\n std::stringstream out;\n out << prefix;\n for (int i = 0; i < vector.size() - 1; ++i) {\n out << vector.at(i) << split;\n }\n if (vector.size() > 1) {\n out << vector.at(vector.size() - 1);\n }\n out << postfix;\n return out.str();\n}\n\ninline std::string find_replace(const std::string &str,\n const std::string &old_str,\n const std::string &new_str) {\n std::string origin(str);\n size_t index = 0;\n while ((index = origin.find(old_str, index)) != std::string::npos) {\n origin.replace(index, old_str.length(), new_str);\n index += new_str.length();\n }\n return origin;\n}\n\ninline std::string find_replace_last(const std::string &str,\n const std::string &old_str,\n const std::string &new_str) {\n std::string origin(str);\n size_t index = origin.find_last_of(old_str);\n origin.replace(index, old_str.length(), new_str);\n return origin;\n}\n\ninline std::string change_extension(const std::string &str,\n const std::string &new_ext) {\n std::string origin(str);\n size_t index = origin.find_last_of(\".\");\n origin.replace(index, origin.length(), new_ext);\n return origin;\n}\n\ninline std::vector<std::string> tokenize(const std::string &str,\n const std::string &split) {\n std::string::size_type last_pos = 0;\n std::string::size_type pos = str.find_first_of(split, last_pos);\n std::vector<std::string> tokens;\n while (last_pos != std::string::npos) {\n if (pos != last_pos) tokens.push_back(str.substr(last_pos, pos - last_pos));\n last_pos = pos;\n if (last_pos == std::string::npos || last_pos + 1 == str.length()) break;\n pos = str.find_first_of(split, ++last_pos);\n }\n return tokens;\n}\n\ninline std::vector<std::string> load_list(const std::string &list_file) {\n std::ifstream file(list_file);\n if (!file.is_open()) {\n throw std::runtime_error(\"Load image list file error!\");\n }\n\n std::vector<std::string> image_list;\n std::string dir;\n while (std::getline(file, dir)) {\n if (dir.length()) image_list.push_back(dir);\n }\n file.close();\n return image_list;\n}\n\ninline std::string read_text_from_file(const std::string &filename) {\n std::ifstream file(filename);\n if (!file.is_open()) {\n std::cerr << \"Can't open text file \" << filename;\n return std::string();\n }\n\n std::stringstream result;\n std::string tmp;\n while (std::getline(file, tmp)) result << tmp << std::endl;\n file.close();\n return result.str();\n}\n\n} \/\/ namespace Util\n\n#if defined(__linux)\n#include <linux\/limits.h>\n#include <unistd.h>\n#else\n#define NOMINMAX\n#include <windows.h>\n#endif\n\n#include <sys\/stat.h>\nclass Path {\n public:\n enum PathType {\n kPosix = 0,\n kWindows = 1,\n#if defined(__linux)\n KNative = kPosix\n#else\n KNative = kWindows\n#endif\n };\n\n Path() : type_(KNative), absolute_(false) {}\n Path(const Path &path)\n : type_(path.type_), path_(path.path_), absolute_(path.absolute_) {}\n explicit Path(const char *str) { set(str); }\n explicit Path(const std::string &str) { set(str); }\n\n bool is_empty() const { return path_.empty(); }\n\n bool is_exist() const {\n#if defined(__linux)\n struct stat sb;\n return stat(str().c_str(), &sb) == 0;\n#else\n return GetFileAttributesW(wstr().c_str()) != INVALID_FILE_ATTRIBUTES;\n#endif\n }\n\n bool is_directory() const {\n#if defined(__linux)\n struct stat sb;\n if (stat(str().c_str(), &sb)) return false;\n return S_ISDIR(sb.st_mode);\n#else\n DWORD attr = GetFileAttributesW(wstr().c_str());\n return attr != INVALID_FILE_ATTRIBUTES &&\n (attr & FILE_ATTRIBUTE_DIRECTORY) != 0;\n#endif\n }\n\n bool is_file() const {\n#if defined(__linux)\n struct stat sb;\n if (stat(str().c_str(), &sb)) return false;\n return S_ISREG(sb.st_mode);\n#else\n DWORD attr = GetFileAttributesW(wstr().c_str());\n return attr != INVALID_FILE_ATTRIBUTES &&\n (attr & FILE_ATTRIBUTE_DIRECTORY) == 0;\n#endif\n }\n\n bool is_absolute() const { return absolute_; }\n\n Path make_absolute() const {\n#if defined(__linux)\n char temp[PATH_MAX];\n if (realpath(str().c_str(), temp) == NULL) {\n throw std::runtime_error(\"Error in make_absolute(): \" +\n std::string(strerror(errno)));\n }\n return Path(temp);\n#else\n std::wstring value = wstr(), out(MAX_PATH, '\\0');\n DWORD length = GetFullPathNameW(value.c_str(), MAX_PATH, &out[0], NULL);\n if (length == 0) {\n throw std::runtime_error(\"Error in make_absolute(): \" +\n std::to_string(GetLastError()));\n }\n std::wstring temp = out.substr(0, length);\n return Path(std::string(temp.begin(), temp.end()));\n#endif\n }\n\n std::string file_name() const {\n if (path_.empty() || !is_file()) return \"\";\n return path_[path_.size() - 1];\n }\n\n std::string folder_name() const {\n if (path_.empty() || !is_directory()) return \"\";\n return path_[path_.size() - 1];\n }\n\n std::string name() const {\n std::string name = file_name();\n size_t pos = name.find_last_of(\".\");\n if (pos == std::string::npos) return \"\";\n return name.substr(0, pos);\n }\n\n std::string extension() const {\n std::string name = file_name();\n size_t pos = name.find_last_of(\".\");\n if (pos == std::string::npos) return \"\";\n return name.substr(pos + 1);\n }\n\n size_t length() const { return path_.size(); }\n\n size_t file_size() const {\n#if defined(__linux)\n struct stat sb;\n if (stat(str().c_str(), &sb) != 0) {\n throw std::runtime_error(\"Error in file_size(): \" + str());\n }\n#else\n struct _stati64 sb;\n if (_wstati64(wstr().c_str(), &sb) != 0) {\n throw std::runtime_error(\"Error in file_size(): \" + str());\n }\n#endif\n return (size_t)sb.st_size;\n }\n\n Path parent_path() const {\n Path result;\n result.absolute_ = absolute_;\n if (path_.empty()) {\n if (!absolute_) result.path_.push_back(\"..\");\n } else {\n for (size_t i = 0; i < path_.size() - 1; ++i) {\n result.path_.push_back(path_[i]);\n }\n }\n return result;\n }\n\n std::string str(PathType type = KNative) const {\n std::stringstream oss;\n if (type_ == kPosix && absolute_) oss << \"\/\";\n for (size_t i = 0; i < path_.size(); ++i) {\n oss << path_[i];\n if (i + 1 < path_.size()) {\n if (type == kPosix) {\n oss << '\/';\n } else {\n oss << '\\\\';\n }\n }\n }\n return oss.str();\n }\n\n std::wstring wstr(PathType type = KNative) const {\n std::string temp = str(type);\n return std::wstring(temp.begin(), temp.end());\n }\n\n void set(const std::string &str, PathType type = KNative) {\n type_ = type;\n if (type == kWindows) {\n path_ = Util::tokenize(str, \"\/\\\\\");\n absolute_ = str.size() >= 2 && std::isalpha(str[0]) && str[1] == ':';\n } else {\n path_ = Util::tokenize(str, \"\/\");\n absolute_ = !str.empty() && str[0] == '\/';\n }\n }\n\n bool remove_file() {\n#if defined(__linux)\n return std::remove(str().c_str()) == 0;\n#else\n return DeleteFileW(wstr().c_str()) != 0;\n#endif\n }\n\n bool resize_file(size_t target_length) {\n#if defined(__linux)\n return ::truncate(str().c_str(), (off_t)target_length) == 0;\n#else\n HANDLE handle = CreateFileW(wstr().c_str(), GENERIC_WRITE, 0, nullptr, 0,\n FILE_ATTRIBUTE_NORMAL, nullptr);\n if (handle == INVALID_HANDLE_VALUE) return false;\n LARGE_INTEGER size;\n size.QuadPart = (LONGLONG)target_length;\n if (SetFilePointerEx(handle, size, NULL, FILE_BEGIN) == 0) {\n CloseHandle(handle);\n return false;\n }\n if (SetEndOfFile(handle) == 0) {\n CloseHandle(handle);\n return false;\n }\n CloseHandle(handle);\n return true;\n#endif\n }\n\n static Path cwd() {\n#if defined(__linux)\n char temp[PATH_MAX];\n if (::getcwd(temp, PATH_MAX) == NULL) {\n throw std::runtime_error(\"Error in cwd(): \" +\n std::string(strerror(errno)));\n }\n return Path(temp);\n#else\n std::wstring temp(MAX_PATH, '\\0');\n if (!_wgetcwd(&temp[0], MAX_PATH)) {\n throw std::runtime_error(\"Error in cwd(): \" +\n std::to_string(GetLastError()));\n }\n return Path(std::string(temp.begin(), temp.end()));\n#endif\n }\n\n Path operator\/(const Path &other) const {\n if (other.absolute_) {\n throw std::runtime_error(\"Error in operator\/: expected a relative path!\");\n }\n if (type_ != other.type_) {\n throw std::runtime_error(\n \"Error in operator\/: expected a path of the same type!\");\n }\n Path result(*this);\n for (const auto &path : other.path_) {\n result.path_.push_back(path);\n }\n return result;\n }\n Path operator+(const Path &other) const {\n if (other.absolute_) {\n throw std::runtime_error(\"Error in operator\/: expected a relative path!\");\n }\n if (type_ != other.type_) {\n throw std::runtime_error(\n \"Error in operator\/: expected a path of the same type!\");\n }\n Path result(*this);\n for (const auto &path : other.path_) {\n result.path_.push_back(path);\n }\n return result;\n }\n\n Path &operator=(const Path &path) {\n type_ = path.type_;\n path_ = path.path_;\n absolute_ = path.absolute_;\n return *this;\n }\n\n bool operator==(const Path &p) const { return p.path_ == path_; }\n bool operator!=(const Path &p) const { return p.path_ != path_; }\n\n friend std::ostream &operator<<(std::ostream &os, const Path &path) {\n os << path.str();\n return os;\n }\n\n private:\n PathType type_;\n std::vector<std::string> path_;\n bool absolute_;\n};\n\nnamespace Util {\n\ninline bool make_directory(const Path &path) {\n#if defined(__linux)\n return mkdir(path.str().c_str(), S_IRUSR | S_IWUSR | S_IXUSR) == 0;\n#else\n return CreateDirectoryW(path.wstr().c_str(), NULL) != 0;\n#endif\n}\n\n} \/\/ namespace Util\n\n#if defined(__linux)\n#include <ctime>\nclass Timer {\n public:\n Timer() : ts(clock()) {}\n\n void start() { ts = clock(); }\n double get_second() {\n return static_cast<double>(clock() - ts) \/ CLOCKS_PER_SEC;\n }\n double get_millisecond() {\n return 1000.0 * static_cast<double>(clock() - ts) \/ CLOCKS_PER_SEC;\n }\n\n private:\n clock_t ts;\n};\n\n#else\nclass Timer {\n public:\n Timer() { QueryPerformanceFrequency(&tfrequency_); }\n\n void start() { QueryPerformanceCounter(&tstart_); }\n double get_second() {\n QueryPerformanceCounter(&tend_);\n return static_cast<double>(tend_.QuadPart - tstart_.QuadPart) \/\n tfrequency_.QuadPart;\n }\n double get_millisecond() {\n QueryPerformanceCounter(&tend_);\n return 1000.0 * static_cast<double>(tend_.QuadPart - tstart_.QuadPart) \/\n tfrequency_.QuadPart;\n }\n\n private:\n LARGE_INTEGER tstart_, tend_, tfrequency_;\n};\n#endif\n\n#endif \/\/ SHADOW_UTIL_UTIL_HPP\n<commit_msg>add feature: add console process emulator<commit_after>#ifndef SHADOW_UTIL_UTIL_HPP\n#define SHADOW_UTIL_UTIL_HPP\n\n#include <algorithm>\n#include <cctype>\n#include <cfloat>\n#include <cmath>\n#include <cstring>\n#include <fstream>\n#include <iomanip>\n#include <iostream>\n#include <sstream>\n#include <stdexcept>\n#include <string>\n#include <vector>\n\nnamespace Util {\n\ntemplate <typename Dtype>\ninline int round(Dtype x) {\n return static_cast<int>(std::floor(x + 0.5));\n}\n\ninline float rand_uniform(float min, float max) {\n return (static_cast<float>(std::rand()) \/ RAND_MAX) * (max - min) + min;\n}\n\ntemplate <typename Dtype>\ninline Dtype constrain(Dtype min, Dtype max, Dtype value) {\n if (value < min) return min;\n if (value > max) return max;\n return value;\n}\n\ntemplate <typename Dtype>\ninline std::string str(Dtype val) {\n return std::to_string(val);\n}\n\ninline std::string format_int(int n, int width, char pad = ' ') {\n std::stringstream out;\n out << std::setw(width) << std::setfill(pad) << n;\n return out.str();\n}\n\ninline std::string format_process(int current, int total) {\n int digits = total > 0 ? std::log10(total) + 1 : 1;\n std::stringstream out;\n out << format_int(current, digits) << \" \/ \" << total;\n return out.str();\n}\n\ntemplate <typename Dtype>\ninline std::string format_vector(const std::vector<Dtype> &vector,\n const std::string &split = \",\",\n const std::string &prefix = \"\",\n const std::string &postfix = \"\") {\n std::stringstream out;\n out << prefix;\n for (int i = 0; i < vector.size() - 1; ++i) {\n out << vector.at(i) << split;\n }\n if (vector.size() > 1) {\n out << vector.at(vector.size() - 1);\n }\n out << postfix;\n return out.str();\n}\n\ninline std::string find_replace(const std::string &str,\n const std::string &old_str,\n const std::string &new_str) {\n std::string origin(str);\n size_t index = 0;\n while ((index = origin.find(old_str, index)) != std::string::npos) {\n origin.replace(index, old_str.length(), new_str);\n index += new_str.length();\n }\n return origin;\n}\n\ninline std::string find_replace_last(const std::string &str,\n const std::string &old_str,\n const std::string &new_str) {\n std::string origin(str);\n size_t index = origin.find_last_of(old_str);\n origin.replace(index, old_str.length(), new_str);\n return origin;\n}\n\ninline std::string change_extension(const std::string &str,\n const std::string &new_ext) {\n std::string origin(str);\n size_t index = origin.find_last_of(\".\");\n origin.replace(index, origin.length(), new_ext);\n return origin;\n}\n\ninline std::vector<std::string> tokenize(const std::string &str,\n const std::string &split) {\n std::string::size_type last_pos = 0;\n std::string::size_type pos = str.find_first_of(split, last_pos);\n std::vector<std::string> tokens;\n while (last_pos != std::string::npos) {\n if (pos != last_pos) tokens.push_back(str.substr(last_pos, pos - last_pos));\n last_pos = pos;\n if (last_pos == std::string::npos || last_pos + 1 == str.length()) break;\n pos = str.find_first_of(split, ++last_pos);\n }\n return tokens;\n}\n\ninline std::vector<std::string> load_list(const std::string &list_file) {\n std::ifstream file(list_file);\n if (!file.is_open()) {\n throw std::runtime_error(\"Load image list file error!\");\n }\n\n std::vector<std::string> image_list;\n std::string dir;\n while (std::getline(file, dir)) {\n if (dir.length()) image_list.push_back(dir);\n }\n file.close();\n return image_list;\n}\n\ninline std::string read_text_from_file(const std::string &filename) {\n std::ifstream file(filename);\n if (!file.is_open()) {\n std::cerr << \"Can't open text file \" << filename;\n return std::string();\n }\n\n std::stringstream result;\n std::string tmp;\n while (std::getline(file, tmp)) result << tmp << std::endl;\n file.close();\n return result.str();\n}\n\n} \/\/ namespace Util\n\n#if defined(__linux)\n#include <linux\/limits.h>\n#include <unistd.h>\n#else\n#define NOMINMAX\n#include <windows.h>\n#endif\n\n#include <sys\/stat.h>\nclass Path {\n public:\n enum PathType {\n kPosix = 0,\n kWindows = 1,\n#if defined(__linux)\n KNative = kPosix\n#else\n KNative = kWindows\n#endif\n };\n\n Path() : type_(KNative), absolute_(false) {}\n Path(const Path &path)\n : type_(path.type_), path_(path.path_), absolute_(path.absolute_) {}\n explicit Path(const char *str) { set(str); }\n explicit Path(const std::string &str) { set(str); }\n\n bool is_empty() const { return path_.empty(); }\n\n bool is_exist() const {\n#if defined(__linux)\n struct stat sb;\n return stat(str().c_str(), &sb) == 0;\n#else\n return GetFileAttributesW(wstr().c_str()) != INVALID_FILE_ATTRIBUTES;\n#endif\n }\n\n bool is_directory() const {\n#if defined(__linux)\n struct stat sb;\n if (stat(str().c_str(), &sb)) return false;\n return S_ISDIR(sb.st_mode);\n#else\n DWORD attr = GetFileAttributesW(wstr().c_str());\n return attr != INVALID_FILE_ATTRIBUTES &&\n (attr & FILE_ATTRIBUTE_DIRECTORY) != 0;\n#endif\n }\n\n bool is_file() const {\n#if defined(__linux)\n struct stat sb;\n if (stat(str().c_str(), &sb)) return false;\n return S_ISREG(sb.st_mode);\n#else\n DWORD attr = GetFileAttributesW(wstr().c_str());\n return attr != INVALID_FILE_ATTRIBUTES &&\n (attr & FILE_ATTRIBUTE_DIRECTORY) == 0;\n#endif\n }\n\n bool is_absolute() const { return absolute_; }\n\n Path make_absolute() const {\n#if defined(__linux)\n char temp[PATH_MAX];\n if (realpath(str().c_str(), temp) == NULL) {\n throw std::runtime_error(\"Error in make_absolute(): \" +\n std::string(strerror(errno)));\n }\n return Path(temp);\n#else\n std::wstring value = wstr(), out(MAX_PATH, '\\0');\n DWORD length = GetFullPathNameW(value.c_str(), MAX_PATH, &out[0], NULL);\n if (length == 0) {\n throw std::runtime_error(\"Error in make_absolute(): \" +\n std::to_string(GetLastError()));\n }\n std::wstring temp = out.substr(0, length);\n return Path(std::string(temp.begin(), temp.end()));\n#endif\n }\n\n std::string file_name() const {\n if (path_.empty() || !is_file()) return \"\";\n return path_[path_.size() - 1];\n }\n\n std::string folder_name() const {\n if (path_.empty() || !is_directory()) return \"\";\n return path_[path_.size() - 1];\n }\n\n std::string name() const {\n std::string name = file_name();\n size_t pos = name.find_last_of(\".\");\n if (pos == std::string::npos) return \"\";\n return name.substr(0, pos);\n }\n\n std::string extension() const {\n std::string name = file_name();\n size_t pos = name.find_last_of(\".\");\n if (pos == std::string::npos) return \"\";\n return name.substr(pos + 1);\n }\n\n size_t length() const { return path_.size(); }\n\n size_t file_size() const {\n#if defined(__linux)\n struct stat sb;\n if (stat(str().c_str(), &sb) != 0) {\n throw std::runtime_error(\"Error in file_size(): \" + str());\n }\n#else\n struct _stati64 sb;\n if (_wstati64(wstr().c_str(), &sb) != 0) {\n throw std::runtime_error(\"Error in file_size(): \" + str());\n }\n#endif\n return (size_t)sb.st_size;\n }\n\n Path parent_path() const {\n Path result;\n result.absolute_ = absolute_;\n if (path_.empty()) {\n if (!absolute_) result.path_.push_back(\"..\");\n } else {\n for (size_t i = 0; i < path_.size() - 1; ++i) {\n result.path_.push_back(path_[i]);\n }\n }\n return result;\n }\n\n std::string str(PathType type = KNative) const {\n std::stringstream oss;\n if (type_ == kPosix && absolute_) oss << \"\/\";\n for (size_t i = 0; i < path_.size(); ++i) {\n oss << path_[i];\n if (i + 1 < path_.size()) {\n if (type == kPosix) {\n oss << '\/';\n } else {\n oss << '\\\\';\n }\n }\n }\n return oss.str();\n }\n\n std::wstring wstr(PathType type = KNative) const {\n std::string temp = str(type);\n return std::wstring(temp.begin(), temp.end());\n }\n\n void set(const std::string &str, PathType type = KNative) {\n type_ = type;\n if (type == kWindows) {\n path_ = Util::tokenize(str, \"\/\\\\\");\n absolute_ = str.size() >= 2 && std::isalpha(str[0]) && str[1] == ':';\n } else {\n path_ = Util::tokenize(str, \"\/\");\n absolute_ = !str.empty() && str[0] == '\/';\n }\n }\n\n bool remove_file() {\n#if defined(__linux)\n return std::remove(str().c_str()) == 0;\n#else\n return DeleteFileW(wstr().c_str()) != 0;\n#endif\n }\n\n bool resize_file(size_t target_length) {\n#if defined(__linux)\n return ::truncate(str().c_str(), (off_t)target_length) == 0;\n#else\n HANDLE handle = CreateFileW(wstr().c_str(), GENERIC_WRITE, 0, nullptr, 0,\n FILE_ATTRIBUTE_NORMAL, nullptr);\n if (handle == INVALID_HANDLE_VALUE) return false;\n LARGE_INTEGER size;\n size.QuadPart = (LONGLONG)target_length;\n if (SetFilePointerEx(handle, size, NULL, FILE_BEGIN) == 0) {\n CloseHandle(handle);\n return false;\n }\n if (SetEndOfFile(handle) == 0) {\n CloseHandle(handle);\n return false;\n }\n CloseHandle(handle);\n return true;\n#endif\n }\n\n static Path cwd() {\n#if defined(__linux)\n char temp[PATH_MAX];\n if (::getcwd(temp, PATH_MAX) == NULL) {\n throw std::runtime_error(\"Error in cwd(): \" +\n std::string(strerror(errno)));\n }\n return Path(temp);\n#else\n std::wstring temp(MAX_PATH, '\\0');\n if (!_wgetcwd(&temp[0], MAX_PATH)) {\n throw std::runtime_error(\"Error in cwd(): \" +\n std::to_string(GetLastError()));\n }\n return Path(std::string(temp.begin(), temp.end()));\n#endif\n }\n\n Path operator\/(const Path &other) const {\n if (other.absolute_) {\n throw std::runtime_error(\"Error in operator\/: expected a relative path!\");\n }\n if (type_ != other.type_) {\n throw std::runtime_error(\n \"Error in operator\/: expected a path of the same type!\");\n }\n Path result(*this);\n for (const auto &path : other.path_) {\n result.path_.push_back(path);\n }\n return result;\n }\n Path operator+(const Path &other) const {\n if (other.absolute_) {\n throw std::runtime_error(\"Error in operator\/: expected a relative path!\");\n }\n if (type_ != other.type_) {\n throw std::runtime_error(\n \"Error in operator\/: expected a path of the same type!\");\n }\n Path result(*this);\n for (const auto &path : other.path_) {\n result.path_.push_back(path);\n }\n return result;\n }\n\n Path &operator=(const Path &path) {\n type_ = path.type_;\n path_ = path.path_;\n absolute_ = path.absolute_;\n return *this;\n }\n\n bool operator==(const Path &p) const { return p.path_ == path_; }\n bool operator!=(const Path &p) const { return p.path_ != path_; }\n\n friend std::ostream &operator<<(std::ostream &os, const Path &path) {\n os << path.str();\n return os;\n }\n\n private:\n PathType type_;\n std::vector<std::string> path_;\n bool absolute_;\n};\n\nnamespace Util {\n\ninline bool make_directory(const Path &path) {\n#if defined(__linux)\n return mkdir(path.str().c_str(), S_IRUSR | S_IWUSR | S_IXUSR) == 0;\n#else\n return CreateDirectoryW(path.wstr().c_str(), NULL) != 0;\n#endif\n}\n\n} \/\/ namespace Util\n\n#if defined(__linux)\n#include <ctime>\nclass Timer {\n public:\n Timer() : ts(clock()) {}\n\n void start() { ts = clock(); }\n double get_second() {\n return static_cast<double>(clock() - ts) \/ CLOCKS_PER_SEC;\n }\n double get_millisecond() {\n return 1000.0 * static_cast<double>(clock() - ts) \/ CLOCKS_PER_SEC;\n }\n\n private:\n clock_t ts;\n};\n\n#else\nclass Timer {\n public:\n Timer() { QueryPerformanceFrequency(&tfrequency_); }\n\n void start() { QueryPerformanceCounter(&tstart_); }\n double get_second() {\n QueryPerformanceCounter(&tend_);\n return static_cast<double>(tend_.QuadPart - tstart_.QuadPart) \/\n tfrequency_.QuadPart;\n }\n double get_millisecond() {\n QueryPerformanceCounter(&tend_);\n return 1000.0 * static_cast<double>(tend_.QuadPart - tstart_.QuadPart) \/\n tfrequency_.QuadPart;\n }\n\n private:\n LARGE_INTEGER tstart_, tend_, tfrequency_;\n};\n#endif\n\nclass Process {\n public:\n Process(int slice, int total) {\n period_ = static_cast<float>(total) \/ slice;\n percent_ = 0;\n }\n\n void update(int current, std::ostream *os) {\n if (current \/ period_ >= percent_) {\n *os << \".\" << std::flush;\n percent_++;\n }\n }\n\n private:\n float period_;\n int percent_;\n};\n\n#endif \/\/ SHADOW_UTIL_UTIL_HPP\n<|endoftext|>"} {"text":"<commit_before>\/\/ Copyright 2010 Alessio Sclocco <a.sclocco@vu.nl>\n\/\/\n\/\/ Licensed under the Apache License, Version 2.0 (the \"License\");\n\/\/ you may not use this file except in compliance with the License.\n\/\/ You may obtain a copy of the License at\n\/\/\n\/\/ http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n\/\/\n\/\/ Unless required by applicable law or agreed to in writing, software\n\/\/ distributed under the License is distributed on an \"AS IS\" BASIS,\n\/\/ WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n\/\/ See the License for the specific language governing permissions and\n\/\/ limitations under the License.\n\n#include <string>\n#include <sstream>\n#include <list>\n#include <typeinfo>\n\n#include <utils.hpp>\n\n\n#ifndef ARGUMENT_LIST_HPP\n#define ARGUMENT_LIST_HPP\n\nnamespace isa {\nnamespace utils {\n\n\/\/ Exception: no items in the command line\nclass EmptyCommandLine : public std::exception {};\n\/\/ Exception: requested switch not present\nclass SwitchNotFound : public std::exception {\npublic:\n SwitchNotFound(std::string option);\n ~SwitchNotFound() throw ();\n\n const char *what() const throw ();\n\nprivate:\n std::string option;\n};\n\n\n\/\/ ArgumentList class\nclass ArgumentList {\npublic:\n\tArgumentList(int argc, char * argv[]);\n\t~ArgumentList();\n\n std::string getName();\n\ttemplate< typename T > T getFirst() throw(EmptyCommandLine);\n\tbool getSwitch(const std::string opt) throw(EmptyCommandLine);\n\ttemplate< typename T > T getSwitchArgument(const std::string & option) throw(EmptyCommandLine, SwitchNotFound);\n\nprivate:\n std::list< std::string > args;\n std::string name;\n};\n\n\n\/\/ Implementations\n\nSwitchNotFound::SwitchNotFound(std::string option) : option(option) {}\n\nconst char * SwitchNotFound::what() throw() {\n return (\"Switch \\\"\" + option + \"\\\" not found.\").c_str();\n}\n\nArgumentList::ArgumentList(int argc, char * argv[]) {\n name = std::string(argv[0]);\n\n for ( unsigned int i = 1; i < argc; i++ ) {\n args.push_back(std::string(argv[1]));\n }\n}\n\nstd::string ArgumentList::getName() {\n\treturn name;\n}\n\ntemplate< typename T > T ArgumentList::getFirst() throw(EmptyCommandLine) {\n\tif ( args.empty() ) {\n\t\tthrow EmptyCommandLine();\n\t}\n\n std::string temp = args.front();\n\targs.pop_front();\n\treturn castToType< std::string, T >(temp);\n}\n\n\nbool ArgumentList::getSwitch(const std::string opt) throw(EmptyCommandLine) {\n\tif ( args.empty() ) {\n\t\treturn false;\n\t}\n\n\tfor ( std::list< std::string >::iterator s = args.begin(); s != args.end(); ++s ) {\n\t\tif ( opt.compare(*s) == 0 ) {\n\t\t\targs.erase(s);\n\t\t\treturn true;\n\t\t}\n\t}\n\n\treturn false;\n}\n\n\ntemplate< class T > T ArgumentList::getSwitchArgument(const std::string opt) throw(EmptyCommandLine, SwitchNotFound) {\n\tif ( args.empty() ) {\n\t\tthrow EmptyCommandLine();\n\t}\n\n\tfor ( std::list< std::string >::iterator s = args.begin(); s != args.end(); ++s ) {\n\t\tif ( opt.compare(*s) == 0 ) {\n std::string temp = *(++s);\n\t\t\tT retVal = castToType< std::string, T >(temp);\n\n\t\t\targs.erase(s);\n\t\t\targs.erase(--s);\n\t\t\treturn retVal;\n\t\t}\n\t}\n\n\tthrow SwitchNotFound(opt);\n}\n\n} \/\/ utils\n} \/\/ isa\n\n#endif \/\/ ARGUMENT_LIST_HPP\n\n<commit_msg>Fixing more typos and mistakes.<commit_after>\/\/ Copyright 2010 Alessio Sclocco <a.sclocco@vu.nl>\n\/\/\n\/\/ Licensed under the Apache License, Version 2.0 (the \"License\");\n\/\/ you may not use this file except in compliance with the License.\n\/\/ You may obtain a copy of the License at\n\/\/\n\/\/ http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n\/\/\n\/\/ Unless required by applicable law or agreed to in writing, software\n\/\/ distributed under the License is distributed on an \"AS IS\" BASIS,\n\/\/ WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n\/\/ See the License for the specific language governing permissions and\n\/\/ limitations under the License.\n\n#include <string>\n#include <sstream>\n#include <list>\n#include <typeinfo>\n\n#include <utils.hpp>\n\n\n#ifndef ARGUMENT_LIST_HPP\n#define ARGUMENT_LIST_HPP\n\nnamespace isa {\nnamespace utils {\n\n\/\/ Exception: no items in the command line\nclass EmptyCommandLine : public std::exception {};\n\/\/ Exception: requested switch not present\nclass SwitchNotFound : public std::exception {\npublic:\n SwitchNotFound(std::string option);\n ~SwitchNotFound() throw ();\n\n const char *what() const throw ();\n\nprivate:\n std::string option;\n};\n\n\n\/\/ ArgumentList class\nclass ArgumentList {\npublic:\n\tArgumentList(int argc, char * argv[]);\n\t~ArgumentList();\n\n std::string getName();\n\ttemplate< typename T > T getFirst() throw(EmptyCommandLine);\n\tbool getSwitch(const std::string & option) throw(EmptyCommandLine);\n\ttemplate< typename T > T getSwitchArgument(const std::string & option) throw(EmptyCommandLine, SwitchNotFound);\n\nprivate:\n std::list< std::string > args;\n std::string name;\n};\n\n\n\/\/ Implementations\n\nSwitchNotFound::SwitchNotFound(std::string option) : option(option) {}\n\nconst char * SwitchNotFound::what() throw() {\n return (\"Switch \\\"\" + option + \"\\\" not found.\").c_str();\n}\n\nArgumentList::ArgumentList(int argc, char * argv[]) {\n name = std::string(argv[0]);\n\n for ( unsigned int i = 1; i < argc; i++ ) {\n args.push_back(std::string(argv[1]));\n }\n}\n\nstd::string ArgumentList::getName() {\n\treturn name;\n}\n\ntemplate< typename T > T ArgumentList::getFirst() throw(EmptyCommandLine) {\n\tif ( args.empty() ) {\n\t\tthrow EmptyCommandLine();\n\t}\n\n std::string temp = args.front();\n\targs.pop_front();\n\treturn castToType< std::string, T >(temp);\n}\n\n\nbool ArgumentList::getSwitch(const std::string & option) throw(EmptyCommandLine) {\n\tif ( args.empty() ) {\n\t\treturn false;\n\t}\n\n\tfor ( std::list< std::string >::iterator s = args.begin(); s != args.end(); ++s ) {\n\t\tif ( option.compare(*s) == 0 ) {\n\t\t\targs.erase(s);\n\t\t\treturn true;\n\t\t}\n\t}\n\n\treturn false;\n}\n\n\ntemplate< class T > T ArgumentList::getSwitchArgument(const std::string & option) throw(EmptyCommandLine, SwitchNotFound) {\n\tif ( args.empty() ) {\n\t\tthrow EmptyCommandLine();\n\t}\n\n\tfor ( std::list< std::string >::iterator s = args.begin(); s != args.end(); ++s ) {\n\t\tif ( option.compare(*s) == 0 ) {\n std::string temp = *(++s);\n\t\t\tT retVal = castToType< std::string, T >(temp);\n\n\t\t\targs.erase(s);\n\t\t\targs.erase(--s);\n\t\t\treturn retVal;\n\t\t}\n\t}\n\n\tthrow SwitchNotFound(option);\n}\n\n} \/\/ utils\n} \/\/ isa\n\n#endif \/\/ ARGUMENT_LIST_HPP\n\n<|endoftext|>"} {"text":"<commit_before>\n#include <sys\/types.h>\n#include <sys\/stat.h>\n#include <fcntl.h>\n#include <unistd.h>\n#include <libelf.h>\n#include <gelf.h>\n#include <sys\/mman.h>\n#include <stdio.h>\n#include \"sandbox.h\"\n\n#ifndef EM_MOXIE\n#define EM_MOXIE 0xFEED \/* Moxie *\/\n#endif \/\/ EM_MOXIE\n\nbool loadElfProgram(machine& mach, const char *filename)\n{\n\tif ( elf_version ( EV_CURRENT ) == EV_NONE )\n\t\treturn false;\n\n\tint fd;\n\tif (( fd = open ( filename, O_RDONLY , 0)) < 0)\n\t\treturn false;\n\n\tstruct stat st;\n\tif (fstat(fd, &st) < 0)\n\t\tgoto err_out;\n\n\tvoid *p;\n\tp = mmap(NULL, st.st_size, PROT_READ, MAP_PRIVATE, fd, 0);\n\tif (p == (void *)-1)\n\t\tgoto err_out;\n\n\tElf *e;\n\tif (( e = elf_memory((char *)p, st.st_size)) == NULL )\n\t\tgoto err_out_map;\n\n\tif ( elf_kind ( e ) != ELF_K_ELF )\n\t\tgoto err_out_elf;\n\n\tGElf_Ehdr ehdr;\n\tif (gelf_getehdr(e, &ehdr) != &ehdr)\n\t\tgoto err_out_elf;\n\n\tif ((ehdr.e_ident[EI_CLASS] != ELFCLASS32) ||\n\t (ehdr.e_ident[EI_DATA] != ELFDATA2LSB) ||\n\t (ehdr.e_machine != EM_MOXIE)) {\n\t\tfprintf(stderr, \"unsupported ELF binary type\\n\");\n\t\tgoto err_out_elf;\n\t}\n\n\tmach.startAddr = ehdr.e_entry;\n\tfprintf(stdout, \"ep %08lx\\n\", ehdr.e_entry);\n\n\tsize_t n;\n\tif ( elf_getphdrnum (e , & n ) != 0)\n\t\tgoto err_out_elf;\n\n\tunsigned int i;\n\tGElf_Phdr phdr;\n\tfor (i = 0; i < n; i++) {\n\t\tif ( gelf_getphdr (e, i, &phdr) != &phdr )\n\t\t\tgoto err_out_elf;\n\n\t\tif (phdr.p_type != PT_LOAD) {\n\t\t\tfprintf(stderr, \"ignoring unknown p_type %lu\\n\",\n\t\t\t\t(unsigned long) phdr.p_type);\n\t\t\tcontinue;\n\t\t}\n\n\t\tsize_t sz = phdr.p_memsz;\n\t\troDataRange *rdr = new roDataRange(sz);\n\t\trdr->start = phdr.p_vaddr;\n\t\trdr->length = sz;\n\t\trdr->end = rdr->start + rdr->length;\n\n\t\tchar *cp = (char *) p;\n\t\trdr->buf.assign(cp + phdr.p_offset, phdr.p_filesz);\n\t\trdr->buf.resize(phdr.p_memsz);\n\n\t\tmach.memmap.push_back(rdr);\n\t}\n\n\telf_end(e);\n\tmunmap(p, st.st_size);\n\tclose(fd);\n\treturn true;\n\nerr_out_elf:\n\telf_end(e);\nerr_out_map:\n\tmunmap(p, st.st_size);\nerr_out:\n\tclose(fd);\n\treturn false;\n}\n\n<commit_msg>elf code movement<commit_after>\n#include <sys\/types.h>\n#include <sys\/stat.h>\n#include <fcntl.h>\n#include <unistd.h>\n#include <libelf.h>\n#include <gelf.h>\n#include <sys\/mman.h>\n#include <stdio.h>\n#include \"sandbox.h\"\n\n#ifndef EM_MOXIE\n#define EM_MOXIE 0xFEED \/* Moxie *\/\n#endif \/\/ EM_MOXIE\n\nbool loadElfProgSection(machine& mach, Elf *e, GElf_Phdr *phdr, void *p)\n{\n\tsize_t sz = phdr->p_memsz;\n\troDataRange *rdr = new roDataRange(sz);\n\trdr->start = phdr->p_vaddr;\n\trdr->length = sz;\n\trdr->end = rdr->start + rdr->length;\n\n\tchar *cp = (char *) p;\n\trdr->buf.assign(cp + phdr->p_offset, phdr->p_filesz);\n\trdr->buf.resize(phdr->p_memsz);\n\n\tmach.memmap.push_back(rdr);\n\n\treturn true;\n}\n\nbool loadElfProgram(machine& mach, const char *filename)\n{\n\tif ( elf_version ( EV_CURRENT ) == EV_NONE )\n\t\treturn false;\n\n\tint fd;\n\tif (( fd = open ( filename, O_RDONLY , 0)) < 0)\n\t\treturn false;\n\n\tstruct stat st;\n\tif (fstat(fd, &st) < 0)\n\t\tgoto err_out;\n\n\tvoid *p;\n\tp = mmap(NULL, st.st_size, PROT_READ, MAP_PRIVATE, fd, 0);\n\tif (p == (void *)-1)\n\t\tgoto err_out;\n\n\tElf *e;\n\tif (( e = elf_memory((char *)p, st.st_size)) == NULL )\n\t\tgoto err_out_map;\n\n\tif ( elf_kind ( e ) != ELF_K_ELF )\n\t\tgoto err_out_elf;\n\n\tGElf_Ehdr ehdr;\n\tif (gelf_getehdr(e, &ehdr) != &ehdr)\n\t\tgoto err_out_elf;\n\n\tif ((ehdr.e_ident[EI_CLASS] != ELFCLASS32) ||\n\t (ehdr.e_ident[EI_DATA] != ELFDATA2LSB) ||\n\t (ehdr.e_machine != EM_MOXIE)) {\n\t\tfprintf(stderr, \"unsupported ELF binary type\\n\");\n\t\tgoto err_out_elf;\n\t}\n\n\tmach.startAddr = ehdr.e_entry;\n\tfprintf(stdout, \"ep %08lx\\n\", ehdr.e_entry);\n\n\tsize_t n;\n\tif ( elf_getphdrnum (e , & n ) != 0)\n\t\tgoto err_out_elf;\n\n\tunsigned int i;\n\tGElf_Phdr phdr;\n\tfor (i = 0; i < n; i++) {\n\t\tif ( gelf_getphdr (e, i, &phdr) != &phdr )\n\t\t\tgoto err_out_elf;\n\n\t\tif (phdr.p_type != PT_LOAD) {\n\t\t\tfprintf(stderr, \"ignoring unknown p_type %lu\\n\",\n\t\t\t\t(unsigned long) phdr.p_type);\n\t\t\tcontinue;\n\t\t}\n\n\t\tif (!loadElfProgSection(mach, e, &phdr, p))\n\t\t\tgoto err_out_elf;\n\t}\n\n\telf_end(e);\n\tmunmap(p, st.st_size);\n\tclose(fd);\n\treturn true;\n\nerr_out_elf:\n\telf_end(e);\nerr_out_map:\n\tmunmap(p, st.st_size);\nerr_out:\n\tclose(fd);\n\treturn false;\n}\n\n<|endoftext|>"} {"text":"<commit_before>#include \"vdb_activate_from_points.h\"\n\n#include <limits.h>\n#include <SYS\/SYS_Math.h>\n\n#include <UT\/UT_DSOVersion.h>\n#include <UT\/UT_Interrupt.h>\n\n#include <OP\/OP_Operator.h>\n#include <OP\/OP_OperatorTable.h>\n\n#include <GU\/GU_Detail.h>\n#include <GEO\/GEO_PrimPoly.h>\n\n#include <PRM\/PRM_Include.h>\n#include <CH\/CH_LocalVariable.h>\n\n#include <OP\/OP_AutoLockInputs.h>\n\n#include <GU\/GU_PrimVDB.h>\n\n#include <openvdb\/openvdb.h>\n\n\nusing namespace VdbActivateFromPoints;\n\n\/\/ register the operator\nvoid newSopOperator(OP_OperatorTable *table)\n{\n\ttable->addOperator(new OP_Operator(\n\t\t\"vdbActivateFromPoints\",\n\t\t\"VDB Activate from Points\",\n\t\tSOP_VdbActivateFromPoints::myConstructor,\n\t\tSOP_VdbActivateFromPoints::myTemplateList,\n\t\t2,\n\t\t2));\n}\n\n\/\/ label node inputs\nconst char *\nSOP_VdbActivateFromPoints::inputLabel(unsigned idx) const\n{\n switch (idx){\n case 0: return \"VDB\";\n case 1: return \"Points where active voxels should be\";\n default: return \"default\";\n }\n}\n\n\/\/ set empty parameter interface\nPRM_Template SOP_VdbActivateFromPoints::myTemplateList[] = \n{\n PRM_Template()\n};\n\nOP_Node * SOP_VdbActivateFromPoints::myConstructor(OP_Network *net, const char *name, OP_Operator *op)\n{\n return new SOP_VdbActivateFromPoints(net, name, op);\n}\n\nSOP_VdbActivateFromPoints::SOP_VdbActivateFromPoints(OP_Network *net, const char *name, OP_Operator *op)\n : SOP_Node(net, name, op)\n{\n \/\/mySopFlags.setManagesDataIDs(true);\n}\n\nSOP_VdbActivateFromPoints::~SOP_VdbActivateFromPoints() {}\n\nOP_ERROR\nSOP_VdbActivateFromPoints::cookMySop(OP_Context &context)\n{\n \/\/ lock inputs\n OP_AutoLockInputs inputs(this);\n if (inputs.lock(context) >= UT_ERROR_ABORT)\n return error();\n\n \/\/ clear gdp and duplicate src\n gdp->clearAndDestroy();\n duplicateSource(0, context);\n\n \/\/ get pointer to points from second input\n const GU_Detail *points = inputGeo(1);\n\n std::cout << \"number of active points: \" << points->getNumPoints() << std::endl;\n\n \/\/ check for escape\n UT_AutoInterrupt progress(\"Activating voxels\");\n if (progress.wasInterrupted())\n return error();\n\n \/\/ get pointer to GU_PrimVDB primitive\n GU_PrimVDB *vdbPrim = reinterpret_cast<GU_PrimVDB *> (gdp->getGEOPrimitiveByIndex(0));\n\n \/\/ terminate if volume is not VDB\n if(!vdbPrim)\n {\n addError(SOP_MESSAGE, \"First input must contain a VDB\");\n return error();\n }\n\n \/\/ make a deep copy\n vdbPrim->makeGridUnique();\n \n \/\/ get grid base pointer and cast to float grid pointer\n openvdb::GridBase::Ptr vdbPtrBase = vdbPrim->getGridPtr();\n openvdb::FloatGrid::Ptr vdbPtr = openvdb::gridPtrCast<openvdb::FloatGrid>(vdbPtrBase);\n\n \/\/ get accessor to the float grid\n openvdb::FloatGrid::Accessor vdb_acess = vdbPtr->getAccessor();\n\n \/\/ get transformation of the grid\n const openvdb::math::Transform &vdbGridXform = vdbPtr->transform();\n\n \/\/ loop over all the points and activate voxels at points' positions\n for (int i=0; i < points->getNumPoints(); i++) \n {\n \/\/ get current point position\n UT_Vector3 p = points->getPos3(i);\n std::cout << i << \". point world space position: \" << p << std::endl;\n\n \/\/ create openvdb vector with values from houdini's vector, transform it from world space to vdb's index space (based on vdb's transformation)\n openvdb::Vec3R p_( p[0], p[1], p[2] );\n openvdb::Coord p_xformed( vdbGridXform.worldToIndexCellCentered(p_) );\n std::cout << \" volmue index space position: \" << p_xformed << std::endl;\n vdb_acess.setValueOn( p_xformed );\n }\n\n return error();\n}<commit_msg>fixed vdb checking and added ability to terminate the loop by ESC press<commit_after>#include \"vdb_activate_from_points.h\"\n\n#include <limits.h>\n#include <SYS\/SYS_Math.h>\n\n#include <UT\/UT_DSOVersion.h>\n#include <UT\/UT_Interrupt.h>\n\n#include <OP\/OP_Operator.h>\n#include <OP\/OP_OperatorTable.h>\n\n#include <GU\/GU_Detail.h>\n#include <GEO\/GEO_PrimPoly.h>\n\n#include <PRM\/PRM_Include.h>\n#include <CH\/CH_LocalVariable.h>\n\n#include <OP\/OP_AutoLockInputs.h>\n\n#include <GU\/GU_PrimVDB.h>\n\n#include <openvdb\/openvdb.h>\n\n\nusing namespace VdbActivateFromPoints;\n\n\/\/ register the operator\nvoid newSopOperator(OP_OperatorTable *table)\n{\n\ttable->addOperator(new OP_Operator(\n\t\t\"vdbActivateFromPoints\",\n\t\t\"VDB Activate from Points\",\n\t\tSOP_VdbActivateFromPoints::myConstructor,\n\t\tSOP_VdbActivateFromPoints::myTemplateList,\n\t\t2,\n\t\t2));\n}\n\n\/\/ label node inputs\nconst char *\nSOP_VdbActivateFromPoints::inputLabel(unsigned idx) const\n{\n switch (idx){\n case 0: return \"VDB\";\n case 1: return \"Points where active voxels should be\";\n default: return \"default\";\n }\n}\n\n\/\/ set empty parameter interface\nPRM_Template SOP_VdbActivateFromPoints::myTemplateList[] = \n{\n PRM_Template()\n};\n\nOP_Node * SOP_VdbActivateFromPoints::myConstructor(OP_Network *net, const char *name, OP_Operator *op)\n{\n return new SOP_VdbActivateFromPoints(net, name, op);\n}\n\nSOP_VdbActivateFromPoints::SOP_VdbActivateFromPoints(OP_Network *net, const char *name, OP_Operator *op)\n : SOP_Node(net, name, op)\n{\n \/\/mySopFlags.setManagesDataIDs(true);\n}\n\nSOP_VdbActivateFromPoints::~SOP_VdbActivateFromPoints() {}\n\nOP_ERROR\nSOP_VdbActivateFromPoints::cookMySop(OP_Context &context)\n{\n \/\/ lock inputs\n OP_AutoLockInputs inputs(this);\n if (inputs.lock(context) >= UT_ERROR_ABORT)\n return error();\n\n \/\/ clear gdp and duplicate src\n gdp->clearAndDestroy();\n duplicateSource(0, context);\n\n \/\/ get pointer to points from second input\n const GU_Detail *points = inputGeo(1);\n\n std::cout << \"number of active points: \" << points->getNumPoints() << std::endl;\n\n \/\/ get pointer to GU_PrimVDB primitive\n GU_PrimVDB *vdbPrim = dynamic_cast<GU_PrimVDB *>(gdp->getGEOPrimitiveByIndex(0));\n\n \/\/ terminate if volume is not VDB\n if(!vdbPrim)\n {\n addError(SOP_MESSAGE, \"First input must contain a VDB!\");\n return error();\n }\n\n \/\/ make a deep copy\n vdbPrim->makeGridUnique();\n \n \/\/ get grid base pointer and cast to float grid pointer\n openvdb::GridBase::Ptr vdbPtrBase = vdbPrim->getGridPtr();\n openvdb::FloatGrid::Ptr vdbPtr = openvdb::gridPtrCast<openvdb::FloatGrid>(vdbPtrBase);\n\n \/\/ get accessor to the float grid\n openvdb::FloatGrid::Accessor vdb_acess = vdbPtr->getAccessor();\n\n \/\/ get transformation of the grid\n const openvdb::math::Transform &vdbGridXform = vdbPtr->transform();\n\n \/\/ loop over all the points and activate voxels at points' positions\n for (int i=0; i < points->getNumPoints(); i++) \n {\n \/\/ check for escape\n UT_AutoInterrupt progress(\"Activating voxels...\");\n if (progress.wasInterrupted())\n return error();\n\n \/\/ get current point position\n UT_Vector3 p = points->getPos3(i);\n std::cout << i << \". point world space position: \" << p << std::endl;\n\n \/\/ create openvdb vector with values from houdini's vector, transform it from world space to vdb's index space (based on vdb's transformation)\n openvdb::Vec3R p_( p[0], p[1], p[2] );\n openvdb::Coord p_xformed( vdbGridXform.worldToIndexCellCentered(p_) );\n std::cout << \" volmue index space position: \" << p_xformed << std::endl;\n vdb_acess.setValueOn( p_xformed );\n }\n\n return error();\n}<|endoftext|>"} {"text":"<commit_before>#ifndef SRC_PORTS_STREAM_SOURCES_STREAM_STATE_HPP_\n#define SRC_PORTS_STREAM_SOURCES_STREAM_STATE_HPP_\n\n\/\/ std\n#include <memory>\n\nnamespace fc\n{\n\n\/**\n * Simple StreamSource implementation that holds a stream_state.\n * Can be connected to any number of SinkConnections.\n * Is a SourceConnection.\n *\/\ntemplate<class data_t>\nclass stream_state\n{\npublic:\n\tstream_state(data_t d_) : d(new data_t(d_)){}\n\n\t\/\/\/ pull data\n\tdata_t operator()() { return *d; }\n\n\t\/\/\/ set current value\n\tvoid set(data_t d_) { *d = d_; }\n\nprivate:\n\tstd::shared_ptr<data_t> d;\n};\n\n} \/\/ namespace fc\n\n#endif \/* SRC_PORTS_STREAM_SOURCES_STREAM_STATE_HPP_ *\/\n<commit_msg>Use of make_shared (see review)<commit_after>#ifndef SRC_PORTS_STREAM_SOURCES_STREAM_STATE_HPP_\n#define SRC_PORTS_STREAM_SOURCES_STREAM_STATE_HPP_\n\n\/\/ std\n#include <memory>\n\nnamespace fc\n{\n\n\/**\n * Simple StreamSource implementation that holds a stream_state.\n * Can be connected to any number of SinkConnections.\n * Is a SourceConnection.\n *\/\ntemplate<class data_t>\nclass stream_state\n{\npublic:\n\tstream_state(data_t d_) : d(std::make_shared<data_t>(d_)){}\n\n\t\/\/\/ pull data\n\tdata_t operator()() { return *d; }\n\n\t\/\/\/ set current value\n\tvoid set(data_t d_) { *d = d_; }\n\nprivate:\n\tstd::shared_ptr<data_t> d;\n};\n\n} \/\/ namespace fc\n\n#endif \/* SRC_PORTS_STREAM_SOURCES_STREAM_STATE_HPP_ *\/\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 \"process.h\"\n#include \"process_exception.h\"\n\n#include \"config.h\"\n#include \"datum.h\"\n#include \"edge.h\"\n#include \"stamp.h\"\n#include \"types.h\"\n\n#include <boost\/algorithm\/string\/predicate.hpp>\n#include <boost\/foreach.hpp>\n\n#include <utility>\n\n\/**\n * \\file process.cxx\n *\n * \\brief Implementation of the base class for \\link vistk::process processes\\endlink.\n *\/\n\nnamespace vistk\n{\n\nprocess::port_t const process::port_heartbeat = port_t(\"heartbeat\");\nconfig::key_t const process::config_name = config::key_t(\"_name\");\nconfig::key_t const process::config_type = config::key_t(\"_type\");\nprocess::port_type_t const process::type_any = port_type_t(\"_any\");\nprocess::port_type_t const process::type_none = port_type_t(\"_none\");\nprocess::port_flag_t const process::flag_output_const = port_flag_t(\"_const\");\nprocess::port_flag_t const process::flag_input_mutable = port_flag_t(\"_mutable\");\nprocess::port_flag_t const process::flag_required = port_flag_t(\"_required\");\n\nprocess::port_info\n::port_info(port_type_t const& type,\n port_flags_t const& flags,\n port_description_t const& description)\n : type(type)\n , flags(flags)\n , description(description)\n{\n}\n\nprocess::port_info\n::~port_info()\n{\n}\n\nprocess::conf_info\n::conf_info(config::value_t const& def,\n config::description_t const& description)\n : def(def)\n , description(description)\n{\n}\n\nprocess::conf_info\n::~conf_info()\n{\n}\n\nclass process::priv\n{\n public:\n priv();\n ~priv();\n\n void run_heartbeat();\n\n name_t name;\n process_registry::type_t type;\n\n typedef std::pair<edge_t, edge_t> edge_pair_t;\n typedef std::map<port_t, edge_pair_t> edge_map_t;\n\n edges_t heartbeats;\n\n edges_t input_edges;\n edges_t output_edges;\n\n bool is_complete;\n\n stamp_t hb_stamp;\n\n static config::value_t const DEFAULT_PROCESS_NAME;\n};\n\nconfig::key_t const process::priv::DEFAULT_PROCESS_NAME = \"(unnamed)\";\n\nvoid\nprocess\n::init()\n{\n process::_init();\n}\n\nvoid\nprocess\n::step()\n{\n \/\/\/ \\todo Make reentrant.\n\n \/\/\/ \\todo Are there any pre-_step actions?\n\n if (d->is_complete)\n {\n \/\/\/ \\todo What exactly should be done here?\n }\n else\n {\n _step();\n }\n\n \/\/\/ \\todo Are there any post-_step actions?\n\n d->run_heartbeat();\n}\n\nbool\nprocess\n::is_reentrant() const\n{\n return false;\n}\n\nvoid\nprocess\n::connect_input_port(port_t const& port, edge_t edge)\n{\n if (!edge)\n {\n throw null_edge_port_connection_exception(d->name, port);\n }\n\n _connect_input_port(port, edge);\n}\n\nvoid\nprocess\n::connect_output_port(port_t const& port, edge_t edge)\n{\n if (!edge)\n {\n throw null_edge_port_connection_exception(d->name, port);\n }\n\n if (port == port_heartbeat)\n {\n d->heartbeats.push_back(edge);\n\n return;\n }\n\n _connect_output_port(port, edge);\n}\n\nprocess::ports_t\nprocess\n::input_ports() const\n{\n ports_t ports = _input_ports();\n\n return ports;\n}\n\nprocess::ports_t\nprocess\n::output_ports() const\n{\n ports_t ports = _output_ports();\n\n ports.push_back(port_heartbeat);\n\n return ports;\n}\n\nprocess::port_info_t\nprocess\n::input_port_info(port_t const& port) const\n{\n return _input_port_info(port);\n}\n\nprocess::port_info_t\nprocess\n::output_port_info(port_t const& port) const\n{\n if (port == port_heartbeat)\n {\n return port_info_t(new port_info(\n type_none,\n port_flags_t(),\n port_description_t(\"Outputs the heartbeat stamp with an empty datum\")));\n }\n\n return _output_port_info(port);\n}\n\nconfig::keys_t\nprocess\n::available_config() const\n{\n config::keys_t keys = _available_config();\n\n keys.push_back(config_name);\n keys.push_back(config_type);\n\n return keys;\n}\n\nprocess::conf_info_t\nprocess\n::config_info(config::key_t const& key) const\n{\n if (key == config_name)\n {\n return conf_info_t(new conf_info(\n boost::lexical_cast<config::value_t>(priv::DEFAULT_PROCESS_NAME),\n config::description_t(\"The name of the process\")));\n }\n if (key == config_type)\n {\n return conf_info_t(new conf_info(\n config::value_t(),\n config::description_t(\"The type of the process\")));\n }\n\n return _config_info(key);\n}\n\nprocess::name_t\nprocess\n::name() const\n{\n return d->name;\n}\n\nprocess_registry::type_t\nprocess\n::type() const\n{\n return d->type;\n}\n\nprocess\n::process(config_t const& config) throw()\n{\n d = boost::shared_ptr<priv>(new priv);\n\n d->name = config->get_value<name_t>(config_name, priv::DEFAULT_PROCESS_NAME);\n d->type = config->get_value<name_t>(config_type);\n}\n\nprocess\n::~process()\n{\n}\n\nvoid\nprocess\n::_init()\n{\n}\n\nvoid\nprocess\n::_step()\n{\n}\n\nvoid\nprocess\n::_connect_input_port(port_t const& port, edge_t \/*edge*\/)\n{\n throw no_such_port_exception(d->name, port);\n}\n\nvoid\nprocess\n::_connect_output_port(port_t const& port, edge_t \/*edge*\/)\n{\n throw no_such_port_exception(d->name, port);\n}\n\nprocess::ports_t\nprocess\n::_input_ports() const\n{\n return ports_t();\n}\n\nprocess::ports_t\nprocess\n::_output_ports() const\n{\n return ports_t();\n}\n\nprocess::port_info_t\nprocess\n::_input_port_info(port_t const& port) const\n{\n throw no_such_port_exception(d->name, port);\n}\n\nprocess::port_info_t\nprocess\n::_output_port_info(port_t const& port) const\n{\n throw no_such_port_exception(d->name, port);\n}\n\nconfig::keys_t\nprocess\n::_available_config() const\n{\n return config::keys_t();\n}\n\nprocess::conf_info_t\nprocess\n::_config_info(config::key_t const& key) const\n{\n throw unknown_configuration_value_exception(d->name, key);\n}\n\nvoid\nprocess\n::mark_as_complete()\n{\n d->is_complete = true;\n}\n\nstamp_t\nprocess\n::heartbeat_stamp() const\n{\n return d->hb_stamp;\n}\n\nbool\nprocess\n::same_colored_edges(edges_t const& edges)\n{\n edges_t::const_iterator it = edges.begin();\n edges_t::const_iterator it_end = edges.end();\n\n for ( ; it != it_end; ++it)\n {\n edges_t::const_iterator it2 = it;\n\n stamp_t const st = (*it)->peek_datum().get<1>();\n\n for (++it2; it2 != it_end; ++it2)\n {\n if (!st->is_same_color((*it2)->peek_datum().get<1>()))\n {\n return false;\n }\n }\n }\n\n return true;\n}\n\nbool\nprocess\n::syncd_edges(edges_t const& edges)\n{\n edges_t::const_iterator it = edges.begin();\n edges_t::const_iterator it_end = edges.end();\n\n for ( ; it != it_end; ++it)\n {\n edges_t::const_iterator it2 = it;\n\n stamp_t const st = (*it)->peek_datum().get<1>();\n\n for (++it2; it2 != it_end; ++it2)\n {\n stamp_t const st2 = (*it2)->peek_datum().get<1>();\n\n if (*st != *st2)\n {\n return false;\n }\n }\n }\n\n return true;\n}\n\ndatum::datum_type_t\nprocess\n::max_status(edge_data_t const& data)\n{\n datum::datum_type_t max_type = datum::DATUM_INVALID;\n\n BOOST_FOREACH (edge_datum_t const& dat, data)\n {\n datum::datum_type_t const type = dat.get<0>()->type();\n\n if (max_type < type)\n {\n max_type = type;\n }\n }\n\n return max_type;\n}\n\nvoid\nprocess\n::push_to_edges(edges_t const& edges, edge_datum_t const& dat)\n{\n BOOST_FOREACH (edge_t e, edges)\n {\n e->push_datum(dat);\n }\n}\n\nprocess::priv\n::priv()\n : is_complete(false)\n , hb_stamp(stamp::new_stamp())\n{\n}\n\nprocess::priv\n::~priv()\n{\n}\n\nvoid\nprocess::priv\n::run_heartbeat()\n{\n datum_t dat;\n\n if (is_complete)\n {\n dat = datum::complete_datum();\n }\n else\n {\n dat = datum::empty_datum();\n }\n\n edge_datum_t edge_dat(dat, hb_stamp);\n\n hb_stamp = stamp::incremented_stamp(hb_stamp);\n\n edges_t::iterator hb = heartbeats.begin();\n edges_t::iterator hb_end = heartbeats.end();\n\n for ( ; hb != hb_end; ++hb)\n {\n (*hb)->push_datum(edge_dat);\n }\n}\n\n}\n<commit_msg>Store the port an conf info once<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 \"process.h\"\n#include \"process_exception.h\"\n\n#include \"config.h\"\n#include \"datum.h\"\n#include \"edge.h\"\n#include \"stamp.h\"\n#include \"types.h\"\n\n#include <boost\/algorithm\/string\/predicate.hpp>\n#include <boost\/foreach.hpp>\n\n#include <utility>\n\n\/**\n * \\file process.cxx\n *\n * \\brief Implementation of the base class for \\link vistk::process processes\\endlink.\n *\/\n\nnamespace vistk\n{\n\nprocess::port_t const process::port_heartbeat = port_t(\"heartbeat\");\nconfig::key_t const process::config_name = config::key_t(\"_name\");\nconfig::key_t const process::config_type = config::key_t(\"_type\");\nprocess::port_type_t const process::type_any = port_type_t(\"_any\");\nprocess::port_type_t const process::type_none = port_type_t(\"_none\");\nprocess::port_flag_t const process::flag_output_const = port_flag_t(\"_const\");\nprocess::port_flag_t const process::flag_input_mutable = port_flag_t(\"_mutable\");\nprocess::port_flag_t const process::flag_required = port_flag_t(\"_required\");\n\nprocess::port_info\n::port_info(port_type_t const& type,\n port_flags_t const& flags,\n port_description_t const& description)\n : type(type)\n , flags(flags)\n , description(description)\n{\n}\n\nprocess::port_info\n::~port_info()\n{\n}\n\nprocess::conf_info\n::conf_info(config::value_t const& def,\n config::description_t const& description)\n : def(def)\n , description(description)\n{\n}\n\nprocess::conf_info\n::~conf_info()\n{\n}\n\nclass process::priv\n{\n public:\n priv();\n ~priv();\n\n void run_heartbeat();\n\n name_t name;\n process_registry::type_t type;\n\n conf_info_t name_conf_info;\n conf_info_t type_conf_info;\n\n typedef std::pair<edge_t, edge_t> edge_pair_t;\n typedef std::map<port_t, edge_pair_t> edge_map_t;\n\n edges_t heartbeats;\n\n port_info_t heartbeat_port_info;\n\n edges_t input_edges;\n edges_t output_edges;\n\n bool is_complete;\n\n stamp_t hb_stamp;\n\n static config::value_t const DEFAULT_PROCESS_NAME;\n};\n\nconfig::key_t const process::priv::DEFAULT_PROCESS_NAME = \"(unnamed)\";\n\nvoid\nprocess\n::init()\n{\n process::_init();\n}\n\nvoid\nprocess\n::step()\n{\n \/\/\/ \\todo Make reentrant.\n\n \/\/\/ \\todo Are there any pre-_step actions?\n\n if (d->is_complete)\n {\n \/\/\/ \\todo What exactly should be done here?\n }\n else\n {\n _step();\n }\n\n \/\/\/ \\todo Are there any post-_step actions?\n\n d->run_heartbeat();\n}\n\nbool\nprocess\n::is_reentrant() const\n{\n return false;\n}\n\nvoid\nprocess\n::connect_input_port(port_t const& port, edge_t edge)\n{\n if (!edge)\n {\n throw null_edge_port_connection_exception(d->name, port);\n }\n\n _connect_input_port(port, edge);\n}\n\nvoid\nprocess\n::connect_output_port(port_t const& port, edge_t edge)\n{\n if (!edge)\n {\n throw null_edge_port_connection_exception(d->name, port);\n }\n\n if (port == port_heartbeat)\n {\n d->heartbeats.push_back(edge);\n\n return;\n }\n\n _connect_output_port(port, edge);\n}\n\nprocess::ports_t\nprocess\n::input_ports() const\n{\n ports_t ports = _input_ports();\n\n return ports;\n}\n\nprocess::ports_t\nprocess\n::output_ports() const\n{\n ports_t ports = _output_ports();\n\n ports.push_back(port_heartbeat);\n\n return ports;\n}\n\nprocess::port_info_t\nprocess\n::input_port_info(port_t const& port) const\n{\n return _input_port_info(port);\n}\n\nprocess::port_info_t\nprocess\n::output_port_info(port_t const& port) const\n{\n if (port == port_heartbeat)\n {\n return d->heartbeat_port_info;\n }\n\n return _output_port_info(port);\n}\n\nconfig::keys_t\nprocess\n::available_config() const\n{\n config::keys_t keys = _available_config();\n\n keys.push_back(config_name);\n keys.push_back(config_type);\n\n return keys;\n}\n\nprocess::conf_info_t\nprocess\n::config_info(config::key_t const& key) const\n{\n if (key == config_name)\n {\n return d->name_conf_info;\n }\n if (key == config_type)\n {\n return d->type_conf_info;\n }\n\n return _config_info(key);\n}\n\nprocess::name_t\nprocess\n::name() const\n{\n return d->name;\n}\n\nprocess_registry::type_t\nprocess\n::type() const\n{\n return d->type;\n}\n\nprocess\n::process(config_t const& config) throw()\n{\n d = boost::shared_ptr<priv>(new priv);\n\n d->name = config->get_value<name_t>(config_name, priv::DEFAULT_PROCESS_NAME);\n d->type = config->get_value<name_t>(config_type);\n}\n\nprocess\n::~process()\n{\n}\n\nvoid\nprocess\n::_init()\n{\n}\n\nvoid\nprocess\n::_step()\n{\n}\n\nvoid\nprocess\n::_connect_input_port(port_t const& port, edge_t \/*edge*\/)\n{\n throw no_such_port_exception(d->name, port);\n}\n\nvoid\nprocess\n::_connect_output_port(port_t const& port, edge_t \/*edge*\/)\n{\n throw no_such_port_exception(d->name, port);\n}\n\nprocess::ports_t\nprocess\n::_input_ports() const\n{\n return ports_t();\n}\n\nprocess::ports_t\nprocess\n::_output_ports() const\n{\n return ports_t();\n}\n\nprocess::port_info_t\nprocess\n::_input_port_info(port_t const& port) const\n{\n throw no_such_port_exception(d->name, port);\n}\n\nprocess::port_info_t\nprocess\n::_output_port_info(port_t const& port) const\n{\n throw no_such_port_exception(d->name, port);\n}\n\nconfig::keys_t\nprocess\n::_available_config() const\n{\n return config::keys_t();\n}\n\nprocess::conf_info_t\nprocess\n::_config_info(config::key_t const& key) const\n{\n throw unknown_configuration_value_exception(d->name, key);\n}\n\nvoid\nprocess\n::mark_as_complete()\n{\n d->is_complete = true;\n}\n\nstamp_t\nprocess\n::heartbeat_stamp() const\n{\n return d->hb_stamp;\n}\n\nbool\nprocess\n::same_colored_edges(edges_t const& edges)\n{\n edges_t::const_iterator it = edges.begin();\n edges_t::const_iterator it_end = edges.end();\n\n for ( ; it != it_end; ++it)\n {\n edges_t::const_iterator it2 = it;\n\n stamp_t const st = (*it)->peek_datum().get<1>();\n\n for (++it2; it2 != it_end; ++it2)\n {\n if (!st->is_same_color((*it2)->peek_datum().get<1>()))\n {\n return false;\n }\n }\n }\n\n return true;\n}\n\nbool\nprocess\n::syncd_edges(edges_t const& edges)\n{\n edges_t::const_iterator it = edges.begin();\n edges_t::const_iterator it_end = edges.end();\n\n for ( ; it != it_end; ++it)\n {\n edges_t::const_iterator it2 = it;\n\n stamp_t const st = (*it)->peek_datum().get<1>();\n\n for (++it2; it2 != it_end; ++it2)\n {\n stamp_t const st2 = (*it2)->peek_datum().get<1>();\n\n if (*st != *st2)\n {\n return false;\n }\n }\n }\n\n return true;\n}\n\ndatum::datum_type_t\nprocess\n::max_status(edge_data_t const& data)\n{\n datum::datum_type_t max_type = datum::DATUM_INVALID;\n\n BOOST_FOREACH (edge_datum_t const& dat, data)\n {\n datum::datum_type_t const type = dat.get<0>()->type();\n\n if (max_type < type)\n {\n max_type = type;\n }\n }\n\n return max_type;\n}\n\nvoid\nprocess\n::push_to_edges(edges_t const& edges, edge_datum_t const& dat)\n{\n BOOST_FOREACH (edge_t e, edges)\n {\n e->push_datum(dat);\n }\n}\n\nprocess::priv\n::priv()\n : is_complete(false)\n , hb_stamp(stamp::new_stamp())\n{\n heartbeat_port_info = port_info_t(new port_info(\n type_none,\n port_flags_t(),\n port_description_t(\"Outputs the heartbeat stamp with an empty datum\")));\n\n name_conf_info = conf_info_t(new conf_info(\n boost::lexical_cast<config::value_t>(priv::DEFAULT_PROCESS_NAME),\n config::description_t(\"The name of the process\")));\n type_conf_info = conf_info_t(new conf_info(\n config::value_t(),\n config::description_t(\"The type of the process\")));\n}\n\nprocess::priv\n::~priv()\n{\n}\n\nvoid\nprocess::priv\n::run_heartbeat()\n{\n datum_t dat;\n\n if (is_complete)\n {\n dat = datum::complete_datum();\n }\n else\n {\n dat = datum::empty_datum();\n }\n\n edge_datum_t edge_dat(dat, hb_stamp);\n\n hb_stamp = stamp::incremented_stamp(hb_stamp);\n\n edges_t::iterator hb = heartbeats.begin();\n edges_t::iterator hb_end = heartbeats.end();\n\n for ( ; hb != hb_end; ++hb)\n {\n (*hb)->push_datum(edge_dat);\n }\n}\n\n}\n<|endoftext|>"} {"text":"<commit_before>#pragma once\n\n#include <string>\n#include <typeinfo>\n#include <vector>\n#include <functional>\n#include <SFML\/Graphics.hpp>\n#include <kaguya\/kaguya.hpp>\n\n#include \"DataParser.hpp\"\n\nnamespace mse\n{\n\tnamespace System\n\t{\n\t\tnamespace Loaders\n\t\t{\n\t\t\textern std::function<int(sf::Texture*, std::string)> textureLoader;\n\t\t\textern std::function<int(Data::DataParser*, std::string)> dataLoader;\n\t\t\textern std::function<int(sf::Font*, std::string)> fontLoader;\n\t\t\textern std::function<int(std::vector<std::string>*, std::string)> dirPathLoader;\n\t\t\textern std::function<int(std::vector<std::string>*, std::string)> filePathLoader;\n\t\t\textern std::function<int(kaguya::State*, std::string)> luaLoader;\n\t\t}\n\t\tclass Path\n\t\t{\n\t\t\tprivate:\n\t\t\t\tstd::string path;\n\t\t\tpublic:\n\t\t\t\tPath();\n\t\t\t\tPath(const Path& path);\n\t\t\t\tPath(std::string path);\n\t\t\t\tPath add(std::string path);\n\t\t\t\tstd::string getPath(int index);\n\t\t\t\tstd::string toString() const;\n\t\t\t\ttemplate<typename R>\n\t\t\t\tbool Path::checkType(R type, std::string expectedType);\n\t\t\t\ttemplate <typename R, typename F>\n\t\t\t\tstd::string loadResource(R* resource, F lambda, bool silent = false);\n\t\t\t\tstatic std::vector<std::string> basePaths;\n\t\t};\n\t\ttemplate<typename R>\n\t\tinline bool Path::checkType(R type, std::string expectedType)\n\t\t{\n\t\t\treturn (std::string(typeid(R).name()) == expectedType);\n\t\t}\n\t\ttemplate<typename R, typename F>\n\t\tinline std::string Path::loadResource(R* resource, F lambda, bool silent)\n\t\t{\n\t\t\tint loadSum = 0;\n\t\t\tfor (int i = 0; i < basePaths.size(); i++)\n\t\t\t{\n\t\t\t\tint loadResponse = 0;\n\t\t\t\tif (Functions::File::fileExists(basePaths[i] + ((basePaths[i] != \"\") ? \"\/\" : \"\") + this->path))\n\t\t\t\t\tloadResponse = lambda(resource, basePaths[i] + ((basePaths[i] != \"\") ? \"\/\" : \"\") + this->path);\n\t\t\t\tloadSum += loadResponse;\n\t\t\t\tif (loadResponse == 1)\n\t\t\t\t\treturn basePaths[i];\n\t\t\t}\n\t\t\tif (loadSum > 0)\n\t\t\t\treturn \"*\";\n\t\t\telse\n\t\t\t{\n\t\t\t\tif (silent)\n\t\t\t\t\tstd::cout << \"<Error:PathResolver:Path>[loadResource] : Can't find resource : \" << this->path << std::endl;\n\t\t\t\treturn \"\";\n\t\t\t}\n\t\t}\n\t}\n}\n<commit_msg>Removed extra qualification (PathResolver)<commit_after>#pragma once\n\n#include <string>\n#include <typeinfo>\n#include <vector>\n#include <functional>\n#include <SFML\/Graphics.hpp>\n#include <kaguya\/kaguya.hpp>\n\n#include \"DataParser.hpp\"\n\nnamespace mse\n{\n\tnamespace System\n\t{\n\t\tnamespace Loaders\n\t\t{\n\t\t\textern std::function<int(sf::Texture*, std::string)> textureLoader;\n\t\t\textern std::function<int(Data::DataParser*, std::string)> dataLoader;\n\t\t\textern std::function<int(sf::Font*, std::string)> fontLoader;\n\t\t\textern std::function<int(std::vector<std::string>*, std::string)> dirPathLoader;\n\t\t\textern std::function<int(std::vector<std::string>*, std::string)> filePathLoader;\n\t\t\textern std::function<int(kaguya::State*, std::string)> luaLoader;\n\t\t}\n\t\tclass Path\n\t\t{\n\t\t\tprivate:\n\t\t\t\tstd::string path;\n\t\t\tpublic:\n\t\t\t\tPath();\n\t\t\t\tPath(const Path& path);\n\t\t\t\tPath(std::string path);\n\t\t\t\tPath add(std::string path);\n\t\t\t\tstd::string getPath(int index);\n\t\t\t\tstd::string toString() const;\n\t\t\t\ttemplate<typename R>\n\t\t\t\tbool checkType(R type, std::string expectedType);\n\t\t\t\ttemplate <typename R, typename F>\n\t\t\t\tstd::string loadResource(R* resource, F lambda, bool silent = false);\n\t\t\t\tstatic std::vector<std::string> basePaths;\n\t\t};\n\t\ttemplate<typename R>\n\t\tinline bool Path::checkType(R type, std::string expectedType)\n\t\t{\n\t\t\treturn (std::string(typeid(R).name()) == expectedType);\n\t\t}\n\t\ttemplate<typename R, typename F>\n\t\tinline std::string Path::loadResource(R* resource, F lambda, bool silent)\n\t\t{\n\t\t\tint loadSum = 0;\n\t\t\tfor (int i = 0; i < basePaths.size(); i++)\n\t\t\t{\n\t\t\t\tint loadResponse = 0;\n\t\t\t\tif (Functions::File::fileExists(basePaths[i] + ((basePaths[i] != \"\") ? \"\/\" : \"\") + this->path))\n\t\t\t\t\tloadResponse = lambda(resource, basePaths[i] + ((basePaths[i] != \"\") ? \"\/\" : \"\") + this->path);\n\t\t\t\tloadSum += loadResponse;\n\t\t\t\tif (loadResponse == 1)\n\t\t\t\t\treturn basePaths[i];\n\t\t\t}\n\t\t\tif (loadSum > 0)\n\t\t\t\treturn \"*\";\n\t\t\telse\n\t\t\t{\n\t\t\t\tif (silent)\n\t\t\t\t\tstd::cout << \"<Error:PathResolver:Path>[loadResource] : Can't find resource : \" << this->path << std::endl;\n\t\t\t\treturn \"\";\n\t\t\t}\n\t\t}\n\t}\n}\n<|endoftext|>"} {"text":"<commit_before>\/*\n * MultilevelLayouter.cpp\n *\n * Created on: 27.01.2014\n * Author: Henning\n *\/\n\n#include \"MultilevelLayouter.h\"\n\nnamespace NetworKit {\n\nconst count MultilevelLayouter::N_THRSH = 15;\n\nMultilevelLayouter::MultilevelLayouter(Point<float> bottomLeft, Point<float> topRight):\n\t\tLayouter(bottomLeft, topRight)\n{\n\n}\n\nMultilevelLayouter::~MultilevelLayouter() {\n\n}\n\nvoid MultilevelLayouter::prolongCoordinates(Graph& Gcon, Graph& G) {\n\n}\n\nvoid MultilevelLayouter::draw(Graph& G) {\n\tcount n = G.numberOfNodes();\n\n\tif (n <= N_THRSH) {\n\t\t\/\/ unrecursive part: call drawing routine\n\t\tFruchtermanReingold layouter(bottomLeft, topRight, false);\n\t\tlayouter.draw(G);\n\t}\n\telse {\n\t\t\/\/ compute matching\n\t\tLocalMaxMatcher matcher(none);\n\t\tMatching M = matcher.run(G);\n\n\t\t\/\/ coarsen by matching\n\t\tMatchingContracter contracter;\n\t\tstd::pair<Graph, NodeMap<node> > mypair = contracter.run(G, M, true);\n\t\tGraph& Gcon = mypair.first;\n\t\tNodeMap<node>& mapping = mypair.second;\n\n\t\t\/\/ make recursive call\n\t\tdraw(Gcon);\n\n\t\t\/\/ apply recursive solution to current graph\n\t\tGcon.initCoordinates();\n\t\tG.forNodes([&](node v) {\n\t\t\tG.setCoordinate(v, 0, Gcon.getCoordinate(mapping[v], 0));\n\t\t\tG.setCoordinate(v, 1, Gcon.getCoordinate(mapping[v], 1));\n\t\t});\n\n\t\t\/\/ run drawing code on current graph\n\t\tFruchtermanReingold layouter(bottomLeft, topRight, true);\n\t\tlayouter.draw(G);\n\t}\n\n}\n\n} \/* namespace NetworKit *\/\n<commit_msg>multilevel drawing, still buggy<commit_after>\/*\n * MultilevelLayouter.cpp\n *\n * Created on: 27.01.2014\n * Author: Henning\n *\/\n\n#include \"MultilevelLayouter.h\"\n\nnamespace NetworKit {\n\nconst count MultilevelLayouter::N_THRSH = 15;\n\nMultilevelLayouter::MultilevelLayouter(Point<float> bottomLeft, Point<float> topRight):\n\t\tLayouter(bottomLeft, topRight)\n{\n\n}\n\nMultilevelLayouter::~MultilevelLayouter() {\n\n}\n\nvoid MultilevelLayouter::prolongCoordinates(Graph& Gcon, Graph& G) {\n\n}\n\nvoid MultilevelLayouter::draw(Graph& G) {\n\tcount n = G.numberOfNodes();\n\n\tif (n <= N_THRSH) {\n\t\t\/\/ unrecursive part: call drawing routine\n\t\tFruchtermanReingold layouter(bottomLeft, topRight, false);\n\t\tlayouter.draw(G);\n\t}\n\telse {\n\t\t\/\/ compute matching\n\t\tLocalMaxMatcher matcher(none);\n\t\tMatching M = matcher.run(G);\n\n\t\t\/\/ coarsen by matching\n\t\tMatchingContracter contracter;\n\t\tstd::pair<Graph, NodeMap<node> > mypair = contracter.run(G, M, true);\n\t\tGraph& Gcon = mypair.first;\n\t\tNodeMap<node>& mapping = mypair.second;\n\n\t\t\/\/ make recursive call\n\t\tdraw(Gcon);\n\n\t\t\/\/ apply recursive solution to current graph\n\t\tG.initCoordinates();\n\t\tG.forNodes([&](node v) {\n\t\t\tG.setCoordinate(v, 0, Gcon.getCoordinate(mapping[v], 0));\n\t\t\tG.setCoordinate(v, 1, Gcon.getCoordinate(mapping[v], 1));\n\t\t});\n\n\t\t\/\/ run drawing code on current graph\n\t\tFruchtermanReingold layouter(bottomLeft, topRight, true);\n\t\tlayouter.draw(G);\n\t}\n\n}\n\n} \/* namespace NetworKit *\/\n<|endoftext|>"} {"text":"<commit_before>\/\/\n\/\/ TcpASIOServer.hh for LibNet in \/home\/alexmog\/projets\/LibNet\/include\n\/\/ \n\/\/ Made by Moghrabi Alexandre\n\/\/ Login <alexandre.moghrabi@epitech.eu>\n\/\/ \n\/\/ Started on Sat Nov 15 18:00:03 2014 Moghrabi Alexandre\n\/\/ Last update Tue Nov 18 09:28:53 2014 Moghrabi Alexandre\n\/\/\n\n\/*!\n * \\file TcpASIOServer.hh\n * \\brief Gère les threads d'écriture et de lecture\n * \\author AlexMog\n * \\version 0.1\n *\/\n\n#ifndef TCPASIOSERVER_HH_\n# define TCPASIOSERVER_HH_\n\n# include <list>\n# include \"TcpServerSocket.hh\"\n# include \"TcpASIOListener.hh\"\n# include \"TcpASIOWriter.hh\"\n\nnamespace mognetwork\n{\n \/*!\n * \\class TcpASIOServer\n * \\brief Gère les threads d'écriture et de lecture en ASIO\n *\/\n class TcpASIOServer\n {\n public:\n \/*!\n * \\brief Constructeur par défaut\n * \\param port Le port sur lequel le serveur écoute\n *\/\n TcpASIOServer(int port);\n virtual ~TcpASIOServer();\n\n public:\n \/*!\n * \\brief Démarre les différents threads, et attends qu'ils se terminent.\n *\/\n void start();\n \/*!\n * \\brief Arrête le thread de lecture et d'écriture.\n *\/\n void stop();\n \/*!\n * \\brief Ajoute un listener au serveur.\n * \\param listener le listener en question en utilisant ITcpASIOListenerHandler\n *\/\n void addListener(ITcpASIOListenerHandler* listener) {m_serverListener->addListener(listener);}\n \/*!\n * \\brief Dans le cas ou une socket client contient des données à envoyer, met à jour le thread d'écriture\n *\/\n void sendPendingDatas() {m_serverWriter->triggerData();}\n\n private:\n TcpASIOListener* m_serverListener; \/*!< instance du thread d'écoute *\/\n TcpServerSocket m_serverSocket; \/*!< socket serveur *\/\n TcpASIOWriter* m_serverWriter; \/*!< instance du thread d'écriture *\/\n int m_port; \/*!< port d'écoute du serveur *\/\n };\n} \/\/ namespace mognetwork\n\n#endif \/\/ !TCPASIOSERVER_HH_\n<commit_msg>Added some getters and setters<commit_after>\/\/\n\/\/ TcpASIOServer.hh for LibNet in \/home\/alexmog\/projets\/LibNet\/include\n\/\/ \n\/\/ Made by Moghrabi Alexandre\n\/\/ Login <alexandre.moghrabi@epitech.eu>\n\/\/ \n\/\/ Started on Sat Nov 15 18:00:03 2014 Moghrabi Alexandre\n\/\/ Last update Tue Nov 18 12:45:22 2014 Moghrabi Alexandre\n\/\/\n\n\/*!\n * \\file TcpASIOServer.hh\n * \\brief Gère les threads d'écriture et de lecture\n * \\author AlexMog\n * \\version 0.1\n *\/\n\n#ifndef TCPASIOSERVER_HH_\n# define TCPASIOSERVER_HH_\n\n# include <list>\n# include \"TcpServerSocket.hh\"\n# include \"TcpASIOListener.hh\"\n# include \"TcpASIOWriter.hh\"\n\nnamespace mognetwork\n{\n \/*!\n * \\class TcpASIOServer\n * \\brief Gère les threads d'écriture et de lecture en ASIO\n *\/\n class TcpASIOServer\n {\n public:\n \/*!\n * \\brief Constructeur par défaut\n * \\param port Le port sur lequel le serveur écoute\n *\/\n TcpASIOServer(int port);\n virtual ~TcpASIOServer();\n\n public:\n \/*!\n * \\brief Démarre les différents threads, et attends qu'ils se terminent.\n *\/\n void start();\n \/*!\n * \\brief Arrête le thread de lecture et d'écriture.\n *\/\n void stop();\n \/*!\n * \\brief Ajoute un listener au serveur.\n * \\param listener le listener en question en utilisant ITcpASIOListenerHandler\n *\/\n void addListener(ITcpASIOListenerHandler* listener) {m_serverListener->addListener(listener);}\n \/*!\n * \\brief Dans le cas ou une socket client contient des données à envoyer, met à jour le thread d'écriture\n *\/\n void sendPendingDatas() {m_serverWriter->triggerData();}\n\n public:\n \/*!\n * \\brief Récupère le writer TcpASIOWriter\n * \\return un pointeur sur le TcpASIOWriter\n *\/\n TcpASIOWriter* getServerWriter() const {return m_serverWriter;}\n \/*!\n * \\brief Récupère le listener TcpASIOListener\n * \\return un pointeur sur le TcpASIOWriter\n *\/\n TcpASIOListener* getServerListener() const {return m_serverListener;}\n\n private:\n TcpASIOListener* m_serverListener; \/*!< instance du thread d'écoute *\/\n TcpServerSocket m_serverSocket; \/*!< socket serveur *\/\n TcpASIOWriter* m_serverWriter; \/*!< instance du thread d'écriture *\/\n int m_port; \/*!< port d'écoute du serveur *\/\n };\n} \/\/ namespace mognetwork\n\n#endif \/\/ !TCPASIOSERVER_HH_\n<|endoftext|>"} {"text":"<commit_before>#include \"sani\/resource\/compiler\/resource_writer.hpp\"\n#include \"sani\/platform\/platform_config.hpp\"\n#include \"sani\/platform\/file\/file_stream.hpp\"\n#include \"sani\/resource\/compiler\/resource_compiler.hpp\"\n\nnamespace sani {\n\tusing namespace io;\n\tnamespace resource {\n\t\tnamespace compiler {\n\t\t\t\/\/ DO NOT CHANGE THESE, THEY ARE FOLLOWING THE PLATFORM CONFIG\n\t\t\tconst char ResourceWriter::Platforms[] = {\n\t\t\t\t'w', \/\/ win32\n\t\t\t\t'l', \/\/ linux\n\t\t\t\t'X', \/\/ MAC\n\t\t\t\t'a', \/\/ android\n\t\t\t\t'W', \/\/ windows phone\n\t\t\t\t'i' \/\/ iOS\n\t\t\t\t\/\/ TODO emscripte, ps4, xbox\n\t\t\t};\n\n\t\t\tResourceWriter::ResourceWriter(const FileStream* stream, const ResourceCompiler* compiler) \n\t\t\t\t: BinaryWriter(stream), compiler(compiler) {\n\n\t\t\t}\n\t\t\tResourceWriter::~ResourceWriter() {}\n\n\t\t\tvoid ResourceWriter::writeHeader() {\n#if SANI_TARGET_PLATFORM == SANI_PLATFORM_UNKOWN\n#error \"Couldnt determine the platform\"\n#endif\n\t\t\t\t\/\/ magic 3 bytes\n\t\t\t\twrite('S');\n\t\t\t\twrite('N');\n\t\t\t\twrite('B');\n\n\t\t\t\t\/\/ platform\n\t\t\t\twrite(Platforms[SANI_TARGET_PLATFORM]);\n\t\t\t\t\/\/ version, is this needed?\n\t\t\t\twrite(Version);\n\t\t\t}\n\n\t\t\tvoid ResourceWriter::writeTypeWriters() {\n\t\t\t\twrite7BitEncodedInt(writers.size());\n\t\t\t\tfor (auto& kv : writers) {\n\t\t\t\t\twrite(kv.second->getRuntimeReader());\n\t\t\t\t}\n\t\t\t}\n\n\t\t\tResourceTypeWriter* ResourceWriter::getWriter(const std::type_index& info) {\n\t\t\t\t\/\/ we dont have writer yet lets add it\n\t\t\t\tif (writers.find(info) == writers.end()) {\n\t\t\t\t\tResourceTypeWriter* w = compiler->getWriter(info);\n\t\t\t\t\twriters[info] = w;\n\t\t\t\t\treturn w;\n\t\t\t\t}\n\t\t\t\t\/\/ we have the typewriter already\n\t\t\t\treturn writers[info];\n\t\t\t}\n\n\t\t\tvoid ResourceWriter::writeObject(const std::type_index& type, const ResourceItem* obj) {\n\t\t\t\tif (obj == nullptr) {\n\t\t\t\t\tthrow std::runtime_error(\"obj is nullptr\");\n\t\t\t\t}\n\t\t\t\tResourceTypeWriter* writer = getWriter(type);\n\t\t\t\tif (writer == nullptr) {\n\t\t\t\t\tthrow std::runtime_error(\"Cant get writer for T\");\n\t\t\t\t}\n\t\t\t\twriter->write(this, obj);\n\t\t\t}\n\n\t\t\tvoid ResourceWriter::flush(const std::type_index& type, const ResourceItem* obj) {\n\t\t\t\t\/\/ this is hax, just so we have the writer in list...\n\t\t\t\tgetWriter(type);\n\t\t\t\t\/\/ write the header..\n\t\t\t\twriteHeader();\n\t\t\t\t\/\/ write the readers to deserialize\n\t\t\t\twriteTypeWriters();\n\t\t\t\t\/\/ write the final object..\n\t\t\t\twriteObject(type, obj);\n\n\t\t\t\tBinaryWriter::flush();\n\t\t\t}\n\t\t}\n\t}\n}<commit_msg>Write bytes instead of int32's<commit_after>#include \"sani\/resource\/compiler\/resource_writer.hpp\"\n#include \"sani\/platform\/platform_config.hpp\"\n#include \"sani\/platform\/file\/file_stream.hpp\"\n#include \"sani\/resource\/compiler\/resource_compiler.hpp\"\n\nnamespace sani {\n\tusing namespace io;\n\tnamespace resource {\n\t\tnamespace compiler {\n\t\t\t\/\/ DO NOT CHANGE THESE, THEY ARE FOLLOWING THE PLATFORM CONFIG\n\t\t\tconst char ResourceWriter::Platforms[] = {\n\t\t\t\t'w', \/\/ win32\n\t\t\t\t'l', \/\/ linux\n\t\t\t\t'X', \/\/ MAC\n\t\t\t\t'a', \/\/ android\n\t\t\t\t'W', \/\/ windows phone\n\t\t\t\t'i' \/\/ iOS\n\t\t\t\t\/\/ TODO emscripte, ps4, xbox\n\t\t\t};\n\n\t\t\tResourceWriter::ResourceWriter(const FileStream* stream, const ResourceCompiler* compiler) \n\t\t\t\t: BinaryWriter(stream), compiler(compiler) {\n\n\t\t\t}\n\t\t\tResourceWriter::~ResourceWriter() {}\n\n\t\t\tvoid ResourceWriter::writeHeader() {\n#if SANI_TARGET_PLATFORM == SANI_PLATFORM_UNKOWN\n#error \"Couldnt determine the platform\"\n#endif\n\t\t\t\t\/\/ magic 3 bytes\n\t\t\t\twrite((uint8)'S');\n\t\t\t\twrite((uint8)'N');\n\t\t\t\twrite((uint8)'B');\n\n\t\t\t\t\/\/ platform\n\t\t\t\twrite(Platforms[SANI_TARGET_PLATFORM]);\n\t\t\t\t\/\/ version, is this needed?\n\t\t\t\twrite(Version);\n\t\t\t}\n\n\t\t\tvoid ResourceWriter::writeTypeWriters() {\n\t\t\t\twrite7BitEncodedInt(writers.size());\n\t\t\t\tfor (auto& kv : writers) {\n\t\t\t\t\twrite(kv.second->getRuntimeReader());\n\t\t\t\t}\n\t\t\t}\n\n\t\t\tResourceTypeWriter* ResourceWriter::getWriter(const std::type_index& info) {\n\t\t\t\t\/\/ we dont have writer yet lets add it\n\t\t\t\tif (writers.find(info) == writers.end()) {\n\t\t\t\t\tResourceTypeWriter* w = compiler->getWriter(info);\n\t\t\t\t\twriters[info] = w;\n\t\t\t\t\treturn w;\n\t\t\t\t}\n\t\t\t\t\/\/ we have the typewriter already\n\t\t\t\treturn writers[info];\n\t\t\t}\n\n\t\t\tvoid ResourceWriter::writeObject(const std::type_index& type, const ResourceItem* obj) {\n\t\t\t\tif (obj == nullptr) {\n\t\t\t\t\tthrow std::runtime_error(\"obj is nullptr\");\n\t\t\t\t}\n\t\t\t\tResourceTypeWriter* writer = getWriter(type);\n\t\t\t\tif (writer == nullptr) {\n\t\t\t\t\tthrow std::runtime_error(\"Cant get writer for T\");\n\t\t\t\t}\n\t\t\t\twriter->write(this, obj);\n\t\t\t}\n\n\t\t\tvoid ResourceWriter::flush(const std::type_index& type, const ResourceItem* obj) {\n\t\t\t\t\/\/ this is hax, just so we have the writer in list...\n\t\t\t\tgetWriter(type);\n\t\t\t\t\/\/ write the header..\n\t\t\t\twriteHeader();\n\t\t\t\t\/\/ write the readers to deserialize\n\t\t\t\twriteTypeWriters();\n\t\t\t\t\/\/ write the final object..\n\t\t\t\twriteObject(type, obj);\n\n\t\t\t\tBinaryWriter::flush();\n\t\t\t}\n\t\t}\n\t}\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 library is free software; you can redistribute it and\/or modify it *\n* under the terms of the GNU Lesser General Public License as published by *\n* the Free Software Foundation; either version 2.1 of the License, or (at *\n* your option) any later version. *\n* *\n* This library is distributed in the hope that it will be useful, but WITHOUT *\n* ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or *\n* FITNESS FOR A PARTICULAR PURPOSE. See the GNU Lesser General Public License *\n* for more details. *\n* *\n* You should have received a copy of the GNU Lesser General Public License *\n* along with this library; if not, write to the Free Software Foundation, *\n* Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA. *\n*******************************************************************************\n* SOFA :: Modules *\n* *\n* Authors: The SOFA Team and external contributors (see Authors.txt) *\n* *\n* Contact information: contact@sofa-framework.org *\n******************************************************************************\/\n#include <SofaConstraint\/FreeMotionAnimationLoop.h>\n#include <sofa\/core\/visual\/VisualParams.h>\n\n#include <SofaConstraint\/LCPConstraintSolver.h>\n\n#include <sofa\/core\/ObjectFactory.h>\n#include <sofa\/core\/VecId.h>\n\n#include <sofa\/helper\/AdvancedTimer.h>\n\n#include <sofa\/simulation\/BehaviorUpdatePositionVisitor.h>\n#include <sofa\/simulation\/MechanicalOperations.h>\n#include <sofa\/simulation\/SolveVisitor.h>\n#include <sofa\/simulation\/VectorOperations.h>\n#include <sofa\/simulation\/AnimateBeginEvent.h>\n#include <sofa\/simulation\/AnimateEndEvent.h>\n#include <sofa\/simulation\/PropagateEventVisitor.h>\n#include <sofa\/simulation\/UpdateContextVisitor.h>\n#include <sofa\/simulation\/UpdateMappingVisitor.h>\n#include <sofa\/simulation\/UpdateMappingEndEvent.h>\n#include <sofa\/simulation\/UpdateBoundingBoxVisitor.h>\n\n\nnamespace sofa\n{\n\nnamespace component\n{\n\nnamespace animationloop\n{\n\nusing namespace core::behavior;\nusing namespace sofa::simulation;\n\nFreeMotionAnimationLoop::FreeMotionAnimationLoop(simulation::Node* gnode)\n : Inherit(gnode)\n , m_solveVelocityConstraintFirst(initData(&m_solveVelocityConstraintFirst , false, \"solveVelocityConstraintFirst\", \"solve separately velocity constraint violations before position constraint violations\"))\n , constraintSolver(NULL)\n , defaultSolver(NULL)\n{\n}\n\nFreeMotionAnimationLoop::~FreeMotionAnimationLoop()\n{\n if (defaultSolver != NULL)\n defaultSolver.reset();\n}\n\nvoid FreeMotionAnimationLoop::parse ( sofa::core::objectmodel::BaseObjectDescription* arg )\n{\n this->simulation::CollisionAnimationLoop::parse(arg);\n\n defaultSolver = sofa::core::objectmodel::New<constraintset::LCPConstraintSolver>();\n defaultSolver->parse(arg);\n}\n\n\nvoid FreeMotionAnimationLoop::init()\n{\n\n {\n simulation::common::VectorOperations vop(core::ExecParams::defaultInstance(), this->getContext());\n MultiVecDeriv dx(&vop, core::VecDerivId::dx() ); dx.realloc( &vop, true, true );\n MultiVecDeriv df(&vop, core::VecDerivId::dforce() ); df.realloc( &vop, true, true );\n }\n\n\n\n\n getContext()->get(constraintSolver, core::objectmodel::BaseContext::SearchDown);\n if (constraintSolver == NULL && defaultSolver != NULL)\n {\n serr << \"No ConstraintSolver found, using default LCPConstraintSolver\" << sendl;\n this->getContext()->addObject(defaultSolver);\n constraintSolver = defaultSolver.get();\n defaultSolver = NULL;\n }\n else\n {\n defaultSolver.reset();\n }\n}\n\n\nvoid FreeMotionAnimationLoop::step(const sofa::core::ExecParams* params, SReal dt)\n{\n if (dt == 0)\n dt = this->gnode->getDt();\n\n#ifdef SOFA_DUMP_VISITOR_INFO\n simulation::Visitor::printNode(\"Step\");\n#endif\n\n {\n sofa::helper::AdvancedTimer::stepBegin(\"AnimateBeginEvent\");\n AnimateBeginEvent ev ( dt );\n PropagateEventVisitor act ( params, &ev );\n this->gnode->execute ( act );\n sofa::helper::AdvancedTimer::stepEnd(\"AnimateBeginEvent\");\n }\n\n double startTime = this->gnode->getTime();\n\n simulation::common::VectorOperations vop(params, this->getContext());\n simulation::common::MechanicalOperations mop(params, this->getContext());\n\n MultiVecCoord pos(&vop, core::VecCoordId::position() );\n MultiVecDeriv vel(&vop, core::VecDerivId::velocity() );\n MultiVecCoord freePos(&vop, core::VecCoordId::freePosition() );\n MultiVecDeriv freeVel(&vop, core::VecDerivId::freeVelocity() );\n\n {\n MultiVecDeriv dx(&vop, core::VecDerivId::dx() ); dx.realloc( &vop, true, true );\n MultiVecDeriv df(&vop, core::VecDerivId::dforce() ); df.realloc( &vop, true, true );\n }\n\n\n\n\n \/\/ This solver will work in freePosition and freeVelocity vectors.\n \/\/ We need to initialize them if it's not already done.\n sofa::helper::AdvancedTimer::stepBegin(\"MechanicalVInitVisitor\");\n simulation::MechanicalVInitVisitor< core::V_COORD >(params, core::VecCoordId::freePosition(), core::ConstVecCoordId::position(), true).execute(this->gnode);\n simulation::MechanicalVInitVisitor< core::V_DERIV >(params, core::VecDerivId::freeVelocity(), core::ConstVecDerivId::velocity(), true).execute(this->gnode);\n\n sofa::helper::AdvancedTimer::stepEnd(\"MechanicalVInitVisitor\");\n\n BehaviorUpdatePositionVisitor beh(params , dt);\n\n using helper::system::thread::CTime;\n using sofa::helper::AdvancedTimer;\n\n double time = 0.0;\n \/\/double timeTotal = 0.0;\n double timeScale = 1000.0 \/ (double)CTime::getTicksPerSec();\n\n if (displayTime.getValue())\n {\n time = (double) CTime::getTime();\n \/\/timeTotal = (double) CTime::getTime();\n }\n\n \/\/ Update the BehaviorModels\n \/\/ Required to allow the RayPickInteractor interaction\n if (f_printLog.getValue())\n serr << \"updatePos called\" << sendl;\n\n AdvancedTimer::stepBegin(\"UpdatePosition\");\n this->gnode->execute(&beh);\n AdvancedTimer::stepEnd(\"UpdatePosition\");\n\n if (f_printLog.getValue())\n serr << \"updatePos performed - beginVisitor called\" << sendl;\n\n simulation::MechanicalBeginIntegrationVisitor beginVisitor(params, dt);\n this->gnode->execute(&beginVisitor);\n\n if (f_printLog.getValue())\n serr << \"beginVisitor performed - SolveVisitor for freeMotion is called\" << sendl;\n\n \/\/ Free Motion\n AdvancedTimer::stepBegin(\"FreeMotion\");\n simulation::SolveVisitor freeMotion(params, dt, true);\n this->gnode->execute(&freeMotion);\n AdvancedTimer::stepEnd(\"FreeMotion\");\n\n mop.propagateXAndV(freePos, freeVel, true); \/\/ apply projective constraints\n\n if (f_printLog.getValue())\n serr << \" SolveVisitor for freeMotion performed\" << sendl;\n\n if (displayTime.getValue())\n {\n sout << \" >>>>> Begin display FreeMotionAnimationLoop time\" << sendl;\n sout <<\" Free Motion \" << ((double)CTime::getTime() - time) * timeScale << \" ms\" << sendl;\n\n time = (double)CTime::getTime();\n }\n\n \/\/ Collision detection and response creation\n AdvancedTimer::stepBegin(\"Collision\");\n computeCollision(params);\n AdvancedTimer::stepEnd (\"Collision\");\n\n mop.propagateX(pos, false); \/\/ Why is this done at that point ???\n\n if (displayTime.getValue())\n {\n sout << \" computeCollision \" << ((double) CTime::getTime() - time) * timeScale << \" ms\" << sendl;\n time = (double)CTime::getTime();\n }\n\n \/\/ Solve constraints\n if (constraintSolver)\n {\n AdvancedTimer::stepBegin(\"ConstraintSolver\");\n\n if (m_solveVelocityConstraintFirst.getValue())\n {\n core::ConstraintParams cparams(*params);\n cparams.setX(freePos);\n cparams.setV(freeVel);\n\n cparams.setOrder(core::ConstraintParams::VEL);\n constraintSolver->solveConstraint(&cparams, vel);\n\n MultiVecDeriv dv(&vop, constraintSolver->getDx());\n mop.projectResponse(dv);\n mop.propagateDx(dv);\n\n \/\/ xfree += dv * dt\n freePos.eq(freePos, dv, dt);\n mop.propagateX(freePos, false); \/\/ ignore projective constraints\n\n cparams.setOrder(core::ConstraintParams::POS);\n constraintSolver->solveConstraint(&cparams, pos);\n\n MultiVecDeriv dx(&vop, constraintSolver->getDx());\n\n mop.propagateV(vel, true); \/\/ apply projective constraints\n mop.projectResponse(dx);\n mop.propagateDx(dx, true);\n\n \/\/ \"mapped\" x = xfree + dx\n simulation::MechanicalVOpVisitor(params, pos, freePos, dx, 1.0 ).setOnlyMapped(true).execute(this->gnode);\n }\n else\n {\n core::ConstraintParams cparams(*params);\n cparams.setX(freePos);\n cparams.setV(freeVel);\n\n constraintSolver->solveConstraint(&cparams, pos, vel);\n mop.propagateV(vel, true); \/\/ apply projective constraints\n\n MultiVecDeriv dx(&vop, constraintSolver->getDx());\n mop.projectResponse(dx);\n mop.propagateDx(dx, true);\n\n \/\/ \"mapped\" x = xfree + dx\n simulation::MechanicalVOpVisitor(params, pos, freePos, dx, 1.0 ).setOnlyMapped(true).execute(this->gnode);\n }\n AdvancedTimer::stepEnd(\"ConstraintSolver\");\n\n }\n\n if ( displayTime.getValue() )\n {\n sout << \" contactCorrections \" << ((double)CTime::getTime() - time) * timeScale << \" ms\" <<sendl;\n sout << \"<<<<<< End display FreeMotionAnimationLoop time.\" << sendl;\n }\n\n simulation::MechanicalEndIntegrationVisitor endVisitor(params, dt);\n this->gnode->execute(&endVisitor);\n\n this->gnode->setTime ( startTime + dt );\n this->gnode->execute<UpdateSimulationContextVisitor>(params); \/\/ propagate time\n\n {\n AnimateEndEvent ev ( dt );\n PropagateEventVisitor act ( params, &ev );\n this->gnode->execute ( act );\n }\n\n\n sofa::helper::AdvancedTimer::stepBegin(\"UpdateMapping\");\n \/\/Visual Information update: Ray Pick add a MechanicalMapping used as VisualMapping\n this->gnode->execute<UpdateMappingVisitor>(params);\n\/\/\tsofa::helper::AdvancedTimer::step(\"UpdateMappingEndEvent\");\n {\n UpdateMappingEndEvent ev ( dt );\n PropagateEventVisitor act ( params , &ev );\n this->gnode->execute ( act );\n }\n sofa::helper::AdvancedTimer::stepEnd(\"UpdateMapping\");\n\n#ifndef SOFA_NO_UPDATE_BBOX\n sofa::helper::AdvancedTimer::stepBegin(\"UpdateBBox\");\n this->gnode->execute<UpdateBoundingBoxVisitor>(params);\n sofa::helper::AdvancedTimer::stepEnd(\"UpdateBBox\");\n#endif\n#ifdef SOFA_DUMP_VISITOR_INFO\n simulation::Visitor::printCloseNode(\"Step\");\n#endif\n\n}\n\n\nSOFA_DECL_CLASS(FreeMotionAnimationLoop)\n\nint FreeMotionAnimationLoopClass = core::RegisterObject(\"Constraint solver\")\n .add< FreeMotionAnimationLoop >()\n .addAlias(\"FreeMotionMasterSolver\")\n ;\n\n} \/\/ namespace animationloop\n\n} \/\/ namespace component\n\n} \/\/ namespace sofa\n<commit_msg>FIX: FreeMotionAnimationLoop allocates the freeposition \/ freevelocity first thing in the time step<commit_after>\/******************************************************************************\n* SOFA, Simulation Open-Framework Architecture, development version *\n* (c) 2006-2016 INRIA, USTL, UJF, CNRS, MGH *\n* *\n* This library is free software; you can redistribute it and\/or modify it *\n* under the terms of the GNU Lesser General Public License as published by *\n* the Free Software Foundation; either version 2.1 of the License, or (at *\n* your option) any later version. *\n* *\n* This library is distributed in the hope that it will be useful, but WITHOUT *\n* ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or *\n* FITNESS FOR A PARTICULAR PURPOSE. See the GNU Lesser General Public License *\n* for more details. *\n* *\n* You should have received a copy of the GNU Lesser General Public License *\n* along with this library; if not, write to the Free Software Foundation, *\n* Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA. *\n*******************************************************************************\n* SOFA :: Modules *\n* *\n* Authors: The SOFA Team and external contributors (see Authors.txt) *\n* *\n* Contact information: contact@sofa-framework.org *\n******************************************************************************\/\n#include <SofaConstraint\/FreeMotionAnimationLoop.h>\n#include <sofa\/core\/visual\/VisualParams.h>\n\n#include <SofaConstraint\/LCPConstraintSolver.h>\n\n#include <sofa\/core\/ObjectFactory.h>\n#include <sofa\/core\/VecId.h>\n\n#include <sofa\/helper\/AdvancedTimer.h>\n\n#include <sofa\/simulation\/BehaviorUpdatePositionVisitor.h>\n#include <sofa\/simulation\/MechanicalOperations.h>\n#include <sofa\/simulation\/SolveVisitor.h>\n#include <sofa\/simulation\/VectorOperations.h>\n#include <sofa\/simulation\/AnimateBeginEvent.h>\n#include <sofa\/simulation\/AnimateEndEvent.h>\n#include <sofa\/simulation\/PropagateEventVisitor.h>\n#include <sofa\/simulation\/UpdateContextVisitor.h>\n#include <sofa\/simulation\/UpdateMappingVisitor.h>\n#include <sofa\/simulation\/UpdateMappingEndEvent.h>\n#include <sofa\/simulation\/UpdateBoundingBoxVisitor.h>\n\n\nnamespace sofa\n{\n\nnamespace component\n{\n\nnamespace animationloop\n{\n\nusing namespace core::behavior;\nusing namespace sofa::simulation;\n\nFreeMotionAnimationLoop::FreeMotionAnimationLoop(simulation::Node* gnode)\n : Inherit(gnode)\n , m_solveVelocityConstraintFirst(initData(&m_solveVelocityConstraintFirst , false, \"solveVelocityConstraintFirst\", \"solve separately velocity constraint violations before position constraint violations\"))\n , constraintSolver(NULL)\n , defaultSolver(NULL)\n{\n}\n\nFreeMotionAnimationLoop::~FreeMotionAnimationLoop()\n{\n if (defaultSolver != NULL)\n defaultSolver.reset();\n}\n\nvoid FreeMotionAnimationLoop::parse ( sofa::core::objectmodel::BaseObjectDescription* arg )\n{\n this->simulation::CollisionAnimationLoop::parse(arg);\n\n defaultSolver = sofa::core::objectmodel::New<constraintset::LCPConstraintSolver>();\n defaultSolver->parse(arg);\n}\n\n\nvoid FreeMotionAnimationLoop::init()\n{\n\n {\n simulation::common::VectorOperations vop(core::ExecParams::defaultInstance(), this->getContext());\n MultiVecDeriv dx(&vop, core::VecDerivId::dx() ); dx.realloc( &vop, true, true );\n MultiVecDeriv df(&vop, core::VecDerivId::dforce() ); df.realloc( &vop, true, true );\n }\n\n\n\n\n getContext()->get(constraintSolver, core::objectmodel::BaseContext::SearchDown);\n if (constraintSolver == NULL && defaultSolver != NULL)\n {\n serr << \"No ConstraintSolver found, using default LCPConstraintSolver\" << sendl;\n this->getContext()->addObject(defaultSolver);\n constraintSolver = defaultSolver.get();\n defaultSolver = NULL;\n }\n else\n {\n defaultSolver.reset();\n }\n}\n\n\nvoid FreeMotionAnimationLoop::step(const sofa::core::ExecParams* params, SReal dt)\n{\n if (dt == 0)\n dt = this->gnode->getDt();\n\n\n double startTime = this->gnode->getTime();\n\n simulation::common::VectorOperations vop(params, this->getContext());\n simulation::common::MechanicalOperations mop(params, this->getContext());\n\n MultiVecCoord pos(&vop, core::VecCoordId::position() );\n MultiVecDeriv vel(&vop, core::VecDerivId::velocity() );\n MultiVecCoord freePos(&vop, core::VecCoordId::freePosition() );\n MultiVecDeriv freeVel(&vop, core::VecDerivId::freeVelocity() );\n\n {\n MultiVecDeriv dx(&vop, core::VecDerivId::dx() ); dx.realloc( &vop, true, true );\n MultiVecDeriv df(&vop, core::VecDerivId::dforce() ); df.realloc( &vop, true, true );\n }\n\n \/\/ This solver will work in freePosition and freeVelocity vectors.\n \/\/ We need to initialize them if it's not already done.\n sofa::helper::AdvancedTimer::stepBegin(\"MechanicalVInitVisitor\");\n simulation::MechanicalVInitVisitor< core::V_COORD >(params, core::VecCoordId::freePosition(), core::ConstVecCoordId::position(), true).execute(this->gnode);\n simulation::MechanicalVInitVisitor< core::V_DERIV >(params, core::VecDerivId::freeVelocity(), core::ConstVecDerivId::velocity(), true).execute(this->gnode);\n\n sofa::helper::AdvancedTimer::stepEnd(\"MechanicalVInitVisitor\");\n\n\n#ifdef SOFA_DUMP_VISITOR_INFO\n simulation::Visitor::printNode(\"Step\");\n#endif\n\n {\n sofa::helper::AdvancedTimer::stepBegin(\"AnimateBeginEvent\");\n AnimateBeginEvent ev ( dt );\n PropagateEventVisitor act ( params, &ev );\n this->gnode->execute ( act );\n sofa::helper::AdvancedTimer::stepEnd(\"AnimateBeginEvent\");\n }\n\n BehaviorUpdatePositionVisitor beh(params , dt);\n\n using helper::system::thread::CTime;\n using sofa::helper::AdvancedTimer;\n\n double time = 0.0;\n \/\/double timeTotal = 0.0;\n double timeScale = 1000.0 \/ (double)CTime::getTicksPerSec();\n\n if (displayTime.getValue())\n {\n time = (double) CTime::getTime();\n \/\/timeTotal = (double) CTime::getTime();\n }\n\n \/\/ Update the BehaviorModels\n \/\/ Required to allow the RayPickInteractor interaction\n if (f_printLog.getValue())\n serr << \"updatePos called\" << sendl;\n\n AdvancedTimer::stepBegin(\"UpdatePosition\");\n this->gnode->execute(&beh);\n AdvancedTimer::stepEnd(\"UpdatePosition\");\n\n if (f_printLog.getValue())\n serr << \"updatePos performed - beginVisitor called\" << sendl;\n\n simulation::MechanicalBeginIntegrationVisitor beginVisitor(params, dt);\n this->gnode->execute(&beginVisitor);\n\n if (f_printLog.getValue())\n serr << \"beginVisitor performed - SolveVisitor for freeMotion is called\" << sendl;\n\n \/\/ Free Motion\n AdvancedTimer::stepBegin(\"FreeMotion\");\n simulation::SolveVisitor freeMotion(params, dt, true);\n this->gnode->execute(&freeMotion);\n AdvancedTimer::stepEnd(\"FreeMotion\");\n\n mop.propagateXAndV(freePos, freeVel, true); \/\/ apply projective constraints\n\n if (f_printLog.getValue())\n serr << \" SolveVisitor for freeMotion performed\" << sendl;\n\n if (displayTime.getValue())\n {\n sout << \" >>>>> Begin display FreeMotionAnimationLoop time\" << sendl;\n sout <<\" Free Motion \" << ((double)CTime::getTime() - time) * timeScale << \" ms\" << sendl;\n\n time = (double)CTime::getTime();\n }\n\n \/\/ Collision detection and response creation\n AdvancedTimer::stepBegin(\"Collision\");\n computeCollision(params);\n AdvancedTimer::stepEnd (\"Collision\");\n\n mop.propagateX(pos, false); \/\/ Why is this done at that point ???\n\n if (displayTime.getValue())\n {\n sout << \" computeCollision \" << ((double) CTime::getTime() - time) * timeScale << \" ms\" << sendl;\n time = (double)CTime::getTime();\n }\n\n \/\/ Solve constraints\n if (constraintSolver)\n {\n AdvancedTimer::stepBegin(\"ConstraintSolver\");\n\n if (m_solveVelocityConstraintFirst.getValue())\n {\n core::ConstraintParams cparams(*params);\n cparams.setX(freePos);\n cparams.setV(freeVel);\n\n cparams.setOrder(core::ConstraintParams::VEL);\n constraintSolver->solveConstraint(&cparams, vel);\n\n MultiVecDeriv dv(&vop, constraintSolver->getDx());\n mop.projectResponse(dv);\n mop.propagateDx(dv);\n\n \/\/ xfree += dv * dt\n freePos.eq(freePos, dv, dt);\n mop.propagateX(freePos, false); \/\/ ignore projective constraints\n\n cparams.setOrder(core::ConstraintParams::POS);\n constraintSolver->solveConstraint(&cparams, pos);\n\n MultiVecDeriv dx(&vop, constraintSolver->getDx());\n\n mop.propagateV(vel, true); \/\/ apply projective constraints\n mop.projectResponse(dx);\n mop.propagateDx(dx, true);\n\n \/\/ \"mapped\" x = xfree + dx\n simulation::MechanicalVOpVisitor(params, pos, freePos, dx, 1.0 ).setOnlyMapped(true).execute(this->gnode);\n }\n else\n {\n core::ConstraintParams cparams(*params);\n cparams.setX(freePos);\n cparams.setV(freeVel);\n\n constraintSolver->solveConstraint(&cparams, pos, vel);\n mop.propagateV(vel, true); \/\/ apply projective constraints\n\n MultiVecDeriv dx(&vop, constraintSolver->getDx());\n mop.projectResponse(dx);\n mop.propagateDx(dx, true);\n\n \/\/ \"mapped\" x = xfree + dx\n simulation::MechanicalVOpVisitor(params, pos, freePos, dx, 1.0 ).setOnlyMapped(true).execute(this->gnode);\n }\n AdvancedTimer::stepEnd(\"ConstraintSolver\");\n\n }\n\n if ( displayTime.getValue() )\n {\n sout << \" contactCorrections \" << ((double)CTime::getTime() - time) * timeScale << \" ms\" <<sendl;\n sout << \"<<<<<< End display FreeMotionAnimationLoop time.\" << sendl;\n }\n\n simulation::MechanicalEndIntegrationVisitor endVisitor(params, dt);\n this->gnode->execute(&endVisitor);\n\n this->gnode->setTime ( startTime + dt );\n this->gnode->execute<UpdateSimulationContextVisitor>(params); \/\/ propagate time\n\n {\n AnimateEndEvent ev ( dt );\n PropagateEventVisitor act ( params, &ev );\n this->gnode->execute ( act );\n }\n\n\n sofa::helper::AdvancedTimer::stepBegin(\"UpdateMapping\");\n \/\/Visual Information update: Ray Pick add a MechanicalMapping used as VisualMapping\n this->gnode->execute<UpdateMappingVisitor>(params);\n\/\/\tsofa::helper::AdvancedTimer::step(\"UpdateMappingEndEvent\");\n {\n UpdateMappingEndEvent ev ( dt );\n PropagateEventVisitor act ( params , &ev );\n this->gnode->execute ( act );\n }\n sofa::helper::AdvancedTimer::stepEnd(\"UpdateMapping\");\n\n#ifndef SOFA_NO_UPDATE_BBOX\n sofa::helper::AdvancedTimer::stepBegin(\"UpdateBBox\");\n this->gnode->execute<UpdateBoundingBoxVisitor>(params);\n sofa::helper::AdvancedTimer::stepEnd(\"UpdateBBox\");\n#endif\n#ifdef SOFA_DUMP_VISITOR_INFO\n simulation::Visitor::printCloseNode(\"Step\");\n#endif\n\n}\n\n\nSOFA_DECL_CLASS(FreeMotionAnimationLoop)\n\nint FreeMotionAnimationLoopClass = core::RegisterObject(\"Constraint solver\")\n .add< FreeMotionAnimationLoop >()\n .addAlias(\"FreeMotionMasterSolver\")\n ;\n\n} \/\/ namespace animationloop\n\n} \/\/ namespace component\n\n} \/\/ namespace sofa\n<|endoftext|>"} {"text":"<commit_before>\/\/\tMIT License\n\/\/\n\/\/\tCopyright (c) 2016 Fabian Lschner\n\/\/\n\/\/\tPermission is hereby granted, free of charge, to any person obtaining a copy\n\/\/\tof this software and associated documentation files (the \"Software\"), to deal\n\/\/\tin the Software without restriction, including without limitation the rights\n\/\/\tto use, copy, modify, merge, publish, distribute, sublicense, and\/or sell\n\/\/\tcopies of the Software, and to permit persons to whom the Software is\n\/\/\tfurnished to do so, subject to the following conditions:\n\/\/\n\/\/\tThe above copyright notice and this permission notice shall be included in all\n\/\/\tcopies or substantial portions of the Software.\n\/\/\n\/\/\tTHE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\n\/\/\tIMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\n\/\/\tFITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE\n\/\/\tAUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\n\/\/\tLIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,\n\/\/\tOUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE\n\/\/\tSOFTWARE.\n\n#include <noname_tools\\tools>\n\n#include \"catch.hpp\"\n\n#include <string>\n#include <type_traits>\n\nusing namespace noname;\n\n\/\/ TODO: Test if void_t really works for its intended use case\n\nTEST_CASE(\"Testing typetraits\")\n{\n\tSECTION(\"Testing void_t\")\n\t{\n\t\tREQUIRE((std::is_same<tools::void_t<bool, int, double>, void>::value == true));\n\t}\n\n\tSECTION(\"Testing bool_constant\")\n\t{\n\t\tREQUIRE((tools::bool_constant<true>::value == true));\n\t\tREQUIRE((tools::bool_constant<false>::value == false));\n\t}\n\n\tSECTION(\"Testing negation\")\n\t{\n\t\tREQUIRE((tools::negation<std::true_type>::value == false));\n\t\tREQUIRE((tools::negation<std::false_type>::value == true));\n\t}\n\n\tSECTION(\"Testing conjunction\")\n\t{\n\t\tREQUIRE((tools::conjunction<std::true_type, std::true_type>::value == true));\n\t\tREQUIRE((tools::conjunction<std::false_type, std::true_type>::value == false));\n\t\tREQUIRE((tools::conjunction<std::true_type, std::false_type>::value == false));\n\t\tREQUIRE((tools::conjunction<std::false_type, std::false_type>::value == false));\n\t\tREQUIRE((tools::conjunction<std::true_type, std::true_type, std::true_type>::value == true));\n\t\tREQUIRE((tools::conjunction<std::true_type, std::true_type, std::false_type>::value == false));\n\t\tREQUIRE((tools::conjunction<std::false_type, std::false_type, std::true_type>::value == false));\n\t\tREQUIRE((tools::disjunction<std::false_type, std::false_type, std::false_type>::value == false));\n\t}\n\n\tSECTION(\"Testing disjunction\")\n\t{\n\t\tREQUIRE((tools::disjunction<std::true_type, std::true_type>::value == true));\n\t\tREQUIRE((tools::disjunction<std::false_type, std::true_type>::value == true));\n\t\tREQUIRE((tools::disjunction<std::true_type, std::false_type>::value == true));\n\t\tREQUIRE((tools::disjunction<std::false_type, std::false_type>::value == false));\n\t\tREQUIRE((tools::disjunction<std::true_type, std::true_type, std::true_type>::value == true));\n\t\tREQUIRE((tools::disjunction<std::true_type, std::true_type, std::false_type>::value == true));\n\t\tREQUIRE((tools::disjunction<std::false_type, std::false_type, std::true_type>::value == true));\n\t\tREQUIRE((tools::disjunction<std::false_type, std::false_type, std::false_type>::value == false));\n\t}\n\n\tSECTION(\"Testing is_referenceable\")\n\t{\n\t\tREQUIRE((tools::is_referenceable<double>::value == true));\n\t\tREQUIRE((tools::is_referenceable<double&>::value == true));\n\t\tREQUIRE((tools::is_referenceable<void>::value == false));\n\t}\n\n\tSECTION(\"Testing is_swappable\")\n\t{\n\t\tREQUIRE((tools::is_swappable_with<double, double>::value == true));\n\t\tREQUIRE((tools::is_swappable_with<double, void>::value == false));\n\n\t\tREQUIRE((tools::is_swappable<double>::value == true));\n\t\tREQUIRE((tools::is_swappable<void>::value == false));\n\t}\n}\n\nTEST_CASE(\"Testing utility types\")\n{\n\tREQUIRE((std::is_same<tools::nth_element_t<0, int, void, double>, int>::value == true));\n\tREQUIRE((std::is_same<tools::nth_element_t<1, int, void, double>, void>::value == true));\n\tREQUIRE((std::is_same<tools::nth_element_t<2, int, void, double>, double>::value == true));\n\n\tREQUIRE((tools::element_index_v<int, int, double, void> == 0));\n\tREQUIRE((tools::element_index_v<double, int, double, void> == 1));\n\tREQUIRE((tools::element_index_v<void, int, double, void> == 2));\n\tREQUIRE((tools::element_index_v<std::string, int, double, void> == tools::element_not_found));\n\n\tREQUIRE((tools::count_element_v<int, void, double, int, int, char, int> == 3));\n\tREQUIRE((tools::count_element_v<int> == 0));\n\n\tREQUIRE((tools::unique_types_v<int, double, char> == true));\n\tREQUIRE((tools::unique_types_v<int, double, int, char> == false));\n\tREQUIRE((tools::unique_types_v<int> == true));\n\tREQUIRE((tools::unique_types_v<> == false));\n\tREQUIRE((tools::unique_types_v<void, double> == true));\n}\n<commit_msg>Added unique_elements test<commit_after>\/\/\tMIT License\n\/\/\n\/\/\tCopyright (c) 2016 Fabian Lschner\n\/\/\n\/\/\tPermission is hereby granted, free of charge, to any person obtaining a copy\n\/\/\tof this software and associated documentation files (the \"Software\"), to deal\n\/\/\tin the Software without restriction, including without limitation the rights\n\/\/\tto use, copy, modify, merge, publish, distribute, sublicense, and\/or sell\n\/\/\tcopies of the Software, and to permit persons to whom the Software is\n\/\/\tfurnished to do so, subject to the following conditions:\n\/\/\n\/\/\tThe above copyright notice and this permission notice shall be included in all\n\/\/\tcopies or substantial portions of the Software.\n\/\/\n\/\/\tTHE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\n\/\/\tIMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\n\/\/\tFITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE\n\/\/\tAUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\n\/\/\tLIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,\n\/\/\tOUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE\n\/\/\tSOFTWARE.\n\n#include <noname_tools\\tools>\n\n#include \"catch.hpp\"\n\n#include <string>\n#include <type_traits>\n\nusing namespace noname;\n\n\/\/ TODO: Test if void_t really works for its intended use case\n\nTEST_CASE(\"Testing typetraits\")\n{\n\tSECTION(\"Testing void_t\")\n\t{\n\t\tREQUIRE((std::is_same<tools::void_t<bool, int, double>, void>::value == true));\n\t}\n\n\tSECTION(\"Testing bool_constant\")\n\t{\n\t\tREQUIRE((tools::bool_constant<true>::value == true));\n\t\tREQUIRE((tools::bool_constant<false>::value == false));\n\t}\n\n\tSECTION(\"Testing negation\")\n\t{\n\t\tREQUIRE((tools::negation<std::true_type>::value == false));\n\t\tREQUIRE((tools::negation<std::false_type>::value == true));\n\t}\n\n\tSECTION(\"Testing conjunction\")\n\t{\n\t\tREQUIRE((tools::conjunction<std::true_type, std::true_type>::value == true));\n\t\tREQUIRE((tools::conjunction<std::false_type, std::true_type>::value == false));\n\t\tREQUIRE((tools::conjunction<std::true_type, std::false_type>::value == false));\n\t\tREQUIRE((tools::conjunction<std::false_type, std::false_type>::value == false));\n\t\tREQUIRE((tools::conjunction<std::true_type, std::true_type, std::true_type>::value == true));\n\t\tREQUIRE((tools::conjunction<std::true_type, std::true_type, std::false_type>::value == false));\n\t\tREQUIRE((tools::conjunction<std::false_type, std::false_type, std::true_type>::value == false));\n\t\tREQUIRE((tools::disjunction<std::false_type, std::false_type, std::false_type>::value == false));\n\t}\n\n\tSECTION(\"Testing disjunction\")\n\t{\n\t\tREQUIRE((tools::disjunction<std::true_type, std::true_type>::value == true));\n\t\tREQUIRE((tools::disjunction<std::false_type, std::true_type>::value == true));\n\t\tREQUIRE((tools::disjunction<std::true_type, std::false_type>::value == true));\n\t\tREQUIRE((tools::disjunction<std::false_type, std::false_type>::value == false));\n\t\tREQUIRE((tools::disjunction<std::true_type, std::true_type, std::true_type>::value == true));\n\t\tREQUIRE((tools::disjunction<std::true_type, std::true_type, std::false_type>::value == true));\n\t\tREQUIRE((tools::disjunction<std::false_type, std::false_type, std::true_type>::value == true));\n\t\tREQUIRE((tools::disjunction<std::false_type, std::false_type, std::false_type>::value == false));\n\t}\n\n\tSECTION(\"Testing is_referenceable\")\n\t{\n\t\tREQUIRE((tools::is_referenceable<double>::value == true));\n\t\tREQUIRE((tools::is_referenceable<double&>::value == true));\n\t\tREQUIRE((tools::is_referenceable<void>::value == false));\n\t}\n\n\tSECTION(\"Testing is_swappable\")\n\t{\n\t\tREQUIRE((tools::is_swappable_with<double, double>::value == true));\n\t\tREQUIRE((tools::is_swappable_with<double, void>::value == false));\n\n\t\tREQUIRE((tools::is_swappable<double>::value == true));\n\t\tREQUIRE((tools::is_swappable<void>::value == false));\n\t}\n}\n\nTEST_CASE(\"Testing utility types\")\n{\n\tREQUIRE((std::is_same<tools::nth_element_t<0, int, void, double>, int>::value == true));\n\tREQUIRE((std::is_same<tools::nth_element_t<1, int, void, double>, void>::value == true));\n\tREQUIRE((std::is_same<tools::nth_element_t<2, int, void, double>, double>::value == true));\n\n\tREQUIRE((tools::element_index_v<int, int, double, void> == 0));\n\tREQUIRE((tools::element_index_v<double, int, double, void> == 1));\n\tREQUIRE((tools::element_index_v<void, int, double, void> == 2));\n\tREQUIRE((tools::element_index_v<std::string, int, double, void> == tools::element_not_found));\n\n\tREQUIRE((tools::count_element_v<int, void, double, int, int, char, int> == 3));\n\tREQUIRE((tools::count_element_v<int> == 0));\n\n\tREQUIRE((tools::unique_elements_v<int, double, char> == true));\n\tREQUIRE((tools::unique_elements_v<int, double, int, char> == false));\n\tREQUIRE((tools::unique_elements_v<int> == true));\n\tREQUIRE((tools::unique_elements_v<> == false));\n\tREQUIRE((tools::unique_elements_v<void, double> == true));\n}\n<|endoftext|>"} {"text":"<commit_before><commit_msg>Fixes the issue when right clicking on a text in a scrolled text area results in the wrong word being selected. The solution seems to lie in a tricky webkit hack, which requires the use of point() and localPoint() in different situations.<commit_after><|endoftext|>"} {"text":"<commit_before>\/\/ Copyright (c) 2009 The Chromium Authors. All rights reserved.\n\/\/ Use of this source code is governed by a BSD-style license that can be\n\/\/ found in the LICENSE file.\n\n#include \"webkit\/glue\/plugins\/plugin_lib.h\"\n\n#include <dlfcn.h>\n\n#include \"base\/string_util.h\"\n#include \"base\/sys_string_conversions.h\"\n#include \"webkit\/glue\/plugins\/plugin_list.h\"\n\n\/\/ These headers must be included in this order to make the declaration gods\n\/\/ happy.\n#include \"base\/third_party\/nspr\/prcpucfg_linux.h\"\n#include \"third_party\/mozilla\/include\/nsplugindefs.h\"\n\nnamespace NPAPI {\n\nbool PluginLib::ReadWebPluginInfo(const FilePath& filename,\n WebPluginInfo* info) {\n \/\/ The file to reference is:\n \/\/ http:\/\/mxr.mozilla.org\/firefox\/source\/modules\/plugin\/base\/src\/nsPluginsDirUnix.cpp\n\n void* dl = base::LoadNativeLibrary(filename);\n if (!dl)\n return false;\n\n info->path = filename;\n\n \/\/ See comments in plugin_lib_mac regarding this symbol.\n typedef const char* (*NP_GetMimeDescriptionType)();\n NP_GetMimeDescriptionType NP_GetMIMEDescription =\n reinterpret_cast<NP_GetMimeDescriptionType>(\n dlsym(dl, \"NP_GetMIMEDescription\"));\n const char* mime_description = NULL;\n if (NP_GetMIMEDescription)\n mime_description = NP_GetMIMEDescription();\n\n if (mime_description) {\n \/\/ We parse the description here into WebPluginMimeType structures.\n \/\/ Description for Flash 10 looks like (all as one string):\n \/\/ \"application\/x-shockwave-flash:swf:Shockwave Flash;\"\n \/\/ \"application\/futuresplash:spl:FutureSplash Player\"\n std::vector<std::string> descriptions;\n SplitString(mime_description, ';', &descriptions);\n for (size_t i = 0; i < descriptions.size(); ++i) {\n std::vector<std::string> fields;\n SplitString(descriptions[i], ':', &fields);\n if (fields.size() != 3) {\n LOG(WARNING) << \"Couldn't parse plugin info: \" << descriptions[i];\n continue;\n }\n\n WebPluginMimeType mime_type;\n mime_type.mime_type = fields[0];\n SplitString(fields[1], ',', &mime_type.file_extensions);\n mime_type.description = ASCIIToWide(fields[2]);\n info->mime_types.push_back(mime_type);\n }\n }\n\n \/\/ The plugin name and description live behind NP_GetValue calls.\n typedef NPError (*NP_GetValueType)(void* unused,\n nsPluginVariable variable,\n void* value_out);\n NP_GetValueType NP_GetValue =\n reinterpret_cast<NP_GetValueType>(dlsym(dl, \"NP_GetValue\"));\n if (NP_GetValue) {\n const char* name = NULL;\n NP_GetValue(NULL, nsPluginVariable_NameString, &name);\n if (name)\n info->name = ASCIIToWide(name);\n\n const char* description = NULL;\n NP_GetValue(NULL, nsPluginVariable_DescriptionString, &description);\n if (description)\n info->desc = ASCIIToWide(description);\n }\n\n return true;\n}\n\n} \/\/ namespace NPAPI\n<commit_msg>linux plugins: assume UTF-8 for plugin name\/description<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 \"webkit\/glue\/plugins\/plugin_lib.h\"\n\n#include <dlfcn.h>\n\n#include \"base\/string_util.h\"\n#include \"base\/sys_string_conversions.h\"\n#include \"webkit\/glue\/plugins\/plugin_list.h\"\n\n\/\/ These headers must be included in this order to make the declaration gods\n\/\/ happy.\n#include \"base\/third_party\/nspr\/prcpucfg_linux.h\"\n#include \"third_party\/mozilla\/include\/nsplugindefs.h\"\n\nnamespace NPAPI {\n\nbool PluginLib::ReadWebPluginInfo(const FilePath& filename,\n WebPluginInfo* info) {\n \/\/ The file to reference is:\n \/\/ http:\/\/mxr.mozilla.org\/firefox\/source\/modules\/plugin\/base\/src\/nsPluginsDirUnix.cpp\n\n void* dl = base::LoadNativeLibrary(filename);\n if (!dl)\n return false;\n\n info->path = filename;\n\n \/\/ See comments in plugin_lib_mac regarding this symbol.\n typedef const char* (*NP_GetMimeDescriptionType)();\n NP_GetMimeDescriptionType NP_GetMIMEDescription =\n reinterpret_cast<NP_GetMimeDescriptionType>(\n dlsym(dl, \"NP_GetMIMEDescription\"));\n const char* mime_description = NULL;\n if (NP_GetMIMEDescription)\n mime_description = NP_GetMIMEDescription();\n\n if (mime_description) {\n \/\/ We parse the description here into WebPluginMimeType structures.\n \/\/ Description for Flash 10 looks like (all as one string):\n \/\/ \"application\/x-shockwave-flash:swf:Shockwave Flash;\"\n \/\/ \"application\/futuresplash:spl:FutureSplash Player\"\n std::vector<std::string> descriptions;\n SplitString(mime_description, ';', &descriptions);\n for (size_t i = 0; i < descriptions.size(); ++i) {\n if (descriptions[i].empty())\n continue; \/\/ Don't warn if they have trailing semis.\n\n std::vector<std::string> fields;\n SplitString(descriptions[i], ':', &fields);\n if (fields.size() != 3) {\n LOG(WARNING) << \"Couldn't parse plugin info: \" << descriptions[i];\n continue;\n }\n\n WebPluginMimeType mime_type;\n mime_type.mime_type = fields[0];\n SplitString(fields[1], ',', &mime_type.file_extensions);\n mime_type.description = ASCIIToWide(fields[2]);\n info->mime_types.push_back(mime_type);\n }\n }\n\n \/\/ The plugin name and description live behind NP_GetValue calls.\n typedef NPError (*NP_GetValueType)(void* unused,\n nsPluginVariable variable,\n void* value_out);\n NP_GetValueType NP_GetValue =\n reinterpret_cast<NP_GetValueType>(dlsym(dl, \"NP_GetValue\"));\n if (NP_GetValue) {\n const char* name = NULL;\n NP_GetValue(NULL, nsPluginVariable_NameString, &name);\n if (name)\n info->name = UTF8ToWide(name);\n\n const char* description = NULL;\n NP_GetValue(NULL, nsPluginVariable_DescriptionString, &description);\n if (description)\n info->desc = UTF8ToWide(description);\n }\n\n return true;\n}\n\n} \/\/ namespace NPAPI\n<|endoftext|>"} {"text":"<commit_before>#include \"RenderSystem\/Managers\/CBackBufferManager.h\"\n\nnamespace VKE\n{\n namespace RenderSystem\n {\n namespace Managers\n {\n CBackBufferManager::CBackBufferManager( CGraphicsContext* pCtx ) :\n m_pCtx( pCtx )\n {\n\n }\n\n CBackBufferManager::~CBackBufferManager()\n {\n _Destroy();\n }\n\n void CBackBufferManager::_Destroy()\n {\n\n }\n\n void CBackBufferManager::Destroy()\n {\n\n }\n\n Result CBackBufferManager::Create(const SBackBufferManagerDesc& Desc)\n {\n Result res = VKE_OK;\n m_Desc = Desc;\n m_backBufferCount = static_cast< uint32_t >( m_Desc.backBufferCount );\n return res;\n }\n\n uint32_t CBackBufferManager::AcquireNextBuffer()\n {\n uint16_t currIdx = m_currBackBufferIndex;\n m_currBackBufferIndex = currIdx % m_backBufferCount;\n return m_currBackBufferIndex;\n }\n\n uint32_t CBackBufferManager::AddCustomData(uint8_t* aData, uint32_t elementSize)\n {\n uint32_t idx = m_customDataIdx++;\n \/\/auto& Data = m_BackBuffers.aCustomData;\n uint8_t* pCurrPtr = aData;\n for( uint32_t i = 0; i < m_backBufferCount; ++i )\n {\n \/\/idx = Data[ i ].PushBack( pCurrPtr );\n m_BackBuffers[ i ].CustomData.insert( { idx, pCurrPtr } );\n pCurrPtr += elementSize;\n }\n return idx;\n }\n\n void CBackBufferManager::UpdateCustomData(uint32_t backBufferIdx, uint32_t dataIdx, void* pData)\n {\n m_BackBuffers[ backBufferIdx ].CustomData[ dataIdx ] = pData;\n }\n\n void CBackBufferManager::UpdateCustomData(uint32_t dataIdx, uint8_t* aData, uint32_t elementSize)\n {\n uint8_t* pCurrPtr = aData;\n for( uint32_t i = 0; i < m_backBufferCount; ++i )\n {\n m_BackBuffers[ i ].CustomData[ dataIdx ] = pCurrPtr;\n pCurrPtr += elementSize;\n }\n }\n\n void* CBackBufferManager::GetCustomData(uint32_t idx)\n {\n return m_BackBuffers[ m_currBackBufferIndex ].CustomData[ idx ];\n }\n\n } \/\/ Managers\n } \/\/ RenderSystem\n} \/\/ VKE<commit_msg>back buffer idx fix<commit_after>#include \"RenderSystem\/Managers\/CBackBufferManager.h\"\n\nnamespace VKE\n{\n namespace RenderSystem\n {\n namespace Managers\n {\n CBackBufferManager::CBackBufferManager( CGraphicsContext* pCtx ) :\n m_pCtx( pCtx )\n {\n\n }\n\n CBackBufferManager::~CBackBufferManager()\n {\n _Destroy();\n }\n\n void CBackBufferManager::_Destroy()\n {\n\n }\n\n void CBackBufferManager::Destroy()\n {\n\n }\n\n Result CBackBufferManager::Create(const SBackBufferManagerDesc& Desc)\n {\n Result res = VKE_OK;\n m_Desc = Desc;\n m_backBufferCount = static_cast< uint32_t >( m_Desc.backBufferCount );\n return res;\n }\n\n uint32_t CBackBufferManager::AcquireNextBuffer()\n {\n const uint16_t currIdx = m_currBackBufferIndex;\n m_currBackBufferIndex = ( currIdx + 1 ) % m_backBufferCount;\n return m_currBackBufferIndex;\n }\n\n uint32_t CBackBufferManager::AddCustomData(uint8_t* aData, uint32_t elementSize)\n {\n uint32_t idx = m_customDataIdx++;\n \/\/auto& Data = m_BackBuffers.aCustomData;\n uint8_t* pCurrPtr = aData;\n for( uint32_t i = 0; i < m_backBufferCount; ++i )\n {\n \/\/idx = Data[ i ].PushBack( pCurrPtr );\n m_BackBuffers[ i ].CustomData.insert( { idx, pCurrPtr } );\n pCurrPtr += elementSize;\n }\n return idx;\n }\n\n void CBackBufferManager::UpdateCustomData(uint32_t backBufferIdx, uint32_t dataIdx, void* pData)\n {\n m_BackBuffers[ backBufferIdx ].CustomData[ dataIdx ] = pData;\n }\n\n void CBackBufferManager::UpdateCustomData(uint32_t dataIdx, uint8_t* aData, uint32_t elementSize)\n {\n uint8_t* pCurrPtr = aData;\n for( uint32_t i = 0; i < m_backBufferCount; ++i )\n {\n m_BackBuffers[ i ].CustomData[ dataIdx ] = pCurrPtr;\n pCurrPtr += elementSize;\n }\n }\n\n void* CBackBufferManager::GetCustomData(uint32_t idx)\n {\n return m_BackBuffers[ m_currBackBufferIndex ].CustomData[ idx ];\n }\n\n } \/\/ Managers\n } \/\/ RenderSystem\n} \/\/ VKE<|endoftext|>"} {"text":"<commit_before>0899c7fc-2e4d-11e5-9284-b827eb9e62be<commit_msg>089ed936-2e4d-11e5-9284-b827eb9e62be<commit_after>089ed936-2e4d-11e5-9284-b827eb9e62be<|endoftext|>"} {"text":"<commit_before><commit_msg>#i10000# #i81592# warnings = errors<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 \"webkit\/glue\/plugins\/plugin_lib.h\"\n\n#include <dlfcn.h>\n#if defined(OS_OPENBSD)\n#include <sys\/exec_elf.h>\n#else\n#include <elf.h>\n#include <fcntl.h>\n#endif\n#include <sys\/stat.h>\n#include <sys\/types.h>\n#include <unistd.h>\n\n#include \"base\/eintr_wrapper.h\"\n#include \"base\/file_util.h\"\n#include \"base\/string_split.h\"\n#include \"base\/string_util.h\"\n#include \"base\/sys_string_conversions.h\"\n#include \"base\/utf_string_conversions.h\"\n#include \"webkit\/glue\/plugins\/plugin_list.h\"\n\n\/\/ These headers must be included in this order to make the declaration gods\n\/\/ happy.\n#include \"base\/third_party\/nspr\/prcpucfg_linux.h\"\n\nnamespace {\n\nusing NPAPI::PluginList;\n\n\/\/ Copied from nsplugindefs.h instead of including the file since it has a bunch\n\/\/ of dependencies.\nenum nsPluginVariable {\n nsPluginVariable_NameString = 1,\n nsPluginVariable_DescriptionString = 2\n};\n\n\/\/ Read the ELF header and return true if it is usable on\n\/\/ the current architecture (e.g. 32-bit ELF on 32-bit build).\n\/\/ Returns false on other errors as well.\nbool ELFMatchesCurrentArchitecture(const FilePath& filename) {\n \/\/ First make sure we can open the file and it is in fact, a regular file.\n struct stat stat_buf;\n \/\/ Open with O_NONBLOCK so we don't block on pipes.\n int fd = open(filename.value().c_str(), O_RDONLY|O_NONBLOCK);\n if (fd < 0)\n return false;\n bool ret = (fstat(fd, &stat_buf) >= 0 && S_ISREG(stat_buf.st_mode));\n if (HANDLE_EINTR(close(fd)) < 0)\n return false;\n if (!ret)\n return false;\n\n const size_t kELFBufferSize = 5;\n char buffer[kELFBufferSize];\n if (!file_util::ReadFile(filename, buffer, kELFBufferSize))\n return false;\n\n if (buffer[0] != ELFMAG0 ||\n buffer[1] != ELFMAG1 ||\n buffer[2] != ELFMAG2 ||\n buffer[3] != ELFMAG3) {\n \/\/ Not an ELF file, perhaps?\n return false;\n }\n\n int elf_class = buffer[EI_CLASS];\n#if defined(ARCH_CPU_32_BITS)\n if (elf_class == ELFCLASS32)\n return true;\n#elif defined(ARCH_CPU_64_BITS)\n if (elf_class == ELFCLASS64)\n return true;\n#endif\n\n return false;\n}\n\n\/\/ This structure matches enough of nspluginwrapper's NPW_PluginInfo\n\/\/ for us to extract the real plugin path.\nstruct __attribute__((packed)) NSPluginWrapperInfo {\n char ident[32]; \/\/ NSPluginWrapper magic identifier (includes version).\n char path[PATH_MAX]; \/\/ Path to wrapped plugin.\n};\n\n\/\/ Test a plugin for whether it's been wrapped by NSPluginWrapper, and\n\/\/ if so attempt to unwrap it. Pass in an opened plugin handle; on\n\/\/ success, |dl| and |unwrapped_path| will be filled in with the newly\n\/\/ opened plugin. On failure, params are left unmodified.\nvoid UnwrapNSPluginWrapper(void **dl, FilePath* unwrapped_path) {\n NSPluginWrapperInfo* info =\n reinterpret_cast<NSPluginWrapperInfo*>(dlsym(*dl, \"NPW_Plugin\"));\n if (!info)\n return; \/\/ Not a NSPW plugin.\n\n \/\/ Here we could check the NSPW ident field for the versioning\n \/\/ information, but the path field is available in all versions\n \/\/ anyway.\n\n \/\/ Grab the path to the wrapped plugin. Just in case the structure\n \/\/ format changes, protect against the path not being null-terminated.\n char* path_end = static_cast<char*>(memchr(info->path, '\\0',\n sizeof(info->path)));\n if (!path_end)\n path_end = info->path + sizeof(info->path);\n FilePath path = FilePath(std::string(info->path, path_end - info->path));\n\n if (!ELFMatchesCurrentArchitecture(path)) {\n LOG(WARNING) << path.value() << \" is nspluginwrapper wrapping a \"\n << \"plugin for a different architecture; it will \"\n << \"work better if you instead use a native plugin.\";\n return;\n }\n\n void* newdl = base::LoadNativeLibrary(path);\n if (!newdl) {\n \/\/ We couldn't load the unwrapped plugin for some reason, despite\n \/\/ being able to load the wrapped one. Just use the wrapped one.\n LOG_IF(ERROR, PluginList::DebugPluginLoading())\n << \"Could not use unwrapped nspluginwrapper plugin \"\n << unwrapped_path->value() << \", using the wrapped one.\";\n return;\n }\n\n \/\/ Unload the wrapped plugin, and use the wrapped plugin instead.\n LOG_IF(ERROR, PluginList::DebugPluginLoading())\n << \"Using unwrapped version \" << unwrapped_path->value()\n << \" of nspluginwrapper-wrapped plugin.\";\n base::UnloadNativeLibrary(*dl);\n *dl = newdl;\n *unwrapped_path = path;\n}\n\n} \/\/ anonymous namespace\n\nnamespace NPAPI {\n\nbool PluginLib::ReadWebPluginInfo(const FilePath& filename,\n WebPluginInfo* info) {\n \/\/ The file to reference is:\n \/\/ http:\/\/mxr.mozilla.org\/firefox\/source\/modules\/plugin\/base\/src\/nsPluginsDirUnix.cpp\n\n \/\/ Skip files that aren't appropriate for our architecture.\n if (!ELFMatchesCurrentArchitecture(filename)) {\n LOG_IF(ERROR, PluginList::DebugPluginLoading())\n << \"Skipping plugin \" << filename.value()\n << \" because it doesn't match the current architecture.\";\n return false;\n }\n\n \/\/ TODO(thestig) This is for debugging bug 59317. Remove this when done.\n LOG(INFO) << \"PluginLib::ReadWebPluginInfo loading \" << filename.value();\n void* dl = base::LoadNativeLibrary(filename);\n if (!dl) {\n LOG_IF(ERROR, PluginList::DebugPluginLoading())\n << \"While reading plugin info, unable to load library \"\n << filename.value() << \", skipping.\";\n return false;\n }\n\n info->path = filename;\n info->enabled = true;\n\n \/\/ Attempt to swap in the wrapped plugin if this is nspluginwrapper.\n UnwrapNSPluginWrapper(&dl, &info->path);\n\n \/\/ See comments in plugin_lib_mac regarding this symbol.\n typedef const char* (*NP_GetMimeDescriptionType)();\n NP_GetMimeDescriptionType NP_GetMIMEDescription =\n reinterpret_cast<NP_GetMimeDescriptionType>(\n dlsym(dl, \"NP_GetMIMEDescription\"));\n const char* mime_description = NULL;\n if (NP_GetMIMEDescription)\n mime_description = NP_GetMIMEDescription();\n\n if (mime_description)\n ParseMIMEDescription(mime_description, &info->mime_types);\n\n \/\/ The plugin name and description live behind NP_GetValue calls.\n typedef NPError (*NP_GetValueType)(void* unused,\n nsPluginVariable variable,\n void* value_out);\n NP_GetValueType NP_GetValue =\n reinterpret_cast<NP_GetValueType>(dlsym(dl, \"NP_GetValue\"));\n if (NP_GetValue) {\n const char* name = NULL;\n NP_GetValue(NULL, nsPluginVariable_NameString, &name);\n if (name)\n info->name = UTF8ToUTF16(name);\n\n const char* description = NULL;\n NP_GetValue(NULL, nsPluginVariable_DescriptionString, &description);\n if (description)\n info->desc = UTF8ToUTF16(description);\n\n LOG_IF(ERROR, PluginList::DebugPluginLoading())\n << \"Got info for plugin \" << filename.value()\n << \" Name = \\\"\" << UTF16ToUTF8(info->name)\n << \"\\\", Description = \\\"\" << UTF16ToUTF8(info->desc) << \"\\\".\";\n } else {\n LOG_IF(ERROR, PluginList::DebugPluginLoading())\n << \"Plugin \" << filename.value()\n << \" has no GetValue() and probably won't work.\";\n }\n\n \/\/ Intentionally not unloading the plugin here, it can lead to crashes.\n\n return true;\n}\n\n\/\/ static\nvoid PluginLib::ParseMIMEDescription(\n const std::string& description,\n std::vector<WebPluginMimeType>* mime_types) {\n \/\/ We parse the description here into WebPluginMimeType structures.\n \/\/ Naively from the NPAPI docs you'd think you could use\n \/\/ string-splitting, but the Firefox parser turns out to do something\n \/\/ different: find the first colon, then the second, then a semi.\n \/\/\n \/\/ See ParsePluginMimeDescription near\n \/\/ http:\/\/mxr.mozilla.org\/firefox\/source\/modules\/plugin\/base\/src\/nsPluginsDirUtils.h#53\n\n std::string::size_type ofs = 0;\n for (;;) {\n WebPluginMimeType mime_type;\n\n std::string::size_type end = description.find(':', ofs);\n if (end == std::string::npos)\n break;\n mime_type.mime_type = description.substr(ofs, end - ofs);\n ofs = end + 1;\n\n end = description.find(':', ofs);\n if (end == std::string::npos)\n break;\n const std::string extensions = description.substr(ofs, end - ofs);\n base::SplitString(extensions, ',', &mime_type.file_extensions);\n ofs = end + 1;\n\n end = description.find(';', ofs);\n \/\/ It's ok for end to run off the string here. If there's no\n \/\/ trailing semicolon we consume the remainder of the string.\n if (end != std::string::npos) {\n mime_type.description = UTF8ToUTF16(description.substr(ofs, end - ofs));\n } else {\n mime_type.description = UTF8ToUTF16(description.substr(ofs));\n }\n mime_types->push_back(mime_type);\n if (end == std::string::npos)\n break;\n ofs = end + 1;\n }\n}\n\n} \/\/ namespace NPAPI\n<commit_msg>plugins: revert the logging statement added in r62783<commit_after>\/\/ Copyright (c) 2010 The Chromium Authors. All rights reserved.\n\/\/ Use of this source code is governed by a BSD-style license that can be\n\/\/ found in the LICENSE file.\n\n#include \"webkit\/glue\/plugins\/plugin_lib.h\"\n\n#include <dlfcn.h>\n#if defined(OS_OPENBSD)\n#include <sys\/exec_elf.h>\n#else\n#include <elf.h>\n#include <fcntl.h>\n#endif\n#include <sys\/stat.h>\n#include <sys\/types.h>\n#include <unistd.h>\n\n#include \"base\/eintr_wrapper.h\"\n#include \"base\/file_util.h\"\n#include \"base\/string_split.h\"\n#include \"base\/string_util.h\"\n#include \"base\/sys_string_conversions.h\"\n#include \"base\/utf_string_conversions.h\"\n#include \"webkit\/glue\/plugins\/plugin_list.h\"\n\n\/\/ These headers must be included in this order to make the declaration gods\n\/\/ happy.\n#include \"base\/third_party\/nspr\/prcpucfg_linux.h\"\n\nnamespace {\n\nusing NPAPI::PluginList;\n\n\/\/ Copied from nsplugindefs.h instead of including the file since it has a bunch\n\/\/ of dependencies.\nenum nsPluginVariable {\n nsPluginVariable_NameString = 1,\n nsPluginVariable_DescriptionString = 2\n};\n\n\/\/ Read the ELF header and return true if it is usable on\n\/\/ the current architecture (e.g. 32-bit ELF on 32-bit build).\n\/\/ Returns false on other errors as well.\nbool ELFMatchesCurrentArchitecture(const FilePath& filename) {\n \/\/ First make sure we can open the file and it is in fact, a regular file.\n struct stat stat_buf;\n \/\/ Open with O_NONBLOCK so we don't block on pipes.\n int fd = open(filename.value().c_str(), O_RDONLY|O_NONBLOCK);\n if (fd < 0)\n return false;\n bool ret = (fstat(fd, &stat_buf) >= 0 && S_ISREG(stat_buf.st_mode));\n if (HANDLE_EINTR(close(fd)) < 0)\n return false;\n if (!ret)\n return false;\n\n const size_t kELFBufferSize = 5;\n char buffer[kELFBufferSize];\n if (!file_util::ReadFile(filename, buffer, kELFBufferSize))\n return false;\n\n if (buffer[0] != ELFMAG0 ||\n buffer[1] != ELFMAG1 ||\n buffer[2] != ELFMAG2 ||\n buffer[3] != ELFMAG3) {\n \/\/ Not an ELF file, perhaps?\n return false;\n }\n\n int elf_class = buffer[EI_CLASS];\n#if defined(ARCH_CPU_32_BITS)\n if (elf_class == ELFCLASS32)\n return true;\n#elif defined(ARCH_CPU_64_BITS)\n if (elf_class == ELFCLASS64)\n return true;\n#endif\n\n return false;\n}\n\n\/\/ This structure matches enough of nspluginwrapper's NPW_PluginInfo\n\/\/ for us to extract the real plugin path.\nstruct __attribute__((packed)) NSPluginWrapperInfo {\n char ident[32]; \/\/ NSPluginWrapper magic identifier (includes version).\n char path[PATH_MAX]; \/\/ Path to wrapped plugin.\n};\n\n\/\/ Test a plugin for whether it's been wrapped by NSPluginWrapper, and\n\/\/ if so attempt to unwrap it. Pass in an opened plugin handle; on\n\/\/ success, |dl| and |unwrapped_path| will be filled in with the newly\n\/\/ opened plugin. On failure, params are left unmodified.\nvoid UnwrapNSPluginWrapper(void **dl, FilePath* unwrapped_path) {\n NSPluginWrapperInfo* info =\n reinterpret_cast<NSPluginWrapperInfo*>(dlsym(*dl, \"NPW_Plugin\"));\n if (!info)\n return; \/\/ Not a NSPW plugin.\n\n \/\/ Here we could check the NSPW ident field for the versioning\n \/\/ information, but the path field is available in all versions\n \/\/ anyway.\n\n \/\/ Grab the path to the wrapped plugin. Just in case the structure\n \/\/ format changes, protect against the path not being null-terminated.\n char* path_end = static_cast<char*>(memchr(info->path, '\\0',\n sizeof(info->path)));\n if (!path_end)\n path_end = info->path + sizeof(info->path);\n FilePath path = FilePath(std::string(info->path, path_end - info->path));\n\n if (!ELFMatchesCurrentArchitecture(path)) {\n LOG(WARNING) << path.value() << \" is nspluginwrapper wrapping a \"\n << \"plugin for a different architecture; it will \"\n << \"work better if you instead use a native plugin.\";\n return;\n }\n\n void* newdl = base::LoadNativeLibrary(path);\n if (!newdl) {\n \/\/ We couldn't load the unwrapped plugin for some reason, despite\n \/\/ being able to load the wrapped one. Just use the wrapped one.\n LOG_IF(ERROR, PluginList::DebugPluginLoading())\n << \"Could not use unwrapped nspluginwrapper plugin \"\n << unwrapped_path->value() << \", using the wrapped one.\";\n return;\n }\n\n \/\/ Unload the wrapped plugin, and use the wrapped plugin instead.\n LOG_IF(ERROR, PluginList::DebugPluginLoading())\n << \"Using unwrapped version \" << unwrapped_path->value()\n << \" of nspluginwrapper-wrapped plugin.\";\n base::UnloadNativeLibrary(*dl);\n *dl = newdl;\n *unwrapped_path = path;\n}\n\n} \/\/ anonymous namespace\n\nnamespace NPAPI {\n\nbool PluginLib::ReadWebPluginInfo(const FilePath& filename,\n WebPluginInfo* info) {\n \/\/ The file to reference is:\n \/\/ http:\/\/mxr.mozilla.org\/firefox\/source\/modules\/plugin\/base\/src\/nsPluginsDirUnix.cpp\n\n \/\/ Skip files that aren't appropriate for our architecture.\n if (!ELFMatchesCurrentArchitecture(filename)) {\n LOG_IF(ERROR, PluginList::DebugPluginLoading())\n << \"Skipping plugin \" << filename.value()\n << \" because it doesn't match the current architecture.\";\n return false;\n }\n\n void* dl = base::LoadNativeLibrary(filename);\n if (!dl) {\n LOG_IF(ERROR, PluginList::DebugPluginLoading())\n << \"While reading plugin info, unable to load library \"\n << filename.value() << \", skipping.\";\n return false;\n }\n\n info->path = filename;\n info->enabled = true;\n\n \/\/ Attempt to swap in the wrapped plugin if this is nspluginwrapper.\n UnwrapNSPluginWrapper(&dl, &info->path);\n\n \/\/ See comments in plugin_lib_mac regarding this symbol.\n typedef const char* (*NP_GetMimeDescriptionType)();\n NP_GetMimeDescriptionType NP_GetMIMEDescription =\n reinterpret_cast<NP_GetMimeDescriptionType>(\n dlsym(dl, \"NP_GetMIMEDescription\"));\n const char* mime_description = NULL;\n if (NP_GetMIMEDescription)\n mime_description = NP_GetMIMEDescription();\n\n if (mime_description)\n ParseMIMEDescription(mime_description, &info->mime_types);\n\n \/\/ The plugin name and description live behind NP_GetValue calls.\n typedef NPError (*NP_GetValueType)(void* unused,\n nsPluginVariable variable,\n void* value_out);\n NP_GetValueType NP_GetValue =\n reinterpret_cast<NP_GetValueType>(dlsym(dl, \"NP_GetValue\"));\n if (NP_GetValue) {\n const char* name = NULL;\n NP_GetValue(NULL, nsPluginVariable_NameString, &name);\n if (name)\n info->name = UTF8ToUTF16(name);\n\n const char* description = NULL;\n NP_GetValue(NULL, nsPluginVariable_DescriptionString, &description);\n if (description)\n info->desc = UTF8ToUTF16(description);\n\n LOG_IF(ERROR, PluginList::DebugPluginLoading())\n << \"Got info for plugin \" << filename.value()\n << \" Name = \\\"\" << UTF16ToUTF8(info->name)\n << \"\\\", Description = \\\"\" << UTF16ToUTF8(info->desc) << \"\\\".\";\n } else {\n LOG_IF(ERROR, PluginList::DebugPluginLoading())\n << \"Plugin \" << filename.value()\n << \" has no GetValue() and probably won't work.\";\n }\n\n \/\/ Intentionally not unloading the plugin here, it can lead to crashes.\n\n return true;\n}\n\n\/\/ static\nvoid PluginLib::ParseMIMEDescription(\n const std::string& description,\n std::vector<WebPluginMimeType>* mime_types) {\n \/\/ We parse the description here into WebPluginMimeType structures.\n \/\/ Naively from the NPAPI docs you'd think you could use\n \/\/ string-splitting, but the Firefox parser turns out to do something\n \/\/ different: find the first colon, then the second, then a semi.\n \/\/\n \/\/ See ParsePluginMimeDescription near\n \/\/ http:\/\/mxr.mozilla.org\/firefox\/source\/modules\/plugin\/base\/src\/nsPluginsDirUtils.h#53\n\n std::string::size_type ofs = 0;\n for (;;) {\n WebPluginMimeType mime_type;\n\n std::string::size_type end = description.find(':', ofs);\n if (end == std::string::npos)\n break;\n mime_type.mime_type = description.substr(ofs, end - ofs);\n ofs = end + 1;\n\n end = description.find(':', ofs);\n if (end == std::string::npos)\n break;\n const std::string extensions = description.substr(ofs, end - ofs);\n base::SplitString(extensions, ',', &mime_type.file_extensions);\n ofs = end + 1;\n\n end = description.find(';', ofs);\n \/\/ It's ok for end to run off the string here. If there's no\n \/\/ trailing semicolon we consume the remainder of the string.\n if (end != std::string::npos) {\n mime_type.description = UTF8ToUTF16(description.substr(ofs, end - ofs));\n } else {\n mime_type.description = UTF8ToUTF16(description.substr(ofs));\n }\n mime_types->push_back(mime_type);\n if (end == std::string::npos)\n break;\n ofs = end + 1;\n }\n}\n\n} \/\/ namespace NPAPI\n<|endoftext|>"} {"text":"<commit_before>0cf61660-2e4e-11e5-9284-b827eb9e62be<commit_msg>0cfb1214-2e4e-11e5-9284-b827eb9e62be<commit_after>0cfb1214-2e4e-11e5-9284-b827eb9e62be<|endoftext|>"} {"text":"<commit_before>#include <cmath>\n#include <cstdlib>\n#include <fstream>\n#include <iomanip>\n#include <iostream>\n#include <sstream>\n#include <string>\n#include <vector>\n\n#include \"defs.hh\"\n#include \"conf.hh\"\n#include \"StringSet.hh\"\n#include \"FactorEncoder.hh\"\n#include \"Unigrams.hh\"\n\nusing namespace std;\n\n\nvoid assert_short_subwords(map<string, flt_type> &vocab,\n const set<string> &chars,\n flt_type val)\n{\n for (auto it = chars.cbegin(); it != chars.cend(); ++it)\n if (vocab.find(*it) == vocab.end())\n vocab[*it] = val;\n}\n\n\nint main(int argc, char* argv[]) {\n\n conf::Config config;\n config(\"usage: g1g [OPTION...] WORDLIST VOCAB_INIT VOCAB_OUTNAME\\n\")\n ('h', \"help\", \"\", \"\", \"display help\")\n ('u', \"cutoff=INT\", \"arg\", \"0\", \"Cutoff value for each iteration\")\n ('c', \"candidates=INT\", \"arg\", \"25000\", \"Number of subwords to consider for removal per iteration\")\n ('r', \"removals=INT\", \"arg\", \"500\", \"Number of removals per iteration\")\n ('m', \"min-length=INT\", \"arg\", \"2\", \"Minimum length of subwords to remove\")\n ('v', \"vocab-size=INT\", \"arg must\", \"\", \"Target vocabulary size (stopping criterion)\")\n ('t', \"temp-vocabs=INT\", \"arg\", \"0\", \"Write out intermediate vocabularies for #V mod INT == 0\")\n ('f', \"forward-backward\", \"\", \"\", \"Use Forward-backward segmentation instead of Viterbi\");\n config.default_parse(argc, argv);\n if (config.arguments.size() != 3) config.print_help(stderr, 1);\n\n flt_type one_char_min_lp = -25.0;\n string wordlist_fname = config.arguments[0];\n string vocab_fname = config.arguments[1];\n string out_vocab_fname = config.arguments[2];\n float cutoff_value = config[\"cutoff\"].get_float();\n int n_candidates_per_iter = config[\"candidates\"].get_int();\n int removals_per_iter = config[\"removals\"].get_int();\n int min_removal_length = config[\"min-length\"].get_int();\n int target_vocab_size = config[\"vocab-size\"].get_int();\n int temp_vocab_interval = config[\"temp-vocabs\"].get_int();\n bool enable_forward_backward = config[\"forward-backward\"].specified;\n\n cerr << \"parameters, wordlist: \" << wordlist_fname << endl;\n cerr << \"parameters, initial vocabulary: \" << vocab_fname << endl;\n cerr << \"parameters, cutoff: \" << setprecision(15) << cutoff_value << endl;\n cerr << \"parameters, candidates per iteration: \" << n_candidates_per_iter << endl;\n cerr << \"parameters, minimum length for subwords to remove: \" << min_removal_length << endl;\n cerr << \"parameters, removals per iteration: \" << removals_per_iter << endl;\n cerr << \"parameters, target vocab size: \" << target_vocab_size << endl;\n if (temp_vocab_interval > 0)\n cerr << \"parameters, write temp vocabs: \" << temp_vocab_interval << endl;\n else\n cerr << \"parameters, write temp vocabs: NO\" << endl;\n cerr << \"parameters, use forward-backward: \" << enable_forward_backward << endl;\n\n int maxlen, word_maxlen;\n set<string> short_subwords;\n map<string, flt_type> vocab;\n map<string, flt_type> freqs;\n map<string, flt_type> words;\n\n cerr << \"Reading vocabulary \" << vocab_fname << endl;\n int retval = Unigrams::read_vocab(vocab_fname, vocab, maxlen);\n if (retval < 0) {\n cerr << \"something went wrong reading vocabulary\" << endl;\n exit(0);\n }\n cerr << \"\\t\" << \"size: \" << vocab.size() << endl;\n cerr << \"\\t\" << \"maximum string length: \" << maxlen << endl;\n for (auto it = vocab.cbegin(); it != vocab.end(); ++it) {\n if (it->first.length() < min_removal_length)\n short_subwords.insert(it->first);\n }\n\n cerr << \"Reading word list \" << wordlist_fname << endl;\n retval = Unigrams::read_vocab(wordlist_fname, words, word_maxlen);\n if (retval < 0) {\n cerr << \"something went wrong reading word list\" << endl;\n exit(0);\n }\n cerr << \"\\t\" << \"wordlist size: \" << words.size() << endl;\n cerr << \"\\t\" << \"maximum word length: \" << word_maxlen << endl;\n\n Unigrams gg;\n if (enable_forward_backward)\n gg.set_segmentation_method(forward_backward);\n else\n gg.set_segmentation_method(viterbi);\n\n cerr << \"Initial cutoff\" << endl;\n flt_type cost = gg.resegment_words(words, vocab, freqs);\n cerr << \"cost: \" << cost << endl;\n\n flt_type temp_cutoff = 1.0;\n while (true) {\n gg.cutoff(freqs, temp_cutoff, min_removal_length);\n cerr << \"\\tcutoff: \" << temp_cutoff << \"\\t\" << \"vocabulary size: \" << freqs.size() << endl;\n vocab = freqs;\n Unigrams::freqs_to_logprobs(vocab);\n assert_short_subwords(vocab, short_subwords, one_char_min_lp);\n temp_cutoff += 1.0;\n if (temp_cutoff > (flt_type)cutoff_value) break;\n cost = gg.resegment_words(words, vocab, freqs);\n cerr << \"cost: \" << cost << endl;\n }\n\n cerr << \"Removing subwords one by one\" << endl;\n int itern = 1;\n while (true) {\n\n cerr << \"iteration \" << itern << endl;\n\n cerr << \"collecting candidate subwords for removal\" << endl;\n set<string> candidates;\n if ((int)vocab.size()-n_candidates_per_iter < target_vocab_size) n_candidates_per_iter = (int)vocab.size()-target_vocab_size;\n gg.init_candidates_by_usage(words, vocab, candidates, n_candidates_per_iter\/3, min_removal_length);\n gg.init_candidates_by_random(vocab, candidates, (n_candidates_per_iter-candidates.size())\/3, min_removal_length);\n gg.init_candidates(vocab, candidates, n_candidates_per_iter-candidates.size(), min_removal_length);\n\n cerr << \"ranking candidate subwords (\" << candidates.size() << \")\" << endl;\n vector<pair<string, flt_type> > removal_scores;\n cost = gg.rank_candidates(words, vocab, candidates, freqs, removal_scores);\n\n cerr << \"starting cost before removing subwords one by one: \" << cost << endl;\n\n \/\/ Remove subwords one by one\n unsigned int n_removals = 0;\n for (unsigned int i=0; i<removal_scores.size(); i++) {\n\n if (removal_scores[i].first.length() == 1) continue;\n \/\/ Score most probably went to zero already\n if (vocab.find(removal_scores[i].first) == vocab.end()) continue;\n if (freqs.find(removal_scores[i].first) == freqs.end()) continue;\n\n vocab.erase(removal_scores[i].first);\n freqs.erase(removal_scores[i].first);\n n_removals++;\n\n if (temp_vocab_interval > 0 && vocab.size() % temp_vocab_interval == 0) {\n vocab = freqs;\n Unigrams::freqs_to_logprobs(vocab);\n assert_short_subwords(vocab, short_subwords, one_char_min_lp);\n ostringstream vocabfname;\n vocabfname << \"iteration_\" << itern << \"_\" << vocab.size() << \".vocab\";\n Unigrams::write_vocab(vocabfname.str(), vocab);\n }\n\n if (n_removals >= removals_per_iter) break;\n if (vocab.size() <= target_vocab_size) break;\n }\n\n int n_cutoff = Unigrams::cutoff(freqs, cutoff_value, min_removal_length);\n vocab = freqs;\n Unigrams::freqs_to_logprobs(vocab);\n assert_short_subwords(vocab, short_subwords, one_char_min_lp);\n cost = gg.iterate(words, vocab, 2);\n assert_short_subwords(vocab, short_subwords, one_char_min_lp);\n\n cerr << \"subwords removed in this iteration: \" << n_removals << endl;\n cerr << \"subwords removed with cutoff this iteration: \" << n_cutoff << endl;\n cerr << \"current vocabulary size: \" << vocab.size() << endl;\n cerr << \"likelihood after the removals: \" << cost << endl;\n\n itern++;\n\n if (vocab.size() <= target_vocab_size) {\n cerr << \"stopping by min_vocab_size.\" << endl;\n break;\n }\n }\n\n exit(1);\n}\n<commit_msg>Write final vocabulary.<commit_after>#include <cmath>\n#include <cstdlib>\n#include <fstream>\n#include <iomanip>\n#include <iostream>\n#include <sstream>\n#include <string>\n#include <vector>\n\n#include \"defs.hh\"\n#include \"conf.hh\"\n#include \"StringSet.hh\"\n#include \"FactorEncoder.hh\"\n#include \"Unigrams.hh\"\n\nusing namespace std;\n\n\nvoid assert_short_subwords(map<string, flt_type> &vocab,\n const set<string> &chars,\n flt_type val)\n{\n for (auto it = chars.cbegin(); it != chars.cend(); ++it)\n if (vocab.find(*it) == vocab.end())\n vocab[*it] = val;\n}\n\n\nint main(int argc, char* argv[]) {\n\n conf::Config config;\n config(\"usage: g1g [OPTION...] WORDLIST VOCAB_INIT VOCAB_OUTNAME\\n\")\n ('h', \"help\", \"\", \"\", \"display help\")\n ('u', \"cutoff=INT\", \"arg\", \"0\", \"Cutoff value for each iteration\")\n ('c', \"candidates=INT\", \"arg\", \"25000\", \"Number of subwords to consider for removal per iteration\")\n ('r', \"removals=INT\", \"arg\", \"500\", \"Number of removals per iteration\")\n ('m', \"min-length=INT\", \"arg\", \"2\", \"Minimum length of subwords to remove\")\n ('v', \"vocab-size=INT\", \"arg must\", \"\", \"Target vocabulary size (stopping criterion)\")\n ('t', \"temp-vocabs=INT\", \"arg\", \"0\", \"Write out intermediate vocabularies for #V mod INT == 0\")\n ('f', \"forward-backward\", \"\", \"\", \"Use Forward-backward segmentation instead of Viterbi\");\n config.default_parse(argc, argv);\n if (config.arguments.size() != 3) config.print_help(stderr, 1);\n\n flt_type short_subword_min_lp = -25.0;\n string wordlist_fname = config.arguments[0];\n string vocab_fname = config.arguments[1];\n string out_vocab_fname = config.arguments[2];\n float cutoff_value = config[\"cutoff\"].get_float();\n int n_candidates_per_iter = config[\"candidates\"].get_int();\n int removals_per_iter = config[\"removals\"].get_int();\n int min_removal_length = config[\"min-length\"].get_int();\n int target_vocab_size = config[\"vocab-size\"].get_int();\n int temp_vocab_interval = config[\"temp-vocabs\"].get_int();\n bool enable_forward_backward = config[\"forward-backward\"].specified;\n\n cerr << \"parameters, wordlist: \" << wordlist_fname << endl;\n cerr << \"parameters, initial vocabulary: \" << vocab_fname << endl;\n cerr << \"parameters, cutoff: \" << setprecision(15) << cutoff_value << endl;\n cerr << \"parameters, candidates per iteration: \" << n_candidates_per_iter << endl;\n cerr << \"parameters, minimum length for subwords to remove: \" << min_removal_length << endl;\n cerr << \"parameters, removals per iteration: \" << removals_per_iter << endl;\n cerr << \"parameters, target vocab size: \" << target_vocab_size << endl;\n if (temp_vocab_interval > 0)\n cerr << \"parameters, write temp vocabs: \" << temp_vocab_interval << endl;\n else\n cerr << \"parameters, write temp vocabs: NO\" << endl;\n cerr << \"parameters, use forward-backward: \" << enable_forward_backward << endl;\n\n int maxlen, word_maxlen;\n set<string> short_subwords;\n map<string, flt_type> vocab;\n map<string, flt_type> freqs;\n map<string, flt_type> words;\n\n cerr << \"Reading vocabulary \" << vocab_fname << endl;\n int retval = Unigrams::read_vocab(vocab_fname, vocab, maxlen);\n if (retval < 0) {\n cerr << \"something went wrong reading vocabulary\" << endl;\n exit(0);\n }\n cerr << \"\\t\" << \"size: \" << vocab.size() << endl;\n cerr << \"\\t\" << \"maximum string length: \" << maxlen << endl;\n for (auto it = vocab.cbegin(); it != vocab.end(); ++it) {\n if (it->first.length() < min_removal_length)\n short_subwords.insert(it->first);\n }\n\n cerr << \"Reading word list \" << wordlist_fname << endl;\n retval = Unigrams::read_vocab(wordlist_fname, words, word_maxlen);\n if (retval < 0) {\n cerr << \"something went wrong reading word list\" << endl;\n exit(0);\n }\n cerr << \"\\t\" << \"wordlist size: \" << words.size() << endl;\n cerr << \"\\t\" << \"maximum word length: \" << word_maxlen << endl;\n\n Unigrams gg;\n if (enable_forward_backward)\n gg.set_segmentation_method(forward_backward);\n else\n gg.set_segmentation_method(viterbi);\n\n cerr << \"Initial cutoff\" << endl;\n flt_type cost = gg.resegment_words(words, vocab, freqs);\n cerr << \"cost: \" << cost << endl;\n\n flt_type temp_cutoff = 1.0;\n while (true) {\n gg.cutoff(freqs, temp_cutoff, min_removal_length);\n cerr << \"\\tcutoff: \" << temp_cutoff << \"\\t\" << \"vocabulary size: \" << freqs.size() << endl;\n vocab = freqs;\n Unigrams::freqs_to_logprobs(vocab);\n assert_short_subwords(vocab, short_subwords, short_subword_min_lp);\n temp_cutoff += 1.0;\n if (temp_cutoff > (flt_type)cutoff_value) break;\n cost = gg.resegment_words(words, vocab, freqs);\n cerr << \"cost: \" << cost << endl;\n }\n\n cerr << \"Removing subwords one by one\" << endl;\n int itern = 1;\n while (true) {\n\n cerr << \"iteration \" << itern << endl;\n\n cerr << \"collecting candidate subwords for removal\" << endl;\n set<string> candidates;\n if ((int)vocab.size()-n_candidates_per_iter < target_vocab_size) n_candidates_per_iter = (int)vocab.size()-target_vocab_size;\n gg.init_candidates_by_usage(words, vocab, candidates, n_candidates_per_iter\/3, min_removal_length);\n gg.init_candidates_by_random(vocab, candidates, (n_candidates_per_iter-candidates.size())\/3, min_removal_length);\n gg.init_candidates(vocab, candidates, n_candidates_per_iter-candidates.size(), min_removal_length);\n\n cerr << \"ranking candidate subwords (\" << candidates.size() << \")\" << endl;\n vector<pair<string, flt_type> > removal_scores;\n cost = gg.rank_candidates(words, vocab, candidates, freqs, removal_scores);\n\n cerr << \"starting cost before removing subwords one by one: \" << cost << endl;\n\n \/\/ Remove subwords one by one\n unsigned int n_removals = 0;\n for (unsigned int i=0; i<removal_scores.size(); i++) {\n\n if (removal_scores[i].first.length() == 1) continue;\n \/\/ Score most probably went to zero already\n if (vocab.find(removal_scores[i].first) == vocab.end()) continue;\n if (freqs.find(removal_scores[i].first) == freqs.end()) continue;\n\n vocab.erase(removal_scores[i].first);\n freqs.erase(removal_scores[i].first);\n n_removals++;\n\n if (temp_vocab_interval > 0 && vocab.size() % temp_vocab_interval == 0) {\n vocab = freqs;\n Unigrams::freqs_to_logprobs(vocab);\n assert_short_subwords(vocab, short_subwords, short_subword_min_lp);\n ostringstream vocabfname;\n vocabfname << \"iteration_\" << itern << \"_\" << vocab.size() << \".vocab\";\n Unigrams::write_vocab(vocabfname.str(), vocab);\n }\n\n if (n_removals >= removals_per_iter) break;\n if (vocab.size() <= target_vocab_size) break;\n }\n\n int n_cutoff = Unigrams::cutoff(freqs, cutoff_value, min_removal_length);\n vocab = freqs;\n Unigrams::freqs_to_logprobs(vocab);\n assert_short_subwords(vocab, short_subwords, short_subword_min_lp);\n cost = gg.iterate(words, vocab, 2);\n assert_short_subwords(vocab, short_subwords, short_subword_min_lp);\n\n cerr << \"subwords removed in this iteration: \" << n_removals << endl;\n cerr << \"subwords removed with cutoff this iteration: \" << n_cutoff << endl;\n cerr << \"current vocabulary size: \" << vocab.size() << endl;\n cerr << \"likelihood after the removals: \" << cost << endl;\n\n itern++;\n\n if (vocab.size() <= target_vocab_size) {\n cerr << \"stopping by min_vocab_size.\" << endl;\n break;\n }\n }\n\n Unigrams::write_vocab(out_vocab_fname, vocab);\n exit(1);\n}\n<|endoftext|>"} {"text":"<commit_before>#include \"..\/..\/include\/widgets\/StationListbox.hpp\"\n#include <nana\/gui\/widgets\/form.hpp>\n\nStationListbox::StationListbox(nana::form& handle, State::Context context)\n : nana::listbox(handle)\n , context_(context)\n{\n this->append_header(context_.localizer_.get_localized_text(\"Station's name\"));\n this->append_header(context_.localizer_.get_localized_text(\"URL\"));\n this->append_header(context_.localizer_.get_localized_text(\"Country\"));\n this->append_header(context_.localizer_.get_localized_text(\"Language\"));\n this->append_header(context_.localizer_.get_localized_text(\"Codec\"));\n this->append_header(context_.localizer_.get_localized_text(\"Bitrate\"));\n this->append_header(context_.localizer_.get_localized_text(\"Tags\"));\n this->column_at(Columns::Name).width(300u);\n this->column_at(Columns::Url).width(200u);\n this->column_at(Columns::Country).width(100u);\n this->column_at(Columns::Language).width(100u);\n this->column_at(Columns::Codec).width(50u);\n this->column_at(Columns::Bitrate).width(100u);\n this->column_at(Columns::Tags).width(100u);\n this->enable_single(false, false);\n}\n\nvoid StationListbox::populate_listbox(const std::vector<Station>& stations)\n{\n if(!stations.empty())\n { \n this->auto_draw(false);\n this->clear();\n for (const auto& station : stations)\n {\n const auto category_index = Categories::NanaDefault;\n this->at(category_index).append(station);\n }\n this->auto_draw(true);\n }\n}\n\nstd::optional<Station> StationListbox::get_selected_station() const\n{\n if (!this->selected().empty())\n {\n const auto selected_item = this->selected().front();\n const auto category_index = static_cast<std::size_t>(Categories::NanaDefault);\n const auto column_index = static_cast<std::size_t>(Columns::Name);\n const auto station_category = this->at(category_index);\n const auto name = station_category.at(selected_item.item).text(column_index);\n const auto url = station_category.at(selected_item.item).text(static_cast<std::size_t>(Columns::Url));\n const auto country = station_category.at(selected_item.item).text(static_cast<std::size_t>(Columns::Country));\n const auto language = station_category.at(selected_item.item).text(static_cast<std::size_t>(Columns::Language));\n const auto codec = station_category.at(selected_item.item).text(static_cast<std::size_t>(Columns::Codec));\n const auto bitrate = station_category.at(selected_item.item).text(static_cast<std::size_t>(Columns::Bitrate));\n const auto tags = station_category.at(selected_item.item).text(static_cast<std::size_t>(Columns::Tags));\n return std::make_optional<Station>(name, url, country, language, codec, bitrate, tags);\n }\n return std::nullopt;\n \n}\n\nvoid StationListbox::select_from_position(const nana::arg_mouse& arg)\n{\n}\n\nvoid StationListbox::sticky_select(const nana::arg_mouse& arg)\n{\n if (!this->selected().empty())\n {\n for (const auto& pair : this->selected())\n {\n if (pair.item == this->selected().front().item)\n {\n continue;\n }\n else\n {\n this->at(pair.cat).at(pair.item).select(false);\n }\n }\n }\n}\n<commit_msg>StationListbox bug fixed.<commit_after>#include \"..\/..\/include\/widgets\/StationListbox.hpp\"\n#include <nana\/gui\/widgets\/form.hpp>\n\nStationListbox::StationListbox(nana::form& handle, State::Context context)\n : nana::listbox(handle)\n , context_(context)\n{\n this->append_header(context_.localizer_.get_localized_text(\"Station's name\"));\n this->append_header(context_.localizer_.get_localized_text(\"URL\"));\n this->append_header(context_.localizer_.get_localized_text(\"Country\"));\n this->append_header(context_.localizer_.get_localized_text(\"Language\"));\n this->append_header(context_.localizer_.get_localized_text(\"Codec\"));\n this->append_header(context_.localizer_.get_localized_text(\"Bitrate\"));\n this->append_header(context_.localizer_.get_localized_text(\"Tags\"));\n this->column_at(Columns::Name).width(300u);\n this->column_at(Columns::Url).width(200u);\n this->column_at(Columns::Country).width(100u);\n this->column_at(Columns::Language).width(100u);\n this->column_at(Columns::Codec).width(50u);\n this->column_at(Columns::Bitrate).width(100u);\n this->column_at(Columns::Tags).width(100u);\n this->enable_single(false, false);\n}\n\nvoid StationListbox::populate_listbox(const std::vector<Station>& stations)\n{\n this->auto_draw(false);\n this->clear();\n for (const auto& station : stations)\n {\n const auto category_index = Categories::NanaDefault;\n this->at(category_index).append(station);\n }\n this->auto_draw(true);\n}\n\nstd::optional<Station> StationListbox::get_selected_station() const\n{\n if (!this->selected().empty())\n {\n const auto selected_item = this->selected().front();\n const auto category_index = static_cast<std::size_t>(Categories::NanaDefault);\n const auto column_index = static_cast<std::size_t>(Columns::Name);\n const auto station_category = this->at(category_index);\n const auto name = station_category.at(selected_item.item).text(column_index);\n const auto url = station_category.at(selected_item.item).text(static_cast<std::size_t>(Columns::Url));\n const auto country = station_category.at(selected_item.item).text(static_cast<std::size_t>(Columns::Country));\n const auto language = station_category.at(selected_item.item).text(static_cast<std::size_t>(Columns::Language));\n const auto codec = station_category.at(selected_item.item).text(static_cast<std::size_t>(Columns::Codec));\n const auto bitrate = station_category.at(selected_item.item).text(static_cast<std::size_t>(Columns::Bitrate));\n const auto tags = station_category.at(selected_item.item).text(static_cast<std::size_t>(Columns::Tags));\n return std::make_optional<Station>(name, url, country, language, codec, bitrate, tags);\n }\n return std::nullopt;\n \n}\n\nvoid StationListbox::select_from_position(const nana::arg_mouse& arg)\n{\n}\n\nvoid StationListbox::sticky_select(const nana::arg_mouse& arg)\n{\n if (!this->selected().empty())\n {\n for (const auto& pair : this->selected())\n {\n if (pair.item == this->selected().front().item)\n {\n continue;\n }\n else\n {\n this->at(pair.cat).at(pair.item).select(false);\n }\n }\n }\n}\n<|endoftext|>"} {"text":"<commit_before>#ifndef G2_FIELD_CORE_INCLUDE_FIELD_STRUCTS_HH_\n#define G2_FIELD_CORE_INCLUDE_FIELD_STRUCTS_HH_\n\n\/*===========================================================================*\\\n\nauthor: Matthias W. Smith\nemail: mwsmith2@uw.edu\nfile: field_constants.hh\n\nabout: A header file for constant parameters used across field team\n software.\n\n\\*===========================================================================*\/\n\n\/\/--- project includes -----------------------------------------------------\/\/\n#include <vector>\n\n\/\/--- project includes -----------------------------------------------------\/\/\n#include \"field_constants.hh\"\n\nnamespace g2field {\n\n\/\/ A macro to define nmr structs since they are very similar.\n#define MAKE_NMR_STRUCT(name, num_ch, len_tr)\\\nstruct name {\\\n Double_t sys_clock[num_ch];\\\n Double_t gps_clock[num_ch];\\\n Double_t dev_clock[num_ch];\\\n Double_t snr[num_ch];\\\n Double_t len[num_ch];\\\n Double_t freq[num_ch];\\\n Double_t ferr[num_ch];\\\n Double_t freq_zc[num_ch];\\\n Double_t ferr_zc[num_ch];\\\n UShort_t health[num_ch];\\\n UShort_t method[num_ch];\\\n UShort_t trace[num_ch][len_tr];\\\n};\n\n\/\/ Might as well define a root branch string for the struct.\n#define MAKE_NMR_STRING(name, num_ch, len_tr) NMR_HELPER(name, num_ch, len_tr)\n\n#define NMR_HELPER(name, num_ch, len_tr) \\\nconst char * const name = \"sys_clock[\"#num_ch\"]\/D:gps_clock[\"#num_ch\"]\/D:\"\\\n\"dev_clock[\"#num_ch\"]\/D:snr[\"#num_ch\"]\/D:len[\"#num_ch\"]\/D:freq[\"#num_ch\"]\/D:\"\\\n\"ferr[\"#num_ch\"]\/D:freq_zc[\"#num_ch\"]\/D:ferr_zc[\"#num_ch\"]\/D:\"\\\n\"health[\"#num_ch\"]\/s:method[\"#num_ch\"]\/s:trace[\"#num_ch\"][\"#len_tr\"]\/s\"\n\n\/\/ NMR structs\nMAKE_NMR_STRUCT(fixed_t, NMR_NUM_FIXED_PROBES, NMR_FID_LENGTH_RECORD);\nMAKE_NMR_STRING(fixed_str, NMR_NUM_FIXED_PROBES, NMR_FID_LENGTH_RECORD);\n\nMAKE_NMR_STRUCT(online_fixed_t, NMR_NUM_FIXED_PROBES, NMR_FID_LENGTH_ONLINE);\nMAKE_NMR_STRING(online_fixed_str, NMR_NUM_FIXED_PROBES, NMR_FID_LENGTH_ONLINE);\n\n\/\/ Flexible struct built from the basic nmr attributes.\nstruct nmr_vector {\n std::vector<Double_t> sys_clock;\n std::vector<Double_t> gps_clock;\n std::vector<Double_t> dev_clock;\n std::vector<Double_t> snr;\n std::vector<Double_t> len;\n std::vector<Double_t> freq;\n std::vector<Double_t> ferr;\n std::vector<Double_t> freq_zc;\n std::vector<Double_t> ferr_zc;\n std::vector<UShort_t> health;\n std::vector<UShort_t> method;\n std::vector< std::array<UShort_t, NMR_FID_LENGTH_ONLINE> > trace;\n\n inline void Resize(int size) {\n sys_clock.resize(size);\n gps_clock.resize(size);\n dev_clock.resize(size);\n snr.resize(size);\n len.resize(size);\n freq.resize(size);\n ferr.resize(size);\n freq_zc.resize(size);\n ferr_zc.resize(size);\n health.resize(size);\n method.resize(size);\n trace.resize(size);\n }\n};\n\n\/\/Trolley data structs\nstruct trolley_nmr_t{\n unsigned long int gps_clock;\n unsigned short probe_index;\n unsigned short length;\n short trace[TRLY_NMR_LENGTH];\n};\n\n#define MAKE_TLNMR_STRING(len) HELPER_TLNMR_STRING(len)\n#define HELPER_TLNMR_STRING(len) \\\nconst char * const trolley_nmr_str = \"gps_clock\/l:probe_index\/s:len\/s:trace[\"#len\"]\/s\"\nMAKE_TLNMR_STRING(TRLY_NMR_LENGTH);\n\nstruct trolley_barcode_t{\n unsigned long int gps_clock;\n unsigned short length_per_ch;\n unsigned short traces[TRLY_BARCODE_LENGTH]; \/\/All channels\n};\n\n#define MAKE_BARCODE_STRING(len) HELPER_BARCODE_STRING(len)\n#define HELPER_BARCODE_STRING(len) \\\nconst char * const trolley_barcode_str = \"gps_clock\/l:len_per_ch\/s:traces[\"#len\"]\/s\"\nMAKE_BARCODE_STRING(TRLY_BARCODE_LENGTH);\n\nstruct trolley_monitor_t{\n unsigned long int gps_clock_cycle_start;\n unsigned int PMonitorVal;\n unsigned int PMonitorTemp;\n unsigned int RFPower1;\n unsigned int RFPower2;\n unsigned int NMRCheckSum;\n unsigned int FrameCheckSum;\n unsigned int FrameSum;\n unsigned int FrameIndex;\n unsigned short StatusBits;\n unsigned short TMonitorIn;\n unsigned short TMonitorExt1;\n unsigned short TMonitorExt2;\n unsigned short TMonitorExt3;\n unsigned short V1Min;\n unsigned short V1Max;\n unsigned short V2Min;\n unsigned short V2Max;\n unsigned short length_per_ch;\n unsigned short trace_VMonitor1[TRLY_MONITOR_LENGTH];\n unsigned short trace_VMonitor2[TRLY_MONITOR_LENGTH];\n};\n\n#define MAKE_MONITOR_STRING(len) HELPER_MONITOR_STRING(len)\n#define HELPER_MONITOR_STRING(len) \\\nconst char * const trolley_monitor_str = \"gps_clock_cycle_start\/l:PMonitorVal\/i:PMonitorTemp\/i:RFPower1\/i:RFPower2\/i:\"\\\n\"NMRCheckSum\/i:FrameCheckSum\/i:FrameSum\/i:StatusBits\/s:\"\\\n\"TMonitorIn\/s:TMonitorExt1\/s:TMonitorExt2\/s:TMonitorExt3\/s:V1Min\/s:V1Max\/s:V2Min\/s:V2Max\/s:len_per_ch\/s:\"\\\n\"trace_VMonitor1[\"#len\"]\/s:trace_VMonitor2[\"#len\"]\/s\"\nMAKE_MONITOR_STRING(TRLY_MONITOR_LENGTH);\n\n\/\/Surface coil struct\nstruct surface_coil_t{\n Double_t sys_clock[SC_NUM_COILS];\n Double_t gps_clock[SC_NUM_COILS];\n Double_t top_board[SC_NUM_COILS];\n Double_t bot_board[SC_NUM_COILS];\n};\n\n#define MAKE_SC_STRING(name,num_coils) SC_HELPER(name,num_coils)\n\n#define SC_HELPER(name,num_coils)\\\nconst char * const name = \"sys_clock[\"#num_coils\"]\/D:gps_clock[\"#num_coils\"]\/D:top_board[\"#num_coils\"]\/D:bot_board[\"#num_coils\"]\/D\"\n \nMAKE_SC_STRING(sc_str,SC_NUM_COILS);\n\n} \/\/ ::g2field\n\n#endif\n<commit_msg>Added temperature to surface coil struct<commit_after>#ifndef G2_FIELD_CORE_INCLUDE_FIELD_STRUCTS_HH_\n#define G2_FIELD_CORE_INCLUDE_FIELD_STRUCTS_HH_\n\n\/*===========================================================================*\\\n\nauthor: Matthias W. Smith\nemail: mwsmith2@uw.edu\nfile: field_constants.hh\n\nabout: A header file for constant parameters used across field team\n software.\n\n\\*===========================================================================*\/\n\n\/\/--- project includes -----------------------------------------------------\/\/\n#include <vector>\n\n\/\/--- project includes -----------------------------------------------------\/\/\n#include \"field_constants.hh\"\n\nnamespace g2field {\n\n\/\/ A macro to define nmr structs since they are very similar.\n#define MAKE_NMR_STRUCT(name, num_ch, len_tr)\\\nstruct name {\\\n Double_t sys_clock[num_ch];\\\n Double_t gps_clock[num_ch];\\\n Double_t dev_clock[num_ch];\\\n Double_t snr[num_ch];\\\n Double_t len[num_ch];\\\n Double_t freq[num_ch];\\\n Double_t ferr[num_ch];\\\n Double_t freq_zc[num_ch];\\\n Double_t ferr_zc[num_ch];\\\n UShort_t health[num_ch];\\\n UShort_t method[num_ch];\\\n UShort_t trace[num_ch][len_tr];\\\n};\n\n\/\/ Might as well define a root branch string for the struct.\n#define MAKE_NMR_STRING(name, num_ch, len_tr) NMR_HELPER(name, num_ch, len_tr)\n\n#define NMR_HELPER(name, num_ch, len_tr) \\\nconst char * const name = \"sys_clock[\"#num_ch\"]\/D:gps_clock[\"#num_ch\"]\/D:\"\\\n\"dev_clock[\"#num_ch\"]\/D:snr[\"#num_ch\"]\/D:len[\"#num_ch\"]\/D:freq[\"#num_ch\"]\/D:\"\\\n\"ferr[\"#num_ch\"]\/D:freq_zc[\"#num_ch\"]\/D:ferr_zc[\"#num_ch\"]\/D:\"\\\n\"health[\"#num_ch\"]\/s:method[\"#num_ch\"]\/s:trace[\"#num_ch\"][\"#len_tr\"]\/s\"\n\n\/\/ NMR structs\nMAKE_NMR_STRUCT(fixed_t, NMR_NUM_FIXED_PROBES, NMR_FID_LENGTH_RECORD);\nMAKE_NMR_STRING(fixed_str, NMR_NUM_FIXED_PROBES, NMR_FID_LENGTH_RECORD);\n\nMAKE_NMR_STRUCT(online_fixed_t, NMR_NUM_FIXED_PROBES, NMR_FID_LENGTH_ONLINE);\nMAKE_NMR_STRING(online_fixed_str, NMR_NUM_FIXED_PROBES, NMR_FID_LENGTH_ONLINE);\n\n\/\/ Flexible struct built from the basic nmr attributes.\nstruct nmr_vector {\n std::vector<Double_t> sys_clock;\n std::vector<Double_t> gps_clock;\n std::vector<Double_t> dev_clock;\n std::vector<Double_t> snr;\n std::vector<Double_t> len;\n std::vector<Double_t> freq;\n std::vector<Double_t> ferr;\n std::vector<Double_t> freq_zc;\n std::vector<Double_t> ferr_zc;\n std::vector<UShort_t> health;\n std::vector<UShort_t> method;\n std::vector< std::array<UShort_t, NMR_FID_LENGTH_ONLINE> > trace;\n\n inline void Resize(int size) {\n sys_clock.resize(size);\n gps_clock.resize(size);\n dev_clock.resize(size);\n snr.resize(size);\n len.resize(size);\n freq.resize(size);\n ferr.resize(size);\n freq_zc.resize(size);\n ferr_zc.resize(size);\n health.resize(size);\n method.resize(size);\n trace.resize(size);\n }\n};\n\n\/\/Trolley data structs\nstruct trolley_nmr_t{\n unsigned long int gps_clock;\n unsigned short probe_index;\n unsigned short length;\n short trace[TRLY_NMR_LENGTH];\n};\n\n#define MAKE_TLNMR_STRING(len) HELPER_TLNMR_STRING(len)\n#define HELPER_TLNMR_STRING(len) \\\nconst char * const trolley_nmr_str = \"gps_clock\/l:probe_index\/s:len\/s:trace[\"#len\"]\/s\"\nMAKE_TLNMR_STRING(TRLY_NMR_LENGTH);\n\nstruct trolley_barcode_t{\n unsigned long int gps_clock;\n unsigned short length_per_ch;\n unsigned short traces[TRLY_BARCODE_LENGTH]; \/\/All channels\n};\n\n#define MAKE_BARCODE_STRING(len) HELPER_BARCODE_STRING(len)\n#define HELPER_BARCODE_STRING(len) \\\nconst char * const trolley_barcode_str = \"gps_clock\/l:len_per_ch\/s:traces[\"#len\"]\/s\"\nMAKE_BARCODE_STRING(TRLY_BARCODE_LENGTH);\n\nstruct trolley_monitor_t{\n unsigned long int gps_clock_cycle_start;\n unsigned int PMonitorVal;\n unsigned int PMonitorTemp;\n unsigned int RFPower1;\n unsigned int RFPower2;\n unsigned int NMRCheckSum;\n unsigned int FrameCheckSum;\n unsigned int FrameSum;\n unsigned int FrameIndex;\n unsigned short StatusBits;\n unsigned short TMonitorIn;\n unsigned short TMonitorExt1;\n unsigned short TMonitorExt2;\n unsigned short TMonitorExt3;\n unsigned short V1Min;\n unsigned short V1Max;\n unsigned short V2Min;\n unsigned short V2Max;\n unsigned short length_per_ch;\n unsigned short trace_VMonitor1[TRLY_MONITOR_LENGTH];\n unsigned short trace_VMonitor2[TRLY_MONITOR_LENGTH];\n};\n\n#define MAKE_MONITOR_STRING(len) HELPER_MONITOR_STRING(len)\n#define HELPER_MONITOR_STRING(len) \\\nconst char * const trolley_monitor_str = \"gps_clock_cycle_start\/l:PMonitorVal\/i:PMonitorTemp\/i:RFPower1\/i:RFPower2\/i:\"\\\n\"NMRCheckSum\/i:FrameCheckSum\/i:FrameSum\/i:StatusBits\/s:\"\\\n\"TMonitorIn\/s:TMonitorExt1\/s:TMonitorExt2\/s:TMonitorExt3\/s:V1Min\/s:V1Max\/s:V2Min\/s:V2Max\/s:len_per_ch\/s:\"\\\n\"trace_VMonitor1[\"#len\"]\/s:trace_VMonitor2[\"#len\"]\/s\"\nMAKE_MONITOR_STRING(TRLY_MONITOR_LENGTH);\n\n\/\/Surface coil struct\nstruct surface_coil_t{\n Double_t sys_clock;\n Double_t bot_coil_currents[SC_NUM_COILS];\n Double_t top_coil_currents[SC_NUM_COILS];\n Double_t bot_coil_temps[SC_NUM_COILS];\n Double_t top_coil_temps[SC_NUM_COILS];\n};\n\n#define MAKE_SC_STRING(name,num_coils) SC_HELPER(name,num_coils)\n\n#define SC_HELPER(name,num_coils)\\\nconst char * const name = \"sys_clock\/D:bot_coil_currents[\"#num_coils\"]\/D:top_coil_currents[\"#num_coils\"]\/D:bot_coil_temps[\"#num_coils\"]\/D:top_coil_temps[\"#num_coils\"]\/D\"\n \nMAKE_SC_STRING(sc_str,SC_NUM_COILS);\n\n} \/\/ ::g2field\n\n#endif\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()\n{\n QByteArray t_blockCmdInfoList;\n\n\/\/ t_blockCmdInfoList.append(QString(\"\\t### %1 connector###\\r\\n\").arg(this->getName()));\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 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_bIsRunning = false;\n QThread::wait();\/\/ToDo: This thread will never be terminated when circular buffer is blocking the thread (happens when circularbuffer is empty)\n \n m_pDacqServer->m_bIsRunning = false;\n m_pDacqServer->wait();\n\n qDebug() << \"bool Neuromag::stop()\";\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\/\/ 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>[bugfix] neuromag.cpp<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()\n{\n QByteArray t_blockCmdInfoList;\n\n\/\/ t_blockCmdInfoList.append(QString(\"\\t### %1 connector###\\r\\n\").arg(this->getName()));\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 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_bIsRunning = false;\n QThread::wait();\/\/ToDo: This thread will never be terminated when circular buffer is blocking the thread (happens when circularbuffer is empty)\n \n m_pDacqServer->m_bIsRunning = false;\n m_pDacqServer->wait();\n\n qDebug() << \"bool Neuromag::stop()\";\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\/\/ 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>\/\/ 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 <string>\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 \"net\/base\/escape.h\"\n#include \"testing\/gtest\/include\/gtest\/gtest.h\"\n#include \"third_party\/WebKit\/WebKit\/chromium\/public\/WebData.h\"\n#include \"third_party\/WebKit\/WebKit\/chromium\/public\/WebFrame.h\"\n#include \"third_party\/WebKit\/WebKit\/chromium\/public\/WebInputEvent.h\"\n#include \"third_party\/WebKit\/WebKit\/chromium\/public\/WebScriptSource.h\"\n#include \"third_party\/WebKit\/WebKit\/chromium\/public\/WebView.h\"\n#include \"webkit\/tools\/test_shell\/test_shell.h\"\n#include \"webkit\/tools\/test_shell\/test_shell_test.h\"\n\nusing WebKit::WebFrame;\nusing WebKit::WebScriptSource;\nusing WebKit::WebString;\n\n#if defined(OS_WIN)\n#define TEST_PLUGIN_NAME \"npapi_test_plugin.dll\"\n#elif defined(OS_MACOSX)\n#define TEST_PLUGIN_NAME \"npapi_test_plugin.plugin\"\n#elif defined(OS_POSIX)\n#define TEST_PLUGIN_NAME \"libnpapi_test_plugin.so\"\n#endif\n\n#if defined(OS_MACOSX)\n#define TEST_PLUGIN_DIRECTORY \"PlugIns\"\n#else\n#define TEST_PLUGIN_DIRECTORY \"plugins\"\n#endif\n\n\/\/ Ignore these until 64-bit plugin build is fixed. http:\/\/crbug.com\/18337\n#if !defined(ARCH_CPU_64_BITS)\n\/\/ Provides functionality for creating plugin tests.\nclass PluginTest : public TestShellTest {\n public:\n PluginTest() {\n FilePath executable_directory;\n PathService::Get(base::DIR_EXE, &executable_directory);\n plugin_src_ = executable_directory.AppendASCII(TEST_PLUGIN_NAME);\n CHECK(file_util::PathExists(plugin_src_));\n\n plugin_file_path_ = executable_directory.AppendASCII(TEST_PLUGIN_DIRECTORY);\n file_util::CreateDirectory(plugin_file_path_);\n\n plugin_file_path_ = plugin_file_path_.AppendASCII(TEST_PLUGIN_NAME);\n }\n\n void CopyTestPlugin() {\n ASSERT_TRUE(file_util::CopyDirectory(plugin_src_, plugin_file_path_, true));\n }\n\n void DeleteTestPlugin() {\n file_util::Delete(plugin_file_path_, true);\n }\n\n virtual void SetUp() {\n CopyTestPlugin();\n TestShellTest::SetUp();\n }\n\n virtual void TearDown() {\n DeleteTestPlugin();\n TestShellTest::TearDown();\n }\n\n FilePath plugin_src_;\n FilePath plugin_file_path_;\n};\n\n\/\/ Tests navigator.plugins.refresh() works.\nTEST_F(PluginTest, Refresh) {\n std::string html = \"\\\n <div id='result'>Test running....<\/div>\\\n <script>\\\n function check() {\\\n var l = navigator.plugins.length;\\\n var result = document.getElementById('result');\\\n for(var i = 0; i < l; i++) {\\\n if (navigator.plugins[i].filename == '\" TEST_PLUGIN_NAME \"') {\\\n result.innerHTML = 'DONE';\\\n break;\\\n }\\\n }\\\n \\\n if (result.innerHTML != 'DONE')\\\n result.innerHTML = 'FAIL';\\\n }\\\n <\/script>\\\n \";\n\n WebScriptSource call_check(\n WebString::fromUTF8(\"check();\"));\n WebScriptSource refresh(\n WebString::fromUTF8(\"navigator.plugins.refresh(false)\"));\n\n \/\/ Remove any leftover from previous tests if they exist. We must also\n \/\/ refresh WebKit's plugin cache since it might have had an entry for the\n \/\/ test plugin from a previous test.\n DeleteTestPlugin();\n ASSERT_FALSE(file_util::PathExists(plugin_file_path_));\n test_shell_->webView()->mainFrame()->executeScript(refresh);\n\n test_shell_->webView()->mainFrame()->loadHTMLString(\n html, GURL(\"about:blank\"));\n test_shell_->WaitTestFinished();\n\n std::string text;\n test_shell_->webView()->mainFrame()->executeScript(call_check);\n text = test_shell_->webView()->mainFrame()->contentAsText(10000).utf8();\n ASSERT_EQ(text, \"FAIL\");\n\n CopyTestPlugin();\n\n test_shell_->webView()->mainFrame()->executeScript(refresh);\n test_shell_->webView()->mainFrame()->executeScript(call_check);\n text = test_shell_->webView()->mainFrame()->contentAsText(10000).utf8();\n ASSERT_EQ(text, \"DONE\");\n}\n\n\/\/ Tests that if a frame is deleted as a result of calling NPP_HandleEvent, we\n\/\/ don't crash.\nTEST_F(PluginTest, DeleteFrameDuringEvent) {\n FilePath test_html = data_dir_;\n test_html = test_html.AppendASCII(\"plugins\");\n test_html = test_html.AppendASCII(\"delete_frame.html\");\n test_shell_->LoadFile(test_html);\n test_shell_->WaitTestFinished();\n\n WebKit::WebMouseEvent input;\n input.button = WebKit::WebMouseEvent::ButtonLeft;\n input.x = 50;\n input.y = 50;\n input.type = WebKit::WebInputEvent::MouseUp;\n test_shell_->webView()->handleInputEvent(input);\n\n \/\/ No crash means we passed.\n}\n\n#if defined(OS_WIN)\nBOOL CALLBACK EnumChildProc(HWND hwnd, LPARAM lparam) {\n HWND* plugin_hwnd = reinterpret_cast<HWND*>(lparam);\n if (*plugin_hwnd) {\n \/\/ More than one child window found, unexpected.\n plugin_hwnd = NULL;\n return FALSE;\n }\n *plugin_hwnd = hwnd;\n return TRUE;\n}\n\n\/\/ Tests that hiding\/showing the parent frame hides\/shows the plugin.\nTEST_F(PluginTest, PluginVisibilty) {\n FilePath test_html = data_dir_;\n test_html = test_html.AppendASCII(\"plugins\");\n test_html = test_html.AppendASCII(\"plugin_visibility.html\");\n test_shell_->LoadFile(test_html);\n test_shell_->WaitTestFinished();\n\n WebFrame* main_frame = test_shell_->webView()->mainFrame();\n HWND frame_hwnd = test_shell_->webViewWnd();\n HWND plugin_hwnd = NULL;\n EnumChildWindows(frame_hwnd, EnumChildProc,\n reinterpret_cast<LPARAM>(&plugin_hwnd));\n ASSERT_TRUE(plugin_hwnd != NULL);\n ASSERT_FALSE(IsWindowVisible(plugin_hwnd));\n\n main_frame->executeScript(WebString::fromUTF8(\"showPlugin(true)\"));\n ASSERT_TRUE(IsWindowVisible(plugin_hwnd));\n\n main_frame->executeScript(WebString::fromUTF8(\"showFrame(false)\"));\n ASSERT_FALSE(IsWindowVisible(plugin_hwnd));\n\n main_frame->executeScript(WebString::fromUTF8(\"showFrame(true)\"));\n ASSERT_TRUE(IsWindowVisible(plugin_hwnd));\n}\n#endif\n#endif \/\/!ARCH_CPU_64_BITS\n<commit_msg>Fix plugin tests on linux.<commit_after>\/\/ Copyright (c) 2006-2008 The Chromium Authors. All rights reserved.\n\/\/ Use of this source code is governed by a BSD-style license that can be\n\/\/ found in the LICENSE file.\n\n#include <string>\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 \"net\/base\/escape.h\"\n#include \"testing\/gtest\/include\/gtest\/gtest.h\"\n#include \"third_party\/WebKit\/WebKit\/chromium\/public\/WebData.h\"\n#include \"third_party\/WebKit\/WebKit\/chromium\/public\/WebFrame.h\"\n#include \"third_party\/WebKit\/WebKit\/chromium\/public\/WebInputEvent.h\"\n#include \"third_party\/WebKit\/WebKit\/chromium\/public\/WebScriptSource.h\"\n#include \"third_party\/WebKit\/WebKit\/chromium\/public\/WebView.h\"\n#include \"webkit\/tools\/test_shell\/test_shell.h\"\n#include \"webkit\/tools\/test_shell\/test_shell_test.h\"\n\nusing WebKit::WebFrame;\nusing WebKit::WebScriptSource;\nusing WebKit::WebString;\n\n#if defined(OS_WIN)\n#define TEST_PLUGIN_NAME \"npapi_test_plugin.dll\"\n#elif defined(OS_MACOSX)\n#define TEST_PLUGIN_NAME \"npapi_test_plugin.plugin\"\n#elif defined(OS_POSIX)\n#define TEST_PLUGIN_NAME \"libnpapi_test_plugin.so\"\n#endif\n\n#if defined(OS_MACOSX)\n#define TEST_PLUGIN_DIRECTORY \"PlugIns\"\n#else\n#define TEST_PLUGIN_DIRECTORY \"plugins\"\n#endif\n\n\/\/ Ignore these until 64-bit plugin build is fixed. http:\/\/crbug.com\/18337\n#if !defined(ARCH_CPU_64_BITS)\n\/\/ Provides functionality for creating plugin tests.\nclass PluginTest : public TestShellTest {\n public:\n PluginTest() {\n FilePath executable_directory;\n PathService::Get(base::DIR_EXE, &executable_directory);\n plugin_src_ = executable_directory.AppendASCII(TEST_PLUGIN_NAME);\n CHECK(file_util::PathExists(plugin_src_));\n\n plugin_file_path_ = executable_directory.AppendASCII(TEST_PLUGIN_DIRECTORY);\n file_util::CreateDirectory(plugin_file_path_);\n\n plugin_file_path_ = plugin_file_path_.AppendASCII(TEST_PLUGIN_NAME);\n }\n\n void CopyTestPlugin() {\n \/\/ On Linux, we need to delete before copying because if the plugin is a\n \/\/ hard link, the copy will fail.\n DeleteTestPlugin();\n ASSERT_TRUE(file_util::CopyDirectory(plugin_src_, plugin_file_path_, true));\n }\n\n void DeleteTestPlugin() {\n file_util::Delete(plugin_file_path_, true);\n }\n\n virtual void SetUp() {\n CopyTestPlugin();\n TestShellTest::SetUp();\n }\n\n virtual void TearDown() {\n DeleteTestPlugin();\n TestShellTest::TearDown();\n }\n\n FilePath plugin_src_;\n FilePath plugin_file_path_;\n};\n\n\/\/ Tests navigator.plugins.refresh() works.\nTEST_F(PluginTest, Refresh) {\n std::string html = \"\\\n <div id='result'>Test running....<\/div>\\\n <script>\\\n function check() {\\\n var l = navigator.plugins.length;\\\n var result = document.getElementById('result');\\\n for(var i = 0; i < l; i++) {\\\n if (navigator.plugins[i].filename == '\" TEST_PLUGIN_NAME \"') {\\\n result.innerHTML = 'DONE';\\\n break;\\\n }\\\n }\\\n \\\n if (result.innerHTML != 'DONE')\\\n result.innerHTML = 'FAIL';\\\n }\\\n <\/script>\\\n \";\n\n WebScriptSource call_check(\n WebString::fromUTF8(\"check();\"));\n WebScriptSource refresh(\n WebString::fromUTF8(\"navigator.plugins.refresh(false)\"));\n\n \/\/ Remove any leftover from previous tests if they exist. We must also\n \/\/ refresh WebKit's plugin cache since it might have had an entry for the\n \/\/ test plugin from a previous test.\n DeleteTestPlugin();\n ASSERT_FALSE(file_util::PathExists(plugin_file_path_));\n test_shell_->webView()->mainFrame()->executeScript(refresh);\n\n test_shell_->webView()->mainFrame()->loadHTMLString(\n html, GURL(\"about:blank\"));\n test_shell_->WaitTestFinished();\n\n std::string text;\n test_shell_->webView()->mainFrame()->executeScript(call_check);\n text = test_shell_->webView()->mainFrame()->contentAsText(10000).utf8();\n ASSERT_EQ(text, \"FAIL\");\n\n CopyTestPlugin();\n\n test_shell_->webView()->mainFrame()->executeScript(refresh);\n test_shell_->webView()->mainFrame()->executeScript(call_check);\n text = test_shell_->webView()->mainFrame()->contentAsText(10000).utf8();\n ASSERT_EQ(text, \"DONE\");\n}\n\n\/\/ Tests that if a frame is deleted as a result of calling NPP_HandleEvent, we\n\/\/ don't crash.\nTEST_F(PluginTest, DeleteFrameDuringEvent) {\n FilePath test_html = data_dir_;\n test_html = test_html.AppendASCII(\"plugins\");\n test_html = test_html.AppendASCII(\"delete_frame.html\");\n test_shell_->LoadFile(test_html);\n test_shell_->WaitTestFinished();\n\n WebKit::WebMouseEvent input;\n input.button = WebKit::WebMouseEvent::ButtonLeft;\n input.x = 50;\n input.y = 50;\n input.type = WebKit::WebInputEvent::MouseUp;\n test_shell_->webView()->handleInputEvent(input);\n\n \/\/ No crash means we passed.\n}\n\n#if defined(OS_WIN)\nBOOL CALLBACK EnumChildProc(HWND hwnd, LPARAM lparam) {\n HWND* plugin_hwnd = reinterpret_cast<HWND*>(lparam);\n if (*plugin_hwnd) {\n \/\/ More than one child window found, unexpected.\n plugin_hwnd = NULL;\n return FALSE;\n }\n *plugin_hwnd = hwnd;\n return TRUE;\n}\n\n\/\/ Tests that hiding\/showing the parent frame hides\/shows the plugin.\nTEST_F(PluginTest, PluginVisibilty) {\n FilePath test_html = data_dir_;\n test_html = test_html.AppendASCII(\"plugins\");\n test_html = test_html.AppendASCII(\"plugin_visibility.html\");\n test_shell_->LoadFile(test_html);\n test_shell_->WaitTestFinished();\n\n WebFrame* main_frame = test_shell_->webView()->mainFrame();\n HWND frame_hwnd = test_shell_->webViewWnd();\n HWND plugin_hwnd = NULL;\n EnumChildWindows(frame_hwnd, EnumChildProc,\n reinterpret_cast<LPARAM>(&plugin_hwnd));\n ASSERT_TRUE(plugin_hwnd != NULL);\n ASSERT_FALSE(IsWindowVisible(plugin_hwnd));\n\n main_frame->executeScript(WebString::fromUTF8(\"showPlugin(true)\"));\n ASSERT_TRUE(IsWindowVisible(plugin_hwnd));\n\n main_frame->executeScript(WebString::fromUTF8(\"showFrame(false)\"));\n ASSERT_FALSE(IsWindowVisible(plugin_hwnd));\n\n main_frame->executeScript(WebString::fromUTF8(\"showFrame(true)\"));\n ASSERT_TRUE(IsWindowVisible(plugin_hwnd));\n}\n#endif\n#endif \/\/!ARCH_CPU_64_BITS\n<|endoftext|>"} {"text":"<commit_before>146d12be-2e4d-11e5-9284-b827eb9e62be<commit_msg>1472256a-2e4d-11e5-9284-b827eb9e62be<commit_after>1472256a-2e4d-11e5-9284-b827eb9e62be<|endoftext|>"} {"text":"<commit_before>23d07d8a-2e4e-11e5-9284-b827eb9e62be<commit_msg>23d58000-2e4e-11e5-9284-b827eb9e62be<commit_after>23d58000-2e4e-11e5-9284-b827eb9e62be<|endoftext|>"} {"text":"<commit_before>\/*\n * AscEmu Framework based on ArcEmu MMORPG Server\n * Copyright (c) 2014-2018 AscEmu Team <http:\/\/www.ascemu.org>\n * Copyright (C) 2008-2012 ArcEmu Team <http:\/\/www.ArcEmu.org\/>\n *\n * This program is free software: you can redistribute it and\/or modify\n * it under the terms of the GNU Affero General Public License as published by\n * the Free Software Foundation, either version 3 of the License, or\n * any later version.\n *\n * This program is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the\n * GNU Affero General Public License for more details.\n *\n * You should have received a copy of the GNU Affero General Public License\n * along with this program. If not, see <http:\/\/www.gnu.org\/licenses\/>.\n *\/\n\n#include \"Setup.h\"\n#include \"Units\/Summons\/Summon.h\"\n#include \"Management\/Item.h\"\n#include \"Management\/ItemInterface.h\"\n#include \"Map\/MapMgr.h\"\n#include \"Objects\/Faction.h\"\n#include \"Units\/Creatures\/Pet.h\"\n#include \"Spell\/Spell.h\"\n#include \"Server\/Script\/ScriptMgr.h\"\n#include <Spell\/Definitions\/PowerType.h>\n\nclass ArmyOfTheDeadGhoulAI : public CreatureAIScript\n{\n ADD_CREATURE_FACTORY_FUNCTION(ArmyOfTheDeadGhoulAI);\n explicit ArmyOfTheDeadGhoulAI(Creature* pCreature) : CreatureAIScript(pCreature)\n {\n getCreature()->GetAIInterface()->m_canMove = false;\n }\n\n void OnLoad()\n {\n RegisterAIUpdateEvent(200);\n\n if (getCreature()->isSummon())\n {\n Summon* s = static_cast<Summon*>(getCreature());\n\n float parent_bonus = s->getUnitOwner()->GetDamageDoneMod(SCHOOL_NORMAL) * 0.04f;\n\n s->setMinDamage(s->getMinDamage() + parent_bonus);\n s->setMaxDamage(s->getMaxDamage() + parent_bonus);\n }\n }\n\n void AIUpdate()\n {\n getCreature()->CastSpell(getCreature()->getGuid(), 20480, false);\n RemoveAIUpdateEvent();\n getCreature()->GetAIInterface()->m_canMove = true;\n }\n};\n\nclass ShadowFiendAI : public CreatureAIScript\n{\n ADD_CREATURE_FACTORY_FUNCTION(ShadowFiendAI);\n explicit ShadowFiendAI(Creature* pCreature) : CreatureAIScript(pCreature)\n {\n }\n\n void OnLoad()\n {\n if (getCreature()->isPet())\n {\n Pet* s = static_cast<Pet*>(getCreature());\n Player* owner = dynamic_cast<Player*>(s->getPlayerOwner());\n\n float owner_bonus = static_cast<float>(owner->GetDamageDoneMod(SCHOOL_SHADOW) * 0.375f); \/\/ 37.5%\n s->BaseAttackType = SCHOOL_SHADOW; \/\/ Melee hits are supposed to do damage with the shadow school\n s->setBaseAttackTime(MELEE, 1500); \/\/ Shadowfiend is supposed to do 10 attacks, sometimes it can be 11\n s->setMinDamage(s->getMinDamage() + owner_bonus);\n s->setMaxDamage(s->getMaxDamage() + owner_bonus);\n s->BaseDamage[0] += owner_bonus;\n s->BaseDamage[1] += owner_bonus;\n\n Unit* uTarget = s->GetMapMgr()->GetUnit(owner->getTargetGuid());\n if ((uTarget != NULL) && isAttackable(owner, uTarget))\n {\n s->GetAIInterface()->AttackReaction(uTarget, 1);\n s->GetAIInterface()->setNextTarget(uTarget);\n }\n }\n }\n};\n\nclass MirrorImageAI : public CreatureAIScript\n{\n ADD_CREATURE_FACTORY_FUNCTION(MirrorImageAI);\n explicit MirrorImageAI(Creature* pCreature) : CreatureAIScript(pCreature)\n {\n }\n\n void OnLoad()\n {\n if (getCreature()->isSummon())\n {\n Summon* s = static_cast<Summon*>(getCreature());\n Unit* owner = s->getUnitOwner();\n\n owner->CastSpell(getCreature(), 45204, true); \/\/ clone me\n owner->CastSpell(getCreature(), 58838, true); \/\/ inherit threat list\n\n \/\/ Mage mirror image spell\n if (getCreature()->getCreatedBySpellId() == 58833)\n {\n getCreature()->setMaxHealth(2500);\n getCreature()->setHealth(2500);\n getCreature()->setMaxPower(POWER_TYPE_MANA, owner->getMaxPower(POWER_TYPE_MANA));\n getCreature()->setPower(POWER_TYPE_MANA, owner->getPower(POWER_TYPE_MANA));\n\n DBC::Structures::SpellRangeEntry const* range = NULL;\n\n AI_Spell sp1;\n sp1.entryId = 59638;\n sp1.spell = sSpellCustomizations.GetSpellInfo(sp1.entryId);\n if (!sp1.spell)\n return;\n\n sp1.spellType = STYPE_DAMAGE;\n sp1.agent = AGENT_SPELL;\n sp1.spelltargetType = TTYPE_SINGLETARGET;\n sp1.cooldown = 0;\n sp1.cooldowntime = 0;\n sp1.Misc2 = 0;\n sp1.procCount = 0;\n sp1.procChance = 100;\n range = sSpellRangeStore.LookupEntry(sp1.spell->getRangeIndex());\n sp1.minrange = GetMinRange(range);\n sp1.maxrange = GetMaxRange(range);\n\n getCreature()->GetAIInterface()->addSpellToList(&sp1);\n\n AI_Spell sp2;\n sp2.entryId = 59637;\n sp2.spell = sSpellCustomizations.GetSpellInfo(sp2.entryId);\n if (!sp2.spell)\n return;\n\n sp2.spellType = STYPE_DAMAGE;\n sp2.agent = AGENT_SPELL;\n sp2.spelltargetType = TTYPE_SINGLETARGET;\n sp2.cooldown = 0;\n sp2.cooldowntime = 0;\n sp2.Misc2 = 0;\n sp2.procCount = 0;\n sp2.procChance = 100;\n range = sSpellRangeStore.LookupEntry(sp2.spell->getRangeIndex());\n sp2.minrange = GetMinRange(range);\n sp2.maxrange = GetMaxRange(range);\n\n getCreature()->GetAIInterface()->addSpellToList(&sp2);\n }\n }\n }\n};\n\n\nclass DancingRuneWeaponAI : public CreatureAIScript\n{\n ADD_CREATURE_FACTORY_FUNCTION(DancingRuneWeaponAI);\n explicit DancingRuneWeaponAI(Creature* pCreature) : CreatureAIScript(pCreature)\n {\n dpsCycle = 0;\n dpsSpell = 0;\n }\n\n void OnLoad() override\n {\n getCreature()->setDisplayId(getCreature()->GetCreatureProperties()->Female_DisplayID);\n getCreature()->setBaseAttackTime(MELEE, 2000);\n\n if (getCreature()->isSummon())\n {\n Summon* s = static_cast<Summon*>(getCreature());\n Unit* owner = s->getUnitOwner();\n\n if (owner->isPlayer())\n {\n Player* pOwner = static_cast<Player*>(owner);\n Item* item = pOwner->GetItemInterface()->GetInventoryItem(EQUIPMENT_SLOT_MAINHAND);\n\n if (item != NULL)\n {\n for (uint8 si = 0; si < 5; si++)\n {\n if (item->getItemProperties()->Spells[si].Id == 0)\n continue;\n\n if (item->getItemProperties()->Spells[si].Trigger == CHANCE_ON_HIT)\n procSpell[si] = item->getItemProperties()->Spells[si].Id;\n }\n\n s->setVirtualItemSlotId(MELEE, item->getEntry());\n s->setBaseAttackTime(MELEE, item->getItemProperties()->Delay);\n }\n\n#if VERSION_STRING == WotLK\n pOwner->setPower(POWER_TYPE_RUNIC_POWER, 0);\n#endif\n }\n\n s->setMinDamage(float(owner->GetDamageDoneMod(SCHOOL_NORMAL)));\n s->setMaxDamage(float(owner->GetDamageDoneMod(SCHOOL_NORMAL)));\n }\n }\n\n void OnCombatStart(Unit* \/*mTarget*\/) override\n {\n RegisterAIUpdateEvent(getCreature()->getBaseAttackTime(MELEE));\n }\n\n void OnCombatStop(Unit* \/*mTarget*\/) override\n {\n RemoveAIUpdateEvent();\n dpsCycle = 0;\n }\n\n void AIUpdate() override\n {\n Unit* curtarget = getCreature()->GetAIInterface()->getNextTarget();\n if (!getCreature()->isCastingSpell() && curtarget)\n {\n switch (dpsCycle)\n {\n case 0:\n dpsSpell = 49921; \/\/ Plague Strike\n break;\n case 1:\n dpsSpell = 49909; \/\/ Icy Touch\n break;\n case 2:\n case 3:\n dpsSpell = 55262; \/\/ Heart Strike x 2\n break;\n case 4:\n dpsSpell = 51425; \/\/ Obliterate\n break;\n case 5:\n dpsSpell = 49895; \/\/ Death Coil\n break;\n case 6:\n case 7:\n dpsSpell = 51425; \/\/ Obliterate x 2\n break;\n case 8:\n case 9:\n dpsSpell = 55262; \/\/ Heart Strike x 2\n break;\n case 10:\n case 11:\n dpsSpell = 49895; \/\/ Death Coil x 2\n break;\n }\n dpsCycle++;\n if (dpsCycle > 11)\n dpsCycle = 0;\n\n SpellInfo* MyNextSpell = sSpellCustomizations.GetSpellInfo(dpsSpell);\n if (MyNextSpell != NULL)\n getCreature()->CastSpell(curtarget, MyNextSpell, true);\n\n }\n }\n\n void OnHit(Unit* mTarget, float \/*fAmount*\/) override\n {\n for (uint8 p = 0; p < 5; p++)\n {\n if (procSpell[p] != 0)\n {\n SpellInfo* mProc = sSpellCustomizations.GetSpellInfo(procSpell[p]);\n if (!mProc)\n return;\n int x = Util::getRandomUInt(99);\n uint32 proc = mProc->getProcChance();\n if (proc < 1)\n proc = 10; \/\/ Got to be fair :P\n\n if ((uint32)x <= proc)\n {\n Unit* Vic = mProc->custom_self_cast_only ? getCreature() : mTarget;\n getCreature()->CastSpell(Vic, mProc, true);\n }\n }\n }\n }\nprivate:\n\n int dpsCycle;\n int dpsSpell;\n int procSpell[5];\n};\n\nclass FrostBroodVanquisherAI : public CreatureAIScript\n{\n ADD_CREATURE_FACTORY_FUNCTION(FrostBroodVanquisherAI);\n explicit FrostBroodVanquisherAI(Creature* pCreature) : CreatureAIScript(pCreature)\n {\n }\n\n void OnLoad()\n {\n getCreature()->setAnimationFlags(UNIT_BYTE1_FLAG_HOVER);\n }\n\n void OnLastPassengerLeft(Unit *passenger)\n {\n if (getCreature()->getSummonedByGuid() == passenger->getGuid())\n getCreature()->Despawn(1 * 1000, 0);\n }\n};\n\nvoid SetupPetAISpells(ScriptMgr* mgr)\n{\n mgr->register_creature_script(24207, &ArmyOfTheDeadGhoulAI::Create);\n mgr->register_creature_script(19668, &ShadowFiendAI::Create);\n mgr->register_creature_script(27893, &DancingRuneWeaponAI::Create);\n mgr->register_creature_script(31216, &MirrorImageAI::Create);\n mgr->register_creature_script(28670, &FrostBroodVanquisherAI::Create);\n};\n<commit_msg>Style: Clean up PetAISpells.cpp<commit_after>\/*\n * AscEmu Framework based on ArcEmu MMORPG Server\n * Copyright (c) 2014-2018 AscEmu Team <http:\/\/www.ascemu.org>\n * Copyright (C) 2008-2012 ArcEmu Team <http:\/\/www.ArcEmu.org\/>\n *\n * This program is free software: you can redistribute it and\/or modify\n * it under the terms of the GNU Affero General Public License as published by\n * the Free Software Foundation, either version 3 of the License, or\n * any later version.\n *\n * This program is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the\n * GNU Affero General Public License for more details.\n *\n * You should have received a copy of the GNU Affero General Public License\n * along with this program. If not, see <http:\/\/www.gnu.org\/licenses\/>.\n *\/\n\n#include \"Setup.h\"\n#include \"Units\/Summons\/Summon.h\"\n#include \"Management\/Item.h\"\n#include \"Management\/ItemInterface.h\"\n#include \"Map\/MapMgr.h\"\n#include \"Objects\/Faction.h\"\n#include \"Units\/Creatures\/Pet.h\"\n#include \"Spell\/Spell.h\"\n#include \"Server\/Script\/ScriptMgr.h\"\n#include <Spell\/Definitions\/PowerType.h>\n\nclass ArmyOfTheDeadGhoulAI : public CreatureAIScript\n{\n ADD_CREATURE_FACTORY_FUNCTION(ArmyOfTheDeadGhoulAI)\n explicit ArmyOfTheDeadGhoulAI(Creature* pCreature) : CreatureAIScript(pCreature)\n {\n getCreature()->GetAIInterface()->m_canMove = false;\n }\n\n void OnLoad() override\n {\n RegisterAIUpdateEvent(200);\n\n if (getCreature()->isSummon())\n {\n auto summon = dynamic_cast<Summon*>(getCreature());\n\n const auto parentBonus = summon->getUnitOwner()->GetDamageDoneMod(SCHOOL_NORMAL) * 0.04f;\n\n summon->setMinDamage(summon->getMinDamage() + parentBonus);\n summon->setMaxDamage(summon->getMaxDamage() + parentBonus);\n }\n }\n\n void AIUpdate() override\n {\n getCreature()->CastSpell(getCreature()->getGuid(), 20480, false);\n RemoveAIUpdateEvent();\n getCreature()->GetAIInterface()->m_canMove = true;\n }\n};\n\nclass ShadowFiendAI : public CreatureAIScript\n{\n ADD_CREATURE_FACTORY_FUNCTION(ShadowFiendAI)\n explicit ShadowFiendAI(Creature* pCreature) : CreatureAIScript(pCreature)\n {\n }\n\n void OnLoad() override\n {\n if (getCreature()->isPet())\n {\n auto pet = dynamic_cast<Pet*>(getCreature());\n auto playerOwner = dynamic_cast<Player*>(pet->getPlayerOwner());\n\n const auto ownerBonus = static_cast<float>(playerOwner->GetDamageDoneMod(SCHOOL_SHADOW) * 0.375f); \/\/ 37.5%\n pet->BaseAttackType = SCHOOL_SHADOW; \/\/ Melee hits are supposed to do damage with the shadow school\n pet->setBaseAttackTime(MELEE, 1500); \/\/ Shadowfiend is supposed to do 10 attacks, sometimes it can be 11\n pet->setMinDamage(pet->getMinDamage() + ownerBonus);\n pet->setMaxDamage(pet->getMaxDamage() + ownerBonus);\n pet->BaseDamage[0] += ownerBonus;\n pet->BaseDamage[1] += ownerBonus;\n\n const auto unitTarget = pet->GetMapMgr()->GetUnit(playerOwner->getTargetGuid());\n if (unitTarget != nullptr && isAttackable(playerOwner, unitTarget))\n {\n pet->GetAIInterface()->AttackReaction(unitTarget, 1);\n pet->GetAIInterface()->setNextTarget(unitTarget);\n }\n }\n }\n};\n\nclass MirrorImageAI : public CreatureAIScript\n{\n ADD_CREATURE_FACTORY_FUNCTION(MirrorImageAI)\n explicit MirrorImageAI(Creature* pCreature) : CreatureAIScript(pCreature)\n {\n }\n\n void OnLoad() override\n {\n if (getCreature()->isSummon())\n {\n auto summon = dynamic_cast<Summon*>(getCreature());\n auto unitOwner = summon->getUnitOwner();\n\n unitOwner->CastSpell(getCreature(), 45204, true); \/\/ clone me\n unitOwner->CastSpell(getCreature(), 58838, true); \/\/ inherit threat list\n\n \/\/ Mage mirror image spell\n if (getCreature()->getCreatedBySpellId() == 58833)\n {\n getCreature()->setMaxHealth(2500);\n getCreature()->setHealth(2500);\n getCreature()->setMaxPower(POWER_TYPE_MANA, unitOwner->getMaxPower(POWER_TYPE_MANA));\n getCreature()->setPower(POWER_TYPE_MANA, unitOwner->getPower(POWER_TYPE_MANA));\n\n DBC::Structures::SpellRangeEntry const* range = nullptr;\n\n AI_Spell sp1{};\n sp1.entryId = 59638;\n sp1.spell = sSpellCustomizations.GetSpellInfo(sp1.entryId);\n if (!sp1.spell)\n return;\n\n sp1.spellType = STYPE_DAMAGE;\n sp1.agent = AGENT_SPELL;\n sp1.spelltargetType = TTYPE_SINGLETARGET;\n sp1.cooldown = 0;\n sp1.cooldowntime = 0;\n sp1.Misc2 = 0;\n sp1.procCount = 0;\n sp1.procChance = 100;\n range = sSpellRangeStore.LookupEntry(sp1.spell->getRangeIndex());\n sp1.minrange = GetMinRange(range);\n sp1.maxrange = GetMaxRange(range);\n\n getCreature()->GetAIInterface()->addSpellToList(&sp1);\n\n AI_Spell sp2{};\n sp2.entryId = 59637;\n sp2.spell = sSpellCustomizations.GetSpellInfo(sp2.entryId);\n if (!sp2.spell)\n return;\n\n sp2.spellType = STYPE_DAMAGE;\n sp2.agent = AGENT_SPELL;\n sp2.spelltargetType = TTYPE_SINGLETARGET;\n sp2.cooldown = 0;\n sp2.cooldowntime = 0;\n sp2.Misc2 = 0;\n sp2.procCount = 0;\n sp2.procChance = 100;\n range = sSpellRangeStore.LookupEntry(sp2.spell->getRangeIndex());\n sp2.minrange = GetMinRange(range);\n sp2.maxrange = GetMaxRange(range);\n\n getCreature()->GetAIInterface()->addSpellToList(&sp2);\n }\n }\n }\n};\n\n\nclass DancingRuneWeaponAI : public CreatureAIScript\n{\n ADD_CREATURE_FACTORY_FUNCTION(DancingRuneWeaponAI)\n explicit DancingRuneWeaponAI(Creature* pCreature) : CreatureAIScript(pCreature)\n {\n dpsCycle = 0;\n dpsSpell = 0;\n }\n\n void OnLoad() override\n {\n getCreature()->setDisplayId(getCreature()->GetCreatureProperties()->Female_DisplayID);\n getCreature()->setBaseAttackTime(MELEE, 2000);\n\n if (getCreature()->isSummon())\n {\n auto summon = dynamic_cast<Summon*>(getCreature());\n auto unitOwner = summon->getUnitOwner();\n\n if (unitOwner->isPlayer())\n {\n auto playerOwner = dynamic_cast<Player*>(unitOwner);\n const auto item = playerOwner->GetItemInterface()->GetInventoryItem(EQUIPMENT_SLOT_MAINHAND);\n if (item != nullptr)\n {\n for (uint8 si = 0; si < 5; si++)\n {\n if (item->getItemProperties()->Spells[si].Id == 0)\n continue;\n\n if (item->getItemProperties()->Spells[si].Trigger == CHANCE_ON_HIT)\n procSpell[si] = item->getItemProperties()->Spells[si].Id;\n }\n\n summon->setVirtualItemSlotId(MELEE, item->getEntry());\n summon->setBaseAttackTime(MELEE, item->getItemProperties()->Delay);\n }\n\n#if VERSION_STRING == WotLK\n playerOwner->setPower(POWER_TYPE_RUNIC_POWER, 0);\n#endif\n }\n\n summon->setMinDamage(float(unitOwner->GetDamageDoneMod(SCHOOL_NORMAL)));\n summon->setMaxDamage(float(unitOwner->GetDamageDoneMod(SCHOOL_NORMAL)));\n }\n }\n\n void OnCombatStart(Unit* \/*mTarget*\/) override\n {\n RegisterAIUpdateEvent(getCreature()->getBaseAttackTime(MELEE));\n }\n\n void OnCombatStop(Unit* \/*mTarget*\/) override\n {\n RemoveAIUpdateEvent();\n dpsCycle = 0;\n }\n\n void AIUpdate() override\n {\n const auto currentTarget = getCreature()->GetAIInterface()->getNextTarget();\n if (!getCreature()->isCastingSpell() && currentTarget)\n {\n switch (dpsCycle)\n {\n case 0:\n dpsSpell = 49921; \/\/ Plague Strike\n break;\n case 1:\n dpsSpell = 49909; \/\/ Icy Touch\n break;\n case 2:\n case 3:\n dpsSpell = 55262; \/\/ Heart Strike x 2\n break;\n case 4:\n dpsSpell = 51425; \/\/ Obliterate\n break;\n case 5:\n dpsSpell = 49895; \/\/ Death Coil\n break;\n case 6:\n case 7:\n dpsSpell = 51425; \/\/ Obliterate x 2\n break;\n case 8:\n case 9:\n dpsSpell = 55262; \/\/ Heart Strike x 2\n break;\n case 10:\n case 11:\n dpsSpell = 49895; \/\/ Death Coil x 2\n break;\n default: \n break;\n }\n dpsCycle++;\n\n if (dpsCycle > 11)\n dpsCycle = 0;\n\n const auto nextSpell = sSpellCustomizations.GetSpellInfo(dpsSpell);\n if (nextSpell)\n getCreature()->CastSpell(currentTarget, nextSpell, true);\n }\n }\n\n void OnHit(Unit* mTarget, float \/*fAmount*\/) override\n {\n for (auto p : procSpell)\n {\n if (p != 0)\n {\n const auto spellProc = sSpellCustomizations.GetSpellInfo(p);\n if (!spellProc)\n return;\n\n const auto randomProcChance = Util::getRandomUInt(99);\n uint32_t spellProcChance = spellProc->getProcChance();\n if (spellProcChance < 1)\n spellProcChance = 10; \/\/ Got to be fair :P\n\n if (randomProcChance <= spellProcChance)\n {\n const auto victim = spellProc->custom_self_cast_only ? getCreature() : mTarget;\n getCreature()->CastSpell(victim, spellProc, true);\n }\n }\n }\n }\nprivate:\n\n int dpsCycle;\n int dpsSpell;\n int procSpell[5];\n};\n\nclass FrostBroodVanquisherAI : public CreatureAIScript\n{\n ADD_CREATURE_FACTORY_FUNCTION(FrostBroodVanquisherAI)\n explicit FrostBroodVanquisherAI(Creature* pCreature) : CreatureAIScript(pCreature)\n {\n }\n\n void OnLoad() override\n {\n getCreature()->setAnimationFlags(UNIT_BYTE1_FLAG_HOVER);\n }\n\n void OnLastPassengerLeft(Unit *passenger) override\n {\n if (getCreature()->getSummonedByGuid() == passenger->getGuid())\n getCreature()->Despawn(1 * 1000, 0);\n }\n};\n\nvoid SetupPetAISpells(ScriptMgr* mgr)\n{\n mgr->register_creature_script(24207, &ArmyOfTheDeadGhoulAI::Create);\n mgr->register_creature_script(19668, &ShadowFiendAI::Create);\n mgr->register_creature_script(27893, &DancingRuneWeaponAI::Create);\n mgr->register_creature_script(31216, &MirrorImageAI::Create);\n mgr->register_creature_script(28670, &FrostBroodVanquisherAI::Create);\n}\n<|endoftext|>"} {"text":"<commit_before>9c8bbbd2-2e4d-11e5-9284-b827eb9e62be<commit_msg>9c90b448-2e4d-11e5-9284-b827eb9e62be<commit_after>9c90b448-2e4d-11e5-9284-b827eb9e62be<|endoftext|>"} {"text":"<commit_before><commit_msg>Reverting my previous experiment.<commit_after><|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\/\/===- cubin_creator.cc -----------------------------------------*- C++ -*-===\/\/\n\/\/\n\/\/ This file implements the function to compile a TF kernel function to a cubin.\n\/\/\n\/\/===----------------------------------------------------------------------===\/\/\n#include \"tensorflow\/compiler\/mlir\/tools\/kernel_gen\/cubin_creator.h\"\n\n#include <string>\n#include <utility>\n#include <vector>\n\n#include \"absl\/memory\/memory.h\"\n#include \"absl\/strings\/escaping.h\"\n#include \"llvm\/ADT\/ArrayRef.h\"\n#include \"llvm\/ADT\/None.h\"\n#include \"llvm\/ADT\/StringRef.h\"\n#include \"llvm\/Support\/Debug.h\"\n#include \"mlir\/Dialect\/GPU\/GPUDialect.h\" \/\/ from @llvm-project\n#include \"mlir\/Dialect\/LLVMIR\/LLVMDialect.h\" \/\/ from @llvm-project\n#include \"mlir\/Dialect\/StandardOps\/IR\/Ops.h\" \/\/ from @llvm-project\n#include \"mlir\/IR\/Dialect.h\" \/\/ from @llvm-project\n#include \"mlir\/IR\/Function.h\" \/\/ from @llvm-project\n#include \"mlir\/IR\/Operation.h\" \/\/ from @llvm-project\n#include \"mlir\/IR\/StandardTypes.h\" \/\/ from @llvm-project\n#include \"mlir\/IR\/Value.h\" \/\/ from @llvm-project\n#include \"mlir\/Parser.h\" \/\/ from @llvm-project\n#include \"mlir\/Pass\/Pass.h\" \/\/ from @llvm-project\n#include \"mlir\/Pass\/PassManager.h\" \/\/ from @llvm-project\n#include \"mlir\/Target\/NVVMIR.h\" \/\/ from @llvm-project\n#include \"mlir\/Transforms\/DialectConversion.h\" \/\/ from @llvm-project\n#include \"tensorflow\/compiler\/mlir\/tensorflow\/ir\/tf_ops.h\"\n#include \"tensorflow\/compiler\/mlir\/xla\/ir\/hlo_ops.h\"\n#include \"tensorflow\/compiler\/mlir\/xla\/transforms\/passes.h\"\n#include \"tensorflow\/compiler\/mlir\/xla\/transforms\/rewriters.h\"\n#include \"tensorflow\/compiler\/xla\/debug_options_flags.h\"\n#include \"tensorflow\/compiler\/xla\/service\/gpu\/llvm_gpu_backend\/gpu_backend_lib.h\"\n#include \"tensorflow\/compiler\/xla\/service\/gpu\/stream_executor_util.h\"\n#include \"tensorflow\/compiler\/xla\/service\/gpu\/target_constants.h\"\n#include \"tensorflow\/compiler\/xla\/service\/mlir_gpu\/kernel_lowering.h\"\n#include \"tensorflow\/core\/platform\/cuda_libdevice_path.h\"\n#include \"tensorflow\/core\/platform\/logging.h\"\n#include \"tensorflow\/core\/platform\/path.h\"\n#if GOOGLE_CUDA\n#include \"tensorflow\/stream_executor\/gpu\/asm_compiler.h\"\n#endif\n\nnamespace {\nusing tensorflow::Status;\nusing xla::InternalError;\nusing xla::StatusOr;\n\nStatusOr<std::string> GetLibdeviceDir(\n const xla::HloModuleConfig& hlo_module_config) {\n for (const std::string& cuda_root : tensorflow::CandidateCudaRoots(\n hlo_module_config.debug_options().xla_gpu_cuda_data_dir())) {\n std::string libdevice_dir =\n tensorflow::io::JoinPath(cuda_root, \"nvvm\", \"libdevice\");\n VLOG(2) << \"Looking for libdevice at \" << libdevice_dir;\n if (tensorflow::Env::Default()->IsDirectory(libdevice_dir).ok()) {\n VLOG(2) << \"Found libdevice dir \" << libdevice_dir;\n return libdevice_dir;\n }\n }\n return InternalError(\n \"Can't find libdevice directory ${CUDA_DIR}\/nvvm\/libdevice\");\n}\n\nstruct MaterializeBroadcastsPass\n : public mlir::PassWrapper<MaterializeBroadcastsPass, mlir::FunctionPass> {\n void runOnFunction() override {\n mlir::ConversionTarget conversionTarget(getContext());\n mlir::OwningRewritePatternList conversionPatterns;\n\n \/\/ Consider the xla_hlo dialect legal for tests.\n conversionTarget.addLegalDialect<mlir::xla_hlo::XlaHloDialect>();\n \/\/ The conversion uses helpers from the Standard dialect.\n conversionTarget.addLegalDialect<mlir::StandardOpsDialect>();\n\n mlir::xla_hlo::SetupMaterializeBroadcastsLegality(&getContext(),\n &conversionTarget);\n mlir::xla_hlo::PopulateMaterializeBroadcastsPatterns(&getContext(),\n &conversionPatterns);\n\n if (failed(applyPartialConversion(getFunction(), conversionTarget,\n conversionPatterns))) {\n return signalPassFailure();\n }\n }\n};\n\nstruct UnfuseBatchNormPass\n : public mlir::PassWrapper<UnfuseBatchNormPass, mlir::FunctionPass> {\n void runOnFunction() override {\n mlir::OwningRewritePatternList patterns;\n mlir::xla_hlo::PopulateUnfuseBatchNormPatterns(&getContext(), &patterns);\n mlir::applyPatternsAndFoldGreedily(getOperation(), patterns);\n }\n};\n\nStatus LowerTfOpToLhloWithDynamicShapes(mlir::ModuleOp module) {\n mlir::PassManager pm(module.getContext());\n auto enable_if_vlog_is_on = [](mlir::Pass* pass, mlir::Operation* op) {\n return VLOG_IS_ON(1);\n };\n pm.enableIRPrinting(\/*shouldPrintBeforePass=*\/{},\n \/*shouldPrintAfterPass=*\/enable_if_vlog_is_on,\n \/*printModuleScope=*\/false,\n \/*printAfterOnlyOnChange=*\/false, llvm::dbgs());\n pm.addNestedPass<mlir::FuncOp>(mlir::xla_hlo::createLegalizeTFPass(false));\n pm.addNestedPass<mlir::FuncOp>(\n absl::make_unique<MaterializeBroadcastsPass>());\n pm.addNestedPass<mlir::FuncOp>(absl::make_unique<UnfuseBatchNormPass>());\n pm.addPass(mlir::xla_hlo::createLegalizeToLhloPass(\n \/*results_escape_functions=*\/true));\n pm.addNestedPass<mlir::FuncOp>(mlir::xla_lhlo::createLhloCopyRemovalPass());\n\n if (failed(pm.run(module))) {\n return InternalError(\"Lowering TF to LHLO failed.\");\n }\n return Status::OK();\n}\n\nstruct PropagateStaticKnowledge\n : public mlir::PassWrapper<PropagateStaticKnowledge,\n mlir::OperationPass<mlir::LLVM::LLVMFuncOp>> {\n explicit PropagateStaticKnowledge(mlir::FunctionType type,\n llvm::ArrayRef<uint32_t> same_shape_)\n : func_type(type), same_shape(same_shape_) {}\n\n void runOnOperation() override {\n \/\/ We know due to tensorflow ABI that the offset is always 0 and that the\n \/\/ innermost stride is always 1. To make this visible to the compiler,\n \/\/ we insert constants into the code and replace usages accordingly.\n \/\/ We do not change the signature so that we keep a somewhat stable ABI\n \/\/ that is easy to undertand by tools.\n mlir::LLVM::LLVMFuncOp func = getOperation();\n\n \/\/ This only works if the function is local and we can rewrite it.\n if (func.isExternal()) return;\n\n mlir::OpBuilder b(func.getBody());\n \/\/ Steal the LLVM representation of the index type from the third argument.\n auto index_type = func.getArgument(3).getType();\n mlir::Value one = b.create<mlir::LLVM::ConstantOp>(\n func.getLoc(), index_type, b.getIntegerAttr(b.getIndexType(), 1));\n mlir::Value zero = b.create<mlir::LLVM::ConstantOp>(\n func.getLoc(), index_type, b.getIntegerAttr(b.getIndexType(), 0));\n uint32_t arg_pos = 0;\n std::vector<uint32_t> positions;\n \/\/ Collect the agument and return types of the surrounding function.\n auto arg_types = llvm::to_vector<4>(llvm::concat<const mlir::Type>(\n func_type.getInputs(), func_type.getResults()));\n for (mlir::Type arg_type : arg_types) {\n if (!arg_type.isa<mlir::MemRefType>()) {\n func.emitError() << \"argument of surrounding func is not ranked memref\";\n signalPassFailure();\n return;\n }\n positions.push_back(arg_pos);\n \/\/ Replace the offset with zero. Offset is argument number 3.\n func.getArgument(arg_pos + 2).replaceAllUsesWith(zero);\n \/\/ Forward over base_ptr, aligned_ptr, offset, size and stride arguments.\n arg_pos += 3 + arg_type.cast<mlir::MemRefType>().getRank() * 2;\n \/\/ Replace the last stride with constant 1.\n func.getArgument(arg_pos - 1).replaceAllUsesWith(one);\n }\n\n \/\/ If we have knowledge that some arguments have the same shape, we\n \/\/ can use that here. Simply replace usages of the shape parameters within\n \/\/ the function body to a single shape parameter.\n if (!same_shape.empty()) {\n auto first = same_shape.front();\n auto first_offset = positions.at(first);\n auto first_type = arg_types[first].cast<mlir::ShapedType>();\n uint32_t rank = first_type.getRank();\n for (auto same : same_shape.drop_front(1)) {\n uint32_t same_offset = positions.at(same);\n auto same_type = arg_types[same].cast<mlir::ShapedType>();\n if (same_type.getRank() != rank) {\n func.emitOpError() << \"same shape constraints on arguments with \"\n \"non-matching shapes: #\"\n << first << \" and #\" << same;\n signalPassFailure();\n continue;\n }\n\n for (uint32_t i = 0; i < 2 * rank; ++i) {\n \/\/ Replace uses for second arg data with first arg.\n auto same_arg = func.getArgument(same_offset + 3 + i);\n auto first_arg = func.getArgument(first_offset + 3 + i);\n same_arg.replaceAllUsesWith(first_arg);\n }\n }\n }\n }\n\n mlir::FunctionType func_type;\n llvm::ArrayRef<uint32_t> same_shape;\n};\n\nStatus PropagateStaticShapeKnowledgeToKernel(\n mlir::ModuleOp module, llvm::ArrayRef<uint32_t> same_shape) {\n \/\/ Grab the original signature from the single function.\n auto func = *module.getBody()->op_begin<mlir::FuncOp>();\n\n mlir::PassManager pm(module.getContext());\n auto enable_if_vlog_is_on = [](mlir::Pass*, mlir::Operation*) {\n return VLOG_IS_ON(1);\n };\n pm.enableIRPrinting(\/*shouldPrintBeforePass=*\/{},\n \/*shouldPrintAfterPass=*\/enable_if_vlog_is_on,\n \/*printModuleScope=*\/false,\n \/*printAfterOnlyOnChange=*\/false, llvm::dbgs());\n auto& kernel_pm = pm.nest<::mlir::gpu::GPUModuleOp>();\n kernel_pm.addNestedPass<mlir::LLVM::LLVMFuncOp>(\n absl::make_unique<PropagateStaticKnowledge>(func.getType(), same_shape));\n\n if (failed(pm.run(module))) {\n return InternalError(\"Static knowledge propagation failed.\");\n }\n return Status::OK();\n}\n\nvoid RegisterDialects() {\n static bool init_once = []() {\n mlir::registerDialect<mlir::TF::TensorFlowDialect>();\n return true;\n }();\n (void)init_once;\n}\n} \/\/ namespace\n\nStatusOr<std::vector<uint8_t>> tensorflow::kernel_gen::GenerateCubinForTfCode(\n llvm::StringRef tf_code, std::pair<int32_t, int32_t> compute_capability,\n llvm::ArrayRef<uint32_t> tile_sizes, llvm::ArrayRef<uint32_t> same_shape,\n llvm::ArrayRef<uint32_t> unroll_factors) {\n RegisterDialects();\n mlir::MLIRContext context;\n mlir::OwningModuleRef module = mlir::parseSourceString(tf_code, &context);\n\n TF_RETURN_IF_ERROR(LowerTfOpToLhloWithDynamicShapes(module.get()));\n {\n xla::mlir_gpu::LowerLHLOToGPUOptions options;\n options.tile_sizes = tile_sizes;\n options.unroll_factors = unroll_factors;\n options.collapse_parallel_loops = false;\n TF_RETURN_IF_ERROR(xla::mlir_gpu::LowerLHLOToGPU(module.get(), options));\n }\n TF_RETURN_IF_ERROR(xla::mlir_gpu::LowerKernelBodiesToNVVM(module.get()));\n TF_RETURN_IF_ERROR(\n PropagateStaticShapeKnowledgeToKernel(module.get(), same_shape));\n\n mlir::OwningModuleRef kernel_module =\n xla::mlir_gpu::ExtractKernelModule(*module).ValueOrDie();\n auto llvmModule = mlir::translateModuleToNVVMIR(*kernel_module);\n if (!llvmModule) {\n return InternalError(\"Could not translate MLIR module to NVVM\");\n }\n\n llvmModule->setModuleIdentifier(\"acme\");\n llvmModule->setDataLayout(xla::gpu::nvptx::kDataLayout);\n\n xla::HloModuleConfig config;\n config.set_debug_options(xla::GetDebugOptionsFromFlags());\n\n TF_ASSIGN_OR_RETURN(std::string libdevice_dir, GetLibdeviceDir(config));\n TF_ASSIGN_OR_RETURN(std::string ptx, xla::gpu::nvptx::CompileToPtx(\n llvmModule.get(), compute_capability,\n config, libdevice_dir));\n VLOG(1) << ptx;\n\n#if GOOGLE_CUDA\n return tensorflow::se::CompileGpuAsm(\n std::get<0>(compute_capability), std::get<1>(compute_capability),\n ptx.c_str(), xla::gpu::PtxOptsFromConfig(config));\n#else\n return InternalError(\n \"GOOGLE_CUDA not defined. Did you specify --config=cuda ?\");\n#endif\n}\n<commit_msg>Propagate noalias and alignment properties of TensorFlow ABI into kernels.<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\/\/===- cubin_creator.cc -----------------------------------------*- C++ -*-===\/\/\n\/\/\n\/\/ This file implements the function to compile a TF kernel function to a cubin.\n\/\/\n\/\/===----------------------------------------------------------------------===\/\/\n#include \"tensorflow\/compiler\/mlir\/tools\/kernel_gen\/cubin_creator.h\"\n\n#include <string>\n#include <utility>\n#include <vector>\n\n#include \"absl\/memory\/memory.h\"\n#include \"absl\/strings\/escaping.h\"\n#include \"llvm\/ADT\/ArrayRef.h\"\n#include \"llvm\/ADT\/None.h\"\n#include \"llvm\/ADT\/StringRef.h\"\n#include \"llvm\/Support\/Debug.h\"\n#include \"mlir\/Dialect\/GPU\/GPUDialect.h\" \/\/ from @llvm-project\n#include \"mlir\/Dialect\/LLVMIR\/LLVMDialect.h\" \/\/ from @llvm-project\n#include \"mlir\/Dialect\/StandardOps\/IR\/Ops.h\" \/\/ from @llvm-project\n#include \"mlir\/IR\/Dialect.h\" \/\/ from @llvm-project\n#include \"mlir\/IR\/Function.h\" \/\/ from @llvm-project\n#include \"mlir\/IR\/Operation.h\" \/\/ from @llvm-project\n#include \"mlir\/IR\/StandardTypes.h\" \/\/ from @llvm-project\n#include \"mlir\/IR\/Value.h\" \/\/ from @llvm-project\n#include \"mlir\/Parser.h\" \/\/ from @llvm-project\n#include \"mlir\/Pass\/Pass.h\" \/\/ from @llvm-project\n#include \"mlir\/Pass\/PassManager.h\" \/\/ from @llvm-project\n#include \"mlir\/Target\/NVVMIR.h\" \/\/ from @llvm-project\n#include \"mlir\/Transforms\/DialectConversion.h\" \/\/ from @llvm-project\n#include \"tensorflow\/compiler\/mlir\/tensorflow\/ir\/tf_ops.h\"\n#include \"tensorflow\/compiler\/mlir\/xla\/ir\/hlo_ops.h\"\n#include \"tensorflow\/compiler\/mlir\/xla\/transforms\/passes.h\"\n#include \"tensorflow\/compiler\/mlir\/xla\/transforms\/rewriters.h\"\n#include \"tensorflow\/compiler\/xla\/debug_options_flags.h\"\n#include \"tensorflow\/compiler\/xla\/service\/gpu\/llvm_gpu_backend\/gpu_backend_lib.h\"\n#include \"tensorflow\/compiler\/xla\/service\/gpu\/stream_executor_util.h\"\n#include \"tensorflow\/compiler\/xla\/service\/gpu\/target_constants.h\"\n#include \"tensorflow\/compiler\/xla\/service\/mlir_gpu\/kernel_lowering.h\"\n#include \"tensorflow\/core\/platform\/cuda_libdevice_path.h\"\n#include \"tensorflow\/core\/platform\/logging.h\"\n#include \"tensorflow\/core\/platform\/path.h\"\n#if GOOGLE_CUDA\n#include \"tensorflow\/stream_executor\/gpu\/asm_compiler.h\"\n#endif\n\nnamespace {\nusing tensorflow::Status;\nusing xla::InternalError;\nusing xla::StatusOr;\n\nStatusOr<std::string> GetLibdeviceDir(\n const xla::HloModuleConfig& hlo_module_config) {\n for (const std::string& cuda_root : tensorflow::CandidateCudaRoots(\n hlo_module_config.debug_options().xla_gpu_cuda_data_dir())) {\n std::string libdevice_dir =\n tensorflow::io::JoinPath(cuda_root, \"nvvm\", \"libdevice\");\n VLOG(2) << \"Looking for libdevice at \" << libdevice_dir;\n if (tensorflow::Env::Default()->IsDirectory(libdevice_dir).ok()) {\n VLOG(2) << \"Found libdevice dir \" << libdevice_dir;\n return libdevice_dir;\n }\n }\n return InternalError(\n \"Can't find libdevice directory ${CUDA_DIR}\/nvvm\/libdevice\");\n}\n\nstruct MaterializeBroadcastsPass\n : public mlir::PassWrapper<MaterializeBroadcastsPass, mlir::FunctionPass> {\n void runOnFunction() override {\n mlir::ConversionTarget conversionTarget(getContext());\n mlir::OwningRewritePatternList conversionPatterns;\n\n \/\/ Consider the xla_hlo dialect legal for tests.\n conversionTarget.addLegalDialect<mlir::xla_hlo::XlaHloDialect>();\n \/\/ The conversion uses helpers from the Standard dialect.\n conversionTarget.addLegalDialect<mlir::StandardOpsDialect>();\n\n mlir::xla_hlo::SetupMaterializeBroadcastsLegality(&getContext(),\n &conversionTarget);\n mlir::xla_hlo::PopulateMaterializeBroadcastsPatterns(&getContext(),\n &conversionPatterns);\n\n if (failed(applyPartialConversion(getFunction(), conversionTarget,\n conversionPatterns))) {\n return signalPassFailure();\n }\n }\n};\n\nstruct UnfuseBatchNormPass\n : public mlir::PassWrapper<UnfuseBatchNormPass, mlir::FunctionPass> {\n void runOnFunction() override {\n mlir::OwningRewritePatternList patterns;\n mlir::xla_hlo::PopulateUnfuseBatchNormPatterns(&getContext(), &patterns);\n mlir::applyPatternsAndFoldGreedily(getOperation(), patterns);\n }\n};\n\nStatus LowerTfOpToLhloWithDynamicShapes(mlir::ModuleOp module) {\n mlir::PassManager pm(module.getContext());\n auto enable_if_vlog_is_on = [](mlir::Pass* pass, mlir::Operation* op) {\n return VLOG_IS_ON(1);\n };\n pm.enableIRPrinting(\/*shouldPrintBeforePass=*\/{},\n \/*shouldPrintAfterPass=*\/enable_if_vlog_is_on,\n \/*printModuleScope=*\/false,\n \/*printAfterOnlyOnChange=*\/false, llvm::dbgs());\n pm.addNestedPass<mlir::FuncOp>(mlir::xla_hlo::createLegalizeTFPass(false));\n pm.addNestedPass<mlir::FuncOp>(\n absl::make_unique<MaterializeBroadcastsPass>());\n pm.addNestedPass<mlir::FuncOp>(absl::make_unique<UnfuseBatchNormPass>());\n pm.addPass(mlir::xla_hlo::createLegalizeToLhloPass(\n \/*results_escape_functions=*\/true));\n pm.addNestedPass<mlir::FuncOp>(mlir::xla_lhlo::createLhloCopyRemovalPass());\n\n if (failed(pm.run(module))) {\n return InternalError(\"Lowering TF to LHLO failed.\");\n }\n return Status::OK();\n}\n\nstruct PropagateTensorFlowABIKnowledge\n : public mlir::PassWrapper<PropagateTensorFlowABIKnowledge,\n mlir::OperationPass<mlir::LLVM::LLVMFuncOp>> {\n explicit PropagateTensorFlowABIKnowledge(mlir::FunctionType type,\n llvm::ArrayRef<uint32_t> same_shape_)\n : func_type(type), same_shape(same_shape_) {}\n\n void runOnOperation() override {\n \/\/ We know due to tensorflow ABI that the offset is always 0 and that the\n \/\/ innermost stride is always 1. To make this visible to the compiler,\n \/\/ we insert constants into the code and replace usages accordingly.\n \/\/ We do not change the signature so that we keep a somewhat stable ABI\n \/\/ that is easy to undertand by tools.\n \/\/ We also know that tensorflow aligns all allocated pointers by 16, so\n \/\/ we pass this on. Furthermore, we know that arguments never alias. More\n \/\/ precicely, they may only alias (due to reuse) if the kernel does not\n \/\/ read from a position it previously has written to. We express this with\n \/\/ the noalias attribute.\n mlir::LLVM::LLVMFuncOp func = getOperation();\n\n \/\/ This only works if the function is local and we can rewrite it.\n if (func.isExternal()) return;\n\n mlir::OpBuilder b(func.getBody());\n \/\/ Steal the LLVM representation of the index type from the third argument.\n auto index_type = func.getArgument(3).getType();\n mlir::Value one = b.create<mlir::LLVM::ConstantOp>(\n func.getLoc(), index_type, b.getIntegerAttr(b.getIndexType(), 1));\n mlir::Value zero = b.create<mlir::LLVM::ConstantOp>(\n func.getLoc(), index_type, b.getIntegerAttr(b.getIndexType(), 0));\n uint32_t arg_pos = 0;\n std::vector<uint32_t> positions;\n \/\/ Collect the agument and return types of the surrounding function.\n auto arg_types = llvm::to_vector<4>(llvm::concat<const mlir::Type>(\n func_type.getInputs(), func_type.getResults()));\n for (mlir::Type arg_type : arg_types) {\n if (!arg_type.isa<mlir::MemRefType>()) {\n func.emitError() << \"argument of surrounding func is not ranked memref\";\n signalPassFailure();\n return;\n }\n positions.push_back(arg_pos);\n \/\/ Set alignment and aliasing on the pointers.\n func.setArgAttr(arg_pos + 1, \"llvm.noalias\", b.getBoolAttr(true));\n func.setArgAttr(arg_pos + 1, \"llvm.align\", b.getIndexAttr(16));\n \/\/ Replace the offset with zero. Offset is argument number 3.\n func.getArgument(arg_pos + 2).replaceAllUsesWith(zero);\n \/\/ Forward over base_ptr, aligned_ptr, offset, size and stride arguments.\n arg_pos += 3 + arg_type.cast<mlir::MemRefType>().getRank() * 2;\n \/\/ Replace the last stride with constant 1.\n func.getArgument(arg_pos - 1).replaceAllUsesWith(one);\n }\n\n \/\/ If we have knowledge that some arguments have the same shape, we\n \/\/ can use that here. Simply replace usages of the shape parameters within\n \/\/ the function body to a single shape parameter.\n if (!same_shape.empty()) {\n auto first = same_shape.front();\n auto first_offset = positions.at(first);\n auto first_type = arg_types[first].cast<mlir::ShapedType>();\n uint32_t rank = first_type.getRank();\n for (auto same : same_shape.drop_front(1)) {\n uint32_t same_offset = positions.at(same);\n auto same_type = arg_types[same].cast<mlir::ShapedType>();\n if (same_type.getRank() != rank) {\n func.emitOpError() << \"same shape constraints on arguments with \"\n \"non-matching shapes: #\"\n << first << \" and #\" << same;\n signalPassFailure();\n continue;\n }\n\n for (uint32_t i = 0; i < 2 * rank; ++i) {\n \/\/ Replace uses for second arg data with first arg.\n auto same_arg = func.getArgument(same_offset + 3 + i);\n auto first_arg = func.getArgument(first_offset + 3 + i);\n same_arg.replaceAllUsesWith(first_arg);\n }\n }\n }\n }\n\n mlir::FunctionType func_type;\n llvm::ArrayRef<uint32_t> same_shape;\n};\n\nStatus PropagateTensorFlowABIKnowledgeToKernel(\n mlir::ModuleOp module, llvm::ArrayRef<uint32_t> same_shape) {\n \/\/ Grab the original signature from the single function.\n auto func = *module.getBody()->op_begin<mlir::FuncOp>();\n\n mlir::PassManager pm(module.getContext());\n auto enable_if_vlog_is_on = [](mlir::Pass*, mlir::Operation*) {\n return VLOG_IS_ON(1);\n };\n pm.enableIRPrinting(\/*shouldPrintBeforePass=*\/{},\n \/*shouldPrintAfterPass=*\/enable_if_vlog_is_on,\n \/*printModuleScope=*\/false,\n \/*printAfterOnlyOnChange=*\/false, llvm::dbgs());\n auto& kernel_pm = pm.nest<::mlir::gpu::GPUModuleOp>();\n kernel_pm.addNestedPass<mlir::LLVM::LLVMFuncOp>(\n absl::make_unique<PropagateTensorFlowABIKnowledge>(func.getType(),\n same_shape));\n\n if (failed(pm.run(module))) {\n return InternalError(\"Static knowledge propagation failed.\");\n }\n return Status::OK();\n}\n\nvoid RegisterDialects() {\n static bool init_once = []() {\n mlir::registerDialect<mlir::TF::TensorFlowDialect>();\n return true;\n }();\n (void)init_once;\n}\n} \/\/ namespace\n\nStatusOr<std::vector<uint8_t>> tensorflow::kernel_gen::GenerateCubinForTfCode(\n llvm::StringRef tf_code, std::pair<int32_t, int32_t> compute_capability,\n llvm::ArrayRef<uint32_t> tile_sizes, llvm::ArrayRef<uint32_t> same_shape,\n llvm::ArrayRef<uint32_t> unroll_factors) {\n RegisterDialects();\n mlir::MLIRContext context;\n mlir::OwningModuleRef module = mlir::parseSourceString(tf_code, &context);\n\n TF_RETURN_IF_ERROR(LowerTfOpToLhloWithDynamicShapes(module.get()));\n {\n xla::mlir_gpu::LowerLHLOToGPUOptions options;\n options.tile_sizes = tile_sizes;\n options.unroll_factors = unroll_factors;\n options.collapse_parallel_loops = false;\n TF_RETURN_IF_ERROR(xla::mlir_gpu::LowerLHLOToGPU(module.get(), options));\n }\n TF_RETURN_IF_ERROR(xla::mlir_gpu::LowerKernelBodiesToNVVM(module.get()));\n TF_RETURN_IF_ERROR(\n PropagateTensorFlowABIKnowledgeToKernel(module.get(), same_shape));\n\n mlir::OwningModuleRef kernel_module =\n xla::mlir_gpu::ExtractKernelModule(*module).ValueOrDie();\n auto llvmModule = mlir::translateModuleToNVVMIR(*kernel_module);\n if (!llvmModule) {\n return InternalError(\"Could not translate MLIR module to NVVM\");\n }\n\n llvmModule->setModuleIdentifier(\"acme\");\n llvmModule->setDataLayout(xla::gpu::nvptx::kDataLayout);\n\n xla::HloModuleConfig config;\n config.set_debug_options(xla::GetDebugOptionsFromFlags());\n\n TF_ASSIGN_OR_RETURN(std::string libdevice_dir, GetLibdeviceDir(config));\n TF_ASSIGN_OR_RETURN(std::string ptx, xla::gpu::nvptx::CompileToPtx(\n llvmModule.get(), compute_capability,\n config, libdevice_dir));\n VLOG(1) << ptx;\n\n#if GOOGLE_CUDA\n return tensorflow::se::CompileGpuAsm(\n std::get<0>(compute_capability), std::get<1>(compute_capability),\n ptx.c_str(), xla::gpu::PtxOptsFromConfig(config));\n#else\n return InternalError(\n \"GOOGLE_CUDA not defined. Did you specify --config=cuda ?\");\n#endif\n}\n<|endoftext|>"} {"text":"<commit_before>3b7c5a2c-2e4d-11e5-9284-b827eb9e62be<commit_msg>3b81676a-2e4d-11e5-9284-b827eb9e62be<commit_after>3b81676a-2e4d-11e5-9284-b827eb9e62be<|endoftext|>"} {"text":"<commit_before>\/*************************************************************************\n *\n * OpenOffice.org - a multi-platform office productivity suite\n *\n * $RCSfile: MetaTContext.cxx,v $\n *\n * $Revision: 1.5 $\n *\n * last change: $Author: hr $ $Date: 2006-06-19 18:53: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 _COM_SUN_STAR_XML_SAX_SAXPARSEEXCEPTION_HPP_\n#include <com\/sun\/star\/xml\/sax\/SAXParseException.hpp>\n#endif\n#ifndef _COM_SUN_STAR_XML_SAX_SAXEXCEPTION_HPP_\n#include <com\/sun\/star\/xml\/sax\/SAXException.hpp>\n#endif\n#ifndef _COM_SUN_STAR_XML_SAX_XDOCUMENTHANDLER_HPP_\n#include <com\/sun\/star\/xml\/sax\/XDocumentHandler.hpp>\n#endif\n#ifndef _COM_SUN_STAR_XML_SAX_XATTRIBUTELIST_HPP_\n#include <com\/sun\/star\/xml\/sax\/XAttributeList.hpp>\n#endif\n#ifndef _XMLOFF_NMSPMAP_HXX\n#include \"nmspmap.hxx\"\n#endif\n#ifndef _XMLOFF_XMLTOKEN_HXX\n#include \"xmltoken.hxx\"\n#endif\n#ifndef _XMLOFF_XMLNMSPE_HXX\n#include \"xmlnmspe.hxx\"\n#endif\n\n#ifndef _XMLOFF_TRANSFOERMERBASE_HXX\n#include \"TransformerBase.hxx\"\n#endif\n#ifndef _XMLOFF_MUTABLEATTRLIST_HXX\n#include \"MutableAttrList.hxx\"\n#endif\n\n#ifndef _XMLOFF_METATCONTEXT_HXX\n#include \"MetaTContext.hxx\"\n#endif\n\nusing ::rtl::OUString;\nusing namespace ::xmloff::token;\nusing namespace ::com::sun::star::uno;\nusing namespace ::com::sun::star::xml::sax;\n\nXMLTokenEnum aMetaTokens[] =\n{\n XML_GENERATOR,\n XML_TITLE,\n XML_DESCRIPTION,\n XML_SUBJECT,\n XML_INITIAL_CREATOR,\n XML_CREATION_DATE,\n XML_CREATOR,\n XML_DATE,\n XML_PRINTED_BY,\n XML_PRINT_DATE,\n XML_KEYWORD,\n XML_LANGUAGE,\n XML_EDITING_CYCLES,\n XML_EDITING_DURATION,\n XML_HYPERLINK_BEHAVIOUR,\n XML_AUTO_RELOAD,\n XML_TEMPLATE,\n XML_USER_DEFINED,\n XML_DOCUMENT_STATISTIC,\n XML_TOKEN_END\n};\n\nTYPEINIT1( XMLMetaTransformerContext, XMLTransformerContext );\n\nXMLMetaTransformerContext::XMLMetaTransformerContext( XMLTransformerBase& rImp,\n const OUString& rQName ) :\n XMLTransformerContext( rImp, rQName )\n{\n}\n\nXMLMetaTransformerContext::~XMLMetaTransformerContext()\n{\n}\n\nXMLTransformerContext *XMLMetaTransformerContext::CreateChildContext(\n sal_uInt16 \/*nPrefix*\/,\n const OUString& rLocalName,\n const OUString& rQName,\n const Reference< XAttributeList >& )\n{\n XMLPersTextContentTContext *pContext =\n new XMLPersTextContentTContext( GetTransformer(), rQName );\n XMLMetaContexts_Impl::value_type aVal( rLocalName, pContext );\n m_aContexts.insert( aVal );\n\n return pContext;\n}\n\nvoid XMLMetaTransformerContext::EndElement()\n{\n \/\/ export everything in the correct order\n OUString aKeywordsQName;\n XMLTokenEnum *pToken = aMetaTokens;\n while( *pToken != XML_TOKEN_END )\n {\n const OUString& rToken = GetXMLToken( *pToken );\n XMLMetaContexts_Impl::const_iterator aIter =\n m_aContexts.find( rToken );\n if( aIter != m_aContexts.end() )\n {\n if( XML_KEYWORD == *pToken )\n {\n aKeywordsQName =\n GetTransformer().GetNamespaceMap().GetQNameByKey(\n XML_NAMESPACE_META, GetXMLToken(XML_KEYWORDS ) );\n\n Reference< XAttributeList > xAttrList =\n new XMLMutableAttributeList;\n GetTransformer().GetDocHandler()->startElement( aKeywordsQName,\n xAttrList );\n }\n\n \/\/ All elements may occur multiple times\n XMLMetaContexts_Impl::const_iterator aEndIter =\n m_aContexts.upper_bound( rToken );\n while( aIter != aEndIter )\n {\n (*aIter).second->Export();\n ++aIter;\n }\n\n if( XML_KEYWORD == *pToken )\n GetTransformer().GetDocHandler()->endElement( aKeywordsQName );\n }\n pToken++;\n }\n\n GetTransformer().GetDocHandler()->endElement( GetQName() );\n}\n\nvoid XMLMetaTransformerContext::Characters( const OUString& )\n{\n \/\/ ignore them\n}\n\n\n<commit_msg>INTEGRATION: CWS pchfix02 (1.5.34); FILE MERGED 2006\/09\/01 18:00:17 kaib 1.5.34.1: #i68856# Added header markers and pch files<commit_after>\/*************************************************************************\n *\n * OpenOffice.org - a multi-platform office productivity suite\n *\n * $RCSfile: MetaTContext.cxx,v $\n *\n * $Revision: 1.6 $\n *\n * last change: $Author: obo $ $Date: 2006-09-17 11:25: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#ifndef _COM_SUN_STAR_XML_SAX_SAXPARSEEXCEPTION_HPP_\n#include <com\/sun\/star\/xml\/sax\/SAXParseException.hpp>\n#endif\n#ifndef _COM_SUN_STAR_XML_SAX_SAXEXCEPTION_HPP_\n#include <com\/sun\/star\/xml\/sax\/SAXException.hpp>\n#endif\n#ifndef _COM_SUN_STAR_XML_SAX_XDOCUMENTHANDLER_HPP_\n#include <com\/sun\/star\/xml\/sax\/XDocumentHandler.hpp>\n#endif\n#ifndef _COM_SUN_STAR_XML_SAX_XATTRIBUTELIST_HPP_\n#include <com\/sun\/star\/xml\/sax\/XAttributeList.hpp>\n#endif\n#ifndef _XMLOFF_NMSPMAP_HXX\n#include \"nmspmap.hxx\"\n#endif\n#ifndef _XMLOFF_XMLTOKEN_HXX\n#include \"xmltoken.hxx\"\n#endif\n#ifndef _XMLOFF_XMLNMSPE_HXX\n#include \"xmlnmspe.hxx\"\n#endif\n\n#ifndef _XMLOFF_TRANSFOERMERBASE_HXX\n#include \"TransformerBase.hxx\"\n#endif\n#ifndef _XMLOFF_MUTABLEATTRLIST_HXX\n#include \"MutableAttrList.hxx\"\n#endif\n\n#ifndef _XMLOFF_METATCONTEXT_HXX\n#include \"MetaTContext.hxx\"\n#endif\n\nusing ::rtl::OUString;\nusing namespace ::xmloff::token;\nusing namespace ::com::sun::star::uno;\nusing namespace ::com::sun::star::xml::sax;\n\nXMLTokenEnum aMetaTokens[] =\n{\n XML_GENERATOR,\n XML_TITLE,\n XML_DESCRIPTION,\n XML_SUBJECT,\n XML_INITIAL_CREATOR,\n XML_CREATION_DATE,\n XML_CREATOR,\n XML_DATE,\n XML_PRINTED_BY,\n XML_PRINT_DATE,\n XML_KEYWORD,\n XML_LANGUAGE,\n XML_EDITING_CYCLES,\n XML_EDITING_DURATION,\n XML_HYPERLINK_BEHAVIOUR,\n XML_AUTO_RELOAD,\n XML_TEMPLATE,\n XML_USER_DEFINED,\n XML_DOCUMENT_STATISTIC,\n XML_TOKEN_END\n};\n\nTYPEINIT1( XMLMetaTransformerContext, XMLTransformerContext );\n\nXMLMetaTransformerContext::XMLMetaTransformerContext( XMLTransformerBase& rImp,\n const OUString& rQName ) :\n XMLTransformerContext( rImp, rQName )\n{\n}\n\nXMLMetaTransformerContext::~XMLMetaTransformerContext()\n{\n}\n\nXMLTransformerContext *XMLMetaTransformerContext::CreateChildContext(\n sal_uInt16 \/*nPrefix*\/,\n const OUString& rLocalName,\n const OUString& rQName,\n const Reference< XAttributeList >& )\n{\n XMLPersTextContentTContext *pContext =\n new XMLPersTextContentTContext( GetTransformer(), rQName );\n XMLMetaContexts_Impl::value_type aVal( rLocalName, pContext );\n m_aContexts.insert( aVal );\n\n return pContext;\n}\n\nvoid XMLMetaTransformerContext::EndElement()\n{\n \/\/ export everything in the correct order\n OUString aKeywordsQName;\n XMLTokenEnum *pToken = aMetaTokens;\n while( *pToken != XML_TOKEN_END )\n {\n const OUString& rToken = GetXMLToken( *pToken );\n XMLMetaContexts_Impl::const_iterator aIter =\n m_aContexts.find( rToken );\n if( aIter != m_aContexts.end() )\n {\n if( XML_KEYWORD == *pToken )\n {\n aKeywordsQName =\n GetTransformer().GetNamespaceMap().GetQNameByKey(\n XML_NAMESPACE_META, GetXMLToken(XML_KEYWORDS ) );\n\n Reference< XAttributeList > xAttrList =\n new XMLMutableAttributeList;\n GetTransformer().GetDocHandler()->startElement( aKeywordsQName,\n xAttrList );\n }\n\n \/\/ All elements may occur multiple times\n XMLMetaContexts_Impl::const_iterator aEndIter =\n m_aContexts.upper_bound( rToken );\n while( aIter != aEndIter )\n {\n (*aIter).second->Export();\n ++aIter;\n }\n\n if( XML_KEYWORD == *pToken )\n GetTransformer().GetDocHandler()->endElement( aKeywordsQName );\n }\n pToken++;\n }\n\n GetTransformer().GetDocHandler()->endElement( GetQName() );\n}\n\nvoid XMLMetaTransformerContext::Characters( const OUString& )\n{\n \/\/ ignore them\n}\n\n\n<|endoftext|>"} {"text":"<commit_before>a9445cca-2e4e-11e5-9284-b827eb9e62be<commit_msg>a9495306-2e4e-11e5-9284-b827eb9e62be<commit_after>a9495306-2e4e-11e5-9284-b827eb9e62be<|endoftext|>"} {"text":"<commit_before>#pragma once\n\/**\n\t@file\n\t@brief operator\n\t@author MITSUNARI Shigeo(@herumi)\n\t@license modified new BSD license\n\thttp:\/\/opensource.org\/licenses\/BSD-3-Clause\n*\/\n#include <ios>\n#include <cybozu\/exception.hpp>\n\n#ifdef _WIN32\n\t#ifndef MCL_FORCE_INLINE\n\t\t#define MCL_FORCE_INLINE __forceinline\n\t#endif\n\t#pragma warning(push)\n\t#pragma warning(disable : 4714)\n#else\n\t#ifndef MCL_FORCE_INLINE\n\t\t#define MCL_FORCE_INLINE __attribute__((always_inline))\n\t#endif\n#endif\n\nnamespace mcl { namespace ope {\n\ntemplate<class T>\nstruct Empty {};\n\n\/*\n\tT must have compare\n*\/\ntemplate<class T, class E = Empty<T> >\nstruct comparable : E {\n\tfriend MCL_FORCE_INLINE bool operator<(const T& x, const T& y) { return T::compare(x, y) < 0; }\n\tfriend MCL_FORCE_INLINE bool operator>=(const T& x, const T& y) { return !operator<(x, y); }\n\n\tfriend MCL_FORCE_INLINE bool operator>(const T& x, const T& y) { return T::compare(x, y) > 0; }\n\tfriend MCL_FORCE_INLINE bool operator<=(const T& x, const T& y) { return !operator>(x, y); }\n\tfriend MCL_FORCE_INLINE bool operator==(const T& x, const T& y) { return T::compare(x, y) == 0; }\n\tfriend MCL_FORCE_INLINE bool operator!=(const T& x, const T& y) { return !operator==(x, y); }\n};\n\n\/*\n\tT must have add, sub\n*\/\ntemplate<class T, class E = Empty<T> >\nstruct addsub : E {\n\ttemplate<class S> MCL_FORCE_INLINE T& operator+=(const S& rhs) { T::add(static_cast<T&>(*this), static_cast<const T&>(*this), rhs); return static_cast<T&>(*this); }\n\ttemplate<class S> MCL_FORCE_INLINE T& operator-=(const S& rhs) { T::sub(static_cast<T&>(*this), static_cast<const T&>(*this), rhs); return static_cast<T&>(*this); }\n\ttemplate<class S> friend MCL_FORCE_INLINE T operator+(const T& a, const S& b) { T c; T::add(c, a, b); return c; }\n\ttemplate<class S> friend MCL_FORCE_INLINE T operator-(const T& a, const S& b) { T c; T::sub(c, a, b); return c; }\n};\n\n\/*\n\tT must have mul\n*\/\ntemplate<class T, class E = Empty<T> >\nstruct mulable : E {\n\ttemplate<class S> MCL_FORCE_INLINE T& operator*=(const S& rhs) { T::mul(static_cast<T&>(*this), static_cast<const T&>(*this), rhs); return static_cast<T&>(*this); }\n\ttemplate<class S> friend MCL_FORCE_INLINE T operator*(const T& a, const S& b) { T c; T::mul(c, a, b); return c; }\n};\n\n\/*\n\tT must have inv, mul\n*\/\ntemplate<class T, class E = Empty<T> >\nstruct invertible : E {\n\tMCL_FORCE_INLINE T& operator\/=(const T& rhs) { T c; T::inv(c, rhs); T::mul(static_cast<T&>(*this), static_cast<const T&>(*this), c); return static_cast<T&>(*this); }\n\tfriend MCL_FORCE_INLINE T operator\/(const T& a, const T& b) { T c; T::inv(c, b); T::mul(c, c, a); return c; }\n};\n\n\/*\n\tT must have neg\n*\/\ntemplate<class T, class E = Empty<T> >\nstruct hasNegative : E {\n\tMCL_FORCE_INLINE T operator-() const { T c; T::neg(c, static_cast<const T&>(*this)); return c; }\n};\n\ntemplate<class T, class E = Empty<T> >\nstruct hasIO : E {\n\tfriend inline std::ostream& operator<<(std::ostream& os, const T& self)\n\t{\n\t\tconst std::ios_base::fmtflags f = os.flags();\n\t\tif (f & std::ios_base::oct) throw cybozu::Exception(\"fpT:operator<<:oct is not supported\");\n\t\tconst int base = (f & std::ios_base::hex) ? 16 : 10;\n\t\tconst bool showBase = (f & std::ios_base::showbase) != 0;\n\t\tstd::string str;\n\t\tself.getStr(str, base, showBase);\n\t\treturn os << str;\n\t}\n\tfriend inline std::istream& operator>>(std::istream& is, T& self)\n\t{\n\t\tconst std::ios_base::fmtflags f = is.flags();\n\t\tif (f & std::ios_base::oct) throw cybozu::Exception(\"fpT:operator>>:oct is not supported\");\n\t\tconst int base = (f & std::ios_base::hex) ? 16 : 0;\n\t\tstd::string str;\n\t\tis >> str;\n\t\tself.setStr(str, base);\n\t\treturn is;\n\t}\n};\n\n} } \/\/ mcl::ope\n\n#ifdef _WIN32\n\/\/\t#pragma warning(pop)\n#endif\n<commit_msg>operator.hpp is removed<commit_after><|endoftext|>"} {"text":"<commit_before>ef28004e-2e4d-11e5-9284-b827eb9e62be<commit_msg>ef2d05e4-2e4d-11e5-9284-b827eb9e62be<commit_after>ef2d05e4-2e4d-11e5-9284-b827eb9e62be<|endoftext|>"} {"text":"<commit_before>#ifndef __PROCESS_HTTP_HPP__\n#define __PROCESS_HTTP_HPP__\n\n#include <string>\n\nnamespace process {\nnamespace http {\n\nstruct Request\n{\n \/\/ TODO(benh): Add major\/minor version.\n std::map<std::string, std::string> headers;\n std::string method;\n std::string path;\n std::string url;\n std::string fragment;\n std::string query;\n std::string body;\n bool keepAlive;\n};\n\n\nstruct Response\n{\n Response() : type(BODY) {}\n\n \/\/ TODO(benh): Add major\/minor version.\n std::string status;\n std::map<std::string, std::string> headers;\n\n \/\/ TODO(benh): Make body a stream (channel) instead, and allow a\n \/\/ response to be returned without forcing the stream to be\n \/\/ finished.\n\n \/\/ Either provide a 'body' or an absolute 'path' to a file. If a\n \/\/ path is specified then we will attempt to perform a 'sendfile'\n \/\/ operation on the file. In either case you are expected to\n \/\/ properly specify the 'Content-Type' header, but the\n \/\/ 'Content-Length' header will be filled in for you if you specify\n \/\/ a path. Distinguish between the two using 'type' below.\n enum {\n BODY,\n PATH\n } type;\n\n std::string body;\n std::string path;\n};\n\n\nstruct OK : Response\n{\n OK() : Response()\n {\n status = \"200 OK\";\n }\n};\n\n\nstruct BadRequest : Response\n{\n BadRequest() : Response()\n {\n status = \"400 Bad Request\";\n }\n};\n\n\nstruct NotFound : Response\n{\n NotFound() : Response()\n {\n status = \"404 Not Found\";\n }\n};\n\n\nstruct InternalServerError : Response\n{\n InternalServerError() : Response()\n {\n status = \"500 Internal Server Error\";\n }\n};\n\n\nstruct ServiceUnavailable : Response\n{\n ServiceUnavailable() : Response()\n {\n status = \"503 Service Unavailable\";\n }\n};\n\n} \/\/ namespace http {\n} \/\/ namespace process {\n\n#endif \/\/ __PROCESS_HTTP_HPP__\n<commit_msg>Added missing include.<commit_after>#ifndef __PROCESS_HTTP_HPP__\n#define __PROCESS_HTTP_HPP__\n\n#include <map>\n#include <string>\n\nnamespace process {\nnamespace http {\n\nstruct Request\n{\n \/\/ TODO(benh): Add major\/minor version.\n std::map<std::string, std::string> headers;\n std::string method;\n std::string path;\n std::string url;\n std::string fragment;\n std::string query;\n std::string body;\n bool keepAlive;\n};\n\n\nstruct Response\n{\n Response() : type(BODY) {}\n\n \/\/ TODO(benh): Add major\/minor version.\n std::string status;\n std::map<std::string, std::string> headers;\n\n \/\/ TODO(benh): Make body a stream (channel) instead, and allow a\n \/\/ response to be returned without forcing the stream to be\n \/\/ finished.\n\n \/\/ Either provide a 'body' or an absolute 'path' to a file. If a\n \/\/ path is specified then we will attempt to perform a 'sendfile'\n \/\/ operation on the file. In either case you are expected to\n \/\/ properly specify the 'Content-Type' header, but the\n \/\/ 'Content-Length' header will be filled in for you if you specify\n \/\/ a path. Distinguish between the two using 'type' below.\n enum {\n BODY,\n PATH\n } type;\n\n std::string body;\n std::string path;\n};\n\n\nstruct OK : Response\n{\n OK() : Response()\n {\n status = \"200 OK\";\n }\n};\n\n\nstruct BadRequest : Response\n{\n BadRequest() : Response()\n {\n status = \"400 Bad Request\";\n }\n};\n\n\nstruct NotFound : Response\n{\n NotFound() : Response()\n {\n status = \"404 Not Found\";\n }\n};\n\n\nstruct InternalServerError : Response\n{\n InternalServerError() : Response()\n {\n status = \"500 Internal Server Error\";\n }\n};\n\n\nstruct ServiceUnavailable : Response\n{\n ServiceUnavailable() : Response()\n {\n status = \"503 Service Unavailable\";\n }\n};\n\n} \/\/ namespace http {\n} \/\/ namespace process {\n\n#endif \/\/ __PROCESS_HTTP_HPP__\n<|endoftext|>"} {"text":"<commit_before>cfb1c0ec-2e4d-11e5-9284-b827eb9e62be<commit_msg>cfb6afee-2e4d-11e5-9284-b827eb9e62be<commit_after>cfb6afee-2e4d-11e5-9284-b827eb9e62be<|endoftext|>"} {"text":"<commit_before>#ifndef PROTON_TUPLE_HEADER\n#define PROTON_TUPLE_HEADER\n\n\n\/** @file tuple.hpp\n * @brief tuple support.\n * Please include this header instead of \\<tuple\\>.\n *\/\n\n#include <tuple>\n#include <algorithm>\n#include <iostream>\n#include <initializer_list>\n#include <algorithm>\n#include <stdexcept>\n#include <limits>\n\n#include <proton\/base.hpp>\n\nnamespace proton{\n\nnamespace detail{\n\n\/\/ helper function to print a tuple of any size\ntemplate<typename T, std::size_t I>\nstruct output_tuple {\n static void output(std::ostream& s, T&& t)\n {\n output_tuple<T, I-1>::output(s,t);\n s << \", \" << std::get<I-1>(t);\n }\n};\n\ntemplate<typename T>\nstruct output_tuple<T, 1> {\n static void output(std::ostream& s, T&& t)\n {\n s << std::get<0>(t);\n }\n};\n\ntemplate<typename T>\nstruct output_tuple<T, 0> {\n static void output(std::ostream& s, T&& t)\n {\n }\n};\n\nconstexpr long fix_index(long i, long size)\n{\n return (i>size)?\n\t\t\t\tsize\n\t\t\t:(\n\t\t\t\t(i<0)?\n\t\t\t\t\t(i+size < 0 ?\n\t\t\t\t\t\t0\n\t\t\t\t\t:\n\t\t\t\t\t\ti+size\n\t\t\t\t\t)\n\t\t\t\t:\n\t\t\t\t\ti\n\t\t\t);\n}\n\nconstexpr long sub_index(long i, long size)\n{\n return (i>=size)?\n\t\t\t\tsize-1\n\t\t\t:(\n\t\t\t\t(i<0)?\n\t\t\t\t\t(i+size < 0 ?\n\t\t\t\t\t\t0\n\t\t\t\t\t:\n\t\t\t\t\t\ti+size\n\t\t\t\t\t)\n\t\t\t\t:\n\t\t\t\t\ti\n\t\t\t);\n}\n\nconstexpr long get_index(long i, long size)\n{\n return (i>=size)?\n\t\t\t\t-1\n\t\t\t:(\n\t\t\t\t(i<0)?\n\t\t\t\t\t(i+size < 0 ?\n\t\t\t\t\t\t-1\n\t\t\t\t\t:\n\t\t\t\t\t\ti+size\n\t\t\t\t\t)\n\t\t\t\t:\n\t\t\t\t\ti\n\t\t\t);\n}\n\ntemplate<long i, typename ...T>\nstruct at_index{\n\tstatic_assert(i>=0, \"out of range\");\n\tconst std::tuple<T...>* p;\n\ttypedef decltype(std::get<i>(*p)) type;\n};\n\nconstexpr long fix_size(long begin, long end, long size)\n{\n\treturn fix_index(begin,size)>fix_index(end,size)?\n\t\t\t\t0\n\t\t\t:\n\t\t\t\tfix_index(end,size)-fix_index(begin,size);\n}\n\ntemplate<typename T, size_t begin, size_t size>\nstruct sub{\nprivate:\n\tstatic_assert(begin < std::tuple_size<T>::value, \"out of range\");\n\n\tstd::tuple<typename std::tuple_element<begin, T>::type> *p;\n\ttypedef typename sub<T, begin+1,\n\t\t\t\t\t\t(begin+size > std::tuple_size<T>::value ?\n\t\t\t\t\t\t\t(std::tuple_size<T>::value-begin-1)\n\t\t\t\t\t\t\t: (size-1))\n\t\t\t\t\t\t>::type next_types;\n\tnext_types* q;\n\npublic:\n\ttypedef decltype(std::tuple_cat(*p,*q)) type;\n};\n\ntemplate<typename T, size_t begin>\nstruct sub<T, begin, 0>{\n\ttypedef std::tuple<> type;\n};\n\ntemplate<typename T, size_t begin>\nstruct sub<T,begin,1>{\n\tstatic_assert(begin < std::tuple_size<T>::value, \"out of range\");\n\n\ttypedef std::tuple<typename std::tuple_element<begin,T>::type > type;\n};\n\n\ntemplate<typename ...T>\nstruct len_t<std::tuple<T...> >{\n static size_t result(const std::tuple<T...>& x)\n {\n return sizeof...(T);\n }\n};\n\n} \/\/ ns detail\n\n\/** @addtogroup tuple\n * @{\n *\/\n\n\/** like x[index] in python\n *\/\n\ntemplate<long index, typename ...T>\ntypename detail::at_index<detail::get_index(index,sizeof...(T)),T...>::type\n\tat(const std::tuple<T...>& x)\n{\n\treturn std::get<detail::get_index(index,sizeof...(T))>(x);\n}\n\n\/** get a slice of tuple x[begin:end] in python\n *\/\ntemplate<long begin, long end=std::numeric_limits<long>::max(), typename ...T>\ntypename detail::sub<std::tuple<T...>, detail::fix_index(begin, sizeof...(T)),\n\t\t\t\t\t\t\t\t\t detail::fix_size(begin,end, sizeof...(T))>::type\n\tsub(const std::tuple<T...>& x)\n{\n\ttypedef typename detail::sub<std::tuple<T...>, detail::fix_index(begin, sizeof...(T)),\n\t\t\t\t\t\t\t\t\t detail::fix_size(begin,end, sizeof...(T))>::type ret_t;\n#ifdef __clang__\n\treturn ret_t(*reinterpret_cast<const ret_t*>(&std::get<(detail::sub_index(begin, sizeof...(T)))>(x)));\n#else\n\t#ifdef __GNUC__\n\t\treturn ret_t(*reinterpret_cast<const ret_t*>(&std::get<(detail::sub_index(end-1, sizeof...(T)))>(x)));\n\t#else\n\t\tstatic_assert(0, \"unknown compiler\")\n\t#endif\n#endif\n}\n\n\/** general output for tuple.\n * @param s the output stream\n * @param x the tuple to be outputed\n * @return s\n *\/\ntemplate <typename ...T>\nstd::ostream& operator<<(std::ostream& s, const std::tuple<T...>& x)\n{\n s << \"(\";\n detail::output_tuple<decltype(x), sizeof...(T)>::output(s,x);\n s << \")\";\n return s;\n}\n\ntemplate <typename ...T>\nstd::wostream& operator<<(std::wostream& s, const std::tuple<T...>& x)\n{\n s << L\"(\";\n detail::output_tuple<decltype(x), sizeof...(T)>::output(s,x);\n s << L\")\";\n return s;\n}\n\n\/** tuple + tuple\n *\/\ntemplate<typename T2, typename ...T1>\nauto operator+(const std::tuple<T1...>& x, T2&& y) -> decltype(std::tuple_cat(x,y))\n{\n\treturn std::tuple_cat(x,y);\n}\n\ntemplate<typename T2, typename ...T1>\nauto operator+(std::tuple<T1...>&& x, T2&& y) -> decltype(std::tuple_cat(x,y))\n{\n\treturn std::tuple_cat(x,y);\n}\n\n\/** eq to make_tuple\n *\/\ntemplate<typename ...T>\nauto _t(T&& ...x) -> decltype(std::make_tuple(x...))\n{\n\treturn std::make_tuple(x...);\n}\n\n\/** eq to forward_as_tuple\n *\/\ntemplate<typename ...T>\nauto _f(T&& ...x) -> decltype(std::forward_as_tuple(x...))\n{\n\treturn std::forward_as_tuple(x...);\n}\n\n#if 0\n\/* vector_ * n\n *\/\ntemplate<typename T, typename A>\nvector_<T,A> operator*(const std::vector<T,A>& s, size_t n)\n{\n vector_<T,A> r;\n r.reserve(s.size()*n);\n for(size_t i=0; i<n; i++)\n r.extend(s);\n return r;\n}\n\n\/* n * vector_\n *\/\ntemplate<typename T, typename A>\nvector_<T,A> operator*(size_t n, const std::vector<T,A>& s)\n{\n return s*n;\n}\n#endif\n\n\/**\n * @example tuple.cpp\n * @}\n *\/\n}\n\n#endif \/\/ PROTON_TUPLE_HEADER\n<commit_msg>change at_index usage<commit_after>#ifndef PROTON_TUPLE_HEADER\n#define PROTON_TUPLE_HEADER\n\n\n\/** @file tuple.hpp\n * @brief tuple support.\n * Please include this header instead of \\<tuple\\>.\n *\/\n\n#include <tuple>\n#include <algorithm>\n#include <iostream>\n#include <initializer_list>\n#include <algorithm>\n#include <stdexcept>\n#include <limits>\n\n#include <proton\/base.hpp>\n\nnamespace proton{\n\nnamespace detail{\n\n\/\/ helper function to print a tuple of any size\ntemplate<typename T, std::size_t I>\nstruct output_tuple {\n static void output(std::ostream& s, T&& t)\n {\n output_tuple<T, I-1>::output(s,t);\n s << \", \" << std::get<I-1>(t);\n }\n};\n\ntemplate<typename T>\nstruct output_tuple<T, 1> {\n static void output(std::ostream& s, T&& t)\n {\n s << std::get<0>(t);\n }\n};\n\ntemplate<typename T>\nstruct output_tuple<T, 0> {\n static void output(std::ostream& s, T&& t)\n {\n }\n};\n\nconstexpr long fix_index(long i, long size)\n{\n return (i>size)?\n\t\t\t\tsize\n\t\t\t:(\n\t\t\t\t(i<0)?\n\t\t\t\t\t(i+size < 0 ?\n\t\t\t\t\t\t0\n\t\t\t\t\t:\n\t\t\t\t\t\ti+size\n\t\t\t\t\t)\n\t\t\t\t:\n\t\t\t\t\ti\n\t\t\t);\n}\n\nconstexpr long sub_index(long i, long size)\n{\n return (i>=size)?\n\t\t\t\tsize-1\n\t\t\t:(\n\t\t\t\t(i<0)?\n\t\t\t\t\t(i+size < 0 ?\n\t\t\t\t\t\t0\n\t\t\t\t\t:\n\t\t\t\t\t\ti+size\n\t\t\t\t\t)\n\t\t\t\t:\n\t\t\t\t\ti\n\t\t\t);\n}\n\nconstexpr long get_index(long i, long size)\n{\n return (i>=size)?\n\t\t\t\t-1\n\t\t\t:(\n\t\t\t\t(i<0)?\n\t\t\t\t\t(i+size < 0 ?\n\t\t\t\t\t\t-1\n\t\t\t\t\t:\n\t\t\t\t\t\ti+size\n\t\t\t\t\t)\n\t\t\t\t:\n\t\t\t\t\ti\n\t\t\t);\n}\n\ntemplate<long i, typename ...T>\nstruct at_index{\n\tconst std::tuple<T...>* p;\n\ttypedef decltype(std::get<get_index(i,sizeof...(T))>(*p)) type;\n};\n\nconstexpr long fix_size(long begin, long end, long size)\n{\n\treturn fix_index(begin,size)>fix_index(end,size)?\n\t\t\t\t0\n\t\t\t:\n\t\t\t\tfix_index(end,size)-fix_index(begin,size);\n}\n\ntemplate<typename T, size_t begin, size_t size>\nstruct sub{\nprivate:\n\tstatic_assert(begin < std::tuple_size<T>::value, \"out of range\");\n\n\tstd::tuple<typename std::tuple_element<begin, T>::type> *p;\n\ttypedef typename sub<T, begin+1,\n\t\t\t\t\t\t(begin+size > std::tuple_size<T>::value ?\n\t\t\t\t\t\t\t(std::tuple_size<T>::value-begin-1)\n\t\t\t\t\t\t\t: (size-1))\n\t\t\t\t\t\t>::type next_types;\n\tnext_types* q;\n\npublic:\n\ttypedef decltype(std::tuple_cat(*p,*q)) type;\n};\n\ntemplate<typename T, size_t begin>\nstruct sub<T, begin, 0>{\n\ttypedef std::tuple<> type;\n};\n\ntemplate<typename T, size_t begin>\nstruct sub<T,begin,1>{\n\tstatic_assert(begin < std::tuple_size<T>::value, \"out of range\");\n\n\ttypedef std::tuple<typename std::tuple_element<begin,T>::type > type;\n};\n\n\ntemplate<typename ...T>\nstruct len_t<std::tuple<T...> >{\n static size_t result(const std::tuple<T...>& x)\n {\n return sizeof...(T);\n }\n};\n\n} \/\/ ns detail\n\n\/** @addtogroup tuple\n * @{\n *\/\n\n\/** like x[index] in python\n *\/\n\ntemplate<long index, typename ...T>\ntypename detail::at_index<index,T...>::type\n\tat(const std::tuple<T...>& x)\n{\n\treturn std::get<detail::get_index(index,sizeof...(T))>(x);\n}\n\n\/** get a slice of tuple x[begin:end] in python\n *\/\ntemplate<long begin, long end=std::numeric_limits<long>::max(), typename ...T>\ntypename detail::sub<std::tuple<T...>, detail::fix_index(begin, sizeof...(T)),\n\t\t\t\t\t\t\t\t\t detail::fix_size(begin,end, sizeof...(T))>::type\n\tsub(const std::tuple<T...>& x)\n{\n\ttypedef typename detail::sub<std::tuple<T...>, detail::fix_index(begin, sizeof...(T)),\n\t\t\t\t\t\t\t\t\t detail::fix_size(begin,end, sizeof...(T))>::type ret_t;\n#ifdef __clang__\n\treturn ret_t(*reinterpret_cast<const ret_t*>(&std::get<(detail::sub_index(begin, sizeof...(T)))>(x)));\n#else\n\t#ifdef __GNUC__\n\t\treturn ret_t(*reinterpret_cast<const ret_t*>(&std::get<(detail::sub_index(end-1, sizeof...(T)))>(x)));\n\t#else\n\t\tstatic_assert(0, \"unknown compiler\")\n\t#endif\n#endif\n}\n\n\/** general output for tuple.\n * @param s the output stream\n * @param x the tuple to be outputed\n * @return s\n *\/\ntemplate <typename ...T>\nstd::ostream& operator<<(std::ostream& s, const std::tuple<T...>& x)\n{\n s << \"(\";\n detail::output_tuple<decltype(x), sizeof...(T)>::output(s,x);\n s << \")\";\n return s;\n}\n\ntemplate <typename ...T>\nstd::wostream& operator<<(std::wostream& s, const std::tuple<T...>& x)\n{\n s << L\"(\";\n detail::output_tuple<decltype(x), sizeof...(T)>::output(s,x);\n s << L\")\";\n return s;\n}\n\n\/** tuple + tuple\n *\/\ntemplate<typename T2, typename ...T1>\nauto operator+(const std::tuple<T1...>& x, T2&& y) -> decltype(std::tuple_cat(x,y))\n{\n\treturn std::tuple_cat(x,y);\n}\n\ntemplate<typename T2, typename ...T1>\nauto operator+(std::tuple<T1...>&& x, T2&& y) -> decltype(std::tuple_cat(x,y))\n{\n\treturn std::tuple_cat(x,y);\n}\n\n\/** eq to make_tuple\n *\/\ntemplate<typename ...T>\nauto _t(T&& ...x) -> decltype(std::make_tuple(x...))\n{\n\treturn std::make_tuple(x...);\n}\n\n\/** eq to forward_as_tuple\n *\/\ntemplate<typename ...T>\nauto _f(T&& ...x) -> decltype(std::forward_as_tuple(x...))\n{\n\treturn std::forward_as_tuple(x...);\n}\n\n#if 0\n\/* vector_ * n\n *\/\ntemplate<typename T, typename A>\nvector_<T,A> operator*(const std::vector<T,A>& s, size_t n)\n{\n vector_<T,A> r;\n r.reserve(s.size()*n);\n for(size_t i=0; i<n; i++)\n r.extend(s);\n return r;\n}\n\n\/* n * vector_\n *\/\ntemplate<typename T, typename A>\nvector_<T,A> operator*(size_t n, const std::vector<T,A>& s)\n{\n return s*n;\n}\n#endif\n\n\/**\n * @example tuple.cpp\n * @}\n *\/\n}\n\n#endif \/\/ PROTON_TUPLE_HEADER\n<|endoftext|>"} {"text":"<commit_before>d1cbb050-2e4c-11e5-9284-b827eb9e62be<commit_msg>d1d0c400-2e4c-11e5-9284-b827eb9e62be<commit_after>d1d0c400-2e4c-11e5-9284-b827eb9e62be<|endoftext|>"} {"text":"<commit_before>042f0d8e-2e4e-11e5-9284-b827eb9e62be<commit_msg>043409f6-2e4e-11e5-9284-b827eb9e62be<commit_after>043409f6-2e4e-11e5-9284-b827eb9e62be<|endoftext|>"} {"text":"<commit_before>d634d580-2e4d-11e5-9284-b827eb9e62be<commit_msg>d639ce64-2e4d-11e5-9284-b827eb9e62be<commit_after>d639ce64-2e4d-11e5-9284-b827eb9e62be<|endoftext|>"} {"text":"<commit_before>#ifndef RENDERSYSTEM_H\n#define RENDERSYSTEM_H\n\n#include \"isystem.hpp\"\n#include <unordered_map>\n#include <string>\n#include <SDL2\/SDL.h>\n#include <SDL2\/SDL_image.h>\n#include <SDL2\/SDL_ttf.h>\n#include <vector>\n#include <unordered_set>\n#include <queue>\n#include \"spatialindexer.hpp\"\n#include \"heap.hpp\"\n#include \"text.hpp\"\n\nusing namespace std;\n\nclass RenderComponent;\nclass MoveComponent;\nclass SizeComponent;\nclass FlagComponent;\nclass SpatialIndexer;\n\ntypedef unsigned int ID;\n\nclass CameraSystem;\n\nstruct TextureData {\n\tSDL_Texture* texture;\n\tunsigned int width;\n\tunsigned int height;\n};\n\nstruct RenderData {\n\tID id;\n\tRenderComponent* renderComponent;\n\tTextureData textureData;\n\tSDL_Rect cliprect;\n\tSDL_Rect target;\n\n\tinline bool operator< (const RenderData& rhs) const;\n inline bool operator> (const RenderData& rhs) const;\n inline bool operator<=(const RenderData& rhs) const;\n inline bool operator>=(const RenderData& rhs) const;\n};\n\nclass RenderSystem : public ISystem {\n private:\n\tunordered_set<ID> ids;\n\tqueue<ID> activeIds;\n\tqueue<SpatialIndexer::Rect> previousDrawAreas;\n\tqueue<Text> texts;\n\tCameraSystem* cameraSystem;\n\n\n\tstatic constexpr ushort SCREEN_WIDTH = 640;\n\tstatic constexpr ushort SCREEN_HEIGHT = 480;\n\n\tSDL_Renderer* renderer = nullptr;\n\tSDL_Window* window = nullptr;\n\tSDL_Texture* worldTexture = nullptr;\n\tSDL_Texture* fontTexture = nullptr;\n\tTTF_Font* font;\n\tunordered_map<string, TextureData> textureDatas;\n\n\tvoid renderArea(heap<RenderData>& pq, SpatialIndexer::Rect area);\n\tvoid renderTexts();\n\n public:\n \tRenderSystem();\n \t~RenderSystem();\n\tvoid add(ID id);\n\tvoid remove(ID id);\n\tvoid update();\n\tunsigned int count() const;\n\tvoid render(const RenderData& rd) const;\n\tconst string getIdentifier() const;\n\tvoid calculateZIndex(ID id);\n\tvoid activateId(ID id);\n\tvoid setCameraSystem(CameraSystem* cameraSystem);\n\tvoid setImage(ID id, string path);\n\tvoid printText(const Text& text);\n\n\t\/\/Forces a redraw within an area\n\tvoid inline constexpr renderArea(const SpatialIndexer::Rect& area) {\n\t previousDrawAreas.push(area);\n\t}\n\tstatic constexpr ushort getScreenWidth() { return SCREEN_WIDTH; }\n static constexpr ushort getScreenHeight() { return SCREEN_HEIGHT; }\n\n};\n\n#endif \/\/RENDERSYSTEM_H\n<commit_msg>changed resolution to avoid artifacts when running in fullscreen<commit_after>#ifndef RENDERSYSTEM_H\n#define RENDERSYSTEM_H\n\n#include \"isystem.hpp\"\n#include <unordered_map>\n#include <string>\n#include <SDL2\/SDL.h>\n#include <SDL2\/SDL_image.h>\n#include <SDL2\/SDL_ttf.h>\n#include <vector>\n#include <unordered_set>\n#include <queue>\n#include \"spatialindexer.hpp\"\n#include \"heap.hpp\"\n#include \"text.hpp\"\n\nusing namespace std;\n\nclass RenderComponent;\nclass MoveComponent;\nclass SizeComponent;\nclass FlagComponent;\nclass SpatialIndexer;\n\ntypedef unsigned int ID;\n\nclass CameraSystem;\n\nstruct TextureData {\n\tSDL_Texture* texture;\n\tunsigned int width;\n\tunsigned int height;\n};\n\nstruct RenderData {\n\tID id;\n\tRenderComponent* renderComponent;\n\tTextureData textureData;\n\tSDL_Rect cliprect;\n\tSDL_Rect target;\n\n\tinline bool operator< (const RenderData& rhs) const;\n inline bool operator> (const RenderData& rhs) const;\n inline bool operator<=(const RenderData& rhs) const;\n inline bool operator>=(const RenderData& rhs) const;\n};\n\nclass RenderSystem : public ISystem {\n private:\n\tunordered_set<ID> ids;\n\tqueue<ID> activeIds;\n\tqueue<SpatialIndexer::Rect> previousDrawAreas;\n\tqueue<Text> texts;\n\tCameraSystem* cameraSystem;\n\n\n\tstatic constexpr ushort SCREEN_WIDTH = 1920 \/ 4;\n\tstatic constexpr ushort SCREEN_HEIGHT = 1080 \/ 4;\n\n\tSDL_Renderer* renderer = nullptr;\n\tSDL_Window* window = nullptr;\n\tSDL_Texture* worldTexture = nullptr;\n\tSDL_Texture* fontTexture = nullptr;\n\tTTF_Font* font;\n\tunordered_map<string, TextureData> textureDatas;\n\n\tvoid renderArea(heap<RenderData>& pq, SpatialIndexer::Rect area);\n\tvoid renderTexts();\n\n public:\n \tRenderSystem();\n \t~RenderSystem();\n\tvoid add(ID id);\n\tvoid remove(ID id);\n\tvoid update();\n\tunsigned int count() const;\n\tvoid render(const RenderData& rd) const;\n\tconst string getIdentifier() const;\n\tvoid calculateZIndex(ID id);\n\tvoid activateId(ID id);\n\tvoid setCameraSystem(CameraSystem* cameraSystem);\n\tvoid setImage(ID id, string path);\n\tvoid printText(const Text& text);\n\n\t\/\/Forces a redraw within an area\n\tvoid inline constexpr renderArea(const SpatialIndexer::Rect& area) {\n\t previousDrawAreas.push(area);\n\t}\n\tstatic constexpr ushort getScreenWidth() { return SCREEN_WIDTH; }\n static constexpr ushort getScreenHeight() { return SCREEN_HEIGHT; }\n\n};\n\n#endif \/\/RENDERSYSTEM_H\n<|endoftext|>"} {"text":"<commit_before>a764a816-2e4d-11e5-9284-b827eb9e62be<commit_msg>a769a69a-2e4d-11e5-9284-b827eb9e62be<commit_after>a769a69a-2e4d-11e5-9284-b827eb9e62be<|endoftext|>"} {"text":"<commit_before>7813dff0-2e4d-11e5-9284-b827eb9e62be<commit_msg>7818e0f4-2e4d-11e5-9284-b827eb9e62be<commit_after>7818e0f4-2e4d-11e5-9284-b827eb9e62be<|endoftext|>"} {"text":"<commit_before>140733e0-2e4d-11e5-9284-b827eb9e62be<commit_msg>140c451a-2e4d-11e5-9284-b827eb9e62be<commit_after>140c451a-2e4d-11e5-9284-b827eb9e62be<|endoftext|>"} {"text":"<commit_before>22b0bb5e-2e4e-11e5-9284-b827eb9e62be<commit_msg>22b5ccde-2e4e-11e5-9284-b827eb9e62be<commit_after>22b5ccde-2e4e-11e5-9284-b827eb9e62be<|endoftext|>"} {"text":"<commit_before>#pragma once\n\n#include <type_traits>\n#include <vector>\n#include <initializer_list>\n#include <cstddef>\n#include <algorithm>\n#include <iterator>\n\n\nnamespace helene\n{\n\ntemplate <class T, std::size_t StackBufferSize = sizeof(std::vector<T>)>\nclass small_vector\n{\n static_assert(std::is_trivial<T>::value,\n \"small_vector is only compatible with trivial types\");\n\npublic:\n typedef T value_type;\n typedef typename std::vector<T>::size_type size_type;\n typedef typename std::vector<T>::difference_type difference_type;\n typedef T& reference;\n typedef const T& const_reference;\n typedef T* pointer;\n typedef const T* const_pointer;\n typedef T* iterator;\n typedef const T* const_iterator;\n\nprivate:\n static constexpr size_type at_least_size =\n std::max(StackBufferSize, sizeof(std::vector<T>));\n static constexpr size_type max_stack_size_ = at_least_size \/ sizeof(T);\n\npublic:\n small_vector() : size_()\n {\n new(&storage_) T[max_stack_size_];\n }\n\n small_vector(std::initializer_list<T> init) : size_(init.size())\n {\n if(size_ > max_stack_size_)\n {\n new(&storage_) std::vector<T>(init);\n }\n else\n {\n new(&storage_) T[max_stack_size_];\n std::copy(\n init.begin(), init.end(), reinterpret_cast<T*>(&storage_));\n }\n }\n\n small_vector(size_type count) : size_(count)\n {\n if(size_ > max_stack_size_)\n {\n new(&storage_) std::vector<T>(count);\n }\n else\n {\n new(&storage_) T[max_stack_size_];\n std::fill_n(reinterpret_cast<T*>(&storage_), size_, T{});\n }\n }\n\n small_vector(size_type count, const T& value)\n {\n if(size_ > max_stack_size_)\n {\n new(&storage_) std::vector<T>(count, value);\n }\n else\n {\n new(&storage_) T[max_stack_size_];\n std::fill_n(reinterpret_cast<T*>(&storage_), size_, value);\n }\n }\n\n ~small_vector()\n {\n if(size_ > max_stack_size_)\n {\n reinterpret_cast<std::vector<T>*>(&storage_)->~vector();\n }\n }\n\npublic:\n void\n push_back(const T& value)\n {\n if(size_ > max_stack_size_)\n {\n reinterpret_cast<std::vector<T>*>(&storage_)->push_back(value);\n }\n else if(size_ == max_stack_size_)\n {\n T* buff = reinterpret_cast<T*>(&storage_);\n T temp[max_stack_size_];\n std::copy(buff, buff + size_, std::begin(temp));\n\n new(&storage_) std::vector<T>(std::begin(temp), std::end(temp));\n reinterpret_cast<std::vector<T>*>(&storage_)->push_back(value);\n }\n else\n {\n reinterpret_cast<T*>(&storage_)[size_] = value;\n }\n\n ++size_;\n }\n\n void\n pop_back()\n {\n if(size_ > max_stack_size_ + 1) \/\/ remain on heap\n {\n reinterpret_cast<std::vector<T>*>(&storage_)->pop_back();\n --size_;\n }\n else if(size_ == max_stack_size_ + 1) \/\/ transition to stack\n {\n \/\/ reinterpret_cast<std::vector<T>*>(&storage_)->pop_back();\n \/\/ not necessary, trivially destructible\n\n std::vector<T> temp(\n std::move(*(reinterpret_cast<std::vector<T>*>(&storage_))));\n reinterpret_cast<std::vector<T>*>(&storage_)->~vector();\n\n new(&storage_) T[max_stack_size_];\n std::copy(\n temp.begin(), temp.end() - 1, reinterpret_cast<T*>(&storage_));\n --size_;\n }\n else \/\/ remain on stack\n {\n --size_;\n }\n }\n\n T& operator[](size_type n)\n {\n if(size_ > max_stack_size_)\n {\n return reinterpret_cast<std::vector<T>*>(&storage_)->operator[](n);\n }\n else\n {\n return reinterpret_cast<T*>(&storage_)[n];\n }\n }\n\n const T& operator[](size_type n) const\n {\n if(size_ > max_stack_size_)\n {\n return reinterpret_cast<const std::vector<T>*>(&storage_)->\n operator[](n);\n }\n else\n {\n return reinterpret_cast<const T*>(&storage_)[n];\n }\n }\n\n T&\n front()\n {\n if(size_ > max_stack_size_)\n {\n return reinterpret_cast<std::vector<T>*>(&storage_)->front();\n }\n else\n {\n return reinterpret_cast<T*>(&storage_)[0];\n }\n }\n\n const T&\n front() const\n {\n if(size_ > max_stack_size_)\n {\n return reinterpret_cast<const std::vector<T>*>(&storage_)->front();\n }\n else\n {\n return reinterpret_cast<const T*>(&storage_)[0];\n }\n }\n\n\n T&\n back()\n {\n if(size_ > max_stack_size_)\n {\n return reinterpret_cast<std::vector<T>*>(&storage_)->back();\n }\n else\n {\n return reinterpret_cast<T*>(&storage_)[size_ - 1];\n }\n }\n\n const T&\n back() const\n {\n if(size_ > max_stack_size_)\n {\n return reinterpret_cast<const std::vector<T>*>(&storage_)->back();\n }\n else\n {\n return reinterpret_cast<const T*>(&storage_)[size_ - 1];\n }\n }\n\n iterator\n erase(iterator pos)\n {\n if(size_ > max_stack_size_ + 1)\n {\n std::vector<T>* ref = reinterpret_cast<std::vector<T>*>(&storage_);\n\n \/\/ convert to std::vector<T>::iterator\n typename std::vector<T>::iterator iter_pos =\n ref->begin() + (pos - ref->data());\n\n auto iter_out = ref->erase(iter_pos);\n --size_;\n\n \/\/ convert std::vector<T>::iterator to pointer\n difference_type diff = iter_out - ref->begin();\n\n\n return ref->data() + diff;\n }\n else if(size_ == max_stack_size_ + 1)\n {\n std::vector<T>* ref = reinterpret_cast<std::vector<T>*>(&storage_);\n\n \/\/ convert to std::vector<T>::iterator\n const auto diff = pos - ref->data();\n typename std::vector<T>::iterator iter_pos =\n ref->begin() + (pos - ref->data());\n\n\n auto iter_out = ref->erase(iter_pos);\n\n std::vector<T> temp(std::move(*ref));\n ref->~vector();\n\n new(&storage_) T[max_stack_size_];\n std::copy(\n temp.begin(), temp.end(), reinterpret_cast<T*>(&storage_));\n --size_;\n\n return reinterpret_cast<T*>(&storage_) + diff;\n }\n else\n {\n T* beg = reinterpret_cast<T*>(&storage_);\n std::copy(pos + 1, end(), pos);\n\n --size_;\n return pos;\n }\n }\n\n iterator\n erase(iterator first, iterator last)\n {\n const auto erase_size = std::distance(first, last);\n\n if(size_ > max_stack_size_ + erase_size)\n {\n std::vector<T>* ref = reinterpret_cast<std::vector<T>*>(&storage_);\n\n \/\/ convert to std::vector<T>::iterator\n auto first_iter = ref->begin() + (first - begin());\n auto last_iter = ref->begin() + (last - begin());\n\n auto iter_out = ref->erase(first_iter, last_iter);\n size_ -= erase_size;\n\n \/\/ convert back to simple pointer\n return begin() + (iter_out - ref->begin());\n }\n else if(size_ <= max_stack_size_)\n {\n T* buff_beg = reinterpret_cast<T*>(&storage_);\n if(last < end()) \/\/ if anything left past end of range to erase\n {\n std::copy(last, end(), first);\n }\n size_ -= erase_size;\n return first;\n }\n else\n {\n std::vector<T>* ref = reinterpret_cast<std::vector<T>*>(&storage_);\n\n \/\/ convert to std::vector<T>::iterator\n auto first_iter = ref->begin() + (first - begin());\n auto last_iter = ref->begin() + (last - begin());\n\n \/\/ carry out erase on vector\n auto iter_out = ref->erase(first_iter, last_iter);\n const auto out_diff = iter_out - ref->begin();\n\n std::vector<T> temp(std::move(*ref));\n ref->~vector();\n\n new(&storage_) T[max_stack_size_];\n\n std::copy(\n temp.begin(), temp.end(), reinterpret_cast<T*>(&storage_));\n\n size_ -= erase_size;\n\n return begin() + out_diff;\n }\n }\n\n\n T*\n data()\n {\n if(size_ > max_stack_size_)\n {\n return reinterpret_cast<std::vector<T>*>(&storage_)->data();\n }\n else\n {\n return reinterpret_cast<T*>(&storage_);\n }\n }\n\n const T*\n data() const\n {\n if(size_ > max_stack_size_)\n {\n return reinterpret_cast<const std::vector<T>*>(&storage_)->data();\n }\n else\n {\n return reinterpret_cast<const T*>(&storage_);\n }\n }\n\n iterator\n begin()\n {\n if(size_ > max_stack_size_)\n {\n return reinterpret_cast<std::vector<T>*>(&storage_)->data();\n }\n else\n {\n return reinterpret_cast<T*>(&storage_);\n }\n }\n\n iterator\n end()\n {\n if(size_ > max_stack_size_)\n {\n return reinterpret_cast<std::vector<T>*>(&storage_)->data() + size_;\n }\n else\n {\n return reinterpret_cast<T*>(&storage_) + size_;\n }\n }\n\n const_iterator\n cbegin() const\n {\n if(size_ > max_stack_size_)\n {\n return reinterpret_cast<const std::vector<T>*>(&storage_)->data();\n }\n else\n {\n return reinterpret_cast<const T*>(&storage_);\n }\n }\n\n const_iterator\n cend() const\n {\n if(size_ > max_stack_size_)\n {\n return reinterpret_cast<const std::vector<T>*>(&storage_)->data() +\n size_;\n }\n else\n {\n return reinterpret_cast<const T*>(&storage_) + size_;\n }\n }\n\n size_type\n size() const\n {\n return size_;\n }\n\n bool\n empty() const\n {\n return size_ == 0;\n }\n\n static constexpr size_type\n max_stack_size()\n {\n return max_stack_size_;\n }\n\n bool\n on_stack() const\n {\n return size_ <= max_stack_size_;\n }\n\nprivate:\n std::aligned_storage_t<at_least_size> storage_;\n size_type size_;\n};\n\n} \/\/ namespace helene\n<commit_msg>Rename return types to public member types. \tmodified: include\/small_vector.hpp<commit_after>#pragma once\n\n#include <type_traits>\n#include <vector>\n#include <initializer_list>\n#include <cstddef>\n#include <algorithm>\n#include <iterator>\n\n\nnamespace helene\n{\n\ntemplate <class T, std::size_t StackBufferSize = sizeof(std::vector<T>)>\nclass small_vector\n{\n static_assert(std::is_trivial<T>::value,\n \"small_vector is only compatible with trivial types\");\n\npublic:\n typedef T value_type;\n typedef typename std::vector<T>::size_type size_type;\n typedef typename std::vector<T>::difference_type difference_type;\n typedef T& reference;\n typedef const T& const_reference;\n typedef T* pointer;\n typedef const T* const_pointer;\n typedef T* iterator;\n typedef const T* const_iterator;\n\nprivate:\n static constexpr size_type at_least_size =\n std::max(StackBufferSize, sizeof(std::vector<T>));\n static constexpr size_type max_stack_size_ = at_least_size \/ sizeof(T);\n\npublic:\n small_vector() : size_()\n {\n new(&storage_) T[max_stack_size_];\n }\n\n small_vector(std::initializer_list<T> init) : size_(init.size())\n {\n if(size_ > max_stack_size_)\n {\n new(&storage_) std::vector<T>(init);\n }\n else\n {\n new(&storage_) T[max_stack_size_];\n std::copy(\n init.begin(), init.end(), reinterpret_cast<T*>(&storage_));\n }\n }\n\n small_vector(size_type count) : size_(count)\n {\n if(size_ > max_stack_size_)\n {\n new(&storage_) std::vector<T>(count);\n }\n else\n {\n new(&storage_) T[max_stack_size_];\n std::fill_n(reinterpret_cast<T*>(&storage_), size_, T{});\n }\n }\n\n small_vector(size_type count, const T& value)\n {\n if(size_ > max_stack_size_)\n {\n new(&storage_) std::vector<T>(count, value);\n }\n else\n {\n new(&storage_) T[max_stack_size_];\n std::fill_n(reinterpret_cast<T*>(&storage_), size_, value);\n }\n }\n\n ~small_vector()\n {\n if(size_ > max_stack_size_)\n {\n reinterpret_cast<std::vector<T>*>(&storage_)->~vector();\n }\n }\n\npublic:\n void\n push_back(const T& value)\n {\n if(size_ > max_stack_size_)\n {\n reinterpret_cast<std::vector<T>*>(&storage_)->push_back(value);\n }\n else if(size_ == max_stack_size_)\n {\n T* buff = reinterpret_cast<T*>(&storage_);\n T temp[max_stack_size_];\n std::copy(buff, buff + size_, std::begin(temp));\n\n new(&storage_) std::vector<T>(std::begin(temp), std::end(temp));\n reinterpret_cast<std::vector<T>*>(&storage_)->push_back(value);\n }\n else\n {\n reinterpret_cast<T*>(&storage_)[size_] = value;\n }\n\n ++size_;\n }\n\n void\n pop_back()\n {\n if(size_ > max_stack_size_ + 1) \/\/ remain on heap\n {\n reinterpret_cast<std::vector<T>*>(&storage_)->pop_back();\n --size_;\n }\n else if(size_ == max_stack_size_ + 1) \/\/ transition to stack\n {\n \/\/ reinterpret_cast<std::vector<T>*>(&storage_)->pop_back();\n \/\/ not necessary, trivially destructible\n\n std::vector<T> temp(\n std::move(*(reinterpret_cast<std::vector<T>*>(&storage_))));\n reinterpret_cast<std::vector<T>*>(&storage_)->~vector();\n\n new(&storage_) T[max_stack_size_];\n std::copy(\n temp.begin(), temp.end() - 1, reinterpret_cast<T*>(&storage_));\n --size_;\n }\n else \/\/ remain on stack\n {\n --size_;\n }\n }\n\n reference operator[](size_type n)\n {\n if(size_ > max_stack_size_)\n {\n return reinterpret_cast<std::vector<T>*>(&storage_)->operator[](n);\n }\n else\n {\n return reinterpret_cast<T*>(&storage_)[n];\n }\n }\n\n const_reference operator[](size_type n) const\n {\n if(size_ > max_stack_size_)\n {\n return reinterpret_cast<const std::vector<T>*>(&storage_)->\n operator[](n);\n }\n else\n {\n return reinterpret_cast<const T*>(&storage_)[n];\n }\n }\n\n reference\n front()\n {\n if(size_ > max_stack_size_)\n {\n return reinterpret_cast<std::vector<T>*>(&storage_)->front();\n }\n else\n {\n return reinterpret_cast<T*>(&storage_)[0];\n }\n }\n\n const_reference\n front() const\n {\n if(size_ > max_stack_size_)\n {\n return reinterpret_cast<const std::vector<T>*>(&storage_)->front();\n }\n else\n {\n return reinterpret_cast<const T*>(&storage_)[0];\n }\n }\n\n\n reference\n back()\n {\n if(size_ > max_stack_size_)\n {\n return reinterpret_cast<std::vector<T>*>(&storage_)->back();\n }\n else\n {\n return reinterpret_cast<T*>(&storage_)[size_ - 1];\n }\n }\n\n const_reference\n back() const\n {\n if(size_ > max_stack_size_)\n {\n return reinterpret_cast<const std::vector<T>*>(&storage_)->back();\n }\n else\n {\n return reinterpret_cast<const T*>(&storage_)[size_ - 1];\n }\n }\n\n iterator\n erase(iterator pos)\n {\n if(size_ > max_stack_size_ + 1)\n {\n std::vector<T>* ref = reinterpret_cast<std::vector<T>*>(&storage_);\n\n \/\/ convert to std::vector<T>::iterator\n typename std::vector<T>::iterator iter_pos =\n ref->begin() + (pos - ref->data());\n\n auto iter_out = ref->erase(iter_pos);\n --size_;\n\n \/\/ convert std::vector<T>::iterator to pointer\n difference_type diff = iter_out - ref->begin();\n\n\n return ref->data() + diff;\n }\n else if(size_ == max_stack_size_ + 1)\n {\n std::vector<T>* ref = reinterpret_cast<std::vector<T>*>(&storage_);\n\n \/\/ convert to std::vector<T>::iterator\n const auto diff = pos - ref->data();\n typename std::vector<T>::iterator iter_pos =\n ref->begin() + (pos - ref->data());\n\n\n auto iter_out = ref->erase(iter_pos);\n\n std::vector<T> temp(std::move(*ref));\n ref->~vector();\n\n new(&storage_) T[max_stack_size_];\n std::copy(\n temp.begin(), temp.end(), reinterpret_cast<T*>(&storage_));\n --size_;\n\n return reinterpret_cast<T*>(&storage_) + diff;\n }\n else\n {\n T* beg = reinterpret_cast<T*>(&storage_);\n std::copy(pos + 1, end(), pos);\n\n --size_;\n return pos;\n }\n }\n\n iterator\n erase(iterator first, iterator last)\n {\n const auto erase_size = std::distance(first, last);\n\n if(size_ > max_stack_size_ + erase_size)\n {\n std::vector<T>* ref = reinterpret_cast<std::vector<T>*>(&storage_);\n\n \/\/ convert to std::vector<T>::iterator\n auto first_iter = ref->begin() + (first - begin());\n auto last_iter = ref->begin() + (last - begin());\n\n auto iter_out = ref->erase(first_iter, last_iter);\n size_ -= erase_size;\n\n \/\/ convert back to simple pointer\n return begin() + (iter_out - ref->begin());\n }\n else if(size_ <= max_stack_size_)\n {\n T* buff_beg = reinterpret_cast<T*>(&storage_);\n if(last < end()) \/\/ if anything left past end of range to erase\n {\n std::copy(last, end(), first);\n }\n size_ -= erase_size;\n return first;\n }\n else\n {\n std::vector<T>* ref = reinterpret_cast<std::vector<T>*>(&storage_);\n\n \/\/ convert to std::vector<T>::iterator\n auto first_iter = ref->begin() + (first - begin());\n auto last_iter = ref->begin() + (last - begin());\n\n \/\/ carry out erase on vector\n auto iter_out = ref->erase(first_iter, last_iter);\n const auto out_diff = iter_out - ref->begin();\n\n std::vector<T> temp(std::move(*ref));\n ref->~vector();\n\n new(&storage_) T[max_stack_size_];\n\n std::copy(\n temp.begin(), temp.end(), reinterpret_cast<T*>(&storage_));\n\n size_ -= erase_size;\n\n return begin() + out_diff;\n }\n }\n\n\n pointer\n data()\n {\n if(size_ > max_stack_size_)\n {\n return reinterpret_cast<std::vector<T>*>(&storage_)->data();\n }\n else\n {\n return reinterpret_cast<T*>(&storage_);\n }\n }\n\n const_pointer\n data() const\n {\n if(size_ > max_stack_size_)\n {\n return reinterpret_cast<const std::vector<T>*>(&storage_)->data();\n }\n else\n {\n return reinterpret_cast<const T*>(&storage_);\n }\n }\n\n iterator\n begin()\n {\n if(size_ > max_stack_size_)\n {\n return reinterpret_cast<std::vector<T>*>(&storage_)->data();\n }\n else\n {\n return reinterpret_cast<T*>(&storage_);\n }\n }\n\n iterator\n end()\n {\n if(size_ > max_stack_size_)\n {\n return reinterpret_cast<std::vector<T>*>(&storage_)->data() + size_;\n }\n else\n {\n return reinterpret_cast<T*>(&storage_) + size_;\n }\n }\n\n const_iterator\n cbegin() const\n {\n if(size_ > max_stack_size_)\n {\n return reinterpret_cast<const std::vector<T>*>(&storage_)->data();\n }\n else\n {\n return reinterpret_cast<const T*>(&storage_);\n }\n }\n\n const_iterator\n cend() const\n {\n if(size_ > max_stack_size_)\n {\n return reinterpret_cast<const std::vector<T>*>(&storage_)->data() +\n size_;\n }\n else\n {\n return reinterpret_cast<const T*>(&storage_) + size_;\n }\n }\n\n size_type\n size() const\n {\n return size_;\n }\n\n bool\n empty() const\n {\n return size_ == 0;\n }\n\n static constexpr size_type\n max_stack_size()\n {\n return max_stack_size_;\n }\n\n bool\n on_stack() const\n {\n return size_ <= max_stack_size_;\n }\n\nprivate:\n std::aligned_storage_t<at_least_size> storage_;\n size_type size_;\n};\n\n} \/\/ namespace helene\n<|endoftext|>"} {"text":"<commit_before>c753f6e0-2e4d-11e5-9284-b827eb9e62be<commit_msg>c758fa96-2e4d-11e5-9284-b827eb9e62be<commit_after>c758fa96-2e4d-11e5-9284-b827eb9e62be<|endoftext|>"} {"text":"<commit_before>#pragma once\n\n#include <type_traits>\n#include <vector>\n#include <initializer_list>\n#include <cstddef>\n#include <algorithm>\n#include <iterator>\n\n\nnamespace helene\n{\n\ntemplate <class T, std::size_t StackBufferSize = sizeof(std::vector<T>)>\nclass small_vector\n{\n static_assert(std::is_trivial<T>::value,\n \"small_vector is only compatible with trivial types\");\n\npublic:\n typedef typename std::vector<T>::size_type size_type;\n typedef typename std::vector<T>::difference_type difference_type;\n typedef T* iterator;\n typedef const T* const_iterator;\n\nprivate:\n static constexpr size_type at_least_size =\n std::max(StackBufferSize, sizeof(std::vector<T>*));\n static constexpr size_type max_stack_size_ = at_least_size \/ sizeof(T);\n\npublic:\n small_vector() : size_()\n {\n new(&storage_) T[max_stack_size_];\n }\n\n small_vector(std::initializer_list<T> init) : size_(init.size())\n {\n if(size_ > max_stack_size_)\n {\n new(&storage_) std::vector<T>(init);\n }\n else\n {\n new(&storage_) T[max_stack_size_];\n std::copy(\n init.begin(), init.end(), reinterpret_cast<T*>(&storage_));\n }\n }\n\n small_vector(size_type count) : size_(count)\n {\n if(size_ > max_stack_size_)\n {\n new(&storage_) std::vector<T>(count);\n }\n else\n {\n new(&storage_) T[max_stack_size_];\n std::fill_n(reinterpret_cast<T*>(&storage_), size_, T{});\n }\n }\n\n small_vector(size_type count, const T& value)\n {\n if(size_ > max_stack_size_)\n {\n new(&storage_) std::vector<T>(count, value);\n }\n else\n {\n new(&storage_) T[max_stack_size_];\n std::fill_n(reinterpret_cast<T*>(&storage_), size_, value);\n }\n }\n\n ~small_vector()\n {\n if(size_ > max_stack_size_)\n {\n reinterpret_cast<std::vector<T>*>(&storage_)->~vector();\n }\n }\n\npublic:\n void\n push_back(const T& value)\n {\n if(size_ > max_stack_size_)\n {\n reinterpret_cast<std::vector<T>*>(&storage_)->push_back(value);\n }\n else if(size_ == max_stack_size_)\n {\n T* buff = reinterpret_cast<T*>(&storage_);\n T temp[max_stack_size_];\n std::copy(buff, buff + size_, std::begin(temp));\n\n new(&storage_) std::vector<T>(std::begin(temp), std::end(temp));\n reinterpret_cast<std::vector<T>*>(&storage_)->push_back(value);\n }\n else\n {\n reinterpret_cast<T*>(&storage_)[size_] = value;\n }\n\n ++size_;\n }\n\n void\n pop_back()\n {\n if(size_ > max_stack_size_ + 1) \/\/ remain on heap\n {\n reinterpret_cast<std::vector<T>*>(&storage_)->pop_back();\n --size_;\n }\n else if(size_ == max_stack_size_ + 1) \/\/ transition to stack\n {\n \/\/ reinterpret_cast<std::vector<T>*>(&storage_)->pop_back();\n \/\/ not necessary, trivially destructible\n\n std::vector<T> temp(\n std::move(*(reinterpret_cast<std::vector<T>*>(&storage_))));\n reinterpret_cast<std::vector<T>*>(&storage_)->~vector();\n\n new(&storage_) T[max_stack_size_];\n std::copy(\n temp.begin(), temp.end() - 1, reinterpret_cast<T*>(&storage_));\n --size_;\n }\n else \/\/ remain on stack\n {\n --size_;\n }\n }\n\n T& operator[](size_type n)\n {\n if(size_ > max_stack_size_)\n {\n return reinterpret_cast<std::vector<T>*>(&storage_)->operator[](n);\n }\n else\n {\n return reinterpret_cast<T*>(&storage_)[n];\n }\n }\n\n const T& operator[](size_type n) const\n {\n if(size_ > max_stack_size_)\n {\n return reinterpret_cast<const std::vector<T>*>(&storage_)->\n operator[](n);\n }\n else\n {\n return reinterpret_cast<const T*>(&storage_)[n];\n }\n }\n\n\n iterator\n begin()\n {\n if(size_ > max_stack_size_)\n {\n return reinterpret_cast<std::vector<T>*>(&storage_)->data();\n }\n else\n {\n return reinterpret_cast<T*>(&storage_);\n }\n }\n\n iterator\n end()\n {\n if(size_ > max_stack_size_)\n {\n return reinterpret_cast<std::vector<T>*>(&storage_)->data() + size_;\n }\n else\n {\n return reinterpret_cast<T*>(&storage_) + size_;\n }\n }\n\n const_iterator\n cbegin() const\n {\n if(size_ > max_stack_size_)\n {\n return reinterpret_cast<const std::vector<T>*>(&storage_)->data();\n }\n else\n {\n return reinterpret_cast<const T*>(&storage_);\n }\n }\n\n const_iterator\n cend() const\n {\n if(size_ > max_stack_size_)\n {\n return reinterpret_cast<const std::vector<T>*>(&storage_)->data() +\n size_;\n }\n else\n {\n return reinterpret_cast<const T*>(&storage_) + size_;\n }\n }\n\n size_type\n size() const\n {\n return size_;\n }\n\n bool\n empty() const\n {\n return size_ == 0;\n }\n\n static constexpr size_type\n max_stack_size()\n {\n return max_stack_size_;\n }\n\n bool\n on_stack() const\n {\n return size_ <= max_stack_size_;\n }\n\nprivate:\n std::aligned_storage_t<at_least_size> storage_;\n size_type size_;\n};\n\n} \/\/ namespace helene\n<commit_msg>Add member function 'data'. \tmodified: include\/small_vector.hpp<commit_after>#pragma once\n\n#include <type_traits>\n#include <vector>\n#include <initializer_list>\n#include <cstddef>\n#include <algorithm>\n#include <iterator>\n\n\nnamespace helene\n{\n\ntemplate <class T, std::size_t StackBufferSize = sizeof(std::vector<T>)>\nclass small_vector\n{\n static_assert(std::is_trivial<T>::value,\n \"small_vector is only compatible with trivial types\");\n\npublic:\n typedef typename std::vector<T>::size_type size_type;\n typedef typename std::vector<T>::difference_type difference_type;\n typedef T* iterator;\n typedef const T* const_iterator;\n\nprivate:\n static constexpr size_type at_least_size =\n std::max(StackBufferSize, sizeof(std::vector<T>*));\n static constexpr size_type max_stack_size_ = at_least_size \/ sizeof(T);\n\npublic:\n small_vector() : size_()\n {\n new(&storage_) T[max_stack_size_];\n }\n\n small_vector(std::initializer_list<T> init) : size_(init.size())\n {\n if(size_ > max_stack_size_)\n {\n new(&storage_) std::vector<T>(init);\n }\n else\n {\n new(&storage_) T[max_stack_size_];\n std::copy(\n init.begin(), init.end(), reinterpret_cast<T*>(&storage_));\n }\n }\n\n small_vector(size_type count) : size_(count)\n {\n if(size_ > max_stack_size_)\n {\n new(&storage_) std::vector<T>(count);\n }\n else\n {\n new(&storage_) T[max_stack_size_];\n std::fill_n(reinterpret_cast<T*>(&storage_), size_, T{});\n }\n }\n\n small_vector(size_type count, const T& value)\n {\n if(size_ > max_stack_size_)\n {\n new(&storage_) std::vector<T>(count, value);\n }\n else\n {\n new(&storage_) T[max_stack_size_];\n std::fill_n(reinterpret_cast<T*>(&storage_), size_, value);\n }\n }\n\n ~small_vector()\n {\n if(size_ > max_stack_size_)\n {\n reinterpret_cast<std::vector<T>*>(&storage_)->~vector();\n }\n }\n\npublic:\n void\n push_back(const T& value)\n {\n if(size_ > max_stack_size_)\n {\n reinterpret_cast<std::vector<T>*>(&storage_)->push_back(value);\n }\n else if(size_ == max_stack_size_)\n {\n T* buff = reinterpret_cast<T*>(&storage_);\n T temp[max_stack_size_];\n std::copy(buff, buff + size_, std::begin(temp));\n\n new(&storage_) std::vector<T>(std::begin(temp), std::end(temp));\n reinterpret_cast<std::vector<T>*>(&storage_)->push_back(value);\n }\n else\n {\n reinterpret_cast<T*>(&storage_)[size_] = value;\n }\n\n ++size_;\n }\n\n void\n pop_back()\n {\n if(size_ > max_stack_size_ + 1) \/\/ remain on heap\n {\n reinterpret_cast<std::vector<T>*>(&storage_)->pop_back();\n --size_;\n }\n else if(size_ == max_stack_size_ + 1) \/\/ transition to stack\n {\n \/\/ reinterpret_cast<std::vector<T>*>(&storage_)->pop_back();\n \/\/ not necessary, trivially destructible\n\n std::vector<T> temp(\n std::move(*(reinterpret_cast<std::vector<T>*>(&storage_))));\n reinterpret_cast<std::vector<T>*>(&storage_)->~vector();\n\n new(&storage_) T[max_stack_size_];\n std::copy(\n temp.begin(), temp.end() - 1, reinterpret_cast<T*>(&storage_));\n --size_;\n }\n else \/\/ remain on stack\n {\n --size_;\n }\n }\n\n T& operator[](size_type n)\n {\n if(size_ > max_stack_size_)\n {\n return reinterpret_cast<std::vector<T>*>(&storage_)->operator[](n);\n }\n else\n {\n return reinterpret_cast<T*>(&storage_)[n];\n }\n }\n\n const T& operator[](size_type n) const\n {\n if(size_ > max_stack_size_)\n {\n return reinterpret_cast<const std::vector<T>*>(&storage_)->\n operator[](n);\n }\n else\n {\n return reinterpret_cast<const T*>(&storage_)[n];\n }\n }\n\n T*\n data()\n {\n if(size_ > max_stack_size_)\n {\n return reinterpret_cast<std::vector<T>*>(&storage_)->data();\n }\n else\n {\n return reinterpret_cast<T*>(&storage_);\n }\n }\n\n const T*\n data() const\n {\n if(size_ > max_stack_size_)\n {\n return reinterpret_cast<const std::vector<T>*>(&storage_)->data();\n }\n else\n {\n return reinterpret_cast<const T*>(&storage_);\n }\n }\n\n iterator\n begin()\n {\n if(size_ > max_stack_size_)\n {\n return reinterpret_cast<std::vector<T>*>(&storage_)->data();\n }\n else\n {\n return reinterpret_cast<T*>(&storage_);\n }\n }\n\n iterator\n end()\n {\n if(size_ > max_stack_size_)\n {\n return reinterpret_cast<std::vector<T>*>(&storage_)->data() + size_;\n }\n else\n {\n return reinterpret_cast<T*>(&storage_) + size_;\n }\n }\n\n const_iterator\n cbegin() const\n {\n if(size_ > max_stack_size_)\n {\n return reinterpret_cast<const std::vector<T>*>(&storage_)->data();\n }\n else\n {\n return reinterpret_cast<const T*>(&storage_);\n }\n }\n\n const_iterator\n cend() const\n {\n if(size_ > max_stack_size_)\n {\n return reinterpret_cast<const std::vector<T>*>(&storage_)->data() +\n size_;\n }\n else\n {\n return reinterpret_cast<const T*>(&storage_) + size_;\n }\n }\n\n size_type\n size() const\n {\n return size_;\n }\n\n bool\n empty() const\n {\n return size_ == 0;\n }\n\n static constexpr size_type\n max_stack_size()\n {\n return max_stack_size_;\n }\n\n bool\n on_stack() const\n {\n return size_ <= max_stack_size_;\n }\n\nprivate:\n std::aligned_storage_t<at_least_size> storage_;\n size_type size_;\n};\n\n} \/\/ namespace helene\n<|endoftext|>"} {"text":"<commit_before>\/**\n ******************************************************************************\n * Xenia : Xbox 360 Emulator Research Project *\n ******************************************************************************\n * Copyright 2017 Ben Vanik. All rights reserved. *\n * Released under the BSD license - see LICENSE in the root for more details. *\n ******************************************************************************\n *\/\n\n#include \"xenia\/base\/memory.h\"\n\n#include <sys\/mman.h>\n#include <unistd.h>\n\nnamespace xe {\nnamespace memory {\n\nsize_t page_size() { return getpagesize(); }\nsize_t allocation_granularity() { return page_size(); }\n\nuint32_t ToPosixProtectFlags(PageAccess access) {\n switch (access) {\n case PageAccess::kNoAccess:\n return PROT_NONE;\n case PageAccess::kReadOnly:\n return PROT_READ;\n case PageAccess::kReadWrite:\n return PROT_READ | PROT_WRITE;\n case PageAccess::kExecuteReadWrite:\n return PROT_READ | PROT_WRITE | PROT_EXEC;\n default:\n assert_unhandled_case(access);\n return PROT_NONE;\n }\n}\n\nvoid* AllocFixed(void* base_address, size_t length,\n AllocationType allocation_type, PageAccess access) {\n \/\/ mmap does not support reserve \/ commit, so ignore allocation_type.\n uint32_t prot = ToPosixProtectFlags(access);\n return mmap(base_address, length, prot, MAP_PRIVATE | MAP_ANONYMOUS, -1, 0);\n}\n\nbool DeallocFixed(void* base_address, size_t length,\n DeallocationType deallocation_type) {\n return munmap(base_address, length) == 0;\n}\n\nbool Protect(void* base_address, size_t length, PageAccess access,\n PageAccess* out_old_access) {\n \/\/ Linux does not have a syscall to query memory permissions.\n assert_null(out_old_access);\n\n uint32_t prot = ToPosixProtectFlags(access);\n return mprotect(base_address, length, prot) == 0;\n}\n\nbool QueryProtect(void* base_address, size_t& length, PageAccess& access_out) {\n return false;\n}\n\nFileMappingHandle CreateFileMappingHandle(std::wstring path, size_t length,\n PageAccess access, bool commit) {\n return nullptr;\n}\n\nvoid CloseFileMappingHandle(FileMappingHandle handle) {}\n\nvoid* MapFileView(FileMappingHandle handle, void* base_address, size_t length,\n PageAccess access, size_t file_offset) {\n return nullptr;\n}\n\nbool UnmapFileView(FileMappingHandle handle, void* base_address,\n size_t length) {\n return false;\n}\n\n} \/\/ namespace memory\n} \/\/ namespace xe\n<commit_msg>[Base] First-pass memory file mapping support<commit_after>\/**\n ******************************************************************************\n * Xenia : Xbox 360 Emulator Research Project *\n ******************************************************************************\n * Copyright 2017 Ben Vanik. All rights reserved. *\n * Released under the BSD license - see LICENSE in the root for more details. *\n ******************************************************************************\n *\/\n\n#include \"xenia\/base\/memory.h\"\n#include \"xenia\/base\/string.h\"\n\n#include <fcntl.h>\n#include <sys\/mman.h>\n#include <unistd.h>\n\nnamespace xe {\nnamespace memory {\n\nsize_t page_size() { return getpagesize(); }\nsize_t allocation_granularity() { return page_size(); }\n\nuint32_t ToPosixProtectFlags(PageAccess access) {\n switch (access) {\n case PageAccess::kNoAccess:\n return PROT_NONE;\n case PageAccess::kReadOnly:\n return PROT_READ;\n case PageAccess::kReadWrite:\n return PROT_READ | PROT_WRITE;\n case PageAccess::kExecuteReadWrite:\n return PROT_READ | PROT_WRITE | PROT_EXEC;\n default:\n assert_unhandled_case(access);\n return PROT_NONE;\n }\n}\n\nvoid* AllocFixed(void* base_address, size_t length,\n AllocationType allocation_type, PageAccess access) {\n \/\/ mmap does not support reserve \/ commit, so ignore allocation_type.\n uint32_t prot = ToPosixProtectFlags(access);\n return mmap(base_address, length, prot, MAP_PRIVATE | MAP_ANONYMOUS, -1, 0);\n}\n\nbool DeallocFixed(void* base_address, size_t length,\n DeallocationType deallocation_type) {\n return munmap(base_address, length) == 0;\n}\n\nbool Protect(void* base_address, size_t length, PageAccess access,\n PageAccess* out_old_access) {\n \/\/ Linux does not have a syscall to query memory permissions.\n assert_null(out_old_access);\n\n uint32_t prot = ToPosixProtectFlags(access);\n return mprotect(base_address, length, prot) == 0;\n}\n\nbool QueryProtect(void* base_address, size_t& length, PageAccess& access_out) {\n return false;\n}\n\nFileMappingHandle CreateFileMappingHandle(std::wstring path, size_t length,\n PageAccess access, bool commit) {\n int oflag;\n switch (access) {\n case PageAccess::kNoAccess:\n oflag = 0;\n break;\n case PageAccess::kReadOnly:\n oflag = O_RDONLY;\n break;\n case PageAccess::kReadWrite:\n oflag = O_RDWR;\n break;\n default:\n assert_always();\n return nullptr;\n }\n\n oflag |= O_CREAT;\n int ret = shm_open(xe::to_string(path).c_str(), oflag, 0777);\n if (ret > 0) {\n ftruncate64(ret, length);\n }\n\n return ret <= 0 ? nullptr : reinterpret_cast<FileMappingHandle>(ret);\n}\n\nvoid CloseFileMappingHandle(FileMappingHandle handle) {\n close((intptr_t)handle);\n}\n\nvoid* MapFileView(FileMappingHandle handle, void* base_address, size_t length,\n PageAccess access, size_t file_offset) {\n uint32_t prot = ToPosixProtectFlags(access);\n return mmap64(base_address, length, prot, MAP_PRIVATE | MAP_ANONYMOUS,\n reinterpret_cast<intptr_t>(handle), file_offset);\n}\n\nbool UnmapFileView(FileMappingHandle handle, void* base_address,\n size_t length) {\n return munmap(base_address, length) == 0;\n}\n\n} \/\/ namespace memory\n} \/\/ namespace xe\n<|endoftext|>"} {"text":"<commit_before>114a6ae0-2e4e-11e5-9284-b827eb9e62be<commit_msg>114f618a-2e4e-11e5-9284-b827eb9e62be<commit_after>114f618a-2e4e-11e5-9284-b827eb9e62be<|endoftext|>"} {"text":"<commit_before>3f7c38c2-2e4d-11e5-9284-b827eb9e62be<commit_msg>3f8147d6-2e4d-11e5-9284-b827eb9e62be<commit_after>3f8147d6-2e4d-11e5-9284-b827eb9e62be<|endoftext|>"} {"text":"<commit_before>\/*! \\file *\/ \/\/ Copyright 2011-2020 Tyler Gilbert and Stratify Labs, Inc; see LICENSE.md for rights.\n#ifndef SAPI_UX_COMPONENT_HPP\n#define SAPI_UX_COMPONENT_HPP\n\n#include \"..\/api\/WorkObject.hpp\"\n#include \"..\/hal\/Display.hpp\"\n#include \"..\/var\/String.hpp\"\n#include \"..\/sgfx\/Theme.hpp\"\n#include \"Drawing.hpp\"\n#include \"Event.hpp\"\n\n#define COMPONENT_SIGNATURE(a,b,c,d) ((a << 24) | (b << 16) | (c << 8) | (d))\n\nnamespace ux {\n\nclass EventLoop;\n\nclass Component : public Drawing {\npublic:\n\n\tComponent(\n\t\t\tconst var::String & name,\n\t\t\tu32 signature = 0) :\n\t\tm_name(name), m_signature(signature){\n\t}\n\tvirtual ~Component();\n\n\ttemplate<typename T> T * reinterpret(){\n\t\treturn static_cast<T*>(this);\n\t}\n\n\n\tstatic u32 whatis_signature(){\n\t\treturn 0;\n\t}\n\n\tenum sgfx::Theme::style theme_style() const {\n\t\treturn m_theme_style;\n\t}\n\n\tenum sgfx::Theme::state theme_state() const {\n\t\treturn m_theme_state;\n\t}\n\n\tbool is_antialias() const {\n\t\treturn m_is_antialias;\n\t}\n\n\tComponent& set_antialias(bool value = true){\n\t\tm_is_antialias = value;\n\t\treturn *this;\n\t}\n\n\tbool is_visible() const {\n\t\treturn m_is_visible;\n\t}\n\n\tbool is_enabled() const {\n\t\treturn m_is_enabled;\n\t}\n\n\n\tconst sgfx::Theme * theme() const;\n\tconst hal::Display * display() const;\n\thal::Display * display();\n\n\n\n\t\/\/update the location of the component (allow animations)\n\n\tvirtual void handle_event(const ux::Event & event){}\n\n\tconst var::String & name() const {\n\t\treturn m_name;\n\t}\n\n\tvoid apply_antialias_filter(const DrawingAttributes & attributes);\n\tvoid apply_antialias_filter(const DrawingScaledAttributes & attributes);\n\n\tvoid redraw(){\n\t\tif( is_ready_to_draw() ){\n\t\t\tdraw(local_drawing_attributes());\n\t\t\tset_refresh_drawing_pending();\n\t\t}\n\t}\n\n\tsgfx::Region region() const {\n\t\treturn m_reference_drawing_attributes.calculate_region_on_bitmap();\n\t}\n\n\tbool contains(const sgfx::Point & point){\n\t\treturn sgfx::Region(\n\t\t\t\t\tm_reference_drawing_attributes.calculate_region_on_bitmap()\n\t\t\t\t\t).contains(point);\n\t}\n\n\tDrawingPoint translate_point(const sgfx::Point & point);\n\n\tvoid erase();\n\n\tvoid set_refresh_drawing_pending(){\n\t\tm_is_refresh_drawing_pending = true;\n\t}\n\n\tEventLoop * event_loop(){\n\t\treturn m_event_loop;\n\t}\n\n\tconst EventLoop * event_loop() const {\n\t\treturn m_event_loop;\n\t}\n\n\tvoid set_drawing_area(const DrawingArea & drawing_area){\n\t\tm_reference_drawing_attributes.set_area(drawing_area);\n\t}\n\n\tvoid set_drawing_point(const DrawingPoint & drawing_point){\n\t\tm_reference_drawing_attributes.set_point(drawing_point);\n\t}\n\n\tvoid set_theme_style(enum sgfx::Theme::style value){\n\t\tm_theme_style = value;\n\t}\n\n\tvoid set_theme_state(enum sgfx::Theme::state value){\n\t\tm_theme_state = value;\n\t}\n\nprotected:\n\n\tbool m_is_visible = false;\n\tbool m_is_enabled = true;\n\tbool m_is_created = false;\n\tvirtual void examine_visibility();\n\n\n\tvirtual void touch_drawing_attributes(){}\n\n\tvoid set_refresh_region(const sgfx::Region & region){\n\t\tif( region.width() * region.height() == 0 ){\n\t\t\tm_refresh_region = m_local_bitmap.region();\n\t\t} else {\n\t\t\tm_refresh_region = region;\n\t\t}\n\t}\n\n\tbool is_refresh_drawing_pending() const {\n\t\treturn m_is_refresh_drawing_pending;\n\t}\n\n\tvoid refresh_drawing();\n\tfriend class Layout;\n\tfriend class LayoutComponent;\n\n\tconst DrawingAttributes & local_drawing_attributes() const {\n\t\treturn m_local_drawing_attributes;\n\t}\n\n\tconst DrawingAttributes& reference_drawing_attributes() const {\n\t\treturn m_reference_drawing_attributes;\n\t}\n\n\tDrawingAttributes& reference_drawing_attributes(){\n\t\treturn m_reference_drawing_attributes;\n\t}\n\n\tvirtual void set_enabled_internal(bool value = true){\n\t\tif( m_is_enabled != value ){\n\t\t\tm_is_enabled = value;\n\t\t\texamine_visibility();\n\t\t}\n\t}\n\n\tvirtual void set_visible_internal(bool value = true){\n\t\tif( m_is_visible != value ){\n\t\t\tm_is_visible = value;\n\t\t\texamine_visibility();\n\t\t}\n\t}\n\n\tvoid set_event_loop(EventLoop * event_loop){\n\t\tm_event_loop = event_loop;\n\t}\n\n\tbool is_ready_to_draw() const {\n\t\treturn is_enabled() && is_visible();\n\t}\n\n\tu32 signature() const {\n\t\treturn m_signature;\n\t}\n\n\nprivate:\n\n\tvar::String m_name;\n\tconst u32 m_signature;\n\t\/\/needs to know where on the display it is drawn\n\tDrawingAttributes m_reference_drawing_attributes;\n\tDrawingAttributes m_local_drawing_attributes;\n\tsgfx::Bitmap m_local_bitmap;\n\tenum sgfx::Theme::style m_theme_style = sgfx::Theme::style_brand_primary;\n\tenum sgfx::Theme::state m_theme_state = sgfx::Theme::state_default;\n\tbool m_is_antialias = true;\n\tbool m_is_refresh_drawing_pending;\n\tsgfx::Region m_refresh_region;\n\n\t\/\/needs a palette to use while drawing\n\tEventLoop * m_event_loop = nullptr;\n\n\tvoid set_name(const var::String & name){\n\t\tm_name = name;\n\t}\n\n\n};\n\ntemplate<class T, u32 signature_value> class ComponentAccess : public Component {\npublic:\n\n\tComponentAccess(const var::String & name) :\n\t\tComponent(name, signature_value){}\n\n\tT& set_enabled(bool value = true){\n\t\tComponent::set_enabled_internal(value);\n\t\treturn static_cast<T&>(*this);\n\t}\n\n\tT& set_drawing_area(const DrawingArea & value){\n\t\tComponent::set_drawing_area(value);\n\t\treturn static_cast<T&>(*this);\n\t}\n\n\tT& set_drawing_point(const DrawingPoint & value){\n\t\tComponent::set_drawing_point(value);\n\t\treturn static_cast<T&>(*this);\n\t}\n\n\tT& set_theme_style(enum sgfx::Theme::style value){\n\t\tComponent::set_theme_style(value);\n\t\treturn static_cast<T&>(*this);\n\t}\n\n\tT& set_theme_state(enum sgfx::Theme::state value){\n\t\tComponent::set_theme_state(value);\n\t\treturn static_cast<T&>(*this);\n\t}\n\n\ttemplate<typename... Args> static T & create(\n\t\t\tArgs... args\n\t\t\t){\n\t\tT * result = new T(args...);\n\t\tif( result == nullptr ){\n\t\t\t\/\/assert here\n\t\t\tprintf(\"failed!!!\\n\");\n\t\t}\n\t\tresult->m_is_created = true;\n\t\treturn *result;\n\t}\n\n\nprotected:\n\n};\n\n\n}\n\n#endif \/\/ SAPI_UX_COMPONENT_HPP\n<commit_msg>set_drawing_point() and set_drawing_area() easier to access<commit_after>\/*! \\file *\/ \/\/ Copyright 2011-2020 Tyler Gilbert and Stratify Labs, Inc; see LICENSE.md for rights.\n#ifndef SAPI_UX_COMPONENT_HPP\n#define SAPI_UX_COMPONENT_HPP\n\n#include \"..\/api\/WorkObject.hpp\"\n#include \"..\/hal\/Display.hpp\"\n#include \"..\/var\/String.hpp\"\n#include \"..\/sgfx\/Theme.hpp\"\n#include \"Drawing.hpp\"\n#include \"Event.hpp\"\n\n#define COMPONENT_SIGNATURE(a,b,c,d) ((a << 24) | (b << 16) | (c << 8) | (d))\n\nnamespace ux {\n\nclass EventLoop;\n\nclass Component : public Drawing {\npublic:\n\n\tComponent(\n\t\t\tconst var::String & name,\n\t\t\tu32 signature = 0) :\n\t\tm_name(name), m_signature(signature){\n\t\tset_drawing_point(DrawingPoint(0,0));\n\t\tset_drawing_area(DrawingArea(1000,1000));\n\t}\n\tvirtual ~Component();\n\n\ttemplate<typename T> T * reinterpret(){\n\t\treturn static_cast<T*>(this);\n\t}\n\n\n\tstatic u32 whatis_signature(){\n\t\treturn 0;\n\t}\n\n\tenum sgfx::Theme::style theme_style() const {\n\t\treturn m_theme_style;\n\t}\n\n\tenum sgfx::Theme::state theme_state() const {\n\t\treturn m_theme_state;\n\t}\n\n\tbool is_antialias() const {\n\t\treturn m_is_antialias;\n\t}\n\n\tComponent& set_antialias(bool value = true){\n\t\tm_is_antialias = value;\n\t\treturn *this;\n\t}\n\n\tbool is_visible() const {\n\t\treturn m_is_visible;\n\t}\n\n\tbool is_enabled() const {\n\t\treturn m_is_enabled;\n\t}\n\n\n\tconst sgfx::Theme * theme() const;\n\tconst hal::Display * display() const;\n\thal::Display * display();\n\n\n\n\t\/\/update the location of the component (allow animations)\n\n\tvirtual void handle_event(const ux::Event & event){}\n\n\tconst var::String & name() const {\n\t\treturn m_name;\n\t}\n\n\tvoid apply_antialias_filter(const DrawingAttributes & attributes);\n\tvoid apply_antialias_filter(const DrawingScaledAttributes & attributes);\n\n\tvoid redraw(){\n\t\tif( is_ready_to_draw() ){\n\t\t\tdraw(local_drawing_attributes());\n\t\t\tset_refresh_drawing_pending();\n\t\t}\n\t}\n\n\tsgfx::Region region() const {\n\t\treturn m_reference_drawing_attributes.calculate_region_on_bitmap();\n\t}\n\n\tbool contains(const sgfx::Point & point){\n\t\treturn sgfx::Region(\n\t\t\t\t\tm_reference_drawing_attributes.calculate_region_on_bitmap()\n\t\t\t\t\t).contains(point);\n\t}\n\n\tDrawingPoint translate_point(const sgfx::Point & point);\n\n\tvoid erase();\n\n\tvoid set_refresh_drawing_pending(){\n\t\tm_is_refresh_drawing_pending = true;\n\t}\n\n\tEventLoop * event_loop(){\n\t\treturn m_event_loop;\n\t}\n\n\tconst EventLoop * event_loop() const {\n\t\treturn m_event_loop;\n\t}\n\n\tvoid set_drawing_area(const DrawingArea & drawing_area){\n\t\tm_reference_drawing_attributes.set_area(drawing_area);\n\t}\n\n\tvoid set_drawing_point(const DrawingPoint & drawing_point){\n\t\tm_reference_drawing_attributes.set_point(drawing_point);\n\t}\n\n\tvoid set_theme_style(enum sgfx::Theme::style value){\n\t\tm_theme_style = value;\n\t}\n\n\tvoid set_theme_state(enum sgfx::Theme::state value){\n\t\tm_theme_state = value;\n\t}\n\nprotected:\n\n\tbool m_is_visible = false;\n\tbool m_is_enabled = true;\n\tbool m_is_created = false;\n\tvirtual void examine_visibility();\n\n\n\tvirtual void touch_drawing_attributes(){}\n\n\tvoid set_refresh_region(const sgfx::Region & region){\n\t\tif( region.width() * region.height() == 0 ){\n\t\t\tm_refresh_region = m_local_bitmap.region();\n\t\t} else {\n\t\t\tm_refresh_region = region;\n\t\t}\n\t}\n\n\tbool is_refresh_drawing_pending() const {\n\t\treturn m_is_refresh_drawing_pending;\n\t}\n\n\tvoid refresh_drawing();\n\tfriend class Layout;\n\tfriend class LayoutComponent;\n\n\tconst DrawingAttributes & local_drawing_attributes() const {\n\t\treturn m_local_drawing_attributes;\n\t}\n\n\tconst DrawingAttributes& reference_drawing_attributes() const {\n\t\treturn m_reference_drawing_attributes;\n\t}\n\n\tDrawingAttributes& reference_drawing_attributes(){\n\t\treturn m_reference_drawing_attributes;\n\t}\n\n\tvirtual void set_enabled_internal(bool value = true){\n\t\tif( m_is_enabled != value ){\n\t\t\tm_is_enabled = value;\n\t\t\texamine_visibility();\n\t\t}\n\t}\n\n\tvirtual void set_visible_internal(bool value = true){\n\t\tif( m_is_visible != value ){\n\t\t\tm_is_visible = value;\n\t\t\texamine_visibility();\n\t\t}\n\t}\n\n\tvoid set_event_loop(EventLoop * event_loop){\n\t\tm_event_loop = event_loop;\n\t}\n\n\tbool is_ready_to_draw() const {\n\t\treturn is_enabled() && is_visible();\n\t}\n\n\tu32 signature() const {\n\t\treturn m_signature;\n\t}\n\n\nprivate:\n\n\tvar::String m_name;\n\tconst u32 m_signature;\n\t\/\/needs to know where on the display it is drawn\n\tDrawingAttributes m_reference_drawing_attributes;\n\tDrawingAttributes m_local_drawing_attributes;\n\tsgfx::Bitmap m_local_bitmap;\n\tenum sgfx::Theme::style m_theme_style = sgfx::Theme::style_brand_primary;\n\tenum sgfx::Theme::state m_theme_state = sgfx::Theme::state_default;\n\tbool m_is_antialias = true;\n\tbool m_is_refresh_drawing_pending;\n\tsgfx::Region m_refresh_region;\n\n\t\/\/needs a palette to use while drawing\n\tEventLoop * m_event_loop = nullptr;\n\n\tvoid set_name(const var::String & name){\n\t\tm_name = name;\n\t}\n\n\n};\n\ntemplate<class T, u32 signature_value> class ComponentAccess : public Component {\npublic:\n\n\tComponentAccess(const var::String & name) :\n\t\tComponent(name, signature_value){}\n\n\tT& set_enabled(bool value = true){\n\t\tComponent::set_enabled_internal(value);\n\t\treturn static_cast<T&>(*this);\n\t}\n\n\tT& set_drawing_area(const DrawingArea & value){\n\t\tComponent::set_drawing_area(value);\n\t\treturn static_cast<T&>(*this);\n\t}\n\n\tT& set_drawing_area(drawing_size_t width, drawing_size_t height){\n\t\tComponent::set_drawing_area(DrawingArea(width,height));\n\t\treturn static_cast<T&>(*this);\n\t}\n\n\tT& set_drawing_point(const DrawingPoint & value){\n\t\tComponent::set_drawing_point(value);\n\t\treturn static_cast<T&>(*this);\n\t}\n\n\tT& set_drawing_point(drawing_int_t x, drawing_int_t y){\n\t\tComponent::set_drawing_point(DrawingPoint(x,y));\n\t\treturn static_cast<T&>(*this);\n\t}\n\n\tT& set_theme_style(enum sgfx::Theme::style value){\n\t\tComponent::set_theme_style(value);\n\t\treturn static_cast<T&>(*this);\n\t}\n\n\tT& set_theme_state(enum sgfx::Theme::state value){\n\t\tComponent::set_theme_state(value);\n\t\treturn static_cast<T&>(*this);\n\t}\n\n\ttemplate<typename... Args> static T & create(\n\t\t\tArgs... args\n\t\t\t){\n\t\tT * result = new T(args...);\n\t\tif( result == nullptr ){\n\t\t\t\/\/assert here\n\t\t\tprintf(\"failed!!!\\n\");\n\t\t}\n\t\tresult->m_is_created = true;\n\t\treturn *result;\n\t}\n\n\nprotected:\n\n};\n\n\n}\n\n#endif \/\/ SAPI_UX_COMPONENT_HPP\n<|endoftext|>"} {"text":"<commit_before>6271cc2a-2e4d-11e5-9284-b827eb9e62be<commit_msg>62772e54-2e4d-11e5-9284-b827eb9e62be<commit_after>62772e54-2e4d-11e5-9284-b827eb9e62be<|endoftext|>"} {"text":"<commit_before>5335e17e-2e4d-11e5-9284-b827eb9e62be<commit_msg>533ad8be-2e4d-11e5-9284-b827eb9e62be<commit_after>533ad8be-2e4d-11e5-9284-b827eb9e62be<|endoftext|>"} {"text":"<commit_before>0b33dd5e-2e4d-11e5-9284-b827eb9e62be<commit_msg>0b39550e-2e4d-11e5-9284-b827eb9e62be<commit_after>0b39550e-2e4d-11e5-9284-b827eb9e62be<|endoftext|>"} {"text":"<commit_before>da7af010-2e4e-11e5-9284-b827eb9e62be<commit_msg>da7ff09c-2e4e-11e5-9284-b827eb9e62be<commit_after>da7ff09c-2e4e-11e5-9284-b827eb9e62be<|endoftext|>"} {"text":"<commit_before>\/\/ windows-wlan-util.cpp : Defines the entry point for the console application.\n\/\/\n\n#include \"stdafx.h\"\n\n\/\/ Struct containing useful network info\nstruct NetworkInfo {\n\tUCHAR ssid[32];\n\tUCHAR bssid[32];\n\tULONG frequency;\n\tLONG rssi;\n\tULONG quality;\n};\n\n\/\/ Get a WLAN handle, necessary for all other operations\nHANDLE getWlanHandle() {\n\t\/\/ Result variable\n\tDWORD dwResult;\n\n\t\/\/ Maximum number of clients (?)\n\tDWORD dwMaxClient = 2;\n\t\/\/ Current version\n\tDWORD dwCurVersion;\n\n\t\/\/ Handle\n\tHANDLE hClient = NULL;\n\t\/\/ Open WLAN handle\n\tdwResult = WlanOpenHandle(dwMaxClient, NULL, &dwCurVersion, &hClient);\n\n\tif (dwResult != ERROR_SUCCESS) {\n\t\treturn NULL;\n\t}\n\telse {\n\t\treturn hClient;\n\t}\n}\n\n\/\/ Get a list of WLAN interfaces\nPWLAN_INTERFACE_INFO_LIST getWlanInterfaces(HANDLE whandle) {\n\tPWLAN_INTERFACE_INFO_LIST ifList = NULL;\n\tDWORD dwResult;\n\tdwResult = WlanEnumInterfaces(whandle, NULL, &ifList);\n\n\tif (dwResult != ERROR_SUCCESS) {\n\t\treturn NULL;\n\t}\n\telse {\n\t\treturn ifList;\n\t}\n}\n\n\/\/ Initiate a scan of Wifi Networks on the given interface\nboolean scanWifiNetworks(HANDLE hClient, GUID ifGuid) {\n\tDWORD dwResult;\n\tdwResult = WlanScan(hClient, &ifGuid, NULL, NULL, NULL);\n\tif (dwResult != ERROR_SUCCESS) {\n\t\treturn false;\n\t}\n\telse {\n\t\treturn true;\n\t}\n}\n\n\/\/ Get a list of Wifi Networks from the last scan\nstd::vector<NetworkInfo> getWifiNetworks(HANDLE hClient, GUID ifGuid) {\n\t\/\/ Return variable\n\tstd::vector<NetworkInfo> ns;\n\n\t\/\/ Result variable\n\tDWORD dwResult;\n\n\t\/\/ List of interfaces\n\tPWLAN_INTERFACE_INFO_LIST ifList = NULL;\n\t\/\/ Interface info\n\tPWLAN_INTERFACE_INFO ifInfo = NULL;\n\t\/\/ Service list\n\tPWLAN_BSS_LIST bssList = NULL;\n\t\/\/ Network service\n\tPWLAN_BSS_ENTRY bssEntry = NULL;\n\n\t\/\/ Get a list of interfaces\n\tdwResult = WlanEnumInterfaces(hClient, NULL, &ifList);\n\tif (dwResult != ERROR_SUCCESS) {\n\t\treturn ns;\n\t}\n\telse {\n\t\t\/\/ Retrieve a list of available networks\n\t\tdwResult = WlanGetNetworkBssList(hClient, &ifGuid, NULL, dot11_BSS_type_any, NULL, NULL, &bssList);\n\t\tif (dwResult != ERROR_SUCCESS) {\n\t\t}\n\t\telse {\n\t\t\t\/\/ For each network\n\t\t\tfor (unsigned int j = 0; j < bssList->dwNumberOfItems; j++) {\n\t\t\t\t\/\/ Grab the network\n\t\t\t\tbssEntry = (WLAN_BSS_ENTRY *)&bssList->wlanBssEntries[j];\n\n\t\t\t\t\/\/ Network info struct\n\t\t\t\tNetworkInfo ni;\n\t\t\t\t\/\/ SSID\n\t\t\t\tfor (int k = 0, l = bssEntry->dot11Ssid.uSSIDLength; k < 32; k++) {\n\t\t\t\t\tif (k < l) ni.ssid[k] = (int)bssEntry->dot11Ssid.ucSSID[k];\n\t\t\t\t\telse ni.ssid[k] = 0;\n\t\t\t\t}\n\t\t\t\t\/\/ Hardware MAC Address\n\t\t\t\tfor (int k = 0, l = 6; k < 32; k++) {\n\t\t\t\t\tif (k < l) ni.bssid[k] = (int)bssEntry->dot11Bssid[k];\n\t\t\t\t\telse ni.bssid[k] = 0;\n\t\t\t\t}\n\t\t\t\t\/\/ Channel Frequency\n\t\t\t\tni.frequency = bssEntry->ulChCenterFrequency;\n\t\t\t\t\/\/ Rssi\n\t\t\t\tni.rssi = bssEntry->lRssi;\n\t\t\t\t\/\/ Signal quality\n\t\t\t\tni.quality = bssEntry->uLinkQuality;\n\n\t\t\t\t\/\/ Add to the list\n\t\t\t\tns.push_back(ni);\n\t\t\t}\n\t\t}\n\t}\n\n\t\/\/ Clean up\n\tif (bssList != NULL) {\n\t\tWlanFreeMemory(bssList);\n\t\tbssList = NULL;\n\t}\n\tif (ifList != NULL) {\n\t\tWlanFreeMemory(ifList);\n\t\tifList = NULL;\n\t}\n\n\t\/\/ Finish\n\treturn ns;\n}\n\n\/\/ Print usage\nvoid usage(const char* name) {\n\tprintf(\"Usage: %s <task> [interface number]\\n\", name);\n}\n\n\/\/ Tasks\nconst int TASK_USAGE = 0;\nconst int TASK_LIST_INTERFACES = 1;\nconst int TASK_SCAN_NETWORKS = 2;\nconst int TASK_LIST_NETWORKS = 3;\n\n\/\/ Main program\nint main(int argc, char** argv)\n{\n\t\/\/ Parse arguments\n\tint task = 0;\n\tif (argc < 2) {\n\t\tusage(argv[0]);\n\t\treturn 2;\n\t}\n\t\/\/ Interface number\n\tDWORD ifSelect = 0;\n\n\t\/\/ Task\n\tif (argc >= 2) {\n\t\tif (strncmp(argv[1], \"if\", 2) == 0) {\n\t\t\ttask = TASK_LIST_INTERFACES;\n\t\t}\n\t\telse if (strncmp(argv[1], \"scan\", 4) == 0) {\n\t\t\ttask = TASK_SCAN_NETWORKS;\n\t\t}\n\t\telse if (strncmp(argv[1], \"list\", 4) == 0) {\n\t\t\ttask = TASK_LIST_NETWORKS;\n\t\t}\n\t}\n\n\t\/\/ Interface\n\tif (argc >= 3) {\n\t\tsscanf_s(argv[2], \"%d\", &ifSelect);\n\t}\n\n\t\/\/ Setup\n\tHANDLE whandle = getWlanHandle();\n\tstd::string input;\n\n\tif (whandle == NULL) {\n\t\tprintf(\"Error: Failed to open wlan handle.\\n\");\n\t\treturn 1;\n\t}\n\n\t\/\/ Print usage and exit\n\tif (task == TASK_USAGE) {\n\t\tusage(argv[0]);\n\t\treturn 2;\n\t}\n\n\t\/\/ Get interfaces\n\tPWLAN_INTERFACE_INFO_LIST ifList = NULL;\n\tifList = getWlanInterfaces(whandle);\n\n\tif (ifList == NULL) {\n\t\tprintf(\"Error: Failed to find wlan interfaces.\\n\");\n\t\treturn 1;\n\t}\n\n\t\/\/ Print interfaces and exit\n\tif (task == TASK_LIST_INTERFACES) {\n\t\tfor (DWORD i = 0; i < ifList->dwNumberOfItems; i++) {\n\t\t\tPWLAN_INTERFACE_INFO info = (WLAN_INTERFACE_INFO *)&ifList->InterfaceInfo[i];\n\t\t\tprintf(\"% 2d %ws\\n\", i, info->strInterfaceDescription);\n\t\t}\n\t\tWlanFreeMemory(ifList);\n\t\treturn 0;\n\t}\n\n\t\/\/ Select the wlan interface\n\tGUID ifGuid;\n\tif (ifList->dwNumberOfItems == 0) {\n\t\tprintf(\"Error: No wlan interfaces exist.\\n\");\n\t\treturn 1;\n\t}\n\telse {\n\t\tif (ifSelect >= ifList->dwNumberOfItems) {\n\t\t\tprintf(\"Warning: Interface %d does not exist. Defaulting to interface 0.\\n\", ifSelect);\n\t\t\tifSelect = 0;\n\t\t}\n\t\tifGuid = ((WLAN_INTERFACE_INFO *)&ifList->InterfaceInfo[ifSelect])->InterfaceGuid;\n\t}\n\tWlanFreeMemory(ifList);\n\n\tif (task == TASK_SCAN_NETWORKS) {\n\t\t\/\/ Scan for network\n\t\tscanWifiNetworks(whandle, ifGuid);\n\t}\n\telse if (task == TASK_LIST_NETWORKS) {\n\t\t\/\/ List available networks\n\t\tstd::vector<NetworkInfo> networks = getWifiNetworks(whandle, ifGuid);\n\t\t\n\t\tfor (auto itr = networks.begin(); itr != networks.end(); itr++) {\n\t\t\t\/\/ Rssi\n\t\t\tprintf(\"%-4d \", (*itr).rssi);\n\t\t\t\/\/ Quality\n\t\t\tprintf(\"% 4d \", (*itr).quality);\n\t\t\t\/\/ Bssid\n\t\t\tfor (int i = 0; i < 6; i++) printf(\"%02x\", (*itr).bssid[i]) && (i<5) && printf(\"-\");\n\t\t\tprintf(\" \");\n\t\t\t\/\/ Ssid\n\t\t\tfor (int i = 0; i < 32; i++) printf(\"%c\", (*itr).ssid[i]);\n\t\t\tprintf(\"\\n\");\n\t\t}\n\t}\n\n\treturn 0;\n}\n<commit_msg>Cleaned up stray variables and output<commit_after>\/\/ windows-wlan-util.cpp : Defines the entry point for the console application.\n\/\/\n\n#include \"stdafx.h\"\n\n\/\/ Struct containing useful network info\nstruct NetworkInfo {\n\tUCHAR ssid[32];\n\tUCHAR bssid[32];\n\tULONG frequency;\n\tLONG rssi;\n\tULONG quality;\n};\n\n\/\/ Get a WLAN handle, necessary for all other operations\nHANDLE getWlanHandle() {\n\t\/\/ Result variable\n\tDWORD dwResult;\n\n\t\/\/ Maximum number of clients (?)\n\tDWORD dwMaxClient = 2;\n\t\/\/ Current version\n\tDWORD dwCurVersion;\n\n\t\/\/ Handle\n\tHANDLE hClient = NULL;\n\t\/\/ Open WLAN handle\n\tdwResult = WlanOpenHandle(dwMaxClient, NULL, &dwCurVersion, &hClient);\n\n\tif (dwResult != ERROR_SUCCESS) {\n\t\treturn NULL;\n\t}\n\telse {\n\t\treturn hClient;\n\t}\n}\n\n\/\/ Get a list of WLAN interfaces\nPWLAN_INTERFACE_INFO_LIST getWlanInterfaces(HANDLE whandle) {\n\tPWLAN_INTERFACE_INFO_LIST ifList = NULL;\n\tDWORD dwResult;\n\tdwResult = WlanEnumInterfaces(whandle, NULL, &ifList);\n\n\tif (dwResult != ERROR_SUCCESS) {\n\t\treturn NULL;\n\t}\n\telse {\n\t\treturn ifList;\n\t}\n}\n\n\/\/ Initiate a scan of Wifi Networks on the given interface\nboolean scanWifiNetworks(HANDLE hClient, GUID ifGuid) {\n\tDWORD dwResult;\n\tdwResult = WlanScan(hClient, &ifGuid, NULL, NULL, NULL);\n\tif (dwResult != ERROR_SUCCESS) {\n\t\treturn false;\n\t}\n\telse {\n\t\treturn true;\n\t}\n}\n\n\/\/ Get a list of Wifi Networks from the last scan\nstd::vector<NetworkInfo> getWifiNetworks(HANDLE hClient, GUID ifGuid) {\n\t\/\/ Return variable\n\tstd::vector<NetworkInfo> ns;\n\n\t\/\/ Result variable\n\tDWORD dwResult;\n\n\t\/\/ List of interfaces\n\tPWLAN_INTERFACE_INFO_LIST ifList = NULL;\n\t\/\/ Interface info\n\tPWLAN_INTERFACE_INFO ifInfo = NULL;\n\t\/\/ Service list\n\tPWLAN_BSS_LIST bssList = NULL;\n\t\/\/ Network service\n\tPWLAN_BSS_ENTRY bssEntry = NULL;\n\n\t\/\/ Retrieve a list of available networks\n\tdwResult = WlanGetNetworkBssList(hClient, &ifGuid, NULL, dot11_BSS_type_any, NULL, NULL, &bssList);\n\tif (dwResult != ERROR_SUCCESS) {\n\t}\n\telse {\n\t\t\/\/ For each network\n\t\tfor (unsigned int j = 0; j < bssList->dwNumberOfItems; j++) {\n\t\t\t\/\/ Grab the network\n\t\t\tbssEntry = (WLAN_BSS_ENTRY *)&bssList->wlanBssEntries[j];\n\n\t\t\t\/\/ Network info struct\n\t\t\tNetworkInfo ni;\n\t\t\t\/\/ SSID\n\t\t\tfor (int k = 0, l = bssEntry->dot11Ssid.uSSIDLength; k < 32; k++) {\n\t\t\t\tif (k < l) ni.ssid[k] = (int)bssEntry->dot11Ssid.ucSSID[k];\n\t\t\t\telse ni.ssid[k] = 0;\n\t\t\t}\n\t\t\t\/\/ Hardware MAC Address\n\t\t\tfor (int k = 0, l = 6; k < 32; k++) {\n\t\t\t\tif (k < l) ni.bssid[k] = (int)bssEntry->dot11Bssid[k];\n\t\t\t\telse ni.bssid[k] = 0;\n\t\t\t}\n\t\t\t\/\/ Channel Frequency\n\t\t\tni.frequency = bssEntry->ulChCenterFrequency;\n\t\t\t\/\/ Rssi\n\t\t\tni.rssi = bssEntry->lRssi;\n\t\t\t\/\/ Signal quality\n\t\t\tni.quality = bssEntry->uLinkQuality;\n\n\t\t\t\/\/ Add to the list\n\t\t\tns.push_back(ni);\n\t\t}\n\t}\n\n\t\/\/ Clean up\n\tif (bssList != NULL) {\n\t\tWlanFreeMemory(bssList);\n\t\tbssList = NULL;\n\t}\n\n\t\/\/ Finish\n\treturn ns;\n}\n\n\/\/ Print usage\nvoid usage(const char* name) {\n\tprintf(\"Usage: %s <task> [interface number]\\n\", name);\n}\n\n\/\/ Tasks\nconst int TASK_USAGE = 0;\nconst int TASK_LIST_INTERFACES = 1;\nconst int TASK_SCAN_NETWORKS = 2;\nconst int TASK_LIST_NETWORKS = 3;\n\n\/\/ Main program\nint main(int argc, char** argv)\n{\n\t\/\/ Parse arguments\n\tint task = 0;\n\tif (argc < 2) {\n\t\tusage(argv[0]);\n\t\treturn 2;\n\t}\n\t\/\/ Interface number\n\tDWORD ifSelect = 0;\n\n\t\/\/ Task\n\tif (argc >= 2) {\n\t\tif (strncmp(argv[1], \"if\", 2) == 0) {\n\t\t\ttask = TASK_LIST_INTERFACES;\n\t\t}\n\t\telse if (strncmp(argv[1], \"scan\", 4) == 0) {\n\t\t\ttask = TASK_SCAN_NETWORKS;\n\t\t}\n\t\telse if (strncmp(argv[1], \"list\", 4) == 0) {\n\t\t\ttask = TASK_LIST_NETWORKS;\n\t\t}\n\t}\n\n\t\/\/ Interface\n\tif (argc >= 3) {\n\t\tsscanf_s(argv[2], \"%d\", &ifSelect);\n\t}\n\n\t\/\/ Setup\n\tHANDLE whandle = getWlanHandle();\n\tstd::string input;\n\n\tif (whandle == NULL) {\n\t\tprintf(\"Error: Failed to open wlan handle.\\n\");\n\t\treturn 1;\n\t}\n\n\t\/\/ Print usage and exit\n\tif (task == TASK_USAGE) {\n\t\tusage(argv[0]);\n\t\treturn 2;\n\t}\n\n\t\/\/ Get interfaces\n\tPWLAN_INTERFACE_INFO_LIST ifList = NULL;\n\tifList = getWlanInterfaces(whandle);\n\n\tif (ifList == NULL) {\n\t\tprintf(\"Error: Failed to find wlan interfaces.\\n\");\n\t\treturn 1;\n\t}\n\n\t\/\/ Print interfaces and exit\n\tif (task == TASK_LIST_INTERFACES) {\n\t\tfor (DWORD i = 0; i < ifList->dwNumberOfItems; i++) {\n\t\t\tPWLAN_INTERFACE_INFO info = (WLAN_INTERFACE_INFO *)&ifList->InterfaceInfo[i];\n\t\t\tprintf(\"% 2d %ws\\n\", i, info->strInterfaceDescription);\n\t\t}\n\t\tWlanFreeMemory(ifList);\n\t\treturn 0;\n\t}\n\n\t\/\/ Select the wlan interface\n\tGUID ifGuid;\n\tif (ifList->dwNumberOfItems == 0) {\n\t\tprintf(\"Error: No wlan interfaces exist.\\n\");\n\t\treturn 1;\n\t}\n\telse {\n\t\tif (ifSelect >= ifList->dwNumberOfItems) {\n\t\t\t\/\/printf(\"Warning: Interface %d does not exist. Defaulting to interface 0.\\n\", ifSelect);\n\t\t\tifSelect = 0;\n\t\t}\n\t\tifGuid = ((WLAN_INTERFACE_INFO *)&ifList->InterfaceInfo[ifSelect])->InterfaceGuid;\n\t}\n\tWlanFreeMemory(ifList);\n\n\tif (task == TASK_SCAN_NETWORKS) {\n\t\t\/\/ Scan for network\n\t\tscanWifiNetworks(whandle, ifGuid);\n\t}\n\telse if (task == TASK_LIST_NETWORKS) {\n\t\t\/\/ List available networks\n\t\tstd::vector<NetworkInfo> networks = getWifiNetworks(whandle, ifGuid);\n\t\t\n\t\tfor (auto itr = networks.begin(); itr != networks.end(); itr++) {\n\t\t\t\/\/ Rssi\n\t\t\tprintf(\"% 4d \", (*itr).rssi);\n\t\t\t\/\/ Quality\n\t\t\tprintf(\"% 4d \", (*itr).quality);\n\t\t\t\/\/ Bssid\n\t\t\tfor (int i = 0; i < 6; i++) printf(\"%02x\", (*itr).bssid[i]) && (i<5) && printf(\":\");\n\t\t\tprintf(\" \");\n\t\t\t\/\/ Ssid\n\t\t\tfor (int i = 0; i < 32; i++) printf(\"%c\", (*itr).ssid[i]);\n\t\t\tprintf(\"\\n\");\n\t\t}\n\t}\n\n\treturn 0;\n}\n<|endoftext|>"} {"text":"<commit_before>2876cc30-2e4f-11e5-9284-b827eb9e62be<commit_msg>287bc3de-2e4f-11e5-9284-b827eb9e62be<commit_after>287bc3de-2e4f-11e5-9284-b827eb9e62be<|endoftext|>"} {"text":"<commit_before>b3325fb2-2e4d-11e5-9284-b827eb9e62be<commit_msg>b33750f8-2e4d-11e5-9284-b827eb9e62be<commit_after>b33750f8-2e4d-11e5-9284-b827eb9e62be<|endoftext|>"} {"text":"<commit_before>c0931934-2e4e-11e5-9284-b827eb9e62be<commit_msg>c09825e6-2e4e-11e5-9284-b827eb9e62be<commit_after>c09825e6-2e4e-11e5-9284-b827eb9e62be<|endoftext|>"} {"text":"<commit_before>#pragma once\n\nnamespace gcl::mp::meta\n{\n template <typename... Ts>\n struct join;\n template <typename first_type, typename second_type, typename... Ts>\n struct join<first_type, second_type, Ts...> {\n static_assert(sizeof...(Ts) not_eq 0);\n using type = typename join<typename join<first_type, second_type>::type, Ts...>::type;\n };\n template <typename T>\n struct join<T> {\n using type = T;\n };\n template <template <typename...> typename Type, typename... Ts, typename... Us>\n struct join<Type<Ts...>, Type<Us...>> {\n using type = Type<Ts..., Us...>;\n };\n\n template <typename... Ts>\n using join_t = typename join<Ts...>::type;\n}\n\n#include <tuple>\n\nnamespace gcl::mp::tests::meta\n{\n using namespace gcl::mp::meta;\n static_assert(std::is_same_v<std::tuple<int, char, double>, join_t<std::tuple<int>, std::tuple<char, double>>>);\n static_assert(std::is_same_v<std::tuple<int, char, double>, join_t<std::tuple<int, char, double>>>);\n static_assert(\n std::is_same_v<std::tuple<int, char, double>, join_t<std::tuple<int>, std::tuple<char>, std::tuple<double>>>);\n static_assert(std::is_same_v<\n std::tuple<int, char, double, float>,\n join_t<std::tuple<int>, std::tuple<char>, std::tuple<double>, std::tuple<float>>>);\n}<commit_msg>[mp::meta] : remote dependency to std::tuple for join_t<Ts...> ctc tests<commit_after>#pragma once\n\nnamespace gcl::mp::meta\n{\n template <typename... Ts>\n struct join;\n template <typename first_type, typename second_type, typename... Ts>\n struct join<first_type, second_type, Ts...> {\n static_assert(sizeof...(Ts) not_eq 0);\n using type = typename join<typename join<first_type, second_type>::type, Ts...>::type;\n };\n template <typename T>\n struct join<T> {\n using type = T;\n };\n template <template <typename...> typename Type, typename... Ts, typename... Us>\n struct join<Type<Ts...>, Type<Us...>> {\n using type = Type<Ts..., Us...>;\n };\n\n template <typename... Ts>\n using join_t = typename join<Ts...>::type;\n}\n\nnamespace gcl::mp::tests::meta\n{\n template <typename ... Ts>\n struct type_seq {};\n\n using namespace gcl::mp::meta;\n static_assert(std::is_same_v<type_seq<int, char, double>, join_t<type_seq<int>, type_seq<char, double>>>);\n static_assert(std::is_same_v<type_seq<int, char, double>, join_t<type_seq<int, char, double>>>);\n static_assert(\n std::is_same_v<type_seq<int, char, double>, join_t<type_seq<int>, type_seq<char>, type_seq<double>>>);\n static_assert(std::is_same_v<\n type_seq<int, char, double, float>,\n join_t<type_seq<int>, type_seq<char>, type_seq<double>, type_seq<float>>>);\n}<|endoftext|>"} {"text":"<commit_before>#ifndef SRC_SETTINGS_JSONFILE_SETTING_BACKEND_HPP_\n#define SRC_SETTINGS_JSONFILE_SETTING_BACKEND_HPP_\n\n#include <settings\/settings.hpp>\n#include <cereal\/archives\/json.hpp>\n\nnamespace fc\n{\n\nclass json_file_setting_facade\n{\npublic:\n\ttypedef cereal::JSONInputArchive json_archive;\n\n\t\/**\n\t * @brief Creates a setting facade that reads values from\n\t * stream using json format.\n\t *\n\t * @param stream The input stream containing the data in json syntax.\n\t * @throw ::cereal::Exception if the given @p stream cannot be parsed\n\t * by json parser, e.g. if syntax is wrong.\n\t *\/\n\tjson_file_setting_facade(std::istream& stream)\n\t\t: archive(stream)\n\t{\n\t}\n\n\ttemplate<class data_t, class setter_t>\n\tvoid register_setting(\n\t\t\tsetting_id id,\n\t\t\tdata_t initial_v,\n\t\t\tsetter_t setter) \/\/todo add constraint\n\t{\n\t\tauto value = initial_v;\n\t\ttry\n\t\t{\n\t\t\t\/\/tries to read value from json parser.\n\t\t\t\/\/the value remains unchanged if an error occurs.\n\t\t\tarchive(cereal::make_nvp(id.key, value));\n\t\t}\n\t\tcatch(const cereal::Exception& ex)\n\t\t{\n\t\t\tstd::cerr << \"json_file_setting_facade.register_setting():\"\n\t\t\t\t\t\" '\"\t<< ex.what() << \"'\" << std::endl;\n\t\t}\n\t\tsetter(value);\n\t}\n\n\t\/**\n\t * \\brief registers Setting together with region\n\t *\n\t * Region can be ignored in this case,\n\t * as parameters from json file don't change after loading.\n\t *\/\n\ttemplate<class data_t, class setter_t, class region_t>\n\tvoid register_setting(\n\t\t\tsetting_id id,\n\t\t\tdata_t initial_v,\n\t\t\tsetter_t setter,\n\t\t\tregion_t& \/*region*\/) \/\/todo add constraint\n\t{\n\t\tregister_setting(id, initial_v, setter);\n\t}\n\n\tjson_archive archive;\n};\n\n} \/\/ namespace fc\n\n#endif \/* SRC_SETTINGS_JSONFILE_SETTING_BACKEND_HPP_ *\/\n<commit_msg>make exception message more usable by hinting for probable cause of exception in jsonfile_setting_backend.hpp<commit_after>#ifndef SRC_SETTINGS_JSONFILE_SETTING_BACKEND_HPP_\n#define SRC_SETTINGS_JSONFILE_SETTING_BACKEND_HPP_\n\n#include <settings\/settings.hpp>\n#include <cereal\/archives\/json.hpp>\n\nnamespace fc\n{\n\nclass json_file_setting_facade\n{\npublic:\n\ttypedef cereal::JSONInputArchive json_archive;\n\n\t\/**\n\t * @brief Creates a setting facade that reads values from\n\t * stream using json format.\n\t *\n\t * @param stream The input stream containing the data in json syntax.\n\t * @throw ::cereal::Exception if the given @p stream cannot be parsed\n\t * by json parser, e.g. if syntax is wrong.\n\t *\/\n\tjson_file_setting_facade(std::istream& stream)\n\t\ttry : archive(stream)\n\t{\n\t}\n\tcatch (const ::cereal::Exception& ex)\n\t{\n\t\tthrow ::cereal::Exception(std::string(ex.what())\n\t\t\t\t+ \". you should check for json syntax errors.\");\n\t}\n\n\ttemplate<class data_t, class setter_t>\n\tvoid register_setting(\n\t\t\tsetting_id id,\n\t\t\tdata_t initial_v,\n\t\t\tsetter_t setter) \/\/todo add constraint\n\t{\n\t\tauto value = initial_v;\n\t\ttry\n\t\t{\n\t\t\t\/\/tries to read value from json parser.\n\t\t\t\/\/the value remains unchanged if an error occurs.\n\t\t\tarchive(cereal::make_nvp(id.key, value));\n\t\t}\n\t\tcatch(const cereal::Exception& ex)\n\t\t{\n\t\t\tstd::cerr << \"json_file_setting_facade.register_setting():\"\n\t\t\t\t\t\" '\"\t<< ex.what() << \"'\" << std::endl;\n\t\t}\n\t\tsetter(value);\n\t}\n\n\t\/**\n\t * \\brief registers Setting together with region\n\t *\n\t * Region can be ignored in this case,\n\t * as parameters from json file don't change after loading.\n\t *\/\n\ttemplate<class data_t, class setter_t, class region_t>\n\tvoid register_setting(\n\t\t\tsetting_id id,\n\t\t\tdata_t initial_v,\n\t\t\tsetter_t setter,\n\t\t\tregion_t& \/*region*\/) \/\/todo add constraint\n\t{\n\t\tregister_setting(id, initial_v, setter);\n\t}\n\n\tjson_archive archive;\n};\n\n} \/\/ namespace fc\n\n#endif \/* SRC_SETTINGS_JSONFILE_SETTING_BACKEND_HPP_ *\/\n<|endoftext|>"} {"text":"<commit_before>\/* Copyright 2015 The TensorFlow Authors. All Rights Reserved.\n\nLicensed under the Apache License, Version 2.0 (the \"License\");\nyou may not use this file except in compliance with the License.\nYou may obtain a copy of the License at\n\n http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n\nUnless required by applicable law or agreed to in writing, software\ndistributed under the License is distributed on an \"AS IS\" BASIS,\nWITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\nSee the License for the specific language governing permissions and\nlimitations under the License.\n==============================================================================*\/\n\n#include \"tensorflow\/core\/common_runtime\/kernel_benchmark_testlib.h\"\n\n#include <vector>\n#include \"tensorflow\/core\/common_runtime\/device.h\"\n#include \"tensorflow\/core\/common_runtime\/device_factory.h\"\n#include \"tensorflow\/core\/common_runtime\/executor_factory.h\"\n#include \"tensorflow\/core\/common_runtime\/local_device.h\"\n#include \"tensorflow\/core\/framework\/op.h\"\n#include \"tensorflow\/core\/framework\/op_kernel.h\"\n#include \"tensorflow\/core\/framework\/op_segment.h\"\n#include \"tensorflow\/core\/framework\/versions.pb.h\"\n#include \"tensorflow\/core\/graph\/graph.h\"\n#include \"tensorflow\/core\/kernels\/ops_util.h\"\n#include \"tensorflow\/core\/lib\/core\/notification.h\"\n#include \"tensorflow\/core\/lib\/core\/threadpool.h\"\n#include \"tensorflow\/core\/lib\/strings\/str_util.h\"\n#include \"tensorflow\/core\/platform\/byte_order.h\"\n#include \"tensorflow\/core\/platform\/cpu_info.h\"\n#include \"tensorflow\/core\/platform\/logging.h\"\n#include \"tensorflow\/core\/platform\/test_benchmark.h\"\n#include \"tensorflow\/core\/platform\/types.h\"\n#include \"tensorflow\/core\/public\/session_options.h\"\n#include \"tensorflow\/core\/public\/version.h\"\n#include \"tensorflow\/core\/util\/device_name_utils.h\"\n\nnamespace tensorflow {\nnamespace test {\n\n\/\/ TODO(hongm): Convert `g` and `init` to using std::unique_ptr.\nBenchmark::Benchmark(const string& device, Graph* g,\n const SessionOptions* options, Graph* init,\n Rendezvous* rendez, const char* executor_type) {\n SessionOptions default_options;\n if (!options) {\n options = &default_options;\n }\n\n testing::StopTiming();\n string t = absl::AsciiStrToUpper(device);\n \/\/ Allow NewDevice to allocate a new threadpool with different number of\n \/\/ threads for each new benchmark.\n LocalDevice::set_use_global_threadpool(false);\n device_ =\n DeviceFactory::NewDevice(t, *options, \"\/job:localhost\/replica:0\/task:0\");\n CHECK(device_) << \"Could not create a \" << device << \" device\";\n\n pool_ =\n new thread::ThreadPool(options->env, \"blocking\", port::MaxParallelism());\n\n auto runner = [this](std::function<void()> closure) {\n pool_->Schedule(closure);\n };\n\n if (rendez == nullptr) {\n rendez_ = NewLocalRendezvous();\n } else {\n rendez_ = rendez;\n }\n\n const int graph_def_version = g->versions().producer();\n\n LocalExecutorParams params;\n params.device = device_.get();\n params.function_library = nullptr;\n params.create_kernel = [this, graph_def_version](const NodeDef& ndef,\n OpKernel** kernel) {\n return CreateNonCachedKernel(device_.get(), nullptr, ndef,\n graph_def_version, kernel);\n };\n params.delete_kernel = [](OpKernel* kernel) {\n DeleteNonCachedKernel(kernel);\n };\n\n if (init) {\n std::unique_ptr<Executor> init_exec;\n TF_CHECK_OK(NewExecutor(executor_type, params, *init, &init_exec));\n Executor::Args args;\n args.rendezvous = rendez_;\n args.runner = runner;\n TF_CHECK_OK(init_exec->Run(args));\n }\n\n TF_CHECK_OK(NewExecutor(executor_type, params, *g, &exec_));\n}\n\nBenchmark::~Benchmark() {\n if (device_) {\n rendez_->Unref();\n \/\/ We delete `exec_` before `device_` because the `exec_` destructor may\n \/\/ run kernel destructors that may attempt to access state borrowed from\n \/\/ `device_`, such as the resource manager.\n exec_.reset();\n device_.reset();\n delete pool_;\n }\n}\n\nvoid Benchmark::Run(int iters) { RunWithArgs({}, {}, iters); }\n\nstring GetRendezvousKey(const Node* node) {\n string send_device;\n TF_CHECK_OK(GetNodeAttr(node->attrs(), \"send_device\", &send_device));\n string recv_device;\n TF_CHECK_OK(GetNodeAttr(node->attrs(), \"recv_device\", &recv_device));\n string tensor_name;\n TF_CHECK_OK(GetNodeAttr(node->attrs(), \"tensor_name\", &tensor_name));\n uint64 send_device_incarnation;\n TF_CHECK_OK(GetNodeAttr(node->attrs(), \"send_device_incarnation\",\n reinterpret_cast<int64*>(&send_device_incarnation)));\n return Rendezvous::CreateKey(send_device, send_device_incarnation,\n recv_device, tensor_name, FrameAndIter(0, 0));\n}\n\nvoid Benchmark::RunWithArgs(\n const std::vector<std::pair<const Node*, Tensor>>& inputs,\n const std::vector<const Node*>& outputs, int iters) {\n if (!device_ || iters == 0) {\n return;\n }\n \/\/ Gets inputs' and outputs' rendezvous keys.\n std::vector<std::pair<string, Tensor>> in;\n in.reserve(inputs.size());\n for (const auto& p : inputs) {\n in.push_back({GetRendezvousKey(p.first), p.second});\n }\n std::vector<string> out;\n out.reserve(outputs.size());\n for (const auto& n : outputs) {\n out.push_back(GetRendezvousKey(n));\n }\n Tensor unused; \/\/ In benchmark, we don't care the return value.\n bool is_dead;\n\n \/\/ Warm up\n Executor::Args args;\n args.rendezvous = rendez_;\n args.runner = [this](std::function<void()> closure) {\n pool_->Schedule(closure);\n };\n static const int kWarmupRuns = 3;\n for (int i = 0; i < kWarmupRuns; ++i) {\n for (const auto& p : in) {\n Rendezvous::ParsedKey parsed;\n TF_CHECK_OK(Rendezvous::ParseKey(p.first, &parsed));\n TF_CHECK_OK(rendez_->Send(parsed, Rendezvous::Args(), p.second, false));\n }\n TF_CHECK_OK(exec_->Run(args));\n for (const string& key : out) {\n Rendezvous::ParsedKey parsed;\n TF_CHECK_OK(Rendezvous::ParseKey(key, &parsed));\n TF_CHECK_OK(rendez_->Recv(parsed, Rendezvous::Args(), &unused, &is_dead));\n }\n }\n TF_CHECK_OK(device_->Sync());\n VLOG(3) << kWarmupRuns << \" warmup runs done.\";\n\n testing::StartTiming();\n while (iters-- > 0) {\n for (const auto& p : in) {\n Rendezvous::ParsedKey parsed;\n TF_CHECK_OK(Rendezvous::ParseKey(p.first, &parsed));\n TF_CHECK_OK(rendez_->Send(parsed, Rendezvous::Args(), p.second, false));\n }\n TF_CHECK_OK(exec_->Run(args));\n for (const string& key : out) {\n Rendezvous::ParsedKey parsed;\n TF_CHECK_OK(Rendezvous::ParseKey(key, &parsed));\n TF_CHECK_OK(rendez_->Recv(parsed, Rendezvous::Args(), &unused, &is_dead));\n }\n }\n\n TF_CHECK_OK(device_->Sync());\n testing::StopTiming();\n}\n\n} \/\/ end namespace test\n} \/\/ end namespace tensorflow\n<commit_msg>Fix memory leak of Graph objects in test::benchmark.<commit_after>\/* Copyright 2015 The TensorFlow Authors. All Rights Reserved.\n\nLicensed under the Apache License, Version 2.0 (the \"License\");\nyou may not use this file except in compliance with the License.\nYou may obtain a copy of the License at\n\n http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n\nUnless required by applicable law or agreed to in writing, software\ndistributed under the License is distributed on an \"AS IS\" BASIS,\nWITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\nSee the License for the specific language governing permissions and\nlimitations under the License.\n==============================================================================*\/\n\n#include \"tensorflow\/core\/common_runtime\/kernel_benchmark_testlib.h\"\n\n#include <vector>\n\n#include \"tensorflow\/core\/common_runtime\/device.h\"\n#include \"tensorflow\/core\/common_runtime\/device_factory.h\"\n#include \"tensorflow\/core\/common_runtime\/executor_factory.h\"\n#include \"tensorflow\/core\/common_runtime\/local_device.h\"\n#include \"tensorflow\/core\/framework\/op.h\"\n#include \"tensorflow\/core\/framework\/op_kernel.h\"\n#include \"tensorflow\/core\/framework\/op_segment.h\"\n#include \"tensorflow\/core\/framework\/versions.pb.h\"\n#include \"tensorflow\/core\/graph\/graph.h\"\n#include \"tensorflow\/core\/kernels\/ops_util.h\"\n#include \"tensorflow\/core\/lib\/core\/notification.h\"\n#include \"tensorflow\/core\/lib\/core\/threadpool.h\"\n#include \"tensorflow\/core\/lib\/gtl\/cleanup.h\"\n#include \"tensorflow\/core\/lib\/strings\/str_util.h\"\n#include \"tensorflow\/core\/platform\/byte_order.h\"\n#include \"tensorflow\/core\/platform\/cpu_info.h\"\n#include \"tensorflow\/core\/platform\/logging.h\"\n#include \"tensorflow\/core\/platform\/test_benchmark.h\"\n#include \"tensorflow\/core\/platform\/types.h\"\n#include \"tensorflow\/core\/public\/session_options.h\"\n#include \"tensorflow\/core\/public\/version.h\"\n#include \"tensorflow\/core\/util\/device_name_utils.h\"\n\nnamespace tensorflow {\nnamespace test {\n\n\/\/ TODO(hongm): Convert `g` and `init` to using std::unique_ptr.\nBenchmark::Benchmark(const string& device, Graph* g,\n const SessionOptions* options, Graph* init,\n Rendezvous* rendez, const char* executor_type) {\n auto cleanup = gtl::MakeCleanup([g, init]() {\n delete g;\n delete init;\n });\n\n SessionOptions default_options;\n if (!options) {\n options = &default_options;\n }\n\n testing::StopTiming();\n string t = absl::AsciiStrToUpper(device);\n \/\/ Allow NewDevice to allocate a new threadpool with different number of\n \/\/ threads for each new benchmark.\n LocalDevice::set_use_global_threadpool(false);\n device_ =\n DeviceFactory::NewDevice(t, *options, \"\/job:localhost\/replica:0\/task:0\");\n CHECK(device_) << \"Could not create a \" << device << \" device\";\n\n pool_ =\n new thread::ThreadPool(options->env, \"blocking\", port::MaxParallelism());\n\n auto runner = [this](std::function<void()> closure) {\n pool_->Schedule(closure);\n };\n\n if (rendez == nullptr) {\n rendez_ = NewLocalRendezvous();\n } else {\n rendez_ = rendez;\n }\n\n const int graph_def_version = g->versions().producer();\n\n LocalExecutorParams params;\n params.device = device_.get();\n params.function_library = nullptr;\n params.create_kernel = [this, graph_def_version](const NodeDef& ndef,\n OpKernel** kernel) {\n return CreateNonCachedKernel(device_.get(), nullptr, ndef,\n graph_def_version, kernel);\n };\n params.delete_kernel = [](OpKernel* kernel) {\n DeleteNonCachedKernel(kernel);\n };\n\n if (init) {\n std::unique_ptr<Executor> init_exec;\n TF_CHECK_OK(NewExecutor(executor_type, params, *init, &init_exec));\n Executor::Args args;\n args.rendezvous = rendez_;\n args.runner = runner;\n TF_CHECK_OK(init_exec->Run(args));\n }\n\n TF_CHECK_OK(NewExecutor(executor_type, params, *g, &exec_));\n}\n\nBenchmark::~Benchmark() {\n if (device_) {\n rendez_->Unref();\n \/\/ We delete `exec_` before `device_` because the `exec_` destructor may\n \/\/ run kernel destructors that may attempt to access state borrowed from\n \/\/ `device_`, such as the resource manager.\n exec_.reset();\n device_.reset();\n delete pool_;\n }\n}\n\nvoid Benchmark::Run(int iters) { RunWithArgs({}, {}, iters); }\n\nstring GetRendezvousKey(const Node* node) {\n string send_device;\n TF_CHECK_OK(GetNodeAttr(node->attrs(), \"send_device\", &send_device));\n string recv_device;\n TF_CHECK_OK(GetNodeAttr(node->attrs(), \"recv_device\", &recv_device));\n string tensor_name;\n TF_CHECK_OK(GetNodeAttr(node->attrs(), \"tensor_name\", &tensor_name));\n uint64 send_device_incarnation;\n TF_CHECK_OK(GetNodeAttr(node->attrs(), \"send_device_incarnation\",\n reinterpret_cast<int64*>(&send_device_incarnation)));\n return Rendezvous::CreateKey(send_device, send_device_incarnation,\n recv_device, tensor_name, FrameAndIter(0, 0));\n}\n\nvoid Benchmark::RunWithArgs(\n const std::vector<std::pair<const Node*, Tensor>>& inputs,\n const std::vector<const Node*>& outputs, int iters) {\n if (!device_ || iters == 0) {\n return;\n }\n \/\/ Gets inputs' and outputs' rendezvous keys.\n std::vector<std::pair<string, Tensor>> in;\n in.reserve(inputs.size());\n for (const auto& p : inputs) {\n in.push_back({GetRendezvousKey(p.first), p.second});\n }\n std::vector<string> out;\n out.reserve(outputs.size());\n for (const auto& n : outputs) {\n out.push_back(GetRendezvousKey(n));\n }\n Tensor unused; \/\/ In benchmark, we don't care the return value.\n bool is_dead;\n\n \/\/ Warm up\n Executor::Args args;\n args.rendezvous = rendez_;\n args.runner = [this](std::function<void()> closure) {\n pool_->Schedule(closure);\n };\n static const int kWarmupRuns = 3;\n for (int i = 0; i < kWarmupRuns; ++i) {\n for (const auto& p : in) {\n Rendezvous::ParsedKey parsed;\n TF_CHECK_OK(Rendezvous::ParseKey(p.first, &parsed));\n TF_CHECK_OK(rendez_->Send(parsed, Rendezvous::Args(), p.second, false));\n }\n TF_CHECK_OK(exec_->Run(args));\n for (const string& key : out) {\n Rendezvous::ParsedKey parsed;\n TF_CHECK_OK(Rendezvous::ParseKey(key, &parsed));\n TF_CHECK_OK(rendez_->Recv(parsed, Rendezvous::Args(), &unused, &is_dead));\n }\n }\n TF_CHECK_OK(device_->Sync());\n VLOG(3) << kWarmupRuns << \" warmup runs done.\";\n\n testing::StartTiming();\n while (iters-- > 0) {\n for (const auto& p : in) {\n Rendezvous::ParsedKey parsed;\n TF_CHECK_OK(Rendezvous::ParseKey(p.first, &parsed));\n TF_CHECK_OK(rendez_->Send(parsed, Rendezvous::Args(), p.second, false));\n }\n TF_CHECK_OK(exec_->Run(args));\n for (const string& key : out) {\n Rendezvous::ParsedKey parsed;\n TF_CHECK_OK(Rendezvous::ParseKey(key, &parsed));\n TF_CHECK_OK(rendez_->Recv(parsed, Rendezvous::Args(), &unused, &is_dead));\n }\n }\n\n TF_CHECK_OK(device_->Sync());\n testing::StopTiming();\n}\n\n} \/\/ end namespace test\n} \/\/ end namespace tensorflow\n<|endoftext|>"} {"text":"<commit_before>1b4ef668-2e4f-11e5-9284-b827eb9e62be<commit_msg>1b540414-2e4f-11e5-9284-b827eb9e62be<commit_after>1b540414-2e4f-11e5-9284-b827eb9e62be<|endoftext|>"} {"text":"<commit_before>50dbcece-2e4e-11e5-9284-b827eb9e62be<commit_msg>50e10b82-2e4e-11e5-9284-b827eb9e62be<commit_after>50e10b82-2e4e-11e5-9284-b827eb9e62be<|endoftext|>"} {"text":"<commit_before>#ifdef HAVE_EIGEN3\n\n#include <shogun\/mathematics\/ajd\/JADiagOrth.h>\n\n#include <shogun\/base\/init.h>\n\n#include <shogun\/mathematics\/Math.h>\n#include <shogun\/mathematics\/eigen3.h>\n\nusing namespace Eigen;\n\ntypedef Matrix< float64_t, Dynamic, 1, ColMajor > EVector;\ntypedef Matrix< float64_t, Dynamic, Dynamic, ColMajor > EMatrix;\n\nusing namespace shogun;\n\ndouble givens_stack(double *A, int M, int K, int p, int q);\nvoid LeftRotStack(double *A, int M, int N, int K, int p, int q, double c, double s);\nvoid RightRotStack(double *A, int M, int N, int K, int p, int q, double c, double s);\nvoid LeftRotSimple(double *A, int m, int n, int p, int q, double c, double s);\n\nSGMatrix<float64_t> CJADiagOrth::diagonalize(SGNDArray<float64_t> &C, SGMatrix<float64_t> V0,\n\t\t\t\t\t\tdouble eps, int itermax)\n{\n\tint m = C.dims[0];\n\tint L = C.dims[2];\t\n\n\tSGMatrix<float64_t> V;\n\tif (V0.num_rows != 0)\n\t{\n\t\tV = V0.clone();\n\t}\n\telse\n\t{\t\t\t\t\t\n\t\tV = SGMatrix<float64_t>::create_identity_matrix(m,1);\n\t}\n\n\tbool more = true;\n\tint rots = 0;\n\n\twhile (more)\n\t{\n more = false;\n\n for (int p = 0; p < m; p++)\n {\n for (int q = p+1; q < m; q++)\n {\n \/\/ computation of Givens angle\n double theta = givens_stack(C.array, m, L, p, q);\n\n \/\/ Givens update\n if (fabs(theta) > eps)\n { \n double c = cos(theta);\n double s = sin(theta);\n LeftRotStack (C.array, m, m, L, p, q, c, s); \n\t RightRotStack(C.array, m, m, L, p, q, c, s); \n\t LeftRotSimple(V.matrix, m, m, p, q, c, s);\n rots++;\n more = true;\n }\n }\n } \n\t}\n\t\n return V;\n}\n\n\/* Givens angle for the pair (p,q) of a stack of K M*M matrices *\/\ndouble givens_stack(double *A, int M, int K, int p, int q)\n{\n int k;\n double diff_on, sum_off, ton, toff;\n double *cm; \/\/ A cumulant matrix\n double G11 = 0.0;\n double G12 = 0.0;\n double G22 = 0.0;\n\n int M2 = M*M;\n int pp = p+p*M;\n int pq = p+q*M;\n int qp = q+p*M;\n int qq = q+q*M;\n\n for (k=0, cm=A; k<K; k++, cm+=M2) \n {\n diff_on = cm[pp] - cm[qq];\n sum_off = cm[pq] + cm[qp];\n\n G11 += diff_on * diff_on;\n G22 += sum_off * sum_off;\n G12 += diff_on * sum_off;\n }\n \n ton = G11 - G22;\n toff = 2.0 * G12;\n\n return -0.5 * atan2 ( toff , ton+sqrt(ton*ton+toff*toff) );\n}\n\n\/* \n Ak(mxn) --> R * Ak(mxn) where R rotates the (p,q) rows R =[ c -s ; s c ] \n and Ak is the k-th matrix in the stack\n*\/\nvoid LeftRotStack(double *A, int M, int N, int K, int p, int q, double c, double s )\n{\n int k, ix, iy, cpt;\n int MN = M*N;\n int kMN;\n double nx, ny;\n\n for (k=0, kMN=0; k<K; k++, kMN+=MN)\n {\n for (cpt=0, ix=p+kMN, iy=q+kMN; cpt<N; cpt++, ix+=M, iy+=M) \n {\n nx = A[ix];\n ny = A[iy];\n A[ix] = c*nx - s*ny;\n A[iy] = s*nx + c*ny;\n }\n }\n}\n\n\/* Ak(mxn) --> Ak(mxn) x R where R rotates the (p,q) columns R =[ c s ; -s c ] \n and Ak is the k-th M*N matrix in the stack *\/\nvoid RightRotStack(double *A, int M, int N, int K, int p, int q, double c, double s ) \n{ \n int k, ix, iy, cpt, kMN; \n int pM = p*M;\n int qM = q*M;\n double nx, ny; \n\n for (k=0, kMN=0; k<K; k++, kMN+=M*N)\n {\n for (cpt=0, ix=pM+kMN, iy=qM+kMN; cpt<M; cpt++) \n { \n nx = A[ix]; \n ny = A[iy]; \n A[ix++] = c*nx - s*ny; \n A[iy++] = s*nx + c*ny; \n } \n }\n}\n\n\/* \n A(mxn) --> R * A(mxn) where R=[ c -s ; s c ] rotates the (p,q) rows of R \n*\/\nvoid LeftRotSimple(double *A, int m, int n, int p, int q, double c, double s)\n{\n int ix = p;\n int iy = q;\n double nx, ny;\n int j;\n\n for (j=0; j<n; j++, ix+=m, iy+=m) \n {\n nx = A[ix];\n ny = A[iy];\n A[ix] = c*nx - s*ny;\n A[iy] = s*nx + c*ny;\n }\n}\n#endif \/\/HAVE_EIGEN3\n<commit_msg>renamed JADiagOrth inner functions<commit_after>#ifdef HAVE_EIGEN3\n\n#include <shogun\/mathematics\/ajd\/JADiagOrth.h>\n\n#include <shogun\/base\/init.h>\n\n#include <shogun\/mathematics\/Math.h>\n#include <shogun\/mathematics\/eigen3.h>\n\nusing namespace Eigen;\n\ntypedef Matrix< float64_t, Dynamic, 1, ColMajor > EVector;\ntypedef Matrix< float64_t, Dynamic, Dynamic, ColMajor > EMatrix;\n\nusing namespace shogun;\n\ndouble givens_stack(double *A, int M, int K, int p, int q);\nvoid left_rot_stack(double *A, int M, int N, int K, int p, int q, double c, double s);\nvoid right_rot_stack(double *A, int M, int N, int K, int p, int q, double c, double s);\nvoid left_rot_simple(double *A, int m, int n, int p, int q, double c, double s);\n\nSGMatrix<float64_t> CJADiagOrth::diagonalize(SGNDArray<float64_t> &C, SGMatrix<float64_t> V0,\n\t\t\t\t\t\tdouble eps, int itermax)\n{\n\tint m = C.dims[0];\n\tint L = C.dims[2];\t\n\n\tSGMatrix<float64_t> V;\n\tif (V0.num_rows != 0)\n\t{\n\t\tV = V0.clone();\n\t}\n\telse\n\t{\t\t\t\t\t\n\t\tV = SGMatrix<float64_t>::create_identity_matrix(m,1);\n\t}\n\n\tbool more = true;\n\tint rots = 0;\n\n\twhile (more)\n\t{\n more = false;\n\n for (int p = 0; p < m; p++)\n {\n for (int q = p+1; q < m; q++)\n {\n \/\/ computation of Givens angle\n double theta = givens_stack(C.array, m, L, p, q);\n\n \/\/ Givens update\n if (fabs(theta) > eps)\n { \n double c = cos(theta);\n double s = sin(theta);\n left_rot_stack (C.array, m, m, L, p, q, c, s); \n\t right_rot_stack(C.array, m, m, L, p, q, c, s); \n\t left_rot_simple(V.matrix, m, m, p, q, c, s);\n rots++;\n more = true;\n }\n }\n } \n\t}\n\t\n return V;\n}\n\n\/* Givens angle for the pair (p,q) of a stack of K M*M matrices *\/\ndouble givens_stack(double *A, int M, int K, int p, int q)\n{\n int k;\n double diff_on, sum_off, ton, toff;\n double *cm; \/\/ A cumulant matrix\n double G11 = 0.0;\n double G12 = 0.0;\n double G22 = 0.0;\n\n int M2 = M*M;\n int pp = p+p*M;\n int pq = p+q*M;\n int qp = q+p*M;\n int qq = q+q*M;\n\n for (k=0, cm=A; k<K; k++, cm+=M2) \n {\n diff_on = cm[pp] - cm[qq];\n sum_off = cm[pq] + cm[qp];\n\n G11 += diff_on * diff_on;\n G22 += sum_off * sum_off;\n G12 += diff_on * sum_off;\n }\n \n ton = G11 - G22;\n toff = 2.0 * G12;\n\n return -0.5 * atan2 ( toff , ton+sqrt(ton*ton+toff*toff) );\n}\n\n\/* \n Ak(mxn) --> R * Ak(mxn) where R rotates the (p,q) rows R =[ c -s ; s c ] \n and Ak is the k-th matrix in the stack\n*\/\nvoid left_rot_stack(double *A, int M, int N, int K, int p, int q, double c, double s )\n{\n int k, ix, iy, cpt;\n int MN = M*N;\n int kMN;\n double nx, ny;\n\n for (k=0, kMN=0; k<K; k++, kMN+=MN)\n {\n for (cpt=0, ix=p+kMN, iy=q+kMN; cpt<N; cpt++, ix+=M, iy+=M) \n {\n nx = A[ix];\n ny = A[iy];\n A[ix] = c*nx - s*ny;\n A[iy] = s*nx + c*ny;\n }\n }\n}\n\n\/* Ak(mxn) --> Ak(mxn) x R where R rotates the (p,q) columns R =[ c s ; -s c ] \n and Ak is the k-th M*N matrix in the stack *\/\nvoid right_rot_stack(double *A, int M, int N, int K, int p, int q, double c, double s ) \n{ \n int k, ix, iy, cpt, kMN; \n int pM = p*M;\n int qM = q*M;\n double nx, ny; \n\n for (k=0, kMN=0; k<K; k++, kMN+=M*N)\n {\n for (cpt=0, ix=pM+kMN, iy=qM+kMN; cpt<M; cpt++) \n { \n nx = A[ix]; \n ny = A[iy]; \n A[ix++] = c*nx - s*ny; \n A[iy++] = s*nx + c*ny; \n } \n }\n}\n\n\/* \n A(mxn) --> R * A(mxn) where R=[ c -s ; s c ] rotates the (p,q) rows of R \n*\/\nvoid left_rot_simple(double *A, int m, int n, int p, int q, double c, double s)\n{\n int ix = p;\n int iy = q;\n double nx, ny;\n int j;\n\n for (j=0; j<n; j++, ix+=m, iy+=m) \n {\n nx = A[ix];\n ny = A[iy];\n A[ix] = c*nx - s*ny;\n A[iy] = s*nx + c*ny;\n }\n}\n#endif \/\/HAVE_EIGEN3\n<|endoftext|>"} {"text":"<commit_before>b136a75e-2e4d-11e5-9284-b827eb9e62be<commit_msg>b13ba768-2e4d-11e5-9284-b827eb9e62be<commit_after>b13ba768-2e4d-11e5-9284-b827eb9e62be<|endoftext|>"} {"text":"<commit_before>a9ae051e-2e4c-11e5-9284-b827eb9e62be<commit_msg>a9b2f0ce-2e4c-11e5-9284-b827eb9e62be<commit_after>a9b2f0ce-2e4c-11e5-9284-b827eb9e62be<|endoftext|>"} {"text":"<commit_before>c20ea0d0-2e4e-11e5-9284-b827eb9e62be<commit_msg>c2139d4c-2e4e-11e5-9284-b827eb9e62be<commit_after>c2139d4c-2e4e-11e5-9284-b827eb9e62be<|endoftext|>"} {"text":"<commit_before>cff87e2a-2e4c-11e5-9284-b827eb9e62be<commit_msg>cffd8564-2e4c-11e5-9284-b827eb9e62be<commit_after>cffd8564-2e4c-11e5-9284-b827eb9e62be<|endoftext|>"} {"text":"<commit_before>fbc221dc-2e4c-11e5-9284-b827eb9e62be<commit_msg>fbc714b2-2e4c-11e5-9284-b827eb9e62be<commit_after>fbc714b2-2e4c-11e5-9284-b827eb9e62be<|endoftext|>"} {"text":"<commit_before>ad1f2e66-2e4d-11e5-9284-b827eb9e62be<commit_msg>ad242ac4-2e4d-11e5-9284-b827eb9e62be<commit_after>ad242ac4-2e4d-11e5-9284-b827eb9e62be<|endoftext|>"} {"text":"<commit_before>13c3d3a0-2e4f-11e5-9284-b827eb9e62be<commit_msg>13c8f11e-2e4f-11e5-9284-b827eb9e62be<commit_after>13c8f11e-2e4f-11e5-9284-b827eb9e62be<|endoftext|>"} {"text":"<commit_before>cdc8834c-2e4d-11e5-9284-b827eb9e62be<commit_msg>cdcd8162-2e4d-11e5-9284-b827eb9e62be<commit_after>cdcd8162-2e4d-11e5-9284-b827eb9e62be<|endoftext|>"} {"text":"<commit_before>c3f1e756-2e4c-11e5-9284-b827eb9e62be<commit_msg>c3f6eada-2e4c-11e5-9284-b827eb9e62be<commit_after>c3f6eada-2e4c-11e5-9284-b827eb9e62be<|endoftext|>"} {"text":"<commit_before>7084e404-2e4e-11e5-9284-b827eb9e62be<commit_msg>7089f6d8-2e4e-11e5-9284-b827eb9e62be<commit_after>7089f6d8-2e4e-11e5-9284-b827eb9e62be<|endoftext|>"} {"text":"<commit_before>81cec734-2e4e-11e5-9284-b827eb9e62be<commit_msg>81d3c946-2e4e-11e5-9284-b827eb9e62be<commit_after>81d3c946-2e4e-11e5-9284-b827eb9e62be<|endoftext|>"} {"text":"<commit_before>d2a0fab6-2e4d-11e5-9284-b827eb9e62be<commit_msg>d2a614ba-2e4d-11e5-9284-b827eb9e62be<commit_after>d2a614ba-2e4d-11e5-9284-b827eb9e62be<|endoftext|>"} {"text":"<commit_before>5e1eef2c-2e4d-11e5-9284-b827eb9e62be<commit_msg>5e23f2f6-2e4d-11e5-9284-b827eb9e62be<commit_after>5e23f2f6-2e4d-11e5-9284-b827eb9e62be<|endoftext|>"} {"text":"<commit_before>e7ef971e-2e4e-11e5-9284-b827eb9e62be<commit_msg>e7f4c248-2e4e-11e5-9284-b827eb9e62be<commit_after>e7f4c248-2e4e-11e5-9284-b827eb9e62be<|endoftext|>"} {"text":"<commit_before>de1cbc36-2e4d-11e5-9284-b827eb9e62be<commit_msg>de21cd66-2e4d-11e5-9284-b827eb9e62be<commit_after>de21cd66-2e4d-11e5-9284-b827eb9e62be<|endoftext|>"} {"text":"<commit_before>d54022fc-2e4c-11e5-9284-b827eb9e62be<commit_msg>d5452da6-2e4c-11e5-9284-b827eb9e62be<commit_after>d5452da6-2e4c-11e5-9284-b827eb9e62be<|endoftext|>"} {"text":"<commit_before>a2f72b1e-2e4d-11e5-9284-b827eb9e62be<commit_msg>a2fc6c5a-2e4d-11e5-9284-b827eb9e62be<commit_after>a2fc6c5a-2e4d-11e5-9284-b827eb9e62be<|endoftext|>"} {"text":"<commit_before>44c21f8a-2e4e-11e5-9284-b827eb9e62be<commit_msg>44c72ab6-2e4e-11e5-9284-b827eb9e62be<commit_after>44c72ab6-2e4e-11e5-9284-b827eb9e62be<|endoftext|>"} {"text":"<commit_before>ba7f6608-2e4c-11e5-9284-b827eb9e62be<commit_msg>ba8460d6-2e4c-11e5-9284-b827eb9e62be<commit_after>ba8460d6-2e4c-11e5-9284-b827eb9e62be<|endoftext|>"} {"text":"<commit_before>1458d280-2e4e-11e5-9284-b827eb9e62be<commit_msg>145dc916-2e4e-11e5-9284-b827eb9e62be<commit_after>145dc916-2e4e-11e5-9284-b827eb9e62be<|endoftext|>"} {"text":"<commit_before>6e67c04c-2e4e-11e5-9284-b827eb9e62be<commit_msg>6e6cba02-2e4e-11e5-9284-b827eb9e62be<commit_after>6e6cba02-2e4e-11e5-9284-b827eb9e62be<|endoftext|>"} {"text":"<commit_before>14fe3a08-2e4f-11e5-9284-b827eb9e62be<commit_msg>15034e76-2e4f-11e5-9284-b827eb9e62be<commit_after>15034e76-2e4f-11e5-9284-b827eb9e62be<|endoftext|>"} {"text":"<commit_before>d2688f5e-2e4e-11e5-9284-b827eb9e62be<commit_msg>d26d8694-2e4e-11e5-9284-b827eb9e62be<commit_after>d26d8694-2e4e-11e5-9284-b827eb9e62be<|endoftext|>"} {"text":"<commit_before>b89ade26-2e4c-11e5-9284-b827eb9e62be<commit_msg>b89fe790-2e4c-11e5-9284-b827eb9e62be<commit_after>b89fe790-2e4c-11e5-9284-b827eb9e62be<|endoftext|>"} {"text":"<commit_before>0a039726-2e4d-11e5-9284-b827eb9e62be<commit_msg>0a089e7e-2e4d-11e5-9284-b827eb9e62be<commit_after>0a089e7e-2e4d-11e5-9284-b827eb9e62be<|endoftext|>"} {"text":"<commit_before>2292584e-2e4e-11e5-9284-b827eb9e62be<commit_msg>22976262-2e4e-11e5-9284-b827eb9e62be<commit_after>22976262-2e4e-11e5-9284-b827eb9e62be<|endoftext|>"} {"text":"<commit_before>f9bbf8bc-2e4d-11e5-9284-b827eb9e62be<commit_msg>f9c0ea8e-2e4d-11e5-9284-b827eb9e62be<commit_after>f9c0ea8e-2e4d-11e5-9284-b827eb9e62be<|endoftext|>"} {"text":"<commit_before>7fda4008-2e4d-11e5-9284-b827eb9e62be<commit_msg>7fdf3658-2e4d-11e5-9284-b827eb9e62be<commit_after>7fdf3658-2e4d-11e5-9284-b827eb9e62be<|endoftext|>"} {"text":"<commit_before>dc50d3f0-2e4e-11e5-9284-b827eb9e62be<commit_msg>dc55cb62-2e4e-11e5-9284-b827eb9e62be<commit_after>dc55cb62-2e4e-11e5-9284-b827eb9e62be<|endoftext|>"} {"text":"<commit_before>5dbf4d60-2e4d-11e5-9284-b827eb9e62be<commit_msg>5dc45f6c-2e4d-11e5-9284-b827eb9e62be<commit_after>5dc45f6c-2e4d-11e5-9284-b827eb9e62be<|endoftext|>"} {"text":"<commit_before>420076c6-2e4d-11e5-9284-b827eb9e62be<commit_msg>42057a36-2e4d-11e5-9284-b827eb9e62be<commit_after>42057a36-2e4d-11e5-9284-b827eb9e62be<|endoftext|>"} {"text":"<commit_before>1935fb42-2e4f-11e5-9284-b827eb9e62be<commit_msg>193b0b28-2e4f-11e5-9284-b827eb9e62be<commit_after>193b0b28-2e4f-11e5-9284-b827eb9e62be<|endoftext|>"} {"text":"<commit_before>4cb4d12e-2e4e-11e5-9284-b827eb9e62be<commit_msg>4cba091e-2e4e-11e5-9284-b827eb9e62be<commit_after>4cba091e-2e4e-11e5-9284-b827eb9e62be<|endoftext|>"} {"text":"<commit_before>6d84b46a-2e4d-11e5-9284-b827eb9e62be<commit_msg>6d89c3ba-2e4d-11e5-9284-b827eb9e62be<commit_after>6d89c3ba-2e4d-11e5-9284-b827eb9e62be<|endoftext|>"} {"text":"<commit_before>be62ce08-2e4d-11e5-9284-b827eb9e62be<commit_msg>be67cdd6-2e4d-11e5-9284-b827eb9e62be<commit_after>be67cdd6-2e4d-11e5-9284-b827eb9e62be<|endoftext|>"} {"text":"<commit_before>ac1e05ea-2e4e-11e5-9284-b827eb9e62be<commit_msg>ac22fa50-2e4e-11e5-9284-b827eb9e62be<commit_after>ac22fa50-2e4e-11e5-9284-b827eb9e62be<|endoftext|>"} {"text":"<commit_before>#pragma once\n\n#include \"point_to_int64.hpp\"\n\n#include \"..\/geometry\/point2d.hpp\"\n\n\nnamespace feature\n{\n namespace pts\n {\n inline int64_t FromPoint(m2::PointD const & p)\n {\n return PointToInt64(p.x, p.y);\n }\n\n inline m2::PointD ToPoint(int64_t i)\n {\n CoordPointT const pt = Int64ToPoint(i);\n return m2::PointD(pt.first, pt.second);\n }\n }\n\n\n static int g_arrWorldScales[] = { 1, 3, 4, 6 }; \/\/ 6 = upper scale for world.mwm visibility\n static int g_arrCountryScales[] = { 7, 10, 14, 17 }; \/\/ 17 = scales::GetUpperScale()\n\n inline string GetTagForIndex(char const * prefix, int ind)\n {\n string str;\n str.reserve(strlen(prefix) + 1);\n str = prefix;\n\n static char arrChar[] = { '0', '1', '2', '3' };\n STATIC_ASSERT ( ARRAY_SIZE(arrChar) == ARRAY_SIZE(g_arrWorldScales) );\n STATIC_ASSERT ( ARRAY_SIZE(arrChar) == ARRAY_SIZE(g_arrCountryScales) );\n ASSERT ( ind >= 0 && ind < ARRAY_SIZE(arrChar), (ind) );\n\n str += arrChar[ind];\n return str;\n }\n}\n<commit_msg>Fixed geometry zoom levels for World file<commit_after>#pragma once\n\n#include \"point_to_int64.hpp\"\n\n#include \"..\/geometry\/point2d.hpp\"\n\n\nnamespace feature\n{\n namespace pts\n {\n inline int64_t FromPoint(m2::PointD const & p)\n {\n return PointToInt64(p.x, p.y);\n }\n\n inline m2::PointD ToPoint(int64_t i)\n {\n CoordPointT const pt = Int64ToPoint(i);\n return m2::PointD(pt.first, pt.second);\n }\n }\n\n\n static int g_arrWorldScales[] = { 2, 4, 5, 6 }; \/\/ 6 = upper scale for world.mwm visibility\n static int g_arrCountryScales[] = { 7, 10, 14, 17 }; \/\/ 17 = scales::GetUpperScale()\n\n inline string GetTagForIndex(char const * prefix, int ind)\n {\n string str;\n str.reserve(strlen(prefix) + 1);\n str = prefix;\n\n static char arrChar[] = { '0', '1', '2', '3' };\n STATIC_ASSERT ( ARRAY_SIZE(arrChar) == ARRAY_SIZE(g_arrWorldScales) );\n STATIC_ASSERT ( ARRAY_SIZE(arrChar) == ARRAY_SIZE(g_arrCountryScales) );\n ASSERT ( ind >= 0 && ind < ARRAY_SIZE(arrChar), (ind) );\n\n str += arrChar[ind];\n return str;\n }\n}\n<|endoftext|>"} {"text":"<commit_before>be023f58-2e4c-11e5-9284-b827eb9e62be<commit_msg>be073526-2e4c-11e5-9284-b827eb9e62be<commit_after>be073526-2e4c-11e5-9284-b827eb9e62be<|endoftext|>"} {"text":"<commit_before>84c199b2-2e4e-11e5-9284-b827eb9e62be<commit_msg>84c7026c-2e4e-11e5-9284-b827eb9e62be<commit_after>84c7026c-2e4e-11e5-9284-b827eb9e62be<|endoftext|>"} {"text":"<commit_before>55bd659c-2e4e-11e5-9284-b827eb9e62be<commit_msg>55c27cf8-2e4e-11e5-9284-b827eb9e62be<commit_after>55c27cf8-2e4e-11e5-9284-b827eb9e62be<|endoftext|>"} {"text":"<commit_before>6b8d3394-2e4d-11e5-9284-b827eb9e62be<commit_msg>6b924708-2e4d-11e5-9284-b827eb9e62be<commit_after>6b924708-2e4d-11e5-9284-b827eb9e62be<|endoftext|>"} {"text":"<commit_before>26954ef2-2e4d-11e5-9284-b827eb9e62be<commit_msg>269a4218-2e4d-11e5-9284-b827eb9e62be<commit_after>269a4218-2e4d-11e5-9284-b827eb9e62be<|endoftext|>"} {"text":"<commit_before>f7c5b93a-2e4d-11e5-9284-b827eb9e62be<commit_msg>f7cab174-2e4d-11e5-9284-b827eb9e62be<commit_after>f7cab174-2e4d-11e5-9284-b827eb9e62be<|endoftext|>"} {"text":"<commit_before>5a65bb76-2e4e-11e5-9284-b827eb9e62be<commit_msg>5a6ac74c-2e4e-11e5-9284-b827eb9e62be<commit_after>5a6ac74c-2e4e-11e5-9284-b827eb9e62be<|endoftext|>"} {"text":"<commit_before>7bbe4716-2e4e-11e5-9284-b827eb9e62be<commit_msg>7bc3a30a-2e4e-11e5-9284-b827eb9e62be<commit_after>7bc3a30a-2e4e-11e5-9284-b827eb9e62be<|endoftext|>"} {"text":"<commit_before>c6062e06-2e4e-11e5-9284-b827eb9e62be<commit_msg>c60b35fe-2e4e-11e5-9284-b827eb9e62be<commit_after>c60b35fe-2e4e-11e5-9284-b827eb9e62be<|endoftext|>"} {"text":"<commit_before>877121ce-2e4d-11e5-9284-b827eb9e62be<commit_msg>8786f5da-2e4d-11e5-9284-b827eb9e62be<commit_after>8786f5da-2e4d-11e5-9284-b827eb9e62be<|endoftext|>"} {"text":"<commit_before>dd826ca4-2e4c-11e5-9284-b827eb9e62be<commit_msg>dd875e4e-2e4c-11e5-9284-b827eb9e62be<commit_after>dd875e4e-2e4c-11e5-9284-b827eb9e62be<|endoftext|>"} {"text":"<commit_before>0fd33580-2e4d-11e5-9284-b827eb9e62be<commit_msg>0fd8475a-2e4d-11e5-9284-b827eb9e62be<commit_after>0fd8475a-2e4d-11e5-9284-b827eb9e62be<|endoftext|>"} {"text":"<commit_before>88b1d2f4-2e4d-11e5-9284-b827eb9e62be<commit_msg>88b71656-2e4d-11e5-9284-b827eb9e62be<commit_after>88b71656-2e4d-11e5-9284-b827eb9e62be<|endoftext|>"} {"text":"<commit_before>43f53b7e-2e4d-11e5-9284-b827eb9e62be<commit_msg>43fa498e-2e4d-11e5-9284-b827eb9e62be<commit_after>43fa498e-2e4d-11e5-9284-b827eb9e62be<|endoftext|>"} {"text":"<commit_before>5ecccb14-2e4e-11e5-9284-b827eb9e62be<commit_msg>5ed1ccb8-2e4e-11e5-9284-b827eb9e62be<commit_after>5ed1ccb8-2e4e-11e5-9284-b827eb9e62be<|endoftext|>"} {"text":"<commit_before>0d3b4842-2e4f-11e5-9284-b827eb9e62be<commit_msg>0d403ca8-2e4f-11e5-9284-b827eb9e62be<commit_after>0d403ca8-2e4f-11e5-9284-b827eb9e62be<|endoftext|>"} {"text":"<commit_before>e00bed78-2e4d-11e5-9284-b827eb9e62be<commit_msg>e010f2a0-2e4d-11e5-9284-b827eb9e62be<commit_after>e010f2a0-2e4d-11e5-9284-b827eb9e62be<|endoftext|>"} {"text":"<commit_before>#include \"ntuple_test.hxx\"\n\nTEST(RNTuple, RealWorld1)\n{\n FileRaii fileGuard(\"test_ntuple_realworld1.root\");\n\n \/\/ See https:\/\/github.com\/olifre\/root-io-bench\/blob\/master\/benchmark.cpp\n auto modelWrite = RNTupleModel::Create();\n auto wrEvent = modelWrite->MakeField<std::uint32_t>(\"event\");\n auto wrSignal = modelWrite->MakeField<bool>(\"signal\");\n auto wrEnergy = modelWrite->MakeField<double>(\"energy\");\n auto wrTimes = modelWrite->MakeField<std::vector<double>>(\"times\");\n auto wrIndices = modelWrite->MakeField<std::vector<std::uint32_t>>(\"indices\");\n\n TRandom3 rnd(42);\n double chksumWrite = 0.0;\n {\n auto ntuple = RNTupleWriter::Recreate(std::move(modelWrite), \"myNTuple\", fileGuard.GetPath());\n constexpr unsigned int nEvents = 60000;\n for (unsigned int i = 0; i < nEvents; ++i) {\n *wrEvent = i;\n *wrEnergy = rnd.Rndm() * 1000.;\n *wrSignal = i % 2;\n\n chksumWrite += double(*wrEvent);\n chksumWrite += double(*wrSignal);\n chksumWrite += *wrEnergy;\n\n auto nTimes = 1 + floor(rnd.Rndm() * 1000.);\n wrTimes->resize(nTimes);\n for (unsigned int n = 0; n < nTimes; ++n) {\n wrTimes->at(n) = 1 + rnd.Rndm()*1000. - 500.;\n chksumWrite += wrTimes->at(n);\n }\n\n auto nIndices = 1 + floor(rnd.Rndm() * 1000.);\n wrIndices->resize(nIndices);\n for (unsigned int n = 0; n < nIndices; ++n) {\n wrIndices->at(n) = 1 + floor(rnd.Rndm() * 1000.);\n chksumWrite += double(wrIndices->at(n));\n }\n\n ntuple->Fill();\n }\n }\n\n auto modelRead = RNTupleModel::Create();\n auto rdEvent = modelRead->MakeField<std::uint32_t>(\"event\");\n auto rdSignal = modelRead->MakeField<bool>(\"signal\");\n auto rdEnergy = modelRead->MakeField<double>(\"energy\");\n auto rdTimes = modelRead->MakeField<std::vector<double>>(\"times\");\n auto rdIndices = modelRead->MakeField<std::vector<std::uint32_t>>(\"indices\");\n\n double chksumRead = 0.0;\n auto ntuple = RNTupleReader::Open(std::move(modelRead), \"myNTuple\", fileGuard.GetPath());\n for (auto entryId : *ntuple) {\n ntuple->LoadEntry(entryId);\n chksumRead += double(*rdEvent) + double(*rdSignal) + *rdEnergy;\n for (auto t : *rdTimes) chksumRead += t;\n for (auto ind : *rdIndices) chksumRead += double(ind);\n }\n\n \/\/ The floating point arithmetic should have been executed in the same order for reading and writing,\n \/\/ thus we expect the checksums to be bitwise identical\n EXPECT_EQ(chksumRead, chksumWrite);\n}\n\n#if !defined(_MSC_VER) || defined(R__ENABLE_BROKEN_WIN_TESTS)\nTEST(RNTuple, LargeFile)\n{\n FileRaii fileGuard(\"test_large_file.root\");\n\n auto modelWrite = RNTupleModel::Create();\n auto& wrEnergy = *modelWrite->MakeField<double>(\"energy\");\n\n TRandom3 rnd(42);\n double chksumWrite = 0.0;\n {\n RNTupleWriteOptions options;\n options.SetCompression(0);\n auto ntuple = RNTupleWriter::Recreate(std::move(modelWrite), \"myNTuple\", fileGuard.GetPath(), options);\n constexpr unsigned long nEvents = 1024 * 1024 * 256; \/\/ Exceed 2GB file size\n for (unsigned int i = 0; i < nEvents; ++i) {\n wrEnergy = rnd.Rndm();\n chksumWrite += wrEnergy;\n ntuple->Fill();\n }\n }\n FILE *file = fopen(fileGuard.GetPath().c_str(), \"rb\");\n ASSERT_TRUE(file != nullptr);\n EXPECT_EQ(0, fseek(file, 0, SEEK_END));\n EXPECT_GT(ftell(file), 2048LL * 1024LL * 1024LL);\n fclose(file);\n\n auto ntuple = RNTupleReader::Open(\"myNTuple\", fileGuard.GetPath());\n auto rdEnergy = ntuple->GetView<double>(\"energy\");\n double chksumRead = 0.0;\n\n for (auto i : ntuple->GetEntryRange()) {\n chksumRead += rdEnergy(i);\n }\n\n EXPECT_EQ(chksumRead, chksumWrite);\n auto f = TFile::Open(fileGuard.GetPath().c_str(), \"READ\");\n EXPECT_TRUE(f != nullptr);\n delete f;\n}\n#endif\n<commit_msg>[ntuple] add unit test for random access reading<commit_after>#include \"ntuple_test.hxx\"\n\nTEST(RNTuple, RealWorld1)\n{\n FileRaii fileGuard(\"test_ntuple_realworld1.root\");\n\n \/\/ See https:\/\/github.com\/olifre\/root-io-bench\/blob\/master\/benchmark.cpp\n auto modelWrite = RNTupleModel::Create();\n auto wrEvent = modelWrite->MakeField<std::uint32_t>(\"event\");\n auto wrSignal = modelWrite->MakeField<bool>(\"signal\");\n auto wrEnergy = modelWrite->MakeField<double>(\"energy\");\n auto wrTimes = modelWrite->MakeField<std::vector<double>>(\"times\");\n auto wrIndices = modelWrite->MakeField<std::vector<std::uint32_t>>(\"indices\");\n\n TRandom3 rnd(42);\n double chksumWrite = 0.0;\n {\n auto ntuple = RNTupleWriter::Recreate(std::move(modelWrite), \"myNTuple\", fileGuard.GetPath());\n constexpr unsigned int nEvents = 60000;\n for (unsigned int i = 0; i < nEvents; ++i) {\n *wrEvent = i;\n *wrEnergy = rnd.Rndm() * 1000.;\n *wrSignal = i % 2;\n\n chksumWrite += double(*wrEvent);\n chksumWrite += double(*wrSignal);\n chksumWrite += *wrEnergy;\n\n auto nTimes = 1 + floor(rnd.Rndm() * 1000.);\n wrTimes->resize(nTimes);\n for (unsigned int n = 0; n < nTimes; ++n) {\n wrTimes->at(n) = 1 + rnd.Rndm()*1000. - 500.;\n chksumWrite += wrTimes->at(n);\n }\n\n auto nIndices = 1 + floor(rnd.Rndm() * 1000.);\n wrIndices->resize(nIndices);\n for (unsigned int n = 0; n < nIndices; ++n) {\n wrIndices->at(n) = 1 + floor(rnd.Rndm() * 1000.);\n chksumWrite += double(wrIndices->at(n));\n }\n\n ntuple->Fill();\n }\n }\n\n auto modelRead = RNTupleModel::Create();\n auto rdEvent = modelRead->MakeField<std::uint32_t>(\"event\");\n auto rdSignal = modelRead->MakeField<bool>(\"signal\");\n auto rdEnergy = modelRead->MakeField<double>(\"energy\");\n auto rdTimes = modelRead->MakeField<std::vector<double>>(\"times\");\n auto rdIndices = modelRead->MakeField<std::vector<std::uint32_t>>(\"indices\");\n\n double chksumRead = 0.0;\n auto ntuple = RNTupleReader::Open(std::move(modelRead), \"myNTuple\", fileGuard.GetPath());\n for (auto entryId : *ntuple) {\n ntuple->LoadEntry(entryId);\n chksumRead += double(*rdEvent) + double(*rdSignal) + *rdEnergy;\n for (auto t : *rdTimes) chksumRead += t;\n for (auto ind : *rdIndices) chksumRead += double(ind);\n }\n\n \/\/ The floating point arithmetic should have been executed in the same order for reading and writing,\n \/\/ thus we expect the checksums to be bitwise identical\n EXPECT_EQ(chksumRead, chksumWrite);\n}\n\n\n\/\/ Stress test the asynchronous cluster pool by a deliberately unfavourable read pattern\nTEST(RNTuple, RandomAccess)\n{\n FileRaii fileGuard(\"test_ntuple_random_access.root\");\n\n auto modelWrite = RNTupleModel::Create();\n auto wrValue = modelWrite->MakeField<std::int32_t>(\"value\", 42);\n\n constexpr unsigned int nEvents = 1000000;\n {\n RNTupleWriteOptions options;\n options.SetCompression(0);\n auto ntuple = RNTupleWriter::Recreate(std::move(modelWrite), \"myNTuple\", fileGuard.GetPath(), options);\n for (unsigned int i = 0; i < nEvents; ++i)\n ntuple->Fill();\n }\n\n RNTupleReadOptions options;\n options.SetClusterCache(RNTupleReadOptions::EClusterCache::kOn);\n auto ntuple = RNTupleReader::Open(\"myNTuple\", fileGuard.GetPath(), options);\n EXPECT_GT(ntuple->GetDescriptor().GetNClusters(), 10);\n\n auto viewValue = ntuple->GetView<std::int32_t>(\"value\");\n\n std::int32_t sum = 0;\n constexpr unsigned int nSamples = 1000;\n TRandom3 rnd(42);\n for (unsigned int i = 0; i < 1000; ++i) {\n auto entryId = floor(rnd.Rndm() * (nEvents - 1));\n sum += viewValue(entryId);\n }\n EXPECT_EQ(42 * nSamples, sum);\n}\n\n\n#if !defined(_MSC_VER) || defined(R__ENABLE_BROKEN_WIN_TESTS)\nTEST(RNTuple, LargeFile)\n{\n FileRaii fileGuard(\"test_large_file.root\");\n\n auto modelWrite = RNTupleModel::Create();\n auto& wrEnergy = *modelWrite->MakeField<double>(\"energy\");\n\n TRandom3 rnd(42);\n double chksumWrite = 0.0;\n {\n RNTupleWriteOptions options;\n options.SetCompression(0);\n auto ntuple = RNTupleWriter::Recreate(std::move(modelWrite), \"myNTuple\", fileGuard.GetPath(), options);\n constexpr unsigned long nEvents = 1024 * 1024 * 256; \/\/ Exceed 2GB file size\n for (unsigned int i = 0; i < nEvents; ++i) {\n wrEnergy = rnd.Rndm();\n chksumWrite += wrEnergy;\n ntuple->Fill();\n }\n }\n FILE *file = fopen(fileGuard.GetPath().c_str(), \"rb\");\n ASSERT_TRUE(file != nullptr);\n EXPECT_EQ(0, fseek(file, 0, SEEK_END));\n EXPECT_GT(ftell(file), 2048LL * 1024LL * 1024LL);\n fclose(file);\n\n auto ntuple = RNTupleReader::Open(\"myNTuple\", fileGuard.GetPath());\n auto rdEnergy = ntuple->GetView<double>(\"energy\");\n double chksumRead = 0.0;\n\n for (auto i : ntuple->GetEntryRange()) {\n chksumRead += rdEnergy(i);\n }\n\n EXPECT_EQ(chksumRead, chksumWrite);\n auto f = TFile::Open(fileGuard.GetPath().c_str(), \"READ\");\n EXPECT_TRUE(f != nullptr);\n delete f;\n}\n#endif\n<|endoftext|>"} {"text":"<commit_before>\/\/ RUN: %clang_cl_asan -O0 %s -Fe%t\n\/\/ RUN: not %run %t 2>&1 | FileCheck %s\n\n#include <windows.h>\n\nHANDLE done;\n\nDWORD CALLBACK work_item(LPVOID) {\n int subscript = -1;\n volatile char stack_buffer[42];\n stack_buffer[subscript] = 42;\n\/\/ CHECK: AddressSanitizer: stack-buffer-underflow on address [[ADDR:0x[0-9a-f]+]]\n\/\/ CHECK: WRITE of size 1 at [[ADDR]] thread T1\n\/\/ CHECK: {{#0 .* work_item.*queue_user_work_item_report.cc}}:[[@LINE-3]]\n\/\/ CHECK: Address [[ADDR]] is located in stack of thread T1 at offset {{.*}} in frame\n\/\/ CHECK: work_item\n SetEvent(done);\n return 0;\n}\n\nint main(int argc, char **argv) {\n done = CreateEvent(0, false, false, \"job is done\");\n if (!done)\n return 1;\n\/\/ CHECK-NOT: Thread T1 created\n QueueUserWorkItem(&work_item, nullptr, 0);\n if (WAIT_OBJECT_0 != WaitForSingleObject(done, 10 * 1000))\n return 2;\n}\n<commit_msg>Remove stale CHECK lines that should have been included in r277478<commit_after>\/\/ RUN: %clang_cl_asan -O0 %s -Fe%t\n\/\/ RUN: not %run %t 2>&1 | FileCheck %s\n\n#include <windows.h>\n\nHANDLE done;\n\nDWORD CALLBACK work_item(LPVOID) {\n int subscript = -1;\n volatile char stack_buffer[42];\n stack_buffer[subscript] = 42;\n\/\/ CHECK: AddressSanitizer: stack-buffer-underflow on address [[ADDR:0x[0-9a-f]+]]\n\/\/ CHECK: WRITE of size 1 at [[ADDR]] thread T1\n\/\/ CHECK: {{#0 .* work_item.*queue_user_work_item_report.cc}}:[[@LINE-3]]\n SetEvent(done);\n return 0;\n}\n\nint main(int argc, char **argv) {\n done = CreateEvent(0, false, false, \"job is done\");\n if (!done)\n return 1;\n\/\/ CHECK-NOT: Thread T1 created\n QueueUserWorkItem(&work_item, nullptr, 0);\n if (WAIT_OBJECT_0 != WaitForSingleObject(done, 10 * 1000))\n return 2;\n}\n<|endoftext|>"} {"text":"<commit_before>2a1ef17a-2e4f-11e5-9284-b827eb9e62be<commit_msg>2a23eb94-2e4f-11e5-9284-b827eb9e62be<commit_after>2a23eb94-2e4f-11e5-9284-b827eb9e62be<|endoftext|>"} {"text":"<commit_before>\/*****************************************************************************\n * EPGChannels.cpp: EPGChannels\n ****************************************************************************\n * Copyright © 2009-2010 VideoLAN\n *\n * Authors: Adrien Maglo <magsoft@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 \"EPGChannels.hpp\"\n#include \"EPGView.hpp\"\n\n#include <QPainter>\n#include <QFont>\n#include <QPaintEvent>\n\nEPGChannels::EPGChannels( QWidget *parent, EPGView *m_epgView )\n : QWidget( parent ), m_epgView( m_epgView ), m_offset( 0 )\n{\n setContentsMargins( 0, 0, 0, 0 );\n}\n\nvoid EPGChannels::setOffset( int offset )\n{\n m_offset = offset;\n update();\n}\n\nvoid EPGChannels::addChannel( QString channelName )\n{\n if ( !channelList.contains( channelName ) )\n {\n channelList << channelName;\n channelList.sort();\n update();\n }\n}\n\nvoid EPGChannels::removeChannel( QString channelName )\n{\n if ( channelList.removeOne( channelName ) ) update();\n}\n\nvoid EPGChannels::paintEvent( QPaintEvent *event )\n{\n Q_UNUSED( event );\n\n QPainter p( this );\n\n \/* Draw the top and the bottom lines. *\/\n p.drawLine( 0, 0, width() - 1, 0 );\n\n unsigned int i=0;\n foreach( QString text, channelList )\n {\n \/* try to remove the \" [Program xxx]\" end *\/\n int i_idx_channel = text.lastIndexOf(\" [Program \");\n if (i_idx_channel > 0)\n text = text.left( i_idx_channel );\n\n p.drawText( 0, - m_offset + ( i++ + 0.5 ) * TRACKS_HEIGHT - 4,\n width(), 20, Qt::AlignLeft, text );\n\n int i_width = fontMetrics().width( text );\n if( width() < i_width )\n setMinimumWidth( i_width );\n }\n}\n<commit_msg>Qt: epgchannels: split string on bracket.<commit_after>\/*****************************************************************************\n * EPGChannels.cpp: EPGChannels\n ****************************************************************************\n * Copyright © 2009-2010 VideoLAN\n *\n * Authors: Adrien Maglo <magsoft@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 \"EPGChannels.hpp\"\n#include \"EPGView.hpp\"\n\n#include <QPainter>\n#include <QFont>\n#include <QPaintEvent>\n\nEPGChannels::EPGChannels( QWidget *parent, EPGView *m_epgView )\n : QWidget( parent ), m_epgView( m_epgView ), m_offset( 0 )\n{\n setContentsMargins( 0, 0, 0, 0 );\n}\n\nvoid EPGChannels::setOffset( int offset )\n{\n m_offset = offset;\n update();\n}\n\nvoid EPGChannels::addChannel( QString channelName )\n{\n if ( !channelList.contains( channelName ) )\n {\n channelList << channelName;\n channelList.sort();\n update();\n }\n}\n\nvoid EPGChannels::removeChannel( QString channelName )\n{\n if ( channelList.removeOne( channelName ) ) update();\n}\n\nvoid EPGChannels::paintEvent( QPaintEvent *event )\n{\n Q_UNUSED( event );\n\n QPainter p( this );\n\n \/* Draw the top and the bottom lines. *\/\n p.drawLine( 0, 0, width() - 1, 0 );\n\n unsigned int i=0;\n foreach( QString text, channelList )\n {\n \/* try to remove the \" [Program xxx]\" end *\/\n int i_idx_channel = text.lastIndexOf(\" [\");\n if (i_idx_channel > 0)\n text = text.left( i_idx_channel );\n\n p.drawText( 0, - m_offset + ( i++ + 0.5 ) * TRACKS_HEIGHT - 4,\n width(), 20, Qt::AlignLeft, text );\n\n int i_width = fontMetrics().width( text );\n if( width() < i_width )\n setMinimumWidth( i_width );\n }\n}\n<|endoftext|>"} {"text":"<commit_before>28517b7e-2e4f-11e5-9284-b827eb9e62be<commit_msg>28567a84-2e4f-11e5-9284-b827eb9e62be<commit_after>28567a84-2e4f-11e5-9284-b827eb9e62be<|endoftext|>"} {"text":"<commit_before>b80e219c-2e4d-11e5-9284-b827eb9e62be<commit_msg>b813101c-2e4d-11e5-9284-b827eb9e62be<commit_after>b813101c-2e4d-11e5-9284-b827eb9e62be<|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\/testapp.h>\n#include <vespa\/vespalib\/stllike\/string.h>\n#include <vespa\/document\/base\/documentid.h>\n#include <vespa\/vespalib\/util\/threadstackexecutor.h>\n#include <vespa\/searchcore\/proton\/server\/executor_thread_service.h>\n#include <vespa\/searchlib\/common\/lambdatask.h>\n#include <vespa\/searchcore\/proton\/reference\/i_gid_to_lid_change_listener.h>\n#include <vespa\/searchcore\/proton\/reference\/gid_to_lid_change_handler.h>\n#include <map>\n#include <vespa\/log\/log.h>\nLOG_SETUP(\"gid_to_lid_change_handler_test\");\n\nusing document::GlobalId;\nusing document::DocumentId;\nusing search::makeLambdaTask;\nusing search::SerialNum;\n\nnamespace proton {\n\nnamespace {\n\nGlobalId toGid(vespalib::stringref docId) {\n return DocumentId(docId).getGlobalId();\n}\n\nvespalib::string doc1(\"id:test:music::1\");\n\n}\n\nclass ListenerStats {\n using lock_guard = std::lock_guard<std::mutex>;\n std::mutex _lock;\n uint32_t _putChanges;\n uint32_t _removeChanges;\n uint32_t _createdListeners;\n uint32_t _registeredListeners;\n uint32_t _destroyedListeners;\n\npublic:\n ListenerStats()\n : _lock(),\n _putChanges(0u),\n _removeChanges(0u),\n _createdListeners(0u),\n _registeredListeners(0u),\n _destroyedListeners(0u)\n {\n }\n\n ~ListenerStats()\n {\n EXPECT_EQUAL(_createdListeners, _destroyedListeners);\n }\n\n void notifyPutDone() {\n lock_guard guard(_lock);\n ++_putChanges;\n }\n void notifyRemove() {\n lock_guard guard(_lock);\n ++_removeChanges;\n }\n void markCreatedListener() { lock_guard guard(_lock); ++_createdListeners; }\n void markRegisteredListener() { lock_guard guard(_lock); ++_registeredListeners; }\n void markDestroyedListener() { lock_guard guard(_lock); ++_destroyedListeners; }\n\n uint32_t getCreatedListeners() const { return _createdListeners; }\n uint32_t getRegisteredListeners() const { return _registeredListeners; }\n uint32_t getDestroyedListeners() const { return _destroyedListeners; }\n\n void assertListeners(uint32_t expCreatedListeners,\n uint32_t expRegisteredListeners,\n uint32_t expDestroyedListeners)\n {\n EXPECT_EQUAL(expCreatedListeners, getCreatedListeners());\n EXPECT_EQUAL(expRegisteredListeners, getRegisteredListeners());\n EXPECT_EQUAL(expDestroyedListeners, getDestroyedListeners());\n }\n void assertChanges(uint32_t expPutChanges, uint32_t expRemoveChanges)\n {\n EXPECT_EQUAL(expPutChanges, _putChanges);\n EXPECT_EQUAL(expRemoveChanges, _removeChanges);\n }\n};\n\nclass MyListener : public IGidToLidChangeListener\n{\n ListenerStats &_stats;\n vespalib::string _name;\n vespalib::string _docTypeName;\npublic:\n MyListener(ListenerStats &stats,\n const vespalib::string &name,\n const vespalib::string &docTypeName)\n : IGidToLidChangeListener(),\n _stats(stats),\n _name(name),\n _docTypeName(docTypeName)\n {\n _stats.markCreatedListener();\n }\n virtual ~MyListener() { _stats.markDestroyedListener(); }\n virtual void notifyPutDone(GlobalId, uint32_t) override { _stats.notifyPutDone(); }\n virtual void notifyRemove(GlobalId) override { _stats.notifyRemove(); }\n virtual void notifyRegistered() override { _stats.markRegisteredListener(); }\n virtual const vespalib::string &getName() const override { return _name; }\n virtual const vespalib::string &getDocTypeName() const override { return _docTypeName; }\n};\n\nstruct Fixture\n{\n std::vector<std::shared_ptr<ListenerStats>> _statss;\n std::shared_ptr<GidToLidChangeHandler> _handler;\n\n Fixture()\n : _statss(),\n _handler(std::make_shared<GidToLidChangeHandler>())\n {\n }\n\n ~Fixture()\n {\n close();\n }\n\n void close()\n {\n _handler->close();\n }\n\n ListenerStats &addStats() {\n _statss.push_back(std::make_shared<ListenerStats>());\n return *_statss.back();\n }\n\n void addListener(std::unique_ptr<IGidToLidChangeListener> listener) {\n _handler->addListener(std::move(listener));\n }\n\n void notifyPutDone(GlobalId gid, uint32_t lid, SerialNum serialNum) {\n _handler->notifyPutDone(gid, lid, serialNum);\n }\n\n void notifyRemove(GlobalId gid, SerialNum serialNum) {\n _handler->notifyRemove(gid, serialNum);\n }\n\n void notifyRemoveDone(GlobalId gid, SerialNum serialNum) {\n _handler->notifyRemoveDone(gid, serialNum);\n }\n\n void removeListeners(const vespalib::string &docTypeName,\n const std::set<vespalib::string> &keepNames) {\n _handler->removeListeners(docTypeName, keepNames);\n }\n\n};\n\nTEST_F(\"Test that we can register a listener\", Fixture)\n{\n auto &stats = f.addStats();\n auto listener = std::make_unique<MyListener>(stats, \"test\", \"testdoc\");\n TEST_DO(stats.assertListeners(1, 0, 0));\n f.addListener(std::move(listener));\n TEST_DO(stats.assertListeners(1, 1, 0));\n f.notifyPutDone(toGid(doc1), 10, 10);\n TEST_DO(stats.assertChanges(1, 0));\n f.removeListeners(\"testdoc\", {});\n TEST_DO(stats.assertListeners(1, 1, 1));\n}\n\nTEST_F(\"Test that we can register multiple listeners\", Fixture)\n{\n auto &stats1 = f.addStats();\n auto &stats2 = f.addStats();\n auto &stats3 = f.addStats();\n auto listener1 = std::make_unique<MyListener>(stats1, \"test1\", \"testdoc\");\n auto listener2 = std::make_unique<MyListener>(stats2, \"test2\", \"testdoc\");\n auto listener3 = std::make_unique<MyListener>(stats3, \"test3\", \"testdoc2\");\n TEST_DO(stats1.assertListeners(1, 0, 0));\n TEST_DO(stats2.assertListeners(1, 0, 0));\n TEST_DO(stats3.assertListeners(1, 0, 0));\n f.addListener(std::move(listener1));\n f.addListener(std::move(listener2));\n f.addListener(std::move(listener3));\n TEST_DO(stats1.assertListeners(1, 1, 0));\n TEST_DO(stats2.assertListeners(1, 1, 0));\n TEST_DO(stats3.assertListeners(1, 1, 0));\n f.notifyPutDone(toGid(doc1), 10, 10);\n TEST_DO(stats1.assertChanges(1, 0));\n TEST_DO(stats2.assertChanges(1, 0));\n TEST_DO(stats3.assertChanges(1, 0));\n f.removeListeners(\"testdoc\", {\"test1\"});\n TEST_DO(stats1.assertListeners(1, 1, 0));\n TEST_DO(stats2.assertListeners(1, 1, 1));\n TEST_DO(stats3.assertListeners(1, 1, 0));\n f.removeListeners(\"testdoc\", {});\n TEST_DO(stats1.assertListeners(1, 1, 1));\n TEST_DO(stats2.assertListeners(1, 1, 1));\n TEST_DO(stats3.assertListeners(1, 1, 0));\n f.removeListeners(\"testdoc2\", {\"test3\"});\n TEST_DO(stats1.assertListeners(1, 1, 1));\n TEST_DO(stats2.assertListeners(1, 1, 1));\n TEST_DO(stats3.assertListeners(1, 1, 0));\n f.removeListeners(\"testdoc2\", {\"foo\"});\n TEST_DO(stats1.assertListeners(1, 1, 1));\n TEST_DO(stats2.assertListeners(1, 1, 1));\n TEST_DO(stats3.assertListeners(1, 1, 1));\n}\n\nTEST_F(\"Test that we keep old listener when registering duplicate\", Fixture)\n{\n auto &stats = f.addStats();\n auto listener = std::make_unique<MyListener>(stats, \"test1\", \"testdoc\");\n TEST_DO(stats.assertListeners(1, 0, 0));\n f.addListener(std::move(listener));\n TEST_DO(stats.assertListeners(1, 1, 0));\n listener = std::make_unique<MyListener>(stats, \"test1\", \"testdoc\");\n TEST_DO(stats.assertListeners(2, 1, 0));\n f.addListener(std::move(listener));\n TEST_DO(stats.assertListeners(2, 1, 1));\n}\n\nTEST_F(\"Test that put is ignored if we have a pending remove\", Fixture)\n{\n auto &stats = f.addStats();\n auto listener = std::make_unique<MyListener>(stats, \"test\", \"testdoc\");\n f.addListener(std::move(listener));\n f.notifyRemove(toGid(doc1), 20);\n TEST_DO(stats.assertChanges(0, 1));\n f.notifyPutDone(toGid(doc1), 10, 10);\n TEST_DO(stats.assertChanges(0, 1));\n f.notifyRemoveDone(toGid(doc1), 20);\n TEST_DO(stats.assertChanges(0, 1));\n f.notifyPutDone(toGid(doc1), 11, 30);\n TEST_DO(stats.assertChanges(1, 1));\n f.removeListeners(\"testdoc\", {});\n}\n\nTEST_F(\"Test that pending removes are merged\", Fixture)\n{\n auto &stats = f.addStats();\n auto listener = std::make_unique<MyListener>(stats, \"test\", \"testdoc\");\n f.addListener(std::move(listener));\n f.notifyRemove(toGid(doc1), 20);\n TEST_DO(stats.assertChanges(0, 1));\n f.notifyRemove(toGid(doc1), 40);\n TEST_DO(stats.assertChanges(0, 1));\n f.notifyPutDone(toGid(doc1), 10, 10);\n TEST_DO(stats.assertChanges(0, 1));\n f.notifyRemoveDone(toGid(doc1), 20);\n TEST_DO(stats.assertChanges(0, 1));\n f.notifyPutDone(toGid(doc1), 11, 30);\n TEST_DO(stats.assertChanges(0, 1));\n f.notifyRemoveDone(toGid(doc1), 40);\n TEST_DO(stats.assertChanges(0, 1));\n f.notifyPutDone(toGid(doc1), 12, 50);\n TEST_DO(stats.assertChanges(1, 1));\n f.removeListeners(\"testdoc\", {});\n}\n\nTEST_F(\"Test that out of order notifyRemoveDone is handled\", Fixture)\n{\n auto &stats = f.addStats();\n auto listener = std::make_unique<MyListener>(stats, \"test\", \"testdoc\");\n f.addListener(std::move(listener));\n f.notifyRemove(toGid(doc1), 20);\n TEST_DO(stats.assertChanges(0, 1));\n f.notifyRemove(toGid(doc1), 40);\n TEST_DO(stats.assertChanges(0, 1));\n f.notifyRemoveDone(toGid(doc1), 40);\n TEST_DO(stats.assertChanges(0, 1));\n f.notifyRemoveDone(toGid(doc1), 20);\n TEST_DO(stats.assertChanges(0, 1));\n f.notifyPutDone(toGid(doc1), 12, 50);\n TEST_DO(stats.assertChanges(1, 1));\n f.removeListeners(\"testdoc\", {});\n}\n\nTEST_F(\"Test that out of order notifyPutDone is handled\", Fixture)\n{\n auto &stats = f.addStats();\n auto listener = std::make_unique<MyListener>(stats, \"test\", \"testdoc\");\n f.addListener(std::move(listener));\n f.notifyRemove(toGid(doc1), 20);\n TEST_DO(stats.assertChanges(0, 1));\n f.notifyPutDone(toGid(doc1), 12, 50);\n TEST_DO(stats.assertChanges(1, 1));\n f.notifyRemoveDone(toGid(doc1), 20);\n TEST_DO(stats.assertChanges(1, 1));\n f.removeListeners(\"testdoc\", {});\n}\n\n}\n\nTEST_MAIN()\n{\n TEST_RUN_ALL();\n}\n<commit_msg>Use a new fixture for the last 4 tests to reduce amount of duplicated code.<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\/testapp.h>\n#include <vespa\/vespalib\/stllike\/string.h>\n#include <vespa\/document\/base\/documentid.h>\n#include <vespa\/vespalib\/util\/threadstackexecutor.h>\n#include <vespa\/searchcore\/proton\/server\/executor_thread_service.h>\n#include <vespa\/searchlib\/common\/lambdatask.h>\n#include <vespa\/searchcore\/proton\/reference\/i_gid_to_lid_change_listener.h>\n#include <vespa\/searchcore\/proton\/reference\/gid_to_lid_change_handler.h>\n#include <map>\n#include <vespa\/log\/log.h>\nLOG_SETUP(\"gid_to_lid_change_handler_test\");\n\nusing document::GlobalId;\nusing document::DocumentId;\nusing search::makeLambdaTask;\nusing search::SerialNum;\n\nnamespace proton {\n\nnamespace {\n\nGlobalId toGid(vespalib::stringref docId) {\n return DocumentId(docId).getGlobalId();\n}\n\nvespalib::string doc1(\"id:test:music::1\");\n\n}\n\nclass ListenerStats {\n using lock_guard = std::lock_guard<std::mutex>;\n std::mutex _lock;\n uint32_t _putChanges;\n uint32_t _removeChanges;\n uint32_t _createdListeners;\n uint32_t _registeredListeners;\n uint32_t _destroyedListeners;\n\npublic:\n ListenerStats()\n : _lock(),\n _putChanges(0u),\n _removeChanges(0u),\n _createdListeners(0u),\n _registeredListeners(0u),\n _destroyedListeners(0u)\n {\n }\n\n ~ListenerStats()\n {\n EXPECT_EQUAL(_createdListeners, _destroyedListeners);\n }\n\n void notifyPutDone() {\n lock_guard guard(_lock);\n ++_putChanges;\n }\n void notifyRemove() {\n lock_guard guard(_lock);\n ++_removeChanges;\n }\n void markCreatedListener() { lock_guard guard(_lock); ++_createdListeners; }\n void markRegisteredListener() { lock_guard guard(_lock); ++_registeredListeners; }\n void markDestroyedListener() { lock_guard guard(_lock); ++_destroyedListeners; }\n\n uint32_t getCreatedListeners() const { return _createdListeners; }\n uint32_t getRegisteredListeners() const { return _registeredListeners; }\n uint32_t getDestroyedListeners() const { return _destroyedListeners; }\n\n void assertListeners(uint32_t expCreatedListeners,\n uint32_t expRegisteredListeners,\n uint32_t expDestroyedListeners)\n {\n EXPECT_EQUAL(expCreatedListeners, getCreatedListeners());\n EXPECT_EQUAL(expRegisteredListeners, getRegisteredListeners());\n EXPECT_EQUAL(expDestroyedListeners, getDestroyedListeners());\n }\n void assertChanges(uint32_t expPutChanges, uint32_t expRemoveChanges)\n {\n EXPECT_EQUAL(expPutChanges, _putChanges);\n EXPECT_EQUAL(expRemoveChanges, _removeChanges);\n }\n};\n\nclass MyListener : public IGidToLidChangeListener\n{\n ListenerStats &_stats;\n vespalib::string _name;\n vespalib::string _docTypeName;\npublic:\n MyListener(ListenerStats &stats,\n const vespalib::string &name,\n const vespalib::string &docTypeName)\n : IGidToLidChangeListener(),\n _stats(stats),\n _name(name),\n _docTypeName(docTypeName)\n {\n _stats.markCreatedListener();\n }\n virtual ~MyListener() { _stats.markDestroyedListener(); }\n virtual void notifyPutDone(GlobalId, uint32_t) override { _stats.notifyPutDone(); }\n virtual void notifyRemove(GlobalId) override { _stats.notifyRemove(); }\n virtual void notifyRegistered() override { _stats.markRegisteredListener(); }\n virtual const vespalib::string &getName() const override { return _name; }\n virtual const vespalib::string &getDocTypeName() const override { return _docTypeName; }\n};\n\nstruct Fixture\n{\n std::vector<std::shared_ptr<ListenerStats>> _statss;\n std::shared_ptr<GidToLidChangeHandler> _handler;\n\n Fixture()\n : _statss(),\n _handler(std::make_shared<GidToLidChangeHandler>())\n {\n }\n\n ~Fixture()\n {\n close();\n }\n\n void close()\n {\n _handler->close();\n }\n\n ListenerStats &addStats() {\n _statss.push_back(std::make_shared<ListenerStats>());\n return *_statss.back();\n }\n\n void addListener(std::unique_ptr<IGidToLidChangeListener> listener) {\n _handler->addListener(std::move(listener));\n }\n\n void notifyPutDone(GlobalId gid, uint32_t lid, SerialNum serialNum) {\n _handler->notifyPutDone(gid, lid, serialNum);\n }\n\n void notifyRemove(GlobalId gid, SerialNum serialNum) {\n _handler->notifyRemove(gid, serialNum);\n }\n\n void notifyRemoveDone(GlobalId gid, SerialNum serialNum) {\n _handler->notifyRemoveDone(gid, serialNum);\n }\n\n void removeListeners(const vespalib::string &docTypeName,\n const std::set<vespalib::string> &keepNames) {\n _handler->removeListeners(docTypeName, keepNames);\n }\n\n};\n\nTEST_F(\"Test that we can register a listener\", Fixture)\n{\n auto &stats = f.addStats();\n auto listener = std::make_unique<MyListener>(stats, \"test\", \"testdoc\");\n TEST_DO(stats.assertListeners(1, 0, 0));\n f.addListener(std::move(listener));\n TEST_DO(stats.assertListeners(1, 1, 0));\n f.notifyPutDone(toGid(doc1), 10, 10);\n TEST_DO(stats.assertChanges(1, 0));\n f.removeListeners(\"testdoc\", {});\n TEST_DO(stats.assertListeners(1, 1, 1));\n}\n\nTEST_F(\"Test that we can register multiple listeners\", Fixture)\n{\n auto &stats1 = f.addStats();\n auto &stats2 = f.addStats();\n auto &stats3 = f.addStats();\n auto listener1 = std::make_unique<MyListener>(stats1, \"test1\", \"testdoc\");\n auto listener2 = std::make_unique<MyListener>(stats2, \"test2\", \"testdoc\");\n auto listener3 = std::make_unique<MyListener>(stats3, \"test3\", \"testdoc2\");\n TEST_DO(stats1.assertListeners(1, 0, 0));\n TEST_DO(stats2.assertListeners(1, 0, 0));\n TEST_DO(stats3.assertListeners(1, 0, 0));\n f.addListener(std::move(listener1));\n f.addListener(std::move(listener2));\n f.addListener(std::move(listener3));\n TEST_DO(stats1.assertListeners(1, 1, 0));\n TEST_DO(stats2.assertListeners(1, 1, 0));\n TEST_DO(stats3.assertListeners(1, 1, 0));\n f.notifyPutDone(toGid(doc1), 10, 10);\n TEST_DO(stats1.assertChanges(1, 0));\n TEST_DO(stats2.assertChanges(1, 0));\n TEST_DO(stats3.assertChanges(1, 0));\n f.removeListeners(\"testdoc\", {\"test1\"});\n TEST_DO(stats1.assertListeners(1, 1, 0));\n TEST_DO(stats2.assertListeners(1, 1, 1));\n TEST_DO(stats3.assertListeners(1, 1, 0));\n f.removeListeners(\"testdoc\", {});\n TEST_DO(stats1.assertListeners(1, 1, 1));\n TEST_DO(stats2.assertListeners(1, 1, 1));\n TEST_DO(stats3.assertListeners(1, 1, 0));\n f.removeListeners(\"testdoc2\", {\"test3\"});\n TEST_DO(stats1.assertListeners(1, 1, 1));\n TEST_DO(stats2.assertListeners(1, 1, 1));\n TEST_DO(stats3.assertListeners(1, 1, 0));\n f.removeListeners(\"testdoc2\", {\"foo\"});\n TEST_DO(stats1.assertListeners(1, 1, 1));\n TEST_DO(stats2.assertListeners(1, 1, 1));\n TEST_DO(stats3.assertListeners(1, 1, 1));\n}\n\nTEST_F(\"Test that we keep old listener when registering duplicate\", Fixture)\n{\n auto &stats = f.addStats();\n auto listener = std::make_unique<MyListener>(stats, \"test1\", \"testdoc\");\n TEST_DO(stats.assertListeners(1, 0, 0));\n f.addListener(std::move(listener));\n TEST_DO(stats.assertListeners(1, 1, 0));\n listener = std::make_unique<MyListener>(stats, \"test1\", \"testdoc\");\n TEST_DO(stats.assertListeners(2, 1, 0));\n f.addListener(std::move(listener));\n TEST_DO(stats.assertListeners(2, 1, 1));\n}\n\nclass StatsFixture : public Fixture\n{\n ListenerStats &_stats;\n\npublic:\n StatsFixture()\n : Fixture(),\n _stats(addStats())\n {\n addListener(std::make_unique<MyListener>(_stats, \"test\", \"testdoc\"));\n }\n\n ~StatsFixture()\n {\n removeListeners(\"testdoc\", {});\n }\n\n void assertChanges(uint32_t expPutChanges, uint32_t expRemoveChanges)\n {\n TEST_DO(_stats.assertChanges(expPutChanges, expRemoveChanges));\n }\n};\n\nTEST_F(\"Test that put is ignored if we have a pending remove\", StatsFixture)\n{\n f.notifyRemove(toGid(doc1), 20);\n TEST_DO(f.assertChanges(0, 1));\n f.notifyPutDone(toGid(doc1), 10, 10);\n TEST_DO(f.assertChanges(0, 1));\n f.notifyRemoveDone(toGid(doc1), 20);\n TEST_DO(f.assertChanges(0, 1));\n f.notifyPutDone(toGid(doc1), 11, 30);\n TEST_DO(f.assertChanges(1, 1));\n}\n\nTEST_F(\"Test that pending removes are merged\", StatsFixture)\n{\n f.notifyRemove(toGid(doc1), 20);\n TEST_DO(f.assertChanges(0, 1));\n f.notifyRemove(toGid(doc1), 40);\n TEST_DO(f.assertChanges(0, 1));\n f.notifyPutDone(toGid(doc1), 10, 10);\n TEST_DO(f.assertChanges(0, 1));\n f.notifyRemoveDone(toGid(doc1), 20);\n TEST_DO(f.assertChanges(0, 1));\n f.notifyPutDone(toGid(doc1), 11, 30);\n TEST_DO(f.assertChanges(0, 1));\n f.notifyRemoveDone(toGid(doc1), 40);\n TEST_DO(f.assertChanges(0, 1));\n f.notifyPutDone(toGid(doc1), 12, 50);\n TEST_DO(f.assertChanges(1, 1));\n}\n\nTEST_F(\"Test that out of order notifyRemoveDone is handled\", StatsFixture)\n{\n f.notifyRemove(toGid(doc1), 20);\n TEST_DO(f.assertChanges(0, 1));\n f.notifyRemove(toGid(doc1), 40);\n TEST_DO(f.assertChanges(0, 1));\n f.notifyRemoveDone(toGid(doc1), 40);\n TEST_DO(f.assertChanges(0, 1));\n f.notifyRemoveDone(toGid(doc1), 20);\n TEST_DO(f.assertChanges(0, 1));\n f.notifyPutDone(toGid(doc1), 12, 50);\n TEST_DO(f.assertChanges(1, 1));\n}\n\nTEST_F(\"Test that out of order notifyPutDone is handled\", StatsFixture)\n{\n f.notifyRemove(toGid(doc1), 20);\n TEST_DO(f.assertChanges(0, 1));\n f.notifyPutDone(toGid(doc1), 12, 50);\n TEST_DO(f.assertChanges(1, 1));\n f.notifyRemoveDone(toGid(doc1), 20);\n TEST_DO(f.assertChanges(1, 1));\n}\n\n}\n\nTEST_MAIN()\n{\n TEST_RUN_ALL();\n}\n<|endoftext|>"} {"text":"<commit_before>f74f6414-2e4e-11e5-9284-b827eb9e62be<commit_msg>f7545eec-2e4e-11e5-9284-b827eb9e62be<commit_after>f7545eec-2e4e-11e5-9284-b827eb9e62be<|endoftext|>"} {"text":"<commit_before>\/\/ $Id$\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\/\/ Local includes\n#include \"elem.h\"\n#include \"fe.h\"\n#include \"fe_interface.h\"\n\nnamespace libMesh\n{\n\n \/\/ ------------------------------------------------------------\n \/\/ Hierarchic-specific implementations\n\n \/\/ Anonymous namespace for local helper functions\n namespace {\n\n void l2_hierarchic_nodal_soln(const Elem* elem,\n\t\t\t\t const Order order,\n\t\t\t\t const std::vector<Number>& elem_soln,\n\t\t\t\t std::vector<Number>& nodal_soln,\n\t\t\t\t unsigned Dim)\n {\n const unsigned int n_nodes = elem->n_nodes();\n\n const ElemType elem_type = elem->type();\n\n nodal_soln.resize(n_nodes);\n\n const Order totalorder = static_cast<Order>(order + elem->p_level());\n\n \/\/ FEType object to be passed to various FEInterface functions below.\n FEType fe_type(totalorder, L2_HIERARCHIC);\n\n switch (totalorder)\n\t{\n\t \/\/ Constant shape functions\n\tcase CONSTANT:\n\t {\n\t libmesh_assert (elem_soln.size() == 1);\n\n\t const Number val = elem_soln[0];\n\n\t for (unsigned int n=0; n<n_nodes; n++)\n\t nodal_soln[n] = val;\n\n\t return;\n\t }\n\n\n\t \/\/ For other orders do interpolation at the nodes\n\t \/\/ explicitly.\n\tdefault:\n\t {\n\n\t const unsigned int n_sf =\n\t \/\/ FE<Dim,T>::n_shape_functions(elem_type, totalorder);\n\t FEInterface::n_shape_functions(Dim, fe_type, elem_type);\n\n\t for (unsigned int n=0; n<n_nodes; n++)\n\t {\n\t\tconst Point mapped_point =\n\t\t \/\/ FE<Dim,T>::inverse_map(elem, elem->point(n));\n\t\t FEInterface::inverse_map(Dim, fe_type, elem, elem->point(n));\n\n\t\tlibmesh_assert (elem_soln.size() == n_sf);\n\n\t\t\/\/ Zero before summation\n\t\tnodal_soln[n] = 0;\n\n\t\t\/\/ u_i = Sum (alpha_i phi_i)\n\t\tfor (unsigned int i=0; i<n_sf; i++)\n\t\t nodal_soln[n] += elem_soln[i] *\n\t\t \/\/ FE<Dim,T>::shape(elem, order, i, mapped_point);\n\t\t FEInterface::shape(Dim, fe_type, elem, i, mapped_point);\n\t }\n\n\t return;\n\t }\n\t}\n } \/\/ l2_hierarchic_nodal_soln()\n\n\n\n\n unsigned int l2_hierarchic_n_dofs(const ElemType t, const Order o)\n {\n libmesh_assert (o > 0);\n switch (t)\n\t{\n\tcase NODEELEM:\n\t return 1;\n\tcase EDGE2:\n\tcase EDGE3:\n\t return (o+1);\n\tcase QUAD4:\n\tcase QUAD8:\n\tcase QUAD9:\n\t return ((o+1)*(o+1));\n\tcase HEX8:\n\tcase HEX20:\n\tcase HEX27:\n\t return ((o+1)*(o+1)*(o+1));\n\tcase TRI6:\n\t return ((o+1)*(o+2)\/2);\n\tdefault:\n\t libmesh_error();\n\t}\n\n libmesh_error();\n return 0;\n } \/\/ l2_hierarchic_n_dofs()\n\n\n\n unsigned int l2_hierarchic_n_dofs_per_elem(const ElemType t,\n\t\t\t\t\t const Order o)\n {\n return l2_hierarchic_n_dofs(t, o);\n } \/\/ l2_hierarchic_n_dofs_per_elem()\n\n } \/\/ anonymous namespace\n\n\n\n\n \/\/ Do full-specialization of nodal_soln() function for every\n \/\/ dimension, instead of explicit instantiation at the end of this\n \/\/ file.\n \/\/ This could be macro-ified so that it fits on one line...\n template <>\n void FE<0,L2_HIERARCHIC>::nodal_soln(const Elem* elem,\n\t\t\t\t const Order order,\n\t\t\t\t const std::vector<Number>& elem_soln,\n\t\t\t\t std::vector<Number>& nodal_soln)\n { l2_hierarchic_nodal_soln(elem, order, elem_soln, nodal_soln, \/*Dim=*\/0); }\n\n template <>\n void FE<1,L2_HIERARCHIC>::nodal_soln(const Elem* elem,\n\t\t\t\t const Order order,\n\t\t\t\t const std::vector<Number>& elem_soln,\n\t\t\t\t std::vector<Number>& nodal_soln)\n { l2_hierarchic_nodal_soln(elem, order, elem_soln, nodal_soln, \/*Dim=*\/1); }\n\n template <>\n void FE<2,L2_HIERARCHIC>::nodal_soln(const Elem* elem,\n\t\t\t\t const Order order,\n\t\t\t\t const std::vector<Number>& elem_soln,\n\t\t\t\t std::vector<Number>& nodal_soln)\n { l2_hierarchic_nodal_soln(elem, order, elem_soln, nodal_soln, \/*Dim=*\/2); }\n\n template <>\n void FE<3,L2_HIERARCHIC>::nodal_soln(const Elem* elem,\n\t\t\t\t const Order order,\n\t\t\t\t const std::vector<Number>& elem_soln,\n\t\t\t\t std::vector<Number>& nodal_soln)\n { l2_hierarchic_nodal_soln(elem, order, elem_soln, nodal_soln, \/*Dim=*\/3); }\n\n \/\/ Full specialization of n_dofs() function for every dimension\n template <> unsigned int FE<0,L2_HIERARCHIC>::n_dofs(const ElemType t, const Order o) { return l2_hierarchic_n_dofs(t, o); }\n template <> unsigned int FE<1,L2_HIERARCHIC>::n_dofs(const ElemType t, const Order o) { return l2_hierarchic_n_dofs(t, o); }\n template <> unsigned int FE<2,L2_HIERARCHIC>::n_dofs(const ElemType t, const Order o) { return l2_hierarchic_n_dofs(t, o); }\n template <> unsigned int FE<3,L2_HIERARCHIC>::n_dofs(const ElemType t, const Order o) { return l2_hierarchic_n_dofs(t, o); }\n\n \/\/ Full specialization of n_dofs_at_node() function for every dimension.\n \/\/ Discontinuous L2 elements only have interior nodes\n template <> unsigned int FE<0,L2_HIERARCHIC>::n_dofs_at_node(const ElemType, const Order, const unsigned int) { return 0; }\n template <> unsigned int FE<1,L2_HIERARCHIC>::n_dofs_at_node(const ElemType, const Order, const unsigned int) { return 0; }\n template <> unsigned int FE<2,L2_HIERARCHIC>::n_dofs_at_node(const ElemType, const Order, const unsigned int) { return 0; }\n template <> unsigned int FE<3,L2_HIERARCHIC>::n_dofs_at_node(const ElemType, const Order, const unsigned int) { return 0; }\n\n \/\/ Full specialization of n_dofs_per_elem() function for every dimension.\n template <> unsigned int FE<0,L2_HIERARCHIC>::n_dofs_per_elem(const ElemType t, const Order o) { return l2_hierarchic_n_dofs(t, o); }\n template <> unsigned int FE<1,L2_HIERARCHIC>::n_dofs_per_elem(const ElemType t, const Order o) { return l2_hierarchic_n_dofs(t, o); }\n template <> unsigned int FE<2,L2_HIERARCHIC>::n_dofs_per_elem(const ElemType t, const Order o) { return l2_hierarchic_n_dofs(t, o); }\n template <> unsigned int FE<3,L2_HIERARCHIC>::n_dofs_per_elem(const ElemType t, const Order o) { return l2_hierarchic_n_dofs(t, o); }\n\n \/\/ L2 Hierarchic FEMs are C^0 continuous\n template <> FEContinuity FE<0,L2_HIERARCHIC>::get_continuity() const { return C_ZERO; }\n template <> FEContinuity FE<1,L2_HIERARCHIC>::get_continuity() const { return C_ZERO; }\n template <> FEContinuity FE<2,L2_HIERARCHIC>::get_continuity() const { return C_ZERO; }\n template <> FEContinuity FE<3,L2_HIERARCHIC>::get_continuity() const { return C_ZERO; }\n\n \/\/ L2 Hierarchic FEMs are hierarchic (duh!)\n template <> bool FE<0,L2_HIERARCHIC>::is_hierarchic() const { return true; }\n template <> bool FE<1,L2_HIERARCHIC>::is_hierarchic() const { return true; }\n template <> bool FE<2,L2_HIERARCHIC>::is_hierarchic() const { return true; }\n template <> bool FE<3,L2_HIERARCHIC>::is_hierarchic() const { return true; }\n\n#ifdef LIBMESH_ENABLE_AMR\n \/\/ compute_constraints() specializations are only needed for 2 and 3D\n template <>\n void FE<2,L2_HIERARCHIC>::compute_constraints (DofConstraints &constraints,\n\t\t\t\t\t\t DofMap &dof_map,\n\t\t\t\t\t\t const unsigned int variable_number,\n\t\t\t\t\t\t const Elem* elem)\n { compute_proj_constraints(constraints, dof_map, variable_number, elem); }\n\n template <>\n void FE<3,L2_HIERARCHIC>::compute_constraints (DofConstraints &constraints,\n\t\t\t\t\t\t DofMap &dof_map,\n\t\t\t\t\t\t const unsigned int variable_number,\n\t\t\t\t\t\t const Elem* elem)\n { compute_proj_constraints(constraints, dof_map, variable_number, elem); }\n#endif \/\/ #ifdef LIBMESH_ENABLE_AMR\n\n \/\/ L2-Hierarchic FEM shapes need reinit\n template <> bool FE<0,L2_HIERARCHIC>::shapes_need_reinit() const { return true; }\n template <> bool FE<1,L2_HIERARCHIC>::shapes_need_reinit() const { return true; }\n template <> bool FE<2,L2_HIERARCHIC>::shapes_need_reinit() const { return true; }\n template <> bool FE<3,L2_HIERARCHIC>::shapes_need_reinit() const { return true; }\n\n} \/\/ namespace libMesh\n<commit_msg>Reverting Truman's fix; it was redundant after mine<commit_after>\/\/ $Id$\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\/\/ Local includes\n#include \"elem.h\"\n#include \"fe.h\"\n#include \"fe_interface.h\"\n\nnamespace libMesh\n{\n\n \/\/ ------------------------------------------------------------\n \/\/ Hierarchic-specific implementations\n\n \/\/ Anonymous namespace for local helper functions\n namespace {\n\n void l2_hierarchic_nodal_soln(const Elem* elem,\n\t\t\t\t const Order order,\n\t\t\t\t const std::vector<Number>& elem_soln,\n\t\t\t\t std::vector<Number>& nodal_soln,\n\t\t\t\t unsigned Dim)\n {\n const unsigned int n_nodes = elem->n_nodes();\n\n const ElemType elem_type = elem->type();\n\n nodal_soln.resize(n_nodes);\n\n const Order totalorder = static_cast<Order>(order + elem->p_level());\n\n \/\/ FEType object to be passed to various FEInterface functions below.\n FEType fe_type(totalorder, L2_HIERARCHIC);\n\n switch (totalorder)\n\t{\n\t \/\/ Constant shape functions\n\tcase CONSTANT:\n\t {\n\t libmesh_assert (elem_soln.size() == 1);\n\n\t const Number val = elem_soln[0];\n\n\t for (unsigned int n=0; n<n_nodes; n++)\n\t nodal_soln[n] = val;\n\n\t return;\n\t }\n\n\n\t \/\/ For other orders do interpolation at the nodes\n\t \/\/ explicitly.\n\tdefault:\n\t {\n\n\t const unsigned int n_sf =\n\t \/\/ FE<Dim,T>::n_shape_functions(elem_type, totalorder);\n\t FEInterface::n_shape_functions(Dim, fe_type, elem_type);\n\n\t for (unsigned int n=0; n<n_nodes; n++)\n\t {\n\t\tconst Point mapped_point =\n\t\t \/\/ FE<Dim,T>::inverse_map(elem, elem->point(n));\n\t\t FEInterface::inverse_map(Dim, fe_type, elem, elem->point(n));\n\n\t\tlibmesh_assert (elem_soln.size() == n_sf);\n\n\t\t\/\/ Zero before summation\n\t\tnodal_soln[n] = 0;\n\n\t\t\/\/ u_i = Sum (alpha_i phi_i)\n\t\tfor (unsigned int i=0; i<n_sf; i++)\n\t\t nodal_soln[n] += elem_soln[i] *\n\t\t \/\/ FE<Dim,T>::shape(elem, order, i, mapped_point);\n\t\t FEInterface::shape(Dim, fe_type, elem, i, mapped_point);\n\t }\n\n\t return;\n\t }\n\t}\n } \/\/ l2_hierarchic_nodal_soln()\n\n\n\n\n unsigned int l2_hierarchic_n_dofs(const ElemType t, const Order o)\n {\n libmesh_assert (o > 0);\n switch (t)\n\t{\n\tcase NODEELEM:\n\t return 1;\n\tcase EDGE2:\n\tcase EDGE3:\n\t return (o+1);\n\tcase QUAD4:\n\tcase QUAD8:\n\tcase QUAD9:\n\t return ((o+1)*(o+1));\n\tcase HEX8:\n\tcase HEX20:\n\tcase HEX27:\n\t return ((o+1)*(o+1)*(o+1));\n\tcase TRI6:\n\t return ((o+1)*(o+2)\/2);\n\tdefault:\n\t libmesh_error();\n\t}\n\n libmesh_error();\n return 0;\n } \/\/ l2_hierarchic_n_dofs()\n\n\n } \/\/ anonymous namespace\n\n\n\n\n \/\/ Do full-specialization of nodal_soln() function for every\n \/\/ dimension, instead of explicit instantiation at the end of this\n \/\/ file.\n \/\/ This could be macro-ified so that it fits on one line...\n template <>\n void FE<0,L2_HIERARCHIC>::nodal_soln(const Elem* elem,\n\t\t\t\t const Order order,\n\t\t\t\t const std::vector<Number>& elem_soln,\n\t\t\t\t std::vector<Number>& nodal_soln)\n { l2_hierarchic_nodal_soln(elem, order, elem_soln, nodal_soln, \/*Dim=*\/0); }\n\n template <>\n void FE<1,L2_HIERARCHIC>::nodal_soln(const Elem* elem,\n\t\t\t\t const Order order,\n\t\t\t\t const std::vector<Number>& elem_soln,\n\t\t\t\t std::vector<Number>& nodal_soln)\n { l2_hierarchic_nodal_soln(elem, order, elem_soln, nodal_soln, \/*Dim=*\/1); }\n\n template <>\n void FE<2,L2_HIERARCHIC>::nodal_soln(const Elem* elem,\n\t\t\t\t const Order order,\n\t\t\t\t const std::vector<Number>& elem_soln,\n\t\t\t\t std::vector<Number>& nodal_soln)\n { l2_hierarchic_nodal_soln(elem, order, elem_soln, nodal_soln, \/*Dim=*\/2); }\n\n template <>\n void FE<3,L2_HIERARCHIC>::nodal_soln(const Elem* elem,\n\t\t\t\t const Order order,\n\t\t\t\t const std::vector<Number>& elem_soln,\n\t\t\t\t std::vector<Number>& nodal_soln)\n { l2_hierarchic_nodal_soln(elem, order, elem_soln, nodal_soln, \/*Dim=*\/3); }\n\n \/\/ Full specialization of n_dofs() function for every dimension\n template <> unsigned int FE<0,L2_HIERARCHIC>::n_dofs(const ElemType t, const Order o) { return l2_hierarchic_n_dofs(t, o); }\n template <> unsigned int FE<1,L2_HIERARCHIC>::n_dofs(const ElemType t, const Order o) { return l2_hierarchic_n_dofs(t, o); }\n template <> unsigned int FE<2,L2_HIERARCHIC>::n_dofs(const ElemType t, const Order o) { return l2_hierarchic_n_dofs(t, o); }\n template <> unsigned int FE<3,L2_HIERARCHIC>::n_dofs(const ElemType t, const Order o) { return l2_hierarchic_n_dofs(t, o); }\n\n \/\/ Full specialization of n_dofs_at_node() function for every dimension.\n \/\/ Discontinuous L2 elements only have interior nodes\n template <> unsigned int FE<0,L2_HIERARCHIC>::n_dofs_at_node(const ElemType, const Order, const unsigned int) { return 0; }\n template <> unsigned int FE<1,L2_HIERARCHIC>::n_dofs_at_node(const ElemType, const Order, const unsigned int) { return 0; }\n template <> unsigned int FE<2,L2_HIERARCHIC>::n_dofs_at_node(const ElemType, const Order, const unsigned int) { return 0; }\n template <> unsigned int FE<3,L2_HIERARCHIC>::n_dofs_at_node(const ElemType, const Order, const unsigned int) { return 0; }\n\n \/\/ Full specialization of n_dofs_per_elem() function for every dimension.\n template <> unsigned int FE<0,L2_HIERARCHIC>::n_dofs_per_elem(const ElemType t, const Order o) { return l2_hierarchic_n_dofs(t, o); }\n template <> unsigned int FE<1,L2_HIERARCHIC>::n_dofs_per_elem(const ElemType t, const Order o) { return l2_hierarchic_n_dofs(t, o); }\n template <> unsigned int FE<2,L2_HIERARCHIC>::n_dofs_per_elem(const ElemType t, const Order o) { return l2_hierarchic_n_dofs(t, o); }\n template <> unsigned int FE<3,L2_HIERARCHIC>::n_dofs_per_elem(const ElemType t, const Order o) { return l2_hierarchic_n_dofs(t, o); }\n\n \/\/ L2 Hierarchic FEMs are C^0 continuous\n template <> FEContinuity FE<0,L2_HIERARCHIC>::get_continuity() const { return C_ZERO; }\n template <> FEContinuity FE<1,L2_HIERARCHIC>::get_continuity() const { return C_ZERO; }\n template <> FEContinuity FE<2,L2_HIERARCHIC>::get_continuity() const { return C_ZERO; }\n template <> FEContinuity FE<3,L2_HIERARCHIC>::get_continuity() const { return C_ZERO; }\n\n \/\/ L2 Hierarchic FEMs are hierarchic (duh!)\n template <> bool FE<0,L2_HIERARCHIC>::is_hierarchic() const { return true; }\n template <> bool FE<1,L2_HIERARCHIC>::is_hierarchic() const { return true; }\n template <> bool FE<2,L2_HIERARCHIC>::is_hierarchic() const { return true; }\n template <> bool FE<3,L2_HIERARCHIC>::is_hierarchic() const { return true; }\n\n#ifdef LIBMESH_ENABLE_AMR\n \/\/ compute_constraints() specializations are only needed for 2 and 3D\n template <>\n void FE<2,L2_HIERARCHIC>::compute_constraints (DofConstraints &constraints,\n\t\t\t\t\t\t DofMap &dof_map,\n\t\t\t\t\t\t const unsigned int variable_number,\n\t\t\t\t\t\t const Elem* elem)\n { compute_proj_constraints(constraints, dof_map, variable_number, elem); }\n\n template <>\n void FE<3,L2_HIERARCHIC>::compute_constraints (DofConstraints &constraints,\n\t\t\t\t\t\t DofMap &dof_map,\n\t\t\t\t\t\t const unsigned int variable_number,\n\t\t\t\t\t\t const Elem* elem)\n { compute_proj_constraints(constraints, dof_map, variable_number, elem); }\n#endif \/\/ #ifdef LIBMESH_ENABLE_AMR\n\n \/\/ L2-Hierarchic FEM shapes need reinit\n template <> bool FE<0,L2_HIERARCHIC>::shapes_need_reinit() const { return true; }\n template <> bool FE<1,L2_HIERARCHIC>::shapes_need_reinit() const { return true; }\n template <> bool FE<2,L2_HIERARCHIC>::shapes_need_reinit() const { return true; }\n template <> bool FE<3,L2_HIERARCHIC>::shapes_need_reinit() const { return true; }\n\n} \/\/ namespace libMesh\n<|endoftext|>"} {"text":"<commit_before>9d4c75c4-2e4e-11e5-9284-b827eb9e62be<commit_msg>9d51bd54-2e4e-11e5-9284-b827eb9e62be<commit_after>9d51bd54-2e4e-11e5-9284-b827eb9e62be<|endoftext|>"} {"text":"<commit_before>\/\/ Copyright 2011 Gregory Szorc\n\/\/\n\/\/ Licensed under the Apache License, Version 2.0 (the \"License\");\n\/\/ you may not use this file except in compliance with the License.\n\/\/ You may obtain a copy of the License at\n\/\/\n\/\/ http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n\/\/\n\/\/ Unless required by applicable law or agreed to in writing, software\n\/\/ distributed under the License is distributed on an \"AS IS\" BASIS,\n\/\/ WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n\/\/ See the License for the specific language governing permissions and\n\/\/ limitations under the License.\n\n#ifndef ZIPPYLOG_DEVICE_HPP_\n#define ZIPPYLOG_DEVICE_HPP_\n\n#include <zippylog\/zippylog.hpp>\n#include <zippylog\/platform.hpp>\n\nnamespace zippylog {\nnamespace device {\n\n\/\/\/ Represents the result of a Pump() operation in a Device\n\/\/\/\n\/\/\/ See Device::Pump() for more\nclass ZIPPYLOG_EXPORT PumpResult {\npublic:\n static PumpResult MakeWorkDone();\n static PumpResult MakeNoWorkDone();\n static PumpResult MakeError();\n\n inline bool IsError() { return this->is_error; }\n\nprivate:\n PumpResult() : is_error(false) { }\n\n bool is_error;\n};\n\n\/\/\/ An entity that performs work\n\/\/\/\n\/\/\/ Devices are entities that perform specific functionality. Devices\n\/\/\/ communicate with other entities and devices via 0MQ sockets. In other\n\/\/\/ words, devices send their output via 0MQ sockets and typically receive\n\/\/\/ their input via 0MQ sockets. This being said, the behavior is not\n\/\/\/ enforced, so devices could operate using other means, for example.\n\/\/\/\n\/\/\/ This class is an abstract base class to be used by real devices. It\n\/\/\/ defines a core API and a set of functions which must be defined on\n\/\/\/ all derived devices.\n\/\/\/\nclass ZIPPYLOG_EXPORT Device {\npublic:\n \/\/\/ Base constructor\n \/\/\/\n \/\/\/ Should be called by child classes in their constructors\n Device(::zippylog::platform::ConditionalWait *cw);\n\n \/\/\/ Base class destructor\n virtual ~Device();\n\n \/\/\/ Performs pending work\n \/\/\/\n \/\/\/ This is the most important function in a device because it is what\n \/\/\/ triggers the device to perform work. From within this function, an\n \/\/\/ implementation should process pending work or wait for work to become\n \/\/\/ available until the timeout specified.\n \/\/\/\n \/\/\/ It is important for devices to honor the timeout threshold, otherwise\n \/\/\/ the device breaks its API contract, which may have negative impact on\n \/\/\/ performance, latency, etc.\n \/\/\/\n \/\/\/ @param timeout_microseconds How long to wait for work to become\n \/\/\/ available before giving up\n virtual PumpResult Pump(int32 timeout_microseconds) = 0;\n\n \/\/\/ Runs the device forever\n \/\/\/\n \/\/\/ The device runs until the semaphore defined by the constructor\n \/\/\/ signals. If the semaphore has not been defined, an error is thrown.\n \/\/\/\n \/\/\/ Calling this function is equivalent to calling Pump() inside an\n \/\/\/ infinite loop.\n void Run();\n\n \/\/\/ Runs the device asynchronously on a new thread\n \/\/\/\n \/\/\/ This function will spawn a new thread and have the device execute\n \/\/\/ continuously on that thread.\n \/\/\/\n \/\/\/ The function does not return until after OnRunStart() finishes.\n \/\/\/ This gives devices an opportunity to fully initialize on their new\n \/\/\/ thread before program execution continues.\n \/\/\/\n \/\/\/ To stop this thread, call StopAsync().\n void RunAsync();\n\n \/\/\/ Stops the device from executing on a background thread\n \/\/\/\n \/\/\/ This is the inverse of RunAsync(). It will signal the device to stop\n \/\/\/ and terminate the spawned thread. When the function returns, the\n \/\/\/ thread is guaranteed to be shut down.\n \/\/\/\n \/\/\/ @param join_timeout How long to wait for the thread to join before\n \/\/\/ resorting to an abort, in microseconds\n void StopAsync(int32 join_timeout = 1000000);\n\n \/\/\/ Query to see if the device is running\n \/\/\/\n \/\/\/ @return true if device is running. false if not\n inline bool IsRunning() { return this->running; }\n\nprotected:\n\n \/\/\/ Called when the device first runs\n \/\/\/\n \/\/\/ This can be used to perform one-time object setup. Execution occurs\n \/\/\/ on the new thread if running asynchronously.\n virtual void OnFirstRun();\n\n \/\/\/ Called at the start of Run() and RunAsync()\n \/\/\/\n \/\/\/ Child classes should define this to perform commands every time Run()\n \/\/\/ is called.\n virtual void OnRunStart();\n\n \/\/\/ Called at the end of Run() and StopAsync()\n \/\/\/\n \/\/\/ This function should perform cleanup actions\n virtual void OnRunFinish();\n\nprivate:\n \/\/\/ Function that gets executed when RunAsync() is called\n \/\/\/\n \/\/\/ @param data this pointer to Device instance\n static void * AsyncExecStart(void *data);\n\n \/\/\/ Background thread device executes on\n \/\/\/\n \/\/\/ This will only be defined if RunAsync() is called.\n ::zippylog::platform::Thread *thread;\n\n ::zippylog::platform::ConditionalWait *cw;\n\n \/\/\/ Whether the device is running\n bool running;\n\n \/\/\/ Whether Run() has executed before\n bool has_ran;\n\n \/\/\/ Used by RunAsync() so function blocks until after OnRunStart() is\n \/\/\/ finished\n ::zippylog::platform::ConditionalWait async_wait;\n\n \/\/\/ Disable copy constructor and assignment operator\n Device(Device const &orig);\n Device & operator=(Device const &orig);\n};\n\n}} \/\/ namespace\n\n#endif \/\/ file include<commit_msg>document socket migration w\/ 0MQ 2.0.x<commit_after>\/\/ Copyright 2011 Gregory Szorc\n\/\/\n\/\/ Licensed under the Apache License, Version 2.0 (the \"License\");\n\/\/ you may not use this file except in compliance with the License.\n\/\/ You may obtain a copy of the License at\n\/\/\n\/\/ http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n\/\/\n\/\/ Unless required by applicable law or agreed to in writing, software\n\/\/ distributed under the License is distributed on an \"AS IS\" BASIS,\n\/\/ WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n\/\/ See the License for the specific language governing permissions and\n\/\/ limitations under the License.\n\n#ifndef ZIPPYLOG_DEVICE_HPP_\n#define ZIPPYLOG_DEVICE_HPP_\n\n#include <zippylog\/zippylog.hpp>\n#include <zippylog\/platform.hpp>\n\nnamespace zippylog {\nnamespace device {\n\n\/\/\/ Represents the result of a Pump() operation in a Device\n\/\/\/\n\/\/\/ See Device::Pump() for more\nclass ZIPPYLOG_EXPORT PumpResult {\npublic:\n static PumpResult MakeWorkDone();\n static PumpResult MakeNoWorkDone();\n static PumpResult MakeError();\n\n inline bool IsError() { return this->is_error; }\n\nprivate:\n PumpResult() : is_error(false) { }\n\n bool is_error;\n};\n\n\/\/\/ An entity that performs work\n\/\/\/\n\/\/\/ Devices are entities that perform specific functionality. Devices\n\/\/\/ communicate with other entities and devices via 0MQ sockets. In other\n\/\/\/ words, devices send their output via 0MQ sockets and typically receive\n\/\/\/ their input via 0MQ sockets. This being said, the behavior is not\n\/\/\/ enforced, so devices could operate using other means, for example.\n\/\/\/\n\/\/\/ This class is an abstract base class to be used by real devices. It\n\/\/\/ defines a core API and a set of functions which must be defined on\n\/\/\/ all derived devices.\n\/\/\/\n\/\/\/ In 0MQ 2.0.x, 0MQ sockets cannot be migrated between threads. Since\n\/\/\/ devices are constructed on one thread and can run on another, it is\n\/\/\/ important for the constructor not to initialize 0MQ sockets. Instead,\n\/\/\/ it is recommended to initialize sockets inside the OnFirstRun() handler,\n\/\/\/ which will only be called once.\n\/\/\/\nclass ZIPPYLOG_EXPORT Device {\npublic:\n \/\/\/ Base constructor\n \/\/\/\n \/\/\/ Should be called by child classes in their constructors\n Device(::zippylog::platform::ConditionalWait *cw);\n\n \/\/\/ Base class destructor\n virtual ~Device();\n\n \/\/\/ Performs pending work\n \/\/\/\n \/\/\/ This is the most important function in a device because it is what\n \/\/\/ triggers the device to perform work. From within this function, an\n \/\/\/ implementation should process pending work or wait for work to become\n \/\/\/ available until the timeout specified.\n \/\/\/\n \/\/\/ It is important for devices to honor the timeout threshold, otherwise\n \/\/\/ the device breaks its API contract, which may have negative impact on\n \/\/\/ performance, latency, etc.\n \/\/\/\n \/\/\/ @param timeout_microseconds How long to wait for work to become\n \/\/\/ available before giving up\n virtual PumpResult Pump(int32 timeout_microseconds) = 0;\n\n \/\/\/ Runs the device forever\n \/\/\/\n \/\/\/ The device runs until the semaphore defined by the constructor\n \/\/\/ signals. If the semaphore has not been defined, an error is thrown.\n \/\/\/\n \/\/\/ Calling this function is equivalent to calling Pump() inside an\n \/\/\/ infinite loop.\n void Run();\n\n \/\/\/ Runs the device asynchronously on a new thread\n \/\/\/\n \/\/\/ This function will spawn a new thread and have the device execute\n \/\/\/ continuously on that thread.\n \/\/\/\n \/\/\/ The function does not return until after OnRunStart() finishes.\n \/\/\/ This gives devices an opportunity to fully initialize on their new\n \/\/\/ thread before program execution continues.\n \/\/\/\n \/\/\/ To stop this thread, call StopAsync().\n void RunAsync();\n\n \/\/\/ Stops the device from executing on a background thread\n \/\/\/\n \/\/\/ This is the inverse of RunAsync(). It will signal the device to stop\n \/\/\/ and terminate the spawned thread. When the function returns, the\n \/\/\/ thread is guaranteed to be shut down.\n \/\/\/\n \/\/\/ @param join_timeout How long to wait for the thread to join before\n \/\/\/ resorting to an abort, in microseconds\n void StopAsync(int32 join_timeout = 1000000);\n\n \/\/\/ Query to see if the device is running\n \/\/\/\n \/\/\/ @return true if device is running. false if not\n inline bool IsRunning() { return this->running; }\n\nprotected:\n\n \/\/\/ Called when the device first runs\n \/\/\/\n \/\/\/ This can be used to perform one-time object setup. Execution occurs\n \/\/\/ on the new thread if running asynchronously.\n virtual void OnFirstRun();\n\n \/\/\/ Called at the start of Run() and RunAsync()\n \/\/\/\n \/\/\/ Child classes should define this to perform commands every time Run()\n \/\/\/ is called.\n virtual void OnRunStart();\n\n \/\/\/ Called at the end of Run() and StopAsync()\n \/\/\/\n \/\/\/ This function should perform cleanup actions\n virtual void OnRunFinish();\n\nprivate:\n \/\/\/ Function that gets executed when RunAsync() is called\n \/\/\/\n \/\/\/ @param data this pointer to Device instance\n static void * AsyncExecStart(void *data);\n\n \/\/\/ Background thread device executes on\n \/\/\/\n \/\/\/ This will only be defined if RunAsync() is called.\n ::zippylog::platform::Thread *thread;\n\n ::zippylog::platform::ConditionalWait *cw;\n\n \/\/\/ Whether the device is running\n bool running;\n\n \/\/\/ Whether Run() has executed before\n bool has_ran;\n\n \/\/\/ Used by RunAsync() so function blocks until after OnRunStart() is\n \/\/\/ finished\n ::zippylog::platform::ConditionalWait async_wait;\n\n \/\/\/ Disable copy constructor and assignment operator\n Device(Device const &orig);\n Device & operator=(Device const &orig);\n};\n\n}} \/\/ namespace\n\n#endif \/\/ file include<|endoftext|>"} {"text":"<commit_before>1746b65c-2e4d-11e5-9284-b827eb9e62be<commit_msg>174be4f6-2e4d-11e5-9284-b827eb9e62be<commit_after>174be4f6-2e4d-11e5-9284-b827eb9e62be<|endoftext|>"} {"text":"<commit_before>\/\/ -*-Mode: C++;-*-\n\n\/\/ * BeginRiceCopyright *****************************************************\n\/\/\n\/\/ $HeadURL$\n\/\/ $Id$\n\/\/\n\/\/ --------------------------------------------------------------------------\n\/\/ Part of HPCToolkit (hpctoolkit.org)\n\/\/\n\/\/ Information about sources of support for research and development of\n\/\/ HPCToolkit is at 'hpctoolkit.org' and in 'README.Acknowledgments'.\n\/\/ --------------------------------------------------------------------------\n\/\/\n\/\/ Copyright ((c)) 2002-2018, Rice University\n\/\/ All rights reserved.\n\/\/\n\/\/ Redistribution and use in source and binary forms, with or without\n\/\/ modification, are permitted provided that the following conditions are\n\/\/ met:\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 Rice University (RICE) 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 RICE and contributors \"as is\" and any\n\/\/ express or implied warranties, including, but not limited to, the\n\/\/ implied warranties of merchantability and fitness for a particular\n\/\/ purpose are disclaimed. In no event shall RICE 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\n\/\/ business interruption) however caused and on any theory of liability,\n\/\/ whether in contract, strict liability, or tort (including negligence\n\/\/ or otherwise) arising in any way out of the use of this software, even\n\/\/ if advised of the possibility of such damage.\n\/\/\n\/\/ ******************************************************* EndRiceCopyright *\n\n\/\/***************************************************************************\n\/\/\n\/\/ File:\n\/\/ $HeadURL$\n\/\/\n\/\/ Purpose:\n\/\/ [The purpose of this file]\n\/\/\n\/\/ Description:\n\/\/ [The set of functions, macros, etc. defined in the file]\n\/\/\n\/\/***************************************************************************\n\n\/\/**************************** MPI Include Files ****************************\n\n#include <mpi.h>\n\n\/\/************************* System Include Files ****************************\n\n#include <iostream>\n\n#include <string>\nusing std::string;\n\n#include <algorithm>\n\n#include <stdint.h>\n\n\/\/*************************** User Include Files ****************************\n\n#include <include\/uint.h>\n\n#include \"ParallelAnalysis.hpp\"\n\n#include <lib\/analysis\/CallPath.hpp>\n#include <lib\/analysis\/Util.hpp>\n\n#include <lib\/support\/diagnostics.h>\n#include <lib\/support\/StrUtil.hpp>\n\n\n\/\/*************************** Forward Declarations **************************\n\n#define DBG_CCT_MERGE 0\n\n\/\/***************************************************************************\n\n\nnamespace ParallelAnalysis {\n\n\/\/***************************************************************************\n\/\/ forward declarations\n\/\/***************************************************************************\n\nstatic void\npackStringSet(const StringSet& profile,\n\t\t uint8_t** buffer, size_t* bufferSz);\n\nstatic StringSet*\nunpackStringSet(uint8_t* buffer, size_t bufferSz);\n\n\/\/***************************************************************************\n\/\/ private functions\n\/\/***************************************************************************\n\nstatic void \nbroadcast_sizet\n(\n size_t &size, \n int root, \n MPI_Comm comm\n)\n{ \n long size_l = size;\n MPI_Bcast(&size_l, 1, MPI_LONG, root, comm);\n size = size_l;\n} \n\n\n\n\/\/***************************************************************************\n\/\/ interface functions\n\/\/***************************************************************************\n\nvoid\nbroadcast\n(\n Prof::CallPath::Profile*& profile,\n int myRank, \n MPI_Comm comm\n)\n{\n size_t size = 0;\n uint8_t* buf = NULL;\n\n if (myRank == 0) {\n packProfile(*profile, &buf, &size);\n }\n\n broadcast_sizet(size, comm);\n\n if (myRank != 0) {\n buf = new uint8_t[size];\n }\n\n MPI_Bcast(buf, size, MPI_BYTE, 0, comm);\n\n if (myRank != 0) {\n profile = unpackProfile(buf, size);\n }\n\n delete [] buf;\n}\n\nvoid\nbroadcast\n(\n StringSet &stringSet,\n int myRank, \n MPI_Comm comm\n)\n{\n size_t size = 0;\n uint8_t* buf = NULL;\n\n if (myRank == 0) {\n packStringSet(stringSet, &buf, &size);\n }\n\n broadcast_sizet(size, comm);\n\n if (myRank != 0) {\n buf = new uint8_t[size];\n }\n\n MPI_Bcast(buf, size, MPI_BYTE, 0, comm);\n\n if (myRank != 0) {\n StringSet *rhs = unpackStringSet(buf, size);\n stringSet += *rhs;\n delete rhs;\n }\n\n delete [] buf;\n}\n\n\nvoid\npackSend(Prof::CallPath::Profile* profile,\n\t int dest, int myRank, MPI_Comm comm)\n{\n uint8_t* profileBuf = NULL;\n size_t profileBufSz = 0;\n packProfile(*profile, &profileBuf, &profileBufSz);\n MPI_Send(profileBuf, (int)profileBufSz, MPI_BYTE, dest, myRank, comm);\n free(profileBuf);\n}\n\nvoid\nrecvMerge(Prof::CallPath::Profile* profile,\n\t int src, int myRank, MPI_Comm comm)\n{\n \/\/ rank_x probes src\n MPI_Status mpistat;\n MPI_Probe(src, src, comm, &mpistat);\n int profileBufSz;\n MPI_Get_count(&mpistat, MPI_BYTE, &profileBufSz);\n\n \/\/ receive profile from src\n uint8_t *profileBuf = new uint8_t[profileBufSz];\n MPI_Recv(profileBuf, profileBufSz, MPI_BYTE, src, src, comm, &mpistat);\n Prof::CallPath::Profile* new_profile =\n unpackProfile(profileBuf, (size_t)profileBufSz);\n delete[] profileBuf;\n\n if (DBG_CCT_MERGE) {\n string pfx0 = \"[\" + StrUtil::toStr(myRank) + \"]\";\n string pfx1 = \"[\" + StrUtil::toStr(src) + \"]\";\n DIAG_DevMsgIf(1, profile->metricMgr()->toString(pfx0.c_str()));\n DIAG_DevMsgIf(1, new_profile->metricMgr()->toString(pfx1.c_str()));\n }\n \n int mergeTy = Prof::CallPath::Profile::Merge_MergeMetricByName;\n profile->merge(*new_profile, mergeTy);\n\n \/\/ merging the perf event statistics\n profile->metricMgr()->mergePerfEventStatistics(new_profile->metricMgr());\n\n if (DBG_CCT_MERGE) {\n string pfx = (\"[\" + StrUtil::toStr(src)\n\t\t + \" => \" + StrUtil::toStr(myRank) + \"]\");\n DIAG_DevMsgIf(1, profile->metricMgr()->toString(pfx.c_str()));\n }\n\n delete new_profile;\n}\n\nvoid\npackSend(std::pair<Prof::CallPath::Profile*,\n\t ParallelAnalysis::PackedMetrics*> data,\n\t int dest, int myRank, MPI_Comm comm)\n{\n Prof::CallPath::Profile* profile = data.first;\n ParallelAnalysis::PackedMetrics* packedMetrics = data.second;\n packMetrics(*profile, *packedMetrics);\n MPI_Send(packedMetrics->data(), packedMetrics->dataSize(),\n\t MPI_DOUBLE, dest, myRank, comm);\n}\n\nvoid\nrecvMerge(std::pair<Prof::CallPath::Profile*,\n\t ParallelAnalysis::PackedMetrics*> data,\n\t int src, int myRank, MPI_Comm comm)\n{\n Prof::CallPath::Profile* profile = data.first;\n ParallelAnalysis::PackedMetrics* packedMetrics = data.second;\n\n \/\/ receive new metric data from src\n MPI_Status mpistat;\n MPI_Recv(packedMetrics->data(), packedMetrics->dataSize(),\n\t MPI_DOUBLE, src, src, comm, &mpistat);\n DIAG_Assert(packedMetrics->verify(), DIAG_UnexpectedInput);\n unpackMetrics(*profile, *packedMetrics);\n}\n\nvoid\npackSend(StringSet *stringSet,\n\t int dest, int myRank, MPI_Comm comm)\n{\n uint8_t* stringSetBuf = NULL;\n size_t stringSetBufSz = 0;\n packStringSet(*stringSet, &stringSetBuf, &stringSetBufSz);\n MPI_Send(stringSetBuf, (int)stringSetBufSz, MPI_BYTE, \n\t dest, myRank, comm);\n free(stringSetBuf);\n}\n\nvoid\nrecvMerge(StringSet *stringSet,\n\t int src, int myRank, MPI_Comm comm)\n{\n \/\/ determine size of incoming packed directory set from src\n MPI_Status mpistat;\n MPI_Probe(src, src, comm, &mpistat);\n int stringSetBufSz = 0;\n MPI_Get_count(&mpistat, MPI_BYTE, &stringSetBufSz);\n\n \/\/ receive new stringSet from src\n uint8_t *stringSetBuf = new uint8_t[stringSetBufSz];\n MPI_Recv(stringSetBuf, stringSetBufSz, MPI_BYTE, \n\t src, src, comm, &mpistat);\n StringSet *new_stringSet =\n unpackStringSet(stringSetBuf, (size_t) stringSetBufSz);\n delete[] stringSetBuf;\n *stringSet += *new_stringSet;\n delete new_stringSet;\n}\n\n\n\/\/***************************************************************************\n\nvoid\npackProfile(const Prof::CallPath::Profile& profile,\n\t uint8_t** buffer, size_t* bufferSz)\n{\n \/\/ open_memstream: mallocs buffer and sets bufferSz\n FILE* fs = open_memstream((char**)buffer, bufferSz);\n\n uint wFlags = Prof::CallPath::Profile::WFlg_VirtualMetrics;\n Prof::CallPath::Profile::fmt_fwrite(profile, fs, wFlags);\n\n fclose(fs);\n}\n\n\nProf::CallPath::Profile*\nunpackProfile(uint8_t* buffer, size_t bufferSz)\n{\n FILE* fs = fmemopen(buffer, bufferSz, \"r\");\n\n Prof::CallPath::Profile* prof = NULL;\n uint rFlags = Prof::CallPath::Profile::RFlg_VirtualMetrics;\n Prof::CallPath::Profile::fmt_fread(prof, fs, rFlags,\n\t\t\t\t \"(ParallelAnalysis::unpackProfile)\",\n\t\t\t\t NULL, NULL);\n\n fclose(fs);\n return prof;\n}\n\n\n\n\/\/***************************************************************************\n\nstatic void\npackStringSet(const StringSet& stringSet,\n\t uint8_t** buffer, size_t* bufferSz)\n{\n \/\/ open_memstream: malloc buffer and sets bufferSz\n FILE* fs = open_memstream((char**)buffer, bufferSz);\n\n StringSet::fmt_fwrite(stringSet, fs);\n\n fclose(fs);\n}\n\n\nstatic StringSet*\nunpackStringSet(uint8_t* buffer, size_t bufferSz)\n{\n FILE* fs = fmemopen(buffer, bufferSz, \"r\");\n\n StringSet* stringSet = NULL;\n\n StringSet::fmt_fread(stringSet, fs);\n\n fclose(fs);\n\n return stringSet;\n}\n\n\n\/\/***************************************************************************\n\nvoid\npackMetrics(const Prof::CallPath::Profile& profile,\n\t ParallelAnalysis::PackedMetrics& packedMetrics)\n{\n Prof::CCT::Tree& cct = *profile.cct();\n\n \/\/ pack derived metrics [mDrvdBeg, mDrvdEnd) from 'profile' into\n \/\/ 'packedMetrics'\n uint mDrvdBeg = packedMetrics.mDrvdBegId();\n uint mDrvdEnd = packedMetrics.mDrvdEndId();\n\n DIAG_Assert(packedMetrics.numNodes() == cct.maxDenseId() + 1, \"\");\n DIAG_Assert(packedMetrics.numMetrics() == mDrvdEnd - mDrvdBeg, \"\");\n\n for (Prof::CCT::ANodeIterator it(cct.root()); it.Current(); ++it) {\n Prof::CCT::ANode* n = it.current();\n for (uint mId1 = 0, mId2 = mDrvdBeg; mId2 < mDrvdEnd; ++mId1, ++mId2) {\n packedMetrics.idx(n->id(), mId1) = n->metric(mId2);\n }\n }\n}\n\n\nvoid\nunpackMetrics(Prof::CallPath::Profile& profile,\n\t const ParallelAnalysis::PackedMetrics& packedMetrics)\n{\n Prof::CCT::Tree& cct = *profile.cct();\n\n \/\/ 1. unpack 'packedMetrics' into temporary derived metrics [mBegId,\n \/\/ mEndId) in 'profile'\n uint mBegId = packedMetrics.mBegId(), mEndId = packedMetrics.mEndId();\n\n DIAG_Assert(packedMetrics.numNodes() == cct.maxDenseId() + 1, \"\");\n DIAG_Assert(packedMetrics.numMetrics() == mEndId - mBegId, \"\");\n\n for (uint nodeId = 1; nodeId < packedMetrics.numNodes(); ++nodeId) {\n for (uint mId1 = 0, mId2 = mBegId; mId2 < mEndId; ++mId1, ++mId2) {\n Prof::CCT::ANode* n = cct.findNode(nodeId);\n n->demandMetric(mId2) = packedMetrics.idx(nodeId, mId1);\n }\n }\n\n \/\/ 2. update derived metrics [mDrvdBeg, mDrvdEnd) based on new\n \/\/ values in [mBegId, mEndId)\n uint mDrvdBeg = packedMetrics.mDrvdBegId();\n uint mDrvdEnd = packedMetrics.mDrvdEndId();\n cct.root()->computeMetricsIncr(*profile.metricMgr(), mDrvdBeg, mDrvdEnd,\n\t\t\t\t Prof::Metric::AExprIncr::FnCombine);\n}\n\n\n\n\/\/***************************************************************************\n\n} \/\/ namespace ParallelAnalysis\n<commit_msg>Fix comment.<commit_after>\/\/ -*-Mode: C++;-*-\n\n\/\/ * BeginRiceCopyright *****************************************************\n\/\/\n\/\/ $HeadURL$\n\/\/ $Id$\n\/\/\n\/\/ --------------------------------------------------------------------------\n\/\/ Part of HPCToolkit (hpctoolkit.org)\n\/\/\n\/\/ Information about sources of support for research and development of\n\/\/ HPCToolkit is at 'hpctoolkit.org' and in 'README.Acknowledgments'.\n\/\/ --------------------------------------------------------------------------\n\/\/\n\/\/ Copyright ((c)) 2002-2018, Rice University\n\/\/ All rights reserved.\n\/\/\n\/\/ Redistribution and use in source and binary forms, with or without\n\/\/ modification, are permitted provided that the following conditions are\n\/\/ met:\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 Rice University (RICE) 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 RICE and contributors \"as is\" and any\n\/\/ express or implied warranties, including, but not limited to, the\n\/\/ implied warranties of merchantability and fitness for a particular\n\/\/ purpose are disclaimed. In no event shall RICE 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\n\/\/ business interruption) however caused and on any theory of liability,\n\/\/ whether in contract, strict liability, or tort (including negligence\n\/\/ or otherwise) arising in any way out of the use of this software, even\n\/\/ if advised of the possibility of such damage.\n\/\/\n\/\/ ******************************************************* EndRiceCopyright *\n\n\/\/***************************************************************************\n\/\/\n\/\/ File:\n\/\/ $HeadURL$\n\/\/\n\/\/ Purpose:\n\/\/ [The purpose of this file]\n\/\/\n\/\/ Description:\n\/\/ [The set of functions, macros, etc. defined in the file]\n\/\/\n\/\/***************************************************************************\n\n\/\/**************************** MPI Include Files ****************************\n\n#include <mpi.h>\n\n\/\/************************* System Include Files ****************************\n\n#include <iostream>\n\n#include <string>\nusing std::string;\n\n#include <algorithm>\n\n#include <stdint.h>\n\n\/\/*************************** User Include Files ****************************\n\n#include <include\/uint.h>\n\n#include \"ParallelAnalysis.hpp\"\n\n#include <lib\/analysis\/CallPath.hpp>\n#include <lib\/analysis\/Util.hpp>\n\n#include <lib\/support\/diagnostics.h>\n#include <lib\/support\/StrUtil.hpp>\n\n\n\/\/*************************** Forward Declarations **************************\n\n#define DBG_CCT_MERGE 0\n\n\/\/***************************************************************************\n\n\nnamespace ParallelAnalysis {\n\n\/\/***************************************************************************\n\/\/ forward declarations\n\/\/***************************************************************************\n\nstatic void\npackStringSet(const StringSet& profile,\n\t\t uint8_t** buffer, size_t* bufferSz);\n\nstatic StringSet*\nunpackStringSet(uint8_t* buffer, size_t bufferSz);\n\n\/\/***************************************************************************\n\/\/ private functions\n\/\/***************************************************************************\n\nstatic void \nbroadcast_sizet\n(\n size_t &size, \n int root, \n MPI_Comm comm\n)\n{ \n long size_l = size;\n MPI_Bcast(&size_l, 1, MPI_LONG, root, comm);\n size = size_l;\n} \n\n\n\n\/\/***************************************************************************\n\/\/ interface functions\n\/\/***************************************************************************\n\nvoid\nbroadcast\n(\n Prof::CallPath::Profile*& profile,\n int myRank, \n MPI_Comm comm\n)\n{\n size_t size = 0;\n uint8_t* buf = NULL;\n\n if (myRank == 0) {\n packProfile(*profile, &buf, &size);\n }\n\n broadcast_sizet(size, comm);\n\n if (myRank != 0) {\n buf = new uint8_t[size];\n }\n\n MPI_Bcast(buf, size, MPI_BYTE, 0, comm);\n\n if (myRank != 0) {\n profile = unpackProfile(buf, size);\n }\n\n delete [] buf;\n}\n\nvoid\nbroadcast\n(\n StringSet &stringSet,\n int myRank, \n MPI_Comm comm\n)\n{\n size_t size = 0;\n uint8_t* buf = NULL;\n\n if (myRank == 0) {\n packStringSet(stringSet, &buf, &size);\n }\n\n broadcast_sizet(size, comm);\n\n if (myRank != 0) {\n buf = new uint8_t[size];\n }\n\n MPI_Bcast(buf, size, MPI_BYTE, 0, comm);\n\n if (myRank != 0) {\n StringSet *rhs = unpackStringSet(buf, size);\n stringSet += *rhs;\n delete rhs;\n }\n\n delete [] buf;\n}\n\n\nvoid\npackSend(Prof::CallPath::Profile* profile,\n\t int dest, int myRank, MPI_Comm comm)\n{\n uint8_t* profileBuf = NULL;\n size_t profileBufSz = 0;\n packProfile(*profile, &profileBuf, &profileBufSz);\n MPI_Send(profileBuf, (int)profileBufSz, MPI_BYTE, dest, myRank, comm);\n free(profileBuf);\n}\n\nvoid\nrecvMerge(Prof::CallPath::Profile* profile,\n\t int src, int myRank, MPI_Comm comm)\n{\n \/\/ probe src\n MPI_Status mpistat;\n MPI_Probe(src, src, comm, &mpistat);\n int profileBufSz;\n MPI_Get_count(&mpistat, MPI_BYTE, &profileBufSz);\n\n \/\/ receive profile from src\n uint8_t *profileBuf = new uint8_t[profileBufSz];\n MPI_Recv(profileBuf, profileBufSz, MPI_BYTE, src, src, comm, &mpistat);\n Prof::CallPath::Profile* new_profile =\n unpackProfile(profileBuf, (size_t)profileBufSz);\n delete[] profileBuf;\n\n if (DBG_CCT_MERGE) {\n string pfx0 = \"[\" + StrUtil::toStr(myRank) + \"]\";\n string pfx1 = \"[\" + StrUtil::toStr(src) + \"]\";\n DIAG_DevMsgIf(1, profile->metricMgr()->toString(pfx0.c_str()));\n DIAG_DevMsgIf(1, new_profile->metricMgr()->toString(pfx1.c_str()));\n }\n \n int mergeTy = Prof::CallPath::Profile::Merge_MergeMetricByName;\n profile->merge(*new_profile, mergeTy);\n\n \/\/ merging the perf event statistics\n profile->metricMgr()->mergePerfEventStatistics(new_profile->metricMgr());\n\n if (DBG_CCT_MERGE) {\n string pfx = (\"[\" + StrUtil::toStr(src)\n\t\t + \" => \" + StrUtil::toStr(myRank) + \"]\");\n DIAG_DevMsgIf(1, profile->metricMgr()->toString(pfx.c_str()));\n }\n\n delete new_profile;\n}\n\nvoid\npackSend(std::pair<Prof::CallPath::Profile*,\n\t ParallelAnalysis::PackedMetrics*> data,\n\t int dest, int myRank, MPI_Comm comm)\n{\n Prof::CallPath::Profile* profile = data.first;\n ParallelAnalysis::PackedMetrics* packedMetrics = data.second;\n packMetrics(*profile, *packedMetrics);\n MPI_Send(packedMetrics->data(), packedMetrics->dataSize(),\n\t MPI_DOUBLE, dest, myRank, comm);\n}\n\nvoid\nrecvMerge(std::pair<Prof::CallPath::Profile*,\n\t ParallelAnalysis::PackedMetrics*> data,\n\t int src, int myRank, MPI_Comm comm)\n{\n Prof::CallPath::Profile* profile = data.first;\n ParallelAnalysis::PackedMetrics* packedMetrics = data.second;\n\n \/\/ receive new metric data from src\n MPI_Status mpistat;\n MPI_Recv(packedMetrics->data(), packedMetrics->dataSize(),\n\t MPI_DOUBLE, src, src, comm, &mpistat);\n DIAG_Assert(packedMetrics->verify(), DIAG_UnexpectedInput);\n unpackMetrics(*profile, *packedMetrics);\n}\n\nvoid\npackSend(StringSet *stringSet,\n\t int dest, int myRank, MPI_Comm comm)\n{\n uint8_t* stringSetBuf = NULL;\n size_t stringSetBufSz = 0;\n packStringSet(*stringSet, &stringSetBuf, &stringSetBufSz);\n MPI_Send(stringSetBuf, (int)stringSetBufSz, MPI_BYTE, \n\t dest, myRank, comm);\n free(stringSetBuf);\n}\n\nvoid\nrecvMerge(StringSet *stringSet,\n\t int src, int myRank, MPI_Comm comm)\n{\n \/\/ determine size of incoming packed directory set from src\n MPI_Status mpistat;\n MPI_Probe(src, src, comm, &mpistat);\n int stringSetBufSz = 0;\n MPI_Get_count(&mpistat, MPI_BYTE, &stringSetBufSz);\n\n \/\/ receive new stringSet from src\n uint8_t *stringSetBuf = new uint8_t[stringSetBufSz];\n MPI_Recv(stringSetBuf, stringSetBufSz, MPI_BYTE, \n\t src, src, comm, &mpistat);\n StringSet *new_stringSet =\n unpackStringSet(stringSetBuf, (size_t) stringSetBufSz);\n delete[] stringSetBuf;\n *stringSet += *new_stringSet;\n delete new_stringSet;\n}\n\n\n\/\/***************************************************************************\n\nvoid\npackProfile(const Prof::CallPath::Profile& profile,\n\t uint8_t** buffer, size_t* bufferSz)\n{\n \/\/ open_memstream: mallocs buffer and sets bufferSz\n FILE* fs = open_memstream((char**)buffer, bufferSz);\n\n uint wFlags = Prof::CallPath::Profile::WFlg_VirtualMetrics;\n Prof::CallPath::Profile::fmt_fwrite(profile, fs, wFlags);\n\n fclose(fs);\n}\n\n\nProf::CallPath::Profile*\nunpackProfile(uint8_t* buffer, size_t bufferSz)\n{\n FILE* fs = fmemopen(buffer, bufferSz, \"r\");\n\n Prof::CallPath::Profile* prof = NULL;\n uint rFlags = Prof::CallPath::Profile::RFlg_VirtualMetrics;\n Prof::CallPath::Profile::fmt_fread(prof, fs, rFlags,\n\t\t\t\t \"(ParallelAnalysis::unpackProfile)\",\n\t\t\t\t NULL, NULL);\n\n fclose(fs);\n return prof;\n}\n\n\n\n\/\/***************************************************************************\n\nstatic void\npackStringSet(const StringSet& stringSet,\n\t uint8_t** buffer, size_t* bufferSz)\n{\n \/\/ open_memstream: malloc buffer and sets bufferSz\n FILE* fs = open_memstream((char**)buffer, bufferSz);\n\n StringSet::fmt_fwrite(stringSet, fs);\n\n fclose(fs);\n}\n\n\nstatic StringSet*\nunpackStringSet(uint8_t* buffer, size_t bufferSz)\n{\n FILE* fs = fmemopen(buffer, bufferSz, \"r\");\n\n StringSet* stringSet = NULL;\n\n StringSet::fmt_fread(stringSet, fs);\n\n fclose(fs);\n\n return stringSet;\n}\n\n\n\/\/***************************************************************************\n\nvoid\npackMetrics(const Prof::CallPath::Profile& profile,\n\t ParallelAnalysis::PackedMetrics& packedMetrics)\n{\n Prof::CCT::Tree& cct = *profile.cct();\n\n \/\/ pack derived metrics [mDrvdBeg, mDrvdEnd) from 'profile' into\n \/\/ 'packedMetrics'\n uint mDrvdBeg = packedMetrics.mDrvdBegId();\n uint mDrvdEnd = packedMetrics.mDrvdEndId();\n\n DIAG_Assert(packedMetrics.numNodes() == cct.maxDenseId() + 1, \"\");\n DIAG_Assert(packedMetrics.numMetrics() == mDrvdEnd - mDrvdBeg, \"\");\n\n for (Prof::CCT::ANodeIterator it(cct.root()); it.Current(); ++it) {\n Prof::CCT::ANode* n = it.current();\n for (uint mId1 = 0, mId2 = mDrvdBeg; mId2 < mDrvdEnd; ++mId1, ++mId2) {\n packedMetrics.idx(n->id(), mId1) = n->metric(mId2);\n }\n }\n}\n\n\nvoid\nunpackMetrics(Prof::CallPath::Profile& profile,\n\t const ParallelAnalysis::PackedMetrics& packedMetrics)\n{\n Prof::CCT::Tree& cct = *profile.cct();\n\n \/\/ 1. unpack 'packedMetrics' into temporary derived metrics [mBegId,\n \/\/ mEndId) in 'profile'\n uint mBegId = packedMetrics.mBegId(), mEndId = packedMetrics.mEndId();\n\n DIAG_Assert(packedMetrics.numNodes() == cct.maxDenseId() + 1, \"\");\n DIAG_Assert(packedMetrics.numMetrics() == mEndId - mBegId, \"\");\n\n for (uint nodeId = 1; nodeId < packedMetrics.numNodes(); ++nodeId) {\n for (uint mId1 = 0, mId2 = mBegId; mId2 < mEndId; ++mId1, ++mId2) {\n Prof::CCT::ANode* n = cct.findNode(nodeId);\n n->demandMetric(mId2) = packedMetrics.idx(nodeId, mId1);\n }\n }\n\n \/\/ 2. update derived metrics [mDrvdBeg, mDrvdEnd) based on new\n \/\/ values in [mBegId, mEndId)\n uint mDrvdBeg = packedMetrics.mDrvdBegId();\n uint mDrvdEnd = packedMetrics.mDrvdEndId();\n cct.root()->computeMetricsIncr(*profile.metricMgr(), mDrvdBeg, mDrvdEnd,\n\t\t\t\t Prof::Metric::AExprIncr::FnCombine);\n}\n\n\n\n\/\/***************************************************************************\n\n} \/\/ namespace ParallelAnalysis\n<|endoftext|>"} {"text":"<commit_before>42b88d92-2e4d-11e5-9284-b827eb9e62be<commit_msg>42bd8e6e-2e4d-11e5-9284-b827eb9e62be<commit_after>42bd8e6e-2e4d-11e5-9284-b827eb9e62be<|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\/common\/perception_gflags.h\"\n\nDEFINE_string(perception_adapter_config_filename,\n \"modules\/perception\/conf\/adapter.conf\",\n \"The adapter config filename\");\n\n\/\/\/ lib\/config_manager\/config_manager.cc\nDEFINE_string(config_manager_path, \".\/conf\/config_manager.config\",\n \"The ModelConfig config paths file.\");\nDEFINE_string(work_root, \"\/apollo\/modules\/perception\/\",\n \"perception work root direcotry.\");\n\n\/\/\/ obstacle\/base\/object.cc\nDEFINE_bool(is_serialize_point_cloud, false,\n \"serialize and output object cloud\");\n\n\/\/\/ obstacle\/onboard\/hdmap_input.cc\nDEFINE_double(map_radius, 60.0, \"get map radius of car center\");\nDEFINE_int32(map_sample_step, 1, \"step for sample road boundary points\");\n\n\/\/\/ obstacle\/onboard\/lidar_process.cc\nDEFINE_bool(enable_hdmap_input, false, \"enable hdmap input for roi filter\");\nDEFINE_string(onboard_roi_filter, \"DummyROIFilter\", \"onboard roi filter\");\nDEFINE_string(onboard_segmentor, \"DummySegmentation\", \"onboard segmentation\");\nDEFINE_string(onboard_object_builder, \"DummyObjectBuilder\",\n \"onboard object builder\");\nDEFINE_string(onboard_tracker, \"DummyTracker\", \"onboard tracker\");\nDEFINE_string(onboard_type_fuser, \"DummyTypeFuser\", \"onboard type fuser\");\n\nDEFINE_int32(tf2_buff_in_ms, 10, \"the tf2 buff size in ms\");\nDEFINE_int32(localization_buffer_size, 40, \"localization buffer size\");\nDEFINE_string(lidar_tf2_frame_id, \"novatel\", \"the tf2 transform frame id\");\nDEFINE_string(lidar_tf2_child_frame_id, \"velodyne64\",\n \"the tf2 transform child frame id\");\nDEFINE_string(obstacle_module_name, \"perception_obstacle\",\n \"perception obstacle module name\");\nDEFINE_bool(enable_visualization, false, \"enable visualization for debug\");\n\n\/\/\/ obstacle\/perception.cc\n\/* dag streaming config for Apollo 2.0 *\/\nDEFINE_string(dag_config_path, \".\/conf\/dag_streaming.config\",\n \"Onboard DAG Streaming config.\");\n\n\/\/\/ obstacle\/onboard\/radar_process_subnode.cc\nDEFINE_string(onboard_radar_detector, \"DummyRadarDetector\",\n \"onboard radar detector\");\nDEFINE_string(radar_tf2_frame_id, \"novatel\", \"the tf2 transform frame id\");\nDEFINE_string(radar_tf2_child_frame_id, \"radar\",\n \"the tf2 transform child frame id\");\nDEFINE_double(front_radar_forward_distance, 120.0,\n \"get front radar forward distancer\");\nDEFINE_string(radar_extrinsic_file,\n \"modules\/perception\/data\/params\/radar_extrinsics.yaml\",\n \"radar extrinsic file\");\nDEFINE_string(short_camera_extrinsic_file,\n \"modules\/perception\/data\/params\/short_camera_extrinsics.yaml\",\n \"short_camera extrinsic file\");\n\n\/\/\/ obstacle\/onboard\/camera_process_subnode.cc\n\/\/ Ex: \/apollo\/modules\/perception\/data\/yolo_camera_detector_test\/test.jpg\nDEFINE_string(image_file_path, \"\", \"Debug image file\");\nDEFINE_bool(image_file_debug, false, \"Debug ROS to CV image\");\n\n\/\/\/ modules\/perception\/lib\/config_manager\/calibration_config_manager.cc\nDEFINE_string(front_camera_extrinsics_file,\n \"modules\/perception\/data\/params\/front_camera_extrinsics.yaml\",\n \"front_camera extrinsic file\");\nDEFINE_string(front_camera_intrinsics_file,\n \"modules\/perception\/data\/params\/front_camera_intrinsics.yaml\",\n \"front_camera intrinsic file\");\n\n\/\/\/ obstacle\/onboard\/fusion_subnode.cc\nDEFINE_string(onboard_fusion, \"ProbabilisticFusion\",\n \"fusion name which enabled onboard\");\n\nDEFINE_double(query_signal_range, 100.0, \"max distance to front signals\");\nDEFINE_bool(output_raw_img, false, \"write raw image to disk\");\nDEFINE_bool(output_debug_img, false, \"write debug image to disk\");\n\n\/\/\/ Temporarily change Kalman motion fusion to config here.\nDEFINE_double(q_matrix_coefficient_amplifier, 0.5,\n \"Kalman fitler matrix Q coeffcients\");\nDEFINE_double(r_matrix_amplifier, 1, \"Kalman fitler matrix r coeffcients\");\nDEFINE_double(p_matrix_amplifier, 1, \"Kalman fitler matrix p coeffcients\");\n\nDEFINE_double(a_matrix_covariance_coeffcient_1, 0.05,\n \"Kalman fitler matrix a coeffcients, a_matrix_(0, 2)\");\nDEFINE_double(a_matrix_covariance_coeffcient_2, 0.05,\n \"Kalman fitler matrix a coeffcients, a_matrix_(1, 3)\");\n\n\/\/\/ calibration_config_manager.cc\nDEFINE_int32(obs_camera_detector_gpu, 0, \"device id for camera detector\");\n\n\/\/ obstacle\/onboard\/lane_post_processing_subnode.cc\nDEFINE_string(onboard_lane_post_processor, \"CCLanePostProcessor\",\n \"onboard lane post-processing algorithm name\");\n\n\/\/\/ visualization\n\nDEFINE_bool(show_radar_objects, false, \"\");\n\nDEFINE_bool(show_camera_objects2d, false, \"\");\nDEFINE_bool(show_camera_objects, false, \"\");\nDEFINE_bool(show_camera_parsing, false, \"\");\n\nDEFINE_bool(show_fused_objects, false, \"\");\n\nDEFINE_bool(show_fusion_association, false, \"\");\n\nDEFINE_bool(capture_screen, false, \"\");\n\nDEFINE_string(screen_output_dir, \".\/\", \"\");\n\nDEFINE_string(frame_visualizer, \"GLFusionVisualizer\", \"\");\n\nDEFINE_bool(async_fusion, false, \"use distance angle \");\nDEFINE_bool(use_distance_angle_fusion, true,\n \"use distance angle prob distance in fusion\");\nDEFINE_bool(publish_fusion_event, false, \"publish fusion event\");\nDEFINE_bool(bag_mode, false, \"run perception in bag mode\");\n\nDEFINE_bool(show_motion, false, \"visualize motion and object trajectories\");\nDEFINE_bool(skip_camera_frame, false, \"skip camera frame\");\nDEFINE_int32(camera_hz, 30, \"camera hz\");\nDEFINE_string(fusion_publish_sensor_id, \"velodyne_64\", \"fusion publish id\");\n\nDEFINE_int32(pbf_fusion_assoc_distance_percent, 20, \"fusion distance percent\");\nDEFINE_double(pbf_distance_speed_cos_diff, 0.5, \"fusion velocity cosine diff\");\n\nDEFINE_string(cc_lane_post_processor_config_file,\n \"modules\/perception\/model\/camera\/lane_post_process_config.pb.txt\",\n \"The config file of cc_lane_post_processor.\");\nDEFINE_string(probabilistic_fusion_config_file,\n \"modules\/perception\/model\/probabilistic_fusion_config.pb.txt\",\n \"The config file of probabilistic_fusion.\");\nDEFINE_string(yolo_config_filename, \"config.pt\", \"Yolo config filename.\");\nDEFINE_string(\n yolo_camera_detector_config,\n \"modules\/perception\/model\/camera\/yolo_camera_detector_config.pb.txt\",\n \"Yolo camera detector config filename.\");\nDEFINE_string(modest_radar_detector_config,\n \"modules\/perception\/model\/modest_radar_detector_config.pb.txt\",\n \"modest radar detector config filename.\");\nDEFINE_string(tracker_config, \"modules\/perception\/model\/tracker_config.pb.txt\",\n \"tracker config filename.\");\nDEFINE_string(sequence_type_fuser_config,\n \"modules\/perception\/model\/sequence_type_fuser_config.pb.txt\",\n \"sequence_type_fuser config filename.\");\nDEFINE_string(async_fusion_config,\n \"modules\/perception\/model\/async_fusion_config.pb.txt\",\n \"async_fuser config filename.\");\nDEFINE_string(\n geometry_camera_converter_config,\n \"modules\/perception\/model\/geometry_camera_converter_config.pb.txt\",\n \"geometry_camera_converter config filename.\");\n<commit_msg>Bugfix for #4061<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\/common\/perception_gflags.h\"\n\nDEFINE_string(perception_adapter_config_filename,\n \"modules\/perception\/conf\/adapter.conf\",\n \"The adapter config filename\");\n\n\/\/\/ lib\/config_manager\/config_manager.cc\nDEFINE_string(config_manager_path, \".\/conf\/config_manager.config\",\n \"The ModelConfig config paths file.\");\nDEFINE_string(work_root, \"\/apollo\/modules\/perception\/\",\n \"perception work root direcotry.\");\n\n\/\/\/ obstacle\/base\/object.cc\nDEFINE_bool(is_serialize_point_cloud, false,\n \"serialize and output object cloud\");\n\n\/\/\/ obstacle\/onboard\/hdmap_input.cc\nDEFINE_double(map_radius, 60.0, \"get map radius of car center\");\nDEFINE_int32(map_sample_step, 1, \"step for sample road boundary points\");\n\n\/\/\/ obstacle\/onboard\/lidar_process.cc\nDEFINE_bool(enable_hdmap_input, false, \"enable hdmap input for roi filter\");\nDEFINE_string(onboard_roi_filter, \"DummyROIFilter\", \"onboard roi filter\");\nDEFINE_string(onboard_segmentor, \"DummySegmentation\", \"onboard segmentation\");\nDEFINE_string(onboard_object_builder, \"DummyObjectBuilder\",\n \"onboard object builder\");\nDEFINE_string(onboard_tracker, \"DummyTracker\", \"onboard tracker\");\nDEFINE_string(onboard_type_fuser, \"DummyTypeFuser\", \"onboard type fuser\");\n\nDEFINE_int32(tf2_buff_in_ms, 10, \"the tf2 buff size in ms\");\nDEFINE_int32(localization_buffer_size, 40, \"localization buffer size\");\nDEFINE_string(lidar_tf2_frame_id, \"novatel\", \"the tf2 transform frame id\");\nDEFINE_string(lidar_tf2_child_frame_id, \"velodyne64\",\n \"the tf2 transform child frame id\");\nDEFINE_string(obstacle_module_name, \"perception_obstacle\",\n \"perception obstacle module name\");\nDEFINE_bool(enable_visualization, false, \"enable visualization for debug\");\n\n\/\/\/ obstacle\/perception.cc\n\/* dag streaming config for Apollo 2.0 *\/\nDEFINE_string(dag_config_path, \".\/conf\/dag_streaming.config\",\n \"Onboard DAG Streaming config.\");\n\n\/\/\/ obstacle\/onboard\/radar_process_subnode.cc\nDEFINE_string(onboard_radar_detector, \"DummyRadarDetector\",\n \"onboard radar detector\");\nDEFINE_string(radar_tf2_frame_id, \"novatel\", \"the tf2 transform frame id\");\nDEFINE_string(radar_tf2_child_frame_id, \"radar\",\n \"the tf2 transform child frame id\");\nDEFINE_double(front_radar_forward_distance, 120.0,\n \"get front radar forward distancer\");\nDEFINE_string(radar_extrinsic_file,\n \"modules\/perception\/data\/params\/radar_extrinsics.yaml\",\n \"radar extrinsic file\");\nDEFINE_string(short_camera_extrinsic_file,\n \"modules\/perception\/data\/params\/short_camera_extrinsics.yaml\",\n \"short_camera extrinsic file\");\n\n\/\/\/ obstacle\/onboard\/camera_process_subnode.cc\n\/\/ Ex: \/apollo\/modules\/perception\/data\/yolo_camera_detector_test\/test.jpg\nDEFINE_string(image_file_path, \"\", \"Debug image file\");\nDEFINE_bool(image_file_debug, false, \"Debug ROS to CV image\");\n\n\/\/\/ modules\/perception\/lib\/config_manager\/calibration_config_manager.cc\nDEFINE_string(front_camera_extrinsics_file,\n \"modules\/perception\/data\/params\/front_camera_extrinsics.yaml\",\n \"front_camera extrinsic file\");\nDEFINE_string(front_camera_intrinsics_file,\n \"modules\/perception\/data\/params\/front_camera_intrinsics.yaml\",\n \"front_camera intrinsic file\");\n\n\/\/\/ obstacle\/onboard\/fusion_subnode.cc\nDEFINE_string(onboard_fusion, \"ProbabilisticFusion\",\n \"fusion name which enabled onboard\");\n\nDEFINE_double(query_signal_range, 100.0, \"max distance to front signals\");\nDEFINE_bool(output_raw_img, false, \"write raw image to disk\");\nDEFINE_bool(output_debug_img, false, \"write debug image to disk\");\n\n\/\/\/ Temporarily change Kalman motion fusion to config here.\nDEFINE_double(q_matrix_coefficient_amplifier, 0.5,\n \"Kalman fitler matrix Q coeffcients\");\nDEFINE_double(r_matrix_amplifier, 1, \"Kalman fitler matrix r coeffcients\");\nDEFINE_double(p_matrix_amplifier, 1, \"Kalman fitler matrix p coeffcients\");\n\nDEFINE_double(a_matrix_covariance_coeffcient_1, 0.05,\n \"Kalman fitler matrix a coeffcients, a_matrix_(0, 2)\");\nDEFINE_double(a_matrix_covariance_coeffcient_2, 0.05,\n \"Kalman fitler matrix a coeffcients, a_matrix_(1, 3)\");\n\n\/\/\/ calibration_config_manager.cc\nDEFINE_int32(obs_camera_detector_gpu, 0, \"device id for camera detector\");\n\n\/\/ obstacle\/onboard\/lane_post_processing_subnode.cc\nDEFINE_string(onboard_lane_post_processor, \"CCLanePostProcessor\",\n \"onboard lane post-processing algorithm name\");\n\n\/\/\/ visualization\n\nDEFINE_bool(show_radar_objects, false, \"\");\n\nDEFINE_bool(show_camera_objects2d, false, \"\");\nDEFINE_bool(show_camera_objects, false, \"\");\nDEFINE_bool(show_camera_parsing, false, \"\");\n\nDEFINE_bool(show_fused_objects, false, \"\");\n\nDEFINE_bool(show_fusion_association, false, \"\");\n\nDEFINE_bool(capture_screen, false, \"\");\n\nDEFINE_string(screen_output_dir, \".\/\", \"\");\n\nDEFINE_string(frame_visualizer, \"GLFusionVisualizer\", \"\");\n\nDEFINE_bool(async_fusion, false, \"use distance angle \");\nDEFINE_bool(use_distance_angle_fusion, true,\n \"use distance angle prob distance in fusion\");\nDEFINE_bool(publish_fusion_event, false, \"publish fusion event\");\nDEFINE_bool(bag_mode, false, \"run perception in bag mode\");\n\nDEFINE_bool(show_motion, false, \"visualize motion and object trajectories\");\nDEFINE_bool(skip_camera_frame, false, \"skip camera frame\");\nDEFINE_int32(camera_hz, 30, \"camera hz\");\nDEFINE_string(fusion_publish_sensor_id, \"velodyne_64\", \"fusion publish id\");\n\nDEFINE_int32(pbf_fusion_assoc_distance_percent, 20, \"fusion distance percent\");\nDEFINE_double(pbf_distance_speed_cos_diff, 0.5, \"fusion velocity cosine diff\");\n\nDEFINE_string(cc_lane_post_processor_config_file,\n \"modules\/perception\/model\/camera\/lane_post_process_config.pb.txt\",\n \"The config file of cc_lane_post_processor.\");\nDEFINE_string(probabilistic_fusion_config_file,\n \"modules\/perception\/model\/probabilistic_fusion_config.pb.txt\",\n \"The config file of probabilistic_fusion.\");\nDEFINE_string(yolo_config_filename, \"config.pt\", \"Yolo config filename.\");\nDEFINE_string(\n yolo_camera_detector_config,\n \"modules\/perception\/model\/camera\/yolo_camera_detector_config.pb.txt\",\n \"Yolo camera detector config filename.\");\nDEFINE_string(modest_radar_detector_config,\n \"modules\/perception\/model\/modest_radar_detector_config.pb.txt\",\n \"modest radar detector config filename.\");\nDEFINE_string(tracker_config, \"modules\/perception\/model\/tracker_config.pb.txt\",\n \"tracker config filename.\");\nDEFINE_string(sequence_type_fuser_config,\n \"modules\/perception\/model\/sequence_type_fuser_config.pb.txt\",\n \"sequence_type_fuser config filename.\");\nDEFINE_string(async_fusion_config,\n \"modules\/perception\/model\/async_fusion_config.pb.txt\",\n \"async_fuser config filename.\");\nDEFINE_string(\n geometry_camera_converter_config,\n \"modules\/perception\/model\/camera\/geometry_camera_converter_config.pb.txt\",\n \"geometry_camera_converter config filename.\");\n<|endoftext|>"} {"text":"<commit_before>4803ac2c-2e4e-11e5-9284-b827eb9e62be<commit_msg>4808a628-2e4e-11e5-9284-b827eb9e62be<commit_after>4808a628-2e4e-11e5-9284-b827eb9e62be<|endoftext|>"} {"text":"<commit_before>34cc2798-2e4d-11e5-9284-b827eb9e62be<commit_msg>34d1368e-2e4d-11e5-9284-b827eb9e62be<commit_after>34d1368e-2e4d-11e5-9284-b827eb9e62be<|endoftext|>"} {"text":"<commit_before>\/******************************************************************************\n * Copyright 2020 The Apollo Authors. All Rights Reserved.\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n *****************************************************************************\/\n\n#include \"modules\/planning\/pipeline\/feature_generator.h\"\n\n#include <cmath>\n#include <string>\n\n#include \"absl\/strings\/str_cat.h\"\n#include \"cyber\/common\/file.h\"\n#include \"cyber\/record\/record_reader.h\"\n#include \"modules\/common\/adapters\/adapter_gflags.h\"\n#include \"modules\/planning\/common\/planning_gflags.h\"\n\nDEFINE_string(planning_data_dir, \"\/apollo\/modules\/planning\/data\/\",\n \"Prefix of files to store learning_data_frame data\");\nDEFINE_int32(localization_freq, 100, \"frequence of localization message\");\nDEFINE_int32(planning_freq, 10, \"frequence of planning message\");\nDEFINE_int32(learning_data_frame_num_per_file, 100,\n \"number of learning_data_frame to write out in one data file.\");\nDEFINE_bool(enable_binary_learning_data, true,\n \"True to generate protobuf binary data file.\");\n\nnamespace apollo {\nnamespace planning {\n\nusing apollo::canbus::Chassis;\nusing apollo::cyber::record::RecordMessage;\nusing apollo::cyber::record::RecordReader;\nusing apollo::localization::LocalizationEstimate;\nusing apollo::perception::TrafficLightDetection;\nusing apollo::routing::RoutingResponse;\n\nvoid FeatureGenerator::Init() {}\n\nvoid FeatureGenerator::WriteOutLearningData(const LearningData& learning_data,\n const std::string& file_name) {\n if (FLAGS_enable_binary_learning_data) {\n cyber::common::SetProtoToBinaryFile(learning_data, file_name);\n cyber::common::SetProtoToASCIIFile(learning_data, file_name + \".txt\");\n } else {\n cyber::common::SetProtoToASCIIFile(learning_data, file_name);\n }\n learning_data_.Clear();\n ++learning_data_file_index_;\n}\n\nvoid FeatureGenerator::Close() {\n const std::string file_name = absl::StrCat(\n FLAGS_planning_data_dir, \"\/learning_data.\",\n learning_data_file_index_, \".bin\");\n WriteOutLearningData(learning_data_, file_name);\n AINFO << \"Total learning_data_frame number:\"\n << total_learning_data_frame_num_;\n}\n\nvoid FeatureGenerator::OnLocalization(\n const apollo::localization::LocalizationEstimate& le) {\n \/\/ auto features = learning_data_frame_->mutable_localization();\n \/\/ const auto& pose = le.pose();\n \/\/ features->mutable_position()->CopyFrom(pose.position());\n \/\/ features->set_heading(pose.heading());\n \/\/ features->mutable_linear_velocity()->CopyFrom(pose.linear_velocity());\n \/\/ features->mutable_linear_acceleration()->CopyFrom(pose.linear_acceleration());\n \/\/ features->mutable_angular_velocity()->CopyFrom(pose.angular_velocity());\n localization_for_label_.push_back(le);\n\n const int localization_msg_start_cnt =\n FLAGS_localization_freq * FLAGS_trajectory_time_length;\n if (static_cast<int>(localization_for_label_.size()) <\n localization_msg_start_cnt) {\n return;\n }\n\n \/\/ generate one frame data\n GenerateLearningDataFrame();\n\n const int localization_move_window_step =\n FLAGS_localization_freq \/ FLAGS_planning_freq;\n for (int i = 0; i < localization_move_window_step; ++i) {\n localization_for_label_.pop_front();\n }\n\n \/\/ write frames into a file\n if (learning_data_.learning_data_size() >=\n FLAGS_learning_data_frame_num_per_file) {\n const std::string file_name = absl::StrCat(\n FLAGS_planning_data_dir, \"\/learning_data.\",\n learning_data_file_index_, \".bin\");\n WriteOutLearningData(learning_data_, file_name);\n }\n}\n\nvoid FeatureGenerator::OnChassis(const apollo::canbus::Chassis& chassis) {\n \/* To be fixed\n if (learning_data_frame_ == nullptr) {\n AERROR << \"learning_data_frame_ pointer is nullptr\";\n return;\n }\n auto features = learning_data_frame_->mutable_chassis();\n features->set_speed_mps(chassis.speed_mps());\n features->set_throttle_percentage(chassis.throttle_percentage());\n features->set_brake_percentage(chassis.brake_percentage());\n features->set_steering_percentage(chassis.steering_percentage());\n features->set_gear_location(chassis.gear_location());\n *\/\n}\n\nvoid FeatureGenerator::OnTafficLightDetection(\n const TrafficLightDetection& traffic_light_detection) {\n \/\/ AINFO << \"traffic_light_detection received at frame[\"\n \/\/ << total_learning_data_frame_num_ << \"]\";\n\n traffic_lights_.clear();\n for (int i = 0; i < traffic_light_detection.traffic_light_size(); ++i) {\n const auto& traffic_light_id =\n traffic_light_detection.traffic_light(i).id();\n if (traffic_light_id.empty()) continue;\n\n \/\/ AINFO << \" traffic_light_id[\" << traffic_light_id << \"] color[\"\n \/\/ << traffic_light_detection.traffic_light(i).color() << \"]\";\n traffic_lights_[traffic_light_id] =\n traffic_light_detection.traffic_light(i).color();\n }\n}\n\n\nvoid FeatureGenerator::OnRoutingResponse(\n const apollo::routing::RoutingResponse& routing_response) {\n AINFO << \"routing_response received at frame[\"\n << total_learning_data_frame_num_ << \"]\";\n routing_lane_ids_.clear();\n for (int i = 0; i < routing_response.road_size(); ++i) {\n for (int j = 0; j < routing_response.road(i).passage_size(); ++j) {\n for (int k = 0; k < routing_response.road(i).passage(j).segment_size();\n ++k) {\n routing_lane_ids_.push_back(\n routing_response.road(i).passage(j).segment(k).id());\n }\n }\n }\n}\n\nvoid FeatureGenerator::GenerateTrajectoryPoints(\n const std::list<apollo::localization::LocalizationEstimate>&\n localization_for_label,\n LearningDataFrame* learning_data_frame) {\n int i = -1;\n int cnt = 0;\n\n const int localization_sample_interval_for_trajectory_point =\n FLAGS_localization_freq \/ FLAGS_planning_freq;\n for (const auto& le : localization_for_label) {\n ++i;\n if ((i % localization_sample_interval_for_trajectory_point) != 0) {\n continue;\n }\n auto trajectory_point = learning_data_frame->add_trajectory_point();\n auto& pose = le.pose();\n trajectory_point->mutable_path_point()->set_x(pose.position().x());\n trajectory_point->mutable_path_point()->set_y(pose.position().y());\n trajectory_point->mutable_path_point()->set_z(pose.position().z());\n trajectory_point->mutable_path_point()->set_theta(pose.heading());\n auto v = std::sqrt(pose.linear_velocity().x() * pose.linear_velocity().x() +\n pose.linear_velocity().y() * pose.linear_velocity().y());\n trajectory_point->set_v(v);\n auto a = std::sqrt(\n pose.linear_acceleration().x() * pose.linear_acceleration().x() +\n pose.linear_acceleration().y() * pose.linear_acceleration().y());\n trajectory_point->set_a(a);\n\n cnt++;\n }\n \/\/ AINFO << \"number of trajectory points in one frame: \" << cnt;\n}\n\nvoid FeatureGenerator::GenerateLearningDataFrame() {\n auto learning_data_frame = learning_data_.add_learning_data();\n \/\/ add timestamp_sec & frame_num\n learning_data_frame->set_timestamp_sec(\n localization_for_label_.back().header().timestamp_sec());\n learning_data_frame->set_frame_num(total_learning_data_frame_num_++);\n\n \/\/ add traffic_light\n learning_data_frame->clear_traffic_light();\n for (const auto& tl : traffic_lights_) {\n auto traffic_light = learning_data_frame->add_traffic_light();\n traffic_light->set_id(tl.first);\n traffic_light->set_color(tl.second);\n }\n\n \/\/ add routing\n auto features = learning_data_frame->mutable_routing_response();\n features->Clear();\n for (const auto& lane_id : routing_lane_ids_) {\n features->add_lane_id(lane_id);\n }\n\n \/\/ add trajectory_points\n GenerateTrajectoryPoints(localization_for_label_, learning_data_frame);\n}\n\nvoid FeatureGenerator::ProcessOfflineData(const std::string& record_filename) {\n RecordReader reader(record_filename);\n if (!reader.IsValid()) {\n AERROR << \"Fail to open \" << record_filename;\n return;\n }\n\n RecordMessage message;\n while (reader.ReadMessage(&message)) {\n if (message.channel_name == FLAGS_chassis_topic) {\n Chassis chassis;\n if (chassis.ParseFromString(message.content)) {\n OnChassis(chassis);\n }\n } else if (message.channel_name == FLAGS_localization_topic) {\n LocalizationEstimate localization;\n if (localization.ParseFromString(message.content)) {\n OnLocalization(localization);\n }\n } else if (message.channel_name == FLAGS_routing_response_topic) {\n RoutingResponse routing_response;\n if (routing_response.ParseFromString(message.content)) {\n OnRoutingResponse(routing_response);\n }\n } else if (message.channel_name == FLAGS_traffic_light_detection_topic) {\n TrafficLightDetection traffic_light_detection;\n if (traffic_light_detection.ParseFromString(message.content)) {\n OnTafficLightDetection(traffic_light_detection);\n }\n }\n }\n}\n\n} \/\/ namespace planning\n} \/\/ namespace apollo\n<commit_msg>planning: fixed localization feature data in learning data<commit_after>\/******************************************************************************\n * Copyright 2020 The Apollo Authors. All Rights Reserved.\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n *****************************************************************************\/\n\n#include \"modules\/planning\/pipeline\/feature_generator.h\"\n\n#include <cmath>\n#include <string>\n\n#include \"absl\/strings\/str_cat.h\"\n#include \"cyber\/common\/file.h\"\n#include \"cyber\/record\/record_reader.h\"\n#include \"modules\/common\/adapters\/adapter_gflags.h\"\n#include \"modules\/planning\/common\/planning_gflags.h\"\n\nDEFINE_string(planning_data_dir, \"\/apollo\/modules\/planning\/data\/\",\n \"Prefix of files to store learning_data_frame data\");\nDEFINE_int32(localization_freq, 100, \"frequence of localization message\");\nDEFINE_int32(planning_freq, 10, \"frequence of planning message\");\nDEFINE_int32(learning_data_frame_num_per_file, 100,\n \"number of learning_data_frame to write out in one data file.\");\nDEFINE_bool(enable_binary_learning_data, true,\n \"True to generate protobuf binary data file.\");\n\nnamespace apollo {\nnamespace planning {\n\nusing apollo::canbus::Chassis;\nusing apollo::cyber::record::RecordMessage;\nusing apollo::cyber::record::RecordReader;\nusing apollo::localization::LocalizationEstimate;\nusing apollo::perception::TrafficLightDetection;\nusing apollo::routing::RoutingResponse;\n\nvoid FeatureGenerator::Init() {}\n\nvoid FeatureGenerator::WriteOutLearningData(const LearningData& learning_data,\n const std::string& file_name) {\n if (FLAGS_enable_binary_learning_data) {\n cyber::common::SetProtoToBinaryFile(learning_data, file_name);\n cyber::common::SetProtoToASCIIFile(learning_data, file_name + \".txt\");\n } else {\n cyber::common::SetProtoToASCIIFile(learning_data, file_name);\n }\n learning_data_.Clear();\n ++learning_data_file_index_;\n}\n\nvoid FeatureGenerator::Close() {\n const std::string file_name = absl::StrCat(\n FLAGS_planning_data_dir, \"\/learning_data.\",\n learning_data_file_index_, \".bin\");\n WriteOutLearningData(learning_data_, file_name);\n AINFO << \"Total learning_data_frame number:\"\n << total_learning_data_frame_num_;\n}\n\nvoid FeatureGenerator::OnLocalization(\n const apollo::localization::LocalizationEstimate& le) {\n localization_for_label_.push_back(le);\n\n const int localization_msg_start_cnt =\n FLAGS_localization_freq * FLAGS_trajectory_time_length;\n if (static_cast<int>(localization_for_label_.size()) <\n localization_msg_start_cnt) {\n return;\n }\n\n \/\/ generate one frame data\n GenerateLearningDataFrame();\n\n const int localization_move_window_step =\n FLAGS_localization_freq \/ FLAGS_planning_freq;\n for (int i = 0; i < localization_move_window_step; ++i) {\n localization_for_label_.pop_front();\n }\n\n \/\/ write frames into a file\n if (learning_data_.learning_data_size() >=\n FLAGS_learning_data_frame_num_per_file) {\n const std::string file_name = absl::StrCat(\n FLAGS_planning_data_dir, \"\/learning_data.\",\n learning_data_file_index_, \".bin\");\n WriteOutLearningData(learning_data_, file_name);\n }\n}\n\nvoid FeatureGenerator::OnChassis(const apollo::canbus::Chassis& chassis) {\n \/* To be fixed\n if (learning_data_frame_ == nullptr) {\n AERROR << \"learning_data_frame_ pointer is nullptr\";\n return;\n }\n auto features = learning_data_frame_->mutable_chassis();\n features->set_speed_mps(chassis.speed_mps());\n features->set_throttle_percentage(chassis.throttle_percentage());\n features->set_brake_percentage(chassis.brake_percentage());\n features->set_steering_percentage(chassis.steering_percentage());\n features->set_gear_location(chassis.gear_location());\n *\/\n}\n\nvoid FeatureGenerator::OnTafficLightDetection(\n const TrafficLightDetection& traffic_light_detection) {\n \/\/ AINFO << \"traffic_light_detection received at frame[\"\n \/\/ << total_learning_data_frame_num_ << \"]\";\n\n traffic_lights_.clear();\n for (int i = 0; i < traffic_light_detection.traffic_light_size(); ++i) {\n const auto& traffic_light_id =\n traffic_light_detection.traffic_light(i).id();\n if (traffic_light_id.empty()) continue;\n\n \/\/ AINFO << \" traffic_light_id[\" << traffic_light_id << \"] color[\"\n \/\/ << traffic_light_detection.traffic_light(i).color() << \"]\";\n traffic_lights_[traffic_light_id] =\n traffic_light_detection.traffic_light(i).color();\n }\n}\n\n\nvoid FeatureGenerator::OnRoutingResponse(\n const apollo::routing::RoutingResponse& routing_response) {\n AINFO << \"routing_response received at frame[\"\n << total_learning_data_frame_num_ << \"]\";\n routing_lane_ids_.clear();\n for (int i = 0; i < routing_response.road_size(); ++i) {\n for (int j = 0; j < routing_response.road(i).passage_size(); ++j) {\n for (int k = 0; k < routing_response.road(i).passage(j).segment_size();\n ++k) {\n routing_lane_ids_.push_back(\n routing_response.road(i).passage(j).segment(k).id());\n }\n }\n }\n}\n\nvoid FeatureGenerator::GenerateTrajectoryPoints(\n const std::list<apollo::localization::LocalizationEstimate>&\n localization_for_label,\n LearningDataFrame* learning_data_frame) {\n int i = -1;\n int cnt = 0;\n\n const int localization_sample_interval_for_trajectory_point =\n FLAGS_localization_freq \/ FLAGS_planning_freq;\n for (const auto& le : localization_for_label) {\n ++i;\n if ((i % localization_sample_interval_for_trajectory_point) != 0) {\n continue;\n }\n auto trajectory_point = learning_data_frame->add_trajectory_point();\n auto& pose = le.pose();\n trajectory_point->mutable_path_point()->set_x(pose.position().x());\n trajectory_point->mutable_path_point()->set_y(pose.position().y());\n trajectory_point->mutable_path_point()->set_z(pose.position().z());\n trajectory_point->mutable_path_point()->set_theta(pose.heading());\n auto v = std::sqrt(pose.linear_velocity().x() * pose.linear_velocity().x() +\n pose.linear_velocity().y() * pose.linear_velocity().y());\n trajectory_point->set_v(v);\n auto a = std::sqrt(\n pose.linear_acceleration().x() * pose.linear_acceleration().x() +\n pose.linear_acceleration().y() * pose.linear_acceleration().y());\n trajectory_point->set_a(a);\n\n cnt++;\n }\n \/\/ AINFO << \"number of trajectory points in one frame: \" << cnt;\n}\n\nvoid FeatureGenerator::GenerateLearningDataFrame() {\n auto learning_data_frame = learning_data_.add_learning_data();\n \/\/ add timestamp_sec & frame_num\n learning_data_frame->set_timestamp_sec(\n localization_for_label_.back().header().timestamp_sec());\n learning_data_frame->set_frame_num(total_learning_data_frame_num_++);\n\n \/\/ add localization\n auto localization = learning_data_frame->mutable_localization();\n const auto& pose = localization_for_label_.back().pose();\n localization->mutable_position()->CopyFrom(pose.position());\n localization->set_heading(pose.heading());\n localization->mutable_linear_velocity()->CopyFrom(pose.linear_velocity());\n localization->mutable_linear_acceleration()->CopyFrom(\n pose.linear_acceleration());\n localization->mutable_angular_velocity()->CopyFrom(pose.angular_velocity());\n\n \/\/ add traffic_light\n learning_data_frame->clear_traffic_light();\n for (const auto& tl : traffic_lights_) {\n auto traffic_light = learning_data_frame->add_traffic_light();\n traffic_light->set_id(tl.first);\n traffic_light->set_color(tl.second);\n }\n\n \/\/ add routing\n auto routing_response = learning_data_frame->mutable_routing_response();\n routing_response->Clear();\n for (const auto& lane_id : routing_lane_ids_) {\n routing_response->add_lane_id(lane_id);\n }\n\n \/\/ add trajectory_points\n GenerateTrajectoryPoints(localization_for_label_, learning_data_frame);\n}\n\nvoid FeatureGenerator::ProcessOfflineData(const std::string& record_filename) {\n RecordReader reader(record_filename);\n if (!reader.IsValid()) {\n AERROR << \"Fail to open \" << record_filename;\n return;\n }\n\n RecordMessage message;\n while (reader.ReadMessage(&message)) {\n if (message.channel_name == FLAGS_chassis_topic) {\n Chassis chassis;\n if (chassis.ParseFromString(message.content)) {\n OnChassis(chassis);\n }\n } else if (message.channel_name == FLAGS_localization_topic) {\n LocalizationEstimate localization;\n if (localization.ParseFromString(message.content)) {\n OnLocalization(localization);\n }\n } else if (message.channel_name == FLAGS_routing_response_topic) {\n RoutingResponse routing_response;\n if (routing_response.ParseFromString(message.content)) {\n OnRoutingResponse(routing_response);\n }\n } else if (message.channel_name == FLAGS_traffic_light_detection_topic) {\n TrafficLightDetection traffic_light_detection;\n if (traffic_light_detection.ParseFromString(message.content)) {\n OnTafficLightDetection(traffic_light_detection);\n }\n }\n }\n}\n\n} \/\/ namespace planning\n} \/\/ namespace apollo\n<|endoftext|>"} {"text":"<commit_before>0f8bf814-2e4d-11e5-9284-b827eb9e62be<commit_msg>0f910f34-2e4d-11e5-9284-b827eb9e62be<commit_after>0f910f34-2e4d-11e5-9284-b827eb9e62be<|endoftext|>"} {"text":"<commit_before>d3bf2f9e-2e4d-11e5-9284-b827eb9e62be<commit_msg>d3c423d2-2e4d-11e5-9284-b827eb9e62be<commit_after>d3c423d2-2e4d-11e5-9284-b827eb9e62be<|endoftext|>"} {"text":"<commit_before>208cfeea-2e4f-11e5-9284-b827eb9e62be<commit_msg>2091f7ba-2e4f-11e5-9284-b827eb9e62be<commit_after>2091f7ba-2e4f-11e5-9284-b827eb9e62be<|endoftext|>"} {"text":"<commit_before>f2024396-2e4e-11e5-9284-b827eb9e62be<commit_msg>f2073b4e-2e4e-11e5-9284-b827eb9e62be<commit_after>f2073b4e-2e4e-11e5-9284-b827eb9e62be<|endoftext|>"} {"text":"<commit_before>\/\/ Jubatus: Online machine learning framework for distributed environment\n\/\/ Copyright (C) 2013 Preferred Networks and Nippon Telegraph and Telephone Corporation.\n\/\/\n\/\/ This library is free software; you can redistribute it and\/or\n\/\/ modify it under the terms of the GNU Lesser General Public\n\/\/ License version 2.1 as published by the Free Software Foundation.\n\/\/\n\/\/ This library is distributed in the hope that it will be useful,\n\/\/ but WITHOUT ANY WARRANTY; without even the implied warranty of\n\/\/ MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU\n\/\/ Lesser General Public License for more details.\n\/\/\n\/\/ You should have received a copy of the GNU Lesser General Public\n\/\/ License along with this library; if not, write to the Free Software\n\/\/ Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA\n\n#ifndef JUBATUS_CLIENT_COMMON_CLIENT_HPP_\n#define JUBATUS_CLIENT_COMMON_CLIENT_HPP_\n\n#include <stdint.h>\n#include <map>\n#include <string>\n#include <jubatus\/msgpack\/rpc\/client.h>\n\nnamespace jubatus {\nnamespace client {\nnamespace common {\n\nclass client {\n public:\n client(const std::string& host,\n uint64_t port,\n const std::string& name,\n unsigned int timeout_sec)\n : c_(host, port), name_(name) {\n c_.set_timeout(timeout_sec);\n }\n\n msgpack::rpc::client& get_client() {\n return c_;\n }\n\n std::string get_config() {\n msgpack::rpc::future f = c_.call(\"get_config\", name_);\n return f.get<std::string>();\n }\n\n bool save(const std::string& id) {\n msgpack::rpc::future f = c_.call(\"save\", name_, id);\n return f.get<bool>();\n }\n\n bool load(const std::string& id) {\n msgpack::rpc::future f = c_.call(\"load\", name_, id);\n return f.get<bool>();\n }\n\n std::map<std::string, std::map<std::string, std::string> > get_status() {\n msgpack::rpc::future f = c_.call(\"get_status\", name_);\n return f.get<std::map<std::string, std::map<std::string, std::string> > >();\n }\n\n bool do_mix() {\n msgpack::rpc::future f = c_.call(\"do_mix\", name_);\n return f.get<bool>();\n }\n\n std::map<std::string, std::map<std::string, std::string> >\n get_proxy_status() {\n msgpack::rpc::future f = c_.call(\"get_proxy_status\", name_);\n return f.get<std::map<std::string, std::map<std::string, std::string> > >();\n }\n\n std::string get_name() const {\n return name_;\n }\n\n void set_name(const std::string& name) {\n name_ = name;\n }\n\n protected:\n msgpack::rpc::client c_;\n std::string name_;\n};\n\n} \/\/ namespace common\n} \/\/ namespace client\n} \/\/ namespace jubatus\n\n#endif \/\/ JUBATUS_CLIENT_COMMON_CLIENT_HPP_\n<commit_msg>Fix return type of save in client<commit_after>\/\/ Jubatus: Online machine learning framework for distributed environment\n\/\/ Copyright (C) 2013 Preferred Networks and Nippon Telegraph and Telephone Corporation.\n\/\/\n\/\/ This library is free software; you can redistribute it and\/or\n\/\/ modify it under the terms of the GNU Lesser General Public\n\/\/ License version 2.1 as published by the Free Software Foundation.\n\/\/\n\/\/ This library is distributed in the hope that it will be useful,\n\/\/ but WITHOUT ANY WARRANTY; without even the implied warranty of\n\/\/ MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU\n\/\/ Lesser General Public License for more details.\n\/\/\n\/\/ You should have received a copy of the GNU Lesser General Public\n\/\/ License along with this library; if not, write to the Free Software\n\/\/ Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA\n\n#ifndef JUBATUS_CLIENT_COMMON_CLIENT_HPP_\n#define JUBATUS_CLIENT_COMMON_CLIENT_HPP_\n\n#include <stdint.h>\n#include <map>\n#include <string>\n#include <jubatus\/msgpack\/rpc\/client.h>\n\nnamespace jubatus {\nnamespace client {\nnamespace common {\n\nclass client {\n public:\n client(const std::string& host,\n uint64_t port,\n const std::string& name,\n unsigned int timeout_sec)\n : c_(host, port), name_(name) {\n c_.set_timeout(timeout_sec);\n }\n\n msgpack::rpc::client& get_client() {\n return c_;\n }\n\n std::string get_config() {\n msgpack::rpc::future f = c_.call(\"get_config\", name_);\n return f.get<std::string>();\n }\n\n std::map<std::string, std::string> save(const std::string& id) {\n msgpack::rpc::future f = c_.call(\"save\", name_, id);\n return f.get<std::map<std::string, std::string> >();\n }\n\n bool load(const std::string& id) {\n msgpack::rpc::future f = c_.call(\"load\", name_, id);\n return f.get<bool>();\n }\n\n std::map<std::string, std::map<std::string, std::string> > get_status() {\n msgpack::rpc::future f = c_.call(\"get_status\", name_);\n return f.get<std::map<std::string, std::map<std::string, std::string> > >();\n }\n\n bool do_mix() {\n msgpack::rpc::future f = c_.call(\"do_mix\", name_);\n return f.get<bool>();\n }\n\n std::map<std::string, std::map<std::string, std::string> >\n get_proxy_status() {\n msgpack::rpc::future f = c_.call(\"get_proxy_status\", name_);\n return f.get<std::map<std::string, std::map<std::string, std::string> > >();\n }\n\n std::string get_name() const {\n return name_;\n }\n\n void set_name(const std::string& name) {\n name_ = name;\n }\n\n protected:\n msgpack::rpc::client c_;\n std::string name_;\n};\n\n} \/\/ namespace common\n} \/\/ namespace client\n} \/\/ namespace jubatus\n\n#endif \/\/ JUBATUS_CLIENT_COMMON_CLIENT_HPP_\n<|endoftext|>"} {"text":"<commit_before>730fca5a-2e4d-11e5-9284-b827eb9e62be<commit_msg>7314b8e4-2e4d-11e5-9284-b827eb9e62be<commit_after>7314b8e4-2e4d-11e5-9284-b827eb9e62be<|endoftext|>"} {"text":"<commit_before>\/******************************************************************************\n\n This source file is part of the MoleQueue project.\n\n Copyright 2012 Kitware, Inc.\n\n This source code is released under the New BSD License, (the \"License\").\n\n Unless required by applicable law or agreed to in writing, software\n distributed under the License is distributed on an \"AS IS\" BASIS,\n WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n See the License for the specific language governing permissions and\n limitations under the License.\n\n******************************************************************************\/\n\n#include \"localsocketconnection.h\"\n\n#include <QtCore\/QDateTime>\n#include <QtCore\/QTimer>\n#include <QtCore\/QDataStream>\n#include <QtNetwork\/QLocalSocket>\n\nnamespace MoleQueue\n{\n\nLocalSocketConnection::LocalSocketConnection(QObject *parentObject,\n QLocalSocket *socket)\n : Connection(parentObject),\n m_connectionString(socket->serverName()),\n m_socket(NULL),\n m_dataStream(new QDataStream),\n m_holdRequests(true)\n{\n setSocket(socket);\n}\n\nLocalSocketConnection::LocalSocketConnection(QObject *parentObject,\n const QString &serverName)\n : Connection(parentObject),\n m_connectionString(serverName),\n m_socket(NULL),\n m_dataStream(new QDataStream),\n m_holdRequests(true)\n{\n setSocket(new QLocalSocket);\n}\n\nLocalSocketConnection::~LocalSocketConnection()\n{\n \/\/ Make sure we are closed\n close();\n\n delete m_socket;\n m_socket = NULL;\n\n delete m_dataStream;\n m_dataStream = NULL;\n\n}\n\nvoid LocalSocketConnection::setSocket(QLocalSocket *socket)\n{\n if (m_socket != NULL) {\n m_socket->abort();\n m_socket->disconnect(this);\n disconnect(m_socket);\n m_socket->deleteLater();\n }\n if (socket != NULL) {\n connect(socket, SIGNAL(readyRead()),\n this, SLOT(readSocket()));\n connect(socket, SIGNAL(disconnected()),\n this, SIGNAL(disconnected()));\n connect(socket, SIGNAL(destroyed()),\n this, SLOT(socketDestroyed()));\n }\n m_dataStream->setDevice(socket);\n m_dataStream->setVersion(QDataStream::Qt_4_8);\n m_socket = socket;\n}\n\nvoid LocalSocketConnection::readSocket()\n{\n if(!m_socket->isValid())\n return;\n\n if (m_holdRequests)\n return;\n\n if (m_socket->bytesAvailable() == 0)\n return;\n\n PacketType packet;\n (*m_dataStream) >> packet;\n\n emit packetReceived(packet, EndpointIdType());\n\n \/\/ Check again in 50 ms if no more data is available, or immediately if there\n \/\/ is. This helps ensure that burst traffic is handled robustly.\n QTimer::singleShot(m_socket->bytesAvailable() > 0 ? 0 : 50,\n this, SLOT(readSocket()));\n}\n\nvoid LocalSocketConnection::open()\n{\n if (m_socket) {\n if(isOpen()) {\n qWarning() << \"Socket already connected to\" << m_connectionString;\n return;\n }\n\n m_socket->connectToServer(m_connectionString);\n }\n else {\n qWarning() << \"No socket set, connection not opened.\";\n }\n}\n\nvoid LocalSocketConnection::start()\n{\n if (m_socket) {\n m_holdRequests = false;\n while (m_socket->bytesAvailable() != 0)\n readSocket();\n }\n}\n\nvoid LocalSocketConnection::close()\n{\n if(m_socket) {\n if(m_socket->isOpen()) {\n m_socket->disconnectFromServer();\n m_socket->close();\n }\n }\n}\n\nbool LocalSocketConnection::isOpen()\n{\n return m_socket != NULL && m_socket->isOpen();\n}\n\nQString LocalSocketConnection::connectionString() const\n{\n return m_connectionString;\n}\n\nbool LocalSocketConnection::send(const PacketType &packet,\n const EndpointIdType &endpoint)\n{\n Q_UNUSED(endpoint);\n (*m_dataStream) << packet;\n\n return true;\n}\n\nvoid LocalSocketConnection::flush()\n{\n m_socket->flush();\n}\n\nvoid LocalSocketConnection::socketDestroyed()\n{\n \/\/ Set to NULL so we know we don't need to clean up\n m_socket = NULL;\n \/\/ Tell anyone listening we have been disconnected.\n emit disconnected();\n}\n\n} \/* namespace MoleQueue *\/\n<commit_msg>Fixed an rpc sending bug for Windows and Qt 5.8<commit_after>\/******************************************************************************\n\n This source file is part of the MoleQueue project.\n\n Copyright 2012 Kitware, Inc.\n\n This source code is released under the New BSD License, (the \"License\").\n\n Unless required by applicable law or agreed to in writing, software\n distributed under the License is distributed on an \"AS IS\" BASIS,\n WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n See the License for the specific language governing permissions and\n limitations under the License.\n\n******************************************************************************\/\n\n#include \"localsocketconnection.h\"\n\n#include <QtCore\/QDateTime>\n#include <QtCore\/QTimer>\n#include <QtCore\/QDataStream>\n#include <QtNetwork\/QLocalSocket>\n\nnamespace MoleQueue\n{\n\nLocalSocketConnection::LocalSocketConnection(QObject *parentObject,\n QLocalSocket *socket)\n : Connection(parentObject),\n m_connectionString(socket->serverName()),\n m_socket(NULL),\n m_dataStream(new QDataStream),\n m_holdRequests(true)\n{\n setSocket(socket);\n}\n\nLocalSocketConnection::LocalSocketConnection(QObject *parentObject,\n const QString &serverName)\n : Connection(parentObject),\n m_connectionString(serverName),\n m_socket(NULL),\n m_dataStream(new QDataStream),\n m_holdRequests(true)\n{\n setSocket(new QLocalSocket);\n}\n\nLocalSocketConnection::~LocalSocketConnection()\n{\n \/\/ Make sure we are closed\n close();\n\n delete m_socket;\n m_socket = NULL;\n\n delete m_dataStream;\n m_dataStream = NULL;\n\n}\n\nvoid LocalSocketConnection::setSocket(QLocalSocket *socket)\n{\n if (m_socket != NULL) {\n m_socket->abort();\n m_socket->disconnect(this);\n disconnect(m_socket);\n m_socket->deleteLater();\n }\n if (socket != NULL) {\n connect(socket, SIGNAL(readyRead()),\n this, SLOT(readSocket()));\n connect(socket, SIGNAL(disconnected()),\n this, SIGNAL(disconnected()));\n connect(socket, SIGNAL(destroyed()),\n this, SLOT(socketDestroyed()));\n }\n m_dataStream->setDevice(socket);\n m_dataStream->setVersion(QDataStream::Qt_4_8);\n m_socket = socket;\n}\n\nvoid LocalSocketConnection::readSocket()\n{\n if(!m_socket->isValid())\n return;\n\n if (m_holdRequests)\n return;\n\n if (m_socket->bytesAvailable() == 0)\n return;\n\n PacketType packet;\n (*m_dataStream) >> packet;\n\n emit packetReceived(packet, EndpointIdType());\n\n \/\/ Check again in 50 ms if no more data is available, or immediately if there\n \/\/ is. This helps ensure that burst traffic is handled robustly.\n QTimer::singleShot(m_socket->bytesAvailable() > 0 ? 0 : 50,\n this, SLOT(readSocket()));\n}\n\nvoid LocalSocketConnection::open()\n{\n if (m_socket) {\n if(isOpen()) {\n qWarning() << \"Socket already connected to\" << m_connectionString;\n return;\n }\n\n m_socket->connectToServer(m_connectionString);\n }\n else {\n qWarning() << \"No socket set, connection not opened.\";\n }\n}\n\nvoid LocalSocketConnection::start()\n{\n if (m_socket) {\n m_holdRequests = false;\n while (m_socket->bytesAvailable() != 0)\n readSocket();\n }\n}\n\nvoid LocalSocketConnection::close()\n{\n if(m_socket) {\n if(m_socket->isOpen()) {\n m_socket->disconnectFromServer();\n m_socket->close();\n }\n }\n}\n\nbool LocalSocketConnection::isOpen()\n{\n return m_socket != NULL && m_socket->isOpen();\n}\n\nQString LocalSocketConnection::connectionString() const\n{\n return m_connectionString;\n}\n\nbool LocalSocketConnection::send(const PacketType &packet,\n const EndpointIdType &endpoint)\n{\n Q_UNUSED(endpoint);\n\n \/\/ Because of a possible bug with Qt 5.8 and 5.9 on Windows,\n \/\/ (*m_dataStream) << packet\n \/\/ sends two packets instead of one. The packets will fail to get read\n \/\/ correctly on the other side of the message. To fix this, we write the\n \/\/ message to a byte array and send it in all together as a single raw data\n \/\/ packet. If this bug gets fixed in the future, we will not need the\n \/\/ Windows section...\n \/\/ See https:\/\/bugreports.qt.io\/browse\/QTBUG-61097 for the bug report.\n#ifdef _WIN32\n PacketType byteArray;\n QDataStream tmpStream(&byteArray, QIODevice::WriteOnly);\n tmpStream << packet;\n m_dataStream->writeRawData(byteArray, byteArray.size());\n#else\n (*m_dataStream) << packet;\n#endif\n\n return true;\n}\n\nvoid LocalSocketConnection::flush()\n{\n m_socket->flush();\n}\n\nvoid LocalSocketConnection::socketDestroyed()\n{\n \/\/ Set to NULL so we know we don't need to clean up\n m_socket = NULL;\n \/\/ Tell anyone listening we have been disconnected.\n emit disconnected();\n}\n\n} \/* namespace MoleQueue *\/\n<|endoftext|>"} {"text":"<commit_before>07b588f2-2e4e-11e5-9284-b827eb9e62be<commit_msg>07ba8d98-2e4e-11e5-9284-b827eb9e62be<commit_after>07ba8d98-2e4e-11e5-9284-b827eb9e62be<|endoftext|>"} {"text":"<commit_before>e887eca8-2e4e-11e5-9284-b827eb9e62be<commit_msg>e894b0b4-2e4e-11e5-9284-b827eb9e62be<commit_after>e894b0b4-2e4e-11e5-9284-b827eb9e62be<|endoftext|>"} {"text":"<commit_before>636c506e-2e4d-11e5-9284-b827eb9e62be<commit_msg>63715960-2e4d-11e5-9284-b827eb9e62be<commit_after>63715960-2e4d-11e5-9284-b827eb9e62be<|endoftext|>"} {"text":"<commit_before>c35ce050-2e4e-11e5-9284-b827eb9e62be<commit_msg>c361dc04-2e4e-11e5-9284-b827eb9e62be<commit_after>c361dc04-2e4e-11e5-9284-b827eb9e62be<|endoftext|>"} {"text":"<commit_before>6a067728-2e4e-11e5-9284-b827eb9e62be<commit_msg>6a0b74bc-2e4e-11e5-9284-b827eb9e62be<commit_after>6a0b74bc-2e4e-11e5-9284-b827eb9e62be<|endoftext|>"} {"text":"<commit_before>815498c0-2e4d-11e5-9284-b827eb9e62be<commit_msg>81599c6c-2e4d-11e5-9284-b827eb9e62be<commit_after>81599c6c-2e4d-11e5-9284-b827eb9e62be<|endoftext|>"} {"text":"<commit_before>4db6f256-2e4d-11e5-9284-b827eb9e62be<commit_msg>4dbbff12-2e4d-11e5-9284-b827eb9e62be<commit_after>4dbbff12-2e4d-11e5-9284-b827eb9e62be<|endoftext|>"} {"text":"<commit_before>6d221318-2e4e-11e5-9284-b827eb9e62be<commit_msg>6d27167e-2e4e-11e5-9284-b827eb9e62be<commit_after>6d27167e-2e4e-11e5-9284-b827eb9e62be<|endoftext|>"} {"text":"<commit_before>b8c890a8-2e4e-11e5-9284-b827eb9e62be<commit_msg>b8cda318-2e4e-11e5-9284-b827eb9e62be<commit_after>b8cda318-2e4e-11e5-9284-b827eb9e62be<|endoftext|>"} {"text":"<commit_before>87fe0340-2e4e-11e5-9284-b827eb9e62be<commit_msg>880319f2-2e4e-11e5-9284-b827eb9e62be<commit_after>880319f2-2e4e-11e5-9284-b827eb9e62be<|endoftext|>"} {"text":"<commit_before>a54264be-2e4e-11e5-9284-b827eb9e62be<commit_msg>a5478c0a-2e4e-11e5-9284-b827eb9e62be<commit_after>a5478c0a-2e4e-11e5-9284-b827eb9e62be<|endoftext|>"} {"text":"<commit_before>c3280b48-2e4c-11e5-9284-b827eb9e62be<commit_msg>c32d0102-2e4c-11e5-9284-b827eb9e62be<commit_after>c32d0102-2e4c-11e5-9284-b827eb9e62be<|endoftext|>"} {"text":"<commit_before>ac45bee6-2e4e-11e5-9284-b827eb9e62be<commit_msg>ac4abba8-2e4e-11e5-9284-b827eb9e62be<commit_after>ac4abba8-2e4e-11e5-9284-b827eb9e62be<|endoftext|>"} {"text":"<commit_before>b84e9296-2e4c-11e5-9284-b827eb9e62be<commit_msg>b853d35a-2e4c-11e5-9284-b827eb9e62be<commit_after>b853d35a-2e4c-11e5-9284-b827eb9e62be<|endoftext|>"} {"text":"<commit_before>3912e51a-2e4f-11e5-9284-b827eb9e62be<commit_msg>3917deb2-2e4f-11e5-9284-b827eb9e62be<commit_after>3917deb2-2e4f-11e5-9284-b827eb9e62be<|endoftext|>"} {"text":"<commit_before>06acf9d6-2e4e-11e5-9284-b827eb9e62be<commit_msg>06b1f5c6-2e4e-11e5-9284-b827eb9e62be<commit_after>06b1f5c6-2e4e-11e5-9284-b827eb9e62be<|endoftext|>"} {"text":"<commit_before>5b43e14a-2e4d-11e5-9284-b827eb9e62be<commit_msg>5b48e7e4-2e4d-11e5-9284-b827eb9e62be<commit_after>5b48e7e4-2e4d-11e5-9284-b827eb9e62be<|endoftext|>"} {"text":"<commit_before>75befe2e-2e4d-11e5-9284-b827eb9e62be<commit_msg>75c3f082-2e4d-11e5-9284-b827eb9e62be<commit_after>75c3f082-2e4d-11e5-9284-b827eb9e62be<|endoftext|>"} {"text":"<commit_before>8bae7ed4-2e4e-11e5-9284-b827eb9e62be<commit_msg>8bb3df28-2e4e-11e5-9284-b827eb9e62be<commit_after>8bb3df28-2e4e-11e5-9284-b827eb9e62be<|endoftext|>"} {"text":"<commit_before>822ce4e6-2e4d-11e5-9284-b827eb9e62be<commit_msg>8231dffa-2e4d-11e5-9284-b827eb9e62be<commit_after>8231dffa-2e4d-11e5-9284-b827eb9e62be<|endoftext|>"} {"text":"<commit_before>97fd91ee-2e4d-11e5-9284-b827eb9e62be<commit_msg>98028ec4-2e4d-11e5-9284-b827eb9e62be<commit_after>98028ec4-2e4d-11e5-9284-b827eb9e62be<|endoftext|>"} {"text":"<commit_before>f41cf0a0-2e4d-11e5-9284-b827eb9e62be<commit_msg>f4220072-2e4d-11e5-9284-b827eb9e62be<commit_after>f4220072-2e4d-11e5-9284-b827eb9e62be<|endoftext|>"} {"text":"<commit_before>\/*\n * Copyright 2015 Cloudius Systems\n *\/\n\n\/*\n * This file is part of Scylla.\n *\n * Scylla is free software: you can redistribute it and\/or modify\n * it under the terms of the GNU Affero General Public License as published by\n * the Free Software Foundation, either version 3 of the License, or\n * (at your option) any later version.\n *\n * Scylla is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the\n * GNU General Public License for more details.\n *\n * You should have received a copy of the GNU General Public License\n * along with Scylla. If not, see <http:\/\/www.gnu.org\/licenses\/>.\n *\/\n\n#define BOOST_TEST_DYN_LINK\n#define BOOST_TEST_MODULE core\n\n#include <boost\/test\/unit_test.hpp>\n\n#include \"frozen_mutation.hh\"\n#include \"schema_builder.hh\"\n#include \"tests\/mutation_assertions.hh\"\n\nstatic schema_builder new_table() {\n return { \"some_keyspace\", \"some_table\" };\n}\n\nstatic api::timestamp_type new_timestamp() {\n static api::timestamp_type t = 0;\n return t++;\n};\n\nstatic tombstone new_tombstone() {\n return { new_timestamp(), gc_clock::now() };\n};\n\nBOOST_AUTO_TEST_CASE(test_writing_and_reading) {\n schema_ptr s = new_table()\n .with_column(\"pk_col\", bytes_type, column_kind::partition_key)\n .with_column(\"ck_col_1\", bytes_type, column_kind::clustering_key)\n .with_column(\"ck_col_2\", bytes_type, column_kind::clustering_key)\n .with_column(\"regular_col_1\", bytes_type)\n .with_column(\"regular_col_2\", bytes_type)\n .with_column(\"static_col_1\", bytes_type, column_kind::static_column)\n .with_column(\"static_col_2\", bytes_type, column_kind::static_column)\n .build();\n\n partition_key key = partition_key::from_single_value(*s, bytes(\"key\"));\n clustering_key ck1 = clustering_key::from_deeply_exploded(*s, {data_value(bytes(\"ck1_0\")), data_value(bytes(\"ck1_1\"))});\n clustering_key ck2 = clustering_key::from_deeply_exploded(*s, {data_value(bytes(\"ck2_0\")), data_value(bytes(\"ck2_1\"))});\n auto ttl = gc_clock::duration(1);\n\n auto test_freezing = [] (const mutation& m) {\n assert_that(freeze(m).unfreeze(m.schema())).is_equal_to(m);\n };\n\n mutation m(key, s);\n m.partition().apply(new_tombstone());\n\n test_freezing(m);\n\n m.partition().apply_delete(*s, ck2, new_tombstone());\n\n test_freezing(m);\n\n m.partition().apply_row_tombstone(*s, clustering_key_prefix::from_deeply_exploded(*s, {data_value(bytes(\"ck2_0\"))}), new_tombstone());\n\n test_freezing(m);\n\n m.set_clustered_cell(ck1, \"regular_col_1\", data_value(bytes(\"regular_col_value\")), new_timestamp(), ttl);\n\n test_freezing(m);\n\n m.set_clustered_cell(ck1, \"regular_col_2\", data_value(bytes(\"regular_col_value\")), new_timestamp(), ttl);\n\n test_freezing(m);\n\n m.partition().apply_insert(*s, ck2, new_timestamp());\n\n test_freezing(m);\n\n m.set_clustered_cell(ck2, \"regular_col_1\", data_value(bytes(\"ck2_regular_col_1_value\")), new_timestamp());\n\n test_freezing(m);\n\n m.set_static_cell(\"static_col_1\", data_value(bytes(\"static_col_value\")), new_timestamp(), ttl);\n\n test_freezing(m);\n\n m.set_static_cell(\"static_col_2\", data_value(bytes(\"static_col_value\")), new_timestamp());\n\n test_freezing(m);\n\n {\n auto fm = freeze(m);\n auto dk = fm.decorated_key(*s);\n BOOST_REQUIRE(dk.equal(*s, m.decorated_key()));\n }\n}\n\nBOOST_AUTO_TEST_CASE(test_application_of_partition_view_has_the_same_effect_as_applying_regular_mutation) {\n schema_ptr s = new_table()\n .with_column(\"pk_col\", bytes_type, column_kind::partition_key)\n .with_column(\"ck_1\", bytes_type, column_kind::clustering_key)\n .with_column(\"reg_1\", bytes_type)\n .with_column(\"reg_2\", bytes_type)\n .with_column(\"static_1\", bytes_type, column_kind::static_column)\n .build();\n\n partition_key key = partition_key::from_single_value(*s, bytes(\"key\"));\n clustering_key ck = clustering_key::from_deeply_exploded(*s, {data_value(bytes(\"ck\"))});\n\n mutation m1(key, s);\n m1.partition().apply(new_tombstone());\n m1.set_clustered_cell(ck, \"reg_1\", data_value(bytes(\"val1\")), new_timestamp());\n m1.set_clustered_cell(ck, \"reg_2\", data_value(bytes(\"val2\")), new_timestamp());\n m1.partition().apply_insert(*s, ck, new_timestamp());\n m1.set_static_cell(\"static_1\", data_value(bytes(\"val3\")), new_timestamp());\n\n mutation m2(key, s);\n m2.set_clustered_cell(ck, \"reg_1\", data_value(bytes(\"val4\")), new_timestamp());\n m2.partition().apply_insert(*s, ck, new_timestamp());\n m2.set_static_cell(\"static_1\", data_value(bytes(\"val5\")), new_timestamp());\n\n mutation m_frozen(key, s);\n m_frozen.partition().apply(*s, freeze(m1).partition());\n m_frozen.partition().apply(*s, freeze(m2).partition());\n\n mutation m_unfrozen(key, s);\n m_unfrozen.partition().apply(*s, m1.partition());\n m_unfrozen.partition().apply(*s, m2.partition());\n\n mutation m_refrozen(key, s);\n m_refrozen.partition().apply(*s, freeze(m1).unfreeze(s).partition());\n m_refrozen.partition().apply(*s, freeze(m2).unfreeze(s).partition());\n\n assert_that(m_unfrozen).is_equal_to(m_refrozen);\n assert_that(m_unfrozen).is_equal_to(m_frozen);\n}\n<commit_msg>tests: Use mutation generators in frozen_mutation_test<commit_after>\/*\n * Copyright 2015 Cloudius Systems\n *\/\n\n\/*\n * This file is part of Scylla.\n *\n * Scylla is free software: you can redistribute it and\/or modify\n * it under the terms of the GNU Affero General Public License as published by\n * the Free Software Foundation, either version 3 of the License, or\n * (at your option) any later version.\n *\n * Scylla is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the\n * GNU General Public License for more details.\n *\n * You should have received a copy of the GNU General Public License\n * along with Scylla. If not, see <http:\/\/www.gnu.org\/licenses\/>.\n *\/\n\n#define BOOST_TEST_DYN_LINK\n#define BOOST_TEST_MODULE core\n\n#include <boost\/test\/unit_test.hpp>\n\n#include \"frozen_mutation.hh\"\n#include \"schema_builder.hh\"\n#include \"tests\/mutation_assertions.hh\"\n#include \"tests\/mutation_source_test.hh\"\n\nstatic schema_builder new_table() {\n return { \"some_keyspace\", \"some_table\" };\n}\n\nstatic api::timestamp_type new_timestamp() {\n static api::timestamp_type t = 0;\n return t++;\n};\n\nstatic tombstone new_tombstone() {\n return { new_timestamp(), gc_clock::now() };\n};\n\nBOOST_AUTO_TEST_CASE(test_writing_and_reading) {\n for_each_mutation([] (const mutation& m) {\n auto frozen = freeze(m);\n BOOST_REQUIRE_EQUAL(frozen.schema_version(), m.schema()->version());\n assert_that(frozen.unfreeze(m.schema())).is_equal_to(m);\n BOOST_REQUIRE(frozen.decorated_key(*m.schema()).equal(*m.schema(), m.decorated_key()));\n });\n}\n\nBOOST_AUTO_TEST_CASE(test_application_of_partition_view_has_the_same_effect_as_applying_regular_mutation) {\n schema_ptr s = new_table()\n .with_column(\"pk_col\", bytes_type, column_kind::partition_key)\n .with_column(\"ck_1\", bytes_type, column_kind::clustering_key)\n .with_column(\"reg_1\", bytes_type)\n .with_column(\"reg_2\", bytes_type)\n .with_column(\"static_1\", bytes_type, column_kind::static_column)\n .build();\n\n partition_key key = partition_key::from_single_value(*s, bytes(\"key\"));\n clustering_key ck = clustering_key::from_deeply_exploded(*s, {data_value(bytes(\"ck\"))});\n\n mutation m1(key, s);\n m1.partition().apply(new_tombstone());\n m1.set_clustered_cell(ck, \"reg_1\", data_value(bytes(\"val1\")), new_timestamp());\n m1.set_clustered_cell(ck, \"reg_2\", data_value(bytes(\"val2\")), new_timestamp());\n m1.partition().apply_insert(*s, ck, new_timestamp());\n m1.set_static_cell(\"static_1\", data_value(bytes(\"val3\")), new_timestamp());\n\n mutation m2(key, s);\n m2.set_clustered_cell(ck, \"reg_1\", data_value(bytes(\"val4\")), new_timestamp());\n m2.partition().apply_insert(*s, ck, new_timestamp());\n m2.set_static_cell(\"static_1\", data_value(bytes(\"val5\")), new_timestamp());\n\n mutation m_frozen(key, s);\n m_frozen.partition().apply(*s, freeze(m1).partition());\n m_frozen.partition().apply(*s, freeze(m2).partition());\n\n mutation m_unfrozen(key, s);\n m_unfrozen.partition().apply(*s, m1.partition());\n m_unfrozen.partition().apply(*s, m2.partition());\n\n mutation m_refrozen(key, s);\n m_refrozen.partition().apply(*s, freeze(m1).unfreeze(s).partition());\n m_refrozen.partition().apply(*s, freeze(m2).unfreeze(s).partition());\n\n assert_that(m_unfrozen).is_equal_to(m_refrozen);\n assert_that(m_unfrozen).is_equal_to(m_frozen);\n}\n<|endoftext|>"} {"text":"<commit_before>facc00fe-2e4c-11e5-9284-b827eb9e62be<commit_msg>fad0f2d0-2e4c-11e5-9284-b827eb9e62be<commit_after>fad0f2d0-2e4c-11e5-9284-b827eb9e62be<|endoftext|>"} {"text":"<commit_before>1115bfb0-2e4f-11e5-9284-b827eb9e62be<commit_msg>111ab858-2e4f-11e5-9284-b827eb9e62be<commit_after>111ab858-2e4f-11e5-9284-b827eb9e62be<|endoftext|>"} {"text":"<commit_before>f6cd0380-2e4d-11e5-9284-b827eb9e62be<commit_msg>f6d1f64c-2e4d-11e5-9284-b827eb9e62be<commit_after>f6d1f64c-2e4d-11e5-9284-b827eb9e62be<|endoftext|>"} {"text":"<commit_before>\/\/=============================================================================================================\n\/**\n* @file test_forward_solution.cpp\n* @author Christoph Dinh <chdinh@nmr.mgh.harvard.edu>;\n* Matti Hamalainen <msh@nmr.mgh.harvard.edu>\n* @version 1.0\n* @date December, 2016\n*\n* @section LICENSE\n*\n* Copyright (C) 2016, 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 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 The forward solution test implementation\n*\n*\/\n\n\n\/\/*************************************************************************************************************\n\/\/=============================================================================================================\n\/\/ INCLUDES\n\/\/=============================================================================================================\n\n#include <fwd\/computeFwd\/compute_fwd_settings.h>\n#include <fwd\/computeFwd\/compute_fwd.h>\n\n\n\/\/*************************************************************************************************************\n\/\/=============================================================================================================\n\/\/ QT INCLUDES\n\/\/=============================================================================================================\n\n#include <QtTest>\n\n\n\/\/*************************************************************************************************************\n\/\/=============================================================================================================\n\/\/ USED NAMESPACES\n\/\/=============================================================================================================\n\nusing namespace FWDLIB;\n\n\n\/\/=============================================================================================================\n\/**\n* DECLARE CLASS TestForwardSolution\n*\n* @brief The TestForwardSolution class provides dipole fit tests\n*\n*\/\nclass TestForwardSolution : public QObject\n{\n Q_OBJECT\n\npublic:\n TestForwardSolution();\n\nprivate slots:\n void initTestCase();\n void computeForward();\n void cleanupTestCase();\n\nprivate:\n void compareForward();\n\n double epsilon;\n\n};\n\n\n\/\/*************************************************************************************************************\n\nTestForwardSolution::TestForwardSolution()\n: epsilon(0.000001)\n{\n}\n\n\n\/\/*************************************************************************************************************\n\nvoid TestForwardSolution::initTestCase()\n{\n\n}\n\n\n\/\/*************************************************************************************************************\n\nvoid TestForwardSolution::computeForward()\n{\n QString refFileName(QDir::currentPath()+\"\/mne-cpp-test-data\/Result\/ref_dip_fit.dat\");\n QFile testFile;\n\n \/\/*********************************************************************************************************\n \/\/ Forward Solution Settings\n \/\/*********************************************************************************************************\n\n printf(\">>>>>>>>>>>>>>>>>>>>>>>>> Forward Solution Settings >>>>>>>>>>>>>>>>>>>>>>>>>\\n\");\n\n \/\/Following is equivalent to: --meg --accurate --src .\/MNE-sample-data\/subjects\/sample\/bem\/sample-oct-6-src.fif\n \/\/ --meas .\/MNE-sample-data\/MEG\/sample\/sample_audvis_raw.fif\n \/\/ --mri .\/MNE-sample-data\/subjects\/sample\/mri\/brain-neuromag\/sets\/COR.fif\n \/\/ --bem .\/MNE-sample-data\/subjects\/sample\/bem\/sample-5120-5120-5120-bem.fif\n \/\/ --mindist 5 --fwd .\/MNE-sample-data\/Result\/sample_audvis-meg-oct-6-fwd.fif\n ComputeFwdSettings settings;\n\n settings.include_meg = true;\n settings.accurate = true;\n settings.srcname = QDir::currentPath()+\".\/MNE-sample-data\/subjects\/sample\/bem\/sample-oct-6-src.fif\";\n settings.measname = QDir::currentPath()+\".\/MNE-sample-data\/MEG\/sample\/sample_audvis_raw.fif\";\n settings.mriname = QDir::currentPath()+\".\/MNE-sample-data\/subjects\/sample\/mri\/brain-neuromag\/sets\/COR.fif\";\n settings.mri_head_ident = false;\n settings.transname.clear();\n settings.bemname = QDir::currentPath()+\".\/MNE-sample-data\/subjects\/sample\/bem\/sample-5120-5120-5120-bem.fif\";\n settings.mindist = 5.0f\/1000.0f;\n settings.solname = QDir::currentPath()+\".\/mne-cpp-test-data\/Result\/sample_audvis-meg-oct-6-fwd.fif\";\n\n settings.checkIntegrity();\n\n printf(\"<<<<<<<<<<<<<<<<<<<<<<<<< Forward Solution Settings Finished <<<<<<<<<<<<<<<<<<<<<<<<<\\n\");\n\n\n \/\/*********************************************************************************************************\n \/\/ Compute Forward Solution\n \/\/*********************************************************************************************************\n\n printf(\">>>>>>>>>>>>>>>>>>>>>>>>> Compute Forward Solution >>>>>>>>>>>>>>>>>>>>>>>>>\\n\");\n\n ComputeFwd cmpFwd(&settings);\n cmpFwd.calculateFwd();\n\n printf(\"<<<<<<<<<<<<<<<<<<<<<<<<< Compute Forward Solution Finished <<<<<<<<<<<<<<<<<<<<<<<<<\\n\");\n\n \/\/*********************************************************************************************************\n \/\/ Write Forward Solution\n \/\/*********************************************************************************************************\n\n\n \/\/*********************************************************************************************************\n \/\/ Load reference Dipole Set\n \/\/*********************************************************************************************************\n\n\n \/\/*********************************************************************************************************\n \/\/ Compare Fit\n \/\/*********************************************************************************************************\n\n compareForward();\n}\n\n\n\/\/*************************************************************************************************************\n\nvoid TestForwardSolution::compareForward()\n{\n \/\/*********************************************************************************************************\n \/\/ Write Read Forward Solution\n \/\/*********************************************************************************************************\n\n printf(\">>>>>>>>>>>>>>>>>>>>>>>>> Compare Forward Solution >>>>>>>>>>>>>>>>>>>>>>>>>\\n\");\n\n\/\/ QVERIFY( m_refECDSet.size() == m_ECDSet.size() );\n\n\/\/ for (int i = 0; i < m_refECDSet.size(); ++i)\n\/\/ {\n\/\/ printf(\"Compare orig Dipole %d: %7.1f %7.1f %8.2f %8.2f %8.2f %8.3f %8.3f %8.3f %8.3f %6.1f\\n\", i,\n\/\/ 1000*m_ECDSet[i].time,1000*m_ECDSet[i].time,\n\/\/ 1000*m_ECDSet[i].rd[0],1000*m_ECDSet[i].rd[1],1000*m_ECDSet[i].rd[2],\n\/\/ 1e9*m_ECDSet[i].Q.norm(),1e9*m_ECDSet[i].Q[0],1e9*m_ECDSet[i].Q[1],1e9*m_ECDSet[i].Q[2],100.0*m_ECDSet[i].good);\n\/\/ printf(\" ref Dipole %d: %7.1f %7.1f %8.2f %8.2f %8.2f %8.3f %8.3f %8.3f %8.3f %6.1f\\n\", i,\n\/\/ 1000*m_refECDSet[i].time,1000*m_refECDSet[i].time,\n\/\/ 1000*m_refECDSet[i].rd[0],1000*m_refECDSet[i].rd[1],1000*m_refECDSet[i].rd[2],\n\/\/ 1e9*m_refECDSet[i].Q.norm(),1e9*m_refECDSet[i].Q[0],1e9*m_refECDSet[i].Q[1],1e9*m_refECDSet[i].Q[2],100.0*m_refECDSet[i].good);\n\n\/\/ QVERIFY( m_ECDSet[i].valid == m_refECDSet[i].valid );\n\/\/ QVERIFY( m_ECDSet[i].time - m_refECDSet[i].time < epsilon );\n\/\/ QVERIFY( m_ECDSet[i].rd == m_refECDSet[i].rd );\n\/\/ QVERIFY( m_ECDSet[i].Q == m_refECDSet[i].Q );\n\/\/ QVERIFY( m_ECDSet[i].good - m_refECDSet[i].good < epsilon );\n\/\/ QVERIFY( m_ECDSet[i].khi2 - m_refECDSet[i].khi2 < epsilon );\n\/\/ QVERIFY( m_ECDSet[i].nfree == m_refECDSet[i].nfree );\n\/\/ QVERIFY( m_ECDSet[i].neval == m_refECDSet[i].neval );\n\/\/ }\n\n printf(\"<<<<<<<<<<<<<<<<<<<<<<<<< Compare Forward Solution Finished <<<<<<<<<<<<<<<<<<<<<<<<<\\n\");\n}\n\n\n\/\/*************************************************************************************************************\n\nvoid TestForwardSolution::cleanupTestCase()\n{\n}\n\n\n\/\/*************************************************************************************************************\n\/\/=============================================================================================================\n\/\/ MAIN\n\/\/=============================================================================================================\n\nQTEST_APPLESS_MAIN(TestForwardSolution)\n#include \"test_forward_solution.moc\"\n<commit_msg>Adjusting Fwd test<commit_after>\/\/=============================================================================================================\n\/**\n* @file test_forward_solution.cpp\n* @author Christoph Dinh <chdinh@nmr.mgh.harvard.edu>;\n* Matti Hamalainen <msh@nmr.mgh.harvard.edu>\n* @version 1.0\n* @date December, 2016\n*\n* @section LICENSE\n*\n* Copyright (C) 2016, 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 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 The forward solution test implementation\n*\n*\/\n\n\n\/\/*************************************************************************************************************\n\/\/=============================================================================================================\n\/\/ INCLUDES\n\/\/=============================================================================================================\n\n#include <fwd\/computeFwd\/compute_fwd_settings.h>\n#include <fwd\/computeFwd\/compute_fwd.h>\n#include <mne\/mne.h>\n\n\n\/\/*************************************************************************************************************\n\/\/=============================================================================================================\n\/\/ QT INCLUDES\n\/\/=============================================================================================================\n\n#include <QtTest>\n\n\n\/\/*************************************************************************************************************\n\/\/=============================================================================================================\n\/\/ USED NAMESPACES\n\/\/=============================================================================================================\n\nusing namespace FWDLIB;\nusing namespace MNELIB;\n\n\n\/\/=============================================================================================================\n\/**\n* DECLARE CLASS TestForwardSolution\n*\n* @brief The TestForwardSolution class provides dipole fit tests\n*\n*\/\nclass TestForwardSolution : public QObject\n{\n Q_OBJECT\n\npublic:\n TestForwardSolution();\n\nprivate slots:\n void initTestCase();\n void computeForward();\n void cleanupTestCase();\n\nprivate:\n void compareForward();\n\n double epsilon;\n\n};\n\n\n\/\/*************************************************************************************************************\n\nTestForwardSolution::TestForwardSolution()\n: epsilon(0.000001)\n{\n}\n\n\n\/\/*************************************************************************************************************\n\nvoid TestForwardSolution::initTestCase()\n{\n\n}\n\n\n\/\/*************************************************************************************************************\n\nvoid TestForwardSolution::computeForward()\n{\n \/\/*********************************************************************************************************\n \/\/ Forward Solution Settings\n \/\/*********************************************************************************************************\n\n printf(\">>>>>>>>>>>>>>>>>>>>>>>>> Forward Solution Settings >>>>>>>>>>>>>>>>>>>>>>>>>\\n\");\n\n \/\/Following is equivalent to: --meg --accurate --src .\/MNE-sample-data\/subjects\/sample\/bem\/sample-oct-6-src.fif\n \/\/ --meas .\/MNE-sample-data\/MEG\/sample\/sample_audvis_raw.fif\n \/\/ --mri .\/MNE-sample-data\/subjects\/sample\/mri\/brain-neuromag\/sets\/COR.fif\n \/\/ --bem .\/MNE-sample-data\/subjects\/sample\/bem\/sample-5120-5120-5120-bem.fif\n \/\/ --mindist 5 --fwd .\/MNE-sample-data\/Result\/sample_audvis-meg-oct-6-fwd.fif\n ComputeFwdSettings settings;\n\n settings.include_meg = true;\n settings.accurate = true;\n settings.srcname = QDir::currentPath()+\".\/MNE-sample-data\/subjects\/sample\/bem\/sample-oct-6-src.fif\";\n settings.measname = QDir::currentPath()+\".\/MNE-sample-data\/MEG\/sample\/sample_audvis_raw.fif\";\n settings.mriname = QDir::currentPath()+\".\/MNE-sample-data\/subjects\/sample\/mri\/brain-neuromag\/sets\/COR.fif\";\n settings.mri_head_ident = false;\n settings.transname.clear();\n settings.bemname = QDir::currentPath()+\".\/MNE-sample-data\/subjects\/sample\/bem\/sample-5120-5120-5120-bem.fif\";\n settings.mindist = 5.0f\/1000.0f;\n settings.solname = QDir::currentPath()+\".\/mne-cpp-test-data\/Result\/sample_audvis-meg-oct-6-fwd.fif\";\n\n settings.checkIntegrity();\n\n printf(\"<<<<<<<<<<<<<<<<<<<<<<<<< Forward Solution Settings Finished <<<<<<<<<<<<<<<<<<<<<<<<<\\n\");\n\n\n \/\/*********************************************************************************************************\n \/\/ Compute Forward Solution\n \/\/*********************************************************************************************************\n\n printf(\">>>>>>>>>>>>>>>>>>>>>>>>> Compute Forward Solution >>>>>>>>>>>>>>>>>>>>>>>>>\\n\");\n\n ComputeFwd cmpFwd(&settings);\n cmpFwd.calculateFwd();\n\n printf(\"<<<<<<<<<<<<<<<<<<<<<<<<< Compute Forward Solution Finished <<<<<<<<<<<<<<<<<<<<<<<<<\\n\");\n\n \/\/*********************************************************************************************************\n \/\/ Write Forward Solution\n \/\/*********************************************************************************************************\n\n\n \/\/*********************************************************************************************************\n \/\/ Load reference Dipole Set\n \/\/*********************************************************************************************************\n\n\n \/\/*********************************************************************************************************\n \/\/ Compare Fit\n \/\/*********************************************************************************************************\n\n compareForward();\n}\n\n\n\/\/*************************************************************************************************************\n\nvoid TestForwardSolution::compareForward()\n{\n \/\/*********************************************************************************************************\n \/\/ Write Read Forward Solution\n \/\/*********************************************************************************************************\n\n printf(\">>>>>>>>>>>>>>>>>>>>>>>>> Compare Forward Solution >>>>>>>>>>>>>>>>>>>>>>>>>\\n\");\n\n QString refFwdFileName(QDir::currentPath()+\".\/mne-cpp-test-data\/Result\/sample_audvis-meg-oct-6-fwd.fif\");\n\n \/\/Load data\n MNEForwardSolution t_Fwd(refFwdFileName);\n\n\/\/ QVERIFY( m_refECDSet.size() == m_ECDSet.size() );\n\n\/\/ for (int i = 0; i < m_refECDSet.size(); ++i)\n\/\/ {\n\/\/ printf(\"Compare orig Dipole %d: %7.1f %7.1f %8.2f %8.2f %8.2f %8.3f %8.3f %8.3f %8.3f %6.1f\\n\", i,\n\/\/ 1000*m_ECDSet[i].time,1000*m_ECDSet[i].time,\n\/\/ 1000*m_ECDSet[i].rd[0],1000*m_ECDSet[i].rd[1],1000*m_ECDSet[i].rd[2],\n\/\/ 1e9*m_ECDSet[i].Q.norm(),1e9*m_ECDSet[i].Q[0],1e9*m_ECDSet[i].Q[1],1e9*m_ECDSet[i].Q[2],100.0*m_ECDSet[i].good);\n\/\/ printf(\" ref Dipole %d: %7.1f %7.1f %8.2f %8.2f %8.2f %8.3f %8.3f %8.3f %8.3f %6.1f\\n\", i,\n\/\/ 1000*m_refECDSet[i].time,1000*m_refECDSet[i].time,\n\/\/ 1000*m_refECDSet[i].rd[0],1000*m_refECDSet[i].rd[1],1000*m_refECDSet[i].rd[2],\n\/\/ 1e9*m_refECDSet[i].Q.norm(),1e9*m_refECDSet[i].Q[0],1e9*m_refECDSet[i].Q[1],1e9*m_refECDSet[i].Q[2],100.0*m_refECDSet[i].good);\n\n\/\/ QVERIFY( m_ECDSet[i].valid == m_refECDSet[i].valid );\n\/\/ QVERIFY( m_ECDSet[i].time - m_refECDSet[i].time < epsilon );\n\/\/ QVERIFY( m_ECDSet[i].rd == m_refECDSet[i].rd );\n\/\/ QVERIFY( m_ECDSet[i].Q == m_refECDSet[i].Q );\n\/\/ QVERIFY( m_ECDSet[i].good - m_refECDSet[i].good < epsilon );\n\/\/ QVERIFY( m_ECDSet[i].khi2 - m_refECDSet[i].khi2 < epsilon );\n\/\/ QVERIFY( m_ECDSet[i].nfree == m_refECDSet[i].nfree );\n\/\/ QVERIFY( m_ECDSet[i].neval == m_refECDSet[i].neval );\n\/\/ }\n\n printf(\"<<<<<<<<<<<<<<<<<<<<<<<<< Compare Forward Solution Finished <<<<<<<<<<<<<<<<<<<<<<<<<\\n\");\n}\n\n\n\/\/*************************************************************************************************************\n\nvoid TestForwardSolution::cleanupTestCase()\n{\n}\n\n\n\/\/*************************************************************************************************************\n\/\/=============================================================================================================\n\/\/ MAIN\n\/\/=============================================================================================================\n\nQTEST_APPLESS_MAIN(TestForwardSolution)\n#include \"test_forward_solution.moc\"\n<|endoftext|>"} {"text":"<commit_before>5a46e16a-2e4e-11e5-9284-b827eb9e62be<commit_msg>5a4c8d04-2e4e-11e5-9284-b827eb9e62be<commit_after>5a4c8d04-2e4e-11e5-9284-b827eb9e62be<|endoftext|>"} {"text":"<commit_before>5d2e4f72-2e4d-11e5-9284-b827eb9e62be<commit_msg>5d33581e-2e4d-11e5-9284-b827eb9e62be<commit_after>5d33581e-2e4d-11e5-9284-b827eb9e62be<|endoftext|>"} {"text":"<commit_before>f4bb2d38-2e4d-11e5-9284-b827eb9e62be<commit_msg>f4c042a0-2e4d-11e5-9284-b827eb9e62be<commit_after>f4c042a0-2e4d-11e5-9284-b827eb9e62be<|endoftext|>"} {"text":"<commit_before>3d664da2-2e4d-11e5-9284-b827eb9e62be<commit_msg>3d6b552c-2e4d-11e5-9284-b827eb9e62be<commit_after>3d6b552c-2e4d-11e5-9284-b827eb9e62be<|endoftext|>"} {"text":"<commit_before>915cd498-2e4e-11e5-9284-b827eb9e62be<commit_msg>9161ceda-2e4e-11e5-9284-b827eb9e62be<commit_after>9161ceda-2e4e-11e5-9284-b827eb9e62be<|endoftext|>"} {"text":"<commit_before>2180aa0a-2e4e-11e5-9284-b827eb9e62be<commit_msg>2185c1de-2e4e-11e5-9284-b827eb9e62be<commit_after>2185c1de-2e4e-11e5-9284-b827eb9e62be<|endoftext|>"} {"text":"<commit_before>36559db4-2e4e-11e5-9284-b827eb9e62be<commit_msg>365a99f4-2e4e-11e5-9284-b827eb9e62be<commit_after>365a99f4-2e4e-11e5-9284-b827eb9e62be<|endoftext|>"} {"text":"<commit_before>64b0acb2-2e4e-11e5-9284-b827eb9e62be<commit_msg>64b5baf4-2e4e-11e5-9284-b827eb9e62be<commit_after>64b5baf4-2e4e-11e5-9284-b827eb9e62be<|endoftext|>"} {"text":"<commit_before>737371fe-2e4d-11e5-9284-b827eb9e62be<commit_msg>7378efbc-2e4d-11e5-9284-b827eb9e62be<commit_after>7378efbc-2e4d-11e5-9284-b827eb9e62be<|endoftext|>"} {"text":"<commit_before>70c5d8d8-2e4e-11e5-9284-b827eb9e62be<commit_msg>70cacf6e-2e4e-11e5-9284-b827eb9e62be<commit_after>70cacf6e-2e4e-11e5-9284-b827eb9e62be<|endoftext|>"} {"text":"<commit_before>d10c7956-2e4c-11e5-9284-b827eb9e62be<commit_msg>d111ae8a-2e4c-11e5-9284-b827eb9e62be<commit_after>d111ae8a-2e4c-11e5-9284-b827eb9e62be<|endoftext|>"} {"text":"<commit_before>c9f45e30-2e4d-11e5-9284-b827eb9e62be<commit_msg>c9f95e1c-2e4d-11e5-9284-b827eb9e62be<commit_after>c9f95e1c-2e4d-11e5-9284-b827eb9e62be<|endoftext|>"} {"text":"<commit_before>223c3e78-2e4e-11e5-9284-b827eb9e62be<commit_msg>22413fd6-2e4e-11e5-9284-b827eb9e62be<commit_after>22413fd6-2e4e-11e5-9284-b827eb9e62be<|endoftext|>"} {"text":"<commit_before>aeb21ece-2e4c-11e5-9284-b827eb9e62be<commit_msg>aeb70fc4-2e4c-11e5-9284-b827eb9e62be<commit_after>aeb70fc4-2e4c-11e5-9284-b827eb9e62be<|endoftext|>"} {"text":"<commit_before>a2c08c30-2e4d-11e5-9284-b827eb9e62be<commit_msg>a2c58758-2e4d-11e5-9284-b827eb9e62be<commit_after>a2c58758-2e4d-11e5-9284-b827eb9e62be<|endoftext|>"} {"text":"<commit_before>d3f72dd2-2e4c-11e5-9284-b827eb9e62be<commit_msg>d3fc56ae-2e4c-11e5-9284-b827eb9e62be<commit_after>d3fc56ae-2e4c-11e5-9284-b827eb9e62be<|endoftext|>"} {"text":"<commit_before>7ce50648-2e4e-11e5-9284-b827eb9e62be<commit_msg>7cea2556-2e4e-11e5-9284-b827eb9e62be<commit_after>7cea2556-2e4e-11e5-9284-b827eb9e62be<|endoftext|>"} {"text":"<commit_before>0d4f1ea8-2e4f-11e5-9284-b827eb9e62be<commit_msg>0d54135e-2e4f-11e5-9284-b827eb9e62be<commit_after>0d54135e-2e4f-11e5-9284-b827eb9e62be<|endoftext|>"} {"text":"<commit_before>#include \"aerial_autonomy\/controllers\/rpyt_based_position_controller.h\"\n#include <aerial_autonomy\/tests\/test_utils.h>\n\n#include <gtest\/gtest.h>\n#include <tf\/transform_datatypes.h>\n\nclass RPYTBasedPositionControllerTests : public ::testing::Test {\npublic:\n RPYTBasedPositionControllerTests()\n : config_(RPYTBasedPositionControllerConfig()) {\n \/\/ Set tolerances\n auto velocity_tolerance =\n config_.mutable_rpyt_based_velocity_controller_config()\n ->mutable_velocity_controller_config()\n ->mutable_goal_velocity_tolerance();\n velocity_tolerance->set_vx(0.01);\n velocity_tolerance->set_vy(0.01);\n velocity_tolerance->set_vz(0.01);\n auto position_tolerance =\n config_.mutable_velocity_based_position_controller_config()\n ->mutable_position_controller_config()\n ->mutable_goal_position_tolerance();\n position_tolerance->set_x(0.05);\n position_tolerance->set_y(0.05);\n position_tolerance->set_z(0.05);\n }\n\n void runUntilConvergence(PositionYaw goal) {\n std::chrono::duration<double> dt = std::chrono::milliseconds(20);\n\n RPYTBasedPositionController controller(config_, dt);\n auto sensor_data =\n std::make_tuple(VelocityYawRate(0, 0, 0, 0), PositionYaw(0, 0, 0, 0));\n auto &velocity_yaw_rate = std::get<0>(sensor_data);\n auto &position_yaw = std::get<1>(sensor_data);\n auto convergence = [&]() {\n RollPitchYawRateThrust controls;\n\n controller.run(sensor_data, controls);\n tf::Transform tf;\n tf.setOrigin(tf::Vector3(0, 0, 0));\n tf.setRotation(\n tf::createQuaternionFromRPY(controls.r, controls.p, controls.y));\n\n double ext_z_acc = 0.1;\n tf::Vector3 body_acc(\n 0, 0,\n controls.t * config_.rpyt_based_velocity_controller_config().kt() +\n ext_z_acc);\n tf::Vector3 global_acc = tf * body_acc;\n\n velocity_yaw_rate.x = velocity_yaw_rate.x + global_acc[0] * dt.count();\n velocity_yaw_rate.y = velocity_yaw_rate.y + global_acc[1] * dt.count();\n velocity_yaw_rate.z =\n velocity_yaw_rate.z + (global_acc[2] - 9.81) * dt.count();\n velocity_yaw_rate.yaw_rate = controls.y;\n position_yaw.x = velocity_yaw_rate.x * dt.count();\n position_yaw.y = velocity_yaw_rate.y * dt.count();\n position_yaw.z = velocity_yaw_rate.z * dt.count();\n position_yaw.yaw = position_yaw.yaw + controls.y * dt.count();\n\n return bool(controller.isConverged(sensor_data));\n\n };\n\n ASSERT_TRUE(test_utils::waitUntilTrue()(\n convergence, std::chrono::seconds(1), std::chrono::milliseconds(0)));\n }\n\n RPYTBasedPositionControllerConfig config_;\n};\n\nTEST_F(RPYTBasedPositionControllerTests, SetGetGoal) {\n RPYTBasedPositionController controller(config_,\n std::chrono::milliseconds(20));\n\n PositionYaw goal(1, -2, 3, 0.1);\n controller.setGoal(goal);\n PositionYaw expected_goal = controller.getGoal();\n ASSERT_EQ(goal, expected_goal);\n}\n\nTEST_F(RPYTBasedPositionControllerTests, Converged) {\n RPYTBasedPositionController controller(config_,\n std::chrono::milliseconds(20));\n\n PositionYaw goal(0, 0, 0, 0);\n controller.setGoal(goal);\n\n ASSERT_TRUE(controller.isConverged(\n std::make_tuple(VelocityYawRate(0, 0, 0, 0), PositionYaw(0, 0, 0, 0))));\n}\n\nTEST_F(RPYTBasedPositionControllerTests, NotConverged) {\n RPYTBasedPositionController controller(config_,\n std::chrono::milliseconds(20));\n\n PositionYaw goal(0, 0, 0, 0);\n controller.setGoal(goal);\n\n \/\/ Not converged for non-zero position\n ASSERT_FALSE(controller.isConverged(\n std::make_tuple(VelocityYawRate(0, 0, 0, 0), PositionYaw(1, 0, 0, 0))));\n \/\/ Not converged for non-zero velocity\n ASSERT_FALSE(controller.isConverged(\n std::make_tuple(VelocityYawRate(1, 0, 0, 0), PositionYaw(0, 0, 0, 0))));\n}\n\nTEST_F(RPYTBasedPositionControllerTests, RunUntilConvergenceAlreadyConverged) {\n runUntilConvergence(PositionYaw(0, 0, 0, 0));\n}\n\nTEST_F(RPYTBasedPositionControllerTests, RunUntilConvergenceNoYaw) {\n runUntilConvergence(PositionYaw(2.0, 3.0, -1.0, 0));\n}\n\nTEST_F(RPYTBasedPositionControllerTests, RunUntilConvergenceYaw) {\n runUntilConvergence(PositionYaw(-1.0, -1.0, 1.0, M_PI \/ 2.));\n}\n\nint main(int argc, char **argv) {\n testing::InitGoogleTest(&argc, argv);\n return RUN_ALL_TESTS();\n}\n<commit_msg>Add neg yaw test<commit_after>#include \"aerial_autonomy\/controllers\/rpyt_based_position_controller.h\"\n#include <aerial_autonomy\/tests\/test_utils.h>\n\n#include <gtest\/gtest.h>\n#include <tf\/transform_datatypes.h>\n\nclass RPYTBasedPositionControllerTests : public ::testing::Test {\npublic:\n RPYTBasedPositionControllerTests()\n : config_(RPYTBasedPositionControllerConfig()) {\n \/\/ Set tolerances\n auto velocity_tolerance =\n config_.mutable_rpyt_based_velocity_controller_config()\n ->mutable_velocity_controller_config()\n ->mutable_goal_velocity_tolerance();\n velocity_tolerance->set_vx(0.01);\n velocity_tolerance->set_vy(0.01);\n velocity_tolerance->set_vz(0.01);\n auto position_tolerance =\n config_.mutable_velocity_based_position_controller_config()\n ->mutable_position_controller_config()\n ->mutable_goal_position_tolerance();\n position_tolerance->set_x(0.05);\n position_tolerance->set_y(0.05);\n position_tolerance->set_z(0.05);\n }\n\n void runUntilConvergence(PositionYaw goal) {\n std::chrono::duration<double> dt = std::chrono::milliseconds(20);\n\n RPYTBasedPositionController controller(config_, dt);\n auto sensor_data =\n std::make_tuple(VelocityYawRate(0, 0, 0, 0), PositionYaw(0, 0, 0, 0));\n auto &velocity_yaw_rate = std::get<0>(sensor_data);\n auto &position_yaw = std::get<1>(sensor_data);\n auto convergence = [&]() {\n RollPitchYawRateThrust controls;\n\n controller.run(sensor_data, controls);\n tf::Transform tf;\n tf.setOrigin(tf::Vector3(0, 0, 0));\n tf.setRotation(\n tf::createQuaternionFromRPY(controls.r, controls.p, controls.y));\n\n double ext_z_acc = 0.1;\n tf::Vector3 body_acc(\n 0, 0,\n controls.t * config_.rpyt_based_velocity_controller_config().kt() +\n ext_z_acc);\n tf::Vector3 global_acc = tf * body_acc;\n\n velocity_yaw_rate.x = velocity_yaw_rate.x + global_acc[0] * dt.count();\n velocity_yaw_rate.y = velocity_yaw_rate.y + global_acc[1] * dt.count();\n velocity_yaw_rate.z =\n velocity_yaw_rate.z + (global_acc[2] - 9.81) * dt.count();\n velocity_yaw_rate.yaw_rate = controls.y;\n position_yaw.x = velocity_yaw_rate.x * dt.count();\n position_yaw.y = velocity_yaw_rate.y * dt.count();\n position_yaw.z = velocity_yaw_rate.z * dt.count();\n position_yaw.yaw = position_yaw.yaw + controls.y * dt.count();\n\n return bool(controller.isConverged(sensor_data));\n\n };\n\n ASSERT_TRUE(test_utils::waitUntilTrue()(\n convergence, std::chrono::seconds(1), std::chrono::milliseconds(0)));\n }\n\n RPYTBasedPositionControllerConfig config_;\n};\n\nTEST_F(RPYTBasedPositionControllerTests, SetGetGoal) {\n RPYTBasedPositionController controller(config_,\n std::chrono::milliseconds(20));\n\n PositionYaw goal(1, -2, 3, 0.1);\n controller.setGoal(goal);\n PositionYaw expected_goal = controller.getGoal();\n ASSERT_EQ(goal, expected_goal);\n}\n\nTEST_F(RPYTBasedPositionControllerTests, Converged) {\n RPYTBasedPositionController controller(config_,\n std::chrono::milliseconds(20));\n\n PositionYaw goal(0, 0, 0, 0);\n controller.setGoal(goal);\n\n ASSERT_TRUE(controller.isConverged(\n std::make_tuple(VelocityYawRate(0, 0, 0, 0), PositionYaw(0, 0, 0, 0))));\n}\n\nTEST_F(RPYTBasedPositionControllerTests, NotConverged) {\n RPYTBasedPositionController controller(config_,\n std::chrono::milliseconds(20));\n\n PositionYaw goal(0, 0, 0, 0);\n controller.setGoal(goal);\n\n \/\/ Not converged for non-zero position\n ASSERT_FALSE(controller.isConverged(\n std::make_tuple(VelocityYawRate(0, 0, 0, 0), PositionYaw(1, 0, 0, 0))));\n \/\/ Not converged for non-zero velocity\n ASSERT_FALSE(controller.isConverged(\n std::make_tuple(VelocityYawRate(1, 0, 0, 0), PositionYaw(0, 0, 0, 0))));\n}\n\nTEST_F(RPYTBasedPositionControllerTests, RunUntilConvergenceAlreadyConverged) {\n runUntilConvergence(PositionYaw(0, 0, 0, 0));\n}\n\nTEST_F(RPYTBasedPositionControllerTests, RunUntilConvergenceNoYaw) {\n runUntilConvergence(PositionYaw(2.0, 3.0, -1.0, 0));\n}\n\nTEST_F(RPYTBasedPositionControllerTests, RunUntilConvergenceYaw) {\n runUntilConvergence(PositionYaw(-1.0, -1.0, 1.0, M_PI \/ 2.));\n}\n\nTEST_F(RPYTBasedPositionControllerTests, RunUntilConvergenceNegYaw) {\n runUntilConvergence(PositionYaw(-1.0, -1.0, 1.0, -M_PI \/ 2.));\n}\n\nint main(int argc, char **argv) {\n testing::InitGoogleTest(&argc, argv);\n return RUN_ALL_TESTS();\n}\n<|endoftext|>"} {"text":"<commit_before>\n#include \"expirypropertiesdialog.h\"\n#include \"folderrequester.h\"\n#include \"kmfoldertree.h\"\n#include \"kmglobal.h\"\n\n#include <qvariant.h>\n#include <qpushbutton.h>\n#include <qgroupbox.h>\n#include <qcheckbox.h>\n#include <qspinbox.h>\n#include <qlabel.h>\n#include <qradiobutton.h>\n#include <qbuttongroup.h>\n#include <qcombobox.h>\n#include <qlayout.h>\n#include <qtooltip.h>\n#include <qwhatsthis.h>\n\n#include <klocale.h>\n#include <kmessagebox.h>\n\nusing namespace KMail;\n\n\/*\n * Constructs a ExpiryPropertiesDialog as a child of 'parent', with the\n * name 'name'.\n *\n *\/\nExpiryPropertiesDialog::ExpiryPropertiesDialog( KMFolderTree* tree, KMFolder* folder )\n : KDialogBase( tree, \"expiry_properties\", false, i18n( \"Mail Expiry Properties\" ), \n KDialogBase::Ok|KDialogBase::Cancel, \n KDialogBase::Ok, true ),\n mFolder( folder )\n{\n setWFlags( getWFlags() | WDestructiveClose );\n QWidget* privateLayoutWidget = new QWidget( this, \"globalVBox\" );\n setMainWidget( privateLayoutWidget );\n privateLayoutWidget->setGeometry( QRect( 10, 20, 270, 138 ) );\n globalVBox = new QVBoxLayout( privateLayoutWidget, 11, 6, \"globalVBox\"); \n globalVBox->setSpacing( 20 );\n\n readHBox = new QHBoxLayout( 0, 0, 6, \"readHBox\"); \n\n expireReadMailCB = new QCheckBox( privateLayoutWidget, \"expireReadMailCB\" );\n expireReadMailCB->setText( i18n( \"Expire read mails after\" ) );\n connect( expireReadMailCB, SIGNAL( toggled( bool )),\n this, SLOT( slotUpdateControls() ) );\n readHBox->addWidget( expireReadMailCB );\n\n expireReadMailSB = new QSpinBox( privateLayoutWidget, \"expireReadMailSB\" );\n expireReadMailSB->setMaxValue( 999999 );\n expireReadMailSB->setValue( 30 );\n readHBox->addWidget( expireReadMailSB );\n\n labelDays = new QLabel( privateLayoutWidget, \"labelDays\" );\n labelDays->setText( i18n( \"days\" ) );\n readHBox->addWidget( labelDays );\n globalVBox->addLayout( readHBox );\n\n unreadHBox = new QHBoxLayout( 0, 0, 6, \"unreadHBox\"); \n\n expireUnreadMailCB = new QCheckBox( privateLayoutWidget, \"expireUnreadMailCB\" );\n expireUnreadMailCB->setText( i18n( \"Expire unread mails after\" ) );\n connect( expireUnreadMailCB, SIGNAL( toggled( bool )),\n this, SLOT( slotUpdateControls() ) );\n unreadHBox->addWidget( expireUnreadMailCB );\n\n expireUnreadMailSB = new QSpinBox( privateLayoutWidget, \"expireUnreadMailSB\" );\n expireUnreadMailSB->setMaxValue( 99999 );\n expireUnreadMailSB->setValue( 30 );\n unreadHBox->addWidget( expireUnreadMailSB );\n\n labelDays2 = new QLabel( privateLayoutWidget, \"labelDays2\" );\n labelDays2->setText( i18n( \"days\" ) );\n labelDays2->setAlignment( int( QLabel::AlignTop ) );\n unreadHBox->addWidget( labelDays2 );\n globalVBox->addLayout( unreadHBox );\n\n expiryActionHBox = new QHBoxLayout( 0, 0, 6, \"expiryActionHBox\"); \n\n expiryActionLabel = new QLabel( privateLayoutWidget, \"expiryActionLabel\" );\n expiryActionLabel->setText( i18n( \"Expiry action:\" ) );\n expiryActionLabel->setAlignment( int( QLabel::AlignVCenter ) );\n expiryActionHBox->addWidget( expiryActionLabel );\n\n actionsHBox = new QVBoxLayout( 0, 0, 6, \"actionsHBox\"); \n actionsGroup = new QButtonGroup( this );\n actionsGroup->hide(); \/\/ for mutual exclusion of the radio buttons\n\n moveToHBox = new QHBoxLayout( 0, 0, 6, \"moveToHBox\"); \n\n moveToRB = new QRadioButton( privateLayoutWidget, \"moveToRB\" );\n actionsGroup->insert( moveToRB );\n connect( moveToRB, SIGNAL( toggled( bool ) ),\n this, SLOT( slotUpdateControls() ) );\n moveToRB->setText( i18n( \"Move to:\" ) );\n moveToHBox->addWidget( moveToRB );\n\n folderSelector = new KMail::FolderRequester( privateLayoutWidget, tree );\n folderSelector->setMustBeReadWrite( true );\n moveToHBox->addWidget( folderSelector );\n actionsHBox->addLayout( moveToHBox );\n\n deletePermanentlyRB = new QRadioButton( privateLayoutWidget, \"deletePermanentlyRB\" );\n actionsGroup->insert( deletePermanentlyRB );\n deletePermanentlyRB->setText( i18n( \"Delete permanently\" ) );\n actionsHBox->addWidget( deletePermanentlyRB );\n expiryActionHBox->addLayout( actionsHBox );\n globalVBox->addLayout( expiryActionHBox );\n\n note = new QLabel( privateLayoutWidget, \"note\" );\n note->setText( i18n( \"Note: Expiry action will be applied immediately after confirming settings.\" ) );\n note->setAlignment( int( QLabel::WordBreak | QLabel::AlignVCenter ) );\n globalVBox->addWidget( note );\n\n \/\/ Load the values from the folder\n bool expiryGloballyOn = mFolder->isAutoExpire();\n int daysToExpireRead, daysToExpireUnread;\n mFolder->daysToExpire( daysToExpireRead, daysToExpireUnread );\n\n if ( expiryGloballyOn && daysToExpireRead > 0 ) {\n expireReadMailCB->setChecked( true );\n expireReadMailSB->setValue( daysToExpireRead );\n }\n if ( expiryGloballyOn && daysToExpireUnread > 0 ) {\n expireUnreadMailCB->setChecked( true );\n expireUnreadMailSB->setValue( daysToExpireUnread );\n }\n\n if ( mFolder->expireAction() == KMFolder::ExpireDelete )\n deletePermanentlyRB->setChecked( true );\n else\n moveToRB->setChecked( true );\n\n QString destFolderID = mFolder->expireToFolderId();\n if ( !destFolderID.isEmpty() ) {\n KMFolder* destFolder = kmkernel->findFolderById( destFolderID );\n if ( destFolder )\n folderSelector->setFolder( destFolder );\n }\n slotUpdateControls();\n resize( QSize(295, 204).expandedTo(minimumSizeHint()) );\n clearWState( WState_Polished );\n}\n\n\/*\n * Destroys the object and frees any allocated resources\n *\/\nExpiryPropertiesDialog::~ExpiryPropertiesDialog()\n{\n \/\/ no need to delete child widgets, Qt does it all for us\n}\n\nvoid ExpiryPropertiesDialog::slotOk()\n{\n bool enableGlobally = expireReadMailCB->isChecked() || expireUnreadMailCB->isChecked();\n if ( enableGlobally && moveToRB->isChecked() && !folderSelector->folder() ) {\n KMessageBox::error( this, i18n(\"Please select a folder to expire messages into.\"),\n i18n( \"No Folder Selected\" ) );\n return;\n } \n mFolder->setAutoExpire( enableGlobally );\n \/\/ we always write out days now\n mFolder->setReadExpireAge( expireReadMailSB->value() );\n mFolder->setUnreadExpireAge( expireUnreadMailSB->value() );\n mFolder->setReadExpireUnits( expireDays );\n mFolder->setUnreadExpireUnits( expireDays );\n\n if ( deletePermanentlyRB->isChecked() )\n mFolder->setExpireAction( KMFolder::ExpireDelete );\n else\n mFolder->setExpireAction( KMFolder::ExpireMove );\n KMFolder* expireToFolder = folderSelector->folder();\n if ( expireToFolder )\n mFolder->setExpireToFolderId( expireToFolder->idString() );\n\n \/\/ trigger immediate expiry if there is something to do\n if ( enableGlobally )\n mFolder->expireOldMessages( true \/*immediate*\/);\n KDialogBase::slotOk();\n}\n\nvoid ExpiryPropertiesDialog::slotUpdateControls()\n{\n bool showExpiryActions = expireReadMailCB->isChecked() || expireUnreadMailCB->isChecked();\n moveToRB->setEnabled( showExpiryActions );\n folderSelector->setEnabled( showExpiryActions && moveToRB->isChecked() );\n deletePermanentlyRB->setEnabled( showExpiryActions );\n}\n\n\n#include \"expirypropertiesdialog.moc\"\n<commit_msg>Make sure the unread and read expiry settings are toggled individually.<commit_after>\n#include \"expirypropertiesdialog.h\"\n#include \"folderrequester.h\"\n#include \"kmfoldertree.h\"\n#include \"kmglobal.h\"\n\n#include <qvariant.h>\n#include <qpushbutton.h>\n#include <qgroupbox.h>\n#include <qcheckbox.h>\n#include <qspinbox.h>\n#include <qlabel.h>\n#include <qradiobutton.h>\n#include <qbuttongroup.h>\n#include <qcombobox.h>\n#include <qlayout.h>\n#include <qtooltip.h>\n#include <qwhatsthis.h>\n\n#include <klocale.h>\n#include <kmessagebox.h>\n\nusing namespace KMail;\n\n\/*\n * Constructs a ExpiryPropertiesDialog as a child of 'parent', with the\n * name 'name'.\n *\n *\/\nExpiryPropertiesDialog::ExpiryPropertiesDialog( KMFolderTree* tree, KMFolder* folder )\n : KDialogBase( tree, \"expiry_properties\", false, i18n( \"Mail Expiry Properties\" ), \n KDialogBase::Ok|KDialogBase::Cancel, \n KDialogBase::Ok, true ),\n mFolder( folder )\n{\n setWFlags( getWFlags() | WDestructiveClose );\n QWidget* privateLayoutWidget = new QWidget( this, \"globalVBox\" );\n setMainWidget( privateLayoutWidget );\n privateLayoutWidget->setGeometry( QRect( 10, 20, 270, 138 ) );\n globalVBox = new QVBoxLayout( privateLayoutWidget, 11, 6, \"globalVBox\"); \n globalVBox->setSpacing( 20 );\n\n readHBox = new QHBoxLayout( 0, 0, 6, \"readHBox\"); \n\n expireReadMailCB = new QCheckBox( privateLayoutWidget, \"expireReadMailCB\" );\n expireReadMailCB->setText( i18n( \"Expire read mails after\" ) );\n connect( expireReadMailCB, SIGNAL( toggled( bool )),\n this, SLOT( slotUpdateControls() ) );\n readHBox->addWidget( expireReadMailCB );\n\n expireReadMailSB = new QSpinBox( privateLayoutWidget, \"expireReadMailSB\" );\n expireReadMailSB->setMaxValue( 999999 );\n expireReadMailSB->setValue( 30 );\n readHBox->addWidget( expireReadMailSB );\n\n labelDays = new QLabel( privateLayoutWidget, \"labelDays\" );\n labelDays->setText( i18n( \"days\" ) );\n readHBox->addWidget( labelDays );\n globalVBox->addLayout( readHBox );\n\n unreadHBox = new QHBoxLayout( 0, 0, 6, \"unreadHBox\"); \n\n expireUnreadMailCB = new QCheckBox( privateLayoutWidget, \"expireUnreadMailCB\" );\n expireUnreadMailCB->setText( i18n( \"Expire unread mails after\" ) );\n connect( expireUnreadMailCB, SIGNAL( toggled( bool )),\n this, SLOT( slotUpdateControls() ) );\n unreadHBox->addWidget( expireUnreadMailCB );\n\n expireUnreadMailSB = new QSpinBox( privateLayoutWidget, \"expireUnreadMailSB\" );\n expireUnreadMailSB->setMaxValue( 99999 );\n expireUnreadMailSB->setValue( 30 );\n unreadHBox->addWidget( expireUnreadMailSB );\n\n labelDays2 = new QLabel( privateLayoutWidget, \"labelDays2\" );\n labelDays2->setText( i18n( \"days\" ) );\n labelDays2->setAlignment( int( QLabel::AlignTop ) );\n unreadHBox->addWidget( labelDays2 );\n globalVBox->addLayout( unreadHBox );\n\n expiryActionHBox = new QHBoxLayout( 0, 0, 6, \"expiryActionHBox\"); \n\n expiryActionLabel = new QLabel( privateLayoutWidget, \"expiryActionLabel\" );\n expiryActionLabel->setText( i18n( \"Expiry action:\" ) );\n expiryActionLabel->setAlignment( int( QLabel::AlignVCenter ) );\n expiryActionHBox->addWidget( expiryActionLabel );\n\n actionsHBox = new QVBoxLayout( 0, 0, 6, \"actionsHBox\"); \n actionsGroup = new QButtonGroup( this );\n actionsGroup->hide(); \/\/ for mutual exclusion of the radio buttons\n\n moveToHBox = new QHBoxLayout( 0, 0, 6, \"moveToHBox\"); \n\n moveToRB = new QRadioButton( privateLayoutWidget, \"moveToRB\" );\n actionsGroup->insert( moveToRB );\n connect( moveToRB, SIGNAL( toggled( bool ) ),\n this, SLOT( slotUpdateControls() ) );\n moveToRB->setText( i18n( \"Move to:\" ) );\n moveToHBox->addWidget( moveToRB );\n\n folderSelector = new KMail::FolderRequester( privateLayoutWidget, tree );\n folderSelector->setMustBeReadWrite( true );\n moveToHBox->addWidget( folderSelector );\n actionsHBox->addLayout( moveToHBox );\n\n deletePermanentlyRB = new QRadioButton( privateLayoutWidget, \"deletePermanentlyRB\" );\n actionsGroup->insert( deletePermanentlyRB );\n deletePermanentlyRB->setText( i18n( \"Delete permanently\" ) );\n actionsHBox->addWidget( deletePermanentlyRB );\n expiryActionHBox->addLayout( actionsHBox );\n globalVBox->addLayout( expiryActionHBox );\n\n note = new QLabel( privateLayoutWidget, \"note\" );\n note->setText( i18n( \"Note: Expiry action will be applied immediately after confirming settings.\" ) );\n note->setAlignment( int( QLabel::WordBreak | QLabel::AlignVCenter ) );\n globalVBox->addWidget( note );\n\n \/\/ Load the values from the folder\n bool expiryGloballyOn = mFolder->isAutoExpire();\n int daysToExpireRead, daysToExpireUnread;\n mFolder->daysToExpire( daysToExpireRead, daysToExpireUnread );\n\n if ( expiryGloballyOn \n && mFolder->getReadExpireUnits() != expireNever \n && daysToExpireRead >= 0 ) {\n expireReadMailCB->setChecked( true );\n expireReadMailSB->setValue( daysToExpireRead );\n }\n if ( expiryGloballyOn\n && mFolder->getUnreadExpireUnits() != expireNever \n && daysToExpireUnread >= 0 ) {\n expireUnreadMailCB->setChecked( true );\n expireUnreadMailSB->setValue( daysToExpireUnread );\n }\n\n if ( mFolder->expireAction() == KMFolder::ExpireDelete )\n deletePermanentlyRB->setChecked( true );\n else\n moveToRB->setChecked( true );\n\n QString destFolderID = mFolder->expireToFolderId();\n if ( !destFolderID.isEmpty() ) {\n KMFolder* destFolder = kmkernel->findFolderById( destFolderID );\n if ( destFolder )\n folderSelector->setFolder( destFolder );\n }\n slotUpdateControls();\n resize( QSize(295, 204).expandedTo(minimumSizeHint()) );\n clearWState( WState_Polished );\n}\n\n\/*\n * Destroys the object and frees any allocated resources\n *\/\nExpiryPropertiesDialog::~ExpiryPropertiesDialog()\n{\n \/\/ no need to delete child widgets, Qt does it all for us\n}\n\nvoid ExpiryPropertiesDialog::slotOk()\n{\n bool enableGlobally = expireReadMailCB->isChecked() || expireUnreadMailCB->isChecked();\n if ( enableGlobally && moveToRB->isChecked() && !folderSelector->folder() ) {\n KMessageBox::error( this, i18n(\"Please select a folder to expire messages into.\"),\n i18n( \"No Folder Selected\" ) );\n return;\n } \n mFolder->setAutoExpire( enableGlobally );\n \/\/ we always write out days now\n mFolder->setReadExpireAge( expireReadMailSB->value() );\n mFolder->setUnreadExpireAge( expireUnreadMailSB->value() );\n mFolder->setReadExpireUnits( expireReadMailCB->isChecked()? expireDays : expireNever );\n mFolder->setUnreadExpireUnits( expireUnreadMailCB->isChecked()? expireDays : expireNever );\n\n if ( deletePermanentlyRB->isChecked() )\n mFolder->setExpireAction( KMFolder::ExpireDelete );\n else\n mFolder->setExpireAction( KMFolder::ExpireMove );\n KMFolder* expireToFolder = folderSelector->folder();\n if ( expireToFolder )\n mFolder->setExpireToFolderId( expireToFolder->idString() );\n\n \/\/ trigger immediate expiry if there is something to do\n if ( enableGlobally )\n mFolder->expireOldMessages( true \/*immediate*\/);\n KDialogBase::slotOk();\n}\n\nvoid ExpiryPropertiesDialog::slotUpdateControls()\n{\n bool showExpiryActions = expireReadMailCB->isChecked() || expireUnreadMailCB->isChecked();\n moveToRB->setEnabled( showExpiryActions );\n folderSelector->setEnabled( showExpiryActions && moveToRB->isChecked() );\n deletePermanentlyRB->setEnabled( showExpiryActions );\n}\n\n\n#include \"expirypropertiesdialog.moc\"\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\/process_util.h\"\n\n#include <ctype.h>\n#include <dirent.h>\n#include <dlfcn.h>\n#include <errno.h>\n#include <fcntl.h>\n#include <sys\/time.h>\n#include <sys\/types.h>\n#include <sys\/wait.h>\n#include <sys\/param.h>\n#include <sys\/sysctl.h>\n#include <sys\/user.h>\n#include <time.h>\n#include <unistd.h>\n\n#include \"base\/file_util.h\"\n#include \"base\/logging.h\"\n#include \"base\/string_number_conversions.h\"\n#include \"base\/string_split.h\"\n#include \"base\/string_tokenizer.h\"\n#include \"base\/string_util.h\"\n#include \"base\/sys_info.h\"\n#include \"base\/threading\/thread_restrictions.h\"\n\nnamespace base {\n\nProcessId GetParentProcessId(ProcessHandle process) {\n struct kinfo_proc info;\n size_t length;\n int mib[] = { CTL_KERN, KERN_PROC, KERN_PROC_PID, process,\n sizeof(struct kinfo_proc), 0 };\n\n if (sysctl(mib, arraysize(mib), NULL, &length, NULL, 0) < 0)\n return -1;\n\n mib[5] = (length \/ sizeof(struct kinfo_proc));\n\n if (sysctl(mib, arraysize(mib), &info, &length, NULL, 0) < 0)\n return -1;\n\n return info.p_ppid;\n}\n\nFilePath GetProcessExecutablePath(ProcessHandle process) {\n struct kinfo_proc kp;\n size_t len;\n int mib[] = { CTL_KERN, KERN_PROC, KERN_PROC_PID, process,\n sizeof(struct kinfo_proc), 0 };\n\n if (sysctl(mib, arraysize(mib), NULL, &len, NULL, 0) == -1)\n return FilePath();\n mib[5] = (len \/ sizeof(struct kinfo_proc));\n if (sysctl(mib, arraysize(mib), &kp, &len, NULL, 0) < 0)\n return FilePath();\n if ((kp.p_flag & P_SYSTEM) != 0)\n return FilePath();\n if (strcmp(kp.p_comm, \"chrome\") == 0)\n return FilePath(kp.p_comm);\n\n return FilePath();\n}\n\nProcessIterator::ProcessIterator(const ProcessFilter* filter)\n : index_of_kinfo_proc_(),\n filter_(filter) {\n\n int mib[] = { CTL_KERN, KERN_PROC, KERN_PROC_UID, getuid(),\n sizeof(struct kinfo_proc), 0 };\n\n bool done = false;\n int try_num = 1;\n const int max_tries = 10;\n\n do {\n size_t len = 0;\n if (sysctl(mib, arraysize(mib), NULL, &len, NULL, 0) < 0) {\n DLOG(ERROR) << \"failed to get the size needed for the process list\";\n kinfo_procs_.resize(0);\n done = true;\n } else {\n size_t num_of_kinfo_proc = len \/ sizeof(struct kinfo_proc);\n \/\/ Leave some spare room for process table growth (more could show up\n \/\/ between when we check and now)\n num_of_kinfo_proc += 16;\n kinfo_procs_.resize(num_of_kinfo_proc);\n len = num_of_kinfo_proc * sizeof(struct kinfo_proc);\n if (sysctl(mib, arraysize(mib), &kinfo_procs_[0], &len, NULL, 0) < 0) {\n \/\/ If we get a mem error, it just means we need a bigger buffer, so\n \/\/ loop around again. Anything else is a real error and give up.\n if (errno != ENOMEM) {\n DLOG(ERROR) << \"failed to get the process list\";\n kinfo_procs_.resize(0);\n done = true;\n }\n } else {\n \/\/ Got the list, just make sure we're sized exactly right\n size_t num_of_kinfo_proc = len \/ sizeof(struct kinfo_proc);\n kinfo_procs_.resize(num_of_kinfo_proc);\n done = true;\n }\n }\n } while (!done && (try_num++ < max_tries));\n\n if (!done) {\n DDLOG(ERROR) << \"failed to collect the process list in a few tries\";\n kinfo_procs_.resize(0);\n }\n}\n\nProcessIterator::~ProcessIterator() {\n}\n\nbool ProcessIterator::CheckForNextProcess() {\n std::string data;\n for (; index_of_kinfo_proc_ < kinfo_procs_.size(); ++index_of_kinfo_proc_) {\n kinfo_proc& kinfo = kinfo_procs_[index_of_kinfo_proc_];\n\n \/\/ Skip processes just awaiting collection\n if ((kinfo.p_pid > 0) && (kinfo.p_stat == SZOMB))\n continue;\n\n int mib[] = { CTL_KERN, KERN_PROC_ARGS, kinfo.p_pid };\n\n \/\/ Find out what size buffer we need.\n size_t data_len = 0;\n if (sysctl(mib, arraysize(mib), NULL, &data_len, NULL, 0) < 0) {\n DVPLOG(1) << \"failed to figure out the buffer size for a commandline\";\n continue;\n }\n\n data.resize(data_len);\n if (sysctl(mib, arraysize(mib), &data[0], &data_len, NULL, 0) < 0) {\n DVPLOG(1) << \"failed to fetch a commandline\";\n continue;\n }\n\n \/\/ |data| contains all the command line parameters of the process, separated\n \/\/ by blocks of one or more null characters. We tokenize |data| into a\n \/\/ vector of strings using '\\0' as a delimiter and populate\n \/\/ |entry_.cmd_line_args_|.\n std::string delimiters;\n delimiters.push_back('\\0');\n Tokenize(data, delimiters, &entry_.cmd_line_args_);\n\n \/\/ |data| starts with the full executable path followed by a null character.\n \/\/ We search for the first instance of '\\0' and extract everything before it\n \/\/ to populate |entry_.exe_file_|.\n size_t exec_name_end = data.find('\\0');\n if (exec_name_end == std::string::npos) {\n DLOG(ERROR) << \"command line data didn't match expected format\";\n continue;\n }\n\n entry_.pid_ = kinfo.p_pid;\n entry_.ppid_ = kinfo.p_ppid;\n entry_.gid_ = kinfo.p__pgid;\n size_t last_slash = data.rfind('\/', exec_name_end);\n if (last_slash == std::string::npos)\n entry_.exe_file_.assign(data, 0, exec_name_end);\n else\n entry_.exe_file_.assign(data, last_slash + 1,\n exec_name_end - last_slash - 1);\n \/\/ Start w\/ the next entry next time through\n ++index_of_kinfo_proc_;\n \/\/ Done\n return true;\n }\n return false;\n}\n\nbool NamedProcessIterator::IncludeEntry() {\n return (executable_name_ == entry().exe_file() &&\n ProcessIterator::IncludeEntry());\n}\n\n\nProcessMetrics::ProcessMetrics(ProcessHandle process)\n : process_(process),\n last_time_(0),\n last_system_time_(0),\n last_cpu_(0) {\n\n processor_count_ = base::SysInfo::NumberOfProcessors();\n}\n\n\/\/ static\nProcessMetrics* ProcessMetrics::CreateProcessMetrics(ProcessHandle process) {\n return new ProcessMetrics(process);\n}\n\nsize_t ProcessMetrics::GetPagefileUsage() const {\n struct kinfo_proc info;\n size_t length;\n int mib[] = { CTL_KERN, KERN_PROC, KERN_PROC_PID, process_,\n sizeof(struct kinfo_proc), 0 };\n\n if (sysctl(mib, arraysize(mib), NULL, &length, NULL, 0) < 0)\n return -1;\n\n mib[5] = (length \/ sizeof(struct kinfo_proc));\n\n if (sysctl(mib, arraysize(mib), &info, &length, NULL, 0) < 0)\n return -1;\n\n return (info.p_vm_tsize + info.p_vm_dsize + info.p_vm_ssize);\n}\n\nsize_t ProcessMetrics::GetPeakPagefileUsage() const {\n\n return 0;\n}\n\nsize_t ProcessMetrics::GetWorkingSetSize() const {\n struct kinfo_proc info;\n size_t length;\n int mib[] = { CTL_KERN, KERN_PROC, KERN_PROC_PID, process_,\n sizeof(struct kinfo_proc), 0 };\n\n if (sysctl(mib, arraysize(mib), NULL, &length, NULL, 0) < 0)\n return -1;\n\n mib[5] = (length \/ sizeof(struct kinfo_proc));\n\n if (sysctl(mib, arraysize(mib), &info, &length, NULL, 0) < 0)\n return -1;\n\n return info.p_vm_rssize * getpagesize();\n}\n\nsize_t ProcessMetrics::GetPeakWorkingSetSize() const {\n\n return 0;\n}\n\nbool ProcessMetrics::GetMemoryBytes(size_t* private_bytes,\n size_t* shared_bytes) {\n WorkingSetKBytes ws_usage;\n\n if (!GetWorkingSetKBytes(&ws_usage))\n return false;\n\n if (private_bytes)\n *private_bytes = ws_usage.priv << 10;\n\n if (shared_bytes)\n *shared_bytes = ws_usage.shared * 1024;\n\n return true;\n}\n\nbool ProcessMetrics::GetWorkingSetKBytes(WorkingSetKBytes* ws_usage) const {\n\/\/ TODO(bapt) be sure we can't be precise\n size_t priv = GetWorkingSetSize();\n if (!priv)\n return false;\n ws_usage->priv = priv \/ 1024;\n ws_usage->shareable = 0;\n ws_usage->shared = 0;\n\n return true;\n}\n\nbool ProcessMetrics::GetIOCounters(IoCounters* io_counters) const {\n return false;\n}\n\nstatic int GetProcessCPU(pid_t pid) {\n struct kinfo_proc info;\n size_t length;\n int mib[] = { CTL_KERN, KERN_PROC, KERN_PROC_PID, pid,\n sizeof(struct kinfo_proc), 0 };\n\n if (sysctl(mib, arraysize(mib), NULL, &length, NULL, 0) < 0)\n return -1;\n\n mib[5] = (length \/ sizeof(struct kinfo_proc));\n\n if (sysctl(mib, arraysize(mib), &info, &length, NULL, 0) < 0)\n return 0;\n\n return info.p_pctcpu;\n}\n\ndouble ProcessMetrics::GetCPUUsage() {\n struct timeval now;\n\n int retval = gettimeofday(&now, NULL);\n if (retval)\n return 0;\n\n int64 time = TimeValToMicroseconds(now);\n\n if (last_time_ == 0) {\n \/\/ First call, just set the last values.\n last_time_ = time;\n last_cpu_ = GetProcessCPU(process_);\n return 0;\n }\n\n int64 time_delta = time - last_time_;\n DCHECK_NE(time_delta, 0);\n\n if (time_delta == 0)\n return 0;\n\n int cpu = GetProcessCPU(process_);\n\n last_time_ = time;\n last_cpu_ = cpu;\n\n double percentage = static_cast<double>((cpu * 100.0) \/ FSCALE);\n\n return percentage;\n}\n\nsize_t GetSystemCommitCharge() {\n int mib[] = { CTL_VM, VM_METER };\n int pagesize;\n struct vmtotal vmtotal;\n unsigned long mem_total, mem_free, mem_inactive;\n size_t len = sizeof(vmtotal);\n\n if (sysctl(mib, arraysize(mib), &vmtotal, &len, NULL, 0) < 0)\n return 0;\n\n mem_total = vmtotal.t_vm;\n mem_free = vmtotal.t_free;\n mem_inactive = vmtotal.t_vm - vmtotal.t_avm;\n\n pagesize = getpagesize();\n\n return mem_total - (mem_free*pagesize) - (mem_inactive*pagesize);\n}\n\nvoid EnableTerminationOnOutOfMemory() {\n}\n\nvoid EnableTerminationOnHeapCorruption() {\n}\n\n} \/\/ namespace base\n<commit_msg>fix typo introduced in CR# 8341026<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\/process_util.h\"\n\n#include <ctype.h>\n#include <dirent.h>\n#include <dlfcn.h>\n#include <errno.h>\n#include <fcntl.h>\n#include <sys\/time.h>\n#include <sys\/types.h>\n#include <sys\/wait.h>\n#include <sys\/param.h>\n#include <sys\/sysctl.h>\n#include <sys\/user.h>\n#include <time.h>\n#include <unistd.h>\n\n#include \"base\/file_util.h\"\n#include \"base\/logging.h\"\n#include \"base\/string_number_conversions.h\"\n#include \"base\/string_split.h\"\n#include \"base\/string_tokenizer.h\"\n#include \"base\/string_util.h\"\n#include \"base\/sys_info.h\"\n#include \"base\/threading\/thread_restrictions.h\"\n\nnamespace base {\n\nProcessId GetParentProcessId(ProcessHandle process) {\n struct kinfo_proc info;\n size_t length;\n int mib[] = { CTL_KERN, KERN_PROC, KERN_PROC_PID, process,\n sizeof(struct kinfo_proc), 0 };\n\n if (sysctl(mib, arraysize(mib), NULL, &length, NULL, 0) < 0)\n return -1;\n\n mib[5] = (length \/ sizeof(struct kinfo_proc));\n\n if (sysctl(mib, arraysize(mib), &info, &length, NULL, 0) < 0)\n return -1;\n\n return info.p_ppid;\n}\n\nFilePath GetProcessExecutablePath(ProcessHandle process) {\n struct kinfo_proc kp;\n size_t len;\n int mib[] = { CTL_KERN, KERN_PROC, KERN_PROC_PID, process,\n sizeof(struct kinfo_proc), 0 };\n\n if (sysctl(mib, arraysize(mib), NULL, &len, NULL, 0) == -1)\n return FilePath();\n mib[5] = (len \/ sizeof(struct kinfo_proc));\n if (sysctl(mib, arraysize(mib), &kp, &len, NULL, 0) < 0)\n return FilePath();\n if ((kp.p_flag & P_SYSTEM) != 0)\n return FilePath();\n if (strcmp(kp.p_comm, \"chrome\") == 0)\n return FilePath(kp.p_comm);\n\n return FilePath();\n}\n\nProcessIterator::ProcessIterator(const ProcessFilter* filter)\n : index_of_kinfo_proc_(),\n filter_(filter) {\n\n int mib[] = { CTL_KERN, KERN_PROC, KERN_PROC_UID, getuid(),\n sizeof(struct kinfo_proc), 0 };\n\n bool done = false;\n int try_num = 1;\n const int max_tries = 10;\n\n do {\n size_t len = 0;\n if (sysctl(mib, arraysize(mib), NULL, &len, NULL, 0) < 0) {\n DLOG(ERROR) << \"failed to get the size needed for the process list\";\n kinfo_procs_.resize(0);\n done = true;\n } else {\n size_t num_of_kinfo_proc = len \/ sizeof(struct kinfo_proc);\n \/\/ Leave some spare room for process table growth (more could show up\n \/\/ between when we check and now)\n num_of_kinfo_proc += 16;\n kinfo_procs_.resize(num_of_kinfo_proc);\n len = num_of_kinfo_proc * sizeof(struct kinfo_proc);\n if (sysctl(mib, arraysize(mib), &kinfo_procs_[0], &len, NULL, 0) < 0) {\n \/\/ If we get a mem error, it just means we need a bigger buffer, so\n \/\/ loop around again. Anything else is a real error and give up.\n if (errno != ENOMEM) {\n DLOG(ERROR) << \"failed to get the process list\";\n kinfo_procs_.resize(0);\n done = true;\n }\n } else {\n \/\/ Got the list, just make sure we're sized exactly right\n size_t num_of_kinfo_proc = len \/ sizeof(struct kinfo_proc);\n kinfo_procs_.resize(num_of_kinfo_proc);\n done = true;\n }\n }\n } while (!done && (try_num++ < max_tries));\n\n if (!done) {\n DLOG(ERROR) << \"failed to collect the process list in a few tries\";\n kinfo_procs_.resize(0);\n }\n}\n\nProcessIterator::~ProcessIterator() {\n}\n\nbool ProcessIterator::CheckForNextProcess() {\n std::string data;\n for (; index_of_kinfo_proc_ < kinfo_procs_.size(); ++index_of_kinfo_proc_) {\n kinfo_proc& kinfo = kinfo_procs_[index_of_kinfo_proc_];\n\n \/\/ Skip processes just awaiting collection\n if ((kinfo.p_pid > 0) && (kinfo.p_stat == SZOMB))\n continue;\n\n int mib[] = { CTL_KERN, KERN_PROC_ARGS, kinfo.p_pid };\n\n \/\/ Find out what size buffer we need.\n size_t data_len = 0;\n if (sysctl(mib, arraysize(mib), NULL, &data_len, NULL, 0) < 0) {\n DVPLOG(1) << \"failed to figure out the buffer size for a commandline\";\n continue;\n }\n\n data.resize(data_len);\n if (sysctl(mib, arraysize(mib), &data[0], &data_len, NULL, 0) < 0) {\n DVPLOG(1) << \"failed to fetch a commandline\";\n continue;\n }\n\n \/\/ |data| contains all the command line parameters of the process, separated\n \/\/ by blocks of one or more null characters. We tokenize |data| into a\n \/\/ vector of strings using '\\0' as a delimiter and populate\n \/\/ |entry_.cmd_line_args_|.\n std::string delimiters;\n delimiters.push_back('\\0');\n Tokenize(data, delimiters, &entry_.cmd_line_args_);\n\n \/\/ |data| starts with the full executable path followed by a null character.\n \/\/ We search for the first instance of '\\0' and extract everything before it\n \/\/ to populate |entry_.exe_file_|.\n size_t exec_name_end = data.find('\\0');\n if (exec_name_end == std::string::npos) {\n DLOG(ERROR) << \"command line data didn't match expected format\";\n continue;\n }\n\n entry_.pid_ = kinfo.p_pid;\n entry_.ppid_ = kinfo.p_ppid;\n entry_.gid_ = kinfo.p__pgid;\n size_t last_slash = data.rfind('\/', exec_name_end);\n if (last_slash == std::string::npos)\n entry_.exe_file_.assign(data, 0, exec_name_end);\n else\n entry_.exe_file_.assign(data, last_slash + 1,\n exec_name_end - last_slash - 1);\n \/\/ Start w\/ the next entry next time through\n ++index_of_kinfo_proc_;\n \/\/ Done\n return true;\n }\n return false;\n}\n\nbool NamedProcessIterator::IncludeEntry() {\n return (executable_name_ == entry().exe_file() &&\n ProcessIterator::IncludeEntry());\n}\n\n\nProcessMetrics::ProcessMetrics(ProcessHandle process)\n : process_(process),\n last_time_(0),\n last_system_time_(0),\n last_cpu_(0) {\n\n processor_count_ = base::SysInfo::NumberOfProcessors();\n}\n\n\/\/ static\nProcessMetrics* ProcessMetrics::CreateProcessMetrics(ProcessHandle process) {\n return new ProcessMetrics(process);\n}\n\nsize_t ProcessMetrics::GetPagefileUsage() const {\n struct kinfo_proc info;\n size_t length;\n int mib[] = { CTL_KERN, KERN_PROC, KERN_PROC_PID, process_,\n sizeof(struct kinfo_proc), 0 };\n\n if (sysctl(mib, arraysize(mib), NULL, &length, NULL, 0) < 0)\n return -1;\n\n mib[5] = (length \/ sizeof(struct kinfo_proc));\n\n if (sysctl(mib, arraysize(mib), &info, &length, NULL, 0) < 0)\n return -1;\n\n return (info.p_vm_tsize + info.p_vm_dsize + info.p_vm_ssize);\n}\n\nsize_t ProcessMetrics::GetPeakPagefileUsage() const {\n\n return 0;\n}\n\nsize_t ProcessMetrics::GetWorkingSetSize() const {\n struct kinfo_proc info;\n size_t length;\n int mib[] = { CTL_KERN, KERN_PROC, KERN_PROC_PID, process_,\n sizeof(struct kinfo_proc), 0 };\n\n if (sysctl(mib, arraysize(mib), NULL, &length, NULL, 0) < 0)\n return -1;\n\n mib[5] = (length \/ sizeof(struct kinfo_proc));\n\n if (sysctl(mib, arraysize(mib), &info, &length, NULL, 0) < 0)\n return -1;\n\n return info.p_vm_rssize * getpagesize();\n}\n\nsize_t ProcessMetrics::GetPeakWorkingSetSize() const {\n\n return 0;\n}\n\nbool ProcessMetrics::GetMemoryBytes(size_t* private_bytes,\n size_t* shared_bytes) {\n WorkingSetKBytes ws_usage;\n\n if (!GetWorkingSetKBytes(&ws_usage))\n return false;\n\n if (private_bytes)\n *private_bytes = ws_usage.priv << 10;\n\n if (shared_bytes)\n *shared_bytes = ws_usage.shared * 1024;\n\n return true;\n}\n\nbool ProcessMetrics::GetWorkingSetKBytes(WorkingSetKBytes* ws_usage) const {\n\/\/ TODO(bapt) be sure we can't be precise\n size_t priv = GetWorkingSetSize();\n if (!priv)\n return false;\n ws_usage->priv = priv \/ 1024;\n ws_usage->shareable = 0;\n ws_usage->shared = 0;\n\n return true;\n}\n\nbool ProcessMetrics::GetIOCounters(IoCounters* io_counters) const {\n return false;\n}\n\nstatic int GetProcessCPU(pid_t pid) {\n struct kinfo_proc info;\n size_t length;\n int mib[] = { CTL_KERN, KERN_PROC, KERN_PROC_PID, pid,\n sizeof(struct kinfo_proc), 0 };\n\n if (sysctl(mib, arraysize(mib), NULL, &length, NULL, 0) < 0)\n return -1;\n\n mib[5] = (length \/ sizeof(struct kinfo_proc));\n\n if (sysctl(mib, arraysize(mib), &info, &length, NULL, 0) < 0)\n return 0;\n\n return info.p_pctcpu;\n}\n\ndouble ProcessMetrics::GetCPUUsage() {\n struct timeval now;\n\n int retval = gettimeofday(&now, NULL);\n if (retval)\n return 0;\n\n int64 time = TimeValToMicroseconds(now);\n\n if (last_time_ == 0) {\n \/\/ First call, just set the last values.\n last_time_ = time;\n last_cpu_ = GetProcessCPU(process_);\n return 0;\n }\n\n int64 time_delta = time - last_time_;\n DCHECK_NE(time_delta, 0);\n\n if (time_delta == 0)\n return 0;\n\n int cpu = GetProcessCPU(process_);\n\n last_time_ = time;\n last_cpu_ = cpu;\n\n double percentage = static_cast<double>((cpu * 100.0) \/ FSCALE);\n\n return percentage;\n}\n\nsize_t GetSystemCommitCharge() {\n int mib[] = { CTL_VM, VM_METER };\n int pagesize;\n struct vmtotal vmtotal;\n unsigned long mem_total, mem_free, mem_inactive;\n size_t len = sizeof(vmtotal);\n\n if (sysctl(mib, arraysize(mib), &vmtotal, &len, NULL, 0) < 0)\n return 0;\n\n mem_total = vmtotal.t_vm;\n mem_free = vmtotal.t_free;\n mem_inactive = vmtotal.t_vm - vmtotal.t_avm;\n\n pagesize = getpagesize();\n\n return mem_total - (mem_free*pagesize) - (mem_inactive*pagesize);\n}\n\nvoid EnableTerminationOnOutOfMemory() {\n}\n\nvoid EnableTerminationOnHeapCorruption() {\n}\n\n} \/\/ namespace base\n<|endoftext|>"} {"text":"<commit_before>\/*************************************************************************\n *\n * OpenOffice.org - a multi-platform office productivity suite\n *\n * $RCSfile: opcodes.hxx,v $\n *\n * $Revision: 1.8 $\n *\n * last change: $Author: rt $ $Date: 2005-09-07 21:34:17 $\n *\n * The Contents of this file are made available subject to\n * the terms of GNU Lesser General Public License Version 2.1.\n *\n *\n * GNU Lesser General Public License Version 2.1\n * =============================================\n * Copyright 2005 by Sun Microsystems, Inc.\n * 901 San Antonio Road, Palo Alto, CA 94303, USA\n *\n * This library is free software; you can redistribute it and\/or\n * modify it under the terms of the GNU Lesser General Public\n * License version 2.1, as published by the Free Software Foundation.\n *\n * This library is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU\n * Lesser General Public License for more details.\n *\n * You should have received a copy of the GNU Lesser General Public\n * License along with this library; if not, write to the Free Software\n * Foundation, Inc., 59 Temple Place, Suite 330, Boston,\n * MA 02111-1307 USA\n *\n ************************************************************************\/\n\n#ifndef _OPCODES_HXX\n#define _OPCODES_HXX\n\n#include \"sbintern.hxx\"\n\n#ifdef MTW\n#undef _NUMBER\n#endif\n\n\/\/ Ein Opcode ist entweder 1, 3 oder 5 Bytes lang, je nach numerischen\n\/\/ Wert des Opcodes (s.u.).\n\nenum SbiOpcode {\n \/\/ Alle Opcodes ohne Operanden\n _NOP = 0,\n\n SbOP0_START = _NOP,\n\n \/\/ Operatoren\n \/\/ die folgenden Operatoren sind genauso angeordnet\n \/\/ wie der enum SbxVarOp\n _EXP, _MUL, _DIV, _MOD, _PLUS, _MINUS, _NEG,\n _EQ, _NE, _LT, _GT, _LE, _GE,\n _IDIV, _AND, _OR, _XOR, _EQV, _IMP, _NOT,\n _CAT,\n \/\/ Ende enum SbxVarOp\n _LIKE, _IS,\n \/\/ Laden\/speichern\n _ARGC, \/\/ neuen Argv einrichten\n _ARGV, \/\/ TOS ==> aktueller Argv\n _INPUT, \/\/ Input ==> TOS\n _LINPUT, \/\/ Line Input ==> TOS\n _GET, \/\/ TOS anfassen\n _SET, \/\/ Speichern Objekt TOS ==> TOS-1\n _PUT, \/\/ TOS ==> TOS-1\n _PUTC, \/\/ TOS ==> TOS-1, dann ReadOnly\n _DIM, \/\/ DIM\n _REDIM, \/\/ REDIM\n _REDIMP, \/\/ REDIM PRESERVE\n _ERASE, \/\/ TOS loeschen\n \/\/ Verzweigen\n _STOP, \/\/ Programmende\n _INITFOR, \/\/ FOR-Variable initialisieren\n _NEXT, \/\/ FOR-Variable inkrementieren\n _CASE, \/\/ Anfang CASE\n _ENDCASE, \/\/ Ende CASE\n _STDERROR, \/\/ Standard-Fehlerbehandlung\n _NOERROR, \/\/ keine Fehlerbehandlung\n _LEAVE, \/\/ UP verlassen\n \/\/ E\/A\n _CHANNEL, \/\/ TOS = Kanalnummer\n _BPRINT, \/\/ print TOS\n _PRINTF, \/\/ print TOS in field\n _BWRITE, \/\/ write TOS\n _RENAME, \/\/ Rename Tos+1 to Tos\n _PROMPT, \/\/ TOS = Prompt for Input\n _RESTART, \/\/ Restartpunkt definieren\n _CHAN0, \/\/ I\/O-Kanal 0\n \/\/ Sonstiges\n _EMPTY, \/\/ Leeren Ausdruck auf Stack\n _ERROR, \/\/ TOS = Fehlercode\n _LSET, \/\/ Speichern Objekt TOS ==> TOS-1\n _RSET, \/\/ Speichern Objekt TOS ==> TOS-1\n _REDIMP_ERASE, \/\/ Copies array to be later used by REDIM PRESERVE before erasing it\n _INITFOREACH,\n SbOP0_END,\n\n \/\/ Alle Opcodes mit einem Operanden\n\n _NUMBER = 0x40, \/\/ Laden einer numerischen Konstanten (+ID)\n\n SbOP1_START = _NUMBER,\n\n _SCONST, \/\/ Laden einer Stringkonstanten (+ID)\n _CONST, \/\/ Immediate Load (+Wert)\n _ARGN, \/\/ Speichern eines named Args in Argv (+StringID)\n _PAD, \/\/ String auf feste Laenge bringen (+Laenge)\n \/\/ Verzweigungen\n _JUMP, \/\/ Sprung (+Target)\n _JUMPT, \/\/ TOS auswerten, bedingter Sprung (+Target)\n _JUMPF, \/\/ TOS auswerten, bedingter Sprung (+Target)\n _ONJUMP, \/\/ TOS auswerten, Sprung in JUMP-Tabelle (+MaxVal)\n _GOSUB, \/\/ UP-Aufruf (+Target)\n _RETURN, \/\/ UP-Return (+0 oder Target)\n _TESTFOR, \/\/ FOR-Variable testen, inkrementieren (+Endlabel)\n _CASETO, \/\/ Tos+1 <= Case <= Tos, 2xremove (+Target)\n _ERRHDL, \/\/ Fehler-Handler (+Offset)\n _RESUME, \/\/ Resume nach Fehlern (+0 or 1 or Label)\n \/\/ E\/A\n _CLOSE, \/\/ (+Kanal\/0)\n _PRCHAR, \/\/ (+char)\n \/\/ Verwaltung\n _SETCLASS, \/\/ Set + Klassennamen testen (+StringId)\n _TESTCLASS, \/\/ Check TOS class (+StringId)\n _LIB, \/\/ Libnamen fuer Declare-Procs setzen (+StringId)\n _BASED, \/\/ TOS wird um BASE erhoeht, BASE davor gepusht (+base)\n \/\/ Typanpassung im Argv\n _ARGTYP, \/\/ Letzten Parameter in Argv konvertieren (+Typ)\n\n SbOP1_END,\n\n \/\/ Alle Opcodes mit zwei Operanden\n\n _RTL = 0x80, \/\/ Laden aus RTL (+StringID+Typ)\n\n SbOP2_START = _RTL,\n\n _FIND, \/\/ Laden (+StringID+Typ)\n _ELEM, \/\/ Laden Element (+StringID+Typ)\n _PARAM, \/\/ Parameter (+Offset+Typ)\n \/\/ Verzweigen\n _CALL, \/\/ DECLARE-Methode rufen (+StringID+Typ)\n _CALLC, \/\/ Cdecl-DECLARE-Methode rufen (+StringID+Typ)\n _CASEIS, \/\/ Case-Test (+Test-Opcode+True-Target)\n \/\/ Verwaltung\n _STMNT, \/\/ Beginn eines Statements (+Line+Col)\n \/\/ E\/A\n _OPEN, \/\/ (+SvStreamFlags+Flags)\n \/\/ Objekte\n _LOCAL, \/\/ Lokale Variable definieren (+StringID+Typ)\n _PUBLIC, \/\/ Modulglobale Variable (+StringID+Typ)\n _GLOBAL, \/\/ Globale Variable definieren, public-Anweisung (+StringID+Typ)\n _CREATE, \/\/ Objekt kreieren (+StringId+StringID)\n _STATIC, \/\/ Statische Variabl (+StringID+Typ) JSM\n _TCREATE, \/\/ User Defined Objekt kreieren\n _DCREATE, \/\/ Objekt-Array kreieren (+StringId+StringID)\n _GLOBAL_P, \/\/ Globale Variable definieren, die beim Neustart von Basic\n \/\/ nicht ueberschrieben wird, P=PERSIST (+StringID+Typ)\n _FIND_G, \/\/ Sucht globale Variable mit Spezialbehandlung wegen _GLOBAL_P\n _DCREATE_REDIMP, \/\/ Objekt-Array redimensionieren (+StringId+StringID)\n _FIND_CM, \/\/ Search inside a class module (CM) to enable global search in time\n SbOP2_END\n\n};\n\n\n\n#endif\n<commit_msg>INTEGRATION: CWS ab17fixes (1.7.10); FILE MERGED<commit_after>\/*************************************************************************\n *\n * $RCSfile: opcodes.hxx,v $\n *\n * $Revision: 1.9 $\n *\n * last change: $Author: hr $ $Date: 2005-09-29 13:00: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 _OPCODES_HXX\n#define _OPCODES_HXX\n\n#include \"sbintern.hxx\"\n\n#ifdef MTW\n#undef _NUMBER\n#endif\n\n\/\/ Ein Opcode ist entweder 1, 3 oder 5 Bytes lang, je nach numerischen\n\/\/ Wert des Opcodes (s.u.).\n\nenum SbiOpcode {\n \/\/ Alle Opcodes ohne Operanden\n _NOP = 0,\n\n SbOP0_START = _NOP,\n\n \/\/ Operatoren\n \/\/ die folgenden Operatoren sind genauso angeordnet\n \/\/ wie der enum SbxVarOp\n _EXP, _MUL, _DIV, _MOD, _PLUS, _MINUS, _NEG,\n _EQ, _NE, _LT, _GT, _LE, _GE,\n _IDIV, _AND, _OR, _XOR, _EQV, _IMP, _NOT,\n _CAT,\n \/\/ Ende enum SbxVarOp\n _LIKE, _IS,\n \/\/ Laden\/speichern\n _ARGC, \/\/ neuen Argv einrichten\n _ARGV, \/\/ TOS ==> aktueller Argv\n _INPUT, \/\/ Input ==> TOS\n _LINPUT, \/\/ Line Input ==> TOS\n _GET, \/\/ TOS anfassen\n _SET, \/\/ Speichern Objekt TOS ==> TOS-1\n _PUT, \/\/ TOS ==> TOS-1\n _PUTC, \/\/ TOS ==> TOS-1, dann ReadOnly\n _DIM, \/\/ DIM\n _REDIM, \/\/ REDIM\n _REDIMP, \/\/ REDIM PRESERVE\n _ERASE, \/\/ TOS loeschen\n \/\/ Verzweigen\n _STOP, \/\/ Programmende\n _INITFOR, \/\/ FOR-Variable initialisieren\n _NEXT, \/\/ FOR-Variable inkrementieren\n _CASE, \/\/ Anfang CASE\n _ENDCASE, \/\/ Ende CASE\n _STDERROR, \/\/ Standard-Fehlerbehandlung\n _NOERROR, \/\/ keine Fehlerbehandlung\n _LEAVE, \/\/ UP verlassen\n \/\/ E\/A\n _CHANNEL, \/\/ TOS = Kanalnummer\n _BPRINT, \/\/ print TOS\n _PRINTF, \/\/ print TOS in field\n _BWRITE, \/\/ write TOS\n _RENAME, \/\/ Rename Tos+1 to Tos\n _PROMPT, \/\/ TOS = Prompt for Input\n _RESTART, \/\/ Restartpunkt definieren\n _CHAN0, \/\/ I\/O-Kanal 0\n \/\/ Sonstiges\n _EMPTY, \/\/ Leeren Ausdruck auf Stack\n _ERROR, \/\/ TOS = Fehlercode\n _LSET, \/\/ Speichern Objekt TOS ==> TOS-1\n _RSET, \/\/ Speichern Objekt TOS ==> TOS-1\n _REDIMP_ERASE, \/\/ Copies array to be later used by REDIM PRESERVE before erasing it\n _INITFOREACH,\n SbOP0_END,\n\n \/\/ Alle Opcodes mit einem Operanden\n\n _NUMBER = 0x40, \/\/ Laden einer numerischen Konstanten (+ID)\n\n SbOP1_START = _NUMBER,\n\n _SCONST, \/\/ Laden einer Stringkonstanten (+ID)\n _CONST, \/\/ Immediate Load (+Wert)\n _ARGN, \/\/ Speichern eines named Args in Argv (+StringID)\n _PAD, \/\/ String auf feste Laenge bringen (+Laenge)\n \/\/ Verzweigungen\n _JUMP, \/\/ Sprung (+Target)\n _JUMPT, \/\/ TOS auswerten, bedingter Sprung (+Target)\n _JUMPF, \/\/ TOS auswerten, bedingter Sprung (+Target)\n _ONJUMP, \/\/ TOS auswerten, Sprung in JUMP-Tabelle (+MaxVal)\n _GOSUB, \/\/ UP-Aufruf (+Target)\n _RETURN, \/\/ UP-Return (+0 oder Target)\n _TESTFOR, \/\/ FOR-Variable testen, inkrementieren (+Endlabel)\n _CASETO, \/\/ Tos+1 <= Case <= Tos, 2xremove (+Target)\n _ERRHDL, \/\/ Fehler-Handler (+Offset)\n _RESUME, \/\/ Resume nach Fehlern (+0 or 1 or Label)\n \/\/ E\/A\n _CLOSE, \/\/ (+Kanal\/0)\n _PRCHAR, \/\/ (+char)\n \/\/ Verwaltung\n _SETCLASS, \/\/ Set + Klassennamen testen (+StringId)\n _TESTCLASS, \/\/ Check TOS class (+StringId)\n _LIB, \/\/ Libnamen fuer Declare-Procs setzen (+StringId)\n _BASED, \/\/ TOS wird um BASE erhoeht, BASE davor gepusht (+base)\n \/\/ Typanpassung im Argv\n _ARGTYP, \/\/ Letzten Parameter in Argv konvertieren (+Typ)\n\n SbOP1_END,\n\n \/\/ Alle Opcodes mit zwei Operanden\n\n _RTL = 0x80, \/\/ Laden aus RTL (+StringID+Typ)\n\n SbOP2_START = _RTL,\n\n _FIND, \/\/ Laden (+StringID+Typ)\n _ELEM, \/\/ Laden Element (+StringID+Typ)\n _PARAM, \/\/ Parameter (+Offset+Typ)\n \/\/ Verzweigen\n _CALL, \/\/ DECLARE-Methode rufen (+StringID+Typ)\n _CALLC, \/\/ Cdecl-DECLARE-Methode rufen (+StringID+Typ)\n _CASEIS, \/\/ Case-Test (+Test-Opcode+True-Target)\n \/\/ Verwaltung\n _STMNT, \/\/ Beginn eines Statements (+Line+Col)\n \/\/ E\/A\n _OPEN, \/\/ (+SvStreamFlags+Flags)\n \/\/ Objekte\n _LOCAL, \/\/ Lokale Variable definieren (+StringID+Typ)\n _PUBLIC, \/\/ Modulglobale Variable (+StringID+Typ)\n _GLOBAL, \/\/ Globale Variable definieren, public-Anweisung (+StringID+Typ)\n _CREATE, \/\/ Objekt kreieren (+StringId+StringID)\n _STATIC, \/\/ Statische Variabl (+StringID+Typ) JSM\n _TCREATE, \/\/ User Defined Objekt kreieren\n _DCREATE, \/\/ Objekt-Array kreieren (+StringId+StringID)\n _GLOBAL_P, \/\/ Globale Variable definieren, die beim Neustart von Basic\n \/\/ nicht ueberschrieben wird, P=PERSIST (+StringID+Typ)\n _FIND_G, \/\/ Sucht globale Variable mit Spezialbehandlung wegen _GLOBAL_P\n _DCREATE_REDIMP, \/\/ Objekt-Array redimensionieren (+StringId+StringID)\n _FIND_CM, \/\/ Search inside a class module (CM) to enable global search in time\n SbOP2_END\n\n};\n\n\n\n#endif\n<|endoftext|>"} {"text":"<commit_before><commit_msg>coverity#984078 Uninitialized scalar field<commit_after><|endoftext|>"} {"text":"<commit_before>\/***********************************************************************\n created: Sat Jul 19 2014\n author: Timotei Dolean <timotei21@gmail.com>\n*************************************************************************\/\n\/***************************************************************************\n * Copyright (C) 2004 - 2014 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\/widgets\/ListWidget.h\"\n\nnamespace CEGUI\n{\n\n\/\/----------------------------------------------------------------------------\/\/\nListWidgetItem& indexToWidgetItem(const ModelIndex& index)\n{\n return *(static_cast<ListWidgetItem*>(index.d_modelData));\n}\n\n\/\/----------------------------------------------------------------------------\/\/\nconst String ListWidget::EventNamespace(\"ListWidget\");\nconst String ListWidget::WidgetTypeName(\"CEGUI\/ListWidget\");\n\n\/\/----------------------------------------------------------------------------\/\/\nListWidget::ListWidget(const String& type, const String& name) :\n ListView(type, name)\n{\n}\n\n\/\/----------------------------------------------------------------------------\/\/\nListWidget::~ListWidget()\n{\n}\n\n\/\/----------------------------------------------------------------------------\/\/\nListWidgetItem::ListWidgetItem()\n{\n\n}\n\n\/\/----------------------------------------------------------------------------\/\/\nListWidgetItem::~ListWidgetItem()\n{\n}\n\n\/\/----------------------------------------------------------------------------\/\/\nbool ListWidgetItem::operator==(const ListWidgetItem& other) const\n{\n return getText() == other.getText();\n}\n\n\/\/----------------------------------------------------------------------------\/\/\nbool ListWidgetItem::operator<(const ListWidgetItem& other) const\n{\n return getText() < other.getText();\n}\n\n\/\/----------------------------------------------------------------------------\/\/\nbool ListWidget::isValidIndex(const ModelIndex& model_index) const\n{\n return model_index.d_modelData != 0 && getChildId(model_index) != -1;\n}\n\n\/\/----------------------------------------------------------------------------\/\/\nModelIndex ListWidget::makeIndex(size_t child, const ModelIndex& parent_index)\n{\n if (child >= d_widgetItems.size())\n return ModelIndex();\n\n return ModelIndex(&d_widgetItems[child]);\n}\n\n\/\/----------------------------------------------------------------------------\/\/\nbool ListWidget::areIndicesEqual(const ModelIndex& index1, const ModelIndex& index2) const\n{\n return compareIndices(index1, index2) == 0;\n}\n\n\/\/----------------------------------------------------------------------------\/\/\nint ListWidget::compareIndices(const ModelIndex& index1, const ModelIndex& index2) const\n{\n if (!isValidIndex(index1) || !isValidIndex(index2))\n return false;\n\n return indexToWidgetItem(index1) < indexToWidgetItem(index2);\n}\n\n\/\/----------------------------------------------------------------------------\/\/\nModelIndex ListWidget::getParentIndex(const ModelIndex& model_index) const\n{\n return getRootIndex();\n}\n\n\/\/----------------------------------------------------------------------------\/\/\nint ListWidget::getChildId(const ModelIndex& model_index) const\n{\n std::vector<ListWidgetItem>::const_iterator itor =\n std::find(d_widgetItems.begin(), d_widgetItems.end(), indexToWidgetItem(model_index));\n\n if (itor == d_widgetItems.end())\n return -1;\n\n return std::distance(d_widgetItems.begin(), itor);\n}\n\n\/\/----------------------------------------------------------------------------\/\/\nModelIndex ListWidget::getRootIndex() const\n{\n return ModelIndex();\n}\n\n\/\/----------------------------------------------------------------------------\/\/\nsize_t ListWidget::getChildCount(const ModelIndex& model_index) const\n{\n return d_widgetItems.size();\n}\n\n\/\/----------------------------------------------------------------------------\/\/\nString ListWidget::getData(const ModelIndex& model_index, ItemDataRole role \/*= IDR_Text*\/)\n{\n if (!isValidIndex(model_index))\n return \"\";\n\n return indexToWidgetItem(model_index).getText();\n}\n\n\/\/----------------------------------------------------------------------------\/\/\nvoid ListWidget::addItem(String text)\n{\n ListWidgetItem item;\n item.setText(text);\n\n addItem(item);\n}\n\n\/\/----------------------------------------------------------------------------\/\/\nvoid ListWidget::addItem(const ListWidgetItem& item)\n{\n d_widgetItems.push_back(item);\n notifyChildrenAdded(getRootIndex(), d_widgetItems.size() - 1, 1);\n}\n\n\/\/----------------------------------------------------------------------------\/\/\nvoid ListWidget::initialiseComponents()\n{\n ListView::initialiseComponents();\n setModel(this);\n}\n}\n<commit_msg>Properly implement 'compareIndices' for ListWidget<commit_after>\/***********************************************************************\n created: Sat Jul 19 2014\n author: Timotei Dolean <timotei21@gmail.com>\n*************************************************************************\/\n\/***************************************************************************\n * Copyright (C) 2004 - 2014 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\/widgets\/ListWidget.h\"\n\nnamespace CEGUI\n{\n\n\/\/----------------------------------------------------------------------------\/\/\nListWidgetItem& indexToWidgetItem(const ModelIndex& index)\n{\n return *(static_cast<ListWidgetItem*>(index.d_modelData));\n}\n\n\/\/----------------------------------------------------------------------------\/\/\nconst String ListWidget::EventNamespace(\"ListWidget\");\nconst String ListWidget::WidgetTypeName(\"CEGUI\/ListWidget\");\n\n\/\/----------------------------------------------------------------------------\/\/\nListWidget::ListWidget(const String& type, const String& name) :\n ListView(type, name)\n{\n}\n\n\/\/----------------------------------------------------------------------------\/\/\nListWidget::~ListWidget()\n{\n}\n\n\/\/----------------------------------------------------------------------------\/\/\nListWidgetItem::ListWidgetItem()\n{\n\n}\n\n\/\/----------------------------------------------------------------------------\/\/\nListWidgetItem::~ListWidgetItem()\n{\n}\n\n\/\/----------------------------------------------------------------------------\/\/\nbool ListWidgetItem::operator==(const ListWidgetItem& other) const\n{\n return getText() == other.getText();\n}\n\n\/\/----------------------------------------------------------------------------\/\/\nbool ListWidgetItem::operator<(const ListWidgetItem& other) const\n{\n return getText() < other.getText();\n}\n\n\/\/----------------------------------------------------------------------------\/\/\nbool ListWidget::isValidIndex(const ModelIndex& model_index) const\n{\n return model_index.d_modelData != 0 && getChildId(model_index) != -1;\n}\n\n\/\/----------------------------------------------------------------------------\/\/\nModelIndex ListWidget::makeIndex(size_t child, const ModelIndex& parent_index)\n{\n if (child >= d_widgetItems.size())\n return ModelIndex();\n\n return ModelIndex(&d_widgetItems[child]);\n}\n\n\/\/----------------------------------------------------------------------------\/\/\nbool ListWidget::areIndicesEqual(const ModelIndex& index1, const ModelIndex& index2) const\n{\n return compareIndices(index1, index2) == 0;\n}\n\n\/\/----------------------------------------------------------------------------\/\/\nint ListWidget::compareIndices(const ModelIndex& index1, const ModelIndex& index2) const\n{\n if (!isValidIndex(index1) || !isValidIndex(index2))\n return false;\n\n if (indexToWidgetItem(index1) < indexToWidgetItem(index2))\n return -1;\n\n return indexToWidgetItem(index1) == indexToWidgetItem(index2) ? 0 : 1;\n}\n\n\/\/----------------------------------------------------------------------------\/\/\nModelIndex ListWidget::getParentIndex(const ModelIndex& model_index) const\n{\n return getRootIndex();\n}\n\n\/\/----------------------------------------------------------------------------\/\/\nint ListWidget::getChildId(const ModelIndex& model_index) const\n{\n std::vector<ListWidgetItem>::const_iterator itor =\n std::find(d_widgetItems.begin(), d_widgetItems.end(), indexToWidgetItem(model_index));\n\n if (itor == d_widgetItems.end())\n return -1;\n\n return std::distance(d_widgetItems.begin(), itor);\n}\n\n\/\/----------------------------------------------------------------------------\/\/\nModelIndex ListWidget::getRootIndex() const\n{\n return ModelIndex();\n}\n\n\/\/----------------------------------------------------------------------------\/\/\nsize_t ListWidget::getChildCount(const ModelIndex& model_index) const\n{\n return d_widgetItems.size();\n}\n\n\/\/----------------------------------------------------------------------------\/\/\nString ListWidget::getData(const ModelIndex& model_index, ItemDataRole role \/*= IDR_Text*\/)\n{\n if (!isValidIndex(model_index))\n return \"\";\n\n return indexToWidgetItem(model_index).getText();\n}\n\n\/\/----------------------------------------------------------------------------\/\/\nvoid ListWidget::addItem(String text)\n{\n ListWidgetItem item;\n item.setText(text);\n\n addItem(item);\n}\n\n\/\/----------------------------------------------------------------------------\/\/\nvoid ListWidget::addItem(const ListWidgetItem& item)\n{\n d_widgetItems.push_back(item);\n notifyChildrenAdded(getRootIndex(), d_widgetItems.size() - 1, 1);\n}\n\n\/\/----------------------------------------------------------------------------\/\/\nvoid ListWidget::initialiseComponents()\n{\n ListView::initialiseComponents();\n setModel(this);\n}\n}\n<|endoftext|>"} {"text":"<commit_before>#include \"properties\/QuaternionProperty.h\"\n\n#include \"i6engine\/math\/i6eVector.h\"\n\n#include \"properties\/Vec3Property.h\"\n\n#include \"widgets\/PropertyWindow.h\"\n\n#include <QLabel>\n#include <QDoubleSpinBox>\n\nnamespace i6engine {\nnamespace particleEditor {\nnamespace properties {\n\n\tQuaternionProperty::QuaternionProperty(QWidget * par, QString label, QString name, Quaternion value) : Property(par, label, name), _layout(nullptr), _value(value), _vec3Property(nullptr), _doubleSpinBox(nullptr) {\n\t\tQWidget * widget = new QWidget(this);\n\t\tVec3 axis;\n\t\tdouble angle;\n\t\tvalue.toAxisAngle(axis, angle);\n\n\t\t_layout = new QGridLayout(widget);\n\t\twidget->setLayout(_layout);\n\t\t_vec3Property = new Vec3Property(widget, \"Axis\", \"Axis\", axis.toOgre());\n\t\t_layout->addWidget(_vec3Property, 0, 0);\n\t\tconnect(_vec3Property, SIGNAL(changed(QString)), this, SLOT(changedValue()));\n\t\t_vec3Property->setSizePolicy(QSizePolicy::Policy::Expanding, QSizePolicy::Policy::Fixed);\n\n\t\tQLabel * l = new QLabel(\"Angle\", widget);\n\t\t_layout->addWidget(l, 1, 0);\n\t\t_doubleSpinBox = new QDoubleSpinBox(this);\n\t\t_doubleSpinBox->setMinimum(-360.0);\n\t\t_doubleSpinBox->setMaximum(360.0);\n\t\t_doubleSpinBox->setValue(angle);\n\t\t_layout->addWidget(_doubleSpinBox, 2, 0);\n\t\tconnect(_doubleSpinBox, SIGNAL(valueChanged(double)), this, SLOT(changedValue()));\n\t\tl->setSizePolicy(QSizePolicy::Policy::Expanding, QSizePolicy::Policy::Fixed);\n\t\t_doubleSpinBox->setSizePolicy(QSizePolicy::Policy::Expanding, QSizePolicy::Policy::Fixed);\n\n\t\thorizontalLayout->addWidget(widget);\n\t}\n\n\tQuaternionProperty::~QuaternionProperty() {\n\t}\n\n\tvoid QuaternionProperty::setQuaternion(Quaternion value) {\n\t\t_value = value;\n\t\tVec3 axis;\n\t\tdouble angle;\n\t\tvalue.toAxisAngle(axis, angle);\n\t\t_vec3Property->setVector3(axis.toOgre());\n\t\t_doubleSpinBox->setValue(angle);\n\t}\n\n\tvoid QuaternionProperty::changedValue() {\n\t\t_value = Quaternion(Vec3(_vec3Property->getVector3()), _doubleSpinBox->value());\n\t\ttriggerChangedSignal();\n\t}\n\n} \/* namespace properties *\/\n} \/* namespace particleEditor *\/\n} \/* namespace i6engine *\/\n<commit_msg>ISIXE-1745 changing orientation in ParticleEditor doesn't crash anymore<commit_after>#include \"properties\/QuaternionProperty.h\"\n\n#include \"i6engine\/math\/i6eVector.h\"\n\n#include \"properties\/Vec3Property.h\"\n\n#include \"widgets\/PropertyWindow.h\"\n\n#include <QLabel>\n#include <QDoubleSpinBox>\n\nnamespace i6engine {\nnamespace particleEditor {\nnamespace properties {\n\n\tQuaternionProperty::QuaternionProperty(QWidget * par, QString label, QString name, Quaternion value) : Property(par, label, name), _layout(nullptr), _value(value), _vec3Property(nullptr), _doubleSpinBox(nullptr) {\n\t\tQWidget * widget = new QWidget(this);\n\t\tVec3 axis;\n\t\tdouble angle;\n\t\tvalue.toAxisAngle(axis, angle);\n\n\t\t_layout = new QGridLayout(widget);\n\t\twidget->setLayout(_layout);\n\t\t_vec3Property = new Vec3Property(widget, \"Axis\", \"Axis\", axis.toOgre());\n\t\t_layout->addWidget(_vec3Property, 0, 0);\n\t\tconnect(_vec3Property, SIGNAL(changed(QString)), this, SLOT(changedValue()));\n\t\t_vec3Property->setSizePolicy(QSizePolicy::Policy::Expanding, QSizePolicy::Policy::Fixed);\n\n\t\tQLabel * l = new QLabel(\"Angle\", widget);\n\t\t_layout->addWidget(l, 1, 0);\n\t\t_doubleSpinBox = new QDoubleSpinBox(this);\n\t\t_doubleSpinBox->setMinimum(-360.0);\n\t\t_doubleSpinBox->setMaximum(360.0);\n\t\t_doubleSpinBox->setValue(angle);\n\t\t_layout->addWidget(_doubleSpinBox, 2, 0);\n\t\tconnect(_doubleSpinBox, SIGNAL(valueChanged(double)), this, SLOT(changedValue()));\n\t\tl->setSizePolicy(QSizePolicy::Policy::Expanding, QSizePolicy::Policy::Fixed);\n\t\t_doubleSpinBox->setSizePolicy(QSizePolicy::Policy::Expanding, QSizePolicy::Policy::Fixed);\n\n\t\thorizontalLayout->addWidget(widget);\n\t}\n\n\tQuaternionProperty::~QuaternionProperty() {\n\t}\n\n\tvoid QuaternionProperty::setQuaternion(Quaternion value) {\n\t\t_value = value;\n\t\tVec3 axis;\n\t\tdouble angle;\n\t\tvalue.toAxisAngle(axis, angle);\n\t\t_vec3Property->setVector3(axis.toOgre());\n\t\t_doubleSpinBox->setValue(angle);\n\t}\n\n\tvoid QuaternionProperty::changedValue() {\n\t\t_value = Quaternion(Vec3(_vec3Property->getVector3().normalisedCopy()), _doubleSpinBox->value());\n\t\ttriggerChangedSignal();\n\t}\n\n} \/* namespace properties *\/\n} \/* namespace particleEditor *\/\n} \/* namespace i6engine *\/\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\/\/#include \"goto-def.h\"\n\n\/* Copyright (c) FFLAS-FFPACK\n* Written by Clément Pernet <clement.pernet@imag.fr>\n* ========LICENCE========\n* This file is part of the library FFLAS-FFPACK.\n*\n* FFLAS-FFPACK is free software: you can redistribute it and\/or modify\n* it under the terms of the GNU Lesser General Public\n* License as published by the Free Software Foundation; either\n* version 2.1 of the License, or (at your option) any later version.\n*\n* This library is distributed in the hope that it will be useful,\n* but WITHOUT ANY WARRANTY; without even the implied warranty of\n* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU\n* Lesser General Public License for more details.\n*\n* You should have received a copy of the GNU Lesser General Public\n* License along with this library; if not, write to the Free Software\n* Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA\n* ========LICENCE========\n*\/\n#define __FFLASFFPACK_USE_OPENMP4\n#include <iostream>\n\n#include \"fflas-ffpack\/config-blas.h\"\n#include \"fflas-ffpack\/fflas\/fflas.h\"\n#include \"fflas-ffpack\/field\/modular-balanced.h\"\n#include \"fflas-ffpack\/utils\/timer.h\"\n#include \"fflas-ffpack\/utils\/Matio.h\"\n#include \"fflas-ffpack\/utils\/args-parser.h\"\n#include \"tests\/test-utils.h\"\n#include \"libkomp.h\"\nusing namespace std;\n\n#ifdef __FFLASFFPACK_USE_OPENMP4\n\n\ntemplate<class Element>\nvoid Initialize(Element * C, int BS, size_t m, size_t n)\n{\n\/\/#pragma omp parallel for collapse(2) schedule(runtime) \n\tBS=std::max(BS, __FFLASFFPACK_WINOTHRESHOLD_BAL );\n\tPAR_REGION{\n\tfor(size_t p=0; p<m; p+=BS) \/\/\/row\n\t\tfor(size_t pp=0; pp<n; pp+=BS) \/\/column\n\t\t{\n\t\t\tsize_t M=BS, MM=BS;\n\t\t\tif(!(p+BS<m))\n\t\t\t\tM=m-p;\n\t\t\tif(!(pp+BS<n))\n\t\t\t\tMM=n-pp;\n#pragma omp task \n\t\t\t{\n\t\t\tfor(size_t j=0; j<M; j++)\n\t\t\t\tfor(size_t jj=0; jj<MM; jj++)\n\t\t\t\t\tC[(p+j)*n+pp+jj]=0;\n\t\t\t}\n\t\t}\n\t#pragma omp taskwait\n\t}\n\t\/\/ printf(\"A = \\n\");\n\t\/\/ for (size_t i=0; i<m; i+=128)\n\t\/\/ {\n\t\/\/ \tfor (size_t j=0; j<n; j+=128)\n\t\/\/ \t{\n\t\/\/ \t\tint ld = komp_get_locality_domain_num_for( &C[i*n+j] );\n\t\/\/ \t\tprintf(\"%i \", ld);\n\t\/\/ \t}\n\t\/\/ \tprintf(\"\\n\");\n\t\/\/ }\n\n}\n#endif\nint main(int argc, char** argv) {\n\n\tsize_t iter = 3 ;\n\tint q = 131071 ;\n\tsize_t m = 2000 ;\n\tsize_t k = 2000 ;\n\tsize_t n = 2000 ;\n\tint nbw = -1 ;\n\tint p=0;\n\tint t=MAX_THREADS;\n\tint NBK = -1;\n\tArgument as[] = {\n\t\t{ 'q', \"-q Q\", \"Set the field characteristic (-1 for random).\", TYPE_INT , &q },\n\t\t{ 'm', \"-m M\", \"Set the row dimension of A.\", TYPE_INT , &m },\n\t\t{ 'k', \"-k K\", \"Set the col dimension of A.\", TYPE_INT , &k },\n\t\t{ 'n', \"-n N\", \"Set the col dimension of B.\", TYPE_INT , &n },\n\t\t{ 'w', \"-w N\", \"Set the number of winograd levels (-1 for random).\", TYPE_INT , &nbw },\n\t\t{ 'i', \"-i R\", \"Set number of repetitions.\", TYPE_INT , &iter },\n\t\t{ 'p', \"-p P\", \"0 for sequential, 1 for 2D iterative, 2 for 2D rec, 3 for 2D rec adaptive, 4 for 3D rc in-place, 5 for 3D rec, 6 for 3D rec adaptive.\", TYPE_INT , &p },\n\t\t{ 't', \"-t T\", \"number of virtual threads to drive the partition.\", TYPE_INT , &t },\n\t\t{ 'b', \"-b B\", \"number of numa blocks per dimension for the numa placement\", TYPE_INT , &NBK },\n\t\tEND_OF_ARGUMENTS\n\t};\n\n\tFFLAS::parseArguments(argc,argv,as);\n\n\tif (NBK==-1) NBK = t;\n typedef FFPACK::ModularBalanced<double> Field;\n\/\/ typedef FFPACK::ModularBalanced<float> Field;\n typedef Field::Element Element;\n\n Field F(q);\n\n FFLAS::Timer chrono, freidvals;\n double time=0.0, timev=0.0;\n\n Element * A, * B, * C;\n Element *v, *w, *y, *x;\n\n Field::RandIter G(F); \n A = FFLAS::fflas_new(F,m,k,Alignment::PAGESIZE);\n\/\/#pragma omp parallel for collapse(2) schedule(runtime) \n Initialize(A,m\/NBK,m,k);\n for (size_t i=0; i<(size_t)m; ++i)\n\t for (size_t j=0; j<(size_t)k; ++j)\n\t\t G.random (*(A+i*k+j));\n \n B = FFLAS::fflas_new(F,k,n,Alignment::PAGESIZE);\n\/\/#pragma omp parallel for collapse(2) schedule(runtime) \n Initialize(B,k\/NBK,k,n);\n for (size_t i=0; i<(size_t)k; ++i)\n\t for (size_t j=0; j<(size_t)n; ++j)\n\t\t G.random(*(B+i*n+j));\n\n C = FFLAS::fflas_new(F,m,n,Alignment::PAGESIZE);\n\/\/#pragma omp parallel for collapse(2) schedule(runtime) \n Initialize(C,m\/NBK,m,n);\n for (size_t i=0; i<(size_t)m; ++i)\n\t for (size_t j=0; j<(size_t)n; ++j)\n\t\t G.random (*(C+i*n+j));\n\n for (size_t i=0;i<=iter;++i){\n\n\t \/\/ if (argc > 4){\n\t \/\/ \t A = read_field (F, argv[4], &n, &n);\n\t \/\/ }\n\t \/\/ else{\n\n v = FFLAS::fflas_new<Element>(n);\n \n Field::RandIter G(F);\n for(size_t j=0; j<(size_t)n; ++j)\n G.random(*(v+j));\n \n w = FFLAS::fflas_new<Element>(m);\n x = FFLAS::fflas_new<Element>(m);\n y = FFLAS::fflas_new<Element>(k);\n \n chrono.clear();\n if (i) chrono.start();\n if (p){\n\t FFLAS::CuttingStrategy meth;\n\t switch (p){\n\t\t case 1: meth = FFLAS::BLOCK_THREADS;break;\n\t\t case 2: meth = FFLAS::TWO_D;break;\n\t\t case 3: meth = FFLAS::TWO_D_ADAPT;break;\n\t\t case 4: meth = FFLAS::THREE_D_INPLACE;break;\n\t\t case 5: meth = FFLAS::THREE_D;break;\n\t\t case 6: meth = FFLAS::THREE_D_ADAPT;break;\n\t\t default: meth = FFLAS::BLOCK_THREADS;break;\n\t }\n\t FFLAS::MMHelper<Field,FFLAS::MMHelperAlgo::Winograd,\n\t\t\t typename FFLAS::FieldTraits<Field>::value,\n\t\t\t FFLAS::ParSeqHelper::Parallel> \n\t\t WH (F, nbw, FFLAS::ParSeqHelper::Parallel(t, meth));\n\t PAR_REGION{\n\t\t FFLAS::fgemm (F, FFLAS::FflasNoTrans, FFLAS::FflasNoTrans, m,n,k, F.one, A, k, B, n, F.zero, C,n,WH);\n\t }\n }else{\n\t FFLAS::MMHelper<Field,FFLAS::MMHelperAlgo::Winograd>\/\/,\n\t\t\t \/\/typename FFLAS::FieldTraits<Field>::value,\n\t\t\t \/\/FFLAS::ParSeqHelper::Parallel>\n\t WH (F, nbw);\n\n\t FFLAS::fgemm (F, FFLAS::FflasNoTrans, FFLAS::FflasNoTrans, m,n,k, F.one, A, k, B, n, F.zero, C,n,WH);\n }\n if (i) {chrono.stop(); time+=chrono.realtime();}\n \n freidvals.clear();\n freidvals.start();\n FFLAS::fgemv(F, FFLAS::FflasNoTrans,m,n, F.one, \n C, n, v, 1, F.zero, w, 1);\n FFLAS::fgemv(F, FFLAS::FflasNoTrans, k,n, F.one, \n B, n, v, 1, F.zero, y, 1);\n FFLAS::fgemv(F, FFLAS::FflasNoTrans, m,k, F.one, \n A, k, y, 1, F.zero, x, 1);\n bool pass=true;\n for(size_t j=0; j<(size_t)m; ++j) pass &= ( *(w+j) == *(x+j) );\n freidvals.stop();\n timev+=freidvals.usertime();\n if (!pass) \n\t std::cerr<<\"FAILED\"<<std::endl;\n\t \/\/std::cerr << *A << ' ' << *B << ' ' << *C << ' '<< pass << std::endl;\n }\n FFLAS::fflas_delete( A);\n FFLAS::fflas_delete( B);\n FFLAS::fflas_delete( C);\n \n std::cerr<<\"m: \"<<m<<\" k: \"<<k<<\" n: \"<<n<<\" q: \"<<q<<\" time: \"<<time\/(double)iter<<\" Gfops: \"<<(2.*double(m)\/1000.*double(n)\/1000.*double(k)\/1000.0\/*-m\/1000.*n\/1000.*\/)\/time*double(iter)<<std::endl; \n \n \/\/std::cerr<<\"Freidvals vtime: \"<<timev\/(double)iter<<std::endl;\n\n return 0;\n}\n\n<commit_msg>protect libkomp with KAAPI macro<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\/\/#include \"goto-def.h\"\n\n\/* Copyright (c) FFLAS-FFPACK\n* Written by Clément Pernet <clement.pernet@imag.fr>\n* ========LICENCE========\n* This file is part of the library FFLAS-FFPACK.\n*\n* FFLAS-FFPACK is free software: you can redistribute it and\/or modify\n* it under the terms of the GNU Lesser General Public\n* License as published by the Free Software Foundation; either\n* version 2.1 of the License, or (at your option) any later version.\n*\n* This library is distributed in the hope that it will be useful,\n* but WITHOUT ANY WARRANTY; without even the implied warranty of\n* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU\n* Lesser General Public License for more details.\n*\n* You should have received a copy of the GNU Lesser General Public\n* License along with this library; if not, write to the Free Software\n* Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA\n* ========LICENCE========\n*\/\n#define __FFLASFFPACK_USE_OPENMP4\n#include <iostream>\n\n#include \"fflas-ffpack\/config-blas.h\"\n#include \"fflas-ffpack\/fflas\/fflas.h\"\n#include \"fflas-ffpack\/field\/modular-balanced.h\"\n#include \"fflas-ffpack\/utils\/timer.h\"\n#include \"fflas-ffpack\/utils\/Matio.h\"\n#include \"fflas-ffpack\/utils\/args-parser.h\"\n#include \"tests\/test-utils.h\"\n#ifdef __FFLASFFPACK_USE_KAAPI\n#include \"libkomp.h\"\n#endif\nusing namespace std;\n\n#ifdef __FFLASFFPACK_USE_OPENMP4\n\n\ntemplate<class Element>\nvoid Initialize(Element * C, int BS, size_t m, size_t n)\n{\n\/\/#pragma omp parallel for collapse(2) schedule(runtime) \n\tBS=std::max(BS, __FFLASFFPACK_WINOTHRESHOLD_BAL );\n\tPAR_REGION{\n\tfor(size_t p=0; p<m; p+=BS) \/\/\/row\n\t\tfor(size_t pp=0; pp<n; pp+=BS) \/\/column\n\t\t{\n\t\t\tsize_t M=BS, MM=BS;\n\t\t\tif(!(p+BS<m))\n\t\t\t\tM=m-p;\n\t\t\tif(!(pp+BS<n))\n\t\t\t\tMM=n-pp;\n#pragma omp task \n\t\t\t{\n\t\t\tfor(size_t j=0; j<M; j++)\n\t\t\t\tfor(size_t jj=0; jj<MM; jj++)\n\t\t\t\t\tC[(p+j)*n+pp+jj]=0;\n\t\t\t}\n\t\t}\n\t#pragma omp taskwait\n\t}\n\t\/\/ printf(\"A = \\n\");\n\t\/\/ for (size_t i=0; i<m; i+=128)\n\t\/\/ {\n\t\/\/ \tfor (size_t j=0; j<n; j+=128)\n\t\/\/ \t{\n\t\/\/ \t\tint ld = komp_get_locality_domain_num_for( &C[i*n+j] );\n\t\/\/ \t\tprintf(\"%i \", ld);\n\t\/\/ \t}\n\t\/\/ \tprintf(\"\\n\");\n\t\/\/ }\n\n}\n#endif\nint main(int argc, char** argv) {\n\n\tsize_t iter = 3 ;\n\tint q = 131071 ;\n\tsize_t m = 2000 ;\n\tsize_t k = 2000 ;\n\tsize_t n = 2000 ;\n\tint nbw = -1 ;\n\tint p=0;\n\tint t=MAX_THREADS;\n\tint NBK = -1;\n\tArgument as[] = {\n\t\t{ 'q', \"-q Q\", \"Set the field characteristic (-1 for random).\", TYPE_INT , &q },\n\t\t{ 'm', \"-m M\", \"Set the row dimension of A.\", TYPE_INT , &m },\n\t\t{ 'k', \"-k K\", \"Set the col dimension of A.\", TYPE_INT , &k },\n\t\t{ 'n', \"-n N\", \"Set the col dimension of B.\", TYPE_INT , &n },\n\t\t{ 'w', \"-w N\", \"Set the number of winograd levels (-1 for random).\", TYPE_INT , &nbw },\n\t\t{ 'i', \"-i R\", \"Set number of repetitions.\", TYPE_INT , &iter },\n\t\t{ 'p', \"-p P\", \"0 for sequential, 1 for 2D iterative, 2 for 2D rec, 3 for 2D rec adaptive, 4 for 3D rc in-place, 5 for 3D rec, 6 for 3D rec adaptive.\", TYPE_INT , &p },\n\t\t{ 't', \"-t T\", \"number of virtual threads to drive the partition.\", TYPE_INT , &t },\n\t\t{ 'b', \"-b B\", \"number of numa blocks per dimension for the numa placement\", TYPE_INT , &NBK },\n\t\tEND_OF_ARGUMENTS\n\t};\n\n\tFFLAS::parseArguments(argc,argv,as);\n\n\tif (NBK==-1) NBK = t;\n typedef FFPACK::ModularBalanced<double> Field;\n\/\/ typedef FFPACK::ModularBalanced<float> Field;\n typedef Field::Element Element;\n\n Field F(q);\n\n FFLAS::Timer chrono, freidvals;\n double time=0.0, timev=0.0;\n\n Element * A, * B, * C;\n Element *v, *w, *y, *x;\n\n Field::RandIter G(F); \n A = FFLAS::fflas_new(F,m,k,Alignment::PAGESIZE);\n\/\/#pragma omp parallel for collapse(2) schedule(runtime) \n Initialize(A,m\/NBK,m,k);\n for (size_t i=0; i<(size_t)m; ++i)\n\t for (size_t j=0; j<(size_t)k; ++j)\n\t\t G.random (*(A+i*k+j));\n \n B = FFLAS::fflas_new(F,k,n,Alignment::PAGESIZE);\n\/\/#pragma omp parallel for collapse(2) schedule(runtime) \n Initialize(B,k\/NBK,k,n);\n for (size_t i=0; i<(size_t)k; ++i)\n\t for (size_t j=0; j<(size_t)n; ++j)\n\t\t G.random(*(B+i*n+j));\n\n C = FFLAS::fflas_new(F,m,n,Alignment::PAGESIZE);\n\/\/#pragma omp parallel for collapse(2) schedule(runtime) \n Initialize(C,m\/NBK,m,n);\n for (size_t i=0; i<(size_t)m; ++i)\n\t for (size_t j=0; j<(size_t)n; ++j)\n\t\t G.random (*(C+i*n+j));\n\n for (size_t i=0;i<=iter;++i){\n\n\t \/\/ if (argc > 4){\n\t \/\/ \t A = read_field (F, argv[4], &n, &n);\n\t \/\/ }\n\t \/\/ else{\n\n v = FFLAS::fflas_new<Element>(n);\n \n Field::RandIter G(F);\n for(size_t j=0; j<(size_t)n; ++j)\n G.random(*(v+j));\n \n w = FFLAS::fflas_new<Element>(m);\n x = FFLAS::fflas_new<Element>(m);\n y = FFLAS::fflas_new<Element>(k);\n \n chrono.clear();\n if (i) chrono.start();\n if (p){\n\t FFLAS::CuttingStrategy meth;\n\t switch (p){\n\t\t case 1: meth = FFLAS::BLOCK_THREADS;break;\n\t\t case 2: meth = FFLAS::TWO_D;break;\n\t\t case 3: meth = FFLAS::TWO_D_ADAPT;break;\n\t\t case 4: meth = FFLAS::THREE_D_INPLACE;break;\n\t\t case 5: meth = FFLAS::THREE_D;break;\n\t\t case 6: meth = FFLAS::THREE_D_ADAPT;break;\n\t\t default: meth = FFLAS::BLOCK_THREADS;break;\n\t }\n\t FFLAS::MMHelper<Field,FFLAS::MMHelperAlgo::Winograd,\n\t\t\t typename FFLAS::FieldTraits<Field>::value,\n\t\t\t FFLAS::ParSeqHelper::Parallel> \n\t\t WH (F, nbw, FFLAS::ParSeqHelper::Parallel(t, meth));\n\t PAR_REGION{\n\t\t FFLAS::fgemm (F, FFLAS::FflasNoTrans, FFLAS::FflasNoTrans, m,n,k, F.one, A, k, B, n, F.zero, C,n,WH);\n\t }\n }else{\n\t FFLAS::MMHelper<Field,FFLAS::MMHelperAlgo::Winograd>\/\/,\n\t\t\t \/\/typename FFLAS::FieldTraits<Field>::value,\n\t\t\t \/\/FFLAS::ParSeqHelper::Parallel>\n\t WH (F, nbw);\n\n\t FFLAS::fgemm (F, FFLAS::FflasNoTrans, FFLAS::FflasNoTrans, m,n,k, F.one, A, k, B, n, F.zero, C,n,WH);\n }\n if (i) {chrono.stop(); time+=chrono.realtime();}\n \n freidvals.clear();\n freidvals.start();\n FFLAS::fgemv(F, FFLAS::FflasNoTrans,m,n, F.one, \n C, n, v, 1, F.zero, w, 1);\n FFLAS::fgemv(F, FFLAS::FflasNoTrans, k,n, F.one, \n B, n, v, 1, F.zero, y, 1);\n FFLAS::fgemv(F, FFLAS::FflasNoTrans, m,k, F.one, \n A, k, y, 1, F.zero, x, 1);\n bool pass=true;\n for(size_t j=0; j<(size_t)m; ++j) pass &= ( *(w+j) == *(x+j) );\n freidvals.stop();\n timev+=freidvals.usertime();\n if (!pass) \n\t std::cerr<<\"FAILED\"<<std::endl;\n\t \/\/std::cerr << *A << ' ' << *B << ' ' << *C << ' '<< pass << std::endl;\n }\n FFLAS::fflas_delete( A);\n FFLAS::fflas_delete( B);\n FFLAS::fflas_delete( C);\n \n std::cerr<<\"m: \"<<m<<\" k: \"<<k<<\" n: \"<<n<<\" q: \"<<q<<\" time: \"<<time\/(double)iter<<\" Gfops: \"<<(2.*double(m)\/1000.*double(n)\/1000.*double(k)\/1000.0\/*-m\/1000.*n\/1000.*\/)\/time*double(iter)<<std::endl; \n \n \/\/std::cerr<<\"Freidvals vtime: \"<<timev\/(double)iter<<std::endl;\n\n return 0;\n}\n\n<|endoftext|>"} {"text":"<commit_before>#include <QtCore\/QFile>\n\n#include <QtTest\/QtTest>\n\n#include <QMimeDatabase>\n\n#include \"..\/..\/src\/qmimedatabase_p.h\"\n\nclass tst_QMimeType : public QObject\n{\n Q_OBJECT\n\npublic:\n tst_QMimeType();\n ~tst_QMimeType();\n\nprivate Q_SLOTS:\n void initTestCase();\n\n void findByName_data();\n void findByName();\n\n void findByData_data();\n void findByData();\n\n void findByFile_data();\n void findByFile();\n\nprivate:\n QMimeDatabase database;\n QMimeDatabaseBuilder databaseBuilder;\n};\n\ntst_QMimeType::tst_QMimeType() :\n database(),\n databaseBuilder()\n{\n}\n\ntst_QMimeType::~tst_QMimeType()\n{\n}\n\nvoid tst_QMimeType::initTestCase()\n{\n QString errorMessage;\n QVERIFY(databaseBuilder.addMimeTypes(SRCDIR \"..\/..\/freedesktop.org.xml\", &errorMessage));\n QVERIFY(errorMessage.isEmpty());\n}\n\nvoid tst_QMimeType::findByName_data()\n{\n QTest::addColumn<QString>(\"filePath\");\n QTest::addColumn<QString>(\"mimeType\");\n QTest::addColumn<QString>(\"xFail\");\n\n QString prefix = QLatin1String(SRCDIR \"testfiles\/\");\n\n QFile f(prefix + QLatin1String(\"list\"));\n QVERIFY(f.open(QIODevice::ReadOnly));\n\n QByteArray line(1024, Qt::Uninitialized);\n\n while (!f.atEnd()) {\n int len = f.readLine(line.data(), 1023);\n\n if (len <= 2 || line.at(0) == '#')\n continue;\n\n QString string = QString::fromLatin1(line.constData(), len - 1).trimmed();\n QStringList list = string.split(QLatin1Char(' '), QString::SkipEmptyParts);\n QVERIFY(list.size() >= 2);\n\n QString filePath = list.at(0);\n QString mimeType = list.at(1);\n QString xFail;\n if (list.size() == 3)\n xFail = list.at(2);\n\n QTest::newRow(filePath.toLatin1().constData()) << prefix + filePath << mimeType << xFail;\n }\n}\n\nvoid tst_QMimeType::findByName()\n{\n QFETCH(QString, filePath);\n QFETCH(QString, mimeType);\n QFETCH(QString, xFail);\n\n if (xFail.length() >= 1 && xFail.at(0) == QLatin1Char('x'))\n QEXPECT_FAIL(\"\", \"Expected to fail\", Continue);\n\n QCOMPARE(database.findByName(filePath).type(), mimeType);\n}\n\nvoid tst_QMimeType::findByData_data()\n{\n findByName_data();\n}\n\nvoid tst_QMimeType::findByData()\n{\n QFETCH(QString, filePath);\n QFETCH(QString, mimeType);\n QFETCH(QString, xFail);\n\n QFile f(filePath);\n QVERIFY(f.open(QIODevice::ReadOnly));\n QByteArray data = f.readAll();\n\n if (xFail.length() >= 2 && xFail.at(1) == QLatin1Char('x'))\n QEXPECT_FAIL(\"\", \"Expected to fail\", Continue);\n\n QCOMPARE(database.findByData(data).type(), mimeType);\n}\n\nvoid tst_QMimeType::findByFile_data()\n{\n findByName_data();\n}\n\nvoid tst_QMimeType::findByFile()\n{\n QFETCH(QString, filePath);\n QFETCH(QString, mimeType);\n QFETCH(QString, xFail);\n\n if (xFail.length() >= 3 && xFail.at(2) == QLatin1Char('x'))\n QEXPECT_FAIL(\"\", \"Expected to fail\", Continue);\n\n QCOMPARE(database.findByFile(QFileInfo(filePath)).type(), mimeType);\n}\n\nQTEST_APPLESS_MAIN(tst_QMimeType)\n\n#include \"tst_qmimetype.moc\"\n<commit_msg>Make test output more silent by not using QEXPECT_FAIL<commit_after>#include <QtCore\/QFile>\n\n#include <QtTest\/QtTest>\n\n#include <QMimeDatabase>\n\n#include \"..\/..\/src\/qmimedatabase_p.h\"\n\nclass tst_QMimeType : public QObject\n{\n Q_OBJECT\n\npublic:\n tst_QMimeType();\n ~tst_QMimeType();\n\nprivate Q_SLOTS:\n void initTestCase();\n\n void findByName_data();\n void findByName();\n\n void findByData_data();\n void findByData();\n\n void findByFile_data();\n void findByFile();\n\nprivate:\n QMimeDatabase database;\n QMimeDatabaseBuilder databaseBuilder;\n};\n\ntst_QMimeType::tst_QMimeType() :\n database(),\n databaseBuilder()\n{\n}\n\ntst_QMimeType::~tst_QMimeType()\n{\n}\n\nvoid tst_QMimeType::initTestCase()\n{\n QString errorMessage;\n QVERIFY(databaseBuilder.addMimeTypes(SRCDIR \"..\/..\/freedesktop.org.xml\", &errorMessage));\n QVERIFY(errorMessage.isEmpty());\n}\n\nvoid tst_QMimeType::findByName_data()\n{\n QTest::addColumn<QString>(\"filePath\");\n QTest::addColumn<QString>(\"mimeType\");\n QTest::addColumn<QString>(\"xFail\");\n\n QString prefix = QLatin1String(SRCDIR \"testfiles\/\");\n\n QFile f(prefix + QLatin1String(\"list\"));\n QVERIFY(f.open(QIODevice::ReadOnly));\n\n QByteArray line(1024, Qt::Uninitialized);\n\n while (!f.atEnd()) {\n int len = f.readLine(line.data(), 1023);\n\n if (len <= 2 || line.at(0) == '#')\n continue;\n\n QString string = QString::fromLatin1(line.constData(), len - 1).trimmed();\n QStringList list = string.split(QLatin1Char(' '), QString::SkipEmptyParts);\n QVERIFY(list.size() >= 2);\n\n QString filePath = list.at(0);\n QString mimeType = list.at(1);\n QString xFail;\n if (list.size() == 3)\n xFail = list.at(2);\n\n QTest::newRow(filePath.toLatin1().constData()) << prefix + filePath << mimeType << xFail;\n }\n}\n\nvoid tst_QMimeType::findByName()\n{\n QFETCH(QString, filePath);\n QFETCH(QString, mimeType);\n QFETCH(QString, xFail);\n\n const QString resultMimeType = database.findByName(filePath).type();\n if (xFail.length() >= 1 && xFail.at(0) == QLatin1Char('x'))\n \/\/ Expected to fail\n QVERIFY2(resultMimeType != mimeType, qPrintable(resultMimeType));\n else\n QCOMPARE(resultMimeType, mimeType);\n}\n\nvoid tst_QMimeType::findByData_data()\n{\n findByName_data();\n}\n\nvoid tst_QMimeType::findByData()\n{\n QFETCH(QString, filePath);\n QFETCH(QString, mimeType);\n QFETCH(QString, xFail);\n\n QFile f(filePath);\n QVERIFY(f.open(QIODevice::ReadOnly));\n QByteArray data = f.readAll();\n\n const QString resultMimeType = database.findByData(data).type();\n if (xFail.length() >= 2 && xFail.at(1) == QLatin1Char('x'))\n \/\/ Expected to fail\n QVERIFY2(resultMimeType != mimeType, qPrintable(resultMimeType));\n else\n QCOMPARE(resultMimeType, mimeType);\n}\n\nvoid tst_QMimeType::findByFile_data()\n{\n findByName_data();\n}\n\nvoid tst_QMimeType::findByFile()\n{\n QFETCH(QString, filePath);\n QFETCH(QString, mimeType);\n QFETCH(QString, xFail);\n\n const QString resultMimeType = database.findByFile(QFileInfo(filePath)).type();\n if (xFail.length() >= 3 && xFail.at(2) == QLatin1Char('x'))\n \/\/ Expected to fail\n QVERIFY2(resultMimeType != mimeType, qPrintable(resultMimeType));\n else\n QCOMPARE(resultMimeType, mimeType);\n}\n\nQTEST_APPLESS_MAIN(tst_QMimeType)\n\n#include \"tst_qmimetype.moc\"\n<|endoftext|>"} {"text":"<commit_before>#include \"sf_client.h\"\n#include <cpprest\/http_client.h>\n\n#define TRACE if (tracing) { \\\n cerr << \"\\n|trace|\" << __FILE__ << \":\" << __LINE__ << \"|\\n\"; }\n\nusing namespace web;\nusing namespace http;\nusing namespace std;\n\nsf_client::sf_client(std::string apikey)\n : sf_client(move(apikey), \"https:\/\/api.stockfighter.io\")\n{}\n\nsf_client::sf_client(string apikey, string host)\n : m_apikey(move(apikey)), m_client(make_unique<web::http::client::http_client>(host))\n{\n tracing = false;\n}\n\nsf_client::~sf_client() {}\n\noptional<unit> sf_client::api_heartbeat() {\n TRACE;\n optional<unit> ret;\n\n auto res = m_client->request(\"GET\", \"\/ob\/api\/heartbeat\").get();\n auto doc = res.extract_json().get();\n auto& obj = doc.as_object();\n ret.ok = obj[\"ok\"].as_bool() ? OK : ERROR;\n switch (ret.ok) {\n case OK: break;\n case ERROR:\n ret.err = obj[\"error\"].as_string();\n break;\n }\n\n TRACE;\n return ret;\n}\n\noptional<symbolslist_t> sf_client::venue_stocks(const std::string& venue) {\n TRACE;\n optional<symbolslist_t> ret;\n\n auto res = m_client->request(\"GET\", \"\/ob\/api\/venues\/\"+venue+\"\/stocks\").get();\n auto doc = res.extract_json().get();\n auto& obj = doc.as_object();\n ret.ok = obj[\"ok\"].as_bool() ? OK : ERROR;\n switch (ret.ok) {\n case ERROR:\n ret.err = obj[\"error\"].as_string();\n break;\n case OK: {\n auto& arr = obj[\"symbols\"].as_array();\n for (auto&& sym : arr) {\n auto& symobj = sym.as_object();\n ret.data.symbols.push_back(symboldef_t{\n\t symobj[\"symbol\"].as_string(),\n\t symobj[\"name\"].as_string()\n\t });\n }\n break;\n }\n }\n\n TRACE;\n return ret;\n}\n\nvoid parse_into(const json::array& arr, std::vector<request_t>& reqs) {\n for (auto&& req : arr) {\n auto& reqobj = req.as_object();\n reqs.push_back(request_t{\n\treqobj.at(\"price\").as_number().to_uint64(),\n\t reqobj.at(\"qty\").as_number().to_uint64()});\n }\n}\n\noptional<orderbook_t> sf_client::orderbook_for_venue(const std::string& venue, const std::string& stock) {\n TRACE;\n optional<orderbook_t> ret;\n \n auto res = m_client->request(\"GET\", \"\/ob\/api\/venues\/\"+venue+\"\/stocks\/\"+stock).get();\n auto doc = res.extract_json().get();\n\n auto& obj = doc.as_object();\n ret.ok = obj[\"ok\"].as_bool() ? OK : ERROR;\n switch (ret.ok) {\n case ERROR:\n ret.err = obj[\"error\"].as_string();\n break;\n case OK: {\n if (!obj[\"bids\"].is_null()) parse_into(obj[\"bids\"].as_array(), ret.data.bids);\n if (!obj[\"asks\"].is_null()) parse_into(obj[\"asks\"].as_array(), ret.data.asks);\n ret.data.timestamp = obj[\"ts\"].as_string();\n break;\n }\n }\n\n TRACE;\n return ret;\n}\n\njson::value order_to_json(const order_request_t& order) {\n std::vector<std::pair<std::string, json::value>> fields;\n fields.emplace_back(\"account\", json::value::string(order.account));\n fields.emplace_back(\"venue\", json::value::string(order.venue));\n fields.emplace_back(\"stock\", json::value::string(order.symbol));\n fields.emplace_back(\"price\", json::value::number(order.req.price));\n fields.emplace_back(\"qty\", json::value::number(order.req.qty));\n fields.emplace_back(\"direction\", json::value::string(order.direction == BUY ? \"buy\" : \"sell\"));\n fields.emplace_back(\"orderType\", json::value::string(stringify(order.type)));\n return json::value::object(move(fields));\n}\n\ntemplate<class F>\nvector<result_of_t<F(const json::value&)>> map(const json::value& v, F f) {\n using v_t = vector<result_of_t<F(const json::value&)>>;\n v_t ret;\n\n if (v.is_null())\n return ret;\n\n for (auto&& e : v.as_array())\n ret.push_back(f(e));\n \n return ret;\n}\n\n\/\/ This is a parser based on return type deduction.\n\/\/ I am not sure how I feel about this... but it does make for very elegant code.\nstruct parser {\n const json::value& val;\n\n parser at(size_t sz) const {\n return parser{val.at(sz)};\n }\n parser at(const std::string& key) const {\n return parser{val.at(key)};\n }\n\n explicit operator string() const {\n return val.as_string().c_str();\n }\n \n operator uint64_t() const {\n return val.as_number().to_uint64();\n }\n\n template<class T>\n operator vector<T>() const {\n vector<T> ret;\n if (val.is_null())\n return ret;\n for (auto&& e : val.as_array())\n ret.push_back(parser{e});\n\n return ret;\n }\n\n operator ok_t() const {\n return val.as_bool() ? OK : ERROR;\n }\n \n operator fill_t() const {\n fill_t ret;\n ret.req.price = at(\"price\");\n ret.req.qty = at(\"qty\");\n ret.timestamp = string(at(\"ts\"));\n return ret;\n }\n\n operator direction_t() const {\n return val.as_string() == \"buy\" ? BUY : SELL;\n }\n\n operator open_t() const {\n return val.as_bool() ? OPEN : CLOSED;\n }\n\n operator order_response_t() const {\n order_response_t ret;\n ret.id = at(\"id\");\n ret.status = *this;\n return ret;\n }\n \n operator order_status_t() const {\n order_status_t ret;\n ret.original_qty = at(\"originalQty\");\n ret.outstanding_qty = at(\"qty\");\n ret.filled_qty = at(\"totalFilled\");\n ret.direction = at(\"direction\");\n ret.open = at(\"open\");\n ret.timestamp = string(at(\"ts\"));\n\n \/\/ fills\n ret.fills = at(\"fills\");\n\n return ret;\n }\n\n template<class T>\n operator optional<T>() const {\n optional<T> ret;\n ret.ok = at(\"ok\");\n if (ret.ok == ERROR) {\n ret.err = string(at(\"error\"));\n return ret;\n }\n\n ret.data = *this;\n return ret;\n }\n};\n\noptional<order_response_t> sf_client::post_order(const order_request_t& order) {\n TRACE;\n optional<order_response_t> ret;\n auto uri = \"\/ob\/api\/venues\/\"+order.venue+\"\/stocks\/\"+order.symbol+\"\/orders\";\n\n http_request req(\"POST\");\n req.set_request_uri(uri);\n req.headers().add(\"X-Starfighter-Authorization\", m_apikey);\n req.set_body(order_to_json(order));\n\n auto res = m_client->request(req).get();\n auto doc = res.extract_json().get();\n\n TRACE;\n return parser{doc};\n}\n\noptional<order_response_t> sf_client::cancel_order(const std::string& venue,\n const std::string& symbol,\n uint64_t id) {\n TRACE;\n optional<order_response_t> ret;\n auto uri = \"\/ob\/api\/venues\/\"+venue+\"\/stocks\/\"+symbol+\"\/orders\/\"+to_string(id);\n\n cerr << \"uri:\" << uri << endl;\n \n http_request req(\"DELETE\");\n req.set_request_uri(uri);\n req.headers().add(\"X-Starfighter-Authorization\", m_apikey);\n\n auto res = m_client->request(req).get();\n auto doc = res.extract_json().get();\n\n TRACE;\n return parser{doc};\n}\n\nvector<string> parse_stringarr(const json::value& v) {\n vector<string> ret;\n for (auto&& e : v.as_array()) {\n ret.push_back(e.as_string());\n }\n return ret;\n}\n\noptional<gm_start_level_t> sf_client::start_level(const std::string& level) {\n TRACE;\n optional<gm_start_level_t> ret;\n\n auto uri = \"\/gm\/levels\/\" + level;\n\n http_request req(\"POST\");\n req.set_request_uri(uri);\n req.headers().add(\"X-Starfighter-Authorization\", m_apikey);\n\n auto res = m_client->request(req).get();\n auto doc = res.extract_json().get();\n\n auto& obj = doc.as_object();\n ret.ok = obj[\"ok\"].as_bool() ? OK : ERROR;\n\n switch (ret.ok) {\n case ERROR:\n ret.err = obj[\"error\"].as_string();\n break;\n case OK: {\n ret->account = obj[\"account\"].as_string();\n ret->instance = obj[\"instanceId\"].as_number().to_uint64();\n \/\/ TODO instructions\n ret->seconds_per_day = obj[\"secondsPerTradingDay\"].as_number().to_uint64();\n ret->tickers = parse_stringarr(obj[\"tickers\"]);\n ret->venues = parse_stringarr(obj[\"venues\"]);\n break;\n }\n }\n\n TRACE;\n return ret;\n}\n\noptional<gm_start_level_t> sf_client::restart_level(uint64_t id) {\n TRACE;\n optional<gm_start_level_t> ret;\n\n auto uri = \"\/gm\/instances\/\" + to_string(id) + \"\/restart\";\n\n http_request req(\"POST\");\n req.set_request_uri(uri);\n req.headers().add(\"X-Starfighter-Authorization\", m_apikey);\n\n auto res = m_client->request(req).get();\n auto doc = res.extract_json().get();\n\n auto& obj = doc.as_object();\n ret.ok = obj[\"ok\"].as_bool() ? OK : ERROR;\n\n switch (ret.ok) {\n case ERROR:\n ret.err = obj[\"error\"].as_string();\n break;\n case OK: {\n ret->account = obj[\"account\"].as_string();\n ret->instance = obj[\"instanceId\"].as_number().to_uint64();\n \/\/ TODO instructions\n ret->seconds_per_day = obj[\"secondsPerTradingDay\"].as_number().to_uint64();\n ret->tickers = parse_stringarr(obj[\"tickers\"]);\n ret->venues = parse_stringarr(obj[\"venues\"]);\n break;\n }\n }\n\n TRACE;\n return ret;\n}\n<commit_msg>Refactoring more into rval parser<commit_after>#include \"sf_client.h\"\n#include <cpprest\/http_client.h>\n\n#define TRACE if (tracing) { \\\n cerr << \"\\n|trace|\" << __FILE__ << \":\" << __LINE__ << \"|\\n\"; }\n\nusing namespace web;\nusing namespace http;\nusing namespace std;\n\nsf_client::sf_client(std::string apikey)\n : sf_client(move(apikey), \"https:\/\/api.stockfighter.io\")\n{}\n\nsf_client::sf_client(string apikey, string host)\n : m_apikey(move(apikey)), m_client(make_unique<web::http::client::http_client>(host))\n{\n tracing = false;\n}\n\nsf_client::~sf_client() {}\n\n\/\/ This is a parser based on return type deduction.\n\/\/ I am not sure how I feel about this... but it does make for very elegant code.\nstruct parser {\n const json::value& val;\n\n parser at(size_t sz) const {\n return parser{val.at(sz)};\n }\n parser at(const std::string& key) const {\n return parser{val.at(key)};\n }\n\n explicit operator string() const {\n return val.as_string().c_str();\n }\n\n operator unit() const { return unit(); }\n \n operator uint64_t() const {\n return val.as_number().to_uint64();\n }\n\n operator vector<string>() const {\n vector<string> ret;\n if (val.is_null())\n return ret;\n for (auto&& e : val.as_array())\n ret.push_back(string(parser{e}));\n\n return ret;\n }\n \n template<class T>\n operator vector<T>() const {\n vector<T> ret;\n if (val.is_null())\n return ret;\n for (auto&& e : val.as_array())\n ret.push_back(parser{e});\n\n return ret;\n }\n\n operator ok_t() const {\n return val.as_bool() ? OK : ERROR;\n }\n \n operator fill_t() const {\n fill_t ret;\n ret.req.price = at(\"price\");\n ret.req.qty = at(\"qty\");\n ret.timestamp = string(at(\"ts\"));\n return ret;\n }\n\n operator direction_t() const {\n return val.as_string() == \"buy\" ? BUY : SELL;\n }\n\n operator open_t() const {\n return val.as_bool() ? OPEN : CLOSED;\n }\n\n operator order_response_t() const {\n order_response_t ret;\n ret.id = at(\"id\");\n ret.status = *this;\n return ret;\n }\n \n operator order_status_t() const {\n order_status_t ret;\n ret.original_qty = at(\"originalQty\");\n ret.outstanding_qty = at(\"qty\");\n ret.filled_qty = at(\"totalFilled\");\n ret.direction = at(\"direction\");\n ret.open = at(\"open\");\n ret.timestamp = string(at(\"ts\"));\n\n \/\/ fills\n ret.fills = at(\"fills\");\n\n return ret;\n }\n\n template<class T>\n operator optional<T>() const {\n optional<T> ret;\n ret.ok = at(\"ok\");\n if (ret.ok == ERROR) {\n ret.err = string(at(\"error\"));\n return ret;\n }\n\n ret.data = *this;\n return ret;\n }\n\n operator symboldef_t() const {\n symboldef_t ret;\n ret.symbol = string(at(\"symbol\"));\n ret.name = string(at(\"name\"));\n return ret;\n }\n\n operator symbolslist_t() const {\n symbolslist_t ret;\n ret.symbols = at(\"symbols\");\n return ret;\n }\n \n operator gm_start_level_t() const {\n gm_start_level_t ret;\n ret.account = string(at(\"account\"));\n ret.instance = at(\"instanceId\");\n \/\/ TODO instructions\n ret.seconds_per_day = at(\"secondsPerTradingDay\");\n ret.tickers = at(\"tickers\");\n ret.venues = at(\"venues\");\n return ret;\n }\n};\n\noptional<unit> sf_client::api_heartbeat() {\n TRACE;\n optional<unit> ret;\n\n auto res = m_client->request(\"GET\", \"\/ob\/api\/heartbeat\").get();\n auto doc = res.extract_json().get();\n TRACE;\n return parser{doc};\n}\n\noptional<symbolslist_t> sf_client::venue_stocks(const std::string& venue) {\n TRACE;\n optional<symbolslist_t> ret;\n\n auto res = m_client->request(\"GET\", \"\/ob\/api\/venues\/\"+venue+\"\/stocks\").get();\n auto doc = res.extract_json().get();\n\n TRACE;\n return parser{doc};\n}\n\nvoid parse_into(const json::array& arr, std::vector<request_t>& reqs) {\n for (auto&& req : arr) {\n auto& reqobj = req.as_object();\n reqs.push_back(request_t{\n\treqobj.at(\"price\").as_number().to_uint64(),\n\t reqobj.at(\"qty\").as_number().to_uint64()});\n }\n}\n\noptional<orderbook_t> sf_client::orderbook_for_venue(const std::string& venue, const std::string& stock) {\n TRACE;\n optional<orderbook_t> ret;\n \n auto res = m_client->request(\"GET\", \"\/ob\/api\/venues\/\"+venue+\"\/stocks\/\"+stock).get();\n auto doc = res.extract_json().get();\n\n auto& obj = doc.as_object();\n ret.ok = obj[\"ok\"].as_bool() ? OK : ERROR;\n switch (ret.ok) {\n case ERROR:\n ret.err = obj[\"error\"].as_string();\n break;\n case OK: {\n if (!obj[\"bids\"].is_null()) parse_into(obj[\"bids\"].as_array(), ret.data.bids);\n if (!obj[\"asks\"].is_null()) parse_into(obj[\"asks\"].as_array(), ret.data.asks);\n ret.data.timestamp = obj[\"ts\"].as_string();\n break;\n }\n }\n\n TRACE;\n return ret;\n}\n\njson::value order_to_json(const order_request_t& order) {\n std::vector<std::pair<std::string, json::value>> fields;\n fields.emplace_back(\"account\", json::value::string(order.account));\n fields.emplace_back(\"venue\", json::value::string(order.venue));\n fields.emplace_back(\"stock\", json::value::string(order.symbol));\n fields.emplace_back(\"price\", json::value::number(order.req.price));\n fields.emplace_back(\"qty\", json::value::number(order.req.qty));\n fields.emplace_back(\"direction\", json::value::string(order.direction == BUY ? \"buy\" : \"sell\"));\n fields.emplace_back(\"orderType\", json::value::string(stringify(order.type)));\n return json::value::object(move(fields));\n}\n\ntemplate<class F>\nvector<result_of_t<F(const json::value&)>> map(const json::value& v, F f) {\n using v_t = vector<result_of_t<F(const json::value&)>>;\n v_t ret;\n\n if (v.is_null())\n return ret;\n\n for (auto&& e : v.as_array())\n ret.push_back(f(e));\n \n return ret;\n}\n\noptional<order_response_t> sf_client::post_order(const order_request_t& order) {\n TRACE;\n optional<order_response_t> ret;\n auto uri = \"\/ob\/api\/venues\/\"+order.venue+\"\/stocks\/\"+order.symbol+\"\/orders\";\n\n http_request req(\"POST\");\n req.set_request_uri(uri);\n req.headers().add(\"X-Starfighter-Authorization\", m_apikey);\n req.set_body(order_to_json(order));\n\n auto res = m_client->request(req).get();\n auto doc = res.extract_json().get();\n\n TRACE;\n return parser{doc};\n}\n\noptional<order_response_t> sf_client::cancel_order(const std::string& venue,\n const std::string& symbol,\n uint64_t id) {\n TRACE;\n optional<order_response_t> ret;\n auto uri = \"\/ob\/api\/venues\/\"+venue+\"\/stocks\/\"+symbol+\"\/orders\/\"+to_string(id);\n\n cerr << \"uri:\" << uri << endl;\n \n http_request req(\"DELETE\");\n req.set_request_uri(uri);\n req.headers().add(\"X-Starfighter-Authorization\", m_apikey);\n\n auto res = m_client->request(req).get();\n auto doc = res.extract_json().get();\n\n TRACE;\n return parser{doc};\n}\n\noptional<gm_start_level_t> sf_client::start_level(const std::string& level) {\n TRACE;\n optional<gm_start_level_t> ret;\n\n auto uri = \"\/gm\/levels\/\" + level;\n\n http_request req(\"POST\");\n req.set_request_uri(uri);\n req.headers().add(\"X-Starfighter-Authorization\", m_apikey);\n\n auto res = m_client->request(req).get();\n auto doc = res.extract_json().get();\n\n TRACE;\n return parser{doc};\n}\n\noptional<gm_start_level_t> sf_client::restart_level(uint64_t id) {\n TRACE;\n optional<gm_start_level_t> ret;\n\n auto uri = \"\/gm\/instances\/\" + to_string(id) + \"\/restart\";\n\n http_request req(\"POST\");\n req.set_request_uri(uri);\n req.headers().add(\"X-Starfighter-Authorization\", m_apikey);\n\n auto res = m_client->request(req).get();\n auto doc = res.extract_json().get();\n\n TRACE;\n return parser{doc};\n}\n<|endoftext|>"} {"text":"<commit_before>\/*\n @ Kingsley Chen\n*\/\n\n#include \"kbase\/files\/file_path.h\"\n\n#include <cassert>\n#include <cstdlib>\n\n#include <algorithm>\n#include <functional>\n#include <stdexcept>\n\n#include \"kbase\/strings\/string_util.h\"\n\nnamespace kbase {\n\ntypedef FilePath::PathChar PathChar;\ntypedef FilePath::PathString PathString;\n\nconst FilePath::PathChar FilePath::kSeparators[] = L\"\\\\\/\";\nconst size_t FilePath::kSeparatorsLength = _countof(FilePath::kSeparators);\nconst FilePath::PathChar FilePath::kCurrentDir[] = L\".\";\nconst FilePath::PathChar FilePath::kParentDir[] = L\"..\";\nconst FilePath::PathChar FilePath::kExtensionSeparator = L'.';\nconst FilePath::PathChar FilePath::kStringTerminator = L'\\0';\n\nnamespace {\n\n\/\/ If the |path| contains a drive letter specification, returns the position of the\n\/\/ last character of the specification; otherwise, return npos.\nPathString::size_type FindDriveLetter(const PathString& path)\n{\n if (path.length() >= 2 && path[1] == L':' &&\n ((path[0] >= L'A' && path[0] <= L'Z') ||\n (path[0] >= L'a' && path[0] <= L'z'))) {\n return 1;\n }\n\n return PathString::npos;\n}\n\ninline bool EqualPathString(const PathString& x, const PathString& y)\n{\n return !kbase::SysStringCompareCaseInsensitive(x, y);\n}\n\n\/\/ This function adheres the equality stipulated for two FilePath objects:\n\/\/ They can differ in the case, which is permitted by Windows.\nbool EqualDriveLetterCaseInsensitive(const PathString& x, const PathString& y)\n{\n auto letter_pos_x = FindDriveLetter(x);\n auto letter_pos_y = FindDriveLetter(y);\n\n \/\/ if only one contains a drive letter, the comparison result is same as\n \/\/ x == y\n if (letter_pos_x == PathString::npos || letter_pos_y == PathString::npos) {\n return EqualPathString(x, y);\n }\n\n PathString&& letter_x = x.substr(0, letter_pos_x + 1);\n PathString&& letter_y = y.substr(0, letter_pos_y + 1);\n if (!EqualPathString(letter_x, letter_y)) {\n return false;\n }\n\n PathString&& rest_x = x.substr(letter_pos_x + 1);\n PathString&& rest_y = y.substr(letter_pos_y + 1);\n return EqualPathString(rest_x, rest_y);\n}\n\n} \/\/ namespace\n\nFilePath::FilePath()\n{}\n\nFilePath::FilePath(const FilePath& other)\n : path_(other.path_)\n{}\n\nFilePath::FilePath(const PathString& path)\n : path_(path)\n{\n \/\/TODO: what if path has someting after \\0 ?\n}\n\nFilePath& FilePath::operator=(const FilePath& other)\n{\n path_ = other.path_;\n return *this;\n}\n\nFilePath::~FilePath()\n{}\n\nbool operator==(const FilePath& lhs, const FilePath& rhs)\n{\n return EqualDriveLetterCaseInsensitive(lhs.value(), rhs.value()); \n}\n\nbool operator!=(const FilePath& lhs, const FilePath& rhs)\n{\n return !EqualDriveLetterCaseInsensitive(lhs.value(), rhs.value());\n}\n\nbool operator<(const FilePath& lhs, const FilePath& rhs)\n{\n return (kbase::SysStringCompareCaseInsensitive(lhs.value(), rhs.value()) < 0);\n}\n\n\/\/ static\nbool FilePath::IsSeparator(PathChar ch)\n{\n using std::placeholders::_1;\n using std::equal_to;\n\n return std::any_of(std::begin(kSeparators), std::end(kSeparators),\n std::bind(equal_to<PathChar>(), ch, _1));\n}\n\nvoid FilePath::StripTrailingSeparatorsInternal()\n{\n \/\/ start always points to the position one-offset past the leading separator\n PathString::size_type start = FindDriveLetter(path_) + 2;\n\n PathString::size_type last_stripped = PathString::npos;\n PathString::size_type pos = path_.length();\n for (; pos > start && IsSeparator(path_[pos-1]); --pos) {\n if (pos != start + 1 ||\n !IsSeparator(path_[start-1]) || \n last_stripped != PathString::npos) {\n last_stripped = pos;\n } else {\n break;\n }\n }\n\n path_.resize(pos);\n}\n\nFilePath FilePath::StripTrailingSeparators() const\n{\n FilePath new_path(path_);\n new_path.StripTrailingSeparatorsInternal();\n\n return new_path;\n}\n\nFilePath FilePath::DirName() const\n{\n FilePath new_path(path_);\n new_path.StripTrailingSeparatorsInternal();\n\n auto letter = FindDriveLetter(new_path.path_);\n auto last_separator = new_path.path_.find_last_of(kSeparators, PathString::npos,\n kSeparatorsLength - 1);\n\n \/\/ there might be a drive letter in the path\n if (last_separator == PathString::npos) {\n \/\/ in current dir\n new_path.path_.resize(letter + 1);\n } else if (last_separator == letter + 1) {\n \/\/ in root dir\n new_path.path_.resize(letter + 2);\n } else if (last_separator == letter + 2 &&\n IsSeparator(new_path.path_[letter+1])) {\n \/\/ preserves the leading double-separator\n new_path.path_.resize(letter + 3);\n } else {\n new_path.path_.resize(last_separator);\n }\n\n new_path.StripTrailingSeparatorsInternal();\n if (new_path.path_.empty()) {\n new_path.path_ = kCurrentDir;\n }\n\n return new_path;\n}\n\nFilePath FilePath::BaseName() const\n{\n FilePath new_path(path_);\n new_path.StripTrailingSeparatorsInternal();\n\n auto letter = FindDriveLetter(new_path.path_);\n if (letter != PathString::npos) {\n new_path.path_.erase(0, letter + 1);\n }\n\n auto last_separator = new_path.path_.find_last_of(kSeparators, PathString::npos,\n kSeparatorsLength - 1);\n if (last_separator != PathString::npos &&\n last_separator < new_path.path_.length() - 1) {\n new_path.path_.erase(0, last_separator + 1);\n }\n\n return new_path;\n}\n\nvoid FilePath::GetComponents(std::vector<PathString>* components) const\n{\n assert(components);\n if (!components) {\n throw std::invalid_argument(\"components cannot be NULL!\");\n }\n\n components->clear();\n\n if (path_.empty()) {\n return;\n }\n\n std::vector<PathString> parts;\n FilePath current(path_);\n FilePath base;\n\n auto AreAllSeparators = [](const PathString& path) -> bool {\n return std::all_of(path.cbegin(), path.cend(), FilePath::IsSeparator);\n };\n\n \/\/ main body\n while (current != current.DirName()) {\n base = current.BaseName();\n if (!AreAllSeparators(base.value())) {\n parts.push_back(base.value()); \n }\n current = current.DirName();\n }\n\n \/\/ root\n base = current.BaseName();\n if (!base.empty() && base.value() != kCurrentDir) {\n parts.push_back(base.value());\n }\n\n \/\/ drive letter\n auto letter = FindDriveLetter(current.value());\n if (letter != PathString::npos) {\n parts.push_back(current.value().substr(0, letter + 1));\n }\n\n std::copy(parts.crbegin(), parts.crend(), std::back_inserter(*components));\n}\n\nvoid FilePath::Append(const PathString& components)\n{\n const PathString* need_appended = &components;\n PathString without_null;\n\n PathString::size_type null_pos = need_appended->find(kStringTerminator);\n if (null_pos != PathString::npos) {\n without_null = components.substr(0, null_pos);\n need_appended = &without_null;\n }\n\n \/\/TODO: assert(!IsPathAbsolute(*need_appended));\n\n \/\/ If appends to the current dir, just set the path as the components.\n if (path_ == kCurrentDir) {\n path_ = *need_appended;\n return;\n }\n\n StripTrailingSeparatorsInternal();\n\n \/\/ If the path is empty, that indicates current directory.\n \/\/ If the path component is empty, that indicates nothing to append.\n if (!need_appended->empty() && !path_.empty()) {\n \/\/ Don't append separator, if there is already one.\n if (!IsSeparator(path_[path_.length()-1])) {\n \/\/ Don't append separator, if the path is a drive letter,\n \/\/ which is a valid relative path.\n if (FindDriveLetter(path_) + 1 != path_.length()) {\n path_.append(1, kSeparators[0]);\n }\n }\n }\n\n path_.append(*need_appended);\n}\n\nvoid FilePath::Append(const FilePath& components)\n{\n Append(components.value());\n}\n\nbool FilePath::AppendRelativePath(const FilePath& child, FilePath* path) const\n{\n std::vector<PathString> current_components;\n std::vector<PathString> child_components;\n GetComponents(¤t_components);\n child.GetComponents(&child_components);\n\n if (current_components.empty() || \n current_components.size() >= child_components.size()) {\n return false;\n }\n\n auto current_iter = current_components.cbegin();\n auto child_iter = child_components.cbegin();\n for (; current_iter != current_components.cend(); ++current_iter, ++child_iter) {\n if (!EqualPathString(*current_iter, *child_iter)) {\n return false;\n }\n }\n\n if (path) {\n for (; child_iter != child_components.cend(); ++child_iter) {\n path->Append(*child_iter);\n }\n }\n\n return true;\n}\n\n\n} \/\/ namespace kbase<commit_msg>file_path: 1.+ function IsParent 2.* checks null-terminator existence when constructs from a raw string<commit_after>\/*\n @ Kingsley Chen\n*\/\n\n#include \"kbase\/files\/file_path.h\"\n\n#include <cassert>\n#include <cstdlib>\n\n#include <algorithm>\n#include <functional>\n#include <stdexcept>\n\n#include \"kbase\/strings\/string_util.h\"\n\nnamespace kbase {\n\ntypedef FilePath::PathChar PathChar;\ntypedef FilePath::PathString PathString;\n\nconst FilePath::PathChar FilePath::kSeparators[] = L\"\\\\\/\";\nconst size_t FilePath::kSeparatorsLength = _countof(FilePath::kSeparators);\nconst FilePath::PathChar FilePath::kCurrentDir[] = L\".\";\nconst FilePath::PathChar FilePath::kParentDir[] = L\"..\";\nconst FilePath::PathChar FilePath::kExtensionSeparator = L'.';\nconst FilePath::PathChar FilePath::kStringTerminator = L'\\0';\n\nnamespace {\n\n\/\/ If the |path| contains a drive letter specification, returns the position of the\n\/\/ last character of the specification; otherwise, return npos.\nPathString::size_type FindDriveLetter(const PathString& path)\n{\n if (path.length() >= 2 && path[1] == L':' &&\n ((path[0] >= L'A' && path[0] <= L'Z') ||\n (path[0] >= L'a' && path[0] <= L'z'))) {\n return 1;\n }\n\n return PathString::npos;\n}\n\ninline bool EqualPathString(const PathString& x, const PathString& y)\n{\n return !kbase::SysStringCompareCaseInsensitive(x, y);\n}\n\n\/\/ This function adheres the equality stipulated for two FilePath objects:\n\/\/ They can differ in the case, which is permitted by Windows.\nbool EqualDriveLetterCaseInsensitive(const PathString& x, const PathString& y)\n{\n auto letter_pos_x = FindDriveLetter(x);\n auto letter_pos_y = FindDriveLetter(y);\n\n \/\/ if only one contains a drive letter, the comparison result is same as\n \/\/ x == y\n if (letter_pos_x == PathString::npos || letter_pos_y == PathString::npos) {\n return EqualPathString(x, y);\n }\n\n PathString&& letter_x = x.substr(0, letter_pos_x + 1);\n PathString&& letter_y = y.substr(0, letter_pos_y + 1);\n if (!EqualPathString(letter_x, letter_y)) {\n return false;\n }\n\n PathString&& rest_x = x.substr(letter_pos_x + 1);\n PathString&& rest_y = y.substr(letter_pos_y + 1);\n return EqualPathString(rest_x, rest_y);\n}\n\n} \/\/ namespace\n\nFilePath::FilePath()\n{}\n\nFilePath::FilePath(const FilePath& other)\n : path_(other.path_)\n{}\n\nFilePath::FilePath(const PathString& path)\n : path_(path)\n{\n \/\/ The null-terminator '\\0' indicates the end of a path.\n PathString::size_type null_pos = path_.find(kStringTerminator);\n if (null_pos != PathString::npos) {\n path_ = path_.substr(0, null_pos);\n }\n}\n\nFilePath& FilePath::operator=(const FilePath& other)\n{\n path_ = other.path_;\n return *this;\n}\n\nFilePath::~FilePath()\n{}\n\nbool operator==(const FilePath& lhs, const FilePath& rhs)\n{\n return EqualDriveLetterCaseInsensitive(lhs.value(), rhs.value()); \n}\n\nbool operator!=(const FilePath& lhs, const FilePath& rhs)\n{\n return !EqualDriveLetterCaseInsensitive(lhs.value(), rhs.value());\n}\n\nbool operator<(const FilePath& lhs, const FilePath& rhs)\n{\n return (kbase::SysStringCompareCaseInsensitive(lhs.value(), rhs.value()) < 0);\n}\n\n\/\/ static\nbool FilePath::IsSeparator(PathChar ch)\n{\n using std::placeholders::_1;\n using std::equal_to;\n\n return std::any_of(std::begin(kSeparators), std::end(kSeparators),\n std::bind(equal_to<PathChar>(), ch, _1));\n}\n\nvoid FilePath::StripTrailingSeparatorsInternal()\n{\n \/\/ start always points to the position one-offset past the leading separator\n PathString::size_type start = FindDriveLetter(path_) + 2;\n\n PathString::size_type last_stripped = PathString::npos;\n PathString::size_type pos = path_.length();\n for (; pos > start && IsSeparator(path_[pos-1]); --pos) {\n if (pos != start + 1 ||\n !IsSeparator(path_[start-1]) || \n last_stripped != PathString::npos) {\n last_stripped = pos;\n } else {\n break;\n }\n }\n\n path_.resize(pos);\n}\n\nFilePath FilePath::StripTrailingSeparators() const\n{\n FilePath new_path(path_);\n new_path.StripTrailingSeparatorsInternal();\n\n return new_path;\n}\n\nFilePath FilePath::DirName() const\n{\n FilePath new_path(path_);\n new_path.StripTrailingSeparatorsInternal();\n\n auto letter = FindDriveLetter(new_path.path_);\n auto last_separator = new_path.path_.find_last_of(kSeparators, PathString::npos,\n kSeparatorsLength - 1);\n\n \/\/ there might be a drive letter in the path\n if (last_separator == PathString::npos) {\n \/\/ in current dir\n new_path.path_.resize(letter + 1);\n } else if (last_separator == letter + 1) {\n \/\/ in root dir\n new_path.path_.resize(letter + 2);\n } else if (last_separator == letter + 2 &&\n IsSeparator(new_path.path_[letter+1])) {\n \/\/ preserves the leading double-separator\n new_path.path_.resize(letter + 3);\n } else {\n new_path.path_.resize(last_separator);\n }\n\n new_path.StripTrailingSeparatorsInternal();\n if (new_path.path_.empty()) {\n new_path.path_ = kCurrentDir;\n }\n\n return new_path;\n}\n\nFilePath FilePath::BaseName() const\n{\n FilePath new_path(path_);\n new_path.StripTrailingSeparatorsInternal();\n\n auto letter = FindDriveLetter(new_path.path_);\n if (letter != PathString::npos) {\n new_path.path_.erase(0, letter + 1);\n }\n\n auto last_separator = new_path.path_.find_last_of(kSeparators, PathString::npos,\n kSeparatorsLength - 1);\n if (last_separator != PathString::npos &&\n last_separator < new_path.path_.length() - 1) {\n new_path.path_.erase(0, last_separator + 1);\n }\n\n return new_path;\n}\n\nvoid FilePath::GetComponents(std::vector<PathString>* components) const\n{\n assert(components);\n if (!components) {\n throw std::invalid_argument(\"components cannot be NULL!\");\n }\n\n components->clear();\n\n if (path_.empty()) {\n return;\n }\n\n std::vector<PathString> parts;\n FilePath current(path_);\n FilePath base;\n\n auto AreAllSeparators = [](const PathString& path) -> bool {\n return std::all_of(path.cbegin(), path.cend(), FilePath::IsSeparator);\n };\n\n \/\/ main body\n while (current != current.DirName()) {\n base = current.BaseName();\n if (!AreAllSeparators(base.value())) {\n parts.push_back(base.value()); \n }\n current = current.DirName();\n }\n\n \/\/ root\n base = current.BaseName();\n if (!base.empty() && base.value() != kCurrentDir) {\n parts.push_back(base.value());\n }\n\n \/\/ drive letter\n auto letter = FindDriveLetter(current.value());\n if (letter != PathString::npos) {\n parts.push_back(current.value().substr(0, letter + 1));\n }\n\n std::copy(parts.crbegin(), parts.crend(), std::back_inserter(*components));\n}\n\nvoid FilePath::Append(const PathString& components)\n{\n const PathString* need_appended = &components;\n PathString without_null;\n\n PathString::size_type null_pos = need_appended->find(kStringTerminator);\n if (null_pos != PathString::npos) {\n without_null = components.substr(0, null_pos);\n need_appended = &without_null;\n }\n\n \/\/TODO: assert(!IsPathAbsolute(*need_appended));\n\n \/\/ If appends to the current dir, just set the path as the components.\n if (path_ == kCurrentDir) {\n path_ = *need_appended;\n return;\n }\n\n StripTrailingSeparatorsInternal();\n\n \/\/ If the path is empty, that indicates current directory.\n \/\/ If the path component is empty, that indicates nothing to append.\n if (!need_appended->empty() && !path_.empty()) {\n \/\/ Don't append separator, if there is already one.\n if (!IsSeparator(path_[path_.length()-1])) {\n \/\/ Don't append separator, if the path is a drive letter,\n \/\/ which is a valid relative path.\n if (FindDriveLetter(path_) + 1 != path_.length()) {\n path_.append(1, kSeparators[0]);\n }\n }\n }\n\n path_.append(*need_appended);\n}\n\nvoid FilePath::Append(const FilePath& components)\n{\n Append(components.value());\n}\n\nbool FilePath::AppendRelativePath(const FilePath& child, FilePath* path) const\n{\n std::vector<PathString> current_components;\n std::vector<PathString> child_components;\n GetComponents(¤t_components);\n child.GetComponents(&child_components);\n\n if (current_components.empty() || \n current_components.size() >= child_components.size()) {\n return false;\n }\n\n auto current_iter = current_components.cbegin();\n auto child_iter = child_components.cbegin();\n for (; current_iter != current_components.cend(); ++current_iter, ++child_iter) {\n if (!EqualPathString(*current_iter, *child_iter)) {\n return false;\n }\n }\n\n if (path) {\n for (; child_iter != child_components.cend(); ++child_iter) {\n path->Append(*child_iter);\n }\n }\n\n return true;\n}\n\nbool FilePath::IsParent(const FilePath& child) const\n{\n return AppendRelativePath(child, nullptr);\n}\n\n} \/\/ namespace kbase<|endoftext|>"} {"text":"<commit_before>\/** \n * @file h5_pool.cpp\n * @brief implementation of #h5_pool_iface\n * @author Oleg Borschuk\n * @version 1.0\n * @date 2011-03-05\n*\/\n#include <hdf5.h>\n#include <stdio.h>\n#include <iomanip>\n\n#include \"h5_pool.h\"\n#include \"h5_helper.h\"\n\nusing namespace std;\nusing namespace boost::python;\n\n\nnamespace blue_sky\n{\n h5_pool::h5_pool (bs_type_ctor_param) \n : h5_pool_iface ()\n {\n init_all ();\n mute_flag = 0;\n \n }\n h5_pool::h5_pool (const h5_pool & \/*src*\/) : bs_refcounter ()\n {\n init_all ();\n mute_flag = 0;\n }\n\n herr_t \n h5_pool::it_group (hid_t g_id, const char *name, const H5L_info_t * \/*info*\/, void * m)\n {\n hsize_t dims_[10];\n int n_dims;\n hid_t dset;\n hid_t dspace;\n hid_t dtype;\n \n dset = H5Dopen (g_id, name);\n if (dset < 0)\n {\n \/\/ TODO: report error\n throw;\n }\n dspace = H5Dget_space (dset);\n dtype = H5Dget_type (dset);\n n_dims = H5Sget_simple_extent_dims (dspace, dims_, NULL);\n ((h5_pool *)m)->add_node (std::string (name), dset, dspace, dtype, n_dims, dims_);\n return 0; \n }\n\n template <class T> h5_pool::map_t::iterator \n h5_pool::add_node (const std::string &name, const hid_t dset, const hid_t dspace, \n const hid_t dtype, const int n_dims, const T *dims)\n {\n pair_t p;\n \/\/printf (\"Add node\");\n\n p.first = name;\n p.second.dset = dset;\n p.second.dspace = dspace;\n p.second.dtype = dtype;\n p.second.n_dims = n_dims;\n for (int i = 0; i < n_dims; ++i)\n {\n p.second.py_dims[i] = (npy_intp)dims[i];\n p.second.h5_dims[i] = (hsize_t)dims[i];\n }\n return h5_map.insert (p).first;\n }\n\n void \n h5_pool::fill_map ()\n {\n clear_map ();\n if (group_id <= 0)\n {\n \/\/ TODO: report error\n throw;\n }\n H5Literate (group_id, H5_INDEX_NAME, H5_ITER_NATIVE, NULL, &(h5_pool::it_group), this); \n\n }\n\n void \n h5_pool::close_node (h5_pair &p)\n {\n H5Dclose (p.dset);\n H5Sclose (p.dspace);\n H5Tclose (p.dtype);\n }\n\n void \n h5_pool::clear_map ()\n {\n map_t::iterator i, e;\n e = h5_map.end ();\n for (i = h5_map.begin (); i != e; ++i)\n {\n close_node (i->second);\n }\n h5_map.clear ();\n\n }\n void \n h5_pool::open_file (const std::string &fname_, const std::string &path_)\n {\n if (file_id)\n {\n close_file ();\n }\n if (file_exists (fname_))\n {\n htri_t ret = H5Fis_hdf5 (fname_.c_str ());\n if (ret > 0)\n {\n file_id = H5Fopen (fname_.c_str (), H5F_ACC_RDWR, H5P_DEFAULT);\n if (file_id < 0)\n {\n \/\/ TODO: report error\n throw;\n }\n }\n else\n {\n \/\/ TODO: report error\n throw;\n }\n }\n else \n \/\/ file dose not exist already, create it\n {\n file_id = H5Fcreate (fname_.c_str (), H5F_ACC_TRUNC, H5P_DEFAULT, H5P_DEFAULT);\n if (file_id < 0)\n {\n \/\/ TODO: report error\n throw;\n }\n }\n fname = fname_;\n\n mute ();\n \/\/ create or open group\n group_id = H5Gopen (file_id, path_.c_str ());\n un_mute ();\n if (group_id < 0)\n {\n group_id = H5Gcreate (file_id, path_.c_str (), -1);\n if (group_id < 0)\n {\n \/\/ TODO: report error\n throw;\n }\n }\n path = path_;\n fill_map ();\n }\n \n void \n h5_pool::close_file ()\n {\n clear_map ();\n if (group_id > 0)\n {\n H5Gclose (group_id);\n }\n if (file_id > 0)\n {\n H5Fclose (file_id);\n }\n init_all ();\n }\n\n spv_float \n h5_pool::get_fp_data (const std::string &name)\n {\n map_t::iterator it;\n t_long n;\n spv_float a;\n\n if (group_id <= 0)\n {\n \/\/ TODO: report error\n throw;\n }\n it = h5_map.find (name);\n if (it == h5_map.end ())\n {\n \/\/ TODO: report error\n throw;\n }\n n = H5Sget_simple_extent_npoints (it->second.dspace);\n\n a = BS_KERNEL.create_object (v_float::bs_type ());\n a->resize (n);\n a->reshape (it->second.n_dims, it->second.py_dims); \n if (sizeof (t_float) == sizeof (float))\n {\n H5Dread (it->second.dset, H5T_NATIVE_FLOAT, H5S_ALL, H5S_ALL, H5P_DEFAULT, &(*a)[0]);\n }\n else if (sizeof (t_float) == sizeof (double))\n {\n H5Dread (it->second.dset, H5T_NATIVE_DOUBLE, H5S_ALL, H5S_ALL, H5P_DEFAULT, &(*a)[0]);\n }\n else\n {\n \/\/TODO: print error message\n throw;\n }\n return a;\n }\n\n spv_int \n h5_pool::get_i_data (const std::string &name)\n {\n map_t::iterator it;\n t_long n;\n spv_int a;\n\n if (group_id <= 0)\n {\n \/\/ TODO: report error\n throw;\n }\n it = h5_map.find (name);\n if (it == h5_map.end ())\n {\n \/\/ TODO: report error\n throw;\n }\n n = H5Sget_simple_extent_npoints (it->second.dspace);\n\n a = BS_KERNEL.create_object (v_int::bs_type ());\n a->resize (n);\n a->reshape (it->second.n_dims, it->second.py_dims); \n if (sizeof (t_int) == sizeof (int))\n {\n H5Dread (it->second.dset, H5T_NATIVE_INT, H5S_ALL, H5S_ALL, H5P_DEFAULT, &(*a)[0]);\n }\n else if (sizeof (t_int) == sizeof (long))\n {\n H5Dread (it->second.dset, H5T_NATIVE_LONG, H5S_ALL, H5S_ALL, H5P_DEFAULT, &(*a)[0]);\n }\n else\n {\n \/\/TODO: print error message\n throw;\n }\n return a;\n }\n\n\n int \n h5_pool::set_i_data (const std::string &name, spv_int data)\n {\n t_int ndims;\n const npy_intp *dims;\n map_t::iterator it, e;\n\n if (group_id <= 0)\n {\n \/\/ TODO: report error\n throw;\n }\n\n ndims = data->ndim ();\n dims = data->dims ();\n\n it = h5_map.find (name);\n if (it != h5_map.end ())\n {\n if (it->second.n_dims == ndims)\n {\n int flg = 0;\n for (int i = 0; i < ndims; ++i)\n {\n if (it->second.py_dims[i] != dims[i])\n {\n flg = 1;\n break;\n }\n }\n if (!flg)\n {\n \/\/printf (\"array OK\\n\");\n if (sizeof (t_int) == sizeof (int))\n {\n H5Dwrite (it->second.dset, H5T_NATIVE_INT, H5S_ALL, H5S_ALL, \n H5P_DEFAULT, &(*data)[0]);\n }\n else if (sizeof (t_int) == sizeof (long))\n {\n H5Dwrite (it->second.dset, H5T_NATIVE_LONG, H5S_ALL, H5S_ALL, \n H5P_DEFAULT, &(*data)[0]);\n }\n else\n {\n \/\/TODO: print error message\n throw;\n }\n return 0;\n }\n }\n \/\/ erase element \n H5Ldelete (group_id, it->first.c_str (), H5P_DEFAULT);\n close_node (it->second);\n h5_map.erase (it);\n }\n \/\/ create new\n {\n printf (\"Create %s\\n\", name.c_str ());\n\n map_t::iterator new_it = add_node (name, 0, 0, 0, ndims, dims);\n \n new_it->second.dspace = H5Screate_simple (ndims, new_it->second.h5_dims, NULL);\n \n if (sizeof (t_int) == sizeof (int))\n {\n new_it->second.dtype = H5T_NATIVE_INT;\n }\n else if (sizeof (t_int) == sizeof (long))\n {\n new_it->second.dtype = H5T_NATIVE_LONG;\n }\n else\n {\n \/\/TODO: print error message\n throw;\n }\n new_it->second.dset = H5Dcreate (group_id, name.c_str (), \n new_it->second.dtype, \n new_it->second.dspace,\n H5P_DEFAULT);\n H5Dwrite (new_it->second.dset, new_it->second.dtype, \n H5S_ALL, H5S_ALL, H5P_DEFAULT, &(*data)[0]);\n }\n return 0;\n }\n\n int \n h5_pool::set_fp_data (const std::string &name, spv_float data)\n {\n t_int ndims;\n const npy_intp *dims;\n map_t::iterator it, e;\n\n if (group_id <= 0)\n {\n \/\/ TODO: report error\n throw;\n }\n\n ndims = data->ndim ();\n dims = data->dims ();\n\n it = h5_map.find (name);\n if (it != h5_map.end ())\n {\n if (it->second.n_dims == ndims)\n {\n int flg = 0;\n for (int i = 0; i < ndims; ++i)\n {\n if (it->second.py_dims[i] != dims[i])\n {\n flg = 1;\n break;\n }\n }\n if (!flg)\n {\n \/\/printf (\"array OK\\n\");\n if (sizeof (t_float) == sizeof (float))\n {\n H5Dwrite (it->second.dset, H5T_NATIVE_FLOAT, H5S_ALL, H5S_ALL, \n H5P_DEFAULT, &(*data)[0]);\n }\n else if (sizeof (t_float) == sizeof (double))\n {\n H5Dwrite (it->second.dset, H5T_NATIVE_DOUBLE, H5S_ALL, H5S_ALL, \n H5P_DEFAULT, &(*data)[0]);\n }\n else\n {\n \/\/TODO: print error message\n throw;\n }\n return 0;\n }\n }\n \/\/ erase element \n H5Ldelete (group_id, it->first.c_str (), H5P_DEFAULT);\n close_node (it->second);\n h5_map.erase (it);\n }\n \/\/ create new\n {\n printf (\"Create %s\\n\", name.c_str ());\n\n map_t::iterator new_it = add_node (name, 0, 0, 0, ndims, dims);\n\n new_it->second.dspace = H5Screate_simple (ndims, new_it->second.h5_dims, NULL);\n \n if (sizeof (t_float) == sizeof (float))\n {\n new_it->second.dtype = H5T_NATIVE_FLOAT;\n }\n else if (sizeof (t_float) == sizeof (double))\n {\n new_it->second.dtype = H5T_NATIVE_DOUBLE;\n }\n else\n {\n \/\/TODO: print error message\n throw;\n }\n new_it->second.dset = H5Dcreate (group_id, name.c_str (), \n new_it->second.dtype, \n new_it->second.dspace,\n H5P_DEFAULT);\n H5Dwrite (new_it->second.dset, new_it->second.dtype, \n H5S_ALL, H5S_ALL, H5P_DEFAULT, &(*data)[0]);\n }\n return 0;\n }\n\n void\n h5_pool::mute ()\n {\n if (!mute_flag)\n {\n \/* Save old error handler *\/\n H5Eget_auto2 (H5E_DEFAULT, &old_func, &old_client_data);\n\n \/* Turn off error handling *\/\n H5Eset_auto2 (H5E_DEFAULT, NULL, NULL);\n\n mute_flag = 1;\n }\n }\n\n void\n h5_pool::un_mute ()\n {\n if (mute_flag)\n {\n \/* Restore previous error handler *\/\n H5Eset_auto2 (H5E_DEFAULT, old_func, old_client_data);\n mute_flag = 0;\n }\n }\n\n#ifdef BSPY_EXPORTING_PLUGIN\n std::string \n h5_pool::py_str () const\n {\n std::stringstream s;\n std::string ss; \n map_t::const_iterator i, e;\n H5T_class_t dt;\n\n e = h5_map.end ();\n s << \"H5_pool: \" << h5_map.size () << std::endl;\n s << \"-----------------------------------------------------------\\n\";\n for (i = h5_map.begin (); i != e; ++i)\n {\n std::stringstream sdim;\n s << std::setw (15) <<i->first << \"\\t [\";\n sdim << i->second.py_dims[0];\n for (int j = 1; j < i->second.n_dims; ++j)\n sdim << \", \" <<i->second.py_dims[j];\n s << std::setw (15) << sdim.str () << \"]\\t\";\n dt = H5Tget_class (i->second.dtype);\n if (dt == H5T_INTEGER)\n ss = \"Integer \";\n else if (dt == H5T_FLOAT)\n ss = \"Float \";\n else\n ss = \"Unknown\";\n\n s << std::setw (8) << ss << H5Tget_precision (i->second.dtype);\n s << std::endl;\n }\n s << \"-----------------------------------------------------------\\n\";\n return s.str ();\n }\n#endif \/\/BSPY_EXPORTING_PLUGIN\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/BS Register\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/Stuff\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n BLUE_SKY_TYPE_STD_CREATE (h5_pool);\n BLUE_SKY_TYPE_STD_COPY (h5_pool);\n\n BLUE_SKY_TYPE_IMPL (h5_pool, h5_pool_iface, \"h5_pool\", \"Array pool stored in hdf5 file\", \"Array pool stored in HDF5 file\");\n} \/\/ blue_sky namespace\n<commit_msg>fix bugs in h5_pool<commit_after>\/** \n * @file h5_pool.cpp\n * @brief implementation of #h5_pool_iface\n * @author Oleg Borschuk\n * @version 1.0\n * @date 2011-03-05\n*\/\n#include <hdf5.h>\n#include <stdio.h>\n#include <iomanip>\n\n#include \"h5_pool.h\"\n#include \"h5_helper.h\"\n\nusing namespace std;\nusing namespace boost::python;\n\n\nnamespace blue_sky\n{\n h5_pool::h5_pool (bs_type_ctor_param) \n : h5_pool_iface ()\n {\n init_all ();\n mute_flag = 0;\n \n }\n h5_pool::h5_pool (const h5_pool & \/*src*\/) : bs_refcounter ()\n {\n init_all ();\n mute_flag = 0;\n }\n\n herr_t \n h5_pool::it_group (hid_t g_id, const char *name, const H5L_info_t * \/*info*\/, void * m)\n {\n hsize_t dims_[10];\n int n_dims;\n hid_t dset;\n hid_t dspace;\n hid_t dtype;\n \n dset = H5Dopen (g_id, name);\n if (dset < 0)\n {\n \/\/ TODO: report error\n throw;\n }\n dspace = H5Dget_space (dset);\n dtype = H5Dget_type (dset);\n n_dims = H5Sget_simple_extent_dims (dspace, dims_, NULL);\n ((h5_pool *)m)->add_node (std::string (name), dset, dspace, dtype, n_dims, dims_);\n return 0; \n }\n\n template <class T> h5_pool::map_t::iterator \n h5_pool::add_node (const std::string &name, const hid_t dset, const hid_t dspace, \n const hid_t dtype, const int n_dims, const T *dims)\n {\n pair_t p;\n \/\/printf (\"Add node\");\n\n p.first = name;\n p.second.dset = dset;\n p.second.dspace = dspace;\n p.second.dtype = dtype;\n p.second.n_dims = n_dims;\n for (int i = 0; i < n_dims; ++i)\n {\n p.second.py_dims[i] = (npy_intp)dims[i];\n p.second.h5_dims[i] = (hsize_t)dims[i];\n }\n return h5_map.insert (p).first;\n }\n\n void \n h5_pool::fill_map ()\n {\n clear_map ();\n if (group_id <= 0)\n {\n \/\/ TODO: report error\n throw;\n }\n H5Literate (group_id, H5_INDEX_NAME, H5_ITER_NATIVE, NULL, &(h5_pool::it_group), this); \n\n }\n\n void \n h5_pool::close_node (h5_pair &p)\n {\n H5Dclose (p.dset);\n H5Sclose (p.dspace);\n H5Tclose (p.dtype);\n }\n\n void \n h5_pool::clear_map ()\n {\n map_t::iterator i, e;\n e = h5_map.end ();\n for (i = h5_map.begin (); i != e; ++i)\n {\n close_node (i->second);\n }\n h5_map.clear ();\n\n }\n void \n h5_pool::open_file (const std::string &fname_, const std::string &path_)\n {\n if (file_id)\n {\n close_file ();\n }\n if (file_exists (fname_))\n {\n htri_t ret = H5Fis_hdf5 (fname_.c_str ());\n if (ret > 0)\n {\n file_id = H5Fopen (fname_.c_str (), H5F_ACC_RDWR, H5P_DEFAULT);\n if (file_id < 0)\n {\n \/\/ TODO: report error\n throw;\n }\n }\n else\n {\n file_id = H5Fcreate (fname_.c_str (), H5F_ACC_TRUNC, H5P_DEFAULT, H5P_DEFAULT);\n if (file_id < 0)\n {\n \/\/ TODO: report error\n throw;\n }\n }\n }\n else \n \/\/ file dose not exist already, create it\n {\n file_id = H5Fcreate (fname_.c_str (), H5F_ACC_TRUNC, H5P_DEFAULT, H5P_DEFAULT);\n if (file_id < 0)\n {\n \/\/ TODO: report error\n throw;\n }\n }\n fname = fname_;\n\n mute ();\n \/\/ create or open group\n group_id = H5Gopen (file_id, path_.c_str ());\n un_mute ();\n if (group_id < 0)\n {\n group_id = H5Gcreate (file_id, path_.c_str (), -1);\n if (group_id < 0)\n {\n \/\/ TODO: report error\n throw;\n }\n }\n path = path_;\n fill_map ();\n }\n \n void \n h5_pool::close_file ()\n {\n clear_map ();\n if (group_id > 0)\n {\n H5Gclose (group_id);\n }\n if (file_id > 0)\n {\n H5Fclose (file_id);\n }\n init_all ();\n }\n\n spv_float \n h5_pool::get_fp_data (const std::string &name)\n {\n map_t::iterator it;\n t_long n;\n spv_float a;\n\n if (group_id <= 0)\n {\n \/\/ TODO: report error\n return spv_float ();\n }\n it = h5_map.find (name);\n if (it == h5_map.end ())\n {\n \/\/ TODO: report error\n return spv_float ();\n }\n n = H5Sget_simple_extent_npoints (it->second.dspace);\n\n a = BS_KERNEL.create_object (v_float::bs_type ());\n a->resize (n);\n a->reshape (it->second.n_dims, it->second.py_dims); \n if (sizeof (t_float) == sizeof (float))\n {\n H5Dread (it->second.dset, H5T_NATIVE_FLOAT, H5S_ALL, H5S_ALL, H5P_DEFAULT, &(*a)[0]);\n }\n else if (sizeof (t_float) == sizeof (double))\n {\n H5Dread (it->second.dset, H5T_NATIVE_DOUBLE, H5S_ALL, H5S_ALL, H5P_DEFAULT, &(*a)[0]);\n }\n else\n {\n \/\/TODO: print error message\n return spv_float ();\n }\n return a;\n }\n\n spv_int \n h5_pool::get_i_data (const std::string &name)\n {\n map_t::iterator it;\n t_long n;\n spv_int a;\n\n if (group_id <= 0)\n {\n \/\/ TODO: report error\n return spv_int ();\n }\n it = h5_map.find (name);\n if (it == h5_map.end ())\n {\n \/\/ TODO: report error\n return spv_int ();\n }\n n = H5Sget_simple_extent_npoints (it->second.dspace);\n\n a = BS_KERNEL.create_object (v_int::bs_type ());\n a->resize (n);\n a->reshape (it->second.n_dims, it->second.py_dims); \n if (sizeof (t_int) == sizeof (int))\n {\n H5Dread (it->second.dset, H5T_NATIVE_INT, H5S_ALL, H5S_ALL, H5P_DEFAULT, &(*a)[0]);\n }\n else if (sizeof (t_int) == sizeof (long))\n {\n H5Dread (it->second.dset, H5T_NATIVE_LONG, H5S_ALL, H5S_ALL, H5P_DEFAULT, &(*a)[0]);\n }\n else\n {\n \/\/TODO: print error message\n return spv_int ();\n }\n return a;\n }\n\n\n int \n h5_pool::set_i_data (const std::string &name, spv_int data)\n {\n t_int ndims;\n const npy_intp *dims;\n map_t::iterator it, e;\n\n if (group_id <= 0)\n {\n \/\/ TODO: report error\n throw;\n }\n\n ndims = data->ndim ();\n dims = data->dims ();\n\n it = h5_map.find (name);\n if (it != h5_map.end ())\n {\n if (it->second.n_dims == ndims)\n {\n int flg = 0;\n for (int i = 0; i < ndims; ++i)\n {\n if (it->second.py_dims[i] != dims[i])\n {\n flg = 1;\n break;\n }\n }\n if (!flg)\n {\n \/\/printf (\"array OK\\n\");\n if (sizeof (t_int) == sizeof (int))\n {\n H5Dwrite (it->second.dset, H5T_NATIVE_INT, H5S_ALL, H5S_ALL, \n H5P_DEFAULT, &(*data)[0]);\n }\n else if (sizeof (t_int) == sizeof (long))\n {\n H5Dwrite (it->second.dset, H5T_NATIVE_LONG, H5S_ALL, H5S_ALL, \n H5P_DEFAULT, &(*data)[0]);\n }\n else\n {\n \/\/TODO: print error message\n throw;\n }\n return 0;\n }\n }\n \/\/ erase element \n H5Ldelete (group_id, it->first.c_str (), H5P_DEFAULT);\n close_node (it->second);\n h5_map.erase (it);\n }\n \/\/ create new\n {\n printf (\"Create %s\\n\", name.c_str ());\n\n map_t::iterator new_it = add_node (name, 0, 0, 0, ndims, dims);\n \n new_it->second.dspace = H5Screate_simple (ndims, new_it->second.h5_dims, NULL);\n \n if (sizeof (t_int) == sizeof (int))\n {\n new_it->second.dtype = H5T_NATIVE_INT;\n }\n else if (sizeof (t_int) == sizeof (long))\n {\n new_it->second.dtype = H5T_NATIVE_LONG;\n }\n else\n {\n \/\/TODO: print error message\n throw;\n }\n new_it->second.dset = H5Dcreate (group_id, name.c_str (), \n new_it->second.dtype, \n new_it->second.dspace,\n H5P_DEFAULT);\n H5Dwrite (new_it->second.dset, new_it->second.dtype, \n H5S_ALL, H5S_ALL, H5P_DEFAULT, &(*data)[0]);\n }\n return 0;\n }\n\n int \n h5_pool::set_fp_data (const std::string &name, spv_float data)\n {\n t_int ndims;\n const npy_intp *dims;\n map_t::iterator it, e;\n\n if (group_id <= 0)\n {\n \/\/ TODO: report error\n throw;\n }\n\n ndims = data->ndim ();\n dims = data->dims ();\n\n it = h5_map.find (name);\n if (it != h5_map.end ())\n {\n if (it->second.n_dims == ndims)\n {\n int flg = 0;\n for (int i = 0; i < ndims; ++i)\n {\n if (it->second.py_dims[i] != dims[i])\n {\n flg = 1;\n break;\n }\n }\n if (!flg)\n {\n \/\/printf (\"array OK\\n\");\n if (sizeof (t_float) == sizeof (float))\n {\n H5Dwrite (it->second.dset, H5T_NATIVE_FLOAT, H5S_ALL, H5S_ALL, \n H5P_DEFAULT, &(*data)[0]);\n }\n else if (sizeof (t_float) == sizeof (double))\n {\n H5Dwrite (it->second.dset, H5T_NATIVE_DOUBLE, H5S_ALL, H5S_ALL, \n H5P_DEFAULT, &(*data)[0]);\n }\n else\n {\n \/\/TODO: print error message\n throw;\n }\n return 0;\n }\n }\n \/\/ erase element \n H5Ldelete (group_id, it->first.c_str (), H5P_DEFAULT);\n close_node (it->second);\n h5_map.erase (it);\n }\n \/\/ create new\n {\n printf (\"Create %s\\n\", name.c_str ());\n\n map_t::iterator new_it = add_node (name, 0, 0, 0, ndims, dims);\n\n new_it->second.dspace = H5Screate_simple (ndims, new_it->second.h5_dims, NULL);\n \n if (sizeof (t_float) == sizeof (float))\n {\n new_it->second.dtype = H5T_NATIVE_FLOAT;\n }\n else if (sizeof (t_float) == sizeof (double))\n {\n new_it->second.dtype = H5T_NATIVE_DOUBLE;\n }\n else\n {\n \/\/TODO: print error message\n throw;\n }\n new_it->second.dset = H5Dcreate (group_id, name.c_str (), \n new_it->second.dtype, \n new_it->second.dspace,\n H5P_DEFAULT);\n H5Dwrite (new_it->second.dset, new_it->second.dtype, \n H5S_ALL, H5S_ALL, H5P_DEFAULT, &(*data)[0]);\n }\n return 0;\n }\n\n void\n h5_pool::mute ()\n {\n if (!mute_flag)\n {\n \/* Save old error handler *\/\n H5Eget_auto2 (H5E_DEFAULT, &old_func, &old_client_data);\n\n \/* Turn off error handling *\/\n H5Eset_auto2 (H5E_DEFAULT, NULL, NULL);\n\n mute_flag = 1;\n }\n }\n\n void\n h5_pool::un_mute ()\n {\n if (mute_flag)\n {\n \/* Restore previous error handler *\/\n H5Eset_auto2 (H5E_DEFAULT, old_func, old_client_data);\n mute_flag = 0;\n }\n }\n\n#ifdef BSPY_EXPORTING_PLUGIN\n std::string \n h5_pool::py_str () const\n {\n std::stringstream s;\n std::string ss; \n map_t::const_iterator i, e;\n H5T_class_t dt;\n\n e = h5_map.end ();\n s << \"H5_pool: \" << h5_map.size () << std::endl;\n s << \"-----------------------------------------------------------\\n\";\n for (i = h5_map.begin (); i != e; ++i)\n {\n std::stringstream sdim;\n s << std::setw (15) <<i->first << \"\\t [\";\n sdim << i->second.py_dims[0];\n for (int j = 1; j < i->second.n_dims; ++j)\n sdim << \", \" <<i->second.py_dims[j];\n s << std::setw (15) << sdim.str () << \"]\\t\";\n dt = H5Tget_class (i->second.dtype);\n if (dt == H5T_INTEGER)\n ss = \"Integer \";\n else if (dt == H5T_FLOAT)\n ss = \"Float \";\n else\n ss = \"Unknown\";\n\n s << std::setw (8) << ss << H5Tget_precision (i->second.dtype);\n s << std::endl;\n }\n s << \"-----------------------------------------------------------\\n\";\n return s.str ();\n }\n#endif \/\/BSPY_EXPORTING_PLUGIN\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/BS Register\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/Stuff\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n BLUE_SKY_TYPE_STD_CREATE (h5_pool);\n BLUE_SKY_TYPE_STD_COPY (h5_pool);\n\n BLUE_SKY_TYPE_IMPL (h5_pool, h5_pool_iface, \"h5_pool\", \"Array pool stored in hdf5 file\", \"Array pool stored in HDF5 file\");\n} \/\/ blue_sky namespace\n<|endoftext|>"} {"text":"<commit_before>\/*\n This file is part of Android File Transfer For Linux.\n Copyright (C) 2015 Vladimir Menshakov\n\n Android File Transfer For Linux is free software: you can redistribute\n it and\/or modify it under the terms of the GNU General Public License\n as published by the Free Software Foundation, either version 3 of the\n License, or (at your option) any later version.\n\n Android File Transfer For Linux is distributed in the hope that it will\n be useful, but WITHOUT ANY WARRANTY; without even the implied warranty\n of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the\n GNU General Public License for more details.\n\n You should have received a copy of the GNU General Public License\n along with Android File Transfer For Linux.\n If not, see <http:\/\/www.gnu.org\/licenses\/>.\n *\/\n\n#include <fuse_lowlevel.h>\n#include <stdio.h>\n#include <string.h>\n#include <fcntl.h>\n\n#include <mtp\/ptp\/Device.h>\n#include <mtp\/ptp\/ByteArrayObjectStream.h>\n#include <mtp\/usb\/DeviceNotFoundException.h>\n#include <mtp\/ptp\/ObjectPropertyListParser.h>\n#include <mtp\/log.h>\n\n#include <map>\n#include <string>\n\nnamespace\n{\n\tclass Exception : public std::runtime_error\n\t{\n\tpublic:\n\t\tException(const std::string &what) throw() : std::runtime_error(what + \": \" + GetErrorMessage(errno)) { }\n\t\tException(const std::string &what, int returnCode) throw() : std::runtime_error(what + \": \" + GetErrorMessage(returnCode)) { }\n\t\tstatic std::string GetErrorMessage(int returnCode)\n\t\t{\n\t\t\tchar buf[1024];\n\t\t\tstd::string text(strerror_r(returnCode, buf, sizeof(buf)));\n\t\t\treturn text;\n\t\t}\n\t};\n\n#define FUSE_CALL(...) do { int _r = __VA_ARGS__ ; if (_r < 0) throw Exception(#__VA_ARGS__ \" failed\", -_r); } while(false)\n\n\tstruct FuseEntry : fuse_entry_param\n\t{\n\t\tstatic constexpr const double Timeout = 60.0;\n\n\t\tfuse_req_t Request;\n\n\t\tFuseEntry(fuse_req_t req): fuse_entry_param(), Request(req)\n\t\t{\n\t\t\tgeneration = 1;\n\t\t\tattr_timeout = entry_timeout = Timeout;\n\t\t};\n\n\t\tvoid SetFileMode()\n\t\t{ attr.st_mode = S_IFREG | 0444; }\n\n\t\tvoid SetDirectoryMode()\n\t\t{ attr.st_mode = S_IFDIR | 0755; }\n\n\t\tvoid SetFormat(mtp::ObjectFormat format)\n\t\t{\n\t\t\tswitch(format)\n\t\t\t{\n\t\t\tcase mtp::ObjectFormat::Association:\n\t\t\t\tSetDirectoryMode();\n\t\t\t\tbreak;\n\t\t\tdefault:\n\t\t\t\tSetFileMode();\n\t\t\t}\n\t\t}\n\n\t\tvoid Reply()\n\t\t{\n\t\t\tFUSE_CALL(fuse_reply_entry(Request, this));\n\t\t}\n\n\t\tvoid ReplyAttr()\n\t\t{\n\t\t\tFUSE_CALL(fuse_reply_attr(Request, &attr, Timeout));\n\t\t}\n\n\t\tvoid ReplyError(int err)\n\t\t{\n\t\t\tFUSE_CALL(fuse_reply_err(Request, err));\n\t\t}\n\t};\n\n\tstruct FuseDirectory\n\t{\n\t\tfuse_req_t\t\t\tRequest;\n\t\tstd::vector<char>\tData;\n\n\t\tFuseDirectory(fuse_req_t request): Request(request) { Data.reserve(4096); }\n\n\t\tvoid Add(mtp::u32 id, const std::string &name)\n\t\t{\n\t\t\tsize_t size = fuse_add_direntry(Request, NULL, 0, name.c_str(), NULL, 0);\n\t\t\tsize_t offset = Data.size();\n\t\t\tData.resize(Data.size() + size);\n\t\t\tstruct stat entry = { };\n\t\t\tentry.st_ino = id;\n\t\t\tfuse_add_direntry(Request, Data.data() + offset, size, name.c_str(), &entry, Data.size());\n\t\t}\n\n\t\tvoid Reply(off_t off, size_t size)\n\t\t{\n\t\t\tif ((size_t)off < size)\n\t\t\t\tfuse_reply_buf(Request, Data.data() + off, std::min<size_t>(size, Data.size() - off));\n\t\t\telse\n\t\t\t\tfuse_reply_buf(Request, NULL, 0);\n\t\t}\n\t};\n\n\tclass FuseWrapper\n\t{\n\t\tstd::mutex\t\t_mutex;\n\t\tmtp::DevicePtr\t_device;\n\t\tmtp::SessionPtr\t_session;\n\t\tbool\t\t\t_editObjectSupported;\n\n\t\ttypedef std::map<std::string, mtp::u32> ChildrenObjects;\n\t\ttypedef std::map<mtp::u32, ChildrenObjects> Files;\n\t\tFiles\t\t\t_files;\n\n\t\ttypedef std::map<mtp::u32, mtp::ObjectFormat> ObjectTypes;\n\t\tObjectTypes\t\t_objectFormats;\n\n\t\ttypedef mtp::Session::ObjectEditSessionPtr ObjectEditSessionPtr;\n\t\ttypedef std::map<mtp::u32, ObjectEditSessionPtr> OpenedFiles;\n\t\tOpenedFiles\t\t_openedFiles;\n\n\t\tstd::map<mtp::u32, std::string>\t\t_storages;\n\t\tstd::map<std::string, mtp::u32>\t\t_storagesByName;\n\n\tpublic:\n\t\tFuseWrapper()\n\t\t{ Connect(); }\n\n\t\tvoid Connect()\n\t\t{\n\t\t\tmtp::scoped_mutex_lock l(_mutex);\n\n\t\t\t_openedFiles.clear();\n\t\t\t_files.clear();\n\t\t\t_storages.clear();\n\t\t\t_storagesByName.clear();\n\t\t\t_session.reset();\n\t\t\t_device.reset();\n\t\t\t_device = mtp::Device::Find();\n\t\t\tif (!_device)\n\t\t\t\tthrow std::runtime_error(\"no MTP device found\");\n\n\t\t\t_session = _device->OpenSession(1);\n\t\t\t_editObjectSupported = _session->EditObjectSupported();\n\t\t\tif (!_editObjectSupported)\n\t\t\t\tfprintf(stderr, \"your device does not have android EditObject extension, mounting read-only\\n\");\n\n\t\t\tmtp::msg::StorageIDs ids = _session->GetStorageIDs();\n\t\t\tfor(size_t i = 0; i < ids.StorageIDs.size(); ++i)\n\t\t\t{\n\t\t\t\tmtp::u32 id = ids.StorageIDs[i];\n\t\t\t\tmtp::msg::StorageInfo si = _session->GetStorageInfo(id);\n\t\t\t\tstd::string path = (!si.StorageDescription.empty()? si.StorageDescription: si.VolumeLabel);\n\t\t\t\tif (path.empty())\n\t\t\t\t{\n\t\t\t\t\tchar buf[64];\n\t\t\t\t\tsnprintf(buf, sizeof(buf), \"sdcard%u\", (unsigned)i);\n\t\t\t\t\tpath = buf;\n\t\t\t\t}\n\t\t\t\t_storages[id] = path;\n\t\t\t\t_storagesByName[path] = id;\n\t\t\t}\n\t\t}\n\n\t\tvoid Init(void *, fuse_conn_info *conn)\n\t\t{\n\t\t\tconn->want |= conn->capable & FUSE_CAP_BIG_WRITES; \/\/big writes\n\t\t\tstatic const size_t MaxWriteSize = 1024 * 1024;\n\t\t\tif (conn->max_write < MaxWriteSize)\n\t\t\t\tconn->max_write = MaxWriteSize;\n\t\t\tconn->max_readahead = 0;\n\t\t}\n\n\t\tmtp::ObjectFormat GetObjectFormat(mtp::u32 id)\n\t\t{\n\t\t\tauto i = _objectFormats.find(id);\n\t\t\tif (i != _objectFormats.end())\n\t\t\t\treturn i->second;\n\t\t\tmtp::ObjectFormat format = static_cast<mtp::ObjectFormat>(_session->GetObjectIntegerProperty(id, mtp::ObjectProperty::ObjectFormat));\n\t\t\t_objectFormats.insert(std::make_pair(id, format));\n\t\t\treturn format;\n\t\t}\n\n\t\tChildrenObjects & GetChildren(mtp::u32 parent)\n\t\t{\n\t\t\t{\n\t\t\t\tauto i = _files.find(parent);\n\t\t\t\tif (i != _files.end())\n\t\t\t\t\treturn i->second;\n\t\t\t}\n\n\t\t\tChildrenObjects & cache = _files[parent];\n\t\t\tusing namespace mtp;\n\n\t\t\tmsg::ObjectHandles oh;\n\n\t\t\tauto sit = _storages.find(parent);\n\t\t\tif (sit != _storages.end())\n\t\t\t\toh = _session->GetObjectHandles(sit->first, mtp::ObjectFormat::Any, mtp::Session::Root);\n\t\t\telse\n\t\t\t{\n\t\t\t\tif (_session->GetObjectPropertyListSupported())\n\t\t\t\t{\n\t\t\t\t\tByteArray data;\n\t\t\t\t\t{\n\t\t\t\t\t\tdata = _session->GetObjectPropertyList(parent, ObjectFormat::Any, ObjectProperty::ObjectFilename, 0, 1);\n\t\t\t\t\t\tObjectPropertyListParser<std::string> parser;\n\t\t\t\t\t\tparser.Parse(data, [&cache](u32 objectId, const std::string &name)\n\t\t\t\t\t\t{\n\t\t\t\t\t\t\tcache[name] = objectId;\n\t\t\t\t\t\t});\n\t\t\t\t\t}\n\t\t\t\t\t{\n\t\t\t\t\t\tdata = _session->GetObjectPropertyList(parent, ObjectFormat::Any, ObjectProperty::ObjectFormat, 0, 1);\n\t\t\t\t\t\tObjectPropertyListParser<u16> parser;\n\t\t\t\t\t\tparser.Parse(data, [this](u32 objectId, u16 format)\n\t\t\t\t\t\t{\n\t\t\t\t\t\t\t_objectFormats[objectId] = static_cast<ObjectFormat>(format);\n\t\t\t\t\t\t});\n\t\t\t\t\t}\n\t\t\t\t\treturn cache;\n\t\t\t\t}\n\t\t\t\toh = _session->GetObjectHandles(mtp::Session::AllStorages, mtp::ObjectFormat::Any, parent);\n\t\t\t}\n\n\t\t\tfor(auto id : oh.ObjectHandles)\n\t\t\t{\n\t\t\t\ttry\n\t\t\t\t{\n\t\t\t\t\tstd::string name = _session->GetObjectStringProperty(id, mtp::ObjectProperty::ObjectFilename);\n\t\t\t\t\t_objectFormats[id] = (ObjectFormat)_session->GetObjectIntegerProperty(id, ObjectProperty::ObjectFormat);\n\t\t\t\t\tcache[name] = id;\n\t\t\t\t} catch(const std::exception &ex)\n\t\t\t\t{ }\n\t\t\t}\n\t\t\treturn cache;\n\t\t}\n\n\t\tvoid Lookup (fuse_req_t req, fuse_ino_t parent, const char *name)\n\t\t{\n\t\t\tmtp::print(\"LOOKUP \", name, \" IN \", parent);\n\t\t\tFuseEntry entry(req);\n\t\t\tif (parent != 1)\n\t\t\t{\n\t\t\t\tconst ChildrenObjects & children = GetChildren(parent);\n\t\t\t\tauto it = children.find(name);\n\t\t\t\tif (it != children.end())\n\t\t\t\t{\n\t\t\t\t\tentry.ino = it->second;\n\t\t\t\t\tentry.SetFormat(GetObjectFormat(it->second));\n\t\t\t\t\tentry.Reply();\n\t\t\t\t\treturn;\n\t\t\t\t}\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\tauto sit = _storagesByName.find(name);\n\t\t\t\tif (sit != _storagesByName.end())\n\t\t\t\t{\n\t\t\t\t\tentry.ino = sit->second;\n\t\t\t\t\tentry.SetDirectoryMode();\n\t\t\t\t\tentry.Reply();\n\t\t\t\t\treturn;\n\t\t\t\t}\n\t\t\t}\n\t\t\tentry.ReplyError(ENOENT);\n\t\t}\n\n\t\tvoid ReadDir(fuse_req_t req, fuse_ino_t ino, size_t size, off_t off, struct fuse_file_info *fi)\n\t\t{\n\t\t\tFuseDirectory dir(req);\n\t\t\tif (ino == 1)\n\t\t\t{\n\t\t\t\tdir.Add(1, \".\");\n\t\t\t\tdir.Add(1, \"..\");\n\t\t\t\tfor(auto it : _storages)\n\t\t\t\t{\n\t\t\t\t\tdir.Add(it.first, it.second);\n\t\t\t\t}\n\t\t\t\tdir.Reply(off, size);\n\t\t\t\treturn;\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\tconst ChildrenObjects & cache = GetChildren(ino);\n\t\t\t\tdir.Add(ino, \".\");\n\t\t\t\tdir.Add(1, \"..\");\n\t\t\t\tfor(auto it : cache)\n\t\t\t\t{\n\t\t\t\t\tdir.Add(it.second, it.first);\n\t\t\t\t}\n\t\t\t\tdir.Reply(off, size);\n\t\t\t\treturn;\n\t\t\t}\n\t\t\tfuse_reply_err(req, ENOTDIR);\n\t\t}\n\n\t\tvoid GetAttr(fuse_req_t req, fuse_ino_t ino, struct fuse_file_info *fi)\n\t\t{\n\t\t\tFuseEntry entry(req);\n\t\t\tentry.ino = ino;\n\t\t\tif (ino == 1)\n\t\t\t{\n\t\t\t\tentry.SetDirectoryMode();\n\t\t\t\tentry.ReplyAttr();\n\t\t\t\treturn;\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\tauto it = _storages.find((mtp::u32)ino);\n\t\t\t\tif (it != _storages.end())\n\t\t\t\t{\n\t\t\t\t\tentry.SetDirectoryMode();\n\t\t\t\t\tentry.ReplyAttr();\n\t\t\t\t\treturn;\n\t\t\t\t}\n\n\t\t\t\ttry {\n\t\t\t\t\tentry.SetFormat(GetObjectFormat(ino));\n\t\t\t\t\tentry.ReplyAttr();\n\t\t\t\t\treturn;\n\t\t\t\t}\n\t\t\t\tcatch(const std::exception &ex)\n\t\t\t\t{ }\n\t\t\t}\n\t\t\tentry.ReplyError(ENOENT);\n\t\t}\n\t};\n\n\tstd::unique_ptr<FuseWrapper>\tg_wrapper;\n\n#define WRAP_EX(...) do { \\\n\t\ttry { return __VA_ARGS__ ; } \\\n\t\tcatch (const mtp::usb::DeviceNotFoundException &) \\\n\t\t{ \\\n\t\t\tg_wrapper->Connect(); \\\n\t\t\t__VA_ARGS__ ; \\\n\t\t} \\\n\t\tcatch (const std::exception &ex) \\\n\t\t{ fprintf(stderr, #__VA_ARGS__ \" failed: %s\\n\", ex.what()); fuse_reply_err(req, -EIO); } \\\n\t} while(false)\n\n\tvoid Init (void *userdata, struct fuse_conn_info *conn)\n\t{ try { g_wrapper->Init(userdata, conn); } catch (const std::exception &ex) { mtp::error(\"init failed:\", ex.what()); } }\n\n\tvoid Lookup (fuse_req_t req, fuse_ino_t parent, const char *name)\n\t{ WRAP_EX(g_wrapper->Lookup(req, parent, name)); }\n\n\tvoid ReadDir(fuse_req_t req, fuse_ino_t ino, size_t size, off_t off, struct fuse_file_info *fi)\n\t{ WRAP_EX(g_wrapper->ReadDir(req, ino, size, off, fi)); }\n\n\tvoid GetAttr(fuse_req_t req, fuse_ino_t ino, struct fuse_file_info *fi)\n\t{ WRAP_EX(g_wrapper->GetAttr(req, ino, fi)); }\n\n}\n\nint main(int argc, char **argv)\n{\n\ttry\n\t{ g_wrapper.reset(new FuseWrapper()); }\n\tcatch(const std::exception &ex)\n\t{ fprintf(stderr, \"%s\\n\", ex.what()); return 1; }\n\n\tstruct fuse_lowlevel_ops ops = {};\n\n\tops.init\t\t= &Init;\n\tops.lookup\t\t= &Lookup;\n\tops.readdir\t\t= &ReadDir;\n\tops.getattr\t\t= &GetAttr;\n\/\/\tops.open\t\t= &Open;\n\/\/\tops.create\t\t= &Create;\n\/\/\tops.read\t\t= &Read;\n\/\/\tops.write\t\t= &Write;\n\/\/\tops.flush\t\t= &Flush;\n\/\/\tops.mkdir\t\t= &MakeDir;\n\/\/\tops.rmdir\t\t= &RemoveDir;\n\/\/\tops.unlink\t\t= &Unlink;\n\/\/\tops.truncate\t= &Truncate;\n\/\/\tops.statfs\t\t= &StatFS;\n\/\/\tops.chmod\t\t= &ChangeMode;\n\n\tstruct fuse_args args = FUSE_ARGS_INIT(argc, argv);\n\tstruct fuse_chan *ch;\n\tchar *mountpoint;\n\tint err = -1;\n\n\tif (fuse_parse_cmdline(&args, &mountpoint, NULL, NULL) != -1 &&\n\t (ch = fuse_mount(mountpoint, &args)) != NULL) {\n\t\tstruct fuse_session *se;\n\n\t\tse = fuse_lowlevel_new(&args, &ops,\n\t\t\t\t sizeof(ops), NULL);\n\t\tif (se != NULL) {\n\t\t\tif (fuse_set_signal_handlers(se) != -1) {\n\t\t\t\tfuse_session_add_chan(se, ch);\n\t\t\t\terr = fuse_session_loop(se);\n\t\t\t\tfuse_remove_signal_handlers(se);\n\t\t\t\tfuse_session_remove_chan(ch);\n\t\t\t}\n\t\t\tfuse_session_destroy(se);\n\t\t}\n\t\tfuse_unmount(mountpoint, ch);\n\t}\n\tfuse_opt_free_args(&args);\n\n\treturn err ? 1 : 0;\n}\n<commit_msg>added read support<commit_after>\/*\n This file is part of Android File Transfer For Linux.\n Copyright (C) 2015 Vladimir Menshakov\n\n Android File Transfer For Linux is free software: you can redistribute\n it and\/or modify it under the terms of the GNU General Public License\n as published by the Free Software Foundation, either version 3 of the\n License, or (at your option) any later version.\n\n Android File Transfer For Linux is distributed in the hope that it will\n be useful, but WITHOUT ANY WARRANTY; without even the implied warranty\n of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the\n GNU General Public License for more details.\n\n You should have received a copy of the GNU General Public License\n along with Android File Transfer For Linux.\n If not, see <http:\/\/www.gnu.org\/licenses\/>.\n *\/\n\n#include <fuse_lowlevel.h>\n#include <stdio.h>\n#include <string.h>\n#include <fcntl.h>\n\n#include <mtp\/ptp\/Device.h>\n#include <mtp\/ptp\/ByteArrayObjectStream.h>\n#include <mtp\/usb\/DeviceNotFoundException.h>\n#include <mtp\/ptp\/ObjectPropertyListParser.h>\n#include <mtp\/log.h>\n\n#include <map>\n#include <string>\n\nnamespace\n{\n\tclass Exception : public std::runtime_error\n\t{\n\tpublic:\n\t\tException(const std::string &what) throw() : std::runtime_error(what + \": \" + GetErrorMessage(errno)) { }\n\t\tException(const std::string &what, int returnCode) throw() : std::runtime_error(what + \": \" + GetErrorMessage(returnCode)) { }\n\t\tstatic std::string GetErrorMessage(int returnCode)\n\t\t{\n\t\t\tchar buf[1024];\n\t\t\tstd::string text(strerror_r(returnCode, buf, sizeof(buf)));\n\t\t\treturn text;\n\t\t}\n\t};\n\n#define FUSE_CALL(...) do { int _r = __VA_ARGS__ ; if (_r < 0) throw Exception(#__VA_ARGS__ \" failed\", -_r); } while(false)\n\n\tstruct FuseEntry : fuse_entry_param\n\t{\n\t\tstatic constexpr const double Timeout = 60.0;\n\n\t\tfuse_req_t Request;\n\n\t\tFuseEntry(fuse_req_t req): fuse_entry_param(), Request(req)\n\t\t{\n\t\t\tgeneration = 1;\n\t\t\tattr_timeout = entry_timeout = Timeout;\n\t\t};\n\n\t\tvoid SetFileMode()\n\t\t{ attr.st_mode = S_IFREG | 0444; }\n\n\t\tvoid SetDirectoryMode()\n\t\t{ attr.st_mode = S_IFDIR | 0755; }\n\n\t\tvoid SetFormat(mtp::ObjectFormat format)\n\t\t{\n\t\t\tswitch(format)\n\t\t\t{\n\t\t\tcase mtp::ObjectFormat::Association:\n\t\t\t\tSetDirectoryMode();\n\t\t\t\tbreak;\n\t\t\tdefault:\n\t\t\t\tSetFileMode();\n\t\t\t}\n\t\t}\n\n\t\tvoid Reply()\n\t\t{\n\t\t\tFUSE_CALL(fuse_reply_entry(Request, this));\n\t\t}\n\n\t\tvoid ReplyAttr()\n\t\t{\n\t\t\tFUSE_CALL(fuse_reply_attr(Request, &attr, Timeout));\n\t\t}\n\n\t\tvoid ReplyError(int err)\n\t\t{\n\t\t\tFUSE_CALL(fuse_reply_err(Request, err));\n\t\t}\n\t};\n\n\tstruct FuseDirectory\n\t{\n\t\tfuse_req_t\t\t\tRequest;\n\t\tstd::vector<char>\tData;\n\n\t\tFuseDirectory(fuse_req_t request): Request(request) { Data.reserve(4096); }\n\n\t\tvoid Add(mtp::u32 id, const std::string &name)\n\t\t{\n\t\t\tsize_t size = fuse_add_direntry(Request, NULL, 0, name.c_str(), NULL, 0);\n\t\t\tsize_t offset = Data.size();\n\t\t\tData.resize(Data.size() + size);\n\t\t\tstruct stat entry = { };\n\t\t\tentry.st_ino = id;\n\t\t\tfuse_add_direntry(Request, Data.data() + offset, size, name.c_str(), &entry, Data.size());\n\t\t}\n\n\t\tvoid Reply(off_t off, size_t size)\n\t\t{\n\t\t\tif ((size_t)off < size)\n\t\t\t\tfuse_reply_buf(Request, Data.data() + off, std::min<size_t>(size, Data.size() - off));\n\t\t\telse\n\t\t\t\tfuse_reply_buf(Request, NULL, 0);\n\t\t}\n\t};\n\n\tclass FuseWrapper\n\t{\n\t\tstd::mutex\t\t_mutex;\n\t\tmtp::DevicePtr\t_device;\n\t\tmtp::SessionPtr\t_session;\n\t\tbool\t\t\t_editObjectSupported;\n\n\t\ttypedef std::map<std::string, mtp::u32> ChildrenObjects;\n\t\ttypedef std::map<mtp::u32, ChildrenObjects> Files;\n\t\tFiles\t\t\t_files;\n\n\t\ttypedef std::map<mtp::u32, mtp::ObjectFormat> ObjectTypes;\n\t\tObjectTypes\t\t_objectFormats;\n\n\t\ttypedef mtp::Session::ObjectEditSessionPtr ObjectEditSessionPtr;\n\t\ttypedef std::map<mtp::u32, ObjectEditSessionPtr> OpenedFiles;\n\t\tOpenedFiles\t\t_openedFiles;\n\n\t\tstd::map<mtp::u32, std::string>\t\t_storages;\n\t\tstd::map<std::string, mtp::u32>\t\t_storagesByName;\n\n\tpublic:\n\t\tFuseWrapper()\n\t\t{ Connect(); }\n\n\t\tvoid Connect()\n\t\t{\n\t\t\tmtp::scoped_mutex_lock l(_mutex);\n\n\t\t\t_openedFiles.clear();\n\t\t\t_files.clear();\n\t\t\t_storages.clear();\n\t\t\t_storagesByName.clear();\n\t\t\t_session.reset();\n\t\t\t_device.reset();\n\t\t\t_device = mtp::Device::Find();\n\t\t\tif (!_device)\n\t\t\t\tthrow std::runtime_error(\"no MTP device found\");\n\n\t\t\t_session = _device->OpenSession(1);\n\t\t\t_editObjectSupported = _session->EditObjectSupported();\n\t\t\tif (!_editObjectSupported)\n\t\t\t\tfprintf(stderr, \"your device does not have android EditObject extension, mounting read-only\\n\");\n\n\t\t\tmtp::msg::StorageIDs ids = _session->GetStorageIDs();\n\t\t\tfor(size_t i = 0; i < ids.StorageIDs.size(); ++i)\n\t\t\t{\n\t\t\t\tmtp::u32 id = ids.StorageIDs[i];\n\t\t\t\tmtp::msg::StorageInfo si = _session->GetStorageInfo(id);\n\t\t\t\tstd::string path = (!si.StorageDescription.empty()? si.StorageDescription: si.VolumeLabel);\n\t\t\t\tif (path.empty())\n\t\t\t\t{\n\t\t\t\t\tchar buf[64];\n\t\t\t\t\tsnprintf(buf, sizeof(buf), \"sdcard%u\", (unsigned)i);\n\t\t\t\t\tpath = buf;\n\t\t\t\t}\n\t\t\t\t_storages[id] = path;\n\t\t\t\t_storagesByName[path] = id;\n\t\t\t}\n\t\t}\n\n\t\tvoid Init(void *, fuse_conn_info *conn)\n\t\t{\n\t\t\tconn->want |= conn->capable & FUSE_CAP_BIG_WRITES; \/\/big writes\n\t\t\tstatic const size_t MaxWriteSize = 1024 * 1024;\n\t\t\tif (conn->max_write < MaxWriteSize)\n\t\t\t\tconn->max_write = MaxWriteSize;\n\t\t\tconn->max_readahead = 0;\n\t\t}\n\n\t\tmtp::ObjectFormat GetObjectFormat(mtp::u32 id)\n\t\t{\n\t\t\tauto i = _objectFormats.find(id);\n\t\t\tif (i != _objectFormats.end())\n\t\t\t\treturn i->second;\n\t\t\tmtp::ObjectFormat format = static_cast<mtp::ObjectFormat>(_session->GetObjectIntegerProperty(id, mtp::ObjectProperty::ObjectFormat));\n\t\t\t_objectFormats.insert(std::make_pair(id, format));\n\t\t\treturn format;\n\t\t}\n\n\t\tChildrenObjects & GetChildren(mtp::u32 parent)\n\t\t{\n\t\t\t{\n\t\t\t\tauto i = _files.find(parent);\n\t\t\t\tif (i != _files.end())\n\t\t\t\t\treturn i->second;\n\t\t\t}\n\n\t\t\tChildrenObjects & cache = _files[parent];\n\t\t\tusing namespace mtp;\n\n\t\t\tmsg::ObjectHandles oh;\n\n\t\t\tauto sit = _storages.find(parent);\n\t\t\tif (sit != _storages.end())\n\t\t\t\toh = _session->GetObjectHandles(sit->first, mtp::ObjectFormat::Any, mtp::Session::Root);\n\t\t\telse\n\t\t\t{\n\t\t\t\tif (_session->GetObjectPropertyListSupported())\n\t\t\t\t{\n\t\t\t\t\tByteArray data;\n\t\t\t\t\t{\n\t\t\t\t\t\tdata = _session->GetObjectPropertyList(parent, ObjectFormat::Any, ObjectProperty::ObjectFilename, 0, 1);\n\t\t\t\t\t\tObjectPropertyListParser<std::string> parser;\n\t\t\t\t\t\tparser.Parse(data, [&cache](u32 objectId, const std::string &name)\n\t\t\t\t\t\t{\n\t\t\t\t\t\t\tcache[name] = objectId;\n\t\t\t\t\t\t});\n\t\t\t\t\t}\n\t\t\t\t\t{\n\t\t\t\t\t\tdata = _session->GetObjectPropertyList(parent, ObjectFormat::Any, ObjectProperty::ObjectFormat, 0, 1);\n\t\t\t\t\t\tObjectPropertyListParser<u16> parser;\n\t\t\t\t\t\tparser.Parse(data, [this](u32 objectId, u16 format)\n\t\t\t\t\t\t{\n\t\t\t\t\t\t\t_objectFormats[objectId] = static_cast<ObjectFormat>(format);\n\t\t\t\t\t\t});\n\t\t\t\t\t}\n\t\t\t\t\treturn cache;\n\t\t\t\t}\n\t\t\t\toh = _session->GetObjectHandles(mtp::Session::AllStorages, mtp::ObjectFormat::Any, parent);\n\t\t\t}\n\n\t\t\tfor(auto id : oh.ObjectHandles)\n\t\t\t{\n\t\t\t\ttry\n\t\t\t\t{\n\t\t\t\t\tstd::string name = _session->GetObjectStringProperty(id, mtp::ObjectProperty::ObjectFilename);\n\t\t\t\t\t_objectFormats[id] = (ObjectFormat)_session->GetObjectIntegerProperty(id, ObjectProperty::ObjectFormat);\n\t\t\t\t\tcache[name] = id;\n\t\t\t\t} catch(const std::exception &ex)\n\t\t\t\t{ }\n\t\t\t}\n\t\t\treturn cache;\n\t\t}\n\n\t\tvoid Lookup (fuse_req_t req, fuse_ino_t parent, const char *name)\n\t\t{\n\t\t\tmtp::print(\"LOOKUP \", name, \" IN \", parent);\n\t\t\tFuseEntry entry(req);\n\t\t\tif (parent != 1)\n\t\t\t{\n\t\t\t\tconst ChildrenObjects & children = GetChildren(parent);\n\t\t\t\tauto it = children.find(name);\n\t\t\t\tif (it != children.end())\n\t\t\t\t{\n\t\t\t\t\tentry.ino = it->second;\n\t\t\t\t\tentry.SetFormat(GetObjectFormat(it->second));\n\t\t\t\t\tentry.Reply();\n\t\t\t\t\treturn;\n\t\t\t\t}\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\tauto sit = _storagesByName.find(name);\n\t\t\t\tif (sit != _storagesByName.end())\n\t\t\t\t{\n\t\t\t\t\tentry.ino = sit->second;\n\t\t\t\t\tentry.SetDirectoryMode();\n\t\t\t\t\tentry.Reply();\n\t\t\t\t\treturn;\n\t\t\t\t}\n\t\t\t}\n\t\t\tentry.ReplyError(ENOENT);\n\t\t}\n\n\t\tvoid ReadDir(fuse_req_t req, fuse_ino_t ino, size_t size, off_t off, struct fuse_file_info *fi)\n\t\t{\n\t\t\tFuseDirectory dir(req);\n\t\t\tif (ino == 1)\n\t\t\t{\n\t\t\t\tdir.Add(1, \".\");\n\t\t\t\tdir.Add(1, \"..\");\n\t\t\t\tfor(auto it : _storages)\n\t\t\t\t{\n\t\t\t\t\tdir.Add(it.first, it.second);\n\t\t\t\t}\n\t\t\t\tdir.Reply(off, size);\n\t\t\t\treturn;\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\tconst ChildrenObjects & cache = GetChildren(ino);\n\t\t\t\tdir.Add(ino, \".\");\n\t\t\t\tdir.Add(1, \"..\");\n\t\t\t\tfor(auto it : cache)\n\t\t\t\t{\n\t\t\t\t\tdir.Add(it.second, it.first);\n\t\t\t\t}\n\t\t\t\tdir.Reply(off, size);\n\t\t\t\treturn;\n\t\t\t}\n\t\t\tfuse_reply_err(req, ENOTDIR);\n\t\t}\n\n\t\tvoid Read(fuse_req_t req, fuse_ino_t ino, size_t size, off_t off, struct fuse_file_info *fi)\n\t\t{\n\t\t\tmtp::print(\"READ \", off, \" \", size);\n\t\t\tmtp::ByteArray data = _session->GetPartialObject(ino, off, size);\n\t\t\tmtp::HexDump(\"data\", data, true);\n\t\t\tFUSE_CALL(fuse_reply_buf(req, static_cast<char *>(static_cast<void *>(data.data())), data.size()));\n\t\t}\n\n\t\tvoid GetAttr(fuse_req_t req, fuse_ino_t ino, struct fuse_file_info *fi)\n\t\t{\n\t\t\tFuseEntry entry(req);\n\t\t\tentry.ino = ino;\n\t\t\tif (ino == 1)\n\t\t\t{\n\t\t\t\tentry.SetDirectoryMode();\n\t\t\t\tentry.ReplyAttr();\n\t\t\t\treturn;\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\tauto it = _storages.find((mtp::u32)ino);\n\t\t\t\tif (it != _storages.end())\n\t\t\t\t{\n\t\t\t\t\tentry.SetDirectoryMode();\n\t\t\t\t\tentry.ReplyAttr();\n\t\t\t\t\treturn;\n\t\t\t\t}\n\n\t\t\t\ttry {\n\t\t\t\t\tentry.SetFormat(GetObjectFormat(ino));\n\t\t\t\t\tentry.attr.st_size = _session->GetObjectIntegerProperty(ino, mtp::ObjectProperty::ObjectSize);\n\t\t\t\t\tentry.ReplyAttr();\n\t\t\t\t\treturn;\n\t\t\t\t}\n\t\t\t\tcatch(const std::exception &ex)\n\t\t\t\t{ }\n\t\t\t}\n\t\t\tentry.ReplyError(ENOENT);\n\t\t}\n\t};\n\n\tstd::unique_ptr<FuseWrapper>\tg_wrapper;\n\n#define WRAP_EX(...) do { \\\n\t\ttry { return __VA_ARGS__ ; } \\\n\t\tcatch (const mtp::usb::DeviceNotFoundException &) \\\n\t\t{ \\\n\t\t\tg_wrapper->Connect(); \\\n\t\t\t__VA_ARGS__ ; \\\n\t\t} \\\n\t\tcatch (const std::exception &ex) \\\n\t\t{ fprintf(stderr, #__VA_ARGS__ \" failed: %s\\n\", ex.what()); fuse_reply_err(req, -EIO); } \\\n\t} while(false)\n\n\tvoid Init (void *userdata, struct fuse_conn_info *conn)\n\t{ try { g_wrapper->Init(userdata, conn); } catch (const std::exception &ex) { mtp::error(\"init failed:\", ex.what()); } }\n\n\tvoid Lookup (fuse_req_t req, fuse_ino_t parent, const char *name)\n\t{ WRAP_EX(g_wrapper->Lookup(req, parent, name)); }\n\n\tvoid ReadDir(fuse_req_t req, fuse_ino_t ino, size_t size, off_t off, struct fuse_file_info *fi)\n\t{ WRAP_EX(g_wrapper->ReadDir(req, ino, size, off, fi)); }\n\n\tvoid GetAttr(fuse_req_t req, fuse_ino_t ino, struct fuse_file_info *fi)\n\t{ WRAP_EX(g_wrapper->GetAttr(req, ino, fi)); }\n\n\tvoid Read(fuse_req_t req, fuse_ino_t ino, size_t size, off_t off, struct fuse_file_info *fi)\n\t{ WRAP_EX(g_wrapper->Read(req, ino, size, off, fi)); }\n}\n\nint main(int argc, char **argv)\n{\n\ttry\n\t{ g_wrapper.reset(new FuseWrapper()); }\n\tcatch(const std::exception &ex)\n\t{ fprintf(stderr, \"%s\\n\", ex.what()); return 1; }\n\n\tstruct fuse_lowlevel_ops ops = {};\n\n\tops.init\t\t= &Init;\n\tops.lookup\t\t= &Lookup;\n\tops.readdir\t\t= &ReadDir;\n\tops.getattr\t\t= &GetAttr;\n\/\/\tops.open\t\t= &Open;\n\/\/\tops.create\t\t= &Create;\n\tops.read\t\t= &Read;\n\/\/\tops.write\t\t= &Write;\n\/\/\tops.mkdir\t\t= &MakeDir;\n\/\/\tops.rmdir\t\t= &RemoveDir;\n\/\/\tops.unlink\t\t= &Unlink;\n\/\/\tops.truncate\t= &Truncate;\n\/\/\tops.statfs\t\t= &StatFS;\n\/\/\tops.chmod\t\t= &ChangeMode;\n\n\tstruct fuse_args args = FUSE_ARGS_INIT(argc, argv);\n\tstruct fuse_chan *ch;\n\tchar *mountpoint;\n\tint err = -1;\n\n\tif (fuse_parse_cmdline(&args, &mountpoint, NULL, NULL) != -1 &&\n\t (ch = fuse_mount(mountpoint, &args)) != NULL) {\n\t\tstruct fuse_session *se;\n\n\t\tse = fuse_lowlevel_new(&args, &ops,\n\t\t\t\t sizeof(ops), NULL);\n\t\tif (se != NULL) {\n\t\t\tif (fuse_set_signal_handlers(se) != -1) {\n\t\t\t\tfuse_session_add_chan(se, ch);\n\t\t\t\terr = fuse_session_loop(se);\n\t\t\t\tfuse_remove_signal_handlers(se);\n\t\t\t\tfuse_session_remove_chan(ch);\n\t\t\t}\n\t\t\tfuse_session_destroy(se);\n\t\t}\n\t\tfuse_unmount(mountpoint, ch);\n\t}\n\tfuse_opt_free_args(&args);\n\n\treturn err ? 1 : 0;\n}\n<|endoftext|>"} {"text":"<commit_before><commit_msg>Fix leak: explicitly delete seed clones not cached in local buffer<commit_after><|endoftext|>"} {"text":"<commit_before>#if defined(LINUX)\n#include <sys\/syscall.h>\n#include <sys\/types.h>\n#include <sys\/stat.h>\n#include <fcntl.h>\n#include <unistd.h>\n#include <stdio.h>\n#include <string.h>\n#include <stdint.h>\n#include <stddef.h>\n#include <errno.h>\ntypedef uint64_t u64;\n#include \"include\/wq.hh\"\n#include \"user\/dirit.hh\"\n#include \"include\/percpu.hh\"\n#define ST_SIZE(st) (st).st_size\n#define ST_ISDIR(st) S_ISDIR((st).st_mode)\n#define BSIZ 256\n\n#else \/\/ assume xv6\n\n#include \"types.h\"\n#include \"stat.h\"\n#include \"user.h\"\n#include \"lib.h\"\n#include \"fs.h\"\n#include \"uspinlock.h\"\n#include \"wq.hh\"\n#include \"dirit.hh\"\n#include \"percpu.hh\"\n#define ST_SIZE(st) (st).size\n#define ST_ISDIR(st) ((st).type == T_DIR)\n#define stderr 2\n#define BSIZ (DIRSIZ+1)\n#endif\n\ntemplate <typename T>\nstruct reducer_opadd\n{\n reducer_opadd(T v) {\n for (int i = 0; i < NCPU; i++)\n v_[i] = 0;\n *v_ = v;\n }\n\n T operator+=(T i) {\n (*v_) += i;\n return *v_;\n }\n\n T get_value() {\n T t = 0;\n for (int i = 0; i < NCPU; i++)\n t += v_[i];\n return t;\n }\n\n percpu<T> v_;\n};\n\nstatic size_t\ndu(int fd)\n{\n struct stat st;\n if (fstat(fd, &st) < 0) {\n fprintf(stderr, \"du: cannot stat\\n\");\n close(fd);\n return 0;\n }\n\n \/\/ XXX(sbw) size should use an add reducer\n reducer_opadd<size_t> size(ST_SIZE(st));\n if (ST_ISDIR(st)) {\n dirit di(fd);\n wq_for<dirit>(di,\n [](dirit &i)->bool { return !i.end(); },\n [&](const char *name)->void\n {\n if (!strcmp(name, \".\") || !strcmp(name, \"..\")) {\n free((void*)name);\n return;\n }\n\n int nfd = openat(fd, name, 0);\n if (nfd >= 0)\n size += du(nfd); \/\/ should go into work queue\n free((void*)name);\n });\n } else {\n close(fd);\n }\n\n return size.get_value();\n}\n\nint\nmain(int ac, char **av)\n{\n initwq();\n printf(\"%ld\\n\", du(open(\".\", 0)));\n return 0;\n}\n<commit_msg>Tighter capture scope<commit_after>#if defined(LINUX)\n#include <sys\/syscall.h>\n#include <sys\/types.h>\n#include <sys\/stat.h>\n#include <fcntl.h>\n#include <unistd.h>\n#include <stdio.h>\n#include <string.h>\n#include <stdint.h>\n#include <stddef.h>\n#include <errno.h>\ntypedef uint64_t u64;\n#include \"include\/wq.hh\"\n#include \"user\/dirit.hh\"\n#include \"include\/percpu.hh\"\n#define ST_SIZE(st) (st).st_size\n#define ST_ISDIR(st) S_ISDIR((st).st_mode)\n#define BSIZ 256\n\n#else \/\/ assume xv6\n\n#include \"types.h\"\n#include \"stat.h\"\n#include \"user.h\"\n#include \"lib.h\"\n#include \"fs.h\"\n#include \"uspinlock.h\"\n#include \"wq.hh\"\n#include \"dirit.hh\"\n#include \"percpu.hh\"\n#define ST_SIZE(st) (st).size\n#define ST_ISDIR(st) ((st).type == T_DIR)\n#define stderr 2\n#define BSIZ (DIRSIZ+1)\n#endif\n\ntemplate <typename T>\nstruct reducer_opadd\n{\n reducer_opadd(T v) {\n for (int i = 0; i < NCPU; i++)\n v_[i] = 0;\n *v_ = v;\n }\n\n T operator+=(T i) {\n (*v_) += i;\n return *v_;\n }\n\n T get_value() {\n T t = 0;\n for (int i = 0; i < NCPU; i++)\n t += v_[i];\n return t;\n }\n\n percpu<T> v_;\n};\n\nstatic size_t\ndu(int fd)\n{\n struct stat st;\n if (fstat(fd, &st) < 0) {\n fprintf(stderr, \"du: cannot stat\\n\");\n close(fd);\n return 0;\n }\n\n reducer_opadd<size_t> size(ST_SIZE(st));\n if (ST_ISDIR(st)) {\n dirit di(fd);\n wq_for<dirit>(di,\n [](dirit &i)->bool { return !i.end(); },\n [&size, &fd](const char *name)->void\n {\n if (!strcmp(name, \".\") || !strcmp(name, \"..\")) {\n free((void*)name);\n return;\n }\n\n int nfd = openat(fd, name, 0);\n if (nfd >= 0)\n size += du(nfd); \/\/ should go into work queue\n free((void*)name);\n });\n } else {\n close(fd);\n }\n\n return size.get_value();\n}\n\nint\nmain(int ac, char **av)\n{\n initwq();\n printf(\"%ld\\n\", du(open(\".\", 0)));\n return 0;\n}\n<|endoftext|>"} {"text":"<commit_before>\/\/\n\/\/ TreeView.cpp\n\/\/\n\/\/ Copyright (c) 2001 Virtual Terrain Project\n\/\/ Free for all uses, see license.txt for details.\n\/\/\n\n\/\/ For compilers that support precompilation, includes \"wx\/wx.h\".\n#include \"wx\/wxprec.h\"\n\n#ifdef _MSC_VER\n#pragma warning( disable : 4786 ) \n#endif\n\n#include \"vtlib\/vtlib.h\"\n\n#include \"App.h\"\n#include \"TreeView.h\"\n#include \"menu_id.h\"\n#include \"Frame.h\"\n\n#include \"vtdata\/Content.h\"\n#include \"vtdata\/vtLog.h\"\n\nDECLARE_APP(vtApp)\n\n\/\/ under Windows the icons are in the .rc file\n#ifndef __WXMSW__\n\t#include \"icon1.xpm\"\n\t#include \"icon2.xpm\"\n\t#include \"icon3.xpm\"\n\t#include \"icon4.xpm\"\n\t#include \"icon5.xpm\"\n\t#include \"mondrian.xpm\"\n#endif\n\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n\/\/ MyTreeCtrl implementation\n\nMyTreeCtrl::MyTreeCtrl(wxWindow *parent, const wxWindowID id,\n\t\t\t\t\t const wxPoint& pos, const wxSize& size,\n\t\t\t\t\t long style)\n\t\t : wxTreeCtrl(parent, id, pos, size, style)\n{\n\tm_imageListNormal = NULL;\n\tm_bUpdating = false;\n\n\tCreateImageList(16);\n\n\t\/\/ Add some items to the tree\n\tRefreshTreeItems(NULL);\n}\n\nvoid MyTreeCtrl::CreateImageList(int size)\n{\n\tdelete m_imageListNormal;\n\n\tif ( size == -1 )\n\t{\n\t\tm_imageListNormal = NULL;\n\t\treturn;\n\t}\n\n\t\/\/ Make an image list containing small icons\n\tm_imageListNormal = new wxImageList(size, size, TRUE);\n\n\t\/\/ should correspond to TreeCtrlIcon_xxx enum\n\twxIcon icons[5];\n\ticons[0] = wxICON(icon8);\n\ticons[1] = wxICON(icon4);\n\ticons[2] = wxICON(icon11);\n\ticons[3] = wxICON(icon3);\n\ticons[4] = wxICON(icon12);\n\n\tint sizeOrig = icons[0].GetWidth();\n\tfor ( size_t i = 0; i < WXSIZEOF(icons); i++ )\n\t{\n\t\tif ( size == sizeOrig )\n\t\t\tm_imageListNormal->Add(icons[i]);\n\t\telse\n\t\t\tm_imageListNormal->Add(wxBitmap(icons[i]).ConvertToImage().Rescale(size, size));\n\t}\n\n\tSetImageList(m_imageListNormal);\n}\n\nMyTreeCtrl::~MyTreeCtrl()\n{\n\tdelete m_imageListNormal;\n}\n\nwxTreeItemId rootId;\n\nvoid MyTreeCtrl::RefreshTreeItems(vtFrame *pFrame)\n{\n\tVTLOG(\" RefreshTreeItems\\n\");\n\n\tm_bUpdating = true;\n\n\tDeleteAllItems();\n\n\trootId = AddRoot(_T(\"Content\"), MyTreeCtrl::TreeCtrlIcon_Content);\n\tSetItemBold(rootId);\n\n\tif (!pFrame)\n\t{\n\t\tm_bUpdating = false;\n\t\treturn;\n\t}\n\n\tvtContentManager *pMan = &(pFrame->m_Man);\n\n\tunsigned int i, j;\n\twxString2 str, str2;\n\n\tunsigned int iItems = pMan->NumItems();\n\tfor (i = 0; i < iItems; i++)\n\t{\n\t\tvtItem *pItem = pMan->GetItem(i);\n\n\t\tstr = pItem->m_name;\n\n\t\twxTreeItemId hItem;\n\t\thItem = AppendItem(rootId, str, TreeCtrlIcon_Item, TreeCtrlIcon_ItemSelected);\n\n\t\tSetItemData(hItem, new MyTreeItemData(pItem));\n\n\t\tif (pItem == pFrame->m_pCurrentItem)\n\t\t\tSelectItem(hItem);\n\n\t\tfor (j = 0; j < pItem->NumModels(); j++)\n\t\t{\n\t\t\tvtModel *pModel = pItem->GetModel(j);\n\n\t\t\tstr = (const char *) pModel->m_filename;\n\t\t\tint tri_count = pFrame->GetModelTriCount(pModel);\n\t\t\tstr2.Printf(_T(\" (%d tris)\"), tri_count);\n\t\t\tstr += str2;\n\n\t\t\twxTreeItemId hItem2;\n\t\t\thItem2 = AppendItem(hItem, str, TreeCtrlIcon_Model, TreeCtrlIcon_ModelSelected);\n\n\t\t\tSetItemData(hItem2, new MyTreeItemData(pModel));\n\n\t\t\tif (pModel == pFrame->m_pCurrentModel)\n\t\t\t\tSelectItem(hItem2);\n\t\t}\n\t\tExpand(hItem);\n\t}\n\n\tExpand(rootId);\n\tm_bUpdating = false;\n}\n\nvoid MyTreeCtrl::RefreshTreeStatus(vtFrame *pFrame)\n{\n\tm_bUpdating = true;\n\n\twxTreeItemId root = GetRootItem();\n\twxTreeItemId parent, item;\n\tlong cookie = 0, cookie2 = 1;\n\n\tfor (parent = GetFirstChild(root, cookie); parent; parent = GetNextChild(root, cookie))\n\t{\n\t\tfor (item = GetFirstChild(parent, cookie2); item; item = GetNextChild(parent, cookie2))\n\t\t{\n\t\t\tMyTreeItemData *data = (MyTreeItemData *)GetItemData(item);\n\t\t\tif (data)\n\t\t\t{\n\t\t\t\tif (data->m_pItem == pFrame->m_pCurrentItem)\n\t\t\t\t\tSelectItem(item);\n\t\t\t\tif (data->m_pModel == pFrame->m_pCurrentModel)\n\t\t\t\t\tSelectItem(item);\n\t\t\t}\n\t\t}\n\t}\n\tm_bUpdating = false;\n}\n\n\/\/ avoid repetition\n#define TREE_EVENT_HANDLER(name)\t\t\t\\\nvoid MyTreeCtrl::name(wxTreeEvent& event)\t\\\n{\t\t\t\t\t\t\t\t\t\t\t\\\n \/*\twxLogMessage(#name); *\/\t\t\t\t\t\\\n\tevent.Skip();\t\t\t\t\t\t\t\\\n}\n\nTREE_EVENT_HANDLER(OnBeginRDrag)\nTREE_EVENT_HANDLER(OnDeleteItem)\nTREE_EVENT_HANDLER(OnGetInfo)\nTREE_EVENT_HANDLER(OnSetInfo)\nTREE_EVENT_HANDLER(OnItemExpanded)\nTREE_EVENT_HANDLER(OnItemExpanding)\nTREE_EVENT_HANDLER(OnItemCollapsed)\nTREE_EVENT_HANDLER(OnSelChanging)\nTREE_EVENT_HANDLER(OnTreeKeyDown)\n\n#undef TREE_EVENT_HANDLER\n\nvoid MyTreeCtrl::OnSelChanged(wxTreeEvent& event)\n{\n\t\/\/ don't inform the rest of the interface, if it's currently informing us\n\t\/\/ that's a bad feedback loop\n\tif (m_bUpdating)\n\t\treturn;\n\n\twxTreeItemId item = event.GetItem();\n\tif (!IsSelected(item))\n\t\treturn;\n\n\tbool bSelection = event.IsSelection();\n\n\tMyTreeItemData *data = (MyTreeItemData *)GetItemData(item);\n\tvtModel *mod = NULL;\n\tvtItem *ite = NULL;\n\tif (data)\n\t{\n\t\tmod = data->m_pModel;\n\t\tite = data->m_pItem;\n\t\tif (mod)\n\t\t{\n\t\t\twxTreeItemId pitem = GetItemParent(item);\n\t\t\tdata = (MyTreeItemData *)GetItemData(pitem);\n\t\t\tite = data->m_pItem;\n\t\t}\n\t}\n\n\tGetMainFrame()->SetCurrentItemAndModel(ite, mod);\n}\n\nvoid MyTreeCtrl::OnBeginDrag(wxTreeEvent& event)\n{\n}\n\nvoid MyTreeCtrl::OnEndDrag(wxTreeEvent& event)\n{\n}\n\nvoid MyTreeCtrl::OnBeginLabelEdit(wxTreeEvent& event)\n{\n\tVTLOG(\"OnBeginLabelEdit\\n\");\n\n\t\/\/ If not an item prevent this items label editing\n\twxTreeItemId itemId = event.GetItem();\n\tMyTreeItemData *data = (MyTreeItemData *)GetItemData(itemId);\n\tif (data != NULL && data->m_pItem != NULL && data->m_pModel == NULL)\n\t{\n\t\t\/\/ allow edit\n\t}\n\telse\n\t{\n\t\tVTLOG(\"You can't edit this item.\\n\");\n\t\tevent.Veto();\n\t}\n}\n\nvoid MyTreeCtrl::OnEndLabelEdit(wxTreeEvent& event)\n{\n\tVTLOG(\"OnEndLabelEdit\\n\");\n\n\twxString2 result = event.GetLabel();\n\twxTreeItemId itemId = event.GetItem();\n\tMyTreeItemData *data = (MyTreeItemData *)GetItemData(itemId);\n\tif (data != NULL && data->m_pItem != NULL)\n\t{\n\/\/\t\tRefreshTreeStatus(frame);\t\/\/ no need; tree already updated\n\t\tGetMainFrame()->SetItemName(data->m_pItem, result.vt_str());\n\t}\n}\n\nvoid MyTreeCtrl::OnItemCollapsing(wxTreeEvent& event)\n{\n#if 0\n\twxLogMessage(\"OnItemCollapsing\");\n\n\t\/\/ for testing, prevent the user from collapsing the first child folder\n\twxTreeItemId itemId = event.GetItem();\n\tif ( IsTestItem(itemId) )\n\t{\n\t\twxMessageBox(\"You can't collapse this item.\");\n\n\t\tevent.Veto();\n\t}\n#endif\n}\n\nvoid MyTreeCtrl::OnItemActivated(wxTreeEvent& event)\n{\n#if 0\n\t\/\/ show some info about this item\n\twxTreeItemId itemId = event.GetItem();\n\tMyTreeItemData *item = (MyTreeItemData *)GetItemData(itemId);\n\n\tif ( item != NULL )\n\t{\n\t\titem->ShowInfo(this);\n\t}\n\twxLogMessage(\"OnItemActivated\");\n#endif\n}\n\nvoid MyTreeCtrl::OnRMouseDClick(wxMouseEvent& event)\n{\n#if 0\n\twxTreeItemId id = HitTest(event.GetPosition());\n\tif ( !id )\n\t\twxLogMessage(\"No item under mouse\");\n\telse\n\t{\n\t\tMyTreeItemData *item = (MyTreeItemData *)GetItemData(id);\n\t\tif ( item )\n\t\t\twxLogMessage(\"Item '%s' under mouse\", item->GetDesc());\n\t}\n#endif\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nBEGIN_EVENT_TABLE(MyTreeCtrl, wxTreeCtrl)\n\tEVT_TREE_BEGIN_DRAG(ID_TREECTRL, MyTreeCtrl::OnBeginDrag)\n\tEVT_TREE_BEGIN_RDRAG(ID_TREECTRL, MyTreeCtrl::OnBeginRDrag)\n\tEVT_TREE_END_DRAG(ID_TREECTRL, MyTreeCtrl::OnEndDrag)\n\tEVT_TREE_BEGIN_LABEL_EDIT(ID_TREECTRL, MyTreeCtrl::OnBeginLabelEdit)\n\tEVT_TREE_END_LABEL_EDIT(ID_TREECTRL, MyTreeCtrl::OnEndLabelEdit)\n\tEVT_TREE_DELETE_ITEM(ID_TREECTRL, MyTreeCtrl::OnDeleteItem)\n\tEVT_TREE_SET_INFO(ID_TREECTRL, MyTreeCtrl::OnSetInfo)\n\tEVT_TREE_ITEM_EXPANDED(ID_TREECTRL, MyTreeCtrl::OnItemExpanded)\n\tEVT_TREE_ITEM_EXPANDING(ID_TREECTRL, MyTreeCtrl::OnItemExpanding)\n\tEVT_TREE_ITEM_COLLAPSED(ID_TREECTRL, MyTreeCtrl::OnItemCollapsed)\n\tEVT_TREE_ITEM_COLLAPSING(ID_TREECTRL, MyTreeCtrl::OnItemCollapsing)\n\tEVT_TREE_SEL_CHANGED(ID_TREECTRL, MyTreeCtrl::OnSelChanged)\n\tEVT_TREE_SEL_CHANGING(ID_TREECTRL, MyTreeCtrl::OnSelChanging)\n\tEVT_TREE_KEY_DOWN(ID_TREECTRL, MyTreeCtrl::OnTreeKeyDown)\n\tEVT_TREE_ITEM_ACTIVATED(ID_TREECTRL, MyTreeCtrl::OnItemActivated)\n\tEVT_RIGHT_DCLICK(MyTreeCtrl::OnRMouseDClick)\nEND_EVENT_TABLE()\n\n<commit_msg>remove unused tricount display<commit_after>\/\/\n\/\/ TreeView.cpp\n\/\/\n\/\/ Copyright (c) 2001 Virtual Terrain Project\n\/\/ Free for all uses, see license.txt for details.\n\/\/\n\n\/\/ For compilers that support precompilation, includes \"wx\/wx.h\".\n#include \"wx\/wxprec.h\"\n\n#ifdef _MSC_VER\n#pragma warning( disable : 4786 ) \n#endif\n\n#include \"vtlib\/vtlib.h\"\n\n#include \"App.h\"\n#include \"TreeView.h\"\n#include \"menu_id.h\"\n#include \"Frame.h\"\n\n#include \"vtdata\/Content.h\"\n#include \"vtdata\/vtLog.h\"\n\nDECLARE_APP(vtApp)\n\n\/\/ under Windows the icons are in the .rc file\n#ifndef __WXMSW__\n\t#include \"icon1.xpm\"\n\t#include \"icon2.xpm\"\n\t#include \"icon3.xpm\"\n\t#include \"icon4.xpm\"\n\t#include \"icon5.xpm\"\n\t#include \"mondrian.xpm\"\n#endif\n\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n\/\/ MyTreeCtrl implementation\n\nMyTreeCtrl::MyTreeCtrl(wxWindow *parent, const wxWindowID id,\n\t\t\t\t\t const wxPoint& pos, const wxSize& size,\n\t\t\t\t\t long style)\n\t\t : wxTreeCtrl(parent, id, pos, size, style)\n{\n\tm_imageListNormal = NULL;\n\tm_bUpdating = false;\n\n\tCreateImageList(16);\n\n\t\/\/ Add some items to the tree\n\tRefreshTreeItems(NULL);\n}\n\nvoid MyTreeCtrl::CreateImageList(int size)\n{\n\tdelete m_imageListNormal;\n\n\tif ( size == -1 )\n\t{\n\t\tm_imageListNormal = NULL;\n\t\treturn;\n\t}\n\n\t\/\/ Make an image list containing small icons\n\tm_imageListNormal = new wxImageList(size, size, TRUE);\n\n\t\/\/ should correspond to TreeCtrlIcon_xxx enum\n\twxIcon icons[5];\n\ticons[0] = wxICON(icon8);\n\ticons[1] = wxICON(icon4);\n\ticons[2] = wxICON(icon11);\n\ticons[3] = wxICON(icon3);\n\ticons[4] = wxICON(icon12);\n\n\tint sizeOrig = icons[0].GetWidth();\n\tfor ( size_t i = 0; i < WXSIZEOF(icons); i++ )\n\t{\n\t\tif ( size == sizeOrig )\n\t\t\tm_imageListNormal->Add(icons[i]);\n\t\telse\n\t\t\tm_imageListNormal->Add(wxBitmap(icons[i]).ConvertToImage().Rescale(size, size));\n\t}\n\n\tSetImageList(m_imageListNormal);\n}\n\nMyTreeCtrl::~MyTreeCtrl()\n{\n\tdelete m_imageListNormal;\n}\n\nwxTreeItemId rootId;\n\nvoid MyTreeCtrl::RefreshTreeItems(vtFrame *pFrame)\n{\n\tVTLOG(\" RefreshTreeItems\\n\");\n\n\tm_bUpdating = true;\n\n\tDeleteAllItems();\n\n\trootId = AddRoot(_T(\"Content\"), MyTreeCtrl::TreeCtrlIcon_Content);\n\tSetItemBold(rootId);\n\n\tif (!pFrame)\n\t{\n\t\tm_bUpdating = false;\n\t\treturn;\n\t}\n\n\tvtContentManager *pMan = &(pFrame->m_Man);\n\n\tunsigned int i, j;\n\twxString2 str, str2;\n\n\tunsigned int iItems = pMan->NumItems();\n\tfor (i = 0; i < iItems; i++)\n\t{\n\t\tvtItem *pItem = pMan->GetItem(i);\n\n\t\tstr = pItem->m_name;\n\n\t\twxTreeItemId hItem;\n\t\thItem = AppendItem(rootId, str, TreeCtrlIcon_Item, TreeCtrlIcon_ItemSelected);\n\n\t\tSetItemData(hItem, new MyTreeItemData(pItem));\n\n\t\tif (pItem == pFrame->m_pCurrentItem)\n\t\t\tSelectItem(hItem);\n\n\t\tfor (j = 0; j < pItem->NumModels(); j++)\n\t\t{\n\t\t\tvtModel *pModel = pItem->GetModel(j);\n\n\t\t\tstr = (const char *) pModel->m_filename;\n\n\t\t\twxTreeItemId hItem2;\n\t\t\thItem2 = AppendItem(hItem, str, TreeCtrlIcon_Model, TreeCtrlIcon_ModelSelected);\n\n\t\t\tSetItemData(hItem2, new MyTreeItemData(pModel));\n\n\t\t\tif (pModel == pFrame->m_pCurrentModel)\n\t\t\t\tSelectItem(hItem2);\n\t\t}\n\t\tExpand(hItem);\n\t}\n\n\tExpand(rootId);\n\tm_bUpdating = false;\n}\n\nvoid MyTreeCtrl::RefreshTreeStatus(vtFrame *pFrame)\n{\n\tm_bUpdating = true;\n\n\twxTreeItemId root = GetRootItem();\n\twxTreeItemId parent, item;\n\tlong cookie = 0, cookie2 = 1;\n\n\tfor (parent = GetFirstChild(root, cookie); parent; parent = GetNextChild(root, cookie))\n\t{\n\t\tfor (item = GetFirstChild(parent, cookie2); item; item = GetNextChild(parent, cookie2))\n\t\t{\n\t\t\tMyTreeItemData *data = (MyTreeItemData *)GetItemData(item);\n\t\t\tif (data)\n\t\t\t{\n\t\t\t\tif (data->m_pItem == pFrame->m_pCurrentItem)\n\t\t\t\t\tSelectItem(item);\n\t\t\t\tif (data->m_pModel == pFrame->m_pCurrentModel)\n\t\t\t\t\tSelectItem(item);\n\t\t\t}\n\t\t}\n\t}\n\tm_bUpdating = false;\n}\n\n\/\/ avoid repetition\n#define TREE_EVENT_HANDLER(name)\t\t\t\\\nvoid MyTreeCtrl::name(wxTreeEvent& event)\t\\\n{\t\t\t\t\t\t\t\t\t\t\t\\\n \/*\twxLogMessage(#name); *\/\t\t\t\t\t\\\n\tevent.Skip();\t\t\t\t\t\t\t\\\n}\n\nTREE_EVENT_HANDLER(OnBeginRDrag)\nTREE_EVENT_HANDLER(OnDeleteItem)\nTREE_EVENT_HANDLER(OnGetInfo)\nTREE_EVENT_HANDLER(OnSetInfo)\nTREE_EVENT_HANDLER(OnItemExpanded)\nTREE_EVENT_HANDLER(OnItemExpanding)\nTREE_EVENT_HANDLER(OnItemCollapsed)\nTREE_EVENT_HANDLER(OnSelChanging)\nTREE_EVENT_HANDLER(OnTreeKeyDown)\n\n#undef TREE_EVENT_HANDLER\n\nvoid MyTreeCtrl::OnSelChanged(wxTreeEvent& event)\n{\n\t\/\/ don't inform the rest of the interface, if it's currently informing us\n\t\/\/ that's a bad feedback loop\n\tif (m_bUpdating)\n\t\treturn;\n\n\twxTreeItemId item = event.GetItem();\n\tif (!IsSelected(item))\n\t\treturn;\n\n\tbool bSelection = event.IsSelection();\n\n\tMyTreeItemData *data = (MyTreeItemData *)GetItemData(item);\n\tvtModel *mod = NULL;\n\tvtItem *ite = NULL;\n\tif (data)\n\t{\n\t\tmod = data->m_pModel;\n\t\tite = data->m_pItem;\n\t\tif (mod)\n\t\t{\n\t\t\twxTreeItemId pitem = GetItemParent(item);\n\t\t\tdata = (MyTreeItemData *)GetItemData(pitem);\n\t\t\tite = data->m_pItem;\n\t\t}\n\t}\n\n\tGetMainFrame()->SetCurrentItemAndModel(ite, mod);\n}\n\nvoid MyTreeCtrl::OnBeginDrag(wxTreeEvent& event)\n{\n}\n\nvoid MyTreeCtrl::OnEndDrag(wxTreeEvent& event)\n{\n}\n\nvoid MyTreeCtrl::OnBeginLabelEdit(wxTreeEvent& event)\n{\n\tVTLOG(\"OnBeginLabelEdit\\n\");\n\n\t\/\/ If not an item prevent this items label editing\n\twxTreeItemId itemId = event.GetItem();\n\tMyTreeItemData *data = (MyTreeItemData *)GetItemData(itemId);\n\tif (data != NULL && data->m_pItem != NULL && data->m_pModel == NULL)\n\t{\n\t\t\/\/ allow edit\n\t}\n\telse\n\t{\n\t\tVTLOG(\"You can't edit this item.\\n\");\n\t\tevent.Veto();\n\t}\n}\n\nvoid MyTreeCtrl::OnEndLabelEdit(wxTreeEvent& event)\n{\n\tVTLOG(\"OnEndLabelEdit\\n\");\n\n\twxString2 result = event.GetLabel();\n\twxTreeItemId itemId = event.GetItem();\n\tMyTreeItemData *data = (MyTreeItemData *)GetItemData(itemId);\n\tif (data != NULL && data->m_pItem != NULL)\n\t{\n\/\/\t\tRefreshTreeStatus(frame);\t\/\/ no need; tree already updated\n\t\tGetMainFrame()->SetItemName(data->m_pItem, result.vt_str());\n\t}\n}\n\nvoid MyTreeCtrl::OnItemCollapsing(wxTreeEvent& event)\n{\n#if 0\n\twxLogMessage(\"OnItemCollapsing\");\n\n\t\/\/ for testing, prevent the user from collapsing the first child folder\n\twxTreeItemId itemId = event.GetItem();\n\tif ( IsTestItem(itemId) )\n\t{\n\t\twxMessageBox(\"You can't collapse this item.\");\n\n\t\tevent.Veto();\n\t}\n#endif\n}\n\nvoid MyTreeCtrl::OnItemActivated(wxTreeEvent& event)\n{\n#if 0\n\t\/\/ show some info about this item\n\twxTreeItemId itemId = event.GetItem();\n\tMyTreeItemData *item = (MyTreeItemData *)GetItemData(itemId);\n\n\tif ( item != NULL )\n\t{\n\t\titem->ShowInfo(this);\n\t}\n\twxLogMessage(\"OnItemActivated\");\n#endif\n}\n\nvoid MyTreeCtrl::OnRMouseDClick(wxMouseEvent& event)\n{\n#if 0\n\twxTreeItemId id = HitTest(event.GetPosition());\n\tif ( !id )\n\t\twxLogMessage(\"No item under mouse\");\n\telse\n\t{\n\t\tMyTreeItemData *item = (MyTreeItemData *)GetItemData(id);\n\t\tif ( item )\n\t\t\twxLogMessage(\"Item '%s' under mouse\", item->GetDesc());\n\t}\n#endif\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nBEGIN_EVENT_TABLE(MyTreeCtrl, wxTreeCtrl)\n\tEVT_TREE_BEGIN_DRAG(ID_TREECTRL, MyTreeCtrl::OnBeginDrag)\n\tEVT_TREE_BEGIN_RDRAG(ID_TREECTRL, MyTreeCtrl::OnBeginRDrag)\n\tEVT_TREE_END_DRAG(ID_TREECTRL, MyTreeCtrl::OnEndDrag)\n\tEVT_TREE_BEGIN_LABEL_EDIT(ID_TREECTRL, MyTreeCtrl::OnBeginLabelEdit)\n\tEVT_TREE_END_LABEL_EDIT(ID_TREECTRL, MyTreeCtrl::OnEndLabelEdit)\n\tEVT_TREE_DELETE_ITEM(ID_TREECTRL, MyTreeCtrl::OnDeleteItem)\n\tEVT_TREE_SET_INFO(ID_TREECTRL, MyTreeCtrl::OnSetInfo)\n\tEVT_TREE_ITEM_EXPANDED(ID_TREECTRL, MyTreeCtrl::OnItemExpanded)\n\tEVT_TREE_ITEM_EXPANDING(ID_TREECTRL, MyTreeCtrl::OnItemExpanding)\n\tEVT_TREE_ITEM_COLLAPSED(ID_TREECTRL, MyTreeCtrl::OnItemCollapsed)\n\tEVT_TREE_ITEM_COLLAPSING(ID_TREECTRL, MyTreeCtrl::OnItemCollapsing)\n\tEVT_TREE_SEL_CHANGED(ID_TREECTRL, MyTreeCtrl::OnSelChanged)\n\tEVT_TREE_SEL_CHANGING(ID_TREECTRL, MyTreeCtrl::OnSelChanging)\n\tEVT_TREE_KEY_DOWN(ID_TREECTRL, MyTreeCtrl::OnTreeKeyDown)\n\tEVT_TREE_ITEM_ACTIVATED(ID_TREECTRL, MyTreeCtrl::OnItemActivated)\n\tEVT_RIGHT_DCLICK(MyTreeCtrl::OnRMouseDClick)\nEND_EVENT_TABLE()\n\n<|endoftext|>"} {"text":"<commit_before>\/**************************************************************************\n**\n** This file is part of Qt Creator\n**\n** Copyright (c) 2012 Nokia Corporation and\/or its subsidiary(-ies).\n**\n** Contact: http:\/\/www.qt-project.org\/\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**\n**************************************************************************\/\n\n#include \"cpphighlighter.h\"\n#include <cpptools\/cppdoxygen.h>\n\n#include <Token.h>\n#include <cplusplus\/SimpleLexer.h>\n#include <cpptools\/cpptoolsreuse.h>\n#include <texteditor\/basetextdocumentlayout.h>\n\n#include <QTextDocument>\n#include <QDebug>\n\nusing namespace CppEditor::Internal;\nusing namespace TextEditor;\nusing namespace CPlusPlus;\n\nCppHighlighter::CppHighlighter(QTextDocument *document) :\n TextEditor::SyntaxHighlighter(document)\n{\n}\n\nvoid CppHighlighter::highlightBlock(const QString &text)\n{\n const int previousState = previousBlockState();\n int state = 0, initialBraceDepth = 0;\n if (previousState != -1) {\n state = previousState & 0xff;\n initialBraceDepth = previousState >> 8;\n }\n\n int braceDepth = initialBraceDepth;\n\n SimpleLexer tokenize;\n tokenize.setQtMocRunEnabled(false);\n tokenize.setObjCEnabled(false);\n tokenize.setCxx0xEnabled(true);\n\n int initialState = state;\n const QList<Token> tokens = tokenize(text, initialState);\n state = tokenize.state(); \/\/ refresh the state\n\n int foldingIndent = initialBraceDepth;\n if (TextBlockUserData *userData = BaseTextDocumentLayout::testUserData(currentBlock())) {\n userData->setFoldingIndent(0);\n userData->setFoldingStartIncluded(false);\n userData->setFoldingEndIncluded(false);\n }\n\n if (tokens.isEmpty()) {\n setCurrentBlockState(previousState);\n BaseTextDocumentLayout::clearParentheses(currentBlock());\n if (text.length()) {\/\/ the empty line can still contain whitespace\n if (!initialState)\n setFormat(0, text.length(), m_formats[CppVisualWhitespace]);\n else\n setFormat(0, text.length(), m_formats[CppCommentFormat]);\n }\n BaseTextDocumentLayout::setFoldingIndent(currentBlock(), foldingIndent);\n return;\n }\n\n const unsigned firstNonSpace = tokens.first().begin();\n\n Parentheses parentheses;\n parentheses.reserve(20); \/\/ assume wizard level ;-)\n\n bool expectPreprocessorKeyword = false;\n bool onlyHighlightComments = false;\n\n for (int i = 0; i < tokens.size(); ++i) {\n const Token &tk = tokens.at(i);\n\n unsigned previousTokenEnd = 0;\n if (i != 0) {\n \/\/ mark the whitespaces\n previousTokenEnd = tokens.at(i - 1).begin() +\n tokens.at(i - 1).length();\n }\n\n if (previousTokenEnd != tk.begin()) {\n if (initialState && tk.isComment())\n setFormat(previousTokenEnd, tk.begin() - previousTokenEnd, m_formats[CppCommentFormat]);\n else\n setFormat(previousTokenEnd, tk.begin() - previousTokenEnd, m_formats[CppVisualWhitespace]);\n }\n\n if (tk.is(T_LPAREN) || tk.is(T_LBRACE) || tk.is(T_LBRACKET)) {\n const QChar c = text.at(tk.begin());\n parentheses.append(Parenthesis(Parenthesis::Opened, c, tk.begin()));\n if (tk.is(T_LBRACE)) {\n ++braceDepth;\n\n \/\/ if a folding block opens at the beginning of a line, treat the entire line\n \/\/ as if it were inside the folding block\n if (tk.begin() == firstNonSpace) {\n ++foldingIndent;\n BaseTextDocumentLayout::userData(currentBlock())->setFoldingStartIncluded(true);\n }\n }\n } else if (tk.is(T_RPAREN) || tk.is(T_RBRACE) || tk.is(T_RBRACKET)) {\n const QChar c = text.at(tk.begin());\n parentheses.append(Parenthesis(Parenthesis::Closed, c, tk.begin()));\n if (tk.is(T_RBRACE)) {\n --braceDepth;\n if (braceDepth < foldingIndent) {\n \/\/ unless we are at the end of the block, we reduce the folding indent\n if (i == tokens.size()-1 || tokens.at(i+1).is(T_SEMICOLON))\n BaseTextDocumentLayout::userData(currentBlock())->setFoldingEndIncluded(true);\n else\n foldingIndent = qMin(braceDepth, foldingIndent);\n }\n }\n }\n\n bool highlightCurrentWordAsPreprocessor = expectPreprocessorKeyword;\n\n if (expectPreprocessorKeyword)\n expectPreprocessorKeyword = false;\n\n if (onlyHighlightComments && !tk.isComment())\n continue;\n\n if (i == 0 && tk.is(T_POUND)) {\n highlightLine(text, tk.begin(), tk.length(), m_formats[CppPreprocessorFormat]);\n expectPreprocessorKeyword = true;\n } else if (highlightCurrentWordAsPreprocessor &&\n (tk.isKeyword() || tk.is(T_IDENTIFIER)) && isPPKeyword(text.midRef(tk.begin(), tk.length()))) {\n setFormat(tk.begin(), tk.length(), m_formats[CppPreprocessorFormat]);\n const QStringRef ppKeyword = text.midRef(tk.begin(), tk.length());\n if (ppKeyword == QLatin1String(\"error\")\n || ppKeyword == QLatin1String(\"warning\")\n || ppKeyword == QLatin1String(\"pragma\")) {\n onlyHighlightComments = true;\n }\n\n } else if (tk.is(T_NUMERIC_LITERAL))\n setFormat(tk.begin(), tk.length(), m_formats[CppNumberFormat]);\n\n else if (tk.isStringLiteral() || tk.isCharLiteral())\n setFormat(tk.begin(), tk.length(), m_formats[CppStringFormat]);\n\n else if (tk.isComment()) {\n if (tk.is(T_COMMENT) || tk.is(T_CPP_COMMENT))\n setFormat(tk.begin(), tk.length(), m_formats[CppCommentFormat]);\n\n else \/\/ a doxygen comment\n highlightDoxygenComment(text, tk.begin(), tk.length());\n\n \/\/ we need to insert a close comment parenthesis, if\n \/\/ - the line starts in a C Comment (initalState != 0)\n \/\/ - the first token of the line is a T_COMMENT (i == 0 && tk.is(T_COMMENT))\n \/\/ - is not a continuation line (tokens.size() > 1 || ! state)\n if (initialState && i == 0 && (tokens.size() > 1 || ! state)) {\n --braceDepth;\n \/\/ unless we are at the end of the block, we reduce the folding indent\n if (i == tokens.size()-1)\n BaseTextDocumentLayout::userData(currentBlock())->setFoldingEndIncluded(true);\n else\n foldingIndent = qMin(braceDepth, foldingIndent);\n const int tokenEnd = tk.begin() + tk.length() - 1;\n parentheses.append(Parenthesis(Parenthesis::Closed, QLatin1Char('-'), tokenEnd));\n\n \/\/ clear the initial state.\n initialState = 0;\n }\n\n } else if (tk.isKeyword() || CppTools::isQtKeyword(text.midRef(tk.begin(), tk.length())) || tk.isObjCAtKeyword())\n setFormat(tk.begin(), tk.length(), m_formats[CppKeywordFormat]);\n\n else if (tk.isOperator())\n setFormat(tk.begin(), tk.length(), m_formats[CppOperatorFormat]);\n\n else if (i == 0 && tokens.size() > 1 && tk.is(T_IDENTIFIER) && tokens.at(1).is(T_COLON))\n setFormat(tk.begin(), tk.length(), m_formats[CppLabelFormat]);\n\n else if (tk.is(T_IDENTIFIER))\n highlightWord(text.midRef(tk.begin(), tk.length()), tk.begin(), tk.length());\n\n }\n\n \/\/ mark the trailing white spaces\n {\n const Token tk = tokens.last();\n const int lastTokenEnd = tk.begin() + tk.length();\n if (text.length() > lastTokenEnd)\n highlightLine(text, lastTokenEnd, text.length() - lastTokenEnd, QTextCharFormat());\n }\n\n if (! initialState && state && ! tokens.isEmpty()) {\n parentheses.append(Parenthesis(Parenthesis::Opened, QLatin1Char('+'),\n tokens.last().begin()));\n ++braceDepth;\n }\n\n BaseTextDocumentLayout::setParentheses(currentBlock(), parentheses);\n\n \/\/ if the block is ifdefed out, we only store the parentheses, but\n\n \/\/ do not adjust the brace depth.\n if (BaseTextDocumentLayout::ifdefedOut(currentBlock())) {\n braceDepth = initialBraceDepth;\n foldingIndent = initialBraceDepth;\n }\n\n BaseTextDocumentLayout::setFoldingIndent(currentBlock(), foldingIndent);\n\n \/\/ optimization: if only the brace depth changes, we adjust subsequent blocks\n \/\/ to have QSyntaxHighlighter stop the rehighlighting\n int currentState = currentBlockState();\n if (currentState != -1) {\n int oldState = currentState & 0xff;\n int oldBraceDepth = currentState >> 8;\n if (oldState == tokenize.state() && oldBraceDepth != braceDepth) {\n BaseTextDocumentLayout::FoldValidator foldValidor;\n foldValidor.setup(qobject_cast<BaseTextDocumentLayout *>(document()->documentLayout()));\n int delta = braceDepth - oldBraceDepth;\n QTextBlock block = currentBlock().next();\n while (block.isValid() && block.userState() != -1) {\n BaseTextDocumentLayout::changeBraceDepth(block, delta);\n BaseTextDocumentLayout::changeFoldingIndent(block, delta);\n foldValidor.process(block);\n block = block.next();\n }\n foldValidor.finalize();\n }\n }\n\n setCurrentBlockState((braceDepth << 8) | tokenize.state());\n}\n\n\nbool CppHighlighter::isPPKeyword(const QStringRef &text) const\n{\n switch (text.length())\n {\n case 2:\n if (text.at(0) == QLatin1Char('i') && text.at(1) == QLatin1Char('f'))\n return true;\n break;\n\n case 4:\n if (text.at(0) == QLatin1Char('e')\n && (text == QLatin1String(\"elif\") || text == QLatin1String(\"else\")))\n return true;\n break;\n\n case 5:\n switch (text.at(0).toLatin1()) {\n case 'i':\n if (text == QLatin1String(\"ifdef\"))\n return true;\n break;\n case 'u':\n if (text == QLatin1String(\"undef\"))\n return true;\n break;\n case 'e':\n if (text == QLatin1String(\"endif\") || text == QLatin1String(\"error\"))\n return true;\n break;\n }\n break;\n\n case 6:\n switch (text.at(0).toLatin1()) {\n case 'i':\n if (text == QLatin1String(\"ifndef\") || text == QLatin1String(\"import\"))\n return true;\n break;\n case 'd':\n if (text == QLatin1String(\"define\"))\n return true;\n break;\n case 'p':\n if (text == QLatin1String(\"pragma\"))\n return true;\n break;\n }\n break;\n\n case 7:\n switch (text.at(0).toLatin1()) {\n case 'i':\n if (text == QLatin1String(\"include\"))\n return true;\n break;\n case 'w':\n if (text == QLatin1String(\"warning\"))\n return true;\n break;\n }\n break;\n\n case 12:\n if (text.at(0) == QLatin1Char('i') && text == QLatin1String(\"include_next\"))\n return true;\n break;\n\n default:\n break;\n }\n\n return false;\n}\n\nvoid CppHighlighter::highlightLine(const QString &text, int position, int length,\n const QTextCharFormat &format)\n{\n const QTextCharFormat visualSpaceFormat = m_formats[CppVisualWhitespace];\n\n const int end = position + length;\n int index = position;\n\n while (index != end) {\n const bool isSpace = text.at(index).isSpace();\n const int start = index;\n\n do { ++index; }\n while (index != end && text.at(index).isSpace() == isSpace);\n\n const int tokenLength = index - start;\n if (isSpace)\n setFormat(start, tokenLength, visualSpaceFormat);\n else if (format.isValid())\n setFormat(start, tokenLength, format);\n }\n}\n\nvoid CppHighlighter::highlightWord(QStringRef word, int position, int length)\n{\n \/\/ try to highlight Qt 'identifiers' like QObject and Q_PROPERTY\n\n if (word.length() > 2 && word.at(0) == QLatin1Char('Q')) {\n if (word.at(1) == QLatin1Char('_') \/\/ Q_\n || (word.at(1) == QLatin1Char('T') && word.at(2) == QLatin1Char('_'))) { \/\/ QT_\n for (int i = 1; i < word.length(); ++i) {\n const QChar &ch = word.at(i);\n if (! (ch.isUpper() || ch == QLatin1Char('_')))\n return;\n }\n\n setFormat(position, length, m_formats[CppTypeFormat]);\n }\n }\n}\n\nvoid CppHighlighter::highlightDoxygenComment(const QString &text, int position, int)\n{\n int initial = position;\n\n const QChar *uc = text.unicode();\n const QChar *it = uc + position;\n\n const QTextCharFormat &format = m_formats[CppDoxygenCommentFormat];\n const QTextCharFormat &kwFormat = m_formats[CppDoxygenTagFormat];\n\n while (! it->isNull()) {\n if (it->unicode() == QLatin1Char('\\\\') ||\n it->unicode() == QLatin1Char('@')) {\n ++it;\n\n const QChar *start = it;\n while (it->isLetterOrNumber() || it->unicode() == '_')\n ++it;\n\n int k = CppTools::classifyDoxygenTag(start, it - start);\n if (k != CppTools::T_DOXY_IDENTIFIER) {\n highlightLine(text, initial, start - uc - initial, format);\n setFormat(start - uc - 1, it - start + 1, kwFormat);\n initial = it - uc;\n }\n } else\n ++it;\n }\n\n highlightLine(text, initial, it - uc - initial, format);\n}\n\n<commit_msg>Editor: Fix visual whitespace highlighting<commit_after>\/**************************************************************************\n**\n** This file is part of Qt Creator\n**\n** Copyright (c) 2012 Nokia Corporation and\/or its subsidiary(-ies).\n**\n** Contact: http:\/\/www.qt-project.org\/\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**\n**************************************************************************\/\n\n#include \"cpphighlighter.h\"\n\n#include <Token.h>\n#include <cplusplus\/SimpleLexer.h>\n#include <cplusplus\/Lexer.h>\n#include <cpptools\/cppdoxygen.h>\n#include <cpptools\/cpptoolsreuse.h>\n#include <texteditor\/basetextdocumentlayout.h>\n\n#include <QTextDocument>\n#include <QDebug>\n\nusing namespace CppEditor::Internal;\nusing namespace TextEditor;\nusing namespace CPlusPlus;\n\nCppHighlighter::CppHighlighter(QTextDocument *document) :\n TextEditor::SyntaxHighlighter(document)\n{\n}\n\nvoid CppHighlighter::highlightBlock(const QString &text)\n{\n const int previousState = previousBlockState();\n int state = 0, initialBraceDepth = 0;\n if (previousState != -1) {\n state = previousState & 0xff;\n initialBraceDepth = previousState >> 8;\n }\n\n int braceDepth = initialBraceDepth;\n\n SimpleLexer tokenize;\n tokenize.setQtMocRunEnabled(false);\n tokenize.setObjCEnabled(false);\n tokenize.setCxx0xEnabled(true);\n\n int initialState = state;\n const QList<Token> tokens = tokenize(text, initialState);\n state = tokenize.state(); \/\/ refresh the state\n\n int foldingIndent = initialBraceDepth;\n if (TextBlockUserData *userData = BaseTextDocumentLayout::testUserData(currentBlock())) {\n userData->setFoldingIndent(0);\n userData->setFoldingStartIncluded(false);\n userData->setFoldingEndIncluded(false);\n }\n\n if (tokens.isEmpty()) {\n setCurrentBlockState(previousState);\n BaseTextDocumentLayout::clearParentheses(currentBlock());\n if (text.length()) {\/\/ the empty line can still contain whitespace\n if (initialState == Lexer::State_MultiLineComment)\n highlightLine(text, 0, text.length(), m_formats[CppCommentFormat]);\n else if (initialState == Lexer::State_MultiLineDoxyComment)\n highlightLine(text, 0, text.length(), m_formats[CppDoxygenCommentFormat]);\n else\n setFormat(0, text.length(), m_formats[CppVisualWhitespace]);\n }\n BaseTextDocumentLayout::setFoldingIndent(currentBlock(), foldingIndent);\n return;\n }\n\n const unsigned firstNonSpace = tokens.first().begin();\n\n Parentheses parentheses;\n parentheses.reserve(20); \/\/ assume wizard level ;-)\n\n bool expectPreprocessorKeyword = false;\n bool onlyHighlightComments = false;\n\n for (int i = 0; i < tokens.size(); ++i) {\n const Token &tk = tokens.at(i);\n\n unsigned previousTokenEnd = 0;\n if (i != 0) {\n \/\/ mark the whitespaces\n previousTokenEnd = tokens.at(i - 1).begin() +\n tokens.at(i - 1).length();\n }\n\n if (previousTokenEnd != tk.begin())\n setFormat(previousTokenEnd, tk.begin() - previousTokenEnd, m_formats[CppVisualWhitespace]);\n\n if (tk.is(T_LPAREN) || tk.is(T_LBRACE) || tk.is(T_LBRACKET)) {\n const QChar c = text.at(tk.begin());\n parentheses.append(Parenthesis(Parenthesis::Opened, c, tk.begin()));\n if (tk.is(T_LBRACE)) {\n ++braceDepth;\n\n \/\/ if a folding block opens at the beginning of a line, treat the entire line\n \/\/ as if it were inside the folding block\n if (tk.begin() == firstNonSpace) {\n ++foldingIndent;\n BaseTextDocumentLayout::userData(currentBlock())->setFoldingStartIncluded(true);\n }\n }\n } else if (tk.is(T_RPAREN) || tk.is(T_RBRACE) || tk.is(T_RBRACKET)) {\n const QChar c = text.at(tk.begin());\n parentheses.append(Parenthesis(Parenthesis::Closed, c, tk.begin()));\n if (tk.is(T_RBRACE)) {\n --braceDepth;\n if (braceDepth < foldingIndent) {\n \/\/ unless we are at the end of the block, we reduce the folding indent\n if (i == tokens.size()-1 || tokens.at(i+1).is(T_SEMICOLON))\n BaseTextDocumentLayout::userData(currentBlock())->setFoldingEndIncluded(true);\n else\n foldingIndent = qMin(braceDepth, foldingIndent);\n }\n }\n }\n\n bool highlightCurrentWordAsPreprocessor = expectPreprocessorKeyword;\n\n if (expectPreprocessorKeyword)\n expectPreprocessorKeyword = false;\n\n if (onlyHighlightComments && !tk.isComment())\n continue;\n\n if (i == 0 && tk.is(T_POUND)) {\n highlightLine(text, tk.begin(), tk.length(), m_formats[CppPreprocessorFormat]);\n expectPreprocessorKeyword = true;\n } else if (highlightCurrentWordAsPreprocessor &&\n (tk.isKeyword() || tk.is(T_IDENTIFIER)) && isPPKeyword(text.midRef(tk.begin(), tk.length()))) {\n setFormat(tk.begin(), tk.length(), m_formats[CppPreprocessorFormat]);\n const QStringRef ppKeyword = text.midRef(tk.begin(), tk.length());\n if (ppKeyword == QLatin1String(\"error\")\n || ppKeyword == QLatin1String(\"warning\")\n || ppKeyword == QLatin1String(\"pragma\")) {\n onlyHighlightComments = true;\n }\n\n } else if (tk.is(T_NUMERIC_LITERAL))\n setFormat(tk.begin(), tk.length(), m_formats[CppNumberFormat]);\n\n else if (tk.isStringLiteral() || tk.isCharLiteral())\n highlightLine(text, tk.begin(), tk.length(), m_formats[CppStringFormat]);\n\n else if (tk.isComment()) {\n const int startPosition = initialState ? previousTokenEnd : tk.begin();\n if (tk.is(T_COMMENT) || tk.is(T_CPP_COMMENT))\n highlightLine(text, startPosition, tk.end() - startPosition, m_formats[CppCommentFormat]);\n\n else \/\/ a doxygen comment\n highlightDoxygenComment(text, startPosition, tk.end() - startPosition);\n\n \/\/ we need to insert a close comment parenthesis, if\n \/\/ - the line starts in a C Comment (initalState != 0)\n \/\/ - the first token of the line is a T_COMMENT (i == 0 && tk.is(T_COMMENT))\n \/\/ - is not a continuation line (tokens.size() > 1 || ! state)\n if (initialState && i == 0 && (tokens.size() > 1 || ! state)) {\n --braceDepth;\n \/\/ unless we are at the end of the block, we reduce the folding indent\n if (i == tokens.size()-1)\n BaseTextDocumentLayout::userData(currentBlock())->setFoldingEndIncluded(true);\n else\n foldingIndent = qMin(braceDepth, foldingIndent);\n const int tokenEnd = tk.begin() + tk.length() - 1;\n parentheses.append(Parenthesis(Parenthesis::Closed, QLatin1Char('-'), tokenEnd));\n\n \/\/ clear the initial state.\n initialState = 0;\n }\n\n } else if (tk.isKeyword() || CppTools::isQtKeyword(text.midRef(tk.begin(), tk.length())) || tk.isObjCAtKeyword())\n setFormat(tk.begin(), tk.length(), m_formats[CppKeywordFormat]);\n\n else if (tk.isOperator())\n setFormat(tk.begin(), tk.length(), m_formats[CppOperatorFormat]);\n\n else if (i == 0 && tokens.size() > 1 && tk.is(T_IDENTIFIER) && tokens.at(1).is(T_COLON))\n setFormat(tk.begin(), tk.length(), m_formats[CppLabelFormat]);\n\n else if (tk.is(T_IDENTIFIER))\n highlightWord(text.midRef(tk.begin(), tk.length()), tk.begin(), tk.length());\n\n }\n\n \/\/ mark the trailing white spaces\n const int lastTokenEnd = tokens.last().end();\n if (text.length() > lastTokenEnd)\n highlightLine(text, lastTokenEnd, text.length() - lastTokenEnd, m_formats[CppVisualWhitespace]);\n\n if (! initialState && state && ! tokens.isEmpty()) {\n parentheses.append(Parenthesis(Parenthesis::Opened, QLatin1Char('+'),\n tokens.last().begin()));\n ++braceDepth;\n }\n\n BaseTextDocumentLayout::setParentheses(currentBlock(), parentheses);\n\n \/\/ if the block is ifdefed out, we only store the parentheses, but\n\n \/\/ do not adjust the brace depth.\n if (BaseTextDocumentLayout::ifdefedOut(currentBlock())) {\n braceDepth = initialBraceDepth;\n foldingIndent = initialBraceDepth;\n }\n\n BaseTextDocumentLayout::setFoldingIndent(currentBlock(), foldingIndent);\n\n \/\/ optimization: if only the brace depth changes, we adjust subsequent blocks\n \/\/ to have QSyntaxHighlighter stop the rehighlighting\n int currentState = currentBlockState();\n if (currentState != -1) {\n int oldState = currentState & 0xff;\n int oldBraceDepth = currentState >> 8;\n if (oldState == tokenize.state() && oldBraceDepth != braceDepth) {\n BaseTextDocumentLayout::FoldValidator foldValidor;\n foldValidor.setup(qobject_cast<BaseTextDocumentLayout *>(document()->documentLayout()));\n int delta = braceDepth - oldBraceDepth;\n QTextBlock block = currentBlock().next();\n while (block.isValid() && block.userState() != -1) {\n BaseTextDocumentLayout::changeBraceDepth(block, delta);\n BaseTextDocumentLayout::changeFoldingIndent(block, delta);\n foldValidor.process(block);\n block = block.next();\n }\n foldValidor.finalize();\n }\n }\n\n setCurrentBlockState((braceDepth << 8) | tokenize.state());\n}\n\n\nbool CppHighlighter::isPPKeyword(const QStringRef &text) const\n{\n switch (text.length())\n {\n case 2:\n if (text.at(0) == QLatin1Char('i') && text.at(1) == QLatin1Char('f'))\n return true;\n break;\n\n case 4:\n if (text.at(0) == QLatin1Char('e')\n && (text == QLatin1String(\"elif\") || text == QLatin1String(\"else\")))\n return true;\n break;\n\n case 5:\n switch (text.at(0).toLatin1()) {\n case 'i':\n if (text == QLatin1String(\"ifdef\"))\n return true;\n break;\n case 'u':\n if (text == QLatin1String(\"undef\"))\n return true;\n break;\n case 'e':\n if (text == QLatin1String(\"endif\") || text == QLatin1String(\"error\"))\n return true;\n break;\n }\n break;\n\n case 6:\n switch (text.at(0).toLatin1()) {\n case 'i':\n if (text == QLatin1String(\"ifndef\") || text == QLatin1String(\"import\"))\n return true;\n break;\n case 'd':\n if (text == QLatin1String(\"define\"))\n return true;\n break;\n case 'p':\n if (text == QLatin1String(\"pragma\"))\n return true;\n break;\n }\n break;\n\n case 7:\n switch (text.at(0).toLatin1()) {\n case 'i':\n if (text == QLatin1String(\"include\"))\n return true;\n break;\n case 'w':\n if (text == QLatin1String(\"warning\"))\n return true;\n break;\n }\n break;\n\n case 12:\n if (text.at(0) == QLatin1Char('i') && text == QLatin1String(\"include_next\"))\n return true;\n break;\n\n default:\n break;\n }\n\n return false;\n}\n\nvoid CppHighlighter::highlightLine(const QString &text, int position, int length,\n const QTextCharFormat &format)\n{\n QTextCharFormat visualSpaceFormat = m_formats[CppVisualWhitespace];\n visualSpaceFormat.setBackground(format.background());\n\n const int end = position + length;\n int index = position;\n\n while (index != end) {\n const bool isSpace = text.at(index).isSpace();\n const int start = index;\n\n do { ++index; }\n while (index != end && text.at(index).isSpace() == isSpace);\n\n const int tokenLength = index - start;\n if (isSpace)\n setFormat(start, tokenLength, visualSpaceFormat);\n else if (format.isValid())\n setFormat(start, tokenLength, format);\n }\n}\n\nvoid CppHighlighter::highlightWord(QStringRef word, int position, int length)\n{\n \/\/ try to highlight Qt 'identifiers' like QObject and Q_PROPERTY\n\n if (word.length() > 2 && word.at(0) == QLatin1Char('Q')) {\n if (word.at(1) == QLatin1Char('_') \/\/ Q_\n || (word.at(1) == QLatin1Char('T') && word.at(2) == QLatin1Char('_'))) { \/\/ QT_\n for (int i = 1; i < word.length(); ++i) {\n const QChar &ch = word.at(i);\n if (! (ch.isUpper() || ch == QLatin1Char('_')))\n return;\n }\n\n setFormat(position, length, m_formats[CppTypeFormat]);\n }\n }\n}\n\nvoid CppHighlighter::highlightDoxygenComment(const QString &text, int position, int)\n{\n int initial = position;\n\n const QChar *uc = text.unicode();\n const QChar *it = uc + position;\n\n const QTextCharFormat &format = m_formats[CppDoxygenCommentFormat];\n const QTextCharFormat &kwFormat = m_formats[CppDoxygenTagFormat];\n\n while (! it->isNull()) {\n if (it->unicode() == QLatin1Char('\\\\') ||\n it->unicode() == QLatin1Char('@')) {\n ++it;\n\n const QChar *start = it;\n while (it->isLetterOrNumber() || it->unicode() == '_')\n ++it;\n\n int k = CppTools::classifyDoxygenTag(start, it - start);\n if (k != CppTools::T_DOXY_IDENTIFIER) {\n highlightLine(text, initial, start - uc - initial, format);\n setFormat(start - uc - 1, it - start + 1, kwFormat);\n initial = it - uc;\n }\n } else\n ++it;\n }\n\n highlightLine(text, initial, it - uc - initial, format);\n}\n\n<|endoftext|>"} {"text":"<commit_before>\/*\n\nCopyright (c) 2014 Harm Hanemaaijer <fgenfb@yahoo.com>\n\nPermission to use, copy, modify, and\/or distribute this software for any\npurpose with or without fee is hereby granted, provided that the above\ncopyright notice and this permission notice appear in all copies.\n\nTHE SOFTWARE IS PROVIDED \"AS IS\" AND THE AUTHOR DISCLAIMS ALL WARRANTIES\nWITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF\nMERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR\nANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES\nWHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN\nACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF\nOR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE.\n\n*\/\n\n\/\/ X11 (low-level) OpenGL(GLX) interface.\n\/\/ Uses X11 handling in x11-common.c.\n\/\/ Currently requires freeglut to get around issues with\n\/\/ initializing GLEW and destroying atemporary window at\n\/\/ start-up.\n\n#include <stdlib.h>\n#include <stdio.h>\n#include <unistd.h>\n#include <string.h>\n#define _USE_MATH_DEFINES\n#include <math.h>\n#include <sys\/time.h>\n#include <assert.h>\n#include <GL\/glew.h>\n#include <GL\/glxew.h>\n#include <GL\/gl.h>\n#include <GL\/glext.h>\n#include <GL\/glx.h>\n\/\/ We don´t really use glut, but only use it to create a temporary\n\/\/ rendering context before initializing GLEW.\n#include <GL\/glut.h>\n#include <GL\/freeglut_ext.h>\n\n#include \"sre.h\"\n#include \"sreBackend.h\"\n#include \"x11-common.h\"\n#include \"gui-common.h\"\n\nclass sreBackendGLX11 : public sreBackend {\npublic :\n virtual void Initialize(int *argc, char ***argv, int window_width, int window_height);\n virtual void Finalize();\n virtual void GLSwapBuffers();\n virtual void GLSync();\n virtual double GetCurrentTime();\n virtual void ProcessGUIEvents();\n virtual void ToggleFullScreenMode(int& width, int& height, bool pan_with_mouse);\n virtual void HideCursor();\n virtual void RestoreCursor();\n virtual void WarpCursor(int x, int y);\n};\n\nsreBackend *sreCreateBackendGLX11() {\n sreBackend *b = new sreBackendGLX11;\n b->name = \"OpenGL 3.0+ X11 (low-level)\";\n return b;\n}\n\ntypedef struct\n{\n uint32_t screen_width;\n uint32_t screen_height;\n Display *XDisplay;\n GLXWindow XWindow;\n GLXContext context;\n} GL_STATE_T;\n\nstatic GL_STATE_T *state;\nstatic GLXFBConfig chosen_fb_config;\n\n#define check() assert(glGetError() == 0)\n\n\/\/ Default Open GL context settings: 8-bit truecolor with alpha,\n\/\/ 24-bit depth buffer, 8-bit stencil, 4 sample MSAA.\n\nstatic GLint visual_attributes[] = {\n GLX_X_RENDERABLE, True,\n GLX_DRAWABLE_TYPE, GLX_WINDOW_BIT,\n GLX_RENDER_TYPE, GLX_RGBA_BIT,\n GLX_X_VISUAL_TYPE, GLX_TRUE_COLOR,\n GLX_RED_SIZE, 8,\n GLX_GREEN_SIZE, 8,\n GLX_BLUE_SIZE, 8,\n GLX_ALPHA_SIZE, 8,\n GLX_DEPTH_SIZE, 24,\n GLX_STENCIL_SIZE, 8,\n GLX_DOUBLEBUFFER, True,\n#ifndef NO_MULTI_SAMPLE\n GLX_SAMPLE_BUFFERS, 1,\t\/\/ Use MSAA\n GLX_SAMPLES, 4,\n#endif\n None\n};\n\nvoid CloseGlutWindow() {\n}\n\nvoid sreBackendGLX11::Initialize(int *argc, char ***argv, int window_width, int window_height) {\n \/\/ To call GLX functions with glew, we need to call glewInit()\n \/\/ first, but it needs an active OpenGL context to be present. So we have to\n \/\/ create a temporary GL context.\n glutInit(argc, *argv);\n int glut_window = glutCreateWindow(\"GLEW Test\");\n GLenum err = glewInit();\n if (GLEW_OK != err) {\n \/* Problem: glewInit failed, something is seriously wrong. *\/\n fprintf(stderr, \"Error: %s\\n\", glewGetErrorString(err));\n exit(1);\n }\n fprintf(stdout, \"Status: Using GLEW %s.\\n\", glewGetString(GLEW_VERSION));\n\/\/ glutCloseFunc(CloseGlutWindow);\n glutHideWindow();\n glutDestroyWindow(glut_window);\n\n \/\/ Problem: How to completely hide the glut window? It doesn't disappear. Requires\n \/\/ freeglut to fix.\n glutMainLoopEvent();\n\n state = (GL_STATE_T *)malloc(sizeof(GL_STATE_T));\n \/\/ Clear application state\n memset(state, 0, sizeof(*state));\n\n X11OpenDisplay();\n state->XDisplay = (Display *)X11GetDisplay();\n\/\/ XDestroyWindow(state->XDisplay, glut_window);\n\n \/\/ Require GLX >= 1.3\n GLint glx_major, glx_minor;\n GLint result = glXQueryVersion(state->XDisplay, &glx_major, &glx_minor);\n if (glx_major < 1 || (glx_major == 1 && glx_minor < 3)) {\n printf(\"Error: GLX version major reported is %d.%d, need at least 1.3.\\n\",\n glx_major, glx_minor);\n exit(1);\n }\n printf(\"GLX version: %d.%d\\n\", glx_major, glx_minor);\n\n \/\/ Obtain appropriate GLX framebuffer configurations.\n GLint num_config;\n GLXFBConfig *fb_config = glXChooseFBConfig(state->XDisplay, X11GetScreenIndex(),\n visual_attributes, &num_config);\n assert(result != GL_FALSE);\n if (num_config == 0) {\n printf(\"GLX returned no suitable framebuffer configurations.\\n\");\n exit(1);\n }\n printf(\"OpenGL (GLX): %d framebuffer configurations returned.\\n\", num_config);\n for (int i = 0; i < num_config; i++ ) {\n XVisualInfo *vi = glXGetVisualFromFBConfig(state->XDisplay, fb_config[i]);\n if (vi) {\n int samp_buf, samples;\n glXGetFBConfigAttrib(state->XDisplay, fb_config[i], GLX_SAMPLE_BUFFERS, &samp_buf);\n glXGetFBConfigAttrib(state->XDisplay, fb_config[i], GLX_SAMPLES, &samples);\n printf( \" Matching framebuffer config %d, visual ID 0x%2x: SAMPLE_BUFFERS = %d,\"\n \" SAMPLES = %d\\n\", i, vi->visualid, samp_buf, samples);\n XFree(vi);\n }\n }\n chosen_fb_config = fb_config[0];\n XFree(fb_config);\n\n XVisualInfo *vi = glXGetVisualFromFBConfig(state->XDisplay, chosen_fb_config);\n printf(\"Chosen visual ID = 0x%x\\n\", vi->visualid );\n \n \/\/ Create an X window with that visual.\n X11CreateWindow(window_width, window_height, vi, \"SRE OpenGL 3.0+ X11 demo\");\n XFree(vi);\n state->XWindow = (GLXWindow)X11GetWindow();\n\n if (!GLXEW_ARB_create_context) {\n \/\/ Create GLX rendering context.\n printf(\"Creating old-style (GLX 1.3) context.\\n\");\n state->context = glXCreateNewContext(state->XDisplay, chosen_fb_config,\n GLX_RGBA_TYPE, 0, True);\n }\n else {\n int context_attribs[] = {\n GLX_CONTEXT_MAJOR_VERSION_ARB, 3,\n GLX_CONTEXT_MINOR_VERSION_ARB, 0,\n \/\/GLX_CONTEXT_FLAGS_ARB, GLX_CONTEXT_FORWARD_COMPATIBLE_BIT_ARB,\n None\n };\n printf( \"Creating OpenGL 3.0 context.\\n\" );\n state->context = glXCreateContextAttribsARB(state->XDisplay,\n chosen_fb_config, 0, True, context_attribs);\n }\n assert(state->context != NULL);\n check();\n\n int stencil_bits = 8;\n int depth_bits = 24;\n\n printf(\"Opened OpenGL context of size %d x %d with 32-bit pixels, %d-bit depthbuffer and %d-bit stencil.\\n\", window_width,\n window_height, depth_bits, stencil_bits);\n \/\/ Verifying that context is a direct context\n if (!glXIsDirect(state->XDisplay, state->context)) {\n printf(\"Indirect GLX rendering context obtained.\\n\");\n }\n else {\n printf(\"Direct GLX rendering context obtained.\\n\");\n }\n\n glXMakeCurrent(state->XDisplay, X11GetWindow(), state->context);\n check();\n\n sreInitialize(window_width, window_height, sreBackendSwapBuffers);\n}\n\nvoid sreBackendGLX11::Finalize() {\n \/\/ Clear screen.\n glClear(GL_COLOR_BUFFER_BIT);\n sre_internal_backend->GLSync();\n\n glXMakeCurrent(state->XDisplay, 0, NULL);\n glXDestroyContext(state->XDisplay, state->context);\n X11DestroyWindow();\n X11CloseDisplay();\n}\n\nvoid sreBackendGLX11::GLSwapBuffers() {\n glXSwapBuffers(state->XDisplay, state->XWindow);\n}\n\nvoid sreBackendGLX11::GLSync() {\n glXSwapBuffers(state->XDisplay, state->XWindow);\n glXWaitGL();\n}\n\ndouble sreBackendGLX11::GetCurrentTime() {\n return X11GetCurrentTime();\n}\n\nvoid sreBackendGLX11::ProcessGUIEvents() {\n X11ProcessGUIEvents();\n}\n\nvoid sreBackendGLX11::ToggleFullScreenMode(int& width, int& height, bool pan_with_mouse) {\n X11ToggleFullScreenMode(width, height, pan_with_mouse);\n}\n\nvoid sreBackendGLX11::HideCursor() {\n X11HideCursor();\n}\n\nvoid sreBackendGLX11::RestoreCursor() {\n X11RestoreCursor();\n}\n\nvoid sreBackendGLX11::WarpCursor(int x, int y) {\n X11WarpCursor(x, y);\n}\n\n<commit_msg>Fix compilation of OpenGL (PC) version<commit_after>\/*\n\nCopyright (c) 2014 Harm Hanemaaijer <fgenfb@yahoo.com>\n\nPermission to use, copy, modify, and\/or distribute this software for any\npurpose with or without fee is hereby granted, provided that the above\ncopyright notice and this permission notice appear in all copies.\n\nTHE SOFTWARE IS PROVIDED \"AS IS\" AND THE AUTHOR DISCLAIMS ALL WARRANTIES\nWITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF\nMERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR\nANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES\nWHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN\nACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF\nOR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE.\n\n*\/\n\n\/\/ X11 (low-level) OpenGL(GLX) interface.\n\/\/ Uses X11 handling in x11-common.c.\n\/\/ Currently requires freeglut to get around issues with\n\/\/ initializing GLEW and destroying atemporary window at\n\/\/ start-up.\n\n#include <stdlib.h>\n#include <stdio.h>\n#include <unistd.h>\n#include <string.h>\n#define _USE_MATH_DEFINES\n#include <math.h>\n#include <sys\/time.h>\n#include <assert.h>\n#include <GL\/glew.h>\n#include <GL\/glxew.h>\n#include <GL\/gl.h>\n#include <GL\/glext.h>\n#include <GL\/glx.h>\n\/\/ We don´t really use glut, but only use it to create a temporary\n\/\/ rendering context before initializing GLEW.\n#include <GL\/glut.h>\n#include <GL\/freeglut_ext.h>\n\n#include \"sre.h\"\n#include \"sreBackend.h\"\n#include \"x11-common.h\"\n#include \"gui-common.h\"\n\nclass sreBackendGLX11 : public sreBackend {\npublic :\n virtual void Initialize(int *argc, char ***argv, int window_width, int window_height);\n virtual void Finalize();\n virtual void GLSwapBuffers();\n virtual void GLSync();\n virtual double GetCurrentTime();\n virtual void ProcessGUIEvents();\n virtual void ToggleFullScreenMode(int& width, int& height, bool pan_with_mouse);\n virtual void HideCursor();\n virtual void RestoreCursor();\n virtual void WarpCursor(int x, int y);\n};\n\nsreBackend *sreCreateBackendGLX11() {\n sreBackend *b = new sreBackendGLX11;\n b->name = \"OpenGL 3.0+ X11 (low-level)\";\n return b;\n}\n\ntypedef struct\n{\n uint32_t screen_width;\n uint32_t screen_height;\n Display *XDisplay;\n GLXWindow XWindow;\n GLXContext context;\n} GL_STATE_T;\n\nstatic GL_STATE_T *state;\nstatic GLXFBConfig chosen_fb_config;\n\n#define check() assert(glGetError() == 0)\n\n\/\/ Default Open GL context settings: 8-bit truecolor with alpha,\n\/\/ 24-bit depth buffer, 8-bit stencil, 4 sample MSAA.\n\nstatic GLint visual_attributes[] = {\n GLX_X_RENDERABLE, True,\n GLX_DRAWABLE_TYPE, GLX_WINDOW_BIT,\n GLX_RENDER_TYPE, GLX_RGBA_BIT,\n GLX_X_VISUAL_TYPE, GLX_TRUE_COLOR,\n GLX_RED_SIZE, 8,\n GLX_GREEN_SIZE, 8,\n GLX_BLUE_SIZE, 8,\n GLX_ALPHA_SIZE, 8,\n GLX_DEPTH_SIZE, 24,\n GLX_STENCIL_SIZE, 8,\n GLX_DOUBLEBUFFER, True,\n#ifndef NO_MULTI_SAMPLE\n GLX_SAMPLE_BUFFERS, 1,\t\/\/ Use MSAA\n GLX_SAMPLES, 4,\n#endif\n None\n};\n\nvoid CloseGlutWindow() {\n}\n\nvoid sreBackendGLX11::Initialize(int *argc, char ***argv, int window_width, int window_height) {\n \/\/ To call GLX functions with glew, we need to call glewInit()\n \/\/ first, but it needs an active OpenGL context to be present. So we have to\n \/\/ create a temporary GL context.\n glutInit(argc, *argv);\n int glut_window = glutCreateWindow(\"GLEW Test\");\n GLenum err = glewInit();\n if (GLEW_OK != err) {\n \/* Problem: glewInit failed, something is seriously wrong. *\/\n fprintf(stderr, \"Error: %s\\n\", glewGetErrorString(err));\n exit(1);\n }\n fprintf(stdout, \"Status: Using GLEW %s.\\n\", glewGetString(GLEW_VERSION));\n\/\/ glutCloseFunc(CloseGlutWindow);\n glutHideWindow();\n glutDestroyWindow(glut_window);\n\n \/\/ Problem: How to completely hide the glut window? It doesn't disappear. Requires\n \/\/ freeglut to fix.\n glutMainLoopEvent();\n\n state = (GL_STATE_T *)malloc(sizeof(GL_STATE_T));\n \/\/ Clear application state\n memset(state, 0, sizeof(*state));\n\n X11OpenDisplay();\n state->XDisplay = (Display *)X11GetDisplay();\n\/\/ XDestroyWindow(state->XDisplay, glut_window);\n\n \/\/ Require GLX >= 1.3\n GLint glx_major, glx_minor;\n GLint result = glXQueryVersion(state->XDisplay, &glx_major, &glx_minor);\n if (glx_major < 1 || (glx_major == 1 && glx_minor < 3)) {\n printf(\"Error: GLX version major reported is %d.%d, need at least 1.3.\\n\",\n glx_major, glx_minor);\n exit(1);\n }\n printf(\"GLX version: %d.%d\\n\", glx_major, glx_minor);\n\n \/\/ Obtain appropriate GLX framebuffer configurations.\n GLint num_config;\n GLXFBConfig *fb_config = glXChooseFBConfig(state->XDisplay, X11GetScreenIndex(),\n visual_attributes, &num_config);\n assert(result != GL_FALSE);\n if (num_config == 0) {\n printf(\"GLX returned no suitable framebuffer configurations.\\n\");\n exit(1);\n }\n printf(\"OpenGL (GLX): %d framebuffer configurations returned.\\n\", num_config);\n for (int i = 0; i < num_config; i++ ) {\n XVisualInfo *vi = glXGetVisualFromFBConfig(state->XDisplay, fb_config[i]);\n if (vi) {\n int samp_buf, samples;\n glXGetFBConfigAttrib(state->XDisplay, fb_config[i], GLX_SAMPLE_BUFFERS, &samp_buf);\n glXGetFBConfigAttrib(state->XDisplay, fb_config[i], GLX_SAMPLES, &samples);\n printf( \" Matching framebuffer config %d, visual ID 0x%2x: SAMPLE_BUFFERS = %d,\"\n \" SAMPLES = %d\\n\", i, vi->visualid, samp_buf, samples);\n XFree(vi);\n }\n }\n chosen_fb_config = fb_config[0];\n XFree(fb_config);\n\n XVisualInfo *vi = glXGetVisualFromFBConfig(state->XDisplay, chosen_fb_config);\n printf(\"Chosen visual ID = 0x%x\\n\", vi->visualid );\n \n \/\/ Create an X window with that visual.\n X11CreateWindow(window_width, window_height, vi, \"SRE OpenGL 3.0+ X11 demo\");\n XFree(vi);\n state->XWindow = (GLXWindow)X11GetWindow();\n\n if (!GLXEW_ARB_create_context) {\n \/\/ Create GLX rendering context.\n printf(\"Creating old-style (GLX 1.3) context.\\n\");\n state->context = glXCreateNewContext(state->XDisplay, chosen_fb_config,\n GLX_RGBA_TYPE, 0, True);\n }\n else {\n int context_attribs[] = {\n GLX_CONTEXT_MAJOR_VERSION_ARB, 3,\n GLX_CONTEXT_MINOR_VERSION_ARB, 0,\n \/\/GLX_CONTEXT_FLAGS_ARB, GLX_CONTEXT_FORWARD_COMPATIBLE_BIT_ARB,\n None\n };\n printf( \"Creating OpenGL 3.0 context.\\n\" );\n state->context = glXCreateContextAttribsARB(state->XDisplay,\n chosen_fb_config, 0, True, context_attribs);\n }\n assert(state->context != NULL);\n check();\n\n int stencil_bits = 8;\n int depth_bits = 24;\n\n printf(\"Opened OpenGL context of size %d x %d with 32-bit pixels, %d-bit depthbuffer and %d-bit stencil.\\n\", window_width,\n window_height, depth_bits, stencil_bits);\n \/\/ Verifying that context is a direct context\n if (!glXIsDirect(state->XDisplay, state->context)) {\n printf(\"Indirect GLX rendering context obtained.\\n\");\n }\n else {\n printf(\"Direct GLX rendering context obtained.\\n\");\n }\n\n glXMakeCurrent(state->XDisplay, X11GetWindow(), state->context);\n check();\n\n sreInitialize(window_width, window_height, sreBackendGLSwapBuffers);\n}\n\nvoid sreBackendGLX11::Finalize() {\n \/\/ Clear screen.\n glClear(GL_COLOR_BUFFER_BIT);\n sre_internal_backend->GLSync();\n\n glXMakeCurrent(state->XDisplay, 0, NULL);\n glXDestroyContext(state->XDisplay, state->context);\n X11DestroyWindow();\n X11CloseDisplay();\n}\n\nvoid sreBackendGLX11::GLSwapBuffers() {\n glXSwapBuffers(state->XDisplay, state->XWindow);\n}\n\nvoid sreBackendGLX11::GLSync() {\n glXSwapBuffers(state->XDisplay, state->XWindow);\n glXWaitGL();\n}\n\ndouble sreBackendGLX11::GetCurrentTime() {\n return X11GetCurrentTime();\n}\n\nvoid sreBackendGLX11::ProcessGUIEvents() {\n X11ProcessGUIEvents();\n}\n\nvoid sreBackendGLX11::ToggleFullScreenMode(int& width, int& height, bool pan_with_mouse) {\n X11ToggleFullScreenMode(width, height, pan_with_mouse);\n}\n\nvoid sreBackendGLX11::HideCursor() {\n X11HideCursor();\n}\n\nvoid sreBackendGLX11::RestoreCursor() {\n X11RestoreCursor();\n}\n\nvoid sreBackendGLX11::WarpCursor(int x, int y) {\n X11WarpCursor(x, y);\n}\n\n<|endoftext|>"} {"text":"<commit_before>\/***********************************************************************\n filename: SVGDataManager.cpp\n created: 30th July 2013\n author: Lukas Meindl\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\n#include \"CEGUI\/svg\/SVGDataManager.h\"\n#include \"CEGUI\/svg\/SVGData.h\"\n#include \"CEGUI\/Exceptions.h\"\n#include \"CEGUI\/Logger.h\"\n\nnamespace CEGUI\n{\n\/\/----------------------------------------------------------------------------\/\/\n\/\/ Singleton instance pointer\ntemplate<> SVGDataManager* Singleton<SVGDataManager>::ms_Singleton = 0;\n\n\nSVGDataManager::SVGDataManager()\n{\n\n}\n\n\nSVGDataManager::~SVGDataManager()\n{\n\n}\n\n\/*************************************************************************\nReturn singleton object\n*************************************************************************\/\nSVGDataManager&\tSVGDataManager::getSingleton(void)\n{\n\treturn Singleton<SVGDataManager>::getSingleton();\n}\n\n\/*************************************************************************\n\tReturn singleton pointer\n*************************************************************************\/\nSVGDataManager*\tSVGDataManager::getSingletonPtr(void)\n{\n\treturn Singleton<SVGDataManager>::getSingletonPtr();\n}\n\nSVGData& SVGDataManager::create(const String& name)\n{\n if (d_svgDataMap.find(name) != d_svgDataMap.end())\n CEGUI_THROW(AlreadyExistsException(\n \"Image already exists: \" + name));\n\n SVGData* svg_data = CEGUI_NEW_AO SVGData();\n d_svgDataMap[name] = svg_data;\n\n char addr_buff[32];\n sprintf(addr_buff, \"%p\", static_cast<void*>(&svg_data));\n\n Logger::getSingleton().logEvent(\n \"[ImageManager] Created image: '\" + name + \"' (\" + addr_buff + \n \")\");\n\n return *svg_data;\n}\n\n}\n<commit_msg>MOD: Output changes<commit_after>\/***********************************************************************\n filename: SVGDataManager.cpp\n created: 30th July 2013\n author: Lukas Meindl\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\n#include \"CEGUI\/svg\/SVGDataManager.h\"\n#include \"CEGUI\/svg\/SVGData.h\"\n#include \"CEGUI\/Exceptions.h\"\n#include \"CEGUI\/Logger.h\"\n\nnamespace CEGUI\n{\n\/\/----------------------------------------------------------------------------\/\/\n\/\/ Singleton instance pointer\ntemplate<> SVGDataManager* Singleton<SVGDataManager>::ms_Singleton = 0;\n\n\n\/\/----------------------------------------------------------------------------\/\/\nSVGDataManager::SVGDataManager()\n{\n\n}\n\n\/\/----------------------------------------------------------------------------\/\/\nSVGDataManager::~SVGDataManager()\n{\n\n}\n\n\/\/----------------------------------------------------------------------------\/\/\nSVGDataManager&\tSVGDataManager::getSingleton(void)\n{\n\treturn Singleton<SVGDataManager>::getSingleton();\n}\n\n\/\/----------------------------------------------------------------------------\/\/\nSVGDataManager*\tSVGDataManager::getSingletonPtr(void)\n{\n\treturn Singleton<SVGDataManager>::getSingletonPtr();\n}\n\n\/\/----------------------------------------------------------------------------\/\/\nSVGData& SVGDataManager::create(const String& name)\n{\n if (d_svgDataMap.find(name) != d_svgDataMap.end())\n CEGUI_THROW(AlreadyExistsException(\n \"SVGData already exists: \" + name));\n\n SVGData* svg_data = CEGUI_NEW_AO SVGData();\n d_svgDataMap[name] = svg_data;\n\n char addr_buff[32];\n sprintf(addr_buff, \"%p\", static_cast<void*>(&svg_data));\n\n Logger::getSingleton().logEvent(\n \"[SVGDataManager] Created SVGData: '\" + name + \"' (\" + addr_buff + \n \")\");\n\n return *svg_data;\n}\n\n\/\/----------------------------------------------------------------------------\/\/\n}\n<|endoftext|>"} {"text":"<commit_before>\/\/\n\/\/ vtTin3d.cpp\n\/\/\n\/\/ Class which represents a Triangulated Irregular Network.\n\/\/\n\/\/ Copyright (c) 2002-2003 Virtual Terrain Project\n\/\/ Free for all uses, see license.txt for details.\n\/\/\n\n#include \"vtlib\/vtlib.h\"\n#include \"vtTin3d.h\"\n\n\nvtTin3d::vtTin3d()\n{\n\tm_pGeom = NULL;\n\tm_pDropGeom = NULL;\n}\n\n\/**\n * Read the TIN from a file. This can either be an old-style or new-style\n * .tin format (so far, a VTP-specific format)\n *\/\nbool vtTin3d::Read(const char *fname)\n{\n\tif (!vtTin::Read(fname))\n\t\treturn false;\n\n\tInitialize(m_proj.GetUnits(), m_EarthExtents, m_fMinHeight, m_fMaxHeight);\n\treturn true;\n}\n\nFPoint3 ComputeNormal(const FPoint3 &p1, const FPoint3 &p2, const FPoint3 &p3)\n{\n\tFPoint3 d1 = (p2 - p1);\n\tFPoint3 d2 = (p3 - p1);\n\tFPoint3 cross = d1.Cross(d2);\n\tcross.Normalize();\n\treturn cross;\n}\n\n\n#define MAX_CHUNK_VERTS\t30000\n\nvtGeom *vtTin3d::CreateGeometry(bool bDropShadowMesh)\n{\n\t\/\/ set up materials\n\tvtMaterialArray *pMats = new vtMaterialArray();\n\tbool lighting = false;\n\tpMats->AddRGBMaterial1(RGBf(1, 1, 1), false, lighting, false);\n\tpMats->AddRGBMaterial1(RGBf(0.5f, 0.5f, 0.5f), false, false, false);\n\tpMats->AddRGBMaterial1(RGBf(0, 0, 0), false, false, false);\n\n\tm_pGeom = new vtGeom();\n\tm_pGeom->SetMaterials(pMats);\n\tpMats->Release();\n\n\tint i, j, k;\n\tint verts = NumVerts();\n\n\t\/\/ Break it up into a series of meshes - this is good for both\n\t\/\/ culling and memory management\n\n\tFPoint3 ep, wp;\t\t\/\/ earth point, world point\n\tFPoint3 p[3], norm;\n\tFPoint3 light_dir(1, 1, 0);\n\tRGBf color;\n\tfloat r, g=1.0f, b=0.5f;\n\n\t\/\/ most TINs are larger in the horionztal dimension than the vertical, so\n\t\/\/ use horizontal extents as the basis of subdivision\n\tDRECT rect = m_EarthExtents;\n\tdouble sizex = rect.Width();\n\tdouble sizey = rect.Height();\n\tfloat height_range = (m_fMaxHeight - m_fMinHeight);\n\n\t\/\/ make it slightly larger avoid edge condition\n\trect.left -= 0.000001;\n\tsizex += 0.000002;\n\trect.bottom -= 0.000001;\n\tsizey += 0.000002;\n\n\tint divx, divy;\t\t\/\/ number of x and y divisions\n\tint dsize;\n\tBin *bins;\n\tint tris = NumTris();\n\tint bx, by;\n\tDPoint2 gp;\n\n\tint divs = 4;\n\tbool acceptable = false;\n\twhile (!acceptable)\n\t{\n\t\t\/\/ take the smaller dimension and split in to ensure a minimum level\n\t\t\/\/ of subdivision, with the larger dimension proportional\n\t\tif (sizex < sizey)\n\t\t{\n\t\t\tdivx = divs;\n\t\t\tdivy = (int) (divx * sizey \/ sizex);\n\t\t}\n\t\telse\n\t\t{\n\t\t\tdivy = divs;\n\t\t\tdivx = (int) (divy * sizex \/ sizey);\n\t\t}\n\n\t\t\/\/ create a 2d array of Bins\n\t\tdsize = divx*divy;\n\t\tbins = new Bin[dsize];\n\n\t\tint most = -1, newsize;\n\t\tfor (i = 0; i < tris; i++)\n\t\t{\n\t\t\tj = i * 3;\n\t\t\tgp = (m_vert[m_tri[j]] + m_vert[m_tri[j+1]] + m_vert[m_tri[j+2]]) \/ 3;\n\t\t\tbx = (int) (divx * (gp.x - rect.left) \/ sizex);\n\t\t\tby = (int) (divy * (gp.y - rect.bottom) \/ sizey);\n\n\t\t\tBin &bref = bins[bx * divy + by];\n\t\t\tbref.Append(i);\n\t\t\tnewsize = bref.GetSize();\n\t\t\tif (newsize > most)\n\t\t\t\tmost = newsize;\n\t\t}\n\t\tif (most > 10000)\n\t\t{\n\t\t\tdelete [] bins;\n\t\t\tdivs = divs * 3 \/ 2;\n\t\t}\n\t\telse\n\t\t\tacceptable = true;\n\t}\n\n\tint in_bin, tri, vidx;\n\n\tfor (i = 0; i < dsize; i++)\n\t{\n\t\tBin &bref = bins[i];\n\t\tin_bin = bref.GetSize();\n\t\tif (!in_bin)\n\t\t\tcontinue;\n\n\t\tvtMesh *pMesh = new vtMesh(GL_TRIANGLES, VT_Normals|VT_Colors, in_bin * 3);\n\n\t\tfor (j = 0; j < in_bin; j++)\n\t\t{\n\t\t\ttri = bref[j];\n\t\t\tint tribase = tri * 3;\n\n\t\t\tfor (k = 0; k < 3; k++)\n\t\t\t{\n\t\t\t\tvidx = m_tri[tribase + k];\n\t\t\t\tep.Set(m_vert[vidx].x, m_vert[vidx].y, m_z[vidx]);\n\t\t\t\tm_Conversion.ConvertFromEarth(ep, p[k]);\n\t\t\t}\n\t\t\tnorm = ComputeNormal(p[0], p[1], p[2]);\n\n\t\t\tfloat shade = norm.Dot(light_dir);\t\/\/ shading 0 (dark) to 1 (light)\n\t\t\tif (shade < 0)\n\t\t\t\tshade = -shade;\n\n\t\t\tint vert_base = pMesh->GetNumVertices();\n\t\t\tfor (k = 0; k < 3; k++)\n\t\t\t{\n\t\t\t\tvidx = m_tri[tribase + k];\n\n\t\t\t\tr = (m_z[vidx] - m_fMinHeight) \/ height_range;\n\t\t\t\tint vert_index = pMesh->AddVertex(p[k]);\n\t\t\t\tpMesh->SetVtxNormal(vert_index, norm);\n\n\t\t\t\tcolor.Set(r, g, b);\n\t\t\t\tcolor *= shade;\n\t\t\t\tpMesh->SetVtxColor(vert_index, color);\n\t\t\t}\n\t\t\tpMesh->AddTri(vert_base, vert_base+1, vert_base+2);\n\t\t}\n\t\tm_pGeom->AddMesh(pMesh, 0);\n\t\tm_Meshes.Append(pMesh);\n\t}\n\n\t\/*\n\tint base = 0;\n\tremaining = verts;\n\twhile (remaining)\n\t{\n\t\tint chunk = remaining;\n\t\tif (chunk > MAX_CHUNK_VERTS)\n\t\t\tchunk = MAX_CHUNK_VERTS;\n\t\tint tris = chunk \/ 3;\n\n\t\tvtMesh *pMesh = new vtMesh(GL_TRIANGLES, VT_Normals|VT_Colors, chunk);\n\n\t\tfor (i = 0; i < tris; i++)\n\t\t{\n\t\t\tfor (j = 0; j < 3; j++)\n\t\t\t\tm_Conversion.ConvertFromEarth(m_vert[base + (i*3+j)], p[j]);\n\t\t\tnorm = ComputeNormal(p[0], p[1], p[2]);\n\n\t\t\tfloat shade = norm.Dot(light_dir);\t\/\/ shading 0 (dark) to 1 (light)\n\n\t\t\tfor (j = 0; j < 3; j++)\n\t\t\t{\n\t\t\t\tr = (m_points[i*3+j].z - m_fMinHeight) \/ (m_fMaxHeight - m_fMinHeight);\n\t\t\t\tpMesh->AddVertex(p[j]);\n\t\t\t\tpMesh->SetVtxNormal(i*3+j, norm);\n\n\t\t\t\tcolor.Set(r, g, b);\n\t\t\t\tcolor *= shade;\n\t\t\t\tpMesh->SetVtxColor(i*3+j, color);\n\t\t\t}\n\t\t}\n\t\tm_pGeom->AddMesh(pMesh, 0);\n\t\tm_Meshes.Append(pMesh);\n\n\t\tif (bDropShadowMesh)\n\t\t{\n\t\t\tvtMesh *pShadowMesh = new vtMesh(GL_TRIANGLES, 0, chunk);\n\t\t\tfor (i = 0; i < chunk; i++)\n\t\t\t{\n\t\t\t\tep = m_points[base+i];\n\t\t\t\tep.z = m_fMinHeight - 4.9;\n\t\t\t\tm_Conversion.ConvertFromEarth(ep, wp);\n\t\t\t\tpShadowMesh->AddVertex(wp);\n\t\t\t}\n\t\t\tm_pGeom->AddMesh(pShadowMesh, 2);\n\t\t}\n\n\t\tremaining -= chunk;\n\t\tbase += chunk;\n\t}\n\t\t*\/\n\n\tif (bDropShadowMesh)\n\t{\n\t\tvtMesh *pBaseMesh = new vtMesh(GL_TRIANGLE_FAN, 0, 4);\n\n\t\tep.Set(m_EarthExtents.left - 10, m_EarthExtents.bottom - 10, m_fMinHeight - 5);\n\t\tm_Conversion.ConvertFromEarth(ep, wp);\n\t\tpBaseMesh->AddVertex(wp);\n\n\t\tep.Set(m_EarthExtents.right + 10, m_EarthExtents.bottom - 10, m_fMinHeight - 5);\n\t\tm_Conversion.ConvertFromEarth(ep, wp);\n\t\tpBaseMesh->AddVertex(wp);\n\n\t\tep.Set(m_EarthExtents.right + 10, m_EarthExtents.top + 10, m_fMinHeight - 5);\n\t\tm_Conversion.ConvertFromEarth(ep, wp);\n\t\tpBaseMesh->AddVertex(wp);\n\n\t\tep.Set(m_EarthExtents.left - 10, m_EarthExtents.top + 10, m_fMinHeight - 5);\n\t\tm_Conversion.ConvertFromEarth(ep, wp);\n\t\tpBaseMesh->AddVertex(wp);\n\n\t\tpBaseMesh->AddFan(0, 1, 2, 3);\n\t\tm_pGeom->AddMesh(pBaseMesh, 1);\n\t}\n\treturn m_pGeom;\n}\n\n\/**\n * Returns true if the point was over the TIN, false otherwise.\n *\/\nbool vtTin3d::FindAltitudeAtPoint(const FPoint3 &input, float &fAltitude,\n\t\t\t\t\t\t\t\t FPoint3 *vNormal) const\n{\n\t\/\/ First try to identify which triangle\n\tFPoint2 p(input.x, input.z);\n\n\tFPoint3 wp1, wp2, wp3;\n\tFPoint2 p1, p2, p3;\n\tbool good;\n\n\tfor (unsigned int m = 0; m < m_Meshes.GetSize(); m++)\n\t{\n\t\tvtMesh *mesh = m_Meshes[m];\n\t\tint tris = mesh->GetNumVertices() \/ 3;\n\t\tfor (int i = 0; i < tris; i++)\n\t\t{\n\t\t\t\/\/ get world points\n\t\t\twp1 = mesh->GetVtxPos(i*3+0);\n\t\t\twp2 = mesh->GetVtxPos(i*3+1);\n\t\t\twp3 = mesh->GetVtxPos(i*3+2);\n\t\t\t\/\/ convert to 2d\n\t\t\tp1.Set(wp1.x, wp1.z);\n\t\t\tp2.Set(wp2.x, wp2.z);\n\t\t\tp3.Set(wp3.x, wp3.z);\n\n\t\t\tif (!PointInTriangle(p, p1, p2, p3))\n\t\t\t\tcontinue;\n\n\t\t\t\/\/ compute barycentric coordinates with respect to the triangle\n\t\t\tfloat bary[3], val;\n\t\t\tgood = BarycentricCoords(p1, p2, p3, p, bary);\n\t\t\tif (!good)\n\t\t\t\tcontinue;\n\n\t\t\t\/\/ compute barycentric combination of function values at vertices\n\t\t\tval = bary[0]*wp1.y +\n\t\t\t\t bary[1]*wp2.y +\n\t\t\t\t bary[2]*wp3.y;\n\t\t\tfAltitude = val;\n\t\t\treturn true;\n\t\t}\n\t}\n\treturn false;\n}\n\n\n\/*\n * Algorithm from 'Fast, Minimum Storage Ray-Triangle Intersection',\n * Thomas Mller and Ben Trumbore, 1997\n * Adapted to use C++ and the vtdata math classes.\n *\/\n#define EPSILON 0.000001\nbool intersect_triangle(const FPoint3 &orig, const FPoint3 &dir,\n\t\t\tconst FPoint3 &vert0, const FPoint3 &vert1, const FPoint3 &vert2,\n\t\t\tfloat &t, float &u, float &v)\n{\n\tFPoint3 edge1, edge2, tvec, pvec, qvec;\n\tfloat det,inv_det;\n\n\t\/* find vectors for two edges sharing vert0 *\/\n\tedge1 = vert1 - vert0;\n\tedge2 = vert2 - vert0;\n\n\t\/* begin calculating determinant - also used to calculate U parameter *\/\n\tpvec = dir.Cross(edge2);\n\n\t\/* if determinant is near zero, ray lies in plane of triangle *\/\n\tdet = edge1.Dot(pvec);\n\n\tif (det < EPSILON)\n\t\treturn false;\n\n\t\/* calculate distance from vert0 to ray origin *\/\n\ttvec = orig - vert0;\n\n\t\/* calculate U parameter and test bounds *\/\n\tu = tvec.Dot(pvec);\n\tif (u < 0.0 || u > det)\n\t\treturn false;\n\n\t\/* prepare to test V parameter *\/\n\tqvec = tvec.Cross(edge1);\n\n\t \/* calculate V parameter and test bounds *\/\n\tv = dir.Dot(qvec);\n\tif (v < 0.0 || u + v > det)\n\t\treturn false;\n\n\t\/* calculate t, scale parameters, ray intersects triangle *\/\n\tt = edge2.Dot(qvec);\n\tinv_det = 1.0 \/ det;\n\tt *= inv_det;\n\tu *= inv_det;\n\tv *= inv_det;\n\n\treturn true;\n}\n\nbool vtTin3d::CastRayToSurface(const FPoint3 &point, const FPoint3 &dir,\n\t\t\t\t\t\t\t FPoint3 &result) const\n{\n\tFPoint3 wp1, wp2, wp3;\n\tfloat t, u, v, closest = 1E9;\n\tint i;\n\n\tfor (unsigned int m = 0; m < m_Meshes.GetSize(); m++)\n\t{\n\t\tvtMesh *mesh = m_Meshes[m];\n\t\tint tris = mesh->GetNumVertices() \/ 3;\n\t\tfor (i = 0; i < tris; i++)\n\t\t{\n\t\t\t\/\/ get world points\n\t\t\twp1 = mesh->GetVtxPos(i*3+0);\n\t\t\twp2 = mesh->GetVtxPos(i*3+1);\n\t\t\twp3 = mesh->GetVtxPos(i*3+2);\n\t\t\tif (intersect_triangle(point, dir, wp1, wp2, wp3, t, u, v))\n\t\t\t{\n\t\t\t\tif (t < closest)\n\t\t\t\t\tclosest = t;\n\t\t\t}\n\t\t}\n\t}\n\tif (closest == 1E9)\n\t\treturn false;\n\n\tresult = point + (dir * closest);\n\treturn true;\n}\n\nFPoint3 vtTin3d::FindVectorToClosestVertex(const FPoint3 &pos)\n{\n\tFPoint3 vert, diff, closest_diff;\n\tfloat len, minlen = 1E9;\n\n\tfor (unsigned int m = 0; m < m_Meshes.GetSize(); m++)\n\t{\n\t\tvtMesh *mesh = m_Meshes[m];\n\t\tint points = mesh->GetNumVertices();\n\t\tfor (int i = 0; i < points; i++)\n\t\t{\n\t\t\tvert = mesh->GetVtxPos(i);\n\t\t\tdiff = vert - pos;\n\t\t\tlen = diff.Length();\n\t\t\tif (len < minlen)\n\t\t\t{\n\t\t\t\tminlen = len;\n\t\t\t\tclosest_diff = diff;\n\t\t\t}\n\t\t}\n\t}\n\treturn closest_diff;\n}\n\n<commit_msg>use RaySphereIntersection to speed up raycasting<commit_after>\/\/\n\/\/ vtTin3d.cpp\n\/\/\n\/\/ Class which represents a Triangulated Irregular Network.\n\/\/\n\/\/ Copyright (c) 2002-2004 Virtual Terrain Project\n\/\/ Free for all uses, see license.txt for details.\n\/\/\n\n#include \"vtlib\/vtlib.h\"\n#include \"vtTin3d.h\"\n\n\nvtTin3d::vtTin3d()\n{\n\tm_pGeom = NULL;\n\tm_pDropGeom = NULL;\n}\n\n\/**\n * Read the TIN from a file. This can either be an old-style or new-style\n * .tin format (so far, a VTP-specific format)\n *\/\nbool vtTin3d::Read(const char *fname)\n{\n\tif (!vtTin::Read(fname))\n\t\treturn false;\n\n\tInitialize(m_proj.GetUnits(), m_EarthExtents, m_fMinHeight, m_fMaxHeight);\n\treturn true;\n}\n\nFPoint3 ComputeNormal(const FPoint3 &p1, const FPoint3 &p2, const FPoint3 &p3)\n{\n\tFPoint3 d1 = (p2 - p1);\n\tFPoint3 d2 = (p3 - p1);\n\tFPoint3 cross = d1.Cross(d2);\n\tcross.Normalize();\n\treturn cross;\n}\n\n\n#define MAX_CHUNK_VERTS\t30000\n\nvtGeom *vtTin3d::CreateGeometry(bool bDropShadowMesh)\n{\n\t\/\/ set up materials\n\tvtMaterialArray *pMats = new vtMaterialArray();\n\tbool lighting = false;\n\tpMats->AddRGBMaterial1(RGBf(1, 1, 1), false, lighting, false);\n\tpMats->AddRGBMaterial1(RGBf(0.5f, 0.5f, 0.5f), false, false, false);\n\tpMats->AddRGBMaterial1(RGBf(0, 0, 0), false, false, false);\n\n\tm_pGeom = new vtGeom();\n\tm_pGeom->SetMaterials(pMats);\n\tpMats->Release();\n\n\tint i, j, k;\n\tint verts = NumVerts();\n\n\t\/\/ Break it up into a series of meshes - this is good for both\n\t\/\/ culling and memory management\n\n\tFPoint3 ep, wp;\t\t\/\/ earth point, world point\n\tFPoint3 p[3], norm;\n\tFPoint3 light_dir(1, 1, 0);\n\tRGBf color;\n\tfloat r, g=1.0f, b=0.5f;\n\n\t\/\/ most TINs are larger in the horionztal dimension than the vertical, so\n\t\/\/ use horizontal extents as the basis of subdivision\n\tDRECT rect = m_EarthExtents;\n\tdouble sizex = rect.Width();\n\tdouble sizey = rect.Height();\n\tfloat height_range = (m_fMaxHeight - m_fMinHeight);\n\n\t\/\/ make it slightly larger avoid edge condition\n\trect.left -= 0.000001;\n\tsizex += 0.000002;\n\trect.bottom -= 0.000001;\n\tsizey += 0.000002;\n\n\tint divx, divy;\t\t\/\/ number of x and y divisions\n\tint dsize;\n\tBin *bins;\n\tint tris = NumTris();\n\tint bx, by;\n\tDPoint2 gp;\n\n\tint divs = 4;\n\tbool acceptable = false;\n\twhile (!acceptable)\n\t{\n\t\t\/\/ take the smaller dimension and split in to ensure a minimum level\n\t\t\/\/ of subdivision, with the larger dimension proportional\n\t\tif (sizex < sizey)\n\t\t{\n\t\t\tdivx = divs;\n\t\t\tdivy = (int) (divx * sizey \/ sizex);\n\t\t}\n\t\telse\n\t\t{\n\t\t\tdivy = divs;\n\t\t\tdivx = (int) (divy * sizex \/ sizey);\n\t\t}\n\n\t\t\/\/ create a 2d array of Bins\n\t\tdsize = divx*divy;\n\t\tbins = new Bin[dsize];\n\n\t\tint most = -1, newsize;\n\t\tfor (i = 0; i < tris; i++)\n\t\t{\n\t\t\tj = i * 3;\n\t\t\tgp = (m_vert[m_tri[j]] + m_vert[m_tri[j+1]] + m_vert[m_tri[j+2]]) \/ 3;\n\t\t\tbx = (int) (divx * (gp.x - rect.left) \/ sizex);\n\t\t\tby = (int) (divy * (gp.y - rect.bottom) \/ sizey);\n\n\t\t\tBin &bref = bins[bx * divy + by];\n\t\t\tbref.Append(i);\n\t\t\tnewsize = bref.GetSize();\n\t\t\tif (newsize > most)\n\t\t\t\tmost = newsize;\n\t\t}\n\t\tif (most > 10000)\n\t\t{\n\t\t\tdelete [] bins;\n\t\t\tdivs = divs * 3 \/ 2;\n\t\t}\n\t\telse\n\t\t\tacceptable = true;\n\t}\n\n\tint in_bin, tri, vidx;\n\n\tfor (i = 0; i < dsize; i++)\n\t{\n\t\tBin &bref = bins[i];\n\t\tin_bin = bref.GetSize();\n\t\tif (!in_bin)\n\t\t\tcontinue;\n\n\t\tvtMesh *pMesh = new vtMesh(GL_TRIANGLES, VT_Normals|VT_Colors, in_bin * 3);\n\n\t\tfor (j = 0; j < in_bin; j++)\n\t\t{\n\t\t\ttri = bref[j];\n\t\t\tint tribase = tri * 3;\n\n\t\t\tfor (k = 0; k < 3; k++)\n\t\t\t{\n\t\t\t\tvidx = m_tri[tribase + k];\n\t\t\t\tep.Set(m_vert[vidx].x, m_vert[vidx].y, m_z[vidx]);\n\t\t\t\tm_Conversion.ConvertFromEarth(ep, p[k]);\n\t\t\t}\n\t\t\tnorm = ComputeNormal(p[0], p[1], p[2]);\n\n\t\t\tfloat shade = norm.Dot(light_dir);\t\/\/ shading 0 (dark) to 1 (light)\n\t\t\tif (shade < 0)\n\t\t\t\tshade = -shade;\n\n\t\t\tint vert_base = pMesh->GetNumVertices();\n\t\t\tfor (k = 0; k < 3; k++)\n\t\t\t{\n\t\t\t\tvidx = m_tri[tribase + k];\n\n\t\t\t\tr = (m_z[vidx] - m_fMinHeight) \/ height_range;\n\t\t\t\tint vert_index = pMesh->AddVertex(p[k]);\n\t\t\t\tpMesh->SetVtxNormal(vert_index, norm);\n\n\t\t\t\tcolor.Set(r, g, b);\n\t\t\t\tcolor *= shade;\n\t\t\t\tpMesh->SetVtxColor(vert_index, color);\n\t\t\t}\n\t\t\tpMesh->AddTri(vert_base, vert_base+1, vert_base+2);\n\t\t}\n\t\tm_pGeom->AddMesh(pMesh, 0);\n\t\tm_Meshes.Append(pMesh);\n\t}\n\n\t\/*\n\tint base = 0;\n\tremaining = verts;\n\twhile (remaining)\n\t{\n\t\tint chunk = remaining;\n\t\tif (chunk > MAX_CHUNK_VERTS)\n\t\t\tchunk = MAX_CHUNK_VERTS;\n\t\tint tris = chunk \/ 3;\n\n\t\tvtMesh *pMesh = new vtMesh(GL_TRIANGLES, VT_Normals|VT_Colors, chunk);\n\n\t\tfor (i = 0; i < tris; i++)\n\t\t{\n\t\t\tfor (j = 0; j < 3; j++)\n\t\t\t\tm_Conversion.ConvertFromEarth(m_vert[base + (i*3+j)], p[j]);\n\t\t\tnorm = ComputeNormal(p[0], p[1], p[2]);\n\n\t\t\tfloat shade = norm.Dot(light_dir);\t\/\/ shading 0 (dark) to 1 (light)\n\n\t\t\tfor (j = 0; j < 3; j++)\n\t\t\t{\n\t\t\t\tr = (m_points[i*3+j].z - m_fMinHeight) \/ (m_fMaxHeight - m_fMinHeight);\n\t\t\t\tpMesh->AddVertex(p[j]);\n\t\t\t\tpMesh->SetVtxNormal(i*3+j, norm);\n\n\t\t\t\tcolor.Set(r, g, b);\n\t\t\t\tcolor *= shade;\n\t\t\t\tpMesh->SetVtxColor(i*3+j, color);\n\t\t\t}\n\t\t}\n\t\tm_pGeom->AddMesh(pMesh, 0);\n\t\tm_Meshes.Append(pMesh);\n\n\t\tif (bDropShadowMesh)\n\t\t{\n\t\t\tvtMesh *pShadowMesh = new vtMesh(GL_TRIANGLES, 0, chunk);\n\t\t\tfor (i = 0; i < chunk; i++)\n\t\t\t{\n\t\t\t\tep = m_points[base+i];\n\t\t\t\tep.z = m_fMinHeight - 4.9;\n\t\t\t\tm_Conversion.ConvertFromEarth(ep, wp);\n\t\t\t\tpShadowMesh->AddVertex(wp);\n\t\t\t}\n\t\t\tm_pGeom->AddMesh(pShadowMesh, 2);\n\t\t}\n\n\t\tremaining -= chunk;\n\t\tbase += chunk;\n\t}\n\t\t*\/\n\n\tif (bDropShadowMesh)\n\t{\n\t\tvtMesh *pBaseMesh = new vtMesh(GL_TRIANGLE_FAN, 0, 4);\n\n\t\tep.Set(m_EarthExtents.left - 10, m_EarthExtents.bottom - 10, m_fMinHeight - 5);\n\t\tm_Conversion.ConvertFromEarth(ep, wp);\n\t\tpBaseMesh->AddVertex(wp);\n\n\t\tep.Set(m_EarthExtents.right + 10, m_EarthExtents.bottom - 10, m_fMinHeight - 5);\n\t\tm_Conversion.ConvertFromEarth(ep, wp);\n\t\tpBaseMesh->AddVertex(wp);\n\n\t\tep.Set(m_EarthExtents.right + 10, m_EarthExtents.top + 10, m_fMinHeight - 5);\n\t\tm_Conversion.ConvertFromEarth(ep, wp);\n\t\tpBaseMesh->AddVertex(wp);\n\n\t\tep.Set(m_EarthExtents.left - 10, m_EarthExtents.top + 10, m_fMinHeight - 5);\n\t\tm_Conversion.ConvertFromEarth(ep, wp);\n\t\tpBaseMesh->AddVertex(wp);\n\n\t\tpBaseMesh->AddFan(0, 1, 2, 3);\n\t\tm_pGeom->AddMesh(pBaseMesh, 1);\n\t}\n\treturn m_pGeom;\n}\n\n\/**\n * Returns true if the point was over the TIN, false otherwise.\n *\/\nbool vtTin3d::FindAltitudeAtPoint(const FPoint3 &input, float &fAltitude,\n\t\t\t\t\t\t\t\t FPoint3 *vNormal) const\n{\n\t\/\/ First try to identify which triangle\n\tFPoint2 p(input.x, input.z);\n\n\tFPoint3 wp1, wp2, wp3;\n\tFPoint2 p1, p2, p3;\n\tbool good;\n\n\tfor (unsigned int m = 0; m < m_Meshes.GetSize(); m++)\n\t{\n\t\tvtMesh *mesh = m_Meshes[m];\n\t\tint tris = mesh->GetNumVertices() \/ 3;\n\t\tfor (int i = 0; i < tris; i++)\n\t\t{\n\t\t\t\/\/ get world points\n\t\t\twp1 = mesh->GetVtxPos(i*3+0);\n\t\t\twp2 = mesh->GetVtxPos(i*3+1);\n\t\t\twp3 = mesh->GetVtxPos(i*3+2);\n\t\t\t\/\/ convert to 2d\n\t\t\tp1.Set(wp1.x, wp1.z);\n\t\t\tp2.Set(wp2.x, wp2.z);\n\t\t\tp3.Set(wp3.x, wp3.z);\n\n\t\t\tif (!PointInTriangle(p, p1, p2, p3))\n\t\t\t\tcontinue;\n\n\t\t\t\/\/ compute barycentric coordinates with respect to the triangle\n\t\t\tfloat bary[3], val;\n\t\t\tgood = BarycentricCoords(p1, p2, p3, p, bary);\n\t\t\tif (!good)\n\t\t\t\tcontinue;\n\n\t\t\t\/\/ compute barycentric combination of function values at vertices\n\t\t\tval = bary[0]*wp1.y +\n\t\t\t\t bary[1]*wp2.y +\n\t\t\t\t bary[2]*wp3.y;\n\t\t\tfAltitude = val;\n\t\t\treturn true;\n\t\t}\n\t}\n\treturn false;\n}\n\n\n\/*\n * Algorithm from 'Fast, Minimum Storage Ray-Triangle Intersection',\n * Thomas Mller and Ben Trumbore, 1997\n * Adapted to use C++ and the vtdata math classes.\n *\/\n#define EPSILON 0.000001\nbool intersect_triangle(const FPoint3 &orig, const FPoint3 &dir,\n\t\t\tconst FPoint3 &vert0, const FPoint3 &vert1, const FPoint3 &vert2,\n\t\t\tfloat &t, float &u, float &v)\n{\n\tFPoint3 edge1, edge2, tvec, pvec, qvec;\n\tfloat det,inv_det;\n\n\t\/* find vectors for two edges sharing vert0 *\/\n\tedge1 = vert1 - vert0;\n\tedge2 = vert2 - vert0;\n\n\t\/* begin calculating determinant - also used to calculate U parameter *\/\n\tpvec = dir.Cross(edge2);\n\n\t\/* if determinant is near zero, ray lies in plane of triangle *\/\n\tdet = edge1.Dot(pvec);\n\n\tif (det < EPSILON)\n\t\treturn false;\n\n\t\/* calculate distance from vert0 to ray origin *\/\n\ttvec = orig - vert0;\n\n\t\/* calculate U parameter and test bounds *\/\n\tu = tvec.Dot(pvec);\n\tif (u < 0.0 || u > det)\n\t\treturn false;\n\n\t\/* prepare to test V parameter *\/\n\tqvec = tvec.Cross(edge1);\n\n\t \/* calculate V parameter and test bounds *\/\n\tv = dir.Dot(qvec);\n\tif (v < 0.0 || u + v > det)\n\t\treturn false;\n\n\t\/* calculate t, scale parameters, ray intersects triangle *\/\n\tt = edge2.Dot(qvec);\n\tinv_det = 1.0 \/ det;\n\tt *= inv_det;\n\tu *= inv_det;\n\tv *= inv_det;\n\n\treturn true;\n}\n\nbool vtTin3d::CastRayToSurface(const FPoint3 &point, const FPoint3 &dir,\n\t\t\t\t\t\t\t FPoint3 &result) const\n{\n\tFPoint3 wp1, wp2, wp3;\n\tfloat t, u, v, closest = 1E9;\n\tint i;\n\n\tfor (unsigned int m = 0; m < m_Meshes.GetSize(); m++)\n\t{\n\t\tvtMesh *mesh = m_Meshes[m];\n\n\t\tFBox3 box;\n\t\tmesh->GetBoundBox(box);\n\t\tFSphere sph(box);\n\n\t\tint iQuantity;\n\t\tFPoint3 interpoints[2];\n\t\tif (!RaySphereIntersection(point, dir, sph, iQuantity, interpoints))\n\t\t{\n\t\t\tcontinue;\n\t\t}\n\n\t\tint tris = mesh->GetNumVertices() \/ 3;\n\t\tfor (i = 0; i < tris; i++)\n\t\t{\n\t\t\t\/\/ get world points\n\t\t\twp1 = mesh->GetVtxPos(i*3+0);\n\t\t\twp2 = mesh->GetVtxPos(i*3+1);\n\t\t\twp3 = mesh->GetVtxPos(i*3+2);\n\t\t\tif (intersect_triangle(point, dir, wp1, wp2, wp3, t, u, v))\n\t\t\t{\n\t\t\t\tif (t < closest)\n\t\t\t\t\tclosest = t;\n\t\t\t}\n\t\t}\n\t}\n\tif (closest == 1E9)\n\t\treturn false;\n\n\tresult = point + (dir * closest);\n\treturn true;\n}\n\nFPoint3 vtTin3d::FindVectorToClosestVertex(const FPoint3 &pos)\n{\n\tFPoint3 vert, diff, closest_diff;\n\tfloat len, minlen = 1E9;\n\n\tfor (unsigned int m = 0; m < m_Meshes.GetSize(); m++)\n\t{\n\t\tvtMesh *mesh = m_Meshes[m];\n\t\tint points = mesh->GetNumVertices();\n\t\tfor (int i = 0; i < points; i++)\n\t\t{\n\t\t\tvert = mesh->GetVtxPos(i);\n\t\t\tdiff = vert - pos;\n\t\t\tlen = diff.Length();\n\t\t\tif (len < minlen)\n\t\t\t{\n\t\t\t\tminlen = len;\n\t\t\t\tclosest_diff = diff;\n\t\t\t}\n\t\t}\n\t}\n\treturn closest_diff;\n}\n\n<|endoftext|>"} {"text":"<commit_before>#include <nan.h>\n#include <stdint.h>\n#if defined(__APPLE__)\n#include <fcntl.h>\n#include <sys\/disk.h>\n#include <sys\/ioctl.h>\n#include <sys\/stat.h>\n#elif defined(_WIN32)\n#include <io.h>\n#include <malloc.h>\n#include <winioctl.h>\n#else\n#include <errno.h>\n#include <linux\/fs.h>\n#include <stdlib.h>\n#include <sys\/file.h>\n#include <sys\/ioctl.h>\n#include <sys\/stat.h>\n#endif\n\nvoid free_aligned_buffer(char *buffer, void *hint) {\n#if defined(_WIN32)\n _aligned_free(buffer);\n#else\n free(buffer);\n#endif\n}\n\nclass GetBlockDeviceWorker : public Nan::AsyncWorker {\n public:\n GetBlockDeviceWorker(\n const int fd,\n Nan::Callback *callback\n ) : Nan::AsyncWorker(callback),\n fd(fd) {}\n\n ~GetBlockDeviceWorker() {}\n\n void Execute() {\n#if !defined(_WIN32)\n \/\/ WIN32: We know of no way to assert that a handle is a block device.\n struct stat st;\n if (fstat(fd, &st) == -1) {\n return SetErrorMessage(\"fstat failed\");\n }\n if ((st.st_mode & S_IFMT) != S_IFBLK) {\n return SetErrorMessage(\"fd is not a block device\");\n }\n#endif\n#if defined(__APPLE__)\n if (ioctl(fd, DKIOCGETBLOCKSIZE, &logical_sector_size) == -1) {\n return SetErrorMessage(\"DKIOCGETBLOCKSIZE failed\"); \n }\n if (ioctl(fd, DKIOCGETPHYSICALBLOCKSIZE, &physical_sector_size) == -1) {\n return SetErrorMessage(\"DKIOCGETPHYSICALBLOCKSIZE failed\");\n }\n uint64_t logical_sectors = 0;\n if (ioctl(fd, DKIOCGETBLOCKCOUNT, &logical_sectors) == -1) {\n return SetErrorMessage(\"DKIOCGETBLOCKCOUNT failed\");\n }\n size = logical_sector_size * logical_sectors;\n#elif defined(_WIN32)\n HANDLE handle = uv_get_osfhandle(fd);\n if (handle == INVALID_HANDLE_VALUE) {\n return SetErrorMessage(\"EBADF: bad file descriptor\");\n }\n STORAGE_PROPERTY_QUERY query;\n STORAGE_ACCESS_ALIGNMENT_DESCRIPTOR alignment;\n DISK_GEOMETRY_EX geometry;\n DWORD bytes;\n ZeroMemory(&query, sizeof(query));\n ZeroMemory(&alignment, sizeof(alignment));\n ZeroMemory(&geometry, sizeof(geometry));\n query.QueryType = PropertyStandardQuery;\n query.PropertyId = StorageAccessAlignmentProperty;\n if (\n DeviceIoControl(\n handle, \n IOCTL_STORAGE_QUERY_PROPERTY, \n &query, \n sizeof(query), \n &alignment,\n sizeof(alignment),\n &bytes,\n NULL\n )\n ) {\n logical_sector_size = (uint32_t) alignment.BytesPerLogicalSector;\n physical_sector_size = (uint32_t) alignment.BytesPerPhysicalSector;\n } else {\n return SetErrorMessage(\"IOCTL_STORAGE_QUERY_PROPERTY failed\");\n }\n if (\n DeviceIoControl(\n handle,\n IOCTL_DISK_GET_DRIVE_GEOMETRY_EX,\n NULL,\n 0,\n &geometry,\n sizeof(geometry),\n &bytes,\n NULL\n )\n ) {\n size = static_cast<uint64_t>(geometry.DiskSize.QuadPart);\n } else {\n return SetErrorMessage(\"IOCTL_DISK_GET_DRIVE_GEOMETRY_EX failed\");\n }\n#elif defined(__FreeBSD__) || defined(__FreeBSD_kernel_)\n \/\/ See: pipermail\/freebsd-hackers\/2016-September\/049974.html\n if (ioctl(fd, DIOCGSECTORSIZE, &logical_sector_size) == -1) {\n return SetErrorMessage(\"DIOCGSECTORSIZE failed\");\n }\n if (ioctl(fd, DIOCGSTRIPESIZE, &physical_sector_size) == -1) {\n return SetErrorMessage(\"DIOCGSTRIPESIZE failed\");\n }\n if (ioctl(fd, DIOCGMEDIASIZE, &size) == -1) {\n return SetErrorMessage(\"DIOCGMEDIASIZE failed\");\n }\n#else\n if (ioctl(fd, BLKSSZGET, &logical_sector_size) == -1) {\n return SetErrorMessage(\"BLKSSZGET failed\");\n }\n if (ioctl(fd, BLKPSZGET, &physical_sector_size) == -1) {\n return SetErrorMessage(\"BLKPSZGET failed\");\n }\n if (ioctl(fd, BLKGETSIZE64, &size) == -1) {\n return SetErrorMessage(\"BLKGETSIZE64 failed\");\n }\n#endif\n }\n\n void HandleOKCallback () {\n Nan::HandleScope scope;\n v8::Local<v8::Object> device = Nan::New<v8::Object>();\n Nan::Set(\n device,\n Nan::New<v8::String>(\"logicalSectorSize\").ToLocalChecked(),\n Nan::New<v8::Number>(logical_sector_size)\n );\n Nan::Set(\n device,\n Nan::New<v8::String>(\"physicalSectorSize\").ToLocalChecked(),\n Nan::New<v8::Number>(physical_sector_size)\n );\n Nan::Set(\n device,\n Nan::New<v8::String>(\"size\").ToLocalChecked(),\n Nan::New<v8::Number>(static_cast<double>(size))\n );\n v8::Local<v8::Value> argv[] = {\n Nan::Undefined(),\n device\n };\n callback->Call(2, argv);\n }\n\n private:\n const int fd;\n uint32_t logical_sector_size;\n uint32_t physical_sector_size;\n uint64_t size;\n};\n\n#if defined(__APPLE__)\nclass SetF_NOCACHEWorker : public Nan::AsyncWorker {\n public:\n SetF_NOCACHEWorker(\n const int fd,\n const int value,\n Nan::Callback *callback\n ) : Nan::AsyncWorker(callback),\n fd(fd),\n value(value) {}\n\n ~SetF_NOCACHEWorker() {}\n\n void Execute() {\n if (fcntl(fd, F_NOCACHE, value) != 0) {\n if (errno == EBADF) {\n SetErrorMessage(\"EBADF: bad file descriptor, fcntl\");\n } else {\n SetErrorMessage(\"unexpected error, fcntl\");\n }\n };\n }\n\n void HandleOKCallback() {\n Nan::HandleScope scope;\n v8::Local<v8::Value> argv[] = {\n Nan::Undefined()\n };\n callback->Call(1, argv);\n }\n\n private:\n const int fd;\n const int value;\n};\n#endif\n\n#if defined(_WIN32)\nclass SetFSCTL_LOCK_VOLUMEWorker : public Nan::AsyncWorker {\n public:\n SetFSCTL_LOCK_VOLUMEWorker(\n const int fd,\n const int value,\n Nan::Callback *callback\n ) : Nan::AsyncWorker(callback),\n fd(fd),\n value(value) {}\n\n ~SetFSCTL_LOCK_VOLUMEWorker() {}\n\n void Execute() {\n HANDLE handle = uv_get_osfhandle(fd);\n if (handle == INVALID_HANDLE_VALUE) {\n return SetErrorMessage(\"EBADF: bad file descriptor\");\n }\n DWORD bytes;\n if (\n !DeviceIoControl(\n handle,\n value ? FSCTL_LOCK_VOLUME : FSCTL_UNLOCK_VOLUME,\n NULL,\n 0,\n NULL,\n 0,\n &bytes,\n NULL\n )\n ) {\n if (value) {\n return SetErrorMessage(\"FSCTL_LOCK_VOLUME failed\");\n } else {\n return SetErrorMessage(\"FSCTL_UNLOCK_VOLUME failed\");\n }\n }\n }\n\n void HandleOKCallback() {\n Nan::HandleScope scope;\n v8::Local<v8::Value> argv[] = {\n Nan::Undefined()\n };\n callback->Call(1, argv);\n }\n\n private:\n const int fd;\n const int value;\n};\n#endif\n\nNAN_METHOD(getAlignedBuffer) {\n if (\n info.Length() != 2 ||\n !info[0]->IsUint32() ||\n !info[1]->IsUint32()\n ) {\n return Nan::ThrowError(\n \"bad arguments, expected: (uint32 size, uint32 alignment)\"\n );\n }\n const size_t size = info[0]->Uint32Value();\n const size_t alignment = info[1]->Uint32Value();\n if (size == 0) return Nan::ThrowError(\"size must not be 0\");\n if (alignment == 0) return Nan::ThrowError(\"alignment must not be 0\");\n if (alignment & (alignment - 1)) {\n return Nan::ThrowError(\"alignment must be a power of 2\");\n }\n if (alignment % sizeof(void *)) {\n return Nan::ThrowError(\"alignment must be a multiple of pointer size\");\n }\n#if defined(_WIN32)\n void *ptr = _aligned_malloc(size, alignment);\n if (ptr == NULL) return Nan::ThrowError(\"insufficient memory\");\n#else\n void *ptr;\n int result = posix_memalign(&ptr, alignment, size);\n if (result == EINVAL) return Nan::ThrowError(\"bad alignment argument\");\n if (result == ENOMEM) return Nan::ThrowError(\"insufficient memory\");\n if (result != 0) return Nan::ThrowError(\"unexpected error, posix_memalign\");\n#endif\n info.GetReturnValue().Set(\n Nan::NewBuffer(\n (char *) ptr,\n size,\n free_aligned_buffer,\n NULL\n ).ToLocalChecked()\n );\n}\n\nNAN_METHOD(getBlockDevice) {\n if (\n info.Length() != 2 ||\n !info[0]->IsUint32() ||\n !info[1]->IsFunction()\n ) {\n return Nan::ThrowError(\n \"bad arguments, expected: (uint32 fd, function callback)\"\n );\n }\n const int fd = info[0]->Uint32Value();\n Nan::Callback *callback = new Nan::Callback(info[1].As<v8::Function>());\n Nan::AsyncQueueWorker(new GetBlockDeviceWorker(fd, callback));\n}\n\nNAN_METHOD(setF_NOCACHE) {\n#if defined(__APPLE__)\n if (\n info.Length() != 3 ||\n !info[0]->IsUint32() ||\n !info[1]->IsUint32() ||\n !info[2]->IsFunction()\n ) {\n return Nan::ThrowError(\n \"bad arguments, expected: (uint32 fd, uint32 value, function callback)\"\n );\n }\n const int fd = info[0]->Uint32Value();\n const int value = info[1]->Uint32Value();\n if (value != 0 && value != 1) return Nan::ThrowError(\"value must be 0 or 1\");\n Nan::Callback *callback = new Nan::Callback(info[2].As<v8::Function>());\n Nan::AsyncQueueWorker(new SetF_NOCACHEWorker(fd, value, callback));\n#else\n return Nan::ThrowError(\"only supported on mac os\");\n#endif\n}\n\nNAN_METHOD(setFSCTL_LOCK_VOLUME) {\n#if defined(_WIN32)\n if (\n info.Length() != 3 ||\n !info[0]->IsUint32() ||\n !info[1]->IsUint32() ||\n !info[2]->IsFunction()\n ) {\n return Nan::ThrowError(\n \"bad arguments, expected: (uint32 fd, uint32 value, function callback)\"\n );\n }\n const int fd = info[0]->Uint32Value();\n const int value = info[1]->Uint32Value();\n if (value != 0 && value != 1) return Nan::ThrowError(\"value must be 0 or 1\");\n Nan::Callback *callback = new Nan::Callback(info[2].As<v8::Function>());\n Nan::AsyncQueueWorker(new SetFSCTL_LOCK_VOLUMEWorker(fd, value, callback));\n#else\n return Nan::ThrowError(\"only supported on windows\");\n#endif\n}\n\nNAN_MODULE_INIT(Init) {\n#if defined(O_DIRECT)\n NODE_DEFINE_CONSTANT(target, O_DIRECT);\n#endif\n#if defined(O_DSYNC)\n NODE_DEFINE_CONSTANT(target, O_DSYNC);\n#endif\n#if defined(O_EXCL)\n NODE_DEFINE_CONSTANT(target, O_EXCL);\n#endif\n#if defined(O_EXLOCK)\n NODE_DEFINE_CONSTANT(target, O_EXLOCK);\n#endif\n#if defined(O_SYNC)\n NODE_DEFINE_CONSTANT(target, O_SYNC);\n#endif\n NAN_EXPORT(target, getAlignedBuffer);\n NAN_EXPORT(target, getBlockDevice);\n NAN_EXPORT(target, setF_NOCACHE);\n NAN_EXPORT(target, setFSCTL_LOCK_VOLUME);\n}\n\nNODE_MODULE(binding, Init)\n\n\/\/ S.D.G.\n<commit_msg>fix unix types to match the various kernel headers<commit_after>#include <nan.h>\n#include <stdint.h>\n#if defined(__APPLE__)\n#include <fcntl.h>\n#include <sys\/disk.h>\n#include <sys\/ioctl.h>\n#include <sys\/stat.h>\n#elif defined(_WIN32)\n#include <io.h>\n#include <malloc.h>\n#include <winioctl.h>\n#else\n#include <errno.h>\n#include <linux\/fs.h>\n#include <stdlib.h>\n#include <sys\/file.h>\n#include <sys\/ioctl.h>\n#include <sys\/stat.h>\n#endif\n\nvoid free_aligned_buffer(char *buffer, void *hint) {\n#if defined(_WIN32)\n _aligned_free(buffer);\n#else\n free(buffer);\n#endif\n}\n\nclass GetBlockDeviceWorker : public Nan::AsyncWorker {\n public:\n GetBlockDeviceWorker(\n const int fd,\n Nan::Callback *callback\n ) : Nan::AsyncWorker(callback),\n fd(fd) {}\n\n ~GetBlockDeviceWorker() {}\n\n void Execute() {\n#if !defined(_WIN32)\n \/\/ WIN32: We know of no way to assert that a handle is a block device.\n struct stat st;\n if (fstat(fd, &st) == -1) {\n return SetErrorMessage(\"fstat failed\");\n }\n if ((st.st_mode & S_IFMT) != S_IFBLK) {\n return SetErrorMessage(\"fd is not a block device\");\n }\n#endif\n#if defined(__APPLE__)\n \/\/ https:\/\/opensource.apple.com\/source\/xnu\/xnu-1699.26.8\/bsd\/sys\/disk.h\n uint32_t _logical_sector_size;\n uint32_t _physical_sector_size;\n uint64_t _logical_sectors;\n if (ioctl(fd, DKIOCGETBLOCKSIZE, &_logical_sector_size) == -1) {\n return SetErrorMessage(\"DKIOCGETBLOCKSIZE failed\"); \n }\n if (ioctl(fd, DKIOCGETPHYSICALBLOCKSIZE, &_physical_sector_size) == -1) {\n return SetErrorMessage(\"DKIOCGETPHYSICALBLOCKSIZE failed\");\n }\n if (ioctl(fd, DKIOCGETBLOCKCOUNT, &_logical_sectors) == -1) {\n return SetErrorMessage(\"DKIOCGETBLOCKCOUNT failed\");\n }\n logical_sector_size = (uint64_t) _logical_sector_size;\n physical_sector_size = (uint64_t) _physical_sector_size;\n size = logical_sector_size * _logical_sectors;\n#elif defined(_WIN32)\n HANDLE handle = uv_get_osfhandle(fd);\n if (handle == INVALID_HANDLE_VALUE) {\n return SetErrorMessage(\"EBADF: bad file descriptor\");\n }\n STORAGE_PROPERTY_QUERY query;\n STORAGE_ACCESS_ALIGNMENT_DESCRIPTOR alignment;\n DISK_GEOMETRY_EX geometry;\n DWORD bytes;\n ZeroMemory(&query, sizeof(query));\n ZeroMemory(&alignment, sizeof(alignment));\n ZeroMemory(&geometry, sizeof(geometry));\n query.QueryType = PropertyStandardQuery;\n query.PropertyId = StorageAccessAlignmentProperty;\n if (\n DeviceIoControl(\n handle, \n IOCTL_STORAGE_QUERY_PROPERTY, \n &query, \n sizeof(query), \n &alignment,\n sizeof(alignment),\n &bytes,\n NULL\n )\n ) {\n logical_sector_size = (uint64_t) alignment.BytesPerLogicalSector;\n physical_sector_size = (uint64_t) alignment.BytesPerPhysicalSector;\n } else {\n return SetErrorMessage(\"IOCTL_STORAGE_QUERY_PROPERTY failed\");\n }\n if (\n DeviceIoControl(\n handle,\n IOCTL_DISK_GET_DRIVE_GEOMETRY_EX,\n NULL,\n 0,\n &geometry,\n sizeof(geometry),\n &bytes,\n NULL\n )\n ) {\n size = static_cast<uint64_t>(geometry.DiskSize.QuadPart);\n } else {\n return SetErrorMessage(\"IOCTL_DISK_GET_DRIVE_GEOMETRY_EX failed\");\n }\n#elif defined(__FreeBSD__) || defined(__FreeBSD_kernel_)\n \/\/ https:\/\/github.com\/freebsd\/freebsd\/blob\/master\/sys\/sys\/disk.h\n unsigned int _logical_sector_size;\n off_t _physical_sector_size;\n off_t _size;\n if (ioctl(fd, DIOCGSECTORSIZE, &_logical_sector_size) == -1) {\n return SetErrorMessage(\"DIOCGSECTORSIZE failed\");\n }\n if (ioctl(fd, DIOCGSTRIPESIZE, &_physical_sector_size) == -1) {\n return SetErrorMessage(\"DIOCGSTRIPESIZE failed\");\n }\n if (ioctl(fd, DIOCGMEDIASIZE, &_size) == -1) {\n return SetErrorMessage(\"DIOCGMEDIASIZE failed\");\n }\n logical_sector_size = (uint64_t) _logical_sector_size;\n physical_sector_size = (uint64_t) _physical_sector_size;\n size = (uint64_t) _size;\n#else\n \/\/ https:\/\/github.com\/torvalds\/linux\/blob\/master\/block\/ioctl.c\n \/\/ We must use the correct type according to the control code passed:\n \/\/ https:\/\/stackoverflow.com\/questions\/19747663\/where-are-ioctl-\n \/\/ parameters-such-as-0x1268-blksszget-actually-specified\n int _logical_sector_size;\n unsigned int _physical_sector_size;\n if (ioctl(fd, BLKSSZGET, &_logical_sector_size) == -1) {\n return SetErrorMessage(\"BLKSSZGET failed\");\n }\n if (ioctl(fd, BLKPBSZGET, &_physical_sector_size) == -1) {\n return SetErrorMessage(\"BLKPBSZGET failed\");\n }\n \/\/ The kernel expects size to be a u64 and defines u64 as uint64_t:\n \/\/ https:\/\/github.com\/torvalds\/linux\/blob\/master\/tools\/include\/linux\/types.h\n if (ioctl(fd, BLKGETSIZE64, &size) == -1) {\n return SetErrorMessage(\"BLKGETSIZE64 failed\");\n }\n logical_sector_size = (uint64_t) _logical_sector_size;\n physical_sector_size = (uint64_t) _physical_sector_size;\n#endif\n }\n\n void HandleOKCallback () {\n Nan::HandleScope scope;\n v8::Local<v8::Object> device = Nan::New<v8::Object>();\n Nan::Set(\n device,\n Nan::New<v8::String>(\"logicalSectorSize\").ToLocalChecked(),\n Nan::New<v8::Number>(static_cast<double>(logical_sector_size))\n );\n Nan::Set(\n device,\n Nan::New<v8::String>(\"physicalSectorSize\").ToLocalChecked(),\n Nan::New<v8::Number>(static_cast<double>(physical_sector_size))\n );\n Nan::Set(\n device,\n Nan::New<v8::String>(\"size\").ToLocalChecked(),\n Nan::New<v8::Number>(static_cast<double>(size))\n );\n v8::Local<v8::Value> argv[] = {\n Nan::Undefined(),\n device\n };\n callback->Call(2, argv);\n }\n\n private:\n const int fd;\n uint64_t logical_sector_size;\n uint64_t physical_sector_size;\n uint64_t size;\n};\n\n#if defined(__APPLE__)\nclass SetF_NOCACHEWorker : public Nan::AsyncWorker {\n public:\n SetF_NOCACHEWorker(\n const int fd,\n const int value,\n Nan::Callback *callback\n ) : Nan::AsyncWorker(callback),\n fd(fd),\n value(value) {}\n\n ~SetF_NOCACHEWorker() {}\n\n void Execute() {\n if (fcntl(fd, F_NOCACHE, value) != 0) {\n if (errno == EBADF) {\n SetErrorMessage(\"EBADF: bad file descriptor, fcntl\");\n } else {\n SetErrorMessage(\"unexpected error, fcntl\");\n }\n };\n }\n\n void HandleOKCallback() {\n Nan::HandleScope scope;\n v8::Local<v8::Value> argv[] = {\n Nan::Undefined()\n };\n callback->Call(1, argv);\n }\n\n private:\n const int fd;\n const int value;\n};\n#endif\n\n#if defined(_WIN32)\nclass SetFSCTL_LOCK_VOLUMEWorker : public Nan::AsyncWorker {\n public:\n SetFSCTL_LOCK_VOLUMEWorker(\n const int fd,\n const int value,\n Nan::Callback *callback\n ) : Nan::AsyncWorker(callback),\n fd(fd),\n value(value) {}\n\n ~SetFSCTL_LOCK_VOLUMEWorker() {}\n\n void Execute() {\n HANDLE handle = uv_get_osfhandle(fd);\n if (handle == INVALID_HANDLE_VALUE) {\n return SetErrorMessage(\"EBADF: bad file descriptor\");\n }\n DWORD bytes;\n if (\n !DeviceIoControl(\n handle,\n value ? FSCTL_LOCK_VOLUME : FSCTL_UNLOCK_VOLUME,\n NULL,\n 0,\n NULL,\n 0,\n &bytes,\n NULL\n )\n ) {\n if (value) {\n return SetErrorMessage(\"FSCTL_LOCK_VOLUME failed\");\n } else {\n return SetErrorMessage(\"FSCTL_UNLOCK_VOLUME failed\");\n }\n }\n }\n\n void HandleOKCallback() {\n Nan::HandleScope scope;\n v8::Local<v8::Value> argv[] = {\n Nan::Undefined()\n };\n callback->Call(1, argv);\n }\n\n private:\n const int fd;\n const int value;\n};\n#endif\n\nNAN_METHOD(getAlignedBuffer) {\n if (\n info.Length() != 2 ||\n !info[0]->IsUint32() ||\n !info[1]->IsUint32()\n ) {\n return Nan::ThrowError(\n \"bad arguments, expected: (uint32 size, uint32 alignment)\"\n );\n }\n const size_t size = info[0]->Uint32Value();\n const size_t alignment = info[1]->Uint32Value();\n if (size == 0) return Nan::ThrowError(\"size must not be 0\");\n if (alignment == 0) return Nan::ThrowError(\"alignment must not be 0\");\n if (alignment & (alignment - 1)) {\n return Nan::ThrowError(\"alignment must be a power of 2\");\n }\n if (alignment % sizeof(void *)) {\n return Nan::ThrowError(\"alignment must be a multiple of pointer size\");\n }\n#if defined(_WIN32)\n void *ptr = _aligned_malloc(size, alignment);\n if (ptr == NULL) return Nan::ThrowError(\"insufficient memory\");\n#else\n void *ptr;\n int result = posix_memalign(&ptr, alignment, size);\n if (result == EINVAL) return Nan::ThrowError(\"bad alignment argument\");\n if (result == ENOMEM) return Nan::ThrowError(\"insufficient memory\");\n if (result != 0) return Nan::ThrowError(\"unexpected error, posix_memalign\");\n#endif\n info.GetReturnValue().Set(\n Nan::NewBuffer(\n (char *) ptr,\n size,\n free_aligned_buffer,\n NULL\n ).ToLocalChecked()\n );\n}\n\nNAN_METHOD(getBlockDevice) {\n if (\n info.Length() != 2 ||\n !info[0]->IsUint32() ||\n !info[1]->IsFunction()\n ) {\n return Nan::ThrowError(\n \"bad arguments, expected: (uint32 fd, function callback)\"\n );\n }\n const int fd = info[0]->Uint32Value();\n Nan::Callback *callback = new Nan::Callback(info[1].As<v8::Function>());\n Nan::AsyncQueueWorker(new GetBlockDeviceWorker(fd, callback));\n}\n\nNAN_METHOD(setF_NOCACHE) {\n#if defined(__APPLE__)\n if (\n info.Length() != 3 ||\n !info[0]->IsUint32() ||\n !info[1]->IsUint32() ||\n !info[2]->IsFunction()\n ) {\n return Nan::ThrowError(\n \"bad arguments, expected: (uint32 fd, uint32 value, function callback)\"\n );\n }\n const int fd = info[0]->Uint32Value();\n const int value = info[1]->Uint32Value();\n if (value != 0 && value != 1) return Nan::ThrowError(\"value must be 0 or 1\");\n Nan::Callback *callback = new Nan::Callback(info[2].As<v8::Function>());\n Nan::AsyncQueueWorker(new SetF_NOCACHEWorker(fd, value, callback));\n#else\n return Nan::ThrowError(\"only supported on mac os\");\n#endif\n}\n\nNAN_METHOD(setFSCTL_LOCK_VOLUME) {\n#if defined(_WIN32)\n if (\n info.Length() != 3 ||\n !info[0]->IsUint32() ||\n !info[1]->IsUint32() ||\n !info[2]->IsFunction()\n ) {\n return Nan::ThrowError(\n \"bad arguments, expected: (uint32 fd, uint32 value, function callback)\"\n );\n }\n const int fd = info[0]->Uint32Value();\n const int value = info[1]->Uint32Value();\n if (value != 0 && value != 1) return Nan::ThrowError(\"value must be 0 or 1\");\n Nan::Callback *callback = new Nan::Callback(info[2].As<v8::Function>());\n Nan::AsyncQueueWorker(new SetFSCTL_LOCK_VOLUMEWorker(fd, value, callback));\n#else\n return Nan::ThrowError(\"only supported on windows\");\n#endif\n}\n\nNAN_MODULE_INIT(Init) {\n#if defined(O_DIRECT)\n NODE_DEFINE_CONSTANT(target, O_DIRECT);\n#endif\n#if defined(O_DSYNC)\n NODE_DEFINE_CONSTANT(target, O_DSYNC);\n#endif\n#if defined(O_EXCL)\n NODE_DEFINE_CONSTANT(target, O_EXCL);\n#endif\n#if defined(O_EXLOCK)\n NODE_DEFINE_CONSTANT(target, O_EXLOCK);\n#endif\n#if defined(O_SYNC)\n NODE_DEFINE_CONSTANT(target, O_SYNC);\n#endif\n NAN_EXPORT(target, getAlignedBuffer);\n NAN_EXPORT(target, getBlockDevice);\n NAN_EXPORT(target, setF_NOCACHE);\n NAN_EXPORT(target, setFSCTL_LOCK_VOLUME);\n}\n\nNODE_MODULE(binding, Init)\n\n\/\/ S.D.G.\n<|endoftext|>"} {"text":"<commit_before>#include <node.h>\n#include <v8.h>\n#include <rpcsvc\/ypclnt.h>\n\nusing namespace v8;\n\nHandle<Value> CreateObject(const Arguments& args) {\n HandleScope scope;\n char* domp;\n int error;\n\n Local<Object> obj = Object::New();\n error = yp_get_default_domain(&domp);\n if (error) {\n Local<String> errorMessage = String::New(yperr_string(error));\n ThrowException(Exception::Error(errorMessage));\n }\n obj->Set(String::NewSymbol(\"domain_name\"), String::New(domp));\n return scope.Close(obj);\n}\n\nvoid init(Handle<Object> exports, Handle<Object> module) {\n module->Set(\n String::NewSymbol(\"exports\"),\n FunctionTemplate::New(CreateObject)->GetFunction()\n );\n}\n\nNODE_MODULE(nis, init);\n<commit_msg>Implement yp.all<commit_after>#include <node.h>\n#include <v8.h>\n#include <rpcsvc\/ypclnt.h>\n\nusing namespace v8;\n\nextern \"C\" {\n int foreach_all(unsigned long instatus, char *inkey, int inkeylen, char *inval, int invallen, void *data);\n}\n\nHandle<Value> All(const Arguments& args) {\n HandleScope scope;\n int error;\n\n if (args.Length() < 2) {\n ThrowException(Exception::TypeError(String::New(\"Not enough arguments\")));\n return scope.Close(Undefined());\n }\n if (!args[0]->IsString()) {\n ThrowException(Exception::TypeError(String::New(\"First argument must be string\")));\n return scope.Close(Undefined());\n }\n if (!args[1]->IsFunction()) {\n ThrowException(Exception::TypeError(String::New(\"Second argument must be function\")));\n return scope.Close(Undefined());\n }\n Local<Function> user_cb = Local<Function>::Cast(args[1]);\n struct ypall_callback cb;\n cb.foreach = foreach_all;\n cb.data = (char *) &user_cb;\n\n String::Utf8Value mapname(args[0]->ToString());\n String::Utf8Value domain(args.Holder()->Get(String::NewSymbol(\"domain_name\")));\n\n error = yp_all(*domain, *mapname, &cb);\n if (error) {\n Local<String> errorMessage = String::New(yperr_string(error));\n ThrowException(Exception::Error(errorMessage));\n }\n\n return scope.Close(Undefined());\n}\n\nextern \"C\"\nint foreach_all(unsigned long instatus, char *inkey, int inkeylen, char *inval, int invallen, void *data) {\n Local<Function> *cb = static_cast<Local<Function> *>(data);\n const int argc = 3;\n Local<Value> argv[argc] = {\n Local<Value>::New(Integer::NewFromUnsigned(instatus)),\n Local<Value>::New(String::New(inkey, inkeylen)),\n Local<Value>::New(String::New(inval, invallen))\n };\n Local<Value> ret = (*cb)->Call(Context::GetCurrent()->Global(), argc, argv);\n return ret->Int32Value();\n}\n\nHandle<Value> CreateObject(const Arguments& args) {\n HandleScope scope;\n char* domp;\n int error;\n\n Local<Object> obj = Object::New();\n error = yp_get_default_domain(&domp);\n if (error) {\n Local<String> errorMessage = String::New(yperr_string(error));\n ThrowException(Exception::Error(errorMessage));\n }\n obj->Set(String::NewSymbol(\"domain_name\"), String::New(domp));\n obj->Set(\n String::NewSymbol(\"all\"),\n FunctionTemplate::New(All)->GetFunction()\n );\n return scope.Close(obj);\n}\n\nvoid init(Handle<Object> exports, Handle<Object> module) {\n module->Set(\n String::NewSymbol(\"exports\"),\n FunctionTemplate::New(CreateObject)->GetFunction()\n );\n}\n\nNODE_MODULE(nis, init);\n<|endoftext|>"} {"text":"<commit_before>\/* -*- Mode: C++; indent-tabs-mode: nil; c-basic-offset: 4 -*- *\/\n\/*\n * This file is part of signon\n *\n * Copyright (C) 2009-2010 Nokia Corporation.\n *\n * Contact: Aurel Popirtac <mailto: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 \"credentialsaccessmanager.h\"\n\n#include \"signond-common.h\"\n#include \"ui-key-authorizer.h\"\n#include \"misc.h\"\n\n#include <QFile>\n#include <QBuffer>\n\n\n#define RETURN_IF_NOT_INITIALIZED(return_value) \\\n do { \\\n if (!m_isInitialized) { \\\n m_error = NotInitialized; \\\n TRACE() << \"CredentialsAccessManager not initialized.\"; \\\n return return_value; \\\n } \\\n } while (0)\n\nusing namespace SignonDaemonNS;\n\n\/* ---------------------- CAMConfiguration ---------------------- *\/\n\nCAMConfiguration::CAMConfiguration()\n : m_storagePath(QLatin1String(signonDefaultStoragePath)),\n m_dbName(QLatin1String(signonDefaultDbName)),\n m_useEncryption(signonDefaultUseEncryption),\n m_fileSystemType(QLatin1String(signonDefaultFileSystemType)),\n m_fileSystemSize(signonMinumumDbSize),\n m_encryptionPassphrase(QByteArray())\n{}\n\nvoid CAMConfiguration::serialize(QIODevice *device)\n{\n if (device == NULL)\n return;\n\n if (!device->open(QIODevice::ReadWrite)) {\n return;\n }\n\n QString buffer;\n QTextStream stream(&buffer);\n stream << \"\\n\\n====== Credentials Access Manager Configuration ======\\n\\n\";\n stream << \"File system mount name \" << encryptedFSPath() << '\\n';\n stream << \"File system format: \" << m_fileSystemType << '\\n';\n stream << \"File system size:\" << m_fileSystemSize << \"megabytes\\n\";\n\n const char *usingEncryption = m_useEncryption ? \"true\" : \"false\";\n stream << \"Using encryption: \" << usingEncryption << '\\n';\n stream << \"Credentials database name: \" << m_dbName << '\\n';\n stream << \"======================================================\\n\\n\";\n device->write(buffer.toUtf8());\n device->close();\n}\n\nQString CAMConfiguration::metadataDBPath() const\n{\n return m_storagePath + QDir::separator() + m_dbName;\n}\n\nQString CAMConfiguration::encryptedFSPath() const\n{\n return m_storagePath +\n QDir::separator() +\n QLatin1String(signonDefaultFileSystemName);\n}\n\n\/* ---------------------- CredentialsAccessManager ---------------------- *\/\n\nCredentialsAccessManager *CredentialsAccessManager::m_pInstance = NULL;\n\nCredentialsAccessManager::CredentialsAccessManager(QObject *parent)\n : QObject(parent),\n m_isInitialized(false),\n m_systemOpened(false),\n m_error(NoError),\n keyManagers(),\n m_pCredentialsDB(NULL),\n m_pCryptoFileSystemManager(NULL),\n m_keyHandler(NULL),\n m_keyAuthorizer(NULL),\n m_CAMConfiguration(CAMConfiguration())\n{\n}\n\nCredentialsAccessManager::~CredentialsAccessManager()\n{\n closeCredentialsSystem();\n\n m_pInstance = NULL;\n}\n\nCredentialsAccessManager *CredentialsAccessManager::instance(QObject *parent)\n{\n if (!m_pInstance)\n m_pInstance = new CredentialsAccessManager(parent);\n\n return m_pInstance;\n}\n\nvoid CredentialsAccessManager::finalize()\n{\n if (m_systemOpened)\n closeCredentialsSystem();\n\n if (m_pCryptoFileSystemManager)\n delete m_pCryptoFileSystemManager;\n\n \/\/ Disconnect all key managers\n foreach (SignOn::AbstractKeyManager *keyManager, keyManagers)\n keyManager->disconnect();\n\n m_isInitialized = false;\n m_error = NoError;\n}\n\nbool CredentialsAccessManager::init(const CAMConfiguration &camConfiguration)\n{\n if (m_isInitialized) {\n TRACE() << \"CAM already initialized.\";\n m_error = AlreadyInitialized;\n return false;\n }\n\n m_CAMConfiguration = camConfiguration;\n\n QBuffer config;\n m_CAMConfiguration.serialize(&config);\n TRACE() << \"\\n\\nInitualizing CredentialsAccessManager with configuration: \" << config.data();\n\n if (!createStorageDir()) {\n BLAME() << \"Failed to create storage directory.\";\n return false;\n }\n\n if (m_CAMConfiguration.m_useEncryption) {\n \/\/Initialize CryptoManager\n m_pCryptoFileSystemManager = new CryptoManager(this);\n QObject::connect(m_pCryptoFileSystemManager, SIGNAL(fileSystemMounted()),\n this, SLOT(onEncryptedFSMounted()));\n QObject::connect(m_pCryptoFileSystemManager, SIGNAL(fileSystemUnmounting()),\n this, SLOT(onEncryptedFSUnmounting()));\n m_pCryptoFileSystemManager->setFileSystemPath(m_CAMConfiguration.encryptedFSPath());\n m_pCryptoFileSystemManager->setFileSystemSize(m_CAMConfiguration.m_fileSystemSize);\n m_pCryptoFileSystemManager->setFileSystemType(m_CAMConfiguration.m_fileSystemType);\n\n m_keyHandler = new KeyHandler(this);\n\n m_keyAuthorizer = new UiKeyAuthorizer(m_keyHandler, this);\n QObject::connect(m_keyAuthorizer,\n SIGNAL(keyAuthorizationQueried(const SignOn::Key,int)),\n this,\n SLOT(onKeyAuthorizationQueried(const SignOn::Key,int)));\n\n \/* These signal connections should be done after instantiating the\n * KeyAuthorizer, so that the KeyAuthorizer's slot will be called\n * first (or we could connect to them in queued mode)\n *\/\n QObject::connect(m_keyHandler, SIGNAL(ready()),\n this, SIGNAL(credentialsSystemReady()));\n QObject::connect(m_keyHandler, SIGNAL(keyInserted(SignOn::Key)),\n this, SLOT(onKeyInserted(SignOn::Key)));\n QObject::connect(m_keyHandler,\n SIGNAL(lastAuthorizedKeyRemoved(SignOn::Key)),\n this,\n SLOT(onLastAuthorizedKeyRemoved(SignOn::Key)));\n QObject::connect(m_keyHandler, SIGNAL(keyRemoved(SignOn::Key)),\n this, SLOT(onKeyRemoved(SignOn::Key)));\n m_keyHandler->initialize(m_pCryptoFileSystemManager, keyManagers);\n }\n\n m_isInitialized = true;\n m_error = NoError;\n\n TRACE() << \"CredentialsAccessManager successfully initialized...\";\n return true;\n}\n\nvoid CredentialsAccessManager::addKeyManager(\n SignOn::AbstractKeyManager *keyManager)\n{\n keyManagers.append(keyManager);\n}\n\nbool CredentialsAccessManager::openSecretsDB()\n{\n \/\/todo remove this variable after LUKS implementation becomes stable.\n QString dbPath;\n\n if (m_CAMConfiguration.m_useEncryption) {\n dbPath = m_pCryptoFileSystemManager->fileSystemMountPath()\n + QDir::separator()\n + m_CAMConfiguration.m_dbName;\n\n if (!m_pCryptoFileSystemManager->fileSystemIsMounted()) {\n \/* Do not attempt to mount the FS; we know that it will be mounted\n * automatically, as soon as some encryption keys are provided *\/\n m_error = CredentialsDbNotMounted;\n return false;\n }\n } else {\n dbPath = m_CAMConfiguration.metadataDBPath() + QLatin1String(\".creds\");\n }\n\n TRACE() << \"Database name: [\" << dbPath << \"]\";\n\n if (!m_pCredentialsDB->openSecretsDB(dbPath))\n return false;\n\n m_error = NoError;\n return true;\n}\n\nbool CredentialsAccessManager::isSecretsDBOpen()\n{\n return m_pCredentialsDB->isSecretsDBOpen();\n}\n\nbool CredentialsAccessManager::closeSecretsDB()\n{\n m_pCredentialsDB->closeSecretsDB();\n\n if (m_CAMConfiguration.m_useEncryption) {\n if (!m_pCryptoFileSystemManager->unmountFileSystem()) {\n m_error = CredentialsDbUnmountFailed;\n return false;\n }\n }\n\n return true;\n}\n\nbool CredentialsAccessManager::createStorageDir()\n{\n QString dbPath = m_CAMConfiguration.metadataDBPath();\n\n QFileInfo fileInfo(dbPath);\n if (!fileInfo.exists()) {\n QDir storageDir(fileInfo.dir());\n if (!storageDir.mkpath(storageDir.path())) {\n BLAME() << \"Could not create storage directory:\" <<\n storageDir.path();\n m_error = CredentialsDbSetupFailed;\n return false;\n }\n setUserOwnership(storageDir.path());\n }\n return true;\n\n}\nbool CredentialsAccessManager::openMetaDataDB()\n{\n QString dbPath = m_CAMConfiguration.metadataDBPath();\n\n m_pCredentialsDB = new CredentialsDB(dbPath);\n\n if (!m_pCredentialsDB->init()) {\n m_error = CredentialsDbConnectionError;\n return false;\n }\n\n return true;\n}\n\nvoid CredentialsAccessManager::closeMetaDataDB()\n{\n if (m_pCredentialsDB) {\n delete m_pCredentialsDB;\n m_pCredentialsDB = NULL;\n }\n}\n\nbool CredentialsAccessManager::openCredentialsSystem()\n{\n RETURN_IF_NOT_INITIALIZED(false);\n\n if (!openMetaDataDB()) {\n BLAME() << \"Couldn't open metadata DB!\";\n return false;\n }\n\n if (!openSecretsDB()) {\n BLAME() << \"Failed to open secrets DB.\";\n \/* Even if the secrets DB couldn't be opened, signond is still usable:\n * that's why we return \"true\" anyways. *\/\n }\n\n m_systemOpened = true;\n return true;\n}\n\nbool CredentialsAccessManager::closeCredentialsSystem()\n{\n RETURN_IF_NOT_INITIALIZED(false);\n\n if (!credentialsSystemOpened())\n return true;\n\n bool allClosed = true;\n if (isSecretsDBOpen() && !closeSecretsDB())\n allClosed = false;\n\n closeMetaDataDB();\n\n m_error = NoError;\n m_systemOpened = false;\n return allClosed;\n}\n\nbool CredentialsAccessManager::deleteCredentialsSystem()\n{\n RETURN_IF_NOT_INITIALIZED(false);\n\n if (m_systemOpened && !closeCredentialsSystem()) {\n \/* The close operation failed: we cannot proceed *\/\n return false;\n }\n\n m_error = NoError;\n\n if (m_CAMConfiguration.m_useEncryption) {\n if (!m_pCryptoFileSystemManager->deleteFileSystem())\n m_error = CredentialsDbDeletionFailed;\n } else {\n QFile dbFile(m_CAMConfiguration.m_dbName);\n if (dbFile.exists()) {\n if (!dbFile.remove())\n m_error = CredentialsDbDeletionFailed;\n }\n }\n\n return m_error == NoError;\n}\n\nCredentialsDB *CredentialsAccessManager::credentialsDB() const\n{\n RETURN_IF_NOT_INITIALIZED(NULL);\n\n return m_pCredentialsDB;\n}\n\nbool CredentialsAccessManager::isCredentialsSystemReady() const\n{\n return (m_keyHandler != 0) ? m_keyHandler->isReady() : true;\n}\n\nvoid CredentialsAccessManager::onKeyInserted(const SignOn::Key key)\n{\n TRACE() << \"Key inserted.\";\n\n if (!m_keyHandler->keyIsAuthorized(key))\n m_keyAuthorizer->queryKeyAuthorization(\n key, AbstractKeyAuthorizer::KeyInserted);\n}\n\nvoid CredentialsAccessManager::onLastAuthorizedKeyRemoved(const SignOn::Key key)\n{\n Q_UNUSED(key);\n TRACE() << \"All keys disabled. Closing secure storage.\";\n if (isSecretsDBOpen() || m_pCryptoFileSystemManager->fileSystemIsMounted())\n if (!closeSecretsDB())\n BLAME() << \"Error occurred while closing secure storage.\";\n}\n\nvoid CredentialsAccessManager::onKeyRemoved(const SignOn::Key key)\n{\n TRACE() << \"Key removed.\";\n\n if (m_keyHandler->keyIsAuthorized(key)) {\n if (!m_keyHandler->revokeKeyAuthorization(key)) {\n BLAME() << \"Revoking key authorization failed\";\n }\n }\n}\n\nvoid CredentialsAccessManager::onKeyAuthorizationQueried(const SignOn::Key key,\n int result)\n{\n TRACE() << \"result:\" << result;\n\n if (result != AbstractKeyAuthorizer::Denied) {\n KeyHandler::AuthorizeFlags flags = KeyHandler::None;\n if (result == AbstractKeyAuthorizer::Exclusive) {\n TRACE() << \"Reformatting secure storage.\";\n flags |= KeyHandler::FormatStorage;\n }\n\n if (!m_keyHandler->authorizeKey(key, flags)) {\n BLAME() << \"Authorization failed\";\n }\n }\n\n replyToSecureStorageEventNotifiers();\n}\n\nbool CredentialsAccessManager::keysAvailable() const\n{\n if (m_keyHandler == 0) return false;\n return !m_keyHandler->insertedKeys().isEmpty();\n}\n\nvoid CredentialsAccessManager::replyToSecureStorageEventNotifiers()\n{\n TRACE();\n \/\/Notify secure storage notifiers if any.\n int eventType = SIGNON_SECURE_STORAGE_NOT_AVAILABLE;\n if ((m_pCredentialsDB != 0) && m_pCredentialsDB->isSecretsDBOpen())\n eventType = SIGNON_SECURE_STORAGE_AVAILABLE;\n\n \/\/ Signal objects that posted secure storage not available events\n foreach (EventSender object, m_secureStorageEventNotifiers) {\n if (object.isNull())\n continue;\n\n SecureStorageEvent *secureStorageEvent =\n new SecureStorageEvent((QEvent::Type)eventType);\n\n QCoreApplication::postEvent(\n object.data(),\n secureStorageEvent,\n Qt::HighEventPriority);\n }\n\n m_secureStorageEventNotifiers.clear();\n}\n\nvoid CredentialsAccessManager::customEvent(QEvent *event)\n{\n TRACE() << \"Custom event received.\";\n if (event->type() != SIGNON_SECURE_STORAGE_NOT_AVAILABLE) {\n QObject::customEvent(event);\n return;\n }\n\n SecureStorageEvent *localEvent =\n static_cast<SecureStorageEvent *>(event);\n\n \/* All senders of this event will receive a reply when\n * the secure storage becomes available or an error occurs. *\/\n m_secureStorageEventNotifiers.append(localEvent->m_sender);\n\n TRACE() << \"Processing secure storage not available event.\";\n if ((localEvent == 0) || (m_pCredentialsDB == 0)) {\n replyToSecureStorageEventNotifiers();\n QObject::customEvent(event);\n return;\n }\n\n \/\/Double check if the secrets DB is indeed unavailable\n if (m_pCredentialsDB->isSecretsDBOpen()) {\n replyToSecureStorageEventNotifiers();\n QObject::customEvent(event);\n return;\n }\n\n SignOn::Key key; \/* we don't specity any key *\/\n m_keyAuthorizer->queryKeyAuthorization(key,\n AbstractKeyAuthorizer::StorageNeeded);\n\n QObject::customEvent(event);\n}\n\nvoid CredentialsAccessManager::onEncryptedFSMounted()\n{\n TRACE();\n if (!credentialsSystemOpened()) return;\n\n if (!isSecretsDBOpen()) {\n if (openSecretsDB()) {\n TRACE() << \"Secrets DB opened.\";\n } else {\n BLAME() << \"Failed to open secrets DB.\";\n }\n } else {\n BLAME() << \"Secrets DB already opened?\";\n }\n}\n\nvoid CredentialsAccessManager::onEncryptedFSUnmounting()\n{\n TRACE();\n if (!credentialsSystemOpened()) return;\n\n if (isSecretsDBOpen()) {\n m_pCredentialsDB->closeSecretsDB();\n }\n}\n\n<commit_msg>CAM: use default key authorizer<commit_after>\/* -*- Mode: C++; indent-tabs-mode: nil; c-basic-offset: 4 -*- *\/\n\/*\n * This file is part of signon\n *\n * Copyright (C) 2009-2010 Nokia Corporation.\n *\n * Contact: Aurel Popirtac <mailto: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 \"credentialsaccessmanager.h\"\n\n#include \"default-key-authorizer.h\"\n#include \"signond-common.h\"\n#include \"misc.h\"\n\n#include <QFile>\n#include <QBuffer>\n\n\n#define RETURN_IF_NOT_INITIALIZED(return_value) \\\n do { \\\n if (!m_isInitialized) { \\\n m_error = NotInitialized; \\\n TRACE() << \"CredentialsAccessManager not initialized.\"; \\\n return return_value; \\\n } \\\n } while (0)\n\nusing namespace SignonDaemonNS;\n\n\/* ---------------------- CAMConfiguration ---------------------- *\/\n\nCAMConfiguration::CAMConfiguration()\n : m_storagePath(QLatin1String(signonDefaultStoragePath)),\n m_dbName(QLatin1String(signonDefaultDbName)),\n m_useEncryption(signonDefaultUseEncryption),\n m_fileSystemType(QLatin1String(signonDefaultFileSystemType)),\n m_fileSystemSize(signonMinumumDbSize),\n m_encryptionPassphrase(QByteArray())\n{}\n\nvoid CAMConfiguration::serialize(QIODevice *device)\n{\n if (device == NULL)\n return;\n\n if (!device->open(QIODevice::ReadWrite)) {\n return;\n }\n\n QString buffer;\n QTextStream stream(&buffer);\n stream << \"\\n\\n====== Credentials Access Manager Configuration ======\\n\\n\";\n stream << \"File system mount name \" << encryptedFSPath() << '\\n';\n stream << \"File system format: \" << m_fileSystemType << '\\n';\n stream << \"File system size:\" << m_fileSystemSize << \"megabytes\\n\";\n\n const char *usingEncryption = m_useEncryption ? \"true\" : \"false\";\n stream << \"Using encryption: \" << usingEncryption << '\\n';\n stream << \"Credentials database name: \" << m_dbName << '\\n';\n stream << \"======================================================\\n\\n\";\n device->write(buffer.toUtf8());\n device->close();\n}\n\nQString CAMConfiguration::metadataDBPath() const\n{\n return m_storagePath + QDir::separator() + m_dbName;\n}\n\nQString CAMConfiguration::encryptedFSPath() const\n{\n return m_storagePath +\n QDir::separator() +\n QLatin1String(signonDefaultFileSystemName);\n}\n\n\/* ---------------------- CredentialsAccessManager ---------------------- *\/\n\nCredentialsAccessManager *CredentialsAccessManager::m_pInstance = NULL;\n\nCredentialsAccessManager::CredentialsAccessManager(QObject *parent)\n : QObject(parent),\n m_isInitialized(false),\n m_systemOpened(false),\n m_error(NoError),\n keyManagers(),\n m_pCredentialsDB(NULL),\n m_pCryptoFileSystemManager(NULL),\n m_keyHandler(NULL),\n m_keyAuthorizer(NULL),\n m_CAMConfiguration(CAMConfiguration())\n{\n}\n\nCredentialsAccessManager::~CredentialsAccessManager()\n{\n closeCredentialsSystem();\n\n m_pInstance = NULL;\n}\n\nCredentialsAccessManager *CredentialsAccessManager::instance(QObject *parent)\n{\n if (!m_pInstance)\n m_pInstance = new CredentialsAccessManager(parent);\n\n return m_pInstance;\n}\n\nvoid CredentialsAccessManager::finalize()\n{\n if (m_systemOpened)\n closeCredentialsSystem();\n\n if (m_pCryptoFileSystemManager)\n delete m_pCryptoFileSystemManager;\n\n \/\/ Disconnect all key managers\n foreach (SignOn::AbstractKeyManager *keyManager, keyManagers)\n keyManager->disconnect();\n\n m_isInitialized = false;\n m_error = NoError;\n}\n\nbool CredentialsAccessManager::init(const CAMConfiguration &camConfiguration)\n{\n if (m_isInitialized) {\n TRACE() << \"CAM already initialized.\";\n m_error = AlreadyInitialized;\n return false;\n }\n\n m_CAMConfiguration = camConfiguration;\n\n QBuffer config;\n m_CAMConfiguration.serialize(&config);\n TRACE() << \"\\n\\nInitualizing CredentialsAccessManager with configuration: \" << config.data();\n\n if (!createStorageDir()) {\n BLAME() << \"Failed to create storage directory.\";\n return false;\n }\n\n if (m_CAMConfiguration.m_useEncryption) {\n \/\/Initialize CryptoManager\n m_pCryptoFileSystemManager = new CryptoManager(this);\n QObject::connect(m_pCryptoFileSystemManager, SIGNAL(fileSystemMounted()),\n this, SLOT(onEncryptedFSMounted()));\n QObject::connect(m_pCryptoFileSystemManager, SIGNAL(fileSystemUnmounting()),\n this, SLOT(onEncryptedFSUnmounting()));\n m_pCryptoFileSystemManager->setFileSystemPath(m_CAMConfiguration.encryptedFSPath());\n m_pCryptoFileSystemManager->setFileSystemSize(m_CAMConfiguration.m_fileSystemSize);\n m_pCryptoFileSystemManager->setFileSystemType(m_CAMConfiguration.m_fileSystemType);\n\n m_keyHandler = new KeyHandler(this);\n\n m_keyAuthorizer = new DefaultKeyAuthorizer(m_keyHandler, this);\n QObject::connect(m_keyAuthorizer,\n SIGNAL(keyAuthorizationQueried(const SignOn::Key,int)),\n this,\n SLOT(onKeyAuthorizationQueried(const SignOn::Key,int)));\n\n \/* These signal connections should be done after instantiating the\n * KeyAuthorizer, so that the KeyAuthorizer's slot will be called\n * first (or we could connect to them in queued mode)\n *\/\n QObject::connect(m_keyHandler, SIGNAL(ready()),\n this, SIGNAL(credentialsSystemReady()));\n QObject::connect(m_keyHandler, SIGNAL(keyInserted(SignOn::Key)),\n this, SLOT(onKeyInserted(SignOn::Key)));\n QObject::connect(m_keyHandler,\n SIGNAL(lastAuthorizedKeyRemoved(SignOn::Key)),\n this,\n SLOT(onLastAuthorizedKeyRemoved(SignOn::Key)));\n QObject::connect(m_keyHandler, SIGNAL(keyRemoved(SignOn::Key)),\n this, SLOT(onKeyRemoved(SignOn::Key)));\n m_keyHandler->initialize(m_pCryptoFileSystemManager, keyManagers);\n }\n\n m_isInitialized = true;\n m_error = NoError;\n\n TRACE() << \"CredentialsAccessManager successfully initialized...\";\n return true;\n}\n\nvoid CredentialsAccessManager::addKeyManager(\n SignOn::AbstractKeyManager *keyManager)\n{\n keyManagers.append(keyManager);\n}\n\nbool CredentialsAccessManager::openSecretsDB()\n{\n \/\/todo remove this variable after LUKS implementation becomes stable.\n QString dbPath;\n\n if (m_CAMConfiguration.m_useEncryption) {\n dbPath = m_pCryptoFileSystemManager->fileSystemMountPath()\n + QDir::separator()\n + m_CAMConfiguration.m_dbName;\n\n if (!m_pCryptoFileSystemManager->fileSystemIsMounted()) {\n \/* Do not attempt to mount the FS; we know that it will be mounted\n * automatically, as soon as some encryption keys are provided *\/\n m_error = CredentialsDbNotMounted;\n return false;\n }\n } else {\n dbPath = m_CAMConfiguration.metadataDBPath() + QLatin1String(\".creds\");\n }\n\n TRACE() << \"Database name: [\" << dbPath << \"]\";\n\n if (!m_pCredentialsDB->openSecretsDB(dbPath))\n return false;\n\n m_error = NoError;\n return true;\n}\n\nbool CredentialsAccessManager::isSecretsDBOpen()\n{\n return m_pCredentialsDB->isSecretsDBOpen();\n}\n\nbool CredentialsAccessManager::closeSecretsDB()\n{\n m_pCredentialsDB->closeSecretsDB();\n\n if (m_CAMConfiguration.m_useEncryption) {\n if (!m_pCryptoFileSystemManager->unmountFileSystem()) {\n m_error = CredentialsDbUnmountFailed;\n return false;\n }\n }\n\n return true;\n}\n\nbool CredentialsAccessManager::createStorageDir()\n{\n QString dbPath = m_CAMConfiguration.metadataDBPath();\n\n QFileInfo fileInfo(dbPath);\n if (!fileInfo.exists()) {\n QDir storageDir(fileInfo.dir());\n if (!storageDir.mkpath(storageDir.path())) {\n BLAME() << \"Could not create storage directory:\" <<\n storageDir.path();\n m_error = CredentialsDbSetupFailed;\n return false;\n }\n setUserOwnership(storageDir.path());\n }\n return true;\n\n}\nbool CredentialsAccessManager::openMetaDataDB()\n{\n QString dbPath = m_CAMConfiguration.metadataDBPath();\n\n m_pCredentialsDB = new CredentialsDB(dbPath);\n\n if (!m_pCredentialsDB->init()) {\n m_error = CredentialsDbConnectionError;\n return false;\n }\n\n return true;\n}\n\nvoid CredentialsAccessManager::closeMetaDataDB()\n{\n if (m_pCredentialsDB) {\n delete m_pCredentialsDB;\n m_pCredentialsDB = NULL;\n }\n}\n\nbool CredentialsAccessManager::openCredentialsSystem()\n{\n RETURN_IF_NOT_INITIALIZED(false);\n\n if (!openMetaDataDB()) {\n BLAME() << \"Couldn't open metadata DB!\";\n return false;\n }\n\n if (!openSecretsDB()) {\n BLAME() << \"Failed to open secrets DB.\";\n \/* Even if the secrets DB couldn't be opened, signond is still usable:\n * that's why we return \"true\" anyways. *\/\n }\n\n m_systemOpened = true;\n return true;\n}\n\nbool CredentialsAccessManager::closeCredentialsSystem()\n{\n RETURN_IF_NOT_INITIALIZED(false);\n\n if (!credentialsSystemOpened())\n return true;\n\n bool allClosed = true;\n if (isSecretsDBOpen() && !closeSecretsDB())\n allClosed = false;\n\n closeMetaDataDB();\n\n m_error = NoError;\n m_systemOpened = false;\n return allClosed;\n}\n\nbool CredentialsAccessManager::deleteCredentialsSystem()\n{\n RETURN_IF_NOT_INITIALIZED(false);\n\n if (m_systemOpened && !closeCredentialsSystem()) {\n \/* The close operation failed: we cannot proceed *\/\n return false;\n }\n\n m_error = NoError;\n\n if (m_CAMConfiguration.m_useEncryption) {\n if (!m_pCryptoFileSystemManager->deleteFileSystem())\n m_error = CredentialsDbDeletionFailed;\n } else {\n QFile dbFile(m_CAMConfiguration.m_dbName);\n if (dbFile.exists()) {\n if (!dbFile.remove())\n m_error = CredentialsDbDeletionFailed;\n }\n }\n\n return m_error == NoError;\n}\n\nCredentialsDB *CredentialsAccessManager::credentialsDB() const\n{\n RETURN_IF_NOT_INITIALIZED(NULL);\n\n return m_pCredentialsDB;\n}\n\nbool CredentialsAccessManager::isCredentialsSystemReady() const\n{\n return (m_keyHandler != 0) ? m_keyHandler->isReady() : true;\n}\n\nvoid CredentialsAccessManager::onKeyInserted(const SignOn::Key key)\n{\n TRACE() << \"Key inserted.\";\n\n if (!m_keyHandler->keyIsAuthorized(key))\n m_keyAuthorizer->queryKeyAuthorization(\n key, AbstractKeyAuthorizer::KeyInserted);\n}\n\nvoid CredentialsAccessManager::onLastAuthorizedKeyRemoved(const SignOn::Key key)\n{\n Q_UNUSED(key);\n TRACE() << \"All keys disabled. Closing secure storage.\";\n if (isSecretsDBOpen() || m_pCryptoFileSystemManager->fileSystemIsMounted())\n if (!closeSecretsDB())\n BLAME() << \"Error occurred while closing secure storage.\";\n}\n\nvoid CredentialsAccessManager::onKeyRemoved(const SignOn::Key key)\n{\n TRACE() << \"Key removed.\";\n\n if (m_keyHandler->keyIsAuthorized(key)) {\n if (!m_keyHandler->revokeKeyAuthorization(key)) {\n BLAME() << \"Revoking key authorization failed\";\n }\n }\n}\n\nvoid CredentialsAccessManager::onKeyAuthorizationQueried(const SignOn::Key key,\n int result)\n{\n TRACE() << \"result:\" << result;\n\n if (result != AbstractKeyAuthorizer::Denied) {\n KeyHandler::AuthorizeFlags flags = KeyHandler::None;\n if (result == AbstractKeyAuthorizer::Exclusive) {\n TRACE() << \"Reformatting secure storage.\";\n flags |= KeyHandler::FormatStorage;\n }\n\n if (!m_keyHandler->authorizeKey(key, flags)) {\n BLAME() << \"Authorization failed\";\n }\n }\n\n replyToSecureStorageEventNotifiers();\n}\n\nbool CredentialsAccessManager::keysAvailable() const\n{\n if (m_keyHandler == 0) return false;\n return !m_keyHandler->insertedKeys().isEmpty();\n}\n\nvoid CredentialsAccessManager::replyToSecureStorageEventNotifiers()\n{\n TRACE();\n \/\/Notify secure storage notifiers if any.\n int eventType = SIGNON_SECURE_STORAGE_NOT_AVAILABLE;\n if ((m_pCredentialsDB != 0) && m_pCredentialsDB->isSecretsDBOpen())\n eventType = SIGNON_SECURE_STORAGE_AVAILABLE;\n\n \/\/ Signal objects that posted secure storage not available events\n foreach (EventSender object, m_secureStorageEventNotifiers) {\n if (object.isNull())\n continue;\n\n SecureStorageEvent *secureStorageEvent =\n new SecureStorageEvent((QEvent::Type)eventType);\n\n QCoreApplication::postEvent(\n object.data(),\n secureStorageEvent,\n Qt::HighEventPriority);\n }\n\n m_secureStorageEventNotifiers.clear();\n}\n\nvoid CredentialsAccessManager::customEvent(QEvent *event)\n{\n TRACE() << \"Custom event received.\";\n if (event->type() != SIGNON_SECURE_STORAGE_NOT_AVAILABLE) {\n QObject::customEvent(event);\n return;\n }\n\n SecureStorageEvent *localEvent =\n static_cast<SecureStorageEvent *>(event);\n\n \/* All senders of this event will receive a reply when\n * the secure storage becomes available or an error occurs. *\/\n m_secureStorageEventNotifiers.append(localEvent->m_sender);\n\n TRACE() << \"Processing secure storage not available event.\";\n if ((localEvent == 0) || (m_pCredentialsDB == 0)) {\n replyToSecureStorageEventNotifiers();\n QObject::customEvent(event);\n return;\n }\n\n \/\/Double check if the secrets DB is indeed unavailable\n if (m_pCredentialsDB->isSecretsDBOpen()) {\n replyToSecureStorageEventNotifiers();\n QObject::customEvent(event);\n return;\n }\n\n SignOn::Key key; \/* we don't specity any key *\/\n m_keyAuthorizer->queryKeyAuthorization(key,\n AbstractKeyAuthorizer::StorageNeeded);\n\n QObject::customEvent(event);\n}\n\nvoid CredentialsAccessManager::onEncryptedFSMounted()\n{\n TRACE();\n if (!credentialsSystemOpened()) return;\n\n if (!isSecretsDBOpen()) {\n if (openSecretsDB()) {\n TRACE() << \"Secrets DB opened.\";\n } else {\n BLAME() << \"Failed to open secrets DB.\";\n }\n } else {\n BLAME() << \"Secrets DB already opened?\";\n }\n}\n\nvoid CredentialsAccessManager::onEncryptedFSUnmounting()\n{\n TRACE();\n if (!credentialsSystemOpened()) return;\n\n if (isSecretsDBOpen()) {\n m_pCredentialsDB->closeSecretsDB();\n }\n}\n\n<|endoftext|>"} {"text":"<commit_before>#include \"handleSerial.h\"\n\n#include <SPI.h>\n#include <SD.h>\n#include \"state.h\"\n#include \"powerSleep.h\"\n\nvoid handleSerial(State_t* State)\n{\n Serial.print(F(\">> User: \"));\n char input; \n if(Serial.available() > 0) \/\/ Check if serial data is available.\n {\n input = Serial.read();\n if (input != '\\n') \/\/ Ignore newline characters.\n Serial.println(input); \/\/ For the Arduino IDE Serial Monitor. Other serial monitors probably don't need this.\n\n switch(input) \/\/ Switch statement for all defined inputs\n {\n case 'c': \/\/ Delete files on the SD Card. Protected from deleting while in use.\n break;\n\n case 'd':\n break;\n\n case 'e':\n Serial.print(F(\">> Logger: Exitting... \"));\n State->serialOn = false;\n Serial.print(F(\">> Logger: Finished.\"));\n power_usart0_disable();\n break;\n\n case 'E':\n break;\n\n case 'h': \/\/ Help list\n Serial.print(F(\">> Logger: List of commands:\\n\"));\n Serial.print(F(\" c -- Clean SD card\\n\"));\n Serial.print(F(\" d -- View date\/time\\n\"));\n Serial.print(F(\" e -- Exit serial interface\\n\"));\n Serial.print(F(\" E -- Eject SD card\\n\"));\n Serial.print(F(\" h -- Display help\\n\"));\n Serial.print(F(\" i -- Initialize the SD card\\n\"));\n Serial.print(F(\" s -- Start datalogging (will overwrite old datalog.csv)\\n\"));\n Serial.print(F(\" S -- Stop datalogging\\n\"));\n Serial.print(F(\" u -- Update date\/time\\n\"));\n break;\n\n case 'i':\n break;\n\n case 's':\n State->logging = true;\n break;\n\n case 'S':\n break;\n\n case 'u':\n break;\n\n case '\\n':\n break;\n\n default: \/\/ If the command is invalid, prompt the user and introduce 'h' option.\n Serial.print(F(\">> Logger: Unknown command. Use the command \\\"h\\\" for a list of commands.\\n\"));\n break;\n }\n }\n}\n\nvoid serialPowerUp()\n{\n power_usart0_enable();\n Serial.begin(9600);\n while(!Serial);\n Serial.print(F(\">> Logger: Logger ready.\\n\"));\n\n return;\n}\n<commit_msg>Update handleSerial.cpp<commit_after>#include \"handleSerial.h\"\n\n#include <SPI.h>\n#include <SD.h>\n#include \"state.h\"\n#include \"powerSleep.h\"\n\nvoid handleSerial(State_t* State)\n{\n char input; \n if(Serial.available() > 0) \/\/ Check if serial data is available.\n {\n input = Serial.read();\n if (input != '\\n') \/\/ Ignore newline characters.\n Serial.println(input); \/\/ For the Arduino IDE Serial Monitor. Other serial monitors probably don't need this.\n\n switch(input) \/\/ Switch statement for all defined inputs\n {\n case 'c': \/\/ Delete files on the SD Card. Protected from deleting while in use.\n break;\n\n case 'd':\n break;\n\n case 'e':\n Serial.print(F(\">> Logger: Exitting... \"));\n State->serialOn = false;\n Serial.print(F(\">> Logger: Finished.\"));\n power_usart0_disable();\n break;\n\n case 'E':\n break;\n\n case 'h': \/\/ Help list\n Serial.print(F(\">> Logger: List of commands:\\n\"));\n Serial.print(F(\" c -- Clean SD card\\n\"));\n Serial.print(F(\" d -- View date\/time\\n\"));\n Serial.print(F(\" e -- Exit serial interface\\n\"));\n Serial.print(F(\" E -- Eject SD card\\n\"));\n Serial.print(F(\" h -- Display help\\n\"));\n Serial.print(F(\" i -- Initialize the SD card\\n\"));\n Serial.print(F(\" s -- Start datalogging (will overwrite old datalog.csv)\\n\"));\n Serial.print(F(\" S -- Stop datalogging\\n\"));\n Serial.print(F(\" u -- Update date\/time\\n\"));\n Serial.print(F(\">> User: \"));\n break;\n\n case 'i':\n break;\n\n case 's':\n State->logging = true;\n break;\n\n case 'S':\n break;\n\n case 'u':\n break;\n\n case '\\n':\n break;\n\n default: \/\/ If the command is invalid, prompt the user and introduce 'h' option.\n Serial.print(F(\">> Logger: Unknown command. Use the command \\\"h\\\" for a list of commands.\\n>> User: \"));\n break;\n }\n }\n}\n\nvoid serialPowerUp()\n{\n power_usart0_enable();\n Serial.begin(9600);\n while(!Serial);\n Serial.print(F(\">> Logger: Logger ready.\\n>> User: \"));\n\n return;\n}\n<|endoftext|>"} {"text":"<commit_before>#include \"Pointer.hpp\"\n#include <Windows.h>\n#include <TlHelp32.h> \/\/GetModuleBase\n#include <memory>\n#include <string>\n\nnamespace Util\n{\n Pointer Pointer::GetModuleBase()\n {\n static void* Base = nullptr;\n\n if( Base == nullptr )\n {\n HANDLE hSnapShot = CreateToolhelp32Snapshot(TH32CS_SNAPMODULE, GetCurrentProcessId());\n if( hSnapShot == INVALID_HANDLE_VALUE )\n return nullptr;\n MODULEENTRY32 lpModuleEntry;\n lpModuleEntry.dwSize = sizeof(MODULEENTRY32);\n int bRet = Module32First(hSnapShot, &lpModuleEntry);\n CloseHandle(hSnapShot);\n Base = (bRet != 0) ? (void*)lpModuleEntry.modBaseAddr : nullptr;\n }\n\n return Pointer(Base);\n }\n\n Pointer Pointer::GetModuleBase(const char* ModuleName)\n {\n HANDLE hSnapShot = CreateToolhelp32Snapshot(TH32CS_SNAPMODULE, GetCurrentProcessId());\n if( hSnapShot == INVALID_HANDLE_VALUE )\n return nullptr;\n\n MODULEENTRY32 lpModuleEntry;\n lpModuleEntry.dwSize = sizeof(MODULEENTRY32);\n BOOL bModule = Module32First(hSnapShot, &lpModuleEntry);\n while( bModule )\n {\n \/\/If module name matches: return it\n if( !std::strcmp(ModuleName, lpModuleEntry.szModule) )\n {\n CloseHandle(hSnapShot);\n return (void*)lpModuleEntry.modBaseAddr;\n }\n bModule = Module32Next(hSnapShot, &lpModuleEntry);\n }\n CloseHandle(hSnapShot);\n return nullptr;\n }\n}<commit_msg>Pointer Module refactor<commit_after>#include \"Pointer.hpp\"\n#include <Windows.h>\n#include <TlHelp32.h> \/\/GetModuleBase\n#include <memory>\n#include <string>\n\nnamespace Util\n{\n Pointer Pointer::GetModuleBase()\n {\n \/\/ Cache base pointer\n static void* CacheBase = nullptr;\n\n if( CacheBase == nullptr )\n {\n void* hSnapShot = CreateToolhelp32Snapshot(\n TH32CS_SNAPMODULE,\n GetCurrentProcessId()\n );\n\n if( hSnapShot == INVALID_HANDLE_VALUE )\n {\n return nullptr;\n }\n\n MODULEENTRY32 lpModuleEntry = { 0 };\n lpModuleEntry.dwSize = sizeof(MODULEENTRY32);\n int bRet = Module32First(hSnapShot, &lpModuleEntry);\n CloseHandle(hSnapShot);\n CacheBase =\n (bRet != 0) ?\n reinterpret_cast<void*>(lpModuleEntry.modBaseAddr)\n : nullptr;\n }\n\n return Pointer(Base);\n }\n\n Pointer Pointer::GetModuleBase(const char* ModuleName)\n {\n void* hSnapShot = CreateToolhelp32Snapshot(\n TH32CS_SNAPMODULE,\n GetCurrentProcessId()\n );\n\n if( hSnapShot == INVALID_HANDLE_VALUE )\n {\n return nullptr;\n }\n\n MODULEENTRY32 lpModuleEntry = { 0 };\n lpModuleEntry.dwSize = sizeof(MODULEENTRY32);\n int32_t bModule = Module32First(hSnapShot, &lpModuleEntry);\n while( bModule )\n {\n \/\/If module name matches: return it\n if( !std::strcmp(ModuleName, lpModuleEntry.szModule) )\n {\n CloseHandle(hSnapShot);\n return reinterpret_cast<void*>(lpModuleEntry.modBaseAddr);\n }\n bModule = Module32Next(hSnapShot, &lpModuleEntry);\n }\n CloseHandle(hSnapShot);\n return nullptr;\n }\n}<|endoftext|>"} {"text":"<commit_before>#include <ShaderCompiler.h>\n#include <ShaderDB.h>\n\n#define WIN32_LEAN_AND_MEAN\n#include <windows.h>\n\nBOOL WINAPI DllMain(_In_ HINSTANCE hinstDLL, _In_ DWORD fdwReason, _In_ LPVOID lpvReserved)\n{\n\tif (fdwReason == DLL_PROCESS_DETACH && !lpvReserved)\n\t{\n\t\tCloseDB();\n\t}\n\n\treturn TRUE;\n}\n\/\/---------------------------------------------------------------------\n<commit_msg>Close DB connection on DLL unloading<commit_after>#include <ShaderCompiler.h>\n#include <ShaderDB.h>\n\n#define WIN32_LEAN_AND_MEAN\n#include <windows.h>\n\nBOOL WINAPI DllMain(_In_ HINSTANCE hinstDLL, _In_ DWORD fdwReason, _In_ LPVOID lpvReserved)\n{\n\tif (fdwReason == DLL_PROCESS_DETACH)\n\t{\n\t\t\/\/ DLL is being unloaded for the current process\n\t\tCloseDB();\n\t}\n\n\treturn TRUE;\n}\n\/\/---------------------------------------------------------------------\n<|endoftext|>"} {"text":"<commit_before>#include \"gtest\/gtest.h\"\n#include \"gmock\/gmock.h\"\n\n#include \"hotel\/planning.h\"\n\nclass HotelPlanning : public testing::Test\n{\npublic:\n boost::gregorian::date makeDate(int day)\n {\n using namespace boost::gregorian;\n return date(2017, 1, 1) + days(day);\n }\n\n hotel::Reservation makeReservation(int room, int from, int to)\n {\n using namespace boost::gregorian;\n return hotel::Reservation(\"\", room, date_period(makeDate(from), makeDate(to)));\n }\n};\n\nclass MockPlanningBoardObserver : public hotel::PlanningBoardObserver\n{\npublic:\n MOCK_METHOD1(reservationsAdded, void(const std::vector<const hotel::Reservation*>& reservations));\n MOCK_METHOD1(reservationsRemoved, void(const std::vector<const hotel::Reservation*>& reservations));\n MOCK_METHOD1(initialUpdate, void(const hotel::PlanningBoard&));\n MOCK_METHOD0(allReservationsRemoved, void());\n};\n\nTEST_F(HotelPlanning, Planning)\n{\n using namespace boost::gregorian;\n auto reservation1 = makeReservation(1, 1, 3);\n auto reservation2 = makeReservation(1, 3, 5);\n auto reservation3 = makeReservation(1, 4, 5);\n auto reservation4 = makeReservation(3, 4, 9);\n auto reservation5 = makeReservation(3, 2, 2);\n\n hotel::PlanningBoard board;\n ASSERT_EQ(0, board.reservations().size());\n ASSERT_EQ(0, board.getReservationsInPeriod(date_period(date(2016, 1, 1), date(2018, 1, 1))).size());\n ASSERT_TRUE(board.getPlanningExtent().is_null());\n\n \/\/ No rooms\n ASSERT_FALSE(board.hasRoom(1));\n ASSERT_FALSE(board.isFree(1, reservation1.dateRange()));\n ASSERT_FALSE(board.canAddReservation(reservation1));\n ASSERT_EQ(0, board.getAvailableDaysFrom(1, date(2016, 1, 1)));\n\n \/\/ Adding rooms\n board.addRoomId(1);\n board.addRoomId(2);\n ASSERT_TRUE(board.hasRoom(1));\n ASSERT_TRUE(board.hasRoom(2));\n ASSERT_FALSE(board.hasRoom(3));\n ASSERT_TRUE(board.isFree(1, reservation1.dateRange()));\n ASSERT_TRUE(board.canAddReservation(reservation1));\n ASSERT_EQ(std::numeric_limits<int>::max(), board.getAvailableDaysFrom(1, makeDate(-100)));\n\n \/\/ Adding reservations\n board.addReservation(std::make_unique<hotel::Reservation>(reservation1));\n board.addReservation(std::make_unique<hotel::Reservation>(reservation2));\n ASSERT_ANY_THROW(board.addReservation(nullptr));\n ASSERT_ANY_THROW(board.addReservation(std::make_unique<hotel::Reservation>(reservation2)));\n ASSERT_ANY_THROW(board.addReservation(std::make_unique<hotel::Reservation>(reservation3)));\n ASSERT_ANY_THROW(board.addReservation(std::make_unique<hotel::Reservation>(reservation4)));\n ASSERT_ANY_THROW(board.addReservation(std::make_unique<hotel::Reservation>(reservation5)));\n ASSERT_EQ(2, board.reservations().size());\n ASSERT_EQ(date_period(makeDate(1), makeDate(5)), board.getPlanningExtent());\n\n board.addReservation(std::make_unique<hotel::Reservation>(makeReservation(2, 2, 4)));\n board.addReservation(std::make_unique<hotel::Reservation>(makeReservation(2, 6, 8)));\n ASSERT_EQ(4, board.reservations().size());\n ASSERT_EQ(date_period(makeDate(1), makeDate(8)), board.getPlanningExtent());\n \/\/ After the above insertions we have the following situation:\n \/\/ Room 1 2 3 4 5 6 7 8 9\n \/\/ 1 [###|###]\n \/\/ 2 [###] [###]\n ASSERT_EQ(11, board.getAvailableDaysFrom(1, makeDate(-10)));\n ASSERT_EQ(1, board.getAvailableDaysFrom(1, makeDate(0)));\n ASSERT_EQ(0, board.getAvailableDaysFrom(1, makeDate(1)));\n ASSERT_EQ(0, board.getAvailableDaysFrom(1, makeDate(3)));\n ASSERT_EQ(0, board.getAvailableDaysFrom(1, makeDate(4)));\n ASSERT_EQ(std::numeric_limits<int>::max(), board.getAvailableDaysFrom(1, makeDate(5)));\n ASSERT_EQ(12, board.getAvailableDaysFrom(2, makeDate(-10)));\n ASSERT_EQ(2, board.getAvailableDaysFrom(2, makeDate(0)));\n ASSERT_EQ(1, board.getAvailableDaysFrom(2, makeDate(1)));\n ASSERT_EQ(0, board.getAvailableDaysFrom(2, makeDate(3)));\n ASSERT_EQ(2, board.getAvailableDaysFrom(2, makeDate(4)));\n ASSERT_EQ(0, board.getAvailableDaysFrom(2, makeDate(6)));\n ASSERT_EQ(0, board.getAvailableDaysFrom(2, makeDate(7)));\n ASSERT_EQ(std::numeric_limits<int>::max(), board.getAvailableDaysFrom(2, makeDate(8)));\n ASSERT_TRUE(board.canAddReservation(makeReservation(1, 0, 1)));\n ASSERT_FALSE(board.canAddReservation(makeReservation(1, 0, 2)));\n ASSERT_TRUE(board.canAddReservation(makeReservation(1, 5, 7)));\n ASSERT_TRUE(board.canAddReservation(makeReservation(2, 4, 5)));\n ASSERT_TRUE(board.canAddReservation(makeReservation(2, 4, 6)));\n ASSERT_FALSE(board.canAddReservation(makeReservation(2, 4, 7)));\n ASSERT_FALSE(board.canAddReservation(makeReservation(2, 10, 10)));\n\n ASSERT_EQ(0, board.getReservationsInPeriod(date_period(makeDate(0), makeDate(1))).size());\n ASSERT_EQ(1, board.getReservationsInPeriod(date_period(makeDate(1), makeDate(2))).size());\n ASSERT_EQ(2, board.getReservationsInPeriod(date_period(makeDate(1), makeDate(3))).size());\n ASSERT_EQ(3, board.getReservationsInPeriod(date_period(makeDate(1), makeDate(4))).size());\n ASSERT_EQ(4, board.getReservationsInPeriod(date_period(makeDate(1), makeDate(7))).size());\n ASSERT_EQ(1, board.getReservationsInPeriod(date_period(makeDate(5), makeDate(7))).size());\n\n \/\/ Test removal of reservations\n auto allReservations = board.getReservationsInPeriod(board.getPlanningExtent());\n ASSERT_EQ(4, allReservations.size());\n board.removeReservation(allReservations[0]);\n ASSERT_EQ(3, board.getReservationsInPeriod(board.getPlanningExtent()).size());\n board.removeReservation(allReservations[1]);\n ASSERT_EQ(2, board.getReservationsInPeriod(board.getPlanningExtent()).size());\n board.removeReservation(allReservations[2]);\n ASSERT_EQ(1, board.getReservationsInPeriod(board.getPlanningExtent()).size());\n board.removeReservation(allReservations[3]);\n ASSERT_EQ(0, board.getReservationsInPeriod(board.getPlanningExtent()).size());\n ASSERT_ANY_THROW(board.removeReservation(nullptr));\n\n \/*\n void addObserver(PlanningBoardObserver* observer);\n void removeObserver(PlanningBoardObserver* observer);\n *\/\n}\n\nTEST_F(HotelPlanning, PlanningBoardObserver)\n{\n hotel::PlanningBoard board;\n board.addRoomId(2);\n MockPlanningBoardObserver observer;\n\n EXPECT_CALL(observer, initialUpdate(testing::_)).Times(1);\n observer.setObservedPlanningBoard(&board);\n testing::Mock::VerifyAndClear(&observer);\n\n \/\/ Add reservations\n EXPECT_CALL(observer, reservationsAdded(testing::_)).Times(2);\n board.addReservation(std::make_unique<hotel::Reservation>(makeReservation(2, 2, 4)));\n board.addReservation(std::make_unique<hotel::Reservation>(makeReservation(2, 6, 8)));\n testing::Mock::VerifyAndClear(&observer);\n\n \/\/ Remove reservations\n EXPECT_CALL(observer, reservationsRemoved(testing::_)).Times(1);\n auto allReservations = board.getReservationsInPeriod(board.getPlanningExtent());\n board.removeReservation(allReservations[0]);\n testing::Mock::VerifyAndClear(&observer);\n\n \/\/ Reset observed board to nullptr\n EXPECT_CALL(observer, allReservationsRemoved()).Times(1);\n observer.setObservedPlanningBoard(nullptr);\n testing::Mock::VerifyAndClear(&observer);\n\n \/\/ Add reservations while no observer attached\n EXPECT_CALL(observer, initialUpdate(testing::_)).Times(1);\n EXPECT_CALL(observer, reservationsAdded(testing::_)).Times(0);\n board.addReservation(std::make_unique<hotel::Reservation>(makeReservation(2, 10, 11)));\n board.addReservation(std::make_unique<hotel::Reservation>(makeReservation(2, 11, 12)));\n observer.setObservedPlanningBoard(&board);\n testing::Mock::VerifyAndClear(&observer);\n}\n<commit_msg>Removed leftover comment in test<commit_after>#include \"gtest\/gtest.h\"\n#include \"gmock\/gmock.h\"\n\n#include \"hotel\/planning.h\"\n\nclass HotelPlanning : public testing::Test\n{\npublic:\n boost::gregorian::date makeDate(int day)\n {\n using namespace boost::gregorian;\n return date(2017, 1, 1) + days(day);\n }\n\n hotel::Reservation makeReservation(int room, int from, int to)\n {\n using namespace boost::gregorian;\n return hotel::Reservation(\"\", room, date_period(makeDate(from), makeDate(to)));\n }\n};\n\nclass MockPlanningBoardObserver : public hotel::PlanningBoardObserver\n{\npublic:\n MOCK_METHOD1(reservationsAdded, void(const std::vector<const hotel::Reservation*>& reservations));\n MOCK_METHOD1(reservationsRemoved, void(const std::vector<const hotel::Reservation*>& reservations));\n MOCK_METHOD1(initialUpdate, void(const hotel::PlanningBoard&));\n MOCK_METHOD0(allReservationsRemoved, void());\n};\n\nTEST_F(HotelPlanning, Planning)\n{\n using namespace boost::gregorian;\n auto reservation1 = makeReservation(1, 1, 3);\n auto reservation2 = makeReservation(1, 3, 5);\n auto reservation3 = makeReservation(1, 4, 5);\n auto reservation4 = makeReservation(3, 4, 9);\n auto reservation5 = makeReservation(3, 2, 2);\n\n hotel::PlanningBoard board;\n ASSERT_EQ(0, board.reservations().size());\n ASSERT_EQ(0, board.getReservationsInPeriod(date_period(date(2016, 1, 1), date(2018, 1, 1))).size());\n ASSERT_TRUE(board.getPlanningExtent().is_null());\n\n \/\/ No rooms\n ASSERT_FALSE(board.hasRoom(1));\n ASSERT_FALSE(board.isFree(1, reservation1.dateRange()));\n ASSERT_FALSE(board.canAddReservation(reservation1));\n ASSERT_EQ(0, board.getAvailableDaysFrom(1, date(2016, 1, 1)));\n\n \/\/ Adding rooms\n board.addRoomId(1);\n board.addRoomId(2);\n ASSERT_TRUE(board.hasRoom(1));\n ASSERT_TRUE(board.hasRoom(2));\n ASSERT_FALSE(board.hasRoom(3));\n ASSERT_TRUE(board.isFree(1, reservation1.dateRange()));\n ASSERT_TRUE(board.canAddReservation(reservation1));\n ASSERT_EQ(std::numeric_limits<int>::max(), board.getAvailableDaysFrom(1, makeDate(-100)));\n\n \/\/ Adding reservations\n board.addReservation(std::make_unique<hotel::Reservation>(reservation1));\n board.addReservation(std::make_unique<hotel::Reservation>(reservation2));\n ASSERT_ANY_THROW(board.addReservation(nullptr));\n ASSERT_ANY_THROW(board.addReservation(std::make_unique<hotel::Reservation>(reservation2)));\n ASSERT_ANY_THROW(board.addReservation(std::make_unique<hotel::Reservation>(reservation3)));\n ASSERT_ANY_THROW(board.addReservation(std::make_unique<hotel::Reservation>(reservation4)));\n ASSERT_ANY_THROW(board.addReservation(std::make_unique<hotel::Reservation>(reservation5)));\n ASSERT_EQ(2, board.reservations().size());\n ASSERT_EQ(date_period(makeDate(1), makeDate(5)), board.getPlanningExtent());\n\n board.addReservation(std::make_unique<hotel::Reservation>(makeReservation(2, 2, 4)));\n board.addReservation(std::make_unique<hotel::Reservation>(makeReservation(2, 6, 8)));\n ASSERT_EQ(4, board.reservations().size());\n ASSERT_EQ(date_period(makeDate(1), makeDate(8)), board.getPlanningExtent());\n \/\/ After the above insertions we have the following situation:\n \/\/ Room 1 2 3 4 5 6 7 8 9\n \/\/ 1 [###|###]\n \/\/ 2 [###] [###]\n ASSERT_EQ(11, board.getAvailableDaysFrom(1, makeDate(-10)));\n ASSERT_EQ(1, board.getAvailableDaysFrom(1, makeDate(0)));\n ASSERT_EQ(0, board.getAvailableDaysFrom(1, makeDate(1)));\n ASSERT_EQ(0, board.getAvailableDaysFrom(1, makeDate(3)));\n ASSERT_EQ(0, board.getAvailableDaysFrom(1, makeDate(4)));\n ASSERT_EQ(std::numeric_limits<int>::max(), board.getAvailableDaysFrom(1, makeDate(5)));\n ASSERT_EQ(12, board.getAvailableDaysFrom(2, makeDate(-10)));\n ASSERT_EQ(2, board.getAvailableDaysFrom(2, makeDate(0)));\n ASSERT_EQ(1, board.getAvailableDaysFrom(2, makeDate(1)));\n ASSERT_EQ(0, board.getAvailableDaysFrom(2, makeDate(3)));\n ASSERT_EQ(2, board.getAvailableDaysFrom(2, makeDate(4)));\n ASSERT_EQ(0, board.getAvailableDaysFrom(2, makeDate(6)));\n ASSERT_EQ(0, board.getAvailableDaysFrom(2, makeDate(7)));\n ASSERT_EQ(std::numeric_limits<int>::max(), board.getAvailableDaysFrom(2, makeDate(8)));\n ASSERT_TRUE(board.canAddReservation(makeReservation(1, 0, 1)));\n ASSERT_FALSE(board.canAddReservation(makeReservation(1, 0, 2)));\n ASSERT_TRUE(board.canAddReservation(makeReservation(1, 5, 7)));\n ASSERT_TRUE(board.canAddReservation(makeReservation(2, 4, 5)));\n ASSERT_TRUE(board.canAddReservation(makeReservation(2, 4, 6)));\n ASSERT_FALSE(board.canAddReservation(makeReservation(2, 4, 7)));\n ASSERT_FALSE(board.canAddReservation(makeReservation(2, 10, 10)));\n\n ASSERT_EQ(0, board.getReservationsInPeriod(date_period(makeDate(0), makeDate(1))).size());\n ASSERT_EQ(1, board.getReservationsInPeriod(date_period(makeDate(1), makeDate(2))).size());\n ASSERT_EQ(2, board.getReservationsInPeriod(date_period(makeDate(1), makeDate(3))).size());\n ASSERT_EQ(3, board.getReservationsInPeriod(date_period(makeDate(1), makeDate(4))).size());\n ASSERT_EQ(4, board.getReservationsInPeriod(date_period(makeDate(1), makeDate(7))).size());\n ASSERT_EQ(1, board.getReservationsInPeriod(date_period(makeDate(5), makeDate(7))).size());\n\n \/\/ Test removal of reservations\n auto allReservations = board.getReservationsInPeriod(board.getPlanningExtent());\n ASSERT_EQ(4, allReservations.size());\n board.removeReservation(allReservations[0]);\n ASSERT_EQ(3, board.getReservationsInPeriod(board.getPlanningExtent()).size());\n board.removeReservation(allReservations[1]);\n ASSERT_EQ(2, board.getReservationsInPeriod(board.getPlanningExtent()).size());\n board.removeReservation(allReservations[2]);\n ASSERT_EQ(1, board.getReservationsInPeriod(board.getPlanningExtent()).size());\n board.removeReservation(allReservations[3]);\n ASSERT_EQ(0, board.getReservationsInPeriod(board.getPlanningExtent()).size());\n ASSERT_ANY_THROW(board.removeReservation(nullptr));\n}\n\nTEST_F(HotelPlanning, PlanningBoardObserver)\n{\n hotel::PlanningBoard board;\n board.addRoomId(2);\n MockPlanningBoardObserver observer;\n\n EXPECT_CALL(observer, initialUpdate(testing::_)).Times(1);\n observer.setObservedPlanningBoard(&board);\n testing::Mock::VerifyAndClear(&observer);\n\n \/\/ Add reservations\n EXPECT_CALL(observer, reservationsAdded(testing::_)).Times(2);\n board.addReservation(std::make_unique<hotel::Reservation>(makeReservation(2, 2, 4)));\n board.addReservation(std::make_unique<hotel::Reservation>(makeReservation(2, 6, 8)));\n testing::Mock::VerifyAndClear(&observer);\n\n \/\/ Remove reservations\n EXPECT_CALL(observer, reservationsRemoved(testing::_)).Times(1);\n auto allReservations = board.getReservationsInPeriod(board.getPlanningExtent());\n board.removeReservation(allReservations[0]);\n testing::Mock::VerifyAndClear(&observer);\n\n \/\/ Reset observed board to nullptr\n EXPECT_CALL(observer, allReservationsRemoved()).Times(1);\n observer.setObservedPlanningBoard(nullptr);\n testing::Mock::VerifyAndClear(&observer);\n\n \/\/ Add reservations while no observer attached\n EXPECT_CALL(observer, initialUpdate(testing::_)).Times(1);\n EXPECT_CALL(observer, reservationsAdded(testing::_)).Times(0);\n board.addReservation(std::make_unique<hotel::Reservation>(makeReservation(2, 10, 11)));\n board.addReservation(std::make_unique<hotel::Reservation>(makeReservation(2, 11, 12)));\n observer.setObservedPlanningBoard(&board);\n testing::Mock::VerifyAndClear(&observer);\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) 2008-2016 TrinityCore <http:\/\/www.trinitycore.org\/>\n * Copyright (C) 2005-2009 MaNGOS <http:\/\/getmangos.com\/>\n *\/\n\n#include \"Creature.h\"\n#include \"CreatureAI.h\"\n#include \"Errors.h\"\n#include \"MoveSpline.h\"\n#include \"MoveSplineInit.h\"\n#include \"Player.h\"\n#include \"PointMovementGenerator.h\"\n#include \"World.h\"\n\n\/\/----- Point Movement Generator\ntemplate<class T>\nvoid PointMovementGenerator<T>::DoInitialize(T* unit)\n{\n if (!unit->IsStopped())\n unit->StopMoving();\n\n unit->AddUnitState(UNIT_STATE_ROAMING | UNIT_STATE_ROAMING_MOVE);\n i_recalculateSpeed = false;\n Movement::MoveSplineInit init(unit);\n if (m_precomputedPath.size() > 2) \/\/ pussywizard: for charge\n init.MovebyPath(m_precomputedPath);\n else if (_generatePath)\n {\n PathGenerator path(unit);\n bool result = path.CalculatePath(i_x, i_y, i_z, _forceDestination);\n if (result && !(path.GetPathType() & PATHFIND_NOPATH) && path.GetPath().size() > 2)\n {\n m_precomputedPath = path.GetPath();\n init.MovebyPath(m_precomputedPath);\n }\n else\n {\n \/\/ Xinef: fix strange client visual bug, moving on z coordinate only switches orientation by 180 degrees (visual only)\n if (G3D::fuzzyEq(unit->GetPositionX(), i_x) && G3D::fuzzyEq(unit->GetPositionY(), i_y))\n {\n i_x += 0.2f * cos(unit->GetOrientation());\n i_y += 0.2f * sin(unit->GetOrientation());\n }\n\n init.MoveTo(i_x, i_y, i_z, true);\n }\n }\n else\n {\n \/\/ Xinef: fix strange client visual bug, moving on z coordinate only switches orientation by 180 degrees (visual only)\n if (G3D::fuzzyEq(unit->GetPositionX(), i_x) && G3D::fuzzyEq(unit->GetPositionY(), i_y))\n {\n i_x += 0.2f * cos(unit->GetOrientation());\n i_y += 0.2f * sin(unit->GetOrientation());\n }\n\n init.MoveTo(i_x, i_y, i_z, true);\n }\n if (speed > 0.0f)\n init.SetVelocity(speed);\n\n if (i_orientation > 0.0f)\n {\n init.SetFacing(i_orientation);\n }\n\n init.Launch();\n}\n\ntemplate<class T>\nbool PointMovementGenerator<T>::DoUpdate(T* unit, uint32 \/*diff*\/)\n{\n if (!unit)\n return false;\n\n if (unit->HasUnitState(UNIT_STATE_ROOT | UNIT_STATE_STUNNED))\n {\n unit->ClearUnitState(UNIT_STATE_ROAMING_MOVE);\n return true;\n }\n\n unit->AddUnitState(UNIT_STATE_ROAMING_MOVE);\n\n if (i_recalculateSpeed && !unit->movespline->Finalized())\n {\n i_recalculateSpeed = false;\n Movement::MoveSplineInit init(unit);\n\n \/\/ xinef: speed changed during path execution, calculate remaining path and launch it once more\n if (m_precomputedPath.size())\n {\n uint32 offset = std::min(uint32(unit->movespline->_currentSplineIdx()), uint32(m_precomputedPath.size()));\n Movement::PointsArray::iterator offsetItr = m_precomputedPath.begin();\n std::advance(offsetItr, offset);\n m_precomputedPath.erase(m_precomputedPath.begin(), offsetItr);\n\n \/\/ restore 0 element (current position)\n m_precomputedPath.insert(m_precomputedPath.begin(), G3D::Vector3(unit->GetPositionX(), unit->GetPositionY(), unit->GetPositionZ()));\n\n if (m_precomputedPath.size() > 2)\n init.MovebyPath(m_precomputedPath);\n else if (m_precomputedPath.size() == 2)\n init.MoveTo(m_precomputedPath[1].x, m_precomputedPath[1].y, m_precomputedPath[1].z, true);\n }\n else\n init.MoveTo(i_x, i_y, i_z, true);\n if (speed > 0.0f) \/\/ Default value for point motion type is 0.0, if 0.0 spline will use GetSpeed on unit\n init.SetVelocity(speed);\n\n if (i_orientation > 0.0f)\n {\n init.SetFacing(i_orientation);\n }\n\n init.Launch();\n }\n\n return !unit->movespline->Finalized();\n}\n\ntemplate<class T>\nvoid PointMovementGenerator<T>::DoFinalize(T* unit)\n{\n unit->ClearUnitState(UNIT_STATE_ROAMING | UNIT_STATE_ROAMING_MOVE);\n\n if (unit->movespline->Finalized())\n MovementInform(unit);\n}\n\ntemplate<class T>\nvoid PointMovementGenerator<T>::DoReset(T* unit)\n{\n if (!unit->IsStopped())\n unit->StopMoving();\n\n unit->AddUnitState(UNIT_STATE_ROAMING | UNIT_STATE_ROAMING_MOVE);\n}\n\ntemplate<class T>\nvoid PointMovementGenerator<T>::MovementInform(T* \/*unit*\/)\n{\n}\n\ntemplate <> void PointMovementGenerator<Creature>::MovementInform(Creature* unit)\n{\n if (unit->AI())\n unit->AI()->MovementInform(POINT_MOTION_TYPE, id);\n}\n\ntemplate void PointMovementGenerator<Player>::DoInitialize(Player*);\ntemplate void PointMovementGenerator<Creature>::DoInitialize(Creature*);\ntemplate void PointMovementGenerator<Player>::DoFinalize(Player*);\ntemplate void PointMovementGenerator<Creature>::DoFinalize(Creature*);\ntemplate void PointMovementGenerator<Player>::DoReset(Player*);\ntemplate void PointMovementGenerator<Creature>::DoReset(Creature*);\ntemplate bool PointMovementGenerator<Player>::DoUpdate(Player*, uint32);\ntemplate bool PointMovementGenerator<Creature>::DoUpdate(Creature*, uint32);\n\nvoid AssistanceMovementGenerator::Finalize(Unit* unit)\n{\n unit->ToCreature()->SetNoCallAssistance(false);\n unit->ToCreature()->CallAssistance();\n if (unit->IsAlive())\n unit->GetMotionMaster()->MoveSeekAssistanceDistract(sWorld->getIntConfig(CONFIG_CREATURE_FAMILY_ASSISTANCE_DELAY));\n}\n\nbool EffectMovementGenerator::Update(Unit* unit, uint32)\n{\n return !unit->movespline->Finalized();\n}\n\nvoid EffectMovementGenerator::Finalize(Unit* unit)\n{\n if (unit->GetTypeId() != TYPEID_UNIT)\n return;\n\n if (unit->GetTypeId() == TYPEID_UNIT && unit->HasUnitMovementFlag(MOVEMENTFLAG_FALLING) && unit->movespline->isFalling()) \/\/ pussywizard\n unit->RemoveUnitMovementFlag(MOVEMENTFLAG_FALLING);\n\n \/\/ Need restore previous movement since we have no proper states system\n \/\/if (unit->IsAlive() && !unit->HasUnitState(UNIT_STATE_CONFUSED | UNIT_STATE_FLEEING))\n \/\/{\n \/\/ if (Unit* victim = unit->GetVictim())\n \/\/ unit->GetMotionMaster()->MoveChase(victim);\n \/\/ else\n \/\/ unit->GetMotionMaster()->Initialize();\n \/\/}\n\n if (unit->ToCreature()->AI())\n unit->ToCreature()->AI()->MovementInform(EFFECT_MOTION_TYPE, m_Id);\n}\n<commit_msg>fix(Core\/Movement): Fix strange teleport when rooting a fleeing NPC (#5555)<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) 2008-2016 TrinityCore <http:\/\/www.trinitycore.org\/>\n * Copyright (C) 2005-2009 MaNGOS <http:\/\/getmangos.com\/>\n *\/\n\n#include \"Creature.h\"\n#include \"CreatureAI.h\"\n#include \"Errors.h\"\n#include \"MoveSpline.h\"\n#include \"MoveSplineInit.h\"\n#include \"Player.h\"\n#include \"PointMovementGenerator.h\"\n#include \"World.h\"\n\n\/\/----- Point Movement Generator\ntemplate<class T>\nvoid PointMovementGenerator<T>::DoInitialize(T* unit)\n{\n if (unit->HasUnitState(UNIT_STATE_ROOT | UNIT_STATE_STUNNED))\n {\n \/\/ the next line is to ensure that a new spline is created in DoUpdate() once the unit is no longer rooted\/stunned\n \/\/ todo: rename this flag to something more appropriate since it is set to true even without speed change now.\n i_recalculateSpeed = true;\n return;\n }\n\n if (!unit->IsStopped())\n unit->StopMoving();\n\n unit->AddUnitState(UNIT_STATE_ROAMING | UNIT_STATE_ROAMING_MOVE);\n i_recalculateSpeed = false;\n Movement::MoveSplineInit init(unit);\n if (m_precomputedPath.size() > 2) \/\/ pussywizard: for charge\n init.MovebyPath(m_precomputedPath);\n else if (_generatePath)\n {\n PathGenerator path(unit);\n bool result = path.CalculatePath(i_x, i_y, i_z, _forceDestination);\n if (result && !(path.GetPathType() & PATHFIND_NOPATH) && path.GetPath().size() > 2)\n {\n m_precomputedPath = path.GetPath();\n init.MovebyPath(m_precomputedPath);\n }\n else\n {\n \/\/ Xinef: fix strange client visual bug, moving on z coordinate only switches orientation by 180 degrees (visual only)\n if (G3D::fuzzyEq(unit->GetPositionX(), i_x) && G3D::fuzzyEq(unit->GetPositionY(), i_y))\n {\n i_x += 0.2f * cos(unit->GetOrientation());\n i_y += 0.2f * sin(unit->GetOrientation());\n }\n\n init.MoveTo(i_x, i_y, i_z, true);\n }\n }\n else\n {\n \/\/ Xinef: fix strange client visual bug, moving on z coordinate only switches orientation by 180 degrees (visual only)\n if (G3D::fuzzyEq(unit->GetPositionX(), i_x) && G3D::fuzzyEq(unit->GetPositionY(), i_y))\n {\n i_x += 0.2f * cos(unit->GetOrientation());\n i_y += 0.2f * sin(unit->GetOrientation());\n }\n\n init.MoveTo(i_x, i_y, i_z, true);\n }\n if (speed > 0.0f)\n init.SetVelocity(speed);\n\n if (i_orientation > 0.0f)\n {\n init.SetFacing(i_orientation);\n }\n\n init.Launch();\n}\n\ntemplate<class T>\nbool PointMovementGenerator<T>::DoUpdate(T* unit, uint32 \/*diff*\/)\n{\n if (!unit)\n return false;\n\n if (unit->HasUnitState(UNIT_STATE_ROOT | UNIT_STATE_STUNNED))\n {\n unit->ClearUnitState(UNIT_STATE_ROAMING_MOVE);\n return true;\n }\n\n unit->AddUnitState(UNIT_STATE_ROAMING_MOVE);\n\n if (i_recalculateSpeed && !unit->movespline->Finalized())\n {\n i_recalculateSpeed = false;\n Movement::MoveSplineInit init(unit);\n\n \/\/ xinef: speed changed during path execution, calculate remaining path and launch it once more\n if (m_precomputedPath.size())\n {\n uint32 offset = std::min(uint32(unit->movespline->_currentSplineIdx()), uint32(m_precomputedPath.size()));\n Movement::PointsArray::iterator offsetItr = m_precomputedPath.begin();\n std::advance(offsetItr, offset);\n m_precomputedPath.erase(m_precomputedPath.begin(), offsetItr);\n\n \/\/ restore 0 element (current position)\n m_precomputedPath.insert(m_precomputedPath.begin(), G3D::Vector3(unit->GetPositionX(), unit->GetPositionY(), unit->GetPositionZ()));\n\n if (m_precomputedPath.size() > 2)\n init.MovebyPath(m_precomputedPath);\n else if (m_precomputedPath.size() == 2)\n init.MoveTo(m_precomputedPath[1].x, m_precomputedPath[1].y, m_precomputedPath[1].z, true);\n }\n else\n init.MoveTo(i_x, i_y, i_z, true);\n if (speed > 0.0f) \/\/ Default value for point motion type is 0.0, if 0.0 spline will use GetSpeed on unit\n init.SetVelocity(speed);\n\n if (i_orientation > 0.0f)\n {\n init.SetFacing(i_orientation);\n }\n\n init.Launch();\n }\n\n return !unit->movespline->Finalized();\n}\n\ntemplate<class T>\nvoid PointMovementGenerator<T>::DoFinalize(T* unit)\n{\n unit->ClearUnitState(UNIT_STATE_ROAMING | UNIT_STATE_ROAMING_MOVE);\n\n if (unit->movespline->Finalized())\n MovementInform(unit);\n}\n\ntemplate<class T>\nvoid PointMovementGenerator<T>::DoReset(T* unit)\n{\n if (!unit->IsStopped())\n unit->StopMoving();\n\n unit->AddUnitState(UNIT_STATE_ROAMING | UNIT_STATE_ROAMING_MOVE);\n}\n\ntemplate<class T>\nvoid PointMovementGenerator<T>::MovementInform(T* \/*unit*\/)\n{\n}\n\ntemplate <> void PointMovementGenerator<Creature>::MovementInform(Creature* unit)\n{\n if (unit->AI())\n unit->AI()->MovementInform(POINT_MOTION_TYPE, id);\n}\n\ntemplate void PointMovementGenerator<Player>::DoInitialize(Player*);\ntemplate void PointMovementGenerator<Creature>::DoInitialize(Creature*);\ntemplate void PointMovementGenerator<Player>::DoFinalize(Player*);\ntemplate void PointMovementGenerator<Creature>::DoFinalize(Creature*);\ntemplate void PointMovementGenerator<Player>::DoReset(Player*);\ntemplate void PointMovementGenerator<Creature>::DoReset(Creature*);\ntemplate bool PointMovementGenerator<Player>::DoUpdate(Player*, uint32);\ntemplate bool PointMovementGenerator<Creature>::DoUpdate(Creature*, uint32);\n\nvoid AssistanceMovementGenerator::Finalize(Unit* unit)\n{\n unit->ToCreature()->SetNoCallAssistance(false);\n unit->ToCreature()->CallAssistance();\n if (unit->IsAlive())\n unit->GetMotionMaster()->MoveSeekAssistanceDistract(sWorld->getIntConfig(CONFIG_CREATURE_FAMILY_ASSISTANCE_DELAY));\n}\n\nbool EffectMovementGenerator::Update(Unit* unit, uint32)\n{\n return !unit->movespline->Finalized();\n}\n\nvoid EffectMovementGenerator::Finalize(Unit* unit)\n{\n if (unit->GetTypeId() != TYPEID_UNIT)\n return;\n\n if (unit->GetTypeId() == TYPEID_UNIT && unit->HasUnitMovementFlag(MOVEMENTFLAG_FALLING) && unit->movespline->isFalling()) \/\/ pussywizard\n unit->RemoveUnitMovementFlag(MOVEMENTFLAG_FALLING);\n\n \/\/ Need restore previous movement since we have no proper states system\n \/\/if (unit->IsAlive() && !unit->HasUnitState(UNIT_STATE_CONFUSED | UNIT_STATE_FLEEING))\n \/\/{\n \/\/ if (Unit* victim = unit->GetVictim())\n \/\/ unit->GetMotionMaster()->MoveChase(victim);\n \/\/ else\n \/\/ unit->GetMotionMaster()->Initialize();\n \/\/}\n\n if (unit->ToCreature()->AI())\n unit->ToCreature()->AI()->MovementInform(EFFECT_MOTION_TYPE, m_Id);\n}\n<|endoftext|>"} {"text":"<commit_before>\/*************************************************************************\n *\n * OpenOffice.org - a multi-platform office productivity suite\n *\n * $RCSfile: inidef.cxx,v $\n *\n * $Revision: 1.3 $\n *\n * last change: $Author: rt $ $Date: 2005-09-08 16:20: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#pragma hdrstop\n\n\n#ifndef _STRING_HXX \/\/autogen\n#include <tools\/string.hxx>\n#endif\n#ifndef _INTN_HXX \/\/autogen\n#include <tools\/intn.hxx>\n#endif\n#include \"inetdef.hxx\"\n#include \"inidef.hxx\"\n\n\/\/========================================================================\n\nclass SfxStdIniDef_Impl: public SfxIniDefaulter\n{\npublic:\n SfxStdIniDef_Impl( SfxIniDefaultManager *pDefMgr )\n : SfxIniDefaulter( pDefMgr )\n {}\n virtual BOOL QueryDefault( String &rValue, const SfxIniEntry &rEntry );\n};\n\n\/\/-------------------------------------------------------------------------\n\nBOOL SfxStdIniDef_Impl::QueryDefault( String &rValue, const SfxIniEntry &rEntry )\n{\n switch ( rEntry.GetKey() )\n {\n case SFX_KEY_BROWSERRESTORE:\n {\n rValue = \"1\";\n return TRUE;\n }\n\n case SFX_KEY_INET_HOME:\n {\n if ( System::GetLanguage() == LANGUAGE_GERMAN )\n rValue = \"http:\/\/www.stardivision.de\";\n else\n rValue = \"http:\/\/www.stardivision.com\";\n return TRUE;\n }\n\n case SFX_KEY_INET_MEMCACHE:\n rValue = \"4\";\n return TRUE;\n\n case SFX_KEY_INET_DISKCACHE:\n rValue = \"2048\";\n return TRUE;\n\n case SFX_KEY_INET_CACHEEXPIRATION:\n rValue = \"3\";\n return TRUE;\n\n case SFX_KEY_INET_MAXHTTPCONS:\n rValue = \"4\";\n return TRUE;\n\n case SFX_KEY_INET_MAXFTPCONS:\n rValue = \"2\";\n return TRUE;\n\n\/\/ case SFX_KEY_INET_JAVAMINHEAP:\n\/\/ rValue = \"256\";\n\/\/ return TRUE;\n\n\/\/ case SFX_KEY_INET_JAVAMAXHEAP:\n\/\/ rValue = \"\";\n\/\/ return TRUE;\n\n case SFX_KEY_INET_USERAGENT:\n rValue = INET_DEF_CALLERNAME;\n return TRUE;\n\n case SFX_KEY_INET_EXE_JAVASCRIPT:\n#ifdef SOLAR_JAVA\n rValue = \"0\"; \/\/ noch \"0\", solange es noch soviel Bugs gibt\n#else\n rValue = \"0\"; \/\/ immer \"0\"\n#endif\n return TRUE;\n\n case SFX_KEY_INET_EXE_PLUGIN:\n rValue = \"1\";\n return TRUE;\n\n\/* case SFX_KEY_INET_JAVA_ENABLE:\n#ifdef SOLAR_JAVA\n rValue = \"1\";\n#else\n rValue = \"0\";\n#endif\n return TRUE; *\/\n\n\/\/ case SFX_KEY_INET_NETACCESS:\n\/\/ rValue = \"2\";\n\/\/ return TRUE;\n\n case SFX_KEY_INET_CHANNELS:\n rValue = \"1\";\n return TRUE;\n\n case SFX_KEY_BASIC_ENABLE:\n rValue = \"1\";\n return TRUE;\n\n case SFX_KEY_INET_COOKIES:\n rValue = \"1\";\n return TRUE;\n\n case SFX_KEY_ICONGRID:\n rValue = \"100;70;0\";\n return TRUE;\n\n case SFX_KEY_METAFILEPRINT:\n rValue = \"1\";\n return TRUE;\n }\n\n return SfxIniDefaulter::QueryDefault( rValue, rEntry );\n}\n\n\/\/=========================================================================\n\nSfxIniDefaultManager::SfxIniDefaultManager()\n: _pList( new SfxIniDefaulterList )\n{\n new SfxStdIniDef_Impl( this );\n}\n\n\/\/-------------------------------------------------------------------------\n\nSfxIniDefaultManager::~SfxIniDefaultManager()\n{\n if ( _pList )\n {\n for ( USHORT n = _pList->Count(); n--; )\n delete _pList->GetObject(n);\n delete _pList;\n }\n}\n\n\/\/-------------------------------------------------------------------------\n\nBOOL SfxIniDefaultManager::QueryDefault\n(\n String& rValue, \/* out: Default-Wert f\"ur 'rEntry'\n (Default ist Leerstring) *\/\n const SfxIniEntry& rEntry \/\/ in: Beschreibung des Eintrags\n)\n\n\/* [Beschreibung]\n\n \"Uber diese interne Methode besorgt sich der <SfxIniManager> den\n Default f\"ur einen in 'rEntry' beschriebenen Eintrag.\n*\/\n\n{\n for ( USHORT n = _pList->Count(); n--; )\n if ( _pList->GetObject(n)->QueryDefault( rValue, rEntry ) )\n return TRUE;\n return FALSE;\n}\n\n\/\/=========================================================================\n\nSfxIniDefaulter::SfxIniDefaulter( SfxIniDefaultManager *pManager )\n\n\/* [Beschreibung]\n\n Der Ctor dieser Klasse meldet die neue Instanz automatisch am\n <SfxiniDefaultManager> 'pManager' an.\n*\/\n\n: _pManager( pManager )\n\n{\n pManager->Insert( this );\n}\n\n\/\/-------------------------------------------------------------------------\n\nSfxIniDefaulter::~SfxIniDefaulter()\n\n\/* [Beschreibung]\n\n Der Dtor dieser Klasse meldet die neue Instanz automatisch am\n <SfxiniDefaultManager> ab, der im Ctor angegeben wurde.\n*\/\n\n{\n _pManager->Remove( this );\n}\n\n\/\/-------------------------------------------------------------------------\n\nBOOL SfxIniDefaulter::QueryDefault\n(\n String& rValue, \/* out: Default-Wert f\"ur 'rEntry'\n (Default ist Leerstring) *\/\n const SfxIniEntry& rEntry \/\/ in: Beschreibung des Eintrags\n)\n\n\/* [Beschreibung]\n\n Diese virtuelle Methode mu\\s \"uberladen werden. Sie soll dann in\n 'rValue' einen Default-Wert f\"ur den in 'rEntry' beschriebenen\n ini-Eintrag setzen, falls ihr dieser bekannt ist.\n\n\n [Returnwert]\n\n TRUE In 'rValue' befindet sich der Default-Wert.\n\n FALSE F\"ur diesen Eintrag ist kein Default-Wert bekannt.\n\n*\/\n\n{\n return FALSE;\n};\n\n\/\/========================================================================\n\nSfxIniEntry::SfxIniEntry\n(\n const String& aGroup,\n const String& aKey,\n SfxIniGroup eGroup,\n SfxIniKey eKey,\n USHORT nIndex\n)\n: _aGroup( aGroup ),\n _aKey( aKey ),\n _eGroup( eGroup ),\n _eKey( eKey ),\n _nIndex( nIndex )\n{\n}\n\n\n<commit_msg>INTEGRATION: CWS internatiodel (1.2.562); FILE MERGED 2006\/01\/19 19:17:05 er 1.2.562.2: RESYNC: (1.2-1.3); FILE MERGED 2005\/06\/24 13:12:46 er 1.2.562.1: #i50205# get rid of class International<commit_after>\/*************************************************************************\n *\n * OpenOffice.org - a multi-platform office productivity suite\n *\n * $RCSfile: inidef.cxx,v $\n *\n * $Revision: 1.4 $\n *\n * last change: $Author: vg $ $Date: 2006-04-07 16:00: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\n#ifndef _STRING_HXX \/\/autogen\n#include <tools\/string.hxx>\n#endif\n#include \"inetdef.hxx\"\n#include \"inidef.hxx\"\n\n\/\/========================================================================\n\nclass SfxStdIniDef_Impl: public SfxIniDefaulter\n{\npublic:\n SfxStdIniDef_Impl( SfxIniDefaultManager *pDefMgr )\n : SfxIniDefaulter( pDefMgr )\n {}\n virtual BOOL QueryDefault( String &rValue, const SfxIniEntry &rEntry );\n};\n\n\/\/-------------------------------------------------------------------------\n\nBOOL SfxStdIniDef_Impl::QueryDefault( String &rValue, const SfxIniEntry &rEntry )\n{\n switch ( rEntry.GetKey() )\n {\n case SFX_KEY_BROWSERRESTORE:\n {\n rValue = \"1\";\n return TRUE;\n }\n\n case SFX_KEY_INET_HOME:\n {\n if ( System::GetLanguage() == LANGUAGE_GERMAN )\n rValue = \"http:\/\/www.stardivision.de\";\n else\n rValue = \"http:\/\/www.stardivision.com\";\n return TRUE;\n }\n\n case SFX_KEY_INET_MEMCACHE:\n rValue = \"4\";\n return TRUE;\n\n case SFX_KEY_INET_DISKCACHE:\n rValue = \"2048\";\n return TRUE;\n\n case SFX_KEY_INET_CACHEEXPIRATION:\n rValue = \"3\";\n return TRUE;\n\n case SFX_KEY_INET_MAXHTTPCONS:\n rValue = \"4\";\n return TRUE;\n\n case SFX_KEY_INET_MAXFTPCONS:\n rValue = \"2\";\n return TRUE;\n\n\/\/ case SFX_KEY_INET_JAVAMINHEAP:\n\/\/ rValue = \"256\";\n\/\/ return TRUE;\n\n\/\/ case SFX_KEY_INET_JAVAMAXHEAP:\n\/\/ rValue = \"\";\n\/\/ return TRUE;\n\n case SFX_KEY_INET_USERAGENT:\n rValue = INET_DEF_CALLERNAME;\n return TRUE;\n\n case SFX_KEY_INET_EXE_JAVASCRIPT:\n#ifdef SOLAR_JAVA\n rValue = \"0\"; \/\/ noch \"0\", solange es noch soviel Bugs gibt\n#else\n rValue = \"0\"; \/\/ immer \"0\"\n#endif\n return TRUE;\n\n case SFX_KEY_INET_EXE_PLUGIN:\n rValue = \"1\";\n return TRUE;\n\n\/* case SFX_KEY_INET_JAVA_ENABLE:\n#ifdef SOLAR_JAVA\n rValue = \"1\";\n#else\n rValue = \"0\";\n#endif\n return TRUE; *\/\n\n\/\/ case SFX_KEY_INET_NETACCESS:\n\/\/ rValue = \"2\";\n\/\/ return TRUE;\n\n case SFX_KEY_INET_CHANNELS:\n rValue = \"1\";\n return TRUE;\n\n case SFX_KEY_BASIC_ENABLE:\n rValue = \"1\";\n return TRUE;\n\n case SFX_KEY_INET_COOKIES:\n rValue = \"1\";\n return TRUE;\n\n case SFX_KEY_ICONGRID:\n rValue = \"100;70;0\";\n return TRUE;\n\n case SFX_KEY_METAFILEPRINT:\n rValue = \"1\";\n return TRUE;\n }\n\n return SfxIniDefaulter::QueryDefault( rValue, rEntry );\n}\n\n\/\/=========================================================================\n\nSfxIniDefaultManager::SfxIniDefaultManager()\n: _pList( new SfxIniDefaulterList )\n{\n new SfxStdIniDef_Impl( this );\n}\n\n\/\/-------------------------------------------------------------------------\n\nSfxIniDefaultManager::~SfxIniDefaultManager()\n{\n if ( _pList )\n {\n for ( USHORT n = _pList->Count(); n--; )\n delete _pList->GetObject(n);\n delete _pList;\n }\n}\n\n\/\/-------------------------------------------------------------------------\n\nBOOL SfxIniDefaultManager::QueryDefault\n(\n String& rValue, \/* out: Default-Wert f\"ur 'rEntry'\n (Default ist Leerstring) *\/\n const SfxIniEntry& rEntry \/\/ in: Beschreibung des Eintrags\n)\n\n\/* [Beschreibung]\n\n \"Uber diese interne Methode besorgt sich der <SfxIniManager> den\n Default f\"ur einen in 'rEntry' beschriebenen Eintrag.\n*\/\n\n{\n for ( USHORT n = _pList->Count(); n--; )\n if ( _pList->GetObject(n)->QueryDefault( rValue, rEntry ) )\n return TRUE;\n return FALSE;\n}\n\n\/\/=========================================================================\n\nSfxIniDefaulter::SfxIniDefaulter( SfxIniDefaultManager *pManager )\n\n\/* [Beschreibung]\n\n Der Ctor dieser Klasse meldet die neue Instanz automatisch am\n <SfxiniDefaultManager> 'pManager' an.\n*\/\n\n: _pManager( pManager )\n\n{\n pManager->Insert( this );\n}\n\n\/\/-------------------------------------------------------------------------\n\nSfxIniDefaulter::~SfxIniDefaulter()\n\n\/* [Beschreibung]\n\n Der Dtor dieser Klasse meldet die neue Instanz automatisch am\n <SfxiniDefaultManager> ab, der im Ctor angegeben wurde.\n*\/\n\n{\n _pManager->Remove( this );\n}\n\n\/\/-------------------------------------------------------------------------\n\nBOOL SfxIniDefaulter::QueryDefault\n(\n String& rValue, \/* out: Default-Wert f\"ur 'rEntry'\n (Default ist Leerstring) *\/\n const SfxIniEntry& rEntry \/\/ in: Beschreibung des Eintrags\n)\n\n\/* [Beschreibung]\n\n Diese virtuelle Methode mu\\s \"uberladen werden. Sie soll dann in\n 'rValue' einen Default-Wert f\"ur den in 'rEntry' beschriebenen\n ini-Eintrag setzen, falls ihr dieser bekannt ist.\n\n\n [Returnwert]\n\n TRUE In 'rValue' befindet sich der Default-Wert.\n\n FALSE F\"ur diesen Eintrag ist kein Default-Wert bekannt.\n\n*\/\n\n{\n return FALSE;\n};\n\n\/\/========================================================================\n\nSfxIniEntry::SfxIniEntry\n(\n const String& aGroup,\n const String& aKey,\n SfxIniGroup eGroup,\n SfxIniKey eKey,\n USHORT nIndex\n)\n: _aGroup( aGroup ),\n _aKey( aKey ),\n _eGroup( eGroup ),\n _eKey( eKey ),\n _nIndex( nIndex )\n{\n}\n\n\n<|endoftext|>"} {"text":"<commit_before>\/*\n * This file is part of ofono-qt\n *\n * Copyright (C) 2010 Nokia Corporation and\/or its subsidiary(-ies).\n *\n * Contact: Alexander Kanavin <alexander.kanavin@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 <QtCore\/QObject>\n\n#include <ofonophonebook.h>\n\n#include <QtDebug>\n\nclass TestOfonoPhonebook : public QObject\n{\n Q_OBJECT\n\nprivate slots:\n\n void initTestCase()\n {\n\tm = new OfonoPhonebook(OfonoModem::ManualSelect, \"\/phonesim\", this);\n\tQCOMPARE(m->modem()->isValid(), true);\t\n\n\tif (!m->modem()->powered()) {\n \t m->modem()->setPowered(true);\n QTest::qWait(5000);\n }\n if (!m->modem()->online()) {\n \t m->modem()->setOnline(true);\n QTest::qWait(5000);\n }\n\t \n }\n\n void testOfonoPhonebook()\n {\n QSignalSpy import(m, SIGNAL(importComplete(bool, QString))); \n\tm->import();\n\n for (int i=0; i<30; i++) {\n if (import.count() > 0)\n break;\n QTest::qWait(1000);\n }\n\tQCOMPARE(import.count(), 1);\n\tQVariantList list = import.takeFirst();\n QCOMPARE(list.at(0).toBool(), true);\t\n QVERIFY(list.at(1).toStringList().length() > 0);\n }\n\n\n void cleanupTestCase()\n {\n\n }\n\n\nprivate:\n OfonoPhonebook *m;\n};\n\nQTEST_MAIN(TestOfonoPhonebook)\n#include \"test_ofonophonebook.moc\"\n<commit_msg>Check interface validity before starting tests<commit_after>\/*\n * This file is part of ofono-qt\n *\n * Copyright (C) 2010 Nokia Corporation and\/or its subsidiary(-ies).\n *\n * Contact: Alexander Kanavin <alexander.kanavin@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 <QtCore\/QObject>\n\n#include <ofonophonebook.h>\n\n#include <QtDebug>\n\nclass TestOfonoPhonebook : public QObject\n{\n Q_OBJECT\n\nprivate slots:\n\n void initTestCase()\n {\n\tm = new OfonoPhonebook(OfonoModem::ManualSelect, \"\/phonesim\", this);\n\tQCOMPARE(m->modem()->isValid(), true);\t\n\n\tif (!m->modem()->powered()) {\n \t m->modem()->setPowered(true);\n QTest::qWait(5000);\n }\n if (!m->modem()->online()) {\n \t m->modem()->setOnline(true);\n QTest::qWait(5000);\n }\n\tQCOMPARE(m->isValid(), true); \n }\n\n void testOfonoPhonebook()\n {\n QSignalSpy import(m, SIGNAL(importComplete(bool, QString))); \n\tm->import();\n\n for (int i=0; i<30; i++) {\n if (import.count() > 0)\n break;\n QTest::qWait(1000);\n }\n\tQCOMPARE(import.count(), 1);\n\tQVariantList list = import.takeFirst();\n QCOMPARE(list.at(0).toBool(), true);\t\n QVERIFY(list.at(1).toStringList().length() > 0);\n }\n\n\n void cleanupTestCase()\n {\n\n }\n\n\nprivate:\n OfonoPhonebook *m;\n};\n\nQTEST_MAIN(TestOfonoPhonebook)\n#include \"test_ofonophonebook.moc\"\n<|endoftext|>"} {"text":"<commit_before>\/*************************************************************************\n *\n * OpenOffice.org - a multi-platform office productivity suite\n *\n * $RCSfile: transfrm.hxx,v $\n *\n * $Revision: 1.5 $\n *\n * last change: $Author: hr $ $Date: 2006-04-19 13:47:32 $\n *\n * The Contents of this file are made available subject to\n * the terms of GNU Lesser General Public License Version 2.1.\n *\n *\n * GNU Lesser General Public License Version 2.1\n * =============================================\n * Copyright 2005 by Sun Microsystems, Inc.\n * 901 San Antonio Road, Palo Alto, CA 94303, USA\n *\n * This library is free software; you can redistribute it and\/or\n * modify it under the terms of the GNU Lesser General Public\n * License version 2.1, as published by the Free Software Foundation.\n *\n * This library is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU\n * Lesser General Public License for more details.\n *\n * You should have received a copy of the GNU Lesser General Public\n * License along with this library; if not, write to the Free Software\n * Foundation, Inc., 59 Temple Place, Suite 330, Boston,\n * MA 02111-1307 USA\n *\n ************************************************************************\/\n#ifndef _SVX_TRANSFRM_HXX\n#define _SVX_TRANSFRM_HXX\n\n\/\/ include ---------------------------------------------------------------\n\n#include \"dlgctrl.hxx\"\n\n#ifndef _FIXED_HXX \/\/autogen\n#include <vcl\/fixed.hxx>\n#endif\nclass SdrView;\n\n\/*************************************************************************\n|*\n|* Transform-Tab-Dialog\n|*\n\\************************************************************************\/\n\n\/** put this into the nAnchorTypes parameter of the SvxTransformTabDialog c'tor\n to disable the size controls *\/\nconst USHORT SVX_OBJ_NORESIZE = 0x0100;\n\n\/** put this into the nAnchorTypes parameter of the SvxTransformTabDialog c'tor\n to disable the protect controls *\/\nconst USHORT SVX_OBJ_NOPROTECT = 0x0200;\n\nclass SvxTransformTabDialog : public SfxTabDialog\n{\nprivate:\n const SdrView* pView;\n\n USHORT nAnchorCtrls;\n Link aValidateLink;\n\n virtual void PageCreated( USHORT nId, SfxTabPage &rPage );\n\npublic:\n\n SvxTransformTabDialog( Window* pParent, const SfxItemSet* pAttr,\n const SdrView* pView,\n USHORT nAnchorTypes = 0);\n ~SvxTransformTabDialog();\n\n \/\/link for the Writer to validate positions\n void SetValidateFramePosLink( const Link& rLink );\n};\n\n\/*************************************************************************\n|*\n|* position and size tab page\n|*\n\\************************************************************************\/\n\nclass SvxPositionSizeTabPage : public SvxTabPage\n{\nprivate:\n \/\/ position\n FixedLine maFlPosition;\n FixedText maFtPosX;\n MetricField maMtrPosX;\n FixedText maFtPosY;\n MetricField maMtrPosY;\n FixedText maFtPosReference;\n SvxRectCtl maCtlPos;\n\n \/\/ size\n FixedLine maFlSize;\n FixedText maFtWidth;\n MetricField maMtrWidth;\n FixedText maFtHeight;\n MetricField maMtrHeight;\n CheckBox maCbxScale;\n FixedText maFtSizeReference;\n SvxRectCtl maCtlSize;\n\n\/* \/\/ anchor\n FixedLine maAnchorBox;\n FixedText maFtAnchor;\n ListBox maDdLbAnchor;\n*\/\n \/\/ protect\n FixedLine maFlProtect;\n TriStateBox maTsbPosProtect;\n TriStateBox maTsbSizeProtect;\n\n \/\/ adjust\n FixedLine maFlAdjust;\n TriStateBox maTsbAutoGrowWidth;\n TriStateBox maTsbAutoGrowHeight;\n\n \/\/ ???\n\/\/ FixedText maFtOrient;\n\/\/ ListBox maDdLbOrient;\n\n FixedLine maFlDivider;\n\nprivate:\n const SfxItemSet& mrOutAttrs;\n\n const SdrView* mpView;\n Rectangle maRect;\n Rectangle maWorkArea;\n\n Point maAnchorPos;\n SfxMapUnit mePoolUnit;\n FieldUnit meDlgUnit;\n MapUnit meMapUnit;\n TriState mnProtectSizeState;\n bool mbPageDisabled;\n bool mbProtectDisabled;\n bool mbSizeDisabled;\n\n \/\/ frome size\n UINT32 mlOldWidth;\n UINT32 mlOldHeight;\n RECT_POINT meRP;\n\n \/\/------------------------------------\n#if _SOLAR__PRIVATE\n DECL_LINK( ChangePosProtectHdl, void * );\n DECL_LINK( ChangeSizeProtectHdl, void * );\n DECL_LINK( ChangePosXHdl, void * );\n DECL_LINK( ChangePosYHdl, void * );\n\/\/ DECL_LINK( SetAnchorHdl, ListBox * );\n\/\/ DECL_LINK( SetOrientHdl, ListBox * );\n\n void SetMinMaxPosition();\n void GetTopLeftPosition( long& rX, long& rY, const Rectangle& rRect );\n#endif\n\n#if _SOLAR__PRIVATE\n DECL_LINK( ChangeWidthHdl, void * );\n DECL_LINK( ChangeHeightHdl, void * );\n DECL_LINK( ClickSizeProtectHdl, void * );\n DECL_LINK( ClickAutoHdl, void * );\n\n void DisableSizeControls();\n void SetMaxSize( Rectangle aRect );\n Rectangle GetRect();\n#endif\n\npublic:\n SvxPositionSizeTabPage( Window* pParent, const SfxItemSet& rInAttrs );\n\n static SfxTabPage* Create( Window*, const SfxItemSet& );\n static USHORT* GetRanges();\n\n virtual BOOL FillItemSet( SfxItemSet& );\n virtual void Reset( const SfxItemSet & );\n\n virtual void ActivatePage( const SfxItemSet& rSet );\n virtual int DeactivatePage( SfxItemSet* pSet );\n\n virtual void PointChanged( Window* pWindow, RECT_POINT eRP );\n\n void Construct();\n void SetView( const SdrView* pSdrView ) { mpView = pSdrView; }\n\n\/\/ void ShowAnchorCtrls(USHORT nAnchorCtrls); \/\/ Writer-spezifische Controls anzeigen\n virtual void FillUserData();\n\n void DisableResize();\n void DisableProtect();\n};\n\n\/*************************************************************************\n|*\n|* Drehwinkel-Tab-Page\n|*\n\\************************************************************************\/\nclass SvxAngleTabPage : public SvxTabPage\n{\nprivate:\n FixedLine aFlPosition;\n FixedText aFtPosX;\n MetricField aMtrPosX;\n FixedText aFtPosY;\n MetricField aMtrPosY;\n FixedText aFtPosPresets;\n SvxRectCtl aCtlRect;\n\n FixedLine aFlAngle;\n FixedText aFtAngle;\n MetricField aMtrAngle;\n FixedText aFtAnglePresets;\n SvxRectCtl aCtlAngle;\n\n const SfxItemSet& rOutAttrs;\n\n const SdrView* pView;\n Rectangle aRect;\n\n Point aAnchorPos;\n SfxMapUnit ePoolUnit;\n FieldUnit eDlgUnit;\n MapUnit eMapUnit;\n \/\/------------------------------------\n#if _SOLAR__PRIVATE\n DECL_LINK( ModifiedHdl, void * );\n#endif\npublic:\n SvxAngleTabPage( Window* pParent, const SfxItemSet& rInAttrs );\n\n static SfxTabPage* Create( Window*, const SfxItemSet& );\n static USHORT* GetRanges();\n\n virtual BOOL FillItemSet( SfxItemSet& );\n virtual void Reset( const SfxItemSet & );\n\n virtual void ActivatePage( const SfxItemSet& rSet );\n virtual int DeactivatePage( SfxItemSet* pSet );\n\n virtual void PointChanged( Window* pWindow, RECT_POINT eRP );\n\n void Construct();\n void SetView( const SdrView* pSdrView ) { pView = pSdrView; }\n};\n\n\/*************************************************************************\n|*\n|* Schraegstellen\/Eckenradius-Tab-Page\n|*\n\\************************************************************************\/\nclass SvxSlantTabPage : public SvxTabPage\n{\nprivate:\n FixedLine aFlRadius;\n FixedText aFtRadius;\n MetricField aMtrRadius;\n \/\/TriStateBox aTsbVertical;\n FixedLine aFlAngle;\n FixedText aFtAngle;\n MetricField aMtrAngle;\n \/\/SvxRectCtl aCtlAngle;\n\n const SfxItemSet& rOutAttrs;\n\n const SdrView* pView;\n Rectangle aRect;\n\n SfxMapUnit ePoolUnit;\n FieldUnit eDlgUnit;\n MapUnit eMapUnit;\n \/\/------------------------------------\n#if _SOLAR__PRIVATE\n DECL_LINK( ModifiedHdl, void * );\n#endif\npublic:\n SvxSlantTabPage( Window* pParent, const SfxItemSet& rInAttrs );\n\n static SfxTabPage* Create( Window*, const SfxItemSet& );\n static USHORT* GetRanges();\n\n virtual BOOL FillItemSet( SfxItemSet& );\n virtual void Reset( const SfxItemSet & );\n\n virtual void ActivatePage( const SfxItemSet& rSet );\n virtual int DeactivatePage( SfxItemSet* pSet );\n\n virtual void PointChanged( Window* pWindow, RECT_POINT eRP );\n\n void Construct();\n void SetView( const SdrView* pSdrView ) { pView = pSdrView; }\n};\n\n\n\n#endif \/\/ _SVX_TRANSFRM_HXX\n\n<commit_msg>INTEGRATION: CWS warnings01 (1.4.222); FILE MERGED 2006\/05\/23 18:28:41 sb 1.4.222.2: RESYNC: (1.4-1.5); FILE MERGED 2006\/05\/05 11:03:43 os 1.4.222.1: warnings removed<commit_after>\/*************************************************************************\n *\n * OpenOffice.org - a multi-platform office productivity suite\n *\n * $RCSfile: transfrm.hxx,v $\n *\n * $Revision: 1.6 $\n *\n * last change: $Author: hr $ $Date: 2006-06-19 15:36: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#ifndef _SVX_TRANSFRM_HXX\n#define _SVX_TRANSFRM_HXX\n\n\/\/ include ---------------------------------------------------------------\n\n#include \"dlgctrl.hxx\"\n\n#ifndef _FIXED_HXX \/\/autogen\n#include <vcl\/fixed.hxx>\n#endif\nclass SdrView;\n\n\/*************************************************************************\n|*\n|* Transform-Tab-Dialog\n|*\n\\************************************************************************\/\n\n\/** put this into the nAnchorTypes parameter of the SvxTransformTabDialog c'tor\n to disable the size controls *\/\nconst USHORT SVX_OBJ_NORESIZE = 0x0100;\n\n\/** put this into the nAnchorTypes parameter of the SvxTransformTabDialog c'tor\n to disable the protect controls *\/\nconst USHORT SVX_OBJ_NOPROTECT = 0x0200;\n\nclass SvxTransformTabDialog : public SfxTabDialog\n{\nprivate:\n const SdrView* pView;\n\n USHORT nAnchorCtrls;\n Link aValidateLink;\n\n virtual void PageCreated( USHORT nId, SfxTabPage &rPage );\n\npublic:\n\n SvxTransformTabDialog( Window* pParent, const SfxItemSet* pAttr,\n const SdrView* pView,\n USHORT nAnchorTypes = 0);\n ~SvxTransformTabDialog();\n\n \/\/link for the Writer to validate positions\n void SetValidateFramePosLink( const Link& rLink );\n};\n\n\/*************************************************************************\n|*\n|* position and size tab page\n|*\n\\************************************************************************\/\n\nclass SvxPositionSizeTabPage : public SvxTabPage\n{\nprivate:\n \/\/ position\n FixedLine maFlPosition;\n FixedText maFtPosX;\n MetricField maMtrPosX;\n FixedText maFtPosY;\n MetricField maMtrPosY;\n FixedText maFtPosReference;\n SvxRectCtl maCtlPos;\n\n \/\/ size\n FixedLine maFlSize;\n FixedText maFtWidth;\n MetricField maMtrWidth;\n FixedText maFtHeight;\n MetricField maMtrHeight;\n CheckBox maCbxScale;\n FixedText maFtSizeReference;\n SvxRectCtl maCtlSize;\n\n \/\/ protect\n FixedLine maFlProtect;\n TriStateBox maTsbPosProtect;\n TriStateBox maTsbSizeProtect;\n\n \/\/ adjust\n FixedLine maFlAdjust;\n TriStateBox maTsbAutoGrowWidth;\n TriStateBox maTsbAutoGrowHeight;\n\n FixedLine maFlDivider;\n\nprivate:\n const SfxItemSet& mrOutAttrs;\n\n const SdrView* mpView;\n Rectangle maRect;\n Rectangle maWorkArea;\n\n Point maAnchorPos;\n SfxMapUnit mePoolUnit;\n FieldUnit meDlgUnit;\n MapUnit meMapUnit;\n TriState mnProtectSizeState;\n bool mbPageDisabled;\n bool mbProtectDisabled;\n bool mbSizeDisabled;\n\n \/\/ frome size\n UINT32 mlOldWidth;\n UINT32 mlOldHeight;\n RECT_POINT meRP;\n\n \/\/------------------------------------\n#if _SOLAR__PRIVATE\n DECL_LINK( ChangePosProtectHdl, void * );\n DECL_LINK( ChangeSizeProtectHdl, void * );\n DECL_LINK( ChangePosXHdl, void * );\n DECL_LINK( ChangePosYHdl, void * );\n\/\/ DECL_LINK( SetAnchorHdl, ListBox * );\n\/\/ DECL_LINK( SetOrientHdl, ListBox * );\n\n void SetMinMaxPosition();\n void GetTopLeftPosition( long& rX, long& rY, const Rectangle& rRect );\n#endif\n\n#if _SOLAR__PRIVATE\n DECL_LINK( ChangeWidthHdl, void * );\n DECL_LINK( ChangeHeightHdl, void * );\n DECL_LINK( ClickSizeProtectHdl, void * );\n DECL_LINK( ClickAutoHdl, void * );\n\n void DisableSizeControls();\n void SetMaxSize( Rectangle aRect );\n Rectangle GetRect();\n#endif\n\npublic:\n SvxPositionSizeTabPage( Window* pParent, const SfxItemSet& rInAttrs );\n\n static SfxTabPage* Create( Window*, const SfxItemSet& );\n static USHORT* GetRanges();\n\n virtual BOOL FillItemSet( SfxItemSet& );\n virtual void Reset( const SfxItemSet & );\n\n virtual void ActivatePage( const SfxItemSet& rSet );\n virtual int DeactivatePage( SfxItemSet* pSet );\n\n virtual void PointChanged( Window* pWindow, RECT_POINT eRP );\n\n void Construct();\n void SetView( const SdrView* pSdrView ) { mpView = pSdrView; }\n\n\/\/ void ShowAnchorCtrls(USHORT nAnchorCtrls); \/\/ Writer-spezifische Controls anzeigen\n virtual void FillUserData();\n\n void DisableResize();\n void DisableProtect();\n};\n\n\/*************************************************************************\n|*\n|* Drehwinkel-Tab-Page\n|*\n\\************************************************************************\/\nclass SvxAngleTabPage : public SvxTabPage\n{\nprivate:\n FixedLine aFlPosition;\n FixedText aFtPosX;\n MetricField aMtrPosX;\n FixedText aFtPosY;\n MetricField aMtrPosY;\n FixedText aFtPosPresets;\n SvxRectCtl aCtlRect;\n\n FixedLine aFlAngle;\n FixedText aFtAngle;\n MetricField aMtrAngle;\n FixedText aFtAnglePresets;\n SvxRectCtl aCtlAngle;\n\n const SfxItemSet& rOutAttrs;\n\n const SdrView* pView;\n Rectangle aRect;\n\n Point aAnchorPos;\n SfxMapUnit ePoolUnit;\n FieldUnit eDlgUnit;\n MapUnit eMapUnit;\n \/\/------------------------------------\n#if _SOLAR__PRIVATE\n DECL_LINK( ModifiedHdl, void * );\n#endif\npublic:\n SvxAngleTabPage( Window* pParent, const SfxItemSet& rInAttrs );\n\n static SfxTabPage* Create( Window*, const SfxItemSet& );\n static USHORT* GetRanges();\n\n virtual BOOL FillItemSet( SfxItemSet& );\n virtual void Reset( const SfxItemSet & );\n\n virtual void ActivatePage( const SfxItemSet& rSet );\n virtual int DeactivatePage( SfxItemSet* pSet );\n\n virtual void PointChanged( Window* pWindow, RECT_POINT eRP );\n\n void Construct();\n void SetView( const SdrView* pSdrView ) { pView = pSdrView; }\n};\n\n\/*************************************************************************\n|*\n|* Schraegstellen\/Eckenradius-Tab-Page\n|*\n\\************************************************************************\/\nclass SvxSlantTabPage : public SvxTabPage\n{\nprivate:\n FixedLine aFlRadius;\n FixedText aFtRadius;\n MetricField aMtrRadius;\n \/\/TriStateBox aTsbVertical;\n FixedLine aFlAngle;\n FixedText aFtAngle;\n MetricField aMtrAngle;\n \/\/SvxRectCtl aCtlAngle;\n\n const SfxItemSet& rOutAttrs;\n\n const SdrView* pView;\n Rectangle aRect;\n\n SfxMapUnit ePoolUnit;\n FieldUnit eDlgUnit;\n MapUnit eMapUnit;\n \/\/------------------------------------\npublic:\n SvxSlantTabPage( Window* pParent, const SfxItemSet& rInAttrs );\n\n static SfxTabPage* Create( Window*, const SfxItemSet& );\n static USHORT* GetRanges();\n\n virtual BOOL FillItemSet( SfxItemSet& );\n virtual void Reset( const SfxItemSet & );\n\n virtual void ActivatePage( const SfxItemSet& rSet );\n virtual int DeactivatePage( SfxItemSet* pSet );\n\n virtual void PointChanged( Window* pWindow, RECT_POINT eRP );\n\n void Construct();\n void SetView( const SdrView* pSdrView ) { pView = pSdrView; }\n};\n\n\n\n#endif \/\/ _SVX_TRANSFRM_HXX\n\n<|endoftext|>"} {"text":"<commit_before><commit_msg>translate comments<commit_after><|endoftext|>"} {"text":"<commit_before>\/\/\n\/\/ Copyright (c) 2011 Kim Walisch, <kim.walisch@gmail.com>.\n\/\/ All rights reserved.\n\/\/\n\/\/ This file is part of primesieve.\n\/\/ Visit: http:\/\/primesieve.googlecode.com\n\/\/\n\/\/ Redistribution and use in source and binary forms, with or without\n\/\/ modification, are permitted provided that the following conditions\n\/\/ are met:\n\/\/\n\/\/ * Redistributions of source code must retain the above copyright\n\/\/ notice, this list of conditions and the following disclaimer.\n\/\/ * Redistributions in binary form must reproduce the above\n\/\/ copyright notice, this list of conditions and the following\n\/\/ disclaimer in the documentation and\/or other materials provided\n\/\/ with the distribution.\n\/\/ * Neither the name of the author nor the names of its\n\/\/ contributors may be used to endorse or promote products derived\n\/\/ from this software without specific prior written permission.\n\/\/\n\/\/ THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS\n\/\/ \"AS IS\" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT\n\/\/ LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS\n\/\/ FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE\n\/\/ COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT,\n\/\/ INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES\n\/\/ (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR\n\/\/ SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)\n\/\/ HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT,\n\/\/ STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)\n\/\/ ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED\n\/\/ OF THE POSSIBILITY OF SUCH DAMAGE.\n\n#include \"PreSieve.h\"\n#include \"SieveOfEratosthenes.h\"\n\n#include <stdexcept>\n#include <cstdlib>\n#include <cstring>\n#include <cassert>\n\nconst uint32_t PreSieve::smallPrimes_[9] = { 2, 3, 5, 7, 11, 13, 17, 19, 23 };\n\n\/**\n * Pre-sieve multiples of small primes <= limit to speed up the sieve\n * of Eratosthenes.\n * @pre limit >= 11 && limit <= 23\n * @see SieveOfEratosthenes::sieve(uint32_t)\n *\/\nPreSieve::PreSieve(uint32_t limit) : wheelArray_(NULL), size_(0) {\n \/\/ limit <= 23 prevents 32 bit overflows\n if (limit < 11 || limit > 23)\n throw std::overflow_error(\"PreSieve: limit must be >= 11 && <= 23.\");\n limit_ = limit;\n primeProduct_ = this->getPrimeProduct(limit_);\n size_ = primeProduct_ \/ SieveOfEratosthenes::NUMBERS_PER_BYTE;\n this->initWheelArray();\n}\n\nPreSieve::~PreSieve() {\n delete[] wheelArray_;\n}\n\nuint32_t PreSieve::getPrimeProduct(uint32_t limit) const {\n assert(limit <= 23);\n uint32_t pp = 1;\n for (int i = 0; i < 9 && smallPrimes_[i] <= limit; i++)\n pp *= smallPrimes_[i];\n return pp;\n}\n\n\/**\n * Allocate the wheelArray_ and remove the multiples of small\n * primes <= limit_ from it.\n *\/\nvoid PreSieve::initWheelArray() {\n assert(SieveOfEratosthenes::NUMBERS_PER_BYTE == 30);\n assert(size_ > 0);\n const unsigned int unsetBit[30] = {\n BIT0, 0xff, 0xff, 0xff, BIT1, 0xff,\n BIT2, 0xff, 0xff, 0xff, BIT3, 0xff,\n BIT4, 0xff, 0xff, 0xff, BIT5, 0xff,\n 0xff, 0xff, 0xff, 0xff, BIT6, 0xff,\n BIT7, 0xff, 0xff, 0xff, 0xff, 0xff };\n\n wheelArray_ = new uint8_t[size_];\n \/\/ initialization, set bits of the first byte to 1\n wheelArray_[0] = 0xff;\n uint32_t primeProduct = 2 * 3 * 5;\n\n for (int i = 3; i < 9 && smallPrimes_[i] <= limit_; i++) {\n \/\/ cross off the multiples of primes < smallPrimes_[i]\n \/\/ up to the current prime product\n uint32_t pp30 = primeProduct \/ SieveOfEratosthenes::NUMBERS_PER_BYTE;\n for (uint32_t j = 1; j < smallPrimes_[i]; j++) {\n assert((j + 1) * pp30 <= size_);\n std::memcpy(&wheelArray_[j * pp30], wheelArray_, pp30);\n }\n primeProduct *= smallPrimes_[i];\n \/\/ '- 7' is a correction for primes of type i*30 + 31\n uint32_t multiple = smallPrimes_[i] - 7;\n \/\/ cross off the multiples of smallPrimes_[i] up to the current\n \/\/ prime product\n while (multiple < primeProduct) {\n uint32_t multipleIndex = multiple \/ SieveOfEratosthenes::NUMBERS_PER_BYTE;\n uint32_t bitPosition = multiple % SieveOfEratosthenes::NUMBERS_PER_BYTE;\n assert(multipleIndex < size_);\n wheelArray_[multipleIndex] &= unsetBit[bitPosition];\n multiple += smallPrimes_[i] * 2;\n }\n }\n}\n\n\/**\n * Pre-sieve multiples of small primes <= limit_ (e.g. 19).\n * Resets the sieve array (resets bits to 1) of SieveOfEratosthenes\n * objects after each sieved segment and removes the multiples of\n * small primes without sieving.\n * @see SieveOfEratosthenes::sieve(uint32_t)\n *\/\nvoid PreSieve::doIt(uint8_t* sieve, \n uint32_t sieveSize,\n uint64_t segmentLow) const\n{\n \/\/ calculate the position of segmentLow within the wheelArray_\n uint32_t sieveOffset = static_cast<uint32_t> (\n segmentLow % primeProduct_) \/ SieveOfEratosthenes::NUMBERS_PER_BYTE;\n uint32_t sizeLeft = size_ - sieveOffset;\n\n if (sizeLeft > sieveSize) {\n \/\/ copy a chunk of sieveSize bytes to the sieve array\n std::memcpy(sieve, &wheelArray_[sieveOffset], sieveSize);\n } else {\n \/\/ copy the last remaining bytes at the end of wheelArray_ to the\n \/\/ beginning of the sieve array\n std::memcpy(sieve, &wheelArray_[sieveOffset], sizeLeft);\n \/\/ restart copying at the beginning of wheelArray_\n sieveOffset = sizeLeft;\n while (sieveOffset + size_ < sieveSize) {\n std::memcpy(&sieve[sieveOffset], wheelArray_, size_);\n sieveOffset += size_;\n }\n std::memcpy(&sieve[sieveOffset], wheelArray_, sieveSize - sieveOffset);\n }\n}\n<commit_msg>minor changes<commit_after>\/\/\n\/\/ Copyright (c) 2011 Kim Walisch, <kim.walisch@gmail.com>.\n\/\/ All rights reserved.\n\/\/\n\/\/ This file is part of primesieve.\n\/\/ Visit: http:\/\/primesieve.googlecode.com\n\/\/\n\/\/ Redistribution and use in source and binary forms, with or without\n\/\/ modification, are permitted provided that the following conditions\n\/\/ are met:\n\/\/\n\/\/ * Redistributions of source code must retain the above copyright\n\/\/ notice, this list of conditions and the following disclaimer.\n\/\/ * Redistributions in binary form must reproduce the above\n\/\/ copyright notice, this list of conditions and the following\n\/\/ disclaimer in the documentation and\/or other materials provided\n\/\/ with the distribution.\n\/\/ * Neither the name of the author nor the names of its\n\/\/ contributors may be used to endorse or promote products derived\n\/\/ from this software without specific prior written permission.\n\/\/\n\/\/ THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS\n\/\/ \"AS IS\" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT\n\/\/ LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS\n\/\/ FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE\n\/\/ COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT,\n\/\/ INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES\n\/\/ (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR\n\/\/ SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)\n\/\/ HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT,\n\/\/ STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)\n\/\/ ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED\n\/\/ OF THE POSSIBILITY OF SUCH DAMAGE.\n\n#include \"PreSieve.h\"\n#include \"SieveOfEratosthenes.h\"\n\n#include <stdexcept>\n#include <cstdlib>\n#include <cstring>\n#include <cassert>\n\nconst uint32_t PreSieve::smallPrimes_[9] = { 2, 3, 5, 7, 11, 13, 17, 19, 23 };\n\n\/**\n * Pre-sieve multiples of small primes <= limit to speed up the sieve\n * of Eratosthenes.\n * @pre limit >= 11 && limit <= 23\n * @see SieveOfEratosthenes::sieve(uint32_t)\n *\/\nPreSieve::PreSieve(uint32_t limit) : wheelArray_(NULL), size_(0) {\n \/\/ limit <= 23 prevents 32 bit overflows\n if (limit < 11 || limit > 23)\n throw std::overflow_error(\"PreSieve: limit must be >= 11 && <= 23.\");\n limit_ = limit;\n primeProduct_ = this->getPrimeProduct(limit_);\n size_ = primeProduct_ \/ SieveOfEratosthenes::NUMBERS_PER_BYTE;\n this->initWheelArray();\n}\n\nPreSieve::~PreSieve() {\n delete[] wheelArray_;\n}\n\nuint32_t PreSieve::getPrimeProduct(uint32_t limit) const {\n assert(limit <= 23);\n uint32_t pp = 1;\n for (int i = 0; i < 9 && smallPrimes_[i] <= limit; i++)\n pp *= smallPrimes_[i];\n return pp;\n}\n\n\/**\n * Allocate the wheelArray_ and remove the multiples of small\n * primes <= limit_ from it.\n *\/\nvoid PreSieve::initWheelArray() {\n assert(SieveOfEratosthenes::NUMBERS_PER_BYTE == 30);\n assert(size_ > 0);\n const uint32_t unsetBit[30] = {\n BIT0, 0xff, 0xff, 0xff, BIT1, 0xff,\n BIT2, 0xff, 0xff, 0xff, BIT3, 0xff,\n BIT4, 0xff, 0xff, 0xff, BIT5, 0xff,\n 0xff, 0xff, 0xff, 0xff, BIT6, 0xff,\n BIT7, 0xff, 0xff, 0xff, 0xff, 0xff };\n\n wheelArray_ = new uint8_t[size_];\n \/\/ initialization, set bits of the first byte to 1\n wheelArray_[0] = 0xff;\n uint32_t primeProduct = 2 * 3 * 5;\n\n for (int i = 3; i < 9 && smallPrimes_[i] <= limit_; i++) {\n \/\/ cross off the multiples of primes < smallPrimes_[i]\n \/\/ up to the current prime product\n uint32_t pp30 = primeProduct \/ SieveOfEratosthenes::NUMBERS_PER_BYTE;\n for (uint32_t j = 1; j < smallPrimes_[i]; j++) {\n assert((j + 1) * pp30 <= size_);\n std::memcpy(&wheelArray_[j * pp30], wheelArray_, pp30);\n }\n primeProduct *= smallPrimes_[i];\n \/\/ '- 7' is a correction for primes of type i*30 + 31\n uint32_t multiple = smallPrimes_[i] - 7;\n \/\/ cross off the multiples of smallPrimes_[i] up to the current\n \/\/ prime product\n while (multiple < primeProduct) {\n uint32_t multipleIndex = multiple \/ SieveOfEratosthenes::NUMBERS_PER_BYTE;\n uint32_t bitPosition = multiple % SieveOfEratosthenes::NUMBERS_PER_BYTE;\n assert(multipleIndex < size_);\n wheelArray_[multipleIndex] &= unsetBit[bitPosition];\n multiple += smallPrimes_[i] * 2;\n }\n }\n}\n\n\/**\n * Pre-sieve multiples of small primes <= limit_ (e.g. 19).\n * Resets the sieve array (resets bits to 1) of SieveOfEratosthenes\n * objects after each sieved segment and removes the multiples of\n * small primes without sieving.\n * @see SieveOfEratosthenes::sieve(uint32_t)\n *\/\nvoid PreSieve::doIt(uint8_t* sieve, \n uint32_t sieveSize,\n uint64_t segmentLow) const\n{\n \/\/ calculate the position of segmentLow within the wheelArray_\n uint32_t sieveOffset = static_cast<uint32_t> (\n segmentLow % primeProduct_) \/ SieveOfEratosthenes::NUMBERS_PER_BYTE;\n uint32_t sizeLeft = size_ - sieveOffset;\n\n if (sizeLeft > sieveSize) {\n \/\/ copy a chunk of sieveSize bytes to the sieve array\n std::memcpy(sieve, &wheelArray_[sieveOffset], sieveSize);\n } else {\n \/\/ copy the last remaining bytes at the end of wheelArray_ to the\n \/\/ beginning of the sieve array\n std::memcpy(sieve, &wheelArray_[sieveOffset], sizeLeft);\n \/\/ restart copying at the beginning of wheelArray_\n sieveOffset = sizeLeft;\n while (sieveOffset + size_ < sieveSize) {\n std::memcpy(&sieve[sieveOffset], wheelArray_, size_);\n sieveOffset += size_;\n }\n std::memcpy(&sieve[sieveOffset], wheelArray_, sieveSize - sieveOffset);\n }\n}\n<|endoftext|>"} {"text":"<commit_before>\/\/ Copyright (c) 2016 Kasper Kronborg Isager and Radosław Niemczyk.\n#include <vector>\n#include <iostream>\n#include <fstream>\n#include <hayai\/hayai.hpp>\n#include <hayai\/hayai_posix_main.cpp>\n#include <hemingway\/vector.hpp>\n#include <hemingway\/table.hpp>\n\nusing namespace lsh;\n\nstd::vector<vector> parse(std::string path) {\n std::ifstream stream(path, std::ios::binary);\n std::vector<vector> vectors;\n\n std::vector<char> buffer(1 << 20);\n\n while (!stream.eof()) {\n stream.read(&buffer[0], 1 << 20);\n\n int read = stream.gcount();\n\n for (int i = 0; i < read; i += 8) {\n unsigned long n;\n\n for (int j = 0; j < 8; j++) {\n ((char*) &n)[j] = buffer[i + j];\n }\n\n std::vector<bool> c(64);\n\n for (int j = 0; j < 64; j++) {\n c[j] = (n >> (63 - j)) & 1;\n }\n\n vectors.push_back(vector(c));\n }\n }\n\n return vectors;\n}\n\nstd::vector<vector> vs = parse(\"bench\/data\/vectors.bin\");\nstd::vector<vector> qs = parse(\"bench\/data\/queries.bin\");\nstd::vector<vector> gt;\n\ndouble delta = 0.01;\n\nunsigned short r = 4;\nunsigned short l = (1 << (r + 1)) - 1;\nunsigned short k = ceil(log2(1 - pow(delta, 1.0 \/ l)) \/ log2(1 - r \/ 64.0));\n\ntable t_lin(table::brute({.dimensions = 64}));\n\ntable t_cla({.dimensions = 64, .samples = k, .partitions = l});\ntable t_cov({.dimensions = 64, .radius = r});\n\nunsigned int vn = vs.size();\nunsigned int qn = qs.size();\n\nunsigned int vi;\nunsigned int qi;\n\nunsigned int runs = 50;\n\nvoid print_stats(const table& t) {\n table::statistics s = t.stats();\n\n std::cout << \" \";\n std::cout << \"Number of buckets: \";\n std::cout << s.buckets \/ (1.0 * s.partitions);\n std::cout << \" \/partition\" << std::endl;\n\n std::cout << \" \";\n std::cout << \"Number of vectors: \";\n std::cout << s.vectors \/ (1.0 * s.buckets);\n std::cout << \" \/bucket\" << std::endl;\n}\n\nvoid print_results(const std::vector<vector>& fs) {\n unsigned int fn = 0;\n\n for (unsigned int i = 0; i < qn; i++) {\n vector q = qs[i];\n vector t = gt[i];\n\n if (vector::distance(q, t) <= r) {\n vector f = fs[i];\n\n if (f.size() == 0 || vector::distance(q, f) > r) {\n fn++;\n }\n }\n }\n\n std::cout << \" \";\n std::cout << \"False negatives: \";\n std::cout << fn \/ (1.0 * qn);\n std::cout << \" \/query\" << std::endl;\n}\n\nBENCHMARK(table, insert_linear, runs, vn \/ runs) {\n unsigned int i = vi++ % vn;\n\n t_lin.insert(vs[i]);\n}\n\nBENCHMARK(table, insert_classic, runs, vn \/ runs) {\n unsigned int i = vi++ % vn;\n\n t_cla.insert(vs[i]);\n\n if (i == vn - 1) {\n print_stats(t_cla);\n }\n}\n\nBENCHMARK(table, insert_covering, runs, vn \/ runs) {\n unsigned int i = vi++ % vn;\n\n t_cov.insert(vs[i]);\n\n if (i == vn - 1) {\n print_stats(t_cov);\n }\n}\n\nBENCHMARK(table, query_linear, runs, qn \/ runs) {\n unsigned int i = qi++ % qn;\n\n vector q = qs[i];\n vector r = t_lin.query(q);\n\n gt.push_back(r);\n}\n\nstd::vector<vector> vf_cla;\n\nBENCHMARK(table, query_classic, runs, qn \/ runs) {\n unsigned int i = qi++ % qn;\n\n vector q = qs[i];\n vector t = gt[i];\n\n vf_cla.push_back(t_cla.query(q));\n\n if (i == qn - 1) {\n print_results(vf_cla);\n }\n}\n\nstd::vector<vector> vf_cov;\n\nBENCHMARK(table, query_covering, runs, qn \/ runs) {\n unsigned int i = qi++ % qn;\n\n vector q = qs[i];\n vector t = gt[i];\n\n vf_cov.push_back(t_cov.query(q));\n\n if (i == qn - 1) {\n print_results(vf_cov);\n }\n}\n<commit_msg>That whitespace...<commit_after>\/\/ Copyright (c) 2016 Kasper Kronborg Isager and Radosław Niemczyk.\n#include <vector>\n#include <iostream>\n#include <fstream>\n#include <hayai\/hayai.hpp>\n#include <hayai\/hayai_posix_main.cpp>\n#include <hemingway\/vector.hpp>\n#include <hemingway\/table.hpp>\n\nusing namespace lsh;\n\nstd::vector<vector> parse(std::string path) {\n std::ifstream stream(path, std::ios::binary);\n std::vector<vector> vectors;\n\n std::vector<char> buffer(1 << 20);\n\n while (!stream.eof()) {\n stream.read(&buffer[0], 1 << 20);\n\n int read = stream.gcount();\n\n for (int i = 0; i < read; i += 8) {\n unsigned long n;\n\n for (int j = 0; j < 8; j++) {\n ((char*) &n)[j] = buffer[i + j];\n }\n\n std::vector<bool> c(64);\n\n for (int j = 0; j < 64; j++) {\n c[j] = (n >> (63 - j)) & 1;\n }\n\n vectors.push_back(vector(c));\n }\n }\n\n return vectors;\n}\n\nstd::vector<vector> vs = parse(\"bench\/data\/vectors.bin\");\nstd::vector<vector> qs = parse(\"bench\/data\/queries.bin\");\nstd::vector<vector> gt;\n\ndouble delta = 0.01;\n\nunsigned short r = 4;\nunsigned short l = (1 << (r + 1)) - 1;\nunsigned short k = ceil(log2(1 - pow(delta, 1.0 \/ l)) \/ log2(1 - r \/ 64.0));\n\ntable t_lin(table::brute({.dimensions = 64}));\n\ntable t_cla({.dimensions = 64, .samples = k, .partitions = l});\ntable t_cov({.dimensions = 64, .radius = r});\n\nunsigned int vn = vs.size();\nunsigned int qn = qs.size();\n\nunsigned int vi;\nunsigned int qi;\n\nunsigned int runs = 50;\n\nvoid print_stats(const table& t) {\n table::statistics s = t.stats();\n\n std::cout << \" \";\n std::cout << \"Number of buckets: \";\n std::cout << s.buckets \/ (1.0 * s.partitions);\n std::cout << \" \/partition\" << std::endl;\n\n std::cout << \" \";\n std::cout << \"Number of vectors: \";\n std::cout << s.vectors \/ (1.0 * s.buckets);\n std::cout << \" \/bucket\" << std::endl;\n}\n\nvoid print_results(const std::vector<vector>& fs) {\n unsigned int fn = 0;\n\n for (unsigned int i = 0; i < qn; i++) {\n vector q = qs[i];\n vector t = gt[i];\n\n if (vector::distance(q, t) <= r) {\n vector f = fs[i];\n\n if (f.size() == 0 || vector::distance(q, f) > r) {\n fn++;\n }\n }\n }\n\n std::cout << \" \";\n std::cout << \"False negatives: \";\n std::cout << fn \/ (1.0 * qn);\n std::cout << \" \/query\" << std::endl;\n}\n\nBENCHMARK(table, insert_linear, runs, vn \/ runs) {\n unsigned int i = vi++ % vn;\n\n t_lin.insert(vs[i]);\n}\n\nBENCHMARK(table, insert_classic, runs, vn \/ runs) {\n unsigned int i = vi++ % vn;\n\n t_cla.insert(vs[i]);\n\n if (i == vn - 1) {\n print_stats(t_cla);\n }\n}\n\nBENCHMARK(table, insert_covering, runs, vn \/ runs) {\n unsigned int i = vi++ % vn;\n\n t_cov.insert(vs[i]);\n\n if (i == vn - 1) {\n print_stats(t_cov);\n }\n}\n\nBENCHMARK(table, query_linear, runs, qn \/ runs) {\n unsigned int i = qi++ % qn;\n\n vector q = qs[i];\n vector r = t_lin.query(q);\n\n gt.push_back(r);\n}\n\nstd::vector<vector> vf_cla;\n\nBENCHMARK(table, query_classic, runs, qn \/ runs) {\n unsigned int i = qi++ % qn;\n\n vector q = qs[i];\n vector t = gt[i];\n\n vf_cla.push_back(t_cla.query(q));\n\n if (i == qn - 1) {\n print_results(vf_cla);\n }\n}\n\nstd::vector<vector> vf_cov;\n\nBENCHMARK(table, query_covering, runs, qn \/ runs) {\n unsigned int i = qi++ % qn;\n\n vector q = qs[i];\n vector t = gt[i];\n\n vf_cov.push_back(t_cov.query(q));\n\n if (i == qn - 1) {\n print_results(vf_cov);\n }\n}\n<|endoftext|>"} {"text":"<commit_before><commit_msg>CID#736510 mem leaks in early error return cases<commit_after><|endoftext|>"} {"text":"<commit_before>\/*\n * Java Genetic Algorithm Library (@__identifier__@).\n * Copyright (c) @__year__@ Franz Wilhelmstötter\n *\n * This library is free software; you can redistribute it and\/or\n * modify it under the terms of the GNU Lesser General Public\n * License as published by the Free Software Foundation; either\n * version 2.1 of the License, or (at your option) any later version.\n *\n * This library is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.\tSee the GNU\n * Lesser General Public License for more details.\n *\n * You should have received 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 * Author:\n * Franz Wilhelmstötter (franz.wilhelmstoetter@gmx.at)\n *\n *\/\n\n#include <cstdlib>\n#include <iostream>\n#include <iomanip>\n#include <sstream>\n#include <fstream>\n#include <vector>\n#include <trng\/lcg64_shift.hpp>\n\n\/**\n * @author <a href=\"mailto:franz.wilhelmstoetter@gmx.at\">Franz Wilhelmstötter<\/a>\n * @version <em>$Date: 2012-12-19 $<\/em>\n *\/\ntemplate<class Random>\nclass TRNGRandomOutput {\npublic:\n\n\tTRNGRandomOutput(\n\t\tunsigned long long seed,\n\t\tunsigned int splitp,\n\t\tunsigned int splits,\n\t\tunsigned long long jump,\n\t\tunsigned int jump2\n\t) {\n\t\t_random.seed(seed);\n\t\t_random.split(splitp, splits);\n\t\t_random.jump(jump);\n\t\t_random.jump2(jump2);\n\n\t\tstd::stringstream name;\n\t\tname << seed << \"-\";\n\t\tname << splitp << \"-\" << splits << \"-\";\n\t\tname << jump << \"-\";\n\t\tname << jump2;\n\t\t_fileName = name.str();\n\t}\n\n\t~TRNGRandomOutput() {\n\t}\n\n\tstd::string next() {\n\t\tstd::stringstream out;\n\t\tout << static_cast<long long>(_random());\n\t\treturn out.str();\n\t}\n\n\tstd::string fileName() {\n\t\treturn _fileName;\n\t}\n\nprivate:\n\tRandom _random;\n\tstd::string _fileName;\n};\n\ntemplate<class Random>\nvoid write(const std::string& dir, TRNGRandomOutput<Random>& random, std::size_t numbers) {\n\tstd::string file = dir + \"\/\" + random.fileName();\n\tstd::fstream out(file.c_str(), std::fstream::out);\n\n\tfor (std::size_t i = 0; i < numbers; ++i) {\n\t\tout << random.next() << std::endl;\n\t}\n\n\tout.close();\n}\n\n\n\nint main(void) {\n\n\tint count = 0;\n\n\tfor (unsigned long long seed = 0; seed < 2; ++seed) {\n\t\tfor (unsigned int splitp = 5; splitp < 10; splitp += 3) {\n\t\t\tfor (unsigned int splits = 0; splits < splitp; splits += 2) {\n\t\t\t\tfor (unsigned long long jump = 0; jump < 2; ++jump) {\n\t\t\t\t\tfor (unsigned int jump2 = 0; jump2 < 64; jump2 += 23) {\n\n\t\t\t\t\t\tstd::cout <<\n\t\t\t\t\t\t\t\"{new Long(\" << static_cast<long long>(seed*74236788222246L) << \"L), \" <<\n\t\t\t\t\t\t\t\"new Integer(\" << static_cast<long long>(splitp) << \"), \" <<\n\t\t\t\t\t\t\t\"new Integer(\" << static_cast<long long>(splits) << \"), \" <<\n\t\t\t\t\t\t\t\"new Long(\" << static_cast<long long>(jump*948392782247324L) << \"L), \" <<\n\t\t\t\t\t\t\t\"new Integer(\" << static_cast<long long>(jump2) << \")},\" << std::endl;\n\n\n\t\t\t\t\t\tTRNGRandomOutput<trng::lcg64_shift> random(\n\t\t\t\t\t\t\tseed*74236788222246L,\n\t\t\t\t\t\t\tsplitp, splits,\n\t\t\t\t\t\t\tjump*948392782247324L, jump2\n\t\t\t\t\t\t);\n\t\t\t\t\t\twrite<trng::lcg64_shift>(\"output\", random, 150);\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\n\treturn 0;\n}\n<commit_msg>Some code cleanup.<commit_after>\/*\n * Java Genetic Algorithm Library (@__identifier__@).\n * Copyright (c) @__year__@ Franz Wilhelmstötter\n *\n * This library is free software; you can redistribute it and\/or\n * modify it under the terms of the GNU Lesser General Public\n * License as published by the Free Software Foundation; either\n * version 2.1 of the License, or (at your option) any later version.\n *\n * This library is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.\tSee the GNU\n * Lesser General Public License for more details.\n *\n * You should have received 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 * Author:\n * Franz Wilhelmstötter (franz.wilhelmstoetter@gmx.at)\n *\n *\/\n\n#include <cstdlib>\n#include <iostream>\n#include <iomanip>\n#include <sstream>\n#include <fstream>\n#include <vector>\n#include <trng\/lcg64_shift.hpp>\n\n\/**\n * @author <a href=\"mailto:franz.wilhelmstoetter@gmx.at\">Franz Wilhelmstötter<\/a>\n * @version <em>$Date: 2013-12-08 $<\/em>\n *\/\ntemplate<class Random>\nclass TRNGRandomOutput {\npublic:\n\n\tTRNGRandomOutput(\n\t\tunsigned long long seed,\n\t\tunsigned int splitp,\n\t\tunsigned int splits,\n\t\tunsigned long long jump,\n\t\tunsigned int jump2\n\t) {\n\t\t_random.seed(seed);\n\t\t_random.split(splitp, splits);\n\t\t_random.jump(jump);\n\t\t_random.jump2(jump2);\n\n\t\tstd::stringstream name;\n\t\tname << seed << \"-\";\n\t\tname << splitp << \"-\" << splits << \"-\";\n\t\tname << jump << \"-\";\n\t\tname << jump2;\n\t\t_fileName = name.str();\n\t}\n\n\t~TRNGRandomOutput() {\n\t}\n\n\tstd::string next() {\n\t\tstd::stringstream out;\n\t\tout << static_cast<long long>(_random());\n\t\treturn out.str();\n\t}\n\n\tstd::string fileName() {\n\t\treturn _fileName;\n\t}\n\nprivate:\n\tRandom _random;\n\tstd::string _fileName;\n};\n\ntemplate<class Random>\nvoid write(const std::string& dir, TRNGRandomOutput<Random>& random, std::size_t numbers) {\n\tstd::string file = dir + \"\/\" + random.fileName();\n\tstd::fstream out(file.c_str(), std::fstream::out);\n\n\tfor (std::size_t i = 0; i < numbers; ++i) {\n\t\tout << random.next() << std::endl;\n\t}\n\n\tout.close();\n}\n\n\n\nint main(void) {\n\n\tint count = 0;\n\n\tfor (unsigned long long seed = 0; seed < 2; ++seed) {\n\t\tfor (unsigned int splitp = 5; splitp < 10; splitp += 3) {\n\t\t\tfor (unsigned int splits = 0; splits < splitp; splits += 2) {\n\t\t\t\tfor (unsigned long long jump = 0; jump < 2; ++jump) {\n\t\t\t\t\tfor (unsigned int jump2 = 0; jump2 < 64; jump2 += 23) {\n\n\t\t\t\t\t\tstd::cout <<\n\t\t\t\t\t\t\t\"{new Long(\" << static_cast<long long>(seed*74236788222246L) << \"L), \" <<\n\t\t\t\t\t\t\t\"new Integer(\" << static_cast<long long>(splitp) << \"), \" <<\n\t\t\t\t\t\t\t\"new Integer(\" << static_cast<long long>(splits) << \"), \" <<\n\t\t\t\t\t\t\t\"new Long(\" << static_cast<long long>(jump*948392782247324L) << \"L), \" <<\n\t\t\t\t\t\t\t\"new Integer(\" << static_cast<long long>(jump2) << \")},\" << std::endl;\n\n\n\t\t\t\t\t\tTRNGRandomOutput<trng::lcg64_shift> random(\n\t\t\t\t\t\t\tseed*74236788222246L,\n\t\t\t\t\t\t\tsplitp, splits,\n\t\t\t\t\t\t\tjump*948392782247324L, jump2\n\t\t\t\t\t\t);\n\t\t\t\t\t\twrite<trng::lcg64_shift>(\"output\", random, 150);\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\n\treturn 0;\n}\n<|endoftext|>"} {"text":"<commit_before>MATFile *pmat;\n\tint i;\n\tint\t ndir;\n\tconst char **dir;\n\tconst char *file = \"pqfile.mat\";\n\tmxArray *pa;\n\tconst char *name;\n\tdouble *in1pr;\n\tcout << \"Hello World!\" << endl;\n\tpmat = matOpen(\"test.mat\", \"r\");\n\tif (pmat == NULL) {\n\t\tprintf(\"Error opening file\\n\");\n\n\t}\n\tdir = (const char **)matGetDir(pmat, &ndir);\n\tif (dir == NULL) {\n\t\tprintf(\"Error reading directory of file %s\\n\", file);\n\t\treturn(1);\n\t}\n\telse {\n\t\tprintf(\"Directory of %s:\\n\", file);\n\t\tfor (i = 0; i < ndir; i++)\n\t\t\tprintf(\"%s\\n\", dir[i]);\n\t}\n\n\tmxFree(dir);\n\tif (matClose(pmat) != 0) {\n\t\tprintf(\"Error closing file %s\\n\", file);\n\t\treturn(1);\n\t}\n\tpmat = matOpen(file, \"r\");\n\tif (pmat == NULL) {\n\t\tprintf(\"Error reopening file %s\\n\", file);\n\t\treturn(1);\n\t}\n\tprintf(\"\\nExamining the header for each variable:\\n\");\n\tfor (i = 0; i < ndir; i++) {\n\t\tpa = matGetNextVariableInfo(pmat, &name);\n\t\tif (pa == NULL) {\n\t\t\tprintf(\"Error reading in file %s\\n\", file);\n\t\t\treturn(1);\n\t\t}\n\t\t\/* Diagnose header pa *\/\n\t\tprintf(\"According to its header, array %s has %d dimensions\\n\",\n\t\t\tname, mxGetNumberOfDimensions(pa));\n\t\tcout << \"Value of the dimensions are: \";\n\t\tcout << *(mxGetDimensions(pa)+3) << endl;\n\t\tif (mxIsFromGlobalWS(pa))\n\t\t\tprintf(\" and was a global variable when saved\\n\");\n\t\telse\n\t\t\tprintf(\" and was a local variable when saved\\n\");\n\t\tmxDestroyArray(pa);\n\t}\n\tif (matClose(pmat) != 0) {\n\t\tprintf(\"Error closing file %s\\n\", file);\n\t\treturn(1);\n\t}\n\tpmat = matOpen(file, \"r\");\n\tif (pmat == NULL) {\n\t\tprintf(\"Error reopening file %s\\n\", file);\n\t\treturn(1);\n\t}\n\n\tprintf(\"\\nReading in the actual array contents:\\n\");\n\tfor (i = 0; i<ndir; i++) {\n\t\tpa = matGetNextVariable(pmat, &name);\n\t\tin1pr = mxGetPr(pa);\n\t\tcout << \"Value of end variable: \";\n\t\tcout << *(in1pr+2) << endl;\n\t\tif (pa == NULL) {\n\t\t\tprintf(\"Error reading in file %s\\n\", file);\n\t\t\treturn(1);\n\t\t}\n\t\t\/*\n\t\t* Diagnose array pa\n\t\t*\/\n\t\tprintf(\"According to its contents, array %s has %d dimensions\\n\",\n\t\t\tname, mxGetNumberOfDimensions(pa));\n\t\tif (mxIsFromGlobalWS(pa))\n\t\t\tprintf(\" and was a global variable when saved\\n\");\n\t\telse\n\t\t\tprintf(\" and was a local variable when saved\\n\");\n\t\t\/\/mxDestroyArray(pa);\n\t}\n\n\tif (matClose(pmat) != 0) {\n\t\tprintf(\"Error closing file %s\\n\", file);\n\t\treturn(1);\n\t}\n\tcout << \"Value of var variable: \";\n\tcout << &pa << endl;\n\t\/\/mexPrintf(\"in1=%f\\n\", *in1pr);\n\tcin >> i;\n\treturn 0;<commit_msg>backup deleted<commit_after><|endoftext|>"} {"text":"<commit_before>\/*************************************************************************\n *\n * OpenOffice.org - a multi-platform office productivity suite\n *\n * $RCSfile: edglss.cxx,v $\n *\n * $Revision: 1.12 $\n *\n * last change: $Author: obo $ $Date: 2006-09-16 21:06: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_sw.hxx\"\n\n\n#ifndef _OSL_ENDIAN_H_\n#include <osl\/endian.h>\n#endif\n\n#ifndef _HINTIDS_HXX\n#include <hintids.hxx>\n#endif\n\n#ifndef SVTOOLS_URIHELPER_HXX\n#include <svtools\/urihelper.hxx>\n#endif\n#ifndef _CACHESTR_HXX \/\/autogen\n#include <tools\/cachestr.hxx>\n#endif\n\n#ifndef _DOC_HXX\n#include <doc.hxx>\n#endif\n#ifndef _PAM_HXX\n#include <pam.hxx>\n#endif\n#ifndef _DOCARY_HXX\n#include <docary.hxx>\n#endif\n#ifndef _EDITSH_HXX\n#include <editsh.hxx>\n#endif\n#ifndef _EDIMP_HXX\n#include <edimp.hxx>\n#endif\n#ifndef _FRMFMT_HXX \/\/autogen\n#include <frmfmt.hxx>\n#endif\n#ifndef _SWUNDO_HXX\n#include <swundo.hxx> \/\/ fuer die UndoIds\n#endif\n#ifndef _NDTXT_HXX\n#include <ndtxt.hxx>\n#endif\n#ifndef _SWTABLE_HXX\n#include <swtable.hxx> \/\/ fuers kopieren von Tabellen\n#endif\n#ifndef _SHELLIO_HXX\n#include <shellio.hxx> \/\/ SwTextBlocks\n#endif\n#ifndef _ACORRECT_HXX\n#include <acorrect.hxx>\n#endif\n#ifndef _SWSWERROR_H\n#include <swerror.h> \/\/ SwTextBlocks\n#endif\n\n\/******************************************************************************\n * jetzt mit einem verkappten Reader\/Writer\/Dokument\n ******************************************************************************\/\n\nvoid SwEditShell::InsertGlossary( SwTextBlocks& rGlossary, const String& rStr )\n{\n StartAllAction();\n GetDoc()->InsertGlossary( rGlossary, rStr, *GetCrsr(), this );\n EndAllAction();\n}\n\n\n\/******************************************************************************\n * aktuelle Selektion zum Textbaustein machen und ins\n * Textbausteindokument einfuegen, einschliesslich Vorlagen\n ******************************************************************************\/\n\n\nUSHORT SwEditShell::MakeGlossary( SwTextBlocks& rBlks, const String& rName, const String& rShortName,\n BOOL bSaveRelFile, BOOL bSaveRelNet,\n const String* pOnlyTxt )\n{\n SwDoc* pGDoc = rBlks.GetDoc();\n\n String sBase;\n if(bSaveRelFile)\n {\n INetURLObject aURL( rBlks.GetFileName() );\n sBase = aURL.GetMainURL( INetURLObject::NO_DECODE );\n }\n rBlks.SetBaseURL( sBase );\n\n USHORT nRet;\n\n if( pOnlyTxt )\n nRet = rBlks.PutText( rShortName, rName, *pOnlyTxt );\n else\n {\n rBlks.ClearDoc();\n if( rBlks.BeginPutDoc( rShortName, rName ) )\n {\n rBlks.GetDoc()->SetRedlineMode_intern( IDocumentRedlineAccess::REDLINE_DELETE_REDLINES );\n _CopySelToDoc( pGDoc );\n rBlks.GetDoc()->SetRedlineMode_intern( 0 );\n nRet = rBlks.PutDoc();\n }\n else\n nRet = (USHORT) -1;\n }\n\n return nRet;\n}\n\nUSHORT SwEditShell::SaveGlossaryDoc( SwTextBlocks& rBlock,\n const String& rName,\n const String& rShortName,\n BOOL bSaveRelFile, BOOL bSaveRelNet,\n BOOL bOnlyTxt )\n{\n StartAllAction();\n\n SwDoc* pGDoc = rBlock.GetDoc();\n SwDoc* pDoc = GetDoc();\n\n String sBase;\n if(bSaveRelFile)\n {\n INetURLObject aURL( rBlock.GetFileName() );\n sBase = aURL.GetMainURL( INetURLObject::NO_DECODE );\n }\n rBlock.SetBaseURL( sBase );\n USHORT nRet = USHRT_MAX;\n\n if( bOnlyTxt )\n {\n KillPams();\n\n SwPaM* pCrsr = GetCrsr();\n\n SwNodeIndex aStt( pDoc->GetNodes().GetEndOfExtras(), 1 );\n SwCntntNode* pCntntNd = pDoc->GetNodes().GoNext( &aStt );\n const SwNode* pNd = pCntntNd->FindTableNode();\n if( !pNd )\n pNd = pCntntNd;\n\n pCrsr->GetPoint()->nNode = *pNd;\n if( pNd == pCntntNd )\n pCrsr->GetPoint()->nContent.Assign( pCntntNd, 0 );\n pCrsr->SetMark();\n\n \/\/ dann bis zum Ende vom Nodes Array\n pCrsr->GetPoint()->nNode = pDoc->GetNodes().GetEndOfContent().GetIndex()-1;\n pCntntNd = pCrsr->GetCntntNode();\n if( pCntntNd )\n pCrsr->GetPoint()->nContent.Assign( pCntntNd, pCntntNd->Len() );\n\n String sBuf;\n if( GetSelectedText( sBuf, GETSELTXT_PARABRK_TO_ONLYCR ) && sBuf.Len() )\n nRet = rBlock.PutText( rShortName, rName, sBuf );\n }\n else\n {\n rBlock.ClearDoc();\n if( rBlock.BeginPutDoc( rShortName, rName ) )\n {\n SwNodeIndex aStt( pDoc->GetNodes().GetEndOfExtras(), 1 );\n SwCntntNode* pCntntNd = pDoc->GetNodes().GoNext( &aStt );\n const SwNode* pNd = pCntntNd->FindTableNode();\n if( !pNd ) pNd = pCntntNd;\n SwPaM aCpyPam( *pNd );\n aCpyPam.SetMark();\n\n \/\/ dann bis zum Ende vom Nodes Array\n aCpyPam.GetPoint()->nNode = pDoc->GetNodes().GetEndOfContent().GetIndex()-1;\n pCntntNd = aCpyPam.GetCntntNode();\n aCpyPam.GetPoint()->nContent.Assign( pCntntNd, pCntntNd->Len() );\n\n aStt = pGDoc->GetNodes().GetEndOfExtras();\n pCntntNd = pGDoc->GetNodes().GoNext( &aStt );\n SwPosition aInsPos( aStt, SwIndex( pCntntNd ));\n pDoc->Copy( aCpyPam, aInsPos );\n\n nRet = rBlock.PutDoc();\n }\n }\n EndAllAction();\n return nRet;\n}\n\n\/******************************************************************************\n * kopiere alle Selectionen und das Doc\n ******************************************************************************\/\n\n\nBOOL SwEditShell::_CopySelToDoc( SwDoc* pInsDoc, SwNodeIndex* pSttNd )\n{\n ASSERT( pInsDoc, \"kein Ins.Dokument\" );\n\n SwNodes& rNds = pInsDoc->GetNodes();\n\n SwNodeIndex aIdx( rNds.GetEndOfContent(), -1 );\n SwCntntNode * pNd = aIdx.GetNode().GetCntntNode();\n SwPosition aPos( aIdx, SwIndex( pNd, pNd->Len() ));\n\n \/\/ soll der Index auf Anfang returnt werden ?\n if( pSttNd )\n {\n *pSttNd = aPos.nNode;\n (*pSttNd)--;\n }\n\n BOOL bRet = FALSE;\n SET_CURR_SHELL( this );\n\n pInsDoc->LockExpFlds();\n\n if( IsTableMode() )\n {\n \/\/ kopiere Teile aus einer Tabelle: lege eine Tabelle mit der Breite\n \/\/ von der Originalen an und kopiere die selectierten Boxen.\n \/\/ Die Groessen werden prozentual korrigiert.\n\n \/\/ lasse ueber das Layout die Boxen suchen\n SwTableNode* pTblNd;\n SwSelBoxes aBoxes;\n GetTblSel( *this, aBoxes );\n if( aBoxes.Count() && 0 != (pTblNd = (SwTableNode*)aBoxes[0]\n ->GetSttNd()->FindTableNode() ))\n {\n \/\/ teste ob der TabellenName kopiert werden kann\n BOOL bCpyTblNm = aBoxes.Count() == pTblNd->GetTable().GetTabSortBoxes().Count();\n if( bCpyTblNm )\n {\n const String& rTblName = pTblNd->GetTable().GetFrmFmt()->GetName();\n const SwFrmFmts& rTblFmts = *pInsDoc->GetTblFrmFmts();\n for( USHORT n = rTblFmts.Count(); n; )\n if( rTblFmts[ --n ]->GetName() == rTblName )\n {\n bCpyTblNm = FALSE;\n break;\n }\n }\n bRet = pInsDoc->InsCopyOfTbl( aPos, aBoxes, 0, bCpyTblNm, FALSE );\n }\n else\n bRet = FALSE;\n }\n else\n {\n FOREACHPAM_START(this)\n\n if( !PCURCRSR->HasMark() )\n {\n if( 0 != (pNd = PCURCRSR->GetCntntNode()) && !pNd->GetTxtNode() )\n {\n PCURCRSR->SetMark();\n PCURCRSR->Move( fnMoveForward, fnGoCntnt );\n bRet |= GetDoc()->Copy( *PCURCRSR, aPos );\n PCURCRSR->Exchange();\n PCURCRSR->DeleteMark();\n }\n }\n else\n bRet |= GetDoc()->Copy( *PCURCRSR, aPos );\n\n FOREACHPAM_END()\n }\n\n pInsDoc->UnlockExpFlds();\n if( !pInsDoc->IsExpFldsLocked() )\n pInsDoc->UpdateExpFlds(NULL, true);\n\n \/\/ die gemerkte Node-Position wieder auf den richtigen Node\n if( bRet && pSttNd )\n (*pSttNd)++;\n\n\n return bRet;\n}\n\n\/*------------------------------------------------------------------------\n Beschreibung: Text innerhalb der Selektion erfragen\n Returnwert: liefert FALSE, wenn der selektierte Bereich\n zu gross ist, um in den Stringpuffer kopiert zu werden.\n------------------------------------------------------------------------*\/\n\nBOOL SwEditShell::GetSelectedText( String &rBuf, int nHndlParaBrk )\n{\n BOOL bRet = FALSE;\n GetCrsr(); \/\/ ggfs. alle Cursor erzeugen lassen\n if( IsSelOnePara() )\n {\n rBuf = GetSelTxt();\n if( GETSELTXT_PARABRK_TO_BLANK == nHndlParaBrk )\n {\n xub_StrLen nPos = 0;\n while( STRING_NOTFOUND !=\n ( nPos = rBuf.SearchAndReplace( 0x0a, ' ', nPos )) )\n ;\n }\n else if( IsSelFullPara() &&\n GETSELTXT_PARABRK_TO_ONLYCR != nHndlParaBrk )\n {\n#if defined(MAC)\n rBuf += '\\015';\n#elif defined(UNX)\n rBuf += '\\012';\n#else\n rBuf += String::CreateFromAscii(\n RTL_CONSTASCII_STRINGPARAM( \"\\015\\012\" ));\n#endif\n }\n bRet = TRUE;\n }\n else if( IsSelection() )\n {\n SvCacheStream aStream(20480);\n#ifdef OSL_BIGENDIAN\n aStream.SetNumberFormatInt( NUMBERFORMAT_INT_BIGENDIAN );\n#else\n aStream.SetNumberFormatInt( NUMBERFORMAT_INT_LITTLEENDIAN );\n#endif\n WriterRef xWrt;\n SwIoSystem::GetWriter( String::CreateFromAscii( FILTER_TEXT ), String(), xWrt );\n if( xWrt.Is() )\n {\n \/\/ Selektierte Bereiche in ein ASCII Dokument schreiben\n SwWriter aWriter( aStream, *this);\n xWrt->SetShowProgress( FALSE );\n\n switch( nHndlParaBrk )\n {\n case GETSELTXT_PARABRK_TO_BLANK:\n xWrt->bASCII_ParaAsBlanc = TRUE;\n xWrt->bASCII_NoLastLineEnd = TRUE;\n break;\n\n case GETSELTXT_PARABRK_TO_ONLYCR:\n xWrt->bASCII_ParaAsCR = TRUE;\n xWrt->bASCII_NoLastLineEnd = TRUE;\n break;\n }\n\n \/\/JP 09.05.00: write as UNICODE ! (and not as ANSI)\n SwAsciiOptions aAsciiOpt( xWrt->GetAsciiOptions() );\n aAsciiOpt.SetCharSet( RTL_TEXTENCODING_UCS2 );\n xWrt->SetAsciiOptions( aAsciiOpt );\n xWrt->bUCS2_WithStartChar = FALSE;\n\n long lLen;\n if( !IsError( aWriter.Write( xWrt ) ) &&\n STRING_MAXLEN > (( lLen = aStream.GetSize() )\n \/ sizeof( sal_Unicode )) + 1 )\n {\n aStream << (sal_Unicode)'\\0';\n\n const sal_Unicode *p = (sal_Unicode*)aStream.GetBuffer();\n if( p )\n rBuf = p;\n else\n {\n sal_Unicode* pStrBuf = rBuf.AllocBuffer( xub_StrLen(\n ( lLen \/ sizeof( sal_Unicode ))) );\n aStream.Seek( 0 );\n aStream.ResetError();\n aStream.Read( pStrBuf, lLen );\n pStrBuf[ lLen \/ sizeof( sal_Unicode ) ] = '\\0';\n }\n }\n }\n }\n\n return TRUE;\n}\n\n\n\n\n\n<commit_msg>INTEGRATION: CWS osxpatchpool (1.11.14); FILE MERGED 2006\/08\/28 12:33:41 obr 1.11.14.1: #i68810# applied 2nd patch from issue (tra)<commit_after>\/*************************************************************************\n *\n * OpenOffice.org - a multi-platform office productivity suite\n *\n * $RCSfile: edglss.cxx,v $\n *\n * $Revision: 1.13 $\n *\n * last change: $Author: vg $ $Date: 2006-09-25 09:27:30 $\n *\n * The Contents of this file are made available subject to\n * the terms of GNU Lesser General Public License Version 2.1.\n *\n *\n * GNU Lesser General Public License Version 2.1\n * =============================================\n * Copyright 2005 by Sun Microsystems, Inc.\n * 901 San Antonio Road, Palo Alto, CA 94303, USA\n *\n * This library is free software; you can redistribute it and\/or\n * modify it under the terms of the GNU Lesser General Public\n * License version 2.1, as published by the Free Software Foundation.\n *\n * This library is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU\n * Lesser General Public License for more details.\n *\n * You should have received a copy of the GNU Lesser General Public\n * License along with this library; if not, write to the Free Software\n * Foundation, Inc., 59 Temple Place, Suite 330, Boston,\n * MA 02111-1307 USA\n *\n ************************************************************************\/\n\n\/\/ MARKER(update_precomp.py): autogen include statement, do not remove\n#include \"precompiled_sw.hxx\"\n\n\n#ifndef _OSL_ENDIAN_H_\n#include <osl\/endian.h>\n#endif\n\n#ifndef _HINTIDS_HXX\n#include <hintids.hxx>\n#endif\n\n#ifndef SVTOOLS_URIHELPER_HXX\n#include <svtools\/urihelper.hxx>\n#endif\n#ifndef _CACHESTR_HXX \/\/autogen\n#include <tools\/cachestr.hxx>\n#endif\n\n#ifndef _DOC_HXX\n#include <doc.hxx>\n#endif\n#ifndef _PAM_HXX\n#include <pam.hxx>\n#endif\n#ifndef _DOCARY_HXX\n#include <docary.hxx>\n#endif\n#ifndef _EDITSH_HXX\n#include <editsh.hxx>\n#endif\n#ifndef _EDIMP_HXX\n#include <edimp.hxx>\n#endif\n#ifndef _FRMFMT_HXX \/\/autogen\n#include <frmfmt.hxx>\n#endif\n#ifndef _SWUNDO_HXX\n#include <swundo.hxx> \/\/ fuer die UndoIds\n#endif\n#ifndef _NDTXT_HXX\n#include <ndtxt.hxx>\n#endif\n#ifndef _SWTABLE_HXX\n#include <swtable.hxx> \/\/ fuers kopieren von Tabellen\n#endif\n#ifndef _SHELLIO_HXX\n#include <shellio.hxx> \/\/ SwTextBlocks\n#endif\n#ifndef _ACORRECT_HXX\n#include <acorrect.hxx>\n#endif\n#ifndef _SWSWERROR_H\n#include <swerror.h> \/\/ SwTextBlocks\n#endif\n\n\/******************************************************************************\n * jetzt mit einem verkappten Reader\/Writer\/Dokument\n ******************************************************************************\/\n\nvoid SwEditShell::InsertGlossary( SwTextBlocks& rGlossary, const String& rStr )\n{\n StartAllAction();\n GetDoc()->InsertGlossary( rGlossary, rStr, *GetCrsr(), this );\n EndAllAction();\n}\n\n\n\/******************************************************************************\n * aktuelle Selektion zum Textbaustein machen und ins\n * Textbausteindokument einfuegen, einschliesslich Vorlagen\n ******************************************************************************\/\n\n\nUSHORT SwEditShell::MakeGlossary( SwTextBlocks& rBlks, const String& rName, const String& rShortName,\n BOOL bSaveRelFile, BOOL bSaveRelNet,\n const String* pOnlyTxt )\n{\n SwDoc* pGDoc = rBlks.GetDoc();\n\n String sBase;\n if(bSaveRelFile)\n {\n INetURLObject aURL( rBlks.GetFileName() );\n sBase = aURL.GetMainURL( INetURLObject::NO_DECODE );\n }\n rBlks.SetBaseURL( sBase );\n\n USHORT nRet;\n\n if( pOnlyTxt )\n nRet = rBlks.PutText( rShortName, rName, *pOnlyTxt );\n else\n {\n rBlks.ClearDoc();\n if( rBlks.BeginPutDoc( rShortName, rName ) )\n {\n rBlks.GetDoc()->SetRedlineMode_intern( IDocumentRedlineAccess::REDLINE_DELETE_REDLINES );\n _CopySelToDoc( pGDoc );\n rBlks.GetDoc()->SetRedlineMode_intern( (IDocumentRedlineAccess::RedlineMode_t)0 );\n nRet = rBlks.PutDoc();\n }\n else\n nRet = (USHORT) -1;\n }\n\n return nRet;\n}\n\nUSHORT SwEditShell::SaveGlossaryDoc( SwTextBlocks& rBlock,\n const String& rName,\n const String& rShortName,\n BOOL bSaveRelFile, BOOL bSaveRelNet,\n BOOL bOnlyTxt )\n{\n StartAllAction();\n\n SwDoc* pGDoc = rBlock.GetDoc();\n SwDoc* pDoc = GetDoc();\n\n String sBase;\n if(bSaveRelFile)\n {\n INetURLObject aURL( rBlock.GetFileName() );\n sBase = aURL.GetMainURL( INetURLObject::NO_DECODE );\n }\n rBlock.SetBaseURL( sBase );\n USHORT nRet = USHRT_MAX;\n\n if( bOnlyTxt )\n {\n KillPams();\n\n SwPaM* pCrsr = GetCrsr();\n\n SwNodeIndex aStt( pDoc->GetNodes().GetEndOfExtras(), 1 );\n SwCntntNode* pCntntNd = pDoc->GetNodes().GoNext( &aStt );\n const SwNode* pNd = pCntntNd->FindTableNode();\n if( !pNd )\n pNd = pCntntNd;\n\n pCrsr->GetPoint()->nNode = *pNd;\n if( pNd == pCntntNd )\n pCrsr->GetPoint()->nContent.Assign( pCntntNd, 0 );\n pCrsr->SetMark();\n\n \/\/ dann bis zum Ende vom Nodes Array\n pCrsr->GetPoint()->nNode = pDoc->GetNodes().GetEndOfContent().GetIndex()-1;\n pCntntNd = pCrsr->GetCntntNode();\n if( pCntntNd )\n pCrsr->GetPoint()->nContent.Assign( pCntntNd, pCntntNd->Len() );\n\n String sBuf;\n if( GetSelectedText( sBuf, GETSELTXT_PARABRK_TO_ONLYCR ) && sBuf.Len() )\n nRet = rBlock.PutText( rShortName, rName, sBuf );\n }\n else\n {\n rBlock.ClearDoc();\n if( rBlock.BeginPutDoc( rShortName, rName ) )\n {\n SwNodeIndex aStt( pDoc->GetNodes().GetEndOfExtras(), 1 );\n SwCntntNode* pCntntNd = pDoc->GetNodes().GoNext( &aStt );\n const SwNode* pNd = pCntntNd->FindTableNode();\n if( !pNd ) pNd = pCntntNd;\n SwPaM aCpyPam( *pNd );\n aCpyPam.SetMark();\n\n \/\/ dann bis zum Ende vom Nodes Array\n aCpyPam.GetPoint()->nNode = pDoc->GetNodes().GetEndOfContent().GetIndex()-1;\n pCntntNd = aCpyPam.GetCntntNode();\n aCpyPam.GetPoint()->nContent.Assign( pCntntNd, pCntntNd->Len() );\n\n aStt = pGDoc->GetNodes().GetEndOfExtras();\n pCntntNd = pGDoc->GetNodes().GoNext( &aStt );\n SwPosition aInsPos( aStt, SwIndex( pCntntNd ));\n pDoc->Copy( aCpyPam, aInsPos );\n\n nRet = rBlock.PutDoc();\n }\n }\n EndAllAction();\n return nRet;\n}\n\n\/******************************************************************************\n * kopiere alle Selectionen und das Doc\n ******************************************************************************\/\n\n\nBOOL SwEditShell::_CopySelToDoc( SwDoc* pInsDoc, SwNodeIndex* pSttNd )\n{\n ASSERT( pInsDoc, \"kein Ins.Dokument\" );\n\n SwNodes& rNds = pInsDoc->GetNodes();\n\n SwNodeIndex aIdx( rNds.GetEndOfContent(), -1 );\n SwCntntNode * pNd = aIdx.GetNode().GetCntntNode();\n SwPosition aPos( aIdx, SwIndex( pNd, pNd->Len() ));\n\n \/\/ soll der Index auf Anfang returnt werden ?\n if( pSttNd )\n {\n *pSttNd = aPos.nNode;\n (*pSttNd)--;\n }\n\n BOOL bRet = FALSE;\n SET_CURR_SHELL( this );\n\n pInsDoc->LockExpFlds();\n\n if( IsTableMode() )\n {\n \/\/ kopiere Teile aus einer Tabelle: lege eine Tabelle mit der Breite\n \/\/ von der Originalen an und kopiere die selectierten Boxen.\n \/\/ Die Groessen werden prozentual korrigiert.\n\n \/\/ lasse ueber das Layout die Boxen suchen\n SwTableNode* pTblNd;\n SwSelBoxes aBoxes;\n GetTblSel( *this, aBoxes );\n if( aBoxes.Count() && 0 != (pTblNd = (SwTableNode*)aBoxes[0]\n ->GetSttNd()->FindTableNode() ))\n {\n \/\/ teste ob der TabellenName kopiert werden kann\n BOOL bCpyTblNm = aBoxes.Count() == pTblNd->GetTable().GetTabSortBoxes().Count();\n if( bCpyTblNm )\n {\n const String& rTblName = pTblNd->GetTable().GetFrmFmt()->GetName();\n const SwFrmFmts& rTblFmts = *pInsDoc->GetTblFrmFmts();\n for( USHORT n = rTblFmts.Count(); n; )\n if( rTblFmts[ --n ]->GetName() == rTblName )\n {\n bCpyTblNm = FALSE;\n break;\n }\n }\n bRet = pInsDoc->InsCopyOfTbl( aPos, aBoxes, 0, bCpyTblNm, FALSE );\n }\n else\n bRet = FALSE;\n }\n else\n {\n FOREACHPAM_START(this)\n\n if( !PCURCRSR->HasMark() )\n {\n if( 0 != (pNd = PCURCRSR->GetCntntNode()) && !pNd->GetTxtNode() )\n {\n PCURCRSR->SetMark();\n PCURCRSR->Move( fnMoveForward, fnGoCntnt );\n bRet |= GetDoc()->Copy( *PCURCRSR, aPos );\n PCURCRSR->Exchange();\n PCURCRSR->DeleteMark();\n }\n }\n else\n bRet |= GetDoc()->Copy( *PCURCRSR, aPos );\n\n FOREACHPAM_END()\n }\n\n pInsDoc->UnlockExpFlds();\n if( !pInsDoc->IsExpFldsLocked() )\n pInsDoc->UpdateExpFlds(NULL, true);\n\n \/\/ die gemerkte Node-Position wieder auf den richtigen Node\n if( bRet && pSttNd )\n (*pSttNd)++;\n\n\n return bRet;\n}\n\n\/*------------------------------------------------------------------------\n Beschreibung: Text innerhalb der Selektion erfragen\n Returnwert: liefert FALSE, wenn der selektierte Bereich\n zu gross ist, um in den Stringpuffer kopiert zu werden.\n------------------------------------------------------------------------*\/\n\nBOOL SwEditShell::GetSelectedText( String &rBuf, int nHndlParaBrk )\n{\n BOOL bRet = FALSE;\n GetCrsr(); \/\/ ggfs. alle Cursor erzeugen lassen\n if( IsSelOnePara() )\n {\n rBuf = GetSelTxt();\n if( GETSELTXT_PARABRK_TO_BLANK == nHndlParaBrk )\n {\n xub_StrLen nPos = 0;\n while( STRING_NOTFOUND !=\n ( nPos = rBuf.SearchAndReplace( 0x0a, ' ', nPos )) )\n ;\n }\n else if( IsSelFullPara() &&\n GETSELTXT_PARABRK_TO_ONLYCR != nHndlParaBrk )\n {\n#if defined(MAC)\n rBuf += '\\015';\n#elif defined(UNX)\n rBuf += '\\012';\n#else\n rBuf += String::CreateFromAscii(\n RTL_CONSTASCII_STRINGPARAM( \"\\015\\012\" ));\n#endif\n }\n bRet = TRUE;\n }\n else if( IsSelection() )\n {\n SvCacheStream aStream(20480);\n#ifdef OSL_BIGENDIAN\n aStream.SetNumberFormatInt( NUMBERFORMAT_INT_BIGENDIAN );\n#else\n aStream.SetNumberFormatInt( NUMBERFORMAT_INT_LITTLEENDIAN );\n#endif\n WriterRef xWrt;\n SwIoSystem::GetWriter( String::CreateFromAscii( FILTER_TEXT ), String(), xWrt );\n if( xWrt.Is() )\n {\n \/\/ Selektierte Bereiche in ein ASCII Dokument schreiben\n SwWriter aWriter( aStream, *this);\n xWrt->SetShowProgress( FALSE );\n\n switch( nHndlParaBrk )\n {\n case GETSELTXT_PARABRK_TO_BLANK:\n xWrt->bASCII_ParaAsBlanc = TRUE;\n xWrt->bASCII_NoLastLineEnd = TRUE;\n break;\n\n case GETSELTXT_PARABRK_TO_ONLYCR:\n xWrt->bASCII_ParaAsCR = TRUE;\n xWrt->bASCII_NoLastLineEnd = TRUE;\n break;\n }\n\n \/\/JP 09.05.00: write as UNICODE ! (and not as ANSI)\n SwAsciiOptions aAsciiOpt( xWrt->GetAsciiOptions() );\n aAsciiOpt.SetCharSet( RTL_TEXTENCODING_UCS2 );\n xWrt->SetAsciiOptions( aAsciiOpt );\n xWrt->bUCS2_WithStartChar = FALSE;\n\n long lLen;\n if( !IsError( aWriter.Write( xWrt ) ) &&\n STRING_MAXLEN > (( lLen = aStream.GetSize() )\n \/ sizeof( sal_Unicode )) + 1 )\n {\n aStream << (sal_Unicode)'\\0';\n\n const sal_Unicode *p = (sal_Unicode*)aStream.GetBuffer();\n if( p )\n rBuf = p;\n else\n {\n sal_Unicode* pStrBuf = rBuf.AllocBuffer( xub_StrLen(\n ( lLen \/ sizeof( sal_Unicode ))) );\n aStream.Seek( 0 );\n aStream.ResetError();\n aStream.Read( pStrBuf, lLen );\n pStrBuf[ lLen \/ sizeof( sal_Unicode ) ] = '\\0';\n }\n }\n }\n }\n\n return TRUE;\n}\n\n\n\n\n\n<|endoftext|>"} {"text":"<commit_before><commit_msg>Remove some warnings<commit_after><|endoftext|>"} {"text":"<commit_before>\/\/------------------------------------------------------------------------------\n\/\/ CLING - the C++ LLVM-based InterpreterG :)\n\/\/ version: $Id$\n\/\/ author: Vassil Vassilev <vvasilev@cern.ch>\n\/\/------------------------------------------------------------------------------\n\n#include \"MetaParser.h\"\n\n#include \"MetaLexer.h\"\n#include \"MetaSema.h\"\n\n#include \"cling\/Interpreter\/Interpreter.h\"\n#include \"cling\/Interpreter\/InvocationOptions.h\"\n\n#include \"llvm\/ADT\/StringRef.h\"\n#include \"llvm\/Support\/Path.h\"\n\nnamespace cling {\n\n MetaParser::MetaParser(MetaSema* Actions) {\n m_Lexer.reset(0);\n m_Actions.reset(Actions);\n const InvocationOptions& Opts = Actions->getInterpreter().getOptions();\n MetaLexer metaSymbolLexer(Opts.MetaString);\n Token Tok;\n while(true) {\n metaSymbolLexer.Lex(Tok);\n if (Tok.is(tok::eof))\n break;\n m_MetaSymbolCache.push_back(Tok);\n }\n }\n\n void MetaParser::enterNewInputLine(llvm::StringRef Line) {\n m_Lexer.reset(new MetaLexer(Line));\n m_TokenCache.clear();\n }\n\n void MetaParser::consumeToken() {\n if (m_TokenCache.size())\n m_TokenCache.erase(m_TokenCache.begin());\n \n lookAhead(0);\n }\n\n void MetaParser::consumeAnyStringToken(tok::TokenKind stopAt\/*=tok::space*\/) {\n consumeToken();\n \/\/ we have to merge the tokens from the queue until we reach eof token or\n \/\/ space token\n SkipWhitespace();\n \/\/ Add the new token in which we will merge the others.\n Token& MergedTok = m_TokenCache.front();\n\n if (MergedTok.is(stopAt) || MergedTok.is(tok::eof) \n || MergedTok.is(tok::comment))\n return;\n\n Token Tok = lookAhead(1);\n while (Tok.isNot(stopAt) && Tok.isNot(tok::eof)){\n \/\/MergedTok.setLength(MergedTok.getLength() + Tok.getLength());\n m_TokenCache.erase(m_TokenCache.begin() + 1);\n Tok = lookAhead(1);\n }\n MergedTok.setKind(tok::raw_ident);\n MergedTok.setLength(Tok.getBufStart() - MergedTok.getBufStart());\n }\n\n const Token& MetaParser::lookAhead(unsigned N) {\n if (N < m_TokenCache.size())\n return m_TokenCache[N];\n\n for (unsigned C = N+1 - m_TokenCache.size(); C > 0; --C) {\n m_TokenCache.push_back(Token());\n m_Lexer->Lex(m_TokenCache.back());\n }\n return m_TokenCache.back();\n }\n\n void MetaParser::SkipWhitespace() {\n while(getCurTok().is(tok::space))\n consumeToken();\n }\n\n bool MetaParser::isMetaCommand() {\n return isCommandSymbol() && isCommand();\n }\n\n bool MetaParser::isCommandSymbol() {\n for (size_t i = 0; i < m_MetaSymbolCache.size(); ++i) {\n if (getCurTok().getKind() != m_MetaSymbolCache[i].getKind())\n return false;\n consumeToken();\n }\n return true;\n }\n\n bool MetaParser::isCommand() {\n return isLCommand() || isXCommand() || isqCommand() \n || isUCommand() || isICommand() || israwInputCommand() \n || isprintASTCommand() || isdynamicExtensionsCommand() || ishelpCommand()\n || isfileExCommand() || isfilesCommand() || isClassCommand();\n }\n\n \/\/ L := 'L' FilePath\n \/\/ FilePath := AnyString\n \/\/ AnyString := .*^(' ' | '\\t')\n bool MetaParser::isLCommand() {\n bool result = false;\n if (getCurTok().is(tok::ident) && getCurTok().getIdent().equals(\"L\")) {\n consumeAnyStringToken();\n if (getCurTok().is(tok::raw_ident)) {\n result = true;\n m_Actions->actOnLCommand(llvm::sys::Path(getCurTok().getIdent()));\n consumeToken();\n if (getCurTok().is(tok::comment)) {\n consumeAnyStringToken();\n m_Actions->actOnComment(getCurTok().getIdent());\n }\n }\n }\n \/\/ TODO: Some fine grained diagnostics\n return result;\n }\n\n \/\/ XCommand := 'x' FilePath[ArgList] | 'X' FilePath[ArgList]\n \/\/ FilePath := AnyString\n \/\/ ArgList := (ExtraArgList) ' ' [ArgList]\n \/\/ ExtraArgList := AnyString [, ExtraArgList]\n bool MetaParser::isXCommand() {\n bool result = false;\n const Token& Tok = getCurTok();\n if (Tok.is(tok::ident) && (Tok.getIdent().equals(\"x\")\n || Tok.getIdent().equals(\"X\"))) {\n \/\/ There might be ArgList\n consumeAnyStringToken(tok::l_paren);\n llvm::sys::Path file(getCurTok().getIdent());\n llvm::StringRef args;\n result = true;\n consumeToken();\n if (getCurTok().is(tok::l_paren) && isExtraArgList()) {\n args = getCurTok().getIdent();\n consumeToken(); \/\/ consume the closing paren\n }\n m_Actions->actOnxCommand(file, args);\n if (getCurTok().is(tok::comment)) {\n consumeAnyStringToken();\n m_Actions->actOnComment(getCurTok().getIdent());\n }\n }\n\n return result;\n }\n\n \/\/ ExtraArgList := AnyString [, ExtraArgList]\n bool MetaParser::isExtraArgList() {\n \/\/ This might be expanded if we need better arg parsing.\n consumeAnyStringToken(tok::r_paren);\n \n return getCurTok().is(tok::raw_ident);\n }\n\n bool MetaParser::isqCommand() {\n bool result = false;\n if (getCurTok().is(tok::ident) && getCurTok().getIdent().equals(\"q\")) {\n result = true;\n m_Actions->actOnqCommand();\n }\n return result;\n }\n\n bool MetaParser::isUCommand() {\n if (getCurTok().is(tok::ident) && getCurTok().getIdent().equals(\"q\")) {\n m_Actions->actOnUCommand();\n return true;\n }\n return false;\n }\n\n bool MetaParser::isICommand() {\n if (getCurTok().is(tok::ident) && getCurTok().getIdent().equals(\"I\")) {\n consumeAnyStringToken();\n llvm::sys::Path path;\n if (getCurTok().is(tok::raw_ident))\n path = getCurTok().getIdent();\n m_Actions->actOnICommand(path);\n return true;\n }\n return false;\n }\n\n bool MetaParser::israwInputCommand() {\n if (getCurTok().is(tok::ident) &&\n getCurTok().getIdent().equals(\"rawInput\")) {\n MetaSema::SwitchMode mode = MetaSema::kToggle;\n consumeToken();\n SkipWhitespace();\n if (getCurTok().is(tok::constant))\n mode = (MetaSema::SwitchMode)getCurTok().getConstant();\n m_Actions->actOnrawInputCommand(mode);\n return true;\n }\n return false;\n }\n\n bool MetaParser::isprintASTCommand() {\n if (getCurTok().is(tok::ident) &&\n getCurTok().getIdent().equals(\"printAST\")) {\n MetaSema::SwitchMode mode = MetaSema::kToggle;\n consumeToken();\n SkipWhitespace();\n if (getCurTok().is(tok::constant))\n mode = (MetaSema::SwitchMode)getCurTok().getConstant();\n m_Actions->actOnprintASTCommand(mode);\n return true;\n }\n return false;\n }\n\n bool MetaParser::isdynamicExtensionsCommand() {\n if (getCurTok().is(tok::ident) &&\n getCurTok().getIdent().equals(\"dynamicExtensions\")) {\n MetaSema::SwitchMode mode = MetaSema::kToggle;\n consumeToken();\n SkipWhitespace();\n if (getCurTok().is(tok::constant))\n mode = (MetaSema::SwitchMode)getCurTok().getConstant();\n m_Actions->actOndynamicExtensionsCommand(mode);\n return true;\n }\n return false;\n }\n\n bool MetaParser::ishelpCommand() {\n if (getCurTok().is(tok::ident) && getCurTok().getIdent().equals(\"help\")) {\n m_Actions->actOnhelpCommand();\n return true;\n }\n return false;\n }\n\n bool MetaParser::isfileExCommand() {\n if (getCurTok().is(tok::ident) && getCurTok().getIdent().equals(\"fileEx\")) {\n m_Actions->actOnfileExCommand();\n return true;\n }\n return false;\n }\n\n bool MetaParser::isfilesCommand() {\n if (getCurTok().is(tok::ident) && getCurTok().getIdent().equals(\"files\")) {\n m_Actions->actOnfilesCommand();\n return true;\n }\n return false;\n }\n\n bool MetaParser::isClassCommand() {\n const Token& Tok = getCurTok();\n if (Tok.is(tok::ident)) {\n if (Tok.getIdent().equals(\"class\")) {\n consumeAnyStringToken();\n const Token& NextTok = getCurTok();\n llvm::StringRef className;\n if (NextTok.is(tok::raw_ident))\n className = Tok.getIdent();\n m_Actions->actOnclassCommand(className);\n return true;\n }\n else if (Tok.getIdent().equals(\"Class\")) {\n m_Actions->actOnClassCommand();\n return true;\n }\n }\n return false;\n }\n\n} \/\/ end namespace cling\n<commit_msg>Ugly typo.<commit_after>\/\/------------------------------------------------------------------------------\n\/\/ CLING - the C++ LLVM-based InterpreterG :)\n\/\/ version: $Id$\n\/\/ author: Vassil Vassilev <vvasilev@cern.ch>\n\/\/------------------------------------------------------------------------------\n\n#include \"MetaParser.h\"\n\n#include \"MetaLexer.h\"\n#include \"MetaSema.h\"\n\n#include \"cling\/Interpreter\/Interpreter.h\"\n#include \"cling\/Interpreter\/InvocationOptions.h\"\n\n#include \"llvm\/ADT\/StringRef.h\"\n#include \"llvm\/Support\/Path.h\"\n\nnamespace cling {\n\n MetaParser::MetaParser(MetaSema* Actions) {\n m_Lexer.reset(0);\n m_Actions.reset(Actions);\n const InvocationOptions& Opts = Actions->getInterpreter().getOptions();\n MetaLexer metaSymbolLexer(Opts.MetaString);\n Token Tok;\n while(true) {\n metaSymbolLexer.Lex(Tok);\n if (Tok.is(tok::eof))\n break;\n m_MetaSymbolCache.push_back(Tok);\n }\n }\n\n void MetaParser::enterNewInputLine(llvm::StringRef Line) {\n m_Lexer.reset(new MetaLexer(Line));\n m_TokenCache.clear();\n }\n\n void MetaParser::consumeToken() {\n if (m_TokenCache.size())\n m_TokenCache.erase(m_TokenCache.begin());\n \n lookAhead(0);\n }\n\n void MetaParser::consumeAnyStringToken(tok::TokenKind stopAt\/*=tok::space*\/) {\n consumeToken();\n \/\/ we have to merge the tokens from the queue until we reach eof token or\n \/\/ space token\n SkipWhitespace();\n \/\/ Add the new token in which we will merge the others.\n Token& MergedTok = m_TokenCache.front();\n\n if (MergedTok.is(stopAt) || MergedTok.is(tok::eof) \n || MergedTok.is(tok::comment))\n return;\n\n Token Tok = lookAhead(1);\n while (Tok.isNot(stopAt) && Tok.isNot(tok::eof)){\n \/\/MergedTok.setLength(MergedTok.getLength() + Tok.getLength());\n m_TokenCache.erase(m_TokenCache.begin() + 1);\n Tok = lookAhead(1);\n }\n MergedTok.setKind(tok::raw_ident);\n MergedTok.setLength(Tok.getBufStart() - MergedTok.getBufStart());\n }\n\n const Token& MetaParser::lookAhead(unsigned N) {\n if (N < m_TokenCache.size())\n return m_TokenCache[N];\n\n for (unsigned C = N+1 - m_TokenCache.size(); C > 0; --C) {\n m_TokenCache.push_back(Token());\n m_Lexer->Lex(m_TokenCache.back());\n }\n return m_TokenCache.back();\n }\n\n void MetaParser::SkipWhitespace() {\n while(getCurTok().is(tok::space))\n consumeToken();\n }\n\n bool MetaParser::isMetaCommand() {\n return isCommandSymbol() && isCommand();\n }\n\n bool MetaParser::isCommandSymbol() {\n for (size_t i = 0; i < m_MetaSymbolCache.size(); ++i) {\n if (getCurTok().getKind() != m_MetaSymbolCache[i].getKind())\n return false;\n consumeToken();\n }\n return true;\n }\n\n bool MetaParser::isCommand() {\n return isLCommand() || isXCommand() || isqCommand() \n || isUCommand() || isICommand() || israwInputCommand() \n || isprintASTCommand() || isdynamicExtensionsCommand() || ishelpCommand()\n || isfileExCommand() || isfilesCommand() || isClassCommand();\n }\n\n \/\/ L := 'L' FilePath\n \/\/ FilePath := AnyString\n \/\/ AnyString := .*^(' ' | '\\t')\n bool MetaParser::isLCommand() {\n bool result = false;\n if (getCurTok().is(tok::ident) && getCurTok().getIdent().equals(\"L\")) {\n consumeAnyStringToken();\n if (getCurTok().is(tok::raw_ident)) {\n result = true;\n m_Actions->actOnLCommand(llvm::sys::Path(getCurTok().getIdent()));\n consumeToken();\n if (getCurTok().is(tok::comment)) {\n consumeAnyStringToken();\n m_Actions->actOnComment(getCurTok().getIdent());\n }\n }\n }\n \/\/ TODO: Some fine grained diagnostics\n return result;\n }\n\n \/\/ XCommand := 'x' FilePath[ArgList] | 'X' FilePath[ArgList]\n \/\/ FilePath := AnyString\n \/\/ ArgList := (ExtraArgList) ' ' [ArgList]\n \/\/ ExtraArgList := AnyString [, ExtraArgList]\n bool MetaParser::isXCommand() {\n bool result = false;\n const Token& Tok = getCurTok();\n if (Tok.is(tok::ident) && (Tok.getIdent().equals(\"x\")\n || Tok.getIdent().equals(\"X\"))) {\n \/\/ There might be ArgList\n consumeAnyStringToken(tok::l_paren);\n llvm::sys::Path file(getCurTok().getIdent());\n llvm::StringRef args;\n result = true;\n consumeToken();\n if (getCurTok().is(tok::l_paren) && isExtraArgList()) {\n args = getCurTok().getIdent();\n consumeToken(); \/\/ consume the closing paren\n }\n m_Actions->actOnxCommand(file, args);\n if (getCurTok().is(tok::comment)) {\n consumeAnyStringToken();\n m_Actions->actOnComment(getCurTok().getIdent());\n }\n }\n\n return result;\n }\n\n \/\/ ExtraArgList := AnyString [, ExtraArgList]\n bool MetaParser::isExtraArgList() {\n \/\/ This might be expanded if we need better arg parsing.\n consumeAnyStringToken(tok::r_paren);\n \n return getCurTok().is(tok::raw_ident);\n }\n\n bool MetaParser::isqCommand() {\n bool result = false;\n if (getCurTok().is(tok::ident) && getCurTok().getIdent().equals(\"q\")) {\n result = true;\n m_Actions->actOnqCommand();\n }\n return result;\n }\n\n bool MetaParser::isUCommand() {\n if (getCurTok().is(tok::ident) && getCurTok().getIdent().equals(\"U\")) {\n m_Actions->actOnUCommand();\n return true;\n }\n return false;\n }\n\n bool MetaParser::isICommand() {\n if (getCurTok().is(tok::ident) && getCurTok().getIdent().equals(\"I\")) {\n consumeAnyStringToken();\n llvm::sys::Path path;\n if (getCurTok().is(tok::raw_ident))\n path = getCurTok().getIdent();\n m_Actions->actOnICommand(path);\n return true;\n }\n return false;\n }\n\n bool MetaParser::israwInputCommand() {\n if (getCurTok().is(tok::ident) &&\n getCurTok().getIdent().equals(\"rawInput\")) {\n MetaSema::SwitchMode mode = MetaSema::kToggle;\n consumeToken();\n SkipWhitespace();\n if (getCurTok().is(tok::constant))\n mode = (MetaSema::SwitchMode)getCurTok().getConstant();\n m_Actions->actOnrawInputCommand(mode);\n return true;\n }\n return false;\n }\n\n bool MetaParser::isprintASTCommand() {\n if (getCurTok().is(tok::ident) &&\n getCurTok().getIdent().equals(\"printAST\")) {\n MetaSema::SwitchMode mode = MetaSema::kToggle;\n consumeToken();\n SkipWhitespace();\n if (getCurTok().is(tok::constant))\n mode = (MetaSema::SwitchMode)getCurTok().getConstant();\n m_Actions->actOnprintASTCommand(mode);\n return true;\n }\n return false;\n }\n\n bool MetaParser::isdynamicExtensionsCommand() {\n if (getCurTok().is(tok::ident) &&\n getCurTok().getIdent().equals(\"dynamicExtensions\")) {\n MetaSema::SwitchMode mode = MetaSema::kToggle;\n consumeToken();\n SkipWhitespace();\n if (getCurTok().is(tok::constant))\n mode = (MetaSema::SwitchMode)getCurTok().getConstant();\n m_Actions->actOndynamicExtensionsCommand(mode);\n return true;\n }\n return false;\n }\n\n bool MetaParser::ishelpCommand() {\n if (getCurTok().is(tok::ident) && getCurTok().getIdent().equals(\"help\")) {\n m_Actions->actOnhelpCommand();\n return true;\n }\n return false;\n }\n\n bool MetaParser::isfileExCommand() {\n if (getCurTok().is(tok::ident) && getCurTok().getIdent().equals(\"fileEx\")) {\n m_Actions->actOnfileExCommand();\n return true;\n }\n return false;\n }\n\n bool MetaParser::isfilesCommand() {\n if (getCurTok().is(tok::ident) && getCurTok().getIdent().equals(\"files\")) {\n m_Actions->actOnfilesCommand();\n return true;\n }\n return false;\n }\n\n bool MetaParser::isClassCommand() {\n const Token& Tok = getCurTok();\n if (Tok.is(tok::ident)) {\n if (Tok.getIdent().equals(\"class\")) {\n consumeAnyStringToken();\n const Token& NextTok = getCurTok();\n llvm::StringRef className;\n if (NextTok.is(tok::raw_ident))\n className = Tok.getIdent();\n m_Actions->actOnclassCommand(className);\n return true;\n }\n else if (Tok.getIdent().equals(\"Class\")) {\n m_Actions->actOnClassCommand();\n return true;\n }\n }\n return false;\n }\n\n} \/\/ end namespace cling\n<|endoftext|>"} {"text":"<commit_before><commit_msg>Tiled Rendering: ensure rendered area is visible correctly.<commit_after><|endoftext|>"} {"text":"<commit_before><commit_msg>added Size touch_lo_get_content_size()<commit_after><|endoftext|>"} {"text":"<commit_before>\/*-------------------------------------------------------------------------\n *\n * bridge_test_mix.cpp\n * file description\n *\n * Copyright(c) 2015, CMU\n *\n * \/peloton\/tests\/bridge\/bridge_test_mix.cpp\n *\n *-------------------------------------------------------------------------\n *\/\n\n#include \"bridge_test.h\"\n\n#include \"backend\/bridge\/ddl\/bridge.h\"\n#include \"backend\/bridge\/ddl\/ddl.h\"\n#include \"backend\/bridge\/ddl\/ddl_table.h\"\n#include \"backend\/bridge\/ddl\/ddl_index.h\"\n#include \"backend\/catalog\/manager.h\"\n#include \"backend\/storage\/database.h\"\n\nnamespace peloton {\nnamespace bridge {\n\n\/**\n * @brief Test many DDL functions together\n *\/\nvoid BridgeTest::DDL_MIX_TEST() {\n\n DDL_MIX_TEST_1();\n\n DDL_MIX_TEST_2();\n\n DDL_MIX_TEST_3();\n\n}\n\n\/**\n * @brief Create a table with simple columns that contain\n * column-level constraints such as single column \n * primary key, unique, and reference table \n *\/\nvoid BridgeTest::DDL_MIX_TEST_1() {\n\n auto& manager = catalog::Manager::GetInstance();\n storage::Database* db = manager.GetDatabaseWithOid(Bridge::GetCurrentDatabaseOid());\n\n \/\/ Get the simple columns\n std::vector<catalog::Column> columns = CreateSimpleColumns();\n\n \/\/ Table name and oid\n std::string table_name = \"test_table_column_constraint\";\n oid_t table_oid = 50001;\n\n \/\/ Create a table\n bool status = DDLTable::CreateTable(table_oid, table_name, columns);\n assert(status);\n\n \/\/ Get the table pointer and schema\n storage::DataTable* table = db->GetTableWithOid(table_oid);\n catalog::Schema *schema = table->GetSchema();\n\n \/\/ Create the constrains\n catalog::Constraint notnull_constraint(CONSTRAINT_TYPE_NOTNULL);\n\n \/\/ Add one constraint to the one column\n schema->AddConstraint(\"id\", notnull_constraint);\n\n \/\/ Create a primary key index and added primary key constraint to the 'name' column\n oid_t primary_key_index_oid = 50002;\n CreateSamplePrimaryKeyIndex(table_name, primary_key_index_oid);\n\n \/\/ Create a unique index and added unique constraint to the 'time' column\n oid_t unique_index_oid = 50003;\n CreateSampleUniqueIndex(table_name, unique_index_oid);\n\n \/\/ Create a reference table and foreign key constraint and added unique constraint to the 'salary' column\n std::string pktable_name = \"pktable\";\n oid_t pktable_oid = 50004;\n CreateSampleForeignKey(pktable_oid, pktable_name, columns, table_oid);\n\n \/\/ Check the first column's constraint \n catalog::Column column = schema->GetColumn(0);\n CheckColumnWithConstraint( column, CONSTRAINT_TYPE_NOTNULL, \"\", 1);\n\n \/\/ Check the second column's constraint and index\n column = schema->GetColumn(1);\n CheckColumnWithConstraint( column, CONSTRAINT_TYPE_PRIMARY, table_name+\"_pkey\", 1);\n index::Index *index = table->GetIndexWithOid(primary_key_index_oid);\n CheckIndex(index, table_name+\"_pkey\", 1, INDEX_TYPE_BTREE_MULTIMAP, INDEX_CONSTRAINT_TYPE_PRIMARY_KEY, true);\n\n \/\/ Check the third column's constraint and index\n column = schema->GetColumn(2);\n CheckColumnWithConstraint( column, CONSTRAINT_TYPE_UNIQUE, table_name+\"_key\", 1);\n index = table->GetIndexWithOid(unique_index_oid);\n CheckIndex(index, table_name+\"_key\", 1, INDEX_TYPE_BTREE_MULTIMAP, INDEX_CONSTRAINT_TYPE_UNIQUE, true);\n\n \/\/ Check the fourth column's constraint and foreign key\n column = schema->GetColumn(3);\n CheckColumnWithConstraint( column, CONSTRAINT_TYPE_FOREIGN, \"THIS_IS_FOREIGN_CONSTRAINT\", 1, 0);\n catalog::ForeignKey *pktable = table->GetForeignKey(0);\n CheckForeignKey( pktable, pktable_oid, \"THIS_IS_FOREIGN_CONSTRAINT\", 1, 1, 'r', 'c' );\n\n \/\/ Drop the table\n status = DDLTable::DropTable(table_oid);\n assert(status);\n\n \/\/ Drop the table\n status = DDLTable::DropTable(pktable_oid);\n assert(status);\n\n std::cout << \":::::: \" << __func__ << \" DONE\\n\";\n}\n\n\/**\n * @brief Test DDL and DML together. Create a table and drop it. Create a table\n * again and insert tuple into the table. \n *\/\nvoid BridgeTest::DDL_MIX_TEST_2() {\n\n auto& manager = catalog::Manager::GetInstance();\n storage::Database* db = manager.GetDatabaseWithOid(Bridge::GetCurrentDatabaseOid());\n\n \/\/ Get the simple columns\n std::vector<catalog::Column> columns = CreateSimpleColumns();\n\n \/\/ Table name and oid\n std::string table_name = \"ddl_dml_mix_test_table\";\n oid_t table_oid = 60001;\n\n \/\/ Create a table\n bool status = DDLTable::CreateTable(table_oid, table_name, columns);\n assert(status);\n\n \/\/ Drop the table\n status = DDLTable::DropTable(table_oid);\n assert(status);\n\n \/\/ Create a table again\n status = DDLTable::CreateTable(table_oid, table_name, columns);\n assert(status);\n\n \/\/ Get the table pointer and schema\n storage::DataTable* table = db->GetTableWithOid(table_oid);\n catalog::Schema *schema = table->GetSchema();\n\n \/\/ Ensure that the tile group is as expected.\n assert(schema->GetColumnCount() == 4);\n\n \/\/ Insert tuples\n const bool allocate = true;\n\n for (int col_itr = 0; col_itr < 5; col_itr++) {\n\n storage::Tuple tuple(schema, allocate);\n\n \/\/ Setting values\n Value integerValue = ValueFactory::GetIntegerValue(243432);\n Value stringValue = ValueFactory::GetStringValue(\"dude\");\n Value timestampValue = ValueFactory::GetTimestampValue(10.22);\n Value doubleValue = ValueFactory::GetDoubleValue(244643.1236);\n \n tuple.SetValue(0, integerValue);\n tuple.SetValue(1, stringValue);\n tuple.SetValue(2, timestampValue);\n tuple.SetValue(3, doubleValue);\n\n table->InsertTuple((txn_id_t)col_itr, &tuple, false);\n\n assert(tuple.GetValue(0) == integerValue);\n assert(tuple.GetValue(1) == stringValue);\n assert(tuple.GetValue(2) == timestampValue);\n assert(tuple.GetValue(3) == doubleValue);\n }\n\n \/\/ Drop the table\n status = DDLTable::DropTable(table_oid);\n assert(status);\n\n std::cout << \":::::: \" << __func__ << \" DONE\\n\";\n}\n\n\/**\n * @brief UpdateStats Test\n *\/\nvoid BridgeTest::DDL_MIX_TEST_3() {\n bool status;\n auto& manager = catalog::Manager::GetInstance();\n storage::Database* db = manager.GetDatabaseWithOid(Bridge::GetCurrentDatabaseOid());\n\n \/\/ Get the simple columns\n std::vector<catalog::Column> columns = CreateSimpleColumns();\n\n \/\/ Table name and oid\n std::string table_name = \"DDL_MIX_TEST_3\";\n\n \/\/ Create a table in Postgres \n oid_t table_oid = CreateTableInPostgres(table_name);\n assert(table_oid);\n\n \/\/ Create a table in Peloton as well\n status = DDLTable::CreateTable(table_oid, table_name, columns);\n assert(status);\n\n \/\/ insert tuple\n \/\/ Get the table pointer and schema\n storage::DataTable* table = db->GetTableWithOid(table_oid);\n catalog::Schema *schema = table->GetSchema();\n\n \/\/ Ensure that the tile group is as expected.\n assert(schema->GetColumnCount() == 4);\n\n \/\/ Insert tuples\n const bool allocate = true;\n\n for (int col_itr = 0; col_itr < 5; col_itr++) {\n\n storage::Tuple tuple(schema, allocate);\n\n \/\/ Setting values\n Value integerValue = ValueFactory::GetIntegerValue(243432);\n Value stringValue = ValueFactory::GetStringValue(\"dude\");\n Value timestampValue = ValueFactory::GetTimestampValue(10.22);\n Value doubleValue = ValueFactory::GetDoubleValue(244643.1236);\n \n tuple.SetValue(0, integerValue);\n tuple.SetValue(1, stringValue);\n tuple.SetValue(2, timestampValue);\n tuple.SetValue(3, doubleValue);\n\n table->InsertTuple((txn_id_t)col_itr, &tuple, false);\n\n assert(tuple.GetValue(0) == integerValue);\n assert(tuple.GetValue(1) == stringValue);\n assert(tuple.GetValue(2) == timestampValue);\n assert(tuple.GetValue(3) == doubleValue);\n }\n\n \/\/ get the number of tuples\n assert( Bridge::GetNumberOfTuples(table_oid) == 0 );\n\n \/\/ analyze\n db->UpdateStats();\n\n \/\/ get the number of tuples\n assert( Bridge::GetNumberOfTuples(table_oid) == 5 );\n\n \/\/ create table\n \/\/ Create a table in Peloton as well\n status = DDLTable::CreateTable(table_oid+1, table_name+\"second\", columns);\n assert(status);\n\n \/\/ Drop the table in Postgres\n status = DropTableInPostgres(table_name);\n assert(status);\n\n \/\/ Drop the table\n status = DDLTable::DropTable(table_oid);\n assert(status);\n\n \/\/ Drop the table\n status = DDLTable::DropTable(table_oid+1);\n assert(status);\n}\n\n} \/\/ End bridge namespace\n} \/\/ End peloton namespace\n\n<commit_msg>Minor fix<commit_after>\/*-------------------------------------------------------------------------\n *\n * bridge_test_mix.cpp\n * file description\n *\n * Copyright(c) 2015, CMU\n *\n * \/peloton\/tests\/bridge\/bridge_test_mix.cpp\n *\n *-------------------------------------------------------------------------\n *\/\n\n#include \"bridge_test.h\"\n\n#include \"backend\/bridge\/ddl\/bridge.h\"\n#include \"backend\/bridge\/ddl\/ddl.h\"\n#include \"backend\/bridge\/ddl\/ddl_table.h\"\n#include \"backend\/bridge\/ddl\/ddl_index.h\"\n#include \"backend\/catalog\/manager.h\"\n#include \"backend\/storage\/database.h\"\n\nnamespace peloton {\nnamespace bridge {\n\n\/**\n * @brief Test many DDL functions together\n *\/\nvoid BridgeTest::DDL_MIX_TEST() {\n\n DDL_MIX_TEST_1();\n\n DDL_MIX_TEST_2();\n\n DDL_MIX_TEST_3();\n\n}\n\n\/**\n * @brief Create a table with simple columns that contain\n * column-level constraints such as single column \n * primary key, unique, and reference table \n *\/\nvoid BridgeTest::DDL_MIX_TEST_1() {\n\n auto& manager = catalog::Manager::GetInstance();\n storage::Database* db = manager.GetDatabaseWithOid(Bridge::GetCurrentDatabaseOid());\n\n \/\/ Get the simple columns\n std::vector<catalog::Column> columns = CreateSimpleColumns();\n\n \/\/ Table name and oid\n std::string table_name = \"test_table_column_constraint\";\n oid_t table_oid = 50001;\n\n \/\/ Create a table\n bool status = DDLTable::CreateTable(table_oid, table_name, columns);\n assert(status);\n\n \/\/ Get the table pointer and schema\n storage::DataTable* table = db->GetTableWithOid(table_oid);\n catalog::Schema *schema = table->GetSchema();\n\n \/\/ Create the constrains\n catalog::Constraint notnull_constraint(CONSTRAINT_TYPE_NOTNULL);\n\n \/\/ Add one constraint to the one column\n schema->AddConstraint(\"id\", notnull_constraint);\n\n \/\/ Create a primary key index and added primary key constraint to the 'name' column\n oid_t primary_key_index_oid = 50002;\n CreateSamplePrimaryKeyIndex(table_name, primary_key_index_oid);\n\n \/\/ Create a unique index and added unique constraint to the 'time' column\n oid_t unique_index_oid = 50003;\n CreateSampleUniqueIndex(table_name, unique_index_oid);\n\n \/\/ Create a reference table and foreign key constraint and added unique constraint to the 'salary' column\n std::string pktable_name = \"pktable\";\n oid_t pktable_oid = 50004;\n CreateSampleForeignKey(pktable_oid, pktable_name, columns, table_oid);\n\n \/\/ Check the first column's constraint \n catalog::Column column = schema->GetColumn(0);\n CheckColumnWithConstraint( column, CONSTRAINT_TYPE_NOTNULL, \"\", 1);\n\n \/\/ Check the second column's constraint and index\n column = schema->GetColumn(1);\n CheckColumnWithConstraint( column, CONSTRAINT_TYPE_PRIMARY, table_name+\"_pkey\", 1);\n index::Index *index = table->GetIndexWithOid(primary_key_index_oid);\n CheckIndex(index, table_name+\"_pkey\", 1, INDEX_TYPE_BTREE_MULTIMAP, INDEX_CONSTRAINT_TYPE_PRIMARY_KEY, true);\n\n \/\/ Check the third column's constraint and index\n column = schema->GetColumn(2);\n CheckColumnWithConstraint( column, CONSTRAINT_TYPE_UNIQUE, table_name+\"_key\", 1);\n index = table->GetIndexWithOid(unique_index_oid);\n CheckIndex(index, table_name+\"_key\", 1, INDEX_TYPE_BTREE_MULTIMAP, INDEX_CONSTRAINT_TYPE_UNIQUE, true);\n\n \/\/ Check the fourth column's constraint and foreign key\n column = schema->GetColumn(3);\n CheckColumnWithConstraint( column, CONSTRAINT_TYPE_FOREIGN, \"THIS_IS_FOREIGN_CONSTRAINT\", 1, 0);\n catalog::ForeignKey *pktable = table->GetForeignKey(0);\n CheckForeignKey( pktable, pktable_oid, \"THIS_IS_FOREIGN_CONSTRAINT\", 1, 1, 'r', 'c' );\n\n \/\/ Drop the table\n status = DDLTable::DropTable(table_oid);\n assert(status);\n\n \/\/ Drop the table\n status = DDLTable::DropTable(pktable_oid);\n assert(status);\n\n std::cout << \":::::: \" << __func__ << \" DONE\\n\";\n}\n\n\/**\n * @brief Test DDL and DML together. Create a table and drop it. Create a table\n * again and insert tuple into the table. \n *\/\nvoid BridgeTest::DDL_MIX_TEST_2() {\n\n auto& manager = catalog::Manager::GetInstance();\n storage::Database* db = manager.GetDatabaseWithOid(Bridge::GetCurrentDatabaseOid());\n\n \/\/ Get the simple columns\n std::vector<catalog::Column> columns = CreateSimpleColumns();\n\n \/\/ Table name and oid\n std::string table_name = \"ddl_dml_mix_test_table\";\n oid_t table_oid = 60001;\n\n \/\/ Create a table\n bool status = DDLTable::CreateTable(table_oid, table_name, columns);\n assert(status);\n\n \/\/ Drop the table\n status = DDLTable::DropTable(table_oid);\n assert(status);\n\n \/\/ Create a table again\n status = DDLTable::CreateTable(table_oid, table_name, columns);\n assert(status);\n\n \/\/ Get the table pointer and schema\n storage::DataTable* table = db->GetTableWithOid(table_oid);\n catalog::Schema *schema = table->GetSchema();\n\n \/\/ Ensure that the tile group is as expected.\n assert(schema->GetColumnCount() == 4);\n\n \/\/ Insert tuples\n const bool allocate = true;\n\n for (int col_itr = 0; col_itr < 5; col_itr++) {\n\n storage::Tuple tuple(schema, allocate);\n\n \/\/ Setting values\n Value integerValue = ValueFactory::GetIntegerValue(243432);\n Value stringValue = ValueFactory::GetStringValue(\"dude\");\n Value timestampValue = ValueFactory::GetTimestampValue(10.22);\n Value doubleValue = ValueFactory::GetDoubleValue(244643.1236);\n \n tuple.SetValue(0, integerValue);\n tuple.SetValue(1, stringValue);\n tuple.SetValue(2, timestampValue);\n tuple.SetValue(3, doubleValue);\n\n table->InsertTuple((txn_id_t)col_itr, &tuple, false);\n\n assert(tuple.GetValue(0) == integerValue);\n assert(tuple.GetValue(1) == stringValue);\n assert(tuple.GetValue(2) == timestampValue);\n assert(tuple.GetValue(3) == doubleValue);\n }\n\n \/\/ Drop the table\n status = DDLTable::DropTable(table_oid);\n assert(status);\n\n std::cout << \":::::: \" << __func__ << \" DONE\\n\";\n}\n\n\/**\n * @brief UpdateStats Test\n *\/\nvoid BridgeTest::DDL_MIX_TEST_3() {\n bool status;\n\n \/\/ Get db\n auto& manager = catalog::Manager::GetInstance();\n storage::Database* db = manager.GetDatabaseWithOid(Bridge::GetCurrentDatabaseOid());\n\n \/\/ Get the simple columns\n std::vector<catalog::Column> columns = CreateSimpleColumns();\n std::string table_name = \"DDL_MIX_TEST_3\";\n\n \/\/ Create a table in Postgres\n oid_t table_oid = CreateTableInPostgres(table_name);\n assert(table_oid);\n\n \/\/ Create a table in Peloton as well\n status = DDLTable::CreateTable(table_oid, table_name, columns);\n assert(status);\n\n \/\/ insert tuple\n \/\/ Get the table pointer and schema\n storage::DataTable* table = db->GetTableWithOid(table_oid);\n catalog::Schema *schema = table->GetSchema();\n\n \/\/ Ensure that the tile group is as expected.\n assert(schema->GetColumnCount() == 4);\n\n \/\/ Insert tuples\n const bool allocate = true;\n\n for (int col_itr = 0; col_itr < 5; col_itr++) {\n\n storage::Tuple tuple(schema, allocate);\n\n \/\/ Setting values\n Value integerValue = ValueFactory::GetIntegerValue(243432);\n Value stringValue = ValueFactory::GetStringValue(\"dude\");\n Value timestampValue = ValueFactory::GetTimestampValue(10.22);\n Value doubleValue = ValueFactory::GetDoubleValue(244643.1236);\n \n tuple.SetValue(0, integerValue);\n tuple.SetValue(1, stringValue);\n tuple.SetValue(2, timestampValue);\n tuple.SetValue(3, doubleValue);\n\n table->InsertTuple((txn_id_t)col_itr, &tuple, false);\n\n assert(tuple.GetValue(0) == integerValue);\n assert(tuple.GetValue(1) == stringValue);\n assert(tuple.GetValue(2) == timestampValue);\n assert(tuple.GetValue(3) == doubleValue);\n }\n\n \/\/ get the number of tuples\n assert( Bridge::GetNumberOfTuples(table_oid) == 0 );\n\n \/\/ analyze\n db->UpdateStats();\n\n \/\/ get the number of tuples\n assert( Bridge::GetNumberOfTuples(table_oid) == 5 );\n\n \/\/ create table\n \/\/ Create a table in Peloton as well\n status = DDLTable::CreateTable(table_oid+1, table_name+\"second\", columns);\n assert(status);\n\n \/\/ Drop the table in Postgres\n status = DropTableInPostgres(table_name);\n assert(status);\n\n \/\/ Drop the table\n status = DDLTable::DropTable(table_oid);\n assert(status);\n\n \/\/ Drop the table\n status = DDLTable::DropTable(table_oid+1);\n assert(status);\n\n std::cout << \":::::: \" << __func__ << \" DONE\\n\";\n}\n\n} \/\/ End bridge namespace\n} \/\/ End peloton namespace\n\n<|endoftext|>"} {"text":"<commit_before>\/***************************************************************************\n* *\n* Copyright (C) 2003 *\n* by Unai Garro (ugarro@users.sourceforge.net) *\n* Martin Imobersteg <imm@gmx.ch> *\n* and opie project *\n* *\n* *\n* This code was originally developed by the opie project, on which *\n* Martin Imobersteg based his work. *\n* This file is adds a small extension, necessary to perform some minimum *\n* SQL actions *\n* *\n* (this project is different from that in qsqlite.sf.net) *\n* This program is free software; you can redistribute it and\/or modify *\n* it under the terms of the GNU General Public License as published by *\n* the Free Software Foundation; either version 2 of the License, or *\n* (at your option) any later version. *\n***************************************************************************\/\n\n\n#include \"krecqsqlitedb.h\"\n#include \"krecqsqliteresult.h\"\n\n#include <q3valuelist.h>\n\/\/Added by qt3to4:\n#include <QByteArray>\n\n#include <kdebug.h>\n\n#include \"config-krecipes.h\"\n#ifdef HAVE_SQLITE\n#include <sqlite.h>\n#include <cstdlib>\n#elif HAVE_SQLITE3\n#include <sqlite3.h>\n#endif\n\nQSQLiteDB::QSQLiteDB( QObject *, const char * )\n{}\n\nbool QSQLiteDB::open( const QString &dbname )\n{\n#ifdef HAVE_SQLITE\n\tchar * errmsg = 0;\n\tif ( (m_db = sqlite_open( dbname.toLatin1(), 0, &errmsg )) == 0L ) {\n\t\tfree( errmsg );\n\t\treturn false;\n\t}\n#elif HAVE_SQLITE3\n\tif ( sqlite3_open( dbname.toLatin1(), &m_db ) != SQLITE_OK )\n\t\treturn false;\n#endif\n\n\tint func_res;\n\t#ifdef HAVE_SQLITE\n\tfunc_res = sqlite_create_function(m_db,\"lastInsertID\",0,&lastInsertID,m_db );\n\t#elif HAVE_SQLITE3\n\tfunc_res = sqlite3_create_function(m_db,\"lastInsertID\",0,SQLITE_ANY,m_db,\n\t &lastInsertID, 0, 0 );\n\t#endif\n\n\treturn func_res == 0;\n}\n\nvoid QSQLiteDB::close()\n{\n\tif ( m_db ) {\n#ifdef HAVE_SQLITE\n\t\tsqlite_close( m_db );\n#elif HAVE_SQLITE3\n\n\t\tsqlite3_close( m_db );\n#endif\n\n\t\tm_db = 0L;\n\t}\n}\n\nQSQLiteResult QSQLiteDB::executeQuery( const QString &query, int *lastID )\n{\n\tQSQLiteResult res;\n\tif ( !m_db ) {\n\t\treturn res;\n\t}\n\n\tchar *errmsg = 0;\n#ifdef HAVE_SQLITE\n\n\tif ( sqlite_exec( m_db, query.toLatin1(), &call_back, &res, &errmsg ) > 0 )\n#elif HAVE_SQLITE3\n\n\tif ( sqlite3_exec( m_db, query.toLatin1(), &call_back, &res, &errmsg ) > 0 )\n#endif\n\n\t{\n\t\tkDebug() << \"SQLite error: \" << errmsg << endl <<\n\t\t\"\\t (Query: \" << query << \")\" ;\n\t\tres.setError( QString(errmsg) );\n\t\tres.setStatus( QSQLiteResult::Failure );\n\n#ifdef HAVE_SQLITE\n\t\tfree( errmsg );\n#elif HAVE_SQLITE3\n\t\tsqlite3_free( errmsg );\n#endif\n\t}\n\tif ( lastID ) {\n#ifdef HAVE_SQLITE\n\t\t* lastID = sqlite_last_insert_rowid( m_db );\n#elif HAVE_SQLITE3\n\n\t\t*lastID = sqlite3_last_insert_rowid( m_db );\n#endif\n\n\t}\n\tres.setStatus( QSQLiteResult::Success );\n\treturn res;\n}\n\nint QSQLiteDB::call_back( void* result, int argc, char** argv, char** columns )\n{\n\tQSQLiteResult * res = ( QSQLiteResult* ) result;\n\n\tQMap<QString, QByteArray> tableString;\n\tQMap<int, QByteArray> tableInt;\n\n\tfor ( int i = 0; i < argc; i++ ) {\n\t\ttableInt.insert( i, argv[ i ] );\n\t\ttableString.insert( columns[ i ],\n\t\t argv[ i ] );\n\t}\n\n\tQSQLiteResultRow row( tableString, tableInt );\n\tres->addRow( row );\n\n\treturn 0;\n}\n\n#ifdef HAVE_SQLITE\nvoid QSQLiteDB::lastInsertID(sqlite_func *context,int argc,const char**)\n{\n\tQ_ASSERT( argc==0 );\n\n\tvoid *db = sqlite_user_data(context);\n\tsqlite_set_result_int(context, sqlite_last_insert_rowid( (sqlite*)db ) );\n}\n#elif HAVE_SQLITE3\nvoid QSQLiteDB::lastInsertID( sqlite3_context *context, int argc, sqlite3_value ** )\n{\n\tQ_ASSERT( argc==0 );\n\n\tvoid *db = sqlite3_user_data(context);\n\tsqlite3_result_int(context, sqlite3_last_insert_rowid( (sqlite3*)db ) );\n}\n#endif\n\n<commit_msg>We should use sqlite_freemsg instead of calling free directly.<commit_after>\/***************************************************************************\n* *\n* Copyright (C) 2003 *\n* by Unai Garro (ugarro@users.sourceforge.net) *\n* Martin Imobersteg <imm@gmx.ch> *\n* and opie project *\n* *\n* *\n* This code was originally developed by the opie project, on which *\n* Martin Imobersteg based his work. *\n* This file is adds a small extension, necessary to perform some minimum *\n* SQL actions *\n* *\n* (this project is different from that in qsqlite.sf.net) *\n* This program is free software; you can redistribute it and\/or modify *\n* it under the terms of the GNU General Public License as published by *\n* the Free Software Foundation; either version 2 of the License, or *\n* (at your option) any later version. *\n***************************************************************************\/\n\n\n#include \"krecqsqlitedb.h\"\n#include \"krecqsqliteresult.h\"\n\n#include <q3valuelist.h>\n\/\/Added by qt3to4:\n#include <QByteArray>\n\n#include <kdebug.h>\n\n#include \"config-krecipes.h\"\n#ifdef HAVE_SQLITE\n#include <sqlite.h>\n#include <cstdlib>\n#elif HAVE_SQLITE3\n#include <sqlite3.h>\n#endif\n\nQSQLiteDB::QSQLiteDB( QObject *, const char * )\n{}\n\nbool QSQLiteDB::open( const QString &dbname )\n{\n#ifdef HAVE_SQLITE\n\tchar * errmsg = 0;\n\tif ( (m_db = sqlite_open( dbname.toLatin1(), 0, &errmsg )) == 0L ) {\n\t\tfree( errmsg );\n\t\treturn false;\n\t}\n#elif HAVE_SQLITE3\n\tif ( sqlite3_open( dbname.toLatin1(), &m_db ) != SQLITE_OK )\n\t\treturn false;\n#endif\n\n\tint func_res;\n\t#ifdef HAVE_SQLITE\n\tfunc_res = sqlite_create_function(m_db,\"lastInsertID\",0,&lastInsertID,m_db );\n\t#elif HAVE_SQLITE3\n\tfunc_res = sqlite3_create_function(m_db,\"lastInsertID\",0,SQLITE_ANY,m_db,\n\t &lastInsertID, 0, 0 );\n\t#endif\n\n\treturn func_res == 0;\n}\n\nvoid QSQLiteDB::close()\n{\n\tif ( m_db ) {\n#ifdef HAVE_SQLITE\n\t\tsqlite_close( m_db );\n#elif HAVE_SQLITE3\n\n\t\tsqlite3_close( m_db );\n#endif\n\n\t\tm_db = 0L;\n\t}\n}\n\nQSQLiteResult QSQLiteDB::executeQuery( const QString &query, int *lastID )\n{\n\tQSQLiteResult res;\n\tif ( !m_db ) {\n\t\treturn res;\n\t}\n\n\tchar *errmsg = 0;\n#ifdef HAVE_SQLITE\n\n\tif ( sqlite_exec( m_db, query.toLatin1(), &call_back, &res, &errmsg ) > 0 )\n#elif HAVE_SQLITE3\n\n\tif ( sqlite3_exec( m_db, query.toLatin1(), &call_back, &res, &errmsg ) > 0 )\n#endif\n\n\t{\n\t\tkDebug() << \"SQLite error: \" << errmsg << endl <<\n\t\t\"\\t (Query: \" << query << \")\" ;\n\t\tres.setError( QString(errmsg) );\n\t\tres.setStatus( QSQLiteResult::Failure );\n\n#ifdef HAVE_SQLITE\n\t\tsqlite_freemsg( errmsg );\n#elif HAVE_SQLITE3\n\t\tsqlite3_free( errmsg );\n#endif\n\t}\n\tif ( lastID ) {\n#ifdef HAVE_SQLITE\n\t\t* lastID = sqlite_last_insert_rowid( m_db );\n#elif HAVE_SQLITE3\n\n\t\t*lastID = sqlite3_last_insert_rowid( m_db );\n#endif\n\n\t}\n\tres.setStatus( QSQLiteResult::Success );\n\treturn res;\n}\n\nint QSQLiteDB::call_back( void* result, int argc, char** argv, char** columns )\n{\n\tQSQLiteResult * res = ( QSQLiteResult* ) result;\n\n\tQMap<QString, QByteArray> tableString;\n\tQMap<int, QByteArray> tableInt;\n\n\tfor ( int i = 0; i < argc; i++ ) {\n\t\ttableInt.insert( i, argv[ i ] );\n\t\ttableString.insert( columns[ i ],\n\t\t argv[ i ] );\n\t}\n\n\tQSQLiteResultRow row( tableString, tableInt );\n\tres->addRow( row );\n\n\treturn 0;\n}\n\n#ifdef HAVE_SQLITE\nvoid QSQLiteDB::lastInsertID(sqlite_func *context,int argc,const char**)\n{\n\tQ_ASSERT( argc==0 );\n\n\tvoid *db = sqlite_user_data(context);\n\tsqlite_set_result_int(context, sqlite_last_insert_rowid( (sqlite*)db ) );\n}\n#elif HAVE_SQLITE3\nvoid QSQLiteDB::lastInsertID( sqlite3_context *context, int argc, sqlite3_value ** )\n{\n\tQ_ASSERT( argc==0 );\n\n\tvoid *db = sqlite3_user_data(context);\n\tsqlite3_result_int(context, sqlite3_last_insert_rowid( (sqlite3*)db ) );\n}\n#endif\n\n<|endoftext|>"} {"text":"<commit_before>\/*\n * The Apache Software License, Version 1.1\n *\n * Copyright (c) 2001 The Apache Software Foundation. All rights\n * reserved.\n *\n * Redistribution and use in source and binary forms, with or without\n * modification, are permitted provided that the following conditions\n * are met:\n *\n * 1. Redistributions of source code must retain the above copyright\n * notice, this list of conditions and the following disclaimer.\n *\n * 2. Redistributions in binary form must reproduce the above copyright\n * notice, this list of conditions and the following disclaimer in\n * the documentation and\/or other materials provided with the\n * distribution.\n *\n * 3. The end-user documentation included with the redistribution,\n * if any, must include the following acknowledgment:\n * \"This product includes software developed by the\n * Apache Software Foundation (http:\/\/www.apache.org\/).\"\n * Alternately, this acknowledgment may appear in the software itself,\n * if and wherever such third-party acknowledgments normally appear.\n *\n * 4. The names \"Xerces\" and \"Apache Software Foundation\" must\n * not be used to endorse or promote products derived from this\n * software without prior written permission. For written\n * permission, please contact apache\\@apache.org.\n *\n * 5. Products derived from this software may not be called \"Apache\",\n * nor may \"Apache\" appear in their name, without prior written\n * permission of the Apache Software Foundation.\n *\n * THIS SOFTWARE IS PROVIDED ``AS IS'' AND ANY EXPRESSED OR IMPLIED\n * WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES\n * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE\n * DISCLAIMED. IN NO EVENT SHALL THE APACHE SOFTWARE FOUNDATION OR\n * ITS CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,\n * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT\n * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF\n * USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND\n * ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,\n * OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT\n * OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF\n * SUCH DAMAGE.\n * ====================================================================\n *\n * This software consists of voluntary contributions made by many\n * individuals on behalf of the Apache Software Foundation, and was\n * originally based on software copyright (c) 2001, International\n * Business Machines, Inc., http:\/\/www.ibm.com . For more information\n * on the Apache Software Foundation, please see\n * <http:\/\/www.apache.org\/>.\n *\/\n\n\/*\n * $Id$\n *\/\n\n#if !defined(COMPLEXTYPEINFO_HPP)\n#define COMPLEXTYPEINFO_HPP\n\n\n\/**\n * The class act as a place holder to store complex type information.\n *\n * The class is intended for internal use.\n *\/\n\n\/\/ ---------------------------------------------------------------------------\n\/\/ Includes\n\/\/ ---------------------------------------------------------------------------\n#include <util\/XMLString.hpp>\n#include <util\/RefHash2KeysTableOf.hpp>\n#include <framework\/XMLElementDecl.hpp>\n#include <validators\/schema\/SchemaAttDef.hpp>\n\n\n\/\/ ---------------------------------------------------------------------------\n\/\/ Forward Declarations\n\/\/ ---------------------------------------------------------------------------\nclass DatatypeValidator;\nclass ContentSpecNode;\nclass SchemaAttDefList;\n\n\nclass VALIDATORS_EXPORT ComplexTypeInfo\n{\npublic:\n \/\/ -----------------------------------------------------------------------\n \/\/ Public Constructors\/Destructor\n \/\/ -----------------------------------------------------------------------\n ComplexTypeInfo();\n\t~ComplexTypeInfo();\n\n\t\/\/ -----------------------------------------------------------------------\n \/\/ Getter methods\n \/\/ -----------------------------------------------------------------------\n bool getAbstract() const;\n bool getAdoptContentSpec() const;\n int getDerivedBy() const;\n int getBlockSet() const;\n int getFinalSet() const;\n int getScopeDefined() const;\n unsigned int getElementId() const;\n\tint getContentType() const;\n XMLCh* getTypeName() const;\n DatatypeValidator* getBaseDatatypeValidator() const;\n DatatypeValidator* getDatatypeValidator() const;\n ComplexTypeInfo* getBaseComplexTypeInfo() const;\n ContentSpecNode* getContentSpec() const;\n const SchemaAttDef* getAttDef(const XMLCh* const baseName,\n const int uriId) const;\n SchemaAttDef* getAttDef(const XMLCh* const baseName,\n const int uriId);\n XMLAttDefList& getAttDefList() const;\n\n\t\/\/ -----------------------------------------------------------------------\n \/\/ Setter methods\n \/\/ -----------------------------------------------------------------------\n void setAbstract(const bool isAbstract);\n void setAdoptContentSpec(const bool toAdopt);\n void setDerivedBy(const int derivedBy);\n void setBlockSet(const int blockSet);\n void setFinalSet(const int finalSet);\n void setScopeDefined(const int scopeDefined);\n void setElementId(const unsigned int elemId);\n void setTypeName(const XMLCh* const typeName);\n void setContentType(const int contentType);\n void setBaseDatatypeValidator(DatatypeValidator* const baseValidator);\n void setDatatypeValidator(DatatypeValidator* const validator);\n void setBaseComplexTypeInfo(ComplexTypeInfo* const typeInfo);\n void setContentSpec(ContentSpecNode* const toAdopt);\n void addAttDef(SchemaAttDef* const toAdd);\n\n\t\/\/ -----------------------------------------------------------------------\n \/\/ Helper methods\n \/\/ -----------------------------------------------------------------------\n bool hasAttDefs() const;\n bool contains(const XMLCh* const attName);\n XMLAttDef* findAttr\n (\n const XMLCh* const qName\n , const unsigned int uriId\n , const XMLCh* const baseName\n , const XMLCh* const prefix\n , const XMLElementDecl::LookupOpts options\n , bool& wasAdded\n ) const;\n bool resetDefs();\n\n\nprivate:\n \/\/ -----------------------------------------------------------------------\n \/\/ Unimplemented contstructors and operators\n \/\/ -----------------------------------------------------------------------\n ComplexTypeInfo(const ComplexTypeInfo& elemInfo);\n ComplexTypeInfo& operator= (const ComplexTypeInfo& other);\n\n \/\/ -----------------------------------------------------------------------\n \/\/ Private helper methods\n \/\/ -----------------------------------------------------------------------\n void faultInAttDefList() const;\n\n\n \/\/ -----------------------------------------------------------------------\n \/\/ Private data members\n \/\/ -----------------------------------------------------------------------\n bool fAbstract;\n bool fAdoptContentSpec;\n int fDerivedBy;\n int fBlockSet;\n int fFinalSet;\n int fScopeDefined;\n unsigned int fElementId;\n\tint fContentType;\n XMLCh* fTypeName;\n DatatypeValidator* fBaseDatatypeValidator;\n DatatypeValidator* fDatatypeValidator;\n ComplexTypeInfo* fBaseComplexTypeInfo;\n ContentSpecNode* fContentSpec;\n RefHash2KeysTableOf<SchemaAttDef>* fAttDefs;\n SchemaAttDefList* fAttList;\n};\n\n\/\/ ---------------------------------------------------------------------------\n\/\/ ComplexTypeInfo: Getter methods\n\/\/ ---------------------------------------------------------------------------\ninline bool ComplexTypeInfo::getAbstract() const {\n\n return fAbstract;\n}\n\ninline bool ComplexTypeInfo::getAdoptContentSpec() const {\n\n return fAdoptContentSpec;\n}\n\ninline int ComplexTypeInfo::getDerivedBy() const {\n\n return fDerivedBy;\n}\n\ninline int ComplexTypeInfo::getBlockSet() const {\n\n return fBlockSet;\n}\n\ninline int ComplexTypeInfo::getFinalSet() const {\n\n return fFinalSet;\n}\n\ninline int ComplexTypeInfo::getScopeDefined() const {\n\n return fScopeDefined;\n}\n\ninline unsigned int ComplexTypeInfo::getElementId() const {\n\n return fElementId;\n}\n\ninline int ComplexTypeInfo::getContentType() const {\n\n return fContentType;\n}\n\ninline XMLCh* ComplexTypeInfo::getTypeName() const {\n\n return fTypeName;\n}\n\ninline DatatypeValidator* ComplexTypeInfo::getBaseDatatypeValidator() const {\n\n return fBaseDatatypeValidator;\n}\n\ninline DatatypeValidator* ComplexTypeInfo::getDatatypeValidator() const {\n\n return fDatatypeValidator;\n}\n\ninline ComplexTypeInfo* ComplexTypeInfo::getBaseComplexTypeInfo() const {\n\n return fBaseComplexTypeInfo;\n}\n\ninline ContentSpecNode* ComplexTypeInfo::getContentSpec() const {\n\n return fContentSpec;\n}\n\ninline const SchemaAttDef* ComplexTypeInfo::getAttDef(const XMLCh* const baseName,\n const int uriId) const {\n\n \/\/ If no list, then return a null\n if (!fAttDefs)\n return 0;\n\n return fAttDefs->get(baseName, uriId);\n}\n\ninline SchemaAttDef* ComplexTypeInfo::getAttDef(const XMLCh* const baseName,\n const int uriId)\n{\n \/\/ If no list, then return a null\n if (!fAttDefs)\n return 0;\n\n return fAttDefs->get(baseName, uriId);\n}\n\n\/\/ ---------------------------------------------------------------------------\n\/\/ ComplexTypeInfo: Setter methods\n\/\/ ---------------------------------------------------------------------------\ninline void ComplexTypeInfo::setAbstract(const bool isAbstract) {\n\n fAbstract = isAbstract;\n}\n\ninline void ComplexTypeInfo::setAdoptContentSpec(const bool toAdopt) {\n\n fAdoptContentSpec = toAdopt;\n}\n\ninline void ComplexTypeInfo::setDerivedBy(const int derivedBy) {\n\n fDerivedBy = derivedBy;\n}\n\ninline void ComplexTypeInfo::setBlockSet(const int blockSet) {\n\n fBlockSet = blockSet;\n}\n\ninline void ComplexTypeInfo::setFinalSet(const int finalSet) {\n\n fFinalSet = finalSet;\n}\n\ninline void ComplexTypeInfo::setScopeDefined(const int scopeDefined) {\n\n fScopeDefined = scopeDefined;\n}\n\ninline void ComplexTypeInfo::setElementId(const unsigned int elemId) {\n\n fElementId = elemId;\n}\n\ninline void\nComplexTypeInfo::setContentType(const int contentType) {\n\n fContentType = contentType;\n}\n\ninline void ComplexTypeInfo::setTypeName(const XMLCh* const typeName) {\n\n if (fTypeName != 0) {\n delete [] fTypeName;\n }\n\n fTypeName = XMLString::replicate(typeName);\n}\n\ninline void\nComplexTypeInfo::setBaseDatatypeValidator(DatatypeValidator* const validator) {\n\n fBaseDatatypeValidator = validator;\n}\n\ninline void\nComplexTypeInfo::setDatatypeValidator(DatatypeValidator* const validator) {\n\n fDatatypeValidator = validator;\n}\n\ninline void\nComplexTypeInfo::setBaseComplexTypeInfo(ComplexTypeInfo* const typeInfo) {\n\n fBaseComplexTypeInfo = typeInfo;\n}\n\n\/\/ ---------------------------------------------------------------------------\n\/\/ ComplexTypeInfo: Helper methods\n\/\/ ---------------------------------------------------------------------------\ninline bool ComplexTypeInfo::hasAttDefs() const\n{\n \/\/ If the collection hasn't been faulted in, then no att defs\n if (!fAttDefs)\n return false;\n\n return !fAttDefs->isEmpty();\n}\n\ninline bool ComplexTypeInfo::contains(const XMLCh* const attName) {\n\n RefHash2KeysTableOfEnumerator<SchemaAttDef> enumDefs(fAttDefs);\n\n while (enumDefs.hasMoreElements()) {\n\n if (XMLString::compareString(attName,\n enumDefs.nextElement().getAttName()->getLocalPart()) == 0) {\n return true;\n }\n }\n\n return false;\n}\n\n#endif\n\n\/**\n * End of file ComplexTypeInfo.hpp\n *\/\n\n<commit_msg>add check for nillable attribure list.<commit_after>\/*\n * The Apache Software License, Version 1.1\n *\n * Copyright (c) 2001 The Apache Software Foundation. All rights\n * reserved.\n *\n * Redistribution and use in source and binary forms, with or without\n * modification, are permitted provided that the following conditions\n * are met:\n *\n * 1. Redistributions of source code must retain the above copyright\n * notice, this list of conditions and the following disclaimer.\n *\n * 2. Redistributions in binary form must reproduce the above copyright\n * notice, this list of conditions and the following disclaimer in\n * the documentation and\/or other materials provided with the\n * distribution.\n *\n * 3. The end-user documentation included with the redistribution,\n * if any, must include the following acknowledgment:\n * \"This product includes software developed by the\n * Apache Software Foundation (http:\/\/www.apache.org\/).\"\n * Alternately, this acknowledgment may appear in the software itself,\n * if and wherever such third-party acknowledgments normally appear.\n *\n * 4. The names \"Xerces\" and \"Apache Software Foundation\" must\n * not be used to endorse or promote products derived from this\n * software without prior written permission. For written\n * permission, please contact apache\\@apache.org.\n *\n * 5. Products derived from this software may not be called \"Apache\",\n * nor may \"Apache\" appear in their name, without prior written\n * permission of the Apache Software Foundation.\n *\n * THIS SOFTWARE IS PROVIDED ``AS IS'' AND ANY EXPRESSED OR IMPLIED\n * WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES\n * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE\n * DISCLAIMED. IN NO EVENT SHALL THE APACHE SOFTWARE FOUNDATION OR\n * ITS CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,\n * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT\n * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF\n * USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND\n * ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,\n * OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT\n * OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF\n * SUCH DAMAGE.\n * ====================================================================\n *\n * This software consists of voluntary contributions made by many\n * individuals on behalf of the Apache Software Foundation, and was\n * originally based on software copyright (c) 2001, International\n * Business Machines, Inc., http:\/\/www.ibm.com . For more information\n * on the Apache Software Foundation, please see\n * <http:\/\/www.apache.org\/>.\n *\/\n\n\/*\n * $Id$\n *\/\n\n#if !defined(COMPLEXTYPEINFO_HPP)\n#define COMPLEXTYPEINFO_HPP\n\n\n\/**\n * The class act as a place holder to store complex type information.\n *\n * The class is intended for internal use.\n *\/\n\n\/\/ ---------------------------------------------------------------------------\n\/\/ Includes\n\/\/ ---------------------------------------------------------------------------\n#include <util\/XMLString.hpp>\n#include <util\/RefHash2KeysTableOf.hpp>\n#include <framework\/XMLElementDecl.hpp>\n#include <validators\/schema\/SchemaAttDef.hpp>\n\n\n\/\/ ---------------------------------------------------------------------------\n\/\/ Forward Declarations\n\/\/ ---------------------------------------------------------------------------\nclass DatatypeValidator;\nclass ContentSpecNode;\nclass SchemaAttDefList;\n\n\nclass VALIDATORS_EXPORT ComplexTypeInfo\n{\npublic:\n \/\/ -----------------------------------------------------------------------\n \/\/ Public Constructors\/Destructor\n \/\/ -----------------------------------------------------------------------\n ComplexTypeInfo();\n\t~ComplexTypeInfo();\n\n\t\/\/ -----------------------------------------------------------------------\n \/\/ Getter methods\n \/\/ -----------------------------------------------------------------------\n bool getAbstract() const;\n bool getAdoptContentSpec() const;\n int getDerivedBy() const;\n int getBlockSet() const;\n int getFinalSet() const;\n int getScopeDefined() const;\n unsigned int getElementId() const;\n\tint getContentType() const;\n XMLCh* getTypeName() const;\n DatatypeValidator* getBaseDatatypeValidator() const;\n DatatypeValidator* getDatatypeValidator() const;\n ComplexTypeInfo* getBaseComplexTypeInfo() const;\n ContentSpecNode* getContentSpec() const;\n const SchemaAttDef* getAttDef(const XMLCh* const baseName,\n const int uriId) const;\n SchemaAttDef* getAttDef(const XMLCh* const baseName,\n const int uriId);\n XMLAttDefList& getAttDefList() const;\n\n\t\/\/ -----------------------------------------------------------------------\n \/\/ Setter methods\n \/\/ -----------------------------------------------------------------------\n void setAbstract(const bool isAbstract);\n void setAdoptContentSpec(const bool toAdopt);\n void setDerivedBy(const int derivedBy);\n void setBlockSet(const int blockSet);\n void setFinalSet(const int finalSet);\n void setScopeDefined(const int scopeDefined);\n void setElementId(const unsigned int elemId);\n void setTypeName(const XMLCh* const typeName);\n void setContentType(const int contentType);\n void setBaseDatatypeValidator(DatatypeValidator* const baseValidator);\n void setDatatypeValidator(DatatypeValidator* const validator);\n void setBaseComplexTypeInfo(ComplexTypeInfo* const typeInfo);\n void setContentSpec(ContentSpecNode* const toAdopt);\n void addAttDef(SchemaAttDef* const toAdd);\n\n\t\/\/ -----------------------------------------------------------------------\n \/\/ Helper methods\n \/\/ -----------------------------------------------------------------------\n bool hasAttDefs() const;\n bool contains(const XMLCh* const attName);\n XMLAttDef* findAttr\n (\n const XMLCh* const qName\n , const unsigned int uriId\n , const XMLCh* const baseName\n , const XMLCh* const prefix\n , const XMLElementDecl::LookupOpts options\n , bool& wasAdded\n ) const;\n bool resetDefs();\n\n\nprivate:\n \/\/ -----------------------------------------------------------------------\n \/\/ Unimplemented contstructors and operators\n \/\/ -----------------------------------------------------------------------\n ComplexTypeInfo(const ComplexTypeInfo& elemInfo);\n ComplexTypeInfo& operator= (const ComplexTypeInfo& other);\n\n \/\/ -----------------------------------------------------------------------\n \/\/ Private helper methods\n \/\/ -----------------------------------------------------------------------\n void faultInAttDefList() const;\n\n\n \/\/ -----------------------------------------------------------------------\n \/\/ Private data members\n \/\/ -----------------------------------------------------------------------\n bool fAbstract;\n bool fAdoptContentSpec;\n int fDerivedBy;\n int fBlockSet;\n int fFinalSet;\n int fScopeDefined;\n unsigned int fElementId;\n\tint fContentType;\n XMLCh* fTypeName;\n DatatypeValidator* fBaseDatatypeValidator;\n DatatypeValidator* fDatatypeValidator;\n ComplexTypeInfo* fBaseComplexTypeInfo;\n ContentSpecNode* fContentSpec;\n RefHash2KeysTableOf<SchemaAttDef>* fAttDefs;\n SchemaAttDefList* fAttList;\n};\n\n\/\/ ---------------------------------------------------------------------------\n\/\/ ComplexTypeInfo: Getter methods\n\/\/ ---------------------------------------------------------------------------\ninline bool ComplexTypeInfo::getAbstract() const {\n\n return fAbstract;\n}\n\ninline bool ComplexTypeInfo::getAdoptContentSpec() const {\n\n return fAdoptContentSpec;\n}\n\ninline int ComplexTypeInfo::getDerivedBy() const {\n\n return fDerivedBy;\n}\n\ninline int ComplexTypeInfo::getBlockSet() const {\n\n return fBlockSet;\n}\n\ninline int ComplexTypeInfo::getFinalSet() const {\n\n return fFinalSet;\n}\n\ninline int ComplexTypeInfo::getScopeDefined() const {\n\n return fScopeDefined;\n}\n\ninline unsigned int ComplexTypeInfo::getElementId() const {\n\n return fElementId;\n}\n\ninline int ComplexTypeInfo::getContentType() const {\n\n return fContentType;\n}\n\ninline XMLCh* ComplexTypeInfo::getTypeName() const {\n\n return fTypeName;\n}\n\ninline DatatypeValidator* ComplexTypeInfo::getBaseDatatypeValidator() const {\n\n return fBaseDatatypeValidator;\n}\n\ninline DatatypeValidator* ComplexTypeInfo::getDatatypeValidator() const {\n\n return fDatatypeValidator;\n}\n\ninline ComplexTypeInfo* ComplexTypeInfo::getBaseComplexTypeInfo() const {\n\n return fBaseComplexTypeInfo;\n}\n\ninline ContentSpecNode* ComplexTypeInfo::getContentSpec() const {\n\n return fContentSpec;\n}\n\ninline const SchemaAttDef* ComplexTypeInfo::getAttDef(const XMLCh* const baseName,\n const int uriId) const {\n\n \/\/ If no list, then return a null\n if (!fAttDefs)\n return 0;\n\n return fAttDefs->get(baseName, uriId);\n}\n\ninline SchemaAttDef* ComplexTypeInfo::getAttDef(const XMLCh* const baseName,\n const int uriId)\n{\n \/\/ If no list, then return a null\n if (!fAttDefs)\n return 0;\n\n return fAttDefs->get(baseName, uriId);\n}\n\n\/\/ ---------------------------------------------------------------------------\n\/\/ ComplexTypeInfo: Setter methods\n\/\/ ---------------------------------------------------------------------------\ninline void ComplexTypeInfo::setAbstract(const bool isAbstract) {\n\n fAbstract = isAbstract;\n}\n\ninline void ComplexTypeInfo::setAdoptContentSpec(const bool toAdopt) {\n\n fAdoptContentSpec = toAdopt;\n}\n\ninline void ComplexTypeInfo::setDerivedBy(const int derivedBy) {\n\n fDerivedBy = derivedBy;\n}\n\ninline void ComplexTypeInfo::setBlockSet(const int blockSet) {\n\n fBlockSet = blockSet;\n}\n\ninline void ComplexTypeInfo::setFinalSet(const int finalSet) {\n\n fFinalSet = finalSet;\n}\n\ninline void ComplexTypeInfo::setScopeDefined(const int scopeDefined) {\n\n fScopeDefined = scopeDefined;\n}\n\ninline void ComplexTypeInfo::setElementId(const unsigned int elemId) {\n\n fElementId = elemId;\n}\n\ninline void\nComplexTypeInfo::setContentType(const int contentType) {\n\n fContentType = contentType;\n}\n\ninline void ComplexTypeInfo::setTypeName(const XMLCh* const typeName) {\n\n if (fTypeName != 0) {\n delete [] fTypeName;\n }\n\n fTypeName = XMLString::replicate(typeName);\n}\n\ninline void\nComplexTypeInfo::setBaseDatatypeValidator(DatatypeValidator* const validator) {\n\n fBaseDatatypeValidator = validator;\n}\n\ninline void\nComplexTypeInfo::setDatatypeValidator(DatatypeValidator* const validator) {\n\n fDatatypeValidator = validator;\n}\n\ninline void\nComplexTypeInfo::setBaseComplexTypeInfo(ComplexTypeInfo* const typeInfo) {\n\n fBaseComplexTypeInfo = typeInfo;\n}\n\n\/\/ ---------------------------------------------------------------------------\n\/\/ ComplexTypeInfo: Helper methods\n\/\/ ---------------------------------------------------------------------------\ninline bool ComplexTypeInfo::hasAttDefs() const\n{\n \/\/ If the collection hasn't been faulted in, then no att defs\n if (!fAttDefs)\n return false;\n\n return !fAttDefs->isEmpty();\n}\n\ninline bool ComplexTypeInfo::contains(const XMLCh* const attName) {\n\n if (!fAttDefs) {\n return false;\n }\n\n RefHash2KeysTableOfEnumerator<SchemaAttDef> enumDefs(fAttDefs);\n\n while (enumDefs.hasMoreElements()) {\n\n if (XMLString::compareString(attName,\n enumDefs.nextElement().getAttName()->getLocalPart()) == 0) {\n return true;\n }\n }\n\n return false;\n}\n\n#endif\n\n\/**\n * End of file ComplexTypeInfo.hpp\n *\/\n\n<|endoftext|>"} {"text":"<commit_before>\/\/ Copyright (c) 2010-2020, Lawrence Livermore National Security, LLC. Produced\n\/\/ at the Lawrence Livermore National Laboratory. All Rights reserved. See files\n\/\/ LICENSE and NOTICE for details. LLNL-CODE-806117.\n\/\/\n\/\/ This file is part of the MFEM library. For more information and source code\n\/\/ availability visit https:\/\/mfem.org.\n\/\/\n\/\/ MFEM is free software; you can redistribute it and\/or modify it under the\n\/\/ terms of the BSD-3 license. We welcome feedback and contributions, see file\n\/\/ CONTRIBUTING.md for details.\n#define CATCH_CONFIG_RUNNER\n#include \"catch.hpp\"\n#include \"mfem.hpp\"\n#include <fstream>\n#include <iostream>\n#include \"..\/..\/..\/fem\/libceed\/ceed.hpp\"\n\nusing namespace mfem;\n\nnamespace ceed_test\n{\n\ndouble coeff_function(const Vector &x)\n{\n return 1 + x[0]*x[0];\n}\n\nvoid test_assembly_level(Mesh &&mesh, int order, const CeedCoeff coeff_type,\n const int pb, const AssemblyLevel assembly)\n{\n mesh.EnsureNodes();\n int dim = mesh.Dimension();\n\n H1_FECollection fec(order, dim);\n FiniteElementSpace fespace(&mesh, &fec);\n\n BilinearForm k_test(&fespace);\n BilinearForm k_ref(&fespace);\n\n GridFunction gf(&fespace);\n FunctionCoefficient f_coeff(coeff_function);\n\n Coefficient *coeff = nullptr;\n switch (coeff_type)\n {\n case CeedCoeff::Const:\n coeff = new ConstantCoefficient(1.0);\n break;\n case CeedCoeff::Grid:\n gf.ProjectCoefficient(f_coeff);\n coeff = new GridFunctionCoefficient(&gf);\n break;\n case CeedCoeff::Quad:\n coeff = &f_coeff;\n break;\n default:\n mfem_error(\"Unexpected coefficient type.\");\n break;\n }\n\n if (pb==0) \/\/ Mass\n {\n k_ref.AddDomainIntegrator(new MassIntegrator(*coeff));\n k_test.AddDomainIntegrator(new MassIntegrator(*coeff));\n }\n else if (pb==2) \/\/ Diffusion\n {\n k_ref.AddDomainIntegrator(new DiffusionIntegrator(*coeff));\n k_test.AddDomainIntegrator(new DiffusionIntegrator(*coeff));\n }\n\n k_ref.Assemble();\n k_ref.Finalize();\n\n k_test.SetAssemblyLevel(assembly);\n k_test.Assemble();\n\n GridFunction x(&fespace), y_ref(&fespace), y_test(&fespace);\n\n x.Randomize(1);\n\n k_ref.Mult(x,y_ref);\n k_test.Mult(x,y_test);\n\n y_test -= y_ref;\n\n REQUIRE(y_test.Norml2() < 1.e-12);\n}\n\nTEST_CASE(\"CEED\", \"[CEED]\")\n{\n SECTION(\"Continuous Galerkin\")\n {\n SECTION(\"2D\")\n {\n for (CeedCoeff coeff_type : {CeedCoeff::Const,CeedCoeff::Grid,CeedCoeff::Quad})\n {\n for (AssemblyLevel assembly : {AssemblyLevel::PARTIAL})\n {\n for (int pb : {0, 2})\n {\n for (int order : {2, 3, 4})\n {\n test_assembly_level(Mesh(\"..\/..\/data\/inline-quad.mesh\", 1, 1),\n order, coeff_type, pb, assembly);\n \/\/ test_assembly_level(Mesh(\"..\/..\/data\/periodic-hexagon.mesh\", 1, 1),\n \/\/ order, coeff_type, pb, assembly);\n test_assembly_level(Mesh(\"..\/..\/data\/star-q3.mesh\", 1, 1),\n order, coeff_type, pb, assembly);\n }\n }\n }\n }\n }\n SECTION(\"3D\")\n {\n for (CeedCoeff coeff_type : {CeedCoeff::Const,CeedCoeff::Grid,CeedCoeff::Quad})\n {\n for (AssemblyLevel assembly : {AssemblyLevel::PARTIAL})\n {\n for (int pb : {0, 2})\n {\n int order = 2;\n test_assembly_level(Mesh(\"..\/..\/data\/inline-hex.mesh\", 1, 1),\n order, coeff_type, pb, assembly);\n test_assembly_level(Mesh(\"..\/..\/data\/fichera-q3.mesh\", 1, 1),\n order, coeff_type, pb, assembly);\n }\n }\n }\n }\n SECTION(\"AMR 2D\")\n {\n for (CeedCoeff coeff_type : {CeedCoeff::Const,CeedCoeff::Grid,CeedCoeff::Quad})\n {\n for (AssemblyLevel assembly : {AssemblyLevel::PARTIAL})\n {\n for (int pb : {0, 2})\n {\n for (int order : {2, 3, 4})\n {\n test_assembly_level(Mesh(\"..\/..\/data\/amr-quad.mesh\", 1, 1),\n order, coeff_type, 0, assembly);\n }\n }\n }\n }\n }\n SECTION(\"AMR 3D\")\n {\n for (CeedCoeff coeff_type : {CeedCoeff::Const,CeedCoeff::Grid,CeedCoeff::Quad})\n {\n for (AssemblyLevel assembly : {AssemblyLevel::PARTIAL})\n {\n for (int pb : {0, 2})\n {\n int order = 2;\n test_assembly_level(Mesh(\"..\/..\/data\/fichera-amr.mesh\", 1, 1),\n order, coeff_type, 0, assembly);\n }\n }\n }\n }\n }\n} \/\/ test case\n\n} \/\/ namespace ceed_test\n\nint main(int argc, char *argv[])\n{\n \/\/ There must be exactly one instance.\n Catch::Session session;\n\n const char *device_str = (argc == 1) ? \"ceed-cpu\" : argv[argc-1];\n\n \/\/ Apply provided command line arguments.\n int r = session.applyCommandLine((argc == 1) ? argc : argc - 1, argv);\n if (r != 0)\n {\n return r;\n }\n\n Device device(device_str);\n\n int result = session.run();\n\n return result;\n}\n<commit_msg>Change orders in test_ceed.<commit_after>\/\/ Copyright (c) 2010-2020, Lawrence Livermore National Security, LLC. Produced\n\/\/ at the Lawrence Livermore National Laboratory. All Rights reserved. See files\n\/\/ LICENSE and NOTICE for details. LLNL-CODE-806117.\n\/\/\n\/\/ This file is part of the MFEM library. For more information and source code\n\/\/ availability visit https:\/\/mfem.org.\n\/\/\n\/\/ MFEM is free software; you can redistribute it and\/or modify it under the\n\/\/ terms of the BSD-3 license. We welcome feedback and contributions, see file\n\/\/ CONTRIBUTING.md for details.\n#define CATCH_CONFIG_RUNNER\n#include \"catch.hpp\"\n#include \"mfem.hpp\"\n#include <fstream>\n#include <iostream>\n#include \"..\/..\/..\/fem\/libceed\/ceed.hpp\"\n\nusing namespace mfem;\n\nnamespace ceed_test\n{\n\ndouble coeff_function(const Vector &x)\n{\n return 1 + x[0]*x[0];\n}\n\nvoid test_assembly_level(Mesh &&mesh, int order, const CeedCoeff coeff_type,\n const int pb, const AssemblyLevel assembly)\n{\n mesh.EnsureNodes();\n int dim = mesh.Dimension();\n\n H1_FECollection fec(order, dim);\n FiniteElementSpace fespace(&mesh, &fec);\n\n BilinearForm k_test(&fespace);\n BilinearForm k_ref(&fespace);\n\n GridFunction gf(&fespace);\n FunctionCoefficient f_coeff(coeff_function);\n\n Coefficient *coeff = nullptr;\n switch (coeff_type)\n {\n case CeedCoeff::Const:\n coeff = new ConstantCoefficient(1.0);\n break;\n case CeedCoeff::Grid:\n gf.ProjectCoefficient(f_coeff);\n coeff = new GridFunctionCoefficient(&gf);\n break;\n case CeedCoeff::Quad:\n coeff = &f_coeff;\n break;\n default:\n mfem_error(\"Unexpected coefficient type.\");\n break;\n }\n\n if (pb==0) \/\/ Mass\n {\n k_ref.AddDomainIntegrator(new MassIntegrator(*coeff));\n k_test.AddDomainIntegrator(new MassIntegrator(*coeff));\n }\n else if (pb==2) \/\/ Diffusion\n {\n k_ref.AddDomainIntegrator(new DiffusionIntegrator(*coeff));\n k_test.AddDomainIntegrator(new DiffusionIntegrator(*coeff));\n }\n\n k_ref.Assemble();\n k_ref.Finalize();\n\n k_test.SetAssemblyLevel(assembly);\n k_test.Assemble();\n\n GridFunction x(&fespace), y_ref(&fespace), y_test(&fespace);\n\n x.Randomize(1);\n\n k_ref.Mult(x,y_ref);\n k_test.Mult(x,y_test);\n\n y_test -= y_ref;\n\n REQUIRE(y_test.Norml2() < 1.e-12);\n}\n\nTEST_CASE(\"CEED\", \"[CEED]\")\n{\n SECTION(\"Continuous Galerkin\")\n {\n SECTION(\"2D\")\n {\n for (CeedCoeff coeff_type : {CeedCoeff::Const,CeedCoeff::Grid,CeedCoeff::Quad})\n {\n for (AssemblyLevel assembly : {AssemblyLevel::PARTIAL})\n {\n for (int pb : {0, 2})\n {\n for (int order : {3, 4})\n {\n test_assembly_level(Mesh(\"..\/..\/data\/inline-quad.mesh\", 1, 1),\n order, coeff_type, pb, assembly);\n \/\/ test_assembly_level(Mesh(\"..\/..\/data\/periodic-hexagon.mesh\", 1, 1),\n \/\/ order, coeff_type, pb, assembly);\n test_assembly_level(Mesh(\"..\/..\/data\/star-q3.mesh\", 1, 1),\n order, coeff_type, pb, assembly);\n }\n }\n }\n }\n }\n SECTION(\"3D\")\n {\n for (CeedCoeff coeff_type : {CeedCoeff::Const,CeedCoeff::Grid,CeedCoeff::Quad})\n {\n for (AssemblyLevel assembly : {AssemblyLevel::PARTIAL})\n {\n for (int pb : {0, 2})\n {\n int order = 3;\n test_assembly_level(Mesh(\"..\/..\/data\/inline-hex.mesh\", 1, 1),\n order, coeff_type, pb, assembly);\n test_assembly_level(Mesh(\"..\/..\/data\/fichera-q3.mesh\", 1, 1),\n order, coeff_type, pb, assembly);\n }\n }\n }\n }\n SECTION(\"AMR 2D\")\n {\n for (CeedCoeff coeff_type : {CeedCoeff::Const,CeedCoeff::Grid,CeedCoeff::Quad})\n {\n for (AssemblyLevel assembly : {AssemblyLevel::PARTIAL})\n {\n for (int pb : {0, 2})\n {\n for (int order : {2, 3, 4})\n {\n test_assembly_level(Mesh(\"..\/..\/data\/amr-quad.mesh\", 1, 1),\n order, coeff_type, 0, assembly);\n }\n }\n }\n }\n }\n SECTION(\"AMR 3D\")\n {\n for (CeedCoeff coeff_type : {CeedCoeff::Const,CeedCoeff::Grid,CeedCoeff::Quad})\n {\n for (AssemblyLevel assembly : {AssemblyLevel::PARTIAL})\n {\n for (int pb : {0, 2})\n {\n int order = 2;\n test_assembly_level(Mesh(\"..\/..\/data\/fichera-amr.mesh\", 1, 1),\n order, coeff_type, 0, assembly);\n }\n }\n }\n }\n }\n} \/\/ test case\n\n} \/\/ namespace ceed_test\n\nint main(int argc, char *argv[])\n{\n \/\/ There must be exactly one instance.\n Catch::Session session;\n\n const char *device_str = (argc == 1) ? \"ceed-cpu\" : argv[argc-1];\n\n \/\/ Apply provided command line arguments.\n int r = session.applyCommandLine((argc == 1) ? argc : argc - 1, argv);\n if (r != 0)\n {\n return r;\n }\n\n Device device(device_str);\n\n int result = session.run();\n\n return result;\n}\n<|endoftext|>"} {"text":"<commit_before>#include \"imageinsertdialog.h\"\n\n#include <QGridLayout>\n#include <QVBoxLayout>\n#include <QUrl>\n#include <QRegularExpression>\n#include <QLabel>\n#include <QPushButton>\n#include <QRegExpValidator>\n#include <QSpinBox>\n#include <QSlider>\n#include <QScrollArea>\n#include <QFileInfo>\n#include <QDir>\n#include <QFileDialog>\n#include <QTimer>\n#include <QTemporaryFile>\n#include <QCheckBox>\n\n#include <vtextedit\/markdownutils.h>\n#include <vtextedit\/networkutils.h>\n\n#include <widgets\/widgetsfactory.h>\n#include <widgets\/lineedit.h>\n#include <utils\/fileutils.h>\n#include <utils\/pathutils.h>\n#include <core\/sessionconfig.h>\n#include <core\/configmgr.h>\n\nusing namespace vnotex;\n\nint ImageInsertDialog::s_lastScaleSliderValue = 10;\n\nint ImageInsertDialog::s_lastScaleWidth = -1;\n\nbool ImageInsertDialog::s_fixedScaleWidth = false;\n\nImageInsertDialog::ImageInsertDialog(const QString &p_title,\n const QString &p_imageTitle,\n const QString &p_imageAlt,\n const QString &p_imagePath,\n bool p_browserEnabled,\n QWidget *p_parent)\n : Dialog(p_parent),\n m_browserEnabled(p_browserEnabled)\n{\n m_imagePathCheckTimer = new QTimer(this);\n m_imagePathCheckTimer->setSingleShot(true);\n m_imagePathCheckTimer->setInterval(500);\n connect(m_imagePathCheckTimer, &QTimer::timeout,\n this, &ImageInsertDialog::checkImagePathInput);\n\n setupUI(p_title, p_imageTitle, p_imageAlt, p_imagePath);\n\n checkInput();\n}\n\nvoid ImageInsertDialog::setupUI(const QString &p_title,\n const QString &p_imageTitle,\n const QString &p_imageAlt,\n const QString &p_imagePath)\n{\n auto mainWidget = new QWidget(this);\n setCentralWidget(mainWidget);\n\n auto mainLayout = new QVBoxLayout(mainWidget);\n\n auto gridLayout = new QGridLayout();\n mainLayout->addLayout(gridLayout);\n\n mainLayout->addStretch();\n\n \/\/ Image Path.\n m_imagePathEdit = WidgetsFactory::createLineEdit(p_imagePath, mainWidget);\n m_imagePathEdit->setReadOnly(!m_browserEnabled);\n gridLayout->addWidget(new QLabel(tr(\"From:\"), mainWidget), 0, 0, 1, 1);\n gridLayout->addWidget(m_imagePathEdit, 0, 1, 1, 3);\n connect(m_imagePathEdit, &QLineEdit::textChanged,\n this, [this]() {\n m_imagePathCheckTimer->start();\n });\n\n m_browseBtn = new QPushButton(tr(\"&Browse\"), mainWidget);\n m_browseBtn->setEnabled(m_browserEnabled);\n gridLayout->addWidget(m_browseBtn, 0, 4, 1, 1);\n connect(m_browseBtn, &QPushButton::clicked,\n this, &ImageInsertDialog::browseFile);\n\n \/\/ Image Title.\n m_imageTitleEdit = WidgetsFactory::createLineEdit(p_imageTitle, mainWidget);\n auto titleValidator = new QRegExpValidator(QRegExp(vte::MarkdownUtils::c_imageTitleRegExp), m_imageTitleEdit);\n m_imageTitleEdit->setValidator(titleValidator);\n gridLayout->addWidget(new QLabel(tr(\"Title:\"), mainWidget), 1, 0, 1, 1);\n gridLayout->addWidget(m_imageTitleEdit, 1, 1, 1, 3);\n connect(m_imageTitleEdit, &QLineEdit::textChanged,\n this, &ImageInsertDialog::checkInput);\n\n \/\/ Image Alt.\n m_imageAltEdit = WidgetsFactory::createLineEdit(p_imageAlt, mainWidget);\n auto altValidator = new QRegExpValidator(QRegExp(vte::MarkdownUtils::c_imageAltRegExp), m_imageAltEdit);\n m_imageAltEdit->setValidator(altValidator);\n gridLayout->addWidget(new QLabel(tr(\"Alt text:\"), mainWidget), 2, 0, 1, 1);\n gridLayout->addWidget(m_imageAltEdit, 2, 1, 1, 3);\n\n \/\/ Scale.\n m_widthSpin = WidgetsFactory::createSpinBox(mainWidget);\n m_widthSpin->setMinimum(1);\n m_widthSpin->setSingleStep(10);\n m_widthSpin->setSuffix(\" px\");\n connect(m_widthSpin, static_cast<void(QSpinBox::*)(int)>(&QSpinBox::valueChanged),\n this, [this](int p_val) {\n if (m_image.isNull()) {\n return;\n }\n\n int height = m_image.height() * (1.0 * p_val \/ m_image.width());\n m_imageLabel->resize(p_val, height);\n\n s_lastScaleWidth = p_val;\n });\n \/\/ 0.1 to 2.0 -> 1 to 20.\n m_scaleSlider = new QSlider(mainWidget);\n m_scaleSlider->setOrientation(Qt::Horizontal);\n m_scaleSlider->setMinimum(1);\n m_scaleSlider->setMaximum(50);\n m_scaleSlider->setValue(s_lastScaleSliderValue);\n m_scaleSlider->setSingleStep(1);\n m_scaleSlider->setPageStep(5);\n connect(m_scaleSlider, &QSlider::valueChanged,\n this, &ImageInsertDialog::handleScaleSliderValueChanged);\n m_sliderLabel = new QLabel(\"1x\", mainWidget);\n gridLayout->addWidget(new QLabel(tr(\"Scaling width:\"), mainWidget), 3, 0, 1, 1);\n gridLayout->addWidget(m_widthSpin, 3, 1, 1, 1);\n gridLayout->addWidget(m_scaleSlider, 3, 2, 1, 2);\n gridLayout->addWidget(m_sliderLabel, 3, 4, 1, 1);\n\n {\n auto fixedWidthCheckBox = WidgetsFactory::createCheckBox(tr(\"Fixed scaling width\"), mainWidget);\n fixedWidthCheckBox->setChecked(s_fixedScaleWidth);\n connect(fixedWidthCheckBox, &QCheckBox::stateChanged,\n this, [](int p_state) {\n s_fixedScaleWidth = p_state == Qt::Checked;\n });\n gridLayout->addWidget(fixedWidthCheckBox, 4, 1, 1, 1);\n }\n\n \/\/ Preview area.\n m_imageLabel = new QLabel(mainWidget);\n m_imageLabel->setScaledContents(true);\n m_previewArea = new QScrollArea(mainWidget);\n m_previewArea->setBackgroundRole(QPalette::Dark);\n m_previewArea->setWidget(m_imageLabel);\n m_previewArea->setMinimumSize(256, 256);\n gridLayout->addWidget(m_previewArea, 5, 0, 1, 5);\n\n setImageControlsVisible(false);\n\n gridLayout->setColumnStretch(0, 0);\n gridLayout->setColumnStretch(1, 0);\n gridLayout->setColumnStretch(2, 1);\n gridLayout->setColumnStretch(3, 1);\n gridLayout->setColumnStretch(4, 0);\n\n setDialogButtonBox(QDialogButtonBox::Ok | QDialogButtonBox::Cancel);\n\n setWindowTitle(p_title);\n}\n\nvoid ImageInsertDialog::setImageControlsVisible(bool p_visible)\n{\n m_widthSpin->setEnabled(p_visible);\n m_scaleSlider->setEnabled(p_visible);\n m_sliderLabel->setEnabled(p_visible);\n\n m_previewArea->setVisible(p_visible);\n}\n\nvoid ImageInsertDialog::showEvent(QShowEvent *p_event)\n{\n Dialog::showEvent(p_event);\n\n m_imageTitleEdit->selectAll();\n m_imageTitleEdit->setFocus();\n}\n\nvoid ImageInsertDialog::checkImagePathInput()\n{\n const QString text = m_imagePathEdit->text();\n QUrl url = QUrl::fromUserInput(text);\n if (text.isEmpty() || !url.isValid()) {\n setImage(QImage());\n return;\n }\n\n if (url.isLocalFile()) {\n const auto localFile = url.toLocalFile();\n if (QFileInfo::exists(localFile)) {\n setImage(FileUtils::imageFromFile(localFile));\n } else {\n setImage(QImage());\n }\n\n m_source = Source::LocalFile;\n } else {\n setImage(QImage());\n m_source = Source::ImageData;\n\n if (!m_downloader) {\n m_downloader = new vte::NetworkAccess(this);\n connect(m_downloader, &vte::NetworkAccess::requestFinished,\n this, &ImageInsertDialog::handleImageDownloaded);\n }\n\n m_downloader->requestAsync(url);\n }\n\n m_imageTitleEdit->setText(QFileInfo(text).baseName());\n\n checkInput();\n}\n\nvoid ImageInsertDialog::checkInput()\n{\n setButtonEnabled(QDialogButtonBox::Ok, !m_image.isNull());\n}\n\nvoid ImageInsertDialog::browseFile()\n{\n auto &sessionConfig = ConfigMgr::getInst().getSessionConfig();\n QString filePath = QFileDialog::getOpenFileName(this,\n tr(\"Select Image To Insert\"),\n sessionConfig.getExternalMediaDefaultPath(),\n tr(\"Images (*.png *.xpm *.jpg *.bmp *.gif *.svg *.webp);;All (*.*)\"));\n if (filePath.isEmpty()) {\n return;\n }\n\n sessionConfig.setExternalMediaDefaultPath(filePath);\n\n m_source = Source::LocalFile;\n\n setImagePath(filePath);\n\n m_imageTitleEdit->selectAll();\n m_imageTitleEdit->setFocus();\n}\n\nQString ImageInsertDialog::getImageTitle() const\n{\n return m_imageTitleEdit->text();\n}\n\nQString ImageInsertDialog::getImageAltText() const\n{\n return m_imageAltEdit->text();\n}\n\nQString ImageInsertDialog::getImagePath() const\n{\n if (m_tempFile.isNull()) {\n return m_imagePathEdit->text();\n } else {\n return m_tempFile->fileName();\n }\n}\n\nImageInsertDialog::Source ImageInsertDialog::getImageSource() const\n{\n return m_source;\n}\n\nvoid ImageInsertDialog::setImageSource(ImageInsertDialog::Source p_source)\n{\n m_source = p_source;\n}\n\nconst QImage &ImageInsertDialog::getImage() const\n{\n return m_image;\n}\n\nvoid ImageInsertDialog::setImage(const QImage &p_image)\n{\n m_image = p_image;\n if (m_image.isNull()) {\n m_imageLabel->clear();\n setImageControlsVisible(false);\n } else {\n m_imageLabel->setPixmap(QPixmap::fromImage(m_image));\n\n m_imageLabel->adjustSize();\n\n m_widthSpin->setMaximum(m_image.width() * 5);\n\n if (s_fixedScaleWidth) {\n m_widthSpin->setValue(s_lastScaleWidth);\n } else {\n \/\/ Set the scaling widgets.\n if (m_scaleSlider->value() == s_lastScaleSliderValue) {\n \/\/ Trigger it manually.\n handleScaleSliderValueChanged(s_lastScaleSliderValue);\n } else {\n m_scaleSlider->setValue(s_lastScaleSliderValue);\n }\n }\n\n setImageControlsVisible(true);\n }\n\n checkInput();\n}\n\nvoid ImageInsertDialog::setImagePath(const QString &p_path)\n{\n m_tempFile.reset();\n m_imagePathEdit->setText(p_path);\n}\n\nint ImageInsertDialog::getScaledWidth() const\n{\n if (m_image.isNull()) {\n return 0;\n }\n\n int val = m_widthSpin->value();\n return val == m_image.width() ? 0 : val;\n}\n\nvoid ImageInsertDialog::handleImageDownloaded(const vte::NetworkReply &p_data, const QString &p_url)\n{\n setImage(QImage::fromData(p_data.m_data));\n\n \/\/ Save it to a temp file to avoid potential data loss via QImage.\n bool savedToFile = false;\n if (!p_data.m_data.isEmpty()) {\n auto format = QFileInfo(PathUtils::removeUrlParameters(p_url)).suffix();\n m_tempFile.reset(FileUtils::createTemporaryFile(format));\n if (m_tempFile->open()) {\n savedToFile = -1 != m_tempFile->write(p_data.m_data);\n m_tempFile->close();\n }\n }\n\n m_source = savedToFile ? Source::LocalFile : Source::ImageData;\n if (!savedToFile) {\n m_tempFile.reset();\n }\n}\n\nvoid ImageInsertDialog::handleScaleSliderValueChanged(int p_val)\n{\n if (m_image.isNull()) {\n return;\n }\n\n int width = m_image.width();\n qreal factor = 1.0;\n if (p_val != 10) {\n factor = p_val \/ 10.0;\n width = m_image.width() * factor;\n }\n\n m_widthSpin->setValue(width);\n m_sliderLabel->setText(QString::number(factor) + \"x\");\n\n s_lastScaleSliderValue = p_val;\n}\n<commit_msg>fix path<commit_after>#include \"imageinsertdialog.h\"\n\n#include <QGridLayout>\n#include <QVBoxLayout>\n#include <QUrl>\n#include <QRegularExpression>\n#include <QLabel>\n#include <QPushButton>\n#include <QRegExpValidator>\n#include <QSpinBox>\n#include <QSlider>\n#include <QScrollArea>\n#include <QFileInfo>\n#include <QDir>\n#include <QFileDialog>\n#include <QTimer>\n#include <QTemporaryFile>\n#include <QCheckBox>\n\n#include <vtextedit\/markdownutils.h>\n#include <vtextedit\/networkutils.h>\n\n#include <widgets\/widgetsfactory.h>\n#include <widgets\/lineedit.h>\n#include <utils\/fileutils.h>\n#include <utils\/pathutils.h>\n#include <core\/sessionconfig.h>\n#include <core\/configmgr.h>\n\nusing namespace vnotex;\n\nint ImageInsertDialog::s_lastScaleSliderValue = 10;\n\nint ImageInsertDialog::s_lastScaleWidth = -1;\n\nbool ImageInsertDialog::s_fixedScaleWidth = false;\n\nImageInsertDialog::ImageInsertDialog(const QString &p_title,\n const QString &p_imageTitle,\n const QString &p_imageAlt,\n const QString &p_imagePath,\n bool p_browserEnabled,\n QWidget *p_parent)\n : Dialog(p_parent),\n m_browserEnabled(p_browserEnabled)\n{\n m_imagePathCheckTimer = new QTimer(this);\n m_imagePathCheckTimer->setSingleShot(true);\n m_imagePathCheckTimer->setInterval(500);\n connect(m_imagePathCheckTimer, &QTimer::timeout,\n this, &ImageInsertDialog::checkImagePathInput);\n\n setupUI(p_title, p_imageTitle, p_imageAlt, p_imagePath);\n\n checkInput();\n}\n\nvoid ImageInsertDialog::setupUI(const QString &p_title,\n const QString &p_imageTitle,\n const QString &p_imageAlt,\n const QString &p_imagePath)\n{\n auto mainWidget = new QWidget(this);\n setCentralWidget(mainWidget);\n\n auto mainLayout = new QVBoxLayout(mainWidget);\n\n auto gridLayout = new QGridLayout();\n mainLayout->addLayout(gridLayout);\n\n mainLayout->addStretch();\n\n \/\/ Image Path.\n m_imagePathEdit = WidgetsFactory::createLineEdit(p_imagePath, mainWidget);\n m_imagePathEdit->setReadOnly(!m_browserEnabled);\n gridLayout->addWidget(new QLabel(tr(\"From:\"), mainWidget), 0, 0, 1, 1);\n gridLayout->addWidget(m_imagePathEdit, 0, 1, 1, 3);\n connect(m_imagePathEdit, &QLineEdit::textChanged,\n this, [this]() {\n m_imagePathCheckTimer->start();\n });\n\n m_browseBtn = new QPushButton(tr(\"&Browse\"), mainWidget);\n m_browseBtn->setEnabled(m_browserEnabled);\n gridLayout->addWidget(m_browseBtn, 0, 4, 1, 1);\n connect(m_browseBtn, &QPushButton::clicked,\n this, &ImageInsertDialog::browseFile);\n\n \/\/ Image Title.\n m_imageTitleEdit = WidgetsFactory::createLineEdit(p_imageTitle, mainWidget);\n auto titleValidator = new QRegExpValidator(QRegExp(vte::MarkdownUtils::c_imageTitleRegExp), m_imageTitleEdit);\n m_imageTitleEdit->setValidator(titleValidator);\n gridLayout->addWidget(new QLabel(tr(\"Title:\"), mainWidget), 1, 0, 1, 1);\n gridLayout->addWidget(m_imageTitleEdit, 1, 1, 1, 3);\n connect(m_imageTitleEdit, &QLineEdit::textChanged,\n this, &ImageInsertDialog::checkInput);\n\n \/\/ Image Alt.\n m_imageAltEdit = WidgetsFactory::createLineEdit(p_imageAlt, mainWidget);\n auto altValidator = new QRegExpValidator(QRegExp(vte::MarkdownUtils::c_imageAltRegExp), m_imageAltEdit);\n m_imageAltEdit->setValidator(altValidator);\n gridLayout->addWidget(new QLabel(tr(\"Alt text:\"), mainWidget), 2, 0, 1, 1);\n gridLayout->addWidget(m_imageAltEdit, 2, 1, 1, 3);\n\n \/\/ Scale.\n m_widthSpin = WidgetsFactory::createSpinBox(mainWidget);\n m_widthSpin->setMinimum(1);\n m_widthSpin->setSingleStep(10);\n m_widthSpin->setSuffix(\" px\");\n connect(m_widthSpin, static_cast<void(QSpinBox::*)(int)>(&QSpinBox::valueChanged),\n this, [this](int p_val) {\n if (m_image.isNull()) {\n return;\n }\n\n int height = m_image.height() * (1.0 * p_val \/ m_image.width());\n m_imageLabel->resize(p_val, height);\n\n s_lastScaleWidth = p_val;\n });\n \/\/ 0.1 to 2.0 -> 1 to 20.\n m_scaleSlider = new QSlider(mainWidget);\n m_scaleSlider->setOrientation(Qt::Horizontal);\n m_scaleSlider->setMinimum(1);\n m_scaleSlider->setMaximum(50);\n m_scaleSlider->setValue(s_lastScaleSliderValue);\n m_scaleSlider->setSingleStep(1);\n m_scaleSlider->setPageStep(5);\n connect(m_scaleSlider, &QSlider::valueChanged,\n this, &ImageInsertDialog::handleScaleSliderValueChanged);\n m_sliderLabel = new QLabel(\"1x\", mainWidget);\n gridLayout->addWidget(new QLabel(tr(\"Scaling width:\"), mainWidget), 3, 0, 1, 1);\n gridLayout->addWidget(m_widthSpin, 3, 1, 1, 1);\n gridLayout->addWidget(m_scaleSlider, 3, 2, 1, 2);\n gridLayout->addWidget(m_sliderLabel, 3, 4, 1, 1);\n\n {\n auto fixedWidthCheckBox = WidgetsFactory::createCheckBox(tr(\"Fixed scaling width\"), mainWidget);\n fixedWidthCheckBox->setChecked(s_fixedScaleWidth);\n connect(fixedWidthCheckBox, &QCheckBox::stateChanged,\n this, [](int p_state) {\n s_fixedScaleWidth = p_state == Qt::Checked;\n });\n gridLayout->addWidget(fixedWidthCheckBox, 4, 1, 1, 1);\n }\n\n \/\/ Preview area.\n m_imageLabel = new QLabel(mainWidget);\n m_imageLabel->setScaledContents(true);\n m_previewArea = new QScrollArea(mainWidget);\n m_previewArea->setBackgroundRole(QPalette::Dark);\n m_previewArea->setWidget(m_imageLabel);\n m_previewArea->setMinimumSize(256, 256);\n gridLayout->addWidget(m_previewArea, 5, 0, 1, 5);\n\n setImageControlsVisible(false);\n\n gridLayout->setColumnStretch(0, 0);\n gridLayout->setColumnStretch(1, 0);\n gridLayout->setColumnStretch(2, 1);\n gridLayout->setColumnStretch(3, 1);\n gridLayout->setColumnStretch(4, 0);\n\n setDialogButtonBox(QDialogButtonBox::Ok | QDialogButtonBox::Cancel);\n\n setWindowTitle(p_title);\n}\n\nvoid ImageInsertDialog::setImageControlsVisible(bool p_visible)\n{\n m_widthSpin->setEnabled(p_visible);\n m_scaleSlider->setEnabled(p_visible);\n m_sliderLabel->setEnabled(p_visible);\n\n m_previewArea->setVisible(p_visible);\n}\n\nvoid ImageInsertDialog::showEvent(QShowEvent *p_event)\n{\n Dialog::showEvent(p_event);\n\n m_imageTitleEdit->selectAll();\n m_imageTitleEdit->setFocus();\n}\n\nvoid ImageInsertDialog::checkImagePathInput()\n{\n const QString text = m_imagePathEdit->text();\n QUrl url = QUrl::fromUserInput(text);\n if (text.isEmpty() || !url.isValid()) {\n setImage(QImage());\n return;\n }\n\n if (url.isLocalFile()) {\n const auto localFile = url.toLocalFile();\n if (QFileInfo::exists(localFile)) {\n setImage(FileUtils::imageFromFile(localFile));\n } else {\n setImage(QImage());\n }\n\n m_source = Source::LocalFile;\n } else {\n setImage(QImage());\n m_source = Source::ImageData;\n\n if (!m_downloader) {\n m_downloader = new vte::NetworkAccess(this);\n connect(m_downloader, &vte::NetworkAccess::requestFinished,\n this, &ImageInsertDialog::handleImageDownloaded);\n }\n\n m_downloader->requestAsync(url);\n }\n\n m_imageTitleEdit->setText(QFileInfo(text).baseName());\n\n checkInput();\n}\n\nvoid ImageInsertDialog::checkInput()\n{\n setButtonEnabled(QDialogButtonBox::Ok, !m_image.isNull());\n}\n\nvoid ImageInsertDialog::browseFile()\n{\n auto &sessionConfig = ConfigMgr::getInst().getSessionConfig();\n QString filePath = QFileDialog::getOpenFileName(this,\n tr(\"Select Image To Insert\"),\n sessionConfig.getExternalMediaDefaultPath(),\n tr(\"Images (*.png *.xpm *.jpg *.bmp *.gif *.svg *.webp);;All (*.*)\"));\n if (filePath.isEmpty()) {\n return;\n }\n\n sessionConfig.setExternalMediaDefaultPath(PathUtils::parentDirPath(filePath));\n\n m_source = Source::LocalFile;\n\n setImagePath(filePath);\n\n m_imageTitleEdit->selectAll();\n m_imageTitleEdit->setFocus();\n}\n\nQString ImageInsertDialog::getImageTitle() const\n{\n return m_imageTitleEdit->text();\n}\n\nQString ImageInsertDialog::getImageAltText() const\n{\n return m_imageAltEdit->text();\n}\n\nQString ImageInsertDialog::getImagePath() const\n{\n if (m_tempFile.isNull()) {\n return m_imagePathEdit->text();\n } else {\n return m_tempFile->fileName();\n }\n}\n\nImageInsertDialog::Source ImageInsertDialog::getImageSource() const\n{\n return m_source;\n}\n\nvoid ImageInsertDialog::setImageSource(ImageInsertDialog::Source p_source)\n{\n m_source = p_source;\n}\n\nconst QImage &ImageInsertDialog::getImage() const\n{\n return m_image;\n}\n\nvoid ImageInsertDialog::setImage(const QImage &p_image)\n{\n m_image = p_image;\n if (m_image.isNull()) {\n m_imageLabel->clear();\n setImageControlsVisible(false);\n } else {\n m_imageLabel->setPixmap(QPixmap::fromImage(m_image));\n\n m_imageLabel->adjustSize();\n\n m_widthSpin->setMaximum(m_image.width() * 5);\n\n if (s_fixedScaleWidth) {\n m_widthSpin->setValue(s_lastScaleWidth);\n } else {\n \/\/ Set the scaling widgets.\n if (m_scaleSlider->value() == s_lastScaleSliderValue) {\n \/\/ Trigger it manually.\n handleScaleSliderValueChanged(s_lastScaleSliderValue);\n } else {\n m_scaleSlider->setValue(s_lastScaleSliderValue);\n }\n }\n\n setImageControlsVisible(true);\n }\n\n checkInput();\n}\n\nvoid ImageInsertDialog::setImagePath(const QString &p_path)\n{\n m_tempFile.reset();\n m_imagePathEdit->setText(p_path);\n}\n\nint ImageInsertDialog::getScaledWidth() const\n{\n if (m_image.isNull()) {\n return 0;\n }\n\n int val = m_widthSpin->value();\n return val == m_image.width() ? 0 : val;\n}\n\nvoid ImageInsertDialog::handleImageDownloaded(const vte::NetworkReply &p_data, const QString &p_url)\n{\n setImage(QImage::fromData(p_data.m_data));\n\n \/\/ Save it to a temp file to avoid potential data loss via QImage.\n bool savedToFile = false;\n if (!p_data.m_data.isEmpty()) {\n auto format = QFileInfo(PathUtils::removeUrlParameters(p_url)).suffix();\n m_tempFile.reset(FileUtils::createTemporaryFile(format));\n if (m_tempFile->open()) {\n savedToFile = -1 != m_tempFile->write(p_data.m_data);\n m_tempFile->close();\n }\n }\n\n m_source = savedToFile ? Source::LocalFile : Source::ImageData;\n if (!savedToFile) {\n m_tempFile.reset();\n }\n}\n\nvoid ImageInsertDialog::handleScaleSliderValueChanged(int p_val)\n{\n if (m_image.isNull()) {\n return;\n }\n\n int width = m_image.width();\n qreal factor = 1.0;\n if (p_val != 10) {\n factor = p_val \/ 10.0;\n width = m_image.width() * factor;\n }\n\n m_widthSpin->setValue(width);\n m_sliderLabel->setText(QString::number(factor) + \"x\");\n\n s_lastScaleSliderValue = p_val;\n}\n<|endoftext|>"} {"text":"<commit_before>\/\/ For conditions of distribution and use, see copyright notice in license.txt\n\n#include \"StableHeaders.h\"\n#include \"DebugOperatorNew.h\"\n\n#include \"WorldMapWidget.h\"\n#include \"ImageItem.h\"\n#include <QGraphicsScene>\n\n#include \"MemoryLeakCheck.h\"\n\nnamespace WorldMap\n{\n WorldMapWidget::WorldMapWidget() : \n update_timer_(new QTimer(this)), \n brush_(Qt::white),\n sim_name_(QString(\"\"))\n {\n setupUi(this);\n }\n \n WorldMapWidget::~WorldMapWidget()\n {\n if (avatar_items_.size() > 0)\n {\n for (QMap<QString, WorldMap::ImageItem *>::iterator iter = avatar_items_.begin(); iter!=avatar_items_.end(); ++iter)\n {\n SAFE_DELETE(iter.value());\n }\n }\n }\n\n void WorldMapWidget::SetMyAvatarId(QString avatar_id)\n {\n my_avatar_id_ = avatar_id;\n }\n\n void WorldMapWidget::StartUpdateTimer()\n { \n update_timer_->setSingleShot(false);\n update_timer_->start(1000);\n connect(update_timer_, SIGNAL(timeout()), SLOT(UpdateAvatarPosition()));\n\n }\n\n void WorldMapWidget::StopUpdateTimer()\n {\n }\n\n void WorldMapWidget::SetSimName(QString simName)\n {\n sim_name_ = simName;\n DrawMap();\n }\n\n void WorldMapWidget::RemoveAvatar(QString avatar_id)\n {\n if (!avatar_id.isEmpty())\n {\n ImageItem *item = 0;\n if (avatar_items_.contains(avatar_id))\n {\n item = avatar_items_.value(avatar_id);\n if (item)\n SAFE_DELETE(item);\n\n avatar_items_.remove(avatar_id);\n }\n\n if (avatar_names_.contains(avatar_id))\n {\n avatar_names_.remove(avatar_id);\n }\n }\n }\n \n void WorldMapWidget::StoreMapData(QPixmap &image, QString map_id)\n { \n if (!region_images_.contains(map_id))\n {\n region_images_.insert(map_id, image);\n DrawMap();\n }\n }\n\n \n void WorldMapWidget::DrawMap()\n {\n \n \/\/Try to draw current region map.\n if (sim_name_.isEmpty())\n return;\n\n if (region_images_.size() == 0)\n return;\n\n QGraphicsScene *scene = worldMapGraphicsView->scene();\n if (!scene)\n scene = new QGraphicsScene(this);\n\n if (map_blocks_.size() == 0)\n return;\n\n ProtocolUtilities::MapBlock *currentBlock;\n\n foreach (ProtocolUtilities::MapBlock block, map_blocks_)\n { \n if (sim_name_ == QString(block.regionName.c_str()))\n {\n currentBlock = █\n break;\n }\n }\n\n if (currentBlock)\n {\n if (region_images_.size() > 0)\n {\n for (QMap<QString, QPixmap>::iterator iter = region_images_.begin(); iter!=region_images_.end(); ++iter)\n {\n if (iter.key() == currentBlock->mapImageID.ToQString())\n {\n scene->addPixmap(iter.value());\n\n QGraphicsScene *graphicsViewScene = worldMapGraphicsView->scene();\n if (!graphicsViewScene)\n graphicsViewScene = new QGraphicsScene(this);\n\n QGraphicsTextItem *item = new QGraphicsTextItem(0, scene);\n item->font().setPixelSize(6);\n item->setHtml(currentBlock->regionName.c_str());\n graphicsViewScene->addItem(item);\n\n worldMapGraphicsView->setScene(scene);\n worldMapGraphicsView->update();\n\n break;\n }\n }\n }\n }\n\n }\n\n\n void WorldMapWidget::UpdateAvatarPosition(Vector3df position, QString avatar_id, QString avatar_name)\n {\n QGraphicsScene *scene = worldMapGraphicsView->scene();\n if (!scene)\n scene = new QGraphicsScene(this);\n \n ImageItem *item = 0;\n if (avatar_items_.contains(avatar_id))\n {\n item = avatar_items_.value(avatar_id);\n }\n else\n {\n item = new ImageItem(QPixmap(\".\/data\/ui\/images\/worldmap\/default_avatar.png\"), 0, scene);\n if (!my_avatar_id_.isEmpty() && my_avatar_id_ == avatar_id)\n {\n item->SetMyAvatar(true); \n }\n\n item->SetAvatarName(avatar_name); \n scene->addItem(item); \n avatar_items_.insert(avatar_id, item); \/\/Add to items \n }\n\n if (!avatar_names_.contains(avatar_id))\n avatar_names_.insert(avatar_id, avatar_name); \/\/Add to names\n \n item->setPos(position.x, position.y);\n item->SetTextPosition(position.x, position.y);\n item->UpdateTextPosition();\n item->setOffset(-10, -10);\n item->show();\n scene->update();\n\n }\n\n}\n\n<commit_msg>Worldmap graphics item display fixes.<commit_after>\/\/ For conditions of distribution and use, see copyright notice in license.txt\n\n#include \"StableHeaders.h\"\n#include \"DebugOperatorNew.h\"\n\n#include \"WorldMapWidget.h\"\n#include \"ImageItem.h\"\n#include <QGraphicsScene>\n\n#include \"MemoryLeakCheck.h\"\n\nnamespace WorldMap\n{\n WorldMapWidget::WorldMapWidget() : \n update_timer_(new QTimer(this)), \n brush_(Qt::white),\n sim_name_(QString(\"\"))\n {\n setupUi(this);\n }\n \n WorldMapWidget::~WorldMapWidget()\n {\n if (avatar_items_.size() > 0)\n {\n for (QMap<QString, WorldMap::ImageItem *>::iterator iter = avatar_items_.begin(); iter!=avatar_items_.end(); ++iter)\n {\n SAFE_DELETE(iter.value());\n }\n }\n }\n\n void WorldMapWidget::SetMyAvatarId(QString avatar_id)\n {\n my_avatar_id_ = avatar_id;\n }\n\n void WorldMapWidget::StartUpdateTimer()\n { \n update_timer_->setSingleShot(false);\n update_timer_->start(1000);\n connect(update_timer_, SIGNAL(timeout()), SLOT(UpdateAvatarPosition()));\n\n }\n\n void WorldMapWidget::StopUpdateTimer()\n {\n }\n\n void WorldMapWidget::SetSimName(QString simName)\n {\n sim_name_ = simName;\n DrawMap();\n }\n\n void WorldMapWidget::RemoveAvatar(QString avatar_id)\n {\n if (!avatar_id.isEmpty())\n {\n ImageItem *item = 0;\n if (avatar_items_.contains(avatar_id))\n {\n item = avatar_items_.value(avatar_id);\n if (item)\n SAFE_DELETE(item);\n\n avatar_items_.remove(avatar_id);\n }\n\n if (avatar_names_.contains(avatar_id))\n {\n avatar_names_.remove(avatar_id);\n }\n }\n }\n \n void WorldMapWidget::StoreMapData(QPixmap &image, QString map_id)\n { \n if (!region_images_.contains(map_id))\n {\n region_images_.insert(map_id, image);\n DrawMap();\n }\n }\n\n \n void WorldMapWidget::DrawMap()\n {\n \n \/\/Try to draw current region map.\n if (sim_name_.isEmpty())\n return;\n\n if (region_images_.size() == 0)\n return;\n\n QGraphicsScene *scene = worldMapGraphicsView->scene();\n if (!scene)\n scene = new QGraphicsScene(this);\n\n if (map_blocks_.size() == 0)\n return;\n\n ProtocolUtilities::MapBlock *currentBlock;\n\n foreach (ProtocolUtilities::MapBlock block, map_blocks_)\n { \n if (sim_name_ == QString(block.regionName.c_str()))\n {\n currentBlock = █\n break;\n }\n }\n\n if (currentBlock)\n {\n if (region_images_.size() > 0)\n {\n for (QMap<QString, QPixmap>::iterator iter = region_images_.begin(); iter!=region_images_.end(); ++iter)\n {\n if (iter.key() == currentBlock->mapImageID.ToQString())\n {\n scene->addPixmap(iter.value());\n worldMapGraphicsView->setScene(scene);\n\n QGraphicsTextItem *item = new QGraphicsTextItem(0, scene); \n item->setHtml(sim_name_); \n scene->addItem(item);\n item->show();\n\n worldMapGraphicsView->update();\n scene->update();\n\n break;\n }\n }\n }\n }\n\n }\n\n\n void WorldMapWidget::UpdateAvatarPosition(Vector3df position, QString avatar_id, QString avatar_name)\n {\n QGraphicsScene *scene = worldMapGraphicsView->scene();\n if (!scene)\n scene = new QGraphicsScene(this);\n \n worldMapGraphicsView->setScene(scene);\n\n ImageItem *item = 0;\n if (avatar_items_.contains(avatar_id))\n {\n item = avatar_items_.value(avatar_id);\n }\n else\n {\n item = new ImageItem(QPixmap(\".\/data\/ui\/images\/worldmap\/default_avatar.png\"), 0, scene);\n if (!my_avatar_id_.isEmpty() && my_avatar_id_ == avatar_id)\n {\n item->SetMyAvatar(true); \n }\n\n item->SetAvatarName(avatar_name); \n scene->addItem(item);\n avatar_items_.insert(avatar_id, item); \/\/Add to items \n }\n\n if (!avatar_names_.contains(avatar_id))\n avatar_names_.insert(avatar_id, avatar_name); \/\/Add to names\n \n if (!scene->items().contains(item))\n scene->addItem(item);\n\n item->setPos(position.x, position.y);\n item->SetTextPosition(position.x, position.y);\n item->UpdateTextPosition();\n item->setOffset(-10, -10);\n item->show();\n scene->update();\n\n }\n\n}\n\n<|endoftext|>"} {"text":"<commit_before>\/*\n * The Apache Software License, Version 1.1\n *\n * Copyright (c) 2003 The Apache Software Foundation. All rights\n * reserved.\n *\n * Redistribution and use in source and binary forms, with or without\n * modification, are permitted provided that the following conditions\n * are met:\n *\n * 1. Redistributions of source code must retain the above copyright\n * notice, this list of conditions and the following disclaimer.\n *\n * 2. Redistributions in binary form must reproduce the above copyright\n * notice, this list of conditions and the following disclaimer in\n * the documentation and\/or other materials provided with the\n * distribution.\n *\n * 3. The end-user documentation included with the redistribution,\n * if any, must include the following acknowledgment:\n * \"This product includes software developed by the\n * Apache Software Foundation (http:\/\/www.apache.org\/).\"\n * Alternately, this acknowledgment may appear in the software itself,\n * if and wherever such third-party acknowledgments normally appear.\n *\n * 4. The names \"Xerces\" and \"Apache Software Foundation\" must\n * not be used to endorse or promote products derived from this\n * software without prior written permission. For written\n * permission, please contact apache\\@apache.org.\n *\n * 5. Products derived from this software may not be called \"Apache\",\n * nor may \"Apache\" appear in their name, without prior written\n * permission of the Apache Software Foundation.\n *\n * THIS SOFTWARE IS PROVIDED ``AS IS'' AND ANY EXPRESSED OR IMPLIED\n * WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES\n * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE\n * DISCLAIMED. IN NO EVENT SHALL THE APACHE SOFTWARE FOUNDATION OR\n * ITS CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,\n * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT\n * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF\n * USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND\n * ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,\n * OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT\n * OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF\n * SUCH DAMAGE.\n * ====================================================================\n *\n * This software consists of voluntary contributions made by many\n * individuals on behalf of the Apache Software Foundation, and was\n * originally based on software copyright (c) 1999, International\n * Business Machines, Inc., http:\/\/www.ibm.com . For more information\n * on the Apache Software Foundation, please see\n * <http:\/\/www.apache.org\/>.\n *\/\n\n\/*\n * $Log$\n * Revision 1.1 2003\/09\/18 18:29:58 peiyongz\n * Interface: Binary Output Stream\n *\n * $Id$\n *\n *\/\n\n#if !defined(BIN_OUTPUT_STREAM_HPP)\n#define BIN_OUTPUT_STREAM_HPP\n\n#include <xercesc\/util\/XMemory.hpp>\n\nXERCES_CPP_NAMESPACE_BEGIN\n\nclass XMLUTIL_EXPORT BinOutputStream : public XMemory\n{\npublic :\n \/\/ -----------------------------------------------------------------------\n \/\/ Virtual destructor for derived classes\n \/\/ -----------------------------------------------------------------------\n virtual ~BinOutputStream();\n\n \/\/ -----------------------------------------------------------------------\n \/\/ The virtual input stream interface\n \/\/ -----------------------------------------------------------------------\n virtual unsigned int curPos() const = 0;\n\n virtual void writeBytes\n (\n XMLByte* const toGo\n , const unsigned int maxToWrite\n ) = 0;\n\nprotected :\n \/\/ -----------------------------------------------------------------------\n \/\/ Hidden Constructors\n \/\/ -----------------------------------------------------------------------\n BinOutputStream();\n\n\nprivate :\n \/\/ -----------------------------------------------------------------------\n \/\/ Unimplemented Constructors\n \/\/ -----------------------------------------------------------------------\n BinOutputStream(const BinOutputStream&);\n BinOutputStream& operator=(const BinOutputStream&);\n};\n\nXERCES_CPP_NAMESPACE_END\n\n#endif\n<commit_msg>typo fixed<commit_after>\/*\n * The Apache Software License, Version 1.1\n *\n * Copyright (c) 2003 The Apache Software Foundation. All rights\n * reserved.\n *\n * Redistribution and use in source and binary forms, with or without\n * modification, are permitted provided that the following conditions\n * are met:\n *\n * 1. Redistributions of source code must retain the above copyright\n * notice, this list of conditions and the following disclaimer.\n *\n * 2. Redistributions in binary form must reproduce the above copyright\n * notice, this list of conditions and the following disclaimer in\n * the documentation and\/or other materials provided with the\n * distribution.\n *\n * 3. The end-user documentation included with the redistribution,\n * if any, must include the following acknowledgment:\n * \"This product includes software developed by the\n * Apache Software Foundation (http:\/\/www.apache.org\/).\"\n * Alternately, this acknowledgment may appear in the software itself,\n * if and wherever such third-party acknowledgments normally appear.\n *\n * 4. The names \"Xerces\" and \"Apache Software Foundation\" must\n * not be used to endorse or promote products derived from this\n * software without prior written permission. For written\n * permission, please contact apache\\@apache.org.\n *\n * 5. Products derived from this software may not be called \"Apache\",\n * nor may \"Apache\" appear in their name, without prior written\n * permission of the Apache Software Foundation.\n *\n * THIS SOFTWARE IS PROVIDED ``AS IS'' AND ANY EXPRESSED OR IMPLIED\n * WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES\n * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE\n * DISCLAIMED. IN NO EVENT SHALL THE APACHE SOFTWARE FOUNDATION OR\n * ITS CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,\n * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT\n * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF\n * USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND\n * ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,\n * OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT\n * OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF\n * SUCH DAMAGE.\n * ====================================================================\n *\n * This software consists of voluntary contributions made by many\n * individuals on behalf of the Apache Software Foundation, and was\n * originally based on software copyright (c) 1999, International\n * Business Machines, Inc., http:\/\/www.ibm.com . For more information\n * on the Apache Software Foundation, please see\n * <http:\/\/www.apache.org\/>.\n *\/\n\n\/*\n * $Log$\n * Revision 1.2 2003\/12\/16 17:17:25 peiyongz\n * typo fixed\n *\n * Revision 1.1 2003\/09\/18 18:29:58 peiyongz\n * Interface: Binary Output Stream\n *\n * $Id$\n *\n *\/\n\n#if !defined(BIN_OUTPUT_STREAM_HPP)\n#define BIN_OUTPUT_STREAM_HPP\n\n#include <xercesc\/util\/XMemory.hpp>\n\nXERCES_CPP_NAMESPACE_BEGIN\n\nclass XMLUTIL_EXPORT BinOutputStream : public XMemory\n{\npublic :\n \/\/ -----------------------------------------------------------------------\n \/\/ Virtual destructor for derived classes\n \/\/ -----------------------------------------------------------------------\n virtual ~BinOutputStream();\n\n \/\/ -----------------------------------------------------------------------\n \/\/ The virtual output stream interface\n \/\/ -----------------------------------------------------------------------\n virtual unsigned int curPos() const = 0;\n\n virtual void writeBytes\n (\n XMLByte* const toGo\n , const unsigned int maxToWrite\n ) = 0;\n\nprotected :\n \/\/ -----------------------------------------------------------------------\n \/\/ Hidden Constructors\n \/\/ -----------------------------------------------------------------------\n BinOutputStream();\n\n\nprivate :\n \/\/ -----------------------------------------------------------------------\n \/\/ Unimplemented Constructors\n \/\/ -----------------------------------------------------------------------\n BinOutputStream(const BinOutputStream&);\n BinOutputStream& operator=(const BinOutputStream&);\n};\n\nXERCES_CPP_NAMESPACE_END\n\n#endif\n<|endoftext|>"} {"text":"<commit_before>\/\/---------------------------------------------------------------------------\/\/\n\/\/!\n\/\/! \\file tstParticleBank.cpp\n\/\/! \\author Alex Robinson\n\/\/! \\brief Particle bank unit test\n\/\/!\n\/\/---------------------------------------------------------------------------\/\/\n\n\/\/ Std Lib Includes\n#include <iostream>\n\n\/\/ Trilinos Includes\n#include <Teuchos_UnitTestHarness.hpp>\n#include <Teuchos_VerboseObject.hpp>\n\n\/\/ FRENSIE Includes\n#include \"MonteCarlo_ParticleBank.hpp\"\n#include \"MonteCarlo_NeutronState.hpp\"\n#include \"MonteCarlo_PhotonState.hpp\"\n#include \"MonteCarlo_ElectronState.hpp\"\n#include \"Utility_GlobalOpenMPSession.hpp\"\n\n\/\/---------------------------------------------------------------------------\/\/\n\/\/ Tests.\n\/\/---------------------------------------------------------------------------\/\/\n\/\/ Check that particles can be pushed to the particle bank\nTEUCHOS_UNIT_TEST( ParticleBank, push )\n{\n#pragma omp parallel num_threads( Utility::GlobalOpenMPSession::getRequestedNumberOfThreads() )\n {\n MonteCarlo::ParticleBank bank;\n \n TEST_ASSERT( bank.empty() );\n \n unsigned history_number = Teuchos::GlobalMPISession::getRank()*\n Utility::GlobalOpenMPSession::getRequestedNumberOfThreads() +\n Utility::GlobalOpenMPSession::getThreadId();\n \n MonteCarlo::ParticleState::pointerType particle;\n \n particle.reset( new MonteCarlo::PhotonState( history_number ) );\n \n bank.push( particle );\n \n #pragma omp critical( test_update )\n {\n std::cout << bank.top()->getHistoryNumber() << std::endl;\n \n TEST_ASSERT( !bank.empty() );\n TEST_EQUALITY_CONST( bank.size(), 1 );\n }\n \n particle.reset( new MonteCarlo::NeutronState( history_number ) );\n \n bank.push( particle, MonteCarlo::N__N_ELASTIC_REACTION );\n \n #pragma omp critical( test_update )\n {\n std::cout << particle->getHistoryNumber() << std::endl;\n \n TEST_ASSERT( !bank.empty() );\n TEST_EQUALITY_CONST( bank.size(), 2 );\n }\ncd \n particle.reset( new MonteCarlo::ElectronState( history_number ) );\n \n bank.push( particle );\n \n #pragma omp critical( test_update )\n {\n std::cout << particle->getHistoryNumber() << std::endl;\n \n TEST_ASSERT( !bank.empty() );\n TEST_EQUALITY_CONST( bank.size(), 3 );\n }\n \n #pragma omp barrier\n }\n}\n\n\/\/---------------------------------------------------------------------------\/\/\n\/\/ Check that that the top element of the bank can be accessed\nTEUCHOS_UNIT_TEST( ParticleBank, top )\n{\n MonteCarlo::ParticleBank bank;\n \n MonteCarlo::ParticleState::pointerType particle( \n\t\t\t\t\t new MonteCarlo::PhotonState( 0ull ) );\n \n bank.push( particle );\n\n TEST_EQUALITY( particle, bank.top() );\n\n const MonteCarlo::ParticleBank& const_bank = bank;\n \n TEST_EQUALITY( particle, const_bank.top() );\n}\n\n\/\/---------------------------------------------------------------------------\/\/\n\/\/ Check that particles can be removed from the bank\nTEUCHOS_UNIT_TEST( ParticleBank, pop )\n{\n MonteCarlo::ParticleBank bank;\n \n MonteCarlo::ParticleState::pointerType particle( \n\t\t\t\t\t new MonteCarlo::PhotonState( 0ull ) );\n \n bank.push( particle );\n\n TEST_ASSERT( !bank.empty() );\n\n bank.pop();\n \n TEST_ASSERT( bank.empty() );\n}\n\n\/\/---------------------------------------------------------------------------\/\/\n\/\/ Custom main function\n\/\/---------------------------------------------------------------------------\/\/\nint main( int argc, char** argv )\n{\n Teuchos::CommandLineProcessor& clp = Teuchos::UnitTestRepository::getCLP();\n \n int threads = 1;\n \n clp.setOption( \"threads\",\n\t\t &threads,\n\t\t \"Number of threads to use\" );\n \n Teuchos::CommandLineProcessor::EParseCommandLineReturn parse_return = \n clp.parse(argc,argv);\n\n const Teuchos::RCP<Teuchos::FancyOStream> out = Teuchos::VerboseObjectBase::getDefaultOStream();\n\n if ( parse_return != Teuchos::CommandLineProcessor::PARSE_SUCCESSFUL ) {\n *out << \"\\nEnd Result: TEST FAILED\" << std::endl;\n return parse_return;\n }\n\n \/\/ Set up the global OpenMP session\n if( Utility::GlobalOpenMPSession::isOpenMPUsed() )\n Utility::GlobalOpenMPSession::setNumberOfThreads( threads );\n \n \/\/ Run the unit tests\n Teuchos::GlobalMPISession mpiSession( &argc, &argv );\n\n out->setProcRankAndSize( mpiSession.getRank(), mpiSession.getNProc() );\n out->setOutputToRootOnly( 0 );\n\n const bool success = Teuchos::UnitTestRepository::runUnitTests(*out);\n\n if (success)\n *out << \"\\nEnd Result: TEST PASSED\" << std::endl;\n else\n *out << \"\\nEnd Result: TEST FAILED\" << std::endl;\n\n clp.printFinalTimerSummary(out.ptr());\n\n return (success ? 0 : 1);\n}\n\n\/\/---------------------------------------------------------------------------\/\/\n\/\/ end tstParticleBank.cpp\n\/\/---------------------------------------------------------------------------\/\/\n<commit_msg>fixed small typo<commit_after>\/\/---------------------------------------------------------------------------\/\/\n\/\/!\n\/\/! \\file tstParticleBank.cpp\n\/\/! \\author Alex Robinson\n\/\/! \\brief Particle bank unit test\n\/\/!\n\/\/---------------------------------------------------------------------------\/\/\n\n\/\/ Std Lib Includes\n#include <iostream>\n\n\/\/ Trilinos Includes\n#include <Teuchos_UnitTestHarness.hpp>\n#include <Teuchos_VerboseObject.hpp>\n\n\/\/ FRENSIE Includes\n#include \"MonteCarlo_ParticleBank.hpp\"\n#include \"MonteCarlo_NeutronState.hpp\"\n#include \"MonteCarlo_PhotonState.hpp\"\n#include \"MonteCarlo_ElectronState.hpp\"\n#include \"Utility_GlobalOpenMPSession.hpp\"\n\n\/\/---------------------------------------------------------------------------\/\/\n\/\/ Tests.\n\/\/---------------------------------------------------------------------------\/\/\n\/\/ Check that particles can be pushed to the particle bank\nTEUCHOS_UNIT_TEST( ParticleBank, push )\n{\n#pragma omp parallel num_threads( Utility::GlobalOpenMPSession::getRequestedNumberOfThreads() )\n {\n MonteCarlo::ParticleBank bank;\n \n TEST_ASSERT( bank.empty() );\n \n unsigned history_number = Teuchos::GlobalMPISession::getRank()*\n Utility::GlobalOpenMPSession::getRequestedNumberOfThreads() +\n Utility::GlobalOpenMPSession::getThreadId();\n \n MonteCarlo::ParticleState::pointerType particle;\n \n particle.reset( new MonteCarlo::PhotonState( history_number ) );\n \n bank.push( particle );\n \n #pragma omp critical( test_update )\n {\n std::cout << bank.top()->getHistoryNumber() << std::endl;\n \n TEST_ASSERT( !bank.empty() );\n TEST_EQUALITY_CONST( bank.size(), 1 );\n }\n \n particle.reset( new MonteCarlo::NeutronState( history_number ) );\n \n bank.push( particle, MonteCarlo::N__N_ELASTIC_REACTION );\n \n #pragma omp critical( test_update )\n {\n std::cout << particle->getHistoryNumber() << std::endl;\n \n TEST_ASSERT( !bank.empty() );\n TEST_EQUALITY_CONST( bank.size(), 2 );\n }\n \n particle.reset( new MonteCarlo::ElectronState( history_number ) );\n \n bank.push( particle );\n \n #pragma omp critical( test_update )\n {\n std::cout << particle->getHistoryNumber() << std::endl;\n \n TEST_ASSERT( !bank.empty() );\n TEST_EQUALITY_CONST( bank.size(), 3 );\n }\n \n #pragma omp barrier\n }\n}\n\n\/\/---------------------------------------------------------------------------\/\/\n\/\/ Check that that the top element of the bank can be accessed\nTEUCHOS_UNIT_TEST( ParticleBank, top )\n{\n MonteCarlo::ParticleBank bank;\n \n MonteCarlo::ParticleState::pointerType particle( \n\t\t\t\t\t new MonteCarlo::PhotonState( 0ull ) );\n \n bank.push( particle );\n\n TEST_EQUALITY( particle, bank.top() );\n\n const MonteCarlo::ParticleBank& const_bank = bank;\n \n TEST_EQUALITY( particle, const_bank.top() );\n}\n\n\/\/---------------------------------------------------------------------------\/\/\n\/\/ Check that particles can be removed from the bank\nTEUCHOS_UNIT_TEST( ParticleBank, pop )\n{\n MonteCarlo::ParticleBank bank;\n \n MonteCarlo::ParticleState::pointerType particle( \n\t\t\t\t\t new MonteCarlo::PhotonState( 0ull ) );\n \n bank.push( particle );\n\n TEST_ASSERT( !bank.empty() );\n\n bank.pop();\n \n TEST_ASSERT( bank.empty() );\n}\n\n\/\/---------------------------------------------------------------------------\/\/\n\/\/ Custom main function\n\/\/---------------------------------------------------------------------------\/\/\nint main( int argc, char** argv )\n{\n Teuchos::CommandLineProcessor& clp = Teuchos::UnitTestRepository::getCLP();\n \n int threads = 1;\n \n clp.setOption( \"threads\",\n\t\t &threads,\n\t\t \"Number of threads to use\" );\n \n Teuchos::CommandLineProcessor::EParseCommandLineReturn parse_return = \n clp.parse(argc,argv);\n\n const Teuchos::RCP<Teuchos::FancyOStream> out = Teuchos::VerboseObjectBase::getDefaultOStream();\n\n if ( parse_return != Teuchos::CommandLineProcessor::PARSE_SUCCESSFUL ) {\n *out << \"\\nEnd Result: TEST FAILED\" << std::endl;\n return parse_return;\n }\n\n \/\/ Set up the global OpenMP session\n if( Utility::GlobalOpenMPSession::isOpenMPUsed() )\n Utility::GlobalOpenMPSession::setNumberOfThreads( threads );\n \n \/\/ Run the unit tests\n Teuchos::GlobalMPISession mpiSession( &argc, &argv );\n\n out->setProcRankAndSize( mpiSession.getRank(), mpiSession.getNProc() );\n out->setOutputToRootOnly( 0 );\n\n const bool success = Teuchos::UnitTestRepository::runUnitTests(*out);\n\n if (success)\n *out << \"\\nEnd Result: TEST PASSED\" << std::endl;\n else\n *out << \"\\nEnd Result: TEST FAILED\" << std::endl;\n\n clp.printFinalTimerSummary(out.ptr());\n\n return (success ? 0 : 1);\n}\n\n\/\/---------------------------------------------------------------------------\/\/\n\/\/ end tstParticleBank.cpp\n\/\/---------------------------------------------------------------------------\/\/\n<|endoftext|>"} {"text":"<commit_before>#include \"misc.h\"\n\n\/**\n * Returns a statm_t object containing information about memory usage.\n *\/\nstatm_t * memory_get_usage() {\n\n const char* statm_path = \"\/proc\/self\/statm\";\n\n statm_t * result = (statm_t *) malloc(sizeof(statm_t));\n result->size = 0;\n result->resident = 0;\n result->share = 0;\n result->text = 0;\n result->lib = 0;\n result->data = 0;\n result->dt = 0;\n\n FILE *f = fopen(statm_path,\"r\");\n if(f){\n fscanf(f,\"%ld %ld %ld %ld %ld %ld %ld\",\n &result->size,\n &result->resident,\n &result->share,\n &result->text,\n &result->lib,\n &result->data,\n &result->dt\n );\n fclose(f);\n }\n return result;\n}\n\n\/**\n *\n *\/\nint is_numeric(char * string) {\n \/\/ ASCII value of\n \/\/ '-': 45\n \/\/ '.': 46\n \/\/ '0': 48\n \/\/ '9': 57\n int num_period = 0;\n unsigned int i;\n int good = 0;\n\n \/\/ all remaining characters can be numeric but with only one period\n for (i = 0; i < strlen(string); i++) {\n good = 0;\n if (string[i] >= 48 && string[i] <= 57) {\n good = 1;\n }\n \/\/ periods are acceptable, but only one.\n if (string[i] == 46) {\n num_period++;\n good = 1;\n \/\/ we can only have one period\n if (num_period > 1) {\n good = 0;\n }\n }\n \/\/ the minus sign is acceptable if it appears first\n if (string[i] == 45 && i == 0) {\n good = 1;\n }\n if (!good) {\n return 0;\n }\n }\n return 1;\n}\n<commit_msg>Fixed bug in checking if ematrix value is numeric<commit_after>#include \"misc.h\"\n\n\/**\n * Returns a statm_t object containing information about memory usage.\n *\/\nstatm_t * memory_get_usage() {\n\n const char* statm_path = \"\/proc\/self\/statm\";\n\n statm_t * result = (statm_t *) malloc(sizeof(statm_t));\n result->size = 0;\n result->resident = 0;\n result->share = 0;\n result->text = 0;\n result->lib = 0;\n result->data = 0;\n result->dt = 0;\n\n FILE *f = fopen(statm_path,\"r\");\n if(f){\n fscanf(f,\"%ld %ld %ld %ld %ld %ld %ld\",\n &result->size,\n &result->resident,\n &result->share,\n &result->text,\n &result->lib,\n &result->data,\n &result->dt\n );\n fclose(f);\n }\n return result;\n}\n\n\/**\n *\n *\/\nint is_numeric(char * string) {\n \/\/ ASCII value of\n \/\/ '-': 45\n \/\/ '.': 46\n \/\/ '0': 48\n \/\/ '9': 57\n \/\/ 'e': 101\n int num_period = 0;\n unsigned int i;\n int good = 0;\n \/\/ the position of the e in scientific notation\n unsigned int epos = 0;\n\n \/\/ all remaining characters can be numeric but with only one period\n for (i = 0; i < strlen(string); i++) {\n good = 0;\n if (string[i] >= 48 && string[i] <= 57) {\n good = 1;\n }\n \/\/ periods are acceptable, but only one.\n if (string[i] == 46) {\n num_period++;\n good = 1;\n \/\/ we can only have one period\n if (num_period > 1) {\n good = 0;\n }\n }\n \/\/ the minus sign is acceptable if it appears first in the string or\n \/\/ after an e in scientific notation\n if (string[i] == 45) {\n if (i == 0) {\n good = 1;\n }\n if (i == epos + 1) {\n good = 1;\n }\n }\n if (string[i] == 101) {\n good = 1;\n epos = i;\n }\n if (!good) {\n return 0;\n }\n }\n return 1;\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 <string>\n#include <stdlib.h>\n\n#include <iostream>\n#include <string.h>\n\n#include \"DebugServer.h\"\n\nDebugServer::DebugServer(unsigned int port)\n: comm(port)\n{\n commands = g_async_queue_new();\n answers = g_async_queue_new();\n\n g_async_queue_ref(commands);\n g_async_queue_ref(answers);\n\n if (g_thread_supported())\n {\n comm.init();\n\n GError* err = NULL;\n g_message(\"Starting debug server as two seperate threads (reader and writer)\");\n readerThread = g_thread_create(reader_static, this, true, &err);\n writerThread = g_thread_create(writer_static, this, true, &err);\n\n registerCommand(\"help\", \"list available commands or get the description of a specific command\", this);\n\n } else\n {\n g_warning(\"No threading support: DebugServer not available\");\n }\n}\n\nvoid DebugServer::mainReader()\n{\n g_message(\"Reader init\");\n g_async_queue_ref(commands);\n\n g_message(\"Starting DebugServer reader loop\");\n while (true)\n {\n char* msg = comm.readMessage();\n if (msg == NULL)\n {\n \/\/ error occured, we should empty the command queue (the answer queue is cleared by the writer)\n while (g_async_queue_length(commands) > 0)\n {\n char* tmp = (char*) g_async_queue_pop(commands);\n g_free(tmp);\n }\n } else\n {\n g_async_queue_push(commands, msg);\n }\n g_thread_yield();\n }\n g_async_queue_unref(commands);\n}\n\nvoid DebugServer::mainWriter()\n{\n g_message(\"Writer init\");\n g_async_queue_ref(answers);\n\n g_message(\"Starting DebugServer writer loop\");\n while (true)\n {\n char* answer = (char*) g_async_queue_pop(answers);\n\n if (!comm.sendMessage(answer, strlen(answer) + 1))\n {\n \/\/ error, clear answer queue\n while (g_async_queue_length(answers) > 0)\n {\n char* tmp = (char*) g_async_queue_pop(answers);\n g_free(tmp);\n }\n }\n g_free(answer);\n g_thread_yield();\n }\n g_async_queue_unref(answers);\n}\n\nvoid DebugServer::execute()\n{\n while (g_async_queue_length(commands) > 0)\n {\n char* cmdRaw = (char*) g_async_queue_pop(commands);\n\n GString* answer = g_string_new(\"\");\n handleCommand(cmdRaw, answer);\n\n g_string_append(answer, \"\\r\\n\\0\");\n\n g_async_queue_push(answers, g_string_free(answer, false));\n\n g_free(cmdRaw);\n }\n}\n\nvoid DebugServer::handleCommand(char* cmdRaw, GString* answer)\n{\n \/\/ parse command\n GError* parseError = NULL;\n int argc;\n char** argv;\n g_shell_parse_argv(cmdRaw, &argc, &argv, &parseError);\n\n if (parseError)\n {\n g_string_append(answer, \"parsing error: \");\n g_string_append(answer, parseError->message);\n } else\n {\n std::map<std::string, std::string> arguments;\n std::string commandName = \"\";\n \/\/ iterate over the command parts and build up the arguments as map\n bool answerAsBase64 = false;\n \/\/ command name\n if (argc > 0)\n {\n\n if (g_str_has_prefix(argv[0], \"+\"))\n {\n answerAsBase64 = true;\n commandName.assign(argv[0] + 1);\n } else\n {\n answerAsBase64 = false;\n commandName.assign(argv[0]);\n }\n }\n \/\/ argument names and if existings their values\n std::string lastKey;\n bool nextIsValue = false;\n bool valueIsBase64 = false;\n for (int i = 1; i < argc; i++)\n {\n if (nextIsValue)\n {\n if (lastKey != \"\")\n {\n if (valueIsBase64)\n {\n size_t len;\n char* decoded = (char*) g_base64_decode(argv[i], &len);\n arguments[lastKey].assign(decoded);\n g_free(decoded);\n } else\n {\n arguments[lastKey].assign(argv[i]);\n }\n }\n\n lastKey.assign(\"\");\n nextIsValue = false;\n } else\n {\n if (g_str_has_prefix(argv[i], \"-\"))\n {\n nextIsValue = true;\n valueIsBase64 = false;\n\n lastKey.assign(argv[i] + 1);\n } else if (g_str_has_prefix(argv[i], \"+\"))\n {\n nextIsValue = true;\n valueIsBase64 = true;\n\n lastKey.assign(argv[i] + 1);\n } else\n {\n nextIsValue = false;\n lastKey.assign(argv[i]);\n }\n arguments[lastKey] = \"\";\n\n }\n }\n\n g_strfreev(argv);\n\n handleCommand(commandName, arguments, answer, answerAsBase64);\n\n }\n\n}\n\nvoid DebugServer::handleCommand(std::string command, std::map<std::string,\n std::string> arguments, GString* answer, bool encodeBase64)\n{\n\n std::stringstream answerFromHandler;\n if (executorMap.find(command) != executorMap.end())\n {\n executorMap[command]->executeDebugCommand(command, arguments, answerFromHandler);\n } else\n {\n answerFromHandler << \"Unknown command \\\"\" << command\n << \"\\\", use \\\"help\\\" for a list of available commands\";\n }\n\n if (encodeBase64)\n {\n char* encoded = g_base64_encode((guchar*) answerFromHandler.str().c_str(),\n answerFromHandler.str().length());\n g_string_append(answer, encoded);\n g_free(encoded);\n } else\n {\n g_string_append(answer, answerFromHandler.str().c_str());\n }\n\n}\n\nbool DebugServer::registerCommand(std::string command, std::string description,\n DebugCommandExecutor* executor)\n{\n if (executorMap.find(command) == executorMap.end())\n {\n \/\/ new command\n executorMap[command] = executor;\n descriptionMap[command] = description;\n return true;\n }\n return false;\n}\n\nvoid DebugServer::objectDestructed(DebugCommandExecutor* object)\n{\n std::list<std::string> registeredKeys;\n\n \/\/ search all registered keys of the object\n std::map<std::string, DebugCommandExecutor*>::const_iterator iter;\n for (iter = executorMap.begin(); iter != executorMap.end(); iter++)\n {\n if ((*iter).second == object)\n {\n registeredKeys.push_back((*iter).first);\n }\/\/end if\n }\/\/end for\n\n \/\/ unregister all found commands\n std::list<std::string>::const_iterator iter_key;\n for (iter_key = registeredKeys.begin(); iter_key != registeredKeys.end(); iter_key++)\n {\n executorMap.erase(*iter_key);\n\n std::cout << \"[DebugServer] \" << \"unregistering command \"\n << (*iter_key) << std::endl;\n }\/\/end for\n}\n\nvoid DebugServer::executeDebugCommand(const std::string& command, const std::map<std::string, std::string>& arguments,\n std::stringstream& out)\n{\n if (command == \"help\")\n {\n if (arguments.empty())\n {\n \/\/ list all available commands\n out << \"Available commands, use \\\"help <command>\\\" for a description:\\n\";\n std::map<std::string, std::string>::const_iterator iter = descriptionMap.begin();\n while (iter != descriptionMap.end())\n {\n out << iter->first;\n iter++;\n if (iter != descriptionMap.end())\n {\n out << \", \";\n }\n }\n } else\n {\n std::string firstArg = arguments.begin()->first;\n if (descriptionMap.find(firstArg) != descriptionMap.end())\n {\n out << firstArg << \"\\n\";\n out << \"------------------\\n\";\n out << descriptionMap[firstArg];\n out << \"\\n\";\n } else\n {\n out << \"Unknown command \\\"\" << firstArg\n << \"\\\", use \\\"help\\\" for a list of available commands\";\n }\n\n }\n }\n}\n\nvoid* DebugServer::reader_static(void* ref)\n{\n ((DebugServer*) ref)->mainReader();\n return NULL;\n}\n\nvoid* DebugServer::writer_static(void* ref)\n{\n ((DebugServer*) ref)->mainWriter();\n return NULL;\n}\n\nDebugServer::~DebugServer()\n{\n g_free(readerThread);\n g_free(writerThread);\n g_async_queue_unref(commands);\n g_async_queue_unref(answers);\n}\n\n<commit_msg>added destruction listener to unregister destroyed commands<commit_after>\/* \n * File: DebugServer.cpp\n * Author: thomas\n * \n * Created on 10. September 2010, 15:38\n *\/\n\n#include <string>\n#include <stdlib.h>\n\n#include <iostream>\n#include <string.h>\n\n#include \"DebugServer.h\"\n\nDebugServer::DebugServer(unsigned int port)\n: comm(port)\n{\n commands = g_async_queue_new();\n answers = g_async_queue_new();\n\n g_async_queue_ref(commands);\n g_async_queue_ref(answers);\n\n if (g_thread_supported())\n {\n comm.init();\n\n GError* err = NULL;\n g_message(\"Starting debug server as two seperate threads (reader and writer)\");\n readerThread = g_thread_create(reader_static, this, true, &err);\n writerThread = g_thread_create(writer_static, this, true, &err);\n\n registerCommand(\"help\", \"list available commands or get the description of a specific command\", this);\n\n } else\n {\n g_warning(\"No threading support: DebugServer not available\");\n }\n}\n\nvoid DebugServer::mainReader()\n{\n g_message(\"Reader init\");\n g_async_queue_ref(commands);\n\n g_message(\"Starting DebugServer reader loop\");\n while (true)\n {\n char* msg = comm.readMessage();\n if (msg == NULL)\n {\n \/\/ error occured, we should empty the command queue (the answer queue is cleared by the writer)\n while (g_async_queue_length(commands) > 0)\n {\n char* tmp = (char*) g_async_queue_pop(commands);\n g_free(tmp);\n }\n } else\n {\n g_async_queue_push(commands, msg);\n }\n g_thread_yield();\n }\n g_async_queue_unref(commands);\n}\n\nvoid DebugServer::mainWriter()\n{\n g_message(\"Writer init\");\n g_async_queue_ref(answers);\n\n g_message(\"Starting DebugServer writer loop\");\n while (true)\n {\n char* answer = (char*) g_async_queue_pop(answers);\n\n if (!comm.sendMessage(answer, strlen(answer) + 1))\n {\n \/\/ error, clear answer queue\n while (g_async_queue_length(answers) > 0)\n {\n char* tmp = (char*) g_async_queue_pop(answers);\n g_free(tmp);\n }\n }\n g_free(answer);\n g_thread_yield();\n }\n g_async_queue_unref(answers);\n}\n\nvoid DebugServer::execute()\n{\n while (g_async_queue_length(commands) > 0)\n {\n char* cmdRaw = (char*) g_async_queue_pop(commands);\n\n GString* answer = g_string_new(\"\");\n handleCommand(cmdRaw, answer);\n\n g_string_append(answer, \"\\r\\n\\0\");\n\n g_async_queue_push(answers, g_string_free(answer, false));\n\n g_free(cmdRaw);\n }\n}\n\nvoid DebugServer::handleCommand(char* cmdRaw, GString* answer)\n{\n \/\/ parse command\n GError* parseError = NULL;\n int argc;\n char** argv;\n g_shell_parse_argv(cmdRaw, &argc, &argv, &parseError);\n\n if (parseError)\n {\n g_string_append(answer, \"parsing error: \");\n g_string_append(answer, parseError->message);\n } else\n {\n std::map<std::string, std::string> arguments;\n std::string commandName = \"\";\n \/\/ iterate over the command parts and build up the arguments as map\n bool answerAsBase64 = false;\n \/\/ command name\n if (argc > 0)\n {\n\n if (g_str_has_prefix(argv[0], \"+\"))\n {\n answerAsBase64 = true;\n commandName.assign(argv[0] + 1);\n } else\n {\n answerAsBase64 = false;\n commandName.assign(argv[0]);\n }\n }\n \/\/ argument names and if existings their values\n std::string lastKey;\n bool nextIsValue = false;\n bool valueIsBase64 = false;\n for (int i = 1; i < argc; i++)\n {\n if (nextIsValue)\n {\n if (lastKey != \"\")\n {\n if (valueIsBase64)\n {\n size_t len;\n char* decoded = (char*) g_base64_decode(argv[i], &len);\n arguments[lastKey].assign(decoded);\n g_free(decoded);\n } else\n {\n arguments[lastKey].assign(argv[i]);\n }\n }\n\n lastKey.assign(\"\");\n nextIsValue = false;\n } else\n {\n if (g_str_has_prefix(argv[i], \"-\"))\n {\n nextIsValue = true;\n valueIsBase64 = false;\n\n lastKey.assign(argv[i] + 1);\n } else if (g_str_has_prefix(argv[i], \"+\"))\n {\n nextIsValue = true;\n valueIsBase64 = true;\n\n lastKey.assign(argv[i] + 1);\n } else\n {\n nextIsValue = false;\n lastKey.assign(argv[i]);\n }\n arguments[lastKey] = \"\";\n\n }\n }\n\n g_strfreev(argv);\n\n handleCommand(commandName, arguments, answer, answerAsBase64);\n\n }\n\n}\n\nvoid DebugServer::handleCommand(std::string command, std::map<std::string,\n std::string> arguments, GString* answer, bool encodeBase64)\n{\n\n std::stringstream answerFromHandler;\n if (executorMap.find(command) != executorMap.end())\n {\n executorMap[command]->executeDebugCommand(command, arguments, answerFromHandler);\n } else\n {\n answerFromHandler << \"Unknown command \\\"\" << command\n << \"\\\", use \\\"help\\\" for a list of available commands\";\n }\n\n if (encodeBase64)\n {\n char* encoded = g_base64_encode((guchar*) answerFromHandler.str().c_str(),\n answerFromHandler.str().length());\n g_string_append(answer, encoded);\n g_free(encoded);\n } else\n {\n g_string_append(answer, answerFromHandler.str().c_str());\n }\n\n}\/\/end handleCommand\n\nbool DebugServer::registerCommand(std::string command, std::string description,\n DebugCommandExecutor* executor)\n{\n if (executorMap.find(command) == executorMap.end())\n {\n \/\/ new command\n executorMap[command] = executor;\n descriptionMap[command] = description;\n executor->registerDestructionListener(*this);\n return true;\n }\n return false;\n}\/\/end registerCommand\n\nvoid DebugServer::objectDestructed(DebugCommandExecutor* object)\n{\n std::list<std::string> registeredKeys;\n\n \/\/ search all registered keys of the object\n std::map<std::string, DebugCommandExecutor*>::const_iterator iter;\n for (iter = executorMap.begin(); iter != executorMap.end(); iter++)\n {\n if ((*iter).second == object)\n {\n registeredKeys.push_back((*iter).first);\n }\/\/end if\n }\/\/end for\n\n \/\/ unregister all found commands\n std::list<std::string>::const_iterator iter_key;\n for (iter_key = registeredKeys.begin(); iter_key != registeredKeys.end(); iter_key++)\n {\n executorMap.erase(*iter_key);\n\n std::cout << \"[DebugServer] \" << \"unregistering command \"\n << (*iter_key) << std::endl;\n }\/\/end for\n}\n\nvoid DebugServer::executeDebugCommand(const std::string& command, const std::map<std::string, std::string>& arguments,\n std::stringstream& out)\n{\n if (command == \"help\")\n {\n if (arguments.empty())\n {\n \/\/ list all available commands\n out << \"Available commands, use \\\"help <command>\\\" for a description:\\n\";\n std::map<std::string, std::string>::const_iterator iter = descriptionMap.begin();\n while (iter != descriptionMap.end())\n {\n out << iter->first;\n iter++;\n if (iter != descriptionMap.end())\n {\n out << \", \";\n }\n }\n } else\n {\n std::string firstArg = arguments.begin()->first;\n if (descriptionMap.find(firstArg) != descriptionMap.end())\n {\n out << firstArg << \"\\n\";\n out << \"------------------\\n\";\n out << descriptionMap[firstArg];\n out << \"\\n\";\n } else\n {\n out << \"Unknown command \\\"\" << firstArg\n << \"\\\", use \\\"help\\\" for a list of available commands\";\n }\n\n }\n }\n}\n\nvoid* DebugServer::reader_static(void* ref)\n{\n ((DebugServer*) ref)->mainReader();\n return NULL;\n}\n\nvoid* DebugServer::writer_static(void* ref)\n{\n ((DebugServer*) ref)->mainWriter();\n return NULL;\n}\n\nDebugServer::~DebugServer()\n{\n g_free(readerThread);\n g_free(writerThread);\n g_async_queue_unref(commands);\n g_async_queue_unref(answers);\n}\n\n<|endoftext|>"} {"text":"<commit_before>\/*************************************************************************\n *\n * $RCSfile: ZipPackageBuffer.cxx,v $\n *\n * $Revision: 1.8 $\n *\n * last change: $Author: mtg $ $Date: 2001-04-19 14:16: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): Martin Gallwey (gallwey@sun.com)\n *\n *\n ************************************************************************\/\n#ifndef _ZIP_PACKAGE_BUFFER_HXX\n#include <ZipPackageBuffer.hxx>\n#endif\n\nusing namespace com::sun::star::uno;\nusing namespace com::sun::star::io;\n\nZipPackageBuffer::ZipPackageBuffer(sal_Int64 nNewBufferSize)\n: nBufferSize (nNewBufferSize)\n, aBuffer (static_cast < sal_Int32 > (nNewBufferSize))\n, nCurrent(0)\n, nEnd(0)\n{\n}\nZipPackageBuffer::~ZipPackageBuffer(void)\n{\n}\nAny SAL_CALL ZipPackageBuffer::queryInterface( const Type& rType )\n throw(RuntimeException)\n{\n return ::cppu::queryInterface ( rType ,\n \/\/ OWeakObject interfaces\n reinterpret_cast< XInterface* > ( this ) ,\n static_cast< XWeak* > ( this ) ,\n \/\/ my interfaces\n static_cast< XInputStream* > ( this ) ,\n static_cast< XSeekable* > ( this ) ,\n static_cast< XOutputStream* > ( this ) );\n\n}\nvoid SAL_CALL ZipPackageBuffer::acquire(void)\n throw()\n{\n OWeakObject::acquire();\n}\nvoid SAL_CALL ZipPackageBuffer::release(void)\n throw()\n{\n OWeakObject::release();\n}\nsal_Int32 SAL_CALL ZipPackageBuffer::readBytes( Sequence< sal_Int8 >& aData, sal_Int32 nBytesToRead )\n throw(NotConnectedException, BufferSizeExceededException, IOException, RuntimeException)\n{\n \/\/const sal_Int8 *pBuffer = aBuffer.getConstArray()+nCurrent;\n\n if (nBytesToRead < 0)\n throw BufferSizeExceededException(::rtl::OUString(),*this);\n\n if (nBytesToRead + nCurrent > nEnd)\n nBytesToRead = static_cast < sal_Int32 > (nEnd - nCurrent);\n\n memcpy(aData.getArray(), aBuffer.getConstArray() + nCurrent, nBytesToRead);\n nCurrent +=nBytesToRead;\n return nBytesToRead;\n \/\/aData.realloc(nBytesToRead);\n \/\/memcpy(aData.getArray(), pBuffer + nCurrent, nBytesToRead);\n \/\/memcpy(pData, pBuffer, nBytesToRead);\n\n \/\/ Optimisations for often called cases\n \/*\n switch (nBytesToRead)\n {\n case 0:\n return 0;\n case 1:\n *(pData++) = *pBuffer;\n nCurrent +=1;\n return 1;\n case 2:\n *(pData++) = *(pBuffer++);\n * pData = *pBuffer;\n nCurrent +=2;\n return 2;\n case 4:\n *(pData++) = *(pBuffer++);\n *(pData++) = *(pBuffer++);\n *(pData++) = *(pBuffer++);\n * pData = * pBuffer;\n nCurrent +=4;\n return 4;\n default:\n memcpy(pData, pBuffer, nBytesToRead);\n nCurrent +=nBytesToRead;\n return nBytesToRead;\n }\n \/\/return nBytesToRead;\n *\/\n}\n\nsal_Int32 SAL_CALL ZipPackageBuffer::readSomeBytes( Sequence< sal_Int8 >& aData, sal_Int32 nMaxBytesToRead )\n throw(NotConnectedException, BufferSizeExceededException, IOException, RuntimeException)\n{\n \/*\n if (nMaxBytesToRead + nCurrent > nEnd)\n nMaxBytesToRead = nEnd - nCurrent;\n sal_Int64 nEndRead = nMaxBytesToRead+nCurrent;\n\n for (sal_Int64 i =0; nCurrent < nEndRead; nCurrent++, i++)\n aData[i] = aBuffer[nCurrent];\n return nMaxBytesToRead;\n *\/\n\n \/\/ all data is available at once\n return readBytes(aData, nMaxBytesToRead);\n}\nvoid SAL_CALL ZipPackageBuffer::skipBytes( sal_Int32 nBytesToSkip )\n throw(NotConnectedException, BufferSizeExceededException, IOException, RuntimeException)\n{\n if (nBytesToSkip < 0)\n throw BufferSizeExceededException(::rtl::OUString(),*this);\n\n if (nBytesToSkip + nCurrent > nEnd)\n nBytesToSkip = static_cast < sal_Int32 > (nEnd - nCurrent);\n\n nCurrent+=nBytesToSkip;\n}\nsal_Int32 SAL_CALL ZipPackageBuffer::available( )\n throw(NotConnectedException, IOException, RuntimeException)\n{\n return static_cast < sal_Int32 > (nEnd - nCurrent);\n}\nvoid SAL_CALL ZipPackageBuffer::closeInput( )\n throw(NotConnectedException, IOException, RuntimeException)\n{\n}\nvoid SAL_CALL ZipPackageBuffer::writeBytes( const Sequence< sal_Int8 >& aData )\n throw(NotConnectedException, BufferSizeExceededException, IOException, RuntimeException)\n{\n sal_Int64 nDataLen = aData.getLength();\n const sal_Int8 *pData = aData.getConstArray();\n\n if (nEnd + nDataLen > nBufferSize)\n {\n while (nEnd + nDataLen > nBufferSize)\n nBufferSize *=2;\n aBuffer.realloc(static_cast < sal_Int32 > (nBufferSize));\n }\n \/*\n sal_Int8 *pBuffer = aBuffer.getArray()+nCurrent;\n switch (nDataLen)\n {\n case 0:\n break;\n case 1:\n * pBuffer = *pData;\n nCurrent++;\n break;\n case 2:\n *(pBuffer++) = *(pData++);\n * pBuffer = * pData ;\n nCurrent +=2;\n break;\n case 4:\n *(pBuffer++) = *(pData++);\n *(pBuffer++) = *(pData++);\n *(pBuffer++) = *(pData++);\n * pBuffer = * pData ;\n nCurrent +=4;\n break;\n default:\n memcpy(pBuffer, pData, static_cast < sal_Int32 > (nDataLen));\n nCurrent += nDataLen;\n break;\n }\n *\/\n \/\/memcpy( pBuffer + nCurrent, aData.getConstArray(), static_cast < sal_Int32 > (nDataLen));\n memcpy( aBuffer.getArray() + nCurrent, aData.getConstArray(), static_cast < sal_Int32 > (nDataLen));\n nCurrent+=nDataLen;\n if (nCurrent>nEnd)\n nEnd = nCurrent;\n}\nvoid SAL_CALL ZipPackageBuffer::flush( )\n throw(NotConnectedException, BufferSizeExceededException, IOException, RuntimeException)\n{\n}\nvoid SAL_CALL ZipPackageBuffer::closeOutput( )\n throw(NotConnectedException, BufferSizeExceededException, IOException, RuntimeException)\n{\n}\nvoid SAL_CALL ZipPackageBuffer::seek( sal_Int64 location )\n throw(::com::sun::star::lang::IllegalArgumentException, IOException, RuntimeException)\n{\n nCurrent = location;\n}\nsal_Int64 SAL_CALL ZipPackageBuffer::getPosition( )\n throw(IOException, RuntimeException)\n{\n return nCurrent;\n}\nsal_Int64 SAL_CALL ZipPackageBuffer::getLength( )\n throw(IOException, RuntimeException)\n{\n return nEnd;\n}\n<commit_msg>readBytes is responsible for reallocing the calling stream<commit_after>\/*************************************************************************\n *\n * $RCSfile: ZipPackageBuffer.cxx,v $\n *\n * $Revision: 1.9 $\n *\n * last change: $Author: mtg $ $Date: 2001-05-15 13:05: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): Martin Gallwey (gallwey@sun.com)\n *\n *\n ************************************************************************\/\n#ifndef _ZIP_PACKAGE_BUFFER_HXX\n#include <ZipPackageBuffer.hxx>\n#endif\n\nusing namespace com::sun::star::uno;\nusing namespace com::sun::star::io;\n\nZipPackageBuffer::ZipPackageBuffer(sal_Int64 nNewBufferSize)\n: nBufferSize (nNewBufferSize)\n, aBuffer (static_cast < sal_Int32 > (nNewBufferSize))\n, nCurrent(0)\n, nEnd(0)\n{\n}\nZipPackageBuffer::~ZipPackageBuffer(void)\n{\n}\nAny SAL_CALL ZipPackageBuffer::queryInterface( const Type& rType )\n throw(RuntimeException)\n{\n return ::cppu::queryInterface ( rType ,\n \/\/ OWeakObject interfaces\n reinterpret_cast< XInterface* > ( this ) ,\n static_cast< XWeak* > ( this ) ,\n \/\/ my interfaces\n static_cast< XInputStream* > ( this ) ,\n static_cast< XSeekable* > ( this ) ,\n static_cast< XOutputStream* > ( this ) );\n\n}\nvoid SAL_CALL ZipPackageBuffer::acquire(void)\n throw()\n{\n OWeakObject::acquire();\n}\nvoid SAL_CALL ZipPackageBuffer::release(void)\n throw()\n{\n OWeakObject::release();\n}\nsal_Int32 SAL_CALL ZipPackageBuffer::readBytes( Sequence< sal_Int8 >& aData, sal_Int32 nBytesToRead )\n throw(NotConnectedException, BufferSizeExceededException, IOException, RuntimeException)\n{\n \/\/const sal_Int8 *pBuffer = aBuffer.getConstArray()+nCurrent;\n\n if (nBytesToRead < 0)\n throw BufferSizeExceededException(::rtl::OUString(),*this);\n\n if (nBytesToRead + nCurrent > nEnd)\n nBytesToRead = static_cast < sal_Int32 > (nEnd - nCurrent);\n\n aData.realloc ( nBytesToRead );\n memcpy(aData.getArray(), aBuffer.getConstArray() + nCurrent, nBytesToRead);\n nCurrent +=nBytesToRead;\n return nBytesToRead;\n \/\/aData.realloc(nBytesToRead);\n \/\/memcpy(aData.getArray(), pBuffer + nCurrent, nBytesToRead);\n \/\/memcpy(pData, pBuffer, nBytesToRead);\n\n \/\/ Optimisations for often called cases\n \/*\n switch (nBytesToRead)\n {\n case 0:\n return 0;\n case 1:\n *(pData++) = *pBuffer;\n nCurrent +=1;\n return 1;\n case 2:\n *(pData++) = *(pBuffer++);\n * pData = *pBuffer;\n nCurrent +=2;\n return 2;\n case 4:\n *(pData++) = *(pBuffer++);\n *(pData++) = *(pBuffer++);\n *(pData++) = *(pBuffer++);\n * pData = * pBuffer;\n nCurrent +=4;\n return 4;\n default:\n memcpy(pData, pBuffer, nBytesToRead);\n nCurrent +=nBytesToRead;\n return nBytesToRead;\n }\n \/\/return nBytesToRead;\n *\/\n}\n\nsal_Int32 SAL_CALL ZipPackageBuffer::readSomeBytes( Sequence< sal_Int8 >& aData, sal_Int32 nMaxBytesToRead )\n throw(NotConnectedException, BufferSizeExceededException, IOException, RuntimeException)\n{\n \/*\n if (nMaxBytesToRead + nCurrent > nEnd)\n nMaxBytesToRead = nEnd - nCurrent;\n sal_Int64 nEndRead = nMaxBytesToRead+nCurrent;\n\n for (sal_Int64 i =0; nCurrent < nEndRead; nCurrent++, i++)\n aData[i] = aBuffer[nCurrent];\n return nMaxBytesToRead;\n *\/\n\n \/\/ all data is available at once\n return readBytes(aData, nMaxBytesToRead);\n}\nvoid SAL_CALL ZipPackageBuffer::skipBytes( sal_Int32 nBytesToSkip )\n throw(NotConnectedException, BufferSizeExceededException, IOException, RuntimeException)\n{\n if (nBytesToSkip < 0)\n throw BufferSizeExceededException(::rtl::OUString(),*this);\n\n if (nBytesToSkip + nCurrent > nEnd)\n nBytesToSkip = static_cast < sal_Int32 > (nEnd - nCurrent);\n\n nCurrent+=nBytesToSkip;\n}\nsal_Int32 SAL_CALL ZipPackageBuffer::available( )\n throw(NotConnectedException, IOException, RuntimeException)\n{\n return static_cast < sal_Int32 > (nEnd - nCurrent);\n}\nvoid SAL_CALL ZipPackageBuffer::closeInput( )\n throw(NotConnectedException, IOException, RuntimeException)\n{\n}\nvoid SAL_CALL ZipPackageBuffer::writeBytes( const Sequence< sal_Int8 >& aData )\n throw(NotConnectedException, BufferSizeExceededException, IOException, RuntimeException)\n{\n sal_Int64 nDataLen = aData.getLength();\n const sal_Int8 *pData = aData.getConstArray();\n\n if (nEnd + nDataLen > nBufferSize)\n {\n while (nEnd + nDataLen > nBufferSize)\n nBufferSize *=2;\n aBuffer.realloc(static_cast < sal_Int32 > (nBufferSize));\n }\n \/*\n sal_Int8 *pBuffer = aBuffer.getArray()+nCurrent;\n switch (nDataLen)\n {\n case 0:\n break;\n case 1:\n * pBuffer = *pData;\n nCurrent++;\n break;\n case 2:\n *(pBuffer++) = *(pData++);\n * pBuffer = * pData ;\n nCurrent +=2;\n break;\n case 4:\n *(pBuffer++) = *(pData++);\n *(pBuffer++) = *(pData++);\n *(pBuffer++) = *(pData++);\n * pBuffer = * pData ;\n nCurrent +=4;\n break;\n default:\n memcpy(pBuffer, pData, static_cast < sal_Int32 > (nDataLen));\n nCurrent += nDataLen;\n break;\n }\n *\/\n \/\/memcpy( pBuffer + nCurrent, aData.getConstArray(), static_cast < sal_Int32 > (nDataLen));\n memcpy( aBuffer.getArray() + nCurrent, aData.getConstArray(), static_cast < sal_Int32 > (nDataLen));\n nCurrent+=nDataLen;\n if (nCurrent>nEnd)\n nEnd = nCurrent;\n}\nvoid SAL_CALL ZipPackageBuffer::flush( )\n throw(NotConnectedException, BufferSizeExceededException, IOException, RuntimeException)\n{\n}\nvoid SAL_CALL ZipPackageBuffer::closeOutput( )\n throw(NotConnectedException, BufferSizeExceededException, IOException, RuntimeException)\n{\n}\nvoid SAL_CALL ZipPackageBuffer::seek( sal_Int64 location )\n throw(::com::sun::star::lang::IllegalArgumentException, IOException, RuntimeException)\n{\n nCurrent = location;\n}\nsal_Int64 SAL_CALL ZipPackageBuffer::getPosition( )\n throw(IOException, RuntimeException)\n{\n return nCurrent;\n}\nsal_Int64 SAL_CALL ZipPackageBuffer::getLength( )\n throw(IOException, RuntimeException)\n{\n return nEnd;\n}\n<|endoftext|>"} {"text":"<commit_before>#include \"mpdas.h\"\n\n#define ROOTURL\t\t\"http:\/\/ws.audioscrobbler.com\/2.0\/\"\n#define APIKEY\t\t\"a0ed2629d3d28606f67d7214c916788d\"\n#define\tSECRET\t\t\"295f31c5d28215215b1503fb0327cc01\"\n\nCAudioScrobbler* AudioScrobbler = 0;\n\n#define CLEANUP()\t_response.clear()\n\nsize_t\nwritecb(void* ptr, size_t size, size_t nmemb, void *stream)\n{\n\tAudioScrobbler->ReportResponse((char*)ptr, size*nmemb);\n}\n\nCAudioScrobbler::CAudioScrobbler()\n{\n\t_failcount = 0;\n\t_authed = false;\n\t_response = \"\";\n\t_handle = curl_easy_init();\n\tif(!_handle) {\n\t\teprintf(\"%s\", \"Could not initialize CURL.\");\n\t\texit(EXIT_FAILURE);\n\t}\n}\n\nvoid\nCAudioScrobbler::OpenURL(std::string url, const char* postfields = 0, char* errbuf = 0)\n{\n\tcurl_easy_setopt(_handle, CURLOPT_DNS_CACHE_TIMEOUT, 0);\n\tcurl_easy_setopt(_handle, CURLOPT_NOPROGRESS, 1);\n\tcurl_easy_setopt(_handle, CURLOPT_WRITEFUNCTION, writecb);\n\n\tif(postfields) {\n\t\tcurl_easy_setopt(_handle, CURLOPT_POST, 1);\n\t\tcurl_easy_setopt(_handle, CURLOPT_POSTFIELDS, postfields);\n\t}\n\telse\n\t\tcurl_easy_setopt(_handle, CURLOPT_POST, 0);\n\tif(errbuf)\n\t\tcurl_easy_setopt(_handle, CURLOPT_ERRORBUFFER, errbuf);\n\t\n\tcurl_easy_setopt(_handle, CURLOPT_URL, url.c_str());\n\tcurl_easy_perform(_handle);\n}\n\n\nvoid\nCAudioScrobbler::ReportResponse(char* buf, size_t size)\n{\n\t_response.append(buf);\n}\n\nstd::string\nCAudioScrobbler::CreateScrobbleMessage(int index, centry_t* entry)\n{\n\tstd::ostringstream msg, sigmsg ;\n\tstd::string artist, title, album, array = \"=\";\n\n\tchar* temp = 0;\n\ttemp = curl_easy_escape(_handle, entry->artist.c_str(), entry->artist.length());\n\tartist = temp;\n\tcurl_free(temp);\n\ttemp = curl_easy_escape(_handle, entry->title.c_str(), entry->title.length());\n\ttitle = temp;\n\tcurl_free(temp);\n\ttemp = curl_easy_escape(_handle, entry->album.c_str(), entry->album.length());\n\talbum = temp;\n\tcurl_free(temp);\n\n\tmsg << \"&album\" << array << album;\n\tmsg << \"&api_key=\" << APIKEY;\n\tmsg << \"&artist\" << array << artist;\n\tmsg << \"&duration\" << array << entry->time;\n\tmsg << \"&method=track.Scrobble\";\n\tmsg << \"×tamp\" << array << entry->starttime;\n\tmsg << \"&track\" << array << title;\n\tmsg << \"&sk=\" << _sessionid;\n\n\tarray = \"\";\n\n\tsigmsg << \"album\" << array << entry->album;\n\tsigmsg << \"api_key\" << APIKEY;\n\tsigmsg << \"artist\" << array << entry->artist;\n\tsigmsg << \"duration\" << array << entry->time;\n\tsigmsg << \"methodtrack.Scrobble\";\n\tsigmsg << \"sk\" << _sessionid;\n\tsigmsg << \"timestamp\" << array << entry->starttime;\n\tsigmsg << \"track\" << array << entry->title;\n\tsigmsg << SECRET;\n\n\tstd::string sighash(md5sum((char*)\"%s\", sigmsg.str().c_str()));\n\tmsg << \"&api_sig=\" << sighash;\n\n\treturn msg.str();\n}\n\nvoid\nCAudioScrobbler::Failure()\n{\n\t_failcount += 1;\n\tif(_failcount >= 3) {\n\t\teprintf(\"%s\", \"Re-Handshaking!\");\n\t\t_failcount = 0;\n\t\tHandshake();\n\t}\n}\n\nbool\nCAudioScrobbler::CheckFailure(std::string response)\n{\n\tbool retval = false;\n\n\tsize_t start, end;\n\tstart = _response.find(\"<error code=\\\"\")+13;\n\tend = _response.find(\">\", start)-1;\n\tstd::string errorcode = _response.substr(start, end-start);\n\tint code = strtol(errorcode.c_str(), 0, 10);\n\n\teprintf(\"%s%i\", \"Code: \", code);\n\n\tswitch(code) {\n\t\tcase 3:\n\t\t\teprintf(\"Invalid Method. This should not happen.\");\n\t\t\tretval = true;\n\t\t\tbreak;\n\t\tcase 4:\n\t\t\teprintf(\"Authentification failed. Please check your login data.\");\n\t\t\texit(EXIT_FAILURE);\n\t\tcase 9:\n\t\t\teprintf(\"Invalid session key. Reauthentificating.\");\n\t\t\tretval = true;\n\t\t\t_failcount = 3;\n\t\t\tbreak;\n\t\tcase 10:\n\t\t\teprintf(\"Invalid API-Key. Let's bugger off.\");\n\t\t\texit(EXIT_FAILURE);\n\t\tcase 16:\n\t\t\teprintf(\"The service is temporarily unavailable, we will try again later..\");\n\t\t\tretval = true;\n\t\t\tbreak;\n\t\tcase 26:\n\t\t\teprintf(\"Uh oh. Suspended API key - Access for your account has been suspended, please contact Last.fm\");\n\t\t\texit(EXIT_FAILURE);\n\t}\n\n\treturn retval;\n}\n\nbool\nCAudioScrobbler::Scrobble(centry_t* entry)\n{\n\tbool retval = false;\n\tif(!_authed) {\n\t\teprintf(\"Handshake hasn't been done yet.\");\n\t\tHandshake();\n\t\treturn retval;\n\t}\n\tiprintf(\"Scrobbling: %s - %s\", entry->artist.c_str(), entry->title.c_str());\n\t\n\tOpenURL(ROOTURL, CreateScrobbleMessage(0, entry).c_str());\n\tif(_response.find(\"<lfm status=\\\"ok\\\">\") != std::string::npos) {\n\t\tiprintf(\"%s\", \"Scrobbled successfully.\");\n\t\tretval = true;\n\t}\n\telse if(_response.find(\"<lfm status=\\\"failed\\\">\") != std::string::npos) {\n\t\teprintf(\"%s%s\", \"Last.fm returned an error while scrobbling:\\n\", _response.c_str());\n\t\tif(CheckFailure(_response))\n\t\t\tFailure();\n\t}\n\tCLEANUP();\n\n\treturn retval;\n}\n\nbool\nCAudioScrobbler::SendNowPlaying(mpd_Song* song)\n{\n\tbool retval = false;\n\tif(!song || !song->artist || !song->title) return retval;\n\n\tchar* artist = curl_easy_escape(_handle, song->artist, 0);\n\tchar* title = curl_easy_escape(_handle, song->title, 0);\n\tchar* album = 0;\n\tif(song->album)\n\t\talbum = curl_easy_escape(_handle, song->album, 0);\n\n\tstd::ostringstream query, sig;\n\tquery << \"method=track.updateNowPlaying&track=\" << title << \"&artist=\" << artist << \"&duration=\" << song->time << \"&api_key=\" << APIKEY << \"&sk=\" << _sessionid;\n\tif(album) {\n\t\tquery << \"&album=\" << album;\n\t\tsig << \"album\" << song->album;\n\t}\n\n\tsig << \"api_key\" << APIKEY << \"artist\" << song->artist << \"duration\" << song->time << \"methodtrack.updateNowPlaying\" << \"sk\" << _sessionid << \"track\" << song->title << SECRET;\n\n\tstd::string sighash(md5sum((char*)\"%s\", sig.str().c_str()));\n\n\tquery << \"&api_sig=\" << sighash;\n\n\tOpenURL(ROOTURL, query.str().c_str());\n\n\tif(_response.find(\"<lfm status=\\\"ok\\\">\") != std::string::npos) {\n\t\tiprintf(\"%s\", \"Updated \\\"Now Playing\\\" status successfully.\");\n\t\tretval = true;\n\t}\n\telse if(_response.find(\"<lfm status=\\\"failed\\\">\") != std::string::npos) {\n\t\teprintf(\"%s%s\", \"Last.fm returned an error while updating the currently playing track:\\n\", _response.c_str());\n\t\tif(CheckFailure(_response))\n\t\t\tFailure();\n\t}\n\n\tCLEANUP();\n\treturn retval;\n}\n\nvoid\nCAudioScrobbler::Handshake()\n{\n\tstd::string username=\"\";\n\tfor(unsigned int i = 0; i < Config->getLUsername().length(); i++) {\n\t\tusername.append(1, tolower(Config->getLUsername().c_str()[i]));\n\t}\n\tstd::string authtoken(md5sum((char*)\"%s%s\", username.c_str(), Config->getLPassword().c_str()));\n\n\tstd::ostringstream query, sig;\n\tquery << \"method=auth.getMobileSession&username=\" << Config->getLUsername() << \"&authToken=\" << authtoken << \"&api_key=\" << APIKEY;\n\n\tsig << \"api_key\" << APIKEY << \"authToken\" << authtoken << \"methodauth.getMobileSessionusername\" << Config->getLUsername() << SECRET;\n\tstd::string sighash(md5sum((char*)\"%s\", sig.str().c_str()));\n\n\tquery << \"&api_sig=\" << sighash;\n\n\tOpenURL(ROOTURL, query.str().c_str());\n\n\tif(_response.find(\"<lfm status=\\\"ok\\\">\") != std::string::npos) {\n\t\tsize_t start, end;\n\t\tstart = _response.find(\"<key>\") + 5;\n\t\tend = _response.find(\"<\/key>\");\n\t\t_sessionid = _response.substr(start, end-start);\n\t\tiprintf(\"%s%s\", \"Last.fm handshake successful. SessionID: \", _sessionid.c_str());\n\t\t_authed = true;\n\t}\n\telse if(_response.find(\"<lfm status=\\\"failed\\\">\") != std::string::npos) {\n\t\tCheckFailure(_response);\n\t\texit(EXIT_FAILURE);\n\t}\n\n\tCLEANUP();\n}\n<commit_msg>fix spelling<commit_after>#include \"mpdas.h\"\n\n#define ROOTURL\t\t\"http:\/\/ws.audioscrobbler.com\/2.0\/\"\n#define APIKEY\t\t\"a0ed2629d3d28606f67d7214c916788d\"\n#define\tSECRET\t\t\"295f31c5d28215215b1503fb0327cc01\"\n\nCAudioScrobbler* AudioScrobbler = 0;\n\n#define CLEANUP()\t_response.clear()\n\nsize_t\nwritecb(void* ptr, size_t size, size_t nmemb, void *stream)\n{\n\tAudioScrobbler->ReportResponse((char*)ptr, size*nmemb);\n}\n\nCAudioScrobbler::CAudioScrobbler()\n{\n\t_failcount = 0;\n\t_authed = false;\n\t_response = \"\";\n\t_handle = curl_easy_init();\n\tif(!_handle) {\n\t\teprintf(\"%s\", \"Could not initialize CURL.\");\n\t\texit(EXIT_FAILURE);\n\t}\n}\n\nvoid\nCAudioScrobbler::OpenURL(std::string url, const char* postfields = 0, char* errbuf = 0)\n{\n\tcurl_easy_setopt(_handle, CURLOPT_DNS_CACHE_TIMEOUT, 0);\n\tcurl_easy_setopt(_handle, CURLOPT_NOPROGRESS, 1);\n\tcurl_easy_setopt(_handle, CURLOPT_WRITEFUNCTION, writecb);\n\n\tif(postfields) {\n\t\tcurl_easy_setopt(_handle, CURLOPT_POST, 1);\n\t\tcurl_easy_setopt(_handle, CURLOPT_POSTFIELDS, postfields);\n\t}\n\telse\n\t\tcurl_easy_setopt(_handle, CURLOPT_POST, 0);\n\tif(errbuf)\n\t\tcurl_easy_setopt(_handle, CURLOPT_ERRORBUFFER, errbuf);\n\t\n\tcurl_easy_setopt(_handle, CURLOPT_URL, url.c_str());\n\tcurl_easy_perform(_handle);\n}\n\n\nvoid\nCAudioScrobbler::ReportResponse(char* buf, size_t size)\n{\n\t_response.append(buf);\n}\n\nstd::string\nCAudioScrobbler::CreateScrobbleMessage(int index, centry_t* entry)\n{\n\tstd::ostringstream msg, sigmsg ;\n\tstd::string artist, title, album, array = \"=\";\n\n\tchar* temp = 0;\n\ttemp = curl_easy_escape(_handle, entry->artist.c_str(), entry->artist.length());\n\tartist = temp;\n\tcurl_free(temp);\n\ttemp = curl_easy_escape(_handle, entry->title.c_str(), entry->title.length());\n\ttitle = temp;\n\tcurl_free(temp);\n\ttemp = curl_easy_escape(_handle, entry->album.c_str(), entry->album.length());\n\talbum = temp;\n\tcurl_free(temp);\n\n\tmsg << \"&album\" << array << album;\n\tmsg << \"&api_key=\" << APIKEY;\n\tmsg << \"&artist\" << array << artist;\n\tmsg << \"&duration\" << array << entry->time;\n\tmsg << \"&method=track.Scrobble\";\n\tmsg << \"×tamp\" << array << entry->starttime;\n\tmsg << \"&track\" << array << title;\n\tmsg << \"&sk=\" << _sessionid;\n\n\tarray = \"\";\n\n\tsigmsg << \"album\" << array << entry->album;\n\tsigmsg << \"api_key\" << APIKEY;\n\tsigmsg << \"artist\" << array << entry->artist;\n\tsigmsg << \"duration\" << array << entry->time;\n\tsigmsg << \"methodtrack.Scrobble\";\n\tsigmsg << \"sk\" << _sessionid;\n\tsigmsg << \"timestamp\" << array << entry->starttime;\n\tsigmsg << \"track\" << array << entry->title;\n\tsigmsg << SECRET;\n\n\tstd::string sighash(md5sum((char*)\"%s\", sigmsg.str().c_str()));\n\tmsg << \"&api_sig=\" << sighash;\n\n\treturn msg.str();\n}\n\nvoid\nCAudioScrobbler::Failure()\n{\n\t_failcount += 1;\n\tif(_failcount >= 3) {\n\t\teprintf(\"%s\", \"Re-Handshaking!\");\n\t\t_failcount = 0;\n\t\tHandshake();\n\t}\n}\n\nbool\nCAudioScrobbler::CheckFailure(std::string response)\n{\n\tbool retval = false;\n\n\tsize_t start, end;\n\tstart = _response.find(\"<error code=\\\"\")+13;\n\tend = _response.find(\">\", start)-1;\n\tstd::string errorcode = _response.substr(start, end-start);\n\tint code = strtol(errorcode.c_str(), 0, 10);\n\n\teprintf(\"%s%i\", \"Code: \", code);\n\n\tswitch(code) {\n\t\tcase 3:\n\t\t\teprintf(\"Invalid Method. This should not happen.\");\n\t\t\tretval = true;\n\t\t\tbreak;\n\t\tcase 4:\n\t\t\teprintf(\"Authentication failed. Please check your login data.\");\n\t\t\texit(EXIT_FAILURE);\n\t\tcase 9:\n\t\t\teprintf(\"Invalid session key. Re-authenticating.\");\n\t\t\tretval = true;\n\t\t\t_failcount = 3;\n\t\t\tbreak;\n\t\tcase 10:\n\t\t\teprintf(\"Invalid API-Key. Let's bugger off.\");\n\t\t\texit(EXIT_FAILURE);\n\t\tcase 16:\n\t\t\teprintf(\"The service is temporarily unavailable, we will try again later..\");\n\t\t\tretval = true;\n\t\t\tbreak;\n\t\tcase 26:\n\t\t\teprintf(\"Uh oh. Suspended API key - Access for your account has been suspended, please contact Last.fm\");\n\t\t\texit(EXIT_FAILURE);\n\t}\n\n\treturn retval;\n}\n\nbool\nCAudioScrobbler::Scrobble(centry_t* entry)\n{\n\tbool retval = false;\n\tif(!_authed) {\n\t\teprintf(\"Handshake hasn't been done yet.\");\n\t\tHandshake();\n\t\treturn retval;\n\t}\n\tiprintf(\"Scrobbling: %s - %s\", entry->artist.c_str(), entry->title.c_str());\n\t\n\tOpenURL(ROOTURL, CreateScrobbleMessage(0, entry).c_str());\n\tif(_response.find(\"<lfm status=\\\"ok\\\">\") != std::string::npos) {\n\t\tiprintf(\"%s\", \"Scrobbled successfully.\");\n\t\tretval = true;\n\t}\n\telse if(_response.find(\"<lfm status=\\\"failed\\\">\") != std::string::npos) {\n\t\teprintf(\"%s%s\", \"Last.fm returned an error while scrobbling:\\n\", _response.c_str());\n\t\tif(CheckFailure(_response))\n\t\t\tFailure();\n\t}\n\tCLEANUP();\n\n\treturn retval;\n}\n\nbool\nCAudioScrobbler::SendNowPlaying(mpd_Song* song)\n{\n\tbool retval = false;\n\tif(!song || !song->artist || !song->title) return retval;\n\n\tchar* artist = curl_easy_escape(_handle, song->artist, 0);\n\tchar* title = curl_easy_escape(_handle, song->title, 0);\n\tchar* album = 0;\n\tif(song->album)\n\t\talbum = curl_easy_escape(_handle, song->album, 0);\n\n\tstd::ostringstream query, sig;\n\tquery << \"method=track.updateNowPlaying&track=\" << title << \"&artist=\" << artist << \"&duration=\" << song->time << \"&api_key=\" << APIKEY << \"&sk=\" << _sessionid;\n\tif(album) {\n\t\tquery << \"&album=\" << album;\n\t\tsig << \"album\" << song->album;\n\t}\n\n\tsig << \"api_key\" << APIKEY << \"artist\" << song->artist << \"duration\" << song->time << \"methodtrack.updateNowPlaying\" << \"sk\" << _sessionid << \"track\" << song->title << SECRET;\n\n\tstd::string sighash(md5sum((char*)\"%s\", sig.str().c_str()));\n\n\tquery << \"&api_sig=\" << sighash;\n\n\tOpenURL(ROOTURL, query.str().c_str());\n\n\tif(_response.find(\"<lfm status=\\\"ok\\\">\") != std::string::npos) {\n\t\tiprintf(\"%s\", \"Updated \\\"Now Playing\\\" status successfully.\");\n\t\tretval = true;\n\t}\n\telse if(_response.find(\"<lfm status=\\\"failed\\\">\") != std::string::npos) {\n\t\teprintf(\"%s%s\", \"Last.fm returned an error while updating the currently playing track:\\n\", _response.c_str());\n\t\tif(CheckFailure(_response))\n\t\t\tFailure();\n\t}\n\n\tCLEANUP();\n\treturn retval;\n}\n\nvoid\nCAudioScrobbler::Handshake()\n{\n\tstd::string username=\"\";\n\tfor(unsigned int i = 0; i < Config->getLUsername().length(); i++) {\n\t\tusername.append(1, tolower(Config->getLUsername().c_str()[i]));\n\t}\n\tstd::string authtoken(md5sum((char*)\"%s%s\", username.c_str(), Config->getLPassword().c_str()));\n\n\tstd::ostringstream query, sig;\n\tquery << \"method=auth.getMobileSession&username=\" << Config->getLUsername() << \"&authToken=\" << authtoken << \"&api_key=\" << APIKEY;\n\n\tsig << \"api_key\" << APIKEY << \"authToken\" << authtoken << \"methodauth.getMobileSessionusername\" << Config->getLUsername() << SECRET;\n\tstd::string sighash(md5sum((char*)\"%s\", sig.str().c_str()));\n\n\tquery << \"&api_sig=\" << sighash;\n\n\tOpenURL(ROOTURL, query.str().c_str());\n\n\tif(_response.find(\"<lfm status=\\\"ok\\\">\") != std::string::npos) {\n\t\tsize_t start, end;\n\t\tstart = _response.find(\"<key>\") + 5;\n\t\tend = _response.find(\"<\/key>\");\n\t\t_sessionid = _response.substr(start, end-start);\n\t\tiprintf(\"%s%s\", \"Last.fm handshake successful. SessionID: \", _sessionid.c_str());\n\t\t_authed = true;\n\t}\n\telse if(_response.find(\"<lfm status=\\\"failed\\\">\") != std::string::npos) {\n\t\tCheckFailure(_response);\n\t\texit(EXIT_FAILURE);\n\t}\n\n\tCLEANUP();\n}\n<|endoftext|>"} {"text":"<commit_before>\/*\n Copyright (C) 2012 Aleix Pol <aleixpol@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 \"pinned-contacts-model.h\"\n#include \"conversations-model.h\"\n#include \"conversation.h\"\n\n#include <TelepathyQt\/Types>\n#include <TelepathyQt\/AvatarData>\n#include <TelepathyQt\/Presence>\n#include <TelepathyQt\/Account>\n#include <TelepathyQt\/AccountManager>\n#include <TelepathyQt\/PendingReady>\n#include <TelepathyQt\/ContactManager>\n#include <TelepathyQt\/PendingContacts>\n\n#include <KConfigGroup>\n#include \"debug.h\"\n\n#include \"KTp\/presence.h\"\n#include \"KTp\/contact.h\"\n#include \"KTp\/persistent-contact.h\"\n\nclass PinnedContactsModelPrivate {\npublic:\n PinnedContactsModelPrivate() {\n conversations = 0;\n }\n\n QList<KTp::PersistentContactPtr> m_pins;\n Tp::AccountManagerPtr accountManager;\n ConversationsModel *conversations;\n\n QStringList pinsToString() const {\n QStringList ret;\n Q_FOREACH(const KTp::PersistentContactPtr &p, m_pins) {\n ret += p->accountId();\n ret += p->contactId();\n }\n return ret;\n }\n};\n\nPinnedContactsModel::PinnedContactsModel(QObject *parent)\n : QAbstractListModel(parent)\n , d(new PinnedContactsModelPrivate)\n{\n connect(this, SIGNAL(rowsInserted(QModelIndex,int,int)), SIGNAL(countChanged()));\n connect(this, SIGNAL(rowsRemoved(QModelIndex,int,int)), SIGNAL(countChanged()));\n}\n\nPinnedContactsModel::~PinnedContactsModel()\n{\n delete d;\n}\n\nQHash<int, QByteArray> PinnedContactsModel::roleNames() const\n{\n QHash<int, QByteArray> roles = QAbstractListModel::roleNames();\n roles[PresenceIconRole] = \"presenceIcon\";\n roles[AvailabilityRole] = \"available\";\n roles[ContactRole] = \"contact\";\n roles[AccountRole] = \"account\";\n roles[AlreadyChattingRole] = \"alreadyChatting\";\n return roles;\n}\n\nQStringList PinnedContactsModel::state() const\n{\n return d->pinsToString();\n}\n\nvoid PinnedContactsModel::setState(const QStringList &pins)\n{\n for (int i = 0; i < pins.count(); i += 2) {\n appendContactPin(KTp::PersistentContact::create(pins[0], pins[1]));\n }\n}\n\nQModelIndex PinnedContactsModel::indexForContact(const KTp::ContactPtr &contact) const\n{\n for (int i=0; i<d->m_pins.size() && contact; i++) {\n if (d->m_pins[i]->contactId() == contact->id()) {\n return index(i);\n }\n }\n return QModelIndex();\n}\n\nvoid PinnedContactsModel::setPinning(const Tp::AccountPtr &account, const KTp::ContactPtr &contact, bool newState)\n{\n QModelIndex idx = indexForContact(contact);\n bool found = idx.isValid();\n if (newState && !found) {\n KTp::PersistentContactPtr p = KTp::PersistentContact::create(account->uniqueIdentifier(), contact->id());\n appendContactPin(p);\n } else if (!newState && found) {\n removeContactPin(d->m_pins[idx.row()]);\n }\n}\n\nQVariant PinnedContactsModel::data(const QModelIndex &index, int role) const\n{\n if (index.isValid()) {\n KTp::PersistentContactPtr p = d->m_pins[index.row()];\n switch(role) {\n case Qt::DisplayRole:\n if (p->contact()) {\n return p->contact()->alias();\n }\n break;\n case PresenceIconRole:\n if (p->contact()) {\n return KTp::Presence(p->contact()->presence()).icon();\n } else {\n return KTp::Presence(Tp::Presence::offline()).icon();\n }\n break;\n case AvailabilityRole:\n if (!p->contact()) {\n return false;\n }\n else {\n return p->contact()->presence().type()!=Tp::ConnectionPresenceTypeOffline\n && p->contact()->presence().type()!=Tp::ConnectionPresenceTypeError\n && p->contact()->presence().type()!=Tp::ConnectionPresenceTypeUnset\n && p->contact()->presence().type()!=Tp::ConnectionPresenceTypeUnknown;\n }\n case ContactRole:\n return QVariant::fromValue<KTp::ContactPtr>(p->contact());\n case AccountRole:\n return QVariant::fromValue<Tp::AccountPtr>(p->account());\n case AlreadyChattingRole: {\n if (!p->contact()) {\n return false;\n }\n bool found = false;\n for (int i = 0; !found && i < d->conversations->rowCount(); i++) {\n QModelIndex idx = d->conversations->index(i, 0);\n KTp::ContactPtr contact = idx.data(ConversationsModel::ConversationRole).value<Conversation*>()->targetContact();\n found |= contact->id() == p->contact()->id();\n }\n return found;\n }\n case Qt::DecorationRole: {\n QIcon icon;\n if (p->contact()) {\n QString file = p->contact()->avatarData().fileName;\n if (!file.isEmpty()) {\n icon = QIcon::fromTheme(file);\n }\n }\n if (icon.isNull()) {\n icon = QIcon::fromTheme(QStringLiteral(\"im-user\"));\n }\n return icon;\n }\n }\n }\n return QVariant();\n}\n\nint PinnedContactsModel::rowCount(const QModelIndex &parent) const\n{\n if (parent.isValid()) {\n return 0;\n }\n return d->m_pins.count();\n}\n\nvoid PinnedContactsModel::removeContactPin(const KTp::PersistentContactPtr &pin)\n{\n int row = d->m_pins.indexOf(pin);\n if (row>=0) {\n beginRemoveRows(QModelIndex(), row, row);\n d->m_pins.removeAt(row);\n endRemoveRows();\n\n Q_EMIT stateChanged();\n } else\n qWarning() << \"trying to remove missing pin\" << pin->contactId();\n}\n\nvoid PinnedContactsModel::appendContactPin(const KTp::PersistentContactPtr &pin)\n{\n auto samePin = [pin](const KTp::PersistentContactPtr &p) -> bool { return p->contactId() == pin->contactId(); };\n if (std::find_if(d->m_pins.constBegin(), d->m_pins.constEnd(), samePin) != d->m_pins.constEnd()) {\n return;\n }\n\n int s = d->m_pins.size();\n beginInsertRows(QModelIndex(), s, s);\n d->m_pins += pin;\n endInsertRows();\n\n if (d->accountManager && d->accountManager->isReady()) {\n pin->setAccountManager(d->accountManager);\n }\n\n if (pin->contact()) {\n contactChanged(pin->contact());\n }\n connect(pin.data(), SIGNAL(contactChanged(KTp::ContactPtr)), SLOT(contactChanged(KTp::ContactPtr)));\n\n Q_EMIT stateChanged();\n}\n\nvoid PinnedContactsModel::contactChanged(const KTp::ContactPtr &contact)\n{\n if (contact) {\n connect(contact.data(),\n SIGNAL(avatarDataChanged(Tp::AvatarData)),\n SLOT(contactDataChanged()));\n connect(contact.data(),\n SIGNAL(aliasChanged(QString)),\n SLOT(contactDataChanged()));\n connect(contact.data(),\n SIGNAL(presenceChanged(Tp::Presence)),\n SLOT(contactDataChanged()));\n }\n\n QModelIndex index = indexForContact(contact);\n Q_EMIT dataChanged(index, index);\n}\n\nvoid PinnedContactsModel::contactDataChanged()\n{\n KTp::Contact *c = qobject_cast<KTp::Contact*>(sender());\n QModelIndex index = indexForContact(KTp::ContactPtr(c));\n Q_EMIT dataChanged(index, index);\n}\n\nvoid PinnedContactsModel::setConversationsModel(ConversationsModel *model)\n{\n beginResetModel();\n if (d->conversations) {\n disconnect(d->conversations, &QAbstractItemModel::rowsAboutToBeRemoved, this, &PinnedContactsModel::conversationsStateChanged);\n disconnect(d->conversations, &QAbstractItemModel::rowsInserted, this, &PinnedContactsModel::conversationsStateChanged);\n }\n\n d->conversations = model;\n if (model) {\n connect(d->conversations, &QAbstractItemModel::rowsAboutToBeRemoved, this, &PinnedContactsModel::conversationsStateChanged);\n connect(d->conversations, &QAbstractItemModel::rowsInserted, this, &PinnedContactsModel::conversationsStateChanged);\n }\n endResetModel();\n}\n\nvoid PinnedContactsModel::conversationsStateChanged(const QModelIndex &parent, int start, int end)\n{\n for (int i = start; i <= end; i++) {\n QModelIndex idx = d->conversations->index(i, 0, parent);\n Conversation* conv = idx.data(ConversationsModel::ConversationRole).value<Conversation*>();\n QString contactId = conv->targetContact()->id();\n\n Q_FOREACH(const KTp::PersistentContactPtr &p, d->m_pins) {\n if (p->contactId() == contactId) {\n QModelIndex contactIdx = indexForContact(p->contact());\n \/\/We need to delay the dataChanged until the next event loop, when endRowsRemoved has been called\n QMetaObject::invokeMethod(this, \"dataChanged\", Qt::QueuedConnection, Q_ARG(QModelIndex, contactIdx), Q_ARG(QModelIndex, contactIdx));\n }\n }\n }\n}\n\nConversationsModel* PinnedContactsModel::conversationsModel() const\n{\n return d->conversations;\n}\n\nTp::AccountManagerPtr PinnedContactsModel::accountManager() const\n{\n return d->accountManager;\n}\n\nvoid PinnedContactsModel::setAccountManager(const Tp::AccountManagerPtr &accounts)\n{\n d->accountManager = accounts;\n\n connect(d->accountManager->becomeReady(), SIGNAL(finished(Tp::PendingOperation*)), SLOT(onAccountManagerReady()));\n}\n\nvoid PinnedContactsModel::onAccountManagerReady()\n{\n Q_FOREACH(const KTp::PersistentContactPtr &p, d->m_pins) {\n p->setAccountManager(d->accountManager);\n }\n}\n<commit_msg>Don't crash if the ConversationsModel has been disabled<commit_after>\/*\n Copyright (C) 2012 Aleix Pol <aleixpol@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 \"pinned-contacts-model.h\"\n#include \"conversations-model.h\"\n#include \"conversation.h\"\n\n#include <TelepathyQt\/Types>\n#include <TelepathyQt\/AvatarData>\n#include <TelepathyQt\/Presence>\n#include <TelepathyQt\/Account>\n#include <TelepathyQt\/AccountManager>\n#include <TelepathyQt\/PendingReady>\n#include <TelepathyQt\/ContactManager>\n#include <TelepathyQt\/PendingContacts>\n\n#include <KConfigGroup>\n#include \"debug.h\"\n\n#include \"KTp\/presence.h\"\n#include \"KTp\/contact.h\"\n#include \"KTp\/persistent-contact.h\"\n\nclass PinnedContactsModelPrivate {\npublic:\n PinnedContactsModelPrivate() {\n conversations = 0;\n }\n\n QList<KTp::PersistentContactPtr> m_pins;\n Tp::AccountManagerPtr accountManager;\n ConversationsModel *conversations;\n\n QStringList pinsToString() const {\n QStringList ret;\n Q_FOREACH(const KTp::PersistentContactPtr &p, m_pins) {\n ret += p->accountId();\n ret += p->contactId();\n }\n return ret;\n }\n};\n\nPinnedContactsModel::PinnedContactsModel(QObject *parent)\n : QAbstractListModel(parent)\n , d(new PinnedContactsModelPrivate)\n{\n connect(this, SIGNAL(rowsInserted(QModelIndex,int,int)), SIGNAL(countChanged()));\n connect(this, SIGNAL(rowsRemoved(QModelIndex,int,int)), SIGNAL(countChanged()));\n}\n\nPinnedContactsModel::~PinnedContactsModel()\n{\n delete d;\n}\n\nQHash<int, QByteArray> PinnedContactsModel::roleNames() const\n{\n QHash<int, QByteArray> roles = QAbstractListModel::roleNames();\n roles[PresenceIconRole] = \"presenceIcon\";\n roles[AvailabilityRole] = \"available\";\n roles[ContactRole] = \"contact\";\n roles[AccountRole] = \"account\";\n roles[AlreadyChattingRole] = \"alreadyChatting\";\n return roles;\n}\n\nQStringList PinnedContactsModel::state() const\n{\n return d->pinsToString();\n}\n\nvoid PinnedContactsModel::setState(const QStringList &pins)\n{\n for (int i = 0; i < pins.count(); i += 2) {\n appendContactPin(KTp::PersistentContact::create(pins[0], pins[1]));\n }\n}\n\nQModelIndex PinnedContactsModel::indexForContact(const KTp::ContactPtr &contact) const\n{\n for (int i=0; i<d->m_pins.size() && contact; i++) {\n if (d->m_pins[i]->contactId() == contact->id()) {\n return index(i);\n }\n }\n return QModelIndex();\n}\n\nvoid PinnedContactsModel::setPinning(const Tp::AccountPtr &account, const KTp::ContactPtr &contact, bool newState)\n{\n QModelIndex idx = indexForContact(contact);\n bool found = idx.isValid();\n if (newState && !found) {\n KTp::PersistentContactPtr p = KTp::PersistentContact::create(account->uniqueIdentifier(), contact->id());\n appendContactPin(p);\n } else if (!newState && found) {\n removeContactPin(d->m_pins[idx.row()]);\n }\n}\n\nQVariant PinnedContactsModel::data(const QModelIndex &index, int role) const\n{\n if (index.isValid()) {\n KTp::PersistentContactPtr p = d->m_pins[index.row()];\n switch(role) {\n case Qt::DisplayRole:\n if (p->contact()) {\n return p->contact()->alias();\n }\n break;\n case PresenceIconRole:\n if (p->contact()) {\n return KTp::Presence(p->contact()->presence()).icon();\n } else {\n return KTp::Presence(Tp::Presence::offline()).icon();\n }\n break;\n case AvailabilityRole:\n if (!p->contact()) {\n return false;\n }\n else {\n return p->contact()->presence().type()!=Tp::ConnectionPresenceTypeOffline\n && p->contact()->presence().type()!=Tp::ConnectionPresenceTypeError\n && p->contact()->presence().type()!=Tp::ConnectionPresenceTypeUnset\n && p->contact()->presence().type()!=Tp::ConnectionPresenceTypeUnknown;\n }\n case ContactRole:\n return QVariant::fromValue<KTp::ContactPtr>(p->contact());\n case AccountRole:\n return QVariant::fromValue<Tp::AccountPtr>(p->account());\n case AlreadyChattingRole: {\n if (!p->contact() || !d->conversations) {\n return false;\n }\n bool found = false;\n for (int i = 0; !found && i < d->conversations->rowCount(); i++) {\n QModelIndex idx = d->conversations->index(i, 0);\n KTp::ContactPtr contact = idx.data(ConversationsModel::ConversationRole).value<Conversation*>()->targetContact();\n found |= contact->id() == p->contact()->id();\n }\n return found;\n }\n case Qt::DecorationRole: {\n QIcon icon;\n if (p->contact()) {\n QString file = p->contact()->avatarData().fileName;\n if (!file.isEmpty()) {\n icon = QIcon::fromTheme(file);\n }\n }\n if (icon.isNull()) {\n icon = QIcon::fromTheme(QStringLiteral(\"im-user\"));\n }\n return icon;\n }\n }\n }\n return QVariant();\n}\n\nint PinnedContactsModel::rowCount(const QModelIndex &parent) const\n{\n if (parent.isValid()) {\n return 0;\n }\n return d->m_pins.count();\n}\n\nvoid PinnedContactsModel::removeContactPin(const KTp::PersistentContactPtr &pin)\n{\n int row = d->m_pins.indexOf(pin);\n if (row>=0) {\n beginRemoveRows(QModelIndex(), row, row);\n d->m_pins.removeAt(row);\n endRemoveRows();\n\n Q_EMIT stateChanged();\n } else\n qWarning() << \"trying to remove missing pin\" << pin->contactId();\n}\n\nvoid PinnedContactsModel::appendContactPin(const KTp::PersistentContactPtr &pin)\n{\n auto samePin = [pin](const KTp::PersistentContactPtr &p) -> bool { return p->contactId() == pin->contactId(); };\n if (std::find_if(d->m_pins.constBegin(), d->m_pins.constEnd(), samePin) != d->m_pins.constEnd()) {\n return;\n }\n\n int s = d->m_pins.size();\n beginInsertRows(QModelIndex(), s, s);\n d->m_pins += pin;\n endInsertRows();\n\n if (d->accountManager && d->accountManager->isReady()) {\n pin->setAccountManager(d->accountManager);\n }\n\n if (pin->contact()) {\n contactChanged(pin->contact());\n }\n connect(pin.data(), SIGNAL(contactChanged(KTp::ContactPtr)), SLOT(contactChanged(KTp::ContactPtr)));\n\n Q_EMIT stateChanged();\n}\n\nvoid PinnedContactsModel::contactChanged(const KTp::ContactPtr &contact)\n{\n if (contact) {\n connect(contact.data(),\n SIGNAL(avatarDataChanged(Tp::AvatarData)),\n SLOT(contactDataChanged()));\n connect(contact.data(),\n SIGNAL(aliasChanged(QString)),\n SLOT(contactDataChanged()));\n connect(contact.data(),\n SIGNAL(presenceChanged(Tp::Presence)),\n SLOT(contactDataChanged()));\n }\n\n QModelIndex index = indexForContact(contact);\n Q_EMIT dataChanged(index, index);\n}\n\nvoid PinnedContactsModel::contactDataChanged()\n{\n KTp::Contact *c = qobject_cast<KTp::Contact*>(sender());\n QModelIndex index = indexForContact(KTp::ContactPtr(c));\n Q_EMIT dataChanged(index, index);\n}\n\nvoid PinnedContactsModel::setConversationsModel(ConversationsModel *model)\n{\n beginResetModel();\n if (d->conversations) {\n disconnect(d->conversations, &QAbstractItemModel::rowsAboutToBeRemoved, this, &PinnedContactsModel::conversationsStateChanged);\n disconnect(d->conversations, &QAbstractItemModel::rowsInserted, this, &PinnedContactsModel::conversationsStateChanged);\n }\n\n d->conversations = model;\n if (model) {\n connect(d->conversations, &QAbstractItemModel::rowsAboutToBeRemoved, this, &PinnedContactsModel::conversationsStateChanged);\n connect(d->conversations, &QAbstractItemModel::rowsInserted, this, &PinnedContactsModel::conversationsStateChanged);\n }\n endResetModel();\n}\n\nvoid PinnedContactsModel::conversationsStateChanged(const QModelIndex &parent, int start, int end)\n{\n for (int i = start; i <= end; i++) {\n QModelIndex idx = d->conversations->index(i, 0, parent);\n Conversation* conv = idx.data(ConversationsModel::ConversationRole).value<Conversation*>();\n QString contactId = conv->targetContact()->id();\n\n Q_FOREACH(const KTp::PersistentContactPtr &p, d->m_pins) {\n if (p->contactId() == contactId) {\n QModelIndex contactIdx = indexForContact(p->contact());\n \/\/We need to delay the dataChanged until the next event loop, when endRowsRemoved has been called\n QMetaObject::invokeMethod(this, \"dataChanged\", Qt::QueuedConnection, Q_ARG(QModelIndex, contactIdx), Q_ARG(QModelIndex, contactIdx));\n }\n }\n }\n}\n\nConversationsModel* PinnedContactsModel::conversationsModel() const\n{\n return d->conversations;\n}\n\nTp::AccountManagerPtr PinnedContactsModel::accountManager() const\n{\n return d->accountManager;\n}\n\nvoid PinnedContactsModel::setAccountManager(const Tp::AccountManagerPtr &accounts)\n{\n d->accountManager = accounts;\n\n connect(d->accountManager->becomeReady(), SIGNAL(finished(Tp::PendingOperation*)), SLOT(onAccountManagerReady()));\n}\n\nvoid PinnedContactsModel::onAccountManagerReady()\n{\n Q_FOREACH(const KTp::PersistentContactPtr &p, d->m_pins) {\n p->setAccountManager(d->accountManager);\n }\n}\n<|endoftext|>"} {"text":"<commit_before><commit_msg>INTEGRATION: CWS fwk79 (1.2.62); FILE MERGED 2007\/12\/13 06:18:07 cd 1.2.62.1: #i84193# Add merged command URLs to the list of dirty images<commit_after><|endoftext|>"} {"text":"<commit_before>\/***************************************************************************\n FilterPMail.cxx - Pegasus-Mail import\n -------------------\n begin : Sat Jan 6 2001\n copyright : (C) 2001 by Holger Schurig\n (C) 2006 by Danny Kukawka\n email : holgerschurig@gmx.de\n danny.kukawka@web.de\n ***************************************************************************\/\n\n\/***************************************************************************\n * *\n * This program is free software; you can redistribute it and\/or modify *\n * it under the terms of the GNU General Public License as published by *\n * the Free Software Foundation; either version 2 of the License, or *\n * (at your option) any later version. *\n * *\n ***************************************************************************\/\n\n#include <config.h>\n#include <klocale.h>\n#include <kfiledialog.h>\n#include <qregexp.h>\n#include <ktempfile.h>\n#include <kdebug.h>\n\n#include \"filter_pmail.hxx\"\n\n\nFilterPMail::FilterPMail() :\n Filter(i18n(\"Import Folders From Pegasus-Mail\"),\n \"Holger Schurig <br>( rewritten by Danny Kukawka )\",\n i18n(\"<p>Select the Pegasus-Mail directory on your system (containing *.CNM, *.PMM and *.MBX files). \"\n \"On many systems this is stored in C:\\\\pmail\\\\mail or C:\\\\pmail\\\\mail\\\\admin<\/p>\"\n \"<p><b>Note:<\/b> Since it is possible to recreate the folder structure all folders \"\n \"stored under: \\\"PegasusMail-Import\\\".<\/p>\"))\n{}\n\nFilterPMail::~FilterPMail()\n{\n endImport();\n}\n\nvoid FilterPMail::import(FilterInfo *info)\n{\n inf = info;\n \n \/\/ Select directory from where I have to import files\n KFileDialog *kfd;\n kfd = new KFileDialog( QDir::homeDirPath(), \"\", 0, \"kfiledialog\", true );\n kfd->setMode(KFile::Directory | KFile::LocalOnly);\n kfd->exec();\n chosenDir = kfd->selectedFile();\n\n if (chosenDir.isEmpty()) {\n info->alert(i18n(\"No directory selected.\"));\n return;\n }\n\n \/\/ Count total number of files to be processed\n info->addLog(i18n(\"Counting files...\"));\n dir.setPath (chosenDir);\n QStringList files = dir.entryList(\"*.[cC][nN][mM]; *.[pP][mM][mM]; *.[mM][bB][xX]\", QDir::Files, QDir::Name);\n totalFiles = files.count();\n currentFile = 0;\n kdDebug() << \"Count is \" << totalFiles << endl;\n \n if(!(folderParsed = parseFolderMatrix())) {\n info->addLog(i18n(\"Can't parse the folder structure. Continue import without subfolder support!\"));\n }\n\n info->addLog(i18n(\"Importing new mail files ('.cnm')...\"));\n processFiles(\"*.[cC][nN][mM]\", &FilterPMail::importNewMessage);\n info->addLog(i18n(\"Importing mail folders ('.pmm')...\"));\n processFiles(\"*.[pP][mM][mM]\", &FilterPMail::importMailFolder);\n info->addLog(i18n(\"Importing 'UNIX' mail folders ('.mbx')...\"));\n processFiles(\"*.[mM][bB][xX]\", &FilterPMail::importUnixMailFolder);\n\n info->addLog( i18n(\"Finished importing emails from %1\").arg( chosenDir ));\n info->setCurrent(100);\n info->setOverall(100);\n}\n\n\/** this looks for all files with the filemask 'mask' and calls the 'workFunc' on each of them *\/\nvoid FilterPMail::processFiles(const QString& mask, void(FilterPMail::* workFunc)(const QString&) )\n{\n if (inf->shouldTerminate()) return;\n \n QStringList files = dir.entryList(mask, QDir::Files, QDir::Name);\n \/\/kdDebug() << \"Mask is \" << mask << \" count is \" << files.count() << endl;\n for ( QStringList::Iterator mailFile = files.begin(); mailFile != files.end(); ++mailFile ) {\n \/\/ Notify current file\n QFileInfo mailfileinfo(*mailFile);\n inf->setFrom(mailfileinfo.fileName());\n\n \/\/ Clear the other fields\n inf->setTo(QString::null);\n inf->setCurrent(QString::null);\n inf->setCurrent(-1);\n\n \/\/ call worker function, increase progressbar\n (this->*workFunc)(dir.filePath(*mailFile));\n ++currentFile;\n inf->setOverall( (int) ((float) currentFile \/ totalFiles * 100));\n inf->setCurrent( 100 );\n if (inf->shouldTerminate()) return;\n }\n}\n\n\n\/** this function imports one *.CNM message *\/\nvoid FilterPMail::importNewMessage(const QString& file)\n{\n QString destFolder(\"PegasusMail-Import\/New Messages\");\n inf->setTo(destFolder);\n\n \/* comment by Danny Kukawka:\n * addMessage() == old function, need more time and check for duplicates\n * addMessage_fastImport == new function, faster and no check for duplicates\n *\/\n if(inf->removeDupMsg)\n addMessage( inf, destFolder, file );\n else\n addMessage_fastImport( inf, destFolder, file );\n}\n\n\n\/** this function imports one mail folder file (*.PMM) *\/\nvoid FilterPMail::importMailFolder(const QString& file)\n{\n \/\/ Format of a PMM file:\n \/\/ First comes a header with 128 bytes. At the beginning is the name of\n \/\/ the folder. Then there are some unknown bytes (strings). At offset 128\n \/\/ the first message starts.\n \/\/\n \/\/ Each message is terminated by a 0x1A byte. The next message follows\n \/\/ immediately.\n \/\/\n \/\/ The last message is followed by a 0x1A, too.\n \/\/\n \/\/ 000000 6d 61 69 6c 73 65 72 76 65 72 2d 70 72 6f 6a 65 mailserver-proje\n \/\/ 000010 63 74 00 00 00 00 00 00 00 00 00 00 00 00 00 00 ct..............\n \/\/ 000020 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 ................\n \/\/ 000030 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 ................\n \/\/ 000040 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 ................\n \/\/ 000050 00 00 00 00 00 00 36 30 34 37 35 37 32 45 3a 36 ......6047572E:6\n \/\/ 000060 46 34 39 3a 46 4f 4c 30 31 33 35 35 00 00 00 00 F49:FOL01355....\n \/\/ 000070 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 ................\n \/\/ 000080 52 65 74 75 72 6e 2d 50 61 74 68 3a 20 3c 75 72 Return-Path: <ur\n \/\/ ...\n \/\/ 000cb0 2d 2d 2d 2d 2d 2d 2d 2d 2d 2b 0d 0a 1a 52 65 74 ---------+...Ret\n \/\/ 000cc0 75 72 6e 2d 50 61 74 68 3a 20 3c 62 6f 75 6e 63 urn-Path: <bounc\n \/\/ ...\n \/\/ 04dc50 46 30 33 38 44 2e 36 31 35 44 37 34 44 30 2d 2d F038D.615D74D0--\n \/\/ 04dc60 0d 0a 1a\n\n struct {\n char folder[86];\n char id[42];\n } pmm_head;\n \n long l = 0;\n QFile f(file);\n if (!f.open(IO_ReadOnly)) {\n inf->alert(i18n(\"Unable to open %1, skipping\").arg(file));\n } else {\n \/\/ Get folder name\n l = f.readBlock((char *) &pmm_head, sizeof(pmm_head));\n QString folder(\"PegasusMail-Import\/\");\n if(folderParsed) \n folder.append(getFolderName((QString)pmm_head.id));\n else \n folder.append(pmm_head.folder);\n inf->setTo(folder);\n inf->addLog(i18n(\"Importing %1\").arg(\"..\/\" + QString(pmm_head.folder)));\n \n QByteArray input(MAX_LINE);\n bool first_msg = true;\n \n while (!f.atEnd()) {\n KTempFile tempfile;\n inf->setCurrent( (int) ( ( (float) f.at() \/ f.size() ) * 100 ) );\n \n if(!first_msg) {\n \/\/ set the filepos back to last line minus the seperate char (0x1a)\n f.at(f.at() - l + 1); \n }\n \n \/\/ no problem to loose the last line in file. This only contains a seperate char\n while ( ! f.atEnd() && (l = f.readLine(input.data(),MAX_LINE))) {\n if (inf->shouldTerminate()){\n tempfile.close();\n tempfile.unlink();\n return;\n }\n if(input[0] == 0x1a ) {\n break;\n } else {\n tempfile.file()->writeBlock( input, l );\n }\n }\n tempfile.close();\n \n if(inf->removeDupMsg)\n addMessage( inf, folder, tempfile.name() );\n else\n addMessage_fastImport( inf, folder, tempfile.name() );\n \n first_msg = false;\n tempfile.unlink();\n }\n }\n f.close();\n}\n\n\n\/** imports a 'unix' format mail folder (*.MBX) *\/\nvoid FilterPMail::importUnixMailFolder(const QString& file)\n{\n struct {\n char folder[58];\n char id[31];\n } pmg_head;\n \n QFile f;\n QString folder(\"PegasusMail-Import\/\"), s(file), seperate;\n QByteArray line(MAX_LINE);\n int n = 0, l = 0;\n\n \/** Get the folder name *\/\n s.replace( QRegExp(\"mbx$\"), \"pmg\");\n s.replace( QRegExp(\"MBX$\"), \"PMG\");\n f.setName(s);\n if (! f.open( IO_ReadOnly ) ) {\n inf->alert( i18n(\"Unable to open %1, skipping\").arg( s ) );\n return;\n } else {\n f.readBlock((char *) &pmg_head, sizeof(pmg_head));\n f.close();\n \n if(folderParsed) \n folder.append(getFolderName((QString)pmg_head.id));\n else \n folder.append(pmg_head.folder);\n \n inf->setTo(folder);\n inf->setTo(folder);\n }\n \n \/** Read in the mbox *\/\n f.setName(file);\n if (! f.open( IO_ReadOnly ) ) {\n inf->alert( i18n(\"Unable to open %1, skipping\").arg( s ) );\n } else {\n inf->addLog(i18n(\"Importing %1\").arg(\"..\/\" + QString(pmg_head.folder)));\n l = f.readLine( line.data(),MAX_LINE); \/\/ read the first line which is unneeded\n while ( ! f.atEnd() ) {\n KTempFile tempfile;\n \n \/\/ we lost the last line, which is the first line of the new message in\n \/\/ this lopp, but this is ok, because this is the seperate line with\n \/\/ \"From ???@???\" and we can forget them\n while ( ! f.atEnd() && (l = f.readLine(line.data(),MAX_LINE)) && ((seperate = line.data()).left(5) != \"From \")) {\n tempfile.file()->writeBlock(line.data(), l);\n if (inf->shouldTerminate()){\n tempfile.close();\n tempfile.unlink();\n return;\n }\n }\n tempfile.close();\n if(inf->removeDupMsg)\n addMessage( inf, folder, tempfile.name() );\n else\n addMessage_fastImport( inf, folder, tempfile.name() );\n tempfile.unlink(); \n \n n++;\n inf->setCurrent(i18n(\"Message %1\").arg(n)); \n inf->setCurrent( (int) ( ( (float) f.at() \/ f.size() ) * 100 ) );\n }\n } \n f.close();\n}\n\n\/** Parse the information about folderstructure to folderMatrix *\/\nbool FilterPMail::parseFolderMatrix() \n{\n kdDebug() << \"Start parsing the foldermatrix.\" << endl;\n inf->addLog(i18n(\"Parsing the folder structure...\"));\n \n QFile hierarch(chosenDir + \"\/hierarch.pm\");\n if (! hierarch.open( IO_ReadOnly ) ) {\n inf->alert( i18n(\"Unable to open %1, skipping\").arg( chosenDir + \"hierarch.pm\" ) );\n return false;\n } else {\n QStringList tmpList;\n QString tmpRead;\n while ( !hierarch.atEnd() && hierarch.readLine(tmpRead,100)) {\n QString tmpArray[5];\n tmpRead.remove(tmpRead.length() -2,2);\n QStringList tmpList = QStringList::split(\",\", tmpRead, false);\n int i = 0;\n for ( QStringList::Iterator it = tmpList.begin(); it != tmpList.end(); ++it, i++) {\n QString _tmp = *it;\n if(i < 5) tmpArray[i] = _tmp.remove(\"\\\"\");\n else {\n hierarch.close();\n return false; \n }\n } \n folderMatrix.append(tmpArray);\n }\n }\n hierarch.close();\n return true;\n}\n\n\/** get the foldername for a given file ID from folderMatrix *\/\nQString FilterPMail::getFolderName(QString ID) \n{\n bool found = false;\n QString folder = \"\";\n QString search = ID;\n \n while (!found)\n {\n for ( QValueList<QString[5]>::Iterator it = folderMatrix.begin(); it != folderMatrix.end(); it++) {\n QString tmp[5] = *it;\n \n QString _ID = tmp[2];\n if(_ID == search) {\n QString _type = tmp[0] + tmp[1];\n if(( _type == \"21\")) {\n found = true;\n break;\n }\n else {\n folder.prepend((tmp[4] + \"\/\"));\n search = tmp[3];\n }\n }\n } \n }\n return folder;\n}\n<commit_msg>- fixed\/changed the date in copyright section<commit_after>\/***************************************************************************\n FilterPMail.cxx - Pegasus-Mail import\n -------------------\n begin : Sat Jan 6 2001\n copyright : (C) 2001 by Holger Schurig\n (C) 2005 by Danny Kukawka\n email : holgerschurig@gmx.de\n danny.kukawka@web.de\n ***************************************************************************\/\n\n\/***************************************************************************\n * *\n * This program is free software; you can redistribute it and\/or modify *\n * it under the terms of the GNU General Public License as published by *\n * the Free Software Foundation; either version 2 of the License, or *\n * (at your option) any later version. *\n * *\n ***************************************************************************\/\n\n#include <config.h>\n#include <klocale.h>\n#include <kfiledialog.h>\n#include <qregexp.h>\n#include <ktempfile.h>\n#include <kdebug.h>\n\n#include \"filter_pmail.hxx\"\n\n\nFilterPMail::FilterPMail() :\n Filter(i18n(\"Import Folders From Pegasus-Mail\"),\n \"Holger Schurig <br>( rewritten by Danny Kukawka )\",\n i18n(\"<p>Select the Pegasus-Mail directory on your system (containing *.CNM, *.PMM and *.MBX files). \"\n \"On many systems this is stored in C:\\\\pmail\\\\mail or C:\\\\pmail\\\\mail\\\\admin<\/p>\"\n \"<p><b>Note:<\/b> Since it is possible to recreate the folder structure all folders \"\n \"stored under: \\\"PegasusMail-Import\\\".<\/p>\"))\n{}\n\nFilterPMail::~FilterPMail()\n{\n endImport();\n}\n\nvoid FilterPMail::import(FilterInfo *info)\n{\n inf = info;\n \n \/\/ Select directory from where I have to import files\n KFileDialog *kfd;\n kfd = new KFileDialog( QDir::homeDirPath(), \"\", 0, \"kfiledialog\", true );\n kfd->setMode(KFile::Directory | KFile::LocalOnly);\n kfd->exec();\n chosenDir = kfd->selectedFile();\n\n if (chosenDir.isEmpty()) {\n info->alert(i18n(\"No directory selected.\"));\n return;\n }\n\n \/\/ Count total number of files to be processed\n info->addLog(i18n(\"Counting files...\"));\n dir.setPath (chosenDir);\n QStringList files = dir.entryList(\"*.[cC][nN][mM]; *.[pP][mM][mM]; *.[mM][bB][xX]\", QDir::Files, QDir::Name);\n totalFiles = files.count();\n currentFile = 0;\n kdDebug() << \"Count is \" << totalFiles << endl;\n \n if(!(folderParsed = parseFolderMatrix())) {\n info->addLog(i18n(\"Can't parse the folder structure. Continue import without subfolder support!\"));\n }\n\n info->addLog(i18n(\"Importing new mail files ('.cnm')...\"));\n processFiles(\"*.[cC][nN][mM]\", &FilterPMail::importNewMessage);\n info->addLog(i18n(\"Importing mail folders ('.pmm')...\"));\n processFiles(\"*.[pP][mM][mM]\", &FilterPMail::importMailFolder);\n info->addLog(i18n(\"Importing 'UNIX' mail folders ('.mbx')...\"));\n processFiles(\"*.[mM][bB][xX]\", &FilterPMail::importUnixMailFolder);\n\n info->addLog( i18n(\"Finished importing emails from %1\").arg( chosenDir ));\n info->setCurrent(100);\n info->setOverall(100);\n}\n\n\/** this looks for all files with the filemask 'mask' and calls the 'workFunc' on each of them *\/\nvoid FilterPMail::processFiles(const QString& mask, void(FilterPMail::* workFunc)(const QString&) )\n{\n if (inf->shouldTerminate()) return;\n \n QStringList files = dir.entryList(mask, QDir::Files, QDir::Name);\n \/\/kdDebug() << \"Mask is \" << mask << \" count is \" << files.count() << endl;\n for ( QStringList::Iterator mailFile = files.begin(); mailFile != files.end(); ++mailFile ) {\n \/\/ Notify current file\n QFileInfo mailfileinfo(*mailFile);\n inf->setFrom(mailfileinfo.fileName());\n\n \/\/ Clear the other fields\n inf->setTo(QString::null);\n inf->setCurrent(QString::null);\n inf->setCurrent(-1);\n\n \/\/ call worker function, increase progressbar\n (this->*workFunc)(dir.filePath(*mailFile));\n ++currentFile;\n inf->setOverall( (int) ((float) currentFile \/ totalFiles * 100));\n inf->setCurrent( 100 );\n if (inf->shouldTerminate()) return;\n }\n}\n\n\n\/** this function imports one *.CNM message *\/\nvoid FilterPMail::importNewMessage(const QString& file)\n{\n QString destFolder(\"PegasusMail-Import\/New Messages\");\n inf->setTo(destFolder);\n\n \/* comment by Danny Kukawka:\n * addMessage() == old function, need more time and check for duplicates\n * addMessage_fastImport == new function, faster and no check for duplicates\n *\/\n if(inf->removeDupMsg)\n addMessage( inf, destFolder, file );\n else\n addMessage_fastImport( inf, destFolder, file );\n}\n\n\n\/** this function imports one mail folder file (*.PMM) *\/\nvoid FilterPMail::importMailFolder(const QString& file)\n{\n \/\/ Format of a PMM file:\n \/\/ First comes a header with 128 bytes. At the beginning is the name of\n \/\/ the folder. Then there are some unknown bytes (strings). At offset 128\n \/\/ the first message starts.\n \/\/\n \/\/ Each message is terminated by a 0x1A byte. The next message follows\n \/\/ immediately.\n \/\/\n \/\/ The last message is followed by a 0x1A, too.\n \/\/\n \/\/ 000000 6d 61 69 6c 73 65 72 76 65 72 2d 70 72 6f 6a 65 mailserver-proje\n \/\/ 000010 63 74 00 00 00 00 00 00 00 00 00 00 00 00 00 00 ct..............\n \/\/ 000020 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 ................\n \/\/ 000030 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 ................\n \/\/ 000040 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 ................\n \/\/ 000050 00 00 00 00 00 00 36 30 34 37 35 37 32 45 3a 36 ......6047572E:6\n \/\/ 000060 46 34 39 3a 46 4f 4c 30 31 33 35 35 00 00 00 00 F49:FOL01355....\n \/\/ 000070 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 ................\n \/\/ 000080 52 65 74 75 72 6e 2d 50 61 74 68 3a 20 3c 75 72 Return-Path: <ur\n \/\/ ...\n \/\/ 000cb0 2d 2d 2d 2d 2d 2d 2d 2d 2d 2b 0d 0a 1a 52 65 74 ---------+...Ret\n \/\/ 000cc0 75 72 6e 2d 50 61 74 68 3a 20 3c 62 6f 75 6e 63 urn-Path: <bounc\n \/\/ ...\n \/\/ 04dc50 46 30 33 38 44 2e 36 31 35 44 37 34 44 30 2d 2d F038D.615D74D0--\n \/\/ 04dc60 0d 0a 1a\n\n struct {\n char folder[86];\n char id[42];\n } pmm_head;\n \n long l = 0;\n QFile f(file);\n if (!f.open(IO_ReadOnly)) {\n inf->alert(i18n(\"Unable to open %1, skipping\").arg(file));\n } else {\n \/\/ Get folder name\n l = f.readBlock((char *) &pmm_head, sizeof(pmm_head));\n QString folder(\"PegasusMail-Import\/\");\n if(folderParsed) \n folder.append(getFolderName((QString)pmm_head.id));\n else \n folder.append(pmm_head.folder);\n inf->setTo(folder);\n inf->addLog(i18n(\"Importing %1\").arg(\"..\/\" + QString(pmm_head.folder)));\n \n QByteArray input(MAX_LINE);\n bool first_msg = true;\n \n while (!f.atEnd()) {\n KTempFile tempfile;\n inf->setCurrent( (int) ( ( (float) f.at() \/ f.size() ) * 100 ) );\n \n if(!first_msg) {\n \/\/ set the filepos back to last line minus the seperate char (0x1a)\n f.at(f.at() - l + 1); \n }\n \n \/\/ no problem to loose the last line in file. This only contains a seperate char\n while ( ! f.atEnd() && (l = f.readLine(input.data(),MAX_LINE))) {\n if (inf->shouldTerminate()){\n tempfile.close();\n tempfile.unlink();\n return;\n }\n if(input[0] == 0x1a ) {\n break;\n } else {\n tempfile.file()->writeBlock( input, l );\n }\n }\n tempfile.close();\n \n if(inf->removeDupMsg)\n addMessage( inf, folder, tempfile.name() );\n else\n addMessage_fastImport( inf, folder, tempfile.name() );\n \n first_msg = false;\n tempfile.unlink();\n }\n }\n f.close();\n}\n\n\n\/** imports a 'unix' format mail folder (*.MBX) *\/\nvoid FilterPMail::importUnixMailFolder(const QString& file)\n{\n struct {\n char folder[58];\n char id[31];\n } pmg_head;\n \n QFile f;\n QString folder(\"PegasusMail-Import\/\"), s(file), seperate;\n QByteArray line(MAX_LINE);\n int n = 0, l = 0;\n\n \/** Get the folder name *\/\n s.replace( QRegExp(\"mbx$\"), \"pmg\");\n s.replace( QRegExp(\"MBX$\"), \"PMG\");\n f.setName(s);\n if (! f.open( IO_ReadOnly ) ) {\n inf->alert( i18n(\"Unable to open %1, skipping\").arg( s ) );\n return;\n } else {\n f.readBlock((char *) &pmg_head, sizeof(pmg_head));\n f.close();\n \n if(folderParsed) \n folder.append(getFolderName((QString)pmg_head.id));\n else \n folder.append(pmg_head.folder);\n \n inf->setTo(folder);\n inf->setTo(folder);\n }\n \n \/** Read in the mbox *\/\n f.setName(file);\n if (! f.open( IO_ReadOnly ) ) {\n inf->alert( i18n(\"Unable to open %1, skipping\").arg( s ) );\n } else {\n inf->addLog(i18n(\"Importing %1\").arg(\"..\/\" + QString(pmg_head.folder)));\n l = f.readLine( line.data(),MAX_LINE); \/\/ read the first line which is unneeded\n while ( ! f.atEnd() ) {\n KTempFile tempfile;\n \n \/\/ we lost the last line, which is the first line of the new message in\n \/\/ this lopp, but this is ok, because this is the seperate line with\n \/\/ \"From ???@???\" and we can forget them\n while ( ! f.atEnd() && (l = f.readLine(line.data(),MAX_LINE)) && ((seperate = line.data()).left(5) != \"From \")) {\n tempfile.file()->writeBlock(line.data(), l);\n if (inf->shouldTerminate()){\n tempfile.close();\n tempfile.unlink();\n return;\n }\n }\n tempfile.close();\n if(inf->removeDupMsg)\n addMessage( inf, folder, tempfile.name() );\n else\n addMessage_fastImport( inf, folder, tempfile.name() );\n tempfile.unlink(); \n \n n++;\n inf->setCurrent(i18n(\"Message %1\").arg(n)); \n inf->setCurrent( (int) ( ( (float) f.at() \/ f.size() ) * 100 ) );\n }\n } \n f.close();\n}\n\n\/** Parse the information about folderstructure to folderMatrix *\/\nbool FilterPMail::parseFolderMatrix() \n{\n kdDebug() << \"Start parsing the foldermatrix.\" << endl;\n inf->addLog(i18n(\"Parsing the folder structure...\"));\n \n QFile hierarch(chosenDir + \"\/hierarch.pm\");\n if (! hierarch.open( IO_ReadOnly ) ) {\n inf->alert( i18n(\"Unable to open %1, skipping\").arg( chosenDir + \"hierarch.pm\" ) );\n return false;\n } else {\n QStringList tmpList;\n QString tmpRead;\n while ( !hierarch.atEnd() && hierarch.readLine(tmpRead,100)) {\n QString tmpArray[5];\n tmpRead.remove(tmpRead.length() -2,2);\n QStringList tmpList = QStringList::split(\",\", tmpRead, false);\n int i = 0;\n for ( QStringList::Iterator it = tmpList.begin(); it != tmpList.end(); ++it, i++) {\n QString _tmp = *it;\n if(i < 5) tmpArray[i] = _tmp.remove(\"\\\"\");\n else {\n hierarch.close();\n return false; \n }\n } \n folderMatrix.append(tmpArray);\n }\n }\n hierarch.close();\n return true;\n}\n\n\/** get the foldername for a given file ID from folderMatrix *\/\nQString FilterPMail::getFolderName(QString ID) \n{\n bool found = false;\n QString folder = \"\";\n QString search = ID;\n \n while (!found)\n {\n for ( QValueList<QString[5]>::Iterator it = folderMatrix.begin(); it != folderMatrix.end(); it++) {\n QString tmp[5] = *it;\n \n QString _ID = tmp[2];\n if(_ID == search) {\n QString _type = tmp[0] + tmp[1];\n if(( _type == \"21\")) {\n found = true;\n break;\n }\n else {\n folder.prepend((tmp[4] + \"\/\"));\n search = tmp[3];\n }\n }\n } \n }\n return folder;\n}\n<|endoftext|>"} {"text":"<commit_before>#ifndef STAN_MATH_FWD_MAT_FUN_TRACE_QUAD_FORM_HPP\n#define STAN_MATH_FWD_MAT_FUN_TRACE_QUAD_FORM_HPP\n\n#include <boost\/type_traits.hpp>\n#include <stan\/math\/prim\/mat\/err\/check_multiplicable.hpp>\n#include <stan\/math\/prim\/mat\/err\/check_square.hpp>\n#include <stan\/math\/fwd\/mat\/fun\/multiply.hpp>\n#include <stan\/math\/prim\/mat\/fun\/multiply.hpp>\n#include <stan\/math\/prim\/mat\/fun\/transpose.hpp>\n#include <stan\/math\/prim\/mat\/fun\/trace.hpp>\n#include <stan\/math\/fwd\/core.hpp>\n\nnamespace stan {\n namespace math {\n\n template<int RA, int CA, int RB, int CB, typename T>\n inline fvar<T>\n trace_quad_form(const Eigen::Matrix<fvar<T>, RA, CA> &A,\n const Eigen::Matrix<fvar<T>, RB, CB> &B) {\n using stan::math::multiply;\n check_square(\"trace_quad_form\", \"A\", A);\n check_multiplicable(\"trace_quad_form\",\n \"A\", A,\n \"B\", B);\n return trace(multiply(transpose(B),\n multiply(A, B)));\n }\n\n template<int RA, int CA, int RB, int CB, typename T>\n inline fvar<T>\n trace_quad_form(const Eigen::Matrix<fvar<T>, RA, CA> &A,\n const Eigen::Matrix<double, RB, CB> &B) {\n using stan::math::multiply;\n check_square(\"trace_quad_form\", \"A\", A);\n check_multiplicable(\"trace_quad_form\",\n \"A\", A,\n \"B\", B);\n return trace(multiply(transpose(B),\n multiply(A, B)));\n }\n\n template<int RA, int CA, int RB, int CB, typename T>\n inline fvar<T>\n trace_quad_form(const Eigen::Matrix<double, RA, CA> &A,\n const Eigen::Matrix<fvar<T>, RB, CB> &B) {\n using stan::math::multiply;\n check_square(\"trace_quad_form\", \"A\", A);\n check_multiplicable(\"trace_quad_form\",\n \"A\", A,\n \"B\", B);\n return trace(multiply(transpose(B),\n multiply(A, B)));\n }\n }\n}\n\n#endif\n\n<commit_msg>removed using statements<commit_after>#ifndef STAN_MATH_FWD_MAT_FUN_TRACE_QUAD_FORM_HPP\n#define STAN_MATH_FWD_MAT_FUN_TRACE_QUAD_FORM_HPP\n\n#include <boost\/type_traits.hpp>\n#include <stan\/math\/prim\/mat\/err\/check_multiplicable.hpp>\n#include <stan\/math\/prim\/mat\/err\/check_square.hpp>\n#include <stan\/math\/fwd\/mat\/fun\/multiply.hpp>\n#include <stan\/math\/prim\/mat\/fun\/multiply.hpp>\n#include <stan\/math\/prim\/mat\/fun\/transpose.hpp>\n#include <stan\/math\/prim\/mat\/fun\/trace.hpp>\n#include <stan\/math\/fwd\/core.hpp>\n\nnamespace stan {\n namespace math {\n\n template<int RA, int CA, int RB, int CB, typename T>\n inline fvar<T>\n trace_quad_form(const Eigen::Matrix<fvar<T>, RA, CA> &A,\n const Eigen::Matrix<fvar<T>, RB, CB> &B) {\n check_square(\"trace_quad_form\", \"A\", A);\n check_multiplicable(\"trace_quad_form\",\n \"A\", A,\n \"B\", B);\n return trace(multiply(transpose(B),\n multiply(A, B)));\n }\n\n template<int RA, int CA, int RB, int CB, typename T>\n inline fvar<T>\n trace_quad_form(const Eigen::Matrix<fvar<T>, RA, CA> &A,\n const Eigen::Matrix<double, RB, CB> &B) {\n check_square(\"trace_quad_form\", \"A\", A);\n check_multiplicable(\"trace_quad_form\",\n \"A\", A,\n \"B\", B);\n return trace(multiply(transpose(B),\n multiply(A, B)));\n }\n\n template<int RA, int CA, int RB, int CB, typename T>\n inline fvar<T>\n trace_quad_form(const Eigen::Matrix<double, RA, CA> &A,\n const Eigen::Matrix<fvar<T>, RB, CB> &B) {\n check_square(\"trace_quad_form\", \"A\", A);\n check_multiplicable(\"trace_quad_form\",\n \"A\", A,\n \"B\", B);\n return trace(multiply(transpose(B),\n multiply(A, B)));\n }\n }\n}\n\n#endif\n\n<|endoftext|>"} {"text":"<commit_before>\/*\r\n * Copyright (C) 2008 Apple Inc. All Rights Reserved.\r\n *\r\n * Redistribution and use in source and binary forms, with or without\r\n * modification, are permitted provided that the following conditions\r\n * are met:\r\n * 1. Redistributions of source code must retain the above copyright\r\n * notice, this list of conditions and the following disclaimer.\r\n * 2. Redistributions in binary form must reproduce the above copyright\r\n * notice, this list of conditions and the following disclaimer in the\r\n * documentation and\/or other materials provided with the distribution.\r\n *\r\n * THIS SOFTWARE IS PROVIDED BY APPLE INC. ``AS IS'' AND ANY\r\n * EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE\r\n * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR\r\n * PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL APPLE INC. OR\r\n * CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,\r\n * EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,\r\n * PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR\r\n * PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY\r\n * OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT\r\n * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE\r\n * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. \r\n *\/\r\n\r\n#include \"config.h\"\r\n#include \"NetworkStateNotifier.h\"\r\n\r\nnamespace WebCore {\r\n\r\n\/\/ Chromium doesn't currently support network state notifications. This causes\r\n\/\/ an extra DLL to get loaded into the renderer which can slow things down a\r\n\/\/ bit. We may want an alternate design.\r\n\r\nvoid NetworkStateNotifier::updateState()\r\n{\r\n}\r\n\r\n\/\/ TODO(darin): Kill this once we stop defining PLATFORM(MAC)\r\n#if PLATFORM(MAC)\r\nvoid NetworkStateNotifier::networkStateChangeTimerFired(Timer<NetworkStateNotifier>*)\r\n{\r\n}\r\n#endif\r\n\r\n#if PLATFORM(WIN) || PLATFORM(MAC)\r\nNetworkStateNotifier::NetworkStateNotifier()\r\n : m_isOnLine(true)\r\n#if PLATFORM(MAC)\r\n , m_networkStateChangeTimer(this, &NetworkStateNotifier::networkStateChangeTimerFired)\r\n#endif\r\n{\r\n}\r\n#endif\r\n\r\n}\r\n<commit_msg>WIN -> OS_WIN<commit_after>\/*\r\n * Copyright (C) 2008 Apple Inc. All Rights Reserved.\r\n *\r\n * Redistribution and use in source and binary forms, with or without\r\n * modification, are permitted provided that the following conditions\r\n * are met:\r\n * 1. Redistributions of source code must retain the above copyright\r\n * notice, this list of conditions and the following disclaimer.\r\n * 2. Redistributions in binary form must reproduce the above copyright\r\n * notice, this list of conditions and the following disclaimer in the\r\n * documentation and\/or other materials provided with the distribution.\r\n *\r\n * THIS SOFTWARE IS PROVIDED BY APPLE INC. ``AS IS'' AND ANY\r\n * EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE\r\n * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR\r\n * PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL APPLE INC. OR\r\n * CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,\r\n * EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,\r\n * PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR\r\n * PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY\r\n * OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT\r\n * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE\r\n * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. \r\n *\/\r\n\r\n#include \"config.h\"\r\n#include \"NetworkStateNotifier.h\"\r\n\r\nnamespace WebCore {\r\n\r\n\/\/ Chromium doesn't currently support network state notifications. This causes\r\n\/\/ an extra DLL to get loaded into the renderer which can slow things down a\r\n\/\/ bit. We may want an alternate design.\r\n\r\nvoid NetworkStateNotifier::updateState()\r\n{\r\n}\r\n\r\n\/\/ TODO(darin): Kill this once we stop defining PLATFORM(MAC)\r\n#if PLATFORM(MAC)\r\nvoid NetworkStateNotifier::networkStateChangeTimerFired(Timer<NetworkStateNotifier>*)\r\n{\r\n}\r\n#endif\r\n\r\n#if PLATFORM(OS_WIN) || PLATFORM(MAC)\r\nNetworkStateNotifier::NetworkStateNotifier()\r\n : m_isOnLine(true)\r\n#if PLATFORM(MAC)\r\n , m_networkStateChangeTimer(this, &NetworkStateNotifier::networkStateChangeTimerFired)\r\n#endif\r\n{\r\n}\r\n#endif\r\n\r\n}\r\n<|endoftext|>"} {"text":"<commit_before>\/*******************************************************************\n KNotes -- Notes for the KDE project\n\n Copyright (c) 1997-2005, The KNotes Developers\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 <QCheckBox>\n#include <QComboBox>\n#include <QGridLayout>\n#include <QGroupBox>\n#include <QHBoxLayout>\n#include <QLabel>\n#include <QTabWidget>\n#include <QVBoxLayout>\n\n#include <kapplication.h>\n#include <kcolorbutton.h>\n#include <kconfig.h>\n#include <kfontrequester.h>\n#include <kiconloader.h>\n#include <klineedit.h>\n#include <klocale.h>\n#include <knuminput.h>\n#include <kwindowsystem.h>\n\n#include \"knote.h\"\n#include \"knoteconfigdlg.h\"\n#include \"knotesglobalconfig.h\"\n#include \"version.h\"\n\n\nKNoteConfigDlg::KNoteConfigDlg( KNoteConfig *config, const QString &title,\n QWidget *parent, const QString &name )\n : KConfigDialog( parent, name, config ? config : KNotesGlobalConfig::self() )\n{\n setFaceType( KPageDialog::List );\n setButtons( config ? Default | Ok | Apply | Cancel : Default | Ok | Cancel );\n setDefaultButton( Ok );\n \n setCaption( title );\n#ifdef Q_WS_X11\n KWindowSystem::setIcons( winId(),\n qApp->windowIcon().pixmap(\n IconSize( KIconLoader::Desktop ),\n IconSize( KIconLoader::Desktop ) ),\n qApp->windowIcon().pixmap(\n IconSize( KIconLoader::Small ),\n IconSize( KIconLoader::Small ) ) );\n#endif\n \/\/setIconListAllVisible( true );\n showButtonSeparator( true );\n \n if ( config ) {\n addPage( makeDisplayPage( false ), i18n( \"Display\" ), \"knotes\",\n i18n( \"Display Settings\" ) );\n addPage( makeEditorPage( false ), i18n( \"Editor\" ), \"accessories-text-editor\",\n i18n( \"Editor Settings\" ) );\n } else {\n config = KNotesGlobalConfig::self();\n addPage( makeDefaultsPage(), i18n( \"Defaults\" ), \"knotes\",\n i18n( \"Default Settings for New Notes\" ) );\n addPage( makeActionsPage(), i18n( \"Actions\" ), \"preferences-other\",\n i18n( \"Action Settings\" ) );\n addPage( makeNetworkPage(), i18n( \"Network\" ), \"network-wired\",\n i18n( \"Network Settings\" ) );\n addPage( makeStylePage(), i18n( \"Style\" ), \"preferences-desktop-theme\",\n i18n( \"Style Settings\" ) );\n }\n \n config->setVersion( KNOTES_VERSION );\n}\n\nKNoteConfigDlg::~KNoteConfigDlg()\n{\n}\n\nvoid KNoteConfigDlg::slotUpdateCaption()\n{\n KNote *note = ::qobject_cast<KNote *>( sender() );\n if ( note ) {\n setCaption( note->name() );\n }\n}\n\nQWidget *KNoteConfigDlg::makeDisplayPage( bool defaults )\n{\n QWidget *displayPage = new QWidget();\n QGridLayout *layout = new QGridLayout( displayPage );\n layout->setSpacing( spacingHint() );\n layout->setMargin( defaults ? marginHint() : 0 );\n \n QLabel *label_FgColor = new QLabel( i18n( \"&Text color:\" ), displayPage );\n label_FgColor->setObjectName( \"label_FgColor\" );\n layout->addWidget( label_FgColor, 0, 0 );\n \n KColorButton *kcfg_FgColor = new KColorButton( displayPage );\n kcfg_FgColor->setObjectName( \"kcfg_FgColor\" );\n label_FgColor->setBuddy( kcfg_FgColor );\n layout->addWidget( kcfg_FgColor, 0, 1 );\n \n QLabel *label_BgColor = new QLabel( i18n( \"&Background color:\" ),\n displayPage );\n label_BgColor->setObjectName( \"label_BgColor\" );\n layout->addWidget( label_BgColor, 1, 0 );\n \n KColorButton *kcfg_BgColor = new KColorButton( displayPage );\n kcfg_BgColor->setObjectName( \"kcfg_BgColor\" );\n label_BgColor->setBuddy( kcfg_BgColor );\n layout->addWidget( kcfg_BgColor, 1, 1 );\n \n QCheckBox *kcfg_ShowInTaskbar = \n new QCheckBox( i18n( \"&Show note in taskbar\" ), displayPage );\n kcfg_ShowInTaskbar->setObjectName( \"kcfg_ShowInTaskbar\" );\n \n QCheckBox *kcfg_RememberDesktop = \n new QCheckBox( i18n( \"&Remember desktop\" ), displayPage );\n kcfg_RememberDesktop->setObjectName( \"kcfg_RememberDesktop\" );\n \n if ( defaults ) {\n QLabel *label_Width = new QLabel( i18n( \"Default &width:\" ), displayPage );\n \n label_Width->setObjectName( \"label_Width\" );\n layout->addWidget( label_Width, 2, 0 );\n \n KIntNumInput *kcfg_Width = new KIntNumInput( displayPage );\n kcfg_Width->setObjectName( \"kcfg_Width\" );\n label_Width->setBuddy( kcfg_Width );\n kcfg_Width->setRange( 50, 2000, 10 );\n kcfg_Width->setSliderEnabled( false );\n layout->addWidget( kcfg_Width, 2, 1 );\n \n QLabel *label_Height = new QLabel( i18n( \"Default &height:\" ),\n displayPage );\n label_Height->setObjectName( \"label_Height\" );\n layout->addWidget( label_Height, 3, 0 );\n \n KIntNumInput *kcfg_Height = new KIntNumInput( displayPage );\n kcfg_Height->setObjectName( \"kcfg_Height\" );\n kcfg_Height->setRange( 50, 2000, 10 );\n kcfg_Height->setSliderEnabled( false );\n label_Height->setBuddy( kcfg_Height );\n layout->addWidget( kcfg_Height, 3, 1 );\n \n layout->addWidget( kcfg_ShowInTaskbar, 4, 0 );\n layout->addWidget( kcfg_RememberDesktop, 5, 0 );\n } else {\n layout->addWidget( kcfg_ShowInTaskbar, 2, 0 );\n layout->addWidget( kcfg_RememberDesktop, 3, 0 );\n }\n return displayPage;\n}\n\nQWidget *KNoteConfigDlg::makeEditorPage( bool defaults )\n{\n QWidget *editorPage = new QWidget();\n QGridLayout *layout = new QGridLayout( editorPage );\n layout->setSpacing( spacingHint() );\n layout->setMargin( defaults ? marginHint() : 0 );\n \n QLabel *label_TabSize = new QLabel( i18n( \"&Tab size:\" ), editorPage );\n label_TabSize->setObjectName( \"label_TabSize\" );\n layout->addWidget( label_TabSize, 0, 0, 1, 2 );\n \n KIntNumInput *kcfg_TabSize = new KIntNumInput( editorPage );\n kcfg_TabSize->setObjectName( \"kcfg_TabSize\" );\n kcfg_TabSize->setRange( 0, 40 );\n kcfg_TabSize->setSliderEnabled( false );\n label_TabSize->setBuddy( kcfg_TabSize );\n layout->addWidget( kcfg_TabSize, 0, 2 );\n \n QCheckBox *kcfg_AutoIndent = new QCheckBox( i18n( \"Auto &indent\" ),\n editorPage );\n kcfg_AutoIndent->setObjectName( \"kcfg_AutoIndent\" );\n layout->addWidget( kcfg_AutoIndent, 1, 0, 1, 2 );\n \n QCheckBox *kcfg_RichText = new QCheckBox( i18n( \"&Rich text\" ), editorPage );\n kcfg_RichText->setObjectName( \"kcfg_RichText\" );\n layout->addWidget( kcfg_RichText, 1, 2 );\n \n QLabel *label_Font = new QLabel( i18n( \"Text font:\" ), editorPage );\n label_Font->setObjectName( \"label_Font\" );\n layout->addWidget( label_Font, 3, 0 );\n \n KFontRequester *kcfg_Font = new KFontRequester( editorPage );\n kcfg_Font->setObjectName( \"kcfg_Font\" );\n kcfg_Font->setSizePolicy( QSizePolicy( QSizePolicy::Minimum,\n QSizePolicy::Fixed ) );\n layout->addWidget( kcfg_Font, 3, 1, 1, 2 );\n \n QLabel *label_TitleFont = new QLabel( i18n( \"Title font:\" ), editorPage );\n label_TitleFont->setObjectName( \"label_TitleFont\" );\n layout->addWidget( label_TitleFont, 2, 0 );\n \n KFontRequester *kcfg_TitleFont = new KFontRequester( editorPage );\n kcfg_TitleFont->setObjectName( \"kcfg_TitleFont\" );\n kcfg_TitleFont->setSizePolicy( QSizePolicy( QSizePolicy::Minimum,\n QSizePolicy::Fixed ) );\n layout->addWidget( kcfg_TitleFont, 2, 1, 1, 2 );\n \n return editorPage;\n}\n\nQWidget *KNoteConfigDlg::makeDefaultsPage()\n{\n QTabWidget *defaultsPage = new QTabWidget();\n defaultsPage->addTab( makeDisplayPage( true ), KIcon( \"knotes\" ),\n i18n( \"Displa&y\" ) );\n defaultsPage->addTab( makeEditorPage( true ), KIcon( \"document-properties\" ),\n i18n( \"&Editor\" ) );\n \n return defaultsPage;\n}\n\nQWidget *KNoteConfigDlg::makeActionsPage()\n{\n QWidget *actionsPage = new QWidget();\n QGridLayout *layout = new QGridLayout( actionsPage );\n layout->setSpacing( spacingHint() );\n layout->setMargin( 0 );\n \n QLabel *label_MailAction = new QLabel( i18n( \"&Mail action:\" ), actionsPage );\n label_MailAction->setObjectName( \"label_MailAction\" );\n layout->addWidget( label_MailAction, 0, 0 );\n \n KLineEdit *kcfg_MailAction = new KLineEdit( actionsPage );\n kcfg_MailAction->setObjectName( \"kcfg_MailAction\" );\n label_MailAction->setBuddy( kcfg_MailAction );\n layout->addWidget( kcfg_MailAction, 0, 1 );\n \n return actionsPage;\n}\n\nQWidget *KNoteConfigDlg::makeNetworkPage()\n{\n QWidget *networkPage = new QWidget();\n QVBoxLayout *layout = new QVBoxLayout;\n layout->setSpacing( spacingHint() );\n layout->setMargin( 0 );\n \n QGroupBox *incoming = new QGroupBox( i18n( \"Incoming Notes\" ) );\n QHBoxLayout *tmpLayout = new QHBoxLayout;\n \n QCheckBox *tmpChkB=new QCheckBox( i18n( \"Accept incoming notes\" ) );\n tmpChkB->setObjectName( \"kcfg_ReceiveNotes\" );\n tmpLayout->addWidget( tmpChkB );\n incoming->setLayout( tmpLayout );\n layout->addWidget( incoming );\n \n QGroupBox *outgoing = new QGroupBox( i18n( \"Outgoing Notes\" ) );\n tmpLayout = new QHBoxLayout;\n \n QLabel *label_SenderID = new QLabel( i18n( \"&Sender ID:\" ) );\n label_SenderID->setObjectName( \"label_SenderID\" );\n KLineEdit *kcfg_SenderID = new KLineEdit;\n kcfg_SenderID->setObjectName( \"kcfg_SenderID\" );\n label_SenderID->setBuddy( kcfg_SenderID );\n tmpLayout->addWidget( label_SenderID );\n tmpLayout->addWidget( kcfg_SenderID );\n outgoing->setLayout( tmpLayout );\n layout->addWidget( outgoing );\n \n tmpLayout = new QHBoxLayout;\n \n QLabel *label_Port = new QLabel( i18n( \"&Port:\" ) );\n label_Port->setObjectName( \"label_Port\" );\n \n tmpLayout->addWidget( label_Port );\n \n KIntNumInput *kcfg_Port = new KIntNumInput;\n kcfg_Port->setObjectName( \"kcfg_Port\" );\n kcfg_Port->setRange( 0, 65535 );\n kcfg_Port->setSliderEnabled( false );\n label_Port->setBuddy( kcfg_Port );\n tmpLayout->addWidget( kcfg_Port );\n layout->addLayout( tmpLayout );\n \n networkPage->setLayout( layout );\n return networkPage;\n}\n\nQWidget *KNoteConfigDlg::makeStylePage()\n{\n QWidget *stylePage = new QWidget();\n QGridLayout *layout = new QGridLayout( stylePage );\n layout->setSpacing( spacingHint() );\n layout->setMargin( 0 );\n \n QLabel *label_Style = new QLabel( i18n( \"&Style:\" ), stylePage );\n label_Style->setObjectName( \"label_Style\" );\n layout->addWidget( label_Style, 0, 0 );\n \n QComboBox *kcfg_Style = new QComboBox( stylePage );\n kcfg_Style->setObjectName( \"kcfg_Style\" );\n QStringList list;\n list << i18n( \"Plain\" );\n kcfg_Style->addItems( list );\n label_Style->setBuddy( kcfg_Style );\n layout->addWidget( kcfg_Style, 0, 1 );\n \n return stylePage;\n}\n\n#include \"knoteconfigdlg.moc\"\n<commit_msg>Backport: don't show this option in os != X11<commit_after>\/*******************************************************************\n KNotes -- Notes for the KDE project\n\n Copyright (c) 1997-2005, The KNotes Developers\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 <QCheckBox>\n#include <QComboBox>\n#include <QGridLayout>\n#include <QGroupBox>\n#include <QHBoxLayout>\n#include <QLabel>\n#include <QTabWidget>\n#include <QVBoxLayout>\n\n#include <kapplication.h>\n#include <kcolorbutton.h>\n#include <kconfig.h>\n#include <kfontrequester.h>\n#include <kiconloader.h>\n#include <klineedit.h>\n#include <klocale.h>\n#include <knuminput.h>\n#include <kwindowsystem.h>\n\n#include \"knote.h\"\n#include \"knoteconfigdlg.h\"\n#include \"knotesglobalconfig.h\"\n#include \"version.h\"\n\n\nKNoteConfigDlg::KNoteConfigDlg( KNoteConfig *config, const QString &title,\n QWidget *parent, const QString &name )\n : KConfigDialog( parent, name, config ? config : KNotesGlobalConfig::self() )\n{\n setFaceType( KPageDialog::List );\n setButtons( config ? Default | Ok | Apply | Cancel : Default | Ok | Cancel );\n setDefaultButton( Ok );\n \n setCaption( title );\n#ifdef Q_WS_X11\n KWindowSystem::setIcons( winId(),\n qApp->windowIcon().pixmap(\n IconSize( KIconLoader::Desktop ),\n IconSize( KIconLoader::Desktop ) ),\n qApp->windowIcon().pixmap(\n IconSize( KIconLoader::Small ),\n IconSize( KIconLoader::Small ) ) );\n#endif\n \/\/setIconListAllVisible( true );\n showButtonSeparator( true );\n \n if ( config ) {\n addPage( makeDisplayPage( false ), i18n( \"Display\" ), \"knotes\",\n i18n( \"Display Settings\" ) );\n addPage( makeEditorPage( false ), i18n( \"Editor\" ), \"accessories-text-editor\",\n i18n( \"Editor Settings\" ) );\n } else {\n config = KNotesGlobalConfig::self();\n addPage( makeDefaultsPage(), i18n( \"Defaults\" ), \"knotes\",\n i18n( \"Default Settings for New Notes\" ) );\n addPage( makeActionsPage(), i18n( \"Actions\" ), \"preferences-other\",\n i18n( \"Action Settings\" ) );\n addPage( makeNetworkPage(), i18n( \"Network\" ), \"network-wired\",\n i18n( \"Network Settings\" ) );\n addPage( makeStylePage(), i18n( \"Style\" ), \"preferences-desktop-theme\",\n i18n( \"Style Settings\" ) );\n }\n \n config->setVersion( KNOTES_VERSION );\n}\n\nKNoteConfigDlg::~KNoteConfigDlg()\n{\n}\n\nvoid KNoteConfigDlg::slotUpdateCaption()\n{\n KNote *note = ::qobject_cast<KNote *>( sender() );\n if ( note ) {\n setCaption( note->name() );\n }\n}\n\nQWidget *KNoteConfigDlg::makeDisplayPage( bool defaults )\n{\n QWidget *displayPage = new QWidget();\n QGridLayout *layout = new QGridLayout( displayPage );\n layout->setSpacing( spacingHint() );\n layout->setMargin( defaults ? marginHint() : 0 );\n \n QLabel *label_FgColor = new QLabel( i18n( \"&Text color:\" ), displayPage );\n label_FgColor->setObjectName( \"label_FgColor\" );\n layout->addWidget( label_FgColor, 0, 0 );\n \n KColorButton *kcfg_FgColor = new KColorButton( displayPage );\n kcfg_FgColor->setObjectName( \"kcfg_FgColor\" );\n label_FgColor->setBuddy( kcfg_FgColor );\n layout->addWidget( kcfg_FgColor, 0, 1 );\n \n QLabel *label_BgColor = new QLabel( i18n( \"&Background color:\" ),\n displayPage );\n label_BgColor->setObjectName( \"label_BgColor\" );\n layout->addWidget( label_BgColor, 1, 0 );\n \n KColorButton *kcfg_BgColor = new KColorButton( displayPage );\n kcfg_BgColor->setObjectName( \"kcfg_BgColor\" );\n label_BgColor->setBuddy( kcfg_BgColor );\n layout->addWidget( kcfg_BgColor, 1, 1 );\n \n QCheckBox *kcfg_ShowInTaskbar = \n new QCheckBox( i18n( \"&Show note in taskbar\" ), displayPage );\n kcfg_ShowInTaskbar->setObjectName( \"kcfg_ShowInTaskbar\" );\n\n#ifdef Q_WS_X11 \n QCheckBox *kcfg_RememberDesktop = \n new QCheckBox( i18n( \"&Remember desktop\" ), displayPage );\n kcfg_RememberDesktop->setObjectName( \"kcfg_RememberDesktop\" );\n#endif\n if ( defaults ) {\n QLabel *label_Width = new QLabel( i18n( \"Default &width:\" ), displayPage );\n \n label_Width->setObjectName( \"label_Width\" );\n layout->addWidget( label_Width, 2, 0 );\n \n KIntNumInput *kcfg_Width = new KIntNumInput( displayPage );\n kcfg_Width->setObjectName( \"kcfg_Width\" );\n label_Width->setBuddy( kcfg_Width );\n kcfg_Width->setRange( 50, 2000, 10 );\n kcfg_Width->setSliderEnabled( false );\n layout->addWidget( kcfg_Width, 2, 1 );\n \n QLabel *label_Height = new QLabel( i18n( \"Default &height:\" ),\n displayPage );\n label_Height->setObjectName( \"label_Height\" );\n layout->addWidget( label_Height, 3, 0 );\n \n KIntNumInput *kcfg_Height = new KIntNumInput( displayPage );\n kcfg_Height->setObjectName( \"kcfg_Height\" );\n kcfg_Height->setRange( 50, 2000, 10 );\n kcfg_Height->setSliderEnabled( false );\n label_Height->setBuddy( kcfg_Height );\n layout->addWidget( kcfg_Height, 3, 1 );\n \n layout->addWidget( kcfg_ShowInTaskbar, 4, 0 );\n#ifdef Q_WS_X11\n layout->addWidget( kcfg_RememberDesktop, 5, 0 );\n#endif \n } else {\n layout->addWidget( kcfg_ShowInTaskbar, 2, 0 );\n#ifdef Q_WS_X11\n layout->addWidget( kcfg_RememberDesktop, 3, 0 );\n#endif\n }\n return displayPage;\n}\n\nQWidget *KNoteConfigDlg::makeEditorPage( bool defaults )\n{\n QWidget *editorPage = new QWidget();\n QGridLayout *layout = new QGridLayout( editorPage );\n layout->setSpacing( spacingHint() );\n layout->setMargin( defaults ? marginHint() : 0 );\n \n QLabel *label_TabSize = new QLabel( i18n( \"&Tab size:\" ), editorPage );\n label_TabSize->setObjectName( \"label_TabSize\" );\n layout->addWidget( label_TabSize, 0, 0, 1, 2 );\n \n KIntNumInput *kcfg_TabSize = new KIntNumInput( editorPage );\n kcfg_TabSize->setObjectName( \"kcfg_TabSize\" );\n kcfg_TabSize->setRange( 0, 40 );\n kcfg_TabSize->setSliderEnabled( false );\n label_TabSize->setBuddy( kcfg_TabSize );\n layout->addWidget( kcfg_TabSize, 0, 2 );\n \n QCheckBox *kcfg_AutoIndent = new QCheckBox( i18n( \"Auto &indent\" ),\n editorPage );\n kcfg_AutoIndent->setObjectName( \"kcfg_AutoIndent\" );\n layout->addWidget( kcfg_AutoIndent, 1, 0, 1, 2 );\n \n QCheckBox *kcfg_RichText = new QCheckBox( i18n( \"&Rich text\" ), editorPage );\n kcfg_RichText->setObjectName( \"kcfg_RichText\" );\n layout->addWidget( kcfg_RichText, 1, 2 );\n \n QLabel *label_Font = new QLabel( i18n( \"Text font:\" ), editorPage );\n label_Font->setObjectName( \"label_Font\" );\n layout->addWidget( label_Font, 3, 0 );\n \n KFontRequester *kcfg_Font = new KFontRequester( editorPage );\n kcfg_Font->setObjectName( \"kcfg_Font\" );\n kcfg_Font->setSizePolicy( QSizePolicy( QSizePolicy::Minimum,\n QSizePolicy::Fixed ) );\n layout->addWidget( kcfg_Font, 3, 1, 1, 2 );\n \n QLabel *label_TitleFont = new QLabel( i18n( \"Title font:\" ), editorPage );\n label_TitleFont->setObjectName( \"label_TitleFont\" );\n layout->addWidget( label_TitleFont, 2, 0 );\n \n KFontRequester *kcfg_TitleFont = new KFontRequester( editorPage );\n kcfg_TitleFont->setObjectName( \"kcfg_TitleFont\" );\n kcfg_TitleFont->setSizePolicy( QSizePolicy( QSizePolicy::Minimum,\n QSizePolicy::Fixed ) );\n layout->addWidget( kcfg_TitleFont, 2, 1, 1, 2 );\n \n return editorPage;\n}\n\nQWidget *KNoteConfigDlg::makeDefaultsPage()\n{\n QTabWidget *defaultsPage = new QTabWidget();\n defaultsPage->addTab( makeDisplayPage( true ), KIcon( \"knotes\" ),\n i18n( \"Displa&y\" ) );\n defaultsPage->addTab( makeEditorPage( true ), KIcon( \"document-properties\" ),\n i18n( \"&Editor\" ) );\n \n return defaultsPage;\n}\n\nQWidget *KNoteConfigDlg::makeActionsPage()\n{\n QWidget *actionsPage = new QWidget();\n QGridLayout *layout = new QGridLayout( actionsPage );\n layout->setSpacing( spacingHint() );\n layout->setMargin( 0 );\n \n QLabel *label_MailAction = new QLabel( i18n( \"&Mail action:\" ), actionsPage );\n label_MailAction->setObjectName( \"label_MailAction\" );\n layout->addWidget( label_MailAction, 0, 0 );\n \n KLineEdit *kcfg_MailAction = new KLineEdit( actionsPage );\n kcfg_MailAction->setObjectName( \"kcfg_MailAction\" );\n label_MailAction->setBuddy( kcfg_MailAction );\n layout->addWidget( kcfg_MailAction, 0, 1 );\n \n return actionsPage;\n}\n\nQWidget *KNoteConfigDlg::makeNetworkPage()\n{\n QWidget *networkPage = new QWidget();\n QVBoxLayout *layout = new QVBoxLayout;\n layout->setSpacing( spacingHint() );\n layout->setMargin( 0 );\n \n QGroupBox *incoming = new QGroupBox( i18n( \"Incoming Notes\" ) );\n QHBoxLayout *tmpLayout = new QHBoxLayout;\n \n QCheckBox *tmpChkB=new QCheckBox( i18n( \"Accept incoming notes\" ) );\n tmpChkB->setObjectName( \"kcfg_ReceiveNotes\" );\n tmpLayout->addWidget( tmpChkB );\n incoming->setLayout( tmpLayout );\n layout->addWidget( incoming );\n \n QGroupBox *outgoing = new QGroupBox( i18n( \"Outgoing Notes\" ) );\n tmpLayout = new QHBoxLayout;\n \n QLabel *label_SenderID = new QLabel( i18n( \"&Sender ID:\" ) );\n label_SenderID->setObjectName( \"label_SenderID\" );\n KLineEdit *kcfg_SenderID = new KLineEdit;\n kcfg_SenderID->setObjectName( \"kcfg_SenderID\" );\n label_SenderID->setBuddy( kcfg_SenderID );\n tmpLayout->addWidget( label_SenderID );\n tmpLayout->addWidget( kcfg_SenderID );\n outgoing->setLayout( tmpLayout );\n layout->addWidget( outgoing );\n \n tmpLayout = new QHBoxLayout;\n \n QLabel *label_Port = new QLabel( i18n( \"&Port:\" ) );\n label_Port->setObjectName( \"label_Port\" );\n \n tmpLayout->addWidget( label_Port );\n \n KIntNumInput *kcfg_Port = new KIntNumInput;\n kcfg_Port->setObjectName( \"kcfg_Port\" );\n kcfg_Port->setRange( 0, 65535 );\n kcfg_Port->setSliderEnabled( false );\n label_Port->setBuddy( kcfg_Port );\n tmpLayout->addWidget( kcfg_Port );\n layout->addLayout( tmpLayout );\n \n networkPage->setLayout( layout );\n return networkPage;\n}\n\nQWidget *KNoteConfigDlg::makeStylePage()\n{\n QWidget *stylePage = new QWidget();\n QGridLayout *layout = new QGridLayout( stylePage );\n layout->setSpacing( spacingHint() );\n layout->setMargin( 0 );\n \n QLabel *label_Style = new QLabel( i18n( \"&Style:\" ), stylePage );\n label_Style->setObjectName( \"label_Style\" );\n layout->addWidget( label_Style, 0, 0 );\n \n QComboBox *kcfg_Style = new QComboBox( stylePage );\n kcfg_Style->setObjectName( \"kcfg_Style\" );\n QStringList list;\n list << i18n( \"Plain\" );\n kcfg_Style->addItems( list );\n label_Style->setBuddy( kcfg_Style );\n layout->addWidget( kcfg_Style, 0, 1 );\n \n return stylePage;\n}\n\n#include \"knoteconfigdlg.moc\"\n<|endoftext|>"} {"text":"<commit_before><commit_msg>remove SJIS text<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 \"base\/stringprintf.h\"\n#include \"base\/string_piece.h\"\n#include \"chrome\/test\/base\/v8_unit_test.h\"\n\nV8UnitTest::V8UnitTest() {}\n\nV8UnitTest::~V8UnitTest() {}\n\nvoid V8UnitTest::SetUp() {\n v8::Handle<v8::ObjectTemplate> global = v8::ObjectTemplate::New();\n global->Set(v8::String::New(\"log\"),\n v8::FunctionTemplate::New(&V8UnitTest::Log));\n context_ = v8::Context::New(NULL, global);\n}\n\nvoid V8UnitTest::SetGlobalStringVar(const std::string& var_name,\n const std::string& value) {\n v8::Context::Scope context_scope(context_);\n context_->Global()->Set(v8::String::New(var_name.c_str(), var_name.length()),\n v8::String::New(value.c_str(), value.length()));\n}\n\nvoid V8UnitTest::ExecuteScriptInContext(const base::StringPiece& script_source,\n const base::StringPiece& script_name) {\n v8::Context::Scope context_scope(context_);\n v8::HandleScope handle_scope;\n v8::Handle<v8::String> source = v8::String::New(script_source.data(),\n script_source.size());\n v8::Handle<v8::String> name = v8::String::New(script_name.data(),\n script_source.size());\n\n v8::TryCatch try_catch;\n v8::Handle<v8::Script> script = v8::Script::Compile(source, name);\n \/\/ Ensure the script compiled without errors.\n if (script.IsEmpty()) {\n FAIL() << ExceptionToString(&try_catch);\n }\n v8::Handle<v8::Value> result = script->Run();\n \/\/ Ensure the script ran without errors.\n if (result.IsEmpty()) {\n FAIL() << ExceptionToString(&try_catch);\n }\n}\n\nstd::string V8UnitTest::ExceptionToString(v8::TryCatch* try_catch) {\n std::string str;\n v8::HandleScope handle_scope;\n v8::String::Utf8Value exception(try_catch->Exception());\n v8::Handle<v8::Message> message = try_catch->Message();\n if (message.IsEmpty()) {\n str.append(base::StringPrintf(\"%s\\n\", *exception));\n } else {\n v8::String::Utf8Value filename(message->GetScriptResourceName());\n int linenum = message->GetLineNumber();\n int colnum = message->GetStartColumn();\n str.append(base::StringPrintf(\n \"%s:%i:%i %s\\n\", *filename, linenum, colnum, *exception));\n v8::String::Utf8Value sourceline(message->GetSourceLine());\n str.append(base::StringPrintf(\"%s\\n\", *sourceline));\n }\n return str;\n}\n\nvoid V8UnitTest::TestFunction(const std::string& function_name) {\n v8::Context::Scope context_scope(context_);\n v8::HandleScope handle_scope;\n\n v8::Handle<v8::Value> functionProperty =\n context_->Global()->Get(v8::String::New(function_name.c_str()));\n ASSERT_FALSE(functionProperty.IsEmpty());\n ASSERT_TRUE(functionProperty->IsFunction());\n v8::Handle<v8::Function> function =\n v8::Handle<v8::Function>::Cast(functionProperty);\n\n v8::TryCatch try_catch;\n v8::Handle<v8::Value> result = function->Call(context_->Global(), 0, NULL);\n \/\/ The test fails if an exception was thrown.\n if (result.IsEmpty()) {\n FAIL() << ExceptionToString(&try_catch);\n }\n}\n\n\/\/ static\nv8::Handle<v8::Value> V8UnitTest::Log(const v8::Arguments& args) {\n std::string message;\n bool first = true;\n for (int i = 0; i < args.Length(); i++) {\n v8::HandleScope handle_scope;\n if (first) {\n first = false;\n } else {\n message += \" \";\n }\n v8::String::Utf8Value str(args[i]);\n message += *str;\n }\n std::cout << message << \"\\n\";\n return v8::Undefined();\n}\n<commit_msg>Fix a typo that led to OOB read of kJsonSchema in JsonSchemaTest.TestFormatError<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\/stringprintf.h\"\n#include \"base\/string_piece.h\"\n#include \"chrome\/test\/base\/v8_unit_test.h\"\n\nV8UnitTest::V8UnitTest() {}\n\nV8UnitTest::~V8UnitTest() {}\n\nvoid V8UnitTest::SetUp() {\n v8::Handle<v8::ObjectTemplate> global = v8::ObjectTemplate::New();\n global->Set(v8::String::New(\"log\"),\n v8::FunctionTemplate::New(&V8UnitTest::Log));\n context_ = v8::Context::New(NULL, global);\n}\n\nvoid V8UnitTest::SetGlobalStringVar(const std::string& var_name,\n const std::string& value) {\n v8::Context::Scope context_scope(context_);\n context_->Global()->Set(v8::String::New(var_name.c_str(), var_name.length()),\n v8::String::New(value.c_str(), value.length()));\n}\n\nvoid V8UnitTest::ExecuteScriptInContext(const base::StringPiece& script_source,\n const base::StringPiece& script_name) {\n v8::Context::Scope context_scope(context_);\n v8::HandleScope handle_scope;\n v8::Handle<v8::String> source = v8::String::New(script_source.data(),\n script_source.size());\n v8::Handle<v8::String> name = v8::String::New(script_name.data(),\n script_name.size());\n\n v8::TryCatch try_catch;\n v8::Handle<v8::Script> script = v8::Script::Compile(source, name);\n \/\/ Ensure the script compiled without errors.\n if (script.IsEmpty()) {\n FAIL() << ExceptionToString(&try_catch);\n }\n v8::Handle<v8::Value> result = script->Run();\n \/\/ Ensure the script ran without errors.\n if (result.IsEmpty()) {\n FAIL() << ExceptionToString(&try_catch);\n }\n}\n\nstd::string V8UnitTest::ExceptionToString(v8::TryCatch* try_catch) {\n std::string str;\n v8::HandleScope handle_scope;\n v8::String::Utf8Value exception(try_catch->Exception());\n v8::Handle<v8::Message> message = try_catch->Message();\n if (message.IsEmpty()) {\n str.append(base::StringPrintf(\"%s\\n\", *exception));\n } else {\n v8::String::Utf8Value filename(message->GetScriptResourceName());\n int linenum = message->GetLineNumber();\n int colnum = message->GetStartColumn();\n str.append(base::StringPrintf(\n \"%s:%i:%i %s\\n\", *filename, linenum, colnum, *exception));\n v8::String::Utf8Value sourceline(message->GetSourceLine());\n str.append(base::StringPrintf(\"%s\\n\", *sourceline));\n }\n return str;\n}\n\nvoid V8UnitTest::TestFunction(const std::string& function_name) {\n v8::Context::Scope context_scope(context_);\n v8::HandleScope handle_scope;\n\n v8::Handle<v8::Value> functionProperty =\n context_->Global()->Get(v8::String::New(function_name.c_str()));\n ASSERT_FALSE(functionProperty.IsEmpty());\n ASSERT_TRUE(functionProperty->IsFunction());\n v8::Handle<v8::Function> function =\n v8::Handle<v8::Function>::Cast(functionProperty);\n\n v8::TryCatch try_catch;\n v8::Handle<v8::Value> result = function->Call(context_->Global(), 0, NULL);\n \/\/ The test fails if an exception was thrown.\n if (result.IsEmpty()) {\n FAIL() << ExceptionToString(&try_catch);\n }\n}\n\n\/\/ static\nv8::Handle<v8::Value> V8UnitTest::Log(const v8::Arguments& args) {\n std::string message;\n bool first = true;\n for (int i = 0; i < args.Length(); i++) {\n v8::HandleScope handle_scope;\n if (first) {\n first = false;\n } else {\n message += \" \";\n }\n v8::String::Utf8Value str(args[i]);\n message += *str;\n }\n std::cout << message << \"\\n\";\n return v8::Undefined();\n}\n<|endoftext|>"} {"text":"<commit_before><commit_msg>Pass mesh by const& in new texture extraction<commit_after><|endoftext|>"} {"text":"<commit_before>\/* <x0\/plugins\/vhost.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) 2011 Christian Parpart <trapni@gentoo.org>\n *\n * --------------------------------------------------------------------------\n *\n * plugin type: hostname resolver\n *\n * description:\n * Maps the request hostname:port to a dedicated handler.\n *\n * setup API:\n * void vhost.add(FQDN => handler_ref);\n *\n * request processing API:\n * handler vhost.map();\n *\/\n\n#include <x0\/http\/HttpPlugin.h>\n#include <x0\/http\/HttpServer.h>\n#include <x0\/http\/HttpRequest.h>\n#include <x0\/http\/HttpHeader.h>\n#include <x0\/Types.h>\n\n#include <unordered_map>\n\n\/**\n * \\ingroup plugins\n * \\brief virtual host mapping plugin\n *\/\nclass vhost_plugin :\n\tpublic x0::HttpPlugin\n{\nprivate:\n\tstd::unordered_map<std::string, Flow::Value::Function> namedHosts_;\n\npublic:\n\tvhost_plugin(x0::HttpServer& srv, const std::string& name) :\n\t\tx0::HttpPlugin(srv, name)\n\t{\n\t\tregisterSetupFunction<vhost_plugin, &vhost_plugin::addHost>(\"vhost.add\", Flow::Value::VOID);\n\t\tregisterHandler<vhost_plugin, &vhost_plugin::mapRequest>(\"vhost.map\");\n\t}\n\n\t~vhost_plugin()\n\t{\n\t}\n\nprivate:\n\t\/\/ vhost.add fqdn => proc, ...\n\tvoid addHost(Flow::Value& result, const x0::Params& args)\n\t{\n\t\tfor (auto& arg: args)\n\t\t\tregisterHost(arg);\n\t}\n\n\tvoid registerHost(const Flow::Value& arg)\n\t{\n\t\tif (arg.type() == Flow::Value::ARRAY) {\n\t\t\tconst Flow::Value* args = arg.toArray();\n\t\t\tif (args[0].isVoid() || args[1].isVoid() || !args[2].isVoid())\n\t\t\t\treturn;\n\n\t\t\tconst Flow::Value& fqdn = args[0];\n\t\t\tconst Flow::Value& proc = args[1];\n\n\t\t\tif (!fqdn.isString())\n\t\t\t\treturn;\n\n\t\t\tif (!proc.isFunction())\n\t\t\t\treturn;\n\n\t\t\tregisterHost(fqdn.toString(), proc.toFunction());\n\t\t}\n\t}\n\n\tvoid registerHost(const char *fqdn, Flow::Value::Function handler)\n\t{\n\t\tnamedHosts_[fqdn] = handler;\n\t}\n\n\tbool mapRequest(x0::HttpRequest *r, const x0::Params& args)\n\t{\n\t\tauto i = namedHosts_.find(r->hostid());\n\t\tif (i != namedHosts_.end())\n\t\t\treturn i->second(r);\n\n\t\treturn false;\n\t}\n};\n\nX0_EXPORT_PLUGIN(vhost)\n<commit_msg>[plugins] vhost: added support for mixed qualified\/unqualified hostnames (with and without explicit port speicifcation) and renamed vhost.add to vhost.mapping<commit_after>\/* <x0\/plugins\/vhost.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) 2011 Christian Parpart <trapni@gentoo.org>\n *\n * --------------------------------------------------------------------------\n *\n * plugin type: hostname resolver\n *\n * description:\n * Maps the request hostname:port to a dedicated handler.\n *\n * setup API:\n * void vhost.mapping(FQDN => handler_ref, ...);\n *\n * request processing API:\n * handler vhost.map();\n *\/\n\n#include <x0\/http\/HttpPlugin.h>\n#include <x0\/http\/HttpServer.h>\n#include <x0\/http\/HttpRequest.h>\n#include <x0\/http\/HttpHeader.h>\n#include <x0\/Types.h>\n\n#include <unordered_map>\n\n\/**\n * \\ingroup plugins\n * \\brief virtual host mapping plugin\n *\/\nclass vhost_plugin :\n\tpublic x0::HttpPlugin\n{\nprivate:\n\ttypedef std::map<std::string, Flow::Value::Function> NamedHostMap;\n\n\tNamedHostMap qualifiedHosts_;\n\tNamedHostMap unqualifiedHosts_;\n\npublic:\n\tvhost_plugin(x0::HttpServer& srv, const std::string& name) :\n\t\tx0::HttpPlugin(srv, name)\n\t{\n\t\tregisterSetupFunction<vhost_plugin, &vhost_plugin::addHost>(\"vhost.mapping\", Flow::Value::VOID);\n\t\tregisterHandler<vhost_plugin, &vhost_plugin::mapRequest>(\"vhost.map\");\n\t}\n\n\t~vhost_plugin()\n\t{\n\t}\n\nprivate:\n\t\/\/ vhost.add fqdn => proc, ...\n\tvoid addHost(Flow::Value& result, const x0::Params& args)\n\t{\n\t\tfor (auto& arg: args)\n\t\t\tregisterHost(arg);\n\t}\n\n\tvoid registerHost(const Flow::Value& arg)\n\t{\n\t\tif (arg.type() == Flow::Value::ARRAY) {\n\t\t\tconst Flow::Value* args = arg.toArray();\n\t\t\tif (args[0].isVoid() || args[1].isVoid() || !args[2].isVoid())\n\t\t\t\treturn;\n\n\t\t\tconst Flow::Value& fqdn = args[0];\n\t\t\tconst Flow::Value& proc = args[1];\n\n\t\t\tif (!fqdn.isString())\n\t\t\t\treturn;\n\n\t\t\tif (!proc.isFunction())\n\t\t\t\treturn;\n\n\t\t\tregisterHost(fqdn.toString(), proc.toFunction());\n\t\t}\n\t}\n\n\tvoid registerHost(const char *fqdn, Flow::Value::Function handler)\n\t{\n\t\tif (strchr(fqdn, ':'))\n\t\t\tqualifiedHosts_[fqdn] = handler;\n\t\telse\n\t\t\tunqualifiedHosts_[fqdn] = handler;\n\t}\n\n\tbool mapRequest(x0::HttpRequest *r, const x0::Params& args)\n\t{\n\t\tauto i = qualifiedHosts_.find(r->hostid());\n\t\tif (i != qualifiedHosts_.end())\n\t\t\treturn i->second(r);\n\n\t\tauto k = unqualifiedHosts_.find(r->hostname.str());\n\t\tif (k != unqualifiedHosts_.end())\n\t\t\treturn k->second(r);\n\n\t\treturn false;\n\t}\n};\n\nX0_EXPORT_PLUGIN(vhost)\n<|endoftext|>"} {"text":"<commit_before>#include \"process_command_line_arguments.h\"\n#include \"get_code.h\"\n#include \"parse.h\"\n#include \"translate.h\"\n#include <iostream>\n#include <boost\/property_tree\/ptree.hpp>\n#include <boost\/property_tree\/xml_parser.hpp>\n#include <boost\/format.hpp>\n\nusing namespace thewizardplusplus::wizard_basic_3;\nusing namespace boost;\nusing namespace boost::property_tree;\n\nconst auto XML_INDENT_SYMBOL = ' ';\nconst auto XML_INDENT_SIZE = 4;\n\ntemplate<FinalStage final_stage, typename ResultType>\nvoid ProcessResult(\n\tCommandLineArguments command_line_arguments,\n\tResultType result\n) {\n\tif (command_line_arguments.final_stage == final_stage) {\n\t\tstd::cout << result << '\\n';\n\t\tstd::exit(EXIT_SUCCESS);\n\t}\n}\n\nint main(int number_of_arguments, char* arguments[]) try {\n\tconst auto command_line_arguments = ProcessCommandLineArguments(\n\t\tnumber_of_arguments,\n\t\targuments\n\t);\n\n\tconst auto code = GetCode(command_line_arguments.script_file);\n\tProcessResult<FinalStage::CODE>(command_line_arguments, code);\n\n\tconst auto ast = Parse(code);\n\tProcessResult<FinalStage::AST>(\n\t\tcommand_line_arguments,\n\t\t([&] () -> std::string {\n\t\t\tstd::stringstream source;\n\t\t\tsource << ast;\n\n\t\t\tptree property_tree;\n\t\t\tread_xml(source, property_tree);\n\n\t\t\tstd::ostringstream out;\n\t\t\twrite_xml(\n\t\t\t\tout,\n\t\t\t\tproperty_tree,\n\t\t\t\txml_writer_make_settings<ptree::key_type>(\n\t\t\t\t\tXML_INDENT_SYMBOL,\n\t\t\t\t\tXML_INDENT_SIZE\n\t\t\t\t)\n\t\t\t);\n\n\t\t\treturn out.str();\n\t\t})()\n\t);\n\n\tconst auto ansi_c = Translate(ast);\n\tProcessResult<FinalStage::ANSI_C>(command_line_arguments, ansi_c);\n} catch (const std::exception& exception) {\n\tstd::cerr << (format(\"Error: %s.\\n\") % exception.what()).str();\n}\n<commit_msg>Correct of AST formatting.<commit_after>#include \"process_command_line_arguments.h\"\n#include \"get_code.h\"\n#include \"parse.h\"\n#include \"translate.h\"\n#include <iostream>\n#include <boost\/property_tree\/ptree.hpp>\n#include <boost\/property_tree\/xml_parser.hpp>\n#include <boost\/format.hpp>\n\nusing namespace thewizardplusplus::wizard_basic_3;\nusing namespace boost;\nusing namespace boost::property_tree;\n\nconst auto XML_INDENT_SYMBOL = ' ';\nconst auto XML_INDENT_SIZE = 4;\n\ntemplate<FinalStage final_stage, typename ResultType>\nvoid ProcessResult(\n\tCommandLineArguments command_line_arguments,\n\tResultType result\n) {\n\tif (command_line_arguments.final_stage == final_stage) {\n\t\tstd::cout << result << '\\n';\n\t\tstd::exit(EXIT_SUCCESS);\n\t}\n}\n\nint main(int number_of_arguments, char* arguments[]) try {\n\tconst auto command_line_arguments = ProcessCommandLineArguments(\n\t\tnumber_of_arguments,\n\t\targuments\n\t);\n\n\tconst auto code = GetCode(command_line_arguments.script_file);\n\tProcessResult<FinalStage::CODE>(command_line_arguments, code);\n\n\tconst auto ast = Parse(code);\n\tProcessResult<FinalStage::AST>(\n\t\tcommand_line_arguments,\n\t\t([&] () -> std::string {\n\t\t\tstd::stringstream source;\n\t\t\tsource << ast;\n\n\t\t\tptree property_tree;\n\t\t\tread_xml(source, property_tree);\n\n\t\t\tstd::ostringstream out;\n\t\t\twrite_xml(\n\t\t\t\tout,\n\t\t\t\tproperty_tree,\n\t\t\t\txml_writer_make_settings(XML_INDENT_SYMBOL, XML_INDENT_SIZE)\n\t\t\t);\n\n\t\t\treturn out.str();\n\t\t})()\n\t);\n\n\tconst auto ansi_c = Translate(ast);\n\tProcessResult<FinalStage::ANSI_C>(command_line_arguments, ansi_c);\n} catch (const std::exception& exception) {\n\tstd::cerr << (format(\"Error: %s.\\n\") % exception.what()).str();\n}\n<|endoftext|>"} {"text":"<commit_before><commit_msg>Support drop of mails on todo list.<commit_after><|endoftext|>"} {"text":"<commit_before>#include \"Example1.h\"\n\n#include <FrameView.h>\n#include <TextLabel.h>\n#include <LinearLayout.h>\n#include <Button.h>\n#include <ScrollLayout.h>\n#include <Switch.h>\n#include <TextField.h>\n#include <ImageElement.h>\n\n#include <iostream>\n\nusing namespace std;\n\nExample1::Example1() : FWApplication(\"com.sometrik.example1\")\n{\n auto view = std::make_shared<FrameView>();\n view->style(\"background-color\", \"#cccccc\");\n addChild(view);\n \n auto layout = std::make_shared<LinearLayout>(FW_VERTICAL);\n view->addChild(layout);\n\n auto image = std::make_shared<ImageElement>(\"test.png\");\n layout->addChild(image);\n\n auto title = make_shared<TextLabel>(\"Hello again!\", 1234);\n title->style(\"font-size\", 20);\n title->style(\"background-color\", \"#e03030\");\n title->style(\"shadow\", 5);\n title->style(\"border\", \"#401010\");\n title->style(\"border-radius\", 5);\n layout->addChild(title);\n\n auto nameLayout = make_shared<LinearLayout>(FW_HORIZONTAL);\n layout->addChild(nameLayout);\n nameLayout->addChild(make_shared<TextLabel>(\"Kirjoita nimesi:\"));\n \n textField = make_shared<TextField>();\n nameLayout->addChild(textField);\n \n layout->addChild(make_shared<Switch>(\"On\", \"Off\"));\n\n auto buttonLayout = std::make_shared<LinearLayout>(FW_HORIZONTAL);\n buttonLayout->addChild(make_shared<Button>(\"Click me!\"));\n buttonLayout->addChild(make_shared<Button>(\"Cancel\"));\n buttonLayout->addChild(make_shared<Button>(\"Button\"));\n layout->addChild(buttonLayout);\n\n auto scrollLayout = std::make_shared<ScrollLayout>();\n scrollLayout->style(\"min-height\", 200);\n layout->addChild(scrollLayout);\n auto scrollContent = std::make_shared<LinearLayout>(FW_VERTICAL);\n scrollLayout->addChild(scrollContent);\n \n for (int i = 0; i < 100; i++) {\n scrollContent->addChild(std::make_shared<TextLabel>(\"Number: \" + to_string(i)));\n }\n \n}\n\nvoid\nExample1::onCommandEvent(CommandEvent & ev) {\n getLogger().println(\"got command event \" + textField->getValue());\n \n getChildById(1234).text(\"Hello \" + textField->getValue() + \"!\");\n}\n\n\nFWApplication * applicationMain() {\n return new Example1(); \n}\n<commit_msg>make border lighter<commit_after>#include \"Example1.h\"\n\n#include <FrameView.h>\n#include <TextLabel.h>\n#include <LinearLayout.h>\n#include <Button.h>\n#include <ScrollLayout.h>\n#include <Switch.h>\n#include <TextField.h>\n#include <ImageElement.h>\n\n#include <iostream>\n\nusing namespace std;\n\nExample1::Example1() : FWApplication(\"com.sometrik.example1\")\n{\n auto view = std::make_shared<FrameView>();\n view->style(\"background-color\", \"#cccccc\");\n addChild(view);\n \n auto layout = std::make_shared<LinearLayout>(FW_VERTICAL);\n view->addChild(layout);\n\n auto image = std::make_shared<ImageElement>(\"test.png\");\n layout->addChild(image);\n\n auto title = make_shared<TextLabel>(\"Hello again!\", 1234);\n title->style(\"font-size\", 20);\n title->style(\"background-color\", \"#e03030\");\n title->style(\"shadow\", 5);\n title->style(\"border\", \"#801010\");\n title->style(\"border-radius\", 5);\n layout->addChild(title);\n\n auto nameLayout = make_shared<LinearLayout>(FW_HORIZONTAL);\n layout->addChild(nameLayout);\n nameLayout->addChild(make_shared<TextLabel>(\"Kirjoita nimesi:\"));\n \n textField = make_shared<TextField>();\n nameLayout->addChild(textField);\n \n layout->addChild(make_shared<Switch>(\"On\", \"Off\"));\n\n auto buttonLayout = std::make_shared<LinearLayout>(FW_HORIZONTAL);\n buttonLayout->addChild(make_shared<Button>(\"Click me!\"));\n buttonLayout->addChild(make_shared<Button>(\"Cancel\"));\n buttonLayout->addChild(make_shared<Button>(\"Button\"));\n layout->addChild(buttonLayout);\n\n auto scrollLayout = std::make_shared<ScrollLayout>();\n scrollLayout->style(\"min-height\", 200);\n layout->addChild(scrollLayout);\n auto scrollContent = std::make_shared<LinearLayout>(FW_VERTICAL);\n scrollLayout->addChild(scrollContent);\n \n for (int i = 0; i < 100; i++) {\n scrollContent->addChild(std::make_shared<TextLabel>(\"Number: \" + to_string(i)));\n }\n \n}\n\nvoid\nExample1::onCommandEvent(CommandEvent & ev) {\n getLogger().println(\"got command event \" + textField->getValue());\n \n getChildById(1234).text(\"Hello \" + textField->getValue() + \"!\");\n}\n\n\nFWApplication * applicationMain() {\n return new Example1(); \n}\n<|endoftext|>"} {"text":"<commit_before>\/** @file\n\n A brief file description\n\n @section license License\n\n Licensed to the Apache Software Foundation (ASF) under one\n or more contributor license agreements. See the NOTICE file\n distributed with this work for additional information\n regarding copyright ownership. The ASF licenses this file\n to you under the Apache License, Version 2.0 (the\n \"License\"); you may not use this file except in compliance\n with the License. You may obtain a copy of the License at\n\n http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n\n Unless required by applicable law or agreed to in writing, software\n distributed under the License is distributed on an \"AS IS\" BASIS,\n WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n See the License for the specific language governing permissions and\n limitations under the License.\n *\/\n\n\/**************************************************************************\n Connections\n\n Commonality across all platforms -- move out as required.\n\n**************************************************************************\/\n\n#include \"ink_unused.h\" \/* MAGIC_EDITING_TAG *\/\n#include \"inktomi++.h\"\n\n#include \"P_Net.h\"\n\n#define SET_TCP_NO_DELAY\n#define SET_NO_LINGER\n\/\/ set in the OS\n\/\/ #define RECV_BUF_SIZE (1024*64)\n\/\/ #define SEND_BUF_SIZE (1024*64)\n#define FIRST_RANDOM_PORT 16000\n#define LAST_RANDOM_PORT 32000\n\n#define ROUNDUP(x, y) ((((x)+((y)-1))\/(y))*(y))\n\nint\nget_listen_backlog(void)\n{\n int listen_backlog = 1024;\n\n IOCORE_ReadConfigInteger(listen_backlog, \"proxy.config.net.listen_backlog\");\n return listen_backlog;\n};\n\n\n\/\/\n\/\/ Functions\n\/\/\nchar const*\nNetVCOptions::toString(addr_bind_style s) {\n return ANY_ADDR == s ? \"any\"\n : INTF_ADDR == s ? \"interface\"\n : \"foreign\"\n ;\n}\n\nConnection::Connection()\n : fd(NO_FD)\n , is_bound(false)\n , is_connected(false)\n{\n memset(&sa, 0, sizeof(struct sockaddr_in));\n}\n\n\nConnection::~Connection()\n{\n close();\n}\n\n\nint\nServer::accept(Connection * c)\n{\n int res = 0;\n socklen_t sz = sizeof(c->sa);\n\n res = socketManager.accept(fd, (struct sockaddr *)&c->sa, &sz);\n if (res < 0)\n return res;\n c->fd = res;\n\n#ifdef SET_CLOSE_ON_EXEC\n if ((res = safe_fcntl(fd, F_SETFD, 1)) < 0)\n goto Lerror;\n#endif\n if ((res = safe_nonblocking(c->fd)) < 0)\n goto Lerror;\n#ifdef SEND_BUF_SIZE\n socketManager.set_sndbuf_size(c->fd, SEND_BUF_SIZE);\n#endif\n#ifdef SET_SO_KEEPALIVE\n \/\/ enables 2 hour inactivity probes, also may fix IRIX FIN_WAIT_2 leak\n if ((res = safe_setsockopt(fd, SOL_SOCKET, SO_KEEPALIVE, ON, sizeof(int))) < 0)\n goto Lerror;\n#endif\n\n return 0;\nLerror:\n c->close();\n return res;\n}\n\n\nint\nConnection::close()\n{\n is_connected = false;\n is_bound = false;\n \/\/ don't close any of the standards\n if (fd >= 2) {\n int fd_save = fd;\n fd = NO_FD;\n return socketManager.close(fd_save);\n } else {\n fd = NO_FD;\n return -EBADF;\n }\n}\n\nint\nServer::setup_fd_for_listen(bool non_blocking, int recv_bufsize, int send_bufsize)\n{\n int res = 0;\n#ifdef SEND_BUF_SIZE\n {\n int send_buf_size = SEND_BUF_SIZE;\n if ((res = safe_setsockopt(fd, SOL_SOCKET, SO_SNDBUF, (char *) &send_buf_size, sizeof(int)) < 0))\n goto Lerror;\n }\n#endif\n#ifdef RECV_BUF_SIZE\n {\n int recv_buf_size = RECV_BUF_SIZE;\n if ((res = safe_setsockopt(fd, SOL_SOCKET, SO_RCVBUF, (char *) &recv_buf_size, sizeof(int))) < 0)\n goto Lerror;\n }\n#endif\n\n if (recv_bufsize) {\n \/\/ coverity[negative_sink_in_call]\n if (socketManager.set_rcvbuf_size(fd, recv_bufsize)) {\n \/\/ Round down until success\n int rbufsz = ROUNDUP(recv_bufsize, 1024);\n while (rbufsz) {\n if (socketManager.set_rcvbuf_size(fd, rbufsz)) {\n rbufsz -= 1024;\n } else {\n break;\n }\n }\n }\n }\n if (send_bufsize) {\n if (socketManager.set_sndbuf_size(fd, send_bufsize)) {\n \/\/ Round down until success\n int sbufsz = ROUNDUP(send_bufsize, 1024);\n while (sbufsz) {\n if (socketManager.set_sndbuf_size(fd, sbufsz)) {\n sbufsz -= 1024;\n } else {\n break;\n }\n }\n }\n }\n#ifdef SET_NO_LINGER\n {\n struct linger l;\n l.l_onoff = 0;\n l.l_linger = 0;\n if ((res = safe_setsockopt(fd, SOL_SOCKET, SO_LINGER, (char *) &l, sizeof(l))) < 0)\n goto Lerror;\n }\n#endif\n#ifdef SET_TCP_NO_DELAY\n if ((res = safe_setsockopt(fd, IPPROTO_TCP, TCP_NODELAY, ON, sizeof(int))) < 0)\n goto Lerror;\n#endif\n#ifdef SET_SO_KEEPALIVE\n \/\/ enables 2 hour inactivity probes, also may fix IRIX FIN_WAIT_2 leak\n if ((res = safe_setsockopt(fd, SOL_SOCKET, SO_KEEPALIVE, ON, sizeof(int))) < 0)\n goto Lerror;\n#endif\n\n#if defined(linux)\n if (NetProcessor::accept_mss > 0)\n if ((res = safe_setsockopt(fd, IPPROTO_TCP, TCP_MAXSEG, (char *) &NetProcessor::accept_mss, sizeof(int)) < 0))\n goto Lerror;\n#endif\n\n \/*\n * dg: this has been removed since the ISS patch under solaris seems\n * to not like the socket being listened on twice. This is first done\n * in the manager when the socket is created.\n *\/\n if (non_blocking)\n if ((res = safe_nonblocking(fd)) < 0)\n goto Lerror;\n {\n int namelen = sizeof(sa);\n if ((res = safe_getsockname(fd, (struct sockaddr *) &sa, &namelen)))\n goto Lerror;\n }\n return 0;\nLerror:\n res = -errno;\n \/\/ coverity[check_after_sink]\n if (fd != NO_FD)\n close();\n return res;\n}\n\n\nint\nServer::listen(int port_number, bool non_blocking, int recv_bufsize, int send_bufsize)\n{\n ink_assert(fd == NO_FD);\n int res = 0;\n\n res = socketManager.socket(AF_INET, SOCK_STREAM, 0);\n if (res < 0)\n return res;\n fd = res;\n\n#ifdef SEND_BUF_SIZE\n {\n int send_buf_size = SEND_BUF_SIZE;\n if ((res = safe_setsockopt(fd, SOL_SOCKET, SO_SNDBUF, (char *) &send_buf_size, sizeof(int)) < 0))\n goto Lerror;\n }\n#endif\n#ifdef RECV_BUF_SIZE\n {\n int recv_buf_size = RECV_BUF_SIZE;\n if ((res = safe_setsockopt(fd, SOL_SOCKET, SO_RCVBUF, (char *) &recv_buf_size, sizeof(int))) < 0)\n goto Lerror;\n }\n#endif\n\n if (recv_bufsize) {\n if (socketManager.set_rcvbuf_size(fd, recv_bufsize)) {\n \/\/ Round down until success\n int rbufsz = ROUNDUP(recv_bufsize, 1024);\n while (rbufsz) {\n if (socketManager.set_rcvbuf_size(fd, rbufsz)) {\n rbufsz -= 1024;\n } else {\n break;\n }\n }\n }\n }\n if (send_bufsize) {\n if (socketManager.set_sndbuf_size(fd, send_bufsize)) {\n \/\/ Round down until success\n int sbufsz = ROUNDUP(send_bufsize, 1024);\n while (sbufsz) {\n if (socketManager.set_sndbuf_size(fd, sbufsz)) {\n sbufsz -= 1024;\n } else {\n break;\n }\n }\n }\n }\n#ifdef SET_CLOSE_ON_EXEC\n if ((res = safe_fcntl(fd, F_SETFD, 1)) < 0)\n goto Lerror;\n#endif\n\n memset(&sa, 0, sizeof(sa));\n \/\/\n \/\/ Accept_ip should already be in network byte order..\n \/\/\n sa.sin_addr.s_addr = accept_ip;\n sa.sin_port = htons(port_number);\n sa.sin_family = AF_INET;\n\n#ifdef SET_NO_LINGER\n {\n struct linger l;\n l.l_onoff = 0;\n l.l_linger = 0;\n if ((res = safe_setsockopt(fd, SOL_SOCKET, SO_LINGER, (char *) &l, sizeof(l))) < 0)\n goto Lerror;\n }\n#endif\n\n if ((res = safe_setsockopt(fd, SOL_SOCKET, SO_REUSEADDR, ON, sizeof(int))) < 0)\n goto Lerror;\n\n if ((res = socketManager.ink_bind(fd, (struct sockaddr *) &sa, sizeof(sa), IPPROTO_TCP)) < 0) {\n goto Lerror;\n }\n#ifdef SET_TCP_NO_DELAY\n if ((res = safe_setsockopt(fd, IPPROTO_TCP, TCP_NODELAY, ON, sizeof(int))) < 0)\n goto Lerror;\n#endif\n#ifdef SET_SO_KEEPALIVE\n \/\/ enables 2 hour inactivity probes, also may fix IRIX FIN_WAIT_2 leak\n if ((res = safe_setsockopt(fd, SOL_SOCKET, SO_KEEPALIVE, ON, sizeof(int))) < 0)\n goto Lerror;\n#endif\n\n#if defined(linux)\n if (NetProcessor::accept_mss > 0)\n if ((res = safe_setsockopt(fd, IPPROTO_TCP, TCP_MAXSEG, (char *) &NetProcessor::accept_mss, sizeof(int))) < 0)\n goto Lerror;\n#endif\n\n if ((res = safe_listen(fd, get_listen_backlog())) < 0)\n goto Lerror;\n if (non_blocking)\n if ((res = safe_nonblocking(fd)) < 0)\n goto Lerror;\n if (!port_number) {\n int namelen = sizeof(sa);\n if ((res = safe_getsockname(fd, (struct sockaddr *) &sa, &namelen)))\n goto Lerror;\n }\n return 0;\n\nLerror:\n if (fd != NO_FD)\n close();\n return res;\n}\n<commit_msg>TS-247: Errors on failing to bind \/ listen on a specified port.<commit_after>\/** @file\n\n A brief file description\n\n @section license License\n\n Licensed to the Apache Software Foundation (ASF) under one\n or more contributor license agreements. See the NOTICE file\n distributed with this work for additional information\n regarding copyright ownership. The ASF licenses this file\n to you under the Apache License, Version 2.0 (the\n \"License\"); you may not use this file except in compliance\n with the License. You may obtain a copy of the License at\n\n http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n\n Unless required by applicable law or agreed to in writing, software\n distributed under the License is distributed on an \"AS IS\" BASIS,\n WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n See the License for the specific language governing permissions and\n limitations under the License.\n *\/\n\n\/**************************************************************************\n Connections\n\n Commonality across all platforms -- move out as required.\n\n**************************************************************************\/\n\n#include \"ink_unused.h\" \/* MAGIC_EDITING_TAG *\/\n#include \"inktomi++.h\"\n\n#include \"P_Net.h\"\n\n#define SET_TCP_NO_DELAY\n#define SET_NO_LINGER\n\/\/ set in the OS\n\/\/ #define RECV_BUF_SIZE (1024*64)\n\/\/ #define SEND_BUF_SIZE (1024*64)\n#define FIRST_RANDOM_PORT 16000\n#define LAST_RANDOM_PORT 32000\n\n#define ROUNDUP(x, y) ((((x)+((y)-1))\/(y))*(y))\n\nint\nget_listen_backlog(void)\n{\n int listen_backlog = 1024;\n\n IOCORE_ReadConfigInteger(listen_backlog, \"proxy.config.net.listen_backlog\");\n return listen_backlog;\n};\n\n\n\/\/\n\/\/ Functions\n\/\/\nchar const*\nNetVCOptions::toString(addr_bind_style s) {\n return ANY_ADDR == s ? \"any\"\n : INTF_ADDR == s ? \"interface\"\n : \"foreign\"\n ;\n}\n\nConnection::Connection()\n : fd(NO_FD)\n , is_bound(false)\n , is_connected(false)\n{\n memset(&sa, 0, sizeof(struct sockaddr_in));\n}\n\n\nConnection::~Connection()\n{\n close();\n}\n\n\nint\nServer::accept(Connection * c)\n{\n int res = 0;\n socklen_t sz = sizeof(c->sa);\n\n res = socketManager.accept(fd, (struct sockaddr *)&c->sa, &sz);\n if (res < 0)\n return res;\n c->fd = res;\n\n#ifdef SET_CLOSE_ON_EXEC\n if ((res = safe_fcntl(fd, F_SETFD, 1)) < 0)\n goto Lerror;\n#endif\n if ((res = safe_nonblocking(c->fd)) < 0)\n goto Lerror;\n#ifdef SEND_BUF_SIZE\n socketManager.set_sndbuf_size(c->fd, SEND_BUF_SIZE);\n#endif\n#ifdef SET_SO_KEEPALIVE\n \/\/ enables 2 hour inactivity probes, also may fix IRIX FIN_WAIT_2 leak\n if ((res = safe_setsockopt(fd, SOL_SOCKET, SO_KEEPALIVE, ON, sizeof(int))) < 0)\n goto Lerror;\n#endif\n\n return 0;\nLerror:\n c->close();\n return res;\n}\n\n\nint\nConnection::close()\n{\n is_connected = false;\n is_bound = false;\n \/\/ don't close any of the standards\n if (fd >= 2) {\n int fd_save = fd;\n fd = NO_FD;\n return socketManager.close(fd_save);\n } else {\n fd = NO_FD;\n return -EBADF;\n }\n}\n\nint\nServer::setup_fd_for_listen(bool non_blocking, int recv_bufsize, int send_bufsize)\n{\n int res = 0;\n#ifdef SEND_BUF_SIZE\n {\n int send_buf_size = SEND_BUF_SIZE;\n if ((res = safe_setsockopt(fd, SOL_SOCKET, SO_SNDBUF, (char *) &send_buf_size, sizeof(int)) < 0))\n goto Lerror;\n }\n#endif\n#ifdef RECV_BUF_SIZE\n {\n int recv_buf_size = RECV_BUF_SIZE;\n if ((res = safe_setsockopt(fd, SOL_SOCKET, SO_RCVBUF, (char *) &recv_buf_size, sizeof(int))) < 0)\n goto Lerror;\n }\n#endif\n\n if (recv_bufsize) {\n \/\/ coverity[negative_sink_in_call]\n if (socketManager.set_rcvbuf_size(fd, recv_bufsize)) {\n \/\/ Round down until success\n int rbufsz = ROUNDUP(recv_bufsize, 1024);\n while (rbufsz) {\n if (socketManager.set_rcvbuf_size(fd, rbufsz)) {\n rbufsz -= 1024;\n } else {\n break;\n }\n }\n }\n }\n if (send_bufsize) {\n if (socketManager.set_sndbuf_size(fd, send_bufsize)) {\n \/\/ Round down until success\n int sbufsz = ROUNDUP(send_bufsize, 1024);\n while (sbufsz) {\n if (socketManager.set_sndbuf_size(fd, sbufsz)) {\n sbufsz -= 1024;\n } else {\n break;\n }\n }\n }\n }\n#ifdef SET_NO_LINGER\n {\n struct linger l;\n l.l_onoff = 0;\n l.l_linger = 0;\n if ((res = safe_setsockopt(fd, SOL_SOCKET, SO_LINGER, (char *) &l, sizeof(l))) < 0)\n goto Lerror;\n }\n#endif\n#ifdef SET_TCP_NO_DELAY\n if ((res = safe_setsockopt(fd, IPPROTO_TCP, TCP_NODELAY, ON, sizeof(int))) < 0)\n goto Lerror;\n#endif\n#ifdef SET_SO_KEEPALIVE\n \/\/ enables 2 hour inactivity probes, also may fix IRIX FIN_WAIT_2 leak\n if ((res = safe_setsockopt(fd, SOL_SOCKET, SO_KEEPALIVE, ON, sizeof(int))) < 0)\n goto Lerror;\n#endif\n\n#if defined(linux)\n if (NetProcessor::accept_mss > 0)\n if ((res = safe_setsockopt(fd, IPPROTO_TCP, TCP_MAXSEG, (char *) &NetProcessor::accept_mss, sizeof(int)) < 0))\n goto Lerror;\n#endif\n\n \/*\n * dg: this has been removed since the ISS patch under solaris seems\n * to not like the socket being listened on twice. This is first done\n * in the manager when the socket is created.\n *\/\n if (non_blocking)\n if ((res = safe_nonblocking(fd)) < 0)\n goto Lerror;\n {\n int namelen = sizeof(sa);\n if ((res = safe_getsockname(fd, (struct sockaddr *) &sa, &namelen)))\n goto Lerror;\n }\n return 0;\nLerror:\n res = -errno;\n \/\/ coverity[check_after_sink]\n if (fd != NO_FD)\n close();\n return res;\n}\n\n\nint\nServer::listen(int port_number, bool non_blocking, int recv_bufsize, int send_bufsize)\n{\n ink_assert(fd == NO_FD);\n int res = 0;\n\n res = socketManager.socket(AF_INET, SOCK_STREAM, 0);\n if (res < 0)\n return res;\n fd = res;\n\n#ifdef SEND_BUF_SIZE\n {\n int send_buf_size = SEND_BUF_SIZE;\n if ((res = safe_setsockopt(fd, SOL_SOCKET, SO_SNDBUF, (char *) &send_buf_size, sizeof(int)) < 0))\n goto Lerror;\n }\n#endif\n#ifdef RECV_BUF_SIZE\n {\n int recv_buf_size = RECV_BUF_SIZE;\n if ((res = safe_setsockopt(fd, SOL_SOCKET, SO_RCVBUF, (char *) &recv_buf_size, sizeof(int))) < 0)\n goto Lerror;\n }\n#endif\n\n if (recv_bufsize) {\n if (socketManager.set_rcvbuf_size(fd, recv_bufsize)) {\n \/\/ Round down until success\n int rbufsz = ROUNDUP(recv_bufsize, 1024);\n while (rbufsz) {\n if (socketManager.set_rcvbuf_size(fd, rbufsz)) {\n rbufsz -= 1024;\n } else {\n break;\n }\n }\n }\n }\n if (send_bufsize) {\n if (socketManager.set_sndbuf_size(fd, send_bufsize)) {\n \/\/ Round down until success\n int sbufsz = ROUNDUP(send_bufsize, 1024);\n while (sbufsz) {\n if (socketManager.set_sndbuf_size(fd, sbufsz)) {\n sbufsz -= 1024;\n } else {\n break;\n }\n }\n }\n }\n#ifdef SET_CLOSE_ON_EXEC\n if ((res = safe_fcntl(fd, F_SETFD, 1)) < 0)\n goto Lerror;\n#endif\n\n memset(&sa, 0, sizeof(sa));\n \/\/\n \/\/ Accept_ip should already be in network byte order..\n \/\/\n sa.sin_addr.s_addr = accept_ip;\n sa.sin_port = htons(port_number);\n sa.sin_family = AF_INET;\n\n#ifdef SET_NO_LINGER\n {\n struct linger l;\n l.l_onoff = 0;\n l.l_linger = 0;\n if ((res = safe_setsockopt(fd, SOL_SOCKET, SO_LINGER, (char *) &l, sizeof(l))) < 0)\n goto Lerror;\n }\n#endif\n\n if ((res = safe_setsockopt(fd, SOL_SOCKET, SO_REUSEADDR, ON, sizeof(int))) < 0)\n goto Lerror;\n\n if ((res = socketManager.ink_bind(fd, (struct sockaddr *) &sa, sizeof(sa), IPPROTO_TCP)) < 0) {\n goto Lerror;\n }\n#ifdef SET_TCP_NO_DELAY\n if ((res = safe_setsockopt(fd, IPPROTO_TCP, TCP_NODELAY, ON, sizeof(int))) < 0)\n goto Lerror;\n#endif\n#ifdef SET_SO_KEEPALIVE\n \/\/ enables 2 hour inactivity probes, also may fix IRIX FIN_WAIT_2 leak\n if ((res = safe_setsockopt(fd, SOL_SOCKET, SO_KEEPALIVE, ON, sizeof(int))) < 0)\n goto Lerror;\n#endif\n\n#if defined(linux)\n if (NetProcessor::accept_mss > 0)\n if ((res = safe_setsockopt(fd, IPPROTO_TCP, TCP_MAXSEG, (char *) &NetProcessor::accept_mss, sizeof(int))) < 0)\n goto Lerror;\n#endif\n\n if ((res = safe_listen(fd, get_listen_backlog())) < 0)\n goto Lerror;\n if (non_blocking)\n if ((res = safe_nonblocking(fd)) < 0)\n goto Lerror;\n if (!port_number) {\n int namelen = sizeof(sa);\n if ((res = safe_getsockname(fd, (struct sockaddr *) &sa, &namelen)))\n goto Lerror;\n }\n return 0;\n\nLerror:\n if (fd != NO_FD)\n close();\n MachineFatal(\"Could not bind or listen to port %d (error: %d)\", port_number, res);\n return res;\n}\n<|endoftext|>"} {"text":"<commit_before>\/\/ This is the program to simulate the dynamic of a rocking block by using the Siconos platform\n\/\/==================================================================================================================\n#include \"SiconosKernel.hpp\"\n#include <stdlib.h>\nusing namespace std;\n#define PI 3.14159\n#define GGearth 9.8100\n\/\/---------------------------------Decalre global variables ---------------------------------------------------\ndouble LengthBlock = 1.; \/\/ Length of the rocking block\ndouble HeightBlock = 1.5; \/\/ Height of the rocking block\nunsigned int Nfreedom = 3; \/\/ Number of degrees of freedom\nunsigned int Ncontact = 2; \/\/ Number of contacts\ndouble MassBlock = 1.0; \/\/ Mass of the rocking block\ndouble PosXiniPointA = 0.0; \/\/ Initial coordinate X of the point A\ndouble PosYiniPointA = 0.5; \/\/ Initial coordinate Y of the point A\ndouble AngleThetaIni = PI \/ 10.0; \/\/ Initial angle theta of the block\ndouble VelXiniPointA = 0.0 ; \/\/ Initial relative velocity Vx of the point A\ndouble VelYiniPointA = 0.0 ; \/\/ Initial relative velocity Vy of the point A\ndouble RotVelBlockIni = 0.0; \/\/ Initial angular velocity of the block\ndouble e = 0.5; \/\/ Restitution coefficient\ndouble TimeInitial = 0.0; \/\/ Initial time of the simulation\ndouble TimeFinal = 2.0; \/\/ Final time of the simulation\ndouble StepSize = 0.01; \/\/ Time step size\nunsigned int NpointSave = 200; \/\/\nunsigned int SizeOutput = 9; \/\/\ndouble criterion = 0.05;\nunsigned int maxIter = 20000;\n\/\/==========================================================================================================\n\/\/ Main function\n\/\/==========================================================================================================\nint main(int argc, char* argv[])\n{\n \/\/---------------------------- calculate the computation time --------------------------------------------------\n boost::timer time;\n time.restart();\n try\n {\n \/\/===========================================================================================================\n \/\/ I: Declare the dynamical systems\n \/\/===========================================================================================================\n DynamicalSystemsSet allDS;\n \/\/1. Set the mass matrix\n SP::SiconosMatrix Mass(new SimpleMatrix(Nfreedom, Nfreedom));\n double InertiaBlock;\n InertiaBlock = (MassBlock \/ 12.0) * (pow(HeightBlock, 2) + pow(LengthBlock, 2)); \/\/ moment of inertia\n (*Mass)(0, 0) = MassBlock;\n (*Mass)(1, 1) = MassBlock;\n (*Mass)(2, 2) = InertiaBlock;\n \/\/2. Set the initial position of the block in function of the initial position of the contact point A (left-hand contact)\n SP::SimpleVector PosIniBlock(new SimpleVector(Nfreedom));\n (*PosIniBlock)(0) = PosXiniPointA + 0.5 * LengthBlock * cos(AngleThetaIni) - 0.5 * HeightBlock * sin(AngleThetaIni);\n (*PosIniBlock)(1) = PosYiniPointA + 0.5 * LengthBlock * sin(AngleThetaIni) + 0.5 * HeightBlock * cos(AngleThetaIni);\n (*PosIniBlock)(2) = AngleThetaIni;\n\n (*PosIniBlock)(0) = 0.0;\n (*PosIniBlock)(1) = 1.;\n (*PosIniBlock)(2) = 0.2;\n\n \/\/3. Set the initial velocity of the block in function of the initial relative velocity of the contact point A\n SP::SimpleVector VelIniBlock(new SimpleVector(Nfreedom));\n (*VelIniBlock)(0) = VelXiniPointA - (0.5 * LengthBlock * sin(AngleThetaIni) + 0.5 * HeightBlock * cos(AngleThetaIni)) * RotVelBlockIni;\n (*VelIniBlock)(1) = VelYiniPointA + (0.5 * LengthBlock * cos(AngleThetaIni) - 0.5 * HeightBlock * sin(AngleThetaIni)) * RotVelBlockIni;\n (*VelIniBlock)(2) = RotVelBlockIni;\n \/*\n (*VelIniBlock)(0) = 0.0;\n (*VelIniBlock)(1) = 0.0;\n (*VelIniBlock)(2) = 0.0;\n *\/\n \/\/4. Instantiate the object of \"LagrangianTIDS\"\n SP::LagrangianLinearTIDS RockingBlock(new LagrangianLinearTIDS(PosIniBlock, VelIniBlock, Mass));\n \/\/5. Set the external force\n SP::SimpleVector ForceExtern(new SimpleVector(Nfreedom));\n (*ForceExtern)(1) = -MassBlock * GGearth;\n RockingBlock->setFExtPtr(ForceExtern);\n \/\/\n allDS.insert(RockingBlock);\n \/\/----------------------------- Display variables of the dynamical system---------------------------------------\n cout << \"Initial position of the rocking block:\" << endl;\n PosIniBlock->display();\n cout << \"Initial velocity of the rocking block:\" << endl;\n VelIniBlock->display();\n cout << \"Mass matrix of the rocking block:\" << endl;\n Mass->display();\n cout << \"External force applied on the rocking block:\" << endl;\n ForceExtern->display();\n \/\/==================================================================================================================\n \/\/ II: Declare the relation et interaction between dynamical systems\n \/\/==================================================================================================================\n InteractionsSet allInteractions;\n \/\/ Impact law\n SP::NonSmoothLaw nslaw(new NewtonImpactNSL(e));\n \/\/ Interaction at contact point 1\n SP::Relation relation1(new LagrangianScleronomousR(\"RockingBlockPlugin:h1\", \"RockingBlockPlugin:G1\"));\n SP::Interaction inter1(new Interaction(\"contact1\", allDS, 1, 1, nslaw, relation1));\n \/\/ Interaction at contact point 2\n SP::Relation relation2(new LagrangianScleronomousR(\"RockingBlockPlugin:h2\", \"RockingBlockPlugin:G2\"));\n SP::Interaction inter2(new Interaction(\"contact2\", allDS, 2, 1, nslaw, relation2));\n \/\/ Interactions for the whole dynamical system\n allInteractions.insert(inter1);\n allInteractions.insert(inter2);\n \/\/================================================================================================================\n \/\/ III. Create the \"model\" object\n \/\/================================================================================================================\n SP::Model RoBlockModel(new Model(TimeInitial, TimeFinal, allDS, allInteractions));\n \/\/================================================================================================================\n \/\/ IV. Create the simulation\n \/\/================================================================================================================\n \/\/1. Time discretization\n SP::TimeDiscretisation TimeDiscret(new TimeDiscretisation(TimeInitial, StepSize));\n \/\/2. Integration solver for one step\n SP::OneStepIntegrator OSI(new Moreau(allDS, 0.50001));\n \/\/3. Nonsmooth problem\n SP::OneStepNSProblem impact(new LCP());\n SP::OneStepNSProblem impact_pos(new MLCPProjectOnConstraints());\n \/\/4. Simulation with (1), (2), (3)\n SP::TimeStepping TSscheme(new TimeSteppingProjectOnConstraints(TimeDiscret, OSI, impact, impact_pos, 0));\n \/\/==================================================================================================================\n \/\/ V. Process the simulation\n \/\/==================================================================================================================\n \/\/ -------------------------------- Simulation initialization ------------------------------------------------------\n cout << \"====> Simulation initialisation ...\" << endl << endl;\n RoBlockModel->initialize(TSscheme); \/\/ initialize the model\n SP::SiconosVector PosBlock = RockingBlock->q(); \/\/ pointer points to the position vector of the rocking block\n SP::SiconosVector VelBlock = RockingBlock->velocity(); \/\/ pointer points to the velocity of the rocking block\n \/\/-------------------- Save the output during simulation ---------------------------------------------------------\n SimpleMatrix DataPlot(NpointSave, SizeOutput);\n \/\/------------- At the initial time -----------------------------------------------------------------------------\n DataPlot(0, 0) = RoBlockModel->t0();\n DataPlot(0, 1) = (*PosBlock)(0); \/\/ Position X\n DataPlot(0, 2) = (*PosBlock)(1); \/\/ Position Y\n DataPlot(0, 3) = (*PosBlock)(2); \/\/ Angle theta\n DataPlot(0, 4) = (*VelBlock)(0); \/\/ Velocity Vx\n DataPlot(0, 5) = (*VelBlock)(1); \/\/ Velocity Vy\n DataPlot(0, 6) = (*VelBlock)(2); \/\/ Angular velocity\n\n SP::SiconosVector tmp(new SimpleVector(Nfreedom));\n prod(*Mass, *VelBlock, *tmp, true);\n double kineticEnergy = 0.5 * inner_prod(*VelBlock, *tmp);\n DataPlot(0, 7) = kineticEnergy;\n\n SP::SiconosVector PosRef(new SimpleVector(Nfreedom));\n (*PosRef)(0) = 0.0;\n (*PosRef)(1) = HeightBlock \/ 2.0;\n (*PosRef)(2) = 0.0;\n double potentialEnergy = -1.0 * inner_prod(*PosBlock - *PosRef, *ForceExtern);\n DataPlot(0, 8) = potentialEnergy;\n\n \/\/----------------------------------- Simulation starts ----------------------------------------------------------\n cout << \"====> Start computation ... \" << endl << endl;\n unsigned int k = 1;\n boost::progress_display show_progress(NpointSave);\n while (k < NpointSave)\n {\n TSscheme->computeOneStep();\n DataPlot(k, 0) = TSscheme->nextTime();\n DataPlot(k, 1) = (*PosBlock)(0); \/\/Position X\n DataPlot(k, 2) = (*PosBlock)(1); \/\/Position Y\n DataPlot(k, 3) = (*PosBlock)(2); \/\/ Position theta\n DataPlot(k, 4) = (*VelBlock)(0); \/\/ Velocity Vx\n DataPlot(k, 5) = (*VelBlock)(1); \/\/ Velocity Vy\n DataPlot(k, 6) = (*VelBlock)(2); \/\/ Velocity Vtheta\n\n prod(*Mass, *VelBlock, *tmp, true);\n kineticEnergy = 0.5 * inner_prod(*VelBlock, *tmp);\n DataPlot(k, 7) = kineticEnergy;\n\n potentialEnergy = -1.0 * inner_prod(*PosBlock - *PosRef, *ForceExtern);\n DataPlot(k, 8) = potentialEnergy;\n\n \/\/ go to the next time step\n k++;\n ++show_progress;\n TSscheme->nextStep();\n };\n \/\/----------------------- At the end of the simulation --------------------------\n cout << \"End of the simulation\" << endl;\n cout << \"====> Output file writing ...\" << endl << endl;\n ioMatrix io(\"result.dat\", \"ascii\");\n io.write(DataPlot, \"noDim\");\n }\n \/\/============================== Catch exceptions ===================================================================\n catch (SiconosException e)\n {\n cout << e.report() << endl;\n }\n catch (...)\n {\n cout << \"Exception caught.\" << endl;\n }\n cout << \"Computation Time: \" << time.elapsed() << endl;\n}\n<commit_msg>add computation with lambda[0] and p[0] for NewtonEuler<commit_after>\/\/ This is the program to simulate the dynamic of a rocking block by using the Siconos platform\n\/\/==================================================================================================================\n#include \"SiconosKernel.hpp\"\n#include <stdlib.h>\nusing namespace std;\n#define PI 3.14159\n#define GGearth 9.8100\n\/\/---------------------------------Decalre global variables ---------------------------------------------------\ndouble LengthBlock = 1.; \/\/ Length of the rocking block\ndouble HeightBlock = 1.5; \/\/ Height of the rocking block\nunsigned int Nfreedom = 3; \/\/ Number of degrees of freedom\nunsigned int Ncontact = 2; \/\/ Number of contacts\ndouble MassBlock = 1.0; \/\/ Mass of the rocking block\ndouble PosXiniPointA = 0.0; \/\/ Initial coordinate X of the point A\ndouble PosYiniPointA = 0.5; \/\/ Initial coordinate Y of the point A\ndouble AngleThetaIni = PI \/ 10.0; \/\/ Initial angle theta of the block\ndouble VelXiniPointA = 0.0 ; \/\/ Initial relative velocity Vx of the point A\ndouble VelYiniPointA = 0.0 ; \/\/ Initial relative velocity Vy of the point A\ndouble RotVelBlockIni = 0.0; \/\/ Initial angular velocity of the block\ndouble e = 0.5; \/\/ Restitution coefficient\ndouble TimeInitial = 0.0; \/\/ Initial time of the simulation\ndouble TimeFinal = 2.0; \/\/ Final time of the simulation\ndouble StepSize = 0.01; \/\/ Time step size\nunsigned int NpointSave = 200; \/\/\nunsigned int SizeOutput = 9; \/\/\ndouble criterion = 0.05;\nunsigned int maxIter = 20000;\n\/\/==========================================================================================================\n\/\/ Main function\n\/\/==========================================================================================================\nint main(int argc, char* argv[])\n{\n \/\/---------------------------- calculate the computation time --------------------------------------------------\n boost::timer time;\n time.restart();\n try\n {\n \/\/===========================================================================================================\n \/\/ I: Declare the dynamical systems\n \/\/===========================================================================================================\n DynamicalSystemsSet allDS;\n \/\/1. Set the mass matrix\n SP::SiconosMatrix Mass(new SimpleMatrix(Nfreedom, Nfreedom));\n double InertiaBlock;\n InertiaBlock = (MassBlock \/ 12.0) * (pow(HeightBlock, 2) + pow(LengthBlock, 2)); \/\/ moment of inertia\n (*Mass)(0, 0) = MassBlock;\n (*Mass)(1, 1) = MassBlock;\n (*Mass)(2, 2) = InertiaBlock;\n \/\/2. Set the initial position of the block in function of the initial position of the contact point A (left-hand contact)\n SP::SimpleVector PosIniBlock(new SimpleVector(Nfreedom));\n (*PosIniBlock)(0) = PosXiniPointA + 0.5 * LengthBlock * cos(AngleThetaIni) - 0.5 * HeightBlock * sin(AngleThetaIni);\n (*PosIniBlock)(1) = PosYiniPointA + 0.5 * LengthBlock * sin(AngleThetaIni) + 0.5 * HeightBlock * cos(AngleThetaIni);\n (*PosIniBlock)(2) = AngleThetaIni;\n\n (*PosIniBlock)(0) = 0.0;\n (*PosIniBlock)(1) = 1.;\n (*PosIniBlock)(2) = 0.2;\n\n \/\/3. Set the initial velocity of the block in function of the initial relative velocity of the contact point A\n SP::SimpleVector VelIniBlock(new SimpleVector(Nfreedom));\n (*VelIniBlock)(0) = VelXiniPointA - (0.5 * LengthBlock * sin(AngleThetaIni) + 0.5 * HeightBlock * cos(AngleThetaIni)) * RotVelBlockIni;\n (*VelIniBlock)(1) = VelYiniPointA + (0.5 * LengthBlock * cos(AngleThetaIni) - 0.5 * HeightBlock * sin(AngleThetaIni)) * RotVelBlockIni;\n (*VelIniBlock)(2) = RotVelBlockIni;\n \/*\n (*VelIniBlock)(0) = 0.0;\n (*VelIniBlock)(1) = 0.0;\n (*VelIniBlock)(2) = 0.0;\n *\/\n \/\/4. Instantiate the object of \"LagrangianTIDS\"\n SP::LagrangianLinearTIDS RockingBlock(new LagrangianLinearTIDS(PosIniBlock, VelIniBlock, Mass));\n \/\/5. Set the external force\n SP::SimpleVector ForceExtern(new SimpleVector(Nfreedom));\n (*ForceExtern)(1) = -MassBlock * GGearth;\n RockingBlock->setFExtPtr(ForceExtern);\n \/\/\n allDS.insert(RockingBlock);\n \/\/----------------------------- Display variables of the dynamical system---------------------------------------\n cout << \"Initial position of the rocking block:\" << endl;\n PosIniBlock->display();\n cout << \"Initial velocity of the rocking block:\" << endl;\n VelIniBlock->display();\n cout << \"Mass matrix of the rocking block:\" << endl;\n Mass->display();\n cout << \"External force applied on the rocking block:\" << endl;\n ForceExtern->display();\n \/\/==================================================================================================================\n \/\/ II: Declare the relation et interaction between dynamical systems\n \/\/==================================================================================================================\n InteractionsSet allInteractions;\n \/\/ Impact law\n SP::NonSmoothLaw nslaw(new NewtonImpactNSL(e));\n \/\/ Interaction at contact point 1\n SP::Relation relation1(new LagrangianScleronomousR(\"RockingBlockPlugin:h1\", \"RockingBlockPlugin:G1\"));\n SP::Interaction inter1(new Interaction(\"contact1\", allDS, 1, 1, nslaw, relation1));\n \/\/ Interaction at contact point 2\n SP::Relation relation2(new LagrangianScleronomousR(\"RockingBlockPlugin:h2\", \"RockingBlockPlugin:G2\"));\n SP::Interaction inter2(new Interaction(\"contact2\", allDS, 2, 1, nslaw, relation2));\n \/\/ Interactions for the whole dynamical system\n allInteractions.insert(inter1);\n allInteractions.insert(inter2);\n \/\/================================================================================================================\n \/\/ III. Create the \"model\" object\n \/\/================================================================================================================\n SP::Model RoBlockModel(new Model(TimeInitial, TimeFinal, allDS, allInteractions));\n \/\/================================================================================================================\n \/\/ IV. Create the simulation\n \/\/================================================================================================================\n \/\/1. Time discretization\n SP::TimeDiscretisation TimeDiscret(new TimeDiscretisation(TimeInitial, StepSize));\n \/\/2. Integration solver for one step\n SP::MoreauProjectOnConstraintsOSI OSI(new MoreauProjectOnConstraintsOSI(allDS, 0.5001));\n \/\/3. Nonsmooth problem\n SP::OneStepNSProblem impact(new LCP());\n SP::OneStepNSProblem impact_pos(new MLCPProjectOnConstraints());\n \/\/4. Simulation with (1), (2), (3)\n SP::TimeStepping TSscheme(new TimeSteppingProjectOnConstraints(TimeDiscret, OSI, impact, impact_pos, 0));\n \/\/==================================================================================================================\n \/\/ V. Process the simulation\n \/\/==================================================================================================================\n \/\/ -------------------------------- Simulation initialization ------------------------------------------------------\n cout << \"====> Simulation initialisation ...\" << endl << endl;\n RoBlockModel->initialize(TSscheme); \/\/ initialize the model\n SP::SiconosVector PosBlock = RockingBlock->q(); \/\/ pointer points to the position vector of the rocking block\n SP::SiconosVector VelBlock = RockingBlock->velocity(); \/\/ pointer points to the velocity of the rocking block\n \/\/-------------------- Save the output during simulation ---------------------------------------------------------\n SimpleMatrix DataPlot(NpointSave, SizeOutput);\n \/\/------------- At the initial time -----------------------------------------------------------------------------\n DataPlot(0, 0) = RoBlockModel->t0();\n DataPlot(0, 1) = (*PosBlock)(0); \/\/ Position X\n DataPlot(0, 2) = (*PosBlock)(1); \/\/ Position Y\n DataPlot(0, 3) = (*PosBlock)(2); \/\/ Angle theta\n DataPlot(0, 4) = (*VelBlock)(0); \/\/ Velocity Vx\n DataPlot(0, 5) = (*VelBlock)(1); \/\/ Velocity Vy\n DataPlot(0, 6) = (*VelBlock)(2); \/\/ Angular velocity\n\n SP::SiconosVector tmp(new SimpleVector(Nfreedom));\n prod(*Mass, *VelBlock, *tmp, true);\n double kineticEnergy = 0.5 * inner_prod(*VelBlock, *tmp);\n DataPlot(0, 7) = kineticEnergy;\n\n SP::SiconosVector PosRef(new SimpleVector(Nfreedom));\n (*PosRef)(0) = 0.0;\n (*PosRef)(1) = HeightBlock \/ 2.0;\n (*PosRef)(2) = 0.0;\n double potentialEnergy = -1.0 * inner_prod(*PosBlock - *PosRef, *ForceExtern);\n DataPlot(0, 8) = potentialEnergy;\n\n \/\/----------------------------------- Simulation starts ----------------------------------------------------------\n cout << \"====> Start computation ... \" << endl << endl;\n unsigned int k = 1;\n boost::progress_display show_progress(NpointSave);\n while (k < NpointSave)\n {\n TSscheme->computeOneStep();\n DataPlot(k, 0) = TSscheme->nextTime();\n DataPlot(k, 1) = (*PosBlock)(0); \/\/Position X\n DataPlot(k, 2) = (*PosBlock)(1); \/\/Position Y\n DataPlot(k, 3) = (*PosBlock)(2); \/\/ Position theta\n DataPlot(k, 4) = (*VelBlock)(0); \/\/ Velocity Vx\n DataPlot(k, 5) = (*VelBlock)(1); \/\/ Velocity Vy\n DataPlot(k, 6) = (*VelBlock)(2); \/\/ Velocity Vtheta\n\n prod(*Mass, *VelBlock, *tmp, true);\n kineticEnergy = 0.5 * inner_prod(*VelBlock, *tmp);\n DataPlot(k, 7) = kineticEnergy;\n\n potentialEnergy = -1.0 * inner_prod(*PosBlock - *PosRef, *ForceExtern);\n DataPlot(k, 8) = potentialEnergy;\n\n \/\/ go to the next time step\n k++;\n ++show_progress;\n TSscheme->nextStep();\n };\n \/\/----------------------- At the end of the simulation --------------------------\n cout << \"End of the simulation\" << endl;\n cout << \"====> Output file writing ...\" << endl << endl;\n ioMatrix io(\"result.dat\", \"ascii\");\n io.write(DataPlot, \"noDim\");\n }\n \/\/============================== Catch exceptions ===================================================================\n catch (SiconosException e)\n {\n cout << e.report() << endl;\n }\n catch (...)\n {\n cout << \"Exception caught.\" << endl;\n }\n cout << \"Computation Time: \" << time.elapsed() << endl;\n}\n<|endoftext|>"} {"text":"<commit_before>\/*=========================================================================\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 \"otbWrapperCompositeApplication.h\"\n#include \"otbWrapperApplicationFactory.h\"\n\n\nnamespace otb\n{\nnamespace Wrapper\n{\n\nclass TrainImagesClassifier: public CompositeApplication\n{\npublic:\n \/** Standard class typedefs. *\/\n typedef TrainImagesClassifier 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 itkTypeMacro(TrainImagesClassifier, otb::Wrapper::CompositeApplication)\n\nprotected:\n\nprivate:\n\nvoid DoInit() ITK_OVERRIDE\n{\n SetName(\"TrainImagesClassifier\");\n SetDescription(\n \"Train a classifier from multiple pairs of images and training vector data.\");\n\n \/\/ Documentation\n SetDocName(\"Train a classifier from multiple images\");\n SetDocLongDescription(\n \"This application performs a classifier training from multiple pairs of input images and training vector data. \"\n \"Samples are composed of pixel values in each band optionally centered and reduced using an XML statistics file produced by \"\n \"the ComputeImagesStatistics application.\\n The training vector data must contain polygons with a positive integer field \"\n \"representing the class label. The name of this field can be set using the \\\"Class label field\\\" parameter. Training and validation \"\n \"sample lists are built such that each class is equally represented in both lists. One parameter allows controlling the ratio \"\n \"between the number of samples in training and validation sets. Two parameters allow managing the size of the training and \"\n \"validation sets per class and per image.\\n Several classifier parameters can be set depending on the chosen classifier. In the \"\n \"validation process, the confusion matrix is organized the following way: rows = reference labels, columns = produced labels. \"\n \"In the header of the optional confusion matrix output file, the validation (reference) and predicted (produced) class labels\"\n \" are ordered according to the rows\/columns of the confusion matrix.\\n This application is based on LibSVM and OpenCV Machine Learning \"\n \"(2.3.1 and later).\");\n SetDocLimitations(\"None\");\n SetDocAuthors(\"OTB-Team\");\n SetDocSeeAlso(\"OpenCV documentation for machine learning http:\/\/docs.opencv.org\/modules\/ml\/doc\/ml.html \");\n\n \/\/Group IO\n AddParameter(ParameterType_Group, \"io\", \"Input and output data\");\n SetParameterDescription(\"io\", \"This group of parameters allows setting input and output data.\");\n\n \/\/ Doc example parameter settings\n SetDocExampleParameterValue(\"io.il\", \"QB_1_ortho.tif\");\n SetDocExampleParameterValue(\"io.vd\", \"VectorData_QB1.shp\");\n SetDocExampleParameterValue(\"io.imstat\", \"EstimateImageStatisticsQB1.xml\");\n SetDocExampleParameterValue(\"sample.mv\", \"100\");\n SetDocExampleParameterValue(\"sample.mt\", \"100\");\n SetDocExampleParameterValue(\"sample.vtr\", \"0.5\");\n SetDocExampleParameterValue(\"sample.edg\", \"false\");\n SetDocExampleParameterValue(\"sample.vfn\", \"Class\");\n SetDocExampleParameterValue(\"classifier\", \"libsvm\");\n SetDocExampleParameterValue(\"classifier.libsvm.k\", \"linear\");\n SetDocExampleParameterValue(\"classifier.libsvm.c\", \"1\");\n SetDocExampleParameterValue(\"classifier.libsvm.opt\", \"false\");\n SetDocExampleParameterValue(\"io.out\", \"svmModelQB1.txt\");\n SetDocExampleParameterValue(\"io.confmatout\", \"svmConfusionMatrixQB1.csv\");\n}\n\nvoid DoUpdateParameters() ITK_OVERRIDE\n{\n \/\/ Nothing to do here : all parameters are independent\n}\n\nvoid DoExecute() ITK_OVERRIDE\n{\n \n}\n\n};\n\n} \/\/ end namespace Wrapper\n} \/\/ end namespace otb\n\nOTB_APPLICATION_EXPORT(otb::Wrapper::TrainImagesClassifier)\n<commit_msg>ENH: re-write TrainImagesClassifier as composite application (WIP)<commit_after>\/*=========================================================================\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 \"otbWrapperCompositeApplication.h\"\n#include \"otbWrapperApplicationFactory.h\"\n\n\nnamespace otb\n{\nnamespace Wrapper\n{\n\nclass TrainImagesClassifier: public CompositeApplication\n{\npublic:\n \/** Standard class typedefs. *\/\n typedef TrainImagesClassifier 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 itkTypeMacro(TrainImagesClassifier, otb::Wrapper::CompositeApplication)\n\nprotected:\n\nprivate:\n\nvoid DoInit() ITK_OVERRIDE\n{\n SetName(\"TrainImagesClassifier\");\n SetDescription(\n \"Train a classifier from multiple pairs of images and training vector data.\");\n\n \/\/ Documentation\n SetDocName(\"Train a classifier from multiple images\");\n SetDocLongDescription(\n \"This application performs a classifier training from multiple pairs of input images and training vector data. \"\n \"Samples are composed of pixel values in each band optionally centered and reduced using an XML statistics file produced by \"\n \"the ComputeImagesStatistics application.\\n The training vector data must contain polygons with a positive integer field \"\n \"representing the class label. The name of this field can be set using the \\\"Class label field\\\" parameter. Training and validation \"\n \"sample lists are built such that each class is equally represented in both lists. One parameter allows controlling the ratio \"\n \"between the number of samples in training and validation sets. Two parameters allow managing the size of the training and \"\n \"validation sets per class and per image.\\n Several classifier parameters can be set depending on the chosen classifier. In the \"\n \"validation process, the confusion matrix is organized the following way: rows = reference labels, columns = produced labels. \"\n \"In the header of the optional confusion matrix output file, the validation (reference) and predicted (produced) class labels\"\n \" are ordered according to the rows\/columns of the confusion matrix.\\n This application is based on LibSVM and OpenCV Machine Learning \"\n \"(2.3.1 and later).\");\n SetDocLimitations(\"None\");\n SetDocAuthors(\"OTB-Team\");\n SetDocSeeAlso(\"OpenCV documentation for machine learning http:\/\/docs.opencv.org\/modules\/ml\/doc\/ml.html \");\n\n AddApplication(\"PolygonClassStatistics\", \"polystat\",\"Polygon analysis\");\n AddApplication(\"MultiImageSamplingRate\", \"rates\", \"Sampling rates\");\n AddApplication(\"SampleSelection\", \"select\", \"Sample selection\");\n AddApplication(\"SampleExtraction\",\"extraction\", \"Sample extraction\");\n AddApplication(\"TrainVectorClassifier\", \"training\", \"Model training\");\n\n \/\/Group IO\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 AddParameter(ParameterType_InputVectorDataList, \"io.vd\", \"Input Vector Data List\");\n SetParameterDescription(\"io.vd\", \"A list of vector data to select the training samples.\");\n\n ShareParameter(\"io.imstat\",\"training.io.stats\");\n ShareParameter(\"io.confmatout\",\"training.io.confmatout\");\n ShareParameter(\"io.out\",\"training.io.out\");\n\n \/\/ TODO : handle elev parameters ?\n\n \/\/ Sampling settings\n AddParameter(ParameterType_Group, \"sample\", \"Training and validation samples parameters\");\n SetParameterDescription(\"sample\",\n \"This group of parameters allows you to set training and validation sample lists parameters.\");\n AddParameter(ParameterType_Int, \"sample.mt\", \"Maximum training sample size per class\");\n SetDefaultParameterInt(\"sample.mt\", 1000);\n SetParameterDescription(\"sample.mt\", \"Maximum size per class (in pixels) of \"\n \"the training sample list (default = 1000) (no limit = -1). If equal to -1,\"\n \" then the maximal size of the available training sample list per class \"\n \"will be equal to the surface area of the smallest class multiplied by the\"\n \" training sample ratio.\");\n AddParameter(ParameterType_Int, \"sample.mv\", \"Maximum validation sample size per class\");\n SetDefaultParameterInt(\"sample.mv\", 1000);\n SetParameterDescription(\"sample.mv\", \"Maximum size per class (in pixels) of \"\n \"the validation sample list (default = 1000) (no limit = -1). If equal to -1,\"\n \" then the maximal size of the available validation sample list per class \"\n \"will be equal to the surface area of the smallest class multiplied by the \"\n \"validation sample ratio.\");\n AddParameter(ParameterType_Int, \"sample.bm\", \"Bound sample number by minimum\");\n SetDefaultParameterInt(\"sample.bm\", 1);\n SetParameterDescription(\"sample.bm\", \"Bound the number of samples for each \"\n \"class by the number of available samples by the smaller class. Proportions \"\n \"between training and validation are respected. Default is true (=1).\");\n AddParameter(ParameterType_Float, \"sample.vtr\", \"Training and validation sample ratio\");\n SetParameterDescription(\"sample.vtr\",\n \"Ratio between training and validation samples (0.0 = all training, 1.0 = \"\n \"all validation) (default = 0.5).\");\n SetParameterFloat(\"sample.vtr\", 0.5);\n\n ShareParameter(\"sample.vfn\",\"training.cfield\");\n ShareParameter(\"sample.strategy\",\"rates.strategy\");\n ShareParameter(\"sample.mim\",\"rates.mim\");\n\n \/\/ Classifier settings\n ShareParameter(\"classifier\",\"training.classifier\");\n\n ShareParameter(\"rand\",\"training.rand\");\n\n \/\/ Synchronization between applications\n Connect(\"select.field\", \"polystat.field\");\n Connect(\"select.layer\", \"polystat.layer\");\n\n Connect(\"extraction.in\", \"select.in\");\n Connect(\"extraction.vec\", \"select.vec\");\n Connect(\"extraction.field\", \"select.field\");\n Connect(\"extraction.layer\", \"select.layer\");\n\n Connect(\"select.rand\", \"training.rand\");\n\n \/\/ Doc example parameter settings\n SetDocExampleParameterValue(\"io.il\", \"QB_1_ortho.tif\");\n SetDocExampleParameterValue(\"io.vd\", \"VectorData_QB1.shp\");\n SetDocExampleParameterValue(\"io.imstat\", \"EstimateImageStatisticsQB1.xml\");\n SetDocExampleParameterValue(\"sample.mv\", \"100\");\n SetDocExampleParameterValue(\"sample.mt\", \"100\");\n SetDocExampleParameterValue(\"sample.vtr\", \"0.5\");\n SetDocExampleParameterValue(\"sample.edg\", \"false\");\n SetDocExampleParameterValue(\"sample.vfn\", \"Class\");\n SetDocExampleParameterValue(\"classifier\", \"libsvm\");\n SetDocExampleParameterValue(\"classifier.libsvm.k\", \"linear\");\n SetDocExampleParameterValue(\"classifier.libsvm.c\", \"1\");\n SetDocExampleParameterValue(\"classifier.libsvm.opt\", \"false\");\n SetDocExampleParameterValue(\"io.out\", \"svmModelQB1.txt\");\n SetDocExampleParameterValue(\"io.confmatout\", \"svmConfusionMatrixQB1.csv\");\n}\n\nvoid DoUpdateParameters() ITK_OVERRIDE\n{\n \/\/ TODO : if an image is present, check number of bands and fill training.field ListView\n if (HasValue(\"io.il\"))\n {\n FloatVectorImageListType* imageList = GetParameterImageList(\"io.il\");\n FloatVectorImageType::Pointer image = imageList->GetNthElement(imgIndex);\n \/\/image->UpdateOutputInformation();\n unsigned int nbBands = image->GetNumberOfComponentsPerPixel();\n GetInternalApplication(\"training\")->ClearChoices(\"feat\");\n std::string key(\"feat.value\");\n std::string value(\"value_\");\n for (unsigned int i=0 ; i<nbBands ; i++)\n {\n std::ostringstream oss;\n oss << i;\n GetInternalApplication(\"training\")->AddChoices(key+oss.str(),value+oss.str());\n }\n }\n}\n\nvoid DoExecute() ITK_OVERRIDE\n{\n FloatVectorImageListType* imageList = GetParameterImageList(\"io.il\");\n std::vector<std::string> vectorFileList = GetParameterStringList(\"io.vd\");\n unsigned int nbInputs = imageList->Size();\n std::string outModel(GetParameterString(\"io.out\"));\n std::vector<std::string> polyStatOutputs;\n std::vector<std::string> ratesOutputs;\n\n \/\/ Polygons stats\n for (unsigned int i=0 ; i<nbInputs ; i++)\n {\n std::ostringstream oss;\n oss << outModel << \"_stats\"<<i<<\".xml\";\n polyStatOutputs.push_back(oss.str());\n GetInternalApplication(\"polystat\")->SetParameterInputImage(\"in\",imageList->GetNthElement(i));\n GetInternalApplication(\"polystat\")->SetParameterString(\"vec\",vectorFileList[i]);\n GetInternalApplication(\"polystat\")->SetParameterString(\"out\",oss.str());\n }\n}\n\n};\n\n} \/\/ end namespace Wrapper\n} \/\/ end namespace otb\n\nOTB_APPLICATION_EXPORT(otb::Wrapper::TrainImagesClassifier)\n<|endoftext|>"} {"text":"<commit_before>#ifndef REMAPFILTERFACTORY_HPP\n#define REMAPFILTERFACTORY_HPP\n\n#include \"bridge.h\"\n#include \"ApplicationFilter.hpp\"\n#include \"ConfigFilter.hpp\"\n#include \"DeviceFilter.hpp\"\n#include \"ElapsedTimeSinceLastPressedFilter.hpp\"\n#include \"IOLogWrapper.hpp\"\n#include \"InputSourceFilter.hpp\"\n#include \"LastPressedPhysicalKeyFilter.hpp\"\n#include \"ModifierFilter.hpp\"\n#include \"PressingPhysicalKeysFilter.hpp\"\n#include \"UIElementRoleFilter.hpp\"\n#include \"WindowNameFilter.hpp\"\n\nnamespace org_pqrs_Karabiner {\nnamespace RemapFilter {\nclass RemapFilterFactory final {\npublic:\n static RemapFilterBase* create(const unsigned int* vec, size_t length) {\n \/\/ ------------------------------------------------------------\n \/\/ check parameters.\n \/\/\n if (!vec || length == 0) {\n IOLOG_ERROR(\"RemapFilterFactory::create invalid parameter %p, %ld.\\n\", vec, length);\n return nullptr;\n }\n\n \/\/ ------------------------------------------------------------\n unsigned int type = vec[0];\n ++vec;\n --length;\n\n switch (type) {\n case BRIDGE_FILTERTYPE_APPLICATION_NOT:\n case BRIDGE_FILTERTYPE_APPLICATION_ONLY:\n return new ApplicationFilter(type, vec, length);\n\n case BRIDGE_FILTERTYPE_CONFIG_NOT:\n case BRIDGE_FILTERTYPE_CONFIG_ONLY:\n return new ConfigFilter(type, vec, length);\n\n case BRIDGE_FILTERTYPE_DEVICE_NOT:\n case BRIDGE_FILTERTYPE_DEVICE_ONLY:\n return new DeviceFilter(type, vec, length);\n\n case BRIDGE_FILTERTYPE_ELAPSEDTIMESINCELASTPRESSED_GREATERTHAN:\n case BRIDGE_FILTERTYPE_ELAPSEDTIMESINCELASTPRESSED_LESSTHAN:\n return new ElapsedTimeSinceLastPressedFilter(type, vec, length);\n\n case BRIDGE_FILTERTYPE_INPUTSOURCE_NOT:\n case BRIDGE_FILTERTYPE_INPUTSOURCE_ONLY:\n return new InputSourceFilter(type, vec, length);\n\n case BRIDGE_FILTERTYPE_LASTPRESSEDPHYSICALKEY_NOT:\n case BRIDGE_FILTERTYPE_LASTPRESSEDPHYSICALKEY_ONLY:\n return new LastPressedPhysicalKeyFilter(type, vec, length);\n\n case BRIDGE_FILTERTYPE_MODIFIER_NOT:\n case BRIDGE_FILTERTYPE_MODIFIER_ONLY:\n case BRIDGE_FILTERTYPE_MODIFIER_LOCKED_NOT:\n case BRIDGE_FILTERTYPE_MODIFIER_LOCKED_ONLY:\n case BRIDGE_FILTERTYPE_MODIFIER_STUCK_NOT:\n case BRIDGE_FILTERTYPE_MODIFIER_STUCK_ONLY:\n return new ModifierFilter(type, vec, length);\n\n case BRIDGE_FILTERTYPE_PRESSINGPHYSICALKEYS_GREATERTHAN:\n case BRIDGE_FILTERTYPE_PRESSINGPHYSICALKEYS_LESSTHAN:\n return new PressingPhysicalKeysFilter(type, vec, length);\n\n case BRIDGE_FILTERTYPE_WINDOWNAME_NOT:\n case BRIDGE_FILTERTYPE_WINDOWNAME_ONLY:\n return new WindowNameFilter(type, vec, length);\n\n case BRIDGE_FILTERTYPE_UIELEMENTROLE_NOT:\n case BRIDGE_FILTERTYPE_UIELEMENTROLE_ONLY:\n return new UIElementRoleFilter(type, vec, length);\n }\n\n IOLOG_ERROR(\"RemapFilterFactory::create unknown type:%d.\\n\", type);\n return nullptr;\n }\n};\n}\n}\n\n#endif\n<commit_msg>add ElapsedTimeSinceLastReleasedFilter, LastReleasedPhysicalKeyFilter into RemapFilterFactory<commit_after>#ifndef REMAPFILTERFACTORY_HPP\n#define REMAPFILTERFACTORY_HPP\n\n#include \"bridge.h\"\n#include \"ApplicationFilter.hpp\"\n#include \"ConfigFilter.hpp\"\n#include \"DeviceFilter.hpp\"\n#include \"ElapsedTimeSinceLastPressedFilter.hpp\"\n#include \"ElapsedTimeSinceLastReleasedFilter.hpp\"\n#include \"IOLogWrapper.hpp\"\n#include \"InputSourceFilter.hpp\"\n#include \"LastPressedPhysicalKeyFilter.hpp\"\n#include \"LastReleasedPhysicalKeyFilter.hpp\"\n#include \"ModifierFilter.hpp\"\n#include \"PressingPhysicalKeysFilter.hpp\"\n#include \"UIElementRoleFilter.hpp\"\n#include \"WindowNameFilter.hpp\"\n\nnamespace org_pqrs_Karabiner {\nnamespace RemapFilter {\nclass RemapFilterFactory final {\npublic:\n static RemapFilterBase* create(const unsigned int* vec, size_t length) {\n \/\/ ------------------------------------------------------------\n \/\/ check parameters.\n \/\/\n if (!vec || length == 0) {\n IOLOG_ERROR(\"RemapFilterFactory::create invalid parameter %p, %ld.\\n\", vec, length);\n return nullptr;\n }\n\n \/\/ ------------------------------------------------------------\n unsigned int type = vec[0];\n ++vec;\n --length;\n\n switch (type) {\n case BRIDGE_FILTERTYPE_APPLICATION_NOT:\n case BRIDGE_FILTERTYPE_APPLICATION_ONLY:\n return new ApplicationFilter(type, vec, length);\n\n case BRIDGE_FILTERTYPE_CONFIG_NOT:\n case BRIDGE_FILTERTYPE_CONFIG_ONLY:\n return new ConfigFilter(type, vec, length);\n\n case BRIDGE_FILTERTYPE_DEVICE_NOT:\n case BRIDGE_FILTERTYPE_DEVICE_ONLY:\n return new DeviceFilter(type, vec, length);\n\n case BRIDGE_FILTERTYPE_ELAPSEDTIMESINCELASTPRESSED_GREATERTHAN:\n case BRIDGE_FILTERTYPE_ELAPSEDTIMESINCELASTPRESSED_LESSTHAN:\n return new ElapsedTimeSinceLastPressedFilter(type, vec, length);\n\n case BRIDGE_FILTERTYPE_ELAPSEDTIMESINCELASTRELEASED_GREATERTHAN:\n case BRIDGE_FILTERTYPE_ELAPSEDTIMESINCELASTRELEASED_LESSTHAN:\n return new ElapsedTimeSinceLastReleasedFilter(type, vec, length);\n\n case BRIDGE_FILTERTYPE_INPUTSOURCE_NOT:\n case BRIDGE_FILTERTYPE_INPUTSOURCE_ONLY:\n return new InputSourceFilter(type, vec, length);\n\n case BRIDGE_FILTERTYPE_LASTPRESSEDPHYSICALKEY_NOT:\n case BRIDGE_FILTERTYPE_LASTPRESSEDPHYSICALKEY_ONLY:\n return new LastPressedPhysicalKeyFilter(type, vec, length);\n\n case BRIDGE_FILTERTYPE_LASTRELEASEDPHYSICALKEY_NOT:\n case BRIDGE_FILTERTYPE_LASTRELEASEDPHYSICALKEY_ONLY:\n return new LastReleasedPhysicalKeyFilter(type, vec, length);\n\n case BRIDGE_FILTERTYPE_MODIFIER_NOT:\n case BRIDGE_FILTERTYPE_MODIFIER_ONLY:\n case BRIDGE_FILTERTYPE_MODIFIER_LOCKED_NOT:\n case BRIDGE_FILTERTYPE_MODIFIER_LOCKED_ONLY:\n case BRIDGE_FILTERTYPE_MODIFIER_STUCK_NOT:\n case BRIDGE_FILTERTYPE_MODIFIER_STUCK_ONLY:\n return new ModifierFilter(type, vec, length);\n\n case BRIDGE_FILTERTYPE_PRESSINGPHYSICALKEYS_GREATERTHAN:\n case BRIDGE_FILTERTYPE_PRESSINGPHYSICALKEYS_LESSTHAN:\n return new PressingPhysicalKeysFilter(type, vec, length);\n\n case BRIDGE_FILTERTYPE_WINDOWNAME_NOT:\n case BRIDGE_FILTERTYPE_WINDOWNAME_ONLY:\n return new WindowNameFilter(type, vec, length);\n\n case BRIDGE_FILTERTYPE_UIELEMENTROLE_NOT:\n case BRIDGE_FILTERTYPE_UIELEMENTROLE_ONLY:\n return new UIElementRoleFilter(type, vec, length);\n }\n\n IOLOG_ERROR(\"RemapFilterFactory::create unknown type:%d.\\n\", type);\n return nullptr;\n }\n};\n}\n}\n\n#endif\n<|endoftext|>"} {"text":"<commit_before>#define DEBUG 1\n\/**\n * File : A.cpp\n * Author : Kazune Takahashi\n * Created : 11\/2\/2019, 1:43:18 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\nconstexpr int MOD{40};\nconstexpr int dx[4] = {-1, 1, 0, 0};\nconstexpr int dy[4] = {0, 0, -1, 1};\nconstexpr char direction[4] = {'U', 'D', 'L', 'R'};\nconstexpr int reverse_direction[4] = {1, 0, 3, 2};\n\nusing Point = tuple<int, int>;\nPoint operator+(Point const &lhs, Point const &rhs)\n{\n return Point((get<0>(lhs) + get<0>(rhs) + MOD) % MOD, (get<1>(lhs) + get<1>(rhs) + MOD) % MOD);\n}\n\nvoid TLE()\n{\n while (true)\n {\n cout << \"\";\n }\n}\n\nenum class State\n{\n Empty,\n Robot,\n Block,\n Goal,\n Invalid\n};\n\nclass Field\n{\npublic:\n static int N;\n int M, B;\n static vector<Point> V;\n static vector<vector<Point>> P;\n vector<vector<int>> D;\n vector<vector<State>> S;\n bool is_sample_one;\n\n Field();\n void solve();\n void flush();\n\n State get_state(Point const &p) const\n {\n return S[get<0>(p)][get<1>(p)];\n }\n\n State &set_state(Point const &p, State s)\n {\n return S[get<0>(p)][get<1>(p)] = s;\n }\n\n int get_direction(Point const &p) const\n {\n return D[get<0>(p)][get<1>(p)];\n }\n\n int &set_direction(Point const &p, int d)\n {\n return D[get<0>(p)][get<1>(p)] = d;\n }\n\nprivate:\n void good_place();\n void other_place();\n void fill_empty();\n};\n\nint Field::N;\nvector<Point> Field::V;\nvector<vector<Point>> Field::P;\n\nField::Field()\n{\n cin >> M >> B;\n D = vector<vector<int>>(N, vector<int>(N, -1));\n S = vector<vector<State>>(N, vector<State>(N, State::Empty));\n int gx, gy;\n cin >> gx >> gy;\n int x, y;\n char c;\n for (auto i = 0; i < M; i++)\n {\n cin >> x >> y >> c;\n S[x][y] = State::Robot;\n }\n for (auto i = 0; i < B; i++)\n {\n cin >> x >> y;\n S[x][y] = State::Block;\n }\n S[gx][gy] = State::Goal;\n is_sample_one = (gx == 32 && gy == 8);\n}\n\nvoid Field::solve()\n{\n if (is_sample_one)\n {\n good_place();\n other_place();\n fill_empty();\n }\n else\n {\n TLE();\n }\n}\n\nvoid Field::good_place()\n{\n for (auto i = 0; i < N; i++)\n {\n for (auto j = 0; j < N; j++)\n {\n if (S[i][j] == State::Robot)\n {\n for (auto k = 0; k < 4; k++)\n {\n Point p{P[i][j] + V[k]};\n State s{get_state(p)};\n if (s == State::Block || s == State::Robot)\n {\n D[i][j] = k;\n break;\n }\n }\n }\n }\n }\n}\n\nvoid Field::other_place()\n{\n for (auto i = 0; i < N; i++)\n {\n for (auto j = 0; j < N; j++)\n {\n if (S[i][j] == State::Robot && D[i][j] == -1)\n {\n for (auto k = 0; k < 4; k++)\n {\n Point p{P[i][j] + V[k]};\n int d{get_direction(p)};\n \/\/ State s{get_state(p)};\n if (d != -1)\n {\n D[i][j] = k;\n break;\n }\n }\n if (D[i][j] != -1)\n {\n continue;\n }\n for (auto k = 0; k < 4; k++)\n {\n Point p{P[i][j] + V[k]};\n \/\/ int d{get_direction(p)};\n State s{get_state(p)};\n if (s == State::Empty)\n {\n D[i][j] = k;\n if (get_direction(p) == -1)\n {\n set_direction(p, reverse_direction[k]);\n }\n break;\n }\n }\n assert(D[i][j] != -1);\n }\n }\n }\n}\n\nvoid Field::fill_empty()\n{\n for (auto i = 0; i < N; i++)\n {\n for (auto j = 0; j < N; j++)\n {\n if (D[i][j] == -1)\n {\n D[i][j] = 0;\n }\n }\n }\n}\n\nvoid Field::flush()\n{\n int K{0};\n for (auto x = 0; x < N; x++)\n {\n for (auto y = 0; y < N; y++)\n {\n if (0 <= D[x][y] && D[x][y] < 4)\n {\n ++K;\n }\n }\n }\n cout << K << endl;\n for (auto x = 0; x < N; x++)\n {\n for (auto y = 0; y < N; y++)\n {\n if (0 <= D[x][y] && D[x][y] < 4)\n {\n cout << x << \" \" << y << \" \" << direction[D[x][y]] << endl;\n }\n }\n }\n}\n\nint main()\n{\n cin >> Field::N;\n for (auto i = 0; i < 4; i++)\n {\n Field::V.push_back(Point{dy[i], dx[i]});\n }\n Field::P = vector<vector<Point>>(Field::N, vector<Point>(Field::N));\n for (auto i = 0; i < Field::N; i++)\n {\n for (auto j = 0; j < Field::N; j++)\n {\n Field::P[i][j] = Point{i, j};\n }\n }\n Field f;\n f.solve();\n f.flush();\n}<commit_msg>submit A.cpp to 'A - ロボットの誘導' (future-contest-2020-qual) [C++14 (GCC 5.4.1)]<commit_after>#define DEBUG 1\n\/**\n * File : A.cpp\n * Author : Kazune Takahashi\n * Created : 11\/2\/2019, 1:43:18 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\nconstexpr int MOD{40};\nconstexpr int dx[4] = {-1, 1, 0, 0};\nconstexpr int dy[4] = {0, 0, -1, 1};\nconstexpr char direction[4] = {'U', 'D', 'L', 'R'};\nconstexpr int reverse_direction[4] = {1, 0, 3, 2};\n\nusing Point = tuple<int, int>;\nPoint operator+(Point const &lhs, Point const &rhs)\n{\n return Point((get<0>(lhs) + get<0>(rhs) + MOD) % MOD, (get<1>(lhs) + get<1>(rhs) + MOD) % MOD);\n}\n\nvoid TLE()\n{\n while (true)\n {\n cout << \"\";\n }\n}\n\nnamespace Tools\n{\n\ntemplate <typename T>\nT get(Point const &p, vector<vector<T>> const &X)\n{\n return X[get<0>(p)][get<1>(p)];\n}\n\ntemplate <typename T>\nvoid set(Point const &p, T val, vector<vector<T>> &X)\n{\n X[get<0>(p)][get<1>(p)] = val;\n}\n\n}; \/\/ namespace Tools\n\nenum class State\n{\n Empty,\n Robot,\n Block,\n Goal,\n Invalid\n};\n\nclass Field\n{\npublic:\n static int N;\n static vector<Point> V;\n static vector<vector<Point>> P;\n int M, B;\n vector<vector<int>> D;\n vector<vector<State>> S;\n vector<Point> robots;\n bool is_sample_one;\n\n Field();\n void solve();\n void flush();\n int score();\n int direction_count();\n\n State get_state(Point const &p) const { return Tools::get(p, S); }\n void set_state(Point const &p, State s) { Tools::set(p, s, S); }\n int get_direction(Point const &p) const { return Tools::get(p, D); }\n void set_direction(Point const &p, int d) { Tools::set(p, d, D); }\n\nprivate:\n bool reach(Point const &p, vector<vector<bool>> &used);\n void good_place();\n void other_place();\n void fill_empty();\n};\n\nint Field::N;\nvector<Point> Field::V;\nvector<vector<Point>> Field::P;\n\nField::Field()\n{\n cin >> M >> B;\n D = vector<vector<int>>(N, vector<int>(N, -1));\n S = vector<vector<State>>(N, vector<State>(N, State::Empty));\n int gx, gy;\n cin >> gx >> gy;\n int x, y;\n char c;\n for (auto i = 0; i < M; i++)\n {\n cin >> x >> y >> c;\n S[x][y] = State::Robot;\n robots.emplace_back(x, y);\n }\n for (auto i = 0; i < B; i++)\n {\n cin >> x >> y;\n S[x][y] = State::Block;\n }\n S[gx][gy] = State::Goal;\n is_sample_one = (gx == 32 && gy == 8); \/\/ これで十分のようだ。\n}\n\nvoid Field::solve()\n{\n if (!is_sample_one)\n {\n good_place();\n other_place();\n fill_empty();\n }\n else\n {\n good_place();\n other_place();\n fill_empty();\n }\n}\n\nvoid Field::good_place()\n{\n for (auto i = 0; i < N; i++)\n {\n for (auto j = 0; j < N; j++)\n {\n if (S[i][j] == State::Robot)\n {\n for (auto k = 0; k < 4; k++)\n {\n Point p{P[i][j] + V[k]};\n State s{get_state(p)};\n if (s == State::Block || s == State::Robot)\n {\n D[i][j] = k;\n break;\n }\n }\n }\n }\n }\n}\n\nvoid Field::other_place()\n{\n for (auto i = 0; i < N; i++)\n {\n for (auto j = 0; j < N; j++)\n {\n if (S[i][j] == State::Robot && D[i][j] == -1)\n {\n for (auto k = 0; k < 4; k++)\n {\n Point p{P[i][j] + V[k]};\n int d{get_direction(p)};\n if (d != -1)\n {\n D[i][j] = k;\n break;\n }\n }\n if (D[i][j] != -1)\n {\n continue;\n }\n for (auto k = 0; k < 4; k++)\n {\n Point p{P[i][j] + V[k]};\n State s{get_state(p)};\n if (s == State::Empty)\n {\n D[i][j] = k;\n if (get_direction(p) == -1)\n {\n set_direction(p, reverse_direction[k]);\n }\n break;\n }\n }\n assert(D[i][j] != -1);\n }\n }\n }\n}\n\nvoid Field::fill_empty()\n{\n for (auto i = 0; i < N; i++)\n {\n for (auto j = 0; j < N; j++)\n {\n if (D[i][j] == -1)\n {\n D[i][j] = 0;\n }\n }\n }\n}\n\nint Field::direction_count()\n{\n int K{0};\n for (auto x = 0; x < N; x++)\n {\n for (auto y = 0; y < N; y++)\n {\n if (S[x][y] != State::Goal && S[x][y] != State::Block && 0 <= D[x][y] && D[x][y] < 4)\n {\n ++K;\n }\n }\n }\n return K;\n}\n\nvoid Field::flush()\n{\n int K{Field::direction_count()};\n cout << K << endl;\n for (auto x = 0; x < N; x++)\n {\n for (auto y = 0; y < N; y++)\n {\n if (S[x][y] != State::Goal && S[x][y] != State::Block && 0 <= D[x][y] && D[x][y] < 4)\n {\n cout << x << \" \" << y << \" \" << direction[D[x][y]] << endl;\n }\n }\n }\n}\n\nbool Field::reach(Point const &p, vector<vector<bool>> &used)\n{\n stack<Point> st;\n vector<vector<bool>> visited(N, vector<bool>(N, false));\n st.push(p);\n while (!st.empty())\n {\n Point p{st.top()};\n st.pop();\n if (!Tools::get(p, visited))\n {\n Tools::set(p, true, visited);\n Tools::set(p, true, used);\n if (Tools::get(p, S) == State::Goal)\n {\n return true;\n }\n int k{get_direction(p)};\n assert(k != -1);\n Point q{p + V[k]};\n if (get_state(q) == State::Block)\n {\n return false;\n }\n st.push(q);\n }\n }\n return false;\n}\n\nint Field::score()\n{\n int ans{0};\n vector<vector<bool>> used(N, vector<bool>(N, false));\n for (auto const &x : robots)\n {\n if (reach(x, used))\n {\n ans += 1000;\n }\n }\n for (auto i = 0; i < N; i++)\n {\n for (auto j = 0; j < N; j++)\n {\n if (used[i][j])\n {\n ++ans;\n }\n }\n }\n ans -= 10 * direction_count();\n return ans;\n}\n\nint main()\n{\n cin >> Field::N;\n for (auto i = 0; i < 4; i++)\n {\n Field::V.push_back(Point{dx[i], dy[i]});\n }\n Field::P = vector<vector<Point>>(Field::N, vector<Point>(Field::N));\n for (auto i = 0; i < Field::N; i++)\n {\n for (auto j = 0; j < Field::N; j++)\n {\n Field::P[i][j] = Point{i, j};\n }\n }\n Field f;\n f.solve();\n cerr << f.score() << endl;\n f.flush();\n}<|endoftext|>"} {"text":"<commit_before>#include <iostream>\n#include <vector>\n#include <map>\n#include <node.h>\n\n#include \"PSATResult.h\"\n#include \"calculator\/EstimateFLA.h\"\n\nusing namespace v8;\nusing namespace std;\n\nIsolate* iso;\nLocal<Object> inp;\n\n\/\/todo assert exist\ndouble Get(const char *nm) {\n return inp->ToObject()->Get(String::NewFromUtf8(iso,nm))->NumberValue();\n}\n\nvoid Results(const FunctionCallbackInfo<Value>& args) {\n iso = args.GetIsolate();\n inp = args[0]->ToObject();\n auto r = Object::New(iso);\n\n auto drive = (Pump::Drive)(int)Get(\"drive\");\n auto effCls = (Motor::EfficiencyClass)(int)Get(\"efficiency_class\");\n \n Pump pump((Pump::Style)(int)Get(\"pump_style\"),Get(\"pump_rated_speed\"),drive,\n Get(\"viscosity\"),Get(\"specific_gravity\"),Get(\"stages\"),(Pump::Speed)(int)(!Get(\"fixed_speed\")));\n Motor motor((Motor::LineFrequency)(int)(!Get(\"line\")),Get(\"motor_rated_power\"),Get(\"motor_rated_speed\"),\n effCls,Get(\"efficiency\"),Get(\"motor_rated_voltage\"),Get(\"motor_rated_flc\"),Get(\"margin\"));\n Financial fin(Get(\"fraction\"),Get(\"cost\"));\n FieldData fd(Get(\"flow\"),Get(\"head\"),(FieldData::LoadEstimationMethod)(Get(\"motor_field_power\")>0?0:1),\n Get(\"motor_field_power\"),Get(\"motor_field_current\"),Get(\"motor_field_voltage\"));\n PSATResult psat(pump,motor,fin,fd);\n psat.calculate();\n auto ex = psat.getExisting();\n \n map<const char *,vector<double>> out = { \n {\"Pump Efficiency\",{ex.pumpEfficiency_*100,0}},\n {\"Motor Rated Power\",{ex.motorRatedPower_,0}}, \n {\"Motor Shaft Power\",{ex.motorShaftPower_,0}},\n {\"Pump Shaft Power\",{ex.pumpShaftPower_,0}}, \n {\"Motor Efficiency\",{ex.motorEfficiency_,0}},\n {\"Motor Power Factor\",{ex.motorPowerFactor_,0}},\n {\"Motor Current\",{ex.motorCurrent_,0}}, \n {\"Motor Power\", {ex.motorPower_,0}},\n {\"Annual Energy\", {ex.annualEnergy_,0}},\n {\"Annual Cost\", {ex.annualCost_*1000,0}},\n {\"Savings Potential\", {psat.getAnnualSavingsPotential(),0}},\n {\"Optimization Rating\", {psat.getOptimizationRating(),0}}\n };\n for(auto p: out) { \n auto a = Array::New(iso);\n a->Set(0,Number::New(iso,p.second[0]));\n a->Set(1,Number::New(iso,p.second[1])); \n r->Set(String::NewFromUtf8(iso,p.first),a);\n }\n args.GetReturnValue().Set(r);\n}\n\nvoid EstFLA(const FunctionCallbackInfo<Value>& args) {\n iso = args.GetIsolate();\n inp = args[0]->ToObject();\n\n EstimateFLA fla(Get(\"motor_rated_power\"),Get(\"motor_rated_speed\"),(Motor::EfficiencyClass)(int)Get(\"efficiency_class\"),\n Get(\"efficiency\"),Get(\"motor_rated_voltage\"));\n fla.calculate();\n args.GetReturnValue().Set(fla.getEstimatedFLA());\n}\n\nvoid Check(double exp, double act, const char* nm=\"\") {\n if (abs(exp-act)>.01*exp) {\n printf(\"\\\"%s\\\" TEST FAILED: %f %f\\n\",nm,exp,act);\n assert(!\"equal\");\n }\n}\n\nvoid Check100(double exp, double act, const char* nm=\"\") {\n Check(exp,act*100,nm);\n}\n\nvoid TestSame() {\n \/\/ auto msp = (new MotorShaftPower(200,80,1786,Motor::EfficiencyClass::ENERGY_EFFICIENT,460,460));\n for (int i=1; i<=10000; i=i+2) {\n \/\/ Check(msp->calculate(),msp->calculate(),\"SAME\");\n }\n}\n\/\/ void Test(const FunctionCallbackInfo<Value>& args) {\n\/\/ TestSame();\n\/\/ \/\/assume power load meth, est fla, line=60\n\/\/ auto msp = new MotorShaftPower(200,80,1786,Motor::EfficiencyClass::ENERGY_EFFICIENT,460,460);\n\/\/ Check(101.9,msp->calculate());\n\/\/ Check100(95,msp->calculateEfficiency());\n\/\/ Check100(79.1,msp->calculatePowerFactor());\n\/\/ Check(127,msp->calculateCurrent());\n\n\/\/ msp = new MotorShaftPower(200,111.855,1780,Motor::EfficiencyClass::ENERGY_EFFICIENT,460,460);\n\/\/ Check(143.4,msp->calculate());\n\/\/ Check100(95.6,msp->calculateEfficiency());\n\/\/ Check100(84.3,msp->calculatePowerFactor());\n\/\/ Check(166.5,msp->calculateCurrent());\n\n\/\/ msp = new MotorShaftPower(200,80,1780,Motor::EfficiencyClass::ENERGY_EFFICIENT,460,260);\n\/\/ Check(101.9,msp->calculate());\n\/\/ Check100(95,msp->calculateEfficiency());\n\/\/ Check100(138.8,msp->calculatePowerFactor());\n\/\/ Check(128,msp->calculateCurrent());\n\n\/\/ msp = new MotorShaftPower(100,80,1780,Motor::EfficiencyClass::ENERGY_EFFICIENT,460,460);\n\/\/ Check(101.8,msp->calculate());\n\/\/ Check100(94.9,msp->calculateEfficiency());\n\/\/ Check100(86.7,msp->calculatePowerFactor());\n\/\/ Check(115.8,msp->calculateCurrent());\n\n\/\/ msp = new MotorShaftPower(200,80,1200,Motor::EfficiencyClass::ENERGY_EFFICIENT,460,460);\n\/\/ Check(101.4,msp->calculate());\n\/\/ Check100(94.5,msp->calculateEfficiency());\n\/\/ Check100(74.3,msp->calculatePowerFactor());\n\/\/ Check(135.1,msp->calculateCurrent());\n \n\/\/ \/\/ msp = new MotorShaftPower(200,80,1780,Motor::EfficiencyClass::ENERGY_EFFICIENT,200,460);\n\/\/ \/\/ Check(101.9,msp->calculate());\n\/\/ \/\/ Check100(95,msp->calculateEfficiency());\n\/\/ \/\/ Check100(35.2,msp->calculatePowerFactor());\n\/\/ \/\/ Check(285,msp->calculateCurrent());\n\n\/\/ auto ae = (new AnnualEnergy(80,1))->calculate();\n\/\/ Check(700.8,ae);\n\n\/\/ ae = (new AnnualEnergy(150,.25))->calculate();\n\/\/ Check(328.5,ae);\n \n\/\/ auto ac = (new AnnualCost(328.5,.05))->calculate();\n\/\/ Check(16.4,ac);\n\n\/\/ }\n\nvoid Test2(const FunctionCallbackInfo<Value>& args) {\n Pump pump((Pump::Style)0,1780,(Pump::Drive)0,\n 1,1,1,(Pump::Speed)1);\n Motor motor((Motor::LineFrequency)1,200,1780,\n (Motor::EfficiencyClass)1,0,460,225,0);\n Financial fin(1,.05);\n FieldData fd(2000,277,(FieldData::LoadEstimationMethod)0,150,\n 0,460);\n PSATResult psat(pump,motor,fin,fd);\n psat.calculate();\n auto ex = psat.getExisting();\n cout << ex.motorCurrent_;\n}\nvoid TestFLA(const FunctionCallbackInfo<Value>& args) {\n EstimateFLA fla(200,1780,(Motor::EfficiencyClass)(1),0,460);\n fla.calculate();\n Check(225.8,fla.getEstimatedFLA());\n}\nvoid Init(Local<Object> exports) {\n NODE_SET_METHOD(exports, \"results\", Results);\n NODE_SET_METHOD(exports, \"estFLA\", EstFLA); \n NODE_SET_METHOD(exports, \"test\", TestFLA); \n}\n\nNODE_MODULE(bridge, Init)\n\n<commit_msg>no message<commit_after>#include <iostream>\n#include <vector>\n#include <map>\n#include <node.h>\n\n#include \"PSATResult.h\"\n#include \"calculator\/EstimateFLA.h\"\n\nusing namespace v8;\nusing namespace std;\n\nIsolate* iso;\nLocal<Object> inp;\n\n\/\/todo assert exist\ndouble Get(const char *nm) {\n return inp->ToObject()->Get(String::NewFromUtf8(iso,nm))->NumberValue();\n}\n\nvoid Results(const FunctionCallbackInfo<Value>& args) {\n iso = args.GetIsolate();\n inp = args[0]->ToObject();\n auto r = Object::New(iso);\n\n auto drive = (Pump::Drive)(int)Get(\"drive\");\n auto effCls = (Motor::EfficiencyClass)(int)Get(\"efficiency_class\");\n \n Pump pump((Pump::Style)(int)Get(\"pump_style\"),Get(\"pump_rated_speed\"),drive,\n Get(\"viscosity\"),Get(\"specific_gravity\"),Get(\"stages\"),(Pump::Speed)(int)(!Get(\"fixed_speed\")));\n Motor motor((Motor::LineFrequency)(int)(!Get(\"line\")),Get(\"motor_rated_power\"),Get(\"motor_rated_speed\"),\n effCls,Get(\"efficiency\"),Get(\"motor_rated_voltage\"),Get(\"motor_rated_flc\"),Get(\"margin\"));\n Financial fin(Get(\"fraction\"),Get(\"cost\"));\n FieldData fd(Get(\"flow\"),Get(\"head\"),(FieldData::LoadEstimationMethod)(Get(\"motor_field_power\")>0?0:1),\n Get(\"motor_field_power\"),Get(\"motor_field_current\"),Get(\"motor_field_voltage\"));\n PSATResult psat(pump,motor,fin,fd);\n psat.calculate();\n auto ex = psat.getExisting();\n \n map<const char *,vector<double>> out = { \n {\"Pump Efficiency\",{ex.pumpEfficiency_*100,0}},\n {\"Motor Rated Power\",{ex.motorRatedPower_,0}}, \n {\"Motor Shaft Power\",{ex.motorShaftPower_,0}},\n {\"Pump Shaft Power\",{ex.pumpShaftPower_,0}}, \n {\"Motor Efficiency\",{ex.motorEfficiency_,0}},\n {\"Motor Power Factor\",{ex.motorPowerFactor_,0}},\n {\"Motor Current\",{ex.motorCurrent_,0}}, \n {\"Motor Power\", {ex.motorPower_,0}},\n {\"Annual Energy\", {ex.annualEnergy_,0}},\n {\"Annual Cost\", {ex.annualCost_*1000,0}},\n {\"Savings Potential\", {psat.getAnnualSavingsPotential(),0}},\n {\"Optimization Rating\", {psat.getOptimizationRating(),0}}\n };\n for(auto p: out) { \n auto a = Array::New(iso);\n a->Set(0,Number::New(iso,p.second[0]));\n a->Set(1,Number::New(iso,p.second[1])); \n r->Set(String::NewFromUtf8(iso,p.first),a);\n }\n args.GetReturnValue().Set(r);\n}\n\nvoid EstFLA(const FunctionCallbackInfo<Value>& args) {\n iso = args.GetIsolate();\n inp = args[0]->ToObject();\n\n EstimateFLA fla(Get(\"motor_rated_power\"),Get(\"motor_rated_speed\"),(Motor::EfficiencyClass)(int)Get(\"efficiency_class\"),\n Get(\"efficiency\"),Get(\"motor_rated_voltage\"));\n fla.calculate();\n args.GetReturnValue().Set(fla.getEstimatedFLA());\n}\n\nvoid Check(double exp, double act, const char* nm=\"\") {\n cout << \"e \" << exp << \"; a \" << act << endl;\n if (abs(exp-act)>.1*exp) {\n printf(\"\\\"%s\\\" TEST FAILED: %f %f\\n\",nm,exp,act);\n assert(!\"equal\");\n }\n}\n\nvoid Check100(double exp, double act, const char* nm=\"\") {\n Check(exp,act*100,nm);\n}\n\nvoid TestSame() {\n \/\/ auto msp = (new MotorShaftPower(200,80,1786,Motor::EfficiencyClass::ENERGY_EFFICIENT,460,460));\n for (int i=1; i<=10000; i=i+2) {\n \/\/ Check(msp->calculate(),msp->calculate(),\"SAME\");\n }\n}\n\/\/ void Test(const FunctionCallbackInfo<Value>& args) {\n\/\/ TestSame();\n\/\/ \/\/assume power load meth, est fla, line=60\n\/\/ auto msp = new MotorShaftPower(200,80,1786,Motor::EfficiencyClass::ENERGY_EFFICIENT,460,460);\n\/\/ Check(101.9,msp->calculate());\n\/\/ Check100(95,msp->calculateEfficiency());\n\/\/ Check100(79.1,msp->calculatePowerFactor());\n\/\/ Check(127,msp->calculateCurrent());\n\n\/\/ msp = new MotorShaftPower(200,111.855,1780,Motor::EfficiencyClass::ENERGY_EFFICIENT,460,460);\n\/\/ Check(143.4,msp->calculate());\n\/\/ Check100(95.6,msp->calculateEfficiency());\n\/\/ Check100(84.3,msp->calculatePowerFactor());\n\/\/ Check(166.5,msp->calculateCurrent());\n\n\/\/ msp = new MotorShaftPower(200,80,1780,Motor::EfficiencyClass::ENERGY_EFFICIENT,460,260);\n\/\/ Check(101.9,msp->calculate());\n\/\/ Check100(95,msp->calculateEfficiency());\n\/\/ Check100(138.8,msp->calculatePowerFactor());\n\/\/ Check(128,msp->calculateCurrent());\n\n\/\/ msp = new MotorShaftPower(100,80,1780,Motor::EfficiencyClass::ENERGY_EFFICIENT,460,460);\n\/\/ Check(101.8,msp->calculate());\n\/\/ Check100(94.9,msp->calculateEfficiency());\n\/\/ Check100(86.7,msp->calculatePowerFactor());\n\/\/ Check(115.8,msp->calculateCurrent());\n\n\/\/ msp = new MotorShaftPower(200,80,1200,Motor::EfficiencyClass::ENERGY_EFFICIENT,460,460);\n\/\/ Check(101.4,msp->calculate());\n\/\/ Check100(94.5,msp->calculateEfficiency());\n\/\/ Check100(74.3,msp->calculatePowerFactor());\n\/\/ Check(135.1,msp->calculateCurrent());\n \n\/\/ \/\/ msp = new MotorShaftPower(200,80,1780,Motor::EfficiencyClass::ENERGY_EFFICIENT,200,460);\n\/\/ \/\/ Check(101.9,msp->calculate());\n\/\/ \/\/ Check100(95,msp->calculateEfficiency());\n\/\/ \/\/ Check100(35.2,msp->calculatePowerFactor());\n\/\/ \/\/ Check(285,msp->calculateCurrent());\n\n\/\/ auto ae = (new AnnualEnergy(80,1))->calculate();\n\/\/ Check(700.8,ae);\n\n\/\/ ae = (new AnnualEnergy(150,.25))->calculate();\n\/\/ Check(328.5,ae);\n \n\/\/ auto ac = (new AnnualCost(328.5,.05))->calculate();\n\/\/ Check(16.4,ac);\n\n\/\/ }\n\nvoid Test2(const FunctionCallbackInfo<Value>& args) {\n Pump pump((Pump::Style)0,1780,(Pump::Drive)0,\n 1,1,1,(Pump::Speed)1);\n Motor motor((Motor::LineFrequency)1,200,1780,\n (Motor::EfficiencyClass)1,0,460,225,0);\n Financial fin(1,.05);\n FieldData fd(2000,277,(FieldData::LoadEstimationMethod)0,150,\n 0,460);\n PSATResult psat(pump,motor,fin,fd);\n psat.calculate();\n auto ex = psat.getExisting();\n cout << ex.motorCurrent_;\n}\nvoid TestFLA(const FunctionCallbackInfo<Value>& args) {\n EstimateFLA fla(200,1780,(Motor::EfficiencyClass)(1),0,460);\n fla.calculate();\n Check(225.8,fla.getEstimatedFLA());\n}\nvoid Test3(const FunctionCallbackInfo<Value>& args) {\n \/\/ Pump pump(Pump::Style::END_SUCTION_ANSI_API,1780,Pump::Drive::DIRECT_DRIVE,\n \/\/ 1,1,1,Pump::Speed::NOT_FIXED_SPEED);\n \/\/ Motor motor(Motor::LineFrequency::FREQ60,200,1780,\n \/\/ Motor::EfficiencyClass::ENERGY_EFFICIENT,0,460,225.4,0);\n \/\/ Financial fin(1,.05);\n \/\/ FieldData fd(2000,277,FieldData::LoadEstimationMethod::POWER,\n \/\/ 150,0,460);\n \/\/ PSATResult psat(pump,motor,fin,fd);\n \/\/ psat.calculate();\n \/\/ auto ex = psat.getExisting(); \n\n Pump pump(Pump::Style::END_SUCTION_ANSI_API,1780,Pump::Drive::DIRECT_DRIVE,\n 1,1,1,Pump::Speed::NOT_FIXED_SPEED);\n Motor motor(Motor::LineFrequency::FREQ60,200,1780,\n Motor::EfficiencyClass::ENERGY_EFFICIENT,0,460,225.8,0);\n Financial fin(1,.05);\n FieldData fd(2000,277,FieldData::LoadEstimationMethod::POWER,\n 150,0,460);\n PSATResult psat(pump,motor,fin,fd);\n psat.calculate();\n auto ex = psat.getExisting(); \n Check(217.1,ex.motorCurrent_);\n\n Pump pump2(Pump::Style::END_SUCTION_ANSI_API,1780,Pump::Drive::DIRECT_DRIVE,\n 1,1,1,Pump::Speed::NOT_FIXED_SPEED);\n Motor motor2(Motor::LineFrequency::FREQ60,200,1780,\n Motor::EfficiencyClass::ENERGY_EFFICIENT,0,460,225.8,0);\n Financial fin2(1,.05);\n FieldData fd2(2000,277,FieldData::LoadEstimationMethod::CURRENT,\n 0,218,460);\n PSATResult psat2(pump2,motor2,fin2,fd2);\n psat2.calculate();\n auto ex2 = psat2.getExisting(); \n Check(150.7,ex2.motorPower_);\n\n}\n\n\nvoid Init(Local<Object> exports) {\n NODE_SET_METHOD(exports, \"results\", Results);\n NODE_SET_METHOD(exports, \"estFLA\", EstFLA); \n NODE_SET_METHOD(exports, \"test\", Test3); \n}\n\nNODE_MODULE(bridge, Init)\n\n<|endoftext|>"} {"text":"<commit_before><commit_msg>Power: Fix compile error from previous push.<commit_after><|endoftext|>"} {"text":"<commit_before><commit_msg>INTEGRATION: CWS ooxtablefilter (1.1.2); FILE ADDED 2008\/06\/10 11:57:47 sj 1.1.2.2: updating license text 2008\/03\/28 20:02:31 sj 1.1.2.1: initial version<commit_after><|endoftext|>"} {"text":"<commit_before>\/* -*- coding: utf-8; mode: c++; tab-width: 3; indent-tabs-mode: nil -*-\n\nCopyright 2010, 2011, 2012, 2013, 2014, 2015\nRaffaello D. Di Napoli\n\nThis file is part of Abaclade.\n\nAbaclade is free software: you can redistribute it and\/or modify it under the terms of the GNU\nGeneral Public License as published by the Free Software Foundation, either version 3 of the\nLicense, or (at your option) any later version.\n\nAbaclade is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY; without even\nthe implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General\nPublic License for more details.\n\nYou should have received a copy of the GNU General Public License along with Abaclade. If not, see\n<http:\/\/www.gnu.org\/licenses\/>.\n--------------------------------------------------------------------------------------------------*\/\n\n#ifndef _ABACLADE_HXX_INTERNAL\n #error \"Please #include <abaclade.hxx> instead of this file\"\n#endif\n\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ abc::noncopyable and compiler-specific STL type_traits fixes\n\nnamespace abc {\n\n\/\/! Makes a derived class not copyable.\nclass noncopyable {\nprotected:\n \/\/! Constructor. Protected to prevent instantiations of this class as-is.\n noncopyable() {\n }\n\n \/\/! Destructor. Protected to deter using this class as a polymorphic base.\n ~noncopyable() {\n }\n\n#ifdef ABC_CXX_FUNC_DELETE\n noncopyable(noncopyable const &) = delete;\n noncopyable & operator=(noncopyable const &) = delete;\n#else \/\/ifdef ABC_CXX_FUNC_DELETE\nprivate:\n noncopyable(noncopyable const &);\n noncopyable & operator=(noncopyable const &);\n#endif \/\/ifdef ABC_CXX_FUNC_DELETE … else\n};\n\n} \/\/namespace abc\n\n#ifdef ABC_STLIMPL\n #include <abaclade\/_std\/type_traits.hxx>\n#else\n #if ABC_HOST_CXX_MSC == 1800\n \/*! DOC:1082 std::is_copy_constructible MSC18 bugs\n\n With VS2013, Microsoft introduced a completely broken std::is_copy_constructible that makes\n one wish they didn’t: it returns true for classes with private copy constructors[1], classes\n with deleted constructors[2], and classes composed by non-copyable classes[2].\n [1] <https:\/\/connect.microsoft.com\/VisualStudio\/feedback\/details\/799732\/is-copy-constructible-\n always-returns-true-for-private-copy-constructors>\n [2] <https:\/\/connect.microsoft.com\/VisualStudio\/feedback\/details\/800328\/std-is-copy-\n constructible-is-broken>\n\n The only way of fixing it for both Abaclade without breaking MSC’s STL implementation is to\n override to enhance it with Abaclade’s version, making the latter fall back to MSC’s broken\n implementation. In the worst case, this might make it report classes as non-copyable when they\n are, but it will (hopefully) not report non-copyable classes as copyable. *\/\n #define is_copy_constructible _ABC_MSC18_is_copy_constructible\n #endif\n #include <type_traits>\n #if ABC_HOST_CXX_MSC == 1800\n #undef is_copy_constructible\n #endif\n#endif\n\n#if ( \\\n (ABC_HOST_CXX_GCC && ABC_HOST_CXX_GCC < 40700) || (ABC_HOST_CXX_MSC && ABC_HOST_CXX_MSC < 1900) \\\n) && !defined(ABC_STLIMPL)\n\nnamespace std {\n\n#if ABC_HOST_CXX_GCC\n \/\/ GCC lacks a definition of std::add_reference.\n template <typename T>\n struct add_reference {\n typedef T & type;\n };\n template <typename T>\n struct add_reference<T &> {\n typedef T & type;\n };\n#elif ABC_HOST_CXX_MSC < 1800\n \/\/ MSC16 lacks a definition of std::declval.\n template <typename T>\n typename add_rvalue_reference<T>::type declval();\n#endif\n\ntemplate <typename T, typename = void>\nstruct is_copy_constructible {\nprivate:\n static int test(T &);\n static char test(...);\n\n typedef typename add_reference<T>::type TRef;\n\npublic:\n static bool const value = (sizeof(test(declval<TRef>())) == sizeof(int))\n#if ABC_HOST_CXX_MSC == 1800\n \/* MSC18 does provide an implementation which, while severely flawed (see [DOC:1082\n std::is_copy_constructible MSC18 bugs]), may be stricter than this, so && its return value. *\/\n && _ABC_MSC18_is_copy_constructible<T>::value\n#endif\n ;\n};\n\ntemplate <typename T>\nstruct is_copy_constructible<T, typename enable_if<\n is_base_of< ::abc::noncopyable, T>::value\n>::type> : public false_type {};\n\n#define ABC_STLIMPL_IS_COPY_CONSTRUCTIBLE\n\n} \/\/namespace std\n\n#endif \/\/if ((ABC_HOST_CXX_GCC && ABC_HOST_CXX_GCC < 40700) ||\n \/\/ (ABC_HOST_CXX_MSC && ABC_HOST_CXX_MSC < 1900) && !defined(ABC_STLIMPL)\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n<commit_msg>Improve code documentation<commit_after>\/* -*- coding: utf-8; mode: c++; tab-width: 3; indent-tabs-mode: nil -*-\n\nCopyright 2010, 2011, 2012, 2013, 2014, 2015\nRaffaello D. Di Napoli\n\nThis file is part of Abaclade.\n\nAbaclade is free software: you can redistribute it and\/or modify it under the terms of the GNU\nGeneral Public License as published by the Free Software Foundation, either version 3 of the\nLicense, or (at your option) any later version.\n\nAbaclade is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY; without even\nthe implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General\nPublic License for more details.\n\nYou should have received a copy of the GNU General Public License along with Abaclade. If not, see\n<http:\/\/www.gnu.org\/licenses\/>.\n--------------------------------------------------------------------------------------------------*\/\n\n#ifndef _ABACLADE_HXX_INTERNAL\n #error \"Please #include <abaclade.hxx> instead of this file\"\n#endif\n\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ abc::noncopyable and compiler-specific STL type_traits fixes\n\nnamespace abc {\n\n\/*! Makes a derived class not copyable.\n\nDerive a class from this for maximum compatibility instead of explicitly deleting copy constructor\nand copy assignment operator. *\/\nclass noncopyable {\nprotected:\n \/\/! Constructor. Protected to prevent instantiations of this class as-is.\n noncopyable() {\n }\n\n \/\/! Destructor. Protected to deter using this class as a polymorphic base.\n ~noncopyable() {\n }\n\n#ifdef ABC_CXX_FUNC_DELETE\n noncopyable(noncopyable const &) = delete;\n noncopyable & operator=(noncopyable const &) = delete;\n#else\nprivate:\n noncopyable(noncopyable const &);\n noncopyable & operator=(noncopyable const &);\n#endif\n};\n\n} \/\/namespace abc\n\n#ifdef ABC_STLIMPL\n #include <abaclade\/_std\/type_traits.hxx>\n#else\n #if ABC_HOST_CXX_MSC == 1800\n \/*! DOC:1082 std::is_copy_constructible MSC18 bugs\n\n With VS2013, Microsoft introduced a completely broken std::is_copy_constructible that makes\n one wish they didn’t: it returns true for classes with private copy constructors[1], classes\n with deleted constructors[2], and classes composed by non-copyable classes[2].\n [1] <https:\/\/connect.microsoft.com\/VisualStudio\/feedback\/details\/799732\/is-copy-constructible-\n always-returns-true-for-private-copy-constructors>\n [2] <https:\/\/connect.microsoft.com\/VisualStudio\/feedback\/details\/800328\/std-is-copy-\n constructible-is-broken>\n\n The only way of fixing it for both Abaclade without breaking MSC’s STL implementation is to\n override to enhance it with Abaclade’s version, making the latter fall back to MSC’s broken\n implementation. In the worst case, this might make it report classes as non-copyable when they\n are, but it will (hopefully) not report non-copyable classes as copyable. *\/\n #define is_copy_constructible _ABC_MSC18_is_copy_constructible\n #endif\n #include <type_traits>\n #if ABC_HOST_CXX_MSC == 1800\n #undef is_copy_constructible\n #endif\n#endif\n\n#if ( \\\n (ABC_HOST_CXX_GCC && ABC_HOST_CXX_GCC < 40700) || (ABC_HOST_CXX_MSC && ABC_HOST_CXX_MSC < 1900) \\\n) && !defined(ABC_STLIMPL)\n\nnamespace std {\n\n#if ABC_HOST_CXX_GCC\n \/\/ GCC lacks a definition of std::add_reference.\n template <typename T>\n struct add_reference {\n typedef T & type;\n };\n template <typename T>\n struct add_reference<T &> {\n typedef T & type;\n };\n#elif ABC_HOST_CXX_MSC < 1800\n \/\/ MSC16 lacks a definition of std::declval.\n template <typename T>\n typename add_rvalue_reference<T>::type declval();\n#endif\n\ntemplate <typename T, typename = void>\nstruct is_copy_constructible {\nprivate:\n static int test(T &);\n static char test(...);\n\n typedef typename add_reference<T>::type TRef;\n\npublic:\n static bool const value = (sizeof(test(declval<TRef>())) == sizeof(int))\n#if ABC_HOST_CXX_MSC == 1800\n \/* MSC18 does provide an implementation which, while severely flawed (see [DOC:1082\n std::is_copy_constructible MSC18 bugs]), may be stricter than this, so && its return value. *\/\n && _ABC_MSC18_is_copy_constructible<T>::value\n#endif\n ;\n};\n\ntemplate <typename T>\nstruct is_copy_constructible<T, typename enable_if<\n is_base_of< ::abc::noncopyable, T>::value\n>::type> : public false_type {};\n\n#define ABC_STLIMPL_IS_COPY_CONSTRUCTIBLE\n\n} \/\/namespace std\n\n#endif \/\/if ((ABC_HOST_CXX_GCC && ABC_HOST_CXX_GCC < 40700) ||\n \/\/ (ABC_HOST_CXX_MSC && ABC_HOST_CXX_MSC < 1900) && !defined(ABC_STLIMPL)\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n<|endoftext|>"} {"text":"<commit_before>\/\/ Part of the apollo library -- Copyright (c) Christian Neumüller 2015\n\/\/ This file is subject to the terms of the BSD 2-Clause License.\n\/\/ See LICENSE.txt or http:\/\/opensource.org\/licenses\/BSD-2-Clause\n\n#ifndef APOLLO_BUILTIN_TYPES_HPP_INCLUDED\n#define APOLLO_BUILTIN_TYPES_HPP_INCLUDED APOLLO_BUILTIN_TYPES_HPP_INCLUDED\n\n#include <apollo\/config.hpp>\n#include <apollo\/converters.hpp>\n\n#include <boost\/assert.hpp>\n\n#include <limits>\n#include <string>\n\nnamespace apollo {\n\n\/\/ Number converter \/\/\ntemplate<typename T>\nstruct converter<T, typename std::enable_if<\n !std::is_enum<T>::value\n && detail::lua_type_id<T>::value == LUA_TNUMBER>::type\n >: converter_base<T> {\nprivate:\n using llimits = std::numeric_limits<lua_Integer>;\n static bool const is_integral = std::is_integral<T>::value;\n static bool const is_safe_integral = is_integral &&\n sizeof(T) <= sizeof(lua_Integer) &&\n std::is_signed<T>::value == std::is_signed<lua_Integer>::value;\n\npublic:\n static int push(lua_State* L, T n)\n {\n#ifdef BOOST_MSVC\n# pragma warning(push)\n# pragma warning(disable:4127) \/\/ Conditional expression is constant.\n#endif\n if (is_integral && (is_safe_integral\n#if LUA_VERSION_NUM >= 503 \/\/ Not worth the effort on < 5.3.\n || (n >= llimits::min() && n <= llimits::max())\n#endif \/\/ LUA_VERSION_NUM >= 503\n )) {\n#ifdef BOOST_MSVC\n# pragma warning(pop)\n#endif\n lua_pushinteger(L, static_cast<lua_Integer>(n));\n } else {\n lua_pushnumber(L, static_cast<lua_Number>(n));\n }\n return 1;\n }\n\n static unsigned n_conversion_steps(lua_State* L, int idx)\n {\n if (lua_type(L, idx) == LUA_TNUMBER) { \/\/ Actual number.\n#if LUA_VERSION_NUM >= 503\n if ((lua_isinteger(L, idx) ? true : false) == is_integral)\n return 0;\n return 1;\n#else \/\/ LUA_VERSION_NUM >= 503\n return 0;\n#endif \/\/ LUA_VERSION_NUM >= 503 \/ else\n }\n if (lua_isnumber(L, idx)) \/\/ String convertible to number.\n return 2;\n return no_conversion;\n }\n\n static T to(lua_State* L, int idx)\n {\n#if LUA_VERSION_NUM >= 503\n# ifdef BOOST_MSVC\n# pragma warning(push)\n# pragma warning(disable:4127) \/\/ Conditional expression is constant.\n# endif\n if (is_integral && lua_isinteger(L, idx))\n return static_cast<T>(lua_tointeger(L, idx));\n# ifdef BOOST_MSVC\n# pragma warning(pop)\n# endif\n#endif\n return static_cast<T>(lua_tonumber(L, idx));\n }\n};\n\n\n\/\/ Enum converter \/\/\ntemplate<typename T>\nstruct converter<T,\n typename std::enable_if<std::is_enum<T>::value>::type\n >: converter_base<T> {\n\n static int push(lua_State* L, T n)\n {\n lua_pushinteger(L, static_cast<lua_Integer>(n));\n return 1;\n }\n\n static unsigned n_conversion_steps(lua_State* L, int idx)\n {\n if (lua_type(L, idx) == LUA_TNUMBER)\n return 1;\n return no_conversion;\n }\n\n static T to(lua_State* L, int idx)\n {\n return static_cast<T>(lua_tointeger(L, idx));\n }\n};\n\n\n\/\/ Boolean converter \/\/\ntemplate<>\nstruct converter<bool>: converter_base<bool> {\n\n static int push(lua_State* L, bool b)\n {\n lua_pushboolean(L, static_cast<int>(b));\n return 1;\n }\n\n static unsigned n_conversion_steps(lua_State* L, int idx)\n {\n \/\/ Convert non-boolean values to bool only as a last resort.\n return lua_isboolean(L, idx) ? 0 : no_conversion - 1;\n }\n\n static bool to(lua_State* L, int idx)\n {\n \/\/ Avoid MSVC \"performance warning\" about int to bool conversion with\n \/\/ ternary operator.\n return lua_toboolean(L, idx) ? true : false;\n }\n};\n\n\/\/ void converter \/\/\ntemplate<>\nstruct converter<void>: converter_base<void> {\n static unsigned n_conversion_steps(lua_State*, int)\n {\n return no_conversion - 1;\n }\n\n static void to(lua_State*, int)\n { }\n};\n\n\n\/\/ String converter \/\/\n\nnamespace detail {\n\ninline void push_string(lua_State* L, char c)\n{\n lua_pushlstring(L, &c, 1);\n}\n\ntemplate <std::size_t N>\nvoid push_string(lua_State* L, char const (&s)[N])\n{\n \/\/ Don't count null termination.\n lua_pushlstring(L, s, N - (s[N - 1] == 0));\n}\n\n\/\/ Need to make this a template too, so that the array overload is called in\n\/\/ the appropriate cases. Also can't make it const T* because otherwise the\n\/\/ call would be ambigous.\ntemplate <typename T>\ninline void push_string(lua_State* L, T s)\n{\n using T2 = typename remove_qualifiers<T>::type;\n static_assert(\n std::is_same<T2, char*>::value || std::is_same<T2, char const*>::value,\n \"push_string called with non-string\");\n lua_pushstring(L, s);\n}\n\ninline void push_string(lua_State* L, std::string const& s)\n{\n lua_pushlstring(L, s.c_str(), s.size());\n}\n\ntemplate <typename T>\nstruct to_string { \/\/ char*, char const*, char[N]\n using type = char const*;\n static type to(lua_State* L, int idx)\n {\n return lua_tostring(L, idx);\n }\n};\n\ntemplate <>\nstruct to_string<std::string> {\n using type = std::string;\n static type to(lua_State* L, int idx)\n {\n std::size_t len;\n char const* s = lua_tolstring(L, idx, &len);\n return std::string(s, len);\n }\n};\n\ntemplate <>\nstruct to_string<char> {\n using type = char;\n static type to(lua_State* L, int idx)\n {\n std::size_t len;\n char const* s = lua_tolstring(L, idx, &len);\n BOOST_ASSERT(len == 1);\n return s[0];\n }\n};\n\ntemplate <typename>\nstruct string_conversion_steps {\n static unsigned get(lua_State* L, int idx)\n {\n switch(lua_type(L, idx)) {\n case LUA_TSTRING:\n return 0;\n case LUA_TNUMBER:\n return 1;\n default:\n return no_conversion;\n }\n BOOST_UNREACHABLE_RETURN(no_conversion);\n }\n};\n\ntemplate <>\nstruct APOLLO_API string_conversion_steps<char> {\n static unsigned get(lua_State* L, int idx);\n};\n\n} \/\/ namespace detail\n\ntemplate <typename T>\nstruct converter<T, typename std::enable_if<\n detail::lua_type_id<T>::value == LUA_TSTRING>::type>: converter_base<T> {\n using to_type = typename detail::to_string<T>::type;\n\n static int push(lua_State* L, T const& s)\n {\n detail::push_string(L, s);\n return 1;\n }\n\n static unsigned n_conversion_steps(lua_State* L, int idx)\n {\n return detail::string_conversion_steps<T>::get(L, idx);\n }\n\n static to_type to(lua_State* L, int idx)\n {\n return detail::to_string<T>::to(L, idx);\n }\n};\n\ntemplate <>\nstruct converter<void*>: converter_base<void*> {\n static int push(lua_State* L, void* p)\n {\n lua_pushlightuserdata(L, p);\n return 1;\n }\n\n static unsigned n_conversion_steps(lua_State* L, int idx)\n {\n return lua_islightuserdata(L, idx) ? 0 : no_conversion;\n }\n\n static void* to(lua_State* L, int idx)\n {\n return lua_touserdata(L, idx);\n }\n};\n\n} \/\/ namepace apollo\n\n#endif \/\/ APOLLO_CONVERTERS_HPP_INCLUDED\n<commit_msg>Fix check if number fits in lua_Integer.<commit_after>\/\/ Part of the apollo library -- Copyright (c) Christian Neumüller 2015\n\/\/ This file is subject to the terms of the BSD 2-Clause License.\n\/\/ See LICENSE.txt or http:\/\/opensource.org\/licenses\/BSD-2-Clause\n\n#ifndef APOLLO_BUILTIN_TYPES_HPP_INCLUDED\n#define APOLLO_BUILTIN_TYPES_HPP_INCLUDED APOLLO_BUILTIN_TYPES_HPP_INCLUDED\n\n#include <apollo\/config.hpp>\n#include <apollo\/converters.hpp>\n\n#include <boost\/assert.hpp>\n\n#include <cstdint>\n#include <limits>\n#include <string>\n\nnamespace apollo {\n\n\/\/ Number converter \/\/\ntemplate<typename T>\nstruct converter<T, typename std::enable_if<\n !std::is_enum<T>::value\n && detail::lua_type_id<T>::value == LUA_TNUMBER>::type\n >: converter_base<T> {\nprivate:\n static bool const is_integral = std::is_integral<T>::value;\n static bool const is_safe_integral = is_integral &&\n sizeof(T) <= sizeof(lua_Integer) &&\n std::is_signed<T>::value == std::is_signed<lua_Integer>::value;\n\npublic:\n static int push(lua_State* L, T n)\n {\n#ifdef BOOST_MSVC\n# pragma warning(push)\n# pragma warning(disable:4127) \/\/ Conditional expression is constant.\n#endif\n if (is_integral && (is_safe_integral\n#if LUA_VERSION_NUM >= 503 \/\/ Not worth the effort on < 5.3.\n || fits_in_lua_integer(n)\n#endif \/\/ LUA_VERSION_NUM >= 503\n )) {\n#ifdef BOOST_MSVC\n# pragma warning(pop)\n#endif\n lua_pushinteger(L, static_cast<lua_Integer>(n));\n } else {\n lua_pushnumber(L, static_cast<lua_Number>(n));\n }\n return 1;\n }\n\n static unsigned n_conversion_steps(lua_State* L, int idx)\n {\n if (lua_type(L, idx) == LUA_TNUMBER) { \/\/ Actual number.\n#if LUA_VERSION_NUM >= 503\n if ((lua_isinteger(L, idx) ? true : false) == is_integral)\n return 0;\n return 1;\n#else \/\/ LUA_VERSION_NUM >= 503\n return 0;\n#endif \/\/ LUA_VERSION_NUM >= 503 \/ else\n }\n if (lua_isnumber(L, idx)) \/\/ String convertible to number.\n return 2;\n return no_conversion;\n }\n\n static T to(lua_State* L, int idx)\n {\n#if LUA_VERSION_NUM >= 503\n# ifdef BOOST_MSVC\n# pragma warning(push)\n# pragma warning(disable:4127) \/\/ Conditional expression is constant.\n# endif\n if (is_integral && lua_isinteger(L, idx))\n return static_cast<T>(lua_tointeger(L, idx));\n# ifdef BOOST_MSVC\n# pragma warning(pop)\n# endif\n#endif\n return static_cast<T>(lua_tonumber(L, idx));\n }\n\nprivate:\n \/\/ Inspired by http:\/\/stackoverflow.com\/a\/17251989.\n static bool fits_in_lua_integer(T n) {\n using llimits = std::numeric_limits<lua_Integer>;\n using tlimits = std::numeric_limits<T>;\n auto const l_lo = static_cast<std::intmax_t>(llimits::min());\n auto const t_lo = static_cast<std::intmax_t>(tlimits::min());\n auto const l_hi = static_cast<std::uintmax_t>(llimits::max());\n auto const t_hi = static_cast<std::uintmax_t>(tlimits::max());\n return (l_lo <= t_lo || n >= static_cast<T>(l_lo)) \/\/ Check underflow.\n && (l_hi >= t_hi || n <= static_cast<T>(l_hi)); \/\/ Check overflow.\n }\n};\n\n\n\/\/ Enum converter \/\/\ntemplate<typename T>\nstruct converter<T,\n typename std::enable_if<std::is_enum<T>::value>::type\n >: converter_base<T> {\n\n static int push(lua_State* L, T n)\n {\n lua_pushinteger(L, static_cast<lua_Integer>(n));\n return 1;\n }\n\n static unsigned n_conversion_steps(lua_State* L, int idx)\n {\n if (lua_type(L, idx) == LUA_TNUMBER)\n return 1;\n return no_conversion;\n }\n\n static T to(lua_State* L, int idx)\n {\n return static_cast<T>(lua_tointeger(L, idx));\n }\n};\n\n\n\/\/ Boolean converter \/\/\ntemplate<>\nstruct converter<bool>: converter_base<bool> {\n\n static int push(lua_State* L, bool b)\n {\n lua_pushboolean(L, static_cast<int>(b));\n return 1;\n }\n\n static unsigned n_conversion_steps(lua_State* L, int idx)\n {\n \/\/ Convert non-boolean values to bool only as a last resort.\n return lua_isboolean(L, idx) ? 0 : no_conversion - 1;\n }\n\n static bool to(lua_State* L, int idx)\n {\n \/\/ Avoid MSVC \"performance warning\" about int to bool conversion with\n \/\/ ternary operator.\n return lua_toboolean(L, idx) ? true : false;\n }\n};\n\n\/\/ void converter \/\/\ntemplate<>\nstruct converter<void>: converter_base<void> {\n static unsigned n_conversion_steps(lua_State*, int)\n {\n return no_conversion - 1;\n }\n\n static void to(lua_State*, int)\n { }\n};\n\n\n\/\/ String converter \/\/\n\nnamespace detail {\n\ninline void push_string(lua_State* L, char c)\n{\n lua_pushlstring(L, &c, 1);\n}\n\ntemplate <std::size_t N>\nvoid push_string(lua_State* L, char const (&s)[N])\n{\n \/\/ Don't count null termination.\n lua_pushlstring(L, s, N - (s[N - 1] == 0));\n}\n\n\/\/ Need to make this a template too, so that the array overload is called in\n\/\/ the appropriate cases. Also can't make it const T* because otherwise the\n\/\/ call would be ambigous.\ntemplate <typename T>\ninline void push_string(lua_State* L, T s)\n{\n using T2 = typename remove_qualifiers<T>::type;\n static_assert(\n std::is_same<T2, char*>::value || std::is_same<T2, char const*>::value,\n \"push_string called with non-string\");\n lua_pushstring(L, s);\n}\n\ninline void push_string(lua_State* L, std::string const& s)\n{\n lua_pushlstring(L, s.c_str(), s.size());\n}\n\ntemplate <typename T>\nstruct to_string { \/\/ char*, char const*, char[N]\n using type = char const*;\n static type to(lua_State* L, int idx)\n {\n return lua_tostring(L, idx);\n }\n};\n\ntemplate <>\nstruct to_string<std::string> {\n using type = std::string;\n static type to(lua_State* L, int idx)\n {\n std::size_t len;\n char const* s = lua_tolstring(L, idx, &len);\n return std::string(s, len);\n }\n};\n\ntemplate <>\nstruct to_string<char> {\n using type = char;\n static type to(lua_State* L, int idx)\n {\n std::size_t len;\n char const* s = lua_tolstring(L, idx, &len);\n BOOST_ASSERT(len == 1);\n return s[0];\n }\n};\n\ntemplate <typename>\nstruct string_conversion_steps {\n static unsigned get(lua_State* L, int idx)\n {\n switch(lua_type(L, idx)) {\n case LUA_TSTRING:\n return 0;\n case LUA_TNUMBER:\n return 1;\n default:\n return no_conversion;\n }\n BOOST_UNREACHABLE_RETURN(no_conversion);\n }\n};\n\ntemplate <>\nstruct APOLLO_API string_conversion_steps<char> {\n static unsigned get(lua_State* L, int idx);\n};\n\n} \/\/ namespace detail\n\ntemplate <typename T>\nstruct converter<T, typename std::enable_if<\n detail::lua_type_id<T>::value == LUA_TSTRING>::type>: converter_base<T> {\n using to_type = typename detail::to_string<T>::type;\n\n static int push(lua_State* L, T const& s)\n {\n detail::push_string(L, s);\n return 1;\n }\n\n static unsigned n_conversion_steps(lua_State* L, int idx)\n {\n return detail::string_conversion_steps<T>::get(L, idx);\n }\n\n static to_type to(lua_State* L, int idx)\n {\n return detail::to_string<T>::to(L, idx);\n }\n};\n\ntemplate <>\nstruct converter<void*>: converter_base<void*> {\n static int push(lua_State* L, void* p)\n {\n lua_pushlightuserdata(L, p);\n return 1;\n }\n\n static unsigned n_conversion_steps(lua_State* L, int idx)\n {\n return lua_islightuserdata(L, idx) ? 0 : no_conversion;\n }\n\n static void* to(lua_State* L, int idx)\n {\n return lua_touserdata(L, idx);\n }\n};\n\n} \/\/ namepace apollo\n\n#endif \/\/ APOLLO_CONVERTERS_HPP_INCLUDED\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_ACCESSOR_BUNDLE_HPP__\n#define CMOH_ACCESSOR_BUNDLE_HPP__\n\n\n\/\/ std includes\n#include <type_traits>\n#include <utility>\n\n\/\/ local includes\n#include <cmoh\/utils.hpp>\n\n\nnamespace cmoh {\n\n\n\/**\n * Accessor bundle\n *\n * Instantiations of this template bundle accessors and make them conveniently\n * accessible as a group, posing as an abstraction layer.\n *\n * TODO: further explanation\n *\n * Users are discouraged from constructing accessor bundles directly. Use\n * `bundle()` instread as a factory.\n *\/\ntemplate <\n typename ...Accessors\n>\nclass accessor_bundle;\n\n\n\/\/ Main specialization\ntemplate <\n typename Accessor,\n typename ...Accessors\n>\nclass accessor_bundle<Accessor, Accessors...> {\n typedef Accessor accessor;\n accessor _accessor;\n\n typedef accessor_bundle<Accessors...> next;\n next _next;\n\npublic:\n \/**\n * The C++ type which may be accessed using the accessor bundle\n *\/\n typedef typename std::conditional<\n util::count<Accessors...>::value == 0,\n typename accessor::object_type,\n typename next::object_type\n >::type object_type;\n static_assert(\n std::is_same<typename accessor::object_type, object_type>::value,\n \"All accessors in a bundle must have the same object type\"\n );\n\n accessor_bundle(accessor current, Accessors... accessors) :\n _accessor(std::forward<accessor>(current)),\n _next(std::forward<Accessors>(accessors)...) {};\n accessor_bundle(accessor_bundle const&) = default;\n accessor_bundle(accessor_bundle&&) = default;\n accessor_bundle() = delete;\n\n \/**\n * Get the value of a specific attribute from an object\n *\n * \\returns the value of the attribute\n *\/\n template <typename Attribute>\n typename std::enable_if<\n !std::is_same<Attribute, typename accessor::attr>::value,\n typename Attribute::type\n >::type\n get(\n object_type const& obj \/\/\/< object from which to get the value\n ) const {\n return _next.template get<Attribute>(obj);\n }\n\n template <typename Attribute>\n typename std::enable_if<\n std::is_same<Attribute, typename accessor::attr>::value,\n typename Attribute::type\n >::type\n get(\n object_type const& obj \/\/\/< object from which to get the value\n ) const {\n return _accessor.get(obj);\n }\n\n \/**\n * Set the value of a specific attribute on an object\n *\/\n template <typename Attribute>\n typename std::enable_if<\n !std::is_same<Attribute, typename accessor::attr>::value\n >::type\n set(\n object_type& obj, \/\/\/< object on which to set the attribute\n typename Attribute::type&& value \/\/\/< value to set\n ) const {\n _next.template set<Attribute>(obj, std::forward<typename Attribute::type>(value));\n }\n\n template <typename Attribute>\n typename std::enable_if<\n std::is_same<Attribute, typename accessor::attr>::value\n >::type\n set(\n object_type& obj, \/\/\/< object on which to set the attribute\n typename Attribute::type&& value \/\/\/< value to set\n ) const {\n _accessor.set(obj, std::forward<typename Attribute::type>(value));\n }\n};\n\n\n\/\/ Recursion terminator\ntemplate <>\nclass accessor_bundle<> {\npublic:\n typedef void object_type;\n\n \/\/ accept whatever comes in and error out\n template <typename Attribute, typename ObjectType>\n typename Attribute::type\n get(\n ObjectType const& obj\n ) const {\n static_assert(\n true,\n \"The attribute can not be accessed via this bundle.\"\n );\n }\n\n \/\/ accept whatever comes in and error out\n template <typename ObjectType, typename Value>\n void\n get(\n ObjectType const& obj,\n Value&& value\n ) const {\n static_assert(\n true,\n \"The attribute can not be accessed via this bundle.\"\n );\n }\n};\n\n\n\/**\n * Construct an accessor bundle from a bunch of accessors\n *\n * \\returns an accessor bundle holding all the accessors supplied\n *\/\ntemplate <\n typename ...Accessors\n>\nconstexpr\nconst\naccessor_bundle<Accessors...>\nbundle(\n Accessors... accessors \/\/\/< accessors to bundle\n) {\n return accessor_bundle<Accessors...>(std::forward<Accessors>(accessors)...);\n}\n\n\n}\n\n\n#endif\n<commit_msg>Fix cmoh::bundle() factory<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_ACCESSOR_BUNDLE_HPP__\n#define CMOH_ACCESSOR_BUNDLE_HPP__\n\n\n\/\/ std includes\n#include <type_traits>\n#include <utility>\n\n\/\/ local includes\n#include <cmoh\/utils.hpp>\n\n\nnamespace cmoh {\n\n\n\/**\n * Accessor bundle\n *\n * Instantiations of this template bundle accessors and make them conveniently\n * accessible as a group, posing as an abstraction layer.\n *\n * TODO: further explanation\n *\n * Users are discouraged from constructing accessor bundles directly. Use\n * `bundle()` instread as a factory.\n *\/\ntemplate <\n typename ...Accessors\n>\nclass accessor_bundle;\n\n\n\/\/ Main specialization\ntemplate <\n typename Accessor,\n typename ...Accessors\n>\nclass accessor_bundle<Accessor, Accessors...> {\n typedef Accessor accessor;\n accessor _accessor;\n\n typedef accessor_bundle<Accessors...> next;\n next _next;\n\npublic:\n \/**\n * The C++ type which may be accessed using the accessor bundle\n *\/\n typedef typename std::conditional<\n util::count<Accessors...>::value == 0,\n typename accessor::object_type,\n typename next::object_type\n >::type object_type;\n static_assert(\n std::is_same<typename accessor::object_type, object_type>::value,\n \"All accessors in a bundle must have the same object type\"\n );\n\n accessor_bundle(accessor current, Accessors... accessors) :\n _accessor(std::forward<accessor>(current)),\n _next(std::forward<Accessors>(accessors)...) {};\n accessor_bundle(accessor_bundle const&) = default;\n accessor_bundle(accessor_bundle&&) = default;\n accessor_bundle() = delete;\n\n \/**\n * Get the value of a specific attribute from an object\n *\n * \\returns the value of the attribute\n *\/\n template <typename Attribute>\n typename std::enable_if<\n !std::is_same<Attribute, typename accessor::attr>::value,\n typename Attribute::type\n >::type\n get(\n object_type const& obj \/\/\/< object from which to get the value\n ) const {\n return _next.template get<Attribute>(obj);\n }\n\n template <typename Attribute>\n typename std::enable_if<\n std::is_same<Attribute, typename accessor::attr>::value,\n typename Attribute::type\n >::type\n get(\n object_type const& obj \/\/\/< object from which to get the value\n ) const {\n return _accessor.get(obj);\n }\n\n \/**\n * Set the value of a specific attribute on an object\n *\/\n template <typename Attribute>\n typename std::enable_if<\n !std::is_same<Attribute, typename accessor::attr>::value\n >::type\n set(\n object_type& obj, \/\/\/< object on which to set the attribute\n typename Attribute::type&& value \/\/\/< value to set\n ) const {\n _next.template set<Attribute>(obj, std::forward<typename Attribute::type>(value));\n }\n\n template <typename Attribute>\n typename std::enable_if<\n std::is_same<Attribute, typename accessor::attr>::value\n >::type\n set(\n object_type& obj, \/\/\/< object on which to set the attribute\n typename Attribute::type&& value \/\/\/< value to set\n ) const {\n _accessor.set(obj, std::forward<typename Attribute::type>(value));\n }\n};\n\n\n\/\/ Recursion terminator\ntemplate <>\nclass accessor_bundle<> {\npublic:\n typedef void object_type;\n\n \/\/ accept whatever comes in and error out\n template <typename Attribute, typename ObjectType>\n typename Attribute::type\n get(\n ObjectType const& obj\n ) const {\n static_assert(\n true,\n \"The attribute can not be accessed via this bundle.\"\n );\n }\n\n \/\/ accept whatever comes in and error out\n template <typename ObjectType, typename Value>\n void\n get(\n ObjectType const& obj,\n Value&& value\n ) const {\n static_assert(\n true,\n \"The attribute can not be accessed via this bundle.\"\n );\n }\n};\n\n\n\/**\n * Construct an accessor bundle from a bunch of accessors\n *\n * \\returns an accessor bundle holding all the accessors supplied\n *\/\ntemplate <\n typename ...Accessors\n>\nconstexpr\nconst\naccessor_bundle<Accessors...>\nbundle(\n Accessors&&... accessors \/\/\/< accessors to bundle\n) {\n return accessor_bundle<Accessors...>(std::forward<Accessors>(accessors)...);\n}\n\n\n}\n\n\n#endif\n<|endoftext|>"} {"text":"<commit_before>#include <ros\/ros.h>\n#include \"arduino.h\"\n\/\/#include <core_msgs\/Odom.h>\n#include <buzzmobile\/CarPose.h>\n\/\/#include <core_msgs\/MotionCommand.h>\n#include <std_msgs\/Bool.h>\n\nusing namespace std;\n\nconst double ticksPerRev = 3600;\nconst double wheelCirc = 2.198;\n\nros::Publisher encoder_pub;\nros::Subscriber command_sub;\n\/\/ros::Subscriber horn_sub;\n\nArduino arduino;\n\n\/\/int odom_sequence = 0;\n\nros::Time last_command_time;\n\nros::Duration keep_alive_frequency(1.0);\n\n\/\/void odometry_callback(int, float);\n\n\/\/void command_callback(core_msgs::MotionCommand::ConstPtr);\nvoid command_callback(buzzmobile::CarPose::ConstPtr);\n\n\/\/void horn_callback(std_msgs::Bool::ConstPtr);\n\nvoid keep_alive_callback(const ros::TimerEvent&);\n\nint main(int argc, char **argv) {\n\n ros::init(argc, argv, \"car_interface\");\n\n \/\/arduino.open(\"\/dev\/arduino_motor_controller\", 9600);\n arduino.open(\"\/dev\/ttyACM0\", 9600);\n \/\/arduino.setOdometryCallback(odometry_callback);\n\n ros::NodeHandle node_handle;\n\n last_command_time = ros::Time::now();\n\n \/\/encoder_pub = node_handle.advertise<core_msgs::Odom>(\"encoder_odom\", 1000);\n\n command_sub = node_handle.subscribe(\"car_pose\", 1, command_callback);\n\n \/\/horn_sub = node_handle.subscribe(\"car_horn\", 1, horn_callback);\n\n ros::Timer keepAliveTimer = node_handle.createTimer(keep_alive_frequency, keep_alive_callback);\n ros::spin();\n\n return 0;\n}\n\nvoid keep_alive_callback(const ros::TimerEvent&) {\n ROS_INFO(\"Keep alive callback called\");\n \/\/ 1 sec command frequency required to maintain velocity\n if((ros::Time::now() - last_command_time) > keep_alive_frequency) {\n arduino.setSpeed(0);\n }\n}\n\/**\nvoid odometry_callback(int tickCount, float steeringAngle) {\n core_msgs::Odom msg;\n msg.distance_travelled = (tickCount * wheelCirc) \/ ticksPerRev;\n msg.steering_angle = steeringAngle;\n msg.header.seq = odom_sequence++;\n msg.header.stamp = ros::Time::now();\n encoder_pub.publish(msg);\n}*\/\n\n\/\/void command_callback(core_msgs::MotionCommand::ConstPtr cmd) {\nvoid command_callback(buzzmobile::CarPose::ConstPtr cmd) {\n ROS_INFO(\"Command received, speed: %f, angle: %f\", cmd->velocity, cmd->angle);\n \/\/arduino.setSpeed(cmd->speed);\n arduino.setSpeed(cmd->velocity);\n arduino.setSteering(cmd->angle);\n arduino.setHorn(cmd->horn);\n last_command_time = cmd->header.stamp;\n}\n\n\/\/void horn_callback(std_msgs::Bool::ConstPtr msg) {\n \/\/ROS_INFO(\"Turning %s horn.\", (msg->data ? \"on\" : \"off\"));\n \/\/arduino.setHorn(msg->data);\n\/\/}\n<commit_msg>Delete comments<commit_after>#include <ros\/ros.h>\n#include \"arduino.h\"\n\/\/#include <core_msgs\/Odom.h>\n#include <buzzmobile\/CarPose.h>\n\/\/#include <core_msgs\/MotionCommand.h>\n#include <std_msgs\/Bool.h>\n\nusing namespace std;\n\nconst double ticksPerRev = 3600;\nconst double wheelCirc = 2.198;\n\nros::Publisher encoder_pub;\nros::Subscriber command_sub;\n\nArduino arduino;\n\n\/\/int odom_sequence = 0;\n\nros::Time last_command_time;\n\nros::Duration keep_alive_frequency(1.0);\n\n\/\/void odometry_callback(int, float);\n\n\/\/void command_callback(core_msgs::MotionCommand::ConstPtr);\nvoid command_callback(buzzmobile::CarPose::ConstPtr);\n\nvoid keep_alive_callback(const ros::TimerEvent&);\n\nint main(int argc, char **argv) {\n\n ros::init(argc, argv, \"car_interface\");\n\n \/\/arduino.open(\"\/dev\/arduino_motor_controller\", 9600);\n arduino.open(\"\/dev\/ttyACM0\", 9600);\n \/\/arduino.setOdometryCallback(odometry_callback);\n\n ros::NodeHandle node_handle;\n\n last_command_time = ros::Time::now();\n\n \/\/encoder_pub = node_handle.advertise<core_msgs::Odom>(\"encoder_odom\", 1000);\n\n command_sub = node_handle.subscribe(\"car_pose\", 1, command_callback);\n\n ros::Timer keepAliveTimer = node_handle.createTimer(keep_alive_frequency, keep_alive_callback);\n ros::spin();\n\n return 0;\n}\n\nvoid keep_alive_callback(const ros::TimerEvent&) {\n ROS_INFO(\"Keep alive callback called\");\n \/\/ 1 sec command frequency required to maintain velocity\n if((ros::Time::now() - last_command_time) > keep_alive_frequency) {\n arduino.setSpeed(0);\n }\n}\n\/**\nvoid odometry_callback(int tickCount, float steeringAngle) {\n core_msgs::Odom msg;\n msg.distance_travelled = (tickCount * wheelCirc) \/ ticksPerRev;\n msg.steering_angle = steeringAngle;\n msg.header.seq = odom_sequence++;\n msg.header.stamp = ros::Time::now();\n encoder_pub.publish(msg);\n}*\/\n\n\/\/void command_callback(core_msgs::MotionCommand::ConstPtr cmd) {\nvoid command_callback(buzzmobile::CarPose::ConstPtr cmd) {\n ROS_INFO(\"Command received, speed: %f, angle: %f\", cmd->velocity, cmd->angle);\n \/\/arduino.setSpeed(cmd->speed);\n arduino.setSpeed(cmd->velocity);\n arduino.setSteering(cmd->angle);\n arduino.setHorn(cmd->horn);\n last_command_time = cmd->header.stamp;\n}\n\n\/\/void horn_callback(std_msgs::Bool::ConstPtr msg) {\n \/\/ROS_INFO(\"Turning %s horn.\", (msg->data ? \"on\" : \"off\"));\n \/\/arduino.setHorn(msg->data);\n\/\/}\n<|endoftext|>"} {"text":"<commit_before>\/*\n * Copyright 2011 Google Inc.\n *\n * Use of this source code is governed by a BSD-style license that can be\n * found in the LICENSE file.\n *\/\n\n#include \"gm.h\"\n#include \"SkCanvas.h\"\n#include \"SkPath.h\"\n#include \"SkGradientShader.h\"\n#include \"SkTypeface.h\"\n\nstatic SkShader* make_heatGradient(const SkPoint pts[2]) {\n#if 0 \/\/ UNUSED\n const SkColor colors[] = {\n SK_ColorBLACK, SK_ColorBLUE, SK_ColorCYAN, SK_ColorGREEN,\n SK_ColorYELLOW, SK_ColorRED, SK_ColorWHITE\n };\n#endif\n const SkColor bw[] = { SK_ColorBLACK, SK_ColorWHITE };\n\n return SkGradientShader::CreateLinear(pts, bw, NULL,\n SK_ARRAY_COUNT(bw),\n SkShader::kClamp_TileMode);\n}\n\nstatic bool setFont(SkPaint* paint, const char name[]) {\n SkTypeface* tf = sk_tool_utils::create_portable_typeface(name, SkTypeface::kNormal);\n if (tf) {\n paint->setTypeface(tf)->unref();\n return true;\n }\n return false;\n}\n\n#ifdef SK_BUILD_FOR_MAC\n#import <ApplicationServices\/ApplicationServices.h>\n#define BITMAP_INFO_RGB (kCGImageAlphaNoneSkipFirst | kCGBitmapByteOrder32Host)\n\nstatic CGContextRef makeCG(const SkImageInfo& info, const void* addr,\n size_t rowBytes) {\n if (kN32_SkColorType != info.colorType() || NULL == addr) {\n return NULL;\n }\n CGColorSpaceRef space = CGColorSpaceCreateDeviceRGB();\n CGContextRef cg = CGBitmapContextCreate((void*)addr, info.width(), info.height(),\n 8, rowBytes, space, BITMAP_INFO_RGB);\n CFRelease(space);\n\n CGContextSetAllowsFontSubpixelQuantization(cg, false);\n CGContextSetShouldSubpixelQuantizeFonts(cg, false);\n\n return cg;\n}\n\nextern CTFontRef SkTypeface_GetCTFontRef(const SkTypeface* face);\n\nstatic CGFontRef typefaceToCGFont(const SkTypeface* face) {\n if (NULL == face) {\n return 0;\n }\n\n CTFontRef ct = SkTypeface_GetCTFontRef(face);\n return CTFontCopyGraphicsFont(ct, NULL);\n}\n\nstatic void cgSetPaintForText(CGContextRef cg, const SkPaint& paint) {\n SkColor c = paint.getColor();\n CGFloat rgba[] = {\n SkColorGetB(c) \/ 255.0f,\n SkColorGetG(c) \/ 255.0f,\n SkColorGetR(c) \/ 255.0f,\n SkColorGetA(c) \/ 255.0f,\n };\n CGContextSetRGBFillColor(cg, rgba[0], rgba[1], rgba[2], rgba[3]);\n\n CGContextSetTextDrawingMode(cg, kCGTextFill);\n CGContextSetFont(cg, typefaceToCGFont(paint.getTypeface()));\n CGContextSetFontSize(cg, SkScalarToFloat(paint.getTextSize()));\n\n CGContextSetAllowsFontSubpixelPositioning(cg, paint.isSubpixelText());\n CGContextSetShouldSubpixelPositionFonts(cg, paint.isSubpixelText());\n\n CGContextSetShouldAntialias(cg, paint.isAntiAlias());\n CGContextSetShouldSmoothFonts(cg, paint.isLCDRenderText());\n}\n\nstatic void cgDrawText(CGContextRef cg, const void* text, size_t len,\n float x, float y, const SkPaint& paint) {\n if (cg) {\n cgSetPaintForText(cg, paint);\n\n uint16_t glyphs[200];\n int count = paint.textToGlyphs(text, len, glyphs);\n\n CGContextShowGlyphsAtPoint(cg, x, y, glyphs, count);\n }\n}\n#endif\n\n\/**\n Test a set of clipping problems discovered while writing blitAntiRect,\n and test all the code paths through the clipping blitters.\n Each region should show as a blue center surrounded by a 2px green\n border, with no red.\n*\/\n\n#define HEIGHT 480\n\nclass GammaTextGM : public skiagm::GM {\npublic:\n GammaTextGM() {\n\n }\n\nprotected:\n virtual SkString onShortName() {\n return SkString(\"gammatext\");\n }\n\n virtual SkISize onISize() {\n return SkISize::Make(1024, HEIGHT);\n }\n\n static void drawGrad(SkCanvas* canvas) {\n SkPoint pts[] = { { 0, 0 }, { 0, SkIntToScalar(HEIGHT) } };\n#if 0\n const SkColor colors[] = { SK_ColorBLACK, SK_ColorWHITE };\n SkShader* s = SkGradientShader::CreateLinear(pts, colors, NULL, 2, SkShader::kClamp_TileMode);\n#else\n SkShader* s = make_heatGradient(pts);\n#endif\n\n canvas->clear(SK_ColorRED);\n SkPaint paint;\n paint.setShader(s)->unref();\n SkRect r = { 0, 0, SkIntToScalar(1024), SkIntToScalar(HEIGHT) };\n canvas->drawRect(r, paint);\n }\n\n virtual void onDraw(SkCanvas* canvas) {\n#ifdef SK_BUILD_FOR_MAC\n CGContextRef cg = 0;\n {\n SkImageInfo info;\n size_t rowBytes;\n const void* addr = canvas->peekPixels(&info, &rowBytes);\n if (addr) {\n cg = makeCG(info, addr, rowBytes);\n }\n }\n#endif\n\n drawGrad(canvas);\n\n const SkColor fg[] = {\n 0xFFFFFFFF,\n 0xFFFFFF00, 0xFFFF00FF, 0xFF00FFFF,\n 0xFFFF0000, 0xFF00FF00, 0xFF0000FF,\n 0xFF000000,\n };\n\n const char* text = \"Hamburgefons\";\n size_t len = strlen(text);\n\n SkPaint paint;\n setFont(&paint, \"Times\");\n paint.setTextSize(SkIntToScalar(16));\n paint.setAntiAlias(true);\n paint.setLCDRenderText(true);\n\n SkScalar x = SkIntToScalar(10);\n for (size_t i = 0; i < SK_ARRAY_COUNT(fg); ++i) {\n paint.setColor(fg[i]);\n\n SkScalar y = SkIntToScalar(40);\n SkScalar stopy = SkIntToScalar(HEIGHT);\n while (y < stopy) {\n if (true) {\n canvas->drawText(text, len, x, y, paint);\n }\n#ifdef SK_BUILD_FOR_MAC\n else {\n cgDrawText(cg, text, len, SkScalarToFloat(x),\n static_cast<float>(HEIGHT) - SkScalarToFloat(y),\n paint);\n }\n#endif\n y += paint.getTextSize() * 2;\n }\n x += SkIntToScalar(1024) \/ SK_ARRAY_COUNT(fg);\n }\n#ifdef SK_BUILD_FOR_MAC\n CGContextRelease(cg);\n#endif\n }\n\nprivate:\n typedef skiagm::GM INHERITED;\n};\n\nDEF_GM( return new GammaTextGM; )\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nstatic SkShader* make_gradient(SkColor c) {\n const SkPoint pts[] = { { 0, 0 }, { 240, 0 } };\n SkColor colors[2];\n colors[0] = c;\n colors[1] = SkColorSetA(c, 0);\n return SkGradientShader::CreateLinear(pts, colors, NULL, 2, SkShader::kClamp_TileMode);\n}\n\nstatic void set_face(SkPaint* paint) {\n SkTypeface* face = SkTypeface::CreateFromName(\"serif\", SkTypeface::kItalic);\n SkSafeUnref(paint->setTypeface(face));\n}\n\nstatic void draw_pair(SkCanvas* canvas, SkPaint* paint, SkShader* shader) {\n const char text[] = \"Now is the time for all good\";\n const size_t len = strlen(text);\n \n paint->setShader(NULL);\n canvas->drawText(text, len, 10, 20, *paint);\n paint->setShader(SkShader::CreateColorShader(paint->getColor()))->unref();\n canvas->drawText(text, len, 10, 40, *paint);\n paint->setShader(shader);\n canvas->drawText(text, len, 10, 60, *paint);\n}\n\nclass GammaShaderTextGM : public skiagm::GM {\n SkShader* fShaders[3];\n SkColor fColors[3];\n\npublic:\n GammaShaderTextGM() {\n const SkColor colors[] = { SK_ColorBLACK, SK_ColorRED, SK_ColorBLUE };\n for (size_t i = 0; i < SK_ARRAY_COUNT(fShaders); ++i) {\n fShaders[i] = NULL;\n fColors[i] = colors[i];\n }\n }\n\n virtual ~GammaShaderTextGM() {\n for (size_t i = 0; i < SK_ARRAY_COUNT(fShaders); ++i) {\n SkSafeUnref(fShaders[i]);\n }\n }\n\nprotected:\n virtual SkString onShortName() {\n return SkString(\"gammagradienttext\");\n }\n \n virtual SkISize onISize() {\n return SkISize::Make(300, 300);\n }\n\n virtual void onOnceBeforeDraw() {\n for (size_t i = 0; i < SK_ARRAY_COUNT(fShaders); ++i) {\n fShaders[i] = make_gradient(fColors[i]);\n }\n }\n\n virtual void onDraw(SkCanvas* canvas) {\n SkPaint paint;\n paint.setAntiAlias(true);\n paint.setLCDRenderText(true);\n paint.setTextSize(18);\n set_face(&paint);\n\n for (size_t i = 0; i < SK_ARRAY_COUNT(fShaders); ++i) {\n paint.setColor(fColors[i]);\n draw_pair(canvas, &paint, fShaders[i]);\n canvas->translate(0, 80);\n }\n }\n \nprivate:\n typedef skiagm::GM INHERITED;\n};\n\nDEF_GM( return new GammaShaderTextGM; )\n\n<commit_msg>clean up dead code<commit_after>\/*\n * Copyright 2011 Google Inc.\n *\n * Use of this source code is governed by a BSD-style license that can be\n * found in the LICENSE file.\n *\/\n\n#include \"gm.h\"\n#include \"SkCanvas.h\"\n#include \"SkPath.h\"\n#include \"SkGradientShader.h\"\n#include \"SkTypeface.h\"\n\nstatic SkShader* make_heatGradient(const SkPoint pts[2]) {\n const SkColor bw[] = { SK_ColorBLACK, SK_ColorWHITE };\n\n return SkGradientShader::CreateLinear(pts, bw, NULL,\n SK_ARRAY_COUNT(bw),\n SkShader::kClamp_TileMode);\n}\n\nstatic bool setFont(SkPaint* paint, const char name[]) {\n SkTypeface* tf = sk_tool_utils::create_portable_typeface(name, SkTypeface::kNormal);\n if (tf) {\n paint->setTypeface(tf)->unref();\n return true;\n }\n return false;\n}\n\n\/**\n Test a set of clipping problems discovered while writing blitAntiRect,\n and test all the code paths through the clipping blitters.\n Each region should show as a blue center surrounded by a 2px green\n border, with no red.\n*\/\n\n#define HEIGHT 480\n\nclass GammaTextGM : public skiagm::GM {\nprotected:\n SkString onShortName() SK_OVERRIDE {\n return SkString(\"gammatext\");\n }\n\n SkISize onISize() SK_OVERRIDE {\n return SkISize::Make(1024, HEIGHT);\n }\n\n static void drawGrad(SkCanvas* canvas) {\n SkPoint pts[] = { { 0, 0 }, { 0, SkIntToScalar(HEIGHT) } };\n SkShader* s = make_heatGradient(pts);\n\n canvas->clear(SK_ColorRED);\n SkPaint paint;\n paint.setShader(s)->unref();\n SkRect r = { 0, 0, SkIntToScalar(1024), SkIntToScalar(HEIGHT) };\n canvas->drawRect(r, paint);\n }\n\n void onDraw(SkCanvas* canvas) SK_OVERRIDE {\n drawGrad(canvas);\n\n const SkColor fg[] = {\n 0xFFFFFFFF,\n 0xFFFFFF00, 0xFFFF00FF, 0xFF00FFFF,\n 0xFFFF0000, 0xFF00FF00, 0xFF0000FF,\n 0xFF000000,\n };\n\n const char* text = \"Hamburgefons\";\n size_t len = strlen(text);\n\n SkPaint paint;\n setFont(&paint, \"Times\");\n paint.setTextSize(SkIntToScalar(16));\n paint.setAntiAlias(true);\n paint.setLCDRenderText(true);\n\n SkScalar x = SkIntToScalar(10);\n for (size_t i = 0; i < SK_ARRAY_COUNT(fg); ++i) {\n paint.setColor(fg[i]);\n\n SkScalar y = SkIntToScalar(40);\n SkScalar stopy = SkIntToScalar(HEIGHT);\n while (y < stopy) {\n canvas->drawText(text, len, x, y, paint);\n y += paint.getTextSize() * 2;\n }\n x += SkIntToScalar(1024) \/ SK_ARRAY_COUNT(fg);\n }\n }\n\nprivate:\n typedef skiagm::GM INHERITED;\n};\n\nDEF_GM( return new GammaTextGM; )\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nstatic SkShader* make_gradient(SkColor c) {\n const SkPoint pts[] = { { 0, 0 }, { 240, 0 } };\n SkColor colors[2];\n colors[0] = c;\n colors[1] = SkColorSetA(c, 0);\n return SkGradientShader::CreateLinear(pts, colors, NULL, 2, SkShader::kClamp_TileMode);\n}\n\nstatic void set_face(SkPaint* paint) {\n SkTypeface* face = SkTypeface::CreateFromName(\"serif\", SkTypeface::kItalic);\n SkSafeUnref(paint->setTypeface(face));\n}\n\nstatic void draw_pair(SkCanvas* canvas, SkPaint* paint, SkShader* shader) {\n const char text[] = \"Now is the time for all good\";\n const size_t len = strlen(text);\n \n paint->setShader(NULL);\n canvas->drawText(text, len, 10, 20, *paint);\n paint->setShader(SkShader::CreateColorShader(paint->getColor()))->unref();\n canvas->drawText(text, len, 10, 40, *paint);\n paint->setShader(shader);\n canvas->drawText(text, len, 10, 60, *paint);\n}\n\nclass GammaShaderTextGM : public skiagm::GM {\n SkShader* fShaders[3];\n SkColor fColors[3];\n\npublic:\n GammaShaderTextGM() {\n const SkColor colors[] = { SK_ColorBLACK, SK_ColorRED, SK_ColorBLUE };\n for (size_t i = 0; i < SK_ARRAY_COUNT(fShaders); ++i) {\n fShaders[i] = NULL;\n fColors[i] = colors[i];\n }\n }\n\n virtual ~GammaShaderTextGM() SK_OVERRIDE {\n for (size_t i = 0; i < SK_ARRAY_COUNT(fShaders); ++i) {\n SkSafeUnref(fShaders[i]);\n }\n }\n\nprotected:\n SkString onShortName() SK_OVERRIDE {\n return SkString(\"gammagradienttext\");\n }\n \n SkISize onISize() SK_OVERRIDE {\n return SkISize::Make(300, 300);\n }\n\n void onOnceBeforeDraw() SK_OVERRIDE {\n for (size_t i = 0; i < SK_ARRAY_COUNT(fShaders); ++i) {\n fShaders[i] = make_gradient(fColors[i]);\n }\n }\n\n void onDraw(SkCanvas* canvas) SK_OVERRIDE {\n SkPaint paint;\n paint.setAntiAlias(true);\n paint.setLCDRenderText(true);\n paint.setTextSize(18);\n set_face(&paint);\n\n for (size_t i = 0; i < SK_ARRAY_COUNT(fShaders); ++i) {\n paint.setColor(fColors[i]);\n draw_pair(canvas, &paint, fShaders[i]);\n canvas->translate(0, 80);\n }\n }\n \nprivate:\n typedef skiagm::GM INHERITED;\n};\n\nDEF_GM( return new GammaShaderTextGM; )\n\n<|endoftext|>"} {"text":"<commit_before>\/\/ @(#)root\/net:$Name: $:$Id: TGrid.cxx,v 1.9 2005\/05\/20 09:59:35 rdm Exp $\n\/\/ Author: Fons Rademakers 3\/1\/2002\n\n\/*************************************************************************\n * Copyright (C) 1995-2002, Rene Brun and Fons Rademakers. *\n * All rights reserved. *\n * *\n * For the licensing terms see $ROOTSYS\/LICENSE. *\n * For the list of contributors see $ROOTSYS\/README\/CREDITS. *\n *************************************************************************\/\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ \/\/\n\/\/ TGrid \/\/\n\/\/ \/\/\n\/\/ Abstract base class defining interface to common GRID services. \/\/\n\/\/ \/\/\n\/\/ To open a connection to a GRID use the static method Connect(). \/\/\n\/\/ The argument of Connect() is of the form: \/\/\n\/\/ <grid>[:\/\/<host>][:<port>], e.g. \/\/\n\/\/ alien, alien:\/\/alice.cern.ch, globus:\/\/glsvr1.cern.ch, ... \/\/\n\/\/ Depending on the <grid> specified an appropriate plugin library \/\/\n\/\/ will be loaded which will provide the real interface. \/\/\n\/\/ \/\/\n\/\/ Related classes are TGridResult. \/\/\n\/\/ \/\/\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n#include \"TGrid.h\"\n#include \"TUrl.h\"\n#include \"TROOT.h\"\n#include \"TPluginManager.h\"\n#include \"TFile.h\"\n#include \"TList.h\"\n#include \"TError.h\"\n#include \"TUUID.h\"\n#include \"TSystem.h\"\n#include \"TH1.h\"\n#include \"TChain.h\"\n#include \"TKey.h\"\n\nTGrid *gGrid = 0;\n\n\nClassImp(TGrid)\n\n\n\/\/______________________________________________________________________________\nTGrid::TGrid() : fPort(-1), fMergerOutputFile(0)\n{\n \/\/ Create grid interface object.\n\n fMergerFileList = new TList;\n fMergerFileList->SetOwner(kTRUE);\n}\n\n\/\/______________________________________________________________________________\nTGrid *TGrid::Connect(const char *grid, const char *uid, const char *pw,\n const char *options)\n{\n \/\/ The grid should be of the form: <grid>:\/\/<host>[:<port>],\n \/\/ e.g.: alien:\/\/alice.cern.ch, globus:\/\/glsrv1.cern.ch, ...\n \/\/ The uid is the username and pw the password that should be used for\n \/\/ the connection. Depending on the <grid> the shared library (plugin)\n \/\/ for the selected system will be loaded. When the connection could not\n \/\/ be opened 0 is returned. For AliEn the supported options are:\n \/\/ -domain=<domain name>\n \/\/ -debug=<debug level from 1 to 10>\n \/\/ Example: \"-domain=cern.ch -debug=5\"\n\n TPluginHandler *h;\n TGrid *g = 0;\n\n if (!grid) {\n ::Error(\"TGrid::Connect\", \"no grid specified\");\n return 0;\n }\n if (!uid)\n uid = \"\";\n if (!pw)\n pw = \"\";\n if (!options)\n options = \"\";\n\n if ((h = gROOT->GetPluginManager()->FindHandler(\"TGrid\", grid))) {\n if (h->LoadPlugin() == -1)\n return 0;\n g = (TGrid *) h->ExecPlugin(4, grid, uid, pw, options);\n }\n\n return g;\n}\n\n\/\/______________________________________________________________________________\nTGrid::~TGrid()\n{\n \/\/ Cleanup.\n\n if (fMergerFileList)\n delete fMergerFileList;\n\n if (fMergerOutputFile)\n delete fMergerOutputFile;\n}\n\n\/\/______________________________________________________________________________\nvoid TGrid::PrintProgress(Long64_t bytesread, Long64_t size)\n{\n \/\/ Print file copy progress.\n\n fprintf(stderr, \"[TGrid::Cp] Total %.02f MB\\t|\", (Double_t)size\/1048576);\n for (int l = 0; l < 20; l++) {\n if (l < 20*bytesread\/size)\n fprintf(stderr, \"=\");\n if (l == 20*bytesread\/size)\n fprintf(stderr, \">\");\n if (l > 20*bytesread\/size)\n fprintf(stderr, \".\");\n }\n\n fWatch.Stop();\n Double_t lCopy_time = fWatch.RealTime();\n fprintf(stderr, \"| %.02f %% [%.01f MB\/s]\\r\",\n 100.0*bytesread\/size, bytesread\/lCopy_time\/1048576.);\n fWatch.Continue();\n}\n\n\/\/______________________________________________________________________________\nBool_t TGrid::Cp(const char *src, const char *dst, Bool_t progressbar,\n UInt_t buffersize)\n{\n \/\/ Allows to copy file from src to dst URL.\n\n Bool_t success = kFALSE;\n\n TUrl sURL(src, kTRUE);\n TUrl dURL(dst, kTRUE);\n\n char *copybuffer = 0;\n\n TFile *sfile = 0;\n TFile *dfile = 0;\n\n sfile = TFile::Open(src, \"-READ\");\n\n if (!sfile) {\n Error(\"Cp\", \"cannot open source file %s\", src);\n goto copyout;\n }\n\n dfile = TFile::Open(dst, \"-RECREATE\");\n\n if (!dfile) {\n Error(\"Cp\", \"cannot open destination file %s\", dst);\n goto copyout;\n }\n\n sfile->Seek(0);\n dfile->Seek(0);\n\n copybuffer = new char[buffersize];\n if (!copybuffer) {\n Error(\"Cp\", \"cannot allocate the copy buffer\");\n goto copyout;\n }\n\n Bool_t readop;\n Bool_t writeop;\n Long64_t read;\n Long64_t written;\n Long64_t totalread;\n Long64_t filesize;\n Long64_t b00;\n filesize = sfile->GetSize();\n totalread = 0;\n fWatch.Start();\n\n b00 = (Long64_t)sfile->GetBytesRead();\n\n do {\n if (progressbar) PrintProgress(totalread, filesize);\n\n Long64_t b1 = (Long64_t)sfile->GetBytesRead() - b00;\n\n Long64_t readsize;\n if (filesize - b1 > (Long64_t)buffersize) {\n readsize = buffersize;\n } else {\n readsize = filesize - b1;\n }\n\n Long64_t b0 = (Long64_t)sfile->GetBytesRead();\n readop = sfile->ReadBuffer(copybuffer, readsize);\n read = (Long64_t)sfile->GetBytesRead() - b0;\n if (read < 0) {\n Error(\"Cp\", \"cannot read from source file %s\", src);\n goto copyout;\n }\n\n Long64_t w0 = (Long64_t)dfile->GetBytesWritten();\n writeop = dfile->WriteBuffer(copybuffer, read);\n written = (Long64_t)dfile->GetBytesWritten() - w0;\n if (written != read) {\n Error(\"Cp\", \"cannot write %d bytes to destination file %s\", read, dst);\n goto copyout;\n }\n totalread += read;\n } while (read == (Long64_t)buffersize);\n\n if (progressbar) {\n PrintProgress(totalread, filesize);\n fprintf(stderr, \"\\n\");\n }\n\n success = kTRUE;\n\ncopyout:\n if (sfile) sfile->Close();\n if (dfile) dfile->Close();\n\n if (sfile) delete sfile;\n if (dfile) delete dfile;\n if (copybuffer) delete copybuffer;\n\n fWatch.Stop();\n fWatch.Reset();\n\n return success;\n}\n\n\/\/______________________________________________________________________________\nvoid TGrid::MergerReset()\n{\n \/\/ Reset merger file list.\n\n fMergerFileList->Clear();\n}\n\n\/\/______________________________________________________________________________\nBool_t TGrid::MergerAddFile(const char *url)\n{\n \/\/ Add file to file merger.\n\n TUUID uuid;\n TString localcopy = \"file:\/tmp\/\";\n localcopy += \"ROOTMERGE-\";\n localcopy += uuid.AsString();\n localcopy += \".root\";\n\n if (!Cp(url, localcopy)) {\n Error(\"MergerAddFile\", \"cannot get a local copy of file %s\", url);\n return kFALSE;\n }\n\n TFile *newfile = TFile::Open(localcopy, \"READ\");\n if (!newfile) {\n Error(\"MergerAddFile\", \"cannot open local copy %s of URL %s\",\n localcopy.Data(), url);\n return kFALSE;\n } else {\n fMergerFileList->Add(newfile);\n return kTRUE;\n }\n}\n\n\/\/______________________________________________________________________________\nBool_t TGrid::MergerOutputFile(const char *outputfile)\n{\n \/\/ Open merger output file.\n\n if (fMergerOutputFile)\n delete fMergerOutputFile;\n\n fMergerOutputFilename = outputfile;\n\n TUUID uuid;\n TString localcopy = \"file:\/tmp\/\";\n localcopy += \"ROOTMERGED-\";\n localcopy += uuid.AsString();\n localcopy += \".root\";\n\n fMergerOutputFile = TFile::Open(localcopy, \"RECREATE\");\n fMergerOutputFilename1 = localcopy;\n\n if (!fMergerOutputFile) {\n Error(\"MergerOutputFile\", \"cannot open the MERGER outputfile %s\", localcopy.Data());\n return kFALSE;\n }\n return kTRUE;\n}\n\n\/\/______________________________________________________________________________\nvoid TGrid::MergerPrintFiles(Option_t *options)\n{\n \/\/ Print list of files being merged.\n\n fMergerFileList->Print(options);\n}\n\n\/\/______________________________________________________________________________\nBool_t TGrid::MergerMerge()\n{\n \/\/ Merge the files.\n\n if (!fMergerOutputFile) {\n Info(\"MergerMerge\", \"will merge the results to the file \"\n \"GridMergerMerged.root in your working directory, \"\n \"since you didn't specify a merge filename\");\n if (!MergerOutputFile(\"GridMergerMerged.root\")) {\n return kFALSE;\n }\n }\n\n Bool_t result = MergerMergeRecursive(fMergerOutputFile, fMergerFileList);\n if (!result) {\n Error(\"MergerMerge\", \"error during merge of your ROOT files\");\n } else {\n fMergerOutputFile->Write();\n \/\/ copy the result file to the final destination\n Cp(fMergerOutputFilename1, fMergerOutputFilename);\n }\n\n \/\/ remove the temporary result file\n TString path(fMergerOutputFile->GetPath());\n path = path(0, path.Index(':',0));\n gSystem->Unlink(path);\n fMergerOutputFile = 0;\n\n TIter next(fMergerFileList);\n TFile *file;\n while ((file = (TFile*) next())) {\n \/\/ close the files\n file->Close();\n \/\/ remove the temporary files\n TString path(file->GetPath());\n path = path(0, path.Index(':',0));\n gSystem->Unlink(path);\n }\n return result;\n}\n\n\/\/______________________________________________________________________________\nBool_t TGrid::MergerMergeRecursive(TDirectory *target, TList *sourcelist)\n{\n \/\/ Recursively merge objects in the ROOT files.\n\n TString path(strstr(target->GetPath(), \":\"));\n path.Remove(0, 2);\n\n TFile *first_source = (TFile*)sourcelist->First();\n first_source->cd(path);\n TDirectory *current_sourcedir = gDirectory;\n\n TChain *globChain = 0;\n TIter nextkey(current_sourcedir->GetListOfKeys());\n TKey *key;\n Bool_t success = kTRUE;\n\n \/\/ gain time, do not add the objects in the list in memory\n TH1::AddDirectory(kFALSE);\n\n while ((key = (TKey*) nextkey())) {\n first_source->cd(path);\n TObject *obj = key->ReadObj();\n\n if (obj->IsA()->InheritsFrom(\"TH1\")) {\n Info(\"MergerMergeRecursive\", \"merging histogram %s\", obj->GetName());\n TH1 *h1 = (TH1*)obj;\n\n TFile *nextsource = (TFile*)sourcelist->After(first_source);\n while (nextsource) {\n\n nextsource->cd(path);\n TH1 *h2 = (TH1*)gDirectory->Get(h1->GetName());\n if (h2) {\n h1->Add(h2);\n delete h2;\n }\n\n nextsource = (TFile*)sourcelist->After(nextsource);\n }\n } else if (obj->IsA()->InheritsFrom(\"TTree\")) {\n Info(\"MergerMergeRecursive\", \"merging tree %s\", obj->GetName());\n const char *obj_name= obj->GetName();\n\n globChain = new TChain(obj_name);\n globChain->Add(first_source->GetName());\n TFile *nextsource = (TFile*)sourcelist->After(first_source);\n while (nextsource) {\n globChain->Add(nextsource->GetName());\n nextsource = (TFile*)sourcelist->After(nextsource);\n }\n\n } else if (obj->IsA()->InheritsFrom(\"TDirectory\")) {\n target->cd();\n TDirectory *newdir = target->mkdir(obj->GetName(), obj->GetTitle());\n if (!MergerMergeRecursive(newdir, sourcelist)) {\n Error(\"MergerMergeRecursive\", \"error during merge of directory %s\",\n newdir->GetPath());\n success = kFALSE;\n }\n } else {\n Error(\"MergerMergeRecursive\", \"unknown object type, name: %s title: %s\",\n obj->GetName(), obj->GetTitle());\n success = kFALSE;\n }\n\n if (obj) {\n target->cd();\n\n if (obj->IsA()->InheritsFrom(\"TTree\")) {\n globChain->Merge(target->GetFile() ,0, \"keep\");\n delete globChain;\n } else\n obj->Write(key->GetName());\n }\n\n } \/\/ nextkey\n\n target->Write();\n\n TH1::AddDirectory(kTRUE);\n\n return success;\n}\n<commit_msg>disable Grid ROOT file merge feature since it would make Core depend on Hist. Looking for better solution.<commit_after>\/\/ @(#)root\/net:$Name: $:$Id: TGrid.cxx,v 1.10 2005\/05\/20 10:33:00 rdm Exp $\n\/\/ Author: Fons Rademakers 3\/1\/2002\n\n\/*************************************************************************\n * Copyright (C) 1995-2002, Rene Brun and Fons Rademakers. *\n * All rights reserved. *\n * *\n * For the licensing terms see $ROOTSYS\/LICENSE. *\n * For the list of contributors see $ROOTSYS\/README\/CREDITS. *\n *************************************************************************\/\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ \/\/\n\/\/ TGrid \/\/\n\/\/ \/\/\n\/\/ Abstract base class defining interface to common GRID services. \/\/\n\/\/ \/\/\n\/\/ To open a connection to a GRID use the static method Connect(). \/\/\n\/\/ The argument of Connect() is of the form: \/\/\n\/\/ <grid>[:\/\/<host>][:<port>], e.g. \/\/\n\/\/ alien, alien:\/\/alice.cern.ch, globus:\/\/glsvr1.cern.ch, ... \/\/\n\/\/ Depending on the <grid> specified an appropriate plugin library \/\/\n\/\/ will be loaded which will provide the real interface. \/\/\n\/\/ \/\/\n\/\/ Related classes are TGridResult. \/\/\n\/\/ \/\/\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n#include \"TGrid.h\"\n#include \"TUrl.h\"\n#include \"TROOT.h\"\n#include \"TPluginManager.h\"\n#include \"TFile.h\"\n#include \"TList.h\"\n#include \"TError.h\"\n#include \"TUUID.h\"\n#include \"TSystem.h\"\n\/\/#include \"TH1.h\"\n#include \"TChain.h\"\n#include \"TKey.h\"\n\nTGrid *gGrid = 0;\n\n\nClassImp(TGrid)\n\n\n\/\/______________________________________________________________________________\nTGrid::TGrid() : fPort(-1), fMergerOutputFile(0)\n{\n \/\/ Create grid interface object.\n\n fMergerFileList = new TList;\n fMergerFileList->SetOwner(kTRUE);\n}\n\n\/\/______________________________________________________________________________\nTGrid *TGrid::Connect(const char *grid, const char *uid, const char *pw,\n const char *options)\n{\n \/\/ The grid should be of the form: <grid>:\/\/<host>[:<port>],\n \/\/ e.g.: alien:\/\/alice.cern.ch, globus:\/\/glsrv1.cern.ch, ...\n \/\/ The uid is the username and pw the password that should be used for\n \/\/ the connection. Depending on the <grid> the shared library (plugin)\n \/\/ for the selected system will be loaded. When the connection could not\n \/\/ be opened 0 is returned. For AliEn the supported options are:\n \/\/ -domain=<domain name>\n \/\/ -debug=<debug level from 1 to 10>\n \/\/ Example: \"-domain=cern.ch -debug=5\"\n\n TPluginHandler *h;\n TGrid *g = 0;\n\n if (!grid) {\n ::Error(\"TGrid::Connect\", \"no grid specified\");\n return 0;\n }\n if (!uid)\n uid = \"\";\n if (!pw)\n pw = \"\";\n if (!options)\n options = \"\";\n\n if ((h = gROOT->GetPluginManager()->FindHandler(\"TGrid\", grid))) {\n if (h->LoadPlugin() == -1)\n return 0;\n g = (TGrid *) h->ExecPlugin(4, grid, uid, pw, options);\n }\n\n return g;\n}\n\n\/\/______________________________________________________________________________\nTGrid::~TGrid()\n{\n \/\/ Cleanup.\n\n if (fMergerFileList)\n delete fMergerFileList;\n\n if (fMergerOutputFile)\n delete fMergerOutputFile;\n}\n\n\/\/______________________________________________________________________________\nvoid TGrid::PrintProgress(Long64_t bytesread, Long64_t size)\n{\n \/\/ Print file copy progress.\n\n fprintf(stderr, \"[TGrid::Cp] Total %.02f MB\\t|\", (Double_t)size\/1048576);\n for (int l = 0; l < 20; l++) {\n if (l < 20*bytesread\/size)\n fprintf(stderr, \"=\");\n if (l == 20*bytesread\/size)\n fprintf(stderr, \">\");\n if (l > 20*bytesread\/size)\n fprintf(stderr, \".\");\n }\n\n fWatch.Stop();\n Double_t lCopy_time = fWatch.RealTime();\n fprintf(stderr, \"| %.02f %% [%.01f MB\/s]\\r\",\n 100.0*bytesread\/size, bytesread\/lCopy_time\/1048576.);\n fWatch.Continue();\n}\n\n\/\/______________________________________________________________________________\nBool_t TGrid::Cp(const char *src, const char *dst, Bool_t progressbar,\n UInt_t buffersize)\n{\n \/\/ Allows to copy file from src to dst URL.\n\n Bool_t success = kFALSE;\n\n TUrl sURL(src, kTRUE);\n TUrl dURL(dst, kTRUE);\n\n char *copybuffer = 0;\n\n TFile *sfile = 0;\n TFile *dfile = 0;\n\n sfile = TFile::Open(src, \"-READ\");\n\n if (!sfile) {\n Error(\"Cp\", \"cannot open source file %s\", src);\n goto copyout;\n }\n\n dfile = TFile::Open(dst, \"-RECREATE\");\n\n if (!dfile) {\n Error(\"Cp\", \"cannot open destination file %s\", dst);\n goto copyout;\n }\n\n sfile->Seek(0);\n dfile->Seek(0);\n\n copybuffer = new char[buffersize];\n if (!copybuffer) {\n Error(\"Cp\", \"cannot allocate the copy buffer\");\n goto copyout;\n }\n\n Bool_t readop;\n Bool_t writeop;\n Long64_t read;\n Long64_t written;\n Long64_t totalread;\n Long64_t filesize;\n Long64_t b00;\n filesize = sfile->GetSize();\n totalread = 0;\n fWatch.Start();\n\n b00 = (Long64_t)sfile->GetBytesRead();\n\n do {\n if (progressbar) PrintProgress(totalread, filesize);\n\n Long64_t b1 = (Long64_t)sfile->GetBytesRead() - b00;\n\n Long64_t readsize;\n if (filesize - b1 > (Long64_t)buffersize) {\n readsize = buffersize;\n } else {\n readsize = filesize - b1;\n }\n\n Long64_t b0 = (Long64_t)sfile->GetBytesRead();\n readop = sfile->ReadBuffer(copybuffer, readsize);\n read = (Long64_t)sfile->GetBytesRead() - b0;\n if (read < 0) {\n Error(\"Cp\", \"cannot read from source file %s\", src);\n goto copyout;\n }\n\n Long64_t w0 = (Long64_t)dfile->GetBytesWritten();\n writeop = dfile->WriteBuffer(copybuffer, read);\n written = (Long64_t)dfile->GetBytesWritten() - w0;\n if (written != read) {\n Error(\"Cp\", \"cannot write %d bytes to destination file %s\", read, dst);\n goto copyout;\n }\n totalread += read;\n } while (read == (Long64_t)buffersize);\n\n if (progressbar) {\n PrintProgress(totalread, filesize);\n fprintf(stderr, \"\\n\");\n }\n\n success = kTRUE;\n\ncopyout:\n if (sfile) sfile->Close();\n if (dfile) dfile->Close();\n\n if (sfile) delete sfile;\n if (dfile) delete dfile;\n if (copybuffer) delete copybuffer;\n\n fWatch.Stop();\n fWatch.Reset();\n\n return success;\n}\n\n\/\/______________________________________________________________________________\nvoid TGrid::MergerReset()\n{\n \/\/ Reset merger file list.\n\n fMergerFileList->Clear();\n}\n\n\/\/______________________________________________________________________________\nBool_t TGrid::MergerAddFile(const char *url)\n{\n \/\/ Add file to file merger.\n\n TUUID uuid;\n TString localcopy = \"file:\/tmp\/\";\n localcopy += \"ROOTMERGE-\";\n localcopy += uuid.AsString();\n localcopy += \".root\";\n\n if (!Cp(url, localcopy)) {\n Error(\"MergerAddFile\", \"cannot get a local copy of file %s\", url);\n return kFALSE;\n }\n\n TFile *newfile = TFile::Open(localcopy, \"READ\");\n if (!newfile) {\n Error(\"MergerAddFile\", \"cannot open local copy %s of URL %s\",\n localcopy.Data(), url);\n return kFALSE;\n } else {\n fMergerFileList->Add(newfile);\n return kTRUE;\n }\n}\n\n\/\/______________________________________________________________________________\nBool_t TGrid::MergerOutputFile(const char *outputfile)\n{\n \/\/ Open merger output file.\n\n if (fMergerOutputFile)\n delete fMergerOutputFile;\n\n fMergerOutputFilename = outputfile;\n\n TUUID uuid;\n TString localcopy = \"file:\/tmp\/\";\n localcopy += \"ROOTMERGED-\";\n localcopy += uuid.AsString();\n localcopy += \".root\";\n\n fMergerOutputFile = TFile::Open(localcopy, \"RECREATE\");\n fMergerOutputFilename1 = localcopy;\n\n if (!fMergerOutputFile) {\n Error(\"MergerOutputFile\", \"cannot open the MERGER outputfile %s\", localcopy.Data());\n return kFALSE;\n }\n return kTRUE;\n}\n\n\/\/______________________________________________________________________________\nvoid TGrid::MergerPrintFiles(Option_t *options)\n{\n \/\/ Print list of files being merged.\n\n fMergerFileList->Print(options);\n}\n\n\/\/______________________________________________________________________________\nBool_t TGrid::MergerMerge()\n{\n \/\/ Merge the files.\n\n if (!fMergerOutputFile) {\n Info(\"MergerMerge\", \"will merge the results to the file \"\n \"GridMergerMerged.root in your working directory, \"\n \"since you didn't specify a merge filename\");\n if (!MergerOutputFile(\"GridMergerMerged.root\")) {\n return kFALSE;\n }\n }\n\n Bool_t result = MergerMergeRecursive(fMergerOutputFile, fMergerFileList);\n if (!result) {\n Error(\"MergerMerge\", \"error during merge of your ROOT files\");\n } else {\n fMergerOutputFile->Write();\n \/\/ copy the result file to the final destination\n Cp(fMergerOutputFilename1, fMergerOutputFilename);\n }\n\n \/\/ remove the temporary result file\n TString path(fMergerOutputFile->GetPath());\n path = path(0, path.Index(':',0));\n gSystem->Unlink(path);\n fMergerOutputFile = 0;\n\n TIter next(fMergerFileList);\n TFile *file;\n while ((file = (TFile*) next())) {\n \/\/ close the files\n file->Close();\n \/\/ remove the temporary files\n TString path(file->GetPath());\n path = path(0, path.Index(':',0));\n gSystem->Unlink(path);\n }\n return result;\n}\n\n\/\/______________________________________________________________________________\nBool_t TGrid::MergerMergeRecursive(TDirectory *target, TList *sourcelist)\n{\n \/\/ Recursively merge objects in the ROOT files.\n\n#if 1\n \/\/ TO BE FIXEd\n if (target || sourcelist) { }\n return kFALSE;\n#else\n TString path(strstr(target->GetPath(), \":\"));\n path.Remove(0, 2);\n\n TFile *first_source = (TFile*)sourcelist->First();\n first_source->cd(path);\n TDirectory *current_sourcedir = gDirectory;\n\n TChain *globChain = 0;\n TIter nextkey(current_sourcedir->GetListOfKeys());\n TKey *key;\n Bool_t success = kTRUE;\n\n \/\/ gain time, do not add the objects in the list in memory\n TH1::AddDirectory(kFALSE);\n\n while ((key = (TKey*) nextkey())) {\n first_source->cd(path);\n TObject *obj = key->ReadObj();\n\n if (obj->IsA()->InheritsFrom(\"TH1\")) {\n Info(\"MergerMergeRecursive\", \"merging histogram %s\", obj->GetName());\n TH1 *h1 = (TH1*)obj;\n\n TFile *nextsource = (TFile*)sourcelist->After(first_source);\n while (nextsource) {\n\n nextsource->cd(path);\n TH1 *h2 = (TH1*)gDirectory->Get(h1->GetName());\n if (h2) {\n h1->Add(h2);\n delete h2;\n }\n\n nextsource = (TFile*)sourcelist->After(nextsource);\n }\n } else if (obj->IsA()->InheritsFrom(\"TTree\")) {\n Info(\"MergerMergeRecursive\", \"merging tree %s\", obj->GetName());\n const char *obj_name= obj->GetName();\n\n globChain = new TChain(obj_name);\n globChain->Add(first_source->GetName());\n TFile *nextsource = (TFile*)sourcelist->After(first_source);\n while (nextsource) {\n globChain->Add(nextsource->GetName());\n nextsource = (TFile*)sourcelist->After(nextsource);\n }\n\n } else if (obj->IsA()->InheritsFrom(\"TDirectory\")) {\n target->cd();\n TDirectory *newdir = target->mkdir(obj->GetName(), obj->GetTitle());\n if (!MergerMergeRecursive(newdir, sourcelist)) {\n Error(\"MergerMergeRecursive\", \"error during merge of directory %s\",\n newdir->GetPath());\n success = kFALSE;\n }\n } else {\n Error(\"MergerMergeRecursive\", \"unknown object type, name: %s title: %s\",\n obj->GetName(), obj->GetTitle());\n success = kFALSE;\n }\n\n if (obj) {\n target->cd();\n\n if (obj->IsA()->InheritsFrom(\"TTree\")) {\n globChain->Merge(target->GetFile() ,0, \"keep\");\n delete globChain;\n } else\n obj->Write(key->GetName());\n }\n\n } \/\/ nextkey\n\n target->Write();\n\n TH1::AddDirectory(kTRUE);\n\n return success;\n#endif\n}\n<|endoftext|>"} {"text":"<commit_before>\/**\n * \\file\n * \\brief ContiguousRange template class header\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#ifndef ESTD_CONTIGUOUSRANGE_HPP_\n#define ESTD_CONTIGUOUSRANGE_HPP_\n\n#include <array>\n\nnamespace estd\n{\n\n\/**\n * \\brief ContiguousRange template class is a pair of iterators to contiguous sequence of elements in memory.\n *\n * \\tparam T is the type of data in the range\n *\/\n\ntemplate<typename T>\nclass ContiguousRange\n{\npublic:\n\n\t\/\/\/ value_type type\n\tusing value_type = T;\n\n\t\/\/\/ pointer type\n\tusing pointer = value_type*;\n\n\t\/\/\/ const_pointer type\n\tusing const_pointer = const value_type*;\n\n\t\/\/\/ reference type\n\tusing reference = value_type&;\n\n\t\/\/\/ const_reference type\n\tusing const_reference = const value_type&;\n\n\t\/\/\/ iterator type\n\tusing iterator = value_type*;\n\n\t\/\/\/ const_iterator type\n\tusing const_iterator = const value_type*;\n\n\t\/\/\/ size_type type\n\tusing size_type = std::size_t;\n\n\t\/\/\/ difference_type type\n\tusing difference_type = std::ptrdiff_t;\n\n\t\/\/\/ reverse_iterator type\n\tusing reverse_iterator = std::reverse_iterator<iterator>;\n\n\t\/\/\/ const_reverse_iterator type\n\tusing const_reverse_iterator = std::reverse_iterator<const_iterator>;\n\n\t\/**\n\t * \\brief ContiguousRange's constructor\n\t *\n\t * \\param [in] beginn is an iterator to first element in the range\n\t * \\param [in] endd is an iterator to \"one past the last\" element in the range\n\t *\/\n\n\tconstexpr ContiguousRange(const iterator beginn, const iterator endd) noexcept :\n\t\t\tbegin_{beginn},\n\t\t\tend_{endd}\n\t{\n\n\t}\n\n\t\/**\n\t * \\brief Empty ContiguousRange's constructor\n\t *\/\n\n\tconstexpr ContiguousRange() noexcept :\n\t\t\tContiguousRange{nullptr, nullptr}\n\t{\n\n\t}\n\n\t\/**\n\t * \\brief ContiguousRange's constructor using iterator and size\n\t *\n\t * \\param [in] beginn is an iterator to first element in the range\n\t * \\param [in] sizee is the number of elements in the range\n\t *\/\n\n\tconstexpr ContiguousRange(const iterator beginn, size_t sizee) noexcept :\n\t\t\tbegin_{beginn},\n\t\t\tend_{beginn + sizee}\n\t{\n\n\t}\n\n\t\/**\n\t * \\brief ContiguousRange's constructor using C-style array\n\t *\n\t * \\tparam N is the number of elements in the array\n\t *\n\t * \\param [in] array is the array used to initialize the range\n\t *\/\n\n\ttemplate<size_t N>\n\tconstexpr explicit ContiguousRange(T (& array)[N]) noexcept :\n\t\t\tContiguousRange{array, array + N}\n\t{\n\n\t}\n\n\t\/**\n\t * \\brief ContiguousRange's constructor using std::array\n\t *\n\t * \\tparam N is the number of elements in the array\n\t *\n\t * \\param [in] array is the array used to initialize the range\n\t *\/\n\n\ttemplate<size_t N>\n\tconstexpr explicit ContiguousRange(std::array<T, N>& array) noexcept :\n\t\t\tContiguousRange{array.begin(), array.end()}\n\t{\n\n\t}\n\n\t\/**\n\t * \\brief ContiguousRange's constructor using const std::array\n\t *\n\t * \\tparam N is the number of elements in the array\n\t *\n\t * \\param [in] array is the const array used to initialize the range\n\t *\/\n\n\ttemplate<size_t N>\n\tconstexpr explicit ContiguousRange(const std::array<typename std::remove_const<T>::type, N>& array) noexcept :\n\t\t\tContiguousRange{array.begin(), array.end()}\n\t{\n\n\t}\n\n\t\/**\n\t * \\brief ContiguousRange's constructor using single value\n\t *\n\t * \\param [in] value is a reference to variable used to initialize the range\n\t *\/\n\n\tconstexpr explicit ContiguousRange(T& value) noexcept :\n\t\t\tContiguousRange{&value, &value + 1}\n\t{\n\n\t}\n\n\t\/**\n\t * \\brief ContiguousRange's converting constructor\n\t *\n\t * This constructor is enabled only if \\a T is \\a const. It can be used to convert non-const range to const range.\n\t *\n\t * \\param [in] other is a reference to source of conversion\n\t *\/\n\n\ttemplate<typename TT = T, typename = typename std::enable_if<std::is_const<TT>::value == true>::type>\n\tconstexpr explicit ContiguousRange(const ContiguousRange<typename std::remove_const<TT>::type>& other) noexcept :\n\t\t\tContiguousRange{other.begin(), other.end()}\n\t{\n\n\t}\n\n\t\/**\n\t * \\brief ContiguousRange's subscript operator\n\t *\n\t * \\param [in] i is the index of element that will be accessed\n\t *\n\t * \\return reference to element at given index\n\t *\/\n\n\treference operator[](const size_type i) const noexcept\n\t{\n\t\treturn begin_[i];\n\t}\n\n\t\/**\n\t * \\return iterator to first element in the range\n\t *\/\n\n\tconstexpr iterator begin() const noexcept\n\t{\n\t\treturn begin_;\n\t}\n\n\t\/**\n\t * \\return const_iterator to first element in the range\n\t *\/\n\n\tconstexpr const_iterator cbegin() const noexcept\n\t{\n\t\treturn begin();\n\t}\n\n\t\/**\n\t * \\return const_iterator to \"one past the last\" element in the range\n\t *\/\n\n\tconstexpr const_iterator cend() const noexcept\n\t{\n\t\treturn end();\n\t}\n\n\t\/**\n\t * \\return const_reverse_iterator to first element in the reversed range (last element of the non-reversed range)\n\t *\/\n\n\tconstexpr const_reverse_iterator crbegin() const noexcept\n\t{\n\t\treturn rbegin();\n\t}\n\n\t\/**\n\t * \\return const_reverse_iterator to \"one past the last\" element in the reversed range (\"one before the first\"\n\t * element of the non-reversed range)\n\t *\/\n\n\tconstexpr const_reverse_iterator crend() const noexcept\n\t{\n\t\treturn rend();\n\t}\n\n\t\/**\n\t * \\return iterator to \"one past the last\" element in the range\n\t *\/\n\n\tconstexpr iterator end() const noexcept\n\t{\n\t\treturn end_;\n\t}\n\n\t\/**\n\t * \\return reverse_iterator to first element in the reversed range (last element of the non-reversed range)\n\t *\/\n\n\tconstexpr reverse_iterator rbegin() const noexcept\n\t{\n\t\treturn reverse_iterator{end()};\n\t}\n\n\t\/**\n\t * \\return reverse_iterator to \"one past the last\" element in the reversed range (\"one before the first\" element of\n\t * the non-reversed range)\n\t *\/\n\n\tconstexpr reverse_iterator rend() const noexcept\n\t{\n\t\treturn reverse_iterator{begin()};\n\t}\n\n\t\/**\n\t * \\return number of elements in the range\n\t *\/\n\n\tconstexpr size_type size() const noexcept\n\t{\n\t\treturn end_ - begin_;\n\t}\n\nprivate:\n\n\t\/\/\/ iterator to first element in the range\n\titerator begin_;\n\n\t\/\/\/ iterator to \"one past the last\" element in the range\n\titerator end_;\n};\n\n}\t\/\/ namespace estd\n\n#endif\t\/\/ ESTD_CONTIGUOUSRANGE_HPP_\n<commit_msg>Add another estd::ContiguousRange constructor overload<commit_after>\/**\n * \\file\n * \\brief ContiguousRange template class header\n *\n * \\author Copyright (C) 2014-2018 Kamil Szczygiel http:\/\/www.distortec.com http:\/\/www.freddiechopin.info\n *\n * \\par License\n * This Source Code Form is subject to the terms of the Mozilla Public License, v. 2.0. If a copy of the MPL was not\n * distributed with this file, You can obtain one at http:\/\/mozilla.org\/MPL\/2.0\/.\n *\/\n\n#ifndef ESTD_CONTIGUOUSRANGE_HPP_\n#define ESTD_CONTIGUOUSRANGE_HPP_\n\n#include <array>\n\nnamespace estd\n{\n\n\/**\n * \\brief ContiguousRange template class is a pair of iterators to contiguous sequence of elements in memory.\n *\n * \\tparam T is the type of data in the range\n *\/\n\ntemplate<typename T>\nclass ContiguousRange\n{\npublic:\n\n\t\/\/\/ value_type type\n\tusing value_type = T;\n\n\t\/\/\/ pointer type\n\tusing pointer = value_type*;\n\n\t\/\/\/ const_pointer type\n\tusing const_pointer = const value_type*;\n\n\t\/\/\/ reference type\n\tusing reference = value_type&;\n\n\t\/\/\/ const_reference type\n\tusing const_reference = const value_type&;\n\n\t\/\/\/ iterator type\n\tusing iterator = value_type*;\n\n\t\/\/\/ const_iterator type\n\tusing const_iterator = const value_type*;\n\n\t\/\/\/ size_type type\n\tusing size_type = std::size_t;\n\n\t\/\/\/ difference_type type\n\tusing difference_type = std::ptrdiff_t;\n\n\t\/\/\/ reverse_iterator type\n\tusing reverse_iterator = std::reverse_iterator<iterator>;\n\n\t\/\/\/ const_reverse_iterator type\n\tusing const_reverse_iterator = std::reverse_iterator<const_iterator>;\n\n\t\/**\n\t * \\brief ContiguousRange's constructor\n\t *\n\t * \\param [in] beginn is an iterator to first element in the range\n\t * \\param [in] endd is an iterator to \"one past the last\" element in the range\n\t *\/\n\n\tconstexpr ContiguousRange(const iterator beginn, const iterator endd) noexcept :\n\t\t\tbegin_{beginn},\n\t\t\tend_{endd}\n\t{\n\n\t}\n\n\t\/**\n\t * \\brief Empty ContiguousRange's constructor\n\t *\/\n\n\tconstexpr ContiguousRange() noexcept :\n\t\t\tContiguousRange{nullptr, nullptr}\n\t{\n\n\t}\n\n\t\/**\n\t * \\brief ContiguousRange's constructor using iterator and size\n\t *\n\t * \\param [in] beginn is an iterator to first element in the range\n\t * \\param [in] sizee is the number of elements in the range\n\t *\/\n\n\tconstexpr ContiguousRange(const iterator beginn, size_t sizee) noexcept :\n\t\t\tbegin_{beginn},\n\t\t\tend_{beginn + sizee}\n\t{\n\n\t}\n\n\t\/**\n\t * \\brief ContiguousRange's constructor using C-style array\n\t *\n\t * \\tparam N is the number of elements in the array\n\t *\n\t * \\param [in] array is the array used to initialize the range\n\t *\/\n\n\ttemplate<size_t N>\n\tconstexpr explicit ContiguousRange(T (& array)[N]) noexcept :\n\t\t\tContiguousRange{array, array + N}\n\t{\n\n\t}\n\n\t\/**\n\t * \\brief ContiguousRange's constructor using std::array\n\t *\n\t * \\tparam N is the number of elements in the array\n\t *\n\t * \\param [in] array is the array used to initialize the range\n\t *\/\n\n\ttemplate<size_t N>\n\tconstexpr explicit ContiguousRange(std::array<T, N>& array) noexcept :\n\t\t\tContiguousRange{array.begin(), array.end()}\n\t{\n\n\t}\n\n\t\/**\n\t * \\brief ContiguousRange's constructor using const std::array\n\t *\n\t * \\tparam N is the number of elements in the array\n\t *\n\t * \\param [in] array is the const array used to initialize the range\n\t *\/\n\n\ttemplate<size_t N>\n\tconstexpr explicit ContiguousRange(const std::array<typename std::remove_const<T>::type, N>& array) noexcept :\n\t\t\tContiguousRange{array.begin(), array.end()}\n\t{\n\n\t}\n\n\t\/**\n\t * \\brief ContiguousRange's constructor using const std::array with const type\n\t *\n\t * This constructor is enabled only if \\a T is \\a const.\n\t *\n\t * \\tparam N is the number of elements in the array\n\t *\n\t * \\param [in] array is the array used to initialize the range\n\t *\/\n\n\ttemplate<size_t N, typename TT = T, typename = typename std::enable_if<std::is_const<TT>::value == true>::type>\n\tconstexpr explicit ContiguousRange(const std::array<T, N>& array) noexcept :\n\t\t\tContiguousRange{array.begin(), array.end()}\n\t{\n\n\t}\n\n\t\/**\n\t * \\brief ContiguousRange's constructor using single value\n\t *\n\t * \\param [in] value is a reference to variable used to initialize the range\n\t *\/\n\n\tconstexpr explicit ContiguousRange(T& value) noexcept :\n\t\t\tContiguousRange{&value, &value + 1}\n\t{\n\n\t}\n\n\t\/**\n\t * \\brief ContiguousRange's converting constructor\n\t *\n\t * This constructor is enabled only if \\a T is \\a const. It can be used to convert non-const range to const range.\n\t *\n\t * \\param [in] other is a reference to source of conversion\n\t *\/\n\n\ttemplate<typename TT = T, typename = typename std::enable_if<std::is_const<TT>::value == true>::type>\n\tconstexpr explicit ContiguousRange(const ContiguousRange<typename std::remove_const<TT>::type>& other) noexcept :\n\t\t\tContiguousRange{other.begin(), other.end()}\n\t{\n\n\t}\n\n\t\/**\n\t * \\brief ContiguousRange's subscript operator\n\t *\n\t * \\param [in] i is the index of element that will be accessed\n\t *\n\t * \\return reference to element at given index\n\t *\/\n\n\treference operator[](const size_type i) const noexcept\n\t{\n\t\treturn begin_[i];\n\t}\n\n\t\/**\n\t * \\return iterator to first element in the range\n\t *\/\n\n\tconstexpr iterator begin() const noexcept\n\t{\n\t\treturn begin_;\n\t}\n\n\t\/**\n\t * \\return const_iterator to first element in the range\n\t *\/\n\n\tconstexpr const_iterator cbegin() const noexcept\n\t{\n\t\treturn begin();\n\t}\n\n\t\/**\n\t * \\return const_iterator to \"one past the last\" element in the range\n\t *\/\n\n\tconstexpr const_iterator cend() const noexcept\n\t{\n\t\treturn end();\n\t}\n\n\t\/**\n\t * \\return const_reverse_iterator to first element in the reversed range (last element of the non-reversed range)\n\t *\/\n\n\tconstexpr const_reverse_iterator crbegin() const noexcept\n\t{\n\t\treturn rbegin();\n\t}\n\n\t\/**\n\t * \\return const_reverse_iterator to \"one past the last\" element in the reversed range (\"one before the first\"\n\t * element of the non-reversed range)\n\t *\/\n\n\tconstexpr const_reverse_iterator crend() const noexcept\n\t{\n\t\treturn rend();\n\t}\n\n\t\/**\n\t * \\return iterator to \"one past the last\" element in the range\n\t *\/\n\n\tconstexpr iterator end() const noexcept\n\t{\n\t\treturn end_;\n\t}\n\n\t\/**\n\t * \\return reverse_iterator to first element in the reversed range (last element of the non-reversed range)\n\t *\/\n\n\tconstexpr reverse_iterator rbegin() const noexcept\n\t{\n\t\treturn reverse_iterator{end()};\n\t}\n\n\t\/**\n\t * \\return reverse_iterator to \"one past the last\" element in the reversed range (\"one before the first\" element of\n\t * the non-reversed range)\n\t *\/\n\n\tconstexpr reverse_iterator rend() const noexcept\n\t{\n\t\treturn reverse_iterator{begin()};\n\t}\n\n\t\/**\n\t * \\return number of elements in the range\n\t *\/\n\n\tconstexpr size_type size() const noexcept\n\t{\n\t\treturn end_ - begin_;\n\t}\n\nprivate:\n\n\t\/\/\/ iterator to first element in the range\n\titerator begin_;\n\n\t\/\/\/ iterator to \"one past the last\" element in the range\n\titerator end_;\n};\n\n}\t\/\/ namespace estd\n\n#endif\t\/\/ ESTD_CONTIGUOUSRANGE_HPP_\n<|endoftext|>"} {"text":"<commit_before>#include <cstdlib>\n#include <iostream>\n#include <list>\n#include <set>\n#include <vector>\n\nint g_capacity_a = 5;\nint g_capacity_b = 3;\nint g_target = 4;\n\nstruct State {\n State(int a, int b) : a(a), b(b), parent(NULL) {}\n\n int a;\n int b;\n const State* parent;\n\n bool operator<(const State& rhs) const {\n if (a == rhs.a) {\n return b < rhs.b;\n }\n return a < rhs.a;\n }\n};\n\nstd::vector<State*> GetChildStates(const State& state) {\n std::vector<State*> child_states;\n\n \/\/ empty a\n if (state.a != 0) {\n child_states.push_back(new State(0, state.b));\n }\n\n \/\/ empty b\n if (state.b != 0) {\n child_states.push_back(new State(state.a, 0));\n }\n\n \/\/ pour a to b\n if (state.b < g_capacity_b && state.a > 0) {\n int transfer = state.a;\n int capacity = g_capacity_b - state.b;\n\n transfer = std::min(transfer, capacity);\n\n child_states.push_back(new State(state.a - transfer, state.b + transfer));\n }\n\n \/\/ pour b to a\n if (state.a < g_capacity_a && state.b > 0) {\n int transfer = state.b;\n int capacity = g_capacity_a - state.a;\n\n transfer = std::min(transfer, capacity);\n\n child_states.push_back(new State(state.a + transfer, state.b - transfer));\n }\n\n \/\/ fill a\n if (state.a < g_capacity_a) {\n child_states.push_back(new State(g_capacity_a, state.b));\n }\n\n \/\/ fill b\n if (state.b < g_capacity_b) {\n child_states.push_back(new State(state.a, g_capacity_b));\n }\n\n return child_states;\n}\n\nint main(int argc, const char* argv[]) {\n if (argc != 4) {\n std::cerr << \"Usage: \" << argv[0] << \" <capacity-a> <capacity-b> <target>\";\n return 1;\n }\n\n g_capacity_a = strtoul(argv[1], NULL, 10);\n g_capacity_b = strtoul(argv[2], NULL, 10);\n g_target = strtoul(argv[3], NULL, 10);\n\n std::vector<State*> states;\n std::set<State> visited_states;\n\n states.push_back(new State(0,0));\n while (states.size() > 0) {\n const State* state = states.back();\n states.pop_back();\n std::vector<State*> child_states = GetChildStates(*state);\n for (int i = 0; i < child_states.size(); ++i) {\n if (state->a + state->b == g_target) {\n \/\/ print path\n std::list<const State*> path;\n while (state != NULL) {\n path.push_front(state);\n state = state->parent;\n }\n for (std::list<const State*>::const_iterator path_it = path.begin();\n path_it != path.end(); ++path_it) {\n std::cout << (*path_it)->a << \" \" << (*path_it)->b << \"\\n\";\n }\n return 0;\n }\n if (visited_states.count(*child_states[i]) == 0) {\n child_states[i]->parent = state;\n states.push_back(child_states[i]);\n visited_states.insert(*child_states[i]);\n }\n }\n }\n std::cout << \"Failed to find a solution\\n\";\n return 1;\n}\n<commit_msg>Fix unsigned\/signed mismatch<commit_after>#include <cstdlib>\n#include <iostream>\n#include <list>\n#include <set>\n#include <vector>\n\nint g_capacity_a = 5;\nint g_capacity_b = 3;\nint g_target = 4;\n\nstruct State {\n State(int a, int b) : a(a), b(b), parent(NULL) {}\n\n int a;\n int b;\n const State* parent;\n\n bool operator<(const State& rhs) const {\n if (a == rhs.a) {\n return b < rhs.b;\n }\n return a < rhs.a;\n }\n};\n\nstd::vector<State*> GetChildStates(const State& state) {\n std::vector<State*> child_states;\n\n \/\/ empty a\n if (state.a != 0) {\n child_states.push_back(new State(0, state.b));\n }\n\n \/\/ empty b\n if (state.b != 0) {\n child_states.push_back(new State(state.a, 0));\n }\n\n \/\/ pour a to b\n if (state.b < g_capacity_b && state.a > 0) {\n int transfer = state.a;\n int capacity = g_capacity_b - state.b;\n\n transfer = std::min(transfer, capacity);\n\n child_states.push_back(new State(state.a - transfer, state.b + transfer));\n }\n\n \/\/ pour b to a\n if (state.a < g_capacity_a && state.b > 0) {\n int transfer = state.b;\n int capacity = g_capacity_a - state.a;\n\n transfer = std::min(transfer, capacity);\n\n child_states.push_back(new State(state.a + transfer, state.b - transfer));\n }\n\n \/\/ fill a\n if (state.a < g_capacity_a) {\n child_states.push_back(new State(g_capacity_a, state.b));\n }\n\n \/\/ fill b\n if (state.b < g_capacity_b) {\n child_states.push_back(new State(state.a, g_capacity_b));\n }\n\n return child_states;\n}\n\nint main(int argc, const char* argv[]) {\n if (argc != 4) {\n std::cerr << \"Usage: \" << argv[0] << \" <capacity-a> <capacity-b> <target>\";\n return 1;\n }\n\n g_capacity_a = strtoul(argv[1], NULL, 10);\n g_capacity_b = strtoul(argv[2], NULL, 10);\n g_target = strtoul(argv[3], NULL, 10);\n\n std::vector<State*> states;\n std::set<State> visited_states;\n\n states.push_back(new State(0,0));\n while (states.size() > 0) {\n const State* state = states.back();\n states.pop_back();\n std::vector<State*> child_states = GetChildStates(*state);\n for (size_t i = 0; i < child_states.size(); ++i) {\n if (state->a + state->b == g_target) {\n \/\/ print path\n std::list<const State*> path;\n while (state != NULL) {\n path.push_front(state);\n state = state->parent;\n }\n for (std::list<const State*>::const_iterator path_it = path.begin();\n path_it != path.end(); ++path_it) {\n std::cout << (*path_it)->a << \" \" << (*path_it)->b << \"\\n\";\n }\n return 0;\n }\n if (visited_states.count(*child_states[i]) == 0) {\n child_states[i]->parent = state;\n states.push_back(child_states[i]);\n visited_states.insert(*child_states[i]);\n }\n }\n }\n std::cout << \"Failed to find a solution\\n\";\n return 1;\n}\n<|endoftext|>"} {"text":"<commit_before>#pragma once\n\n#include <math.h>\n\nnamespace lda_util {\n\n inline bool\n valid_probability_vector(const std::vector<float> &p){\n float sum = 0;\n for(auto x: p){\n if(std::isfinite(x) == false) return false;\n if(x < 0) return false;\n sum+=x;\n }\n return (std::abs(1 - sum) < 0.01);\n }\n\n template<typename T>\n std::set<T>\n unique_members(std::vector<std::vector<T>> nested_list){\n std::set<T> unique_values;\n for(std::vector<T> list: nested_list){\n for(T val: list){\n unique_values.insert(val);\n }\n }\n return unique_values;\n }\n\n template<typename T> void\n removeFirst(std::vector<T> &v, T element){\n auto it = std::find(v.begin(),v.end(), element);\n if (it != v.end()) {\n v.erase(it);\n }\n }\n\n \/\/ http:\/\/stackoverflow.com\/a\/1267878\/982745\n template< class T >\n std::vector<T>\n selectByIndex(const std::vector<T> &v, const std::vector<size_t> &index ) {\n std::vector<T> new_v;\n new_v.reserve(index.size());\n for(size_t i: index){\n new_v.push_back(v[i]);\n }\n\n return new_v;\n }\n\n\n template<class T>\n void\n normalize(std::vector<T> &v){\n Eigen::Map<Eigen::Matrix<T, Eigen::Dynamic, 1>> vec(v.data(), v.size());\n vec \/= vec.sum();\n }\n\n template<class T, class J>\n class defaultdict{\n J default_value;\n std::map<T, J> map;\n public:\n defaultdict(J val){\n default_value = val;\n map = std::map<T, J>();\n }\n\n J get(T t) {\n if(map.count(t) > 0){\n return map[t];\n }\n else{\n return default_value;\n }\n }\n\n void\n set(T t, J j){\n map[t] = j;\n }\n\n void\n incr(T t, J by){\n if(map.count(t) > 0){\n map[t] += by;\n }\n else{\n map[t] = by + default_value;\n }\n }\n\n void\n decr(T t, J by){\n if(map.count(t) > 0){\n map[t] -= by;\n }\n else{\n map[t] = default_value - by;\n }\n }\n\n bool\n contains(T t){\n return map.count(t) > 0;\n }\n };\n}<commit_msg>Add function for extracting max element from vector of vectors<commit_after>#pragma once\n\n#include <math.h>\n\nnamespace lda_util {\n\n inline bool\n valid_probability_vector(const std::vector<float> &p){\n float sum = 0;\n for(auto x: p){\n if(std::isfinite(x) == false) return false;\n if(x < 0) return false;\n sum+=x;\n }\n return (std::abs(1 - sum) < 0.01);\n }\n\n template<typename T>\n std::set<T>\n unique_members(std::vector<std::vector<T>> nested_list){\n std::set<T> unique_values;\n for(std::vector<T> list: nested_list){\n for(T val: list){\n unique_values.insert(val);\n }\n }\n return unique_values;\n }\n\n template<typename T>\n T\n max_element(std::vector<std::vector<T>> nested_list){\n std::set<T> unique_values;\n for(std::vector<T> list: nested_list){\n for(T val: list){\n unique_values.insert(val);\n }\n }\n return *std::max_element(unique_values.begin(), unique_values.end());\n }\n\n template<typename T> void\n removeFirst(std::vector<T> &v, T element){\n auto it = std::find(v.begin(),v.end(), element);\n if (it != v.end()) {\n v.erase(it);\n }\n }\n\n \/\/ http:\/\/stackoverflow.com\/a\/1267878\/982745\n template< class T >\n std::vector<T>\n selectByIndex(const std::vector<T> &v, const std::vector<size_t> &index ) {\n std::vector<T> new_v;\n new_v.reserve(index.size());\n for(size_t i: index){\n new_v.push_back(v[i]);\n }\n\n return new_v;\n }\n\n\n template<class T>\n void\n normalize(std::vector<T> &v){\n Eigen::Map<Eigen::Matrix<T, Eigen::Dynamic, 1>> vec(v.data(), v.size());\n vec \/= vec.sum();\n }\n\n template<class T, class J>\n class defaultdict{\n J default_value;\n std::map<T, J> map;\n public:\n defaultdict(J val){\n default_value = val;\n map = std::map<T, J>();\n }\n\n J get(T t) {\n if(map.count(t) > 0){\n return map[t];\n }\n else{\n return default_value;\n }\n }\n\n void\n set(T t, J j){\n map[t] = j;\n }\n\n void\n incr(T t, J by){\n if(map.count(t) > 0){\n map[t] += by;\n }\n else{\n map[t] = by + default_value;\n }\n }\n\n void\n decr(T t, J by){\n if(map.count(t) > 0){\n map[t] -= by;\n }\n else{\n map[t] = default_value - by;\n }\n }\n\n bool\n contains(T t){\n return map.count(t) > 0;\n }\n };\n}<|endoftext|>"} {"text":"<commit_before>#include <iostream>\n#include <vector>\n#include <map>\n#include <node.h>\n\n#include \"PSATResult.h\"\n#include \"calculator\/EstimateFLA.h\"\n#include \"calculator\/MotorCurrent.h\"\n#include \"calculator\/MotorPowerFactor.h\"\n#include \"calculator\/OptimalPrePumpEff.h\"\n#include \"calculator\/OptimalSpecificSpeedCorrection.h\"\n#include \"calculator\/OptimalDeviationFactor.h\"\n\nusing namespace v8;\nusing namespace std;\n\nIsolate* iso;\nLocal<Object> inp;\n\ndouble Get(const char *nm) {\n auto rObj = inp->ToObject()->Get(String::NewFromUtf8(iso,nm));\n if (rObj->IsUndefined()) {\n cout << nm << endl;;\n assert(!\"defined\");\n }\n return rObj->NumberValue();\n}\n\nvoid Results(const FunctionCallbackInfo<Value>& args) {\n iso = args.GetIsolate();\n inp = args[0]->ToObject();\n auto r = Object::New(iso);\n\n auto drive = (Pump::Drive)(int)Get(\"drive\");\n auto effCls = (Motor::EfficiencyClass)(int)Get(\"efficiency_class\");\n Pump pump((Pump::Style)(int)Get(\"pump_style\"),Get(\"pump_specified\"),Get(\"pump_rated_speed\"),drive,\n Get(\"viscosity\"),Get(\"specific_gravity\"),Get(\"stages\"),(Pump::Speed)(int)(!Get(\"fixed_speed\")));\n Motor motor((Motor::LineFrequency)(int)(!Get(\"line\")),Get(\"motor_rated_power\"),Get(\"motor_rated_speed\"),\n effCls,Get(\"efficiency\"),Get(\"motor_rated_voltage\"),Get(\"motor_rated_flc\"),Get(\"margin\"));\n Financial fin(Get(\"fraction\"),Get(\"cost\"));\n FieldData fd(Get(\"flow\"),Get(\"head\"),(FieldData::LoadEstimationMethod)(Get(\"motor_field_power\")>0?0:1),\n Get(\"motor_field_power\"),Get(\"motor_field_current\"),Get(\"motor_field_voltage\"));\n PSATResult psat(pump,motor,fin,fd);\n psat.calculateExisting();\n psat.calculateOptimal(); \n auto ex = psat.getExisting(), opt = psat.getOptimal();\n\n map<const char *,vector<double>> out = { \n {\"Pump Efficiency\",{ex.pumpEfficiency_*100,opt.pumpEfficiency_*100}},\n {\"Motor Rated Power\",{ex.motorRatedPower_,opt.motorRatedPower_}}, \n {\"Motor Shaft Power\",{ex.motorShaftPower_,opt.motorShaftPower_}},\n {\"Pump Shaft Power\",{ex.pumpShaftPower_,opt.pumpShaftPower_}}, \n {\"Motor Efficiency\",{ex.motorEfficiency_,opt.motorEfficiency_}},\n {\"Motor Power Factor\",{ex.motorPowerFactor_,opt.motorPowerFactor_}},\n {\"Motor Current\",{ex.motorCurrent_,opt.motorCurrent_}}, \n {\"Motor Power\", {ex.motorPower_,opt.motorPower_}},\n {\"Annual Energy\", {ex.annualEnergy_,opt.annualEnergy_}},\n {\"Annual Cost\", {ex.annualCost_*1000,opt.annualCost_*1000}},\n {\"Savings Potential\", {psat.getAnnualSavingsPotential(),-1}},\n {\"Optimization Rating\", {psat.getOptimizationRating(),-1}}\n };\n for(auto p: out) { \n auto a = Array::New(iso);\n a->Set(0,Number::New(iso,p.second[0]));\n a->Set(1,Number::New(iso,p.second[1])); \n r->Set(String::NewFromUtf8(iso,p.first),a);\n }\n args.GetReturnValue().Set(r);\n}\n\nvoid EstFLA(const FunctionCallbackInfo<Value>& args) {\n iso = args.GetIsolate();\n inp = args[0]->ToObject();\n EstimateFLA fla(Get(\"motor_rated_power\"),Get(\"motor_rated_speed\"),(Motor::LineFrequency)(int)(!Get(\"line\")),(Motor::EfficiencyClass)(int)Get(\"efficiency_class\"),\n Get(\"efficiency\"),Get(\"motor_rated_voltage\"));\n fla.calculate(); \n args.GetReturnValue().Set(fla.getEstimatedFLA());\n}\n\n\/\/TODO round vs js round; loosen up to make next test case\nvoid Check(double exp, double act, const char* nm=\"\") {\n \/\/cout << \"e \" << exp << \"; a \" << act << endl;\n \/\/ if (isnan(act) || (abs(exp-act)>.01*exp)) {\n auto p = 10;\n if (isnan(act) || ( (round(exp*p)\/p)!=round(act*p)\/p)) { \n printf(\"\\\"%s\\\" TEST FAILED: %f %f\\n\",nm,exp,act);\n assert(!\"equal\");\n } \n}\n\nvoid Check100(double exp, double act, const char* nm=\"\") {\n Check(exp,act*100,nm);\n}\n\nvoid Test(const FunctionCallbackInfo<Value>& args) {\n EstimateFLA fla(200,1780,(Motor::LineFrequency)1,(Motor::EfficiencyClass)(1),0,460);\n fla.calculate();\n Check(225.8,fla.getEstimatedFLA());\n\n\/\/ motor perf\n\n {\n MotorEfficiency mef(Motor::LineFrequency::FREQ60,1780,Motor::EfficiencyClass::ENERGY_EFFICIENT,0,200,.75);\n auto mefVal = mef.calculate();\n Check100(95.69,mefVal);\n \n MotorCurrent mc(200,1780,Motor::LineFrequency::FREQ60,Motor::EfficiencyClass::ENERGY_EFFICIENT,0,.75,460,225.8);\n auto mcVal = mc.calculate();\n Check100(76.63,mcVal\/225.8);\n\n MotorPowerFactor pf(200,.75,mcVal,mefVal,460);\n Check100(84.82,pf.calculate());\n\n }\n\n\/\/nema\n {\n MotorEfficiency mef(Motor::LineFrequency::FREQ60,1200, Motor::EfficiencyClass::ENERGY_EFFICIENT,0,200,1);\n \/\/cout << mef.calculate();\n }\n\n\/\/pump eff\n {\n OptimalPrePumpEff pef(Pump::Style::END_SUCTION_ANSI_API, 0, 2000); \n cout << pef.calculate() << endl;\n\n OptimalDeviationFactor df(2000);\n cout << df.calculate() << endl;;\n }\n\n\/\/spec speed\n\n {\n OptimalSpecificSpeedCorrection cor(Pump::Style::END_SUCTION_ANSI_API, 1170);\n \/\/cout << cor.calculate();\n }\n return;\n\n #define BASE \\\n Pump pump(Pump::Style::END_SUCTION_ANSI_API,0,1780,Pump::Drive::DIRECT_DRIVE,\\\n 1,1,1,Pump::Speed::NOT_FIXED_SPEED);\\\n Motor motor(Motor::LineFrequency::FREQ60,200,1780,\\\n Motor::EfficiencyClass::ENERGY_EFFICIENT,0,460,225.8,0);\\\n Financial fin(1,.05);\\\n FieldData fd(2000,277,FieldData::LoadEstimationMethod::POWER,\\\n 150,0,460); \n\n #define CALC \\\n PSATResult psat(pump,motor,fin,fd);\\\n psat.calculateExisting();\\\n auto ex = psat.getExisting();\n\n for (int i=1; i<=10000; i=i+2) {\n BASE\n CALC\n Check(ex.motorShaftPower_,ex.motorShaftPower_,\"SAME\");\n }\n\n {\n BASE\n motor.setMotorRpm(1786);\n fd.setMotorPower(80);\n CALC\n Check(101.9,ex.motorShaftPower_);\n Check100(95,ex.motorEfficiency_);\n Check100(79.1,ex.motorPowerFactor_);\n Check(127,ex.motorCurrent_);\n }\n {\n BASE\n fd.setMotorPower(80);\n motor.setMotorRatedPower(100);\n motor.setFullLoadAmps(113.8);\n CALC\n Check(101.8,ex.motorShaftPower_);\n Check100(94.9,ex.motorEfficiency_);\n Check100(86.7,ex.motorPowerFactor_);\n Check(115.8,ex.motorCurrent_); \n }\n {\n BASE\n fd.setMotorPower(80);\n fd.setVoltage(260);\n CALC\n Check(101.9,ex.motorShaftPower_);\n Check100(95,ex.motorEfficiency_);\n Check100(138.8,ex.motorPowerFactor_);\n Check(128,ex.motorCurrent_); \n }\n {\n BASE\n motor.setMotorRpm(1200);\n fd.setMotorPower(80);\n motor.setFullLoadAmps(235.3);\n CALC\n Check(101.4,ex.motorShaftPower_);\n Check100(94.5,ex.motorEfficiency_);\n Check100(74.3,ex.motorPowerFactor_);\n Check(135.1,ex.motorCurrent_);\n } \n {\n BASE\n fd.setMotorPower(111.855);\n CALC\n Check(143.4,ex.motorShaftPower_);\n Check100(95.6,ex.motorEfficiency_);\n Check100(84.3,ex.motorPowerFactor_);\n Check(166.5,ex.motorCurrent_);\n }\n {\n BASE\n fd.setMotorPower(80);\n motor.setMotorRatedVoltage(200);\n motor.setFullLoadAmps(519.3);\n CALC\n Check(101.9,ex.motorShaftPower_);\n Check100(95,ex.motorEfficiency_);\n Check100(35.2,ex.motorPowerFactor_);\n Check(284.9,ex.motorCurrent_);\n } \n {\n BASE\n CALC\n Check(217.5,ex.motorCurrent_);\n }\n {\n BASE \n fd.setLoadEstimationMethod(FieldData::LoadEstimationMethod::CURRENT);\n fd.setMotorAmps(218);\n fd.setMotorPower(0);\n CALC\n Check(150.4,ex.motorPower_);\n Check100(72.5,ex.pumpEfficiency_);\n }\n {\n BASE\n fd.setMotorPower(80);\n CALC\n Check(700.8,ex.annualEnergy_);\n }\n {\n BASE\n fin.setOperatingFraction(.25);\n CALC\n Check(328.5,ex.annualEnergy_);\n Check(16.4,ex.annualCost_);\n }\n {\n BASE\n motor.setFullLoadAmps(300);\n CALC\n Check(288.9,ex.motorCurrent_);\n } \n {\n BASE\n motor.setEfficiencyClass(Motor::EfficiencyClass(0));\n CALC\n Check(213.7,ex.motorCurrent_);\n } \n {\n BASE\n motor.setEfficiencyClass(Motor::EfficiencyClass(2));\n motor.setSpecifiedEfficiency(75);\n CALC\n Check(173.7,ex.motorCurrent_);\n } \n cout << \"done\";\n}\n\nvoid Wtf(const FunctionCallbackInfo<Value>& args) {\n}\n\nvoid Init(Local<Object> exports) {\n NODE_SET_METHOD(exports, \"results\", Results);\n NODE_SET_METHOD(exports, \"estFLA\", EstFLA); \n NODE_SET_METHOD(exports, \"test\", Test); \n NODE_SET_METHOD(exports, \"wtf\", Wtf); \n}\n\nNODE_MODULE(bridge, Init)\n\n<commit_msg>no message<commit_after>#include <iostream>\n#include <vector>\n#include <map>\n#include <node.h>\n\n#include \"PSATResult.h\"\n#include \"calculator\/EstimateFLA.h\"\n#include \"calculator\/MotorCurrent.h\"\n#include \"calculator\/MotorPowerFactor.h\"\n#include \"calculator\/OptimalPrePumpEff.h\"\n#include \"calculator\/OptimalSpecificSpeedCorrection.h\"\n#include \"calculator\/OptimalDeviationFactor.h\"\n\nusing namespace v8;\nusing namespace std;\n\nIsolate* iso;\nLocal<Object> inp;\n\ndouble Get(const char *nm) {\n auto rObj = inp->ToObject()->Get(String::NewFromUtf8(iso,nm));\n if (rObj->IsUndefined()) {\n cout << nm << endl;;\n assert(!\"defined\");\n }\n return rObj->NumberValue();\n}\n\nvoid Results(const FunctionCallbackInfo<Value>& args) {\n iso = args.GetIsolate();\n inp = args[0]->ToObject();\n auto r = Object::New(iso);\n\n auto drive = (Pump::Drive)(int)Get(\"drive\");\n auto effCls = (Motor::EfficiencyClass)(int)Get(\"efficiency_class\");\n Pump pump((Pump::Style)(int)Get(\"pump_style\"),Get(\"pump_specified\"),Get(\"pump_rated_speed\"),drive,\n Get(\"viscosity\"),Get(\"specific_gravity\"),Get(\"stages\"),(Pump::Speed)(int)(!Get(\"fixed_speed\")));\n Motor motor((Motor::LineFrequency)(int)(!Get(\"line\")),Get(\"motor_rated_power\"),Get(\"motor_rated_speed\"),\n effCls,Get(\"efficiency\"),Get(\"motor_rated_voltage\"),Get(\"motor_rated_flc\"),Get(\"margin\"));\n Financial fin(Get(\"fraction\"),Get(\"cost\"));\n FieldData fd(Get(\"flow\"),Get(\"head\"),(FieldData::LoadEstimationMethod)(Get(\"motor_field_power\")>0?0:1),\n Get(\"motor_field_power\"),Get(\"motor_field_current\"),Get(\"motor_field_voltage\"));\n PSATResult psat(pump,motor,fin,fd);\n psat.calculateExisting();\n psat.calculateOptimal(); \n auto ex = psat.getExisting(), opt = psat.getOptimal();\n\n map<const char *,vector<double>> out = { \n {\"Pump Efficiency\",{ex.pumpEfficiency_*100,opt.pumpEfficiency_*100}},\n {\"Motor Rated Power\",{ex.motorRatedPower_,opt.motorRatedPower_}}, \n {\"Motor Shaft Power\",{ex.motorShaftPower_,opt.motorShaftPower_}},\n {\"Pump Shaft Power\",{ex.pumpShaftPower_,opt.pumpShaftPower_}}, \n {\"Motor Efficiency\",{ex.motorEfficiency_,opt.motorEfficiency_}},\n {\"Motor Power Factor\",{ex.motorPowerFactor_,opt.motorPowerFactor_}},\n {\"Motor Current\",{ex.motorCurrent_,opt.motorCurrent_}}, \n {\"Motor Power\", {ex.motorPower_,opt.motorPower_}},\n {\"Annual Energy\", {ex.annualEnergy_,opt.annualEnergy_}},\n {\"Annual Cost\", {ex.annualCost_*1000,opt.annualCost_*1000}},\n {\"Savings Potential\", {psat.getAnnualSavingsPotential(),-1}},\n {\"Optimization Rating\", {psat.getOptimizationRating(),-1}}\n };\n for(auto p: out) { \n auto a = Array::New(iso);\n a->Set(0,Number::New(iso,p.second[0]));\n a->Set(1,Number::New(iso,p.second[1])); \n r->Set(String::NewFromUtf8(iso,p.first),a);\n }\n args.GetReturnValue().Set(r);\n}\n\nvoid EstFLA(const FunctionCallbackInfo<Value>& args) {\n iso = args.GetIsolate();\n inp = args[0]->ToObject();\n EstimateFLA fla(Get(\"motor_rated_power\"),Get(\"motor_rated_speed\"),(Motor::LineFrequency)(int)(!Get(\"line\")),(Motor::EfficiencyClass)(int)Get(\"efficiency_class\"),\n Get(\"efficiency\"),Get(\"motor_rated_voltage\"));\n fla.calculate(); \n args.GetReturnValue().Set(fla.getEstimatedFLA());\n}\n\n\/\/TODO round vs js round; loosen up to make next test case\nvoid Check(double exp, double act, const char* nm=\"\") {\n \/\/cout << \"e \" << exp << \"; a \" << act << endl;\n \/\/ if (isnan(act) || (abs(exp-act)>.01*exp)) {\n auto p = 10;\n if (isnan(act) || ( (round(exp*p)\/p)!=round(act*p)\/p)) { \n printf(\"\\\"%s\\\" TEST FAILED: %f %f\\n\",nm,exp,act);\n assert(!\"equal\");\n } \n}\n\nvoid Check100(double exp, double act, const char* nm=\"\") {\n Check(exp,act*100,nm);\n}\n\nvoid Test(const FunctionCallbackInfo<Value>& args) {\n EstimateFLA fla(200,1780,(Motor::LineFrequency)1,(Motor::EfficiencyClass)(1),0,460);\n fla.calculate();\n Check(225.8,fla.getEstimatedFLA());\n\n\/\/ motor perf\n\n {\n MotorEfficiency mef(Motor::LineFrequency::FREQ60,1780,Motor::EfficiencyClass::ENERGY_EFFICIENT,0,200,.75);\n auto mefVal = mef.calculate();\n Check100(95.69,mefVal);\n \n MotorCurrent mc(200,1780,Motor::LineFrequency::FREQ60,Motor::EfficiencyClass::ENERGY_EFFICIENT,0,.75,460,225.8);\n auto mcVal = mc.calculate();\n Check100(76.63,mcVal\/225.8);\n\n MotorPowerFactor pf(200,.75,mcVal,mefVal,460);\n Check100(84.82,pf.calculate());\n\n }\n\n\/\/nema\n {\n MotorEfficiency mef(Motor::LineFrequency::FREQ60,1200, Motor::EfficiencyClass::ENERGY_EFFICIENT,0,200,1);\n \/\/cout << mef.calculate();\n }\n\n\/\/pump eff\n {\n OptimalPrePumpEff pef(Pump::Style::END_SUCTION_ANSI_API, 0, 2000); \n OptimalDeviationFactor df(2000);\n\/\/ Check(87.1,pef.calculate()*df.calculate());\n }\n\n\/\/spec speed\n\n {\n OptimalSpecificSpeedCorrection cor(Pump::Style::END_SUCTION_ANSI_API, 1170);\n \/\/cout << cor.calculate();\n }\n return;\n\n #define BASE \\\n Pump pump(Pump::Style::END_SUCTION_ANSI_API,0,1780,Pump::Drive::DIRECT_DRIVE,\\\n 1,1,1,Pump::Speed::NOT_FIXED_SPEED);\\\n Motor motor(Motor::LineFrequency::FREQ60,200,1780,\\\n Motor::EfficiencyClass::ENERGY_EFFICIENT,0,460,225.8,0);\\\n Financial fin(1,.05);\\\n FieldData fd(2000,277,FieldData::LoadEstimationMethod::POWER,\\\n 150,0,460); \n\n #define CALC \\\n PSATResult psat(pump,motor,fin,fd);\\\n psat.calculateExisting();\\\n auto ex = psat.getExisting();\n\n for (int i=1; i<=10000; i=i+2) {\n BASE\n CALC\n Check(ex.motorShaftPower_,ex.motorShaftPower_,\"SAME\");\n }\n\n {\n BASE\n motor.setMotorRpm(1786);\n fd.setMotorPower(80);\n CALC\n Check(101.9,ex.motorShaftPower_);\n Check100(95,ex.motorEfficiency_);\n Check100(79.1,ex.motorPowerFactor_);\n Check(127,ex.motorCurrent_);\n }\n {\n BASE\n fd.setMotorPower(80);\n motor.setMotorRatedPower(100);\n motor.setFullLoadAmps(113.8);\n CALC\n Check(101.8,ex.motorShaftPower_);\n Check100(94.9,ex.motorEfficiency_);\n Check100(86.7,ex.motorPowerFactor_);\n Check(115.8,ex.motorCurrent_); \n }\n {\n BASE\n fd.setMotorPower(80);\n fd.setVoltage(260);\n CALC\n Check(101.9,ex.motorShaftPower_);\n Check100(95,ex.motorEfficiency_);\n Check100(138.8,ex.motorPowerFactor_);\n Check(128,ex.motorCurrent_); \n }\n {\n BASE\n motor.setMotorRpm(1200);\n fd.setMotorPower(80);\n motor.setFullLoadAmps(235.3);\n CALC\n Check(101.4,ex.motorShaftPower_);\n Check100(94.5,ex.motorEfficiency_);\n Check100(74.3,ex.motorPowerFactor_);\n Check(135.1,ex.motorCurrent_);\n } \n {\n BASE\n fd.setMotorPower(111.855);\n CALC\n Check(143.4,ex.motorShaftPower_);\n Check100(95.6,ex.motorEfficiency_);\n Check100(84.3,ex.motorPowerFactor_);\n Check(166.5,ex.motorCurrent_);\n }\n {\n BASE\n fd.setMotorPower(80);\n motor.setMotorRatedVoltage(200);\n motor.setFullLoadAmps(519.3);\n CALC\n Check(101.9,ex.motorShaftPower_);\n Check100(95,ex.motorEfficiency_);\n Check100(35.2,ex.motorPowerFactor_);\n Check(284.9,ex.motorCurrent_);\n } \n {\n BASE\n CALC\n Check(217.5,ex.motorCurrent_);\n }\n {\n BASE \n fd.setLoadEstimationMethod(FieldData::LoadEstimationMethod::CURRENT);\n fd.setMotorAmps(218);\n fd.setMotorPower(0);\n CALC\n Check(150.4,ex.motorPower_);\n Check100(72.5,ex.pumpEfficiency_);\n }\n {\n BASE\n fd.setMotorPower(80);\n CALC\n Check(700.8,ex.annualEnergy_);\n }\n {\n BASE\n fin.setOperatingFraction(.25);\n CALC\n Check(328.5,ex.annualEnergy_);\n Check(16.4,ex.annualCost_);\n }\n {\n BASE\n motor.setFullLoadAmps(300);\n CALC\n Check(288.9,ex.motorCurrent_);\n } \n {\n BASE\n motor.setEfficiencyClass(Motor::EfficiencyClass(0));\n CALC\n Check(213.7,ex.motorCurrent_);\n } \n {\n BASE\n motor.setEfficiencyClass(Motor::EfficiencyClass(2));\n motor.setSpecifiedEfficiency(75);\n CALC\n Check(173.7,ex.motorCurrent_);\n } \n cout << \"done\";\n}\n\nvoid Wtf(const FunctionCallbackInfo<Value>& args) {\n}\n\nvoid Init(Local<Object> exports) {\n NODE_SET_METHOD(exports, \"results\", Results);\n NODE_SET_METHOD(exports, \"estFLA\", EstFLA); \n NODE_SET_METHOD(exports, \"test\", Test); \n NODE_SET_METHOD(exports, \"wtf\", Wtf); \n}\n\nNODE_MODULE(bridge, Init)\n\n<|endoftext|>"} {"text":"<commit_before><commit_msg>Fix reversed bilerp setting in GrTextContext in r4773<commit_after><|endoftext|>"} {"text":"<commit_before><commit_msg>Fixes compilation bug.<commit_after><|endoftext|>"} {"text":"<commit_before>\/*\n * \\file example0.cpp\n * \\author Mehdi Benallegue\n * \\date 2014\n * \\brief This file shows the normal use of the SCH library:\n * The simplest proximity query\n *\n * sch-core is an Efficient implementation of GJK algorithm for\n * proximity queries (collision detection, distance computations,\n * penetration depths and withness points) between convex shapes.\n * The library can be extended to any convex shape for which we\n * can compute the support function, but it already supports\n * polyhedrons, boxes, spheres and ellipsoids, and it is\n * particularly optimized for strictly convex hulls (SCH\/STP-BV).\n *\n *\n *\/\n\n#include <string>\n\n#include <iostream>\n#include <math.h>\n\n\/**********\n *The simplest proximity query\n *\/\n\n\n\/\/******************\n\/\/ Includes for 3D objects\n\n\/\/Includes for standard objects\n#include <sch\/S_Object\/S_Sphere.h>\n#include <sch\/S_Object\/S_Box.h>\n#include <sch\/S_Object\/S_Superellipsoid.h>\n\n\/\/*********************\n\/\/Includes for proximity queries\n\n\/\/Include file for proximity queries\n#include <sch\/CD\/CD_Pair.h>\n\n\/\/Inlude file for the verification of the result\n#include \"example.hxx\"\n\nusing namespace sch;\n\nint\nmain (int argc, char *argv[])\n{\n \/\/***********\n \/\/Object initializations\n\n \/\/ A box with height, width and depth\n S_Box box(0.2,0.1,0.4);\n\n \/\/Set the position in the world reference frame\n box.setPosition(0.1,0.7,0.9);\n\n \/\/Set the orientation of the Object\n \/\/(many different orientations representations are supported, here Roll\n \/\/ pitch yaw)\n box.setOrientation(0.1,1,0.7);\n\n \/\/A second object, a sphere with a radius\n S_Sphere sphere(0.3);\n\n \/\/let's transform it into an ellipsoid\n \/\/we add an anisotropic scale to the sphere\n \/\/ (the scale has to be the first operation as it affects also\n \/\/ rotations and translations)\n sphere.addScale(0.5,0.8,1.1);\n\n \/\/Set the position in the world reference frame\n sphere.setPosition(0.1,-0.7,-0.9);\n\n \/\/We turn it around the axis vrot defined by\n Vector3 vrot(0.2,0.4,0.5);\n vrot = vrot\/vrot.norm();\n\n \/\/let's turn it by 0.8 rad (we use addRotation instead of setRotation\n \/\/ to not loose the scale)\n sphere.addRotation(0.8,vrot);\n\n \/\/********\n \/\/Proximity queries\n\n \/\/Create a proximity-query pair of objects. It takes the addresses of the\n \/\/objects. The user is responsible of guaranteeing the existance of the\n \/\/objects at these addresses during all the period of use of the pair and\n \/\/desrtoying the objects at the end.\n \/\/Note that STL containers (vectors, deque, etc.) do not guarantee that\n \/\/objects remain at same address. Use them with care.\n CD_Pair pair1(&box, &sphere);\n\n \/\/Are they in collision ?\n \/\/This is the fastest proximity query as it runs GJK with the lowest\n \/\/ precision\n Scalar collision = pair1.isInCollision();\n\n \/\/This runs GJK with 1e-6 precision.\n \/\/ WARNING : THE PROVIDED DISTANCE IS SQUARED for computation time\n \/\/ purpose, the real distance is then obtained by square root\n \/\/ this algorithm takes profit from the warm start provided by the\n \/\/ previous query, so there is virtually no additional cost at making\n \/\/ these two requests instead of directly the last one.\n \/\/ if there is a collision, this will compute the penetration depth\n Scalar d0 = sqrt(fabs(pair1.getDistance()));\n\n \/\/Our witness points\n Point3 p1,p2;\n \/\/get the Witness points without running GJK or depth computation again\n \/\/ (it detects that the object did not move since the last query, if\n \/\/ one or both moved, this query would trigger GJK algorithm).\n \/\/ this method returns the distance also.\n pair1.getClosestPoints(p1,p2);\n\n \/\/Let's display all this stuff\n std::cout <<\"First Query\"<<std::endl;\n std::cout <<\"Collision: \" << (collision ? \"True\" : \"False\") <<std::endl;\n std::cout <<\"Distance: \" << d0 <<std::endl;\n std::cout <<\"Witness points: \" << std::endl;\n std::cout <<\"P1: \"<< p1 << std::endl;\n std::cout <<\"P2: \"<< p2 << std::endl;\n std::cout << std::endl;\n\n \/\/ compare the results for first query\n bool comparison = true;\n comparison = compare(d0, 1.75797057738, \"First query, d0. \") && comparison;\n comparison = compare(p1, (Vector3(0.0292236259886, 0.601445137096, 0.705635281289)), \"First query, p1. \") && comparison;\n comparison = compare(p2, (Vector3(0.0239874216807, -0.336387177086, -0.781275504057)), \"First query, p2. \") && comparison;\n\n \/\/Now we move the objects to enter in collision\n box.setPosition(0,0,0);\n sphere.setPosition(0,0,0);\n\n \/\/Query again\n collision = pair1.isInCollision();\n\n \/\/Let's run again the Distance computation, but not the penetration\n \/\/depth, because the last algorithm is much slower, if there is a\n \/\/collision, the output would be zero\n \/\/\n Scalar d1 = sqrt(fabs(pair1.getDistanceWithoutPenetrationDepth()));\n\n \/\/We call now the regular distance query (collision will trigger\n \/\/depth query and the distance will be given in negative to distinguish\n \/\/ it from separating distance)\n Scalar d2 = sqrt(fabs(pair1.getDistance()));\n\n \/\/Our witness points\n pair1.getClosestPoints(p1,p2);\n\n \/\/Let's display all this stuff\n std::cout <<\"Second Query\"<<std::endl;\n std::cout <<\"Collision: \" << (collision ? \"True\" : \"False\") <<std::endl;\n std::cout <<\"Distance: \" << d1 <<std::endl;\n std::cout <<\"Depth: \" << d2 <<std::endl;\n std::cout <<\"Witness points: \" << std::endl;\n std::cout <<\"P1: \"<< p1 << std::endl;\n std::cout <<\"P2: \"<< p2 << std::endl;\n std::cout << std::endl;\n\n \/\/ compare the results for second query\n comparison = compare(d1, 0., \"Second query, d1. \") && comparison;\n comparison = compare(d2, 0.299512091292, \"Second query, d2. \") && comparison;\n comparison = compare(p1, (Vector3(-0.00434104104872, 0.05459580466, 0.0554891519385)), \"Second query, p1. \") && comparison;\n comparison = compare(p2, (Vector3( 0.168401731876, -0.189548453895, 0.039333402279)), \"Second query, p2. \") && comparison;\n\n \/\/******************\n \/\/More objects\n\n \/\/Create the third object\n \/\/ A superellipsoid with height, width, depth, epsilon1, epsilon2\n S_Superellipsoid super(0.1,0.9,0.3,0.5,0.8);\n\n \/\/Position\/Orientation\n super.setPosition(0.2,0.8,1);\n super.setOrientation(0.2,1.7,0.8);\n\n \/\/Creation of new pairs related to the new objects. Each pair of 3D objects\n \/\/is then a C++ objects\n CD_Pair pair2(&box, &super);\n CD_Pair pair3(&sphere, &super);\n\n \/\/Our witness points\n Point3 p3,p4,p5,p6;\n\n \/\/We can directly ask for the closest points\n \/\/When the returned value is negative, it is the opposite of the squared\n \/\/depth.\n d0 = pair1.getClosestPoints(p1,p2);\n d1 = pair2.getClosestPoints(p3,p4);\n d2 = pair3.getClosestPoints(p5,p6);\n\n \/\/ compare the results for third query\n comparison = compare(d0, -0.0897074928302, \"Third Query, d0\") && comparison;\n comparison = compare(p1, (Vector3(-0.00434104104872, 0.05459580466, 0.0554891519385)), \"Third Query, p1\") && comparison;\n comparison = compare(p2, (Vector3(0.168401731876, -0.189548453895, 0.039333402279)), \"Third Query, p2\") && comparison;\n\n comparison = compare(d1, 0.659596933491, \"Third Query, d1\") && comparison;\n comparison = compare(p3, (Vector3(0.0707763740114, 0.0985548629043, 0.194364718711)), \"Third Query, p3\") && comparison;\n comparison = compare(p4, (Vector3(0.259412979986, 0.301096580075, 0.95790254828 )), \"Third Query, p4\") && comparison;\n\n comparison = compare(d2, 0.519893514363, \"Third Query, d2\") && comparison;\n comparison = compare(p5, (sch::Vector3(0.11715929646, 0.0390787247198, 0.296880292018)), \"Third Query, p5\") && comparison;\n comparison = compare(p6, (sch::Vector3(0.296073498451, 0.242288276053, 0.965153515285)), \"Third Query, p6\") && comparison;\n\n\n \/\/Let's display all this stuff\n std::cout <<\"Third Query\"<<std::endl;\n std::cout <<\"Distance1 Squared: \" << d0 <<std::endl;\n std::cout <<\"Witness points 1: \" << std::endl;\n std::cout <<\"P1: \"<< p1 << std::endl;\n std::cout <<\"P2: \"<< p2 << std::endl;\n std::cout <<\"Distance2 Squared: \" << d1 <<std::endl;\n std::cout <<\"Witness points 2: \" << std::endl;\n std::cout <<\"P1: \"<< p3 << std::endl;\n std::cout <<\"P2: \"<< p4 << std::endl;\n std::cout <<\"Distance3 Squared: \" << d2 <<std::endl;\n std::cout <<\"Witness points 3: \" << std::endl;\n std::cout <<\"P1: \"<< p5 << std::endl;\n std::cout <<\"P2: \"<< p6 << std::endl;\n std::cout << std::endl;\n\n return (comparison?0:1);\n \/\/That's all folks\n}\n\n\/* Standard output of this example:\n\nFirst Query\nCollision: False\nDistance: 1.73205\nWitness points:\nP1: 0.0292236 0.601445 0.705635\nP2: 0.0239874 -0.336387 -0.781276\n\nSecond Query\nCollision: True\nDistance: 0\nDepth: 0.299512\nWitness points:\nP1: -0.00434104 0.0545958 0.0554892\nP2: 0.168402 -0.189548 0.0393334\n\nThird Query\nDistance1 Squared: -0.0897075\nWitness points 1:\nP1: -0.00434104 0.0545958 0.0554892\nP2: 0.168402 -0.189548 0.0393334\nDistance2 Squared: 0.659597\nWitness points 2:\nP1: 0.0707764 0.0985549 0.194365\nP2: 0.259413 0.301097 0.957903\nDistance3 Squared: 0.519894\nWitness points 3:\nP1: 0.117159 0.0390787 0.29688\nP2: 0.296073 0.242288 0.965154\n*\/\n<commit_msg>example0: remove symmetry.<commit_after>\/*\n * \\file example0.cpp\n * \\author Mehdi Benallegue\n * \\date 2014\n * \\brief This file shows the normal use of the SCH library:\n * The simplest proximity query\n *\n * sch-core is an Efficient implementation of GJK algorithm for\n * proximity queries (collision detection, distance computations,\n * penetration depths and withness points) between convex shapes.\n * The library can be extended to any convex shape for which we\n * can compute the support function, but it already supports\n * polyhedrons, boxes, spheres and ellipsoids, and it is\n * particularly optimized for strictly convex hulls (SCH\/STP-BV).\n *\n *\n *\/\n\n#include <string>\n\n#include <iostream>\n#include <math.h>\n#include <limits>\n\n\/**********\n *The simplest proximity query\n *\/\n\n\n\/\/******************\n\/\/ Includes for 3D objects\n\n\/\/Includes for standard objects\n#include <sch\/S_Object\/S_Sphere.h>\n#include <sch\/S_Object\/S_Box.h>\n#include <sch\/S_Object\/S_Superellipsoid.h>\n\n\/\/*********************\n\/\/Includes for proximity queries\n\n\/\/Include file for proximity queries\n#include <sch\/CD\/CD_Pair.h>\n\n\/\/Inlude file for the verification of the result\n#include \"example.hxx\"\n\nusing namespace sch;\n\nint\nmain (int argc, char *argv[])\n{\n \/\/Set output precision\n std::cout.precision (std::numeric_limits<double>::digits10);\n std::cerr.precision (std::numeric_limits<double>::digits10);\n\n \/\/***********\n \/\/Object initializations\n\n \/\/ A box with height, width and depth\n S_Box box(0.2,0.1,0.4);\n\n \/\/Set the position in the world reference frame\n box.setPosition(0.1,0.7,0.9);\n\n \/\/Set the orientation of the Object\n \/\/(many different orientations representations are supported, here Roll\n \/\/ pitch yaw)\n box.setOrientation(0.1,1,0.7);\n\n \/\/A second object, a sphere with a radius\n S_Sphere sphere(0.3);\n\n \/\/let's transform it into an ellipsoid\n \/\/we add an anisotropic scale to the sphere\n \/\/ (the scale has to be the first operation as it affects also\n \/\/ rotations and translations)\n sphere.addScale(0.5,0.8,1.1);\n\n \/\/Set the position in the world reference frame\n sphere.setPosition(0.1,-0.7,-0.9);\n\n \/\/We turn it around the axis vrot defined by\n Vector3 vrot(0.2,0.4,0.5);\n vrot = vrot\/vrot.norm();\n\n \/\/let's turn it by 0.8 rad (we use addRotation instead of setRotation\n \/\/ to not loose the scale)\n sphere.addRotation(0.8,vrot);\n\n \/\/********\n \/\/Proximity queries\n\n \/\/Create a proximity-query pair of objects. It takes the addresses of the\n \/\/objects. The user is responsible of guaranteeing the existance of the\n \/\/objects at these addresses during all the period of use of the pair and\n \/\/desrtoying the objects at the end.\n \/\/Note that STL containers (vectors, deque, etc.) do not guarantee that\n \/\/objects remain at same address. Use them with care.\n CD_Pair pair1(&box, &sphere);\n\n \/\/Are they in collision ?\n \/\/This is the fastest proximity query as it runs GJK with the lowest\n \/\/ precision\n Scalar collision = pair1.isInCollision();\n\n \/\/This runs GJK with 1e-6 precision.\n \/\/ WARNING : THE PROVIDED DISTANCE IS SQUARED for computation time\n \/\/ purpose, the real distance is then obtained by square root\n \/\/ this algorithm takes profit from the warm start provided by the\n \/\/ previous query, so there is virtually no additional cost at making\n \/\/ these two requests instead of directly the last one.\n \/\/ if there is a collision, this will compute the penetration depth\n Scalar d0 = sqrt(fabs(pair1.getDistance()));\n\n \/\/Our witness points\n Point3 p1,p2;\n \/\/get the Witness points without running GJK or depth computation again\n \/\/ (it detects that the object did not move since the last query, if\n \/\/ one or both moved, this query would trigger GJK algorithm).\n \/\/ this method returns the distance also.\n pair1.getClosestPoints(p1,p2);\n\n \/\/Let's display all this stuff\n std::cout <<\"First Query\"<<std::endl;\n std::cout <<\"Collision: \" << (collision ? \"True\" : \"False\") <<std::endl;\n std::cout <<\"Distance: \" << d0 <<std::endl;\n std::cout <<\"Witness points: \" << std::endl;\n std::cout <<\"P1: \"<< p1 << std::endl;\n std::cout <<\"P2: \"<< p2 << std::endl;\n std::cout << std::endl;\n\n \/\/ compare the results for first query\n bool comparison = true;\n comparison = compare(d0, 1.75797057738, \"First query, d0. \") && comparison;\n comparison = compare(p1, (Vector3(0.0292236259886, 0.601445137096, 0.705635281289)), \"First query, p1. \") && comparison;\n comparison = compare(p2, (Vector3(0.0239874216807, -0.336387177086, -0.781275504057)), \"First query, p2. \") && comparison;\n\n \/\/Now we move the objects to enter in collision\n \/\/We avoid symmetries to always get the same witness points.\n box.setPosition(0,0,0);\n sphere.setPosition(0.01,0,0);\n\n \/\/Query again\n collision = pair1.isInCollision();\n\n \/\/Let's run again the Distance computation, but not the penetration\n \/\/depth, because the last algorithm is much slower, if there is a\n \/\/collision, the output would be zero\n \/\/\n Scalar d1 = sqrt(fabs(pair1.getDistanceWithoutPenetrationDepth()));\n\n \/\/We call now the regular distance query (collision will trigger\n \/\/depth query and the distance will be given in negative to distinguish\n \/\/ it from separating distance)\n Scalar d2 = sqrt(fabs(pair1.getDistance()));\n\n \/\/Our witness points\n pair1.getClosestPoints(p1,p2);\n\n \/\/Let's display all this stuff\n std::cout <<\"Second Query\"<<std::endl;\n std::cout <<\"Collision: \" << (collision ? \"True\" : \"False\") <<std::endl;\n std::cout <<\"Distance: \" << d1 <<std::endl;\n std::cout <<\"Depth: \" << d2 <<std::endl;\n std::cout <<\"Witness points: \" << std::endl;\n std::cout <<\"P1: \"<< p1 << std::endl;\n std::cout <<\"P2: \"<< p2 << std::endl;\n std::cout << std::endl;\n\n \/\/ compare the results for second query\n comparison = compare(d1, 0., \"Second query, d1. \") && comparison;\n comparison = compare(d2, 0.293744618861213, \"Second query, d2. \") && comparison;\n comparison = compare(p1, (Vector3(0.0110146674327551, -0.0498945075944604, -0.0551780527427314)), \"Second query, p1. \") && comparison;\n comparison = compare(p2, (Vector3(-0.158401731667896, 0.18954845401356, -0.0393334018450828)), \"Second query, p2. \") && comparison;\n\n \/\/******************\n \/\/More objects\n\n \/\/Create the third object\n \/\/ A superellipsoid with height, width, depth, epsilon1, epsilon2\n S_Superellipsoid super(0.1,0.9,0.3,0.5,0.8);\n\n \/\/Position\/Orientation\n super.setPosition(0.2,0.8,1);\n super.setOrientation(0.2,1.7,0.8);\n\n \/\/Creation of new pairs related to the new objects. Each pair of 3D objects\n \/\/is then a C++ objects\n CD_Pair pair2(&box, &super);\n CD_Pair pair3(&sphere, &super);\n\n \/\/Our witness points\n Point3 p3,p4,p5,p6;\n\n \/\/We can directly ask for the closest points\n \/\/When the returned value is negative, it is the opposite of the squared\n \/\/depth.\n d0 = pair1.getClosestPoints(p1,p2);\n d1 = pair2.getClosestPoints(p3,p4);\n d2 = pair3.getClosestPoints(p5,p6);\n\n \/\/ compare the results for third query\n comparison = compare(d0, -0.0862859011099191, \"Third Query, d0\") && comparison;\n comparison = compare(p1, (Vector3(0.0110146674327551, -0.0498945075944604, -0.0551780527427314)), \"Third Query, p1\") && comparison;\n comparison = compare(p2, (Vector3(-0.158401731667896, 0.18954845401356, -0.0393334018450828)), \"Third Query, p2\") && comparison;\n\n comparison = compare(d1, 0.659596933491, \"Third Query, d1\") && comparison;\n comparison = compare(p3, (Vector3(0.0707763740114, 0.0985548629043, 0.194364718711)), \"Third Query, p3\") && comparison;\n comparison = compare(p4, (Vector3(0.259412979986, 0.301096580075, 0.95790254828 )), \"Third Query, p4\") && comparison;\n\n comparison = compare(d2, 0.516365498703901, \"Third Query, d2\") && comparison;\n comparison = compare(p5, (sch::Vector3(0.126586144900461, 0.0390218116062935, 0.297048794226006)), \"Third Query, p5\") && comparison;\n comparison = compare(p6, (sch::Vector3(0.300323477842992, 0.23919818987692, 0.964963650647371)), \"Third Query, p6\") && comparison;\n\n\n \/\/Let's display all this stuff\n std::cout <<\"Third Query\"<<std::endl;\n std::cout <<\"Distance1 Squared: \" << d0 <<std::endl;\n std::cout <<\"Witness points 1: \" << std::endl;\n std::cout <<\"P1: \"<< p1 << std::endl;\n std::cout <<\"P2: \"<< p2 << std::endl;\n std::cout <<\"Distance2 Squared: \" << d1 <<std::endl;\n std::cout <<\"Witness points 2: \" << std::endl;\n std::cout <<\"P1: \"<< p3 << std::endl;\n std::cout <<\"P2: \"<< p4 << std::endl;\n std::cout <<\"Distance3 Squared: \" << d2 <<std::endl;\n std::cout <<\"Witness points 3: \" << std::endl;\n std::cout <<\"P1: \"<< p5 << std::endl;\n std::cout <<\"P2: \"<< p6 << std::endl;\n std::cout << std::endl;\n\n return (comparison?0:1);\n \/\/That's all folks\n}\n\n\/* Standard output of this example:\n\nFirst Query\nCollision: False\nDistance: 1.75797057738094\nWitness points:\nP1: 0.0292236259885692 0.601445137095698 0.705635281288737\nP2: 0.0239874216806999 -0.336387177086141 -0.781275504057127\n\nSecond Query\nCollision: True\nDistance: 0\nDepth: 0.293744618861213\nWitness points:\nP1: 0.0110146674327551 -0.0498945075944604 -0.0551780527427314\nP2: -0.158401731667896 0.18954845401356 -0.0393334018450828\n\nThird Query\nDistance1 Squared: -0.0862859011099191\nWitness points 1:\nP1: 0.0110146674327551 -0.0498945075944604 -0.0551780527427314\nP2: -0.158401731667896 0.18954845401356 -0.0393334018450828\nDistance2 Squared: 0.659596933490814\nWitness points 2:\nP1: 0.0707763740114308 0.0985548629043023 0.194364718711263\nP2: 0.259412979986433 0.301096580075066 0.957902548280017\nDistance3 Squared: 0.516365498703901\nWitness points 3:\nP1: 0.126586144900461 0.0390218116062935 0.297048794226006\nP2: 0.300323477842992 0.23919818987692 0.964963650647371\n*\/\n<|endoftext|>"} {"text":"<commit_before>\/** \n * @file lllandmarklist.cpp\n * @brief Landmark asset list class\n *\n * $LicenseInfo:firstyear=2002&license=viewergpl$\n * \n * Copyright (c) 2002-2009, Linden Research, Inc.\n * \n * Second Life Viewer Source Code\n * The source code in this file (\"Source Code\") is provided by Linden Lab\n * to you under the terms of the GNU General Public License, version 2.0\n * (\"GPL\"), unless you have obtained a separate licensing agreement\n * (\"Other License\"), formally executed by you and Linden Lab. Terms of\n * the GPL can be found in doc\/GPL-license.txt in this distribution, or\n * online at http:\/\/secondlifegrid.net\/programs\/open_source\/licensing\/gplv2\n * \n * There are special exceptions to the terms and conditions of the GPL as\n * it is applied to this Source Code. View the full text of the exception\n * in the file doc\/FLOSS-exception.txt in this software distribution, or\n * online at\n * http:\/\/secondlifegrid.net\/programs\/open_source\/licensing\/flossexception\n * \n * By copying, modifying or distributing this software, you acknowledge\n * that you have read and understood your obligations described above,\n * and agree to abide by those obligations.\n * \n * ALL LINDEN LAB SOURCE CODE IS PROVIDED \"AS IS.\" LINDEN LAB MAKES NO\n * WARRANTIES, EXPRESS, IMPLIED OR OTHERWISE, REGARDING ITS ACCURACY,\n * COMPLETENESS OR PERFORMANCE.\n * $\/LicenseInfo$\n *\/\n\n#include \"llviewerprecompiledheaders.h\"\n\n#include \"lllandmarklist.h\"\n\n#include \"message.h\"\n#include \"llassetstorage.h\"\n\n#include \"llagent.h\"\n#include \"llnotify.h\"\n#include \"llvfile.h\"\n#include \"llviewerstats.h\"\n\n\/\/ Globals\nLLLandmarkList gLandmarkList;\n\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ LLLandmarkList\n\nLLLandmarkList::~LLLandmarkList()\n{\n\tstd::for_each(mList.begin(), mList.end(), DeletePairedPointer());\n}\n\nLLLandmark* LLLandmarkList::getAsset(const LLUUID& asset_uuid, loaded_callback_t cb)\n{\n\tLLLandmark* landmark = get_ptr_in_map(mList, asset_uuid);\n\tif(landmark)\n\t{\n\t\treturn landmark;\n\t}\n\telse\n\t{\n\t if ( gLandmarkList.mBadList.find(asset_uuid) == gLandmarkList.mBadList.end() )\n\t\t{\n\t\t\tif (cb)\n\t\t\t{\n\t\t\t\tloaded_callback_map_t::value_type vt(asset_uuid, cb);\n\t\t\t\tmLoadedCallbackMap.insert(vt);\n\t\t\t}\n\n\t\t\tgAssetStorage->getAssetData(\n\t\t\t\tasset_uuid,\n\t\t\t\tLLAssetType::AT_LANDMARK,\n\t\t\t\tLLLandmarkList::processGetAssetReply,\n\t\t\t\tNULL);\n\t\t}\n\t}\n\treturn NULL;\n}\n\n\/\/ static\nvoid LLLandmarkList::processGetAssetReply(\n\tLLVFS *vfs,\n\tconst LLUUID& uuid,\n\tLLAssetType::EType type,\n\tvoid* user_data,\n\tS32 status, \n\tLLExtStat ext_status )\n{\n\tif( status == 0 )\n\t{\n\t\tLLVFile file(vfs, uuid, type);\n\t\tS32 file_length = file.getSize();\n\n\t\tstd::vector<char> buffer(file_length + 1);\n\t\tfile.read( (U8*)&buffer[0], file_length);\n\t\tbuffer[ file_length ] = 0;\n\n\t\tLLLandmark* landmark = LLLandmark::constructFromString(&buffer[0]);\n\t\tif (landmark)\n\t\t{\n\t\t\tgLandmarkList.mList[ uuid ] = landmark;\n\n\t\t\tLLVector3d pos;\n\t\t\tif(!landmark->getGlobalPos(pos))\n\t\t\t{\n\t\t\t\tLLUUID region_id;\n\t\t\t\tif(landmark->getRegionID(region_id))\n\t\t\t\t{\n\t\t\t\t\tLLLandmark::requestRegionHandle(\n\t\t\t\t\t\tgMessageSystem,\n\t\t\t\t\t\tgAgent.getRegionHost(),\n\t\t\t\t\t\tregion_id,\n\t\t\t\t\t\tboost::bind(&LLLandmarkList::onRegionHandle, &gLandmarkList, uuid));\n\t\t\t\t}\n\n\t\t\t\t\/\/ the callback will be called when we get the region handle.\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\tgLandmarkList.makeCallbacks(uuid);\n\t\t\t}\n\t\t}\n\t}\n\telse\n\t{\n\t\tLLViewerStats::getInstance()->incStat( LLViewerStats::ST_DOWNLOAD_FAILED );\n\n\t\tif( LL_ERR_ASSET_REQUEST_NOT_IN_DATABASE == status )\n\t\t{\n\t\t\tLLNotifications::instance().add(\"LandmarkMissing\");\n\t\t}\n\t\telse\n\t\t{\n\t\t\tLLNotifications::instance().add(\"UnableToLoadLandmark\");\n\t\t}\n\n\t\tgLandmarkList.mBadList.insert(uuid);\n\t}\n\n}\n\nBOOL LLLandmarkList::assetExists(const LLUUID& asset_uuid)\n{\n\treturn mList.count(asset_uuid) != 0 || mBadList.count(asset_uuid) != 0;\n}\n\nvoid LLLandmarkList::onRegionHandle(const LLUUID& landmark_id)\n{\n\tLLLandmark* landmark = getAsset(landmark_id);\n\n\tif (!landmark)\n\t{\n\t\tllwarns << \"Got region handle but the landmark not found.\" << llendl;\n\t\treturn;\n\t}\n\n\t\/\/ Calculate landmark global position.\n\t\/\/ This should succeed since the region handle is available.\n\tLLVector3d pos;\n\tif (!landmark->getGlobalPos(pos))\n\t{\n\t\tllwarns << \"Got region handle but the landmark global position is still unknown.\" << llendl;\n\t\treturn;\n\t}\n\n\tmakeCallbacks(landmark_id);\n}\n\nvoid LLLandmarkList::makeCallbacks(const LLUUID& landmark_id)\n{\n\tLLLandmark* landmark = getAsset(landmark_id);\n\n\tif (!landmark)\n\t{\n\t\tllwarns << \"Landmark to make callbacks for not found.\" << llendl;\n\t}\n\n\t\/\/ make all the callbacks here.\n\tloaded_callback_map_t::iterator it;\n\twhile((it = mLoadedCallbackMap.find(landmark_id)) != mLoadedCallbackMap.end())\n\t{\n\t\tif (landmark)\n\t\t\t(*it).second(landmark);\n\n\t\tmLoadedCallbackMap.erase(it);\n\t}\n}\n<commit_msg>Partial fix for EXT-1123 (this shouldn't merit a notification), but we should investigate why these requests are failing in the first place.<commit_after>\/** \n * @file lllandmarklist.cpp\n * @brief Landmark asset list class\n *\n * $LicenseInfo:firstyear=2002&license=viewergpl$\n * \n * Copyright (c) 2002-2009, Linden Research, Inc.\n * \n * Second Life Viewer Source Code\n * The source code in this file (\"Source Code\") is provided by Linden Lab\n * to you under the terms of the GNU General Public License, version 2.0\n * (\"GPL\"), unless you have obtained a separate licensing agreement\n * (\"Other License\"), formally executed by you and Linden Lab. Terms of\n * the GPL can be found in doc\/GPL-license.txt in this distribution, or\n * online at http:\/\/secondlifegrid.net\/programs\/open_source\/licensing\/gplv2\n * \n * There are special exceptions to the terms and conditions of the GPL as\n * it is applied to this Source Code. View the full text of the exception\n * in the file doc\/FLOSS-exception.txt in this software distribution, or\n * online at\n * http:\/\/secondlifegrid.net\/programs\/open_source\/licensing\/flossexception\n * \n * By copying, modifying or distributing this software, you acknowledge\n * that you have read and understood your obligations described above,\n * and agree to abide by those obligations.\n * \n * ALL LINDEN LAB SOURCE CODE IS PROVIDED \"AS IS.\" LINDEN LAB MAKES NO\n * WARRANTIES, EXPRESS, IMPLIED OR OTHERWISE, REGARDING ITS ACCURACY,\n * COMPLETENESS OR PERFORMANCE.\n * $\/LicenseInfo$\n *\/\n\n#include \"llviewerprecompiledheaders.h\"\n\n#include \"lllandmarklist.h\"\n\n#include \"message.h\"\n#include \"llassetstorage.h\"\n\n#include \"llagent.h\"\n#include \"llnotify.h\"\n#include \"llvfile.h\"\n#include \"llviewerstats.h\"\n\n\/\/ Globals\nLLLandmarkList gLandmarkList;\n\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ LLLandmarkList\n\nLLLandmarkList::~LLLandmarkList()\n{\n\tstd::for_each(mList.begin(), mList.end(), DeletePairedPointer());\n}\n\nLLLandmark* LLLandmarkList::getAsset(const LLUUID& asset_uuid, loaded_callback_t cb)\n{\n\tLLLandmark* landmark = get_ptr_in_map(mList, asset_uuid);\n\tif(landmark)\n\t{\n\t\treturn landmark;\n\t}\n\telse\n\t{\n\t if ( gLandmarkList.mBadList.find(asset_uuid) == gLandmarkList.mBadList.end() )\n\t\t{\n\t\t\tif (cb)\n\t\t\t{\n\t\t\t\tloaded_callback_map_t::value_type vt(asset_uuid, cb);\n\t\t\t\tmLoadedCallbackMap.insert(vt);\n\t\t\t}\n\n\t\t\tgAssetStorage->getAssetData(\n\t\t\t\tasset_uuid,\n\t\t\t\tLLAssetType::AT_LANDMARK,\n\t\t\t\tLLLandmarkList::processGetAssetReply,\n\t\t\t\tNULL);\n\t\t}\n\t}\n\treturn NULL;\n}\n\n\/\/ static\nvoid LLLandmarkList::processGetAssetReply(\n\tLLVFS *vfs,\n\tconst LLUUID& uuid,\n\tLLAssetType::EType type,\n\tvoid* user_data,\n\tS32 status, \n\tLLExtStat ext_status )\n{\n\tif( status == 0 )\n\t{\n\t\tLLVFile file(vfs, uuid, type);\n\t\tS32 file_length = file.getSize();\n\n\t\tstd::vector<char> buffer(file_length + 1);\n\t\tfile.read( (U8*)&buffer[0], file_length);\n\t\tbuffer[ file_length ] = 0;\n\n\t\tLLLandmark* landmark = LLLandmark::constructFromString(&buffer[0]);\n\t\tif (landmark)\n\t\t{\n\t\t\tgLandmarkList.mList[ uuid ] = landmark;\n\n\t\t\tLLVector3d pos;\n\t\t\tif(!landmark->getGlobalPos(pos))\n\t\t\t{\n\t\t\t\tLLUUID region_id;\n\t\t\t\tif(landmark->getRegionID(region_id))\n\t\t\t\t{\n\t\t\t\t\tLLLandmark::requestRegionHandle(\n\t\t\t\t\t\tgMessageSystem,\n\t\t\t\t\t\tgAgent.getRegionHost(),\n\t\t\t\t\t\tregion_id,\n\t\t\t\t\t\tboost::bind(&LLLandmarkList::onRegionHandle, &gLandmarkList, uuid));\n\t\t\t\t}\n\n\t\t\t\t\/\/ the callback will be called when we get the region handle.\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\tgLandmarkList.makeCallbacks(uuid);\n\t\t\t}\n\t\t}\n\t}\n\telse\n\t{\n\t\tLLViewerStats::getInstance()->incStat( LLViewerStats::ST_DOWNLOAD_FAILED );\n\t\t\/\/ SJB: No use case for a notification here. Use lldebugs instead\n\t\tif( LL_ERR_ASSET_REQUEST_NOT_IN_DATABASE == status )\n\t\t{\n\t\t\tLL_DEBUGS(\"Landmarks\") << \"Missing Landmark\" << LL_ENDL;\n\t\t\t\/\/LLNotifications::instance().add(\"LandmarkMissing\");\n\t\t}\n\t\telse\n\t\t{\n\t\t\tLL_DEBUGS(\"Landmarks\") << \"Unable to load Landmark\" << LL_ENDL;\n\t\t\t\/\/LLNotifications::instance().add(\"UnableToLoadLandmark\");\n\t\t}\n\n\t\tgLandmarkList.mBadList.insert(uuid);\n\t}\n\n}\n\nBOOL LLLandmarkList::assetExists(const LLUUID& asset_uuid)\n{\n\treturn mList.count(asset_uuid) != 0 || mBadList.count(asset_uuid) != 0;\n}\n\nvoid LLLandmarkList::onRegionHandle(const LLUUID& landmark_id)\n{\n\tLLLandmark* landmark = getAsset(landmark_id);\n\n\tif (!landmark)\n\t{\n\t\tllwarns << \"Got region handle but the landmark not found.\" << llendl;\n\t\treturn;\n\t}\n\n\t\/\/ Calculate landmark global position.\n\t\/\/ This should succeed since the region handle is available.\n\tLLVector3d pos;\n\tif (!landmark->getGlobalPos(pos))\n\t{\n\t\tllwarns << \"Got region handle but the landmark global position is still unknown.\" << llendl;\n\t\treturn;\n\t}\n\n\tmakeCallbacks(landmark_id);\n}\n\nvoid LLLandmarkList::makeCallbacks(const LLUUID& landmark_id)\n{\n\tLLLandmark* landmark = getAsset(landmark_id);\n\n\tif (!landmark)\n\t{\n\t\tllwarns << \"Landmark to make callbacks for not found.\" << llendl;\n\t}\n\n\t\/\/ make all the callbacks here.\n\tloaded_callback_map_t::iterator it;\n\twhile((it = mLoadedCallbackMap.find(landmark_id)) != mLoadedCallbackMap.end())\n\t{\n\t\tif (landmark)\n\t\t\t(*it).second(landmark);\n\n\t\tmLoadedCallbackMap.erase(it);\n\t}\n}\n<|endoftext|>"} {"text":"<commit_before><commit_msg>Fix overloads of function to use intrinsic integer types<commit_after><|endoftext|>"} {"text":"<commit_before>\/\/ @(#)root\/tmva $Id$ \n\/\/ Author: Andrzej Zemla\n\n\/**********************************************************************************\n * Project: TMVA - a Root-integrated toolkit for multivariate data analysis *\n * Package: TMVA *\n * Class : SVKernelFunction *\n * Web : http:\/\/tmva.sourceforge.net *\n * *\n * Description: *\n * Implementation *\n * *\n * Authors (alphabetical): *\n * Marcin Wolter <Marcin.Wolter@cern.ch> - IFJ PAN, Krakow, Poland *\n * Andrzej Zemla <azemla@cern.ch> - IFJ PAN, Krakow, Poland *\n * (IFJ PAN: Henryk Niewodniczanski Inst. Nucl. Physics, Krakow, Poland) * \n * *\n * Copyright (c) 2005: *\n * CERN, Switzerland * \n * MPI-K Heidelberg, Germany * \n * PAN, Krakow, Poland *\n * *\n * Redistribution and use in source and binary forms, with or without *\n * modification, are permitted according to the terms listed in LICENSE *\n * (http:\/\/tmva.sourceforge.net\/LICENSE) *\n **********************************************************************************\/\n\n#include \"TMVA\/SVKernelFunction.h\"\n#include \"TMVA\/SVEvent.h\"\n#include \"TMath.h\"\n#include <vector>\n\n\/\/_______________________________________________________________________\nTMVA::SVKernelFunction::SVKernelFunction()\n : fGamma(0.),\n fKernel(kRBF), \/\/ kernel, order, theta, and kappa are for backward compatibility\n fOrder(0),\n fTheta(0),\n fKappa(0)\n{\n \/\/ constructor\n}\n\n\/\/_______________________________________________________________________\nTMVA::SVKernelFunction::SVKernelFunction( Float_t gamma )\n : fGamma(gamma),\n fKernel(kRBF), \/\/ kernel, order, theta, and kappa are for backward compatibility\n fOrder(0),\n fTheta(0),\n fKappa(0)\n{\n \/\/ constructor\n}\n\n\/\/_______________________________________________________________________\nTMVA::SVKernelFunction::~SVKernelFunction() \n{\n \/\/ destructor\n}\n\n\/\/_______________________________________________________________________\nvoid TMVA::SVKernelFunction::setCompatibilityParams(EKernelType k, UInt_t order, Float_t theta, Float_t kappa) {\n \/\/ set old options for compatibility mode\n fKernel = k;\n fOrder = order;\n fTheta = theta;\n fKappa = kappa;\n}\n\n\/\/_______________________________________________________________________\nFloat_t TMVA::SVKernelFunction::Evaluate( SVEvent* ev1, SVEvent* ev2 )\n{\n\n switch(fKernel) {\n case kRBF:\n {\n std::vector<Float_t> *v1 = ev1->GetDataVector();\n std::vector<Float_t> *v2 = ev2->GetDataVector();\n \n Float_t norm = 0;\n for (UInt_t i = 0; i < v1->size(); i++) norm += ((*v1)[i] -(*v2)[i]) *((*v1)[i] -(*v2)[i]) ;\n \n return TMath::Exp(-norm*fGamma);\n }\n case kPolynomial:\n {\n std::vector<Float_t> *v1 = ev1->GetDataVector();\n std::vector<Float_t> *v2 = ev2->GetDataVector();\n Float_t prod = fTheta;\n for (UInt_t i = 0; i < v1->size(); i++) prod += (*v1)[i] * (*v2)[i];\n\n Float_t result = 1.;\n Int_t i = fOrder;\n for (; i > 0; i \/= 2) {\n if (i%2) result = prod; \n prod *= prod; \n } \n return result;\n }\n case kLinear:\n {\n std::vector<Float_t> *v1 = ev1->GetDataVector();\n std::vector<Float_t> *v2 = ev2->GetDataVector();\n Float_t prod = 0;\n for (UInt_t i = 0; i < v1->size(); i++) prod += (*v1)[i] * (*v2)[i];\n return prod;\n }\n case kSigmoidal:\n {\n std::vector<Float_t> *v1 = ev1->GetDataVector();\n std::vector<Float_t> *v2 = ev2->GetDataVector();\n Float_t prod = 0;\n for (UInt_t i = 0; i < v1->size(); i++) prod += ((*v1)[i] -(*v2)[i]) *((*v1)[i] -(*v2)[i]) ;\n prod *= fKappa;\n prod += fTheta;\n return TMath::TanH( prod );\n }\n }\n return 0;\n}\n\n<commit_msg>From Bertrand: Fix compilation warnings on Windows with MSVC++7.1<commit_after>\/\/ @(#)root\/tmva $Id$ \n\/\/ Author: Andrzej Zemla\n\n\/**********************************************************************************\n * Project: TMVA - a Root-integrated toolkit for multivariate data analysis *\n * Package: TMVA *\n * Class : SVKernelFunction *\n * Web : http:\/\/tmva.sourceforge.net *\n * *\n * Description: *\n * Implementation *\n * *\n * Authors (alphabetical): *\n * Marcin Wolter <Marcin.Wolter@cern.ch> - IFJ PAN, Krakow, Poland *\n * Andrzej Zemla <azemla@cern.ch> - IFJ PAN, Krakow, Poland *\n * (IFJ PAN: Henryk Niewodniczanski Inst. Nucl. Physics, Krakow, Poland) * \n * *\n * Copyright (c) 2005: *\n * CERN, Switzerland * \n * MPI-K Heidelberg, Germany * \n * PAN, Krakow, Poland *\n * *\n * Redistribution and use in source and binary forms, with or without *\n * modification, are permitted according to the terms listed in LICENSE *\n * (http:\/\/tmva.sourceforge.net\/LICENSE) *\n **********************************************************************************\/\n\n#include \"TMVA\/SVKernelFunction.h\"\n#include \"TMVA\/SVEvent.h\"\n#include \"TMath.h\"\n#include <vector>\n\n\/\/_______________________________________________________________________\nTMVA::SVKernelFunction::SVKernelFunction()\n : fGamma(0.),\n fKernel(kRBF), \/\/ kernel, order, theta, and kappa are for backward compatibility\n fOrder(0),\n fTheta(0),\n fKappa(0)\n{\n \/\/ constructor\n}\n\n\/\/_______________________________________________________________________\nTMVA::SVKernelFunction::SVKernelFunction( Float_t gamma )\n : fGamma(gamma),\n fKernel(kRBF), \/\/ kernel, order, theta, and kappa are for backward compatibility\n fOrder(0),\n fTheta(0),\n fKappa(0)\n{\n \/\/ constructor\n}\n\n\/\/_______________________________________________________________________\nTMVA::SVKernelFunction::~SVKernelFunction() \n{\n \/\/ destructor\n}\n\n\/\/_______________________________________________________________________\nvoid TMVA::SVKernelFunction::setCompatibilityParams(EKernelType k, UInt_t order, Float_t theta, Float_t kappa) {\n \/\/ set old options for compatibility mode\n fKernel = k;\n fOrder = order;\n fTheta = theta;\n fKappa = kappa;\n}\n\n\/\/_______________________________________________________________________\nFloat_t TMVA::SVKernelFunction::Evaluate( SVEvent* ev1, SVEvent* ev2 )\n{\n\n switch(fKernel) {\n case kRBF:\n {\n std::vector<Float_t> *v1 = ev1->GetDataVector();\n std::vector<Float_t> *v2 = ev2->GetDataVector();\n \n Float_t norm = 0;\n for (UInt_t i = 0; i < v1->size(); i++) norm += ((*v1)[i] -(*v2)[i]) *((*v1)[i] -(*v2)[i]) ;\n \n return TMath::Exp(-norm*fGamma);\n }\n case kPolynomial:\n {\n std::vector<Float_t> *v1 = ev1->GetDataVector();\n std::vector<Float_t> *v2 = ev2->GetDataVector();\n Float_t prod = fTheta;\n for (UInt_t i = 0; i < v1->size(); i++) prod += (*v1)[i] * (*v2)[i];\n\n Float_t result = 1.;\n Int_t j = fOrder;\n for (; j > 0; j \/= 2) {\n if (j%2) result = prod; \n prod *= prod; \n } \n return result;\n }\n case kLinear:\n {\n std::vector<Float_t> *v1 = ev1->GetDataVector();\n std::vector<Float_t> *v2 = ev2->GetDataVector();\n Float_t prod = 0;\n for (UInt_t i = 0; i < v1->size(); i++) prod += (*v1)[i] * (*v2)[i];\n return prod;\n }\n case kSigmoidal:\n {\n std::vector<Float_t> *v1 = ev1->GetDataVector();\n std::vector<Float_t> *v2 = ev2->GetDataVector();\n Float_t prod = 0;\n for (UInt_t i = 0; i < v1->size(); i++) prod += ((*v1)[i] -(*v2)[i]) *((*v1)[i] -(*v2)[i]) ;\n prod *= fKappa;\n prod += fTheta;\n return TMath::TanH( prod );\n }\n }\n return 0;\n}\n\n<|endoftext|>"} {"text":"<commit_before>#pragma once\r\n\/\/=========================================================================\/\/\r\n\/*! @file\r\n @brief Test TCP Protocol@n\r\n\t\t\tCopyright 2017 Kunihito Hiramatsu\r\n @author 平松邦仁 (hira@rvf-rc45.net)\r\n*\/\r\n\/\/=========================================================================\/\/\r\n#include \"udp.hpp\"\r\n\r\nnamespace net {\r\n\r\n\t\/\/+++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++\/\/\r\n\t\/*!\r\n\t\t@brief Test TCP プロトコル・クラス\r\n\t*\/\r\n\t\/\/+++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++\/\/\r\n\tclass test_tcp {\r\n\r\n\t\tint\t\tdesc_;\r\n\t\tbool\tonetime_;\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\ttest_tcp() : desc_(-1), onetime_(true) { }\r\n\r\n\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\ttemplate <class ETH>\r\n\t\tvoid service(ETH& eth, bool server)\r\n\t\t{\r\n\t\t\tif(!onetime_) return;\r\n\r\n\t\t\tif(desc_ < 0) {\r\n\t\t\t\tauto& ipv4 = eth.at_ipv4();\r\n\t\t\t\tauto& tcp = ipv4.at_tcp();\r\n\t\t\t\tdesc_ = tcp.open(ip_adrs(192,168,3,7), 3000, server);\r\n\t\t\t\tutils::format(\"Test TCP Open: (%d) %s\\n\")\r\n\t\t\t\t\t% desc_ % (server ? \"Server\" : \"Client\");\r\n\t\t\t} else {\r\n\t\t\t\tauto& ipv4 = eth.at_ipv4();\r\n\t\t\t\tauto& tcp = ipv4.at_tcp();\r\n\r\n\t\t\t\tchar tmp[256];\r\n\t\t\t\tint len = tcp.recv(desc_, tmp, sizeof(tmp));\r\n\t\t\t\tif(len > 0) {\r\n\t\t\t\t\ttmp[len] = 0;\r\n\t\t\t\t\tutils::format(\"Test TCP Recv(%d): '%s'\\n\") % len % tmp;\r\n\/\/\/\t\t\t\t\ttcp.send(desc_, tmp, len);\r\n\/\/\/\t\t\t\t\tutils::format(\"Test TCP Send(%d): '%s'\\n\") % len % tmp;\r\n\t\t\t\t\ttcp.close(desc_);\r\n\t\t\t\t\tutils::format(\"Test TCP Close: (%d)\\n\") % desc_;\r\n\t\t\t\t\tdesc_ = -1;\r\n\r\n\/\/\/\t\t\t\t\tonetime_ = false;\r\n\t\t\t\t}\r\n\t\t\t}\r\n\t\t}\r\n\t};\r\n}\r\n<commit_msg>update test code<commit_after>#pragma once\r\n\/\/=========================================================================\/\/\r\n\/*! @file\r\n @brief Test TCP Protocol@n\r\n\t\t\tCopyright 2017 Kunihito Hiramatsu\r\n @author 平松邦仁 (hira@rvf-rc45.net)\r\n*\/\r\n\/\/=========================================================================\/\/\r\n#include \"udp.hpp\"\r\n\r\nnamespace net {\r\n\r\n\t\/\/+++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++\/\/\r\n\t\/*!\r\n\t\t@brief Test TCP プロトコル・クラス\r\n\t*\/\r\n\t\/\/+++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++\/\/\r\n\tclass test_tcp {\r\n\r\n\t\tint\t\tdesc_;\r\n\t\tbool\tonetime_;\r\n\t\tint\t\topen_delay_;\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\ttest_tcp() : desc_(-1), onetime_(true), open_delay_(0) { }\r\n\r\n\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\ttemplate <class ETH>\r\n\t\tvoid service(ETH& eth, bool server)\r\n\t\t{\r\n\t\t\tif(!onetime_) return;\r\n\r\n\t\t\tif(desc_ < 0) {\r\n\t\t\t\tif(open_delay_ > 0) {\r\n\t\t\t\t\topen_delay_--;\r\n\t\t\t\t\treturn;\r\n\t\t\t\t}\r\n\r\n\t\t\t\tauto& ipv4 = eth.at_ipv4();\r\n\t\t\t\tauto& tcp = ipv4.at_tcp();\r\n\t\t\t\tdesc_ = tcp.open(ip_adrs(192,168,3,7), 3000, server);\r\n\t\t\t\tif(desc_ >= 0) {\r\n\t\t\t\t\tutils::format(\"Test TCP Open (%d): %s\\n\")\r\n\t\t\t\t\t\t% desc_ % (server ? \"Server\" : \"Client\");\r\n\t\t\t\t}\r\n\t\t\t} else {\r\n\t\t\t\tauto& ipv4 = eth.at_ipv4();\r\n\t\t\t\tauto& tcp = ipv4.at_tcp();\r\n\r\n\t\t\t\tchar tmp[256];\r\n\t\t\t\tint len = tcp.recv(desc_, tmp, sizeof(tmp));\r\n\t\t\t\tif(len > 0) {\r\n\t\t\t\t\ttmp[len] = 0;\r\n\t\t\t\t\tutils::format(\"Test TCP Recv (%d): '%s', %d\\n\") % desc_ % tmp % len;\r\n\r\n\t\t\t\t\ttcp.send(desc_, tmp, len);\r\n\t\t\t\t\tutils::format(\"Test TCP Send (%d): '%s', %d\\n\") % desc_ % tmp % len;\r\n\r\n\/\/\/\t\t\t\t\ttcp.close(desc_);\r\n\/\/\/\t\t\t\t\tutils::format(\"Test TCP Close (%d)\\n\") % desc_;\r\n\/\/\/\t\t\t\t\tdesc_ = -1;\r\n\r\n\t\t\t\t\tonetime_ = false;\r\n\t\t\t\t\topen_delay_ = 50;\r\n\t\t\t\t}\r\n\t\t\t}\r\n\t\t}\r\n\t};\r\n}\r\n<|endoftext|>"} {"text":"<commit_before>#include <iostream>\n#include <cmath>\n#include <algorithm>\n\nusing namespace std;\n\n#define MAX_PAIR_NUM 1000\n\ntypedef struct Record {\n int pos;\n int pixel;\n} Record;\n\nint pixel_pair[MAX_PAIR_NUM][2];\nint img_width;\n\nRecord result[MAX_PAIR_NUM * 9];\n\nbool cmp(const Record& a, const Record& b);\nint get_pixel_via_pos(int pos, int pair_cnt);\nint encode_pixel(int pos, int pixel_cnt, int pair_cnt);\n\nint main() {\n while (cin >> img_width && img_width > 0) {\n int num, pixel;\n int pair_cnt = 0;\n int pixel_cnt = 0;\n\n int start_pos = 1;\n while (cin >> pixel >> num && num != 0 && pixel != 0) {\n pixel_pair[pair_cnt][0] = pixel;\n pixel_pair[pair_cnt][1] = start_pos;\n\n pixel_cnt += num;\n start_pos += num;\n pair_cnt++;\n }\n\n int idx = 0;\n for (int k = 0; k < pair_cnt; k++) {\n int center = pixel_pair[k][1];\n int row = (center - 1) \/ img_width;\n int col = (center - 1) % img_width;\n \n for (int i = row - 1; i <= row + 1; i++)\n for (int j = col - 1; j <= col + 1; j++) {\n int pos = i * img_width + j + 1;\n if (i < 0 || pos > pixel_cnt || j < 0 || j == img_width)\n continue;\n\n result[idx].pos = pos;\n result[idx].pixel = encode_pixel(pos, pixel_cnt, pair_cnt); \n \n idx++;\n }\n }\n\n sort(result, result + idx, cmp);\n\n \/*\n for (int i = 0; i < idx; i++)\n cout << result[i].pixel << \" \" << result[i].pos << endl;\n *\/\n\n Record prev = result[0];\n if (idx > 1) {\n for (int i = 1; i < idx; i++) {\n if (prev.pixel != result[i].pixel) {\n cout << prev.pixel << \" \" << result[i].pos - prev.pos << endl;\n prev = result[i];\n }\n }\n\n cout << result[idx - 1].pixel << \" \" << pixel_cnt - prev.pos + 1 << endl;\n }\n else\n cout << prev.pixel << \" \" << prev.pos << endl;\n\n cout << \"0 0\" << endl;\n\n \/*\n for (int i = 0; i < pair_cnt; i++)\n cout << pixel_pair[i][0] << \" \" << pixel_pair[i][1] << endl;\n\n cout << pixel_cnt << endl;\n *\/\n }\n\n cout << 0 << endl;\n}\n\nbool cmp(const Record& a, const Record& b) {\n return a.pos < b.pos;\n}\n\nint get_pixel_via_pos(int pos, int pair_cnt) {\n if (pair_cnt == 1)\n return pixel_pair[0][0];\n\n int prev = pixel_pair[0][1];\n for (int i = 1; i < pair_cnt; i++) {\n if (pos >= prev && pos < pixel_pair[i][1])\n return pixel_pair[i - 1][0];\n }\n\n return pixel_pair[pair_cnt - 1][0];\n}\n\nint encode_pixel(int pos, int pixel_cnt, int pair_cnt) {\n int row = (pos - 1) \/ img_width;\n int col = (pos - 1) % img_width;\n\n int ret = 0;\n int tmp = 0;\n for (int i = row - 1; i <= row + 1; i++)\n for (int j = col - 1; j <= col + 1; j++) {\n int curr = i * img_width + j + 1;\n\n if (i < 0 || curr > pixel_cnt || j == img_width || j < 0 \n || curr == pos)\n continue;\n\n tmp = abs(get_pixel_via_pos(pos, pair_cnt) \n - get_pixel_via_pos(curr, pair_cnt));\n\n if (tmp > ret)\n ret = tmp;\n }\n\n return ret;\n}\n<commit_msg>WA for p1009b<commit_after>#include <iostream>\n#include <cmath>\n#include <algorithm>\n\nusing namespace std;\n\n#define MAX_PAIR_NUM 1000\n\ntypedef struct Record {\n int pos;\n int pixel;\n} Record;\n\nint pixel_pair[MAX_PAIR_NUM][2];\nint img_width;\n\nRecord result[MAX_PAIR_NUM * 9];\n\nbool cmp(const Record& a, const Record& b);\nint get_pixel_via_pos(int pos, int pair_cnt);\nint encode_pixel(int pos, int pixel_cnt, int pair_cnt);\n\nint main() {\n while (cin >> img_width && img_width > 0) {\n cout << img_width << endl;\n int num, pixel;\n int pair_cnt = 0;\n int pixel_cnt = 0;\n\n int start_pos = 1;\n while (cin >> pixel >> num && num != 0 && pixel != 0) {\n pixel_pair[pair_cnt][0] = pixel;\n pixel_pair[pair_cnt][1] = start_pos;\n\n pixel_cnt += num;\n start_pos += num;\n pair_cnt++;\n }\n\n int idx = 0;\n for (int k = 0; k < pair_cnt; k++) {\n int center = pixel_pair[k][1];\n int row = (center - 1) \/ img_width;\n int col = (center - 1) % img_width;\n \n for (int i = row - 1; i <= row + 1; i++)\n for (int j = col - 1; j <= col + 1; j++) {\n int pos = i * img_width + j + 1;\n if (i < 0 || pos > pixel_cnt || j < 0 || j == img_width)\n continue;\n\n result[idx].pos = pos;\n result[idx].pixel = encode_pixel(pos, pixel_cnt, pair_cnt); \n \n idx++;\n }\n }\n\n sort(result, result + idx, cmp);\n\n \/*\n for (int i = 0; i < idx; i++)\n cout << result[i].pixel << \" \" << result[i].pos << endl;\n *\/\n\n Record prev = result[0];\n if (idx > 1) {\n for (int i = 1; i < idx; i++) {\n if (prev.pixel != result[i].pixel) {\n cout << prev.pixel << \" \" << result[i].pos - prev.pos << endl;\n prev = result[i];\n }\n }\n\n cout << result[idx - 1].pixel << \" \" << pixel_cnt - prev.pos + 1 << endl;\n }\n else\n cout << prev.pixel << \" \" << prev.pos << endl;\n\n cout << \"0 0\" << endl;\n\n \/*\n for (int i = 0; i < pair_cnt; i++)\n cout << pixel_pair[i][0] << \" \" << pixel_pair[i][1] << endl;\n\n cout << pixel_cnt << endl;\n *\/\n }\n\n cout << 0 << endl;\n}\n\nbool cmp(const Record& a, const Record& b) {\n return a.pos < b.pos;\n}\n\nint get_pixel_via_pos(int pos, int pair_cnt) {\n if (pair_cnt == 1)\n return pixel_pair[0][0];\n\n int prev = pixel_pair[0][1];\n for (int i = 1; i < pair_cnt; i++) {\n if (pos >= prev && pos < pixel_pair[i][1])\n return pixel_pair[i - 1][0];\n }\n\n return pixel_pair[pair_cnt - 1][0];\n}\n\nint encode_pixel(int pos, int pixel_cnt, int pair_cnt) {\n int row = (pos - 1) \/ img_width;\n int col = (pos - 1) % img_width;\n\n int ret = 0;\n int tmp = 0;\n for (int i = row - 1; i <= row + 1; i++)\n for (int j = col - 1; j <= col + 1; j++) {\n int curr = i * img_width + j + 1;\n\n if (i < 0 || curr > pixel_cnt || j == img_width || j < 0 \n || curr == pos)\n continue;\n\n tmp = abs(get_pixel_via_pos(pos, pair_cnt) \n - get_pixel_via_pos(curr, pair_cnt));\n\n if (tmp > ret)\n ret = tmp;\n }\n\n return ret;\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\n\/\/ Blueberry\n#include <berryISelectionService.h>\n#include <berryIWorkbenchWindow.h>\n\n\/\/ Qmitk\n#include \"QmitkLaserControl.h\"\n\n\/\/ Qt\n#include <QMessageBox>\n\n\/\/mitk\n#include <mitkPumpLaserController.h>\n\nconst std::string OPOLaserControl::VIEW_ID = \"org.mitk.views.opolasercontrol\";\n\nvoid OPOLaserControl::SetFocus()\n{\n m_Controls.buttonConnect->setFocus();\n}\n\nvoid OPOLaserControl::CreateQtPartControl( QWidget *parent )\n{\n \/\/ create GUI widgets from the Qt Designer's .ui file\n m_Controls.setupUi( parent );\n connect( m_Controls.buttonConnect, SIGNAL(clicked()), this, SLOT(ConnectToLaser()) );\n connect( m_Controls.buttonStatus, SIGNAL(clicked()), this, SLOT(GetStatus()) );\n connect( m_Controls.buttonSendCustomMessage, SIGNAL(clicked()), this, SLOT(SendCustomMessage()) );\n\n connect(m_Controls.buttonInitLaser, SIGNAL(clicked()), this, SLOT(InitLaser()));\n connect(m_Controls.buttonTune, SIGNAL(clicked()), this, SLOT(TuneWavelength()));\n connect(m_Controls.buttonFlashlamp, SIGNAL(clicked()), this, SLOT(ToggleFlashlamp()));\n connect(m_Controls.buttonQSwitch, SIGNAL(clicked()), this, SLOT(ToggleQSwitch()));\n\n connect(m_Controls.sliderWavelength, SIGNAL(valueChanged(int)), this, SLOT(SyncWavelengthSetBySlider()));\n connect(m_Controls.spinBoxWavelength, SIGNAL(valueChanged(double)), this, SLOT(SyncWavelengthSetBySpinBox()));\n\n m_SyncFromSpinBox = true;\n m_SyncFromSlider = true;\n\n m_LaserSystemConnected = false;\n\n}\nvoid OPOLaserControl::SyncWavelengthSetBySlider()\n{\n if (m_SyncFromSlider)\n {\n m_SyncFromSpinBox = false;\n m_Controls.spinBoxWavelength->setValue(m_Controls.sliderWavelength->value() \/ 10);\n }\n else\n m_SyncFromSlider = true;\n\n}\n\nvoid OPOLaserControl::SyncWavelengthSetBySpinBox()\n{\n if (m_SyncFromSpinBox)\n {\n m_SyncFromSlider = false;\n m_Controls.sliderWavelength->setValue(m_Controls.spinBoxWavelength->value() * 10);\n }\n else\n m_SyncFromSpinBox = true;\n}\n\nvoid OPOLaserControl::InitLaser()\n{\n if (!m_LaserSystemConnected)\n {\n m_OpotekLaserSystem = mitk::OpotekLaser::New();\n m_OpotekLaserSystem->SetConfigurationPath(\"opotek_15033_SN3401_1905_1906_20160330.ini\");\n\n if (m_OpotekLaserSystem->Initialize())\n {\n m_Controls.buttonFlashlamp->setEnabled(true);\n m_Controls.buttonQSwitch->setEnabled(true);\n m_Controls.buttonTune->setEnabled(true);\n m_Controls.buttonInitLaser->setText(\"Reset and Release Laser\");\n\n m_Controls.sliderWavelength->setMinimum(m_OpotekLaserSystem->GetMinWavelength());\n m_Controls.sliderWavelength->setMaximum(m_OpotekLaserSystem->GetMaxWavelength());\n m_Controls.spinBoxWavelength->setMinimum(m_OpotekLaserSystem->GetMinWavelength() \/ 10.0);\n m_Controls.spinBoxWavelength->setMaximum(m_OpotekLaserSystem->GetMaxWavelength() \/ 10.0);\n m_Controls.sliderWavelength->setValue(m_OpotekLaserSystem->GetWavelength());\n m_Controls.spinBoxWavelength->setValue(m_OpotekLaserSystem->GetWavelength() \/ 10.0);\n }\n else\n {\n MITK_ERROR << \"OpotekLaser Initialization failed.\";\n }\n }\n else\n {\n \/\/ destroy and free\n m_Controls.buttonFlashlamp->setEnabled(false);\n m_Controls.buttonQSwitch->setEnabled(false);\n m_Controls.buttonTune->setEnabled(false);\n m_Controls.buttonInitLaser->setText(\"Init Laser\");\n }\n}\n\nvoid OPOLaserControl::TuneWavelength()\n{\n m_OpotekLaserSystem->TuneToWavelength(m_Controls.sliderWavelength->value());\n QString wavelengthText = QString::number(m_OpotekLaserSystem->GetWavelength() \/ 10);\n wavelengthText.append(\"nm\");\n m_Controls.labelWavelength->setText(wavelengthText);\n}\n\nvoid OPOLaserControl::ToggleFlashlamp()\n{\n if(!m_OpotekLaserSystem->IsFlashing())\n m_OpotekLaserSystem->StartFlashing();\n else\n m_OpotekLaserSystem->StopFlashing();\n}\n\nvoid OPOLaserControl::ToggleQSwitch()\n{\n if (!m_OpotekLaserSystem->IsEmitting())\n m_OpotekLaserSystem->StartQswitching();\n else\n m_OpotekLaserSystem->StopQswitching();\n}\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\nvoid OPOLaserControl::OnSelectionChanged( berry::IWorkbenchPart::Pointer \/*source*\/,\n const QList<mitk::DataNode::Pointer>& nodes )\n{\n\n}\n\n\nvoid OPOLaserControl::ConnectToLaser()\n{\n \n m_PumpLaserController = mitk::PumpLaserController::New();\n if (m_PumpLaserController->OpenConnection())\n {\n m_Controls.buttonSendCustomMessage->setEnabled(true);\n m_Controls.buttonStatus->setEnabled(true);\n m_Controls.buttonConnect->setText(\"Disconnect\");\n std::string message(\"TRIG EE\"); \/\/ both external Triggers\n std::string response(\"\");\n\n m_PumpLaserController->Send(&message);\n m_PumpLaserController->ReceiveLine(&response);\n \n\n \/\/\/\/get port\n \/\/int port = 0;\n \/\/port = m_Controls.spinBoxPort->value();\n\n \/\/\/\/build prefix (depends on linux\/win)\n \/\/QString prefix = \"\";\n \/\/#ifdef WIN32\n \/\/ prefix = \"COM\";\n \/\/ m_serial->SetPortNumber(static_cast<mitk::SerialCommunication::PortNumber>(port)); \/\/also set the com port for compatibility\n \/\/#else\n \/\/ prefix = m_Controls.comboBoxPortType->currentText();\n \/\/#endif\n\n \/\/QString portName = prefix + QString::number(port);\n \/\/m_serial->SetDeviceName(portName.toStdString());\n\n \/\/ FIXME Unclear specs\n \/\/ • Half duplex\n \/\/ • Does not use Xon\/Xoff\n \/\/ • Does not use RTS\/CTS\n \/\/ FIXME \n }\n else\n {\n m_PumpLaserController->CloseConnection();\n m_Controls.buttonSendCustomMessage->setEnabled(false);\n m_Controls.buttonStatus->setEnabled(false);\n m_Controls.buttonConnect->setText(\"Connect\");\n }\n}\n\nvoid OPOLaserControl::GetStatus()\n{\n mitk::PumpLaserController::PumpLaserState pumpLaserState = m_PumpLaserController->GetState();\n\n if (pumpLaserState == mitk::PumpLaserController::STATE0)\n MITK_INFO << \"Received STATE0: Boot Fault.\";\n else if (pumpLaserState == mitk::PumpLaserController::STATE1)\n MITK_INFO << \"Received STATE1: Warm Up.\";\n else if (pumpLaserState == mitk::PumpLaserController::STATE2)\n MITK_INFO << \"Received STATE2: Laser Ready.\";\n else if (pumpLaserState == mitk::PumpLaserController::STATE3)\n MITK_INFO << \"Received STATE3: Flashing. Pulse Disabled.\";\n else if (pumpLaserState == mitk::PumpLaserController::STATE4)\n MITK_INFO << \"Received STATE4: Flashing. Shutter Closed.\";\n else if (pumpLaserState == mitk::PumpLaserController::STATE5)\n MITK_INFO << \"Received STATE5: Flashing. Pulse Enabled.\";\n else if (pumpLaserState == mitk::PumpLaserController::UNCONNECTED)\n MITK_INFO << \"Received ERROR.\";\n}\n\nvoid OPOLaserControl::SendCustomMessage()\n{\n std::string message = m_Controls.lineMessage->text().toStdString();\n std::string response(\"\");\n\n m_PumpLaserController->Send(&message);\n m_PumpLaserController->ReceiveLine(&response);\n \n MITK_INFO << \"Received response: \" << response;\n}\n\nvoid OPOLaserControl::ToogleFlashlamp()\n{\n m_PumpLaserController->StartFlashlamps();\n MITK_INFO << \"Received response: \";\n\n}<commit_msg>Mostly cosmetics.<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\/\/ Blueberry\n#include <berryISelectionService.h>\n#include <berryIWorkbenchWindow.h>\n\n\/\/ Qmitk\n#include \"QmitkLaserControl.h\"\n\n\/\/ Qt\n#include <QMessageBox>\n\n\/\/mitk\n#include <mitkPumpLaserController.h>\n\nconst std::string OPOLaserControl::VIEW_ID = \"org.mitk.views.opolasercontrol\";\n\nvoid OPOLaserControl::SetFocus()\n{\n m_Controls.buttonConnect->setFocus();\n}\n\nvoid OPOLaserControl::CreateQtPartControl(QWidget *parent)\n{\n \/\/ create GUI widgets from the Qt Designer's .ui file\n m_Controls.setupUi(parent);\n connect(m_Controls.buttonConnect, SIGNAL(clicked()), this, SLOT(ConnectToLaser()));\n connect(m_Controls.buttonStatus, SIGNAL(clicked()), this, SLOT(GetStatus()));\n connect(m_Controls.buttonSendCustomMessage, SIGNAL(clicked()), this, SLOT(SendCustomMessage()));\n\n connect(m_Controls.buttonInitLaser, SIGNAL(clicked()), this, SLOT(InitLaser()));\n connect(m_Controls.buttonTune, SIGNAL(clicked()), this, SLOT(TuneWavelength()));\n connect(m_Controls.buttonFlashlamp, SIGNAL(clicked()), this, SLOT(ToggleFlashlamp()));\n connect(m_Controls.buttonQSwitch, SIGNAL(clicked()), this, SLOT(ToggleQSwitch()));\n\n connect(m_Controls.sliderWavelength, SIGNAL(valueChanged(int)), this, SLOT(SyncWavelengthSetBySlider()));\n connect(m_Controls.spinBoxWavelength, SIGNAL(valueChanged(double)), this, SLOT(SyncWavelengthSetBySpinBox()));\n\n m_SyncFromSpinBox = true;\n m_SyncFromSlider = true;\n\n m_LaserSystemConnected = false;\n}\nvoid OPOLaserControl::SyncWavelengthSetBySlider()\n{\n if (m_SyncFromSlider)\n {\n m_SyncFromSpinBox = false;\n m_Controls.spinBoxWavelength->setValue(m_Controls.sliderWavelength->value() \/ 10);\n }\n else\n m_SyncFromSlider = true;\n}\n\nvoid OPOLaserControl::SyncWavelengthSetBySpinBox()\n{\n if (m_SyncFromSpinBox)\n {\n m_SyncFromSlider = false;\n m_Controls.sliderWavelength->setValue(m_Controls.spinBoxWavelength->value() * 10);\n }\n else\n m_SyncFromSpinBox = true;\n}\n\nvoid OPOLaserControl::InitLaser()\n{\n m_Controls.buttonInitLaser->setText(\"working ...\");\n if (!m_LaserSystemConnected)\n {\n m_OpotekLaserSystem = mitk::OpotekLaser::New();\n m_OpotekLaserSystem->SetConfigurationPath(\"opotek_15033_SN3401_1905_1906_20160330.ini\");\n\n if (m_OpotekLaserSystem->Initialize())\n {\n m_Controls.buttonFlashlamp->setEnabled(true);\n m_Controls.buttonQSwitch->setEnabled(true);\n m_Controls.buttonTune->setEnabled(true);\n m_Controls.buttonInitLaser->setText(\"Reset and Release Laser\");\n\n m_Controls.sliderWavelength->setMinimum(m_OpotekLaserSystem->GetMinWavelength());\n m_Controls.sliderWavelength->setMaximum(m_OpotekLaserSystem->GetMaxWavelength());\n m_Controls.spinBoxWavelength->setMinimum(m_OpotekLaserSystem->GetMinWavelength() \/ 10.0);\n m_Controls.spinBoxWavelength->setMaximum(m_OpotekLaserSystem->GetMaxWavelength() \/ 10.0);\n m_Controls.sliderWavelength->setValue(m_OpotekLaserSystem->GetWavelength());\n m_Controls.spinBoxWavelength->setValue(m_OpotekLaserSystem->GetWavelength() \/ 10.0);\n m_LaserSystemConnected = true;\n }\n else\n {\n MITK_ERROR << \"OpotekLaser Initialization failed.\";\n }\n }\n else\n {\n \/\/ destroy and free\n if (m_OpotekLaserSystem->ResetAndRelease())\n {\n m_Controls.buttonFlashlamp->setEnabled(false);\n m_Controls.buttonQSwitch->setEnabled(false);\n m_Controls.buttonTune->setEnabled(false);\n m_Controls.buttonInitLaser->setText(\"Init Laser\");\n m_LaserSystemConnected = false;\n }\n else\n {\n MITK_ERROR << \"OpotekLaser release failed.\";\n }\n }\n}\n\nvoid OPOLaserControl::TuneWavelength()\n{\n m_OpotekLaserSystem->TuneToWavelength(m_Controls.spinBoxFIXME->value());\n QString wavelengthText = QString::number(m_OpotekLaserSystem->GetWavelength() \/ 10);\n wavelengthText.append(\"nm\");\n m_Controls.labelWavelength->setText(wavelengthText);\n}\n\nvoid OPOLaserControl::ToggleFlashlamp()\n{\n m_Controls.buttonFlashlamp->setText(\"...\");\n if (!m_OpotekLaserSystem->IsFlashing())\n {\n m_OpotekLaserSystem->StartFlashing();\n m_Controls.buttonFlashlamp->setText(\"Stop Lamp\");\n }\n else\n {\n m_OpotekLaserSystem->StopFlashing();\n m_Controls.buttonFlashlamp->setText(\"Start Lamp\");\n }\n}\n\nvoid OPOLaserControl::ToggleQSwitch()\n{\n m_Controls.buttonQSwitch->setText(\"...\");\n if (!m_OpotekLaserSystem->IsEmitting())\n {\n m_OpotekLaserSystem->StartQswitching();\n m_Controls.buttonQSwitch->setText(\"Stop Laser\");\n }\n else\n {\n m_OpotekLaserSystem->StopQswitching();\n m_Controls.buttonQSwitch->setText(\"Start Laser\");\n }\n}\n\nvoid OPOLaserControl::OnSelectionChanged(berry::IWorkbenchPart::Pointer \/*source*\/,\n const QList<mitk::DataNode::Pointer>& nodes)\n{\n}\n\nvoid OPOLaserControl::ConnectToLaser()\n{\n m_PumpLaserController = mitk::PumpLaserController::New();\n if (m_PumpLaserController->OpenConnection())\n {\n m_Controls.buttonSendCustomMessage->setEnabled(true);\n m_Controls.buttonStatus->setEnabled(true);\n m_Controls.buttonConnect->setText(\"Disconnect\");\n std::string message(\"TRIG EE\"); \/\/ both external Triggers\n std::string response(\"\");\n\n m_PumpLaserController->Send(&message);\n m_PumpLaserController->ReceiveLine(&response);\n\n \/\/\/\/get port\n \/\/int port = 0;\n \/\/port = m_Controls.spinBoxPort->value();\n\n \/\/\/\/build prefix (depends on linux\/win)\n \/\/QString prefix = \"\";\n \/\/#ifdef WIN32\n \/\/ prefix = \"COM\";\n \/\/ m_serial->SetPortNumber(static_cast<mitk::SerialCommunication::PortNumber>(port)); \/\/also set the com port for compatibility\n \/\/#else\n \/\/ prefix = m_Controls.comboBoxPortType->currentText();\n \/\/#endif\n\n \/\/QString portName = prefix + QString::number(port);\n \/\/m_serial->SetDeviceName(portName.toStdString());\n\n \/\/ FIXME Unclear specs\n \/\/ • Half duplex\n \/\/ • Does not use Xon\/Xoff\n \/\/ • Does not use RTS\/CTS\n \/\/ FIXME\n }\n else\n {\n m_PumpLaserController->CloseConnection();\n m_Controls.buttonSendCustomMessage->setEnabled(false);\n m_Controls.buttonStatus->setEnabled(false);\n m_Controls.buttonConnect->setText(\"Connect\");\n }\n}\n\nvoid OPOLaserControl::GetStatus()\n{\n mitk::PumpLaserController::PumpLaserState pumpLaserState = m_PumpLaserController->GetState();\n\n if (pumpLaserState == mitk::PumpLaserController::STATE0)\n MITK_INFO << \"Received STATE0: Boot Fault.\";\n else if (pumpLaserState == mitk::PumpLaserController::STATE1)\n MITK_INFO << \"Received STATE1: Warm Up.\";\n else if (pumpLaserState == mitk::PumpLaserController::STATE2)\n MITK_INFO << \"Received STATE2: Laser Ready.\";\n else if (pumpLaserState == mitk::PumpLaserController::STATE3)\n MITK_INFO << \"Received STATE3: Flashing. Pulse Disabled.\";\n else if (pumpLaserState == mitk::PumpLaserController::STATE4)\n MITK_INFO << \"Received STATE4: Flashing. Shutter Closed.\";\n else if (pumpLaserState == mitk::PumpLaserController::STATE5)\n MITK_INFO << \"Received STATE5: Flashing. Pulse Enabled.\";\n else if (pumpLaserState == mitk::PumpLaserController::UNCONNECTED)\n MITK_INFO << \"Received ERROR.\";\n}\n\nvoid OPOLaserControl::SendCustomMessage()\n{\n std::string message = m_Controls.lineMessage->text().toStdString();\n std::string response(\"\");\n\n m_PumpLaserController->Send(&message);\n m_PumpLaserController->ReceiveLine(&response);\n\n MITK_INFO << \"Received response: \" << response;\n}\n\nvoid OPOLaserControl::ToogleFlashlamp()\n{\n m_PumpLaserController->StartFlashlamps();\n MITK_INFO << \"Received response: \";\n}<|endoftext|>"} {"text":"<commit_before>#include \"mitkClippedSurfaceBoundsCalculator.h\"\n#include \"vtkPolyData.h\"\n#include \"vtkPlaneSource.h\"\n#include \"vtkPPolyDataNormals.h\"\n#include \"mitkGeometry2D.h\"\n#include \"mitkSliceNavigationController.h\"\n#include \"mitkLine.h\"\n#include \"vtkSmartPointer.h\"\n\n#define ROUND_P(x) ((int)((x)+0.5))\n\nmitk::ClippedSurfaceBoundsCalculator::ClippedSurfaceBoundsCalculator(const mitk::PlaneGeometry* geometry, mitk::Image::Pointer image)\n{\n this->SetInput(geometry, image);\n}\n\nmitk::ClippedSurfaceBoundsCalculator::~ClippedSurfaceBoundsCalculator()\n{\n}\n\nvoid mitk::ClippedSurfaceBoundsCalculator::SetInput(const mitk::PlaneGeometry* geometry, mitk::Image::Pointer image)\n{\n if(geometry != NULL && image.IsNotNull())\n {\n this->m_Geometry2D = geometry;\n this->m_Image = image;\n for(int i = 0; i < 3; i++)\n {\n this->m_MinMaxOutput.push_back(outputType( std::numeric_limits<int>::max() , std::numeric_limits<int>::min() ));\n }\n }\n}\n\nvoid mitk::ClippedSurfaceBoundsCalculator::CalculateSurfaceBounds()\n{\n\n \/\/Get the corner points of the geometry3D\n CalculateSurfaceBounds( m_Image->GetGeometry()->GetCornerPoint(false, false, false)\n , m_Image->GetGeometry()->GetCornerPoint(true, false, false));\n\n CalculateSurfaceBounds( m_Image->GetGeometry()->GetCornerPoint(false, false, false)\n , m_Image->GetGeometry()->GetCornerPoint(false, true, false));\n\n CalculateSurfaceBounds( m_Image->GetGeometry()->GetCornerPoint(false, false, false)\n , m_Image->GetGeometry()->GetCornerPoint(false, false, true));\n\n CalculateSurfaceBounds( m_Image->GetGeometry()->GetCornerPoint(false, true, false)\n , m_Image->GetGeometry()->GetCornerPoint(true, true, false));\n\n CalculateSurfaceBounds( m_Image->GetGeometry()->GetCornerPoint(false, true, false)\n , m_Image->GetGeometry()->GetCornerPoint(false, true, true));\n\n CalculateSurfaceBounds( m_Image->GetGeometry()->GetCornerPoint(false, false, true)\n , m_Image->GetGeometry()->GetCornerPoint(true, false, true));\n\n CalculateSurfaceBounds( m_Image->GetGeometry()->GetCornerPoint(false, false, true)\n , m_Image->GetGeometry()->GetCornerPoint(false, true, true));\n\n CalculateSurfaceBounds( m_Image->GetGeometry()->GetCornerPoint(false, true, true)\n , m_Image->GetGeometry()->GetCornerPoint(true, true, true));\n\n CalculateSurfaceBounds( m_Image->GetGeometry()->GetCornerPoint(true, false, true)\n , m_Image->GetGeometry()->GetCornerPoint(true, true, true));\n\n CalculateSurfaceBounds( m_Image->GetGeometry()->GetCornerPoint(true, false, false)\n , m_Image->GetGeometry()->GetCornerPoint(true, false, true));\n\n CalculateSurfaceBounds( m_Image->GetGeometry()->GetCornerPoint(true, false, false)\n , m_Image->GetGeometry()->GetCornerPoint(true, true, false));\n\n CalculateSurfaceBounds( m_Image->GetGeometry()->GetCornerPoint(true, true, false)\n , m_Image->GetGeometry()->GetCornerPoint(true, true, true));\n}\n\nvoid mitk::ClippedSurfaceBoundsCalculator::CalculateSurfaceBounds(Point3D startPoint, Point3D endPoint)\n{\n if(this->GetIntersectionPoint(startPoint, endPoint) != NULL)\n {\n mitk::Point3D* point3D = this->GetIntersectionPoint(startPoint, endPoint);\n mitk::Point3D indexPoint3D;\n m_Image->GetGeometry()->WorldToIndex(*point3D, indexPoint3D);\n\n for(int dim = 0; dim < 3; dim++)\n {\n \/\/ minimum\n if(this->m_MinMaxOutput[dim].first > ROUND_P(indexPoint3D[dim]))\n {\n this->m_MinMaxOutput[dim].first = ROUND_P(indexPoint3D[dim]);\n }\n\n \/\/ maximum\n if(this->m_MinMaxOutput[dim].second < ROUND_P(indexPoint3D[dim]))\n {\n this->m_MinMaxOutput[dim].second = ROUND_P(indexPoint3D[dim]);\n }\n }\n delete point3D;\n }\n\n\/\/ }\n}\n\nmitk::Point3D* mitk::ClippedSurfaceBoundsCalculator::GetIntersectionPoint(Point3D startPoint, Point3D endPoint)\n{\n Point3D* intersectionPoint = new Point3D();\n vtkSmartPointer<vtkPoints> points = vtkPoints::New();\n points->SetNumberOfPoints(1);\n\n endPoint[0] =- startPoint[0];\n endPoint[1] =- startPoint[1];\n endPoint[2] =- startPoint[2];\n\n Vector3D bottomVec;\n\n FillVector3D(bottomVec, endPoint[0], endPoint[1], endPoint[2]);\n\n mitk::Line3D line(startPoint, bottomVec);\n\n m_Geometry2D->IntersectionPoint(line, *intersectionPoint);\n\n if(m_Geometry2D->IsOnPlane(*intersectionPoint))\n {\n return intersectionPoint;\n }\n else\n {\n return NULL;\n }\n}\n\nmitk::ClippedSurfaceBoundsCalculator::outputType mitk::ClippedSurfaceBoundsCalculator::GetMinMaxSpatialDirectionX()\n{\n return this->m_MinMaxOutput[0];\n}\n\nmitk::ClippedSurfaceBoundsCalculator::outputType mitk::ClippedSurfaceBoundsCalculator::GetMinMaxSpatialDirectionY()\n{\n return this->m_MinMaxOutput[1];\n}\n\nmitk::ClippedSurfaceBoundsCalculator::outputType mitk::ClippedSurfaceBoundsCalculator::GetMinMaxSpatialDirectionZ()\n{\n return this->m_MinMaxOutput[2];\n}\n\nvoid mitk::ClippedSurfaceBoundsCalculator::Update()\n{\n this->CalculateSurfaceBounds();\n}\n<commit_msg>fix: map needs to be cleared when new input is given<commit_after>#include \"mitkClippedSurfaceBoundsCalculator.h\"\n#include \"vtkPolyData.h\"\n#include \"vtkPlaneSource.h\"\n#include \"vtkPPolyDataNormals.h\"\n#include \"mitkGeometry2D.h\"\n#include \"mitkSliceNavigationController.h\"\n#include \"mitkLine.h\"\n#include \"vtkSmartPointer.h\"\n\n#define ROUND_P(x) ((int)((x)+0.5))\n\nmitk::ClippedSurfaceBoundsCalculator::ClippedSurfaceBoundsCalculator(const mitk::PlaneGeometry* geometry, mitk::Image::Pointer image)\n{\n this->SetInput(geometry, image);\n}\n\nmitk::ClippedSurfaceBoundsCalculator::~ClippedSurfaceBoundsCalculator()\n{\n}\n\nvoid mitk::ClippedSurfaceBoundsCalculator::SetInput(const mitk::PlaneGeometry* geometry, mitk::Image::Pointer image)\n{\n if(geometry != NULL && image.IsNotNull())\n {\n this->m_Geometry2D = geometry;\n this->m_Image = image;\n this->m_MinMaxOutput.clear();\n for(int i = 0; i < 3; i++)\n {\n this->m_MinMaxOutput.push_back(outputType( std::numeric_limits<int>::max() , std::numeric_limits<int>::min() ));\n }\n }\n}\n\nvoid mitk::ClippedSurfaceBoundsCalculator::CalculateSurfaceBounds()\n{\n\n \/\/Get the corner points of the geometry3D\n CalculateSurfaceBounds( m_Image->GetGeometry()->GetCornerPoint(false, false, false)\n , m_Image->GetGeometry()->GetCornerPoint(true, false, false));\n\n CalculateSurfaceBounds( m_Image->GetGeometry()->GetCornerPoint(false, false, false)\n , m_Image->GetGeometry()->GetCornerPoint(false, true, false));\n\n CalculateSurfaceBounds( m_Image->GetGeometry()->GetCornerPoint(false, false, false)\n , m_Image->GetGeometry()->GetCornerPoint(false, false, true));\n\n CalculateSurfaceBounds( m_Image->GetGeometry()->GetCornerPoint(false, true, false)\n , m_Image->GetGeometry()->GetCornerPoint(true, true, false));\n\n CalculateSurfaceBounds( m_Image->GetGeometry()->GetCornerPoint(false, true, false)\n , m_Image->GetGeometry()->GetCornerPoint(false, true, true));\n\n CalculateSurfaceBounds( m_Image->GetGeometry()->GetCornerPoint(false, false, true)\n , m_Image->GetGeometry()->GetCornerPoint(true, false, true));\n\n CalculateSurfaceBounds( m_Image->GetGeometry()->GetCornerPoint(false, false, true)\n , m_Image->GetGeometry()->GetCornerPoint(false, true, true));\n\n CalculateSurfaceBounds( m_Image->GetGeometry()->GetCornerPoint(false, true, true)\n , m_Image->GetGeometry()->GetCornerPoint(true, true, true));\n\n CalculateSurfaceBounds( m_Image->GetGeometry()->GetCornerPoint(true, false, true)\n , m_Image->GetGeometry()->GetCornerPoint(true, true, true));\n\n CalculateSurfaceBounds( m_Image->GetGeometry()->GetCornerPoint(true, false, false)\n , m_Image->GetGeometry()->GetCornerPoint(true, false, true));\n\n CalculateSurfaceBounds( m_Image->GetGeometry()->GetCornerPoint(true, false, false)\n , m_Image->GetGeometry()->GetCornerPoint(true, true, false));\n\n CalculateSurfaceBounds( m_Image->GetGeometry()->GetCornerPoint(true, true, false)\n , m_Image->GetGeometry()->GetCornerPoint(true, true, true));\n}\n\nvoid mitk::ClippedSurfaceBoundsCalculator::CalculateSurfaceBounds(Point3D startPoint, Point3D endPoint)\n{\n if(this->GetIntersectionPoint(startPoint, endPoint) != NULL)\n {\n mitk::Point3D* point3D = this->GetIntersectionPoint(startPoint, endPoint);\n mitk::Point3D indexPoint3D;\n m_Image->GetGeometry()->WorldToIndex(*point3D, indexPoint3D);\n\n for(int dim = 0; dim < 3; dim++)\n {\n \/\/ minimum\n if(this->m_MinMaxOutput[dim].first > ROUND_P(indexPoint3D[dim]))\n {\n this->m_MinMaxOutput[dim].first = ROUND_P(indexPoint3D[dim]);\n }\n\n \/\/ maximum\n if(this->m_MinMaxOutput[dim].second < ROUND_P(indexPoint3D[dim]))\n {\n this->m_MinMaxOutput[dim].second = ROUND_P(indexPoint3D[dim]);\n }\n }\n delete point3D;\n }\n\n\/\/ }\n}\n\nmitk::Point3D* mitk::ClippedSurfaceBoundsCalculator::GetIntersectionPoint(Point3D startPoint, Point3D endPoint)\n{\n Point3D* intersectionPoint = new Point3D();\n vtkSmartPointer<vtkPoints> points = vtkPoints::New();\n points->SetNumberOfPoints(1);\n\n endPoint[0] =- startPoint[0];\n endPoint[1] =- startPoint[1];\n endPoint[2] =- startPoint[2];\n\n Vector3D bottomVec;\n\n FillVector3D(bottomVec, endPoint[0], endPoint[1], endPoint[2]);\n\n mitk::Line3D line(startPoint, bottomVec);\n\n m_Geometry2D->IntersectionPoint(line, *intersectionPoint);\n\n if(m_Geometry2D->IsOnPlane(*intersectionPoint))\n {\n return intersectionPoint;\n }\n else\n {\n return NULL;\n }\n}\n\nmitk::ClippedSurfaceBoundsCalculator::outputType mitk::ClippedSurfaceBoundsCalculator::GetMinMaxSpatialDirectionX()\n{\n return this->m_MinMaxOutput[0];\n}\n\nmitk::ClippedSurfaceBoundsCalculator::outputType mitk::ClippedSurfaceBoundsCalculator::GetMinMaxSpatialDirectionY()\n{\n return this->m_MinMaxOutput[1];\n}\n\nmitk::ClippedSurfaceBoundsCalculator::outputType mitk::ClippedSurfaceBoundsCalculator::GetMinMaxSpatialDirectionZ()\n{\n return this->m_MinMaxOutput[2];\n}\n\nvoid mitk::ClippedSurfaceBoundsCalculator::Update()\n{\n this->CalculateSurfaceBounds();\n}\n<|endoftext|>"} {"text":"<commit_before>#include \"behaviour_xsensfollowing.h\"\n#include <QtGui>\n#include <Behaviour_XsensFollowing\/xsensfollowingform.h>\n#include <Framework\/Angles.h>\n\nBehaviour_XsensFollowing::Behaviour_XsensFollowing(QString id, Module_ThrusterControlLoop *tcl, Module_XsensMTi *xsens)\n : RobotBehaviour(id)\n{\n this->xsens = xsens;\n this->tcl = tcl;\n turnTimer.moveToThread(this);\n timer.moveToThread(this);\n\n this->setDefaultValue(\"timer\",30);\n this->setDefaultValue(\"driveTime\",10000);\n this->setDefaultValue(\"ffSpeed\",0.5);\n this->setDefaultValue(\"kp\",0.3);\n this->setDefaultValue(\"delta\",10);\n}\n\nbool Behaviour_XsensFollowing::isActive()\n{\n return isEnabled();\n}\n\nvoid Behaviour_XsensFollowing::init()\n{\n logger->info(\"Xsens Following init\");\n setEnabled(false);\n connect(this,SIGNAL(newAngularSpeed(float)),tcl,SLOT(setAngularSpeed(float)));\n connect(this,SIGNAL(newForwardSpeed(float)),tcl,SLOT(setForwardSpeed(float)));\n connect(&timer,SIGNAL(timeout()),this,SLOT(controlLoop()));\n connect(&turnTimer,SIGNAL(timeout()),this,SLOT(turnNinety()));\n connect(this, SIGNAL(enabled(bool)), this, SLOT(controlEnabledChanged(bool)));\n}\n\nvoid Behaviour_XsensFollowing::startBehaviour()\n{\n if (this->isEnabled() == true){\n logger->info(\"Already enabled\/started!\");\n return;\n }\n logger->info(\"Starting Xsens Following\");\n this->setEnabled(true);\n\n targetHeading = xsens->getHeading();\n\n emit dataChanged(this);\n\n timer.start(getSettingsValue(\"timer\").toInt());\n turnTimer.start(getSettingsValue(\"driveTime\").toInt());\n}\n\nvoid Behaviour_XsensFollowing::stop()\n{\n if(timer.isActive()){\n timer.stop();\n }\n if(turnTimer.isActive()){\n turnTimer.stop();\n }\n\n if (!isEnabled()) {\n return;\n }\n\n logger->info(\"Xsens follow stop\");\n this->setEnabled(false);\n setEnabled(false);\n emit newAngularSpeed(0.0);\n emit newForwardSpeed(0.0);\n logger->info(\"Stop Xsens Following\");\n emit finished(this,true);\n}\n\nvoid Behaviour_XsensFollowing::reset()\n{\n logger->info(\"Xsens follow reset\");\n if (this->isEnabled() == false){\n logger->info(\"Not enabled!\");\n return;\n }\n timer.stop();\n turnTimer.stop();\n emit newAngularSpeed(0.0);\n emit newForwardSpeed(0.0);\n RobotModule::reset();\n if(xsens->isEnabled()){\n if(xsens->getHealthStatus().isHealthOk()){ \n targetHeading = xsens->getHeading();\n emit dataChanged(this);\n this->setHealthToOk();\n timer.start(getSettingsValue(\"timer\").toInt());\n turnTimer.start(getSettingsValue(\"driveTime\").toInt());\n }else{\n this->stopOnXsensError();\n }\n }else{\n this->stop();\n }\n}\n\nvoid Behaviour_XsensFollowing::controlLoop()\n{\n if (this->isEnabled() == false){\n logger->info(\"not enabled - controlloop\");\n this->stop();\n return;\n }\n\n if(!xsens->isEnabled() || !xsens->getHealthStatus().isHealthOk())\n {\n this->stopOnXsensError();\n return;\n }\n\n double currentHeading = xsens->getHeading();\n double diffHeading = Angles::deg2deg(targetHeading - currentHeading);\n double ctrAngleSpeed = 0.0;\n\n if(fabs(diffHeading) < getSettingsValue(\"delta\").toDouble())\n {\n ctrAngleSpeed = 0.0;\n } else {\n ctrAngleSpeed = getSettingsValue(\"kp\").toFloat()*diffHeading;\n }\n\n\n addData(\"heading current\",currentHeading);\n addData(\"heading target\", targetHeading);\n addData(\"heading difference\", diffHeading);\n emit dataChanged(this);\n emit newAngularSpeed(ctrAngleSpeed);\n emit newForwardSpeed(getSettingsValue(\"ffSpeed\").toFloat());\n}\n\nvoid Behaviour_XsensFollowing::turnNinety()\n{\n if (this->isEnabled() == false){\n logger->info(\"not enabled - 90\");\n this->stop();\n return;\n }\n logger->info(\"Turn 90\");\n qDebug()<< \"oldTargetHeading\" << targetHeading;\n if(getSettingsValue(\"enableTurn\").toBool() == true){\n if(getSettingsValue(\"turnClockwise\").toBool() == true){\n targetHeading = Angles::deg2deg(targetHeading+90);\n } else {\n targetHeading = Angles::deg2deg(targetHeading-90);\n }\n }\n qDebug()<< \"newTargetHeading\" << targetHeading;\n}\n\nvoid Behaviour_XsensFollowing::refreshHeading()\n{\n \/\/logger->debug(\"Xsens follow refresh heading\");\n if (this->isEnabled() == false){\n logger->info(\"Not enabled!\");\n return;\n }\n if(xsens->isEnabled()){\n\n this->dataLockerMutex.lock();\n\n targetHeading = this->xsens->getHeading();\n addData(\"heading target\", targetHeading);\n dataChanged( this );\n this->dataLockerMutex.unlock();\n\n }\n}\n\nvoid Behaviour_XsensFollowing::stopOnXsensError()\n{\n if (!isEnabled()) {\n return;\n }\n\n logger->info(\"Xsens follow stop error\");\n this->setEnabled(false);\n timer.stop();\n turnTimer.stop();\n setHealthToSick(\"xsens error\");\n setEnabled(false);\n emit newAngularSpeed(0.0);\n emit newForwardSpeed(0.0);\n emit finished(this,false);\n}\n\nQList<RobotModule*> Behaviour_XsensFollowing::getDependencies()\n{\n QList<RobotModule*> ret;\n ret.append(tcl);\n ret.append(xsens);\n return ret;\n}\n\nQWidget* Behaviour_XsensFollowing::createView(QWidget* parent)\n{\n return new XsensFollowingForm(parent, this);\n}\n\nvoid Behaviour_XsensFollowing::controlEnabledChanged(bool b){\n if(b == false){\n logger->info(\"No longer enabled!\");\n QTimer::singleShot(0, this, SLOT(stop()));\n }\n}\n<commit_msg>kleiner fehler -> falscher slot name<commit_after>#include \"behaviour_xsensfollowing.h\"\n#include <QtGui>\n#include <Behaviour_XsensFollowing\/xsensfollowingform.h>\n#include <Framework\/Angles.h>\n\nBehaviour_XsensFollowing::Behaviour_XsensFollowing(QString id, Module_ThrusterControlLoop *tcl, Module_XsensMTi *xsens)\n : RobotBehaviour(id)\n{\n this->xsens = xsens;\n this->tcl = tcl;\n turnTimer.moveToThread(this);\n timer.moveToThread(this);\n\n this->setDefaultValue(\"timer\",30);\n this->setDefaultValue(\"driveTime\",10000);\n this->setDefaultValue(\"ffSpeed\",0.5);\n this->setDefaultValue(\"kp\",0.3);\n this->setDefaultValue(\"delta\",10);\n}\n\nbool Behaviour_XsensFollowing::isActive()\n{\n return isEnabled();\n}\n\nvoid Behaviour_XsensFollowing::init()\n{\n logger->info(\"Xsens Following init\");\n setEnabled(false);\n connect(this,SIGNAL(newAngularSpeed(float)),tcl,SLOT(setAngularSpeed(float)));\n connect(this,SIGNAL(newForwardSpeed(float)),tcl,SLOT(setForwardSpeed(float)));\n connect(&timer,SIGNAL(timeout()),this,SLOT(controlLoop()));\n connect(&turnTimer,SIGNAL(timeout()),this,SLOT(turnNinety()));\n connect(this, SIGNAL(enabled(bool)), this, SLOT(controlEnabledChanged(bool)));\n}\n\nvoid Behaviour_XsensFollowing::startBehaviour()\n{\n if (this->isEnabled() == true){\n logger->info(\"Already enabled\/started!\");\n return;\n }\n logger->info(\"Starting Xsens Following\");\n this->setEnabled(true);\n\n targetHeading = xsens->getHeading();\n\n emit dataChanged(this);\n\n timer.start(getSettingsValue(\"timer\").toInt());\n turnTimer.start(getSettingsValue(\"driveTime\").toInt());\n}\n\nvoid Behaviour_XsensFollowing::stop()\n{\n if(timer.isActive()){\n timer.stop();\n }\n if(turnTimer.isActive()){\n turnTimer.stop();\n }\n\n if (!isEnabled()) {\n return;\n }\n\n logger->info(\"Xsens follow stop\");\n this->setEnabled(false);\n setEnabled(false);\n emit newAngularSpeed(0.0);\n emit newForwardSpeed(0.0);\n logger->info(\"Stop Xsens Following\");\n emit finished(this,true);\n}\n\nvoid Behaviour_XsensFollowing::reset()\n{\n logger->info(\"Xsens follow reset\");\n if (this->isEnabled() == false){\n logger->info(\"Not enabled!\");\n return;\n }\n timer.stop();\n turnTimer.stop();\n emit newAngularSpeed(0.0);\n emit newForwardSpeed(0.0);\n RobotModule::reset();\n if(xsens->isEnabled()){\n if(xsens->getHealthStatus().isHealthOk()){ \n targetHeading = xsens->getHeading();\n emit dataChanged(this);\n this->setHealthToOk();\n timer.start(getSettingsValue(\"timer\").toInt());\n turnTimer.start(getSettingsValue(\"driveTime\").toInt());\n }else{\n this->stopOnXsensError();\n }\n }else{\n this->stop();\n }\n}\n\nvoid Behaviour_XsensFollowing::controlLoop()\n{\n if (this->isEnabled() == false){\n logger->info(\"not enabled - controlloop\");\n this->stop();\n return;\n }\n\n if(!xsens->isEnabled() || !xsens->getHealthStatus().isHealthOk())\n {\n this->stopOnXsensError();\n return;\n }\n\n double currentHeading = xsens->getHeading();\n double diffHeading = Angles::deg2deg(targetHeading - currentHeading);\n double ctrAngleSpeed = 0.0;\n\n if(fabs(diffHeading) < getSettingsValue(\"delta\").toDouble())\n {\n ctrAngleSpeed = 0.0;\n } else {\n ctrAngleSpeed = getSettingsValue(\"kp\").toFloat()*diffHeading;\n }\n\n\n addData(\"heading current\",currentHeading);\n addData(\"heading target\", targetHeading);\n addData(\"heading difference\", diffHeading);\n emit dataChanged(this);\n emit newAngularSpeed(ctrAngleSpeed);\n emit newForwardSpeed(getSettingsValue(\"ffSpeed\").toFloat());\n}\n\nvoid Behaviour_XsensFollowing::turnNinety()\n{\n if (this->isEnabled() == false){\n logger->info(\"not enabled - 90\");\n this->stop();\n return;\n }\n logger->info(\"Turn 90\");\n if(getSettingsValue(\"enableTurn\").toBool() == true){\n if(getSettingsValue(\"turnClockwise\").toBool() == true){\n targetHeading = Angles::deg2deg(targetHeading+90);\n } else {\n targetHeading = Angles::deg2deg(targetHeading-90);\n }\n }\n}\n\nvoid Behaviour_XsensFollowing::refreshHeading()\n{\n\n \/\/logger->debug(\"Xsens follow refresh heading\");\n if (this->isEnabled() == false){\n logger->info(\"Not enabled!\");\n return;\n }\n if(xsens->isEnabled()){\n\n this->dataLockerMutex.lock();\n\n targetHeading = this->xsens->getHeading();\n addData(\"heading target\", targetHeading);\n dataChanged( this );\n this->dataLockerMutex.unlock();\n\n }\n}\n\nvoid Behaviour_XsensFollowing::stopOnXsensError()\n{\n if (!isEnabled()) {\n return;\n }\n\n logger->info(\"Xsens follow stop error\");\n this->setEnabled(false);\n timer.stop();\n turnTimer.stop();\n setHealthToSick(\"xsens error\");\n setEnabled(false);\n emit newAngularSpeed(0.0);\n emit newForwardSpeed(0.0);\n emit finished(this,false);\n}\n\nQList<RobotModule*> Behaviour_XsensFollowing::getDependencies()\n{\n QList<RobotModule*> ret;\n ret.append(tcl);\n ret.append(xsens);\n return ret;\n}\n\nQWidget* Behaviour_XsensFollowing::createView(QWidget* parent)\n{\n return new XsensFollowingForm(parent, this);\n}\n\nvoid Behaviour_XsensFollowing::controlEnabledChanged(bool b){\n if(b == false){\n logger->info(\"No longer enabled!\");\n QTimer::singleShot(0, this, SLOT(stop()));\n }\n}\n<|endoftext|>"} {"text":"<commit_before>\/*\n * Copyright(c) Sophist Solutions, Inc. 1990-2016. All rights reserved\n *\/\n#include \"..\/StroikaPreComp.h\"\n\n#include <set>\n\n#include \"StroikaConfig.h\"\n\n#include \"..\/Characters\/SDKString.h\"\n#include \"..\/Characters\/Format.h\"\n#include \"..\/Characters\/String_Constant.h\"\n#include \"..\/Execution\/Exceptions.h\"\n#include \"..\/Execution\/StringException.h\"\n\n#include \"Locale.h\"\n\n\nusing namespace Stroika::Foundation;\nusing namespace Stroika::Foundation::Configuration;\n\n\nusing Characters::String_Constant;\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\n\n\n\/*\n********************************************************************************\n*********** Configuration::UsePlatformDefaultLocaleAsDefaultLocale *************\n********************************************************************************\n*\/\nvoid Configuration::UsePlatformDefaultLocaleAsDefaultLocale ()\n{\n locale::global (GetPlatformDefaultLocale ());\n}\n\n\n\n\n\n\n\/*\n********************************************************************************\n************************* Configuration::GetAvailableLocales *******************\n********************************************************************************\n*\/\n#if 0\nEnumSystemLocales(EnumLocalesProc, LCID_INSTALLED);\n\/\/ the enumeration callback function\nBOOL CALLBACK EnumLocalesProc(LPTSTR lpLocaleString)\n{\n LCID uiCurLocale;\n TCHAR szCurNam[STR_LEN];\n if (!lpLocaleString)\n return FALSE;\n\/\/ This enumeration returns the LCID as a character string while\n\/\/ we will be using numbers in other NLS calls.\n uiCurLocale = uiConvertStrToInt(lpLocaleString);\n\/\/ Get the language name associated with this locale ID.\n GetLocaleInfo(uiCurLocale, LOCALE_SLANGUAGE, szCurName, STR_LEN);\n return TRUE;\n}\n#endif\nvector<Characters::String> Configuration::GetAvailableLocales ()\n{\n \/\/ horrible!!!! - see TOOD\n vector<Characters::String> result;\n result.reserve (10);\n IgnoreExceptionsForCall (result.push_back (FindLocaleName (String_Constant { L\"en\" }, String_Constant { L\"us\" })));\n return result;\n}\n\n\n\n\n\n\/*\n********************************************************************************\n*************************** Configuration::FindLocaleName **********************\n********************************************************************************\n*\/\nCharacters::String Configuration::FindLocaleName (const Characters::String& iso2LetterLanguageCode, const Characters::String& iso2LetterTerritoryCode)\n{\n using Characters::String;\n Require (iso2LetterLanguageCode.length () == 2);\n Require (iso2LetterTerritoryCode.length () == 2); \/\/ may lift this in the future and make it optional\n\n#if USE_NOISY_TRACE_IN_THIS_MODULE_\n Debug::TraceContextBumper ctx (\"Configuration::FindLocaleName\");\n DbgTrace (L\"(%s,%s)\", iso2LetterLanguageCode.c_str (), iso2LetterTerritoryCode.c_str ());\n#endif\n\n \/\/ This is a HORRIBLE way - but I know of no better (especially no better portable way).\n \/\/ See todo for planned fixes\n \/\/ --LGP 2013-03-02\n \/\/\n \/\/ Could make less heinous with memoizing, but not currently used much, and I plan todo much better impl...\n static set<String> part1 {\n iso2LetterLanguageCode,\n iso2LetterLanguageCode.ToLowerCase (),\n iso2LetterLanguageCode.ToUpperCase (),\n };\n static const set<String> part2 {\n String_Constant { L\"-\" },\n String_Constant { L\"_\" },\n String_Constant { L\".\" },\n String_Constant { L\" \" },\n };\n static set<String> part3 {\n iso2LetterTerritoryCode,\n iso2LetterTerritoryCode.ToLowerCase (),\n iso2LetterTerritoryCode.ToUpperCase (),\n };\n static const set<String> part4 {\n String_Constant { L\"\" },\n String_Constant { L\".utf8\" },\n };\n for (String i1 : part1) {\n for (String i2 : part2) {\n for (String i3 : part3) {\n for (String i4 : part4) {\n#if USE_NOISY_TRACE_IN_THIS_MODULE_\n DbgTrace (L\"***trying locale (i1 + i2 + i3 + i4).AsUTF8 ().c_str ()=%s\", (i1 + i2 + i3 + i4).c_str ());\n#endif\n IgnoreExceptionsForCall (return String::FromNarrowSDKString (locale ((i1 + i2 + i3 + i4).AsUTF8 ().c_str ()).name ()));\n }\n }\n }\n }\n Execution::Throw (Execution::StringException (Characters::Format (L\"Locale (%s-%s) not found\", iso2LetterLanguageCode.c_str (), iso2LetterTerritoryCode.c_str ())));\n}\n\n\n\n\n\n\/*\n********************************************************************************\n*************************** Configuration::FindNamedLocale *********************\n********************************************************************************\n*\/\nlocale Configuration::FindNamedLocale (const Characters::String& iso2LetterLanguageCode, const Characters::String& iso2LetterTerritoryCode)\n{\n return locale (FindLocaleName (iso2LetterLanguageCode, iso2LetterTerritoryCode).AsNarrowSDKString ().c_str ());\n}\n<commit_msg>fixed bug with Configuration::FindLocaleName - part1 and part3 cannot be static!<commit_after>\/*\n * Copyright(c) Sophist Solutions, Inc. 1990-2016. All rights reserved\n *\/\n#include \"..\/StroikaPreComp.h\"\n\n#include <set>\n\n#include \"StroikaConfig.h\"\n\n#include \"..\/Characters\/SDKString.h\"\n#include \"..\/Characters\/Format.h\"\n#include \"..\/Characters\/String_Constant.h\"\n#include \"..\/Execution\/Exceptions.h\"\n#include \"..\/Execution\/StringException.h\"\n\n#include \"Locale.h\"\n\n\nusing namespace Stroika::Foundation;\nusing namespace Stroika::Foundation::Configuration;\n\n\nusing Characters::String_Constant;\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\n\n\n\/*\n********************************************************************************\n*********** Configuration::UsePlatformDefaultLocaleAsDefaultLocale *************\n********************************************************************************\n*\/\nvoid Configuration::UsePlatformDefaultLocaleAsDefaultLocale ()\n{\n locale::global (GetPlatformDefaultLocale ());\n}\n\n\n\n\n\n\n\/*\n********************************************************************************\n************************* Configuration::GetAvailableLocales *******************\n********************************************************************************\n*\/\n#if 0\nEnumSystemLocales(EnumLocalesProc, LCID_INSTALLED);\n\/\/ the enumeration callback function\nBOOL CALLBACK EnumLocalesProc(LPTSTR lpLocaleString)\n{\n LCID uiCurLocale;\n TCHAR szCurNam[STR_LEN];\n if (!lpLocaleString)\n return FALSE;\n\/\/ This enumeration returns the LCID as a character string while\n\/\/ we will be using numbers in other NLS calls.\n uiCurLocale = uiConvertStrToInt(lpLocaleString);\n\/\/ Get the language name associated with this locale ID.\n GetLocaleInfo(uiCurLocale, LOCALE_SLANGUAGE, szCurName, STR_LEN);\n return TRUE;\n}\n#endif\nvector<Characters::String> Configuration::GetAvailableLocales ()\n{\n \/\/ horrible!!!! - see TOOD\n vector<Characters::String> result;\n result.reserve (10);\n IgnoreExceptionsForCall (result.push_back (FindLocaleName (String_Constant { L\"en\" }, String_Constant { L\"us\" })));\n return result;\n}\n\n\n\n\n\n\/*\n********************************************************************************\n*************************** Configuration::FindLocaleName **********************\n********************************************************************************\n*\/\nCharacters::String Configuration::FindLocaleName (const Characters::String& iso2LetterLanguageCode, const Characters::String& iso2LetterTerritoryCode)\n{\n using Characters::String;\n Require (iso2LetterLanguageCode.length () == 2);\n Require (iso2LetterTerritoryCode.length () == 2); \/\/ may lift this in the future and make it optional\n\n#if USE_NOISY_TRACE_IN_THIS_MODULE_\n Debug::TraceContextBumper ctx (\"Configuration::FindLocaleName\");\n DbgTrace (L\"(%s,%s)\", iso2LetterLanguageCode.c_str (), iso2LetterTerritoryCode.c_str ());\n#endif\n\n \/\/ This is a HORRIBLE way - but I know of no better (especially no better portable way).\n \/\/ See todo for planned fixes\n \/\/ --LGP 2013-03-02\n \/\/\n \/\/ Could make less heinous with memoizing, but not currently used much, and I plan todo much better impl...\n set<String> part1 {\n iso2LetterLanguageCode,\n iso2LetterLanguageCode.ToLowerCase (),\n iso2LetterLanguageCode.ToUpperCase (),\n };\n static const set<String> part2 {\n String_Constant { L\"-\" },\n String_Constant { L\"_\" },\n String_Constant { L\".\" },\n String_Constant { L\" \" },\n };\n set<String> part3 {\n iso2LetterTerritoryCode,\n iso2LetterTerritoryCode.ToLowerCase (),\n iso2LetterTerritoryCode.ToUpperCase (),\n };\n static const set<String> part4 {\n String_Constant { L\"\" },\n String_Constant { L\".utf8\" },\n };\n for (String i1 : part1) {\n for (String i2 : part2) {\n for (String i3 : part3) {\n for (String i4 : part4) {\n#if USE_NOISY_TRACE_IN_THIS_MODULE_\n DbgTrace (L\"***trying locale (i1 + i2 + i3 + i4).AsUTF8 ().c_str ()=%s\", (i1 + i2 + i3 + i4).c_str ());\n#endif\n IgnoreExceptionsForCall (return String::FromNarrowSDKString (locale ((i1 + i2 + i3 + i4).AsUTF8 ().c_str ()).name ()));\n }\n }\n }\n }\n Execution::Throw (Execution::StringException (Characters::Format (L\"Locale (%s-%s) not found\", iso2LetterLanguageCode.c_str (), iso2LetterTerritoryCode.c_str ())));\n}\n\n\n\n\n\n\/*\n********************************************************************************\n*************************** Configuration::FindNamedLocale *********************\n********************************************************************************\n*\/\nlocale Configuration::FindNamedLocale (const Characters::String& iso2LetterLanguageCode, const Characters::String& iso2LetterTerritoryCode)\n{\n return locale (FindLocaleName (iso2LetterLanguageCode, iso2LetterTerritoryCode).AsNarrowSDKString ().c_str ());\n}\n<|endoftext|>"} {"text":"<commit_before>\/*\n * Copyright(c) Sophist Solutions, Inc. 1990-2014. All rights reserved\n *\/\n#ifndef _Stroika_Foundation_Memory_SharedByValue_inl_\n#define _Stroika_Foundation_Memory_SharedByValue_inl_ 1\n\n\n\/*\n ********************************************************************************\n ***************************** Implementation Details ***************************\n ********************************************************************************\n *\/\n\n\nnamespace Stroika {\n namespace Foundation {\n namespace Memory {\n\n\n \/*\n ********************************************************************************\n ************** SharedByValue_CopyByFunction<T,SHARED_IMLP> *********************\n ********************************************************************************\n *\/\n#if qCompilerAndStdLib_lambda_default_argument_with_template_param_as_function_cast_Buggy\n template <typename T, typename SHARED_IMLP>\n SHARED_IMLP SharedByValue_CopyByFunction<T, SHARED_IMLP>::DefaultElementCopier_ (const T& t)\n {\n return SHARED_IMLP (new T (t));\n }\n#endif\n template <typename T, typename SHARED_IMLP>\n inline SharedByValue_CopyByFunction<T, SHARED_IMLP>::SharedByValue_CopyByFunction (SHARED_IMLP (*copier) (const T&))\n : fCopier (copier)\n {\n }\n template <typename T, typename SHARED_IMLP>\n inline SHARED_IMLP SharedByValue_CopyByFunction<T, SHARED_IMLP>::Copy (const T& t) const\n {\n return (*fCopier) (t);\n }\n\n\n \/*\n ********************************************************************************\n *************** SharedByValue_CopyByDefault<T,SHARED_IMLP> *********************\n ********************************************************************************\n *\/\n template <typename T, typename SHARED_IMLP>\n inline SHARED_IMLP SharedByValue_CopyByDefault<T, SHARED_IMLP>::Copy (const T& t)\n {\n return SHARED_IMLP (new T (t));\n }\n\n\n \/*\n ********************************************************************************\n ****************************** SharedByValue<TRAITS> ***************************\n ********************************************************************************\n *\/\n template <typename TRAITS>\n inline SharedByValue<TRAITS>::SharedByValue ()\n : fCopier_ (copier_type ())\n , fSharedImpl_ ()\n {\n }\n template <typename TRAITS>\n inline SharedByValue<TRAITS>::SharedByValue (nullptr_t n)\n : fCopier_ (copier_type ())\n , fSharedImpl_ ()\n {\n }\n template <typename TRAITS>\n inline SharedByValue<TRAITS>::SharedByValue (const SharedByValue<TRAITS>& from)\n : fCopier_ (from.fCopier_)\n , fSharedImpl_ (from.fSharedImpl_)\n {\n }\n template <typename TRAITS>\n inline SharedByValue<TRAITS>::SharedByValue (SharedByValue<TRAITS>&& from)\n : fCopier_ (from.fCopier_)\n , fSharedImpl_ (std::move (from.fSharedImpl_))\n {\n }\n template <typename TRAITS>\n inline SharedByValue<TRAITS>::SharedByValue (const shared_ptr_type& from, const copier_type& copier)\n : fCopier_ (copier)\n , fSharedImpl_ (from)\n {\n }\n template <typename TRAITS>\n inline SharedByValue<TRAITS>::SharedByValue (shared_ptr_type&& from, const copier_type& copier)\n : fCopier_ (copier)\n , fSharedImpl_ (std::move (from))\n {\n }\n template <typename TRAITS>\n inline SharedByValue<TRAITS>::SharedByValue (element_type* from, const copier_type& copier)\n : fCopier_ (copier)\n , fSharedImpl_ (from)\n {\n }\n template <typename TRAITS>\n inline SharedByValue<TRAITS>& SharedByValue<TRAITS>::operator= (const SharedByValue<TRAITS>& src)\n {\n if (this != &src) {\n fCopier_ = src.fCopier_;\n fSharedImpl_ = src.fSharedImpl_;\n }\n return *this;\n }\n template <typename TRAITS>\n inline const typename SharedByValue<TRAITS>::element_type* SharedByValue<TRAITS>::get () const\n {\n return (fSharedImpl_.get ());\n }\n template <typename TRAITS>\n typename SharedByValue<TRAITS>::element_type* SharedByValue<TRAITS>::get ()\n {\n element_type* ptr = fSharedImpl_.get ();\n \/*\n * For non-const pointing, we must clone ourselves (if there are\n * extra referneces). If we are a nullptr pointer, nobody could actually\n * rereference it anyhow, so don't bother with the Assure1Reference()\n * in that case.\n *\/\n if (ptr == nullptr) {\n return nullptr;\n }\n Assure1Reference ();\n ptr = fSharedImpl_.get ();\n EnsureNotNull (ptr);\n return ptr;\n }\n template <typename TRAITS>\n inline const typename SharedByValue<TRAITS>::element_type* SharedByValue<TRAITS>::operator-> () const\n {\n return (fSharedImpl_.get ());\n }\n template <typename TRAITS>\n inline typename SharedByValue<TRAITS>::element_type* SharedByValue<TRAITS>::operator-> ()\n {\n return get ();\n }\n template <typename TRAITS>\n inline const typename SharedByValue<TRAITS>::element_type& SharedByValue<TRAITS>::operator* () const\n {\n const element_type* ptr = get ();\n EnsureNotNull (ptr);\n return *ptr;\n }\n template <typename TRAITS>\n typename SharedByValue<TRAITS>::element_type& SharedByValue<TRAITS>::operator* ()\n {\n \/*\n * For non-const dereferencing, we must clone ourselves (if there are\n * extra referneces).\n *\/\n Assure1Reference ();\n element_type* ptr = get ();\n EnsureNotNull (ptr);\n return *ptr;\n }\n template <typename TRAITS>\n bool SharedByValue<TRAITS>::operator== (const SharedByValue<TRAITS>& rhs) const\n {\n return fSharedImpl_ == rhs.fSharedImpl_;\n }\n template <typename TRAITS>\n bool SharedByValue<TRAITS>::operator!= (const SharedByValue<TRAITS>& rhs) const\n {\n return fSharedImpl_ != rhs.fSharedImpl_;\n }\n template <typename TRAITS>\n SharedByValue_State SharedByValue<TRAITS>::GetSharingState () const\n {\n switch (fSharedImpl_.use_count ()) {\n case 0:\n Assert (fSharedImpl_.get () == nullptr);\n return SharedByValue_State::eNull;\n case 1:\n Assert (fSharedImpl_.get () != nullptr);\n Assert (fSharedImpl_.unique ());\n return SharedByValue_State::eSolo;\n default:\n Assert (fSharedImpl_.get () != nullptr);\n Assert (not fSharedImpl_.unique ());\n return SharedByValue_State::eShared;\n }\n }\n template <typename TRAITS>\n bool SharedByValue<TRAITS>::unique () const\n {\n return fSharedImpl_.unique ();\n }\n template <typename TRAITS>\n inline void SharedByValue<TRAITS>::Assure1Reference ()\n {\n if (!fSharedImpl_.unique ()) {\n BreakReferences_ ();\n }\n }\n template <typename TRAITS>\n void SharedByValue<TRAITS>::BreakReferences_ ()\n {\n element_type* ptr = fSharedImpl_.get ();\n RequireNotNull (ptr);\n \/*\n * For a valid pointer that is reference counted and multiply shared,\n * make a copy of that pointer via our fCloner function, and assign\n * that cloned reference to this.\n *\n * Note that by doing so, we remove any references to the current\n * item, and end up with our having the sole reference to the new copy of fPtr.\n *\n * Since we will be cloning the given pointer, we assume(assert) that\n * it is non-nullptr.\n *\/\n \/\/Require (!SHARED_IMLP::unique ()); This is not NECESSARILY so. Another thread could have just released this pointer, in which case\n \/\/ the creation of a new object was pointless, but harmless, as the assignemnt should decrement to zero the old\n \/\/ value and it should go away.\n *this = SharedByValue<TRAITS> (fCopier_.Copy (*ptr), fCopier_);\n Ensure (fSharedImpl_.unique ());\n }\n\n\n }\n }\n}\n#endif \/*_Stroika_Foundation_Memory_SharedByValue_inl_*\/\n<commit_msg>Minor tweaks to SharedByValue<TRAITS><commit_after>\/*\n * Copyright(c) Sophist Solutions, Inc. 1990-2014. All rights reserved\n *\/\n#ifndef _Stroika_Foundation_Memory_SharedByValue_inl_\n#define _Stroika_Foundation_Memory_SharedByValue_inl_ 1\n\n\n\/*\n ********************************************************************************\n ***************************** Implementation Details ***************************\n ********************************************************************************\n *\/\n\n\nnamespace Stroika {\n namespace Foundation {\n namespace Memory {\n\n\n \/*\n ********************************************************************************\n ************** SharedByValue_CopyByFunction<T,SHARED_IMLP> *********************\n ********************************************************************************\n *\/\n#if qCompilerAndStdLib_lambda_default_argument_with_template_param_as_function_cast_Buggy\n template <typename T, typename SHARED_IMLP>\n SHARED_IMLP SharedByValue_CopyByFunction<T, SHARED_IMLP>::DefaultElementCopier_ (const T& t)\n {\n return SHARED_IMLP (new T (t));\n }\n#endif\n template <typename T, typename SHARED_IMLP>\n inline SharedByValue_CopyByFunction<T, SHARED_IMLP>::SharedByValue_CopyByFunction (SHARED_IMLP (*copier) (const T&))\n : fCopier (copier)\n {\n }\n template <typename T, typename SHARED_IMLP>\n inline SHARED_IMLP SharedByValue_CopyByFunction<T, SHARED_IMLP>::Copy (const T& t) const\n {\n return (*fCopier) (t);\n }\n\n\n \/*\n ********************************************************************************\n *************** SharedByValue_CopyByDefault<T,SHARED_IMLP> *********************\n ********************************************************************************\n *\/\n template <typename T, typename SHARED_IMLP>\n inline SHARED_IMLP SharedByValue_CopyByDefault<T, SHARED_IMLP>::Copy (const T& t)\n {\n return SHARED_IMLP (new T (t));\n }\n\n\n \/*\n ********************************************************************************\n ****************************** SharedByValue<TRAITS> ***************************\n ********************************************************************************\n *\/\n template <typename TRAITS>\n inline SharedByValue<TRAITS>::SharedByValue ()\n : fCopier_ (copier_type ())\n , fSharedImpl_ ()\n {\n }\n template <typename TRAITS>\n inline SharedByValue<TRAITS>::SharedByValue (nullptr_t n)\n : fCopier_ (copier_type ())\n , fSharedImpl_ ()\n {\n }\n template <typename TRAITS>\n inline SharedByValue<TRAITS>::SharedByValue (const SharedByValue<TRAITS>& from)\n : fCopier_ (from.fCopier_)\n , fSharedImpl_ (from.fSharedImpl_)\n {\n }\n template <typename TRAITS>\n inline SharedByValue<TRAITS>::SharedByValue (SharedByValue<TRAITS>&& from)\n : fCopier_ (from.fCopier_)\n , fSharedImpl_ (std::move (from.fSharedImpl_))\n {\n }\n template <typename TRAITS>\n inline SharedByValue<TRAITS>::SharedByValue (const shared_ptr_type& from, const copier_type& copier)\n : fCopier_ (copier)\n , fSharedImpl_ (from)\n {\n }\n template <typename TRAITS>\n inline SharedByValue<TRAITS>::SharedByValue (shared_ptr_type&& from, const copier_type& copier)\n : fCopier_ (copier)\n , fSharedImpl_ (std::move (from))\n {\n }\n template <typename TRAITS>\n inline SharedByValue<TRAITS>::SharedByValue (element_type* from, const copier_type& copier)\n : fCopier_ (copier)\n , fSharedImpl_ (from)\n {\n }\n template <typename TRAITS>\n inline SharedByValue<TRAITS>& SharedByValue<TRAITS>::operator= (const SharedByValue<TRAITS>& src)\n {\n if (this != &src) {\n fCopier_ = src.fCopier_;\n fSharedImpl_ = src.fSharedImpl_;\n }\n return *this;\n }\n template <typename TRAITS>\n inline const typename SharedByValue<TRAITS>::element_type* SharedByValue<TRAITS>::get () const\n {\n return fSharedImpl_.get ();\n }\n template <typename TRAITS>\n inline typename SharedByValue<TRAITS>::element_type* SharedByValue<TRAITS>::get ()\n {\n element_type* ptr = fSharedImpl_.get ();\n \/*\n * For non-const pointing, we must clone ourselves (if there are\n * extra referneces). If we are a nullptr pointer, nobody could actually\n * rereference it anyhow, so don't bother with the Assure1Reference()\n * in that case.\n *\/\n if (ptr != nullptr) {\n Assure1Reference ();\n ptr = fSharedImpl_.get ();\n EnsureNotNull (ptr);\n }\n return ptr;\n }\n template <typename TRAITS>\n inline const typename SharedByValue<TRAITS>::element_type* SharedByValue<TRAITS>::operator-> () const\n {\n return fSharedImpl_.get ();\n }\n template <typename TRAITS>\n inline typename SharedByValue<TRAITS>::element_type* SharedByValue<TRAITS>::operator-> ()\n {\n return get ();\n }\n template <typename TRAITS>\n inline const typename SharedByValue<TRAITS>::element_type& SharedByValue<TRAITS>::operator* () const\n {\n const element_type* ptr = get ();\n EnsureNotNull (ptr);\n return *ptr;\n }\n template <typename TRAITS>\n inline typename SharedByValue<TRAITS>::element_type& SharedByValue<TRAITS>::operator* ()\n {\n \/*\n * For non-const dereferencing, we must clone ourselves (if there are\n * extra referneces).\n *\/\n Assure1Reference ();\n element_type* ptr = get ();\n EnsureNotNull (ptr);\n return *ptr;\n }\n template <typename TRAITS>\n inline bool SharedByValue<TRAITS>::operator== (const SharedByValue<TRAITS>& rhs) const\n {\n return fSharedImpl_ == rhs.fSharedImpl_;\n }\n template <typename TRAITS>\n inline bool SharedByValue<TRAITS>::operator!= (const SharedByValue<TRAITS>& rhs) const\n {\n return fSharedImpl_ != rhs.fSharedImpl_;\n }\n template <typename TRAITS>\n inline SharedByValue_State SharedByValue<TRAITS>::GetSharingState () const\n {\n switch (fSharedImpl_.use_count ()) {\n case 0:\n Assert (fSharedImpl_.get () == nullptr);\n return SharedByValue_State::eNull;\n case 1:\n Assert (fSharedImpl_.get () != nullptr);\n Assert (fSharedImpl_.unique ());\n return SharedByValue_State::eSolo;\n default:\n Assert (fSharedImpl_.get () != nullptr);\n Assert (not fSharedImpl_.unique ());\n return SharedByValue_State::eShared;\n }\n }\n template <typename TRAITS>\n inline bool SharedByValue<TRAITS>::unique () const\n {\n return fSharedImpl_.unique ();\n }\n template <typename TRAITS>\n inline void SharedByValue<TRAITS>::Assure1Reference ()\n {\n if (!fSharedImpl_.unique ()) {\n BreakReferences_ ();\n }\n }\n template <typename TRAITS>\n void SharedByValue<TRAITS>::BreakReferences_ ()\n {\n element_type* ptr = fSharedImpl_.get ();\n RequireNotNull (ptr);\n \/*\n * For a valid pointer that is reference counted and multiply shared,\n * make a copy of that pointer via our fCloner function, and assign\n * that cloned reference to this.\n *\n * Note that by doing so, we remove any references to the current\n * item, and end up with our having the sole reference to the new copy of fPtr.\n *\n * Since we will be cloning the given pointer, we assume(assert) that\n * it is non-nullptr.\n *\/\n \/\/Require (!SHARED_IMLP::unique ()); This is not NECESSARILY so. Another thread could have just released this pointer, in which case\n \/\/ the creation of a new object was pointless, but harmless, as the assignemnt should decrement to zero the old\n \/\/ value and it should go away.\n *this = SharedByValue<TRAITS> (fCopier_.Copy (*ptr), fCopier_);\n Ensure (fSharedImpl_.unique ());\n }\n\n\n }\n }\n}\n#endif \/*_Stroika_Foundation_Memory_SharedByValue_inl_*\/\n<|endoftext|>"} {"text":"<commit_before>\/*\n * Copyright(c) Sophist Solutions, Inc. 1990-2017. All rights reserved\n *\/\n#include \"..\/StroikaPreComp.h\"\n\n#include <algorithm>\n#include <cstdlib>\n\n#include \"..\/..\/Foundation\/Characters\/Format.h\"\n#include \"..\/..\/Foundation\/Characters\/String_Constant.h\"\n#include \"..\/..\/Foundation\/Characters\/ToString.h\"\n#include \"..\/..\/Foundation\/Containers\/Common.h\"\n#include \"..\/..\/Foundation\/DataExchange\/BadFormatException.h\"\n#include \"..\/..\/Foundation\/Debug\/Assertions.h\"\n#include \"..\/..\/Foundation\/Execution\/Exceptions.h\"\n#include \"..\/..\/Foundation\/IO\/Network\/HTTP\/Headers.h\"\n#include \"..\/..\/Foundation\/IO\/Network\/HTTP\/MessageStartTextInputStreamBinaryAdapter.h\"\n#include \"..\/..\/Foundation\/Memory\/SmallStackBuffer.h\"\n\n#include \"ClientErrorException.h\"\n\n#include \"Connection.h\"\n\nusing namespace Stroika::Foundation;\nusing namespace Stroika::Foundation::Characters;\nusing namespace Stroika::Foundation::Containers;\nusing namespace Stroika::Foundation::Memory;\n\nusing namespace Stroika::Frameworks;\nusing namespace Stroika::Frameworks::WebServer;\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 ***************************** WebServer::Connection ****************************\n ********************************************************************************\n *\/\n#if qCompilerAndStdLib_copy_elision_Warning_too_aggressive_when_not_copyable_Buggy\nDISABLE_COMPILER_CLANG_WARNING_START (\"clang diagnostic ignored \\\"-Wpessimizing-move\\\"\");\n#endif\nConnection::Connection (Socket s, const InterceptorChain& interceptorChain)\n : fInterceptorChain_{interceptorChain}\n , fSocket_ (s)\n , fSocketStream_ (s)\n , fMessage_{\n move (Request (fSocketStream_)),\n move (Response (s, fSocketStream_, DataExchange::PredefinedInternetMediaType::OctetStream_CT ())),\n s.GetPeerAddress ()}\n{\n}\n#if qCompilerAndStdLib_copy_elision_Warning_too_aggressive_when_not_copyable_Buggy\nDISABLE_COMPILER_CLANG_WARNING_END (\"clang diagnostic ignored \\\"-Wpessimizing-move\\\"\");\n#endif\n\nConnection::~Connection ()\n{\n if (fMessage_.PeekResponse ()->GetState () != Response::State::eCompleted) {\n IgnoreExceptionsForCall (fMessage_.PeekResponse ()->Abort ());\n }\n Require (fMessage_.PeekResponse ()->GetState () == Response::State::eCompleted);\n}\n\nvoid Connection::ReadHeaders ()\n{\n \/\/ @todo - DONT use TextStream::ReadLine - because that asserts SEEKABLE - which may not be true (and probably isn't here anymore)\n \/\/ Instead - we need a special variant that looks for CRLF - which doesn't require backtracking...!!!\n\n Foundation::IO::Network::HTTP::MessageStartTextInputStreamBinaryAdapter inTextStream (fMessage_.PeekRequest ()->GetInputStream ());\n {\n \/\/ Read METHOD line\n String line = inTextStream.ReadLine ();\n Sequence<String> tokens{line.Tokenize (Set<Character>{' '})};\n if (tokens.size () < 3) {\n DbgTrace (L\"tokens=%s, line='%s'\", Characters::ToString (tokens).c_str (), line.c_str ());\n Execution::Throw (ClientErrorException (Characters::Format (L\"Bad METHOD REQUEST HTTP line (%s)\", line.c_str ())));\n }\n fMessage_.PeekRequest ()->SetHTTPMethod (tokens[0]);\n if (tokens[1].empty ()) {\n \/\/ should check if GET\/PUT\/DELETE etc...\n DbgTrace (L\"tokens=%s, line='%s'\", Characters::ToString (tokens).c_str (), line.c_str ());\n Execution::Throw (ClientErrorException (String_Constant (L\"Bad HTTP REQUEST line - missing host-relative URL\")));\n }\n using IO::Network::URL;\n fMessage_.PeekRequest ()->SetURL (URL::Parse (tokens[1], URL::eAsRelativeURL));\n if (fMessage_.PeekRequest ()->GetHTTPMethod ().empty ()) {\n \/\/ should check if GET\/PUT\/DELETE etc...\n DbgTrace (L\"tokens=%s, line='%s'\", Characters::ToString (tokens).c_str (), line.c_str ());\n Execution::Throw (ClientErrorException (String_Constant (L\"Bad METHOD in REQUEST HTTP line\")));\n }\n }\n while (true) {\n String line = inTextStream.ReadLine ();\n if (line == String_Constant (L\"\\r\\n\") or line.empty ()) {\n return; \/\/ done\n }\n\n \/\/ add subsequent items to the header map\n size_t i = line.find (':');\n if (i == string::npos) {\n DbgTrace (L\"line=%s\", Characters::ToString (line).c_str ());\n Execution::Throw (ClientErrorException (String_Constant (L\"Bad HTTP REQUEST missing colon in headers\")));\n }\n else {\n String hdr = line.SubString (0, i).Trim ();\n String value = line.SubString (i + 1).Trim ();\n fMessage_.PeekRequest ()->AddHeader (hdr, value);\n }\n }\n}\n\nvoid Connection::Close ()\n{\n fMessage_.PeekResponse ()->Flush ();\n fSocket_.Close ();\n}\n\nbool Connection::ReadAndProcessMessage ()\n{\n#if USE_NOISY_TRACE_IN_THIS_MODULE_\n Debug::TraceContextBumper ctx (L\"Connection::ReadAndProcessMessage\");\n#endif\n constexpr bool kSupportHTTPKeepAlives_{false}; \/\/ @todo - support - now structured so maybe not too hard -- LGP 2016-09-02\n \/\/ @todo but be sure REsponse::End () doesnt close socket - just flushes response!\n\n ReadHeaders (); \/\/ bad API. Must rethink...\n\n if (not kSupportHTTPKeepAlives_) {\n \/\/ From https:\/\/www.w3.org\/Protocols\/rfc2616\/rfc2616-sec14.html\n \/\/ HTTP\/1.1 applications that do not support persistent connections MUST include the \"close\" connection option in every message.\n GetResponse ().AddHeader (IO::Network::HTTP::HeaderName::kConnection, String_Constant{L\"close\"});\n }\n#if USE_NOISY_TRACE_IN_THIS_MODULE_\n String url = GetRequest ().GetURL ().GetFullURL ();\n DbgTrace (L\"Serving page %s\", url.c_str ());\n#endif\n try {\n fInterceptorChain_.HandleMessage (&fMessage_);\n }\n catch (...) {\n \/\/DbgTrace (\"Caught exception halding message\");\n }\n GetResponse ().End ();\n return kSupportHTTPKeepAlives_;\n}\n<commit_msg>Frameworks\/WebServer\/Connection DbgTrace message on exception<commit_after>\/*\n * Copyright(c) Sophist Solutions, Inc. 1990-2017. All rights reserved\n *\/\n#include \"..\/StroikaPreComp.h\"\n\n#include <algorithm>\n#include <cstdlib>\n\n#include \"..\/..\/Foundation\/Characters\/Format.h\"\n#include \"..\/..\/Foundation\/Characters\/String_Constant.h\"\n#include \"..\/..\/Foundation\/Characters\/ToString.h\"\n#include \"..\/..\/Foundation\/Containers\/Common.h\"\n#include \"..\/..\/Foundation\/DataExchange\/BadFormatException.h\"\n#include \"..\/..\/Foundation\/Debug\/Assertions.h\"\n#include \"..\/..\/Foundation\/Execution\/Exceptions.h\"\n#include \"..\/..\/Foundation\/IO\/Network\/HTTP\/Headers.h\"\n#include \"..\/..\/Foundation\/IO\/Network\/HTTP\/MessageStartTextInputStreamBinaryAdapter.h\"\n#include \"..\/..\/Foundation\/Memory\/SmallStackBuffer.h\"\n\n#include \"ClientErrorException.h\"\n\n#include \"Connection.h\"\n\nusing namespace Stroika::Foundation;\nusing namespace Stroika::Foundation::Characters;\nusing namespace Stroika::Foundation::Containers;\nusing namespace Stroika::Foundation::Memory;\n\nusing namespace Stroika::Frameworks;\nusing namespace Stroika::Frameworks::WebServer;\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 ***************************** WebServer::Connection ****************************\n ********************************************************************************\n *\/\n#if qCompilerAndStdLib_copy_elision_Warning_too_aggressive_when_not_copyable_Buggy\nDISABLE_COMPILER_CLANG_WARNING_START (\"clang diagnostic ignored \\\"-Wpessimizing-move\\\"\");\n#endif\nConnection::Connection (Socket s, const InterceptorChain& interceptorChain)\n : fInterceptorChain_{interceptorChain}\n , fSocket_ (s)\n , fSocketStream_ (s)\n , fMessage_{\n move (Request (fSocketStream_)),\n move (Response (s, fSocketStream_, DataExchange::PredefinedInternetMediaType::OctetStream_CT ())),\n s.GetPeerAddress ()}\n{\n}\n#if qCompilerAndStdLib_copy_elision_Warning_too_aggressive_when_not_copyable_Buggy\nDISABLE_COMPILER_CLANG_WARNING_END (\"clang diagnostic ignored \\\"-Wpessimizing-move\\\"\");\n#endif\n\nConnection::~Connection ()\n{\n if (fMessage_.PeekResponse ()->GetState () != Response::State::eCompleted) {\n IgnoreExceptionsForCall (fMessage_.PeekResponse ()->Abort ());\n }\n Require (fMessage_.PeekResponse ()->GetState () == Response::State::eCompleted);\n}\n\nvoid Connection::ReadHeaders ()\n{\n \/\/ @todo - DONT use TextStream::ReadLine - because that asserts SEEKABLE - which may not be true (and probably isn't here anymore)\n \/\/ Instead - we need a special variant that looks for CRLF - which doesn't require backtracking...!!!\n\n Foundation::IO::Network::HTTP::MessageStartTextInputStreamBinaryAdapter inTextStream (fMessage_.PeekRequest ()->GetInputStream ());\n {\n \/\/ Read METHOD line\n String line = inTextStream.ReadLine ();\n Sequence<String> tokens{line.Tokenize (Set<Character>{' '})};\n if (tokens.size () < 3) {\n DbgTrace (L\"tokens=%s, line='%s'\", Characters::ToString (tokens).c_str (), line.c_str ());\n Execution::Throw (ClientErrorException (Characters::Format (L\"Bad METHOD REQUEST HTTP line (%s)\", line.c_str ())));\n }\n fMessage_.PeekRequest ()->SetHTTPMethod (tokens[0]);\n if (tokens[1].empty ()) {\n \/\/ should check if GET\/PUT\/DELETE etc...\n DbgTrace (L\"tokens=%s, line='%s'\", Characters::ToString (tokens).c_str (), line.c_str ());\n Execution::Throw (ClientErrorException (String_Constant (L\"Bad HTTP REQUEST line - missing host-relative URL\")));\n }\n using IO::Network::URL;\n fMessage_.PeekRequest ()->SetURL (URL::Parse (tokens[1], URL::eAsRelativeURL));\n if (fMessage_.PeekRequest ()->GetHTTPMethod ().empty ()) {\n \/\/ should check if GET\/PUT\/DELETE etc...\n DbgTrace (L\"tokens=%s, line='%s'\", Characters::ToString (tokens).c_str (), line.c_str ());\n Execution::Throw (ClientErrorException (String_Constant (L\"Bad METHOD in REQUEST HTTP line\")));\n }\n }\n while (true) {\n String line = inTextStream.ReadLine ();\n if (line == String_Constant (L\"\\r\\n\") or line.empty ()) {\n return; \/\/ done\n }\n\n \/\/ add subsequent items to the header map\n size_t i = line.find (':');\n if (i == string::npos) {\n DbgTrace (L\"line=%s\", Characters::ToString (line).c_str ());\n Execution::Throw (ClientErrorException (String_Constant (L\"Bad HTTP REQUEST missing colon in headers\")));\n }\n else {\n String hdr = line.SubString (0, i).Trim ();\n String value = line.SubString (i + 1).Trim ();\n fMessage_.PeekRequest ()->AddHeader (hdr, value);\n }\n }\n}\n\nvoid Connection::Close ()\n{\n fMessage_.PeekResponse ()->Flush ();\n fSocket_.Close ();\n}\n\nbool Connection::ReadAndProcessMessage ()\n{\n#if USE_NOISY_TRACE_IN_THIS_MODULE_\n Debug::TraceContextBumper ctx (L\"Connection::ReadAndProcessMessage\");\n#endif\n constexpr bool kSupportHTTPKeepAlives_{false}; \/\/ @todo - support - now structured so maybe not too hard -- LGP 2016-09-02\n \/\/ @todo but be sure REsponse::End () doesnt close socket - just flushes response!\n\n ReadHeaders (); \/\/ bad API. Must rethink...\n\n if (not kSupportHTTPKeepAlives_) {\n \/\/ From https:\/\/www.w3.org\/Protocols\/rfc2616\/rfc2616-sec14.html\n \/\/ HTTP\/1.1 applications that do not support persistent connections MUST include the \"close\" connection option in every message.\n GetResponse ().AddHeader (IO::Network::HTTP::HeaderName::kConnection, String_Constant{L\"close\"});\n }\n#if USE_NOISY_TRACE_IN_THIS_MODULE_\n String url = GetRequest ().GetURL ().GetFullURL ();\n DbgTrace (L\"Serving page %s\", url.c_str ());\n#endif\n try {\n fInterceptorChain_.HandleMessage (&fMessage_);\n }\n catch (...) {\n#if USE_NOISY_TRACE_IN_THIS_MODULE_\n DbgTrace (L\"Interceptor-Chain caught exception handling message: %s\", Characters::ToString (current_exception ()).c_str ());\n#endif\n }\n GetResponse ().End ();\n return kSupportHTTPKeepAlives_;\n}\n<|endoftext|>"} {"text":"<commit_before>\/*=========================================================================\n *\n * Copyright Insight Software Consortium\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http:\/\/www.apache.org\/licenses\/LICENSE-2.0.txt\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n *\n *=========================================================================*\/\n\/*=========================================================================\n *\n * Portions of this file are subject to the VTK Toolkit Version 3 copyright.\n *\n * Copyright (c) Ken Martin, Will Schroeder, Bill Lorensen\n *\n * For complete copyright, license and disclaimer of warranty information\n * please refer to the NOTICE file at the top of the ITK source tree.\n *\n *=========================================================================*\/\n#ifndef itkSliceImageFilter_hxx\n#define itkSliceImageFilter_hxx\n\n#include \"itkSliceImageFilter.h\"\n#include \"itkImageRegionIteratorWithIndex.h\"\n#include \"itkMath.h\"\n#include \"itkContinuousIndex.h\"\n#include \"itkObjectFactory.h\"\n#include \"itkProgressReporter.h\"\n\nnamespace itk\n{\n\ntemplate< class TInputImage, class TOutputImage >\nSliceImageFilter< TInputImage, TOutputImage >\n::SliceImageFilter()\n{\n m_Start.Fill(NumericTraits<IndexValueType>::min());\n m_Stop.Fill(NumericTraits<IndexValueType>::max());\n m_Step.Fill(1);\n this->DynamicMultiThreadingOn();\n}\n\ntemplate< class TInputImage, class TOutputImage >\nvoid\nSliceImageFilter< TInputImage, TOutputImage >\n::PrintSelf(std::ostream & os, Indent indent) const\n{\n Superclass::PrintSelf(os, indent);\n\n os << indent << \"Start: \" << m_Start << std::endl;\n os << indent << \"Stop: \" << m_Stop << std::endl;\n os << indent << \"Step: \" << m_Step << std::endl;\n\n}\n\n\ntemplate< class TInputImage, class TOutputImage >\nvoid\nSliceImageFilter< TInputImage, TOutputImage >\n::SetStart( typename TInputImage::IndexType::IndexValueType start)\n{\n unsigned int j;\n\n for ( j = 0; j < ImageDimension; ++j )\n {\n if ( start != m_Start[j] )\n {\n this->Modified();\n m_Start.Fill( start );\n return;\n }\n }\n}\n\n\ntemplate< class TInputImage, class TOutputImage >\nvoid\nSliceImageFilter< TInputImage, TOutputImage >\n::SetStop(typename TInputImage::IndexType::IndexValueType stop)\n{\n unsigned int j;\n\n for ( j = 0; j < ImageDimension; ++j )\n {\n if ( stop != m_Stop[j] )\n {\n this->Modified();\n m_Stop.Fill( stop );\n return;\n }\n }\n}\n\n\ntemplate< class TInputImage, class TOutputImage >\nvoid\nSliceImageFilter< TInputImage, TOutputImage >\n::SetStep(int step)\n{\n unsigned int j;\n\n for ( j = 0; j < ImageDimension; ++j )\n {\n if ( step != m_Step[j] )\n {\n this->Modified();\n m_Step.Fill( step );\n return;\n }\n }\n\n}\n\n\ntemplate< class TInputImage, class TOutputImage >\nvoid\nSliceImageFilter< TInputImage, TOutputImage >\n::DynamicThreadedGenerateData(const OutputImageRegionType & outputRegionForThread)\n{\n InputImageConstPointer inputPtr = this->GetInput();\n OutputImagePointer outputPtr = this->GetOutput();\n\n const typename TInputImage::SizeType &inputSize = inputPtr->GetLargestPossibleRegion().GetSize();\n const typename TInputImage::IndexType &inputIndex = inputPtr->GetLargestPossibleRegion().GetIndex();\n\n \/\/ clamp start\n InputIndexType start;\n for ( unsigned int i = 0; i < TOutputImage::ImageDimension; ++i )\n {\n start[i] = std::max( m_Start[i], inputIndex[i] );\n start[i] = std::min( start[i], static_cast<IndexValueType>(inputIndex[i] + inputSize[i]-1) );\n }\n\n \/\/ Define\/declare an iterator that will walk the output region for this thread\n using OutputIterator = ImageRegionIteratorWithIndex< TOutputImage >;\n OutputIterator outIt(outputPtr, outputRegionForThread);\n\n OutputIndexType destIndex;\n InputIndexType srcIndex;\n\n while ( !outIt.IsAtEnd() )\n {\n \/\/ Determine the index and physical location of the output pixel\n destIndex = outIt.GetIndex();\n\n for( unsigned int i = 0; i < TOutputImage::ImageDimension; ++i )\n {\n srcIndex[i] = destIndex[i]*m_Step[i] + start[i];\n }\n\n \/\/ Copy the input pixel to the output\n outIt.Set( inputPtr->GetPixel(srcIndex) );\n ++outIt;\n }\n}\n\n\ntemplate< class TInputImage, class TOutputImage >\nvoid\nSliceImageFilter< TInputImage, TOutputImage >\n::GenerateInputRequestedRegion()\n{\n\n\n \/\/ Get pointers to the input and output\n InputImagePointer inputPtr = const_cast< TInputImage * >( this->GetInput() );\n OutputImagePointer outputPtr = this->GetOutput();\n\n const typename TOutputImage::SizeType & outputRequestedRegionSize = outputPtr->GetRequestedRegion().GetSize();\n const typename TOutputImage::IndexType & outputRequestedRegionStartIndex = outputPtr->GetRequestedRegion().GetIndex();\n\n const typename TInputImage::SizeType &inputSize = inputPtr->GetLargestPossibleRegion().GetSize();\n const typename TInputImage::IndexType &inputIndex = inputPtr->GetLargestPossibleRegion().GetIndex();\n\n \/\/ clamp start\n InputIndexType start;\n for ( unsigned int i = 0; i < TOutputImage::ImageDimension; ++i )\n {\n \/\/ clamp to valid index range and don't include one past end, so\n \/\/ that a zero size RR would be valid\n start[i] = std::max( m_Start[i], inputIndex[i] );\n start[i] = std::min( start[i], static_cast<IndexValueType>(inputIndex[i] + inputSize[i] -1) );\n }\n\n\n typename TInputImage::SizeType inputRequestedRegionSize;\n inputRequestedRegionSize.Fill(0);\n for ( unsigned int i=0; i < TInputImage::ImageDimension; ++i )\n {\n if ( outputRequestedRegionSize[i] > 0 )\n {\n inputRequestedRegionSize[i] = (outputRequestedRegionSize[i] - 1 ) * itk::Math::abs(m_Step[i]) + 1;\n }\n }\n\n InputIndexType inputRequestedRegionIndex;\n for ( unsigned int i=0; i < TOutputImage::ImageDimension; ++i )\n {\n inputRequestedRegionIndex[i] = outputRequestedRegionStartIndex[i] * m_Step[i] + start[i];\n\n \/\/ if reversing, go to the lower ending index - 1\n if (m_Step[i] < 0)\n {\n inputRequestedRegionIndex[i] -= inputRequestedRegionSize[i] - 1;\n }\n }\n\n\n typename TInputImage::RegionType inputRequestedRegion;\n inputRequestedRegion.SetIndex(inputRequestedRegionIndex);\n inputRequestedRegion.SetSize(inputRequestedRegionSize);\n\n \/\/ test if input RR is completely inside input largest region\n if ( inputRequestedRegion.GetNumberOfPixels() > 0 &&\n !inputPtr->GetLargestPossibleRegion().IsInside( inputRequestedRegion ) )\n {\n itkExceptionMacro( \"Logic Error: incorrect computation of RequestedRegion\" );\n }\n\n inputPtr->SetRequestedRegion(inputRequestedRegion);\n return;\n\n}\n\n\ntemplate< class TInputImage, class TOutputImage >\nvoid\nSliceImageFilter< TInputImage, TOutputImage >\n::GenerateOutputInformation()\n{\n \/\/ Call the superclass' implementation of this method\n Superclass::GenerateOutputInformation();\n\n \/\/ Get pointers to the input and output\n InputImageConstPointer inputPtr = this->GetInput();\n OutputImagePointer outputPtr = this->GetOutput();\n\n \/\/ Compute the output spacing, the output image size, and the\n \/\/ output image start index\n const typename TInputImage::SpacingType &inputSpacing = inputPtr->GetSpacing();\n const typename TInputImage::SizeType &inputSize = inputPtr->GetLargestPossibleRegion().GetSize();\n const typename TInputImage::IndexType &inputIndex = inputPtr->GetLargestPossibleRegion().GetIndex();\n typename TInputImage::IndexType inputStartIndex;\n\n typename TOutputImage::SpacingType outputSpacing;\n typename TOutputImage::SizeType outputSize;\n\n typename TOutputImage::IndexType outputStartIndex;\n outputStartIndex.Fill(0);\n\n for ( unsigned int i = 0; i < TOutputImage::ImageDimension; ++i )\n {\n outputSpacing[i] = inputSpacing[i] * itk::Math::abs(m_Step[i]);\n\n \/\/ clamp start\n \/\/ Based on the sign of the step include 1 after the end.\n IndexValueType start = std::max( m_Start[i], inputIndex[i] - int(m_Step[i]<0));\n start = std::min( start, static_cast<IndexValueType>(inputIndex[i] + inputSize[i]) - int(m_Step[i]<0) );\n\n \/\/ clamp stop\n \/\/ Based on the sign of the step include 1 after the end.\n IndexValueType stop = std::max( m_Stop[i], inputIndex[i] - int(m_Step[i]<0) );\n stop = std::min( stop, static_cast<IndexValueType>(inputIndex[i] + inputSize[i]) - int(m_Step[i]<0));\n\n \/\/ If both the numerator and the denominator have the same sign,\n \/\/ then the range is a valid and non-zero sized. Truncation is the\n \/\/ correct rounding for these positive values.\n if ( (m_Step[i] > 0 && stop > start) ||\n ( m_Step[i] < 0 && stop < start ) )\n {\n outputSize[i] = (stop-start)\/m_Step[i];\n }\n else\n {\n outputSize[i] = 0u;\n }\n\n \/\/ If the step is negative, then the start is still the index of\n \/\/ the output origin\n inputStartIndex[i] = start;\n\n }\n\n const typename TInputImage::DirectionType & inputDirection = inputPtr->GetDirection();\n typename TInputImage::DirectionType flipMatrix;\n\n \/\/ Need a matrix to model the reversing of directions, this should\n \/\/ maintain the physical location of the pixels\n for ( unsigned int j = 0; j < ImageDimension; ++j )\n {\n flipMatrix[j][j] = itk::Math::sgn0(m_Step[j]);\n }\n\n outputPtr->SetDirection(inputDirection * flipMatrix);\n outputPtr->SetSpacing(outputSpacing);\n\n typename TOutputImage::PointType outputOrigin;\n inputPtr->TransformIndexToPhysicalPoint(inputStartIndex, outputOrigin);\n outputPtr->SetOrigin(outputOrigin);\n\n \/\/ Set region\n typename TOutputImage::RegionType outputLargestPossibleRegion;\n outputLargestPossibleRegion.SetSize(outputSize);\n outputLargestPossibleRegion.SetIndex(outputStartIndex);\n\n outputPtr->SetLargestPossibleRegion(outputLargestPossibleRegion);\n}\n\n\ntemplate< class TInputImage, class TOutputImage >\nvoid\nSliceImageFilter< TInputImage, TOutputImage >\n::VerifyInputInformation() ITKv5_CONST\n{\n\n Superclass::VerifyInputInformation();\n\n for ( unsigned int i = 0; i < ImageDimension; ++i )\n {\n if ( m_Step[i] == 0 )\n {\n itkExceptionMacro( \"Step size is zero \" << m_Step << \"!\" );\n }\n }\n\n}\n\n} \/\/ end namespace itk\n\n#endif\n<commit_msg>BUG: Address bug with small size in output of SliceImageFilter<commit_after>\/*=========================================================================\n *\n * Copyright Insight Software Consortium\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http:\/\/www.apache.org\/licenses\/LICENSE-2.0.txt\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n *\n *=========================================================================*\/\n\/*=========================================================================\n *\n * Portions of this file are subject to the VTK Toolkit Version 3 copyright.\n *\n * Copyright (c) Ken Martin, Will Schroeder, Bill Lorensen\n *\n * For complete copyright, license and disclaimer of warranty information\n * please refer to the NOTICE file at the top of the ITK source tree.\n *\n *=========================================================================*\/\n#ifndef itkSliceImageFilter_hxx\n#define itkSliceImageFilter_hxx\n\n#include \"itkSliceImageFilter.h\"\n#include \"itkImageRegionIteratorWithIndex.h\"\n#include \"itkMath.h\"\n#include \"itkContinuousIndex.h\"\n#include \"itkObjectFactory.h\"\n#include \"itkProgressReporter.h\"\n\nnamespace itk\n{\n\ntemplate< class TInputImage, class TOutputImage >\nSliceImageFilter< TInputImage, TOutputImage >\n::SliceImageFilter()\n{\n m_Start.Fill(NumericTraits<IndexValueType>::min());\n m_Stop.Fill(NumericTraits<IndexValueType>::max());\n m_Step.Fill(1);\n this->DynamicMultiThreadingOn();\n}\n\ntemplate< class TInputImage, class TOutputImage >\nvoid\nSliceImageFilter< TInputImage, TOutputImage >\n::PrintSelf(std::ostream & os, Indent indent) const\n{\n Superclass::PrintSelf(os, indent);\n\n os << indent << \"Start: \" << m_Start << std::endl;\n os << indent << \"Stop: \" << m_Stop << std::endl;\n os << indent << \"Step: \" << m_Step << std::endl;\n\n}\n\n\ntemplate< class TInputImage, class TOutputImage >\nvoid\nSliceImageFilter< TInputImage, TOutputImage >\n::SetStart( typename TInputImage::IndexType::IndexValueType start)\n{\n unsigned int j;\n\n for ( j = 0; j < ImageDimension; ++j )\n {\n if ( start != m_Start[j] )\n {\n this->Modified();\n m_Start.Fill( start );\n return;\n }\n }\n}\n\n\ntemplate< class TInputImage, class TOutputImage >\nvoid\nSliceImageFilter< TInputImage, TOutputImage >\n::SetStop(typename TInputImage::IndexType::IndexValueType stop)\n{\n unsigned int j;\n\n for ( j = 0; j < ImageDimension; ++j )\n {\n if ( stop != m_Stop[j] )\n {\n this->Modified();\n m_Stop.Fill( stop );\n return;\n }\n }\n}\n\n\ntemplate< class TInputImage, class TOutputImage >\nvoid\nSliceImageFilter< TInputImage, TOutputImage >\n::SetStep(int step)\n{\n unsigned int j;\n\n for ( j = 0; j < ImageDimension; ++j )\n {\n if ( step != m_Step[j] )\n {\n this->Modified();\n m_Step.Fill( step );\n return;\n }\n }\n\n}\n\n\ntemplate< class TInputImage, class TOutputImage >\nvoid\nSliceImageFilter< TInputImage, TOutputImage >\n::DynamicThreadedGenerateData(const OutputImageRegionType & outputRegionForThread)\n{\n InputImageConstPointer inputPtr = this->GetInput();\n OutputImagePointer outputPtr = this->GetOutput();\n\n const typename TInputImage::SizeType &inputSize = inputPtr->GetLargestPossibleRegion().GetSize();\n const typename TInputImage::IndexType &inputIndex = inputPtr->GetLargestPossibleRegion().GetIndex();\n\n \/\/ clamp start\n InputIndexType start;\n for ( unsigned int i = 0; i < TOutputImage::ImageDimension; ++i )\n {\n start[i] = std::max( m_Start[i], inputIndex[i] );\n start[i] = std::min( start[i], static_cast<IndexValueType>(inputIndex[i] + inputSize[i]-1) );\n }\n\n \/\/ Define\/declare an iterator that will walk the output region for this thread\n using OutputIterator = ImageRegionIteratorWithIndex< TOutputImage >;\n OutputIterator outIt(outputPtr, outputRegionForThread);\n\n OutputIndexType destIndex;\n InputIndexType srcIndex;\n\n while ( !outIt.IsAtEnd() )\n {\n \/\/ Determine the index and physical location of the output pixel\n destIndex = outIt.GetIndex();\n\n for( unsigned int i = 0; i < TOutputImage::ImageDimension; ++i )\n {\n srcIndex[i] = destIndex[i]*m_Step[i] + start[i];\n }\n\n \/\/ Copy the input pixel to the output\n outIt.Set( inputPtr->GetPixel(srcIndex) );\n ++outIt;\n }\n}\n\n\ntemplate< class TInputImage, class TOutputImage >\nvoid\nSliceImageFilter< TInputImage, TOutputImage >\n::GenerateInputRequestedRegion()\n{\n\n\n \/\/ Get pointers to the input and output\n InputImagePointer inputPtr = const_cast< TInputImage * >( this->GetInput() );\n OutputImagePointer outputPtr = this->GetOutput();\n\n const typename TOutputImage::SizeType & outputRequestedRegionSize = outputPtr->GetRequestedRegion().GetSize();\n const typename TOutputImage::IndexType & outputRequestedRegionStartIndex = outputPtr->GetRequestedRegion().GetIndex();\n\n const typename TInputImage::SizeType &inputSize = inputPtr->GetLargestPossibleRegion().GetSize();\n const typename TInputImage::IndexType &inputIndex = inputPtr->GetLargestPossibleRegion().GetIndex();\n\n \/\/ clamp start\n InputIndexType start;\n for ( unsigned int i = 0; i < TOutputImage::ImageDimension; ++i )\n {\n \/\/ clamp to valid index range and don't include one past end, so\n \/\/ that a zero size RR would be valid\n start[i] = std::max( m_Start[i], inputIndex[i] );\n start[i] = std::min( start[i], static_cast<IndexValueType>(inputIndex[i] + inputSize[i] -1) );\n }\n\n\n typename TInputImage::SizeType inputRequestedRegionSize;\n inputRequestedRegionSize.Fill(0);\n for ( unsigned int i=0; i < TInputImage::ImageDimension; ++i )\n {\n if ( outputRequestedRegionSize[i] > 0 )\n {\n inputRequestedRegionSize[i] = (outputRequestedRegionSize[i] - 1 ) * itk::Math::abs(m_Step[i]) + 1;\n }\n }\n\n InputIndexType inputRequestedRegionIndex;\n for ( unsigned int i=0; i < TOutputImage::ImageDimension; ++i )\n {\n inputRequestedRegionIndex[i] = outputRequestedRegionStartIndex[i] * m_Step[i] + start[i];\n\n \/\/ if reversing, go to the lower ending index - 1\n if (m_Step[i] < 0)\n {\n inputRequestedRegionIndex[i] -= inputRequestedRegionSize[i] - 1;\n }\n }\n\n\n typename TInputImage::RegionType inputRequestedRegion;\n inputRequestedRegion.SetIndex(inputRequestedRegionIndex);\n inputRequestedRegion.SetSize(inputRequestedRegionSize);\n\n \/\/ test if input RR is completely inside input largest region\n if ( inputRequestedRegion.GetNumberOfPixels() > 0 &&\n !inputPtr->GetLargestPossibleRegion().IsInside( inputRequestedRegion ) )\n {\n itkExceptionMacro( \"Logic Error: incorrect computation of RequestedRegion\" );\n }\n\n inputPtr->SetRequestedRegion(inputRequestedRegion);\n return;\n\n}\n\n\ntemplate< class TInputImage, class TOutputImage >\nvoid\nSliceImageFilter< TInputImage, TOutputImage >\n::GenerateOutputInformation()\n{\n \/\/ Call the superclass' implementation of this method\n Superclass::GenerateOutputInformation();\n\n \/\/ Get pointers to the input and output\n InputImageConstPointer inputPtr = this->GetInput();\n OutputImagePointer outputPtr = this->GetOutput();\n\n \/\/ Compute the output spacing, the output image size, and the\n \/\/ output image start index\n const typename TInputImage::SpacingType &inputSpacing = inputPtr->GetSpacing();\n const typename TInputImage::SizeType &inputSize = inputPtr->GetLargestPossibleRegion().GetSize();\n const typename TInputImage::IndexType &inputIndex = inputPtr->GetLargestPossibleRegion().GetIndex();\n typename TInputImage::IndexType inputStartIndex;\n\n typename TOutputImage::SpacingType outputSpacing;\n typename TOutputImage::SizeType outputSize;\n\n typename TOutputImage::IndexType outputStartIndex;\n outputStartIndex.Fill(0);\n\n for ( unsigned int i = 0; i < TOutputImage::ImageDimension; ++i )\n {\n outputSpacing[i] = inputSpacing[i] * itk::Math::abs(m_Step[i]);\n\n \/\/ clamp start\n \/\/ Based on the sign of the step include 1 after the end.\n IndexValueType start = std::max( m_Start[i], inputIndex[i] - int(m_Step[i]<0));\n start = std::min( start, static_cast<IndexValueType>(inputIndex[i] + inputSize[i]) - int(m_Step[i]<0) );\n\n \/\/ clamp stop\n \/\/ Based on the sign of the step include 1 after the end.\n IndexValueType stop = std::max( m_Stop[i], inputIndex[i] - int(m_Step[i]<0) );\n stop = std::min( stop, static_cast<IndexValueType>(inputIndex[i] + inputSize[i]) - int(m_Step[i]<0));\n\n \/\/ If both the numerator and the denominator have the same sign,\n \/\/ then the range is a valid and non-zero sized. Truncation is the\n \/\/ correct rounding for these positive values.\n if ( (m_Step[i] > 0 && stop > start) ||\n ( m_Step[i] < 0 && stop < start ) )\n {\n outputSize[i] = (stop-start-Math::sgn(m_Step[i]))\/m_Step[i];\n outputSize[i] += 1u;\n }\n else\n {\n outputSize[i] = 0u;\n }\n\n \/\/ If the step is negative, then the start is still the index of\n \/\/ the output origin\n inputStartIndex[i] = start;\n\n }\n\n const typename TInputImage::DirectionType & inputDirection = inputPtr->GetDirection();\n typename TInputImage::DirectionType flipMatrix;\n\n \/\/ Need a matrix to model the reversing of directions, this should\n \/\/ maintain the physical location of the pixels\n for ( unsigned int j = 0; j < ImageDimension; ++j )\n {\n flipMatrix[j][j] = itk::Math::sgn0(m_Step[j]);\n }\n\n outputPtr->SetDirection(inputDirection * flipMatrix);\n outputPtr->SetSpacing(outputSpacing);\n\n typename TOutputImage::PointType outputOrigin;\n inputPtr->TransformIndexToPhysicalPoint(inputStartIndex, outputOrigin);\n outputPtr->SetOrigin(outputOrigin);\n\n \/\/ Set region\n typename TOutputImage::RegionType outputLargestPossibleRegion;\n outputLargestPossibleRegion.SetSize(outputSize);\n outputLargestPossibleRegion.SetIndex(outputStartIndex);\n\n outputPtr->SetLargestPossibleRegion(outputLargestPossibleRegion);\n}\n\n\ntemplate< class TInputImage, class TOutputImage >\nvoid\nSliceImageFilter< TInputImage, TOutputImage >\n::VerifyInputInformation() ITKv5_CONST\n{\n\n Superclass::VerifyInputInformation();\n\n for ( unsigned int i = 0; i < ImageDimension; ++i )\n {\n if ( m_Step[i] == 0 )\n {\n itkExceptionMacro( \"Step size is zero \" << m_Step << \"!\" );\n }\n }\n\n}\n\n} \/\/ end namespace itk\n\n#endif\n<|endoftext|>"} {"text":"<commit_before>\/*=========================================================================\n *\n * Copyright Insight Software Consortium\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http:\/\/www.apache.org\/licenses\/LICENSE-2.0.txt\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n *\n *=========================================================================*\/\n#ifndef __itkTransformFileWriter_hxx\n#define __itkTransformFileWriter_hxx\n\n#include \"itkTransformFileWriter.h\"\n#include \"itkTransformFactoryBase.h\"\n#include \"itkTransformIOFactory.h\"\n#include \"itkCompositeTransformIOHelper.h\"\n\nnamespace itk\n{\n\nnamespace\n{\n\n\/*\n This helper is used to:\n Create and set a new type transform that have requested output precision type.\n *\/\ntemplate<typename TOutputScalar, typename TInputScalar>\nstruct TransformIOHelper\n{\n typedef TransformBaseTemplate<TInputScalar> InputTransformType;\n typedef TransformBaseTemplate<TOutputScalar> OutputTransformType;\n typedef typename OutputTransformType::Pointer OutputTransformPointer;\n\n \/*\n This function gets the type name of the input transform and creates\n a new transform object based on the requested precision type.\n *\/\n static OutputTransformPointer\n CreateNewTypeTransform(std::string transformName)\n {\n \/\/ Transform name is modified to have the output precision type.\n TransformIOBaseTemplate<TOutputScalar>::CorrectTransformPrecisionType( transformName );\n\n OutputTransformPointer convertedTransform;\n \/\/ Instantiate the transform\n LightObject::Pointer i = ObjectFactoryBase::CreateInstance ( transformName.c_str() );\n convertedTransform = dynamic_cast< OutputTransformType * >( i.GetPointer() );\n if( convertedTransform.IsNull() )\n {\n itkGenericExceptionMacro ( << \"Could not create an instance of \" << transformName );\n }\n convertedTransform->UnRegister();\n return convertedTransform;\n }\n\n \/* Converts the value type of transform parameters to the output precision type *\/\n static OptimizerParameters< TOutputScalar >\n ConvertParametersType(const OptimizerParameters< TInputScalar > &sourceParams)\n {\n OptimizerParameters< TOutputScalar > outputParams;\n outputParams.SetSize( sourceParams.GetSize() );\n for( SizeValueType i = 0; i < sourceParams.GetSize(); ++i )\n {\n outputParams[i] = static_cast<TOutputScalar>( sourceParams[i] );\n }\n return outputParams;\n }\n\n \/* Set fixed parameters and parameters of the new type created transform *\/\n static void SetAllParameters(const InputTransformType *transform, OutputTransformPointer& convertedTransform)\n {\n \/\/ The precision type of the input transform parameters should be converted to the requested output precision\n convertedTransform->SetFixedParameters( ConvertParametersType( transform->GetFixedParameters() ) );\n convertedTransform->SetParameters( ConvertParametersType( transform->GetParameters() ) );\n }\n};\n\n\/* Changes the precision type of input transform to the requested precision type *\/\ntemplate<typename TOutputScalar, typename TInputScalar>\ninline void AddToTransformList(typename TransformBaseTemplate<TInputScalar>::ConstPointer &transform, std::list< typename TransformBaseTemplate<TOutputScalar>::ConstPointer > & transformList)\n {\n \/* Pushes the converted transform to the input transform list *\/\n typedef TransformBaseTemplate<TInputScalar> InputTransformType;\n typedef typename InputTransformType::ConstPointer InputTransformConstPointer;\n typedef std::list< InputTransformConstPointer > InputConstTransformListType;\n typedef TransformBaseTemplate<TOutputScalar> OutputTransformType;\n typedef typename OutputTransformType::Pointer OutputTransformPointer;\n typedef typename OutputTransformType::ConstPointer OutputTransformConstPointer;\n typedef std::list< OutputTransformPointer > OutputTransformListType;\n typedef std::list< OutputTransformConstPointer > OutputConstTransformListType;\n\n const std::string transformName = transform->GetTransformTypeAsString();\n OutputTransformPointer convertedTransform;\n\n typedef TransformIOHelper<TOutputScalar, TInputScalar> IOhelper;\n\n \/\/ Composite and DisplacementFieldTransform transforms should be treated differently.\n if( transformName.find(\"CompositeTransform\") == std::string::npos )\n {\n convertedTransform = IOhelper::CreateNewTypeTransform( transformName );\n IOhelper::SetAllParameters(transform, convertedTransform);\n }\n else\n {\n \/*\n Following steps are needed to process a composite transform:\n 1) Use the compositeTransformIOHelper to get the input transforms list.\n 2) Iterate through the input transform list, convert each sub transform and put them in the output transform list.\n 3) Use a composite IO Helper agian to set the output transform list into the converted composite transform.\n *\/\n CompositeTransformIOHelperTemplate<TInputScalar> inputHelper;\n InputConstTransformListType inputTransformList = inputHelper.GetTransformList( transform );\n\n \/\/ create output transform list\n OutputTransformListType compositeTransformList;\n \/*\n The first transform of the output transform list should be a composite transform\n we push back just an empty composite transform as it will be skipped by the outputHelper.\n *\/\n OutputTransformPointer outputComposite = IOhelper::CreateNewTypeTransform( transformName );\n compositeTransformList.push_back( outputComposite.GetPointer() );\n\n \/\/ Now we iterate through input list and convert each sub transform to a new transform with requested precision type.\n typename InputConstTransformListType::iterator it = inputTransformList.begin();\n \/\/ composite transform is the first transform of the input transform list\n ++it; \/\/ skip the composite transform\n for(; it != inputTransformList.end(); ++it)\n {\n \/\/ get the input sub transform\n const InputTransformType *inSub = dynamic_cast< const InputTransformType *>( (*it).GetPointer() );\n \/\/ convert each sub transform and push them to the output transform list\n std::string inSubName = inSub->GetTransformTypeAsString();\n OutputTransformPointer convertedSub = IOhelper::CreateNewTypeTransform( inSubName );\n IOhelper::SetAllParameters( inSub, convertedSub );\n \/\/ push back the converted sub transform to the composite transform list\n compositeTransformList.push_back( convertedSub.GetPointer() );\n }\n\n convertedTransform = IOhelper::CreateNewTypeTransform( transformName ); \/\/ new composite transform\n CompositeTransformIOHelperTemplate<TOutputScalar> outputHelper;\n \/\/ set the output transform list into the new composite transform\n outputHelper.SetTransformList(convertedTransform.GetPointer(), compositeTransformList);\n }\n\n transformList.push_back( OutputTransformConstPointer(convertedTransform.GetPointer()) );\n}\n\n\/* Precision type conversion is not needed when the input transform already has the requested precision type *\/\ntemplate<>\ninline void AddToTransformList<double,double>(TransformBaseTemplate<double>::ConstPointer &transform, std::list< TransformBaseTemplate<double>::ConstPointer > & transformList)\n{\n transformList.push_back( TransformBaseTemplate<double>::ConstPointer(transform) );\n}\n\ntemplate<>\ninline void AddToTransformList<float,float>(TransformBaseTemplate<float>::ConstPointer &transform, std::list< TransformBaseTemplate<float>::ConstPointer > & transformList)\n{\n transformList.push_back( TransformBaseTemplate<float>::ConstPointer(transform) );\n}\n\n} \/\/ end anonymous namespace\n\ntemplate<typename ScalarType>\nTransformFileWriterTemplate<ScalarType>\n::TransformFileWriterTemplate() :\n m_FileName(\"\"),\n m_AppendMode(false)\n{\n TransformFactoryBase::RegisterDefaultTransforms();\n}\n\ntemplate<typename ScalarType>\nTransformFileWriterTemplate<ScalarType>\n::~TransformFileWriterTemplate()\n{\n}\n\n\/** Set the writer to append to the specified file *\/\ntemplate<typename ScalarType>\nvoid TransformFileWriterTemplate<ScalarType>\n::SetAppendOn()\n{\n this->SetAppendMode(true);\n}\n\n\/** Set the writer to overwrite the specified file - This is the\n* default mode. *\/\ntemplate<typename ScalarType>\nvoid TransformFileWriterTemplate<ScalarType>\n::SetAppendOff()\n{\n this->SetAppendMode(false);\n}\n\n\/** Set the writer mode (append\/overwrite). *\/\ntemplate<typename ScalarType>\nvoid TransformFileWriterTemplate<ScalarType>\n::SetAppendMode(bool mode)\n{\n this->m_AppendMode = mode;\n}\n\n\/** Get the writer mode. *\/\ntemplate<typename ScalarType>\nbool TransformFileWriterTemplate<ScalarType>\n::GetAppendMode()\n{\n return ( this->m_AppendMode );\n}\n\ntemplate<typename ScalarType>\nvoid TransformFileWriterTemplate<ScalarType>\n::PushBackTransformList(const Object *transObj)\n{\n TransformBaseTemplate<double>::ConstPointer dblptr = dynamic_cast<const TransformBaseTemplate<double> *>( transObj );\n if( dblptr.IsNotNull() )\n {\n AddToTransformList<ScalarType,double>( dblptr, m_TransformList );\n }\n else\n {\n TransformBaseTemplate<float>::ConstPointer fltptr = dynamic_cast<const TransformBaseTemplate<float> *>( transObj );\n if( fltptr.IsNotNull() )\n {\n AddToTransformList<ScalarType,float>( fltptr, m_TransformList );\n }\n else\n {\n itkExceptionMacro(\"The input of writer should be whether a double precision\"\n \"or a single precision transform type.\");\n }\n }\n}\n\ntemplate<>\nvoid TransformFileWriterTemplate<double>\n::PushBackTransformList(const Object *transObj)\n{\n TransformBaseTemplate<double>::ConstPointer dblptr = dynamic_cast<const TransformBaseTemplate<double> *>( transObj );\n if( dblptr.IsNotNull() )\n {\n AddToTransformList<double, double>( dblptr, m_TransformList );\n }\n else\n {\n TransformBaseTemplate<float>::ConstPointer fltptr = dynamic_cast<const TransformBaseTemplate<float> *>( transObj );\n if( fltptr.IsNotNull() )\n {\n AddToTransformList<double, float>( fltptr, m_TransformList );\n }\n else\n {\n itkExceptionMacro(\"The input of writer should be whether a double precision\"\n \"or a single precision transform type.\");\n }\n }\n}\n\ntemplate<>\nvoid TransformFileWriterTemplate<float>\n::PushBackTransformList(const Object *transObj)\n{\n TransformBaseTemplate<double>::ConstPointer dblptr = dynamic_cast<const TransformBaseTemplate<double> *>( transObj );\n if( dblptr.IsNotNull() )\n {\n AddToTransformList<float, double>( dblptr, m_TransformList );\n }\n else\n {\n TransformBaseTemplate<float>::ConstPointer fltptr = dynamic_cast<const TransformBaseTemplate<float> *>( transObj );\n if( fltptr.IsNotNull() )\n {\n AddToTransformList<float, float>( fltptr, m_TransformList );\n }\n else\n {\n itkExceptionMacro(\"The input of writer should be whether a double precision\"\n \"or a single precision transform type.\");\n }\n }\n}\n\n\/** Set the input transform and reinitialize the list of transforms *\/\ntemplate<typename ScalarType>\nvoid TransformFileWriterTemplate<ScalarType>\n::SetInput(const Object *transform)\n{\n m_TransformList.clear();\n this->PushBackTransformList(transform);\n}\n\ntemplate<typename ScalarType>\nconst typename TransformFileWriterTemplate<ScalarType>::TransformType *\nTransformFileWriterTemplate<ScalarType>\n::GetInput()\n{\n ConstTransformPointer res = *(m_TransformList.begin());\n return res.GetPointer();\n}\n\n\/** Add a transform to be written *\/\ntemplate<typename ScalarType>\nvoid TransformFileWriterTemplate<ScalarType>\n::AddTransform(const Object *transform)\n{\n \/* Check for a CompositeTransform.\n * The convention is that there should be one, and it should\n * be the first transform in the file\n *\/\n const std::string transformName = transform->GetNameOfClass();\n if( transformName.find(\"CompositeTransform\") != std::string::npos )\n {\n if(this->m_TransformList.size() > 0)\n {\n itkExceptionMacro(\"Can only write a transform of type CompositeTransform \"\n \"as the first transform in the file.\");\n }\n }\n\n this->PushBackTransformList(transform);\n}\n\ntemplate<typename ScalarType>\nvoid TransformFileWriterTemplate<ScalarType>\n::Update()\n{\n if ( m_FileName == \"\" )\n {\n itkExceptionMacro (\"No file name given\");\n }\n typename TransformIOBaseTemplate<ScalarType>::Pointer transformIO =\n TransformIOFactoryTemplate<ScalarType>::CreateTransformIO( m_FileName.c_str(), WriteMode );\n if ( transformIO.IsNull() )\n {\n itkExceptionMacro(\"Can't Create IO object for file \"\n << m_FileName);\n }\n transformIO->SetAppendMode(this->m_AppendMode);\n transformIO->SetFileName(m_FileName);\n transformIO->SetTransformList(this->m_TransformList);\n transformIO->Write();\n}\n\ntemplate<typename ScalarType>\nvoid TransformFileWriterTemplate<ScalarType>\n::PrintSelf(std::ostream & os, Indent indent) const\n{\n Superclass::PrintSelf(os, indent);\n\n os << indent << \"FileName: \" << m_FileName << std::endl;\n}\n\n} \/\/ namespace itk\n\n#endif\n<commit_msg>COMP: Remove multiple definition of PushBackTransformList.<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 __itkTransformFileWriter_hxx\n#define __itkTransformFileWriter_hxx\n\n#include \"itkTransformFileWriter.h\"\n#include \"itkTransformFactoryBase.h\"\n#include \"itkTransformIOFactory.h\"\n#include \"itkCompositeTransformIOHelper.h\"\n\nnamespace itk\n{\n\nnamespace\n{\n\n\/*\n This helper is used to:\n Create and set a new type transform that have requested output precision type.\n *\/\ntemplate<typename TOutputScalar, typename TInputScalar>\nstruct TransformIOHelper\n{\n typedef TransformBaseTemplate<TInputScalar> InputTransformType;\n typedef TransformBaseTemplate<TOutputScalar> OutputTransformType;\n typedef typename OutputTransformType::Pointer OutputTransformPointer;\n\n \/*\n This function gets the type name of the input transform and creates\n a new transform object based on the requested precision type.\n *\/\n static OutputTransformPointer\n CreateNewTypeTransform(std::string transformName)\n {\n \/\/ Transform name is modified to have the output precision type.\n TransformIOBaseTemplate<TOutputScalar>::CorrectTransformPrecisionType( transformName );\n\n OutputTransformPointer convertedTransform;\n \/\/ Instantiate the transform\n LightObject::Pointer i = ObjectFactoryBase::CreateInstance ( transformName.c_str() );\n convertedTransform = dynamic_cast< OutputTransformType * >( i.GetPointer() );\n if( convertedTransform.IsNull() )\n {\n itkGenericExceptionMacro ( << \"Could not create an instance of \" << transformName );\n }\n convertedTransform->UnRegister();\n return convertedTransform;\n }\n\n \/* Converts the value type of transform parameters to the output precision type *\/\n static OptimizerParameters< TOutputScalar >\n ConvertParametersType(const OptimizerParameters< TInputScalar > &sourceParams)\n {\n OptimizerParameters< TOutputScalar > outputParams;\n outputParams.SetSize( sourceParams.GetSize() );\n for( SizeValueType i = 0; i < sourceParams.GetSize(); ++i )\n {\n outputParams[i] = static_cast<TOutputScalar>( sourceParams[i] );\n }\n return outputParams;\n }\n\n \/* Set fixed parameters and parameters of the new type created transform *\/\n static void SetAllParameters(const InputTransformType *transform, OutputTransformPointer& convertedTransform)\n {\n \/\/ The precision type of the input transform parameters should be converted to the requested output precision\n convertedTransform->SetFixedParameters( ConvertParametersType( transform->GetFixedParameters() ) );\n convertedTransform->SetParameters( ConvertParametersType( transform->GetParameters() ) );\n }\n};\n\n\/* Changes the precision type of input transform to the requested precision type *\/\ntemplate<typename TOutputScalar, typename TInputScalar>\ninline void AddToTransformList(typename TransformBaseTemplate<TInputScalar>::ConstPointer &transform, std::list< typename TransformBaseTemplate<TOutputScalar>::ConstPointer > & transformList)\n {\n \/* Pushes the converted transform to the input transform list *\/\n typedef TransformBaseTemplate<TInputScalar> InputTransformType;\n typedef typename InputTransformType::ConstPointer InputTransformConstPointer;\n typedef std::list< InputTransformConstPointer > InputConstTransformListType;\n typedef TransformBaseTemplate<TOutputScalar> OutputTransformType;\n typedef typename OutputTransformType::Pointer OutputTransformPointer;\n typedef typename OutputTransformType::ConstPointer OutputTransformConstPointer;\n typedef std::list< OutputTransformPointer > OutputTransformListType;\n typedef std::list< OutputTransformConstPointer > OutputConstTransformListType;\n\n const std::string transformName = transform->GetTransformTypeAsString();\n OutputTransformPointer convertedTransform;\n\n typedef TransformIOHelper<TOutputScalar, TInputScalar> IOhelper;\n\n \/\/ Composite and DisplacementFieldTransform transforms should be treated differently.\n if( transformName.find(\"CompositeTransform\") == std::string::npos )\n {\n convertedTransform = IOhelper::CreateNewTypeTransform( transformName );\n IOhelper::SetAllParameters(transform, convertedTransform);\n }\n else\n {\n \/*\n Following steps are needed to process a composite transform:\n 1) Use the compositeTransformIOHelper to get the input transforms list.\n 2) Iterate through the input transform list, convert each sub transform and put them in the output transform list.\n 3) Use a composite IO Helper agian to set the output transform list into the converted composite transform.\n *\/\n CompositeTransformIOHelperTemplate<TInputScalar> inputHelper;\n InputConstTransformListType inputTransformList = inputHelper.GetTransformList( transform );\n\n \/\/ create output transform list\n OutputTransformListType compositeTransformList;\n \/*\n The first transform of the output transform list should be a composite transform\n we push back just an empty composite transform as it will be skipped by the outputHelper.\n *\/\n OutputTransformPointer outputComposite = IOhelper::CreateNewTypeTransform( transformName );\n compositeTransformList.push_back( outputComposite.GetPointer() );\n\n \/\/ Now we iterate through input list and convert each sub transform to a new transform with requested precision type.\n typename InputConstTransformListType::iterator it = inputTransformList.begin();\n \/\/ composite transform is the first transform of the input transform list\n ++it; \/\/ skip the composite transform\n for(; it != inputTransformList.end(); ++it)\n {\n \/\/ get the input sub transform\n const InputTransformType *inSub = dynamic_cast< const InputTransformType *>( (*it).GetPointer() );\n \/\/ convert each sub transform and push them to the output transform list\n std::string inSubName = inSub->GetTransformTypeAsString();\n OutputTransformPointer convertedSub = IOhelper::CreateNewTypeTransform( inSubName );\n IOhelper::SetAllParameters( inSub, convertedSub );\n \/\/ push back the converted sub transform to the composite transform list\n compositeTransformList.push_back( convertedSub.GetPointer() );\n }\n\n convertedTransform = IOhelper::CreateNewTypeTransform( transformName ); \/\/ new composite transform\n CompositeTransformIOHelperTemplate<TOutputScalar> outputHelper;\n \/\/ set the output transform list into the new composite transform\n outputHelper.SetTransformList(convertedTransform.GetPointer(), compositeTransformList);\n }\n\n transformList.push_back( OutputTransformConstPointer(convertedTransform.GetPointer()) );\n}\n\n\/* Precision type conversion is not needed when the input transform already has the requested precision type *\/\ntemplate<>\ninline void AddToTransformList<double,double>(TransformBaseTemplate<double>::ConstPointer &transform, std::list< TransformBaseTemplate<double>::ConstPointer > & transformList)\n{\n transformList.push_back( TransformBaseTemplate<double>::ConstPointer(transform) );\n}\n\ntemplate<>\ninline void AddToTransformList<float,float>(TransformBaseTemplate<float>::ConstPointer &transform, std::list< TransformBaseTemplate<float>::ConstPointer > & transformList)\n{\n transformList.push_back( TransformBaseTemplate<float>::ConstPointer(transform) );\n}\n\n} \/\/ end anonymous namespace\n\ntemplate<typename ScalarType>\nTransformFileWriterTemplate<ScalarType>\n::TransformFileWriterTemplate() :\n m_FileName(\"\"),\n m_AppendMode(false)\n{\n TransformFactoryBase::RegisterDefaultTransforms();\n}\n\ntemplate<typename ScalarType>\nTransformFileWriterTemplate<ScalarType>\n::~TransformFileWriterTemplate()\n{\n}\n\n\/** Set the writer to append to the specified file *\/\ntemplate<typename ScalarType>\nvoid TransformFileWriterTemplate<ScalarType>\n::SetAppendOn()\n{\n this->SetAppendMode(true);\n}\n\n\/** Set the writer to overwrite the specified file - This is the\n* default mode. *\/\ntemplate<typename ScalarType>\nvoid TransformFileWriterTemplate<ScalarType>\n::SetAppendOff()\n{\n this->SetAppendMode(false);\n}\n\n\/** Set the writer mode (append\/overwrite). *\/\ntemplate<typename ScalarType>\nvoid TransformFileWriterTemplate<ScalarType>\n::SetAppendMode(bool mode)\n{\n this->m_AppendMode = mode;\n}\n\n\/** Get the writer mode. *\/\ntemplate<typename ScalarType>\nbool TransformFileWriterTemplate<ScalarType>\n::GetAppendMode()\n{\n return ( this->m_AppendMode );\n}\n\ntemplate<>\nvoid TransformFileWriterTemplate<double>\n::PushBackTransformList(const Object *transObj)\n{\n TransformBaseTemplate<double>::ConstPointer dblptr = dynamic_cast<const TransformBaseTemplate<double> *>( transObj );\n if( dblptr.IsNotNull() )\n {\n AddToTransformList<double, double>( dblptr, m_TransformList );\n }\n else\n {\n TransformBaseTemplate<float>::ConstPointer fltptr = dynamic_cast<const TransformBaseTemplate<float> *>( transObj );\n if( fltptr.IsNotNull() )\n {\n AddToTransformList<double, float>( fltptr, m_TransformList );\n }\n else\n {\n itkExceptionMacro(\"The input of writer should be whether a double precision\"\n \"or a single precision transform type.\");\n }\n }\n}\n\ntemplate<>\nvoid TransformFileWriterTemplate<float>\n::PushBackTransformList(const Object *transObj)\n{\n TransformBaseTemplate<double>::ConstPointer dblptr = dynamic_cast<const TransformBaseTemplate<double> *>( transObj );\n if( dblptr.IsNotNull() )\n {\n AddToTransformList<float, double>( dblptr, m_TransformList );\n }\n else\n {\n TransformBaseTemplate<float>::ConstPointer fltptr = dynamic_cast<const TransformBaseTemplate<float> *>( transObj );\n if( fltptr.IsNotNull() )\n {\n AddToTransformList<float, float>( fltptr, m_TransformList );\n }\n else\n {\n itkExceptionMacro(\"The input of writer should be whether a double precision\"\n \"or a single precision transform type.\");\n }\n }\n}\n\n\/** Set the input transform and reinitialize the list of transforms *\/\ntemplate<typename ScalarType>\nvoid TransformFileWriterTemplate<ScalarType>\n::SetInput(const Object *transform)\n{\n m_TransformList.clear();\n this->PushBackTransformList(transform);\n}\n\ntemplate<typename ScalarType>\nconst typename TransformFileWriterTemplate<ScalarType>::TransformType *\nTransformFileWriterTemplate<ScalarType>\n::GetInput()\n{\n ConstTransformPointer res = *(m_TransformList.begin());\n return res.GetPointer();\n}\n\n\/** Add a transform to be written *\/\ntemplate<typename ScalarType>\nvoid TransformFileWriterTemplate<ScalarType>\n::AddTransform(const Object *transform)\n{\n \/* Check for a CompositeTransform.\n * The convention is that there should be one, and it should\n * be the first transform in the file\n *\/\n const std::string transformName = transform->GetNameOfClass();\n if( transformName.find(\"CompositeTransform\") != std::string::npos )\n {\n if(this->m_TransformList.size() > 0)\n {\n itkExceptionMacro(\"Can only write a transform of type CompositeTransform \"\n \"as the first transform in the file.\");\n }\n }\n\n this->PushBackTransformList(transform);\n}\n\ntemplate<typename ScalarType>\nvoid TransformFileWriterTemplate<ScalarType>\n::Update()\n{\n if ( m_FileName == \"\" )\n {\n itkExceptionMacro (\"No file name given\");\n }\n typename TransformIOBaseTemplate<ScalarType>::Pointer transformIO =\n TransformIOFactoryTemplate<ScalarType>::CreateTransformIO( m_FileName.c_str(), WriteMode );\n if ( transformIO.IsNull() )\n {\n itkExceptionMacro(\"Can't Create IO object for file \"\n << m_FileName);\n }\n transformIO->SetAppendMode(this->m_AppendMode);\n transformIO->SetFileName(m_FileName);\n transformIO->SetTransformList(this->m_TransformList);\n transformIO->Write();\n}\n\ntemplate<typename ScalarType>\nvoid TransformFileWriterTemplate<ScalarType>\n::PrintSelf(std::ostream & os, Indent indent) const\n{\n Superclass::PrintSelf(os, indent);\n\n os << indent << \"FileName: \" << m_FileName << std::endl;\n}\n\n} \/\/ namespace itk\n\n#endif\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#include <mitkTestFixture.h>\n#include <mitkTestingMacros.h>\n\n#include <mitkPASpectralUnmixingFilterBase.h>\n#include <mitkPALinearSpectralUnmixingFilter.h>\n#include <mitkImageReadAccessor.h>\n\nclass mitkSpectralUnmixingTestSuite : public mitk::TestFixture\n{\n CPPUNIT_TEST_SUITE(mitkSpectralUnmixingTestSuite);\n MITK_TEST(testSUAlgorithm);\n CPPUNIT_TEST_SUITE_END();\n\nprivate:\n mitk::pa::SpectralUnmixingFilterBase::Pointer m_SpectralUnmixingFilter;\n mitk::Image::Pointer inputImage;\n std::vector<float> m_inputWavelengths;\n std::vector<float> m_CorrectResult;\n\npublic:\n\n void setUp() override\n {\n MITK_INFO << \"setUp ... \";\n \/\/Set empty input image:\n inputImage = mitk::Image::New();\n mitk::PixelType pixelType = mitk::MakeScalarPixelType<float>();\n const int NUMBER_OF_SPATIAL_DIMENSIONS = 3;\n auto* dimensions = new unsigned int[NUMBER_OF_SPATIAL_DIMENSIONS];\n\n dimensions[0] = 1;\n dimensions[1] = 1;\n dimensions[2] = 3;\n\n \/\/Initialie empty input image:\n inputImage->Initialize(pixelType, NUMBER_OF_SPATIAL_DIMENSIONS, dimensions);\n\n \/\/Set wavelengths for unmixing:\n m_inputWavelengths.push_back(750);\n m_inputWavelengths.push_back(800);\n m_inputWavelengths.push_back(850);\n\n \/\/Set fraction of Hb and HbO2 to unmix:\n float fracHb = 0.3;\n float fracHbO2 = 0.67;\n\n \/\/Fractions are also correct unmixing result:\n m_CorrectResult.push_back(fracHbO2);\n m_CorrectResult.push_back(fracHb);\n\n \/\/Calculate values of wavelengths (750,800,850 nm) and multiply with fractions to get pixel values:\n float px1 = fracHb * 7.52 + fracHbO2 * 2.77;\n float px2 = fracHb * 4.08 + fracHbO2 * 4.37;\n float px3 = fracHb * 3.7 + fracHbO2 * 5.67;\n std::vector<float> m_Value{px1,px2,px3};\n\n float* data = new float[3];\n data[0] = m_Value[0];\n data[1] = m_Value[1];\n data[2] = m_Value[2];\n\n MITK_INFO << \"data0 \" << data[0];\n MITK_INFO << \"data1 \" << data[1];\n MITK_INFO << \"data2 \" << data[2];\n\n inputImage->SetImportVolume(data, mitk::Image::ImportMemoryManagementType::CopyMemory);\n delete[] data;\n\n MITK_INFO << \"[DONE]\";\n }\n\n void testSUAlgorithm()\n {\n MITK_INFO << \"START FILTER TEST ... \";\n \/\/ Set input image\n auto m_SpectralUnmixingFilter = mitk::pa::LinearSpectralUnmixingFilter::New();\n m_SpectralUnmixingFilter->SetInput(inputImage);\n\n \/\/ Set Algortihm to filter\n m_SpectralUnmixingFilter->SetAlgorithm(mitk::pa::LinearSpectralUnmixingFilter::AlgortihmType::householderQr);\n\n \/\/Set wavelengths to filter\n for (unsigned int imageIndex = 0; imageIndex < m_inputWavelengths.size(); imageIndex++)\n {\n unsigned int wavelength = m_inputWavelengths[imageIndex];\n m_SpectralUnmixingFilter->AddWavelength(wavelength);\n }\n\n \/\/Set Chromophores to filter\n m_SpectralUnmixingFilter->AddChromophore(\n mitk::pa::SpectralUnmixingFilterBase::ChromophoreType::OXYGENATED_HEMOGLOBIN);\n\n m_SpectralUnmixingFilter->AddChromophore(\n mitk::pa::SpectralUnmixingFilterBase::ChromophoreType::DEOXYGENATED_HEMOGLOBIN);\n\n m_SpectralUnmixingFilter->Update();\n float threshold = 1e-5;\n\n for (int i = 0; i < 2; ++i)\n {\n mitk::Image::Pointer output = m_SpectralUnmixingFilter->GetOutput(i);\n mitk::ImageReadAccessor readAccess(output);\n const float* inputDataArray = ((const float*)readAccess.GetData());\n auto pixel = inputDataArray[0];\n\n MITK_INFO << \"CorrectResult: \" << m_CorrectResult[i];\n MITK_INFO << \"FilterResult: \" << pixel;\n\n CPPUNIT_ASSERT(std::abs(pixel - m_CorrectResult[i])<threshold);\n }\n MITK_INFO << \"FILTER TEST SUCCESFULL :)\";\n }\n\n void tearDown() override\n {\n m_SpectralUnmixingFilter = nullptr;\n inputImage = nullptr;\n m_inputWavelengths.clear();\n m_CorrectResult.clear();\n MITK_INFO << \"tearDown ... [DONE]\";\n }\n};\n\nMITK_TEST_SUITE_REGISTRATION(mitkSpectralUnmixing)\n<commit_msg>add all solvers to test.<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#include <mitkTestFixture.h>\n#include <mitkTestingMacros.h>\n\n#include <mitkPASpectralUnmixingFilterBase.h>\n#include <mitkPALinearSpectralUnmixingFilter.h>\n#include <mitkImageReadAccessor.h>\n\nclass mitkSpectralUnmixingTestSuite : public mitk::TestFixture\n{\n CPPUNIT_TEST_SUITE(mitkSpectralUnmixingTestSuite);\n MITK_TEST(testSUAlgorithm);\n CPPUNIT_TEST_SUITE_END();\n\nprivate:\n mitk::pa::SpectralUnmixingFilterBase::Pointer m_SpectralUnmixingFilter;\n mitk::Image::Pointer inputImage;\n std::vector<float> m_inputWavelengths;\n std::vector<float> m_CorrectResult;\n float threshold;\n\npublic:\n\n void setUp() override\n {\n MITK_INFO << \"setUp ... \";\n \/\/Set empty input image:\n inputImage = mitk::Image::New();\n mitk::PixelType pixelType = mitk::MakeScalarPixelType<float>();\n const int NUMBER_OF_SPATIAL_DIMENSIONS = 3;\n auto* dimensions = new unsigned int[NUMBER_OF_SPATIAL_DIMENSIONS];\n\n dimensions[0] = 1;\n dimensions[1] = 1;\n dimensions[2] = 3;\n\n inputImage->Initialize(pixelType, NUMBER_OF_SPATIAL_DIMENSIONS, dimensions);\n\n \/\/Set wavelengths for unmixing:\n m_inputWavelengths.push_back(750);\n m_inputWavelengths.push_back(800);\n m_inputWavelengths.push_back(850);\n\n \/\/Set fraction of Hb and HbO2 to unmix:\n float fracHb = 0.396579;\n float fracHbO2 = 0.594845;\n m_CorrectResult.push_back(fracHbO2);\n m_CorrectResult.push_back(fracHb);\n\n \/\/Set threshold 1 digit\n threshold = 0.000001;\n\n \/\/Multiply values of wavelengths (750,800,850 nm) with fractions to get pixel values:\n float px1 = fracHb * 7.52 + fracHbO2 * 2.77;\n float px2 = fracHb * 4.08 + fracHbO2 * 4.37;\n float px3 = fracHb * 3.7 + fracHbO2 * 5.67;\n std::vector<float> m_Value{px1,px2,px3};\n\n float* data = new float[3];\n data[0] = m_Value[0];\n data[1] = m_Value[1];\n data[2] = m_Value[2];\n\n inputImage->SetImportVolume(data, mitk::Image::ImportMemoryManagementType::CopyMemory);\n delete[] data;\n MITK_INFO << \"[DONE]\";\n }\n\n void testSUAlgorithm()\n {\n MITK_INFO << \"START FILTER TEST ... \";\n \/\/ Set input image\n auto m_SpectralUnmixingFilter = mitk::pa::LinearSpectralUnmixingFilter::New();\n m_SpectralUnmixingFilter->SetInput(inputImage);\n\n \/\/ Set Algortihm to filter\n \/\/m_SpectralUnmixingFilter->SetAlgorithm(mitk::pa::LinearSpectralUnmixingFilter::AlgortihmType::householderQr);\n \/\/m_SpectralUnmixingFilter->SetAlgorithm(mitk::pa::LinearSpectralUnmixingFilter::AlgortihmType::ldlt);\n \/\/m_SpectralUnmixingFilter->SetAlgorithm(mitk::pa::LinearSpectralUnmixingFilter::AlgortihmType::llt);\n m_SpectralUnmixingFilter->SetAlgorithm(mitk::pa::LinearSpectralUnmixingFilter::AlgortihmType::colPivHouseholderQr);\n \/\/m_SpectralUnmixingFilter->SetAlgorithm(mitk::pa::LinearSpectralUnmixingFilter::AlgortihmType::jacobiSvd);\n \/\/m_SpectralUnmixingFilter->SetAlgorithm(mitk::pa::LinearSpectralUnmixingFilter::AlgortihmType::fullPivLu);\n \/\/m_SpectralUnmixingFilter->SetAlgorithm(mitk::pa::LinearSpectralUnmixingFilter::AlgortihmType::fullPivHouseholderQr);\n \/\/m_SpectralUnmixingFilter->SetAlgorithm(mitk::pa::LinearSpectralUnmixingFilter::AlgortihmType::test);\n\n \/\/Set wavelengths to filter\n for (unsigned int imageIndex = 0; imageIndex < m_inputWavelengths.size(); imageIndex++)\n {\n unsigned int wavelength = m_inputWavelengths[imageIndex];\n m_SpectralUnmixingFilter->AddWavelength(wavelength);\n }\n\n \/\/Set Chromophores to filter\n m_SpectralUnmixingFilter->AddChromophore(\n mitk::pa::SpectralUnmixingFilterBase::ChromophoreType::OXYGENATED_HEMOGLOBIN);\n m_SpectralUnmixingFilter->AddChromophore(\n mitk::pa::SpectralUnmixingFilterBase::ChromophoreType::DEOXYGENATED_HEMOGLOBIN);\n\n m_SpectralUnmixingFilter->Update();\n\n for (int i = 0; i < 2; ++i)\n {\n mitk::Image::Pointer output = m_SpectralUnmixingFilter->GetOutput(i);\n mitk::ImageReadAccessor readAccess(output);\n const float* inputDataArray = ((const float*)readAccess.GetData());\n auto pixel = inputDataArray[0];\n \/*For pixel values and results look at: [...]mitk-superbuild\\MITK-build\\Modules\\PhotoacousticsLib\\test\\*\/\n CPPUNIT_ASSERT(std::abs(pixel - m_CorrectResult[i])<threshold);\n }\n MITK_INFO << \"FILTER TEST SUCCESFULL :)\";\n }\n\n void tearDown() override\n {\n m_SpectralUnmixingFilter = nullptr;\n inputImage = nullptr;\n m_inputWavelengths.clear();\n m_CorrectResult.clear();\n MITK_INFO << \"tearDown ... [DONE]\";\n }\n};\n\nMITK_TEST_SUITE_REGISTRATION(mitkSpectralUnmixing)\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__pp2016(Bool_t isMC = kFALSE,\n AliPID::EParticleType part = AliPID::kProton,\n Int_t pdgCode = 2212,\n TString tskname = \"proton\",\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(\"AddTaskProtonYield__pp5TeV\", \"This task requires an input event handler\");\n return 0x0;\n }\n\n tskname.Append(Form(\"%s\",suffix.Data()));\n\n AliAnalysisTaskNucleiYield *task = new AliAnalysisTaskNucleiYield(tskname);\n\n task->SetParticleType(part);\n task->SetPDG(pdgCode);\n task->SetIsMC(isMC);\n task->SetDCABins(80,-0.5,0.5);\n\ttask->SaveTrees();\n\n task->SetRequireTPCpidSigmas(3.f);\n float cent[14] = {-5.f,0.f,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 task->SetCentBins(13, cent);\n task->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 task->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 task->SetDCABins(52,dcabins);\n\n mgr->AddTask(task);\n\n TString output = \"AnalysisResults.root\";\n AliAnalysisDataContainer *cont = mgr->CreateContainer(Form(\"nuclei_%s\",tskname.Data()),\n TList::Class(),\n AliAnalysisManager::kOutputContainer,\n output.Data());\n mgr->ConnectInput (task, 0, mgr->GetCommonInputContainer());\n mgr->ConnectOutput (task, 1, cont);\n return task;\n}\n<commit_msg>Fix addrtask for proton tree<commit_after>#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_pp5TeV(Bool_t isMC = kFALSE,\n AliPID::EParticleType part = AliPID::kProton,\n Int_t pdgCode = 2212,\n TString tskname = \"proton\",\n TString suffix = \"\") {\n\n \/\/ Get the current analysis manager\n AliAnalysisManager *mgr = AliAnalysisManager::GetAnalysisManager();\n if (!mgr) {\n Error(\"AddTaskProtonYield_pp5TeV\", \"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(\"AddTaskProtonYield_pp5TeV\", \"This task requires an input event handler\");\n return 0x0;\n }\n\n tskname.Append(Form(\"%s\",suffix.Data()));\n\n AliAnalysisTaskNucleiYield *task = new AliAnalysisTaskNucleiYield(tskname);\n\n task->SetParticleType(part);\n task->SetPDG(pdgCode);\n task->SetIsMC(isMC);\n task->SetDCABins(80,-0.5,0.5);\n\ttask->SaveTrees();\n\n task->SetRequireTPCpidSigmas(3.f);\n float cent[14] = {-5.f,0.f,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 task->SetCentBins(13, cent);\n task->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 task->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 task->SetDCABins(52,dcabins);\n\n mgr->AddTask(task);\n\n TString output = \"AnalysisResults.root\";\n AliAnalysisDataContainer *cont = mgr->CreateContainer(Form(\"nuclei_%s\",tskname.Data()),\n TList::Class(),\n AliAnalysisManager::kOutputContainer,\n output.Data());\n mgr->ConnectInput (task, 0, mgr->GetCommonInputContainer());\n mgr->ConnectOutput (task, 1, cont);\n return task;\n}\n<|endoftext|>"} {"text":"<commit_before>\/**************************************************************************\n * Copyright(c) 1998-2015, 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, proviyaded 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 purapose. It is *\n * provided \"as is\" without express or implied warranty. *\n **************************************************************************\/\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ \/\/\n\/\/ This analysis extracts information into TTree for pT-spectra of deuterons \/\/\n\/\/ Based on AliAnalysisDeuteronpA task of J. Anielski for deuteron analysis \/\/\n\/\/ and AliAnalysisTaskExtractV0 by D. Chinellato for TTree interface \/\/\n\/\/ L.Barnby October 2015 \/\/\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n#include \"TTree.h\"\n#include \"TH1F.h\"\n#include \"TList.h\"\n#include \"TChain.h\"\n\n#include \"AliAnalysisTaskSE.h\"\n#include \"AliAnalysisManager.h\"\n\n#include \"AliPID.h\"\n#include \"AliESDtrackCuts.h\"\n#include \"AliESDVertex.h\"\n#include \"AliESDEvent.h\"\n#include \"AliESDInputHandler.h\"\n#include \"AliESDtrack.h\"\n#include \"AliESDpid.h\"\n#include \"AliCentrality.h\"\n#include \"AliESDUtils.h\"\n#include \"AliMultiplicity.h\"\n\n#include \"AliMCEventHandler.h\"\n#include \"AliMCEvent.h\"\n#include \"AliStack.h\"\n#include \"AliLog.h\"\n#include \"AliAnalysisUtils.h\"\n\n#include \"AliAnalysisDeuteronTree.h\"\n\nClassImp(AliAnalysisDeuteronTree)\n\n\/\/________________________________________________________________________\nAliAnalysisDeuteronTree::AliAnalysisDeuteronTree()\n: AliAnalysisTaskSE(), fListHist(0), fTree(0),fESDtrackCuts(0),fPIDResponse(0),\nfMCtrue(0),\nfRapCMSpA(0),\nfUtils(0),\nfTimeStamp(0),\nfCentrality(0),\nfPtCor(0),\nfPt(0),\nfMom(0),\nfRapd(0),\nfNsigmaTPCd(0),\nfNsigmaTOFd(0),\nfDcaXYd(0),\nfMcCode(0),\nfNpion(0),\nfhZVertex(0),\nfhCentrality(0),\nfhNsigmaTPCvsMom(0),\nfhNsigmaTOFvsMom(0),\nfMomCorrConstA(0),\nfMomCorrConstB(0),\nfMomCorrPower(0),\nfMinPtCut(0),\nfMinPtTOFCut(0),\nfNsigmaTOFdMax(0),\nfNsigmaTOFdMin(0),\nfNsigmaTPCdMax(0),\nfNsigmaTPCdMin(0)\n{\n \/\/Default constructor\n}\n\n\/\/________________________________________________________________________\nAliAnalysisDeuteronTree::AliAnalysisDeuteronTree(const char *name)\n: AliAnalysisTaskSE(name), fListHist(0), fTree(0), fESDtrackCuts(0),fPIDResponse(0),\nfMCtrue(0),\nfRapCMSpA(0),\nfUtils(0),\nfTimeStamp(0),\nfCentrality(0),\nfPtCor(0),\nfPt(0),\nfMom(0),\nfRapd(0),\nfNsigmaTPCd(0),\nfNsigmaTOFd(0),\nfDcaXYd(0),\nfMcCode(0),\nfNpion(0),\nfhZVertex(0),\nfhCentrality(0),\nfhNsigmaTPCvsMom(0),\nfhNsigmaTOFvsMom(0),\nfMomCorrConstA(0),\nfMomCorrConstB(0),\nfMomCorrPower(0),\nfMinPtCut(0),\nfMinPtTOFCut(0),\nfNsigmaTOFdMax(0),\nfNsigmaTOFdMin(0),\nfNsigmaTPCdMax(0),\nfNsigmaTPCdMin(0)\n{\n \/\/Standard constructor\n fMCtrue = kFALSE;\n fRapCMSpA = kTRUE;\n\n \/\/fESDtrackCuts = new AliESDtrackCuts(\"AliESDtrackCuts\",\"AliESDtrackCuts\");\n Initialize();\n \n \/\/AliInfo(\"About to define TChain input\");\n \/\/DefineInput(0, TChain::Class());\n \n AliInfo(\"About to define TList output\");\n DefineOutput(1, TList::Class());\n\n AliInfo(\"About to define TTree output\");\n DefineOutput(2, TTree::Class());\n \n AliInfo(\"Constructor Finished\");\n}\n\n\/\/________________________________________________________________________\nvoid AliAnalysisDeuteronTree::Initialize()\n{\n \/\/\n \/\/ updating parameters in case of changes\n \/\/\n AliInfo(\"Initialization started\");\n \n fESDtrackCuts = AliESDtrackCuts::GetStandardITSTPCTrackCuts2011(kFALSE,kTRUE);\n if (fESDtrackCuts == 0x0) {\n AliWarning(\"No ESDtrackCuts\");\n }\n fESDtrackCuts->SetMaxDCAToVertexXY(3);\n fESDtrackCuts->SetMaxDCAToVertexZ(2);\n fESDtrackCuts->SetEtaRange(-0.9,0.9);\n \/\/\n \n \/\/ Momentum correction\n fMomCorrConstA = 0.333303;\n fMomCorrConstB = 0.651111;\n fMomCorrPower = 5.27268;\n \n fMinPtCut = 0.5;\n fMinPtTOFCut = 1.0;\n fNsigmaTOFdMax = 5.0;\n fNsigmaTOFdMin = -5.0;\n fNsigmaTPCdMax = 5.0;\n fNsigmaTPCdMin = -5.0;\n\n AliInfo(\"Initialization complete\");\n}\n\n\/\/________________________________________________________________________\nAliAnalysisDeuteronTree::~AliAnalysisDeuteronTree()\n{\n if (fListHist) {\n delete fListHist;\n fListHist = 0x0;\n }\n if (fTree) {\n delete fTree;\n fTree = 0x0;\n }\n \/\/cleanup esd track cuts object too...\n if (fESDtrackCuts) {\n delete fESDtrackCuts;\n fESDtrackCuts = 0x0;\n }\n if (fPIDResponse) {\n delete fPIDResponse;\n fPIDResponse = 0x0;\n }\n if (fUtils) {\n delete fUtils;\n fUtils = 0x0;\n }\n\n}\n\n\/\/________________________________________________________________________\nvoid AliAnalysisDeuteronTree::UserCreateOutputObjects()\n{\n AliInfo(\"Creation started\");\n \n \/\/ Proper handling of output objects (\"magic\" lines)\n \/\/ For file-resident Tree\n OpenFile(2);\n fTree = new TTree(\"fTree\",\"dCandidates\");\n\n fListHist = new TList();\n fListHist->SetOwner();\n\n \/\/ Get PID response object\n AliAnalysisManager *man=AliAnalysisManager::GetAnalysisManager();\n if(!man)\n AliFatal(\"Could not find manager\");\n AliInputEventHandler* inputHandler = dynamic_cast<AliInputEventHandler*> (man->GetInputEventHandler());\n if(!inputHandler)\n AliFatal(\"No input event handler\");\n fPIDResponse = dynamic_cast<AliPIDResponse *>(inputHandler->GetPIDResponse());\n if (!fPIDResponse)\n AliFatal(\"PIDResponse object was not created\"); \/\/ Escalated to fatal. Task is unusable without PID response.\n \n \/\/Create analysis utils for event selection and pileup rejection\n fUtils = new AliAnalysisUtils();\n fUtils->SetCutOnZVertexSPD(kFALSE);\n\n \n \/\/ histograms\n fhZVertex = new TH1F(\"hZVertex\",\"Vertex Z position;Z_{VTX} (cm);Counts\/0.25 cm\",100,-25,25);\n fListHist->Add(fhZVertex);\n fhCentrality = new TH1F(\"hCentrality\",\";Centrality(V0A) %;Counts\/1%\",100,0,100);\n fListHist->Add(fhCentrality);\n\n fhNsigmaTPCvsMom = new TH2F(\"hNsigmaTPCvsMom\",\"n_{#sigma} TPC distribution;p (GeV\/#it{c});n_{#sigma}^deuteron\",300,0.0,6.0,200,-15.0,5);\n fListHist->Add(fhNsigmaTPCvsMom);\n\n fhNsigmaTOFvsMom = new TH2F(\"hNsigmaTOFvsMom\",\"n_{#sigma} TOF distribution;p (GeV\/#it{c});n_{#sigma}^deuteron\",300,0.0,6.0,200,-15.0,5);\n fListHist->Add(fhNsigmaTOFvsMom);\n\n \/\/ fTree Branch definitions\n fTree->Branch(\"fCentrality\",&fCentrality,\"fCentrality\/F\");\n fTree->Branch(\"fPtCor\",&fPtCor,\"fPtCor\/F\");\n fTree->Branch(\"fPt\",&fPt,\"fPt\/F\");\n fTree->Branch(\"fMom\",&fMom,\"fMom\/F\");\n fTree->Branch(\"fRapd\",&fRapd,\"fRapd\/F\");\n fTree->Branch(\"fNsigmaTPCd\",&fNsigmaTPCd,\"fNsigmaTPCd\/F\");\n fTree->Branch(\"fNsigmaTOFd\",&fNsigmaTOFd,\"fNsigmaTOFd\/F\");\n fTree->Branch(\"fDcaXYd\",&fDcaXYd,\"fDcaXYd\/F\");\n fTree->Branch(\"fMcCode\",&fMcCode,\"fMcCode\/I\");\n fTree->Branch(\"fNpion\",&fNpion,\"fNpion\/I\");\n PostData(1, fListHist);\n PostData(2, fTree);\n\n AliInfo(\"Creation finished\");\n}\n\n\/\/________________________________________________________________________\nvoid AliAnalysisDeuteronTree::UserExec(Option_t *option){\n\n AliInfo(\"UserExec started\");\n\n AliESDEvent *lESDevent = 0x0;\n lESDevent = dynamic_cast<AliESDEvent*>( InputEvent() );\n if (!lESDevent) {\n AliWarning(\"ERROR: lESDevent not available \\n\");\n return;\n }\n \n \n AliCentrality *centrality = lESDevent->GetCentrality();\n \n \/\/ Later add code for accessing MC information\n \/\/ AliMCEventHandler, AliMCEvent, AliStack\n \n \/\/ Event checks\n \/\/first event in chunck --> continue\n if(fUtils->IsFirstEventInChunk(lESDevent)) {\n PostData(1, fListHist);\n PostData(2, fTree);\n return;\n }\n \/\/check for pileup\n if (fUtils->IsPileUpEvent(lESDevent)){\n PostData(1, fListHist);\n PostData(2, fTree);\n return;\n }\n \/\/vertex cuts\n Bool_t isVtxOk = kTRUE;\n if(!fUtils->IsVertexSelected2013pA(lESDevent)) isVtxOk = kFALSE;\n\n if (!fESDtrackCuts) {\n AliFatal(\"ERROR: fESDtrackCuts not available\"); \/\/ No sense to continue without track cuts\n return;\n }\n \n \/\/ Physics selection should be taken care of by analysis manager\n \/\/ and task->SetCollisionsCandidates(AliVEvent::kMB) in the macro\n \n const AliESDVertex *vertex = lESDevent->GetPrimaryVertex();\n if (vertex && isVtxOk) fhZVertex->Fill(vertex->GetZ());\n \n fCentrality = centrality->GetCentralityPercentile(\"V0A\");\n fhCentrality->Fill(fCentrality);\n \n fTimeStamp = lESDevent->GetTimeStamp();\n \n Float_t dca[2], cov[3]; \/\/ dca_xy, dca_z, sigma_xy, sigma_xy_z, sigma_z for the vertex cut\n Double_t lTOFNsigma, lTPCNsigma, lEnergyDeuteron, lPz;\n Int_t lNpion;\n \n for (Int_t i=0;i<lESDevent->GetNumberOfTracks();++i) {\n \/\/\n AliESDtrack *track = lESDevent->GetTrack(i);\n \n if (!track->GetInnerParam()) continue;\n \n Double_t ptot = track->GetInnerParam()->GetP(); \/\/ momentum for dEdx determination\n fMom=ptot*track->Charge(); \/\/ Shouldn't this be corrected for the different mass assumption as below\n \/\/ i.e find uncorrected pz, correct pt and then recombine to get corrected ptot?\n \n \/\/\n \/\/ momentum correction for different mass assumption in tracking\n \/\/\n fPt = track->Pt();\n fPtCor = track->Pt()\/(1 - fMomCorrConstA\/TMath::Power(track->Pt() + fMomCorrConstB, fMomCorrPower));\n \n track->GetImpactParameters(dca, cov);\n if (!fESDtrackCuts->AcceptTrack(track)) continue;\n if (track->Pt()< fMinPtCut) continue;\n \n AliPIDResponse::EDetPidStatus lETOFStatus, lETPCStatus;\n lETOFStatus = fPIDResponse->NumberOfSigmas(AliPIDResponse::kTOF, track, AliPID::kDeuteron, lTOFNsigma);\n fNsigmaTOFd = -999;\n if(lETOFStatus==AliPIDResponse::kDetPidOk) fNsigmaTOFd = lTOFNsigma;\n \n lETPCStatus = fPIDResponse->NumberOfSigmas(AliPIDResponse::kTPC, track, AliPID::kDeuteron, lTPCNsigma);\n fNsigmaTPCd = -999;\n if(lETPCStatus==AliPIDResponse::kDetPidOk) fNsigmaTPCd = lTPCNsigma;\n \n fDcaXYd = dca[0];\n \n lPz = TMath::Sqrt(ptot*ptot - fPt*fPt);\n lEnergyDeuteron = TMath::Sqrt(fPt*fPt + lPz*lPz +\n AliPID::ParticleMass(AliPID::kDeuteron)*AliPID::ParticleMass(AliPID::kDeuteron));\n fRapd = 0.5*TMath::Log((lEnergyDeuteron + lPz)\/(lEnergyDeuteron - lPz));\n fMcCode = 0;\n \n fhNsigmaTPCvsMom->Fill(ptot,fNsigmaTPCd);\n fhNsigmaTOFvsMom->Fill(track->GetP(),fNsigmaTOFd);\n \n \/\/ Eventually need some selections here to stop the tree getting too big (because of all the non-deuterons)\n if (fNsigmaTPCd < fNsigmaTPCdMin || fNsigmaTPCd > fNsigmaTPCdMax) continue; \/\/ within TPC dEd\/dx\n if (fPt > fMinPtTOFCut && (fNsigmaTOFd > fNsigmaTOFdMin && fNsigmaTOFd < fNsigmaTOFdMax)) {\n \/\/ Greater than a certain pt, must also satisfy TOF Nsigma\n lNpion = 0;\n \/\/ Only in this case loop to get pions\n for (Int_t j=0; j<lESDevent->GetNumberOfTracks();++j) {\n if (i!=j) { \/\/ The deuteron candidate should not be used as the pion\n AliESDtrack *pion = lESDevent->GetTrack(j);\n if (!fESDtrackCuts->AcceptTrack(pion)) continue;\n if (!pion->GetInnerParam()) continue;\n lETPCStatus = fPIDResponse->NumberOfSigmas(AliPIDResponse::kTPC, pion, AliPID::kPion, lTPCNsigma);\n if (TMath::Abs(lTPCNsigma)<3.5) {\n lNpion++;\n }\n }\n\n }\n fNpion = lNpion;\n fTree->Fill();\n }\n \n } \/\/ End track loop\n \n \/\/ Output data\n PostData(1, fListHist);\n PostData(2, fTree);\n return;\n \n}\n\nvoid AliAnalysisDeuteronTree::Terminate(Option_t *)\n{\n \/\/ Draw control histograms (if any)\n}<commit_msg>Fix logic for selecting d candidates<commit_after>\/**************************************************************************\n * Copyright(c) 1998-2015, 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, proviyaded 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 purapose. It is *\n * provided \"as is\" without express or implied warranty. *\n **************************************************************************\/\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ \/\/\n\/\/ This analysis extracts information into TTree for pT-spectra of deuterons \/\/\n\/\/ Based on AliAnalysisDeuteronpA task of J. Anielski for deuteron analysis \/\/\n\/\/ and AliAnalysisTaskExtractV0 by D. Chinellato for TTree interface \/\/\n\/\/ L.Barnby October 2015 \/\/\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n#include \"TTree.h\"\n#include \"TH1F.h\"\n#include \"TList.h\"\n#include \"TChain.h\"\n\n#include \"AliAnalysisTaskSE.h\"\n#include \"AliAnalysisManager.h\"\n\n#include \"AliPID.h\"\n#include \"AliESDtrackCuts.h\"\n#include \"AliESDVertex.h\"\n#include \"AliESDEvent.h\"\n#include \"AliESDInputHandler.h\"\n#include \"AliESDtrack.h\"\n#include \"AliESDpid.h\"\n#include \"AliCentrality.h\"\n#include \"AliESDUtils.h\"\n#include \"AliMultiplicity.h\"\n\n#include \"AliMCEventHandler.h\"\n#include \"AliMCEvent.h\"\n#include \"AliStack.h\"\n#include \"AliLog.h\"\n#include \"AliAnalysisUtils.h\"\n\n#include \"AliAnalysisDeuteronTree.h\"\n\nClassImp(AliAnalysisDeuteronTree)\n\n\/\/________________________________________________________________________\nAliAnalysisDeuteronTree::AliAnalysisDeuteronTree()\n: AliAnalysisTaskSE(), fListHist(0), fTree(0),fESDtrackCuts(0),fPIDResponse(0),\nfMCtrue(0),\nfRapCMSpA(0),\nfUtils(0),\nfTimeStamp(0),\nfCentrality(0),\nfPtCor(0),\nfPt(0),\nfMom(0),\nfRapd(0),\nfNsigmaTPCd(0),\nfNsigmaTOFd(0),\nfDcaXYd(0),\nfMcCode(0),\nfNpion(0),\nfhZVertex(0),\nfhCentrality(0),\nfhNsigmaTPCvsMom(0),\nfhNsigmaTOFvsMom(0),\nfMomCorrConstA(0),\nfMomCorrConstB(0),\nfMomCorrPower(0),\nfMinPtCut(0),\nfMinPtTOFCut(0),\nfNsigmaTOFdMax(0),\nfNsigmaTOFdMin(0),\nfNsigmaTPCdMax(0),\nfNsigmaTPCdMin(0)\n{\n \/\/Default constructor\n}\n\n\/\/________________________________________________________________________\nAliAnalysisDeuteronTree::AliAnalysisDeuteronTree(const char *name)\n: AliAnalysisTaskSE(name), fListHist(0), fTree(0), fESDtrackCuts(0),fPIDResponse(0),\nfMCtrue(0),\nfRapCMSpA(0),\nfUtils(0),\nfTimeStamp(0),\nfCentrality(0),\nfPtCor(0),\nfPt(0),\nfMom(0),\nfRapd(0),\nfNsigmaTPCd(0),\nfNsigmaTOFd(0),\nfDcaXYd(0),\nfMcCode(0),\nfNpion(0),\nfhZVertex(0),\nfhCentrality(0),\nfhNsigmaTPCvsMom(0),\nfhNsigmaTOFvsMom(0),\nfMomCorrConstA(0),\nfMomCorrConstB(0),\nfMomCorrPower(0),\nfMinPtCut(0),\nfMinPtTOFCut(0),\nfNsigmaTOFdMax(0),\nfNsigmaTOFdMin(0),\nfNsigmaTPCdMax(0),\nfNsigmaTPCdMin(0)\n{\n \/\/Standard constructor\n fMCtrue = kFALSE;\n fRapCMSpA = kTRUE;\n\n \/\/fESDtrackCuts = new AliESDtrackCuts(\"AliESDtrackCuts\",\"AliESDtrackCuts\");\n Initialize();\n \n \/\/AliInfo(\"About to define TChain input\");\n \/\/DefineInput(0, TChain::Class());\n \n AliInfo(\"About to define TList output\");\n DefineOutput(1, TList::Class());\n\n AliInfo(\"About to define TTree output\");\n DefineOutput(2, TTree::Class());\n \n AliInfo(\"Constructor Finished\");\n}\n\n\/\/________________________________________________________________________\nvoid AliAnalysisDeuteronTree::Initialize()\n{\n \/\/\n \/\/ updating parameters in case of changes\n \/\/\n AliInfo(\"Initialization started\");\n \n fESDtrackCuts = AliESDtrackCuts::GetStandardITSTPCTrackCuts2011(kFALSE,kTRUE);\n if (fESDtrackCuts == 0x0) {\n AliWarning(\"No ESDtrackCuts\");\n }\n fESDtrackCuts->SetMaxDCAToVertexXY(3);\n fESDtrackCuts->SetMaxDCAToVertexZ(2);\n fESDtrackCuts->SetEtaRange(-0.9,0.9);\n \/\/\n \n \/\/ Momentum correction\n fMomCorrConstA = 0.333303;\n fMomCorrConstB = 0.651111;\n fMomCorrPower = 5.27268;\n \n fMinPtCut = 0.5;\n fMinPtTOFCut = 1.0;\n fNsigmaTOFdMax = 5.0;\n fNsigmaTOFdMin = -5.0;\n fNsigmaTPCdMax = 5.0;\n fNsigmaTPCdMin = -5.0;\n\n AliInfo(\"Initialization complete\");\n}\n\n\/\/________________________________________________________________________\nAliAnalysisDeuteronTree::~AliAnalysisDeuteronTree()\n{\n if (fListHist) {\n delete fListHist;\n fListHist = 0x0;\n }\n if (fTree) {\n delete fTree;\n fTree = 0x0;\n }\n \/\/cleanup esd track cuts object too...\n if (fESDtrackCuts) {\n delete fESDtrackCuts;\n fESDtrackCuts = 0x0;\n }\n if (fPIDResponse) {\n delete fPIDResponse;\n fPIDResponse = 0x0;\n }\n if (fUtils) {\n delete fUtils;\n fUtils = 0x0;\n }\n\n}\n\n\/\/________________________________________________________________________\nvoid AliAnalysisDeuteronTree::UserCreateOutputObjects()\n{\n AliInfo(\"Creation started\");\n \n \/\/ Proper handling of output objects (\"magic\" lines)\n \/\/ For file-resident Tree\n OpenFile(2);\n fTree = new TTree(\"fTree\",\"dCandidates\");\n\n fListHist = new TList();\n fListHist->SetOwner();\n\n \/\/ Get PID response object\n AliAnalysisManager *man=AliAnalysisManager::GetAnalysisManager();\n if(!man)\n AliFatal(\"Could not find manager\");\n AliInputEventHandler* inputHandler = dynamic_cast<AliInputEventHandler*> (man->GetInputEventHandler());\n if(!inputHandler)\n AliFatal(\"No input event handler\");\n fPIDResponse = dynamic_cast<AliPIDResponse *>(inputHandler->GetPIDResponse());\n if (!fPIDResponse)\n AliFatal(\"PIDResponse object was not created\"); \/\/ Escalated to fatal. Task is unusable without PID response.\n \n \/\/Create analysis utils for event selection and pileup rejection\n fUtils = new AliAnalysisUtils();\n fUtils->SetCutOnZVertexSPD(kFALSE);\n\n \n \/\/ histograms\n fhZVertex = new TH1F(\"hZVertex\",\"Vertex Z position;Z_{VTX} (cm);Counts\/0.25 cm\",100,-25,25);\n fListHist->Add(fhZVertex);\n fhCentrality = new TH1F(\"hCentrality\",\";Centrality(V0A) %;Counts\/1%\",100,0,100);\n fListHist->Add(fhCentrality);\n\n fhNsigmaTPCvsMom = new TH2F(\"hNsigmaTPCvsMom\",\"n_{#sigma} TPC distribution;p (GeV\/#it{c});n_{#sigma}^deuteron\",300,0.0,6.0,200,-15.0,5);\n fListHist->Add(fhNsigmaTPCvsMom);\n\n fhNsigmaTOFvsMom = new TH2F(\"hNsigmaTOFvsMom\",\"n_{#sigma} TOF distribution;p (GeV\/#it{c});n_{#sigma}^deuteron\",300,0.0,6.0,200,-15.0,5);\n fListHist->Add(fhNsigmaTOFvsMom);\n\n \/\/ fTree Branch definitions\n fTree->Branch(\"fCentrality\",&fCentrality,\"fCentrality\/F\");\n fTree->Branch(\"fPtCor\",&fPtCor,\"fPtCor\/F\");\n fTree->Branch(\"fPt\",&fPt,\"fPt\/F\");\n fTree->Branch(\"fMom\",&fMom,\"fMom\/F\");\n fTree->Branch(\"fRapd\",&fRapd,\"fRapd\/F\");\n fTree->Branch(\"fNsigmaTPCd\",&fNsigmaTPCd,\"fNsigmaTPCd\/F\");\n fTree->Branch(\"fNsigmaTOFd\",&fNsigmaTOFd,\"fNsigmaTOFd\/F\");\n fTree->Branch(\"fDcaXYd\",&fDcaXYd,\"fDcaXYd\/F\");\n fTree->Branch(\"fMcCode\",&fMcCode,\"fMcCode\/I\");\n fTree->Branch(\"fNpion\",&fNpion,\"fNpion\/I\");\n PostData(1, fListHist);\n PostData(2, fTree);\n\n AliInfo(\"Creation finished\");\n}\n\n\/\/________________________________________________________________________\nvoid AliAnalysisDeuteronTree::UserExec(Option_t *option){\n\n AliInfo(\"UserExec started\");\n\n AliESDEvent *lESDevent = 0x0;\n lESDevent = dynamic_cast<AliESDEvent*>( InputEvent() );\n if (!lESDevent) {\n AliWarning(\"ERROR: lESDevent not available \\n\");\n return;\n }\n \n \n AliCentrality *centrality = lESDevent->GetCentrality();\n \n \/\/ Later add code for accessing MC information\n \/\/ AliMCEventHandler, AliMCEvent, AliStack\n \n \/\/ Event checks\n \/\/first event in chunck --> continue\n if(fUtils->IsFirstEventInChunk(lESDevent)) {\n PostData(1, fListHist);\n PostData(2, fTree);\n return;\n }\n \/\/check for pileup\n if (fUtils->IsPileUpEvent(lESDevent)){\n PostData(1, fListHist);\n PostData(2, fTree);\n return;\n }\n \/\/vertex cuts\n Bool_t isVtxOk = kTRUE;\n if(!fUtils->IsVertexSelected2013pA(lESDevent)) isVtxOk = kFALSE;\n\n if (!fESDtrackCuts) {\n AliFatal(\"ERROR: fESDtrackCuts not available\"); \/\/ No sense to continue without track cuts\n return;\n }\n \n \/\/ Physics selection should be taken care of by analysis manager\n \/\/ and task->SetCollisionsCandidates(AliVEvent::kMB) in the macro\n \n const AliESDVertex *vertex = lESDevent->GetPrimaryVertex();\n if (vertex && isVtxOk) fhZVertex->Fill(vertex->GetZ());\n \n fCentrality = centrality->GetCentralityPercentile(\"V0A\");\n fhCentrality->Fill(fCentrality);\n \n fTimeStamp = lESDevent->GetTimeStamp();\n \n Float_t dca[2], cov[3]; \/\/ dca_xy, dca_z, sigma_xy, sigma_xy_z, sigma_z for the vertex cut\n Double_t lTOFNsigma, lTPCNsigma, lEnergyDeuteron, lPz;\n Int_t lNpion;\n \n for (Int_t i=0;i<lESDevent->GetNumberOfTracks();++i) {\n \/\/\n AliESDtrack *track = lESDevent->GetTrack(i);\n \n if (!track->GetInnerParam()) continue;\n \n Double_t ptot = track->GetInnerParam()->GetP(); \/\/ momentum for dEdx determination\n fMom=ptot*track->Charge(); \/\/ Shouldn't this be corrected for the different mass assumption as below\n \/\/ i.e find uncorrected pz, correct pt and then recombine to get corrected ptot?\n \n \/\/\n \/\/ momentum correction for different mass assumption in tracking\n \/\/\n fPt = track->Pt();\n fPtCor = track->Pt()\/(1 - fMomCorrConstA\/TMath::Power(track->Pt() + fMomCorrConstB, fMomCorrPower));\n \n track->GetImpactParameters(dca, cov);\n if (!fESDtrackCuts->AcceptTrack(track)) continue;\n if (track->Pt()< fMinPtCut) continue;\n \n AliPIDResponse::EDetPidStatus lETOFStatus, lETPCStatus;\n lETOFStatus = fPIDResponse->NumberOfSigmas(AliPIDResponse::kTOF, track, AliPID::kDeuteron, lTOFNsigma);\n fNsigmaTOFd = -999;\n if(lETOFStatus==AliPIDResponse::kDetPidOk) fNsigmaTOFd = lTOFNsigma;\n \n lETPCStatus = fPIDResponse->NumberOfSigmas(AliPIDResponse::kTPC, track, AliPID::kDeuteron, lTPCNsigma);\n fNsigmaTPCd = -999;\n if(lETPCStatus==AliPIDResponse::kDetPidOk) fNsigmaTPCd = lTPCNsigma;\n \n fDcaXYd = dca[0];\n \n lPz = TMath::Sqrt(ptot*ptot - fPt*fPt);\n lEnergyDeuteron = TMath::Sqrt(fPt*fPt + lPz*lPz +\n AliPID::ParticleMass(AliPID::kDeuteron)*AliPID::ParticleMass(AliPID::kDeuteron));\n fRapd = 0.5*TMath::Log((lEnergyDeuteron + lPz)\/(lEnergyDeuteron - lPz));\n fMcCode = 0;\n \n fhNsigmaTPCvsMom->Fill(ptot,fNsigmaTPCd);\n fhNsigmaTOFvsMom->Fill(track->GetP(),fNsigmaTOFd);\n \n \/\/ Need some selections here to stop the tree getting too big (because of all the non-deuterons)\n \/\/ outside TPC dEd\/dx band\n if (fNsigmaTPCd < fNsigmaTPCdMin || fNsigmaTPCd > fNsigmaTPCdMax) continue;\n \/\/ over TOF pt threshold and outside TOF band\n if ((fPt > fMinPtTOFCut && (fNsigmaTOFd < fNsigmaTOFdMin || fNsigmaTOFd > fNsigmaTOFdMax))) continue;\n\n \/\/ Only in this case loop to get pions\n lNpion = 0;\n for (Int_t j=0; j<lESDevent->GetNumberOfTracks();++j) {\n if (i!=j) { \/\/ The deuteron candidate should not be used as the pion\n AliESDtrack *pion = lESDevent->GetTrack(j);\n if (!fESDtrackCuts->AcceptTrack(pion)) continue;\n if (!pion->GetInnerParam()) continue;\n lETPCStatus = fPIDResponse->NumberOfSigmas(AliPIDResponse::kTPC, pion, AliPID::kPion, lTPCNsigma);\n if (TMath::Abs(lTPCNsigma)<3.5) {\n lNpion++;\n }\n }\n\n }\n fNpion = lNpion;\n fTree->Fill();\n \n \n } \/\/ End track loop\n \n \/\/ Output data\n PostData(1, fListHist);\n PostData(2, fTree);\n return;\n \n}\n\nvoid AliAnalysisDeuteronTree::Terminate(Option_t *)\n{\n \/\/ Draw control histograms (if any)\n}<|endoftext|>"} {"text":"<commit_before>#define NDEBUG\n\n#include <QLinkedList>\n#include <QVector>\n#include <QSet>\n#include <QMap>\n#include <QHash>\n\n#include <stdlib.h>\n#include <stdio.h>\n#include <stdbool.h>\n#include <string.h>\n#include <sys\/types.h>\n#include <sys\/resource.h>\n#include <sys\/time.h>\n\nusing namespace std;\n\nunsigned long g_result;\n\nstatic unsigned long long\ncputime (void)\n{\n struct rusage rus;\n getrusage (0, &rus);\n return rus.ru_utime.tv_sec * 1000000ULL + rus.ru_utime.tv_usec;\n}\n\nstatic unsigned int randValue = 0;\nstatic void rand_init(void)\n{\n randValue = 0;\n}\nstatic unsigned int rand_get(void)\n{\n randValue = randValue * 31421U + 6927U;\n return randValue;\n}\n\nstatic void test_function(const char str[], size_t n, void (*func)(size_t))\n{\n unsigned long long start, end;\n \/\/ (*func)(n);\n start = cputime();\n (*func)(n);\n end = cputime();\n end = (end - start) \/ 1000U;\n printf (\"%s %Lu ms for n = %lu\\n\", str, end, n);\n}\n\n\/********************************************************************************************\/\n\nstatic void test_list(size_t n)\n{\n rand_init();\n QLinkedList<unsigned int> a1, a2;\n for(size_t i = 0; i < n; i++) {\n a1.push_back(rand_get() );\n a2.push_back(rand_get() );\n }\n unsigned int s = 0;\n for (QLinkedList<unsigned int>::const_iterator ci1 = a1.begin(), ci2 = a2.begin (); ci1 != a1.end(); ++ci1, ++ci2) {\n s += *ci1 * *ci2;\n }\n g_result = s;\n}\n\n\/********************************************************************************************\/\n\nstatic void test_array(size_t n)\n{\n rand_init();\n QVector<unsigned int> a1, a2;\n for(size_t i = 0; i < n; i++) {\n a1.push_back(rand_get() );\n a2.push_back(rand_get() );\n }\n unsigned int s = 0;\n for(unsigned long i = 0; i < n; i++) {\n s += a1[i] * a2[i];\n }\n g_result = s;\n}\n\n\/********************************************************************************************\/\n\n\/* NOTE: QSet doesn't perform full ordering. I can't find any container\n which is a set with total ordering within Qt. *\/\n#if 0\nstatic void test_rbtree(size_t n)\n{\n rand_init();\n QSet<unsigned long> tree;\n\n for (size_t i = 0; i < n; i++) {\n tree.insert(rand_get());\n }\n \n unsigned int s = 0;\n for (size_t i = 0; i < n; i++) {\n QSet<unsigned long>::iterator it = tree.find(rand_get());\n if (it != tree.end())\n s += *it;\n }\n g_result = s;\n}\n#endif\n\n\/********************************************************************************************\/\n\nstatic void\ntest_dict1(unsigned long n)\n{\n rand_init();\n QMap<unsigned long, unsigned long> dict;\n\n for (size_t i = 0; i < n; i++) {\n dict[rand_get()] = rand_get();\n }\n \n unsigned int s = 0;\n for (size_t i = 0; i < n; i++) {\n QMap<unsigned long, unsigned long>::iterator it = dict.find(rand_get());\n if (it != dict.end())\n s += it.value();\n }\n g_result = s;\n}\n\n\/********************************************************************************************\/\n\nstatic void\ntest_dict2(unsigned long n)\n{\n rand_init();\n QHash<unsigned long, unsigned long> dict;\n\n for (size_t i = 0; i < n; i++) {\n dict[rand_get()] = rand_get();\n }\n \n unsigned int s = 0;\n for (size_t i = 0; i < n; i++) {\n QHash<unsigned long, unsigned long>::iterator it = dict.find(rand_get());\n if (it != dict.end())\n s += it.value();\n }\n g_result = s;\n}\n\n\/********************************************************************************************\/\nstruct char_array_s {\n char a[256];\n char_array_s () { a[0] = 0 ; }\n char_array_s ( const char_array_s & other) { strcpy(a, other.a); }\n bool operator==(const char_array_s &other) const { return strcmp(a, other.a) == 0; }\n};\n\nuint qHash(const char_array_s &k)\n{\n size_t hash = 0;\n const char *s = k.a;\n while (*s) hash = hash * 31421 + (*s++) + 6927;\n return hash;\n};\n\nstatic void\ntest_dict_big(unsigned long n)\n{\n rand_init();\n QHash<char_array_s, char_array_s> dict;\n\n for (size_t i = 0; i < n; i++) {\n char_array_s s1, s2;\n sprintf(s1.a, \"%u\", rand_get());\n sprintf(s2.a, \"%u\", rand_get());\n dict[s1] = s2;\n }\n\n unsigned int s = 0;\n for (size_t i = 0; i < n; i++) {\n char_array_s s1;\n sprintf(s1.a, \"%u\", rand_get());\n QHash<char_array_s, char_array_s>::iterator it = dict.find(s1);\n if (it != dict.end())\n s ++;\n }\n g_result = s;\n}\n\n\/********************************************************************************************\/\n\nint main(int argc, const char *argv[])\n{\n int n = (argc > 1) ? atoi(argv[1]) : 0;\n if (n == 1)\n test_function(\"List time\",10000000, test_list);\n if (n == 2)\n test_function(\"Array time\", 100000000, test_array);\n \/* if (n == 3)\n test_function(\"Rbtree time\", 1000000, test_rbtree); *\/\n if (n == 4)\n test_function(\"Dict(m)time\", 1000000, test_dict1);\n if (n == 5)\n test_function(\"Dict(u)time\", 1000000, test_dict2);\n if (n == 6)\n test_function(\"DictB time\", 1000000, test_dict_big);\n}\n<commit_msg>Implement test_rbtree in bench-qt.<commit_after>#define NDEBUG\n\n#include <QLinkedList>\n#include <QVector>\n#include <QSet>\n#include <QMap>\n#include <QHash>\n\n#include <stdlib.h>\n#include <stdio.h>\n#include <stdbool.h>\n#include <string.h>\n#include <sys\/types.h>\n#include <sys\/resource.h>\n#include <sys\/time.h>\n\nusing namespace std;\n\nunsigned long g_result;\n\nstatic unsigned long long\ncputime (void)\n{\n struct rusage rus;\n getrusage (0, &rus);\n return rus.ru_utime.tv_sec * 1000000ULL + rus.ru_utime.tv_usec;\n}\n\nstatic unsigned int randValue = 0;\nstatic void rand_init(void)\n{\n randValue = 0;\n}\nstatic unsigned int rand_get(void)\n{\n randValue = randValue * 31421U + 6927U;\n return randValue;\n}\n\nstatic void test_function(const char str[], size_t n, void (*func)(size_t))\n{\n unsigned long long start, end;\n \/\/ (*func)(n);\n start = cputime();\n (*func)(n);\n end = cputime();\n end = (end - start) \/ 1000U;\n printf (\"%s %Lu ms for n = %lu\\n\", str, end, n);\n}\n\n\/********************************************************************************************\/\n\nstatic void test_list(size_t n)\n{\n rand_init();\n QLinkedList<unsigned int> a1, a2;\n for(size_t i = 0; i < n; i++) {\n a1.push_back(rand_get() );\n a2.push_back(rand_get() );\n }\n unsigned int s = 0;\n for (QLinkedList<unsigned int>::const_iterator ci1 = a1.begin(), ci2 = a2.begin (); ci1 != a1.end(); ++ci1, ++ci2) {\n s += *ci1 * *ci2;\n }\n g_result = s;\n}\n\n\/********************************************************************************************\/\n\nstatic void test_array(size_t n)\n{\n rand_init();\n QVector<unsigned int> a1, a2;\n for(size_t i = 0; i < n; i++) {\n a1.push_back(rand_get() );\n a2.push_back(rand_get() );\n }\n unsigned int s = 0;\n for(unsigned long i = 0; i < n; i++) {\n s += a1[i] * a2[i];\n }\n g_result = s;\n}\n\n\/********************************************************************************************\/\n\n\/* NOTE: QSet doesn't perform full ordering. I can't find any container\n which is a set with total ordering within Qt. So we have to fake it. *\/\nstatic void test_rbtree(size_t n)\n{\n rand_init();\n QMap<unsigned long, QHashDummyValue> tree;\n\n for (size_t i = 0; i < n; i++) {\n tree[rand_get()] = QHashDummyValue();\n }\n \n unsigned int s = 0;\n for (size_t i = 0; i < n; i++) {\n QMap<unsigned long, QHashDummyValue>::iterator it = tree.find(rand_get());\n if (it != tree.end())\n s += it.key();\n }\n g_result = s;\n}\n\n\/********************************************************************************************\/\n\nstatic void\ntest_dict1(unsigned long n)\n{\n rand_init();\n QMap<unsigned long, unsigned long> dict;\n\n for (size_t i = 0; i < n; i++) {\n dict[rand_get()] = rand_get();\n }\n \n unsigned int s = 0;\n for (size_t i = 0; i < n; i++) {\n QMap<unsigned long, unsigned long>::iterator it = dict.find(rand_get());\n if (it != dict.end())\n s += it.value();\n }\n g_result = s;\n}\n\n\/********************************************************************************************\/\n\nstatic void\ntest_dict2(unsigned long n)\n{\n rand_init();\n QHash<unsigned long, unsigned long> dict;\n\n for (size_t i = 0; i < n; i++) {\n dict[rand_get()] = rand_get();\n }\n \n unsigned int s = 0;\n for (size_t i = 0; i < n; i++) {\n QHash<unsigned long, unsigned long>::iterator it = dict.find(rand_get());\n if (it != dict.end())\n s += it.value();\n }\n g_result = s;\n}\n\n\/********************************************************************************************\/\nstruct char_array_s {\n char a[256];\n char_array_s () { a[0] = 0 ; }\n char_array_s ( const char_array_s & other) { strcpy(a, other.a); }\n bool operator==(const char_array_s &other) const { return strcmp(a, other.a) == 0; }\n};\n\nuint qHash(const char_array_s &k)\n{\n size_t hash = 0;\n const char *s = k.a;\n while (*s) hash = hash * 31421 + (*s++) + 6927;\n return hash;\n};\n\nstatic void\ntest_dict_big(unsigned long n)\n{\n rand_init();\n QHash<char_array_s, char_array_s> dict;\n\n for (size_t i = 0; i < n; i++) {\n char_array_s s1, s2;\n sprintf(s1.a, \"%u\", rand_get());\n sprintf(s2.a, \"%u\", rand_get());\n dict[s1] = s2;\n }\n\n unsigned int s = 0;\n for (size_t i = 0; i < n; i++) {\n char_array_s s1;\n sprintf(s1.a, \"%u\", rand_get());\n QHash<char_array_s, char_array_s>::iterator it = dict.find(s1);\n if (it != dict.end())\n s ++;\n }\n g_result = s;\n}\n\n\/********************************************************************************************\/\n\nint main(int argc, const char *argv[])\n{\n int n = (argc > 1) ? atoi(argv[1]) : 0;\n if (n == 1)\n test_function(\"List time\",10000000, test_list);\n if (n == 2)\n test_function(\"Array time\", 100000000, test_array);\n if (n == 3)\n test_function(\"Rbtree time\", 1000000, test_rbtree);\n if (n == 4)\n test_function(\"Dict(m)time\", 1000000, test_dict1);\n if (n == 5)\n test_function(\"Dict(u)time\", 1000000, test_dict2);\n if (n == 6)\n test_function(\"DictB time\", 1000000, test_dict_big);\n}\n<|endoftext|>"} {"text":"<commit_before>\/**\n* Copyright (C) 2016 3D Repo Ltd\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 \"repo_mesh_map_reorganiser.h\"\n#include \"..\/..\/core\/model\/bson\/repo_bson_factory.h\"\n\nusing namespace repo::manipulator::modelutility; \n\nMeshMapReorganiser::MeshMapReorganiser(\n\tconst repo::core::model::MeshNode *mesh,\n\tconst size_t &vertThreshold):\n\tmesh(mesh),\n\tmaxVertices(vertThreshold),\n\toldFaces(mesh->getFaces()),\n\toldVertices(mesh->getVertices()),\n\toldNormals(mesh->getNormals())\n{\n\tif (mesh && mesh->getMeshMapping().size())\n\t{\n\n\t\tnewVertices = oldVertices;\n\t\tnewNormals = oldNormals;\n\t\tperformSplitting();\n\t}\n\telse\n\t{\n\t\trepoError << \"Failed to remap mesh.\";\n\t\trepoDebug << \"Failed @ MeshMapRerganiser: Null ptr to mesh or trying to remap a mesh without mesh mapping!\";\n\t}\n}\n\nMeshMapReorganiser::~MeshMapReorganiser(){}\n\nvoid MeshMapReorganiser::finishSubMesh(\n\trepo_mesh_mapping_t &mapping,\n\tstd::vector<float> &minBox,\n\tstd::vector<float> &maxBox,\n\tconst size_t &nVertices,\n\tconst size_t &nFaces\n\t)\n{\n\tmapping.vertTo = mapping.vertFrom + nVertices;\n\tmapping.triTo = mapping.triFrom + nFaces;\n\n\tif (minBox.size() == 3)\n\t{\n\t\tmapping.min = { minBox[0], minBox[1], minBox[2] };\n\t}\n\telse\n\t{\n\t\trepoError << \"MeshMapReorganiser: Failed to find minimum bounding box value : Information is incomplete\";\n\t}\n\n\tif (maxBox.size() == 3)\n\t{\n\t\tmapping.min = { maxBox[0], maxBox[1], maxBox[2] };\n\t}\n\telse\n\t{\n\t\trepoError << \"MeshMapReorganiser: Failed to find maximum bounding box value : Information is incomplete\";\n\t}\n\n\tminBox.clear();\n\tmaxBox.clear();\n\n\tmatMap.back().push_back(mapping);\n}\n\nrepo::core::model::MeshNode MeshMapReorganiser::getRemappedMesh() const\n{\n\n\tauto bbox = mesh->getBoundingBox();\n\tstd::vector<std::vector<float>> bboxArr;\n\tif (bbox.size())\n\t{\n\t\tbboxArr.push_back({ bbox[0].x, bbox[0].y, bbox[0].z });\n\t\tbboxArr.push_back({ bbox[1].x, bbox[1].y, bbox[1].z });\n\t}\n\t\n\tauto newMesh = repo::core::model::RepoBSONFactory::makeMeshNode(newVertices, newFaces, newNormals, bboxArr);\n\trepo::core::model::RepoBSONBuilder builder;\n\tbuilder.append(REPO_NODE_LABEL_ID, mesh->getUniqueID());\n\tbuilder.append(REPO_NODE_LABEL_SHARED_ID, mesh->getSharedID());\n\tauto changes = builder.obj();\n\tnewMesh = newMesh.cloneAndAddFields(&changes, false);\n\treturn newMesh.cloneAndUpdateMeshMapping(reMappedMappings, true);\n}\n\nvoid MeshMapReorganiser::performSplitting()\n{\n\tstd::vector<repo_mesh_mapping_t> newMappings;\n\tstd::vector<repo_mesh_mapping_t> orgMappings = mesh->getMeshMapping();\n\n\tstd::vector<repo_face_t> faces;\n\n\tsize_t subMeshVertexCount = 0;\n\tsize_t subMeshFaceCount = 0;\n\n\tsize_t totalVertexCount = 0;\n\tsize_t totalFaceCount = 0;\n\n\tsize_t idMapIdx = 0;\n\tsize_t orgFaceIdx = 0;\n\n\tbool finishedSubMesh = true;\n\n\tstd::vector<float> bboxMin;\n\tstd::vector<float> bboxMax;\n\n\t\/\/Resources\n\trepoUUID superMeshID = mesh->getUniqueID();\n\n\trepoTrace << \"Performing splitting on mesh: \" << mesh->getUniqueID();\n\tfor (const auto ¤tSubMesh : orgMappings)\n\t{\n\t\tsplitMap[currentSubMesh.mesh_id] = std::vector < uint32_t >();\n\n\t\tauto currentMeshVFrom = currentSubMesh.vertFrom;\n\t\tauto currentMeshVTo = currentSubMesh.vertTo;\n\t\tauto currentMeshTFrom = currentSubMesh.triFrom;\n\t\tauto currentMeshTTo = currentSubMesh.triTo;\n\n\t\tauto currentMeshNumVertices = currentMeshVTo - currentMeshVFrom;\n\t\tauto currentMeshNumFaces = currentMeshTTo - currentMeshTFrom;\n\n\t\t\/\/ If the current cumulative count of vertices is greater than the\n\t\t\/\/ vertex limit then start a new mesh.\n\t\t\/\/ If newMappings === 0 we need to initialize the first mesh\n\t\tif (((subMeshVertexCount + currentMeshNumVertices) > maxVertices) || finishedSubMesh) {\n\t\t\t\/\/ Close off the previous sub mesh\n\t\t\tif (!finishedSubMesh) \/\/ Have we already finished this one\n\t\t\t{\n\t\t\t\tfinishSubMesh(newMappings.back(), bboxMin, bboxMax, subMeshVertexCount, subMeshFaceCount);\n\t\t\t}\n\n\t\t\t\/\/Reset the counters for the submesh vertex and face count\n\t\t\t\/\/ and begin a new sub mesh with a new ID\n\t\t\tsubMeshVertexCount = 0;\n\t\t\tsubMeshFaceCount = 0;\n\t\t\tfinishedSubMesh = false;\n\n\t\t\tnewMappings.resize(newMappings.size() + 1);\n\t\t\tstartSubMesh(newMappings.back(), superMeshID, currentSubMesh.material_id, totalVertexCount, totalFaceCount);\n\t\t}\n\n\t\t\/\/ Now we've started a new mesh is the mesh that we're trying to add greater than\n\t\t\/\/ the limit itself. In the case that it is, this will always flag as above.\n\t\tif (currentMeshNumVertices > maxVertices) {\n\n\t\t\tsize_t retTotalVCount, retTotalFCount;\n\t\t\tsplitLargeMesh(currentSubMesh, newMappings, idMapIdx, orgFaceIdx, retTotalVCount, retTotalFCount);\n\t\t\t\n\t\t\ttotalVertexCount += retTotalVCount;\n\t\t\ttotalFaceCount += retTotalFCount;\n\n\t\t\tfinishedSubMesh = true;\n\t\t}\n\t\telse\n\t\t{\n\t\t\tfor (uint32_t fIdx = 0; fIdx < currentMeshNumFaces; fIdx++)\n\t\t\t{\n\t\t\t\trepo_face_t currentFace = oldFaces[orgFaceIdx++];\n\t\t\t\tauto nSides = currentFace.size();\n\n\t\t\t\tif (nSides != 3)\n\t\t\t\t{\n\t\t\t\t\trepoError << \"Non triangulated face with \" << nSides << \" vertices.\";\n\t\t\t\t}\n\t\t\t\telse\n\t\t\t\t{\n\t\t\t\t\trepo_face_t newFace;\n\t\t\t\t\tfor (const auto &indexValue : currentFace)\n\t\t\t\t\t{\n\t\t\t\t\t\t\/\/ Take currentMeshVFrom from Index Value to reset to zero start,\n\t\t\t\t\t\t\/\/ then add back in the current running total to append after\n\t\t\t\t\t\t\/\/ previous mesh.\n\t\t\t\t\t\tauto newIdx = indexValue + (subMeshVertexCount - currentMeshVFrom);\n\t\t\t\t\t\tnewFace.push_back(newIdx);\n\t\t\t\t\t\tserialisedFaces.push_back(newIdx);\n\t\t\t\t\t}\n\t\t\t\t\tnewFaces.push_back(newFace);\n\t\t\t\t}\n\t\t\t}\n\n\t\t\tupdateIDMapArray(currentMeshNumVertices, idMapIdx++);\n\n\t\t\tupdateBoundingBoxes(bboxMin, bboxMax, currentSubMesh.min, currentSubMesh.max);\n\n\t\t\tsubMeshVertexCount += currentMeshNumVertices;\n\t\t\tsubMeshFaceCount += currentMeshNumFaces;\n\n\t\t\ttotalVertexCount += currentMeshNumVertices;\n\t\t\ttotalFaceCount += currentMeshNumFaces;\n\n\t\t\tsplitMap[currentSubMesh.mesh_id].push_back(newMappings.size());\n\t\t}\n\t}\n\n\tif (subMeshVertexCount) {\n\t\tfinishSubMesh(newMappings.back(), bboxMin, bboxMax, subMeshVertexCount, subMeshFaceCount);\n\t}\n\n\treMappedMappings = newMappings;\n\n}\n\nvoid MeshMapReorganiser::splitLargeMesh(\n\tconst repo_mesh_mapping_t currentSubMesh,\n\tstd::vector<repo_mesh_mapping_t> &newMappings,\n\tsize_t &idMapIdx,\n\tsize_t &orgFaceIdx,\n\tsize_t &totalVertexCount,\n\tsize_t &totalFaceCount)\n{\n\tstd::unordered_map<uint32_t, uint32_t> reIndexMap;\n\tstd::vector<repo_vector_t> reMappedVertices, reMappedNormals;\n\n\trepoTrace << currentSubMesh.mesh_id << \" Exceed the maximum amount of vertices, splitting it into multiple super meshes...\";\n\n\tauto currentMeshVFrom = currentSubMesh.vertFrom;\n\tauto currentMeshVTo = currentSubMesh.vertTo;\n\tauto currentMeshTFrom = currentSubMesh.triFrom;\n\tauto currentMeshTTo = currentSubMesh.triTo;\n\n\tauto currentMeshNumVertices = currentMeshVTo - currentMeshVFrom;\n\tauto currentMeshNumFaces = currentMeshTTo - currentMeshTFrom;\n\n\t\/\/When split mesh is called, it's guaranteed that a new mesh mapping has been created for it\n\tauto newVerticesVFrom = newMappings.back().vertFrom;\n\n\tconst bool hasNormal = oldNormals.size();\n\n\t\/\/ Split mesh information\n\tbool startedLargeMeshSplit = true;\n\tsize_t splitMeshVertexCount = 0;\n\tsize_t splitMeshFaceCount = 0;\n\tstd::vector<float> bboxMin;\n\tstd::vector<float> bboxMax;\n\n\ttotalVertexCount = 0;\n\ttotalFaceCount = 0;\n\n\t\/\/ Perform quick and dirty splitting algorithm\n\t\/\/ Loop over all faces in the giant mesh\n\n\tfor (uint32_t fIdx = 0; fIdx < currentMeshNumFaces; ++fIdx) {\n\t\trepo_face_t currentFace = oldFaces[orgFaceIdx++];\n\t\tauto nSides = currentFace.size();\n\t\tif (nSides != 3)\n\t\t{\n\t\t\trepoError << \"Non triangulated face with \" << nSides << \" vertices.\";\n\t\t}\n\t\telse\n\t\t{\n\t\t\t\/\/ If we haven't started yet, or the current number of vertices that we have\n\t\t\t\/\/ split is greater than the limit we need to start a new subMesh\n\t\t\tif (((splitMeshVertexCount + nSides) > maxVertices) || !startedLargeMeshSplit) {\n\t\t\t\t\/\/ If we have started we must be here because we have created a split mesh\n\t\t\t\t\/\/ greater than the required number of vertices\n\n\t\t\t\tif (fIdx)\n\t\t\t\t\tsplitMap[currentSubMesh.mesh_id].push_back(newMappings.size());\n\n\n\t\t\t\tif (startedLargeMeshSplit) {\t\t\t\t\n\t\t\t\t\tupdateIDMapArray(splitMeshVertexCount, idMapIdx++);\n\t\t\t\t\tfinishSubMesh(newMappings.back(), bboxMin, bboxMax, splitMeshVertexCount, splitMeshFaceCount);\n\n\t\t\t\t}\n\n\t\t\t\ttotalVertexCount += splitMeshVertexCount;\n\t\t\t\ttotalFaceCount += splitMeshFaceCount;\n\t\t\t\tstartedLargeMeshSplit = true;\n\t\t\t\tnewMappings.resize(newMappings.size() + 1);\n\t\t\t\tstartSubMesh(newMappings.back(), mesh->getUniqueID(), currentSubMesh.material_id, totalVertexCount, totalFaceCount);\n\t\t\t\tsplitMeshVertexCount = 0;\n\t\t\t\tsplitMeshFaceCount = 0;\n\t\t\t\treIndexMap.clear();\n\t\t\t}\/\/if (((splitMeshVertexCount + nSides) > maxVertices) || !startedLargeMeshSplit) \n\n\t\t\trepo_face_t newFace;\n\t\t\tfor (const auto &indexValue : currentFace)\n\t\t\t{\n\t\t\t\tconst auto it = reIndexMap.find(indexValue);\n\t\t\t\tif (it == reIndexMap.end())\n\t\t\t\t{\n\t\t\t\t\treIndexMap[indexValue] = splitMeshVertexCount;\n\t\t\t\t\trepo_vector_t vertex = oldVertices[indexValue];\n\t\t\t\t\treMappedVertices.push_back(vertex);\n\n\t\t\t\t\tif (hasNormal)\n\t\t\t\t\t{\n\t\t\t\t\t\treMappedNormals.push_back(oldNormals[indexValue]);\n\t\t\t\t\t}\n\n\t\t\t\t\tupdateBoundingBoxes(bboxMin, bboxMax, vertex, vertex);\n\t\t\t\t\tsplitMeshVertexCount++;\n\t\t\t\t}\n\t\t\t\tnewFace.push_back(reIndexMap[indexValue]);\n\t\t\t\tserialisedFaces.push_back(reIndexMap[indexValue]);\n\t\t\t}\/\/for (const auto &indexValue : currentFace)\n\t\t\tnewFaces.push_back(newFace);\n\n\t\t}\/\/else nSides != 3\n\t\tsplitMeshFaceCount++;\n\t}\/\/for (uint32_t fIdx = 0; fIdx < currentMeshNumFaces; ++fIdx)\n\n\t\/\/Modify the vertices as it may be rearranged within this region\n\tstd::copy(reMappedVertices.begin(), reMappedVertices.end(), newVertices.begin() + newVerticesVFrom);\n\tif (hasNormal)\n\t\tstd::copy(reMappedNormals.begin(), reMappedNormals.end(), newNormals.begin() + newVerticesVFrom);\n\n\tupdateIDMapArray(splitMeshVertexCount, idMapIdx); \n\n\ttotalVertexCount += splitMeshVertexCount;\n\ttotalFaceCount += splitMeshFaceCount;\n\t\n\tauto leftOverVertices = currentMeshNumVertices - totalVertexCount;\n\n\tif (leftOverVertices)\n\t{\n\t\tauto startingPos = newVertices.begin() + newMappings.back().vertFrom + totalVertexCount;\n\n\t\t\/\/Chop out the unwanted vertices\n\t\tnewVertices.erase(startingPos, startingPos + leftOverVertices);\n\t\tif (hasNormal)\n\t\t\tnewNormals.erase(startingPos, startingPos + leftOverVertices);\n\t}\n\t\n\n\tsplitMap[currentSubMesh.mesh_id].push_back(newMappings.size());\n\tfinishSubMesh(newMappings.back(), bboxMin, bboxMax, splitMeshVertexCount, splitMeshFaceCount);\n}\n\nvoid MeshMapReorganiser::startSubMesh(\n\trepo_mesh_mapping_t &mapping,\n\tconst repoUUID &meshID,\n\tconst repoUUID &matID,\n\tconst size_t &sVertices,\n\tconst size_t &sFaces\n\t)\n{\n\tmapping.vertFrom = sVertices;\n\tmapping.vertFrom = sFaces;\n\tmapping.material_id = matID; \/\/Not a reliable source. Just filled in for completeness\n\tmapping.mesh_id = meshID;\n\n\tidMapBuf.resize(idMapBuf.size() + 1);\n\tidMapBuf.back().clear();\n\tmatMap.resize(matMap.size() + 1);\n\tmatMap.back().clear();\n}\n\n\nvoid MeshMapReorganiser::updateBoundingBoxes(\n\tstd::vector<float> &min,\n\tstd::vector<float> &max,\n\tconst repo_vector_t &smMin,\n\tconst repo_vector_t &smMax)\n{\n\t\/\/Update Bounding box\n\tif (min.size())\n\t{\n\t\tif (min[0] > smMin.x)\n\t\t\tmin[0] = smMin.x;\n\n\t\tif (min[1] > smMin.y)\n\t\t\tmin[1] = smMin.y;\n\n\t\tif (min[2] > smMin.z)\n\t\t\tmin[2] = smMin.z;\n\t}\n\telse\n\t{\n\t\tmin = { smMin.x, smMin.y, smMin.z };\n\t}\n\n\n\tif (max.size())\n\t{\n\t\tif (max[0] < smMax.x)\n\t\t\tmax[0] = smMax.x;\n\n\t\tif (max[1] < smMax.y)\n\t\t\tmax[1] = smMax.y;\n\n\t\tif (max[2] < smMax.z)\n\t\t\tmax[2] = smMax.z;\n\t}\n\telse\n\t{\n\t\tmax = { smMax.x, smMax.y, smMax.z };\n\t}\n}\n\nvoid MeshMapReorganiser::updateIDMapArray(\n\tconst size_t &n,\n\tconst size_t &value)\n{\n\tauto idMapLength = idMapBuf.back().size();\n\tidMapBuf.back().resize(idMapLength + n);\n\n\tfloat value_f = value;\n\tstd::fill(idMapBuf.back().begin() + idMapLength, idMapBuf.back().end(), value_f);\n}<commit_msg>#106 fix erroneous id mapping for material<commit_after>\/**\n* Copyright (C) 2016 3D Repo Ltd\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 \"repo_mesh_map_reorganiser.h\"\n#include \"..\/..\/core\/model\/bson\/repo_bson_factory.h\"\n\nusing namespace repo::manipulator::modelutility; \n\nMeshMapReorganiser::MeshMapReorganiser(\n\tconst repo::core::model::MeshNode *mesh,\n\tconst size_t &vertThreshold):\n\tmesh(mesh),\n\tmaxVertices(vertThreshold),\n\toldFaces(mesh->getFaces()),\n\toldVertices(mesh->getVertices()),\n\toldNormals(mesh->getNormals())\n{\n\tif (mesh && mesh->getMeshMapping().size())\n\t{\n\n\t\tnewVertices = oldVertices;\n\t\tnewNormals = oldNormals;\n\t\tperformSplitting();\n\t}\n\telse\n\t{\n\t\trepoError << \"Failed to remap mesh.\";\n\t\trepoDebug << \"Failed @ MeshMapRerganiser: Null ptr to mesh or trying to remap a mesh without mesh mapping!\";\n\t}\n}\n\nMeshMapReorganiser::~MeshMapReorganiser(){}\n\nvoid MeshMapReorganiser::finishSubMesh(\n\trepo_mesh_mapping_t &mapping,\n\tstd::vector<float> &minBox,\n\tstd::vector<float> &maxBox,\n\tconst size_t &nVertices,\n\tconst size_t &nFaces\n\t)\n{\n\tmapping.vertTo = mapping.vertFrom + nVertices;\n\tmapping.triTo = mapping.triFrom + nFaces;\n\n\tif (minBox.size() == 3)\n\t{\n\t\tmapping.min = { minBox[0], minBox[1], minBox[2] };\n\t}\n\telse\n\t{\n\t\trepoError << \"MeshMapReorganiser: Failed to find minimum bounding box value : Information is incomplete\";\n\t}\n\n\tif (maxBox.size() == 3)\n\t{\n\t\tmapping.min = { maxBox[0], maxBox[1], maxBox[2] };\n\t}\n\telse\n\t{\n\t\trepoError << \"MeshMapReorganiser: Failed to find maximum bounding box value : Information is incomplete\";\n\t}\n\n\tminBox.clear();\n\tmaxBox.clear();\n\n\tmatMap.back().push_back(mapping);\n}\n\nrepo::core::model::MeshNode MeshMapReorganiser::getRemappedMesh() const\n{\n\n\tauto bbox = mesh->getBoundingBox();\n\tstd::vector<std::vector<float>> bboxArr;\n\tif (bbox.size())\n\t{\n\t\tbboxArr.push_back({ bbox[0].x, bbox[0].y, bbox[0].z });\n\t\tbboxArr.push_back({ bbox[1].x, bbox[1].y, bbox[1].z });\n\t}\n\t\n\tauto newMesh = repo::core::model::RepoBSONFactory::makeMeshNode(newVertices, newFaces, newNormals, bboxArr);\n\trepo::core::model::RepoBSONBuilder builder;\n\tbuilder.append(REPO_NODE_LABEL_ID, mesh->getUniqueID());\n\tbuilder.append(REPO_NODE_LABEL_SHARED_ID, mesh->getSharedID());\n\tauto changes = builder.obj();\n\tnewMesh = newMesh.cloneAndAddFields(&changes, false);\n\treturn newMesh.cloneAndUpdateMeshMapping(reMappedMappings, true);\n}\n\nvoid MeshMapReorganiser::performSplitting()\n{\n\tstd::vector<repo_mesh_mapping_t> newMappings;\n\tstd::vector<repo_mesh_mapping_t> orgMappings = mesh->getMeshMapping();\n\n\tstd::vector<repo_face_t> faces;\n\n\tsize_t subMeshVertexCount = 0;\n\tsize_t subMeshFaceCount = 0;\n\n\tsize_t totalVertexCount = 0;\n\tsize_t totalFaceCount = 0;\n\n\tsize_t idMapIdx = 0;\n\tsize_t orgFaceIdx = 0;\n\n\tbool finishedSubMesh = true;\n\n\tstd::vector<float> bboxMin;\n\tstd::vector<float> bboxMax;\n\n\t\/\/Resources\n\trepoUUID superMeshID = mesh->getUniqueID();\n\n\trepoTrace << \"Performing splitting on mesh: \" << mesh->getUniqueID();\n\tfor (const auto ¤tSubMesh : orgMappings)\n\t{\n\t\tsplitMap[currentSubMesh.mesh_id] = std::vector < uint32_t >();\n\n\t\tauto currentMeshVFrom = currentSubMesh.vertFrom;\n\t\tauto currentMeshVTo = currentSubMesh.vertTo;\n\t\tauto currentMeshTFrom = currentSubMesh.triFrom;\n\t\tauto currentMeshTTo = currentSubMesh.triTo;\n\n\t\tauto currentMeshNumVertices = currentMeshVTo - currentMeshVFrom;\n\t\tauto currentMeshNumFaces = currentMeshTTo - currentMeshTFrom;\n\n\t\t\/\/ If the current cumulative count of vertices is greater than the\n\t\t\/\/ vertex limit then start a new mesh.\n\t\t\/\/ If newMappings === 0 we need to initialize the first mesh\n\t\tif (((subMeshVertexCount + currentMeshNumVertices) > maxVertices) || finishedSubMesh) {\n\t\t\t\/\/ Close off the previous sub mesh\n\t\t\tif (!finishedSubMesh) \/\/ Have we already finished this one\n\t\t\t{\n\t\t\t\tfinishSubMesh(newMappings.back(), bboxMin, bboxMax, subMeshVertexCount, subMeshFaceCount);\n\t\t\t}\n\n\t\t\t\/\/Reset the counters for the submesh vertex and face count\n\t\t\t\/\/ and begin a new sub mesh with a new ID\n\t\t\tsubMeshVertexCount = 0;\n\t\t\tsubMeshFaceCount = 0;\n\t\t\tfinishedSubMesh = false;\n\n\t\t\tnewMappings.resize(newMappings.size() + 1);\n\t\t\tstartSubMesh(newMappings.back(), superMeshID, currentSubMesh.material_id, totalVertexCount, totalFaceCount);\n\t\t}\n\n\t\t\/\/ Now we've started a new mesh is the mesh that we're trying to add greater than\n\t\t\/\/ the limit itself. In the case that it is, this will always flag as above.\n\t\tif (currentMeshNumVertices > maxVertices) {\n\n\t\t\tsize_t retTotalVCount, retTotalFCount;\n\t\t\tsplitLargeMesh(currentSubMesh, newMappings, idMapIdx, orgFaceIdx, retTotalVCount, retTotalFCount);\n\t\t\t\n\t\t\t++idMapIdx;\n\t\t\ttotalVertexCount += retTotalVCount;\n\t\t\ttotalFaceCount += retTotalFCount;\n\n\t\t\tfinishedSubMesh = true;\n\t\t}\n\t\telse\n\t\t{\n\t\t\tfor (uint32_t fIdx = 0; fIdx < currentMeshNumFaces; fIdx++)\n\t\t\t{\n\t\t\t\trepo_face_t currentFace = oldFaces[orgFaceIdx++];\n\t\t\t\tauto nSides = currentFace.size();\n\n\t\t\t\tif (nSides != 3)\n\t\t\t\t{\n\t\t\t\t\trepoError << \"Non triangulated face with \" << nSides << \" vertices.\";\n\t\t\t\t}\n\t\t\t\telse\n\t\t\t\t{\n\t\t\t\t\trepo_face_t newFace;\n\t\t\t\t\tfor (const auto &indexValue : currentFace)\n\t\t\t\t\t{\n\t\t\t\t\t\t\/\/ Take currentMeshVFrom from Index Value to reset to zero start,\n\t\t\t\t\t\t\/\/ then add back in the current running total to append after\n\t\t\t\t\t\t\/\/ previous mesh.\n\t\t\t\t\t\tauto newIdx = indexValue + (subMeshVertexCount - currentMeshVFrom);\n\t\t\t\t\t\tnewFace.push_back(newIdx);\n\t\t\t\t\t\tserialisedFaces.push_back(newIdx);\n\t\t\t\t\t}\n\t\t\t\t\tnewFaces.push_back(newFace);\n\t\t\t\t}\n\t\t\t}\n\n\t\t\tupdateIDMapArray(currentMeshNumVertices, idMapIdx++);\n\n\t\t\tupdateBoundingBoxes(bboxMin, bboxMax, currentSubMesh.min, currentSubMesh.max);\n\n\t\t\tsubMeshVertexCount += currentMeshNumVertices;\n\t\t\tsubMeshFaceCount += currentMeshNumFaces;\n\n\t\t\ttotalVertexCount += currentMeshNumVertices;\n\t\t\ttotalFaceCount += currentMeshNumFaces;\n\n\t\t\tsplitMap[currentSubMesh.mesh_id].push_back(newMappings.size());\n\t\t}\n\t}\n\n\tif (subMeshVertexCount) {\n\t\tfinishSubMesh(newMappings.back(), bboxMin, bboxMax, subMeshVertexCount, subMeshFaceCount);\n\t}\n\n\treMappedMappings = newMappings;\n\n}\n\nvoid MeshMapReorganiser::splitLargeMesh(\n\tconst repo_mesh_mapping_t currentSubMesh,\n\tstd::vector<repo_mesh_mapping_t> &newMappings,\n\tsize_t &idMapIdx,\n\tsize_t &orgFaceIdx,\n\tsize_t &totalVertexCount,\n\tsize_t &totalFaceCount)\n{\n\tstd::unordered_map<uint32_t, uint32_t> reIndexMap;\n\tstd::vector<repo_vector_t> reMappedVertices, reMappedNormals;\n\n\trepoTrace << currentSubMesh.mesh_id << \" Exceed the maximum amount of vertices, splitting it into multiple super meshes...\";\n\n\tauto currentMeshVFrom = currentSubMesh.vertFrom;\n\tauto currentMeshVTo = currentSubMesh.vertTo;\n\tauto currentMeshTFrom = currentSubMesh.triFrom;\n\tauto currentMeshTTo = currentSubMesh.triTo;\n\n\tauto currentMeshNumVertices = currentMeshVTo - currentMeshVFrom;\n\tauto currentMeshNumFaces = currentMeshTTo - currentMeshTFrom;\n\n\t\/\/When split mesh is called, it's guaranteed that a new mesh mapping has been created for it\n\tauto newVerticesVFrom = newMappings.back().vertFrom;\n\n\tconst bool hasNormal = oldNormals.size();\n\n\t\/\/ Split mesh information\n\tbool startedLargeMeshSplit = true;\n\tsize_t splitMeshVertexCount = 0;\n\tsize_t splitMeshFaceCount = 0;\n\tstd::vector<float> bboxMin;\n\tstd::vector<float> bboxMax;\n\n\ttotalVertexCount = 0;\n\ttotalFaceCount = 0;\n\n\t\/\/ Perform quick and dirty splitting algorithm\n\t\/\/ Loop over all faces in the giant mesh\n\n\tfor (uint32_t fIdx = 0; fIdx < currentMeshNumFaces; ++fIdx) {\n\t\trepo_face_t currentFace = oldFaces[orgFaceIdx++];\n\t\tauto nSides = currentFace.size();\n\t\tif (nSides != 3)\n\t\t{\n\t\t\trepoError << \"Non triangulated face with \" << nSides << \" vertices.\";\n\t\t}\n\t\telse\n\t\t{\n\t\t\t\/\/ If we haven't started yet, or the current number of vertices that we have\n\t\t\t\/\/ split is greater than the limit we need to start a new subMesh\n\t\t\tif (((splitMeshVertexCount + nSides) > maxVertices) || !startedLargeMeshSplit) {\n\t\t\t\t\/\/ If we have started we must be here because we have created a split mesh\n\t\t\t\t\/\/ greater than the required number of vertices\n\n\t\t\t\tif (fIdx)\n\t\t\t\t\tsplitMap[currentSubMesh.mesh_id].push_back(newMappings.size());\n\n\n\t\t\t\tif (startedLargeMeshSplit) {\t\t\t\t\n\t\t\t\t\tupdateIDMapArray(splitMeshVertexCount, idMapIdx++);\n\t\t\t\t\tfinishSubMesh(newMappings.back(), bboxMin, bboxMax, splitMeshVertexCount, splitMeshFaceCount);\n\n\t\t\t\t}\n\n\t\t\t\ttotalVertexCount += splitMeshVertexCount;\n\t\t\t\ttotalFaceCount += splitMeshFaceCount;\n\t\t\t\tstartedLargeMeshSplit = true;\n\t\t\t\tnewMappings.resize(newMappings.size() + 1);\n\t\t\t\tstartSubMesh(newMappings.back(), mesh->getUniqueID(), currentSubMesh.material_id, totalVertexCount, totalFaceCount);\n\t\t\t\tsplitMeshVertexCount = 0;\n\t\t\t\tsplitMeshFaceCount = 0;\n\t\t\t\treIndexMap.clear();\n\t\t\t}\/\/if (((splitMeshVertexCount + nSides) > maxVertices) || !startedLargeMeshSplit) \n\n\t\t\trepo_face_t newFace;\n\t\t\tfor (const auto &indexValue : currentFace)\n\t\t\t{\n\t\t\t\tconst auto it = reIndexMap.find(indexValue);\n\t\t\t\tif (it == reIndexMap.end())\n\t\t\t\t{\n\t\t\t\t\treIndexMap[indexValue] = splitMeshVertexCount;\n\t\t\t\t\trepo_vector_t vertex = oldVertices[indexValue];\n\t\t\t\t\treMappedVertices.push_back(vertex);\n\n\t\t\t\t\tif (hasNormal)\n\t\t\t\t\t{\n\t\t\t\t\t\treMappedNormals.push_back(oldNormals[indexValue]);\n\t\t\t\t\t}\n\n\t\t\t\t\tupdateBoundingBoxes(bboxMin, bboxMax, vertex, vertex);\n\t\t\t\t\tsplitMeshVertexCount++;\n\t\t\t\t}\n\t\t\t\tnewFace.push_back(reIndexMap[indexValue]);\n\t\t\t\tserialisedFaces.push_back(reIndexMap[indexValue]);\n\t\t\t}\/\/for (const auto &indexValue : currentFace)\n\t\t\tnewFaces.push_back(newFace);\n\n\t\t}\/\/else nSides != 3\n\t\tsplitMeshFaceCount++;\n\t}\/\/for (uint32_t fIdx = 0; fIdx < currentMeshNumFaces; ++fIdx)\n\n\t\/\/Modify the vertices as it may be rearranged within this region\n\tstd::copy(reMappedVertices.begin(), reMappedVertices.end(), newVertices.begin() + newVerticesVFrom);\n\tif (hasNormal)\n\t\tstd::copy(reMappedNormals.begin(), reMappedNormals.end(), newNormals.begin() + newVerticesVFrom);\n\n\tupdateIDMapArray(splitMeshVertexCount, idMapIdx); \n\n\ttotalVertexCount += splitMeshVertexCount;\n\ttotalFaceCount += splitMeshFaceCount;\n\t\n\tauto leftOverVertices = currentMeshNumVertices - totalVertexCount;\n\n\tif (leftOverVertices)\n\t{\n\t\tauto startingPos = newVertices.begin() + newMappings.back().vertFrom + totalVertexCount;\n\n\t\t\/\/Chop out the unwanted vertices\n\t\tnewVertices.erase(startingPos, startingPos + leftOverVertices);\n\t\tif (hasNormal)\n\t\t\tnewNormals.erase(startingPos, startingPos + leftOverVertices);\n\t}\n\t\n\n\tsplitMap[currentSubMesh.mesh_id].push_back(newMappings.size());\n\tfinishSubMesh(newMappings.back(), bboxMin, bboxMax, splitMeshVertexCount, splitMeshFaceCount);\n}\n\nvoid MeshMapReorganiser::startSubMesh(\n\trepo_mesh_mapping_t &mapping,\n\tconst repoUUID &meshID,\n\tconst repoUUID &matID,\n\tconst size_t &sVertices,\n\tconst size_t &sFaces\n\t)\n{\n\tmapping.vertFrom = sVertices;\n\tmapping.vertFrom = sFaces;\n\tmapping.material_id = matID; \/\/Not a reliable source. Just filled in for completeness\n\tmapping.mesh_id = meshID;\n\n\tidMapBuf.resize(idMapBuf.size() + 1);\n\tidMapBuf.back().clear();\n\tmatMap.resize(matMap.size() + 1);\n\tmatMap.back().clear();\n}\n\n\nvoid MeshMapReorganiser::updateBoundingBoxes(\n\tstd::vector<float> &min,\n\tstd::vector<float> &max,\n\tconst repo_vector_t &smMin,\n\tconst repo_vector_t &smMax)\n{\n\t\/\/Update Bounding box\n\tif (min.size())\n\t{\n\t\tif (min[0] > smMin.x)\n\t\t\tmin[0] = smMin.x;\n\n\t\tif (min[1] > smMin.y)\n\t\t\tmin[1] = smMin.y;\n\n\t\tif (min[2] > smMin.z)\n\t\t\tmin[2] = smMin.z;\n\t}\n\telse\n\t{\n\t\tmin = { smMin.x, smMin.y, smMin.z };\n\t}\n\n\n\tif (max.size())\n\t{\n\t\tif (max[0] < smMax.x)\n\t\t\tmax[0] = smMax.x;\n\n\t\tif (max[1] < smMax.y)\n\t\t\tmax[1] = smMax.y;\n\n\t\tif (max[2] < smMax.z)\n\t\t\tmax[2] = smMax.z;\n\t}\n\telse\n\t{\n\t\tmax = { smMax.x, smMax.y, smMax.z };\n\t}\n}\n\nvoid MeshMapReorganiser::updateIDMapArray(\n\tconst size_t &n,\n\tconst size_t &value)\n{\n\tauto idMapLength = idMapBuf.back().size();\n\tidMapBuf.back().resize(idMapLength + n);\n\n\tfloat value_f = value;\n\tstd::fill(idMapBuf.back().begin() + idMapLength, idMapBuf.back().end(), value_f);\n}<|endoftext|>"} {"text":"<commit_before>#include \"QPlayControl.h\"\n\n#include <QToolButton>\n#include <QWidget>\n#include <QComboBox>\n\nQPlayControl::QPlayControl( QWidget *parent \/*= 0 *\/ ) :\ncurrentTime( 0.0 ),\nskipTime( 0.01 ),\nslomoFactor( 1.0 ),\nminTime( 0.0 ),\nmaxTime( 1.0 ),\nautoExtendRange( false )\n{\n\tplayButton = new QToolButton( this );\n\tplayButton->setIcon( style()->standardIcon( QStyle::SP_MediaPlay ) );\n\tconnect( playButton, SIGNAL( clicked() ), this, SLOT( play() ) );\n\n\tstopButton = new QToolButton( this );\n\tstopButton->setIcon( style()->standardIcon( QStyle::SP_MediaStop ) );\n\tconnect( stopButton, SIGNAL( clicked() ), this, SLOT( stop() ) );\n\n\tnextButton = new QToolButton( this );\n\tnextButton->setIcon( style()->standardIcon( QStyle::SP_MediaSkipForward ) );\n\tconnect( nextButton, SIGNAL( clicked() ), this, SLOT( next() ) );\n\n\tpreviousButton = new QToolButton( this );\n\tpreviousButton->setIcon( style()->standardIcon( QStyle::SP_MediaSkipBackward ) );\n\tconnect( previousButton, SIGNAL( clicked() ), this, SLOT( previous() ) );\n\n\tloopButton = new QToolButton( this );\n\tloopButton->setCheckable( true );\n\tloopButton->setIcon( style()->standardIcon( QStyle::SP_BrowserReload ) );\n\n\tlabel = new QLCDNumber( this );\n\tlabel->setDigitCount( 5 );\n\tlabel->setSmallDecimalPoint( true );\n\tlabel->setFrameStyle( QFrame::Box );\n\tlabel->setSegmentStyle( QLCDNumber::Flat );\n\tlabel->display( \"0.00\" );\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\tslowMotionBox = 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\tslowMotionBox->addItem( label, QVariant( pow( 2, slomo ) ) );\n\t}\n\tslowMotionBox->setCurrentIndex( 2 );\n\tconnect( slowMotionBox, SIGNAL( activated( int ) ), SLOT( updateSlowMotion( int ) ) );\n\n\tQBoxLayout *lo = new QHBoxLayout;\n\tlo->setMargin( 0 );\n\tlo->setSpacing( 2 );\n\tlo->addWidget( previousButton );\n\tlo->addWidget( playButton );\n\tlo->addWidget( stopButton );\n\tlo->addWidget( nextButton );\n\tlo->addWidget( label );\n\tlo->addWidget( slider );\n\tlo->addWidget( loopButton );\n\tlo->addWidget( slowMotionBox );\n\tsetLayout( lo );\n\n\tconnect( &qtimer, SIGNAL( timeout() ), this, SLOT( timeout() ) );\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\tcurrentTime = time;\n\n\tif ( currentTime > maxTime )\n\t{\n\t\tif ( getAutoExtendRange() )\n\t\t{\n\t\t\t\/\/ adjust maximum\n\t\t\tsetRange( minTime, currentTime );\n\t\t}\n\t\telse if ( getLoop() )\n\t\t{\n\t\t\t\/\/ restart\n\t\t\tcurrentTime = minTime;\n\t\t}\n\t\telse\n\t\t{\n\t\t\t\/\/ stop playing\n\t\t\tcurrentTime = maxTime;\n\t\t\tstop();\n\t\t}\n\t}\n\n\tslider->setValue( int( currentTime * 1000 ) );\n\tlabel->display( QString().sprintf( \"%.2f\", currentTime ) );\n\t\n\temit timeChanged( currentTime );\n}\n\nbool QPlayControl::getLoop()\n{\n\treturn loopButton->isChecked();\n}\n\nbool QPlayControl::isPlaying()\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 ( currentTime >= maxTime )\n\t\treset();\n\tqtimer.start( 10 );\n\ttimer.reset();\n\ttimer_delta.reset();\n\temit playTriggered();\n}\n\nvoid QPlayControl::stop()\n{\n\tif ( qtimer.isActive() )\n\t{\n\t\tqtimer.stop();\n\t\temit stopTriggered();\n\t}\n\telse reset();\n}\n\nvoid QPlayControl::toggle()\n{\n\tif ( isPlaying() )\n\t\tstop();\n\telse play();\n}\n\nvoid QPlayControl::reset()\n{\n\tif ( qtimer.isActive() )\n\t\tqtimer.stop();\n\n\tsetTime( 0 );\n\temit resetTriggered();\n}\n\nvoid QPlayControl::previous()\n{\n\tsetTime( currentTime - skipTime );\n\temit previousTriggered();\n}\n\nvoid QPlayControl::next()\n{\n\tsetTime( currentTime + skipTime );\n\temit nextTriggered();\n}\n\nvoid QPlayControl::updateSlowMotion( int idx )\n{\n\tslomoFactor = slowMotionBox->itemData( idx ).toDouble();\n\temit slowMotionChanged( slowMotionBox->itemData( idx ).toInt() );\n}\n\nvoid QPlayControl::updateSlider( int value )\n{\n\tsetTime( value \/ 1000.0 );\n\temit timeChanged( currentTime );\n\temit sliderChanged( value );\n}\n\nvoid QPlayControl::timeout()\n{\n\tsetTime( currentTime + slomoFactor * timer_delta( timer.seconds() ) );\n}\n<commit_msg>qplaycontrol fix: now blocks redundant inputs from slider<commit_after>#include \"QPlayControl.h\"\n\n#include <QToolButton>\n#include <QWidget>\n#include <QComboBox>\n#include \"flut\/system\/log.hpp\"\n\nQPlayControl::QPlayControl( QWidget *parent \/*= 0 *\/ ) :\ncurrentTime( 0.0 ),\nskipTime( 0.01 ),\nslomoFactor( 1.0 ),\nminTime( 0.0 ),\nmaxTime( 1.0 ),\nautoExtendRange( false )\n{\n\tplayButton = new QToolButton( this );\n\tplayButton->setIcon( style()->standardIcon( QStyle::SP_MediaPlay ) );\n\tconnect( playButton, SIGNAL( clicked() ), this, SLOT( play() ) );\n\n\tstopButton = new QToolButton( this );\n\tstopButton->setIcon( style()->standardIcon( QStyle::SP_MediaStop ) );\n\tconnect( stopButton, SIGNAL( clicked() ), this, SLOT( stop() ) );\n\n\tnextButton = new QToolButton( this );\n\tnextButton->setIcon( style()->standardIcon( QStyle::SP_MediaSkipForward ) );\n\tconnect( nextButton, SIGNAL( clicked() ), this, SLOT( next() ) );\n\n\tpreviousButton = new QToolButton( this );\n\tpreviousButton->setIcon( style()->standardIcon( QStyle::SP_MediaSkipBackward ) );\n\tconnect( previousButton, SIGNAL( clicked() ), this, SLOT( previous() ) );\n\n\tloopButton = new QToolButton( this );\n\tloopButton->setCheckable( true );\n\tloopButton->setIcon( style()->standardIcon( QStyle::SP_BrowserReload ) );\n\n\tlabel = new QLCDNumber( this );\n\tlabel->setDigitCount( 5 );\n\tlabel->setSmallDecimalPoint( true );\n\tlabel->setFrameStyle( QFrame::Box );\n\tlabel->setSegmentStyle( QLCDNumber::Flat );\n\tlabel->display( \"0.00\" );\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\tslowMotionBox = 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\tslowMotionBox->addItem( label, QVariant( pow( 2, slomo ) ) );\n\t}\n\tslowMotionBox->setCurrentIndex( 2 );\n\tconnect( slowMotionBox, SIGNAL( activated( int ) ), SLOT( updateSlowMotion( int ) ) );\n\n\tQBoxLayout *lo = new QHBoxLayout;\n\tlo->setMargin( 0 );\n\tlo->setSpacing( 2 );\n\tlo->addWidget( previousButton );\n\tlo->addWidget( playButton );\n\tlo->addWidget( stopButton );\n\tlo->addWidget( nextButton );\n\tlo->addWidget( label );\n\tlo->addWidget( slider );\n\tlo->addWidget( loopButton );\n\tlo->addWidget( slowMotionBox );\n\tsetLayout( lo );\n\n\tconnect( &qtimer, SIGNAL( timeout() ), this, SLOT( timeout() ) );\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\tcurrentTime = time;\n\n\tif ( currentTime > maxTime )\n\t{\n\t\tif ( getAutoExtendRange() )\n\t\t{\n\t\t\t\/\/ adjust maximum\n\t\t\tsetRange( minTime, currentTime );\n\t\t}\n\t\telse if ( getLoop() )\n\t\t{\n\t\t\t\/\/ restart\n\t\t\tcurrentTime = minTime;\n\t\t}\n\t\telse\n\t\t{\n\t\t\t\/\/ stop playing\n\t\t\tcurrentTime = maxTime;\n\t\t\tstop();\n\t\t}\n\t}\n\n\tslider->blockSignals( true );\n\tslider->setValue( int( currentTime * 1000 ) );\n\tslider->blockSignals( false );\n\n\tlabel->display( QString().sprintf( \"%.2f\", currentTime ) );\n\t\n\temit timeChanged( currentTime );\n}\n\nbool QPlayControl::getLoop()\n{\n\treturn loopButton->isChecked();\n}\n\nbool QPlayControl::isPlaying()\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.reset();\n\t\temit playTriggered();\n\t}\n}\n\nvoid QPlayControl::stop()\n{\n\tif ( qtimer.isActive() )\n\t{\n\t\tqtimer.stop();\n\t\temit stopTriggered();\n\t}\n\telse reset();\n}\n\nvoid QPlayControl::toggle()\n{\n\tif ( isPlaying() )\n\t\tstop();\n\telse play();\n}\n\nvoid QPlayControl::reset()\n{\n\tif ( qtimer.isActive() )\n\t\tqtimer.stop();\n\n\tsetTime( 0 );\n\temit resetTriggered();\n}\n\nvoid QPlayControl::previous()\n{\n\tsetTime( currentTime - skipTime );\n\temit previousTriggered();\n}\n\nvoid QPlayControl::next()\n{\n\tsetTime( currentTime + skipTime );\n\temit nextTriggered();\n}\n\nvoid QPlayControl::updateSlowMotion( int idx )\n{\n\tslomoFactor = slowMotionBox->itemData( idx ).toDouble();\n\temit slowMotionChanged( slowMotionBox->itemData( idx ).toInt() );\n}\n\nvoid QPlayControl::updateSlider( int value )\n{\n\tsetTime( value \/ 1000.0 );\n\temit sliderChanged( value );\n}\n\nvoid QPlayControl::timeout()\n{\n\tsetTime( currentTime + slomoFactor * timer_delta( timer.seconds() ) );\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 \"OgreGLSLESExtSupport.h\"\n#include \"OgreLogManager.h\"\n#include \"OgreRoot.h\"\n\nnamespace Ogre\n{\n \/\/-----------------------------------------------------------------------------\n\tString logObjectInfo(const String& msg, const GLuint obj)\n\t{\n\t\tString logMessage = msg;\n\n\t\tif (obj > 0)\n\t\t{\n\t\t\tGLint infologLength = 0;\n\n if(glIsShader(obj))\n {\n glGetShaderiv(obj, GL_INFO_LOG_LENGTH, &infologLength);\n GL_CHECK_ERROR\n }\n#if GL_EXT_separate_shader_objects\n else if(glIsProgramPipelineEXT(obj))\n {\n glValidateProgramPipelineEXT(obj);\n glGetProgramPipelineivEXT(obj, GL_INFO_LOG_LENGTH, &infologLength);\n GL_CHECK_ERROR\n }\n#endif\n else if(glIsProgram(obj))\n {\n glValidateProgram(obj);\n glGetProgramiv(obj, GL_INFO_LOG_LENGTH, &infologLength);\n GL_CHECK_ERROR\n }\n\n\t\t\tif (infologLength > 1)\n\t\t\t{\n\t\t\t\tGLint charsWritten = 0;\n\n\t\t\t\tchar * infoLog = new char [infologLength];\n\t\t\t\tinfoLog[0] = 0;\n\n if(glIsShader(obj))\n {\n glGetShaderInfoLog(obj, infologLength, &charsWritten, infoLog);\n GL_CHECK_ERROR\n }\n#if GL_EXT_separate_shader_objects\n else if(Root::getSingleton().getRenderSystem()->getCapabilities()->hasCapability(RSC_SEPARATE_SHADER_OBJECTS) &&\n glIsProgramPipelineEXT(obj))\n {\n glGetProgramPipelineInfoLogEXT(obj, infologLength, &charsWritten, infoLog);\n GL_CHECK_ERROR\n }\n#endif\n else if(glIsProgram(obj))\n {\n glGetProgramInfoLog(obj, infologLength, &charsWritten, infoLog);\n GL_CHECK_ERROR\n }\n\n\t\t\t\tif (strlen(infoLog) > 0)\n\t\t\t\t{\n\t\t\t\t\tlogMessage += \"\\n\" + String(infoLog);\n\t\t\t\t}\n\n\t\t\t\tOGRE_DELETE [] infoLog;\n\n\t\t\t\tif (logMessage.size() > 0)\n\t\t\t\t{\n\t\t\t\t\t\/\/ remove ends of line in the end - so there will be no empty lines in the log.\n\t\t\t\t\twhile( logMessage[logMessage.size() - 1] == '\\n' )\n\t\t\t\t\t{\n\t\t\t\t\t\tlogMessage.erase(logMessage.size() - 1, 1);\n\t\t\t\t\t}\n\t\t\t\t\tLogManager::getSingleton().logMessage(logMessage);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\n\t\treturn logMessage;\n\t}\n\n\n} \/\/ namespace Ogre\n<commit_msg>iOS: Fix crash caused by missing GL function pointers with GLES 2 on iOS 4<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 \"OgreGLSLESExtSupport.h\"\n#include \"OgreLogManager.h\"\n#include \"OgreRoot.h\"\n\nnamespace Ogre\n{\n \/\/-----------------------------------------------------------------------------\n\tString logObjectInfo(const String& msg, const GLuint obj)\n\t{\n\t\tString logMessage = msg;\n\n\t\tif (obj > 0)\n\t\t{\n\t\t\tGLint infologLength = 0;\n\n if(glIsShader(obj))\n {\n glGetShaderiv(obj, GL_INFO_LOG_LENGTH, &infologLength);\n GL_CHECK_ERROR\n }\n#if GL_EXT_separate_shader_objects\n else if(Root::getSingleton().getRenderSystem()->getCapabilities()->hasCapability(RSC_SEPARATE_SHADER_OBJECTS) &&\n glIsProgramPipelineEXT(obj))\n {\n glValidateProgramPipelineEXT(obj);\n glGetProgramPipelineivEXT(obj, GL_INFO_LOG_LENGTH, &infologLength);\n GL_CHECK_ERROR\n }\n#endif\n else if(glIsProgram(obj))\n {\n glValidateProgram(obj);\n glGetProgramiv(obj, GL_INFO_LOG_LENGTH, &infologLength);\n GL_CHECK_ERROR\n }\n\n\t\t\tif (infologLength > 1)\n\t\t\t{\n\t\t\t\tGLint charsWritten = 0;\n\n\t\t\t\tchar * infoLog = new char [infologLength];\n\t\t\t\tinfoLog[0] = 0;\n\n if(glIsShader(obj))\n {\n glGetShaderInfoLog(obj, infologLength, &charsWritten, infoLog);\n GL_CHECK_ERROR\n }\n#if GL_EXT_separate_shader_objects\n else if(Root::getSingleton().getRenderSystem()->getCapabilities()->hasCapability(RSC_SEPARATE_SHADER_OBJECTS) &&\n glIsProgramPipelineEXT(obj))\n {\n glGetProgramPipelineInfoLogEXT(obj, infologLength, &charsWritten, infoLog);\n GL_CHECK_ERROR\n }\n#endif\n else if(glIsProgram(obj))\n {\n glGetProgramInfoLog(obj, infologLength, &charsWritten, infoLog);\n GL_CHECK_ERROR\n }\n\n\t\t\t\tif (strlen(infoLog) > 0)\n\t\t\t\t{\n\t\t\t\t\tlogMessage += \"\\n\" + String(infoLog);\n\t\t\t\t}\n\n\t\t\t\tOGRE_DELETE [] infoLog;\n\n\t\t\t\tif (logMessage.size() > 0)\n\t\t\t\t{\n\t\t\t\t\t\/\/ remove ends of line in the end - so there will be no empty lines in the log.\n\t\t\t\t\twhile( logMessage[logMessage.size() - 1] == '\\n' )\n\t\t\t\t\t{\n\t\t\t\t\t\tlogMessage.erase(logMessage.size() - 1, 1);\n\t\t\t\t\t}\n\t\t\t\t\tLogManager::getSingleton().logMessage(logMessage);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\n\t\treturn logMessage;\n\t}\n\n\n} \/\/ namespace Ogre\n<|endoftext|>"} {"text":"<commit_before>#include <SensekitUL\/streams\/Depth.h>\n#include <SenseKit\/Plugins\/plugin_capi.h>\n#include <SenseKit\/sensekit_capi.h>\n#include <Sensekit\/SenseKit.h>\n#include <SenseKit\/sensekit_types.h>\n\n#include <memory>\n#include <chrono>\n#include <iostream>\n#include <iomanip>\n\n#include <SFML\/Graphics.hpp>\n\n#include \"LitDepthVisualizer.h\"\n#include <common\/serialization\/FrameStreamWriter.h>\n#include <common\/serialization\/FrameOutputStream.h>\n\nusing namespace sensekit::serialization;\n\nclass PointFrameListener : public sensekit::FrameReadyListener\n{\npublic:\n PointFrameListener(sensekit::PointStream& pointStream)\n {\n m_lastTimepoint = clock_type::now();\n }\n\n ~PointFrameListener()\n {\n\n }\n\n void init_texture(int width, int height)\n {\n if (m_displayBuffer == nullptr || width != m_displayWidth || height != m_displayHeight)\n {\n m_displayWidth = width;\n m_displayHeight = height;\n\n \/\/ texture is RGBA\n int byteLength = m_displayWidth * m_displayHeight * 4;\n\n m_displayBuffer = BufferPtr(new uint8_t[byteLength]);\n memset(m_displayBuffer.get(), 0, byteLength);\n\n m_texture.create(m_displayWidth, m_displayHeight);\n m_sprite.setTexture(m_texture);\n m_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(sensekit::StreamReader& reader,\n sensekit::Frame& frame) override\n {\n sensekit::PointFrame pointFrame = frame.get<sensekit::PointFrame>();\n\n int width = pointFrame.resolutionX();\n int height = pointFrame.resolutionY();\n\n init_texture(width, height);\n\n m_visualizer.update(pointFrame);\n\n sensekit_rgb_pixel_t* vizBuffer = m_visualizer.get_output();\n for (int i = 0; i < width * height; i++)\n {\n int rgbaOffset = i * 4;\n m_displayBuffer[rgbaOffset] = vizBuffer[i].r;\n m_displayBuffer[rgbaOffset + 1] = vizBuffer[i].b;\n m_displayBuffer[rgbaOffset + 2] = vizBuffer[i].g;\n m_displayBuffer[rgbaOffset + 3] = 255;\n }\n m_texture.update(m_displayBuffer.get());\n\n if (m_shouldCheckFps)\n {\n check_fps();\n }\n }\n\n void set_shouldcheckfps(bool shouldCheckFps)\n {\n m_shouldCheckFps = shouldCheckFps;\n }\n\n void drawTo(sf::RenderWindow& window)\n {\n if (m_displayBuffer != nullptr)\n {\n float depthScale = window.getView().getSize().x \/ m_displayWidth;\n\n m_sprite.setScale(depthScale, depthScale);\n\n window.draw(m_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 sf::Texture m_texture;\n sf::Sprite m_sprite;\n\n using BufferPtr = std::unique_ptr<uint8_t[]>;\n BufferPtr m_displayBuffer{ nullptr };\n int m_displayWidth{0};\n int m_displayHeight{0};\n\n bool m_shouldCheckFps{false};\n};\n\nclass DepthFrameListener : public sensekit::FrameReadyListener\n{\npublic:\n DepthFrameListener(sensekit::DepthStream& depthStream, FrameStreamWriter& serializer)\n : m_frameStreamWriter(serializer)\n {\n\n }\n\n ~DepthFrameListener()\n {\n\n }\n\n virtual void on_frame_ready(sensekit::StreamReader& reader,\n sensekit::Frame& frame) override\n {\n sensekit::DepthFrame depthFrame = frame.get<sensekit::DepthFrame>();\n\n m_frameStreamWriter.write(depthFrame);\n }\n\nprivate:\n\n FrameStreamWriter& m_frameStreamWriter;\n};\n\nenum class AppState\n{\n STANDBY,\n PLAY,\n RECORD\n};\n\nclass AppStateManager\n{\npublic:\n AppStateManager()\n : m_appState(AppState::STANDBY)\n {\n\n }\n\n AppState get_app_state()\n {\n return m_appState;\n }\n\n void set_app_state(AppState appState)\n {\n m_appState = appState;\n }\n\nprivate:\n AppState m_appState;\n};\n\nvoid handle_escape_event(sf::Keyboard::Key key, sf::RenderWindow& window, AppStateManager& appStateManager)\n{\n AppState appState = appStateManager.get_app_state();\n\n if (key == sf::Keyboard::Escape)\n {\n window.close();\n }\n}\n\nvoid handle_play_event(sf::Keyboard::Key key, PointFrameListener& streamPlayerPsListener, AppStateManager& appStateManager)\n{\n AppState appState = appStateManager.get_app_state();\n\n if (key == sf::Keyboard::P && appState == AppState::STANDBY)\n {\n streamPlayerPsListener.set_shouldcheckfps(true);\n appStateManager.set_app_state(AppState::PLAY);\n }\n}\n\nvoid handle_stop_event(sf::Keyboard::Key key, PointFrameListener& streamPlayerPsListener, AppStateManager& appStateManager)\n{\n AppState appState = appStateManager.get_app_state();\n\n if (key == sf::Keyboard::S && appState == AppState::PLAY)\n {\n streamPlayerPsListener.set_shouldcheckfps(false);\n appStateManager.set_app_state(AppState::STANDBY);\n }\n}\n\nvoid handle_record_event(sf::Keyboard::Key key, PointFrameListener& sensorPsListener, FrameStreamWriter& streamWriter, AppStateManager& appStateManager)\n{\n AppState appState = appStateManager.get_app_state();\n\n if (key == sf::Keyboard::R)\n {\n if (appState == AppState::STANDBY)\n {\n sensorPsListener.set_shouldcheckfps(true);\n streamWriter.begin_write();\n appStateManager.set_app_state(AppState::RECORD);\n }\n if (appState == AppState::RECORD)\n {\n sensorPsListener.set_shouldcheckfps(false);\n streamWriter.end_write();\n appStateManager.set_app_state(AppState::STANDBY);\n }\n }\n}\n\nint main(int argc, char** argv)\n{\n AppStateManager appStateManager;\n\n FILE* outputFile = fopen(\"test.df\", \"wb\");;\n\n std::unique_ptr<FrameOutputStream> outputStream =\n std::unique_ptr<FrameOutputStream>(open_frame_output_stream(outputFile));\n FrameStreamWriter streamWriter(*outputStream.get());\n\n sensekit::SenseKit::initialize();\n\n sf::RenderWindow window(sf::VideoMode(1280, 960), \"Stream Recorder\");\n\n sensekit::Sensor sensor;\n sensekit::StreamReader sensorReader = sensor.create_reader();\n\n sensekit::Sensor streamPlayer(\"stream_player\");\n sensekit::StreamReader streamPlayerReader = streamPlayer.create_reader();\n\n auto sensorDs = sensorReader.stream<sensekit::DepthStream>();\n auto sensorPs = sensorReader.stream<sensekit::PointStream>();\n auto streamPlayerPs = streamPlayerReader.stream<sensekit::PointStream>();\n\n sensorDs.start();\n sensorPs.start();\n\n DepthFrameListener sensorDsListener(sensorDs, streamWriter);\n PointFrameListener sensorPsListener(sensorPs);\n PointFrameListener streamPlayerPsListener(streamPlayerPs);\n\n sensorReader.addListener(sensorDsListener);\n sensorReader.addListener(sensorPsListener);\n streamPlayerReader.addListener(streamPlayerPsListener);\n\n while (window.isOpen())\n {\n sensekit_temp_update();\n\n sf::Event event;\n\n window.clear(sf::Color::Black);\n\n while (window.pollEvent(event))\n {\n switch (event.type)\n {\n case sf::Event::Closed:\n window.close();\n break;\n case sf::Event::KeyPressed:\n sf::Keyboard::Key key = event.key.code;\n handle_escape_event(key, window, appStateManager);\n handle_stop_event(key, streamPlayerPsListener, appStateManager);\n handle_record_event(key, sensorPsListener, streamWriter, appStateManager);\n handle_play_event(key, streamPlayerPsListener, appStateManager);\n break;\n }\n }\n\n AppState appState = appStateManager.get_app_state();\n\n if (appState == AppState::PLAY)\n {\n streamPlayerPsListener.drawTo(window);\n }\n else if (appState == AppState::RECORD)\n {\n sensorPsListener.drawTo(window);\n }\n\n window.display();\n }\n\n sensekit::SenseKit::terminate();\n\n outputStream.reset();\n fclose(outputFile);\n\n return 0;\n}\n<commit_msg>Removes unnecessary parameter from handle_escape_event in StreamRecorder.<commit_after>#include <SensekitUL\/streams\/Depth.h>\n#include <SenseKit\/Plugins\/plugin_capi.h>\n#include <SenseKit\/sensekit_capi.h>\n#include <Sensekit\/SenseKit.h>\n#include <SenseKit\/sensekit_types.h>\n\n#include <memory>\n#include <chrono>\n#include <iostream>\n#include <iomanip>\n\n#include <SFML\/Graphics.hpp>\n\n#include \"LitDepthVisualizer.h\"\n#include <common\/serialization\/FrameStreamWriter.h>\n#include <common\/serialization\/FrameOutputStream.h>\n\nusing namespace sensekit::serialization;\n\nclass PointFrameListener : public sensekit::FrameReadyListener\n{\npublic:\n PointFrameListener(sensekit::PointStream& pointStream)\n {\n m_lastTimepoint = clock_type::now();\n }\n\n ~PointFrameListener()\n {\n\n }\n\n void init_texture(int width, int height)\n {\n if (m_displayBuffer == nullptr || width != m_displayWidth || height != m_displayHeight)\n {\n m_displayWidth = width;\n m_displayHeight = height;\n\n \/\/ texture is RGBA\n int byteLength = m_displayWidth * m_displayHeight * 4;\n\n m_displayBuffer = BufferPtr(new uint8_t[byteLength]);\n memset(m_displayBuffer.get(), 0, byteLength);\n\n m_texture.create(m_displayWidth, m_displayHeight);\n m_sprite.setTexture(m_texture);\n m_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(sensekit::StreamReader& reader,\n sensekit::Frame& frame) override\n {\n sensekit::PointFrame pointFrame = frame.get<sensekit::PointFrame>();\n\n int width = pointFrame.resolutionX();\n int height = pointFrame.resolutionY();\n\n init_texture(width, height);\n\n m_visualizer.update(pointFrame);\n\n sensekit_rgb_pixel_t* vizBuffer = m_visualizer.get_output();\n for (int i = 0; i < width * height; i++)\n {\n int rgbaOffset = i * 4;\n m_displayBuffer[rgbaOffset] = vizBuffer[i].r;\n m_displayBuffer[rgbaOffset + 1] = vizBuffer[i].b;\n m_displayBuffer[rgbaOffset + 2] = vizBuffer[i].g;\n m_displayBuffer[rgbaOffset + 3] = 255;\n }\n m_texture.update(m_displayBuffer.get());\n\n if (m_shouldCheckFps)\n {\n check_fps();\n }\n }\n\n void set_shouldcheckfps(bool shouldCheckFps)\n {\n m_shouldCheckFps = shouldCheckFps;\n }\n\n void drawTo(sf::RenderWindow& window)\n {\n if (m_displayBuffer != nullptr)\n {\n float depthScale = window.getView().getSize().x \/ m_displayWidth;\n\n m_sprite.setScale(depthScale, depthScale);\n\n window.draw(m_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 sf::Texture m_texture;\n sf::Sprite m_sprite;\n\n using BufferPtr = std::unique_ptr<uint8_t[]>;\n BufferPtr m_displayBuffer{ nullptr };\n int m_displayWidth{0};\n int m_displayHeight{0};\n\n bool m_shouldCheckFps{false};\n};\n\nclass DepthFrameListener : public sensekit::FrameReadyListener\n{\npublic:\n DepthFrameListener(sensekit::DepthStream& depthStream, FrameStreamWriter& serializer)\n : m_frameStreamWriter(serializer)\n {\n\n }\n\n ~DepthFrameListener()\n {\n\n }\n\n virtual void on_frame_ready(sensekit::StreamReader& reader,\n sensekit::Frame& frame) override\n {\n sensekit::DepthFrame depthFrame = frame.get<sensekit::DepthFrame>();\n\n m_frameStreamWriter.write(depthFrame);\n }\n\nprivate:\n\n FrameStreamWriter& m_frameStreamWriter;\n};\n\nenum class AppState\n{\n STANDBY,\n PLAY,\n RECORD\n};\n\nclass AppStateManager\n{\npublic:\n AppStateManager()\n : m_appState(AppState::STANDBY)\n {\n\n }\n\n AppState get_app_state()\n {\n return m_appState;\n }\n\n void set_app_state(AppState appState)\n {\n m_appState = appState;\n }\n\nprivate:\n AppState m_appState;\n};\n\nvoid handle_escape_event(sf::Keyboard::Key key, sf::RenderWindow& window)\n{\n if (key == sf::Keyboard::Escape)\n {\n window.close();\n }\n}\n\nvoid handle_play_event(sf::Keyboard::Key key, PointFrameListener& streamPlayerPsListener, AppStateManager& appStateManager)\n{\n AppState appState = appStateManager.get_app_state();\n\n if (key == sf::Keyboard::P && appState == AppState::STANDBY)\n {\n streamPlayerPsListener.set_shouldcheckfps(true);\n appStateManager.set_app_state(AppState::PLAY);\n }\n}\n\nvoid handle_stop_event(sf::Keyboard::Key key, PointFrameListener& streamPlayerPsListener, AppStateManager& appStateManager)\n{\n AppState appState = appStateManager.get_app_state();\n\n if (key == sf::Keyboard::S && appState == AppState::PLAY)\n {\n streamPlayerPsListener.set_shouldcheckfps(false);\n appStateManager.set_app_state(AppState::STANDBY);\n }\n}\n\nvoid handle_record_event(sf::Keyboard::Key key, PointFrameListener& sensorPsListener, FrameStreamWriter& streamWriter, AppStateManager& appStateManager)\n{\n AppState appState = appStateManager.get_app_state();\n\n if (key == sf::Keyboard::R)\n {\n if (appState == AppState::STANDBY)\n {\n sensorPsListener.set_shouldcheckfps(true);\n streamWriter.begin_write();\n appStateManager.set_app_state(AppState::RECORD);\n }\n if (appState == AppState::RECORD)\n {\n sensorPsListener.set_shouldcheckfps(false);\n streamWriter.end_write();\n appStateManager.set_app_state(AppState::STANDBY);\n }\n }\n}\n\nint main(int argc, char** argv)\n{\n AppStateManager appStateManager;\n\n FILE* outputFile = fopen(\"test.df\", \"wb\");;\n\n std::unique_ptr<FrameOutputStream> outputStream =\n std::unique_ptr<FrameOutputStream>(open_frame_output_stream(outputFile));\n FrameStreamWriter streamWriter(*outputStream.get());\n\n sensekit::SenseKit::initialize();\n\n sf::RenderWindow window(sf::VideoMode(1280, 960), \"Stream Recorder\");\n\n sensekit::Sensor sensor;\n sensekit::StreamReader sensorReader = sensor.create_reader();\n\n sensekit::Sensor streamPlayer(\"stream_player\");\n sensekit::StreamReader streamPlayerReader = streamPlayer.create_reader();\n\n auto sensorDs = sensorReader.stream<sensekit::DepthStream>();\n auto sensorPs = sensorReader.stream<sensekit::PointStream>();\n auto streamPlayerPs = streamPlayerReader.stream<sensekit::PointStream>();\n\n sensorDs.start();\n sensorPs.start();\n\n DepthFrameListener sensorDsListener(sensorDs, streamWriter);\n PointFrameListener sensorPsListener(sensorPs);\n PointFrameListener streamPlayerPsListener(streamPlayerPs);\n\n sensorReader.addListener(sensorDsListener);\n sensorReader.addListener(sensorPsListener);\n streamPlayerReader.addListener(streamPlayerPsListener);\n\n while (window.isOpen())\n {\n sensekit_temp_update();\n\n sf::Event event;\n\n window.clear(sf::Color::Black);\n\n while (window.pollEvent(event))\n {\n switch (event.type)\n {\n case sf::Event::Closed:\n window.close();\n break;\n case sf::Event::KeyPressed:\n sf::Keyboard::Key key = event.key.code;\n handle_escape_event(key, window);\n handle_stop_event(key, streamPlayerPsListener, appStateManager);\n handle_record_event(key, sensorPsListener, streamWriter, appStateManager);\n handle_play_event(key, streamPlayerPsListener, appStateManager);\n break;\n }\n }\n\n AppState appState = appStateManager.get_app_state();\n\n if (appState == AppState::PLAY)\n {\n streamPlayerPsListener.drawTo(window);\n }\n else if (appState == AppState::RECORD)\n {\n sensorPsListener.drawTo(window);\n }\n\n window.display();\n }\n\n sensekit::SenseKit::terminate();\n\n outputStream.reset();\n fclose(outputFile);\n\n return 0;\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 <sal\/config.h>\n#include <unotest\/filters-test.hxx>\n#include <test\/bootstrapfixture.hxx>\n#include <rtl\/strbuf.hxx>\n#include <osl\/file.hxx>\n\n#include <sfx2\/app.hxx>\n#include <sfx2\/docfilt.hxx>\n#include <sfx2\/docfile.hxx>\n#include <sfx2\/frame.hxx>\n#include <sfx2\/sfxmodelfactory.hxx>\n#include <svl\/stritem.hxx>\n\n#include <unotools\/tempfile.hxx>\n#include <comphelper\/storagehelper.hxx>\n\n#define CALC_DEBUG_OUTPUT 0\n#define TEST_BUG_FILES 0\n\n#include \"helper\/qahelper.hxx\"\n\n#include \"docsh.hxx\"\n#include \"postit.hxx\"\n#include \"patattr.hxx\"\n#include \"scitems.hxx\"\n#include \"document.hxx\"\n#include \"cellform.hxx\"\n\n#define ODS_FORMAT_TYPE 50331943\n#define XLS_FORMAT_TYPE 318767171\n#define XLSX_FORMAT_TYPE 268959811\n#define LOTUS123_FORMAT_TYPE 268435649\n\n#define ODS 0\n#define XLS 1\n#define XLSX 2\n#define LOTUS123 3\n\nusing namespace ::com::sun::star;\nusing namespace ::com::sun::star::uno;\n\nnamespace {\n\nstruct FileFormat {\n const char* pName; const char* pFilterName; const char* pTypeName; sal_uLong nFormatType;\n};\n\nFileFormat aFileFormats[] = {\n { \"ods\" , \"calc8\", \"\", ODS_FORMAT_TYPE },\n { \"xls\" , \"MS Excel 97\", \"calc_MS_EXCEL_97\", XLS_FORMAT_TYPE },\n { \"xlsx\", \"Calc MS Excel 2007 XML\" , \"MS Excel 2007 XML\", XLSX_FORMAT_TYPE },\n { \"123\" , \"Lotus\", \"calc_Lotus\", LOTUS123_FORMAT_TYPE }\n};\n\n}\n\nclass ScExportTest : public test::BootstrapFixture\n{\npublic:\n ScExportTest();\n\n virtual void setUp();\n virtual void tearDown();\n\n ScDocShellRef saveAndReload( ScDocShell*, const rtl::OUString&, const rtl::OUString&, const rtl::OUString&, sal_uLong );\n ScDocShellRef saveAndReloadPassword( ScDocShell*, const rtl::OUString&, const rtl::OUString&, const rtl::OUString&, sal_uLong );\n\n void test();\n void testPasswordExport();\n\n CPPUNIT_TEST_SUITE(ScExportTest);\n CPPUNIT_TEST(test);\n#if !defined(MACOSX) && !defined(DRAGONFLY) && !defined(WNT)\n CPPUNIT_TEST(testPasswordExport);\n#endif\n CPPUNIT_TEST_SUITE_END();\n\nprivate:\n rtl::OUString m_aBaseString;\n uno::Reference<uno::XInterface> m_xCalcComponent;\n};\n\n\/*\nvoid ScFiltersTest::createFileURL(const rtl::OUString& aFileBase, const rtl::OUString& aFileExtension, rtl::OUString& rFilePath)\n{\n rtl::OUString aSep(RTL_CONSTASCII_USTRINGPARAM(\"\/\"));\n rtl::OUStringBuffer aBuffer( getSrcRootURL() );\n aBuffer.append(m_aBaseString).append(aSep).append(aFileExtension);\n aBuffer.append(aSep).append(aFileBase).append(aFileExtension);\n rFilePath = aBuffer.makeStringAndClear();\n}\n*\/\n\nScDocShellRef ScExportTest::saveAndReloadPassword(ScDocShell* pShell, const rtl::OUString &rFilter,\n const rtl::OUString &rUserData, const rtl::OUString& rTypeName, sal_uLong nFormatType)\n{\n\n utl::TempFile aTempFile;\n \/\/aTempFile.EnableKillingFile();\n SfxMedium aStoreMedium( aTempFile.GetURL(), STREAM_STD_WRITE );\n sal_uInt32 nExportFormat = 0;\n if (nFormatType)\n nExportFormat = SFX_FILTER_EXPORT | SFX_FILTER_USESOPTIONS;\n SfxFilter* pExportFilter = new SfxFilter(\n rFilter,\n rtl::OUString(), nFormatType, nExportFormat, rTypeName, 0, rtl::OUString(),\n rUserData, rtl::OUString(RTL_CONSTASCII_USTRINGPARAM(\"private:factory\/scalc*\")) );\n pExportFilter->SetVersion(SOFFICE_FILEFORMAT_CURRENT);\n aStoreMedium.SetFilter(pExportFilter);\n SfxItemSet* pExportSet = aStoreMedium.GetItemSet();\n uno::Sequence< beans::NamedValue > aEncryptionData = comphelper::OStorageHelper::CreatePackageEncryptionData( rtl::OUString(\"test\") );\n uno::Any xEncryptionData;\n xEncryptionData <<= aEncryptionData;\n pExportSet->Put(SfxUnoAnyItem(SID_ENCRYPTIONDATA, xEncryptionData));\n\n uno::Reference< embed::XStorage > xMedStorage = aStoreMedium.GetStorage();\n ::comphelper::OStorageHelper::SetCommonStorageEncryptionData( xMedStorage, aEncryptionData );\n\n pShell->DoSaveAs( aStoreMedium );\n pShell->DoClose();\n\n std::cout << \"File: \" << aTempFile.GetURL() << std::endl;\n\n sal_uInt32 nFormat = 0;\n if (nFormatType)\n nFormat = SFX_FILTER_IMPORT | SFX_FILTER_USESOPTIONS;\n SfxFilter* pFilter = new SfxFilter(\n rFilter,\n rtl::OUString(), nFormatType, nFormat, rTypeName, 0, rtl::OUString(),\n rUserData, rtl::OUString(RTL_CONSTASCII_USTRINGPARAM(\"private:factory\/scalc*\")) );\n pFilter->SetVersion(SOFFICE_FILEFORMAT_CURRENT);\n\n ScDocShellRef xDocShRef = new ScDocShell;\n SfxMedium* pSrcMed = new SfxMedium(aTempFile.GetURL(), STREAM_STD_READ);\n SfxItemSet* pSet = pSrcMed->GetItemSet();\n pSet->Put(SfxStringItem(SID_PASSWORD, rtl::OUString(RTL_CONSTASCII_USTRINGPARAM(\"test\"))));\n pSrcMed->SetFilter(pFilter);\n if (!xDocShRef->DoLoad(pSrcMed))\n {\n xDocShRef->DoClose();\n \/\/ load failed.\n xDocShRef.Clear();\n }\n\n return xDocShRef;\n}\n\nScDocShellRef ScExportTest::saveAndReload(ScDocShell* pShell, const rtl::OUString &rFilter,\n const rtl::OUString &rUserData, const rtl::OUString& rTypeName, sal_uLong nFormatType)\n{\n\n utl::TempFile aTempFile;\n aTempFile.EnableKillingFile();\n SfxMedium aStoreMedium( aTempFile.GetURL(), STREAM_STD_WRITE );\n sal_uInt32 nExportFormat = 0;\n if (nFormatType)\n nExportFormat = SFX_FILTER_EXPORT | SFX_FILTER_USESOPTIONS;\n SfxFilter* pExportFilter = new SfxFilter(\n rFilter,\n rtl::OUString(), nFormatType, nExportFormat, rTypeName, 0, rtl::OUString(),\n rUserData, rtl::OUString(RTL_CONSTASCII_USTRINGPARAM(\"private:factory\/scalc*\")) );\n pExportFilter->SetVersion(SOFFICE_FILEFORMAT_CURRENT);\n aStoreMedium.SetFilter(pExportFilter);\n pShell->DoSaveAs( aStoreMedium );\n pShell->DoClose();\n\n \/\/std::cout << \"File: \" << aTempFile.GetURL() << std::endl;\n\n sal_uInt32 nFormat = 0;\n if (nFormatType)\n nFormat = SFX_FILTER_IMPORT | SFX_FILTER_USESOPTIONS;\n SfxFilter* pFilter = new SfxFilter(\n rFilter,\n rtl::OUString(), nFormatType, nFormat, rTypeName, 0, rtl::OUString(),\n rUserData, rtl::OUString(RTL_CONSTASCII_USTRINGPARAM(\"private:factory\/scalc*\")) );\n pFilter->SetVersion(SOFFICE_FILEFORMAT_CURRENT);\n\n ScDocShellRef xDocShRef = new ScDocShell;\n SfxMedium* pSrcMed = new SfxMedium(aTempFile.GetURL(), STREAM_STD_READ);\n pSrcMed->SetFilter(pFilter);\n if (!xDocShRef->DoLoad(pSrcMed))\n {\n xDocShRef->DoClose();\n \/\/ load failed.\n xDocShRef.Clear();\n }\n\n return xDocShRef;\n}\n\nvoid ScExportTest::test()\n{\n ScDocShell* pShell = new ScDocShell(\n SFXMODEL_STANDARD |\n SFXMODEL_DISABLE_EMBEDDED_SCRIPTS |\n SFXMODEL_DISABLE_DOCUMENT_RECOVERY);\n pShell->DoInitNew();\n\n ScDocument* pDoc = pShell->GetDocument();\n\n pDoc->SetValue(0,0,0, 1.0);\n CPPUNIT_ASSERT(pDoc);\n\n sal_Int32 nFormat = ODS;\n rtl::OUString aFileExtension(aFileFormats[nFormat].pName, strlen(aFileFormats[nFormat].pName), RTL_TEXTENCODING_UTF8 );\n rtl::OUString aFilterName(aFileFormats[nFormat].pFilterName, strlen(aFileFormats[nFormat].pFilterName), RTL_TEXTENCODING_UTF8) ;\n rtl::OUString aFilterType(aFileFormats[nFormat].pTypeName, strlen(aFileFormats[nFormat].pTypeName), RTL_TEXTENCODING_UTF8);\n ScDocShellRef xDocSh = saveAndReload(pShell, aFilterName, rtl::OUString(), aFilterType, aFileFormats[nFormat].nFormatType);\n\n CPPUNIT_ASSERT(xDocSh.Is());\n ScDocument* pLoadedDoc = xDocSh->GetDocument();\n double aVal = pLoadedDoc->GetValue(0,0,0);\n CPPUNIT_ASSERT_DOUBLES_EQUAL(aVal, 1.0, 1e-8);\n}\n\nvoid ScExportTest::testPasswordExport()\n{\n ScDocShell* pShell = new ScDocShell(\n SFXMODEL_STANDARD |\n SFXMODEL_DISABLE_EMBEDDED_SCRIPTS |\n SFXMODEL_DISABLE_DOCUMENT_RECOVERY);\n pShell->DoInitNew();\n\n ScDocument* pDoc = pShell->GetDocument();\n\n pDoc->SetValue(0,0,0, 1.0);\n CPPUNIT_ASSERT(pDoc);\n\n sal_Int32 nFormat = ODS;\n rtl::OUString aFileExtension(aFileFormats[nFormat].pName, strlen(aFileFormats[nFormat].pName), RTL_TEXTENCODING_UTF8 );\n rtl::OUString aFilterName(aFileFormats[nFormat].pFilterName, strlen(aFileFormats[nFormat].pFilterName), RTL_TEXTENCODING_UTF8) ;\n rtl::OUString aFilterType(aFileFormats[nFormat].pTypeName, strlen(aFileFormats[nFormat].pTypeName), RTL_TEXTENCODING_UTF8);\n ScDocShellRef xDocSh = saveAndReloadPassword(pShell, aFilterName, rtl::OUString(), aFilterType, aFileFormats[nFormat].nFormatType);\n\n CPPUNIT_ASSERT(xDocSh.Is());\n ScDocument* pLoadedDoc = xDocSh->GetDocument();\n double aVal = pLoadedDoc->GetValue(0,0,0);\n CPPUNIT_ASSERT_DOUBLES_EQUAL(aVal, 1.0, 1e-8);\n}\n\nScExportTest::ScExportTest()\n : m_aBaseString(RTL_CONSTASCII_USTRINGPARAM(\"\/sc\/qa\/unit\/data\"))\n{\n}\n\nvoid ScExportTest::setUp()\n{\n test::BootstrapFixture::setUp();\n\n \/\/ This is a bit of a fudge, we do this to ensure that ScGlobals::ensure,\n \/\/ which is a private symbol to us, gets called\n m_xCalcComponent =\n getMultiServiceFactory()->createInstance(rtl::OUString(\n RTL_CONSTASCII_USTRINGPARAM(\"com.sun.star.comp.Calc.SpreadsheetDocument\")));\n CPPUNIT_ASSERT_MESSAGE(\"no calc component!\", m_xCalcComponent.is());\n}\n\nvoid ScExportTest::tearDown()\n{\n uno::Reference< lang::XComponent >( m_xCalcComponent, UNO_QUERY_THROW )->dispose();\n test::BootstrapFixture::tearDown();\n}\n\nCPPUNIT_TEST_SUITE_REGISTRATION(ScExportTest);\n\nCPPUNIT_PLUGIN_IMPLEMENT();\n\n\/* vim:set shiftwidth=4 softtabstop=4 expandtab: *\/\n<commit_msg>remove the temp file after loading<commit_after>\/* -*- Mode: C++; tab-width: 4; indent-tabs-mode: nil; c-basic-offset: 4 -*- *\/\n\/*\n * This file is part of the LibreOffice project.\n *\n * This Source Code Form is subject to the terms of the Mozilla Public\n * License, v. 2.0. If a copy of the MPL was not distributed with this\n * file, You can obtain one at http:\/\/mozilla.org\/MPL\/2.0\/.\n *\/\n\n#include <sal\/config.h>\n#include <unotest\/filters-test.hxx>\n#include <test\/bootstrapfixture.hxx>\n#include <rtl\/strbuf.hxx>\n#include <osl\/file.hxx>\n\n#include <sfx2\/app.hxx>\n#include <sfx2\/docfilt.hxx>\n#include <sfx2\/docfile.hxx>\n#include <sfx2\/frame.hxx>\n#include <sfx2\/sfxmodelfactory.hxx>\n#include <svl\/stritem.hxx>\n\n#include <unotools\/tempfile.hxx>\n#include <comphelper\/storagehelper.hxx>\n\n#define CALC_DEBUG_OUTPUT 0\n#define TEST_BUG_FILES 0\n\n#include \"helper\/qahelper.hxx\"\n\n#include \"docsh.hxx\"\n#include \"postit.hxx\"\n#include \"patattr.hxx\"\n#include \"scitems.hxx\"\n#include \"document.hxx\"\n#include \"cellform.hxx\"\n\n#define ODS_FORMAT_TYPE 50331943\n#define XLS_FORMAT_TYPE 318767171\n#define XLSX_FORMAT_TYPE 268959811\n#define LOTUS123_FORMAT_TYPE 268435649\n\n#define ODS 0\n#define XLS 1\n#define XLSX 2\n#define LOTUS123 3\n\nusing namespace ::com::sun::star;\nusing namespace ::com::sun::star::uno;\n\nnamespace {\n\nstruct FileFormat {\n const char* pName; const char* pFilterName; const char* pTypeName; sal_uLong nFormatType;\n};\n\nFileFormat aFileFormats[] = {\n { \"ods\" , \"calc8\", \"\", ODS_FORMAT_TYPE },\n { \"xls\" , \"MS Excel 97\", \"calc_MS_EXCEL_97\", XLS_FORMAT_TYPE },\n { \"xlsx\", \"Calc MS Excel 2007 XML\" , \"MS Excel 2007 XML\", XLSX_FORMAT_TYPE },\n { \"123\" , \"Lotus\", \"calc_Lotus\", LOTUS123_FORMAT_TYPE }\n};\n\n}\n\nclass ScExportTest : public test::BootstrapFixture\n{\npublic:\n ScExportTest();\n\n virtual void setUp();\n virtual void tearDown();\n\n ScDocShellRef saveAndReload( ScDocShell*, const rtl::OUString&, const rtl::OUString&, const rtl::OUString&, sal_uLong );\n ScDocShellRef saveAndReloadPassword( ScDocShell*, const rtl::OUString&, const rtl::OUString&, const rtl::OUString&, sal_uLong );\n\n void test();\n void testPasswordExport();\n\n CPPUNIT_TEST_SUITE(ScExportTest);\n CPPUNIT_TEST(test);\n#if !defined(MACOSX) && !defined(DRAGONFLY) && !defined(WNT)\n CPPUNIT_TEST(testPasswordExport);\n#endif\n CPPUNIT_TEST_SUITE_END();\n\nprivate:\n rtl::OUString m_aBaseString;\n uno::Reference<uno::XInterface> m_xCalcComponent;\n};\n\n\/*\nvoid ScFiltersTest::createFileURL(const rtl::OUString& aFileBase, const rtl::OUString& aFileExtension, rtl::OUString& rFilePath)\n{\n rtl::OUString aSep(RTL_CONSTASCII_USTRINGPARAM(\"\/\"));\n rtl::OUStringBuffer aBuffer( getSrcRootURL() );\n aBuffer.append(m_aBaseString).append(aSep).append(aFileExtension);\n aBuffer.append(aSep).append(aFileBase).append(aFileExtension);\n rFilePath = aBuffer.makeStringAndClear();\n}\n*\/\n\nScDocShellRef ScExportTest::saveAndReloadPassword(ScDocShell* pShell, const rtl::OUString &rFilter,\n const rtl::OUString &rUserData, const rtl::OUString& rTypeName, sal_uLong nFormatType)\n{\n\n utl::TempFile aTempFile;\n aTempFile.EnableKillingFile();\n SfxMedium aStoreMedium( aTempFile.GetURL(), STREAM_STD_WRITE );\n sal_uInt32 nExportFormat = 0;\n if (nFormatType)\n nExportFormat = SFX_FILTER_EXPORT | SFX_FILTER_USESOPTIONS;\n SfxFilter* pExportFilter = new SfxFilter(\n rFilter,\n rtl::OUString(), nFormatType, nExportFormat, rTypeName, 0, rtl::OUString(),\n rUserData, rtl::OUString(RTL_CONSTASCII_USTRINGPARAM(\"private:factory\/scalc*\")) );\n pExportFilter->SetVersion(SOFFICE_FILEFORMAT_CURRENT);\n aStoreMedium.SetFilter(pExportFilter);\n SfxItemSet* pExportSet = aStoreMedium.GetItemSet();\n uno::Sequence< beans::NamedValue > aEncryptionData = comphelper::OStorageHelper::CreatePackageEncryptionData( rtl::OUString(\"test\") );\n uno::Any xEncryptionData;\n xEncryptionData <<= aEncryptionData;\n pExportSet->Put(SfxUnoAnyItem(SID_ENCRYPTIONDATA, xEncryptionData));\n\n uno::Reference< embed::XStorage > xMedStorage = aStoreMedium.GetStorage();\n ::comphelper::OStorageHelper::SetCommonStorageEncryptionData( xMedStorage, aEncryptionData );\n\n pShell->DoSaveAs( aStoreMedium );\n pShell->DoClose();\n\n \/\/std::cout << \"File: \" << aTempFile.GetURL() << std::endl;\n\n sal_uInt32 nFormat = 0;\n if (nFormatType)\n nFormat = SFX_FILTER_IMPORT | SFX_FILTER_USESOPTIONS;\n SfxFilter* pFilter = new SfxFilter(\n rFilter,\n rtl::OUString(), nFormatType, nFormat, rTypeName, 0, rtl::OUString(),\n rUserData, rtl::OUString(RTL_CONSTASCII_USTRINGPARAM(\"private:factory\/scalc*\")) );\n pFilter->SetVersion(SOFFICE_FILEFORMAT_CURRENT);\n\n ScDocShellRef xDocShRef = new ScDocShell;\n SfxMedium* pSrcMed = new SfxMedium(aTempFile.GetURL(), STREAM_STD_READ);\n SfxItemSet* pSet = pSrcMed->GetItemSet();\n pSet->Put(SfxStringItem(SID_PASSWORD, rtl::OUString(RTL_CONSTASCII_USTRINGPARAM(\"test\"))));\n pSrcMed->SetFilter(pFilter);\n if (!xDocShRef->DoLoad(pSrcMed))\n {\n xDocShRef->DoClose();\n \/\/ load failed.\n xDocShRef.Clear();\n }\n\n return xDocShRef;\n}\n\nScDocShellRef ScExportTest::saveAndReload(ScDocShell* pShell, const rtl::OUString &rFilter,\n const rtl::OUString &rUserData, const rtl::OUString& rTypeName, sal_uLong nFormatType)\n{\n\n utl::TempFile aTempFile;\n aTempFile.EnableKillingFile();\n SfxMedium aStoreMedium( aTempFile.GetURL(), STREAM_STD_WRITE );\n sal_uInt32 nExportFormat = 0;\n if (nFormatType)\n nExportFormat = SFX_FILTER_EXPORT | SFX_FILTER_USESOPTIONS;\n SfxFilter* pExportFilter = new SfxFilter(\n rFilter,\n rtl::OUString(), nFormatType, nExportFormat, rTypeName, 0, rtl::OUString(),\n rUserData, rtl::OUString(RTL_CONSTASCII_USTRINGPARAM(\"private:factory\/scalc*\")) );\n pExportFilter->SetVersion(SOFFICE_FILEFORMAT_CURRENT);\n aStoreMedium.SetFilter(pExportFilter);\n pShell->DoSaveAs( aStoreMedium );\n pShell->DoClose();\n\n \/\/std::cout << \"File: \" << aTempFile.GetURL() << std::endl;\n\n sal_uInt32 nFormat = 0;\n if (nFormatType)\n nFormat = SFX_FILTER_IMPORT | SFX_FILTER_USESOPTIONS;\n SfxFilter* pFilter = new SfxFilter(\n rFilter,\n rtl::OUString(), nFormatType, nFormat, rTypeName, 0, rtl::OUString(),\n rUserData, rtl::OUString(RTL_CONSTASCII_USTRINGPARAM(\"private:factory\/scalc*\")) );\n pFilter->SetVersion(SOFFICE_FILEFORMAT_CURRENT);\n\n ScDocShellRef xDocShRef = new ScDocShell;\n SfxMedium* pSrcMed = new SfxMedium(aTempFile.GetURL(), STREAM_STD_READ);\n pSrcMed->SetFilter(pFilter);\n if (!xDocShRef->DoLoad(pSrcMed))\n {\n xDocShRef->DoClose();\n \/\/ load failed.\n xDocShRef.Clear();\n }\n\n return xDocShRef;\n}\n\nvoid ScExportTest::test()\n{\n ScDocShell* pShell = new ScDocShell(\n SFXMODEL_STANDARD |\n SFXMODEL_DISABLE_EMBEDDED_SCRIPTS |\n SFXMODEL_DISABLE_DOCUMENT_RECOVERY);\n pShell->DoInitNew();\n\n ScDocument* pDoc = pShell->GetDocument();\n\n pDoc->SetValue(0,0,0, 1.0);\n CPPUNIT_ASSERT(pDoc);\n\n sal_Int32 nFormat = ODS;\n rtl::OUString aFileExtension(aFileFormats[nFormat].pName, strlen(aFileFormats[nFormat].pName), RTL_TEXTENCODING_UTF8 );\n rtl::OUString aFilterName(aFileFormats[nFormat].pFilterName, strlen(aFileFormats[nFormat].pFilterName), RTL_TEXTENCODING_UTF8) ;\n rtl::OUString aFilterType(aFileFormats[nFormat].pTypeName, strlen(aFileFormats[nFormat].pTypeName), RTL_TEXTENCODING_UTF8);\n ScDocShellRef xDocSh = saveAndReload(pShell, aFilterName, rtl::OUString(), aFilterType, aFileFormats[nFormat].nFormatType);\n\n CPPUNIT_ASSERT(xDocSh.Is());\n ScDocument* pLoadedDoc = xDocSh->GetDocument();\n double aVal = pLoadedDoc->GetValue(0,0,0);\n CPPUNIT_ASSERT_DOUBLES_EQUAL(aVal, 1.0, 1e-8);\n}\n\nvoid ScExportTest::testPasswordExport()\n{\n ScDocShell* pShell = new ScDocShell(\n SFXMODEL_STANDARD |\n SFXMODEL_DISABLE_EMBEDDED_SCRIPTS |\n SFXMODEL_DISABLE_DOCUMENT_RECOVERY);\n pShell->DoInitNew();\n\n ScDocument* pDoc = pShell->GetDocument();\n\n pDoc->SetValue(0,0,0, 1.0);\n CPPUNIT_ASSERT(pDoc);\n\n sal_Int32 nFormat = ODS;\n rtl::OUString aFileExtension(aFileFormats[nFormat].pName, strlen(aFileFormats[nFormat].pName), RTL_TEXTENCODING_UTF8 );\n rtl::OUString aFilterName(aFileFormats[nFormat].pFilterName, strlen(aFileFormats[nFormat].pFilterName), RTL_TEXTENCODING_UTF8) ;\n rtl::OUString aFilterType(aFileFormats[nFormat].pTypeName, strlen(aFileFormats[nFormat].pTypeName), RTL_TEXTENCODING_UTF8);\n ScDocShellRef xDocSh = saveAndReloadPassword(pShell, aFilterName, rtl::OUString(), aFilterType, aFileFormats[nFormat].nFormatType);\n\n CPPUNIT_ASSERT(xDocSh.Is());\n ScDocument* pLoadedDoc = xDocSh->GetDocument();\n double aVal = pLoadedDoc->GetValue(0,0,0);\n CPPUNIT_ASSERT_DOUBLES_EQUAL(aVal, 1.0, 1e-8);\n}\n\nScExportTest::ScExportTest()\n : m_aBaseString(RTL_CONSTASCII_USTRINGPARAM(\"\/sc\/qa\/unit\/data\"))\n{\n}\n\nvoid ScExportTest::setUp()\n{\n test::BootstrapFixture::setUp();\n\n \/\/ This is a bit of a fudge, we do this to ensure that ScGlobals::ensure,\n \/\/ which is a private symbol to us, gets called\n m_xCalcComponent =\n getMultiServiceFactory()->createInstance(rtl::OUString(\n RTL_CONSTASCII_USTRINGPARAM(\"com.sun.star.comp.Calc.SpreadsheetDocument\")));\n CPPUNIT_ASSERT_MESSAGE(\"no calc component!\", m_xCalcComponent.is());\n}\n\nvoid ScExportTest::tearDown()\n{\n uno::Reference< lang::XComponent >( m_xCalcComponent, UNO_QUERY_THROW )->dispose();\n test::BootstrapFixture::tearDown();\n}\n\nCPPUNIT_TEST_SUITE_REGISTRATION(ScExportTest);\n\nCPPUNIT_PLUGIN_IMPLEMENT();\n\n\/* vim:set shiftwidth=4 softtabstop=4 expandtab: *\/\n<|endoftext|>"} {"text":"<commit_before>#include \"cinder\/app\/AppNative.h\"\n#include \"cinder\/app\/RendererGl.h\"\n#include \"cinder\/gl\/gl.h\"\n\n#include \"Choreograph.hpp\"\n#include \"cinder\/Easing.h\"\n\nusing namespace ci;\nusing namespace ci::app;\nusing namespace std;\n\nusing namespace choreograph;\n\nclass ChoreographDevApp : public AppNative {\n public:\n\tvoid setup() override;\n\tvoid mouseDown( MouseEvent event ) override;\n\tvoid update() override;\n\tvoid draw() override;\nprivate:\n float _ball_y;\n ci::vec2 _ball_2 = ci::vec2( 400.0f, 400.0f );\n float _ball_radius = 50.0f;\n co::Timeline _anim;\n};\n\nvoid ChoreographDevApp::setup()\n{\n auto &sequence = _anim.move( &_ball_y )\n .startFn( [] (Motion<float> &c) { cout << \"Start red\" << endl; } )\n .getSequence().set( 5.0f ).hold( 0.5f ).rampTo( 500.0f, 1.0f, EaseInOutQuad() ).hold( 500.0f, 0.33f ).rampTo( 700.0f, 1.0f ).hold( 20.0f, 1.0f ).set( 400.0f );\n\n _anim.move( &_ball_2 )\n .startFn( [] (Motion<vec2> &c) { cout << \"Start blue\" << endl; } )\n .finishFn( [] (Motion<vec2> &c) { c.playbackSpeed( c.getPlaybackSpeed() * -1.0f ); } )\n .continuous( true )\n .updateFn( [&] (const vec2 &v) {\n vec2 size = app::getWindowSize();\n float shortest = std::min( v.x, size.x - v.x );\n shortest = std::min( shortest, size.y - v.y );\n shortest = std::min( shortest, v.y );\n _ball_radius = shortest;\n } )\n .getSequence().rampTo( vec2( app::getWindowSize() ) \/ 2.0f, 2.0f ).rampTo( vec2( app::getWindowSize() ), 2.0f ).rampTo( vec2( app::getWindowWidth() \/ 2.0f, 10.0f ), 3.0f ).rampTo( vec2( app::getWindowSize() ) \/ 2.0f, 0.5f );\n\n}\n\nvoid ChoreographDevApp::mouseDown( MouseEvent event )\n{\n}\n\nvoid ChoreographDevApp::update()\n{\n _anim.step( 1.0f \/ 60.0f );\n}\n\nvoid ChoreographDevApp::draw()\n{\n\tgl::clear( Color( 0, 0, 0 ) );\n\n gl::disableDepthRead();\n gl::disableDepthWrite();\n\n gl::clear( Color( 0, 0, 0 ) );\n gl::color( Color( 1.0f, 0.0f, 0.0f ) );\n gl::drawSolidCircle( vec2( 200.0f, _ball_y ), 120.0f );\n gl::color( 0.0f, 0.0f, 1.0f );\n gl::drawSolidCircle( _ball_2, _ball_radius );\n}\n\nCINDER_APP_NATIVE( ChoreographDevApp, RendererGl )\n<commit_msg>Remove unused variable.<commit_after>#include \"cinder\/app\/AppNative.h\"\n#include \"cinder\/app\/RendererGl.h\"\n#include \"cinder\/gl\/gl.h\"\n\n#include \"Choreograph.hpp\"\n#include \"cinder\/Easing.h\"\n\nusing namespace ci;\nusing namespace ci::app;\nusing namespace std;\n\nusing namespace choreograph;\n\nclass ChoreographDevApp : public AppNative {\n public:\n\tvoid setup() override;\n\tvoid mouseDown( MouseEvent event ) override;\n\tvoid update() override;\n\tvoid draw() override;\nprivate:\n float _ball_y;\n ci::vec2 _ball_2 = ci::vec2( 400.0f, 400.0f );\n float _ball_radius = 50.0f;\n co::Timeline _anim;\n};\n\nvoid ChoreographDevApp::setup()\n{\n _anim.move( &_ball_y )\n .startFn( [] (Motion<float> &c) { cout << \"Start red\" << endl; } )\n .getSequence().set( 5.0f ).hold( 0.5f ).rampTo( 500.0f, 1.0f, EaseInOutQuad() ).hold( 500.0f, 0.33f ).rampTo( 700.0f, 1.0f ).hold( 20.0f, 1.0f ).set( 400.0f );\n\n _anim.move( &_ball_2 )\n .startFn( [] (Motion<vec2> &c) { cout << \"Start blue\" << endl; } )\n .finishFn( [] (Motion<vec2> &c) { c.playbackSpeed( c.getPlaybackSpeed() * -1.0f ); } )\n .continuous( true )\n .updateFn( [&] (const vec2 &v) {\n vec2 size = app::getWindowSize();\n float shortest = std::min( v.x, size.x - v.x );\n shortest = std::min( shortest, size.y - v.y );\n shortest = std::min( shortest, v.y );\n _ball_radius = shortest;\n } )\n .getSequence().rampTo( vec2( app::getWindowSize() ) \/ 2.0f, 2.0f ).rampTo( vec2( app::getWindowSize() ), 2.0f ).rampTo( vec2( app::getWindowWidth() \/ 2.0f, 10.0f ), 3.0f ).rampTo( vec2( app::getWindowSize() ) \/ 2.0f, 0.5f );\n\n}\n\nvoid ChoreographDevApp::mouseDown( MouseEvent event )\n{\n}\n\nvoid ChoreographDevApp::update()\n{\n _anim.step( 1.0f \/ 60.0f );\n}\n\nvoid ChoreographDevApp::draw()\n{\n\tgl::clear( Color( 0, 0, 0 ) );\n\n gl::disableDepthRead();\n gl::disableDepthWrite();\n\n gl::clear( Color( 0, 0, 0 ) );\n gl::color( Color( 1.0f, 0.0f, 0.0f ) );\n gl::drawSolidCircle( vec2( 200.0f, _ball_y ), 120.0f );\n gl::color( 0.0f, 0.0f, 1.0f );\n gl::drawSolidCircle( _ball_2, _ball_radius );\n}\n\nCINDER_APP_NATIVE( ChoreographDevApp, RendererGl )\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 \"sitkBSplineTransform.h\"\n#include \"sitkPimpleTransform.hxx\"\n\n#include \"itkBSplineTransform.h\"\n\nnamespace itk\n{\nnamespace simple\n{\nnamespace\n{\n\/\/ convert an itk::Array of images to a stl vector of sitk images\ntemplate<typename TImageArrayType>\nstd::vector<Image> sitkImageArrayConvert(const TImageArrayType &a)\n{\n std::vector<Image> ret(a.Size());\n\n for( unsigned int i = 0; i < a.Size(); ++i )\n {\n ret[i] = Image(a[i]);\n }\n return ret;\n}\n}\n\n\n\/\/ construct identity\nBSplineTransform::BSplineTransform(unsigned int dimensions)\n : Transform( CreateBSplinePimpleTransform(dimensions) )\n{\n Self::InternalInitialization(Self::GetITKBase());\n}\n\nBSplineTransform::BSplineTransform( const BSplineTransform &arg )\n : Transform(arg)\n{\n Self::InternalInitialization(Self::GetITKBase());\n}\n\n\nBSplineTransform &BSplineTransform::operator=( const BSplineTransform &arg )\n{\n Superclass::operator=(arg);\n return *this;\n}\n\n\nBSplineTransform::Self &BSplineTransform::SetTransformDomainDirection(const std::vector<double> ¶ms)\n{\n this->MakeUniqueForWrite();\n this->m_pfSetTransformDomainDirection(params);\n return *this;\n}\n\n\nstd::vector<double> BSplineTransform::GetTransformDomainDirection() const\n{\n return this->m_pfGetTransformDomainDirection();\n}\n\n\nBSplineTransform::Self &BSplineTransform::SetTransformDomainMeshSize(const std::vector<unsigned int>¶ms)\n{\n this->MakeUniqueForWrite();\n this->m_pfSetTransformDomainMeshSize(params);\n return *this;\n}\n\n\nstd::vector<unsigned int> BSplineTransform::GetTransformDomainMeshSize() const\n{\n return this->m_pfGetTransformDomainMeshSize();\n}\n\n\nBSplineTransform::Self &BSplineTransform::SetTransformDomainOrigin(const std::vector<double>¶ms)\n{\n this->MakeUniqueForWrite();\n this->m_pfSetTransformDomainOrigin(params);\n return *this;\n}\n\n\nstd::vector<double> BSplineTransform::GetTransformDomainOrigin() const\n{\n return this->m_pfGetTransformDomainOrigin();\n}\n\n\nBSplineTransform::Self &BSplineTransform::SetTransformDomainPhysicalDimensions(const std::vector<double> ¶ms)\n{\n this->MakeUniqueForWrite();\n this->m_pfSetTransformDomainPhysicalDimensions(params);\n return *this;\n}\n\n\nstd::vector<double> BSplineTransform::GetTransformDomainPhysicalDimensions() const\n{\n return this->m_pfGetTransformDomainPhysicalDimensions();\n}\n\n\nstd::vector<Image> BSplineTransform::GetCoefficientImages () const\n{\n return this->m_pfGetCoefficientImages();\n}\n\n\nvoid BSplineTransform::SetPimpleTransform( PimpleTransformBase *pimpleTransform )\n{\n Superclass::SetPimpleTransform(pimpleTransform);\n Self::InternalInitialization(this->GetITKBase());\n}\n\nvoid BSplineTransform::InternalInitialization(itk::TransformBase *transform)\n{\n MyVisitor visitor;\n visitor.transform = transform;\n visitor.that = this;\n\n const unsigned int order = 3;\n\n typedef typelist::MakeTypeList<itk::BSplineTransform<double, 3, order>,\n itk::BSplineTransform<double, 2, order> >::Type TransformTypeList;\n\n typelist::Visit<TransformTypeList> callInternalInitialization;\n\n\n callInternalInitialization(visitor);\n\n}\n\n\ntemplate<class TransformType>\nvoid BSplineTransform::InternalInitialization(TransformType *t)\n{\n { \/\/ TransformDomainDirection\n typename TransformType::DirectionType (*pfSTLToITKDirection)(const std::vector<double> &) = &sitkSTLToITKDirection<typename TransformType::DirectionType>;\n this->m_pfSetTransformDomainDirection = nsstd::bind(&TransformType::SetTransformDomainDirection,t,nsstd::bind(pfSTLToITKDirection,nsstd::placeholders::_1));\n\n std::vector<double> (*pfITKDirectionToSTL)( const typename TransformType::DirectionType &) = &sitkITKDirectionToSTL<typename TransformType::DirectionType>;\n this->m_pfGetTransformDomainDirection = nsstd::bind(pfITKDirectionToSTL,nsstd::bind(&TransformType::GetTransformDomainDirection,t));\n }\n\n\n#define SITK_SET_MPF(NAME,ITK_TYPENAME, COMPONENT) \\\n { \\\n typedef ITK_TYPENAME itkType; \\\n itkType (*pfSTLToITK)(const std::vector<COMPONENT> &) = &sitkSTLVectorToITK<itkType, COMPONENT>; \\\n this->m_pfSet##NAME = nsstd::bind(&TransformType::Set##NAME,t,nsstd::bind(pfSTLToITK,nsstd::placeholders::_1)); \\\n \\\n std::vector<COMPONENT> (*pfITKToSTL)( const itkType &) = &sitkITKVectorToSTL<COMPONENT,itkType>; \\\n this->m_pfGet##NAME = nsstd::bind(pfITKToSTL,nsstd::bind(&TransformType::Get##NAME,t)); \\\n }\n\n\n\n \/\/ TransformDomainMeshSize\n SITK_SET_MPF( TransformDomainMeshSize, typename TransformType::MeshSizeType, unsigned int );\n \/\/ TransformDomainOrigin\n SITK_SET_MPF( TransformDomainOrigin, typename TransformType::OriginType, double );\n \/\/ TransformDomainPhysicalDimensions\n SITK_SET_MPF( TransformDomainPhysicalDimensions, typename TransformType::PhysicalDimensionsType, double );\n\n\n std::vector<Image> (*pfImageArrayConvert)(const typename TransformType::CoefficientImageArray &) = &sitkImageArrayConvert<typename TransformType::CoefficientImageArray>;\n this->m_pfGetCoefficientImages = nsstd::bind(pfImageArrayConvert, nsstd::bind(&TransformType::GetCoefficientImages,t) );\n}\n\nPimpleTransformBase *BSplineTransform::CreateBSplinePimpleTransform(unsigned int dimension)\n{\n PimpleTransformBase* temp = NULL;\n const unsigned int order = 3;\n switch (dimension)\n {\n case 2:\n temp = new PimpleTransform<itk::BSplineTransform<double,2,order> >();\n break;\n case 3:\n temp = new PimpleTransform<itk::BSplineTransform<double,3,order> >();\n break;\n default:\n sitkExceptionMacro(\"Invalid dimension for transform\");\n }\n return temp;\n}\n\n}\n}\n<commit_msg>Setting BSpline functions pointers to null before initialization<commit_after>\/*=========================================================================\n*\n* Copyright Insight Software Consortium\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http:\/\/www.apache.org\/licenses\/LICENSE-2.0.txt\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*\n*=========================================================================*\/\n#include \"sitkBSplineTransform.h\"\n#include \"sitkPimpleTransform.hxx\"\n\n#include \"itkBSplineTransform.h\"\n\nnamespace itk\n{\nnamespace simple\n{\nnamespace\n{\n\/\/ convert an itk::Array of images to a stl vector of sitk images\ntemplate<typename TImageArrayType>\nstd::vector<Image> sitkImageArrayConvert(const TImageArrayType &a)\n{\n std::vector<Image> ret(a.Size());\n\n for( unsigned int i = 0; i < a.Size(); ++i )\n {\n ret[i] = Image(a[i]);\n }\n return ret;\n}\n}\n\n\n\/\/ construct identity\nBSplineTransform::BSplineTransform(unsigned int dimensions)\n : Transform( CreateBSplinePimpleTransform(dimensions) )\n{\n Self::InternalInitialization(Self::GetITKBase());\n}\n\nBSplineTransform::BSplineTransform( const BSplineTransform &arg )\n : Transform(arg)\n{\n Self::InternalInitialization(Self::GetITKBase());\n}\n\n\nBSplineTransform &BSplineTransform::operator=( const BSplineTransform &arg )\n{\n Superclass::operator=(arg);\n return *this;\n}\n\n\nBSplineTransform::Self &BSplineTransform::SetTransformDomainDirection(const std::vector<double> ¶ms)\n{\n this->MakeUniqueForWrite();\n this->m_pfSetTransformDomainDirection(params);\n return *this;\n}\n\n\nstd::vector<double> BSplineTransform::GetTransformDomainDirection() const\n{\n return this->m_pfGetTransformDomainDirection();\n}\n\n\nBSplineTransform::Self &BSplineTransform::SetTransformDomainMeshSize(const std::vector<unsigned int>¶ms)\n{\n this->MakeUniqueForWrite();\n this->m_pfSetTransformDomainMeshSize(params);\n return *this;\n}\n\n\nstd::vector<unsigned int> BSplineTransform::GetTransformDomainMeshSize() const\n{\n return this->m_pfGetTransformDomainMeshSize();\n}\n\n\nBSplineTransform::Self &BSplineTransform::SetTransformDomainOrigin(const std::vector<double>¶ms)\n{\n this->MakeUniqueForWrite();\n this->m_pfSetTransformDomainOrigin(params);\n return *this;\n}\n\n\nstd::vector<double> BSplineTransform::GetTransformDomainOrigin() const\n{\n return this->m_pfGetTransformDomainOrigin();\n}\n\n\nBSplineTransform::Self &BSplineTransform::SetTransformDomainPhysicalDimensions(const std::vector<double> ¶ms)\n{\n this->MakeUniqueForWrite();\n this->m_pfSetTransformDomainPhysicalDimensions(params);\n return *this;\n}\n\n\nstd::vector<double> BSplineTransform::GetTransformDomainPhysicalDimensions() const\n{\n return this->m_pfGetTransformDomainPhysicalDimensions();\n}\n\n\nstd::vector<Image> BSplineTransform::GetCoefficientImages () const\n{\n return this->m_pfGetCoefficientImages();\n}\n\n\nvoid BSplineTransform::SetPimpleTransform( PimpleTransformBase *pimpleTransform )\n{\n Superclass::SetPimpleTransform(pimpleTransform);\n Self::InternalInitialization(this->GetITKBase());\n}\n\nvoid BSplineTransform::InternalInitialization(itk::TransformBase *transform)\n{\n MyVisitor visitor;\n visitor.transform = transform;\n visitor.that = this;\n\n const unsigned int order = 3;\n\n typedef typelist::MakeTypeList<itk::BSplineTransform<double, 3, order>,\n itk::BSplineTransform<double, 2, order> >::Type TransformTypeList;\n\n typelist::Visit<TransformTypeList> callInternalInitialization;\n\n \/\/ explicitly remove all function pointer with reference to prior transform\n this->m_pfGetTransformDomainDirection = SITK_NULLPTR;\n this->m_pfSetTransformDomainDirection = SITK_NULLPTR;\n this->m_pfGetTransformDomainMeshSize = SITK_NULLPTR;\n this->m_pfSetTransformDomainMeshSize = SITK_NULLPTR;\n this->m_pfGetTransformDomainOrigin = SITK_NULLPTR;\n this->m_pfSetTransformDomainOrigin = SITK_NULLPTR;\n this->m_pfGetTransformDomainPhysicalDimensions = SITK_NULLPTR;\n this->m_pfSetTransformDomainPhysicalDimensions = SITK_NULLPTR;\n this->m_pfGetCoefficientImages = SITK_NULLPTR;\n\n callInternalInitialization(visitor);\n\n}\n\n\ntemplate<class TransformType>\nvoid BSplineTransform::InternalInitialization(TransformType *t)\n{\n { \/\/ TransformDomainDirection\n typename TransformType::DirectionType (*pfSTLToITKDirection)(const std::vector<double> &) = &sitkSTLToITKDirection<typename TransformType::DirectionType>;\n this->m_pfSetTransformDomainDirection = nsstd::bind(&TransformType::SetTransformDomainDirection,t,nsstd::bind(pfSTLToITKDirection,nsstd::placeholders::_1));\n\n std::vector<double> (*pfITKDirectionToSTL)( const typename TransformType::DirectionType &) = &sitkITKDirectionToSTL<typename TransformType::DirectionType>;\n this->m_pfGetTransformDomainDirection = nsstd::bind(pfITKDirectionToSTL,nsstd::bind(&TransformType::GetTransformDomainDirection,t));\n }\n\n\n#define SITK_SET_MPF(NAME,ITK_TYPENAME, COMPONENT) \\\n { \\\n typedef ITK_TYPENAME itkType; \\\n itkType (*pfSTLToITK)(const std::vector<COMPONENT> &) = &sitkSTLVectorToITK<itkType, COMPONENT>; \\\n this->m_pfSet##NAME = nsstd::bind(&TransformType::Set##NAME,t,nsstd::bind(pfSTLToITK,nsstd::placeholders::_1)); \\\n \\\n std::vector<COMPONENT> (*pfITKToSTL)( const itkType &) = &sitkITKVectorToSTL<COMPONENT,itkType>; \\\n this->m_pfGet##NAME = nsstd::bind(pfITKToSTL,nsstd::bind(&TransformType::Get##NAME,t)); \\\n }\n\n\n\n \/\/ TransformDomainMeshSize\n SITK_SET_MPF( TransformDomainMeshSize, typename TransformType::MeshSizeType, unsigned int );\n \/\/ TransformDomainOrigin\n SITK_SET_MPF( TransformDomainOrigin, typename TransformType::OriginType, double );\n \/\/ TransformDomainPhysicalDimensions\n SITK_SET_MPF( TransformDomainPhysicalDimensions, typename TransformType::PhysicalDimensionsType, double );\n\n\n std::vector<Image> (*pfImageArrayConvert)(const typename TransformType::CoefficientImageArray &) = &sitkImageArrayConvert<typename TransformType::CoefficientImageArray>;\n this->m_pfGetCoefficientImages = nsstd::bind(pfImageArrayConvert, nsstd::bind(&TransformType::GetCoefficientImages,t) );\n}\n\nPimpleTransformBase *BSplineTransform::CreateBSplinePimpleTransform(unsigned int dimension)\n{\n PimpleTransformBase* temp = NULL;\n const unsigned int order = 3;\n switch (dimension)\n {\n case 2:\n temp = new PimpleTransform<itk::BSplineTransform<double,2,order> >();\n break;\n case 3:\n temp = new PimpleTransform<itk::BSplineTransform<double,3,order> >();\n break;\n default:\n sitkExceptionMacro(\"Invalid dimension for transform\");\n }\n return temp;\n}\n\n}\n}\n<|endoftext|>"} {"text":"<commit_before>\/**\n * @file examples\/megasync.cpp\n * @brief sample daemon, which synchronizes local and remote folders\n *\n * (c) 2013 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\n#ifdef _WIN32\n#include <conio.h>\n#endif\n\nusing namespace mega;\n\nclass SyncApp : public MegaApp\n{\n string local_folder;\n string remote_folder;\n handle cwd;\n bool initial_fetch;\n\n void debug_log(const char*);\n void login_result(error e);\n\n\tvoid fetchnodes_result (error e);\n\n void request_error(error e);\n\tvoid syncupdate_state(Sync*, syncstate_t);\n\n\tvoid syncupdate_stuck(string*);\n\tvoid syncupdate_local_folder_addition(Sync*, const char*);\n\tvoid syncupdate_local_folder_deletion(Sync*, const char*);\n\tvoid syncupdate_local_file_addition(Sync*, const char*);\n\tvoid syncupdate_local_file_deletion(Sync*, const char*);\n\tvoid syncupdate_local_file_change(Sync*, const char*);\n\tvoid syncupdate_local_move(Sync*, const char*, const char*);\n\tvoid syncupdate_get(Sync*, const char*);\n\tvoid syncupdate_put(Sync*, const char*);\n\tvoid syncupdate_remote_file_addition(Node*);\n\tvoid syncupdate_remote_file_deletion(Node*);\n\tvoid syncupdate_remote_folder_addition(Node*);\n\tvoid syncupdate_remote_folder_deletion(Node*);\n\tvoid syncupdate_remote_copy(Sync*, const char*);\n\tvoid syncupdate_remote_move(string*, string*);\n\tvoid syncupdate_treestate(LocalNode*);\n\n Node* nodebypath(const char* ptr, string* user, string* namepart);\npublic:\n bool debug;\n SyncApp (string local_folder_, string remote_folder_);\n};\n\n\/\/ globals\nMegaClient* client;\n\/\/bool mega::debug = false;\n\n\n\/\/ returns node pointer determined by path relative to cwd\n\/\/ Path naming conventions:\n\/\/ path is relative to cwd\n\/\/ \/path is relative to ROOT\n\/\/ \/\/in is in INBOX\n\/\/ \/\/bin is in RUBBISH\n\/\/ X: is user X's INBOX\n\/\/ X:SHARE is share SHARE from user X\n\/\/ : and \/ filename components, as well as the \\, must be escaped by \\.\n\/\/ (correct UTF-8 encoding is assumed)\n\/\/ returns NULL if path malformed or not found\nNode* SyncApp::nodebypath(const char* ptr, string* user = NULL, string* namepart = NULL)\n{\n\tvector<string> c;\n\tstring s;\n\tint l = 0;\n\tconst char* bptr = ptr;\n\tint remote = 0;\n\tNode* n;\n\tNode* nn;\n\n\t\/\/ split path by \/ or :\n\tdo {\n\t\tif (!l)\n\t\t{\n\t\t\tif (*ptr >= 0)\n\t\t\t{\n\t\t\t\tif (*ptr == '\\\\')\n\t\t\t\t{\n\t\t\t\t\tif (ptr > bptr) s.append(bptr,ptr-bptr);\n\t\t\t\t\tbptr = ++ptr;\n\n\t\t\t\t\tif (*bptr == 0)\n\t\t\t\t\t{\n\t\t\t\t\t\tc.push_back(s);\n\t\t\t\t\t\tbreak;\n\t\t\t\t\t}\n\n\t\t\t\t\tptr++;\n\t\t\t\t\tcontinue;\n\t\t\t\t}\n\n\t\t\t\tif (*ptr == '\/' || *ptr == ':' || !*ptr)\n\t\t\t\t{\n\t\t\t\t\tif (*ptr == ':')\n\t\t\t\t\t{\n\t\t\t\t\t\tif (c.size()) return NULL;\n\t\t\t\t\t\tremote = 1;\n\t\t\t\t\t}\n\n\t\t\t\t\tif (ptr > bptr) s.append(bptr,ptr-bptr);\n\n\t\t\t\t\tbptr = ptr+1;\n\n\t\t\t\t\tc.push_back(s);\n\n\t\t\t\t\ts.erase();\n\t\t\t\t}\n\t\t\t}\n\t\t\telse if ((*ptr & 0xf0) == 0xe0) l = 1;\n\t\t\telse if ((*ptr & 0xf8) == 0xf0) l = 2;\n\t\t\telse if ((*ptr & 0xfc) == 0xf8) l = 3;\n\t\t\telse if ((*ptr & 0xfe) == 0xfc) l = 4;\n\t\t}\n\t\telse l--;\n\t} while (*ptr++);\n\n\tif (l) return NULL;\n\n\tif (remote)\n\t{\n\t\t\/\/ target: user inbox - record username\/email and return NULL\n\t\tif (c.size() == 2 && !c[1].size())\n\t\t{\n\t\t\tif (user) *user = c[0];\n\t\t\treturn NULL;\n\t\t}\n\n\t\tUser* u;\n\n\t\tif ((u = client->finduser(c[0].c_str())))\n\t\t{\n\t\t\t\/\/ locate matching share from this user\n\t\t\thandle_set::iterator sit;\n\n\t\t\tfor (sit = u->sharing.begin(); sit != u->sharing.end(); sit++)\n\t\t\t{\n\t\t\t\tif ((n = client->nodebyhandle(*sit)))\n\t\t\t\t{\n\t\t\t\t\tif (!strcmp(c[1].c_str(),n->displayname()))\n\t\t\t\t\t{\n\t\t\t\t\t\tl = 2;\n\t\t\t\t\t\tbreak;\n\t\t\t\t\t}\n\t\t\t\t}\n\n\t\t\t\tif (l) break;\n\t\t\t}\n\t\t}\n\n\t\tif (!l) return NULL;\n\t}\n\telse\n\t{\n\t\t\/\/ path starting with \/\n\t\tif (c.size() > 1 && !c[0].size())\n\t\t{\n\t\t\t\/\/ path starting with \/\/\n\t\t\tif (c.size() > 2 && !c[1].size())\n\t\t\t{\n\t\t\t\tif (c[2] == \"in\") n = client->nodebyhandle(client->rootnodes[1]);\n\t\t\t\telse if (c[2] == \"bin\") n = client->nodebyhandle(client->rootnodes[2]);\n\t\t\t\telse if (c[2] == \"mail\") n = client->nodebyhandle(client->rootnodes[3]);\n\t\t\t\telse return NULL;\n\n\t\t\t\tl = 3;\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\tn = client->nodebyhandle(client->rootnodes[0]);\n\n\t\t\t\tl = 1;\n\t\t\t}\n\t\t}\n\t\telse n = client->nodebyhandle(cwd);\n\t}\n\n\t\/\/ parse relative path\n\twhile (n && l < (int)c.size())\n\t{\n\t\tif (c[l] != \".\")\n\t\t{\n\t\t\tif (c[l] == \"..\")\n\t\t\t{\n\t\t\t\tif (n->parent) n = n->parent;\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\t\/\/ locate child node (explicit ambiguity resolution: not implemented)\n\t\t\t\tif (c[l].size())\n\t\t\t\t{\n\t\t\t\t\tnn = client->childnodebyname(n,c[l].c_str());\n\n\t\t\t\t\tif (!nn)\n\t\t\t\t\t{\n\t\t\t\t\t\t\/\/ mv command target? return name part of not found\n\t\t\t\t\t\tif (namepart && l == (int)c.size()-1)\n\t\t\t\t\t\t{\n\t\t\t\t\t\t\t*namepart = c[l];\n\t\t\t\t\t\t\treturn n;\n\t\t\t\t\t\t}\n\n\t\t\t\t\t\treturn NULL;\n\t\t\t\t\t}\n\n\t\t\t\t\tn = nn;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\tl++;\n\t}\n\n\treturn n;\n}\n\nSyncApp:: SyncApp (string local_folder_, string remote_folder_):\n local_folder (local_folder_), remote_folder (remote_folder_), cwd (UNDEF), initial_fetch (true)\n{\n}\n\n\/\/ callback for displaying debug logs\nvoid SyncApp::debug_log(const char* message)\n{\n if (debug)\n cout << \"DEBUG: \" << message << endl;\n}\n\n\/\/ this callback function is called when we have login result (success or error)\n\/\/ TODO: check for errors\nvoid SyncApp::login_result(error e)\n{\n if (e != API_OK) {\n cout << \"FATAL: Failed to get login result, exiting\" << endl;\n exit (1);\n }\n \/\/ get the list of nodes\n client->fetchnodes();\n}\n\nvoid SyncApp::fetchnodes_result (error e)\n{\n if (e != API_OK) {\n cout << \"FATAL: Failed to fetch remote nodes, exiting\" << endl;\n exit (1);\n }\n\n cout << \"fetchnodes_result\" << endl;\n\n if (initial_fetch) {\n initial_fetch = false;\n if (ISUNDEF(cwd)) cwd = client->rootnodes[0];\n\n Node* n = nodebypath(remote_folder.c_str());\n if (client->checkaccess(n, FULL))\n {\n string localname;\n\n client->fsaccess->path2local(&local_folder, &localname);\n\n if (!n) {\n cout << remote_folder << \": Not found.\" << endl;\n exit (1);\n } else if (n->type == FILENODE) {\n cout << remote_folder << \": Remote sync root must be folder.\" << endl;\n exit (1);\n } else {\n\t\t\t\terror e = client->addsync(&localname,\"Debris\",NULL,n,0);\n if (e) {\n cout << \"Sync could not be added! \" << endl;\n exit (1);\n }\n\n cout << \"Sync started !\" << endl;\n }\n } else {\n cout << remote_folder << \": Syncing requires full access to path.\" << endl;\n exit (1);\n }\n }\n}\n\n\/\/ this callback function is called when request-level error occurred\nvoid SyncApp::request_error(error e)\n{\n cout << \"FATAL: Request failed, exiting\" << endl;\n exit (1);\n}\n\nvoid SyncApp::syncupdate_state(Sync*, syncstate_t state)\n{\n if (state == SYNC_CANCELED || state == SYNC_FAILED) {\n cout << \"FATAL: Sync failed !\" << endl;\n exit (1);\n } else if (state == SYNC_ACTIVE) {\n\t\tcout << \"Sync is now active\" << endl;\n }\n}\n\nvoid SyncApp::syncupdate_stuck(string* reason)\n{\n\tif (reason) cout << \"Sync halted: \" << *reason << \" temporarily in use\" << endl;\n\telse cout << \"Sync resumed\" << endl;\n}\n\n\/\/ sync update callbacks are for informational purposes only and must not change or delete the sync itself\nvoid SyncApp::syncupdate_local_folder_addition(Sync* sync, const char* path)\n{\n if (debug)\n\tcout << \"Sync - local folder addition detected: \" << path << endl;\n}\n\nvoid SyncApp::syncupdate_local_folder_deletion(Sync* sync, const char* path)\n{\n if (debug)\n\tcout << \"Sync - local folder deletion detected: \" << path << endl;\n}\n\nvoid SyncApp::syncupdate_local_file_addition(Sync* sync, const char* path)\n{\n if (debug)\n\tcout << \"Sync - local file addition detected: \" << path << endl;\n}\n\nvoid SyncApp::syncupdate_local_file_deletion(Sync* sync, const char* path)\n{\n if (debug)\n\tcout << \"Sync - local file deletion detected: \" << path << endl;\n}\n\nvoid SyncApp::syncupdate_local_file_change(Sync* sync, const char* path)\n{\n if (debug)\n\tcout << \"Sync - local file change detected: \" << path << endl;\n}\n\nvoid SyncApp::syncupdate_local_move(Sync*, const char* from, const char* to)\n{\n if (debug)\n\tcout << \"Sync - local rename\/move \" << from << \" -> \" << to << endl;\n}\n\nvoid SyncApp::syncupdate_remote_move(string* from, string* to)\n{\n if (debug)\n\tcout << \"Sync - remote rename\/move \" << *from << \" -> \" << *to << endl;\n}\n\nvoid SyncApp::syncupdate_remote_folder_addition(Node* n)\n{\n if (debug)\n\tcout << \"Sync - remote folder addition detected \" << n->displayname() << endl;\n}\n\nvoid SyncApp::syncupdate_remote_file_addition(Node* n)\n{\n if (debug)\n\tcout << \"Sync - remote file addition detected \" << n->displayname() << endl;\n}\n\nvoid SyncApp::syncupdate_remote_folder_deletion(Node* n)\n{\n if (debug)\n\tcout << \"Sync - remote folder deletion detected \" << n->displayname() << endl;\n}\n\nvoid SyncApp::syncupdate_remote_file_deletion(Node* n)\n{\n if (debug)\n\tcout << \"Sync - remote file deletion detected \" << n->displayname() << endl;\n}\n\nvoid SyncApp::syncupdate_get(Sync*, const char* path)\n{\n if (debug)\n\tcout << \"Sync - requesting file \" << path << endl;\n}\n\nvoid SyncApp::syncupdate_put(Sync*, const char* path)\n{\n if (debug)\n\tcout << \"Sync - sending file \" << path << endl;\n}\n\nvoid SyncApp::syncupdate_remote_copy(Sync*, const char* name)\n{\n if (debug)\n\tcout << \"Sync - creating remote file \" << name << \" by copying existing remote file\" << endl;\n}\n\nstatic const char* treestatename(treestate_t ts)\n{\n\tswitch (ts)\n\t{\n\t\tcase TREESTATE_NONE:\n\t\t\treturn \"None\/Undefined\";\n\t\tcase TREESTATE_SYNCED:\n\t\t\treturn \"Synced\";\n\t\tcase TREESTATE_PENDING:\n\t\t\treturn \"Pending\";\n\t\tcase TREESTATE_SYNCING:\n\t\t\treturn \"Syncing\";\n\t}\n\n\treturn \"UNKNOWN\";\n}\n\nvoid SyncApp::syncupdate_treestate(LocalNode* l)\n{\n if (debug)\n\tcout << \"Sync - state change of node \" << l->name << \" to \" << treestatename(l->ts) << endl;\n}\n\n\n\/\/\nint main (int argc, char *argv[])\n{\n static byte pwkey[SymmCipher::KEYLENGTH];\n bool is_active = true;\n SyncApp *app;\n\n if (argc < 3) {\n cout << \"Usage: \" << argv[0] << \" [local folder] [remote folder]\" << endl;\n return 1;\n }\n\n app = new SyncApp (argv[1], argv[2]);\n\n if (!getenv (\"MEGA_EMAIL\") || !getenv (\"MEGA_PWD\")) {\n cout << \"Please set both MEGA_EMAIL and MEGA_PWD env variables!\" << endl;\n return 1;\n }\n\n \/\/ if MEGA_DEBUG env variable is set\n if (getenv (\"MEGA_DEBUG\")) {\n if (!strcmp (getenv (\"MEGA_DEBUG\"), \"1\")) {\n app->debug = true;\n } else if (!strcmp (getenv (\"MEGA_DEBUG\"), \"2\")) {\n app->debug = true;\n mega::debug = true;\n }\n } \n\n \/\/ create MegaClient, providing our custom MegaApp and Waiter classes\n client = new MegaClient(app, new WAIT_CLASS, new HTTPIO_CLASS, new FSACCESS_CLASS,\n\/\/#ifdef DBACCESS_CLASS\n\/\/\tnew DBACCESS_CLASS,\n\/\/#else\n\tNULL,\n\/\/#endif\n \"megasync\", \"megaclisync\");\n\n \/\/ get values from env\n client->pw_key (getenv (\"MEGA_PWD\"), pwkey);\n client->login (getenv (\"MEGA_EMAIL\"), pwkey);\n\n while (is_active) {\n\t \/\/ pass the CPU to the engine (nonblocking)\n\t\tclient->exec();\n\t\tclient->wait();\n }\n\n return 0;\n}\n<commit_msg>remove mega::debug variable<commit_after>\/**\n * @file examples\/megasync.cpp\n * @brief sample daemon, which synchronizes local and remote folders\n *\n * (c) 2013 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\n#ifdef _WIN32\n#include <conio.h>\n#endif\n\nusing namespace mega;\n\nclass SyncApp : public MegaApp\n{\n string local_folder;\n string remote_folder;\n handle cwd;\n bool initial_fetch;\n\n void debug_log(const char*);\n void login_result(error e);\n\n\tvoid fetchnodes_result (error e);\n\n void request_error(error e);\n\tvoid syncupdate_state(Sync*, syncstate_t);\n\n\tvoid syncupdate_stuck(string*);\n\tvoid syncupdate_local_folder_addition(Sync*, const char*);\n\tvoid syncupdate_local_folder_deletion(Sync*, const char*);\n\tvoid syncupdate_local_file_addition(Sync*, const char*);\n\tvoid syncupdate_local_file_deletion(Sync*, const char*);\n\tvoid syncupdate_local_file_change(Sync*, const char*);\n\tvoid syncupdate_local_move(Sync*, const char*, const char*);\n\tvoid syncupdate_get(Sync*, const char*);\n\tvoid syncupdate_put(Sync*, const char*);\n\tvoid syncupdate_remote_file_addition(Node*);\n\tvoid syncupdate_remote_file_deletion(Node*);\n\tvoid syncupdate_remote_folder_addition(Node*);\n\tvoid syncupdate_remote_folder_deletion(Node*);\n\tvoid syncupdate_remote_copy(Sync*, const char*);\n\tvoid syncupdate_remote_move(string*, string*);\n\tvoid syncupdate_treestate(LocalNode*);\n\n Node* nodebypath(const char* ptr, string* user, string* namepart);\npublic:\n bool debug;\n SyncApp (string local_folder_, string remote_folder_);\n};\n\n\/\/ globals\nMegaClient* client;\n\n\/\/ returns node pointer determined by path relative to cwd\n\/\/ Path naming conventions:\n\/\/ path is relative to cwd\n\/\/ \/path is relative to ROOT\n\/\/ \/\/in is in INBOX\n\/\/ \/\/bin is in RUBBISH\n\/\/ X: is user X's INBOX\n\/\/ X:SHARE is share SHARE from user X\n\/\/ : and \/ filename components, as well as the \\, must be escaped by \\.\n\/\/ (correct UTF-8 encoding is assumed)\n\/\/ returns NULL if path malformed or not found\nNode* SyncApp::nodebypath(const char* ptr, string* user = NULL, string* namepart = NULL)\n{\n\tvector<string> c;\n\tstring s;\n\tint l = 0;\n\tconst char* bptr = ptr;\n\tint remote = 0;\n\tNode* n;\n\tNode* nn;\n\n\t\/\/ split path by \/ or :\n\tdo {\n\t\tif (!l)\n\t\t{\n\t\t\tif (*ptr >= 0)\n\t\t\t{\n\t\t\t\tif (*ptr == '\\\\')\n\t\t\t\t{\n\t\t\t\t\tif (ptr > bptr) s.append(bptr,ptr-bptr);\n\t\t\t\t\tbptr = ++ptr;\n\n\t\t\t\t\tif (*bptr == 0)\n\t\t\t\t\t{\n\t\t\t\t\t\tc.push_back(s);\n\t\t\t\t\t\tbreak;\n\t\t\t\t\t}\n\n\t\t\t\t\tptr++;\n\t\t\t\t\tcontinue;\n\t\t\t\t}\n\n\t\t\t\tif (*ptr == '\/' || *ptr == ':' || !*ptr)\n\t\t\t\t{\n\t\t\t\t\tif (*ptr == ':')\n\t\t\t\t\t{\n\t\t\t\t\t\tif (c.size()) return NULL;\n\t\t\t\t\t\tremote = 1;\n\t\t\t\t\t}\n\n\t\t\t\t\tif (ptr > bptr) s.append(bptr,ptr-bptr);\n\n\t\t\t\t\tbptr = ptr+1;\n\n\t\t\t\t\tc.push_back(s);\n\n\t\t\t\t\ts.erase();\n\t\t\t\t}\n\t\t\t}\n\t\t\telse if ((*ptr & 0xf0) == 0xe0) l = 1;\n\t\t\telse if ((*ptr & 0xf8) == 0xf0) l = 2;\n\t\t\telse if ((*ptr & 0xfc) == 0xf8) l = 3;\n\t\t\telse if ((*ptr & 0xfe) == 0xfc) l = 4;\n\t\t}\n\t\telse l--;\n\t} while (*ptr++);\n\n\tif (l) return NULL;\n\n\tif (remote)\n\t{\n\t\t\/\/ target: user inbox - record username\/email and return NULL\n\t\tif (c.size() == 2 && !c[1].size())\n\t\t{\n\t\t\tif (user) *user = c[0];\n\t\t\treturn NULL;\n\t\t}\n\n\t\tUser* u;\n\n\t\tif ((u = client->finduser(c[0].c_str())))\n\t\t{\n\t\t\t\/\/ locate matching share from this user\n\t\t\thandle_set::iterator sit;\n\n\t\t\tfor (sit = u->sharing.begin(); sit != u->sharing.end(); sit++)\n\t\t\t{\n\t\t\t\tif ((n = client->nodebyhandle(*sit)))\n\t\t\t\t{\n\t\t\t\t\tif (!strcmp(c[1].c_str(),n->displayname()))\n\t\t\t\t\t{\n\t\t\t\t\t\tl = 2;\n\t\t\t\t\t\tbreak;\n\t\t\t\t\t}\n\t\t\t\t}\n\n\t\t\t\tif (l) break;\n\t\t\t}\n\t\t}\n\n\t\tif (!l) return NULL;\n\t}\n\telse\n\t{\n\t\t\/\/ path starting with \/\n\t\tif (c.size() > 1 && !c[0].size())\n\t\t{\n\t\t\t\/\/ path starting with \/\/\n\t\t\tif (c.size() > 2 && !c[1].size())\n\t\t\t{\n\t\t\t\tif (c[2] == \"in\") n = client->nodebyhandle(client->rootnodes[1]);\n\t\t\t\telse if (c[2] == \"bin\") n = client->nodebyhandle(client->rootnodes[2]);\n\t\t\t\telse if (c[2] == \"mail\") n = client->nodebyhandle(client->rootnodes[3]);\n\t\t\t\telse return NULL;\n\n\t\t\t\tl = 3;\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\tn = client->nodebyhandle(client->rootnodes[0]);\n\n\t\t\t\tl = 1;\n\t\t\t}\n\t\t}\n\t\telse n = client->nodebyhandle(cwd);\n\t}\n\n\t\/\/ parse relative path\n\twhile (n && l < (int)c.size())\n\t{\n\t\tif (c[l] != \".\")\n\t\t{\n\t\t\tif (c[l] == \"..\")\n\t\t\t{\n\t\t\t\tif (n->parent) n = n->parent;\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\t\/\/ locate child node (explicit ambiguity resolution: not implemented)\n\t\t\t\tif (c[l].size())\n\t\t\t\t{\n\t\t\t\t\tnn = client->childnodebyname(n,c[l].c_str());\n\n\t\t\t\t\tif (!nn)\n\t\t\t\t\t{\n\t\t\t\t\t\t\/\/ mv command target? return name part of not found\n\t\t\t\t\t\tif (namepart && l == (int)c.size()-1)\n\t\t\t\t\t\t{\n\t\t\t\t\t\t\t*namepart = c[l];\n\t\t\t\t\t\t\treturn n;\n\t\t\t\t\t\t}\n\n\t\t\t\t\t\treturn NULL;\n\t\t\t\t\t}\n\n\t\t\t\t\tn = nn;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\tl++;\n\t}\n\n\treturn n;\n}\n\nSyncApp:: SyncApp (string local_folder_, string remote_folder_):\n local_folder (local_folder_), remote_folder (remote_folder_), cwd (UNDEF), initial_fetch (true)\n{\n}\n\n\/\/ callback for displaying debug logs\nvoid SyncApp::debug_log(const char* message)\n{\n if (debug)\n cout << \"DEBUG: \" << message << endl;\n}\n\n\/\/ this callback function is called when we have login result (success or error)\n\/\/ TODO: check for errors\nvoid SyncApp::login_result(error e)\n{\n if (e != API_OK) {\n cout << \"FATAL: Failed to get login result, exiting\" << endl;\n exit (1);\n }\n \/\/ get the list of nodes\n client->fetchnodes();\n}\n\nvoid SyncApp::fetchnodes_result (error e)\n{\n if (e != API_OK) {\n cout << \"FATAL: Failed to fetch remote nodes, exiting\" << endl;\n exit (1);\n }\n\n cout << \"fetchnodes_result\" << endl;\n\n if (initial_fetch) {\n initial_fetch = false;\n if (ISUNDEF(cwd)) cwd = client->rootnodes[0];\n\n Node* n = nodebypath(remote_folder.c_str());\n if (client->checkaccess(n, FULL))\n {\n string localname;\n\n client->fsaccess->path2local(&local_folder, &localname);\n\n if (!n) {\n cout << remote_folder << \": Not found.\" << endl;\n exit (1);\n } else if (n->type == FILENODE) {\n cout << remote_folder << \": Remote sync root must be folder.\" << endl;\n exit (1);\n } else {\n\t\t\t\terror e = client->addsync(&localname,\"Debris\",NULL,n,0);\n if (e) {\n cout << \"Sync could not be added! \" << endl;\n exit (1);\n }\n\n cout << \"Sync started !\" << endl;\n }\n } else {\n cout << remote_folder << \": Syncing requires full access to path.\" << endl;\n exit (1);\n }\n }\n}\n\n\/\/ this callback function is called when request-level error occurred\nvoid SyncApp::request_error(error e)\n{\n cout << \"FATAL: Request failed, exiting\" << endl;\n exit (1);\n}\n\nvoid SyncApp::syncupdate_state(Sync*, syncstate_t state)\n{\n if (state == SYNC_CANCELED || state == SYNC_FAILED) {\n cout << \"FATAL: Sync failed !\" << endl;\n exit (1);\n } else if (state == SYNC_ACTIVE) {\n\t\tcout << \"Sync is now active\" << endl;\n }\n}\n\nvoid SyncApp::syncupdate_stuck(string* reason)\n{\n\tif (reason) cout << \"Sync halted: \" << *reason << \" temporarily in use\" << endl;\n\telse cout << \"Sync resumed\" << endl;\n}\n\n\/\/ sync update callbacks are for informational purposes only and must not change or delete the sync itself\nvoid SyncApp::syncupdate_local_folder_addition(Sync* sync, const char* path)\n{\n if (debug)\n\tcout << \"Sync - local folder addition detected: \" << path << endl;\n}\n\nvoid SyncApp::syncupdate_local_folder_deletion(Sync* sync, const char* path)\n{\n if (debug)\n\tcout << \"Sync - local folder deletion detected: \" << path << endl;\n}\n\nvoid SyncApp::syncupdate_local_file_addition(Sync* sync, const char* path)\n{\n if (debug)\n\tcout << \"Sync - local file addition detected: \" << path << endl;\n}\n\nvoid SyncApp::syncupdate_local_file_deletion(Sync* sync, const char* path)\n{\n if (debug)\n\tcout << \"Sync - local file deletion detected: \" << path << endl;\n}\n\nvoid SyncApp::syncupdate_local_file_change(Sync* sync, const char* path)\n{\n if (debug)\n\tcout << \"Sync - local file change detected: \" << path << endl;\n}\n\nvoid SyncApp::syncupdate_local_move(Sync*, const char* from, const char* to)\n{\n if (debug)\n\tcout << \"Sync - local rename\/move \" << from << \" -> \" << to << endl;\n}\n\nvoid SyncApp::syncupdate_remote_move(string* from, string* to)\n{\n if (debug)\n\tcout << \"Sync - remote rename\/move \" << *from << \" -> \" << *to << endl;\n}\n\nvoid SyncApp::syncupdate_remote_folder_addition(Node* n)\n{\n if (debug)\n\tcout << \"Sync - remote folder addition detected \" << n->displayname() << endl;\n}\n\nvoid SyncApp::syncupdate_remote_file_addition(Node* n)\n{\n if (debug)\n\tcout << \"Sync - remote file addition detected \" << n->displayname() << endl;\n}\n\nvoid SyncApp::syncupdate_remote_folder_deletion(Node* n)\n{\n if (debug)\n\tcout << \"Sync - remote folder deletion detected \" << n->displayname() << endl;\n}\n\nvoid SyncApp::syncupdate_remote_file_deletion(Node* n)\n{\n if (debug)\n\tcout << \"Sync - remote file deletion detected \" << n->displayname() << endl;\n}\n\nvoid SyncApp::syncupdate_get(Sync*, const char* path)\n{\n if (debug)\n\tcout << \"Sync - requesting file \" << path << endl;\n}\n\nvoid SyncApp::syncupdate_put(Sync*, const char* path)\n{\n if (debug)\n\tcout << \"Sync - sending file \" << path << endl;\n}\n\nvoid SyncApp::syncupdate_remote_copy(Sync*, const char* name)\n{\n if (debug)\n\tcout << \"Sync - creating remote file \" << name << \" by copying existing remote file\" << endl;\n}\n\nstatic const char* treestatename(treestate_t ts)\n{\n\tswitch (ts)\n\t{\n\t\tcase TREESTATE_NONE:\n\t\t\treturn \"None\/Undefined\";\n\t\tcase TREESTATE_SYNCED:\n\t\t\treturn \"Synced\";\n\t\tcase TREESTATE_PENDING:\n\t\t\treturn \"Pending\";\n\t\tcase TREESTATE_SYNCING:\n\t\t\treturn \"Syncing\";\n\t}\n\n\treturn \"UNKNOWN\";\n}\n\nvoid SyncApp::syncupdate_treestate(LocalNode* l)\n{\n if (debug)\n\tcout << \"Sync - state change of node \" << l->name << \" to \" << treestatename(l->ts) << endl;\n}\n\n\n\/\/\nint main (int argc, char *argv[])\n{\n static byte pwkey[SymmCipher::KEYLENGTH];\n bool is_active = true;\n SyncApp *app;\n\n if (argc < 3) {\n cout << \"Usage: \" << argv[0] << \" [local folder] [remote folder]\" << endl;\n return 1;\n }\n\n app = new SyncApp (argv[1], argv[2]);\n\n if (!getenv (\"MEGA_EMAIL\") || !getenv (\"MEGA_PWD\")) {\n cout << \"Please set both MEGA_EMAIL and MEGA_PWD env variables!\" << endl;\n return 1;\n }\n\n \/\/ if MEGA_DEBUG env variable is set\n if (getenv (\"MEGA_DEBUG\")) {\n if (!strcmp (getenv (\"MEGA_DEBUG\"), \"1\")) {\n app->debug = true;\n } else if (!strcmp (getenv (\"MEGA_DEBUG\"), \"2\")) {\n app->debug = true;\n }\n }\n\n \/\/ create MegaClient, providing our custom MegaApp and Waiter classes\n client = new MegaClient(app, new WAIT_CLASS, new HTTPIO_CLASS, new FSACCESS_CLASS,\n\/\/#ifdef DBACCESS_CLASS\n\/\/\tnew DBACCESS_CLASS,\n\/\/#else\n\tNULL,\n\/\/#endif\n \"megasync\", \"megaclisync\");\n\n \/\/ get values from env\n client->pw_key (getenv (\"MEGA_PWD\"), pwkey);\n client->login (getenv (\"MEGA_EMAIL\"), pwkey);\n\n while (is_active) {\n\t \/\/ pass the CPU to the engine (nonblocking)\n\t\tclient->exec();\n\t\tclient->wait();\n }\n\n return 0;\n}\n<|endoftext|>"} {"text":"<commit_before>\/*****************************************************************************\n * Licensed to Qualys, Inc. (QUALYS) under one or more\n * contributor license agreements. See the NOTICE file distributed with\n * this work for additional information regarding copyright ownership.\n * QUALYS licenses this file to You under the Apache License, Version 2.0\n * (the \"License\"); you may not use this file except in compliance with\n * the License. You may obtain a copy of the License at\n *\n * http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n ****************************************************************************\/\n\n\/**\n * @file\n * @brief Predicate --- DAG\n *\n * Defines the base hierarchy for DAG nodes.\n *\n * @author Christopher Alfeld <calfeld@qualys.com>\n *\/\n\n#ifndef __PREDICATE__DAG__\n#define __PREDICATE__DAG__\n\n#include <boost\/foreach.hpp>\n#include <boost\/shared_ptr.hpp>\n#include <boost\/enable_shared_from_this.hpp>\n\n#include <iostream>\n#include <list>\n#include <string>\n\n#include <ironbeepp\/field.hpp>\n#include <ironbeepp\/transaction.hpp>\n\nnamespace IronBee {\nnamespace Predicate {\n\ntypedef IronBee::ConstField Value;\ntypedef IronBee::ConstTransaction Context;\n\nclass Node;\nclass Call;\nclass Literal;\nclass Null;\nclass String;\n\n\/\/ Defined in reporter.hpp\nclass NodeReporter;\n\/\/ Defined in merge_graph.hpp\nclass MergeGraph;\n\/\/ Defined in call_factory.hpp\nclass CallFactory;\n\n\/\/\/ @cond Impl\nnamespace Impl {\n\n\/**\n * Used to make certain classes unsubclassable.\n *\n * See C++ FAQ.\n **\/\nclass Final\n{\n \/\/ Classes to be final.\n friend class Null;\n friend class String;\nprivate:\n \/\/! Private constructor.\n Final() {}\n};\n\n} \/\/ Impl\n\/\/\/ @endcond\n\n\/**\n * Shared pointer to Node.\n **\/\ntypedef boost::shared_ptr<Node> node_p;\n\n\/**\n * Weak pointer to Node.\n **\/\ntypedef boost::weak_ptr<Node> weak_node_p;\n\n\/**\n * Shared const pointer to Node.\n **\/\ntypedef boost::shared_ptr<const Node> node_cp;\n\n\/**\n * Shared pointer to Call.\n **\/\ntypedef boost::shared_ptr<Call> call_p;\n\n\/**\n * Shared const pointer to Call.\n **\/\ntypedef boost::shared_ptr<const Call> call_cp;\n\n\/**\n * Shared pointer to Literal.\n **\/\ntypedef boost::shared_ptr<Literal> literal_p;\n\n\/**\n * Shared const pointer to Literal.\n **\/\ntypedef boost::shared_ptr<const Literal> literal_cp;\n\n\/\/! List of nodes. See children().\ntypedef std::list<node_p> node_list_t;\n\n\/\/! Weak list of nodes. See parents().\ntypedef std::list<weak_node_p> weak_node_list_t;\n\n\/**\n * A node in the predicate DAG.\n *\n * Nodes make up the predicate DAG. They also appear in the expressions trees\n * that are merged together to construct the DAG. This class is the top of\n * the class hierarchy for nodes. It can not be directly instantiated or\n * subclassed. For literal values, instantiate Null or String. For\n * call values, create and instantiate a subclass of Call.\n *\n * @sa Call\n * @sa Literal\n *\/\nclass Node :\n public boost::enable_shared_from_this<Node>\n{\n friend class Call;\n friend class Literal;\n\nprivate:\n \/\/! Private Constructor.\n Node();\n\npublic:\n\n \/\/! Destructor.\n virtual ~Node();\n\n \/**\n * S-Expression.\n *\n * An S-expression representation of the expression tree rooted at this\n * node. See parse.hpp for detailed grammar.\n *\n * This method returns a string reference, but this reference is not\n * stable if this node or any children are changed. It should be copied\n * if needed beyond such operations.\n *\n * S-Expressions are calculated dynamically and cached, so calling this\n * method is cheap.\n *\n * @return S-Expression of expression tree rooted at node.\n **\/\n virtual const std::string& to_s() const = 0;\n\n \/**\n * Add a child.\n *\n * Adds to end of children() and adds @c this to end of parents() of\n * child. Subclasses can add additional behavior.\n *\n * O(1)\n *\n * @param[in] child Child to add.\n * @throw IronBee::einval if ! @a child.\n **\/\n virtual void add_child(const node_p& child);\n\n \/**\n * Remove a child.\n *\n * Removes from children() and removes @c this from parents() of child.\n * Subclasses can add additional behavior.\n *\n * O(n) where n is size of children() of @c this or parents() of child.\n *\n * @param[in] child Child to remove.\n * @throw IronBee::enoent if no such child.\n * @throw IronBee::einval if not a parent of child.\n * @throw IronBee::einval if ! @a child.\n **\/\n virtual void remove_child(const node_p& child);\n\n \/**\n * Replace a child.\n *\n * Replaces a child with another node. This can be used to change\n * a child without moving it to the end of the children as remove_child(),\n * add_child() would.\n *\n * O(n) where n is size of children() of @c this or parents() of child.\n *\n * @param[in] child Child to replace.\n * @param[in] with Child to replace with.\n * @throw IronBee::enoent if no such child.\n * @throw IronBee::einval if not a parent of child.\n * @throw IronBee::einval if ! @a child or ! @a with.\n **\/\n virtual void replace_child(const node_p& child, const node_p& with);\n\n \/\/! Children accessor -- const.\n const node_list_t& children() const\n {\n return m_children;\n }\n \/\/! Parents accessor -- const.\n const weak_node_list_t& parents() const\n {\n return m_parents;\n }\n\n \/\/! True iff has value.\n bool has_value() const\n {\n return m_has_value;\n }\n\n \/\/! True iff node is a literal, in which case eval(Context()) is valid.\n bool is_literal() const;\n\n \/\/! Return value, calculating if needed.\n Value eval(Context context);\n\n \/\/! Return value, throwing if none.\n Value value() const;\n\n \/\/! Reset to valueless.\n void reset();\n\n \/**\n * Perform pre-transformation validations.\n *\n * This method may be overridden by a child. Default behavior is to do\n * nothing.\n *\n * @note Exceptions will not be immediately caught so should only be used\n * if it is appropriate to abort the entire predicate system, e.g.,\n * on an insanity error.\n *\n * @param[in] reporter Reporter to use for errors or warnings.\n **\/\n virtual void pre_transform(NodeReporter reporter) const;\n\n \/**\n * Perform transformations.\n *\n * This method may be overridden by a child. Default behavior is to\n * do nothing and return false.\n *\n * This method is called for every Node during the transformation phase.\n * If any such call returns true, the whole process is repeated.\n *\n * Transformations should not be done directly, but rather through\n * @a merge_graph(), i.e., do not use add_child(), remove_child(), or\n * replace_child(); instead use MergeGraph::add(), MergeGraph::remove(),\n * or MergeGraph::replace(). Note that your method can fetch a\n * @ref node_p for itself via shared_from_this().\n *\n * Note: Reporting errors will allow the current transformation loop to\n * continue for other nodes, but will then end the transformation phase.\n *\n * @param[in] reporter Reporter to use for errors or warnings.\n * @param[in] merge_graph MergeGraph used to change the DAG.\n * @param[in] call_factory CallFactory to create new nodes with.\n * @return true iff any changes were made.\n **\/\n virtual bool transform(\n NodeReporter reporter,\n MergeGraph& merge_graph,\n const CallFactory& call_factory\n );\n\n \/**\n * Perform post-transformation validations.\n *\n * See pre_transform() for additional discussion.\n * @param[in] reporter Reporter to use for errors or warnings.\n **\/\n virtual void post_transform(NodeReporter reporter) const;\n\nprotected:\n \/**\n * Calculate value.\n *\n * Subclass classes should implement this to calculate and return the\n * value.\n *\n * @param [in] context Contex of calculation.\n * @return Value of node.\n *\/\n virtual Value calculate(Context context) = 0;\n\nprivate:\n \/**\n * Remove this from parents of @a child.\n *\n * @param[in] child Child to unlink from.\n * @throw IronBee::einval if not in @a child's parent list.\n **\/\n void unlink_from_child(const node_p& child) const;\n\n bool m_has_value;\n Value m_value;\n weak_node_list_t m_parents;\n node_list_t m_children;\n};\n\n\/\/! Ostream output operator.\nstd::ostream& operator<<(std::ostream& out, const Node& node);\n\n\/**\n * Node representing a function Call.\n *\n * All Call nodes must have a name. Calls with the same name are considered\n * to implement the same function.\n *\n * This class is unique in the class hierarchy as being subclassable. Users\n * should create subclasses for specific functions. Subclasses must implement\n * name() and calculate(). Subclasses may also define add_child(),\n * remove_child(), and replace_child() but must call the parents methods\n* within.\n **\/\nclass Call :\n public Node\n{\npublic:\n \/\/! Constructor.\n Call();\n\n \/\/! See Node::add_child().\n virtual void add_child(const node_p& child);\n\n \/\/! See Node::remove_child().\n virtual void remove_child(const node_p& child);\n\n \/\/! See Node::replace_child().\n virtual void replace_child(const node_p& child, const node_p& with);\n\n \/\/! S-expression: (@c name children...)\n virtual const std::string& to_s() const;\n\n \/**\n * Name accessor.\n *\/\n virtual std::string name() const = 0;\n\nprivate:\n \/\/! Mark m_s as in need of recalculation.\n void reset_s() const;\n\n \/\/! Recalculate m_s.\n void recalculate_s() const;\n\n \/\/ Because name() is pure, Call::Call() can not calculate m_s. I.e., we\n \/\/ need to fully construct the class before setting m_s. So we have\n \/\/ to_s() calculate it on the fly the first time. The following two\n \/\/ members maintain that cache.\n\n \/\/! Have we calculate m_s at all?\n mutable bool m_calculated_s;\n\n \/\/! String form.\n mutable std::string m_s;\n};\n\n\/**\n * Literal node: no children and value independent of Context.\n *\n * This class may not be subclassed.\n **\/\nclass Literal :\n public Node\n{\n friend class String;\n friend class Null;\n\nprivate:\n \/\/! Private constructor to limit subclassing.\n Literal() {}\npublic:\n \/\/! @throw IronBee::einval always.\n virtual void add_child(const node_p&);\n \/\/! @throw IronBee::einval always.\n virtual void remove_child(const node_p&);\n \/\/! @throw IronBee::einval always.\n virtual void replace_child(const node_p& child, const node_p& with);\n};\n\n\/**\n * String literal: Literal node representing a string.\n *\n * This class may not be subclassed.\n **\/\nclass String :\n public Literal,\n public virtual Impl::Final\n{\npublic:\n \/**\n * Constructor.\n *\n * @param[in] s Value of node.\n **\/\n explicit\n String(const std::string& value);\n\n \/\/! Value as string.\n std::string value_as_s() const\n {\n return m_value_as_s;\n }\n\n \/\/! S-expression: 'value'\n virtual const std::string& to_s() const\n {\n return m_s;\n }\n\n \/**\n * Escape a string.\n *\n * Adds backslashes before all single quotes and backslashes.\n *\n * @param[in] s String to escape.\n * @return Escaped string.\n **\/\n static std::string escape(const std::string& s);\n\nprotected:\n \/\/! See Node::calculate()\n virtual Value calculate(Context context);\n\nprivate:\n \/\/! Value as a C++ string.\n const std::string m_value_as_s;\n \/\/! S-expression.\n const std::string m_s;\n \/\/! Memory pool to create field value from. Alias of m_value_as_s.\n boost::shared_ptr<\n IronBee::ScopedMemoryPool\n > m_pool;\n \/\/! Value returned by calculate().\n IronBee::ConstField m_value_as_field;\n};\n\n\/**\n * Null literal: Literal node representing the null value.\n *\n * This class may not be subclassed.\n **\/\nclass Null :\n public Literal,\n public virtual Impl::Final\n{\npublic:\n \/\/! S-expression: null\n virtual const std::string& to_s() const;\n\nprotected:\n \/\/! See Node::calculate()\n virtual Value calculate(Context context);\n};\n\n} \/\/ Predicate\n} \/\/ IronBee\n\n#endif\n<commit_msg>predicate\/dag: Improved documentation.<commit_after>\/*****************************************************************************\n * Licensed to Qualys, Inc. (QUALYS) under one or more\n * contributor license agreements. See the NOTICE file distributed with\n * this work for additional information regarding copyright ownership.\n * QUALYS licenses this file to You under the Apache License, Version 2.0\n * (the \"License\"); you may not use this file except in compliance with\n * the License. You may obtain a copy of the License at\n *\n * http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n ****************************************************************************\/\n\n\/**\n * @file\n * @brief Predicate --- DAG\n *\n * Defines the base hierarchy for DAG nodes.\n *\n * @author Christopher Alfeld <calfeld@qualys.com>\n *\/\n\n#ifndef __PREDICATE__DAG__\n#define __PREDICATE__DAG__\n\n#include <boost\/foreach.hpp>\n#include <boost\/shared_ptr.hpp>\n#include <boost\/enable_shared_from_this.hpp>\n\n#include <iostream>\n#include <list>\n#include <string>\n\n#include <ironbeepp\/field.hpp>\n#include <ironbeepp\/transaction.hpp>\n\nnamespace IronBee {\nnamespace Predicate {\n\n\/*\n * The following typedefs are the primary parameters for tying the public\n * API to IronBee. If this code was to be used in a different system, much\n * of the implementation, especially of standard.hpp, would need to change,\n * but changing these typedefs should suffice for adapating the\n * public API.\n *\/\n\n\/**\n * Value of a node.\n **\/\ntypedef IronBee::ConstField Value;\n\n\/**\n * Context a node is evaluated in.\n **\/\ntypedef IronBee::ConstTransaction Context;\n\n\/\/ Defined below.\nclass Node;\nclass Call;\nclass Literal;\nclass Null;\nclass String;\n\n\/\/ Defined in reporter.hpp\nclass NodeReporter;\n\/\/ Defined in merge_graph.hpp\nclass MergeGraph;\n\/\/ Defined in call_factory.hpp\nclass CallFactory;\n\n\/\/\/ @cond Impl\nnamespace Impl {\n\n\/**\n * Used to make certain classes unsubclassable.\n *\n * See C++ FAQ.\n **\/\nclass Final\n{\n \/\/ Classes to be final.\n friend class Null;\n friend class String;\nprivate:\n \/\/! Private constructor.\n Final() {}\n};\n\n} \/\/ Impl\n\/\/\/ @endcond\n\n\/**\n * Shared pointer to Node.\n **\/\ntypedef boost::shared_ptr<Node> node_p;\n\n\/**\n * Weak pointer to Node.\n **\/\ntypedef boost::weak_ptr<Node> weak_node_p;\n\n\/**\n * Shared const pointer to Node.\n **\/\ntypedef boost::shared_ptr<const Node> node_cp;\n\n\/**\n * Shared pointer to Call.\n **\/\ntypedef boost::shared_ptr<Call> call_p;\n\n\/**\n * Shared const pointer to Call.\n **\/\ntypedef boost::shared_ptr<const Call> call_cp;\n\n\/**\n * Shared pointer to Literal.\n **\/\ntypedef boost::shared_ptr<Literal> literal_p;\n\n\/**\n * Shared const pointer to Literal.\n **\/\ntypedef boost::shared_ptr<const Literal> literal_cp;\n\n\/\/! List of nodes. See children().\ntypedef std::list<node_p> node_list_t;\n\n\/\/! Weak list of nodes. See parents().\ntypedef std::list<weak_node_p> weak_node_list_t;\n\n\/**\n * A node in the predicate DAG.\n *\n * Nodes make up the predicate DAG. They also appear in the expressions trees\n * that are merged together to construct the DAG. This class is the top of\n * the class hierarchy for nodes. It can not be directly instantiated or\n * subclassed. For literal values, instantiate Null or String. For\n * call values, create and instantiate a subclass of Call.\n *\n * @sa Call\n * @sa Literal\n *\/\nclass Node :\n public boost::enable_shared_from_this<Node>\n{\n friend class Call;\n friend class Literal;\n\nprivate:\n \/\/! Private Constructor.\n Node();\n\npublic:\n\n \/\/! Destructor.\n virtual ~Node();\n\n \/**\n * S-Expression.\n *\n * An S-expression representation of the expression tree rooted at this\n * node. See parse.hpp for detailed grammar.\n *\n * This method returns a string reference, but this reference is not\n * stable if this node or any children are changed. It should be copied\n * if needed beyond such operations.\n *\n * S-Expressions are calculated dynamically and cached, so calling this\n * method is cheap.\n *\n * @return S-Expression of expression tree rooted at node.\n **\/\n virtual const std::string& to_s() const = 0;\n\n \/**\n * Add a child.\n *\n * Adds to end of children() and adds @c this to end of parents() of\n * child. Subclasses can add additional behavior.\n *\n * O(1)\n *\n * @param[in] child Child to add.\n * @throw IronBee::einval if ! @a child.\n **\/\n virtual void add_child(const node_p& child);\n\n \/**\n * Remove a child.\n *\n * Removes from children() and removes @c this from parents() of child.\n * Subclasses can add additional behavior.\n *\n * O(n) where n is size of children() of @c this or parents() of child.\n *\n * @param[in] child Child to remove.\n * @throw IronBee::enoent if no such child.\n * @throw IronBee::einval if not a parent of child.\n * @throw IronBee::einval if ! @a child.\n **\/\n virtual void remove_child(const node_p& child);\n\n \/**\n * Replace a child.\n *\n * Replaces a child with another node. This can be used to change\n * a child without moving it to the end of the children as remove_child(),\n * add_child() would.\n *\n * O(n) where n is size of children() of @c this or parents() of child.\n *\n * @param[in] child Child to replace.\n * @param[in] with Child to replace with.\n * @throw IronBee::enoent if no such child.\n * @throw IronBee::einval if not a parent of child.\n * @throw IronBee::einval if ! @a child or ! @a with.\n **\/\n virtual void replace_child(const node_p& child, const node_p& with);\n\n \/\/! Children accessor -- const.\n const node_list_t& children() const\n {\n return m_children;\n }\n \/\/! Parents accessor -- const.\n const weak_node_list_t& parents() const\n {\n return m_parents;\n }\n\n \/\/! True iff has value.\n bool has_value() const\n {\n return m_has_value;\n }\n\n \/\/! True iff node is a literal, in which case eval(Context()) is valid.\n bool is_literal() const;\n\n \/\/! Return value, calculating if needed.\n Value eval(Context context);\n\n \/\/! Return value, throwing if none.\n Value value() const;\n\n \/\/! Reset to valueless.\n void reset();\n\n \/**\n * Perform pre-transformation validations.\n *\n * This method may be overridden by a child. Default behavior is to do\n * nothing.\n *\n * @note Exceptions will not be immediately caught so should only be used\n * if it is appropriate to abort the entire predicate system, e.g.,\n * on an insanity error.\n *\n * @param[in] reporter Reporter to use for errors or warnings.\n **\/\n virtual void pre_transform(NodeReporter reporter) const;\n\n \/**\n * Perform transformations.\n *\n * This method may be overridden by a child. Default behavior is to\n * do nothing and return false.\n *\n * This method is called for every Node during the transformation phase.\n * If any such call returns true, the whole process is repeated.\n *\n * Transformations should not be done directly, but rather through\n * @a merge_graph(), i.e., do not use add_child(), remove_child(), or\n * replace_child(); instead use MergeGraph::add(), MergeGraph::remove(),\n * or MergeGraph::replace(). Note that your method can fetch a\n * @ref node_p for itself via shared_from_this().\n *\n * Note: Reporting errors will allow the current transformation loop to\n * continue for other nodes, but will then end the transformation phase.\n *\n * @param[in] reporter Reporter to use for errors or warnings.\n * @param[in] merge_graph MergeGraph used to change the DAG.\n * @param[in] call_factory CallFactory to create new nodes with.\n * @return true iff any changes were made.\n **\/\n virtual bool transform(\n NodeReporter reporter,\n MergeGraph& merge_graph,\n const CallFactory& call_factory\n );\n\n \/**\n * Perform post-transformation validations.\n *\n * See pre_transform() for additional discussion.\n * @param[in] reporter Reporter to use for errors or warnings.\n **\/\n virtual void post_transform(NodeReporter reporter) const;\n\nprotected:\n \/**\n * Calculate value.\n *\n * Subclass classes should implement this to calculate and return the\n * value.\n *\n * @param [in] context Contex of calculation.\n * @return Value of node.\n *\/\n virtual Value calculate(Context context) = 0;\n\nprivate:\n \/**\n * Remove this from parents of @a child.\n *\n * @param[in] child Child to unlink from.\n * @throw IronBee::einval if not in @a child's parent list.\n **\/\n void unlink_from_child(const node_p& child) const;\n\n \/\/! True if a value has been set.\n bool m_has_value;\n \/\/! What value has been set; may be singular to indicate null\/false.\n Value m_value;\n \/\/! List of parents (note weak pointers).\n weak_node_list_t m_parents;\n \/\/! List of children.\n node_list_t m_children;\n};\n\n\/\/! Ostream output operator.\nstd::ostream& operator<<(std::ostream& out, const Node& node);\n\n\/**\n * Node representing a function Call.\n *\n * All Call nodes must have a name. Calls with the same name are considered\n * to implement the same function.\n *\n * This class is unique in the class hierarchy as being subclassable. Users\n * should create subclasses for specific functions. Subclasses must implement\n * name() and calculate(). Subclasses may also define add_child(),\n * remove_child(), and replace_child() but must call the parents methods\n* within.\n **\/\nclass Call :\n public Node\n{\npublic:\n \/\/! Constructor.\n Call();\n\n \/\/! See Node::add_child().\n virtual void add_child(const node_p& child);\n\n \/\/! See Node::remove_child().\n virtual void remove_child(const node_p& child);\n\n \/\/! See Node::replace_child().\n virtual void replace_child(const node_p& child, const node_p& with);\n\n \/\/! S-expression: (@c name children...)\n virtual const std::string& to_s() const;\n\n \/**\n * Name accessor.\n *\/\n virtual std::string name() const = 0;\n\nprivate:\n \/\/! Mark m_s as in need of recalculation.\n void reset_s() const;\n\n \/\/! Recalculate m_s.\n void recalculate_s() const;\n\n \/\/ Because name() is pure, Call::Call() can not calculate m_s. I.e., we\n \/\/ need to fully construct the class before setting m_s. So we have\n \/\/ to_s() calculate it on the fly the first time. The following two\n \/\/ members maintain that cache.\n\n \/\/! Have we calculate m_s at all?\n mutable bool m_calculated_s;\n\n \/\/! String form.\n mutable std::string m_s;\n};\n\n\/**\n * Literal node: no children and value independent of Context.\n *\n * This class may not be subclassed.\n **\/\nclass Literal :\n public Node\n{\n friend class String;\n friend class Null;\n\nprivate:\n \/\/! Private constructor to limit subclassing.\n Literal() {}\npublic:\n \/\/! @throw IronBee::einval always.\n virtual void add_child(const node_p&);\n \/\/! @throw IronBee::einval always.\n virtual void remove_child(const node_p&);\n \/\/! @throw IronBee::einval always.\n virtual void replace_child(const node_p& child, const node_p& with);\n};\n\n\/**\n * String literal: Literal node representing a string.\n *\n * This class may not be subclassed.\n **\/\nclass String :\n public Literal,\n public virtual Impl::Final\n{\npublic:\n \/**\n * Constructor.\n *\n * @param[in] s Value of node.\n **\/\n explicit\n String(const std::string& value);\n\n \/\/! Value as string.\n std::string value_as_s() const\n {\n return m_value_as_s;\n }\n\n \/\/! S-expression: 'value'\n virtual const std::string& to_s() const\n {\n return m_s;\n }\n\n \/**\n * Escape a string.\n *\n * Adds backslashes before all single quotes and backslashes.\n *\n * @param[in] s String to escape.\n * @return Escaped string.\n **\/\n static std::string escape(const std::string& s);\n\nprotected:\n \/\/! See Node::calculate()\n virtual Value calculate(Context context);\n\nprivate:\n \/\/! Value as a C++ string.\n const std::string m_value_as_s;\n \/\/! S-expression.\n const std::string m_s;\n \/\/! Memory pool to create field value from. Alias of m_value_as_s.\n boost::shared_ptr<IronBee::ScopedMemoryPool> m_pool;\n \/\/! Value returned by calculate().\n IronBee::ConstField m_value_as_field;\n};\n\n\/**\n * Null literal: Literal node representing the null value.\n *\n * This class may not be subclassed.\n **\/\nclass Null :\n public Literal,\n public virtual Impl::Final\n{\npublic:\n \/\/! S-expression: null\n virtual const std::string& to_s() const;\n\nprotected:\n \/\/! See Node::calculate()\n virtual Value calculate(Context context);\n};\n\n} \/\/ Predicate\n} \/\/ IronBee\n\n#endif\n<|endoftext|>"} {"text":"<commit_before>\/*\r\n * FilePusher: service which monitors the file system and pushes files to\r\n * a remote repository\r\n *\r\n * This library is free software; you can redistribute it and\/or\r\n * modify it under the terms of the GNU Lesser General Public\r\n * License as published by the Free Software Foundation; either\r\n * version 2.1 of the License, or (at your option) any later version.\r\n *\r\n * This library is distributed in the hope that it will be useful,\r\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\r\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU\r\n * Lesser General Public License for more details.\r\n *\r\n * You should have received a copy of the GNU Lesser General Public\r\n * License along with this library; if not, write to the Free Software\r\n * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA\r\n *\/\r\n\r\n\/*-------------------------------------------------------------------------\/\/\r\n\/\/ \/\/\r\n\/\/ INCLUDES \/\/\r\n\/\/ \/\/\r\n\/\/-------------------------------------------------------------------------*\/\r\n\r\n#ifndef GUCEF_CORE_CGUCEFAPPLICATION_H\r\n#include \"CGUCEFApplication.h\"\r\n#define GUCEF_CORE_CGUCEFAPPLICATION_H\r\n#endif \/* GUCEF_CORE_CGUCEFAPPLICATION_H ? *\/\r\n\r\n#ifndef GUCEF_CORE_LOGGING_H\r\n#include \"gucefCORE_Logging.h\"\r\n#define GUCEF_CORE_LOGGING_H\r\n#endif \/* GUCEF_CORE_LOGGING_H ? *\/\r\n\r\n#ifndef GUCEF_CORE_DVCPPOSWRAP_H\r\n#include \"DVCPPOSWRAP.h\"\r\n#define GUCEF_CORE_DVCPPOSWRAP_H\r\n#endif \/* GUCEF_CORE_DVCPPOSWRAP_H ? *\/\r\n\r\n#ifndef GUCEF_CORE_CROLLINGFILEACCESS_H\r\n#include \"gucefCORE_CRollingFileAccess.h\"\r\n#define GUCEF_CORE_CROLLINGFILEACCESS_H\r\n#endif \/* GUCEF_CORE_CROLLINGFILEACCESS_H ? *\/\r\n\r\n#ifndef GUCEF_CORE_CONFIGSTORE_H\r\n#include \"CConfigStore.h\"\r\n#define GUCEF_CORE_CONFIGSTORE_H\r\n#endif \/* GUCEF_CORE_CONFIGSTORE_H ? *\/\r\n\r\n#ifndef GUCEF_CORE_CTRACER_H\r\n#include \"CTracer.h\"\r\n#define GUCEF_CORE_CTRACER_H\r\n#endif \/* GUCEF_CORE_CTRACER_H ? *\/\r\n\r\n#ifndef GUCEF_CORE_CPLATFORMNATIVECONSOLEWINDOW_H\r\n#include \"gucefCORE_CPlatformNativeConsoleWindow.h\"\r\n#define GUCEF_CORE_CPLATFORMNATIVECONSOLEWINDOW_H\r\n#endif \/* GUCEF_CORE_CPLATFORMNATIVECONSOLEWINDOW_H ? *\/\r\n\r\n#ifndef GUCEF_CORE_CVALUELIST_H\r\n#include \"CValueList.h\"\r\n#define GUCEF_CORE_CVALUELIST_H\r\n#endif \/* GUCEF_CORE_CVALUELIST_H ? *\/\r\n\r\n#ifndef GUCEF_CORE_CTIMER_H\r\n#include \"CTimer.h\"\r\n#define GUCEF_CORE_CTIMER_H\r\n#endif \/* GUCEF_CORE_CTIMER_H ? *\/\r\n\r\n#ifndef GUCEF_COMCORE_CUDPSOCKET_H\r\n#include \"CUDPSocket.h\"\r\n#define GUCEF_COMCORE_CUDPSOCKET_H\r\n#endif \/* GUCEF_COMCORE_CUDPSOCKET_H ? *\/\r\n\r\n#ifndef GUCEF_COMCORE_CTCPSERVERSOCKET_H\r\n#include \"CTCPServerSocket.h\"\r\n#define GUCEF_COMCORE_CTCPSERVERSOCKET_H\r\n#endif \/* GUCEF_COMCORE_CTCPSERVERSOCKET_H ? *\/\r\n\r\n#ifndef GUCEF_COMCORE_CCOMCOREGLOBAL_H\r\n#include \"gucefCOMCORE_CComCoreGlobal.h\"\r\n#define GUCEF_COMCORE_CCOMCOREGLOBAL_H\r\n#endif \/* GUCEF_COMCORE_CCOMCOREGLOBAL_H ? *\/\r\n\r\n#ifndef GUCEF_COM_CCOMGLOBAL_H\r\n#include \"gucefCOM_CComGlobal.h\"\r\n#define GUCEF_COM_CCOMGLOBAL_H\r\n#endif \/* GUCEF_COM_CCOMGLOBAL_H ? *\/\r\n\r\n#ifndef GUCEF_VFS_CVFSGLOBAL_H\r\n#include \"gucefVFS_CVfsGlobal.h\"\r\n#define GUCEF_VFS_CVFSGLOBAL_H\r\n#endif \/* GUCEF_VFS_CVFSGLOBAL_H ? *\/\r\n\r\n#include \"FilePusher.h\"\r\n\r\n\/*-------------------------------------------------------------------------\/\/\r\n\/\/ \/\/\r\n\/\/ NAMESPACE \/\/\r\n\/\/ \/\/\r\n\/\/-------------------------------------------------------------------------*\/\r\n\r\nusing namespace GUCEF;\r\n\r\n\/*-------------------------------------------------------------------------\/\/\r\n\/\/ \/\/\r\n\/\/ UTILITIES \/\/\r\n\/\/ \/\/\r\n\/\/-------------------------------------------------------------------------*\/\r\n\r\nbool\r\nLoadConfig( const CORE::CString& configPath ,\r\n CORE::CValueList& keyValueList ,\r\n CORE::CDataNode* loadedConfig = GUCEF_NULL )\r\n{GUCEF_TRACE;\r\n\r\n #ifdef GUCEF_DEBUG_MODE\r\n const CORE::CString configFile = \"FilePusher_d.ini\";\r\n #else\r\n const CORE::CString configFile = \"FilePusher.ini\";\r\n #endif\r\n\r\n CORE::CString configFilePath;\r\n bool foundViaParam = false;\r\n if ( !configPath.IsNULLOrEmpty() )\r\n {\r\n GUCEF_LOG( CORE::LOGLEVEL_BELOW_NORMAL, \"Checking for config file @ \" + configPath );\r\n foundViaParam = CORE::FileExists( configPath );\r\n configFilePath = configPath;\r\n }\r\n\r\n if ( !foundViaParam )\r\n {\r\n configFilePath = CORE::CombinePath( \"$CURWORKDIR$\", configFile );\r\n configFilePath = CORE::RelativePath( configFilePath );\r\n\r\n GUCEF_LOG( CORE::LOGLEVEL_BELOW_NORMAL, \"Checking for config file @ \" + configFilePath );\r\n if ( !CORE::FileExists( configFilePath ) )\r\n {\r\n configFilePath = CORE::CombinePath( \"$MODULEDIR$\", configFile );\r\n configFilePath = CORE::RelativePath( configFilePath );\r\n\r\n GUCEF_LOG( CORE::LOGLEVEL_BELOW_NORMAL, \"Checking for config file @ \" + configFilePath );\r\n if ( !FileExists( configFilePath ) )\r\n {\r\n GUCEF_WARNING_LOG( CORE::LOGLEVEL_NORMAL, \"Unable to locate any config file, will rely on params\" );\r\n return false;\r\n }\r\n }\r\n }\r\n GUCEF_LOG( CORE::LOGLEVEL_NORMAL, \"Located config file @ \" + configFilePath );\r\n\r\n keyValueList.SetConfigNamespace( \"Main\/AppArgs\" );\r\n keyValueList.SetUseGlobalConfig( true );\r\n keyValueList.SetAllowDuplicates( false );\r\n keyValueList.SetAllowMultipleValues( true );\r\n\r\n CORE::CConfigStore& configStore = CORE::CCoreGlobal::Instance()->GetConfigStore();\r\n configStore.SetConfigFile( configFilePath );\r\n return configStore.LoadConfig( loadedConfig );\r\n}\r\n\r\n\/*-------------------------------------------------------------------------*\/\r\n\r\nvoid\r\nParseParams( const int argc ,\r\n char* argv[] ,\r\n CORE::CValueList& keyValueList )\r\n{GUCEF_TRACE;\r\n\r\n GUCEF::CORE::CString argString;\r\n if ( argc > 0 )\r\n {\r\n argString = *argv;\r\n\r\n \/\/ Combine the argument strings back into a single string because we don't want to use\r\n \/\/ a space as the seperator\r\n for ( int i=1; i<argc; ++i )\r\n {\r\n argString += ' ' + CORE::CString( argv[ i ] );\r\n }\r\n\r\n \/\/ Parse the param list based on the ' symbol\r\n GUCEF_LOG( CORE::LOGLEVEL_NORMAL, \"Application parameters: \" + argString );\r\n keyValueList.SetMultiple( argString, '*' );\r\n }\r\n}\r\n\r\n\/*-------------------------------------------------------------------------*\/\r\n\r\nvoid\r\nGucefAppSignalHandler( int signal )\r\n{GUCEF_TRACE;\r\n \r\n ::GUCEF::CORE::CCoreGlobal::Instance()->GetApplication().Stop();\r\n}\r\n\r\n\/*-------------------------------------------------------------------------*\/\r\n\r\n\/*\r\n * Application entry point\r\n *\/\r\n\/\/GUCEF_OSMAIN_BEGIN\r\nGUCEF_OSSERVICEMAIN_BEGIN( \"FilePusher\" )\r\n{GUCEF_TRACE;\r\n\r\n GUCEF_LOG( CORE::LOGLEVEL_NORMAL, \"This tool was compiled on: \" __DATE__ \" @ \" __TIME__ );\r\n\r\n CORE::CCoreGlobal::Instance();\r\n COMCORE::CComCoreGlobal::Instance();\r\n COM::CComGlobal::Instance();\r\n VFS::CVfsGlobal::Instance();\r\n\r\n \/\/ Check for config param first\r\n CORE::CValueList keyValueList;\r\n ParseParams( argc, argv, keyValueList );\r\n CORE::CString configPathParam = keyValueList.GetValueAlways( \"ConfigPath\" );\r\n keyValueList.Clear();\r\n\r\n \/\/ Load settings from a config file (if any) and then override with params (if any)\r\n CORE::CDataNode* globalConfig = new CORE::CDataNode();\r\n LoadConfig( configPathParam, keyValueList, globalConfig );\r\n ParseParams( argc, argv, keyValueList );\r\n\r\n CORE::CString outputDir = CORE::RelativePath( keyValueList.GetValueAlways( \"outputDir\" ) );\r\n if ( outputDir.IsNULLOrEmpty() )\r\n {\r\n outputDir = CORE::RelativePath( \"$CURWORKDIR$\" );\r\n }\r\n CORE::CreateDirs( outputDir );\r\n\r\n CORE::CString logFilename = CORE::CombinePath( outputDir, \"FilePusher_log.txt\" );\r\n\r\n keyValueList.Set( \"logfile\", logFilename );\r\n\r\n CORE::CRollingFileAccess logFileAccess( logFilename, \"w\" );\r\n CORE::CStdLogger logger( logFileAccess );\r\n CORE::CCoreGlobal::Instance()->GetLogManager().AddLogger( &logger );\r\n\r\n CORE::CPlatformNativeConsoleLogger console;\r\n if ( GUCEF_APP_TYPE == GUCEF_APP_TYPE_CONSOLE )\r\n CORE::CCoreGlobal::Instance()->GetLogManager().AddLogger( console.GetLogger() );\r\n\r\n CORE::Int32 minLogLevel = CORE::LOGLEVEL_BELOW_NORMAL;\r\n CORE::CString valueStr = keyValueList.GetValueAlways( \"MinimalLogLevel\" );\r\n if ( !valueStr.IsNULLOrEmpty() )\r\n {\r\n minLogLevel = CORE::StringToInt32( valueStr );\r\n CORE::CCoreGlobal::Instance()->GetLogManager().SetMinLogLevel( minLogLevel );\r\n }\r\n\r\n CORE::CCoreGlobal::Instance()->GetLogManager().FlushBootstrapLogEntriesToLogs();\r\n GUCEF_LOG( CORE::LOGLEVEL_NORMAL, \"Flushed to log @ \" + logFilename );\r\n\r\n GUCEF_OSMAIN_SIGNAL_HANDLER( GucefAppSignalHandler );\r\n \r\n FilePusher filePusher;\r\n if ( !filePusher.LoadConfig( keyValueList, *globalConfig ) )\r\n {\r\n delete globalConfig;\r\n GUCEF_ERROR_LOG( CORE::LOGLEVEL_CRITICAL, \"FilePusher: Exiting because LoadConfig failed\" );\r\n return -1;\r\n }\r\n delete globalConfig;\r\n\r\n if ( !filePusher.Start() )\r\n {\r\n GUCEF_ERROR_LOG( CORE::LOGLEVEL_CRITICAL, \"FilePusher: Failed to Start()\" );\r\n return -2;\r\n }\r\n\r\n auto& app = CORE::CCoreGlobal::Instance()->GetApplication();\r\n app.GetPulseGenerator()->RequestPulseInterval( 10 );\r\n return app.main( argc, argv, true );\r\n}\r\nGUCEF_OSMAIN_END\r\n\r\n\/*---------------------------------------------------------------------------*\/\r\n<commit_msg>FilePusher: Limit rolling log file count to a max of 10<commit_after>\/*\r\n * FilePusher: service which monitors the file system and pushes files to\r\n * a remote repository\r\n *\r\n * This library is free software; you can redistribute it and\/or\r\n * modify it under the terms of the GNU Lesser General Public\r\n * License as published by the Free Software Foundation; either\r\n * version 2.1 of the License, or (at your option) any later version.\r\n *\r\n * This library is distributed in the hope that it will be useful,\r\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\r\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU\r\n * Lesser General Public License for more details.\r\n *\r\n * You should have received a copy of the GNU Lesser General Public\r\n * License along with this library; if not, write to the Free Software\r\n * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA\r\n *\/\r\n\r\n\/*-------------------------------------------------------------------------\/\/\r\n\/\/ \/\/\r\n\/\/ INCLUDES \/\/\r\n\/\/ \/\/\r\n\/\/-------------------------------------------------------------------------*\/\r\n\r\n#ifndef GUCEF_CORE_CGUCEFAPPLICATION_H\r\n#include \"CGUCEFApplication.h\"\r\n#define GUCEF_CORE_CGUCEFAPPLICATION_H\r\n#endif \/* GUCEF_CORE_CGUCEFAPPLICATION_H ? *\/\r\n\r\n#ifndef GUCEF_CORE_LOGGING_H\r\n#include \"gucefCORE_Logging.h\"\r\n#define GUCEF_CORE_LOGGING_H\r\n#endif \/* GUCEF_CORE_LOGGING_H ? *\/\r\n\r\n#ifndef GUCEF_CORE_DVCPPOSWRAP_H\r\n#include \"DVCPPOSWRAP.h\"\r\n#define GUCEF_CORE_DVCPPOSWRAP_H\r\n#endif \/* GUCEF_CORE_DVCPPOSWRAP_H ? *\/\r\n\r\n#ifndef GUCEF_CORE_CROLLINGFILEACCESS_H\r\n#include \"gucefCORE_CRollingFileAccess.h\"\r\n#define GUCEF_CORE_CROLLINGFILEACCESS_H\r\n#endif \/* GUCEF_CORE_CROLLINGFILEACCESS_H ? *\/\r\n\r\n#ifndef GUCEF_CORE_CONFIGSTORE_H\r\n#include \"CConfigStore.h\"\r\n#define GUCEF_CORE_CONFIGSTORE_H\r\n#endif \/* GUCEF_CORE_CONFIGSTORE_H ? *\/\r\n\r\n#ifndef GUCEF_CORE_CTRACER_H\r\n#include \"CTracer.h\"\r\n#define GUCEF_CORE_CTRACER_H\r\n#endif \/* GUCEF_CORE_CTRACER_H ? *\/\r\n\r\n#ifndef GUCEF_CORE_CPLATFORMNATIVECONSOLEWINDOW_H\r\n#include \"gucefCORE_CPlatformNativeConsoleWindow.h\"\r\n#define GUCEF_CORE_CPLATFORMNATIVECONSOLEWINDOW_H\r\n#endif \/* GUCEF_CORE_CPLATFORMNATIVECONSOLEWINDOW_H ? *\/\r\n\r\n#ifndef GUCEF_CORE_CVALUELIST_H\r\n#include \"CValueList.h\"\r\n#define GUCEF_CORE_CVALUELIST_H\r\n#endif \/* GUCEF_CORE_CVALUELIST_H ? *\/\r\n\r\n#ifndef GUCEF_CORE_CTIMER_H\r\n#include \"CTimer.h\"\r\n#define GUCEF_CORE_CTIMER_H\r\n#endif \/* GUCEF_CORE_CTIMER_H ? *\/\r\n\r\n#ifndef GUCEF_COMCORE_CUDPSOCKET_H\r\n#include \"CUDPSocket.h\"\r\n#define GUCEF_COMCORE_CUDPSOCKET_H\r\n#endif \/* GUCEF_COMCORE_CUDPSOCKET_H ? *\/\r\n\r\n#ifndef GUCEF_COMCORE_CTCPSERVERSOCKET_H\r\n#include \"CTCPServerSocket.h\"\r\n#define GUCEF_COMCORE_CTCPSERVERSOCKET_H\r\n#endif \/* GUCEF_COMCORE_CTCPSERVERSOCKET_H ? *\/\r\n\r\n#ifndef GUCEF_COMCORE_CCOMCOREGLOBAL_H\r\n#include \"gucefCOMCORE_CComCoreGlobal.h\"\r\n#define GUCEF_COMCORE_CCOMCOREGLOBAL_H\r\n#endif \/* GUCEF_COMCORE_CCOMCOREGLOBAL_H ? *\/\r\n\r\n#ifndef GUCEF_COM_CCOMGLOBAL_H\r\n#include \"gucefCOM_CComGlobal.h\"\r\n#define GUCEF_COM_CCOMGLOBAL_H\r\n#endif \/* GUCEF_COM_CCOMGLOBAL_H ? *\/\r\n\r\n#ifndef GUCEF_VFS_CVFSGLOBAL_H\r\n#include \"gucefVFS_CVfsGlobal.h\"\r\n#define GUCEF_VFS_CVFSGLOBAL_H\r\n#endif \/* GUCEF_VFS_CVFSGLOBAL_H ? *\/\r\n\r\n#include \"FilePusher.h\"\r\n\r\n\/*-------------------------------------------------------------------------\/\/\r\n\/\/ \/\/\r\n\/\/ NAMESPACE \/\/\r\n\/\/ \/\/\r\n\/\/-------------------------------------------------------------------------*\/\r\n\r\nusing namespace GUCEF;\r\n\r\n\/*-------------------------------------------------------------------------\/\/\r\n\/\/ \/\/\r\n\/\/ UTILITIES \/\/\r\n\/\/ \/\/\r\n\/\/-------------------------------------------------------------------------*\/\r\n\r\nbool\r\nLoadConfig( const CORE::CString& configPath ,\r\n CORE::CValueList& keyValueList ,\r\n CORE::CDataNode* loadedConfig = GUCEF_NULL )\r\n{GUCEF_TRACE;\r\n\r\n #ifdef GUCEF_DEBUG_MODE\r\n const CORE::CString configFile = \"FilePusher_d.ini\";\r\n #else\r\n const CORE::CString configFile = \"FilePusher.ini\";\r\n #endif\r\n\r\n CORE::CString configFilePath;\r\n bool foundViaParam = false;\r\n if ( !configPath.IsNULLOrEmpty() )\r\n {\r\n GUCEF_LOG( CORE::LOGLEVEL_BELOW_NORMAL, \"Checking for config file @ \" + configPath );\r\n foundViaParam = CORE::FileExists( configPath );\r\n configFilePath = configPath;\r\n }\r\n\r\n if ( !foundViaParam )\r\n {\r\n configFilePath = CORE::CombinePath( \"$CURWORKDIR$\", configFile );\r\n configFilePath = CORE::RelativePath( configFilePath );\r\n\r\n GUCEF_LOG( CORE::LOGLEVEL_BELOW_NORMAL, \"Checking for config file @ \" + configFilePath );\r\n if ( !CORE::FileExists( configFilePath ) )\r\n {\r\n configFilePath = CORE::CombinePath( \"$MODULEDIR$\", configFile );\r\n configFilePath = CORE::RelativePath( configFilePath );\r\n\r\n GUCEF_LOG( CORE::LOGLEVEL_BELOW_NORMAL, \"Checking for config file @ \" + configFilePath );\r\n if ( !FileExists( configFilePath ) )\r\n {\r\n GUCEF_WARNING_LOG( CORE::LOGLEVEL_NORMAL, \"Unable to locate any config file, will rely on params\" );\r\n return false;\r\n }\r\n }\r\n }\r\n GUCEF_LOG( CORE::LOGLEVEL_NORMAL, \"Located config file @ \" + configFilePath );\r\n\r\n keyValueList.SetConfigNamespace( \"Main\/AppArgs\" );\r\n keyValueList.SetUseGlobalConfig( true );\r\n keyValueList.SetAllowDuplicates( false );\r\n keyValueList.SetAllowMultipleValues( true );\r\n\r\n CORE::CConfigStore& configStore = CORE::CCoreGlobal::Instance()->GetConfigStore();\r\n configStore.SetConfigFile( configFilePath );\r\n return configStore.LoadConfig( loadedConfig );\r\n}\r\n\r\n\/*-------------------------------------------------------------------------*\/\r\n\r\nvoid\r\nParseParams( const int argc ,\r\n char* argv[] ,\r\n CORE::CValueList& keyValueList )\r\n{GUCEF_TRACE;\r\n\r\n GUCEF::CORE::CString argString;\r\n if ( argc > 0 )\r\n {\r\n argString = *argv;\r\n\r\n \/\/ Combine the argument strings back into a single string because we don't want to use\r\n \/\/ a space as the seperator\r\n for ( int i=1; i<argc; ++i )\r\n {\r\n argString += ' ' + CORE::CString( argv[ i ] );\r\n }\r\n\r\n \/\/ Parse the param list based on the ' symbol\r\n GUCEF_LOG( CORE::LOGLEVEL_NORMAL, \"Application parameters: \" + argString );\r\n keyValueList.SetMultiple( argString, '*' );\r\n }\r\n}\r\n\r\n\/*-------------------------------------------------------------------------*\/\r\n\r\nvoid\r\nGucefAppSignalHandler( int signal )\r\n{GUCEF_TRACE;\r\n \r\n ::GUCEF::CORE::CCoreGlobal::Instance()->GetApplication().Stop();\r\n}\r\n\r\n\/*-------------------------------------------------------------------------*\/\r\n\r\n\/*\r\n * Application entry point\r\n *\/\r\n\/\/GUCEF_OSMAIN_BEGIN\r\nGUCEF_OSSERVICEMAIN_BEGIN( \"FilePusher\" )\r\n{GUCEF_TRACE;\r\n\r\n GUCEF_LOG( CORE::LOGLEVEL_NORMAL, \"This tool was compiled on: \" __DATE__ \" @ \" __TIME__ );\r\n\r\n CORE::CCoreGlobal::Instance();\r\n COMCORE::CComCoreGlobal::Instance();\r\n COM::CComGlobal::Instance();\r\n VFS::CVfsGlobal::Instance();\r\n\r\n \/\/ Check for config param first\r\n CORE::CValueList keyValueList;\r\n ParseParams( argc, argv, keyValueList );\r\n CORE::CString configPathParam = keyValueList.GetValueAlways( \"ConfigPath\" );\r\n keyValueList.Clear();\r\n\r\n \/\/ Load settings from a config file (if any) and then override with params (if any)\r\n CORE::CDataNode* globalConfig = new CORE::CDataNode();\r\n LoadConfig( configPathParam, keyValueList, globalConfig );\r\n ParseParams( argc, argv, keyValueList );\r\n\r\n CORE::CString outputDir = CORE::RelativePath( keyValueList.GetValueAlways( \"outputDir\" ) );\r\n if ( outputDir.IsNULLOrEmpty() )\r\n {\r\n outputDir = CORE::RelativePath( \"$CURWORKDIR$\" );\r\n }\r\n CORE::CreateDirs( outputDir );\r\n\r\n CORE::CString logFilename = CORE::CombinePath( outputDir, \"FilePusher_log.txt\" );\r\n\r\n keyValueList.Set( \"logfile\", logFilename );\r\n\r\n CORE::CRollingFileAccess logFileAccess( logFilename, \"w\" );\r\n logFileAccess.SetMaxRolloverFilesBeforeDeletion( 10 );\r\n CORE::CStdLogger logger( logFileAccess );\r\n CORE::CCoreGlobal::Instance()->GetLogManager().AddLogger( &logger );\r\n\r\n CORE::CPlatformNativeConsoleLogger console;\r\n if ( GUCEF_APP_TYPE == GUCEF_APP_TYPE_CONSOLE )\r\n CORE::CCoreGlobal::Instance()->GetLogManager().AddLogger( console.GetLogger() );\r\n\r\n CORE::Int32 minLogLevel = CORE::LOGLEVEL_BELOW_NORMAL;\r\n CORE::CString valueStr = keyValueList.GetValueAlways( \"MinimalLogLevel\" );\r\n if ( !valueStr.IsNULLOrEmpty() )\r\n {\r\n minLogLevel = CORE::StringToInt32( valueStr );\r\n CORE::CCoreGlobal::Instance()->GetLogManager().SetMinLogLevel( minLogLevel );\r\n }\r\n\r\n CORE::CCoreGlobal::Instance()->GetLogManager().FlushBootstrapLogEntriesToLogs();\r\n GUCEF_LOG( CORE::LOGLEVEL_NORMAL, \"Flushed to log @ \" + logFilename );\r\n\r\n GUCEF_OSMAIN_SIGNAL_HANDLER( GucefAppSignalHandler );\r\n \r\n FilePusher filePusher;\r\n if ( !filePusher.LoadConfig( keyValueList, *globalConfig ) )\r\n {\r\n delete globalConfig;\r\n GUCEF_ERROR_LOG( CORE::LOGLEVEL_CRITICAL, \"FilePusher: Exiting because LoadConfig failed\" );\r\n return -1;\r\n }\r\n delete globalConfig;\r\n\r\n if ( !filePusher.Start() )\r\n {\r\n GUCEF_ERROR_LOG( CORE::LOGLEVEL_CRITICAL, \"FilePusher: Failed to Start()\" );\r\n return -2;\r\n }\r\n\r\n auto& app = CORE::CCoreGlobal::Instance()->GetApplication();\r\n app.GetPulseGenerator()->RequestPulseInterval( 10 );\r\n return app.main( argc, argv, true );\r\n}\r\nGUCEF_OSMAIN_END\r\n\r\n\/*---------------------------------------------------------------------------*\/\r\n<|endoftext|>"} {"text":"<commit_before>#include \"..\/include\/cIGZApp.h\"\n#include \"..\/include\/cIGZFrameWork.h\"\n#include \"..\/include\/cISC4App.h\"\n#include \"..\/include\/cRZCOMDllDirector.h\"\n\nstatic const uint32_t kExtraCheatsPluginCOMDirectorID = 0x8bbd9623;\nstatic const uint32_t kGZIID_cISC4App = 0x26ce01c0;\n\nclass cSC4ExtraCheatsPluginCOMDirector : public cRZCOMDllDirector\n{\n\tpublic:\n\t\tuint32_t GetDirectorID() const {\n\t\t\treturn kExtraCheatsPluginCOMDirectorID;\n\t\t}\n\n\t\tbool PreAppInit() {\n\t\t\tcIGZFrameWork* const pFramework = RZGetFrameWork();\n\t\t\tif (pFramework) {\n\t\t\t\tcIGZApp* const pApp = pFramework->Application();\n\t\t\t\tif (pApp) {\n\t\t\t\t\tcISC4App* pISC4App;\n\t\t\t\t\tif (pApp->QueryInterface(kGZIID_cISC4App, (void**)&pISC4App)) {\n\t\t\t\t\t\tpISC4App->SetDebugFunctionalityEnabled(true);\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\n\t\t\treturn true;\n\t\t}\n\n\t\tbool OnStart(cIGZCOM* pCOM) {\n\t\t\tcIGZFrameWork* const pFramework = RZGetFrameWork();\n\t\t\tif (pFramework) {\n\t\t\t\tif (pFramework->GetState() < cIGZFrameWork::kStatePreAppInit) {\n\t\t\t\t\tpFramework->AddHook(this);\n\t\t\t\t}\n\t\t\t\telse {\n\t\t\t\t\tPreAppInit();\n\t\t\t\t}\n\t\t\t}\n\t\t\treturn true;\n\t\t}\n};\n\n\/\/ You need to replace the director returned here for the game and this DLL\n\/\/ to use the right director. This is the only place that it's necessary to\n\/\/ do so.\ncRZCOMDllDirector* RZGetCOMDllDirector() {\n\tstatic cSC4ExtraCheatsPluginCOMDirector sDirector;\n\treturn &sDirector;\n}<commit_msg>Update cGZExtraCheatsDllDirector to demonstrate message reception<commit_after>#include \"..\/include\/cIGZApp.h\"\n#include \"..\/include\/cIGZFrameWork.h\"\n#include \"..\/include\/cIGZMessage2.h\"\n#include \"..\/include\/cIGZMessageServer2.h\"\n#include \"..\/include\/cIGZMessageTarget2.h\"\n#include \"..\/include\/cISC4App.h\"\n#include \"..\/include\/cISC4RenderProperties.h\"\n#include \"..\/include\/cRZCOMDllDirector.h\"\n#include \"..\/include\/GZServPtrs.h\"\n#include <Windows.h>\n\nstatic const uint32_t kExtraCheatsPluginCOMDirectorID = 0x8bbd9623;\nstatic const uint32_t kGZIID_cISC4App = 0x26ce01c0;\n\nclass cSC4ExtraCheatsPluginCOMDirector : public cRZCOMDllDirector, public cIGZMessageTarget2\n{\n\tpublic:\n\t\t\/* Failing to explicitly delegate these methods results in some\n\t\t ambiguity when resolving which virtual methods to use: those\n\t\t from cIGZMessageTarget (which are pure abstract) or those from\n\t\t cRZCOMDllDirector, and the compiler will complain. *\/\n\t\tbool QueryInterface(uint32_t riid, void** ppvObj) {\n\t\t\treturn cRZCOMDllDirector::QueryInterface(riid, ppvObj);\n\t\t}\n\n\t\tuint32_t AddRef(void) {\n\t\t\treturn cRZCOMDllDirector::AddRef();\n\t\t}\n\n\t\tuint32_t Release(void) {\n\t\t\treturn cRZCOMDllDirector::Release();\n\t\t}\n\n\t\tuint32_t GetDirectorID() const {\n\t\t\treturn kExtraCheatsPluginCOMDirectorID;\n\t\t}\n\n\t\tbool DoMessage(cIGZMessage2* pMessage) {\n\t\t\tif (pMessage->GetType() == 0xea8ae29a) {\n\t\t\t\tMessageBoxA(NULL, \"City finished loading\", NULL, NULL);\n\t\t\t}\n\n\t\t\treturn true;\n\t\t}\n\n\t\tbool PreAppInit() {\n\t\t\tcIGZFrameWork* const pFramework = RZGetFrameWork();\n\t\t\tif (pFramework) {\n\t\t\t\tcIGZApp* const pApp = pFramework->Application();\n\t\t\t\tif (pApp) {\n\t\t\t\t\tcISC4App* pISC4App;\n\t\t\t\t\tif (pApp->QueryInterface(kGZIID_cISC4App, (void**)&pISC4App)) {\n\t\t\t\t\t\tpISC4App->SetDebugFunctionalityEnabled(true);\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\n\t\t\treturn true;\n\t\t}\n\n\t\tbool PostAppInit() {\n\t\t\t\/\/ The cRZSysServPtr will automatically try to receive the service\n\t\t\t\/\/ pointer for us.\n\t\t\tcIGZMessageServer2Ptr pMsgServ;\n\t\t\tif (pMsgServ) {\n\t\t\t\tpMsgServ->AddNotification(this, 0xea8ae29a);\n\t\t\t}\n\n\t\t\treturn true;\n\t\t}\n\n\t\tbool OnStart(cIGZCOM* pCOM) {\n\t\t\tcIGZFrameWork* const pFramework = RZGetFrameWork();\n\t\t\tif (pFramework) {\n\t\t\t\tif (pFramework->GetState() < cIGZFrameWork::kStatePreAppInit) {\n\t\t\t\t\tpFramework->AddHook(this);\n\t\t\t\t}\n\t\t\t\telse {\n\t\t\t\t\tPreAppInit();\n\t\t\t\t}\n\t\t\t}\n\t\t\treturn true;\n\t\t}\n};\n\n\/\/ You need to replace the director returned here for the game and this DLL\n\/\/ to use the right director. This is the only place that it's necessary to\n\/\/ do so.\ncRZCOMDllDirector* RZGetCOMDllDirector() {\n\tstatic cSC4ExtraCheatsPluginCOMDirector sDirector;\n\treturn &sDirector;\n}<|endoftext|>"} {"text":"<commit_before>#include <stdlib.h>\n#include <time.h>\n#include \"SDL.h\"\n\nint main(int argc, char *argv[])\n{\n\tSDL_Surface* Surf_Display;\n\n\tSDL_Window *sdlWindow;\n\tSDL_Renderer *sdlRenderer;\n\tSDL_CreateWindowAndRenderer(0, 0, SDL_WINDOW_FULLSCREEN_DESKTOP, &sdlWindow, &sdlRenderer);\n\n\tSDL_SetRenderDrawColor(sdlRenderer, 0, 0, 0, 255);\n\tSDL_RenderClear(sdlRenderer);\n\tSDL_RenderPresent(sdlRenderer);\n\n\n\tSDL_Quit();\n\treturn 0;\n}<commit_msg>Fixed Full Screen<commit_after>#include <stdlib.h>\n#include <time.h>\n#include \"SDL.h\"\n\nint main(int argc, char *argv[])\n{\n\tSDL_Surface* Surf_Display;\n\n\tSDL_Window *sdlWindow;\n\tSDL_Renderer *sdlRenderer;\n\tSDL_CreateWindowAndRenderer(1280, 720, SDL_WINDOW_SHOWN, &sdlWindow, &sdlRenderer);\n\n\tSDL_SetRenderDrawColor(sdlRenderer, 0, 0, 0, 255);\n\tSDL_RenderClear(sdlRenderer);\n\tSDL_RenderPresent(sdlRenderer);\n\n\tfor (;;){}\n\t\n\n\tSDL_Quit();\n\treturn 0;\n}<|endoftext|>"} {"text":"<commit_before>\/*\n * Vulkan\n *\n * Copyright (C) 2014 LunarG, Inc.\n *\n * Permission is hereby granted, free of charge, to any person obtaining a\n * copy of this software and associated documentation files (the \"Software\"),\n * to deal in the Software without restriction, including without limitation\n * the rights to use, copy, modify, merge, publish, distribute, sublicense,\n * and\/or sell copies of the Software, and to permit persons to whom the\n * Software is furnished to do so, subject to the following conditions:\n *\n * The above copyright notice and this permission notice shall be included\n * in all copies or substantial portions of the Software.\n *\n * THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS 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 <assert.h>\n#include <unordered_map>\n#include \"vk_dispatch_table_helper.h\"\n#include \"vk_layer.h\"\n#include \"vk_layer_table.h\"\nstatic device_table_map tableMap;\nstatic instance_table_map tableInstanceMap;\n\n#define DISPATCH_MAP_DEBUG 0\n\n\/\/ Map lookup must be thread safe\nVkLayerDispatchTable *device_dispatch_table(void* object)\n{\n dispatch_key key = get_dispatch_key(object);\n device_table_map::const_iterator it = tableMap.find((void *) key);\n assert(it != tableMap.end() && \"Not able to find device dispatch entry\");\n return it->second;\n}\n\nVkLayerInstanceDispatchTable *instance_dispatch_table(void* object)\n{\n dispatch_key key = get_dispatch_key(object);\n instance_table_map::const_iterator it = tableInstanceMap.find((void *) key);\n#if DISPATCH_MAP_DEBUG\n if (it != tableInstanceMap.end()) {\n fprintf(stderr, \"instance_dispatch_table: map: %p, object: %p, key: %p, table: %p\\n\", &tableInstanceMap, object, key, it->second);\n } else {\n fprintf(stderr, \"instance_dispatch_table: map: %p, object: %p, key: %p, table: UNKNOWN\\n\", &tableInstanceMap, object, key);\n }\n#endif\n assert(it != tableInstanceMap.end() && \"Not able to find instance dispatch entry\");\n return it->second;\n}\n\nvoid destroy_dispatch_table(device_table_map &map, dispatch_key key)\n{\n device_table_map::const_iterator it = map.find((void *) key);\n#if DISPATCH_MAP_DEBUG\n if (it != map.end()) {\n fprintf(stderr, \"destroy device dispatch_table: map: %p, key: %p, table: %p\\n\", &map, key, it->second);\n } else {\n fprintf(stderr, \"destroy device dispatch table: map: %p, key: %p, table: UNKNOWN\\n\", &map, key);\n assert(it != map.end());\n }\n#endif\n map.erase(key);\n}\n\nvoid destroy_dispatch_table(instance_table_map &map, dispatch_key key)\n{\n instance_table_map::const_iterator it = map.find((void *) key);\n#if DISPATCH_MAP_DEBUG\n if (it != map.end()) {\n fprintf(stderr, \"destroy instance dispatch_table: map: %p, key: %p, table: %p\\n\", &map, key, it->second);\n } else {\n fprintf(stderr, \"destroy instance dispatch table: map: %p, key: %p, table: UNKNOWN\\n\", &map, key);\n assert(it != map.end());\n }\n#endif\n map.erase(key);\n}\n\nvoid destroy_device_dispatch_table(dispatch_key key)\n{\n destroy_dispatch_table(tableMap, key);\n}\n\nvoid destroy_instance_dispatch_table(dispatch_key key)\n{\n destroy_dispatch_table(tableInstanceMap, key);\n}\n\nVkLayerDispatchTable *get_dispatch_table(device_table_map &map, void* object)\n{\n dispatch_key key = get_dispatch_key(object);\n device_table_map::const_iterator it = map.find((void *) key);\n#if DISPATCH_MAP_DEBUG\n if (it != map.end()) {\n fprintf(stderr, \"instance_dispatch_table: map: %p, object: %p, key: %p, table: %p\\n\", &tableInstanceMap, object, key, it->second);\n } else {\n fprintf(stderr, \"instance_dispatch_table: map: %p, object: %p, key: %p, table: UNKNOWN\\n\", &tableInstanceMap, object, key);\n }\n#endif\n assert(it != map.end() && \"Not able to find device dispatch entry\");\n return it->second;\n}\n\nVkLayerInstanceDispatchTable *get_dispatch_table(instance_table_map &map, void* object)\n{\n\/\/ VkLayerInstanceDispatchTable *pDisp = *(VkLayerInstanceDispatchTable **) object;\n dispatch_key key = get_dispatch_key(object);\n instance_table_map::const_iterator it = map.find((void *) key);\n#if DISPATCH_MAP_DEBUG\n if (it != map.end()) {\n fprintf(stderr, \"instance_dispatch_table: map: %p, object: %p, key: %p, table: %p\\n\", &tableInstanceMap, object, key, it->second);\n } else {\n fprintf(stderr, \"instance_dispatch_table: map: %p, object: %p, key: %p, table: UNKNOWN\\n\", &tableInstanceMap, object, key);\n }\n#endif\n assert(it != map.end() && \"Not able to find instance dispatch entry\");\n return it->second;\n}\n\n\/* Various dispatchable objects will use the same underlying dispatch table if they\n * are created from that \"parent\" object. Thus use pointer to dispatch table\n * as the key to these table maps.\n * Instance -> PhysicalDevice\n * Device -> CmdBuffer or Queue\n * If use the object themselves as key to map then implies Create entrypoints have to be intercepted\n * and a new key inserted into map *\/\nVkLayerInstanceDispatchTable * initInstanceTable(instance_table_map &map, const VkBaseLayerObject *instancew)\n{\n VkLayerInstanceDispatchTable *pTable;\n assert(instancew);\n VkLayerInstanceDispatchTable **ppDisp = (VkLayerInstanceDispatchTable **) instancew->baseObject;\n\n std::unordered_map<void *, VkLayerInstanceDispatchTable *>::const_iterator it = map.find((void *) *ppDisp);\n if (it == map.end())\n {\n pTable = new VkLayerInstanceDispatchTable;\n map[(void *) *ppDisp] = pTable;\n#if DISPATCH_MAP_DEBUG\n fprintf(stderr, \"New, Instance: map: %p, base object: %p, key: %p, table: %p\\n\", &map, instancew, *ppDisp, pTable);\n#endif\n assert(map.size() <= 1 && \"Instance dispatch table map has more than one entry\");\n } else\n {\n#if DISPATCH_MAP_DEBUG\n fprintf(stderr, \"Instance: map: %p, base object: %p, key: %p, table: %p\\n\", &map, instancew, *ppDisp, it->second);\n#endif\n return it->second;\n }\n\n layer_init_instance_dispatch_table(pTable, instancew);\n\n return pTable;\n}\n\nVkLayerInstanceDispatchTable * initInstanceTable(const VkBaseLayerObject *instancew)\n{\n return initInstanceTable(tableInstanceMap, instancew);\n}\n\nVkLayerDispatchTable * initDeviceTable(device_table_map &map, const VkBaseLayerObject *devw)\n{\n VkLayerDispatchTable *layer_device_table = NULL;\n assert(devw);\n VkLayerDispatchTable **ppDisp = (VkLayerDispatchTable **) (devw->baseObject);\n VkLayerDispatchTable *base_device_table = *ppDisp;\n\n std::unordered_map<void *, VkLayerDispatchTable *>::const_iterator it = map.find((void *) base_device_table);\n if (it == map.end())\n {\n layer_device_table = new VkLayerDispatchTable;\n map[(void *) base_device_table] = layer_device_table;\n#if DISPATCH_MAP_DEBUG\n fprintf(stderr, \"New, Device: map: %p, base object: %p, key: %p, table: %p\\n\", &map, devw, *ppDisp, layer_device_table);\n#endif\n } else\n {\n#if DISPATCH_MAP_DEBUG\n fprintf(stderr, \"Device: map: %p, base object: %p, key: %p, table: %p\\n\", &map, devw, *ppDisp, it->second);\n#endif\n return it->second;\n }\n\n layer_initialize_dispatch_table(layer_device_table, devw);\n\n return layer_device_table;\n}\n\nVkLayerDispatchTable * initDeviceTable(const VkBaseLayerObject *devw)\n{\n return initDeviceTable(tableMap, devw);\n}\n<commit_msg>layers: No assert on init instance table map.size != 1<commit_after>\/*\n * Vulkan\n *\n * Copyright (C) 2014 LunarG, Inc.\n *\n * Permission is hereby granted, free of charge, to any person obtaining a\n * copy of this software and associated documentation files (the \"Software\"),\n * to deal in the Software without restriction, including without limitation\n * the rights to use, copy, modify, merge, publish, distribute, sublicense,\n * and\/or sell copies of the Software, and to permit persons to whom the\n * Software is furnished to do so, subject to the following conditions:\n *\n * The above copyright notice and this permission notice shall be included\n * in all copies or substantial portions of the Software.\n *\n * THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS 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 <assert.h>\n#include <unordered_map>\n#include \"vk_dispatch_table_helper.h\"\n#include \"vk_layer.h\"\n#include \"vk_layer_table.h\"\nstatic device_table_map tableMap;\nstatic instance_table_map tableInstanceMap;\n\n#define DISPATCH_MAP_DEBUG 0\n\n\/\/ Map lookup must be thread safe\nVkLayerDispatchTable *device_dispatch_table(void* object)\n{\n dispatch_key key = get_dispatch_key(object);\n device_table_map::const_iterator it = tableMap.find((void *) key);\n assert(it != tableMap.end() && \"Not able to find device dispatch entry\");\n return it->second;\n}\n\nVkLayerInstanceDispatchTable *instance_dispatch_table(void* object)\n{\n dispatch_key key = get_dispatch_key(object);\n instance_table_map::const_iterator it = tableInstanceMap.find((void *) key);\n#if DISPATCH_MAP_DEBUG\n if (it != tableInstanceMap.end()) {\n fprintf(stderr, \"instance_dispatch_table: map: %p, object: %p, key: %p, table: %p\\n\", &tableInstanceMap, object, key, it->second);\n } else {\n fprintf(stderr, \"instance_dispatch_table: map: %p, object: %p, key: %p, table: UNKNOWN\\n\", &tableInstanceMap, object, key);\n }\n#endif\n assert(it != tableInstanceMap.end() && \"Not able to find instance dispatch entry\");\n return it->second;\n}\n\nvoid destroy_dispatch_table(device_table_map &map, dispatch_key key)\n{\n device_table_map::const_iterator it = map.find((void *) key);\n#if DISPATCH_MAP_DEBUG\n if (it != map.end()) {\n fprintf(stderr, \"destroy device dispatch_table: map: %p, key: %p, table: %p\\n\", &map, key, it->second);\n } else {\n fprintf(stderr, \"destroy device dispatch table: map: %p, key: %p, table: UNKNOWN\\n\", &map, key);\n assert(it != map.end());\n }\n#endif\n map.erase(key);\n}\n\nvoid destroy_dispatch_table(instance_table_map &map, dispatch_key key)\n{\n instance_table_map::const_iterator it = map.find((void *) key);\n#if DISPATCH_MAP_DEBUG\n if (it != map.end()) {\n fprintf(stderr, \"destroy instance dispatch_table: map: %p, key: %p, table: %p\\n\", &map, key, it->second);\n } else {\n fprintf(stderr, \"destroy instance dispatch table: map: %p, key: %p, table: UNKNOWN\\n\", &map, key);\n assert(it != map.end());\n }\n#endif\n map.erase(key);\n}\n\nvoid destroy_device_dispatch_table(dispatch_key key)\n{\n destroy_dispatch_table(tableMap, key);\n}\n\nvoid destroy_instance_dispatch_table(dispatch_key key)\n{\n destroy_dispatch_table(tableInstanceMap, key);\n}\n\nVkLayerDispatchTable *get_dispatch_table(device_table_map &map, void* object)\n{\n dispatch_key key = get_dispatch_key(object);\n device_table_map::const_iterator it = map.find((void *) key);\n#if DISPATCH_MAP_DEBUG\n if (it != map.end()) {\n fprintf(stderr, \"instance_dispatch_table: map: %p, object: %p, key: %p, table: %p\\n\", &tableInstanceMap, object, key, it->second);\n } else {\n fprintf(stderr, \"instance_dispatch_table: map: %p, object: %p, key: %p, table: UNKNOWN\\n\", &tableInstanceMap, object, key);\n }\n#endif\n assert(it != map.end() && \"Not able to find device dispatch entry\");\n return it->second;\n}\n\nVkLayerInstanceDispatchTable *get_dispatch_table(instance_table_map &map, void* object)\n{\n\/\/ VkLayerInstanceDispatchTable *pDisp = *(VkLayerInstanceDispatchTable **) object;\n dispatch_key key = get_dispatch_key(object);\n instance_table_map::const_iterator it = map.find((void *) key);\n#if DISPATCH_MAP_DEBUG\n if (it != map.end()) {\n fprintf(stderr, \"instance_dispatch_table: map: %p, object: %p, key: %p, table: %p\\n\", &tableInstanceMap, object, key, it->second);\n } else {\n fprintf(stderr, \"instance_dispatch_table: map: %p, object: %p, key: %p, table: UNKNOWN\\n\", &tableInstanceMap, object, key);\n }\n#endif\n assert(it != map.end() && \"Not able to find instance dispatch entry\");\n return it->second;\n}\n\n\/* Various dispatchable objects will use the same underlying dispatch table if they\n * are created from that \"parent\" object. Thus use pointer to dispatch table\n * as the key to these table maps.\n * Instance -> PhysicalDevice\n * Device -> CmdBuffer or Queue\n * If use the object themselves as key to map then implies Create entrypoints have to be intercepted\n * and a new key inserted into map *\/\nVkLayerInstanceDispatchTable * initInstanceTable(instance_table_map &map, const VkBaseLayerObject *instancew)\n{\n VkLayerInstanceDispatchTable *pTable;\n assert(instancew);\n VkLayerInstanceDispatchTable **ppDisp = (VkLayerInstanceDispatchTable **) instancew->baseObject;\n\n std::unordered_map<void *, VkLayerInstanceDispatchTable *>::const_iterator it = map.find((void *) *ppDisp);\n if (it == map.end())\n {\n pTable = new VkLayerInstanceDispatchTable;\n map[(void *) *ppDisp] = pTable;\n#if DISPATCH_MAP_DEBUG\n fprintf(stderr, \"New, Instance: map: %p, base object: %p, key: %p, table: %p\\n\", &map, instancew, *ppDisp, pTable);\n#endif\n } else\n {\n#if DISPATCH_MAP_DEBUG\n fprintf(stderr, \"Instance: map: %p, base object: %p, key: %p, table: %p\\n\", &map, instancew, *ppDisp, it->second);\n#endif\n return it->second;\n }\n\n layer_init_instance_dispatch_table(pTable, instancew);\n\n return pTable;\n}\n\nVkLayerInstanceDispatchTable * initInstanceTable(const VkBaseLayerObject *instancew)\n{\n return initInstanceTable(tableInstanceMap, instancew);\n}\n\nVkLayerDispatchTable * initDeviceTable(device_table_map &map, const VkBaseLayerObject *devw)\n{\n VkLayerDispatchTable *layer_device_table = NULL;\n assert(devw);\n VkLayerDispatchTable **ppDisp = (VkLayerDispatchTable **) (devw->baseObject);\n VkLayerDispatchTable *base_device_table = *ppDisp;\n\n std::unordered_map<void *, VkLayerDispatchTable *>::const_iterator it = map.find((void *) base_device_table);\n if (it == map.end())\n {\n layer_device_table = new VkLayerDispatchTable;\n map[(void *) base_device_table] = layer_device_table;\n#if DISPATCH_MAP_DEBUG\n fprintf(stderr, \"New, Device: map: %p, base object: %p, key: %p, table: %p\\n\", &map, devw, *ppDisp, layer_device_table);\n#endif\n } else\n {\n#if DISPATCH_MAP_DEBUG\n fprintf(stderr, \"Device: map: %p, base object: %p, key: %p, table: %p\\n\", &map, devw, *ppDisp, it->second);\n#endif\n return it->second;\n }\n\n layer_initialize_dispatch_table(layer_device_table, devw);\n\n return layer_device_table;\n}\n\nVkLayerDispatchTable * initDeviceTable(const VkBaseLayerObject *devw)\n{\n return initDeviceTable(tableMap, devw);\n}\n<|endoftext|>"} {"text":"<commit_before>\/* IBM_PROLOG_BEGIN_TAG *\/\n\/* This is an automatically generated prolog. *\/\n\/* *\/\n\/* $Source: src\/import\/hwpf\/fapi2\/include\/fapi2_vpd_access.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\/\/\/ @file fapi2_vpd_access.H\n\/\/\/ @brief Common file that defines the vpd access functions that\n\/\/\/ platform code must implement.\n\/\/\/\n\/\/\n\n#ifndef _FAPI2_VPDACCESS_H_\n#define _FAPI2_VPDACCESS_H_\n\n#include <return_code.H>\n#include <target_types.H>\n#include <vpd_access_defs.H>\n#include <plat_vpd_access.H>\n\nnamespace fapi2\n{\n\n\/\/\/ constants for VPD Info\nconstexpr uint64_t VPD_INFO_INVALID = 0xffffffffffffffff;\n\n\/\/\/ @brief Specialized class representing required VPDInfo to be used\n\/\/\/ in collecting VPD for the MCA target type.\n\/\/\/ @tparam T fapi2::TARGET_TYPE_MCA\ntemplate<>\nclass VPDInfo<TARGET_TYPE_MCA>\n{\n public:\n \/\/ @brief VPDInfo constructor\n VPDInfo( const fapi2::MemVpdData& i_vpd_type)\n : iv_vpd_type(i_vpd_type),\n iv_size(VPD_INFO_INVALID),\n iv_freq_mhz(VPD_INFO_INVALID),\n iv_rank_count_dimm_0(VPD_INFO_INVALID),\n iv_rank_count_dimm_1(VPD_INFO_INVALID)\n {};\n \/\/ type of vpd field to return\n fapi2::MemVpdData_t iv_vpd_type;\n\n \/\/ size of the vpd data\n size_t iv_size;\n uint64_t iv_freq_mhz;\n uint64_t iv_rank_count_dimm_0;\n uint64_t iv_rank_count_dimm_1;\n\n};\n\n\n\/\/\/ @brief Return a blob of memory VPD data associated with the input target\n\/\/\/ @param[in] i_target a valid fapi2 target\n\/\/\/ @param[in] io_vpd_info fapi2::VPDInfo class that specifies which piece of data to return\n\/\/\/ @param[out] o_blob the blob of raw data from the vpd\n\/\/\/ @return FAPI2_RC_SUCCESS if there's no problem\n\/\/\/ @note passing nullptr for o_blob will return the size of the keyword\n\/\/\/\n\/\/\/ Example:\n\/\/\/ fapi2::VPDInfo<fapi2::TARGET_TYPE_MCA> vpdInfo(MR_keyword);\n\/\/\/ vpdInfo.iv_freq = 2667;\n\/\/\/\n\/\/\/ uint8_t * blob = NULL;\n\/\/\/\n\/\/\/ FAPI_TRY(getVPD( mcs, vpdInfo, blob ));\n\/\/\/ blob = static_cast<uint8_t *>(malloc(vpdInfo.iv_size));\n\/\/\/ FAPI_TRY(getVPD( mcs, vpdInfo, blob ));\n\/\/\/ blob now contains the VPD data for the MCA.\n\/\/\/\ntemplate<TargetType T>\nReturnCode getVPD(const Target<T>& i_target,\n VPDInfo<T>& io_vpd_info,\n uint8_t* o_blob);\n\n};\n#endif\n<commit_msg>Packaging of memory vpd on Nimbus, MCA->MCS<commit_after>\/* IBM_PROLOG_BEGIN_TAG *\/\n\/* This is an automatically generated prolog. *\/\n\/* *\/\n\/* $Source: src\/import\/hwpf\/fapi2\/include\/fapi2_vpd_access.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\/\/\/ @file fapi2_vpd_access.H\n\/\/\/ @brief Common file that defines the vpd access functions that\n\/\/\/ platform code must implement.\n\/\/\/\n\/\/\n\n#ifndef _FAPI2_VPDACCESS_H_\n#define _FAPI2_VPDACCESS_H_\n\n#include <return_code.H>\n#include <target_types.H>\n#include <vpd_access_defs.H>\n#include <plat_vpd_access.H>\n\nnamespace fapi2\n{\n\n\/\/\/ constants for VPD Info\nconstexpr uint64_t VPD_INFO_INVALID = 0xffffffffffffffff;\n\n\/\/\/ @brief Specialized class representing required VPDInfo to be used\n\/\/\/ in collecting VPD for the MCS target type.\n\/\/\/ @tparam T fapi2::TARGET_TYPE_MCS\ntemplate<>\nclass VPDInfo<TARGET_TYPE_MCS>\n{\n public:\n \/\/ @brief VPDInfo constructor\n VPDInfo( const fapi2::MemVpdData& i_vpd_type)\n : iv_vpd_type(i_vpd_type),\n iv_size(VPD_INFO_INVALID),\n iv_freq_mhz(VPD_INFO_INVALID),\n iv_rank_count_dimm_0(VPD_INFO_INVALID),\n iv_rank_count_dimm_1(VPD_INFO_INVALID)\n {};\n \/\/ type of vpd field to return\n fapi2::MemVpdData_t iv_vpd_type;\n\n \/\/ size of the vpd data\n size_t iv_size;\n uint64_t iv_freq_mhz;\n uint64_t iv_rank_count_dimm_0;\n uint64_t iv_rank_count_dimm_1;\n\n};\n\n\n\/\/\/ @brief Return a blob of memory VPD data associated with the input target\n\/\/\/ @param[in] i_target a valid fapi2 target\n\/\/\/ @param[in] io_vpd_info fapi2::VPDInfo class that specifies which piece of data to return\n\/\/\/ @param[out] o_blob the blob of raw data from the vpd\n\/\/\/ @return FAPI2_RC_SUCCESS if there's no problem\n\/\/\/ @note passing nullptr for o_blob will return the size of the keyword\n\/\/\/\n\/\/\/ Example:\n\/\/\/ fapi2::VPDInfo<fapi2::TARGET_TYPE_MCS> vpdInfo(MR_keyword);\n\/\/\/ vpdInfo.iv_freq = 2667;\n\/\/\/\n\/\/\/ uint8_t * blob = NULL;\n\/\/\/\n\/\/\/ FAPI_TRY(getVPD( mcs, vpdInfo, blob ));\n\/\/\/ blob = static_cast<uint8_t *>(malloc(vpdInfo.iv_size));\n\/\/\/ FAPI_TRY(getVPD( mcs, vpdInfo, blob ));\n\/\/\/ blob now contains the VPD data for the MCS.\n\/\/\/\ntemplate<TargetType T>\nReturnCode getVPD(const Target<T>& i_target,\n VPDInfo<T>& io_vpd_info,\n uint8_t* o_blob);\n\n};\n#endif\n<|endoftext|>"} {"text":"<commit_before>\/\/===- llvm-link.cpp - Low-level LLVM linker ------------------------------===\/\/\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 utility may be invoked in the following manner:\n\/\/ llvm-link a.bc b.bc c.bc -o x.bc\n\/\/\n\/\/===----------------------------------------------------------------------===\/\/\n\n#include \"llvm\/Linker\/Linker.h\"\n#include \"llvm\/Bitcode\/ReaderWriter.h\"\n#include \"llvm\/IR\/LLVMContext.h\"\n#include \"llvm\/IR\/Module.h\"\n#include \"llvm\/IR\/Verifier.h\"\n#include \"llvm\/IRReader\/IRReader.h\"\n#include \"llvm\/Support\/CommandLine.h\"\n#include \"llvm\/Support\/FileSystem.h\"\n#include \"llvm\/Support\/ManagedStatic.h\"\n#include \"llvm\/Support\/Path.h\"\n#include \"llvm\/Support\/PrettyStackTrace.h\"\n#include \"llvm\/Support\/Signals.h\"\n#include \"llvm\/Support\/SourceMgr.h\"\n#include \"llvm\/Support\/SystemUtils.h\"\n#include \"llvm\/Support\/ToolOutputFile.h\"\n#include <memory>\nusing namespace llvm;\n\nstatic cl::list<std::string>\nInputFilenames(cl::Positional, cl::OneOrMore,\n cl::desc(\"<input bitcode files>\"));\n\nstatic cl::opt<std::string>\nOutputFilename(\"o\", cl::desc(\"Override output filename\"), cl::init(\"-\"),\n cl::value_desc(\"filename\"));\n\nstatic cl::opt<bool>\nForce(\"f\", cl::desc(\"Enable binary output on terminals\"));\n\nstatic cl::opt<bool>\nOutputAssembly(\"S\",\n cl::desc(\"Write output as LLVM assembly\"), cl::Hidden);\n\nstatic cl::opt<bool>\nVerbose(\"v\", cl::desc(\"Print information about actions taken\"));\n\nstatic cl::opt<bool>\nDumpAsm(\"d\", cl::desc(\"Print assembly as linked\"), cl::Hidden);\n\nstatic cl::opt<bool>\nSuppressWarnings(\"suppress-warnings\", cl::desc(\"Suppress all linking warnings\"),\n cl::init(false));\n\n\/\/ Read the specified bitcode file in and return it. This routine searches the\n\/\/ link path for the specified file to try to find it...\n\/\/\nstatic std::unique_ptr<Module>\nloadFile(const char *argv0, const std::string &FN, LLVMContext &Context) {\n SMDiagnostic Err;\n if (Verbose) errs() << \"Loading '\" << FN << \"'\\n\";\n std::unique_ptr<Module> Result = parseIRFile(FN, Err, Context);\n if (!Result)\n Err.print(argv0, errs());\n\n return Result;\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 LLVMContext &Context = getGlobalContext();\n llvm_shutdown_obj Y; \/\/ Call llvm_shutdown() on exit.\n cl::ParseCommandLineOptions(argc, argv, \"llvm linker\\n\");\n\n unsigned BaseArg = 0;\n std::string ErrorMessage;\n\n std::unique_ptr<Module> Composite =\n loadFile(argv[0], InputFilenames[BaseArg], Context);\n if (!Composite.get()) {\n errs() << argv[0] << \": error loading file '\"\n << InputFilenames[BaseArg] << \"'\\n\";\n return 1;\n }\n\n Linker L(Composite.get(), SuppressWarnings);\n for (unsigned i = BaseArg+1; i < InputFilenames.size(); ++i) {\n std::unique_ptr<Module> M = loadFile(argv[0], InputFilenames[i], Context);\n if (!M.get()) {\n errs() << argv[0] << \": error loading file '\" <<InputFilenames[i]<< \"'\\n\";\n return 1;\n }\n\n if (Verbose) errs() << \"Linking in '\" << InputFilenames[i] << \"'\\n\";\n\n if (L.linkInModule(M.get(), &ErrorMessage)) {\n errs() << argv[0] << \": link error in '\" << InputFilenames[i]\n << \"': \" << ErrorMessage << \"\\n\";\n return 1;\n }\n }\n\n if (DumpAsm) errs() << \"Here's the assembly:\\n\" << *Composite;\n\n std::error_code EC;\n tool_output_file Out(OutputFilename, EC, sys::fs::F_None);\n if (EC) {\n errs() << EC.message() << '\\n';\n return 1;\n }\n\n if (verifyModule(*Composite)) {\n errs() << argv[0] << \": linked module is broken!\\n\";\n return 1;\n }\n\n if (Verbose) errs() << \"Writing bitcode...\\n\";\n if (OutputAssembly) {\n Out.os() << *Composite;\n } else if (Force || !CheckBitcodeOutputToConsole(Out.os(), true))\n WriteBitcodeToFile(Composite.get(), Out.os());\n\n \/\/ Declare success.\n Out.keep();\n\n return 0;\n}\n<commit_msg>Make llvm-link behave a bit more like LTO.<commit_after>\/\/===- llvm-link.cpp - Low-level LLVM linker ------------------------------===\/\/\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 utility may be invoked in the following manner:\n\/\/ llvm-link a.bc b.bc c.bc -o x.bc\n\/\/\n\/\/===----------------------------------------------------------------------===\/\/\n\n#include \"llvm\/Linker\/Linker.h\"\n#include \"llvm\/Bitcode\/ReaderWriter.h\"\n#include \"llvm\/IR\/LLVMContext.h\"\n#include \"llvm\/IR\/Module.h\"\n#include \"llvm\/IR\/Verifier.h\"\n#include \"llvm\/IRReader\/IRReader.h\"\n#include \"llvm\/Support\/CommandLine.h\"\n#include \"llvm\/Support\/FileSystem.h\"\n#include \"llvm\/Support\/ManagedStatic.h\"\n#include \"llvm\/Support\/Path.h\"\n#include \"llvm\/Support\/PrettyStackTrace.h\"\n#include \"llvm\/Support\/Signals.h\"\n#include \"llvm\/Support\/SourceMgr.h\"\n#include \"llvm\/Support\/SystemUtils.h\"\n#include \"llvm\/Support\/ToolOutputFile.h\"\n#include <memory>\nusing namespace llvm;\n\nstatic cl::list<std::string>\nInputFilenames(cl::Positional, cl::OneOrMore,\n cl::desc(\"<input bitcode files>\"));\n\nstatic cl::opt<std::string>\nOutputFilename(\"o\", cl::desc(\"Override output filename\"), cl::init(\"-\"),\n cl::value_desc(\"filename\"));\n\nstatic cl::opt<bool>\nForce(\"f\", cl::desc(\"Enable binary output on terminals\"));\n\nstatic cl::opt<bool>\nOutputAssembly(\"S\",\n cl::desc(\"Write output as LLVM assembly\"), cl::Hidden);\n\nstatic cl::opt<bool>\nVerbose(\"v\", cl::desc(\"Print information about actions taken\"));\n\nstatic cl::opt<bool>\nDumpAsm(\"d\", cl::desc(\"Print assembly as linked\"), cl::Hidden);\n\nstatic cl::opt<bool>\nSuppressWarnings(\"suppress-warnings\", cl::desc(\"Suppress all linking warnings\"),\n cl::init(false));\n\n\/\/ Read the specified bitcode file in and return it. This routine searches the\n\/\/ link path for the specified file to try to find it...\n\/\/\nstatic std::unique_ptr<Module>\nloadFile(const char *argv0, const std::string &FN, LLVMContext &Context) {\n SMDiagnostic Err;\n if (Verbose) errs() << \"Loading '\" << FN << \"'\\n\";\n std::unique_ptr<Module> Result = getLazyIRFileModule(FN, Err, Context);\n if (!Result)\n Err.print(argv0, errs());\n\n return Result;\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 LLVMContext &Context = getGlobalContext();\n llvm_shutdown_obj Y; \/\/ Call llvm_shutdown() on exit.\n cl::ParseCommandLineOptions(argc, argv, \"llvm linker\\n\");\n\n auto Composite = make_unique<Module>(\"llvm-link\", Context);\n Linker L(Composite.get(), SuppressWarnings);\n\n std::string ErrorMessage;\n for (unsigned i = 0; i < InputFilenames.size(); ++i) {\n std::unique_ptr<Module> M = loadFile(argv[0], InputFilenames[i], Context);\n if (!M.get()) {\n errs() << argv[0] << \": error loading file '\" <<InputFilenames[i]<< \"'\\n\";\n return 1;\n }\n\n if (Verbose) errs() << \"Linking in '\" << InputFilenames[i] << \"'\\n\";\n\n if (L.linkInModule(M.get(), &ErrorMessage)) {\n errs() << argv[0] << \": link error in '\" << InputFilenames[i]\n << \"': \" << ErrorMessage << \"\\n\";\n return 1;\n }\n }\n\n if (DumpAsm) errs() << \"Here's the assembly:\\n\" << *Composite;\n\n std::error_code EC;\n tool_output_file Out(OutputFilename, EC, sys::fs::F_None);\n if (EC) {\n errs() << EC.message() << '\\n';\n return 1;\n }\n\n if (verifyModule(*Composite)) {\n errs() << argv[0] << \": linked module is broken!\\n\";\n return 1;\n }\n\n if (Verbose) errs() << \"Writing bitcode...\\n\";\n if (OutputAssembly) {\n Out.os() << *Composite;\n } else if (Force || !CheckBitcodeOutputToConsole(Out.os(), true))\n WriteBitcodeToFile(Composite.get(), Out.os());\n\n \/\/ Declare success.\n Out.keep();\n\n return 0;\n}\n<|endoftext|>"} {"text":"<commit_before>\/*************************************************************************\n *\n * OpenOffice.org - a multi-platform office productivity suite\n *\n * $RCSfile: SwNodeNum.cxx,v $\n *\n * $Revision: 1.3 $\n *\n * last change: $Author: obo $ $Date: 2005-11-17 16:21: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#include <svx\/svxenum.hxx>\n#include <SwNodeNum.hxx>\n#include <ndtxt.hxx>\n#include <pam.hxx>\n\nSwNodeNum::SwNodeNum()\n : SwNumberTreeNode(), mpTxtNode(NULL), mpNumRule(NULL), mnStart(1),\n mbRestart(false)\n{\n}\n\nSwNodeNum::SwNodeNum(const SwNodeNum & rNodeNum)\n : SwNumberTreeNode(rNodeNum), mpTxtNode(NULL),\n mpNumRule(NULL), mnStart(rNodeNum.mnStart),\n mbRestart(rNodeNum.mbRestart)\n{\n}\n\nSwNodeNum::~SwNodeNum()\n{\n}\n\nvoid SwNodeNum::SetTxtNode(SwTxtNode * pTxtNode)\n{\n mpTxtNode = pTxtNode;\n}\n\nSwTxtNode * SwNodeNum::GetTxtNode() const\n{\n return mpTxtNode;\n}\n\nvoid SwNodeNum::SetNumRule(SwNumRule * pRule)\n{\n mpNumRule = pRule;\n}\n\nSwNumRule * SwNodeNum::GetNumRule() const\n{\n return mpNumRule;\n}\n\nSwPosition SwNodeNum::GetPosition() const\n{\n return SwPosition(*mpTxtNode);\n}\n\nSwNumberTreeNode * SwNodeNum::Create() const\n{\n SwNodeNum * pResult = new SwNodeNum();\n\n pResult->SetNumRule(mpNumRule);\n\n return pResult;\n}\n\nSwNumberTreeNode * SwNodeNum::Copy() const\n{\n return new SwNodeNum(*this);\n}\n\nvoid SwNodeNum::RemoveChild(SwNumberTreeNode * _pChild)\n{\n SwNodeNum * pChild = static_cast<SwNodeNum*>(_pChild);\n\n pChild->SetNumRule(NULL);\n\n SwNumberTreeNode::RemoveChild(_pChild);\n}\n\nbool SwNodeNum::IsNotifiable() const\n{\n bool aResult = true;\n\n if (mpTxtNode)\n aResult = mpTxtNode->IsNotifiable();\n\n return aResult;\n}\n\nbool SwNodeNum::IsContinuous() const\n{\n bool aResult = false;\n\n if (mpTxtNode)\n aResult = mpTxtNode->IsContinuous();\n\n return aResult;\n}\n\nbool SwNodeNum::IsCounted() const\n{\n bool aResult = false;\n\n if (mpTxtNode)\n {\n const SwNumFmt * pNumFmt = GetNumFmt();\n\n if (pNumFmt)\n {\n sal_Int16 nType = pNumFmt->GetNumberingType();\n\n if ( nType != SVX_NUM_NUMBER_NONE)\n aResult = mpTxtNode->IsCounted();\n }\n }\n else\n aResult = SwNumberTreeNode::IsCounted();\n\n return aResult;\n}\n\nvoid SwNodeNum::NotifyNode()\n{\n ValidateMe();\n\n if (mpTxtNode)\n {\n mpTxtNode->NumRuleChgd();\n }\n}\n\nbool SwNodeNum::LessThan(const SwNumberTreeNode & rNode) const\n{\n bool bResult = false;\n const SwNodeNum & rTmpNode = static_cast<const SwNodeNum &>(rNode);\n\n if (mpTxtNode == NULL && rTmpNode.mpTxtNode != NULL)\n bResult = true;\n else if (mpTxtNode != NULL && rTmpNode.mpTxtNode != NULL)\n {\n SwPosition aMyPos(*mpTxtNode);\n SwPosition aHisPos(*rTmpNode.mpTxtNode);\n\n bResult = (aMyPos < aHisPos) ? true : false;\n }\n\n return bResult;\n}\n\nvoid SwNodeNum::SetRestart(bool bRestart)\n{\n \/\/ --> OD 2005-10-19 #126009#\n \/\/ - improvement: invalidation only, if <IsRestart()> state changes.\n const bool bInvalidate( mbRestart != bRestart );\n \/\/ <--\n mbRestart = bRestart;\n\n \/\/ --> OD 2005-10-19 #126009#\n if ( bInvalidate )\n {\n InvalidateMe();\n NotifyInvalidSiblings();\n }\n \/\/ <--\n}\n\nbool SwNodeNum::IsRestart() const\n{\n return mbRestart;\n}\n\nvoid SwNodeNum::SetStart(SwNumberTreeNode::tSwNumTreeNumber nStart)\n{\n \/\/ --> OD 2005-10-19 #126009#\n \/\/ - improvement: invalidation only, if <IsRestart()> state changes.\n const bool bInvalidate( mnStart != nStart );\n \/\/ <--\n mnStart = nStart;\n\n \/\/ --> OD 2005-10-19 #126009#\n if ( bInvalidate )\n {\n InvalidateMe();\n NotifyInvalidSiblings();\n }\n}\n\nbool SwNodeNum::IsCountPhantoms() const\n{\n bool bResult = true;\n\n if (mpNumRule)\n bResult = mpNumRule->IsCountPhantoms();\n\n return bResult;\n}\n\nSwNumberTreeNode::tSwNumTreeNumber SwNodeNum::GetStart() const\n{\n tSwNumTreeNumber aResult = 1;\n\n \/\/ --> OD 2005-11-16 #i57919# - consider that start value <USHRT_MAX>\n \/\/ indicates, that the numbering is restarted at this node with the\n \/\/ start value, which is set at the corresponding numbering level.\n if ( IsRestart() && mnStart != USHRT_MAX )\n \/\/ <--\n {\n aResult = mnStart;\n }\n else\n {\n SwNumRule * pRule = GetNumRule();\n\n if (pRule)\n {\n int nLevel = GetLevel();\n\n if (nLevel >= 0 && nLevel < MAXLEVEL)\n {\n const SwNumFmt * pFmt = pRule->GetNumFmt(nLevel);\n\n if (pFmt)\n aResult = pFmt->GetStart();\n }\n }\n }\n\n return aResult;\n}\n\nString SwNodeNum::ToString() const\n{\n String aResult(\"[ \", RTL_TEXTENCODING_ASCII_US);\n\n if (GetTxtNode())\n {\n char aBuffer[256];\n\n sprintf(aBuffer, \"%p \", GetTxtNode());\n\n aResult += String(aBuffer, RTL_TEXTENCODING_ASCII_US);\n aResult += String::CreateFromInt32(GetPosition().nNode.GetIndex());\n }\n else\n aResult += String(\"*\", RTL_TEXTENCODING_ASCII_US);\n\n aResult += String(\" \", RTL_TEXTENCODING_ASCII_US);\n\n unsigned int nLvl = GetLevel();\n aResult += String::CreateFromInt32(nLvl);\n\n aResult += String(\": \", RTL_TEXTENCODING_ASCII_US);\n\n tNumberVector aNumVector;\n\n _GetNumberVector(aNumVector, false);\n\n for (unsigned int n = 0; n < aNumVector.size(); n++)\n {\n if (n > 0)\n aResult += String(\", \", RTL_TEXTENCODING_ASCII_US);\n\n aResult += String::CreateFromInt32(aNumVector[n]);\n }\n\n if (IsCounted())\n\/\/ aResult += String(\" counted\", RTL_TEXTENCODING_ASCII_US);\n aResult += String(\" C\", RTL_TEXTENCODING_ASCII_US);\n\n if (IsRestart())\n {\n\/\/ aResult += String(\" restart(\", RTL_TEXTENCODING_ASCII_US);\n aResult += String(\" R(\", RTL_TEXTENCODING_ASCII_US);\n aResult += String::CreateFromInt32(GetStart());\n aResult += String(\")\", RTL_TEXTENCODING_ASCII_US);\n }\n\n if (! IsValid())\n\/\/ aResult += String(\" invalid\", RTL_TEXTENCODING_ASCII_US);\n aResult += String(\" I\", RTL_TEXTENCODING_ASCII_US);\n\n aResult += String(\" ]\", RTL_TEXTENCODING_ASCII_US);\n\n return aResult;\n}\n\nvoid SwNodeNum::SetLevel(unsigned int nLevel)\n{\n ASSERT(nLevel >= 0 && nLevel < MAXLEVEL, \"illegal level\");\n\n if (mpParent)\n {\n SwNumRule * pRule = GetNumRule();\n\n if (pRule != mpNumRule || nLevel != GetLevel())\n {\n RemoveMe();\n\n if (pRule)\n pRule->AddNumber(this, nLevel);\n }\n }\n}\n\nconst SwNumFmt * SwNodeNum::GetNumFmt() const\n{\n const SwNumFmt * pResult = NULL;\n\n unsigned int nLevel = GetLevel();\n if (mpNumRule && nLevel >= 0 && nLevel < MAXLEVEL)\n pResult = &mpNumRule->Get(nLevel);\n\n return pResult;\n}\n<commit_msg>INTEGRATION: CWS swnum202 (1.3.90); FILE MERGED 2006\/01\/26 08:15:52 od 1.3.90.1: #i59559# <SwNodeNum::IsCounted()> \t - for text nodes <SwTxtNode::IsCounted()> determines, if the \t text node is counted for numbering.<commit_after>\/*************************************************************************\n *\n * OpenOffice.org - a multi-platform office productivity suite\n *\n * $RCSfile: SwNodeNum.cxx,v $\n *\n * $Revision: 1.4 $\n *\n * last change: $Author: kz $ $Date: 2006-02-03 17: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#include <svx\/svxenum.hxx>\n#include <SwNodeNum.hxx>\n#include <ndtxt.hxx>\n#include <pam.hxx>\n\nSwNodeNum::SwNodeNum()\n : SwNumberTreeNode(), mpTxtNode(NULL), mpNumRule(NULL), mnStart(1),\n mbRestart(false)\n{\n}\n\nSwNodeNum::SwNodeNum(const SwNodeNum & rNodeNum)\n : SwNumberTreeNode(rNodeNum), mpTxtNode(NULL),\n mpNumRule(NULL), mnStart(rNodeNum.mnStart),\n mbRestart(rNodeNum.mbRestart)\n{\n}\n\nSwNodeNum::~SwNodeNum()\n{\n}\n\nvoid SwNodeNum::SetTxtNode(SwTxtNode * pTxtNode)\n{\n mpTxtNode = pTxtNode;\n}\n\nSwTxtNode * SwNodeNum::GetTxtNode() const\n{\n return mpTxtNode;\n}\n\nvoid SwNodeNum::SetNumRule(SwNumRule * pRule)\n{\n mpNumRule = pRule;\n}\n\nSwNumRule * SwNodeNum::GetNumRule() const\n{\n return mpNumRule;\n}\n\nSwPosition SwNodeNum::GetPosition() const\n{\n return SwPosition(*mpTxtNode);\n}\n\nSwNumberTreeNode * SwNodeNum::Create() const\n{\n SwNodeNum * pResult = new SwNodeNum();\n\n pResult->SetNumRule(mpNumRule);\n\n return pResult;\n}\n\nSwNumberTreeNode * SwNodeNum::Copy() const\n{\n return new SwNodeNum(*this);\n}\n\nvoid SwNodeNum::RemoveChild(SwNumberTreeNode * _pChild)\n{\n SwNodeNum * pChild = static_cast<SwNodeNum*>(_pChild);\n\n pChild->SetNumRule(NULL);\n\n SwNumberTreeNode::RemoveChild(_pChild);\n}\n\nbool SwNodeNum::IsNotifiable() const\n{\n bool aResult = true;\n\n if (mpTxtNode)\n aResult = mpTxtNode->IsNotifiable();\n\n return aResult;\n}\n\nbool SwNodeNum::IsContinuous() const\n{\n bool aResult = false;\n\n if (mpTxtNode)\n aResult = mpTxtNode->IsContinuous();\n\n return aResult;\n}\n\nbool SwNodeNum::IsCounted() const\n{\n bool aResult = false;\n\n if (mpTxtNode)\n {\n \/\/ --> OD 2006-01-25 #i59559#\n \/\/ <SwTxtNode::IsCounted()> determines, if a text node is counted for numbering\n\/\/ const SwNumFmt * pNumFmt = GetNumFmt();\n\/\/ if (pNumFmt)\n\/\/ {\n\/\/ sal_Int16 nType = pNumFmt->GetNumberingType();\n\/\/ if ( nType != SVX_NUM_NUMBER_NONE)\n\/\/ aResult = mpTxtNode->IsCounted();\n\/\/ }\n aResult = mpTxtNode->IsCounted();\n \/\/ <--\n }\n else\n aResult = SwNumberTreeNode::IsCounted();\n\n return aResult;\n}\n\nvoid SwNodeNum::NotifyNode()\n{\n ValidateMe();\n\n if (mpTxtNode)\n {\n mpTxtNode->NumRuleChgd();\n }\n}\n\nbool SwNodeNum::LessThan(const SwNumberTreeNode & rNode) const\n{\n bool bResult = false;\n const SwNodeNum & rTmpNode = static_cast<const SwNodeNum &>(rNode);\n\n if (mpTxtNode == NULL && rTmpNode.mpTxtNode != NULL)\n bResult = true;\n else if (mpTxtNode != NULL && rTmpNode.mpTxtNode != NULL)\n {\n SwPosition aMyPos(*mpTxtNode);\n SwPosition aHisPos(*rTmpNode.mpTxtNode);\n\n bResult = (aMyPos < aHisPos) ? true : false;\n }\n\n return bResult;\n}\n\nvoid SwNodeNum::SetRestart(bool bRestart)\n{\n \/\/ --> OD 2005-10-19 #126009#\n \/\/ - improvement: invalidation only, if <IsRestart()> state changes.\n const bool bInvalidate( mbRestart != bRestart );\n \/\/ <--\n mbRestart = bRestart;\n\n \/\/ --> OD 2005-10-19 #126009#\n if ( bInvalidate )\n {\n InvalidateMe();\n NotifyInvalidSiblings();\n }\n \/\/ <--\n}\n\nbool SwNodeNum::IsRestart() const\n{\n return mbRestart;\n}\n\nvoid SwNodeNum::SetStart(SwNumberTreeNode::tSwNumTreeNumber nStart)\n{\n \/\/ --> OD 2005-10-19 #126009#\n \/\/ - improvement: invalidation only, if <IsRestart()> state changes.\n const bool bInvalidate( mnStart != nStart );\n \/\/ <--\n mnStart = nStart;\n\n \/\/ --> OD 2005-10-19 #126009#\n if ( bInvalidate )\n {\n InvalidateMe();\n NotifyInvalidSiblings();\n }\n}\n\nbool SwNodeNum::IsCountPhantoms() const\n{\n bool bResult = true;\n\n if (mpNumRule)\n bResult = mpNumRule->IsCountPhantoms();\n\n return bResult;\n}\n\nSwNumberTreeNode::tSwNumTreeNumber SwNodeNum::GetStart() const\n{\n tSwNumTreeNumber aResult = 1;\n\n \/\/ --> OD 2005-11-16 #i57919# - consider that start value <USHRT_MAX>\n \/\/ indicates, that the numbering is restarted at this node with the\n \/\/ start value, which is set at the corresponding numbering level.\n if ( IsRestart() && mnStart != USHRT_MAX )\n \/\/ <--\n {\n aResult = mnStart;\n }\n else\n {\n SwNumRule * pRule = GetNumRule();\n\n if (pRule)\n {\n int nLevel = GetLevel();\n\n if (nLevel >= 0 && nLevel < MAXLEVEL)\n {\n const SwNumFmt * pFmt = pRule->GetNumFmt(nLevel);\n\n if (pFmt)\n aResult = pFmt->GetStart();\n }\n }\n }\n\n return aResult;\n}\n\nString SwNodeNum::ToString() const\n{\n String aResult(\"[ \", RTL_TEXTENCODING_ASCII_US);\n\n if (GetTxtNode())\n {\n char aBuffer[256];\n\n sprintf(aBuffer, \"%p \", GetTxtNode());\n\n aResult += String(aBuffer, RTL_TEXTENCODING_ASCII_US);\n aResult += String::CreateFromInt32(GetPosition().nNode.GetIndex());\n }\n else\n aResult += String(\"*\", RTL_TEXTENCODING_ASCII_US);\n\n aResult += String(\" \", RTL_TEXTENCODING_ASCII_US);\n\n unsigned int nLvl = GetLevel();\n aResult += String::CreateFromInt32(nLvl);\n\n aResult += String(\": \", RTL_TEXTENCODING_ASCII_US);\n\n tNumberVector aNumVector;\n\n _GetNumberVector(aNumVector, false);\n\n for (unsigned int n = 0; n < aNumVector.size(); n++)\n {\n if (n > 0)\n aResult += String(\", \", RTL_TEXTENCODING_ASCII_US);\n\n aResult += String::CreateFromInt32(aNumVector[n]);\n }\n\n if (IsCounted())\n\/\/ aResult += String(\" counted\", RTL_TEXTENCODING_ASCII_US);\n aResult += String(\" C\", RTL_TEXTENCODING_ASCII_US);\n\n if (IsRestart())\n {\n\/\/ aResult += String(\" restart(\", RTL_TEXTENCODING_ASCII_US);\n aResult += String(\" R(\", RTL_TEXTENCODING_ASCII_US);\n aResult += String::CreateFromInt32(GetStart());\n aResult += String(\")\", RTL_TEXTENCODING_ASCII_US);\n }\n\n if (! IsValid())\n\/\/ aResult += String(\" invalid\", RTL_TEXTENCODING_ASCII_US);\n aResult += String(\" I\", RTL_TEXTENCODING_ASCII_US);\n\n aResult += String(\" ]\", RTL_TEXTENCODING_ASCII_US);\n\n return aResult;\n}\n\nvoid SwNodeNum::SetLevel(unsigned int nLevel)\n{\n ASSERT(nLevel >= 0 && nLevel < MAXLEVEL, \"illegal level\");\n\n if (mpParent)\n {\n SwNumRule * pRule = GetNumRule();\n\n if (pRule != mpNumRule || nLevel != GetLevel())\n {\n RemoveMe();\n\n if (pRule)\n pRule->AddNumber(this, nLevel);\n }\n }\n}\n\nconst SwNumFmt * SwNodeNum::GetNumFmt() const\n{\n const SwNumFmt * pResult = NULL;\n\n unsigned int nLevel = GetLevel();\n if (mpNumRule && nLevel >= 0 && nLevel < MAXLEVEL)\n pResult = &mpNumRule->Get(nLevel);\n\n return pResult;\n}\n<|endoftext|>"} {"text":"<commit_before>\/*\n * Written by Nitin Kumar Maharana\n * nitin.maharana@gmail.com\n *\/\n\n#include <iostream>\n\nusing namespace std;\n\ntemplate <class T>\nstruct node\n{\n\tT val;\n\tstruct node *next;\n};\n\ntemplate <class T>\nclass Stack\n{\n\tstruct node<T> *top;\n\n\tpublic:\n\n\t\tStack()\n\t\t{\n\t\t\ttop = NULL;\n\t\t}\n\n\t\tvoid push(T item)\n\t\t{\n\t\t\tstruct node<T> *t;\n\t\t\tt = new struct node<T>;\n\t\t\tt->val = item;\n\t\t\tt->next = top;\n\t\t\ttop = t;\n\t\t}\n\n\t\tvoid pop(void)\n\t\t{\n\t\t\tif(empty())\n\t\t\t\tthrow \"There are no items in stack to pop!!!\";\n\n\t\t\tstruct node<T> *t;\n\t\t\tt = top;\n\t\t\ttop = top->next;\n\t\t\tdelete t;\n\t\t}\n\n\t\tT peek(void)\n\t\t{\n\t\t\tif(empty())\n\t\t\t\tthrow \"There are no items in stack to peek!!!\";\n\n\t\t\tT item;\n\t\t\titem = top->val;\n\t\t\treturn item;\n\t\t}\n\n\t\tbool empty(void)\n\t\t{\n\t\t\treturn top == NULL ? true : false;\n\t\t}\n};\n\nint main(void)\n{\n\tStack<int> s;\n\n\ts.push(1);\n\ts.push(2);\n\ts.push(3);\n\t\n\tcout << s.peek() << endl;\n\t\n\ts.pop();\n\t\n\tcout << s.peek() << endl;\n\tcout << s.empty() << endl;\n\n\ts.pop();\n\ts.pop();\n\n\tcout << s.empty() << endl;\n\n\treturn 0;\n}<commit_msg>1. Implementation of Stack in CPP<commit_after>\/*\n * Written by Nitin Kumar Maharana\n * nitin.maharana@gmail.com\n *\/\n\n#include <iostream>\n\nusing namespace std;\n\ntemplate <class T>\nstruct node\n{\n\tT val;\n\tstruct node *next;\n};\n\ntemplate <class T>\nclass Stack\n{\n\tstruct node<T> *top;\n\n\tpublic:\n\n\t\tStack()\n\t\t{\n\t\t\ttop = nullptr;\n\t\t}\n\n\t\tvoid push(T item)\n\t\t{\n\t\t\tstruct node<T> *t;\n\t\t\tt = new struct node<T>;\n\t\t\tt->val = item;\n\t\t\tt->next = top;\n\t\t\ttop = t;\n\t\t}\n\n\t\tvoid pop(void)\n\t\t{\n\t\t\tif(empty())\n\t\t\t\tthrow \"There are no items in stack to pop!!!\";\n\n\t\t\tstruct node<T> *t;\n\t\t\tt = top;\n\t\t\ttop = top->next;\n\t\t\tdelete t;\n\t\t}\n\n\t\tT peek(void)\n\t\t{\n\t\t\tif(empty())\n\t\t\t\tthrow \"There are no items in stack to peek!!!\";\n\n\t\t\tT item;\n\t\t\titem = top->val;\n\t\t\treturn item;\n\t\t}\n\n\t\tbool empty(void)\n\t\t{\n\t\t\treturn top == nullptr ? true : false;\n\t\t}\n};\n\nint main(void)\n{\n\tStack<int> s;\n\n\ts.push(1);\n\ts.push(2);\n\ts.push(3);\n\t\n\tcout << s.peek() << endl;\n\t\n\ts.pop();\n\t\n\tcout << s.peek() << endl;\n\tcout << s.empty() << endl;\n\n\ts.pop();\n\ts.pop();\n\n\tcout << s.empty() << endl;\n\n\treturn 0;\n}\n<|endoftext|>"} {"text":"<commit_before>\n\n\/\/ TLE SOLUTION \n\/\/ class Solution {\n\/\/ public:\n\/\/ \/*\n\/\/ * @param n an integer\n\/\/ * @return the nth prime number as description.\n\/\/ *\/\n\n\/\/ set<int> a;\n\n\/\/ bool isUgly(int i){\n\/\/ \tint j=i;\n\/\/ \twhile (j % 2==0) j=j\/2;\n\/\/ \twhile (j % 3==0) j=j\/3;\n\/\/ \twhile (j % 5==0) j=j\/5;\n\/\/ \tif (j==1) return true;\n\/\/ \telse return false;\n\/\/ }\n\n\/\/ int nthUglyNumber(int n) {\n\/\/ \/\/ write your code here\n\n\/\/ if (n<=0) return -1;\n\/\/ if (n==1) return 1;\n\n\/\/ int i,j,k=1;\n \n \n\/\/ i=1;\n\n\/\/ while (i<INT_MAX){\n\/\/ \ti++;\n\/\/ \tif (isUgly(i))\n\/\/ \t\t{\n\/\/ \t\t\tk++;\n\/\/ \t\t\tif (k==n) return i;\n\/\/ \t\t}\n\n\/\/ }\n\n\/\/ set<int>::iterator it1=a.begin();\n\/\/ for (int i=2;i<=n;i++) {\n\/\/ \t cout<<*it1<<\"\t\";\n\/\/ \tit1++;\n\/\/ }\n\n\/\/ return *it1;\n\n\n\n\/\/ }\n\n \n\n\n\/\/ };<commit_msg>Solving 4<commit_after>class Solution {\npublic:\n \/*\n * @param n an integer\n * @return the nth prime number as description.\n *\/\n int nthUglyNumber(int n) {\n \/\/ write your code here\n\n vector<int> ugly(n,0);\n ugly[0]=1;\n int ugly2=0,ugly3=0,ugly5=0;\n\n int i=1;\n while(i<=n-1){\n int minUgly=min(min(ugly[ugly2]*2,ugly[ugly3]*3),ugly[ugly5]*5);\n ugly[i]=minUgly;\n\n \/*注意这里分别if,因为有可能有多个等于minUgly*\/\n if(minUgly==ugly[ugly2]*2){\n ugly2++;\n }\n if(minUgly==ugly[ugly3]*3){\n ugly3++;\n }\n if(minUgly==ugly[ugly5]*5){\n ugly5++;\n }\n i++;\n }\n\n return ugly[n-1];\n }\n};\n\n\n\/\/ TLE SOLUTION \n\/\/ class Solution {\n\/\/ public:\n\/\/ \/*\n\/\/ * @param n an integer\n\/\/ * @return the nth prime number as description.\n\/\/ *\/\n\n\/\/ set<int> a;\n\n\/\/ bool isUgly(int i){\n\/\/ \tint j=i;\n\/\/ \twhile (j % 2==0) j=j\/2;\n\/\/ \twhile (j % 3==0) j=j\/3;\n\/\/ \twhile (j % 5==0) j=j\/5;\n\/\/ \tif (j==1) return true;\n\/\/ \telse return false;\n\/\/ }\n\n\/\/ int nthUglyNumber(int n) {\n\/\/ \/\/ write your code here\n\n\/\/ if (n<=0) return -1;\n\/\/ if (n==1) return 1;\n\n\/\/ int i,j,k=1;\n \n \n\/\/ i=1;\n\n\/\/ while (i<INT_MAX){\n\/\/ \ti++;\n\/\/ \tif (isUgly(i))\n\/\/ \t\t{\n\/\/ \t\t\tk++;\n\/\/ \t\t\tif (k==n) return i;\n\/\/ \t\t}\n\n\/\/ }\n\n\/\/ set<int>::iterator it1=a.begin();\n\/\/ for (int i=2;i<=n;i++) {\n\/\/ \t cout<<*it1<<\"\t\";\n\/\/ \tit1++;\n\/\/ }\n\n\/\/ return *it1;\n\n\n\n\/\/ }\n\n \n\n\n\/\/ };<|endoftext|>"} {"text":"<commit_before>#include \"InstructionParser.hpp\"\n\n#include \"gtest\/gtest.h\"\n\nusing namespace ::testing;\n\nstruct InstructionParserTest : public Test\n{\n InstructionParser parser;\n};\n\nTEST_F(InstructionParserTest, ParserShouldDeclineUnknownInstruction)\n{\n EXPECT_THROW(parser.parseInstructions(\"Instructions\"), InstructionParser::UnknownInstruction);\n}\n\nTEST_F(InstructionParserTest, ParserShouldRejectInstuctionLd)\n{\n const Tokens expectedTokens{TokenType::Ld, TokenType::A};\n parser.parseInstructions(\"ld a,\");\n}\n\nTEST_F(InstructionParserTest, ParserShouldAcceptInstructionOut)\n{\n const Tokens expectedTokens{TokenType::Out, TokenType::ZeroWithBrackets, TokenType::A};\n EXPECT_EQ(expectedTokens, parser.parseInstructions(\"out (0),a\"));\n}\n\nTEST_F(InstructionParserTest, ParserShouldAcceptEmptyLine)\n{\n const Tokens expectedTokens{};\n EXPECT_EQ(expectedTokens, parser.parseInstructions(\"\"));\n}\n\nTEST_F(InstructionParserTest, ParserShouldAcceptInstructionOutWithWhitespaces)\n{\n const Tokens expectedTokens{TokenType::Out, TokenType::ZeroWithBrackets, TokenType::A};\n EXPECT_EQ(expectedTokens, parser.parseInstructions(\" \\t out (0),a\"));\n}\n\nTEST_F(InstructionParserTest, ParserShouldAcceptTwoInstructions)\n{\n const Tokens expectedTokens{TokenType::Out, TokenType::ZeroWithBrackets, TokenType::A,\n TokenType::Out, TokenType::ZeroWithBrackets, TokenType::A};\n EXPECT_EQ(expectedTokens, parser.parseInstructions(\"out (0),a\\nout (0),a\"));\n}\n\nTEST_F(InstructionParserTest, ParserShouldThrowIfSecondInstructionIsInvalid)\n{\n EXPECT_THROW(parser.parseInstructions(\"out (0),a\\ninvalid\"), InstructionParser::UnknownInstruction);\n}\n\nTEST_F(InstructionParserTest, ParserShouldAcceptTwoInstructionsWithEmptyLine)\n{\n const Tokens expectedTokens{TokenType::Out, TokenType::ZeroWithBrackets, TokenType::A,\n TokenType::Out, TokenType::ZeroWithBrackets, TokenType::A};\n EXPECT_EQ(expectedTokens, parser.parseInstructions(\"out (0),a\\n\\nout (0),a\"));\n}\n\nTEST_F(InstructionParserTest, ParserShouldAbleToGetNumberAsToken)\n{\n const Tokens expectedTokens{TokenType::Number8Bit};\n parser.parseInstructions(\"0\");\n}\n<commit_msg>InstructionParser is able to accept 0 as token<commit_after>#include \"InstructionParser.hpp\"\n\n#include \"gtest\/gtest.h\"\n\nusing namespace ::testing;\n\nstruct InstructionParserTest : public Test\n{\n InstructionParser parser;\n};\n\nTEST_F(InstructionParserTest, ParserShouldDeclineUnknownInstruction)\n{\n EXPECT_THROW(parser.parseInstructions(\"Instructions\"), InstructionParser::UnknownInstruction);\n}\n\nTEST_F(InstructionParserTest, ParserShouldRejectInstuctionLd)\n{\n const Tokens expectedTokens{TokenType::Ld, TokenType::A};\n parser.parseInstructions(\"ld a,\");\n}\n\nTEST_F(InstructionParserTest, ParserShouldAcceptInstructionOut)\n{\n const Tokens expectedTokens{TokenType::Out, TokenType::ZeroWithBrackets, TokenType::A};\n EXPECT_EQ(expectedTokens, parser.parseInstructions(\"out (0),a\"));\n}\n\nTEST_F(InstructionParserTest, ParserShouldAcceptEmptyLine)\n{\n const Tokens expectedTokens{};\n EXPECT_EQ(expectedTokens, parser.parseInstructions(\"\"));\n}\n\nTEST_F(InstructionParserTest, ParserShouldAcceptInstructionOutWithWhitespaces)\n{\n const Tokens expectedTokens{TokenType::Out, TokenType::ZeroWithBrackets, TokenType::A};\n EXPECT_EQ(expectedTokens, parser.parseInstructions(\" \\t out (0),a\"));\n}\n\nTEST_F(InstructionParserTest, ParserShouldAcceptTwoInstructions)\n{\n const Tokens expectedTokens{TokenType::Out, TokenType::ZeroWithBrackets, TokenType::A,\n TokenType::Out, TokenType::ZeroWithBrackets, TokenType::A};\n EXPECT_EQ(expectedTokens, parser.parseInstructions(\"out (0),a\\nout (0),a\"));\n}\n\nTEST_F(InstructionParserTest, ParserShouldThrowIfSecondInstructionIsInvalid)\n{\n EXPECT_THROW(parser.parseInstructions(\"out (0),a\\ninvalid\"), InstructionParser::UnknownInstruction);\n}\n\nTEST_F(InstructionParserTest, ParserShouldAcceptTwoInstructionsWithEmptyLine)\n{\n const Tokens expectedTokens{TokenType::Out, TokenType::ZeroWithBrackets, TokenType::A,\n TokenType::Out, TokenType::ZeroWithBrackets, TokenType::A};\n EXPECT_EQ(expectedTokens, parser.parseInstructions(\"out (0),a\\n\\nout (0),a\"));\n}\n\nTEST_F(InstructionParserTest, ParserShouldAbleToGet0AsToken)\n{\n const Tokens expectedTokens{TokenType::Number8Bit};\n parser.parseInstructions(\"0\");\n}\n\nTEST_F(InstructionParserTest, ParserShouldAbleToGet255AsToken)\n{\n const Tokens expectedTokens{TokenType::Number8Bit};\n parser.parseInstructions(\"255\");\n}<|endoftext|>"} {"text":"<commit_before>\/*\n * Copyright (C) 2019 ScyllaDB\n *\/\n\n\/*\n * This file is part of Scylla.\n *\n * Scylla is free software: you can redistribute it and\/or modify\n * it under the terms of the GNU Affero General Public License as published by\n * the Free Software Foundation, either version 3 of the License, or\n * (at your option) any later version.\n *\n * Scylla is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the\n * GNU General Public License for more details.\n *\n * You should have received a copy of the GNU General Public License\n * along with Scylla. If not, see <http:\/\/www.gnu.org\/licenses\/>.\n *\/\n\n#pragma once\n\n#include <functional>\n#include <optional>\n#include <map>\n#include <string>\n#include <vector>\n\n#include <seastar\/core\/future.hh>\n#include <seastar\/core\/lowres_clock.hh>\n#include <seastar\/core\/shared_ptr.hh>\n#include <seastar\/core\/sstring.hh>\n\n#include \"exceptions\/exceptions.hh\"\n#include \"json.hh\"\n#include \"timestamp.hh\"\n\nclass schema;\nusing schema_ptr = seastar::lw_shared_ptr<const schema>;\n\nnamespace locator {\n\nclass snitch_ptr;\nclass token_metadata;\n\n} \/\/ namespace locator\n\nnamespace service {\n\nclass migration_manager;\nclass storage_proxy;\nclass query_state;\n\n} \/\/ namespace service\n\nnamespace dht {\n\nclass i_partitioner;\n\n} \/\/ namespace dht\n\nclass mutation;\nclass partition_key;\n\nnamespace cdc {\n\nclass options final {\n bool _enabled = false;\n bool _preimage = false;\n bool _postimage = false;\n int _ttl = 86400; \/\/ 24h in seconds\npublic:\n options() = default;\n options(const std::map<sstring, sstring>& map) {\n if (map.find(\"enabled\") == std::end(map)) {\n throw exceptions::configuration_exception(\"Missing enabled CDC option\");\n }\n\n for (auto& p : map) {\n if (p.first == \"enabled\") {\n _enabled = p.second == \"true\";\n } else if (p.first == \"preimage\") {\n _preimage = p.second == \"true\";\n } else if (p.first == \"postimage\") {\n _postimage = p.second == \"true\";\n } else if (p.first == \"ttl\") {\n _ttl = std::stoi(p.second);\n } else {\n throw exceptions::configuration_exception(\"Invalid CDC option: \" + p.first);\n }\n }\n }\n std::map<sstring, sstring> to_map() const {\n return {\n { \"enabled\", _enabled ? \"true\" : \"false\" },\n { \"preimage\", _preimage ? \"true\" : \"false\" },\n { \"postimage\", _postimage ? \"true\" : \"false\" },\n { \"ttl\", std::to_string(_ttl) },\n };\n }\n\n sstring to_sstring() const {\n return json::to_json(to_map());\n }\n\n bool enabled() const { return _enabled; }\n bool preimage() const { return _preimage; }\n bool postimage() const { return _postimage; }\n int ttl() const { return _ttl; }\n\n bool operator==(const options& o) const {\n return _enabled == o._enabled && _preimage == o._preimage && _postimage == o._postimage && _ttl == o._ttl;\n }\n bool operator!=(const options& o) const {\n return !(*this == o);\n }\n};\n\nstruct db_context final {\n service::storage_proxy& _proxy;\n service::migration_manager& _migration_manager;\n locator::token_metadata& _token_metadata;\n locator::snitch_ptr& _snitch;\n dht::i_partitioner& _partitioner;\n\n class builder final {\n service::storage_proxy& _proxy;\n std::optional<std::reference_wrapper<service::migration_manager>> _migration_manager;\n std::optional<std::reference_wrapper<locator::token_metadata>> _token_metadata;\n std::optional<std::reference_wrapper<locator::snitch_ptr>> _snitch;\n std::optional<std::reference_wrapper<dht::i_partitioner>> _partitioner;\n public:\n builder(service::storage_proxy& proxy) : _proxy(proxy) { }\n\n builder with_migration_manager(service::migration_manager& migration_manager) {\n _migration_manager = migration_manager;\n return *this;\n }\n\n builder with_token_metadata(locator::token_metadata& token_metadata) {\n _token_metadata = token_metadata;\n return *this;\n }\n\n builder with_snitch(locator::snitch_ptr& snitch) {\n _snitch = snitch;\n return *this;\n }\n\n builder with_partitioner(dht::i_partitioner& partitioner) {\n _partitioner = partitioner;\n return *this;\n }\n\n db_context build();\n };\n};\n\n\/\/\/ \\brief Sets up CDC related tables for a given table\n\/\/\/\n\/\/\/ This function not only creates CDC Log and CDC Description for a given table\n\/\/\/ but also populates CDC Description with a list of change streams.\n\/\/\/\n\/\/\/ param[in] ctx object with references to database components\n\/\/\/ param[in] schema schema of a table for which CDC tables are being created\nseastar::future<> setup(db_context ctx, schema_ptr schema);\n\n\/\/\/ \\brief Deletes CDC Log and CDC Description tables for a given table\n\/\/\/\n\/\/\/ This function cleans up all CDC related tables created for a given table.\n\/\/\/ At the moment, CDC Log and CDC Description are the only affected tables.\n\/\/\/ It's ok if some\/all of them don't exist.\n\/\/\/\n\/\/\/ \\param[in] ctx object with references to database components\n\/\/\/ \\param[in] ks_name keyspace name of a table for which CDC tables are removed\n\/\/\/ \\param[in] table_name name of a table for which CDC tables are removed\n\/\/\/\n\/\/\/ \\pre This function works correctly no matter if CDC Log and\/or CDC Description\n\/\/\/ exist.\nseastar::future<>\nremove(db_context ctx, const seastar::sstring& ks_name, const seastar::sstring& table_name);\n\nseastar::sstring log_name(const seastar::sstring& table_name);\n\nseastar::sstring desc_name(const seastar::sstring& table_name);\n\n\/\/\/ \\brief For each mutation in the set appends related CDC Log mutation\n\/\/\/\n\/\/\/ This function should be called with a set of mutations of a table\n\/\/\/ with CDC enabled. Returned set of mutations contains all original mutations\n\/\/\/ and for each original mutation appends a mutation to CDC Log that reflects\n\/\/\/ the change.\n\/\/\/\n\/\/\/ \\param[in] ctx object with references to database components\n\/\/\/ \\param[in] s schema of a CDC enabled table which is being modified\n\/\/\/ \\param[in] timeout period of time after which a request is considered timed out\n\/\/\/ \\param[in] qs the state of the query that's being executed\n\/\/\/ \\param[in] mutations set of changes of a CDC enabled table\n\/\/\/\n\/\/\/ \\return set of mutations from input parameter with relevant CDC Log mutations appended\n\/\/\/\n\/\/\/ \\pre CDC Log and CDC Description have to exist\n\/\/\/ \\pre CDC Description has to be in sync with cluster topology\n\/\/\/\n\/\/\/ \\note At the moment, cluster topology changes are not supported\n\/\/ so the assumption that CDC Description is in sync with cluster topology\n\/\/ is easy to enforce. When support for cluster topology changes is added\n\/\/ it has to make sure the assumption holds.\nseastar::future<std::vector<mutation>>append_log_mutations(\n db_context ctx,\n schema_ptr s,\n lowres_clock::time_point timeout,\n service::query_state& qs,\n std::vector<mutation> mutations);\n\n} \/\/ namespace cdc\n<commit_msg>cdc: Return db_context::builder by reference<commit_after>\/*\n * Copyright (C) 2019 ScyllaDB\n *\/\n\n\/*\n * This file is part of Scylla.\n *\n * Scylla is free software: you can redistribute it and\/or modify\n * it under the terms of the GNU Affero General Public License as published by\n * the Free Software Foundation, either version 3 of the License, or\n * (at your option) any later version.\n *\n * Scylla is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the\n * GNU General Public License for more details.\n *\n * You should have received a copy of the GNU General Public License\n * along with Scylla. If not, see <http:\/\/www.gnu.org\/licenses\/>.\n *\/\n\n#pragma once\n\n#include <functional>\n#include <optional>\n#include <map>\n#include <string>\n#include <vector>\n\n#include <seastar\/core\/future.hh>\n#include <seastar\/core\/lowres_clock.hh>\n#include <seastar\/core\/shared_ptr.hh>\n#include <seastar\/core\/sstring.hh>\n\n#include \"exceptions\/exceptions.hh\"\n#include \"json.hh\"\n#include \"timestamp.hh\"\n\nclass schema;\nusing schema_ptr = seastar::lw_shared_ptr<const schema>;\n\nnamespace locator {\n\nclass snitch_ptr;\nclass token_metadata;\n\n} \/\/ namespace locator\n\nnamespace service {\n\nclass migration_manager;\nclass storage_proxy;\nclass query_state;\n\n} \/\/ namespace service\n\nnamespace dht {\n\nclass i_partitioner;\n\n} \/\/ namespace dht\n\nclass mutation;\nclass partition_key;\n\nnamespace cdc {\n\nclass options final {\n bool _enabled = false;\n bool _preimage = false;\n bool _postimage = false;\n int _ttl = 86400; \/\/ 24h in seconds\npublic:\n options() = default;\n options(const std::map<sstring, sstring>& map) {\n if (map.find(\"enabled\") == std::end(map)) {\n throw exceptions::configuration_exception(\"Missing enabled CDC option\");\n }\n\n for (auto& p : map) {\n if (p.first == \"enabled\") {\n _enabled = p.second == \"true\";\n } else if (p.first == \"preimage\") {\n _preimage = p.second == \"true\";\n } else if (p.first == \"postimage\") {\n _postimage = p.second == \"true\";\n } else if (p.first == \"ttl\") {\n _ttl = std::stoi(p.second);\n } else {\n throw exceptions::configuration_exception(\"Invalid CDC option: \" + p.first);\n }\n }\n }\n std::map<sstring, sstring> to_map() const {\n return {\n { \"enabled\", _enabled ? \"true\" : \"false\" },\n { \"preimage\", _preimage ? \"true\" : \"false\" },\n { \"postimage\", _postimage ? \"true\" : \"false\" },\n { \"ttl\", std::to_string(_ttl) },\n };\n }\n\n sstring to_sstring() const {\n return json::to_json(to_map());\n }\n\n bool enabled() const { return _enabled; }\n bool preimage() const { return _preimage; }\n bool postimage() const { return _postimage; }\n int ttl() const { return _ttl; }\n\n bool operator==(const options& o) const {\n return _enabled == o._enabled && _preimage == o._preimage && _postimage == o._postimage && _ttl == o._ttl;\n }\n bool operator!=(const options& o) const {\n return !(*this == o);\n }\n};\n\nstruct db_context final {\n service::storage_proxy& _proxy;\n service::migration_manager& _migration_manager;\n locator::token_metadata& _token_metadata;\n locator::snitch_ptr& _snitch;\n dht::i_partitioner& _partitioner;\n\n class builder final {\n service::storage_proxy& _proxy;\n std::optional<std::reference_wrapper<service::migration_manager>> _migration_manager;\n std::optional<std::reference_wrapper<locator::token_metadata>> _token_metadata;\n std::optional<std::reference_wrapper<locator::snitch_ptr>> _snitch;\n std::optional<std::reference_wrapper<dht::i_partitioner>> _partitioner;\n public:\n builder(service::storage_proxy& proxy) : _proxy(proxy) { }\n\n builder& with_migration_manager(service::migration_manager& migration_manager) {\n _migration_manager = migration_manager;\n return *this;\n }\n\n builder& with_token_metadata(locator::token_metadata& token_metadata) {\n _token_metadata = token_metadata;\n return *this;\n }\n\n builder& with_snitch(locator::snitch_ptr& snitch) {\n _snitch = snitch;\n return *this;\n }\n\n builder& with_partitioner(dht::i_partitioner& partitioner) {\n _partitioner = partitioner;\n return *this;\n }\n\n db_context build();\n };\n};\n\n\/\/\/ \\brief Sets up CDC related tables for a given table\n\/\/\/\n\/\/\/ This function not only creates CDC Log and CDC Description for a given table\n\/\/\/ but also populates CDC Description with a list of change streams.\n\/\/\/\n\/\/\/ param[in] ctx object with references to database components\n\/\/\/ param[in] schema schema of a table for which CDC tables are being created\nseastar::future<> setup(db_context ctx, schema_ptr schema);\n\n\/\/\/ \\brief Deletes CDC Log and CDC Description tables for a given table\n\/\/\/\n\/\/\/ This function cleans up all CDC related tables created for a given table.\n\/\/\/ At the moment, CDC Log and CDC Description are the only affected tables.\n\/\/\/ It's ok if some\/all of them don't exist.\n\/\/\/\n\/\/\/ \\param[in] ctx object with references to database components\n\/\/\/ \\param[in] ks_name keyspace name of a table for which CDC tables are removed\n\/\/\/ \\param[in] table_name name of a table for which CDC tables are removed\n\/\/\/\n\/\/\/ \\pre This function works correctly no matter if CDC Log and\/or CDC Description\n\/\/\/ exist.\nseastar::future<>\nremove(db_context ctx, const seastar::sstring& ks_name, const seastar::sstring& table_name);\n\nseastar::sstring log_name(const seastar::sstring& table_name);\n\nseastar::sstring desc_name(const seastar::sstring& table_name);\n\n\/\/\/ \\brief For each mutation in the set appends related CDC Log mutation\n\/\/\/\n\/\/\/ This function should be called with a set of mutations of a table\n\/\/\/ with CDC enabled. Returned set of mutations contains all original mutations\n\/\/\/ and for each original mutation appends a mutation to CDC Log that reflects\n\/\/\/ the change.\n\/\/\/\n\/\/\/ \\param[in] ctx object with references to database components\n\/\/\/ \\param[in] s schema of a CDC enabled table which is being modified\n\/\/\/ \\param[in] timeout period of time after which a request is considered timed out\n\/\/\/ \\param[in] qs the state of the query that's being executed\n\/\/\/ \\param[in] mutations set of changes of a CDC enabled table\n\/\/\/\n\/\/\/ \\return set of mutations from input parameter with relevant CDC Log mutations appended\n\/\/\/\n\/\/\/ \\pre CDC Log and CDC Description have to exist\n\/\/\/ \\pre CDC Description has to be in sync with cluster topology\n\/\/\/\n\/\/\/ \\note At the moment, cluster topology changes are not supported\n\/\/ so the assumption that CDC Description is in sync with cluster topology\n\/\/ is easy to enforce. When support for cluster topology changes is added\n\/\/ it has to make sure the assumption holds.\nseastar::future<std::vector<mutation>>append_log_mutations(\n db_context ctx,\n schema_ptr s,\n lowres_clock::time_point timeout,\n service::query_state& qs,\n std::vector<mutation> mutations);\n\n} \/\/ namespace cdc\n<|endoftext|>"} {"text":"<commit_before>\/**\r\n * The MIT License\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.\n *\n * @copyright 2009-2012 Roberto Perpuly\n * @license http:\/\/www.opensource.org\/licenses\/mit-license.php The MIT License\n *\/\r\n#include <pelet\/ParserClass.h>\r\n#include <pelet\/TokenClass.h>\r\n#include <unicode\/unistr.h>\n#include <unicode\/ustdio.h>\r\n\r\n\/\/ this is only used so that this program ca be run through valgrind (memory leak\r\n\/\/ detector). In real-world usage, this include is not needed.\n#include <unicode\/uclean.h>\r\n\r\n\/**\r\n * This is a program that shows the sample usage of the pelet library.\r\n * \r\n * The pelet library interface to the parser. We will given pelet::ParserClass an instance\r\n * of this object; as pelet::ParserClass is tokenizing source code, it will call only the appropriate\r\n * pelet::(Class|ClassMember|Function)ObserverClass methods AS SOON AS THE TOKEN IS REACHED.\r\n *\/\r\nclass SampleObserver : \r\n\tpublic pelet::ClassObserverClass, \/\/ for classes and define()\r\n\tpublic pelet::ClassMemberObserverClass, \/\/ for properties and methods\r\n\tpublic pelet::FunctionObserverClass, \/\/ for functions\r\n\tpublic pelet::VariableObserverClass { \/\/ for variables\r\n\r\npublic:\r\n\r\n\t\/**\n\t * This method gets called when a class is found.\n\t * \n\t * @param const UnicodeString& className the name of the class that was found\n\t * @param const UnicodeString& signature the list of classes that the class inherits \/ implements in code format\n\t * for example \"extends UserClass implements Runnable\"\n\t * @param const UnicodeString& comment PHPDoc attached to the class\r\n\t * @param lineNumber the line number (1-based) that the class was found in\n\t *\/\n\tvirtual void ClassFound(const UnicodeString& className, const UnicodeString& signature, \n\t\tconst UnicodeString& comment, const int lineNumber) {\r\n\t\tUFILE* ufout = u_finit(stdout, NULL, NULL);\r\n\t\tu_fprintf(ufout, \"Class Found: %.*S on line %d\\n\", className.length(), className.getBuffer(), lineNumber);\r\n\t\tu_fclose(ufout);\t\t\r\n\t}\n\t\n\t\/**\n\t * This method gets called when a define declaration is found.\n\t * \n\t * @param const UnicodeString& variableName the name of the defined variable\n\t * @param const UnicodeString& variableValue the variable value\n\t * @param const UnicodeString& comment PHPDoc attached to the define\r\n\t * @param lineNumber the line number (1-based) that the define was found in\n\t *\/\n\tvirtual void DefineDeclarationFound(const UnicodeString& variableName, const UnicodeString& variableValue, \n\t\tconst UnicodeString& comment, const int lineNumber) {\r\n\t\tUFILE* ufout = u_finit(stdout, NULL, NULL);\r\n\t\tu_fprintf(ufout, \"Define Found: %.*S on line %d\\n\", variableName.length(), variableName.getBuffer(), lineNumber);\r\n\t\tu_fclose(ufout);\r\n\t}\r\n\t\r\n\t\/**\n\t * Override this method to perform any custom logic when an include \/ require \/ require_once \/ include_once declaration is found.\n\t * \n\t * @param const UnicodeString& filename the name of the included file, but only if the statement\n\t * is a constant expression. Otherwise, lineNumber will be an empty string \n\t * @param lineNumber the line number (1-based) that the include\/ was found in\n\t *\/\n\tvirtual void IncludeFound(const UnicodeString& filename, const int lineNumber) {\r\n\t\tUFILE* ufout = u_finit(stdout, NULL, NULL);\r\n\t\tu_fprintf(ufout, \"Include or Require Found: %.*S on line %d\\n\", filename.length(), filename.getBuffer(), lineNumber);\r\n\t\tu_fclose(ufout);\r\n\t}\n\t\r\n\t\t\r\n\t\/* This method gets called when a class method is found.\n\t * \n\t * @param const UnicodeString& className the name of the class that was found\n\t * @param const UnicodeString& methodName the name of the method that was found\n\t * @param const UnicodeString& signature string containing method parameters. String is normalized, meaning that\n\t * any extra white space is removed, and every token is separated by one space only. ie. for the code\n\t * \"public function doWork( $item1, $item2 ) \" the signature will be \"($item1, $item2)\"\n\t * @param const UnicodeString& returnType the method's return type, as dictated by the PHPDoc comment\n\t * @param const UnicodeString& comment PHPDoc attached to the class\n\t * @param visibility the visibility token attached to the method: PUBLIC, PROTECTED, or PRIVATE\n\t * @param isStatic true if the method is static\r\n\t * @param lineNumber the line number (1-based) that the method was found in\n\t *\/\n\tvirtual void MethodFound(const UnicodeString& className, const UnicodeString& methodName, \n\t\tconst UnicodeString& signature, const UnicodeString& returnType, const UnicodeString& comment, \n\t\tpelet::TokenClass::TokenIds visibility, bool isStatic, const int lineNumber) {\r\n\t\tUFILE* ufout = u_finit(stdout, NULL, NULL);\r\n\t\tif (returnType.isEmpty()) {\r\n\t\t\tu_fprintf(ufout, \"Method Found: %.*S in class %.*S on line %d. Method did not have @return in PHPDoc comment\\n\", \r\n\t\t\t\tmethodName.length(), methodName.getBuffer(), className.length(), className.getBuffer(), lineNumber);\r\n\t\t}\r\n\t\telse {\r\n\t\t\tu_fprintf(ufout, \"Method Found: %.*S in class %.*S on line %d and returns %.*S\\n\", \r\n\t\t\t\tmethodName.length(), methodName.getBuffer(), className.length(), className.getBuffer(), lineNumber,\r\n\t\t\t\treturnType.length(), returnType.getBuffer());\r\n\t\t}\r\n\t\tu_fclose(ufout);\r\n\t}\n\t\n\t\/**\n\t * Override this method to perform any custom logic when a class property is found.\n\t * \n\t * @param const UnicodeString& className the name of the class that was found\n\t * @param const UnicodeString& propertyName the name of the property that was found\n\t * @param const UnicodeString& propertyType the property's type, as dictated by the PHPDoc comment\n\t * @param const UnicodeString& comment PHPDoc attached to the property\n\t * @param visibility the visibility token attached to the property: PUBLIC, PROTECTED, or PRIVATE\n\t * @param bool isConst true if property is a constant\n\t * @param isStatic true if the property is static\r\n\t * @param lineNumber the line number (1-based) that the property was found in\n\t *\/\n\tvirtual void PropertyFound(const UnicodeString& className, const UnicodeString& propertyName, \n\t\tconst UnicodeString& propertyType, const UnicodeString& comment, \n\t\tpelet::TokenClass::TokenIds visibility, bool isConst, bool isStatic, const int lineNumber) {\r\n\t\tUFILE* ufout = u_finit(stdout, NULL, NULL);\r\n\t\tif (propertyType.isEmpty()) {\r\n\t\t\tu_fprintf(ufout, \"Property Found: %.*S in class %.*S on line %d. Did not have @return in PHPDoc comment\\n\", \r\n\t\t\t\tpropertyName.length(), propertyName.getBuffer(), className.length(), className.getBuffer(), lineNumber);\r\n\t\t}\r\n\t\telse {\r\n\t\t\tu_fprintf(ufout, \"Property Found: %.*S in class %.*S on line %d and is of type %.*S\\n\", \r\n\t\t\t\tpropertyName.length(), propertyName.getBuffer(), className.length(), className.getBuffer(), lineNumber,\r\n\t\t\t\tpropertyType.length(), propertyType.getBuffer());\r\n\t\t}\r\n\t\tu_fclose(ufout);\t\r\n\t}\n\n\t\/**\n\t * This method gets called when the function has ended (a closing brace '}' was encountered).\n\t *\n\t * @param const UnicodeString& className the name of the class that was found\n\t * @param const UnicodeString& methodName the name of the method that was found\n\t * @param pos the character position (of the closing brace '}' original source code)\n\t *\/\n\tvirtual void MethodEnd(const UnicodeString& className, const UnicodeString& methodName, int pos) {\r\n\t\t\r\n\t}\r\n\t\r\n\t\/**\n\t * This method gets called when a function is found.\n\t * \n\t * @param const UnicodeString& functionName the name of the method that was found\n\t * @param const UnicodeString& signature string containing method parameters. String is normalized, meaning that\n\t * any extra white space is removed, and every token is separated by one space only. ie. for the code\n\t * \"public function doWork( $item1, $item2 ) \" the signature will be \"($item1, $item2)\"\n\t * @param const UnicodeString& returnType the function's return type, as dictated by the PHPDoc comment\n\t * @param const UnicodeString& comment PHPDoc attached to the class\r\n\t * @param lineNumber the line number (1-based) that the function was found in\n\t *\/\n\tvirtual void FunctionFound(const UnicodeString& functionName, \n\t\tconst UnicodeString& signature, const UnicodeString& returnType, const UnicodeString& comment, const int lineNumber) {\r\n\t\tUFILE* ufout = u_finit(stdout, NULL, NULL);\r\n\t\tif (returnType.isEmpty()) {\r\n\t\t\tu_fprintf(ufout, \"Function Found: %.*S on line %d. Function Did not have @return in PHPDoc comment\\n\", \r\n\t\t\t\tfunctionName.length(), functionName.getBuffer(), lineNumber);\r\n\t\t}\r\n\t\telse {\r\n\t\t\tu_fprintf(ufout, \"Function Found: %.*S on line %d and it returns %.*S\\n\", \r\n\t\t\t\tfunctionName.length(), functionName.getBuffer(), lineNumber,\r\n\t\t\t\treturnType.length(), returnType.getBuffer());\r\n\t\t}\r\n\t\tu_fclose(ufout);\t\t\r\n\t}\n\n\t\/**\n\t * This method gets called when the function has ended (a closing brace '}' was encountered).\n\t * @param const UnicodeString& functionName the name of the method that was found\n\t * @param pos the character position (of the closing brace '}' original source code)\n\t *\/\n\tvirtual void FunctionEnd(const UnicodeString& functionName, int pos) {\r\n\t\t\r\n\t}\r\n\t\r\n\t\/**\r\n\t * This method gets called when a variable assignment is found. Note that the same \r\n\t * variable may be assigned different values at different times within the same function.\r\n\t * The symbol will be constructed in the following way:\r\n\t *\r\n\t * Example assignment: $name = $this->getName()->toString();\r\n\t *\r\n\t * Lexeme: lexeme will contain the variable's name (ie $name)\r\n\t * ChainList: This is a list of properties \/ methods\r\n\t * that were successively invoked.\r\n\t * In this example, the expression chain list will have 3 items in\r\n\t * the chain list \"$this\" \"->getName()\" and \"->toString()\".\r\n\t *\r\n\t * \r\n\t * @param const UnicodeString& className class where the variable was found. may be empty is variable is scoped \r\n\t * inside a function or is global.\r\n\t * @param const UnicodeString& methodName function\/method name where the variable was found. may be empty if \r\n\t * variable is globally scoped.\r\n\t * @param const SymbolClass& symbol the name & type of the variable that was found\r\n\t * @param const UnicodeString& comment PHPDoc attached to the variable\r\n\t *\/\r\n\tvirtual void VariableFound(const UnicodeString& className, const UnicodeString& methodName, \r\n\t\t\tconst pelet::SymbolClass& symbol, const UnicodeString& comment) {\r\n\t\tUFILE* ufout = u_finit(stdout, NULL, NULL);\r\n\t\tUnicodeString scope;\r\n\t\tif (className.isEmpty() && methodName.isEmpty()) {\r\n\t\t\tscope = UNICODE_STRING_SIMPLE(\"<global>\");\r\n\t\t}\r\n\t\telse if (className.isEmpty() && !methodName.isEmpty()) {\r\n\t\t\tscope = methodName;\r\n\t\t}\r\n\t\telse {\r\n\t\t\tscope = className + UNICODE_STRING_SIMPLE(\"::\") + methodName;\r\n\t\t}\r\n\t\tUnicodeString type;\r\n\t\tif (pelet::SymbolClass::ARRAY == symbol.Type) {\r\n\t\t\ttype = UNICODE_STRING_SIMPLE(\"Variable is an array\");\r\n\t\t}\r\n\t\telse if (pelet::SymbolClass::PRIMITIVE == symbol.Type) {\r\n\t\t\ttype = UNICODE_STRING_SIMPLE(\"Variable is a primitive\");\r\n\t\t}\r\n\t\telse if (pelet::SymbolClass::OBJECT == symbol.Type) {\r\n\t\t\ttype = UNICODE_STRING_SIMPLE(\"Variable is the result of an object operation. \");\r\n\t\t\ttype += UNICODE_STRING_SIMPLE(\"Chain list is: \");\r\n\t\t\tfor (size_t i = 0; i < symbol.ChainList.size(); ++i) {\r\n\t\t\t\ttype += symbol.ChainList[i];\r\n\t\t\t\tif (i < (symbol.ChainList.size() - 1)) {\r\n\t\t\t\t\ttype += UNICODE_STRING_SIMPLE(\", \");\r\n\t\t\t\t}\r\n\t\t\t}\r\n\t\t\t\r\n\t\t}\r\n\t\telse if (pelet::SymbolClass::UNKNOWN == symbol.Type) {\r\n\t\t\ttype = UNICODE_STRING_SIMPLE(\"Variable is dynamic variable\");\r\n\t\t}\r\n\t\tif (!symbol.PhpDocType.isEmpty()) {\r\n\t\t\ttype += UNICODE_STRING_SIMPLE(\"Variable is decorated with a PHPDoc comment: \");\r\n\t\t\ttype += symbol.PhpDocType;\r\n\t\t}\r\n\t\tu_fprintf(ufout, \"Variable Found: %.*S in scope %S. %S\\n\", \r\n\t\t\t\tsymbol.Lexeme.length(), symbol.Lexeme.getBuffer(),\r\n\t\t\t\tscope.getTerminatedBuffer(),\r\n\t\t\t\ttype.getTerminatedBuffer());\r\n\t}\r\n};\r\n\nint main(int argc, char** argv) {\r\n\tif (argc < 2) {\r\n\t\tprintf(\"This program requires 1 argument: The path of the PHP file to parse.\\n\");\r\n\t\treturn -1;\r\n\t}\r\n\tSampleObserver observer;\r\n\tpelet::ParserClass parser;\r\n\tparser.SetClassObserver(&observer);\r\n\tparser.SetClassMemberObserver(&observer);\r\n\tparser.SetFunctionObserver(&observer);\r\n\tparser.SetVariableObserver(&observer);\r\n\t\r\n\tpelet::LintResultsClass results;\r\n\tbool parsed = parser.ScanFile(argv[1], results);\r\n\tif (parsed) {\r\n\t\tprintf(\"Parsing complete.\\n\");\r\n\t}\r\n\telse {\r\n\t\tUFILE* ufout = u_finit(stdout, NULL, NULL);\r\n\t\tu_fprintf(ufout, \"Parse error: %S on line %d\\n\", results.Error.getTerminatedBuffer(), results.LineNumber);\r\n\t\tu_fclose(ufout);\r\n\t}\r\n\t\r\n\t\/\/ this is only used so that this program can be run through valgrind (memory leak\r\n\t\/\/ detector). In real-world usage, this include is not needed.\r\n\tu_cleanup();\n\treturn 0;\n}<commit_msg>sample now uses the pelet 5.4 parser<commit_after>\/**\r\n * The MIT License\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.\n *\n * @copyright 2009-2012 Roberto Perpuly\n * @license http:\/\/www.opensource.org\/licenses\/mit-license.php The MIT License\n *\/\r\n#include <pelet\/ParserClass.h>\r\n#include <pelet\/TokenClass.h>\r\n#include <unicode\/unistr.h>\n#include <unicode\/ustdio.h>\r\n\r\n\/\/ this is only used so that this program ca be run through valgrind (memory leak\r\n\/\/ detector). In real-world usage, this include is not needed.\n#include <unicode\/uclean.h>\r\n\r\n\/**\r\n * This is a program that shows the sample usage of the pelet library.\r\n * \r\n * The pelet library interface to the parser. We will given pelet::ParserClass an instance\r\n * of this object; as pelet::ParserClass is tokenizing source code, it will call only the appropriate\r\n * pelet::(Class|ClassMember|Function)ObserverClass methods AS SOON AS THE TOKEN IS REACHED.\r\n *\/\r\nclass SampleObserver : \r\n\tpublic pelet::ClassObserverClass, \/\/ for classes and define()\r\n\tpublic pelet::ClassMemberObserverClass, \/\/ for properties and methods\r\n\tpublic pelet::FunctionObserverClass, \/\/ for functions\r\n\tpublic pelet::VariableObserverClass { \/\/ for variables\r\n\r\npublic:\r\n\r\n\t\/**\n\t * This method gets called when a class is found.\n\t * \n\t * @param const UnicodeString& className the name of the class that was found\n\t * @param const UnicodeString& signature the list of classes that the class inherits \/ implements in code format\n\t * for example \"extends UserClass implements Runnable\"\n\t * @param const UnicodeString& comment PHPDoc attached to the class\r\n\t * @param lineNumber the line number (1-based) that the class was found in\n\t *\/\n\tvirtual void ClassFound(const UnicodeString& className, const UnicodeString& signature, \n\t\tconst UnicodeString& comment, const int lineNumber) {\r\n\t\tUFILE* ufout = u_finit(stdout, NULL, NULL);\r\n\t\tu_fprintf(ufout, \"Class Found: %.*S on line %d\\n\", className.length(), className.getBuffer(), lineNumber);\r\n\t\tu_fclose(ufout);\t\t\r\n\t}\n\t\n\t\/**\n\t * This method gets called when a define declaration is found.\n\t * \n\t * @param const UnicodeString& variableName the name of the defined variable\n\t * @param const UnicodeString& variableValue the variable value\n\t * @param const UnicodeString& comment PHPDoc attached to the define\r\n\t * @param lineNumber the line number (1-based) that the define was found in\n\t *\/\n\tvirtual void DefineDeclarationFound(const UnicodeString& variableName, const UnicodeString& variableValue, \n\t\tconst UnicodeString& comment, const int lineNumber) {\r\n\t\tUFILE* ufout = u_finit(stdout, NULL, NULL);\r\n\t\tu_fprintf(ufout, \"Define Found: %.*S on line %d\\n\", variableName.length(), variableName.getBuffer(), lineNumber);\r\n\t\tu_fclose(ufout);\r\n\t}\r\n\t\r\n\t\/**\n\t * Override this method to perform any custom logic when an include \/ require \/ require_once \/ include_once declaration is found.\n\t * \n\t * @param const UnicodeString& filename the name of the included file, but only if the statement\n\t * is a constant expression. Otherwise, lineNumber will be an empty string \n\t * @param lineNumber the line number (1-based) that the include\/ was found in\n\t *\/\n\tvirtual void IncludeFound(const UnicodeString& filename, const int lineNumber) {\r\n\t\tUFILE* ufout = u_finit(stdout, NULL, NULL);\r\n\t\tu_fprintf(ufout, \"Include or Require Found: %.*S on line %d\\n\", filename.length(), filename.getBuffer(), lineNumber);\r\n\t\tu_fclose(ufout);\r\n\t}\n\t\r\n\t\t\r\n\t\/* This method gets called when a class method is found.\n\t * \n\t * @param const UnicodeString& className the name of the class that was found\n\t * @param const UnicodeString& methodName the name of the method that was found\n\t * @param const UnicodeString& signature string containing method parameters. String is normalized, meaning that\n\t * any extra white space is removed, and every token is separated by one space only. ie. for the code\n\t * \"public function doWork( $item1, $item2 ) \" the signature will be \"($item1, $item2)\"\n\t * @param const UnicodeString& returnType the method's return type, as dictated by the PHPDoc comment\n\t * @param const UnicodeString& comment PHPDoc attached to the class\n\t * @param visibility the visibility token attached to the method: PUBLIC, PROTECTED, or PRIVATE\n\t * @param isStatic true if the method is static\r\n\t * @param lineNumber the line number (1-based) that the method was found in\n\t *\/\n\tvirtual void MethodFound(const UnicodeString& className, const UnicodeString& methodName, \n\t\tconst UnicodeString& signature, const UnicodeString& returnType, const UnicodeString& comment, \n\t\tpelet::TokenClass::TokenIds visibility, bool isStatic, const int lineNumber) {\r\n\t\tUFILE* ufout = u_finit(stdout, NULL, NULL);\r\n\t\tif (returnType.isEmpty()) {\r\n\t\t\tu_fprintf(ufout, \"Method Found: %.*S in class %.*S on line %d. Method did not have @return in PHPDoc comment\\n\", \r\n\t\t\t\tmethodName.length(), methodName.getBuffer(), className.length(), className.getBuffer(), lineNumber);\r\n\t\t}\r\n\t\telse {\r\n\t\t\tu_fprintf(ufout, \"Method Found: %.*S in class %.*S on line %d and returns %.*S\\n\", \r\n\t\t\t\tmethodName.length(), methodName.getBuffer(), className.length(), className.getBuffer(), lineNumber,\r\n\t\t\t\treturnType.length(), returnType.getBuffer());\r\n\t\t}\r\n\t\tu_fclose(ufout);\r\n\t}\n\t\n\t\/**\n\t * Override this method to perform any custom logic when a class property is found.\n\t * \n\t * @param const UnicodeString& className the name of the class that was found\n\t * @param const UnicodeString& propertyName the name of the property that was found\n\t * @param const UnicodeString& propertyType the property's type, as dictated by the PHPDoc comment\n\t * @param const UnicodeString& comment PHPDoc attached to the property\n\t * @param visibility the visibility token attached to the property: PUBLIC, PROTECTED, or PRIVATE\n\t * @param bool isConst true if property is a constant\n\t * @param isStatic true if the property is static\r\n\t * @param lineNumber the line number (1-based) that the property was found in\n\t *\/\n\tvirtual void PropertyFound(const UnicodeString& className, const UnicodeString& propertyName, \n\t\tconst UnicodeString& propertyType, const UnicodeString& comment, \n\t\tpelet::TokenClass::TokenIds visibility, bool isConst, bool isStatic, const int lineNumber) {\r\n\t\tUFILE* ufout = u_finit(stdout, NULL, NULL);\r\n\t\tif (propertyType.isEmpty()) {\r\n\t\t\tu_fprintf(ufout, \"Property Found: %.*S in class %.*S on line %d. Did not have @return in PHPDoc comment\\n\", \r\n\t\t\t\tpropertyName.length(), propertyName.getBuffer(), className.length(), className.getBuffer(), lineNumber);\r\n\t\t}\r\n\t\telse {\r\n\t\t\tu_fprintf(ufout, \"Property Found: %.*S in class %.*S on line %d and is of type %.*S\\n\", \r\n\t\t\t\tpropertyName.length(), propertyName.getBuffer(), className.length(), className.getBuffer(), lineNumber,\r\n\t\t\t\tpropertyType.length(), propertyType.getBuffer());\r\n\t\t}\r\n\t\tu_fclose(ufout);\t\r\n\t}\n\n\t\/**\n\t * This method gets called when the function has ended (a closing brace '}' was encountered).\n\t *\n\t * @param const UnicodeString& className the name of the class that was found\n\t * @param const UnicodeString& methodName the name of the method that was found\n\t * @param pos the character position (of the closing brace '}' original source code)\n\t *\/\n\tvirtual void MethodEnd(const UnicodeString& className, const UnicodeString& methodName, int pos) {\r\n\t\t\r\n\t}\r\n\r\n\t\/**\r\n\t * This method gets called when a trait use statement has been found\r\n\t *\r\n\t * @param className the fully qualified name of the class that uses the trait\r\n\t * @param traitName the fully qualified name of the trait to be used \r\n\t *\/\r\n\tvirtual void TraitUseFound(const UnicodeString& className, const UnicodeString& traitName) {\r\n\t\tUFILE* ufout = u_finit(stdout, NULL, NULL);\r\n\t\tu_fprintf(ufout, \"Trait Usage Found in class %.*S. Trait Name %.*S \\n\", \r\n\t\t\tclassName.length(), className.getBuffer(), traitName.length(), traitName.getBuffer());\r\n\t\tu_fclose(ufout);\r\n\t}\r\n\t\r\n\t\/**\r\n\t * Override this method to perform custom logic when a trait method has been aliased\r\n\t * \r\n\t * @param traitUsedClassName the class name of the trait to be aliased\r\n\t * @param traitMethodName the fully qualified name of the trait method that is to be aliased (hidden)\r\n\t * this may be empty if the trait adaptation only changes the visibility and\r\n\t * does not need to resolve a trait conflict\r\n\t * @param alias the name of the new alias. alias may be empty when ONLY the visibility is changed.\r\n\t * @param visibility the visbility of the trait method. may be PUBLIC if the visibility was not changed.\r\n\t *\/\r\n\tvirtual void TraitAliasFound(const UnicodeString& className, const UnicodeString& traitUsedClassName,\r\n\t\tconst UnicodeString& traitMethodName, \r\n\t\tconst UnicodeString& alias, pelet::TokenClass::TokenIds visibility) {\r\n\t\tUFILE* ufout = u_finit(stdout, NULL, NULL);\r\n\t\tif (!alias.isEmpty()) {\r\n\t\t\tchar* visibilityStr;\r\n\t\t\tif (pelet::TokenClass::PRIVATE == visibility) {\r\n\t\t\t\tvisibilityStr = \"private\";\r\n\t\t\t}\r\n\t\t\telse if (pelet::TokenClass::PROTECTED == visibility) {\r\n\t\t\t\tvisibilityStr = \"protected\";\r\n\t\t\t}\r\n\t\t\telse {\r\n\t\t\t\tvisibilityStr = \"public\";\r\n\t\t\t}\r\n\t\t\tu_fprintf(ufout, \"Trait Alias Found in class %.*S. Trait Class %.*S Trait Method %.*S Trait Alias %.*S New Visibility %s \\n\", \r\n\t\t\t\tclassName.length(), className.getBuffer(), \r\n\t\t\t\ttraitUsedClassName.length(), traitUsedClassName.getBuffer(),\r\n\t\t\t\ttraitMethodName.length(), traitMethodName.getBuffer(),\r\n\t\t\t\talias.length(), alias.getBuffer(),\r\n\t\t\t\tvisibilityStr);\r\n\t\t}\r\n\t\telse {\r\n\t\t\tchar* visibilityStr;\r\n\t\t\tif (pelet::TokenClass::PRIVATE == visibility) {\r\n\t\t\t\tvisibilityStr = \"private\";\r\n\t\t\t}\r\n\t\t\telse if (pelet::TokenClass::PROTECTED == visibility) {\r\n\t\t\t\tvisibilityStr = \"protected\";\r\n\t\t\t}\r\n\t\t\telse {\r\n\t\t\t\tvisibilityStr = \"public\";\r\n\t\t\t}\r\n\t\t\tu_fprintf(ufout, \"Trait Change in visbility Found in class %.*S. Trait Class %.*S Trait Method %.*S New Visibility %s\\n\", \r\n\t\t\t\tclassName.length(), className.getBuffer(), \r\n\t\t\t\ttraitUsedClassName.length(), traitUsedClassName.getBuffer(),\r\n\t\t\t\ttraitMethodName.length(), traitMethodName.getBuffer(),\r\n\t\t\t\tvisibilityStr\r\n\t\t\t);\r\n\t\t}\r\n\t\tu_fclose(ufout);\r\n\t}\r\n\t\r\n\t\/**\n\t * This method gets called when a function is found.\n\t * \n\t * @param const UnicodeString& functionName the name of the method that was found\n\t * @param const UnicodeString& signature string containing method parameters. String is normalized, meaning that\n\t * any extra white space is removed, and every token is separated by one space only. ie. for the code\n\t * \"public function doWork( $item1, $item2 ) \" the signature will be \"($item1, $item2)\"\n\t * @param const UnicodeString& returnType the function's return type, as dictated by the PHPDoc comment\n\t * @param const UnicodeString& comment PHPDoc attached to the class\r\n\t * @param lineNumber the line number (1-based) that the function was found in\n\t *\/\n\tvirtual void FunctionFound(const UnicodeString& functionName, \n\t\tconst UnicodeString& signature, const UnicodeString& returnType, const UnicodeString& comment, const int lineNumber) {\r\n\t\tUFILE* ufout = u_finit(stdout, NULL, NULL);\r\n\t\tif (returnType.isEmpty()) {\r\n\t\t\tu_fprintf(ufout, \"Function Found: %.*S on line %d. Function Did not have @return in PHPDoc comment\\n\", \r\n\t\t\t\tfunctionName.length(), functionName.getBuffer(), lineNumber);\r\n\t\t}\r\n\t\telse {\r\n\t\t\tu_fprintf(ufout, \"Function Found: %.*S on line %d and it returns %.*S\\n\", \r\n\t\t\t\tfunctionName.length(), functionName.getBuffer(), lineNumber,\r\n\t\t\t\treturnType.length(), returnType.getBuffer());\r\n\t\t}\r\n\t\tu_fclose(ufout);\t\t\r\n\t}\n\n\t\/**\n\t * This method gets called when the function has ended (a closing brace '}' was encountered).\n\t * @param const UnicodeString& functionName the name of the method that was found\n\t * @param pos the character position (of the closing brace '}' original source code)\n\t *\/\n\tvirtual void FunctionEnd(const UnicodeString& functionName, int pos) {\r\n\t\t\r\n\t}\r\n\t\r\n\t\/**\r\n\t * This method gets called when a variable assignment is found. Note that the same \r\n\t * variable may be assigned different values at different times within the same function.\r\n\t * The symbol will be constructed in the following way:\r\n\t *\r\n\t * Example assignment: $name = $this->getName()->toString();\r\n\t *\r\n\t * Lexeme: lexeme will contain the variable's name (ie $name)\r\n\t * ChainList: This is a list of properties \/ methods\r\n\t * that were successively invoked.\r\n\t * In this example, the expression chain list will have 3 items in\r\n\t * the chain list \"$this\" \"->getName()\" and \"->toString()\".\r\n\t *\r\n\t * \r\n\t * @param const UnicodeString& className class where the variable was found. may be empty is variable is scoped \r\n\t * inside a function or is global.\r\n\t * @param const UnicodeString& methodName function\/method name where the variable was found. may be empty if \r\n\t * variable is globally scoped.\r\n\t * @param const SymbolClass& symbol the name & type of the variable that was found\r\n\t * @param const UnicodeString& comment PHPDoc attached to the variable\r\n\t *\/\r\n\tvirtual void VariableFound(const UnicodeString& className, const UnicodeString& methodName, \r\n\t\t\tconst pelet::SymbolClass& symbol, const UnicodeString& comment) {\r\n\t\tUFILE* ufout = u_finit(stdout, NULL, NULL);\r\n\t\tUnicodeString scope;\r\n\t\tif (className.isEmpty() && methodName.isEmpty()) {\r\n\t\t\tscope = UNICODE_STRING_SIMPLE(\"<global>\");\r\n\t\t}\r\n\t\telse if (className.isEmpty() && !methodName.isEmpty()) {\r\n\t\t\tscope = methodName;\r\n\t\t}\r\n\t\telse {\r\n\t\t\tscope = className + UNICODE_STRING_SIMPLE(\"::\") + methodName;\r\n\t\t}\r\n\t\tUnicodeString type;\r\n\t\tif (pelet::SymbolClass::ARRAY == symbol.Type) {\r\n\t\t\ttype = UNICODE_STRING_SIMPLE(\"Variable is an array\");\r\n\t\t}\r\n\t\telse if (pelet::SymbolClass::PRIMITIVE == symbol.Type) {\r\n\t\t\ttype = UNICODE_STRING_SIMPLE(\"Variable is a primitive\");\r\n\t\t}\r\n\t\telse if (pelet::SymbolClass::OBJECT == symbol.Type) {\r\n\t\t\ttype = UNICODE_STRING_SIMPLE(\"Variable is the result of an object operation. \");\r\n\t\t\ttype += UNICODE_STRING_SIMPLE(\"Chain list is: \");\r\n\t\t\tfor (size_t i = 0; i < symbol.ChainList.size(); ++i) {\r\n\t\t\t\ttype += symbol.ChainList[i];\r\n\t\t\t\tif (i < (symbol.ChainList.size() - 1)) {\r\n\t\t\t\t\ttype += UNICODE_STRING_SIMPLE(\", \");\r\n\t\t\t\t}\r\n\t\t\t}\r\n\t\t\t\r\n\t\t}\r\n\t\telse if (pelet::SymbolClass::UNKNOWN == symbol.Type) {\r\n\t\t\ttype = UNICODE_STRING_SIMPLE(\"Variable is dynamic variable\");\r\n\t\t}\r\n\t\tif (!symbol.PhpDocType.isEmpty()) {\r\n\t\t\ttype += UNICODE_STRING_SIMPLE(\"Variable is decorated with a PHPDoc comment: \");\r\n\t\t\ttype += symbol.PhpDocType;\r\n\t\t}\r\n\t\tu_fprintf(ufout, \"Variable Found: %.*S in scope %S. %S\\n\", \r\n\t\t\t\tsymbol.Lexeme.length(), symbol.Lexeme.getBuffer(),\r\n\t\t\t\tscope.getTerminatedBuffer(),\r\n\t\t\t\ttype.getTerminatedBuffer());\r\n\t}\r\n};\r\n\nint main(int argc, char** argv) {\r\n\tif (argc < 2) {\r\n\t\tprintf(\"This program requires 1 argument: The path of the PHP file to parse.\\n\");\r\n\t\treturn -1;\r\n\t}\r\n\tSampleObserver observer;\r\n\tpelet::ParserClass parser;\r\n\tparser.SetVersion(pelet::PHP_54);\r\n\tparser.SetClassObserver(&observer);\r\n\tparser.SetClassMemberObserver(&observer);\r\n\tparser.SetFunctionObserver(&observer);\r\n\tparser.SetVariableObserver(&observer);\r\n\t\r\n\tpelet::LintResultsClass results;\r\n\tbool parsed = parser.ScanFile(argv[1], results);\r\n\tif (parsed) {\r\n\t\tprintf(\"Parsing complete.\\n\");\r\n\t}\r\n\telse {\r\n\t\tUFILE* ufout = u_finit(stdout, NULL, NULL);\r\n\t\tu_fprintf(ufout, \"Parse error: %S on line %d\\n\", results.Error.getTerminatedBuffer(), results.LineNumber);\r\n\t\tu_fclose(ufout);\r\n\t}\r\n\t\r\n\t\/\/ this is only used so that this program can be run through valgrind (memory leak\r\n\t\/\/ detector). In real-world usage, this include is not needed.\r\n\tu_cleanup();\n\treturn 0;\n}<|endoftext|>"} {"text":"<commit_before>#include <primesieve\/soe\/PrimeSieve.h>\n#include <iostream>\n\nunsigned int sum = 0;\n\nvoid callback(unsigned int prime) {\n sum += prime;\n}\n\nint main() {\n PrimeSieve ps;\n ps.generatePrimes(2, 1000, callback);\n std::cout << \"Sum of the primes below 1000 = \" << sum << std::endl;\n return 0;\n}\n<commit_msg>not needed anymore<commit_after><|endoftext|>"} {"text":"<commit_before>\/\/ @(#)root\/tree:$Name: $:$Id: TMethodBrowsable.cxx,v 1.1 2004\/10\/17 11:55:47 brun Exp $\n\/\/ Author: Axel Naumann 14\/10\/2004\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\/\/ TMethodBrowsable \/\/\n\/\/ \/\/\n\/\/ A helper object to browse methods (see \/\/\n\/\/ TBranchElement::GetBrowsableMethods) \/\/\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n#include \"TMethodBrowsable.h\"\n#include \"TBranchElement.h\"\n#include \"TMethod.h\"\n#include \"TBrowser.h\"\n#include \"TTree.h\"\n#include \"TPad.h\"\n#include \"TClass.h\"\n#include \"TBaseClass.h\"\n\nClassImp(TMethodBrowsable);\n\n\/\/______________________________________________________________________________\nTMethodBrowsable::TMethodBrowsable(TBranchElement* be, TMethod* m,\n TMethodBrowsable* parent \/* =0 *\/):\n fBranchElement(be), fParent(parent), fMethod(m), \n fReturnClass(0), fReturnLeafs(0), fReturnIsPointer(kFALSE) {\n\/\/ standard constructor.\n\/\/ Links a TBranchElement with a TMethod, allowing the TBrowser to\n\/\/ Browser simple methods.\n\/\/\n\/\/ The c'tor sets the name for a method \"Class::Method(params) const\"\n\/\/ to \"Method(params)\", title to TMethod::GetPrototype\n TString name(m->GetName());\n name+=\"()\";\n if (name.EndsWith(\" const\")) name.Remove(name.Length()-6);\n SetName(name);\n\n name=m->GetPrototype();\n if (m->GetCommentString() && strlen(m->GetCommentString()))\n name.Append(\" \/\/ \").Append(m->GetCommentString());\n SetTitle(name);\n\n TString plainReturnType(m->GetReturnTypeName());\n if (plainReturnType.EndsWith(\"*\")) {\n fReturnIsPointer=kTRUE;\n plainReturnType.Remove(plainReturnType.Length()-1);\n plainReturnType.Strip();\n }\n fReturnClass=gROOT->GetClass(plainReturnType);\n}\n\n\/\/______________________________________________________________________________\nvoid TMethodBrowsable::Browse(TBrowser *b) {\n\/\/ Calls TTree::Draw on the method if return type is not a class;\n\/\/ otherwise expands returned object's \"folder\"\n\n if (!fReturnClass) {\n TString name;\n GetScope(name);\n fBranchElement->GetTree()->Draw(name, \"\", b ? b->GetDrawOption() : \"\");\n if (gPad) gPad->Update();\n } else {\n if (!fReturnLeafs)\n fReturnLeafs=GetMethodBrowsables(fBranchElement, fReturnClass, this);\n if (fReturnLeafs)\n fReturnLeafs->Browse(b);\n }\n}\n\n\/\/______________________________________________________________________________\nTList* TMethodBrowsable::GetMethodBrowsables(TBranchElement* be, TClass* cl,\n TMethodBrowsable* parent \/* =0 *\/) {\n\/\/ Given a class, this methods returns a list of TMethodBrowsables\n\/\/ for the class and its base classes.\n\/\/ This list has to be deleted by the caller!\n\n if (!cl) return 0;\n\n TList allClasses;\n allClasses.Add(cl);\n \n for(TObjLink* lnk=allClasses.FirstLink();\n lnk; lnk=lnk->Next()){\n cl=(TClass*)lnk->GetObject();\n TList* bases=cl->GetListOfBases();\n TBaseClass* base;\n TIter iB(bases);\n while ((base=(TBaseClass*)iB())) {\n TClass* bc=base->GetClassPointer();\n if (bc) allClasses.Add(bc);\n }\n }\n\n TList allMethods;\n TIter iC(&allClasses);\n while ((cl=(TClass*)iC())) {\n TList* methods=cl->GetListOfMethods();\n if (!methods) continue;\n TMethod* method=0;\n TIter iM(methods);\n while ((method=(TMethod*)iM()))\n if (method && !allMethods.FindObject(method->GetName()))\n allMethods.Add(method);\n }\n\n TIter iM(&allMethods);\n TMethod* m=0;\n TList* browsableMethods=new TList();\n browsableMethods->SetOwner();\n while ((m=(TMethod*)iM()))\n if (TMethodBrowsable::IsMethodBrowsable(m))\n browsableMethods->Add(new TMethodBrowsable(be, m, parent));\n\n return browsableMethods;\n}\n\n\/\/______________________________________________________________________________\nvoid TMethodBrowsable::GetScope(TString & scope) {\n\/\/ Returns the full name for TTree::Draw to draw *this.\n\/\/ Recursively appends, starting form the top TBranchElement,\n\/\/ all method names with proper reference operators (->, .)\n\/\/ depending on fReturnIsPointer.\n\n if (fParent)\n fParent->GetScope(scope);\n else {\n scope=fBranchElement->GetName();\n scope+=\".\";\n TBranch* mother=fBranchElement;\n while (mother != mother->GetMother() && (mother=mother->GetMother()))\n scope.Prepend(\".\").Prepend(mother->GetName());\n }\n scope+=GetName();\n if (fReturnClass) \/\/ otherwise we're a leaf, and we are the one drawn\n if (fReturnIsPointer)\n scope+=\"->\";\n else scope+=\".\";\n}\n\n\/\/______________________________________________________________________________\nBool_t TMethodBrowsable::IsMethodBrowsable(TMethod* m) {\n\/\/ A TMethod is browsable if it is const, public and not pure virtual,\n\/\/ if does not have any parameter without default value, and if it has \n\/\/ a (non-void) return value.\n\n return (m->GetNargs()-m->GetNargsOpt()==0\n && (m->Property() & kIsConstant \n & ~kIsPrivate & ~kIsProtected & ~kIsPureVirtual )\n && m->GetReturnTypeName()\n && strcmp(\"void\",m->GetReturnTypeName())\n && !strstr(m->GetName(),\"DeclFile\")\n && !strstr(m->GetName(),\"ImplFile\")\n && strcmp(m->GetName(),\"IsA\")\n && strcmp(m->GetName(),\"Class\")\n && strcmp(m->GetName(),\"CanBypassStreamer\")\n && strcmp(m->GetName(),\"Class_Name\")\n && strcmp(m->GetName(),\"ClassName\")\n && strcmp(m->GetName(),\"Clone\")\n && strcmp(m->GetName(),\"DrawClone\")\n && strcmp(m->GetName(),\"GetName\")\n && strcmp(m->GetName(),\"GetDrawOption\")\n && strcmp(m->GetName(),\"GetIconName\")\n && strcmp(m->GetName(),\"GetOption\")\n && strcmp(m->GetName(),\"GetTitle\")\n && strcmp(m->GetName(),\"GetUniqueID\")\n && strcmp(m->GetName(),\"Hash\")\n && strcmp(m->GetName(),\"IsFolder\")\n && strcmp(m->GetName(),\"IsOnHeap\")\n && strcmp(m->GetName(),\"IsSortable\")\n && strcmp(m->GetName(),\"IsZombie\")); \n}\n<commit_msg>From Axel naumann: Browsable methods may not have a corresponding data member, i.e. if a member fX, _X, or mX exists, the methods GetX(), getX(), and X() will not be browsable.<commit_after>\/\/ @(#)root\/tree:$Name: $:$Id: TMethodBrowsable.cxx,v 1.2 2004\/10\/17 20:59:58 brun Exp $\n\/\/ Author: Axel Naumann 14\/10\/2004\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\/\/ TMethodBrowsable \/\/\n\/\/ \/\/\n\/\/ A helper object to browse methods (see \/\/\n\/\/ TBranchElement::GetBrowsableMethods) \/\/\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n#include \"TMethodBrowsable.h\"\n#include \"TBranchElement.h\"\n#include \"TMethod.h\"\n#include \"TBrowser.h\"\n#include \"TTree.h\"\n#include \"TPad.h\"\n#include \"TClass.h\"\n#include \"TBaseClass.h\"\n\nClassImp(TMethodBrowsable);\n\n\/\/______________________________________________________________________________\nTMethodBrowsable::TMethodBrowsable(TBranchElement* be, TMethod* m,\n TMethodBrowsable* parent \/* =0 *\/):\n fBranchElement(be), fParent(parent), fMethod(m), \n fReturnClass(0), fReturnLeafs(0), fReturnIsPointer(kFALSE) {\n\/\/ standard constructor.\n\/\/ Links a TBranchElement with a TMethod, allowing the TBrowser to\n\/\/ Browser simple methods.\n\/\/\n\/\/ The c'tor sets the name for a method \"Class::Method(params) const\"\n\/\/ to \"Method(params)\", title to TMethod::GetPrototype\n TString name(m->GetName());\n name+=\"()\";\n if (name.EndsWith(\" const\")) name.Remove(name.Length()-6);\n SetName(name);\n\n name=m->GetPrototype();\n if (m->GetCommentString() && strlen(m->GetCommentString()))\n name.Append(\" \/\/ \").Append(m->GetCommentString());\n SetTitle(name);\n\n TString plainReturnType(m->GetReturnTypeName());\n if (plainReturnType.EndsWith(\"*\")) {\n fReturnIsPointer=kTRUE;\n plainReturnType.Remove(plainReturnType.Length()-1);\n plainReturnType.Strip();\n }\n fReturnClass=gROOT->GetClass(plainReturnType);\n}\n\n\/\/______________________________________________________________________________\nvoid TMethodBrowsable::Browse(TBrowser *b) {\n\/\/ Calls TTree::Draw on the method if return type is not a class;\n\/\/ otherwise expands returned object's \"folder\"\n\n if (!fReturnClass) {\n TString name;\n GetScope(name);\n fBranchElement->GetTree()->Draw(name, \"\", b ? b->GetDrawOption() : \"\");\n if (gPad) gPad->Update();\n } else {\n if (!fReturnLeafs)\n fReturnLeafs=GetMethodBrowsables(fBranchElement, fReturnClass, this);\n if (fReturnLeafs)\n fReturnLeafs->Browse(b);\n }\n}\n\n\/\/______________________________________________________________________________\nTList* TMethodBrowsable::GetMethodBrowsables(TBranchElement* be, TClass* cl,\n TMethodBrowsable* parent \/* =0 *\/) {\n\/\/ Given a class, this methods returns a list of TMethodBrowsables\n\/\/ for the class and its base classes.\n\/\/ This list has to be deleted by the caller!\n\n if (!cl) return 0;\n\n TList allClasses;\n allClasses.Add(cl);\n \n for(TObjLink* lnk=allClasses.FirstLink();\n lnk; lnk=lnk->Next()){\n cl=(TClass*)lnk->GetObject();\n TList* bases=cl->GetListOfBases();\n TBaseClass* base;\n TIter iB(bases);\n while ((base=(TBaseClass*)iB())) {\n TClass* bc=base->GetClassPointer();\n if (bc) allClasses.Add(bc);\n }\n }\n\n TList allMethods;\n TIter iC(&allClasses);\n while ((cl=(TClass*)iC())) {\n TList* methods=cl->GetListOfMethods();\n if (!methods) continue;\n TMethod* method=0;\n TIter iM(methods);\n while ((method=(TMethod*)iM()))\n if (method && !allMethods.FindObject(method->GetName()))\n allMethods.Add(method);\n }\n\n TIter iM(&allMethods);\n TMethod* m=0;\n TList* browsableMethods=new TList();\n browsableMethods->SetOwner();\n while ((m=(TMethod*)iM()))\n if (TMethodBrowsable::IsMethodBrowsable(m))\n browsableMethods->Add(new TMethodBrowsable(be, m, parent));\n\n return browsableMethods;\n}\n\n\/\/______________________________________________________________________________\nvoid TMethodBrowsable::GetScope(TString & scope) {\n\/\/ Returns the full name for TTree::Draw to draw *this.\n\/\/ Recursively appends, starting form the top TBranchElement,\n\/\/ all method names with proper reference operators (->, .)\n\/\/ depending on fReturnIsPointer.\n\n if (fParent)\n fParent->GetScope(scope);\n else {\n scope=fBranchElement->GetName();\n scope+=\".\";\n TBranch* mother=fBranchElement;\n while (mother != mother->GetMother() && (mother=mother->GetMother()))\n scope.Prepend(\".\").Prepend(mother->GetName());\n }\n scope+=GetName();\n if (fReturnClass) \/\/ otherwise we're a leaf, and we are the one drawn\n if (fReturnIsPointer)\n scope+=\"->\";\n else scope+=\".\";\n}\n\n\/\/______________________________________________________________________________\nBool_t TMethodBrowsable::IsMethodBrowsable(TMethod* m) {\n\/\/ A TMethod is browsable if it is const, public and not pure virtual,\n\/\/ if does not have any parameter without default value, and if it has \n\/\/ a (non-void) return value.\n\/\/ A method called *, Get*, or get* will not be browsable if there is a \n\/\/ data member called f*, _*, or m*, as data member access is faster\n\/\/ than method access. Examples: if one of fX, _X, or mX is a data\n\/\/ member, the methods GetX(), getX(), and X() will not be browsable.\n\n if (m->GetNargs()-m->GetNargsOpt()==0\n && (m->Property() & kIsConstant \n & ~kIsPrivate & ~kIsProtected & ~kIsPureVirtual )\n && m->GetReturnTypeName()\n && strcmp(\"void\",m->GetReturnTypeName())\n && !strstr(m->GetName(),\"DeclFile\")\n && !strstr(m->GetName(),\"ImplFile\")\n && strcmp(m->GetName(),\"IsA\")\n && strcmp(m->GetName(),\"Class\")\n && strcmp(m->GetName(),\"CanBypassStreamer\")\n && strcmp(m->GetName(),\"Class_Name\")\n && strcmp(m->GetName(),\"ClassName\")\n && strcmp(m->GetName(),\"Clone\")\n && strcmp(m->GetName(),\"DrawClone\")\n && strcmp(m->GetName(),\"GetName\")\n && strcmp(m->GetName(),\"GetDrawOption\")\n && strcmp(m->GetName(),\"GetIconName\")\n && strcmp(m->GetName(),\"GetOption\")\n && strcmp(m->GetName(),\"GetTitle\")\n && strcmp(m->GetName(),\"GetUniqueID\")\n && strcmp(m->GetName(),\"Hash\")\n && strcmp(m->GetName(),\"IsFolder\")\n && strcmp(m->GetName(),\"IsOnHeap\")\n && strcmp(m->GetName(),\"IsSortable\")\n && strcmp(m->GetName(),\"IsZombie\")) {\n \/\/ look for matching data member\n TClass* cl=m->GetClass();\n if (!cl) return kTRUE;\n TList* members=cl->GetListOfDataMembers();\n if (!members) return kTRUE;\n const char* baseName=m->GetName();\n if (!strncmp(m->GetName(), \"Get\", 3) ||\n !strncmp(m->GetName(), \"get\", 3))\n baseName+=3;\n if (!baseName[0]) return kTRUE;\n return (!members->FindObject(Form(\"f%s\", baseName)) &&\n !members->FindObject(Form(\"_%s\", baseName)) &&\n !members->FindObject(Form(\"m%s\", baseName)));\n };\n return kFALSE;\n}\n<|endoftext|>"} {"text":"<commit_before>#include <moe\/moe.hpp>\n#include <iostream>\n\n#ifdef _MSC_VER\n #include <string> \/\/ needed with MSVC 19.0 for overloaded << on std::string\n#endif\n\n#include <chrono>\n#include <unordered_map>\n\nvoid remove_duplicates(std::string &str)\n{\n std::string unique = \"\";\n unique += str[0];\n for(unsigned int i = 1; i < str.size(); i++)\n {\n bool found = false;\n for(unsigned int j = 0; j < unique.size(); j++)\n {\n if(str[i] == unique[j])\n found = true;\n }\n if(found == false)\n unique += str[i];\n }\n str = unique;\n}\n\nint main()\n{\n Moether<Moe> moether;\n \n std::unordered_map< std::string, unsigned int > distances;\n distances[\"AB\"] = 100;\n distances[\"AC\"] = 300;\n distances[\"AD\"] = 100;\n distances[\"AE\"] = 75;\n \n distances[\"BA\"] = distances[\"AB\"];\n distances[\"BC\"] = 50;\n distances[\"BD\"] = 75;\n distances[\"BE\"] = 125;\n\n distances[\"CA\"] = distances[\"AC\"];\n distances[\"CB\"] = distances[\"BC\"];\n distances[\"CD\"] = 100;\n distances[\"CE\"] = 125;\n\n distances[\"DA\"] = distances[\"AD\"];\n distances[\"DB\"] = distances[\"BD\"];\n distances[\"DC\"] = distances[\"CD\"];\n distances[\"DE\"] = 50;\n\n distances[\"EA\"] = distances[\"AE\"];\n distances[\"EB\"] = distances[\"BE\"];\n distances[\"EC\"] = distances[\"CE\"];\n distances[\"ED\"] = distances[\"DE\"];\n\n moether.setFitnessFunction( [&distances](const Moe& moe) -> double\n {\n std::string genotype = moe.getGenotype();\n\n unsigned int fitness = 0;\n\n std::string test_string = genotype;\n remove_duplicates(test_string);\n\n if( test_string.size() == genotype.size() && genotype.size() == 4 )\n {\n\n int error = -1000;\n genotype.insert(0, \"A\");\n genotype += \"A\";\n\n while( genotype.size() >= 2 )\n {\n std::string pair = \"\";\n pair += genotype[0];\n pair += genotype[1];\n\n error += distances[ pair ];\n \n genotype.erase( genotype.begin() );\n }\n fitness += -error;\n }\n \n return fitness;\n });\n\n moether.setInitGenotypeSize( 5 );\n moether.setCharset(\"BCDE\");\n moether.setCrossover( moe::Crossover::Uniform );\n\n auto start = std::chrono::high_resolution_clock::now();\n\n moether.init( 30 , 5 );\n moether.run( 100 );\n\n auto end = std::chrono::high_resolution_clock::now();\n std::chrono::duration<float> diff = end-start;\n\n std::cout << \"genotype: \" << moether.getBestMoe().getGenotype() << \"\\n\"\n << \"fitness: \" << moether.getBestMoe().getFitness() << \"\\n\"\n << \"time spent: \" << diff.count() << \" seconds\" << \"\\n\";\n\n std::cout << \"path = A\" << moether.getBestMoe().getGenotype() + \"A\\n\"\n << \"distance = \" << std::abs(moether.getBestMoe().getFitness() - 1000) << std::endl;\n}<commit_msg>Updated salesman example<commit_after>#include <moe\/moe.hpp>\n#include <iostream>\n\n#ifdef _MSC_VER\n #include <string> \/\/ needed with MSVC 19.0 for overloaded << on std::string\n#endif\n\n#include <chrono>\n#include <unordered_map>\n\nvoid remove_duplicates(std::string &str)\n{\n std::string unique = \"\";\n unique += str[0];\n for(unsigned int i = 1; i < str.size(); i++)\n {\n bool found = false;\n for(unsigned int j = 0; j < unique.size(); j++)\n {\n if(str[i] == unique[j])\n found = true;\n }\n if(found == false)\n unique += str[i];\n }\n str = unique;\n}\n\nint main()\n{\n Moether<Moe> moether;\n \n std::unordered_map< std::string, unsigned int > distances;\n distances[\"AB\"] = 100;\n distances[\"AC\"] = 300;\n distances[\"AD\"] = 100;\n distances[\"AE\"] = 75;\n \n distances[\"BA\"] = distances[\"AB\"];\n distances[\"BC\"] = 50;\n distances[\"BD\"] = 75;\n distances[\"BE\"] = 125;\n\n distances[\"CA\"] = distances[\"AC\"];\n distances[\"CB\"] = distances[\"BC\"];\n distances[\"CD\"] = 100;\n distances[\"CE\"] = 125;\n\n distances[\"DA\"] = distances[\"AD\"];\n distances[\"DB\"] = distances[\"BD\"];\n distances[\"DC\"] = distances[\"CD\"];\n distances[\"DE\"] = 50;\n\n distances[\"EA\"] = distances[\"AE\"];\n distances[\"EB\"] = distances[\"BE\"];\n distances[\"EC\"] = distances[\"CE\"];\n distances[\"ED\"] = distances[\"DE\"];\n\n moether.setFitnessFunction( [&distances](const Moe& moe) -> double\n {\n std::string genotype = moe.getGenotype();\n\n unsigned int fitness = 0;\n\n std::string test_string = genotype;\n remove_duplicates(test_string);\n\n if( test_string.size() == genotype.size() && genotype.size() == 4 )\n {\n\n int error = -1000;\n genotype.insert(0, \"A\");\n genotype += \"A\";\n\n while( genotype.size() >= 2 )\n {\n std::string pair = \"\";\n pair += genotype[0];\n pair += genotype[1];\n\n error += distances[ pair ];\n \n genotype.erase( genotype.begin() );\n }\n fitness += -error;\n }\n \n return fitness;\n });\n\n moether.setInitGenotypeSize( 4 );\n moether.setCharset(\"BCDE\");\n moether.setCrossover( moe::Crossover::Uniform );\n moether.unregisterMutation( moe::Mutation::Insertion );\n moether.unregisterMutation( moe::Mutation::Deletion );\n\n auto start = std::chrono::high_resolution_clock::now();\n\n moether.init( 30 , 5 );\n moether.run( 100 );\n\n auto end = std::chrono::high_resolution_clock::now();\n std::chrono::duration<float> diff = end-start;\n\n std::cout << \"genotype: \" << moether.getBestMoe().getGenotype() << \"\\n\"\n << \"fitness: \" << moether.getBestMoe().getFitness() << \"\\n\"\n << \"time spent: \" << diff.count() << \" seconds\" << \"\\n\";\n\n std::cout << \"path = A\" << moether.getBestMoe().getGenotype() + \"A\\n\"\n << \"distance = \" << std::abs(moether.getBestMoe().getFitness() - 1000) << std::endl;\n}<|endoftext|>"} {"text":"<commit_before>\/*\n * #%L\n * %%\n * Copyright (C) 2011 - 2017 BMW Car IT GmbH\n * %%\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n * \n * http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n * \n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * #L%\n *\/\n\n#include \"LocalDomainAccessStore.h\"\n\n#include <algorithm>\n#include <iterator>\n\n#include \"AceValidator.h\"\n#include \"joynr\/Util.h\"\n\nnamespace joynr\n{\nusing namespace infrastructure::DacTypes;\n\nINIT_LOGGER(LocalDomainAccessStore);\n\nLocalDomainAccessStore::LocalDomainAccessStore() : persistenceFileName()\n{\n}\n\nLocalDomainAccessStore::LocalDomainAccessStore(std::string fileName)\n : persistenceFileName(std::move(fileName))\n{\n try {\n joynr::serializer::deserializeFromJson(\n *this, joynr::util::loadStringFromFile(persistenceFileName));\n } catch (const std::runtime_error& ex) {\n JOYNR_LOG_ERROR(logger, ex.what());\n } catch (const std::invalid_argument& ex) {\n JOYNR_LOG_ERROR(logger,\n \"Could not deserialize persisted access control entries from {}: {}\",\n persistenceFileName,\n ex.what());\n }\n}\n\nstd::set<std::pair<std::string, std::string>> LocalDomainAccessStore::\n getUniqueDomainInterfaceCombinations() const\n{\n std::set<std::pair<std::string, std::string>> result;\n\n auto insertInResult = [&result](const auto& entry) {\n result.insert(std::make_pair(entry.getDomain(), entry.getInterfaceName()));\n };\n\n for (const auto& masterACE : masterTable) {\n insertInResult(masterACE);\n }\n\n for (const auto& mediatorACE : mediatorTable) {\n insertInResult(mediatorACE);\n }\n\n for (const auto& ownerACE : ownerTable) {\n insertInResult(ownerACE);\n }\n\n return result;\n}\n\nstd::vector<DomainRoleEntry> LocalDomainAccessStore::getDomainRoles(const std::string& userId)\n{\n JOYNR_LOG_TRACE(logger, \"execute: entering getDomainRoleEntries with userId {}\", userId);\n\n std::vector<DomainRoleEntry> domainRoles;\n boost::optional<DomainRoleEntry> masterDre = getDomainRole(userId, Role::MASTER);\n if (masterDre) {\n \/\/ add dre to resultset only if it defines role for some domain\n domainRoles.push_back(*masterDre);\n }\n\n boost::optional<DomainRoleEntry> ownerDre = getDomainRole(userId, Role::OWNER);\n if (ownerDre) {\n \/\/ add dre to resultset only if it defines role for some domain\n domainRoles.push_back(*ownerDre);\n }\n\n return domainRoles;\n}\n\nboost::optional<DomainRoleEntry> LocalDomainAccessStore::getDomainRole(const std::string& uid,\n Role::Enum role)\n{\n return lookupOptional(domainRoleTable, uid, role);\n}\n\nbool LocalDomainAccessStore::updateDomainRole(const DomainRoleEntry& updatedEntry)\n{\n JOYNR_LOG_TRACE(\n logger, \"execute: entering updateDomainRoleEntry with uId {}\", updatedEntry.getUid());\n\n return insertOrReplace(domainRoleTable, updatedEntry);\n}\n\nbool LocalDomainAccessStore::removeDomainRole(const std::string& userId, Role::Enum role)\n{\n JOYNR_LOG_TRACE(logger, \"execute: entering removeDomainRoleEntry with uId {}\", userId);\n return removeFromTable(domainRoleTable, userId, role);\n}\n\nstd::vector<MasterAccessControlEntry> LocalDomainAccessStore::getMasterAccessControlEntries(\n const std::string& uid) const\n{\n return getEqualRangeWithUidWildcard(masterTable, uid);\n}\n\nstd::vector<MasterAccessControlEntry> LocalDomainAccessStore::getMasterAccessControlEntries(\n const std::string& domain,\n const std::string& interfaceName) const\n{\n return getEqualRange(\n masterTable.get<access_control::tags::DomainAndInterface>(), domain, interfaceName);\n}\n\nstd::vector<MasterAccessControlEntry> LocalDomainAccessStore::getMasterAccessControlEntries(\n const std::string& uid,\n const std::string& domain,\n const std::string& interfaceName)\n{\n return getEqualRangeWithUidWildcard(masterTable, uid, domain, interfaceName);\n}\n\nstd::vector<MasterAccessControlEntry> LocalDomainAccessStore::getEditableMasterAccessControlEntries(\n const std::string& userId)\n{\n JOYNR_LOG_TRACE(\n logger, \"execute: entering getEditableMasterAccessControlEntry with uId {}\", userId);\n\n return getEditableAccessControlEntries(masterTable, userId, Role::MASTER);\n}\n\nboost::optional<MasterAccessControlEntry> LocalDomainAccessStore::getMasterAccessControlEntry(\n const std::string& uid,\n const std::string& domain,\n const std::string& interfaceName,\n const std::string& operation)\n{\n return lookupOptionalWithWildcard(masterTable, uid, domain, interfaceName, operation);\n}\n\nbool LocalDomainAccessStore::updateMasterAccessControlEntry(\n const MasterAccessControlEntry& updatedMasterAce)\n{\n JOYNR_LOG_TRACE(\n logger, \"execute: entering updateMasterAce with uId {}\", updatedMasterAce.getUid());\n\n return insertOrReplace(masterTable, updatedMasterAce);\n}\n\nbool LocalDomainAccessStore::removeMasterAccessControlEntry(const std::string& userId,\n const std::string& domain,\n const std::string& interfaceName,\n const std::string& operation)\n{\n return removeFromTable(masterTable, userId, domain, interfaceName, operation);\n}\n\nstd::vector<MasterAccessControlEntry> LocalDomainAccessStore::getMediatorAccessControlEntries(\n const std::string& uid)\n{\n return getEqualRangeWithUidWildcard(mediatorTable, uid);\n}\n\nstd::vector<MasterAccessControlEntry> LocalDomainAccessStore::getMediatorAccessControlEntries(\n const std::string& domain,\n const std::string& interfaceName)\n{\n return getEqualRange(\n mediatorTable.get<access_control::tags::DomainAndInterface>(), domain, interfaceName);\n}\n\nstd::vector<MasterAccessControlEntry> LocalDomainAccessStore::getMediatorAccessControlEntries(\n const std::string& uid,\n const std::string& domain,\n const std::string& interfaceName)\n{\n return getEqualRangeWithUidWildcard(mediatorTable, uid, domain, interfaceName);\n}\n\nstd::vector<MasterAccessControlEntry> LocalDomainAccessStore::\n getEditableMediatorAccessControlEntries(const std::string& userId)\n{\n JOYNR_LOG_TRACE(logger, \"execute: entering getEditableMediatorAces with uId {}\", userId);\n\n \/\/ Get all the Mediator ACEs for the domains where the user is master\n return getEditableAccessControlEntries(mediatorTable, userId, Role::MASTER);\n}\n\nboost::optional<MasterAccessControlEntry> LocalDomainAccessStore::getMediatorAccessControlEntry(\n const std::string& uid,\n const std::string& domain,\n const std::string& interfaceName,\n const std::string& operation)\n{\n return lookupOptionalWithWildcard(mediatorTable, uid, domain, interfaceName, operation);\n}\n\nbool LocalDomainAccessStore::updateMediatorAccessControlEntry(\n const MasterAccessControlEntry& updatedMediatorAce)\n{\n JOYNR_LOG_TRACE(\n logger, \"execute: entering updateMediatorAce with uId {}\", updatedMediatorAce.getUid());\n\n bool updateSuccess = false;\n\n boost::optional<MasterAccessControlEntry> masterAceOptional =\n getMasterAccessControlEntry(updatedMediatorAce.getUid(),\n updatedMediatorAce.getDomain(),\n updatedMediatorAce.getInterfaceName(),\n updatedMediatorAce.getOperation());\n AceValidator aceValidator(masterAceOptional,\n boost::optional<MasterAccessControlEntry>(updatedMediatorAce),\n boost::optional<OwnerAccessControlEntry>());\n\n if (aceValidator.isMediatorValid()) {\n \/\/ Add\/update a mediator ACE\n updateSuccess = insertOrReplace(mediatorTable, updatedMediatorAce);\n }\n\n return updateSuccess;\n}\n\nbool LocalDomainAccessStore::removeMediatorAccessControlEntry(const std::string& userId,\n const std::string& domain,\n const std::string& interfaceName,\n const std::string& operation)\n{\n JOYNR_LOG_TRACE(logger,\n \"execute: entering removeMediatorAce with userId: {}, domain: {}, \"\n \"interfaceName: {}, operation: {}\",\n userId,\n domain,\n interfaceName,\n operation);\n return removeFromTable(mediatorTable, userId, domain, interfaceName, operation);\n}\n\nstd::vector<OwnerAccessControlEntry> LocalDomainAccessStore::getOwnerAccessControlEntries(\n const std::string& uid)\n{\n return getEqualRangeWithUidWildcard(ownerTable, uid);\n}\n\nstd::vector<OwnerAccessControlEntry> LocalDomainAccessStore::getOwnerAccessControlEntries(\n const std::string& domain,\n const std::string& interfaceName)\n{\n return getEqualRange(\n ownerTable.get<access_control::tags::DomainAndInterface>(), domain, interfaceName);\n}\n\nstd::vector<OwnerAccessControlEntry> LocalDomainAccessStore::getOwnerAccessControlEntries(\n const std::string& userId,\n const std::string& domain,\n const std::string& interfaceName)\n{\n return getEqualRangeWithUidWildcard(ownerTable, userId, domain, interfaceName);\n}\n\nstd::vector<OwnerAccessControlEntry> LocalDomainAccessStore::getEditableOwnerAccessControlEntries(\n const std::string& userId)\n{\n JOYNR_LOG_TRACE(logger, \"execute: entering getEditableOwnerAces with uId {}\", userId);\n\n \/\/ Get all the Owner ACEs for the domains owned by the user\n return getEditableAccessControlEntries(ownerTable, userId, Role::OWNER);\n}\n\nboost::optional<OwnerAccessControlEntry> LocalDomainAccessStore::getOwnerAccessControlEntry(\n const std::string& userId,\n const std::string& domain,\n const std::string& interfaceName,\n const std::string& operation)\n{\n return lookupOptionalWithWildcard(ownerTable, userId, domain, interfaceName, operation);\n}\n\nbool LocalDomainAccessStore::updateOwnerAccessControlEntry(\n const OwnerAccessControlEntry& updatedOwnerAce)\n{\n JOYNR_LOG_TRACE(\n logger, \"execute: entering updateOwnerAce with uId {}\", updatedOwnerAce.getUid());\n\n bool updateSuccess = false;\n\n boost::optional<MasterAccessControlEntry> masterAceOptional =\n getMasterAccessControlEntry(updatedOwnerAce.getUid(),\n updatedOwnerAce.getDomain(),\n updatedOwnerAce.getInterfaceName(),\n updatedOwnerAce.getOperation());\n boost::optional<MasterAccessControlEntry> mediatorAceOptional =\n getMediatorAccessControlEntry(updatedOwnerAce.getUid(),\n updatedOwnerAce.getDomain(),\n updatedOwnerAce.getInterfaceName(),\n updatedOwnerAce.getOperation());\n AceValidator aceValidator(masterAceOptional,\n mediatorAceOptional,\n boost::optional<OwnerAccessControlEntry>(updatedOwnerAce));\n\n if (aceValidator.isOwnerValid()) {\n updateSuccess = insertOrReplace(ownerTable, updatedOwnerAce);\n }\n return updateSuccess;\n}\n\nbool LocalDomainAccessStore::removeOwnerAccessControlEntry(const std::string& userId,\n const std::string& domain,\n const std::string& interfaceName,\n const std::string& operation)\n{\n JOYNR_LOG_TRACE(logger,\n \"execute: entering removeOwnerAce with userId: {}, domain: {}, interface: {}, \"\n \"operation: {}\",\n userId,\n domain,\n interfaceName,\n operation);\n\n return removeFromTable(ownerTable, userId, domain, interfaceName, operation);\n}\n\nbool LocalDomainAccessStore::onlyWildcardOperations(const std::string& userId,\n const std::string& domain,\n const std::string& interfaceName)\n{\n return checkOnlyWildcardOperations(masterTable, userId, domain, interfaceName) &&\n checkOnlyWildcardOperations(mediatorTable, userId, domain, interfaceName) &&\n checkOnlyWildcardOperations(ownerTable, userId, domain, interfaceName);\n}\n\nvoid LocalDomainAccessStore::persistToFile() const\n{\n if (persistenceFileName.empty()) {\n return;\n }\n try {\n joynr::util::saveStringToFile(\n persistenceFileName, joynr::serializer::serializeToJson(*this));\n } catch (const std::invalid_argument& ex) {\n JOYNR_LOG_ERROR(logger, \"serializing to JSON failed: {}\", ex.what());\n } catch (const std::runtime_error& ex) {\n JOYNR_LOG_ERROR(logger, ex.what());\n }\n}\n\n} \/\/ namespace joynr\n<commit_msg>[C++] Check for empty string in constructor of LocalDomainAccessStore.<commit_after>\/*\n * #%L\n * %%\n * Copyright (C) 2011 - 2017 BMW Car IT GmbH\n * %%\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n * \n * http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n * \n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * #L%\n *\/\n\n#include \"LocalDomainAccessStore.h\"\n\n#include <algorithm>\n#include <iterator>\n\n#include \"AceValidator.h\"\n#include \"joynr\/Util.h\"\n\nnamespace joynr\n{\nusing namespace infrastructure::DacTypes;\n\nINIT_LOGGER(LocalDomainAccessStore);\n\nLocalDomainAccessStore::LocalDomainAccessStore() : persistenceFileName()\n{\n}\n\nLocalDomainAccessStore::LocalDomainAccessStore(std::string fileName)\n{\n if (fileName.empty()) {\n return;\n }\n\n persistenceFileName = std::move(fileName);\n\n try {\n joynr::serializer::deserializeFromJson(\n *this, joynr::util::loadStringFromFile(persistenceFileName));\n } catch (const std::runtime_error& ex) {\n JOYNR_LOG_ERROR(logger, ex.what());\n } catch (const std::invalid_argument& ex) {\n JOYNR_LOG_ERROR(logger,\n \"Could not deserialize persisted access control entries from {}: {}\",\n persistenceFileName,\n ex.what());\n }\n}\n\nstd::set<std::pair<std::string, std::string>> LocalDomainAccessStore::\n getUniqueDomainInterfaceCombinations() const\n{\n std::set<std::pair<std::string, std::string>> result;\n\n auto insertInResult = [&result](const auto& entry) {\n result.insert(std::make_pair(entry.getDomain(), entry.getInterfaceName()));\n };\n\n for (const auto& masterACE : masterTable) {\n insertInResult(masterACE);\n }\n\n for (const auto& mediatorACE : mediatorTable) {\n insertInResult(mediatorACE);\n }\n\n for (const auto& ownerACE : ownerTable) {\n insertInResult(ownerACE);\n }\n\n return result;\n}\n\nstd::vector<DomainRoleEntry> LocalDomainAccessStore::getDomainRoles(const std::string& userId)\n{\n JOYNR_LOG_TRACE(logger, \"execute: entering getDomainRoleEntries with userId {}\", userId);\n\n std::vector<DomainRoleEntry> domainRoles;\n boost::optional<DomainRoleEntry> masterDre = getDomainRole(userId, Role::MASTER);\n if (masterDre) {\n \/\/ add dre to resultset only if it defines role for some domain\n domainRoles.push_back(*masterDre);\n }\n\n boost::optional<DomainRoleEntry> ownerDre = getDomainRole(userId, Role::OWNER);\n if (ownerDre) {\n \/\/ add dre to resultset only if it defines role for some domain\n domainRoles.push_back(*ownerDre);\n }\n\n return domainRoles;\n}\n\nboost::optional<DomainRoleEntry> LocalDomainAccessStore::getDomainRole(const std::string& uid,\n Role::Enum role)\n{\n return lookupOptional(domainRoleTable, uid, role);\n}\n\nbool LocalDomainAccessStore::updateDomainRole(const DomainRoleEntry& updatedEntry)\n{\n JOYNR_LOG_TRACE(\n logger, \"execute: entering updateDomainRoleEntry with uId {}\", updatedEntry.getUid());\n\n return insertOrReplace(domainRoleTable, updatedEntry);\n}\n\nbool LocalDomainAccessStore::removeDomainRole(const std::string& userId, Role::Enum role)\n{\n JOYNR_LOG_TRACE(logger, \"execute: entering removeDomainRoleEntry with uId {}\", userId);\n return removeFromTable(domainRoleTable, userId, role);\n}\n\nstd::vector<MasterAccessControlEntry> LocalDomainAccessStore::getMasterAccessControlEntries(\n const std::string& uid) const\n{\n return getEqualRangeWithUidWildcard(masterTable, uid);\n}\n\nstd::vector<MasterAccessControlEntry> LocalDomainAccessStore::getMasterAccessControlEntries(\n const std::string& domain,\n const std::string& interfaceName) const\n{\n return getEqualRange(\n masterTable.get<access_control::tags::DomainAndInterface>(), domain, interfaceName);\n}\n\nstd::vector<MasterAccessControlEntry> LocalDomainAccessStore::getMasterAccessControlEntries(\n const std::string& uid,\n const std::string& domain,\n const std::string& interfaceName)\n{\n return getEqualRangeWithUidWildcard(masterTable, uid, domain, interfaceName);\n}\n\nstd::vector<MasterAccessControlEntry> LocalDomainAccessStore::getEditableMasterAccessControlEntries(\n const std::string& userId)\n{\n JOYNR_LOG_TRACE(\n logger, \"execute: entering getEditableMasterAccessControlEntry with uId {}\", userId);\n\n return getEditableAccessControlEntries(masterTable, userId, Role::MASTER);\n}\n\nboost::optional<MasterAccessControlEntry> LocalDomainAccessStore::getMasterAccessControlEntry(\n const std::string& uid,\n const std::string& domain,\n const std::string& interfaceName,\n const std::string& operation)\n{\n return lookupOptionalWithWildcard(masterTable, uid, domain, interfaceName, operation);\n}\n\nbool LocalDomainAccessStore::updateMasterAccessControlEntry(\n const MasterAccessControlEntry& updatedMasterAce)\n{\n JOYNR_LOG_TRACE(\n logger, \"execute: entering updateMasterAce with uId {}\", updatedMasterAce.getUid());\n\n return insertOrReplace(masterTable, updatedMasterAce);\n}\n\nbool LocalDomainAccessStore::removeMasterAccessControlEntry(const std::string& userId,\n const std::string& domain,\n const std::string& interfaceName,\n const std::string& operation)\n{\n return removeFromTable(masterTable, userId, domain, interfaceName, operation);\n}\n\nstd::vector<MasterAccessControlEntry> LocalDomainAccessStore::getMediatorAccessControlEntries(\n const std::string& uid)\n{\n return getEqualRangeWithUidWildcard(mediatorTable, uid);\n}\n\nstd::vector<MasterAccessControlEntry> LocalDomainAccessStore::getMediatorAccessControlEntries(\n const std::string& domain,\n const std::string& interfaceName)\n{\n return getEqualRange(\n mediatorTable.get<access_control::tags::DomainAndInterface>(), domain, interfaceName);\n}\n\nstd::vector<MasterAccessControlEntry> LocalDomainAccessStore::getMediatorAccessControlEntries(\n const std::string& uid,\n const std::string& domain,\n const std::string& interfaceName)\n{\n return getEqualRangeWithUidWildcard(mediatorTable, uid, domain, interfaceName);\n}\n\nstd::vector<MasterAccessControlEntry> LocalDomainAccessStore::\n getEditableMediatorAccessControlEntries(const std::string& userId)\n{\n JOYNR_LOG_TRACE(logger, \"execute: entering getEditableMediatorAces with uId {}\", userId);\n\n \/\/ Get all the Mediator ACEs for the domains where the user is master\n return getEditableAccessControlEntries(mediatorTable, userId, Role::MASTER);\n}\n\nboost::optional<MasterAccessControlEntry> LocalDomainAccessStore::getMediatorAccessControlEntry(\n const std::string& uid,\n const std::string& domain,\n const std::string& interfaceName,\n const std::string& operation)\n{\n return lookupOptionalWithWildcard(mediatorTable, uid, domain, interfaceName, operation);\n}\n\nbool LocalDomainAccessStore::updateMediatorAccessControlEntry(\n const MasterAccessControlEntry& updatedMediatorAce)\n{\n JOYNR_LOG_TRACE(\n logger, \"execute: entering updateMediatorAce with uId {}\", updatedMediatorAce.getUid());\n\n bool updateSuccess = false;\n\n boost::optional<MasterAccessControlEntry> masterAceOptional =\n getMasterAccessControlEntry(updatedMediatorAce.getUid(),\n updatedMediatorAce.getDomain(),\n updatedMediatorAce.getInterfaceName(),\n updatedMediatorAce.getOperation());\n AceValidator aceValidator(masterAceOptional,\n boost::optional<MasterAccessControlEntry>(updatedMediatorAce),\n boost::optional<OwnerAccessControlEntry>());\n\n if (aceValidator.isMediatorValid()) {\n \/\/ Add\/update a mediator ACE\n updateSuccess = insertOrReplace(mediatorTable, updatedMediatorAce);\n }\n\n return updateSuccess;\n}\n\nbool LocalDomainAccessStore::removeMediatorAccessControlEntry(const std::string& userId,\n const std::string& domain,\n const std::string& interfaceName,\n const std::string& operation)\n{\n JOYNR_LOG_TRACE(logger,\n \"execute: entering removeMediatorAce with userId: {}, domain: {}, \"\n \"interfaceName: {}, operation: {}\",\n userId,\n domain,\n interfaceName,\n operation);\n return removeFromTable(mediatorTable, userId, domain, interfaceName, operation);\n}\n\nstd::vector<OwnerAccessControlEntry> LocalDomainAccessStore::getOwnerAccessControlEntries(\n const std::string& uid)\n{\n return getEqualRangeWithUidWildcard(ownerTable, uid);\n}\n\nstd::vector<OwnerAccessControlEntry> LocalDomainAccessStore::getOwnerAccessControlEntries(\n const std::string& domain,\n const std::string& interfaceName)\n{\n return getEqualRange(\n ownerTable.get<access_control::tags::DomainAndInterface>(), domain, interfaceName);\n}\n\nstd::vector<OwnerAccessControlEntry> LocalDomainAccessStore::getOwnerAccessControlEntries(\n const std::string& userId,\n const std::string& domain,\n const std::string& interfaceName)\n{\n return getEqualRangeWithUidWildcard(ownerTable, userId, domain, interfaceName);\n}\n\nstd::vector<OwnerAccessControlEntry> LocalDomainAccessStore::getEditableOwnerAccessControlEntries(\n const std::string& userId)\n{\n JOYNR_LOG_TRACE(logger, \"execute: entering getEditableOwnerAces with uId {}\", userId);\n\n \/\/ Get all the Owner ACEs for the domains owned by the user\n return getEditableAccessControlEntries(ownerTable, userId, Role::OWNER);\n}\n\nboost::optional<OwnerAccessControlEntry> LocalDomainAccessStore::getOwnerAccessControlEntry(\n const std::string& userId,\n const std::string& domain,\n const std::string& interfaceName,\n const std::string& operation)\n{\n return lookupOptionalWithWildcard(ownerTable, userId, domain, interfaceName, operation);\n}\n\nbool LocalDomainAccessStore::updateOwnerAccessControlEntry(\n const OwnerAccessControlEntry& updatedOwnerAce)\n{\n JOYNR_LOG_TRACE(\n logger, \"execute: entering updateOwnerAce with uId {}\", updatedOwnerAce.getUid());\n\n bool updateSuccess = false;\n\n boost::optional<MasterAccessControlEntry> masterAceOptional =\n getMasterAccessControlEntry(updatedOwnerAce.getUid(),\n updatedOwnerAce.getDomain(),\n updatedOwnerAce.getInterfaceName(),\n updatedOwnerAce.getOperation());\n boost::optional<MasterAccessControlEntry> mediatorAceOptional =\n getMediatorAccessControlEntry(updatedOwnerAce.getUid(),\n updatedOwnerAce.getDomain(),\n updatedOwnerAce.getInterfaceName(),\n updatedOwnerAce.getOperation());\n AceValidator aceValidator(masterAceOptional,\n mediatorAceOptional,\n boost::optional<OwnerAccessControlEntry>(updatedOwnerAce));\n\n if (aceValidator.isOwnerValid()) {\n updateSuccess = insertOrReplace(ownerTable, updatedOwnerAce);\n }\n return updateSuccess;\n}\n\nbool LocalDomainAccessStore::removeOwnerAccessControlEntry(const std::string& userId,\n const std::string& domain,\n const std::string& interfaceName,\n const std::string& operation)\n{\n JOYNR_LOG_TRACE(logger,\n \"execute: entering removeOwnerAce with userId: {}, domain: {}, interface: {}, \"\n \"operation: {}\",\n userId,\n domain,\n interfaceName,\n operation);\n\n return removeFromTable(ownerTable, userId, domain, interfaceName, operation);\n}\n\nbool LocalDomainAccessStore::onlyWildcardOperations(const std::string& userId,\n const std::string& domain,\n const std::string& interfaceName)\n{\n return checkOnlyWildcardOperations(masterTable, userId, domain, interfaceName) &&\n checkOnlyWildcardOperations(mediatorTable, userId, domain, interfaceName) &&\n checkOnlyWildcardOperations(ownerTable, userId, domain, interfaceName);\n}\n\nvoid LocalDomainAccessStore::persistToFile() const\n{\n if (persistenceFileName.empty()) {\n return;\n }\n try {\n joynr::util::saveStringToFile(\n persistenceFileName, joynr::serializer::serializeToJson(*this));\n } catch (const std::invalid_argument& ex) {\n JOYNR_LOG_ERROR(logger, \"serializing to JSON failed: {}\", ex.what());\n } catch (const std::runtime_error& ex) {\n JOYNR_LOG_ERROR(logger, ex.what());\n }\n}\n\n} \/\/ namespace joynr\n<|endoftext|>"} {"text":"<commit_before>\/*------------------------------------------------------------------------\n* (The MIT License)\n* \n* Copyright (c) 2008-2011 Rhomobile, Inc.\n* \n* Permission is hereby granted, free of charge, to any person obtaining a copy\n* of this software and associated documentation files (the \"Software\"), to deal\n* in the Software without restriction, including without limitation the rights\n* to use, copy, modify, merge, publish, distribute, sublicense, and\/or sell\n* copies of the Software, and to permit persons to whom the Software is\n* furnished to do so, subject to the following conditions:\n* \n* The above copyright notice and this permission notice shall be included in\n* all copies or substantial portions of the Software.\n* \n* THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\n* IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\n* FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE\n* AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\n* LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,\n* OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN\n* THE SOFTWARE.\n* \n* http:\/\/rhomobile.com\n*------------------------------------------------------------------------*\/\n\n#include \"RhoLogConf.h\"\n#include \"RhoLogCat.h\"\n#include \"RhoLogSink.h\"\n#include \"common\/RhoFile.h\"\n#include \"common\/RhoFilePath.h\"\n#include \"common\/RhoConf.h\"\n#include \"common\/Tokenizer.h\"\n\n#ifndef RHO_NO_RUBY\n#include \"ruby\/ext\/rho\/rhoruby.h\"\n#endif \/\/RHO_NO_RUBY\n\nnamespace rho{\ncommon::CMutex LogSettings::m_FlushLock;\ncommon::CMutex LogSettings::m_CatLock;\n\nLogSettings g_LogSettings;\n\nLogSettings::LogSettings(){ \n m_nMinSeverity = 0; \n m_bLogToOutput = true; \n m_bLogToFile = false;\n m_bLogToSocket = false;\n\n m_nMaxLogFileSize = 0; \n m_bLogPrefix = true; \n\n m_strLogHost = \"PPP_PEER\";\n\n m_pFileSink = new CLogFileSink(*this);\n m_pOutputSink = new CLogOutputSink(*this);\n m_pLogViewSink = NULL;\n\tm_pSocketSink = NULL;\n}\n\nLogSettings::~LogSettings(){\n delete m_pFileSink;\n delete m_pOutputSink;\n delete m_pSocketSink;\n}\n\nvoid LogSettings::setLogPort(const char* szLogPort) \n{\n\tsetLogToSocket(true);\n\n\tm_strLogPort = rho::String(szLogPort); \n\n\tdelete m_pSocketSink;\n m_pSocketSink = new CLogSocketSink(*this);\n}\n\nvoid LogSettings::getLogTextW(StringW& strTextW)\n{\n boolean bOldSaveToFile = isLogToFile();\n setLogToFile(false);\n\n common::CRhoFile oFile;\n if ( oFile.open( getLogFilePath().c_str(), common::CRhoFile::OpenReadOnly) )\n oFile.readStringW(strTextW);\n\n setLogToFile(bOldSaveToFile);\n}\n\nvoid LogSettings::getLogText(String& strText)\n{\n boolean bOldSaveToFile = isLogToFile();\n setLogToFile(false);\n\n common::CRhoFile oFile;\n if ( oFile.open( getLogFilePath().c_str(), common::CRhoFile::OpenReadOnly) )\n oFile.readString(strText);\n\n setLogToFile(bOldSaveToFile);\n}\n\nint LogSettings::getLogTextPos()\n{\n return m_pFileSink ? m_pFileSink->getCurPos() : -1;\n}\n\nvoid LogSettings::saveToFile(){\n RHOCONF().setInt(\"MinSeverity\", getMinSeverity(), true );\n RHOCONF().setBool(\"LogToOutput\", isLogToOutput(), true );\n RHOCONF().setBool(\"LogToFile\", isLogToFile(), true );\n#if !defined(OS_MACOSX)\t\n RHOCONF().setString(\"LogFilePath\", getLogFilePath(), true );\n#endif\n RHOCONF().setInt(\"MaxLogFileSize\", getMaxLogFileSize(), true );\n RHOCONF().setString(\"LogCategories\", getEnabledCategories(), true );\n RHOCONF().setString(\"ExcludeLogCategories\", getDisabledCategories(), true );\n}\n\nvoid LogSettings::loadFromConf(rho::common::RhoSettings& oRhoConf)\n{\n if ( oRhoConf.isExist( \"MinSeverity\" ) )\n setMinSeverity( oRhoConf.getInt(\"MinSeverity\") );\n if ( oRhoConf.isExist( \"LogToOutput\") )\n setLogToOutput( oRhoConf.getBool(\"LogToOutput\") );\n if ( oRhoConf.isExist( \"LogToFile\") )\n setLogToFile( oRhoConf.getBool(\"LogToFile\"));\n if ( oRhoConf.isExist( \"LogFilePath\") )\n setLogFilePath( oRhoConf.getString(\"LogFilePath\").c_str() );\n if ( oRhoConf.isExist( \"MaxLogFileSize\") )\n setMaxLogFileSize( oRhoConf.getInt(\"MaxLogFileSize\") );\n if ( oRhoConf.isExist( \"LogCategories\") )\n setEnabledCategories( oRhoConf.getString(\"LogCategories\").c_str() );\n if (oRhoConf.isExist( \"ExcludeLogCategories\") )\n setDisabledCategories( oRhoConf.getString(\"ExcludeLogCategories\").c_str() );\n\tif ( oRhoConf.isExist( \"LogToSocket\") )\n\t\tsetLogToSocket( oRhoConf.getBool(\"LogToSocket\") );\n\tif ( oRhoConf.isExist( \"log_exclude_filter\") )\n setExcludeFilter( oRhoConf.getString(\"log_exclude_filter\") );\n}\n\nvoid LogSettings::setLogFilePath(const char* szLogFilePath){ \n if ( m_strLogFilePath.compare(szLogFilePath) != 0 ){\n common::CMutexLock oLock(m_FlushLock);\n\n m_strLogFilePath = szLogFilePath; \n\n if ( m_pFileSink ){\n delete m_pFileSink;\n m_pFileSink = new CLogFileSink(*this);\n }\n }\n}\n\nvoid LogSettings::clearLog(){\n common::CMutexLock oLock(m_FlushLock);\n\n if ( m_pFileSink ){\n m_pFileSink->clear();\n }\n\n}\n\nvoid LogSettings::sinkLogMessage( String& strMsg ){\n common::CMutexLock oLock(m_FlushLock);\n\n if ( isLogToFile() )\n m_pFileSink->writeLogMessage(strMsg);\n\n if (m_pLogViewSink)\n m_pLogViewSink->writeLogMessage(strMsg);\n\n \/\/Should be at the end\n if ( isLogToOutput() )\n m_pOutputSink->writeLogMessage(strMsg);\n\n if ( isLogToSocket() )\n m_pSocketSink->writeLogMessage(strMsg);\n}\n\nbool LogSettings::isCategoryEnabled(const LogCategory& cat)const{\n \/\/TODO: Optimize categories search : add map\n common::CMutexLock oLock(m_CatLock);\n\n if ( m_strDisabledCategories.length() > 0 && strstr(m_strDisabledCategories.c_str(), cat.getName().c_str() ) != 0 )\n return false;\n\n if ( m_strEnabledCategories.length() == 0 )\n return false;\n\n return strcmp(m_strEnabledCategories.c_str(),\"*\") == 0 || strstr(m_strEnabledCategories.c_str(), cat.getName().c_str() ) != 0;\n}\n\nvoid LogSettings::setEnabledCategories( const char* szCatList ){\n common::CMutexLock oLock(m_CatLock);\n\n if ( szCatList && *szCatList )\n \tm_strEnabledCategories = szCatList;\n else\n \tm_strEnabledCategories = \"\";\n}\n\nvoid LogSettings::setDisabledCategories( const char* szCatList ){\n common::CMutexLock oLock(m_CatLock);\n\n if ( szCatList && *szCatList )\n \tm_strDisabledCategories = szCatList;\n else\n \tm_strDisabledCategories = \"\";\n}\n\nvoid LogSettings::setExcludeFilter( const String& strExcludeFilter )\n{\n if ( strExcludeFilter.length() > 0 )\n {\n rho::common::CTokenizer oTokenizer( strExcludeFilter, \",\" );\n\t while (oTokenizer.hasMoreTokens()) \n {\n String tok = rho::String_trim(oTokenizer.nextToken());\n\t\t if (tok.length() == 0)\n\t\t\t continue;\n\n \/\/m_arExcludeAttribs.addElement( \"\\\"\" + tok + \"\\\"=>\\\"\" );\n m_arExcludeAttribs.addElement( tok );\n } \t\n }\n else\n \tm_arExcludeAttribs.removeAllElements();\n}\n\n}\n\nextern \"C\" {\nusing namespace rho;\nusing namespace rho::common;\n\n \nvoid rho_logconf_Init(const char* szRootPath, const char* szLogPort){\n\n#ifdef RHODES_EMULATOR\n String strRootPath = szRootPath;\n strRootPath += RHO_EMULATOR_DIR\"\/\";\n rho::common::CFilePath oLogPath( strRootPath );\n#else\n rho::common::CFilePath oLogPath( szRootPath );\n#endif\n\n \/\/Set defaults\n#ifdef RHO_DEBUG\n LOGCONF().setMinSeverity( L_TRACE );\n LOGCONF().setLogToOutput(true);\n LOGCONF().setEnabledCategories(\"*\");\n LOGCONF().setDisabledCategories(\"\");\n#else \/\/!RHO_DEBUG\n LOGCONF().setMinSeverity( L_ERROR );\n LOGCONF().setLogToOutput(false);\n LOGCONF().setEnabledCategories(\"\");\n#endif\/\/!RHO_DEBUG\n\n LOGCONF().setLogPrefix(true);\n\n rho::String logPath = oLogPath.makeFullPath(\"RhoLog.txt\");\n LOGCONF().setLogToFile(true);\n LOGCONF().setLogFilePath( logPath.c_str() );\n LOGCONF().setMaxLogFileSize(1024*50);\n\n rho_conf_Init(szRootPath);\n\n LOGCONF().loadFromConf(RHOCONF());\n if (szLogPort != NULL) {\n LOGCONF().setLogPort(szLogPort);\n }\n else {\n LOGCONF().setLogPort(\"\");\n }\n}\n\nchar* rho_logconf_getText() {\n rho::String strText;\n LOGCONF().getLogText(strText);\n\treturn strdup(strText.c_str());\n}\n\nint rho_logconf_getTextPos() {\n\treturn LOGCONF().getLogTextPos();\n}\n\nchar* rho_logconf_getEnabledCategories() {\n\treturn strdup(LOGCONF().getEnabledCategories().c_str());\n}\n\nchar* rho_logconf_getDisabledCategories() {\n\treturn strdup(LOGCONF().getDisabledCategories().c_str());\n}\n\nint rho_logconf_getSeverity() {\n\treturn LOGCONF().getMinSeverity();\n}\n\nvoid rho_logconf_setEnabledCategories(const char* categories) {\n\tLOGCONF().setEnabledCategories(categories);\n}\n\nvoid rho_logconf_setDisabledCategories(const char* categories) {\n\tLOGCONF().setDisabledCategories(categories);\n}\n\nvoid rho_logconf_setSeverity(int nLevel) {\n\tLOGCONF().setMinSeverity(nLevel);\n}\n\nvoid rho_logconf_saveSettings() {\n\t LOGCONF().saveToFile();\n}\n\nvoid rho_logconf_freeString(char* str) {\n\tfree(str);\n}\n\n\/\/ RhoConf.set_property_by_name\nvoid rho_conf_set_property_by_name(char* name, char* value)\n{\n\tRHOCONF().setString(name, value, true);\n\n LOGCONF().loadFromConf(RHOCONF());\n}\n\nvoid rho_conf_clean_log()\n{\n LOGCONF().clearLog();\n}\n\n#ifndef RHO_NO_RUBY\nVALUE rho_conf_get_property_by_name(char* name)\n{\n\tchar* szValue = rho_conf_getString(name);\n\n return rho_ruby_create_string(szValue);\n}\n\nVALUE rho_conf_get_conflicts()\n{\n CHoldRubyValue hashConflicts(rho_ruby_createHash());\n\n HashtablePtr<String,Vector<String>* >& mapConflicts = RHOCONF().getConflicts();\n for ( HashtablePtr<String,Vector<String>* >::iterator it=mapConflicts.begin() ; it != mapConflicts.end(); it++ ) \n {\n Vector<String>& values = *(it->second);\n CHoldRubyValue arValues(rho_ruby_create_array());\n for( int i = 0; i < (int)values.size(); i++)\n rho_ruby_add_to_array(arValues, rho_ruby_create_string(values.elementAt(i).c_str()) );\n\n addHashToHash(hashConflicts, it->first.c_str(), arValues);\n }\n\n return hashConflicts;\n}\n\nVALUE rho_conf_read_log(int limit)\n{\n VALUE res = rho_ruby_create_string(\"\");\n bool bOldSaveToFile = LOGCONF().isLogToFile();\n LOGCONF().setLogToFile(false);\n\n rho::common::CRhoFile oFile;\n if ( oFile.open( LOGCONF().getLogFilePath().c_str(), rho::common::CRhoFile::OpenReadOnly) )\n {\n int nFileSize = oFile.size();\n int nPos = LOGCONF().getLogTextPos();\n int nMaxSize = nFileSize > nPos ? nFileSize : nPos;\n if ( limit <= 0 || limit > nMaxSize)\n limit = nMaxSize;\n\n res = rho_ruby_create_string_withlen(limit);\n char* szStr = getStringFromValue(res);\n\n if ( limit <= nPos )\n {\n oFile.setPosTo(nPos-limit);\n oFile.readData(szStr,0,limit);\n }else\n {\n oFile.setPosTo(nFileSize-(limit-nPos));\n int nRead = oFile.readData(szStr,0,limit);\n\n oFile.setPosTo(0);\n oFile.readData(szStr,nRead,limit-nRead);\n }\n\n }\n\n LOGCONF().setLogToFile(bOldSaveToFile);\n\n return res;\n}\n#endif \/\/RHO_NO_RUBY\n\n}\n<commit_msg>Memory leak is fixed in RhoLogConf.cpp<commit_after>\/*------------------------------------------------------------------------\n* (The MIT License)\n* \n* Copyright (c) 2008-2011 Rhomobile, Inc.\n* \n* Permission is hereby granted, free of charge, to any person obtaining a copy\n* of this software and associated documentation files (the \"Software\"), to deal\n* in the Software without restriction, including without limitation the rights\n* to use, copy, modify, merge, publish, distribute, sublicense, and\/or sell\n* copies of the Software, and to permit persons to whom the Software is\n* furnished to do so, subject to the following conditions:\n* \n* The above copyright notice and this permission notice shall be included in\n* all copies or substantial portions of the Software.\n* \n* THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\n* IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\n* FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE\n* AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\n* LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,\n* OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN\n* THE SOFTWARE.\n* \n* http:\/\/rhomobile.com\n*------------------------------------------------------------------------*\/\n\n#include \"RhoLogConf.h\"\n#include \"RhoLogCat.h\"\n#include \"RhoLogSink.h\"\n#include \"common\/RhoFile.h\"\n#include \"common\/RhoFilePath.h\"\n#include \"common\/RhoConf.h\"\n#include \"common\/Tokenizer.h\"\n\n#ifndef RHO_NO_RUBY\n#include \"ruby\/ext\/rho\/rhoruby.h\"\n#endif \/\/RHO_NO_RUBY\n\nnamespace rho{\ncommon::CMutex LogSettings::m_FlushLock;\ncommon::CMutex LogSettings::m_CatLock;\n\nLogSettings g_LogSettings;\n\nLogSettings::LogSettings(){ \n m_nMinSeverity = 0; \n m_bLogToOutput = true; \n m_bLogToFile = false;\n m_bLogToSocket = false;\n\n m_nMaxLogFileSize = 0; \n m_bLogPrefix = true; \n\n m_strLogHost = \"PPP_PEER\";\n\n m_pFileSink = new CLogFileSink(*this);\n m_pOutputSink = new CLogOutputSink(*this);\n m_pLogViewSink = NULL;\n\tm_pSocketSink = NULL;\n}\n\nLogSettings::~LogSettings(){\n delete m_pFileSink;\n delete m_pOutputSink;\n delete m_pSocketSink;\n}\n\nvoid LogSettings::setLogPort(const char* szLogPort) \n{\n\tsetLogToSocket(true);\n\n\tm_strLogPort = rho::String(szLogPort); \n\n\tdelete m_pSocketSink;\n m_pSocketSink = new CLogSocketSink(*this);\n}\n\nvoid LogSettings::getLogTextW(StringW& strTextW)\n{\n boolean bOldSaveToFile = isLogToFile();\n setLogToFile(false);\n\n common::CRhoFile oFile;\n if ( oFile.open( getLogFilePath().c_str(), common::CRhoFile::OpenReadOnly) )\n oFile.readStringW(strTextW);\n\n setLogToFile(bOldSaveToFile);\n}\n\nvoid LogSettings::getLogText(String& strText)\n{\n boolean bOldSaveToFile = isLogToFile();\n setLogToFile(false);\n\n common::CRhoFile oFile;\n if ( oFile.open( getLogFilePath().c_str(), common::CRhoFile::OpenReadOnly) )\n oFile.readString(strText);\n\n setLogToFile(bOldSaveToFile);\n}\n\nint LogSettings::getLogTextPos()\n{\n return m_pFileSink ? m_pFileSink->getCurPos() : -1;\n}\n\nvoid LogSettings::saveToFile(){\n RHOCONF().setInt(\"MinSeverity\", getMinSeverity(), true );\n RHOCONF().setBool(\"LogToOutput\", isLogToOutput(), true );\n RHOCONF().setBool(\"LogToFile\", isLogToFile(), true );\n#if !defined(OS_MACOSX)\t\n RHOCONF().setString(\"LogFilePath\", getLogFilePath(), true );\n#endif\n RHOCONF().setInt(\"MaxLogFileSize\", getMaxLogFileSize(), true );\n RHOCONF().setString(\"LogCategories\", getEnabledCategories(), true );\n RHOCONF().setString(\"ExcludeLogCategories\", getDisabledCategories(), true );\n}\n\nvoid LogSettings::loadFromConf(rho::common::RhoSettings& oRhoConf)\n{\n if ( oRhoConf.isExist( \"MinSeverity\" ) )\n setMinSeverity( oRhoConf.getInt(\"MinSeverity\") );\n if ( oRhoConf.isExist( \"LogToOutput\") )\n setLogToOutput( oRhoConf.getBool(\"LogToOutput\") );\n if ( oRhoConf.isExist( \"LogToFile\") )\n setLogToFile( oRhoConf.getBool(\"LogToFile\"));\n if ( oRhoConf.isExist( \"LogFilePath\") )\n setLogFilePath( oRhoConf.getString(\"LogFilePath\").c_str() );\n if ( oRhoConf.isExist( \"MaxLogFileSize\") )\n setMaxLogFileSize( oRhoConf.getInt(\"MaxLogFileSize\") );\n if ( oRhoConf.isExist( \"LogCategories\") )\n setEnabledCategories( oRhoConf.getString(\"LogCategories\").c_str() );\n if (oRhoConf.isExist( \"ExcludeLogCategories\") )\n setDisabledCategories( oRhoConf.getString(\"ExcludeLogCategories\").c_str() );\n\tif ( oRhoConf.isExist( \"LogToSocket\") )\n\t\tsetLogToSocket( oRhoConf.getBool(\"LogToSocket\") );\n\tif ( oRhoConf.isExist( \"log_exclude_filter\") )\n setExcludeFilter( oRhoConf.getString(\"log_exclude_filter\") );\n}\n\nvoid LogSettings::setLogFilePath(const char* szLogFilePath){ \n if ( m_strLogFilePath.compare(szLogFilePath) != 0 ){\n common::CMutexLock oLock(m_FlushLock);\n\n m_strLogFilePath = szLogFilePath; \n\n if ( m_pFileSink ){\n delete m_pFileSink;\n m_pFileSink = new CLogFileSink(*this);\n }\n }\n}\n\nvoid LogSettings::clearLog(){\n common::CMutexLock oLock(m_FlushLock);\n\n if ( m_pFileSink ){\n m_pFileSink->clear();\n }\n\n}\n\nvoid LogSettings::sinkLogMessage( String& strMsg ){\n common::CMutexLock oLock(m_FlushLock);\n\n if ( isLogToFile() )\n m_pFileSink->writeLogMessage(strMsg);\n\n if (m_pLogViewSink)\n m_pLogViewSink->writeLogMessage(strMsg);\n\n \/\/Should be at the end\n if ( isLogToOutput() )\n m_pOutputSink->writeLogMessage(strMsg);\n\n if ( isLogToSocket() )\n m_pSocketSink->writeLogMessage(strMsg);\n}\n\nbool LogSettings::isCategoryEnabled(const LogCategory& cat)const{\n \/\/TODO: Optimize categories search : add map\n common::CMutexLock oLock(m_CatLock);\n\n if ( m_strDisabledCategories.length() > 0 && strstr(m_strDisabledCategories.c_str(), cat.getName().c_str() ) != 0 )\n return false;\n\n if ( m_strEnabledCategories.length() == 0 )\n return false;\n\n return strcmp(m_strEnabledCategories.c_str(),\"*\") == 0 || strstr(m_strEnabledCategories.c_str(), cat.getName().c_str() ) != 0;\n}\n\nvoid LogSettings::setEnabledCategories( const char* szCatList ){\n common::CMutexLock oLock(m_CatLock);\n\n if ( szCatList && *szCatList )\n \tm_strEnabledCategories = szCatList;\n else\n \tm_strEnabledCategories = \"\";\n}\n\nvoid LogSettings::setDisabledCategories( const char* szCatList ){\n common::CMutexLock oLock(m_CatLock);\n\n if ( szCatList && *szCatList )\n \tm_strDisabledCategories = szCatList;\n else\n \tm_strDisabledCategories = \"\";\n}\n\nvoid LogSettings::setExcludeFilter( const String& strExcludeFilter )\n{\n if ( strExcludeFilter.length() > 0 )\n {\n rho::common::CTokenizer oTokenizer( strExcludeFilter, \",\" );\n\t while (oTokenizer.hasMoreTokens()) \n {\n String tok = rho::String_trim(oTokenizer.nextToken());\n\t\t if (tok.length() == 0)\n\t\t\t continue;\n\n \/\/m_arExcludeAttribs.addElement( \"\\\"\" + tok + \"\\\"=>\\\"\" );\n m_arExcludeAttribs.addElement( tok );\n } \t\n }\n else\n \tm_arExcludeAttribs.removeAllElements();\n}\n\n}\n\nextern \"C\" {\nusing namespace rho;\nusing namespace rho::common;\n\n \nvoid rho_logconf_Init(const char* szRootPath, const char* szLogPort){\n\n#ifdef RHODES_EMULATOR\n String strRootPath = szRootPath;\n strRootPath += RHO_EMULATOR_DIR\"\/\";\n rho::common::CFilePath oLogPath( strRootPath );\n#else\n rho::common::CFilePath oLogPath( szRootPath );\n#endif\n\n \/\/Set defaults\n#ifdef RHO_DEBUG\n LOGCONF().setMinSeverity( L_TRACE );\n LOGCONF().setLogToOutput(true);\n LOGCONF().setEnabledCategories(\"*\");\n LOGCONF().setDisabledCategories(\"\");\n#else \/\/!RHO_DEBUG\n LOGCONF().setMinSeverity( L_ERROR );\n LOGCONF().setLogToOutput(false);\n LOGCONF().setEnabledCategories(\"\");\n#endif\/\/!RHO_DEBUG\n\n LOGCONF().setLogPrefix(true);\n\n rho::String logPath = oLogPath.makeFullPath(\"RhoLog.txt\");\n LOGCONF().setLogToFile(true);\n LOGCONF().setLogFilePath( logPath.c_str() );\n LOGCONF().setMaxLogFileSize(1024*50);\n\n rho_conf_Init(szRootPath);\n\n LOGCONF().loadFromConf(RHOCONF());\n if (szLogPort != NULL) {\n LOGCONF().setLogPort(szLogPort);\n }\n else {\n LOGCONF().setLogPort(\"\");\n }\n}\n\nchar* rho_logconf_getText() {\n rho::String strText;\n LOGCONF().getLogText(strText);\n\treturn strdup(strText.c_str());\n}\n\nint rho_logconf_getTextPos() {\n\treturn LOGCONF().getLogTextPos();\n}\n\nchar* rho_logconf_getEnabledCategories() {\n\treturn strdup(LOGCONF().getEnabledCategories().c_str());\n}\n\nchar* rho_logconf_getDisabledCategories() {\n\treturn strdup(LOGCONF().getDisabledCategories().c_str());\n}\n\nint rho_logconf_getSeverity() {\n\treturn LOGCONF().getMinSeverity();\n}\n\nvoid rho_logconf_setEnabledCategories(const char* categories) {\n\tLOGCONF().setEnabledCategories(categories);\n}\n\nvoid rho_logconf_setDisabledCategories(const char* categories) {\n\tLOGCONF().setDisabledCategories(categories);\n}\n\nvoid rho_logconf_setSeverity(int nLevel) {\n\tLOGCONF().setMinSeverity(nLevel);\n}\n\nvoid rho_logconf_saveSettings() {\n\t LOGCONF().saveToFile();\n}\n\nvoid rho_logconf_freeString(char* str) {\n\tfree(str);\n}\n\n\/\/ RhoConf.set_property_by_name\nvoid rho_conf_set_property_by_name(char* name, char* value)\n{\n\tRHOCONF().setString(name, value, true);\n\n LOGCONF().loadFromConf(RHOCONF());\n}\n\nvoid rho_conf_clean_log()\n{\n LOGCONF().clearLog();\n}\n\n#ifndef RHO_NO_RUBY\nVALUE rho_conf_get_property_by_name(char* name)\n{\n return rho_ruby_create_string(RHOCONF().getString(name).c_str());\n}\n\nVALUE rho_conf_get_conflicts()\n{\n CHoldRubyValue hashConflicts(rho_ruby_createHash());\n\n HashtablePtr<String,Vector<String>* >& mapConflicts = RHOCONF().getConflicts();\n for ( HashtablePtr<String,Vector<String>* >::iterator it=mapConflicts.begin() ; it != mapConflicts.end(); it++ ) \n {\n Vector<String>& values = *(it->second);\n CHoldRubyValue arValues(rho_ruby_create_array());\n for( int i = 0; i < (int)values.size(); i++)\n rho_ruby_add_to_array(arValues, rho_ruby_create_string(values.elementAt(i).c_str()) );\n\n addHashToHash(hashConflicts, it->first.c_str(), arValues);\n }\n\n return hashConflicts;\n}\n\nVALUE rho_conf_read_log(int limit)\n{\n VALUE res = rho_ruby_create_string(\"\");\n bool bOldSaveToFile = LOGCONF().isLogToFile();\n LOGCONF().setLogToFile(false);\n\n rho::common::CRhoFile oFile;\n if ( oFile.open( LOGCONF().getLogFilePath().c_str(), rho::common::CRhoFile::OpenReadOnly) )\n {\n int nFileSize = oFile.size();\n int nPos = LOGCONF().getLogTextPos();\n int nMaxSize = nFileSize > nPos ? nFileSize : nPos;\n if ( limit <= 0 || limit > nMaxSize)\n limit = nMaxSize;\n\n res = rho_ruby_create_string_withlen(limit);\n char* szStr = getStringFromValue(res);\n\n if ( limit <= nPos )\n {\n oFile.setPosTo(nPos-limit);\n oFile.readData(szStr,0,limit);\n }else\n {\n oFile.setPosTo(nFileSize-(limit-nPos));\n int nRead = oFile.readData(szStr,0,limit);\n\n oFile.setPosTo(0);\n oFile.readData(szStr,nRead,limit-nRead);\n }\n\n }\n\n LOGCONF().setLogToFile(bOldSaveToFile);\n\n return res;\n}\n#endif \/\/RHO_NO_RUBY\n\n}\n<|endoftext|>"} {"text":"<commit_before>\/******************************************************************************\n * This file is part of the Gluon Development Platform\n * Copyright (C) 2010 Shantanu Tushar <jhahoneyk@gmail.com>\n *\n * This library is free software; you can redistribute it and\/or\n * modify it under the terms of the GNU Lesser General Public\n * License as published by the Free Software Foundation; either\n * version 2.1 of the License, or (at your option) any later version.\n *\n * This library is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU\n * Lesser General Public License for more details.\n *\n * You should have received a copy of the GNU Lesser General Public\n * License along with this library; if not, write to the Free Software\n * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA\n *\/\n\n#include \"commentsview.h\"\n#include \"commentsviewitem.h\"\n#include \"newcommentform.h\"\n\n#include <lib\/models\/commentsmodel.h>\n\n#include <KDE\/Plasma\/ItemBackground>\n#include <KDE\/Plasma\/LineEdit>\n#include <KDE\/Plasma\/Frame>\n#include <KDE\/Plasma\/ScrollWidget>\n\n#include <QtGui\/QTreeView>\n#include <QtGui\/QGraphicsLinearLayout>\n#include <QtGui\/QGraphicsProxyWidget>\n\nCommentsView::CommentsView( QGraphicsItem* parent, Qt::WindowFlags wFlags )\n : AbstractItemView( parent, wFlags )\n , m_itemBackground( new Plasma::ItemBackground( this ) )\n , m_rootWidget( 0 )\n , m_commentsFrame( new Plasma::Frame( this ) )\n , m_commentsLayout( new QGraphicsLinearLayout( Qt::Vertical, m_commentsFrame ) )\n , m_isOnline( false )\n{\n m_commentsFrame->setLayout( m_commentsLayout );\n m_contentLayout->addItem( m_commentsFrame );\n}\n\nvoid CommentsView::setModel( QAbstractItemModel* model )\n{\n AbstractItemView::setModel( model );\n connect( model, SIGNAL( modelReset() ), SLOT( reloadComments() ) );\n\n m_rootWidget = new QGraphicsWidget( m_commentsFrame );\n for( int i = 0; i < m_model->rowCount(); ++i )\n {\n \/\/ addComment( m_model->index( i, 0 ), m_rootWidget, 0 );\n }\n}\n\nCommentsViewItem* CommentsView::addComment( const QModelIndex& index, QGraphicsWidget* parent, int depth )\n{\n CommentsViewItem* item = new CommentsViewItem( parent );\n item->setReplyEnabled( qobject_cast<GluonPlayer::CommentsModel*>( m_model )->isOnline() );\n item->setParent( parent );\n item->setDepth( depth );\n item->setModelIndex( index );\n item->setAcceptHoverEvents( true );\n item->installEventFilter( this );\n connect( item, SIGNAL( replyClicked() ), SLOT( showReply() ) );\n item->setRowInLayout( m_commentsLayout->count() );\n m_commentsLayout->addItem( item );\n\n if( m_model->hasChildren( index ) ) \/\/There are one or more children\n {\n for( int i = 0; i < m_model->rowCount( index ); ++i )\n {\n addComment( index.child( i, 0 ), item, depth + 1 );\n }\n }\n\n return item;\n}\n\nbool CommentsView::eventFilter( QObject* obj, QEvent* event )\n{\n if( event->type() == QEvent::GraphicsSceneHoverEnter )\n {\n QGraphicsItem* item = qobject_cast<QGraphicsItem*> ( obj );\n m_itemBackground->setTargetItem( item );\n }\n\n return QObject::eventFilter( obj, event );\n}\n\nvoid CommentsView::showReply()\n{\n CommentsViewItem* parentItem = qobject_cast<CommentsViewItem*>( sender() );\n\n hideComments();\n NewCommentForm* form = new NewCommentForm( this );\n m_contentLayout->addItem( form );\n form->setParentIndex( parentItem->modelIndex() );\n\n connect( form, SIGNAL( accepted( QModelIndex, QString, QString ) ),\n SLOT( addNewUserComment( QModelIndex, QString, QString ) ) );\n connect( form, SIGNAL( canceled() ), SLOT( cancelNewComment() ) );\n}\n\nvoid CommentsView::removeComments()\n{\n CommentsViewItem* toDelete;\n \/\/TODO: Make the comments view paged\n while( m_commentsLayout->count() > 0 ) \/\/Remove existing comments from GUI\n {\n toDelete = dynamic_cast<CommentsViewItem*>( m_commentsLayout->itemAt( 0 ) );\n m_commentsLayout->removeAt( 0 );\n toDelete->deleteLater();\n }\n}\n\nvoid CommentsView::loadComments()\n{\n for( int i = 0; i < m_model->rowCount(); ++i ) \/\/Reload comments\n {\n addComment( m_model->index( i, 0 ), m_rootWidget, 0 );\n }\n}\n\nvoid CommentsView::reloadComments()\n{\n hideComments();\n removeComments();\n loadComments();\n showComments();\n}\n\nvoid CommentsView::addNewUserComment( QModelIndex parentIndex, QString title, QString body )\n{\n GluonPlayer::CommentsModel* model = static_cast<GluonPlayer::CommentsModel*>( m_model );\n model->uploadComment( parentIndex, title, body );\n connect( model, SIGNAL( addCommentFailed() ), SLOT( showComments() ) );\n sender()->deleteLater();\n}\n\nvoid CommentsView::cancelNewComment()\n{\n sender()->deleteLater();\n showComments();\n}\n\nvoid CommentsView::hideComments()\n{\n m_commentsFrame->hide();\n m_contentLayout->removeItem( m_commentsFrame );\n}\n\nvoid CommentsView::showComments()\n{\n m_contentLayout->addItem( m_commentsFrame );\n m_commentsFrame->show();\n}\n<commit_msg>Fix the reply form size. Fix Plasm::ItemBackgroud annoyances.<commit_after>\/******************************************************************************\n * This file is part of the Gluon Development Platform\n * Copyright (C) 2010 Shantanu Tushar <jhahoneyk@gmail.com>\n *\n * This library is free software; you can redistribute it and\/or\n * modify it under the terms of the GNU Lesser General Public\n * License as published by the Free Software Foundation; either\n * version 2.1 of the License, or (at your option) any later version.\n *\n * This library is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU\n * Lesser General Public License for more details.\n *\n * You should have received a copy of the GNU Lesser General Public\n * License along with this library; if not, write to the Free Software\n * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA\n *\/\n\n#include \"commentsview.h\"\n#include \"commentsviewitem.h\"\n#include \"newcommentform.h\"\n\n#include <lib\/models\/commentsmodel.h>\n\n#include <KDE\/Plasma\/ItemBackground>\n#include <KDE\/Plasma\/LineEdit>\n#include <KDE\/Plasma\/Frame>\n\n#include <QtGui\/QTreeView>\n#include <QtGui\/QGraphicsLinearLayout>\n#include <QtGui\/QGraphicsProxyWidget>\n\nCommentsView::CommentsView( QGraphicsItem* parent, Qt::WindowFlags wFlags )\n : AbstractItemView( parent, wFlags )\n , m_itemBackground( new Plasma::ItemBackground( this ) )\n , m_rootWidget( 0 )\n , m_commentsFrame( new Plasma::Frame( this ) )\n , m_commentsLayout( new QGraphicsLinearLayout( Qt::Vertical, m_commentsFrame ) )\n , m_isOnline( false )\n{\n m_commentsFrame->setLayout( m_commentsLayout );\n m_contentLayout->addItem( m_commentsFrame );\n}\n\nvoid CommentsView::setModel( QAbstractItemModel* model )\n{\n AbstractItemView::setModel( model );\n connect( model, SIGNAL( modelReset() ), SLOT( reloadComments() ) );\n\n m_rootWidget = new QGraphicsWidget( m_commentsFrame );\n for( int i = 0; i < m_model->rowCount(); ++i )\n {\n \/\/ addComment( m_model->index( i, 0 ), m_rootWidget, 0 );\n }\n}\n\nCommentsViewItem* CommentsView::addComment( const QModelIndex& index, QGraphicsWidget* parent, int depth )\n{\n CommentsViewItem* item = new CommentsViewItem( parent );\n item->setReplyEnabled( qobject_cast<GluonPlayer::CommentsModel*>( m_model )->isOnline() );\n item->setParent( parent );\n item->setDepth( depth );\n item->setModelIndex( index );\n item->setAcceptHoverEvents( true );\n item->installEventFilter( this );\n connect( item, SIGNAL( replyClicked() ), SLOT( showReply() ) );\n item->setRowInLayout( m_commentsLayout->count() );\n m_commentsLayout->addItem( item );\n\n if( m_model->hasChildren( index ) ) \/\/There are one or more children\n {\n for( int i = 0; i < m_model->rowCount( index ); ++i )\n {\n addComment( index.child( i, 0 ), item, depth + 1 );\n }\n }\n\n return item;\n}\n\nbool CommentsView::eventFilter( QObject* obj, QEvent* event )\n{\n if( event->type() == QEvent::GraphicsSceneHoverEnter )\n {\n QGraphicsItem* item = qobject_cast<QGraphicsItem*> ( obj );\n m_itemBackground->setTargetItem( item );\n }\n\n return QObject::eventFilter( obj, event );\n}\n\nvoid CommentsView::showReply()\n{\n CommentsViewItem* parentItem = qobject_cast<CommentsViewItem*>( sender() );\n\n hideComments();\n NewCommentForm* form = new NewCommentForm( this );\n m_contentLayout->addItem( form );\n form->setParentIndex( parentItem->modelIndex() );\n form->setSizePolicy(QSizePolicy::Expanding, QSizePolicy::Maximum);\n\n connect( form, SIGNAL( accepted( QModelIndex, QString, QString ) ),\n SLOT( addNewUserComment( QModelIndex, QString, QString ) ) );\n connect( form, SIGNAL( canceled() ), SLOT( cancelNewComment() ) );\n}\n\nvoid CommentsView::removeComments()\n{\n CommentsViewItem* toDelete;\n \/\/TODO: Make the comments view paged\n while( m_commentsLayout->count() > 0 ) \/\/Remove existing comments from GUI\n {\n toDelete = dynamic_cast<CommentsViewItem*>( m_commentsLayout->itemAt( 0 ) );\n m_commentsLayout->removeAt( 0 );\n toDelete->deleteLater();\n }\n}\n\nvoid CommentsView::loadComments()\n{\n for( int i = 0; i < m_model->rowCount(); ++i ) \/\/Reload comments\n {\n addComment( m_model->index( i, 0 ), m_rootWidget, 0 );\n }\n}\n\nvoid CommentsView::reloadComments()\n{\n hideComments();\n removeComments();\n loadComments();\n showComments();\n}\n\nvoid CommentsView::addNewUserComment( QModelIndex parentIndex, QString title, QString body )\n{\n GluonPlayer::CommentsModel* model = static_cast<GluonPlayer::CommentsModel*>( m_model );\n model->uploadComment( parentIndex, title, body );\n connect( model, SIGNAL( addCommentFailed() ), SLOT( showComments() ) );\n sender()->deleteLater();\n}\n\nvoid CommentsView::cancelNewComment()\n{\n sender()->deleteLater();\n showComments();\n}\n\nvoid CommentsView::hideComments()\n{\n m_itemBackground->hide();\n m_commentsFrame->hide();\n m_contentLayout->removeItem( m_commentsFrame );\n}\n\nvoid CommentsView::showComments()\n{\n m_itemBackground->show();\n m_contentLayout->addItem( m_commentsFrame );\n m_commentsFrame->show();\n}\n<|endoftext|>"} {"text":"<commit_before>\/\/===--- ObjCMT.cpp - ObjC Migrate Tool -----------------------------------===\/\/\n\/\/\n\/\/ The LLVM Compiler Infrastructure\n\/\/\n\/\/ This file is distributed under the University of Illinois Open Source\n\/\/ License. See LICENSE.TXT for details.\n\/\/\n\/\/===----------------------------------------------------------------------===\/\/\n\n#include \"clang\/ARCMigrate\/ARCMTActions.h\"\n#include \"clang\/AST\/ASTConsumer.h\"\n#include \"clang\/AST\/ASTContext.h\"\n#include \"clang\/AST\/NSAPI.h\"\n#include \"clang\/AST\/ParentMap.h\"\n#include \"clang\/AST\/RecursiveASTVisitor.h\"\n#include \"clang\/Basic\/FileManager.h\"\n#include \"clang\/Edit\/Commit.h\"\n#include \"clang\/Edit\/EditedSource.h\"\n#include \"clang\/Edit\/EditsReceiver.h\"\n#include \"clang\/Edit\/Rewriters.h\"\n#include \"clang\/Frontend\/CompilerInstance.h\"\n#include \"clang\/Frontend\/MultiplexConsumer.h\"\n#include \"clang\/Lex\/PPConditionalDirectiveRecord.h\"\n#include \"clang\/Lex\/Preprocessor.h\"\n#include \"clang\/Rewrite\/Core\/Rewriter.h\"\n#include \"llvm\/ADT\/SmallString.h\"\n\nusing namespace clang;\nusing namespace arcmt;\n\nnamespace {\n\nclass ObjCMigrateASTConsumer : public ASTConsumer {\n void migrateDecl(Decl *D);\n void migrateObjCInterfaceDecl(ASTContext &Ctx, ObjCInterfaceDecl *D);\n\npublic:\n std::string MigrateDir;\n bool MigrateLiterals;\n bool MigrateSubscripting;\n OwningPtr<NSAPI> NSAPIObj;\n OwningPtr<edit::EditedSource> Editor;\n FileRemapper &Remapper;\n FileManager &FileMgr;\n const PPConditionalDirectiveRecord *PPRec;\n Preprocessor &PP;\n bool IsOutputFile;\n\n ObjCMigrateASTConsumer(StringRef migrateDir,\n bool migrateLiterals,\n bool migrateSubscripting,\n FileRemapper &remapper,\n FileManager &fileMgr,\n const PPConditionalDirectiveRecord *PPRec,\n Preprocessor &PP,\n bool isOutputFile = false)\n : MigrateDir(migrateDir),\n MigrateLiterals(migrateLiterals),\n MigrateSubscripting(migrateSubscripting),\n Remapper(remapper), FileMgr(fileMgr), PPRec(PPRec), PP(PP),\n IsOutputFile(isOutputFile) { }\n\nprotected:\n virtual void Initialize(ASTContext &Context) {\n NSAPIObj.reset(new NSAPI(Context));\n Editor.reset(new edit::EditedSource(Context.getSourceManager(),\n Context.getLangOpts(),\n PPRec));\n }\n\n virtual bool HandleTopLevelDecl(DeclGroupRef DG) {\n for (DeclGroupRef::iterator I = DG.begin(), E = DG.end(); I != E; ++I)\n migrateDecl(*I);\n return true;\n }\n virtual void HandleInterestingDecl(DeclGroupRef DG) {\n \/\/ Ignore decls from the PCH.\n }\n virtual void HandleTopLevelDeclInObjCContainer(DeclGroupRef DG) {\n ObjCMigrateASTConsumer::HandleTopLevelDecl(DG);\n }\n\n virtual void HandleTranslationUnit(ASTContext &Ctx);\n};\n\n}\n\nObjCMigrateAction::ObjCMigrateAction(FrontendAction *WrappedAction,\n StringRef migrateDir,\n bool migrateLiterals,\n bool migrateSubscripting)\n : WrapperFrontendAction(WrappedAction), MigrateDir(migrateDir),\n MigrateLiterals(migrateLiterals), MigrateSubscripting(migrateSubscripting),\n CompInst(0) {\n if (MigrateDir.empty())\n MigrateDir = \".\"; \/\/ user current directory if none is given.\n}\n\nASTConsumer *ObjCMigrateAction::CreateASTConsumer(CompilerInstance &CI,\n StringRef InFile) {\n PPConditionalDirectiveRecord *\n PPRec = new PPConditionalDirectiveRecord(CompInst->getSourceManager());\n CompInst->getPreprocessor().addPPCallbacks(PPRec);\n ASTConsumer *\n WrappedConsumer = WrapperFrontendAction::CreateASTConsumer(CI, InFile);\n ASTConsumer *MTConsumer = new ObjCMigrateASTConsumer(MigrateDir,\n MigrateLiterals,\n MigrateSubscripting,\n Remapper,\n CompInst->getFileManager(),\n PPRec,\n CompInst->getPreprocessor());\n ASTConsumer *Consumers[] = { MTConsumer, WrappedConsumer };\n return new MultiplexConsumer(Consumers);\n}\n\nbool ObjCMigrateAction::BeginInvocation(CompilerInstance &CI) {\n Remapper.initFromDisk(MigrateDir, CI.getDiagnostics(),\n \/*ignoreIfFilesChanges=*\/true);\n CompInst = &CI;\n CI.getDiagnostics().setIgnoreAllWarnings(true);\n return true;\n}\n\nnamespace {\nclass ObjCMigrator : public RecursiveASTVisitor<ObjCMigrator> {\n ObjCMigrateASTConsumer &Consumer;\n ParentMap &PMap;\n\npublic:\n ObjCMigrator(ObjCMigrateASTConsumer &consumer, ParentMap &PMap)\n : Consumer(consumer), PMap(PMap) { }\n\n bool shouldVisitTemplateInstantiations() const { return false; }\n bool shouldWalkTypesOfTypeLocs() const { return false; }\n\n bool VisitObjCMessageExpr(ObjCMessageExpr *E) {\n if (Consumer.MigrateLiterals) {\n edit::Commit commit(*Consumer.Editor);\n edit::rewriteToObjCLiteralSyntax(E, *Consumer.NSAPIObj, commit, &PMap);\n Consumer.Editor->commit(commit);\n }\n\n if (Consumer.MigrateSubscripting) {\n edit::Commit commit(*Consumer.Editor);\n edit::rewriteToObjCSubscriptSyntax(E, *Consumer.NSAPIObj, commit);\n Consumer.Editor->commit(commit);\n }\n\n return true;\n }\n\n bool TraverseObjCMessageExpr(ObjCMessageExpr *E) {\n \/\/ Do depth first; we want to rewrite the subexpressions first so that if\n \/\/ we have to move expressions we will move them already rewritten.\n for (Stmt::child_range range = E->children(); range; ++range)\n if (!TraverseStmt(*range))\n return false;\n\n return WalkUpFromObjCMessageExpr(E);\n }\n};\n\nclass BodyMigrator : public RecursiveASTVisitor<BodyMigrator> {\n ObjCMigrateASTConsumer &Consumer;\n OwningPtr<ParentMap> PMap;\n\npublic:\n BodyMigrator(ObjCMigrateASTConsumer &consumer) : Consumer(consumer) { }\n\n bool shouldVisitTemplateInstantiations() const { return false; }\n bool shouldWalkTypesOfTypeLocs() const { return false; }\n\n bool TraverseStmt(Stmt *S) {\n PMap.reset(new ParentMap(S));\n ObjCMigrator(Consumer, *PMap).TraverseStmt(S);\n return true;\n }\n};\n}\n\nvoid ObjCMigrateASTConsumer::migrateDecl(Decl *D) {\n if (!D)\n return;\n if (isa<ObjCMethodDecl>(D))\n return; \/\/ Wait for the ObjC container declaration.\n\n BodyMigrator(*this).TraverseDecl(D);\n}\n\nvoid ObjCMigrateASTConsumer::migrateObjCInterfaceDecl(ASTContext &Ctx,\n ObjCInterfaceDecl *D) {\n for (ObjCContainerDecl::method_iterator M = D->meth_begin(), MEnd = D->meth_end();\n M != MEnd; ++M) {\n ObjCMethodDecl *Method = (*M);\n if (Method->isPropertyAccessor() || Method->param_size() != 0)\n continue;\n \/\/ Is this method candidate to be a getter?\n QualType GRT = Method->getResultType();\n if (GRT->isVoidType())\n continue;\n Selector GetterSelector = Method->getSelector();\n IdentifierInfo *getterName = GetterSelector.getIdentifierInfoForSlot(0);\n Selector SetterSelector =\n SelectorTable::constructSetterSelector(PP.getIdentifierTable(),\n PP.getSelectorTable(),\n getterName);\n if (ObjCMethodDecl *SetterMethod = D->lookupMethod(SetterSelector, true)) {\n \/\/ Is this a valid setter, matching the target getter?\n QualType SRT = SetterMethod->getResultType();\n if (!SRT->isVoidType())\n continue;\n const ParmVarDecl *argDecl = *SetterMethod->param_begin();\n \/\/ FIXME. Can relax rule for matching getter\/setter type further.\n if (!Ctx.hasSameType(argDecl->getType(), GRT))\n continue;\n \/\/ we have a matching setter\/getter pair.\n \/\/ TODO. synthesize a suitable property declaration here.\n }\n }\n}\n\nnamespace {\n\nclass RewritesReceiver : public edit::EditsReceiver {\n Rewriter &Rewrite;\n\npublic:\n RewritesReceiver(Rewriter &Rewrite) : Rewrite(Rewrite) { }\n\n virtual void insert(SourceLocation loc, StringRef text) {\n Rewrite.InsertText(loc, text);\n }\n virtual void replace(CharSourceRange range, StringRef text) {\n Rewrite.ReplaceText(range.getBegin(), Rewrite.getRangeSize(range), text);\n }\n};\n\n}\n\nvoid ObjCMigrateASTConsumer::HandleTranslationUnit(ASTContext &Ctx) {\n \n TranslationUnitDecl *TU = Ctx.getTranslationUnitDecl();\n for (DeclContext::decl_iterator D = TU->decls_begin(), DEnd = TU->decls_end();\n D != DEnd; ++D) {\n if (ObjCInterfaceDecl *CDecl = dyn_cast<ObjCInterfaceDecl>(*D))\n migrateObjCInterfaceDecl(Ctx, CDecl);\n }\n \n Rewriter rewriter(Ctx.getSourceManager(), Ctx.getLangOpts());\n RewritesReceiver Rec(rewriter);\n Editor->applyRewrites(Rec);\n\n for (Rewriter::buffer_iterator\n I = rewriter.buffer_begin(), E = rewriter.buffer_end(); I != E; ++I) {\n FileID FID = I->first;\n RewriteBuffer &buf = I->second;\n const FileEntry *file = Ctx.getSourceManager().getFileEntryForID(FID);\n assert(file);\n SmallString<512> newText;\n llvm::raw_svector_ostream vecOS(newText);\n buf.write(vecOS);\n vecOS.flush();\n llvm::MemoryBuffer *memBuf = llvm::MemoryBuffer::getMemBufferCopy(\n StringRef(newText.data(), newText.size()), file->getName());\n SmallString<64> filePath(file->getName());\n FileMgr.FixupRelativePath(filePath);\n Remapper.remap(filePath.str(), memBuf);\n }\n\n if (IsOutputFile) {\n Remapper.flushToFile(MigrateDir, Ctx.getDiagnostics());\n } else {\n Remapper.flushToDisk(MigrateDir, Ctx.getDiagnostics());\n }\n}\n\nbool MigrateSourceAction::BeginInvocation(CompilerInstance &CI) {\n CI.getDiagnostics().setIgnoreAllWarnings(true);\n return true;\n}\n\nASTConsumer *MigrateSourceAction::CreateASTConsumer(CompilerInstance &CI,\n StringRef InFile) {\n PPConditionalDirectiveRecord *\n PPRec = new PPConditionalDirectiveRecord(CI.getSourceManager());\n CI.getPreprocessor().addPPCallbacks(PPRec);\n return new ObjCMigrateASTConsumer(CI.getFrontendOpts().OutputFile,\n \/*MigrateLiterals=*\/true,\n \/*MigrateSubscripting=*\/true,\n Remapper,\n CI.getFileManager(),\n PPRec,\n CI.getPreprocessor(),\n \/*isOutputFile=*\/true); \n}\n<commit_msg>[ObjectiveC migrator] relax the rules for setter\/getter types when deciding on validity of a property inclusion. \/\/ rdar:\/\/14345082<commit_after>\/\/===--- ObjCMT.cpp - ObjC Migrate Tool -----------------------------------===\/\/\n\/\/\n\/\/ The LLVM Compiler Infrastructure\n\/\/\n\/\/ This file is distributed under the University of Illinois Open Source\n\/\/ License. See LICENSE.TXT for details.\n\/\/\n\/\/===----------------------------------------------------------------------===\/\/\n\n#include \"clang\/ARCMigrate\/ARCMTActions.h\"\n#include \"clang\/AST\/ASTConsumer.h\"\n#include \"clang\/AST\/ASTContext.h\"\n#include \"clang\/AST\/NSAPI.h\"\n#include \"clang\/AST\/ParentMap.h\"\n#include \"clang\/AST\/RecursiveASTVisitor.h\"\n#include \"clang\/Basic\/FileManager.h\"\n#include \"clang\/Edit\/Commit.h\"\n#include \"clang\/Edit\/EditedSource.h\"\n#include \"clang\/Edit\/EditsReceiver.h\"\n#include \"clang\/Edit\/Rewriters.h\"\n#include \"clang\/Frontend\/CompilerInstance.h\"\n#include \"clang\/Frontend\/MultiplexConsumer.h\"\n#include \"clang\/Lex\/PPConditionalDirectiveRecord.h\"\n#include \"clang\/Lex\/Preprocessor.h\"\n#include \"clang\/Rewrite\/Core\/Rewriter.h\"\n#include \"llvm\/ADT\/SmallString.h\"\n\nusing namespace clang;\nusing namespace arcmt;\n\nnamespace {\n\nclass ObjCMigrateASTConsumer : public ASTConsumer {\n void migrateDecl(Decl *D);\n void migrateObjCInterfaceDecl(ASTContext &Ctx, ObjCInterfaceDecl *D);\n\npublic:\n std::string MigrateDir;\n bool MigrateLiterals;\n bool MigrateSubscripting;\n OwningPtr<NSAPI> NSAPIObj;\n OwningPtr<edit::EditedSource> Editor;\n FileRemapper &Remapper;\n FileManager &FileMgr;\n const PPConditionalDirectiveRecord *PPRec;\n Preprocessor &PP;\n bool IsOutputFile;\n\n ObjCMigrateASTConsumer(StringRef migrateDir,\n bool migrateLiterals,\n bool migrateSubscripting,\n FileRemapper &remapper,\n FileManager &fileMgr,\n const PPConditionalDirectiveRecord *PPRec,\n Preprocessor &PP,\n bool isOutputFile = false)\n : MigrateDir(migrateDir),\n MigrateLiterals(migrateLiterals),\n MigrateSubscripting(migrateSubscripting),\n Remapper(remapper), FileMgr(fileMgr), PPRec(PPRec), PP(PP),\n IsOutputFile(isOutputFile) { }\n\nprotected:\n virtual void Initialize(ASTContext &Context) {\n NSAPIObj.reset(new NSAPI(Context));\n Editor.reset(new edit::EditedSource(Context.getSourceManager(),\n Context.getLangOpts(),\n PPRec));\n }\n\n virtual bool HandleTopLevelDecl(DeclGroupRef DG) {\n for (DeclGroupRef::iterator I = DG.begin(), E = DG.end(); I != E; ++I)\n migrateDecl(*I);\n return true;\n }\n virtual void HandleInterestingDecl(DeclGroupRef DG) {\n \/\/ Ignore decls from the PCH.\n }\n virtual void HandleTopLevelDeclInObjCContainer(DeclGroupRef DG) {\n ObjCMigrateASTConsumer::HandleTopLevelDecl(DG);\n }\n\n virtual void HandleTranslationUnit(ASTContext &Ctx);\n};\n\n}\n\nObjCMigrateAction::ObjCMigrateAction(FrontendAction *WrappedAction,\n StringRef migrateDir,\n bool migrateLiterals,\n bool migrateSubscripting)\n : WrapperFrontendAction(WrappedAction), MigrateDir(migrateDir),\n MigrateLiterals(migrateLiterals), MigrateSubscripting(migrateSubscripting),\n CompInst(0) {\n if (MigrateDir.empty())\n MigrateDir = \".\"; \/\/ user current directory if none is given.\n}\n\nASTConsumer *ObjCMigrateAction::CreateASTConsumer(CompilerInstance &CI,\n StringRef InFile) {\n PPConditionalDirectiveRecord *\n PPRec = new PPConditionalDirectiveRecord(CompInst->getSourceManager());\n CompInst->getPreprocessor().addPPCallbacks(PPRec);\n ASTConsumer *\n WrappedConsumer = WrapperFrontendAction::CreateASTConsumer(CI, InFile);\n ASTConsumer *MTConsumer = new ObjCMigrateASTConsumer(MigrateDir,\n MigrateLiterals,\n MigrateSubscripting,\n Remapper,\n CompInst->getFileManager(),\n PPRec,\n CompInst->getPreprocessor());\n ASTConsumer *Consumers[] = { MTConsumer, WrappedConsumer };\n return new MultiplexConsumer(Consumers);\n}\n\nbool ObjCMigrateAction::BeginInvocation(CompilerInstance &CI) {\n Remapper.initFromDisk(MigrateDir, CI.getDiagnostics(),\n \/*ignoreIfFilesChanges=*\/true);\n CompInst = &CI;\n CI.getDiagnostics().setIgnoreAllWarnings(true);\n return true;\n}\n\nnamespace {\nclass ObjCMigrator : public RecursiveASTVisitor<ObjCMigrator> {\n ObjCMigrateASTConsumer &Consumer;\n ParentMap &PMap;\n\npublic:\n ObjCMigrator(ObjCMigrateASTConsumer &consumer, ParentMap &PMap)\n : Consumer(consumer), PMap(PMap) { }\n\n bool shouldVisitTemplateInstantiations() const { return false; }\n bool shouldWalkTypesOfTypeLocs() const { return false; }\n\n bool VisitObjCMessageExpr(ObjCMessageExpr *E) {\n if (Consumer.MigrateLiterals) {\n edit::Commit commit(*Consumer.Editor);\n edit::rewriteToObjCLiteralSyntax(E, *Consumer.NSAPIObj, commit, &PMap);\n Consumer.Editor->commit(commit);\n }\n\n if (Consumer.MigrateSubscripting) {\n edit::Commit commit(*Consumer.Editor);\n edit::rewriteToObjCSubscriptSyntax(E, *Consumer.NSAPIObj, commit);\n Consumer.Editor->commit(commit);\n }\n\n return true;\n }\n\n bool TraverseObjCMessageExpr(ObjCMessageExpr *E) {\n \/\/ Do depth first; we want to rewrite the subexpressions first so that if\n \/\/ we have to move expressions we will move them already rewritten.\n for (Stmt::child_range range = E->children(); range; ++range)\n if (!TraverseStmt(*range))\n return false;\n\n return WalkUpFromObjCMessageExpr(E);\n }\n};\n\nclass BodyMigrator : public RecursiveASTVisitor<BodyMigrator> {\n ObjCMigrateASTConsumer &Consumer;\n OwningPtr<ParentMap> PMap;\n\npublic:\n BodyMigrator(ObjCMigrateASTConsumer &consumer) : Consumer(consumer) { }\n\n bool shouldVisitTemplateInstantiations() const { return false; }\n bool shouldWalkTypesOfTypeLocs() const { return false; }\n\n bool TraverseStmt(Stmt *S) {\n PMap.reset(new ParentMap(S));\n ObjCMigrator(Consumer, *PMap).TraverseStmt(S);\n return true;\n }\n};\n}\n\nvoid ObjCMigrateASTConsumer::migrateDecl(Decl *D) {\n if (!D)\n return;\n if (isa<ObjCMethodDecl>(D))\n return; \/\/ Wait for the ObjC container declaration.\n\n BodyMigrator(*this).TraverseDecl(D);\n}\n\nvoid ObjCMigrateASTConsumer::migrateObjCInterfaceDecl(ASTContext &Ctx,\n ObjCInterfaceDecl *D) {\n for (ObjCContainerDecl::method_iterator M = D->meth_begin(), MEnd = D->meth_end();\n M != MEnd; ++M) {\n ObjCMethodDecl *Method = (*M);\n if (Method->isPropertyAccessor() || Method->param_size() != 0)\n continue;\n \/\/ Is this method candidate to be a getter?\n QualType GRT = Method->getResultType();\n if (GRT->isVoidType())\n continue;\n Selector GetterSelector = Method->getSelector();\n IdentifierInfo *getterName = GetterSelector.getIdentifierInfoForSlot(0);\n Selector SetterSelector =\n SelectorTable::constructSetterSelector(PP.getIdentifierTable(),\n PP.getSelectorTable(),\n getterName);\n if (ObjCMethodDecl *SetterMethod = D->lookupMethod(SetterSelector, true)) {\n \/\/ Is this a valid setter, matching the target getter?\n QualType SRT = SetterMethod->getResultType();\n if (!SRT->isVoidType())\n continue;\n const ParmVarDecl *argDecl = *SetterMethod->param_begin();\n QualType ArgType = argDecl->getType();\n if (!Ctx.hasSameType(ArgType, GRT)) {\n bool Valid =\n ((GRT->isObjCIdType() && ArgType->isObjCObjectPointerType())\n || (ArgType->isObjCIdType() && GRT->isObjCObjectPointerType()));\n if (!Valid)\n continue;\n }\n \/\/ we have a matching setter\/getter pair.\n \/\/ TODO. synthesize a suitable property declaration here.\n }\n }\n}\n\nnamespace {\n\nclass RewritesReceiver : public edit::EditsReceiver {\n Rewriter &Rewrite;\n\npublic:\n RewritesReceiver(Rewriter &Rewrite) : Rewrite(Rewrite) { }\n\n virtual void insert(SourceLocation loc, StringRef text) {\n Rewrite.InsertText(loc, text);\n }\n virtual void replace(CharSourceRange range, StringRef text) {\n Rewrite.ReplaceText(range.getBegin(), Rewrite.getRangeSize(range), text);\n }\n};\n\n}\n\nvoid ObjCMigrateASTConsumer::HandleTranslationUnit(ASTContext &Ctx) {\n \n TranslationUnitDecl *TU = Ctx.getTranslationUnitDecl();\n for (DeclContext::decl_iterator D = TU->decls_begin(), DEnd = TU->decls_end();\n D != DEnd; ++D) {\n if (ObjCInterfaceDecl *CDecl = dyn_cast<ObjCInterfaceDecl>(*D))\n migrateObjCInterfaceDecl(Ctx, CDecl);\n }\n \n Rewriter rewriter(Ctx.getSourceManager(), Ctx.getLangOpts());\n RewritesReceiver Rec(rewriter);\n Editor->applyRewrites(Rec);\n\n for (Rewriter::buffer_iterator\n I = rewriter.buffer_begin(), E = rewriter.buffer_end(); I != E; ++I) {\n FileID FID = I->first;\n RewriteBuffer &buf = I->second;\n const FileEntry *file = Ctx.getSourceManager().getFileEntryForID(FID);\n assert(file);\n SmallString<512> newText;\n llvm::raw_svector_ostream vecOS(newText);\n buf.write(vecOS);\n vecOS.flush();\n llvm::MemoryBuffer *memBuf = llvm::MemoryBuffer::getMemBufferCopy(\n StringRef(newText.data(), newText.size()), file->getName());\n SmallString<64> filePath(file->getName());\n FileMgr.FixupRelativePath(filePath);\n Remapper.remap(filePath.str(), memBuf);\n }\n\n if (IsOutputFile) {\n Remapper.flushToFile(MigrateDir, Ctx.getDiagnostics());\n } else {\n Remapper.flushToDisk(MigrateDir, Ctx.getDiagnostics());\n }\n}\n\nbool MigrateSourceAction::BeginInvocation(CompilerInstance &CI) {\n CI.getDiagnostics().setIgnoreAllWarnings(true);\n return true;\n}\n\nASTConsumer *MigrateSourceAction::CreateASTConsumer(CompilerInstance &CI,\n StringRef InFile) {\n PPConditionalDirectiveRecord *\n PPRec = new PPConditionalDirectiveRecord(CI.getSourceManager());\n CI.getPreprocessor().addPPCallbacks(PPRec);\n return new ObjCMigrateASTConsumer(CI.getFrontendOpts().OutputFile,\n \/*MigrateLiterals=*\/true,\n \/*MigrateSubscripting=*\/true,\n Remapper,\n CI.getFileManager(),\n PPRec,\n CI.getPreprocessor(),\n \/*isOutputFile=*\/true); \n}\n<|endoftext|>"} {"text":"<commit_before>#include \"oem\/ibm\/libpldm\/state_set.h\"\n\n#include \"oem\/ibm\/libpldmresponder\/oem_ibm_handler.hpp\"\n\n\/** @brief PLDM OEM State Set range as per DSP0249_1.1.0 specification\n *\/\nenum pldm_oem_state_set_id_codes\n{\n PLDM_OEM_STATE_SET_START = 32768,\n PLDM_OEM_STATE_SET_END = 65535,\n\n};\n\n\/** @brief PLDM OEM IBM Code Update possible state set values\n *\/\nenum pldm_oem_ibm_cu_state_set_values\n{\n OEM_IBM_STATE_SET_CU_START = 1,\n OEM_IBM_STATE_SET_CU_END = 2,\n OEM_IBM_STATE_SET_CU_FAIL = 3,\n OEM_IBM_STATE_SET_CU_ABORT = 4,\n OEM_IBM_STATE_SET_CU_ACCEPT = 5,\n OEM_IBM_STATE_SET_CU_REJECT = 6,\n};\n\n\/** @brief PLDM OEM IBM Verification possible state set values\n *\/\nenum pldm_oem_ibm_verification_state_set_values\n{\n OEM_IBM_STATE_SET_VERFICATION_VALID = 0,\n OEM_IBM_STATE_SET_VERFICATION_ENTITLEMENT_FAIL = 1,\n OEM_IBM_STATE_SET_VERFICATION_BANNED_PLATFORM_FAIL = 2,\n OEM_IBM_STATE_SET_VERFICATION_MIN_MIF_FAIL = 4,\n};\n\n\/** @brief PLDM OEM IBM system power state possible state set values\n *\/\nenum pldm_oem_ibm_sys_power_state_set_values\n{\n OEM_IBM_STATE_SET_SYS_PWR_STATE_RECYCLE_HARD = 1,\n};\n\n\/** @brief PLDM OEM IBM boot state possible state set values\n *\/\nenum pldm_oem_ibm_boot_state_set_values\n{\n OEM_IBM_STATE_SET_BOOT_STATE_P_SIDE = 1,\n OEM_IBM_STATE_SET_BOOT_STATE_T_SIDE = 2,\n};\n\n\/** @brief Map for PLDM OEM IBM Entity Types\n *\/\nextern const std::map<uint8_t, std::string> OemIBMEntityType{\n {pldm::responder::oem_ibm_platform::PLDM_OEM_IBM_ENTITY_FIRMWARE_UPDATE,\n \"OEM IBM Firmware Update\"},\n {PLDM_OEM_ENTITY_TYPE_START, \"OEM IBM Entity Type Start\"},\n {PLDM_OEM_ENTITY_TYPE_END, \"OEM IBM Entity Type End\"},\n};\n\n\/** @brief Map for PLDM OEM IBM State Sets\n *\/\nextern const std::map<uint16_t, std::string> OemIBMstateSet{\n {PLDM_OEM_IBM_FIRMWARE_UPDATE_STATE, \"OEM IBM Firmware Update State\"},\n {PLDM_OEM_IBM_BOOT_STATE, \"OEM IBM Boot State\"},\n {PLDM_OEM_IBM_VERIFICATION_STATE, \"OEM IBM Verification State\"},\n {PLDM_OEM_IBM_SYSTEM_POWER_STATE, \"OEM IBM System Power State\"}};\n\n\/** @brief Map for PLDM OEM IBM firmware update possible state values\n *\/\nextern const std::map<uint8_t, std::string> SetOemIBMFWUpdateStateValues{\n {OEM_IBM_STATE_SET_CU_START, \"Start\"},\n {OEM_IBM_STATE_SET_CU_END, \"End\"},\n {OEM_IBM_STATE_SET_CU_FAIL, \"Fail\"},\n {OEM_IBM_STATE_SET_CU_ABORT, \"Abort\"},\n {OEM_IBM_STATE_SET_CU_ACCEPT, \"Accept\"},\n {OEM_IBM_STATE_SET_CU_REJECT, \"Reject\"}};\n\n\/** @brief Map for PLDM OEM IBM verification state possible state values\n *\/\nextern const std::map<uint8_t, std::string> SetOemIBMVerStateValues{\n {OEM_IBM_STATE_SET_VERFICATION_VALID, \"Valid\"},\n {OEM_IBM_STATE_SET_VERFICATION_ENTITLEMENT_FAIL, \"Entitlement Fail\"},\n {OEM_IBM_STATE_SET_VERFICATION_BANNED_PLATFORM_FAIL,\n \"Banned Platform Fail\"},\n {OEM_IBM_STATE_SET_VERFICATION_MIN_MIF_FAIL, \"Minimum MIF Fail\"}};\n\n\/** @brief Map for PLDM OEM IBM systerm power state possible state values\n *\/\nextern const std::map<uint8_t, std::string> SetOemIBMSysPowerStatesValues{\n {OEM_IBM_STATE_SET_SYS_PWR_STATE_RECYCLE_HARD, \"Power Cycle Hard\"}};\n\n\/** @brief Map for PLDM OEM IBM boot state possible state values\n *\/\nextern const std::map<uint8_t, std::string> SetOemIBMBootStateValues{\n {OEM_IBM_STATE_SET_BOOT_STATE_P_SIDE, \"P Side\"},\n {OEM_IBM_STATE_SET_BOOT_STATE_T_SIDE, \"T side\"}};\n\n\/** @brief Map for populating PLDM OEM IBM state sets with possible state values\n *\/\nextern const std::map<uint16_t, const std::map<uint8_t, std::string>>\n populateOemIBMStateMaps{\n {PLDM_OEM_IBM_VERIFICATION_STATE, SetOemIBMVerStateValues},\n {PLDM_OEM_IBM_SYSTEM_POWER_STATE, SetOemIBMSysPowerStatesValues},\n {PLDM_OEM_IBM_BOOT_STATE, SetOemIBMBootStateValues},\n {PLDM_OEM_IBM_FIRMWARE_UPDATE_STATE, SetOemIBMFWUpdateStateValues},\n };\n<commit_msg>Fix renamed IBM OEM state set header in pldmtool<commit_after>#include \"oem\/ibm\/libpldm\/state_set_oem_ibm.h\"\n\n#include \"oem\/ibm\/libpldmresponder\/oem_ibm_handler.hpp\"\n\n\/** @brief PLDM OEM State Set range as per DSP0249_1.1.0 specification\n *\/\nenum pldm_oem_state_set_id_codes\n{\n PLDM_OEM_STATE_SET_START = 32768,\n PLDM_OEM_STATE_SET_END = 65535,\n\n};\n\n\/** @brief PLDM OEM IBM Code Update possible state set values\n *\/\nenum pldm_oem_ibm_cu_state_set_values\n{\n OEM_IBM_STATE_SET_CU_START = 1,\n OEM_IBM_STATE_SET_CU_END = 2,\n OEM_IBM_STATE_SET_CU_FAIL = 3,\n OEM_IBM_STATE_SET_CU_ABORT = 4,\n OEM_IBM_STATE_SET_CU_ACCEPT = 5,\n OEM_IBM_STATE_SET_CU_REJECT = 6,\n};\n\n\/** @brief PLDM OEM IBM Verification possible state set values\n *\/\nenum pldm_oem_ibm_verification_state_set_values\n{\n OEM_IBM_STATE_SET_VERFICATION_VALID = 0,\n OEM_IBM_STATE_SET_VERFICATION_ENTITLEMENT_FAIL = 1,\n OEM_IBM_STATE_SET_VERFICATION_BANNED_PLATFORM_FAIL = 2,\n OEM_IBM_STATE_SET_VERFICATION_MIN_MIF_FAIL = 4,\n};\n\n\/** @brief PLDM OEM IBM system power state possible state set values\n *\/\nenum pldm_oem_ibm_sys_power_state_set_values\n{\n OEM_IBM_STATE_SET_SYS_PWR_STATE_RECYCLE_HARD = 1,\n};\n\n\/** @brief PLDM OEM IBM boot state possible state set values\n *\/\nenum pldm_oem_ibm_boot_state_set_values\n{\n OEM_IBM_STATE_SET_BOOT_STATE_P_SIDE = 1,\n OEM_IBM_STATE_SET_BOOT_STATE_T_SIDE = 2,\n};\n\n\/** @brief Map for PLDM OEM IBM Entity Types\n *\/\nextern const std::map<uint8_t, std::string> OemIBMEntityType{\n {pldm::responder::oem_ibm_platform::PLDM_OEM_IBM_ENTITY_FIRMWARE_UPDATE,\n \"OEM IBM Firmware Update\"},\n {PLDM_OEM_ENTITY_TYPE_START, \"OEM IBM Entity Type Start\"},\n {PLDM_OEM_ENTITY_TYPE_END, \"OEM IBM Entity Type End\"},\n};\n\n\/** @brief Map for PLDM OEM IBM State Sets\n *\/\nextern const std::map<uint16_t, std::string> OemIBMstateSet{\n {PLDM_OEM_IBM_FIRMWARE_UPDATE_STATE, \"OEM IBM Firmware Update State\"},\n {PLDM_OEM_IBM_BOOT_STATE, \"OEM IBM Boot State\"},\n {PLDM_OEM_IBM_VERIFICATION_STATE, \"OEM IBM Verification State\"},\n {PLDM_OEM_IBM_SYSTEM_POWER_STATE, \"OEM IBM System Power State\"}};\n\n\/** @brief Map for PLDM OEM IBM firmware update possible state values\n *\/\nextern const std::map<uint8_t, std::string> SetOemIBMFWUpdateStateValues{\n {OEM_IBM_STATE_SET_CU_START, \"Start\"},\n {OEM_IBM_STATE_SET_CU_END, \"End\"},\n {OEM_IBM_STATE_SET_CU_FAIL, \"Fail\"},\n {OEM_IBM_STATE_SET_CU_ABORT, \"Abort\"},\n {OEM_IBM_STATE_SET_CU_ACCEPT, \"Accept\"},\n {OEM_IBM_STATE_SET_CU_REJECT, \"Reject\"}};\n\n\/** @brief Map for PLDM OEM IBM verification state possible state values\n *\/\nextern const std::map<uint8_t, std::string> SetOemIBMVerStateValues{\n {OEM_IBM_STATE_SET_VERFICATION_VALID, \"Valid\"},\n {OEM_IBM_STATE_SET_VERFICATION_ENTITLEMENT_FAIL, \"Entitlement Fail\"},\n {OEM_IBM_STATE_SET_VERFICATION_BANNED_PLATFORM_FAIL,\n \"Banned Platform Fail\"},\n {OEM_IBM_STATE_SET_VERFICATION_MIN_MIF_FAIL, \"Minimum MIF Fail\"}};\n\n\/** @brief Map for PLDM OEM IBM systerm power state possible state values\n *\/\nextern const std::map<uint8_t, std::string> SetOemIBMSysPowerStatesValues{\n {OEM_IBM_STATE_SET_SYS_PWR_STATE_RECYCLE_HARD, \"Power Cycle Hard\"}};\n\n\/** @brief Map for PLDM OEM IBM boot state possible state values\n *\/\nextern const std::map<uint8_t, std::string> SetOemIBMBootStateValues{\n {OEM_IBM_STATE_SET_BOOT_STATE_P_SIDE, \"P Side\"},\n {OEM_IBM_STATE_SET_BOOT_STATE_T_SIDE, \"T side\"}};\n\n\/** @brief Map for populating PLDM OEM IBM state sets with possible state values\n *\/\nextern const std::map<uint16_t, const std::map<uint8_t, std::string>>\n populateOemIBMStateMaps{\n {PLDM_OEM_IBM_VERIFICATION_STATE, SetOemIBMVerStateValues},\n {PLDM_OEM_IBM_SYSTEM_POWER_STATE, SetOemIBMSysPowerStatesValues},\n {PLDM_OEM_IBM_BOOT_STATE, SetOemIBMBootStateValues},\n {PLDM_OEM_IBM_FIRMWARE_UPDATE_STATE, SetOemIBMFWUpdateStateValues},\n };\n<|endoftext|>"} {"text":"<commit_before>\/\/===- LoopInfo.cpp - Natural Loop Calculator -----------------------------===\/\/\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 LoopInfo class that is used to identify natural loops\n\/\/ and determine the loop depth of various nodes of the CFG. Note that the\n\/\/ loops identified may actually be several natural loops that share the same\n\/\/ header node... not just a single natural loop.\n\/\/\n\/\/===----------------------------------------------------------------------===\/\/\n\n#include \"llvm\/Analysis\/LoopInfo.h\"\n#include \"llvm\/Constants.h\"\n#include \"llvm\/Instructions.h\"\n#include \"llvm\/Analysis\/Dominators.h\"\n#include \"llvm\/Assembly\/Writer.h\"\n#include \"llvm\/Support\/CFG.h\"\n#include \"llvm\/ADT\/DepthFirstIterator.h\"\n#include \"llvm\/ADT\/SmallPtrSet.h\"\n#include <algorithm>\nusing namespace llvm;\n\nchar LoopInfo::ID = 0;\nstatic RegisterPass<LoopInfo>\nX(\"loops\", \"Natural Loop Information\", true, true);\n\n\/\/===----------------------------------------------------------------------===\/\/\n\/\/ Loop implementation\n\/\/\n\n\/\/\/ isLoopInvariant - Return true if the specified value is loop invariant\n\/\/\/\nbool Loop::isLoopInvariant(Value *V) const {\n if (Instruction *I = dyn_cast<Instruction>(V))\n return isLoopInvariant(I);\n return true; \/\/ All non-instructions are loop invariant\n}\n\n\/\/\/ isLoopInvariant - Return true if the specified instruction is\n\/\/\/ loop-invariant.\n\/\/\/\nbool Loop::isLoopInvariant(Instruction *I) const {\n return !contains(I->getParent());\n}\n\n\/\/\/ makeLoopInvariant - If the given value is an instruciton inside of the\n\/\/\/ loop and it can be hoisted, do so to make it trivially loop-invariant.\n\/\/\/ Return true if the value after any hoisting is loop invariant. This\n\/\/\/ function can be used as a slightly more aggressive replacement for\n\/\/\/ isLoopInvariant.\n\/\/\/\n\/\/\/ If InsertPt is specified, it is the point to hoist instructions to.\n\/\/\/ If null, the terminator of the loop preheader is used.\n\/\/\/\nbool Loop::makeLoopInvariant(Value *V, bool &Changed,\n Instruction *InsertPt) const {\n if (Instruction *I = dyn_cast<Instruction>(V))\n return makeLoopInvariant(I, Changed, InsertPt);\n return true; \/\/ All non-instructions are loop-invariant.\n}\n\n\/\/\/ makeLoopInvariant - If the given instruction is inside of the\n\/\/\/ loop and it can be hoisted, do so to make it trivially loop-invariant.\n\/\/\/ Return true if the instruction after any hoisting is loop invariant. This\n\/\/\/ function can be used as a slightly more aggressive replacement for\n\/\/\/ isLoopInvariant.\n\/\/\/\n\/\/\/ If InsertPt is specified, it is the point to hoist instructions to.\n\/\/\/ If null, the terminator of the loop preheader is used.\n\/\/\/\nbool Loop::makeLoopInvariant(Instruction *I, bool &Changed,\n Instruction *InsertPt) const {\n \/\/ Test if the value is already loop-invariant.\n if (isLoopInvariant(I))\n return true;\n if (!I->isSafeToSpeculativelyExecute())\n return false;\n if (I->mayReadFromMemory())\n return false;\n \/\/ Determine the insertion point, unless one was given.\n if (!InsertPt) {\n BasicBlock *Preheader = getLoopPreheader();\n \/\/ Without a preheader, hoisting is not feasible.\n if (!Preheader)\n return false;\n InsertPt = Preheader->getTerminator();\n }\n \/\/ Don't hoist instructions with loop-variant operands.\n for (unsigned i = 0, e = I->getNumOperands(); i != e; ++i)\n if (!makeLoopInvariant(I->getOperand(i), Changed, InsertPt))\n return false;\n \/\/ Hoist.\n I->moveBefore(InsertPt);\n Changed = true;\n return true;\n}\n\n\/\/\/ getCanonicalInductionVariable - Check to see if the loop has a canonical\n\/\/\/ induction variable: an integer recurrence that starts at 0 and increments\n\/\/\/ by one each time through the loop. If so, return the phi node that\n\/\/\/ corresponds to it.\n\/\/\/\n\/\/\/ The IndVarSimplify pass transforms loops to have a canonical induction\n\/\/\/ variable.\n\/\/\/\nPHINode *Loop::getCanonicalInductionVariable() const {\n BasicBlock *H = getHeader();\n\n BasicBlock *Incoming = 0, *Backedge = 0;\n typedef GraphTraits<Inverse<BasicBlock*> > InvBlockTraits;\n InvBlockTraits::ChildIteratorType PI = InvBlockTraits::child_begin(H);\n assert(PI != InvBlockTraits::child_end(H) &&\n \"Loop must have at least one backedge!\");\n Backedge = *PI++;\n if (PI == InvBlockTraits::child_end(H)) return 0; \/\/ dead loop\n Incoming = *PI++;\n if (PI != InvBlockTraits::child_end(H)) return 0; \/\/ multiple backedges?\n\n if (contains(Incoming)) {\n if (contains(Backedge))\n return 0;\n std::swap(Incoming, Backedge);\n } else if (!contains(Backedge))\n return 0;\n\n \/\/ Loop over all of the PHI nodes, looking for a canonical indvar.\n for (BasicBlock::iterator I = H->begin(); isa<PHINode>(I); ++I) {\n PHINode *PN = cast<PHINode>(I);\n if (ConstantInt *CI =\n dyn_cast<ConstantInt>(PN->getIncomingValueForBlock(Incoming)))\n if (CI->isNullValue())\n if (Instruction *Inc =\n dyn_cast<Instruction>(PN->getIncomingValueForBlock(Backedge)))\n if (Inc->getOpcode() == Instruction::Add &&\n Inc->getOperand(0) == PN)\n if (ConstantInt *CI = dyn_cast<ConstantInt>(Inc->getOperand(1)))\n if (CI->equalsInt(1))\n return PN;\n }\n return 0;\n}\n\n\/\/\/ getCanonicalInductionVariableIncrement - Return the LLVM value that holds\n\/\/\/ the canonical induction variable value for the \"next\" iteration of the\n\/\/\/ loop. This always succeeds if getCanonicalInductionVariable succeeds.\n\/\/\/\nInstruction *Loop::getCanonicalInductionVariableIncrement() const {\n if (PHINode *PN = getCanonicalInductionVariable()) {\n bool P1InLoop = contains(PN->getIncomingBlock(1));\n return cast<Instruction>(PN->getIncomingValue(P1InLoop));\n }\n return 0;\n}\n\n\/\/\/ getTripCount - Return a loop-invariant LLVM value indicating the number of\n\/\/\/ times the loop will be executed. Note that this means that the backedge\n\/\/\/ of the loop executes N-1 times. If the trip-count cannot be determined,\n\/\/\/ this returns null.\n\/\/\/\n\/\/\/ The IndVarSimplify pass transforms loops to have a form that this\n\/\/\/ function easily understands.\n\/\/\/\nValue *Loop::getTripCount() const {\n \/\/ Canonical loops will end with a 'cmp ne I, V', where I is the incremented\n \/\/ canonical induction variable and V is the trip count of the loop.\n Instruction *Inc = getCanonicalInductionVariableIncrement();\n if (Inc == 0) return 0;\n PHINode *IV = cast<PHINode>(Inc->getOperand(0));\n\n BasicBlock *BackedgeBlock =\n IV->getIncomingBlock(contains(IV->getIncomingBlock(1)));\n\n if (BranchInst *BI = dyn_cast<BranchInst>(BackedgeBlock->getTerminator()))\n if (BI->isConditional()) {\n if (ICmpInst *ICI = dyn_cast<ICmpInst>(BI->getCondition())) {\n if (ICI->getOperand(0) == Inc) {\n if (BI->getSuccessor(0) == getHeader()) {\n if (ICI->getPredicate() == ICmpInst::ICMP_NE)\n return ICI->getOperand(1);\n } else if (ICI->getPredicate() == ICmpInst::ICMP_EQ) {\n return ICI->getOperand(1);\n }\n }\n }\n }\n\n return 0;\n}\n\n\/\/\/ getSmallConstantTripCount - Returns the trip count of this loop as a\n\/\/\/ normal unsigned value, if possible. Returns 0 if the trip count is unknown\n\/\/\/ of not constant. Will also return 0 if the trip count is very large\n\/\/\/ (>= 2^32)\nunsigned Loop::getSmallConstantTripCount() const {\n Value* TripCount = this->getTripCount();\n if (TripCount) {\n if (ConstantInt *TripCountC = dyn_cast<ConstantInt>(TripCount)) {\n \/\/ Guard against huge trip counts.\n if (TripCountC->getValue().getActiveBits() <= 32) {\n return (unsigned)TripCountC->getZExtValue();\n }\n }\n }\n return 0;\n}\n\n\/\/\/ getSmallConstantTripMultiple - Returns the largest constant divisor of the\n\/\/\/ trip count of this loop as a normal unsigned value, if possible. This\n\/\/\/ means that the actual trip count is always a multiple of the returned\n\/\/\/ value (don't forget the trip count could very well be zero as well!).\n\/\/\/\n\/\/\/ Returns 1 if the trip count is unknown or not guaranteed to be the\n\/\/\/ multiple of a constant (which is also the case if the trip count is simply\n\/\/\/ constant, use getSmallConstantTripCount for that case), Will also return 1\n\/\/\/ if the trip count is very large (>= 2^32).\nunsigned Loop::getSmallConstantTripMultiple() const {\n Value* TripCount = this->getTripCount();\n \/\/ This will hold the ConstantInt result, if any\n ConstantInt *Result = NULL;\n if (TripCount) {\n \/\/ See if the trip count is constant itself\n Result = dyn_cast<ConstantInt>(TripCount);\n \/\/ if not, see if it is a multiplication\n if (!Result)\n if (BinaryOperator *BO = dyn_cast<BinaryOperator>(TripCount)) {\n switch (BO->getOpcode()) {\n case BinaryOperator::Mul:\n Result = dyn_cast<ConstantInt>(BO->getOperand(1));\n break;\n default:\n break;\n }\n }\n }\n \/\/ Guard against huge trip counts.\n if (Result && Result->getValue().getActiveBits() <= 32) {\n return (unsigned)Result->getZExtValue();\n } else {\n return 1;\n }\n}\n\n\/\/\/ isLCSSAForm - Return true if the Loop is in LCSSA form\nbool Loop::isLCSSAForm() const {\n \/\/ Sort the blocks vector so that we can use binary search to do quick\n \/\/ lookups.\n SmallPtrSet<BasicBlock *, 16> LoopBBs(block_begin(), block_end());\n\n for (block_iterator BI = block_begin(), E = block_end(); BI != E; ++BI) {\n BasicBlock *BB = *BI;\n for (BasicBlock ::iterator I = BB->begin(), E = BB->end(); I != E;++I)\n for (Value::use_iterator UI = I->use_begin(), E = I->use_end(); UI != E;\n ++UI) {\n BasicBlock *UserBB = cast<Instruction>(*UI)->getParent();\n if (PHINode *P = dyn_cast<PHINode>(*UI)) {\n UserBB = P->getIncomingBlock(UI);\n }\n\n \/\/ Check the current block, as a fast-path. Most values are used in\n \/\/ the same block they are defined in.\n if (UserBB != BB && !LoopBBs.count(UserBB))\n return false;\n }\n }\n\n return true;\n}\n\n\/\/\/ isLoopSimplifyForm - Return true if the Loop is in the form that\n\/\/\/ the LoopSimplify form transforms loops to, which is sometimes called\n\/\/\/ normal form.\nbool Loop::isLoopSimplifyForm() const {\n \/\/ Normal-form loops have a preheader.\n if (!getLoopPreheader())\n return false;\n \/\/ Normal-form loops have a single backedge.\n if (!getLoopLatch())\n return false;\n \/\/ Each predecessor of each exit block of a normal loop is contained\n \/\/ within the loop.\n SmallVector<BasicBlock *, 4> ExitBlocks;\n getExitBlocks(ExitBlocks);\n for (unsigned i = 0, e = ExitBlocks.size(); i != e; ++i)\n for (pred_iterator PI = pred_begin(ExitBlocks[i]),\n PE = pred_end(ExitBlocks[i]); PI != PE; ++PI)\n if (!contains(*PI))\n return false;\n \/\/ All the requirements are met.\n return true;\n}\n\n\/\/\/ getUniqueExitBlocks - Return all unique successor blocks of this loop.\n\/\/\/ These are the blocks _outside of the current loop_ which are branched to.\n\/\/\/ This assumes that loop is in canonical form.\n\/\/\/\nvoid\nLoop::getUniqueExitBlocks(SmallVectorImpl<BasicBlock *> &ExitBlocks) const {\n assert(isLoopSimplifyForm() &&\n \"getUniqueExitBlocks assumes the loop is in canonical form!\");\n\n \/\/ Sort the blocks vector so that we can use binary search to do quick\n \/\/ lookups.\n SmallVector<BasicBlock *, 128> LoopBBs(block_begin(), block_end());\n std::sort(LoopBBs.begin(), LoopBBs.end());\n\n std::vector<BasicBlock *> switchExitBlocks;\n\n for (block_iterator BI = block_begin(), BE = block_end(); BI != BE; ++BI) {\n\n BasicBlock *current = *BI;\n switchExitBlocks.clear();\n\n typedef GraphTraits<BasicBlock *> BlockTraits;\n typedef GraphTraits<Inverse<BasicBlock *> > InvBlockTraits;\n for (BlockTraits::ChildIteratorType I =\n BlockTraits::child_begin(*BI), E = BlockTraits::child_end(*BI);\n I != E; ++I) {\n \/\/ If block is inside the loop then it is not a exit block.\n if (std::binary_search(LoopBBs.begin(), LoopBBs.end(), *I))\n continue;\n\n InvBlockTraits::ChildIteratorType PI = InvBlockTraits::child_begin(*I);\n BasicBlock *firstPred = *PI;\n\n \/\/ If current basic block is this exit block's first predecessor\n \/\/ then only insert exit block in to the output ExitBlocks vector.\n \/\/ This ensures that same exit block is not inserted twice into\n \/\/ ExitBlocks vector.\n if (current != firstPred)\n continue;\n\n \/\/ If a terminator has more then two successors, for example SwitchInst,\n \/\/ then it is possible that there are multiple edges from current block\n \/\/ to one exit block.\n if (std::distance(BlockTraits::child_begin(current),\n BlockTraits::child_end(current)) <= 2) {\n ExitBlocks.push_back(*I);\n continue;\n }\n\n \/\/ In case of multiple edges from current block to exit block, collect\n \/\/ only one edge in ExitBlocks. Use switchExitBlocks to keep track of\n \/\/ duplicate edges.\n if (std::find(switchExitBlocks.begin(), switchExitBlocks.end(), *I)\n == switchExitBlocks.end()) {\n switchExitBlocks.push_back(*I);\n ExitBlocks.push_back(*I);\n }\n }\n }\n}\n\n\/\/\/ getUniqueExitBlock - If getUniqueExitBlocks would return exactly one\n\/\/\/ block, return that block. Otherwise return null.\nBasicBlock *Loop::getUniqueExitBlock() const {\n SmallVector<BasicBlock *, 8> UniqueExitBlocks;\n getUniqueExitBlocks(UniqueExitBlocks);\n if (UniqueExitBlocks.size() == 1)\n return UniqueExitBlocks[0];\n return 0;\n}\n\n\/\/===----------------------------------------------------------------------===\/\/\n\/\/ LoopInfo implementation\n\/\/\nbool LoopInfo::runOnFunction(Function &) {\n releaseMemory();\n LI.Calculate(getAnalysis<DominatorTree>().getBase()); \/\/ Update\n return false;\n}\n\nvoid LoopInfo::verifyAnalysis() const {\n for (iterator I = begin(), E = end(); I != E; ++I) {\n assert(!(*I)->getParentLoop() && \"Top-level loop has a parent!\");\n (*I)->verifyLoop();\n }\n}\n\nvoid LoopInfo::getAnalysisUsage(AnalysisUsage &AU) const {\n AU.setPreservesAll();\n AU.addRequired<DominatorTree>();\n}\n\nvoid LoopInfo::print(raw_ostream &OS, const Module*) const {\n LI.print(OS);\n}\n\n<commit_msg>Smallvectorize switchExitBlocks.<commit_after>\/\/===- LoopInfo.cpp - Natural Loop Calculator -----------------------------===\/\/\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 LoopInfo class that is used to identify natural loops\n\/\/ and determine the loop depth of various nodes of the CFG. Note that the\n\/\/ loops identified may actually be several natural loops that share the same\n\/\/ header node... not just a single natural loop.\n\/\/\n\/\/===----------------------------------------------------------------------===\/\/\n\n#include \"llvm\/Analysis\/LoopInfo.h\"\n#include \"llvm\/Constants.h\"\n#include \"llvm\/Instructions.h\"\n#include \"llvm\/Analysis\/Dominators.h\"\n#include \"llvm\/Assembly\/Writer.h\"\n#include \"llvm\/Support\/CFG.h\"\n#include \"llvm\/ADT\/DepthFirstIterator.h\"\n#include \"llvm\/ADT\/SmallPtrSet.h\"\n#include <algorithm>\nusing namespace llvm;\n\nchar LoopInfo::ID = 0;\nstatic RegisterPass<LoopInfo>\nX(\"loops\", \"Natural Loop Information\", true, true);\n\n\/\/===----------------------------------------------------------------------===\/\/\n\/\/ Loop implementation\n\/\/\n\n\/\/\/ isLoopInvariant - Return true if the specified value is loop invariant\n\/\/\/\nbool Loop::isLoopInvariant(Value *V) const {\n if (Instruction *I = dyn_cast<Instruction>(V))\n return isLoopInvariant(I);\n return true; \/\/ All non-instructions are loop invariant\n}\n\n\/\/\/ isLoopInvariant - Return true if the specified instruction is\n\/\/\/ loop-invariant.\n\/\/\/\nbool Loop::isLoopInvariant(Instruction *I) const {\n return !contains(I->getParent());\n}\n\n\/\/\/ makeLoopInvariant - If the given value is an instruciton inside of the\n\/\/\/ loop and it can be hoisted, do so to make it trivially loop-invariant.\n\/\/\/ Return true if the value after any hoisting is loop invariant. This\n\/\/\/ function can be used as a slightly more aggressive replacement for\n\/\/\/ isLoopInvariant.\n\/\/\/\n\/\/\/ If InsertPt is specified, it is the point to hoist instructions to.\n\/\/\/ If null, the terminator of the loop preheader is used.\n\/\/\/\nbool Loop::makeLoopInvariant(Value *V, bool &Changed,\n Instruction *InsertPt) const {\n if (Instruction *I = dyn_cast<Instruction>(V))\n return makeLoopInvariant(I, Changed, InsertPt);\n return true; \/\/ All non-instructions are loop-invariant.\n}\n\n\/\/\/ makeLoopInvariant - If the given instruction is inside of the\n\/\/\/ loop and it can be hoisted, do so to make it trivially loop-invariant.\n\/\/\/ Return true if the instruction after any hoisting is loop invariant. This\n\/\/\/ function can be used as a slightly more aggressive replacement for\n\/\/\/ isLoopInvariant.\n\/\/\/\n\/\/\/ If InsertPt is specified, it is the point to hoist instructions to.\n\/\/\/ If null, the terminator of the loop preheader is used.\n\/\/\/\nbool Loop::makeLoopInvariant(Instruction *I, bool &Changed,\n Instruction *InsertPt) const {\n \/\/ Test if the value is already loop-invariant.\n if (isLoopInvariant(I))\n return true;\n if (!I->isSafeToSpeculativelyExecute())\n return false;\n if (I->mayReadFromMemory())\n return false;\n \/\/ Determine the insertion point, unless one was given.\n if (!InsertPt) {\n BasicBlock *Preheader = getLoopPreheader();\n \/\/ Without a preheader, hoisting is not feasible.\n if (!Preheader)\n return false;\n InsertPt = Preheader->getTerminator();\n }\n \/\/ Don't hoist instructions with loop-variant operands.\n for (unsigned i = 0, e = I->getNumOperands(); i != e; ++i)\n if (!makeLoopInvariant(I->getOperand(i), Changed, InsertPt))\n return false;\n \/\/ Hoist.\n I->moveBefore(InsertPt);\n Changed = true;\n return true;\n}\n\n\/\/\/ getCanonicalInductionVariable - Check to see if the loop has a canonical\n\/\/\/ induction variable: an integer recurrence that starts at 0 and increments\n\/\/\/ by one each time through the loop. If so, return the phi node that\n\/\/\/ corresponds to it.\n\/\/\/\n\/\/\/ The IndVarSimplify pass transforms loops to have a canonical induction\n\/\/\/ variable.\n\/\/\/\nPHINode *Loop::getCanonicalInductionVariable() const {\n BasicBlock *H = getHeader();\n\n BasicBlock *Incoming = 0, *Backedge = 0;\n typedef GraphTraits<Inverse<BasicBlock*> > InvBlockTraits;\n InvBlockTraits::ChildIteratorType PI = InvBlockTraits::child_begin(H);\n assert(PI != InvBlockTraits::child_end(H) &&\n \"Loop must have at least one backedge!\");\n Backedge = *PI++;\n if (PI == InvBlockTraits::child_end(H)) return 0; \/\/ dead loop\n Incoming = *PI++;\n if (PI != InvBlockTraits::child_end(H)) return 0; \/\/ multiple backedges?\n\n if (contains(Incoming)) {\n if (contains(Backedge))\n return 0;\n std::swap(Incoming, Backedge);\n } else if (!contains(Backedge))\n return 0;\n\n \/\/ Loop over all of the PHI nodes, looking for a canonical indvar.\n for (BasicBlock::iterator I = H->begin(); isa<PHINode>(I); ++I) {\n PHINode *PN = cast<PHINode>(I);\n if (ConstantInt *CI =\n dyn_cast<ConstantInt>(PN->getIncomingValueForBlock(Incoming)))\n if (CI->isNullValue())\n if (Instruction *Inc =\n dyn_cast<Instruction>(PN->getIncomingValueForBlock(Backedge)))\n if (Inc->getOpcode() == Instruction::Add &&\n Inc->getOperand(0) == PN)\n if (ConstantInt *CI = dyn_cast<ConstantInt>(Inc->getOperand(1)))\n if (CI->equalsInt(1))\n return PN;\n }\n return 0;\n}\n\n\/\/\/ getCanonicalInductionVariableIncrement - Return the LLVM value that holds\n\/\/\/ the canonical induction variable value for the \"next\" iteration of the\n\/\/\/ loop. This always succeeds if getCanonicalInductionVariable succeeds.\n\/\/\/\nInstruction *Loop::getCanonicalInductionVariableIncrement() const {\n if (PHINode *PN = getCanonicalInductionVariable()) {\n bool P1InLoop = contains(PN->getIncomingBlock(1));\n return cast<Instruction>(PN->getIncomingValue(P1InLoop));\n }\n return 0;\n}\n\n\/\/\/ getTripCount - Return a loop-invariant LLVM value indicating the number of\n\/\/\/ times the loop will be executed. Note that this means that the backedge\n\/\/\/ of the loop executes N-1 times. If the trip-count cannot be determined,\n\/\/\/ this returns null.\n\/\/\/\n\/\/\/ The IndVarSimplify pass transforms loops to have a form that this\n\/\/\/ function easily understands.\n\/\/\/\nValue *Loop::getTripCount() const {\n \/\/ Canonical loops will end with a 'cmp ne I, V', where I is the incremented\n \/\/ canonical induction variable and V is the trip count of the loop.\n Instruction *Inc = getCanonicalInductionVariableIncrement();\n if (Inc == 0) return 0;\n PHINode *IV = cast<PHINode>(Inc->getOperand(0));\n\n BasicBlock *BackedgeBlock =\n IV->getIncomingBlock(contains(IV->getIncomingBlock(1)));\n\n if (BranchInst *BI = dyn_cast<BranchInst>(BackedgeBlock->getTerminator()))\n if (BI->isConditional()) {\n if (ICmpInst *ICI = dyn_cast<ICmpInst>(BI->getCondition())) {\n if (ICI->getOperand(0) == Inc) {\n if (BI->getSuccessor(0) == getHeader()) {\n if (ICI->getPredicate() == ICmpInst::ICMP_NE)\n return ICI->getOperand(1);\n } else if (ICI->getPredicate() == ICmpInst::ICMP_EQ) {\n return ICI->getOperand(1);\n }\n }\n }\n }\n\n return 0;\n}\n\n\/\/\/ getSmallConstantTripCount - Returns the trip count of this loop as a\n\/\/\/ normal unsigned value, if possible. Returns 0 if the trip count is unknown\n\/\/\/ of not constant. Will also return 0 if the trip count is very large\n\/\/\/ (>= 2^32)\nunsigned Loop::getSmallConstantTripCount() const {\n Value* TripCount = this->getTripCount();\n if (TripCount) {\n if (ConstantInt *TripCountC = dyn_cast<ConstantInt>(TripCount)) {\n \/\/ Guard against huge trip counts.\n if (TripCountC->getValue().getActiveBits() <= 32) {\n return (unsigned)TripCountC->getZExtValue();\n }\n }\n }\n return 0;\n}\n\n\/\/\/ getSmallConstantTripMultiple - Returns the largest constant divisor of the\n\/\/\/ trip count of this loop as a normal unsigned value, if possible. This\n\/\/\/ means that the actual trip count is always a multiple of the returned\n\/\/\/ value (don't forget the trip count could very well be zero as well!).\n\/\/\/\n\/\/\/ Returns 1 if the trip count is unknown or not guaranteed to be the\n\/\/\/ multiple of a constant (which is also the case if the trip count is simply\n\/\/\/ constant, use getSmallConstantTripCount for that case), Will also return 1\n\/\/\/ if the trip count is very large (>= 2^32).\nunsigned Loop::getSmallConstantTripMultiple() const {\n Value* TripCount = this->getTripCount();\n \/\/ This will hold the ConstantInt result, if any\n ConstantInt *Result = NULL;\n if (TripCount) {\n \/\/ See if the trip count is constant itself\n Result = dyn_cast<ConstantInt>(TripCount);\n \/\/ if not, see if it is a multiplication\n if (!Result)\n if (BinaryOperator *BO = dyn_cast<BinaryOperator>(TripCount)) {\n switch (BO->getOpcode()) {\n case BinaryOperator::Mul:\n Result = dyn_cast<ConstantInt>(BO->getOperand(1));\n break;\n default:\n break;\n }\n }\n }\n \/\/ Guard against huge trip counts.\n if (Result && Result->getValue().getActiveBits() <= 32) {\n return (unsigned)Result->getZExtValue();\n } else {\n return 1;\n }\n}\n\n\/\/\/ isLCSSAForm - Return true if the Loop is in LCSSA form\nbool Loop::isLCSSAForm() const {\n \/\/ Sort the blocks vector so that we can use binary search to do quick\n \/\/ lookups.\n SmallPtrSet<BasicBlock *, 16> LoopBBs(block_begin(), block_end());\n\n for (block_iterator BI = block_begin(), E = block_end(); BI != E; ++BI) {\n BasicBlock *BB = *BI;\n for (BasicBlock ::iterator I = BB->begin(), E = BB->end(); I != E;++I)\n for (Value::use_iterator UI = I->use_begin(), E = I->use_end(); UI != E;\n ++UI) {\n BasicBlock *UserBB = cast<Instruction>(*UI)->getParent();\n if (PHINode *P = dyn_cast<PHINode>(*UI)) {\n UserBB = P->getIncomingBlock(UI);\n }\n\n \/\/ Check the current block, as a fast-path. Most values are used in\n \/\/ the same block they are defined in.\n if (UserBB != BB && !LoopBBs.count(UserBB))\n return false;\n }\n }\n\n return true;\n}\n\n\/\/\/ isLoopSimplifyForm - Return true if the Loop is in the form that\n\/\/\/ the LoopSimplify form transforms loops to, which is sometimes called\n\/\/\/ normal form.\nbool Loop::isLoopSimplifyForm() const {\n \/\/ Normal-form loops have a preheader.\n if (!getLoopPreheader())\n return false;\n \/\/ Normal-form loops have a single backedge.\n if (!getLoopLatch())\n return false;\n \/\/ Each predecessor of each exit block of a normal loop is contained\n \/\/ within the loop.\n SmallVector<BasicBlock *, 4> ExitBlocks;\n getExitBlocks(ExitBlocks);\n for (unsigned i = 0, e = ExitBlocks.size(); i != e; ++i)\n for (pred_iterator PI = pred_begin(ExitBlocks[i]),\n PE = pred_end(ExitBlocks[i]); PI != PE; ++PI)\n if (!contains(*PI))\n return false;\n \/\/ All the requirements are met.\n return true;\n}\n\n\/\/\/ getUniqueExitBlocks - Return all unique successor blocks of this loop.\n\/\/\/ These are the blocks _outside of the current loop_ which are branched to.\n\/\/\/ This assumes that loop is in canonical form.\n\/\/\/\nvoid\nLoop::getUniqueExitBlocks(SmallVectorImpl<BasicBlock *> &ExitBlocks) const {\n assert(isLoopSimplifyForm() &&\n \"getUniqueExitBlocks assumes the loop is in canonical form!\");\n\n \/\/ Sort the blocks vector so that we can use binary search to do quick\n \/\/ lookups.\n SmallVector<BasicBlock *, 128> LoopBBs(block_begin(), block_end());\n std::sort(LoopBBs.begin(), LoopBBs.end());\n\n SmallVector<BasicBlock *, 32> switchExitBlocks;\n\n for (block_iterator BI = block_begin(), BE = block_end(); BI != BE; ++BI) {\n\n BasicBlock *current = *BI;\n switchExitBlocks.clear();\n\n typedef GraphTraits<BasicBlock *> BlockTraits;\n typedef GraphTraits<Inverse<BasicBlock *> > InvBlockTraits;\n for (BlockTraits::ChildIteratorType I =\n BlockTraits::child_begin(*BI), E = BlockTraits::child_end(*BI);\n I != E; ++I) {\n \/\/ If block is inside the loop then it is not a exit block.\n if (std::binary_search(LoopBBs.begin(), LoopBBs.end(), *I))\n continue;\n\n InvBlockTraits::ChildIteratorType PI = InvBlockTraits::child_begin(*I);\n BasicBlock *firstPred = *PI;\n\n \/\/ If current basic block is this exit block's first predecessor\n \/\/ then only insert exit block in to the output ExitBlocks vector.\n \/\/ This ensures that same exit block is not inserted twice into\n \/\/ ExitBlocks vector.\n if (current != firstPred)\n continue;\n\n \/\/ If a terminator has more then two successors, for example SwitchInst,\n \/\/ then it is possible that there are multiple edges from current block\n \/\/ to one exit block.\n if (std::distance(BlockTraits::child_begin(current),\n BlockTraits::child_end(current)) <= 2) {\n ExitBlocks.push_back(*I);\n continue;\n }\n\n \/\/ In case of multiple edges from current block to exit block, collect\n \/\/ only one edge in ExitBlocks. Use switchExitBlocks to keep track of\n \/\/ duplicate edges.\n if (std::find(switchExitBlocks.begin(), switchExitBlocks.end(), *I)\n == switchExitBlocks.end()) {\n switchExitBlocks.push_back(*I);\n ExitBlocks.push_back(*I);\n }\n }\n }\n}\n\n\/\/\/ getUniqueExitBlock - If getUniqueExitBlocks would return exactly one\n\/\/\/ block, return that block. Otherwise return null.\nBasicBlock *Loop::getUniqueExitBlock() const {\n SmallVector<BasicBlock *, 8> UniqueExitBlocks;\n getUniqueExitBlocks(UniqueExitBlocks);\n if (UniqueExitBlocks.size() == 1)\n return UniqueExitBlocks[0];\n return 0;\n}\n\n\/\/===----------------------------------------------------------------------===\/\/\n\/\/ LoopInfo implementation\n\/\/\nbool LoopInfo::runOnFunction(Function &) {\n releaseMemory();\n LI.Calculate(getAnalysis<DominatorTree>().getBase()); \/\/ Update\n return false;\n}\n\nvoid LoopInfo::verifyAnalysis() const {\n for (iterator I = begin(), E = end(); I != E; ++I) {\n assert(!(*I)->getParentLoop() && \"Top-level loop has a parent!\");\n (*I)->verifyLoop();\n }\n}\n\nvoid LoopInfo::getAnalysisUsage(AnalysisUsage &AU) const {\n AU.setPreservesAll();\n AU.addRequired<DominatorTree>();\n}\n\nvoid LoopInfo::print(raw_ostream &OS, const Module*) const {\n LI.print(OS);\n}\n\n<|endoftext|>"} {"text":"<commit_before>#include <iostream>\n#include <fstream>\n#include <string>\n#include <vector>\n#include <map>\n#include <math.h>\n#include <cstdlib>\n#include <iomanip>\n\n#include \"VerditeWriter.h\"\n#include \"..\/intField.h\"\n#include \"..\/doubleField.h\"\n#include \"..\/progressBar.h\"\n\nVerditeWriter::VerditeWriter(){}\n\nVerditeWriter::~VerditeWriter(){}\n\nstd::string space2comma(std::string text) {\n for(std::string::iterator it = text.begin(); it != text.end(); ++it) {\n if(*it == ' ') {\n *it = ',';\n }\n }\n return text;\n}\n\nvoid VerditeWriter::Write(std::string fname,\n std::map<std::string, std::string> parameters,\n double *positions,\n std::vector<IntField*> intFields,\n std::vector<DoubleField*> doubleFields,\n int dim,\n long numParticles\n )\n{\n std::map<std::string, std::string>::iterator it;\n int progress = 1;\n int j = 0;\n int k = 0;\n\n if(numParticles == 0)\n {\n std::cout << \"Error: Number of particles is 0, exiting\" << std::endl;\n std::exit(1);\n }\n\n ProgressBar pb(intFields.size()+doubleFields.size()+parameters.size()+1,\"Writing output\");\n\n std::ofstream outfile((char*)fname.c_str(), std::ios::out);\n if(outfile.is_open()) \n {\n std::cout << \"Writing to output file...\" << std::flush;\n\n outfile << \"# vtk DataFile Version 1.0\" << std::endl;\n outfile << \"vtk output\" << std::endl;\n outfile << \"ASCII\" << std::endl;\n outfile << \"DATASET POLYDATA\" << std::endl;\n outfile << \"POINTS \" << numParticles << \" float\" << std::endl;\n for ( int i = 0; i<numParticles; i++ ) \/\/ All positions, duplicate this loop to write extra arrays\n {\n j = 3*i;\n outfile << positions[j] << \" \" << positions[j+1] << \" \" << positions[j+2] << std::endl;\n\n\n outfile << \"POINT_DATA \" << numParticles << std::endl;\n\n outfile << \"FIELD FieldData \" << doubleFields.size()+intFields.size() << std::endl;\n\n for (long intf=0; intf < intFields.size(); intf++)\n {\n IntField *thisField = intFields[intf];\n\n outfile << thisField->name << \" \" << thisField->dim << \" \" << numParticles << \" float\" << std::endl;\n\n for ( int i = 0; i<numParticles; i++ )\n {\n\n k= thisField->dim * i;\n\n for( int l=0; l<thisField->dim; l++)\n {\n outfile << \" \" << thisField->data[k+l];\n }\n outfile << std::endl;\n }\n }\n\n for (long intf=0; intf < doubleFields.size(); intf++)\n {\n DoubleField *thisField = doubleFields[intf];\n\n outfile << thisField->name << \" \" << thisField->dim << \" \" << numParticles << \" float\" << std::endl;\n\n for ( int i = 0; i<numParticles; i++ )\n {\n k= thisField->dim * i;\n for( int l=0; l<thisField->dim; l++)\n {\n outfile << \" \" << thisField->data[k+l];\n }\n outfile << std::endl;\n }\n }\n\n outfile.close();\n }\n\n\n std::string fname_par = fname.substr(0, fname.find(\".\", 0));\n fname_par = fname_par + \".par\";\n\n std::ofstream outfile((char*)fname_par.c_str(), std::ios::out);\n if(outfile.is_open()) \n {\n\n outfile << \"numParticles=\" << numParticles << std::endl; \/\/ Number of particles\n\n for ( it = parameters.begin(); it != parameters.end(); it++ ) \/\/ All the parameters defined int he python script\n {\n outfile << it->first << \"=\" << space2comma(it->second) << std::endl;\n }\n\n outfile.close();\n }\n\n pb.Finish();\n}\n}\n<commit_msg>Corrected misplaced bracket in verditeWrtier.<commit_after>#include <iostream>\n#include <fstream>\n#include <string>\n#include <vector>\n#include <map>\n#include <math.h>\n#include <cstdlib>\n#include <iomanip>\n\n#include \"verditeWriter.h\"\n#include \"..\/intField.h\"\n#include \"..\/doubleField.h\"\n#include \"..\/progressBar.h\"\n\nVerditeWriter::VerditeWriter(){}\n\nVerditeWriter::~VerditeWriter(){}\n\nstd::string space2comma(std::string text) {\n for(std::string::iterator it = text.begin(); it != text.end(); ++it) {\n if(*it == ' ') {\n *it = ',';\n }\n }\n return text;\n}\n\nvoid VerditeWriter::Write(std::string fname,\n std::map<std::string, std::string> parameters,\n double *positions,\n std::vector<IntField*> intFields,\n std::vector<DoubleField*> doubleFields,\n int dim,\n long numParticles\n )\n{\n std::map<std::string, std::string>::iterator it;\n int progress = 1;\n int j = 0;\n int k = 0;\n\n if(numParticles == 0)\n {\n std::cout << \"Error: Number of particles is 0, exiting\" << std::endl;\n std::exit(1);\n }\n\n ProgressBar pb(intFields.size()+doubleFields.size()+parameters.size()+1,\"Writing output\");\n\n std::ofstream outfile((char*)fname.c_str(), std::ios::out);\n if(outfile.is_open()) \n {\n std::cout << \"Writing to output file...\" << std::flush;\n\n outfile << \"# vtk DataFile Version 1.0\" << std::endl;\n outfile << \"vtk output\" << std::endl;\n outfile << \"ASCII\" << std::endl;\n outfile << \"DATASET POLYDATA\" << std::endl;\n outfile << \"POINTS \" << numParticles << \" float\" << std::endl;\n for ( int i = 0; i<numParticles; i++ ) \/\/ All positions, duplicate this loop to write extra arrays\n {\n j = 3*i;\n outfile << positions[j] << \" \" << positions[j+1] << \" \" << positions[j+2] << std::endl;\n }\t\n\n outfile << \"POINT_DATA \" << numParticles << std::endl;\n\n outfile << \"FIELD FieldData \" << doubleFields.size()+intFields.size() << std::endl;\n\n for (long intf=0; intf < intFields.size(); intf++)\n {\n IntField *thisField = intFields[intf];\n\n outfile << thisField->name << \" \" << thisField->dim << \" \" << numParticles << \" float\" << std::endl;\n\n for ( int i = 0; i<numParticles; i++ )\n {\n\n k= thisField->dim * i;\n\n for( int l=0; l<thisField->dim; l++)\n {\n outfile << \" \" << thisField->data[k+l];\n }\n outfile << std::endl;\n }\n }\n\n for (long intf=0; intf < doubleFields.size(); intf++)\n {\n DoubleField *thisField = doubleFields[intf];\n\n outfile << thisField->name << \" \" << thisField->dim << \" \" << numParticles << \" float\" << std::endl;\n\n for ( int i = 0; i<numParticles; i++ )\n {\n k= thisField->dim * i;\n for( int l=0; l<thisField->dim; l++)\n {\n outfile << \" \" << thisField->data[k+l];\n }\n outfile << std::endl;\n }\n }\n\n outfile.close();\n }\n\n\n std::string fname_par = fname.substr(0, fname.find(\".\", 0));\n fname_par = fname_par + \".par\";\n\n std::ofstream outfile2((char*)fname_par.c_str(), std::ios::out);\n if(outfile2.is_open()) \n {\n\n outfile2 << \"numParticles=\" << numParticles << std::endl; \/\/ Number of particles\n\n for ( it = parameters.begin(); it != parameters.end(); it++ ) \/\/ All the parameters defined int he python script\n {\n outfile2 << it->first << \"=\" << space2comma(it->second) << std::endl;\n }\n\n outfile2.close();\n }\n\n pb.Finish();\n}\n<|endoftext|>"} {"text":"<commit_before>\/* Copyright 2019 The TensorFlow Authors. All Rights Reserved.\n\nLicensed under the Apache License, Version 2.0 (the \"License\");\nyou may not use this file except in compliance with the License.\nYou may obtain a copy of the License at\n\n http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n\nUnless required by applicable law or agreed to in writing, software\ndistributed under the License is distributed on an \"AS IS\" BASIS,\nWITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\nSee the License for the specific language governing permissions and\nlimitations under the License.\n==============================================================================*\/\n\n#include \"tensorflow\/lite\/tools\/evaluation\/utils.h\"\n\n#include \"tensorflow\/lite\/tools\/delegates\/delegate_provider.h\"\n#if defined(__APPLE__)\n#include \"TargetConditionals.h\"\n#if (TARGET_OS_IPHONE && !TARGET_IPHONE_SIMULATOR) || \\\n (TARGET_OS_OSX && TARGET_CPU_ARM64)\n\/\/ Only enable coreml delegate when using a real iPhone device or Apple Silicon.\n#define REAL_IPHONE_DEVICE\n#include \"tensorflow\/lite\/delegates\/coreml\/coreml_delegate.h\"\n#endif\n#endif\n\n#if !defined(_WIN32)\n#include <dirent.h>\n#endif\n#include <sys\/stat.h>\n\n#include <algorithm>\n#include <fstream>\n#include <memory>\n#include <string>\n\nnamespace tflite {\nnamespace evaluation {\n\nstd::string StripTrailingSlashes(const std::string& path) {\n int end = path.size();\n while (end > 0 && path[end - 1] == '\/') {\n end--;\n }\n return path.substr(0, end);\n}\n\nbool ReadFileLines(const std::string& file_path,\n std::vector<std::string>* lines_output) {\n if (!lines_output) {\n return false;\n }\n std::ifstream stream(file_path.c_str());\n if (!stream) {\n return false;\n }\n std::string line;\n while (std::getline(stream, line)) {\n lines_output->push_back(line);\n }\n return true;\n}\n\n#if !defined(_WIN32)\nTfLiteStatus GetSortedFileNames(\n const std::string& directory, std::vector<std::string>* result,\n const std::unordered_set<std::string>& extensions) {\n DIR* dir;\n struct dirent* ent;\n if (result == nullptr) {\n return kTfLiteError;\n }\n result->clear();\n std::string dir_path = StripTrailingSlashes(directory);\n if ((dir = opendir(dir_path.c_str())) != nullptr) {\n while ((ent = readdir(dir)) != nullptr) {\n if (ent->d_type == DT_DIR) continue;\n std::string filename(std::string(ent->d_name));\n size_t lastdot = filename.find_last_of('.');\n std::string ext = lastdot != std::string::npos ? filename.substr(lastdot)\n : std::string();\n std::transform(ext.begin(), ext.end(), ext.begin(), ::tolower);\n if (!extensions.empty() && extensions.find(ext) == extensions.end()) {\n continue;\n }\n result->emplace_back(dir_path + \"\/\" + filename);\n }\n closedir(dir);\n } else {\n return kTfLiteError;\n }\n std::sort(result->begin(), result->end());\n return kTfLiteOk;\n}\n#endif\n\nTfLiteDelegatePtr CreateNNAPIDelegate() {\n#if defined(__ANDROID__)\n return TfLiteDelegatePtr(\n NnApiDelegate(),\n \/\/ NnApiDelegate() returns a singleton, so provide a no-op deleter.\n [](TfLiteDelegate*) {});\n#else\n return tools::CreateNullDelegate();\n#endif \/\/ defined(__ANDROID__)\n}\n\nTfLiteDelegatePtr CreateNNAPIDelegate(StatefulNnApiDelegate::Options options) {\n#if defined(__ANDROID__)\n return TfLiteDelegatePtr(\n new StatefulNnApiDelegate(options), [](TfLiteDelegate* delegate) {\n delete reinterpret_cast<StatefulNnApiDelegate*>(delegate);\n });\n#else\n return tools::CreateNullDelegate();\n#endif \/\/ defined(__ANDROID__)\n}\n\n#if TFLITE_SUPPORTS_GPU_DELEGATE\nTfLiteDelegatePtr CreateGPUDelegate(TfLiteGpuDelegateOptionsV2* options) {\n return TfLiteDelegatePtr(TfLiteGpuDelegateV2Create(options),\n &TfLiteGpuDelegateV2Delete);\n}\n#endif \/\/ TFLITE_SUPPORTS_GPU_DELEGATE\n\nTfLiteDelegatePtr CreateGPUDelegate() {\n#if TFLITE_SUPPORTS_GPU_DELEGATE\n TfLiteGpuDelegateOptionsV2 options = TfLiteGpuDelegateOptionsV2Default();\n options.inference_priority1 = TFLITE_GPU_INFERENCE_PRIORITY_MIN_LATENCY;\n options.inference_preference =\n TFLITE_GPU_INFERENCE_PREFERENCE_SUSTAINED_SPEED;\n\n return CreateGPUDelegate(&options);\n#else\n return tools::CreateNullDelegate();\n#endif \/\/ TFLITE_SUPPORTS_GPU_DELEGATE\n}\n\nTfLiteDelegatePtr CreateHexagonDelegate(\n const std::string& library_directory_path, bool profiling) {\n#if TFLITE_ENABLE_HEXAGON\n TfLiteHexagonDelegateOptions options = {0};\n options.print_graph_profile = profiling;\n return CreateHexagonDelegate(&options, library_directory_path);\n#else\n return tools::CreateNullDelegate();\n#endif \/\/ TFLITE_ENABLE_HEXAGON\n}\n\n#if TFLITE_ENABLE_HEXAGON\nTfLiteDelegatePtr CreateHexagonDelegate(\n const TfLiteHexagonDelegateOptions* options,\n const std::string& library_directory_path) {\n if (library_directory_path.empty()) {\n TfLiteHexagonInit();\n } else {\n TfLiteHexagonInitWithPath(library_directory_path.c_str());\n }\n\n TfLiteDelegate* delegate = TfLiteHexagonDelegateCreate(options);\n if (!delegate) {\n TfLiteHexagonTearDown();\n return tools::CreateNullDelegate();\n }\n return TfLiteDelegatePtr(delegate, [](TfLiteDelegate* delegate) {\n TfLiteHexagonDelegateDelete(delegate);\n TfLiteHexagonTearDown();\n });\n}\n#endif\n\n#if defined(__s390x__) || defined(TFLITE_WITHOUT_XNNPACK)\nTfLiteDelegatePtr CreateXNNPACKDelegate(int num_threads) {\n return tools::CreateNullDelegate();\n}\n#else\nTfLiteDelegatePtr CreateXNNPACKDelegate() {\n TfLiteXNNPackDelegateOptions xnnpack_options =\n TfLiteXNNPackDelegateOptionsDefault();\n return CreateXNNPACKDelegate(&xnnpack_options);\n}\n\nTfLiteDelegatePtr CreateXNNPACKDelegate(\n const TfLiteXNNPackDelegateOptions* xnnpack_options) {\n auto xnnpack_delegate = TfLiteXNNPackDelegateCreate(xnnpack_options);\n return TfLiteDelegatePtr(xnnpack_delegate, [](TfLiteDelegate* delegate) {\n TfLiteXNNPackDelegateDelete(delegate);\n });\n}\n\nTfLiteDelegatePtr CreateXNNPACKDelegate(int num_threads) {\n auto opts = TfLiteXNNPackDelegateOptionsDefault();\n \/\/ Note that we don't want to use the thread pool for num_threads == 1.\n opts.num_threads = num_threads > 1 ? num_threads : 0;\n return CreateXNNPACKDelegate(&opts);\n}\n\nTfLiteDelegatePtr CreateCoreMlDelegate() {\n#ifdef REAL_IPHONE_DEVICE\n TfLiteCoreMlDelegateOptions coreml_options = {\n .enabled_devices = TfLiteCoreMlDelegateAllDevices};\n TfLiteDelegate* delegate = TfLiteCoreMlDelegateCreate(&coreml_options);\n if (!delegate) {\n return tools::CreateNullDelegate();\n }\n return TfLiteDelegatePtr(delegate, &TfLiteCoreMlDelegateDelete);\n#else\n return tools::CreateNullDelegate();\n#endif\n}\n\n#endif\n} \/\/ namespace evaluation\n} \/\/ namespace tflite\n<commit_msg>lite: Fix Linux build error of \/\/tensorflow\/lite\/tools\/evaluation\/tasks\/inference_diff:run_eval<commit_after>\/* Copyright 2019 The TensorFlow Authors. All Rights Reserved.\n\nLicensed under the Apache License, Version 2.0 (the \"License\");\nyou may not use this file except in compliance with the License.\nYou may obtain a copy of the License at\n\n http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n\nUnless required by applicable law or agreed to in writing, software\ndistributed under the License is distributed on an \"AS IS\" BASIS,\nWITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\nSee the License for the specific language governing permissions and\nlimitations under the License.\n==============================================================================*\/\n\n#include \"tensorflow\/lite\/tools\/evaluation\/utils.h\"\n\n#include \"tensorflow\/lite\/tools\/delegates\/delegate_provider.h\"\n#if defined(__APPLE__)\n#include \"TargetConditionals.h\"\n#if (TARGET_OS_IPHONE && !TARGET_IPHONE_SIMULATOR) || \\\n (TARGET_OS_OSX && TARGET_CPU_ARM64)\n\/\/ Only enable coreml delegate when using a real iPhone device or Apple Silicon.\n#define REAL_IPHONE_DEVICE\n#include \"tensorflow\/lite\/delegates\/coreml\/coreml_delegate.h\"\n#endif\n#endif\n\n#if !defined(_WIN32)\n#include <dirent.h>\n#endif\n#include <sys\/stat.h>\n\n#include <algorithm>\n#include <fstream>\n#include <memory>\n#include <string>\n\nnamespace tflite {\nnamespace evaluation {\n\nstd::string StripTrailingSlashes(const std::string& path) {\n int end = path.size();\n while (end > 0 && path[end - 1] == '\/') {\n end--;\n }\n return path.substr(0, end);\n}\n\nbool ReadFileLines(const std::string& file_path,\n std::vector<std::string>* lines_output) {\n if (!lines_output) {\n return false;\n }\n std::ifstream stream(file_path.c_str());\n if (!stream) {\n return false;\n }\n std::string line;\n while (std::getline(stream, line)) {\n lines_output->push_back(line);\n }\n return true;\n}\n\n#if !defined(_WIN32)\nTfLiteStatus GetSortedFileNames(\n const std::string& directory, std::vector<std::string>* result,\n const std::unordered_set<std::string>& extensions) {\n DIR* dir;\n struct dirent* ent;\n if (result == nullptr) {\n return kTfLiteError;\n }\n result->clear();\n std::string dir_path = StripTrailingSlashes(directory);\n if ((dir = opendir(dir_path.c_str())) != nullptr) {\n while ((ent = readdir(dir)) != nullptr) {\n if (ent->d_type == DT_DIR) continue;\n std::string filename(std::string(ent->d_name));\n size_t lastdot = filename.find_last_of('.');\n std::string ext = lastdot != std::string::npos ? filename.substr(lastdot)\n : std::string();\n std::transform(ext.begin(), ext.end(), ext.begin(), ::tolower);\n if (!extensions.empty() && extensions.find(ext) == extensions.end()) {\n continue;\n }\n result->emplace_back(dir_path + \"\/\" + filename);\n }\n closedir(dir);\n } else {\n return kTfLiteError;\n }\n std::sort(result->begin(), result->end());\n return kTfLiteOk;\n}\n#endif\n\nTfLiteDelegatePtr CreateNNAPIDelegate() {\n#if defined(__ANDROID__)\n return TfLiteDelegatePtr(\n NnApiDelegate(),\n \/\/ NnApiDelegate() returns a singleton, so provide a no-op deleter.\n [](TfLiteDelegate*) {});\n#else\n return tools::CreateNullDelegate();\n#endif \/\/ defined(__ANDROID__)\n}\n\nTfLiteDelegatePtr CreateNNAPIDelegate(StatefulNnApiDelegate::Options options) {\n#if defined(__ANDROID__)\n return TfLiteDelegatePtr(\n new StatefulNnApiDelegate(options), [](TfLiteDelegate* delegate) {\n delete reinterpret_cast<StatefulNnApiDelegate*>(delegate);\n });\n#else\n return tools::CreateNullDelegate();\n#endif \/\/ defined(__ANDROID__)\n}\n\n#if TFLITE_SUPPORTS_GPU_DELEGATE\nTfLiteDelegatePtr CreateGPUDelegate(TfLiteGpuDelegateOptionsV2* options) {\n return TfLiteDelegatePtr(TfLiteGpuDelegateV2Create(options),\n &TfLiteGpuDelegateV2Delete);\n}\n#endif \/\/ TFLITE_SUPPORTS_GPU_DELEGATE\n\nTfLiteDelegatePtr CreateGPUDelegate() {\n#if TFLITE_SUPPORTS_GPU_DELEGATE\n TfLiteGpuDelegateOptionsV2 options = TfLiteGpuDelegateOptionsV2Default();\n options.inference_priority1 = TFLITE_GPU_INFERENCE_PRIORITY_MIN_LATENCY;\n options.inference_preference =\n TFLITE_GPU_INFERENCE_PREFERENCE_SUSTAINED_SPEED;\n\n return CreateGPUDelegate(&options);\n#else\n return tools::CreateNullDelegate();\n#endif \/\/ TFLITE_SUPPORTS_GPU_DELEGATE\n}\n\nTfLiteDelegatePtr CreateHexagonDelegate(\n const std::string& library_directory_path, bool profiling) {\n#if TFLITE_ENABLE_HEXAGON\n TfLiteHexagonDelegateOptions options = {0};\n options.print_graph_profile = profiling;\n return CreateHexagonDelegate(&options, library_directory_path);\n#else\n return tools::CreateNullDelegate();\n#endif \/\/ TFLITE_ENABLE_HEXAGON\n}\n\n#if TFLITE_ENABLE_HEXAGON\nTfLiteDelegatePtr CreateHexagonDelegate(\n const TfLiteHexagonDelegateOptions* options,\n const std::string& library_directory_path) {\n if (library_directory_path.empty()) {\n TfLiteHexagonInit();\n } else {\n TfLiteHexagonInitWithPath(library_directory_path.c_str());\n }\n\n TfLiteDelegate* delegate = TfLiteHexagonDelegateCreate(options);\n if (!delegate) {\n TfLiteHexagonTearDown();\n return tools::CreateNullDelegate();\n }\n return TfLiteDelegatePtr(delegate, [](TfLiteDelegate* delegate) {\n TfLiteHexagonDelegateDelete(delegate);\n TfLiteHexagonTearDown();\n });\n}\n#endif \/\/ TFLITE_ENABLE_HEXAGON\n\n#if defined(__s390x__) || defined(TFLITE_WITHOUT_XNNPACK)\nTfLiteDelegatePtr CreateXNNPACKDelegate(int num_threads) {\n return tools::CreateNullDelegate();\n}\n#else\nTfLiteDelegatePtr CreateXNNPACKDelegate() {\n TfLiteXNNPackDelegateOptions xnnpack_options =\n TfLiteXNNPackDelegateOptionsDefault();\n return CreateXNNPACKDelegate(&xnnpack_options);\n}\n\nTfLiteDelegatePtr CreateXNNPACKDelegate(\n const TfLiteXNNPackDelegateOptions* xnnpack_options) {\n auto xnnpack_delegate = TfLiteXNNPackDelegateCreate(xnnpack_options);\n return TfLiteDelegatePtr(xnnpack_delegate, [](TfLiteDelegate* delegate) {\n TfLiteXNNPackDelegateDelete(delegate);\n });\n}\n\nTfLiteDelegatePtr CreateXNNPACKDelegate(int num_threads) {\n auto opts = TfLiteXNNPackDelegateOptionsDefault();\n \/\/ Note that we don't want to use the thread pool for num_threads == 1.\n opts.num_threads = num_threads > 1 ? num_threads : 0;\n return CreateXNNPACKDelegate(&opts);\n}\n#endif \/\/ defined(__s390x__) || defined(TFLITE_WITHOUT_XNNPACK)\n\nTfLiteDelegatePtr CreateCoreMlDelegate() {\n#ifdef REAL_IPHONE_DEVICE\n TfLiteCoreMlDelegateOptions coreml_options = {\n .enabled_devices = TfLiteCoreMlDelegateAllDevices};\n TfLiteDelegate* delegate = TfLiteCoreMlDelegateCreate(&coreml_options);\n if (!delegate) {\n return tools::CreateNullDelegate();\n }\n return TfLiteDelegatePtr(delegate, &TfLiteCoreMlDelegateDelete);\n#else\n return tools::CreateNullDelegate();\n#endif \/\/ REAL_IPHONE_DEVICE\n}\n\n} \/\/ namespace evaluation\n} \/\/ namespace tflite\n<|endoftext|>"} {"text":"<commit_before>\/\/ Copyright (c) 2018 PaddlePaddle Authors. All Rights Reserved.\n\/\/\n\/\/ Licensed under the Apache License, Version 2.0 (the \"License\");\n\/\/ you may not use this file except in compliance with the License.\n\/\/ You may obtain a copy of the License at\n\/\/\n\/\/ http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n\/\/\n\/\/ Unless required by applicable law or agreed to in writing, software\n\/\/ distributed under the License is distributed on an \"AS IS\" BASIS,\n\/\/ WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n\/\/ See the License for the specific language governing permissions and\n\/\/ limitations under the License.\n\n#include \"paddle\/fluid\/framework\/channel.h\"\n#include \"paddle\/fluid\/operators\/reader\/reader_op_registry.h\"\n\nnamespace paddle {\nnamespace operators {\nnamespace reader {\n\nclass MultiFileReader : public framework::ReaderBase {\n public:\n MultiFileReader(const std::vector<std::string>& file_names,\n const std::vector<framework::DDim>& dims, size_t thread_num,\n size_t buffer_size)\n : file_names_(file_names), dims_(dims), buffer_size_(buffer_size) {\n prefetchers_.resize(thread_num);\n StartNewScheduler();\n }\n\n void ReadNext(std::vector<framework::LoDTensor>* out) override;\n void ReInit() override;\n\n ~MultiFileReader() { EndScheduler(); }\n\n private:\n bool HasNext();\n void StartNewScheduler();\n void EndScheduler();\n void ScheduleThreadFunc();\n void PrefetchThreadFunc(std::string file_name, size_t thread_idx);\n\n std::vector<std::string> file_names_;\n std::vector<framework::DDim> dims_;\n std::thread scheduler_;\n std::vector<std::thread> prefetchers_;\n size_t buffer_size_;\n framework::Channel<size_t>* waiting_file_idx_;\n framework::Channel<size_t>* available_thread_idx_;\n framework::Channel<std::vector<framework::LoDTensor>>* buffer_;\n};\n\nvoid MultiFileReader::ReadNext(std::vector<framework::LoDTensor>* out) {\n out->clear();\n if (HasNext()) {\n buffer_->Receive(out);\n }\n}\n\nvoid MultiFileReader::ReInit() {\n EndScheduler();\n StartNewScheduler();\n}\n\nbool MultiFileReader::HasNext() {\n while (!buffer_->IsClosed() && !buffer_->CanReceive()) {\n }\n return buffer_->CanReceive();\n}\n\nvoid MultiFileReader::StartNewScheduler() {\n size_t thread_num = prefetchers_.size();\n waiting_file_idx_ = framework::MakeChannel<size_t>(file_names_.size());\n available_thread_idx_ = framework::MakeChannel<size_t>(thread_num);\n buffer_ =\n framework::MakeChannel<std::vector<framework::LoDTensor>>(buffer_size_);\n\n for (size_t i = 0; i < file_names_.size(); ++i) {\n waiting_file_idx_->Send(&i);\n }\n waiting_file_idx_->Close();\n for (size_t i = 0; i < thread_num; ++i) {\n available_thread_idx_->Send(&i);\n }\n\n scheduler_ = std::thread([this] { ScheduleThreadFunc(); });\n}\n\nvoid MultiFileReader::EndScheduler() {\n available_thread_idx_->Close();\n buffer_->Close();\n waiting_file_idx_->Close();\n if (scheduler_.joinable()) {\n scheduler_.join();\n }\n delete buffer_;\n delete available_thread_idx_;\n delete waiting_file_idx_;\n}\n\nvoid MultiFileReader::ScheduleThreadFunc() {\n VLOG(5) << \"MultiFileReader schedule thread starts.\";\n size_t completed_thread_num = 0;\n size_t thread_idx;\n while (available_thread_idx_->Receive(&thread_idx)) {\n std::thread& prefetcher = prefetchers_[thread_idx];\n if (prefetcher.joinable()) {\n prefetcher.join();\n }\n size_t file_idx;\n if (waiting_file_idx_->Receive(&file_idx)) {\n \/\/ Still have files to read. Start a new prefetch thread.\n std::string file_name = file_names_[file_idx];\n prefetcher = std::thread([this, file_name, thread_idx] {\n PrefetchThreadFunc(file_name, thread_idx);\n });\n } else {\n \/\/ No more file to read.\n ++completed_thread_num;\n if (completed_thread_num == prefetchers_.size()) {\n buffer_->Close();\n break;\n }\n }\n }\n \/\/ If users invoke ReInit() when scheduler is running, it will close the\n \/\/ 'avaiable_thread_idx_' and prefecther threads have no way to tell scheduler\n \/\/ to release their resource. So a check is needed before scheduler ends.\n for (auto& p : prefetchers_) {\n if (p.joinable()) {\n p.join();\n }\n }\n VLOG(5) << \"MultiFileReader schedule thread terminates.\";\n}\n\nvoid MultiFileReader::PrefetchThreadFunc(std::string file_name,\n size_t thread_idx) {\n VLOG(5) << \"The prefetch thread of file '\" << file_name << \"' starts.\";\n std::unique_ptr<framework::ReaderBase> reader =\n CreateReaderByFileName(file_name, dims_);\n while (true) {\n std::vector<framework::LoDTensor> ins;\n reader->ReadNext(&ins);\n if (ins.empty()) {\n break;\n }\n try {\n buffer_->Send(&ins);\n } catch (paddle::platform::EnforceNotMet e) {\n VLOG(5) << \"WARNING: The buffer channel has been closed. The prefetch \"\n \"thread of file '\"\n << file_name << \"' will terminate.\";\n break;\n }\n }\n\n try {\n available_thread_idx_->Send(&thread_idx);\n } catch (paddle::platform::EnforceNotMet e) {\n VLOG(5) << \"WARNING: The available_thread_idx_ channel has been closed. \"\n \"Fail to send thread_idx.\";\n }\n VLOG(5) << \"The prefetch thread of file '\" << file_name << \"' terminates.\";\n}\n\nclass OpenFilesOp : public framework::OperatorBase {\n public:\n using framework::OperatorBase::OperatorBase;\n\n private:\n void RunImpl(const framework::Scope& scope,\n const platform::Place& dev_place) const override {\n const auto& shape_concat = Attr<std::vector<int>>(\"shape_concat\");\n const auto& ranks = Attr<std::vector<int>>(\"ranks\");\n PADDLE_ENFORCE(!shape_concat.empty() && !ranks.empty());\n PADDLE_ENFORCE_EQ(std::accumulate(ranks.begin(), ranks.end(), 0),\n static_cast<int>(shape_concat.size()),\n \"The accumulate of all ranks should be equal to the \"\n \"shape concat's length.\");\n const auto& file_names = Attr<std::vector<std::string>>(\"file_names\");\n PADDLE_ENFORCE(!file_names.empty(), \"No file to be read!\");\n const size_t thread_num = Attr<int>(\"thread_num\");\n const size_t buffer_size = Attr<int>(\"buffer_size\");\n\n auto* out = scope.FindVar(Output(\"Out\"))\n ->template GetMutable<framework::ReaderHolder>();\n out->Reset(new MultiFileReader(file_names,\n RestoreShapes(shape_concat, ranks),\n thread_num, buffer_size));\n }\n};\n\nclass OpenFilesOpMaker : public FileReaderMakerBase {\n public:\n OpenFilesOpMaker(OpProto* op_proto, OpAttrChecker* op_checker)\n : FileReaderMakerBase(op_proto, op_checker) {\n AddAttr<std::vector<std::string>>(\"file_names\", \"Files to be read.\");\n AddAttr<int>(\"thread_num\", \"The maximal concurrent prefetch thread number.\")\n .GreaterThan(0);\n AddAttr<int>(\"buffer_size\", \"The size of prefetch buffer.\").GreaterThan(0);\n\n AddComment(R\"DOC(\n OpenFiles Operator\n\n An OpenFilesOp creates a MultiFileReader, which is able to \n read data multi-threaded from multiple files.\n )DOC\");\n }\n};\n\n} \/\/ namespace reader\n} \/\/ namespace operators\n} \/\/ namespace paddle\n\nnamespace reader = paddle::operators::reader;\n\nREGISTER_FILE_READER_OPERATOR(open_files, reader::OpenFilesOp,\n reader::OpenFilesOpMaker);\n<commit_msg>Remove Readers' HasNext()<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 <thread> \/\/ NOLINT\n\n#include \"paddle\/fluid\/framework\/channel.h\"\n#include \"paddle\/fluid\/operators\/reader\/reader_op_registry.h\"\n\nnamespace paddle {\nnamespace operators {\nnamespace reader {\n\nclass MultiFileReader : public framework::ReaderBase {\n public:\n MultiFileReader(const std::vector<std::string>& file_names,\n const std::vector<framework::DDim>& dims, size_t thread_num,\n size_t buffer_size)\n : file_names_(file_names), dims_(dims), buffer_size_(buffer_size) {\n prefetchers_.resize(thread_num);\n StartNewScheduler();\n }\n\n void ReadNext(std::vector<framework::LoDTensor>* out) override;\n void ReInit() override;\n\n ~MultiFileReader() { EndScheduler(); }\n\n private:\n bool HasNext();\n void StartNewScheduler();\n void EndScheduler();\n void ScheduleThreadFunc();\n void PrefetchThreadFunc(std::string file_name, size_t thread_idx);\n\n std::vector<std::string> file_names_;\n std::vector<framework::DDim> dims_;\n std::thread scheduler_;\n std::vector<std::thread> prefetchers_;\n size_t buffer_size_;\n framework::Channel<size_t>* waiting_file_idx_;\n framework::Channel<size_t>* available_thread_idx_;\n framework::Channel<std::vector<framework::LoDTensor>>* buffer_;\n};\n\nvoid MultiFileReader::ReadNext(std::vector<framework::LoDTensor>* out) {\n out->clear();\n if (HasNext()) {\n buffer_->Receive(out);\n }\n}\n\nvoid MultiFileReader::ReInit() {\n EndScheduler();\n StartNewScheduler();\n}\n\nbool MultiFileReader::HasNext() {\n while (!buffer_->IsClosed() && !buffer_->CanReceive()) {\n }\n return buffer_->CanReceive();\n}\n\nvoid MultiFileReader::StartNewScheduler() {\n size_t thread_num = prefetchers_.size();\n waiting_file_idx_ = framework::MakeChannel<size_t>(file_names_.size());\n available_thread_idx_ = framework::MakeChannel<size_t>(thread_num);\n buffer_ =\n framework::MakeChannel<std::vector<framework::LoDTensor>>(buffer_size_);\n\n for (size_t i = 0; i < file_names_.size(); ++i) {\n waiting_file_idx_->Send(&i);\n }\n waiting_file_idx_->Close();\n for (size_t i = 0; i < thread_num; ++i) {\n available_thread_idx_->Send(&i);\n }\n\n scheduler_ = std::thread([this] { ScheduleThreadFunc(); });\n}\n\nvoid MultiFileReader::EndScheduler() {\n available_thread_idx_->Close();\n buffer_->Close();\n waiting_file_idx_->Close();\n if (scheduler_.joinable()) {\n scheduler_.join();\n }\n delete buffer_;\n delete available_thread_idx_;\n delete waiting_file_idx_;\n}\n\nvoid MultiFileReader::ScheduleThreadFunc() {\n VLOG(5) << \"MultiFileReader schedule thread starts.\";\n size_t completed_thread_num = 0;\n size_t thread_idx;\n while (available_thread_idx_->Receive(&thread_idx)) {\n std::thread& prefetcher = prefetchers_[thread_idx];\n if (prefetcher.joinable()) {\n prefetcher.join();\n }\n size_t file_idx;\n if (waiting_file_idx_->Receive(&file_idx)) {\n \/\/ Still have files to read. Start a new prefetch thread.\n std::string file_name = file_names_[file_idx];\n prefetcher = std::thread([this, file_name, thread_idx] {\n PrefetchThreadFunc(file_name, thread_idx);\n });\n } else {\n \/\/ No more file to read.\n ++completed_thread_num;\n if (completed_thread_num == prefetchers_.size()) {\n buffer_->Close();\n break;\n }\n }\n }\n \/\/ If users invoke ReInit() when scheduler is running, it will close the\n \/\/ 'avaiable_thread_idx_' and prefecther threads have no way to tell scheduler\n \/\/ to release their resource. So a check is needed before scheduler ends.\n for (auto& p : prefetchers_) {\n if (p.joinable()) {\n p.join();\n }\n }\n VLOG(5) << \"MultiFileReader schedule thread terminates.\";\n}\n\nvoid MultiFileReader::PrefetchThreadFunc(std::string file_name,\n size_t thread_idx) {\n VLOG(5) << \"The prefetch thread of file '\" << file_name << \"' starts.\";\n std::unique_ptr<framework::ReaderBase> reader =\n CreateReaderByFileName(file_name, dims_);\n while (true) {\n std::vector<framework::LoDTensor> ins;\n reader->ReadNext(&ins);\n if (ins.empty()) {\n break;\n }\n try {\n buffer_->Send(&ins);\n } catch (paddle::platform::EnforceNotMet e) {\n VLOG(5) << \"WARNING: The buffer channel has been closed. The prefetch \"\n \"thread of file '\"\n << file_name << \"' will terminate.\";\n break;\n }\n }\n\n try {\n available_thread_idx_->Send(&thread_idx);\n } catch (paddle::platform::EnforceNotMet e) {\n VLOG(5) << \"WARNING: The available_thread_idx_ channel has been closed. \"\n \"Fail to send thread_idx.\";\n }\n VLOG(5) << \"The prefetch thread of file '\" << file_name << \"' terminates.\";\n}\n\nclass OpenFilesOp : public framework::OperatorBase {\n public:\n using framework::OperatorBase::OperatorBase;\n\n private:\n void RunImpl(const framework::Scope& scope,\n const platform::Place& dev_place) const override {\n const auto& shape_concat = Attr<std::vector<int>>(\"shape_concat\");\n const auto& ranks = Attr<std::vector<int>>(\"ranks\");\n PADDLE_ENFORCE(!shape_concat.empty() && !ranks.empty());\n PADDLE_ENFORCE_EQ(std::accumulate(ranks.begin(), ranks.end(), 0),\n static_cast<int>(shape_concat.size()),\n \"The accumulate of all ranks should be equal to the \"\n \"shape concat's length.\");\n const auto& file_names = Attr<std::vector<std::string>>(\"file_names\");\n PADDLE_ENFORCE(!file_names.empty(), \"No file to be read!\");\n const size_t thread_num = Attr<int>(\"thread_num\");\n const size_t buffer_size = Attr<int>(\"buffer_size\");\n\n auto* out = scope.FindVar(Output(\"Out\"))\n ->template GetMutable<framework::ReaderHolder>();\n out->Reset(new MultiFileReader(file_names,\n RestoreShapes(shape_concat, ranks),\n thread_num, buffer_size));\n }\n};\n\nclass OpenFilesOpMaker : public FileReaderMakerBase {\n public:\n OpenFilesOpMaker(OpProto* op_proto, OpAttrChecker* op_checker)\n : FileReaderMakerBase(op_proto, op_checker) {\n AddAttr<std::vector<std::string>>(\"file_names\", \"Files to be read.\");\n AddAttr<int>(\"thread_num\", \"The maximal concurrent prefetch thread number.\")\n .GreaterThan(0);\n AddAttr<int>(\"buffer_size\", \"The size of prefetch buffer.\").GreaterThan(0);\n\n AddComment(R\"DOC(\n OpenFiles Operator\n\n An OpenFilesOp creates a MultiFileReader, which is able to \n read data multi-threaded from multiple files.\n )DOC\");\n }\n};\n\n} \/\/ namespace reader\n} \/\/ namespace operators\n} \/\/ namespace paddle\n\nnamespace reader = paddle::operators::reader;\n\nREGISTER_FILE_READER_OPERATOR(open_files, reader::OpenFilesOp,\n reader::OpenFilesOpMaker);\n<|endoftext|>"} {"text":"<commit_before>\/* This file is part of the KDE libraries\n Copyright (C) 2010 Dominik Haumann <dhaumann 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 \"hlselectionplugin.h\"\n#include \"hlselectionplugin.moc\"\n\n#include <ktexteditor\/document.h>\n#include <ktexteditor\/attribute.h>\n#include <ktexteditor\/searchinterface.h>\n#include <ktexteditor\/movinginterface.h>\n#include <ktexteditor\/movingrange.h>\n\n#include <assert.h>\n#include <kaction.h>\n#include <kactioncollection.h>\n#include <kfiledialog.h>\n#include <kpluginfactory.h>\n#include <kpluginloader.h>\n#include <klocale.h>\n#include <kaboutdata.h>\n\n\nK_PLUGIN_FACTORY( HighlightSelectionPluginFactory, registerPlugin<HighlightSelectionPlugin>(); )\nK_EXPORT_PLUGIN( HighlightSelectionPluginFactory( KAboutData( \"ktexteditor_insertfile\", \"ktexteditor_plugins\", ki18n(\"Highlight Selection\"), \"1.0\", ki18n(\"Highlight Selection\"), KAboutData::License_LGPL_V2 ) ) )\n\n\/\/BEGIN HighlightSelectionPlugin\nHighlightSelectionPlugin::HighlightSelectionPlugin( QObject *parent, const QVariantList& )\n : KTextEditor::Plugin ( parent )\n{\n}\n\nHighlightSelectionPlugin::~HighlightSelectionPlugin()\n{\n}\n\nvoid HighlightSelectionPlugin::addView(KTextEditor::View *view)\n{\n HighlightSelectionPluginView *nview = new HighlightSelectionPluginView (view);\n m_views.append (nview);\n}\n\nvoid HighlightSelectionPlugin::removeView(KTextEditor::View *view)\n{\n foreach (HighlightSelectionPluginView *pluginView, m_views) {\n if (pluginView->view() == view) {\n m_views.removeAll(pluginView);\n delete pluginView;\n break;\n }\n }\n}\n\/\/END HighlightSelectionPlugin\n\n\/\/BEGIN HighlightSelectionPluginView\nHighlightSelectionPluginView::HighlightSelectionPluginView( KTextEditor::View *view)\n : QObject( view )\n\/\/ , KXMLGUIClient( view ) \/\/ XMLGUI stuff not needed right now\n{\n setObjectName(\"highlight-selection-plugin\");\n\n m_view = view;\n\n \/\/ we don't need any XMLGUI stuff, so comment out\n\/\/ setComponentData( HighlightSelectionPluginFactory::componentData() );\n\/\/ setXMLFile( \"ktexteditor_hlselectionui.rc\" );\n\n connect(view, SIGNAL(selectionChanged(KTextEditor::View*)), this, SLOT(selectionChanged()));\n connect(view->document(), SIGNAL(aboutToReload(KTextEditor::Document*)), this, SLOT(clearHighlights()));\n}\n\nHighlightSelectionPluginView::~HighlightSelectionPluginView()\n{\n clearHighlights();\n}\n\nKTextEditor::View* HighlightSelectionPluginView::view() const\n{\n return m_view;\n}\n\nvoid HighlightSelectionPluginView::clearHighlights()\n{\n qDeleteAll(m_ranges);\n m_ranges.clear();\n m_currentText.clear();\n}\n\nvoid HighlightSelectionPluginView::selectionChanged()\n{\n QString text;\n \/\/ if text of selection is still the same, abort\n if (m_view->selection() && m_view->selectionRange().onSingleLine()) {\n text = m_view->selectionText();\n if (text == m_currentText) {\n return;\n }\n }\n\n \/\/ text changed: remove all highlights + create new ones\n \/\/ (do not call clearHighlights(), since this also resets the m_currentText\n qDeleteAll(m_ranges);\n m_ranges.clear();\n \n \/\/ do not highlight strings with leading and trailing spaces\n if (!text.isEmpty() && (text.at(0).isSpace() || text.at(text.length()-1).isSpace())) {\n return; \n }\n\n m_currentText = text;\n if (!m_currentText.isEmpty()) {\n createHighlights();\n }\n}\n\nvoid HighlightSelectionPluginView::createHighlights()\n{\n m_currentText = m_view->selectionText();\n\n KTextEditor::SearchInterface* siface =\n qobject_cast<KTextEditor::SearchInterface*>(m_view->document());\n\n if (!siface) {\n return;\n }\n\n KTextEditor::MovingInterface* miface =\n qobject_cast<KTextEditor::MovingInterface*>(m_view->document());\n\n KTextEditor::Attribute::Ptr attr(new KTextEditor::Attribute());\n attr->setFontBold(true);\n attr->setBackground(Qt::yellow);\n\n KTextEditor::Cursor start(0, 0);\n KTextEditor::Range searchRange;\n\n QVector<KTextEditor::Range> matches;\n\n do {\n searchRange.setRange(start, m_view->document()->documentEnd());\n\n matches = siface->searchText(searchRange, m_currentText, KTextEditor::Search::WholeWords);\n\n if (matches.first().isValid()) {\n KTextEditor::MovingRange* mr = miface->newMovingRange(matches.first());\n mr->setAttribute(attr);\n mr->setView(m_view);\n mr->setAttributeOnlyForViews(true);\n m_ranges.append(mr);\n start = matches.first().end();\n }\n } while (matches.first().isValid());\n}\n\/\/END HighlightSelectionPluginView\n\n\/\/ kate: space-indent on; indent-width 2; replace-tabs on;\n<commit_msg>SVN commit 1210354 by zwabel:<commit_after>\/* This file is part of the KDE libraries\n Copyright (C) 2010 Dominik Haumann <dhaumann 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 \"hlselectionplugin.h\"\n#include \"hlselectionplugin.moc\"\n\n#include <ktexteditor\/document.h>\n#include <ktexteditor\/attribute.h>\n#include <ktexteditor\/searchinterface.h>\n#include <ktexteditor\/movinginterface.h>\n#include <ktexteditor\/movingrange.h>\n\n#include <assert.h>\n#include <kaction.h>\n#include <kactioncollection.h>\n#include <kfiledialog.h>\n#include <kpluginfactory.h>\n#include <kpluginloader.h>\n#include <klocale.h>\n#include <kaboutdata.h>\n\n\nK_PLUGIN_FACTORY( HighlightSelectionPluginFactory, registerPlugin<HighlightSelectionPlugin>(); )\nK_EXPORT_PLUGIN( HighlightSelectionPluginFactory( KAboutData( \"ktexteditor_insertfile\", \"ktexteditor_plugins\", ki18n(\"Highlight Selection\"), \"1.0\", ki18n(\"Highlight Selection\"), KAboutData::License_LGPL_V2 ) ) )\n\n\/\/BEGIN HighlightSelectionPlugin\nHighlightSelectionPlugin::HighlightSelectionPlugin( QObject *parent, const QVariantList& )\n : KTextEditor::Plugin ( parent )\n{\n}\n\nHighlightSelectionPlugin::~HighlightSelectionPlugin()\n{\n}\n\nvoid HighlightSelectionPlugin::addView(KTextEditor::View *view)\n{\n HighlightSelectionPluginView *nview = new HighlightSelectionPluginView (view);\n m_views.append (nview);\n}\n\nvoid HighlightSelectionPlugin::removeView(KTextEditor::View *view)\n{\n foreach (HighlightSelectionPluginView *pluginView, m_views) {\n if (pluginView->view() == view) {\n m_views.removeAll(pluginView);\n delete pluginView;\n break;\n }\n }\n}\n\/\/END HighlightSelectionPlugin\n\n\/\/BEGIN HighlightSelectionPluginView\nHighlightSelectionPluginView::HighlightSelectionPluginView( KTextEditor::View *view)\n : QObject( view )\n\/\/ , KXMLGUIClient( view ) \/\/ XMLGUI stuff not needed right now\n{\n setObjectName(\"highlight-selection-plugin\");\n\n m_view = view;\n\n \/\/ we don't need any XMLGUI stuff, so comment out\n\/\/ setComponentData( HighlightSelectionPluginFactory::componentData() );\n\/\/ setXMLFile( \"ktexteditor_hlselectionui.rc\" );\n\n connect(view, SIGNAL(selectionChanged(KTextEditor::View*)), this, SLOT(selectionChanged()));\n connect(view->document(), SIGNAL(aboutToReload(KTextEditor::Document*)), this, SLOT(clearHighlights()));\n}\n\nHighlightSelectionPluginView::~HighlightSelectionPluginView()\n{\n clearHighlights();\n}\n\nKTextEditor::View* HighlightSelectionPluginView::view() const\n{\n return m_view;\n}\n\nvoid HighlightSelectionPluginView::clearHighlights()\n{\n qDeleteAll(m_ranges);\n m_ranges.clear();\n m_currentText.clear();\n}\n\nvoid HighlightSelectionPluginView::selectionChanged()\n{\n QString text;\n \/\/ if text of selection is still the same, abort\n if (m_view->selection() && m_view->selectionRange().onSingleLine()) {\n text = m_view->selectionText();\n if (text == m_currentText) {\n return;\n }\n }\n\n \/\/ text changed: remove all highlights + create new ones\n \/\/ (do not call clearHighlights(), since this also resets the m_currentText\n qDeleteAll(m_ranges);\n m_ranges.clear();\n \n \/\/ do not highlight strings with leading and trailing spaces\n if (!text.isEmpty() && (text.at(0).isSpace() || text.at(text.length()-1).isSpace())) {\n return; \n }\n\n m_currentText = text;\n if (!m_currentText.isEmpty()) {\n createHighlights();\n }\n}\n\nvoid HighlightSelectionPluginView::createHighlights()\n{\n m_currentText = m_view->selectionText();\n\n KTextEditor::SearchInterface* siface =\n qobject_cast<KTextEditor::SearchInterface*>(m_view->document());\n\n if (!siface) {\n return;\n }\n\n KTextEditor::MovingInterface* miface =\n qobject_cast<KTextEditor::MovingInterface*>(m_view->document());\n\n KTextEditor::Attribute::Ptr attr(new KTextEditor::Attribute());\n attr->setFontBold(true);\n attr->setBackground(Qt::yellow);\n\n KTextEditor::Cursor start(0, 0);\n KTextEditor::Range searchRange;\n\n QVector<KTextEditor::Range> matches;\n\n do {\n searchRange.setRange(start, m_view->document()->documentEnd());\n\n matches = siface->searchText(searchRange, m_currentText, KTextEditor::Search::WholeWords);\n\n if (matches.first().isValid()) {\n KTextEditor::MovingRange* mr = miface->newMovingRange(matches.first());\n mr->setAttribute(attr);\n mr->setView(m_view);\n mr->setZDepth(-90000.0); \/\/ Set the z-depth to slightly worse than the selection\n mr->setAttributeOnlyForViews(true);\n m_ranges.append(mr);\n start = matches.first().end();\n }\n } while (matches.first().isValid());\n}\n\/\/END HighlightSelectionPluginView\n\n\/\/ kate: space-indent on; indent-width 2; replace-tabs on;\n<|endoftext|>"} {"text":"<commit_before>#include <iostream>\n#include <boost\/numeric\/odeint.hpp>\n#include <vexcl\/generator\/symbolic.hpp>\n\nnamespace odeint = boost::numeric::odeint;\n\ntypedef double value_type;\ntypedef vex::generator::symbolic<value_type> state_type;\n\nnamespace boost { namespace numeric { namespace odeint {\n\ntemplate<>\nstruct is_resizeable< state_type > : boost::true_type { };\n\ntemplate<>\nstruct resize_impl< state_type , state_type >\n{\n static void resize( state_type &x1 , const state_type &x2 )\n {\n }\n};\n\ntemplate<>\nstruct same_size_impl< state_type , state_type >\n{\n static bool same_size( const state_type &x1 , const state_type &x2 )\n {\n return true;\n }\n};\n\n} } }\n\nvoid sys_func(const state_type &x, state_type &dxdt, value_type t) {\n dxdt = x;\n}\n\nint main() {\n state_type::set_output(std::cout);\n\n state_type x(false);\n\n odeint::runge_kutta4<\n\t state_type , value_type , state_type , value_type ,\n\t odeint::vector_space_algebra, odeint::default_operations\n\t > stepper;\n\n odeint::integrate_const( stepper, sys_func, x , 0.0 , 0.1 , 0.1 );\n}\n<commit_msg>error in sys_func<commit_after>#include <iostream>\n#include <boost\/numeric\/odeint.hpp>\n#include <vexcl\/generator\/symbolic.hpp>\n\nnamespace odeint = boost::numeric::odeint;\n\ntypedef double value_type;\ntypedef vex::generator::symbolic<value_type> state_type;\n\nnamespace boost { namespace numeric { namespace odeint {\n\ntemplate<>\nstruct is_resizeable< state_type > : boost::true_type { };\n\ntemplate<>\nstruct resize_impl< state_type , state_type >\n{\n static void resize( state_type &x1 , const state_type &x2 )\n {\n }\n};\n\ntemplate<>\nstruct same_size_impl< state_type , state_type >\n{\n static bool same_size( const state_type &x1 , const state_type &x2 )\n {\n return true;\n }\n};\n\n} } }\n\nvoid sys_func(const state_type &x, state_type &dxdt, value_type t) {\n dxdt = 42 * x;\n}\n\nint main() {\n state_type::set_output(std::cout);\n\n state_type x(false);\n\n odeint::runge_kutta4<\n\t state_type , value_type , state_type , value_type ,\n\t odeint::vector_space_algebra, odeint::default_operations\n\t > stepper;\n\n odeint::integrate_const( stepper, sys_func, x , 0.0 , 0.1 , 0.1 );\n}\n<|endoftext|>"} {"text":"<commit_before>\/*\n * Copyright 2011, Blender Foundation.\n *\n * This program is free software; you can redistribute it and\/or\n * modify it under the terms of the GNU General Public License\n * as published by the Free Software Foundation; either version 2\n * of the License, or (at your option) any later version.\n *\n * This program is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the\n * GNU General Public License for more details.\n *\n * You should have received a copy of the GNU General Public License\n * along with this program; if not, write to the Free Software Foundation,\n * Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA.\n *\/\n\n#include \"device.h\"\n#include \"integrator.h\"\n#include \"light.h\"\n#include \"scene.h\"\n#include \"sobol.h\"\n\n#include \"util_foreach.h\"\n#include \"util_hash.h\"\n\nCCL_NAMESPACE_BEGIN\n\nIntegrator::Integrator()\n{\n\tmin_bounce = 2;\n\tmax_bounce = 7;\n\n\tmax_diffuse_bounce = max_bounce;\n\tmax_glossy_bounce = max_bounce;\n\tmax_transmission_bounce = max_bounce;\n\tprobalistic_termination = true;\n\n\ttransparent_min_bounce = min_bounce;\n\ttransparent_max_bounce = max_bounce;\n\ttransparent_probalistic = true;\n\ttransparent_shadows = false;\n\n\tno_caustics = false;\n\tfilter_glossy = 0.0f;\n\tseed = 0;\n\tlayer_flag = ~0;\n\tsample_clamp = 0.0f;\n\tmotion_blur = false;\n\n\tdiffuse_samples = 1;\n\tglossy_samples = 1;\n\ttransmission_samples = 1;\n\tao_samples = 1;\n\tmesh_light_samples = 1;\n\tprogressive = true;\n\n\tneed_update = true;\n}\n\nIntegrator::~Integrator()\n{\n}\n\nvoid Integrator::device_update(Device *device, DeviceScene *dscene, Scene *scene)\n{\n\tif(!need_update)\n\t\treturn;\n\n\tdevice_free(device, dscene);\n\n\tKernelIntegrator *kintegrator = &dscene->data.integrator;\n\n\t\/* integrator parameters *\/\n\tkintegrator->max_bounce = max_bounce + 1;\n\tif(probalistic_termination)\n\t\tkintegrator->min_bounce = min_bounce + 1;\n\telse\n\t\tkintegrator->min_bounce = kintegrator->max_bounce;\n\n\tkintegrator->max_diffuse_bounce = max_diffuse_bounce + 1;\n\tkintegrator->max_glossy_bounce = max_glossy_bounce + 1;\n\tkintegrator->max_transmission_bounce = max_transmission_bounce + 1;\n\n\tkintegrator->transparent_max_bounce = transparent_max_bounce + 1;\n\tif(transparent_probalistic)\n\t\tkintegrator->transparent_min_bounce = transparent_min_bounce + 1;\n\telse\n\t\tkintegrator->transparent_min_bounce = kintegrator->transparent_max_bounce;\n\n\tkintegrator->transparent_shadows = transparent_shadows;\n\n\tkintegrator->no_caustics = no_caustics;\n\tkintegrator->filter_glossy = (filter_glossy == 0.0f)? FLT_MAX: 1.0f\/filter_glossy;\n\n\tkintegrator->seed = hash_int(seed);\n\tkintegrator->layer_flag = layer_flag << PATH_RAY_LAYER_SHIFT;\n\n\tkintegrator->use_ambient_occlusion =\n\t\t((dscene->data.film.pass_flag & PASS_AO) || dscene->data.background.ao_factor != 0.0f);\n\t\n\tkintegrator->sample_clamp = (sample_clamp == 0.0f)? FLT_MAX: sample_clamp*3.0f;\n\n\tkintegrator->progressive = progressive;\n\tkintegrator->diffuse_samples = diffuse_samples;\n\tkintegrator->glossy_samples = glossy_samples;\n\tkintegrator->transmission_samples = transmission_samples;\n\tkintegrator->ao_samples = ao_samples;\n\tkintegrator->mesh_light_samples = mesh_light_samples;\n\n\t\/* sobol directions table *\/\n\tint max_samples = 1;\n\n\tif(!progressive) {\n\t\tforeach(Light *light, scene->lights)\n\t\t\tmax_samples = max(max_samples, light->samples);\n\n\t\tmax_samples = max(max_samples, max(diffuse_samples, max(glossy_samples, transmission_samples)));\n\t\tmax_samples = max(max_samples, max(ao_samples, mesh_light_samples));\n\t}\n\n\tmax_samples *= (max_bounce + transparent_max_bounce + 2);\n\n\tint dimensions = PRNG_BASE_NUM + max_samples*PRNG_BOUNCE_NUM;\n\tuint *directions = dscene->sobol_directions.resize(SOBOL_BITS*dimensions);\n\n\tsobol_generate_direction_vectors((uint(*)[SOBOL_BITS])directions, dimensions);\n\n\tdevice->tex_alloc(\"__sobol_directions\", dscene->sobol_directions);\n\n\tneed_update = false;\n}\n\nvoid Integrator::device_free(Device *device, DeviceScene *dscene)\n{\n\tdevice->tex_free(dscene->sobol_directions);\n\tdscene->sobol_directions.clear();\n}\n\nbool Integrator::modified(const Integrator& integrator)\n{\n\treturn !(min_bounce == integrator.min_bounce &&\n\t\tmax_bounce == integrator.max_bounce &&\n\t\tmax_diffuse_bounce == integrator.max_diffuse_bounce &&\n\t\tmax_glossy_bounce == integrator.max_glossy_bounce &&\n\t\tmax_transmission_bounce == integrator.max_transmission_bounce &&\n\t\tprobalistic_termination == integrator.probalistic_termination &&\n\t\ttransparent_min_bounce == integrator.transparent_min_bounce &&\n\t\ttransparent_max_bounce == integrator.transparent_max_bounce &&\n\t\ttransparent_probalistic == integrator.transparent_probalistic &&\n\t\ttransparent_shadows == integrator.transparent_shadows &&\n\t\tno_caustics == integrator.no_caustics &&\n\t\tfilter_glossy == integrator.filter_glossy &&\n\t\tlayer_flag == integrator.layer_flag &&\n\t\tseed == integrator.seed &&\n\t\tsample_clamp == integrator.sample_clamp &&\n\t\tprogressive == integrator.progressive &&\n\t\tdiffuse_samples == integrator.diffuse_samples &&\n\t\tglossy_samples == integrator.glossy_samples &&\n\t\ttransmission_samples == integrator.transmission_samples &&\n\t\tao_samples == integrator.ao_samples &&\n\t\tmesh_light_samples == integrator.mesh_light_samples &&\n\t\tmotion_blur == integrator.motion_blur);\n}\n\nvoid Integrator::tag_update(Scene *scene)\n{\n\tneed_update = true;\n}\n\nCCL_NAMESPACE_END\n\n<commit_msg>Fix #32018: non-progressive integrator crash.<commit_after>\/*\n * Copyright 2011, Blender Foundation.\n *\n * This program is free software; you can redistribute it and\/or\n * modify it under the terms of the GNU General Public License\n * as published by the Free Software Foundation; either version 2\n * of the License, or (at your option) any later version.\n *\n * This program is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the\n * GNU General Public License for more details.\n *\n * You should have received a copy of the GNU General Public License\n * along with this program; if not, write to the Free Software Foundation,\n * Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA.\n *\/\n\n#include \"device.h\"\n#include \"integrator.h\"\n#include \"light.h\"\n#include \"scene.h\"\n#include \"sobol.h\"\n\n#include \"util_foreach.h\"\n#include \"util_hash.h\"\n\nCCL_NAMESPACE_BEGIN\n\nIntegrator::Integrator()\n{\n\tmin_bounce = 2;\n\tmax_bounce = 7;\n\n\tmax_diffuse_bounce = max_bounce;\n\tmax_glossy_bounce = max_bounce;\n\tmax_transmission_bounce = max_bounce;\n\tprobalistic_termination = true;\n\n\ttransparent_min_bounce = min_bounce;\n\ttransparent_max_bounce = max_bounce;\n\ttransparent_probalistic = true;\n\ttransparent_shadows = false;\n\n\tno_caustics = false;\n\tfilter_glossy = 0.0f;\n\tseed = 0;\n\tlayer_flag = ~0;\n\tsample_clamp = 0.0f;\n\tmotion_blur = false;\n\n\tdiffuse_samples = 1;\n\tglossy_samples = 1;\n\ttransmission_samples = 1;\n\tao_samples = 1;\n\tmesh_light_samples = 1;\n\tprogressive = true;\n\n\tneed_update = true;\n}\n\nIntegrator::~Integrator()\n{\n}\n\nvoid Integrator::device_update(Device *device, DeviceScene *dscene, Scene *scene)\n{\n\tif(!need_update)\n\t\treturn;\n\n\tdevice_free(device, dscene);\n\n\tKernelIntegrator *kintegrator = &dscene->data.integrator;\n\n\t\/* integrator parameters *\/\n\tkintegrator->max_bounce = max_bounce + 1;\n\tif(probalistic_termination)\n\t\tkintegrator->min_bounce = min_bounce + 1;\n\telse\n\t\tkintegrator->min_bounce = kintegrator->max_bounce;\n\n\tkintegrator->max_diffuse_bounce = max_diffuse_bounce + 1;\n\tkintegrator->max_glossy_bounce = max_glossy_bounce + 1;\n\tkintegrator->max_transmission_bounce = max_transmission_bounce + 1;\n\n\tkintegrator->transparent_max_bounce = transparent_max_bounce + 1;\n\tif(transparent_probalistic)\n\t\tkintegrator->transparent_min_bounce = transparent_min_bounce + 1;\n\telse\n\t\tkintegrator->transparent_min_bounce = kintegrator->transparent_max_bounce;\n\n\tkintegrator->transparent_shadows = transparent_shadows;\n\n\tkintegrator->no_caustics = no_caustics;\n\tkintegrator->filter_glossy = (filter_glossy == 0.0f)? FLT_MAX: 1.0f\/filter_glossy;\n\n\tkintegrator->seed = hash_int(seed);\n\tkintegrator->layer_flag = layer_flag << PATH_RAY_LAYER_SHIFT;\n\n\tkintegrator->use_ambient_occlusion =\n\t\t((dscene->data.film.pass_flag & PASS_AO) || dscene->data.background.ao_factor != 0.0f);\n\t\n\tkintegrator->sample_clamp = (sample_clamp == 0.0f)? FLT_MAX: sample_clamp*3.0f;\n\n\tkintegrator->progressive = progressive;\n\tkintegrator->diffuse_samples = diffuse_samples;\n\tkintegrator->glossy_samples = glossy_samples;\n\tkintegrator->transmission_samples = transmission_samples;\n\tkintegrator->ao_samples = ao_samples;\n\tkintegrator->mesh_light_samples = mesh_light_samples;\n\n\t\/* sobol directions table *\/\n\tint max_samples = 1;\n\n\tif(!progressive) {\n\t\tforeach(Light *light, scene->lights)\n\t\t\tmax_samples = max(max_samples, light->samples);\n\n\t\tmax_samples = max(max_samples, max(diffuse_samples, max(glossy_samples, transmission_samples)));\n\t\tmax_samples = max(max_samples, max(ao_samples, mesh_light_samples));\n\t}\n\n\tmax_samples *= (max_bounce + transparent_max_bounce + 2);\n\n\tint dimensions = PRNG_BASE_NUM + max_samples*PRNG_BOUNCE_NUM;\n\tdimensions = min(dimensions, SOBOL_MAX_DIMENSIONS);\n\n\tuint *directions = dscene->sobol_directions.resize(SOBOL_BITS*dimensions);\n\n\tsobol_generate_direction_vectors((uint(*)[SOBOL_BITS])directions, dimensions);\n\n\tdevice->tex_alloc(\"__sobol_directions\", dscene->sobol_directions);\n\n\tneed_update = false;\n}\n\nvoid Integrator::device_free(Device *device, DeviceScene *dscene)\n{\n\tdevice->tex_free(dscene->sobol_directions);\n\tdscene->sobol_directions.clear();\n}\n\nbool Integrator::modified(const Integrator& integrator)\n{\n\treturn !(min_bounce == integrator.min_bounce &&\n\t\tmax_bounce == integrator.max_bounce &&\n\t\tmax_diffuse_bounce == integrator.max_diffuse_bounce &&\n\t\tmax_glossy_bounce == integrator.max_glossy_bounce &&\n\t\tmax_transmission_bounce == integrator.max_transmission_bounce &&\n\t\tprobalistic_termination == integrator.probalistic_termination &&\n\t\ttransparent_min_bounce == integrator.transparent_min_bounce &&\n\t\ttransparent_max_bounce == integrator.transparent_max_bounce &&\n\t\ttransparent_probalistic == integrator.transparent_probalistic &&\n\t\ttransparent_shadows == integrator.transparent_shadows &&\n\t\tno_caustics == integrator.no_caustics &&\n\t\tfilter_glossy == integrator.filter_glossy &&\n\t\tlayer_flag == integrator.layer_flag &&\n\t\tseed == integrator.seed &&\n\t\tsample_clamp == integrator.sample_clamp &&\n\t\tprogressive == integrator.progressive &&\n\t\tdiffuse_samples == integrator.diffuse_samples &&\n\t\tglossy_samples == integrator.glossy_samples &&\n\t\ttransmission_samples == integrator.transmission_samples &&\n\t\tao_samples == integrator.ao_samples &&\n\t\tmesh_light_samples == integrator.mesh_light_samples &&\n\t\tmotion_blur == integrator.motion_blur);\n}\n\nvoid Integrator::tag_update(Scene *scene)\n{\n\tneed_update = true;\n}\n\nCCL_NAMESPACE_END\n\n<|endoftext|>"} {"text":"<commit_before>\/*************************************************************************\n *\n * OpenOffice.org - a multi-platform office productivity suite\n *\n * $RCSfile: KStatement.hxx,v $\n *\n * $Revision: 1.3 $\n *\n * last change: $Author: kz $ $Date: 2006-07-06 14:21:35 $\n *\n * The Contents of this file are made available subject to\n * the terms of GNU Lesser General Public License Version 2.1.\n *\n *\n * GNU Lesser General Public License Version 2.1\n * =============================================\n * Copyright 2005 by Sun Microsystems, Inc.\n * 901 San Antonio Road, Palo Alto, CA 94303, USA\n *\n * This library is free software; you can redistribute it and\/or\n * modify it under the terms of the GNU Lesser General Public\n * License version 2.1, as published by the Free Software Foundation.\n *\n * This library is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU\n * Lesser General Public License for more details.\n *\n * You should have received a copy of the GNU Lesser General Public\n * License along with this library; if not, write to the Free Software\n * Foundation, Inc., 59 Temple Place, Suite 330, Boston,\n * MA 02111-1307 USA\n *\n ************************************************************************\/\n\n#ifndef _CONNECTIVITY_KAB_STATEMENT_HXX_\n#define _CONNECTIVITY_KAB_STATEMENT_HXX_\n\n#ifndef _CONNECTIVITY_KAB_CONNECTION_HXX_\n#include \"KConnection.hxx\"\n#endif\n#include <list>\n\n#ifndef _CONNECTIVITY_PARSE_SQLITERATOR_HXX_\n#include \"connectivity\/sqliterator.hxx\"\n#endif\n#ifndef _CONNECTIVITY_PARSE_SQLPARSE_HXX_\n#include \"connectivity\/sqlparse.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_UTIL_XCANCELLABLE_HPP_\n#include <com\/sun\/star\/util\/XCancellable.hpp>\n#endif\n#ifndef _CPPUHELPER_COMPBASE4_HXX_\n#include <cppuhelper\/compbase4.hxx>\n#endif\n#ifndef _CPPUHELPER_IMPLBASE1_HXX_\n#include <cppuhelper\/implbase1.hxx>\n#endif\n#ifndef _COMPHELPER_PROPERTY_ARRAY_HELPER_HXX_\n#include <comphelper\/proparrhlp.hxx>\n#endif\n\nnamespace connectivity\n{\n namespace kab\n {\n typedef ::cppu::WeakComponentImplHelper4< ::com::sun::star::sdbc::XStatement,\n ::com::sun::star::sdbc::XWarningsSupplier,\n ::com::sun::star::util::XCancellable,\n ::com::sun::star::sdbc::XCloseable> KabCommonStatement_BASE;\n\n \/\/**************************************************************\n \/\/ Class KabCommonStatement\n \/\/ is a base class for the normal statement and for the prepared statement\n \/\/**************************************************************\n class KabCommonStatement : public comphelper::OBaseMutex,\n public KabCommonStatement_BASE,\n public ::cppu::OPropertySetHelper,\n public comphelper::OPropertyArrayUsageHelper<KabCommonStatement>\n\n {\n ::com::sun::star::sdbc::SQLWarning m_aLastWarning;\n\n protected:\n ::std::list< ::rtl::OUString> m_aBatchList;\n connectivity::OSQLParser m_aParser;\n connectivity::OSQLParseTreeIterator m_aSQLIterator;\n connectivity::OSQLParseNode* m_pParseTree;\n KabConnection* m_pConnection; \/\/ The owning Connection object\n\n protected:\n class KabCondition *analyseWhereClause(\n const OSQLParseNode *pParseNode) const throw(::com::sun::star::sdbc::SQLException);\n class KabOrder *analyseOrderByClause(\n const OSQLParseNode *pParseNode) const throw(::com::sun::star::sdbc::SQLException);\n sal_Bool isTableKnown(class KabResultSet *pResult) const;\n void setKabFields(class KabResultSet *pResult) const throw(::com::sun::star::sdbc::SQLException);\n void selectAddressees(KabResultSet *pResult) const throw(::com::sun::star::sdbc::SQLException);\n void sortAddressees(KabResultSet *pResult) const throw(::com::sun::star::sdbc::SQLException);\n\n \/\/ OPropertyArrayUsageHelper\n virtual ::cppu::IPropertyArrayHelper* createArrayHelper() const;\n\n \/\/ OPropertySetHelper\n virtual ::cppu::IPropertyArrayHelper & SAL_CALL getInfoHelper();\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) throw (::com::sun::star::lang::IllegalArgumentException);\n virtual void SAL_CALL setFastPropertyValue_NoBroadcast(\n sal_Int32 nHandle,\n const ::com::sun::star::uno::Any& rValue) throw (::com::sun::star::uno::Exception);\n virtual void SAL_CALL getFastPropertyValue(\n ::com::sun::star::uno::Any& rValue,\n sal_Int32 nHandle) const;\n\n virtual void resetParameters() const throw(::com::sun::star::sdbc::SQLException);\n virtual void getNextParameter(::rtl::OUString &rParameter) const throw(::com::sun::star::sdbc::SQLException);\n virtual ~KabCommonStatement();\n\n public:\n ::cppu::OBroadcastHelper& rBHelper;\n\n KabCommonStatement(KabConnection *_pConnection);\n using KabCommonStatement_BASE::operator ::com::sun::star::uno::Reference< ::com::sun::star::uno::XInterface >;\n\n \/\/ OComponentHelper\n virtual void SAL_CALL disposing();\n\n \/\/ XInterface\n virtual void SAL_CALL release() throw();\n virtual void SAL_CALL acquire() throw();\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\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\n \/\/ XPropertySet\n virtual ::com::sun::star::uno::Reference< ::com::sun::star::beans::XPropertySetInfo > SAL_CALL getPropertySetInfo(\n ) throw(::com::sun::star::uno::RuntimeException);\n\n \/\/ XStatement\n virtual ::com::sun::star::uno::Reference< ::com::sun::star::sdbc::XResultSet > SAL_CALL executeQuery(\n const ::rtl::OUString& sql ) throw(::com::sun::star::sdbc::SQLException, ::com::sun::star::uno::RuntimeException);\n virtual sal_Int32 SAL_CALL executeUpdate(\n const ::rtl::OUString& sql ) throw(::com::sun::star::sdbc::SQLException, ::com::sun::star::uno::RuntimeException);\n virtual sal_Bool SAL_CALL execute(\n 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(\n ) throw(::com::sun::star::sdbc::SQLException, ::com::sun::star::uno::RuntimeException);\n\n \/\/ XWarningsSupplier\n virtual ::com::sun::star::uno::Any SAL_CALL getWarnings(\n ) throw(::com::sun::star::sdbc::SQLException, ::com::sun::star::uno::RuntimeException);\n virtual void SAL_CALL clearWarnings(\n ) throw(::com::sun::star::sdbc::SQLException, ::com::sun::star::uno::RuntimeException);\n\n \/\/ XCancellable\n virtual void SAL_CALL cancel(\n ) throw(::com::sun::star::uno::RuntimeException);\n\n \/\/ XCloseable\n virtual void SAL_CALL close(\n ) throw(::com::sun::star::sdbc::SQLException, ::com::sun::star::uno::RuntimeException);\n\n \/\/ other methods\n inline KabConnection* getOwnConnection() const { return m_pConnection; }\n };\n\n \/\/**************************************************************\n \/\/ Class KabStatement\n \/\/**************************************************************\n typedef ::cppu::ImplInheritanceHelper1<\n KabCommonStatement, ::com::sun::star::lang::XServiceInfo > KabStatement_BASE;\n\n class KabStatement : public KabStatement_BASE\n {\n protected:\n virtual ~KabStatement() { }\n\n public:\n KabStatement(KabConnection* _pConnection);\n DECLARE_SERVICE_INFO();\n };\n }\n}\n\n#endif \/\/ _CONNECTIVITY_KAB_STATEMENT_HXX_\n<commit_msg>INTEGRATION: CWS changefileheader (1.3.266); FILE MERGED 2008\/04\/01 15:08:53 thb 1.3.266.3: #i85898# Stripping all external header guards 2008\/04\/01 10:53:07 thb 1.3.266.2: #i85898# Stripping all external header guards 2008\/03\/28 15:23:45 rt 1.3.266.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: KStatement.hxx,v $\n * $Revision: 1.4 $\n *\n * This file is part of OpenOffice.org.\n *\n * OpenOffice.org is free software: you can redistribute it and\/or modify\n * it under the terms of the GNU Lesser General Public License version 3\n * only, as published by the Free Software Foundation.\n *\n * OpenOffice.org is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the\n * GNU Lesser General Public License version 3 for more details\n * (a copy is included in the LICENSE file that accompanied this code).\n *\n * You should have received a copy of the GNU Lesser General Public License\n * version 3 along with OpenOffice.org. If not, see\n * <http:\/\/www.openoffice.org\/license.html>\n * for a copy of the LGPLv3 License.\n *\n ************************************************************************\/\n\n#ifndef _CONNECTIVITY_KAB_STATEMENT_HXX_\n#define _CONNECTIVITY_KAB_STATEMENT_HXX_\n\n#include \"KConnection.hxx\"\n#include <list>\n#include \"connectivity\/sqliterator.hxx\"\n#ifndef _CONNECTIVITY_PARSE_SQLPARSE_HXX_\n#include \"connectivity\/sqlparse.hxx\"\n#endif\n#include <com\/sun\/star\/sdbc\/XStatement.hpp>\n#include <com\/sun\/star\/util\/XCancellable.hpp>\n#include <cppuhelper\/compbase4.hxx>\n#include <cppuhelper\/implbase1.hxx>\n#include <comphelper\/proparrhlp.hxx>\n\nnamespace connectivity\n{\n namespace kab\n {\n typedef ::cppu::WeakComponentImplHelper4< ::com::sun::star::sdbc::XStatement,\n ::com::sun::star::sdbc::XWarningsSupplier,\n ::com::sun::star::util::XCancellable,\n ::com::sun::star::sdbc::XCloseable> KabCommonStatement_BASE;\n\n \/\/**************************************************************\n \/\/ Class KabCommonStatement\n \/\/ is a base class for the normal statement and for the prepared statement\n \/\/**************************************************************\n class KabCommonStatement : public comphelper::OBaseMutex,\n public KabCommonStatement_BASE,\n public ::cppu::OPropertySetHelper,\n public comphelper::OPropertyArrayUsageHelper<KabCommonStatement>\n\n {\n ::com::sun::star::sdbc::SQLWarning m_aLastWarning;\n\n protected:\n ::std::list< ::rtl::OUString> m_aBatchList;\n connectivity::OSQLParser m_aParser;\n connectivity::OSQLParseTreeIterator m_aSQLIterator;\n connectivity::OSQLParseNode* m_pParseTree;\n KabConnection* m_pConnection; \/\/ The owning Connection object\n\n protected:\n class KabCondition *analyseWhereClause(\n const OSQLParseNode *pParseNode) const throw(::com::sun::star::sdbc::SQLException);\n class KabOrder *analyseOrderByClause(\n const OSQLParseNode *pParseNode) const throw(::com::sun::star::sdbc::SQLException);\n sal_Bool isTableKnown(class KabResultSet *pResult) const;\n void setKabFields(class KabResultSet *pResult) const throw(::com::sun::star::sdbc::SQLException);\n void selectAddressees(KabResultSet *pResult) const throw(::com::sun::star::sdbc::SQLException);\n void sortAddressees(KabResultSet *pResult) const throw(::com::sun::star::sdbc::SQLException);\n\n \/\/ OPropertyArrayUsageHelper\n virtual ::cppu::IPropertyArrayHelper* createArrayHelper() const;\n\n \/\/ OPropertySetHelper\n virtual ::cppu::IPropertyArrayHelper & SAL_CALL getInfoHelper();\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) throw (::com::sun::star::lang::IllegalArgumentException);\n virtual void SAL_CALL setFastPropertyValue_NoBroadcast(\n sal_Int32 nHandle,\n const ::com::sun::star::uno::Any& rValue) throw (::com::sun::star::uno::Exception);\n virtual void SAL_CALL getFastPropertyValue(\n ::com::sun::star::uno::Any& rValue,\n sal_Int32 nHandle) const;\n\n virtual void resetParameters() const throw(::com::sun::star::sdbc::SQLException);\n virtual void getNextParameter(::rtl::OUString &rParameter) const throw(::com::sun::star::sdbc::SQLException);\n virtual ~KabCommonStatement();\n\n public:\n ::cppu::OBroadcastHelper& rBHelper;\n\n KabCommonStatement(KabConnection *_pConnection);\n using KabCommonStatement_BASE::operator ::com::sun::star::uno::Reference< ::com::sun::star::uno::XInterface >;\n\n \/\/ OComponentHelper\n virtual void SAL_CALL disposing();\n\n \/\/ XInterface\n virtual void SAL_CALL release() throw();\n virtual void SAL_CALL acquire() throw();\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\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\n \/\/ XPropertySet\n virtual ::com::sun::star::uno::Reference< ::com::sun::star::beans::XPropertySetInfo > SAL_CALL getPropertySetInfo(\n ) throw(::com::sun::star::uno::RuntimeException);\n\n \/\/ XStatement\n virtual ::com::sun::star::uno::Reference< ::com::sun::star::sdbc::XResultSet > SAL_CALL executeQuery(\n const ::rtl::OUString& sql ) throw(::com::sun::star::sdbc::SQLException, ::com::sun::star::uno::RuntimeException);\n virtual sal_Int32 SAL_CALL executeUpdate(\n const ::rtl::OUString& sql ) throw(::com::sun::star::sdbc::SQLException, ::com::sun::star::uno::RuntimeException);\n virtual sal_Bool SAL_CALL execute(\n 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(\n ) throw(::com::sun::star::sdbc::SQLException, ::com::sun::star::uno::RuntimeException);\n\n \/\/ XWarningsSupplier\n virtual ::com::sun::star::uno::Any SAL_CALL getWarnings(\n ) throw(::com::sun::star::sdbc::SQLException, ::com::sun::star::uno::RuntimeException);\n virtual void SAL_CALL clearWarnings(\n ) throw(::com::sun::star::sdbc::SQLException, ::com::sun::star::uno::RuntimeException);\n\n \/\/ XCancellable\n virtual void SAL_CALL cancel(\n ) throw(::com::sun::star::uno::RuntimeException);\n\n \/\/ XCloseable\n virtual void SAL_CALL close(\n ) throw(::com::sun::star::sdbc::SQLException, ::com::sun::star::uno::RuntimeException);\n\n \/\/ other methods\n inline KabConnection* getOwnConnection() const { return m_pConnection; }\n };\n\n \/\/**************************************************************\n \/\/ Class KabStatement\n \/\/**************************************************************\n typedef ::cppu::ImplInheritanceHelper1<\n KabCommonStatement, ::com::sun::star::lang::XServiceInfo > KabStatement_BASE;\n\n class KabStatement : public KabStatement_BASE\n {\n protected:\n virtual ~KabStatement() { }\n\n public:\n KabStatement(KabConnection* _pConnection);\n DECLARE_SERVICE_INFO();\n };\n }\n}\n\n#endif \/\/ _CONNECTIVITY_KAB_STATEMENT_HXX_\n<|endoftext|>"} {"text":"<commit_before>#include <iostream>\n#include <fstream>\n#include <chrono>\n#include <cstdlib>\n\n#define VIENNACL_WITH_OPENCL\n#define AGGREGATION\n#define AMGCL_PROFILING\n\n#include <amgcl\/amgcl.hpp>\n\n#ifdef AGGREGATION\n# include <amgcl\/aggregation.hpp>\n#else\n# include <amgcl\/interp_classic.hpp>\n#endif\n\n#include <amgcl\/level_viennacl.hpp>\n\n#include <vexcl\/devlist.hpp>\n\n#include <viennacl\/vector.hpp>\n#include <viennacl\/hyb_matrix.hpp>\n#include <viennacl\/linalg\/cg.hpp>\n\nnamespace amgcl {\nprofiler<> prof;\n}\nusing amgcl::prof;\n\n\/\/ Simple wrapper around amgcl::solver that provides ViennaCL's preconditioner\n\/\/ interface.\nstruct amg_precond {\n typedef amgcl::solver<\n double, int,\n#ifdef AGGREGATION\n amgcl::interp::aggregation<amgcl::aggr::plain>,\n#else\n amgcl::interp::classic,\n#endif\n amgcl::level::ViennaCL<amgcl::level::CL_MATRIX_HYB>\n > AMG;\n typedef typename AMG::params params;\n\n \/\/ Build AMG hierarchy.\n template <class matrix>\n amg_precond(const matrix &A, const params &prm = params())\n : amg(A, prm), r(amgcl::sparse::matrix_rows(A))\n { }\n\n \/\/ Use one V-cycle with zero initial approximation as a preconditioning step.\n void apply(viennacl::vector<double> &x) const {\n r.clear();\n amg.apply(x, r);\n viennacl::copy(r, x);\n }\n\n \/\/ Build VexCL-based hierarchy:\n mutable AMG amg;\n mutable viennacl::vector<double> r;\n};\n\nint main(int argc, char *argv[]) {\n if (argc < 2) {\n std::cerr << \"Usage: \" << argv[0] << \" <problem.dat>\" << std::endl;\n return 1;\n }\n\n \/\/ There is no easy way to select compute device in ViennaCL, so just use\n \/\/ VexCL for that.\n vex::Context ctx(\n vex::Filter::Env &&\n vex::Filter::DoublePrecision &&\n vex::Filter::Count(1)\n );\n std::vector<cl_device_id> dev_id(1, ctx.queue(0).getInfo<CL_QUEUE_DEVICE>()());\n std::vector<cl_command_queue> queue_id(1, ctx.queue(0)());\n viennacl::ocl::setup_context(0, ctx.context(0)(), dev_id, queue_id);\n std::cout << ctx << std::endl;\n\n \/\/ Read matrix and rhs from a binary file.\n std::ifstream pfile(argv[1], std::ios::binary);\n int n;\n pfile.read((char*)&n, sizeof(int));\n\n std::vector<int> row(n + 1);\n pfile.read((char*)row.data(), row.size() * sizeof(int));\n\n std::vector<int> col(row.back());\n std::vector<double> val(row.back());\n std::vector<double> rhs(n);\n\n pfile.read((char*)col.data(), col.size() * sizeof(int));\n pfile.read((char*)val.data(), val.size() * sizeof(double));\n pfile.read((char*)rhs.data(), rhs.size() * sizeof(double));\n\n \/\/ Wrap the matrix into amgcl::sparse::map:\n amgcl::sparse::matrix_map<double, int> A(\n n, n, row.data(), col.data(), val.data()\n );\n\n \/\/ Build the preconditioner.\n amg_precond::params prm;\n#ifdef AGGREGATION\n prm.level.kcycle = 1;\n#endif\n\n prof.tic(\"setup\");\n amg_precond amg(A, prm);\n prof.toc(\"setup\");\n\n \/\/ Copy matrix and rhs to GPU(s).\n viennacl::hyb_matrix<double> Agpu;\n viennacl::copy(amgcl::sparse::viennacl_map(A), Agpu);\n\n viennacl::vector<double> f(n);\n viennacl::fast_copy(rhs, f);\n\n \/\/ Solve the problem with CG method from ViennaCL. Use AMG as a\n \/\/ preconditioner:\n prof.tic(\"solve\");\n viennacl::linalg::cg_tag tag(1e-8, 100);\n viennacl::vector<double> x = viennacl::linalg::solve(Agpu, f, tag, amg);\n prof.toc(\"solve\");\n\n std::cout << \"Iterations: \" << tag.iters() << std::endl\n << \"Error: \" << tag.error() << std::endl;\n\n std::cout << prof;\n\n \/\/ Prevent ViennaCL from segfaulting:\n exit(0);\n}\n<commit_msg>Support for OpenMP backend in ViennaCL<commit_after>#include <iostream>\n#include <fstream>\n#include <chrono>\n#include <cstdlib>\n\n#define VIENNACL_WITH_OPENCL\n\/\/#define VIENNACL_WITH_OPENMP\n\n#define AMGCL_PROFILING\n\n#include <amgcl\/amgcl.hpp>\n#include <amgcl\/level_viennacl.hpp>\n\n#ifdef VIENNACL_WITH_OPENCL\n# include <vexcl\/devlist.hpp>\n# include <viennacl\/hyb_matrix.hpp>\n# include <amgcl\/aggregation.hpp>\n#else\n# include <viennacl\/compressed_matrix.hpp>\n# include <amgcl\/interp_classic.hpp>\n#endif\n\n#include <viennacl\/vector.hpp>\n#include <viennacl\/linalg\/cg.hpp>\n\nnamespace amgcl {\nprofiler<> prof;\n}\nusing amgcl::prof;\n\n\/\/ Simple wrapper around amgcl::solver that provides ViennaCL's preconditioner\n\/\/ interface.\nstruct amg_precond {\n typedef amgcl::solver<\n double, int,\n#ifdef VIENNACL_WITH_OPENCL\n amgcl::interp::aggregation<amgcl::aggr::plain>,\n amgcl::level::ViennaCL<amgcl::level::CL_MATRIX_HYB>\n#else\n amgcl::interp::classic,\n amgcl::level::ViennaCL<amgcl::level::CL_MATRIX_CRS>\n#endif\n > AMG;\n typedef typename AMG::params params;\n\n \/\/ Build AMG hierarchy.\n template <class matrix>\n amg_precond(const matrix &A, const params &prm = params())\n : amg(A, prm), r(amgcl::sparse::matrix_rows(A))\n { }\n\n \/\/ Use one V-cycle with zero initial approximation as a preconditioning step.\n void apply(viennacl::vector<double> &x) const {\n r.clear();\n amg.apply(x, r);\n viennacl::copy(r, x);\n }\n\n \/\/ Build VexCL-based hierarchy:\n mutable AMG amg;\n mutable viennacl::vector<double> r;\n};\n\nint main(int argc, char *argv[]) {\n if (argc < 2) {\n std::cerr << \"Usage: \" << argv[0] << \" <problem.dat>\" << std::endl;\n return 1;\n }\n\n#ifdef VIENNACL_WITH_OPENCL\n \/\/ There is no easy way to select compute device in ViennaCL, so just use\n \/\/ VexCL for that.\n vex::Context ctx(\n vex::Filter::Env &&\n vex::Filter::DoublePrecision &&\n vex::Filter::Count(1)\n );\n std::vector<cl_device_id> dev_id(1, ctx.queue(0).getInfo<CL_QUEUE_DEVICE>()());\n std::vector<cl_command_queue> queue_id(1, ctx.queue(0)());\n viennacl::ocl::setup_context(0, ctx.context(0)(), dev_id, queue_id);\n std::cout << ctx << std::endl;\n#endif\n\n \/\/ Read matrix and rhs from a binary file.\n std::ifstream pfile(argv[1], std::ios::binary);\n int n;\n pfile.read((char*)&n, sizeof(int));\n\n std::vector<int> row(n + 1);\n pfile.read((char*)row.data(), row.size() * sizeof(int));\n\n std::vector<int> col(row.back());\n std::vector<double> val(row.back());\n std::vector<double> rhs(n);\n\n pfile.read((char*)col.data(), col.size() * sizeof(int));\n pfile.read((char*)val.data(), val.size() * sizeof(double));\n pfile.read((char*)rhs.data(), rhs.size() * sizeof(double));\n\n \/\/ Wrap the matrix into amgcl::sparse::map:\n amgcl::sparse::matrix_map<double, int> A(\n n, n, row.data(), col.data(), val.data()\n );\n\n \/\/ Build the preconditioner.\n amg_precond::params prm;\n#ifdef VIENNACL_WITH_OPENCL\n prm.level.kcycle = 1;\n#endif\n\n prof.tic(\"setup\");\n amg_precond amg(A, prm);\n prof.toc(\"setup\");\n\n \/\/ Copy matrix and rhs to GPU(s).\n viennacl::hyb_matrix<double> Agpu;\n viennacl::copy(amgcl::sparse::viennacl_map(A), Agpu);\n\n viennacl::vector<double> f(n);\n viennacl::fast_copy(rhs, f);\n\n \/\/ Solve the problem with CG method from ViennaCL. Use AMG as a\n \/\/ preconditioner:\n prof.tic(\"solve\");\n viennacl::linalg::cg_tag tag(1e-8, 100);\n viennacl::vector<double> x = viennacl::linalg::solve(Agpu, f, tag, amg);\n prof.toc(\"solve\");\n\n std::cout << \"Iterations: \" << tag.iters() << std::endl\n << \"Error: \" << tag.error() << std::endl;\n\n std::cout << prof;\n\n \/\/ Prevent ViennaCL from segfaulting:\n exit(0);\n}\n<|endoftext|>"} {"text":"<commit_before>#include \"frames.h\"\n\nframeGPUi::frameGPUi (int w, int h, bool full) {\n\tglGenTextures (1, &plane);\n\tglBindTexture (GL_TEXTURE_2D, plane);\n\tglTexParameteri (GL_TEXTURE_2D, GL_TEXTURE_MIN_FILTER, GL_NEAREST);\n\tglTexParameteri (GL_TEXTURE_2D, GL_TEXTURE_MAG_FILTER, GL_NEAREST);\n\tglTexImage2D (GL_TEXTURE_2D, 0, full ? GL_RGBA32F : GL_RGBA16F, w, h, 0, GL_RGBA, full ? GL_FLOAT : GL_HALF_FLOAT, NULL);\n\n\ttimecode = 0;\n}\n\nframeGPUi::~frameGPUi () {\n\tglDeleteTextures (1, &plane);\n}\n<commit_msg>10-bit normalased internal frames<commit_after>#include \"frames.h\"\n\nframeGPUi::frameGPUi (int w, int h, bool full) {\n\tglGenTextures (1, &plane);\n\tglBindTexture (GL_TEXTURE_2D, plane);\n\tglTexParameteri (GL_TEXTURE_2D, GL_TEXTURE_MIN_FILTER, GL_NEAREST);\n\tglTexParameteri (GL_TEXTURE_2D, GL_TEXTURE_MAG_FILTER, GL_NEAREST);\n\t\/\/glTexImage2D (GL_TEXTURE_2D, 0, full ? GL_RGBA32F : GL_RGBA16F, w, h, 0, GL_RGBA, full ? GL_FLOAT : GL_HALF_FLOAT, NULL);\n\tglTexImage2D (GL_TEXTURE_2D, 0, GL_RGB10_A2, w, h, 0, GL_RGBA, GL_UNSIGNED_INT_2_10_10_10_REV, NULL);\n\ttimecode = 0;\n}\n\nframeGPUi::~frameGPUi () {\n\tglDeleteTextures (1, &plane);\n}\n<|endoftext|>"} {"text":"<commit_before>\/*************************************************************************\n *\n * $RCSfile: valueproperties.cxx,v $\n *\n * $Revision: 1.1 $\n *\n * last change: $Author: fs $ $Date: 2000-12-13 10:36:36 $\n *\n * The Contents of this file are made available subject to the terms of\n * either of the following licenses\n *\n * - GNU Lesser General Public License Version 2.1\n * - Sun Industry Standards Source License Version 1.1\n *\n * Sun Microsystems Inc., October, 2000\n *\n * GNU Lesser General Public License Version 2.1\n * =============================================\n * Copyright 2000 by Sun Microsystems, Inc.\n * 901 San Antonio Road, Palo Alto, CA 94303, USA\n *\n * This library is free software; you can redistribute it and\/or\n * modify it under the terms of the GNU Lesser General Public\n * License version 2.1, as published by the Free Software Foundation.\n *\n * This library is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU\n * Lesser General Public License for more details.\n *\n * You should have received a copy of the GNU Lesser General Public\n * License along with this library; if not, write to the Free Software\n * Foundation, Inc., 59 Temple Place, Suite 330, Boston,\n * MA 02111-1307 USA\n *\n *\n * Sun Industry Standards Source License Version 1.1\n * =================================================\n * The contents of this file are subject to the Sun Industry Standards\n * Source License Version 1.1 (the \"License\"); You may not use this file\n * except in compliance with the License. You may obtain a copy of the\n * License at http:\/\/www.openoffice.org\/license.html.\n *\n * Software provided under this License is provided on an \"AS IS\" basis,\n * WITHOUT WARRANTY OF ANY KIND, EITHER 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 _XMLOFF_FORMS_VALUEPROPERTIES_HXX_\n#include \"valueproperties.hxx\"\n#endif\n#ifndef _XMLOFF_FORMS_STRINGS_HXX_\n#include \"strings.hxx\"\n#endif\n#ifndef _COM_SUN_STAR_FORM_FORMCOMPONENTTYPE_HPP_\n#include <com\/sun\/star\/form\/FormComponentType.hpp>\n#endif\n\n\/\/.........................................................................\nnamespace xmloff\n{\n\/\/.........................................................................\n\n using namespace ::com::sun::star::form;\n\n \/\/=====================================================================\n \/\/= OValuePropertiesMetaData\n \/\/=====================================================================\n \/\/---------------------------------------------------------------------\n void OValuePropertiesMetaData::getValuePropertyNames(\n OControlElement::ElementType _eType, sal_Int16 _nFormComponentType,\n sal_Char const * & _rpCurrentValuePropertyName, sal_Char const * & _rpValuePropertyName)\n {\n \/\/ reset the pointers in case we can't determine the property names\n _rpCurrentValuePropertyName = _rpValuePropertyName = NULL;\n switch (_nFormComponentType)\n {\n case FormComponentType::TEXTFIELD:\n if (OControlElement::FORMATTED_TEXT == _eType)\n {\n _rpCurrentValuePropertyName = PROPERTY_EFFECTIVE_VALUE;\n _rpValuePropertyName = PROPERTY_EFFECTIVE_DEFAULT;\n }\n else\n {\n _rpCurrentValuePropertyName = PROPERTY_TEXT;\n _rpValuePropertyName = PROPERTY_DEFAULT_TEXT;\n }\n break;\n case FormComponentType::DATEFIELD:\n _rpCurrentValuePropertyName = PROPERTY_DATE;\n _rpValuePropertyName = PROPERTY_DEFAULT_DATE;\n break;\n case FormComponentType::TIMEFIELD:\n _rpCurrentValuePropertyName = PROPERTY_TIME;\n _rpValuePropertyName = PROPERTY_DEFAULT_TIME;\n break;\n case FormComponentType::NUMERICFIELD:\n case FormComponentType::CURRENCYFIELD:\n _rpCurrentValuePropertyName = PROPERTY_VALUE;\n _rpValuePropertyName = PROPERTY_DEFAULT_VALUE;\n break;\n case FormComponentType::PATTERNFIELD:\n case FormComponentType::FILECONTROL:\n case FormComponentType::COMBOBOX:\n _rpValuePropertyName = PROPERTY_DEFAULT_TEXT;\n \/\/ NO BREAK!!\n case FormComponentType::COMMANDBUTTON:\n _rpCurrentValuePropertyName = PROPERTY_TEXT;\n break;\n case FormComponentType::CHECKBOX:\n case FormComponentType::RADIOBUTTON:\n _rpValuePropertyName = PROPERTY_REFVALUE;\n break;\n case FormComponentType::HIDDENCONTROL:\n _rpValuePropertyName = PROPERTY_VALUE;\n break;\n }\n }\n\n\n \/\/---------------------------------------------------------------------\n void OValuePropertiesMetaData::getValueLimitPropertyNames(sal_Int16 _nFormComponentType,\n sal_Char const * & _rpMinValuePropertyName, sal_Char const * & _rpMaxValuePropertyName)\n {\n _rpMinValuePropertyName = _rpMinValuePropertyName = NULL;\n switch (_nFormComponentType)\n {\n case FormComponentType::DATEFIELD:\n _rpMinValuePropertyName = PROPERTY_DATE_MIN;\n _rpMaxValuePropertyName = PROPERTY_DATE_MAX;\n break;\n case FormComponentType::TIMEFIELD:\n _rpMinValuePropertyName = PROPERTY_TIME_MIN;\n _rpMaxValuePropertyName = PROPERTY_TIME_MAX;\n break;\n case FormComponentType::NUMERICFIELD:\n case FormComponentType::CURRENCYFIELD:\n _rpMinValuePropertyName = PROPERTY_VALUE_MIN;\n _rpMaxValuePropertyName = PROPERTY_VALUE_MAX;\n break;\n case FormComponentType::PATTERNFIELD:\n \/\/ no min\/max value for the pattern field\n break;\n case FormComponentType::TEXTFIELD:\n _rpMinValuePropertyName = PROPERTY_EFFECTIVE_MIN;\n _rpMaxValuePropertyName = PROPERTY_EFFECTIVE_MAX;\n break;\n }\n }\n\n\/\/.........................................................................\n} \/\/ namespace xmloff\n\/\/.........................................................................\n\n\/*************************************************************************\n * history:\n * $Log: not supported by cvs2svn $\n *\n * Revision 1.0 12.12.00 14:14:36 fs\n ************************************************************************\/\n\n<commit_msg>#83528# no CurrentValue property for password fields<commit_after>\/*************************************************************************\n *\n * $RCSfile: valueproperties.cxx,v $\n *\n * $Revision: 1.2 $\n *\n * last change: $Author: fs $ $Date: 2001-02-13 09:07: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 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 _XMLOFF_FORMS_VALUEPROPERTIES_HXX_\n#include \"valueproperties.hxx\"\n#endif\n#ifndef _XMLOFF_FORMS_STRINGS_HXX_\n#include \"strings.hxx\"\n#endif\n#ifndef _COM_SUN_STAR_FORM_FORMCOMPONENTTYPE_HPP_\n#include <com\/sun\/star\/form\/FormComponentType.hpp>\n#endif\n\n\/\/.........................................................................\nnamespace xmloff\n{\n\/\/.........................................................................\n\n using namespace ::com::sun::star::form;\n\n \/\/=====================================================================\n \/\/= OValuePropertiesMetaData\n \/\/=====================================================================\n \/\/---------------------------------------------------------------------\n void OValuePropertiesMetaData::getValuePropertyNames(\n OControlElement::ElementType _eType, sal_Int16 _nFormComponentType,\n sal_Char const * & _rpCurrentValuePropertyName, sal_Char const * & _rpValuePropertyName)\n {\n \/\/ reset the pointers in case we can't determine the property names\n _rpCurrentValuePropertyName = _rpValuePropertyName = NULL;\n switch (_nFormComponentType)\n {\n case FormComponentType::TEXTFIELD:\n if (OControlElement::FORMATTED_TEXT == _eType)\n {\n _rpCurrentValuePropertyName = PROPERTY_EFFECTIVE_VALUE;\n _rpValuePropertyName = PROPERTY_EFFECTIVE_DEFAULT;\n }\n else\n {\n if (OControlElement::PASSWORD != _eType)\n \/\/ no CurrentValue\" for passwords\n _rpCurrentValuePropertyName = PROPERTY_TEXT;\n _rpValuePropertyName = PROPERTY_DEFAULT_TEXT;\n }\n break;\n case FormComponentType::DATEFIELD:\n _rpCurrentValuePropertyName = PROPERTY_DATE;\n _rpValuePropertyName = PROPERTY_DEFAULT_DATE;\n break;\n case FormComponentType::TIMEFIELD:\n _rpCurrentValuePropertyName = PROPERTY_TIME;\n _rpValuePropertyName = PROPERTY_DEFAULT_TIME;\n break;\n case FormComponentType::NUMERICFIELD:\n case FormComponentType::CURRENCYFIELD:\n _rpCurrentValuePropertyName = PROPERTY_VALUE;\n _rpValuePropertyName = PROPERTY_DEFAULT_VALUE;\n break;\n case FormComponentType::PATTERNFIELD:\n case FormComponentType::FILECONTROL:\n case FormComponentType::COMBOBOX:\n _rpValuePropertyName = PROPERTY_DEFAULT_TEXT;\n \/\/ NO BREAK!!\n case FormComponentType::COMMANDBUTTON:\n _rpCurrentValuePropertyName = PROPERTY_TEXT;\n break;\n case FormComponentType::CHECKBOX:\n case FormComponentType::RADIOBUTTON:\n _rpValuePropertyName = PROPERTY_REFVALUE;\n break;\n case FormComponentType::HIDDENCONTROL:\n _rpValuePropertyName = PROPERTY_VALUE;\n break;\n }\n }\n\n\n \/\/---------------------------------------------------------------------\n void OValuePropertiesMetaData::getValueLimitPropertyNames(sal_Int16 _nFormComponentType,\n sal_Char const * & _rpMinValuePropertyName, sal_Char const * & _rpMaxValuePropertyName)\n {\n _rpMinValuePropertyName = _rpMinValuePropertyName = NULL;\n switch (_nFormComponentType)\n {\n case FormComponentType::DATEFIELD:\n _rpMinValuePropertyName = PROPERTY_DATE_MIN;\n _rpMaxValuePropertyName = PROPERTY_DATE_MAX;\n break;\n case FormComponentType::TIMEFIELD:\n _rpMinValuePropertyName = PROPERTY_TIME_MIN;\n _rpMaxValuePropertyName = PROPERTY_TIME_MAX;\n break;\n case FormComponentType::NUMERICFIELD:\n case FormComponentType::CURRENCYFIELD:\n _rpMinValuePropertyName = PROPERTY_VALUE_MIN;\n _rpMaxValuePropertyName = PROPERTY_VALUE_MAX;\n break;\n case FormComponentType::PATTERNFIELD:\n \/\/ no min\/max value for the pattern field\n break;\n case FormComponentType::TEXTFIELD:\n _rpMinValuePropertyName = PROPERTY_EFFECTIVE_MIN;\n _rpMaxValuePropertyName = PROPERTY_EFFECTIVE_MAX;\n break;\n }\n }\n\n\/\/.........................................................................\n} \/\/ namespace xmloff\n\/\/.........................................................................\n\n\/*************************************************************************\n * history:\n * $Log: not supported by cvs2svn $\n * Revision 1.1 2000\/12\/13 10:36:36 fs\n * initial checkin - helper class for meta data for the different value properties\n *\n *\n * Revision 1.0 12.12.00 14:14:36 fs\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: saxhelper.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 _SAXHELPER_HXX\n#define _SAXHELPER_HXX\n\n#include \"libxml\/tree.h\"\n\n#include <com\/sun\/star\/xml\/sax\/SAXException.hpp>\n#include <com\/sun\/star\/xml\/sax\/XAttributeList.hpp>\n#include <com\/sun\/star\/xml\/sax\/XLocator.hpp>\n#include <com\/sun\/star\/lang\/XServiceInfo.hpp>\n#include <com\/sun\/star\/xml\/csax\/XMLAttribute.hpp>\n\n\nclass SAXHelper\n{\n private :\n xmlParserCtxtPtr m_pParserCtxt ;\n xmlSAXHandlerPtr m_pSaxHandler ;\n\n public:\n SAXHelper( ) ;\n virtual ~SAXHelper() ;\n\n xmlNodePtr getCurrentNode();\n void setCurrentNode(const xmlNodePtr pNode);\n xmlDocPtr getDocument();\n\n void startDocument( void )\n throw( ::com::sun::star::xml::sax::SAXException , ::com::sun::star::uno::RuntimeException ) ;\n\n void endDocument( void )\n throw( ::com::sun::star::xml::sax::SAXException , ::com::sun::star::uno::RuntimeException ) ;\n\n void startElement(\n const ::rtl::OUString& aName ,\n const com::sun::star::uno::Sequence<\n com::sun::star::xml::csax::XMLAttribute >& aAttributes )\n throw( ::com::sun::star::xml::sax::SAXException , ::com::sun::star::uno::RuntimeException ) ;\n\n void endElement( const ::rtl::OUString& aName )\n throw( ::com::sun::star::xml::sax::SAXException , ::com::sun::star::uno::RuntimeException ) ;\n\n void characters( const ::rtl::OUString& aChars )\n throw( ::com::sun::star::xml::sax::SAXException , ::com::sun::star::uno::RuntimeException ) ;\n\n void ignorableWhitespace( const ::rtl::OUString& aWhitespaces )\n throw( ::com::sun::star::xml::sax::SAXException , ::com::sun::star::uno::RuntimeException ) ;\n\n void processingInstruction(\n const ::rtl::OUString& aTarget ,\n const ::rtl::OUString& aData )\n throw( ::com::sun::star::xml::sax::SAXException , ::com::sun::star::uno::RuntimeException ) ;\n\n void setDocumentLocator( const ::com::sun::star::uno::Reference<\n ::com::sun::star::xml::sax::XLocator > & xLocator )\n throw( ::com::sun::star::xml::sax::SAXException , ::com::sun::star::uno::RuntimeException ) ;\n} ;\n\n#endif\n\n<commit_msg>INTEGRATION: CWS jl103 (1.3.16); FILE MERGED 2008\/06\/13 07:28:39 jl 1.3.16.1: #i86233# uri encoding the URI attribute of the reference elements<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: saxhelper.hxx,v $\n * $Revision: 1.4 $\n *\n * This file is part of OpenOffice.org.\n *\n * OpenOffice.org is free software: you can redistribute it and\/or modify\n * it under the terms of the GNU Lesser General Public License version 3\n * only, as published by the Free Software Foundation.\n *\n * OpenOffice.org is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the\n * GNU Lesser General Public License version 3 for more details\n * (a copy is included in the LICENSE file that accompanied this code).\n *\n * You should have received a copy of the GNU Lesser General Public License\n * version 3 along with OpenOffice.org. If not, see\n * <http:\/\/www.openoffice.org\/license.html>\n * for a copy of the LGPLv3 License.\n *\n ************************************************************************\/\n\n#ifndef _SAXHELPER_HXX\n#define _SAXHELPER_HXX\n\n#include \"libxml\/tree.h\"\n\n#include <com\/sun\/star\/xml\/sax\/SAXException.hpp>\n#include <com\/sun\/star\/xml\/sax\/XAttributeList.hpp>\n#include <com\/sun\/star\/xml\/sax\/XLocator.hpp>\n#include <com\/sun\/star\/lang\/XServiceInfo.hpp>\n#include <com\/sun\/star\/xml\/csax\/XMLAttribute.hpp>\n\n\/** This class represents a SAX handler which simply forwards to\n the corresponding libxml API and translates parameter if necessary.\n*\/\nclass SAXHelper\n{\n private :\n xmlParserCtxtPtr m_pParserCtxt ;\n xmlSAXHandlerPtr m_pSaxHandler ;\n\n public:\n SAXHelper( ) ;\n virtual ~SAXHelper() ;\n\n xmlNodePtr getCurrentNode();\n void setCurrentNode(const xmlNodePtr pNode);\n xmlDocPtr getDocument();\n\n void startDocument( void )\n throw( ::com::sun::star::xml::sax::SAXException , ::com::sun::star::uno::RuntimeException ) ;\n\n void endDocument( void )\n throw( ::com::sun::star::xml::sax::SAXException , ::com::sun::star::uno::RuntimeException ) ;\n\n void startElement(\n const ::rtl::OUString& aName ,\n const com::sun::star::uno::Sequence<\n com::sun::star::xml::csax::XMLAttribute >& aAttributes )\n throw( ::com::sun::star::xml::sax::SAXException , ::com::sun::star::uno::RuntimeException ) ;\n\n void endElement( const ::rtl::OUString& aName )\n throw( ::com::sun::star::xml::sax::SAXException , ::com::sun::star::uno::RuntimeException ) ;\n\n void characters( const ::rtl::OUString& aChars )\n throw( ::com::sun::star::xml::sax::SAXException , ::com::sun::star::uno::RuntimeException ) ;\n\n void ignorableWhitespace( const ::rtl::OUString& aWhitespaces )\n throw( ::com::sun::star::xml::sax::SAXException , ::com::sun::star::uno::RuntimeException ) ;\n\n void processingInstruction(\n const ::rtl::OUString& aTarget ,\n const ::rtl::OUString& aData )\n throw( ::com::sun::star::xml::sax::SAXException , ::com::sun::star::uno::RuntimeException ) ;\n\n void setDocumentLocator( const ::com::sun::star::uno::Reference<\n ::com::sun::star::xml::sax::XLocator > & xLocator )\n throw( ::com::sun::star::xml::sax::SAXException , ::com::sun::star::uno::RuntimeException ) ;\n} ;\n\n#endif\n\n<|endoftext|>"} {"text":"<commit_before>\/\/ Copyright 2016 Jonathan Buchanan.\n\/\/ This file is part of Sunglasses, which is licensed under the MIT License.\n\/\/ See LICENSE.md for details.\n#include \"SunCamera.h\"\n#include \"SunMesh.h\"\n#include \"SunModel.h\"\n#include \"SunPrimitives.h\"\n#include \"SunRenderer.h\"\n#include \"SunShader.h\"\n#include \"SunTextRenderer.h\"\n#include \"SunTexturedQuad.h\"\n#include \"SunUniformPasser.h\"\n#include \"SunWindowManager.h\"\n<commit_msg>Fixed Graphics.hpp<commit_after>\/\/ Copyright 2016 Jonathan Buchanan.\n\/\/ This file is part of Sunglasses, which is licensed under the MIT License.\n\/\/ See LICENSE.md for details.\n#include \"SunCamera.h\"\n#include \"SunMesh.h\"\n#include \"SunModel.h\"\n#include \"SunPrimitives.h\"\n#include \"SunRenderer.h\"\n#include \"SunShader.h\"\n#include \"SunTexturedQuad.h\"\n#include \"SunUniformPasser.h\"\n#include \"SunWindowManager.h\"\n<|endoftext|>"} {"text":"<commit_before>\/\/ this file defines the FilterExamples for the test driver\n\/\/ and all it expects is that you have a function called RegisterTests\n#include <iostream>\n#include \"itkTestMain.h\" \n\n\nvoid RegisterTests()\n{\nREGISTER_TEST(BilateralImageFilterTest);\nREGISTER_TEST(BinaryMinMaxCurvatureFlowImageFilterTest);\nREGISTER_TEST(BinaryThresholdImageFilterTest);\nREGISTER_TEST(BinomialBlurImageFilterTest);\nREGISTER_TEST(CastingImageFiltersTest);\nREGISTER_TEST(CurvatureAnisotropicDiffusionImageFilterTest);\nREGISTER_TEST(CurvatureFlowImageFilterTest);\nREGISTER_TEST(DanielssonDistanceMapImageFilterTest);\nREGISTER_TEST(DerivativeImageFilterTest);\nREGISTER_TEST(DiscreteGaussianImageFilterTest);\nREGISTER_TEST(GradientAnisotropicDiffusionImageFilterTest);\nREGISTER_TEST(GradientMagnitudeImageFilterTest);\nREGISTER_TEST(GradientMagnitudeRecursiveGaussianImageFilterTest);\nREGISTER_TEST(LaplacianImageFilterTest);\nREGISTER_TEST(MathematicalMorphologyBinaryFiltersTest);\nREGISTER_TEST(MathematicalMorphologyGrayscaleFiltersTest);\nREGISTER_TEST(MeanImageFilterTest);\nREGISTER_TEST(MedianImageFilterTest);\nREGISTER_TEST(MinMaxCurvatureFlowImageFilterTest);\nREGISTER_TEST(RGBCurvatureAnisotropicDiffusionImageFilterTest);\nREGISTER_TEST(RGBGradientAnisotropicDiffusionImageFilterTest);\nREGISTER_TEST(ResampleImageFilterTest);\nREGISTER_TEST(ResampleImageFilter2Test);\nREGISTER_TEST(ResampleImageFilter3Test);\nREGISTER_TEST(ResampleImageFilter4Test);\nREGISTER_TEST(ResampleImageFilter5Test);\nREGISTER_TEST(SigmoidImageFilterTest);\nREGISTER_TEST(SmoothingRecursiveGaussianImageFilterTest);\nREGISTER_TEST(ThresholdImageFilterTest);\nREGISTER_TEST(VectorCurvatureAnisotropicDiffusionImageFilterTest);\nREGISTER_TEST(VectorGradientAnisotropicDiffusionImageFilterTest);\n}\n\n#undef main\n#define main BilateralImageFilterTest\n#include \"BilateralImageFilter.cxx\"\n\n#undef main\n#define main BinaryMinMaxCurvatureFlowImageFilterTest\n#include \"BinaryMinMaxCurvatureFlowImageFilter.cxx\"\n\n#undef main\n#define main BinaryThresholdImageFilterTest\n#include \"BinaryThresholdImageFilter.cxx\"\n\n#undef main\n#define main BinomialBlurImageFilterTest\n#include \"BinomialBlurImageFilter.cxx\"\n\n#undef main\n#define main CastingImageFiltersTest\n#include \"CastingImageFilters.cxx\"\n\n#undef main\n#define main CurvatureAnisotropicDiffusionImageFilterTest\n#include \"CurvatureAnisotropicDiffusionImageFilter.cxx\"\n\n#undef main\n#define main CurvatureFlowImageFilterTest\n#include \"CurvatureFlowImageFilter.cxx\"\n\n#undef main\n#define main DanielssonDistanceMapImageFilterTest\n#include \"DanielssonDistanceMapImageFilter.cxx\"\n\n#undef main\n#define main DiscreteGaussianImageFilterTest\n#include \"DiscreteGaussianImageFilter.cxx\"\n\n#undef main\n#define main DerivativeImageFilterTest\n#include \"DerivativeImageFilter.cxx\"\n\n#undef main\n#define main GradientAnisotropicDiffusionImageFilterTest\n#include \"GradientAnisotropicDiffusionImageFilter.cxx\"\n\n#undef main\n#define main GradientMagnitudeImageFilterTest\n#include \"GradientMagnitudeImageFilter.cxx\"\n\n#undef main\n#define main GradientMagnitudeRecursiveGaussianImageFilterTest\n#include \"GradientMagnitudeRecursiveGaussianImageFilter.cxx\"\n\n#undef main\n#define main LaplacianImageFilterTest\n#include \"LaplacianImageFilter.cxx\"\n\n#undef main\n#define main MathematicalMorphologyBinaryFiltersTest\n#include \"MathematicalMorphologyBinaryFilters.cxx\"\n\n#undef main\n#define main MathematicalMorphologyGrayscaleFiltersTest\n#include \"MathematicalMorphologyGrayscaleFilters.cxx\"\n\n#undef main\n#define main MeanImageFilterTest\n#include \"MeanImageFilter.cxx\"\n\n#undef main\n#define main MedianImageFilterTest\n#include \"MedianImageFilter.cxx\"\n\n#undef main\n#define main MinMaxCurvatureFlowImageFilterTest\n#include \"MinMaxCurvatureFlowImageFilter.cxx\"\n\n#undef main\n#define main RGBCurvatureAnisotropicDiffusionImageFilterTest\n#include \"RGBCurvatureAnisotropicDiffusionImageFilter.cxx\"\n\n#undef main\n#define main RGBGradientAnisotropicDiffusionImageFilterTest\n#include \"RGBGradientAnisotropicDiffusionImageFilter.cxx\"\n\n#undef main\n#define main ResampleImageFilterTest\n#include \"ResampleImageFilter.cxx\"\n\n#undef main\n#define main ResampleImageFilter2Test\n#include \"ResampleImageFilter2.cxx\"\n\n#undef main\n#define main ResampleImageFilter3Test\n#include \"ResampleImageFilter3.cxx\"\n\n#undef main\n#define main ResampleImageFilter4Test\n#include \"ResampleImageFilter4.cxx\"\n\n#undef main\n#define main ResampleImageFilter5Test\n#include \"ResampleImageFilter5.cxx\"\n\n#undef main\n#define main SigmoidImageFilterTest\n#include \"SigmoidImageFilter.cxx\"\n\n#undef main\n#define main SmoothingRecursiveGaussianImageFilterTest\n#include \"SmoothingRecursiveGaussianImageFilter.cxx\"\n\n#undef main\n#define main ThresholdImageFilterTest\n#include \"ThresholdImageFilter.cxx\"\n\n#undef main\n#define main VectorCurvatureAnisotropicDiffusionImageFilterTest\n#include \"VectorCurvatureAnisotropicDiffusionImageFilter.cxx\"\n\n#undef main\n#define main VectorGradientAnisotropicDiffusionImageFilterTest\n#include \"VectorGradientAnisotropicDiffusionImageFilter.cxx\"\n<commit_msg>FIX: DerivativeImageFilter test added.<commit_after>\/\/ this file defines the FilterExamples for the test driver\n\/\/ and all it expects is that you have a function called RegisterTests\n#include <iostream>\n#include \"itkTestMain.h\" \n\n\nvoid RegisterTests()\n{\nREGISTER_TEST(BilateralImageFilterTest);\nREGISTER_TEST(BinaryMinMaxCurvatureFlowImageFilterTest);\nREGISTER_TEST(BinaryThresholdImageFilterTest);\nREGISTER_TEST(BinomialBlurImageFilterTest);\nREGISTER_TEST(CastingImageFiltersTest);\nREGISTER_TEST(CurvatureAnisotropicDiffusionImageFilterTest);\nREGISTER_TEST(CurvatureFlowImageFilterTest);\nREGISTER_TEST(DanielssonDistanceMapImageFilterTest);\nREGISTER_TEST(DerivativeImageFilterTest);\nREGISTER_TEST(DiscreteGaussianImageFilterTest);\nREGISTER_TEST(GradientAnisotropicDiffusionImageFilterTest);\nREGISTER_TEST(GradientMagnitudeImageFilterTest);\nREGISTER_TEST(GradientMagnitudeRecursiveGaussianImageFilterTest);\nREGISTER_TEST(LaplacianImageFilterTest);\nREGISTER_TEST(MathematicalMorphologyBinaryFiltersTest);\nREGISTER_TEST(MathematicalMorphologyGrayscaleFiltersTest);\nREGISTER_TEST(MeanImageFilterTest);\nREGISTER_TEST(MedianImageFilterTest);\nREGISTER_TEST(MinMaxCurvatureFlowImageFilterTest);\nREGISTER_TEST(RGBCurvatureAnisotropicDiffusionImageFilterTest);\nREGISTER_TEST(RGBGradientAnisotropicDiffusionImageFilterTest);\nREGISTER_TEST(ResampleImageFilterTest);\nREGISTER_TEST(ResampleImageFilter2Test);\nREGISTER_TEST(ResampleImageFilter3Test);\nREGISTER_TEST(ResampleImageFilter4Test);\nREGISTER_TEST(ResampleImageFilter5Test);\nREGISTER_TEST(SigmoidImageFilterTest);\nREGISTER_TEST(SmoothingRecursiveGaussianImageFilterTest);\nREGISTER_TEST(ThresholdImageFilterTest);\nREGISTER_TEST(VectorCurvatureAnisotropicDiffusionImageFilterTest);\nREGISTER_TEST(VectorGradientAnisotropicDiffusionImageFilterTest);\n}\n\n#undef main\n#define main BilateralImageFilterTest\n#include \"BilateralImageFilter.cxx\"\n\n#undef main\n#define main BinaryMinMaxCurvatureFlowImageFilterTest\n#include \"BinaryMinMaxCurvatureFlowImageFilter.cxx\"\n\n#undef main\n#define main BinaryThresholdImageFilterTest\n#include \"BinaryThresholdImageFilter.cxx\"\n\n#undef main\n#define main BinomialBlurImageFilterTest\n#include \"BinomialBlurImageFilter.cxx\"\n\n#undef main\n#define main CastingImageFiltersTest\n#include \"CastingImageFilters.cxx\"\n\n#undef main\n#define main CurvatureAnisotropicDiffusionImageFilterTest\n#include \"CurvatureAnisotropicDiffusionImageFilter.cxx\"\n\n#undef main\n#define main CurvatureFlowImageFilterTest\n#include \"CurvatureFlowImageFilter.cxx\"\n\n#undef main\n#define main DanielssonDistanceMapImageFilterTest\n#include \"DanielssonDistanceMapImageFilter.cxx\"\n\n#undef main\n#define main DerivativeImageFilterTest\n#include \"DerivativeImageFilter.cxx\"\n\n#undef main\n#define main DiscreteGaussianImageFilterTest\n#include \"DiscreteGaussianImageFilter.cxx\"\n\n#undef main\n#define main DerivativeImageFilterTest\n#include \"DerivativeImageFilter.cxx\"\n\n#undef main\n#define main GradientAnisotropicDiffusionImageFilterTest\n#include \"GradientAnisotropicDiffusionImageFilter.cxx\"\n\n#undef main\n#define main GradientMagnitudeImageFilterTest\n#include \"GradientMagnitudeImageFilter.cxx\"\n\n#undef main\n#define main GradientMagnitudeRecursiveGaussianImageFilterTest\n#include \"GradientMagnitudeRecursiveGaussianImageFilter.cxx\"\n\n#undef main\n#define main LaplacianImageFilterTest\n#include \"LaplacianImageFilter.cxx\"\n\n#undef main\n#define main MathematicalMorphologyBinaryFiltersTest\n#include \"MathematicalMorphologyBinaryFilters.cxx\"\n\n#undef main\n#define main MathematicalMorphologyGrayscaleFiltersTest\n#include \"MathematicalMorphologyGrayscaleFilters.cxx\"\n\n#undef main\n#define main MeanImageFilterTest\n#include \"MeanImageFilter.cxx\"\n\n#undef main\n#define main MedianImageFilterTest\n#include \"MedianImageFilter.cxx\"\n\n#undef main\n#define main MinMaxCurvatureFlowImageFilterTest\n#include \"MinMaxCurvatureFlowImageFilter.cxx\"\n\n#undef main\n#define main RGBCurvatureAnisotropicDiffusionImageFilterTest\n#include \"RGBCurvatureAnisotropicDiffusionImageFilter.cxx\"\n\n#undef main\n#define main RGBGradientAnisotropicDiffusionImageFilterTest\n#include \"RGBGradientAnisotropicDiffusionImageFilter.cxx\"\n\n#undef main\n#define main ResampleImageFilterTest\n#include \"ResampleImageFilter.cxx\"\n\n#undef main\n#define main ResampleImageFilter2Test\n#include \"ResampleImageFilter2.cxx\"\n\n#undef main\n#define main ResampleImageFilter3Test\n#include \"ResampleImageFilter3.cxx\"\n\n#undef main\n#define main ResampleImageFilter4Test\n#include \"ResampleImageFilter4.cxx\"\n\n#undef main\n#define main ResampleImageFilter5Test\n#include \"ResampleImageFilter5.cxx\"\n\n#undef main\n#define main SigmoidImageFilterTest\n#include \"SigmoidImageFilter.cxx\"\n\n#undef main\n#define main SmoothingRecursiveGaussianImageFilterTest\n#include \"SmoothingRecursiveGaussianImageFilter.cxx\"\n\n#undef main\n#define main ThresholdImageFilterTest\n#include \"ThresholdImageFilter.cxx\"\n\n#undef main\n#define main VectorCurvatureAnisotropicDiffusionImageFilterTest\n#include \"VectorCurvatureAnisotropicDiffusionImageFilter.cxx\"\n\n#undef main\n#define main VectorGradientAnisotropicDiffusionImageFilterTest\n#include \"VectorGradientAnisotropicDiffusionImageFilter.cxx\"\n<|endoftext|>"} {"text":"<commit_before>#include \"c_dbxml.h\"\n#include <dbxml\/DbXml.hpp>\n#include <string>\n\n#define ALIAS \"c_dbxml\"\n\nextern \"C\" {\n\n struct c_dbxml_t {\n\tDbXml::XmlManager manager;\n\tDbXml::XmlUpdateContext context;\n\tDbXml::XmlContainer container;\n\tDbXml::XmlContainerConfig config;\n\tbool error;\n\tstd::string filename;\n\tstd::string errstring;\n };\n\n struct c_dbxml_result_t {\n\tstd::string result;\n\tbool error;\n };\n\n struct c_dbxml_docs_t {\n\tDbXml::XmlDocument doc;\n\tDbXml::XmlValue value;\n\tDbXml::XmlResults it;\n\tDbXml::XmlQueryContext context;\n\tbool more;\n\tstd::string name;\n\tstd::string content;\n\tstd::string match;\n\tbool error;\n\tstd::string errstring;\n };\n\n struct c_dbxml_query_t {\n\tDbXml::XmlQueryContext context;\n\tDbXml::XmlQueryExpression expression;\n\tbool error;\n\tstd::string errstring;\n };\n\n c_dbxml c_dbxml_open(char const *filename, int readwrite, int read)\n {\n\tc_dbxml db;\n\n\tdb = new c_dbxml_t;\n\tdb->filename = filename;\n\n\tfor (int i = 0; i < 2; i++) {\n\t \/* if both: first attempt is read+write *\/\n\t if (i == 0 && readwrite == 0) {\n\t\tcontinue;\n\t }\n\t if (i == 1 && read == 0) {\n\t\tcontinue;\n\t }\n\t try {\n\t\tdb->context = db->manager.createUpdateContext();\n\t\tif (i == 0) {\n\t\t db->config.setAllowCreate(true);\n\t\t db->config.setMode(0666);\n\t\t} else {\n\t\t db->config.setReadOnly(true);\n\t\t}\n\t\tdb->container = db->manager.openContainer(filename, db->config);\n\t\tdb->error = false;\n\t\tif (!db->container.addAlias(ALIAS)) {\n\t\t db->errstring = \"Unable to add alias \\\"\" ALIAS \"\\\"\";\n\t\t db->error = true;\n\t\t}\n\t } catch (DbXml::XmlException &xe) {\n\t\tdb->errstring = xe.what();\n\t\tdb->error = true;\n\t }\n\t if (db->error == false) {\n\t\tbreak;\n\t }\n\t}\n\n\treturn db;\n }\n\n void c_dbxml_free(c_dbxml db)\n {\n\tdelete db;\n }\n\n int c_dbxml_error(c_dbxml db)\n {\n\treturn db->error ? 1 : 0;\n }\n\n char const *c_dbxml_errstring(c_dbxml db)\n {\n\treturn db->errstring.c_str();\n }\n\n void c_dbxml_result_free(c_dbxml_result r)\n {\n\tdelete r;\n }\n\n int c_dbxml_result_error(c_dbxml_result r)\n {\n\treturn r->error ? 1 : 0;\n }\n\n char const *c_dbxml_result_string(c_dbxml_result r)\n {\n\treturn r->result.c_str();\n }\n\n c_dbxml_result c_dbxml_put_file(c_dbxml db, char const * filename, int replace)\n {\n\tc_dbxml_result r;\n\tr = new c_dbxml_result_t;\n\n\tif (replace) {\n\t try {\n\t\tdb->container.deleteDocument(filename, db->context);\n\t } catch (DbXml::XmlException &xe) {\n\t\t;\n\t }\n\t}\n try {\n DbXml::XmlInputStream *is = db->manager.createLocalFileInputStream(filename);\n db->container.putDocument(filename, is, db->context, DbXml::DBXML_WELL_FORMED_ONLY);\n\t r->error = false;\n } catch (DbXml::XmlException &xe) {\n\t r->result = xe.what();\n\t r->error = true;\n }\n\n\treturn r;\n }\n\n \/\/ replace if replace != 0\n c_dbxml_result c_dbxml_put_xml(c_dbxml db, char const *name, char const *data, int replace)\n {\n\tc_dbxml_result r;\n\tr = new c_dbxml_result_t;\n\n\tif (replace) {\n\t try {\n\t\tdb->container.deleteDocument(name, db->context);\n\t } catch (DbXml::XmlException &xe) {\n\t\t;\n\t }\n\t}\n\n try {\n db->container.putDocument(name, data, db->context);\n\t r->error = false;\n } catch (DbXml::XmlException &xe) {\n\t r->result = xe.what();\n\t r->error = true;\n }\n\treturn r;\n }\n\n \/\/ replace if replace != 0\n c_dbxml_result c_dbxml_merge(c_dbxml db, char const * dbxmlfile, int replace) {\n\tc_dbxml_result r;\n\tr = new c_dbxml_result_t;\n\n\tDbXml::XmlContainer input = db->manager.openContainer(dbxmlfile);\n\tDbXml::XmlDocument doc;\n\tDbXml::XmlResults it = input.getAllDocuments(DbXml::DBXML_LAZY_DOCS);\n\twhile (it.next(doc)) {\n\t if (replace) {\n\t\ttry {\n\t\t db->container.deleteDocument(doc.getName(), db->context);\n\t\t} catch (DbXml::XmlException &xe) {\n\t\t ;\n\t\t}\n\t }\n\t try {\n\t\tdb->container.putDocument(doc, db->context);\n\t\tr->error = false;\n\t } catch (DbXml::XmlException &xe) {\n\t\tr->result = xe.what();\n\t\tr->error = true;\n\t\treturn r;\n\t }\n\t}\n\treturn r;\n }\n\n c_dbxml_result c_dbxml_remove(c_dbxml db, char const * filename)\n {\n\tc_dbxml_result r;\n\tr = new c_dbxml_result_t;\n\n\ttry {\n\t db->container.deleteDocument(filename, db->context);\n\t r->error = false;\n } catch (DbXml::XmlException &xe) {\n\t r->result = xe.what();\n\t r->error = true;\n\t}\n\treturn r;\n }\n\n c_dbxml_result c_dbxml_get(c_dbxml db, char const * name)\n {\n\tc_dbxml_result r;\n\tr = new c_dbxml_result_t;\n\ttry {\n\t DbXml::XmlDocument doc = db->container.getDocument(name);\n\t doc.getContent(r->result);\n\t r->error = false;\n\t} catch (DbXml::XmlException &xe) {\n\t r->result = xe.what();\n\t r->error = true;\n\t}\n\treturn r;\n }\n\n unsigned long long c_dbxml_size(c_dbxml db)\n {\n\treturn (unsigned long long) db->container.getNumDocuments();\n }\n\n c_dbxml_docs c_dbxml_get_all(c_dbxml db)\n {\n\tc_dbxml_docs docs;\n\tdocs = new c_dbxml_docs_t;\n\tdocs->it = db->container.getAllDocuments(DbXml::DBXML_LAZY_DOCS);\n\tdocs->more = true;\n\tdocs->error = false;\n\treturn docs;\n }\n\n c_dbxml_query c_dbxml_prepare_query(c_dbxml db, char const *query)\n {\n\tc_dbxml_query q;\n\tq = new c_dbxml_query_t;\n\ttry {\n\t q->context = db->manager.createQueryContext(DbXml::XmlQueryContext::LiveValues, DbXml::XmlQueryContext::Lazy);\n\t q->context.setDefaultCollection(ALIAS);\n\t q->expression = db->manager.prepare(std::string(\"collection('\" ALIAS \"')\") + query, q->context);\n\t q->error = false;\n\t if (q->expression.isUpdateExpression()) {\n\t\tq->errstring = \"Update Expressions are not allowed\";\n\t\tq->error = true;\n\t }\n\t} catch (DbXml::XmlException const &xe) {\n\t q->errstring = xe.what();\n\t q->error = true;\n\t}\n\treturn q;\n }\n\n c_dbxml_docs c_dbxml_run_query(c_dbxml_query query)\n {\n\tc_dbxml_docs docs;\n\tdocs = new c_dbxml_docs_t;\n\tdocs->more = true;\n\tdocs->context = query->context;\n\ttry {\n\t docs->it = query->expression.execute(docs->context,\n\t\t\t\t\t\t DbXml::DBXML_LAZY_DOCS | DbXml::DBXML_WELL_FORMED_ONLY\n\t\t\t\t\t\t );\n\t docs->error = false;\n\t} catch (DbXml::XmlException const &xe) {\n\t docs->more = false;\n\t docs->errstring = xe.what();\n\t docs->error = true;\n\t}\n\n\treturn docs;\n }\n\n int c_dbxml_get_query_error(c_dbxml_docs docs)\n {\n\treturn docs->error ? 1 : 0;\n }\n\n char const *c_dbxml_get_query_errstring(c_dbxml_docs docs)\n {\n\treturn docs->errstring.c_str();\n }\n\n int c_dbxml_get_prepared_error(c_dbxml_query query)\n {\n\treturn query->error ? 1 : 0;\n }\n\n char const *c_dbxml_get_prepared_errstring(c_dbxml_query query)\n {\n\treturn query->errstring.c_str();\n }\n\n int c_dbxml_docs_next(c_dbxml_docs docs)\n {\n\tif (docs->more) {\n\t try {\n\t\tdocs->it.peek(docs->value);\n\t\tdocs->more = docs->it.next(docs->doc);\n\t } catch (DbXml::XmlException &xe) {\n\t\tdocs->errstring = xe.what();\n\t\tdocs->error = true;\n\t\tdocs->more = false;\n\t }\n\t docs->name.clear();\n\t docs->content.clear();\n\t docs->match.clear();\n\t}\n\treturn docs->more ? 1 : 0;\n }\n\n char const * c_dbxml_docs_name(c_dbxml_docs docs)\n {\n\tif (docs->more && ! docs->name.size())\n\t docs->name = docs->doc.getName();\n\n\treturn docs->name.c_str();\n }\n\n char const * c_dbxml_docs_content(c_dbxml_docs docs)\n {\n\tif (docs->more && ! docs->content.size())\n\t docs->doc.getContent(docs->content);\n\n\treturn docs->content.c_str();\n }\n\n char const * c_dbxml_docs_match(c_dbxml_docs docs)\n {\n\tif (docs->more && ! docs->match.size() && docs->value.isNode()) {\n\t docs->match = docs->value.asString();\n\t}\n\n\treturn docs->match.c_str();\n }\n\n void c_dbxml_docs_free(c_dbxml_docs docs)\n {\n\tdelete docs;\n }\n\n void c_dbxml_query_free(c_dbxml_query query)\n {\n\tdelete query;\n }\n\n void c_dbxml_cancel_query(c_dbxml_query query)\n {\n\tquery->context.interruptQuery();\n }\n\n c_dbxml_result c_dbxml_check(char const *query)\n {\n\tc_dbxml_result r;\n\tr = new c_dbxml_result_t;\n\ttry {\n\t DbXml::XmlManager manager;\n\t DbXml::XmlQueryContext context;\n\t DbXml::XmlQueryExpression expr;\n\t context = manager.createQueryContext(DbXml::XmlQueryContext::LiveValues, DbXml::XmlQueryContext::Lazy);\n\t expr = manager.prepare(std::string(query), context);\n\t r->error = false;\n\t if (expr.isUpdateExpression()) {\n\t\tr->result = \"Update Expressions are not allowed\";\n\t\tr->error = true;\n\t }\n\t} catch (DbXml::XmlException const &xe) {\n\t r->result = xe.what();\n\t r->error = true;\n\t}\n\treturn r;\n }\n\n void c_dbxml_version(int *major, int *minor, int *patch)\n {\n\tDbXml::dbxml_version(major, minor, patch);\n }\n\n}\n<commit_msg>bugfix in Open<commit_after>#include \"c_dbxml.h\"\n#include <dbxml\/DbXml.hpp>\n#include <string>\n\n#define ALIAS \"c_dbxml\"\n\nextern \"C\" {\n\n struct c_dbxml_t {\n\tDbXml::XmlManager manager;\n\tDbXml::XmlUpdateContext context;\n\tDbXml::XmlContainer container;\n\tDbXml::XmlContainerConfig config;\n\tbool error;\n\tstd::string filename;\n\tstd::string errstring;\n };\n\n struct c_dbxml_result_t {\n\tstd::string result;\n\tbool error;\n };\n\n struct c_dbxml_docs_t {\n\tDbXml::XmlDocument doc;\n\tDbXml::XmlValue value;\n\tDbXml::XmlResults it;\n\tDbXml::XmlQueryContext context;\n\tbool more;\n\tstd::string name;\n\tstd::string content;\n\tstd::string match;\n\tbool error;\n\tstd::string errstring;\n };\n\n struct c_dbxml_query_t {\n\tDbXml::XmlQueryContext context;\n\tDbXml::XmlQueryExpression expression;\n\tbool error;\n\tstd::string errstring;\n };\n\n c_dbxml c_dbxml_open(char const *filename, int readwrite, int read)\n {\n\tc_dbxml db;\n\n\tdb = new c_dbxml_t;\n\tdb->filename = filename;\n\n\tfor (int i = 0; i < 2; i++) {\n\t \/* if both: first attempt is read+write *\/\n\t if (i == 0 && readwrite == 0) {\n\t\tcontinue;\n\t }\n\t if (i == 1 && read == 0) {\n\t\tcontinue;\n\t }\n\t try {\n\t\tdb->context = db->manager.createUpdateContext();\n\t\tif (i == 0) {\n\t\t db->config.setAllowCreate(true);\n\t\t db->config.setMode(0666);\n\t\t} else {\n\t\t db->config.setAllowCreate(false);\n\t\t db->config.setReadOnly(true);\n\t\t}\n\t\tdb->container = db->manager.openContainer(filename, db->config);\n\t\tdb->error = false;\n\t\tif (!db->container.addAlias(ALIAS)) {\n\t\t db->errstring = \"Unable to add alias \\\"\" ALIAS \"\\\"\";\n\t\t db->error = true;\n\t\t}\n\t } catch (DbXml::XmlException &xe) {\n\t\tdb->errstring = xe.what();\n\t\tdb->error = true;\n\t }\n\t if (db->error == false) {\n\t\tbreak;\n\t }\n\t}\n\n\treturn db;\n }\n\n void c_dbxml_free(c_dbxml db)\n {\n\tdelete db;\n }\n\n int c_dbxml_error(c_dbxml db)\n {\n\treturn db->error ? 1 : 0;\n }\n\n char const *c_dbxml_errstring(c_dbxml db)\n {\n\treturn db->errstring.c_str();\n }\n\n void c_dbxml_result_free(c_dbxml_result r)\n {\n\tdelete r;\n }\n\n int c_dbxml_result_error(c_dbxml_result r)\n {\n\treturn r->error ? 1 : 0;\n }\n\n char const *c_dbxml_result_string(c_dbxml_result r)\n {\n\treturn r->result.c_str();\n }\n\n c_dbxml_result c_dbxml_put_file(c_dbxml db, char const * filename, int replace)\n {\n\tc_dbxml_result r;\n\tr = new c_dbxml_result_t;\n\n\tif (replace) {\n\t try {\n\t\tdb->container.deleteDocument(filename, db->context);\n\t } catch (DbXml::XmlException &xe) {\n\t\t;\n\t }\n\t}\n try {\n DbXml::XmlInputStream *is = db->manager.createLocalFileInputStream(filename);\n db->container.putDocument(filename, is, db->context, DbXml::DBXML_WELL_FORMED_ONLY);\n\t r->error = false;\n } catch (DbXml::XmlException &xe) {\n\t r->result = xe.what();\n\t r->error = true;\n }\n\n\treturn r;\n }\n\n \/\/ replace if replace != 0\n c_dbxml_result c_dbxml_put_xml(c_dbxml db, char const *name, char const *data, int replace)\n {\n\tc_dbxml_result r;\n\tr = new c_dbxml_result_t;\n\n\tif (replace) {\n\t try {\n\t\tdb->container.deleteDocument(name, db->context);\n\t } catch (DbXml::XmlException &xe) {\n\t\t;\n\t }\n\t}\n\n try {\n db->container.putDocument(name, data, db->context);\n\t r->error = false;\n } catch (DbXml::XmlException &xe) {\n\t r->result = xe.what();\n\t r->error = true;\n }\n\treturn r;\n }\n\n \/\/ replace if replace != 0\n c_dbxml_result c_dbxml_merge(c_dbxml db, char const * dbxmlfile, int replace) {\n\tc_dbxml_result r;\n\tr = new c_dbxml_result_t;\n\n\tDbXml::XmlContainer input = db->manager.openContainer(dbxmlfile);\n\tDbXml::XmlDocument doc;\n\tDbXml::XmlResults it = input.getAllDocuments(DbXml::DBXML_LAZY_DOCS);\n\twhile (it.next(doc)) {\n\t if (replace) {\n\t\ttry {\n\t\t db->container.deleteDocument(doc.getName(), db->context);\n\t\t} catch (DbXml::XmlException &xe) {\n\t\t ;\n\t\t}\n\t }\n\t try {\n\t\tdb->container.putDocument(doc, db->context);\n\t\tr->error = false;\n\t } catch (DbXml::XmlException &xe) {\n\t\tr->result = xe.what();\n\t\tr->error = true;\n\t\treturn r;\n\t }\n\t}\n\treturn r;\n }\n\n c_dbxml_result c_dbxml_remove(c_dbxml db, char const * filename)\n {\n\tc_dbxml_result r;\n\tr = new c_dbxml_result_t;\n\n\ttry {\n\t db->container.deleteDocument(filename, db->context);\n\t r->error = false;\n } catch (DbXml::XmlException &xe) {\n\t r->result = xe.what();\n\t r->error = true;\n\t}\n\treturn r;\n }\n\n c_dbxml_result c_dbxml_get(c_dbxml db, char const * name)\n {\n\tc_dbxml_result r;\n\tr = new c_dbxml_result_t;\n\ttry {\n\t DbXml::XmlDocument doc = db->container.getDocument(name);\n\t doc.getContent(r->result);\n\t r->error = false;\n\t} catch (DbXml::XmlException &xe) {\n\t r->result = xe.what();\n\t r->error = true;\n\t}\n\treturn r;\n }\n\n unsigned long long c_dbxml_size(c_dbxml db)\n {\n\treturn (unsigned long long) db->container.getNumDocuments();\n }\n\n c_dbxml_docs c_dbxml_get_all(c_dbxml db)\n {\n\tc_dbxml_docs docs;\n\tdocs = new c_dbxml_docs_t;\n\tdocs->it = db->container.getAllDocuments(DbXml::DBXML_LAZY_DOCS);\n\tdocs->more = true;\n\tdocs->error = false;\n\treturn docs;\n }\n\n c_dbxml_query c_dbxml_prepare_query(c_dbxml db, char const *query)\n {\n\tc_dbxml_query q;\n\tq = new c_dbxml_query_t;\n\ttry {\n\t q->context = db->manager.createQueryContext(DbXml::XmlQueryContext::LiveValues, DbXml::XmlQueryContext::Lazy);\n\t q->context.setDefaultCollection(ALIAS);\n\t q->expression = db->manager.prepare(std::string(\"collection('\" ALIAS \"')\") + query, q->context);\n\t q->error = false;\n\t if (q->expression.isUpdateExpression()) {\n\t\tq->errstring = \"Update Expressions are not allowed\";\n\t\tq->error = true;\n\t }\n\t} catch (DbXml::XmlException const &xe) {\n\t q->errstring = xe.what();\n\t q->error = true;\n\t}\n\treturn q;\n }\n\n c_dbxml_docs c_dbxml_run_query(c_dbxml_query query)\n {\n\tc_dbxml_docs docs;\n\tdocs = new c_dbxml_docs_t;\n\tdocs->more = true;\n\tdocs->context = query->context;\n\ttry {\n\t docs->it = query->expression.execute(docs->context,\n\t\t\t\t\t\t DbXml::DBXML_LAZY_DOCS | DbXml::DBXML_WELL_FORMED_ONLY\n\t\t\t\t\t\t );\n\t docs->error = false;\n\t} catch (DbXml::XmlException const &xe) {\n\t docs->more = false;\n\t docs->errstring = xe.what();\n\t docs->error = true;\n\t}\n\n\treturn docs;\n }\n\n int c_dbxml_get_query_error(c_dbxml_docs docs)\n {\n\treturn docs->error ? 1 : 0;\n }\n\n char const *c_dbxml_get_query_errstring(c_dbxml_docs docs)\n {\n\treturn docs->errstring.c_str();\n }\n\n int c_dbxml_get_prepared_error(c_dbxml_query query)\n {\n\treturn query->error ? 1 : 0;\n }\n\n char const *c_dbxml_get_prepared_errstring(c_dbxml_query query)\n {\n\treturn query->errstring.c_str();\n }\n\n int c_dbxml_docs_next(c_dbxml_docs docs)\n {\n\tif (docs->more) {\n\t try {\n\t\tdocs->it.peek(docs->value);\n\t\tdocs->more = docs->it.next(docs->doc);\n\t } catch (DbXml::XmlException &xe) {\n\t\tdocs->errstring = xe.what();\n\t\tdocs->error = true;\n\t\tdocs->more = false;\n\t }\n\t docs->name.clear();\n\t docs->content.clear();\n\t docs->match.clear();\n\t}\n\treturn docs->more ? 1 : 0;\n }\n\n char const * c_dbxml_docs_name(c_dbxml_docs docs)\n {\n\tif (docs->more && ! docs->name.size())\n\t docs->name = docs->doc.getName();\n\n\treturn docs->name.c_str();\n }\n\n char const * c_dbxml_docs_content(c_dbxml_docs docs)\n {\n\tif (docs->more && ! docs->content.size())\n\t docs->doc.getContent(docs->content);\n\n\treturn docs->content.c_str();\n }\n\n char const * c_dbxml_docs_match(c_dbxml_docs docs)\n {\n\tif (docs->more && ! docs->match.size() && docs->value.isNode()) {\n\t docs->match = docs->value.asString();\n\t}\n\n\treturn docs->match.c_str();\n }\n\n void c_dbxml_docs_free(c_dbxml_docs docs)\n {\n\tdelete docs;\n }\n\n void c_dbxml_query_free(c_dbxml_query query)\n {\n\tdelete query;\n }\n\n void c_dbxml_cancel_query(c_dbxml_query query)\n {\n\tquery->context.interruptQuery();\n }\n\n c_dbxml_result c_dbxml_check(char const *query)\n {\n\tc_dbxml_result r;\n\tr = new c_dbxml_result_t;\n\ttry {\n\t DbXml::XmlManager manager;\n\t DbXml::XmlQueryContext context;\n\t DbXml::XmlQueryExpression expr;\n\t context = manager.createQueryContext(DbXml::XmlQueryContext::LiveValues, DbXml::XmlQueryContext::Lazy);\n\t expr = manager.prepare(std::string(query), context);\n\t r->error = false;\n\t if (expr.isUpdateExpression()) {\n\t\tr->result = \"Update Expressions are not allowed\";\n\t\tr->error = true;\n\t }\n\t} catch (DbXml::XmlException const &xe) {\n\t r->result = xe.what();\n\t r->error = true;\n\t}\n\treturn r;\n }\n\n void c_dbxml_version(int *major, int *minor, int *patch)\n {\n\tDbXml::dbxml_version(major, minor, patch);\n }\n\n}\n<|endoftext|>"} {"text":"<commit_before><commit_msg>-Werror,-Wunused-const-variable<commit_after><|endoftext|>"} {"text":"<commit_before>\/*-----------------------------------------------------------------------------\n This source file is part of Hopsan NG\n\n Copyright (c) 2011 \n Mikael Axin, Robert Braun, Alessandro Dell'Amico, Björn Eriksson,\n Peter Nordin, Karl Pettersson, Petter Krus, Ingo Staack\n\n This file is provided \"as is\", with no guarantee or warranty for the\n functionality or reliability of the contents. All contents in this file is\n the original work of the copyright holders at the Division of Fluid and\n Mechatronic Systems (Flumes) at Linköping University. Modifying, using or\n redistributing any part of this file is prohibited without explicit\n permission from the copyright holders.\n-----------------------------------------------------------------------------*\/\n\n\/\/!\n\/\/! @file AnimatedConnector.cpp\n\/\/! @author Robert Braun <robert.braun@liu.se\n\/\/! @date 2012-04-25\n\/\/!\n\/\/! @brief Contains a class for animated connectors\n\/\/!\n\/\/$Id$\n\n#include <QDebug>\n#include <QColor>\n#include <QStyleOptionGraphicsItem>\n\n#include \"MainWindow.h\"\n#include \"GraphicsView.h\"\n#include \"AnimatedConnector.h\"\n#include \"GUIObjects\/AnimatedComponent.h\"\n#include \"Widgets\/ProjectTabWidget.h\"\n#include \"GUIPort.h\"\n#include \"GUIObjects\/GUIModelObject.h\"\n#include \"GUIConnectorAppearance.h\"\n#include \"GUIConnector.h\"\n#include \"GUIObjects\/GUIContainerObject.h\"\n\nclass UndoStack;\n\n\/\/! @brief Constructor for animated connector\n\/\/! @param [in] pConnector Pointer to the real connector the animation represents\n\/\/! @param [in] pAnimationWidget Pointer to animation widget where the connector is shown\nAnimatedConnector::AnimatedConnector(Connector *pConnector, AnimationWidget *pAnimationWidget)\n : QGraphicsWidget()\n{\n mpAnimationWidget = pAnimationWidget;\n mpConnector = pConnector;\n\n mpStartComponent = mpAnimationWidget->getAnimatedComponent(pConnector->getStartComponentName());\n mpEndComponent = mpAnimationWidget->getAnimatedComponent(pConnector->getEndComponentName());\n mStartPortName = pConnector->getStartPortName();\n mEndPortName = pConnector->getEndPortName();\n\n if(pConnector->getStartPort()->getNodeType() == \"NodeHydraulic\" && pConnector->getStartPort()->getPortType() != \"READPORT\" && pConnector->getEndPort()->getPortType() != \"READPORT\")\n {\n if(pConnector->getStartPort()->getPortType() == \"POWERMULTIPORT\")\n {\n int g = pConnector->getParentContainer()->getPlotDataPtr()->getLatestGeneration();\n QString componentName = pConnector->getEndPort()->getGuiModelObject()->getName();\n QString portName = pConnector->getEndPort()->getPortName();\n\n if(!pConnector->getParentContainer()->getPlotDataPtr()->isEmpty())\n {\n mvIntensityData = pConnector->getParentContainer()->getPlotDataPtr()->getPlotDataValues(g, componentName, portName, \"Pressure\");\n mvFlowData = pConnector->getParentContainer()->getPlotDataPtr()->getPlotDataValues(g, componentName, portName, \"Flow\");\n }\n }\n else\n {\n int g = pConnector->getParentContainer()->getPlotDataPtr()->getLatestGeneration();\n QString componentName = pConnector->getStartPort()->getGuiModelObject()->getName();\n QString portName = pConnector->getStartPort()->getPortName();\n\n if(!pConnector->getParentContainer()->getPlotDataPtr()->isEmpty())\n {\n mvIntensityData = pConnector->getParentContainer()->getPlotDataPtr()->getPlotDataValues(g, componentName, portName, \"Pressure\");\n mvFlowData = pConnector->getParentContainer()->getPlotDataPtr()->getPlotDataValues(g, componentName, portName, \"Flow\");\n }\n }\n\n if(mpConnector->getStartPort()->getPortType() == \"POWERMULTIPORT\")\n {\n mComponentName = mpConnector->getEndPort()->getGuiModelObject()->getName();\n mPortName = mpConnector->getEndPort()->getPortName();\n }\n else\n {\n mComponentName = mpConnector->getStartPort()->getGuiModelObject()->getName();\n mPortName = mpConnector->getStartPort()->getPortName();\n }\n\n }\n\n \/\/ Determine appearance\n mpConnectorAppearance = pConnector->mpConnectorAppearance;\n\n mPoints = pConnector->mPoints;\n\n \/\/ Create the lines\n for(int i=0; i < mPoints.size()-1; ++i)\n {\n AnimatedConnectorLine *pLine = new AnimatedConnectorLine(mapFromScene(mPoints[i]).x(), mapFromScene(mPoints[i]).y(),\n mapFromScene(mPoints[i+1]).x(), mapFromScene(mPoints[i+1]).y(),\n mpConnectorAppearance, this);\n\n QPen tempPen = pConnector->mpLines.at(i)->pen();\n mpLines.push_back(pLine);\n if(pConnector->mpLines.at(i)->mHasStartArrow)\n {\n pLine->addStartArrow();\n }\n if(pConnector->mpLines.at(i)->mHasEndArrow)\n {\n pLine->addEndArrow();\n }\n pLine->setPen(tempPen);\n }\n\n if(pConnector->getStartPort()->getGuiModelObject()->getTypeCQS() == \"C\")\n {\n mDirectionCorrection = 1;\n }\n else\n {\n mDirectionCorrection = -1;\n }\n}\n\n\n\/\/! @brief Destructor for animated connector class\nAnimatedConnector::~AnimatedConnector()\n{\n delete mpConnectorAppearance;\n}\n\n\n\/\/! @brief Updates the animated connector\nvoid AnimatedConnector::updateAnimation()\n{\n double max = mpAnimationWidget->mIntensityMaxMap.find(\"NodeHydraulic\").value();\n double min = mpAnimationWidget->mIntensityMinMap.find(\"NodeHydraulic\").value();\n\n QPen tempPen = mpLines.first()->pen();\n tempPen.setDashPattern(QVector<qreal>() << 1.5 << 3.5);\n\n double data, flowData;\n if(mpAnimationWidget->isRealTimeAnimation()) \/\/Real-time animation\n {\n mpAnimationWidget->mpContainer->getCoreSystemAccessPtr()->getLastNodeData(mComponentName, mPortName, \"Pressure\", data);\n mpAnimationWidget->mpContainer->getCoreSystemAccessPtr()->getLastNodeData(mComponentName, mPortName, \"Flow\", flowData);\n }\n else if(!mvIntensityData.isEmpty()) \/\/Replay animation\n {\n int index = mpAnimationWidget->getIndex();\n data = mvIntensityData[index];\n flowData = mvFlowData[index];\n }\n\n int red = std::min(255.0, 255*(data-min)\/(0.8*max-min));\n int blue = 255-red;\n tempPen.setColor(QColor(red,0,blue));\n tempPen.setDashOffset(tempPen.dashOffset()+mDirectionCorrection*mpAnimationWidget->mFlowSpeedMap.find(\"NodeHydraulic\").value()*flowData\/* *fmod(mpAnimationWidget->getLastAnimationTime(),10.0)\/10.0*\/);\n\n for(int i=0; i<mpLines.size(); ++i)\n {\n mpLines[i]->setPen(tempPen);\n }\n\n QPointF startPos = mapFromItem(mpStartComponent->mpModelObject, mpStartComponent->getPortPos(mStartPortName));\n double x1 = startPos.x();\n double y1 = startPos.y();\n double x2 = mpLines.first()->line().x2();\n double y2 = mpLines.first()->line().y2();\n mpLines.first()->setLine(x1, y1, x2, y2);\n\n\n QPointF endPos = mapFromItem(mpEndComponent->mpModelObject, mpEndComponent->getPortPos(mEndPortName));\n x1 = mpLines.last()->line().x1();\n y1 = mpLines.last()->line().y1();\n x2 = endPos.x();\n y2 = endPos.y();\n mpLines.last()->setLine(x1, y1, x2, y2);\n}\n\n\n\/\/------------------------------------------------------------------------------------------------------------------------\/\/\n\n\n\/\/! @brief Constructor for animated connector lines\n\/\/! @param x1 X-coordinate of the start position of the line.\n\/\/! @param y1 Y-coordinate of the start position of the line.\n\/\/! @param x2 X-coordinate of the end position of the line.\n\/\/! @param y2 Y-coordinate of the end position of the line.\n\/\/! @param pConnApp Pointer to the connector appearance data, containing pens\n\/\/! @param *parent Pointer to the parent object (the animated connector)\nAnimatedConnectorLine::AnimatedConnectorLine(qreal x1, qreal y1, qreal x2, qreal y2, ConnectorAppearance* pConnApp, AnimatedConnector *parent)\n : QGraphicsLineItem(x1,y1,x2,y2,parent)\n{\n mpParentConnector = parent;\n setFlags(QGraphicsItem::ItemSendsGeometryChanges | QGraphicsItem::ItemUsesExtendedStyleOption);\n mpConnectorAppearance = pConnApp;\n this->setAcceptHoverEvents(true);\n this->mStartPos = QPointF(x1,y1);\n this->mEndPos = QPointF(x2,y2);\n mHasStartArrow = false;\n mHasEndArrow = false;\n mArrowSize = 8.0;\n mArrowAngle = 0.5;\n}\n\n\n\/\/! @brief Destructor for animated connector lines\nAnimatedConnectorLine::~AnimatedConnectorLine()\n{\n clearArrows();\n}\n\n\n\/\/! @brief Reimplementation of paint function. Removes the ugly dotted selection box.\nvoid AnimatedConnectorLine::paint(QPainter *p, const QStyleOptionGraphicsItem *o, QWidget *w)\n{\n QStyleOptionGraphicsItem *_o = const_cast<QStyleOptionGraphicsItem*>(o);\n _o->state &= ~QStyle::State_Selected;\n QGraphicsLineItem::paint(p,_o,w);\n}\n\n\n\/\/! @brief Adds an arrow at the end of the line\n\/\/! @see addStartArrow()\nvoid AnimatedConnectorLine::addEndArrow()\n{\n clearArrows();\n\n qreal angle = atan2((this->mEndPos.y()-this->mStartPos.y()), (this->mEndPos.x()-this->mStartPos.x()));\n mArrowLine1 = new QGraphicsLineItem(this->mEndPos.x(),\n this->mEndPos.y(),\n this->mEndPos.x()-mArrowSize*cos(angle+mArrowAngle),\n this->mEndPos.y()-mArrowSize*sin(angle+mArrowAngle), this);\n mArrowLine2 = new QGraphicsLineItem(this->mEndPos.x(),\n this->mEndPos.y(),\n this->mEndPos.x()-mArrowSize*cos(angle-mArrowAngle),\n this->mEndPos.y()-mArrowSize*sin(angle-mArrowAngle), this);\n mArrowLine1->setPen(this->pen());\n mArrowLine2->setPen(this->pen());\n mHasEndArrow = true;\n}\n\n\n\/\/! @brief Adds an arrow at the start of the line\n\/\/! @see addEndArrow()\nvoid AnimatedConnectorLine::addStartArrow()\n{\n clearArrows();\n\n qreal angle = atan2((this->mEndPos.y()-this->mStartPos.y()), (this->mEndPos.x()-this->mStartPos.x()));\n mArrowLine1 = new QGraphicsLineItem(this->mStartPos.x(),\n this->mStartPos.y(),\n this->mStartPos.x()+mArrowSize*cos(angle+mArrowAngle),\n this->mStartPos.y()+mArrowSize*sin(angle+mArrowAngle), this);\n mArrowLine2 = new QGraphicsLineItem(this->mStartPos.x(),\n this->mStartPos.y(),\n this->mStartPos.x()+mArrowSize*cos(angle-mArrowAngle),\n this->mStartPos.y()+mArrowSize*sin(angle-mArrowAngle), this);\n mArrowLine1->setPen(this->pen());\n mArrowLine2->setPen(this->pen());\n mHasStartArrow = true;\n}\n\n\/\/! @brief Clears all arrows\nvoid AnimatedConnectorLine::clearArrows()\n{\n if (mHasStartArrow || mHasEndArrow)\n {\n delete mArrowLine1;\n delete mArrowLine2;\n mHasStartArrow = false;\n mHasEndArrow = false;\n }\n}\n\n\n\/\/! @brief Reimplementation of setPen function, used to set the pen style for the arrow lines too\nvoid AnimatedConnectorLine::setPen (const QPen &pen)\n{\n QGraphicsLineItem::setPen(pen);\n if(mHasStartArrow | mHasEndArrow) \/\/Update arrow lines two, but ignore dashes\n {\n QPen tempPen = this->pen();\n tempPen = QPen(tempPen.color(), tempPen.width(), Qt::SolidLine);\n mArrowLine1->setPen(tempPen);\n mArrowLine2->setPen(tempPen);\n }\n}\n<commit_msg>Fixed crash when painting connectors in animation<commit_after>\/*-----------------------------------------------------------------------------\n This source file is part of Hopsan NG\n\n Copyright (c) 2011 \n Mikael Axin, Robert Braun, Alessandro Dell'Amico, Björn Eriksson,\n Peter Nordin, Karl Pettersson, Petter Krus, Ingo Staack\n\n This file is provided \"as is\", with no guarantee or warranty for the\n functionality or reliability of the contents. All contents in this file is\n the original work of the copyright holders at the Division of Fluid and\n Mechatronic Systems (Flumes) at Linköping University. Modifying, using or\n redistributing any part of this file is prohibited without explicit\n permission from the copyright holders.\n-----------------------------------------------------------------------------*\/\n\n\/\/!\n\/\/! @file AnimatedConnector.cpp\n\/\/! @author Robert Braun <robert.braun@liu.se\n\/\/! @date 2012-04-25\n\/\/!\n\/\/! @brief Contains a class for animated connectors\n\/\/!\n\/\/$Id$\n\n#include <QDebug>\n#include <QColor>\n#include <QStyleOptionGraphicsItem>\n\n#include \"MainWindow.h\"\n#include \"GraphicsView.h\"\n#include \"AnimatedConnector.h\"\n#include \"GUIObjects\/AnimatedComponent.h\"\n#include \"Widgets\/ProjectTabWidget.h\"\n#include \"GUIPort.h\"\n#include \"GUIObjects\/GUIModelObject.h\"\n#include \"GUIConnectorAppearance.h\"\n#include \"GUIConnector.h\"\n#include \"GUIObjects\/GUIContainerObject.h\"\n\nclass UndoStack;\n\n\/\/! @brief Constructor for animated connector\n\/\/! @param [in] pConnector Pointer to the real connector the animation represents\n\/\/! @param [in] pAnimationWidget Pointer to animation widget where the connector is shown\nAnimatedConnector::AnimatedConnector(Connector *pConnector, AnimationWidget *pAnimationWidget)\n : QGraphicsWidget()\n{\n mpAnimationWidget = pAnimationWidget;\n mpConnector = pConnector;\n\n mpStartComponent = mpAnimationWidget->getAnimatedComponent(pConnector->getStartComponentName());\n mpEndComponent = mpAnimationWidget->getAnimatedComponent(pConnector->getEndComponentName());\n mStartPortName = pConnector->getStartPortName();\n mEndPortName = pConnector->getEndPortName();\n\n if(pConnector->getStartPort()->getNodeType() == \"NodeHydraulic\" && pConnector->getStartPort()->getPortType() != \"READPORT\" && pConnector->getEndPort()->getPortType() != \"READPORT\")\n {\n if(pConnector->getStartPort()->getPortType() == \"POWERMULTIPORT\")\n {\n int g = pConnector->getParentContainer()->getPlotDataPtr()->getLatestGeneration();\n QString componentName = pConnector->getEndPort()->getGuiModelObject()->getName();\n QString portName = pConnector->getEndPort()->getPortName();\n\n if(!pConnector->getParentContainer()->getPlotDataPtr()->isEmpty())\n {\n mvIntensityData = pConnector->getParentContainer()->getPlotDataPtr()->getPlotDataValues(g, componentName, portName, \"Pressure\");\n mvFlowData = pConnector->getParentContainer()->getPlotDataPtr()->getPlotDataValues(g, componentName, portName, \"Flow\");\n }\n }\n else\n {\n int g = pConnector->getParentContainer()->getPlotDataPtr()->getLatestGeneration();\n QString componentName = pConnector->getStartPort()->getGuiModelObject()->getName();\n QString portName = pConnector->getStartPort()->getPortName();\n\n if(!pConnector->getParentContainer()->getPlotDataPtr()->isEmpty())\n {\n mvIntensityData = pConnector->getParentContainer()->getPlotDataPtr()->getPlotDataValues(g, componentName, portName, \"Pressure\");\n mvFlowData = pConnector->getParentContainer()->getPlotDataPtr()->getPlotDataValues(g, componentName, portName, \"Flow\");\n }\n }\n\n if(mpConnector->getStartPort()->getPortType() == \"POWERMULTIPORT\")\n {\n mComponentName = mpConnector->getEndPort()->getGuiModelObject()->getName();\n mPortName = mpConnector->getEndPort()->getPortName();\n }\n else\n {\n mComponentName = mpConnector->getStartPort()->getGuiModelObject()->getName();\n mPortName = mpConnector->getStartPort()->getPortName();\n }\n\n }\n\n \/\/ Determine appearance\n mpConnectorAppearance = pConnector->mpConnectorAppearance;\n\n mPoints = pConnector->mPoints;\n\n \/\/ Create the lines\n for(int i=0; i < mPoints.size()-1; ++i)\n {\n AnimatedConnectorLine *pLine = new AnimatedConnectorLine(mapFromScene(mPoints[i]).x(), mapFromScene(mPoints[i]).y(),\n mapFromScene(mPoints[i+1]).x(), mapFromScene(mPoints[i+1]).y(),\n mpConnectorAppearance, this);\n\n QPen tempPen = pConnector->mpLines.at(i)->pen();\n mpLines.push_back(pLine);\n if(pConnector->mpLines.at(i)->mHasStartArrow)\n {\n pLine->addStartArrow();\n }\n if(pConnector->mpLines.at(i)->mHasEndArrow)\n {\n pLine->addEndArrow();\n }\n pLine->setPen(tempPen);\n }\n\n if(pConnector->getStartPort()->getGuiModelObject()->getTypeCQS() == \"C\")\n {\n mDirectionCorrection = 1;\n }\n else\n {\n mDirectionCorrection = -1;\n }\n}\n\n\n\/\/! @brief Destructor for animated connector class\nAnimatedConnector::~AnimatedConnector()\n{\n delete mpConnectorAppearance;\n}\n\n\n\/\/! @brief Updates the animated connector\nvoid AnimatedConnector::updateAnimation()\n{\n if(mpConnector->getStartPort()->getNodeType() != \"NodeHydraulic\")\n {\n return;\n }\n\n double max = mpAnimationWidget->mIntensityMaxMap.find(\"NodeHydraulic\").value();\n double min = mpAnimationWidget->mIntensityMinMap.find(\"NodeHydraulic\").value();\n\n QPen tempPen = mpLines.first()->pen();\n tempPen.setDashPattern(QVector<qreal>() << 1.5 << 3.5);\n\n double data, flowData;\n if(mpAnimationWidget->isRealTimeAnimation()) \/\/Real-time animation\n {\n mpAnimationWidget->mpContainer->getCoreSystemAccessPtr()->getLastNodeData(mComponentName, mPortName, \"Pressure\", data);\n mpAnimationWidget->mpContainer->getCoreSystemAccessPtr()->getLastNodeData(mComponentName, mPortName, \"Flow\", flowData);\n }\n else if(!mvIntensityData.isEmpty()) \/\/Replay animation\n {\n int index = mpAnimationWidget->getIndex();\n data = mvIntensityData[index];\n flowData = mvFlowData[index];\n }\n\n int red = std::min(255.0, 255*(data-min)\/(0.8*max-min));\n int blue = 255-red;\n tempPen.setColor(QColor(red,0,blue));\n tempPen.setDashOffset(tempPen.dashOffset()+mDirectionCorrection*mpAnimationWidget->mFlowSpeedMap.find(\"NodeHydraulic\").value()*flowData\/* *fmod(mpAnimationWidget->getLastAnimationTime(),10.0)\/10.0*\/);\n\n for(int i=0; i<mpLines.size(); ++i)\n {\n mpLines[i]->setPen(tempPen);\n }\n\n QPointF startPos = mapFromItem(mpStartComponent->mpModelObject, mpStartComponent->getPortPos(mStartPortName));\n double x1 = startPos.x();\n double y1 = startPos.y();\n double x2 = mpLines.first()->line().x2();\n double y2 = mpLines.first()->line().y2();\n mpLines.first()->setLine(x1, y1, x2, y2);\n\n\n QPointF endPos = mapFromItem(mpEndComponent->mpModelObject, mpEndComponent->getPortPos(mEndPortName));\n x1 = mpLines.last()->line().x1();\n y1 = mpLines.last()->line().y1();\n x2 = endPos.x();\n y2 = endPos.y();\n mpLines.last()->setLine(x1, y1, x2, y2);\n}\n\n\n\/\/------------------------------------------------------------------------------------------------------------------------\/\/\n\n\n\/\/! @brief Constructor for animated connector lines\n\/\/! @param x1 X-coordinate of the start position of the line.\n\/\/! @param y1 Y-coordinate of the start position of the line.\n\/\/! @param x2 X-coordinate of the end position of the line.\n\/\/! @param y2 Y-coordinate of the end position of the line.\n\/\/! @param pConnApp Pointer to the connector appearance data, containing pens\n\/\/! @param *parent Pointer to the parent object (the animated connector)\nAnimatedConnectorLine::AnimatedConnectorLine(qreal x1, qreal y1, qreal x2, qreal y2, ConnectorAppearance* pConnApp, AnimatedConnector *parent)\n : QGraphicsLineItem(x1,y1,x2,y2,parent)\n{\n mpParentConnector = parent;\n setFlags(QGraphicsItem::ItemSendsGeometryChanges | QGraphicsItem::ItemUsesExtendedStyleOption);\n mpConnectorAppearance = pConnApp;\n this->setAcceptHoverEvents(true);\n this->mStartPos = QPointF(x1,y1);\n this->mEndPos = QPointF(x2,y2);\n mHasStartArrow = false;\n mHasEndArrow = false;\n mArrowSize = 8.0;\n mArrowAngle = 0.5;\n}\n\n\n\/\/! @brief Destructor for animated connector lines\nAnimatedConnectorLine::~AnimatedConnectorLine()\n{\n clearArrows();\n}\n\n\n\/\/! @brief Reimplementation of paint function. Removes the ugly dotted selection box.\nvoid AnimatedConnectorLine::paint(QPainter *p, const QStyleOptionGraphicsItem *o, QWidget *w)\n{\n QStyleOptionGraphicsItem *_o = const_cast<QStyleOptionGraphicsItem*>(o);\n _o->state &= ~QStyle::State_Selected;\n QGraphicsLineItem::paint(p,_o,w);\n}\n\n\n\/\/! @brief Adds an arrow at the end of the line\n\/\/! @see addStartArrow()\nvoid AnimatedConnectorLine::addEndArrow()\n{\n clearArrows();\n\n qreal angle = atan2((this->mEndPos.y()-this->mStartPos.y()), (this->mEndPos.x()-this->mStartPos.x()));\n mArrowLine1 = new QGraphicsLineItem(this->mEndPos.x(),\n this->mEndPos.y(),\n this->mEndPos.x()-mArrowSize*cos(angle+mArrowAngle),\n this->mEndPos.y()-mArrowSize*sin(angle+mArrowAngle), this);\n mArrowLine2 = new QGraphicsLineItem(this->mEndPos.x(),\n this->mEndPos.y(),\n this->mEndPos.x()-mArrowSize*cos(angle-mArrowAngle),\n this->mEndPos.y()-mArrowSize*sin(angle-mArrowAngle), this);\n mArrowLine1->setPen(this->pen());\n mArrowLine2->setPen(this->pen());\n mHasEndArrow = true;\n}\n\n\n\/\/! @brief Adds an arrow at the start of the line\n\/\/! @see addEndArrow()\nvoid AnimatedConnectorLine::addStartArrow()\n{\n clearArrows();\n\n qreal angle = atan2((this->mEndPos.y()-this->mStartPos.y()), (this->mEndPos.x()-this->mStartPos.x()));\n mArrowLine1 = new QGraphicsLineItem(this->mStartPos.x(),\n this->mStartPos.y(),\n this->mStartPos.x()+mArrowSize*cos(angle+mArrowAngle),\n this->mStartPos.y()+mArrowSize*sin(angle+mArrowAngle), this);\n mArrowLine2 = new QGraphicsLineItem(this->mStartPos.x(),\n this->mStartPos.y(),\n this->mStartPos.x()+mArrowSize*cos(angle-mArrowAngle),\n this->mStartPos.y()+mArrowSize*sin(angle-mArrowAngle), this);\n mArrowLine1->setPen(this->pen());\n mArrowLine2->setPen(this->pen());\n mHasStartArrow = true;\n}\n\n\/\/! @brief Clears all arrows\nvoid AnimatedConnectorLine::clearArrows()\n{\n if (mHasStartArrow || mHasEndArrow)\n {\n delete mArrowLine1;\n delete mArrowLine2;\n mHasStartArrow = false;\n mHasEndArrow = false;\n }\n}\n\n\n\/\/! @brief Reimplementation of setPen function, used to set the pen style for the arrow lines too\nvoid AnimatedConnectorLine::setPen (const QPen &pen)\n{\n QGraphicsLineItem::setPen(pen);\n if(mHasStartArrow | mHasEndArrow) \/\/Update arrow lines two, but ignore dashes\n {\n QPen tempPen = this->pen();\n tempPen = QPen(tempPen.color(), tempPen.width(), Qt::SolidLine);\n mArrowLine1->setPen(tempPen);\n mArrowLine2->setPen(tempPen);\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: quadtree.hh 17 2005-03-08 23:58:43Z pavlenko $\n\n#ifndef QUADTREE_HPP\n#define QUADTREE_HPP\n\/\/ stl\n#include <cstring> \n#include <vector>\n#include <fstream>\n#include <iostream>\n\/\/ mapnik\n#include <mapnik\/box2d.hpp>\n\nusing mapnik::box2d;\nusing mapnik::coord2d;\n\ntemplate <typename T>\nstruct quadtree_node\n{\n box2d<double> ext_;\n std::vector<T> data_;\n quadtree_node<T>* children_[4];\n quadtree_node(const box2d<double>& ext)\n : ext_(ext),data_()\n {\n memset(children_,0,sizeof(quadtree_node<T>*)*4);\n }\n\n ~quadtree_node() \n {\n for (int i=0;i<4;++i) \n {\n if (children_[i]) \n {\n delete children_[i],children_[i]=0;\n }\n }\n }\n\n int num_subnodes() const \n {\n int count=0;\n for (int i=0;i<4;++i) \n {\n if (children_[i]) \n {\n ++count;\n }\n }\n return count;\n } \n};\n\ntemplate <typename T>\nclass quadtree\n{\nprivate:\n quadtree_node<T>* root_;\n const int maxdepth_;\n const double ratio_;\npublic:\n quadtree(const box2d<double>& extent,int maxdepth,double ratio)\n : root_(new quadtree_node<T>(extent)),\n maxdepth_(maxdepth),\n ratio_(ratio) {}\n\n ~quadtree()\n {\n if (root_) delete root_;\n }\n \n void insert(const T& data,const box2d<double>& item_ext)\n {\n insert(data,item_ext,root_,maxdepth_);\n }\n \n int count() const\n {\n return count_nodes(root_);\n }\n \n int count_items() const \n {\n int count=0;\n count_items(root_,count);\n return count;\n }\n \n void print() const\n {\n print(root_);\n }\n \n void trim() \n {\n trim_tree(root_);\n } \n \n void write(std::ostream& out)\n {\n char header[16];\n memset(header,0,16);\n header[0]='m';\n header[1]='a';\n header[2]='p';\n header[3]='n';\n header[4]='i';\n header[5]='k';\n out.write(header,16);\n write_node(out,root_);\n }\n\nprivate:\n\n void trim_tree(quadtree_node<T>*& node)\n { \n if (node) \n {\n for (int i=0;i<4;++i)\n { \n trim_tree(node->children_[i]); \n }\n\n if (node->num_subnodes()==1 && node->data_.size()==0)\n {\n for (int i=0;i<4;++i) \n {\n if (node->children_[i])\n { \n node=node->children_[i];\n break; \n }\n }\n } \n }\n }\n\n int count_nodes(const quadtree_node<T>* node) const\n {\n if (!node)\n {\n return 0;\n }\n else\n {\n int count = 1;\n for (int i=0;i<4;++i)\n {\n count += count_nodes(node->children_[i]);\n }\n return count;\n }\n }\n\n void count_items(const quadtree_node<T>* node,int& count) const\n {\n if (node)\n {\n count += node->data_.size(); \n for (int i=0;i<4;++i)\n {\n count_items(node->children_[i],count);\n } \n }\n }\n\n int subnode_offset(const quadtree_node<T>* node) const\n {\n int offset=0;\n for (int i=0;i<4;i++)\n {\n if (node->children_[i])\n {\n offset +=sizeof(box2d<double>)+(node->children_[i]->data_.size()*sizeof(T))+3*sizeof(int);\n offset +=subnode_offset(node->children_[i]);\n }\n }\n return offset;\n }\n\n void write_node(std::ostream& out,const quadtree_node<T>* node) const\n {\n if (node)\n {\n int offset=subnode_offset(node);\n int shape_count=node->data_.size();\n int recsize=sizeof(box2d<double>) + 3 * sizeof(int) + shape_count * sizeof(T);\n char* node_record=new char[recsize];\n memset(node_record,0,recsize);\n memcpy(node_record,&offset,4);\n memcpy(node_record+4,&node->ext_,sizeof(box2d<double>));\n memcpy(node_record+36,&shape_count,4);\n for (int i=0;i<shape_count;++i)\n {\n memcpy(node_record + 40 + i * sizeof(T),&(node->data_[i]),sizeof(T));\n }\n int num_subnodes=0;\n for (int i=0;i<4;++i)\n {\n if (node->children_[i])\n {\n ++num_subnodes;\n }\n }\n memcpy(node_record + 40 + shape_count * sizeof(T),&num_subnodes,4);\n out.write(node_record,recsize);\n delete [] node_record;\n\n for (int i=0;i<4;++i)\n {\n write_node(out,node->children_[i]);\n }\n }\n }\n\n void print(const quadtree_node<T>* node,int level=0) const\n {\n if (node)\n {\n typename std::vector<T>::const_iterator itr=node->data_.begin();\n std::string pad;\n for (int i=0;i<level;++i)\n {\n pad+=\" \";\n }\n std::clog<<pad<<\"node \"<<node<<\" extent:\"<<node->ext_<<std::endl;\n std::clog<<pad;\n while(itr!=node->data_.end())\n {\n std::clog<<*itr<<\" \";\n ++itr;\n }\n std::clog<<std::endl;\n for (int i=0;i<4;++i)\n {\n print(node->children_[i],level+4);\n }\n }\n }\n\n void insert(const T& data,const box2d<double>& item_ext,quadtree_node<T>* node,int maxdepth)\n {\n if (node && node->ext_.contains(item_ext))\n {\n coord2d c=node->ext_.center();\n\n double width=node->ext_.width();\n double height=node->ext_.height();\n\n double lox=node->ext_.minx();\n double loy=node->ext_.miny();\n double hix=node->ext_.maxx();\n double hiy=node->ext_.maxy();\n\n box2d<double> ext[4];\n ext[0]=box2d<double>(lox,loy,lox + width * ratio_,loy + height * ratio_);\n ext[1]=box2d<double>(hix - width * ratio_,loy,hix,loy + height * ratio_);\n ext[2]=box2d<double>(lox,hiy - height*ratio_,lox + width * ratio_,hiy);\n ext[3]=box2d<double>(hix - width * ratio_,hiy - height*ratio_,hix,hiy);\n\n if (maxdepth > 1)\n {\n for (int i=0;i<4;++i)\n {\n if (ext[i].contains(item_ext))\n {\n if (!node->children_[i])\n {\n node->children_[i]=new quadtree_node<T>(ext[i]);\n }\n insert(data,item_ext,node->children_[i],maxdepth-1);\n return;\n }\n }\n }\n node->data_.push_back(data);\n }\n }\n};\n#endif \/\/QUADTREE_HPP\n<commit_msg>quadtree: remove unused variable<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: quadtree.hh 17 2005-03-08 23:58:43Z pavlenko $\n\n#ifndef QUADTREE_HPP\n#define QUADTREE_HPP\n\/\/ stl\n#include <cstring> \n#include <vector>\n#include <fstream>\n#include <iostream>\n\/\/ mapnik\n#include <mapnik\/box2d.hpp>\n\nusing mapnik::box2d;\nusing mapnik::coord2d;\n\ntemplate <typename T>\nstruct quadtree_node\n{\n box2d<double> ext_;\n std::vector<T> data_;\n quadtree_node<T>* children_[4];\n quadtree_node(const box2d<double>& ext)\n : ext_(ext),data_()\n {\n memset(children_,0,sizeof(quadtree_node<T>*)*4);\n }\n\n ~quadtree_node() \n {\n for (int i=0;i<4;++i) \n {\n if (children_[i]) \n {\n delete children_[i],children_[i]=0;\n }\n }\n }\n\n int num_subnodes() const \n {\n int count=0;\n for (int i=0;i<4;++i) \n {\n if (children_[i]) \n {\n ++count;\n }\n }\n return count;\n } \n};\n\ntemplate <typename T>\nclass quadtree\n{\nprivate:\n quadtree_node<T>* root_;\n const int maxdepth_;\n const double ratio_;\npublic:\n quadtree(const box2d<double>& extent,int maxdepth,double ratio)\n : root_(new quadtree_node<T>(extent)),\n maxdepth_(maxdepth),\n ratio_(ratio) {}\n\n ~quadtree()\n {\n if (root_) delete root_;\n }\n \n void insert(const T& data,const box2d<double>& item_ext)\n {\n insert(data,item_ext,root_,maxdepth_);\n }\n \n int count() const\n {\n return count_nodes(root_);\n }\n \n int count_items() const \n {\n int count=0;\n count_items(root_,count);\n return count;\n }\n \n void print() const\n {\n print(root_);\n }\n \n void trim() \n {\n trim_tree(root_);\n } \n \n void write(std::ostream& out)\n {\n char header[16];\n memset(header,0,16);\n header[0]='m';\n header[1]='a';\n header[2]='p';\n header[3]='n';\n header[4]='i';\n header[5]='k';\n out.write(header,16);\n write_node(out,root_);\n }\n\nprivate:\n\n void trim_tree(quadtree_node<T>*& node)\n { \n if (node) \n {\n for (int i=0;i<4;++i)\n { \n trim_tree(node->children_[i]); \n }\n\n if (node->num_subnodes()==1 && node->data_.size()==0)\n {\n for (int i=0;i<4;++i) \n {\n if (node->children_[i])\n { \n node=node->children_[i];\n break; \n }\n }\n } \n }\n }\n\n int count_nodes(const quadtree_node<T>* node) const\n {\n if (!node)\n {\n return 0;\n }\n else\n {\n int count = 1;\n for (int i=0;i<4;++i)\n {\n count += count_nodes(node->children_[i]);\n }\n return count;\n }\n }\n\n void count_items(const quadtree_node<T>* node,int& count) const\n {\n if (node)\n {\n count += node->data_.size(); \n for (int i=0;i<4;++i)\n {\n count_items(node->children_[i],count);\n } \n }\n }\n\n int subnode_offset(const quadtree_node<T>* node) const\n {\n int offset=0;\n for (int i=0;i<4;i++)\n {\n if (node->children_[i])\n {\n offset +=sizeof(box2d<double>)+(node->children_[i]->data_.size()*sizeof(T))+3*sizeof(int);\n offset +=subnode_offset(node->children_[i]);\n }\n }\n return offset;\n }\n\n void write_node(std::ostream& out,const quadtree_node<T>* node) const\n {\n if (node)\n {\n int offset=subnode_offset(node);\n int shape_count=node->data_.size();\n int recsize=sizeof(box2d<double>) + 3 * sizeof(int) + shape_count * sizeof(T);\n char* node_record=new char[recsize];\n memset(node_record,0,recsize);\n memcpy(node_record,&offset,4);\n memcpy(node_record+4,&node->ext_,sizeof(box2d<double>));\n memcpy(node_record+36,&shape_count,4);\n for (int i=0;i<shape_count;++i)\n {\n memcpy(node_record + 40 + i * sizeof(T),&(node->data_[i]),sizeof(T));\n }\n int num_subnodes=0;\n for (int i=0;i<4;++i)\n {\n if (node->children_[i])\n {\n ++num_subnodes;\n }\n }\n memcpy(node_record + 40 + shape_count * sizeof(T),&num_subnodes,4);\n out.write(node_record,recsize);\n delete [] node_record;\n\n for (int i=0;i<4;++i)\n {\n write_node(out,node->children_[i]);\n }\n }\n }\n\n void print(const quadtree_node<T>* node,int level=0) const\n {\n if (node)\n {\n typename std::vector<T>::const_iterator itr=node->data_.begin();\n std::string pad;\n for (int i=0;i<level;++i)\n {\n pad+=\" \";\n }\n std::clog<<pad<<\"node \"<<node<<\" extent:\"<<node->ext_<<std::endl;\n std::clog<<pad;\n while(itr!=node->data_.end())\n {\n std::clog<<*itr<<\" \";\n ++itr;\n }\n std::clog<<std::endl;\n for (int i=0;i<4;++i)\n {\n print(node->children_[i],level+4);\n }\n }\n }\n\n void insert(const T& data,const box2d<double>& item_ext,quadtree_node<T>* node,int maxdepth)\n {\n if (node && node->ext_.contains(item_ext))\n {\n double width=node->ext_.width();\n double height=node->ext_.height();\n\n double lox=node->ext_.minx();\n double loy=node->ext_.miny();\n double hix=node->ext_.maxx();\n double hiy=node->ext_.maxy();\n\n box2d<double> ext[4];\n ext[0]=box2d<double>(lox,loy,lox + width * ratio_,loy + height * ratio_);\n ext[1]=box2d<double>(hix - width * ratio_,loy,hix,loy + height * ratio_);\n ext[2]=box2d<double>(lox,hiy - height*ratio_,lox + width * ratio_,hiy);\n ext[3]=box2d<double>(hix - width * ratio_,hiy - height*ratio_,hix,hiy);\n\n if (maxdepth > 1)\n {\n for (int i=0;i<4;++i)\n {\n if (ext[i].contains(item_ext))\n {\n if (!node->children_[i])\n {\n node->children_[i]=new quadtree_node<T>(ext[i]);\n }\n insert(data,item_ext,node->children_[i],maxdepth-1);\n return;\n }\n }\n }\n node->data_.push_back(data);\n }\n }\n};\n#endif \/\/QUADTREE_HPP\n<|endoftext|>"} {"text":"<commit_before>#include \"otc\/write_dot.h\"\n#include <algorithm>\n#include \"otc\/embedded_tree.h\"\n#include \"otc\/embedding.h\"\n#include \"otc\/tree.h\"\n#include \"otc\/tree_data.h\"\n#include \"otc\/tree_iter.h\"\n#include \"otc\/tree_operations.h\"\n\nnamespace otc {\n\ntypedef std::pair<const NodeWithSplits *, std::string> ToDotKey;\ntypedef std::map<ToDotKey, std::vector<std::string>> NodeToDotNames;\nvoid writeNodeDOT(std::ostream & out,\n const NodeWithSplits * nd,\n NodeToDotNames & nd2name,\n std::set<std::string> & names,\n const std::string &style, \n bool forceMRCANaming,\n const std::string & prefix,\n bool writeLabel,\n bool pt);\n\nvoid writeDOTEdge(std::ostream & out,\n const ToDotKey anc,\n const ToDotKey des,\n NodeToDotNames & nd2name,\n const std::string &style, \n bool toMidEdge);\n\nvoid writeDOTCrossEdge(std::ostream & out,\n const ToDotKey anc,\n const ToDotKey des,\n NodeToDotNames & nd2name,\n const std::string &style);\n\nvoid writePathPairingToDOT(std::ostream & out,\n const PathPairingWithSplits & pp,\n NodeToDotNames & nd2name,\n std::set<std::string> & names,\n std::set<const PathPairingWithSplits *> & pathSet,\n const char * color,\n const char * prefix) ;\n\nvoid writeDOTEmbeddingForNode(std::ostream & out,\n const NodeEmbeddingWithSplits & thr,\n NodeToDotNames & nd2name,\n std::set<std::string> & names,\n std::set<const PathPairingWithSplits *> & pathSet,\n const char * color,\n const char * prefix,\n std::size_t treeIndex\n );\n\/\/ IMPL\n\nconstexpr const char * COLORS [] = {\"crimson\",\n \"blue\",\n \"springgreen\",\n \"magenta\",\n \"darkorange\",\n \"lightblue\",\n \"goldenrod\",\n \"brown\",\n \"gray\"};\nconstexpr unsigned LAST_COLOR_IND = 8;\n\n\n\n\n\ntypedef std::pair<const NodeWithSplits *, std::string> ToDotKey;\ntypedef std::map<ToDotKey, std::vector<std::string>> NodeToDotNames;\n\n\n\nvoid writeNodeDOT(std::ostream & out,\n const NodeWithSplits * nd,\n NodeToDotNames & nd2name,\n std::set<std::string> & names,\n const std::string &style, \n bool forceMRCANaming,\n const std::string & prefix,\n bool writeLabel,\n bool pt) {\n const ToDotKey k{nd, prefix};\n std::string name;\n std::string unadorned;\n if (pt) {\n name = nd2name.at(k)[0];\n unadorned = name;\n } else {\n if (contains(nd2name, k)) {\n return;\n }\n if (nd->isTip() && !prefix.empty()) {\n return;\n } else {\n name.append(std::string(prefix));\n unadorned = forceMRCANaming ? getMRCADesignator(*nd) : getDesignator(*nd);\n name.append(unadorned);\n nd2name[k].push_back(name);\n }\n }\n out << \" \\\"\" << name << \"\\\"[\";\n if (pt) {\n out << \"shape=point label=\\\"\\\" \";\n } else {\n if (writeLabel || nd->isTip()) {\n out << \"label=\\\"\" << unadorned << \"\\\" \";\n } else {\n out << \"label=\\\"\\\" \";\n }\n }\n if (!style.empty()) {\n out << style;\n }\n out << \"];\\n\";\n names.insert(name);\n}\n\nvoid writeDOTEdge(std::ostream & out,\n const ToDotKey anc,\n const ToDotKey des,\n NodeToDotNames & nd2name,\n const std::string &style, \n bool \/*toMidEdge*\/) {\n out << \" \\\"\" << nd2name[anc][0] << \"\\\" -> \\\"\" << nd2name[des][0] << '\\\"';\n if (!style.empty()) {\n out << \"[\" << style <<']';\n }\n out << \";\\n\";\n}\n\nvoid writeDOTCrossEdge(std::ostream & out,\n const ToDotKey anc,\n const ToDotKey des,\n NodeToDotNames & nd2name,\n const std::string &style) {\n out << \" \\\"\" << nd2name[anc][0] << \"\\\" -> \\\"\" << nd2name[des][0] << '\\\"';\n if (!style.empty()) {\n out << \"[arrowhead=none \" << style <<']';\n }\n out << \";\\n\";\n}\n\nvoid writePathPairingToDOT(std::ostream & out,\n const PathPairingWithSplits & pp,\n NodeToDotNames & nd2name,\n std::set<std::string> & names,\n std::set<const PathPairingWithSplits *> & pathSet,\n const char * color,\n const char * prefix) {\n if (contains(pathSet, &pp)) {\n return;\n }\n pathSet.insert(&pp);\n std::string style = \"fontcolor=\\\"\";\n style.append(color);\n style.append(\"\\\" style=\\\"dashed\\\" color=\\\"\");\n style.append(color);\n style.append(\"\\\"\");\n \n const auto * pn = pp.phyloParent;\n const auto * pd = pp.phyloChild;\n writeNodeDOT(out, pn, nd2name, names, style, true, prefix, false, false);\n writeNodeDOT(out, pd, nd2name, names, style, false, prefix, false, false);\n ToDotKey pk{pd, \"_path\"};\n nd2name[pk].push_back(\"_\" + std::to_string((long)(&pp)));\n writeNodeDOT(out, pd, nd2name, names, style, false, \"_path\", false, true);\n writeDOTEdge(out, ToDotKey{pn, prefix}, pk, nd2name, style, true);\n const auto * sn = pp.scaffoldAnc;\n const auto * sd = pp.scaffoldDes;\n if (pd->isTip()) {\n writeDOTEdge(out, pk, ToDotKey{sd, \"\"}, nd2name, style, false);\n } else {\n writeDOTEdge(out, pk, ToDotKey{pd, prefix}, nd2name, style, false);\n }\n ToDotKey sk{sd, \"_path\"};\n nd2name[sk].push_back(\"_\" + std::to_string((long)(&pp)));\n writeNodeDOT(out, sn, nd2name, names, style, true, prefix, false, false);\n writeNodeDOT(out, sd, nd2name, names, style, false, prefix, false, false);\n writeNodeDOT(out, sd, nd2name, names, style, false, \"_path\", false, true);\n writeDOTEdge(out, ToDotKey{sn, \"\"}, sk, nd2name, style, true);\n writeDOTEdge(out, sk, ToDotKey{sd, \"\"}, nd2name, style, false);\n style.append(\" style=\\\"dotted\\\"\");\n writeDOTCrossEdge(out, pk, sk, nd2name, style);\n}\n\nvoid writeDOTEmbeddingForNode(std::ostream & out,\n const NodeEmbeddingWithSplits & thr,\n NodeToDotNames & nd2name,\n std::set<std::string> & names,\n std::set<const PathPairingWithSplits *> & pathSet,\n const char * color,\n const char * prefix,\n std::size_t treeIndex\n ) {\n const auto eait = thr.edgeBelowEmbeddings.find(treeIndex);\n if (eait != thr.edgeBelowEmbeddings.end()) {\n for (const auto & pp : eait->second) {\n writePathPairingToDOT(out, *pp, nd2name, names, pathSet, color, prefix);\n }\n }\n const auto lait = thr.loopEmbeddings.find(treeIndex);\n if (lait != thr.loopEmbeddings.end()) {\n for (const auto & pp : lait->second) {\n writePathPairingToDOT(out, *pp, nd2name, names, pathSet, color, prefix);\n }\n }\n}\n\nvoid writeDOTForEmbedding(std::ostream & out,\n const NodeWithSplits * nd,\n const std::vector<TreeMappedWithSplits *> & tv,\n const std::map<const NodeWithSplits *, NodeEmbeddingWithSplits> & eForNd,\n bool entireSubtree) {\n NodeToDotNames nd2name;\n std::set<std::string> names;\n out << \"digraph G{\\n\";\n for (auto n : iter_pre_n_const(nd)) {\n writeNodeDOT(out, n, nd2name, names, \"\", false, \"\", true, false);\n }\n for (auto n : iter_pre_n_const(nd)) {\n auto p = n->getParent();\n if (p == nullptr) {\n continue;\n }\n ToDotKey nk{n, \"\"};\n ToDotKey pk{p, \"\"};\n out << \" \" << nd2name[pk][0] << \" -> \" << nd2name[nk][0] << \";\\n\";\n }\n std::set<const PathPairingWithSplits *> pathSet;\n const auto nt = tv.size();\n for (auto n : iter_pre_n_const(nd)) {\n const NodeEmbeddingWithSplits & thr = eForNd.at(n);\n for (auto i = 0U; i < nt; ++i) {\n const std::string tP = std::string(\"t\") + std::to_string(i);\n auto colorIndex = std::min(LAST_COLOR_IND, i);\n const char * color = COLORS[colorIndex];\n writeDOTEmbeddingForNode(out, thr, nd2name, names, pathSet, color, tP.c_str(), i);\n }\n if (!entireSubtree) {\n break;\n }\n }\n out << \"}\\n\";\n}\n\n} \/\/ namespace otc\n\n<commit_msg>cleanup<commit_after>#include \"otc\/write_dot.h\"\n#include <algorithm>\n#include \"otc\/embedded_tree.h\"\n#include \"otc\/embedding.h\"\n#include \"otc\/tree.h\"\n#include \"otc\/tree_data.h\"\n#include \"otc\/tree_iter.h\"\n#include \"otc\/tree_operations.h\"\n\nnamespace otc {\ntypedef std::pair<const NodeWithSplits *, std::string> ToDotKey;\ntypedef std::pair<std::string, std::string> NamePair; \/\/ nodeName and nodeLabel\ntypedef std::map<ToDotKey, NamePair> NodeToDotNames;\n\nvoid writeNodeDOT(std::ostream & out,\n const NodeWithSplits * nd,\n NodeToDotNames & nd2name,\n const std::string &style, \n bool forceMRCANaming,\n const std::string & prefix,\n bool writeLabel,\n bool pt);\nvoid writeDOTEdge(std::ostream & out,\n const ToDotKey anc,\n const ToDotKey des,\n NodeToDotNames & nd2name,\n const std::string &style, \n bool toMidEdge);\nvoid writeDOTCrossEdge(std::ostream & out,\n const ToDotKey anc,\n const ToDotKey des,\n NodeToDotNames & nd2name,\n const std::string &style);\nvoid writePathPairingToDOT(std::ostream & out,\n const PathPairingWithSplits & pp,\n NodeToDotNames & nd2name,\n std::set<const PathPairingWithSplits *> & pathSet,\n const char * color,\n const char * prefix) ;\nvoid writeDOTEmbeddingForNode(std::ostream & out,\n const NodeEmbeddingWithSplits & thr,\n NodeToDotNames & nd2name,\n std::set<const PathPairingWithSplits *> & pathSet,\n const char * color,\n const char * prefix,\n std::size_t treeIndex\n );\n\/\/ IMPL\nconstexpr const char * COLORS [] = {\"crimson\",\n \"blue\",\n \"springgreen\",\n \"magenta\",\n \"darkorange\",\n \"lightblue\",\n \"goldenrod\",\n \"brown\",\n \"gray\"};\nconstexpr unsigned LAST_COLOR_IND = 8;\n\nvoid writeNodeDOT(std::ostream & out,\n const NodeWithSplits * nd,\n NodeToDotNames & nd2name,\n const std::string &style, \n bool forceMRCANaming,\n const std::string & prefix,\n bool writeLabel,\n bool pt) {\n const ToDotKey k{nd, prefix};\n if (!pt) {\n if (contains(nd2name, k)) {\n return;\n }\n if (nd->isTip() && !prefix.empty()) {\n return;\n }\n std::string name{prefix};\n const std::string unadorned = forceMRCANaming ? getMRCADesignator(*nd) : getDesignator(*nd);\n name.append(unadorned);\n nd2name.emplace(k, NamePair{name, unadorned});\n }\n const NamePair & np = nd2name.at(k);\n out << \" \\\"\" << np.first << \"\\\"[\";\n if (pt) {\n out << \"shape=point \";\n }\n if ((!pt) && (writeLabel || nd->isTip())) {\n out << \"label=\\\"\" << np.second << \"\\\" \";\n } else {\n out << \"label=\\\"\\\" \";\n }\n if (!style.empty()) {\n out << style;\n }\n out << \"];\\n\";\n}\n\nvoid writeDOTEdge(std::ostream & out,\n const ToDotKey anc,\n const ToDotKey des,\n NodeToDotNames & nd2name,\n const std::string &style, \n bool \/*toMidEdge*\/) {\n out << \" \\\"\" << nd2name.at(anc).first << \"\\\" -> \\\"\" << nd2name.at(des).first << '\\\"';\n if (!style.empty()) {\n out << \"[\" << style <<']';\n }\n out << \";\\n\";\n}\n\nvoid writeDOTCrossEdge(std::ostream & out,\n const ToDotKey anc,\n const ToDotKey des,\n NodeToDotNames & nd2name,\n const std::string &style) {\n std::string s = \"arrowhead=none \";\n s += style;\n writeDOTEdge(out, anc, des, nd2name, s, true);\n}\n\n\nvoid writeOneSideOfPathPairingToDOT(std::ostream & out,\n const NodeWithSplits * pn,\n const NodeWithSplits * pd,\n const NodeWithSplits * sd,\n const ToDotKey & midPointKey,\n const NamePair & namePair,\n NodeToDotNames & nd2name,\n const std::string & style,\n const char * prefix);\n\nvoid writeOneSideOfPathPairingToDOT(std::ostream & out,\n const NodeWithSplits * pn,\n const NodeWithSplits * pd,\n const NodeWithSplits * sd,\n const ToDotKey & midPointKey,\n const NamePair & namePair,\n NodeToDotNames & nd2name,\n const std::string & style,\n const char * prefix) {\n writeNodeDOT(out, pn, nd2name, style, true, prefix, false, false);\n writeNodeDOT(out, pd, nd2name, style, false, prefix, false, false);\n nd2name[midPointKey] = namePair;\n writeNodeDOT(out, pd, nd2name, style, false, \"_path\", false, true);\n writeDOTEdge(out, ToDotKey{pn, prefix}, midPointKey, nd2name, style, true);\n if (pd->isTip() && sd != pd) {\n writeDOTEdge(out, midPointKey, ToDotKey{sd, \"\"}, nd2name, style, false);\n } else {\n writeDOTEdge(out, midPointKey, ToDotKey{pd, prefix}, nd2name, style, false);\n }\n \n}\n\nvoid writePathPairingToDOT(std::ostream & out,\n const PathPairingWithSplits & pp,\n NodeToDotNames & nd2name,\n std::set<const PathPairingWithSplits *> & pathSet,\n const char * color,\n const char * prefix) {\n if (contains(pathSet, &pp)) {\n return;\n }\n const std::string emptyStr;\n pathSet.insert(&pp);\n std::string style = \"fontcolor=\\\"\";\n style.append(color);\n style.append(\"\\\" style=\\\"dashed\\\" color=\\\"\");\n style.append(color);\n style.append(\"\\\"\");\n \/\/ The midpoint nodes are unlabeled dots with IDs that are _addr or __addr\n const std::string pname =\"_\" + std::to_string((long)(&pp));\n const std::string sname =\"__\" + std::to_string((long)(&pp));\n const NamePair pv{pname, emptyStr};\n const NamePair sv{pname, emptyStr};\n const auto * pn = pp.phyloParent;\n const auto * pd = pp.phyloChild;\n const auto * sd = pp.scaffoldDes;\n const ToDotKey pk{pd, \"_phpath\"};\n writeOneSideOfPathPairingToDOT(out, pn, pd, sd, pk, pv, nd2name, color, prefix);\n const auto * sn = pp.scaffoldAnc;\n const ToDotKey sk{sd, \"_scpath\"};\n writeOneSideOfPathPairingToDOT(out, sn, sd, sd, sk, sv, nd2name, color, prefix);\n style.append(\" style=\\\"dotted\\\"\");\n writeDOTCrossEdge(out, pk, sk, nd2name, style);\n}\n\nvoid writeDOTEmbeddingForNode(std::ostream & out,\n const NodeEmbeddingWithSplits & thr,\n NodeToDotNames & nd2name,\n std::set<const PathPairingWithSplits *> & pathSet,\n const char * color,\n const char * prefix,\n std::size_t treeIndex\n ) {\n const auto eait = thr.edgeBelowEmbeddings.find(treeIndex);\n if (eait != thr.edgeBelowEmbeddings.end()) {\n for (const auto & pp : eait->second) {\n writePathPairingToDOT(out, *pp, nd2name, pathSet, color, prefix);\n }\n }\n const auto lait = thr.loopEmbeddings.find(treeIndex);\n if (lait != thr.loopEmbeddings.end()) {\n for (const auto & pp : lait->second) {\n writePathPairingToDOT(out, *pp, nd2name, pathSet, color, prefix);\n }\n }\n}\n\nvoid writeDOTForEmbedding(std::ostream & out,\n const NodeWithSplits * nd,\n const std::vector<TreeMappedWithSplits *> & tv,\n const std::map<const NodeWithSplits *, NodeEmbeddingWithSplits> & eForNd,\n bool entireSubtree) {\n NodeToDotNames nd2name;\n std::string emptyStr;\n out << \"digraph G{\\n\";\n for (auto n : iter_pre_n_const(nd)) {\n writeNodeDOT(out, n, nd2name, \"\", false, \"\", true, false);\n }\n for (auto n : iter_pre_n_const(nd)) {\n auto p = n->getParent();\n if (p == nullptr) {\n continue;\n }\n const ToDotKey nk{n, \"\"};\n const ToDotKey pk{p, \"\"};\n writeDOTEdge(out, pk, nk, nd2name, emptyStr, false);\n }\n std::set<const PathPairingWithSplits *> pathSet;\n const auto nt = tv.size();\n for (auto n : iter_pre_n_const(nd)) {\n const NodeEmbeddingWithSplits & thr = eForNd.at(n);\n for (auto i = 0U; i < nt; ++i) {\n const std::string tP = std::string(\"t\") + std::to_string(i);\n auto colorIndex = std::min(LAST_COLOR_IND, i);\n const char * color = COLORS[colorIndex];\n writeDOTEmbeddingForNode(out, thr, nd2name, pathSet, color, tP.c_str(), i);\n }\n if (!entireSubtree) {\n break;\n }\n }\n out << \"}\\n\";\n}\n\n} \/\/ namespace otc\n\n<|endoftext|>"} {"text":"<commit_before>\/*************************************************************************\n *\n * OpenOffice.org - a multi-platform office productivity suite\n *\n * $RCSfile: salogl.cxx,v $\n *\n * $Revision: 1.17 $\n *\n * last change: $Author: hr $ $Date: 2006-08-11 17:51:50 $\n *\n * The Contents of this file are made available subject to\n * the terms of GNU Lesser General Public License Version 2.1.\n *\n *\n * GNU Lesser General Public License Version 2.1\n * =============================================\n * Copyright 2005 by Sun Microsystems, Inc.\n * 901 San Antonio Road, Palo Alto, CA 94303, USA\n *\n * This library is free software; you can redistribute it and\/or\n * modify it under the terms of the GNU Lesser General Public\n * License version 2.1, as published by the Free Software Foundation.\n *\n * This library is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU\n * Lesser General Public License for more details.\n *\n * You should have received a copy of the GNU Lesser General Public\n * License along with this library; if not, write to the Free Software\n * Foundation, Inc., 59 Temple Place, Suite 330, Boston,\n * MA 02111-1307 USA\n *\n ************************************************************************\/\n\n#include <salunx.h>\n\n#ifndef _SV_SALDATA_HXX\n#include <saldata.hxx>\n#endif\n\n#ifndef _SV_SALDISP_HXX\n#include <saldisp.hxx>\n#endif\n\n#ifndef _SV_SALOGL_H\n#include <salogl.h>\n#endif\n\n#ifndef _SV_SALGDI_H\n#include <salgdi.h>\n#endif\n\n#include <stdlib.h>\n#include <stdio.h>\n#include <string.h>\n\nusing namespace rtl;\n\n\/\/ ------------\n\/\/ - Lib-Name -\n\/\/ ------------\n\n#ifdef MACOSX\n#define OGL_LIBNAME \"libGL.dylib\"\n#else\n#define OGL_LIBNAME \"libGL.so.1\"\n#endif\n\n\/\/ ----------\n\/\/ - Macros -\n\/\/ ----------\n\n\/\/ -----------------\n\/\/ - Statics init. -\n\/\/ -----------------\n\n\/\/ Members\nGLXContext X11SalOpenGL::maGLXContext = 0;\nDisplay* X11SalOpenGL::mpDisplay = 0;\nXVisualInfo* X11SalOpenGL::mpVisualInfo = 0;\nBOOL X11SalOpenGL::mbHaveGLVisual = FALSE;\n\noslModule X11SalOpenGL::mpGLLib = 0;\n#ifdef SOLARIS\noslModule aMotifLib;\n#endif\n\nULONG X11SalOpenGL::mnOGLState = OGL_STATE_UNLOADED;\n\nGLXContext (*X11SalOpenGL::pCreateContext)( Display *, XVisualInfo *, GLXContext, Bool ) = 0;\nvoid (*X11SalOpenGL::pDestroyContext)( Display *, GLXContext ) = 0;\nGLXContext (*X11SalOpenGL::pGetCurrentContext)( ) = 0;\nBool (*X11SalOpenGL::pMakeCurrent)( Display *, GLXDrawable, GLXContext ) = 0;\nvoid (*X11SalOpenGL::pSwapBuffers)( Display*, GLXDrawable ) = 0;\nint (*X11SalOpenGL::pGetConfig)( Display*, XVisualInfo*, int, int* ) = 0;\nvoid (*X11SalOpenGL::pFlush)() = 0;\n\n\/\/ -------------\n\/\/ - X11SalOpenGL -\n\/\/ -------------\n\nX11SalOpenGL::X11SalOpenGL( SalGraphics* pSGraphics )\n{\n X11SalGraphics* pGraphics = static_cast<X11SalGraphics*>(pSGraphics);\n mpDisplay = pGraphics->GetXDisplay();\n mpVisualInfo = pGraphics->GetDisplay()->GetVisual();\n maDrawable = pGraphics->GetDrawable();\n}\n\n\/\/ ------------------------------------------------------------------------\n\nX11SalOpenGL::~X11SalOpenGL()\n{\n}\n\n\/\/ ------------------------------------------------------------------------\n\nbool X11SalOpenGL::IsValid()\n{\n if( OGL_STATE_UNLOADED == mnOGLState )\n {\n BOOL bHasGLX = FALSE;\n char **ppExtensions;\n int nExtensions;\n\n if( *DisplayString( mpDisplay ) == ':' ||\n ! strncmp( DisplayString( mpDisplay ), \"localhost:\", 10 )\n )\n {\n \/\/ GLX only on local displays due to strange problems\n \/\/ with remote GLX\n ppExtensions = XListExtensions( mpDisplay, &nExtensions );\n for( int i=0; i < nExtensions; i++ )\n {\n if( ! strncmp( \"GLX\", ppExtensions[ i ], 3 ) )\n {\n bHasGLX = TRUE;\n break;\n }\n }\n XFreeExtensionList( ppExtensions );\n#if OSL_DEBUG_LEVEL > 1\n if( ! bHasGLX )\n fprintf( stderr, \"XServer does not support GLX extension\\n\" );\n#endif\n if( bHasGLX )\n {\n \/*\n * #82406# the XFree4.0 GLX module does not seem\n * to work that great, at least not the one that comes\n * with the default installation and Matrox cards.\n * Since these are common we disable usage of\n * OpenGL per default.\n *\/\n static const char* pOverrideGLX = getenv( \"SAL_ENABLE_GLX_XFREE4\" );\n if( ! strncmp( ServerVendor( mpDisplay ), \"The XFree86 Project, Inc\", 24 ) &&\n VendorRelease( mpDisplay ) >= 4000 &&\n ! pOverrideGLX\n )\n {\n#if OSL_DEBUG_LEVEL > 1\n fprintf( stderr, \"disabling GLX usage on XFree >= 4.0\\n\" );\n#endif\n bHasGLX = FALSE;\n }\n }\n }\n if( bHasGLX && mpVisualInfo->c_class == TrueColor && ImplInit() )\n {\n int nDoubleBuffer = 0;\n int nHaveGL = 0;\n pGetConfig( mpDisplay, mpVisualInfo,\n GLX_USE_GL, &nHaveGL );\n pGetConfig( mpDisplay, mpVisualInfo,\n GLX_DOUBLEBUFFER, &nDoubleBuffer );\n if( nHaveGL && ! nDoubleBuffer )\n {\n SalDisplay* pSalDisplay = GetX11SalData()->GetDisplay();\n BOOL bPreviousState =\n pSalDisplay->GetXLib()->GetIgnoreXErrors();\n pSalDisplay->GetXLib()->SetIgnoreXErrors( TRUE );\n mbHaveGLVisual = TRUE;\n\n maGLXContext = pCreateContext( mpDisplay, mpVisualInfo, 0, True );\n if( pSalDisplay->GetXLib()->WasXError() )\n mbHaveGLVisual = FALSE;\n else\n pMakeCurrent( mpDisplay, maDrawable, maGLXContext );\n if( pSalDisplay->GetXLib()->WasXError() )\n mbHaveGLVisual = FALSE;\n pSalDisplay->GetXLib()->SetIgnoreXErrors( bPreviousState );\n\n if( mbHaveGLVisual )\n mnOGLState = OGL_STATE_VALID;\n else\n maGLXContext = None;\n }\n }\n if( mnOGLState != OGL_STATE_VALID )\n mnOGLState = OGL_STATE_INVALID;\n#if OSL_DEBUG_LEVEL > 1\n if( mnOGLState == OGL_STATE_VALID )\n fprintf( stderr, \"Using GLX on visual id %x.\\n\", mpVisualInfo->visualid );\n else\n fprintf( stderr, \"Not using GLX.\\n\" );\n#endif\n }\n\n return mnOGLState == OGL_STATE_VALID ? TRUE : FALSE;\n}\n\nvoid X11SalOpenGL::Release()\n{\n if( maGLXContext && pDestroyContext )\n pDestroyContext( mpDisplay, maGLXContext );\n}\n\n\/\/ ------------------------------------------------------------------------\n\nvoid X11SalOpenGL::ReleaseLib()\n{\n if( mpGLLib )\n {\n osl_unloadModule( mpGLLib );\n #ifdef SOLARIS\n if( aMotifLib )\n osl_unloadModule( aMotifLib );\n #endif\n\n mpGLLib = 0;\n pCreateContext = 0;\n pDestroyContext = 0;\n pGetCurrentContext = 0;\n pMakeCurrent = 0;\n pSwapBuffers = 0;\n pGetConfig = 0;\n\n mnOGLState = OGL_STATE_UNLOADED;\n }\n}\n\n\/\/ ------------------------------------------------------------------------\n\noglFunction X11SalOpenGL::GetOGLFnc( const char *pFncName )\n{\n return resolveSymbol( pFncName );\n}\n\n\/\/ ------------------------------------------------------------------------\n\nvoid X11SalOpenGL::OGLEntry( SalGraphics* pGraphics )\n{\n GLXDrawable aDrawable = static_cast<X11SalGraphics*>(pGraphics)->GetDrawable();\n if( aDrawable != maDrawable )\n {\n maDrawable = aDrawable;\n pMakeCurrent( mpDisplay, maDrawable, maGLXContext );\n }\n}\n\n\/\/ ------------------------------------------------------------------------\n\nvoid X11SalOpenGL::OGLExit( SalGraphics* )\n{\n}\n\n\/\/ ------------------------------------------------------------------------\n\noglFunction X11SalOpenGL::resolveSymbol( const char* pSymbol )\n{\n oglFunction pSym = NULL;\n if( mpGLLib )\n {\n OUString aSym = OUString::createFromAscii( pSymbol );\n pSym = osl_getFunctionSymbol( mpGLLib, aSym.pData );\n }\n return pSym;\n}\n\n\nBOOL X11SalOpenGL::ImplInit()\n{\n if( ! mpGLLib )\n {\n ByteString sNoGL( getenv( \"SAL_NOOPENGL\" ) );\n if( sNoGL.ToLowerAscii() == \"true\" )\n return FALSE;\n\n sal_Int32 nRtldMode = SAL_LOADMODULE_NOW;\n #ifdef SOLARIS\n \/* #i36866# an obscure interaction with jvm can let java crash\n * if we do not use SAL_LOADMODULE_GLOBAL here\n *\/\n nRtldMode |= SAL_LOADMODULE_GLOBAL;\n\n \/* #i36899# and we need Xm, too, else jvm will not work properly.\n *\/\n OUString aMotifName( RTL_CONSTASCII_USTRINGPARAM( \"libXm.so\" ) );\n aMotifLib = osl_loadModule( aMotifName.pData, nRtldMode );\n #endif\n OUString aLibName( RTL_CONSTASCII_USTRINGPARAM( OGL_LIBNAME ) );\n mpGLLib = osl_loadModule( aLibName.pData, nRtldMode );\n }\n if( ! mpGLLib )\n {\n#if OSL_DEBUG_LEVEL > 1\n fprintf( stderr, OGL_LIBNAME \"could not be opened\\n\" );\n#endif\n return FALSE;\n }\n\n \/\/ Internal use\n pCreateContext = (GLXContext(*)(Display*,XVisualInfo*,GLXContext,Bool ))\n resolveSymbol( \"glXCreateContext\" );\n pDestroyContext = (void(*)(Display*,GLXContext))\n resolveSymbol( \"glXDestroyContext\" );\n pGetCurrentContext = (GLXContext(*)())\n resolveSymbol( \"glXGetCurrentContext\" );\n pMakeCurrent = (Bool(*)(Display*,GLXDrawable,GLXContext))\n resolveSymbol( \"glXMakeCurrent\" );\n pSwapBuffers=(void(*)(Display*, GLXDrawable))\n resolveSymbol( \"glXSwapBuffers\" );\n pGetConfig = (int(*)(Display*, XVisualInfo*, int, int* ))\n resolveSymbol( \"glXGetConfig\" );\n pFlush = (void(*)())\n resolveSymbol( \"glFlush\" );\n\n BOOL bRet = pCreateContext && pDestroyContext && pGetCurrentContext && pMakeCurrent && pSwapBuffers && pGetConfig ? TRUE : FALSE;\n\n#if OSL_DEBUG_LEVEL > 1\n if( ! bRet )\n fprintf( stderr, \"could not find all needed symbols in \" OGL_LIBNAME \"\\n\" );\n#endif\n\n return bRet;\n}\n\nvoid X11SalOpenGL::StartScene( SalGraphics* )\n{\n \/\/ flush pending operations which otherwise might be drawn\n \/\/ at the wrong time\n XSync( mpDisplay, False );\n}\n\nvoid X11SalOpenGL::StopScene()\n{\n if( maDrawable )\n {\n pSwapBuffers( mpDisplay, maDrawable );\n pFlush();\n }\n}\n\nvoid X11SalOpenGL::MakeVisualWeights( Display* pDisplay,\n XVisualInfo* pInfos,\n int *pWeights,\n int nVisuals )\n{\n BOOL bHasGLX = FALSE;\n char **ppExtensions;\n int nExtensions,i ;\n\n \/\/ GLX only on local displays due to strange problems\n \/\/ with remote GLX\n if( ! ( *DisplayString( pDisplay ) == ':' ||\n !strncmp( DisplayString( pDisplay ), \"localhost:\", 10 )\n ) )\n return;\n\n ppExtensions = XListExtensions( pDisplay, &nExtensions );\n for( i=0; i < nExtensions; i++ )\n {\n if( ! strncmp( \"GLX\", ppExtensions[ i ], 3 ) )\n {\n bHasGLX = TRUE;\n break;\n }\n }\n XFreeExtensionList( ppExtensions );\n if( ! bHasGLX )\n return;\n\n if( ! ImplInit() )\n return;\n\n for( i = 0; i < nVisuals; i++ )\n {\n int nDoubleBuffer = 0;\n int nHaveGL = 0;\n \/\/ a weight lesser than zero indicates an invalid visual (wrong screen)\n if( pInfos[i].c_class == TrueColor && pInfos[i].depth > 14 && pWeights[i] >= 0)\n {\n pGetConfig( pDisplay, &pInfos[ i ], GLX_USE_GL, &nHaveGL );\n pGetConfig( pDisplay, &pInfos[ i ], GLX_DOUBLEBUFFER, &nDoubleBuffer );\n if( nHaveGL && ! nDoubleBuffer )\n {\n mbHaveGLVisual = TRUE;\n pWeights[ i ] += 65536;\n }\n }\n }\n}\n<commit_msg>INTEGRATION: CWS pchfix02 (1.17.4); FILE MERGED 2006\/09\/01 17:58:09 kaib 1.17.4.1: #i68856# Added header markers and pch files<commit_after>\/*************************************************************************\n *\n * OpenOffice.org - a multi-platform office productivity suite\n *\n * $RCSfile: salogl.cxx,v $\n *\n * $Revision: 1.18 $\n *\n * last change: $Author: obo $ $Date: 2006-09-17 12:39: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_vcl.hxx\"\n\n#include <salunx.h>\n\n#ifndef _SV_SALDATA_HXX\n#include <saldata.hxx>\n#endif\n\n#ifndef _SV_SALDISP_HXX\n#include <saldisp.hxx>\n#endif\n\n#ifndef _SV_SALOGL_H\n#include <salogl.h>\n#endif\n\n#ifndef _SV_SALGDI_H\n#include <salgdi.h>\n#endif\n\n#include <stdlib.h>\n#include <stdio.h>\n#include <string.h>\n\nusing namespace rtl;\n\n\/\/ ------------\n\/\/ - Lib-Name -\n\/\/ ------------\n\n#ifdef MACOSX\n#define OGL_LIBNAME \"libGL.dylib\"\n#else\n#define OGL_LIBNAME \"libGL.so.1\"\n#endif\n\n\/\/ ----------\n\/\/ - Macros -\n\/\/ ----------\n\n\/\/ -----------------\n\/\/ - Statics init. -\n\/\/ -----------------\n\n\/\/ Members\nGLXContext X11SalOpenGL::maGLXContext = 0;\nDisplay* X11SalOpenGL::mpDisplay = 0;\nXVisualInfo* X11SalOpenGL::mpVisualInfo = 0;\nBOOL X11SalOpenGL::mbHaveGLVisual = FALSE;\n\noslModule X11SalOpenGL::mpGLLib = 0;\n#ifdef SOLARIS\noslModule aMotifLib;\n#endif\n\nULONG X11SalOpenGL::mnOGLState = OGL_STATE_UNLOADED;\n\nGLXContext (*X11SalOpenGL::pCreateContext)( Display *, XVisualInfo *, GLXContext, Bool ) = 0;\nvoid (*X11SalOpenGL::pDestroyContext)( Display *, GLXContext ) = 0;\nGLXContext (*X11SalOpenGL::pGetCurrentContext)( ) = 0;\nBool (*X11SalOpenGL::pMakeCurrent)( Display *, GLXDrawable, GLXContext ) = 0;\nvoid (*X11SalOpenGL::pSwapBuffers)( Display*, GLXDrawable ) = 0;\nint (*X11SalOpenGL::pGetConfig)( Display*, XVisualInfo*, int, int* ) = 0;\nvoid (*X11SalOpenGL::pFlush)() = 0;\n\n\/\/ -------------\n\/\/ - X11SalOpenGL -\n\/\/ -------------\n\nX11SalOpenGL::X11SalOpenGL( SalGraphics* pSGraphics )\n{\n X11SalGraphics* pGraphics = static_cast<X11SalGraphics*>(pSGraphics);\n mpDisplay = pGraphics->GetXDisplay();\n mpVisualInfo = pGraphics->GetDisplay()->GetVisual();\n maDrawable = pGraphics->GetDrawable();\n}\n\n\/\/ ------------------------------------------------------------------------\n\nX11SalOpenGL::~X11SalOpenGL()\n{\n}\n\n\/\/ ------------------------------------------------------------------------\n\nbool X11SalOpenGL::IsValid()\n{\n if( OGL_STATE_UNLOADED == mnOGLState )\n {\n BOOL bHasGLX = FALSE;\n char **ppExtensions;\n int nExtensions;\n\n if( *DisplayString( mpDisplay ) == ':' ||\n ! strncmp( DisplayString( mpDisplay ), \"localhost:\", 10 )\n )\n {\n \/\/ GLX only on local displays due to strange problems\n \/\/ with remote GLX\n ppExtensions = XListExtensions( mpDisplay, &nExtensions );\n for( int i=0; i < nExtensions; i++ )\n {\n if( ! strncmp( \"GLX\", ppExtensions[ i ], 3 ) )\n {\n bHasGLX = TRUE;\n break;\n }\n }\n XFreeExtensionList( ppExtensions );\n#if OSL_DEBUG_LEVEL > 1\n if( ! bHasGLX )\n fprintf( stderr, \"XServer does not support GLX extension\\n\" );\n#endif\n if( bHasGLX )\n {\n \/*\n * #82406# the XFree4.0 GLX module does not seem\n * to work that great, at least not the one that comes\n * with the default installation and Matrox cards.\n * Since these are common we disable usage of\n * OpenGL per default.\n *\/\n static const char* pOverrideGLX = getenv( \"SAL_ENABLE_GLX_XFREE4\" );\n if( ! strncmp( ServerVendor( mpDisplay ), \"The XFree86 Project, Inc\", 24 ) &&\n VendorRelease( mpDisplay ) >= 4000 &&\n ! pOverrideGLX\n )\n {\n#if OSL_DEBUG_LEVEL > 1\n fprintf( stderr, \"disabling GLX usage on XFree >= 4.0\\n\" );\n#endif\n bHasGLX = FALSE;\n }\n }\n }\n if( bHasGLX && mpVisualInfo->c_class == TrueColor && ImplInit() )\n {\n int nDoubleBuffer = 0;\n int nHaveGL = 0;\n pGetConfig( mpDisplay, mpVisualInfo,\n GLX_USE_GL, &nHaveGL );\n pGetConfig( mpDisplay, mpVisualInfo,\n GLX_DOUBLEBUFFER, &nDoubleBuffer );\n if( nHaveGL && ! nDoubleBuffer )\n {\n SalDisplay* pSalDisplay = GetX11SalData()->GetDisplay();\n BOOL bPreviousState =\n pSalDisplay->GetXLib()->GetIgnoreXErrors();\n pSalDisplay->GetXLib()->SetIgnoreXErrors( TRUE );\n mbHaveGLVisual = TRUE;\n\n maGLXContext = pCreateContext( mpDisplay, mpVisualInfo, 0, True );\n if( pSalDisplay->GetXLib()->WasXError() )\n mbHaveGLVisual = FALSE;\n else\n pMakeCurrent( mpDisplay, maDrawable, maGLXContext );\n if( pSalDisplay->GetXLib()->WasXError() )\n mbHaveGLVisual = FALSE;\n pSalDisplay->GetXLib()->SetIgnoreXErrors( bPreviousState );\n\n if( mbHaveGLVisual )\n mnOGLState = OGL_STATE_VALID;\n else\n maGLXContext = None;\n }\n }\n if( mnOGLState != OGL_STATE_VALID )\n mnOGLState = OGL_STATE_INVALID;\n#if OSL_DEBUG_LEVEL > 1\n if( mnOGLState == OGL_STATE_VALID )\n fprintf( stderr, \"Using GLX on visual id %x.\\n\", mpVisualInfo->visualid );\n else\n fprintf( stderr, \"Not using GLX.\\n\" );\n#endif\n }\n\n return mnOGLState == OGL_STATE_VALID ? TRUE : FALSE;\n}\n\nvoid X11SalOpenGL::Release()\n{\n if( maGLXContext && pDestroyContext )\n pDestroyContext( mpDisplay, maGLXContext );\n}\n\n\/\/ ------------------------------------------------------------------------\n\nvoid X11SalOpenGL::ReleaseLib()\n{\n if( mpGLLib )\n {\n osl_unloadModule( mpGLLib );\n #ifdef SOLARIS\n if( aMotifLib )\n osl_unloadModule( aMotifLib );\n #endif\n\n mpGLLib = 0;\n pCreateContext = 0;\n pDestroyContext = 0;\n pGetCurrentContext = 0;\n pMakeCurrent = 0;\n pSwapBuffers = 0;\n pGetConfig = 0;\n\n mnOGLState = OGL_STATE_UNLOADED;\n }\n}\n\n\/\/ ------------------------------------------------------------------------\n\noglFunction X11SalOpenGL::GetOGLFnc( const char *pFncName )\n{\n return resolveSymbol( pFncName );\n}\n\n\/\/ ------------------------------------------------------------------------\n\nvoid X11SalOpenGL::OGLEntry( SalGraphics* pGraphics )\n{\n GLXDrawable aDrawable = static_cast<X11SalGraphics*>(pGraphics)->GetDrawable();\n if( aDrawable != maDrawable )\n {\n maDrawable = aDrawable;\n pMakeCurrent( mpDisplay, maDrawable, maGLXContext );\n }\n}\n\n\/\/ ------------------------------------------------------------------------\n\nvoid X11SalOpenGL::OGLExit( SalGraphics* )\n{\n}\n\n\/\/ ------------------------------------------------------------------------\n\noglFunction X11SalOpenGL::resolveSymbol( const char* pSymbol )\n{\n oglFunction pSym = NULL;\n if( mpGLLib )\n {\n OUString aSym = OUString::createFromAscii( pSymbol );\n pSym = osl_getFunctionSymbol( mpGLLib, aSym.pData );\n }\n return pSym;\n}\n\n\nBOOL X11SalOpenGL::ImplInit()\n{\n if( ! mpGLLib )\n {\n ByteString sNoGL( getenv( \"SAL_NOOPENGL\" ) );\n if( sNoGL.ToLowerAscii() == \"true\" )\n return FALSE;\n\n sal_Int32 nRtldMode = SAL_LOADMODULE_NOW;\n #ifdef SOLARIS\n \/* #i36866# an obscure interaction with jvm can let java crash\n * if we do not use SAL_LOADMODULE_GLOBAL here\n *\/\n nRtldMode |= SAL_LOADMODULE_GLOBAL;\n\n \/* #i36899# and we need Xm, too, else jvm will not work properly.\n *\/\n OUString aMotifName( RTL_CONSTASCII_USTRINGPARAM( \"libXm.so\" ) );\n aMotifLib = osl_loadModule( aMotifName.pData, nRtldMode );\n #endif\n OUString aLibName( RTL_CONSTASCII_USTRINGPARAM( OGL_LIBNAME ) );\n mpGLLib = osl_loadModule( aLibName.pData, nRtldMode );\n }\n if( ! mpGLLib )\n {\n#if OSL_DEBUG_LEVEL > 1\n fprintf( stderr, OGL_LIBNAME \"could not be opened\\n\" );\n#endif\n return FALSE;\n }\n\n \/\/ Internal use\n pCreateContext = (GLXContext(*)(Display*,XVisualInfo*,GLXContext,Bool ))\n resolveSymbol( \"glXCreateContext\" );\n pDestroyContext = (void(*)(Display*,GLXContext))\n resolveSymbol( \"glXDestroyContext\" );\n pGetCurrentContext = (GLXContext(*)())\n resolveSymbol( \"glXGetCurrentContext\" );\n pMakeCurrent = (Bool(*)(Display*,GLXDrawable,GLXContext))\n resolveSymbol( \"glXMakeCurrent\" );\n pSwapBuffers=(void(*)(Display*, GLXDrawable))\n resolveSymbol( \"glXSwapBuffers\" );\n pGetConfig = (int(*)(Display*, XVisualInfo*, int, int* ))\n resolveSymbol( \"glXGetConfig\" );\n pFlush = (void(*)())\n resolveSymbol( \"glFlush\" );\n\n BOOL bRet = pCreateContext && pDestroyContext && pGetCurrentContext && pMakeCurrent && pSwapBuffers && pGetConfig ? TRUE : FALSE;\n\n#if OSL_DEBUG_LEVEL > 1\n if( ! bRet )\n fprintf( stderr, \"could not find all needed symbols in \" OGL_LIBNAME \"\\n\" );\n#endif\n\n return bRet;\n}\n\nvoid X11SalOpenGL::StartScene( SalGraphics* )\n{\n \/\/ flush pending operations which otherwise might be drawn\n \/\/ at the wrong time\n XSync( mpDisplay, False );\n}\n\nvoid X11SalOpenGL::StopScene()\n{\n if( maDrawable )\n {\n pSwapBuffers( mpDisplay, maDrawable );\n pFlush();\n }\n}\n\nvoid X11SalOpenGL::MakeVisualWeights( Display* pDisplay,\n XVisualInfo* pInfos,\n int *pWeights,\n int nVisuals )\n{\n BOOL bHasGLX = FALSE;\n char **ppExtensions;\n int nExtensions,i ;\n\n \/\/ GLX only on local displays due to strange problems\n \/\/ with remote GLX\n if( ! ( *DisplayString( pDisplay ) == ':' ||\n !strncmp( DisplayString( pDisplay ), \"localhost:\", 10 )\n ) )\n return;\n\n ppExtensions = XListExtensions( pDisplay, &nExtensions );\n for( i=0; i < nExtensions; i++ )\n {\n if( ! strncmp( \"GLX\", ppExtensions[ i ], 3 ) )\n {\n bHasGLX = TRUE;\n break;\n }\n }\n XFreeExtensionList( ppExtensions );\n if( ! bHasGLX )\n return;\n\n if( ! ImplInit() )\n return;\n\n for( i = 0; i < nVisuals; i++ )\n {\n int nDoubleBuffer = 0;\n int nHaveGL = 0;\n \/\/ a weight lesser than zero indicates an invalid visual (wrong screen)\n if( pInfos[i].c_class == TrueColor && pInfos[i].depth > 14 && pWeights[i] >= 0)\n {\n pGetConfig( pDisplay, &pInfos[ i ], GLX_USE_GL, &nHaveGL );\n pGetConfig( pDisplay, &pInfos[ i ], GLX_DOUBLEBUFFER, &nDoubleBuffer );\n if( nHaveGL && ! nDoubleBuffer )\n {\n mbHaveGLVisual = TRUE;\n pWeights[ i ] += 65536;\n }\n }\n }\n}\n<|endoftext|>"} {"text":"<commit_before>\/*************************************************************************\n *\n * OpenOffice.org - a multi-platform office productivity suite\n *\n * $RCSfile: salogl.cxx,v $\n *\n * $Revision: 1.15 $\n *\n * last change: $Author: rt $ $Date: 2005-09-09 13:08:05 $\n *\n * The Contents of this file are made available subject to\n * the terms of GNU Lesser General Public License Version 2.1.\n *\n *\n * GNU Lesser General Public License Version 2.1\n * =============================================\n * Copyright 2005 by Sun Microsystems, Inc.\n * 901 San Antonio Road, Palo Alto, CA 94303, USA\n *\n * This library is free software; you can redistribute it and\/or\n * modify it under the terms of the GNU Lesser General Public\n * License version 2.1, as published by the Free Software Foundation.\n *\n * This library is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU\n * Lesser General Public License for more details.\n *\n * You should have received a copy of the GNU Lesser General Public\n * License along with this library; if not, write to the Free Software\n * Foundation, Inc., 59 Temple Place, Suite 330, Boston,\n * MA 02111-1307 USA\n *\n ************************************************************************\/\n\n#include <salunx.h>\n\n#ifndef _SV_SALDATA_HXX\n#include <saldata.hxx>\n#endif\n\n#ifndef _SV_SALDISP_HXX\n#include <saldisp.hxx>\n#endif\n\n#ifndef _SV_SALOGL_H\n#include <salogl.h>\n#endif\n\n#ifndef _SV_SALGDI_H\n#include <salgdi.h>\n#endif\n\n#include <stdlib.h>\n#include <stdio.h>\n#include <string.h>\n\nusing namespace rtl;\n\n\/\/ ------------\n\/\/ - Lib-Name -\n\/\/ ------------\n\n#ifdef MACOSX\n#define OGL_LIBNAME \"libGL.dylib\"\n#else\n#define OGL_LIBNAME \"libGL.so.1\"\n#endif\n\n\/\/ ----------\n\/\/ - Macros -\n\/\/ ----------\n\n\/\/ -----------------\n\/\/ - Statics init. -\n\/\/ -----------------\n\n\/\/ Members\nGLXContext X11SalOpenGL::maGLXContext = 0;\nDisplay* X11SalOpenGL::mpDisplay = 0;\nXVisualInfo* X11SalOpenGL::mpVisualInfo = 0;\nBOOL X11SalOpenGL::mbHaveGLVisual = FALSE;\n\noslModule X11SalOpenGL::mpGLLib = 0;\n#ifdef SOLARIS\noslModule aMotifLib;\n#endif\n\nULONG X11SalOpenGL::mnOGLState = OGL_STATE_UNLOADED;\n\nGLXContext (*X11SalOpenGL::pCreateContext)( Display *, XVisualInfo *, GLXContext, Bool ) = 0;\nvoid (*X11SalOpenGL::pDestroyContext)( Display *, GLXContext ) = 0;\nGLXContext (*X11SalOpenGL::pGetCurrentContext)( ) = 0;\nBool (*X11SalOpenGL::pMakeCurrent)( Display *, GLXDrawable, GLXContext ) = 0;\nvoid (*X11SalOpenGL::pSwapBuffers)( Display*, GLXDrawable ) = 0;\nint (*X11SalOpenGL::pGetConfig)( Display*, XVisualInfo*, int, int* ) = 0;\nvoid (*X11SalOpenGL::pFlush)() = 0;\n\n\/\/ -------------\n\/\/ - X11SalOpenGL -\n\/\/ -------------\n\nX11SalOpenGL::X11SalOpenGL( SalGraphics* pSGraphics )\n{\n X11SalGraphics* pGraphics = static_cast<X11SalGraphics*>(pSGraphics);\n mpDisplay = pGraphics->GetXDisplay();\n mpVisualInfo = pGraphics->GetDisplay()->GetVisual();\n maDrawable = pGraphics->GetDrawable();\n}\n\n\/\/ ------------------------------------------------------------------------\n\nX11SalOpenGL::~X11SalOpenGL()\n{\n}\n\n\/\/ ------------------------------------------------------------------------\n\nbool X11SalOpenGL::IsValid()\n{\n if( OGL_STATE_UNLOADED == mnOGLState )\n {\n BOOL bHasGLX = FALSE;\n char **ppExtensions;\n int nExtensions;\n\n if( *DisplayString( mpDisplay ) == ':' ||\n ! strncmp( DisplayString( mpDisplay ), \"localhost:\", 10 )\n )\n {\n \/\/ GLX only on local displays due to strange problems\n \/\/ with remote GLX\n ppExtensions = XListExtensions( mpDisplay, &nExtensions );\n for( int i=0; i < nExtensions; i++ )\n {\n if( ! strncmp( \"GLX\", ppExtensions[ i ], 3 ) )\n {\n bHasGLX = TRUE;\n break;\n }\n }\n XFreeExtensionList( ppExtensions );\n#if OSL_DEBUG_LEVEL > 1\n if( ! bHasGLX )\n fprintf( stderr, \"XServer does not support GLX extension\\n\" );\n#endif\n if( bHasGLX )\n {\n \/*\n * #82406# the XFree4.0 GLX module does not seem\n * to work that great, at least not the one that comes\n * with the default installation and Matrox cards.\n * Since these are common we disable usage of\n * OpenGL per default.\n *\/\n static const char* pOverrideGLX = getenv( \"SAL_ENABLE_GLX_XFREE4\" );\n if( ! strncmp( ServerVendor( mpDisplay ), \"The XFree86 Project, Inc\", 24 ) &&\n VendorRelease( mpDisplay ) >= 4000 &&\n ! pOverrideGLX\n )\n {\n#if OSL_DEBUG_LEVEL > 1\n fprintf( stderr, \"disabling GLX usage on XFree >= 4.0\\n\" );\n#endif\n bHasGLX = FALSE;\n }\n }\n }\n if( bHasGLX && mpVisualInfo->c_class == TrueColor && ImplInit() )\n {\n int nDoubleBuffer = 0;\n int nHaveGL = 0;\n pGetConfig( mpDisplay, mpVisualInfo,\n GLX_USE_GL, &nHaveGL );\n pGetConfig( mpDisplay, mpVisualInfo,\n GLX_DOUBLEBUFFER, &nDoubleBuffer );\n if( nHaveGL && ! nDoubleBuffer )\n {\n SalDisplay* pSalDisplay = GetSalData()->GetDisplay();\n BOOL bPreviousState =\n pSalDisplay->GetXLib()->GetIgnoreXErrors();\n pSalDisplay->GetXLib()->SetIgnoreXErrors( TRUE );\n mbHaveGLVisual = TRUE;\n\n maGLXContext = pCreateContext( mpDisplay, mpVisualInfo, 0, True );\n if( pSalDisplay->GetXLib()->WasXError() )\n mbHaveGLVisual = FALSE;\n else\n pMakeCurrent( mpDisplay, maDrawable, maGLXContext );\n if( pSalDisplay->GetXLib()->WasXError() )\n mbHaveGLVisual = FALSE;\n pSalDisplay->GetXLib()->SetIgnoreXErrors( bPreviousState );\n\n if( mbHaveGLVisual )\n mnOGLState = OGL_STATE_VALID;\n else\n maGLXContext = None;\n }\n }\n if( mnOGLState != OGL_STATE_VALID )\n mnOGLState = OGL_STATE_INVALID;\n#if OSL_DEBUG_LEVEL > 1\n if( mnOGLState == OGL_STATE_VALID )\n fprintf( stderr, \"Using GLX on visual id %x.\\n\", mpVisualInfo->visualid );\n else\n fprintf( stderr, \"Not using GLX.\\n\" );\n#endif\n }\n\n return mnOGLState == OGL_STATE_VALID ? TRUE : FALSE;\n}\n\nvoid X11SalOpenGL::Release()\n{\n if( maGLXContext && pDestroyContext )\n pDestroyContext( mpDisplay, maGLXContext );\n}\n\n\/\/ ------------------------------------------------------------------------\n\nvoid X11SalOpenGL::ReleaseLib()\n{\n if( mpGLLib )\n {\n osl_unloadModule( mpGLLib );\n #ifdef SOLARIS\n if( aMotifLib )\n osl_unloadModule( aMotifLib );\n #endif\n\n mpGLLib = 0;\n pCreateContext = 0;\n pDestroyContext = 0;\n pGetCurrentContext = 0;\n pMakeCurrent = 0;\n pSwapBuffers = 0;\n pGetConfig = 0;\n\n mnOGLState = OGL_STATE_UNLOADED;\n }\n}\n\n\/\/ ------------------------------------------------------------------------\n\nvoid* X11SalOpenGL::GetOGLFnc( const char *pFncName )\n{\n return resolveSymbol( pFncName );\n}\n\n\/\/ ------------------------------------------------------------------------\n\nvoid X11SalOpenGL::OGLEntry( SalGraphics* pGraphics )\n{\n GLXDrawable aDrawable = static_cast<X11SalGraphics*>(pGraphics)->GetDrawable();\n if( aDrawable != maDrawable )\n {\n maDrawable = aDrawable;\n pMakeCurrent( mpDisplay, maDrawable, maGLXContext );\n }\n}\n\n\/\/ ------------------------------------------------------------------------\n\nvoid X11SalOpenGL::OGLExit( SalGraphics* pGraphics )\n{\n}\n\n\/\/ ------------------------------------------------------------------------\n\nvoid* X11SalOpenGL::resolveSymbol( const char* pSymbol )\n{\n void* pSym = NULL;\n if( mpGLLib )\n {\n OUString aSym = OUString::createFromAscii( pSymbol );\n pSym = osl_getSymbol( mpGLLib, aSym.pData );\n }\n return pSym;\n}\n\n\nBOOL X11SalOpenGL::ImplInit()\n{\n if( ! mpGLLib )\n {\n ByteString sNoGL( getenv( \"SAL_NOOPENGL\" ) );\n if( sNoGL.ToLowerAscii() == \"true\" )\n return FALSE;\n\n sal_Int32 nRtldMode = SAL_LOADMODULE_NOW;\n #ifdef SOLARIS\n \/* #i36866# an obscure interaction with jvm can let java crash\n * if we do not use SAL_LOADMODULE_GLOBAL here\n *\/\n nRtldMode |= SAL_LOADMODULE_GLOBAL;\n\n \/* #i36899# and we need Xm, too, else jvm will not work properly.\n *\/\n OUString aMotifName( RTL_CONSTASCII_USTRINGPARAM( \"libXm.so\" ) );\n aMotifLib = osl_loadModule( aMotifName.pData, nRtldMode );\n #endif\n OUString aLibName( RTL_CONSTASCII_USTRINGPARAM( OGL_LIBNAME ) );\n mpGLLib = osl_loadModule( aLibName.pData, nRtldMode );\n }\n if( ! mpGLLib )\n {\n#if OSL_DEBUG_LEVEL > 1\n fprintf( stderr, OGL_LIBNAME \"could not be opened\\n\" );\n#endif\n return FALSE;\n }\n\n \/\/ Internal use\n pCreateContext = (GLXContext(*)(Display*,XVisualInfo*,GLXContext,Bool ))\n resolveSymbol( \"glXCreateContext\" );\n pDestroyContext = (void(*)(Display*,GLXContext))\n resolveSymbol( \"glXDestroyContext\" );\n pGetCurrentContext = (GLXContext(*)())\n resolveSymbol( \"glXGetCurrentContext\" );\n pMakeCurrent = (Bool(*)(Display*,GLXDrawable,GLXContext))\n resolveSymbol( \"glXMakeCurrent\" );\n pSwapBuffers=(void(*)(Display*, GLXDrawable))\n resolveSymbol( \"glXSwapBuffers\" );\n pGetConfig = (int(*)(Display*, XVisualInfo*, int, int* ))\n resolveSymbol( \"glXGetConfig\" );\n pFlush = (void(*)())\n resolveSymbol( \"glFlush\" );\n\n BOOL bRet = pCreateContext && pDestroyContext && pGetCurrentContext && pMakeCurrent && pSwapBuffers && pGetConfig ? TRUE : FALSE;\n\n#if OSL_DEBUG_LEVEL > 1\n if( ! bRet )\n fprintf( stderr, \"could not find all needed symbols in \" OGL_LIBNAME \"\\n\" );\n#endif\n\n return bRet;\n}\n\nvoid X11SalOpenGL::StartScene( SalGraphics* pGraphics )\n{\n \/\/ flush pending operations which otherwise might be drawn\n \/\/ at the wrong time\n XSync( mpDisplay, False );\n}\n\nvoid X11SalOpenGL::StopScene()\n{\n if( maDrawable )\n {\n pSwapBuffers( mpDisplay, maDrawable );\n pFlush();\n }\n}\n\nvoid X11SalOpenGL::MakeVisualWeights( Display* pDisplay,\n XVisualInfo* pInfos,\n int *pWeights,\n int nVisuals )\n{\n BOOL bHasGLX = FALSE;\n char **ppExtensions;\n int nExtensions,i ;\n\n \/\/ GLX only on local displays due to strange problems\n \/\/ with remote GLX\n if( ! ( *DisplayString( pDisplay ) == ':' ||\n !strncmp( DisplayString( pDisplay ), \"localhost:\", 10 )\n ) )\n return;\n\n ppExtensions = XListExtensions( pDisplay, &nExtensions );\n for( i=0; i < nExtensions; i++ )\n {\n if( ! strncmp( \"GLX\", ppExtensions[ i ], 3 ) )\n {\n bHasGLX = TRUE;\n break;\n }\n }\n XFreeExtensionList( ppExtensions );\n if( ! bHasGLX )\n return;\n\n if( ! ImplInit() )\n return;\n\n for( i = 0; i < nVisuals; i++ )\n {\n int nDoubleBuffer = 0;\n int nHaveGL = 0;\n \/\/ a weight lesser than zero indicates an invalid visual (wrong screen)\n if( pInfos[i].c_class == TrueColor && pInfos[i].depth > 14 && pWeights[i] >= 0)\n {\n pGetConfig( pDisplay, &pInfos[ i ], GLX_USE_GL, &nHaveGL );\n pGetConfig( pDisplay, &pInfos[ i ], GLX_DOUBLEBUFFER, &nDoubleBuffer );\n if( nHaveGL && ! nDoubleBuffer )\n {\n mbHaveGLVisual = TRUE;\n pWeights[ i ] += 65536;\n }\n }\n }\n}\n<commit_msg>INTEGRATION: CWS warnings01 (1.15.70); FILE MERGED 2005\/11\/11 14:31:28 pl 1.15.70.1: #i55991# removed warnings<commit_after>\/*************************************************************************\n *\n * OpenOffice.org - a multi-platform office productivity suite\n *\n * $RCSfile: salogl.cxx,v $\n *\n * $Revision: 1.16 $\n *\n * last change: $Author: hr $ $Date: 2006-06-19 19:55: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#include <salunx.h>\n\n#ifndef _SV_SALDATA_HXX\n#include <saldata.hxx>\n#endif\n\n#ifndef _SV_SALDISP_HXX\n#include <saldisp.hxx>\n#endif\n\n#ifndef _SV_SALOGL_H\n#include <salogl.h>\n#endif\n\n#ifndef _SV_SALGDI_H\n#include <salgdi.h>\n#endif\n\n#include <stdlib.h>\n#include <stdio.h>\n#include <string.h>\n\nusing namespace rtl;\n\n\/\/ ------------\n\/\/ - Lib-Name -\n\/\/ ------------\n\n#ifdef MACOSX\n#define OGL_LIBNAME \"libGL.dylib\"\n#else\n#define OGL_LIBNAME \"libGL.so.1\"\n#endif\n\n\/\/ ----------\n\/\/ - Macros -\n\/\/ ----------\n\n\/\/ -----------------\n\/\/ - Statics init. -\n\/\/ -----------------\n\n\/\/ Members\nGLXContext X11SalOpenGL::maGLXContext = 0;\nDisplay* X11SalOpenGL::mpDisplay = 0;\nXVisualInfo* X11SalOpenGL::mpVisualInfo = 0;\nBOOL X11SalOpenGL::mbHaveGLVisual = FALSE;\n\noslModule X11SalOpenGL::mpGLLib = 0;\n#ifdef SOLARIS\noslModule aMotifLib;\n#endif\n\nULONG X11SalOpenGL::mnOGLState = OGL_STATE_UNLOADED;\n\nGLXContext (*X11SalOpenGL::pCreateContext)( Display *, XVisualInfo *, GLXContext, Bool ) = 0;\nvoid (*X11SalOpenGL::pDestroyContext)( Display *, GLXContext ) = 0;\nGLXContext (*X11SalOpenGL::pGetCurrentContext)( ) = 0;\nBool (*X11SalOpenGL::pMakeCurrent)( Display *, GLXDrawable, GLXContext ) = 0;\nvoid (*X11SalOpenGL::pSwapBuffers)( Display*, GLXDrawable ) = 0;\nint (*X11SalOpenGL::pGetConfig)( Display*, XVisualInfo*, int, int* ) = 0;\nvoid (*X11SalOpenGL::pFlush)() = 0;\n\n\/\/ -------------\n\/\/ - X11SalOpenGL -\n\/\/ -------------\n\nX11SalOpenGL::X11SalOpenGL( SalGraphics* pSGraphics )\n{\n X11SalGraphics* pGraphics = static_cast<X11SalGraphics*>(pSGraphics);\n mpDisplay = pGraphics->GetXDisplay();\n mpVisualInfo = pGraphics->GetDisplay()->GetVisual();\n maDrawable = pGraphics->GetDrawable();\n}\n\n\/\/ ------------------------------------------------------------------------\n\nX11SalOpenGL::~X11SalOpenGL()\n{\n}\n\n\/\/ ------------------------------------------------------------------------\n\nbool X11SalOpenGL::IsValid()\n{\n if( OGL_STATE_UNLOADED == mnOGLState )\n {\n BOOL bHasGLX = FALSE;\n char **ppExtensions;\n int nExtensions;\n\n if( *DisplayString( mpDisplay ) == ':' ||\n ! strncmp( DisplayString( mpDisplay ), \"localhost:\", 10 )\n )\n {\n \/\/ GLX only on local displays due to strange problems\n \/\/ with remote GLX\n ppExtensions = XListExtensions( mpDisplay, &nExtensions );\n for( int i=0; i < nExtensions; i++ )\n {\n if( ! strncmp( \"GLX\", ppExtensions[ i ], 3 ) )\n {\n bHasGLX = TRUE;\n break;\n }\n }\n XFreeExtensionList( ppExtensions );\n#if OSL_DEBUG_LEVEL > 1\n if( ! bHasGLX )\n fprintf( stderr, \"XServer does not support GLX extension\\n\" );\n#endif\n if( bHasGLX )\n {\n \/*\n * #82406# the XFree4.0 GLX module does not seem\n * to work that great, at least not the one that comes\n * with the default installation and Matrox cards.\n * Since these are common we disable usage of\n * OpenGL per default.\n *\/\n static const char* pOverrideGLX = getenv( \"SAL_ENABLE_GLX_XFREE4\" );\n if( ! strncmp( ServerVendor( mpDisplay ), \"The XFree86 Project, Inc\", 24 ) &&\n VendorRelease( mpDisplay ) >= 4000 &&\n ! pOverrideGLX\n )\n {\n#if OSL_DEBUG_LEVEL > 1\n fprintf( stderr, \"disabling GLX usage on XFree >= 4.0\\n\" );\n#endif\n bHasGLX = FALSE;\n }\n }\n }\n if( bHasGLX && mpVisualInfo->c_class == TrueColor && ImplInit() )\n {\n int nDoubleBuffer = 0;\n int nHaveGL = 0;\n pGetConfig( mpDisplay, mpVisualInfo,\n GLX_USE_GL, &nHaveGL );\n pGetConfig( mpDisplay, mpVisualInfo,\n GLX_DOUBLEBUFFER, &nDoubleBuffer );\n if( nHaveGL && ! nDoubleBuffer )\n {\n SalDisplay* pSalDisplay = GetSalData()->GetDisplay();\n BOOL bPreviousState =\n pSalDisplay->GetXLib()->GetIgnoreXErrors();\n pSalDisplay->GetXLib()->SetIgnoreXErrors( TRUE );\n mbHaveGLVisual = TRUE;\n\n maGLXContext = pCreateContext( mpDisplay, mpVisualInfo, 0, True );\n if( pSalDisplay->GetXLib()->WasXError() )\n mbHaveGLVisual = FALSE;\n else\n pMakeCurrent( mpDisplay, maDrawable, maGLXContext );\n if( pSalDisplay->GetXLib()->WasXError() )\n mbHaveGLVisual = FALSE;\n pSalDisplay->GetXLib()->SetIgnoreXErrors( bPreviousState );\n\n if( mbHaveGLVisual )\n mnOGLState = OGL_STATE_VALID;\n else\n maGLXContext = None;\n }\n }\n if( mnOGLState != OGL_STATE_VALID )\n mnOGLState = OGL_STATE_INVALID;\n#if OSL_DEBUG_LEVEL > 1\n if( mnOGLState == OGL_STATE_VALID )\n fprintf( stderr, \"Using GLX on visual id %x.\\n\", mpVisualInfo->visualid );\n else\n fprintf( stderr, \"Not using GLX.\\n\" );\n#endif\n }\n\n return mnOGLState == OGL_STATE_VALID ? TRUE : FALSE;\n}\n\nvoid X11SalOpenGL::Release()\n{\n if( maGLXContext && pDestroyContext )\n pDestroyContext( mpDisplay, maGLXContext );\n}\n\n\/\/ ------------------------------------------------------------------------\n\nvoid X11SalOpenGL::ReleaseLib()\n{\n if( mpGLLib )\n {\n osl_unloadModule( mpGLLib );\n #ifdef SOLARIS\n if( aMotifLib )\n osl_unloadModule( aMotifLib );\n #endif\n\n mpGLLib = 0;\n pCreateContext = 0;\n pDestroyContext = 0;\n pGetCurrentContext = 0;\n pMakeCurrent = 0;\n pSwapBuffers = 0;\n pGetConfig = 0;\n\n mnOGLState = OGL_STATE_UNLOADED;\n }\n}\n\n\/\/ ------------------------------------------------------------------------\n\noglFunction X11SalOpenGL::GetOGLFnc( const char *pFncName )\n{\n return resolveSymbol( pFncName );\n}\n\n\/\/ ------------------------------------------------------------------------\n\nvoid X11SalOpenGL::OGLEntry( SalGraphics* pGraphics )\n{\n GLXDrawable aDrawable = static_cast<X11SalGraphics*>(pGraphics)->GetDrawable();\n if( aDrawable != maDrawable )\n {\n maDrawable = aDrawable;\n pMakeCurrent( mpDisplay, maDrawable, maGLXContext );\n }\n}\n\n\/\/ ------------------------------------------------------------------------\n\nvoid X11SalOpenGL::OGLExit( SalGraphics* )\n{\n}\n\n\/\/ ------------------------------------------------------------------------\n\noglFunction X11SalOpenGL::resolveSymbol( const char* pSymbol )\n{\n oglFunction pSym = NULL;\n if( mpGLLib )\n {\n OUString aSym = OUString::createFromAscii( pSymbol );\n pSym = osl_getFunctionSymbol( mpGLLib, aSym.pData );\n }\n return pSym;\n}\n\n\nBOOL X11SalOpenGL::ImplInit()\n{\n if( ! mpGLLib )\n {\n ByteString sNoGL( getenv( \"SAL_NOOPENGL\" ) );\n if( sNoGL.ToLowerAscii() == \"true\" )\n return FALSE;\n\n sal_Int32 nRtldMode = SAL_LOADMODULE_NOW;\n #ifdef SOLARIS\n \/* #i36866# an obscure interaction with jvm can let java crash\n * if we do not use SAL_LOADMODULE_GLOBAL here\n *\/\n nRtldMode |= SAL_LOADMODULE_GLOBAL;\n\n \/* #i36899# and we need Xm, too, else jvm will not work properly.\n *\/\n OUString aMotifName( RTL_CONSTASCII_USTRINGPARAM( \"libXm.so\" ) );\n aMotifLib = osl_loadModule( aMotifName.pData, nRtldMode );\n #endif\n OUString aLibName( RTL_CONSTASCII_USTRINGPARAM( OGL_LIBNAME ) );\n mpGLLib = osl_loadModule( aLibName.pData, nRtldMode );\n }\n if( ! mpGLLib )\n {\n#if OSL_DEBUG_LEVEL > 1\n fprintf( stderr, OGL_LIBNAME \"could not be opened\\n\" );\n#endif\n return FALSE;\n }\n\n \/\/ Internal use\n pCreateContext = (GLXContext(*)(Display*,XVisualInfo*,GLXContext,Bool ))\n resolveSymbol( \"glXCreateContext\" );\n pDestroyContext = (void(*)(Display*,GLXContext))\n resolveSymbol( \"glXDestroyContext\" );\n pGetCurrentContext = (GLXContext(*)())\n resolveSymbol( \"glXGetCurrentContext\" );\n pMakeCurrent = (Bool(*)(Display*,GLXDrawable,GLXContext))\n resolveSymbol( \"glXMakeCurrent\" );\n pSwapBuffers=(void(*)(Display*, GLXDrawable))\n resolveSymbol( \"glXSwapBuffers\" );\n pGetConfig = (int(*)(Display*, XVisualInfo*, int, int* ))\n resolveSymbol( \"glXGetConfig\" );\n pFlush = (void(*)())\n resolveSymbol( \"glFlush\" );\n\n BOOL bRet = pCreateContext && pDestroyContext && pGetCurrentContext && pMakeCurrent && pSwapBuffers && pGetConfig ? TRUE : FALSE;\n\n#if OSL_DEBUG_LEVEL > 1\n if( ! bRet )\n fprintf( stderr, \"could not find all needed symbols in \" OGL_LIBNAME \"\\n\" );\n#endif\n\n return bRet;\n}\n\nvoid X11SalOpenGL::StartScene( SalGraphics* )\n{\n \/\/ flush pending operations which otherwise might be drawn\n \/\/ at the wrong time\n XSync( mpDisplay, False );\n}\n\nvoid X11SalOpenGL::StopScene()\n{\n if( maDrawable )\n {\n pSwapBuffers( mpDisplay, maDrawable );\n pFlush();\n }\n}\n\nvoid X11SalOpenGL::MakeVisualWeights( Display* pDisplay,\n XVisualInfo* pInfos,\n int *pWeights,\n int nVisuals )\n{\n BOOL bHasGLX = FALSE;\n char **ppExtensions;\n int nExtensions,i ;\n\n \/\/ GLX only on local displays due to strange problems\n \/\/ with remote GLX\n if( ! ( *DisplayString( pDisplay ) == ':' ||\n !strncmp( DisplayString( pDisplay ), \"localhost:\", 10 )\n ) )\n return;\n\n ppExtensions = XListExtensions( pDisplay, &nExtensions );\n for( i=0; i < nExtensions; i++ )\n {\n if( ! strncmp( \"GLX\", ppExtensions[ i ], 3 ) )\n {\n bHasGLX = TRUE;\n break;\n }\n }\n XFreeExtensionList( ppExtensions );\n if( ! bHasGLX )\n return;\n\n if( ! ImplInit() )\n return;\n\n for( i = 0; i < nVisuals; i++ )\n {\n int nDoubleBuffer = 0;\n int nHaveGL = 0;\n \/\/ a weight lesser than zero indicates an invalid visual (wrong screen)\n if( pInfos[i].c_class == TrueColor && pInfos[i].depth > 14 && pWeights[i] >= 0)\n {\n pGetConfig( pDisplay, &pInfos[ i ], GLX_USE_GL, &nHaveGL );\n pGetConfig( pDisplay, &pInfos[ i ], GLX_DOUBLEBUFFER, &nDoubleBuffer );\n if( nHaveGL && ! nDoubleBuffer )\n {\n mbHaveGLVisual = TRUE;\n pWeights[ i ] += 65536;\n }\n }\n }\n}\n<|endoftext|>"} {"text":"<commit_before>\/*************************************************************************\n *\n * $RCSfile: undoheaderfooter.hxx,v $\n *\n * $Revision: 1.3 $\n *\n * last change: $Author: rt $ $Date: 2004-08-23 08:23:02 $\n *\n * The Contents of this file are made available subject to the terms of\n * either of the following licenses\n *\n * - GNU Lesser General Public License Version 2.1\n * - Sun Industry Standards Source License Version 1.1\n *\n * Sun Microsystems Inc., October, 2000\n *\n * GNU Lesser General Public License Version 2.1\n * =============================================\n * Copyright 2000 by Sun Microsystems, Inc.\n * 901 San Antonio Road, Palo Alto, CA 94303, USA\n *\n * This library is free software; you can redistribute it and\/or\n * modify it under the terms of the GNU Lesser General Public\n * License version 2.1, as published by the Free Software Foundation.\n *\n * This library is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU\n * Lesser General Public License for more details.\n *\n * You should have received a copy of the GNU Lesser General Public\n * License along with this library; if not, write to the Free Software\n * Foundation, Inc., 59 Temple Place, Suite 330, Boston,\n * MA 02111-1307 USA\n *\n *\n * Sun Industry Standards Source License Version 1.1\n * =================================================\n * The contents of this file are subject to the Sun Industry Standards\n * Source License Version 1.1 (the \"License\"); You may not use this file\n * except in compliance with the License. You may obtain a copy of the\n * License at http:\/\/www.openoffice.org\/license.html.\n *\n * Software provided under this License is provided on an \"AS IS\" basis,\n * WITHOUT WARRANTY OF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING,\n * WITHOUT LIMITATION, WARRANTIES THAT THE SOFTWARE IS FREE OF DEFECTS,\n * MERCHANTABLE, FIT FOR A PARTICULAR PURPOSE, OR NON-INFRINGING.\n * See the License for the specific provisions governing your rights and\n * obligations concerning the Software.\n *\n * The Initial Developer of the Original Code is: Sun Microsystems, Inc.\n *\n * Copyright: 2000 by Sun Microsystems, Inc.\n *\n * All Rights Reserved.\n *\n * Contributor(s): _______________________________________\n *\n *\n ************************************************************************\/\n\n#ifndef _SD_UNDOHEADERFOOTER_HXX\n#define _SD_UNDOHEADERFOOTER_HXX\n\n#ifndef _GEN_HXX \/\/autogen\n#include <tools\/gen.hxx>\n#endif\n\n#ifndef _SD_SDUNDO_HXX\n#include \"sdundo.hxx\"\n#endif\n#ifndef _SDPAGE_HXX\n#include \"sdpage.hxx\"\n#endif\n\n#ifndef INCLUDED_SDDLLAPI_H\n#include \"sddllapi.h\"\n#endif\n\nclass SdDrawDocument;\n\n\/************************************************************************\/\n\nclass SD_DLLPUBLIC SdHeaderFooterUndoAction : public SdUndoAction\n{\n SdPage* mpPage;\n\n const sd::HeaderFooterSettings maOldSettings;\n const sd::HeaderFooterSettings maNewSettings;\n\npublic:\n TYPEINFO();\n SdHeaderFooterUndoAction( SdDrawDocument* pDoc, SdPage* pPage, const sd::HeaderFooterSettings& rNewSettings );\n virtual ~SdHeaderFooterUndoAction();\n\n virtual void Undo();\n virtual void Redo();\n virtual void Repeat();\n};\n\n#endif \/\/ _SD_UNDOHEADERFOOTER_HXX\n\n<commit_msg>INTEGRATION: CWS ooo19126 (1.3.374); FILE MERGED 2005\/09\/05 13:23:31 rt 1.3.374.1: #i54170# Change license header: remove SISSL<commit_after>\/*************************************************************************\n *\n * OpenOffice.org - a multi-platform office productivity suite\n *\n * $RCSfile: undoheaderfooter.hxx,v $\n *\n * $Revision: 1.4 $\n *\n * last change: $Author: rt $ $Date: 2005-09-09 05:57:39 $\n *\n * The Contents of this file are made available subject to\n * the terms of GNU Lesser General Public License Version 2.1.\n *\n *\n * GNU Lesser General Public License Version 2.1\n * =============================================\n * Copyright 2005 by Sun Microsystems, Inc.\n * 901 San Antonio Road, Palo Alto, CA 94303, USA\n *\n * This library is free software; you can redistribute it and\/or\n * modify it under the terms of the GNU Lesser General Public\n * License version 2.1, as published by the Free Software Foundation.\n *\n * This library is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU\n * Lesser General Public License for more details.\n *\n * You should have received a copy of the GNU Lesser General Public\n * License along with this library; if not, write to the Free Software\n * Foundation, Inc., 59 Temple Place, Suite 330, Boston,\n * MA 02111-1307 USA\n *\n ************************************************************************\/\n\n#ifndef _SD_UNDOHEADERFOOTER_HXX\n#define _SD_UNDOHEADERFOOTER_HXX\n\n#ifndef _GEN_HXX \/\/autogen\n#include <tools\/gen.hxx>\n#endif\n\n#ifndef _SD_SDUNDO_HXX\n#include \"sdundo.hxx\"\n#endif\n#ifndef _SDPAGE_HXX\n#include \"sdpage.hxx\"\n#endif\n\n#ifndef INCLUDED_SDDLLAPI_H\n#include \"sddllapi.h\"\n#endif\n\nclass SdDrawDocument;\n\n\/************************************************************************\/\n\nclass SD_DLLPUBLIC SdHeaderFooterUndoAction : public SdUndoAction\n{\n SdPage* mpPage;\n\n const sd::HeaderFooterSettings maOldSettings;\n const sd::HeaderFooterSettings maNewSettings;\n\npublic:\n TYPEINFO();\n SdHeaderFooterUndoAction( SdDrawDocument* pDoc, SdPage* pPage, const sd::HeaderFooterSettings& rNewSettings );\n virtual ~SdHeaderFooterUndoAction();\n\n virtual void Undo();\n virtual void Redo();\n virtual void Repeat();\n};\n\n#endif \/\/ _SD_UNDOHEADERFOOTER_HXX\n\n<|endoftext|>"} {"text":"<commit_before>\/*\n * Copyright 2011 Simon A. F. Lund <safl@safl.dk>\n *\n * This file is part of cphVB.\n *\n * cphVB is free software: you can redistribute it and\/or modify\n * it under the terms of the GNU General Public License as published by\n * the Free Software Foundation, either version 3 of the License, or\n * (at your option) any later version.\n *\n * cphVB is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the\n * GNU General Public License for more details.\n *\n * You should have received a copy of the GNU General Public License\n * along with cphVB. If not, see <http:\/\/www.gnu.org\/licenses\/>.\n *\/\n#include <cphvb.h>\n#include \"cphvb_ve_simple.h\"\n\nstatic cphvb_com *myself = NULL;\nstatic cphvb_userfunc_impl reduce_impl = NULL;\nstatic cphvb_intp reduce_impl_id = 0;\nstatic cphvb_userfunc_impl random_impl = NULL;\nstatic cphvb_intp random_impl_id = 0;\n\ncphvb_error cphvb_ve_simple_init(cphvb_com *self)\n{\n myself = self;\n return CPHVB_SUCCESS;\n}\n\ncphvb_error cphvb_ve_simple_execute( cphvb_intp instruction_count, cphvb_instruction* instruction_list )\n{\n cphvb_intp count, nops, i;\n cphvb_instruction* inst;\n cphvb_error ret = CPHVB_SUCCESS;\n\n for(count=0; count < instruction_count; count++)\n {\n inst = &instruction_list[count];\n\n if(inst->status == CPHVB_INST_DONE) \/\/ SKIP instruction\n {\n continue;\n }\n\n nops = cphvb_operands(inst->opcode); \/\/ Allocate memory for operands\n for(i=0; i<nops; i++)\n {\n if (!cphvb_is_constant(inst->operand[i]))\n {\n if (cphvb_data_malloc(inst->operand[i]) != CPHVB_SUCCESS)\n {\n return CPHVB_OUT_OF_MEMORY; \/\/ EXIT\n }\n }\n\n }\n\n switch(inst->opcode) \/\/ Dispatch instruction\n {\n case CPHVB_NONE: \/\/ NOOP.\n case CPHVB_DISCARD:\n case CPHVB_SYNC:\n inst->status = CPHVB_INST_DONE;\n break;\n\n case CPHVB_USERFUNC: \/\/ External libraries\n\n if(inst->userfunc->id == reduce_impl_id)\n {\n ret = reduce_impl(inst->userfunc, NULL);\n inst->status = (ret == CPHVB_SUCCESS) ? CPHVB_INST_DONE : CPHVB_INST_UNDONE;\n }\n else if(inst->userfunc->id == random_impl_id)\n {\n ret = random_impl(inst->userfunc, NULL);\n inst->status = (ret == CPHVB_SUCCESS) ? CPHVB_INST_DONE : CPHVB_INST_UNDONE;\n }\n else \/\/ Unsupported userfunc\n {\n ret = CPHVB_TYPE_NOT_SUPPORTED;\n }\n\n break;\n\n default: \/\/ Built-in operations\n ret = cphvb_compute_apply( inst );\n inst->status = (ret == CPHVB_SUCCESS) ? CPHVB_INST_DONE : CPHVB_INST_UNDONE;\n }\n\n if (inst->status != CPHVB_INST_DONE) \/\/ Instruction failed\n {\n return ret; \/\/ EXIT\n }\n\n }\n \/\/ All instructions succeeded.\n return ret; \/\/ EXIT\n\n}\n\ncphvb_error cphvb_ve_simple_shutdown( void )\n{\n return CPHVB_SUCCESS;\n}\n\ncphvb_error cphvb_ve_simple_reg_func(char *lib, char *fun, cphvb_intp *id) {\n\n if(strcmp(\"cphvb_reduce\", fun) && reduce_impl == NULL)\n {\n cphvb_com_get_func(myself, lib, fun, &reduce_impl);\n reduce_impl_id = *id;\n }\n else if(strcmp(\"cphvb_random\", fun) && random_impl == NULL)\n {\n cphvb_com_get_func(myself, lib, fun, &random_impl);\n random_impl_id = *id;\n }\n return CPHVB_SUCCESS;\n}\n\ncphvb_error cphvb_reduce( cphvb_userfunc *arg, void* ve_arg)\n{\n return cphvb_compute_reduce( arg, ve_arg );\n}\n\ncphvb_error cphvb_random( cphvb_userfunc *arg, void* ve_arg)\n{\n return cphvb_compute_random( arg, ve_arg );\n}\n<commit_msg>Adjusted return-value of simple engine.<commit_after>\/*\n * Copyright 2011 Simon A. F. Lund <safl@safl.dk>\n *\n * This file is part of cphVB.\n *\n * cphVB is free software: you can redistribute it and\/or modify\n * it under the terms of the GNU General Public License as published by\n * the Free Software Foundation, either version 3 of the License, or\n * (at your option) any later version.\n *\n * cphVB is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the\n * GNU General Public License for more details.\n *\n * You should have received a copy of the GNU General Public License\n * along with cphVB. If not, see <http:\/\/www.gnu.org\/licenses\/>.\n *\/\n#include <cphvb.h>\n#include \"cphvb_ve_simple.h\"\n\nstatic cphvb_com *myself = NULL;\nstatic cphvb_userfunc_impl reduce_impl = NULL;\nstatic cphvb_intp reduce_impl_id = 0;\nstatic cphvb_userfunc_impl random_impl = NULL;\nstatic cphvb_intp random_impl_id = 0;\n\ncphvb_error cphvb_ve_simple_init(cphvb_com *self)\n{\n myself = self;\n return CPHVB_SUCCESS;\n}\n\ncphvb_error cphvb_ve_simple_execute( cphvb_intp instruction_count, cphvb_instruction* instruction_list )\n{\n cphvb_intp count, nops, i;\n cphvb_instruction* inst;\n cphvb_error ret = CPHVB_SUCCESS;\n\n for(count=0; count < instruction_count; count++)\n {\n inst = &instruction_list[count];\n\n if(inst->status == CPHVB_INST_DONE) \/\/ SKIP instruction\n {\n continue;\n }\n\n nops = cphvb_operands(inst->opcode); \/\/ Allocate memory for operands\n for(i=0; i<nops; i++)\n {\n if (!cphvb_is_constant(inst->operand[i]))\n {\n if (cphvb_data_malloc(inst->operand[i]) != CPHVB_SUCCESS)\n {\n return CPHVB_OUT_OF_MEMORY; \/\/ EXIT\n }\n }\n\n }\n\n switch(inst->opcode) \/\/ Dispatch instruction\n {\n case CPHVB_NONE: \/\/ NOOP.\n case CPHVB_DISCARD:\n case CPHVB_SYNC:\n inst->status = CPHVB_INST_DONE;\n break;\n\n case CPHVB_USERFUNC: \/\/ External libraries\n\n if(inst->userfunc->id == reduce_impl_id)\n {\n ret = reduce_impl(inst->userfunc, NULL);\n inst->status = (ret == CPHVB_SUCCESS) ? CPHVB_INST_DONE : CPHVB_INST_UNDONE;\n }\n else if(inst->userfunc->id == random_impl_id)\n {\n ret = random_impl(inst->userfunc, NULL);\n inst->status = (ret == CPHVB_SUCCESS) ? CPHVB_INST_DONE : CPHVB_INST_UNDONE;\n }\n else \/\/ Unsupported userfunc\n {\n inst->status = CPHVB_INST_UNDONE;\n }\n\n break;\n\n default: \/\/ Built-in operations\n ret = cphvb_compute_apply( inst );\n inst->status = (ret == CPHVB_SUCCESS) ? CPHVB_INST_DONE : CPHVB_INST_UNDONE;\n }\n\n if (inst->status != CPHVB_INST_DONE) \/\/ Instruction failed\n {\n break;\n }\n\n }\n\n if (count == instruction_count) {\n return CPHVB_SUCCESS;\n } else {\n return CPHVB_PARTIAL_SUCCESS;\n }\n\n}\n\ncphvb_error cphvb_ve_simple_shutdown( void )\n{\n return CPHVB_SUCCESS;\n}\n\ncphvb_error cphvb_ve_simple_reg_func(char *lib, char *fun, cphvb_intp *id) {\n\n if(strcmp(\"cphvb_reduce\", fun) && reduce_impl == NULL)\n {\n cphvb_com_get_func(myself, lib, fun, &reduce_impl);\n reduce_impl_id = *id;\n }\n else if(strcmp(\"cphvb_random\", fun) && random_impl == NULL)\n {\n cphvb_com_get_func(myself, lib, fun, &random_impl);\n random_impl_id = *id;\n }\n return CPHVB_SUCCESS;\n}\n\ncphvb_error cphvb_reduce( cphvb_userfunc *arg, void* ve_arg)\n{\n return cphvb_compute_reduce( arg, ve_arg );\n}\n\ncphvb_error cphvb_random( cphvb_userfunc *arg, void* ve_arg)\n{\n return cphvb_compute_random( arg, ve_arg );\n}\n<|endoftext|>"} {"text":"<commit_before>#include <config.h>\n#include <dune\/stuff\/common\/parameter\/configcontainer.hh>\n#include <dune\/stuff\/fem\/functions\/integrals.hh>\n#include <dune\/stuff\/common\/profiler.hh>\n#include <sstream>\n\n#include \"dune\/multiscale\/msfem\/msfem_traits.hh\"\n#include \"coarse_scale_operator.hh\"\n\nnamespace Dune {\nnamespace Multiscale {\nnamespace MsFEM {\n\nCoarseScaleOperator::CoarseScaleOperator(const CoarseDiscreteFunctionSpace& coarseDiscreteFunctionSpace,\n LocalGridList& subgrid_list, const CommonTraits::DiffusionType& diffusion_op)\n : coarseDiscreteFunctionSpace_(coarseDiscreteFunctionSpace)\n , subgrid_list_(subgrid_list)\n , diffusion_operator_(diffusion_op)\n , petrovGalerkin_(false)\n , global_matrix_(\"MsFEM stiffness matrix\", coarseDiscreteFunctionSpace_, coarseDiscreteFunctionSpace_)\n , cached_(false) {\n \/\/ the local problem:\n \/\/ Let 'T' denote a coarse grid element and\n \/\/ let 'U(T)' denote the environment of 'T' that corresponds with the subgrid.\n\n \/\/ if Petrov-Galerkin-MsFEM\n if (petrovGalerkin_)\n DSC_LOG_DEBUG << \"Assembling Petrov-Galerkin-MsFEM Matrix.\" << std::endl;\n else \/\/ if classical (symmetric) MsFEM\n DSC_LOG_DEBUG << \"Assembling MsFEM Matrix.\" << std::endl;\n\n \/\/!TODO diagonal stencil reicht\n global_matrix_.reserve(DSFe::diagonalAndNeighborStencil(global_matrix_));\n global_matrix_.clear();\n\n Fem::DomainDecomposedIteratorStorage<CommonTraits::GridPartType> threadIterators(\n coarseDiscreteFunctionSpace_.gridPart());\n\n const bool is_simplex_grid = DSG::is_simplex_grid(coarseDiscreteFunctionSpace_);\n\n#ifdef _OPENMP\n#pragma omp parallel\n#endif\n {\n for (const auto& coarse_grid_entity : threadIterators) {\n int cacheCounter = 0;\n const auto& coarse_grid_geometry = coarse_grid_entity.geometry();\n assert(coarse_grid_entity.partitionType() == InteriorEntity);\n\n DSFe::LocalMatrixProxy<MatrixType> local_matrix(global_matrix_, coarse_grid_entity, coarse_grid_entity);\n\n const auto& coarse_grid_baseSet = local_matrix.domainBasisFunctionSet();\n const auto numMacroBaseFunctions = coarse_grid_baseSet.size();\n\n Multiscale::MsFEM::LocalSolutionManager localSolutionManager(coarseDiscreteFunctionSpace_,\n coarse_grid_entity,\n subgrid_list_);\n localSolutionManager.load();\n const auto& localSolutions = localSolutionManager.getLocalSolutions();\n assert(localSolutions.size() > 0);\n\n for (const auto& localGridEntity : localSolutionManager.space()) {\n \/\/ ignore overlay elements\n if (subgrid_list_.covers(coarse_grid_entity, localGridEntity)) {\n const auto& local_grid_geometry = localGridEntity.geometry();\n\n \/\/ higher order quadrature, since A^{\\epsilon} is highly variable\n const auto localQuadrature = DSFe::make_quadrature(localGridEntity, localSolutionManager.space());\n const auto numQuadraturePoints = localQuadrature.nop();\n\n \/\/ number of local solutions without the boundary correctors. Those are only needed for the right hand side\n const auto numLocalSolutions = localSolutions.size() - localSolutionManager.numBoundaryCorrectors();\n \/\/ evaluate the jacobians of all local solutions in all quadrature points\n std::vector<std::vector<JacobianRangeType>> allLocalSolutionEvaluations(\n numLocalSolutions, std::vector<JacobianRangeType>(localQuadrature.nop(), JacobianRangeType(0.0)));\n for (auto lsNum : DSC::valueRange(numLocalSolutions)) {\n auto& sll = localSolutions[lsNum];\n assert(sll.get());\n assert(sll->dofsValid());\n assert(localSolutionManager.space().indexSet().contains(localGridEntity));\n auto localFunction = sll->localFunction(localGridEntity);\n localFunction.evaluateQuadrature(localQuadrature, allLocalSolutionEvaluations[lsNum]);\n }\n\n for (size_t localQuadraturePoint = 0; localQuadraturePoint < numQuadraturePoints; ++localQuadraturePoint) {\n \/\/ local (barycentric) coordinates (with respect to entity)\n const auto& local_subgrid_point = localQuadrature.point(localQuadraturePoint);\n\n auto global_point_in_U_T = local_grid_geometry.global(local_subgrid_point);\n const double weight_local_quadrature = localQuadrature.weight(localQuadraturePoint) *\n local_grid_geometry.integrationElement(local_subgrid_point);\n\n \/\/ evaluate the jacobian of the coarse grid base set\n const auto& local_coarse_point = coarse_grid_geometry.local(global_point_in_U_T);\n if (!cached_) {\n coarseBaseJacs_.push_back(std::vector<JacobianRangeType>(numMacroBaseFunctions, 0.0));\n coarse_grid_baseSet.jacobianAll(local_coarse_point, coarseBaseJacs_[cacheCounter]);\n }\n\n for (unsigned int i = 0; i < numMacroBaseFunctions; ++i) {\n for (unsigned int j = 0; j < numMacroBaseFunctions; ++j) {\n RangeType local_integral(0.0);\n\n \/\/ Compute the gradients of the i'th and j'th local problem solutions\n JacobianRangeType gradLocProbSoli(0.0), gradLocProbSolj(0.0);\n if (is_simplex_grid) {\n assert(allLocalSolutionEvaluations.size() == CommonTraits::GridType::dimension);\n \/\/ ∇ Phi_H + ∇ Q( Phi_H ) = ∇ Phi_H + ∂_x1 Phi_H ∇Q( e_1 ) + ∂_x2 Phi_H ∇Q( e_2 )\n for (int k = 0; k < CommonTraits::GridType::dimension; ++k) {\n gradLocProbSoli.axpy(coarseBaseJacs_[cacheCounter][i][0][k], allLocalSolutionEvaluations[k][localQuadraturePoint]);\n gradLocProbSolj.axpy(coarseBaseJacs_[cacheCounter][j][0][k], allLocalSolutionEvaluations[k][localQuadraturePoint]);\n }\n } else {\n assert(allLocalSolutionEvaluations.size() == numMacroBaseFunctions);\n gradLocProbSoli = allLocalSolutionEvaluations[i][localQuadraturePoint];\n gradLocProbSolj = allLocalSolutionEvaluations[j][localQuadraturePoint];\n }\n\n JacobianRangeType reconstructionGradPhii(coarseBaseJacs_[cacheCounter][i]);\n reconstructionGradPhii += gradLocProbSoli;\n JacobianRangeType reconstructionGradPhij(coarseBaseJacs_[cacheCounter][j]);\n reconstructionGradPhij += gradLocProbSolj;\n JacobianRangeType diffusive_flux(0.0);\n diffusion_operator_.diffusiveFlux(global_point_in_U_T, reconstructionGradPhii, diffusive_flux);\n if (petrovGalerkin_)\n local_integral += weight_local_quadrature * (diffusive_flux[0] * coarseBaseJacs_[cacheCounter][j][0]);\n else\n local_integral += weight_local_quadrature * (diffusive_flux[0] * reconstructionGradPhij[0]);\n\n \/\/ add entries\n local_matrix.add(j, i, local_integral);\n }\n }\n\n ++cacheCounter;\n }\n }\n }\n \/\/ cache was filled;\n cached_ = true;\n } \/\/ for\n } \/\/ omp region\n\n \/\/ set unit rows for dirichlet dofs\n Dune::Multiscale::getConstraintsCoarse(coarseDiscreteFunctionSpace_).applyToOperator(global_matrix_);\n global_matrix_.communicate();\n}\n\nvoid CoarseScaleOperator::apply_inverse(const CoarseScaleOperator::CoarseDiscreteFunction& rhs,\n CoarseScaleOperator::CoarseDiscreteFunction& solution) {\n BOOST_ASSERT_MSG(rhs.dofsValid(), \"Coarse scale RHS DOFs need to be valid!\");\n DSC_PROFILER.startTiming(\"msfem.solveCoarse\");\n const typename BackendChooser<CoarseDiscreteFunctionSpace>::InverseOperatorType inverse(\n global_matrix_, 1e-8, 1e-8, DSC_CONFIG_GET(\"msfem.solver.iterations\", rhs.size()),\n DSC_CONFIG_GET(\"msfem.solver.verbose\", false), \"bcgs\",\n DSC_CONFIG_GET(\"msfem.solver.preconditioner_type\", std::string(\"sor\")));\n inverse(rhs, solution);\n if (!solution.dofsValid())\n DUNE_THROW(InvalidStateException, \"Degrees of freedom of coarse solution are not valid!\");\n DSC_PROFILER.stopTiming(\"msfem.solveCoarse\");\n DSC_LOG_DEBUG << \"Time to solve coarse MsFEM problem: \" << DSC_PROFILER.getTiming(\"msfem.solveCoarse\") << \"ms.\"\n << std::endl;\n} \/\/ constructor\n\n} \/\/ namespace MsFEM {\n} \/\/ namespace Multiscale {\n} \/\/ namespace Dune {\n<commit_msg>Doc cleanup<commit_after>#include <config.h>\n#include <dune\/stuff\/common\/parameter\/configcontainer.hh>\n#include <dune\/stuff\/fem\/functions\/integrals.hh>\n#include <dune\/stuff\/common\/profiler.hh>\n#include <sstream>\n\n#include \"dune\/multiscale\/msfem\/msfem_traits.hh\"\n#include \"coarse_scale_operator.hh\"\n\nnamespace Dune {\nnamespace Multiscale {\nnamespace MsFEM {\n\nCoarseScaleOperator::CoarseScaleOperator(const CoarseDiscreteFunctionSpace& coarseDiscreteFunctionSpace,\n LocalGridList& subgrid_list, const CommonTraits::DiffusionType& diffusion_op)\n : coarseDiscreteFunctionSpace_(coarseDiscreteFunctionSpace)\n , subgrid_list_(subgrid_list)\n , diffusion_operator_(diffusion_op)\n , petrovGalerkin_(false)\n , global_matrix_(\"MsFEM stiffness matrix\", coarseDiscreteFunctionSpace_, coarseDiscreteFunctionSpace_)\n , cached_(false) {\n\n \/\/!TODO diagonal stencil reicht\n global_matrix_.reserve(DSFe::diagonalAndNeighborStencil(global_matrix_));\n global_matrix_.clear();\n\n Fem::DomainDecomposedIteratorStorage<CommonTraits::GridPartType> threadIterators(\n coarseDiscreteFunctionSpace_.gridPart());\n\n const bool is_simplex_grid = DSG::is_simplex_grid(coarseDiscreteFunctionSpace_);\n\n#ifdef _OPENMP\n#pragma omp parallel\n#endif\n {\n for (const auto& coarse_grid_entity : threadIterators) {\n int cacheCounter = 0;\n const auto& coarse_grid_geometry = coarse_grid_entity.geometry();\n assert(coarse_grid_entity.partitionType() == InteriorEntity);\n\n DSFe::LocalMatrixProxy<MatrixType> local_matrix(global_matrix_, coarse_grid_entity, coarse_grid_entity);\n\n const auto& coarse_grid_baseSet = local_matrix.domainBasisFunctionSet();\n const auto numMacroBaseFunctions = coarse_grid_baseSet.size();\n\n Multiscale::MsFEM::LocalSolutionManager localSolutionManager(coarseDiscreteFunctionSpace_,\n coarse_grid_entity,\n subgrid_list_);\n localSolutionManager.load();\n const auto& localSolutions = localSolutionManager.getLocalSolutions();\n assert(localSolutions.size() > 0);\n\n for (const auto& localGridEntity : localSolutionManager.space()) {\n \/\/ ignore overlay elements\n if (subgrid_list_.covers(coarse_grid_entity, localGridEntity)) {\n const auto& local_grid_geometry = localGridEntity.geometry();\n\n \/\/ higher order quadrature, since A^{\\epsilon} is highly variable\n const auto localQuadrature = DSFe::make_quadrature(localGridEntity, localSolutionManager.space());\n const auto numQuadraturePoints = localQuadrature.nop();\n\n \/\/ number of local solutions without the boundary correctors. Those are only needed for the right hand side\n const auto numLocalSolutions = localSolutions.size() - localSolutionManager.numBoundaryCorrectors();\n \/\/ evaluate the jacobians of all local solutions in all quadrature points\n std::vector<std::vector<JacobianRangeType>> allLocalSolutionEvaluations(\n numLocalSolutions, std::vector<JacobianRangeType>(localQuadrature.nop(), JacobianRangeType(0.0)));\n for (auto lsNum : DSC::valueRange(numLocalSolutions)) {\n auto& sll = localSolutions[lsNum];\n assert(sll.get());\n assert(sll->dofsValid());\n assert(localSolutionManager.space().indexSet().contains(localGridEntity));\n auto localFunction = sll->localFunction(localGridEntity);\n localFunction.evaluateQuadrature(localQuadrature, allLocalSolutionEvaluations[lsNum]);\n }\n\n for (size_t localQuadraturePoint = 0; localQuadraturePoint < numQuadraturePoints; ++localQuadraturePoint) {\n \/\/ local (barycentric) coordinates (with respect to entity)\n const auto& local_subgrid_point = localQuadrature.point(localQuadraturePoint);\n\n auto global_point_in_U_T = local_grid_geometry.global(local_subgrid_point);\n const double weight_local_quadrature = localQuadrature.weight(localQuadraturePoint) *\n local_grid_geometry.integrationElement(local_subgrid_point);\n\n \/\/ evaluate the jacobian of the coarse grid base set\n const auto& local_coarse_point = coarse_grid_geometry.local(global_point_in_U_T);\n if (!cached_) {\n coarseBaseJacs_.push_back(std::vector<JacobianRangeType>(numMacroBaseFunctions, 0.0));\n coarse_grid_baseSet.jacobianAll(local_coarse_point, coarseBaseJacs_[cacheCounter]);\n }\n\n for (unsigned int i = 0; i < numMacroBaseFunctions; ++i) {\n for (unsigned int j = 0; j < numMacroBaseFunctions; ++j) {\n RangeType local_integral(0.0);\n\n \/\/ Compute the gradients of the i'th and j'th local problem solutions\n JacobianRangeType gradLocProbSoli(0.0), gradLocProbSolj(0.0);\n if (is_simplex_grid) {\n assert(allLocalSolutionEvaluations.size() == CommonTraits::GridType::dimension);\n \/\/ ∇ Phi_H + ∇ Q( Phi_H ) = ∇ Phi_H + ∂_x1 Phi_H ∇Q( e_1 ) + ∂_x2 Phi_H ∇Q( e_2 )\n for (int k = 0; k < CommonTraits::GridType::dimension; ++k) {\n gradLocProbSoli.axpy(coarseBaseJacs_[cacheCounter][i][0][k], allLocalSolutionEvaluations[k][localQuadraturePoint]);\n gradLocProbSolj.axpy(coarseBaseJacs_[cacheCounter][j][0][k], allLocalSolutionEvaluations[k][localQuadraturePoint]);\n }\n } else {\n assert(allLocalSolutionEvaluations.size() == numMacroBaseFunctions);\n gradLocProbSoli = allLocalSolutionEvaluations[i][localQuadraturePoint];\n gradLocProbSolj = allLocalSolutionEvaluations[j][localQuadraturePoint];\n }\n\n JacobianRangeType reconstructionGradPhii(coarseBaseJacs_[cacheCounter][i]);\n reconstructionGradPhii += gradLocProbSoli;\n JacobianRangeType reconstructionGradPhij(coarseBaseJacs_[cacheCounter][j]);\n reconstructionGradPhij += gradLocProbSolj;\n JacobianRangeType diffusive_flux(0.0);\n diffusion_operator_.diffusiveFlux(global_point_in_U_T, reconstructionGradPhii, diffusive_flux);\n if (petrovGalerkin_)\n local_integral += weight_local_quadrature * (diffusive_flux[0] * coarseBaseJacs_[cacheCounter][j][0]);\n else\n local_integral += weight_local_quadrature * (diffusive_flux[0] * reconstructionGradPhij[0]);\n\n \/\/ add entries\n local_matrix.add(j, i, local_integral);\n }\n }\n\n ++cacheCounter;\n }\n }\n }\n \/\/ cache was filled;\n cached_ = true;\n } \/\/ for\n } \/\/ omp region\n\n \/\/ set unit rows for dirichlet dofs\n Dune::Multiscale::getConstraintsCoarse(coarseDiscreteFunctionSpace_).applyToOperator(global_matrix_);\n global_matrix_.communicate();\n}\n\nvoid CoarseScaleOperator::apply_inverse(const CoarseScaleOperator::CoarseDiscreteFunction& rhs,\n CoarseScaleOperator::CoarseDiscreteFunction& solution) {\n BOOST_ASSERT_MSG(rhs.dofsValid(), \"Coarse scale RHS DOFs need to be valid!\");\n DSC_PROFILER.startTiming(\"msfem.solveCoarse\");\n const typename BackendChooser<CoarseDiscreteFunctionSpace>::InverseOperatorType inverse(\n global_matrix_, 1e-8, 1e-8, DSC_CONFIG_GET(\"msfem.solver.iterations\", rhs.size()),\n DSC_CONFIG_GET(\"msfem.solver.verbose\", false), \"bcgs\",\n DSC_CONFIG_GET(\"msfem.solver.preconditioner_type\", std::string(\"sor\")));\n inverse(rhs, solution);\n if (!solution.dofsValid())\n DUNE_THROW(InvalidStateException, \"Degrees of freedom of coarse solution are not valid!\");\n DSC_PROFILER.stopTiming(\"msfem.solveCoarse\");\n DSC_LOG_DEBUG << \"Time to solve coarse MsFEM problem: \" << DSC_PROFILER.getTiming(\"msfem.solveCoarse\") << \"ms.\"\n << std::endl;\n} \/\/ constructor\n\n} \/\/ namespace MsFEM {\n} \/\/ namespace Multiscale {\n} \/\/ namespace Dune {\n<|endoftext|>"} {"text":"<commit_before>\/*************************************************************************\n *\n * $RCSfile: resourceprovider.cxx,v $\n *\n * $Revision: 1.5 $\n *\n * last change: $Author: rt $ $Date: 2003-10-06 15:58:12 $\n *\n * The Contents of this file are made available subject to the terms of\n * either of the following licenses\n *\n * - GNU Lesser General Public License Version 2.1\n * - Sun Industry Standards Source License Version 1.1\n *\n * Sun Microsystems Inc., October, 2000\n *\n * GNU Lesser General Public License Version 2.1\n * =============================================\n * Copyright 2000 by Sun Microsystems, Inc.\n * 901 San Antonio Road, Palo Alto, CA 94303, USA\n *\n * This library is free software; you can redistribute it and\/or\n * modify it under the terms of the GNU Lesser General Public\n * License version 2.1, as published by the Free Software Foundation.\n *\n * This library is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU\n * Lesser General Public License for more details.\n *\n * You should have received a copy of the GNU Lesser General Public\n * License along with this library; if not, write to the Free Software\n * Foundation, Inc., 59 Temple Place, Suite 330, Boston,\n * MA 02111-1307 USA\n *\n *\n * Sun Industry Standards Source License Version 1.1\n * =================================================\n * The contents of this file are subject to the Sun Industry Standards\n * Source License Version 1.1 (the \"License\"); You may not use this file\n * except in compliance with the License. You may obtain a copy of the\n * License at http:\/\/www.openoffice.org\/license.html.\n *\n * Software provided under this License is provided on an \"AS IS\" basis,\n * WITHOUT WARRANTY OF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING,\n * WITHOUT LIMITATION, WARRANTIES THAT THE SOFTWARE IS FREE OF DEFECTS,\n * MERCHANTABLE, FIT FOR A PARTICULAR PURPOSE, OR NON-INFRINGING.\n * See the License for the specific provisions governing your rights and\n * obligations concerning the Software.\n *\n * The Initial Developer of the Original Code is: Sun Microsystems, Inc.\n *\n * Copyright: 2000 by Sun Microsystems, Inc.\n *\n * All Rights Reserved.\n *\n * Contributor(s): _______________________________________\n *\n *\n ************************************************************************\/\n\n\/\/------------------------------------------------------------------------\n\/\/ includes\n\/\/------------------------------------------------------------------------\n\n#ifndef _OSL_DIAGNOSE_H_\n#include <osl\/diagnose.h>\n#endif\n\n#ifndef _RTL_USTRBUF_HXX_\n#include <rtl\/ustrbuf.hxx>\n#endif\n\n#ifndef _RESOURCEPROVIDER_HXX_\n#include \"resourceprovider.hxx\"\n#endif\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\n#ifndef _TOOLS_RESMGR_HXX\n#include <tools\/resmgr.hxx>\n#endif\n\n#ifndef _COM_SUN_STAR_UI_DIALOGS_COMMONFILEPICKERELEMENTIDS_HPP_\n#include <com\/sun\/star\/ui\/dialogs\/CommonFilePickerElementIds.hpp>\n#endif\n\n#ifndef _COM_SUN_STAR_UI_DIALOGS_EXTENDEDFILEPICKERELEMENTIDS_HPP_\n#include <com\/sun\/star\/ui\/dialogs\/ExtendedFilePickerElementIds.hpp>\n#endif\n\n#include <svtools\/svtools.hrc>\n\n\/\/------------------------------------------------------------\n\/\/ namespace directives\n\/\/------------------------------------------------------------\n\nusing rtl::OUString;\nusing namespace ::com::sun::star::ui::dialogs::ExtendedFilePickerElementIds;\nusing namespace ::com::sun::star::ui::dialogs::CommonFilePickerElementIds;\n\n\/\/------------------------------------------------------------\n\/\/\n\/\/------------------------------------------------------------\n\n#define RES_NAME svt\n\n#define FOLDERPICKER_TITLE 500\n#define FOLDER_PICKER_DEF_DESCRIPTION 501\n\n\/\/------------------------------------------------------------\n\/\/ we have to translate control ids to resource ids\n\/\/------------------------------------------------------------\n\nstruct _Entry\n{\n sal_Int32 ctrlId;\n sal_Int16 resId;\n};\n\n_Entry CtrlIdToResIdTable[] = {\n { CHECKBOX_AUTOEXTENSION, STR_SVT_FILEPICKER_AUTO_EXTENSION },\n { CHECKBOX_PASSWORD, STR_SVT_FILEPICKER_PASSWORD },\n { CHECKBOX_FILTEROPTIONS, STR_SVT_FILEPICKER_FILTER_OPTIONS },\n { CHECKBOX_READONLY, STR_SVT_FILEPICKER_READONLY },\n { CHECKBOX_LINK, STR_SVT_FILEPICKER_INSERT_AS_LINK },\n { CHECKBOX_PREVIEW, STR_SVT_FILEPICKER_SHOW_PREVIEW },\n { PUSHBUTTON_PLAY, STR_SVT_FILEPICKER_PLAY },\n { LISTBOX_VERSION_LABEL, STR_SVT_FILEPICKER_VERSION },\n { LISTBOX_TEMPLATE_LABEL, STR_SVT_FILEPICKER_TEMPLATES },\n { LISTBOX_IMAGE_TEMPLATE_LABEL, STR_SVT_FILEPICKER_IMAGE_TEMPLATE },\n { CHECKBOX_SELECTION, STR_SVT_FILEPICKER_SELECTION },\n { FOLDERPICKER_TITLE, STR_SVT_FOLDERPICKER_DEFAULT_TITLE },\n { FOLDER_PICKER_DEF_DESCRIPTION, STR_SVT_FOLDERPICKER_DEFAULT_DESCRIPTION }\n};\n\nconst sal_Int32 SIZE_TABLE = sizeof( CtrlIdToResIdTable ) \/ sizeof( _Entry );\n\n\/\/------------------------------------------------------------\n\/\/\n\/\/------------------------------------------------------------\n\nsal_Int16 CtrlIdToResId( sal_Int32 aControlId )\n{\n sal_Int16 aResId = -1;\n\n for ( sal_Int32 i = 0; i < SIZE_TABLE; i++ )\n {\n if ( CtrlIdToResIdTable[i].ctrlId == aControlId )\n {\n aResId = CtrlIdToResIdTable[i].resId;\n break;\n }\n }\n\n return aResId;\n}\n\n\/\/------------------------------------------------------------\n\/\/\n\/\/------------------------------------------------------------\n\nclass CResourceProvider_Impl\n{\npublic:\n\n \/\/-------------------------------------\n \/\/\n \/\/-------------------------------------\n\n CResourceProvider_Impl( )\n {\n m_ResMgr = CREATEVERSIONRESMGR( RES_NAME );\n }\n\n \/\/-------------------------------------\n \/\/\n \/\/-------------------------------------\n\n ~CResourceProvider_Impl( )\n {\n delete m_ResMgr;\n }\n\n \/\/-------------------------------------\n \/\/\n \/\/-------------------------------------\n\n OUString getResString( sal_Int16 aId )\n {\n String aResString;\n OUString aResOUString;\n\n const ::vos::OGuard aGuard( Application::GetSolarMutex() );\n\n try\n {\n OSL_ASSERT( m_ResMgr );\n\n \/\/ translate the control id to a resource id\n sal_Int16 aResId = CtrlIdToResId( aId );\n\n if ( aResId > -1 )\n {\n aResString = String( ResId( aResId, m_ResMgr ) );\n aResOUString = OUString( aResString );\n }\n }\n catch(...)\n {\n }\n\n return aResOUString;\n }\n\npublic:\n ResMgr* m_ResMgr;\n};\n\n\/\/------------------------------------------------------------\n\/\/\n\/\/------------------------------------------------------------\n\nCResourceProvider::CResourceProvider( ) :\n m_pImpl( new CResourceProvider_Impl() )\n{\n}\n\n\/\/------------------------------------------------------------\n\/\/\n\/\/------------------------------------------------------------\n\nCResourceProvider::~CResourceProvider( )\n{\n delete m_pImpl;\n}\n\n\/\/------------------------------------------------------------\n\/\/\n\/\/------------------------------------------------------------\n\nOUString CResourceProvider::getResString( sal_Int32 aId )\n{\n return m_pImpl->getResString( aId );\n}\n<commit_msg>INTEGRATION: CWS mhu06 (1.5.48); FILE MERGED 2005\/04\/22 11:45:49 mhu 1.5.48.1: #i47753# Adapted to moved resources (from 'svt' to 'fps_office').<commit_after>\/*************************************************************************\n *\n * $RCSfile: resourceprovider.cxx,v $\n *\n * $Revision: 1.6 $\n *\n * last change: $Author: obo $ $Date: 2005-04-27 08:53:18 $\n *\n * The Contents of this file are made available subject to the terms of\n * either of the following licenses\n *\n * - GNU Lesser General Public License Version 2.1\n * - Sun Industry Standards Source License Version 1.1\n *\n * Sun Microsystems Inc., October, 2000\n *\n * GNU Lesser General Public License Version 2.1\n * =============================================\n * Copyright 2000 by Sun Microsystems, Inc.\n * 901 San Antonio Road, Palo Alto, CA 94303, USA\n *\n * This library is free software; you can redistribute it and\/or\n * modify it under the terms of the GNU Lesser General Public\n * License version 2.1, as published by the Free Software Foundation.\n *\n * This library is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU\n * Lesser General Public License for more details.\n *\n * You should have received a copy of the GNU Lesser General Public\n * License along with this library; if not, write to the Free Software\n * Foundation, Inc., 59 Temple Place, Suite 330, Boston,\n * MA 02111-1307 USA\n *\n *\n * Sun Industry Standards Source License Version 1.1\n * =================================================\n * The contents of this file are subject to the Sun Industry Standards\n * Source License Version 1.1 (the \"License\"); You may not use this file\n * except in compliance with the License. You may obtain a copy of the\n * License at http:\/\/www.openoffice.org\/license.html.\n *\n * Software provided under this License is provided on an \"AS IS\" basis,\n * WITHOUT WARRANTY OF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING,\n * WITHOUT LIMITATION, WARRANTIES THAT THE SOFTWARE IS FREE OF DEFECTS,\n * MERCHANTABLE, FIT FOR A PARTICULAR PURPOSE, OR NON-INFRINGING.\n * See the License for the specific provisions governing your rights and\n * obligations concerning the Software.\n *\n * The Initial Developer of the Original Code is: Sun Microsystems, Inc.\n *\n * Copyright: 2000 by Sun Microsystems, Inc.\n *\n * All Rights Reserved.\n *\n * Contributor(s): _______________________________________\n *\n *\n ************************************************************************\/\n\n\/\/------------------------------------------------------------------------\n\/\/ includes\n\/\/------------------------------------------------------------------------\n\n#ifndef _OSL_DIAGNOSE_H_\n#include <osl\/diagnose.h>\n#endif\n\n#ifndef _RTL_USTRBUF_HXX_\n#include <rtl\/ustrbuf.hxx>\n#endif\n\n#ifndef _RESOURCEPROVIDER_HXX_\n#include \"resourceprovider.hxx\"\n#endif\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\n#ifndef _TOOLS_RESMGR_HXX\n#include <tools\/resmgr.hxx>\n#endif\n\n#ifndef _COM_SUN_STAR_UI_DIALOGS_COMMONFILEPICKERELEMENTIDS_HPP_\n#include <com\/sun\/star\/ui\/dialogs\/CommonFilePickerElementIds.hpp>\n#endif\n\n#ifndef _COM_SUN_STAR_UI_DIALOGS_EXTENDEDFILEPICKERELEMENTIDS_HPP_\n#include <com\/sun\/star\/ui\/dialogs\/ExtendedFilePickerElementIds.hpp>\n#endif\n\n#include <svtools\/svtools.hrc>\n\n\/\/------------------------------------------------------------\n\/\/ namespace directives\n\/\/------------------------------------------------------------\n\nusing rtl::OUString;\nusing namespace ::com::sun::star::ui::dialogs::ExtendedFilePickerElementIds;\nusing namespace ::com::sun::star::ui::dialogs::CommonFilePickerElementIds;\n\n\/\/------------------------------------------------------------\n\/\/\n\/\/------------------------------------------------------------\n\n#define RES_NAME fps_office\n\n#define FOLDERPICKER_TITLE 500\n#define FOLDER_PICKER_DEF_DESCRIPTION 501\n\n\/\/------------------------------------------------------------\n\/\/ we have to translate control ids to resource ids\n\/\/------------------------------------------------------------\n\nstruct _Entry\n{\n sal_Int32 ctrlId;\n sal_Int16 resId;\n};\n\n_Entry CtrlIdToResIdTable[] = {\n { CHECKBOX_AUTOEXTENSION, STR_SVT_FILEPICKER_AUTO_EXTENSION },\n { CHECKBOX_PASSWORD, STR_SVT_FILEPICKER_PASSWORD },\n { CHECKBOX_FILTEROPTIONS, STR_SVT_FILEPICKER_FILTER_OPTIONS },\n { CHECKBOX_READONLY, STR_SVT_FILEPICKER_READONLY },\n { CHECKBOX_LINK, STR_SVT_FILEPICKER_INSERT_AS_LINK },\n { CHECKBOX_PREVIEW, STR_SVT_FILEPICKER_SHOW_PREVIEW },\n { PUSHBUTTON_PLAY, STR_SVT_FILEPICKER_PLAY },\n { LISTBOX_VERSION_LABEL, STR_SVT_FILEPICKER_VERSION },\n { LISTBOX_TEMPLATE_LABEL, STR_SVT_FILEPICKER_TEMPLATES },\n { LISTBOX_IMAGE_TEMPLATE_LABEL, STR_SVT_FILEPICKER_IMAGE_TEMPLATE },\n { CHECKBOX_SELECTION, STR_SVT_FILEPICKER_SELECTION },\n { FOLDERPICKER_TITLE, STR_SVT_FOLDERPICKER_DEFAULT_TITLE },\n { FOLDER_PICKER_DEF_DESCRIPTION, STR_SVT_FOLDERPICKER_DEFAULT_DESCRIPTION }\n};\n\nconst sal_Int32 SIZE_TABLE = sizeof( CtrlIdToResIdTable ) \/ sizeof( _Entry );\n\n\/\/------------------------------------------------------------\n\/\/\n\/\/------------------------------------------------------------\n\nsal_Int16 CtrlIdToResId( sal_Int32 aControlId )\n{\n sal_Int16 aResId = -1;\n\n for ( sal_Int32 i = 0; i < SIZE_TABLE; i++ )\n {\n if ( CtrlIdToResIdTable[i].ctrlId == aControlId )\n {\n aResId = CtrlIdToResIdTable[i].resId;\n break;\n }\n }\n\n return aResId;\n}\n\n\/\/------------------------------------------------------------\n\/\/\n\/\/------------------------------------------------------------\n\nclass CResourceProvider_Impl\n{\npublic:\n\n \/\/-------------------------------------\n \/\/\n \/\/-------------------------------------\n\n CResourceProvider_Impl( )\n {\n m_ResMgr = CREATEVERSIONRESMGR( RES_NAME );\n }\n\n \/\/-------------------------------------\n \/\/\n \/\/-------------------------------------\n\n ~CResourceProvider_Impl( )\n {\n delete m_ResMgr;\n }\n\n \/\/-------------------------------------\n \/\/\n \/\/-------------------------------------\n\n OUString getResString( sal_Int16 aId )\n {\n String aResString;\n OUString aResOUString;\n\n const ::vos::OGuard aGuard( Application::GetSolarMutex() );\n\n try\n {\n OSL_ASSERT( m_ResMgr );\n\n \/\/ translate the control id to a resource id\n sal_Int16 aResId = CtrlIdToResId( aId );\n\n if ( aResId > -1 )\n {\n aResString = String( ResId( aResId, m_ResMgr ) );\n aResOUString = OUString( aResString );\n }\n }\n catch(...)\n {\n }\n\n return aResOUString;\n }\n\npublic:\n ResMgr* m_ResMgr;\n};\n\n\/\/------------------------------------------------------------\n\/\/\n\/\/------------------------------------------------------------\n\nCResourceProvider::CResourceProvider( ) :\n m_pImpl( new CResourceProvider_Impl() )\n{\n}\n\n\/\/------------------------------------------------------------\n\/\/\n\/\/------------------------------------------------------------\n\nCResourceProvider::~CResourceProvider( )\n{\n delete m_pImpl;\n}\n\n\/\/------------------------------------------------------------\n\/\/\n\/\/------------------------------------------------------------\n\nOUString CResourceProvider::getResString( sal_Int32 aId )\n{\n return m_pImpl->getResString( aId );\n}\n<|endoftext|>"} {"text":"<commit_before>\/* * This file is part of Maliit framework *\n *\n * Copyright (C) 2010 Nokia Corporation and\/or its subsidiary(-ies).\n * All rights reserved.\n *\n * Contact: maliit-discuss@lists.maliit.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 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 \"mdirectinputcontextplugin.h\"\n\n#include \"mimserver.h\"\n#include \"mimapphostedserverlogic.h\"\n\n#include \"connectionfactory.h\"\n#include \"mimdirectserverconnection.h\"\n#include \"miminputcontextdirectconnection.h\"\n\n#include <maliit\/inputmethod.h>\n\nusing namespace std::tr1;\n\n#include <minputcontext.h>\n#include <QString>\n#include <QStringList>\n\nnamespace {\n const QString MaliitDirectInputContextName(MALIIT_INPUTCONTEXT_NAME\"Direct\");\n}\n\nMDirectInputContextPlugin::MDirectInputContextPlugin(QObject *parent)\n : QInputContextPlugin(parent)\n{\n \/\/ nothing\n}\n\n\nMDirectInputContextPlugin::~MDirectInputContextPlugin()\n{\n \/\/ nothing\n}\n\n\nQInputContext *MDirectInputContextPlugin::create(const QString &key)\n{\n QInputContext *ctx = NULL;\n\n if (key == MaliitDirectInputContextName) {\n QSharedPointer<MImDirectServerConnection> serverConnection =\n qSharedPointerObjectCast<MImDirectServerConnection>(Maliit::createServerConnection(MaliitDirectInputContextName));\n MImInputContextDirectConnection *icConnection = new MImInputContextDirectConnection;\n serverConnection->connectTo(icConnection);\n\n shared_ptr<MInputContextConnection> icConn(icConnection);\n QSharedPointer<MImAppHostedServerLogic> serverLogic(new MImAppHostedServerLogic);\n MImServer *imServer = new MImServer(serverLogic, icConn);\n\n Maliit::InputMethod::instance()->setWidget(serverLogic->pluginsProxyWidget());\n\n ctx = new MInputContext(serverConnection, MaliitDirectInputContextName, this);\n imServer->setParent(ctx);\n } else {\n qCritical() << \"Unknown plugin name\";\n }\n\n return ctx;\n}\n\n\nQString MDirectInputContextPlugin::description(const QString &s)\n{\n Q_UNUSED(s);\n\n return \"Maliit input context plugin\";\n}\n\n\nQString MDirectInputContextPlugin::displayName(const QString &s)\n{\n Q_UNUSED(s);\n\n \/\/ TODO: want this translated?\n return \"Input context for Maliit input methods\";\n}\n\n\nQStringList MDirectInputContextPlugin::keys() const\n{\n return QStringList(MaliitDirectInputContextName);\n}\n\n\nQStringList MDirectInputContextPlugin::languages(const QString &)\n{\n return QStringList(\"EN\"); \/\/ FIXME\n}\n\n\nQ_EXPORT_PLUGIN2(mdirectinputcontext, MDirectInputContextPlugin)\n\n<commit_msg>Explicitly specify temporary\/persistent settings for MImSettings<commit_after>\/* * This file is part of Maliit framework *\n *\n * Copyright (C) 2010 Nokia Corporation and\/or its subsidiary(-ies).\n * All rights reserved.\n *\n * Contact: maliit-discuss@lists.maliit.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 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 \"mdirectinputcontextplugin.h\"\n\n#include \"mimserver.h\"\n#include \"mimapphostedserverlogic.h\"\n\n#include \"connectionfactory.h\"\n#include \"mimdirectserverconnection.h\"\n#include \"miminputcontextdirectconnection.h\"\n\n#include <maliit\/inputmethod.h>\n\nusing namespace std::tr1;\n\n#include <minputcontext.h>\n#include <QString>\n#include <QStringList>\n\nnamespace {\n const QString MaliitDirectInputContextName(MALIIT_INPUTCONTEXT_NAME\"Direct\");\n}\n\nMDirectInputContextPlugin::MDirectInputContextPlugin(QObject *parent)\n : QInputContextPlugin(parent)\n{\n \/\/ nothing\n}\n\n\nMDirectInputContextPlugin::~MDirectInputContextPlugin()\n{\n \/\/ nothing\n}\n\n\nQInputContext *MDirectInputContextPlugin::create(const QString &key)\n{\n QInputContext *ctx = NULL;\n\n if (key == MaliitDirectInputContextName) {\n QSharedPointer<MImDirectServerConnection> serverConnection =\n qSharedPointerObjectCast<MImDirectServerConnection>(Maliit::createServerConnection(MaliitDirectInputContextName));\n MImInputContextDirectConnection *icConnection = new MImInputContextDirectConnection;\n serverConnection->connectTo(icConnection);\n\n shared_ptr<MInputContextConnection> icConn(icConnection);\n QSharedPointer<MImAppHostedServerLogic> serverLogic(new MImAppHostedServerLogic);\n MImServer::configureSettings(MImServer::TemporarySettings);\n MImServer *imServer = new MImServer(serverLogic, icConn);\n\n Maliit::InputMethod::instance()->setWidget(serverLogic->pluginsProxyWidget());\n\n ctx = new MInputContext(serverConnection, MaliitDirectInputContextName, this);\n imServer->setParent(ctx);\n } else {\n qCritical() << \"Unknown plugin name\";\n }\n\n return ctx;\n}\n\n\nQString MDirectInputContextPlugin::description(const QString &s)\n{\n Q_UNUSED(s);\n\n return \"Maliit input context plugin\";\n}\n\n\nQString MDirectInputContextPlugin::displayName(const QString &s)\n{\n Q_UNUSED(s);\n\n \/\/ TODO: want this translated?\n return \"Input context for Maliit input methods\";\n}\n\n\nQStringList MDirectInputContextPlugin::keys() const\n{\n return QStringList(MaliitDirectInputContextName);\n}\n\n\nQStringList MDirectInputContextPlugin::languages(const QString &)\n{\n return QStringList(\"EN\"); \/\/ FIXME\n}\n\n\nQ_EXPORT_PLUGIN2(mdirectinputcontext, MDirectInputContextPlugin)\n\n<|endoftext|>"} {"text":"<commit_before>#include \"precompiled.h\"\n\/\/\n\/\/ Copyright (c) 2013 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\/\/ BufferStorage11.cpp Defines the BufferStorage11 class.\n\n#include \"libGLESv2\/renderer\/d3d11\/BufferStorage11.h\"\n#include \"libGLESv2\/main.h\"\n#include \"libGLESv2\/renderer\/d3d11\/Renderer11.h\"\n#include \"libGLESv2\/renderer\/d3d11\/formatutils11.h\"\n\nnamespace rx\n{\n\nBufferStorage11::BufferStorage11(Renderer11 *renderer)\n{\n mRenderer = renderer;\n\n mStagingBuffer = NULL;\n mStagingBufferSize = 0;\n\n mSize = 0;\n\n mResolvedData = NULL;\n mResolvedDataSize = 0;\n mResolvedDataValid = false;\n\n mReadUsageCount = 0;\n mWriteUsageCount = 0;\n}\n\nBufferStorage11::~BufferStorage11()\n{\n SafeRelease(mStagingBuffer);\n\n if (mResolvedData)\n {\n free(mResolvedData);\n mResolvedData = NULL;\n }\n\n for (size_t bufferIndex = 0; bufferIndex < mDirectBuffers.size(); bufferIndex++)\n {\n SafeDelete(mDirectBuffers[bufferIndex]);\n }\n}\n\nBufferStorage11 *BufferStorage11::makeBufferStorage11(BufferStorage *bufferStorage)\n{\n ASSERT(HAS_DYNAMIC_TYPE(BufferStorage11*, bufferStorage));\n return static_cast<BufferStorage11*>(bufferStorage);\n}\n\nvoid *BufferStorage11::getData()\n{\n ASSERT(mStagingBuffer);\n\n if (!mResolvedDataValid)\n {\n ID3D11Device *device = mRenderer->getDevice();\n ID3D11DeviceContext *context = mRenderer->getDeviceContext();\n HRESULT result;\n\n if (!mResolvedData || mResolvedDataSize < mStagingBufferSize)\n {\n free(mResolvedData);\n mResolvedData = malloc(mSize);\n mResolvedDataSize = mSize;\n }\n\n D3D11_MAPPED_SUBRESOURCE mappedResource;\n result = context->Map(mStagingBuffer, 0, D3D11_MAP_READ, 0, &mappedResource);\n if (FAILED(result))\n {\n return gl::error(GL_OUT_OF_MEMORY, (void*)NULL);\n }\n\n memcpy(mResolvedData, mappedResource.pData, mSize);\n\n context->Unmap(mStagingBuffer, 0);\n\n mResolvedDataValid = true;\n }\n\n mReadUsageCount = 0;\n\n return mResolvedData;\n}\n\nvoid BufferStorage11::setData(const void* data, unsigned int size, unsigned int offset)\n{\n ID3D11Device *device = mRenderer->getDevice();\n ID3D11DeviceContext *context = mRenderer->getDeviceContext();\n HRESULT result;\n\n const unsigned int requiredStagingBufferSize = size + offset;\n const bool createStagingBuffer = !mStagingBuffer || mStagingBufferSize < requiredStagingBufferSize;\n\n if (createStagingBuffer)\n {\n D3D11_BUFFER_DESC bufferDesc;\n bufferDesc.ByteWidth = requiredStagingBufferSize;\n bufferDesc.Usage = D3D11_USAGE_STAGING;\n bufferDesc.BindFlags = 0;\n bufferDesc.CPUAccessFlags = D3D11_CPU_ACCESS_READ | D3D11_CPU_ACCESS_WRITE;\n bufferDesc.MiscFlags = 0;\n bufferDesc.StructureByteStride = 0;\n\n HRESULT result;\n ID3D11Device *device = mRenderer->getDevice();\n ID3D11DeviceContext *context = mRenderer->getDeviceContext();\n ID3D11Buffer *newStagingBuffer;\n\n if (data && offset == 0)\n {\n D3D11_SUBRESOURCE_DATA initialData;\n initialData.pSysMem = data;\n initialData.SysMemPitch = requiredStagingBufferSize;\n initialData.SysMemSlicePitch = 0;\n\n result = device->CreateBuffer(&bufferDesc, &initialData, &newStagingBuffer);\n }\n else\n {\n result = device->CreateBuffer(&bufferDesc, NULL, &newStagingBuffer);\n }\n\n if (FAILED(result))\n {\n mStagingBufferSize = 0;\n return gl::error(GL_OUT_OF_MEMORY);\n }\n\n mStagingBufferSize = requiredStagingBufferSize;\n\n if (mStagingBuffer && offset > 0)\n {\n \/\/ If offset is greater than zero and the buffer is non-null, need to preserve the data from\n \/\/ the old buffer up to offset\n D3D11_BOX srcBox;\n srcBox.left = 0;\n srcBox.right = std::min(offset, requiredStagingBufferSize);\n srcBox.top = 0;\n srcBox.bottom = 1;\n srcBox.front = 0;\n srcBox.back = 1;\n\n context->CopySubresourceRegion(newStagingBuffer, 0, 0, 0, 0, mStagingBuffer, 0, &srcBox);\n }\n\n SafeRelease(mStagingBuffer);\n mStagingBuffer = newStagingBuffer;\n }\n\n if (data && (offset != 0 || !createStagingBuffer))\n {\n D3D11_MAPPED_SUBRESOURCE mappedResource;\n result = context->Map(mStagingBuffer, 0, D3D11_MAP_WRITE, 0, &mappedResource);\n if (FAILED(result))\n {\n return gl::error(GL_OUT_OF_MEMORY);\n }\n\n unsigned char *offsetBufferPointer = reinterpret_cast<unsigned char *>(mappedResource.pData) + offset;\n memcpy(offsetBufferPointer, data, size);\n\n context->Unmap(mStagingBuffer, 0);\n }\n\n for (size_t bufferIndex = 0; bufferIndex < mDirectBuffers.size(); bufferIndex++)\n {\n mDirectBuffers[bufferIndex]->markDirty();\n }\n\n mSize = std::max(mSize, requiredStagingBufferSize);\n mWriteUsageCount = 0;\n\n mResolvedDataValid = false;\n}\n\nvoid BufferStorage11::copyData(BufferStorage* sourceStorage, unsigned int size,\n unsigned int sourceOffset, unsigned int destOffset)\n{\n BufferStorage11* source = makeBufferStorage11(sourceStorage);\n if (source)\n {\n ID3D11DeviceContext *context = mRenderer->getDeviceContext();\n\n D3D11_BOX srcBox;\n srcBox.left = sourceOffset;\n srcBox.right = sourceOffset + size;\n srcBox.top = 0;\n srcBox.bottom = 1;\n srcBox.front = 0;\n srcBox.back = 1;\n\n ASSERT(mStagingBuffer && source->mStagingBuffer);\n context->CopySubresourceRegion(mStagingBuffer, 0, destOffset, 0, 0, source->mStagingBuffer, 0, &srcBox);\n }\n}\n\nvoid BufferStorage11::clear()\n{\n mResolvedDataValid = false;\n mSize = 0;\n}\n\nunsigned int BufferStorage11::getSize() const\n{\n return mSize;\n}\n\nbool BufferStorage11::supportsDirectBinding() const\n{\n return true;\n}\n\nvoid BufferStorage11::markBufferUsage()\n{\n mReadUsageCount++;\n mWriteUsageCount++;\n\n const unsigned int usageLimit = 5;\n\n if (mReadUsageCount > usageLimit && mResolvedData)\n {\n free(mResolvedData);\n mResolvedData = NULL;\n mResolvedDataSize = 0;\n mResolvedDataValid = false;\n }\n}\n\nID3D11Buffer *BufferStorage11::getBuffer(bool isConstantBufferUsage)\n{\n markBufferUsage();\n\n for (size_t bufferIndex = 0; bufferIndex < mDirectBuffers.size(); bufferIndex++)\n {\n DirectBufferStorage11 *directBuffer = mDirectBuffers[bufferIndex];\n\n if (directBuffer->isConstantBufferUsage() == isConstantBufferUsage)\n {\n if (directBuffer->isDirty())\n {\n \/\/ if updateFromStagingBuffer returns true, the D3D buffer has been recreated\n \/\/ and we should update our serial\n if (directBuffer->updateFromStagingBuffer(mStagingBuffer, mSize, 0))\n {\n updateSerial();\n }\n }\n return directBuffer->getD3DBuffer();\n }\n }\n\n \/\/ buffer is not allocated, create it\n DirectBufferStorage11 *directBuffer = new DirectBufferStorage11(mRenderer, isConstantBufferUsage);\n directBuffer->updateFromStagingBuffer(mStagingBuffer, mSize, 0);\n\n mDirectBuffers.push_back(directBuffer);\n updateSerial();\n\n return directBuffer->getD3DBuffer();\n}\n\nID3D11ShaderResourceView *BufferStorage11::getSRV(DXGI_FORMAT srvFormat)\n{\n ID3D11Buffer *buffer = getBuffer(false);\n\n auto bufferSRVIt = mBufferResourceViews.find(srvFormat);\n\n if (bufferSRVIt != mBufferResourceViews.end())\n {\n if (bufferSRVIt->second.first == buffer)\n {\n return bufferSRVIt->second.second;\n }\n else\n {\n \/\/ The underlying buffer has changed since the SRV was created: recreate the SRV.\n SafeRelease(bufferSRVIt->second.second);\n }\n }\n\n ID3D11Device *device = mRenderer->getDevice();\n ID3D11ShaderResourceView *bufferSRV = NULL;\n\n D3D11_SHADER_RESOURCE_VIEW_DESC bufferSRVDesc;\n bufferSRVDesc.Buffer.ElementOffset = 0;\n bufferSRVDesc.Buffer.ElementWidth = mSize \/ d3d11::GetFormatPixelBytes(srvFormat, mRenderer->getCurrentClientVersion());\n bufferSRVDesc.ViewDimension = D3D11_SRV_DIMENSION_BUFFER;\n bufferSRVDesc.Format = srvFormat;\n\n HRESULT result = device->CreateShaderResourceView(buffer, &bufferSRVDesc, &bufferSRV);\n ASSERT(SUCCEEDED(result));\n\n mBufferResourceViews[srvFormat] = BufferSRVPair(buffer, bufferSRV);\n\n return bufferSRV;\n}\n\nDirectBufferStorage11::DirectBufferStorage11(Renderer11 *renderer, bool isConstantBufferUsage)\n : mRenderer(renderer),\n mIsConstantBufferUsage(isConstantBufferUsage),\n mDirectBuffer(NULL),\n mBufferSize(0),\n mDirty(false)\n{\n}\n\nDirectBufferStorage11::~DirectBufferStorage11()\n{\n SafeRelease(mDirectBuffer);\n}\n\nbool DirectBufferStorage11::isConstantBufferUsage() const\n{\n return mIsConstantBufferUsage;\n}\n\n\/\/ Returns true if it recreates the direct buffer\nbool DirectBufferStorage11::updateFromStagingBuffer(ID3D11Buffer *stagingBuffer, size_t size, size_t offset)\n{\n ID3D11Device *device = mRenderer->getDevice();\n ID3D11DeviceContext *context = mRenderer->getDeviceContext();\n\n \/\/ unused for now\n ASSERT(offset == 0);\n\n unsigned int requiredBufferSize = size + offset;\n bool createBuffer = !mDirectBuffer || mBufferSize < requiredBufferSize;\n\n \/\/ (Re)initialize D3D buffer if needed\n if (createBuffer)\n {\n D3D11_BUFFER_DESC bufferDesc;\n fillBufferDesc(&bufferDesc, requiredBufferSize);\n\n ID3D11Buffer *newBuffer;\n HRESULT result = device->CreateBuffer(&bufferDesc, NULL, &newBuffer);\n\n if (FAILED(result))\n {\n return gl::error(GL_OUT_OF_MEMORY, false);\n }\n\n \/\/ No longer need the old buffer\n SafeRelease(mDirectBuffer);\n mDirectBuffer = newBuffer;\n\n mBufferSize = bufferDesc.ByteWidth;\n }\n else\n {\n mBufferSize = requiredBufferSize;\n }\n\n \/\/ Copy data via staging buffer\n D3D11_BOX srcBox;\n srcBox.left = 0;\n srcBox.right = size;\n srcBox.top = 0;\n srcBox.bottom = 1;\n srcBox.front = 0;\n srcBox.back = 1;\n\n context->CopySubresourceRegion(mDirectBuffer, 0, offset, 0, 0, stagingBuffer, 0, &srcBox);\n\n mDirty = false;\n\n return createBuffer;\n}\n\nvoid DirectBufferStorage11::fillBufferDesc(D3D11_BUFFER_DESC* bufferDesc, unsigned int bufferSize)\n{\n bufferDesc->ByteWidth = bufferSize;\n bufferDesc->MiscFlags = 0;\n bufferDesc->StructureByteStride = 0;\n\n if (!mIsConstantBufferUsage)\n {\n bufferDesc->Usage = D3D11_USAGE_DEFAULT;\n bufferDesc->BindFlags = D3D11_BIND_INDEX_BUFFER | D3D11_BIND_VERTEX_BUFFER | D3D11_BIND_SHADER_RESOURCE;\n bufferDesc->CPUAccessFlags = 0;\n }\n else\n {\n bufferDesc->Usage = D3D11_USAGE_DYNAMIC;\n bufferDesc->BindFlags = D3D11_BIND_CONSTANT_BUFFER;\n bufferDesc->CPUAccessFlags = D3D11_CPU_ACCESS_WRITE;\n\n \/\/ Constant buffers must be of a limited size, and aligned to 16 byte boundaries\n \/\/ For our purposes we ignore any buffer data past the maximum constant buffer size\n bufferDesc->ByteWidth = roundUp(bufferDesc->ByteWidth, 16u);\n bufferDesc->ByteWidth = std::min(bufferDesc->ByteWidth, mRenderer->getMaxUniformBufferSize());\n }\n}\n\n}\n<commit_msg>Don't let mBufferSize fall out of sync with the actual buffer size. Pervents unnecessary buffer re-creations.<commit_after>#include \"precompiled.h\"\n\/\/\n\/\/ Copyright (c) 2013 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\/\/ BufferStorage11.cpp Defines the BufferStorage11 class.\n\n#include \"libGLESv2\/renderer\/d3d11\/BufferStorage11.h\"\n#include \"libGLESv2\/main.h\"\n#include \"libGLESv2\/renderer\/d3d11\/Renderer11.h\"\n#include \"libGLESv2\/renderer\/d3d11\/formatutils11.h\"\n\nnamespace rx\n{\n\nBufferStorage11::BufferStorage11(Renderer11 *renderer)\n{\n mRenderer = renderer;\n\n mStagingBuffer = NULL;\n mStagingBufferSize = 0;\n\n mSize = 0;\n\n mResolvedData = NULL;\n mResolvedDataSize = 0;\n mResolvedDataValid = false;\n\n mReadUsageCount = 0;\n mWriteUsageCount = 0;\n}\n\nBufferStorage11::~BufferStorage11()\n{\n SafeRelease(mStagingBuffer);\n\n if (mResolvedData)\n {\n free(mResolvedData);\n mResolvedData = NULL;\n }\n\n for (size_t bufferIndex = 0; bufferIndex < mDirectBuffers.size(); bufferIndex++)\n {\n SafeDelete(mDirectBuffers[bufferIndex]);\n }\n}\n\nBufferStorage11 *BufferStorage11::makeBufferStorage11(BufferStorage *bufferStorage)\n{\n ASSERT(HAS_DYNAMIC_TYPE(BufferStorage11*, bufferStorage));\n return static_cast<BufferStorage11*>(bufferStorage);\n}\n\nvoid *BufferStorage11::getData()\n{\n ASSERT(mStagingBuffer);\n\n if (!mResolvedDataValid)\n {\n ID3D11Device *device = mRenderer->getDevice();\n ID3D11DeviceContext *context = mRenderer->getDeviceContext();\n HRESULT result;\n\n if (!mResolvedData || mResolvedDataSize < mStagingBufferSize)\n {\n free(mResolvedData);\n mResolvedData = malloc(mSize);\n mResolvedDataSize = mSize;\n }\n\n D3D11_MAPPED_SUBRESOURCE mappedResource;\n result = context->Map(mStagingBuffer, 0, D3D11_MAP_READ, 0, &mappedResource);\n if (FAILED(result))\n {\n return gl::error(GL_OUT_OF_MEMORY, (void*)NULL);\n }\n\n memcpy(mResolvedData, mappedResource.pData, mSize);\n\n context->Unmap(mStagingBuffer, 0);\n\n mResolvedDataValid = true;\n }\n\n mReadUsageCount = 0;\n\n return mResolvedData;\n}\n\nvoid BufferStorage11::setData(const void* data, unsigned int size, unsigned int offset)\n{\n ID3D11Device *device = mRenderer->getDevice();\n ID3D11DeviceContext *context = mRenderer->getDeviceContext();\n HRESULT result;\n\n const unsigned int requiredStagingBufferSize = size + offset;\n const bool createStagingBuffer = !mStagingBuffer || mStagingBufferSize < requiredStagingBufferSize;\n\n if (createStagingBuffer)\n {\n D3D11_BUFFER_DESC bufferDesc;\n bufferDesc.ByteWidth = requiredStagingBufferSize;\n bufferDesc.Usage = D3D11_USAGE_STAGING;\n bufferDesc.BindFlags = 0;\n bufferDesc.CPUAccessFlags = D3D11_CPU_ACCESS_READ | D3D11_CPU_ACCESS_WRITE;\n bufferDesc.MiscFlags = 0;\n bufferDesc.StructureByteStride = 0;\n\n HRESULT result;\n ID3D11Device *device = mRenderer->getDevice();\n ID3D11DeviceContext *context = mRenderer->getDeviceContext();\n ID3D11Buffer *newStagingBuffer;\n\n if (data && offset == 0)\n {\n D3D11_SUBRESOURCE_DATA initialData;\n initialData.pSysMem = data;\n initialData.SysMemPitch = requiredStagingBufferSize;\n initialData.SysMemSlicePitch = 0;\n\n result = device->CreateBuffer(&bufferDesc, &initialData, &newStagingBuffer);\n }\n else\n {\n result = device->CreateBuffer(&bufferDesc, NULL, &newStagingBuffer);\n }\n\n if (FAILED(result))\n {\n mStagingBufferSize = 0;\n return gl::error(GL_OUT_OF_MEMORY);\n }\n\n mStagingBufferSize = requiredStagingBufferSize;\n\n if (mStagingBuffer && offset > 0)\n {\n \/\/ If offset is greater than zero and the buffer is non-null, need to preserve the data from\n \/\/ the old buffer up to offset\n D3D11_BOX srcBox;\n srcBox.left = 0;\n srcBox.right = std::min(offset, requiredStagingBufferSize);\n srcBox.top = 0;\n srcBox.bottom = 1;\n srcBox.front = 0;\n srcBox.back = 1;\n\n context->CopySubresourceRegion(newStagingBuffer, 0, 0, 0, 0, mStagingBuffer, 0, &srcBox);\n }\n\n SafeRelease(mStagingBuffer);\n mStagingBuffer = newStagingBuffer;\n }\n\n if (data && (offset != 0 || !createStagingBuffer))\n {\n D3D11_MAPPED_SUBRESOURCE mappedResource;\n result = context->Map(mStagingBuffer, 0, D3D11_MAP_WRITE, 0, &mappedResource);\n if (FAILED(result))\n {\n return gl::error(GL_OUT_OF_MEMORY);\n }\n\n unsigned char *offsetBufferPointer = reinterpret_cast<unsigned char *>(mappedResource.pData) + offset;\n memcpy(offsetBufferPointer, data, size);\n\n context->Unmap(mStagingBuffer, 0);\n }\n\n for (size_t bufferIndex = 0; bufferIndex < mDirectBuffers.size(); bufferIndex++)\n {\n mDirectBuffers[bufferIndex]->markDirty();\n }\n\n mSize = std::max(mSize, requiredStagingBufferSize);\n mWriteUsageCount = 0;\n\n mResolvedDataValid = false;\n}\n\nvoid BufferStorage11::copyData(BufferStorage* sourceStorage, unsigned int size,\n unsigned int sourceOffset, unsigned int destOffset)\n{\n BufferStorage11* source = makeBufferStorage11(sourceStorage);\n if (source)\n {\n ID3D11DeviceContext *context = mRenderer->getDeviceContext();\n\n D3D11_BOX srcBox;\n srcBox.left = sourceOffset;\n srcBox.right = sourceOffset + size;\n srcBox.top = 0;\n srcBox.bottom = 1;\n srcBox.front = 0;\n srcBox.back = 1;\n\n ASSERT(mStagingBuffer && source->mStagingBuffer);\n context->CopySubresourceRegion(mStagingBuffer, 0, destOffset, 0, 0, source->mStagingBuffer, 0, &srcBox);\n }\n}\n\nvoid BufferStorage11::clear()\n{\n mResolvedDataValid = false;\n mSize = 0;\n}\n\nunsigned int BufferStorage11::getSize() const\n{\n return mSize;\n}\n\nbool BufferStorage11::supportsDirectBinding() const\n{\n return true;\n}\n\nvoid BufferStorage11::markBufferUsage()\n{\n mReadUsageCount++;\n mWriteUsageCount++;\n\n const unsigned int usageLimit = 5;\n\n if (mReadUsageCount > usageLimit && mResolvedData)\n {\n free(mResolvedData);\n mResolvedData = NULL;\n mResolvedDataSize = 0;\n mResolvedDataValid = false;\n }\n}\n\nID3D11Buffer *BufferStorage11::getBuffer(bool isConstantBufferUsage)\n{\n markBufferUsage();\n\n for (size_t bufferIndex = 0; bufferIndex < mDirectBuffers.size(); bufferIndex++)\n {\n DirectBufferStorage11 *directBuffer = mDirectBuffers[bufferIndex];\n\n if (directBuffer->isConstantBufferUsage() == isConstantBufferUsage)\n {\n if (directBuffer->isDirty())\n {\n \/\/ if updateFromStagingBuffer returns true, the D3D buffer has been recreated\n \/\/ and we should update our serial\n if (directBuffer->updateFromStagingBuffer(mStagingBuffer, mSize, 0))\n {\n updateSerial();\n }\n }\n return directBuffer->getD3DBuffer();\n }\n }\n\n \/\/ buffer is not allocated, create it\n DirectBufferStorage11 *directBuffer = new DirectBufferStorage11(mRenderer, isConstantBufferUsage);\n directBuffer->updateFromStagingBuffer(mStagingBuffer, mSize, 0);\n\n mDirectBuffers.push_back(directBuffer);\n updateSerial();\n\n return directBuffer->getD3DBuffer();\n}\n\nID3D11ShaderResourceView *BufferStorage11::getSRV(DXGI_FORMAT srvFormat)\n{\n ID3D11Buffer *buffer = getBuffer(false);\n\n auto bufferSRVIt = mBufferResourceViews.find(srvFormat);\n\n if (bufferSRVIt != mBufferResourceViews.end())\n {\n if (bufferSRVIt->second.first == buffer)\n {\n return bufferSRVIt->second.second;\n }\n else\n {\n \/\/ The underlying buffer has changed since the SRV was created: recreate the SRV.\n SafeRelease(bufferSRVIt->second.second);\n }\n }\n\n ID3D11Device *device = mRenderer->getDevice();\n ID3D11ShaderResourceView *bufferSRV = NULL;\n\n D3D11_SHADER_RESOURCE_VIEW_DESC bufferSRVDesc;\n bufferSRVDesc.Buffer.ElementOffset = 0;\n bufferSRVDesc.Buffer.ElementWidth = mSize \/ d3d11::GetFormatPixelBytes(srvFormat, mRenderer->getCurrentClientVersion());\n bufferSRVDesc.ViewDimension = D3D11_SRV_DIMENSION_BUFFER;\n bufferSRVDesc.Format = srvFormat;\n\n HRESULT result = device->CreateShaderResourceView(buffer, &bufferSRVDesc, &bufferSRV);\n ASSERT(SUCCEEDED(result));\n\n mBufferResourceViews[srvFormat] = BufferSRVPair(buffer, bufferSRV);\n\n return bufferSRV;\n}\n\nDirectBufferStorage11::DirectBufferStorage11(Renderer11 *renderer, bool isConstantBufferUsage)\n : mRenderer(renderer),\n mIsConstantBufferUsage(isConstantBufferUsage),\n mDirectBuffer(NULL),\n mBufferSize(0),\n mDirty(false)\n{\n}\n\nDirectBufferStorage11::~DirectBufferStorage11()\n{\n SafeRelease(mDirectBuffer);\n}\n\nbool DirectBufferStorage11::isConstantBufferUsage() const\n{\n return mIsConstantBufferUsage;\n}\n\n\/\/ Returns true if it recreates the direct buffer\nbool DirectBufferStorage11::updateFromStagingBuffer(ID3D11Buffer *stagingBuffer, size_t size, size_t offset)\n{\n ID3D11Device *device = mRenderer->getDevice();\n ID3D11DeviceContext *context = mRenderer->getDeviceContext();\n\n \/\/ unused for now\n ASSERT(offset == 0);\n\n unsigned int requiredBufferSize = size + offset;\n bool createBuffer = !mDirectBuffer || mBufferSize < requiredBufferSize;\n\n \/\/ (Re)initialize D3D buffer if needed\n if (createBuffer)\n {\n D3D11_BUFFER_DESC bufferDesc;\n fillBufferDesc(&bufferDesc, requiredBufferSize);\n\n ID3D11Buffer *newBuffer;\n HRESULT result = device->CreateBuffer(&bufferDesc, NULL, &newBuffer);\n\n if (FAILED(result))\n {\n return gl::error(GL_OUT_OF_MEMORY, false);\n }\n\n \/\/ No longer need the old buffer\n SafeRelease(mDirectBuffer);\n mDirectBuffer = newBuffer;\n\n mBufferSize = bufferDesc.ByteWidth;\n }\n\n \/\/ Copy data via staging buffer\n D3D11_BOX srcBox;\n srcBox.left = 0;\n srcBox.right = size;\n srcBox.top = 0;\n srcBox.bottom = 1;\n srcBox.front = 0;\n srcBox.back = 1;\n\n context->CopySubresourceRegion(mDirectBuffer, 0, offset, 0, 0, stagingBuffer, 0, &srcBox);\n\n mDirty = false;\n\n return createBuffer;\n}\n\nvoid DirectBufferStorage11::fillBufferDesc(D3D11_BUFFER_DESC* bufferDesc, unsigned int bufferSize)\n{\n bufferDesc->ByteWidth = bufferSize;\n bufferDesc->MiscFlags = 0;\n bufferDesc->StructureByteStride = 0;\n\n if (!mIsConstantBufferUsage)\n {\n bufferDesc->Usage = D3D11_USAGE_DEFAULT;\n bufferDesc->BindFlags = D3D11_BIND_INDEX_BUFFER | D3D11_BIND_VERTEX_BUFFER | D3D11_BIND_SHADER_RESOURCE;\n bufferDesc->CPUAccessFlags = 0;\n }\n else\n {\n bufferDesc->Usage = D3D11_USAGE_DYNAMIC;\n bufferDesc->BindFlags = D3D11_BIND_CONSTANT_BUFFER;\n bufferDesc->CPUAccessFlags = D3D11_CPU_ACCESS_WRITE;\n\n \/\/ Constant buffers must be of a limited size, and aligned to 16 byte boundaries\n \/\/ For our purposes we ignore any buffer data past the maximum constant buffer size\n bufferDesc->ByteWidth = roundUp(bufferDesc->ByteWidth, 16u);\n bufferDesc->ByteWidth = std::min(bufferDesc->ByteWidth, mRenderer->getMaxUniformBufferSize());\n }\n}\n\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#include <string>\n#include <libport\/cassert>\n#include <cstdarg>\n#include <libport\/cstdlib>\n#include <iostream>\n#include <stdexcept>\n\n#include <boost\/assign\/list_of.hpp>\nusing namespace boost::assign;\n\n#include <libport\/cli.hh>\n#include <libport\/containers.hh>\n#include <libport\/debug.hh>\n#include <libport\/foreach.hh>\n#include <libport\/package-info.hh>\n#include <libport\/program-name.hh>\n#include <libport\/sysexits.hh>\n#include <libport\/unistd.h>\n#include <libport\/windows.hh>\n#include <libport\/option-parser.hh>\n\n#include <urbi\/exit.hh>\n#include <urbi\/package-info.hh>\n#include <urbi\/uclient.hh>\n#include <urbi\/urbi-root.hh>\n\nGD_CATEGORY(Urbi.UrbiLaunch);\n\nusing namespace urbi;\nusing libport::program_name;\n\nstatic UCallbackAction\nonError(const UMessage& msg)\n{\n LIBPORT_USE(msg);\n GD_FERROR(\"%s: load module error: %s\", program_name(), msg.message);\n return URBI_CONTINUE;\n}\n\nstatic UCallbackAction\nonDone(const UMessage&)\n{\n ::exit(0);\n}\n\nstatic int\nconnect_plugin(const std::string& host, int port,\n const libport::cli_args_type& modules)\n{\n UClient cl(host, port);\n if (cl.error())\n \/\/ UClient already displayed an error message.\n ::exit(1);\n cl.setErrorCallback(callback(&onError));\n cl.setCallback(callback(&onDone), \"output\");\n foreach (const std::string& m, modules)\n cl << \"loadModule(\\\"\" << m << \"\\\");\";\n cl << \"output << 1;\";\n while (true)\n sleep(1);\n return 0;\n}\n\nstatic void\nusage(libport::OptionParser& parser)\n{\n std::cout <<\n \"usage: \" << program_name() <<\n \" [OPTIONS] MODULE_NAMES ... [-- UOPTIONS...]\\n\"\n \"Start an UObject in either remote or plugin mode.\\n\"\n << parser <<\n \"\\n\"\n \"MODULE_NAMES is a list of modules.\\n\"\n \"UOPTIONS are passed to urbi::main in remote and start modes.\\n\"\n \"\\n\"\n \"Exit values:\\n\"\n \" 0 success\\n\"\n \" \" << EX_NOINPUT << \" some of the MODULES are missing\\n\"\n \" \" << EX_OSFILE << \" libuobject is missing\\n\"\n \" * other kinds of errors\\n\"\n ;\n ::exit(EX_OK);\n}\n\n\nstatic\nvoid\nversion()\n{\n std::cout << urbi::package_info() << std::endl\n << libport::exit(EX_OK);\n}\n\n\nstatic\nint\nurbi_launch_(int argc, const char* argv[], UrbiRoot& urbi_root)\n{\n libport::program_initialize(argc, argv);\n\n \/\/ The options passed to urbi::main.\n libport::cli_args_type args;\n\n args << argv[0];\n\n libport::OptionValue\n arg_custom(\"start using the shared library FILE\", \"custom\", 'c', \"FILE\"),\n arg_pfile(\"file containing the port to listen to\", \"port-file\", 0, \"FILE\");\n libport::OptionFlag\n arg_plugin(\"start as a plugin uobject on a running server\", \"plugin\", 'p'),\n arg_remote(\"start as a remote uobject\", \"remote\", 'r'),\n arg_start(\"start an urbi server and connect as plugin\", \"start\", 's');\n libport::OptionsEnd arg_end;\n\n libport::OptionParser opt_parser;\n opt_parser << \"Urbi-Launch options:\"\n\t << libport::opts::help\n\t << libport::opts::version\n\t << arg_custom\n#ifndef LIBPORT_DEBUG_DISABLE\n\t << libport::opts::debug\n#endif\n\t << \"Mode selection:\"\n\t << arg_plugin\n\t << arg_remote\n\t << arg_start\n\t << \"Urbi-Launch options for plugin mode:\"\n\t << libport::opts::host\n\t << libport::opts::port\n\t << arg_pfile\n\t << arg_end;\n\n \/\/ The list of modules.\n libport::cli_args_type modules;\n try\n {\n modules = opt_parser(libport::program_arguments());\n }\n catch (const libport::Error& e)\n {\n const libport::Error::errors_type& err = e.errors();\n foreach (std::string wrong_arg, err)\n libport::invalid_option(wrong_arg);\n }\n\n if (libport::opts::version.get())\n version();\n if (libport::opts::help.get())\n usage(opt_parser);\n\n \/\/ Connection mode.\n enum ConnectMode\n {\n \/\/\/ Start a new engine and plug the module\n MODE_PLUGIN_START,\n \/\/\/ Load the module in a running engine as a plugin\n MODE_PLUGIN_LOAD,\n \/\/\/ Connect the module to a running engine (remote uobject)\n MODE_REMOTE\n };\n ConnectMode connect_mode = MODE_REMOTE;\n\n if (arg_plugin.get())\n connect_mode = MODE_PLUGIN_LOAD;\n if (arg_remote.get())\n connect_mode = MODE_REMOTE;\n if (arg_start.get())\n connect_mode = MODE_PLUGIN_START;\n\n \/\/\/ Server host name.\n std::string host = libport::opts::host.value(UClient::default_host());\n if (libport::opts::host.filled())\n args << \"--host\" << host;\n\n \/\/\/ Server port.\n int port = libport::opts::port.get<int>(urbi::UClient::URBI_PORT);\n if (libport::opts::port.filled())\n args << \"--port\" << libport::opts::port.value();\n\n if (arg_pfile.filled())\n {\n std::string file = arg_pfile.value();\n if (connect_mode == MODE_PLUGIN_LOAD)\n port = libport::file_contents_get<int>(file);\n args << \"--port-file\" << file;\n }\n args.insert(args.end(), arg_end.get().begin(), arg_end.get().end());\n\n \/\/\/ Modules to load.\n if (connect_mode == MODE_PLUGIN_LOAD)\n return connect_plugin(host, port, modules);\n foreach (const std::string& s, modules)\n args << \"--module\" << s;\n\n \/\/ Open the right core library.\n if (arg_custom.filled())\n urbi_root.load_custom(arg_custom.value());\n else if (connect_mode == MODE_REMOTE)\n urbi_root.load_remote();\n else\n urbi_root.load_plugin();\n return urbi_root.urbi_main(args, true, true);\n}\n\nextern \"C\"\n{\n int\n URBI_SDK_API\n urbi_launch(int argc, const char* argv[], UrbiRoot& root)\n try\n {\n return urbi_launch_(argc, argv, root);\n }\n catch (const std::exception& e)\n {\n std::cerr << argv[0] << \": \" << e.what() << std::endl\n << libport::exit(EX_FAIL);\n }\n}\n<commit_msg>Urbi.Launch: fix.<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#include <string>\n#include <libport\/cassert>\n#include <cstdarg>\n#include <libport\/cstdlib>\n#include <iostream>\n#include <stdexcept>\n\n#include <boost\/assign\/list_of.hpp>\nusing namespace boost::assign;\n\n#include <libport\/cli.hh>\n#include <libport\/containers.hh>\n#include <libport\/debug.hh>\n#include <libport\/foreach.hh>\n#include <libport\/package-info.hh>\n#include <libport\/program-name.hh>\n#include <libport\/sysexits.hh>\n#include <libport\/unistd.h>\n#include <libport\/windows.hh>\n#include <libport\/option-parser.hh>\n\n#include <urbi\/exit.hh>\n#include <urbi\/package-info.hh>\n#include <urbi\/uclient.hh>\n#include <urbi\/urbi-root.hh>\n\nGD_CATEGORY(Urbi.UrbiLaunch);\n\nusing namespace urbi;\nusing libport::program_name;\n\nstatic UCallbackAction\nonError(const UMessage& msg)\n{\n LIBPORT_USE(msg);\n GD_FERROR(\"%s: load module error: %s\", program_name(), msg.message);\n return URBI_CONTINUE;\n}\n\nstatic UCallbackAction\nonDone(const UMessage&)\n{\n ::exit(0);\n}\n\nstatic int\nconnect_plugin(const std::string& host, int port,\n const libport::cli_args_type& modules)\n{\n UClient cl(host, port);\n if (cl.error())\n \/\/ UClient already displayed an error message.\n ::exit(1);\n cl.setErrorCallback(callback(&onError));\n cl.setCallback(callback(&onDone), \"output\");\n foreach (const std::string& m, modules)\n cl << \"loadModule(\\\"\" << m << \"\\\");\";\n cl << \"output << 1;\";\n while (true)\n sleep(1);\n return 0;\n}\n\nstatic void\nusage(libport::OptionParser& parser)\n{\n std::cout <<\n \"usage: \" << program_name() <<\n \" [OPTIONS] MODULE_NAMES ... [-- UOPTIONS...]\\n\"\n \"Start an UObject in either remote or plugin mode.\\n\"\n << parser <<\n \"\\n\"\n \"MODULE_NAMES is a list of modules.\\n\"\n \"UOPTIONS are passed to urbi::main in remote and start modes.\\n\"\n \"\\n\"\n \"Exit values:\\n\"\n \" 0 success\\n\"\n \" \" << EX_NOINPUT << \" some of the MODULES are missing\\n\"\n \" \" << EX_OSFILE << \" libuobject is missing\\n\"\n \" * other kinds of errors\\n\"\n ;\n ::exit(EX_OK);\n}\n\n\nstatic\nvoid\nversion()\n{\n std::cout << urbi::package_info() << std::endl\n << libport::exit(EX_OK);\n}\n\n\nstatic\nint\nurbi_launch_(int argc, const char* argv[], UrbiRoot& urbi_root)\n{\n libport::program_initialize(argc, argv);\n\n \/\/ The options passed to urbi::main.\n libport::cli_args_type args;\n\n args << argv[0];\n\n libport::OptionValue\n arg_custom(\"start using the shared library FILE\", \"custom\", 'c', \"FILE\"),\n arg_pfile(\"file containing the port to listen to\", \"port-file\", 0, \"FILE\");\n libport::OptionFlag\n arg_plugin(\"start as a plugin uobject on a running server\", \"plugin\", 'p'),\n arg_remote(\"start as a remote uobject\", \"remote\", 'r'),\n arg_start(\"start an urbi server and connect as plugin\", \"start\", 's');\n libport::OptionsEnd arg_end;\n\n libport::OptionParser opt_parser;\n opt_parser << \"Urbi-Launch options:\"\n\t << libport::opts::help\n\t << libport::opts::version\n\t << arg_custom\n#ifndef LIBPORT_DEBUG_DISABLE\n\t << libport::opts::debug\n#endif\n\t << \"Mode selection:\"\n\t << arg_plugin\n\t << arg_remote\n\t << arg_start\n\t << \"Urbi-Launch options for plugin mode:\"\n\t << libport::opts::host\n\t << libport::opts::port\n\t << arg_pfile\n\t << arg_end;\n\n \/\/ The list of modules.\n libport::cli_args_type modules;\n try\n {\n modules = opt_parser(libport::program_arguments());\n }\n catch (const libport::Error& e)\n {\n foreach (std::string wrong_arg, e.errors())\n libport::invalid_option(wrong_arg);\n }\n\n if (libport::opts::version.get())\n version();\n if (libport::opts::help.get())\n usage(opt_parser);\n\n \/\/ Connection mode.\n enum ConnectMode\n {\n \/\/\/ Start a new engine and plug the module\n MODE_PLUGIN_START,\n \/\/\/ Load the module in a running engine as a plugin\n MODE_PLUGIN_LOAD,\n \/\/\/ Connect the module to a running engine (remote uobject)\n MODE_REMOTE\n };\n\n ConnectMode connect_mode =\n arg_plugin.get() ? MODE_PLUGIN_LOAD\n : arg_remote.get() ? MODE_REMOTE\n : arg_start.get() ? MODE_PLUGIN_START\n : MODE_REMOTE;\n\n \/\/ Server host name.\n std::string host = libport::opts::host.value(UClient::default_host());\n if (libport::opts::host.filled())\n args << \"--host\" << host;\n\n \/\/ Server port.\n int port = libport::opts::port.get<int>(urbi::UClient::URBI_PORT);\n if (libport::opts::port.filled())\n args << \"--port\" << libport::opts::port.value();\n\n if (arg_pfile.filled())\n {\n std::string file = arg_pfile.value();\n if (connect_mode == MODE_PLUGIN_LOAD)\n port = libport::file_contents_get<int>(file);\n args << \"--port-file\" << file;\n }\n\n \/\/ Modules to load.\n if (connect_mode == MODE_PLUGIN_LOAD)\n return connect_plugin(host, port, modules);\n foreach (const std::string& s, modules)\n args << \"--module\" << s;\n\n \/\/ Other arguments.\n args.insert(args.end(), arg_end.get().begin(), arg_end.get().end());\n\n \/\/ Open the right core library.\n if (arg_custom.filled())\n urbi_root.load_custom(arg_custom.value());\n else if (connect_mode == MODE_REMOTE)\n urbi_root.load_remote();\n else\n urbi_root.load_plugin();\n return urbi_root.urbi_main(args, true, true);\n}\n\nextern \"C\"\n{\n int\n URBI_SDK_API\n urbi_launch(int argc, const char* argv[], UrbiRoot& root)\n try\n {\n return urbi_launch_(argc, argv, root);\n }\n catch (const std::exception& e)\n {\n std::cerr << argv[0] << \": \" << e.what() << std::endl\n << libport::exit(EX_FAIL);\n }\n}\n<|endoftext|>"} {"text":"<commit_before>#pragma once\n\/*\n* Covariant Script Programming Language\n*\n* This program is free software: you can redistribute it and\/or modify\n* it under the terms of the GNU General Public License as published by\n* the Free Software Foundation, either version 3 of the License, or\n* any later version.\n*\n* This program is distributed in the hope that it will be useful,\n* but WITHOUT ANY WARRANTY; without even the implied warranty of\n* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the\n* GNU General Public License for more details.\n*\n* You should have received a copy of the GNU General Public License\n* along with this program. If not, see <http:\/\/www.gnu.org\/licenses\/>.\n*\n* Copyright (C) 2017 Michael Lee(李登淳)\n* Email: mikecovlee@163.com\n* Github: https:\/\/github.com\/mikecovlee\n* Website: http:\/\/covariant.cn\/cs\n*\n* Namespaces:\n* cs: Main Namespace\n* cs_impl: Implement Namespace\n*\/\n\/\/ Mozart\n#include \"..\/include\/mozart\/static_stack.hpp\"\n#include \"..\/include\/mozart\/random.hpp\"\n#include \"..\/include\/mozart\/timer.hpp\"\n#include \"..\/include\/mozart\/tree.hpp\"\n\/\/ LibDLL\n#include \"..\/include\/libdll\/dll.hpp\"\n\/\/ STL\n#include <unordered_map>\n#include <unordered_set>\n#include <forward_list>\n#include <functional>\n#include <algorithm>\n#include <fstream>\n#include <sstream>\n#include <iomanip>\n#include <istream>\n#include <ostream>\n#include <utility>\n#include <string>\n#include <memory>\n#include <cmath>\n#include <deque>\n#include <list>\n#include <map>\n\/\/ CovScript Headers\n#include \".\/exceptions.hpp\"\n#include \".\/any.hpp\"\n#include \".\/typedef.hpp\"\n\nnamespace cs {\n\/\/ Version\n\tconst std::string version=\"1.0.3\";\n\/\/ Output Precision\n\tstatic int output_precision=8;\n\/\/ Callable and Function\n\tclass callable final {\n\tpublic:\n\t\tusing function_type=std::function<var(array&)>;\n\tprivate:\n\t\tfunction_type mFunc;\n\t\tbool mConstant=false;\n\tpublic:\n\t\tcallable()=delete;\n\t\tcallable(const callable&)=default;\n\t\tcallable(const function_type& func,bool constant=false):mFunc(func),mConstant(constant) {}\n\t\tbool is_constant() const\n\t\t{\n\t\t\treturn mConstant;\n\t\t}\n\t\tvar call(array& args) const\n\t\t{\n\t\t\treturn mFunc(args);\n\t\t}\n\t};\n\tclass function final {\n\t\tfriend class statement_return;\n\t\tmutable var mRetVal;\n\t\tstd::deque<std::string> mArgs;\n\t\tstd::deque<statement_base*> mBody;\n\t\tstd::shared_ptr<std::unordered_map<string,var>> mData;\n\tpublic:\n\t\tfunction()=delete;\n\t\tfunction(const std::deque<std::string>& args,const std::deque<statement_base*>& body):mArgs(args),mBody(body) {}\n\t\t~function()=default;\n\t\tvar call(array&) const;\n\t\tvoid set_data(const std::shared_ptr<std::unordered_map<string,var>>& data)\n\t\t{\n\t\t\tmData=data;\n\t\t}\n\t};\n\tclass object_method final {\n\t\tvar mObj;\n\t\tvar mCallable;\n\tpublic:\n\t\tobject_method()=delete;\n\t\tobject_method(const var& obj,const var& callable):mObj(obj),mCallable(callable) {}\n\t\t~object_method()=default;\n\t\tconst var& get_callable() const\n\t\t{\n\t\t\treturn mCallable;\n\t\t}\n\t\tvar operator()(array& args) const\n\t\t{\n\t\t\targs.push_front(mObj);\n\t\t\tvar retval=mCallable.const_val<callable>().call(args);\n\t\t\targs.pop_front();\n\t\t\treturn retval;\n\t\t}\n\t};\n\/\/ Type and struct\n\tstruct pointer final {\n\t\tvar data;\n\t\tpointer()=default;\n\t\tpointer(const var& v):data(v) {}\n\t\tbool operator==(const pointer& ptr) const\n\t\t{\n\t\t\treturn data.is_same(ptr.data);\n\t\t}\n\t};\n\tstatic const pointer null_pointer= {};\n\tstruct type final {\n\t\tstd::function<var()> constructor;\n\t\tstd::size_t id;\n\t\textension_t extensions;\n\t\ttype()=delete;\n\t\ttype(const std::function<var()>& c,std::size_t i):constructor(c),id(i) {}\n\t\ttype(const std::function<var()>& c,std::size_t i,extension_t ext):constructor(c),id(i),extensions(ext) {}\n\t\tvar& get_var(const std::string&) const;\n\t};\n\tclass structure final {\n\t\tstd::size_t m_hash;\n\t\tstd::string m_name;\n\t\tstd::shared_ptr<std::unordered_map<string,var>> m_data;\n\tpublic:\n\t\tstructure()=delete;\n\t\tstructure(std::size_t hash,const std::string& name,const std::shared_ptr<std::unordered_map<string,var>>& data):m_hash(hash),m_name(typeid(structure).name()+name),m_data(data) {}\n\t\tstructure(const structure& s):m_hash(s.m_hash),m_name(s.m_name),m_data(std::make_shared<std::unordered_map<string,var>>(*s.m_data))\n\t\t{\n\t\t\tfor(auto& it:*m_data) {\n\t\t\t\tit.second.clone();\n\t\t\t\tif(it.second.type()==typeid(function))\n\t\t\t\t\tit.second.val<function>(true).set_data(m_data);\n\t\t\t}\n\t\t}\n\t\t~structure()=default;\n\t\tstd::shared_ptr<std::unordered_map<string,var>>& get_domain()\n\t\t{\n\t\t\treturn m_data;\n\t\t}\n\t\tstd::size_t get_hash() const\n\t\t{\n\t\t\treturn m_hash;\n\t\t}\n\t\tvar& get_var(const std::string& name) const\n\t\t{\n\t\t\tif(m_data->count(name)>0)\n\t\t\t\treturn (*m_data)[name];\n\t\t\telse\n\t\t\t\tthrow syntax_error(\"Struct \\\"\"+m_name+\"\\\" have no member called \\\"\"+name+\"\\\".\");\n\t\t}\n\t};\n\tclass struct_builder final {\n\t\tstatic std::size_t mCount;\n\t\tstd::size_t mHash;\n\t\tstd::string mName;\n\t\tstd::deque<statement_base*> mMethod;\n\tpublic:\n\t\tstruct_builder()=delete;\n\t\tstruct_builder(const std::string& name,const std::deque<statement_base*>& method):mHash(++mCount),mName(name),mMethod(method) {}\n\t\tstruct_builder(const struct_builder&)=default;\n\t\t~struct_builder()=default;\n\t\tstd::size_t get_hash() const\n\t\t{\n\t\t\treturn mHash;\n\t\t}\n\t\tvar operator()();\n\t};\n\tstd::size_t struct_builder::mCount=0;\n\/\/ Internal Garbage Collection\n\ttemplate<typename T>class garbage_collector final {\n\t\tstd::forward_list<T*> table_new;\n\t\tstd::forward_list<T*> table_delete;\n\tpublic:\n\t\tgarbage_collector()=default;\n\t\tgarbage_collector(const garbage_collector&)=delete;\n\t\t~garbage_collector()\n\t\t{\n\t\t\tfor(auto& ptr:table_delete)\n\t\t\t\ttable_new.remove(ptr);\n\t\t\tfor(auto& ptr:table_new)\n\t\t\t\tdelete ptr;\n\t\t}\n\t\tvoid add(void* ptr)\n\t\t{\n\t\t\ttable_new.push_front(static_cast<T*>(ptr));\n\t\t}\n\t\tvoid remove(void* ptr)\n\t\t{\n\t\t\ttable_delete.push_front(static_cast<T*>(ptr));\n\t\t}\n\t};\n\/\/ Namespace and extensions\n\tclass name_space final {\n\t\tstd::unordered_map<string,var> m_data;\n\tpublic:\n\t\tname_space()=default;\n\t\tname_space(const name_space&)=delete;\n\t\tname_space(const std::unordered_map<string,var>& dat):m_data(dat) {}\n\t\t~name_space()=default;\n\t\tvoid add_var(const std::string& name,const var& var)\n\t\t{\n\t\t\tif(m_data.count(name)>0)\n\t\t\t\tm_data[name]=var;\n\t\t\telse\n\t\t\t\tm_data.emplace(name,var);\n\t\t}\n\t\tvar& get_var(const std::string& name)\n\t\t{\n\t\t\tif(m_data.count(name)>0)\n\t\t\t\treturn m_data[name];\n\t\t\telse\n\t\t\t\tthrow syntax_error(\"Use of undefined variable \\\"\"+name+\"\\\" in extension.\");\n\t\t}\n\t};\n\tclass name_space_holder final {\n\t\tname_space* m_ns=nullptr;\n\t\tcov::dll m_dll;\n\tpublic:\n\t\tname_space_holder()=delete;\n\t\tname_space_holder(name_space* ptr):m_ns(ptr) {}\n\t\tname_space_holder(const std::string& path):m_dll(path)\n\t\t{\n\t\t\tm_ns=reinterpret_cast<name_space*(*)()>(m_dll.get_address(\"__CS_EXTENSION__\"))();\n\t\t}\n\t\t~name_space_holder()=default;\n\t\tvar& get_var(const std::string& name)\n\t\t{\n\t\t\tif(m_ns==nullptr)\n\t\t\t\tthrow internal_error(\"Use of nullptr of extension.\");\n\t\t\treturn m_ns->get_var(name);\n\t\t}\n\t};\n\/\/ Var definition\n\tstruct define_var_profile {\n\t\tstd::string id;\n\t\tcov::tree<token_base*> expr;\n\t};\n\tvoid parse_define_var(cov::tree<token_base*>&,define_var_profile&);\n\/\/ Implement\n\tvar& type::get_var(const std::string& name) const\n\t{\n\t\tif(extensions.get()!=nullptr)\n\t\t\treturn extensions->get_var(name);\n\t\telse\n\t\t\tthrow syntax_error(\"Type does not support the extension\");\n\t}\n\/\/ literal format\n\tvar parse_value(const std::string& str)\n\t{\n\t\tif(str==\"true\")\n\t\t\treturn true;\n\t\tif(str==\"false\")\n\t\t\treturn false;\n\t\ttry {\n\t\t\treturn number(std::stold(str));\n\t\t}\n\t\tcatch(...) {\n\t\t\treturn str;\n\t\t}\n\t\treturn str;\n\t}\n\/\/ Copy\n\tvoid copy_no_return(var& val)\n\t{\n\t\tval.clone();\n\t\tval.detach();\n\t}\n\tvar copy(var val)\n\t{\n\t\tval.clone();\n\t\tval.detach();\n\t\treturn val;\n\t}\n}\nnamespace cs_impl {\n\ttemplate<>void detach<cs::pair>(cs::pair& val)\n\t{\n\t\tcs::copy_no_return(val.first);\n\t\tcs::copy_no_return(val.second);\n\t}\n\ttemplate<>void detach<cs::list>(cs::list& val)\n\t{\n\t\tfor(auto& it:val)\n\t\t\tcs::copy_no_return(it);\n\t}\n\ttemplate<>void detach<cs::array>(cs::array& val)\n\t{\n\t\tfor(auto& it:val)\n\t\t\tcs::copy_no_return(it);\n\t}\n\ttemplate<>void detach<cs::hash_map>(cs::hash_map& val)\n\t{\n\t\tfor(auto& it:val)\n\t\t\tcs::copy_no_return(it.second);\n\t}\n\ttemplate<>std::string to_string<cs::number>(const cs::number& val)\n\t{\n\t\tstd::stringstream ss;\n\t\tstd::string str;\n\t\tss<<std::setprecision(cs::output_precision)<<val;\n\t\tss>>str;\n\t\treturn std::move(str);\n\t}\n\ttemplate<>std::string to_string<char>(const char& c)\n\t{\n\t\treturn std::move(std::string(1,c));\n\t}\n}\n<commit_msg>修复在某些编译器上的编译错误<commit_after>#pragma once\n\/*\n* Covariant Script Programming Language\n*\n* This program is free software: you can redistribute it and\/or modify\n* it under the terms of the GNU General Public License as published by\n* the Free Software Foundation, either version 3 of the License, or\n* any later version.\n*\n* This program is distributed in the hope that it will be useful,\n* but WITHOUT ANY WARRANTY; without even the implied warranty of\n* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the\n* GNU General Public License for more details.\n*\n* You should have received a copy of the GNU General Public License\n* along with this program. If not, see <http:\/\/www.gnu.org\/licenses\/>.\n*\n* Copyright (C) 2017 Michael Lee(李登淳)\n* Email: mikecovlee@163.com\n* Github: https:\/\/github.com\/mikecovlee\n* Website: http:\/\/covariant.cn\/cs\n*\n* Namespaces:\n* cs: Main Namespace\n* cs_impl: Implement Namespace\n*\/\n\/\/ Mozart\n#include \"..\/include\/mozart\/static_stack.hpp\"\n#include \"..\/include\/mozart\/random.hpp\"\n#include \"..\/include\/mozart\/timer.hpp\"\n#include \"..\/include\/mozart\/tree.hpp\"\n\/\/ LibDLL\n#include \"..\/include\/libdll\/dll.hpp\"\n\/\/ STL\n#include <unordered_map>\n#include <unordered_set>\n#include <forward_list>\n#include <functional>\n#include <algorithm>\n#include <fstream>\n#include <sstream>\n#include <iomanip>\n#include <istream>\n#include <ostream>\n#include <utility>\n#include <cctype>\n#include <string>\n#include <memory>\n#include <cmath>\n#include <deque>\n#include <list>\n#include <map>\n\/\/ CovScript Headers\n#include \".\/exceptions.hpp\"\n#include \".\/any.hpp\"\n#include \".\/typedef.hpp\"\n\nnamespace cs {\n\/\/ Version\n\tconst std::string version=\"1.0.3\";\n\/\/ Output Precision\n\tstatic int output_precision=8;\n\/\/ Callable and Function\n\tclass callable final {\n\tpublic:\n\t\tusing function_type=std::function<var(array&)>;\n\tprivate:\n\t\tfunction_type mFunc;\n\t\tbool mConstant=false;\n\tpublic:\n\t\tcallable()=delete;\n\t\tcallable(const callable&)=default;\n\t\tcallable(const function_type& func,bool constant=false):mFunc(func),mConstant(constant) {}\n\t\tbool is_constant() const\n\t\t{\n\t\t\treturn mConstant;\n\t\t}\n\t\tvar call(array& args) const\n\t\t{\n\t\t\treturn mFunc(args);\n\t\t}\n\t};\n\tclass function final {\n\t\tfriend class statement_return;\n\t\tmutable var mRetVal;\n\t\tstd::deque<std::string> mArgs;\n\t\tstd::deque<statement_base*> mBody;\n\t\tstd::shared_ptr<std::unordered_map<string,var>> mData;\n\tpublic:\n\t\tfunction()=delete;\n\t\tfunction(const std::deque<std::string>& args,const std::deque<statement_base*>& body):mArgs(args),mBody(body) {}\n\t\t~function()=default;\n\t\tvar call(array&) const;\n\t\tvoid set_data(const std::shared_ptr<std::unordered_map<string,var>>& data)\n\t\t{\n\t\t\tmData=data;\n\t\t}\n\t};\n\tclass object_method final {\n\t\tvar mObj;\n\t\tvar mCallable;\n\tpublic:\n\t\tobject_method()=delete;\n\t\tobject_method(const var& obj,const var& callable):mObj(obj),mCallable(callable) {}\n\t\t~object_method()=default;\n\t\tconst var& get_callable() const\n\t\t{\n\t\t\treturn mCallable;\n\t\t}\n\t\tvar operator()(array& args) const\n\t\t{\n\t\t\targs.push_front(mObj);\n\t\t\tvar retval=mCallable.const_val<callable>().call(args);\n\t\t\targs.pop_front();\n\t\t\treturn retval;\n\t\t}\n\t};\n\/\/ Type and struct\n\tstruct pointer final {\n\t\tvar data;\n\t\tpointer()=default;\n\t\tpointer(const var& v):data(v) {}\n\t\tbool operator==(const pointer& ptr) const\n\t\t{\n\t\t\treturn data.is_same(ptr.data);\n\t\t}\n\t};\n\tstatic const pointer null_pointer= {};\n\tstruct type final {\n\t\tstd::function<var()> constructor;\n\t\tstd::size_t id;\n\t\textension_t extensions;\n\t\ttype()=delete;\n\t\ttype(const std::function<var()>& c,std::size_t i):constructor(c),id(i) {}\n\t\ttype(const std::function<var()>& c,std::size_t i,extension_t ext):constructor(c),id(i),extensions(ext) {}\n\t\tvar& get_var(const std::string&) const;\n\t};\n\tclass structure final {\n\t\tstd::size_t m_hash;\n\t\tstd::string m_name;\n\t\tstd::shared_ptr<std::unordered_map<string,var>> m_data;\n\tpublic:\n\t\tstructure()=delete;\n\t\tstructure(std::size_t hash,const std::string& name,const std::shared_ptr<std::unordered_map<string,var>>& data):m_hash(hash),m_name(typeid(structure).name()+name),m_data(data) {}\n\t\tstructure(const structure& s):m_hash(s.m_hash),m_name(s.m_name),m_data(std::make_shared<std::unordered_map<string,var>>(*s.m_data))\n\t\t{\n\t\t\tfor(auto& it:*m_data) {\n\t\t\t\tit.second.clone();\n\t\t\t\tif(it.second.type()==typeid(function))\n\t\t\t\t\tit.second.val<function>(true).set_data(m_data);\n\t\t\t}\n\t\t}\n\t\t~structure()=default;\n\t\tstd::shared_ptr<std::unordered_map<string,var>>& get_domain()\n\t\t{\n\t\t\treturn m_data;\n\t\t}\n\t\tstd::size_t get_hash() const\n\t\t{\n\t\t\treturn m_hash;\n\t\t}\n\t\tvar& get_var(const std::string& name) const\n\t\t{\n\t\t\tif(m_data->count(name)>0)\n\t\t\t\treturn (*m_data)[name];\n\t\t\telse\n\t\t\t\tthrow syntax_error(\"Struct \\\"\"+m_name+\"\\\" have no member called \\\"\"+name+\"\\\".\");\n\t\t}\n\t};\n\tclass struct_builder final {\n\t\tstatic std::size_t mCount;\n\t\tstd::size_t mHash;\n\t\tstd::string mName;\n\t\tstd::deque<statement_base*> mMethod;\n\tpublic:\n\t\tstruct_builder()=delete;\n\t\tstruct_builder(const std::string& name,const std::deque<statement_base*>& method):mHash(++mCount),mName(name),mMethod(method) {}\n\t\tstruct_builder(const struct_builder&)=default;\n\t\t~struct_builder()=default;\n\t\tstd::size_t get_hash() const\n\t\t{\n\t\t\treturn mHash;\n\t\t}\n\t\tvar operator()();\n\t};\n\tstd::size_t struct_builder::mCount=0;\n\/\/ Internal Garbage Collection\n\ttemplate<typename T>class garbage_collector final {\n\t\tstd::forward_list<T*> table_new;\n\t\tstd::forward_list<T*> table_delete;\n\tpublic:\n\t\tgarbage_collector()=default;\n\t\tgarbage_collector(const garbage_collector&)=delete;\n\t\t~garbage_collector()\n\t\t{\n\t\t\tfor(auto& ptr:table_delete)\n\t\t\t\ttable_new.remove(ptr);\n\t\t\tfor(auto& ptr:table_new)\n\t\t\t\tdelete ptr;\n\t\t}\n\t\tvoid add(void* ptr)\n\t\t{\n\t\t\ttable_new.push_front(static_cast<T*>(ptr));\n\t\t}\n\t\tvoid remove(void* ptr)\n\t\t{\n\t\t\ttable_delete.push_front(static_cast<T*>(ptr));\n\t\t}\n\t};\n\/\/ Namespace and extensions\n\tclass name_space final {\n\t\tstd::unordered_map<string,var> m_data;\n\tpublic:\n\t\tname_space()=default;\n\t\tname_space(const name_space&)=delete;\n\t\tname_space(const std::unordered_map<string,var>& dat):m_data(dat) {}\n\t\t~name_space()=default;\n\t\tvoid add_var(const std::string& name,const var& var)\n\t\t{\n\t\t\tif(m_data.count(name)>0)\n\t\t\t\tm_data[name]=var;\n\t\t\telse\n\t\t\t\tm_data.emplace(name,var);\n\t\t}\n\t\tvar& get_var(const std::string& name)\n\t\t{\n\t\t\tif(m_data.count(name)>0)\n\t\t\t\treturn m_data[name];\n\t\t\telse\n\t\t\t\tthrow syntax_error(\"Use of undefined variable \\\"\"+name+\"\\\" in extension.\");\n\t\t}\n\t};\n\tclass name_space_holder final {\n\t\tname_space* m_ns=nullptr;\n\t\tcov::dll m_dll;\n\tpublic:\n\t\tname_space_holder()=delete;\n\t\tname_space_holder(name_space* ptr):m_ns(ptr) {}\n\t\tname_space_holder(const std::string& path):m_dll(path)\n\t\t{\n\t\t\tm_ns=reinterpret_cast<name_space*(*)()>(m_dll.get_address(\"__CS_EXTENSION__\"))();\n\t\t}\n\t\t~name_space_holder()=default;\n\t\tvar& get_var(const std::string& name)\n\t\t{\n\t\t\tif(m_ns==nullptr)\n\t\t\t\tthrow internal_error(\"Use of nullptr of extension.\");\n\t\t\treturn m_ns->get_var(name);\n\t\t}\n\t};\n\/\/ Var definition\n\tstruct define_var_profile {\n\t\tstd::string id;\n\t\tcov::tree<token_base*> expr;\n\t};\n\tvoid parse_define_var(cov::tree<token_base*>&,define_var_profile&);\n\/\/ Implement\n\tvar& type::get_var(const std::string& name) const\n\t{\n\t\tif(extensions.get()!=nullptr)\n\t\t\treturn extensions->get_var(name);\n\t\telse\n\t\t\tthrow syntax_error(\"Type does not support the extension\");\n\t}\n\/\/ literal format\n\tvar parse_value(const std::string& str)\n\t{\n\t\tif(str==\"true\")\n\t\t\treturn true;\n\t\tif(str==\"false\")\n\t\t\treturn false;\n\t\ttry {\n\t\t\treturn number(std::stold(str));\n\t\t}\n\t\tcatch(...) {\n\t\t\treturn str;\n\t\t}\n\t\treturn str;\n\t}\n\/\/ Copy\n\tvoid copy_no_return(var& val)\n\t{\n\t\tval.clone();\n\t\tval.detach();\n\t}\n\tvar copy(var val)\n\t{\n\t\tval.clone();\n\t\tval.detach();\n\t\treturn val;\n\t}\n}\nnamespace cs_impl {\n\ttemplate<>void detach<cs::pair>(cs::pair& val)\n\t{\n\t\tcs::copy_no_return(val.first);\n\t\tcs::copy_no_return(val.second);\n\t}\n\ttemplate<>void detach<cs::list>(cs::list& val)\n\t{\n\t\tfor(auto& it:val)\n\t\t\tcs::copy_no_return(it);\n\t}\n\ttemplate<>void detach<cs::array>(cs::array& val)\n\t{\n\t\tfor(auto& it:val)\n\t\t\tcs::copy_no_return(it);\n\t}\n\ttemplate<>void detach<cs::hash_map>(cs::hash_map& val)\n\t{\n\t\tfor(auto& it:val)\n\t\t\tcs::copy_no_return(it.second);\n\t}\n\ttemplate<>std::string to_string<cs::number>(const cs::number& val)\n\t{\n\t\tstd::stringstream ss;\n\t\tstd::string str;\n\t\tss<<std::setprecision(cs::output_precision)<<val;\n\t\tss>>str;\n\t\treturn std::move(str);\n\t}\n\ttemplate<>std::string to_string<char>(const char& c)\n\t{\n\t\treturn std::move(std::string(1,c));\n\t}\n}\n<|endoftext|>"} {"text":"<commit_before>\/*\n * Copyright 2014-2015 CyberVision, 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 \"ReportingManager.hpp\"\n\n#include \"ConfigurationConstants.hpp\"\n\nnamespace power_plant {\n\nReportingManager::ReportingManager(kaa::IKaaClient& kaaClient)\n : kaaClient_(kaaClient)\n , logUploadStrategy_(std::make_shared<kaa::DefaultLogUploadStrategy>(&kaaClient_.getChannelManager()))\n{\n logUploadStrategy_->setCountThreshold(POWER_PLANT_REPORTING_FREQUENCY);\n kaaClient_.setLogUploadStrategy(logUploadStrategy_);\n}\n\nvoid ReportingManager::processConfiguration(const kaa::KaaRootConfiguration& configuration)\n{\n std::lock_guard<std::mutex> configurationLock(strategyGuard_);\n logUploadStrategy_->setCountThreshold(configuration.reportingFrequency);\n}\n\nvoid ReportingManager::addReport(const kaa::KaaUserLogRecord& report)\n{\n std::lock_guard<std::mutex> configurationLock(strategyGuard_);\n kaaClient_.addLogRecord(report);\n}\n\n} \/* namespace power_plant *\/\n<commit_msg>APP-9: Fix build of power plant client.<commit_after>\/*\n * Copyright 2014-2015 CyberVision, 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 \"ReportingManager.hpp\"\n\n#include \"ConfigurationConstants.hpp\"\n\nnamespace power_plant {\n\nReportingManager::ReportingManager(kaa::IKaaClient& kaaClient)\n : kaaClient_(kaaClient)\n , logUploadStrategy_(std::make_shared<kaa::DefaultLogUploadStrategy>())\n{\n logUploadStrategy_->setCountThreshold(POWER_PLANT_REPORTING_FREQUENCY);\n logUploadStrategy_->setRetryPeriod(3);\n kaaClient_.setLogUploadStrategy(logUploadStrategy_);\n}\n\nvoid ReportingManager::processConfiguration(const kaa::KaaRootConfiguration& configuration)\n{\n std::lock_guard<std::mutex> configurationLock(strategyGuard_);\n logUploadStrategy_->setCountThreshold(configuration.reportingFrequency);\n}\n\nvoid ReportingManager::addReport(const kaa::KaaUserLogRecord& report)\n{\n std::lock_guard<std::mutex> configurationLock(strategyGuard_);\n kaaClient_.addLogRecord(report);\n}\n\n} \/* namespace power_plant *\/\n<|endoftext|>"} {"text":"<commit_before>#include \"clanghelper\/arghelper.hpp\"\n#include \"clanghelper\/declprocessor.hpp\"\n#include \"clanghelper\/doxygen_utils.hpp\"\n#include \"clanghelper\/stdhelper\/containerhelper.hpp\"\n#include <iostream>\n#include <json\/json.h>\n#include <json\/writer.h>\n\nnamespace {\nconst std::string PARAM_NAME_MAIN_ONLY = \"--main-only\";\nconst std::string PARAM_NAME_NO_FUNCS = \"--no-functions\";\nconst std::string PARAM_NAME_NO_STRUCTS = \"--no-structs\";\nconst std::string PARAM_NAME_NO_SIZES = \"--no-sizes\";\nconst std::string PARAM_NAME_HELP = \"--help\";\nconst std::string PARAM_NAME_WITH_SOURCE = \"--with-source\";\n\nconst std::vector<std::string> ALL_PARAMS = {\n PARAM_NAME_MAIN_ONLY, PARAM_NAME_NO_FUNCS, PARAM_NAME_NO_STRUCTS,\n PARAM_NAME_NO_SIZES, PARAM_NAME_HELP, PARAM_NAME_WITH_SOURCE};\n\ntemplate <typename T>\ninline Json::Value to_json(const std::vector<T>& v);\ninline Json::Value to_json(uint64_t v) { return v; }\n\ntemplate <typename T>\ninline Json::Value to_json(const std::vector<T>& v)\n{\n Json::Value ret(Json::arrayValue);\n for (const auto& e : v)\n ret.append(to_json(e));\n return ret;\n}\n\n} \/\/ namespace\n\nstruct DeclCollector {\n DeclCollector(int argc, const char** argv)\n : args(argc, argv, ALL_PARAMS), functions(Json::arrayValue),\n structs(Json::arrayValue)\n {\n }\n\n void operator()(const clang::Decl* decl)\n {\n using namespace vvv::helpers;\n const auto& flags = args.getCustomFlags();\n const auto& main_only = contain(flags, PARAM_NAME_MAIN_ONLY);\n const auto& need_functions = !contain(flags, PARAM_NAME_NO_FUNCS);\n const auto& need_structs = !contain(flags, PARAM_NAME_NO_STRUCTS);\n\n if (isSystemDecl(decl))\n return;\n if (main_only && !isInMainFile(decl))\n return;\n\n if (need_functions && isNonTemplateFunction(decl)) {\n const auto* func = decl->getAsFunction();\n addFunction(func);\n return;\n }\n if (need_structs && isRecord(decl)) {\n addRecord(static_cast<const clang::RecordDecl*>(decl));\n return;\n }\n }\n\n Json::Value MakeFunctionParams(const clang::FunctionDecl* func,\n const FunctionComments& docs)\n {\n auto ret = Json::Value(Json::arrayValue);\n for (const auto& param : getFunctionParams(func)) {\n const auto& name = getDeclName(param);\n Json::Value param_node;\n param_node[\"name\"] = name;\n param_node[\"type\"] = param->getType().getAsString();\n param_node[\"comment\"] = docs.getParam(name);\n ret.append(std::move(param_node));\n }\n return ret;\n }\n\n Json::Value to_json(const clang::FunctionDecl* func)\n {\n using namespace vvv::helpers;\n const auto& flags = args.getCustomFlags();\n const auto& with_source = contain(flags, PARAM_NAME_WITH_SOURCE);\n\n const auto& name = getDeclName(func);\n const auto& docs = getDoxyComments(func);\n Json::Value ret;\n ret[\"name\"] = name;\n ret[\"comment\"] = docs.brief;\n ret[\"rettype\"] = func->getReturnType().getAsString();\n ret[\"retcomment\"] = docs.getReturn();\n\n ret[\"params\"] = MakeFunctionParams(func, docs);\n ret[\"location\"] = getLocation(func);\n\n if (with_source)\n ret[\"source\"] = decl2str(func);\n return ret;\n }\n\n void addFunction(const clang::FunctionDecl* func)\n {\n functions.append(to_json(func));\n }\n\n void addArrayInfo(Json::Value& out, const clang::FieldDecl* decl)\n {\n using namespace clang;\n auto t = decl->getType();\n if (!t->isConstantArrayType())\n return;\n\n std::vector<uint64_t> arraySizeByDimensions;\n\n while (t->isConstantArrayType()) {\n const auto ca = (ConstantArrayType*)t->getAsArrayTypeUnsafe();\n const auto elemCount = *ca->getSize().getRawData();\n arraySizeByDimensions.push_back(elemCount);\n t = ca->getElementType();\n }\n\n const auto& elementTypeName = t.getAsString();\n\n Json::Value arraySize = ::to_json(arraySizeByDimensions);\n Json::Value array;\n array[\"elem_type\"] = elementTypeName;\n array[\"size\"] = std::move(arraySize);\n\n out[\"array\"] = std::move(array);\n }\n\n void addBitfieldInfo(Json::Value& out, const clang::FieldDecl* decl)\n {\n if (!decl->isBitField())\n return;\n\n const auto& astctx = decl->getASTContext();\n const auto bitfieldWidth = decl->getBitWidthValue(astctx);\n out[\"bitfieldWidth\"] = bitfieldWidth;\n }\n\n void addBasicSizeInfo(Json::Value& out, const clang::FieldDecl* decl)\n {\n auto type = decl->getType();\n if (!type->isBuiltinType())\n return;\n\n const auto& astctx = decl->getASTContext();\n out[\"builtin\"] = astctx.getTypeSize(type);\n }\n\n Json::Value makeFields(const clang::RecordDecl* decl, bool with_sizes)\n {\n Json::Value ret(Json::arrayValue);\n for (const auto& f : getStructFields(decl)) {\n Json::Value field;\n field[\"name\"] = getDeclName(f);\n field[\"type\"] = f->getType().getAsString();\n field[\"comment\"] = getComment(f);\n addArrayInfo(field, f);\n addBitfieldInfo(field, f);\n if (with_sizes)\n addBasicSizeInfo(field, f);\n ret.append(std::move(field));\n }\n return ret;\n }\n\n Json::Value to_json(const clang::RecordDecl* decl)\n {\n using namespace vvv::helpers;\n const auto& flags = args.getCustomFlags();\n const auto& with_source = contain(flags, PARAM_NAME_WITH_SOURCE);\n const auto& with_sizes = !contain(flags, PARAM_NAME_NO_SIZES);\n\n Json::Value ret;\n ret[\"name\"] = getDeclName(decl);\n ret[\"comment\"] = getComment(decl);\n ret[\"location\"] = getLocation(decl);\n ret[\"fields\"] = makeFields(decl, with_sizes);\n if (with_source)\n ret[\"source\"] = decl2str(decl);\n return ret;\n }\n\n void addRecord(const clang::RecordDecl* decl)\n {\n structs.append(to_json(decl));\n }\n\n CxxToolArgs args;\n Json::Value functions;\n Json::Value structs;\n};\n\nvoid printHelpIfNeeded(const std::vector<std::string>& params)\n{\n using namespace vvv::helpers;\n static const char* message =\n \"cstructinfo usage:\\n\"\n \"cstructinfo [options] <input files ...> [clang compiler options]\\n\"\n \"Options:\\n\"\n \"--main-only - do not process any included files. Process only \"\n \"specified\\n\"\n \"--no-functions - exclude functions descriptions from output\\n\"\n \"--no-structs - exclude structs descriptions from output\\n\"\n \"--no-sizes - do not add sizeofs of primitive types to structs \"\n \"descriptions\\n\"\n \"--with-source - add source field containing 'source'\"\n \" of struct\/function\\n\"\n \"--help - show this help\\n\";\n if (params.empty() || contain(params, PARAM_NAME_HELP)) {\n std::cout << message << std::endl;\n exit(EXIT_SUCCESS);\n }\n return;\n}\n\nint main(int argc, const char** argv)\n{\n printHelpIfNeeded(argstoarray(argc, argv));\n\n auto d = DeclCollector(argc, argv);\n visit_decls(argc, argv, [&d](const clang::Decl* decl) { d(decl); },\n ALL_PARAMS);\n\n Json::Value result;\n result[\"functions\"] = std::move(d.functions);\n result[\"structs\"] = std::move(d.structs);\n\n Json::StreamWriterBuilder().newStreamWriter()->write(result, &std::cout);\n std::cout << std::endl;\n return 0;\n}\n<commit_msg>Refactor params<commit_after>#include \"clanghelper\/arghelper.hpp\"\n#include \"clanghelper\/declprocessor.hpp\"\n#include \"clanghelper\/doxygen_utils.hpp\"\n#include \"clanghelper\/stdhelper\/containerhelper.hpp\"\n#include <iostream>\n#include <json\/json.h>\n#include <json\/writer.h>\n\nnamespace {\nconst std::string PARAM_NAME_MAIN_ONLY = \"--main-only\";\nconst std::string PARAM_NAME_NO_FUNCS = \"--no-functions\";\nconst std::string PARAM_NAME_NO_STRUCTS = \"--no-structs\";\nconst std::string PARAM_NAME_NO_SIZES = \"--no-sizes\";\nconst std::string PARAM_NAME_HELP = \"--help\";\nconst std::string PARAM_NAME_WITH_SOURCE = \"--with-source\";\n\nconst std::vector<std::string> ALL_PARAMS = {\n PARAM_NAME_MAIN_ONLY, PARAM_NAME_NO_FUNCS, PARAM_NAME_NO_STRUCTS,\n PARAM_NAME_NO_SIZES, PARAM_NAME_HELP, PARAM_NAME_WITH_SOURCE};\n\ntemplate <typename T>\ninline Json::Value to_json(const std::vector<T>& v);\ninline Json::Value to_json(uint64_t v) { return v; }\n\ntemplate <typename T>\ninline Json::Value to_json(const std::vector<T>& v)\n{\n Json::Value ret(Json::arrayValue);\n for (const auto& e : v)\n ret.append(to_json(e));\n return ret;\n}\n\n} \/\/ namespace\n\nusing vvv::helpers::contain;\n\nstruct DeclCollector {\n DeclCollector(int argc, const char** argv)\n : args(argc, argv, ALL_PARAMS), functions(Json::arrayValue),\n structs(Json::arrayValue),\n main_only(contain(args.getCustomFlags(), PARAM_NAME_MAIN_ONLY)),\n with_funcs(!contain(args.getCustomFlags(), PARAM_NAME_NO_FUNCS)),\n with_structs(!contain(args.getCustomFlags(), PARAM_NAME_NO_STRUCTS)),\n with_sizes(!contain(args.getCustomFlags(), PARAM_NAME_NO_SIZES)),\n with_source(contain(args.getCustomFlags(), PARAM_NAME_WITH_SOURCE))\n {\n }\n\n void operator()(const clang::Decl* decl)\n {\n using namespace vvv::helpers;\n\n if (isSystemDecl(decl))\n return;\n if (main_only && !isInMainFile(decl))\n return;\n\n if (with_funcs && isNonTemplateFunction(decl)) {\n const auto* func = decl->getAsFunction();\n addFunction(func);\n return;\n }\n if (with_structs && isRecord(decl)) {\n addRecord(static_cast<const clang::RecordDecl*>(decl));\n return;\n }\n }\n\n Json::Value MakeFunctionParams(const clang::FunctionDecl* func,\n const FunctionComments& docs)\n {\n auto ret = Json::Value(Json::arrayValue);\n for (const auto& param : getFunctionParams(func)) {\n const auto& name = getDeclName(param);\n Json::Value param_node;\n param_node[\"name\"] = name;\n param_node[\"type\"] = param->getType().getAsString();\n param_node[\"comment\"] = docs.getParam(name);\n ret.append(std::move(param_node));\n }\n return ret;\n }\n\n Json::Value to_json(const clang::FunctionDecl* func)\n {\n const auto& name = getDeclName(func);\n const auto& docs = getDoxyComments(func);\n Json::Value ret;\n ret[\"name\"] = name;\n ret[\"comment\"] = docs.brief;\n ret[\"rettype\"] = func->getReturnType().getAsString();\n ret[\"retcomment\"] = docs.getReturn();\n\n ret[\"params\"] = MakeFunctionParams(func, docs);\n ret[\"location\"] = getLocation(func);\n\n if (with_source)\n ret[\"source\"] = decl2str(func);\n return ret;\n }\n\n void addFunction(const clang::FunctionDecl* func)\n {\n functions.append(to_json(func));\n }\n\n void addArrayInfo(Json::Value& out, const clang::FieldDecl* decl)\n {\n using namespace clang;\n auto t = decl->getType();\n if (!t->isConstantArrayType())\n return;\n\n std::vector<uint64_t> arraySizeByDimensions;\n\n while (t->isConstantArrayType()) {\n const auto ca = (ConstantArrayType*)t->getAsArrayTypeUnsafe();\n const auto elemCount = *ca->getSize().getRawData();\n arraySizeByDimensions.push_back(elemCount);\n t = ca->getElementType();\n }\n\n const auto& elementTypeName = t.getAsString();\n\n Json::Value arraySize = ::to_json(arraySizeByDimensions);\n Json::Value array;\n array[\"elem_type\"] = elementTypeName;\n array[\"size\"] = std::move(arraySize);\n\n out[\"array\"] = std::move(array);\n }\n\n void addBitfieldInfo(Json::Value& out, const clang::FieldDecl* decl)\n {\n if (!decl->isBitField())\n return;\n\n const auto& astctx = decl->getASTContext();\n const auto bitfieldWidth = decl->getBitWidthValue(astctx);\n out[\"bitfieldWidth\"] = bitfieldWidth;\n }\n\n void addBasicSizeInfo(Json::Value& out, const clang::FieldDecl* decl)\n {\n auto type = decl->getType();\n if (!type->isBuiltinType())\n return;\n\n const auto& astctx = decl->getASTContext();\n out[\"builtin\"] = astctx.getTypeSize(type);\n }\n\n Json::Value makeFields(const clang::RecordDecl* decl, bool with_sizes)\n {\n Json::Value ret(Json::arrayValue);\n for (const auto& f : getStructFields(decl)) {\n Json::Value field;\n field[\"name\"] = getDeclName(f);\n field[\"type\"] = f->getType().getAsString();\n field[\"comment\"] = getComment(f);\n addArrayInfo(field, f);\n addBitfieldInfo(field, f);\n if (with_sizes)\n addBasicSizeInfo(field, f);\n ret.append(std::move(field));\n }\n return ret;\n }\n\n Json::Value to_json(const clang::RecordDecl* decl)\n {\n Json::Value ret;\n ret[\"name\"] = getDeclName(decl);\n ret[\"comment\"] = getComment(decl);\n ret[\"location\"] = getLocation(decl);\n ret[\"fields\"] = makeFields(decl, with_sizes);\n if (with_source)\n ret[\"source\"] = decl2str(decl);\n return ret;\n }\n\n void addRecord(const clang::RecordDecl* decl)\n {\n structs.append(to_json(decl));\n }\n\n CxxToolArgs args;\n Json::Value functions;\n Json::Value structs;\n\n bool main_only = false;\n bool with_funcs = true;\n bool with_structs = true;\n bool with_sizes = true;\n bool with_source = false;\n};\n\nvoid printHelpIfNeeded(const std::vector<std::string>& params)\n{\n using namespace vvv::helpers;\n static const char* message =\n \"cstructinfo usage:\\n\"\n \"cstructinfo [options] <input files ...> [clang compiler options]\\n\"\n \"Options:\\n\"\n \"--main-only - do not process any included files. Process only \"\n \"specified\\n\"\n \"--no-functions - exclude functions descriptions from output\\n\"\n \"--no-structs - exclude structs descriptions from output\\n\"\n \"--no-sizes - do not add sizeofs of primitive types to structs \"\n \"descriptions\\n\"\n \"--with-source - add source field containing 'source'\"\n \" of struct\/function\\n\"\n \"--help - show this help\\n\";\n if (params.empty() || contain(params, PARAM_NAME_HELP)) {\n std::cout << message << std::endl;\n exit(EXIT_SUCCESS);\n }\n return;\n}\n\nint main(int argc, const char** argv)\n{\n printHelpIfNeeded(argstoarray(argc, argv));\n\n auto d = DeclCollector(argc, argv);\n visit_decls(argc, argv, [&d](const clang::Decl* decl) { d(decl); },\n ALL_PARAMS);\n\n Json::Value result;\n result[\"functions\"] = std::move(d.functions);\n result[\"structs\"] = std::move(d.structs);\n\n Json::StreamWriterBuilder().newStreamWriter()->write(result, &std::cout);\n std::cout << std::endl;\n return 0;\n}\n<|endoftext|>"} {"text":"<commit_before>\/* bzflag\n * Copyright (c) 1993-2012 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\/\/ PluginUtils.h - Collection of useful utility functions for plugins\n\n#include <iostream>\n#include <fstream>\n#include \"bzfsAPI.h\"\n#include \"plugin_config.h\"\n#include \"plugin_utils.h\"\n\n\/*\n * INI style configuration file parser class\n *\n * Comments start with # or ;\n * Ignores whitespace around sections, keys, and values\n * Default section if none is specified is [global]\n *\/\n\nPluginConfig::PluginConfig(const std::string &filename)\n{\n configFilename = filename;\n whitespace = \" \\t\\r\";\n errors = 0;\n\n parse();\n}\n\nstd::string PluginConfig::item(const std::string §ion, const std::string &key)\n{\n std::string s = section,k = key;\n makelower(s);\n makelower(k);\n\n return sections[s][k];\n}\n\nvoid PluginConfig::parse(void)\n{\n std::string line;\n std::string section;\n std::string key;\n std::string value;\n std::ifstream iniFile;\n size_t start, end;\n size_t equalPos;\n\n \/*\n * Parse key,value pairs for sections out of the INI type\n * configuration file specified in 'filename'\n *\n *\/\n iniFile.open(configFilename.c_str(), std::ios::in);\n\n if (!iniFile.is_open()) {\n bz_debugMessagef(1, \"PluginConfig: Can't open configuration file: %s\", configFilename.c_str());\n errors++;\n return;\n }\n\n section = \"global\";\n\n while (!iniFile.eof()) {\n getline(iniFile, line);\n start = line.find_first_not_of(whitespace);\n\n \/*\n * Look for comments and skip\n *\/\n if (line[start] == '#') {\n continue;\n }\n\n \/*\n * Look for a section tag\n *\/\n if (line[start] == '[') {\n start = line.find_first_not_of(whitespace, start + 1);\n\n \/* Check if the last non whitespace character is a close bracket *\/\n end = line.find_last_not_of(whitespace);\n if (line[end] == ']') {\n\tend = line.find_last_not_of(whitespace, end - 1);\n\t\/* Got a section header - save it *\/\n\tsection = line.substr(start, end - start + 1);\n\tbz_debugMessagef(4, \"PluginConfig: Found section [%s]\", section.c_str());\n\tcontinue;\n }\n \/*\n * We either got a valid section or we have a\n * Malformed line - '[' but not matching close ']' which we ignore.\n *\/\n bz_debugMessagef(1, \"PluginConfig: Malformed line ignored: %s\", line.c_str());\n continue;\n }\n\n \/*\n * No section tag, look for 'key = value' pairs\n *\n * Split the line into 'key = value' pairs\n *\/\n equalPos = line.find(\"=\", start);\n\n \/* If there is no '=' sign then ignore the line - treated as a comment *\/\n if (equalPos == std::string::npos) {\n if (line.find_first_not_of(whitespace) != std::string::npos)\n\tbz_debugMessagef(1, \"PluginConfig: Malformed line ignored: %s\", line.c_str());\n continue;\n }\n\n \/* Extract the key *\/\n end = line.find_last_not_of(whitespace, equalPos - 1);\n key = line.substr(start, end - start + 1);\n\n \/* Extract the value *\/\n start = line.find_first_not_of(whitespace, equalPos + 1);\n end = line.find_last_not_of(whitespace);\n if (start == std::string::npos || end == std::string::npos)\n value = \"\";\n else\n value = line.substr(start, end - start + 1);\n\n makelower(key);\n makelower(section);\n\n \/* Save the section, key and value in the std::map for later retrieval *\/\n sections[section][key] = value;\n bz_debugMessagef(4, \"PluginConfig: Found key [%s].%s = %s\", section.c_str(), key.c_str(), value.c_str());\n }\n\n iniFile.close();\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>init the start, end and pos sizes so that things actually read correctly<commit_after>\/* bzflag\n * Copyright (c) 1993-2012 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\/\/ PluginUtils.h - Collection of useful utility functions for plugins\n\n#include <iostream>\n#include <fstream>\n#include \"bzfsAPI.h\"\n#include \"plugin_config.h\"\n#include \"plugin_utils.h\"\n\n\/*\n * INI style configuration file parser class\n *\n * Comments start with # or ;\n * Ignores whitespace around sections, keys, and values\n * Default section if none is specified is [global]\n *\/\n\nPluginConfig::PluginConfig(const std::string &filename)\n{\n configFilename = filename;\n whitespace = \" \\t\\r\";\n errors = 0;\n\n parse();\n}\n\nstd::string PluginConfig::item(const std::string §ion, const std::string &key)\n{\n std::string s = section,k = key;\n makelower(s);\n makelower(k);\n\n return sections[s][k];\n}\n\nvoid PluginConfig::parse(void)\n{\n std::string line;\n std::string section;\n std::string key;\n std::string value;\n std::ifstream iniFile;\n size_t start = 0, end = 0;\n size_t equalPos = 0;\n\n \/*\n * Parse key,value pairs for sections out of the INI type\n * configuration file specified in 'filename'\n *\n *\/\n iniFile.open(configFilename.c_str(), std::ios::in);\n\n if (!iniFile.is_open()) {\n bz_debugMessagef(1, \"PluginConfig: Can't open configuration file: %s\", configFilename.c_str());\n errors++;\n return;\n }\n\n section = \"global\";\n\n while (!iniFile.eof()) {\n getline(iniFile, line);\n start = line.find_first_not_of(whitespace);\n\n \/*\n * Look for comments and skip\n *\/\n if (line[start] == '#') {\n continue;\n }\n\n \/*\n * Look for a section tag\n *\/\n if (line[start] == '[') {\n start = line.find_first_not_of(whitespace, start + 1);\n\n \/* Check if the last non whitespace character is a close bracket *\/\n end = line.find_last_not_of(whitespace);\n if (line[end] == ']') {\n\tend = line.find_last_not_of(whitespace, end - 1);\n\t\/* Got a section header - save it *\/\n\tsection = line.substr(start, end - start + 1);\n\tbz_debugMessagef(4, \"PluginConfig: Found section [%s]\", section.c_str());\n\tcontinue;\n }\n \/*\n * We either got a valid section or we have a\n * Malformed line - '[' but not matching close ']' which we ignore.\n *\/\n bz_debugMessagef(1, \"PluginConfig: Malformed line ignored: %s\", line.c_str());\n continue;\n }\n\n \/*\n * No section tag, look for 'key = value' pairs\n *\n * Split the line into 'key = value' pairs\n *\/\n equalPos = line.find(\"=\", start);\n\n \/* If there is no '=' sign then ignore the line - treated as a comment *\/\n if (equalPos == std::string::npos) {\n if (line.find_first_not_of(whitespace) != std::string::npos)\n\tbz_debugMessagef(1, \"PluginConfig: Malformed line ignored: %s\", line.c_str());\n continue;\n }\n\n \/* Extract the key *\/\n end = line.find_last_not_of(whitespace, equalPos - 1);\n key = line.substr(start, end - start + 1);\n\n \/* Extract the value *\/\n start = line.find_first_not_of(whitespace, equalPos + 1);\n end = line.find_last_not_of(whitespace);\n if (start == std::string::npos || end == std::string::npos)\n value = \"\";\n else\n value = line.substr(start, end - start + 1);\n\n makelower(key);\n makelower(section);\n\n \/* Save the section, key and value in the std::map for later retrieval *\/\n sections[section][key] = value;\n bz_debugMessagef(4, \"PluginConfig: Found key [%s].%s = %s\", section.c_str(), key.c_str(), value.c_str());\n }\n\n iniFile.close();\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\/\/ Created by martin on 02\/04\/19.\n\/\/\n\n#include <iostream>\n#include <string>\n#include <typeinfo>\n#include <gtest\/gtest.h>\n#include <ros\/package.h>\n#include \"ros\/ros.h\"\n#include \"std_msgs\/String.h\"\n\n#include \"rosplan_knowledge_base\/KnowledgeBase.h\"\n#include \"rosplan_knowledge_msgs\/GetDomainNameService.h\"\n#include \"rosplan_knowledge_msgs\/GetAttributeService.h\"\n#include \"rosplan_knowledge_msgs\/KnowledgeItem.h\"\n#include \"rosplan_knowledge_msgs\/GetDomainOperatorService.h\"\n#include \"rosplan_knowledge_msgs\/DomainFormula.h\"\n\n\n\/\/KnowledgeBase *knowledge_base_tester;\n\nGTEST_TEST(KnowledgeBaseTests, Test1_domain_name) {\n\n ros::NodeHandle n(\"~\");\n\n ros::ServiceClient client1 = n.serviceClient<rosplan_knowledge_msgs::GetDomainNameService>(\"\/rosplan_knowledge_base\/domain\/name\");\n rosplan_knowledge_msgs::GetDomainNameService srv;\n\n client1.call(srv);\n\n ASSERT_EQ(\"driverlog-simple\", srv.response.domain_name);\n\n}\n\nGTEST_TEST(KnowledgeBaseTests, Test2_domain_functions) {\n\n ros::NodeHandle n(\"~\");\n\n ros::ServiceClient client1 = n.serviceClient<rosplan_knowledge_msgs::GetAttributeService>(\"\/rosplan_knowledge_base\/domain\/functions\");\n rosplan_knowledge_msgs::GetAttributeService srv;\n\n client1.call(srv);\n\n \/\/rosplan_knowledge_msgs::KnowledgeItem response = srv.response.attributes;\n\n std::cout << typeid(srv.response.attributes).name() << std::endl;\n\n\n ASSERT_EQ(1 , 0);\n \/\/ASSERT_EQ(\"[]\", srv.response.attributes);\n\n}\n\n\/*\nGTEST_TEST(KnowledgeBaseTests, Test3_domain_operators) {\n\n \/*\n ros::NodeHandle n(\"~\");\n\n ros::ServiceClient client1 = n.serviceClient<rosplan_knowledge_msgs::GetDomainOperatorService>(\"\/rosplan_knowledge_base\/domain\/operators\");\n rosplan_knowledge_msgs::GetDomainOperatorService srv;\n\n client1.call(srv);\n\n std::vector<std::string> expected_operator_names = srv.response.operators;\n\n\n\n std::vector<std::string> operator_names;\n knowledge_base_tester->getOperatorNames(operator_names);\n\n std::vector<std::string> expected_operator_names = {\"goto_waypoint\", \"localise\", \"dock\", \"undock\", \\\n \"wait_load_at_machine\", \"switch_machine_on\", \"wait_unload\", \"ditch\"};\n\n\n\n\n ASSERT_EQ(operator_names , expected_operator_names);\n\n\n}\n*\/\n\nint main(int argc, char **argv) {\n\n ::testing::InitGoogleTest(&argc, argv);\n ros::init(argc, argv, \"KnowledgeBaseTests\");\n\n \/\/ knowledge_base_tester = new KnowledgeBase();\n\n return RUN_ALL_TESTS();\n}\n<commit_msg>Completed tests for all domain services<commit_after>\/\/\n\/\/ Created by martin on 02\/04\/19.\n\/\/\n\n#include <iostream>\n#include <string>\n#include <vector>\n#include <typeinfo>\n#include <gtest\/gtest.h>\n#include <ros\/package.h>\n#include \"ros\/ros.h\"\n#include \"std_msgs\/String.h\"\n\n#include \"rosplan_knowledge_base\/KnowledgeBase.h\"\n#include \"rosplan_knowledge_msgs\/GetDomainNameService.h\"\n#include \"rosplan_knowledge_msgs\/GetDomainAttributeService.h\"\n#include \"rosplan_knowledge_msgs\/KnowledgeItem.h\"\n#include \"rosplan_knowledge_msgs\/GetDomainOperatorService.h\"\n#include \"rosplan_knowledge_msgs\/GetDomainOperatorDetailsService.h\"\n#include \"rosplan_knowledge_msgs\/GetDomainPredicateDetailsService.h\"\n#include \"rosplan_knowledge_msgs\/GetDomainTypeService.h\"\n#include \"rosplan_knowledge_msgs\/DomainFormula.h\"\n\n\nGTEST_TEST(KnowledgeBaseTests, Test1_domain_name) {\n\n ros::NodeHandle n(\"~\");\n\n ros::ServiceClient client1 = n.serviceClient<rosplan_knowledge_msgs::GetDomainNameService>(\"\/rosplan_knowledge_base\/domain\/name\");\n rosplan_knowledge_msgs::GetDomainNameService srv;\n\n client1.call(srv);\n\n ASSERT_EQ(\"driverlog-simple\", srv.response.domain_name);\n\n}\n\n\n\nGTEST_TEST(KnowledgeBaseTests, Test2_domain_functions) {\n\n ros::NodeHandle n(\"~\");\n\n ros::ServiceClient client1 = n.serviceClient<rosplan_knowledge_msgs::GetDomainAttributeService>(\"\/rosplan_knowledge_base\/domain\/functions\");\n rosplan_knowledge_msgs::GetDomainAttributeService srv;\n\n client1.call(srv);\n\n \/\/ Amazon-domain does not contain any functions\n\n ASSERT_EQ(0, srv.response.items.size());\n\n}\n\nGTEST_TEST(KnowledgeBaseTests, Test3_domain_predicates) {\n\n ros::NodeHandle n(\"~\");\n\n ros::ServiceClient client1 = n.serviceClient<rosplan_knowledge_msgs::GetDomainAttributeService>(\"\/rosplan_knowledge_base\/domain\/predicates\");\n rosplan_knowledge_msgs::GetDomainAttributeService srv;\n\n std::vector<std::string> expected_predicate_names = {\"at\", \"in\", \"link\", \"path\"};\n\n client1.call(srv);\n\n std::vector<std::string> actual_predicate_names;\n\n for (auto rit=srv.response.items.begin(); rit!=srv.response.items.end(); rit++) {\n actual_predicate_names.push_back(rit->name);\n }\n\n ASSERT_EQ(expected_predicate_names, actual_predicate_names);\n\n}\n\n\nGTEST_TEST(KnowledgeBaseTests, Test4_domain_operators) {\n\n\n ros::NodeHandle n(\"~\");\n\n ros::ServiceClient client1 = n.serviceClient<rosplan_knowledge_msgs::GetDomainOperatorService>(\"\/rosplan_knowledge_base\/domain\/operators\");\n rosplan_knowledge_msgs::GetDomainOperatorService srv;\n\n std::vector<std::string> expected_operator_names = {\"load-truck\", \"unload-truck\", \"board-truck\", \"get-out\", \"drive-truck\", \"walk\"};\n\n client1.call(srv);\n\n std::vector<std::string> actual_operator_names;\n\n for (auto rit=srv.response.operators.begin(); rit!=srv.response.operators.end(); rit++) {\n actual_operator_names.push_back(rit->name);\n }\n\n ASSERT_EQ(expected_operator_names, actual_operator_names);\n\n}\n\nGTEST_TEST(KnowledgeBaseTests, Test5_domain_types){\n\n ros::NodeHandle n(\"~\");\n\n ros::ServiceClient client1 = n.serviceClient<rosplan_knowledge_msgs::GetDomainTypeService>(\"\/rosplan_knowledge_base\/domain\/types\");\n rosplan_knowledge_msgs::GetDomainTypeService srv;\n\n std::vector<std::string> expected_type_names = {\"place\", \"locatable\", \"driver\", \"truck\", \"item\"};\n std::vector<std::string> expected_super_type_names = {\"object\", \"object\", \"locatable\", \"locatable\", \"locatable\"};\n\n client1.call(srv);\n\n std::vector<std::string> actual_type_names = srv.response.types;\n std::vector<std::string> actual_super_type_names = srv.response.super_types;\n\n ASSERT_EQ(expected_type_names, actual_type_names);\n ASSERT_EQ(expected_super_type_names, actual_super_type_names);\n\n}\n\nGTEST_TEST(KnowledgeBaseTests, Test6_domain_operator_details_load_truck) {\n\n ros::NodeHandle n(\"~\");\n\n ros::ServiceClient client1 = n.serviceClient<rosplan_knowledge_msgs::GetDomainOperatorDetailsService>(\"\/rosplan_knowledge_base\/domain\/operator_details\");\n rosplan_knowledge_msgs::GetDomainOperatorDetailsService srv;\n\n srv.request.name = \"load-truck\";\n\n client1.call(srv);\n\n std::string detailed_operator_name = srv.response.op.formula.name;\n\n ASSERT_EQ(srv.request.name, detailed_operator_name);\n\n}\n\nGTEST_TEST(KnowledgeBaseTests, Test7_domain_predicate_details_path) {\n\n ros::NodeHandle n(\"~\");\n\n ros::ServiceClient client1 = n.serviceClient<rosplan_knowledge_msgs::GetDomainPredicateDetailsService>(\"\/rosplan_knowledge_base\/domain\/predicate_details\");\n rosplan_knowledge_msgs::GetDomainPredicateDetailsService srv;\n\n srv.request.name = \"path\";\n\n client1.call(srv);\n\n std::string detailed_predicate_name = srv.response.predicate.name;\n\n ASSERT_EQ(srv.request.name, detailed_predicate_name);\n\n}\n\n\/\/ for report: test more thoroughly functions, predicates, operators. Deeper testing with operator_details and predicate_deatails. Update picture, missing service: predicate_details.\n\nint main(int argc, char **argv) {\n\n ::testing::InitGoogleTest(&argc, argv);\n ros::init(argc, argv, \"KnowledgeBaseTests\");\n\n\n return RUN_ALL_TESTS();\n}\n<|endoftext|>"} {"text":"<commit_before>#include \"AutonomousGroup2.h\"\n\nAutonomousGroup2::AutonomousGroup2()\n{\n\t\/\/Goal: Pick up both bins on step with moose, drive back while setting them down\n\t\/\/Antlers move up, and fit in the auton zone somehow, either by turning or activating arms.\n\tm_cAntlerMoose1 = new AutonAntlerMoose();\n\tm_cMooseLifter1 = new AutonMooseLifter();\n\tm_cMooseLifter2 = new AutonMooseLifter();\n\tm_cAutonDrive1 = new AutonDriveStraight();\n\tm_cAutonDrive2 = new AutonDriveStraight();\n\tm_cAutonDrive3 = new AutonDriveStraight();\n\tm_cAutonDumb1 = new AutonDumbDrive();\n\tm_cAutonTurner = new AutonTurn();\n\tm_cAutonIntakeArms = new AutonIntakeArms();\n\t\n\tAddSequential(m_cAutonDrive1);\t\t\/\/Drive backwards\n\tAddSequential(m_cAutonDumb1);\t\t\/\/Creep backwards slowly to ensure level with step\n\tAddSequential(m_cMooseLifter1);\t\t\/\/Lift up both middle bins with moose\n\tAddParallel(m_cMooseLifter2);\t\t\/\/While the moose is lowering, setting the bins down\n\tAddSequential(m_cAutonDrive2);\t\t\/\/Drive forwards to the auton zone\n\tAddSequential(m_cAntlerMoose1);\t\t\/\/Retract antlers up\n\tAddSequential(m_cAutonDrive3);\t\t\/\/Drive back a bit into the auton zone\n\tAddSequential(m_cAutonIntakeArms);\t\/\/Extend intake arms to fit in auton zone\n\t\/\/AddSequential(m_cAutonTurner);\t\/\/Turn to fit in auton zone\n}\n\nAutonomousGroup2::~AutonomousGroup2()\n{\n\tdelete m_cAutonDrive1;\n\tdelete m_cAutonDrive2;\n\tdelete m_cAutonDrive3;\n\tdelete m_cAutonDumb1;\n\tdelete m_cAntlerMoose1;\n\tdelete m_cMooseLifter1;\n\tdelete m_cMooseLifter2;\n\tdelete m_cAutonIntakeArms;\n\tdelete m_cAutonTurner;\n}\n\n\/\/ Called just before this Command runs the first time\nvoid AutonomousGroup2::Initialize()\n{\n\t\/\/ Will change values once robot speed and positioning is known.\n\t\t\/\/Drive\n\tm_cAutonDrive1->SetGoal(\n\t\t\tPreferences::GetInstance()->GetDouble(\"Auto-Distance-Step\",-53),\n\t\t\tPreferences::GetInstance()->GetDouble(\"Auto-Tolerance-Step\",1.5),\n\t\t\tPreferences::GetInstance()->GetDouble(\"Auto-Speed-Step\",0.90),\n\t\t\tPreferences::GetInstance()->GetDouble(\"Auto-Timeout-Step\",3) );\n\tm_cAutonDrive2->SetGoal(\n\t\t\tPreferences::GetInstance()->GetDouble(\"Auto-Distance-Zone\",164),\n\t\t\tPreferences::GetInstance()->GetDouble(\"Auto-Tolerance-Zone\",1.5),\n\t\t\tPreferences::GetInstance()->GetDouble(\"Auto-Speed-Zone\",0.65),\n\t\t\tPreferences::GetInstance()->GetDouble(\"Auto-Timeout-Zone\",7) );\n\tm_cAutonDrive3->SetGoal(\n\t\t\tPreferences::GetInstance()->GetDouble(\"Auto-Distance-Self\",-40),\n\t\t\tPreferences::GetInstance()->GetDouble(\"Auto-Tolerance-Self\",1.5),\n\t\t\tPreferences::GetInstance()->GetDouble(\"Auto-Speed-Self\",0.75),\n\t\t\tPreferences::GetInstance()->GetDouble(\"Auto-Timeout-Self\",4) );\n\n\t\t\/\/Dumb Drive\n\tm_cAutonDumb1->SetGoal(\n\t\t\tPreferences::GetInstance()->GetDouble(\"Auto-Dumb-Speed\", 0.55),\n\t\t\tPreferences::GetInstance()->GetDouble(\"Auto-Dumb-Time\", 0.2));\n\n\t\t\/\/Moose Lifter\n\tm_cMooseLifter1->SetGoal(0,\n\t\t\tPreferences::GetInstance()->GetDouble(\"Auto-MooseUp-Time\", 1.0),\n\t\t\ttrue);\n\tm_cMooseLifter2->SetGoal(\n\t\t\tPreferences::GetInstance()->GetDouble(\"Auto-MooseDrop\",140),\n\t\t\tPreferences::GetInstance()->GetDouble(\"Auto-MooseDown-Time\", 2.0),\n\t\t\tfalse);\n\n\t\t\/\/Antler\n\tm_cAntlerMoose1->SetGoal(Preferences::GetInstance()->GetDouble(\"Auto-Antlers-Time\",1.5));\n\n\t\t\/\/Turn to fit within the Auto Zone\n\tm_cAutonTurner->SetGoal(90, Preferences::GetInstance()->GetDouble(\"Auto-Turn-Threshold\",2.5), 2);\n\n\t\t\/\/Activate Intake Arms to fit within the Auto Zone\n\tm_cAutonIntakeArms->SetGoal(Preferences::GetInstance()->GetDouble(\"Auto-Intake-Arms-Time\",15), true);\n\n\tCommandBase::antlerMoose->ControlLeftAntler(true);\n\tCommandBase::antlerMoose->ControlRightAntler(true);\n\tCommandBase::mooseLifter->MoveMooseLock(false);\n}\n\n\/\/ Called repeatedly when this Command is scheduled to run\nvoid AutonomousGroup2::Execute()\n{\n}\n\n\/\/ Make this return true when this Command no longer needs to run execute()\nbool AutonomousGroup2::IsFinished()\n{\n\treturn false;\n}\n\n\/\/ Called once after isFinished returns true\nvoid AutonomousGroup2::End()\n{\n\n}\n\n\/\/ Called when another command which requires one or more of the same\n\/\/ subsystems is scheduled to run\nvoid AutonomousGroup2::Interrupted()\n{\n\tEnd();\n}\n<commit_msg>Moose approach speed decreased<commit_after>#include \"AutonomousGroup2.h\"\n\nAutonomousGroup2::AutonomousGroup2()\n{\n\t\/\/Goal: Pick up both bins on step with moose, drive back while setting them down\n\t\/\/Antlers move up, and fit in the auton zone somehow, either by turning or activating arms.\n\tm_cAntlerMoose1 = new AutonAntlerMoose();\n\tm_cMooseLifter1 = new AutonMooseLifter();\n\tm_cMooseLifter2 = new AutonMooseLifter();\n\tm_cAutonDrive1 = new AutonDriveStraight();\n\tm_cAutonDrive2 = new AutonDriveStraight();\n\tm_cAutonDrive3 = new AutonDriveStraight();\n\tm_cAutonDumb1 = new AutonDumbDrive();\n\tm_cAutonTurner = new AutonTurn();\n\tm_cAutonIntakeArms = new AutonIntakeArms();\n\t\n\tAddSequential(m_cAutonDrive1);\t\t\/\/Drive backwards\n\tAddSequential(m_cAutonDumb1);\t\t\/\/Creep backwards slowly to ensure level with step\n\tAddSequential(m_cMooseLifter1);\t\t\/\/Lift up both middle bins with moose\n\tAddParallel(m_cMooseLifter2);\t\t\/\/While the moose is lowering, setting the bins down\n\tAddSequential(m_cAutonDrive2);\t\t\/\/Drive forwards to the auton zone\n\tAddSequential(m_cAntlerMoose1);\t\t\/\/Retract antlers up\n\tAddSequential(m_cAutonDrive3);\t\t\/\/Drive back a bit into the auton zone\n\tAddSequential(m_cAutonIntakeArms);\t\/\/Extend intake arms to fit in auton zone\n\t\/\/AddSequential(m_cAutonTurner);\t\/\/Turn to fit in auton zone\n}\n\nAutonomousGroup2::~AutonomousGroup2()\n{\n\tdelete m_cAutonDrive1;\n\tdelete m_cAutonDrive2;\n\tdelete m_cAutonDrive3;\n\tdelete m_cAutonDumb1;\n\tdelete m_cAntlerMoose1;\n\tdelete m_cMooseLifter1;\n\tdelete m_cMooseLifter2;\n\tdelete m_cAutonIntakeArms;\n\tdelete m_cAutonTurner;\n}\n\n\/\/ Called just before this Command runs the first time\nvoid AutonomousGroup2::Initialize()\n{\n\t\/\/ Will change values once robot speed and positioning is known.\n\t\t\/\/Drive\n\tm_cAutonDrive1->SetGoal(\n\t\t\tPreferences::GetInstance()->GetDouble(\"Auto-Distance-Step\",-53),\n\t\t\tPreferences::GetInstance()->GetDouble(\"Auto-Tolerance-Step\",1.5),\n\t\t\tPreferences::GetInstance()->GetDouble(\"Auto-Speed-Step\",0.75),\n\t\t\tPreferences::GetInstance()->GetDouble(\"Auto-Timeout-Step\",3) );\n\tm_cAutonDrive2->SetGoal(\n\t\t\tPreferences::GetInstance()->GetDouble(\"Auto-Distance-Zone\",164),\n\t\t\tPreferences::GetInstance()->GetDouble(\"Auto-Tolerance-Zone\",1.5),\n\t\t\tPreferences::GetInstance()->GetDouble(\"Auto-Speed-Zone\",0.65),\n\t\t\tPreferences::GetInstance()->GetDouble(\"Auto-Timeout-Zone\",7) );\n\tm_cAutonDrive3->SetGoal(\n\t\t\tPreferences::GetInstance()->GetDouble(\"Auto-Distance-Self\",-40),\n\t\t\tPreferences::GetInstance()->GetDouble(\"Auto-Tolerance-Self\",1.5),\n\t\t\tPreferences::GetInstance()->GetDouble(\"Auto-Speed-Self\",0.75),\n\t\t\tPreferences::GetInstance()->GetDouble(\"Auto-Timeout-Self\",4) );\n\n\t\t\/\/Dumb Drive\n\tm_cAutonDumb1->SetGoal(\n\t\t\tPreferences::GetInstance()->GetDouble(\"Auto-Dumb-Speed\", 0.55),\n\t\t\tPreferences::GetInstance()->GetDouble(\"Auto-Dumb-Time\", 0.2));\n\n\t\t\/\/Moose Lifter\n\tm_cMooseLifter1->SetGoal(0,\n\t\t\tPreferences::GetInstance()->GetDouble(\"Auto-MooseUp-Time\", 1.0),\n\t\t\ttrue);\n\tm_cMooseLifter2->SetGoal(\n\t\t\tPreferences::GetInstance()->GetDouble(\"Auto-MooseDrop\",140),\n\t\t\tPreferences::GetInstance()->GetDouble(\"Auto-MooseDown-Time\", 2.0),\n\t\t\tfalse);\n\n\t\t\/\/Antler\n\tm_cAntlerMoose1->SetGoal(Preferences::GetInstance()->GetDouble(\"Auto-Antlers-Time\",1.5));\n\n\t\t\/\/Turn to fit within the Auto Zone\n\tm_cAutonTurner->SetGoal(90, Preferences::GetInstance()->GetDouble(\"Auto-Turn-Threshold\",2.5), 2);\n\n\t\t\/\/Activate Intake Arms to fit within the Auto Zone\n\tm_cAutonIntakeArms->SetGoal(Preferences::GetInstance()->GetDouble(\"Auto-Intake-Arms-Time\",15), true);\n\n\tCommandBase::antlerMoose->ControlLeftAntler(true);\n\tCommandBase::antlerMoose->ControlRightAntler(true);\n\tCommandBase::mooseLifter->MoveMooseLock(false);\n}\n\n\/\/ Called repeatedly when this Command is scheduled to run\nvoid AutonomousGroup2::Execute()\n{\n}\n\n\/\/ Make this return true when this Command no longer needs to run execute()\nbool AutonomousGroup2::IsFinished()\n{\n\treturn false;\n}\n\n\/\/ Called once after isFinished returns true\nvoid AutonomousGroup2::End()\n{\n\n}\n\n\/\/ Called when another command which requires one or more of the same\n\/\/ subsystems is scheduled to run\nvoid AutonomousGroup2::Interrupted()\n{\n\tEnd();\n}\n<|endoftext|>"} {"text":"<commit_before>#include \"GraphicsService.hpp\"\r\n\r\n#include \"Global.hpp\"\r\n#include \"TimeService.hpp\"\r\n#include \"Render.hpp\"\r\n#include \"Texture2D.hpp\"\r\n#include \"TextureMappedFont.hpp\"\r\n#include \"Log.hpp\"\r\n\r\nnamespace Core\r\n{\r\n GraphicsService::GraphicsService() :\r\n mDisplay(EGL_NO_DISPLAY),\r\n mSurface(EGL_NO_CONTEXT),\r\n mContext(EGL_NO_SURFACE)\r\n {\r\n \tLOGI(\"Creating GraphicsService.\");\r\n }\r\n\r\n Status GraphicsService::Start()\r\n {\r\n \tint mWidth(0),mHeight(0);\r\n\r\n \tLOGI(\"Starting GraphicsService.\");\r\n\r\n EGLint lFormat, lNumConfigs, lErrorResult;\r\n EGLConfig lConfig;\r\n \/\/ Defines display requirements. 16bits mode here.\r\n const EGLint lAttributes[] =\r\n \t{\r\n \t\tEGL_RENDERABLE_TYPE, EGL_WINDOW_BIT,\r\n \t\tEGL_RED_SIZE, 8,\r\n \t\tEGL_GREEN_SIZE, 8,\r\n \t\tEGL_BLUE_SIZE, 8,\r\n \t\tEGL_DEPTH_SIZE, 24,\r\n \t\tEGL_NONE\r\n \t};\r\n const EGLint lContextAttrib[] =\r\n\t\t{\r\n\t\t\tEGL_CONTEXT_CLIENT_VERSION, 2, EGL_NONE\r\n\t\t};\r\n\r\n \/\/ Retrieves a display connection and initializes it.\r\n LOGD(\"Connecting to the display.\");\r\n mDisplay = eglGetDisplay(EGL_DEFAULT_DISPLAY);\r\n if (mDisplay == EGL_NO_DISPLAY)\r\n {\r\n \tLOGE(\"EGL_NO_DISPLAY\");\r\n \tgoto ERROR;\r\n }\r\n if (!eglInitialize(mDisplay, NULL, NULL))\r\n {\r\n \tLOGE(\"Unable to initialize display\");\r\n \tgoto ERROR;\r\n }\r\n\r\n \/\/ Selects the first OpenGL configuration found.\r\n LOGD(\"Selecting a display config.\");\r\n if(!eglChooseConfig(mDisplay, lAttributes, &lConfig, 1, &lNumConfigs) || (lNumConfigs <= 0))\r\n {\r\n \tLOGE(\"Unable to select display configuration\");\r\n \tgoto ERROR;\r\n }\r\n\r\n \/\/ Reconfigures the Android window with the EGL format.\r\n LOGD(\"Configuring window format.\");\r\n if (!eglGetConfigAttrib(mDisplay, lConfig, EGL_NATIVE_VISUAL_ID, &lFormat))\r\n {\r\n \tLOGE(\"Unable to configure window format\");\r\n \tgoto ERROR;\r\n }\r\n ANativeWindow_setBuffersGeometry(Global::pAndroidApp->window, 0, 0, lFormat);\r\n \/\/ Creates the display surface.\r\n LOGD(\"Initializing the display.\");\r\n mSurface = eglCreateWindowSurface(mDisplay, lConfig, Global::pAndroidApp->window, NULL);\r\n if (mSurface == EGL_NO_SURFACE)\r\n {\r\n \tLOGE(\"EGL_NO_SURFACE\");\r\n \tgoto ERROR;\r\n }\r\n mContext = eglCreateContext(mDisplay, lConfig, EGL_NO_CONTEXT, lContextAttrib);\r\n if (mContext == EGL_NO_CONTEXT)\r\n {\r\n \tLOGE(\"EGL_NO_CONTEXT\");\r\n \tgoto ERROR;\r\n }\r\n\r\n \/\/ Activates the display surface.\r\n LOGD(\"Activating the display.\");\r\n if (!eglMakeCurrent(mDisplay, mSurface, mSurface, mContext)\r\n || !eglQuerySurface(mDisplay, mSurface, EGL_WIDTH, &mWidth)\r\n || !eglQuerySurface(mDisplay, mSurface, EGL_HEIGHT, &mHeight)\r\n || (mWidth <= 0) || (mHeight <= 0))\r\n {\r\n \tLOGE(\"Unable to activate display\");\r\n \tgoto ERROR;\r\n }\r\n\r\n \/\/ Displays information about OpenGL.\r\n LOGI(\"Starting GraphicsService\");\r\n LOGI(\"Version : %s\", glGetString(GL_VERSION));\r\n LOGI(\"Vendor : %s\", glGetString(GL_VENDOR));\r\n LOGI(\"Renderer : %s\", glGetString(GL_RENDERER));\r\n LOGI(\"Viewport : %d x %d\", mWidth, mHeight);\r\n\r\n\t\tSetup(mWidth,mHeight);\r\n\t\treturn STATUS_OK;\r\n\r\n ERROR:\r\n \tLOGE(\"Error while starting GraphicsService\");\r\n Stop();\r\n return STATUS_KO;\r\n }\r\n\r\n void GraphicsService::Stop()\r\n {\r\n \tLOGI(\"GraphicsService::Stop\");\r\n\r\n \tUnloadResources();\r\n\r\n \tRender::DisableOrthoMode();\r\n\r\n \/\/ Destroys OpenGL context.\r\n if (mDisplay != EGL_NO_DISPLAY)\r\n {\r\n eglMakeCurrent(mDisplay, EGL_NO_SURFACE, EGL_NO_SURFACE, EGL_NO_CONTEXT);\r\n if (mContext != EGL_NO_CONTEXT)\r\n {\r\n eglDestroyContext(mDisplay, mContext);\r\n mContext = EGL_NO_CONTEXT;\r\n }\r\n if (mSurface != EGL_NO_SURFACE)\r\n {\r\n eglDestroySurface(mDisplay, mSurface);\r\n mSurface = EGL_NO_SURFACE;\r\n }\r\n eglTerminate(mDisplay);\r\n mDisplay = EGL_NO_DISPLAY;\r\n }\r\n }\r\n\r\n void GraphicsService::Setup(int width, int height)\r\n {\r\n \tRender::Init();\r\n\t\tRender::SetScreenSize(width,height);\r\n\t\tRender::SetOrthoMode();\r\n\t\tRender::EnableOrthoMode();\r\n\r\n\t\tLoadResources();\r\n }\r\n\r\n void GraphicsService::Update()\r\n {\r\n float lTimeStep = Global::pContext->pTimeService->Elapsed();\r\n }\r\n\r\n Status GraphicsService::Render()\r\n {\r\n \tglClear(GL_COLOR_BUFFER_BIT | GL_DEPTH_BUFFER_BIT);\r\n\r\n\t\tSpriteBatcher::Flush();\r\n\r\n\t\tif(eglSwapBuffers(mDisplay, mSurface)!=EGL_TRUE)\r\n\t\t{\r\n\t\t\tLOGE(\"Error %d swapping buffers.\",eglGetError());\r\n\t\t\treturn STATUS_KO;\r\n\t\t}\r\n\r\n\t\treturn STATUS_OK;\r\n }\r\n\r\n Status GraphicsService::LoadResources()\r\n {\r\n \tInitVertexPrograms();\r\n\r\n \tGlobal::pFont=new TextureMappedFont;\r\n \tGlobal::pFont->Load(\"@Font.tga\");\r\n\r\n \treturn STATUS_OK;\r\n }\r\n\r\n Status GraphicsService::UnloadResources()\r\n {\r\n \tdelete Global::pFont;\r\n\r\n \tDeleteVertexPrograms();\r\n\r\n \treturn STATUS_OK;\r\n }\r\n}\r\n<commit_msg>Graphics Service now update and render Particle engine<commit_after>#include \"GraphicsService.hpp\"\r\n\r\n#include \"Global.hpp\"\r\n#include \"TimeService.hpp\"\r\n#include \"Render.hpp\"\r\n#include \"Texture2D.hpp\"\r\n#include \"TextureMappedFont.hpp\"\r\n#include \"Log.hpp\"\r\n#include \"Particles.hpp\"\r\n\r\nnamespace Core\r\n{\r\n GraphicsService::GraphicsService() :\r\n mDisplay(EGL_NO_DISPLAY),\r\n mSurface(EGL_NO_CONTEXT),\r\n mContext(EGL_NO_SURFACE)\r\n {\r\n \tLOGI(\"Creating GraphicsService.\");\r\n }\r\n\r\n Status GraphicsService::Start()\r\n {\r\n \tint mWidth(0),mHeight(0);\r\n\r\n \tLOGI(\"Starting GraphicsService.\");\r\n\r\n EGLint lFormat, lNumConfigs, lErrorResult;\r\n EGLConfig lConfig;\r\n \/\/ Defines display requirements. 16bits mode here.\r\n const EGLint lAttributes[] =\r\n \t{\r\n \t\tEGL_RENDERABLE_TYPE, EGL_WINDOW_BIT,\r\n \t\tEGL_RED_SIZE, 8,\r\n \t\tEGL_GREEN_SIZE, 8,\r\n \t\tEGL_BLUE_SIZE, 8,\r\n \t\tEGL_DEPTH_SIZE, 24,\r\n \t\tEGL_NONE\r\n \t};\r\n const EGLint lContextAttrib[] =\r\n\t\t{\r\n\t\t\tEGL_CONTEXT_CLIENT_VERSION, 2, EGL_NONE\r\n\t\t};\r\n\r\n \/\/ Retrieves a display connection and initializes it.\r\n LOGD(\"Connecting to the display.\");\r\n mDisplay = eglGetDisplay(EGL_DEFAULT_DISPLAY);\r\n if (mDisplay == EGL_NO_DISPLAY)\r\n {\r\n \tLOGE(\"EGL_NO_DISPLAY\");\r\n \tgoto ERROR;\r\n }\r\n if (!eglInitialize(mDisplay, NULL, NULL))\r\n {\r\n \tLOGE(\"Unable to initialize display\");\r\n \tgoto ERROR;\r\n }\r\n\r\n \/\/ Selects the first OpenGL configuration found.\r\n LOGD(\"Selecting a display config.\");\r\n if(!eglChooseConfig(mDisplay, lAttributes, &lConfig, 1, &lNumConfigs) || (lNumConfigs <= 0))\r\n {\r\n \tLOGE(\"Unable to select display configuration\");\r\n \tgoto ERROR;\r\n }\r\n\r\n \/\/ Reconfigures the Android window with the EGL format.\r\n LOGD(\"Configuring window format.\");\r\n if (!eglGetConfigAttrib(mDisplay, lConfig, EGL_NATIVE_VISUAL_ID, &lFormat))\r\n {\r\n \tLOGE(\"Unable to configure window format\");\r\n \tgoto ERROR;\r\n }\r\n ANativeWindow_setBuffersGeometry(Global::pAndroidApp->window, 0, 0, lFormat);\r\n \/\/ Creates the display surface.\r\n LOGD(\"Initializing the display.\");\r\n mSurface = eglCreateWindowSurface(mDisplay, lConfig, Global::pAndroidApp->window, NULL);\r\n if (mSurface == EGL_NO_SURFACE)\r\n {\r\n \tLOGE(\"EGL_NO_SURFACE\");\r\n \tgoto ERROR;\r\n }\r\n mContext = eglCreateContext(mDisplay, lConfig, EGL_NO_CONTEXT, lContextAttrib);\r\n if (mContext == EGL_NO_CONTEXT)\r\n {\r\n \tLOGE(\"EGL_NO_CONTEXT\");\r\n \tgoto ERROR;\r\n }\r\n\r\n \/\/ Activates the display surface.\r\n LOGD(\"Activating the display.\");\r\n if (!eglMakeCurrent(mDisplay, mSurface, mSurface, mContext)\r\n || !eglQuerySurface(mDisplay, mSurface, EGL_WIDTH, &mWidth)\r\n || !eglQuerySurface(mDisplay, mSurface, EGL_HEIGHT, &mHeight)\r\n || (mWidth <= 0) || (mHeight <= 0))\r\n {\r\n \tLOGE(\"Unable to activate display\");\r\n \tgoto ERROR;\r\n }\r\n\r\n \/\/ Displays information about OpenGL.\r\n LOGI(\"Starting GraphicsService\");\r\n LOGI(\"Version : %s\", glGetString(GL_VERSION));\r\n LOGI(\"Vendor : %s\", glGetString(GL_VENDOR));\r\n LOGI(\"Renderer : %s\", glGetString(GL_RENDERER));\r\n LOGI(\"Viewport : %d x %d\", mWidth, mHeight);\r\n\r\n\t\tSetup(mWidth,mHeight);\r\n\t\treturn STATUS_OK;\r\n\r\n ERROR:\r\n \tLOGE(\"Error while starting GraphicsService\");\r\n Stop();\r\n return STATUS_KO;\r\n }\r\n\r\n void GraphicsService::Stop()\r\n {\r\n \tLOGI(\"GraphicsService::Stop\");\r\n\r\n \tUnloadResources();\r\n\r\n \tRender::DisableOrthoMode();\r\n\r\n \/\/ Destroys OpenGL context.\r\n if (mDisplay != EGL_NO_DISPLAY)\r\n {\r\n eglMakeCurrent(mDisplay, EGL_NO_SURFACE, EGL_NO_SURFACE, EGL_NO_CONTEXT);\r\n if (mContext != EGL_NO_CONTEXT)\r\n {\r\n eglDestroyContext(mDisplay, mContext);\r\n mContext = EGL_NO_CONTEXT;\r\n }\r\n if (mSurface != EGL_NO_SURFACE)\r\n {\r\n eglDestroySurface(mDisplay, mSurface);\r\n mSurface = EGL_NO_SURFACE;\r\n }\r\n eglTerminate(mDisplay);\r\n mDisplay = EGL_NO_DISPLAY;\r\n }\r\n }\r\n\r\n void GraphicsService::Setup(int width, int height)\r\n {\r\n \tRender::Init();\r\n\t\tRender::SetScreenSize(width,height);\r\n\t\tRender::SetOrthoMode();\r\n\t\tRender::EnableOrthoMode();\r\n\r\n\t\tLoadResources();\r\n }\r\n\r\n void GraphicsService::Update()\r\n {\r\n float lTimeStep = Global::pContext->pTimeService->Elapsed();\r\n\r\n ParticleEmitter::UpdateAll(lTimeStep);\r\n Particle::UpdateAll(lTimeStep);\r\n }\r\n\r\n Status GraphicsService::Render()\r\n {\r\n \tglClear(GL_COLOR_BUFFER_BIT | GL_DEPTH_BUFFER_BIT);\r\n\r\n \tParticle::RenderAll();\r\n\t\tSpriteBatcher::Flush();\r\n\r\n\t\tif(eglSwapBuffers(mDisplay, mSurface)!=EGL_TRUE)\r\n\t\t{\r\n\t\t\tLOGE(\"Error %d swapping buffers.\",eglGetError());\r\n\t\t\treturn STATUS_KO;\r\n\t\t}\r\n\r\n\t\treturn STATUS_OK;\r\n }\r\n\r\n Status GraphicsService::LoadResources()\r\n {\r\n \tInitVertexPrograms();\r\n\r\n \tGlobal::pFont=new TextureMappedFont;\r\n \tGlobal::pFont->Load(\"@Font.tga\");\r\n\r\n \treturn STATUS_OK;\r\n }\r\n\r\n Status GraphicsService::UnloadResources()\r\n {\r\n \tdelete Global::pFont;\r\n\r\n \tDeleteVertexPrograms();\r\n\r\n \treturn STATUS_OK;\r\n }\r\n}\r\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\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\n\/\/ Connects to the server at a the given port.\nvoid Connect(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 \/\/ Try each address until we successfully connect().\n \/\/ If socket() (or connect()) fails, close the socket and try 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\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 RequestSay(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 RequestLogin(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 RequestLogout() {\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 RequestJoin(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\/\/ 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\/\/ 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 RequestLogout();\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\/\/ std::string input;\n\n\/\/ struct timeval timeout;\n fd_set read_set;\n\/\/ int file_desc = 0;\n int result;\n char receive_buffer[kBufferSize];\n memset(&receive_buffer, 0, kBufferSize);\n\n char stdin_buffer[kBufferSize];\n memset(&stdin_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 Connect(domain, port_str);\n\n RequestLogin(username);\n\n channel = (char *) \"Common\";\n RequestJoin(channel);\n\n \/\/ TODO handle response from send\n\n std::cout << \">\" << std::flush;\n\n std::string tmp;\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 int read_stdin_size = read(STDIN_FILENO, stdin_buffer, kBufferSize);\n\n if (read_stdin_size != 0) {\n if (stdin_buffer[0] == '\/') {\n ProcessInput(stdin_buffer);\n } else {\n \/\/ Send chat messages\n StripChar(stdin_buffer, '\\n');\n RequestSay(stdin_buffer);\n }\n }\n\n memset(&stdin_buffer, 0, kBufferSize);\n } \/\/ end of if STDIN\n\n 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 \/\/ TODO capture user input, store, clean input, then print buffer, afterward replace input\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 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 std::cout << \">\" << stdin_buffer << std::flush;\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>print buffer manually in stdin check<commit_after>#include <netdb.h>\n#include <unistd.h>\n#include <sys\/fcntl.h>\n\n#include \"client.h\"\n#include \"duckchat.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\n\/\/ Connects to the server at a the given port.\nvoid Connect(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 \/\/ Try each address until we successfully connect().\n \/\/ If socket() (or connect()) fails, close the socket and try 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\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 RequestSay(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 RequestLogin(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 RequestLogout() {\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 RequestJoin(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\/\/ 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\/\/ 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 RequestLogout();\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\/\/ std::string input;\n\n\/\/ struct timeval timeout;\n fd_set read_set;\n\/\/ int file_desc = 0;\n int result;\n char receive_buffer[kBufferSize];\n memset(&receive_buffer, 0, kBufferSize);\n\n char stdin_buffer[kBufferSize];\n memset(&stdin_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 Connect(domain, port_str);\n\n RequestLogin(username);\n\n channel = (char *) \"Common\";\n RequestJoin(channel);\n\n \/\/ TODO handle response from send\n\n std::cout << \">\" << std::flush;\n\n std::string tmp;\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 int read_stdin_size = read(STDIN_FILENO, stdin_buffer, kBufferSize);\n\n if (read_stdin_size != 0) {\n if (stdin_buffer[0] == '\/') {\n ProcessInput(stdin_buffer);\n } else {\n \/\/ Send chat messages\n StripChar(stdin_buffer, '\\n');\n RequestSay(stdin_buffer);\n std::cout << \">\" << stdin_buffer << std::flush;\n }\n }\n\n memset(&stdin_buffer, 0, kBufferSize);\n } \/\/ end of if STDIN\n\n 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 \/\/ TODO capture user input, store, clean input, then print buffer, afterward replace input\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 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 std::cout << \">\" << stdin_buffer << std::flush;\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>#pragma once\n\n#include \"vm\/code_segment.hpp\"\n\n\/\/\/ End of recursion (noop)\nvoid add_code( perseus::detail::code_segment& out_code )\n{\n}\n\n\/**\n@brief Add values to a code segment\n@param out_code[in,out] code to append onto\n@param head first value to append\n@param tail remaining values to append\n*\/\ntemplate< typename Head, typename... Tail >\nvoid add_code( perseus::detail::code_segment& out_code, Head head, Tail... tail )\n{\n out_code.push< Head >( head );\n add_code( out_code, tail... );\n}\n\ntemplate< typename... Args >\nperseus::detail::code_segment create_code_segment( Args... args )\n{\n perseus::detail::code_segment code;\n add_code( code, args... );\n return code;\n}\n<commit_msg>fixed duplicate symbols when including test\/write_code_segment.hpp repeatedly<commit_after>#pragma once\n\n#include \"vm\/code_segment.hpp\"\n\n\/\/\/ End of recursion (noop)\nstatic void add_code( perseus::detail::code_segment& out_code )\n{\n}\n\n\/**\n@brief Add values to a code segment\n@param out_code[in,out] code to append onto\n@param head first value to append\n@param tail remaining values to append\n*\/\ntemplate< typename Head, typename... Tail >\nvoid add_code( perseus::detail::code_segment& out_code, Head head, Tail... tail )\n{\n out_code.push< Head >( head );\n add_code( out_code, tail... );\n}\n\ntemplate< typename... Args >\nperseus::detail::code_segment create_code_segment( Args... args )\n{\n perseus::detail::code_segment code;\n add_code( code, args... );\n return code;\n}\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\tutils.c\n *\n * \\brief\tcommon tool\/function utilization\n *\n * \\date\t03\/10\/2009 Created\n *\n *************************************************************************************\n *\/\n#if defined(_WIN32)\n#include <windows.h>\n#include <sys\/types.h>\n#include <sys\/timeb.h>\n#ifndef _MSC_VER\n#include <sys\/time.h>\n#endif\n#else\n#include <sys\/time.h>\n#endif\n\n#include \"utils.h\"\n#include \"property.h\"\n#include \"encoder_context.h\"\n#include \"property.h\"\n#include \"crt_util_safe_x.h\"\t\/\/ Safe CRT routines like utils for cross platforms\n\n\nnamespace WelsSVCEnc {\n\nvoid WelsLogDefault (void* pCtx, const int32_t kiLevel, const str_t* kpFmtStr, va_list argv);\nvoid WelsLogNil (void* pCtx, const int32_t kiLevel, const str_t* kpFmtStr, va_list argv);\n\nreal32_t WelsCalcPsnr (const void* kpTarPic,\n const int32_t kiTarStride,\n const void* kpRefPic,\n const int32_t kiRefStride,\n const int32_t kiWidth,\n const int32_t kiHeight);\n\n\/\/ to fill default routines\n#ifdef ENABLE_TRACE_FILE\nPWelsLogCallbackFunc wlog\t= WelsLogDefault;\n#else\nPWelsLogCallbackFunc wlog\t= WelsLogNil;\n#endif\n\niWelsLogLevel\t\tg_iLevelLog\t= WELS_LOG_DEFAULT;\t\/\/ default log iLevel\nint32_t\t\t\tg_iSizeLogBuf\t= 1024;\t\t\t\/\/ pBuffer size for each log output\n\n\/*\n *\tLog output routines\n *\/\n\n\/*!\n * \\brief\tget log tag\n * \\param\tkiLevel\t\tlog iLevel\n * \\return tag of log iLevel\n *\/\nstatic inline str_t* GetLogTag (const int32_t kiLevel, int32_t* pBit) {\n int32_t iShift\t= 0;\n int32_t iVal\t\t= 0;\n bool_t\tbFound\t= false;\n\n if (kiLevel <= 0 || kiLevel > (1 << (WELS_LOG_LEVEL_COUNT - 1)) || NULL == pBit)\n return NULL;\n\n for (;;) {\n if (iShift >= WELS_LOG_LEVEL_COUNT)\n break;\n iVal\t= (1 << iShift);\n if (iVal == kiLevel) {\n bFound\t= true;\n break;\n }\n ++ iShift;\n }\n\n if (bFound) {\n *pBit\t= iShift;\n return (str_t*)g_sWelsLogTags[iShift];\n }\n return NULL;\n}\n\n\/*!\n *************************************************************************************\n * \\brief\tSystem trace log output in Wels\n *\n * \\param\tpCtx\tinstance pointer\n * \\param\tkiLevel\tlog iLevel ( WELS_LOG_QUIET, ERROR, WARNING, INFO, DEBUG )\n * \\param\tkpFmtStr\tformated string to mount\n * \\param \targv\tpData string argument\n *\n * \\return\tNONE\n *\n * \\note\tN\/A\n *************************************************************************************\n *\/\nvoid WelsLogDefault (void* pCtx, const int32_t kiLevel, const str_t* kpFmtStr, va_list argv) {\n sWelsEncCtx* pEncCtx\t= (sWelsEncCtx*)pCtx;\n iWelsLogLevel\t\t iVal\t= (kiLevel & g_iLevelLog);\n\n if (0 == iVal || NULL == pEncCtx) {\t\/\/ such iLevel not enabled\n return;\n } else {\n str_t pBuf[WELS_LOG_BUF_SIZE + 1] = {0};\n const int32_t kiBufSize = sizeof (pBuf) \/ sizeof (pBuf[0]) - 1;\n int32_t iCurUsed = 0;\n int32_t iBufUsed = 0;\n int32_t iBufLeft = kiBufSize - iBufUsed;\n\n if (pEncCtx) {\n SWelsTime tTime;\n\n WelsGetTimeOfDay(&tTime);\n iCurUsed = WelsSnprintf (&pBuf[iBufUsed], iBufLeft, \"[0x%p @ \", pEncCtx);\t\/\/ confirmed_safe_unsafe_usage\n if (iCurUsed >= 0) {\n iBufUsed += iCurUsed;\n iBufLeft -= iCurUsed;\n }\n\n if (iBufLeft > 0) {\n iCurUsed = GetCodeName (&pBuf[iBufUsed], iBufLeft);\n if (iCurUsed > 0) {\n iBufUsed += iCurUsed;\n iBufLeft -= iCurUsed;\n }\n pBuf[iBufUsed] = ' ';\n ++ iBufUsed;\n -- iBufLeft;\n\n iCurUsed = GetLibName (&pBuf[iBufUsed], iBufLeft);\n if (iCurUsed > 0) {\n iBufUsed += iCurUsed;\n iBufLeft -= iCurUsed;\n }\n pBuf[iBufUsed] = ' ';\n ++ iBufUsed;\n -- iBufLeft;\n\n pBuf[iBufUsed] = 'v';\n ++ iBufUsed;\n -- iBufLeft;\n iCurUsed = GetVerNum (&pBuf[iBufUsed], iBufLeft);\n if (iCurUsed > 0) {\n iBufUsed += iCurUsed;\n iBufLeft -= iCurUsed;\n }\n pBuf[iBufUsed] = ' ';\n ++ iBufUsed;\n -- iBufLeft;\n }\n\n if (iBufLeft > 0) {\n iCurUsed = WelsStrftime (&pBuf[iBufUsed], iBufLeft, \"%y-%m-%d %H:%M:%S\", &tTime);\n if (iCurUsed > 0) {\n iBufUsed += iCurUsed;\n iBufLeft -= iCurUsed;\n }\n } else {\n return;\n }\n\n if (iBufLeft > 0) {\n iCurUsed = WelsSnprintf (&pBuf[iBufUsed], iBufLeft, \".%3.3u]: \", tTime.millitm);\t\/\/ confirmed_safe_unsafe_usage\n if (iCurUsed >= 0) {\n iBufUsed += iCurUsed;\n iBufLeft -= iCurUsed;\n }\n } else {\n return;\n }\n }\n\n \/\/ fixed stack corruption issue on vs2008\n if (iBufLeft > 0) {\n int32_t i_shift = 0;\n str_t* pStr = NULL;\n pStr\t= GetLogTag (kiLevel, &i_shift);\n if (NULL != pStr) {\n int32_t iLenTag = strlen (pStr);\t\/\/ confirmed_safe_unsafe_usage\n STRCAT (&pBuf[iBufUsed], iBufLeft, pStr);\t\/\/ confirmed_safe_unsafe_usage\n iBufUsed += iLenTag;\n pBuf[iBufUsed] = ' ';\n iBufUsed++;\n ++iLenTag;\n iBufLeft -= iLenTag;\n }\n }\n if (iBufLeft > 0) {\n iCurUsed = WelsVsnprintf (&pBuf[iBufUsed], iBufLeft, kpFmtStr, argv);\t\/\/ confirmed_safe_unsafe_usage\n if (iCurUsed > 0) {\n iBufUsed += iCurUsed;\n iBufLeft -= iCurUsed;\n }\n }\n#ifdef ENABLE_TRACE_FILE\n if (NULL != pEncCtx && NULL != pEncCtx->pFileLog) {\n if (pEncCtx->uiSizeLog > MAX_TRACE_LOG_SIZE) {\n if (0 == WelsFseek (pEncCtx->pFileLog, 0L, SEEK_SET))\n pEncCtx->uiSizeLog = 0;\n }\n if (iBufUsed > 0 && iBufUsed < WELS_LOG_BUF_SIZE) {\n iCurUsed = WelsFwrite (pBuf, 1, iBufUsed, pEncCtx->pFileLog);\n WelsFflush (pEncCtx->pFileLog);\n if (iCurUsed == iBufUsed)\n pEncCtx->uiSizeLog += iBufUsed;\n }\n } else {\n#if defined(_WIN32) && defined(_DEBUG)\n OutputDebugStringA (pBuf);\n#endif\n }\n#endif\/\/ENABLE_TRACE_FILE\n }\n}\nvoid WelsLogNil (void* pCtx, const int32_t kiLevel, const str_t* kpFmtStr, va_list argv) {\n \/\/ NULL implementation\n}\n\n\/*!\n*************************************************************************************\n* \\brief\treopen log file when finish setting current path\n*\n* \\param\tpCtx\t\tcontext pCtx\n* \\param\tpCurPath\tcurrent path string\n*\n* \\return\tNONE\n*\n* \\note\tN\/A\n*************************************************************************************\n*\/\nvoid WelsReopenTraceFile (void* pCtx, str_t* pCurPath) {\n#ifdef ENABLE_TRACE_FILE\n sWelsEncCtx* pEncCtx\t= (sWelsEncCtx*)pCtx;\n if (wlog == WelsLogDefault) {\n if (pEncCtx->pFileLog != NULL) {\n WelsFclose (pEncCtx->pFileLog);\n pEncCtx->pFileLog = NULL;\n }\n pEncCtx->uiSizeLog\t= 0;\n pEncCtx->pFileLog\t= WelsFopen (\"wels_encoder_trace.txt\", \"wt+\");\t\/\/ confirmed_safe_unsafe_usage\n }\n#endif\/\/ENABLE_TRACE_FILE\n}\n\n\/*!\n *************************************************************************************\n * \\brief\tset log iLevel from external call\n *\n * \\param\tiLevel\tiLevel of log\n *\n * \\return\tNONE\n *\n * \\note\tcan be able to control log iLevel dynamically\n *************************************************************************************\n *\/\nvoid WelsSetLogLevel (const int32_t kiLevel) {\n iWelsLogLevel iVal = 0;\n if (kiLevel & WELS_LOG_ERROR) {\n iVal |= WELS_LOG_ERROR;\n }\n if (kiLevel & WELS_LOG_WARNING) {\n iVal |= WELS_LOG_WARNING;\n }\n if (kiLevel & WELS_LOG_INFO) {\n iVal |= WELS_LOG_INFO;\n }\n if (kiLevel & WELS_LOG_DEBUG) {\n iVal |= WELS_LOG_DEBUG;\n }\n g_iLevelLog\t= iVal;\n}\n\n\/*!\n *************************************************************************************\n * \\brief\tget log iLevel from external call\n *\n * \\param\tN\/A\n *\n * \\return\tcurrent iLevel of log used in codec internal\n *\n * \\note\tcan be able to get log iLevel of internal codec applicable\n *************************************************************************************\n *\/\nint32_t WelsGetLogLevel (void) {\n return g_iLevelLog;\n}\n\n\/*!\n *************************************************************************************\n * \\brief\tset log callback from external call\n *\n * \\param\t_log\tlog function routine\n *\n * \\return\tNONE\n *\n * \\note\tN\/A\n *************************************************************************************\n *\/\nvoid WelsSetLogCallback (PWelsLogCallbackFunc _log) {\n wlog\t= _log;\n}\n\nvoid WelsLogCall (void* pCtx, int32_t iLevel, const str_t* kpFmt, va_list vl) {\n wlog (pCtx, iLevel, kpFmt, vl);\n}\n\nvoid WelsLog (void* pCtx, int32_t iLevel, const str_t* kpFmt, ...) {\n va_list vl;\n va_start (vl, kpFmt);\n WelsLogCall (pCtx, iLevel, kpFmt, vl);\n va_end (vl);\n}\n\n#ifndef CALC_PSNR\n#define CONST_FACTOR_PSNR\t(10.0 \/ log(10.0))\t\/\/ for good computation\n#define CALC_PSNR(w, h, s)\t((real32_t)(CONST_FACTOR_PSNR * log( 65025.0 * w * h \/ iSqe )))\n#endif\/\/CALC_PSNR\n\n\/*\n *\tPSNR calculation routines\n *\/\n\/*!\n *************************************************************************************\n * \\brief\tPSNR calculation utilization in Wels\n *\n * \\param\tpTarPic\t\ttarget picture to be calculated in Picture pData format\n * \\param\tiTarStride\tstride of target picture pData pBuffer\n * \\param \tpRefPic\t\tbase referencing picture samples\n * \\param\tiRefStride\tstride of reference picture pData pBuffer\n * \\param\tiWidth\t\tpicture iWidth in pixel\n * \\param\tiHeight\t\tpicture iHeight in pixel\n *\n * \\return\tactual PSNR result;\n *\n * \\note\tN\/A\n *************************************************************************************\n *\/\nreal32_t WelsCalcPsnr (const void* kpTarPic,\n const int32_t kiTarStride,\n const void* kpRefPic,\n const int32_t kiRefStride,\n const int32_t kiWidth,\n const int32_t kiHeight) {\n int64_t\tiSqe = 0;\n int32_t x, y;\n uint8_t* pTar = (uint8_t*)kpTarPic;\n uint8_t* pRef = (uint8_t*)kpRefPic;\n\n if (NULL == pTar || NULL == pRef)\n return (-1.0f);\n\n for (y = 0; y < kiHeight; ++ y) {\t\/\/ OPTable !!\n for (x = 0; x < kiWidth; ++ x) {\n const int32_t kiT = pTar[y * kiTarStride + x] - pRef[y * kiRefStride + x];\n iSqe\t+= kiT * kiT;\n }\n }\n if (0 == iSqe) {\n return (99.99f);\n }\n return CALC_PSNR (kiWidth, kiHeight, iSqe);\n}\n\n\n}\n<commit_msg>Use WelsSnprintf instead of a combination of strlen and STRNCAT<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\tutils.c\n *\n * \\brief\tcommon tool\/function utilization\n *\n * \\date\t03\/10\/2009 Created\n *\n *************************************************************************************\n *\/\n#if defined(_WIN32)\n#include <windows.h>\n#include <sys\/types.h>\n#include <sys\/timeb.h>\n#ifndef _MSC_VER\n#include <sys\/time.h>\n#endif\n#else\n#include <sys\/time.h>\n#endif\n\n#include \"utils.h\"\n#include \"property.h\"\n#include \"encoder_context.h\"\n#include \"property.h\"\n#include \"crt_util_safe_x.h\"\t\/\/ Safe CRT routines like utils for cross platforms\n\n\nnamespace WelsSVCEnc {\n\nvoid WelsLogDefault (void* pCtx, const int32_t kiLevel, const str_t* kpFmtStr, va_list argv);\nvoid WelsLogNil (void* pCtx, const int32_t kiLevel, const str_t* kpFmtStr, va_list argv);\n\nreal32_t WelsCalcPsnr (const void* kpTarPic,\n const int32_t kiTarStride,\n const void* kpRefPic,\n const int32_t kiRefStride,\n const int32_t kiWidth,\n const int32_t kiHeight);\n\n\/\/ to fill default routines\n#ifdef ENABLE_TRACE_FILE\nPWelsLogCallbackFunc wlog\t= WelsLogDefault;\n#else\nPWelsLogCallbackFunc wlog\t= WelsLogNil;\n#endif\n\niWelsLogLevel\t\tg_iLevelLog\t= WELS_LOG_DEFAULT;\t\/\/ default log iLevel\nint32_t\t\t\tg_iSizeLogBuf\t= 1024;\t\t\t\/\/ pBuffer size for each log output\n\n\/*\n *\tLog output routines\n *\/\n\n\/*!\n * \\brief\tget log tag\n * \\param\tkiLevel\t\tlog iLevel\n * \\return tag of log iLevel\n *\/\nstatic inline str_t* GetLogTag (const int32_t kiLevel, int32_t* pBit) {\n int32_t iShift\t= 0;\n int32_t iVal\t\t= 0;\n bool_t\tbFound\t= false;\n\n if (kiLevel <= 0 || kiLevel > (1 << (WELS_LOG_LEVEL_COUNT - 1)) || NULL == pBit)\n return NULL;\n\n for (;;) {\n if (iShift >= WELS_LOG_LEVEL_COUNT)\n break;\n iVal\t= (1 << iShift);\n if (iVal == kiLevel) {\n bFound\t= true;\n break;\n }\n ++ iShift;\n }\n\n if (bFound) {\n *pBit\t= iShift;\n return (str_t*)g_sWelsLogTags[iShift];\n }\n return NULL;\n}\n\n\/*!\n *************************************************************************************\n * \\brief\tSystem trace log output in Wels\n *\n * \\param\tpCtx\tinstance pointer\n * \\param\tkiLevel\tlog iLevel ( WELS_LOG_QUIET, ERROR, WARNING, INFO, DEBUG )\n * \\param\tkpFmtStr\tformated string to mount\n * \\param \targv\tpData string argument\n *\n * \\return\tNONE\n *\n * \\note\tN\/A\n *************************************************************************************\n *\/\nvoid WelsLogDefault (void* pCtx, const int32_t kiLevel, const str_t* kpFmtStr, va_list argv) {\n sWelsEncCtx* pEncCtx\t= (sWelsEncCtx*)pCtx;\n iWelsLogLevel\t\t iVal\t= (kiLevel & g_iLevelLog);\n\n if (0 == iVal || NULL == pEncCtx) {\t\/\/ such iLevel not enabled\n return;\n } else {\n str_t pBuf[WELS_LOG_BUF_SIZE + 1] = {0};\n const int32_t kiBufSize = sizeof (pBuf) \/ sizeof (pBuf[0]) - 1;\n int32_t iCurUsed = 0;\n int32_t iBufUsed = 0;\n int32_t iBufLeft = kiBufSize - iBufUsed;\n\n if (pEncCtx) {\n SWelsTime tTime;\n\n WelsGetTimeOfDay(&tTime);\n iCurUsed = WelsSnprintf (&pBuf[iBufUsed], iBufLeft, \"[0x%p @ \", pEncCtx);\t\/\/ confirmed_safe_unsafe_usage\n if (iCurUsed >= 0) {\n iBufUsed += iCurUsed;\n iBufLeft -= iCurUsed;\n }\n\n if (iBufLeft > 0) {\n iCurUsed = GetCodeName (&pBuf[iBufUsed], iBufLeft);\n if (iCurUsed > 0) {\n iBufUsed += iCurUsed;\n iBufLeft -= iCurUsed;\n }\n pBuf[iBufUsed] = ' ';\n ++ iBufUsed;\n -- iBufLeft;\n\n iCurUsed = GetLibName (&pBuf[iBufUsed], iBufLeft);\n if (iCurUsed > 0) {\n iBufUsed += iCurUsed;\n iBufLeft -= iCurUsed;\n }\n pBuf[iBufUsed] = ' ';\n ++ iBufUsed;\n -- iBufLeft;\n\n pBuf[iBufUsed] = 'v';\n ++ iBufUsed;\n -- iBufLeft;\n iCurUsed = GetVerNum (&pBuf[iBufUsed], iBufLeft);\n if (iCurUsed > 0) {\n iBufUsed += iCurUsed;\n iBufLeft -= iCurUsed;\n }\n pBuf[iBufUsed] = ' ';\n ++ iBufUsed;\n -- iBufLeft;\n }\n\n if (iBufLeft > 0) {\n iCurUsed = WelsStrftime (&pBuf[iBufUsed], iBufLeft, \"%y-%m-%d %H:%M:%S\", &tTime);\n if (iCurUsed > 0) {\n iBufUsed += iCurUsed;\n iBufLeft -= iCurUsed;\n }\n } else {\n return;\n }\n\n if (iBufLeft > 0) {\n iCurUsed = WelsSnprintf (&pBuf[iBufUsed], iBufLeft, \".%3.3u]: \", tTime.millitm);\t\/\/ confirmed_safe_unsafe_usage\n if (iCurUsed >= 0) {\n iBufUsed += iCurUsed;\n iBufLeft -= iCurUsed;\n }\n } else {\n return;\n }\n }\n\n \/\/ fixed stack corruption issue on vs2008\n if (iBufLeft > 0) {\n int32_t i_shift = 0;\n str_t* pStr = NULL;\n pStr\t= GetLogTag (kiLevel, &i_shift);\n if (NULL != pStr) {\n iCurUsed = WelsSnprintf (&pBuf[iBufUsed], iBufLeft, \"%s \", pStr);\n if (iCurUsed >= 0) {\n iBufUsed += iCurUsed;\n iBufLeft -= iCurUsed;\n }\n }\n }\n if (iBufLeft > 0) {\n iCurUsed = WelsVsnprintf (&pBuf[iBufUsed], iBufLeft, kpFmtStr, argv);\t\/\/ confirmed_safe_unsafe_usage\n if (iCurUsed > 0) {\n iBufUsed += iCurUsed;\n iBufLeft -= iCurUsed;\n }\n }\n#ifdef ENABLE_TRACE_FILE\n if (NULL != pEncCtx && NULL != pEncCtx->pFileLog) {\n if (pEncCtx->uiSizeLog > MAX_TRACE_LOG_SIZE) {\n if (0 == WelsFseek (pEncCtx->pFileLog, 0L, SEEK_SET))\n pEncCtx->uiSizeLog = 0;\n }\n if (iBufUsed > 0 && iBufUsed < WELS_LOG_BUF_SIZE) {\n iCurUsed = WelsFwrite (pBuf, 1, iBufUsed, pEncCtx->pFileLog);\n WelsFflush (pEncCtx->pFileLog);\n if (iCurUsed == iBufUsed)\n pEncCtx->uiSizeLog += iBufUsed;\n }\n } else {\n#if defined(_WIN32) && defined(_DEBUG)\n OutputDebugStringA (pBuf);\n#endif\n }\n#endif\/\/ENABLE_TRACE_FILE\n }\n}\nvoid WelsLogNil (void* pCtx, const int32_t kiLevel, const str_t* kpFmtStr, va_list argv) {\n \/\/ NULL implementation\n}\n\n\/*!\n*************************************************************************************\n* \\brief\treopen log file when finish setting current path\n*\n* \\param\tpCtx\t\tcontext pCtx\n* \\param\tpCurPath\tcurrent path string\n*\n* \\return\tNONE\n*\n* \\note\tN\/A\n*************************************************************************************\n*\/\nvoid WelsReopenTraceFile (void* pCtx, str_t* pCurPath) {\n#ifdef ENABLE_TRACE_FILE\n sWelsEncCtx* pEncCtx\t= (sWelsEncCtx*)pCtx;\n if (wlog == WelsLogDefault) {\n if (pEncCtx->pFileLog != NULL) {\n WelsFclose (pEncCtx->pFileLog);\n pEncCtx->pFileLog = NULL;\n }\n pEncCtx->uiSizeLog\t= 0;\n pEncCtx->pFileLog\t= WelsFopen (\"wels_encoder_trace.txt\", \"wt+\");\t\/\/ confirmed_safe_unsafe_usage\n }\n#endif\/\/ENABLE_TRACE_FILE\n}\n\n\/*!\n *************************************************************************************\n * \\brief\tset log iLevel from external call\n *\n * \\param\tiLevel\tiLevel of log\n *\n * \\return\tNONE\n *\n * \\note\tcan be able to control log iLevel dynamically\n *************************************************************************************\n *\/\nvoid WelsSetLogLevel (const int32_t kiLevel) {\n iWelsLogLevel iVal = 0;\n if (kiLevel & WELS_LOG_ERROR) {\n iVal |= WELS_LOG_ERROR;\n }\n if (kiLevel & WELS_LOG_WARNING) {\n iVal |= WELS_LOG_WARNING;\n }\n if (kiLevel & WELS_LOG_INFO) {\n iVal |= WELS_LOG_INFO;\n }\n if (kiLevel & WELS_LOG_DEBUG) {\n iVal |= WELS_LOG_DEBUG;\n }\n g_iLevelLog\t= iVal;\n}\n\n\/*!\n *************************************************************************************\n * \\brief\tget log iLevel from external call\n *\n * \\param\tN\/A\n *\n * \\return\tcurrent iLevel of log used in codec internal\n *\n * \\note\tcan be able to get log iLevel of internal codec applicable\n *************************************************************************************\n *\/\nint32_t WelsGetLogLevel (void) {\n return g_iLevelLog;\n}\n\n\/*!\n *************************************************************************************\n * \\brief\tset log callback from external call\n *\n * \\param\t_log\tlog function routine\n *\n * \\return\tNONE\n *\n * \\note\tN\/A\n *************************************************************************************\n *\/\nvoid WelsSetLogCallback (PWelsLogCallbackFunc _log) {\n wlog\t= _log;\n}\n\nvoid WelsLogCall (void* pCtx, int32_t iLevel, const str_t* kpFmt, va_list vl) {\n wlog (pCtx, iLevel, kpFmt, vl);\n}\n\nvoid WelsLog (void* pCtx, int32_t iLevel, const str_t* kpFmt, ...) {\n va_list vl;\n va_start (vl, kpFmt);\n WelsLogCall (pCtx, iLevel, kpFmt, vl);\n va_end (vl);\n}\n\n#ifndef CALC_PSNR\n#define CONST_FACTOR_PSNR\t(10.0 \/ log(10.0))\t\/\/ for good computation\n#define CALC_PSNR(w, h, s)\t((real32_t)(CONST_FACTOR_PSNR * log( 65025.0 * w * h \/ iSqe )))\n#endif\/\/CALC_PSNR\n\n\/*\n *\tPSNR calculation routines\n *\/\n\/*!\n *************************************************************************************\n * \\brief\tPSNR calculation utilization in Wels\n *\n * \\param\tpTarPic\t\ttarget picture to be calculated in Picture pData format\n * \\param\tiTarStride\tstride of target picture pData pBuffer\n * \\param \tpRefPic\t\tbase referencing picture samples\n * \\param\tiRefStride\tstride of reference picture pData pBuffer\n * \\param\tiWidth\t\tpicture iWidth in pixel\n * \\param\tiHeight\t\tpicture iHeight in pixel\n *\n * \\return\tactual PSNR result;\n *\n * \\note\tN\/A\n *************************************************************************************\n *\/\nreal32_t WelsCalcPsnr (const void* kpTarPic,\n const int32_t kiTarStride,\n const void* kpRefPic,\n const int32_t kiRefStride,\n const int32_t kiWidth,\n const int32_t kiHeight) {\n int64_t\tiSqe = 0;\n int32_t x, y;\n uint8_t* pTar = (uint8_t*)kpTarPic;\n uint8_t* pRef = (uint8_t*)kpRefPic;\n\n if (NULL == pTar || NULL == pRef)\n return (-1.0f);\n\n for (y = 0; y < kiHeight; ++ y) {\t\/\/ OPTable !!\n for (x = 0; x < kiWidth; ++ x) {\n const int32_t kiT = pTar[y * kiTarStride + x] - pRef[y * kiRefStride + x];\n iSqe\t+= kiT * kiT;\n }\n }\n if (0 == iSqe) {\n return (99.99f);\n }\n return CALC_PSNR (kiWidth, kiHeight, iSqe);\n}\n\n\n}\n<|endoftext|>"} {"text":"<commit_before>\/**\n * @file storageHelperCreator.cc\n * @author Rafal Slota\n * @copyright (C) 2013 ACK CYFRONET AGH\n * @copyright This software is released under the MIT license cited in\n * 'LICENSE.txt'\n *\/\n\n#include \"helpers\/storageHelperCreator.h\"\n\n#include \"buffering\/bufferAgent.h\"\n#include \"posixHelper.h\"\n#include \"proxyHelper.h\"\n#include \"scheduler.h\"\n\n#if WITH_CEPH\n#include \"cephHelper.h\"\n#endif\n\n#if WITH_S3\n#include \"s3Helper.h\"\n#endif\n\n#if WITH_SWIFT\n#include \"swiftHelper.h\"\n#endif\n\nnamespace one {\nnamespace helpers {\n\n#ifdef BUILD_PROXY_IO\n\nStorageHelperCreator::StorageHelperCreator(\n#if WITH_CEPH\n asio::io_service &cephService,\n#endif\n asio::io_service &dioService,\n#if WITH_S3\n asio::io_service &s3Service,\n#endif\n#if WITH_SWIFT\n asio::io_service &swiftService,\n#endif\n communication::Communicator &communicator,\n std::size_t bufferSchedulerWorkers, buffering::BufferLimits bufferLimits)\n :\n#if WITH_CEPH\n m_cephService{cephService}\n ,\n#endif\n m_dioService{dioService}\n ,\n#if WITH_S3\n m_s3Service{s3Service}\n ,\n#endif\n#if WITH_SWIFT\n m_swiftService{swiftService}\n ,\n#endif\n m_scheduler{std::make_unique<Scheduler>(bufferSchedulerWorkers)}\n , m_bufferLimits{std::move(bufferLimits)}\n , m_communicator{communicator}\n{\n}\n#else\n\nStorageHelperCreator::StorageHelperCreator(\n#if WITH_CEPH\n asio::io_service &cephService,\n#endif\n asio::io_service &dioService,\n#if WITH_S3\n asio::io_service &s3Service,\n#endif\n#if WITH_SWIFT\n asio::io_service &swiftService,\n#endif\n std::size_t bufferSchedulerWorkers, buffering::BufferLimits bufferLimits)\n :\n#if WITH_CEPH\n m_cephService{cephService}\n ,\n#endif\n m_dioService{dioService}\n ,\n#if WITH_S3\n m_s3Service{s3Service}\n ,\n#endif\n#if WITH_SWIFT\n m_swiftService{swiftService}\n ,\n#endif\n m_scheduler{std::make_unique<Scheduler>(bufferSchedulerWorkers)}\n , m_bufferLimits{std::move(bufferLimits)}\n{\n}\n#endif\n\nStorageHelperCreator::~StorageHelperCreator() = default;\n\nstd::shared_ptr<StorageHelper> StorageHelperCreator::getStorageHelper(\n const folly::fbstring &name,\n const std::unordered_map<folly::fbstring, folly::fbstring> &args,\n const bool buffered)\n{\n StorageHelperPtr helper;\n\n if (name == POSIX_HELPER_NAME)\n helper = PosixHelperFactory{m_dioService}.createStorageHelper(args);\n\n#if WITH_CEPH\n if (name == CEPH_HELPER_NAME)\n helper = CephHelperFactory{m_cephService}.createStorageHelper(args);\n#endif\n\n#ifdef BUILD_PROXY_IO\n if (name == PROXY_HELPER_NAME)\n helper = ProxyHelperFactory{m_communicator}.createStorageHelper(args);\n#endif\n\n#if WITH_S3\n if (name == S3_HELPER_NAME)\n helper = S3HelperFactory{m_s3Service}.createStorageHelper(args);\n#endif\n\n#if WITH_SWIFT\n if (name == SWIFT_HELPER_NAME)\n helper = SwiftHelperFactory{m_swiftService}.createStorageHelper(args);\n#endif\n\n if (!helper)\n throw std::system_error{\n std::make_error_code(std::errc::invalid_argument),\n \"Invalid storage helper name: '\" + name.toStdString() + \"'\"};\n\n if (buffered)\n return std::make_shared<buffering::BufferAgent>(\n m_bufferLimits, helper, *m_scheduler);\n\n return helper;\n}\n\n} \/\/ namespace helpers\n} \/\/ namespace one\n<commit_msg>Disable storage helpers buffering<commit_after>\/**\n * @file storageHelperCreator.cc\n * @author Rafal Slota\n * @copyright (C) 2013 ACK CYFRONET AGH\n * @copyright This software is released under the MIT license cited in\n * 'LICENSE.txt'\n *\/\n\n#include \"helpers\/storageHelperCreator.h\"\n\n#include \"buffering\/bufferAgent.h\"\n#include \"posixHelper.h\"\n#include \"proxyHelper.h\"\n#include \"scheduler.h\"\n\n#if WITH_CEPH\n#include \"cephHelper.h\"\n#endif\n\n#if WITH_S3\n#include \"s3Helper.h\"\n#endif\n\n#if WITH_SWIFT\n#include \"swiftHelper.h\"\n#endif\n\nnamespace one {\nnamespace helpers {\n\n#ifdef BUILD_PROXY_IO\n\nStorageHelperCreator::StorageHelperCreator(\n#if WITH_CEPH\n asio::io_service &cephService,\n#endif\n asio::io_service &dioService,\n#if WITH_S3\n asio::io_service &s3Service,\n#endif\n#if WITH_SWIFT\n asio::io_service &swiftService,\n#endif\n communication::Communicator &communicator,\n std::size_t bufferSchedulerWorkers, buffering::BufferLimits bufferLimits)\n :\n#if WITH_CEPH\n m_cephService{cephService}\n ,\n#endif\n m_dioService{dioService}\n ,\n#if WITH_S3\n m_s3Service{s3Service}\n ,\n#endif\n#if WITH_SWIFT\n m_swiftService{swiftService}\n ,\n#endif\n m_scheduler{std::make_unique<Scheduler>(bufferSchedulerWorkers)}\n , m_bufferLimits{std::move(bufferLimits)}\n , m_communicator{communicator}\n{\n}\n#else\n\nStorageHelperCreator::StorageHelperCreator(\n#if WITH_CEPH\n asio::io_service &cephService,\n#endif\n asio::io_service &dioService,\n#if WITH_S3\n asio::io_service &s3Service,\n#endif\n#if WITH_SWIFT\n asio::io_service &swiftService,\n#endif\n std::size_t bufferSchedulerWorkers, buffering::BufferLimits bufferLimits)\n :\n#if WITH_CEPH\n m_cephService{cephService}\n ,\n#endif\n m_dioService{dioService}\n ,\n#if WITH_S3\n m_s3Service{s3Service}\n ,\n#endif\n#if WITH_SWIFT\n m_swiftService{swiftService}\n ,\n#endif\n m_scheduler{std::make_unique<Scheduler>(bufferSchedulerWorkers)}\n , m_bufferLimits{std::move(bufferLimits)}\n{\n}\n#endif\n\nStorageHelperCreator::~StorageHelperCreator() = default;\n\nstd::shared_ptr<StorageHelper> StorageHelperCreator::getStorageHelper(\n const folly::fbstring &name,\n const std::unordered_map<folly::fbstring, folly::fbstring> &args,\n const bool buffered)\n{\n StorageHelperPtr helper;\n\n if (name == POSIX_HELPER_NAME)\n helper = PosixHelperFactory{m_dioService}.createStorageHelper(args);\n\n#if WITH_CEPH\n if (name == CEPH_HELPER_NAME)\n helper = CephHelperFactory{m_cephService}.createStorageHelper(args);\n#endif\n\n#ifdef BUILD_PROXY_IO\n if (name == PROXY_HELPER_NAME)\n helper = ProxyHelperFactory{m_communicator}.createStorageHelper(args);\n#endif\n\n#if WITH_S3\n if (name == S3_HELPER_NAME)\n helper = S3HelperFactory{m_s3Service}.createStorageHelper(args);\n#endif\n\n#if WITH_SWIFT\n if (name == SWIFT_HELPER_NAME)\n helper = SwiftHelperFactory{m_swiftService}.createStorageHelper(args);\n#endif\n\n if (!helper)\n throw std::system_error{\n std::make_error_code(std::errc::invalid_argument),\n \"Invalid storage helper name: '\" + name.toStdString() + \"'\"};\n\n \/\/if (buffered)\n \/\/ return std::make_shared<buffering::BufferAgent>(\n \/\/ m_bufferLimits, helper, *m_scheduler);\n\n return helper;\n}\n\n} \/\/ namespace helpers\n} \/\/ namespace one\n<|endoftext|>"} {"text":"<commit_before>\/*===========================================================================*\\\n * *\n * OpenMesh *\n * Copyright (C) 2001-2012 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\n\/\/=============================================================================\n\/\/\n\/\/ Implements the baseclass for IOManager writer modules\n\/\/\n\/\/=============================================================================\n\n\n#ifndef __BASEWRITER_HH__\n#define __BASEWRITER_HH__\n\n\n\/\/=== INCLUDES ================================================================\n\n\n\/\/ STD C++\n#include <iostream>\n#include <string>\n\n\/\/ OpenMesh\n#include <OpenMesh\/Core\/System\/config.h>\n#include <OpenMesh\/Core\/IO\/Options.hh>\n#include <OpenMesh\/Core\/IO\/exporter\/BaseExporter.hh>\n\n\n\/\/== NAMESPACES ===============================================================\n\n\nnamespace OpenMesh {\nnamespace IO {\n\n\n\/\/=== IMPLEMENTATION ==========================================================\n\n\n\/**\n Base class for all writer modules. The module should register itself at\n the IOManager by calling the register_module function.\n*\/\nclass OPENMESHDLLEXPORT BaseWriter\n{\npublic:\n\n typedef unsigned int Option;\n\n \/\/\/ Destructor\n virtual ~BaseWriter() {};\n\n \/\/\/ Return short description of the supported file format.\n virtual std::string get_description() const = 0;\n\n \/\/\/ Return file format's extension.\n virtual std::string get_extensions() const = 0;\n\n \/\/\/ Returns true if writer can parse _filename (checks extension)\n virtual bool can_u_write(const std::string& _filename) const;\n\n \/\/\/ Write to file _filename. Data source specified by BaseExporter _be.\n virtual bool write(const std::string& _filename,\n\t\t BaseExporter& _be,\n Options _opt,\n std::streamsize _precision = 6) const = 0;\n\n \/\/\/ Write to std::ostream _os. Data source specified by BaseExporter _be.\n virtual bool write(std::ostream& _os,\n\t\t BaseExporter& _be,\n Options _opt,\n std::streamsize _precision = 6) const = 0;\n\n \/\/\/ Returns expected size of file if binary format is supported else 0.\n virtual size_t binary_size(BaseExporter&, Options) const { return 0; }\n\n\n\nprotected:\n\n bool check(BaseExporter& _be, Options _opt) const\n {\n return (_opt.check(Options::VertexNormal ) <= _be.has_vertex_normals())\n && (_opt.check(Options::VertexTexCoord)<= _be.has_vertex_texcoords())\n && (_opt.check(Options::VertexColor) <= _be.has_vertex_colors())\n && (_opt.check(Options::FaceNormal) <= _be.has_face_normals())\n && (_opt.check(Options::FaceColor) <= _be.has_face_colors());\n }\n};\n\n\n\/\/=============================================================================\n} \/\/ namespace IO\n} \/\/ namespace OpenMesh\n\/\/=============================================================================\n#endif\n\/\/=============================================================================\n<commit_msg>- added some documentation to the BaseWriter<commit_after>\/*===========================================================================*\\\n * *\n * OpenMesh *\n * Copyright (C) 2001-2012 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\n\/\/=============================================================================\n\/\/\n\/\/ Implements the baseclass for IOManager writer modules\n\/\/\n\/\/=============================================================================\n\n\n#ifndef __BASEWRITER_HH__\n#define __BASEWRITER_HH__\n\n\n\/\/=== INCLUDES ================================================================\n\n\n\/\/ STD C++\n#include <iostream>\n#include <string>\n\n\/\/ OpenMesh\n#include <OpenMesh\/Core\/System\/config.h>\n#include <OpenMesh\/Core\/IO\/Options.hh>\n#include <OpenMesh\/Core\/IO\/exporter\/BaseExporter.hh>\n\n\n\/\/== NAMESPACES ===============================================================\n\n\nnamespace OpenMesh {\nnamespace IO {\n\n\n\/\/=== IMPLEMENTATION ==========================================================\n\n\n\/**\n Base class for all writer modules. The module should register itself at\n the IOManager by calling the register_module function.\n*\/\nclass OPENMESHDLLEXPORT BaseWriter\n{\npublic:\n\n typedef unsigned int Option;\n\n \/\/\/ Destructor\n virtual ~BaseWriter() {};\n\n \/\/\/ Return short description of the supported file format.\n virtual std::string get_description() const = 0;\n\n \/\/\/ Return file format's extension.\n virtual std::string get_extensions() const = 0;\n\n \/\/\/ Returns true if writer can parse _filename (checks extension)\n virtual bool can_u_write(const std::string& _filename) const;\n\n \/** Write to a file\n * @param _filename write to file with the given filename\n * @param _be BaseExporter, which specifies the data source\n * @param _opt writing options\n * @param _precision can be used to specify the precision of the floating point notation.\n *\/\n virtual bool write(const std::string& _filename,\n\t\t BaseExporter& _be,\n Options _opt,\n std::streamsize _precision = 6) const = 0;\n\n \/** Write to a std::ostream\n * @param _os write to std::ostream\n * @param _be BaseExporter, which specifies the data source\n * @param _opt writing options\n * @param _precision can be used to specify the precision of the floating point notation.\n *\/\n virtual bool write(std::ostream& _os,\n\t\t BaseExporter& _be,\n Options _opt,\n std::streamsize _precision = 6) const = 0;\n\n \/\/\/ Returns expected size of file if binary format is supported else 0.\n virtual size_t binary_size(BaseExporter&, Options) const { return 0; }\n\n\n\nprotected:\n\n bool check(BaseExporter& _be, Options _opt) const\n {\n return (_opt.check(Options::VertexNormal ) <= _be.has_vertex_normals())\n && (_opt.check(Options::VertexTexCoord)<= _be.has_vertex_texcoords())\n && (_opt.check(Options::VertexColor) <= _be.has_vertex_colors())\n && (_opt.check(Options::FaceNormal) <= _be.has_face_normals())\n && (_opt.check(Options::FaceColor) <= _be.has_face_colors());\n }\n};\n\n\n\/\/=============================================================================\n} \/\/ namespace IO\n} \/\/ namespace OpenMesh\n\/\/=============================================================================\n#endif\n\/\/=============================================================================\n<|endoftext|>"} {"text":"<commit_before>#ifndef RBX_VARIABLE_SCOPE_HPP\n#define RBX_VARIABLE_SCOPE_HPP\n\n#include \"vm\/object_utils.hpp\"\n\n#include \"builtin\/object.hpp\"\n#include \"builtin\/tuple.hpp\"\n\nnamespace rubinius {\n\n class CompiledMethod;\n class Module;\n struct CallFrame;\n\n \/**\n * Variable information.\n *\/\n class VariableScope : public Object {\n public:\n const static object_type type = VariableScopeType;\n\n private: \/* Instance variables *\/\n \/** Block given to method *\/\n Object* block_; \/\/ slot\n \/** Method this scope is for. *\/\n CompiledMethod* method_; \/\/ slot\n Module* module_; \/\/ slot\n VariableScope* parent_; \/\/ slot\n Tuple* heap_locals_; \/\/ slot\n Object* last_match_; \/\/ slot\n\n public:\n Object* self_; \/\/ slot\n\n int number_of_locals_;\n bool isolated_;\n Object** locals_;\n int block_as_method_;\n\n public: \/* Accessors *\/\n attr_accessor(block, Object);\n attr_accessor(method, CompiledMethod);\n attr_accessor(module, Module);\n attr_accessor(parent, VariableScope);\n attr_accessor(self, Object);\n attr_accessor(heap_locals, Tuple);\n attr_accessor(last_match, Object);\n\n static void init(STATE);\n static void bootstrap_methods(STATE);\n\n void fixup() { }\n\n bool isolated() {\n return isolated_;\n }\n\n Object** stack_locals() {\n return locals_;\n }\n\n bool block_as_method_p() {\n return block_as_method_ == 1;\n }\n\n void set_block_as_method(bool val) {\n block_as_method_ = (val ? 1 : 0);\n }\n\n \/**\n * Initialize scope for methods.\n *\/\n void prepare(Object* self, Module* mod, Object* block, CompiledMethod* method, int num) {\n rubinius::abort();\n init_header(UnspecifiedZone, InvalidType);\n klass_ = 0;\n ivars_ = 0;\n\n parent_ = nil<VariableScope>();\n self_ = self;\n method_ = method;\n module_ = mod;\n block_ = block;\n number_of_locals_ = num;\n\n for(int i = 0; i < num; i++) {\n locals_[i] = Qnil;\n }\n }\n\n void update_parent(VariableScope* vs) {\n parent_ = vs;\n }\n\n void set_local(STATE, int pos, Object* val) {\n if(isolated_) {\n heap_locals_->put(state, pos, val);\n } else {\n locals_[pos] = val;\n }\n }\n\n void set_local(int pos, Object* val) {\n assert(isolated_ == false);\n locals_[pos] = val;\n }\n\n Object* get_local(STATE, int pos) {\n if(isolated_) {\n return heap_locals_->at(state, pos);\n }\n return locals_[pos];\n }\n\n Object* get_local(int pos) {\n if(isolated_) {\n return heap_locals_->at(pos);\n }\n return locals_[pos];\n }\n\n int number_of_locals() {\n return number_of_locals_;\n }\n\n VariableScope* promote(STATE);\n\n \/\/ Ruby.primitive :variable_scope_of_sender\n static VariableScope* of_sender(STATE, CallFrame* calling_environment);\n\n \/\/ Ruby.primitive :variable_scope_current\n static VariableScope* current(STATE, CallFrame* calling_environment);\n\n \/\/ Ruby.primitive :variable_scope_locals\n Tuple* locals(STATE);\n\n \/\/ Ruby.primitive :variable_scope_method_visibility\n Object* method_visibility(STATE);\n\n public: \/\/ Rubinius Type stuff\n class Info : public TypeInfo {\n public:\n Info(object_type type) : TypeInfo(type) { }\n virtual void mark(Object* t, ObjectMark& mark);\n virtual void visit(Object*, ObjectVisitor&);\n virtual void set_field(STATE, Object*, size_t, Object*);\n virtual Object* get_field(STATE, Object*, size_t);\n virtual void auto_mark(Object*, ObjectMark&);\n virtual void auto_visit(Object*, ObjectVisitor&);\n virtual void populate_slot_locations();\n };\n };\n}\n\n#endif\n<commit_msg>Cleanup unused code in VariableScope<commit_after>#ifndef RBX_VARIABLE_SCOPE_HPP\n#define RBX_VARIABLE_SCOPE_HPP\n\n#include \"vm\/object_utils.hpp\"\n\n#include \"builtin\/object.hpp\"\n#include \"builtin\/tuple.hpp\"\n\nnamespace rubinius {\n\n class CompiledMethod;\n class Module;\n struct CallFrame;\n\n \/**\n * Variable information.\n *\/\n class VariableScope : public Object {\n public:\n const static object_type type = VariableScopeType;\n\n private: \/* Instance variables *\/\n \/** Block given to method *\/\n Object* block_; \/\/ slot\n \/** Method this scope is for. *\/\n CompiledMethod* method_; \/\/ slot\n Module* module_; \/\/ slot\n VariableScope* parent_; \/\/ slot\n Tuple* heap_locals_; \/\/ slot\n Object* last_match_; \/\/ slot\n\n public:\n Object* self_; \/\/ slot\n\n int number_of_locals_;\n bool isolated_;\n Object** locals_;\n int block_as_method_;\n\n public: \/* Accessors *\/\n attr_accessor(block, Object);\n attr_accessor(method, CompiledMethod);\n attr_accessor(module, Module);\n attr_accessor(parent, VariableScope);\n attr_accessor(self, Object);\n attr_accessor(heap_locals, Tuple);\n attr_accessor(last_match, Object);\n\n static void init(STATE);\n static void bootstrap_methods(STATE);\n\n void fixup() { }\n\n bool isolated() {\n return isolated_;\n }\n\n Object** stack_locals() {\n return locals_;\n }\n\n bool block_as_method_p() {\n return block_as_method_ == 1;\n }\n\n void set_block_as_method(bool val) {\n block_as_method_ = (val ? 1 : 0);\n }\n\n void update_parent(VariableScope* vs) {\n parent_ = vs;\n }\n\n void set_local(STATE, int pos, Object* val) {\n if(isolated_) {\n heap_locals_->put(state, pos, val);\n } else {\n locals_[pos] = val;\n }\n }\n\n void set_local(int pos, Object* val) {\n assert(isolated_ == false);\n locals_[pos] = val;\n }\n\n Object* get_local(STATE, int pos) {\n if(isolated_) {\n return heap_locals_->at(state, pos);\n }\n return locals_[pos];\n }\n\n Object* get_local(int pos) {\n if(isolated_) {\n return heap_locals_->at(pos);\n }\n return locals_[pos];\n }\n\n int number_of_locals() {\n return number_of_locals_;\n }\n\n VariableScope* promote(STATE);\n\n \/\/ Ruby.primitive :variable_scope_of_sender\n static VariableScope* of_sender(STATE, CallFrame* calling_environment);\n\n \/\/ Ruby.primitive :variable_scope_current\n static VariableScope* current(STATE, CallFrame* calling_environment);\n\n \/\/ Ruby.primitive :variable_scope_locals\n Tuple* locals(STATE);\n\n \/\/ Ruby.primitive :variable_scope_method_visibility\n Object* method_visibility(STATE);\n\n public: \/\/ Rubinius Type stuff\n class Info : public TypeInfo {\n public:\n Info(object_type type) : TypeInfo(type) { }\n virtual void mark(Object* t, ObjectMark& mark);\n virtual void visit(Object*, ObjectVisitor&);\n virtual void set_field(STATE, Object*, size_t, Object*);\n virtual Object* get_field(STATE, Object*, size_t);\n virtual void auto_mark(Object*, ObjectMark&);\n virtual void auto_visit(Object*, ObjectVisitor&);\n virtual void populate_slot_locations();\n };\n };\n}\n\n#endif\n<|endoftext|>"} {"text":"<commit_before>\/\/ Copyright © 2011, Université catholique de Louvain\n\/\/ All rights 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\/\/\n\/\/ THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS \"AS IS\"\n\/\/ AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE\n\/\/ IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE\n\/\/ ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE\n\/\/ LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR\n\/\/ CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF\n\/\/ SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS\n\/\/ INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN\n\/\/ CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)\n\/\/ ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE\n\/\/ POSSIBILITY OF SUCH DAMAGE.\n\n#ifndef MOZART_MODTIME_H\n#define MOZART_MODTIME_H\n\n#include \"..\/mozartcore.hh\"\n\n#ifndef MOZART_GENERATOR\n\nnamespace mozart {\n\nnamespace builtins {\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ Time module \/\/\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nclass ModTime: public Module {\npublic:\n ModTime(): Module(\"Time\") {}\n\n class Alarm: public Builtin<Alarm> {\n public:\n Alarm(): Builtin(\"alarm\") {}\n\n static void call(VM vm, In delay, Out result) {\n auto intDelay = getArgument<nativeint>(vm, delay, \"integer\");\n\n if (intDelay <= 0) {\n result = build(vm, unit);\n } else {\n result = Variable::build(vm, vm->getTopLevelSpace());\n vm->setAlarm(intDelay, RichNode(result).getStableRef(vm));\n }\n }\n };\n\n class GetReferenceTime: public Builtin<GetReferenceTime> {\n public:\n GetReferenceTime(): Builtin(\"getReferenceTime\") {}\n\n static void call(VM vm, Out result) {\n result = build(vm, vm->getReferenceTime());\n }\n };\n};\n\n}\n\n}\n\n#endif \/\/ MOZART_GENERATOR\n\n#endif \/\/ MOZART_MODTIME_H\n<commit_msg>Add Boot_Time.getMonotonicTime for benchmarking purpose<commit_after>\/\/ Copyright © 2011, Université catholique de Louvain\n\/\/ All rights 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\/\/\n\/\/ THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS \"AS IS\"\n\/\/ AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE\n\/\/ IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE\n\/\/ ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE\n\/\/ LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR\n\/\/ CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF\n\/\/ SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS\n\/\/ INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN\n\/\/ CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)\n\/\/ ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE\n\/\/ POSSIBILITY OF SUCH DAMAGE.\n\n#ifndef MOZART_MODTIME_H\n#define MOZART_MODTIME_H\n\n#include <chrono>\n\n#include \"..\/mozartcore.hh\"\n\n#ifndef MOZART_GENERATOR\n\nnamespace mozart {\n\nnamespace builtins {\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ Time module \/\/\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nclass ModTime: public Module {\npublic:\n ModTime(): Module(\"Time\") {}\n\n class Alarm: public Builtin<Alarm> {\n public:\n Alarm(): Builtin(\"alarm\") {}\n\n static void call(VM vm, In delay, Out result) {\n auto intDelay = getArgument<nativeint>(vm, delay, \"integer\");\n\n if (intDelay <= 0) {\n result = build(vm, unit);\n } else {\n result = Variable::build(vm, vm->getTopLevelSpace());\n vm->setAlarm(intDelay, RichNode(result).getStableRef(vm));\n }\n }\n };\n\n class GetReferenceTime: public Builtin<GetReferenceTime> {\n public:\n GetReferenceTime(): Builtin(\"getReferenceTime\") {}\n\n static void call(VM vm, Out result) {\n result = build(vm, vm->getReferenceTime());\n }\n };\n\n class GetMonotonicTime: public Builtin<GetMonotonicTime> {\n public:\n GetMonotonicTime(): Builtin(\"getMonotonicTime\") {}\n\n static void call(VM vm, Out result) {\n using namespace std::chrono;\n auto now = steady_clock::now();\n nanoseconds dur = duration_cast<nanoseconds>(now.time_since_epoch());\n result = build(vm, dur.count());\n }\n };\n};\n\n}\n\n}\n\n#endif \/\/ MOZART_GENERATOR\n\n#endif \/\/ MOZART_MODTIME_H\n<|endoftext|>"} {"text":"<commit_before>#pragma once\n\n#include <bitset>\n#include <cstring>\n#include <iostream>\n\nnamespace despairagus {\n\tnamespace bitwise {\n\t\tusing std::cout;\n\t\tusing std::ostream;\n\n\t\ttemplate <typename A>\n\t\tclass binary final {\n\t\t\ttemplate<typename B>\n\t\t\tusing conref = const B &;\n\n\t\t\tconstexpr static const size_t sz{sizeof(A)};\n\t\t\tconstexpr static const size_t szB{sz << 3};\n\t\t\tconstexpr static const size_t szOneLess{sz - 1};\n\n\t\t\tusing bitA = std::bitset<szB>;\n\t\t\tusing byte = unsigned char;\n\t\t\tusing bit = bool;\n\n\t\tpublic:\n\t\t\texplicit binary(void) = delete;\n\n\t\t\texplicit binary(conref<A> a) noexcept {\n\t\t\t\tbyte *ptr = new byte[sz];\n\t\t\t\tmemcpy((void *) ptr, (const void *const) &a, sz);\n\n\t\t\t\tfor (size_t i = 0; i < sz; ++i) {\n\t\t\t\t\tstatic byte ch;\n\t\t\t\t\tch = ptr[i];\n\t\t\t\t\tfor (size_t j = 0; j < 8; ++j) {\n\t\t\t\t\t\tstatic bool bitVal;\n\t\t\t\t\t\tbitVal = binary<A>::getBitFromByte(ch, j);\n\t\t\t\t\t\tthis->bits[binary<A>::getBitIdx(i, j)] = bitVal;\n\t\t\t\t\t}\n\t\t\t\t}\n\n\t\t\t\tdelete[] ptr;\n\t\t\t}\n\n\t\t\texplicit binary(A &&a) noexcept : binary(a) {\n\t\t\t}\n\n\t\t\ttemplate <typename... B>\n\t\t\texplicit binary(B... b) = delete;\n\n\t\t\tinline ~binary(void) noexcept {\n\t\t\t\tbits.~bitA();\n\t\t\t}\n\n\t\t\tinline void print(void) const noexcept {\n\t\t\t\tbinary<A>::print(std::cout, *this);\n\t\t\t}\n\n\t\t\tinline bool getBit(conref<size_t> idx) const noexcept {\n\t\t\t\treturn bits[idx];\n\t\t\t}\n\n\t\t\tinline bool getBit(size_t&& idx) const noexcept {\n\t\t\t\treturn this->getBit(idx);\n\t\t\t}\n\n\t\t\tinline bool getBit(conref<size_t> a, conref<size_t> b) const noexcept {\n\t\t\t\treturn this->getBit(binary<A>::getBitIdx((byte) a, (byte) b));\n\t\t\t}\n\n\t\t\tinline bool getBit(size_t &&a, size_t &&b) const noexcept {\n\t\t\t\treturn this->getBit(a, b);\n\t\t\t}\n\n\t\t\tinline bool getBit(conref<int> idx) const noexcept {\n\t\t\t\treturn this->getBit((size_t) idx);\n\t\t\t}\n\n\t\t\tinline bool getBit(int&& idx) const noexcept {\n\t\t\t\treturn this->getBit((size_t) idx);\n\t\t\t}\n\n\t\t\tinline bool getBit(conref<byte> byteIdx, conref<byte> bitIdx) const noexcept {\n\t\t\t\treturn binary<A>::getBit(*this, byteIdx, bitIdx);\n\t\t\t}\n\n\t\t\tinline bool getBit(byte&& byteIdx, byte&& bitIdx) const noexcept {\n\t\t\t\treturn binary<A>::getBit(*this, byteIdx, bitIdx);\n\t\t\t}\n\n\t\t\tinline bool getBit(conref<int> byteIdx, conref<int> bitIdx) const noexcept {\n\t\t\t\treturn binary<A>::getBit((size_t) byteIdx, (size_t) bitIdx);\n\t\t\t}\n\n\t\t\tinline bool getBit(int&& byteIdx, int&& bitIdx) const noexcept {\n\t\t\t\treturn binary<A>::getBit(byteIdx, bitIdx);\n\t\t\t}\n\n\t\t\ttemplate <typename... B>\n\t\t\tinline bool getBit(B... b) const noexcept = delete;\n\n\t\t\ttemplate <typename B>\n\t\t\tfriend inline ostream &operator<<(ostream &os, conref<binary<B>> a) noexcept {\n\t\t\t\ta.print(os, a);\n\n\t\t\t\treturn os;\n\t\t\t}\n\n\t\t\ttemplate <typename B>\n\t\t\tfriend inline ostream &operator<<(ostream &os, binary<B> &&a) noexcept {\n\t\t\t\treturn operator<<(os, a);\n\t\t\t}\n\n\t\t\texplicit operator bool(void) const noexcept {\n\t\t\t\treturn this->bits.all();\n\t\t\t}\n\n\t\tprivate:\n\t\t\tstatic inline void print(std::ostream &os, conref<binary<A>> a) noexcept {\n\t\t\t\tfor (size_t i = 0; i < sz; ++i) {\n\t\t\t\t\tfor (size_t j = 0; j < 8; ++j) {\n\t\t\t\t\t\tstatic bit bitIdx;\n\t\t\t\t\t\tbitIdx = (bit) a.bits[getBitIdx(i, j)];\n\t\t\t\t\t\tos << bitIdx;\n\t\t\t\t\t}\n\n\t\t\t\t\tif (szOneLess != i) {\n\t\t\t\t\t\tos << ' ';\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\n\t\t\tstatic inline bit getBitFromByte(conref<byte> data, conref<byte> bitIdx) noexcept {\n\t\t\t\treturn data & (1 << bitIdx);\n\t\t\t}\n\n\t\t\tstatic inline size_t getBitIdx(conref<size_t> byteIdx, conref<size_t> bitIdx) noexcept {\n\t\t\t\treturn (byteIdx << 3) + bitIdx;\n\t\t\t}\n\n\t\t\tstatic inline bit getBit(conref<binary<A>> bits, conref<size_t> byteIdx, conref<size_t> bitIdx) noexcept {\n\t\t\t\treturn bits[getBitIdx(byteIdx, bitIdx)];\n\t\t\t}\n\n\t\t\tbitA bits;\n\t\t};\n\t}\n}<commit_msg>change namespace for binary class to ... binary<commit_after>#pragma once\n\n#include <bitset>\n#include <cstring>\n#include <iostream>\n\nnamespace despairagus {\n\tnamespace binary {\n\t\tusing std::cout;\n\t\tusing std::ostream;\n\n\t\ttemplate <typename A>\n\t\tclass binary final {\n\t\t\ttemplate<typename B>\n\t\t\tusing conref = const B &;\n\n\t\t\tconstexpr static const size_t sz{sizeof(A)};\n\t\t\tconstexpr static const size_t szB{sz << 3};\n\t\t\tconstexpr static const size_t szOneLess{sz - 1};\n\n\t\t\tusing bitA = std::bitset<szB>;\n\t\t\tusing byte = unsigned char;\n\t\t\tusing bit = bool;\n\n\t\tpublic:\n\t\t\texplicit binary(void) = delete;\n\n\t\t\texplicit binary(conref<A> a) noexcept {\n\t\t\t\tbyte *ptr = new byte[sz];\n\t\t\t\tmemcpy((void *) ptr, (const void *const) &a, sz);\n\n\t\t\t\tfor (size_t i = 0; i < sz; ++i) {\n\t\t\t\t\tstatic byte ch;\n\t\t\t\t\tch = ptr[i];\n\t\t\t\t\tfor (size_t j = 0; j < 8; ++j) {\n\t\t\t\t\t\tstatic bool bitVal;\n\t\t\t\t\t\tbitVal = binary<A>::getBitFromByte(ch, j);\n\t\t\t\t\t\tthis->bits[binary<A>::getBitIdx(i, j)] = bitVal;\n\t\t\t\t\t}\n\t\t\t\t}\n\n\t\t\t\tdelete[] ptr;\n\t\t\t}\n\n\t\t\texplicit binary(A &&a) noexcept : binary(a) {\n\t\t\t}\n\n\t\t\ttemplate <typename... B>\n\t\t\texplicit binary(B... b) = delete;\n\n\t\t\tinline ~binary(void) noexcept {\n\t\t\t\tbits.~bitA();\n\t\t\t}\n\n\t\t\tinline void print(void) const noexcept {\n\t\t\t\tbinary<A>::print(std::cout, *this);\n\t\t\t}\n\n\t\t\tinline bool getBit(conref<size_t> idx) const noexcept {\n\t\t\t\treturn bits[idx];\n\t\t\t}\n\n\t\t\tinline bool getBit(size_t&& idx) const noexcept {\n\t\t\t\treturn this->getBit(idx);\n\t\t\t}\n\n\t\t\tinline bool getBit(conref<size_t> a, conref<size_t> b) const noexcept {\n\t\t\t\treturn this->getBit(binary<A>::getBitIdx((byte) a, (byte) b));\n\t\t\t}\n\n\t\t\tinline bool getBit(size_t &&a, size_t &&b) const noexcept {\n\t\t\t\treturn this->getBit(a, b);\n\t\t\t}\n\n\t\t\tinline bool getBit(conref<int> idx) const noexcept {\n\t\t\t\treturn this->getBit((size_t) idx);\n\t\t\t}\n\n\t\t\tinline bool getBit(int&& idx) const noexcept {\n\t\t\t\treturn this->getBit((size_t) idx);\n\t\t\t}\n\n\t\t\tinline bool getBit(conref<byte> byteIdx, conref<byte> bitIdx) const noexcept {\n\t\t\t\treturn binary<A>::getBit(*this, byteIdx, bitIdx);\n\t\t\t}\n\n\t\t\tinline bool getBit(byte&& byteIdx, byte&& bitIdx) const noexcept {\n\t\t\t\treturn binary<A>::getBit(*this, byteIdx, bitIdx);\n\t\t\t}\n\n\t\t\tinline bool getBit(conref<int> byteIdx, conref<int> bitIdx) const noexcept {\n\t\t\t\treturn binary<A>::getBit((size_t) byteIdx, (size_t) bitIdx);\n\t\t\t}\n\n\t\t\tinline bool getBit(int&& byteIdx, int&& bitIdx) const noexcept {\n\t\t\t\treturn binary<A>::getBit(byteIdx, bitIdx);\n\t\t\t}\n\n\t\t\ttemplate <typename... B>\n\t\t\tinline bool getBit(B... b) const noexcept = delete;\n\n\t\t\ttemplate <typename B>\n\t\t\tfriend inline ostream &operator<<(ostream &os, conref<binary<B>> a) noexcept {\n\t\t\t\ta.print(os, a);\n\n\t\t\t\treturn os;\n\t\t\t}\n\n\t\t\ttemplate <typename B>\n\t\t\tfriend inline ostream &operator<<(ostream &os, binary<B> &&a) noexcept {\n\t\t\t\treturn operator<<(os, a);\n\t\t\t}\n\n\t\t\texplicit operator bool(void) const noexcept {\n\t\t\t\treturn this->bits.all();\n\t\t\t}\n\n\t\tprivate:\n\t\t\tstatic inline void print(std::ostream &os, conref<binary<A>> a) noexcept {\n\t\t\t\tfor (size_t i = 0; i < sz; ++i) {\n\t\t\t\t\tfor (size_t j = 0; j < 8; ++j) {\n\t\t\t\t\t\tstatic bit bitIdx;\n\t\t\t\t\t\tbitIdx = (bit) a.bits[getBitIdx(i, j)];\n\t\t\t\t\t\tos << bitIdx;\n\t\t\t\t\t}\n\n\t\t\t\t\tif (szOneLess != i) {\n\t\t\t\t\t\tos << ' ';\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\n\t\t\tstatic inline bit getBitFromByte(conref<byte> data, conref<byte> bitIdx) noexcept {\n\t\t\t\treturn data & (1 << bitIdx);\n\t\t\t}\n\n\t\t\tstatic inline size_t getBitIdx(conref<size_t> byteIdx, conref<size_t> bitIdx) noexcept {\n\t\t\t\treturn (byteIdx << 3) + bitIdx;\n\t\t\t}\n\n\t\t\tstatic inline bit getBit(conref<binary<A>> bits, conref<size_t> byteIdx, conref<size_t> bitIdx) noexcept {\n\t\t\t\treturn bits[getBitIdx(byteIdx, bitIdx)];\n\t\t\t}\n\n\t\t\tbitA bits;\n\t\t};\n\t}\n}<|endoftext|>"} {"text":"<commit_before>#pragma once\n\n#include <bitset>\n#include <cstring>\n\ntemplate <typename A>\nclass binary final {\n\ttemplate <typename B>\n\tusing conref = const B&;\n\n\tconstexpr static size_t sz{sizeof(A)};\n\tconstexpr static auto szB{sz << 3};\n\n\tusing bitA = std::bitset<szB>;\n\tusing byte = unsigned char;\n\tusing bit = bool;\n\npublic:\n\texplicit binary(void) = delete;\n\n\texplicit binary(conref<A> a) {\n\t\tbyte* ptr = new byte[sz];\n\t\tmemcpy((void *) ptr, (const void* const) &a, sz);\n\n\t\tfor (size_t i = 0; i < sz; ++i) {\n\t\t\tstatic byte ch;\n\t\t\tch = ptr[i];\n\t\t\tfor (size_t j = 0; j < 8; ++j) {\n\t\t\t\tstatic bool bitVal;\n\t\t\t\tbitVal = binary::getBitFromByte(ch, j);\n\t\t\t\tthis->bits[getBitIdx(j, i)] = bitVal;\n\t\t\t}\n\t\t}\n\n\t\tdelete [] ptr;\n\t}\n\n\texplicit binary(A&& a) : binary(a) {}\n\n\ttemplate <typename... B>\n\texplicit binary(B... b) = delete;\n\n\t~binary(void) {\n\t\tbits.~bitA();\n\t}\n\n\tstatic inline void print(std::ostream& os, binary<A> a) {\n\t\tfor (size_t i = 0; i < sz; ++i) {\n\t\t\tfor (size_t j = 0; predAndPrint(os, j); ++j) {\n\t\t\t\tstatic bool bit;\n\t\t\t\tbit = bits[getBitIdx(i, j)];\n\t\t\t\tos << bit;\n\t\t\t}\n\t\t}\n\t}\nprivate:\n\tstatic inline bool getBitFromByte(byte data, byte bitIdx) {\n\t\treturn data & (1 << bitIdx);\n\t}\n\n\tstatic inline size_t getBitIdx(size_t byteIdx, size_t bitIdx) {\n\t\treturn (byteIdx << 3) + bitIdx;\n\t}\n\n\tstatic inline bool predAndPrint(conref<std::ostream> os, conref<size_t> idx) {\n\t\tconst bool pred{idx < 8};\n\n\t\tif (!pred) {\n\t\t\tos << ' ';\n\t\t}\n\n\t\treturn pred;\n\t} ;\n\n\tbitA bits;\n};<commit_msg>did not work... changing back to size_t<commit_after>#pragma once\n\n#include <bitset>\n#include <cstring>\n\ntemplate <typename A>\nclass binary final {\n\ttemplate <typename B>\n\tusing conref = const B&;\n\n\tconstexpr static size_t sz{sizeof(A)};\n\tconstexpr static size_t szB{sz << 3};\n\n\tusing bitA = std::bitset<szB>;\n\tusing byte = unsigned char;\n\tusing bit = bool;\n\npublic:\n\texplicit binary(void) = delete;\n\n\texplicit binary(conref<A> a) {\n\t\tbyte* ptr = new byte[sz];\n\t\tmemcpy((void *) ptr, (const void* const) &a, sz);\n\n\t\tfor (size_t i = 0; i < sz; ++i) {\n\t\t\tstatic byte ch;\n\t\t\tch = ptr[i];\n\t\t\tfor (size_t j = 0; j < 8; ++j) {\n\t\t\t\tstatic bool bitVal;\n\t\t\t\tbitVal = binary::getBitFromByte(ch, j);\n\t\t\t\tthis->bits[getBitIdx(j, i)] = bitVal;\n\t\t\t}\n\t\t}\n\n\t\tdelete [] ptr;\n\t}\n\n\texplicit binary(A&& a) : binary(a) {}\n\n\ttemplate <typename... B>\n\texplicit binary(B... b) = delete;\n\n\t~binary(void) {\n\t\tbits.~bitA();\n\t}\n\n\tstatic inline void print(std::ostream& os, binary<A> a) {\n\t\tfor (size_t i = 0; i < sz; ++i) {\n\t\t\tfor (size_t j = 0; predAndPrint(os, j); ++j) {\n\t\t\t\tstatic bool bit;\n\t\t\t\tbit = bits[getBitIdx(i, j)];\n\t\t\t\tos << bit;\n\t\t\t}\n\t\t}\n\t}\nprivate:\n\tstatic inline bool getBitFromByte(byte data, byte bitIdx) {\n\t\treturn data & (1 << bitIdx);\n\t}\n\n\tstatic inline size_t getBitIdx(size_t byteIdx, size_t bitIdx) {\n\t\treturn (byteIdx << 3) + bitIdx;\n\t}\n\n\tstatic inline bool predAndPrint(conref<std::ostream> os, conref<size_t> idx) {\n\t\tconst bool pred{idx < 8};\n\n\t\tif (!pred) {\n\t\t\tos << ' ';\n\t\t}\n\n\t\treturn pred;\n\t} ;\n\n\tbitA bits;\n};<|endoftext|>"} {"text":"<commit_before>#include \"ndis56common.h\"\n#include \"ParaNdis_GuestAnnounce.h\"\n#include \"ParaNdis6_Driver.h\"\n#include \"ethernetutils.h\"\n\nCGratARPPacketHolder::~CGratARPPacketHolder()\n{\n PVOID buffer;\n PMDL mdl;\n if (m_NBL)\n {\n mdl = NET_BUFFER_CURRENT_MDL(NET_BUFFER_LIST_FIRST_NB(m_NBL));\n buffer = MmGetMdlVirtualAddress(mdl);\n if (mdl)\n {\n NdisFreeMdl(mdl);\n }\n if (buffer)\n {\n NdisFreeMemory(buffer, 0, 0);\n }\n NdisFreeNetBufferList(m_NBL);\n }\n}\n\nvoid CGratARPPacketHolder::OnLastReferenceGone()\n{\n Destroy(this, m_handle);\n}\n\nEthernetArpFrame *CGratuitousArpPackets::CreateIPv4Packet(UINT32 IPV4)\n{\n EthernetArpFrame *packet = (EthernetArpFrame *)ParaNdis_AllocateMemory(m_Context, sizeof(EthernetArpFrame));\n if (!packet)\n {\n DPrintf(0, (\"Error could not allocate buffer for arp packet!\\n\"));\n return NULL;\n }\n packet->frame.ether_type = _byteswap_ushort(ETH_ETHER_TYPE_ARP);\n packet->data.hardware_type = _byteswap_ushort(ETH_HARDWARE_TYPE);\n packet->data.protocol_type = _byteswap_ushort(ETH_IP_PROTOCOL_TYPE);\n packet->data.hardware_address_length = ETH_HARDWARE_ADDRESS_SIZE;\n packet->data.protocol_address_length = ETH_IPV4_ADDRESS_SIZE;\n packet->data.operation = _byteswap_ushort(ETH_ARP_OPERATION_TYPE_REQUEST);\n for (UINT i = 0; i < ETH_HARDWARE_ADDRESS_SIZE; i++)\n {\n packet->frame.sender_hardware_address.address[i] = (UINT8)m_Context->CurrentMacAddress[i];\n packet->frame.target_hardware_address.address[i] = 0xFF;\n packet->data.sender_hardware_address.address[i] = m_Context->CurrentMacAddress[i];\n packet->data.target_hardware_address.address[i] = 0xFF;\n }\n packet->data.sender_ipv4_address.address = packet->data.target_ipv4_address.address = IPV4;\n return packet;\n}\n\nEthernetNSMFrame *CGratuitousArpPackets::CreateIPv6Packet(USHORT * IPV6)\n{\n ICMPv6PseudoHeader pseudo_header;\n EthernetNSMFrame *packet = (EthernetNSMFrame *)ParaNdis_AllocateMemory(m_Context, sizeof(EthernetNSMFrame));\n if (!packet)\n {\n DPrintf(0, (\"Error could not allocate buffer for arp packet!\\n\"));\n return NULL;\n }\n packet->frame.ether_type = _byteswap_ushort(ETH_ETHER_TYPE_IPV6);\n for (UINT i = 0; i < ETH_HARDWARE_ADDRESS_SIZE; i++)\n {\n packet->frame.sender_hardware_address.address[i] = (UINT8)m_Context->CurrentMacAddress[i];\n packet->frame.target_hardware_address.address[i] = 0xFF;\n }\n packet->data.version_trafficclass_flowlabel = _byteswap_ulong(ETH_IPV6_VERSION_TRAFFICCONTROL_FLOWLABEL);\n packet->data.payload_length = _byteswap_ushort(sizeof(packet->data.nsm));\n pseudo_header.icmpv6_length = (UINT16) _byteswap_ushort(sizeof(packet->data.nsm));\n packet->data.next_header = pseudo_header.next_header = ETH_IPV6_ICMPV6_PROTOCOL;\n packet->data.hop_limit = 0xFF;\n for (UINT i = 0; i < ETH_IPV6_USHORT_ADDRESS_SIZE; i++)\n {\n packet->data.source_address.address[i] = pseudo_header.source_address.address[i] = 0x0;\n packet->data.destination_address.address[i] = packet->data.nsm.target_address.address[i] =\n pseudo_header.destination_address.address[i] = pseudo_header.nsm.target_address.address[i] = IPV6[i];\n }\n packet->data.nsm.type = pseudo_header.nsm.type = ETH_ICMPV6_TYPE_NSM;\n packet->data.nsm.code = pseudo_header.nsm.code = 0x0;\n packet->data.nsm.checksum = pseudo_header.nsm.checksum = 0x0;\n packet->data.nsm.reserved = pseudo_header.nsm.reserved = 0x0;\n packet->data.nsm.checksum = (CheckSumCalculator(&pseudo_header, sizeof(pseudo_header)));\n return packet;\n}\n\n\nVOID CGratuitousArpPackets::CreateNBL(PVOID packet, UINT size, bool isIPV4)\n{\n PMDL mdl = NdisAllocateMdl(m_Context->MiniportHandle, packet, size);\n if (!mdl)\n {\n DPrintf(0, (\"[%s] mdl allocation failed!\\n\", __FUNCTION__));\n NdisFreeMemory(packet, 0, 0);\n return;\n }\n PNET_BUFFER_LIST nbl = NdisAllocateNetBufferAndNetBufferList(m_Context->BufferListsPool, 0, 0, mdl, 0, size);\n if (!nbl)\n {\n DPrintf(0, (\"[%s] nbl allocation failed!\\n\", __FUNCTION__));\n NdisFreeMemory(packet, 0, 0);\n NdisFreeMdl(mdl);\n return;\n }\n nbl->SourceHandle = m_Context->MiniportHandle;\n CGratARPPacketHolder *GratARPPacket = new (m_Context->MiniportHandle) CGratARPPacketHolder(nbl, m_Context->MiniportHandle, isIPV4);\n nbl->NdisReserved[0] = GratARPPacket;\n m_packets.Push(GratARPPacket);\n}\n\nVOID CGratuitousArpPackets::CreateNBL(UINT32 IPV4)\n{\n EthernetArpFrame * packet = CreateIPv4Packet(IPV4);\n if (packet)\n {\n CreateNBL(packet, sizeof(EthernetArpFrame), true);\n }\n}\n\nVOID CGratuitousArpPackets::CreateNBL(USHORT *IPV6)\n{\n EthernetNSMFrame * packet = CreateIPv6Packet(IPV6);\n if (packet)\n {\n CreateNBL(packet, sizeof(EthernetNSMFrame), false);\n }\n}\n\nVOID CGratuitousArpPackets::SendNBLs()\n{\n auto ctx = m_Context;\n m_packets.ForEach([ctx](CGratARPPacketHolder* GratARPPacket)\n {\n GratARPPacket->AddRef();\n ParaNdis6_SendNBLInternal(ctx, GratARPPacket->GetNBL(), 0, NDIS_SEND_FLAGS_DISPATCH_LEVEL);\n });\n}\n\nCGratARPPacketHolder *CGratuitousArpPackets::GetCGratArpPacketFromNBL(PNET_BUFFER_LIST NBL)\n{\n return (CGratARPPacketHolder *)NBL->NdisReserved[0];\n}\n\nbool CallCompletionForNBL(PARANDIS_ADAPTER * pContext, PNET_BUFFER_LIST NBL)\n{\n return !(NBL->SourceHandle == pContext->MiniportHandle && ParaNdis_CountNBLs(NBL) == 1);\n}\n<commit_msg>Net-KVM: Handle memory allocation failure<commit_after>#include \"ndis56common.h\"\n#include \"ParaNdis_GuestAnnounce.h\"\n#include \"ParaNdis6_Driver.h\"\n#include \"ethernetutils.h\"\n\nCGratARPPacketHolder::~CGratARPPacketHolder()\n{\n PVOID buffer;\n PMDL mdl;\n if (m_NBL)\n {\n mdl = NET_BUFFER_CURRENT_MDL(NET_BUFFER_LIST_FIRST_NB(m_NBL));\n buffer = MmGetMdlVirtualAddress(mdl);\n if (mdl)\n {\n NdisFreeMdl(mdl);\n }\n if (buffer)\n {\n NdisFreeMemory(buffer, 0, 0);\n }\n NdisFreeNetBufferList(m_NBL);\n }\n}\n\nvoid CGratARPPacketHolder::OnLastReferenceGone()\n{\n Destroy(this, m_handle);\n}\n\nEthernetArpFrame *CGratuitousArpPackets::CreateIPv4Packet(UINT32 IPV4)\n{\n EthernetArpFrame *packet = (EthernetArpFrame *)ParaNdis_AllocateMemory(m_Context, sizeof(EthernetArpFrame));\n if (!packet)\n {\n DPrintf(0, (\"Error could not allocate buffer for arp packet!\\n\"));\n return NULL;\n }\n packet->frame.ether_type = _byteswap_ushort(ETH_ETHER_TYPE_ARP);\n packet->data.hardware_type = _byteswap_ushort(ETH_HARDWARE_TYPE);\n packet->data.protocol_type = _byteswap_ushort(ETH_IP_PROTOCOL_TYPE);\n packet->data.hardware_address_length = ETH_HARDWARE_ADDRESS_SIZE;\n packet->data.protocol_address_length = ETH_IPV4_ADDRESS_SIZE;\n packet->data.operation = _byteswap_ushort(ETH_ARP_OPERATION_TYPE_REQUEST);\n for (UINT i = 0; i < ETH_HARDWARE_ADDRESS_SIZE; i++)\n {\n packet->frame.sender_hardware_address.address[i] = (UINT8)m_Context->CurrentMacAddress[i];\n packet->frame.target_hardware_address.address[i] = 0xFF;\n packet->data.sender_hardware_address.address[i] = m_Context->CurrentMacAddress[i];\n packet->data.target_hardware_address.address[i] = 0xFF;\n }\n packet->data.sender_ipv4_address.address = packet->data.target_ipv4_address.address = IPV4;\n return packet;\n}\n\nEthernetNSMFrame *CGratuitousArpPackets::CreateIPv6Packet(USHORT * IPV6)\n{\n ICMPv6PseudoHeader pseudo_header;\n EthernetNSMFrame *packet = (EthernetNSMFrame *)ParaNdis_AllocateMemory(m_Context, sizeof(EthernetNSMFrame));\n if (!packet)\n {\n DPrintf(0, (\"Error could not allocate buffer for arp packet!\\n\"));\n return NULL;\n }\n packet->frame.ether_type = _byteswap_ushort(ETH_ETHER_TYPE_IPV6);\n for (UINT i = 0; i < ETH_HARDWARE_ADDRESS_SIZE; i++)\n {\n packet->frame.sender_hardware_address.address[i] = (UINT8)m_Context->CurrentMacAddress[i];\n packet->frame.target_hardware_address.address[i] = 0xFF;\n }\n packet->data.version_trafficclass_flowlabel = _byteswap_ulong(ETH_IPV6_VERSION_TRAFFICCONTROL_FLOWLABEL);\n packet->data.payload_length = _byteswap_ushort(sizeof(packet->data.nsm));\n pseudo_header.icmpv6_length = (UINT16) _byteswap_ushort(sizeof(packet->data.nsm));\n packet->data.next_header = pseudo_header.next_header = ETH_IPV6_ICMPV6_PROTOCOL;\n packet->data.hop_limit = 0xFF;\n for (UINT i = 0; i < ETH_IPV6_USHORT_ADDRESS_SIZE; i++)\n {\n packet->data.source_address.address[i] = pseudo_header.source_address.address[i] = 0x0;\n packet->data.destination_address.address[i] = packet->data.nsm.target_address.address[i] =\n pseudo_header.destination_address.address[i] = pseudo_header.nsm.target_address.address[i] = IPV6[i];\n }\n packet->data.nsm.type = pseudo_header.nsm.type = ETH_ICMPV6_TYPE_NSM;\n packet->data.nsm.code = pseudo_header.nsm.code = 0x0;\n packet->data.nsm.checksum = pseudo_header.nsm.checksum = 0x0;\n packet->data.nsm.reserved = pseudo_header.nsm.reserved = 0x0;\n packet->data.nsm.checksum = (CheckSumCalculator(&pseudo_header, sizeof(pseudo_header)));\n return packet;\n}\n\n\nVOID CGratuitousArpPackets::CreateNBL(PVOID packet, UINT size, bool isIPV4)\n{\n PMDL mdl = NdisAllocateMdl(m_Context->MiniportHandle, packet, size);\n if (!mdl)\n {\n DPrintf(0, (\"[%s] mdl allocation failed!\\n\", __FUNCTION__));\n NdisFreeMemory(packet, 0, 0);\n return;\n }\n PNET_BUFFER_LIST nbl = NdisAllocateNetBufferAndNetBufferList(m_Context->BufferListsPool, 0, 0, mdl, 0, size);\n if (!nbl)\n {\n DPrintf(0, (\"[%s] nbl allocation failed!\\n\", __FUNCTION__));\n NdisFreeMemory(packet, 0, 0);\n NdisFreeMdl(mdl);\n return;\n }\n nbl->SourceHandle = m_Context->MiniportHandle;\n CGratARPPacketHolder *GratARPPacket = new (m_Context->MiniportHandle) CGratARPPacketHolder(nbl, m_Context->MiniportHandle, isIPV4);\n if (!GratARPPacket)\n {\n DPrintf(0, (\"[%s] Packet holder allocation failed!\\n\", __FUNCTION__));\n NdisFreeNetBufferList(nbl);\n NdisFreeMdl(mdl);\n NdisFreeMemory(packet, 0, 0);\n return;\n }\n nbl->NdisReserved[0] = GratARPPacket;\n m_packets.Push(GratARPPacket);\n}\n\nVOID CGratuitousArpPackets::CreateNBL(UINT32 IPV4)\n{\n EthernetArpFrame * packet = CreateIPv4Packet(IPV4);\n if (packet)\n {\n CreateNBL(packet, sizeof(EthernetArpFrame), true);\n }\n}\n\nVOID CGratuitousArpPackets::CreateNBL(USHORT *IPV6)\n{\n EthernetNSMFrame * packet = CreateIPv6Packet(IPV6);\n if (packet)\n {\n CreateNBL(packet, sizeof(EthernetNSMFrame), false);\n }\n}\n\nVOID CGratuitousArpPackets::SendNBLs()\n{\n auto ctx = m_Context;\n m_packets.ForEach([ctx](CGratARPPacketHolder* GratARPPacket)\n {\n GratARPPacket->AddRef();\n ParaNdis6_SendNBLInternal(ctx, GratARPPacket->GetNBL(), 0, NDIS_SEND_FLAGS_DISPATCH_LEVEL);\n });\n}\n\nCGratARPPacketHolder *CGratuitousArpPackets::GetCGratArpPacketFromNBL(PNET_BUFFER_LIST NBL)\n{\n return (CGratARPPacketHolder *)NBL->NdisReserved[0];\n}\n\nbool CallCompletionForNBL(PARANDIS_ADAPTER * pContext, PNET_BUFFER_LIST NBL)\n{\n return !(NBL->SourceHandle == pContext->MiniportHandle && ParaNdis_CountNBLs(NBL) == 1);\n}\n<|endoftext|>"} {"text":"<commit_before>#include \"core_digital.h\"\n#include \"Arduino.h\"\n#include \"Servo.hpp\"\n\n\/*\n * bt_hc06\n * Take control of the board using JY-MCU\/HC06 Bluetooth 2.0 module.\n * Remote control is operated from Android phone using simple opensource application:\n * https:\/\/play.google.com\/store\/apps\/details?id=com.gundel.bluecontrol&hl=en\n *\/\n\n#define HC06_SERIAL SERIAL_PORT_HARDWARE_OPEN1\n\n#define PIN_SERVO_LEFT (14u)\n#define PIN_SERVO_RIGHT (15u)\n\nServo servo_left;\nServo servo_right;\n\nstatic void hc06_init(void)\n{\n String s;\n\n HC06_SERIAL.begin( 9600 ) ; \/\/ Default baudrate for HC06 module\n\n \/\/ Test SERIAL_PORT_MONITOR output\n SERIAL_PORT_MONITOR.println(\"AT\");\n HC06_SERIAL.print(\"AT\");\n s=HC06_SERIAL.readString();\n SERIAL_PORT_MONITOR.println(s);\n\n SERIAL_PORT_MONITOR.println(\"AT+VERSION\");\n HC06_SERIAL.print(\"AT+VERSION\");\n s=HC06_SERIAL.readString();\n SERIAL_PORT_MONITOR.println(s);\n\n SERIAL_PORT_MONITOR.println(\"AT+NAMESAM_HC06\");\n HC06_SERIAL.print(\"AT+NAMESAM_HC06\");\n s=HC06_SERIAL.readString();\n SERIAL_PORT_MONITOR.println(s);\n}\n\nstatic void servos_init(void)\n{\n pinMode(PIN_SERVO_LEFT, OUTPUT);\n servo_left.attach(PIN_SERVO_LEFT); \/\/ attaches the servo connected to pin PIN_SERVO_LEFT to the servo_left object\n\n pinMode(PIN_SERVO_RIGHT, OUTPUT);\n servo_right.attach(PIN_SERVO_RIGHT); \/\/ attaches the servo connected to pin PIN_SERVO_RIGHT to the servo_right object\n}\n\n\/\/ the setup function runs once when you press reset or power the board\nvoid setup(void)\n{\n \/\/ initialize digital pin LED_BUILTIN as an output.\n pinMode(LED_BUILTIN, OUTPUT);\n digitalWrite(LED_BUILTIN, LOW); \/\/ turn the LED on (HIGH is the voltage level)\n\n SERIAL_PORT_MONITOR.begin( 115200 ) ; \/\/ Output to EDBG Virtual COM Port\n hc06_init();\n\n servos_init();\n\n delay(1000); \/\/ wait for a second\n \/\/ Show we did the setup already\n digitalWrite(LED_BUILTIN, HIGH); \/\/ turn the LED off\n}\n\n\/\/ the loop function runs over and over again forever\nvoid loop(void)\n{\n char c;\n\n if ( HC06_SERIAL.available() )\n \/\/ if text arrived in from BT serial...\n {\n c=HC06_SERIAL.read();\n SERIAL_PORT_MONITOR.print(\"Received:\");\n SERIAL_PORT_MONITOR.println(c);\n switch ( c )\n {\n case 'C': \/\/ stop everything\n servo_left.write(90); \/\/\n servo_right.write(90); \/\/\n break;\n\n case 'U':\n \/\/ move robot forward\n servo_left.write(180); \/\/\n servo_right.write(0); \/\/\n break;\n\n case 'D':\n \/\/ move robot backward\n servo_left.write(0); \/\/\n servo_right.write(180); \/\/\n break;\n\n case 'L':\n \/\/ move robot forward\n servo_left.write(180); \/\/\n servo_right.write(180); \/\/\n break;\n\n case 'R':\n \/\/ move robot backward\n servo_left.write(0); \/\/\n servo_right.write(0); \/\/\n break;\n\n default:\n break;\n }\n }\n}\n<commit_msg>[examples] Makes wheel_robot_servo compile-able on every board<commit_after>#include \"Arduino.h\"\n#include \"Servo.hpp\"\n\n\/*\n * bt_hc06\n * Take control of the board using JY-MCU\/HC06 Bluetooth 2.0 module.\n * Remote control is operated from Android phone using simple opensource application:\n * https:\/\/play.google.com\/store\/apps\/details?id=com.gundel.bluecontrol&hl=en\n *\/\n\n#if defined SERIAL_PORT_HARDWARE_OPEN1\n#define HC06_SERIAL SERIAL_PORT_HARDWARE_OPEN1\n#endif \/\/ SERIAL_PORT_HARDWARE_OPEN1\n\n#define PIN_SERVO_LEFT (14u)\n#define PIN_SERVO_RIGHT (15u)\n\nServo servo_left;\nServo servo_right;\n\n#if defined HC06_SERIAL\nstatic void hc06_init(void)\n{\n String s;\n\n HC06_SERIAL.begin( 9600 ) ; \/\/ Default baudrate for HC06 module\n\n \/\/ Test SERIAL_PORT_MONITOR output\n SERIAL_PORT_MONITOR.println(\"AT\");\n HC06_SERIAL.print(\"AT\");\n s=HC06_SERIAL.readString();\n SERIAL_PORT_MONITOR.println(s);\n\n SERIAL_PORT_MONITOR.println(\"AT+VERSION\");\n HC06_SERIAL.print(\"AT+VERSION\");\n s=HC06_SERIAL.readString();\n SERIAL_PORT_MONITOR.println(s);\n\n SERIAL_PORT_MONITOR.println(\"AT+NAMESAM_HC06\");\n HC06_SERIAL.print(\"AT+NAMESAM_HC06\");\n s=HC06_SERIAL.readString();\n SERIAL_PORT_MONITOR.println(s);\n}\n#endif \/\/ HC06_SERIAL\n\nstatic void servos_init(void)\n{\n pinMode(PIN_SERVO_LEFT, OUTPUT);\n servo_left.attach(PIN_SERVO_LEFT); \/\/ attaches the servo connected to pin PIN_SERVO_LEFT to the servo_left object\n\n pinMode(PIN_SERVO_RIGHT, OUTPUT);\n servo_right.attach(PIN_SERVO_RIGHT); \/\/ attaches the servo connected to pin PIN_SERVO_RIGHT to the servo_right object\n}\n\n\/\/ the setup function runs once when you press reset or power the board\nvoid setup(void)\n{\n \/\/ initialize digital pin LED_BUILTIN as an output.\n pinMode(LED_BUILTIN, OUTPUT);\n digitalWrite(LED_BUILTIN, LOW); \/\/ turn the LED on (HIGH is the voltage level)\n\n SERIAL_PORT_MONITOR.begin( 115200 ) ; \/\/ Output to EDBG Virtual COM Port\n#if defined HC06_SERIAL\n hc06_init();\n#endif \/\/ HC06_SERIAL\n\n servos_init();\n\n delay(1000); \/\/ wait for a second\n \/\/ Show we did the setup already\n digitalWrite(LED_BUILTIN, HIGH); \/\/ turn the LED off\n}\n\n\/\/ the loop function runs over and over again forever\nvoid loop(void)\n{\n#if defined HC06_SERIAL\n char c;\n\n if ( HC06_SERIAL.available() )\n \/\/ if text arrived in from BT serial...\n {\n c=HC06_SERIAL.read();\n SERIAL_PORT_MONITOR.print(\"Received:\");\n SERIAL_PORT_MONITOR.println(c);\n\n switch ( c )\n {\n case 'C': \/\/ stop everything\n servo_left.write(90); \/\/\n servo_right.write(90); \/\/\n break;\n\n case 'U':\n \/\/ move robot forward\n servo_left.write(180); \/\/\n servo_right.write(0); \/\/\n break;\n\n case 'D':\n \/\/ move robot backward\n servo_left.write(0); \/\/\n servo_right.write(180); \/\/\n break;\n\n case 'L':\n \/\/ move robot forward\n servo_left.write(180); \/\/\n servo_right.write(180); \/\/\n break;\n\n case 'R':\n \/\/ move robot backward\n servo_left.write(0); \/\/\n servo_right.write(0); \/\/\n break;\n\n default:\n break;\n }\n }\n#endif \/\/ HC06_SERIAL\n}\n<|endoftext|>"} {"text":"<commit_before>#include \"app\/impl\/collider\/simple_collider.h\"\n\n#include <algorithm>\n#include <iterator>\n\n#include \"core\/types\/null.h\"\n#include \"core\/types\/weak_ptr.h\"\n#include \"core\/util\/log.h\"\n\n#include \"graphics\/base\/rect.h\"\n#include \"graphics\/base\/render_object.h\"\n#include \"graphics\/base\/size.h\"\n#include \"graphics\/base\/v2.h\"\n\n#include \"renderer\/base\/resource_loader_context.h\"\n\n#include \"app\/base\/application_context.h\"\n#include \"app\/base\/rigid_body.h\"\n#include \"app\/inf\/collision_callback.h\"\n\nnamespace ark {\n\nnamespace {\n\nclass DynamicPosition : public VV2 {\npublic:\n DynamicPosition(const sp<SimpleCollider::RigidBodyImpl>& rigidBody, const sp<VV>& position)\n : _rigid_body(rigidBody), _position(position), _bounds(0, 0, rigidBody->size()->width(), rigidBody->size()->height()) {\n }\n\n virtual V2 val() override {\n const sp<SimpleCollider::RigidBodyImpl> rigidBody = _rigid_body.ensure();\n const V position = _position->val();\n _bounds.setCenter(position.x(), position.y());\n rigidBody->collision(_bounds);\n rigidBody->update();\n return position;\n }\n\nprivate:\n WeakPtr<SimpleCollider::RigidBodyImpl> _rigid_body;\n sp<VV> _position;\n Rect _bounds;\n};\n\n}\n\nSimpleCollider::SimpleCollider(const sp<ResourceLoaderContext>& resourceLoaderContext)\n : _stub(sp<Stub>::make()), _resource_loader_context(resourceLoaderContext)\n{\n}\n\nSimpleCollider::BUILDER::BUILDER(BeanFactory& factory, const document& manifest, const sp<ResourceLoaderContext>& resourceLoaderContext)\n : _resource_loader_context(resourceLoaderContext)\n{\n}\n\nsp<Collider> SimpleCollider::BUILDER::build(const sp<Scope>& args)\n{\n return sp<SimpleCollider>::make(_resource_loader_context);\n}\n\nsp<RigidBody> SimpleCollider::createBody(Collider::BodyType type, Collider::BodyShape shape, const sp<VV>& position, const sp<Size>& size)\n{\n const sp<RigidBodyImpl> rigidBody = _stub->createRigidBody(type, shape, position, size, _stub);\n\n if(type == Collider::BODY_TYPE_DYNAMIC)\n {\n rigidBody->setPosition(_resource_loader_context->synchronize<V>(sp<DynamicPosition>::make(rigidBody, position)));\n }\n else if(type == Collider::BODY_TYPE_KINEMATIC)\n {\n }\n else if(type == Collider::BODY_TYPE_STATIC)\n {\n }\n return rigidBody;\n}\n\nSimpleCollider::Stub::Stub()\n : _rigid_body_base_id(0)\n{\n}\n\nvoid SimpleCollider::Stub::insert(const sp<RigidBodyImpl>& rigidObject)\n{\n const V position = rigidObject->position()->val();\n const sp<Size>& size = rigidObject->size();\n _x_axis_segment.insert(rigidObject->id(), position.x(), size->width() \/ 2);\n _y_axis_segment.insert(rigidObject->id(), position.y(), size->height() \/ 2);\n}\n\nvoid SimpleCollider::Stub::remove(const RigidBodyImpl& rigidBody)\n{\n _x_axis_segment.remove(rigidBody.id());\n _y_axis_segment.remove(rigidBody.id());\n const auto iter = _rigid_bodies.find(rigidBody.id());\n DCHECK(iter != _rigid_bodies.end(), \"RigidBody(%d) not found\", rigidBody.id());\n LOGD(\"Removing RigidBody(%d)\", rigidBody.id());\n _rigid_bodies.erase(iter);\n}\n\nsp<SimpleCollider::RigidBodyImpl> SimpleCollider::Stub::createRigidBody(Collider::BodyType type, Collider::BodyShape shape, const sp<VV>& position, const sp<Size>& size, const sp<SimpleCollider::Stub>& self)\n{\n const sp<RigidBodyShadow> rigidBodyShadow = sp<RigidBodyShadow>::make(++_rigid_body_base_id, type, shape, position, size);\n const sp<RigidBodyImpl> rigidBody = sp<RigidBodyImpl>::make(position, self, rigidBodyShadow);\n _rigid_bodies[rigidBody->id()] = rigidBodyShadow;\n insert(rigidBody);\n return rigidBody;\n}\n\nconst sp<SimpleCollider::RigidBodyShadow>& SimpleCollider::Stub::findRigidBody(uint32_t id) const\n{\n const auto iter = _rigid_bodies.find(id);\n DCHECK(iter != _rigid_bodies.end(), \"RigidBody(id = %d) does not exists\", id);\n return iter->second;\n}\n\nSimpleCollider::RigidBodyImpl::RigidBodyImpl(const sp<VV>& position, const sp<Stub>& collider, const sp<RigidBodyShadow>& shadow)\n : RigidBody(shadow->id(), shadow->type(), shadow->shape(), position, shadow->size(), Null::ptr<Numeric>()), _collider(collider), _shadow(shadow)\n{\n}\n\nSimpleCollider::RigidBodyImpl::~RigidBodyImpl()\n{\n if(_id > 0)\n _collider->remove(*this);\n}\n\nvoid SimpleCollider::RigidBodyImpl::beginContact(const sp<RigidBody>& rigidBody)\n{\n if(_shadow->collisionCallback())\n _shadow->collisionCallback()->onBeginContact(rigidBody);\n}\n\nvoid SimpleCollider::RigidBodyImpl::endContact(const sp<RigidBody>& rigidBody)\n{\n if(_shadow->collisionCallback())\n _shadow->collisionCallback()->onEndContact(rigidBody);\n}\n\nconst sp<CollisionCallback>& SimpleCollider::RigidBodyImpl::collisionCallback() const\n{\n return _shadow->collisionCallback();\n}\n\nvoid SimpleCollider::RigidBodyImpl::setCollisionCallback(const sp<CollisionCallback>& collisionCallback)\n{\n _shadow->setCollisionCallback(collisionCallback);\n}\n\nvoid SimpleCollider::RigidBodyImpl::dispose()\n{\n DCHECK(_id != 0, \"RigidBody has been disposed already.\");\n _collider->remove(*this);\n _id = 0;\n}\n\nvoid SimpleCollider::RigidBodyImpl::setPosition(const sp<VV>& position)\n{\n _position = position;\n}\n\nvoid SimpleCollider::RigidBodyImpl::collision(const Rect& rect)\n{\n std::set<uint32_t> candidates;\n std::set<uint32_t> contacts = _contacts;\n const std::set<uint32_t> x = _collider->_x_axis_segment.findCandidates(rect.left(), rect.right());\n if(x.size())\n {\n const std::set<uint32_t> y = _collider->_y_axis_segment.findCandidates(rect.top(), rect.bottom());\n std::set_intersection(x.begin(), x.end(), y.begin(), y.end(), std::inserter(candidates, candidates.begin()));\n for(auto iter = candidates.begin(); iter != candidates.end();)\n {\n uint32_t id = *iter;\n if(id == _id)\n {\n iter = candidates.erase(iter);\n continue;\n }\n const sp<RigidBodyShadow>& rigidBody = _collider->findRigidBody(id);\n const sp<Size>& size = rigidBody->size();\n const V position = rigidBody->xy();\n const Rect irect(position.x() - size->width() \/ 2, position.y() - size->height() \/ 2, position.x() + size->width() \/ 2, position.y() + size->height() \/ 2);\n bool overlap = irect.overlap(rect);\n if(overlap)\n {\n auto iter2 = contacts.find(id);\n if(iter2 == contacts.end())\n beginContact(rigidBody);\n else\n contacts.erase(iter2);\n ++iter;\n }\n else\n iter = candidates.erase(iter);\n }\n for(uint32_t i : contacts)\n {\n if(candidates.find(i) == candidates.end())\n endContact(_collider->findRigidBody(i));\n }\n _contacts = candidates;\n }\n}\n\nvoid SimpleCollider::RigidBodyImpl::update()\n{\n const V pos = _position->val();\n _shadow->setPosition(pos);\n _collider->_x_axis_segment.update(_id, pos.x(), _size->width());\n _collider->_y_axis_segment.update(_id, pos.y(), _size->height());\n}\n\nSimpleCollider::RigidBodyShadow::RigidBodyShadow(uint32_t id, Collider::BodyType type, Collider::BodyShape shape, const sp<VV>& pos, const sp<Size>& size)\n : RigidBody(id, type, shape, sp<VV::Impl>::make(pos->val()), size, nullptr)\n{\n _position = static_cast<sp<VV::Impl>>(position());\n}\n\nvoid SimpleCollider::RigidBodyShadow::dispose()\n{\n FATAL(\"RigidBody may not be disposed\");\n}\n\nconst sp<CollisionCallback>& SimpleCollider::RigidBodyShadow::collisionCallback() const\n{\n return _collision_callback;\n}\n\nvoid SimpleCollider::RigidBodyShadow::setCollisionCallback(const sp<CollisionCallback>& collisionCallback)\n{\n _collision_callback = collisionCallback;\n}\n\nvoid SimpleCollider::RigidBodyShadow::setPosition(const V& pos)\n{\n _position->set(pos);\n}\n\n}\n<commit_msg>simple collider bug fix<commit_after>#include \"app\/impl\/collider\/simple_collider.h\"\n\n#include <algorithm>\n#include <iterator>\n\n#include \"core\/types\/null.h\"\n#include \"core\/types\/weak_ptr.h\"\n#include \"core\/util\/log.h\"\n\n#include \"graphics\/base\/rect.h\"\n#include \"graphics\/base\/render_object.h\"\n#include \"graphics\/base\/size.h\"\n#include \"graphics\/base\/v2.h\"\n\n#include \"renderer\/base\/resource_loader_context.h\"\n\n#include \"app\/base\/application_context.h\"\n#include \"app\/base\/rigid_body.h\"\n#include \"app\/inf\/collision_callback.h\"\n\nnamespace ark {\n\nnamespace {\n\nclass DynamicPosition : public VV2 {\npublic:\n DynamicPosition(const sp<SimpleCollider::RigidBodyImpl>& rigidBody, const sp<VV>& position)\n : _rigid_body(rigidBody), _position(position), _bounds(0, 0, rigidBody->size()->width(), rigidBody->size()->height()) {\n }\n\n virtual V2 val() override {\n const sp<SimpleCollider::RigidBodyImpl> rigidBody = _rigid_body.lock();\n const V position = _position->val();\n if(rigidBody && rigidBody->id()) {\n _bounds.setCenter(position.x(), position.y());\n rigidBody->collision(_bounds);\n rigidBody->update();\n }\n return position;\n }\n\nprivate:\n WeakPtr<SimpleCollider::RigidBodyImpl> _rigid_body;\n sp<VV> _position;\n Rect _bounds;\n};\n\n}\n\nSimpleCollider::SimpleCollider(const sp<ResourceLoaderContext>& resourceLoaderContext)\n : _stub(sp<Stub>::make()), _resource_loader_context(resourceLoaderContext)\n{\n}\n\nSimpleCollider::BUILDER::BUILDER(BeanFactory& factory, const document& manifest, const sp<ResourceLoaderContext>& resourceLoaderContext)\n : _resource_loader_context(resourceLoaderContext)\n{\n}\n\nsp<Collider> SimpleCollider::BUILDER::build(const sp<Scope>& args)\n{\n return sp<SimpleCollider>::make(_resource_loader_context);\n}\n\nsp<RigidBody> SimpleCollider::createBody(Collider::BodyType type, Collider::BodyShape shape, const sp<VV>& position, const sp<Size>& size)\n{\n const sp<RigidBodyImpl> rigidBody = _stub->createRigidBody(type, shape, position, size, _stub);\n\n if(type == Collider::BODY_TYPE_DYNAMIC)\n {\n rigidBody->setPosition(_resource_loader_context->synchronize<V>(sp<DynamicPosition>::make(rigidBody, position)));\n }\n else if(type == Collider::BODY_TYPE_KINEMATIC)\n {\n }\n else if(type == Collider::BODY_TYPE_STATIC)\n {\n }\n return rigidBody;\n}\n\nSimpleCollider::Stub::Stub()\n : _rigid_body_base_id(0)\n{\n}\n\nvoid SimpleCollider::Stub::insert(const sp<RigidBodyImpl>& rigidObject)\n{\n const V position = rigidObject->position()->val();\n const sp<Size>& size = rigidObject->size();\n _x_axis_segment.insert(rigidObject->id(), position.x(), size->width() \/ 2);\n _y_axis_segment.insert(rigidObject->id(), position.y(), size->height() \/ 2);\n}\n\nvoid SimpleCollider::Stub::remove(const RigidBodyImpl& rigidBody)\n{\n _x_axis_segment.remove(rigidBody.id());\n _y_axis_segment.remove(rigidBody.id());\n const auto iter = _rigid_bodies.find(rigidBody.id());\n DCHECK(iter != _rigid_bodies.end(), \"RigidBody(%d) not found\", rigidBody.id());\n LOGD(\"Removing RigidBody(%d)\", rigidBody.id());\n _rigid_bodies.erase(iter);\n}\n\nsp<SimpleCollider::RigidBodyImpl> SimpleCollider::Stub::createRigidBody(Collider::BodyType type, Collider::BodyShape shape, const sp<VV>& position, const sp<Size>& size, const sp<SimpleCollider::Stub>& self)\n{\n const sp<RigidBodyShadow> rigidBodyShadow = sp<RigidBodyShadow>::make(++_rigid_body_base_id, type, shape, position, size);\n const sp<RigidBodyImpl> rigidBody = sp<RigidBodyImpl>::make(position, self, rigidBodyShadow);\n _rigid_bodies[rigidBody->id()] = rigidBodyShadow;\n insert(rigidBody);\n return rigidBody;\n}\n\nconst sp<SimpleCollider::RigidBodyShadow>& SimpleCollider::Stub::findRigidBody(uint32_t id) const\n{\n const auto iter = _rigid_bodies.find(id);\n DCHECK(iter != _rigid_bodies.end(), \"RigidBody(id = %d) does not exists\", id);\n return iter->second;\n}\n\nSimpleCollider::RigidBodyImpl::RigidBodyImpl(const sp<VV>& position, const sp<Stub>& collider, const sp<RigidBodyShadow>& shadow)\n : RigidBody(shadow->id(), shadow->type(), shadow->shape(), position, shadow->size(), Null::ptr<Numeric>()), _collider(collider), _shadow(shadow)\n{\n}\n\nSimpleCollider::RigidBodyImpl::~RigidBodyImpl()\n{\n if(_id > 0)\n _collider->remove(*this);\n}\n\nvoid SimpleCollider::RigidBodyImpl::beginContact(const sp<RigidBody>& rigidBody)\n{\n if(_shadow->collisionCallback())\n _shadow->collisionCallback()->onBeginContact(rigidBody);\n}\n\nvoid SimpleCollider::RigidBodyImpl::endContact(const sp<RigidBody>& rigidBody)\n{\n if(_shadow->collisionCallback())\n _shadow->collisionCallback()->onEndContact(rigidBody);\n}\n\nconst sp<CollisionCallback>& SimpleCollider::RigidBodyImpl::collisionCallback() const\n{\n return _shadow->collisionCallback();\n}\n\nvoid SimpleCollider::RigidBodyImpl::setCollisionCallback(const sp<CollisionCallback>& collisionCallback)\n{\n _shadow->setCollisionCallback(collisionCallback);\n}\n\nvoid SimpleCollider::RigidBodyImpl::dispose()\n{\n DCHECK(_id != 0, \"RigidBody has been disposed already.\");\n _collider->remove(*this);\n _id = 0;\n}\n\nvoid SimpleCollider::RigidBodyImpl::setPosition(const sp<VV>& position)\n{\n _position = position;\n}\n\nvoid SimpleCollider::RigidBodyImpl::collision(const Rect& rect)\n{\n std::set<uint32_t> candidates;\n std::set<uint32_t> contacts = _contacts;\n const std::set<uint32_t> x = _collider->_x_axis_segment.findCandidates(rect.left(), rect.right());\n if(x.size())\n {\n const std::set<uint32_t> y = _collider->_y_axis_segment.findCandidates(rect.top(), rect.bottom());\n std::set_intersection(x.begin(), x.end(), y.begin(), y.end(), std::inserter(candidates, candidates.begin()));\n for(auto iter = candidates.begin(); iter != candidates.end();)\n {\n uint32_t id = *iter;\n if(id == _id)\n {\n iter = candidates.erase(iter);\n continue;\n }\n const sp<RigidBodyShadow>& rigidBody = _collider->findRigidBody(id);\n const sp<Size>& size = rigidBody->size();\n const V position = rigidBody->xy();\n const Rect irect(position.x() - size->width() \/ 2, position.y() - size->height() \/ 2, position.x() + size->width() \/ 2, position.y() + size->height() \/ 2);\n bool overlap = irect.overlap(rect);\n if(overlap)\n {\n auto iter2 = contacts.find(id);\n if(iter2 == contacts.end())\n beginContact(rigidBody);\n else\n contacts.erase(iter2);\n ++iter;\n }\n else\n iter = candidates.erase(iter);\n }\n for(uint32_t i : contacts)\n {\n if(candidates.find(i) == candidates.end())\n endContact(_collider->findRigidBody(i));\n }\n _contacts = candidates;\n }\n}\n\nvoid SimpleCollider::RigidBodyImpl::update()\n{\n const V pos = _position->val();\n _shadow->setPosition(pos);\n _collider->_x_axis_segment.update(_id, pos.x(), _size->width());\n _collider->_y_axis_segment.update(_id, pos.y(), _size->height());\n}\n\nSimpleCollider::RigidBodyShadow::RigidBodyShadow(uint32_t id, Collider::BodyType type, Collider::BodyShape shape, const sp<VV>& pos, const sp<Size>& size)\n : RigidBody(id, type, shape, sp<VV::Impl>::make(pos->val()), size, nullptr)\n{\n _position = static_cast<sp<VV::Impl>>(position());\n}\n\nvoid SimpleCollider::RigidBodyShadow::dispose()\n{\n FATAL(\"RigidBody may not be disposed\");\n}\n\nconst sp<CollisionCallback>& SimpleCollider::RigidBodyShadow::collisionCallback() const\n{\n return _collision_callback;\n}\n\nvoid SimpleCollider::RigidBodyShadow::setCollisionCallback(const sp<CollisionCallback>& collisionCallback)\n{\n _collision_callback = collisionCallback;\n}\n\nvoid SimpleCollider::RigidBodyShadow::setPosition(const V& pos)\n{\n _position->set(pos);\n}\n\n}\n<|endoftext|>"} {"text":"<commit_before>#include \"batch.h\"\n#include \"..\/accumulator.h\"\n#include \"..\/sampler.h\"\n#include \"..\/util\/logger.h\"\n#include \"..\/util\/log_search.hpp\"\n#include \"..\/util\/timer.h\"\n#include \"..\/thread\/thread.h\"\n#include \"..\/minimize.h\"\n\nnamespace ncv\n{\n namespace detail\n {\n \/\/\/\n \/\/\/ \\brief restore the original sampler at destruction\n \/\/\/\n struct sampler_backup_t\n {\n sampler_backup_t(trainer_data_t& data, size_t tsize)\n : m_data(data),\n m_tsampler_orig(data.m_tsampler)\n {\n \/\/ FIXED random subset of training samples\n data.m_tsampler.setup(sampler_t::stype::uniform, tsize);\n data.m_tsampler = sampler_t(data.m_tsampler.get());\n }\n\n ~sampler_backup_t()\n {\n m_data.m_tsampler = m_tsampler_orig;\n }\n\n trainer_data_t& m_data;\n const sampler_t m_tsampler_orig;\n };\n\n static scalar_t tune(\n trainer_data_t& data,\n batch_optimizer optimizer,\n size_t batch, size_t iterations, scalar_t epsilon)\n {\n const size_t epochs = 1;\n const size_t epoch_size = (data.m_tsampler.size() + batch - 1) \/ batch;\n\n \/\/ construct the optimization problem\n auto fn_size = ncv::make_opsize(data);\n auto fn_fval = ncv::make_opfval(data);\n auto fn_grad = ncv::make_opgrad(data);\n\n auto fn_wlog = nullptr;\n auto fn_elog = nullptr;\n auto fn_ulog = nullptr;\n\n \/\/ optimize the model\n vector_t x = data.m_x0;\n\n for (size_t epoch = 1; epoch <= epochs; epoch ++)\n {\n for (size_t i = 0; i < epoch_size; i ++)\n {\n const sampler_backup_t sampler_data(data, batch);\n\n const opt_state_t state = ncv::minimize(\n fn_size, fn_fval, fn_grad, fn_wlog, fn_elog, fn_ulog,\n x, optimizer, iterations, epsilon);\n\n x = state.x;\n }\n }\n\n \/\/ OK, cumulate the loss value\n data.m_lacc.reset(x);\n data.m_lacc.update(data.m_task, data.m_tsampler.all(), data.m_loss);\n return data.m_lacc.value();\n }\n\n static trainer_result_t train(\n trainer_data_t& data,\n batch_optimizer optimizer,\n size_t epochs, size_t batch, size_t iterations, scalar_t epsilon, bool verbose)\n {\n trainer_result_t result;\n\n const ncv::timer_t timer;\n\n const size_t epoch_size = (data.m_tsampler.size() + batch - 1) \/ batch;\n\n \/\/ construct the optimization problem\n auto fn_size = ncv::make_opsize(data);\n auto fn_fval = ncv::make_opfval(data);\n auto fn_grad = ncv::make_opgrad(data);\n\n auto fn_wlog = verbose ? ncv::make_opwlog() : nullptr;\n auto fn_elog = verbose ? ncv::make_opelog() : nullptr;\n auto fn_ulog = nullptr;\n\n \/\/ optimize the model\n vector_t x = data.m_x0;\n\n for (size_t epoch = 1; epoch <= epochs; epoch ++)\n {\n for (size_t i = 0; i < epoch_size; i ++)\n {\n const sampler_backup_t sampler_data(data, batch);\n\n const opt_state_t state = ncv::minimize(\n fn_size, fn_fval, fn_grad, fn_wlog, fn_elog, fn_ulog,\n x, optimizer, iterations, epsilon);\n\n x = state.x;\n }\n\n \/\/ training samples: loss value\n data.m_lacc.reset(x);\n data.m_lacc.update(data.m_task, data.m_tsampler.all(), data.m_loss);\n const scalar_t tvalue = data.m_lacc.value();\n const scalar_t terror_avg = data.m_lacc.avg_error();\n const scalar_t terror_var = data.m_lacc.var_error();\n\n \/\/ validation samples: loss value\n data.m_lacc.reset(x);\n data.m_lacc.update(data.m_task, data.m_vsampler.get(), data.m_loss);\n const scalar_t vvalue = data.m_lacc.value();\n const scalar_t verror_avg = data.m_lacc.avg_error();\n const scalar_t verror_var = data.m_lacc.var_error();\n\n \/\/ update the optimum state\n result.update(x, tvalue, terror_avg, terror_var, vvalue, verror_avg, verror_var,\n epoch, scalars_t({ static_cast<scalar_t>(batch),\n static_cast<scalar_t>(iterations),\n data.m_lacc.lambda() }));\n\n if (verbose)\n log_info()\n << \"[train = \" << tvalue << \"\/\" << terror_avg\n << \", valid = \" << vvalue << \"\/\" << verror_avg\n << \", xnorm = \" << x.lpNorm<Eigen::Infinity>()\n << \", epoch = \" << epoch << \"\/\" << epochs\n << \", batch = \" << batch\n << \", iters = \" << iterations\n << \", lambda = \" << data.m_lacc.lambda()\n << \"] done in \" << timer.elapsed() << \".\";\n }\n\n return result;\n }\n }\n\n trainer_result_t minibatch_train(\n const model_t& model, const task_t& task, const sampler_t& tsampler, const sampler_t& vsampler, size_t nthreads,\n const loss_t& loss, const string_t& criterion,\n batch_optimizer optimizer, size_t epochs, scalar_t epsilon,\n bool verbose)\n {\n vector_t x0;\n model.save_params(x0);\n\n \/\/ operator to train for a given regularization factor\n const auto op = [&] (scalar_t lambda)\n {\n accumulator_t lacc(model, nthreads, criterion, criterion_t::type::value, lambda);\n accumulator_t gacc(model, nthreads, criterion, criterion_t::type::vgrad, lambda);\n\n trainer_data_t data(task, tsampler, vsampler, loss, x0, lacc, gacc);\n\n const size_t min_batch = 16 * ncv::n_threads();\n const size_t max_batch = 16 * min_batch;\n\n const indices_t batch_iterations = { 4, 8 };\n\n scalar_t opt_state = std::numeric_limits<scalar_t>::max();\n size_t opt_batch = min_batch;\n size_t opt_iterations = 4;\n\n \/\/ tune the batch size and the number of optimization iterations per batch\n for (size_t batch = min_batch; batch <= max_batch; batch *= 2)\n {\n for (size_t iterations : batch_iterations)\n {\n const ncv::timer_t timer;\n\n const scalar_t state =\n detail::tune(data, optimizer, batch, iterations, epsilon);\n\n if (verbose)\n log_info()\n << \"[tuning: loss = \" << state\n << \", batch = \" << batch\n << \", iters = \" << iterations\n << \", lambda = \" << data.m_lacc.lambda()\n << \"] done in \" << timer.elapsed() << \".\";\n\n if (state < opt_state)\n {\n opt_state = state;\n opt_batch = batch;\n opt_iterations = iterations;\n }\n }\n }\n\n \/\/ train the model using the tuned parameters\n return detail::train(data, optimizer, epochs, opt_batch, opt_iterations, epsilon, verbose);\n };\n\n \/\/ tune the regularization factor (if needed)\n if (accumulator_t::can_regularize(criterion))\n {\n return log10_min_search(op, -4.0, +4.0, 0.2, 4).first;\n }\n\n else\n {\n return op(0.0);\n }\n }\n}\n\t\n<commit_msg>faster minibatch: save copying the training samples<commit_after>#include \"batch.h\"\n#include \"..\/accumulator.h\"\n#include \"..\/sampler.h\"\n#include \"..\/util\/logger.h\"\n#include \"..\/util\/log_search.hpp\"\n#include \"..\/util\/timer.h\"\n#include \"..\/thread\/thread.h\"\n#include \"..\/minimize.h\"\n\nnamespace ncv\n{\n namespace detail\n {\n static void setup_minibatch(sampler_t& orig_tsampler, size_t tsize, trainer_data_t& data)\n {\n \/\/ FIXED random subset of training samples\n orig_tsampler.setup(sampler_t::stype::uniform, tsize);\n data.m_tsampler = sampler_t(orig_tsampler.get());\n }\n\n static void reset_minibatch(sampler_t& orig_tsampler, trainer_data_t& data)\n {\n \/\/ all available training samples\n orig_tsampler.setup(sampler_t::stype::batch);\n data.m_tsampler = orig_tsampler;\n }\n\n template\n <\n typename toperator\n >\n static void train(trainer_data_t& data, size_t epoch_size, size_t batch, const toperator& op)\n {\n sampler_t orig_tsampler = data.m_tsampler;\n\n for (size_t i = 0; i < epoch_size; i ++)\n {\n setup_minibatch(orig_tsampler, batch, data);\n\n op();\n }\n\n reset_minibatch(orig_tsampler, data);\n }\n\n static scalar_t tune(\n trainer_data_t& data,\n batch_optimizer optimizer,\n size_t batch, size_t iterations, scalar_t epsilon)\n {\n const size_t epochs = 1;\n const size_t epoch_size = (data.m_tsampler.size() + batch - 1) \/ batch;\n\n \/\/ construct the optimization problem\n auto fn_size = ncv::make_opsize(data);\n auto fn_fval = ncv::make_opfval(data);\n auto fn_grad = ncv::make_opgrad(data);\n\n auto fn_wlog = nullptr;\n auto fn_elog = nullptr;\n auto fn_ulog = nullptr;\n\n \/\/ optimize the model\n vector_t x = data.m_x0;\n\n for (size_t epoch = 1; epoch <= epochs; epoch ++)\n {\n train(data, epoch_size, batch, [&] ()\n {\n const opt_state_t state = ncv::minimize(\n fn_size, fn_fval, fn_grad, fn_wlog, fn_elog, fn_ulog,\n x, optimizer, iterations, epsilon);\n\n x = state.x;\n });\n }\n\n \/\/ OK, cumulate the loss value\n data.m_lacc.reset(x);\n data.m_lacc.update(data.m_task, data.m_tsampler.all(), data.m_loss);\n return data.m_lacc.value();\n }\n\n static trainer_result_t train(\n trainer_data_t& data,\n batch_optimizer optimizer,\n size_t epochs, size_t batch, size_t iterations, scalar_t epsilon, bool verbose)\n {\n const ncv::timer_t timer;\n\n const size_t epoch_size = (data.m_tsampler.size() + batch - 1) \/ batch;\n\n trainer_result_t result;\n\n \/\/ construct the optimization problem\n auto fn_size = ncv::make_opsize(data);\n auto fn_fval = ncv::make_opfval(data);\n auto fn_grad = ncv::make_opgrad(data);\n\n auto fn_wlog = verbose ? ncv::make_opwlog() : nullptr;\n auto fn_elog = verbose ? ncv::make_opelog() : nullptr;\n auto fn_ulog = nullptr;\n\n \/\/ optimize the model\n vector_t x = data.m_x0;\n\n for (size_t epoch = 1; epoch <= epochs; epoch ++)\n {\n train(data, epoch_size, batch, [&] ()\n {\n const opt_state_t state = ncv::minimize(\n fn_size, fn_fval, fn_grad, fn_wlog, fn_elog, fn_ulog,\n x, optimizer, iterations, epsilon);\n\n x = state.x;\n });\n\n \/\/ training samples: loss value\n data.m_lacc.reset(x);\n data.m_lacc.update(data.m_task, data.m_tsampler.all(), data.m_loss);\n const scalar_t tvalue = data.m_lacc.value();\n const scalar_t terror_avg = data.m_lacc.avg_error();\n const scalar_t terror_var = data.m_lacc.var_error();\n\n \/\/ validation samples: loss value\n data.m_lacc.reset(x);\n data.m_lacc.update(data.m_task, data.m_vsampler.get(), data.m_loss);\n const scalar_t vvalue = data.m_lacc.value();\n const scalar_t verror_avg = data.m_lacc.avg_error();\n const scalar_t verror_var = data.m_lacc.var_error();\n\n \/\/ update the optimum state\n result.update(x, tvalue, terror_avg, terror_var, vvalue, verror_avg, verror_var,\n epoch, scalars_t({ static_cast<scalar_t>(batch),\n static_cast<scalar_t>(iterations),\n data.m_lacc.lambda() }));\n\n if (verbose)\n log_info()\n << \"[train = \" << tvalue << \"\/\" << terror_avg\n << \", valid = \" << vvalue << \"\/\" << verror_avg\n << \", xnorm = \" << x.lpNorm<Eigen::Infinity>()\n << \", epoch = \" << epoch << \"\/\" << epochs\n << \", batch = \" << batch\n << \", iters = \" << iterations\n << \", lambda = \" << data.m_lacc.lambda()\n << \"] done in \" << timer.elapsed() << \".\";\n }\n\n return result;\n }\n }\n\n trainer_result_t minibatch_train(\n const model_t& model, const task_t& task, const sampler_t& tsampler, const sampler_t& vsampler, size_t nthreads,\n const loss_t& loss, const string_t& criterion,\n batch_optimizer optimizer, size_t epochs, scalar_t epsilon,\n bool verbose)\n {\n vector_t x0;\n model.save_params(x0);\n\n \/\/ operator to train for a given regularization factor\n const auto op = [&] (scalar_t lambda)\n {\n accumulator_t lacc(model, nthreads, criterion, criterion_t::type::value, lambda);\n accumulator_t gacc(model, nthreads, criterion, criterion_t::type::vgrad, lambda);\n\n trainer_data_t data(task, tsampler, vsampler, loss, x0, lacc, gacc);\n\n const size_t min_batch = 16 * ncv::n_threads();\n const size_t max_batch = 16 * min_batch;\n\n const indices_t batch_iterations = { 4, 8 };\n\n scalar_t opt_state = std::numeric_limits<scalar_t>::max();\n size_t opt_batch = min_batch;\n size_t opt_iterations = 4;\n\n \/\/ tune the batch size and the number of optimization iterations per batch\n for (size_t batch = min_batch; batch <= max_batch; batch *= 2)\n {\n for (size_t iterations : batch_iterations)\n {\n const ncv::timer_t timer;\n\n const scalar_t state =\n detail::tune(data, optimizer, batch, iterations, epsilon);\n\n if (verbose)\n log_info()\n << \"[tuning: loss = \" << state\n << \", batch = \" << batch\n << \", iters = \" << iterations\n << \", lambda = \" << data.m_lacc.lambda()\n << \"] done in \" << timer.elapsed() << \".\";\n\n if (state < opt_state)\n {\n opt_state = state;\n opt_batch = batch;\n opt_iterations = iterations;\n }\n }\n }\n\n \/\/ train the model using the tuned parameters\n return detail::train(data, optimizer, epochs, opt_batch, opt_iterations, epsilon, verbose);\n };\n\n \/\/ tune the regularization factor (if needed)\n if (accumulator_t::can_regularize(criterion))\n {\n return log10_min_search(op, -4.0, +4.0, 0.2, 4).first;\n }\n\n else\n {\n return op(0.0);\n }\n }\n}\n\t\n<|endoftext|>"} {"text":"<commit_before>\/\/ Copyright 2014 BVLC and contributors.\n\n#include <algorithm>\n#include <cmath>\n#include <cfloat>\n#include <vector>\n#include <string>\n#include <fstream>\n#include <iostream>\n#include <iomanip>\n\n#include \"caffe\/layer.hpp\"\n#include \"caffe\/vision_layers.hpp\"\n#include \"caffe\/util\/math_functions.hpp\"\n#include \"caffe\/util\/io.hpp\"\n\nusing std::max;\n\nnamespace caffe {\n\ntemplate <typename Dtype>\nvoid L2LossLayer<Dtype>::FurtherSetUp(\n const vector<Blob<Dtype>*>& bottom, vector<Blob<Dtype>*>* top) {\n CHECK_EQ(bottom[0]->channels(), bottom[1]->channels());\n CHECK_EQ(bottom[0]->height(), bottom[1]->height());\n CHECK_EQ(bottom[0]->width(), bottom[1]->width());\n diff_.Reshape(bottom[0]->num(), bottom[0]->channels(),\n bottom[0]->height(), bottom[0]->width());\n}\n\ntemplate <typename Dtype>\nDtype L2LossLayer<Dtype>::Forward_cpu(const vector<Blob<Dtype>*>& bottom,\n vector<Blob<Dtype>*>* top) {\n int count = bottom[0]->count();\n const Dtype *data0 = bottom[0]->cpu_data();\n const Dtype *data1 = bottom[1]->cpu_data();\n for (int i = 0; i < 4; i++) {\n std::cout << data0[i] << \", \" << data1[i] << std::endl;\n }\n caffe_sub(\n count,\n bottom[0]->cpu_data(),\n bottom[1]->cpu_data(),\n diff_.mutable_cpu_data());\n Dtype dot = caffe_cpu_dot(count, diff_.cpu_data(), diff_.cpu_data());\n Dtype loss = dot \/ bottom[0]->num() \/ Dtype(2);\n return loss;\n}\n\ntemplate <typename Dtype>\nvoid L2LossLayer<Dtype>::Backward_cpu(const vector<Blob<Dtype>*>& top,\n const bool propagate_down, vector<Blob<Dtype>*>* bottom) {\n caffe_cpu_axpby(\n (*bottom)[0]->count(),\n Dtype(1) \/ (*bottom)[0]->num(),\n diff_.cpu_data(),\n Dtype(0),\n (*bottom)[0]->mutable_cpu_diff());\n}\n\ntemplate <typename Dtype>\nvoid EuclideanLossLayer<Dtype>::FurtherSetUp(\n const vector<Blob<Dtype>*>& bottom, vector<Blob<Dtype>*>* top) {\n CHECK_EQ(bottom[0]->channels(), label_length_);\n CHECK_EQ(bottom[0]->height(), bottom[1]->height());\n CHECK_EQ(bottom[0]->width(), bottom[1]->width());\n diff_.Reshape(bottom[0]->num(), bottom[0]->channels(),\n bottom[0]->height(), bottom[0]->width());\n\n LOG(INFO)<<\"START LOAD LABEL_CODE_TABLE\";\n \/\/ label_length_=255;\n CHECK_EQ(bottom[0]->channels(), label_length_)\n << \" predict output channels shoud be same as label code \"<<std::endl;\n\n \/\/ label_class_num_=201;\n LOG(INFO)<<\"Start load label_code_table file\";\n std::ifstream infile(code_file_.c_str());\n CHECK(infile.good()) << \"Failed to open target code file: \" << code_file_ << std::endl;\n\n int label_class_num_ = label_length_;\n for(int i = 0; i < label_class_num_; ++i){\n \/\/ LOG(INFO)<< \"START LOAD LABEL_CODE INDEX: \"<<i<<\"-\"<<label_class_num_;\n vector<Dtype> label_code;\n for(int j = 0; j < label_length_; ++j){\n \/\/LOG(INFO) << \"start load label_code bit index: \"<< j<<\"-\"<< label_length_;\n Dtype label_bit;\n infile >> label_bit;\n label_code.push_back(label_bit);\n }\n label_code_table_.push_back(label_code);\n }\n LOG(INFO)<<\"END LOADING LABEL_CODE_TABLE\";\n infile.close();\n}\n\ntemplate <typename Dtype>\nDtype EuclideanLossLayer<Dtype>::Forward_cpu(const vector<Blob<Dtype>*>& bottom,\n vector<Blob<Dtype>*>* top) {\n int count = bottom[0]->count();\n\n Blob<Dtype> gt_target_code(bottom[0]->num(),bottom[0]->channels(),bottom[0]->height(),bottom[0]->width());\n CHECK_EQ(bottom[0]->height(),1);\n CHECK_EQ(bottom[0]->width(),1);\n for(int i=0;i<bottom[0]->num();++i){\n for(int j=0;j<bottom[0]->channels();++j){\n *(gt_target_code.mutable_cpu_data() + gt_target_code.offset(i,j))\n = label_code_table_[bottom[1]->cpu_data()[i]][j];\n }\n }\n caffe_sub(\n count,\n bottom[0]->cpu_data(),\n gt_target_code.cpu_data(),\n diff_.mutable_cpu_data());\n\n \/\/ for (int i = 0; i < 10; i++) {\n \/\/ std::cout << std::setprecision(3) << bottom[0]->cpu_data()[i] << \",\"\n \/\/ << gt_target_code.cpu_data()[i] << \" \";\n \/\/ }\n \/\/ std::cout << std::endl;\n Dtype dot = caffe_cpu_dot(count, diff_.cpu_data(), diff_.cpu_data());\n Dtype loss = sqrt(dot \/ bottom[0]->num() \/ label_length_);\n \/\/LOG(INFO)<< dot << \" \" << bottom[0]->num() << \" \" << bottom[0]->data_at(0, 0, 0, 0);\n return loss;\n}\n\ntemplate <typename Dtype>\nvoid EuclideanLossLayer<Dtype>::Backward_cpu(const vector<Blob<Dtype>*>& top,\n const bool propagate_down, vector<Blob<Dtype>*>* bottom) {\n caffe_cpu_axpby(\n (*bottom)[0]->count(), \/\/ count\n Dtype(1) \/ (*bottom)[0]->num(), \/\/ alpha\n diff_.cpu_data(), \/\/ a\n Dtype(0), \/\/ beta\n (*bottom)[0]->mutable_cpu_diff()); \/\/ b\n}\n\ntemplate <typename Dtype>\nvoid TargetCodingHingeLossLayer<Dtype>::FurtherSetUp(\n const vector<Blob<Dtype>*>& bottom, vector<Blob<Dtype>*>* top) {\n CHECK_EQ(bottom[0]->channels(), label_length_);\n CHECK_EQ(bottom[0]->height(), bottom[1]->height());\n CHECK_EQ(bottom[0]->width(), bottom[1]->width());\n gt_label_code_.Reshape(bottom[0]->num(), bottom[0]->channels(),\n bottom[0]->height(), bottom[0]->width());\n\n LOG(INFO)<<\"START LOAD LABEL_CODE_TABLE\";\n \/\/ label_length_=255;\n CHECK_EQ(bottom[0]->channels(), label_length_)\n << \" predict output channels shoud be same as label code \"<<std::endl;\n\n std::ifstream infile(code_file_.c_str());\n CHECK(infile.good()) << \"Failed to open target code file: \" << code_file_ << std::endl;\n\n int label_class_num_ = label_length_;\n for(int i = 0; i < label_class_num_; ++i){\n vector<Dtype> label_code;\n for(int j = 0; j < label_length_; ++j){\n Dtype label_bit;\n infile >> label_bit;\n label_code.push_back(label_bit);\n }\n label_code_table_.push_back(label_code);\n }\n LOG(INFO)<<\"END LOADING LABEL_CODE_TABLE\";\n infile.close();\n}\n\ntemplate <typename Dtype>\nDtype TargetCodingHingeLossLayer<Dtype>::Forward_cpu(const vector<Blob<Dtype>*>& bottom,\n vector<Blob<Dtype>*>* top) {\n\n CHECK_EQ(bottom[0]->height(), 1);\n CHECK_EQ(bottom[0]->width(), 1);\n int num = bottom[0]->num();\n int count = bottom[0]->count();\n int dim = count \/ num;\n CHECK_EQ(dim, label_length_);\n const Dtype* bottom_data = bottom[0]->cpu_data();\n Dtype* bottom_diff = bottom[0]->mutable_cpu_diff();\n const Dtype* label = bottom[1]->cpu_data();\n Dtype* label_code = gt_label_code_.mutable_cpu_data();\n\n for(int i = 0; i < bottom[0]->num(); ++i){\n for(int j = 0; j < bottom[0]->channels(); ++j){\n *(label_code + gt_label_code_.offset(i,j))\n = label_code_table_[label[i]][j];\n }\n }\n\n caffe_copy(count, bottom_data, bottom_diff);\n caffe_add_scalar(count, Dtype(-0.5), bottom_diff); \/\/ b-0.5\n caffe_scal(count, Dtype(-2), label_code);\n caffe_add_scalar(count, Dtype(1), label_code); \/\/ 1-2*gt\n caffe_mul(count, bottom_diff, label_code, bottom_diff);\n for (int i = 0; i < num; i++) {\n for (int j = 0; j < dim; j++) {\n bottom_diff[i * dim + j] = max(Dtype(0), margin_ + bottom_diff[i * dim + j]);\n }\n }\n\n \/\/Dtype dot = caffe_cpu_dot(count, diff_.cpu_data(), diff_.cpu_data());\n Dtype loss = caffe_cpu_asum(count, bottom_diff) \/ num \/ label_length_; \/\/ hinge loss\n loss = Dtype(0.5) - margin_ + loss; \/\/ loss relative to the groudtruth\n \/\/LOG(INFO)<< dot << \" \" << bottom[0]->num() << \" \" << bottom[0]->data_at(0, 0, 0, 0);\n return loss;\n}\n\ntemplate <typename Dtype>\nvoid TargetCodingHingeLossLayer<Dtype>::Backward_cpu(const vector<Blob<Dtype>*>& top,\n const bool propagate_down, vector<Blob<Dtype>*>* bottom) {\n Dtype *bottom_diff = (*bottom)[0]->mutable_cpu_diff();\n const Dtype *label_code = gt_label_code_.mutable_cpu_data();\n int num = (*bottom)[0]->num();\n int count = (*bottom)[0]->count();\n const Dtype* bottom_data = (*bottom)[0]->cpu_data();\n\n caffe_cpu_sign(count, bottom_diff, bottom_diff);\n caffe_mul(count, bottom_diff, label_code, bottom_diff);\n caffe_scal(count, Dtype(1. \/ num), bottom_diff);\n\n \/\/ for (int i = 512; i < 512 + 5; i++) {\n \/\/ std::cout << std::setprecision(3) << bottom_data[i] << \",\"\n \/\/ << label_code[i] << \",\" << bottom_diff[i] << \" \";\n \/\/ }\n \/\/ std::cout << std::endl;\n}\n\nINSTANTIATE_CLASS(L2LossLayer);\n\nINSTANTIATE_CLASS(EuclideanLossLayer);\n\n\nINSTANTIATE_CLASS(Euclidean1023LossLayer);\n\n\nINSTANTIATE_CLASS(Euclidean255LossLayer);\n\nINSTANTIATE_CLASS(TargetCodingHingeLossLayer);\n\nINSTANTIATE_CLASS(TargetCoding1023HingeLossLayer);\n\n} \/\/ namespace caffe\n<commit_msg>loss layer modified<commit_after>\/\/ Copyright 2014 BVLC and contributors.\n\n#include <algorithm>\n#include <cmath>\n#include <cfloat>\n#include <vector>\n#include <string>\n#include <fstream>\n#include <iostream>\n#include <iomanip>\n\n#include \"caffe\/layer.hpp\"\n#include \"caffe\/vision_layers.hpp\"\n#include \"caffe\/util\/math_functions.hpp\"\n#include \"caffe\/util\/io.hpp\"\n\nusing std::max;\n\nnamespace caffe {\n\ntemplate <typename Dtype>\nvoid L2LossLayer<Dtype>::FurtherSetUp(\n const vector<Blob<Dtype>*>& bottom, vector<Blob<Dtype>*>* top) {\n CHECK_EQ(bottom[0]->channels(), bottom[1]->channels());\n CHECK_EQ(bottom[0]->height(), bottom[1]->height());\n CHECK_EQ(bottom[0]->width(), bottom[1]->width());\n diff_.Reshape(bottom[0]->num(), bottom[0]->channels(),\n bottom[0]->height(), bottom[0]->width());\n}\n\ntemplate <typename Dtype>\nDtype L2LossLayer<Dtype>::Forward_cpu(const vector<Blob<Dtype>*>& bottom,\n vector<Blob<Dtype>*>* top) {\n int count = bottom[0]->count();\n const Dtype *data0 = bottom[0]->cpu_data();\n const Dtype *data1 = bottom[1]->cpu_data();\n \/\/ for (int i = 0; i < 4; i++) {\n \/\/ std::cout << data0[i] << \", \" << data1[i] << std::endl;\n \/\/ }\n caffe_sub(\n count,\n bottom[0]->cpu_data(),\n bottom[1]->cpu_data(),\n diff_.mutable_cpu_data());\n Dtype dot = caffe_cpu_dot(count, diff_.cpu_data(), diff_.cpu_data());\n Dtype loss = dot \/ bottom[0]->num() \/ Dtype(2);\n return loss;\n}\n\ntemplate <typename Dtype>\nvoid L2LossLayer<Dtype>::Backward_cpu(const vector<Blob<Dtype>*>& top,\n const bool propagate_down, vector<Blob<Dtype>*>* bottom) {\n caffe_cpu_axpby(\n (*bottom)[0]->count(),\n Dtype(1) \/ (*bottom)[0]->num(),\n diff_.cpu_data(),\n Dtype(0),\n (*bottom)[0]->mutable_cpu_diff());\n}\n\ntemplate <typename Dtype>\nvoid EuclideanLossLayer<Dtype>::FurtherSetUp(\n const vector<Blob<Dtype>*>& bottom, vector<Blob<Dtype>*>* top) {\n CHECK_EQ(bottom[0]->channels(), label_length_);\n CHECK_EQ(bottom[0]->height(), bottom[1]->height());\n CHECK_EQ(bottom[0]->width(), bottom[1]->width());\n diff_.Reshape(bottom[0]->num(), bottom[0]->channels(),\n bottom[0]->height(), bottom[0]->width());\n\n LOG(INFO)<<\"START LOAD LABEL_CODE_TABLE\";\n \/\/ label_length_=255;\n CHECK_EQ(bottom[0]->channels(), label_length_)\n << \" predict output channels shoud be same as label code \"<<std::endl;\n\n \/\/ label_class_num_=201;\n LOG(INFO)<<\"Start load label_code_table file\";\n std::ifstream infile(code_file_.c_str());\n CHECK(infile.good()) << \"Failed to open target code file: \" << code_file_ << std::endl;\n\n int label_class_num_ = label_length_;\n for(int i = 0; i < label_class_num_; ++i){\n \/\/ LOG(INFO)<< \"START LOAD LABEL_CODE INDEX: \"<<i<<\"-\"<<label_class_num_;\n vector<Dtype> label_code;\n for(int j = 0; j < label_length_; ++j){\n \/\/LOG(INFO) << \"start load label_code bit index: \"<< j<<\"-\"<< label_length_;\n Dtype label_bit;\n infile >> label_bit;\n label_code.push_back(label_bit);\n }\n label_code_table_.push_back(label_code);\n }\n LOG(INFO)<<\"END LOADING LABEL_CODE_TABLE\";\n infile.close();\n}\n\ntemplate <typename Dtype>\nDtype EuclideanLossLayer<Dtype>::Forward_cpu(const vector<Blob<Dtype>*>& bottom,\n vector<Blob<Dtype>*>* top) {\n int count = bottom[0]->count();\n\n Blob<Dtype> gt_target_code(bottom[0]->num(),bottom[0]->channels(),bottom[0]->height(),bottom[0]->width());\n CHECK_EQ(bottom[0]->height(),1);\n CHECK_EQ(bottom[0]->width(),1);\n for(int i=0;i<bottom[0]->num();++i){\n for(int j=0;j<bottom[0]->channels();++j){\n *(gt_target_code.mutable_cpu_data() + gt_target_code.offset(i,j))\n = label_code_table_[bottom[1]->cpu_data()[i]][j];\n }\n }\n caffe_sub(\n count,\n bottom[0]->cpu_data(),\n gt_target_code.cpu_data(),\n diff_.mutable_cpu_data());\n\n \/\/ for (int i = 0; i < 10; i++) {\n \/\/ std::cout << std::setprecision(3) << bottom[0]->cpu_data()[i] << \",\"\n \/\/ << gt_target_code.cpu_data()[i] << \" \";\n \/\/ }\n \/\/ std::cout << std::endl;\n Dtype dot = caffe_cpu_dot(count, diff_.cpu_data(), diff_.cpu_data());\n Dtype loss = sqrt(dot \/ bottom[0]->num() \/ label_length_);\n \/\/LOG(INFO)<< dot << \" \" << bottom[0]->num() << \" \" << bottom[0]->data_at(0, 0, 0, 0);\n return loss;\n}\n\ntemplate <typename Dtype>\nvoid EuclideanLossLayer<Dtype>::Backward_cpu(const vector<Blob<Dtype>*>& top,\n const bool propagate_down, vector<Blob<Dtype>*>* bottom) {\n caffe_cpu_axpby(\n (*bottom)[0]->count(), \/\/ count\n Dtype(1) \/ (*bottom)[0]->num(), \/\/ alpha\n diff_.cpu_data(), \/\/ a\n Dtype(0), \/\/ beta\n (*bottom)[0]->mutable_cpu_diff()); \/\/ b\n}\n\ntemplate <typename Dtype>\nvoid TargetCodingHingeLossLayer<Dtype>::FurtherSetUp(\n const vector<Blob<Dtype>*>& bottom, vector<Blob<Dtype>*>* top) {\n CHECK_EQ(bottom[0]->channels(), label_length_);\n CHECK_EQ(bottom[0]->height(), bottom[1]->height());\n CHECK_EQ(bottom[0]->width(), bottom[1]->width());\n gt_label_code_.Reshape(bottom[0]->num(), bottom[0]->channels(),\n bottom[0]->height(), bottom[0]->width());\n\n LOG(INFO)<<\"START LOAD LABEL_CODE_TABLE\";\n \/\/ label_length_=255;\n CHECK_EQ(bottom[0]->channels(), label_length_)\n << \" predict output channels shoud be same as label code \"<<std::endl;\n\n std::ifstream infile(code_file_.c_str());\n CHECK(infile.good()) << \"Failed to open target code file: \" << code_file_ << std::endl;\n\n int label_class_num_ = label_length_;\n for(int i = 0; i < label_class_num_; ++i){\n vector<Dtype> label_code;\n for(int j = 0; j < label_length_; ++j){\n Dtype label_bit;\n infile >> label_bit;\n label_code.push_back(label_bit);\n }\n label_code_table_.push_back(label_code);\n }\n LOG(INFO)<<\"END LOADING LABEL_CODE_TABLE\";\n infile.close();\n}\n\ntemplate <typename Dtype>\nDtype TargetCodingHingeLossLayer<Dtype>::Forward_cpu(const vector<Blob<Dtype>*>& bottom,\n vector<Blob<Dtype>*>* top) {\n\n CHECK_EQ(bottom[0]->height(), 1);\n CHECK_EQ(bottom[0]->width(), 1);\n int num = bottom[0]->num();\n int count = bottom[0]->count();\n int dim = count \/ num;\n CHECK_EQ(dim, label_length_);\n const Dtype* bottom_data = bottom[0]->cpu_data();\n Dtype* bottom_diff = bottom[0]->mutable_cpu_diff();\n const Dtype* label = bottom[1]->cpu_data();\n Dtype* label_code = gt_label_code_.mutable_cpu_data();\n\n for(int i = 0; i < bottom[0]->num(); ++i){\n for(int j = 0; j < bottom[0]->channels(); ++j){\n *(label_code + gt_label_code_.offset(i,j))\n = label_code_table_[label[i]][j];\n }\n }\n\n caffe_copy(count, bottom_data, bottom_diff);\n caffe_add_scalar(count, Dtype(-0.5), bottom_diff); \/\/ b-0.5\n caffe_scal(count, Dtype(-2), label_code);\n caffe_add_scalar(count, Dtype(1), label_code); \/\/ 1-2*gt\n caffe_mul(count, bottom_diff, label_code, bottom_diff);\n for (int i = 0; i < num; i++) {\n for (int j = 0; j < dim; j++) {\n bottom_diff[i * dim + j] = max(Dtype(0), margin_ + bottom_diff[i * dim + j]);\n }\n }\n\n \/\/Dtype dot = caffe_cpu_dot(count, diff_.cpu_data(), diff_.cpu_data());\n Dtype loss = caffe_cpu_asum(count, bottom_diff) \/ num \/ label_length_; \/\/ hinge loss\n loss = Dtype(0.5) - margin_ + loss; \/\/ loss relative to the groudtruth\n \/\/LOG(INFO)<< dot << \" \" << bottom[0]->num() << \" \" << bottom[0]->data_at(0, 0, 0, 0);\n return loss;\n}\n\ntemplate <typename Dtype>\nvoid TargetCodingHingeLossLayer<Dtype>::Backward_cpu(const vector<Blob<Dtype>*>& top,\n const bool propagate_down, vector<Blob<Dtype>*>* bottom) {\n Dtype *bottom_diff = (*bottom)[0]->mutable_cpu_diff();\n const Dtype *label_code = gt_label_code_.mutable_cpu_data();\n int num = (*bottom)[0]->num();\n int count = (*bottom)[0]->count();\n const Dtype* bottom_data = (*bottom)[0]->cpu_data();\n\n caffe_cpu_sign(count, bottom_diff, bottom_diff);\n caffe_mul(count, bottom_diff, label_code, bottom_diff);\n caffe_scal(count, Dtype(1. \/ num), bottom_diff);\n\n \/\/ for (int i = 512; i < 512 + 5; i++) {\n \/\/ std::cout << std::setprecision(3) << bottom_data[i] << \",\"\n \/\/ << label_code[i] << \",\" << bottom_diff[i] << \" \";\n \/\/ }\n \/\/ std::cout << std::endl;\n}\n\nINSTANTIATE_CLASS(L2LossLayer);\n\nINSTANTIATE_CLASS(EuclideanLossLayer);\n\n\nINSTANTIATE_CLASS(Euclidean1023LossLayer);\n\n\nINSTANTIATE_CLASS(Euclidean255LossLayer);\n\nINSTANTIATE_CLASS(TargetCodingHingeLossLayer);\n\nINSTANTIATE_CLASS(TargetCoding1023HingeLossLayer);\n\n} \/\/ namespace caffe\n<|endoftext|>"} {"text":"<commit_before>\/*\n * Copyright 2002-2010 Guillaume Cottenceau.\n *\n * This software may be freely redistributed under the terms\n * of the X11 license.\n *\n *\/\n\n#include <unistd.h>\n#include <stdlib.h>\n#include <stdio.h>\n#include <string.h>\n#include <stdarg.h>\n\n#define PNG_DEBUG 3\n#include \"png.h\"\n\nvoid abort_(const char * s, ...)\n{\n va_list args;\n va_start(args, s);\n vfprintf(stderr, s, args);\n fprintf(stderr, \"\\n\");\n va_end(args);\n abort();\n}\n\nint x, y;\n\nint width, height;\npng_byte color_type;\npng_byte bit_depth;\n\npng_structp png_ptr;\npng_infop info_ptr;\nint number_of_passes;\npng_bytep * row_pointers = NULL;\n\n\/\/ BGR or BGRA data will be read into this buffer of pixels\n\nuint32_t *pixels = NULL;\n\nconst int debugPrintPixelsReadAndWritten = 0;\n\nvoid allocate_row_pointers()\n{\n if (row_pointers != NULL) {\n abort_(\"[allocate_row_pointers] row_pointers already allocated\");\n }\n \n row_pointers = (png_bytep*) malloc(sizeof(png_bytep) * height);\n \n if (!row_pointers) {\n abort_(\"[allocate_row_pointers] could not allocate %d bytes to store row data\", (sizeof(png_bytep) * height));\n }\n \n for (y=0; y<height; y++) {\n row_pointers[y] = (png_byte*) malloc(png_get_rowbytes(png_ptr,info_ptr));\n \n if (!row_pointers[y]) {\n abort_(\"[allocate_row_pointers] could not allocate %d bytes to store row data\", png_get_rowbytes(png_ptr,info_ptr));\n }\n }\n}\n\nvoid free_row_pointers()\n{\n if (row_pointers == NULL) {\n return;\n }\n \n for (y=0; y<height; y++)\n free(row_pointers[y]);\n free(row_pointers);\n row_pointers = NULL;\n}\n\nvoid read_png_file(char* file_name)\n{\n char header[8]; \/\/ 8 is the maximum size that can be checked\n \n \/* open file and test for it being a png *\/\n FILE *fp = fopen(file_name, \"rb\");\n if (!fp)\n abort_(\"[read_png_file] File %s could not be opened for reading\", file_name);\n fread(header, 1, 8, fp);\n if (png_sig_cmp((png_const_bytep)header, 0, 8))\n abort_(\"[read_png_file] File %s is not recognized as a PNG file\", file_name);\n \n \/* initialize stuff *\/\n png_ptr = png_create_read_struct(PNG_LIBPNG_VER_STRING, NULL, NULL, NULL);\n \n if (!png_ptr)\n abort_(\"[read_png_file] png_create_read_struct failed\");\n \n info_ptr = png_create_info_struct(png_ptr);\n if (!info_ptr)\n abort_(\"[read_png_file] png_create_info_struct failed\");\n \n if (setjmp(png_jmpbuf(png_ptr)))\n abort_(\"[read_png_file] Error during init_io\");\n \n png_init_io(png_ptr, fp);\n png_set_sig_bytes(png_ptr, 8);\n \n png_read_info(png_ptr, info_ptr);\n \n width = png_get_image_width(png_ptr, info_ptr);\n height = png_get_image_height(png_ptr, info_ptr);\n color_type = png_get_color_type(png_ptr, info_ptr);\n bit_depth = png_get_bit_depth(png_ptr, info_ptr);\n \n number_of_passes = png_set_interlace_handling(png_ptr);\n png_read_update_info(png_ptr, info_ptr);\n \n \n \/* read file *\/\n if (setjmp(png_jmpbuf(png_ptr)))\n abort_(\"[read_png_file] Error during read_image\");\n \n allocate_row_pointers();\n \n png_read_image(png_ptr, row_pointers);\n \n \/* allocate pixels data and read into array of pixels *\/\n \n pixels = (uint32_t*) malloc(width * height * sizeof(uint32_t));\n \n if (!pixels) {\n abort_(\"[read_png_file] could not allocate %d bytes to store pixel data\", (width * height * sizeof(uint32_t)));\n }\n \n int pixeli = 0;\n \n int isBGRA = 0;\n \n if (png_get_color_type(png_ptr, info_ptr) == PNG_COLOR_TYPE_RGBA) {\n isBGRA = 1;\n } else if (png_get_color_type(png_ptr, info_ptr) == PNG_COLOR_TYPE_RGB) {\n isBGRA = 0;\n } else {\n abort_(\"[read_png_file] unsupported input format type\");\n }\n \n for (y=0; y<height; y++) {\n png_byte* row = row_pointers[y];\n \n if (isBGRA) {\n for (x=0; x<width; x++) {\n png_byte* ptr = &(row[x*4]);\n \n uint32_t B = ptr[2];\n uint32_t G = ptr[1];\n uint32_t R = ptr[0];\n uint32_t A = ptr[3];\n \n uint32_t pixel = (A << 24) | (R << 16) | (G << 8) | B;\n \n if (debugPrintPixelsReadAndWritten) {\n fprintf(stdout, \"Read pixel 0x%08X at (x,y) (%d, %d)\\n\", pixel, x, y);\n }\n \n pixels[pixeli] = pixel;\n \n pixeli++;\n }\n } else {\n \/\/ BGR with no alpha channel\n for (x=0; x<width; x++) {\n png_byte* ptr = &(row[x*3]);\n \n uint32_t B = ptr[2];\n uint32_t G = ptr[1];\n uint32_t R = ptr[0];\n \n uint32_t pixel = (0xFF << 24) | (R << 16) | (G << 8) | B;\n \n if (debugPrintPixelsReadAndWritten) {\n fprintf(stdout, \"Read pixel 0x%08X at (x,y) (%d, %d)\\n\", pixel, x, y);\n }\n \n pixels[pixeli] = pixel;\n \n pixeli++;\n }\n }\n }\n \n fclose(fp);\n \n free_row_pointers();\n}\n\n\nvoid write_png_file(char* file_name)\n{\n \/* create file *\/\n FILE *fp = fopen(file_name, \"wb\");\n if (!fp)\n abort_(\"[write_png_file] File %s could not be opened for writing\", file_name);\n \n \n \/* initialize stuff *\/\n png_ptr = png_create_write_struct(PNG_LIBPNG_VER_STRING, NULL, NULL, NULL);\n \n if (!png_ptr)\n abort_(\"[write_png_file] png_create_write_struct failed\");\n \n info_ptr = png_create_info_struct(png_ptr);\n if (!info_ptr)\n abort_(\"[write_png_file] png_create_info_struct failed\");\n \n if (setjmp(png_jmpbuf(png_ptr)))\n abort_(\"[write_png_file] Error during init_io\");\n \n png_init_io(png_ptr, fp);\n \n \n \/* write header *\/\n if (setjmp(png_jmpbuf(png_ptr)))\n abort_(\"[write_png_file] Error during writing header\");\n \n png_set_IHDR(png_ptr, info_ptr, width, height,\n bit_depth, color_type, PNG_INTERLACE_NONE,\n PNG_COMPRESSION_TYPE_BASE, PNG_FILTER_TYPE_BASE);\n \n png_write_info(png_ptr, info_ptr);\n \n \/* write pixels back to row_pointers *\/\n \n allocate_row_pointers();\n \n int isBGRA = 0;\n \n if (png_get_color_type(png_ptr, info_ptr) == PNG_COLOR_TYPE_RGBA) {\n isBGRA = 1;\n } else if (png_get_color_type(png_ptr, info_ptr) == PNG_COLOR_TYPE_RGB) {\n isBGRA = 0;\n } else {\n abort_(\"[write_png_file] unsupported input format type\");\n }\n \n int pixeli = 0;\n \n for (y=0; y<height; y++) {\n png_byte* row = row_pointers[y];\n \n if (isBGRA) {\n for (x=0; x<width; x++) {\n png_byte* ptr = &(row[x*4]);\n \n uint32_t pixel = pixels[pixeli];\n \n uint32_t B = pixel & 0xFF;\n uint32_t G = (pixel >> 8) & 0xFF;\n uint32_t R = (pixel >> 16) & 0xFF;\n uint32_t A = (pixel >> 24) & 0xFF;\n \n ptr[0] = R;\n ptr[1] = G;\n ptr[2] = B;\n ptr[3] = A;\n \n if (debugPrintPixelsReadAndWritten) {\n fprintf(stdout, \"Wrote pixel 0x%08X at (x,y) (%d, %d)\\n\", pixel, x, y);\n }\n \n pixeli++;\n }\n } else {\n for (x=0; x<width; x++) {\n png_byte* ptr = &(row[x*3]);\n \n uint32_t pixel = pixels[pixeli];\n \n uint32_t B = pixel & 0xFF;\n uint32_t G = (pixel >> 8) & 0xFF;\n uint32_t R = (pixel >> 16) & 0xFF;\n \n ptr[0] = R;\n ptr[1] = G;\n ptr[2] = B;\n \n if (debugPrintPixelsReadAndWritten) {\n fprintf(stdout, \"Wrote pixel 0x%08X at (x,y) (%d, %d)\\n\", pixel, x, y);\n }\n \n pixeli++;\n }\n }\n }\n \n if (setjmp(png_jmpbuf(png_ptr)))\n abort_(\"[write_png_file] Error during writing bytes\");\n \n png_write_image(png_ptr, row_pointers);\n \n \n \/* end write *\/\n if (setjmp(png_jmpbuf(png_ptr)))\n abort_(\"[write_png_file] Error during end of write\");\n \n png_write_end(png_ptr, NULL);\n \n fclose(fp);\n}\n\nvoid process_file(void)\n{\n \/\/ Swap the B and R channels in the BGRA format pixels\n \n int numPixels = width * height;\n \n for ( int i = 0; i < numPixels; i++) {\n uint32_t pixel = pixels[i];\n uint32_t B = pixel & 0xFF;\n uint32_t G = (pixel >> 8) & 0xFF;\n uint32_t R = (pixel >> 16) & 0xFF;\n uint32_t A = (pixel >> 24) & 0xFF;\n \n \/\/ Swap B and R channels\n \n if ((1)) {\n uint32_t tmp = B;\n B = R;\n R = tmp;\n }\n \n uint32_t outPixel = (A << 24) | (R << 16) | (G << 8) | B;\n \n pixels[i] = outPixel;\n }\n}\n\n\/* deallocate memory *\/\n\nvoid cleanup()\n{\n free_row_pointers();\n \n free(pixels);\n}\n\nint main(int argc, char **argv)\n{\n if (argc != 3) {\n abort_(\"Usage: %s <file_in> <file_out>\", argv[0]);\n }\n \n read_png_file(argv[1]);\n process_file();\n write_png_file(argv[2]);\n \n cleanup();\n \n printf(\"success processing %d pixels from image of dimensions %d x %d\\n\", width*height, width, height);\n \n return 0;\n}\n<commit_msg>enable reading of grayscale image though a component swap would have no effect<commit_after>\/*\n * Copyright 2002-2010 Guillaume Cottenceau.\n *\n * This software may be freely redistributed under the terms\n * of the X11 license.\n *\n *\/\n\n#include <unistd.h>\n#include <stdlib.h>\n#include <stdio.h>\n#include <string.h>\n#include <stdarg.h>\n\n#define PNG_DEBUG 3\n#include \"png.h\"\n\nvoid abort_(const char * s, ...)\n{\n va_list args;\n va_start(args, s);\n vfprintf(stderr, s, args);\n fprintf(stderr, \"\\n\");\n va_end(args);\n abort();\n}\n\nint x, y;\n\nint width, height;\npng_byte color_type;\npng_byte bit_depth;\n\npng_structp png_ptr;\npng_infop info_ptr;\nint number_of_passes;\npng_bytep * row_pointers = NULL;\n\n\/\/ BGR or BGRA data will be read into this buffer of pixels\n\nuint32_t *pixels = NULL;\n\nconst int debugPrintPixelsReadAndWritten = 0;\n\nvoid allocate_row_pointers()\n{\n if (row_pointers != NULL) {\n abort_(\"[allocate_row_pointers] row_pointers already allocated\");\n }\n \n row_pointers = (png_bytep*) malloc(sizeof(png_bytep) * height);\n \n if (!row_pointers) {\n abort_(\"[allocate_row_pointers] could not allocate %d bytes to store row data\", (sizeof(png_bytep) * height));\n }\n \n for (y=0; y<height; y++) {\n row_pointers[y] = (png_byte*) malloc(png_get_rowbytes(png_ptr,info_ptr));\n \n if (!row_pointers[y]) {\n abort_(\"[allocate_row_pointers] could not allocate %d bytes to store row data\", png_get_rowbytes(png_ptr,info_ptr));\n }\n }\n}\n\nvoid free_row_pointers()\n{\n if (row_pointers == NULL) {\n return;\n }\n \n for (y=0; y<height; y++)\n free(row_pointers[y]);\n free(row_pointers);\n row_pointers = NULL;\n}\n\nvoid read_png_file(char* file_name)\n{\n char header[8]; \/\/ 8 is the maximum size that can be checked\n \n \/* open file and test for it being a png *\/\n FILE *fp = fopen(file_name, \"rb\");\n if (!fp)\n abort_(\"[read_png_file] File %s could not be opened for reading\", file_name);\n fread(header, 1, 8, fp);\n if (png_sig_cmp((png_const_bytep)header, 0, 8))\n abort_(\"[read_png_file] File %s is not recognized as a PNG file\", file_name);\n \n \/* initialize stuff *\/\n png_ptr = png_create_read_struct(PNG_LIBPNG_VER_STRING, NULL, NULL, NULL);\n \n if (!png_ptr)\n abort_(\"[read_png_file] png_create_read_struct failed\");\n \n info_ptr = png_create_info_struct(png_ptr);\n if (!info_ptr)\n abort_(\"[read_png_file] png_create_info_struct failed\");\n \n if (setjmp(png_jmpbuf(png_ptr)))\n abort_(\"[read_png_file] Error during init_io\");\n \n png_init_io(png_ptr, fp);\n png_set_sig_bytes(png_ptr, 8);\n \n png_read_info(png_ptr, info_ptr);\n \n width = png_get_image_width(png_ptr, info_ptr);\n height = png_get_image_height(png_ptr, info_ptr);\n color_type = png_get_color_type(png_ptr, info_ptr);\n bit_depth = png_get_bit_depth(png_ptr, info_ptr);\n \n number_of_passes = png_set_interlace_handling(png_ptr);\n png_read_update_info(png_ptr, info_ptr);\n \n if (bit_depth != 8) {\n abort_(\"[read_png_file] only 8 bit pixel depth PNG is supported\");\n }\n \n \/* read file *\/\n if (setjmp(png_jmpbuf(png_ptr)))\n abort_(\"[read_png_file] Error during read_image\");\n \n allocate_row_pointers();\n \n png_read_image(png_ptr, row_pointers);\n \n \/* allocate pixels data and read into array of pixels *\/\n \n pixels = (uint32_t*) malloc(width * height * sizeof(uint32_t));\n \n if (!pixels) {\n abort_(\"[read_png_file] could not allocate %d bytes to store pixel data\", (width * height * sizeof(uint32_t)));\n }\n \n int pixeli = 0;\n \n int isBGRA = 0;\n int isGrayscale = 0;\n \n if (png_get_color_type(png_ptr, info_ptr) == PNG_COLOR_TYPE_RGBA) {\n isBGRA = 1;\n } else if (png_get_color_type(png_ptr, info_ptr) == PNG_COLOR_TYPE_RGB) {\n isBGRA = 0;\n } else if (png_get_color_type(png_ptr, info_ptr) == PNG_COLOR_TYPE_GRAY) {\n isGrayscale = 1;\n } else {\n abort_(\"[read_png_file] unsupported input format type\");\n }\n \n for (y=0; y<height; y++) {\n png_byte* row = row_pointers[y];\n \n if (isGrayscale) {\n for (x=0; x<width; x++) {\n png_byte* ptr = &(row[x]);\n \n uint32_t gray = ptr[0];\n uint32_t pixel = (0xFF << 24) | (gray << 16) | (gray << 8) | gray;\n \n if (debugPrintPixelsReadAndWritten) {\n fprintf(stdout, \"Read pixel 0x%08X at (x,y) (%d, %d)\\n\", pixel, x, y);\n }\n \n pixels[pixeli] = pixel;\n \n pixeli++;\n }\n } else if (isBGRA) {\n for (x=0; x<width; x++) {\n png_byte* ptr = &(row[x*4]);\n \n uint32_t B = ptr[2];\n uint32_t G = ptr[1];\n uint32_t R = ptr[0];\n uint32_t A = ptr[3];\n \n uint32_t pixel = (A << 24) | (R << 16) | (G << 8) | B;\n \n if (debugPrintPixelsReadAndWritten) {\n fprintf(stdout, \"Read pixel 0x%08X at (x,y) (%d, %d)\\n\", pixel, x, y);\n }\n \n pixels[pixeli] = pixel;\n \n pixeli++;\n }\n } else {\n \/\/ BGR with no alpha channel\n for (x=0; x<width; x++) {\n png_byte* ptr = &(row[x*3]);\n \n uint32_t B = ptr[2];\n uint32_t G = ptr[1];\n uint32_t R = ptr[0];\n \n uint32_t pixel = (0xFF << 24) | (R << 16) | (G << 8) | B;\n \n if (debugPrintPixelsReadAndWritten) {\n fprintf(stdout, \"Read pixel 0x%08X at (x,y) (%d, %d)\\n\", pixel, x, y);\n }\n \n pixels[pixeli] = pixel;\n \n pixeli++;\n }\n }\n }\n \n fclose(fp);\n \n free_row_pointers();\n}\n\n\nvoid write_png_file(char* file_name)\n{\n \/* create file *\/\n FILE *fp = fopen(file_name, \"wb\");\n if (!fp)\n abort_(\"[write_png_file] File %s could not be opened for writing\", file_name);\n \n \n \/* initialize stuff *\/\n png_ptr = png_create_write_struct(PNG_LIBPNG_VER_STRING, NULL, NULL, NULL);\n \n if (!png_ptr)\n abort_(\"[write_png_file] png_create_write_struct failed\");\n \n info_ptr = png_create_info_struct(png_ptr);\n if (!info_ptr)\n abort_(\"[write_png_file] png_create_info_struct failed\");\n \n if (setjmp(png_jmpbuf(png_ptr)))\n abort_(\"[write_png_file] Error during init_io\");\n \n png_init_io(png_ptr, fp);\n \n \n \/* write header *\/\n if (setjmp(png_jmpbuf(png_ptr)))\n abort_(\"[write_png_file] Error during writing header\");\n \n png_set_IHDR(png_ptr, info_ptr, width, height,\n bit_depth, color_type, PNG_INTERLACE_NONE,\n PNG_COMPRESSION_TYPE_BASE, PNG_FILTER_TYPE_BASE);\n \n png_write_info(png_ptr, info_ptr);\n \n \/* write pixels back to row_pointers *\/\n \n allocate_row_pointers();\n \n int isBGRA = 0;\n int isGrayscale = 0;\n \n if (png_get_color_type(png_ptr, info_ptr) == PNG_COLOR_TYPE_RGBA) {\n isBGRA = 1;\n } else if (png_get_color_type(png_ptr, info_ptr) == PNG_COLOR_TYPE_RGB) {\n isBGRA = 0;\n } else if (png_get_color_type(png_ptr, info_ptr) == PNG_COLOR_TYPE_GRAY) {\n isGrayscale = 1;\n } else {\n abort_(\"[write_png_file] unsupported input format type\");\n }\n \n int pixeli = 0;\n \n for (y=0; y<height; y++) {\n png_byte* row = row_pointers[y];\n \n if (isGrayscale) {\n for (x=0; x<width; x++) {\n png_byte* ptr = &(row[x]);\n \n uint32_t pixel = pixels[pixeli];\n \n uint32_t gray = pixel & 0xFF;\n \n ptr[0] = gray;\n \n if (debugPrintPixelsReadAndWritten) {\n fprintf(stdout, \"Wrote pixel 0x%08X at (x,y) (%d, %d)\\n\", pixel, x, y);\n }\n \n pixeli++;\n }\n } else if (isBGRA) {\n for (x=0; x<width; x++) {\n png_byte* ptr = &(row[x*4]);\n \n uint32_t pixel = pixels[pixeli];\n \n uint32_t B = pixel & 0xFF;\n uint32_t G = (pixel >> 8) & 0xFF;\n uint32_t R = (pixel >> 16) & 0xFF;\n uint32_t A = (pixel >> 24) & 0xFF;\n \n ptr[0] = R;\n ptr[1] = G;\n ptr[2] = B;\n ptr[3] = A;\n \n if (debugPrintPixelsReadAndWritten) {\n fprintf(stdout, \"Wrote pixel 0x%08X at (x,y) (%d, %d)\\n\", pixel, x, y);\n }\n \n pixeli++;\n }\n } else {\n for (x=0; x<width; x++) {\n png_byte* ptr = &(row[x*3]);\n \n uint32_t pixel = pixels[pixeli];\n \n uint32_t B = pixel & 0xFF;\n uint32_t G = (pixel >> 8) & 0xFF;\n uint32_t R = (pixel >> 16) & 0xFF;\n \n ptr[0] = R;\n ptr[1] = G;\n ptr[2] = B;\n \n if (debugPrintPixelsReadAndWritten) {\n fprintf(stdout, \"Wrote pixel 0x%08X at (x,y) (%d, %d)\\n\", pixel, x, y);\n }\n \n pixeli++;\n }\n }\n }\n \n if (setjmp(png_jmpbuf(png_ptr)))\n abort_(\"[write_png_file] Error during writing bytes\");\n \n png_write_image(png_ptr, row_pointers);\n \n \n \/* end write *\/\n if (setjmp(png_jmpbuf(png_ptr)))\n abort_(\"[write_png_file] Error during end of write\");\n \n png_write_end(png_ptr, NULL);\n \n fclose(fp);\n}\n\nvoid process_file(void)\n{\n \/\/ Swap the B and R channels in the BGRA format pixels\n \n int numPixels = width * height;\n \n for ( int i = 0; i < numPixels; i++) {\n uint32_t pixel = pixels[i];\n uint32_t B = pixel & 0xFF;\n uint32_t G = (pixel >> 8) & 0xFF;\n uint32_t R = (pixel >> 16) & 0xFF;\n uint32_t A = (pixel >> 24) & 0xFF;\n \n \/\/ Swap B and R channels, a grayscale image will not be modified\n \n if ((1)) {\n uint32_t tmp = B;\n B = R;\n R = tmp;\n }\n \n uint32_t outPixel = (A << 24) | (R << 16) | (G << 8) | B;\n \n pixels[i] = outPixel;\n }\n}\n\n\/* deallocate memory *\/\n\nvoid cleanup()\n{\n free_row_pointers();\n \n free(pixels);\n}\n\nint main(int argc, char **argv)\n{\n if (argc != 3) {\n abort_(\"Usage: %s <in_png> <out_png>\", argv[0]);\n }\n \n read_png_file(argv[1]);\n process_file();\n write_png_file(argv[2]);\n \n cleanup();\n \n printf(\"success processing %d pixels from image of dimensions %d x %d\\n\", width*height, width, height);\n \n return 0;\n}\n<|endoftext|>"} {"text":"<commit_before>\/*ckwg +5\n * Copyright 2012 by Kitware, Inc. All Rights Reserved. Please refer to\n * KITWARE_LICENSE.TXT for licensing information, or contact General Counsel,\n * Kitware, Inc., 28 Corporate Drive, Clifton Park, NY 12065.\n *\/\n\n#include <viscl\/core\/manager.h>\n\n#include <iostream>\n#include <sstream>\n\nnamespace viscl\n{\n\n\nmanager *manager::inst_ = 0;\n\n\/\/*****************************************************************************\n\nmanager *manager::inst()\n{\n return inst_ ? inst_ : inst_ = new manager;\n}\n\n\/\/*****************************************************************************\n\nmanager::manager()\n{\n init_opencl();\n}\n\n\/\/*****************************************************************************\n\nvoid manager::init_opencl()\n{\n try\n {\n \/\/ Get available platforms\n cl::Platform::get(&platforms_);\n\n \/\/\/ \\todo Add Windows support.\n std::stringstream platform;\n char* def_platform = getenv(\"VISCL_DEFAULT_PLATFORM\");\n\n if (def_platform)\n {\n platform << def_platform;\n }\n\n size_t platform_id = DEFAULT_PLATFORM;\n platform >> platform_id;\n\n \/\/ Select the default platform and create a context using this platform and the GPU\n cl_context_properties cps[3] = {\n CL_CONTEXT_PLATFORM,\n (cl_context_properties)(platforms_[platform_id])(),\n 0\n };\n\n context_ = cl::Context(CL_DEVICE_TYPE_GPU, cps);\n\n \/\/ Get a list of devices on this platform\n devices_ = context_.getInfo<CL_CONTEXT_DEVICES>();\n }\n catch(cl::Error &error)\n {\n std::cout << \"Error: \" << error.what() << \" - \" << print_cl_errstring(error.err()) << std::endl;\n }\n}\n\n\/\/*****************************************************************************\n\ncl_program_t manager::build_source(const char *source, int device) const\n{\n cl::Program::Sources src(1, std::make_pair(source, strlen(source)+1));\n\n \/\/ Make program of the source code in the context\n cl_program_t program = boost::make_shared<cl::Program>(cl::Program(context_, src));\n\n \/\/ Build program for these specific devices\n try {\n program->build(devices_);\n }\n catch(cl::Error error) {\n if(error.err() == CL_BUILD_PROGRAM_FAILURE)\n {\n std::string build_log = program->getBuildInfo<CL_PROGRAM_BUILD_LOG>(devices_[device]);\n std::cerr << build_log << std::endl;\n }\n throw error;\n }\n\n return program;\n}\n\n\/\/*****************************************************************************\n\ncl_queue_t manager::create_queue(int device)\n{\n return boost::make_shared<cl::CommandQueue>(cl::CommandQueue(context_, devices_[device]));\n}\n\n\/\/*****************************************************************************\n\nimage manager::create_image(const cl::ImageFormat &img_frmt, cl_mem_flags flags, size_t ni, size_t nj)\n{\n return image(boost::make_shared<cl::Image2D>(cl::Image2D(context_,\n flags,\n img_frmt,\n ni,\n nj,\n 0,\n 0)));\n}\n\n\/\/*****************************************************************************\n\nvoid manager::report_device_specs(const cl::Device& dev,\n const std::string& prefix)\n{\n try\n {\n std::cout << prefix << \"Name : \"\n << dev.getInfo<CL_DEVICE_NAME>() << \"\\n\";\n std::cout << prefix << \"Type : \";\n cl_device_type type = dev.getInfo<CL_DEVICE_TYPE>();\n if (type & CL_DEVICE_TYPE_CPU)\n {\n std::cout << \"CPU \";\n }\n if (type & CL_DEVICE_TYPE_GPU)\n {\n std::cout << \"GPU \";\n }\n if (type & CL_DEVICE_TYPE_ACCELERATOR)\n {\n std::cout << \"Accelerator \";\n }\n std::cout << \"\\n\";\n std::cout << prefix << \"Vendor : \"\n << dev.getInfo<CL_DEVICE_VENDOR>() << \"\\n\";\n std::cout << prefix << \"Device Version : \"\n << dev.getInfo<CL_DEVICE_VERSION>() << \"\\n\";\n std::cout << prefix << \"Driver Version : \"\n << dev.getInfo<CL_DRIVER_VERSION>() << \"\\n\";\n std::cout << prefix << \"Max Clock Frequency : \"\n << dev.getInfo<CL_DEVICE_MAX_CLOCK_FREQUENCY>() << \" MHz\\n\";\n std::cout << prefix << \"Max Compute Units : \"\n << dev.getInfo<CL_DEVICE_MAX_COMPUTE_UNITS>() << \"\\n\";\n std::cout << prefix << \"Max Work Item Dims : \"\n << dev.getInfo<CL_DEVICE_MAX_WORK_ITEM_DIMENSIONS>() << \"\\n\";\n std::cout << prefix << \"Max Work Item Sizes : \";\n std::vector<size_t> work_sizes = dev.getInfo<CL_DEVICE_MAX_WORK_ITEM_SIZES>();\n for (size_t i=0; i<work_sizes.size(); ++i)\n {\n std::cout << work_sizes[i];\n if (i < work_sizes.size()-1)\n {\n std::cout << \", \";\n }\n }\n std::cout << \"\\n\";\n std::cout << prefix << \"Max Work Group Size : \"\n << dev.getInfo<CL_DEVICE_MAX_WORK_GROUP_SIZE>() << \"\\n\";\n std::cout << prefix << \"Global Memory : \"\n << dev.getInfo<CL_DEVICE_GLOBAL_MEM_SIZE>()\/1048576 << \" Mb\\n\";\n std::cout << prefix << \"Max Memory Alloc : \"\n << dev.getInfo<CL_DEVICE_MAX_MEM_ALLOC_SIZE>()\/1048576 << \" Mb\\n\";\n std::cout << prefix << \"Max Image 2D Dims : \"\n << dev.getInfo<CL_DEVICE_IMAGE2D_MAX_WIDTH>() << \" x \"\n << dev.getInfo<CL_DEVICE_IMAGE2D_MAX_HEIGHT>() << \"\\n\";\n std::cout << prefix << \"Max Image 3D Dims : \"\n << dev.getInfo<CL_DEVICE_IMAGE3D_MAX_WIDTH>() << \" x \"\n << dev.getInfo<CL_DEVICE_IMAGE3D_MAX_HEIGHT>() << \" x \"\n << dev.getInfo<CL_DEVICE_IMAGE3D_MAX_DEPTH>() << \"\\n\";\n std::cout << prefix << \"Out of Order Queue : \"\n << ((dev.getInfo<CL_DEVICE_QUEUE_PROPERTIES>() &\n CL_QUEUE_OUT_OF_ORDER_EXEC_MODE_ENABLE) ? \"Yes\" : \"No\") << \"\\n\";\n\n\n std::string dev_ext = dev.getInfo<CL_DEVICE_EXTENSIONS>();\n std::istringstream extensions(dev_ext);\n std::string extension;\n std::cout << prefix << \"Extensions : \";\n bool first_ext = true;\n while (extensions >> extension)\n {\n if (first_ext)\n {\n first_ext = false;\n }\n else\n {\n std::cout << prefix << \" \";\n }\n std::cout << extension << \"\\n\";\n }\n }\n catch (cl::Error error)\n {\n std::cout << \"Error: \" << error.what() << \" - \"\n << print_cl_errstring(error.err()) << std::endl;\n }\n}\n\n\/\/*****************************************************************************\n\nvoid manager::report_opencl_specs()\n{\n try\n {\n std::cout << \"Found \" << platforms_.size() << \" Platforms\" << std::endl;\n for (size_t i=0; i<platforms_.size(); ++i)\n {\n std::cout << \"Platform[\" << i << \"]\\n\";\n std::cout << \" Name : \"\n << platforms_[i].getInfo<CL_PLATFORM_NAME>() << \"\\n\";\n std::cout << \" Vendor : \"\n << platforms_[i].getInfo<CL_PLATFORM_VENDOR>() << \"\\n\";\n std::cout << \" Version : \"\n << platforms_[i].getInfo<CL_PLATFORM_VERSION>() << \"\\n\";\n std::cout << \" Profile : \"\n << platforms_[i].getInfo<CL_PLATFORM_PROFILE>() << \"\\n\";\n std::string plat_ext = platforms_[i].getInfo<CL_PLATFORM_EXTENSIONS>();\n std::istringstream extensions(plat_ext);\n\n std::string extension;\n std::cout << \" Extensions : \";\n bool first_ext = true;\n while (extensions >> extension)\n {\n if (first_ext)\n {\n first_ext = false;\n }\n else\n {\n std::cout << \" \";\n }\n std::cout << extension << \"\\n\";\n }\n\n std::vector<cl::Device> devices;\n platforms_[i].getDevices(CL_DEVICE_TYPE_ALL, &devices);\n std::cout << \" Found \" << devices.size() << \" Devices\" << std::endl;\n for (size_t j=0; j<devices.size(); ++j)\n {\n std::cout << \"\\n Device[\" << j << \"]\\n\";\n report_device_specs(devices[j], \" \");\n }\n }\n }\n catch (cl::Error error)\n {\n std::cout << \"Error: \" << error.what() << \" - \"\n << print_cl_errstring(error.err()) << std::endl;\n }\n}\n\n\/\/*****************************************************************************\n\n\/\/Returns an error string explaining an error code\nconst char *print_cl_errstring(cl_int err)\n{\n switch (err) {\n case CL_SUCCESS: return \"Success\";\n case CL_DEVICE_NOT_FOUND: return \"Device not found\";\n case CL_DEVICE_NOT_AVAILABLE: return \"Device not available\";\n case CL_COMPILER_NOT_AVAILABLE: return \"Compiler not available\";\n case CL_MEM_OBJECT_ALLOCATION_FAILURE: return \"Memory object allocation failure\";\n case CL_OUT_OF_RESOURCES: return \"Out of resources\";\n case CL_OUT_OF_HOST_MEMORY: return \"Out of host memory\";\n case CL_PROFILING_INFO_NOT_AVAILABLE: return \"Profiling information not available\";\n case CL_MEM_COPY_OVERLAP: return \"Memory copy overlap\";\n case CL_IMAGE_FORMAT_MISMATCH: return \"Image format mismatch\";\n case CL_IMAGE_FORMAT_NOT_SUPPORTED: return \"Image format not supported\";\n case CL_BUILD_PROGRAM_FAILURE: return \"Program build failure\";\n case CL_MAP_FAILURE: return \"Map failure\";\n case CL_INVALID_VALUE: return \"Invalid value\";\n case CL_INVALID_DEVICE_TYPE: return \"Invalid device type\";\n case CL_INVALID_PLATFORM: return \"Invalid platform\";\n case CL_INVALID_DEVICE: return \"Invalid device\";\n case CL_INVALID_CONTEXT: return \"Invalid context\";\n case CL_INVALID_QUEUE_PROPERTIES: return \"Invalid queue properties\";\n case CL_INVALID_COMMAND_QUEUE: return \"Invalid command queue\";\n case CL_INVALID_HOST_PTR: return \"Invalid host pointer\";\n case CL_INVALID_MEM_OBJECT: return \"Invalid memory object\";\n case CL_INVALID_IMAGE_FORMAT_DESCRIPTOR: return \"Invalid image format descriptor\";\n case CL_INVALID_IMAGE_SIZE: return \"Invalid image size\";\n case CL_INVALID_SAMPLER: return \"Invalid sampler\";\n case CL_INVALID_BINARY: return \"Invalid binary\";\n case CL_INVALID_BUILD_OPTIONS: return \"Invalid build options\";\n case CL_INVALID_PROGRAM: return \"Invalid program\";\n case CL_INVALID_PROGRAM_EXECUTABLE: return \"Invalid program executable\";\n case CL_INVALID_KERNEL_NAME: return \"Invalid kernel name\";\n case CL_INVALID_KERNEL_DEFINITION: return \"Invalid kernel definition\";\n case CL_INVALID_KERNEL: return \"Invalid kernel\";\n case CL_INVALID_ARG_INDEX: return \"Invalid argument index\";\n case CL_INVALID_ARG_VALUE: return \"Invalid argument value\";\n case CL_INVALID_ARG_SIZE: return \"Invalid argument size\";\n case CL_INVALID_KERNEL_ARGS: return \"Invalid kernel arguments\";\n case CL_INVALID_WORK_DIMENSION: return \"Invalid work dimension\";\n case CL_INVALID_WORK_GROUP_SIZE: return \"Invalid work group size\";\n case CL_INVALID_WORK_ITEM_SIZE: return \"Invalid work item size\";\n case CL_INVALID_GLOBAL_OFFSET: return \"Invalid global offset\";\n case CL_INVALID_EVENT_WAIT_LIST: return \"Invalid event wait list\";\n case CL_INVALID_EVENT: return \"Invalid event\";\n case CL_INVALID_OPERATION: return \"Invalid operation\";\n case CL_INVALID_GL_OBJECT: return \"Invalid OpenGL object\";\n case CL_INVALID_BUFFER_SIZE: return \"Invalid buffer size\";\n case CL_INVALID_MIP_LEVEL: return \"Invalid mip-map level\";\n default: return \"Unknown\";\n }\n}\n\n}\n<commit_msg>Use boost::lexical_cast to parse the platform<commit_after>\/*ckwg +5\n * Copyright 2012 by Kitware, Inc. All Rights Reserved. Please refer to\n * KITWARE_LICENSE.TXT for licensing information, or contact General Counsel,\n * Kitware, Inc., 28 Corporate Drive, Clifton Park, NY 12065.\n *\/\n\n#include <viscl\/core\/manager.h>\n\n#include <boost\/lexical_cast.hpp>\n\n#include <iostream>\n#include <sstream>\n#include <stdexcept>\n\nnamespace viscl\n{\n\n\nmanager *manager::inst_ = 0;\n\n\/\/*****************************************************************************\n\nmanager *manager::inst()\n{\n return inst_ ? inst_ : inst_ = new manager;\n}\n\n\/\/*****************************************************************************\n\nmanager::manager()\n{\n init_opencl();\n}\n\n\/\/*****************************************************************************\n\nvoid manager::init_opencl()\n{\n try\n {\n \/\/ Get available platforms\n cl::Platform::get(&platforms_);\n\n \/\/\/ \\todo Add Windows support.\n char* def_platform = getenv(\"VISCL_DEFAULT_PLATFORM\");\n\n size_t platform_id = DEFAULT_PLATFORM;\n if (def_platform)\n {\n try\n {\n platform_id = boost::lexical_cast<size_t>(def_platform);\n }\n catch (boost::bad_lexical_cast const& e)\n {\n std::string const reason = std::string(\"Failed to parse the platform: \") + e.what();\n\n throw std::runtime_error(reason);\n }\n }\n\n \/\/ Select the default platform and create a context using this platform and the GPU\n cl_context_properties cps[3] = {\n CL_CONTEXT_PLATFORM,\n (cl_context_properties)(platforms_[platform_id])(),\n 0\n };\n\n context_ = cl::Context(CL_DEVICE_TYPE_GPU, cps);\n\n \/\/ Get a list of devices on this platform\n devices_ = context_.getInfo<CL_CONTEXT_DEVICES>();\n }\n catch(cl::Error &error)\n {\n std::cout << \"Error: \" << error.what() << \" - \" << print_cl_errstring(error.err()) << std::endl;\n }\n}\n\n\/\/*****************************************************************************\n\ncl_program_t manager::build_source(const char *source, int device) const\n{\n cl::Program::Sources src(1, std::make_pair(source, strlen(source)+1));\n\n \/\/ Make program of the source code in the context\n cl_program_t program = boost::make_shared<cl::Program>(cl::Program(context_, src));\n\n \/\/ Build program for these specific devices\n try {\n program->build(devices_);\n }\n catch(cl::Error error) {\n if(error.err() == CL_BUILD_PROGRAM_FAILURE)\n {\n std::string build_log = program->getBuildInfo<CL_PROGRAM_BUILD_LOG>(devices_[device]);\n std::cerr << build_log << std::endl;\n }\n throw error;\n }\n\n return program;\n}\n\n\/\/*****************************************************************************\n\ncl_queue_t manager::create_queue(int device)\n{\n return boost::make_shared<cl::CommandQueue>(cl::CommandQueue(context_, devices_[device]));\n}\n\n\/\/*****************************************************************************\n\nimage manager::create_image(const cl::ImageFormat &img_frmt, cl_mem_flags flags, size_t ni, size_t nj)\n{\n return image(boost::make_shared<cl::Image2D>(cl::Image2D(context_,\n flags,\n img_frmt,\n ni,\n nj,\n 0,\n 0)));\n}\n\n\/\/*****************************************************************************\n\nvoid manager::report_device_specs(const cl::Device& dev,\n const std::string& prefix)\n{\n try\n {\n std::cout << prefix << \"Name : \"\n << dev.getInfo<CL_DEVICE_NAME>() << \"\\n\";\n std::cout << prefix << \"Type : \";\n cl_device_type type = dev.getInfo<CL_DEVICE_TYPE>();\n if (type & CL_DEVICE_TYPE_CPU)\n {\n std::cout << \"CPU \";\n }\n if (type & CL_DEVICE_TYPE_GPU)\n {\n std::cout << \"GPU \";\n }\n if (type & CL_DEVICE_TYPE_ACCELERATOR)\n {\n std::cout << \"Accelerator \";\n }\n std::cout << \"\\n\";\n std::cout << prefix << \"Vendor : \"\n << dev.getInfo<CL_DEVICE_VENDOR>() << \"\\n\";\n std::cout << prefix << \"Device Version : \"\n << dev.getInfo<CL_DEVICE_VERSION>() << \"\\n\";\n std::cout << prefix << \"Driver Version : \"\n << dev.getInfo<CL_DRIVER_VERSION>() << \"\\n\";\n std::cout << prefix << \"Max Clock Frequency : \"\n << dev.getInfo<CL_DEVICE_MAX_CLOCK_FREQUENCY>() << \" MHz\\n\";\n std::cout << prefix << \"Max Compute Units : \"\n << dev.getInfo<CL_DEVICE_MAX_COMPUTE_UNITS>() << \"\\n\";\n std::cout << prefix << \"Max Work Item Dims : \"\n << dev.getInfo<CL_DEVICE_MAX_WORK_ITEM_DIMENSIONS>() << \"\\n\";\n std::cout << prefix << \"Max Work Item Sizes : \";\n std::vector<size_t> work_sizes = dev.getInfo<CL_DEVICE_MAX_WORK_ITEM_SIZES>();\n for (size_t i=0; i<work_sizes.size(); ++i)\n {\n std::cout << work_sizes[i];\n if (i < work_sizes.size()-1)\n {\n std::cout << \", \";\n }\n }\n std::cout << \"\\n\";\n std::cout << prefix << \"Max Work Group Size : \"\n << dev.getInfo<CL_DEVICE_MAX_WORK_GROUP_SIZE>() << \"\\n\";\n std::cout << prefix << \"Global Memory : \"\n << dev.getInfo<CL_DEVICE_GLOBAL_MEM_SIZE>()\/1048576 << \" Mb\\n\";\n std::cout << prefix << \"Max Memory Alloc : \"\n << dev.getInfo<CL_DEVICE_MAX_MEM_ALLOC_SIZE>()\/1048576 << \" Mb\\n\";\n std::cout << prefix << \"Max Image 2D Dims : \"\n << dev.getInfo<CL_DEVICE_IMAGE2D_MAX_WIDTH>() << \" x \"\n << dev.getInfo<CL_DEVICE_IMAGE2D_MAX_HEIGHT>() << \"\\n\";\n std::cout << prefix << \"Max Image 3D Dims : \"\n << dev.getInfo<CL_DEVICE_IMAGE3D_MAX_WIDTH>() << \" x \"\n << dev.getInfo<CL_DEVICE_IMAGE3D_MAX_HEIGHT>() << \" x \"\n << dev.getInfo<CL_DEVICE_IMAGE3D_MAX_DEPTH>() << \"\\n\";\n std::cout << prefix << \"Out of Order Queue : \"\n << ((dev.getInfo<CL_DEVICE_QUEUE_PROPERTIES>() &\n CL_QUEUE_OUT_OF_ORDER_EXEC_MODE_ENABLE) ? \"Yes\" : \"No\") << \"\\n\";\n\n\n std::string dev_ext = dev.getInfo<CL_DEVICE_EXTENSIONS>();\n std::istringstream extensions(dev_ext);\n std::string extension;\n std::cout << prefix << \"Extensions : \";\n bool first_ext = true;\n while (extensions >> extension)\n {\n if (first_ext)\n {\n first_ext = false;\n }\n else\n {\n std::cout << prefix << \" \";\n }\n std::cout << extension << \"\\n\";\n }\n }\n catch (cl::Error error)\n {\n std::cout << \"Error: \" << error.what() << \" - \"\n << print_cl_errstring(error.err()) << std::endl;\n }\n}\n\n\/\/*****************************************************************************\n\nvoid manager::report_opencl_specs()\n{\n try\n {\n std::cout << \"Found \" << platforms_.size() << \" Platforms\" << std::endl;\n for (size_t i=0; i<platforms_.size(); ++i)\n {\n std::cout << \"Platform[\" << i << \"]\\n\";\n std::cout << \" Name : \"\n << platforms_[i].getInfo<CL_PLATFORM_NAME>() << \"\\n\";\n std::cout << \" Vendor : \"\n << platforms_[i].getInfo<CL_PLATFORM_VENDOR>() << \"\\n\";\n std::cout << \" Version : \"\n << platforms_[i].getInfo<CL_PLATFORM_VERSION>() << \"\\n\";\n std::cout << \" Profile : \"\n << platforms_[i].getInfo<CL_PLATFORM_PROFILE>() << \"\\n\";\n std::string plat_ext = platforms_[i].getInfo<CL_PLATFORM_EXTENSIONS>();\n std::istringstream extensions(plat_ext);\n\n std::string extension;\n std::cout << \" Extensions : \";\n bool first_ext = true;\n while (extensions >> extension)\n {\n if (first_ext)\n {\n first_ext = false;\n }\n else\n {\n std::cout << \" \";\n }\n std::cout << extension << \"\\n\";\n }\n\n std::vector<cl::Device> devices;\n platforms_[i].getDevices(CL_DEVICE_TYPE_ALL, &devices);\n std::cout << \" Found \" << devices.size() << \" Devices\" << std::endl;\n for (size_t j=0; j<devices.size(); ++j)\n {\n std::cout << \"\\n Device[\" << j << \"]\\n\";\n report_device_specs(devices[j], \" \");\n }\n }\n }\n catch (cl::Error error)\n {\n std::cout << \"Error: \" << error.what() << \" - \"\n << print_cl_errstring(error.err()) << std::endl;\n }\n}\n\n\/\/*****************************************************************************\n\n\/\/Returns an error string explaining an error code\nconst char *print_cl_errstring(cl_int err)\n{\n switch (err) {\n case CL_SUCCESS: return \"Success\";\n case CL_DEVICE_NOT_FOUND: return \"Device not found\";\n case CL_DEVICE_NOT_AVAILABLE: return \"Device not available\";\n case CL_COMPILER_NOT_AVAILABLE: return \"Compiler not available\";\n case CL_MEM_OBJECT_ALLOCATION_FAILURE: return \"Memory object allocation failure\";\n case CL_OUT_OF_RESOURCES: return \"Out of resources\";\n case CL_OUT_OF_HOST_MEMORY: return \"Out of host memory\";\n case CL_PROFILING_INFO_NOT_AVAILABLE: return \"Profiling information not available\";\n case CL_MEM_COPY_OVERLAP: return \"Memory copy overlap\";\n case CL_IMAGE_FORMAT_MISMATCH: return \"Image format mismatch\";\n case CL_IMAGE_FORMAT_NOT_SUPPORTED: return \"Image format not supported\";\n case CL_BUILD_PROGRAM_FAILURE: return \"Program build failure\";\n case CL_MAP_FAILURE: return \"Map failure\";\n case CL_INVALID_VALUE: return \"Invalid value\";\n case CL_INVALID_DEVICE_TYPE: return \"Invalid device type\";\n case CL_INVALID_PLATFORM: return \"Invalid platform\";\n case CL_INVALID_DEVICE: return \"Invalid device\";\n case CL_INVALID_CONTEXT: return \"Invalid context\";\n case CL_INVALID_QUEUE_PROPERTIES: return \"Invalid queue properties\";\n case CL_INVALID_COMMAND_QUEUE: return \"Invalid command queue\";\n case CL_INVALID_HOST_PTR: return \"Invalid host pointer\";\n case CL_INVALID_MEM_OBJECT: return \"Invalid memory object\";\n case CL_INVALID_IMAGE_FORMAT_DESCRIPTOR: return \"Invalid image format descriptor\";\n case CL_INVALID_IMAGE_SIZE: return \"Invalid image size\";\n case CL_INVALID_SAMPLER: return \"Invalid sampler\";\n case CL_INVALID_BINARY: return \"Invalid binary\";\n case CL_INVALID_BUILD_OPTIONS: return \"Invalid build options\";\n case CL_INVALID_PROGRAM: return \"Invalid program\";\n case CL_INVALID_PROGRAM_EXECUTABLE: return \"Invalid program executable\";\n case CL_INVALID_KERNEL_NAME: return \"Invalid kernel name\";\n case CL_INVALID_KERNEL_DEFINITION: return \"Invalid kernel definition\";\n case CL_INVALID_KERNEL: return \"Invalid kernel\";\n case CL_INVALID_ARG_INDEX: return \"Invalid argument index\";\n case CL_INVALID_ARG_VALUE: return \"Invalid argument value\";\n case CL_INVALID_ARG_SIZE: return \"Invalid argument size\";\n case CL_INVALID_KERNEL_ARGS: return \"Invalid kernel arguments\";\n case CL_INVALID_WORK_DIMENSION: return \"Invalid work dimension\";\n case CL_INVALID_WORK_GROUP_SIZE: return \"Invalid work group size\";\n case CL_INVALID_WORK_ITEM_SIZE: return \"Invalid work item size\";\n case CL_INVALID_GLOBAL_OFFSET: return \"Invalid global offset\";\n case CL_INVALID_EVENT_WAIT_LIST: return \"Invalid event wait list\";\n case CL_INVALID_EVENT: return \"Invalid event\";\n case CL_INVALID_OPERATION: return \"Invalid operation\";\n case CL_INVALID_GL_OBJECT: return \"Invalid OpenGL object\";\n case CL_INVALID_BUFFER_SIZE: return \"Invalid buffer size\";\n case CL_INVALID_MIP_LEVEL: return \"Invalid mip-map level\";\n default: return \"Unknown\";\n }\n}\n\n}\n<|endoftext|>"} {"text":"<commit_before>#include \"bitflags.h\"\n\nnamespace gcpp\n{\nconstexpr byte bitflags::ALL_TRUE;\nconstexpr byte bitflags::ALL_FALSE;\n}\n<commit_msg>Keeping it header-only<commit_after><|endoftext|>"} {"text":"<commit_before>#include <iostream>\n#include <c++\/stdexcept>\n#include \"queue_ui.h\"\n\nusing namespace std;\n\n\/**\n * Конструктор. Принимает на вход экземпляр очереди, с которой предстоит производить манипуляции,\n * и сохраняет его во внутреннее свойство _queue.\n *\/\nQueueUI::QueueUI(IQueue* queue) {\n_queue = queue;\n}\n\n\/**\n * Выводит список доступных команд\n *\/\nvoid QueueUI::_printHelp() {\n cout << \"Available commands:\" << endl << endl;\n cout << \"put Put number to queue\" << endl;\n cout << \"get Pop number from queue\" << endl;\n cout << \"dump Dump current queue\" << endl;\n cout << \"clear Clear queue\" << endl;\n cout << \"help Print help\" << endl;\n cout << \"exit Exit (or press Ctrl-C)\" << endl << endl;\n};\n\n\/**\n * Запрашивает ввод числа пользователем и возвращает это число. Если пользователь\n * ввёл не число, то выводит сообщение об ошибке и снова запрашивает число. Так\n * продолжается до тех пор, пока пользователь наконец не введёт число.\n *\/\nint QueueUI::_inputNumber() {\n int number;\n do {\n cout << \"Number: \";\n cin >> number;\n if (cin.fail()) {\n cerr << \"Invalid input, try again.\" << endl;\n cin.clear();\n cin.sync();\n } else {\n break;\n }\n } while (true);\n return number;\n}\n\n\/**\n * Основной жизненный цикл: опрос ввода с клавиатуры, выполнение команд, вывод результатов\n *\/\nvoid QueueUI::lifecycle() {\n \/\/ В начале жизненного цикла неплохо вывести пользователю подсказку по доступным командам\n _printHelp();\n\n \/\/ Бесконечный цикл получения и обработки команд от пользователя\n while (true) {\n string cmd;\n cout << \"Enter command: \";\n cin >> cmd;\n\n try {\n \/\/ Команда \"put\"\n if (cmd == \"put\") {\n _queue->put(_inputNumber());\n continue;\n }\n\n \/\/ Команда \"get\"\n if (cmd == \"get\") {\n int number = _queue->get();\n cout << \"Next number is: \" << number << endl;\n continue;\n }\n\n \/\/ Команда \"dump\"\n if (cmd == \"dump\") {\n if (! _queue->isEmpty()) {\n int counter = 1;\n _queue->reset();\n while (_queue->moveNext()) {\n cout << counter << \": \" << _queue->current() << endl;\n counter++;\n }\n } else {\n cout << \"There's no items in the queue\" << endl;\n }\n continue;\n }\n\n \/\/ Команда \"clear\"\n if (cmd == \"clear\") {\n _queue->clear();\n cout << \"The queue has been cleared\" << endl;\n continue;\n }\n\n \/\/ Команда \"help\"\n if (cmd == \"help\") {\n _printHelp();\n continue;\n }\n\n \/\/ Команда \"exit\"\n if (cmd == \"exit\") {\n break;\n }\n\n \/\/ Если мы дошли до сюда -- значит ввод не распознан как известная команда\n throw runtime_error(\"Unrecognized command \\\"\" + cmd + \"\\\"\");\n } catch (exception& e) {\n \/\/ Если возникло исключение -- выводим текст исключения в stderr\n cerr << \"ERROR: \" << e.what() << endl;\n }\n }\n}\n<commit_msg>Добавлен #include <string> и убран префикс \"c++\/\" у инклуда с \"stdexcept\"<commit_after>#include <iostream>\n#include <stdexcept>\n#include <string>\n#include \"queue_ui.h\"\n\nusing namespace std;\n\n\/**\n * Конструктор. Принимает на вход экземпляр очереди, с которой предстоит производить манипуляции,\n * и сохраняет его во внутреннее свойство _queue.\n *\/\nQueueUI::QueueUI(IQueue* queue) {\n_queue = queue;\n}\n\n\/**\n * Выводит список доступных команд\n *\/\nvoid QueueUI::_printHelp() {\n cout << \"Available commands:\" << endl << endl;\n cout << \"put Put number to queue\" << endl;\n cout << \"get Pop number from queue\" << endl;\n cout << \"dump Dump current queue\" << endl;\n cout << \"clear Clear queue\" << endl;\n cout << \"help Print help\" << endl;\n cout << \"exit Exit (or press Ctrl-C)\" << endl << endl;\n};\n\n\/**\n * Запрашивает ввод числа пользователем и возвращает это число. Если пользователь\n * ввёл не число, то выводит сообщение об ошибке и снова запрашивает число. Так\n * продолжается до тех пор, пока пользователь наконец не введёт число.\n *\/\nint QueueUI::_inputNumber() {\n int number;\n do {\n cout << \"Number: \";\n cin >> number;\n if (cin.fail()) {\n cerr << \"Invalid input, try again.\" << endl;\n cin.clear();\n cin.sync();\n } else {\n break;\n }\n } while (true);\n return number;\n}\n\n\/**\n * Основной жизненный цикл: опрос ввода с клавиатуры, выполнение команд, вывод результатов\n *\/\nvoid QueueUI::lifecycle() {\n \/\/ В начале жизненного цикла неплохо вывести пользователю подсказку по доступным командам\n _printHelp();\n\n \/\/ Бесконечный цикл получения и обработки команд от пользователя\n while (true) {\n string cmd;\n cout << \"Enter command: \";\n cin >> cmd;\n\n try {\n \/\/ Команда \"put\"\n if (cmd == \"put\") {\n _queue->put(_inputNumber());\n continue;\n }\n\n \/\/ Команда \"get\"\n if (cmd == \"get\") {\n int number = _queue->get();\n cout << \"Next number is: \" << number << endl;\n continue;\n }\n\n \/\/ Команда \"dump\"\n if (cmd == \"dump\") {\n if (! _queue->isEmpty()) {\n int counter = 1;\n _queue->reset();\n while (_queue->moveNext()) {\n cout << counter << \": \" << _queue->current() << endl;\n counter++;\n }\n } else {\n cout << \"There's no items in the queue\" << endl;\n }\n continue;\n }\n\n \/\/ Команда \"clear\"\n if (cmd == \"clear\") {\n _queue->clear();\n cout << \"The queue has been cleared\" << endl;\n continue;\n }\n\n \/\/ Команда \"help\"\n if (cmd == \"help\") {\n _printHelp();\n continue;\n }\n\n \/\/ Команда \"exit\"\n if (cmd == \"exit\") {\n break;\n }\n\n \/\/ Если мы дошли до сюда -- значит ввод не распознан как известная команда\n throw runtime_error(\"Unrecognized command \\\"\" + cmd + \"\\\"\");\n } catch (exception& e) {\n \/\/ Если возникло исключение -- выводим текст исключения в stderr\n cerr << \"ERROR: \" << e.what() << endl;\n }\n }\n}\n<|endoftext|>"} {"text":"<commit_before>#ifndef _Hasher_H_\n#define _Hasher_H_\n\n#include \"HashStrategy.hpp\"\n#include \"irods_error.hpp\"\n\n#include <string>\n#include <boost\/any.hpp>\n\nnamespace irods {\n\nconst std::string STRICT_HASH_POLICY( \"strict\" );\nconst std::string COMPATIBLE_HASH_POLICY( \"compatible\" );\n\nclass Hasher {\npublic:\n\n error init( const HashStrategy* );\n error update( const std::string& );\n error digest( std::string& messageDigest );\n\nprivate:\n const HashStrategy* _strategy = NULL;\n boost::any _context;\n error _stored_error;\n std::string _stored_digest;\n};\n\n}; \/\/ namespace irods\n\n#endif \/\/ _Hasher_H_\n<commit_msg>[#858] Added explicit default constructor to support older compilers<commit_after>#ifndef _Hasher_H_\n#define _Hasher_H_\n\n#include \"HashStrategy.hpp\"\n#include \"irods_error.hpp\"\n\n#include <string>\n#include <boost\/any.hpp>\n\nnamespace irods {\n\nconst std::string STRICT_HASH_POLICY( \"strict\" );\nconst std::string COMPATIBLE_HASH_POLICY( \"compatible\" );\n\nclass Hasher {\npublic:\n Hasher() : _strategy( NULL ) {}\n\n error init( const HashStrategy* );\n error update( const std::string& );\n error digest( std::string& messageDigest );\n\nprivate:\n const HashStrategy* _strategy;\n boost::any _context;\n error _stored_error;\n std::string _stored_digest;\n};\n\n}; \/\/ namespace irods\n\n#endif \/\/ _Hasher_H_\n<|endoftext|>"} {"text":"<commit_before>#include \"Rules\/PossibleForwardDeclarationRule.h\"\n\n#include \"Common\/Context.h\"\n#include \"Common\/OutputPrinter.h\"\n#include \"Common\/SourceLocationHelper.h\"\n#include \"Common\/TagTypeMatchers.h\"\n#include \"Common\/TagTypeNameHelper.h\"\n\n#include <clang\/AST\/Decl.h>\n\n#include <boost\/format.hpp>\n\n#include <algorithm>\n#include <vector>\n\nusing namespace llvm;\nusing namespace clang;\nusing namespace clang::ast_matchers;\n\nnamespace\n{\n\nQualType RecursivelyDesugarType(const QualType& type)\n{\n QualType desugaredType = type;\n\n while (true)\n {\n const ElaboratedType* elaboratedType = desugaredType->getAs<ElaboratedType>();\n if (elaboratedType != nullptr)\n {\n desugaredType = elaboratedType->desugar();\n continue;\n }\n\n if (desugaredType->isArrayType())\n {\n desugaredType = desugaredType->getAsArrayTypeUnsafe()->getElementType();\n continue;\n }\n\n const PointerType* pointerType = desugaredType->getAs<PointerType>();\n if (pointerType != nullptr)\n {\n desugaredType = pointerType->getPointeeType();\n continue;\n }\n\n const ReferenceType* referenceType = desugaredType->getAs<ReferenceType>();\n if (referenceType != nullptr)\n {\n desugaredType = referenceType->getPointeeType();\n continue;\n }\n\n break;\n }\n\n return desugaredType;\n}\n\nQualType RecursivelyDesugarTypedefType(const QualType& type)\n{\n QualType desugaredType = type;\n bool haveTypedefType = false;\n\n while (true)\n {\n const TypedefType* typedefType = desugaredType->getAs<TypedefType>();\n if (typedefType != nullptr)\n {\n desugaredType = typedefType->desugar();\n haveTypedefType = true;\n continue;\n }\n\n const ElaboratedType* elaboratedType = desugaredType->getAs<ElaboratedType>();\n if (elaboratedType != nullptr)\n {\n desugaredType = elaboratedType->desugar();\n continue;\n }\n\n if (desugaredType->isArrayType())\n {\n desugaredType = desugaredType->getAsArrayTypeUnsafe()->getElementType();\n continue;\n }\n\n const PointerType* pointerType = desugaredType->getAs<PointerType>();\n if (pointerType != nullptr)\n {\n desugaredType = pointerType->getPointeeType();\n continue;\n }\n\n const ReferenceType* referenceType = desugaredType->getAs<ReferenceType>();\n if (referenceType != nullptr)\n {\n desugaredType = referenceType->getPointeeType();\n continue;\n }\n\n break;\n }\n\n if (!haveTypedefType)\n {\n return QualType();\n }\n\n return desugaredType;\n}\n\n} \/\/ anonymous namespace\n\nnamespace clang\n{\nnamespace ast_matchers\n{\n\nAST_MATCHER_P(QualType, recursivelyDesugaredType, internal::Matcher<QualType>, InnerMatcher)\n{\n if (Node.isNull())\n return false;\n\n QualType desugaredType = RecursivelyDesugarType(Node);\n return InnerMatcher.matches(desugaredType, Finder, Builder);\n}\n\nAST_MATCHER_P(QualType, recursivelyDesugaredTypedefType, internal::Matcher<QualType>, InnerMatcher)\n{\n if (Node.isNull())\n return false;\n\n QualType desugaredType = RecursivelyDesugarTypedefType(Node);\n return InnerMatcher.matches(desugaredType, Finder, Builder);\n}\n\nAST_MATCHER_P(QualType, pointerOrReferenceTypeTo, internal::Matcher<QualType>, InnerMatcher)\n{\n if (Node.isNull())\n return false;\n\n const PointerType* pointerType = Node->getAs<PointerType>();\n if (pointerType != nullptr)\n {\n return InnerMatcher.matches(pointerType->getPointeeType(), Finder, Builder);\n }\n\n const ReferenceType* referenceType = Node->getAs<ReferenceType>();\n if (referenceType != nullptr)\n {\n return InnerMatcher.matches(referenceType->getPointeeType(), Finder, Builder);\n }\n\n return false;\n}\n\nAST_MATCHER(TagDecl, isForwardDeclaration)\n{\n return Node.getDefinition() == nullptr;\n}\n\nAST_MATCHER(EnumDecl, isScopedUsingClassTag)\n{\n return Node.isScopedUsingClassTag();\n}\n\n} \/\/ namespace ast_matchers\n} \/\/ namespace clang\n\n\ninternal::Matcher<QualType> CreateActualTagTypeMatcher()\n{\n return qualType(hasDeclaration(tagDecl(\n unless(isExpansionInSystemHeader()),\n anyOf(classTemplateSpecializationDecl().bind(\"classTemplate\"),\n enumDecl(unless(isScopedUsingClassTag())).bind(\"oldStyleEnum\"),\n tagDecl(isForwardDeclaration()).bind(\"existingForwardDeclaration\"),\n anything()))\n .bind(\"tagDecl\")));\n}\n\ninternal::Matcher<QualType> CreateTemplateTagTypeMatcher()\n{\n return templateSpecializationType(\n hasAnyTemplateArgument(\n refersToType(\n recursivelyDesugaredType(CreateActualTagTypeMatcher()))));\n}\n\ninternal::Matcher<QualType> CreateTagTypeMatcher()\n{\n return anyOf(qualType(recursivelyDesugaredTypedefType(CreateTemplateTagTypeMatcher())),\n qualType(recursivelyDesugaredTypedefType(CreateActualTagTypeMatcher())),\n qualType(recursivelyDesugaredType(CreateTemplateTagTypeMatcher())),\n qualType(pointerOrReferenceTypeTo(recursivelyDesugaredType(CreateActualTagTypeMatcher()))).bind(\"ptrOrRefType\"),\n qualType(recursivelyDesugaredType(CreateActualTagTypeMatcher())));\n}\n\nPossibleForwardDeclarationRule::PossibleForwardDeclarationRule(Context& context)\n : Rule(context)\n{}\n\nvoid PossibleForwardDeclarationRule::RegisterASTMatcherCallback(MatchFinder& finder)\n{\n finder.addMatcher(recordDecl().bind(\"recordDecl\"), this);\n finder.addMatcher(declRefExpr().bind(\"declRefExpr\"), this);\n finder.addMatcher(\n decl(anyOf(valueDecl(hasType(CreateTagTypeMatcher())),\n functionDecl(returns(CreateTagTypeMatcher())))).bind(\"declWithTagType\"),\n this);\n finder.addMatcher(expr(hasType(CreateTagTypeMatcher())).bind(\"exprWithTagType\"), this);\n}\n\nvoid PossibleForwardDeclarationRule::run(const MatchFinder::MatchResult& result)\n{\n m_sourceManager = result.SourceManager;\n\n const DeclRefExpr* declarationReferenceExpression = result.Nodes.getNodeAs<DeclRefExpr>(\"declRefExpr\");\n if (declarationReferenceExpression != nullptr)\n return HandleDeclarationReferenceExpression(declarationReferenceExpression);\n\n const CXXRecordDecl* recordDeclaration = result.Nodes.getNodeAs<CXXRecordDecl>(\"recordDecl\");\n if (recordDeclaration != nullptr)\n return HandleRecordDeclaration(recordDeclaration);\n\n const TagDecl* tagDeclaration = result.Nodes.getNodeAs<TagDecl>(\"tagDecl\");\n if (tagDeclaration == nullptr)\n return;\n\n if (IsInBlacklistedProjectHeader(tagDeclaration))\n return; \/\/ already blacklisted, so no point of checking further\n\n if (! IsInDirectlyIncludedProjectHeader(tagDeclaration))\n return;\n\n bool isExistingForwardDeclaration = result.Nodes.getNodeAs<Decl>(\"existingForwardDeclaration\") != nullptr;\n if (isExistingForwardDeclaration)\n return;\n\n tagDeclaration = tagDeclaration->getCanonicalDecl();\n\n bool isPointerOrReferenceType = result.Nodes.getNodeAs<QualType>(\"ptrOrRefType\") != nullptr;\n bool isTemplateClassType = result.Nodes.getNodeAs<Decl>(\"classTemplate\") != nullptr;\n bool isOldStyleEnum = result.Nodes.getNodeAs<Decl>(\"oldStyleEnum\") != nullptr;\n\n const Decl* declarationWithTagType = result.Nodes.getNodeAs<Decl>(\"declWithTagType\");\n if (declarationWithTagType != nullptr)\n return HandleDeclarationWithTagType(tagDeclaration,\n declarationWithTagType,\n isPointerOrReferenceType,\n isTemplateClassType,\n isOldStyleEnum);\n\n const Expr* expressionWithTagType = result.Nodes.getNodeAs<Expr>(\"exprWithTagType\");\n if (expressionWithTagType != nullptr)\n return HandleExpressionWithTagType(tagDeclaration, expressionWithTagType);\n}\n\nbool PossibleForwardDeclarationRule::IsInBlacklistedProjectHeader(const Decl* declaration)\n{\n FileID tagDeclarationFileID = m_sourceManager->getFileID(declaration->getLocation());\n bool result = m_blacklistedProjectHeaders.count(tagDeclarationFileID) > 0;\n return result;\n}\n\nvoid PossibleForwardDeclarationRule::BlacklistIncludedProjectHeader(const Decl* declaration)\n{\n FileID tagDeclarationFileID = m_sourceManager->getFileID(declaration->getLocation());\n m_blacklistedProjectHeaders.insert(tagDeclarationFileID);\n}\nbool PossibleForwardDeclarationRule::IsInDirectlyIncludedProjectHeader(const Decl* declaration)\n{\n SourceLocation tagDeclarationLocation = declaration->getLocation();\n if (! m_context.sourceLocationHelper.IsLocationInProjectSourceFile(tagDeclarationLocation, *m_sourceManager))\n return false;\n\n FileID tagDeclarationFileID = m_sourceManager->getFileID(declaration->getLocation());\n if (tagDeclarationFileID.isInvalid())\n return false;\n\n SourceLocation tagDeclarationIncludeLocation = m_sourceManager->getIncludeLoc(tagDeclarationFileID);\n if (tagDeclarationIncludeLocation.isInvalid())\n return false;\n\n FileID tagDeclarationIncludeFileID = m_sourceManager->getFileID(tagDeclarationIncludeLocation);\n if (tagDeclarationIncludeFileID.isInvalid())\n return false;\n\n FileID mainFileID = m_context.sourceLocationHelper.GetMainFileID(*m_sourceManager);\n if (mainFileID.isInvalid())\n return false;\n\n \/\/ we want declaration from directly included project header (no indirect dependencies)\n return tagDeclarationFileID != mainFileID && tagDeclarationIncludeFileID == mainFileID;\n}\n\nvoid PossibleForwardDeclarationRule::HandleDeclarationReferenceExpression(const DeclRefExpr* declarationReferenceExpression)\n{\n SourceLocation location = declarationReferenceExpression->getLocation();\n if (! m_context.sourceLocationHelper.IsLocationOfInterest(GetName(), location, *m_sourceManager))\n return;\n\n const Decl* declaration = declarationReferenceExpression->getDecl();\n if (IsInDirectlyIncludedProjectHeader(declaration))\n {\n BlacklistIncludedProjectHeader(declaration);\n }\n}\n\nvoid PossibleForwardDeclarationRule::HandleRecordDeclaration(const CXXRecordDecl* recordDeclaration)\n{\n SourceLocation location = recordDeclaration->getLocation();\n if (! m_context.sourceLocationHelper.IsLocationOfInterest(GetName(), location, *m_sourceManager))\n return;\n\n const CXXRecordDecl* recordDefinition = recordDeclaration->getDefinition();\n if (recordDefinition == nullptr)\n return;\n\n for (const auto& base : recordDefinition->bases())\n {\n const RecordType* baseRecordType = base.getType()->getAs<RecordType>();\n if (baseRecordType == nullptr)\n continue;\n\n const RecordDecl* baseDeclaration = baseRecordType->getDecl();\n if (baseDeclaration == nullptr)\n continue;\n\n const RecordDecl* baseDefinition = baseDeclaration->getDefinition();\n if (baseDefinition == nullptr)\n continue;\n\n\n if (IsInDirectlyIncludedProjectHeader(baseDefinition))\n {\n BlacklistIncludedProjectHeader(baseDefinition);\n }\n }\n}\n\nvoid PossibleForwardDeclarationRule::HandleDeclarationWithTagType(const TagDecl* tagDeclaration,\n const Decl* declarationWithTagType,\n bool isPointerOrReferenceType,\n bool isTemplateClassType,\n bool isOldStyleEnum)\n{\n SourceLocation location = declarationWithTagType->getLocation();\n if (! m_context.sourceLocationHelper.IsLocationOfInterest(GetName(), location, *m_sourceManager))\n return;\n\n if (isPointerOrReferenceType &&\n !isTemplateClassType &&\n !isOldStyleEnum &&\n (isa<ParmVarDecl>(declarationWithTagType) ||\n isa<FieldDecl>(declarationWithTagType) ||\n isa<FunctionDecl>(declarationWithTagType)))\n {\n if (m_candidateForwardDeclarations.count(tagDeclaration) == 0)\n {\n m_candidateForwardDeclarations.insert(std::make_pair(tagDeclaration, location));\n }\n }\n else\n {\n m_candidateForwardDeclarations.erase(tagDeclaration);\n BlacklistIncludedProjectHeader(tagDeclaration);\n }\n}\n\nvoid PossibleForwardDeclarationRule::HandleExpressionWithTagType(const TagDecl* tagDeclaration,\n const Expr* expressionWithTagType)\n{\n SourceLocation location = expressionWithTagType->getLocStart();\n if (! m_context.sourceLocationHelper.IsLocationOfInterest(GetName(), location, *m_sourceManager))\n return;\n\n m_candidateForwardDeclarations.erase(tagDeclaration);\n BlacklistIncludedProjectHeader(tagDeclaration);\n}\n\nvoid PossibleForwardDeclarationRule::onEndOfTranslationUnit()\n{\n using DeclarationInfoPair = std::pair<const TagDecl*, SourceLocation>;\n std::vector<DeclarationInfoPair> forwardDeclarations;\n for (const DeclarationInfoPair& forwardDeclaration : m_candidateForwardDeclarations)\n {\n if (! IsInBlacklistedProjectHeader(forwardDeclaration.first))\n {\n forwardDeclarations.push_back(forwardDeclaration);\n }\n }\n\n std::sort(forwardDeclarations.begin(),\n forwardDeclarations.end(),\n [this](const DeclarationInfoPair& left, const DeclarationInfoPair& right)\n {\n return m_sourceManager->isBeforeInTranslationUnit(left.second, right.second);\n });\n\n for (const DeclarationInfoPair& forwardDeclaration : forwardDeclarations)\n {\n m_context.outputPrinter->PrintRuleViolation(\n \"possible forward declaration\",\n Severity::Information,\n boost::str(boost::format(\"%s '%s' can be forward declared instead of #included\")\n % GetTagTypeString(forwardDeclaration.first)\n % forwardDeclaration.first->getQualifiedNameAsString()),\n forwardDeclaration.second,\n *m_sourceManager);\n }\n\n m_candidateForwardDeclarations.clear();\n}\n<commit_msg>Fix for runtime assert in debug builds<commit_after>#include \"Rules\/PossibleForwardDeclarationRule.h\"\n\n#include \"Common\/Context.h\"\n#include \"Common\/OutputPrinter.h\"\n#include \"Common\/SourceLocationHelper.h\"\n#include \"Common\/TagTypeMatchers.h\"\n#include \"Common\/TagTypeNameHelper.h\"\n\n#include <clang\/AST\/Decl.h>\n\n#include <boost\/format.hpp>\n\n#include <algorithm>\n#include <vector>\n\nusing namespace llvm;\nusing namespace clang;\nusing namespace clang::ast_matchers;\n\nnamespace\n{\n\nQualType RecursivelyDesugarType(const QualType& type)\n{\n QualType desugaredType = type;\n\n while (true)\n {\n const ElaboratedType* elaboratedType = desugaredType->getAs<ElaboratedType>();\n if (elaboratedType != nullptr)\n {\n desugaredType = elaboratedType->desugar();\n continue;\n }\n\n if (desugaredType->isArrayType())\n {\n desugaredType = desugaredType->getAsArrayTypeUnsafe()->getElementType();\n continue;\n }\n\n const PointerType* pointerType = desugaredType->getAs<PointerType>();\n if (pointerType != nullptr)\n {\n desugaredType = pointerType->getPointeeType();\n continue;\n }\n\n const ReferenceType* referenceType = desugaredType->getAs<ReferenceType>();\n if (referenceType != nullptr)\n {\n desugaredType = referenceType->getPointeeType();\n continue;\n }\n\n break;\n }\n\n return desugaredType;\n}\n\nQualType RecursivelyDesugarTypedefType(const QualType& type)\n{\n QualType desugaredType = type;\n bool haveTypedefType = false;\n\n while (true)\n {\n const TypedefType* typedefType = desugaredType->getAs<TypedefType>();\n if (typedefType != nullptr)\n {\n desugaredType = typedefType->desugar();\n haveTypedefType = true;\n continue;\n }\n\n const ElaboratedType* elaboratedType = desugaredType->getAs<ElaboratedType>();\n if (elaboratedType != nullptr)\n {\n desugaredType = elaboratedType->desugar();\n continue;\n }\n\n if (desugaredType->isArrayType())\n {\n desugaredType = desugaredType->getAsArrayTypeUnsafe()->getElementType();\n continue;\n }\n\n const PointerType* pointerType = desugaredType->getAs<PointerType>();\n if (pointerType != nullptr)\n {\n desugaredType = pointerType->getPointeeType();\n continue;\n }\n\n const ReferenceType* referenceType = desugaredType->getAs<ReferenceType>();\n if (referenceType != nullptr)\n {\n desugaredType = referenceType->getPointeeType();\n continue;\n }\n\n break;\n }\n\n if (!haveTypedefType)\n {\n return QualType();\n }\n\n return desugaredType;\n}\n\n} \/\/ anonymous namespace\n\nnamespace clang\n{\nnamespace ast_matchers\n{\n\nAST_MATCHER_P(QualType, recursivelyDesugaredType, internal::Matcher<QualType>, InnerMatcher)\n{\n if (Node.isNull())\n return false;\n\n QualType desugaredType = RecursivelyDesugarType(Node);\n return InnerMatcher.matches(desugaredType, Finder, Builder);\n}\n\nAST_MATCHER_P(QualType, recursivelyDesugaredTypedefType, internal::Matcher<QualType>, InnerMatcher)\n{\n if (Node.isNull())\n return false;\n\n QualType desugaredType = RecursivelyDesugarTypedefType(Node);\n return InnerMatcher.matches(desugaredType, Finder, Builder);\n}\n\nAST_MATCHER_P(QualType, pointerOrReferenceTypeTo, internal::Matcher<QualType>, InnerMatcher)\n{\n if (Node.isNull())\n return false;\n\n const PointerType* pointerType = Node->getAs<PointerType>();\n if (pointerType != nullptr)\n {\n return InnerMatcher.matches(pointerType->getPointeeType(), Finder, Builder);\n }\n\n const ReferenceType* referenceType = Node->getAs<ReferenceType>();\n if (referenceType != nullptr)\n {\n return InnerMatcher.matches(referenceType->getPointeeType(), Finder, Builder);\n }\n\n return false;\n}\n\nAST_MATCHER(TagDecl, isForwardDeclaration)\n{\n return Node.getDefinition() == nullptr;\n}\n\nAST_MATCHER(EnumDecl, isScopedUsingClassTag)\n{\n return Node.isScopedUsingClassTag();\n}\n\n} \/\/ namespace ast_matchers\n} \/\/ namespace clang\n\n\ninternal::Matcher<QualType> CreateActualTagTypeMatcher()\n{\n return qualType(hasDeclaration(tagDecl(\n unless(isExpansionInSystemHeader()),\n anyOf(classTemplateSpecializationDecl().bind(\"classTemplate\"),\n enumDecl(unless(isScopedUsingClassTag())).bind(\"oldStyleEnum\"),\n tagDecl(isForwardDeclaration()).bind(\"existingForwardDeclaration\"),\n anything()))\n .bind(\"tagDecl\")));\n}\n\ninternal::Matcher<QualType> CreateTemplateTagTypeMatcher()\n{\n return templateSpecializationType(\n hasAnyTemplateArgument(\n refersToType(\n recursivelyDesugaredType(CreateActualTagTypeMatcher()))));\n}\n\ninternal::Matcher<QualType> CreateTagTypeMatcher()\n{\n return anyOf(qualType(recursivelyDesugaredTypedefType(CreateTemplateTagTypeMatcher())),\n qualType(recursivelyDesugaredTypedefType(CreateActualTagTypeMatcher())),\n qualType(recursivelyDesugaredType(CreateTemplateTagTypeMatcher())),\n qualType(pointerOrReferenceTypeTo(recursivelyDesugaredType(CreateActualTagTypeMatcher()))).bind(\"ptrOrRefType\"),\n qualType(recursivelyDesugaredType(CreateActualTagTypeMatcher())));\n}\n\nPossibleForwardDeclarationRule::PossibleForwardDeclarationRule(Context& context)\n : Rule(context)\n{}\n\nvoid PossibleForwardDeclarationRule::RegisterASTMatcherCallback(MatchFinder& finder)\n{\n finder.addMatcher(recordDecl().bind(\"recordDecl\"), this);\n finder.addMatcher(declRefExpr().bind(\"declRefExpr\"), this);\n finder.addMatcher(\n decl(anyOf(valueDecl(hasType(CreateTagTypeMatcher())),\n functionDecl(returns(CreateTagTypeMatcher())))).bind(\"declWithTagType\"),\n this);\n finder.addMatcher(expr(hasType(CreateTagTypeMatcher())).bind(\"exprWithTagType\"), this);\n}\n\nvoid PossibleForwardDeclarationRule::run(const MatchFinder::MatchResult& result)\n{\n m_sourceManager = result.SourceManager;\n\n const DeclRefExpr* declarationReferenceExpression = result.Nodes.getNodeAs<DeclRefExpr>(\"declRefExpr\");\n if (declarationReferenceExpression != nullptr)\n return HandleDeclarationReferenceExpression(declarationReferenceExpression);\n\n const CXXRecordDecl* recordDeclaration = result.Nodes.getNodeAs<CXXRecordDecl>(\"recordDecl\");\n if (recordDeclaration != nullptr)\n return HandleRecordDeclaration(recordDeclaration);\n\n const TagDecl* tagDeclaration = result.Nodes.getNodeAs<TagDecl>(\"tagDecl\");\n if (tagDeclaration == nullptr)\n return;\n\n if (IsInBlacklistedProjectHeader(tagDeclaration))\n return; \/\/ already blacklisted, so no point of checking further\n\n if (! IsInDirectlyIncludedProjectHeader(tagDeclaration))\n return;\n\n bool isExistingForwardDeclaration = result.Nodes.getNodeAs<Decl>(\"existingForwardDeclaration\") != nullptr;\n if (isExistingForwardDeclaration)\n return;\n\n tagDeclaration = tagDeclaration->getCanonicalDecl();\n\n bool isPointerOrReferenceType = result.Nodes.getNodeAs<QualType>(\"ptrOrRefType\") != nullptr;\n bool isTemplateClassType = result.Nodes.getNodeAs<Decl>(\"classTemplate\") != nullptr;\n bool isOldStyleEnum = result.Nodes.getNodeAs<Decl>(\"oldStyleEnum\") != nullptr;\n\n const Decl* declarationWithTagType = result.Nodes.getNodeAs<Decl>(\"declWithTagType\");\n if (declarationWithTagType != nullptr)\n return HandleDeclarationWithTagType(tagDeclaration,\n declarationWithTagType,\n isPointerOrReferenceType,\n isTemplateClassType,\n isOldStyleEnum);\n\n const Expr* expressionWithTagType = result.Nodes.getNodeAs<Expr>(\"exprWithTagType\");\n if (expressionWithTagType != nullptr)\n return HandleExpressionWithTagType(tagDeclaration, expressionWithTagType);\n}\n\nbool PossibleForwardDeclarationRule::IsInBlacklistedProjectHeader(const Decl* declaration)\n{\n FileID tagDeclarationFileID = m_sourceManager->getFileID(declaration->getLocation());\n return !tagDeclarationFileID.isInvalid() && m_blacklistedProjectHeaders.count(tagDeclarationFileID) > 0;\n}\n\nvoid PossibleForwardDeclarationRule::BlacklistIncludedProjectHeader(const Decl* declaration)\n{\n FileID tagDeclarationFileID = m_sourceManager->getFileID(declaration->getLocation());\n m_blacklistedProjectHeaders.insert(tagDeclarationFileID);\n}\nbool PossibleForwardDeclarationRule::IsInDirectlyIncludedProjectHeader(const Decl* declaration)\n{\n SourceLocation tagDeclarationLocation = declaration->getLocation();\n if (! m_context.sourceLocationHelper.IsLocationInProjectSourceFile(tagDeclarationLocation, *m_sourceManager))\n return false;\n\n FileID tagDeclarationFileID = m_sourceManager->getFileID(declaration->getLocation());\n if (tagDeclarationFileID.isInvalid())\n return false;\n\n SourceLocation tagDeclarationIncludeLocation = m_sourceManager->getIncludeLoc(tagDeclarationFileID);\n if (tagDeclarationIncludeLocation.isInvalid())\n return false;\n\n FileID tagDeclarationIncludeFileID = m_sourceManager->getFileID(tagDeclarationIncludeLocation);\n if (tagDeclarationIncludeFileID.isInvalid())\n return false;\n\n FileID mainFileID = m_context.sourceLocationHelper.GetMainFileID(*m_sourceManager);\n if (mainFileID.isInvalid())\n return false;\n\n \/\/ we want declaration from directly included project header (no indirect dependencies)\n return tagDeclarationFileID != mainFileID && tagDeclarationIncludeFileID == mainFileID;\n}\n\nvoid PossibleForwardDeclarationRule::HandleDeclarationReferenceExpression(const DeclRefExpr* declarationReferenceExpression)\n{\n SourceLocation location = declarationReferenceExpression->getLocation();\n if (! m_context.sourceLocationHelper.IsLocationOfInterest(GetName(), location, *m_sourceManager))\n return;\n\n const Decl* declaration = declarationReferenceExpression->getDecl();\n if (IsInDirectlyIncludedProjectHeader(declaration))\n {\n BlacklistIncludedProjectHeader(declaration);\n }\n}\n\nvoid PossibleForwardDeclarationRule::HandleRecordDeclaration(const CXXRecordDecl* recordDeclaration)\n{\n SourceLocation location = recordDeclaration->getLocation();\n if (! m_context.sourceLocationHelper.IsLocationOfInterest(GetName(), location, *m_sourceManager))\n return;\n\n const CXXRecordDecl* recordDefinition = recordDeclaration->getDefinition();\n if (recordDefinition == nullptr)\n return;\n\n for (const auto& base : recordDefinition->bases())\n {\n const RecordType* baseRecordType = base.getType()->getAs<RecordType>();\n if (baseRecordType == nullptr)\n continue;\n\n const RecordDecl* baseDeclaration = baseRecordType->getDecl();\n if (baseDeclaration == nullptr)\n continue;\n\n const RecordDecl* baseDefinition = baseDeclaration->getDefinition();\n if (baseDefinition == nullptr)\n continue;\n\n\n if (IsInDirectlyIncludedProjectHeader(baseDefinition))\n {\n BlacklistIncludedProjectHeader(baseDefinition);\n }\n }\n}\n\nvoid PossibleForwardDeclarationRule::HandleDeclarationWithTagType(const TagDecl* tagDeclaration,\n const Decl* declarationWithTagType,\n bool isPointerOrReferenceType,\n bool isTemplateClassType,\n bool isOldStyleEnum)\n{\n SourceLocation location = declarationWithTagType->getLocation();\n if (! m_context.sourceLocationHelper.IsLocationOfInterest(GetName(), location, *m_sourceManager))\n return;\n\n if (isPointerOrReferenceType &&\n !isTemplateClassType &&\n !isOldStyleEnum &&\n (isa<ParmVarDecl>(declarationWithTagType) ||\n isa<FieldDecl>(declarationWithTagType) ||\n isa<FunctionDecl>(declarationWithTagType)))\n {\n if (m_candidateForwardDeclarations.count(tagDeclaration) == 0)\n {\n m_candidateForwardDeclarations.insert(std::make_pair(tagDeclaration, location));\n }\n }\n else\n {\n m_candidateForwardDeclarations.erase(tagDeclaration);\n BlacklistIncludedProjectHeader(tagDeclaration);\n }\n}\n\nvoid PossibleForwardDeclarationRule::HandleExpressionWithTagType(const TagDecl* tagDeclaration,\n const Expr* expressionWithTagType)\n{\n SourceLocation location = expressionWithTagType->getLocStart();\n if (! m_context.sourceLocationHelper.IsLocationOfInterest(GetName(), location, *m_sourceManager))\n return;\n\n m_candidateForwardDeclarations.erase(tagDeclaration);\n BlacklistIncludedProjectHeader(tagDeclaration);\n}\n\nvoid PossibleForwardDeclarationRule::onEndOfTranslationUnit()\n{\n using DeclarationInfoPair = std::pair<const TagDecl*, SourceLocation>;\n std::vector<DeclarationInfoPair> forwardDeclarations;\n for (const DeclarationInfoPair& forwardDeclaration : m_candidateForwardDeclarations)\n {\n if (! IsInBlacklistedProjectHeader(forwardDeclaration.first))\n {\n forwardDeclarations.push_back(forwardDeclaration);\n }\n }\n\n std::sort(forwardDeclarations.begin(),\n forwardDeclarations.end(),\n [this](const DeclarationInfoPair& left, const DeclarationInfoPair& right)\n {\n return m_sourceManager->isBeforeInTranslationUnit(left.second, right.second);\n });\n\n for (const DeclarationInfoPair& forwardDeclaration : forwardDeclarations)\n {\n m_context.outputPrinter->PrintRuleViolation(\n \"possible forward declaration\",\n Severity::Information,\n boost::str(boost::format(\"%s '%s' can be forward declared instead of #included\")\n % GetTagTypeString(forwardDeclaration.first)\n % forwardDeclaration.first->getQualifiedNameAsString()),\n forwardDeclaration.second,\n *m_sourceManager);\n }\n\n m_candidateForwardDeclarations.clear();\n}\n<|endoftext|>"} {"text":"<commit_before><commit_msg>Hacky workaround for asymmetric fov issue<commit_after><|endoftext|>"} {"text":"<commit_before>#ifndef ALEPH_GEOMETRY_COVER_TREE_HH__\n#define ALEPH_GEOMETRY_COVER_TREE_HH__\n\n#include <iterator>\n#include <limits>\n#include <memory>\n#include <ostream>\n#include <queue>\n#include <stdexcept>\n#include <vector>\n\n\/\/ FIXME: remove after debugging\n#include <iostream>\n\n#include <cassert>\n#include <cmath>\n\nnamespace aleph\n{\n\nnamespace geometry\n{\n\n\/**\n @class CoverTree\n @brief Generic cover tree data structure\n\n This class models a cover tree data structure, as described in the\n paper \"Cover trees for nearest neighbor\" by Beygelzimer et al.; an\n implementation is given at:\n\n http:\/\/hunch.net\/~jl\/projects\/cover_tree\/cover_tree.html\n\n This implementation attempts to be as generic as possible. It uses\n the simplified description of the cover tree, as given by Izbicki,\n Shelton in \"Faster Cover Trees\".\n*\/\n\ntemplate <class Point, class Metric> class CoverTree\n{\npublic:\n\n \/**\n Covering constant of the cover tree. It might make sense to change\n this later on in order to improve performance. Some papers set the\n constant to `1.3`.\n *\/\n\n constexpr static const double coveringConstant = 2.0;\n\n class Node\n {\n public:\n\n \/** Creates a new node that stores a point *\/\n Node( const Point& point, unsigned level )\n : _point( point )\n , _level( level )\n {\n assert( _level >= 1 );\n }\n\n \/** Calculates current covering distance of the node *\/\n double coveringDistance() const noexcept\n {\n return std::pow( coveringConstant, static_cast<double>( _level ) );\n }\n\n void addChild( const Point& p )\n {\n _children.push_back( std::unique_ptr<Node>( new Node( p, _level - 1 ) ) );\n }\n\n \/** @returns true if the node is a leaf node *\/\n bool isLeaf() const noexcept\n {\n return _children.empty();\n }\n\n void insert( const Point& p )\n {\n auto d = Metric()( _point, p );\n\n std::cerr << __PRETTY_FUNCTION__ << \": Covering distance = \" << this->coveringDistance() << \"\\n\";\n std::cerr << __PRETTY_FUNCTION__ << \": Distance from point to root = \" << d << \"\\n\";\n\n if( d > this->coveringDistance() )\n {\n while( d > 2 * this->coveringDistance() )\n {\n std::cerr << __PRETTY_FUNCTION__ << \": Distance is bigger than covering distance; need to raise level of tree\\n\";\n\n std::stack<const Node*> nodes;\n nodes.push( this );\n\n const Node* leaf = nullptr;\n const Node* parent = nullptr;\n\n while( !nodes.empty() )\n {\n auto&& node = nodes.top();\n for( auto&& child : parent->_children )\n {\n if( child->isLeaf() )\n {\n leaf = child.get();\n parent = node;\n break;\n }\n }\n\n nodes.pop();\n }\n\n \/\/ There is no leaf, so there is nothing to do and we just\n \/\/ skip to the bottom where we add the current node as the\n \/\/ new root of the tree.\n if( !leaf )\n break;\n\n assert( leaf );\n assert( parent );\n\n std::cerr << \"Oh noes!\\n\";\n throw \"CRAP\";\n\n \/\/ - Find any leaf node that is accessible from the current subtree\n \/\/ - Remove said leaf $q$\n \/\/ - Make the leaf node the new root node, with the remainder of\n \/\/ the tree as a child node\n }\n\n \/\/ Make the new point $p$ a new root node with the existing root\n \/\/ and, consequently, the remaining tree, as the only child.\n\n auto oldRoot\n = std::unique_ptr<Node>( new Node( this->_point, this->_level ) );\n\n for( auto&& child : _children )\n oldRoot->_children.push_back( std::move( child ) );\n\n _point = p;\n _level = _level + 1;\n\n _children.clear();\n _children.push_back( std::move( oldRoot ) );\n\n return;\n }\n\n return insert_( p );\n }\n\n \/**\n Auxiliary function for performing the recursive insertion of a new\n node into the tree.\n *\/\n\n void insert_( const Point& p )\n {\n for( auto&& child : _children )\n {\n auto d = Metric()( child->_point, p );\n if( d <= child->coveringDistance() )\n {\n std::cerr << __PRETTY_FUNCTION__ << \": Recursive enumeration of the tree\\n\";\n\n \/\/ We found a node in which the new point can be inserted\n \/\/ *without* violating the covering invariant.\n child->insert_( p );\n return;\n }\n }\n\n \/\/ Add the new point as a child of the current root node. This\n \/\/ might require updating levels.\n\n if( _children.empty() )\n _level += 1;\n\n std::cerr << \"ADDING POINT \" << p << \" TO ROOT\\n\";\n\n this->addChild( p );\n }\n\n Point _point; \/\/< The point stored in the node\n unsigned _level; \/\/< The level of the node (>= 1)\n\n \/**\n All children of the node. Their order depends on the insertion\n order into the data set.\n *\/\n\n std::vector< std::unique_ptr<Node> > _children;\n };\n\n \/**\n Inserts a new point into the cover tree. If the tree is empty,\n the new point will become the root of the tree. Else, it shall\n be inserted according to the covering invariant.\n *\/\n\n void insert( const Point& p )\n {\n if( !_root )\n _root = std::unique_ptr<Node>( new Node(p,1) );\n else\n _root->insert( p );\n\n this->updateLevels();\n }\n\n \/\/ Pretty-printing function for the tree; this is only meant for\n \/\/ debugging purposes and could conceivably be implemented using\n \/\/ `std::ostream`.\n void print( std::ostream& o )\n {\n std::queue<const Node*> nodes;\n nodes.push( _root.get() );\n\n while( !nodes.empty() )\n {\n {\n auto n = nodes.size();\n\n for( decltype(n) i = 0; i < n; i++ )\n {\n auto&& node = nodes.front();\n\n if( i == 0 )\n o << node->_level << \": \";\n else\n o << \" \";\n\n o << node->_point;\n\n for( auto&& child : node->_children )\n nodes.push( child.get() );\n\n nodes.pop();\n }\n\n o << \"\\n\";\n }\n }\n }\n\nprivate:\n\n \/**\n Updates the levels of a cover tree. This function ensures that all\n information is being represented correctly. It is not mentioned in\n the original paper but appears to be necessary.\n *\/\n\n void updateLevels()\n {\n \/\/ Forward pass ----------------------------------------------------\n \/\/\n \/\/ Determine depth of the tree. This is required in order to assign\n \/\/ levels correctly later on.\n\n unsigned depth = 0;\n\n std::queue<const Node*> nodes;\n nodes.push( _root.get() );\n\n while( !nodes.empty() )\n {\n auto n = nodes.size();\n\n for( decltype(n) i = 0; i < n; i++ )\n {\n auto node = nodes.front();\n nodes.pop();\n\n for( auto&& child : node->_children )\n nodes.push( child.get() );\n }\n\n ++depth;\n }\n\n assert( nodes.empty() );\n\n \/\/ Backward pass ---------------------------------------------------\n \/\/\n \/\/ Set the level of the root node and update child levels. Note that\n \/\/ all nodes will be traversed because this function is dumb.\n\n _root->_level = depth;\n\n nodes.push( _root.get() );\n\n while( !nodes.empty() )\n {\n {\n auto&& parent = nodes.front();\n\n for( auto&& child : parent->_children )\n {\n assert( parent->_level >= 1 );\n\n child->_level = parent->_level - 1;\n nodes.push( child.get() );\n }\n }\n\n nodes.pop();\n }\n }\n\n \/** Root pointer of the tree *\/\n std::unique_ptr<Node> _root;\n};\n\n} \/\/ namespace geometry\n\n} \/\/ namespace aleph\n\n#endif\n<commit_msg>Removed obsolete function<commit_after>#ifndef ALEPH_GEOMETRY_COVER_TREE_HH__\n#define ALEPH_GEOMETRY_COVER_TREE_HH__\n\n#include <iterator>\n#include <limits>\n#include <memory>\n#include <ostream>\n#include <queue>\n#include <stack>\n#include <stdexcept>\n#include <vector>\n\n\/\/ FIXME: remove after debugging\n#include <iostream>\n\n#include <cassert>\n#include <cmath>\n\nnamespace aleph\n{\n\nnamespace geometry\n{\n\n\/**\n @class CoverTree\n @brief Generic cover tree data structure\n\n This class models a cover tree data structure, as described in the\n paper \"Cover trees for nearest neighbor\" by Beygelzimer et al.; an\n implementation is given at:\n\n http:\/\/hunch.net\/~jl\/projects\/cover_tree\/cover_tree.html\n\n This implementation attempts to be as generic as possible. It uses\n the simplified description of the cover tree, as given by Izbicki,\n Shelton in \"Faster Cover Trees\".\n*\/\n\ntemplate <class Point, class Metric> class CoverTree\n{\npublic:\n\n \/**\n Covering constant of the cover tree. It might make sense to change\n this later on in order to improve performance. Some papers set the\n constant to `1.3`.\n *\/\n\n constexpr static const double coveringConstant = 2.0;\n\n class Node\n {\n public:\n\n \/** Creates a new node that stores a point *\/\n Node( const Point& point, unsigned level )\n : _point( point )\n , _level( level )\n {\n assert( _level >= 1 );\n }\n\n \/** Calculates current covering distance of the node *\/\n double coveringDistance() const noexcept\n {\n return std::pow( coveringConstant, static_cast<double>( _level ) );\n }\n\n \/** @returns true if the node is a leaf node *\/\n bool isLeaf() const noexcept\n {\n return _children.empty();\n }\n\n void insert( const Point& p )\n {\n auto d = Metric()( _point, p );\n\n std::cerr << __PRETTY_FUNCTION__ << \": Covering distance = \" << this->coveringDistance() << \"\\n\";\n std::cerr << __PRETTY_FUNCTION__ << \": Distance from point to root = \" << d << \"\\n\";\n\n if( d > this->coveringDistance() )\n {\n while( d > 2 * this->coveringDistance() )\n {\n std::cerr << __PRETTY_FUNCTION__ << \": Distance is bigger than covering distance; need to raise level of tree\\n\";\n\n std::stack<const Node*> nodes;\n nodes.push( this );\n\n const Node* leaf = nullptr;\n const Node* parent = nullptr;\n\n while( !nodes.empty() )\n {\n auto&& node = nodes.top();\n for( auto&& child : parent->_children )\n {\n if( child->isLeaf() )\n {\n leaf = child.get();\n parent = node;\n break;\n }\n }\n\n nodes.pop();\n }\n\n \/\/ There is no leaf, so there is nothing to do and we just\n \/\/ skip to the bottom where we add the current node as the\n \/\/ new root of the tree.\n if( !leaf )\n break;\n\n assert( leaf );\n assert( parent );\n\n std::cerr << \"Oh noes!\\n\";\n throw \"CRAP\";\n\n \/\/ - Find any leaf node that is accessible from the current subtree\n \/\/ - Remove said leaf $q$\n \/\/ - Make the leaf node the new root node, with the remainder of\n \/\/ the tree as a child node\n }\n\n \/\/ Make the new point $p$ a new root node with the existing root\n \/\/ and, consequently, the remaining tree, as the only child.\n\n auto oldRoot\n = std::unique_ptr<Node>( new Node( this->_point, this->_level ) );\n\n for( auto&& child : _children )\n oldRoot->_children.push_back( std::move( child ) );\n\n _point = p;\n _level = _level + 1;\n\n _children.clear();\n _children.push_back( std::move( oldRoot ) );\n\n return;\n }\n\n return insert_( p );\n }\n\n \/**\n Auxiliary function for performing the recursive insertion of a new\n node into the tree.\n *\/\n\n void insert_( const Point& p )\n {\n for( auto&& child : _children )\n {\n auto d = Metric()( child->_point, p );\n if( d <= child->coveringDistance() )\n {\n std::cerr << __PRETTY_FUNCTION__ << \": Recursive enumeration of the tree\\n\";\n\n \/\/ We found a node in which the new point can be inserted\n \/\/ *without* violating the covering invariant.\n child->insert_( p );\n return;\n }\n }\n\n \/\/ Add the new point as a child of the current root node. This\n \/\/ might require updating levels.\n\n if( _children.empty() )\n _level += 1;\n\n _children.push_back( std::unique_ptr<Node>( new Node( p, _level - 1 ) ) );\n }\n\n Point _point; \/\/< The point stored in the node\n unsigned _level; \/\/< The level of the node (>= 1)\n\n \/**\n All children of the node. Their order depends on the insertion\n order into the data set.\n *\/\n\n std::vector< std::unique_ptr<Node> > _children;\n };\n\n \/**\n Inserts a new point into the cover tree. If the tree is empty,\n the new point will become the root of the tree. Else, it shall\n be inserted according to the covering invariant.\n *\/\n\n void insert( const Point& p )\n {\n if( !_root )\n _root = std::unique_ptr<Node>( new Node(p,1) );\n else\n _root->insert( p );\n\n this->updateLevels();\n }\n\n \/\/ Pretty-printing function for the tree; this is only meant for\n \/\/ debugging purposes and could conceivably be implemented using\n \/\/ `std::ostream`.\n void print( std::ostream& o )\n {\n std::queue<const Node*> nodes;\n nodes.push( _root.get() );\n\n while( !nodes.empty() )\n {\n {\n auto n = nodes.size();\n\n for( decltype(n) i = 0; i < n; i++ )\n {\n auto&& node = nodes.front();\n\n if( i == 0 )\n o << node->_level << \": \";\n else\n o << \" \";\n\n o << node->_point;\n\n for( auto&& child : node->_children )\n nodes.push( child.get() );\n\n nodes.pop();\n }\n\n o << \"\\n\";\n }\n }\n }\n\nprivate:\n\n \/**\n Updates the levels of a cover tree. This function ensures that all\n information is being represented correctly. It is not mentioned in\n the original paper but appears to be necessary.\n *\/\n\n void updateLevels()\n {\n \/\/ Forward pass ----------------------------------------------------\n \/\/\n \/\/ Determine depth of the tree. This is required in order to assign\n \/\/ levels correctly later on.\n\n unsigned depth = 0;\n\n std::queue<const Node*> nodes;\n nodes.push( _root.get() );\n\n while( !nodes.empty() )\n {\n auto n = nodes.size();\n\n for( decltype(n) i = 0; i < n; i++ )\n {\n auto node = nodes.front();\n nodes.pop();\n\n for( auto&& child : node->_children )\n nodes.push( child.get() );\n }\n\n ++depth;\n }\n\n assert( nodes.empty() );\n\n \/\/ Backward pass ---------------------------------------------------\n \/\/\n \/\/ Set the level of the root node and update child levels. Note that\n \/\/ all nodes will be traversed because this function is dumb.\n\n _root->_level = depth;\n\n nodes.push( _root.get() );\n\n while( !nodes.empty() )\n {\n {\n auto&& parent = nodes.front();\n\n for( auto&& child : parent->_children )\n {\n assert( parent->_level >= 1 );\n\n child->_level = parent->_level - 1;\n nodes.push( child.get() );\n }\n }\n\n nodes.pop();\n }\n }\n\n \/** Root pointer of the tree *\/\n std::unique_ptr<Node> _root;\n};\n\n} \/\/ namespace geometry\n\n} \/\/ namespace aleph\n\n#endif\n<|endoftext|>"} {"text":"<commit_before><commit_msg>Create Fid_Base.cpp<commit_after><|endoftext|>"} {"text":"<commit_before>\/*\n * simple_shell_parser.hpp - Parser designed to make simple shells\n *\n * Copyright 2010 Jesús Torres <jmtorres@ull.es>\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n *\/\n\n#ifndef SIMPLE_SHELL_PARSER_HPP_\n#define SIMPLE_SHELL_PARSER_HPP_\n\n#include <cerrno>\n#include <string>\n#include <vector>\n\n#include <libintl.h> \/\/ TODO: To use Boost.Locale when available\n#define translate(str) ::gettext(str)\n\n\/\/#define BOOST_SPIRIT_DEBUG\n\n#include <boost\/algorithm\/string\/join.hpp>\n#include <boost\/function.hpp>\n#include <boost\/fusion\/adapted\/struct\/adapt_struct.hpp>\n#include <boost\/fusion\/include\/adapt_struct.hpp>\n#include <boost\/spirit\/home\/phoenix\/bind\/bind_member_function.hpp>\n#include <boost\/spirit\/home\/phoenix\/bind\/bind_function.hpp>\n#include <boost\/spirit\/home\/phoenix\/object\/construct.hpp>\n#include <boost\/spirit\/home\/phoenix\/operator\/comparison.hpp>\n#include <boost\/spirit\/home\/phoenix\/operator\/if_else.hpp>\n#include <boost\/spirit\/home\/phoenix\/statement\/sequence.hpp>\n#include <boost\/spirit\/include\/phoenix_container.hpp>\n#include <boost\/spirit\/include\/phoenix_fusion.hpp>\n#include <boost\/spirit\/include\/phoenix_operator.hpp>\n#include <boost\/spirit\/include\/qi.hpp>\n\n#include <cli\/callbacks.hpp>\n#include <cli\/glob.hpp>\n\nnamespace cli { namespace parser\n{\n \/\/\n \/\/ Class Command\n \/\/\n \/\/ Stores the information provided by the parser SimpleShellParser\n \/\/ that is required for command execution.\n \/\/\n\n struct Command\n {\n Command() : terminator(NORMAL){}\n\n struct VariableAssignment\n {\n std::string name;\n std::string value;\n };\n\n struct StdioRedirection\n {\n enum TypeOfRedirection\n {\n TRUNCATED_INPUT, \/\/ command <filename\n TRUNCATED_OUTPUT, \/\/ command >filename\n APPENDED_OUTPUT \/\/ command >>filename\n };\n\n TypeOfRedirection type;\n std::string argument;\n };\n\n enum TypeOfTerminator\n {\n NORMAL, \/\/ command ;\n BACKGROUNDED, \/\/ command &\n PIPED \/\/ command1 | command2\n };\n\n VariableAssignment variable;\n std::vector<std::string> arguments;\n std::vector<StdioRedirection> redirections;\n TypeOfTerminator terminator;\n };\n\n \/\/\n \/\/ Overload of insertion operator (<<) for struct Command\n \/\/ It is required to debug the parser rules\n \/\/\n\n template <typename CharT, typename Traits>\n std::basic_ostream<CharT, Traits>&\n operator<<(std::basic_ostream<CharT, Traits>& out, const Command& command)\n {\n return out << \"{variable: \" << command.variable\n << \", arguments: \" << command.arguments\n << \", redirections: \" << command.redirections\n << \", terminator: \" << command.terminator << '}';\n }\n\n template <typename CharT, typename Traits>\n std::basic_ostream<CharT, Traits>&\n operator<<(std::basic_ostream<CharT, Traits>& out,\n const Command::StdioRedirection& redirection)\n {\n return out << \"{type: \" << redirection.type\n << \", argument: \" << redirection.argument << '}';\n }\n\n template <typename CharT, typename Traits>\n std::basic_ostream<CharT, Traits>&\n operator<<(std::basic_ostream<CharT, Traits>& out,\n const Command::VariableAssignment& variable)\n {\n return out << \"{name: \" << variable.name\n << \", value: \" << variable.value << '}';\n }\n}}\n\n\/\/\n\/\/ Adaptors from Command classes to Boost.Fusion sequences. They are required\n\/\/ by the parser SimpleShellParser. Must be defined at global scope.\n\/\/\n\nBOOST_FUSION_ADAPT_STRUCT(\n cli::parser::Command::VariableAssignment,\n (std::string, name)\n (std::string, value)\n)\n\nBOOST_FUSION_ADAPT_STRUCT(\n cli::parser::Command::StdioRedirection,\n (cli::parser::Command::StdioRedirection::TypeOfRedirection, type)\n (std::string, argument)\n)\n\nBOOST_FUSION_ADAPT_STRUCT(\n cli::parser::Command,\n (cli::parser::Command::VariableAssignment, variable)\n (std::vector<std::string>, arguments)\n (std::vector<cli::parser::Command::StdioRedirection>, redirections)\n (cli::parser::Command::TypeOfTerminator, terminator)\n)\n\nnamespace cli { namespace parser\n{\n namespace qi = boost::spirit::qi;\n namespace ascii = boost::spirit::ascii;\n namespace phoenix = boost::phoenix;\n\n \/\/\n \/\/ Class SimpleShellParser\n \/\/\n\n template <typename Iterator>\n struct SimpleShellParser\n : qi::grammar<Iterator, std::vector<Command>(), ascii::space_type>\n {\n SimpleShellParser() : SimpleShellParser::base_type(start)\n {\n using qi::_1;\n using qi::_2;\n using qi::_3;\n using qi::_4;\n using qi::_a;\n using qi::_val;\n using qi::_r1;\n using qi::eps;\n using qi::eoi;\n using qi::fail;\n using qi::lexeme;\n using qi::lit;\n using qi::on_error;\n using qi::raw;\n using ascii::char_;\n using ascii::space;\n using phoenix::at;\n using phoenix::at_c;\n using phoenix::begin;\n using phoenix::bind;\n using phoenix::construct;\n using phoenix::end;\n using phoenix::empty;\n using phoenix::if_else;\n using phoenix::insert;\n using phoenix::push_back;\n using phoenix::size;\n using phoenix::val;\n\n eol = eoi;\n character %= char_;\n dereference = '$';\n special %= dereference | redirectors | terminators;\n escape %= '\\\\' > character;\n\n name %= char_(\"a-zA-Z\") >> *char_(\"a-zA-Z0-9\");\n variable =\n eps[_a = false] >>\n dereference >> (\n -lit('{')[_a = true] >\n name[_val = bind(&Type::variableLookup, *this, _1)]\n ) >> ((eps(_a) > '}') | eps(!_a));\n\n quotedString %= '\\'' >> *(char_ - '\\'') > '\\'';\n doubleQuotedString = '\"' >> *(\n variable [_val += _1] |\n (\n char_('\\'') [push_back(_val, _1)] >>\n *((char_ - '\\'' - '\"') [push_back(_val, _1)]) >>\n char_('\\'') [push_back(_val, _1)]\n ) |\n (char_ - '\"') [push_back(_val, _1)]\n ) > '\"';\n\n word = +(\n variable [_val += _1] |\n quotedString [_val += bind(&Type::globEscape, _1)] |\n doubleQuotedString [_val += bind(&Type::globEscape, _1)] |\n escape [push_back(_val, _1)] |\n (char_ - space - special) [push_back(_val, _1)]\n );\n\n expandedWord = word\n [_val = bind(&Type::pathnameExpansion, *this, _1)];\n variableValue = expandedWord[_val = bind(&Type::stringsJoin, _1)];\n unambiguousRedirection = eps(_r1);\n\n assignment %= name >> '=' >> -variableValue;\n redirection =\n redirectors [at_c<0>(_val) = _1] >\n expandedWord\t[at_c<1>(_val) = at(_1, 0), _a = size(_1)] >\n unambiguousRedirection(_a == 1);\n ending %= terminators;\n\n \/\/ This statement doesn't work as expected in boost 1.45.0\n \/\/ command %= assignment || +word || +redirection;\n command = (\n assignment [at_c<0>(_val) = _1] ||\n (\n +expandedWord\n [insert(at_c<1>(_val), end(at_c<1>(_val)),\n begin(_1), end(_1))]\n ) ||\n (+redirection) [at_c<2>(_val) = _1]\n ) >> (\n ending [at_c<3>(_val) = _1, _r1 = true ] |\n eps [_r1 = false]\n );\n expressions = +(\n command(_a)[push_back(_val, _1)] >>\n ((eps(!_a) > eol) | eps(_a))\n ) > eol;\n\n \/\/ start rule with locals doesn't compile in boost 1.44.0\n start %= expressions;\n\n character.name(translate(\"character\"));\n name.name(translate(\"name\"));\n expandedWord.name(translate(\"word\"));\n variableValue.name(translate(\"word\"));\n unambiguousRedirection.name(translate(\"unambiguous redirection\"));\n eol.name(translate(\"end-of-line\"));\n\n on_error<fail>(\n start,\n std::cerr\n << val(::program_invocation_short_name)\n << val(\": \")\n << val(translate(\"parse error, expecting\"))\n << val(\" \")\n << _4\n << val(\" \")\n << val(translate(\"at\"))\n << val(\": \")\n << if_else(_3 == _2, val(translate(\"<end-of-line>\")),\n construct<std::string>(_3, _2))\n << std::endl\n );\n\n\/\/ BOOST_SPIRIT_DEBUG_NODE(name);\n\/\/ BOOST_SPIRIT_DEBUG_NODE(variable);\n\/\/ BOOST_SPIRIT_DEBUG_NODE(quotedString);\n\/\/ BOOST_SPIRIT_DEBUG_NODE(doubleQuotedString);\n\/\/ BOOST_SPIRIT_DEBUG_NODE(expandedWord);\n\/\/ BOOST_SPIRIT_DEBUG_NODE(word);\n\/\/ BOOST_SPIRIT_DEBUG_NODE(assignment);\n\/\/ BOOST_SPIRIT_DEBUG_NODE(redirection);\n\/\/ BOOST_SPIRIT_DEBUG_NODE(ending);\n\/\/ BOOST_SPIRIT_DEBUG_NODE(command);\n BOOST_SPIRIT_DEBUG_NODE(expressions);\n }\n\n \/\/\n \/\/ Parser rules\n \/\/\n\n struct Redirections\n : qi::symbols<char, Command::StdioRedirection::TypeOfRedirection>\n {\n Redirections()\n {\n add\n (\"<\", Command::StdioRedirection::TRUNCATED_INPUT)\n (\">\", Command::StdioRedirection::TRUNCATED_OUTPUT)\n (\">>\", Command::StdioRedirection::APPENDED_OUTPUT)\n ;\n }\n } redirectors;\n\n struct Terminators\n : qi::symbols<char, Command::TypeOfTerminator>\n {\n Terminators()\n {\n add\n (\";\", Command::NORMAL)\n (\"&\", Command::BACKGROUNDED)\n (\"|\", Command::PIPED)\n ;\n }\n } terminators;\n\n qi::rule<Iterator> eol;\n qi::rule<Iterator, char()> character;\n qi::rule<Iterator, char()> dereference;\n qi::rule<Iterator, char()> special;\n qi::rule<Iterator, char()> escape;\n qi::rule<Iterator, std::string()> name;\n qi::rule<Iterator, std::string(), qi::locals<bool> > variable;\n qi::rule<Iterator, std::string()> quotedString;\n qi::rule<Iterator, std::string()> doubleQuotedString;\n qi::rule<Iterator, std::string()> word;\n qi::rule<Iterator, std::vector<std::string>()> expandedWord;\n qi::rule<Iterator, std::string()> variableValue;\n qi::rule<Iterator, void(bool)> unambiguousRedirection;\n qi::rule<Iterator, Command::VariableAssignment()> assignment;\n qi::rule<Iterator, Command::StdioRedirection(),\n qi::locals<int>, ascii::space_type> redirection;\n qi::rule<Iterator, Command::TypeOfTerminator(),\n ascii::space_type> ending;\n qi::rule<Iterator, Command(bool&), ascii::space_type> command;\n qi::rule<Iterator, std::vector<Command>(),\n qi::locals<bool>, ascii::space_type> expressions;\n qi::rule<Iterator, std::vector<Command>(), ascii::space_type> start;\n\n \/\/\n \/\/ Callback functions\n \/\/\n\n typedef SimpleShellParser<Iterator> Type;\n\n typedef typename callbacks::VariableLookupCallback<Type>::Type\n VariableLookupCallback;\n typedef typename callbacks::PathnameExpansionCallback<Type>::Type\n PathnameExpansionCallback;\n\n protected:\n\n \/\/\n \/\/ Hook methods\n \/\/\n\n std::string variableLookup(const std::string& name);\n std::vector<std::string> pathnameExpansion(\n const std::string& pattern);\n\n private:\n\n \/\/\n \/\/ Callback functions objects\n \/\/\n\n boost::function<VariableLookupCallback> variableLookupCallback_;\n boost::function<PathnameExpansionCallback>\n pathnameExpansionCallback_;\n\n \/\/\n \/\/ Auxiliary methods\n \/\/\n\n static std::string globEscape(const std::string& pattern)\n { return glob::Glob::escape(pattern); }\n\n static std::string stringsJoin(const std::vector<std::string>& v)\n { return boost::algorithm::join(v, std::string(1, ' ')); }\n };\n\n template <typename Iterator>\n std::string SimpleShellParser<Iterator>::variableLookup(\n const std::string& name)\n {\n return variableLookupCallback_.empty() ?\n std::string() : variableLookupCallback_(name);\n }\n\n template <typename Iterator>\n std::vector<std::string> SimpleShellParser<Iterator>::pathnameExpansion(\n const std::string& pattern)\n {\n if (! pathnameExpansionCallback_.empty()) {\n return pathnameExpansionCallback_(pattern);\n }\n\n using namespace glob;\n\n Glob glob(pattern, Glob::EXPAND_BRACE_EXPRESSIONS |\n Glob::NO_PATH_NAMES_CHECK | Glob::EXPAND_TILDE_WITH_CHECK);\n\n typename Glob::ErrorsType errors = glob.getErrors();\n for (Glob::ErrorsType::const_iterator iter = errors.begin();\n iter < errors.end(); ++iter)\n {\n std::cerr\n << ::program_invocation_short_name\n << \": \"\n << translate(\"i\/o error at\")\n << \" \"\n << iter->first\n << \": \"\n << iter->second.message();\n }\n\n return glob;\n }\n}}\n\n#endif \/* SIMPLE_SHELL_PARSER_HPP_ *\/\n<commit_msg>show unambiguous redirection error at exact position where it happens.<commit_after>\/*\n * simple_shell_parser.hpp - Parser designed to make simple shells\n *\n * Copyright 2010 Jesús Torres <jmtorres@ull.es>\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n *\/\n\n#ifndef SIMPLE_SHELL_PARSER_HPP_\n#define SIMPLE_SHELL_PARSER_HPP_\n\n#include <cerrno>\n#include <string>\n#include <vector>\n\n#include <libintl.h> \/\/ TODO: To use Boost.Locale when available\n#define translate(str) ::gettext(str)\n\n\/\/#define BOOST_SPIRIT_DEBUG\n\n#include <boost\/algorithm\/string\/join.hpp>\n#include <boost\/function.hpp>\n#include <boost\/fusion\/adapted\/struct\/adapt_struct.hpp>\n#include <boost\/fusion\/include\/adapt_struct.hpp>\n#include <boost\/spirit\/home\/phoenix\/bind\/bind_member_function.hpp>\n#include <boost\/spirit\/home\/phoenix\/bind\/bind_function.hpp>\n#include <boost\/spirit\/home\/phoenix\/object\/construct.hpp>\n#include <boost\/spirit\/home\/phoenix\/operator\/comparison.hpp>\n#include <boost\/spirit\/home\/phoenix\/operator\/if_else.hpp>\n#include <boost\/spirit\/home\/phoenix\/statement\/sequence.hpp>\n#include <boost\/spirit\/include\/phoenix_container.hpp>\n#include <boost\/spirit\/include\/phoenix_fusion.hpp>\n#include <boost\/spirit\/include\/phoenix_operator.hpp>\n#include <boost\/spirit\/include\/qi.hpp>\n\n#include <cli\/callbacks.hpp>\n#include <cli\/glob.hpp>\n\nnamespace cli { namespace parser\n{\n \/\/\n \/\/ Class Command\n \/\/\n \/\/ Stores the information provided by the parser SimpleShellParser\n \/\/ that is required for command execution.\n \/\/\n\n struct Command\n {\n Command() : terminator(NORMAL){}\n\n struct VariableAssignment\n {\n std::string name;\n std::string value;\n };\n\n struct StdioRedirection\n {\n enum TypeOfRedirection\n {\n TRUNCATED_INPUT, \/\/ command <filename\n TRUNCATED_OUTPUT, \/\/ command >filename\n APPENDED_OUTPUT \/\/ command >>filename\n };\n\n TypeOfRedirection type;\n std::string argument;\n };\n\n enum TypeOfTerminator\n {\n NORMAL, \/\/ command ;\n BACKGROUNDED, \/\/ command &\n PIPED \/\/ command1 | command2\n };\n\n VariableAssignment variable;\n std::vector<std::string> arguments;\n std::vector<StdioRedirection> redirections;\n TypeOfTerminator terminator;\n };\n\n \/\/\n \/\/ Overload of insertion operator (<<) for struct Command\n \/\/ It is required to debug the parser rules\n \/\/\n\n template <typename CharT, typename Traits>\n std::basic_ostream<CharT, Traits>&\n operator<<(std::basic_ostream<CharT, Traits>& out, const Command& command)\n {\n return out << \"{variable: \" << command.variable\n << \", arguments: \" << command.arguments\n << \", redirections: \" << command.redirections\n << \", terminator: \" << command.terminator << '}';\n }\n\n template <typename CharT, typename Traits>\n std::basic_ostream<CharT, Traits>&\n operator<<(std::basic_ostream<CharT, Traits>& out,\n const Command::StdioRedirection& redirection)\n {\n return out << \"{type: \" << redirection.type\n << \", argument: \" << redirection.argument << '}';\n }\n\n template <typename CharT, typename Traits>\n std::basic_ostream<CharT, Traits>&\n operator<<(std::basic_ostream<CharT, Traits>& out,\n const Command::VariableAssignment& variable)\n {\n return out << \"{name: \" << variable.name\n << \", value: \" << variable.value << '}';\n }\n}}\n\n\/\/\n\/\/ Adaptors from Command classes to Boost.Fusion sequences. They are required\n\/\/ by the parser SimpleShellParser. Must be defined at global scope.\n\/\/\n\nBOOST_FUSION_ADAPT_STRUCT(\n cli::parser::Command::VariableAssignment,\n (std::string, name)\n (std::string, value)\n)\n\nBOOST_FUSION_ADAPT_STRUCT(\n cli::parser::Command::StdioRedirection,\n (cli::parser::Command::StdioRedirection::TypeOfRedirection, type)\n (std::string, argument)\n)\n\nBOOST_FUSION_ADAPT_STRUCT(\n cli::parser::Command,\n (cli::parser::Command::VariableAssignment, variable)\n (std::vector<std::string>, arguments)\n (std::vector<cli::parser::Command::StdioRedirection>, redirections)\n (cli::parser::Command::TypeOfTerminator, terminator)\n)\n\nnamespace cli { namespace parser\n{\n namespace qi = boost::spirit::qi;\n namespace ascii = boost::spirit::ascii;\n namespace phoenix = boost::phoenix;\n\n \/\/\n \/\/ Class SimpleShellParser\n \/\/\n\n template <typename Iterator>\n struct SimpleShellParser\n : qi::grammar<Iterator, std::vector<Command>(), ascii::space_type>\n {\n SimpleShellParser() : SimpleShellParser::base_type(start)\n {\n using qi::_1;\n using qi::_2;\n using qi::_3;\n using qi::_4;\n using qi::_a;\n using qi::_val;\n using qi::_r1;\n using qi::eps;\n using qi::eoi;\n using qi::fail;\n using qi::lexeme;\n using qi::lit;\n using qi::on_error;\n using qi::raw;\n using ascii::char_;\n using ascii::space;\n using phoenix::at;\n using phoenix::at_c;\n using phoenix::begin;\n using phoenix::bind;\n using phoenix::construct;\n using phoenix::end;\n using phoenix::empty;\n using phoenix::if_else;\n using phoenix::insert;\n using phoenix::push_back;\n using phoenix::size;\n using phoenix::val;\n\n eol = eoi;\n character %= char_;\n dereference = '$';\n special %= dereference | redirectors | terminators;\n escape %= '\\\\' > character;\n\n name %= char_(\"a-zA-Z\") >> *char_(\"a-zA-Z0-9\");\n variable =\n eps[_a = false] >>\n dereference >> (\n -lit('{')[_a = true] >\n name[_val = bind(&Type::variableLookup, *this, _1)]\n ) >> ((eps(_a) > '}') | eps(!_a));\n\n quotedString %= '\\'' >> *(char_ - '\\'') > '\\'';\n doubleQuotedString = '\"' >> *(\n variable [_val += _1] |\n (\n char_('\\'') [push_back(_val, _1)] >>\n *((char_ - '\\'' - '\"') [push_back(_val, _1)]) >>\n char_('\\'') [push_back(_val, _1)]\n ) |\n (char_ - '\"') [push_back(_val, _1)]\n ) > '\"';\n\n word = +(\n variable [_val += _1] |\n quotedString [_val += bind(&Type::globEscape, _1)] |\n doubleQuotedString [_val += bind(&Type::globEscape, _1)] |\n escape [push_back(_val, _1)] |\n (char_ - space - special) [push_back(_val, _1)]\n );\n\n expandedWord = word\n [_val = bind(&Type::pathnameExpansion, *this, _1)];\n variableValue = expandedWord[_val = bind(&Type::stringsJoin, _1)];\n unambiguousRedirection = eps(_r1);\n redirectionArgument = (\n (\n &expandedWord[_a = size(_1)] >\n unambiguousRedirection(_a == 1)\n\n ) >> expandedWord[_val = at(_1, 0)]\n ) | (eps > expandedWord);\n\n assignment %= name >> '=' >> -variableValue;\n redirection %= redirectors >> redirectionArgument;\n ending %= terminators;\n\n \/\/ This statement doesn't work as expected in boost 1.45.0\n \/\/ command %= assignment || +word || +redirection;\n command = (\n assignment [at_c<0>(_val) = _1] ||\n (\n +expandedWord\n [insert(at_c<1>(_val), end(at_c<1>(_val)),\n begin(_1), end(_1))]\n ) ||\n (+redirection) [at_c<2>(_val) = _1]\n ) >> (\n ending [at_c<3>(_val) = _1, _r1 = true ] |\n eps [_r1 = false]\n );\n expressions = +(\n command(_a)[push_back(_val, _1)] >>\n ((eps(!_a) > eol) | eps(_a))\n ) > eol;\n\n \/\/ start rule with locals doesn't compile in boost 1.44.0\n start %= expressions;\n\n character.name(translate(\"character\"));\n name.name(translate(\"name\"));\n expandedWord.name(translate(\"word\"));\n variableValue.name(translate(\"word\"));\n unambiguousRedirection.name(translate(\"unambiguous redirection\"));\n eol.name(translate(\"end-of-line\"));\n\n on_error<fail>(\n start,\n std::cerr\n << val(::program_invocation_short_name)\n << val(\": \")\n << val(translate(\"parse error, expecting\"))\n << val(\" \")\n << _4\n << val(\" \")\n << val(translate(\"at\"))\n << val(\": \")\n << if_else(_3 == _2, val(translate(\"<end-of-line>\")),\n construct<std::string>(_3, _2))\n << std::endl\n );\n\n\/\/ BOOST_SPIRIT_DEBUG_NODE(name);\n\/\/ BOOST_SPIRIT_DEBUG_NODE(variable);\n\/\/ BOOST_SPIRIT_DEBUG_NODE(quotedString);\n\/\/ BOOST_SPIRIT_DEBUG_NODE(doubleQuotedString);\n\/\/ BOOST_SPIRIT_DEBUG_NODE(expandedWord);\n\/\/ BOOST_SPIRIT_DEBUG_NODE(word);\n\/\/ BOOST_SPIRIT_DEBUG_NODE(assignment);\n\/\/ BOOST_SPIRIT_DEBUG_NODE(redirection);\n\/\/ BOOST_SPIRIT_DEBUG_NODE(ending);\n\/\/ BOOST_SPIRIT_DEBUG_NODE(command);\n BOOST_SPIRIT_DEBUG_NODE(expressions);\n }\n\n \/\/\n \/\/ Parser rules\n \/\/\n\n struct Redirections\n : qi::symbols<char, Command::StdioRedirection::TypeOfRedirection>\n {\n Redirections()\n {\n add\n (\"<\", Command::StdioRedirection::TRUNCATED_INPUT)\n (\">\", Command::StdioRedirection::TRUNCATED_OUTPUT)\n (\">>\", Command::StdioRedirection::APPENDED_OUTPUT)\n ;\n }\n } redirectors;\n\n struct Terminators\n : qi::symbols<char, Command::TypeOfTerminator>\n {\n Terminators()\n {\n add\n (\";\", Command::NORMAL)\n (\"&\", Command::BACKGROUNDED)\n (\"|\", Command::PIPED)\n ;\n }\n } terminators;\n\n qi::rule<Iterator> eol;\n qi::rule<Iterator, char()> character;\n qi::rule<Iterator, char()> dereference;\n qi::rule<Iterator, char()> special;\n qi::rule<Iterator, char()> escape;\n qi::rule<Iterator, std::string()> name;\n qi::rule<Iterator, std::string(), qi::locals<bool> > variable;\n qi::rule<Iterator, std::string()> quotedString;\n qi::rule<Iterator, std::string()> doubleQuotedString;\n qi::rule<Iterator, std::string()> word;\n qi::rule<Iterator, std::vector<std::string>()> expandedWord;\n qi::rule<Iterator, std::string()> variableValue;\n qi::rule<Iterator, void(bool)> unambiguousRedirection;\n qi::rule<Iterator, std::string(),\n qi::locals<int> > redirectionArgument;\n qi::rule<Iterator, Command::VariableAssignment()> assignment;\n qi::rule<Iterator, Command::StdioRedirection(),\n ascii::space_type> redirection;\n qi::rule<Iterator, Command::TypeOfTerminator(),\n ascii::space_type> ending;\n qi::rule<Iterator, Command(bool&), ascii::space_type> command;\n qi::rule<Iterator, std::vector<Command>(),\n qi::locals<bool>, ascii::space_type> expressions;\n qi::rule<Iterator, std::vector<Command>(), ascii::space_type> start;\n\n \/\/\n \/\/ Callback functions\n \/\/\n\n typedef SimpleShellParser<Iterator> Type;\n\n typedef typename callbacks::VariableLookupCallback<Type>::Type\n VariableLookupCallback;\n typedef typename callbacks::PathnameExpansionCallback<Type>::Type\n PathnameExpansionCallback;\n\n protected:\n\n \/\/\n \/\/ Hook methods\n \/\/\n\n std::string variableLookup(const std::string& name);\n std::vector<std::string> pathnameExpansion(\n const std::string& pattern);\n\n private:\n\n \/\/\n \/\/ Callback functions objects\n \/\/\n\n boost::function<VariableLookupCallback> variableLookupCallback_;\n boost::function<PathnameExpansionCallback>\n pathnameExpansionCallback_;\n\n \/\/\n \/\/ Auxiliary methods\n \/\/\n\n static std::string globEscape(const std::string& pattern)\n { return glob::Glob::escape(pattern); }\n\n static std::string stringsJoin(const std::vector<std::string>& v)\n { return boost::algorithm::join(v, std::string(1, ' ')); }\n };\n\n template <typename Iterator>\n std::string SimpleShellParser<Iterator>::variableLookup(\n const std::string& name)\n {\n return variableLookupCallback_.empty() ?\n std::string() : variableLookupCallback_(name);\n }\n\n template <typename Iterator>\n std::vector<std::string> SimpleShellParser<Iterator>::pathnameExpansion(\n const std::string& pattern)\n {\n if (! pathnameExpansionCallback_.empty()) {\n return pathnameExpansionCallback_(pattern);\n }\n\n using namespace glob;\n\n Glob glob(pattern, Glob::EXPAND_BRACE_EXPRESSIONS |\n Glob::NO_PATH_NAMES_CHECK | Glob::EXPAND_TILDE_WITH_CHECK);\n\n typename Glob::ErrorsType errors = glob.getErrors();\n for (Glob::ErrorsType::const_iterator iter = errors.begin();\n iter < errors.end(); ++iter)\n {\n std::cerr\n << ::program_invocation_short_name\n << \": \"\n << translate(\"i\/o error at\")\n << \" \"\n << iter->first\n << \": \"\n << iter->second.message();\n }\n\n return glob;\n }\n}}\n\n#endif \/* SIMPLE_SHELL_PARSER_HPP_ *\/\n<|endoftext|>"} {"text":"<commit_before>\n\/\/ Copyright (c) 2014-2017 niXman (i dot nixman dog gmail dot com). All\n\/\/ rights reserved.\n\/\/\n\/\/ This file is part of CONFIG-CTOR(https:\/\/github.com\/niXman\/config-ctor) project.\n\/\/\n\/\/ Distributed under the Boost Software License, Version 1.0. (See accompanying\n\/\/ file LICENSE_1_0.txt or copy at http:\/\/www.boost.org\/LICENSE_1_0.txt)\n\/\/\n\/\/\n\/\/\n\/\/ Boost Software License - Version 1.0 - August 17th, 2003\n\/\/\n\/\/ Permission is hereby granted, free of charge, to any person or organization\n\/\/ obtaining a copy of the software and accompanying documentation covered by\n\/\/ this license (the \"Software\") to use, reproduce, display, distribute,\n\/\/ execute, and transmit the Software, and to prepare derivative works of the\n\/\/ Software, and to permit third-parties to whom the Software is furnished to\n\/\/ do so, all subject to the following:\n\/\/\n\/\/ The copyright notices in the Software and this entire statement, including\n\/\/ the above license grant, this restriction and the following disclaimer,\n\/\/ must be included in all copies of the Software, in whole or in part, and\n\/\/ all derivative works of the Software, unless such copies or derivative\n\/\/ works are solely in the form of machine-executable object code generated by\n\/\/ a source language processor.\n\/\/\n\/\/ THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\n\/\/ IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\n\/\/ FITNESS FOR A PARTICULAR PURPOSE, TITLE AND NON-INFRINGEMENT. IN NO EVENT\n\/\/ SHALL THE COPYRIGHT HOLDERS OR ANYONE DISTRIBUTING THE SOFTWARE BE LIABLE\n\/\/ FOR ANY DAMAGES OR OTHER LIABILITY, WHETHER IN CONTRACT, TORT OR OTHERWISE,\n\/\/ ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER\n\/\/ DEALINGS IN THE SOFTWARE.\n\n#ifndef __config_ctor__config_ctor_hpp\n#define __config_ctor__config_ctor_hpp\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#include <cstdint>\n#include <string>\n#include <iosfwd>\n#include <map>\n\n#ifdef _WIN32\n# include <windows.h>\n#else\n# include <unistd.h>\n# include <stdlib.h>\n#endif\n\n\/***************************************************************************\/\n\nnamespace construct_config {\nnamespace {\n\n\/\/ for other types (strings)\ntemplate<bool ok>\nstruct get_concrete_value {\n template<typename T>\n static T get(const char *key, const boost::property_tree::ptree &ini, const char *default_value) {\n std::string res = default_value != nullptr\n ? ini.get<T>(key, default_value)\n : ini.get<T>(key)\n ;\n\n static auto get_home = []() -> std::string { return ::getenv(\"HOME\"); };\n static auto get_user = []() -> std::string { return ::getenv(\"USER\"); };\n static auto get_cwd = []() -> std::string {\n char buf[1024];\n return ::getcwd(buf, sizeof(buf));\n };\n static auto get_temp = []() -> std::string {\n #ifdef _WIN32\n char buf[MAX_PATH+1+1];\n ::GetTempPath(sizeof(buf), buf);\n return buf;\n #elif defined(__linux__)\n if (const char *temp = ::getenv(\"TMPDIR\")) {\n return temp;\n } else if (const char *temp = ::getenv(\"TEMP\")) {\n return temp;\n } else if (const char *temp = ::getenv(\"TMP\")) {\n return temp;\n }\n return \"\/tmp\";\n #else\n # error UNKNOWN HOST\n #endif\n };\n static auto get_pid = []() -> std::string {\n ::pid_t pid = ::getpid();\n return std::to_string(pid);\n };\n static auto get_path = []() -> std::string { return ::getenv(\"PATH\"); };\n static auto get_proc_name = []() -> std::string {\n char buf[1024] = \"\\0\";\n #ifdef _WIN32\n ::GetModuleFileName(nullptr, buf, sizeof(buf)-1);\n const char *p = std::strrchr(buf, '\\\\');\n #elif defined(__linux__)\n ::readlink(\"\/proc\/self\/exe\", buf, sizeof(buf)-1);\n const char *p = std::strrchr(buf, '\/');\n #else\n # error UNKNOWN HOST\n #endif\n return p ? p+1 : buf;\n };\n\n static const std::map<std::string, std::function<std::string()>> map = {\n {\"{HOME}\", std::move(get_home)}\n ,{\"{USER}\", std::move(get_user)}\n ,{\"{CWD}\" , std::move(get_cwd )}\n ,{\"{TEMP}\", std::move(get_temp)}\n ,{\"{PID}\" , std::move(get_pid )}\n ,{\"{PATH}\", std::move(get_path)}\n ,{\"{PROC}\", std::move(get_proc_name)}\n };\n\n static auto replace = [](std::string &str, const std::string &ostr, const std::string &nstr) {\n std::string::size_type pos = 0u;\n while ( (pos = str.find(ostr, pos)) != std::string::npos ) {\n str.replace(pos, ostr.length(), nstr);\n pos += nstr.length();\n }\n };\n\n for (const auto &it: map) {\n replace(res, it.first, it.second());\n }\n\n return res;\n }\n};\n\n\/\/ specialization for arithmetic types\ntemplate<>\nstruct get_concrete_value<true> {\n template<typename T>\n static T get(const char *key, const boost::property_tree::ptree &ini, const char *default_value) {\n \/\/ handle bool types\n if (std::is_same<T, bool>::value) {\n return default_value != nullptr\n ? ini.get<bool>(key, (std::strcmp(default_value, \"true\") == 0))\n : ini.get<bool>(key)\n ;\n }\n\n \/\/ handle other arithmetic types\n std::string val = default_value != nullptr\n ? ini.get<std::string>(key, default_value)\n : ini.get<std::string>(key)\n ;\n if (val.empty()) return T{};\n\n if ((std::is_signed<T>::value || std::is_unsigned<T>::value) && !std::is_floating_point<T>::value) {\n std::size_t mult = 1u;\n switch (val.back()) {\n case 't': case 'T': mult *= 1024u;\n case 'g': case 'G': mult *= 1024u;\n case 'm': case 'M': mult *= 1024u;\n case 'k': case 'K': mult *= 1024u;\n\n val.pop_back();\n }\n\n return static_cast<T>((std::is_signed<T>::value ? std::stol(val) : std::stoul(val)) * mult);\n }\n\n return static_cast<T>(std::stod(val));\n }\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 using TT = typename std::remove_cv<T>::type;\n return get_concrete_value<std::is_arithmetic<TT>::value>::template get<TT>(key, cfg, default_value);\n}\n\ntemplate<bool ok>\nstruct print_value {\n template<typename T>\n static void print(const T &v, std::ostream &os) {\n os << '\\\"' << v << '\\\"';\n }\n};\n\ntemplate<>\nstruct print_value<true> {\n template<typename T>\n static void print(const T &v, std::ostream &os) {\n os << std::boolalpha << v;\n }\n};\n\n} \/\/ ns construct_config\n\n\/***************************************************************************\/\n\n#define _CONSTRUCT_CONFIG__WRAP_SEQUENCE_X(...) \\\n ((__VA_ARGS__)) _CONSTRUCT_CONFIG__WRAP_SEQUENCE_Y\n#define _CONSTRUCT_CONFIG__WRAP_SEQUENCE_Y(...) \\\n ((__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 BOOST_PP_TUPLE_ELEM(0, elem) \/* type *\/ BOOST_PP_TUPLE_ELEM(1, elem) \/* var name *\/ ;\n\n#define _CONSTRUCT_CONFIG__INIT_MEMBERS_WITH_DEFAULT(...) \\\n ,BOOST_PP_STRINGIZE(BOOST_PP_TUPLE_ELEM(2, __VA_ARGS__))\n\n#define _CONSTRUCT_CONFIG__INIT_MEMBERS_WITHOUT_DEFAULT(...) \\\n ,nullptr\n\n#define _CONSTRUCT_CONFIG__INIT_MEMBERS(unused, data, idx, elem) \\\n BOOST_PP_COMMA_IF(idx) \\\n ::construct_config::get_value<BOOST_PP_TUPLE_ELEM(0, elem)>( \\\n BOOST_PP_STRINGIZE(BOOST_PP_TUPLE_ELEM(1, elem)) \\\n ,cfg \\\n BOOST_PP_IF( \\\n BOOST_PP_GREATER_EQUAL(BOOST_PP_TUPLE_SIZE(elem), 3) \\\n ,_CONSTRUCT_CONFIG__INIT_MEMBERS_WITH_DEFAULT \\\n ,_CONSTRUCT_CONFIG__INIT_MEMBERS_WITHOUT_DEFAULT \\\n )(elem) \\\n )\n\n#define _CONSTRUCT_CONFIG__ENUM_MEMBERS(unused, data, idx, elem) \\\n os << BOOST_PP_STRINGIZE(BOOST_PP_TUPLE_ELEM(1, elem)) \"=\"; \\\n ::construct_config::print_value< \\\n std::is_arithmetic<decltype(BOOST_PP_TUPLE_ELEM(1, elem))>::value \\\n >::print(BOOST_PP_TUPLE_ELEM(1, elem), os); \\\n os << std::endl;\n\n\/***************************************************************************\/\n\n#define _CONSTRUCT_CONFIG__ENUM_WRITE_MEMBERS(unused, data, idx, elem) \\\n ptree.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 struct name { \\\n BOOST_PP_SEQ_FOR_EACH_I( \\\n _CONSTRUCT_CONFIG__GENERATE_MEMBERS \\\n ,~ \\\n ,seq \\\n ) \\\n \\\n static name read(std::istream &is) { \\\n boost::property_tree::ptree cfg; \\\n boost::property_tree::read_##fmt(is, cfg); \\\n \\\n return { \\\n BOOST_PP_SEQ_FOR_EACH_I( \\\n _CONSTRUCT_CONFIG__INIT_MEMBERS \\\n ,~ \\\n ,seq \\\n ) \\\n }; \\\n } \\\n static name read(const std::string &fname) { \\\n boost::property_tree::ptree cfg; \\\n boost::property_tree::read_##fmt(fname, cfg); \\\n \\\n return { \\\n BOOST_PP_SEQ_FOR_EACH_I( \\\n _CONSTRUCT_CONFIG__INIT_MEMBERS \\\n ,~ \\\n ,seq \\\n ) \\\n }; \\\n } \\\n \\\n static void write(const std::string &fname, const name &cfg) { \\\n boost::property_tree::ptree ptree; \\\n BOOST_PP_SEQ_FOR_EACH_I( \\\n _CONSTRUCT_CONFIG__ENUM_WRITE_MEMBERS \\\n ,~ \\\n ,seq \\\n ) \\\n boost::property_tree::write_##fmt(fname, ptree); \\\n } \\\n static void write(std::ostream &os, const name &cfg) { \\\n boost::property_tree::ptree ptree; \\\n BOOST_PP_SEQ_FOR_EACH_I( \\\n _CONSTRUCT_CONFIG__ENUM_WRITE_MEMBERS \\\n ,~ \\\n ,seq \\\n ) \\\n boost::property_tree::write_##fmt(os, ptree); \\\n } \\\n \\\n void dump(std::ostream &os) const { \\\n BOOST_PP_SEQ_FOR_EACH_I( \\\n _CONSTRUCT_CONFIG__ENUM_MEMBERS \\\n ,~ \\\n ,seq \\\n ) \\\n } \\\n };\n\n\/***************************************************************************\/\n\n#define CONSTRUCT_CONFIG(\\\n fmt \/* config file format *\/ \\\n, name \/* config struct name *\/ \\\n, seq \/* sequence of vars *\/ \\\n) \\\n _CONSTRUCT_CONFIG__GENERATE_STRUCT( \\\n fmt \\\n ,name \\\n ,BOOST_PP_CAT(_CONSTRUCT_CONFIG__WRAP_SEQUENCE_X seq, 0) \\\n )\n\n#define CONSTRUCT_INI_CONFIG(name, seq) \\\n CONSTRUCT_CONFIG(ini, name, seq)\n\n#define CONSTRUCT_JSON_CONFIG(name, seq) \\\n CONSTRUCT_CONFIG(json, name, seq)\n\n#define CONSTRUCT_XML_CONFIG(name, seq) \\\n CONSTRUCT_CONFIG(xml, name, seq)\n\n#define CONSTRUCT_INFO_CONFIG(name, seq) \\\n CONSTRUCT_CONFIG(info, name, seq)\n\n\/***************************************************************************\/\n\n#endif \/\/ __config_ctor__config_ctor_hpp\n<commit_msg>Update config-ctor.hpp<commit_after>\n\/\/ Copyright (c) 2014-2017 niXman (i dot nixman dog gmail dot com). All\n\/\/ rights reserved.\n\/\/\n\/\/ This file is part of CONFIG-CTOR(https:\/\/github.com\/niXman\/config-ctor) project.\n\/\/\n\/\/ Distributed under the Boost Software License, Version 1.0. (See accompanying\n\/\/ file LICENSE_1_0.txt or copy at http:\/\/www.boost.org\/LICENSE_1_0.txt)\n\/\/\n\/\/\n\/\/\n\/\/ Boost Software License - Version 1.0 - August 17th, 2003\n\/\/\n\/\/ Permission is hereby granted, free of charge, to any person or organization\n\/\/ obtaining a copy of the software and accompanying documentation covered by\n\/\/ this license (the \"Software\") to use, reproduce, display, distribute,\n\/\/ execute, and transmit the Software, and to prepare derivative works of the\n\/\/ Software, and to permit third-parties to whom the Software is furnished to\n\/\/ do so, all subject to the following:\n\/\/\n\/\/ The copyright notices in the Software and this entire statement, including\n\/\/ the above license grant, this restriction and the following disclaimer,\n\/\/ must be included in all copies of the Software, in whole or in part, and\n\/\/ all derivative works of the Software, unless such copies or derivative\n\/\/ works are solely in the form of machine-executable object code generated by\n\/\/ a source language processor.\n\/\/\n\/\/ THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\n\/\/ IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\n\/\/ FITNESS FOR A PARTICULAR PURPOSE, TITLE AND NON-INFRINGEMENT. IN NO EVENT\n\/\/ SHALL THE COPYRIGHT HOLDERS OR ANYONE DISTRIBUTING THE SOFTWARE BE LIABLE\n\/\/ FOR ANY DAMAGES OR OTHER LIABILITY, WHETHER IN CONTRACT, TORT OR OTHERWISE,\n\/\/ ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER\n\/\/ DEALINGS IN THE SOFTWARE.\n\n#ifndef __config_ctor__config_ctor_hpp\n#define __config_ctor__config_ctor_hpp\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#include <cstdint>\n#include <string>\n#include <iosfwd>\n#include <map>\n\n#ifdef _WIN32\n# include <windows.h>\n#else\n# include <unistd.h>\n# include <stdlib.h>\n#endif\n\n\/***************************************************************************\/\n\nnamespace construct_config {\nnamespace {\n\n\/\/ for other types (strings)\ntemplate<bool ok>\nstruct get_concrete_value {\n template<typename T>\n static T get(const char *key, const boost::property_tree::ptree &ini, const char *default_value) {\n std::string res = default_value != nullptr\n ? ini.get<T>(key, default_value)\n : ini.get<T>(key)\n ;\n\n static auto get_home = []() -> std::string {\n #ifdef _WIN32\n return ::getenv(\"HOMEPATH\");\n #elif defined(__linux__)\n return ::getenv(\"HOME\");\n #else\n # error UNKNOWN HOST\n #endif\n };\n static auto get_user = []() -> std::string {\n #ifdef _WIN32\n return ::getenv(\"USERNAME\");\n #elif defined(__linux__)\n return ::getenv(\"USER\");\n #else\n # error UNKNOWN HOST\n #endif\n };\n static auto get_cwd = []() -> std::string {\n char buf[1024];\n return ::getcwd(buf, sizeof(buf));\n };\n static auto get_temp = []() -> std::string {\n #ifdef _WIN32\n char buf[MAX_PATH+1+1];\n ::GetTempPath(sizeof(buf), buf);\n return buf;\n #elif defined(__linux__)\n if (const char *temp = ::getenv(\"TMPDIR\")) {\n return temp;\n } else if (const char *temp = ::getenv(\"TEMP\")) {\n return temp;\n } else if (const char *temp = ::getenv(\"TMP\")) {\n return temp;\n }\n return \"\/tmp\";\n #else\n # error UNKNOWN HOST\n #endif\n };\n static auto get_pid = []() -> std::string {\n ::pid_t pid = ::getpid();\n return std::to_string(pid);\n };\n static auto get_path = []() -> std::string { return ::getenv(\"PATH\"); };\n static auto get_proc_name = []() -> std::string {\n char buf[1024] = \"\\0\";\n #ifdef _WIN32\n ::GetModuleFileName(nullptr, buf, sizeof(buf)-1);\n const char *p = std::strrchr(buf, '\\\\');\n #elif defined(__linux__)\n ::readlink(\"\/proc\/self\/exe\", buf, sizeof(buf)-1);\n const char *p = std::strrchr(buf, '\/');\n #else\n # error UNKNOWN HOST\n #endif\n return p ? p+1 : buf;\n };\n\n static const std::map<std::string, std::function<std::string()>> map = {\n {\"{HOME}\", std::move(get_home)}\n ,{\"{USER}\", std::move(get_user)}\n ,{\"{CWD}\" , std::move(get_cwd )}\n ,{\"{TEMP}\", std::move(get_temp)}\n ,{\"{PID}\" , std::move(get_pid )}\n ,{\"{PATH}\", std::move(get_path)}\n ,{\"{PROC}\", std::move(get_proc_name)}\n };\n\n static auto replace = [](std::string &str, const std::string &ostr, const std::string &nstr) {\n std::string::size_type pos = 0u;\n while ( (pos = str.find(ostr, pos)) != std::string::npos ) {\n str.replace(pos, ostr.length(), nstr);\n pos += nstr.length();\n }\n };\n\n for (const auto &it: map) {\n replace(res, it.first, it.second());\n }\n\n return res;\n }\n};\n\n\/\/ specialization for arithmetic types\ntemplate<>\nstruct get_concrete_value<true> {\n template<typename T>\n static T get(const char *key, const boost::property_tree::ptree &ini, const char *default_value) {\n \/\/ handle bool types\n if (std::is_same<T, bool>::value) {\n return default_value != nullptr\n ? ini.get<bool>(key, (std::strcmp(default_value, \"true\") == 0))\n : ini.get<bool>(key)\n ;\n }\n\n \/\/ handle other arithmetic types\n std::string val = default_value != nullptr\n ? ini.get<std::string>(key, default_value)\n : ini.get<std::string>(key)\n ;\n if (val.empty()) return T{};\n\n if ((std::is_signed<T>::value || std::is_unsigned<T>::value) && !std::is_floating_point<T>::value) {\n std::size_t mult = 1u;\n switch (val.back()) {\n case 't': case 'T': mult *= 1024u;\n case 'g': case 'G': mult *= 1024u;\n case 'm': case 'M': mult *= 1024u;\n case 'k': case 'K': mult *= 1024u;\n\n val.pop_back();\n }\n\n return static_cast<T>((std::is_signed<T>::value ? std::stol(val) : std::stoul(val)) * mult);\n }\n\n return static_cast<T>(std::stod(val));\n }\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 using TT = typename std::remove_cv<T>::type;\n return get_concrete_value<std::is_arithmetic<TT>::value>::template get<TT>(key, cfg, default_value);\n}\n\ntemplate<bool ok>\nstruct print_value {\n template<typename T>\n static void print(const T &v, std::ostream &os) {\n os << '\\\"' << v << '\\\"';\n }\n};\n\ntemplate<>\nstruct print_value<true> {\n template<typename T>\n static void print(const T &v, std::ostream &os) {\n os << std::boolalpha << v;\n }\n};\n\n} \/\/ ns construct_config\n\n\/***************************************************************************\/\n\n#define _CONSTRUCT_CONFIG__WRAP_SEQUENCE_X(...) \\\n ((__VA_ARGS__)) _CONSTRUCT_CONFIG__WRAP_SEQUENCE_Y\n#define _CONSTRUCT_CONFIG__WRAP_SEQUENCE_Y(...) \\\n ((__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 BOOST_PP_TUPLE_ELEM(0, elem) \/* type *\/ BOOST_PP_TUPLE_ELEM(1, elem) \/* var name *\/ ;\n\n#define _CONSTRUCT_CONFIG__INIT_MEMBERS_WITH_DEFAULT(...) \\\n ,BOOST_PP_STRINGIZE(BOOST_PP_TUPLE_ELEM(2, __VA_ARGS__))\n\n#define _CONSTRUCT_CONFIG__INIT_MEMBERS_WITHOUT_DEFAULT(...) \\\n ,nullptr\n\n#define _CONSTRUCT_CONFIG__INIT_MEMBERS(unused, data, idx, elem) \\\n BOOST_PP_COMMA_IF(idx) \\\n ::construct_config::get_value<BOOST_PP_TUPLE_ELEM(0, elem)>( \\\n BOOST_PP_STRINGIZE(BOOST_PP_TUPLE_ELEM(1, elem)) \\\n ,cfg \\\n BOOST_PP_IF( \\\n BOOST_PP_GREATER_EQUAL(BOOST_PP_TUPLE_SIZE(elem), 3) \\\n ,_CONSTRUCT_CONFIG__INIT_MEMBERS_WITH_DEFAULT \\\n ,_CONSTRUCT_CONFIG__INIT_MEMBERS_WITHOUT_DEFAULT \\\n )(elem) \\\n )\n\n#define _CONSTRUCT_CONFIG__ENUM_MEMBERS(unused, data, idx, elem) \\\n os << BOOST_PP_STRINGIZE(BOOST_PP_TUPLE_ELEM(1, elem)) \"=\"; \\\n ::construct_config::print_value< \\\n std::is_arithmetic<decltype(BOOST_PP_TUPLE_ELEM(1, elem))>::value \\\n >::print(BOOST_PP_TUPLE_ELEM(1, elem), os); \\\n os << std::endl;\n\n\/***************************************************************************\/\n\n#define _CONSTRUCT_CONFIG__ENUM_WRITE_MEMBERS(unused, data, idx, elem) \\\n ptree.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 struct name { \\\n BOOST_PP_SEQ_FOR_EACH_I( \\\n _CONSTRUCT_CONFIG__GENERATE_MEMBERS \\\n ,~ \\\n ,seq \\\n ) \\\n \\\n static name read(std::istream &is) { \\\n boost::property_tree::ptree cfg; \\\n boost::property_tree::read_##fmt(is, cfg); \\\n \\\n return { \\\n BOOST_PP_SEQ_FOR_EACH_I( \\\n _CONSTRUCT_CONFIG__INIT_MEMBERS \\\n ,~ \\\n ,seq \\\n ) \\\n }; \\\n } \\\n static name read(const std::string &fname) { \\\n boost::property_tree::ptree cfg; \\\n boost::property_tree::read_##fmt(fname, cfg); \\\n \\\n return { \\\n BOOST_PP_SEQ_FOR_EACH_I( \\\n _CONSTRUCT_CONFIG__INIT_MEMBERS \\\n ,~ \\\n ,seq \\\n ) \\\n }; \\\n } \\\n \\\n static void write(const std::string &fname, const name &cfg) { \\\n boost::property_tree::ptree ptree; \\\n BOOST_PP_SEQ_FOR_EACH_I( \\\n _CONSTRUCT_CONFIG__ENUM_WRITE_MEMBERS \\\n ,~ \\\n ,seq \\\n ) \\\n boost::property_tree::write_##fmt(fname, ptree); \\\n } \\\n static void write(std::ostream &os, const name &cfg) { \\\n boost::property_tree::ptree ptree; \\\n BOOST_PP_SEQ_FOR_EACH_I( \\\n _CONSTRUCT_CONFIG__ENUM_WRITE_MEMBERS \\\n ,~ \\\n ,seq \\\n ) \\\n boost::property_tree::write_##fmt(os, ptree); \\\n } \\\n \\\n void dump(std::ostream &os) const { \\\n BOOST_PP_SEQ_FOR_EACH_I( \\\n _CONSTRUCT_CONFIG__ENUM_MEMBERS \\\n ,~ \\\n ,seq \\\n ) \\\n } \\\n };\n\n\/***************************************************************************\/\n\n#define CONSTRUCT_CONFIG(\\\n fmt \/* config file format *\/ \\\n, name \/* config struct name *\/ \\\n, seq \/* sequence of vars *\/ \\\n) \\\n _CONSTRUCT_CONFIG__GENERATE_STRUCT( \\\n fmt \\\n ,name \\\n ,BOOST_PP_CAT(_CONSTRUCT_CONFIG__WRAP_SEQUENCE_X seq, 0) \\\n )\n\n#define CONSTRUCT_INI_CONFIG(name, seq) \\\n CONSTRUCT_CONFIG(ini, name, seq)\n\n#define CONSTRUCT_JSON_CONFIG(name, seq) \\\n CONSTRUCT_CONFIG(json, name, seq)\n\n#define CONSTRUCT_XML_CONFIG(name, seq) \\\n CONSTRUCT_CONFIG(xml, name, seq)\n\n#define CONSTRUCT_INFO_CONFIG(name, seq) \\\n CONSTRUCT_CONFIG(info, name, seq)\n\n\/***************************************************************************\/\n\n#endif \/\/ __config_ctor__config_ctor_hpp\n<|endoftext|>"} {"text":"<commit_before>\/*\n This file is part of Akregator.\n\n Copyright (C) 2004 Sashmit Bhaduri <smt@vfemail.net>\n 2005 Frank Osterfeld <osterfeld@kde.org>\n\n This program is free software; you can redistribute it and\/or modify\n it under the terms of the GNU General Public License as published by\n the Free Software Foundation; either version 2 of the License, or\n (at your option) any later version.\n\n This program is distributed in the hope that it will be useful,\n but WITHOUT ANY WARRANTY; without even the implied warranty of\n MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the\n GNU General Public License for more details.\n\n You should have received a copy of the GNU General Public License\n along with this program; if not, write to the Free Software\n Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA.\n\n As a special exception, permission is given to link this program\n with any edition of Qt, and distribute the resulting executable,\n without including the source code for Qt in the source distribution.\n*\/\n\n#include \"feediconmanager.h\"\n\n#include <kapplication.h>\n#include <kdebug.h>\n#include <kstandarddirs.h>\n#include <k3staticdeleter.h>\n#include <kurl.h>\n\n#include <QIcon>\n#include <QList>\n#include <QMultiHash>\n#include <QPixmap>\n#include <QtDBus\/QtDBus>\n\n#include <cassert>\n\n#define FAVICONINTERFACE \"org.kde.FavIcon\"\n\n\nusing namespace Akregator;\n\nFaviconListener::~FaviconListener() {}\n\nclass FeedIconManager::Private\n{\n FeedIconManager* const q;\npublic:\n \n static FeedIconManager* m_instance;\n\n explicit Private( FeedIconManager* qq );\n ~Private();\n \n\n void loadIcon( const QString& url );\n QString iconLocation( const KUrl& ) const;\n \n QHash<FaviconListener*,QString> m_listeners;\n QMultiHash<QString, FaviconListener*> urlDict;\n QDBusInterface *m_favIconsModule;\n};\n\nnamespace {\n\nQString getIconUrl( const KUrl& url )\n{\n return \"http:\/\/\" + url.host() + '\/';\n}\n\n}\n\nFeedIconManager::Private::Private( FeedIconManager* qq ) : q( qq )\n{\n QDBusConnection::sessionBus().registerObject(\"\/FeedIconManager\", q, QDBusConnection::ExportScriptableSlots);\n m_favIconsModule = new QDBusInterface(\"org.kde.kded\", \"\/modules\/favicons\", FAVICONINTERFACE);\n Q_ASSERT( m_favIconsModule );\n q->connect( m_favIconsModule, SIGNAL( iconChanged( bool, QString, QString ) ),\n q, SLOT( slotIconChanged( bool, QString, QString ) ) );\n}\n\nFeedIconManager::Private::~Private()\n{\n delete m_favIconsModule;\n}\n\nFeedIconManager *FeedIconManager::Private::m_instance = 0;\n\n\nQString FeedIconManager::Private::iconLocation(const KUrl & url) const\n{\n QDBusReply<QString> reply = m_favIconsModule->call( \"iconForUrl\", url.url() );\n return reply.isValid() ? reply.value() : QString();\n}\n\n\nvoid FeedIconManager::Private::loadIcon( const QString & url_ )\n{\n const KUrl url(url_);\n\n QString iconFile = iconLocation( url );\n\n if ( iconFile.isEmpty() ) \/\/ cache miss\n {\n const QDBusReply<void> reply = m_favIconsModule->call( \"downloadHostIcon\", url.url() );\n if ( !reply.isValid() )\n kWarning() << \"Couldn't reach favicon service. Request favicon for \" << url << \" failed\";\n }\n else {\n q->slotIconChanged( false, url.host(), iconFile );\n }\n}\n\nstatic K3StaticDeleter<FeedIconManager> feediconmanagersd;\n\nFeedIconManager* FeedIconManager::self()\n{\n if (!Private::m_instance)\n Private::m_instance = feediconmanagersd.setObject(Private::m_instance, new FeedIconManager);\n return Private::m_instance;\n}\n\nvoid FeedIconManager::addListener( const KUrl& url, FaviconListener* listener )\n{\n assert( listener );\n removeListener( listener );\n const QString iconUrl = getIconUrl( url );\n d->m_listeners.insert( listener, iconUrl );\n d->urlDict.insert( url.host(), listener );\n QMetaObject::invokeMethod( this, \"loadIcon\", Qt::QueuedConnection, Q_ARG( QString, iconUrl ) );\n}\n\nvoid FeedIconManager::removeListener( FaviconListener* listener )\n{\n assert( listener );\n if ( !d->m_listeners.contains( listener ) )\n return;\n const QString url = d->m_listeners.value( listener );\n d->urlDict.remove( url, listener );\n d->m_listeners.remove( listener );\n}\n\nFeedIconManager::FeedIconManager()\n: QObject(), d( new Private( this ) )\n{\n}\n\nFeedIconManager::~FeedIconManager()\n{\n delete d;\n}\n\nvoid FeedIconManager::slotIconChanged( bool isHost,\n const QString& hostOrUrl,\n const QString& iconName )\n{\n Q_UNUSED( isHost );\n const QIcon icon( KGlobal::dirs()->findResource( \"cache\", iconName+\".png\" ) );\n Q_FOREACH( FaviconListener* l, d->urlDict.values( hostOrUrl ) )\n l->setFavicon( icon );\n}\n\n#include \"feediconmanager.moc\"\n<commit_msg>do not crash when opening (stale Frame* pointers)<commit_after>\/*\n This file is part of Akregator.\n\n Copyright (C) 2004 Sashmit Bhaduri <smt@vfemail.net>\n 2005 Frank Osterfeld <osterfeld@kde.org>\n\n This program is free software; you can redistribute it and\/or modify\n it under the terms of the GNU General Public License as published by\n the Free Software Foundation; either version 2 of the License, or\n (at your option) any later version.\n\n This program is distributed in the hope that it will be useful,\n but WITHOUT ANY WARRANTY; without even the implied warranty of\n MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the\n GNU General Public License for more details.\n\n You should have received a copy of the GNU General Public License\n along with this program; if not, write to the Free Software\n Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA.\n\n As a special exception, permission is given to link this program\n with any edition of Qt, and distribute the resulting executable,\n without including the source code for Qt in the source distribution.\n*\/\n\n#include \"feediconmanager.h\"\n\n#include <kapplication.h>\n#include <kdebug.h>\n#include <kstandarddirs.h>\n#include <k3staticdeleter.h>\n#include <kurl.h>\n\n#include <QIcon>\n#include <QList>\n#include <QMultiHash>\n#include <QPixmap>\n#include <QtDBus\/QtDBus>\n\n#include <cassert>\n\n#define FAVICONINTERFACE \"org.kde.FavIcon\"\n\n\nusing namespace Akregator;\n\nFaviconListener::~FaviconListener() {}\n\nclass FeedIconManager::Private\n{\n FeedIconManager* const q;\npublic:\n\n static FeedIconManager* m_instance;\n\n explicit Private( FeedIconManager* qq );\n ~Private();\n\n\n void loadIcon( const QString& url );\n QString iconLocation( const KUrl& ) const;\n\n QHash<FaviconListener*,QString> m_listeners;\n QMultiHash<QString, FaviconListener*> urlDict;\n QDBusInterface *m_favIconsModule;\n};\n\nnamespace {\n\nQString getIconUrl( const KUrl& url )\n{\n return \"http:\/\/\" + url.host() + '\/';\n}\n\n}\n\nFeedIconManager::Private::Private( FeedIconManager* qq ) : q( qq )\n{\n QDBusConnection::sessionBus().registerObject(\"\/FeedIconManager\", q, QDBusConnection::ExportScriptableSlots);\n m_favIconsModule = new QDBusInterface(\"org.kde.kded\", \"\/modules\/favicons\", FAVICONINTERFACE);\n Q_ASSERT( m_favIconsModule );\n q->connect( m_favIconsModule, SIGNAL( iconChanged( bool, QString, QString ) ),\n q, SLOT( slotIconChanged( bool, QString, QString ) ) );\n}\n\nFeedIconManager::Private::~Private()\n{\n delete m_favIconsModule;\n}\n\nFeedIconManager *FeedIconManager::Private::m_instance = 0;\n\n\nQString FeedIconManager::Private::iconLocation(const KUrl & url) const\n{\n QDBusReply<QString> reply = m_favIconsModule->call( \"iconForUrl\", url.url() );\n return reply.isValid() ? reply.value() : QString();\n}\n\n\nvoid FeedIconManager::Private::loadIcon( const QString & url_ )\n{\n const KUrl url(url_);\n\n QString iconFile = iconLocation( url );\n\n if ( iconFile.isEmpty() ) \/\/ cache miss\n {\n const QDBusReply<void> reply = m_favIconsModule->call( \"downloadHostIcon\", url.url() );\n if ( !reply.isValid() )\n kWarning() << \"Couldn't reach favicon service. Request favicon for \" << url << \" failed\";\n }\n else {\n q->slotIconChanged( false, url.host(), iconFile );\n }\n}\n\nstatic K3StaticDeleter<FeedIconManager> feediconmanagersd;\n\nFeedIconManager* FeedIconManager::self()\n{\n if (!Private::m_instance)\n Private::m_instance = feediconmanagersd.setObject(Private::m_instance, new FeedIconManager);\n return Private::m_instance;\n}\n\nvoid FeedIconManager::addListener( const KUrl& url, FaviconListener* listener )\n{\n assert( listener );\n removeListener( listener );\n const QString iconUrl = getIconUrl( url );\n d->m_listeners.insert( listener, iconUrl );\n d->urlDict.insert( iconUrl, listener );\n d->urlDict.insert( url.host(), listener );\n QMetaObject::invokeMethod( this, \"loadIcon\", Qt::QueuedConnection, Q_ARG( QString, iconUrl ) );\n}\n\nvoid FeedIconManager::removeListener( FaviconListener* listener )\n{\n assert( listener );\n if ( !d->m_listeners.contains( listener ) )\n return;\n const QString url = d->m_listeners.value( listener );\n d->urlDict.remove( KUrl( url ).host(), listener );\n d->urlDict.remove( url, listener );\n d->m_listeners.remove( listener );\n}\n\nFeedIconManager::FeedIconManager()\n : QObject()\n , d( new Private( this ) )\n{\n}\n\nFeedIconManager::~FeedIconManager()\n{\n delete d;\n}\n\nvoid FeedIconManager::slotIconChanged( bool isHost,\n const QString& hostOrUrl,\n const QString& iconName )\n{\n Q_UNUSED( isHost );\n const QIcon icon( KGlobal::dirs()->findResource( \"cache\", iconName+\".png\" ) );\n Q_FOREACH( FaviconListener* const l, d->urlDict.values( hostOrUrl ) )\n l->setFavicon( icon );\n}\n\n#include \"feediconmanager.moc\"\n<|endoftext|>"} {"text":"<commit_before>\/*\nThe MIT License (MIT)\nCopyright (c) 2017 Alexey Yegorov\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 LIABILITY,\nWHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,\nOUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS\nIN THE SOFTWARE.\n*\/\n\n#include \"des\/meta\/options.h\"\n\nDES_SYSTEM_DETAILS_BEGIN\n\nnamespace \/* anonymous *\/\n{\n namespace keys\n {\n constexpr auto system = meta::options::key_v<0>;\n constexpr auto input = meta::options::key_v<1>;\n constexpr auto output = meta::options::key_v<2>;\n constexpr auto dependencies = meta::options::key_v<3>;\n }\n}\n\ntemplate<typename _Data>\ntemplate<typename... _Input>\ninline constexpr auto node<_Data>::\n input(_Input && ... input) const noexcept\n{\n using type = decltype(meta::options::set(data_, keys::input,\n std::make_tuple(std::forward<_Input>(input)...)));\n return node<type>{};\n}\n\ntemplate<typename _Data>\ntemplate<typename... _Output>\ninline constexpr auto node<_Data>::\n output(_Output && ... output) const noexcept\n{\n using type = decltype(meta::options::set(data_, keys::output,\n std::make_tuple(std::forward<_Output>(output)...)));\n return node<type>{};\n}\n\ntemplate<typename _Data>\ntemplate<typename... _Dependencies>\ninline constexpr auto node<_Data>::\n dependencies(_Dependencies && ... dependencies) const noexcept\n{\n using type = decltype(meta::options::set(data_, keys::dependencies,\n std::make_tuple(std::forward<_Dependencies>(dependencies)...)));\n return node<type>{};\n}\n\ntemplate<typename _Data>\ninline constexpr auto node<_Data>::system() const noexcept\n{\n using result = decltype(meta::options::get(data_, keys::system));\n return result{};\n}\n\ntemplate<typename _Data>\ninline constexpr auto node<_Data>::input_list() const noexcept\n{\n using result = decltype(meta::options::get(data_, keys::input));\n return result{};\n}\n\ntemplate<typename _Data>\ninline constexpr auto node<_Data>::output_list() const noexcept\n{\n using result = decltype(meta::options::get(data_, keys::output));\n return result{};\n}\n\ntemplate<typename _Data>\ninline constexpr auto node<_Data>::dependency_list() const noexcept\n{\n using result = decltype(meta::options::get(data_, keys::dependencies));\n return result{};\n}\n\ntemplate<typename _System>\ninline constexpr auto make_node(_System && system) noexcept\n{\n using type = decltype(meta::options::set(meta::options::empty_v,\n keys::system, system));\n return node<type>{};\n}\n\nDES_SYSTEM_DETAILS_END\n<commit_msg>[des][system] fix node initialization<commit_after>\/*\nThe MIT License (MIT)\nCopyright (c) 2017 Alexey Yegorov\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 LIABILITY,\nWHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,\nOUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS\nIN THE SOFTWARE.\n*\/\n\n#include \"des\/meta\/options.h\"\n\nDES_SYSTEM_DETAILS_BEGIN\n\nnamespace \/* anonymous *\/\n{\n namespace keys\n {\n constexpr auto system = meta::options::key_v<0>;\n constexpr auto input = meta::options::key_v<1>;\n constexpr auto output = meta::options::key_v<2>;\n constexpr auto dependencies = meta::options::key_v<3>;\n }\n}\n\ntemplate<typename _Data>\ntemplate<typename... _Input>\ninline constexpr auto node<_Data>::\n input(_Input && ... input) const noexcept\n{\n using type = decltype(meta::options::set(data_, keys::input,\n std::make_tuple(std::forward<_Input>(input)...)));\n return node<type>{};\n}\n\ntemplate<typename _Data>\ntemplate<typename... _Output>\ninline constexpr auto node<_Data>::\n output(_Output && ... output) const noexcept\n{\n using type = decltype(meta::options::set(data_, keys::output,\n std::make_tuple(std::forward<_Output>(output)...)));\n return node<type>{};\n}\n\ntemplate<typename _Data>\ntemplate<typename... _Dependencies>\ninline constexpr auto node<_Data>::\n dependencies(_Dependencies && ... dependencies) const noexcept\n{\n using type = decltype(meta::options::set(data_, keys::dependencies,\n std::make_tuple(std::forward<_Dependencies>(dependencies)...)));\n return node<type>{};\n}\n\ntemplate<typename _Data>\ninline constexpr auto node<_Data>::system() const noexcept\n{\n using result = decltype(meta::options::get(data_, keys::system));\n return result{};\n}\n\ntemplate<typename _Data>\ninline constexpr auto node<_Data>::input_list() const noexcept\n{\n using result = decltype(meta::options::get(data_, keys::input));\n return result{};\n}\n\ntemplate<typename _Data>\ninline constexpr auto node<_Data>::output_list() const noexcept\n{\n using result = decltype(meta::options::get(data_, keys::output));\n return result{};\n}\n\ntemplate<typename _Data>\ninline constexpr auto node<_Data>::dependency_list() const noexcept\n{\n using result = decltype(meta::options::get(data_, keys::dependencies));\n return result{};\n}\n\ntemplate<typename _System>\ninline constexpr auto make_node(_System && system) noexcept\n{\n using type = decltype(meta::options::set(meta::options::empty_v, keys::system, system));\n using type1 = decltype(meta::options::set(type{}, keys::input, std::make_tuple()));\n using type2 = decltype(meta::options::set(type1{}, keys::output, std::make_tuple()));\n using type3 = decltype(meta::options::set(type2{}, keys::dependencies, std::make_tuple()));\n return node<type3>{};\n}\n\nDES_SYSTEM_DETAILS_END\n<|endoftext|>"} {"text":"<commit_before>\/\/=======================================================================\n\/\/ Copyright (c) 2014-2015 Baptiste Wicht\n\/\/ Distributed under the terms of the MIT License.\n\/\/ (See accompanying file LICENSE or copy at\n\/\/ http:\/\/opensource.org\/licenses\/MIT)\n\/\/=======================================================================\n\n#pragma once\n\n\/*!\n * \\file processor.hpp\n * \\brief This file is made to be included by the dllp generated file only.\n *\/\n\n#include <string>\n#include <iostream>\n#include <iomanip>\n\n#include \"dll\/dbn.hpp\"\n\n#include \"mnist\/mnist_reader.hpp\"\n#include \"mnist\/mnist_utils.hpp\"\n\nnamespace dll {\n\nnamespace processor {\n\nstruct datasource {\n std::string source_file;\n std::string reader;\n\n bool binarize = false;\n bool normalize = false;\n\n long limit = -1;\n\n datasource(){}\n datasource(std::string source_file, std::string reader) : source_file(source_file), reader(reader) {}\n\n bool empty() const {\n return source_file.empty();\n }\n};\n\nstruct datasource_pack {\n datasource samples;\n datasource labels;\n};\n\nstruct pretraining_desc {\n std::size_t epochs = 25;\n};\n\nstruct training_desc {\n std::size_t epochs = 25;\n double learning_rate = 0.1;\n double momentum = -666.0;\n};\n\nstruct weights_desc {\n std::string file = \"weights.dat\";\n};\n\nstruct task {\n dll::processor::datasource_pack pretraining;\n dll::processor::datasource_pack training;\n dll::processor::datasource_pack testing;\n\n dll::processor::pretraining_desc pt_desc;\n dll::processor::training_desc ft_desc;\n dll::processor::weights_desc w_desc;\n};\n\ntemplate<typename Sample>\nbool read_samples(const datasource& ds, std::vector<Sample>& samples){\n if(ds.reader == \"mnist\"){\n std::size_t limit = 0;\n\n if(ds.limit > 0){\n limit = ds.limit;\n }\n\n mnist::read_mnist_image_file<std::vector, Sample>(samples, ds.source_file, limit, []{ return Sample(1 * 28 * 28); });\n\n if(ds.binarize){\n mnist::binarize_each(samples);\n }\n\n if(ds.normalize){\n mnist::normalize_each(samples);\n }\n\n return !samples.empty();\n } else {\n std::cout << \"dllp: error: unknown samples reader: \" << ds.reader << std::endl;\n return false;\n }\n}\n\ntemplate<typename Label>\nbool read_labels(const datasource& ds, std::vector<Label>& labels){\n if(ds.reader == \"mnist\"){\n std::size_t limit = 0;\n\n if(ds.limit > 0){\n limit = ds.limit;\n }\n\n mnist::read_mnist_label_file<std::vector, Label>(labels, ds.source_file, limit);\n\n return !labels.empty();\n } else {\n std::cout << \"dllp: error: unknown labels reader: \" << ds.reader << std::endl;\n return false;\n }\n}\n\ninline void print_title(const std::string& value){\n std::cout << std::string(25, ' ') << std::endl;\n std::cout << std::string(25, '*') << std::endl;\n std::cout << \"* \" << value << std::string(25 - value.size() - 3, ' ') << \"*\" << std::endl;\n std::cout << std::string(25, '*') << std::endl;\n std::cout << std::string(25, ' ') << std::endl;\n}\n\ntemplate<typename DBN>\nvoid execute(DBN& dbn, task& task, const std::vector<std::string>& actions){\n print_title(\"Network\");\n dbn.display();\n\n using dbn_t = std::decay_t<DBN>;\n\n \/\/Execute all the actions sequentially\n for(auto& action : actions){\n if(action == \"pretrain\"){\n print_title(\"Pretraining\");\n\n if(task.pretraining.samples.empty()){\n std::cout << \"dllp: error: pretrain is not possible without a pretraining input\" << std::endl;\n return;\n }\n\n std::vector<typename dbn_t::input_t> pt_samples;\n\n \/\/Try to read the samples\n if(!read_samples(task.pretraining.samples, pt_samples)){\n std::cout << \"dllp: error: failed to read the pretraining samples\" << std::endl;\n return;\n }\n\n \/\/Pretrain the network\n dbn.pretrain(pt_samples.begin(), pt_samples.end(), task.pt_desc.epochs);\n } else if(action == \"train\"){\n print_title(\"Training\");\n\n if(task.training.samples.empty() || task.training.labels.empty()){\n std::cout << \"dllp: error: train is not possible without samples and labels\" << std::endl;\n return;\n }\n\n std::vector<typename dbn_t::input_t> ft_samples;\n std::vector<std::size_t> ft_labels;\n\n \/\/Try to read the samples\n if(!read_samples(task.training.samples, ft_samples)){\n std::cout << \"dllp: error: failed to read the training samples\" << std::endl;\n return;\n }\n\n \/\/Try to read the labels\n if(!read_labels(task.training.labels, ft_labels)){\n std::cout << \"dllp: error: failed to read the training labels\" << std::endl;\n return;\n }\n\n dbn.learning_rate = task.ft_desc.learning_rate;\n\n if(task.ft_desc.momentum != -666.0){\n dbn.momentum = task.ft_desc.momentum;\n }\n\n \/\/Train the network\n dbn.fine_tune(ft_samples, ft_labels, task.ft_desc.epochs);\n } else if(action == \"test\"){\n print_title(\"Testing\");\n\n if(task.testing.samples.empty() || task.testing.labels.empty()){\n std::cout << \"dllp: error: test is not possible without samples and labels\" << std::endl;\n return;\n }\n\n std::vector<typename dbn_t::input_t> test_samples;\n std::vector<std::size_t> test_labels;\n\n \/\/Try to read the samples\n if(!read_samples(task.testing.samples, test_samples)){\n std::cout << \"dllp: error: failed to read the training samples\" << std::endl;\n return;\n }\n\n \/\/Try to read the labels\n if(!read_labels(task.testing.labels, test_labels)){\n std::cout << \"dllp: error: failed to read the training labels\" << std::endl;\n return;\n }\n\n auto classes = dbn_t::output_size();\n\n etl::dyn_matrix<std::size_t, 2> conf(classes, classes, 0.0);\n\n std::size_t n = test_samples.size();\n std::size_t tp = 0;\n\n for(std::size_t i = 0; i < test_samples.size(); ++i){\n auto sample = test_samples[i];\n auto label = test_labels[i];\n\n auto predicted = dbn.predict(sample);\n\n if(predicted == label){\n ++tp;\n }\n\n ++conf(label, predicted);\n }\n\n double test_error = (n - tp) \/ double(n);\n\n std::cout << \"Error rate: \" << test_error << std::endl;\n std::cout << \"Accuracy: \" << (1.0 - test_error) << std::endl << std::endl;\n\n std::cout << \"Error rate per class\" << std::endl;\n\n double overall = 0.0;\n\n for(std::size_t l = 0; l < classes; ++l){\n std::size_t total = etl::sum(conf(l));\n double acc = (total - conf(l, l)) \/ double(total);\n std::cout << l << \" : \" << acc << std::endl;\n overall += acc;\n }\n\n std::cout << std::endl;\n\n std::cout << \"Overall Error rate: \" << overall \/ classes << std::endl;\n std::cout << \"Overall Accuracy: \" << 1.0 - (overall \/ classes) << std::endl << std::endl;\n\n std::cout << \"Confusion Matrix\" << std::endl << std::endl;\n\n std::cout << \" \";\n for(std::size_t l = 0; l < classes; ++l){\n std::cout << std::setw(5) << l << \" \";\n }\n std::cout << std::endl;\n\n for(std::size_t l = 0; l < classes; ++l){\n std::size_t total = etl::sum(conf(l));\n std::cout << l << \"|\";\n for(std::size_t p = 0; p < classes; ++p){\n std::cout << std::setw(5) << std::setprecision(2) << 100.0 * (conf(l,p) \/ double(total)) << \"|\";\n }\n std::cout << std::endl;\n }\n std::cout << std::endl;\n } else if(action == \"save\"){\n print_title(\"Save Weights\");\n\n dbn.store(task.w_desc.file);\n std::cout << \"Weights saved\" << std::endl;\n } else if(action == \"load\"){\n print_title(\"Load Weights\");\n\n dbn.load(task.w_desc.file);\n std::cout << \"Weights loaded\" << std::endl;\n } else {\n std::cout << \"dllp: error: Invalid action: \" << action << std::endl;\n }\n }\n\n\n \/\/TODO\n}\n\n} \/\/end of namespace processor\n\n} \/\/end of namespace dll\n<commit_msg>Cleanup output<commit_after>\/\/=======================================================================\n\/\/ Copyright (c) 2014-2015 Baptiste Wicht\n\/\/ Distributed under the terms of the MIT License.\n\/\/ (See accompanying file LICENSE or copy at\n\/\/ http:\/\/opensource.org\/licenses\/MIT)\n\/\/=======================================================================\n\n#pragma once\n\n\/*!\n * \\file processor.hpp\n * \\brief This file is made to be included by the dllp generated file only.\n *\/\n\n#include <string>\n#include <iostream>\n#include <iomanip>\n\n#include \"dll\/dbn.hpp\"\n\n#include \"mnist\/mnist_reader.hpp\"\n#include \"mnist\/mnist_utils.hpp\"\n\nnamespace dll {\n\nnamespace processor {\n\nstruct datasource {\n std::string source_file;\n std::string reader;\n\n bool binarize = false;\n bool normalize = false;\n\n long limit = -1;\n\n datasource(){}\n datasource(std::string source_file, std::string reader) : source_file(source_file), reader(reader) {}\n\n bool empty() const {\n return source_file.empty();\n }\n};\n\nstruct datasource_pack {\n datasource samples;\n datasource labels;\n};\n\nstruct pretraining_desc {\n std::size_t epochs = 25;\n};\n\nstruct training_desc {\n std::size_t epochs = 25;\n double learning_rate = 0.1;\n double momentum = -666.0;\n};\n\nstruct weights_desc {\n std::string file = \"weights.dat\";\n};\n\nstruct task {\n dll::processor::datasource_pack pretraining;\n dll::processor::datasource_pack training;\n dll::processor::datasource_pack testing;\n\n dll::processor::pretraining_desc pt_desc;\n dll::processor::training_desc ft_desc;\n dll::processor::weights_desc w_desc;\n};\n\ntemplate<typename Sample>\nbool read_samples(const datasource& ds, std::vector<Sample>& samples){\n if(ds.reader == \"mnist\"){\n std::size_t limit = 0;\n\n if(ds.limit > 0){\n limit = ds.limit;\n }\n\n mnist::read_mnist_image_file<std::vector, Sample>(samples, ds.source_file, limit, []{ return Sample(1 * 28 * 28); });\n\n if(ds.binarize){\n mnist::binarize_each(samples);\n }\n\n if(ds.normalize){\n mnist::normalize_each(samples);\n }\n\n return !samples.empty();\n } else {\n std::cout << \"dllp: error: unknown samples reader: \" << ds.reader << std::endl;\n return false;\n }\n}\n\ntemplate<typename Label>\nbool read_labels(const datasource& ds, std::vector<Label>& labels){\n if(ds.reader == \"mnist\"){\n std::size_t limit = 0;\n\n if(ds.limit > 0){\n limit = ds.limit;\n }\n\n mnist::read_mnist_label_file<std::vector, Label>(labels, ds.source_file, limit);\n\n return !labels.empty();\n } else {\n std::cout << \"dllp: error: unknown labels reader: \" << ds.reader << std::endl;\n return false;\n }\n}\n\ninline void print_title(const std::string& value){\n std::cout << std::string(25, ' ') << std::endl;\n std::cout << std::string(25, '*') << std::endl;\n std::cout << \"* \" << value << std::string(25 - value.size() - 3, ' ') << \"*\" << std::endl;\n std::cout << std::string(25, '*') << std::endl;\n std::cout << std::string(25, ' ') << std::endl;\n}\n\ntemplate<typename DBN>\nvoid execute(DBN& dbn, task& task, const std::vector<std::string>& actions){\n print_title(\"Network\");\n dbn.display();\n\n using dbn_t = std::decay_t<DBN>;\n\n \/\/Execute all the actions sequentially\n for(auto& action : actions){\n if(action == \"pretrain\"){\n print_title(\"Pretraining\");\n\n if(task.pretraining.samples.empty()){\n std::cout << \"dllp: error: pretrain is not possible without a pretraining input\" << std::endl;\n return;\n }\n\n std::vector<typename dbn_t::input_t> pt_samples;\n\n \/\/Try to read the samples\n if(!read_samples(task.pretraining.samples, pt_samples)){\n std::cout << \"dllp: error: failed to read the pretraining samples\" << std::endl;\n return;\n }\n\n \/\/Pretrain the network\n dbn.pretrain(pt_samples.begin(), pt_samples.end(), task.pt_desc.epochs);\n } else if(action == \"train\"){\n print_title(\"Training\");\n\n if(task.training.samples.empty() || task.training.labels.empty()){\n std::cout << \"dllp: error: train is not possible without samples and labels\" << std::endl;\n return;\n }\n\n std::vector<typename dbn_t::input_t> ft_samples;\n std::vector<std::size_t> ft_labels;\n\n \/\/Try to read the samples\n if(!read_samples(task.training.samples, ft_samples)){\n std::cout << \"dllp: error: failed to read the training samples\" << std::endl;\n return;\n }\n\n \/\/Try to read the labels\n if(!read_labels(task.training.labels, ft_labels)){\n std::cout << \"dllp: error: failed to read the training labels\" << std::endl;\n return;\n }\n\n dbn.learning_rate = task.ft_desc.learning_rate;\n\n if(task.ft_desc.momentum != -666.0){\n dbn.momentum = task.ft_desc.momentum;\n }\n\n \/\/Train the network\n dbn.fine_tune(ft_samples, ft_labels, task.ft_desc.epochs);\n } else if(action == \"test\"){\n print_title(\"Testing\");\n\n if(task.testing.samples.empty() || task.testing.labels.empty()){\n std::cout << \"dllp: error: test is not possible without samples and labels\" << std::endl;\n return;\n }\n\n std::vector<typename dbn_t::input_t> test_samples;\n std::vector<std::size_t> test_labels;\n\n \/\/Try to read the samples\n if(!read_samples(task.testing.samples, test_samples)){\n std::cout << \"dllp: error: failed to read the training samples\" << std::endl;\n return;\n }\n\n \/\/Try to read the labels\n if(!read_labels(task.testing.labels, test_labels)){\n std::cout << \"dllp: error: failed to read the training labels\" << std::endl;\n return;\n }\n\n auto classes = dbn_t::output_size();\n\n etl::dyn_matrix<std::size_t, 2> conf(classes, classes, 0.0);\n\n std::size_t n = test_samples.size();\n std::size_t tp = 0;\n\n for(std::size_t i = 0; i < test_samples.size(); ++i){\n auto sample = test_samples[i];\n auto label = test_labels[i];\n\n auto predicted = dbn.predict(sample);\n\n if(predicted == label){\n ++tp;\n }\n\n ++conf(label, predicted);\n }\n\n double test_error = (n - tp) \/ double(n);\n\n std::cout << \"Error rate: \" << test_error << std::endl;\n std::cout << \"Accuracy: \" << (1.0 - test_error) << std::endl << std::endl;\n\n std::cout << \"Results per class\" << std::endl;\n\n double overall = 0.0;\n\n std::cout << \" | Accuracy | Error rate |\" << std::endl;\n\n for(std::size_t l = 0; l < classes; ++l){\n std::size_t total = etl::sum(conf(l));\n double acc = (total - conf(l, l)) \/ double(total);\n std::cout << std::setw(3) << l;\n std::cout << \"|\" << std::setw(10) << (1.0 - acc) << \"|\" << std::setw(12) << acc << \"|\" << std::endl;\n overall += acc;\n }\n\n std::cout << std::endl;\n\n std::cout << \"Overall Error rate: \" << overall \/ classes << std::endl;\n std::cout << \"Overall Accuracy: \" << 1.0 - (overall \/ classes) << std::endl << std::endl;\n\n std::cout << \"Confusion Matrix (%)\" << std::endl << std::endl;\n\n std::cout << \" \";\n for(std::size_t l = 0; l < classes; ++l){\n std::cout << std::setw(5) << l << \" \";\n }\n std::cout << std::endl;\n\n for(std::size_t l = 0; l < classes; ++l){\n std::size_t total = etl::sum(conf(l));\n std::cout << std::setw(3) << l << \"|\";\n for(std::size_t p = 0; p < classes; ++p){\n std::cout << std::setw(5) << std::setprecision(2) << 100.0 * (conf(l,p) \/ double(total)) << \"|\";\n }\n std::cout << std::endl;\n }\n std::cout << std::endl;\n } else if(action == \"save\"){\n print_title(\"Save Weights\");\n\n dbn.store(task.w_desc.file);\n std::cout << \"Weights saved\" << std::endl;\n } else if(action == \"load\"){\n print_title(\"Load Weights\");\n\n dbn.load(task.w_desc.file);\n std::cout << \"Weights loaded\" << std::endl;\n } else {\n std::cout << \"dllp: error: Invalid action: \" << action << std::endl;\n }\n }\n\n\n \/\/TODO\n}\n\n} \/\/end of namespace processor\n\n} \/\/end of namespace dll\n<|endoftext|>"} {"text":"<commit_before>#include <qrkernel\/version.h>\n\n#include \"gtest\/gtest.h\"\n\nusing namespace qReal;\n\nTEST(VersionTest, loadFromStringTest)\n{\n\tVersion version = Version::fromString(\"3\");\n\tASSERT_EQ(version, Version(3));\n\n\tversion = Version::fromString(\"3.14\");\n\tASSERT_EQ(version, Version(3, 14));\n\n\tversion = Version::fromString(\"3.14.15\");\n\tASSERT_EQ(version, Version(3, 14, 15));\n\n\tversion = Version::fromString(\"3 a\");\n\tASSERT_EQ(version, Version(3, 0, 0, Version::alpha));\n\n\tversion = Version::fromString(\"3.1-Alpha1124\");\n\tASSERT_EQ(version, Version(3, 1, 0, Version::alpha, 1124));\n\n\tversion = Version::fromString(\"3.0.0-B1\");\n\tASSERT_EQ(version, Version(3, 0, 0, Version::beta, 1));\n\n\tversion = Version::fromString(\"3.14.0 BETA\");\n\tASSERT_EQ(version, Version(3, 14, 0, Version::beta));\n\n\tversion = Version::fromString(\"3.14.0-RC1\");\n\tASSERT_EQ(version, Version(3, 14, 0, Version::releaseCandidate, 1));\n\n\tversion = Version::fromString(\"\");\n\tASSERT_EQ(version, Version());\n\n\tversion = Version::fromString(\"incorrect\");\n\tASSERT_EQ(version, Version());\n\n\tversion = Version::fromString(\"3.1.4.15\");\n\tASSERT_EQ(version, Version());\n\n\tversion = Version::fromString(\"3.1-wrong1\");\n\tASSERT_EQ(version, Version());\n\n\tversion = Version::fromString(\"3.1-alpha1a\");\n\tASSERT_EQ(version, Version());\n}\n\nTEST(VersionTest, compareTest)\n{\n\tASSERT_TRUE(Version::fromString(\"3\") == Version::fromString(\"3.0.0\"));\n\tASSERT_TRUE(Version::fromString(\"3.0.0-a\") < Version::fromString(\"3.0.0-rc1\"));\n\tASSERT_TRUE(Version::fromString(\"3.0.0-a\") < Version::fromString(\"3.0.0-b1\"));\n\tASSERT_TRUE(Version::fromString(\"3.0.0-b1\") < Version::fromString(\"3.0.0-rc1\"));\n\tASSERT_TRUE(Version::fromString(\"3.0.0-rc1\") < Version::fromString(\"3.0.0-rc2\"));\n\tASSERT_TRUE(Version::fromString(\"3.0.0-rc2\") < Version::fromString(\"3.0.0\"));\n}\n<commit_msg>Added more tests for version class<commit_after>#include <qrkernel\/version.h>\n\n#include \"gtest\/gtest.h\"\n\nusing namespace qReal;\n\nTEST(VersionTest, loadFromStringTest)\n{\n\tVersion version = Version::fromString(\"3\");\n\tASSERT_EQ(version, Version(3));\n\n\tversion = Version::fromString(\"3.14\");\n\tASSERT_EQ(version, Version(3, 14));\n\n\tversion = Version::fromString(\"3.14.15\");\n\tASSERT_EQ(version, Version(3, 14, 15));\n\n\tversion = Version::fromString(\"3 a\");\n\tASSERT_EQ(version, Version(3, 0, 0, Version::alpha));\n\n\tversion = Version::fromString(\"3.1-Alpha1124\");\n\tASSERT_EQ(version, Version(3, 1, 0, Version::alpha, 1124));\n\n\tversion = Version::fromString(\"3.0.0-B1\");\n\tASSERT_EQ(version, Version(3, 0, 0, Version::beta, 1));\n\n\tversion = Version::fromString(\"3.14.0 BETA\");\n\tASSERT_EQ(version, Version(3, 14, 0, Version::beta));\n\n\tversion = Version::fromString(\"3.14.0-RC1\");\n\tASSERT_EQ(version, Version(3, 14, 0, Version::releaseCandidate, 1));\n\n\tversion = Version::fromString(\"\");\n\tASSERT_EQ(version, Version());\n\n\tversion = Version::fromString(\"incorrect\");\n\tASSERT_EQ(version, Version());\n\n\tversion = Version::fromString(\"3.1.4.15\");\n\tASSERT_EQ(version, Version());\n\n\tversion = Version::fromString(\"3.1-wrong1\");\n\tASSERT_EQ(version, Version());\n\n\tversion = Version::fromString(\"3.1-alpha1a\");\n\tASSERT_EQ(version, Version());\n}\n\nTEST(VersionTest, compareTest)\n{\n\tASSERT_TRUE(Version::fromString(\"3\") == Version::fromString(\"3.0.0\"));\n\tASSERT_TRUE(Version::fromString(\"3.0.0-a\") < Version::fromString(\"3.0.0-rc1\"));\n\tASSERT_TRUE(Version::fromString(\"3.0.0-a\") < Version::fromString(\"3.0.0-b1\"));\n\tASSERT_TRUE(Version::fromString(\"3.0.0-b1\") < Version::fromString(\"3.0.0-rc1\"));\n\tASSERT_TRUE(Version::fromString(\"3.0.0-rc1\") < Version::fromString(\"3.0.0-rc2\"));\n\tASSERT_TRUE(Version::fromString(\"3.0.0-rc2\") < Version::fromString(\"3.0.0\"));\n}\n\nTEST(VersionTest, toStringTest)\n{\n\tVersion version = Version::fromString(\"3\");\n\tASSERT_EQ(version, Version::fromString(version.toString()));\n\n\tversion = Version::fromString(\"3.0.0\");\n\tASSERT_EQ(version, Version::fromString(version.toString()));\n\n\tversion = Version::fromString(\"3.0.0-a\");\n\tASSERT_EQ(version, Version::fromString(version.toString()));\n\n\tversion = Version::fromString(\"3.0.0-b1\");\n\tASSERT_EQ(version, Version::fromString(version.toString()));\n\n\tversion = Version::fromString(\"3.0.0-rc1\");\n\tASSERT_EQ(version, Version::fromString(version.toString()));\n}\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 <libport\/cassert>\n\nnamespace libport\n{\n template<class T, int R>\n inline\n ReservedVector<T, R>::ReservedVector()\n {\n this->reserve(R);\n }\n\n template<class T, int R>\n inline\n ReservedVector<T, R>::ReservedVector(const self_type& other)\n : super_type()\n {\n this->reserve(R);\n insert(this->end(), other.begin(), other.end());\n }\n\n template<class T, int R>\n template<typename I1, typename I2>\n inline\n ReservedVector<T, R>::ReservedVector(I1 b, I2 e)\n : super_type()\n {\n this->reserve(R);\n insert(this->end(), b, e);\n }\n\n template<class T, int R>\n template<int R2>\n inline\n ReservedVector<T, R>::ReservedVector(const ReservedVector<T, R2>& b)\n : super_type(b)\n {\n this->reserve(R);\n }\n\n template<typename T>\n inline\n void pop_front(T& v)\n {\n T v2(++v.begin(), v.end());\n v = v2;\n }\n\n template<typename T, typename U>\n inline\n void push_front(T& v, const U& e)\n {\n if (v.empty())\n v.push_back(e);\n else\n {\n T v2;\n v2.push_back(e);\n v2.insert(v2.end(), v.begin(), v.end());\n v = v2;\n }\n }\n\n template<typename T, int R>\n class ReservedVectorAllocator: public std::allocator<T>\n {\n \/*-----------.\n | Typedefs. |\n `-----------*\/\n public :\n typedef ReservedVectorAllocator self_type;\n typedef std::allocator<T> super_type;\n typedef typename super_type::pointer pointer;\n typedef typename super_type::size_type size_type;\n template<typename U>\n struct rebind\n {\n typedef ReservedVectorAllocator<U, R> other;\n };\n\n \/*-------------.\n | Construction |\n `-------------*\/\n public:\n ReservedVectorAllocator()\n#ifndef NDEBUG\n : local_(false)\n#endif\n {\n\n }\n\n \/*--------------------.\n | Memory allocation. |\n `--------------------*\/\n public:\n inline pointer\n allocate(size_type count, typename std::allocator<void>::const_pointer = 0)\n {\n if (count <= R)\n {\n#ifndef NDEBUG\n assert(!local_);\n local_ = true;\n#endif\n return reinterpret_cast<pointer>(pool_);\n }\n else\n {\n#ifndef NDEBUG\n local_ = false;\n#endif\n return reinterpret_cast<pointer>(malloc(count * sizeof(T)));\n }\n }\n\n inline void\n deallocate(pointer p, size_type count)\n {\n if (count > R)\n {\n assert(reinterpret_cast<pointer>(p) != reinterpret_cast<pointer>(pool_));\n free(p);\n }\n else\n assert(reinterpret_cast<pointer>(p) == reinterpret_cast<pointer>(pool_));\n }\n\n private:\n typedef long long align_type;\n enum { chunk_size = (sizeof(T) - 1) \/ sizeof(align_type) + 1 };\n align_type pool_[R * chunk_size];\n#ifndef NDEBUG\n bool local_;\n#endif\n };\n}\n<commit_msg>Fix type-punned warning with GCC 4.1.2.<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 <libport\/cassert>\n\nnamespace libport\n{\n template<class T, int R>\n inline\n ReservedVector<T, R>::ReservedVector()\n {\n this->reserve(R);\n }\n\n template<class T, int R>\n inline\n ReservedVector<T, R>::ReservedVector(const self_type& other)\n : super_type()\n {\n this->reserve(R);\n insert(this->end(), other.begin(), other.end());\n }\n\n template<class T, int R>\n template<typename I1, typename I2>\n inline\n ReservedVector<T, R>::ReservedVector(I1 b, I2 e)\n : super_type()\n {\n this->reserve(R);\n insert(this->end(), b, e);\n }\n\n template<class T, int R>\n template<int R2>\n inline\n ReservedVector<T, R>::ReservedVector(const ReservedVector<T, R2>& b)\n : super_type(b)\n {\n this->reserve(R);\n }\n\n template<typename T>\n inline\n void pop_front(T& v)\n {\n T v2(++v.begin(), v.end());\n v = v2;\n }\n\n template<typename T, typename U>\n inline\n void push_front(T& v, const U& e)\n {\n if (v.empty())\n v.push_back(e);\n else\n {\n T v2;\n v2.push_back(e);\n v2.insert(v2.end(), v.begin(), v.end());\n v = v2;\n }\n }\n\n template<typename T, int R>\n class ReservedVectorAllocator: public std::allocator<T>\n {\n \/*-----------.\n | Typedefs. |\n `-----------*\/\n public :\n typedef ReservedVectorAllocator self_type;\n typedef std::allocator<T> super_type;\n typedef typename super_type::pointer pointer;\n typedef typename super_type::size_type size_type;\n template<typename U>\n struct rebind\n {\n typedef ReservedVectorAllocator<U, R> other;\n };\n\n \/*-------------.\n | Construction |\n `-------------*\/\n public:\n ReservedVectorAllocator()\n#ifndef NDEBUG\n : local_(false)\n#endif\n {\n\n }\n\n \/*--------------------.\n | Memory allocation. |\n `--------------------*\/\n public:\n inline pointer\n allocate(size_type count, typename std::allocator<void>::const_pointer = 0)\n {\n if (count <= R)\n {\n#ifndef NDEBUG\n assert(!local_);\n local_ = true;\n#endif\n \/\/ Union hack to cast to a different pointer type;\n \/\/ reinterpret_cast<pointer>(pool_) gives a type-punned\n \/\/ warning with GCC 4.1.2.\n union\n {\n align_type* in;\n pointer out;\n } conv;\n conv.in = pool_;\n return conv.out;\n }\n else\n {\n#ifndef NDEBUG\n local_ = false;\n#endif\n return reinterpret_cast<pointer>(malloc(count * sizeof(T)));\n }\n }\n\n inline void\n deallocate(pointer p, size_type count)\n {\n if (count > R)\n {\n assert(reinterpret_cast<pointer>(p) != reinterpret_cast<pointer>(pool_));\n free(p);\n }\n else\n assert(reinterpret_cast<pointer>(p) == reinterpret_cast<pointer>(pool_));\n }\n\n private:\n typedef long long align_type;\n enum { chunk_size = (sizeof(T) - 1) \/ sizeof(align_type) + 1 };\n align_type pool_[R * chunk_size];\n#ifndef NDEBUG\n bool local_;\n#endif\n };\n}\n<|endoftext|>"} {"text":"<commit_before>\/*\n\nCopyright (c) 2010-2012, Arvid Norberg\nAll rights reserved.\n\nRedistribution and use in source and binary forms, with or without\nmodification, are permitted provided that the following conditions\nare met:\n\n * Redistributions of source code must retain the above copyright\n notice, this list of conditions and the following disclaimer.\n * Redistributions in binary form must reproduce the above copyright\n notice, this list of conditions and the following disclaimer in\n the documentation and\/or other materials provided with the distribution.\n * Neither the name of the author nor the names of its\n contributors may be used to endorse or promote products derived\n from this software without specific prior written permission.\n\nTHIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS \"AS IS\"\nAND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE\nIMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE\nARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE\nLIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR\nCONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF\nSUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS\nINTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN\nCONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)\nARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE\nPOSSIBILITY OF SUCH DAMAGE.\n\n*\/\n\n#ifndef TORRENT_BUILD_CONFIG_HPP_INCLUDED\n#define TORRENT_BUILD_CONFIG_HPP_INCLUDED\n\n#include \"libtorrent\/config.hpp\"\n#include <boost\/preprocessor\/cat.hpp>\n#include <boost\/preprocessor\/stringize.hpp>\n\n#ifdef TORRENT_DEBUG\n#define TORRENT_CFG_DEBUG dbg_\n#else\n#define TORRENT_CFG_DEBUG rel_\n#endif\n\n#if TORRENT_USE_BOOST_DATE_TIME\n#define TORRENT_CFG_TIME boosttime_\n#elif TORRENT_USE_ABSOLUTE_TIME\n#define TORRENT_CFG_TIME absolutetime_\n#elif TORRENT_USE_QUERY_PERFORMANCE_TIMER\n#define TORRENT_CFG_TIME performancetimer_\n#elif TORRENT_USE_CLOCK_GETTIME\n#define TORRENT_CFG_TIME clocktime_\n#elif TORRENT_USE_SYSTEM_TIME\n#define TORRENT_CFG_TIME systime_\n#else\n#error what timer is used?\n#endif\n\n#if TORRENT_USE_IPV6\n#define TORRENT_CFG_IPV6 ipv6_\n#else\n#define TORRENT_CFG_IPV6 noipv_-\n#endif\n\n#ifdef TORRENT_DISABLE_POOL_ALLOCATORS\n#define TORRENT_CFG_POOL nopools_\n#else\n#define TORRENT_CFG_POOL pools_\n#endif\n\n#ifdef _UNICODE\n#define TORRENT_CFG_UNICODE unicode_\n#else\n#define TORRENT_CFG_UNICODE ansi_\n#endif\n\n#ifdef TORRENT_NO_DEPRECATE\n#define TORRENT_CFG_DEPR nodeprecate_\n#else\n#define TORRENT_CFG_DEPR deprecated_\n#endif\n\n#ifdef TORRENT_DISABLE_FULL_STATS\n#define TORRENT_CFG_STATS partialstats_\n#else\n#define TORRENT_CFG_STATS fullstats_\n#endif\n\n#ifdef TORRENT_DISABLE_EXTENSIONS\n#define TORRENT_CFG_EXT noext_\n#else\n#define TORRENT_CFG_EXT ext_\n#endif\n\n#define TORRENT_CFG \\\n\tBOOST_PP_CAT(TORRENT_CFG_DEBUG, \\\n\tBOOST_PP_CAT(TORRENT_CFG_TIME, \\\n\tBOOST_PP_CAT(TORRENT_CFG_POOL, \\\n\tBOOST_PP_CAT(TORRENT_CFG_LOG, \\\n\tBOOST_PP_CAT(TORRENT_CFG_DEPR, \\\n\tTORRENT_CFG_EXT)))))\n\n#define TORRENT_CFG_STRING BOOST_PP_STRINGIZE(TORRENT_CFG)\n\n#endif\n\n<commit_msg>disable pool allocators does not affect libtorrent API<commit_after>\/*\n\nCopyright (c) 2010-2012, Arvid Norberg\nAll rights reserved.\n\nRedistribution and use in source and binary forms, with or without\nmodification, are permitted provided that the following conditions\nare met:\n\n * Redistributions of source code must retain the above copyright\n notice, this list of conditions and the following disclaimer.\n * Redistributions in binary form must reproduce the above copyright\n notice, this list of conditions and the following disclaimer in\n the documentation and\/or other materials provided with the distribution.\n * Neither the name of the author nor the names of its\n contributors may be used to endorse or promote products derived\n from this software without specific prior written permission.\n\nTHIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS \"AS IS\"\nAND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE\nIMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE\nARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE\nLIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR\nCONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF\nSUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS\nINTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN\nCONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)\nARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE\nPOSSIBILITY OF SUCH DAMAGE.\n\n*\/\n\n#ifndef TORRENT_BUILD_CONFIG_HPP_INCLUDED\n#define TORRENT_BUILD_CONFIG_HPP_INCLUDED\n\n#include \"libtorrent\/config.hpp\"\n#include <boost\/preprocessor\/cat.hpp>\n#include <boost\/preprocessor\/stringize.hpp>\n\n#ifdef TORRENT_DEBUG\n#define TORRENT_CFG_DEBUG dbg_\n#else\n#define TORRENT_CFG_DEBUG rel_\n#endif\n\n#if TORRENT_USE_BOOST_DATE_TIME\n#define TORRENT_CFG_TIME boosttime_\n#elif TORRENT_USE_ABSOLUTE_TIME\n#define TORRENT_CFG_TIME absolutetime_\n#elif TORRENT_USE_QUERY_PERFORMANCE_TIMER\n#define TORRENT_CFG_TIME performancetimer_\n#elif TORRENT_USE_CLOCK_GETTIME\n#define TORRENT_CFG_TIME clocktime_\n#elif TORRENT_USE_SYSTEM_TIME\n#define TORRENT_CFG_TIME systime_\n#else\n#error what timer is used?\n#endif\n\n#if TORRENT_USE_IPV6\n#define TORRENT_CFG_IPV6 ipv6_\n#else\n#define TORRENT_CFG_IPV6 noipv_-\n#endif\n\n#ifdef _UNICODE\n#define TORRENT_CFG_UNICODE unicode_\n#else\n#define TORRENT_CFG_UNICODE ansi_\n#endif\n\n#ifdef TORRENT_NO_DEPRECATE\n#define TORRENT_CFG_DEPR nodeprecate_\n#else\n#define TORRENT_CFG_DEPR deprecated_\n#endif\n\n#ifdef TORRENT_DISABLE_FULL_STATS\n#define TORRENT_CFG_STATS partialstats_\n#else\n#define TORRENT_CFG_STATS fullstats_\n#endif\n\n#ifdef TORRENT_DISABLE_EXTENSIONS\n#define TORRENT_CFG_EXT noext_\n#else\n#define TORRENT_CFG_EXT ext_\n#endif\n\n#define TORRENT_CFG \\\n\tBOOST_PP_CAT(TORRENT_CFG_DEBUG, \\\n\tBOOST_PP_CAT(TORRENT_CFG_TIME, \\\n\tBOOST_PP_CAT(TORRENT_CFG_LOG, \\\n\tBOOST_PP_CAT(TORRENT_CFG_DEPR, \\\n\tTORRENT_CFG_EXT))))\n\n#define TORRENT_CFG_STRING BOOST_PP_STRINGIZE(TORRENT_CFG)\n\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 \"chrome\/test\/test_timeouts.h\"\n\n#include \"base\/command_line.h\"\n#include \"base\/logging.h\"\n#include \"base\/string_number_conversions.h\"\n#include \"chrome\/test\/test_switches.h\"\n\nnamespace {\n\nvoid InitializeTimeout(const char* switch_name, int* value) {\n DCHECK(value);\n if (CommandLine::ForCurrentProcess()->HasSwitch(switch_name)) {\n std::string string_value(\n CommandLine::ForCurrentProcess()->GetSwitchValueASCII(switch_name));\n int timeout;\n base::StringToInt(string_value, &timeout);\n *value = std::max(*value, timeout);\n }\n}\n\n} \/\/ namespace\n\n\/\/ static\nbool TestTimeouts::initialized_ = false;\n\n\/\/ The timeout values should increase in the order they appear in this block.\n\/\/ static\nint TestTimeouts::action_timeout_ms_ = 2000;\nint TestTimeouts::action_max_timeout_ms_ = 15000;\nint TestTimeouts::medium_test_timeout_ms_ = 30 * 1000;\nint TestTimeouts::large_test_timeout_ms_ = 10 * 60 * 1000;\n\n\/\/ static\nint TestTimeouts::sleep_timeout_ms_ = 2000;\n\n\/\/ static\nint TestTimeouts::command_execution_timeout_ms_ = 25000;\n\n\/\/ static\nint TestTimeouts::wait_for_terminate_timeout_ms_ = 15000;\n\n\/\/ static\nvoid TestTimeouts::Initialize() {\n if (initialized_) {\n NOTREACHED();\n return;\n }\n initialized_ = true;\n\n InitializeTimeout(switches::kUiTestActionTimeout, &action_timeout_ms_);\n InitializeTimeout(switches::kUiTestActionMaxTimeout,\n &action_max_timeout_ms_);\n InitializeTimeout(switches::kMediumTestTimeout, &medium_test_timeout_ms_);\n InitializeTimeout(switches::kUiTestTimeout, &large_test_timeout_ms_);\n\n \/\/ The timeout values should be increasing in the right order.\n CHECK(action_timeout_ms_ <= action_max_timeout_ms_);\n CHECK(action_max_timeout_ms_ <= medium_test_timeout_ms_);\n CHECK(medium_test_timeout_ms_ <= large_test_timeout_ms_);\n\n InitializeTimeout(switches::kUiTestSleepTimeout, &sleep_timeout_ms_);\n InitializeTimeout(switches::kUiTestCommandExecutionTimeout,\n &command_execution_timeout_ms_);\n InitializeTimeout(switches::kUiTestTerminateTimeout,\n &wait_for_terminate_timeout_ms_);\n}\n<commit_msg>GTTF: Increase the timeout for medium tests to one minute.<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\/test_timeouts.h\"\n\n#include \"base\/command_line.h\"\n#include \"base\/logging.h\"\n#include \"base\/string_number_conversions.h\"\n#include \"chrome\/test\/test_switches.h\"\n\nnamespace {\n\nvoid InitializeTimeout(const char* switch_name, int* value) {\n DCHECK(value);\n if (CommandLine::ForCurrentProcess()->HasSwitch(switch_name)) {\n std::string string_value(\n CommandLine::ForCurrentProcess()->GetSwitchValueASCII(switch_name));\n int timeout;\n base::StringToInt(string_value, &timeout);\n *value = std::max(*value, timeout);\n }\n}\n\n} \/\/ namespace\n\n\/\/ static\nbool TestTimeouts::initialized_ = false;\n\n\/\/ The timeout values should increase in the order they appear in this block.\n\/\/ static\nint TestTimeouts::action_timeout_ms_ = 2000;\nint TestTimeouts::action_max_timeout_ms_ = 15000;\nint TestTimeouts::medium_test_timeout_ms_ = 60 * 1000;\nint TestTimeouts::large_test_timeout_ms_ = 10 * 60 * 1000;\n\n\/\/ static\nint TestTimeouts::sleep_timeout_ms_ = 2000;\n\n\/\/ static\nint TestTimeouts::command_execution_timeout_ms_ = 25000;\n\n\/\/ static\nint TestTimeouts::wait_for_terminate_timeout_ms_ = 15000;\n\n\/\/ static\nvoid TestTimeouts::Initialize() {\n if (initialized_) {\n NOTREACHED();\n return;\n }\n initialized_ = true;\n\n InitializeTimeout(switches::kUiTestActionTimeout, &action_timeout_ms_);\n InitializeTimeout(switches::kUiTestActionMaxTimeout,\n &action_max_timeout_ms_);\n InitializeTimeout(switches::kMediumTestTimeout, &medium_test_timeout_ms_);\n InitializeTimeout(switches::kUiTestTimeout, &large_test_timeout_ms_);\n\n \/\/ The timeout values should be increasing in the right order.\n CHECK(action_timeout_ms_ <= action_max_timeout_ms_);\n CHECK(action_max_timeout_ms_ <= medium_test_timeout_ms_);\n CHECK(medium_test_timeout_ms_ <= large_test_timeout_ms_);\n\n InitializeTimeout(switches::kUiTestSleepTimeout, &sleep_timeout_ms_);\n InitializeTimeout(switches::kUiTestCommandExecutionTimeout,\n &command_execution_timeout_ms_);\n InitializeTimeout(switches::kUiTestTerminateTimeout,\n &wait_for_terminate_timeout_ms_);\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 <string>\n\n#include \"build\/build_config.h\"\n#include \"chrome\/test\/ui\/ui_test.h\"\n#include \"net\/base\/net_util.h\"\n\nclass GPUTest : public UITest {\n protected:\n GPUTest() {\n }\n\n virtual void SetUp() {\n UITest::SetUp();\n gpu_test_dir_ = test_data_directory_.AppendASCII(\"gpu\");\n }\n\n FilePath gpu_test_dir_;\n};\n\n\/\/ TODO(apatrick): Other pending changes will fix this for mac.\n#if defined(OS_MACOSX)\n#define MAYBE_UITestLaunchedWithOSMesa DISABLED_UITestLaunchedWithOSMesa\n#else\n#define MAYBE_UITestLaunchedWithOSMesa UITestLaunchedWithOSMesa\n#endif\n\nTEST_F(GPUTest, MAYBE_UITestLaunchedWithOSMesa) {\n \/\/ Check the webgl test reports success and that the renderer was OSMesa.\n \/\/ We use OSMesa for tests in order to get consistent results across a\n \/\/ variety of boxes.\n NavigateToURL(\n net::FilePathToFileURL(gpu_test_dir_.AppendASCII(\"webgl.html\")));\n\n EXPECT_EQ(std::wstring(L\"SUCCESS: Mesa OffScreen\"), GetActiveTabTitle());\n}\n<commit_msg>Marked GPUUITest.UITestLaunchedWithOSMesa disabled on Windows.<commit_after>\/\/ Copyright (c) 2010 The Chromium Authors. All rights reserved.\n\/\/ Use of this source code is governed by a BSD-style license that can be\n\/\/ found in the LICENSE file.\n\n#include <string>\n\n#include \"build\/build_config.h\"\n#include \"chrome\/test\/ui\/ui_test.h\"\n#include \"net\/base\/net_util.h\"\n\nclass GPUUITest : public UITest {\n protected:\n GPUUITest() {\n }\n\n virtual void SetUp() {\n UITest::SetUp();\n gpu_test_dir_ = test_data_directory_.AppendASCII(\"gpu\");\n }\n\n FilePath gpu_test_dir_;\n};\n\n#if defined(OS_WIN) || defined(OS_MACOSX)\n#define MAYBE_UITestLaunchedWithOSMesa DISABLED_UITestLaunchedWithOSMesa\n#else\n#define MAYBE_UITestLaunchedWithOSMesa UITestLaunchedWithOSMesa\n#endif\n\nTEST_F(GPUUITest, MAYBE_UITestLaunchedWithOSMesa) {\n \/\/ Check the webgl test reports success and that the renderer was OSMesa.\n \/\/ We use OSMesa for tests in order to get consistent results across a\n \/\/ variety of boxes.\n NavigateToURL(\n net::FilePathToFileURL(gpu_test_dir_.AppendASCII(\"webgl.html\")));\n\n EXPECT_EQ(std::wstring(L\"SUCCESS: Mesa OffScreen\"), GetActiveTabTitle());\n}\n<|endoftext|>"} {"text":"<commit_before>\/*****************************************************************************\n *\n * This file is part of Mapnik (c++ mapping toolkit)\n *\n * Copyright (C) 2011 Artem Pavlenko\n *\n * This library is free software; you can redistribute it and\/or\n * modify it under the terms of the GNU Lesser General Public\n * License as published by the Free Software Foundation; either\n * version 2.1 of the License, or (at your option) any later version.\n *\n * This library is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU\n * Lesser General Public License for more details.\n *\n * You should have received a copy of the GNU Lesser General Public\n * License along with this library; if not, write to the Free Software\n * Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA\n *\n *****************************************************************************\/\n\n#ifndef MAPNIK_POINT_SYMBOLIZER_HPP\n#define MAPNIK_POINT_SYMBOLIZER_HPP\n\n\/\/ mapnik\n#include <mapnik\/symbolizer.hpp>\n#include <mapnik\/enumeration.hpp>\n\nnamespace mapnik\n{\n\nenum point_placement_enum {\n CENTROID_POINT_PLACEMENT,\n INTERIOR_POINT_PLACEMENT,\n point_placement_enum_MAX\n};\n\nDEFINE_ENUM( point_placement_e, point_placement_enum );\n\nstruct MAPNIK_DECL point_symbolizer :\n public symbolizer_with_image, public symbolizer_base\n{\n explicit point_symbolizer();\n point_symbolizer(path_expression_ptr file);\n point_symbolizer(point_symbolizer const& rhs);\n void set_allow_overlap(bool overlap);\n bool get_allow_overlap() const;\n void set_point_placement(point_placement_e point_p);\n point_placement_e get_point_placement() const;\n void set_ignore_placement(bool ignore_placement);\n bool get_ignore_placement() const;\n\nprivate:\n bool overlap_;\n point_placement_e point_p_;\n bool ignore_placement_;\n};\n}\n\n#endif \/\/ MAPNIK_POINT_SYMBOLIZER_HPP\n<commit_msg>+ explicit keyword only makes sense for 1 arg ctor's<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_POINT_SYMBOLIZER_HPP\n#define MAPNIK_POINT_SYMBOLIZER_HPP\n\n\/\/ mapnik\n#include <mapnik\/symbolizer.hpp>\n#include <mapnik\/enumeration.hpp>\n\nnamespace mapnik\n{\n\nenum point_placement_enum {\n CENTROID_POINT_PLACEMENT,\n INTERIOR_POINT_PLACEMENT,\n point_placement_enum_MAX\n};\n\nDEFINE_ENUM( point_placement_e, point_placement_enum );\n\nstruct MAPNIK_DECL point_symbolizer :\n public symbolizer_with_image, public symbolizer_base\n{\n point_symbolizer();\n point_symbolizer(path_expression_ptr file);\n point_symbolizer(point_symbolizer const& rhs);\n void set_allow_overlap(bool overlap);\n bool get_allow_overlap() const;\n void set_point_placement(point_placement_e point_p);\n point_placement_e get_point_placement() const;\n void set_ignore_placement(bool ignore_placement);\n bool get_ignore_placement() const;\n\nprivate:\n bool overlap_;\n point_placement_e point_p_;\n bool ignore_placement_;\n};\n}\n\n#endif \/\/ MAPNIK_POINT_SYMBOLIZER_HPP\n<|endoftext|>"} {"text":"<commit_before>\/*\n Copyright (c) 2017 Genome Research Ltd.\n\n Author: Jouni Siren <jouni.siren@iki.fi>\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 \"new_relative_lcp.h\"\n\nusing namespace relative;\n\n\/\/------------------------------------------------------------------------------\n\nint\nmain(int argc, char** argv)\n{\n if(argc < 3)\n {\n std::cerr << \"Usage: build_rlcp reference target1 [target2 ...]\" << std::endl;\n std::cerr << std::endl;\n std::exit(EXIT_SUCCESS);\n }\n\n std::cout << \"Building the relative LCP array\" << std::endl;\n std::cout << std::endl;\n\n std::string ref_name = std::string(argv[1]) + LCP_EXTENSION;\n printHeader(\"Reference\"); std::cout << ref_name << std::endl;\n SLArray reference;\n sdsl::load_from_file(reference, ref_name);\n printHeader(\"Length\"); std::cout << reference.size() << std::endl;\n std::cout << std::endl;\n\n for(int i = 2; i < argc; i++)\n {\n std::string target_name = std::string(argv[i]) + LCP_EXTENSION;\n printHeader(\"Target\"); std::cout << target_name << std::endl;\n SLArray target;\n sdsl::load_from_file(target, target_name);\n printHeader(\"Length\"); std::cout << target.size() << std::endl;\n\n double start = readTimer();\n NewRelativeLCP rlcp(reference, target);\n double seconds = readTimer() - start;\n printHeader(\"Construction\"); std::cout << seconds << \" seconds\" << std::endl;\n double phrase_length = rlcp.size() \/ (double)(rlcp.phrases());\n printHeader(\"Phrases\"); std::cout << rlcp.phrases() << \" (average length \" << phrase_length << \")\" << std::endl;\n rlcp.reportSize(true);\n rlcp.writeTo(argv[i]);\n\n std::cout << std::endl;\n }\n\n std::cout << \"Memory usage: \" << inGigabytes(memoryUsage()) << \" GB\" << std::endl;\n std::cout << std::endl;\n\n return 0;\n}\n\n\/\/------------------------------------------------------------------------------\n<commit_msg>Output Reference LCP size<commit_after>\/*\n Copyright (c) 2017 Genome Research Ltd.\n\n Author: Jouni Siren <jouni.siren@iki.fi>\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 \"new_relative_lcp.h\"\n\nusing namespace relative;\n\n\/\/------------------------------------------------------------------------------\n\nint\nmain(int argc, char** argv)\n{\n if(argc < 3)\n {\n std::cerr << \"Usage: build_rlcp reference target1 [target2 ...]\" << std::endl;\n std::cerr << std::endl;\n std::exit(EXIT_SUCCESS);\n }\n\n std::cout << \"Building the relative LCP array\" << std::endl;\n std::cout << std::endl;\n\n std::string ref_name = std::string(argv[1]) + LCP_EXTENSION;\n printHeader(\"Reference\"); std::cout << ref_name << std::endl;\n SLArray reference;\n sdsl::load_from_file(reference, ref_name);\n printHeader(\"Length\"); std::cout << reference.size() << std::endl;\n printSize(\"LCP array\", sdsl::size_in_bytes(reference), reference.size());\n std::cout << std::endl;\n\n for(int i = 2; i < argc; i++)\n {\n std::string target_name = std::string(argv[i]) + LCP_EXTENSION;\n printHeader(\"Target\"); std::cout << target_name << std::endl;\n SLArray target;\n sdsl::load_from_file(target, target_name);\n printHeader(\"Length\"); std::cout << target.size() << std::endl;\n\n double start = readTimer();\n NewRelativeLCP rlcp(reference, target);\n double seconds = readTimer() - start;\n printHeader(\"Construction\"); std::cout << seconds << \" seconds\" << std::endl;\n double phrase_length = rlcp.size() \/ (double)(rlcp.phrases());\n printHeader(\"Phrases\"); std::cout << rlcp.phrases() << \" (average length \" << phrase_length << \")\" << std::endl;\n rlcp.reportSize(true);\n rlcp.writeTo(argv[i]);\n\n std::cout << std::endl;\n }\n\n std::cout << \"Memory usage: \" << inGigabytes(memoryUsage()) << \" GB\" << std::endl;\n std::cout << std::endl;\n\n return 0;\n}\n\n\/\/------------------------------------------------------------------------------\n<|endoftext|>"} {"text":"<commit_before>\/\/ Copyright (c) 2016-2019 Daniel Frey and Dr. Colin Hirsch\n\/\/ Please see LICENSE for license or visit https:\/\/github.com\/taocpp\/taopq\/\n\n#ifndef TAO_PQ_PARAMETER_TRAITS_HPP\n#define TAO_PQ_PARAMETER_TRAITS_HPP\n\n#include <cmath>\n#include <optional>\n#include <string>\n#include <tuple>\n#include <type_traits>\n#include <utility>\n\n#include <byteswap.h>\n#include <cstring>\n\n#include <tao\/pq\/internal\/printf.hpp>\n#include <tao\/pq\/null.hpp>\n\nnamespace tao::pq\n{\n inline int ftoi( const float v )\n {\n static_assert( sizeof( float ) == 4 );\n static_assert( sizeof( int ) == 4 );\n\n int r;\n std::memcpy( (char*)&r, (char*)&v, 4 );\n return r;\n }\n\n inline long dtol( const double v )\n {\n static_assert( sizeof( double ) == 8 );\n static_assert( sizeof( long ) == 8 );\n\n long r;\n std::memcpy( (char*)&r, (char*)&v, 8 );\n return r;\n }\n\n template< typename, typename = void >\n struct parameter_traits;\n\n namespace internal\n {\n class char_pointer_helper\n {\n private:\n const char* m_p;\n\n protected:\n explicit char_pointer_helper( const char* p ) noexcept\n : m_p( p )\n {\n }\n\n public:\n static constexpr std::size_t columns = 1;\n\n template< std::size_t I >\n const char* c_str() const noexcept\n {\n static_assert( I < columns );\n return m_p;\n }\n\n template< std::size_t I >\n constexpr int size() const noexcept\n {\n static_assert( I < columns );\n return 0;\n }\n\n template< std::size_t I >\n constexpr int format() const noexcept\n {\n static_assert( I < columns );\n return 0;\n }\n };\n\n class string_helper\n {\n private:\n std::string m_s;\n\n protected:\n template< typename... Ts >\n explicit string_helper( Ts&&... ts ) noexcept( noexcept( std::string( std::forward< Ts >( ts )... ) ) )\n : m_s( std::forward< Ts >( ts )... )\n {\n }\n\n public:\n static constexpr std::size_t columns = 1;\n\n template< std::size_t I >\n const char* c_str() const noexcept\n {\n static_assert( I < columns );\n return m_s.c_str();\n }\n\n template< std::size_t I >\n constexpr int size() const noexcept\n {\n static_assert( I < columns );\n return 0;\n }\n\n template< std::size_t I >\n constexpr int format() const noexcept\n {\n static_assert( I < columns );\n return 0;\n }\n };\n\n template< typename T >\n [[nodiscard]] std::string printf_helper( const char* format, const T v )\n {\n if( std::isfinite( v ) ) {\n return internal::printf( format, v );\n }\n if( std::isnan( v ) ) {\n return \"NAN\";\n }\n return ( v < 0 ) ? \"-INF\" : \"INF\";\n }\n\n } \/\/ namespace internal\n\n template<>\n struct parameter_traits< null_t >\n {\n parameter_traits( const null_t& ) noexcept\n {\n }\n\n static constexpr std::size_t columns = 1;\n\n template< std::size_t I >\n constexpr const char* c_str() const noexcept\n {\n static_assert( I < columns );\n return nullptr;\n }\n\n template< std::size_t I >\n constexpr int size() const noexcept\n {\n static_assert( I < columns );\n return 0;\n }\n\n template< std::size_t I >\n constexpr int format() const noexcept\n {\n static_assert( I < columns );\n return 0;\n }\n };\n\n template<>\n struct parameter_traits< const char* >\n : internal::char_pointer_helper\n {\n parameter_traits( const char* p ) noexcept\n : char_pointer_helper( p )\n {\n }\n };\n\n template<>\n struct parameter_traits< std::string >\n : internal::char_pointer_helper\n {\n parameter_traits( const std::string& v ) noexcept\n : char_pointer_helper( v.c_str() )\n {\n }\n };\n\n template<>\n struct parameter_traits< bool >\n : internal::char_pointer_helper\n {\n parameter_traits( const bool v ) noexcept\n : char_pointer_helper( v ? \"TRUE\" : \"FALSE\" )\n {\n }\n };\n\n template<>\n struct parameter_traits< char >\n : internal::string_helper\n {\n parameter_traits( const char v )\n : string_helper( 1, v )\n {\n }\n };\n\n template<>\n struct parameter_traits< signed char >\n : internal::string_helper\n {\n parameter_traits( const signed char v )\n : string_helper( internal::printf( \"%hhd\", v ) )\n {\n }\n };\n\n template<>\n struct parameter_traits< unsigned char >\n : internal::string_helper\n {\n parameter_traits( const unsigned char v )\n : string_helper( internal::printf( \"%hhu\", v ) )\n {\n }\n };\n\n template<>\n struct parameter_traits< short >\n {\n const short m_v;\n\n static_assert( sizeof( short ) == 2 );\n\n parameter_traits( const short v ) noexcept\n : m_v( bswap_16( v ) )\n {\n }\n\n static constexpr std::size_t columns = 1;\n\n template< std::size_t I >\n const char* c_str() const noexcept\n {\n static_assert( I < columns );\n return reinterpret_cast< const char* >( &m_v );\n }\n\n template< std::size_t I >\n constexpr int size() const noexcept\n {\n static_assert( I < columns );\n return sizeof( short );\n }\n\n template< std::size_t I >\n constexpr int format() const noexcept\n {\n static_assert( I < columns );\n return 1;\n }\n };\n\n template<>\n struct parameter_traits< unsigned short >\n : internal::string_helper\n {\n parameter_traits( const unsigned short v )\n : string_helper( internal::printf( \"%hu\", v ) )\n {\n }\n };\n\n template<>\n struct parameter_traits< int >\n {\n const int m_v;\n\n static_assert( sizeof( int ) == 4 );\n\n parameter_traits( const int v ) noexcept\n : m_v( bswap_32( v ) )\n {\n }\n\n static constexpr std::size_t columns = 1;\n\n template< std::size_t I >\n const char* c_str() const noexcept\n {\n static_assert( I < columns );\n return reinterpret_cast< const char* >( &m_v );\n }\n\n template< std::size_t I >\n constexpr int size() const noexcept\n {\n static_assert( I < columns );\n return sizeof( int );\n }\n\n template< std::size_t I >\n constexpr int format() const noexcept\n {\n static_assert( I < columns );\n return 1;\n }\n };\n\n template<>\n struct parameter_traits< unsigned >\n : internal::string_helper\n {\n parameter_traits( const unsigned v )\n : string_helper( internal::printf( \"%u\", v ) )\n {\n }\n };\n\n template<>\n struct parameter_traits< long >\n {\n const long m_v;\n\n static_assert( sizeof( long ) == 8 );\n\n parameter_traits( const long v ) noexcept\n : m_v( bswap_64( v ) )\n {\n }\n\n static constexpr std::size_t columns = 1;\n\n template< std::size_t I >\n const char* c_str() const noexcept\n {\n static_assert( I < columns );\n return reinterpret_cast< const char* >( &m_v );\n }\n\n template< std::size_t I >\n constexpr int size() const noexcept\n {\n static_assert( I < columns );\n return sizeof( long );\n }\n\n template< std::size_t I >\n constexpr int format() const noexcept\n {\n static_assert( I < columns );\n return 1;\n }\n };\n\n template<>\n struct parameter_traits< unsigned long >\n : internal::string_helper\n {\n parameter_traits( const unsigned long v )\n : string_helper( internal::printf( \"%lu\", v ) )\n {\n }\n };\n\n template<>\n struct parameter_traits< long long >\n : internal::string_helper\n {\n parameter_traits( const long long v )\n : string_helper( internal::printf( \"%lld\", v ) )\n {\n }\n };\n\n template<>\n struct parameter_traits< unsigned long long >\n : internal::string_helper\n {\n parameter_traits( const unsigned long long v )\n : string_helper( internal::printf( \"%llu\", v ) )\n {\n }\n };\n\n template<>\n struct parameter_traits< float >\n : parameter_traits< int >\n {\n parameter_traits( const float v ) noexcept\n : parameter_traits< int >( ftoi( v ) )\n {\n }\n };\n\n template<>\n struct parameter_traits< double >\n : parameter_traits< long >\n {\n parameter_traits( const double v )\n : parameter_traits< long >( dtol( v ) )\n {\n }\n };\n\n template<>\n struct parameter_traits< long double >\n : internal::string_helper\n {\n parameter_traits( const long double v )\n : string_helper( internal::printf_helper( \"%.21Lg\", v ) )\n {\n }\n };\n\n template< typename T >\n struct parameter_traits< std::optional< T > >\n {\n private:\n using U = parameter_traits< std::decay_t< T > >;\n std::optional< U > m_forwarder;\n\n public:\n parameter_traits( const std::optional< T >& v )\n {\n if( v ) {\n m_forwarder.emplace( *v );\n }\n }\n\n parameter_traits( std::optional< T >&& v )\n {\n if( v ) {\n m_forwarder.emplace( std::move( *v ) );\n }\n }\n\n static constexpr std::size_t columns = 1;\n static_assert( U::columns == 1 );\n\n template< std::size_t I >\n constexpr const char* c_str() const noexcept\n {\n static_assert( I < columns );\n return m_forwarder ? m_forwarder->template c_str< I >() : nullptr;\n }\n\n template< std::size_t I >\n constexpr int size() const noexcept\n {\n static_assert( I < columns );\n return m_forwarder ? m_forwarder->template size< I >() : 0;\n }\n\n template< std::size_t I >\n constexpr int format() const noexcept\n {\n static_assert( I < columns );\n return m_forwarder ? m_forwarder->template format< I >() : 0;\n }\n };\n\n} \/\/ namespace tao::pq\n\n#endif\n<commit_msg>Use bit_cast<commit_after>\/\/ Copyright (c) 2016-2019 Daniel Frey and Dr. Colin Hirsch\n\/\/ Please see LICENSE for license or visit https:\/\/github.com\/taocpp\/taopq\/\n\n#ifndef TAO_PQ_PARAMETER_TRAITS_HPP\n#define TAO_PQ_PARAMETER_TRAITS_HPP\n\n#include <cmath>\n#include <optional>\n#include <string>\n#include <tuple>\n#include <type_traits>\n#include <utility>\n\n#include <byteswap.h>\n#include <cstring>\n\n#include <tao\/pq\/internal\/printf.hpp>\n#include <tao\/pq\/null.hpp>\n\nnamespace tao::pq\n{\n template< typename, typename = void >\n struct parameter_traits;\n\n namespace internal\n {\n template< typename To, typename From >\n std::enable_if_t< ( sizeof( To ) == sizeof( From ) ) && std::is_trivially_copyable< From >::value && std::is_trivial< To >::value, To >\n bit_cast( const From& src ) noexcept\n {\n To dst;\n std::memcpy( &dst, &src, sizeof( To ) );\n return dst;\n }\n\n class char_pointer_helper\n {\n private:\n const char* m_p;\n\n protected:\n explicit char_pointer_helper( const char* p ) noexcept\n : m_p( p )\n {\n }\n\n public:\n static constexpr std::size_t columns = 1;\n\n template< std::size_t I >\n const char* c_str() const noexcept\n {\n static_assert( I < columns );\n return m_p;\n }\n\n template< std::size_t I >\n constexpr int size() const noexcept\n {\n static_assert( I < columns );\n return 0;\n }\n\n template< std::size_t I >\n constexpr int format() const noexcept\n {\n static_assert( I < columns );\n return 0;\n }\n };\n\n class string_helper\n {\n private:\n std::string m_s;\n\n protected:\n template< typename... Ts >\n explicit string_helper( Ts&&... ts ) noexcept( noexcept( std::string( std::forward< Ts >( ts )... ) ) )\n : m_s( std::forward< Ts >( ts )... )\n {\n }\n\n public:\n static constexpr std::size_t columns = 1;\n\n template< std::size_t I >\n const char* c_str() const noexcept\n {\n static_assert( I < columns );\n return m_s.c_str();\n }\n\n template< std::size_t I >\n constexpr int size() const noexcept\n {\n static_assert( I < columns );\n return 0;\n }\n\n template< std::size_t I >\n constexpr int format() const noexcept\n {\n static_assert( I < columns );\n return 0;\n }\n };\n\n template< typename T >\n [[nodiscard]] std::string printf_helper( const char* format, const T v )\n {\n if( std::isfinite( v ) ) {\n return internal::printf( format, v );\n }\n if( std::isnan( v ) ) {\n return \"NAN\";\n }\n return ( v < 0 ) ? \"-INF\" : \"INF\";\n }\n\n } \/\/ namespace internal\n\n template<>\n struct parameter_traits< null_t >\n {\n explicit parameter_traits( const null_t& ) noexcept\n {\n }\n\n static constexpr std::size_t columns = 1;\n\n template< std::size_t I >\n constexpr const char* c_str() const noexcept\n {\n static_assert( I < columns );\n return nullptr;\n }\n\n template< std::size_t I >\n constexpr int size() const noexcept\n {\n static_assert( I < columns );\n return 0;\n }\n\n template< std::size_t I >\n constexpr int format() const noexcept\n {\n static_assert( I < columns );\n return 0;\n }\n };\n\n template<>\n struct parameter_traits< const char* >\n : internal::char_pointer_helper\n {\n explicit parameter_traits( const char* p ) noexcept\n : char_pointer_helper( p )\n {\n }\n };\n\n template<>\n struct parameter_traits< std::string >\n : internal::char_pointer_helper\n {\n explicit parameter_traits( const std::string& v ) noexcept\n : char_pointer_helper( v.c_str() )\n {\n }\n };\n\n template<>\n struct parameter_traits< bool >\n : internal::char_pointer_helper\n {\n explicit parameter_traits( const bool v ) noexcept\n : char_pointer_helper( v ? \"TRUE\" : \"FALSE\" )\n {\n }\n };\n\n template<>\n struct parameter_traits< char >\n : internal::string_helper\n {\n explicit parameter_traits( const char v )\n : string_helper( 1, v )\n {\n }\n };\n\n template<>\n struct parameter_traits< signed char >\n : internal::string_helper\n {\n explicit parameter_traits( const signed char v )\n : string_helper( internal::printf( \"%hhd\", v ) )\n {\n }\n };\n\n template<>\n struct parameter_traits< unsigned char >\n : internal::string_helper\n {\n explicit parameter_traits( const unsigned char v )\n : string_helper( internal::printf( \"%hhu\", v ) )\n {\n }\n };\n\n template<>\n struct parameter_traits< short >\n {\n const short m_v;\n\n static_assert( sizeof( short ) == 2 );\n\n explicit parameter_traits( const short v ) noexcept\n : m_v( bswap_16( v ) )\n {\n }\n\n static constexpr std::size_t columns = 1;\n\n template< std::size_t I >\n const char* c_str() const noexcept\n {\n static_assert( I < columns );\n return reinterpret_cast< const char* >( &m_v );\n }\n\n template< std::size_t I >\n constexpr int size() const noexcept\n {\n static_assert( I < columns );\n return sizeof( short );\n }\n\n template< std::size_t I >\n constexpr int format() const noexcept\n {\n static_assert( I < columns );\n return 1;\n }\n };\n\n template<>\n struct parameter_traits< unsigned short >\n : internal::string_helper\n {\n explicit parameter_traits( const unsigned short v )\n : string_helper( internal::printf( \"%hu\", v ) )\n {\n }\n };\n\n template<>\n struct parameter_traits< int >\n {\n const int m_v;\n\n static_assert( sizeof( int ) == 4 );\n\n explicit parameter_traits( const int v ) noexcept\n : m_v( bswap_32( v ) )\n {\n }\n\n static constexpr std::size_t columns = 1;\n\n template< std::size_t I >\n const char* c_str() const noexcept\n {\n static_assert( I < columns );\n return reinterpret_cast< const char* >( &m_v );\n }\n\n template< std::size_t I >\n constexpr int size() const noexcept\n {\n static_assert( I < columns );\n return sizeof( int );\n }\n\n template< std::size_t I >\n constexpr int format() const noexcept\n {\n static_assert( I < columns );\n return 1;\n }\n };\n\n template<>\n struct parameter_traits< unsigned >\n : internal::string_helper\n {\n explicit parameter_traits( const unsigned v )\n : string_helper( internal::printf( \"%u\", v ) )\n {\n }\n };\n\n template<>\n struct parameter_traits< long >\n {\n const long m_v;\n\n static_assert( sizeof( long ) == 8 );\n\n explicit parameter_traits( const long v ) noexcept\n : m_v( bswap_64( v ) )\n {\n }\n\n static constexpr std::size_t columns = 1;\n\n template< std::size_t I >\n const char* c_str() const noexcept\n {\n static_assert( I < columns );\n return reinterpret_cast< const char* >( &m_v );\n }\n\n template< std::size_t I >\n constexpr int size() const noexcept\n {\n static_assert( I < columns );\n return sizeof( long );\n }\n\n template< std::size_t I >\n constexpr int format() const noexcept\n {\n static_assert( I < columns );\n return 1;\n }\n };\n\n template<>\n struct parameter_traits< unsigned long >\n : internal::string_helper\n {\n explicit parameter_traits( const unsigned long v )\n : string_helper( internal::printf( \"%lu\", v ) )\n {\n }\n };\n\n template<>\n struct parameter_traits< long long >\n : internal::string_helper\n {\n explicit parameter_traits( const long long v )\n : string_helper( internal::printf( \"%lld\", v ) )\n {\n }\n };\n\n template<>\n struct parameter_traits< unsigned long long >\n : internal::string_helper\n {\n explicit parameter_traits( const unsigned long long v )\n : string_helper( internal::printf( \"%llu\", v ) )\n {\n }\n };\n\n template<>\n struct parameter_traits< float >\n : parameter_traits< int >\n {\n explicit parameter_traits( const float v ) noexcept\n : parameter_traits< int >( internal::bit_cast< int >( v ) )\n {\n }\n };\n\n template<>\n struct parameter_traits< double >\n : parameter_traits< long >\n {\n explicit parameter_traits( const double v )\n : parameter_traits< long >( internal::bit_cast< long >( v ) )\n {\n }\n };\n\n template<>\n struct parameter_traits< long double >\n : internal::string_helper\n {\n explicit parameter_traits( const long double v )\n : string_helper( internal::printf_helper( \"%.21Lg\", v ) )\n {\n }\n };\n\n template< typename T >\n struct parameter_traits< std::optional< T > >\n {\n private:\n using U = parameter_traits< std::decay_t< T > >;\n std::optional< U > m_forwarder;\n\n public:\n explicit parameter_traits( const std::optional< T >& v )\n {\n if( v ) {\n m_forwarder.emplace( *v );\n }\n }\n\n explicit parameter_traits( std::optional< T >&& v )\n {\n if( v ) {\n m_forwarder.emplace( std::move( *v ) );\n }\n }\n\n static constexpr std::size_t columns = 1;\n static_assert( U::columns == 1 );\n\n template< std::size_t I >\n constexpr const char* c_str() const noexcept\n {\n static_assert( I < columns );\n return m_forwarder ? m_forwarder->template c_str< I >() : nullptr;\n }\n\n template< std::size_t I >\n constexpr int size() const noexcept\n {\n static_assert( I < columns );\n return m_forwarder ? m_forwarder->template size< I >() : 0;\n }\n\n template< std::size_t I >\n constexpr int format() const noexcept\n {\n static_assert( I < columns );\n return m_forwarder ? m_forwarder->template format< I >() : 0;\n }\n };\n\n} \/\/ namespace tao::pq\n\n#endif\n<|endoftext|>"} {"text":"<commit_before>#include <iostream>\n#include <string>\n#include <algorithm>\n#include <numeric>\n#include <cstdlib>\n#include <boost\/graph\/adjacency_list.hpp>\n#include <boost\/graph\/strong_components.hpp>\n#include <boost\/graph\/graphviz.hpp>\n#include <boost\/program_options.hpp>\n\n#include \"datastructs\/matrix.h\"\n\n#include \"polynomials\/polynomial.h\"\n#include \"polynomials\/non_commutative_polynomial.h\"\n\n#include \"semirings\/commutativeRExp.h\"\n#include \"semirings\/float-semiring.h\"\n#include \"semirings\/pseudo_linear_set.h\"\n\n#ifdef OLD_SEMILINEAR_SET\n#include \"semirings\/semilinSetExp.h\"\n#else\n#include \"semirings\/semilinear_set.h\"\n#endif\n\n\n#include \"parser.h\"\n\n\/\/#include \"newton.h\"\n#include \"newton_generic.h\"\n\ntemplate <typename SR>\nstruct VertexProp {\n std::string name; \/\/ used for graphviz output\n VarId var; \/\/ var and rex combines the equations in the vertex\n Polynomial<SR> rex;\n};\n\n\/\/ group the equations to SCCs\ntemplate <typename SR>\nstd::vector<std::vector<std::pair<VarId, Polynomial<SR>>>> group_by_scc(std::vector<std::pair<VarId, Polynomial<SR>>> equations, bool graphviz_output)\n{\n \/\/ create map of variables to [0..n]. this is used to enumerate important variables in a clean way from 0 to n during graph construction\n std::map<VarId, int> var_key;\n\n \/\/ build the graph\n boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, VertexProp<SR>> graph(equations.size());\n for(auto e_it = equations.begin(); e_it != equations.end(); ++e_it)\n {\n \/\/ if the variable is not yet in the map insert it together with the size of\n \/\/ the map. this way we get a unique identifier for the variable counting from 0 to n\n if(var_key.find(e_it->first) == var_key.end())\n var_key.insert(var_key.begin(), std::pair<VarId,int>(e_it->first,var_key.size()));\n int a = var_key.find(e_it->first)->second; \/\/ variable key\n graph[a].var = e_it->first; \/\/ store VarId to the vertex\n graph[a].name = Var::GetVar(e_it->first).string(); \/\/ store the name to the vertex\n graph[a].rex = e_it->second; \/\/ store the regular expression to the vertex\n\n auto v = e_it->second.get_variables(); \/\/ all variables of this rule;\n for(auto v_it = v.begin(); v_it != v.end(); ++v_it)\n {\n if(var_key.find(*v_it) == var_key.end()) \/\/ variable is not yet in the map\n var_key.insert(var_key.begin(), std::pair<VarId,int>(*v_it,var_key.size()));\n int b = var_key.find(*v_it)->second; \/\/ variable key\n boost::add_edge(a, b, graph);\n }\n } \/\/ graph is complete\n\n if(graphviz_output)\n {\n \/\/ output the created graph to graph.dot\n boost::dynamic_properties dp;\n dp.property(\"label\", boost::get(&VertexProp<SR>::name, graph)); \/\/ vertex name is the name of the equation\n dp.property(\"node_id\", get(boost::vertex_index, graph)); \/\/ this is needed\n std::ofstream outf(\"graph.dot\");\n boost::write_graphviz_dp(outf, graph, dp);\n }\n\n \/\/ calculate strong connected components and store them in 'component'\n std::vector<int> component(boost::num_vertices(graph));\n boost::strong_components(graph,&component[0]);\n\n \/\/ group neccessary equations together\n int num_comp = *std::max_element(component.begin(), component.end()) + 1; \/\/ find the number of components\n std::vector<std::vector<std::pair<VarId,Polynomial<SR>>>> grouped_equations;\n grouped_equations.resize(num_comp);\n\n \/\/ iterate over all vertices (0 to n)\n \/\/ collect the necessary variables + equations for every component\n for (unsigned int j = 0; j != component.size(); ++j)\n {\n \/\/std::cout << j << \", \" << graph[j].var << \" is in component \" << component[j] << std::endl;\n grouped_equations[component[j]].push_back(std::pair<VarId,Polynomial<SR>>(graph[j].var, graph[j].rex));\n }\n\n return grouped_equations;\n}\n\n\/\/ apply the newton method to the given input\ntemplate <typename SR>\nstd::map<VarId, SR> apply_newton(std::vector<std::pair<VarId, Polynomial<SR>>> equations, bool scc, bool iteration_flag, int iterations, bool graphviz_output)\n{\n \/\/ TODO: sanity checks on the input!\n\n \/\/ generate an instance of the newton solver\n Newton<SR> newton;\n\n \/\/ if we use the scc method, group the equations\n \/\/ the outer vector contains SCCs starting with a bottom SCC at 0\n std::vector<std::vector<std::pair<VarId,Polynomial<SR>>>> equations2;\n if(scc)\n {\n auto tmp = group_by_scc(equations, graphviz_output);\n equations2.insert(equations2.begin(), tmp.begin(), tmp.end());\n }\n else if (!scc)\n {\n equations2.push_back(equations);\n }\n\n \/\/ this holds the solution\n std::map<VarId, SR> solution;\n\n \/\/ the same loop is used for both the scc and the non-scc variant\n \/\/ in the non-scc variant, we just run once through the loop\n \/\/for(auto it1 = equations2.begin(); it != equations2.end(); ++it)\n for(unsigned int j = 0; j != equations2.size(); ++j)\n {\n \/\/ use the solutions to get rid of variables in the remaining equations\n \/\/ does nothing in the first round\n std::vector<std::pair<VarId, Polynomial<SR>>> tmp1;\n for(auto it = equations2[j].begin(); it != equations2[j].end(); ++it)\n { \/\/ it = (VarId, Polynomial[SR])\n auto tmp2 = it->second.partial_eval(solution);\n tmp1.push_back(std::pair<VarId, Polynomial<SR>>(it->first, tmp2));\n }\n \/\/ replace old equations with simplified ones\n equations2[j] = tmp1;\n\n \/\/ dynamic iterations\n if(!iteration_flag)\n \/\/ for commutative and idempotent SRs Newton has converged after n+1 iterations, so use this number as default\n iterations = equations2[j].size() + 1;\n\n \/\/ do some real work here\n std::map<VarId, SR> result = newton.solve_fixpoint(equations2[j], iterations);\n\n \/\/ copy the results into the solution map\n solution.insert(result.begin(), result.end());\n }\n\n return solution;\n}\n\ntemplate <typename SR>\nstd::string result_string(std::map<VarId,SR> result)\n{\n std::stringstream ss;\n for(auto r_it = result.begin(); r_it != result.end(); ++r_it)\n ss << r_it->first << \" == \" << r_it->second << std::endl;\n return ss.str();\n}\n\nint main(int argc, char* argv[])\n{\n namespace po = boost::program_options;\n\n po::options_description desc(\"Allowed options\");\n desc.add_options()\n ( \"scc\", \"apply newton method iteratively to strongly connected components of the equation graph\" )\n ( \"help,h\", \"print this help message\" )\n ( \"iterations,i\", po::value<int>(), \"specify the number of newton iterations. default is optimal number\" )\n \/\/( \"verbose\", \"enable verbose output\" )\n \/\/( \"debug\", \"enable debug output\" )\n ( \"test\", \"just for testing purposes ... explicit test defined in main()\" )\n ( \"file,f\", po::value<std::string>(), \"input file\" )\n ( \"float\", \"float semiring\" )\n ( \"rexp\", \"commutative regular expression semiring\" )\n ( \"slset\", \"explicit semilinear sets semiring (as vectors)\" )\n ( \"free\", \"free semiring\" )\n ( \"pseudolin\", \"abstraction over semilinear sets\" )\n ( \"prefix\", po::value<int>(), \"prefix semiring with given length\")\n ( \"graphviz\", \"create the file graph.dot with the equation graph\" )\n ;\n\n po::variables_map vm;\n po::store(po::parse_command_line(argc, argv, desc), vm);\n po::notify(vm);\n\n if(vm.count(\"test\")) {\n Newton<SemilinSetExp> newton;\n std::vector<VarId> variables;\n variables.push_back(Var::GetVarId(\"x\"));\n std::cout << \"- newton (cnt-SR):\" << std::endl;\n\n std::vector<Polynomial<SemilinSetExp> > polynomials;\n Polynomial<SemilinSetExp> f1 = Polynomial<SemilinSetExp>({\n { SemilinSetExp(Var::GetVarId(\"a\")), Monomial{ {Var::GetVarId(\"x\"),Var::GetVarId(\"x\")} } },\n { SemilinSetExp(Var::GetVarId(\"c\")), Monomial{} } });\n\n polynomials.push_back(f1);\n\n Matrix<SemilinSetExp> result = newton.solve_fixpoint(polynomials, variables, 2);\n std::cout << result << std::endl;\n\n\/* auto s1 = CommutativeRExp(Var::GetVarId(\"a\"));\n auto s2 = CommutativeRExp(Var::GetVarId(\"b\"));\n auto m1 = Matrix<CommutativeRExp>(1,1,{s1});\n auto m2 = Matrix<CommutativeRExp>(1,1,{s2});\n*\/\n\n \/\/ this actually led to a strange bug with the ublas-matrix implementation!!\n\/* auto s1 = SemilinSetExp(Var::GetVarId(\"a\"));\n auto s2 = SemilinSetExp(Var::GetVarId(\"b\"));\n auto m1 = Matrix<SemilinSetExp>(1,1,{s1});\n auto m2 = Matrix<SemilinSetExp>(1,1,{s2});\n\n auto m3 = m1*m2;\n std::cout << m3;\n*\/\n return 0;\n }\n\n if(vm.count(\"help\"))\n {\n std::cout << desc << std::endl;\n return 0;\n }\n\n int iterations=0;\n if(vm.count(\"iterations\"))\n iterations = vm[\"iterations\"].as<int>();\n\n \/\/ check if we can do something useful\n if(!vm.count(\"float\") &&\n !vm.count(\"rexp\") &&\n !vm.count(\"slset\") &&\n !vm.count(\"free\") &&\n !vm.count(\"pseudolin\") &&\n !vm.count(\"prefix\")) \/\/ check for all compatible parameters\n {\n std::cout << \"Please supply a supported semiring :)\" << std::endl;\n return 0;\n }\n\n\n\n std::vector<std::string> input;\n std::string line;\n if(vm.count(\"file\"))\n {\n \/\/ we are reading the input from the given file\n std::ifstream file;\n file.open(vm[\"file\"].as<std::string>(), std::ifstream::in);\n if(file.fail())\n std::cerr << \"Could not open input file: \" << vm[\"file\"].as<std::string>() << std::endl;\n while(std::getline(file, line))\n input.push_back(line);\n }\n else\n {\n \/\/ we are reading from stdin\n while(std::getline(std::cin, line))\n input.push_back(line);\n }\n\n \/\/ join the input into one string\n std::string input_all = std::accumulate(input.begin(), input.end(), std::string(\"\"));\n\n Parser p;\n\n if(vm.count(\"slset\")) {\n std::vector<std::pair<VarId, Polynomial<SemilinSetExp>>> equations(p.slset_parser(input_all));\n if(equations.empty()) return -1;\n\n for (auto eq_it = equations.begin(); eq_it != equations.end(); ++eq_it)\n {\n DMSG(\"* \" << eq_it->first << \" → \" << eq_it->second);\n }\n\n auto result = apply_newton<SemilinSetExp>(equations, vm.count(\"scc\"), vm.count(\"iterations\"), iterations, vm.count(\"graphviz\"));\n std::cout << result_string(result) << std::endl;\n } else if (vm.count(\"pseudolin\")) {\n std::vector<std::pair<VarId, Polynomial<SemilinSetExp>>>\n equations(p.slset_parser(input_all));\n auto pseudo_equations =\n SemilinearToPseudoLinearEquations<\n DummyDivider,\n \/\/ DummySimplifier\n SparseVecSimplifier2>(equations);\n auto pseudo_result = apply_newton(pseudo_equations,\n vm.count(\"scc\"),\n vm.count(\"iterations\"),\n iterations,\n vm.count(\"graphviz\"));\n std::cout << result_string(pseudo_result) << std::endl;\n\n }\n else if(vm.count(\"rexp\")) {\n \/\/ parse the input into a list of (Var → Polynomial[SR])\n std::vector<std::pair<VarId, Polynomial<CommutativeRExp>>> equations(p.rexp_parser(input_all));\n if(equations.empty()) return -1;\n\n for(auto eq_it = equations.begin(); eq_it != equations.end(); ++eq_it)\n {\n std::cout << \"* \" << eq_it->first << \" → \" << eq_it->second << std::endl;\n }\n\n \/\/ apply the newton method to the equations\n auto result = apply_newton<CommutativeRExp>(equations, vm.count(\"scc\"), vm.count(\"iterations\"), iterations, vm.count(\"graphviz\"));\n std::cout << result_string(result) << std::endl;\n }\n else if(vm.count(\"free\")) {\n \/\/ parse the input into a list of (Var → Polynomial[SR])\n std::vector<std::pair<VarId, NonCommutativePolynomial<FreeSemiring>>> equations(p.free_parser(input_all));\n if(equations.empty()) return -1;\n\n for(auto eq_it = equations.begin(); eq_it != equations.end(); ++eq_it)\n {\n std::cout << \"* \" << eq_it->first << \" → \" << eq_it->second << std::endl;\n }\n\n \/\/ apply the newton method to the equations\n \/\/auto result = apply_newton<FreeSemiring>(equations, vm.count(\"scc\"), vm.count(\"iterations\"), iterations, vm.count(\"graphviz\"));\n \/\/std::cout << result_string(result) << std::endl;\n }\n else if(vm.count(\"prefix\")) {\n \/\/ parse the input into a list of (Var → Polynomial[SR])\n std::vector<std::pair<VarId, NonCommutativePolynomial<PrefixSemiring>>> equations(p.prefix_parser(input_all, vm[\"prefix\"].as<int>()));\n if(equations.empty()) return -1;\n\n for(auto eq_it = equations.begin(); eq_it != equations.end(); ++eq_it)\n {\n std::cout << \"* \" << eq_it->first << \" → \" << eq_it->second << std::endl;\n }\n\n \/\/ apply the newton method to the equations\n \/\/auto result = apply_newton<PrefixSemiring>(equations, vm.count(\"scc\"), vm.count(\"iterations\"), iterations, vm.count(\"graphviz\"));\n \/\/std::cout << result_string(result) << std::endl;\n }\n else if(vm.count(\"float\")) {\n std::vector<std::pair<VarId, Polynomial<FloatSemiring>>> equations(p.float_parser(input_all));\n if(equations.empty()) return -1;\n\n for(auto eq_it = equations.begin(); eq_it != equations.end(); ++eq_it)\n {\n std::cout << \"* \" << eq_it->first << \" → \" << eq_it->second << std::endl;\n }\n\n auto result = apply_newton<FloatSemiring>(equations, vm.count(\"scc\"), vm.count(\"iterations\"), iterations, vm.count(\"graphviz\"));\n std::cout << result_string(result) << std::endl;\n }\n\n\n\n return 0;\n}\n<commit_msg>main: major cleanup<commit_after>#include <algorithm>\n#include <cstdlib>\n#include <iostream>\n#include <numeric>\n#include <string>\n\n#include <boost\/graph\/adjacency_list.hpp>\n#include <boost\/graph\/strong_components.hpp>\n#include <boost\/graph\/graphviz.hpp>\n#include <boost\/program_options.hpp>\n\n#include \"datastructs\/matrix.h\"\n\n#include \"polynomials\/polynomial.h\"\n#include \"polynomials\/non_commutative_polynomial.h\"\n\n#include \"semirings\/commutativeRExp.h\"\n#include \"semirings\/float-semiring.h\"\n#include \"semirings\/pseudo_linear_set.h\"\n\n#ifdef OLD_SEMILINEAR_SET\n#include \"semirings\/semilinSetExp.h\"\n#else\n#include \"semirings\/semilinear_set.h\"\n#endif\n\n\n#include \"parser.h\"\n\n\/\/#include \"newton.h\"\n#include \"newton_generic.h\"\n\ntemplate <typename SR>\nstruct VertexProp {\n std::string name; \/\/ used for graphviz output\n VarId var; \/\/ var and rex combines the equations in the vertex\n Polynomial<SR> rex;\n};\n\n\/\/ group the equations to SCCs\ntemplate <typename SR>\nstd::vector< std::vector< std::pair< VarId, Polynomial<SR> > > >\ngroup_by_scc(const std::vector< std::pair< VarId, Polynomial<SR> > > &equations,\n bool graphviz_output) {\n \/\/ create map of variables to [0..n]. this is used to enumerate important variables in a clean way from 0 to n during graph construction\n std::map<VarId, int> var_key;\n\n \/\/ build the graph\n boost::adjacency_list<boost::vecS,\n boost::vecS,\n boost::bidirectionalS,\n VertexProp<SR>> graph(equations.size());\n \/\/ for (auto e_it = equations.begin(); e_it != equations.end(); ++e_it)\n for (const auto &eq : equations) {\n \/\/ if the variable is not yet in the map insert it together with the size of\n \/\/ the map. this way we get a unique identifier for the variable counting from 0 to n\n if (var_key.find(eq.first) == var_key.end()) {\n var_key.insert(std::make_pair(eq.first, var_key.size()));\n }\n int a = var_key.find(eq.first)->second; \/\/ variable key\n graph[a].var = eq.first; \/\/ store VarId to the vertex\n graph[a].name = Var::GetVar(eq.first).string(); \/\/ store the name to the vertex\n graph[a].rex = eq.second; \/\/ store the regular expression to the vertex\n\n auto variables = eq.second.get_variables(); \/\/ all variables of this rule;\n \/\/ for (auto v_it = v.begin(); v_it != v.end(); ++v_it)\n for (const auto &var : variables) {\n if (var_key.find(var) == var_key.end()) \/\/ variable is not yet in the map\n var_key.insert(var_key.begin(), std::pair<VarId,int>(var,var_key.size()));\n int b = var_key.find(var)->second; \/\/ variable key\n boost::add_edge(a, b, graph);\n }\n } \/\/ graph is complete\n\n if (graphviz_output) {\n \/\/ output the created graph to graph.dot\n boost::dynamic_properties dp;\n dp.property(\"label\", boost::get(&VertexProp<SR>::name, graph)); \/\/ vertex name is the name of the equation\n dp.property(\"node_id\", get(boost::vertex_index, graph)); \/\/ this is needed\n std::ofstream outf(\"graph.dot\");\n boost::write_graphviz_dp(outf, graph, dp);\n }\n\n \/\/ calculate strong connected components and store them in 'component'\n std::vector<int> component(boost::num_vertices(graph));\n boost::strong_components(graph,&component[0]);\n\n \/\/ group neccessary equations together\n int num_comp = *std::max_element(component.begin(), component.end()) + 1; \/\/ find the number of components\n std::vector< std::vector< std::pair< VarId,Polynomial<SR> > > >\n grouped_equations(num_comp);\n \/\/ grouped_equations.resize(num_comp);\n\n \/\/ iterate over all vertices (0 to n)\n \/\/ collect the necessary variables + equations for every component\n for (std::size_t j = 0; j != component.size(); ++j) {\n \/\/std::cout << j << \", \" << graph[j].var << \" is in component \" << component[j] << std::endl;\n grouped_equations[component[j]].push_back(std::pair<VarId,Polynomial<SR>>(graph[j].var, graph[j].rex));\n }\n\n return grouped_equations;\n}\n\n\/\/ apply the newton method to the given input\ntemplate <typename SR>\nstd::map<VarId, SR> apply_newton(\n const std::vector< std::pair< VarId, Polynomial<SR> > > &equations,\n bool scc, bool iteration_flag, std::size_t iterations, bool graphviz_output) {\n\n \/\/ TODO: sanity checks on the input!\n\n \/\/ generate an instance of the newton solver\n Newton<SR> newton;\n\n \/\/ if we use the scc method, group the equations\n \/\/ the outer vector contains SCCs starting with a bottom SCC at 0\n std::vector< std::vector< std::pair< VarId,Polynomial<SR> > > > equations2;\n if (scc) {\n auto tmp = group_by_scc(equations, graphviz_output);\n equations2.insert(equations2.begin(), tmp.begin(), tmp.end());\n }\n else if (!scc) {\n equations2.push_back(equations);\n }\n\n \/\/ this holds the solution\n std::map<VarId, SR> solution;\n\n \/\/ the same loop is used for both the scc and the non-scc variant\n \/\/ in the non-scc variant, we just run once through the loop\n \/\/for (auto it1 = equations2.begin(); it != equations2.end(); ++it)\n for (std::size_t j = 0; j != equations2.size(); ++j) {\n \/\/ use the solutions to get rid of variables in the remaining equations\n \/\/ does nothing in the first round\n std::vector<std::pair<VarId, Polynomial<SR>>> tmp1;\n for (auto it = equations2[j].begin(); it != equations2[j].end(); ++it)\n { \/\/ it = (VarId, Polynomial[SR])\n auto tmp2 = it->second.partial_eval(solution);\n tmp1.push_back(std::pair<VarId, Polynomial<SR>>(it->first, tmp2));\n }\n \/\/ replace old equations with simplified ones\n equations2[j] = tmp1;\n\n \/\/ dynamic iterations\n if (!iteration_flag) {\n \/\/ for commutative and idempotent SRs Newton has converged after n+1 iterations, so use this number as default\n iterations = equations2[j].size() + 1;\n }\n\n \/\/ do some real work here\n std::map<VarId, SR> result = newton.solve_fixpoint(equations2[j], iterations);\n\n \/\/ copy the results into the solution map\n solution.insert(result.begin(), result.end());\n }\n\n return solution;\n}\n\ntemplate <typename SR>\nstd::string result_string(const std::map<VarId, SR> &result) {\n std::stringstream ss;\n for (auto r_it = result.begin(); r_it != result.end(); ++r_it) {\n ss << r_it->first << \" == \" << r_it->second << std::endl;\n }\n return ss.str();\n}\n\ntemplate <typename Container>\nvoid PrintEquations(const Container &equations) {\n std::cout << \"Equations:\" << std::endl;\n for (auto &eq : equations) {\n std::cout << \"* \" << eq.first << \" → \" << eq.second << std::endl;\n }\n}\n\nint main(int argc, char* argv[]) {\n\n namespace po = boost::program_options;\n\n po::options_description desc(\"Allowed options\");\n desc.add_options()\n ( \"scc\", \"apply newton method iteratively to strongly connected components of the equation graph\" )\n ( \"help,h\", \"print this help message\" )\n ( \"iterations,i\", po::value<int>(), \"specify the number of newton iterations. default is optimal number\" )\n \/\/( \"verbose\", \"enable verbose output\" )\n \/\/( \"debug\", \"enable debug output\" )\n ( \"test\", \"just for testing purposes ... explicit test defined in main()\" )\n ( \"file,f\", po::value<std::string>(), \"input file\" )\n ( \"float\", \"float semiring\" )\n ( \"rexp\", \"commutative regular expression semiring\" )\n ( \"slset\", \"explicit semilinear sets semiring (as vectors)\" )\n ( \"free\", \"free semiring\" )\n ( \"pseudolin\", \"abstraction over semilinear sets\" )\n ( \"prefix\", po::value<int>(), \"prefix semiring with given length\")\n ( \"graphviz\", \"create the file graph.dot with the equation graph\" )\n ;\n\n po::variables_map vm;\n po::store(po::parse_command_line(argc, argv, desc), vm);\n po::notify(vm);\n\n if (vm.count(\"test\")) {\n Newton<SemilinSetExp> newton;\n std::vector<VarId> variables;\n variables.push_back(Var::GetVarId(\"x\"));\n std::cout << \"- newton (cnt-SR):\" << std::endl;\n\n std::vector<Polynomial<SemilinSetExp> > polynomials;\n Polynomial<SemilinSetExp> f1 = Polynomial<SemilinSetExp>({\n { SemilinSetExp(Var::GetVarId(\"a\")), Monomial{ {Var::GetVarId(\"x\"),Var::GetVarId(\"x\")} } },\n { SemilinSetExp(Var::GetVarId(\"c\")), Monomial{} } });\n\n polynomials.push_back(f1);\n\n Matrix<SemilinSetExp> result = newton.solve_fixpoint(polynomials, variables, 2);\n std::cout << result << std::endl;\n\n \/* auto s1 = CommutativeRExp(Var::GetVarId(\"a\"));\n auto s2 = CommutativeRExp(Var::GetVarId(\"b\"));\n auto m1 = Matrix<CommutativeRExp>(1,1,{s1});\n auto m2 = Matrix<CommutativeRExp>(1,1,{s2});\n *\/\n\n \/\/ this actually led to a strange bug with the ublas-matrix implementation!!\n \/* auto s1 = SemilinSetExp(Var::GetVarId(\"a\"));\n auto s2 = SemilinSetExp(Var::GetVarId(\"b\"));\n auto m1 = Matrix<SemilinSetExp>(1,1,{s1});\n auto m2 = Matrix<SemilinSetExp>(1,1,{s2});\n\n auto m3 = m1*m2;\n std::cout << m3;\n *\/\n return 0;\n }\n\n if (vm.count(\"help\")) {\n std::cout << desc << std::endl;\n return 0;\n }\n\n int iterations=0;\n if (vm.count(\"iterations\"))\n iterations = vm[\"iterations\"].as<int>();\n\n \/\/ check if we can do something useful\n if (!vm.count(\"float\") &&\n !vm.count(\"rexp\") &&\n !vm.count(\"slset\") &&\n !vm.count(\"free\") &&\n !vm.count(\"pseudolin\") &&\n !vm.count(\"prefix\")) {\n std::cout << \"Please supply a supported semiring :)\" << std::endl;\n return 0;\n }\n\n\n\n std::vector<std::string> input;\n std::string line;\n if (vm.count(\"file\")) {\n \/\/ we are reading the input from the given file\n std::ifstream file;\n file.open(vm[\"file\"].as<std::string>(), std::ifstream::in);\n if (file.fail()) {\n std::cerr << \"Could not open input file: \" << vm[\"file\"].as<std::string>() << std::endl;\n }\n while (std::getline(file, line)) {\n input.push_back(line);\n }\n } else {\n \/\/ we are reading from stdin\n while (std::getline(std::cin, line)) {\n input.push_back(line);\n }\n }\n\n \/\/ join the input into one string\n std::string input_all =\n std::accumulate(input.begin(), input.end(), std::string(\"\"));\n\n Parser p;\n\n if (vm.count(\"slset\")) {\n\n auto equations = p.slset_parser(input_all);\n if (equations.empty()) return EXIT_FAILURE;\n\n PrintEquations(equations);\n\n auto result = apply_newton<SemilinSetExp>(equations,\n vm.count(\"scc\"),\n vm.count(\"iterations\"),\n iterations,\n vm.count(\"graphviz\"));\n std::cout << result_string(result) << std::endl;\n\n } else if (vm.count(\"pseudolin\")) {\n\n auto equations = p.slset_parser(input_all);\n auto pseudo_equations =\n SemilinearToPseudoLinearEquations<\n DummyDivider,\n \/\/ DummySimplifier\n SparseVecSimplifier2>(equations);\n\n PrintEquations(pseudo_equations);\n\n auto pseudo_result = apply_newton(pseudo_equations,\n vm.count(\"scc\"),\n vm.count(\"iterations\"),\n iterations,\n vm.count(\"graphviz\"));\n std::cout << result_string(pseudo_result) << std::endl;\n\n } else if (vm.count(\"rexp\")) {\n\n \/\/ parse the input into a list of (Var → Polynomial[SR])\n auto equations = p.rexp_parser(input_all);\n if (equations.empty()) return EXIT_FAILURE;\n\n PrintEquations(equations);\n\n \/\/ apply the newton method to the equations\n auto result = apply_newton<CommutativeRExp>(equations,\n vm.count(\"scc\"),\n vm.count(\"iterations\"),\n iterations,\n vm.count(\"graphviz\"));\n std::cout << result_string(result) << std::endl;\n\n } else if (vm.count(\"free\")) {\n\n \/\/ parse the input into a list of (Var → Polynomial[SR])\n auto equations = p.free_parser(input_all);\n if (equations.empty()) return EXIT_FAILURE;\n\n PrintEquations(equations);\n\n \/\/ apply the newton method to the equations\n \/\/auto result = apply_newton<FreeSemiring>(equations,\n \/\/ vm.count(\"scc\"),\n \/\/ vm.count(\"iterations\"),\n \/\/ iterations,\n \/\/ vm.count(\"graphviz\"));\n \/\/std::cout << result_string(result) << std::endl;\n\n } else if (vm.count(\"prefix\")) {\n\n \/\/ parse the input into a list of (Var → Polynomial[SR])\n auto equations = p.prefix_parser(input_all, vm[\"prefix\"].as<int>());\n if (equations.empty()) return EXIT_FAILURE;\n\n PrintEquations(equations);\n\n \/\/ apply the newton method to the equations\n \/\/auto result = apply_newton<PrefixSemiring>(equations,\n \/\/ vm.count(\"scc\"),\n \/\/ vm.count(\"iterations\"),\n \/\/ iterations,\n \/\/ vm.count(\"graphviz\"));\n \/\/std::cout << result_string(result) << std::endl;\n\n } else if (vm.count(\"float\")) {\n\n auto equations = p.float_parser(input_all);\n if (equations.empty()) return EXIT_FAILURE;\n\n PrintEquations(equations);\n\n auto result = apply_newton<FloatSemiring>(equations,\n vm.count(\"scc\"),\n vm.count(\"iterations\"),\n iterations,\n vm.count(\"graphviz\"));\n std::cout << result_string(result) << std::endl;\n }\n\n\n\n return EXIT_SUCCESS;\n}\n<|endoftext|>"} {"text":"<commit_before>\/\/ Copyright (c) 2011 The Chromium Authors. All rights reserved.\n\/\/ Use of this source code is governed by a BSD-style license that can be\n\/\/ found in the LICENSE file.\n\n#include \"webkit\/media\/audio_decoder.h\"\n\n#include <vector>\n#include \"base\/basictypes.h\"\n#include \"base\/string_util.h\"\n#include \"base\/time.h\"\n#include \"media\/base\/limits.h\"\n#include \"media\/filters\/audio_file_reader.h\"\n#include \"media\/filters\/in_memory_url_protocol.h\"\n#include \"third_party\/WebKit\/Source\/WebKit\/chromium\/public\/platform\/WebAudioBus.h\"\n\nusing media::AudioFileReader;\nusing media::InMemoryUrlProtocol;\nusing std::vector;\nusing WebKit::WebAudioBus;\n\nnamespace webkit_media {\n\n\/\/ Decode in-memory audio file data.\nbool DecodeAudioFileData(\n WebKit::WebAudioBus* destination_bus,\n const char* data, size_t data_size, double sample_rate) {\n DCHECK(destination_bus);\n if (!destination_bus)\n return false;\n\n \/\/ Uses the FFmpeg library for audio file reading.\n InMemoryUrlProtocol url_protocol(reinterpret_cast<const uint8*>(data),\n data_size, false);\n AudioFileReader reader(&url_protocol);\n\n if (!reader.Open())\n return false;\n\n size_t number_of_channels = reader.channels();\n double file_sample_rate = reader.sample_rate();\n double duration = reader.duration().InSecondsF();\n size_t number_of_frames = static_cast<size_t>(reader.number_of_frames());\n\n \/\/ Apply sanity checks to make sure crazy values aren't coming out of\n \/\/ FFmpeg.\n if (!number_of_channels ||\n number_of_channels > static_cast<size_t>(media::limits::kMaxChannels) ||\n file_sample_rate < media::limits::kMinSampleRate ||\n file_sample_rate > media::limits::kMaxSampleRate)\n return false;\n\n \/\/ TODO(crogers) : do sample-rate conversion with FFmpeg.\n \/\/ For now, we're ignoring the requested 'sample_rate' and returning\n \/\/ the WebAudioBus at the file's sample-rate.\n \/\/ double destination_sample_rate =\n \/\/ (sample_rate != 0.0) ? sample_rate : file_sample_rate;\n double destination_sample_rate = file_sample_rate;\n\n DLOG(INFO) << \"Decoding file data -\"\n << \" data: \" << data\n << \" data size: \" << data_size\n << \" duration: \" << duration\n << \" number of frames: \" << number_of_frames\n << \" sample rate: \" << file_sample_rate\n << \" number of channels: \" << number_of_channels;\n\n \/\/ Change to destination sample-rate.\n number_of_frames = static_cast<size_t>(number_of_frames *\n (destination_sample_rate \/ file_sample_rate));\n\n \/\/ Allocate and configure the output audio channel data.\n destination_bus->initialize(number_of_channels,\n number_of_frames,\n destination_sample_rate);\n\n \/\/ Wrap the channel pointers which will receive the decoded PCM audio.\n vector<float*> audio_data;\n audio_data.reserve(number_of_channels);\n for (size_t i = 0; i < number_of_channels; ++i) {\n audio_data.push_back(destination_bus->channelData(i));\n }\n\n \/\/ Decode the audio file data.\n return reader.Read(audio_data, number_of_frames);\n}\n\n} \/\/ namespace webkit_media\n<commit_msg>Reduce log level to DVLOG(1) in webkit_media::AudioDecoder.<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\/media\/audio_decoder.h\"\n\n#include <vector>\n#include \"base\/basictypes.h\"\n#include \"base\/string_util.h\"\n#include \"base\/time.h\"\n#include \"media\/base\/limits.h\"\n#include \"media\/filters\/audio_file_reader.h\"\n#include \"media\/filters\/in_memory_url_protocol.h\"\n#include \"third_party\/WebKit\/Source\/WebKit\/chromium\/public\/platform\/WebAudioBus.h\"\n\nusing media::AudioFileReader;\nusing media::InMemoryUrlProtocol;\nusing std::vector;\nusing WebKit::WebAudioBus;\n\nnamespace webkit_media {\n\n\/\/ Decode in-memory audio file data.\nbool DecodeAudioFileData(\n WebKit::WebAudioBus* destination_bus,\n const char* data, size_t data_size, double sample_rate) {\n DCHECK(destination_bus);\n if (!destination_bus)\n return false;\n\n \/\/ Uses the FFmpeg library for audio file reading.\n InMemoryUrlProtocol url_protocol(reinterpret_cast<const uint8*>(data),\n data_size, false);\n AudioFileReader reader(&url_protocol);\n\n if (!reader.Open())\n return false;\n\n size_t number_of_channels = reader.channels();\n double file_sample_rate = reader.sample_rate();\n double duration = reader.duration().InSecondsF();\n size_t number_of_frames = static_cast<size_t>(reader.number_of_frames());\n\n \/\/ Apply sanity checks to make sure crazy values aren't coming out of\n \/\/ FFmpeg.\n if (!number_of_channels ||\n number_of_channels > static_cast<size_t>(media::limits::kMaxChannels) ||\n file_sample_rate < media::limits::kMinSampleRate ||\n file_sample_rate > media::limits::kMaxSampleRate)\n return false;\n\n \/\/ TODO(crogers) : do sample-rate conversion with FFmpeg.\n \/\/ For now, we're ignoring the requested 'sample_rate' and returning\n \/\/ the WebAudioBus at the file's sample-rate.\n \/\/ double destination_sample_rate =\n \/\/ (sample_rate != 0.0) ? sample_rate : file_sample_rate;\n double destination_sample_rate = file_sample_rate;\n\n DVLOG(1) << \"Decoding file data -\"\n << \" data: \" << data\n << \" data size: \" << data_size\n << \" duration: \" << duration\n << \" number of frames: \" << number_of_frames\n << \" sample rate: \" << file_sample_rate\n << \" number of channels: \" << number_of_channels;\n\n \/\/ Change to destination sample-rate.\n number_of_frames = static_cast<size_t>(number_of_frames *\n (destination_sample_rate \/ file_sample_rate));\n\n \/\/ Allocate and configure the output audio channel data.\n destination_bus->initialize(number_of_channels,\n number_of_frames,\n destination_sample_rate);\n\n \/\/ Wrap the channel pointers which will receive the decoded PCM audio.\n vector<float*> audio_data;\n audio_data.reserve(number_of_channels);\n for (size_t i = 0; i < number_of_channels; ++i) {\n audio_data.push_back(destination_bus->channelData(i));\n }\n\n \/\/ Decode the audio file data.\n return reader.Read(audio_data, number_of_frames);\n}\n\n} \/\/ namespace webkit_media\n<|endoftext|>"} {"text":"<commit_before>#include <cstdio>\n#include <cstdlib>\n#include <unistd.h>\n#include <string>\n#include <string.h>\n#include <csignal>\n#include <netinet\/in.h>\n#include <sys\/socket.h>\n#include <sys\/types.h> \n#include <sys\/wait.h>\n#include <dirent.h>\n#include <fcntl.h>\n#include <errno.h>\n#include <functional>\n#include <unordered_map>\n#include <algorithm>\n#include <iostream>\n#include <sstream>\n\n#if defined(__APPLE__) || defined(__GNUC__) && __GNUC__ * 10 + __GNUC_MINOR__ >= 49\n#include <regex>\n#endif\n\n#include <cassert>\n#include <vector>\n#include <fstream>\n#include <future>\n\n#include <ctime>\n\n#define BUF_SIZE 4096\n#define MAX_LISTEN 128\n\nnamespace Cappuccino{\n\n\tclass Request;\n\tclass Response;\n\n\tstruct {\n\n\t\ttime_t time;\n \t\tstruct tm *t_st;\n\n\t\tint port = 1204;\n\t\tint sockfd = 0;\n\t\tint sessionfd = 0;\n\t fd_set mask1fds, mask2fds;\n\n\t\tstd::shared_ptr<std::string> view_root;\n\t\tstd::shared_ptr<std::string> static_root;\n\n\t\tstd::unordered_map<std::string,\n\t\t\tstd::function<Response(std::shared_ptr<Request>)>\n\t\t> routes;\n\n\t} context;\n\n\tnamespace Log{\n\n\t\tstd::string current(){\n\t\t\tchar timestr[256];\n \t\t\ttime(&context.time);\n\t\t\tstrftime(timestr, 255, \"%Y-%m-%d %H:%M:%S %Z\", localtime(&context.time));\t\n\t\t\treturn timestr;\n\t\t}\n\n\n\t\tstatic int LogLevel = 0;\n\t\tstatic void debug(std::string msg){\n\t\t\tif(LogLevel >= 1){\n\t\t\t\tstd::cout <<current()<<\" \"<< msg << std::endl;\n\t\t\t}\n\t\t}\n\n\t\tstatic void info(std::string msg){\n\t\t\tif(LogLevel >= 2){\n\t\t\t\tstd::cout <<current()<<\" \"<< msg << std::endl;\n\t\t\t}\n\t\t}\n\t};\n\n\tnamespace signal_utils{\n\n\t\tvoid signal_handler(int signal){\n\t\t\tclose(context.sessionfd);\n\t\t\tclose(context.sockfd);\n\t\t\texit(0);\n\t\t}\n\n\t\tvoid signal_handler_child(int SignalName){\n\t\t\twhile(waitpid(-1,NULL,WNOHANG)>0){}\n\t signal(SIGCHLD, signal_utils::signal_handler_child);\n\t\t}\n\n\t\tvoid init_signal(){\n\t\t\tif(signal(SIGINT, signal_utils::signal_handler) == SIG_ERR){\n\t\t\t\texit(1);\n\t\t\t}\n\t\t\tif(signal(SIGCHLD, signal_utils::signal_handler_child) == SIG_ERR){\n\t\t\t\texit(1);\n\t\t\t}\n\t\t}\n\t}\n\n\tnamespace utils{\n\t\tstd::vector<std::string> split(const std::string& str, std::string delim) noexcept{\n\t\t\tstd::vector<std::string> result;\n\t\t std::string::size_type pos = 0;\n\t\t while(pos != std::string::npos ){\n\t\t std::string::size_type p = str.find(delim, pos);\n\t\t if(p == std::string::npos){\n\t\t result.push_back(str.substr(pos));\n\t\t break;\n\t\t }else{\n\t\t result.push_back(str.substr(pos, p - pos));\n\t\t }\n\t\t pos = p + delim.size();\n\t\t }\n\t\t return result;\n\t\t}\n\t};\n\n\tvoid init_socket(){\n\t struct sockaddr_in server;\n\t\tif((context.sockfd = socket(AF_INET, SOCK_STREAM, 0)) < 0){\n\t\t\texit(EXIT_FAILURE);\n\t\t}\n\t\tmemset( &server, 0, sizeof(server));\n\t\tserver.sin_family = AF_INET;\t\n\t\tserver.sin_addr.s_addr = INADDR_ANY;\n\t\tserver.sin_port = htons(context.port);\n\n\t\tchar opt = 1;\n\t\tsetsockopt(context.sockfd, SOL_SOCKET, SO_REUSEADDR, (char *)&opt, sizeof(char));\n\n\t\tint temp = 1;\n \t\tif(setsockopt(context.sockfd, SOL_SOCKET, SO_REUSEADDR,\n\t &temp, sizeof(int))){\n\t\t}\n\t\t\n\t\tif (bind(context.sockfd, (struct sockaddr *) &server, sizeof(server)) < 0) {\n\t\t\texit(EXIT_FAILURE);\n\t\t}\n\n\t\tif(listen(context.sockfd, MAX_LISTEN) < 0) {\n\t\t\texit(EXIT_FAILURE);\n\t\t}\n\n\t FD_ZERO(&context.mask1fds);\n\t FD_SET(context.sockfd, &context.mask1fds);\n\t}\n\n\tusing namespace std;\n\n\n\tpair<string,string> openFile(string aFilename){\n\t\tauto filename = aFilename;\n\t\tstd::ifstream ifs( filename, std::ios::in | std::ios::binary);\n\t\tif(ifs.fail()){\t\t\n\t\t\tthrow std::runtime_error(\"No such file or directory \\\"\"+ filename +\"\\\"\\n\");\n\t\t}\n\t\tifs.seekg( 0, std::ios::end);\n\t\tauto pos = ifs.tellg();\n\t\tifs.seekg( 0, std::ios::beg);\n\n\t\tstd::vector<char> buf(pos);\n\t\tifs.read(buf.data(), pos);\n\t\tstring response(buf.cbegin(), buf.cend());\n\n\t\tif( response[0] == '\\xFF' && response[1] == '\\xD8'){\n\t\t\treturn make_pair(response, \"image\/jpg\");\n\t\t}else if( response[0] == '\\x89' && response[1] == 'P' && response[2] == 'N' && response[3] == 'G'){\n\t\t\treturn make_pair(response, \"image\/png\");\n\t\t}else if( response[0] == 'G' && response[1] == 'I' && response[2] == 'F' && response[3] == '8' && (response[4] == '7' || response[4] == '9') && response[2] == 'a'){\n\t\t\treturn make_pair(response, \"image\/gif\");\n\t\t}else{\n\t\t\treturn make_pair(response, \"text\/html\");\n\t\t}\n\t}\n\n\tvoid option(int argc, char *argv[]) noexcept{\n\t\tchar result;\n\t\twhile((result = getopt(argc,argv,\"dp:\")) != -1){\n\t\t\tswitch(result){\n\t\t\tcase 'd':\n\t\t\t\tLog::LogLevel = 1;\t\n\t\t\t\tbreak;\n\t\t\tcase 'p':\n\t\t\t\tcontext.port = atoi(optarg);\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t}\n\n\tclass Request{\n\t\tunordered_map<string, string> headerset;\n\t\tunordered_map<string, string> paramset;\n\t public:\n\t\tRequest(string method, string url,string protocol):\n\t\tmethod(move(method)),\n\t\turl(move(url)),\n\t\tprotocol(move(protocol))\n\t\t{}\n\n\t\tconst string method;\n\t\tconst string url;\n\t\tconst string protocol;\n\n\t\tvoid addHeader(string key,string value){\n\t\t\theaderset[key] = move(value);\n\t\t}\n\n\t\tvoid addParams(string key,string value){\n\t\t\tparamset[key] = move(value);\n\t\t}\n\n\t\tstring header(string key){\n\t\t\tif(headerset.find(key) == headerset.end())\n\t\t\t\treturn \"INVALID\";\n\t\t\treturn headerset[key];\n\t\t}\n\n\t\tstring params(string key){\n\t\t\tif(paramset.find(key) == paramset.end())\n\t\t\t\treturn \"INVALID\";\n\t\t\treturn paramset[key];\n\t\t}\n\t};\n\n class Response{\n\n\t\tunordered_map<string, string> headerset;\n\n\t\tint status_;\n\t\tstring message_;\n\t\tstring url_;\n\t\tstring body_;\n\t\tstring protocol_;\n public:\n\n\t\tResponse(weak_ptr<Request> req){\n\t\t\tauto r = req.lock();\n\t\t\tif(r){\n\t\t\t\turl_ = r->url;\n\t\t\t\tprotocol_ = r->protocol;\n\t\t\t}else{\n\t\t\t\tthrow std::runtime_error(\"Request expired!\\n\");\n\t\t\t}\n\t\t}\n\n\t\tResponse(int st,string msg,string pro, string bod):\n\t\t\tstatus_(st),\n\t\t\tmessage_(msg),\n\t\t\tbody_(bod),\n\t\t\tprotocol_(pro)\n\t\t{}\n\n\t\tResponse* message(string msg){\n\t\t\tmessage_ = msg;\n\t\t\treturn this;\n\t\t}\n\n\t\tResponse* status(int st){\n\t\t\tstatus_ = st;\n\t\t\treturn this;\n\t\t}\n\n\t\tResponse* file(string filename){\n\t\t\tauto file = openFile(*context.view_root + \"\/\" + filename);\n\t\t\tbody_ = file.first;\n\t\t\theaderset[\"Content-type\"] = move(file.second);\n\t\t\treturn this;\n\t\t}\n\n \toperator string(){\n \t\treturn protocol_ + \" \" + to_string(status_) +\" \"+ message_ + \"\\n\\n\" + body_;\n \t}\n };\n\n\tstring createResponse(char* req) noexcept{\n\t\tauto lines = utils::split(string(req), \"\\n\");\n\t\tif(lines.empty())\n\t\t\treturn Response(400, \"Bad Request\", \"HTTP\/1.1\", \"NN\");\n \n\t\tauto tops = utils::split(lines[0], \" \");\n\t\tif(tops.size() < 3)\n\t\t\treturn Response(401, \"Bad Request\", \"HTTP\/1.1\", \"NN\");\n\n\t\tLog::debug(tops[0] +\" \"+ tops[1] +\" \"+ tops[2]);\n\n\t\tauto request = shared_ptr<Request>(new Request(tops[0],tops[1],tops[2]));\n\n\t\tif(context.routes.find(tops[1]) != context.routes.end()){\n\t\t\treturn context.routes[tops[1]](move(request));\n\t\t}\n\n\t\treturn Response( 404,\"Not found\", tops[2], \"AA\");\n\t}\n\n\tstring receiveProcess(int sessionfd){\n\t\tchar buf[BUF_SIZE] = {};\n\n\t\tif (recv(sessionfd, buf, sizeof(buf), 0) < 0) {\n\t\t\texit(EXIT_FAILURE);\n\t\t}\n\t\tdo{\n\t\t\tif(strstr(buf, \"\\r\\n\")){\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\tif (strlen(buf) >= sizeof(buf)) {\n\t\t\t\tmemset(&buf, 0, sizeof(buf));\n\t\t\t}\n\t\t}while(read(sessionfd, buf+strlen(buf), sizeof(buf) - strlen(buf)) > 0);\n\t\treturn createResponse(buf);\t\n\t}\n\t\n\n\tvoid load(string directory, string filename) noexcept{\n\t\tif(filename == \".\" || filename == \"..\") return;\n\t\tif(filename!=\"\")\n\t\t\tdirectory += \"\/\" + filename;\n\t\tDIR* dir = opendir(directory.c_str());\n\t\tif(dir != NULL){\n\t\t\tstruct dirent* dent;\n\t dent = readdir(dir);\n\t\t while(dent!=NULL){\n\t\t dent = readdir(dir);\n\t\t if(dent!=NULL)\n\t\t\t load(directory, string(dent->d_name));\n\t\t }\n\t\t closedir(dir);\n\t\t\tdelete dent;\n\t\t\tdelete dir;\n\t\t}else{\n\t\t\tLog::debug(\"add \"+directory);\n\t\t\tcontext.routes.insert( make_pair(\n\t\t\t\t\"\/\" + directory, \n\t\t\t\t[directory,filename](std::shared_ptr<Request> request) -> Cappuccino::Response{\n\t\t\t\t\treturn Response(200,\"OK\",\"HTTP\/1.1\",openFile(directory).first);\n\t\t\t\t}\n\t\t\t));\t\t\t\n\t\t}\n\t}\n\n\tvoid loadStaticFiles() noexcept{\n\t\tload(*context.static_root,\"\");\n\t}\n\n\tvoid route(string url,std::function<Response(std::shared_ptr<Request>)> F){\n\t\tcontext.routes.insert( make_pair( move(url), move(F) ));\n\t}\n\n\tvoid root(string r){\n\t\tcontext.view_root = make_shared<string>(move(r));\n\t}\n\t\n\tvoid resource(string s){\n\t\tcontext.static_root = make_shared<string>(move(s));\n\t}\n\n\tvoid run(){\n\n\t\tinit_socket();\n\t\tsignal_utils::init_signal();\n\t\tloadStaticFiles();\n\n\t int cd[FD_SETSIZE];\n\t\tstruct sockaddr_in client;\n int fd;\n struct timeval tv;\n\n\t for(int i = 0;i < FD_SETSIZE; i++){\n\t cd[i] = 0;\n\t }\n\n\t\tint I = 0;\n\t while(1) {\n\t\n\t\t\tif(I>5){\n\t\t\t\treturn;\n\t\t\t}\t\n\t\t\t\n\n\t tv.tv_sec = 0;\n\t tv.tv_usec = 0;\n\n\t memcpy(&context.mask2fds, &context.mask1fds, sizeof(context.mask1fds));\n\n\t int select_result = select(FD_SETSIZE, &context.mask2fds, (fd_set *)0, (fd_set *)0, &tv);\n\t if(select_result < 1) {\n\t for(fd = 0; fd < FD_SETSIZE; fd++) {\n\t if(cd[fd] == 1) {\n\t close(fd);\n\t FD_CLR(fd, &context.mask1fds);\n\t cd[fd] = 0;\n\t }\n\t }\n\t continue;\n\t }\n\t\t\tfor(fd = 0; fd < FD_SETSIZE; fd++){\n\t if(FD_ISSET(fd,&context.mask2fds)) {\n\t if(fd == context.sockfd) {\n\t \tmemset( &client, 0, sizeof(client));\n\t\t\t\t\t\tint len = sizeof(client);\n\t int clientfd = accept(context.sockfd, \n\t (struct sockaddr *)&client,(socklen_t *) &len);\n\t FD_SET(clientfd, &context.mask1fds);\n\t }else {\n\t if(cd[fd] == 1) {\n\t close(fd);\n\t FD_CLR(fd, &context.mask1fds);\n\t cd[fd] = 0;\n\t } else {\n\t\t\t\t\t\t\tstring response = receiveProcess(fd);\n\t\t\t\t\t\t\twrite(fd, response.c_str(), response.size());\n\t cd[fd] = 1;\n\n\t\t\t\t\t\t\tI++;\n\t\n\t }\n\t }\n\t }\n\t }\n\t }\t \n\t}\n\n\tvoid Cappuccino(int argc, char *argv[]) {\n\t\toption(argc, argv);\n\t\tcontext.view_root = make_shared<string>(\"\");\n\t\tcontext.static_root = make_shared<string>(\"public\");\n\t}\n};\n\nnamespace Cocoa{\n\tusing namespace Cappuccino;\n\tusing namespace std;\n\n\t\/\/ Unit Test\t\n\tvoid testOpenFile(){\n\t\tauto res = openFile(\"html\/index.html\");\n\t\tauto lines = utils::split(res.first, \"\\n\");\n\t\tassert(!lines.empty());\n\t}\n\n\tvoid testOpenInvalidFile(){\n\t\ttry{\n\t\t\tauto res = openFile(\"html\/index\");\n\t\t}catch(std::runtime_error e){\n\t\t\tcout<< e.what() << endl;\n\t\t}\n\t}\n};\n\n<commit_msg>[Add] print version<commit_after>#include <cstdio>\n#include <cstdlib>\n#include <unistd.h>\n#include <string>\n#include <string.h>\n#include <csignal>\n#include <netinet\/in.h>\n#include <sys\/socket.h>\n#include <sys\/types.h> \n#include <sys\/wait.h>\n#include <dirent.h>\n#include <fcntl.h>\n#include <errno.h>\n#include <functional>\n#include <unordered_map>\n#include <algorithm>\n#include <iostream>\n#include <sstream>\n\n#if defined(__APPLE__) || defined(__GNUC__) && __GNUC__ * 10 + __GNUC_MINOR__ >= 49\n#include <regex>\n#endif\n\n#include <cassert>\n#include <vector>\n#include <fstream>\n#include <future>\n\n#include <ctime>\n\n#define BUF_SIZE 4096\n#define MAX_LISTEN 128\n\nnamespace Cappuccino{\n\n\tclass Request;\n\tclass Response;\n\n\tstruct {\n\n\t\ttime_t time;\n \t\tstruct tm *t_st;\n\n\t\tint port = 1204;\n\t\tint sockfd = 0;\n\t\tint sessionfd = 0;\n\t fd_set mask1fds, mask2fds;\n\n\t\tstd::shared_ptr<std::string> view_root;\n\t\tstd::shared_ptr<std::string> static_root;\n\n\t\tstd::unordered_map<std::string,\n\t\t\tstd::function<Response(std::shared_ptr<Request>)>\n\t\t> routes;\n\n\t} context;\n\n\tnamespace Log{\n\n\t\tstd::string current(){\n\t\t\tchar timestr[256];\n \t\t\ttime(&context.time);\n\t\t\tstrftime(timestr, 255, \"%Y-%m-%d %H:%M:%S %Z\", localtime(&context.time));\t\n\t\t\treturn timestr;\n\t\t}\n\n\n\t\tstatic int LogLevel = 0;\n\t\tstatic void debug(std::string msg){\n\t\t\tif(LogLevel >= 1){\n\t\t\t\tstd::cout <<current()<<\" \"<< msg << std::endl;\n\t\t\t}\n\t\t}\n\n\t\tstatic void info(std::string msg){\n\t\t\tif(LogLevel >= 2){\n\t\t\t\tstd::cout <<current()<<\" \"<< msg << std::endl;\n\t\t\t}\n\t\t}\n\t};\n\n\tnamespace signal_utils{\n\n\t\tvoid signal_handler(int signal){\n\t\t\tclose(context.sessionfd);\n\t\t\tclose(context.sockfd);\n\t\t\texit(0);\n\t\t}\n\n\t\tvoid signal_handler_child(int SignalName){\n\t\t\twhile(waitpid(-1,NULL,WNOHANG)>0){}\n\t signal(SIGCHLD, signal_utils::signal_handler_child);\n\t\t}\n\n\t\tvoid init_signal(){\n\t\t\tif(signal(SIGINT, signal_utils::signal_handler) == SIG_ERR){\n\t\t\t\texit(1);\n\t\t\t}\n\t\t\tif(signal(SIGCHLD, signal_utils::signal_handler_child) == SIG_ERR){\n\t\t\t\texit(1);\n\t\t\t}\n\t\t}\n\t}\n\n\tnamespace utils{\n\t\tstd::vector<std::string> split(const std::string& str, std::string delim) noexcept{\n\t\t\tstd::vector<std::string> result;\n\t\t std::string::size_type pos = 0;\n\t\t while(pos != std::string::npos ){\n\t\t std::string::size_type p = str.find(delim, pos);\n\t\t if(p == std::string::npos){\n\t\t result.push_back(str.substr(pos));\n\t\t break;\n\t\t }else{\n\t\t result.push_back(str.substr(pos, p - pos));\n\t\t }\n\t\t pos = p + delim.size();\n\t\t }\n\t\t return result;\n\t\t}\n\t};\n\n\tvoid init_socket(){\n\t struct sockaddr_in server;\n\t\tif((context.sockfd = socket(AF_INET, SOCK_STREAM, 0)) < 0){\n\t\t\texit(EXIT_FAILURE);\n\t\t}\n\t\tmemset( &server, 0, sizeof(server));\n\t\tserver.sin_family = AF_INET;\t\n\t\tserver.sin_addr.s_addr = INADDR_ANY;\n\t\tserver.sin_port = htons(context.port);\n\n\t\tchar opt = 1;\n\t\tsetsockopt(context.sockfd, SOL_SOCKET, SO_REUSEADDR, (char *)&opt, sizeof(char));\n\n\t\tint temp = 1;\n \t\tif(setsockopt(context.sockfd, SOL_SOCKET, SO_REUSEADDR,\n\t &temp, sizeof(int))){\n\t\t}\n\t\t\n\t\tif (bind(context.sockfd, (struct sockaddr *) &server, sizeof(server)) < 0) {\n\t\t\texit(EXIT_FAILURE);\n\t\t}\n\n\t\tif(listen(context.sockfd, MAX_LISTEN) < 0) {\n\t\t\texit(EXIT_FAILURE);\n\t\t}\n\n\t FD_ZERO(&context.mask1fds);\n\t FD_SET(context.sockfd, &context.mask1fds);\n\t}\n\n\tusing namespace std;\n\n\n\tpair<string,string> openFile(string aFilename){\n\t\tauto filename = aFilename;\n\t\tstd::ifstream ifs( filename, std::ios::in | std::ios::binary);\n\t\tif(ifs.fail()){\t\t\n\t\t\tthrow std::runtime_error(\"No such file or directory \\\"\"+ filename +\"\\\"\\n\");\n\t\t}\n\t\tifs.seekg( 0, std::ios::end);\n\t\tauto pos = ifs.tellg();\n\t\tifs.seekg( 0, std::ios::beg);\n\n\t\tstd::vector<char> buf(pos);\n\t\tifs.read(buf.data(), pos);\n\t\tstring response(buf.cbegin(), buf.cend());\n\n\t\tif( response[0] == '\\xFF' && response[1] == '\\xD8'){\n\t\t\treturn make_pair(response, \"image\/jpg\");\n\t\t}else if( response[0] == '\\x89' && response[1] == 'P' && response[2] == 'N' && response[3] == 'G'){\n\t\t\treturn make_pair(response, \"image\/png\");\n\t\t}else if( response[0] == 'G' && response[1] == 'I' && response[2] == 'F' && response[3] == '8' && (response[4] == '7' || response[4] == '9') && response[2] == 'a'){\n\t\t\treturn make_pair(response, \"image\/gif\");\n\t\t}else{\n\t\t\treturn make_pair(response, \"text\/html\");\n\t\t}\n\t}\n\n\tvoid option(int argc, char *argv[]) noexcept{\n\t\tchar result;\n\t\twhile((result = getopt(argc,argv,\"dvp:\")) != -1){\n\t\t\tswitch(result){\n\t\t\tcase 'd':\n\t\t\t\tLog::LogLevel = 1;\t\n\t\t\t\tbreak;\n\t\t\tcase 'p':\n\t\t\t\tcontext.port = atoi(optarg);\n\t\t\t\tbreak;\n\t\t\tcase 'v':\n\t\t\t\tLog::info(\"version 0.0.3\");\n\t\t\t\texit(0);\n\t\t\t}\n\t\t}\n\t}\n\n\tclass Request{\n\t\tunordered_map<string, string> headerset;\n\t\tunordered_map<string, string> paramset;\n\t public:\n\t\tRequest(string method, string url,string protocol):\n\t\tmethod(move(method)),\n\t\turl(move(url)),\n\t\tprotocol(move(protocol))\n\t\t{}\n\n\t\tconst string method;\n\t\tconst string url;\n\t\tconst string protocol;\n\n\t\tvoid addHeader(string key,string value){\n\t\t\theaderset[key] = move(value);\n\t\t}\n\n\t\tvoid addParams(string key,string value){\n\t\t\tparamset[key] = move(value);\n\t\t}\n\n\t\tstring header(string key){\n\t\t\tif(headerset.find(key) == headerset.end())\n\t\t\t\treturn \"INVALID\";\n\t\t\treturn headerset[key];\n\t\t}\n\n\t\tstring params(string key){\n\t\t\tif(paramset.find(key) == paramset.end())\n\t\t\t\treturn \"INVALID\";\n\t\t\treturn paramset[key];\n\t\t}\n\t};\n\n class Response{\n\n\t\tunordered_map<string, string> headerset;\n\n\t\tint status_;\n\t\tstring message_;\n\t\tstring url_;\n\t\tstring body_;\n\t\tstring protocol_;\n public:\n\n\t\tResponse(weak_ptr<Request> req){\n\t\t\tauto r = req.lock();\n\t\t\tif(r){\n\t\t\t\turl_ = r->url;\n\t\t\t\tprotocol_ = r->protocol;\n\t\t\t}else{\n\t\t\t\tthrow std::runtime_error(\"Request expired!\\n\");\n\t\t\t}\n\t\t}\n\n\t\tResponse(int st,string msg,string pro, string bod):\n\t\t\tstatus_(st),\n\t\t\tmessage_(msg),\n\t\t\tbody_(bod),\n\t\t\tprotocol_(pro)\n\t\t{}\n\n\t\tResponse* message(string msg){\n\t\t\tmessage_ = msg;\n\t\t\treturn this;\n\t\t}\n\n\t\tResponse* status(int st){\n\t\t\tstatus_ = st;\n\t\t\treturn this;\n\t\t}\n\n\t\tResponse* file(string filename){\n\t\t\tauto file = openFile(*context.view_root + \"\/\" + filename);\n\t\t\tbody_ = file.first;\n\t\t\theaderset[\"Content-type\"] = move(file.second);\n\t\t\treturn this;\n\t\t}\n\n \toperator string(){\n \t\treturn protocol_ + \" \" + to_string(status_) +\" \"+ message_ + \"\\n\\n\" + body_;\n \t}\n };\n\n\tstring createResponse(char* req) noexcept{\n\t\tauto lines = utils::split(string(req), \"\\n\");\n\t\tif(lines.empty())\n\t\t\treturn Response(400, \"Bad Request\", \"HTTP\/1.1\", \"NN\");\n \n\t\tauto tops = utils::split(lines[0], \" \");\n\t\tif(tops.size() < 3)\n\t\t\treturn Response(401, \"Bad Request\", \"HTTP\/1.1\", \"NN\");\n\n\t\tLog::debug(tops[0] +\" \"+ tops[1] +\" \"+ tops[2]);\n\n\t\tauto request = shared_ptr<Request>(new Request(tops[0],tops[1],tops[2]));\n\n\t\tif(context.routes.find(tops[1]) != context.routes.end()){\n\t\t\treturn context.routes[tops[1]](move(request));\n\t\t}\n\n\t\treturn Response( 404,\"Not found\", tops[2], \"AA\");\n\t}\n\n\tstring receiveProcess(int sessionfd){\n\t\tchar buf[BUF_SIZE] = {};\n\n\t\tif (recv(sessionfd, buf, sizeof(buf), 0) < 0) {\n\t\t\texit(EXIT_FAILURE);\n\t\t}\n\t\tdo{\n\t\t\tif(strstr(buf, \"\\r\\n\")){\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\tif (strlen(buf) >= sizeof(buf)) {\n\t\t\t\tmemset(&buf, 0, sizeof(buf));\n\t\t\t}\n\t\t}while(read(sessionfd, buf+strlen(buf), sizeof(buf) - strlen(buf)) > 0);\n\t\treturn createResponse(buf);\t\n\t}\n\t\n\n\tvoid load(string directory, string filename) noexcept{\n\t\tif(filename == \".\" || filename == \"..\") return;\n\t\tif(filename!=\"\")\n\t\t\tdirectory += \"\/\" + filename;\n\t\tDIR* dir = opendir(directory.c_str());\n\t\tif(dir != NULL){\n\t\t\tstruct dirent* dent;\n\t dent = readdir(dir);\n\t\t while(dent!=NULL){\n\t\t dent = readdir(dir);\n\t\t if(dent!=NULL)\n\t\t\t load(directory, string(dent->d_name));\n\t\t }\n\t\t closedir(dir);\n\t\t\tdelete dent;\n\t\t\tdelete dir;\n\t\t}else{\n\t\t\tLog::debug(\"add \"+directory);\n\t\t\tcontext.routes.insert( make_pair(\n\t\t\t\t\"\/\" + directory, \n\t\t\t\t[directory,filename](std::shared_ptr<Request> request) -> Cappuccino::Response{\n\t\t\t\t\treturn Response(200,\"OK\",\"HTTP\/1.1\",openFile(directory).first);\n\t\t\t\t}\n\t\t\t));\t\t\t\n\t\t}\n\t}\n\n\tvoid loadStaticFiles() noexcept{\n\t\tload(*context.static_root,\"\");\n\t}\n\n\tvoid route(string url,std::function<Response(std::shared_ptr<Request>)> F){\n\t\tcontext.routes.insert( make_pair( move(url), move(F) ));\n\t}\n\n\tvoid root(string r){\n\t\tcontext.view_root = make_shared<string>(move(r));\n\t}\n\t\n\tvoid resource(string s){\n\t\tcontext.static_root = make_shared<string>(move(s));\n\t}\n\n\tvoid run(){\n\n\t\tinit_socket();\n\t\tsignal_utils::init_signal();\n\t\tloadStaticFiles();\n\n\t int cd[FD_SETSIZE];\n\t\tstruct sockaddr_in client;\n int fd;\n struct timeval tv;\n\n\t for(int i = 0;i < FD_SETSIZE; i++){\n\t cd[i] = 0;\n\t }\n\n\t\tint I = 0;\n\t while(1) {\n\t\n\t\t\tif(I>5){\n\t\t\t\treturn;\n\t\t\t}\t\n\t\t\t\n\n\t tv.tv_sec = 0;\n\t tv.tv_usec = 0;\n\n\t memcpy(&context.mask2fds, &context.mask1fds, sizeof(context.mask1fds));\n\n\t int select_result = select(FD_SETSIZE, &context.mask2fds, (fd_set *)0, (fd_set *)0, &tv);\n\t if(select_result < 1) {\n\t for(fd = 0; fd < FD_SETSIZE; fd++) {\n\t if(cd[fd] == 1) {\n\t close(fd);\n\t FD_CLR(fd, &context.mask1fds);\n\t cd[fd] = 0;\n\t }\n\t }\n\t continue;\n\t }\n\t\t\tfor(fd = 0; fd < FD_SETSIZE; fd++){\n\t if(FD_ISSET(fd,&context.mask2fds)) {\n\t if(fd == context.sockfd) {\n\t \tmemset( &client, 0, sizeof(client));\n\t\t\t\t\t\tint len = sizeof(client);\n\t int clientfd = accept(context.sockfd, \n\t (struct sockaddr *)&client,(socklen_t *) &len);\n\t FD_SET(clientfd, &context.mask1fds);\n\t }else {\n\t if(cd[fd] == 1) {\n\t close(fd);\n\t FD_CLR(fd, &context.mask1fds);\n\t cd[fd] = 0;\n\t } else {\n\t\t\t\t\t\t\tstring response = receiveProcess(fd);\n\t\t\t\t\t\t\twrite(fd, response.c_str(), response.size());\n\t cd[fd] = 1;\n\n\t\t\t\t\t\t\tI++;\n\t\n\t }\n\t }\n\t }\n\t }\n\t }\t \n\t}\n\n\tvoid Cappuccino(int argc, char *argv[]) {\n\t\toption(argc, argv);\n\t\tcontext.view_root = make_shared<string>(\"\");\n\t\tcontext.static_root = make_shared<string>(\"public\");\n\t}\n};\n\nnamespace Cocoa{\n\tusing namespace Cappuccino;\n\tusing namespace std;\n\n\t\/\/ Unit Test\t\n\tvoid testOpenFile(){\n\t\tauto res = openFile(\"html\/index.html\");\n\t\tauto lines = utils::split(res.first, \"\\n\");\n\t\tassert(!lines.empty());\n\t}\n\n\tvoid testOpenInvalidFile(){\n\t\ttry{\n\t\t\tauto res = openFile(\"html\/index\");\n\t\t}catch(std::runtime_error e){\n\t\t\tcout<< e.what() << endl;\n\t\t}\n\t}\n};\n\n<|endoftext|>"} {"text":"<commit_before>#include <stdio.h>\n#include <stdlib.h>\n#include <unistd.h>\n#include <string.h>\n#include <signal.h>\n#include <netinet\/in.h>\n#include <sys\/socket.h>\n#include <sys\/types.h> \n#include <sys\/wait.h>\n#include <dirent.h>\n#include <fcntl.h>\n#include <errno.h>\n#include <string>\n#include <functional>\n#include <unordered_map>\n#include <list>\n#include <algorithm>\n#include <iostream>\n#include <sstream>\n#include <map>\n\n#if defined(__APPLE__) || defined(__GNUC__) && __GNUC__ * 10 + __GNUC_MINOR__ >= 49\n#include <regex>\n#endif\n\n#include <vector>\n#include <fstream>\n#include <future>\n\n#define BUF_SIZE 4096\n#define MAX_LISTEN 128\n\nnamespace Cappuccino{\n\t\n\tnamespace Log{\n\t\tstatic void debug(std::string msg){\n\t\t\tstd::cout << msg << std::endl;\n\t\t}\n\n\t\tstatic void info(std::string msg){\n\t\t\tstd::cout << msg << std::endl;\n\t\t}\n\t};\n\n\tclass Request;\n\tclass Response;\n\n\tstruct {\n\t\tint port = 1204;\n\t\tint sockfd = 0;\n\t\tint sessionfd = 0;\n\t fd_set mask1fds, mask2fds;\n\n\t\tstd::shared_ptr<std::string> view_root;\n\t\tstd::shared_ptr<std::string> static_root;\n\n\t\tstd::map<std::string,\n\t\t\tstd::function<\n\t\t\t\tstd::unique_ptr<Response>(std::unique_ptr<Request>)\n\t\t\t>\n\t\t> routes;\n\t} context;\n\n\tnamespace signal_utils{\n\n\t\tvoid signal_handler(int signal){\n\t\t\tclose(context.sessionfd);\n\t\t\tclose(context.sockfd);\n\t\t\texit(0);\n\t\t}\n\n\t\tvoid signal_handler_child(int SignalName){\n\t\t\twhile(waitpid(-1,NULL,WNOHANG)>0){}\n\t signal(SIGCHLD, signal_utils::signal_handler_child);\n\t\t}\n\n\t\tvoid init_signal(){\n\t\t\tif(signal(SIGINT, signal_utils::signal_handler) == SIG_ERR){\n\t\t\t\texit(1);\n\t\t\t}\n\t\t\tif(signal(SIGCHLD, signal_utils::signal_handler_child) == SIG_ERR){\n\t\t\t\texit(1);\n\t\t\t}\n\t\t}\n\t}\n\n\tnamespace utils{\n\t\tstd::vector<std::string> split(const std::string& str, std::string delim) noexcept{\n\t\t\tstd::vector<std::string> result;\n\t\t std::string::size_type pos = 0;\n\t\t while(pos != std::string::npos ){\n\t\t std::string::size_type p = str.find(delim, pos);\n\t\t if(p == std::string::npos){\n\t\t result.push_back(str.substr(pos));\n\t\t break;\n\t\t }else{\n\t\t result.push_back(str.substr(pos, p - pos));\n\t\t }\n\t\t pos = p + delim.size();\n\t\t }\n\t\t return result;\n\t\t}\n\t};\n\n\tvoid init_socket(){\n\t struct sockaddr_in server;\n\t\tif((context.sockfd = socket(AF_INET, SOCK_STREAM, 0)) < 0){\n\t\t\texit(EXIT_FAILURE);\n\t\t}\n\t\tmemset( &server, 0, sizeof(server));\n\t\tserver.sin_family = AF_INET;\t\n\t\tserver.sin_addr.s_addr = INADDR_ANY;\n\t\tserver.sin_port = htons(context.port);\n\n\t\tchar opt = 1;\n\t\tsetsockopt(context.sockfd, SOL_SOCKET, SO_REUSEADDR, (char *)&opt, sizeof(char));\n\n\t\tint temp = 1;\n \t\tif(setsockopt(context.sockfd, SOL_SOCKET, SO_REUSEADDR,\n\t &temp, sizeof(int))){\n\t\t}\n\t\t\n\t\tif (bind(context.sockfd, (struct sockaddr *) &server, sizeof(server)) < 0) {\n\t\t\texit(EXIT_FAILURE);\n\t\t}\n\n\t\tif(listen(context.sockfd, MAX_LISTEN) < 0) {\n\t\t\texit(EXIT_FAILURE);\n\t\t}\n\n\t FD_ZERO(&context.mask1fds);\n\t FD_SET(context.sockfd, &context.mask1fds);\n\t}\n\n\tusing namespace std;\n\tusing string = string;\n\n\tvoid option(int argc, char *argv[]) noexcept{\n\t\tchar result;\n\t\twhile((result = getopt(argc,argv,\"dp:\")) != -1){\n\t\t\tswitch(result){\n\t\t\tcase 'd':\n\t\t\t\tbreak;\n\t\t\tcase 'p':\n\t\t\t\tcontext.port = atoi(optarg);\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t}\n\n\tclass Request{\n\n\t};\n\n class Response{\n\t\tint status;\n\t\tstring message;\n public:\n\t\tResponse(int st,string msg){\n\t\t\tstatus = st;\n\t\t\tmessage = msg;\n\t\t}\n\t\n\n\t\tResponse(string msg){\n\t\t\tmessage = msg;\n\t\t}\n\n \toperator string(){\n \t\treturn to_string(status) + \" \/ \" + message;\n \t}\n };\n\n\tResponse create_response(char* req) noexcept{\n\t\tauto lines = utils::split(string(req), \"\\n\");\n\t\tif(lines.empty())\n\t\t\treturn Response(400, \"Bad Request\");\n \n\t\tcout << lines[0] << endl;\n\n\t\treturn Response( 200, \"OK\");\n\t}\n\n\tstring receive_process(int sessionfd){\n\t\tchar buf[BUF_SIZE] = {};\n\t\tchar method[BUF_SIZE] = {};\n\t\tchar url[BUF_SIZE] = {};\n\t\tchar protocol[BUF_SIZE] = {};\n\n\t\tif (recv(sessionfd, buf, sizeof(buf), 0) < 0) {\n\t\t\texit(EXIT_FAILURE);\n\t\t}\n\t\tdo{\n\t\t\tif(strstr(buf, \"\\r\\n\")){\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\tif (strlen(buf) >= sizeof(buf)) {\n\t\t\t\tmemset(&buf, 0, sizeof(buf));\n\t\t\t}\n\t\t}while(read(sessionfd, buf+strlen(buf), sizeof(buf) - strlen(buf)) > 0);\n\t\treturn create_response(buf);\t\n\t}\n\t\n\tstring openFile(string filename){\n\t\t\n\t}\n\n\ttime_t client_info[FD_SETSIZE];\n\n\tvoid load(string directory, string filename) noexcept{\n\t\tif(filename == \".\" || filename == \"..\") return;\n\t\tif(filename!=\"\")\n\t\t\tdirectory += \"\/\" + filename;\n\t\tDIR* dir = opendir(directory.c_str());\n\t\tif(dir != NULL){\n\t\t\tstruct dirent* dent;\n\t dent = readdir(dir);\n\t\t while(dent!=NULL){\n\t\t dent = readdir(dir);\n\t\t if(dent!=NULL)\n\t\t\t load(directory, string(dent->d_name));\n\t\t }\n\t\t closedir(dir);\n\t\t}else{\n\/\/\t\t\tauto static_file = Cappuccino::FileLoader(directory);\n\/\/\t\t\tstatic_file.preload();\n\t\t\tcontext.routes.insert( make_pair(\n\t\t\t\tdirectory +\"\/\" + filename, \n\t\t\t\t[directory,filename](std::unique_ptr<Request> request) -> std::unique_ptr<Cappuccino::Response>{\n\t\t\t\t\treturn unique_ptr<Cappuccino::Response>(new Cappuccino::Response(openFile(directory +\"\/\" + filename)));\n\t\t\t\t}\n\t\t\t));\t\t\t\n\t\t}\n\t}\n\n\tvoid load_static_files() noexcept{\n\t\tload(*context.static_root,\"\");\n\t}\n\n\tvoid run(){\n\n\t\tcontext.view_root = make_shared<string>(\"\");\t\t\n\t\tcontext.static_root = make_shared<string>(\"public\");\n\n\t\tinit_socket();\n\t\tsignal_utils::init_signal();\n\t\tload_static_files();\n\n\n\t int cd[FD_SETSIZE];\n\t\tstruct sockaddr_in client;\n int fd;\n struct timeval tv;\n\n\t for(int i = 0;i < FD_SETSIZE; i++){\n\t cd[i] = 0;\n\t }\n\n\t while(1) {\n\t tv.tv_sec = 0;\n\t tv.tv_usec = 0;\n\n\t memcpy(&context.mask2fds, &context.mask1fds, sizeof(context.mask1fds));\n\n\t int select_result = select(FD_SETSIZE, &context.mask2fds, (fd_set *)0, (fd_set *)0, &tv);\n\t if(select_result < 1) {\n\t for(fd = 0; fd < FD_SETSIZE; fd++) {\n\t if(cd[fd] == 1) {\n\t close(fd);\n\t FD_CLR(fd, &context.mask1fds);\n\t cd[fd] = 0;\n\t }\n\t }\n\t continue;\n\t }\n\t for(fd = 0; fd < FD_SETSIZE; fd++){\n\t if(FD_ISSET(fd,&context.mask2fds)) {\n\t if(fd == context.sockfd) {\n\t \tmemset( &client, 0, sizeof(client));\n\t\t\t\t\t\tint len = sizeof(client);\n\t int clientfd = accept(context.sockfd, (struct sockaddr *)&client,(socklen_t *) &len);\n FD_SET(clientfd, &context.mask1fds);\n\t }else {\n\t if(cd[fd] == 1) {\n\t close(fd);\n\t FD_CLR(fd, &context.mask1fds);\n\t cd[fd] = 0;\n\t } else {\n\t\t\t\t\t\t\tstring response = receive_process(fd);\n\t\t\t\t\t\t\twrite(fd, response.c_str(), response.size());\n\t cd[fd] = 1;\n\t }\n\t }\n\t }\n\t }\n\t }\t \n\t}\n\n\tvoid Cappuccino(int argc, char *argv[]) {\n\t\toption(argc, argv);\n\t}\n};\n\nnamespace Cocoa{\n\tclass App{};\n};\n\n<commit_msg>[Write] Request<commit_after>#include <stdio.h>\n#include <stdlib.h>\n#include <unistd.h>\n#include <string.h>\n#include <signal.h>\n#include <netinet\/in.h>\n#include <sys\/socket.h>\n#include <sys\/types.h> \n#include <sys\/wait.h>\n#include <dirent.h>\n#include <fcntl.h>\n#include <errno.h>\n#include <string>\n#include <functional>\n#include <unordered_map>\n#include <list>\n#include <algorithm>\n#include <iostream>\n#include <sstream>\n#include <map>\n\n#if defined(__APPLE__) || defined(__GNUC__) && __GNUC__ * 10 + __GNUC_MINOR__ >= 49\n#include <regex>\n#endif\n\n#include <vector>\n#include <fstream>\n#include <future>\n\n#define BUF_SIZE 4096\n#define MAX_LISTEN 128\n\nnamespace Cappuccino{\n\t\n\tnamespace Log{\n\t\tstatic void debug(std::string msg){\n\t\t\tstd::cout << msg << std::endl;\n\t\t}\n\n\t\tstatic void info(std::string msg){\n\t\t\tstd::cout << msg << std::endl;\n\t\t}\n\t};\n\n\tclass Request;\n\tclass Response;\n\n\tstruct {\n\t\tint port = 1204;\n\t\tint sockfd = 0;\n\t\tint sessionfd = 0;\n\t fd_set mask1fds, mask2fds;\n\n\t\tstd::shared_ptr<std::string> view_root;\n\t\tstd::shared_ptr<std::string> static_root;\n\n\t\tstd::map<std::string,\n\t\t\tstd::function<\n\t\t\t\tstd::unique_ptr<Response>(std::unique_ptr<Request>)\n\t\t\t>\n\t\t> routes;\n\t} context;\n\n\tnamespace signal_utils{\n\n\t\tvoid signal_handler(int signal){\n\t\t\tclose(context.sessionfd);\n\t\t\tclose(context.sockfd);\n\t\t\texit(0);\n\t\t}\n\n\t\tvoid signal_handler_child(int SignalName){\n\t\t\twhile(waitpid(-1,NULL,WNOHANG)>0){}\n\t signal(SIGCHLD, signal_utils::signal_handler_child);\n\t\t}\n\n\t\tvoid init_signal(){\n\t\t\tif(signal(SIGINT, signal_utils::signal_handler) == SIG_ERR){\n\t\t\t\texit(1);\n\t\t\t}\n\t\t\tif(signal(SIGCHLD, signal_utils::signal_handler_child) == SIG_ERR){\n\t\t\t\texit(1);\n\t\t\t}\n\t\t}\n\t}\n\n\tnamespace utils{\n\t\tstd::vector<std::string> split(const std::string& str, std::string delim) noexcept{\n\t\t\tstd::vector<std::string> result;\n\t\t std::string::size_type pos = 0;\n\t\t while(pos != std::string::npos ){\n\t\t std::string::size_type p = str.find(delim, pos);\n\t\t if(p == std::string::npos){\n\t\t result.push_back(str.substr(pos));\n\t\t break;\n\t\t }else{\n\t\t result.push_back(str.substr(pos, p - pos));\n\t\t }\n\t\t pos = p + delim.size();\n\t\t }\n\t\t return result;\n\t\t}\n\t};\n\n\tvoid init_socket(){\n\t struct sockaddr_in server;\n\t\tif((context.sockfd = socket(AF_INET, SOCK_STREAM, 0)) < 0){\n\t\t\texit(EXIT_FAILURE);\n\t\t}\n\t\tmemset( &server, 0, sizeof(server));\n\t\tserver.sin_family = AF_INET;\t\n\t\tserver.sin_addr.s_addr = INADDR_ANY;\n\t\tserver.sin_port = htons(context.port);\n\n\t\tchar opt = 1;\n\t\tsetsockopt(context.sockfd, SOL_SOCKET, SO_REUSEADDR, (char *)&opt, sizeof(char));\n\n\t\tint temp = 1;\n \t\tif(setsockopt(context.sockfd, SOL_SOCKET, SO_REUSEADDR,\n\t &temp, sizeof(int))){\n\t\t}\n\t\t\n\t\tif (bind(context.sockfd, (struct sockaddr *) &server, sizeof(server)) < 0) {\n\t\t\texit(EXIT_FAILURE);\n\t\t}\n\n\t\tif(listen(context.sockfd, MAX_LISTEN) < 0) {\n\t\t\texit(EXIT_FAILURE);\n\t\t}\n\n\t FD_ZERO(&context.mask1fds);\n\t FD_SET(context.sockfd, &context.mask1fds);\n\t}\n\n\tusing namespace std;\n\n\tvoid option(int argc, char *argv[]) noexcept{\n\t\tchar result;\n\t\twhile((result = getopt(argc,argv,\"dp:\")) != -1){\n\t\t\tswitch(result){\n\t\t\tcase 'd':\n\t\t\t\tbreak;\n\t\t\tcase 'p':\n\t\t\t\tcontext.port = atoi(optarg);\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t}\n\n\tclass Request{\n\t\tmap<string, string> headerset;\n\t\tmap<string, string> paramset;\n\t public:\n\t\tRequest(string method, string url,string protocol):\n\t\tmethod(method),\n\t\turl(url),\n\t\tprotocol(protocol)\n\t\t{}\n\n\t\tconst string method;\n\t\tconst string url;\n\t\tconst string protocol;\n\n\t\tvoid addHeader(string key,string value){\n\t\t\theaderset[key] = value;\n\t\t}\n\n\t\tvoid addParams(string key,string value){\n\t\t\tparamset[key] = value;\n\t\t}\n\n\t\tstring header(string key){\n\t\t\tif(headerset.find(key) == headerset.end())\n\t\t\t\treturn \"INVALID\";\n\t\t\treturn headerset[key];\n\t\t}\n\n\t\tstring params(string key){\n\t\t\tif(paramset.find(key) == paramset.end())\n\t\t\t\treturn \"INVALID\";\n\t\t\treturn paramset[key];\n\t\t}\n\n\t};\n\n class Response{\n\t\tint status;\n\t\tstring message;\n public:\n\t\tResponse(int st,string msg){\n\t\t\tstatus = st;\n\t\t\tmessage = msg;\n\t\t}\n\t\n\n\t\tResponse(string msg){\n\t\t\tmessage = msg;\n\t\t}\n\n \toperator string(){\n \t\treturn to_string(status) + \" \/ \" + message;\n \t}\n };\n\n\tResponse create_response(char* req) noexcept{\n\t\tauto lines = utils::split(string(req), \"\\n\");\n\t\tif(lines.empty())\n\t\t\treturn Response(400, \"Bad Request\");\n \n\t\tcout << lines[0] << endl;\n\n\t\treturn Response( 200, \"OK\");\n\t}\n\n\tstring receive_process(int sessionfd){\n\t\tchar buf[BUF_SIZE] = {};\n\t\tchar method[BUF_SIZE] = {};\n\t\tchar url[BUF_SIZE] = {};\n\t\tchar protocol[BUF_SIZE] = {};\n\n\t\tif (recv(sessionfd, buf, sizeof(buf), 0) < 0) {\n\t\t\texit(EXIT_FAILURE);\n\t\t}\n\t\tdo{\n\t\t\tif(strstr(buf, \"\\r\\n\")){\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\tif (strlen(buf) >= sizeof(buf)) {\n\t\t\t\tmemset(&buf, 0, sizeof(buf));\n\t\t\t}\n\t\t}while(read(sessionfd, buf+strlen(buf), sizeof(buf) - strlen(buf)) > 0);\n\t\treturn create_response(buf);\t\n\t}\n\t\n\tstring openFile(string filename){\n\t\t\n\t}\n\n\ttime_t client_info[FD_SETSIZE];\n\n\tvoid load(string directory, string filename) noexcept{\n\t\tif(filename == \".\" || filename == \"..\") return;\n\t\tif(filename!=\"\")\n\t\t\tdirectory += \"\/\" + filename;\n\t\tDIR* dir = opendir(directory.c_str());\n\t\tif(dir != NULL){\n\t\t\tstruct dirent* dent;\n\t dent = readdir(dir);\n\t\t while(dent!=NULL){\n\t\t dent = readdir(dir);\n\t\t if(dent!=NULL)\n\t\t\t load(directory, string(dent->d_name));\n\t\t }\n\t\t closedir(dir);\n\t\t}else{\n\/\/\t\t\tauto static_file = Cappuccino::FileLoader(directory);\n\/\/\t\t\tstatic_file.preload();\n\t\t\tcontext.routes.insert( make_pair(\n\t\t\t\tdirectory +\"\/\" + filename, \n\t\t\t\t[directory,filename](std::unique_ptr<Request> request) -> std::unique_ptr<Cappuccino::Response>{\n\t\t\t\t\treturn unique_ptr<Cappuccino::Response>(new Cappuccino::Response(openFile(directory +\"\/\" + filename)));\n\t\t\t\t}\n\t\t\t));\t\t\t\n\t\t}\n\t}\n\n\tvoid load_static_files() noexcept{\n\t\tload(*context.static_root,\"\");\n\t}\n\n\tvoid run(){\n\n\t\tcontext.view_root = make_shared<string>(\"\");\t\t\n\t\tcontext.static_root = make_shared<string>(\"public\");\n\n\t\tinit_socket();\n\t\tsignal_utils::init_signal();\n\t\tload_static_files();\n\n\n\t int cd[FD_SETSIZE];\n\t\tstruct sockaddr_in client;\n int fd;\n struct timeval tv;\n\n\t for(int i = 0;i < FD_SETSIZE; i++){\n\t cd[i] = 0;\n\t }\n\n\t while(1) {\n\t tv.tv_sec = 0;\n\t tv.tv_usec = 0;\n\n\t memcpy(&context.mask2fds, &context.mask1fds, sizeof(context.mask1fds));\n\n\t int select_result = select(FD_SETSIZE, &context.mask2fds, (fd_set *)0, (fd_set *)0, &tv);\n\t if(select_result < 1) {\n\t for(fd = 0; fd < FD_SETSIZE; fd++) {\n\t if(cd[fd] == 1) {\n\t close(fd);\n\t FD_CLR(fd, &context.mask1fds);\n\t cd[fd] = 0;\n\t }\n\t }\n\t continue;\n\t }\n\t for(fd = 0; fd < FD_SETSIZE; fd++){\n\t if(FD_ISSET(fd,&context.mask2fds)) {\n\t if(fd == context.sockfd) {\n\t \tmemset( &client, 0, sizeof(client));\n\t\t\t\t\t\tint len = sizeof(client);\n\t int clientfd = accept(context.sockfd, (struct sockaddr *)&client,(socklen_t *) &len);\n FD_SET(clientfd, &context.mask1fds);\n\t }else {\n\t if(cd[fd] == 1) {\n\t close(fd);\n\t FD_CLR(fd, &context.mask1fds);\n\t cd[fd] = 0;\n\t } else {\n\t\t\t\t\t\t\tstring response = receive_process(fd);\n\t\t\t\t\t\t\twrite(fd, response.c_str(), response.size());\n\t cd[fd] = 1;\n\t }\n\t }\n\t }\n\t }\n\t }\t \n\t}\n\n\tvoid Cappuccino(int argc, char *argv[]) {\n\t\toption(argc, argv);\n\t}\n};\n\nnamespace Cocoa{\n\tclass App{};\n};\n\n<|endoftext|>"} {"text":"<commit_before>\/*************************************************************************\n *\n * $RCSfile: cmdmailsuppl.cxx,v $\n *\n * $Revision: 1.9 $\n *\n * last change: $Author: rt $ $Date: 2004-10-22 08:14: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\/\/------------------------------------------------------------------------\n\/\/ includes\n\/\/------------------------------------------------------------------------\n\n#ifndef _OSL_DIAGNOSE_H_\n#include <osl\/diagnose.h>\n#endif\n\n#ifndef _OSL_THREAD_H_\n#include <osl\/thread.h>\n#endif\n\n#ifndef _OSL_PROCESS_H_\n#include <osl\/process.h>\n#endif\n\n#ifndef _OSL_FILE_HXX_\n#include <osl\/file.hxx>\n#endif\n\n#ifndef _RTL_STRBUF_HXX_\n#include <rtl\/strbuf.hxx>\n#endif\n\n#ifndef _CMDMAILSUPPL_HXX_\n#include \"cmdmailsuppl.hxx\"\n#endif\n\n#ifndef _CMDMAILMSG_HXX_\n#include \"cmdmailmsg.hxx\"\n#endif\n\n#ifndef _COM_SUN_STAR_SYSTEM_SIMPLEMAILCLIENTFLAGS_HPP_\n#include <com\/sun\/star\/system\/SimpleMailClientFlags.hpp>\n#endif\n\n#ifndef _COM_SUN_STAR_CONTAINER_XNAMEACCESS_HPP_\n#include <com\/sun\/star\/container\/XNameAccess.hpp>\n#endif\n\n#ifndef _COM_SUN_STAR_BEANS_PROPERTYVALUE_HPP_\n#include <com\/sun\/star\/beans\/PropertyValue.hpp>\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_UNO_XCOMPONENTCONTEXT_HPP_\n#include <com\/sun\/star\/uno\/XComponentContext.hpp>\n#endif\n\n#include <string.h>\n#include <errno.h>\n#include <unistd.h>\n\n\/\/------------------------------------------------------------------------\n\/\/ namespace directives\n\/\/------------------------------------------------------------------------\n\nusing com::sun::star::beans::PropertyValue;\nusing com::sun::star::system::XSimpleMailClientSupplier;\nusing com::sun::star::system::XSimpleMailClient;\nusing com::sun::star::system::XSimpleMailMessage;\nusing com::sun::star::container::XNameAccess;\nusing com::sun::star::container::NoSuchElementException;\nusing rtl::OUString;\nusing rtl::OUStringToOString;\nusing rtl::OString;\nusing rtl::OStringBuffer;\nusing osl::MutexGuard;\nusing osl::FileBase;\n\nusing namespace cppu;\nusing namespace com::sun::star::system::SimpleMailClientFlags;\nusing namespace com::sun::star::uno;\nusing namespace com::sun::star::lang;\n\n\/\/------------------------------------------------------------------------\n\/\/ defines\n\/\/------------------------------------------------------------------------\n\n#define COMP_IMPL_NAME \"com.sun.star.comp.system.SimpleCommandMail2\"\n\n\/\/------------------------------------------------------------------------\n\/\/ helper functions\n\/\/------------------------------------------------------------------------\n\nnamespace \/\/ private\n{\n Sequence< OUString > SAL_CALL Component_getSupportedServiceNames()\n {\n Sequence< OUString > aRet(1);\n aRet[0] = OUString::createFromAscii(\"com.sun.star.system.SimpleCommandMail\");\n return aRet;\n }\n\n} \/\/ end private namespace\n\n\/\/-------------------------------------------------\n\/\/\n\/\/-------------------------------------------------\n\nCmdMailSuppl::CmdMailSuppl( const Reference< XComponentContext >& xContext ) :\n WeakImplHelper3< XSimpleMailClientSupplier, XSimpleMailClient, XServiceInfo >()\n{\n Reference< XMultiComponentFactory > xServiceManager = xContext->getServiceManager();\n\n if ( xServiceManager.is() ) {\n m_xConfigurationProvider = Reference< XMultiServiceFactory > (\n xServiceManager->createInstanceWithContext(\n OUString::createFromAscii( \"com.sun.star.configuration.ConfigurationProvider\" ), xContext ),\n UNO_QUERY );\n }\n}\n\n\/\/-------------------------------------------------\n\/\/ XSimpleMailClientSupplier\n\/\/-------------------------------------------------\n\nReference< XSimpleMailClient > SAL_CALL CmdMailSuppl::querySimpleMailClient( )\n throw (RuntimeException)\n{\n return static_cast < XSimpleMailClient * > (this);\n}\n\n\/\/------------------------------------------------\n\/\/ XSimpleMailClient\n\/\/------------------------------------------------\n\nReference< XSimpleMailMessage > SAL_CALL CmdMailSuppl::createSimpleMailMessage( )\n throw (::com::sun::star::uno::RuntimeException)\n{\n return Reference< XSimpleMailMessage >( new CmdMailMsg( ) );\n}\n\n\/\/------------------------------------------------\n\/\/ XSimpleMailClient\n\/\/------------------------------------------------\n\nvoid SAL_CALL CmdMailSuppl::sendSimpleMailMessage( const Reference< XSimpleMailMessage >& xSimpleMailMessage, sal_Int32 aFlag )\n throw (IllegalArgumentException, Exception, RuntimeException)\n{\n if ( ! xSimpleMailMessage.is() )\n {\n throw ::com::sun::star::lang::IllegalArgumentException(\n OUString(RTL_CONSTASCII_USTRINGPARAM( \"No message specified\" )),\n static_cast < XSimpleMailClient * > (this), 1 );\n }\n\n if( ! m_xConfigurationProvider.is() )\n {\n throw ::com::sun::star::uno::Exception(\n OUString(RTL_CONSTASCII_USTRINGPARAM( \"Can not access configuration\" )),\n static_cast < XSimpleMailClient * > (this) );\n }\n\n OStringBuffer aBuffer;\n\n OUString aProgramURL;\n if ( osl_Process_E_None != osl_getExecutableFile(&aProgramURL.pData) )\n {\n throw ::com::sun::star::uno::Exception(\n OUString(RTL_CONSTASCII_USTRINGPARAM(\"Cound not determine executable path\")),\n static_cast < XSimpleMailClient * > (this));\n }\n\n OUString aProgram;\n if ( FileBase::E_None != FileBase::getSystemPathFromFileURL(aProgramURL, aProgram))\n {\n throw ::com::sun::star::uno::Exception(\n OUString(RTL_CONSTASCII_USTRINGPARAM(\"Cound not convert executable path\")),\n static_cast < XSimpleMailClient * > (this));\n }\n\n \/\/ The mail client launchers are expected to be in the same directory as the main\n \/\/ executable, so prefixing the launchers with the path of the executable including\n \/\/ the last slash\n OString aTmp = OUStringToOString(aProgram, osl_getThreadTextEncoding());\n sal_Int32 nIndex = aTmp.lastIndexOf('\/');\n if (nIndex > 0)\n aBuffer.append(aTmp.copy(0, nIndex+1));\n\n aBuffer.append(\"senddoc \");\n\n try\n {\n \/\/ Query XNameAccess interface of the org.openoffice.Office.Common\/ExternalMailer\n \/\/ configuration node to retriece the users preferred email application. This may\n \/\/ transparently by redirected to e.g. the corresponding GConf setting in GNOME.\n OUString aConfigRoot = OUString(\n RTL_CONSTASCII_USTRINGPARAM( \"org.openoffice.Office.Common\/ExternalMailer\" ) );\n\n PropertyValue aProperty;\n aProperty.Name = OUString::createFromAscii( \"nodepath\" );\n aProperty.Value = makeAny( aConfigRoot );\n\n Sequence< Any > aArgumentList( 1 );\n aArgumentList[0] = makeAny( aProperty );\n\n Reference< XNameAccess > xNameAccess =\n Reference< XNameAccess > (\n m_xConfigurationProvider->createInstanceWithArguments(\n OUString::createFromAscii( \"com.sun.star.configuration.ConfigurationAccess\" ),\n aArgumentList ),\n UNO_QUERY );\n\n if( xNameAccess.is() )\n {\n OUString aMailer;\n\n \/\/ Retrieve the value for \"Program\" node and append it feed senddoc with it\n \/\/ using the (undocumented) --mailclient switch\n xNameAccess->getByName( OUString::createFromAscii( \"Program\" ) ) >>= aMailer;\n\n if( aMailer.getLength() )\n {\n \/\/ make sure we have a system path\n FileBase::getSystemPathFromFileURL( aMailer, aMailer );\n\n aBuffer.append(\"--mailclient \");\n aBuffer.append(OUStringToOString( aMailer, osl_getThreadTextEncoding() ));\n aBuffer.append(\" \");\n }\n }\n\n }\n\n catch( RuntimeException e )\n {\n m_xConfigurationProvider.clear();\n OSL_TRACE( \"RuntimeException caught accessing configuration provider.\" );\n OSL_TRACE( OUStringToOString( e.Message, RTL_TEXTENCODING_ASCII_US ).getStr() );\n throw e;\n }\n\n \/\/ Append originator if set in the message\n if ( xSimpleMailMessage->getOriginator().getLength() > 0 )\n {\n aBuffer.append(\"--from \\\"\");\n aBuffer.append(OUStringToOString(xSimpleMailMessage->getOriginator(), osl_getThreadTextEncoding()));\n aBuffer.append(\"\\\" \");\n }\n\n \/\/ Append receipient if set in the message\n if ( xSimpleMailMessage->getRecipient().getLength() > 0 )\n {\n aBuffer.append(\"--to \\\"\");\n aBuffer.append(OUStringToOString(xSimpleMailMessage->getRecipient(), osl_getThreadTextEncoding()));\n aBuffer.append(\"\\\" \");\n }\n\n \/\/ Append carbon copy receipients set in the message\n Sequence< OUString > aStringList = xSimpleMailMessage->getCcRecipient();\n sal_Int32 n, nmax = aStringList.getLength();\n for ( n = 0; n < nmax; n++ )\n {\n aBuffer.append(\"--cc \\\"\");\n aBuffer.append(OUStringToOString(aStringList[n], osl_getThreadTextEncoding()));\n aBuffer.append(\"\\\" \");\n }\n\n \/\/ Append blind carbon copy receipients set in the message\n aStringList = xSimpleMailMessage->getBccRecipient();\n nmax = aStringList.getLength();\n for ( n = 0; n < nmax; n++ )\n {\n aBuffer.append(\"--bcc \\\"\");\n aBuffer.append(OUStringToOString(aStringList[n], osl_getThreadTextEncoding()));\n aBuffer.append(\"\\\" \");\n }\n\n \/\/ Append subject if set in the message\n if ( xSimpleMailMessage->getSubject().getLength() > 0 )\n {\n aBuffer.append(\"--subject \\\"\");\n aBuffer.append(OUStringToOString(xSimpleMailMessage->getSubject(), osl_getThreadTextEncoding()));\n aBuffer.append(\"\\\" \");\n }\n\n \/\/ Append attachments set in the message\n aStringList = xSimpleMailMessage->getAttachement();\n nmax = aStringList.getLength();\n for ( n = 0; n < nmax; n++ )\n {\n OUString aSystemPath;\n if ( FileBase::E_None == FileBase::getSystemPathFromFileURL(aStringList[n], aSystemPath) )\n {\n aBuffer.append(\"--attach \\\"\");\n aBuffer.append(OUStringToOString(aSystemPath, RTL_TEXTENCODING_UTF8));\n aBuffer.append(\"\\\" \");\n }\n }\n\n OString cmd = aBuffer.makeStringAndClear();\n if ( 0 != pclose(popen(cmd.getStr(), \"w\")) )\n {\n throw ::com::sun::star::uno::Exception(\n OUString(RTL_CONSTASCII_USTRINGPARAM( \"No mail client configured\" )),\n static_cast < XSimpleMailClient * > (this) );\n }\n}\n\n\/\/ -------------------------------------------------\n\/\/ XServiceInfo\n\/\/ -------------------------------------------------\n\nOUString SAL_CALL CmdMailSuppl::getImplementationName( )\n throw( RuntimeException )\n{\n return OUString::createFromAscii( COMP_IMPL_NAME );\n}\n\n\/\/ -------------------------------------------------\n\/\/ XServiceInfo\n\/\/ -------------------------------------------------\n\nsal_Bool SAL_CALL CmdMailSuppl::supportsService( const OUString& ServiceName )\n throw( RuntimeException )\n{\n Sequence < OUString > SupportedServicesNames = Component_getSupportedServiceNames();\n\n for ( sal_Int32 n = SupportedServicesNames.getLength(); n--; )\n if (SupportedServicesNames[n].compareTo(ServiceName) == 0)\n return sal_True;\n\n return sal_False;\n}\n\n\/\/ -------------------------------------------------\n\/\/ XServiceInfo\n\/\/ -------------------------------------------------\n\nSequence< OUString > SAL_CALL CmdMailSuppl::getSupportedServiceNames( )\n throw( RuntimeException )\n{\n return Component_getSupportedServiceNames();\n}\n\n<commit_msg>INTEGRATION: CWS ooo19126 (1.9.70); FILE MERGED 2005\/09\/05 14:05:03 rt 1.9.70.1: #i54170# Change license header: remove SISSL<commit_after>\/*************************************************************************\n *\n * OpenOffice.org - a multi-platform office productivity suite\n *\n * $RCSfile: cmdmailsuppl.cxx,v $\n *\n * $Revision: 1.10 $\n *\n * last change: $Author: rt $ $Date: 2005-09-07 19:51: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\/\/ includes\n\/\/------------------------------------------------------------------------\n\n#ifndef _OSL_DIAGNOSE_H_\n#include <osl\/diagnose.h>\n#endif\n\n#ifndef _OSL_THREAD_H_\n#include <osl\/thread.h>\n#endif\n\n#ifndef _OSL_PROCESS_H_\n#include <osl\/process.h>\n#endif\n\n#ifndef _OSL_FILE_HXX_\n#include <osl\/file.hxx>\n#endif\n\n#ifndef _RTL_STRBUF_HXX_\n#include <rtl\/strbuf.hxx>\n#endif\n\n#ifndef _CMDMAILSUPPL_HXX_\n#include \"cmdmailsuppl.hxx\"\n#endif\n\n#ifndef _CMDMAILMSG_HXX_\n#include \"cmdmailmsg.hxx\"\n#endif\n\n#ifndef _COM_SUN_STAR_SYSTEM_SIMPLEMAILCLIENTFLAGS_HPP_\n#include <com\/sun\/star\/system\/SimpleMailClientFlags.hpp>\n#endif\n\n#ifndef _COM_SUN_STAR_CONTAINER_XNAMEACCESS_HPP_\n#include <com\/sun\/star\/container\/XNameAccess.hpp>\n#endif\n\n#ifndef _COM_SUN_STAR_BEANS_PROPERTYVALUE_HPP_\n#include <com\/sun\/star\/beans\/PropertyValue.hpp>\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_UNO_XCOMPONENTCONTEXT_HPP_\n#include <com\/sun\/star\/uno\/XComponentContext.hpp>\n#endif\n\n#include <string.h>\n#include <errno.h>\n#include <unistd.h>\n\n\/\/------------------------------------------------------------------------\n\/\/ namespace directives\n\/\/------------------------------------------------------------------------\n\nusing com::sun::star::beans::PropertyValue;\nusing com::sun::star::system::XSimpleMailClientSupplier;\nusing com::sun::star::system::XSimpleMailClient;\nusing com::sun::star::system::XSimpleMailMessage;\nusing com::sun::star::container::XNameAccess;\nusing com::sun::star::container::NoSuchElementException;\nusing rtl::OUString;\nusing rtl::OUStringToOString;\nusing rtl::OString;\nusing rtl::OStringBuffer;\nusing osl::MutexGuard;\nusing osl::FileBase;\n\nusing namespace cppu;\nusing namespace com::sun::star::system::SimpleMailClientFlags;\nusing namespace com::sun::star::uno;\nusing namespace com::sun::star::lang;\n\n\/\/------------------------------------------------------------------------\n\/\/ defines\n\/\/------------------------------------------------------------------------\n\n#define COMP_IMPL_NAME \"com.sun.star.comp.system.SimpleCommandMail2\"\n\n\/\/------------------------------------------------------------------------\n\/\/ helper functions\n\/\/------------------------------------------------------------------------\n\nnamespace \/\/ private\n{\n Sequence< OUString > SAL_CALL Component_getSupportedServiceNames()\n {\n Sequence< OUString > aRet(1);\n aRet[0] = OUString::createFromAscii(\"com.sun.star.system.SimpleCommandMail\");\n return aRet;\n }\n\n} \/\/ end private namespace\n\n\/\/-------------------------------------------------\n\/\/\n\/\/-------------------------------------------------\n\nCmdMailSuppl::CmdMailSuppl( const Reference< XComponentContext >& xContext ) :\n WeakImplHelper3< XSimpleMailClientSupplier, XSimpleMailClient, XServiceInfo >()\n{\n Reference< XMultiComponentFactory > xServiceManager = xContext->getServiceManager();\n\n if ( xServiceManager.is() ) {\n m_xConfigurationProvider = Reference< XMultiServiceFactory > (\n xServiceManager->createInstanceWithContext(\n OUString::createFromAscii( \"com.sun.star.configuration.ConfigurationProvider\" ), xContext ),\n UNO_QUERY );\n }\n}\n\n\/\/-------------------------------------------------\n\/\/ XSimpleMailClientSupplier\n\/\/-------------------------------------------------\n\nReference< XSimpleMailClient > SAL_CALL CmdMailSuppl::querySimpleMailClient( )\n throw (RuntimeException)\n{\n return static_cast < XSimpleMailClient * > (this);\n}\n\n\/\/------------------------------------------------\n\/\/ XSimpleMailClient\n\/\/------------------------------------------------\n\nReference< XSimpleMailMessage > SAL_CALL CmdMailSuppl::createSimpleMailMessage( )\n throw (::com::sun::star::uno::RuntimeException)\n{\n return Reference< XSimpleMailMessage >( new CmdMailMsg( ) );\n}\n\n\/\/------------------------------------------------\n\/\/ XSimpleMailClient\n\/\/------------------------------------------------\n\nvoid SAL_CALL CmdMailSuppl::sendSimpleMailMessage( const Reference< XSimpleMailMessage >& xSimpleMailMessage, sal_Int32 aFlag )\n throw (IllegalArgumentException, Exception, RuntimeException)\n{\n if ( ! xSimpleMailMessage.is() )\n {\n throw ::com::sun::star::lang::IllegalArgumentException(\n OUString(RTL_CONSTASCII_USTRINGPARAM( \"No message specified\" )),\n static_cast < XSimpleMailClient * > (this), 1 );\n }\n\n if( ! m_xConfigurationProvider.is() )\n {\n throw ::com::sun::star::uno::Exception(\n OUString(RTL_CONSTASCII_USTRINGPARAM( \"Can not access configuration\" )),\n static_cast < XSimpleMailClient * > (this) );\n }\n\n OStringBuffer aBuffer;\n\n OUString aProgramURL;\n if ( osl_Process_E_None != osl_getExecutableFile(&aProgramURL.pData) )\n {\n throw ::com::sun::star::uno::Exception(\n OUString(RTL_CONSTASCII_USTRINGPARAM(\"Cound not determine executable path\")),\n static_cast < XSimpleMailClient * > (this));\n }\n\n OUString aProgram;\n if ( FileBase::E_None != FileBase::getSystemPathFromFileURL(aProgramURL, aProgram))\n {\n throw ::com::sun::star::uno::Exception(\n OUString(RTL_CONSTASCII_USTRINGPARAM(\"Cound not convert executable path\")),\n static_cast < XSimpleMailClient * > (this));\n }\n\n \/\/ The mail client launchers are expected to be in the same directory as the main\n \/\/ executable, so prefixing the launchers with the path of the executable including\n \/\/ the last slash\n OString aTmp = OUStringToOString(aProgram, osl_getThreadTextEncoding());\n sal_Int32 nIndex = aTmp.lastIndexOf('\/');\n if (nIndex > 0)\n aBuffer.append(aTmp.copy(0, nIndex+1));\n\n aBuffer.append(\"senddoc \");\n\n try\n {\n \/\/ Query XNameAccess interface of the org.openoffice.Office.Common\/ExternalMailer\n \/\/ configuration node to retriece the users preferred email application. This may\n \/\/ transparently by redirected to e.g. the corresponding GConf setting in GNOME.\n OUString aConfigRoot = OUString(\n RTL_CONSTASCII_USTRINGPARAM( \"org.openoffice.Office.Common\/ExternalMailer\" ) );\n\n PropertyValue aProperty;\n aProperty.Name = OUString::createFromAscii( \"nodepath\" );\n aProperty.Value = makeAny( aConfigRoot );\n\n Sequence< Any > aArgumentList( 1 );\n aArgumentList[0] = makeAny( aProperty );\n\n Reference< XNameAccess > xNameAccess =\n Reference< XNameAccess > (\n m_xConfigurationProvider->createInstanceWithArguments(\n OUString::createFromAscii( \"com.sun.star.configuration.ConfigurationAccess\" ),\n aArgumentList ),\n UNO_QUERY );\n\n if( xNameAccess.is() )\n {\n OUString aMailer;\n\n \/\/ Retrieve the value for \"Program\" node and append it feed senddoc with it\n \/\/ using the (undocumented) --mailclient switch\n xNameAccess->getByName( OUString::createFromAscii( \"Program\" ) ) >>= aMailer;\n\n if( aMailer.getLength() )\n {\n \/\/ make sure we have a system path\n FileBase::getSystemPathFromFileURL( aMailer, aMailer );\n\n aBuffer.append(\"--mailclient \");\n aBuffer.append(OUStringToOString( aMailer, osl_getThreadTextEncoding() ));\n aBuffer.append(\" \");\n }\n }\n\n }\n\n catch( RuntimeException e )\n {\n m_xConfigurationProvider.clear();\n OSL_TRACE( \"RuntimeException caught accessing configuration provider.\" );\n OSL_TRACE( OUStringToOString( e.Message, RTL_TEXTENCODING_ASCII_US ).getStr() );\n throw e;\n }\n\n \/\/ Append originator if set in the message\n if ( xSimpleMailMessage->getOriginator().getLength() > 0 )\n {\n aBuffer.append(\"--from \\\"\");\n aBuffer.append(OUStringToOString(xSimpleMailMessage->getOriginator(), osl_getThreadTextEncoding()));\n aBuffer.append(\"\\\" \");\n }\n\n \/\/ Append receipient if set in the message\n if ( xSimpleMailMessage->getRecipient().getLength() > 0 )\n {\n aBuffer.append(\"--to \\\"\");\n aBuffer.append(OUStringToOString(xSimpleMailMessage->getRecipient(), osl_getThreadTextEncoding()));\n aBuffer.append(\"\\\" \");\n }\n\n \/\/ Append carbon copy receipients set in the message\n Sequence< OUString > aStringList = xSimpleMailMessage->getCcRecipient();\n sal_Int32 n, nmax = aStringList.getLength();\n for ( n = 0; n < nmax; n++ )\n {\n aBuffer.append(\"--cc \\\"\");\n aBuffer.append(OUStringToOString(aStringList[n], osl_getThreadTextEncoding()));\n aBuffer.append(\"\\\" \");\n }\n\n \/\/ Append blind carbon copy receipients set in the message\n aStringList = xSimpleMailMessage->getBccRecipient();\n nmax = aStringList.getLength();\n for ( n = 0; n < nmax; n++ )\n {\n aBuffer.append(\"--bcc \\\"\");\n aBuffer.append(OUStringToOString(aStringList[n], osl_getThreadTextEncoding()));\n aBuffer.append(\"\\\" \");\n }\n\n \/\/ Append subject if set in the message\n if ( xSimpleMailMessage->getSubject().getLength() > 0 )\n {\n aBuffer.append(\"--subject \\\"\");\n aBuffer.append(OUStringToOString(xSimpleMailMessage->getSubject(), osl_getThreadTextEncoding()));\n aBuffer.append(\"\\\" \");\n }\n\n \/\/ Append attachments set in the message\n aStringList = xSimpleMailMessage->getAttachement();\n nmax = aStringList.getLength();\n for ( n = 0; n < nmax; n++ )\n {\n OUString aSystemPath;\n if ( FileBase::E_None == FileBase::getSystemPathFromFileURL(aStringList[n], aSystemPath) )\n {\n aBuffer.append(\"--attach \\\"\");\n aBuffer.append(OUStringToOString(aSystemPath, RTL_TEXTENCODING_UTF8));\n aBuffer.append(\"\\\" \");\n }\n }\n\n OString cmd = aBuffer.makeStringAndClear();\n if ( 0 != pclose(popen(cmd.getStr(), \"w\")) )\n {\n throw ::com::sun::star::uno::Exception(\n OUString(RTL_CONSTASCII_USTRINGPARAM( \"No mail client configured\" )),\n static_cast < XSimpleMailClient * > (this) );\n }\n}\n\n\/\/ -------------------------------------------------\n\/\/ XServiceInfo\n\/\/ -------------------------------------------------\n\nOUString SAL_CALL CmdMailSuppl::getImplementationName( )\n throw( RuntimeException )\n{\n return OUString::createFromAscii( COMP_IMPL_NAME );\n}\n\n\/\/ -------------------------------------------------\n\/\/ XServiceInfo\n\/\/ -------------------------------------------------\n\nsal_Bool SAL_CALL CmdMailSuppl::supportsService( const OUString& ServiceName )\n throw( RuntimeException )\n{\n Sequence < OUString > SupportedServicesNames = Component_getSupportedServiceNames();\n\n for ( sal_Int32 n = SupportedServicesNames.getLength(); n--; )\n if (SupportedServicesNames[n].compareTo(ServiceName) == 0)\n return sal_True;\n\n return sal_False;\n}\n\n\/\/ -------------------------------------------------\n\/\/ XServiceInfo\n\/\/ -------------------------------------------------\n\nSequence< OUString > SAL_CALL CmdMailSuppl::getSupportedServiceNames( )\n throw( RuntimeException )\n{\n return Component_getSupportedServiceNames();\n}\n\n<|endoftext|>"} {"text":"<commit_before>#include <map>\n#include <vector>\n#include <thread>\n#include <mutex>\n#include <chrono>\n\n#include <assert.h>\n#include <string.h>\n#include <unistd.h>\n#include <netinet\/tcp.h>\n#include <netdb.h>\n#include <fcntl.h>\n\n#include \"crypto\/sha2.h\"\n#include \"flaggedarrayset.h\"\n#include \"relayprocess.h\"\n#include \"utils.h\"\n\n\n\n\n\n\/***********************************************\n **** Relay network client processing class ****\n ***********************************************\/\nclass RelayNetworkClient {\n\tRELAY_DECLARE_CLASS_VARS\nprivate:\n\tconst char* server_host;\n\n\tconst std::function<void (int)> provide_sock;\n\n\tint sock;\n\tstd::mutex send_mutex;\n\tstd::thread* net_thread, *new_thread;\n\npublic:\n\tRelayNetworkClient(const char* serverHostIn,\n\t\t\t\t\t\tconst std::function<void (int)>& provide_sock_in)\n\t\t\t: RELAY_DECLARE_CONSTRUCTOR_EXTENDS, server_host(serverHostIn), provide_sock(provide_sock_in),\n\t\t\tsock(0), net_thread(NULL), new_thread(NULL) {\n\t\tsend_mutex.lock();\n\t\tnew_thread = new std::thread(do_connect, this);\n\t\tsend_mutex.unlock();\n\t}\n\nprivate:\n\tvoid reconnect(std::string disconnectReason, bool alreadyLocked=false) {\n\t\tprintf(\"Closing relay socket, %s (%i: %s)\\n\", disconnectReason.c_str(), errno, errno ? strerror(errno) : \"\");\n\t\texit(-1);\n\t}\n\n\tstatic void do_connect(RelayNetworkClient* me) {\n\t\tme->send_mutex.lock();\n\n\t\tif (me->net_thread)\n\t\t\tme->net_thread->join();\n\t\tme->net_thread = me->new_thread;\n\n\t\tme->sock = socket(AF_INET6, SOCK_STREAM, 0);\n\t\tif (me->sock <= 0)\n\t\t\treturn me->reconnect(\"unable to create socket\", true);\n\n\t\tsockaddr_in6 addr;\n\t\tif (!lookup_address(me->server_host, &addr))\n\t\t\treturn me->reconnect(\"unable to lookup host\", true);\n\n\t\tint v6only = 0;\n\t\tsetsockopt(me->sock, IPPROTO_IPV6, IPV6_V6ONLY, (char *)&v6only, sizeof(v6only));\n\n\t\taddr.sin6_port = htons(8336);\n\t\tif (connect(me->sock, (struct sockaddr*)&addr, sizeof(addr)))\n\t\t\treturn me->reconnect(\"failed to connect()\", true);\n\n\t\tfcntl(me->sock, F_SETFL, fcntl(me->sock, F_GETFL) & ~O_NONBLOCK);\n\n\t\tme->net_process();\n\t}\n\n\tvoid net_process() {\n\t\trelay_msg_header version_header = { RELAY_MAGIC_BYTES, VERSION_TYPE, htonl(strlen(VERSION_STRING)) };\n\t\tif (send_all(sock, (char*)&version_header, sizeof(version_header)) != sizeof(version_header))\n\t\t\treturn reconnect(\"failed to write version header\", true);\n\t\tif (send_all(sock, VERSION_STRING, strlen(VERSION_STRING)) != strlen(VERSION_STRING))\n\t\t\treturn reconnect(\"failed to write version string\", true);\n\n\t\tint nodelay = 1;\n\t\tsetsockopt(sock, IPPROTO_TCP, TCP_NODELAY, (char*)&nodelay, sizeof(nodelay));\n\n\t\tif (errno)\n\t\t\treturn reconnect(\"error during connect\", true);\n\n\t\tsend_mutex.unlock();\n\n\t\trelay_msg_header header;\n\t\tif (read_all(sock, (char*)&header, 4*3) != 4*3)\n\t\t\treturn reconnect(\"failed to read message header\");\n\n\t\tif (header.magic != RELAY_MAGIC_BYTES)\n\t\t\treturn reconnect(\"invalid magic bytes\");\n\t\tif (header.type != VERSION_TYPE)\n\t\t\treturn reconnect(\"didnt get version first\");\n\n\t\tuint32_t message_size = ntohl(header.length);\n\t\tif (message_size > 1000000)\n\t\t\treturn reconnect(\"got message too large\");\n\n\t\tchar msg[message_size];\n\t\tif (read_all(sock, (char*)msg, message_size) < (int64_t)(message_size))\n\t\t\treturn reconnect(\"failed to read message data\");\n\n\t\tstruct sockaddr_in6 addr;\n\t\tsocklen_t len = sizeof(addr);\n\t\tif (getsockname(sock, (struct sockaddr*)&addr, &len) != 0)\n\t\t\treturn reconnect(\"failed to get bound host\/port\");\n\t\tif (len != sizeof(addr))\n\t\t\treturn reconnect(\"getsockname didnt return a sockaddr_in6?\");\n\n\t\tprintf(\"Connected to %s : %d at %lu\\n\", server_host, addr.sin6_port, epoch_millis_lu(std::chrono::system_clock::now()));\n\n\t\tprovide_sock(sock);\n\t\treturn reconnect(\"provide_sock returned\");\n\t}\n\npublic:\n\tvoid receive_sock(int recv_sock) {\n\t\tstd::lock_guard<std::mutex> lock(send_mutex);\n\t\tchar buff[0xffff];\n\t\twhile (true) {\n\t\t\tssize_t res = recv(recv_sock, buff, sizeof(buff), 0);\n\t\t\tif (res <= 0) { printf(\"Error reading from recv_sock %d: %ld (%s)\\n\", recv_sock, res, strerror(errno)); return; }\n\t\t\tres = send_all(sock, buff, res);\n\t\t\tif (res <= 0) { printf(\"Error sending to sock %d: %ld (%s)\\n\", sock, res, strerror(errno)); return; }\n\t\t}\n\t}\n};\n\n\n\n\nint main(int argc, char** argv) {\n\tif (argc != 3) {\n\t\tprintf(\"USAGE: %s RELAY_SERVER_A RELAY_SERVER_B\\n\", argv[0]);\n\t\treturn -1;\n\t}\n\n\tRelayNetworkClient *relayClientA, *relayClientB;\n\trelayClientA = new RelayNetworkClient(argv[1], [&](int sock) { relayClientB->receive_sock(sock); });\n\trelayClientB = new RelayNetworkClient(argv[2], [&](int sock) { relayClientA->receive_sock(sock); });\n\n\twhile (true) { sleep(1000); }\n}\n<commit_msg>Fix print statement in proxy<commit_after>#include <map>\n#include <vector>\n#include <thread>\n#include <mutex>\n#include <chrono>\n\n#include <assert.h>\n#include <string.h>\n#include <unistd.h>\n#include <netinet\/tcp.h>\n#include <netdb.h>\n#include <fcntl.h>\n\n#include \"crypto\/sha2.h\"\n#include \"flaggedarrayset.h\"\n#include \"relayprocess.h\"\n#include \"utils.h\"\n\n\n\n\n\n\/***********************************************\n **** Relay network client processing class ****\n ***********************************************\/\nclass RelayNetworkClient {\n\tRELAY_DECLARE_CLASS_VARS\nprivate:\n\tconst char* server_host;\n\n\tconst std::function<void (int)> provide_sock;\n\n\tint sock;\n\tstd::mutex send_mutex;\n\tstd::thread* net_thread, *new_thread;\n\npublic:\n\tRelayNetworkClient(const char* serverHostIn,\n\t\t\t\t\t\tconst std::function<void (int)>& provide_sock_in)\n\t\t\t: RELAY_DECLARE_CONSTRUCTOR_EXTENDS, server_host(serverHostIn), provide_sock(provide_sock_in),\n\t\t\tsock(0), net_thread(NULL), new_thread(NULL) {\n\t\tsend_mutex.lock();\n\t\tnew_thread = new std::thread(do_connect, this);\n\t\tsend_mutex.unlock();\n\t}\n\nprivate:\n\tvoid reconnect(std::string disconnectReason, bool alreadyLocked=false) {\n\t\tprintf(\"Closing relay socket, %s (%i: %s)\\n\", disconnectReason.c_str(), errno, errno ? strerror(errno) : \"\");\n\t\texit(-1);\n\t}\n\n\tstatic void do_connect(RelayNetworkClient* me) {\n\t\tme->send_mutex.lock();\n\n\t\tif (me->net_thread)\n\t\t\tme->net_thread->join();\n\t\tme->net_thread = me->new_thread;\n\n\t\tme->sock = socket(AF_INET6, SOCK_STREAM, 0);\n\t\tif (me->sock <= 0)\n\t\t\treturn me->reconnect(\"unable to create socket\", true);\n\n\t\tsockaddr_in6 addr;\n\t\tif (!lookup_address(me->server_host, &addr))\n\t\t\treturn me->reconnect(\"unable to lookup host\", true);\n\n\t\tint v6only = 0;\n\t\tsetsockopt(me->sock, IPPROTO_IPV6, IPV6_V6ONLY, (char *)&v6only, sizeof(v6only));\n\n\t\taddr.sin6_port = htons(8336);\n\t\tif (connect(me->sock, (struct sockaddr*)&addr, sizeof(addr)))\n\t\t\treturn me->reconnect(\"failed to connect()\", true);\n\n\t\tfcntl(me->sock, F_SETFL, fcntl(me->sock, F_GETFL) & ~O_NONBLOCK);\n\n\t\tme->net_process();\n\t}\n\n\tvoid net_process() {\n\t\trelay_msg_header version_header = { RELAY_MAGIC_BYTES, VERSION_TYPE, htonl(strlen(VERSION_STRING)) };\n\t\tif (send_all(sock, (char*)&version_header, sizeof(version_header)) != sizeof(version_header))\n\t\t\treturn reconnect(\"failed to write version header\", true);\n\t\tif (send_all(sock, VERSION_STRING, strlen(VERSION_STRING)) != strlen(VERSION_STRING))\n\t\t\treturn reconnect(\"failed to write version string\", true);\n\n\t\tint nodelay = 1;\n\t\tsetsockopt(sock, IPPROTO_TCP, TCP_NODELAY, (char*)&nodelay, sizeof(nodelay));\n\n\t\tif (errno)\n\t\t\treturn reconnect(\"error during connect\", true);\n\n\t\tsend_mutex.unlock();\n\n\t\trelay_msg_header header;\n\t\tif (read_all(sock, (char*)&header, 4*3) != 4*3)\n\t\t\treturn reconnect(\"failed to read message header\");\n\n\t\tif (header.magic != RELAY_MAGIC_BYTES)\n\t\t\treturn reconnect(\"invalid magic bytes\");\n\t\tif (header.type != VERSION_TYPE)\n\t\t\treturn reconnect(\"didnt get version first\");\n\n\t\tuint32_t message_size = ntohl(header.length);\n\t\tif (message_size > 1000000)\n\t\t\treturn reconnect(\"got message too large\");\n\n\t\tchar msg[message_size];\n\t\tif (read_all(sock, (char*)msg, message_size) < (int64_t)(message_size))\n\t\t\treturn reconnect(\"failed to read message data\");\n\n\t\tstruct sockaddr_in6 addr;\n\t\tsocklen_t len = sizeof(addr);\n\t\tif (getsockname(sock, (struct sockaddr*)&addr, &len) != 0)\n\t\t\treturn reconnect(\"failed to get bound host\/port\");\n\t\tif (len != sizeof(addr))\n\t\t\treturn reconnect(\"getsockname didnt return a sockaddr_in6?\");\n\n\t\tprintf(\"Connected to %s local_port %d at %lu\\n\", server_host, addr.sin6_port, epoch_millis_lu(std::chrono::system_clock::now()));\n\n\t\tprovide_sock(sock);\n\t\treturn reconnect(\"provide_sock returned\");\n\t}\n\npublic:\n\tvoid receive_sock(int recv_sock) {\n\t\tstd::lock_guard<std::mutex> lock(send_mutex);\n\t\tchar buff[0xffff];\n\t\twhile (true) {\n\t\t\tssize_t res = recv(recv_sock, buff, sizeof(buff), 0);\n\t\t\tif (res <= 0) { printf(\"Error reading from recv_sock %d: %ld (%s)\\n\", recv_sock, res, strerror(errno)); return; }\n\t\t\tres = send_all(sock, buff, res);\n\t\t\tif (res <= 0) { printf(\"Error sending to sock %d: %ld (%s)\\n\", sock, res, strerror(errno)); return; }\n\t\t}\n\t}\n};\n\n\n\n\nint main(int argc, char** argv) {\n\tif (argc != 3) {\n\t\tprintf(\"USAGE: %s RELAY_SERVER_A RELAY_SERVER_B\\n\", argv[0]);\n\t\treturn -1;\n\t}\n\n\tRelayNetworkClient *relayClientA, *relayClientB;\n\trelayClientA = new RelayNetworkClient(argv[1], [&](int sock) { relayClientB->receive_sock(sock); });\n\trelayClientB = new RelayNetworkClient(argv[2], [&](int sock) { relayClientA->receive_sock(sock); });\n\n\twhile (true) { sleep(1000); }\n}\n<|endoftext|>"} {"text":"<commit_before>\/* This file is part of the KDE project\n Copyright (C) 2004 Mark Bucciarelli <mark@hubcapconsulting.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 <kdebug.h>\n#include <qdir.h>\n#include <qfile.h>\n#include <qstring.h>\n#include <qstringlist.h>\n#include <qtextstream.h>\n\n#include \"script.h\"\n\nstatic QString srcdir();\nstatic int runscripts\n( const QString &interpreter, const QString &extension, const QString &path );\n\nconst QString dots = \"..................................................\"; \nconst QString not_a_test_filename_prefix = \"__\";\n\n\/\/ Read srcdir from Makefile (for builddir != srcdir).\nQString srcdir()\n{\n bool found = false;\n QString dir;\n\n QFile file( \"Makefile\" );\n if ( !file.open( IO_ReadOnly | IO_Translate ) ) return \"\";\n\n QTextStream in( &file );\n QString line;\n while ( !found && !in.atEnd() )\n {\n line = in.readLine(); \n if ( line.startsWith( \"srcdir = \" ) )\n {\n dir = line.mid( 9 );\n found = true;\n }\n }\n\n if ( !found ) dir = \"\";\n\n return dir;\n}\n\nint runscripts\n( const QString &interpreter, const QString &extension, const QString &path )\n{\n int rval = 0;\n QStringList files;\n\n QDir dir( path );\n\n Script* s = new Script( dir );\n\n dir.setNameFilter( extension );\n dir.setFilter( QDir::Files );\n dir.setSorting( QDir::Name | QDir::IgnoreCase );\n const QFileInfoList *list = dir.entryInfoList();\n QFileInfoListIterator it( *list );\n QFileInfo *fi;\n while ( !rval && ( fi = it.current() ) != 0 ) \n {\n \/\/ Don't run scripts that are shared routines.\n if ( ! fi->fileName().startsWith( not_a_test_filename_prefix ) ) \n {\n s->addArgument( interpreter );\n s->addArgument( path + QDir::separator() + fi->fileName().latin1() );\n\n \/\/ Thorsten's xautomation tests run with user interaction by default.\n if ( interpreter == \"sh\" ) s->addArgument( \"--batch\" );\n if ( interpreter == \"php\" ) s->addArgument( \"--batch\" );\n\n rval = s->run();\n\n kdDebug() << \"runscripts: \" << fi->fileName() \n << \" \" << dots.left( dots.length() - fi->fileName().length() )\n << \" \" << ( ! rval ? \"PASS\" : \"FAIL\" ) << endl;\n\n \/\/ Don't abort if one test files--run them all\n if ( rval ) rval = 0;\n\n delete s;\n s = new Script( dir );\n }\n ++it;\n }\n delete s;\n s = 0;\n \n return rval;\n}\n\nint main( int, char** )\n{\n int rval = 0;\n\n QString path = srcdir();\n\n if ( !rval ) rval = runscripts( \"python\", \"*.py *.Py *.PY *.pY\", path );\n\n if ( !rval ) rval = runscripts( \"sh\", \"*.sh *.Sh *.SH *.sH\", path );\n\n if ( !rval ) rval = runscripts( \"perl\", \"*.pl *.Pl *.PL *.pL\", path );\n\n if ( !rval ) rval = runscripts( \"php\", \"*.php *.php3 *.php4 *.php5\", path );\n\n return rval;\n}\n<commit_msg>deliver error on failed test<commit_after>\/* This file is part of the KDE project\n Copyright (C) 2004 Mark Bucciarelli <mark@hubcapconsulting.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 <kdebug.h>\n#include <qdir.h>\n#include <qfile.h>\n#include <qstring.h>\n#include <qstringlist.h>\n#include <qtextstream.h>\n\n#include \"script.h\"\n\nstatic QString srcdir();\nstatic int runscripts\n( const QString &interpreter, const QString &extension, const QString &path );\n\nconst QString dots = \"..................................................\"; \nconst QString not_a_test_filename_prefix = \"__\";\n\n\/\/ Read srcdir from Makefile (for builddir != srcdir).\nQString srcdir()\n{\n bool found = false;\n QString dir;\n\n QFile file( \"Makefile\" );\n if ( !file.open( IO_ReadOnly | IO_Translate ) ) return \"\";\n\n QTextStream in( &file );\n QString line;\n while ( !found && !in.atEnd() )\n {\n line = in.readLine(); \n if ( line.startsWith( \"srcdir = \" ) )\n {\n dir = line.mid( 9 );\n found = true;\n }\n }\n\n if ( !found ) dir = \"\";\n\n return dir;\n}\n\nint runscripts\n( const QString &interpreter, const QString &extension, const QString &path )\n{\n int rval = 0;\n int oneBadApple = 0;\n QStringList files;\n\n QDir dir( path );\n\n Script* s = new Script( dir );\n\n dir.setNameFilter( extension );\n dir.setFilter( QDir::Files );\n dir.setSorting( QDir::Name | QDir::IgnoreCase );\n const QFileInfoList *list = dir.entryInfoList();\n QFileInfoListIterator it( *list );\n QFileInfo *fi;\n while ( !rval && ( fi = it.current() ) != 0 ) \n {\n \/\/ Don't run scripts that are shared routines.\n if ( ! fi->fileName().startsWith( not_a_test_filename_prefix ) ) \n {\n s->addArgument( interpreter );\n s->addArgument( path + QDir::separator() + fi->fileName().latin1() );\n\n \/\/ Thorsten's xautomation tests run with user interaction by default.\n if ( interpreter == \"sh\" ) s->addArgument( \"--batch\" );\n if ( interpreter == \"php\" ) s->addArgument( \"--batch\" );\n\n rval = s->run();\n\n kdDebug() << \"runscripts: \" << fi->fileName() \n << \" \" << dots.left( dots.length() - fi->fileName().length() )\n << \" \" << ( ! rval ? \"PASS\" : \"FAIL\" ) << endl;\n\n \/\/ Don't abort if one test files--run them all\n if ( rval ) \n {\n oneBadApple = 1;\n rval = 0;\n }\n\n delete s;\n s = new Script( dir );\n }\n ++it;\n }\n delete s;\n s = 0;\n \n return oneBadApple;\n}\n\nint main( int, char** )\n{\n int rval = 0;\n\n QString path = srcdir();\n\n if ( !rval ) rval = runscripts( \"python\", \"*.py *.Py *.PY *.pY\", path );\n\n if ( !rval ) rval = runscripts( \"sh\", \"*.sh *.Sh *.SH *.sH\", path );\n\n if ( !rval ) rval = runscripts( \"perl\", \"*.pl *.Pl *.PL *.pL\", path );\n\n if ( !rval ) rval = runscripts( \"php\", \"*.php *.php3 *.php4 *.php5\", path );\n\n return rval;\n}\n<|endoftext|>"} {"text":"<commit_before>\/*\n * Copyright (c) 2007-2008 Digital Bazaar, Inc. All rights reserved.\n *\/\n#include \"db\/io\/MutatorInputStream.h\"\n\nusing namespace db::io;\nusing namespace db::rt;\n\nMutatorInputStream::MutatorInputStream(\n InputStream* is, MutationAlgorithm* algorithm, bool cleanup) :\n FilterInputStream(is, cleanup),\n mSource(2048),\n mDestination(4096)\n{\n \/\/ store mutation algorithm\n mAlgorithm = algorithm;\n mResult = MutationAlgorithm::NeedsData;\n mSourceEmpty = false;\n}\n\nMutatorInputStream::~MutatorInputStream()\n{\n}\n\nint MutatorInputStream::read(char* b, int length)\n{\n int rval = 0;\n \n \/\/ mutate while no data is available and algorithm not complete\n while(rval == 0 && mResult < MutationAlgorithm::CompleteAppend)\n {\n \/\/ try to mutate data\n mResult = mAlgorithm->mutateData(&mSource, &mDestination, mSourceEmpty);\n switch(mResult)\n {\n case MutationAlgorithm::NeedsData:\n if(mSource.isFull())\n {\n \/\/ no more data available for algorithm\n Exception* e = new Exception(\n \"Insufficient data for mutation algorithm!\",\n \"db.io.MutationException\");\n Exception::setLast(e);\n rval = -1;\n }\n else\n {\n \/\/ read more data from underlying stream\n mSourceEmpty = (mSource.put(mInputStream) == 0);\n }\n break;\n default:\n \/\/ set rval to available data\n rval = mDestination.length();\n break;\n }\n }\n \n \/\/ if the algorithm has completed, handle any excess source data\n if(mResult >= MutationAlgorithm::CompleteAppend)\n {\n if(mResult == MutationAlgorithm::CompleteAppend)\n {\n \/\/ empty source into destination\n mSource.get(&mDestination, mSource.length(), true);\n \n \/\/ get bytes from destination\n rval = mDestination.get(b, length);\n \n if(rval == 0 && !mSourceEmpty)\n {\n \/\/ read bytes directly into passed buffer\n rval = mInputStream->read(b, length);\n }\n }\n else if(mDestination.isEmpty() && !mSourceEmpty)\n {\n \/\/ clear remaining bytes in underlying input stream\n mSource.clear();\n while(mSource.put(mInputStream) > 0)\n {\n mSource.clear();\n }\n }\n }\n \n return rval;\n}\n<commit_msg>Fixed various bugs in MutatorInputStream implementation.<commit_after>\/*\n * Copyright (c) 2007-2008 Digital Bazaar, Inc. All rights reserved.\n *\/\n#include \"db\/io\/MutatorInputStream.h\"\n\nusing namespace db::io;\nusing namespace db::rt;\n\nMutatorInputStream::MutatorInputStream(\n InputStream* is, MutationAlgorithm* algorithm, bool cleanup) :\n FilterInputStream(is, cleanup),\n mSource(2048),\n mDestination(4096)\n{\n \/\/ store mutation algorithm\n mAlgorithm = algorithm;\n mResult = MutationAlgorithm::NeedsData;\n mSourceEmpty = false;\n}\n\nMutatorInputStream::~MutatorInputStream()\n{\n}\n\nint MutatorInputStream::read(char* b, int length)\n{\n int rval = 0;\n \n \/\/ mutate while no data is available and algorithm not complete\n while(rval == 0 && mResult < MutationAlgorithm::CompleteAppend)\n {\n \/\/ try to mutate data\n mResult = mAlgorithm->mutateData(&mSource, &mDestination, mSourceEmpty);\n switch(mResult)\n {\n case MutationAlgorithm::NeedsData:\n if(mSource.isFull() || mSourceEmpty)\n {\n \/\/ no more data available for algorithm\n Exception* e = new Exception(\n \"Insufficient data for mutation algorithm!\",\n \"db.io.MutationException\");\n Exception::setLast(e);\n rval = -1;\n }\n else\n {\n \/\/ read more data from underlying stream\n mSourceEmpty = (mSource.put(mInputStream) == 0);\n }\n break;\n default:\n \/\/ set rval to available data\n rval = mDestination.length();\n break;\n }\n }\n \n \/\/ if the algorithm has completed, handle any excess source data\n if(mResult >= MutationAlgorithm::CompleteAppend)\n {\n if(mResult == MutationAlgorithm::CompleteAppend)\n {\n \/\/ empty source into destination\n mSource.get(&mDestination, mSource.length(), true);\n \n \/\/ get bytes from destination\n rval = mDestination.get(b, length);\n \n if(rval == 0 && !mSourceEmpty)\n {\n \/\/ read bytes directly into passed buffer\n rval = mInputStream->read(b, length);\n }\n }\n else if(mDestination.isEmpty() && !mSourceEmpty)\n {\n \/\/ clear remaining bytes in underlying input stream\n mSource.clear();\n while(mSource.put(mInputStream) > 0)\n {\n mSource.clear();\n }\n }\n }\n else\n {\n \/\/ get data from destination buffer\n rval = mDestination.get(b, length);\n }\n \n return rval;\n}\n<|endoftext|>"} {"text":"<commit_before>#include <stdio.h>\n#include <stdlib.h>\n#include <readline\/readline.h>\n#include <readline\/history.h>\n#include <stdio.h>\n#include <stdlib.h>\n#include <string.h>\n#include \"..\/hubo-ach\/hubo.h\"\n\n\n\n\/\/ for ach\n#include <errno.h>\n#include <fcntl.h>\n#include <assert.h>\n#include <unistd.h>\n#include <pthread.h>\n#include <ctype.h>\n#include <stdbool.h>\n#include <math.h>\n#include <inttypes.h>\n#include \"ach.h\"\n\n\n\n\n\n\n#include <iostream>\n#include <sstream>\n#include <string>\nusing namespace std;\n\n\n\/\/ ach message type\n\/\/typedef struct hubo h[1];\n\n\/\/ ach channels\nach_channel_t chan_num;\nach_channel_t chan_num_console;\n\n\n \nstatic char** my_completion(const char*, int ,int);\nchar* my_generator(const char*,int);\nchar * dupstr (char*);\nvoid *xmalloc (int);\nvoid parse(char *s);\nint test(char *s , struct hubo *h);\nchar* getArg(string s, int argNum);\nvoid hubo_update(struct hubo *h);\nint name2mot(char*s, struct hubo *h);\ndouble hubo_get(char*s, struct hubo *h);\nvoid hubo_jmc_beep(struct hubo *h, struct console *c, char* buff);\nvoid hubo_jmc_home(struct hubo *h, struct console *c, char* buff);\n\/\/char* cmd [] ={ \"test\",\"hello\", \"world\", \"hell\" ,\"word\", \"quit\", \" \" };\nchar* cmd [] ={ \"initialize\",\"fet\",\n\t\t\"ctrl\",\"enczero\", \"goto\",\"get\",\"test\",\"update\", \"quit\",\"beep\", \"home\",\" \"}; \/\/,\n\/*\n\t\t\"get RHY\", \"get RHR\", \"get RHP\", \"get RKN\", \"get RAP\", \"get RAR\", \n\t\t\"get LHY\", \"get LHR\", \"get LHP\", \"get LKN\", \"get LAP\", \"get LAR\", \t\n\t\t\"get RSP\", \"get RSR\", \"get RSY\", \"get REB\", \"get RWY\", \"get RWP\", \n\t\t\"get LSP\", \"get LSR\", \"get LSY\", \"get LEB\", \"get LWY\", \"get LWP\", \n\t\t\"get NKY\", \"get NK1\", \"get NK2\", \"get WST\", \"get RF1\", \"get RF2\", \n\t\t\"get RF3\", \"get RF4\", \"get RF5\", \"get LF1\", \"get LF2\", \"get LF3\", \n\t\t\"get LF4\", \"get LF5\"};\n *\/\n\nint main() {\n\tprintf(\"\\n\");\n\tprintf(\" ***************** hubo-ach **************** \\n\");\n\tprintf(\" Support: Daniel M. Lofaro dan@danlofaro.com \\n\");\n\tprintf(\" ******************************************* \\n\");\n\t\n \/\/ get initial values for hubo\n \/\/ open ach channel\n \/\/int r = ach_open(&chan_num, \"hubo\", NULL);\n int r = ach_open(&chan_num, ch_hubo, NULL);\n assert( ACH_OK == r );\n\n \/\/r = ach_open(&chan_num_console, \"hubo-console\", NULL);\n r = ach_open(&chan_num_console, ch_hubo_console, NULL);\n assert( ACH_OK == r );\n \n\tstruct hubo H;\n struct console C;\n size_t fs;\n r = ach_get( &chan_num, &H, sizeof(H), &fs, NULL, ACH_O_LAST );\n assert( sizeof(H) == fs );\n r = ach_get( &chan_num_console, &C, sizeof(C), &fs, NULL, ACH_O_LAST );\n \/\/if(r == ACH_OK){assert( sizeof(C) == fs );}\n\n\n\n\tchar *buf;\n\trl_attempted_completion_function = my_completion;\n\tprintf(\"\\n\");\n\twhile((buf = readline(\">> hubo-ach: \"))!=NULL) {\n\t\/\/enable auto-complete\n\trl_bind_key('\\t',rl_complete);\n \n\/\/\tprintf(\"cmd [%s]\\n\",buf);\n\/\/\tprintf(\">> \");\n\tprintf(\" \");\n\n\t\/* get update after every command *\/\n\thubo_update(&H);\n\n\n\tchar* buf0 = getArg(buf, 0);\n\t\/\/printf(buf0);\t\n\n\tif (strcmp(buf0,\"update\")==0) {\n\t\thubo_update(&H);\n\t\tprintf(\"--->Hubo Information Updated\\n\");\n\t}\n\telse if (strcmp(buf0,\"get\")==0) {\n\t\tdouble jRef = hubo_get(buf,&H);\n\t\tchar* tmp = getArg(buf,1);\n\t\tprintf(\">> %s = %f rad \\n\",tmp,jRef);\n\t}\n\telse if (strcmp(buf0,\"beep\")==0) {\n\t\thubo_jmc_beep(&H, &C, buf);\n\t}\n\telse if (strcmp(buf0,\"home\")==0) {\n\t\thubo_jmc_home(&H, &C, buf);\n\t\tprintf(\"%s - Initilize \\n\",getArg(buf,1));\n\t}\n\telse if (strcmp(buf0,\"ctrl\")==0) {\n\t\tint onOrOff = atof(getArg(buf,2));\n if(onOrOff == 0 | onOrOff == 1) {\n C.cmd[0] = HUBO_CTRL_ON_OFF;\n C.cmd[1] = name2mot(getArg(buf,1),&H); \/\/ set motor num\n C.cmd[2] = atof(getArg(buf,2)); \/\/ 1 = on, 0 = 0ff\n int r = ach_put( &chan_num_console, &C, sizeof(C) );\n if(onOrOff == 0) {\n printf(\"%s - Turning Off CTRL\\n\",getArg(buf,1));}\n else {\n printf(\"%s - Turning On CTRL\\n\",getArg(buf,1));}\n }\n\n\t}\n\telse if (strcmp(buf0,\"fet\")==0) {\n\t\tint onOrOff = atof(getArg(buf,2));\n\t\tif(onOrOff == 0 | onOrOff == 1) {\n\t\t\tC.cmd[0] = HUBO_FET_ON_OFF;\n\t\t\tC.cmd[1] = name2mot(getArg(buf,1),&H); \/\/ set motor num\n\t\t\tC.cmd[2] = atof(getArg(buf,2));\t\t\/\/ 1 = on, 0 = 0ff\n \t\t\tint r = ach_put( &chan_num_console, &C, sizeof(C) );\n\t\t\tif(onOrOff == 0) {\n\t\t\t\tprintf(\"%s - Turning Off FET\\n\",getArg(buf,1));}\n\t\t\telse {\n\t\t\t\tprintf(\"%s - Turning On FET\\n\",getArg(buf,1));}\n\t\t}\n\t}\n\telse if (strcmp(buf0,\"initialize\")==0) {\n\t\tC.cmd[0] = HUBO_JMC_INI;\n\t\tC.cmd[1] = name2mot(getArg(buf,1),&H);\t\/\/ set motor num\n\t\t\/\/C.val[0] = atof(getArg(buf,2));\n\t\tr =\tach_put( &chan_num_console, &C, sizeof(C));\n\t\tprintf(\"%s - Initilize \\n\",getArg(buf,1));\n\t}\n\telse if (strcmp(buf0,\"test\")==0)\n\t\ttest(buf, &H);\n\t\/* Quit *\/\n\telse if (strcmp(buf0,\"quit\")==0)\n\t\tbreak;\n\tif (buf[0]!=0)\n\tadd_history(buf);\n\t}\n \n\tfree(buf);\n \treturn 0;\n}\n\ndouble hubo_get(char*s, struct hubo *h) {\n\n\t\/* get joint number *\/\n\tint jointNo = name2mot(getArg(s,1),h);\n\n\treturn h->joint[jointNo].ref;\n}\n\nvoid hubo_jmc_beep(struct hubo *h, struct console *c, char* buff) {\n\t\/* make beiep *\/\n\tc->cmd[0] = HUBO_JMC_BEEP;\n\tc->cmd[1] = name2mot(getArg(buff, 1), h);\n\tc->val[2] = atof(getArg(buff,2));\n \tint r = ach_put( &chan_num_console, c, sizeof(*c) );\n\tprintf(\"send beep r = %i C = %i v = %f\\n\",r, c->cmd[0], c->val[0]);\n\n}\n\nvoid hubo_jmc_home(struct hubo *h, struct console *c, char* buff) {\n\t\/* make beiep *\/\n\tc->cmd[0] = HUBO_GOTO_HOME;\n\tc->cmd[1] = name2mot(getArg(buff, 1), h);\n \tint r = ach_put( &chan_num_console, c, sizeof(*c) );\n\/\/\tprintf(\">> Home %s \\n\",getArg(buff,1));\n}\n\nvoid hubo_update(struct hubo *h) {\n \tsize_t fs;\n \tint r = ach_get( &chan_num, h, sizeof(*h), &fs, NULL, ACH_O_LAST );\n\/\/\tprintf(\"r = %i\\n\",r);\n\/\/\tprintf(\"sizefo(*h) = %i, fs = %i\\n\",sizeof(*h), fs);\n\t\/\/if((r != ACH_STALE_FRAMES) & (r != ACH_MISSED_FRAME)) {\n\tif((r == ACH_OK) | (r == ACH_MISSED_FRAME)) {\n\t \tassert( sizeof(*h) == fs );\n\t}\n\n\t\/\/ look into posix message que\n\t\/\/ posix rt signal can give signal numb er and an interger\n}\n\n\nchar* getArg(string s, int argNum) {\n\/\/\tprintf(\"\\n dan test\\n\");\n\n\tistringstream iss(s);\n\t\n\tint i = 0;\n\/\/\tchar* theOut[];\n\tdo\n \t{\n \tstring sub;\n \tiss >> sub;\n \/\/ \tcout << \"Substring: \" << sub << endl;\n\t\tif( i == argNum ) {\n\t\t\treturn (char*)sub.c_str(); }\n\t\ti++;\n \t} while (iss);\n\n \treturn NULL;\n}\n\nint test(char* s, struct hubo *h) {\n\tprintf(\"\\n dan test\\n\");\n\n\tchar* mot = getArg(s,1);\n\n\tint tmp = name2mot(mot, h);\n\tprintf(\"mot = %i \\n\",tmp);\n\treturn 0;\n}\n\nint name2mot(char* name, struct hubo *h) {\n\t\/* Returns the number of the requested joint *\/\t\n\tint i = 0;\n\tint iout = -1;\n\tfor( i = 0; i < numOfJoints; i++ ) {\n\t\t\tchar *mot = h->joint[i].name;\n\t\t\tif (strcmp(name, mot) == 0) {\n\/\/\t\t\t\tprintf(\"i = %i\\n\", i);\n\t\t\t\tiout = i;}\n\t}\n\treturn iout;\n}\n\n\n \nstatic char** my_completion( const char * text , int start, int end) {\n\tchar **matches;\n \n\tmatches = (char **)NULL;\n \n\tif (start == 0)\n\t\tmatches = rl_completion_matches ((char*)text, &my_generator);\n\telse\n\t\trl_bind_key('\\t',rl_abort);\n \n\treturn (matches);\n}\n \nchar* my_generator(const char* text, int state) {\n\tstatic int list_index, len;\n\tchar *name;\n \n\tif (!state) {\n\t\tlist_index = 0;\n\t\tlen = strlen (text);\n\t}\n \n\twhile (name = cmd[list_index]) {\n\t\tlist_index++;\n \n\tif (strncmp (name, text, len) == 0)\n\t\treturn (dupstr(name));\n\t}\n \n\t\/* If no names matched, then return NULL. *\/\n\treturn ((char *)NULL);\n}\n \nchar * dupstr (char* s) {\n\tchar *r;\n \n\tr = (char*) xmalloc ((strlen (s) + 1));\n\tstrcpy (r, s);\n\treturn (r);\n}\n \nvoid * xmalloc (int size) {\n\tvoid *buf;\n \n\tbuf = malloc (size);\n\tif (!buf) {\n\t\tfprintf (stderr, \"Error: Out of memory. Exiting.'n\");\n\t\texit (1);\n\t}\n\treturn buf;\n}\n<commit_msg>converted to new hubo-ach structure - not tested<commit_after>#include <stdio.h>\n#include <stdlib.h>\n#include <readline\/readline.h>\n#include <readline\/history.h>\n#include <stdio.h>\n#include <stdlib.h>\n#include <string.h>\n#include \"..\/hubo-ach\/hubo.h\"\n\n\n\n\/\/ for ach\n#include <errno.h>\n#include <fcntl.h>\n#include <assert.h>\n#include <unistd.h>\n#include <pthread.h>\n#include <ctype.h>\n#include <stdbool.h>\n#include <math.h>\n#include <inttypes.h>\n#include \"ach.h\"\n\n\n\n\n\n\n#include <iostream>\n#include <sstream>\n#include <string>\nusing namespace std;\n\n\n\/\/ ach message type\n\/\/typedef struct hubo h[1];\n\n\/\/ ach channels\nach_channel_t chan_hubo_ref; \/\/ hubo-ach\nach_channel_t chan_hubo_init_cmd; \/\/ hubo-ach-console\nach_channel_t chan_hubo_state; \/\/ hubo-ach-state\nach_channel_t chan_hubo_param; \/\/ hubo-ach-param\n\n\n \nstatic char** my_completion(const char*, int ,int);\nchar* my_generator(const char*,int);\nchar * dupstr (char*);\nvoid *xmalloc (int);\nvoid parse(char *s);\nint test(char *s , struct hubo *h);\nchar* getArg(string s, int argNum);\nvoid hubo_update(struct hubo_ref *h_ref, struct hubo_state *h_state, struct hubo_param *h_param);\nint name2mot(char*s, struct hubo_param *h);\ndouble hubo_get(char*s, struct hubo_ref *h, struct hubo_param *p);\nvoid hubo_jmc_beep(struct hubo_param *h, struct hubo_init_cmd *c, char* buff);\nvoid hubo_jmc_home(struct hubo_param *h, struct hubo_init_cmd *c, char* buff);\n\/\/char* cmd [] ={ \"test\",\"hello\", \"world\", \"hell\" ,\"word\", \"quit\", \" \" };\nchar* cmd [] ={ \"initialize\",\"fet\",\n\t\t\"ctrl\",\"enczero\", \"goto\",\"get\",\"test\",\"update\", \"quit\",\"beep\", \"home\",\" \"}; \/\/,\n\/*\n\t\t\"get RHY\", \"get RHR\", \"get RHP\", \"get RKN\", \"get RAP\", \"get RAR\", \n\t\t\"get LHY\", \"get LHR\", \"get LHP\", \"get LKN\", \"get LAP\", \"get LAR\", \t\n\t\t\"get RSP\", \"get RSR\", \"get RSY\", \"get REB\", \"get RWY\", \"get RWP\", \n\t\t\"get LSP\", \"get LSR\", \"get LSY\", \"get LEB\", \"get LWY\", \"get LWP\", \n\t\t\"get NKY\", \"get NK1\", \"get NK2\", \"get WST\", \"get RF1\", \"get RF2\", \n\t\t\"get RF3\", \"get RF4\", \"get RF5\", \"get LF1\", \"get LF2\", \"get LF3\", \n\t\t\"get LF4\", \"get LF5\"};\n *\/\n\nint main() {\n\tprintf(\"\\n\");\n\tprintf(\" ***************** hubo-ach **************** \\n\");\n\tprintf(\" Support: Daniel M. Lofaro dan@danlofaro.com \\n\");\n\tprintf(\" ******************************************* \\n\");\n\t\n \/\/ get initial values for hubo\n \/\/ open ach channel\n\tint r = ach_open(&chan_hubo_ref, HUBO_CHAN_REF_NAME, NULL);\n\tassert( ACH_OK == r );\n\n\t\/\/ open hubo state\n\tr = ach_open(&chan_hubo_state, HUBO_CHAN_STATE_NAME, NULL);\n\tassert( ACH_OK == r );\n\n\t\/\/ initilize control channel\n\tr = ach_open(&chan_hubo_init_cmd, HUBO_CHAN_INIT_CMD_NAME, NULL);\n\tassert( ACH_OK == r );\n\n\t\/\/ paramater\n\tr = ach_open(&chan_hubo_param, HUBO_CHAN_PARAM_NAME, NULL);\n\tassert( ACH_OK == r );\n\t\n\t\/\/ get initial values for hubo\n\tstruct hubo_ref H_ref;\n\tstruct hubo_init_cmd H_init;\n\tstruct hubo_state H_state;\n\tstruct hubo_param H_param;\n\tmemset( &H_ref, 0, sizeof(H_ref));\n\tmemset( &H_init, 0, sizeof(H_init));\n\tmemset( &H_state, 0, sizeof(H_state));\n\tmemset( &H_param, 0, sizeof(H_param));\n\n\tsize_t fs;\n\tr = ach_get( &chan_hubo_ref, &H_ref, sizeof(H_ref), &fs, NULL, ACH_O_LAST );\n\tassert( sizeof(H_ref) == fs );\n\tr = ach_get( &chan_hubo_init_cmd, &H_init, sizeof(H_init), &fs, NULL, ACH_O_LAST );\n\tassert( sizeof(H_init) == fs );\n\tr = ach_get( &chan_hubo_init_cmd, &H_state, sizeof(H_state), &fs, NULL, ACH_O_LAST );\n\tassert( sizeof(H_state) == fs );\n\tr = ach_get( &chan_hubo_param, &H_param, sizeof(H_param), &fs, NULL, ACH_O_LAST );\n\tassert( sizeof(H_param) == fs );\n\n\n\tchar *buf;\n\trl_attempted_completion_function = my_completion;\n\tprintf(\"\\n\");\n\twhile((buf = readline(\">> hubo-ach: \"))!=NULL) {\n\t\/\/enable auto-complete\n\trl_bind_key('\\t',rl_complete);\n \n\/\/\tprintf(\"cmd [%s]\\n\",buf);\n\/\/\tprintf(\">> \");\n\tprintf(\" \");\n\n\t\/* get update after every command *\/\n\thubo_update(&H_ref, &H_state, &H_param);\n\n\n\tchar* buf0 = getArg(buf, 0);\n\t\/\/printf(buf0);\t\n\n\tif (strcmp(buf0,\"update\")==0) {\n\t\thubo_update(&H_ref, &H_state, &H_param);\n\t\tprintf(\"--->Hubo Information Updated\\n\");\n\t}\n\telse if (strcmp(buf0,\"get\")==0) {\n\t\tdouble jRef = hubo_get(buf,&H_ref, &H_param);\n\t\tchar* tmp = getArg(buf,1);\n\t\tprintf(\">> %s = %f rad \\n\",tmp,jRef);\n\t}\n\telse if (strcmp(buf0,\"beep\")==0) {\n\t\thubo_jmc_beep(&H_param, &H_init, buf);\n\t}\n\telse if (strcmp(buf0,\"home\")==0) {\n\t\thubo_jmc_home(&H_param, &H_init, buf);\n\t\tprintf(\"%s - Initilize \\n\",getArg(buf,1));\n\t}\n\telse if (strcmp(buf0,\"ctrl\")==0) {\n\t\tint onOrOff = atof(getArg(buf,2));\n if(onOrOff == 0 | onOrOff == 1) {\n H_init.cmd[0] = HUBO_CTRL_ON_OFF;\n H_init.cmd[1] = name2mot(getArg(buf,1),&H_param); \/\/ set motor num\n H_init.cmd[2] = atof(getArg(buf,2)); \/\/ 1 = on, 0 = 0ff\n r = ach_put( &chan_hubo_init_cmd, &H_init, sizeof(H_init) );\n if(onOrOff == 0) {\n printf(\"%s - Turning Off CTRL\\n\",getArg(buf,1));}\n else {\n printf(\"%s - Turning On CTRL\\n\",getArg(buf,1));}\n }\n\n\t}\n\telse if (strcmp(buf0,\"fet\")==0) {\n\t\tint onOrOff = atof(getArg(buf,2));\n\t\tif(onOrOff == 0 | onOrOff == 1) {\n\t\t\tH_init.cmd[0] = HUBO_FET_ON_OFF;\n\t\t\tH_init.cmd[1] = name2mot(getArg(buf,1),&H_param); \/\/ set motor num\n\t\t\tH_init.cmd[2] = atof(getArg(buf,2));\t\t\/\/ 1 = on, 0 = 0ff\n int r = ach_put( &chan_hubo_init_cmd, &H_init, sizeof(H_init) );\n\t\t\tif(onOrOff == 0) {\n\t\t\t\tprintf(\"%s - Turning Off FET\\n\",getArg(buf,1));}\n\t\t\telse {\n\t\t\t\tprintf(\"%s - Turning On FET\\n\",getArg(buf,1));}\n\t\t}\n\t}\n\telse if (strcmp(buf0,\"initialize\")==0) {\n\t\tH_init.cmd[0] = HUBO_JMC_INI;\n\t\tH_init.cmd[1] = name2mot(getArg(buf,1),&H_param);\t\/\/ set motor num\n\t\t\/\/C.val[0] = atof(getArg(buf,2));\n int r = ach_put( &chan_hubo_init_cmd, &H_init, sizeof(H_init) );\n\t\tprintf(\"%s - Initilize \\n\",getArg(buf,1));\n\t}\n\t\/* Quit *\/\n\telse if (strcmp(buf0,\"quit\")==0)\n\t\tbreak;\n\tif (buf[0]!=0)\n\tadd_history(buf);\n\t}\n \n\tfree(buf);\n \treturn 0;\n}\n\ndouble hubo_get(char*s, struct hubo_ref *h, struct hubo_param *p) {\n\n\t\/* get joint number *\/\n\tint jointNo = name2mot(getArg(s,1),p);\n\n\treturn h->ref[jointNo];\n}\n\nvoid hubo_jmc_beep(struct hubo_param *h, struct hubo_init_cmd *c, char* buff) {\n\t\/* make beiep *\/\n\tc->cmd[0] = HUBO_JMC_BEEP;\n\tc->cmd[1] = name2mot(getArg(buff, 1), h);\n\tc->val[2] = atof(getArg(buff,2));\n \tint r = ach_put( &chan_hubo_init_cmd, c, sizeof(*c) );\n\tprintf(\"send beep r = %i C = %i v = %f\\n\",r, c->cmd[0], c->val[0]);\n\n}\n\nvoid hubo_jmc_home(struct hubo_param *h, struct hubo_init_cmd *c, char* buff) {\n\t\/* make beiep *\/\n\tc->cmd[0] = HUBO_GOTO_HOME;\n\tc->cmd[1] = name2mot(getArg(buff, 1), h);\n \tint r = ach_put( &chan_hubo_init_cmd, c, sizeof(*c) );\n\/\/\tprintf(\">> Home %s \\n\",getArg(buff,1));\n}\n\nvoid hubo_update(struct hubo_ref *h_ref, struct hubo_state *h_state, struct hubo_param *h_param) {\n \tsize_t fs;\n \tint r = ach_get( &chan_hubo_ref, h_ref, sizeof(*h_ref), &fs, NULL, ACH_O_LAST );\n\tif((r == ACH_OK) | (r == ACH_MISSED_FRAME)) {\n\t \tassert( sizeof(*h_ref) == fs );}\n \tr = ach_get( &chan_hubo_state, h_state, sizeof(*h_state), &fs, NULL, ACH_O_LAST );\n\tif((r == ACH_OK) | (r == ACH_MISSED_FRAME)) {\n\t \tassert( sizeof(*h_state) == fs );}\n \tr = ach_get( &chan_hubo_param, h_param, sizeof(*h_param), &fs, NULL, ACH_O_LAST );\n\tif((r == ACH_OK) | (r == ACH_MISSED_FRAME)) {\n\t \tassert( sizeof(*h_param) == fs );}\n\t\/\/ look into posix message que\n\t\/\/ posix rt signal can give signal numb er and an interger\n}\n\n\nchar* getArg(string s, int argNum) {\n\/\/\tprintf(\"\\n dan test\\n\");\n\n\tistringstream iss(s);\n\t\n\tint i = 0;\n\/\/\tchar* theOut[];\n\tdo\n \t{\n \tstring sub;\n \tiss >> sub;\n \/\/ \tcout << \"Substring: \" << sub << endl;\n\t\tif( i == argNum ) {\n\t\t\treturn (char*)sub.c_str(); }\n\t\ti++;\n \t} while (iss);\n\n \treturn NULL;\n}\n\nint test(char* s, struct hubo_param *h) {\n\tprintf(\"\\n dan test\\n\");\n\n\tchar* mot = getArg(s,1);\n\n\tint tmp = name2mot(mot, h);\n\tprintf(\"mot = %i \\n\",tmp);\n\treturn 0;\n}\n\nint name2mot(char* name, struct hubo_param *h) {\n\t\/* Returns the number of the requested joint *\/\t\n\tint i = 0;\n\tint iout = -1;\n\tfor( i = 0; i < HUBO_JOINT_COUNT ; i++ ) {\n\t\t\tchar *mot = h->joint[i].name;\n\t\t\tif (strcmp(name, mot) == 0) {\n\/\/\t\t\t\tprintf(\"i = %i\\n\", i);\n\t\t\t\tiout = i;}\n\t}\n\treturn iout;\n}\n\n\n \nstatic char** my_completion( const char * text , int start, int end) {\n\tchar **matches;\n \n\tmatches = (char **)NULL;\n \n\tif (start == 0)\n\t\tmatches = rl_completion_matches ((char*)text, &my_generator);\n\telse\n\t\trl_bind_key('\\t',rl_abort);\n \n\treturn (matches);\n}\n \nchar* my_generator(const char* text, int state) {\n\tstatic int list_index, len;\n\tchar *name;\n \n\tif (!state) {\n\t\tlist_index = 0;\n\t\tlen = strlen (text);\n\t}\n \n\twhile (name = cmd[list_index]) {\n\t\tlist_index++;\n \n\tif (strncmp (name, text, len) == 0)\n\t\treturn (dupstr(name));\n\t}\n \n\t\/* If no names matched, then return NULL. *\/\n\treturn ((char *)NULL);\n}\n \nchar * dupstr (char* s) {\n\tchar *r;\n \n\tr = (char*) xmalloc ((strlen (s) + 1));\n\tstrcpy (r, s);\n\treturn (r);\n}\n \nvoid * xmalloc (int size) {\n\tvoid *buf;\n \n\tbuf = malloc (size);\n\tif (!buf) {\n\t\tfprintf (stderr, \"Error: Out of memory. Exiting.'n\");\n\t\texit (1);\n\t}\n\treturn buf;\n}\n<|endoftext|>"} {"text":"<commit_before>\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\n\/\/ Copyright (c) 2007-2013, Image Engine Design Inc. All rights reserved.\n\/\/\n\/\/ Redistribution and use in source and binary forms, with or without\n\/\/ modification, are permitted provided that the following conditions are\n\/\/ met:\n\/\/\n\/\/ * Redistributions of source code must retain the above copyright\n\/\/ notice, this list of conditions and the following disclaimer.\n\/\/\n\/\/ * Redistributions in binary form must reproduce the above copyright\n\/\/ notice, this list of conditions and the following disclaimer in the\n\/\/ documentation and\/or other materials provided with the distribution.\n\/\/\n\/\/ * Neither the name of Image Engine Design nor the names of any\n\/\/ other contributors to this software may be used to endorse or\n\/\/ promote products derived from this software without specific prior\n\/\/ written permission.\n\/\/\n\/\/ THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS \"AS\n\/\/ IS\" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO,\n\/\/ THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR\n\/\/ PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR\n\/\/ CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,\n\/\/ EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,\n\/\/ PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR\n\/\/ PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF\n\/\/ LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING\n\/\/ NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS\n\/\/ SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.\n\/\/\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n#include \"IECoreGL\/ShaderStateComponent.h\"\n\n#include \"IECoreGL\/CachedConverter.h\"\n#include \"IECoreGL\/Shader.h\"\n#include \"IECoreGL\/ShaderLoader.h\"\n#include \"IECoreGL\/Texture.h\"\n#include \"IECoreGL\/TextureLoader.h\"\n\n#include \"IECore\/MessageHandler.h\"\n#include \"IECore\/SplineData.h\"\n\n#include <iostream>\n\nusing namespace std;\nusing namespace IECore;\nusing namespace IECoreGL;\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ ShaderStateComponent::Implementation\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nclass ShaderStateComponent::Implementation : public IECore::RefCounted\n{\n\n\tpublic :\n\n\t\tImplementation()\n\t\t\t:\tm_shaderLoader( ShaderLoader::defaultShaderLoader() ), m_textureLoader( TextureLoader::defaultTextureLoader() ), m_fragmentSource( \"\" ), m_geometrySource( \"\" ), m_vertexSource( \"\" ),\n\t\t\t\tm_parameterMap( nullptr ), m_shaderSetup( nullptr )\n\t\t{\n\t\t\tinitHash();\n\t\t}\n\n\t\tImplementation( ShaderLoaderPtr shaderLoader, TextureLoaderPtr textureLoader, const std::string &vertexSource, const std::string &geometrySource, const std::string &fragmentSource, IECore::ConstCompoundObjectPtr parameterValues )\n\t\t\t:\tm_shaderLoader( shaderLoader ), m_textureLoader( textureLoader ), m_fragmentSource( fragmentSource ), m_geometrySource( geometrySource ),\n\t\t\t\tm_vertexSource( vertexSource ), m_parameterMap( parameterValues->copy() ), m_shaderSetup( nullptr )\n\t\t{\n\t\t\tinitHash();\n\t\t}\n\n\t\tShaderLoader *shaderLoader()\n\t\t{\n\t\t\treturn m_shaderLoader.get();\n\t\t}\n\n\t\tTextureLoader *textureLoader()\n\t\t{\n\t\t\treturn m_textureLoader.get();\n\t\t}\n\n\t\tIECore::MurmurHash hash() const\n\t\t{\n\t\t\treturn m_hash;\n\t\t}\n\n\t\tShader::Setup *shaderSetup()\n\t\t{\n\t\t\tensureShaderSetup();\n\t\t\treturn m_shaderSetup.get();\n\t\t}\n\n\t\tconst Shader::Setup *shaderSetup() const\n\t\t{\n\t\t\tensureShaderSetup();\n\t\t\treturn m_shaderSetup.get();\n\t\t}\n\n\t\tvoid addParametersToShaderSetup( Shader::Setup *shaderSetup ) const\n\t\t{\n\t\t\tif( !m_parameterMap )\n\t\t\t{\n\t\t\t\treturn;\n\t\t\t}\n\t\t\tconst IECore::CompoundObject::ObjectMap &d = m_parameterMap->members();\n\t\t\tfor( IECore::CompoundObject::ObjectMap::const_iterator it = d.begin(), eIt = d.end(); it != eIt; it++ )\n\t\t\t{\n\t\t\t\tconst Shader::Parameter *p = shaderSetup->shader()->uniformParameter( it->first );\n\t\t\t\tif( !p )\n\t\t\t\t{\n\t\t\t\t\tcontinue;\n\t\t\t\t}\n\n\t\t\t\tif( p->type == GL_SAMPLER_2D )\n\t\t\t\t{\n\t\t\t\t\tConstTexturePtr texture = nullptr;\n\t\t\t\t\tif(\n\t\t\t\t\t\tit->second->typeId() == (IECore::TypeId)IECoreImage::ImagePrimitiveTypeId ||\n\t\t\t\t\t\tit->second->typeId() == IECore::CompoundDataTypeId ||\n\t\t\t\t\t\tit->second->typeId() == IECore::SplineffData::staticTypeId() ||\n\t\t\t\t\t\tit->second->typeId() == IECore::SplinefColor3fData::staticTypeId()\n\t\t\t\t\t)\n\t\t\t\t\t{\n\t\t\t\t\t\ttexture = IECore::runTimeCast<const Texture>( CachedConverter::defaultCachedConverter()->convert( it->second.get() ) );\n\t\t\t\t\t}\n\t\t\t\t\telse if( it->second->typeId() == IECore::StringData::staticTypeId() )\n\t\t\t\t\t{\n\t\t\t\t\t\tconst std::string &fileName = static_cast<const IECore::StringData *>( it->second.get() )->readable();\n\t\t\t\t\t\tif( fileName!=\"\" )\n\t\t\t\t\t\t{\n\t\t\t\t\t\t\ttexture = m_textureLoader->load( fileName );\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\n\t\t\t\t\tshaderSetup->addUniformParameter( it->first.value(), texture );\n\t\t\t\t}\n\t\t\t\telse if( it->second->isInstanceOf( IECore::DataTypeId ) )\n\t\t\t\t{\n\t\t\t\t\tshaderSetup->addUniformParameter( it->first.value(), boost::static_pointer_cast<const IECore::Data>( it->second ) );\n\t\t\t\t}\n\t\t\t}\n\n\t\t}\n\n\tprivate :\n\n\t\tShaderLoaderPtr m_shaderLoader;\n\t\tTextureLoaderPtr m_textureLoader;\n\t\tstd::string m_fragmentSource;\n\t\tstd::string m_geometrySource;\n\t\tstd::string m_vertexSource;\n\t\tIECore::CompoundObjectPtr m_parameterMap;\n\t\tIECore::MurmurHash m_hash;\n\t\tmutable Shader::SetupPtr m_shaderSetup;\n\n\t\tvoid initHash()\n\t\t{\n\t\t\tm_hash.append( m_fragmentSource );\n\t\t\tm_hash.append( m_geometrySource );\n\t\t\tm_hash.append( m_vertexSource );\n\t\t\tif( m_parameterMap )\n\t\t\t{\n\t\t\t\tm_parameterMap->hash( m_hash );\n\t\t\t}\n\t\t}\n\n\t\tvoid ensureShaderSetup() const\n\t\t{\n\t\t\tif( m_shaderSetup )\n\t\t\t{\n\t\t\t\treturn;\n\t\t\t}\n\n\t\t\tif( !m_parameterMap )\n\t\t\t{\n\t\t\t\t\/\/ we were default constructed, so we're just a facing ratio shader.\n\t\t\t\tm_shaderSetup = new Shader::Setup( Shader::facingRatio() );\n\t\t\t\treturn;\n\t\t\t}\n\n\t\t\t\/\/ load a shader, create a setup, and add our parameters to it.\n\t\t\tShaderPtr shader = m_shaderLoader->create( m_vertexSource, m_geometrySource, m_fragmentSource );\n\t\t\tm_shaderSetup = new Shader::Setup( shader );\n\n\t\t\taddParametersToShaderSetup( m_shaderSetup.get() );\n\t\t}\n\n};\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ ShaderStateComponent\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nStateComponent::Description<ShaderStateComponent> ShaderStateComponent::g_description;\n\nShaderStateComponent::ShaderStateComponent()\n\t:\tm_implementation( new Implementation() )\n{\n}\n\nShaderStateComponent::ShaderStateComponent( ShaderLoaderPtr shaderLoader, TextureLoaderPtr textureLoader, const std::string &vertexSource, const std::string &geometrySource, const std::string &fragmentSource, IECore::ConstCompoundObjectPtr parameterValues )\n\t:\tm_implementation( new Implementation( shaderLoader, textureLoader, vertexSource, geometrySource, fragmentSource, parameterValues ) )\n{\n}\n\nShaderStateComponent::~ShaderStateComponent()\n{\n}\n\nvoid ShaderStateComponent::bind() const\n{\n}\n\nShaderLoader *ShaderStateComponent::shaderLoader()\n{\n\treturn m_implementation->shaderLoader();\n}\n\nTextureLoader *ShaderStateComponent::textureLoader()\n{\n\treturn m_implementation->textureLoader();\n}\n\nIECore::MurmurHash ShaderStateComponent::hash() const\n{\n\treturn m_implementation->hash();\n}\n\nShader::Setup *ShaderStateComponent::shaderSetup()\n{\n\treturn m_implementation->shaderSetup();\n}\n\nconst Shader::Setup *ShaderStateComponent::shaderSetup() const\n{\n\treturn m_implementation->shaderSetup();\n}\n\nvoid ShaderStateComponent::addParametersToShaderSetup( Shader::Setup *shaderSetup ) const\n{\n\tm_implementation->addParametersToShaderSetup( shaderSetup );\n}\n<commit_msg>ShaderStateComponent : support convention for limiting texture resolution<commit_after>\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\n\/\/ Copyright (c) 2007-2013, Image Engine Design Inc. All rights reserved.\n\/\/\n\/\/ Redistribution and use in source and binary forms, with or without\n\/\/ modification, are permitted provided that the following conditions are\n\/\/ met:\n\/\/\n\/\/ * Redistributions of source code must retain the above copyright\n\/\/ notice, this list of conditions and the following disclaimer.\n\/\/\n\/\/ * Redistributions in binary form must reproduce the above copyright\n\/\/ notice, this list of conditions and the following disclaimer in the\n\/\/ documentation and\/or other materials provided with the distribution.\n\/\/\n\/\/ * Neither the name of Image Engine Design nor the names of any\n\/\/ other contributors to this software may be used to endorse or\n\/\/ promote products derived from this software without specific prior\n\/\/ written permission.\n\/\/\n\/\/ THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS \"AS\n\/\/ IS\" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO,\n\/\/ THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR\n\/\/ PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR\n\/\/ CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,\n\/\/ EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,\n\/\/ PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR\n\/\/ PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF\n\/\/ LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING\n\/\/ NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS\n\/\/ SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.\n\/\/\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n#include \"IECoreGL\/ShaderStateComponent.h\"\n\n#include \"IECoreGL\/CachedConverter.h\"\n#include \"IECoreGL\/Shader.h\"\n#include \"IECoreGL\/ShaderLoader.h\"\n#include \"IECoreGL\/Texture.h\"\n#include \"IECoreGL\/TextureLoader.h\"\n\n#include \"IECore\/MessageHandler.h\"\n#include \"IECore\/SplineData.h\"\n\n#include \"boost\/algorithm\/string.hpp\"\n\n#include <iostream>\n\nusing namespace std;\nusing namespace IECore;\nusing namespace IECoreGL;\n\nnamespace\n{\n\nconst InternedString g_maxTextureResolutionParameterSuffix( \":maxResolution\" );\n\n} \/\/ namespace\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ ShaderStateComponent::Implementation\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nclass ShaderStateComponent::Implementation : public IECore::RefCounted\n{\n\n\tpublic :\n\n\t\tImplementation()\n\t\t\t:\tm_shaderLoader( ShaderLoader::defaultShaderLoader() ), m_textureLoader( TextureLoader::defaultTextureLoader() ), m_fragmentSource( \"\" ), m_geometrySource( \"\" ), m_vertexSource( \"\" ),\n\t\t\t\tm_parameterMap( nullptr ), m_shaderSetup( nullptr )\n\t\t{\n\t\t\tinitHash();\n\t\t}\n\n\t\tImplementation( ShaderLoaderPtr shaderLoader, TextureLoaderPtr textureLoader, const std::string &vertexSource, const std::string &geometrySource, const std::string &fragmentSource, IECore::ConstCompoundObjectPtr parameterValues )\n\t\t\t:\tm_shaderLoader( shaderLoader ), m_textureLoader( textureLoader ), m_fragmentSource( fragmentSource ), m_geometrySource( geometrySource ),\n\t\t\t\tm_vertexSource( vertexSource ), m_parameterMap( parameterValues->copy() ), m_shaderSetup( nullptr )\n\t\t{\n\t\t\tinitHash();\n\t\t}\n\n\t\tShaderLoader *shaderLoader()\n\t\t{\n\t\t\treturn m_shaderLoader.get();\n\t\t}\n\n\t\tTextureLoader *textureLoader()\n\t\t{\n\t\t\treturn m_textureLoader.get();\n\t\t}\n\n\t\tIECore::MurmurHash hash() const\n\t\t{\n\t\t\treturn m_hash;\n\t\t}\n\n\t\tShader::Setup *shaderSetup()\n\t\t{\n\t\t\tensureShaderSetup();\n\t\t\treturn m_shaderSetup.get();\n\t\t}\n\n\t\tconst Shader::Setup *shaderSetup() const\n\t\t{\n\t\t\tensureShaderSetup();\n\t\t\treturn m_shaderSetup.get();\n\t\t}\n\n\t\tvoid addParametersToShaderSetup( Shader::Setup *shaderSetup ) const\n\t\t{\n\t\t\tif( !m_parameterMap )\n\t\t\t{\n\t\t\t\treturn;\n\t\t\t}\n\t\t\tconst IECore::CompoundObject::ObjectMap &d = m_parameterMap->members();\n\t\t\tfor( IECore::CompoundObject::ObjectMap::const_iterator it = d.begin(), eIt = d.end(); it != eIt; it++ )\n\t\t\t{\n\t\t\t\t\/\/ We're skipping parameters that are intended as metadata that describes textures\n\t\t\t\tif( boost::ends_with( it->first.c_str(), g_maxTextureResolutionParameterSuffix.c_str() ) )\n\t\t\t\t{\n\t\t\t\t\tcontinue;\n\t\t\t\t}\n\n\t\t\t\tconst Shader::Parameter *p = shaderSetup->shader()->uniformParameter( it->first );\n\t\t\t\tif( !p )\n\t\t\t\t{\n\t\t\t\t\tcontinue;\n\t\t\t\t}\n\n\t\t\t\tif( p->type == GL_SAMPLER_2D )\n\t\t\t\t{\n\t\t\t\t\tConstTexturePtr texture = nullptr;\n\t\t\t\t\tif(\n\t\t\t\t\t\tit->second->typeId() == (IECore::TypeId)IECoreImage::ImagePrimitiveTypeId ||\n\t\t\t\t\t\tit->second->typeId() == IECore::CompoundDataTypeId ||\n\t\t\t\t\t\tit->second->typeId() == IECore::SplineffData::staticTypeId() ||\n\t\t\t\t\t\tit->second->typeId() == IECore::SplinefColor3fData::staticTypeId()\n\t\t\t\t\t)\n\t\t\t\t\t{\n\t\t\t\t\t\ttexture = IECore::runTimeCast<const Texture>( CachedConverter::defaultCachedConverter()->convert( it->second.get() ) );\n\t\t\t\t\t}\n\t\t\t\t\telse if( it->second->typeId() == IECore::StringData::staticTypeId() )\n\t\t\t\t\t{\n\t\t\t\t\t\tconst std::string &fileName = static_cast<const IECore::StringData *>( it->second.get() )->readable();\n\t\t\t\t\t\tif( fileName!=\"\" )\n\t\t\t\t\t\t{\n\t\t\t\t\t\t\t\/\/ A parameter whose name is the texture parameter's\n\t\t\t\t\t\t\t\/\/ name followed by the suffix for maximum texture\n\t\t\t\t\t\t\t\/\/ resolution is interpreted as such and limits the\n\t\t\t\t\t\t\t\/\/ resolution of the respective texture.\n\t\t\t\t\t\t\tstd::string maxResolutionParameter( it->first.string() + g_maxTextureResolutionParameterSuffix.string() );\n\t\t\t\t\t\t\tconst IntData *maxResolutionData = m_parameterMap->member<IntData>( maxResolutionParameter );\n\n\t\t\t\t\t\t\ttexture = m_textureLoader->load( fileName, maxResolutionData ? maxResolutionData->readable() : std::numeric_limits<int>::max() );\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\n\t\t\t\t\tshaderSetup->addUniformParameter( it->first.value(), texture );\n\t\t\t\t}\n\t\t\t\telse if( it->second->isInstanceOf( IECore::DataTypeId ) )\n\t\t\t\t{\n\t\t\t\t\tshaderSetup->addUniformParameter( it->first.value(), boost::static_pointer_cast<const IECore::Data>( it->second ) );\n\t\t\t\t}\n\t\t\t}\n\n\t\t}\n\n\tprivate :\n\n\t\tShaderLoaderPtr m_shaderLoader;\n\t\tTextureLoaderPtr m_textureLoader;\n\t\tstd::string m_fragmentSource;\n\t\tstd::string m_geometrySource;\n\t\tstd::string m_vertexSource;\n\t\tIECore::CompoundObjectPtr m_parameterMap;\n\t\tIECore::MurmurHash m_hash;\n\t\tmutable Shader::SetupPtr m_shaderSetup;\n\n\t\tvoid initHash()\n\t\t{\n\t\t\tm_hash.append( m_fragmentSource );\n\t\t\tm_hash.append( m_geometrySource );\n\t\t\tm_hash.append( m_vertexSource );\n\t\t\tif( m_parameterMap )\n\t\t\t{\n\t\t\t\tm_parameterMap->hash( m_hash );\n\t\t\t}\n\t\t}\n\n\t\tvoid ensureShaderSetup() const\n\t\t{\n\t\t\tif( m_shaderSetup )\n\t\t\t{\n\t\t\t\treturn;\n\t\t\t}\n\n\t\t\tif( !m_parameterMap )\n\t\t\t{\n\t\t\t\t\/\/ we were default constructed, so we're just a facing ratio shader.\n\t\t\t\tm_shaderSetup = new Shader::Setup( Shader::facingRatio() );\n\t\t\t\treturn;\n\t\t\t}\n\n\t\t\t\/\/ load a shader, create a setup, and add our parameters to it.\n\t\t\tShaderPtr shader = m_shaderLoader->create( m_vertexSource, m_geometrySource, m_fragmentSource );\n\t\t\tm_shaderSetup = new Shader::Setup( shader );\n\n\t\t\taddParametersToShaderSetup( m_shaderSetup.get() );\n\t\t}\n\n};\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ ShaderStateComponent\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nStateComponent::Description<ShaderStateComponent> ShaderStateComponent::g_description;\n\nShaderStateComponent::ShaderStateComponent()\n\t:\tm_implementation( new Implementation() )\n{\n}\n\nShaderStateComponent::ShaderStateComponent( ShaderLoaderPtr shaderLoader, TextureLoaderPtr textureLoader, const std::string &vertexSource, const std::string &geometrySource, const std::string &fragmentSource, IECore::ConstCompoundObjectPtr parameterValues )\n\t:\tm_implementation( new Implementation( shaderLoader, textureLoader, vertexSource, geometrySource, fragmentSource, parameterValues ) )\n{\n}\n\nShaderStateComponent::~ShaderStateComponent()\n{\n}\n\nvoid ShaderStateComponent::bind() const\n{\n}\n\nShaderLoader *ShaderStateComponent::shaderLoader()\n{\n\treturn m_implementation->shaderLoader();\n}\n\nTextureLoader *ShaderStateComponent::textureLoader()\n{\n\treturn m_implementation->textureLoader();\n}\n\nIECore::MurmurHash ShaderStateComponent::hash() const\n{\n\treturn m_implementation->hash();\n}\n\nShader::Setup *ShaderStateComponent::shaderSetup()\n{\n\treturn m_implementation->shaderSetup();\n}\n\nconst Shader::Setup *ShaderStateComponent::shaderSetup() const\n{\n\treturn m_implementation->shaderSetup();\n}\n\nvoid ShaderStateComponent::addParametersToShaderSetup( Shader::Setup *shaderSetup ) const\n{\n\tm_implementation->addParametersToShaderSetup( shaderSetup );\n}\n<|endoftext|>"} {"text":"<commit_before>\/\/\n\/\/ Copyright (C) 2015 Clifford Wolf <clifford@clifford.at>\n\/\/\n\/\/ Permission to use, copy, modify, and\/or distribute this software for any\n\/\/ purpose with or without fee is hereby granted, provided that the above\n\/\/ copyright notice and this permission notice appear in all copies.\n\/\/\n\/\/ THE SOFTWARE IS PROVIDED \"AS IS\" AND THE AUTHOR DISCLAIMS ALL WARRANTIES\n\/\/ WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF\n\/\/ MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR\n\/\/ ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES\n\/\/ WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN\n\/\/ ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF\n\/\/ OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE.\n\/\/\n\n#include <stdio.h>\n#include <stdlib.h>\n#include <unistd.h>\n#include <string.h>\n#include <math.h>\n\nconst char *binstr(int v, int n)\n{\n\tstatic char buffer[16];\n\tchar *p = buffer;\n\n\tfor (int i = n-1; i >= 0; i--)\n\t\t*(p++) = ((v >> i) & 1) ? '1' : '0';\n\t*(p++) = 0;\n\n\treturn buffer;\n}\n\nvoid help(const char *cmd)\n{\n\tprintf(\"\\n\");\n\tprintf(\"Usage: %s [options]\\n\", cmd);\n\tprintf(\"\\n\");\n\tprintf(\" -i <input_freq_mhz>\\n\");\n\tprintf(\" PLL Input Frequency (default: 12 MHz)\\n\");\n\tprintf(\"\\n\");\n\tprintf(\" -o <output_freq_mhz>\\n\");\n\tprintf(\" PLL Output Frequency (default: 60 MHz)\\n\");\n\tprintf(\"\\n\");\n\tprintf(\" -S\\n\");\n\tprintf(\" Disable SIMPLE feedback path mode\\n\");\n\tprintf(\"\\n\");\n\tprintf(\" -q\\n\");\n\tprintf(\" Do not print PLL settings to stdout\\n\");\n\tprintf(\"\\n\");\n\texit(1);\n}\n\nint main(int argc, char **argv)\n{\n\tdouble f_pllin = 12;\n\tdouble f_pllout = 60;\n\tbool simple_feedback = true;\n\tbool quiet = false;\n\n\tint opt;\n\twhile ((opt = getopt(argc, argv, \"i:o:S:q\")) != -1)\n\t{\n\t\tswitch (opt)\n\t\t{\n\t\tcase 'i':\n\t\t\tf_pllin = atof(optarg);\n\t\t\tbreak;\n\t\tcase 'o':\n\t\t\tf_pllout = atof(optarg);\n\t\t\tbreak;\n\t\tcase 'S':\n\t\t\tsimple_feedback = false;\n\t\t\tbreak;\n\t\tcase 'q':\n\t\t\tquiet = true;\n\t\t\tbreak;\n\t\tdefault:\n\t\t\thelp(argv[0]);\n\t\t}\n\t}\n\n\tif (optind != argc)\n\t\thelp(argv[0]);\n\n\tbool found_something = false;\n\tdouble best_fout = 0;\n\tint best_divr = 0;\n\tint best_divf = 0;\n\tint best_divq = 0;\n\n\tif (f_pllin < 10 || f_pllin > 133) {\n\t\tfprintf(stderr, \"Error: PLL input frequency %.3f MHz is outside range 10 MHz - 133 MHz!\\n\", f_pllin);\n\t\texit(1);\n\t}\n\n\tif (f_pllout < 16 || f_pllout > 275) {\n\t\tfprintf(stderr, \"Error: PLL output frequency %.3f MHz is outside range 16 MHz - 275 MHz!\\n\", f_pllout);\n\t\texit(1);\n\t}\n\n\tfor (int divr = 0; divr <= 15; divr++)\n\t{\n\t\tdouble f_pfd = f_pllin \/ (divr + 1);\n\t\tif (f_pfd < 10 || f_pfd > 133) continue;\n\n\t\tfor (int divf = 0; divf <= 63; divf++)\n\t\t{\n\t\t\tif (simple_feedback)\n\t\t\t{\n\t\t\t\tdouble f_vco = f_pfd * (divf + 1);\n\t\t\t\tif (f_vco < 533 || f_vco > 1066) continue;\n\n\t\t\t\tfor (int divq = 1; divq <= 6; divq++)\n\t\t\t\t{\n\t\t\t\t\tdouble fout = f_vco * exp2(-divq);\n\n\t\t\t\t\tif (fabs(fout - f_pllout) < fabs(best_fout - f_pllout) || !found_something) {\n\t\t\t\t\t\tbest_fout = fout;\n\t\t\t\t\t\tbest_divr = divr;\n\t\t\t\t\t\tbest_divf = divf;\n\t\t\t\t\t\tbest_divq = divq;\n\t\t\t\t\t\tfound_something = true;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\tfor (int divq = 1; divq <= 6; divq++)\n\t\t\t\t{\n\t\t\t\t\tdouble f_vco = f_pfd * (divf + 1) * exp2(divq);\n\t\t\t\t\tif (f_vco < 533 || f_vco > 1066) continue;\n\n\t\t\t\t\tdouble fout = f_vco * exp2(-divq);\n\n\t\t\t\t\tif (fabs(fout - f_pllout) < fabs(best_fout - f_pllout) || !found_something) {\n\t\t\t\t\t\tbest_fout = fout;\n\t\t\t\t\t\tbest_divr = divr;\n\t\t\t\t\t\tbest_divf = divf;\n\t\t\t\t\t\tbest_divq = divq;\n\t\t\t\t\t\tfound_something = true;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\n\tdouble f_pfd = f_pllin \/ (best_divr + 1);;\n\tdouble f_vco = f_pfd * (best_divf + 1);\n\n\tint filter_range =\n\t\t\tf_pfd < 17 ? 1 :\n\t\t\tf_pfd < 26 ? 2 :\n\t\t\tf_pfd < 44 ? 3 :\n\t\t\tf_pfd < 66 ? 4 :\n\t\t\tf_pfd < 101 ? 5 : 6;\n\n\tif (!simple_feedback)\n\t\tf_vco *= exp2(best_divq);\n\n\tif (!found_something) {\n\t\tfprintf(stderr, \"Error: No valid configuration found!\\n\");\n\t\texit(1);\n\t}\n\n\tif (!quiet)\n\t{\n\t\tprintf(\"\\n\");\n\n\t\tprintf(\"F_PLLIN: %8.3f MHz (given)\\n\", f_pllin);\n\t\tprintf(\"F_PLLOUT: %8.3f MHz (requested)\\n\", f_pllout);\n\t\tprintf(\"F_PLLOUT: %8.3f MHz (achieved)\\n\", best_fout);\n\n\t\tprintf(\"\\n\");\n\n\t\tprintf(\"FEEDBACK: %s\\n\", simple_feedback ? \"SIMPLE\" : \"NON_SIMPLE\");\n\t\tprintf(\"F_PFD: %8.3f MHz\\n\", f_pfd);\n\t\tprintf(\"F_VCO: %8.3f MHz\\n\", f_vco);\n\n\t\tprintf(\"\\n\");\n\n\t\tprintf(\"DIVR: %2d (4'b%s)\\n\", best_divr, binstr(best_divr, 4));\n\t\tprintf(\"DIVF: %2d (7'b%s)\\n\", best_divf, binstr(best_divf, 7));\n\t\tprintf(\"DIVQ: %2d (3'b%s)\\n\", best_divq, binstr(best_divq, 3));\n\n\t\tprintf(\"\\n\");\n\n\t\tprintf(\"FILTER_RANGE: %d (3'b%s)\\n\", filter_range, binstr(filter_range, 3));\n\n\t\tprintf(\"\\n\");\n\t}\n\n\treturn 0;\n}\n<commit_msg>icepll: added -f option to export configuration as Verilog module<commit_after>\/\/\n\/\/ Copyright (C) 2015 Clifford Wolf <clifford@clifford.at>\n\/\/\n\/\/ Permission to use, copy, modify, and\/or distribute this software for any\n\/\/ purpose with or without fee is hereby granted, provided that the above\n\/\/ copyright notice and this permission notice appear in all copies.\n\/\/\n\/\/ THE SOFTWARE IS PROVIDED \"AS IS\" AND THE AUTHOR DISCLAIMS ALL WARRANTIES\n\/\/ WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF\n\/\/ MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR\n\/\/ ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES\n\/\/ WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN\n\/\/ ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF\n\/\/ OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE.\n\/\/\n\n#include <stdio.h>\n#include <stdlib.h>\n#include <unistd.h>\n#include <string.h>\n#include <math.h>\n\nconst char *binstr(int v, int n)\n{\n\tstatic char buffer[16];\n\tchar *p = buffer;\n\n\tfor (int i = n-1; i >= 0; i--)\n\t\t*(p++) = ((v >> i) & 1) ? '1' : '0';\n\t*(p++) = 0;\n\n\treturn buffer;\n}\n\nvoid help(const char *cmd)\n{\n\tprintf(\"\\n\");\n\tprintf(\"Usage: %s [options]\\n\", cmd);\n\tprintf(\"\\n\");\n\tprintf(\" -i <input_freq_mhz>\\n\");\n\tprintf(\" PLL Input Frequency (default: 12 MHz)\\n\");\n\tprintf(\"\\n\");\n\tprintf(\" -o <output_freq_mhz>\\n\");\n\tprintf(\" PLL Output Frequency (default: 60 MHz)\\n\");\n\tprintf(\"\\n\");\n\tprintf(\" -S\\n\");\n\tprintf(\" Disable SIMPLE feedback path mode\\n\");\n\tprintf(\"\\n\");\n\tprintf(\" -f <filename.v>\\n\");\n\tprintf(\" Save PLL configuration as Verilog module\\n\");\n\tprintf(\"\\n\");\n\tprintf(\" -q\\n\");\n\tprintf(\" Do not print PLL configuration to stdout\\n\");\n\tprintf(\"\\n\");\n\texit(1);\n}\n\nint main(int argc, char **argv)\n{\n\tdouble f_pllin = 12;\n\tdouble f_pllout = 60;\n\tbool simple_feedback = true;\n\tchar* verilog_filename = NULL;\n\tbool quiet = false;\n\n\tint opt;\n\twhile ((opt = getopt(argc, argv, \"i:o:S:f:q\")) != -1)\n\t{\n\t\tswitch (opt)\n\t\t{\n\t\tcase 'i':\n\t\t\tf_pllin = atof(optarg);\n\t\t\tbreak;\n\t\tcase 'o':\n\t\t\tf_pllout = atof(optarg);\n\t\t\tbreak;\n\t\tcase 'S':\n\t\t\tsimple_feedback = false;\n\t\t\tbreak;\n\t\tcase 'f':\n\t\t\tverilog_filename = optarg;\n\t\t\tbreak;\n\t\tcase 'q':\n\t\t\tquiet = true;\n\t\t\tbreak;\n\t\tdefault:\n\t\t\thelp(argv[0]);\n\t\t}\n\t}\n\n\tif (optind != argc)\n\t\thelp(argv[0]);\n\n\tbool found_something = false;\n\tdouble best_fout = 0;\n\tint best_divr = 0;\n\tint best_divf = 0;\n\tint best_divq = 0;\n\n\tif (f_pllin < 10 || f_pllin > 133) {\n\t\tfprintf(stderr, \"Error: PLL input frequency %.3f MHz is outside range 10 MHz - 133 MHz!\\n\", f_pllin);\n\t\texit(1);\n\t}\n\n\tif (f_pllout < 16 || f_pllout > 275) {\n\t\tfprintf(stderr, \"Error: PLL output frequency %.3f MHz is outside range 16 MHz - 275 MHz!\\n\", f_pllout);\n\t\texit(1);\n\t}\n\n\tfor (int divr = 0; divr <= 15; divr++)\n\t{\n\t\tdouble f_pfd = f_pllin \/ (divr + 1);\n\t\tif (f_pfd < 10 || f_pfd > 133) continue;\n\n\t\tfor (int divf = 0; divf <= 63; divf++)\n\t\t{\n\t\t\tif (simple_feedback)\n\t\t\t{\n\t\t\t\tdouble f_vco = f_pfd * (divf + 1);\n\t\t\t\tif (f_vco < 533 || f_vco > 1066) continue;\n\n\t\t\t\tfor (int divq = 1; divq <= 6; divq++)\n\t\t\t\t{\n\t\t\t\t\tdouble fout = f_vco * exp2(-divq);\n\n\t\t\t\t\tif (fabs(fout - f_pllout) < fabs(best_fout - f_pllout) || !found_something) {\n\t\t\t\t\t\tbest_fout = fout;\n\t\t\t\t\t\tbest_divr = divr;\n\t\t\t\t\t\tbest_divf = divf;\n\t\t\t\t\t\tbest_divq = divq;\n\t\t\t\t\t\tfound_something = true;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\tfor (int divq = 1; divq <= 6; divq++)\n\t\t\t\t{\n\t\t\t\t\tdouble f_vco = f_pfd * (divf + 1) * exp2(divq);\n\t\t\t\t\tif (f_vco < 533 || f_vco > 1066) continue;\n\n\t\t\t\t\tdouble fout = f_vco * exp2(-divq);\n\n\t\t\t\t\tif (fabs(fout - f_pllout) < fabs(best_fout - f_pllout) || !found_something) {\n\t\t\t\t\t\tbest_fout = fout;\n\t\t\t\t\t\tbest_divr = divr;\n\t\t\t\t\t\tbest_divf = divf;\n\t\t\t\t\t\tbest_divq = divq;\n\t\t\t\t\t\tfound_something = true;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\n\tdouble f_pfd = f_pllin \/ (best_divr + 1);;\n\tdouble f_vco = f_pfd * (best_divf + 1);\n\n\tint filter_range =\n\t\t\tf_pfd < 17 ? 1 :\n\t\t\tf_pfd < 26 ? 2 :\n\t\t\tf_pfd < 44 ? 3 :\n\t\t\tf_pfd < 66 ? 4 :\n\t\t\tf_pfd < 101 ? 5 : 6;\n\n\tif (!simple_feedback)\n\t\tf_vco *= exp2(best_divq);\n\n\tif (!found_something) {\n\t\tfprintf(stderr, \"Error: No valid configuration found!\\n\");\n\t\texit(1);\n\t}\n\n\tif (!quiet)\n\t{\n\t\tprintf(\"\\n\");\n\n\t\tprintf(\"F_PLLIN: %8.3f MHz (given)\\n\", f_pllin);\n\t\tprintf(\"F_PLLOUT: %8.3f MHz (requested)\\n\", f_pllout);\n\t\tprintf(\"F_PLLOUT: %8.3f MHz (achieved)\\n\", best_fout);\n\n\t\tprintf(\"\\n\");\n\n\t\tprintf(\"FEEDBACK: %s\\n\", simple_feedback ? \"SIMPLE\" : \"NON_SIMPLE\");\n\t\tprintf(\"F_PFD: %8.3f MHz\\n\", f_pfd);\n\t\tprintf(\"F_VCO: %8.3f MHz\\n\", f_vco);\n\n\t\tprintf(\"\\n\");\n\n\t\tprintf(\"DIVR: %2d (4'b%s)\\n\", best_divr, binstr(best_divr, 4));\n\t\tprintf(\"DIVF: %2d (7'b%s)\\n\", best_divf, binstr(best_divf, 7));\n\t\tprintf(\"DIVQ: %2d (3'b%s)\\n\", best_divq, binstr(best_divq, 3));\n\n\t\tprintf(\"\\n\");\n\n\t\tprintf(\"FILTER_RANGE: %d (3'b%s)\\n\", filter_range, binstr(filter_range, 3));\n\n\t\tprintf(\"\\n\");\n\t}\n\n\tif (verilog_filename != NULL)\n\t{\n\t\t\/\/ open file for writing\n\t\tFILE *f;\n\t\tf = fopen(verilog_filename, \"w\");\n\n\t\t\/\/ header\n\t\tfprintf(f, \"\/**\\n * PLL configuration\\n *\\n\"\n\t\t\t\t\t\" * This Verilog source file was generated automatically\\n\"\n\t\t\t\t\t\" * using the icepll tool from the IceStorm project.\\n\"\n\t\t\t\t\t\" * Use at your own risk.\\n\"\n\t\t\t\t\t\" *\\n\"\n\t\t\t\t\t\" * Given input frequency: %8.3f MHz\\n\"\n\t\t\t\t\t\" * Requested output frequency: %8.3f MHz\\n\"\n\t\t\t\t\t\" * Achieved output frequency: %8.3f MHz\\n\"\n\t\t\t\t\t\" *\/\\n\\n\",\n\t\t\t\t\tf_pllin, f_pllout, best_fout);\n\n\t\t\/\/ generate Verilog module\n\t\tfprintf(f, \"module pll(\\n\"\n\t\t\t\t\t\"\\tinput clock_in,\\n\"\n\t\t\t\t\t\"\\toutput clock_out,\\n\"\n\t\t\t\t\t\"\\toutput locked\\n\"\n\t\t\t\t\t\"\\t)\\n\\n\"\n\t\t\t\t);\n\n\t\t\/\/ save iCE40 PLL tile configuration\n\t\tfprintf(f, \"SB_PLL40_CORE #(\\n\");\n\t\tfprintf(f, \"\\t\\t.FEEDBACK_PATH(\\\"%s\\\"),\\n\", (simple_feedback ? \"SIMPLE\" : \"NON_SIMPLE\"));\n\t\tfprintf(f, \"\\t\\t.PLLOUT_SELECT(\\\"GENCLK\\\"),\\n\");\n\t\tfprintf(f, \"\\t\\t.DIVR(4'b%s),\\n\", binstr(best_divr, 4));\n\t\tfprintf(f, \"\\t\\t.DIVF(7'b%s),\\n\", binstr(best_divf, 7));\n\t\tfprintf(f, \"\\t\\t.DIVQ(3'b%s),\\n\", binstr(best_divq, 3));\n\t\tfprintf(f, \"\\t\\t.FILTER_RANGE(3'b%s),\\n\", binstr(filter_range, 3));\n\t\tfprintf(f, \"\\t) uut (\\n\"\n\t\t\t\t\t\"\\t\\t.LOCK(locked),\\n\"\n\t\t\t\t\t\"\\t\\t.RESETB(1'b1),\\n\"\n\t\t\t\t\t\"\\t\\t.BYPASS(1'b0),\\n\"\n\t\t\t\t\t\"\\t\\t.REFERENCECLK(clock_in),\\n\"\n\t\t\t\t\t\"\\t\\t.PLLOUTCORE(clock_out),\\n\"\n\t\t\t\t\t\"\\t\\t);\\n\\n\"\n\t\t\t\t);\n\n\t\tfprintf(f, \"endmodule\\n\");\n\t\tfclose(f);\n\n\t\tprintf(\"PLL configuration written to: %s\\n\", verilog_filename);\n\t}\n\n\treturn 0;\n}\n<|endoftext|>"} {"text":"<commit_before>\/***************************************************************************\n * Copyright (c) Victor Titov (DeepSOIC) *\n * (vv.titov@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#ifndef _PreComp_\n#endif\n\n#include \"AttachableObject.h\"\n\n#include <Base\/Console.h>\n#include <App\/Application.h>\n\n\n\nusing namespace Part;\nusing namespace Attacher;\n\nPROPERTY_SOURCE(Part::AttachableObject, Part::Feature);\n\nAttachableObject::AttachableObject()\n : _attacher(0)\n{\n ADD_PROPERTY_TYPE(Support, (0,0), \"Attachment\",(App::PropertyType)(App::Prop_None),\"Support of the 2D geometry\");\n\n ADD_PROPERTY_TYPE(MapMode, (mmDeactivated), \"Attachment\", App::Prop_None, \"Mode of attachment to other object\");\n MapMode.setEnums(AttachEngine::eMapModeStrings);\n \/\/a rough test if mode string list in Attacher.cpp is in sync with eMapMode enum.\n assert(MapMode.getEnumVector().size() == mmDummy_NumberOfModes);\n\n ADD_PROPERTY_TYPE(MapReversed, (false), \"Attachment\", App::Prop_None, \"Reverse Z direction (flip sketch upside down)\");\n\n ADD_PROPERTY_TYPE(MapPathParameter, (0.0), \"Attachment\", App::Prop_None, \"Sets point of curve to map the sketch to. 0..1 = start..end\");\n\n ADD_PROPERTY_TYPE(superPlacement, (Base::Placement()), \"Attachment\", App::Prop_None, \"Extra placement to apply in addition to attachment (in local coordinates)\");\n\n \/\/setAttacher(new AttachEngine3D);\/\/default attacher\n}\n\nAttachableObject::~AttachableObject()\n{\n if(_attacher)\n delete _attacher;\n}\n\nvoid AttachableObject::setAttacher(AttachEngine* attacher)\n{\n if (_attacher)\n delete _attacher;\n _attacher = attacher;\n updateAttacherVals();\n}\n\nbool AttachableObject::positionBySupport()\n{\n if (!_attacher)\n throw Base::Exception(\"AttachableObject: can't positionBySupport, because no AttachEngine is set.\");\n updateAttacherVals();\n try{\n this->Placement.setValue(_attacher->calculateAttachedPlacement(this->Placement.getValue()));\n return true;\n } catch (ExceptionCancel) {\n \/\/disabled, don't do anything\n return false;\n };\n}\n\nApp::DocumentObjectExecReturn *AttachableObject::execute()\n{\n if(this->isTouched_Mapping()) {\n try{\n positionBySupport();\n } catch (Base::Exception &e) {\n return new App::DocumentObjectExecReturn(e.what());\n } catch (Standard_Failure &e){\n return new App::DocumentObjectExecReturn(e.GetMessageString());\n }\n }\n return Part::Feature::execute();\n}\n\nvoid setReadonlyness(App::Property &prop, bool on)\n{\n unsigned long status = prop.getStatus();\n prop.setStatus(App::Property::ReadOnly, on);\n if (status != prop.getStatus())\n App::GetApplication().signalChangePropertyEditor(prop);\n}\n\nvoid AttachableObject::onChanged(const App::Property* prop)\n{\n if(! this->isRestoring()){\n if ((prop == &Support\n || prop == &MapMode\n || prop == &MapPathParameter\n || prop == &MapReversed\n || prop == &superPlacement)){\n\n bool bAttached = false;\n try{\n bAttached = positionBySupport();\n } catch (Base::Exception &e) {\n this->setError();\n Base::Console().Error(\"PositionBySupport: %s\",e.what());\n \/\/set error message - how?\n } catch (Standard_Failure &e){\n this->setError();\n Base::Console().Error(\"PositionBySupport: %s\",e.GetMessageString());\n }\n\n eMapMode mmode = eMapMode(this->MapMode.getValue());\n setReadonlyness(this->superPlacement, !bAttached);\n setReadonlyness(this->Placement, bAttached && mmode != mmTranslate); \/\/for mmTranslate, orientation should remain editable even when attached.\n }\n\n }\n\n Part::Feature::onChanged(prop);\n}\n\nvoid AttachableObject::updateAttacherVals()\n{\n if (!_attacher)\n return;\n _attacher->setUp(this->Support,\n eMapMode(this->MapMode.getValue()),\n this->MapReversed.getValue(),\n this->MapPathParameter.getValue(),\n 0.0,0.0,\n this->superPlacement.getValue());\n}\n\n\n<commit_msg>+ move global function to namespace<commit_after>\/***************************************************************************\n * Copyright (c) Victor Titov (DeepSOIC) *\n * (vv.titov@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#ifndef _PreComp_\n#endif\n\n#include \"AttachableObject.h\"\n\n#include <Base\/Console.h>\n#include <App\/Application.h>\n\n\n\nusing namespace Part;\nusing namespace Attacher;\n\nPROPERTY_SOURCE(Part::AttachableObject, Part::Feature);\n\nAttachableObject::AttachableObject()\n : _attacher(0)\n{\n ADD_PROPERTY_TYPE(Support, (0,0), \"Attachment\",(App::PropertyType)(App::Prop_None),\"Support of the 2D geometry\");\n\n ADD_PROPERTY_TYPE(MapMode, (mmDeactivated), \"Attachment\", App::Prop_None, \"Mode of attachment to other object\");\n MapMode.setEnums(AttachEngine::eMapModeStrings);\n \/\/a rough test if mode string list in Attacher.cpp is in sync with eMapMode enum.\n assert(MapMode.getEnumVector().size() == mmDummy_NumberOfModes);\n\n ADD_PROPERTY_TYPE(MapReversed, (false), \"Attachment\", App::Prop_None, \"Reverse Z direction (flip sketch upside down)\");\n\n ADD_PROPERTY_TYPE(MapPathParameter, (0.0), \"Attachment\", App::Prop_None, \"Sets point of curve to map the sketch to. 0..1 = start..end\");\n\n ADD_PROPERTY_TYPE(superPlacement, (Base::Placement()), \"Attachment\", App::Prop_None, \"Extra placement to apply in addition to attachment (in local coordinates)\");\n\n \/\/setAttacher(new AttachEngine3D);\/\/default attacher\n}\n\nAttachableObject::~AttachableObject()\n{\n if(_attacher)\n delete _attacher;\n}\n\nvoid AttachableObject::setAttacher(AttachEngine* attacher)\n{\n if (_attacher)\n delete _attacher;\n _attacher = attacher;\n updateAttacherVals();\n}\n\nbool AttachableObject::positionBySupport()\n{\n if (!_attacher)\n throw Base::Exception(\"AttachableObject: can't positionBySupport, because no AttachEngine is set.\");\n updateAttacherVals();\n try{\n this->Placement.setValue(_attacher->calculateAttachedPlacement(this->Placement.getValue()));\n return true;\n } catch (ExceptionCancel) {\n \/\/disabled, don't do anything\n return false;\n };\n}\n\nApp::DocumentObjectExecReturn *AttachableObject::execute()\n{\n if(this->isTouched_Mapping()) {\n try{\n positionBySupport();\n } catch (Base::Exception &e) {\n return new App::DocumentObjectExecReturn(e.what());\n } catch (Standard_Failure &e){\n return new App::DocumentObjectExecReturn(e.GetMessageString());\n }\n }\n return Part::Feature::execute();\n}\n\nnamespace Attacher {\n void setReadonlyness(App::Property &prop, bool on)\n {\n unsigned long status = prop.getStatus();\n prop.setStatus(App::Property::ReadOnly, on);\n if (status != prop.getStatus())\n App::GetApplication().signalChangePropertyEditor(prop);\n }\n}\n\nvoid AttachableObject::onChanged(const App::Property* prop)\n{\n if(! this->isRestoring()){\n if ((prop == &Support\n || prop == &MapMode\n || prop == &MapPathParameter\n || prop == &MapReversed\n || prop == &superPlacement)){\n\n bool bAttached = false;\n try{\n bAttached = positionBySupport();\n } catch (Base::Exception &e) {\n this->setError();\n Base::Console().Error(\"PositionBySupport: %s\",e.what());\n \/\/set error message - how?\n } catch (Standard_Failure &e){\n this->setError();\n Base::Console().Error(\"PositionBySupport: %s\",e.GetMessageString());\n }\n\n eMapMode mmode = eMapMode(this->MapMode.getValue());\n setReadonlyness(this->superPlacement, !bAttached);\n setReadonlyness(this->Placement, bAttached && mmode != mmTranslate); \/\/for mmTranslate, orientation should remain editable even when attached.\n }\n\n }\n\n Part::Feature::onChanged(prop);\n}\n\nvoid AttachableObject::updateAttacherVals()\n{\n if (!_attacher)\n return;\n _attacher->setUp(this->Support,\n eMapMode(this->MapMode.getValue()),\n this->MapReversed.getValue(),\n this->MapPathParameter.getValue(),\n 0.0,0.0,\n this->superPlacement.getValue());\n}\n\n\n<|endoftext|>"} {"text":"<commit_before>\/*\n This file is part of Magnum.\n\n Copyright © 2010, 2011, 2012, 2013 Vladimír Vondruš <mosra@centrum.cz>\n\n Permission is hereby granted, free of charge, to any person obtaining a\n copy of this software and associated documentation files (the \"Software\"),\n to deal in the Software without restriction, including without limitation\n the rights to use, copy, modify, merge, publish, distribute, sublicense,\n and\/or sell copies of the Software, and to permit persons to whom the\n Software is furnished to do so, subject to the following conditions:\n\n The above copyright notice and this permission notice shall be included\n in all copies or substantial portions of the Software.\n\n THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\n IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\n FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL\n THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\n LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING\n FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER\n DEALINGS IN THE SOFTWARE.\n*\/\n\n#include \"MagnumFont.h\"\n\n#include <sstream>\n#include <Containers\/Array.h>\n#include <Utility\/Directory.h>\n#include <Utility\/Unicode.h>\n#include <Text\/GlyphCache.h>\n#include <Trade\/ImageData.h>\n\n#include \"TgaImporter\/TgaImporter.h\"\n\nnamespace Magnum { namespace Text {\n\nstruct MagnumFont::Data {\n Utility::Configuration conf;\n Trade::ImageData2D image;\n std::unordered_map<char32_t, UnsignedInt> glyphId;\n std::vector<Vector2> glyphAdvance;\n};\n\nnamespace {\n class MagnumFontLayouter: public AbstractLayouter {\n public:\n explicit MagnumFontLayouter(const std::unordered_map<char32_t, UnsignedInt>& glyphId, const std::vector<Vector2>& glyphAdvance, const GlyphCache& cache, Float fontSize, Float textSize, const std::string& text);\n\n std::tuple<Rectangle, Rectangle, Vector2> renderGlyph(UnsignedInt i) override;\n\n private:\n const std::vector<Vector2>& glyphAdvance;\n const GlyphCache& cache;\n const Float fontSize, textSize;\n std::vector<UnsignedInt> glyphs;\n };\n}\n\nMagnumFont::MagnumFont(): _opened(nullptr) {}\n\nMagnumFont::MagnumFont(PluginManager::AbstractManager* const manager, std::string plugin): AbstractFont(manager, std::move(plugin)), _opened(nullptr) {}\n\nMagnumFont::~MagnumFont() { close(); }\n\nauto MagnumFont::doFeatures() const -> Features { return Feature::OpenData|Feature::MultiFile|Feature::PreparedGlyphCache; }\n\nbool MagnumFont::doIsOpened() const { return _opened; }\n\nvoid MagnumFont::doOpenData(const std::vector<std::pair<std::string, Containers::ArrayReference<const unsigned char>>>& data, const Float) {\n \/* We need just the configuration file and image file *\/\n if(data.size() != 2) {\n Error() << \"Text::MagnumFont::openData(): wanted two files, got\" << data.size();\n return;\n }\n\n \/* Open the configuration file *\/\n std::istringstream in({reinterpret_cast<const char*>(data[0].second.begin()), data[0].second.size()});\n Utility::Configuration conf(in, Utility::Configuration::Flag::SkipComments);\n if(!conf.isValid() || conf.isEmpty()) {\n Error() << \"Text::MagnumFont::openData(): cannot open file\" << data[0].first << conf.isValid();\n return;\n }\n\n \/* Check version *\/\n if(conf.value<UnsignedInt>(\"version\") != 1) {\n Error() << \"Text::MagnumFont::openData(): unsupported file version, expected 1 but got\"\n << conf.value<UnsignedInt>(\"version\");\n return;\n }\n\n \/* Check that we have also the image file *\/\n if(conf.value(\"image\") != data[1].first) {\n Error() << \"Text::MagnumFont::openData(): expected file\"\n << conf.value(\"image\") << \"but got\" << data[1].first;\n return;\n }\n\n \/* Open and load image file *\/\n Trade::TgaImporter importer;\n if(!importer.openData(data[1].second)) {\n Error() << \"Text::MagnumFont::openData(): cannot open image file\";\n return;\n }\n Trade::ImageData2D* image = importer.image2D(0);\n if(!image) {\n Error() << \"Text::MagnumFont::openData(): cannot load image file\";\n return;\n }\n\n openInternal(std::move(conf), std::move(*image));\n delete image;\n}\n\nvoid MagnumFont::doOpenFile(const std::string& filename, Float) {\n \/* Open the configuration file *\/\n Utility::Configuration conf(filename, Utility::Configuration::Flag::ReadOnly|Utility::Configuration::Flag::SkipComments);\n if(!conf.isValid() || conf.isEmpty()) {\n Error() << \"Text::MagnumFont::openFile(): cannot open file\" << filename << conf.isValid();\n return;\n }\n\n \/* Check version *\/\n if(conf.value<UnsignedInt>(\"version\") != 1) {\n Error() << \"Text::MagnumFont::openFile(): unsupported file version, expected 1 but got\"\n << conf.value<UnsignedInt>(\"version\");\n return;\n }\n\n \/* Open and load image file *\/\n const std::string imageFilename = Utility::Directory::join(Utility::Directory::path(filename), conf.value(\"image\"));\n Trade::TgaImporter importer;\n if(!importer.openFile(imageFilename)) {\n Error() << \"Text::MagnumFont::openFile(): cannot open image file\" << imageFilename;\n return;\n }\n Trade::ImageData2D* image = importer.image2D(0);\n if(!image) {\n Error() << \"Text::MagnumFont::openFile(): cannot load image file\";\n return;\n }\n\n openInternal(std::move(conf), std::move(*image));\n delete image;\n}\n\nvoid MagnumFont::openInternal(Utility::Configuration&& conf, Trade::ImageData2D&& image) {\n \/* Everything okay, save the data internally *\/\n _opened = new Data{std::move(conf), std::move(image), {}, {}};\n _size = _opened->conf.value<Float>(\"fontSize\");\n\n \/* Glyph advances *\/\n const std::vector<Utility::ConfigurationGroup*> glyphs = _opened->conf.groups(\"glyph\");\n _opened->glyphAdvance.reserve(glyphs.size());\n for(const Utility::ConfigurationGroup* const g: glyphs)\n _opened->glyphAdvance.push_back(g->value<Vector2>(\"advance\"));\n\n \/* Fill character->glyph map *\/\n const std::vector<Utility::ConfigurationGroup*> chars = _opened->conf.groups(\"char\");\n for(const Utility::ConfigurationGroup* const c: chars) {\n const UnsignedInt glyphId = c->value<UnsignedInt>(\"glyph\");\n CORRADE_INTERNAL_ASSERT(glyphId < _opened->glyphAdvance.size());\n _opened->glyphId.emplace(c->value<char32_t>(\"unicode\"), glyphId);\n }\n}\n\nvoid MagnumFont::doClose() {\n delete _opened;\n _opened = nullptr;\n}\n\nUnsignedInt MagnumFont::doGlyphId(const char32_t character) {\n auto it = _opened->glyphId.find(character);\n return it != _opened->glyphId.end() ? it->second : 0;\n}\n\nVector2 MagnumFont::doGlyphAdvance(const UnsignedInt glyph) {\n return glyph < _opened->glyphAdvance.size() ? _opened->glyphAdvance[glyph] : Vector2();\n}\n\nGlyphCache* MagnumFont::doCreateGlyphCache() {\n \/* Set cache image *\/\n auto cache = new Text::GlyphCache(\n _opened->conf.value<Vector2i>(\"originalImageSize\"),\n _opened->image.size(),\n _opened->conf.value<Vector2i>(\"padding\"));\n cache->setImage({}, _opened->image);\n\n \/* Fill glyph map *\/\n const std::vector<Utility::ConfigurationGroup*> glyphs = _opened->conf.groups(\"glyph\");\n for(std::size_t i = 0; i != glyphs.size(); ++i)\n cache->insert(i, glyphs[i]->value<Vector2i>(\"position\"), glyphs[i]->value<Rectanglei>(\"rectangle\"));\n\n return cache;\n}\n\nAbstractLayouter* MagnumFont::doLayout(const GlyphCache& cache, Float size, const std::string& text) {\n return new MagnumFontLayouter(_opened->glyphId, _opened->glyphAdvance, cache, this->size(), size, text);\n}\n\nnamespace {\n\nMagnumFontLayouter::MagnumFontLayouter(const std::unordered_map<char32_t, UnsignedInt>& glyphId, const std::vector<Vector2>& glyphAdvance, const GlyphCache& cache, Float fontSize, Float textSize, const std::string& text): glyphAdvance(glyphAdvance), cache(cache), fontSize(fontSize), textSize(textSize) {\n \/* Get glyph codes from characters *\/\n glyphs.reserve(text.size());\n for(std::size_t i = 0; i != text.size(); ) {\n UnsignedInt codepoint;\n std::tie(codepoint, i) = Utility::Unicode::nextChar(text, i);\n const auto it = glyphId.find(codepoint);\n glyphs.push_back(it == glyphId.end() ? 0 : it->second);\n }\n _glyphCount = glyphs.size();\n}\n\nstd::tuple<Rectangle, Rectangle, Vector2> MagnumFontLayouter::renderGlyph(UnsignedInt i) {\n \/* Position of the texture in the resulting glyph, texture coordinates *\/\n Vector2i position;\n Rectanglei rectangle;\n std::tie(position, rectangle) = cache[glyphs[i]];\n\n const Rectangle texturePosition = Rectangle::fromSize(Vector2(position)\/fontSize,\n Vector2(rectangle.size())\/fontSize);\n const Rectangle textureCoordinates(Vector2(rectangle.bottomLeft())\/cache.textureSize(),\n Vector2(rectangle.topRight())\/cache.textureSize());\n\n \/* Absolute quad position, composed from cursor position, glyph offset\n and texture position, denormalized to requested text size *\/\n Rectangle quadPosition = Rectangle::fromSize(\n Vector2(texturePosition.left(), texturePosition.bottom())*textSize,\n texturePosition.size()*textSize);\n\n \/* Advance for given glyph, denormalized to requested text size *\/\n const Vector2 advance = glyphAdvance[glyphs[i]]*textSize\/fontSize;\n\n return std::make_tuple(quadPosition, textureCoordinates, advance);\n}\n\n}\n\n}}\n<commit_msg>Adapted to Magnum changes.<commit_after>\/*\n This file is part of Magnum.\n\n Copyright © 2010, 2011, 2012, 2013 Vladimír Vondruš <mosra@centrum.cz>\n\n Permission is hereby granted, free of charge, to any person obtaining a\n copy of this software and associated documentation files (the \"Software\"),\n to deal in the Software without restriction, including without limitation\n the rights to use, copy, modify, merge, publish, distribute, sublicense,\n and\/or sell copies of the Software, and to permit persons to whom the\n Software is furnished to do so, subject to the following conditions:\n\n The above copyright notice and this permission notice shall be included\n in all copies or substantial portions of the Software.\n\n THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\n IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\n FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL\n THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\n LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING\n FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER\n DEALINGS IN THE SOFTWARE.\n*\/\n\n#include \"MagnumFont.h\"\n\n#include <sstream>\n#include <Containers\/Array.h>\n#include <Utility\/Directory.h>\n#include <Utility\/Unicode.h>\n#include <Text\/GlyphCache.h>\n#include <Trade\/ImageData.h>\n\n#include \"TgaImporter\/TgaImporter.h\"\n\nnamespace Magnum { namespace Text {\n\nstruct MagnumFont::Data {\n Utility::Configuration conf;\n Trade::ImageData2D image;\n std::unordered_map<char32_t, UnsignedInt> glyphId;\n std::vector<Vector2> glyphAdvance;\n};\n\nnamespace {\n class MagnumFontLayouter: public AbstractLayouter {\n public:\n explicit MagnumFontLayouter(const std::unordered_map<char32_t, UnsignedInt>& glyphId, const std::vector<Vector2>& glyphAdvance, const GlyphCache& cache, Float fontSize, Float textSize, const std::string& text);\n\n std::tuple<Rectangle, Rectangle, Vector2> renderGlyph(UnsignedInt i) override;\n\n private:\n const std::vector<Vector2>& glyphAdvance;\n const GlyphCache& cache;\n const Float fontSize, textSize;\n std::vector<UnsignedInt> glyphs;\n };\n}\n\nMagnumFont::MagnumFont(): _opened(nullptr) {}\n\nMagnumFont::MagnumFont(PluginManager::AbstractManager* const manager, std::string plugin): AbstractFont(manager, std::move(plugin)), _opened(nullptr) {}\n\nMagnumFont::~MagnumFont() { close(); }\n\nauto MagnumFont::doFeatures() const -> Features { return Feature::OpenData|Feature::MultiFile|Feature::PreparedGlyphCache; }\n\nbool MagnumFont::doIsOpened() const { return _opened; }\n\nvoid MagnumFont::doOpenData(const std::vector<std::pair<std::string, Containers::ArrayReference<const unsigned char>>>& data, const Float) {\n \/* We need just the configuration file and image file *\/\n if(data.size() != 2) {\n Error() << \"Text::MagnumFont::openData(): wanted two files, got\" << data.size();\n return;\n }\n\n \/* Open the configuration file *\/\n std::istringstream in({reinterpret_cast<const char*>(data[0].second.begin()), data[0].second.size()});\n Utility::Configuration conf(in, Utility::Configuration::Flag::SkipComments);\n if(!conf.isValid() || conf.isEmpty()) {\n Error() << \"Text::MagnumFont::openData(): cannot open file\" << data[0].first << conf.isValid();\n return;\n }\n\n \/* Check version *\/\n if(conf.value<UnsignedInt>(\"version\") != 1) {\n Error() << \"Text::MagnumFont::openData(): unsupported file version, expected 1 but got\"\n << conf.value<UnsignedInt>(\"version\");\n return;\n }\n\n \/* Check that we have also the image file *\/\n if(conf.value(\"image\") != data[1].first) {\n Error() << \"Text::MagnumFont::openData(): expected file\"\n << conf.value(\"image\") << \"but got\" << data[1].first;\n return;\n }\n\n \/* Open and load image file *\/\n Trade::TgaImporter importer;\n if(!importer.openData(data[1].second)) {\n Error() << \"Text::MagnumFont::openData(): cannot open image file\";\n return;\n }\n Trade::ImageData2D* image = importer.image2D(0);\n if(!image) {\n Error() << \"Text::MagnumFont::openData(): cannot load image file\";\n return;\n }\n\n openInternal(std::move(conf), std::move(*image));\n delete image;\n}\n\nvoid MagnumFont::doOpenFile(const std::string& filename, Float) {\n \/* Open the configuration file *\/\n Utility::Configuration conf(filename, Utility::Configuration::Flag::ReadOnly|Utility::Configuration::Flag::SkipComments);\n if(!conf.isValid() || conf.isEmpty()) {\n Error() << \"Text::MagnumFont::openFile(): cannot open file\" << filename << conf.isValid();\n return;\n }\n\n \/* Check version *\/\n if(conf.value<UnsignedInt>(\"version\") != 1) {\n Error() << \"Text::MagnumFont::openFile(): unsupported file version, expected 1 but got\"\n << conf.value<UnsignedInt>(\"version\");\n return;\n }\n\n \/* Open and load image file *\/\n const std::string imageFilename = Utility::Directory::join(Utility::Directory::path(filename), conf.value(\"image\"));\n Trade::TgaImporter importer;\n if(!importer.openFile(imageFilename)) {\n Error() << \"Text::MagnumFont::openFile(): cannot open image file\" << imageFilename;\n return;\n }\n Trade::ImageData2D* image = importer.image2D(0);\n if(!image) {\n Error() << \"Text::MagnumFont::openFile(): cannot load image file\";\n return;\n }\n\n openInternal(std::move(conf), std::move(*image));\n delete image;\n}\n\nvoid MagnumFont::openInternal(Utility::Configuration&& conf, Trade::ImageData2D&& image) {\n \/* Everything okay, save the data internally *\/\n _opened = new Data{std::move(conf), std::move(image), {}, {}};\n _size = _opened->conf.value<Float>(\"fontSize\");\n\n \/* Glyph advances *\/\n const std::vector<Utility::ConfigurationGroup*> glyphs = _opened->conf.groups(\"glyph\");\n _opened->glyphAdvance.reserve(glyphs.size());\n for(const Utility::ConfigurationGroup* const g: glyphs)\n _opened->glyphAdvance.push_back(g->value<Vector2>(\"advance\"));\n\n \/* Fill character->glyph map *\/\n const std::vector<Utility::ConfigurationGroup*> chars = _opened->conf.groups(\"char\");\n for(const Utility::ConfigurationGroup* const c: chars) {\n const UnsignedInt glyphId = c->value<UnsignedInt>(\"glyph\");\n CORRADE_INTERNAL_ASSERT(glyphId < _opened->glyphAdvance.size());\n _opened->glyphId.emplace(c->value<char32_t>(\"unicode\"), glyphId);\n }\n}\n\nvoid MagnumFont::doClose() {\n delete _opened;\n _opened = nullptr;\n}\n\nUnsignedInt MagnumFont::doGlyphId(const char32_t character) {\n auto it = _opened->glyphId.find(character);\n return it != _opened->glyphId.end() ? it->second : 0;\n}\n\nVector2 MagnumFont::doGlyphAdvance(const UnsignedInt glyph) {\n return glyph < _opened->glyphAdvance.size() ? _opened->glyphAdvance[glyph] : Vector2();\n}\n\nGlyphCache* MagnumFont::doCreateGlyphCache() {\n \/* Set cache image *\/\n auto cache = new Text::GlyphCache(\n _opened->conf.value<Vector2i>(\"originalImageSize\"),\n _opened->image.size(),\n _opened->conf.value<Vector2i>(\"padding\"));\n cache->setImage({}, _opened->image);\n\n \/* Fill glyph map *\/\n const std::vector<Utility::ConfigurationGroup*> glyphs = _opened->conf.groups(\"glyph\");\n for(std::size_t i = 0; i != glyphs.size(); ++i)\n cache->insert(i, glyphs[i]->value<Vector2i>(\"position\"), glyphs[i]->value<Rectanglei>(\"rectangle\"));\n\n return cache;\n}\n\nAbstractLayouter* MagnumFont::doLayout(const GlyphCache& cache, Float size, const std::string& text) {\n return new MagnumFontLayouter(_opened->glyphId, _opened->glyphAdvance, cache, this->size(), size, text);\n}\n\nnamespace {\n\nMagnumFontLayouter::MagnumFontLayouter(const std::unordered_map<char32_t, UnsignedInt>& glyphId, const std::vector<Vector2>& glyphAdvance, const GlyphCache& cache, Float fontSize, Float textSize, const std::string& text): glyphAdvance(glyphAdvance), cache(cache), fontSize(fontSize), textSize(textSize) {\n \/* Get glyph codes from characters *\/\n glyphs.reserve(text.size());\n for(std::size_t i = 0; i != text.size(); ) {\n UnsignedInt codepoint;\n std::tie(codepoint, i) = Utility::Unicode::nextChar(text, i);\n const auto it = glyphId.find(codepoint);\n glyphs.push_back(it == glyphId.end() ? 0 : it->second);\n }\n _glyphCount = glyphs.size();\n}\n\nstd::tuple<Rectangle, Rectangle, Vector2> MagnumFontLayouter::renderGlyph(UnsignedInt i) {\n \/* Position of the texture in the resulting glyph, texture coordinates *\/\n Vector2i position;\n Rectanglei rectangle;\n std::tie(position, rectangle) = cache[glyphs[i]];\n\n const Rectangle texturePosition = Rectangle::fromSize(Vector2(position)\/fontSize,\n Vector2(rectangle.size())\/fontSize);\n const Rectangle textureCoordinates(Vector2(rectangle.bottomLeft())\/Vector2(cache.textureSize()),\n Vector2(rectangle.topRight())\/Vector2(cache.textureSize()));\n\n \/* Absolute quad position, composed from cursor position, glyph offset\n and texture position, denormalized to requested text size *\/\n Rectangle quadPosition = Rectangle::fromSize(\n Vector2(texturePosition.left(), texturePosition.bottom())*textSize,\n texturePosition.size()*textSize);\n\n \/* Advance for given glyph, denormalized to requested text size *\/\n const Vector2 advance = glyphAdvance[glyphs[i]]*textSize\/fontSize;\n\n return std::make_tuple(quadPosition, textureCoordinates, advance);\n}\n\n}\n\n}}\n<|endoftext|>"} {"text":"<commit_before>#include \"normalvirtualkeyboardscene.h\"\n#include \"virtualkeyitem.h\"\n\nNormalVirtualKeyboardScene::NormalVirtualKeyboardScene(QObject *parent) : VirtualKeyboardScene(parent)\n{\n\tconstruct();\n}\n\nvoid NormalVirtualKeyboardScene::construct()\n{\n\tconst int unitWidth = 100;\n\tconst int unitHeight = 130;\n\tint i = 0;\n\t{\n\t\tstd::vector<VirtualKeyItem*> list;\n\t\tlist.push_back(createVirtualKeyItem(KVC_END, \"stop\", \"stop\", \"stop\", \"stop\", \"stop\", \"stop\", \"stop\"));\n\t\tlist.push_back(createVirtualKeyItem(KVC_PAGEDOWN, \"mode\", \"mode\", \"mode\", \"mode\", \"mode\", \"mode\", \"mode\"));\n\t\tlist.push_back(createVirtualKeyItem(KVC_F1, \"function01\", \"function06\", \"function01\", \"function01\", \"function06\", \"function01\", \"function06\"));\n\t\tlist.push_back(createVirtualKeyItem(KVC_F2, \"function02\", \"function07\", \"function02\", \"function02\", \"function07\", \"function02\", \"function07\"));\n\t\tlist.push_back(createVirtualKeyItem(KVC_F3, \"function03\", \"function08\", \"function03\", \"function03\", \"function08\", \"function03\", \"function08\"));\n\t\tlist.push_back(createVirtualKeyItem(KVC_F4, \"function04\", \"function09\", \"function04\", \"function04\", \"function09\", \"function04\", \"function09\"));\n\t\tlist.push_back(createVirtualKeyItem(KVC_F5, \"function05\", \"function10\", \"function05\", \"function05\", \"function10\", \"function05\", \"function10\"));\n\t\tlist.push_back(createVirtualKeyItem(KVC_HOME, \"home\", \"home\", \"home\", \"home\", \"home\", \"home\", \"home\"));\n\t\tlist.push_back(createVirtualKeyItem(KVC_PAGEUP, \"page\", \"page\", \"page\", \"page\", \"page\", \"page\", \"page\"));\n\t\tlist.push_back(createVirtualKeyItem(KVC_DELETE, \"del\", \"del\", \"del\", \"del\", \"del\", \"del\", \"del\"));\n\t\talignVirtualKeyItems(list, QPointF(0, unitHeight * i++));\n\t}\n\t{\n\t\tstd::vector<VirtualKeyItem*> list;\n\t\tlist.push_back(createVirtualKeyItem(KVC_ESC, \"escape\", \"escape\", \"escape\", \"escape\", \"escape\", \"escape\", \"escape\"));\n\t\tlist.push_back(createVirtualKeyItem(KVC_1, \"0x31\", \"0x21\", \"0x07\", \"0xe7\", \"blank\", \"0xc7\", \"blank\"));\n\t\tlist.push_back(createVirtualKeyItem(KVC_2, \"0x32\", \"0x22\", \"0x01\", \"0xec\", \"blank\", \"0xcc\", \"blank\"));\n\t\tlist.push_back(createVirtualKeyItem(KVC_3, \"0x33\", \"0x23\", \"0x02\", \"0x91\", \"0x87\", \"0xb1\", \"0xa7\"));\n\t\tlist.push_back(createVirtualKeyItem(KVC_4, \"0x34\", \"0x24\", \"0x03\", \"0x93\", \"0x89\", \"0xb3\", \"0xa9\"));\n\t\tlist.push_back(createVirtualKeyItem(KVC_5, \"0x35\", \"0x25\", \"0x04\", \"0x94\", \"0x8a\", \"0xb4\", \"0xaa\"));\n\t\tlist.push_back(createVirtualKeyItem(KVC_6, \"0x36\", \"0x26\", \"0x05\", \"0x95\", \"0x8b\", \"0xb5\", \"0xab\"));\n\t\tlist.push_back(createVirtualKeyItem(KVC_7, \"0x37\", \"0x27\", \"0x06\", \"0xf4\", \"0x8c\", \"0xd4\", \"0xac\"));\n\t\tlist.push_back(createVirtualKeyItem(KVC_8, \"0x38\", \"0x28\", \"0x0d\", \"0xf5\", \"0x8d\", \"0xd5\", \"0xad\"));\n\t\tlist.push_back(createVirtualKeyItem(KVC_9, \"0x39\", \"0x29\", \"0x0e\", \"0xf6\", \"0x8e\", \"0xd6\", \"0xae\"));\n\t\tlist.push_back(createVirtualKeyItem(KVC_0, \"0x30\", \"blank\", \"0x0f\", \"0xfc\", \"0x86\", \"0xdc\", \"0xa6\"));\n\t\tlist.push_back(createVirtualKeyItem(KVC_MINUS, \"0x2d\", \"0x3d\", \"0x17\", \"0xee\", \"blank\", \"0xce\", \"blank\"));\n\t\tlist.push_back(createVirtualKeyItem(KVC_CARET, \"0x5e\", \"blank\", \"blank\", \"0xed\", \"blank\", \"0xcd\", \"blank\"));\n\t\tlist.push_back(createVirtualKeyItem(KVC_YEN, \"0x5c\", \"blank\", \"0x09\", \"0xb0\", \"blank\", \"0xb0\", \"blank\"));\n\t\tlist.push_back(createVirtualKeyItem(KVC_INSERT, \"ins\", \"ins\", \"ins\", \"ins\", \"ins\", \"ins\", \"ins\"));\n\t\talignVirtualKeyItems(list, QPointF(0, unitHeight * i++));\n\t}\n\t{\n\t\tstd::vector<VirtualKeyItem*> list;\n\t\tlist.push_back(createVirtualKeyItem(KVC_TAB, \"tab\", \"tab\", \"tab\", \"tab\", \"tab\", \"tab\", \"tab\"));\n\t\tlist.push_back(createVirtualKeyItem(KVC_Q, \"0x71\", \"0x51\", \"blank\", \"0xe0\", \"blank\", \"0xc0\", \"blank\"));\n\t\tlist.push_back(createVirtualKeyItem(KVC_W, \"0x77\", \"0x57\", \"blank\", \"0xe3\", \"blank\", \"0xc3\", \"blank\"));\n\t\tlist.push_back(createVirtualKeyItem(KVC_E, \"0x65\", \"0x45\", \"0x18\", \"0x92\", \"0x88\", \"0xb2\", \"0xa8\"));\n\t\tlist.push_back(createVirtualKeyItem(KVC_R, \"0x72\", \"0x52\", \"0x12\", \"0x9d\", \"blank\", \"0xbd\", \"blank\"));\n\t\tlist.push_back(createVirtualKeyItem(KVC_T, \"0x74\", \"0x54\", \"0x19\", \"0x96\", \"blank\", \"0xb6\", \"blank\"));\n\t\tlist.push_back(createVirtualKeyItem(KVC_Y, \"0x79\", \"0x59\", \"0x08\", \"0xfd\", \"blank\", \"0xdd\", \"blank\"));\n\t\tlist.push_back(createVirtualKeyItem(KVC_U, \"0x75\", \"0x55\", \"blank\", \"0xe5\", \"blank\", \"0xc5\", \"blank\"));\n\t\tlist.push_back(createVirtualKeyItem(KVC_I, \"0x69\", \"0x49\", \"0x16\", \"0xe6\", \"blank\", \"0xc6\", \"blank\"));\n\t\tlist.push_back(createVirtualKeyItem(KVC_O, \"0x6f\", \"0x4f\", \"blank\", \"0xf7\", \"blank\", \"0xd7\", \"blank\"));\n\t\tlist.push_back(createVirtualKeyItem(KVC_P, \"0x70\", \"0x50\", \"0x10\", \"0x9e\", \"blank\", \"0xbe\", \"blank\"));\n\t\tlist.push_back(createVirtualKeyItem(KVC_AT, \"0x40\", \"blank\", \"blank\", \"0xde\", \"blank\", \"0xde\", \"blank\"));\n\t\tlist.push_back(createVirtualKeyItem(KVC_LBRACKET, \"0x5b\", \"blank\", \"0x84\", \"0xdf\", \"0xa2\", \"0xdf\", \"0xa2\"));\n\t\tlist.push_back(createVirtualKeyItem(KVC_RBRACKET, \"0x5d\", \"blank\", \"0x85\", \"0xf1\", \"0xa3\", \"0xd1\", \"0xa3\"));\n\t\talignVirtualKeyItems(list, QPointF(0, unitHeight * i++));\n\t}\n\t{\n\t\tstd::vector<VirtualKeyItem*> list;\n\t\tlist.push_back(createVirtualKeyItem(KVC_LCTRL, \"ctrl\", \"ctrl\", \"ctrl\", \"ctrl\", \"ctrl\", \"ctrl\", \"ctrl\", true));\n\t\tlist.push_back(createVirtualKeyItem(KVC_A, \"0x61\", \"0x41\", \"blank\", \"0xe1\", \"blank\", \"0xc1\", \"blank\"));\n\t\tlist.push_back(createVirtualKeyItem(KVC_S, \"0x73\", \"0x53\", \"0x0c\", \"0xe4\", \"blank\", \"0xc4\", \"blank\"));\n\t\tlist.push_back(createVirtualKeyItem(KVC_D, \"0x64\", \"0x44\", \"0x14\", \"0x9c\", \"blank\", \"0xbc\", \"blank\"));\n\t\tlist.push_back(createVirtualKeyItem(KVC_F, \"0x66\", \"0x46\", \"0x15\", \"0xea\", \"blank\", \"0xca\", \"blank\"));\n\t\tlist.push_back(createVirtualKeyItem(KVC_G, \"0x67\", \"0x47\", \"0x13\", \"0x97\", \"blank\", \"0xb7\", \"blank\"));\n\t\tlist.push_back(createVirtualKeyItem(KVC_H, \"0x68\", \"0x48\", \"0x0a\", \"0x98\", \"blank\", \"0xb8\", \"blank\"));\n\t\tlist.push_back(createVirtualKeyItem(KVC_J, \"0x6a\", \"0x4a\", \"blank\", \"0xef\", \"blank\", \"0xcf\", \"blank\"));\n\t\tlist.push_back(createVirtualKeyItem(KVC_K, \"0x6b\", \"0x4b\", \"blank\", \"0xe9\", \"blank\", \"0xc9\", \"blank\"));\n\t\tlist.push_back(createVirtualKeyItem(KVC_L, \"0x6c\", \"0x4c\", \"0x1e\", \"0xf8\", \"blank\", \"0xd8\", \"blank\"));\n\t\tlist.push_back(createVirtualKeyItem(KVC_SEMICOLON, \"0x3b\", \"0x2b\", \"0x82\", \"0xfa\", \"blank\", \"0xda\", \"blank\"));\n\t\tlist.push_back(createVirtualKeyItem(KVC_COLON, \"0x3a\", \"0x2a\", \"0x81\", \"0x99\", \"blank\", \"0xb9\", \"blank\"));\n\t\tlist.push_back(createVirtualKeyItem(KVC_UNDERSCORE, \"blank\", \"0x5f\", \"0x83\", \"0xfb\", \"blank\", \"0xdb\", \"blank\"));\n\t\talignVirtualKeyItems(list, QPointF(0, unitHeight * i++));\n\t}\n\t{\n\t\tstd::vector<VirtualKeyItem*> list;\n\t\tlist.push_back(createVirtualKeyItem(KVC_LSHIFT, \"shift_l\", \"shift_l\", \"shift_l\", \"shift_l\", \"shift_l\", \"shift_l\", \"shift_l\", true));\n\t\tlist.push_back(createVirtualKeyItem(KVC_Z, \"0x7a\", \"0x5a\", \"blank\", \"0xe1\", \"blank\", \"0xc1\", \"blank\"));\n\t\tlist.push_back(createVirtualKeyItem(KVC_X, \"0x78\", \"0x58\", \"0x1c\", \"0xe1\", \"blank\", \"0xc1\", \"blank\"));\n\t\tlist.push_back(createVirtualKeyItem(KVC_C, \"0x63\", \"0x43\", \"0x1a\", \"0xe1\", \"blank\", \"0xc1\", \"blank\"));\n\t\tlist.push_back(createVirtualKeyItem(KVC_V, \"0x76\", \"0x56\", \"0x11\", \"0xe1\", \"blank\", \"0xc1\", \"blank\"));\n\t\tlist.push_back(createVirtualKeyItem(KVC_B, \"0x62\", \"0x42\", \"0x1b\", \"0xe1\", \"blank\", \"0xc1\", \"blank\"));\n\t\tlist.push_back(createVirtualKeyItem(KVC_N, \"0x6e\", \"0x4e\", \"blank\", \"0xe1\", \"blank\", \"0xc1\", \"blank\"));\n\t\tlist.push_back(createVirtualKeyItem(KVC_M, \"0x6d\", \"0x4d\", \"0x0b\", \"0xe1\", \"blank\", \"0xc1\", \"blank\"));\n\t\tlist.push_back(createVirtualKeyItem(KVC_COMMA, \"0x2c\", \"0x3c\", \"0x1f\", \"0xe1\", \"blank\", \"0xc1\", \"blank\"));\n\t\tlist.push_back(createVirtualKeyItem(KVC_PERIOD, \"0x2e\", \"0x3e\", \"0x1d\", \"0xe1\", \"blank\", \"0xc1\", \"blank\"));\n\t\tlist.push_back(createVirtualKeyItem(KVC_SLASH, \"0x2f\", \"0x3f\", \"0x80\", \"0xe1\", \"blank\", \"0xc1\", \"blank\"));\n\t\tlist.push_back(createVirtualKeyItem(KVC_RSHIFT, \"shift_r\", \"shift_r\", \"shift_r\", \"shift_r\", \"shift_r\", \"shift_r\", \"shift_r\", true));\n\t\tlist.push_back(createVirtualKeyItem(KVC_UP, \"up\", \"up\", \"up\", \"up\", \"up\", \"up\", \"up\"));\n\t\tlist.push_back(createVirtualKeyItem(KVC_HIRAGANA, \"kana\", \"kana\", \"kana\", \"kana\", \"kana\", \"kana\", \"kana\"));\n\t\talignVirtualKeyItems(list, QPointF(0, unitHeight * i++));\n\t}\n\t{\n\t\tstd::vector<VirtualKeyItem*> list;\n\t\tlist.push_back(createVirtualKeyItem(KVC_CAPSLOCK, \"caps\", \"caps\", \"caps\", \"caps\", \"caps\", \"caps\", \"caps\"));\n\t\tlist.push_back(createVirtualKeyItem(KVC_LALT, \"grph\", \"grph\", \"grph\", \"grph\", \"grph\", \"grph\", \"grph\", true));\n\t\tlist.push_back(createVirtualKeyItem(KVC_SPACE, \"space\", \"space\", \"space\", \"space\", \"space\", \"space\", \"space\"));\n\t\tlist.push_back(createVirtualKeyItem(KVC_LEFT, \"left\", \"left\", \"left\", \"left\", \"left\", \"left\", \"left\"));\n\t\tlist.push_back(createVirtualKeyItem(KVC_DOWN, \"down\", \"down\", \"down\", \"down\", \"down\", \"down\", \"down\"));\n\t\tlist.push_back(createVirtualKeyItem(KVC_RIGHT, \"right\", \"right\", \"right\", \"right\", \"right\", \"right\", \"right\"));\n\t\talignVirtualKeyItems(list, QPointF(0, unitHeight * i++));\n\t}\n\n\tauto returnKey = createVirtualKeyItem(KVC_ENTER, \"return\", \"return\", \"return\", \"return\", \"return\", \"return\", \"return\");\n\treturnKey->setPos(unitWidth * 13.75, unitHeight * 2);\n\n\tsetSceneRect(itemsBoundingRect());\n\n}\n<commit_msg>かなキーの定義漏れを修正<commit_after>#include \"normalvirtualkeyboardscene.h\"\n#include \"virtualkeyitem.h\"\n\nNormalVirtualKeyboardScene::NormalVirtualKeyboardScene(QObject *parent) : VirtualKeyboardScene(parent)\n{\n\tconstruct();\n}\n\nvoid NormalVirtualKeyboardScene::construct()\n{\n\tconst int unitWidth = 100;\n\tconst int unitHeight = 130;\n\tint i = 0;\n\t{\n\t\tstd::vector<VirtualKeyItem*> list;\n\t\tlist.push_back(createVirtualKeyItem(KVC_END, \"stop\", \"stop\", \"stop\", \"stop\", \"stop\", \"stop\", \"stop\"));\n\t\tlist.push_back(createVirtualKeyItem(KVC_PAGEDOWN, \"mode\", \"mode\", \"mode\", \"mode\", \"mode\", \"mode\", \"mode\"));\n\t\tlist.push_back(createVirtualKeyItem(KVC_F1, \"function01\", \"function06\", \"function01\", \"function01\", \"function06\", \"function01\", \"function06\"));\n\t\tlist.push_back(createVirtualKeyItem(KVC_F2, \"function02\", \"function07\", \"function02\", \"function02\", \"function07\", \"function02\", \"function07\"));\n\t\tlist.push_back(createVirtualKeyItem(KVC_F3, \"function03\", \"function08\", \"function03\", \"function03\", \"function08\", \"function03\", \"function08\"));\n\t\tlist.push_back(createVirtualKeyItem(KVC_F4, \"function04\", \"function09\", \"function04\", \"function04\", \"function09\", \"function04\", \"function09\"));\n\t\tlist.push_back(createVirtualKeyItem(KVC_F5, \"function05\", \"function10\", \"function05\", \"function05\", \"function10\", \"function05\", \"function10\"));\n\t\tlist.push_back(createVirtualKeyItem(KVC_HOME, \"home\", \"home\", \"home\", \"home\", \"home\", \"home\", \"home\"));\n\t\tlist.push_back(createVirtualKeyItem(KVC_PAGEUP, \"page\", \"page\", \"page\", \"page\", \"page\", \"page\", \"page\"));\n\t\tlist.push_back(createVirtualKeyItem(KVC_DELETE, \"del\", \"del\", \"del\", \"del\", \"del\", \"del\", \"del\"));\n\t\talignVirtualKeyItems(list, QPointF(0, unitHeight * i++));\n\t}\n\t{\n\t\tstd::vector<VirtualKeyItem*> list;\n\t\tlist.push_back(createVirtualKeyItem(KVC_ESC, \"escape\", \"escape\", \"escape\", \"escape\", \"escape\", \"escape\", \"escape\"));\n\t\tlist.push_back(createVirtualKeyItem(KVC_1, \"0x31\", \"0x21\", \"0x07\", \"0xe7\", \"blank\", \"0xc7\", \"blank\"));\n\t\tlist.push_back(createVirtualKeyItem(KVC_2, \"0x32\", \"0x22\", \"0x01\", \"0xec\", \"blank\", \"0xcc\", \"blank\"));\n\t\tlist.push_back(createVirtualKeyItem(KVC_3, \"0x33\", \"0x23\", \"0x02\", \"0x91\", \"0x87\", \"0xb1\", \"0xa7\"));\n\t\tlist.push_back(createVirtualKeyItem(KVC_4, \"0x34\", \"0x24\", \"0x03\", \"0x93\", \"0x89\", \"0xb3\", \"0xa9\"));\n\t\tlist.push_back(createVirtualKeyItem(KVC_5, \"0x35\", \"0x25\", \"0x04\", \"0x94\", \"0x8a\", \"0xb4\", \"0xaa\"));\n\t\tlist.push_back(createVirtualKeyItem(KVC_6, \"0x36\", \"0x26\", \"0x05\", \"0x95\", \"0x8b\", \"0xb5\", \"0xab\"));\n\t\tlist.push_back(createVirtualKeyItem(KVC_7, \"0x37\", \"0x27\", \"0x06\", \"0xf4\", \"0x8c\", \"0xd4\", \"0xac\"));\n\t\tlist.push_back(createVirtualKeyItem(KVC_8, \"0x38\", \"0x28\", \"0x0d\", \"0xf5\", \"0x8d\", \"0xd5\", \"0xad\"));\n\t\tlist.push_back(createVirtualKeyItem(KVC_9, \"0x39\", \"0x29\", \"0x0e\", \"0xf6\", \"0x8e\", \"0xd6\", \"0xae\"));\n\t\tlist.push_back(createVirtualKeyItem(KVC_0, \"0x30\", \"blank\", \"0x0f\", \"0xfc\", \"0x86\", \"0xdc\", \"0xa6\"));\n\t\tlist.push_back(createVirtualKeyItem(KVC_MINUS, \"0x2d\", \"0x3d\", \"0x17\", \"0xee\", \"blank\", \"0xce\", \"blank\"));\n\t\tlist.push_back(createVirtualKeyItem(KVC_CARET, \"0x5e\", \"blank\", \"blank\", \"0xed\", \"blank\", \"0xcd\", \"blank\"));\n\t\tlist.push_back(createVirtualKeyItem(KVC_YEN, \"0x5c\", \"blank\", \"0x09\", \"0xb0\", \"blank\", \"0xb0\", \"blank\"));\n\t\tlist.push_back(createVirtualKeyItem(KVC_INSERT, \"ins\", \"ins\", \"ins\", \"ins\", \"ins\", \"ins\", \"ins\"));\n\t\talignVirtualKeyItems(list, QPointF(0, unitHeight * i++));\n\t}\n\t{\n\t\tstd::vector<VirtualKeyItem*> list;\n\t\tlist.push_back(createVirtualKeyItem(KVC_TAB, \"tab\", \"tab\", \"tab\", \"tab\", \"tab\", \"tab\", \"tab\"));\n\t\tlist.push_back(createVirtualKeyItem(KVC_Q, \"0x71\", \"0x51\", \"blank\", \"0xe0\", \"blank\", \"0xc0\", \"blank\"));\n\t\tlist.push_back(createVirtualKeyItem(KVC_W, \"0x77\", \"0x57\", \"blank\", \"0xe3\", \"blank\", \"0xc3\", \"blank\"));\n\t\tlist.push_back(createVirtualKeyItem(KVC_E, \"0x65\", \"0x45\", \"0x18\", \"0x92\", \"0x88\", \"0xb2\", \"0xa8\"));\n\t\tlist.push_back(createVirtualKeyItem(KVC_R, \"0x72\", \"0x52\", \"0x12\", \"0x9d\", \"blank\", \"0xbd\", \"blank\"));\n\t\tlist.push_back(createVirtualKeyItem(KVC_T, \"0x74\", \"0x54\", \"0x19\", \"0x96\", \"blank\", \"0xb6\", \"blank\"));\n\t\tlist.push_back(createVirtualKeyItem(KVC_Y, \"0x79\", \"0x59\", \"0x08\", \"0xfd\", \"blank\", \"0xdd\", \"blank\"));\n\t\tlist.push_back(createVirtualKeyItem(KVC_U, \"0x75\", \"0x55\", \"blank\", \"0xe5\", \"blank\", \"0xc5\", \"blank\"));\n\t\tlist.push_back(createVirtualKeyItem(KVC_I, \"0x69\", \"0x49\", \"0x16\", \"0xe6\", \"blank\", \"0xc6\", \"blank\"));\n\t\tlist.push_back(createVirtualKeyItem(KVC_O, \"0x6f\", \"0x4f\", \"blank\", \"0xf7\", \"blank\", \"0xd7\", \"blank\"));\n\t\tlist.push_back(createVirtualKeyItem(KVC_P, \"0x70\", \"0x50\", \"0x10\", \"0x9e\", \"blank\", \"0xbe\", \"blank\"));\n\t\tlist.push_back(createVirtualKeyItem(KVC_AT, \"0x40\", \"blank\", \"blank\", \"0xde\", \"blank\", \"0xde\", \"blank\"));\n\t\tlist.push_back(createVirtualKeyItem(KVC_LBRACKET, \"0x5b\", \"blank\", \"0x84\", \"0xdf\", \"0xa2\", \"0xdf\", \"0xa2\"));\n\t\tlist.push_back(createVirtualKeyItem(KVC_RBRACKET, \"0x5d\", \"blank\", \"0x85\", \"0xf1\", \"0xa3\", \"0xd1\", \"0xa3\"));\n\t\talignVirtualKeyItems(list, QPointF(0, unitHeight * i++));\n\t}\n\t{\n\t\tstd::vector<VirtualKeyItem*> list;\n\t\tlist.push_back(createVirtualKeyItem(KVC_LCTRL, \"ctrl\", \"ctrl\", \"ctrl\", \"ctrl\", \"ctrl\", \"ctrl\", \"ctrl\", true));\n\t\tlist.push_back(createVirtualKeyItem(KVC_A, \"0x61\", \"0x41\", \"blank\", \"0xe1\", \"blank\", \"0xc1\", \"blank\"));\n\t\tlist.push_back(createVirtualKeyItem(KVC_S, \"0x73\", \"0x53\", \"0x0c\", \"0xe4\", \"blank\", \"0xc4\", \"blank\"));\n\t\tlist.push_back(createVirtualKeyItem(KVC_D, \"0x64\", \"0x44\", \"0x14\", \"0x9c\", \"blank\", \"0xbc\", \"blank\"));\n\t\tlist.push_back(createVirtualKeyItem(KVC_F, \"0x66\", \"0x46\", \"0x15\", \"0xea\", \"blank\", \"0xca\", \"blank\"));\n\t\tlist.push_back(createVirtualKeyItem(KVC_G, \"0x67\", \"0x47\", \"0x13\", \"0x97\", \"blank\", \"0xb7\", \"blank\"));\n\t\tlist.push_back(createVirtualKeyItem(KVC_H, \"0x68\", \"0x48\", \"0x0a\", \"0x98\", \"blank\", \"0xb8\", \"blank\"));\n\t\tlist.push_back(createVirtualKeyItem(KVC_J, \"0x6a\", \"0x4a\", \"blank\", \"0xef\", \"blank\", \"0xcf\", \"blank\"));\n\t\tlist.push_back(createVirtualKeyItem(KVC_K, \"0x6b\", \"0x4b\", \"blank\", \"0xe9\", \"blank\", \"0xc9\", \"blank\"));\n\t\tlist.push_back(createVirtualKeyItem(KVC_L, \"0x6c\", \"0x4c\", \"0x1e\", \"0xf8\", \"blank\", \"0xd8\", \"blank\"));\n\t\tlist.push_back(createVirtualKeyItem(KVC_SEMICOLON, \"0x3b\", \"0x2b\", \"0x82\", \"0xfa\", \"blank\", \"0xda\", \"blank\"));\n\t\tlist.push_back(createVirtualKeyItem(KVC_COLON, \"0x3a\", \"0x2a\", \"0x81\", \"0x99\", \"blank\", \"0xb9\", \"blank\"));\n\t\tlist.push_back(createVirtualKeyItem(KVC_UNDERSCORE, \"blank\", \"0x5f\", \"0x83\", \"0xfb\", \"blank\", \"0xdb\", \"blank\"));\n\t\talignVirtualKeyItems(list, QPointF(0, unitHeight * i++));\n\t}\n\t{\n\t\tstd::vector<VirtualKeyItem*> list;\n\t\tlist.push_back(createVirtualKeyItem(KVC_LSHIFT, \"shift_l\", \"shift_l\", \"shift_l\", \"shift_l\", \"shift_l\", \"shift_l\", \"shift_l\", true));\n\t\tlist.push_back(createVirtualKeyItem(KVC_Z, \"0x7a\", \"0x5a\", \"blank\", \"0xe2\", \"0x8f\", \"0xc2\", \"0xaf\"));\n\t\tlist.push_back(createVirtualKeyItem(KVC_X, \"0x78\", \"0x58\", \"0x1c\", \"0x9b\", \"blank\", \"0xbb\", \"blank\"));\n\t\tlist.push_back(createVirtualKeyItem(KVC_C, \"0x63\", \"0x43\", \"0x1a\", \"0x9f\", \"blank\", \"0xbf\", \"blank\"));\n\t\tlist.push_back(createVirtualKeyItem(KVC_V, \"0x76\", \"0x56\", \"0x11\", \"0xeb\", \"blank\", \"0xcb\", \"blank\"));\n\t\tlist.push_back(createVirtualKeyItem(KVC_B, \"0x62\", \"0x42\", \"0x1b\", \"0x9a\", \"blank\", \"0xba\", \"blank\"));\n\t\tlist.push_back(createVirtualKeyItem(KVC_N, \"0x6e\", \"0x4e\", \"blank\", \"0xf0\", \"blank\", \"0xd0\", \"blank\"));\n\t\tlist.push_back(createVirtualKeyItem(KVC_M, \"0x6d\", \"0x4d\", \"0x0b\", \"0xf3\", \"blank\", \"0xd3\", \"blank\"));\n\t\tlist.push_back(createVirtualKeyItem(KVC_COMMA, \"0x2c\", \"0x3c\", \"0x1f\", \"0xe8\", \"0xa4\", \"0xc8\", \"0xa4\"));\n\t\tlist.push_back(createVirtualKeyItem(KVC_PERIOD, \"0x2e\", \"0x3e\", \"0x1d\", \"0xf9\", \"0xa1\", \"0xd9\", \"0xa1\"));\n\t\tlist.push_back(createVirtualKeyItem(KVC_SLASH, \"0x2f\", \"0x3f\", \"0x80\", \"0xf2\", \"0xa5\", \"0xd2\", \"0xa5\"));\n\t\tlist.push_back(createVirtualKeyItem(KVC_RSHIFT, \"shift_r\", \"shift_r\", \"shift_r\", \"shift_r\", \"shift_r\", \"shift_r\", \"shift_r\", true));\n\t\tlist.push_back(createVirtualKeyItem(KVC_UP, \"up\", \"up\", \"up\", \"up\", \"up\", \"up\", \"up\"));\n\t\tlist.push_back(createVirtualKeyItem(KVC_HIRAGANA, \"kana\", \"kana\", \"kana\", \"kana\", \"kana\", \"kana\", \"kana\"));\n\t\talignVirtualKeyItems(list, QPointF(0, unitHeight * i++));\n\t}\n\t{\n\t\tstd::vector<VirtualKeyItem*> list;\n\t\tlist.push_back(createVirtualKeyItem(KVC_CAPSLOCK, \"caps\", \"caps\", \"caps\", \"caps\", \"caps\", \"caps\", \"caps\"));\n\t\tlist.push_back(createVirtualKeyItem(KVC_LALT, \"grph\", \"grph\", \"grph\", \"grph\", \"grph\", \"grph\", \"grph\", true));\n\t\tlist.push_back(createVirtualKeyItem(KVC_SPACE, \"space\", \"space\", \"space\", \"space\", \"space\", \"space\", \"space\"));\n\t\tlist.push_back(createVirtualKeyItem(KVC_LEFT, \"left\", \"left\", \"left\", \"left\", \"left\", \"left\", \"left\"));\n\t\tlist.push_back(createVirtualKeyItem(KVC_DOWN, \"down\", \"down\", \"down\", \"down\", \"down\", \"down\", \"down\"));\n\t\tlist.push_back(createVirtualKeyItem(KVC_RIGHT, \"right\", \"right\", \"right\", \"right\", \"right\", \"right\", \"right\"));\n\t\talignVirtualKeyItems(list, QPointF(0, unitHeight * i++));\n\t}\n\n\tauto returnKey = createVirtualKeyItem(KVC_ENTER, \"return\", \"return\", \"return\", \"return\", \"return\", \"return\", \"return\");\n\treturnKey->setPos(unitWidth * 13.75, unitHeight * 2);\n\n\tsetSceneRect(itemsBoundingRect());\n\n}\n<|endoftext|>"} {"text":"<commit_before>\/**\n ******************************************************************************\n * Xenia : Xbox 360 Emulator Research Project *\n ******************************************************************************\n * Copyright 2013 Ben Vanik. All rights reserved. *\n * Released under the BSD license - see LICENSE in the root for more details. *\n ******************************************************************************\n *\/\n\n#include <alloy\/backend\/ivm\/ivm_function.h>\n\n#include <alloy\/backend\/ivm\/ivm_stack.h>\n#include <alloy\/backend\/tracing.h>\n#include <alloy\/runtime\/runtime.h>\n#include <alloy\/runtime\/thread_state.h>\n\nusing namespace alloy;\nusing namespace alloy::backend;\nusing namespace alloy::backend::ivm;\nusing namespace alloy::runtime;\n\n\nIVMFunction::IVMFunction(FunctionInfo* symbol_info) :\n register_count_(0), intcode_count_(0), intcodes_(0),\n source_map_count_(0), source_map_(0),\n GuestFunction(symbol_info) {\n}\n\nIVMFunction::~IVMFunction() {\n xe_free(intcodes_);\n xe_free(source_map_);\n}\n\nvoid IVMFunction::Setup(TranslationContext& ctx) {\n register_count_ = ctx.register_count;\n intcode_count_ = ctx.intcode_count;\n intcodes_ = (IntCode*)ctx.intcode_arena->CloneContents();\n source_map_count_ = ctx.source_map_count;\n source_map_ = (SourceMapEntry*)ctx.source_map_arena->CloneContents();\n}\n\nIntCode* IVMFunction::GetIntCodeAtSourceOffset(uint64_t offset) {\n for (size_t n = 0; n < source_map_count_; n++) {\n auto entry = &source_map_[n];\n if (entry->source_offset == offset) {\n return &intcodes_[entry->intcode_index];\n }\n }\n return NULL;\n}\n\nint IVMFunction::AddBreakpointImpl(Breakpoint* breakpoint) {\n auto i = GetIntCodeAtSourceOffset(breakpoint->address());\n if (!i) {\n return 1;\n }\n\n \/\/ TEMP breakpoints always overwrite normal ones.\n if (!i->debug_flags ||\n breakpoint->type() == Breakpoint::TEMP_TYPE) {\n uint64_t breakpoint_ptr = (uint64_t)breakpoint;\n i->src2_reg = (uint32_t)breakpoint_ptr;\n i->src3_reg = (uint32_t)(breakpoint_ptr >> 32);\n }\n\n \/\/ Increment breakpoint counter.\n ++i->debug_flags;\n\n return 0;\n}\n\nint IVMFunction::RemoveBreakpointImpl(Breakpoint* breakpoint) {\n auto i = GetIntCodeAtSourceOffset(breakpoint->address());\n if (!i) {\n return 1;\n }\n\n \/\/ Decrement breakpoint counter.\n --i->debug_flags;\n i->src2_reg = i->src3_reg = 0;\n\n \/\/ If there were other breakpoints, see what they were.\n if (i->debug_flags) {\n auto old_breakpoint = FindBreakpoint(breakpoint->address());\n if (old_breakpoint) {\n uint64_t breakpoint_ptr = (uint64_t)old_breakpoint;\n i->src2_reg = (uint32_t)breakpoint_ptr;\n i->src3_reg = (uint32_t)(breakpoint_ptr >> 32);\n }\n }\n\n return 0;\n}\n\nvoid IVMFunction::OnBreakpointHit(ThreadState* thread_state, IntCode* i) {\n uint64_t breakpoint_ptr = i->src2_reg | (uint64_t(i->src3_reg) << 32);\n Breakpoint* breakpoint = (Breakpoint*)breakpoint_ptr;\n\n \/\/ Notify debugger.\n \/\/ The debugger may choose to wait (blocking us).\n auto debugger = thread_state->runtime()->debugger();\n debugger->OnBreakpointHit(thread_state, breakpoint);\n}\n\nint IVMFunction::CallImpl(ThreadState* thread_state, uint64_t return_address) {\n \/\/ Setup register file on stack.\n auto stack = (IVMStack*)thread_state->backend_data();\n auto register_file = (Register*)stack->Alloc(register_count_);\n\n Memory* memory = thread_state->memory();\n\n IntCodeState ics;\n ics.rf = register_file;\n ics.context = (uint8_t*)thread_state->raw_context();\n ics.membase = memory->membase();\n ics.reserve_address = memory->reserve_address();\n ics.did_carry = 0;\n ics.did_saturate = 0;\n ics.access_callbacks = thread_state->runtime()->access_callbacks();\n ics.thread_state = thread_state;\n ics.return_address = return_address;\n ics.call_return_address = 0;\n\n volatile int* suspend_flag_address = thread_state->suspend_flag_address();\n\n \/\/ TODO(benvanik): DID_CARRY -- need HIR to set a OPCODE_FLAG_SET_CARRY\n \/\/ or something so the fns can set an ics flag.\n\n#ifdef XE_DEBUG\n size_t source_index = 0;\n#endif\n\n uint32_t ia = 0;\n while (true) {\n \/\/ Check suspend. We could do this only on certain instructions, if we\n \/\/ wanted to speed things up.\n if (*suspend_flag_address) {\n thread_state->EnterSuspend();\n }\n\n#ifdef XE_DEBUG\n uint64_t source_offset = -1;\n if (source_index < this->source_map_count_ &&\n this->source_map_[source_index].intcode_index <= ia)\n {\n while (source_index + 1 < this->source_map_count_ &&\n this->source_map_[source_index + 1].intcode_index <= ia)\n {\n source_index++;\n }\n source_offset = this->source_map_[source_index].source_offset;\n }\n#endif\n\n IntCode* i = &intcodes_[ia];\n\n if (i->debug_flags) {\n OnBreakpointHit(thread_state, i);\n }\n\n uint32_t new_ia = i->intcode_fn(ics, i);\n if (new_ia == IA_NEXT) {\n ia++;\n } else if (new_ia == IA_RETURN) {\n break;\n } else {\n ia = new_ia;\n#ifdef XE_DEBUG\n source_index = 0;\n#endif\n }\n }\n\n stack->Free(register_count_);\n\n return 0;\n}\n<commit_msg>I totally did not violate coding conventions in the last commit.<commit_after>\/**\n ******************************************************************************\n * Xenia : Xbox 360 Emulator Research Project *\n ******************************************************************************\n * Copyright 2013 Ben Vanik. All rights reserved. *\n * Released under the BSD license - see LICENSE in the root for more details. *\n ******************************************************************************\n *\/\n\n#include <alloy\/backend\/ivm\/ivm_function.h>\n\n#include <alloy\/backend\/ivm\/ivm_stack.h>\n#include <alloy\/backend\/tracing.h>\n#include <alloy\/runtime\/runtime.h>\n#include <alloy\/runtime\/thread_state.h>\n\nusing namespace alloy;\nusing namespace alloy::backend;\nusing namespace alloy::backend::ivm;\nusing namespace alloy::runtime;\n\n\nIVMFunction::IVMFunction(FunctionInfo* symbol_info) :\n register_count_(0), intcode_count_(0), intcodes_(0),\n source_map_count_(0), source_map_(0),\n GuestFunction(symbol_info) {\n}\n\nIVMFunction::~IVMFunction() {\n xe_free(intcodes_);\n xe_free(source_map_);\n}\n\nvoid IVMFunction::Setup(TranslationContext& ctx) {\n register_count_ = ctx.register_count;\n intcode_count_ = ctx.intcode_count;\n intcodes_ = (IntCode*)ctx.intcode_arena->CloneContents();\n source_map_count_ = ctx.source_map_count;\n source_map_ = (SourceMapEntry*)ctx.source_map_arena->CloneContents();\n}\n\nIntCode* IVMFunction::GetIntCodeAtSourceOffset(uint64_t offset) {\n for (size_t n = 0; n < source_map_count_; n++) {\n auto entry = &source_map_[n];\n if (entry->source_offset == offset) {\n return &intcodes_[entry->intcode_index];\n }\n }\n return NULL;\n}\n\nint IVMFunction::AddBreakpointImpl(Breakpoint* breakpoint) {\n auto i = GetIntCodeAtSourceOffset(breakpoint->address());\n if (!i) {\n return 1;\n }\n\n \/\/ TEMP breakpoints always overwrite normal ones.\n if (!i->debug_flags ||\n breakpoint->type() == Breakpoint::TEMP_TYPE) {\n uint64_t breakpoint_ptr = (uint64_t)breakpoint;\n i->src2_reg = (uint32_t)breakpoint_ptr;\n i->src3_reg = (uint32_t)(breakpoint_ptr >> 32);\n }\n\n \/\/ Increment breakpoint counter.\n ++i->debug_flags;\n\n return 0;\n}\n\nint IVMFunction::RemoveBreakpointImpl(Breakpoint* breakpoint) {\n auto i = GetIntCodeAtSourceOffset(breakpoint->address());\n if (!i) {\n return 1;\n }\n\n \/\/ Decrement breakpoint counter.\n --i->debug_flags;\n i->src2_reg = i->src3_reg = 0;\n\n \/\/ If there were other breakpoints, see what they were.\n if (i->debug_flags) {\n auto old_breakpoint = FindBreakpoint(breakpoint->address());\n if (old_breakpoint) {\n uint64_t breakpoint_ptr = (uint64_t)old_breakpoint;\n i->src2_reg = (uint32_t)breakpoint_ptr;\n i->src3_reg = (uint32_t)(breakpoint_ptr >> 32);\n }\n }\n\n return 0;\n}\n\nvoid IVMFunction::OnBreakpointHit(ThreadState* thread_state, IntCode* i) {\n uint64_t breakpoint_ptr = i->src2_reg | (uint64_t(i->src3_reg) << 32);\n Breakpoint* breakpoint = (Breakpoint*)breakpoint_ptr;\n\n \/\/ Notify debugger.\n \/\/ The debugger may choose to wait (blocking us).\n auto debugger = thread_state->runtime()->debugger();\n debugger->OnBreakpointHit(thread_state, breakpoint);\n}\n\nint IVMFunction::CallImpl(ThreadState* thread_state, uint64_t return_address) {\n \/\/ Setup register file on stack.\n auto stack = (IVMStack*)thread_state->backend_data();\n auto register_file = (Register*)stack->Alloc(register_count_);\n\n Memory* memory = thread_state->memory();\n\n IntCodeState ics;\n ics.rf = register_file;\n ics.context = (uint8_t*)thread_state->raw_context();\n ics.membase = memory->membase();\n ics.reserve_address = memory->reserve_address();\n ics.did_carry = 0;\n ics.did_saturate = 0;\n ics.access_callbacks = thread_state->runtime()->access_callbacks();\n ics.thread_state = thread_state;\n ics.return_address = return_address;\n ics.call_return_address = 0;\n\n volatile int* suspend_flag_address = thread_state->suspend_flag_address();\n\n \/\/ TODO(benvanik): DID_CARRY -- need HIR to set a OPCODE_FLAG_SET_CARRY\n \/\/ or something so the fns can set an ics flag.\n\n#ifdef XE_DEBUG\n size_t source_index = 0;\n#endif\n\n uint32_t ia = 0;\n while (true) {\n \/\/ Check suspend. We could do this only on certain instructions, if we\n \/\/ wanted to speed things up.\n if (*suspend_flag_address) {\n thread_state->EnterSuspend();\n }\n\n#ifdef XE_DEBUG\n uint64_t source_offset = -1;\n if (source_index < this->source_map_count_ &&\n this->source_map_[source_index].intcode_index <= ia) {\n while (source_index + 1 < this->source_map_count_ &&\n this->source_map_[source_index + 1].intcode_index <= ia) {\n source_index++;\n }\n source_offset = this->source_map_[source_index].source_offset;\n }\n#endif\n\n IntCode* i = &intcodes_[ia];\n\n if (i->debug_flags) {\n OnBreakpointHit(thread_state, i);\n }\n\n uint32_t new_ia = i->intcode_fn(ics, i);\n if (new_ia == IA_NEXT) {\n ia++;\n } else if (new_ia == IA_RETURN) {\n break;\n } else {\n ia = new_ia;\n#ifdef XE_DEBUG\n source_index = 0;\n#endif\n }\n }\n\n stack->Free(register_count_);\n\n return 0;\n}\n<|endoftext|>"} {"text":"<commit_before>\/\/ Jubatus: Online machine learning framework for distributed environment\n\/\/ Copyright (C) 2011 Preferred Infrastructure and Nippon Telegraph and Telephone Corporation.\n\/\/\n\/\/ This library is free software; you can redistribute it and\/or\n\/\/ modify it under the terms of the GNU Lesser General Public\n\/\/ License version 2.1 as published by the Free Software Foundation.\n\/\/\n\/\/ This library is distributed in the hope that it will be useful,\n\/\/ but WITHOUT ANY WARRANTY; without even the implied warranty of\n\/\/ MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU\n\/\/ Lesser General Public License for more details.\n\/\/\n\/\/ You should have received a copy of the GNU Lesser General Public\n\/\/ License along with this library; if not, write to the Free Software\n\/\/ Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA\n\n#ifndef JUBATUS_CORE_FV_CONVERTER_DATUM_HPP_\n#define JUBATUS_CORE_FV_CONVERTER_DATUM_HPP_\n\n#include <map>\n#include <string>\n#include <utility>\n#include <vector>\n#include <msgpack.hpp>\n#include <pficommon\/data\/serialization.h>\n\nnamespace jubatus {\nnamespace core {\nnamespace fv_converter {\n\nstruct datum {\n typedef std::vector<std::pair<std::string, std::string> > sv_t;\n typedef std::vector<std::pair<std::string, double> > nv_t;\n\n sv_t string_values_;\n nv_t num_values_;\n\n MSGPACK_DEFINE(string_values_, num_values_);\n\n template<class Archiver>\n void serialize(Archiver& ar) {\n std::map<std::string, std::string> sv;\n std::map<std::string, double> nv;\n if (ar.is_read) {\n ar & NAMED_MEMBER(\"string_values\", sv) & NAMED_MEMBER(\"num_values\", nv);\n string_values_ = sv_t(sv.begin(), sv.end());\n num_values_ = nv_t(nv.begin(), nv.end());\n } else {\n sv.insert(string_values_.begin(), string_values_.end());\n nv.insert(num_values_.begin(), num_values_.end());\n ar & NAMED_MEMBER(\"string_values\", sv) & NAMED_MEMBER(\"num_values\", nv);\n }\n }\n};\n\n} \/\/ namespace fv_converter\n} \/\/ namespace core\n} \/\/ namespace jubatus\n\n#endif \/\/ JUBATUS_CORE_FV_CONVERTER_DATUM_HPP_\n<commit_msg>Add binary values<commit_after>\/\/ Jubatus: Online machine learning framework for distributed environment\n\/\/ Copyright (C) 2011 Preferred Infrastructure and Nippon Telegraph and Telephone Corporation.\n\/\/\n\/\/ This library is free software; you can redistribute it and\/or\n\/\/ modify it under the terms of the GNU Lesser General Public\n\/\/ License version 2.1 as published by the Free Software Foundation.\n\/\/\n\/\/ This library is distributed in the hope that it will be useful,\n\/\/ but WITHOUT ANY WARRANTY; without even the implied warranty of\n\/\/ MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU\n\/\/ Lesser General Public License for more details.\n\/\/\n\/\/ You should have received a copy of the GNU Lesser General Public\n\/\/ License along with this library; if not, write to the Free Software\n\/\/ Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA\n\n#ifndef JUBATUS_CORE_FV_CONVERTER_DATUM_HPP_\n#define JUBATUS_CORE_FV_CONVERTER_DATUM_HPP_\n\n#include <map>\n#include <string>\n#include <utility>\n#include <vector>\n#include <msgpack.hpp>\n#include <pficommon\/data\/serialization.h>\n\nnamespace jubatus {\nnamespace core {\nnamespace fv_converter {\n\nstruct datum {\n typedef std::vector<std::pair<std::string, std::string> > sv_t;\n typedef std::vector<std::pair<std::string, double> > nv_t;\n\n sv_t string_values_;\n nv_t num_values_;\n sv_t binary_values_;\n\n MSGPACK_DEFINE(string_values_, num_values_, binary_values_);\n\n template<class Archiver>\n void serialize(Archiver& ar) {\n std::map<std::string, std::string> sv;\n std::map<std::string, double> nv;\n std::map<std::string, std::string> bv;\n if (ar.is_read) {\n ar\n & NAMED_MEMBER(\"string_values\", sv)\n & NAMED_MEMBER(\"num_values\", nv)\n & NAMED_MEMBER(\"binary_values\", bv);\n string_values_ = sv_t(sv.begin(), sv.end());\n num_values_ = nv_t(nv.begin(), nv.end());\n binary_values_ = sv_t(bv.begin(), bv.end());\n } else {\n sv.insert(string_values_.begin(), string_values_.end());\n nv.insert(num_values_.begin(), num_values_.end());\n bv.insert(binary_values_.begin(), binary_values_.end());\n ar\n & NAMED_MEMBER(\"string_values\", sv)\n & NAMED_MEMBER(\"num_values\", nv)\n & NAMED_MEMBER(\"binary_values\", bv);\n }\n }\n};\n\n} \/\/ namespace fv_converter\n} \/\/ namespace core\n} \/\/ namespace jubatus\n\n#endif \/\/ JUBATUS_CORE_FV_CONVERTER_DATUM_HPP_\n<|endoftext|>"} {"text":"<commit_before>#include \"PunchApplication.h\"\n#include \"Vis_Layers.h\"\n\nint g_argc;\nchar **g_argv;\n\nCMusicModule* CPunchApplication::m_pMusicModule = NULL;\nCLayerManager* CPunchApplication::m_pLayerManager = NULL;\n\nCPunchApplication::CPunchApplication()\n{\n\n}\n\nCPunchApplication::~CPunchApplication()\n{\n\n}\n\nvoid CPunchApplication::Initialize()\n{\n\tInitializeGLFW();\n\tInitializeGLEW();\n\tInitializeMusicModule();\n\tInitializeLayerManager();\n}\n\nvoid CPunchApplication::InitializeMusicModule()\n{\n\tif(MUSIC_MODULE_TYPE == MM_BASS)\n\t\tm_pMusicModule = new CBASSModule();\n\n\tif(!m_pMusicModule)\n\t{\n\t\tif(MUSIC_MODULE_TYPE == MM_UNDEFINED)\n\t\t\tExit(APP_ERROR_MUSIC_MODULE_UNDEFINED);\n\t\telse\n\t\t\tExit(APP_ERROR_UNDEFINED);\n\t}\n\n\tif(m_pMusicModule->Initialize() == APP_ERROR_BASS_INIT)\n\t\tExit(APP_ERROR_BASS_INIT);\n\n\tPopulatePlaylist();\n\tm_pMusicModule->MusicPlayNextItem();\n}\n\n\nvoid CPunchApplication::InitializeLayerManager()\n{\n\tm_pLayerManager = new CLayerManager();\n\n\tm_pLayerManager->AddLayer(new CVis_TestLayer1(0.1f, 0.5f, 0.2f, 3, SimpleColor(0.4f,0.6f,1.0f)));\n\tm_pLayerManager->AddLayer(new CVis_TestLayer1(0.001f, 0.05f, 0.3f, 70, SimpleColor(1.0f,1.0f,1.0f)));\n\tm_pLayerManager->AddLayer(new CVis_TestLayer1(0.05f, 0.2f, 0.12f, 30, SimpleColor(0.2f,1.0f,0.4f)));\n\n\tm_pLayerManager->AddLayer(new CVis_TestLayer1());\n\n\tint iCount = 10;\n\tfor(int i=1;i<=iCount;i++)\n\t{\n\t\tint iFreqStep = i * i * 4;\n\t\tif(iFreqStep > FFT_DATAARRAY_SIZE)\n\t\t\tbreak;\n\t\tm_pLayerManager->AddLayer(new CVis_CubeWalking(iFreqStep));\n\t}\n\n\tm_pLayerManager->AddLayer(new CVis_Spectrum());\n}\n\nvoid CPunchApplication::PopulatePlaylist()\n{\n#ifdef _WIN32\n\tif(g_argc < 2)\n\t{\n\t\tprintf(\"Error: No audio files added.\\n\");\n\t\t\/\/MessageBoxA(glfwGetWin32Window(m_pAppWindow), , \"Error\", MB_OK|MB_ICONERROR|MB_APPLMODAL);\n\t\tExit(APP_ERROR_PLAYLIST_INVALID,\"To use Punch you will have to drag an audio file onto the .exe\");\n\t}\n#endif\n\n\tfor(int i=1;i<g_argc;i++)\n\t{\n\t\tprintf(\"Adding to playlist: %s\\n\",g_argv[i]);\n\t\tm_pMusicModule->PlaylistAddItem(g_argv[i]);\n\t}\n}\n\nvoid CPunchApplication::InitializeGLEW()\n{\n\tGLenum res = glewInit();\n\tif (res != GLEW_OK)\n\t{\n\t\tprintf(\"Error: '%s'\\n\", glewGetErrorString(res));\n\t\tExit(APP_ERROR_GLEW_INIT);\n\t}\n}\n\nvoid CPunchApplication::InitializeGLFW()\n{\n\t\/\/Initialize GLFW\n\tif (!glfwInit())\n\t\tExit(APP_ERROR_GLFW_INIT);\n\n\t\/\/Window creation\n\tglfwWindowHint( GLFW_RESIZABLE, GL_FALSE );\n#ifdef WINDOW_NO_BORDER\n\tglfwWindowHint( GLFW_DECORATED, GL_FALSE ); \/\/noborder\n#endif\n\n\t\/\/ Get monitor video mode properties\n\tconst GLFWvidmode* sVideoMode = glfwGetVideoMode(glfwGetPrimaryMonitor());\n\t\n\t\/\/m_pAppWindow = glfwCreateWindow(sVideoMode->width, sVideoMode->height, APP_WINDOW_TITLE, glfwGetPrimaryMonitor(), NULL); \/\/fullscreen\n#ifdef WINDOW_HALF_SIZE\n\tm_pAppWindow = glfwCreateWindow((int)(sVideoMode->width \/ 1.5), (int)(sVideoMode->height \/ 1.5), APP_WINDOW_TITLE, NULL, NULL);\n#else\n\tm_pAppWindow = glfwCreateWindow(sVideoMode->width, sVideoMode->height, APP_WINDOW_TITLE, NULL, NULL);\n#endif\n\n\tif (!m_pAppWindow)\n\t{\n\t\tglfwTerminate();\n\t\tExit(APP_ERROR_GLFW_WINDOW);\n\t}\n\n\t\/\/Make window's context current\n\tglfwMakeContextCurrent(m_pAppWindow);\n\n\tglfwSetKeyCallback(m_pAppWindow,CPunchApplication::HandleKeyEvents);\n\tglfwSwapInterval(0);\n}\n\nGLuint VBO;\t\t\t\t\t\/\/temp\nstd::vector<glm::vec3> points;\t\/\/temp\nvoid CPunchApplication::MainLoop()\n{\n\t\n\tpoints.push_back(glm::vec3(0.0f,0.0f,0.0f));\n\n\tglGenBuffers(1, &VBO);\n\tglBindBuffer(GL_ARRAY_BUFFER, VBO);\n\tglBufferData(GL_ARRAY_BUFFER, points.size() * sizeof(glm::vec3), &points[0], GL_STATIC_DRAW);\n\n\t\/\/Loop as long as the window is open\n\twhile (!glfwWindowShouldClose(m_pAppWindow))\n\t{\n\t\t\/\/Logic tick\n\t\tif(GetDeltaTime() > (1.0\/60.0))\n\t\t{\t\t\t\n\t\t\tHandleLogic();\n\t\t\t\n\t\t\tHandleDraw();\n\n\t\t\tUpdateDeltaTime();\n\t\t}\n\n\t\t\/\/Poll events\n\t\tglfwPollEvents();\n\t}\n\n\tpoints.clear();\n}\n\nvoid CPunchApplication::HandleLogic()\n{\n\tif(m_pMusicModule)\n\t{\n\t\tm_pMusicModule->Think();\n\t\tif(m_pLayerManager)\n\t\t\tm_pLayerManager->UpdateLayers(m_pMusicModule->GetFFTData());\n\t}\n}\n\nunsigned int iUnfocusedDrawController = 0;\nvoid CPunchApplication::HandleDraw()\n{\n\t\/\/ Check if window is focused\n\tif (!glfwGetWindowAttrib(m_pAppWindow, GLFW_FOCUSED))\n\t{\n\t\tiUnfocusedDrawController++;\n\t\tif(iUnfocusedDrawController % 2 != 0)\n\t\t\treturn;\n\t}\n\n\t\/\/ Draw scene\n\tglClear(GL_COLOR_BUFFER_BIT | GL_DEPTH_BUFFER_BIT);\n\n\tm_pLayerManager->DrawLayers();\n\n\tglPointSize(4.0f);\n\n\t\/\/Swap front and back buffers\n\tglfwSwapBuffers(m_pAppWindow);\n}\n\nvoid CPunchApplication::HandleKeyEvents(GLFWwindow* window, int key, int scancode, int action, int mods)\n{\n\tif (key == GLFW_KEY_ESCAPE && action == GLFW_PRESS)\n\t\tglfwSetWindowShouldClose(window, GL_TRUE);\n\tif (key == GLFW_KEY_RIGHT && action == GLFW_PRESS)\n\t{\n\t\tif(m_pMusicModule)\n\t\t\tm_pMusicModule->MusicPlayNextItem();\n\t\tm_pLayerManager->ResetLayers();\n\t}\n\tif (key == GLFW_KEY_LEFT && action == GLFW_PRESS)\n\t{\n\t\tif(m_pMusicModule)\n\t\t\tm_pMusicModule->MusicPlayPreviousItem();\n\t}\n}\n\ndouble CPunchApplication::GetDeltaTime()\n{\n\treturn glfwGetTime() - m_dTimeLastFrame;\n}\n\nvoid CPunchApplication::UpdateDeltaTime()\n{\n\tm_dTimeLastFrame = glfwGetTime();\n}\n\nvoid CPunchApplication::Run()\n{\n\tprintf(\"Starting %s!\\n\", APP_WINDOW_TITLE);\n\tInitialize();\n\tMainLoop();\n}\n\nvoid CPunchApplication::Exit()\n{\n\texit(0);\n}\n\nvoid CPunchApplication::Exit(int iErrorCode)\n{\n\tprintf(\"Exiting with error code %i\\n\", iErrorCode);\n#ifdef _WIN32\n\tchar cErrorMsg[128];\n\tsprintf_s(cErrorMsg,128,\"Code: %i\",iErrorCode);\n\tif(cErrorMsg)\n\t{\n\t\tMessageBoxA(glfwGetWin32Window(m_pAppWindow), cErrorMsg, \"Error\", MB_OK|MB_ICONERROR|MB_APPLMODAL);\n\t}\n#endif\n\texit(iErrorCode);\n}\n\nvoid CPunchApplication::Exit(int iErrorCode, const char* cErrorMessage)\n{\n\tprintf(\"Exiting with error code %i\\n\", iErrorCode);\n#ifdef _WIN32\n\tchar cErrorMsg[128];\n\tsprintf_s(cErrorMsg,128,\"Code: %i\\nMessage: %s\",iErrorCode,cErrorMessage);\n\tif(cErrorMsg)\n\t{\n\t\tMessageBoxA(glfwGetWin32Window(m_pAppWindow), cErrorMsg, \"Error\", MB_OK|MB_ICONERROR|MB_APPLMODAL);\n\t}\n#endif\n\texit(iErrorCode);\n}\n\n\/\/Entry point\nint main(int argc, char *argv[])\n{\n\tg_argc = argc;\n\tg_argv = argv;\n\n\tCPunchApplication cPunchApp;\n\tcPunchApp.Run(); \/\/Run CPunchApplication\n}<commit_msg>Removed focus frame limiter.<commit_after>#include \"PunchApplication.h\"\n#include \"Vis_Layers.h\"\n\nint g_argc;\nchar **g_argv;\n\nCMusicModule* CPunchApplication::m_pMusicModule = NULL;\nCLayerManager* CPunchApplication::m_pLayerManager = NULL;\n\nCPunchApplication::CPunchApplication()\n{\n\n}\n\nCPunchApplication::~CPunchApplication()\n{\n\n}\n\nvoid CPunchApplication::Initialize()\n{\n\tInitializeGLFW();\n\tInitializeGLEW();\n\tInitializeMusicModule();\n\tInitializeLayerManager();\n}\n\nvoid CPunchApplication::InitializeMusicModule()\n{\n\tif(MUSIC_MODULE_TYPE == MM_BASS)\n\t\tm_pMusicModule = new CBASSModule();\n\n\tif(!m_pMusicModule)\n\t{\n\t\tif(MUSIC_MODULE_TYPE == MM_UNDEFINED)\n\t\t\tExit(APP_ERROR_MUSIC_MODULE_UNDEFINED);\n\t\telse\n\t\t\tExit(APP_ERROR_UNDEFINED);\n\t}\n\n\tif(m_pMusicModule->Initialize() == APP_ERROR_BASS_INIT)\n\t\tExit(APP_ERROR_BASS_INIT);\n\n\tPopulatePlaylist();\n\tm_pMusicModule->MusicPlayNextItem();\n}\n\n\nvoid CPunchApplication::InitializeLayerManager()\n{\n\tm_pLayerManager = new CLayerManager();\n\n\tm_pLayerManager->AddLayer(new CVis_TestLayer1(0.1f, 0.5f, 0.2f, 3, SimpleColor(0.4f,0.6f,1.0f)));\n\tm_pLayerManager->AddLayer(new CVis_TestLayer1(0.001f, 0.05f, 0.3f, 70, SimpleColor(1.0f,1.0f,1.0f)));\n\tm_pLayerManager->AddLayer(new CVis_TestLayer1(0.05f, 0.2f, 0.12f, 30, SimpleColor(0.2f,1.0f,0.4f)));\n\n\tm_pLayerManager->AddLayer(new CVis_TestLayer1());\n\n\tint iCount = 10;\n\tfor(int i=1;i<=iCount;i++)\n\t{\n\t\tint iFreqStep = i * i * 4;\n\t\tif(iFreqStep > FFT_DATAARRAY_SIZE)\n\t\t\tbreak;\n\t\tm_pLayerManager->AddLayer(new CVis_CubeWalking(iFreqStep));\n\t}\n\n\tm_pLayerManager->AddLayer(new CVis_Spectrum());\n}\n\nvoid CPunchApplication::PopulatePlaylist()\n{\n#ifdef _WIN32\n\tif(g_argc < 2)\n\t{\n\t\tprintf(\"Error: No audio files added.\\n\");\n\t\t\/\/MessageBoxA(glfwGetWin32Window(m_pAppWindow), , \"Error\", MB_OK|MB_ICONERROR|MB_APPLMODAL);\n\t\tExit(APP_ERROR_PLAYLIST_INVALID,\"To use Punch you will have to drag an audio file onto the .exe\");\n\t}\n#endif\n\n\tfor(int i=1;i<g_argc;i++)\n\t{\n\t\tprintf(\"Adding to playlist: %s\\n\",g_argv[i]);\n\t\tm_pMusicModule->PlaylistAddItem(g_argv[i]);\n\t}\n}\n\nvoid CPunchApplication::InitializeGLEW()\n{\n\tGLenum res = glewInit();\n\tif (res != GLEW_OK)\n\t{\n\t\tprintf(\"Error: '%s'\\n\", glewGetErrorString(res));\n\t\tExit(APP_ERROR_GLEW_INIT);\n\t}\n}\n\nvoid CPunchApplication::InitializeGLFW()\n{\n\t\/\/Initialize GLFW\n\tif (!glfwInit())\n\t\tExit(APP_ERROR_GLFW_INIT);\n\n\t\/\/Window creation\n\tglfwWindowHint( GLFW_RESIZABLE, GL_FALSE );\n#ifdef WINDOW_NO_BORDER\n\tglfwWindowHint( GLFW_DECORATED, GL_FALSE ); \/\/noborder\n#endif\n\n\t\/\/ Get monitor video mode properties\n\tconst GLFWvidmode* sVideoMode = glfwGetVideoMode(glfwGetPrimaryMonitor());\n\t\n\t\/\/m_pAppWindow = glfwCreateWindow(sVideoMode->width, sVideoMode->height, APP_WINDOW_TITLE, glfwGetPrimaryMonitor(), NULL); \/\/fullscreen\n#ifdef WINDOW_HALF_SIZE\n\tm_pAppWindow = glfwCreateWindow((int)(sVideoMode->width \/ 1.5), (int)(sVideoMode->height \/ 1.5), APP_WINDOW_TITLE, NULL, NULL);\n#else\n\tm_pAppWindow = glfwCreateWindow(sVideoMode->width, sVideoMode->height, APP_WINDOW_TITLE, NULL, NULL);\n#endif\n\n\tif (!m_pAppWindow)\n\t{\n\t\tglfwTerminate();\n\t\tExit(APP_ERROR_GLFW_WINDOW);\n\t}\n\n\t\/\/Make window's context current\n\tglfwMakeContextCurrent(m_pAppWindow);\n\n\tglfwSetKeyCallback(m_pAppWindow,CPunchApplication::HandleKeyEvents);\n\tglfwSwapInterval(0);\n}\n\nGLuint VBO;\t\t\t\t\t\/\/temp\nstd::vector<glm::vec3> points;\t\/\/temp\nvoid CPunchApplication::MainLoop()\n{\n\t\n\tpoints.push_back(glm::vec3(0.0f,0.0f,0.0f));\n\n\tglGenBuffers(1, &VBO);\n\tglBindBuffer(GL_ARRAY_BUFFER, VBO);\n\tglBufferData(GL_ARRAY_BUFFER, points.size() * sizeof(glm::vec3), &points[0], GL_STATIC_DRAW);\n\n\t\/\/Loop as long as the window is open\n\twhile (!glfwWindowShouldClose(m_pAppWindow))\n\t{\n\t\t\/\/Logic tick\n\t\tif(GetDeltaTime() > (1.0\/60.0))\n\t\t{\t\t\t\n\t\t\tHandleLogic();\n\t\t\t\n\t\t\tHandleDraw();\n\n\t\t\tUpdateDeltaTime();\n\t\t}\n\n\t\t\/\/Poll events\n\t\tglfwPollEvents();\n\t}\n\n\tpoints.clear();\n}\n\nvoid CPunchApplication::HandleLogic()\n{\n\tif(m_pMusicModule)\n\t{\n\t\tm_pMusicModule->Think();\n\t\tif(m_pLayerManager)\n\t\t\tm_pLayerManager->UpdateLayers(m_pMusicModule->GetFFTData());\n\t}\n}\n\nvoid CPunchApplication::HandleDraw()\n{\n\t\/\/ Draw scene\n\tglClear(GL_COLOR_BUFFER_BIT | GL_DEPTH_BUFFER_BIT);\n\n\tm_pLayerManager->DrawLayers();\n\n\tglPointSize(4.0f);\n\n\t\/\/Swap front and back buffers\n\tglfwSwapBuffers(m_pAppWindow);\n}\n\nvoid CPunchApplication::HandleKeyEvents(GLFWwindow* window, int key, int scancode, int action, int mods)\n{\n\tif (key == GLFW_KEY_ESCAPE && action == GLFW_PRESS)\n\t\tglfwSetWindowShouldClose(window, GL_TRUE);\n\tif (key == GLFW_KEY_RIGHT && action == GLFW_PRESS)\n\t{\n\t\tif(m_pMusicModule)\n\t\t\tm_pMusicModule->MusicPlayNextItem();\n\t\tm_pLayerManager->ResetLayers();\n\t}\n\tif (key == GLFW_KEY_LEFT && action == GLFW_PRESS)\n\t{\n\t\tif(m_pMusicModule)\n\t\t\tm_pMusicModule->MusicPlayPreviousItem();\n\t}\n}\n\ndouble CPunchApplication::GetDeltaTime()\n{\n\treturn glfwGetTime() - m_dTimeLastFrame;\n}\n\nvoid CPunchApplication::UpdateDeltaTime()\n{\n\tm_dTimeLastFrame = glfwGetTime();\n}\n\nvoid CPunchApplication::Run()\n{\n\tprintf(\"Starting %s!\\n\", APP_WINDOW_TITLE);\n\tInitialize();\n\tMainLoop();\n}\n\nvoid CPunchApplication::Exit()\n{\n\texit(0);\n}\n\nvoid CPunchApplication::Exit(int iErrorCode)\n{\n\tprintf(\"Exiting with error code %i\\n\", iErrorCode);\n#ifdef _WIN32\n\tchar cErrorMsg[128];\n\tsprintf_s(cErrorMsg,128,\"Code: %i\",iErrorCode);\n\tif(cErrorMsg)\n\t{\n\t\tMessageBoxA(glfwGetWin32Window(m_pAppWindow), cErrorMsg, \"Error\", MB_OK|MB_ICONERROR|MB_APPLMODAL);\n\t}\n#endif\n\texit(iErrorCode);\n}\n\nvoid CPunchApplication::Exit(int iErrorCode, const char* cErrorMessage)\n{\n\tprintf(\"Exiting with error code %i\\n\", iErrorCode);\n#ifdef _WIN32\n\tchar cErrorMsg[128];\n\tsprintf_s(cErrorMsg,128,\"Code: %i\\nMessage: %s\",iErrorCode,cErrorMessage);\n\tif(cErrorMsg)\n\t{\n\t\tMessageBoxA(glfwGetWin32Window(m_pAppWindow), cErrorMsg, \"Error\", MB_OK|MB_ICONERROR|MB_APPLMODAL);\n\t}\n#endif\n\texit(iErrorCode);\n}\n\n\/\/Entry point\nint main(int argc, char *argv[])\n{\n\tg_argc = argc;\n\tg_argv = argv;\n\n\tCPunchApplication cPunchApp;\n\tcPunchApp.Run(); \/\/Run CPunchApplication\n}<|endoftext|>"} {"text":"<commit_before>#include <qheaderview.h>\n#include <qsplitter.h>\n#include <QHBoxLayout>\n#include <kapplication.h>\n#include <kmainwindow.h>\n#include <kcmdlineargs.h>\n#include <kaboutdata.h>\n#include <kurl.h>\n#include <ksystemtimezone.h>\n#include <QLineEdit>\n\n#include <akonadi\/collection.h>\n#include <akonadi\/collectionview.h>\n#include <akonadi\/collectionfilterproxymodel.h>\n#include <akonadi\/collectionmodel.h>\n#include <akonadi\/collectionview.h>\n#include <akonadi\/collectiondeletejob.h>\n#include <akonadi\/itemmodel.h>\n#include <akonadi\/itemview.h>\n#include <akonadi\/standardactionmanager.h>\n#include <akonadi\/agenttypedialog.h>\n#include <akonadi\/agentinstancewidget.h>\n#include <akonadi\/agentmanager.h>\n#include <akonadi\/agentinstancecreatejob.h>\n#include <akonadi\/agentfilterproxymodel.h>\n#include <akonadi\/control.h>\n#include <akonadi\/itemfetchscope.h>\n\n#include <KCal\/Incidence>\n\n#include \"akonadicalendar.h\"\n#include \"calendarbase.h\"\n\n#include \"kotodoeditor.h\"\n#include \"koeventeditor.h\"\n#include \"kojournaleditor.h\"\n\nclass AKONADI_KCAL_EXPORT CalItemModel : public Akonadi::ItemModel\n{\n public:\n explicit CalItemModel(QObject *parent = 0) : Akonadi::ItemModel(parent) { fetchScope().fetchFullPayload(); }\n virtual ~CalItemModel() {}\n virtual int rowCount( const QModelIndex & parent = QModelIndex() ) const {\n return ItemModel::rowCount(parent);\n }\n virtual int columnCount( const QModelIndex & parent = QModelIndex() ) const {\n return 4;\n }\n virtual QVariant data( const QModelIndex & index, int role = Qt::DisplayRole ) const {\n if(role == Qt::DisplayRole) {\n const Akonadi::Item item = itemForIndex(index);\n const Incidence::Ptr incidence = item.hasPayload<Incidence::Ptr>() ? item.payload<Incidence::Ptr>() : Incidence::Ptr();\n if( ! incidence )\n return QVariant();\n switch( index.column() ) {\n case 0: return incidence->type(); break;\n case 1: return incidence->dtStart().toString(); break;\n case 2: return incidence->dtEnd().toString(); break;\n case 3: return incidence->summary(); break;\n }\n }\n return Akonadi::ItemModel::data(index, role);\n }\n virtual QVariant headerData( int section, Qt::Orientation orientation, int role = Qt::DisplayRole ) const {\n if(role == Qt::DisplayRole) {\n switch(section) {\n case 0: return QLatin1String(\"Type\"); break;\n case 1: return QLatin1String(\"Start\"); break;\n case 2: return QLatin1String(\"End\"); break;\n case 3: return QLatin1String(\"Summary\"); break;\n }\n }\n return Akonadi::ItemModel::headerData(section, orientation, role);\n }\n virtual QStringList mimeTypes() const {\n return QStringList()\n << QLatin1String(\"text\/uri-list\")\n << QLatin1String(\"application\/x-vnd.akonadi.calendar.event\")\n << QLatin1String(\"application\/x-vnd.akonadi.calendar.todo\")\n << QLatin1String(\"application\/x-vnd.akonadi.calendar.journal\")\n << QLatin1String(\"application\/x-vnd.akonadi.calendar.freebusy\");\n }\n};\n\nclass MainWidget : public QWidget\n{\n Q_OBJECT\n public:\n explicit MainWidget(QWidget *parent)\n : QWidget(parent)\n , m_collectionmodel(new Akonadi::CollectionModel(this))\n , m_collectionproxymodel(new Akonadi::CollectionFilterProxyModel(this))\n , m_itemmodel(new CalItemModel(this))\n {\n m_collectionproxymodel->setSourceModel(m_collectionmodel);\n m_collectionproxymodel->addMimeTypeFilter( QString::fromLatin1( \"text\/calendar\" ) );\n\n Akonadi::ItemFetchScope fetchscope;\n fetchscope.fetchFullPayload(true);\n m_itemmodel->setFetchScope(fetchscope);\n\n QLayout *layout = new QVBoxLayout(this);\n layout->setMargin(0);\n layout->setSpacing(0);\n this->setLayout(layout);\n\n QSplitter *splitter = new QSplitter(this);\n layout->addWidget(splitter);\n m_collectionview = new Akonadi::CollectionView(splitter);\n m_collectionview->header()->hide();\n m_collectionview->setModel(m_collectionproxymodel);\n m_collectionview->setRootIsDecorated(true);\n\n QWidget *mainwidget = new QWidget(splitter);\n QLayout *mainlayout = new QVBoxLayout(mainwidget);\n mainlayout->setMargin(0);\n mainlayout->setSpacing(0);\n mainwidget->setLayout(mainlayout);\n\n QLineEdit *edit = new QLineEdit(this);\n connect(edit, SIGNAL(textChanged(QString)), this, SLOT(filterChanged(QString)));\n mainlayout->addWidget(edit);\n\n m_itemview = new Akonadi::ItemView(mainwidget);\n mainlayout->addWidget(m_itemview);\n m_itemproxymodel = new QSortFilterProxyModel(m_itemview);\n m_itemproxymodel->setFilterKeyColumn(3);\n m_itemproxymodel->setSourceModel(m_itemmodel);\n m_itemview->setModel(m_itemproxymodel);\n\n splitter->setStretchFactor(1, 1);\n selectionChanged();\n connect( m_collectionview->selectionModel(), SIGNAL(selectionChanged(QItemSelection,QItemSelection)), this, SLOT(selectionChanged()) );\n connect( m_itemview, SIGNAL(activated(QModelIndex)), this, SLOT(itemActivated()) );\n }\n virtual ~MainWidget() {}\n\n private Q_SLOTS:\n\n void filterChanged(const QString &text) {\n m_itemproxymodel->setFilterWildcard(text);\n }\n \n void selectionChanged() {\n if(m_collectionview->selectionModel()->hasSelection()) {\n QModelIndex index = m_collectionview->selectionModel()->currentIndex();\n Q_ASSERT( index.isValid() );\n Akonadi::Collection collection = index.model()->data( index, Akonadi::CollectionModel::CollectionRole ).value<Akonadi::Collection>();\n Q_ASSERT( collection.isValid() );\n m_itemmodel->setCollection( collection );\n } else {\n m_itemmodel->setCollection( Akonadi::Collection::root() );\n }\n }\n\n void itemActivated() {\n QModelIndex index = m_itemview->selectionModel()->currentIndex();\n Q_ASSERT( index.isValid() );\n Akonadi::Item item = index.model()->data( index, Akonadi::ItemModel::ItemRole ).value<Akonadi::Item>();\n \/\/const Akonadi::Item::Id uid = item.id();\n Q_ASSERT( item.isValid() );\n Q_ASSERT( item.hasPayload<KCal::Incidence::Ptr>() );\n const KCal::Incidence::Ptr incidence = item.payload<KCal::Incidence::Ptr>();\n kDebug() << \"Add akonadi id=\" << item.id() << \"uid=\" << incidence->uid() << \"summary=\" << incidence->summary() << \"type=\" << incidence->type();\n\n KOrg::CalendarBase *calendar = new KOrg::AkonadiCalendar(KSystemTimeZones::local());\n \n if(incidence->type() == \"Event\") {\n KOEventEditor *editor = new KOEventEditor(this);\n editor->init();\n editor->readEvent(item);\n editor->editIncidence(item);\n editor->show();\n } else if(incidence->type() == \"Todo\") {\n KOTodoEditor *editor = new KOTodoEditor(this);\n editor->init();\n \/*\n createCategoryEditor();\n connect( editor, SIGNAL(deleteIncidenceSignal(Incidence *)), mMainView, SLOT(deleteIncidence(Incidence *)) );\n connect( mCategoryEditDialog, SIGNAL(categoryConfigChanged()), editor, SIGNAL(updateCategoryConfig()) );\n connect( editor, SIGNAL(editCategories()), mCategoryEditDialog, SLOT(show()) );\n connect( editor, SIGNAL(dialogClose(Incidence *)), mMainView, SLOT(dialogClosing(Incidence *)) );\n connect( editor, SIGNAL(editCanceled(Incidence *)), mMainView, SLOT(editCanceled(Incidence *)) );\n connect( mMainView, SIGNAL(closingDown()), editor, SLOT(reject()) );\n connect( editor, SIGNAL(deleteAttendee(Incidence *)), mMainView, SIGNAL(cancelAttendees(Incidence *)) );\n *\/\n editor->readTodo(item);\n editor->editIncidence(item);\n editor->show();\n \n } else if(incidence->type() == \"Journal\") {\n KOJournalEditor *editor = new KOJournalEditor(this);\n editor->init();\n editor->readJournal(item);\n editor->editIncidence(item);\n editor->show();\n } else {\n Q_ASSERT(false);\n }\n }\n \n private:\n Akonadi::CollectionModel *m_collectionmodel;\n Akonadi::CollectionFilterProxyModel *m_collectionproxymodel;\n Akonadi::CollectionView *m_collectionview;\n CalItemModel *m_itemmodel;\n QSortFilterProxyModel *m_itemproxymodel;\n Akonadi::ItemView *m_itemview;\n};\n\nint main(int argc, char **argv)\n{\n KAboutData about(\"incidenceeditorapp\",\n \"korganizer\",\n ki18n(\"IncidenceEditorApp\"),\n \"0.1\",\n ki18n(\"KDE application to run the KOrganizer incidenceeditor.\"),\n KAboutData::License_LGPL,\n ki18n(\"(C) 2009 Sebastian Sauer\"),\n ki18n(\"Run the KOrganizer incidenceeditor.\"),\n \"http:\/\/kdepim.kde.org\",\n \"kdepim@kde.org\");\n about.addAuthor(ki18n(\"Sebastian Sauer\"), ki18n(\"Author\"), \"sebsauer@kdab.net\");\n KCmdLineArgs::init(argc, argv, &about);\n KApplication app;\n KMainWindow *mainwindow = new KMainWindow();\n mainwindow->setCentralWidget( new MainWidget(mainwindow) );\n mainwindow->resize(QSize(800, 600).expandedTo(mainwindow->minimumSizeHint()));\n mainwindow->show();\n return app.exec();\n}\n\n#include \"main.moc\"\n<commit_msg>not needed any longer<commit_after>#include <qheaderview.h>\n#include <qsplitter.h>\n#include <QHBoxLayout>\n#include <kapplication.h>\n#include <kmainwindow.h>\n#include <kcmdlineargs.h>\n#include <kaboutdata.h>\n#include <kurl.h>\n#include <ksystemtimezone.h>\n#include <QLineEdit>\n\n#include <akonadi\/collection.h>\n#include <akonadi\/collectionview.h>\n#include <akonadi\/collectionfilterproxymodel.h>\n#include <akonadi\/collectionmodel.h>\n#include <akonadi\/collectionview.h>\n#include <akonadi\/collectiondeletejob.h>\n#include <akonadi\/itemmodel.h>\n#include <akonadi\/itemview.h>\n#include <akonadi\/standardactionmanager.h>\n#include <akonadi\/agenttypedialog.h>\n#include <akonadi\/agentinstancewidget.h>\n#include <akonadi\/agentmanager.h>\n#include <akonadi\/agentinstancecreatejob.h>\n#include <akonadi\/agentfilterproxymodel.h>\n#include <akonadi\/control.h>\n#include <akonadi\/itemfetchscope.h>\n\n#include <KCal\/Incidence>\n\n#include \"akonadicalendar.h\"\n#include \"calendarbase.h\"\n\n#include \"kotodoeditor.h\"\n#include \"koeventeditor.h\"\n#include \"kojournaleditor.h\"\n\nclass AKONADI_KCAL_EXPORT CalItemModel : public Akonadi::ItemModel\n{\n public:\n explicit CalItemModel(QObject *parent = 0) : Akonadi::ItemModel(parent) { fetchScope().fetchFullPayload(); }\n virtual ~CalItemModel() {}\n virtual int rowCount( const QModelIndex & parent = QModelIndex() ) const {\n return ItemModel::rowCount(parent);\n }\n virtual int columnCount( const QModelIndex & parent = QModelIndex() ) const {\n return 4;\n }\n virtual QVariant data( const QModelIndex & index, int role = Qt::DisplayRole ) const {\n if(role == Qt::DisplayRole) {\n const Akonadi::Item item = itemForIndex(index);\n const Incidence::Ptr incidence = item.hasPayload<Incidence::Ptr>() ? item.payload<Incidence::Ptr>() : Incidence::Ptr();\n if( ! incidence )\n return QVariant();\n switch( index.column() ) {\n case 0: return incidence->type(); break;\n case 1: return incidence->dtStart().toString(); break;\n case 2: return incidence->dtEnd().toString(); break;\n case 3: return incidence->summary(); break;\n }\n }\n return Akonadi::ItemModel::data(index, role);\n }\n virtual QVariant headerData( int section, Qt::Orientation orientation, int role = Qt::DisplayRole ) const {\n if(role == Qt::DisplayRole) {\n switch(section) {\n case 0: return QLatin1String(\"Type\"); break;\n case 1: return QLatin1String(\"Start\"); break;\n case 2: return QLatin1String(\"End\"); break;\n case 3: return QLatin1String(\"Summary\"); break;\n }\n }\n return Akonadi::ItemModel::headerData(section, orientation, role);\n }\n virtual QStringList mimeTypes() const {\n return QStringList()\n << QLatin1String(\"text\/uri-list\")\n << QLatin1String(\"application\/x-vnd.akonadi.calendar.event\")\n << QLatin1String(\"application\/x-vnd.akonadi.calendar.todo\")\n << QLatin1String(\"application\/x-vnd.akonadi.calendar.journal\")\n << QLatin1String(\"application\/x-vnd.akonadi.calendar.freebusy\");\n }\n};\n\nclass MainWidget : public QWidget\n{\n Q_OBJECT\n public:\n explicit MainWidget(QWidget *parent)\n : QWidget(parent)\n , m_collectionmodel(new Akonadi::CollectionModel(this))\n , m_collectionproxymodel(new Akonadi::CollectionFilterProxyModel(this))\n , m_itemmodel(new CalItemModel(this))\n {\n m_collectionproxymodel->setSourceModel(m_collectionmodel);\n m_collectionproxymodel->addMimeTypeFilter( QString::fromLatin1( \"text\/calendar\" ) );\n\n Akonadi::ItemFetchScope fetchscope;\n fetchscope.fetchFullPayload(true);\n m_itemmodel->setFetchScope(fetchscope);\n\n QLayout *layout = new QVBoxLayout(this);\n layout->setMargin(0);\n layout->setSpacing(0);\n this->setLayout(layout);\n\n QSplitter *splitter = new QSplitter(this);\n layout->addWidget(splitter);\n m_collectionview = new Akonadi::CollectionView(splitter);\n m_collectionview->header()->hide();\n m_collectionview->setModel(m_collectionproxymodel);\n m_collectionview->setRootIsDecorated(true);\n\n QWidget *mainwidget = new QWidget(splitter);\n QLayout *mainlayout = new QVBoxLayout(mainwidget);\n mainlayout->setMargin(0);\n mainlayout->setSpacing(0);\n mainwidget->setLayout(mainlayout);\n\n QLineEdit *edit = new QLineEdit(this);\n connect(edit, SIGNAL(textChanged(QString)), this, SLOT(filterChanged(QString)));\n mainlayout->addWidget(edit);\n\n m_itemview = new Akonadi::ItemView(mainwidget);\n mainlayout->addWidget(m_itemview);\n m_itemproxymodel = new QSortFilterProxyModel(m_itemview);\n m_itemproxymodel->setFilterKeyColumn(3);\n m_itemproxymodel->setSourceModel(m_itemmodel);\n m_itemview->setModel(m_itemproxymodel);\n\n splitter->setStretchFactor(1, 1);\n selectionChanged();\n connect( m_collectionview->selectionModel(), SIGNAL(selectionChanged(QItemSelection,QItemSelection)), this, SLOT(selectionChanged()) );\n connect( m_itemview, SIGNAL(activated(QModelIndex)), this, SLOT(itemActivated()) );\n }\n virtual ~MainWidget() {}\n\n private Q_SLOTS:\n\n void filterChanged(const QString &text) {\n m_itemproxymodel->setFilterWildcard(text);\n }\n \n void selectionChanged() {\n if(m_collectionview->selectionModel()->hasSelection()) {\n QModelIndex index = m_collectionview->selectionModel()->currentIndex();\n Q_ASSERT( index.isValid() );\n Akonadi::Collection collection = index.model()->data( index, Akonadi::CollectionModel::CollectionRole ).value<Akonadi::Collection>();\n Q_ASSERT( collection.isValid() );\n m_itemmodel->setCollection( collection );\n } else {\n m_itemmodel->setCollection( Akonadi::Collection::root() );\n }\n }\n\n void itemActivated() {\n QModelIndex index = m_itemview->selectionModel()->currentIndex();\n Q_ASSERT( index.isValid() );\n Akonadi::Item item = index.model()->data( index, Akonadi::ItemModel::ItemRole ).value<Akonadi::Item>();\n \/\/const Akonadi::Item::Id uid = item.id();\n Q_ASSERT( item.isValid() );\n Q_ASSERT( item.hasPayload<KCal::Incidence::Ptr>() );\n const KCal::Incidence::Ptr incidence = item.payload<KCal::Incidence::Ptr>();\n kDebug() << \"Add akonadi id=\" << item.id() << \"uid=\" << incidence->uid() << \"summary=\" << incidence->summary() << \"type=\" << incidence->type();\n\n if(incidence->type() == \"Event\") {\n KOEventEditor *editor = new KOEventEditor(this);\n editor->init();\n editor->readEvent(item);\n editor->editIncidence(item);\n editor->show();\n } else if(incidence->type() == \"Todo\") {\n KOTodoEditor *editor = new KOTodoEditor(this);\n editor->init();\n \/*\n createCategoryEditor();\n connect( editor, SIGNAL(deleteIncidenceSignal(Incidence *)), mMainView, SLOT(deleteIncidence(Incidence *)) );\n connect( mCategoryEditDialog, SIGNAL(categoryConfigChanged()), editor, SIGNAL(updateCategoryConfig()) );\n connect( editor, SIGNAL(editCategories()), mCategoryEditDialog, SLOT(show()) );\n connect( editor, SIGNAL(dialogClose(Incidence *)), mMainView, SLOT(dialogClosing(Incidence *)) );\n connect( editor, SIGNAL(editCanceled(Incidence *)), mMainView, SLOT(editCanceled(Incidence *)) );\n connect( mMainView, SIGNAL(closingDown()), editor, SLOT(reject()) );\n connect( editor, SIGNAL(deleteAttendee(Incidence *)), mMainView, SIGNAL(cancelAttendees(Incidence *)) );\n *\/\n editor->readTodo(item);\n editor->editIncidence(item);\n editor->show();\n \n } else if(incidence->type() == \"Journal\") {\n KOJournalEditor *editor = new KOJournalEditor(this);\n editor->init();\n editor->readJournal(item);\n editor->editIncidence(item);\n editor->show();\n } else {\n Q_ASSERT(false);\n }\n }\n \n private:\n Akonadi::CollectionModel *m_collectionmodel;\n Akonadi::CollectionFilterProxyModel *m_collectionproxymodel;\n Akonadi::CollectionView *m_collectionview;\n CalItemModel *m_itemmodel;\n QSortFilterProxyModel *m_itemproxymodel;\n Akonadi::ItemView *m_itemview;\n};\n\nint main(int argc, char **argv)\n{\n KAboutData about(\"incidenceeditorapp\",\n \"korganizer\",\n ki18n(\"IncidenceEditorApp\"),\n \"0.1\",\n ki18n(\"KDE application to run the KOrganizer incidenceeditor.\"),\n KAboutData::License_LGPL,\n ki18n(\"(C) 2009 Sebastian Sauer\"),\n ki18n(\"Run the KOrganizer incidenceeditor.\"),\n \"http:\/\/kdepim.kde.org\",\n \"kdepim@kde.org\");\n about.addAuthor(ki18n(\"Sebastian Sauer\"), ki18n(\"Author\"), \"sebsauer@kdab.net\");\n KCmdLineArgs::init(argc, argv, &about);\n KApplication app;\n KMainWindow *mainwindow = new KMainWindow();\n mainwindow->setCentralWidget( new MainWidget(mainwindow) );\n mainwindow->resize(QSize(800, 600).expandedTo(mainwindow->minimumSizeHint()));\n mainwindow->show();\n return app.exec();\n}\n\n#include \"main.moc\"\n<|endoftext|>"} {"text":"<commit_before>\/*************************************************************************\n *\n * $RCSfile: ScriptSecurityManager.cxx,v $\n *\n * $Revision: 1.3 $\n *\n * last change: $Author: dfoster $ $Date: 2003-01-28 17:09: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#include <com\/sun\/star\/lang\/XMultiComponentFactory.hpp>\n#include <com\/sun\/star\/lang\/XMultiServiceFactory.hpp>\n#include <com\/sun\/star\/beans\/XPropertySet.hpp>\n#include <com\/sun\/star\/beans\/PropertyValue.hpp>\n#include <com\/sun\/star\/util\/XMacroExpander.hpp>\n#include <com\/sun\/star\/util\/XStringSubstitution.hpp>\n#include \"ScriptSecurityManager.hxx\"\n#include <util\/util.hxx>\n#include <util\/scriptingconstants.hxx>\n\n\nusing namespace ::rtl;\nusing namespace ::osl;\nusing namespace ::com::sun::star;\nusing namespace ::com::sun::star::uno;\n\/\/using namespace ::drafts::com::sun::star::script::framework;\n\nnamespace scripting_securitymgr\n{\n\nstatic OUString s_configProv = ::rtl::OUString::createFromAscii(\n \"com.sun.star.configuration.ConfigurationProvider\");\n\nstatic OUString s_configAccess = ::rtl::OUString::createFromAscii(\n \"com.sun.star.configuration.ConfigurationAccess\");\n\n\/\/*************************************************************************\n\/\/ ScriptSecurityManager Constructor\nScriptSecurityManager::ScriptSecurityManager(\n const Reference< XComponentContext > & xContext ) throw ( RuntimeException )\n : m_xContext( xContext)\n{\n OSL_TRACE( \"< ScriptSecurityManager ctor called >\\n\" );\n validateXRef( m_xContext,\n \"ScriptSecurityManager::ScriptSecurityManager: invalid context\" );\n \/\/ test purposes only\n readConfiguration();\n}\n\nvoid ScriptSecurityManager::addScriptStorage( rtl::OUString url,\n sal_Int32 storageID)\n{\n readConfiguration();\n StoragePerm newPerm;\n newPerm.url=url;\n newPerm.storageID=storageID;\n\n \/\/ we err on the side of caution!!\n newPerm.execPermission=false;\n switch( m_officeBasic )\n {\n case 0: \/\/ never\n break;\n case 1: \/\/ according to path list\n \/\/ check path\n rtl::OUString path = url.copy( 0, url.lastIndexOf( '\/' ) );\n for(int j=m_secureURL.getLength();j>0;j--)\n {\n if( path.equals( m_secureURL[j-1] ) )\n {\n newPerm.execPermission=true;\n break;\n }\n }\n \/\/ confirm dialog\n break;\n case 2: \/\/ always\n newPerm.execPermission=true;\n break;\n default:\n \/\/\n throw RuntimeException(\n OUSTR( \"ScriptSecurityManager::addScriptStorage got invalid OfficeBasic setting\"),\n Reference< XInterface > ());\n }\n m_permissionSettings.push_back(newPerm);\n}\n\/**\n * checks to see whether the requested ScriptPeremission is allowed.\n * This was modelled after the Java AccessController, but at this time\n * we can't see a good reason not to return a bool, rather than throw\n * an exception if the request is not granted (as is the case in Java).\n *\/\nsal_Bool ScriptSecurityManager::checkPermission( const OUString & scriptStorageURL,\n const OUString & permissionRequest )\n throw ( RuntimeException )\n{\n if( permissionRequest.equals( OUString::createFromAscii( \"execute\" ) ) )\n {\n OSL_TRACE(\n \"ScriptSecurityManager::checkPermission: execute permission request for %s\",\n ::rtl::OUStringToOString( scriptStorageURI,\n RTL_TEXTENCODING_ASCII_US ).pData->buffer);\n ::std::vector< StoragePerm >::const_iterator iter;\n ::std::vector< StoragePerm >::const_iterator iterEnd =\n m_permissionSettings.end();\n for ( iter = m_permissionSettings.begin() ; iter != iterEnd; ++iter )\n {\n if ( iter->url.equals( scriptStorageURL ) )\n {\n \/\/ warning dialog if necessary\n return iter->execPermission;\n }\n }\n \/\/ we should never get here!!\n throw RuntimeException( OUString::createFromAscii( \"ScriptSecurityManager::checkPermission: storageURL not found\" ) );\n }\n else\n return sal_True;\n}\n\nvoid ScriptSecurityManager::readConfiguration()\n throw ( RuntimeException)\n{\n \/\/ get the serice manager from the context\n Reference< lang::XMultiComponentFactory > xMgr = m_xContext->getServiceManager();\n validateXRef( xMgr,\n \"ScriptSecurityManager::ScriptSecurityManager: cannot get ServiceManager\" );\n \/\/ create an instance of the ConfigurationProvider\n Reference< XInterface > xInterface = xMgr->createInstanceWithContext(\n s_configProv, m_xContext );\n validateXRef( xInterface,\n \"ScriptSecurityManager::ScriptSecurityManager: cannot get ConfigurationProvider\" );\n beans::PropertyValue configPath;\n configPath.Name = ::rtl::OUString::createFromAscii( \"nodepath\" );\n configPath.Value <<= ::rtl::OUString::createFromAscii( \"org.openoffice.Office.Common\/Security\/Scripting\" );\n Sequence < Any > aargs( 1 );\n aargs[ 0 ] <<= configPath;\n \/\/ create an instance of the ConfigurationAccess for accessing the\n \/\/ scripting security settings\n Reference < lang::XMultiServiceFactory > xFactory( xInterface, UNO_QUERY );\n validateXRef( xFactory,\n \"ScriptSecurityManager::ScriptSecurityManager: cannot get XMultiServiceFactory interface from ConfigurationProvider\" );\n xInterface = xFactory->createInstanceWithArguments( s_configAccess,\n aargs );\n validateXRef( xInterface,\n \"ScriptSecurityManager::ScriptSecurityManager: cannot get ConfigurationAccess\" );\n \/\/ get the XPropertySet interface from the ConfigurationAccess service\n Reference < beans::XPropertySet > xPropSet( xInterface, UNO_QUERY );\n Any value;\n value=xPropSet->getPropertyValue( OUSTR( \"Confirmation\" ) );\n if ( sal_False == ( value >>= m_confirmationRequired ) )\n {\n throw RuntimeException(\n OUSTR( \"ScriptSecurityManager: can't get Confirmation setting\" ),\n Reference< XInterface > () );\n }\n if ( m_confirmationRequired == sal_True )\n {\n OSL_TRACE( \"ScriptSecurityManager: confirmation is true\" );\n }\n else\n {\n OSL_TRACE( \"ScriptSecurityManager: confirmation is false\" );\n }\n value=xPropSet->getPropertyValue( OUSTR( \"Warning\" ) );\n if ( sal_False == ( value >>= m_warning ) )\n {\n throw RuntimeException(\n OUSTR( \"ScriptSecurityManager: can't get Warning setting\" ),\n Reference< XInterface > () );\n }\n if ( m_warning == sal_True )\n {\n OSL_TRACE( \"ScriptSecurityManager: warning is true\" );\n }\n else\n {\n OSL_TRACE( \"ScriptSecurityManager: warning is false\" );\n }\n value=xPropSet->getPropertyValue( OUSTR( \"OfficeBasic\" ) );\n if ( sal_False == ( value >>= m_officeBasic ) )\n {\n throw RuntimeException(\n OUSTR( \"ScriptSecurityManager: can't get OfficeBasic setting\" ),\n Reference< XInterface > () );\n }\n OSL_TRACE( \"ScriptSecurityManager: OfficeBasic = %d\", m_officeBasic );\n value=xPropSet->getPropertyValue( OUSTR( \"SecureURL\" ) );\n if ( sal_False == ( value >>= m_secureURL ) )\n {\n throw RuntimeException(\n OUSTR( \"ScriptSecurityManager: can't get SecureURL setting\" ),\n Reference< XInterface > () );\n }\n \/\/ need debug output for contents of sequence\n for(int i=m_secureURL.getLength();i>0;i--)\n {\n OSL_TRACE( \"ScriptSecurityManager: path = %s\",\n ::rtl::OUStringToOString(m_secureURL[i-1] ,\n RTL_TEXTENCODING_ASCII_US ).pData->buffer );\n\n xInterface = xMgr->createInstanceWithContext(\n ::rtl::OUString::createFromAscii(\n \"com.sun.star.util.PathSubstitution\"), m_xContext);\n validateXRef( xInterface,\n \"ScriptSecurityManager::ScriptSecurityManager: cannot get ConfigurationProvider\" );\n Reference< util::XStringSubstitution > xStringSubstitution(\n xInterface, UNO_QUERY);\n validateXRef( xStringSubstitution,\n \"ScriptSecurityManager::ScriptSecurityManager: cannot get ConfigurationProvider\" );\n OSL_TRACE( \"ScriptSecurityManager: subpath = %s\",\n ::rtl::OUStringToOString(\n xStringSubstitution->substituteVariables( m_secureURL[i-1], true ),\n RTL_TEXTENCODING_ASCII_US ).pData->buffer );\n m_secureURL[i-1] = xStringSubstitution->substituteVariables( m_secureURL[i-1], true );\n }\n for(int j=m_secureURL.getLength();j>0;j--)\n {\n OSL_TRACE( \"ScriptSecurityManager: path = %s\",\n ::rtl::OUStringToOString(m_secureURL[j-1] ,\n RTL_TEXTENCODING_ASCII_US ).pData->buffer );\n }\n}\n\n\/\/*************************************************************************\n\/\/ ScriptSecurityManager Destructor\nScriptSecurityManager::~ScriptSecurityManager()\n{\n OSL_TRACE( \"< ScriptSecurityManager dtor called >\\n\" );\n}\n\n} \/\/ Namespace\n<commit_msg>Changes needed to compile<commit_after>\/*************************************************************************\n *\n * $RCSfile: ScriptSecurityManager.cxx,v $\n *\n * $Revision: 1.4 $\n *\n * last change: $Author: npower $ $Date: 2003-01-30 16:08:41 $\n *\n * The Contents of this file are made available subject to the terms of\n * either of the following licenses\n *\n * - GNU Lesser General Public License Version 2.1\n * - Sun Industry Standards Source License Version 1.1\n *\n * Sun Microsystems Inc., October, 2000\n *\n * GNU Lesser General Public License Version 2.1\n * =============================================\n * Copyright 2000 by Sun Microsystems, Inc.\n * 901 San Antonio Road, Palo Alto, CA 94303, USA\n *\n * This library is free software; you can redistribute it and\/or\n * modify it under the terms of the GNU Lesser General Public\n * License version 2.1, as published by the Free Software Foundation.\n *\n * This library is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU\n * Lesser General Public License for more details.\n *\n * You should have received a copy of the GNU Lesser General Public\n * License along with this library; if not, write to the Free Software\n * Foundation, Inc., 59 Temple Place, Suite 330, Boston,\n * MA 02111-1307 USA\n *\n *\n * Sun Industry Standards Source License Version 1.1\n * =================================================\n * The contents of this file are subject to the Sun Industry Standards\n * Source License Version 1.1 (the \"License\"); You may not use this file\n * except in compliance with the License. You may obtain a copy of the\n * License at http:\/\/www.openoffice.org\/license.html.\n *\n * Software provided under this License is provided on an \"AS IS\" basis,\n * WITHOUT WARRANTY OF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING,\n * WITHOUT LIMITATION, WARRANTIES THAT THE SOFTWARE IS FREE OF DEFECTS,\n * MERCHANTABLE, FIT FOR A PARTICULAR PURPOSE, OR NON-INFRINGING.\n * See the License for the specific provisions governing your rights and\n * obligations concerning the Software.\n *\n * The Initial Developer of the Original Code is: Sun Microsystems, Inc.\n *\n * Copyright: 2000 by Sun Microsystems, Inc.\n *\n * All Rights Reserved.\n *\n * Contributor(s): _______________________________________\n *\n *\n ************************************************************************\/\n\n#include <com\/sun\/star\/lang\/XMultiComponentFactory.hpp>\n#include <com\/sun\/star\/lang\/XMultiServiceFactory.hpp>\n#include <com\/sun\/star\/beans\/XPropertySet.hpp>\n#include <com\/sun\/star\/beans\/PropertyValue.hpp>\n#include <com\/sun\/star\/util\/XMacroExpander.hpp>\n#include <com\/sun\/star\/util\/XStringSubstitution.hpp>\n#include \"ScriptSecurityManager.hxx\"\n#include <util\/util.hxx>\n#include <util\/scriptingconstants.hxx>\n\n\nusing namespace ::rtl;\nusing namespace ::osl;\nusing namespace ::com::sun::star;\nusing namespace ::com::sun::star::uno;\n\/\/using namespace ::drafts::com::sun::star::script::framework;\n\nnamespace scripting_securitymgr\n{\n\nstatic OUString s_configProv = ::rtl::OUString::createFromAscii(\n \"com.sun.star.configuration.ConfigurationProvider\");\n\nstatic OUString s_configAccess = ::rtl::OUString::createFromAscii(\n \"com.sun.star.configuration.ConfigurationAccess\");\n\n\/\/*************************************************************************\n\/\/ ScriptSecurityManager Constructor\nScriptSecurityManager::ScriptSecurityManager(\n const Reference< XComponentContext > & xContext ) throw ( RuntimeException )\n : m_xContext( xContext)\n{\n OSL_TRACE( \"< ScriptSecurityManager ctor called >\\n\" );\n validateXRef( m_xContext,\n \"ScriptSecurityManager::ScriptSecurityManager: invalid context\" );\n \/\/ test purposes only\n readConfiguration();\n}\n\nvoid ScriptSecurityManager::addScriptStorage( rtl::OUString url,\n sal_Int32 storageID)\n{\n readConfiguration();\n StoragePerm newPerm;\n newPerm.url=url;\n newPerm.storageID=storageID;\n\n \/\/ we err on the side of caution!!\n newPerm.execPermission=false;\n switch( m_officeBasic )\n {\n case 0: \/\/ never\n break;\n case 1: \/\/ according to path list\n {\n \/\/ check path\n rtl::OUString path = url.copy( 0, url.lastIndexOf( '\/' ) );\n for(int j=m_secureURL.getLength();j>0;j--)\n {\n if( path.equals( m_secureURL[j-1] ) )\n {\n newPerm.execPermission=true;\n break;\n }\n }\n \/\/ confirm dialog\n break;\n }\n case 2: \/\/ always\n newPerm.execPermission=true;\n break;\n default:\n \/\/\n throw RuntimeException(\n OUSTR( \"ScriptSecurityManager::addScriptStorage got invalid OfficeBasic setting\"),\n Reference< XInterface > ());\n }\n m_permissionSettings.push_back(newPerm);\n}\n\/**\n * checks to see whether the requested ScriptPeremission is allowed.\n * This was modelled after the Java AccessController, but at this time\n * we can't see a good reason not to return a bool, rather than throw\n * an exception if the request is not granted (as is the case in Java).\n *\/\nsal_Bool ScriptSecurityManager::checkPermission( const OUString & scriptStorageURL,\n const OUString & permissionRequest )\n throw ( RuntimeException )\n{\n if( permissionRequest.equals( OUString::createFromAscii( \"execute\" ) ) )\n {\n OSL_TRACE(\n \"ScriptSecurityManager::checkPermission: execute permission request for %s\",\n ::rtl::OUStringToOString( scriptStorageURL,\n RTL_TEXTENCODING_ASCII_US ).pData->buffer);\n ::std::vector< StoragePerm >::const_iterator iter;\n ::std::vector< StoragePerm >::const_iterator iterEnd =\n m_permissionSettings.end();\n for ( iter = m_permissionSettings.begin() ; iter != iterEnd; ++iter )\n {\n if ( iter->url.equals( scriptStorageURL ) )\n {\n \/\/ warning dialog if necessary\n return iter->execPermission;\n }\n }\n \/\/ we should never get here!!\n throw RuntimeException( OUString::createFromAscii( \"ScriptSecurityManager::checkPermission: storageURL not found\" ), Reference< XInterface > () );\n }\n else\n return sal_True;\n}\n\nvoid ScriptSecurityManager::readConfiguration()\n throw ( RuntimeException)\n{\n \/\/ get the serice manager from the context\n Reference< lang::XMultiComponentFactory > xMgr = m_xContext->getServiceManager();\n validateXRef( xMgr,\n \"ScriptSecurityManager::ScriptSecurityManager: cannot get ServiceManager\" );\n \/\/ create an instance of the ConfigurationProvider\n Reference< XInterface > xInterface = xMgr->createInstanceWithContext(\n s_configProv, m_xContext );\n validateXRef( xInterface,\n \"ScriptSecurityManager::ScriptSecurityManager: cannot get ConfigurationProvider\" );\n beans::PropertyValue configPath;\n configPath.Name = ::rtl::OUString::createFromAscii( \"nodepath\" );\n configPath.Value <<= ::rtl::OUString::createFromAscii( \"org.openoffice.Office.Common\/Security\/Scripting\" );\n Sequence < Any > aargs( 1 );\n aargs[ 0 ] <<= configPath;\n \/\/ create an instance of the ConfigurationAccess for accessing the\n \/\/ scripting security settings\n Reference < lang::XMultiServiceFactory > xFactory( xInterface, UNO_QUERY );\n validateXRef( xFactory,\n \"ScriptSecurityManager::ScriptSecurityManager: cannot get XMultiServiceFactory interface from ConfigurationProvider\" );\n xInterface = xFactory->createInstanceWithArguments( s_configAccess,\n aargs );\n validateXRef( xInterface,\n \"ScriptSecurityManager::ScriptSecurityManager: cannot get ConfigurationAccess\" );\n \/\/ get the XPropertySet interface from the ConfigurationAccess service\n Reference < beans::XPropertySet > xPropSet( xInterface, UNO_QUERY );\n Any value;\n value=xPropSet->getPropertyValue( OUSTR( \"Confirmation\" ) );\n if ( sal_False == ( value >>= m_confirmationRequired ) )\n {\n throw RuntimeException(\n OUSTR( \"ScriptSecurityManager: can't get Confirmation setting\" ),\n Reference< XInterface > () );\n }\n if ( m_confirmationRequired == sal_True )\n {\n OSL_TRACE( \"ScriptSecurityManager: confirmation is true\" );\n }\n else\n {\n OSL_TRACE( \"ScriptSecurityManager: confirmation is false\" );\n }\n value=xPropSet->getPropertyValue( OUSTR( \"Warning\" ) );\n if ( sal_False == ( value >>= m_warning ) )\n {\n throw RuntimeException(\n OUSTR( \"ScriptSecurityManager: can't get Warning setting\" ),\n Reference< XInterface > () );\n }\n if ( m_warning == sal_True )\n {\n OSL_TRACE( \"ScriptSecurityManager: warning is true\" );\n }\n else\n {\n OSL_TRACE( \"ScriptSecurityManager: warning is false\" );\n }\n value=xPropSet->getPropertyValue( OUSTR( \"OfficeBasic\" ) );\n if ( sal_False == ( value >>= m_officeBasic ) )\n {\n throw RuntimeException(\n OUSTR( \"ScriptSecurityManager: can't get OfficeBasic setting\" ),\n Reference< XInterface > () );\n }\n OSL_TRACE( \"ScriptSecurityManager: OfficeBasic = %d\", m_officeBasic );\n value=xPropSet->getPropertyValue( OUSTR( \"SecureURL\" ) );\n if ( sal_False == ( value >>= m_secureURL ) )\n {\n throw RuntimeException(\n OUSTR( \"ScriptSecurityManager: can't get SecureURL setting\" ),\n Reference< XInterface > () );\n }\n \/\/ need debug output for contents of sequence\n for(int i=m_secureURL.getLength();i>0;i--)\n {\n OSL_TRACE( \"ScriptSecurityManager: path = %s\",\n ::rtl::OUStringToOString(m_secureURL[i-1] ,\n RTL_TEXTENCODING_ASCII_US ).pData->buffer );\n\n xInterface = xMgr->createInstanceWithContext(\n ::rtl::OUString::createFromAscii(\n \"com.sun.star.util.PathSubstitution\"), m_xContext);\n validateXRef( xInterface,\n \"ScriptSecurityManager::ScriptSecurityManager: cannot get ConfigurationProvider\" );\n Reference< util::XStringSubstitution > xStringSubstitution(\n xInterface, UNO_QUERY);\n validateXRef( xStringSubstitution,\n \"ScriptSecurityManager::ScriptSecurityManager: cannot get ConfigurationProvider\" );\n OSL_TRACE( \"ScriptSecurityManager: subpath = %s\",\n ::rtl::OUStringToOString(\n xStringSubstitution->substituteVariables( m_secureURL[i-1], true ),\n RTL_TEXTENCODING_ASCII_US ).pData->buffer );\n m_secureURL[i-1] = xStringSubstitution->substituteVariables( m_secureURL[i-1], true );\n }\n for(int j=m_secureURL.getLength();j>0;j--)\n {\n OSL_TRACE( \"ScriptSecurityManager: path = %s\",\n ::rtl::OUStringToOString(m_secureURL[j-1] ,\n RTL_TEXTENCODING_ASCII_US ).pData->buffer );\n }\n}\n\n\/\/*************************************************************************\n\/\/ ScriptSecurityManager Destructor\nScriptSecurityManager::~ScriptSecurityManager()\n{\n OSL_TRACE( \"< ScriptSecurityManager dtor called >\\n\" );\n}\n\n} \/\/ Namespace\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 \"zorbatypes\/xqpstring.h\"\n#include \"zorbatypes\/URI.h\"\n#include \"zorbaerrors\/error_manager.h\"\n\nstruct URITestEntry\n{\n zorba::xqpString base;\n zorba::xqpString uri;\n zorba::xqpString text;\n zorba::xqpString scheme;\n int port;\n zorba::xqpString fragment;\n zorba::xqpString host;\n zorba::xqpString regbased_authority;\n zorba::xqpString path;\n zorba::xqpString userinfo;\n zorba::xqpString query;\n};\n\nint uri(int argc, char* argv[]) \n{\n zorba::xqpString foo(\"\/b\");\n if (foo.endsWith(\"\/..\"))\n std::cout << foo << \" ends with \" << \"\/..\" << std::endl;\n if (foo.endsWith(\"\/\\\\.\\\\.\"))\n std::cout << foo << \" ends with \" << \"\/\\\\.\\\\.\" << std::endl;\n\n\n URITestEntry tests[] = \n {\n {\n \"\",\n \"http:\/\/www.zorba-xquery.com\/\",\n \"http:\/\/www.zorba-xquery.com\/\",\n \"http\",\n 0,\n \"\",\n \"www.zorba-xquery.com\",\n \"\",\n \"\/\",\n \"\",\n \"\"\n },\n {\n \"\",\n \"http:\/\/www.zorba-xquery.com\/?abc=true\",\n \"http:\/\/www.zorba-xquery.com\/?abc=true\",\n \"http\",\n 0,\n \"\",\n \"www.zorba-xquery.com\",\n \"\",\n \"\/\",\n \"\",\n \"abc=true\"\n },\n {\n \"\",\n \"http:\/\/www.zorba-xquery.com:8080\/?abc=true\",\n \"http:\/\/www.zorba-xquery.com:8080\/?abc=true\",\n \"http\",\n 8080,\n \"\",\n \"www.zorba-xquery.com\",\n \"\",\n \"\/\",\n \"\",\n \"abc=true\"\n },\n {\n \"\",\n \"http:\/\/user@www.zorba-xquery.com:8080\/?abc=true\",\n \"http:\/\/user@www.zorba-xquery.com:8080\/?abc=true\",\n \"http\",\n 8080,\n \"\",\n \"www.zorba-xquery.com\",\n \"\",\n \"\/\",\n \"user\",\n \"abc=true\"\n },\n {\n \"\",\n \"http:\/\/user@www.zorba-xquery.com:8080\/path1\/path2?abc=true\",\n \"http:\/\/user@www.zorba-xquery.com:8080\/path1\/path2?abc=true\",\n \"http\",\n 8080,\n \"\",\n \"www.zorba-xquery.com\",\n \"\",\n \"\/path1\/path2\",\n \"user\",\n \"abc=true\"\n },\n {\n \"\",\n \"http:\/\/user@www.zorba-xquery.com:8080\/path1\/path2?abc=true&bcd=false#fragment\",\n \"http:\/\/user@www.zorba-xquery.com:8080\/path1\/path2?abc=true&bcd=false#fragment\",\n \"http\",\n 8080,\n \"fragment\",\n \"www.zorba-xquery.com\",\n \"\",\n \"\/path1\/path2\",\n \"user\",\n \"abc=true&bcd=false\"\n },\n {\n \"\",\n \"ftp:\/\/ftp.is.co.za\/rfc\/rfc1808.txt\",\n \"ftp:\/\/ftp.is.co.za\/rfc\/rfc1808.txt\",\n \"ftp\",\n 0,\n \"\",\n \"ftp.is.co.za\",\n \"\",\n \"\/rfc\/rfc1808.txt\",\n \"\",\n \"\"\n },\n {\n \"\",\n \"http:\/\/thomas@[2001:6f8:9000:876:cccc:bbbb::]:123\/test\",\n \"http:\/\/thomas@[2001:6f8:9000:876:cccc:bbbb::]:123\/test\",\n \"http\",\n 123,\n \"\",\n \"[2001:6f8:9000:876:cccc:bbbb::]\",\n \"\",\n \"\/test\",\n \"thomas\",\n \"\"\n },\n \/\/ uri resolver tests\n {\n \"http:\/\/a\/b\/c\/d;p?q\",\n \"g\",\n \"http:\/\/a\/b\/c\/g\",\n \"http\",\n 0,\n \"\",\n \"a\",\n \"\",\n \"\/b\/c\/g\",\n \"\",\n \"\"\n },\n {\n \"http:\/\/a\/b\/c\/d;p?q\",\n \".\/g\",\n \"http:\/\/a\/b\/c\/g\",\n \"http\",\n 0,\n \"\",\n \"a\",\n \"\",\n \"\/b\/c\/g\",\n \"\",\n \"\"\n },\n {\n \"http:\/\/a\/b\/c\/d;p?q\",\n \"g\/\",\n \"http:\/\/a\/b\/c\/g\/\",\n \"http\",\n 0,\n \"\",\n \"a\",\n \"\",\n \"\/b\/c\/g\/\",\n \"\",\n \"\"\n },\n {\n \"http:\/\/a\/b\/c\/d;p?q\",\n \"\/g\",\n \"http:\/\/a\/g\",\n \"http\",\n 0,\n \"\",\n \"a\",\n \"\",\n \"\/g\",\n \"\",\n \"\"\n },\n {\n \"http:\/\/a\/b\/c\/d;p?q\",\n \"?y\",\n \"http:\/\/a\/b\/c\/?y\",\n \"http\",\n 0,\n \"\",\n \"a\",\n \"\",\n \"\/b\/c\/\",\n \"\",\n \"y\"\n },\n {\n \"http:\/\/a\/b\/c\/d;p?q\",\n \"g?y\",\n \"http:\/\/a\/b\/c\/g?y\",\n \"http\",\n 0,\n \"\",\n \"a\",\n \"\",\n \"\/b\/c\/g\",\n \"\",\n \"y\"\n } \/\/,\n \/\/{\n \/\/ \"http:\/\/a\/b\/c\/d;p?q\",\n \/\/ \"#s\",\n \/\/ \"http:\/\/a\/b\/c\/d;p?q#s\",\n \/\/ \"http\",\n \/\/ 0,\n \/\/ \"s\",\n \/\/ \"a\",\n \/\/ \"\",\n \/\/ \"\/b\/c\/g\",\n \/\/ \"\",\n \/\/ \"\"\n \/\/}\n ,\n {\n \"http:\/\/a\/b\/c\/d;p?q\",\n \"g#s\",\n \"http:\/\/a\/b\/c\/g#s\",\n \"http\",\n 0,\n \"s\",\n \"a\",\n \"\",\n \"\/b\/c\/g\",\n \"\",\n \"\"\n },\n {\n \"http:\/\/a\/b\/c\/d;p?q\",\n \"g?y#s\",\n \"http:\/\/a\/b\/c\/g?y#s\",\n \"http\",\n 0,\n \"s\",\n \"a\",\n \"\",\n \"\/b\/c\/g\",\n \"\",\n \"y\"\n },\n {\n \"http:\/\/a\/b\/c\/d;p?q\",\n \";x\",\n \"http:\/\/a\/b\/c\/;x\",\n \"http\",\n 0,\n \"\",\n \"a\",\n \"\",\n \"\/b\/c\/;x\",\n \"\",\n \"\"\n },\n {\n \"http:\/\/a\/b\/c\/d;p?q\",\n \"g;x\",\n \"http:\/\/a\/b\/c\/g;x\",\n \"http\",\n 0,\n \"\",\n \"a\",\n \"\",\n \"\/b\/c\/g;x\",\n \"\",\n \"\"\n },\n {\n \"http:\/\/a\/b\/c\/d;p?q\",\n \"g;x?y#s\",\n \"http:\/\/a\/b\/c\/g;x?y#s\",\n \"http\",\n 0,\n \"s\",\n \"a\",\n \"\",\n \"\/b\/c\/g;x\",\n \"\",\n \"y\"\n },\n {\n \"http:\/\/a\/b\/c\/d;p?q\",\n \".\",\n \"http:\/\/a\/b\/c\/\",\n \"http\",\n 0,\n \"\",\n \"a\",\n \"\",\n \"\/b\/c\/\",\n \"\",\n \"\"\n },\n {\n \"http:\/\/a\/b\/c\/d;p?q\",\n \".\/\",\n \"http:\/\/a\/b\/c\/\",\n \"http\",\n 0,\n \"\",\n \"a\",\n \"\",\n \"\/b\/c\/\",\n \"\",\n \"\"\n },\n {\n \"http:\/\/a\/b\/c\/d;p?q\",\n \"..\",\n \"http:\/\/a\/b\/\",\n \"http\",\n 0,\n \"\",\n \"a\",\n \"\",\n \"\/b\/\",\n \"\",\n \"\"\n },\n {\n \"http:\/\/a\/b\/c\/d;p?q\",\n \"..\/\",\n \"http:\/\/a\/b\/\",\n \"http\",\n 0,\n \"\",\n \"a\",\n \"\",\n \"\/b\/\",\n \"\",\n \"\"\n },\n {\n \"http:\/\/a\/b\/c\/d;p?q\",\n \"..\/g\",\n \"http:\/\/a\/b\/g\",\n \"http\",\n 0,\n \"\",\n \"a\",\n \"\",\n \"\/b\/g\",\n \"\",\n \"\"\n },\n {\n \"http:\/\/a\/b\/c\/d;p?q\",\n \"..\/..\",\n \"http:\/\/a\/\",\n \"http\",\n 0,\n \"\",\n \"a\",\n \"\",\n \"\/\",\n \"\",\n \"\"\n },\n {\n \"http:\/\/a\/b\/c\/d;p?q\",\n \"..\/..\/\",\n \"http:\/\/a\/\",\n \"http\",\n 0,\n \"\",\n \"a\",\n \"\",\n \"\/\",\n \"\",\n \"\"\n },\n {\n \"http:\/\/a\/b\/c\/d;p?q\",\n \"..\/..\/g\",\n \"http:\/\/a\/g\",\n \"http\",\n 0,\n \"\",\n \"a\",\n \"\",\n \"\/g\",\n \"\",\n \"\"\n },\n {\n \"http:\/\/a\/b\/c\/d;p?q\",\n \"g;x=1\/.\/y\",\n \"http:\/\/a\/b\/c\/g;x=1\/y\",\n \"http\",\n 0,\n \"\",\n \"a\",\n \"\",\n \"\/b\/c\/g;x=1\/y\",\n \"\",\n \"\"\n },\n {\n \"http:\/\/a\/b\/c\/d;p?q\",\n \"g;x=1\/..\/y\",\n \"http:\/\/a\/b\/c\/y\",\n \"http\",\n 0,\n \"\",\n \"a\",\n \"\",\n \"\/b\/c\/y\",\n \"\",\n \"\"\n },\n {\n \"http:\/\/a\/b\/c\/d;p?q\",\n \"g#s\/..\/x\",\n \"http:\/\/a\/b\/c\/g#s\/..\/x\",\n \"http\",\n 0,\n \"s\/..\/x\",\n \"a\",\n \"\",\n \"\/b\/c\/g\",\n \"\",\n \"\"\n },\n {\n \"\",\n \"file:\/\/d:\/a\/b\/c\",\n \"file:\/\/d:\/a\/b\/c\",\n \"file\",\n 0,\n \"\",\n \"\",\n \"d:\",\n \"\/a\/b\/c\",\n \"\",\n \"\"\n },\n {\n \"file:\/\/\",\n \"\/a\/b\/c\",\n \"file:\/\/\/a\/b\/c\",\n \"file\",\n 0,\n \"\",\n \"\",\n \"\",\n \"\/a\/b\/c\",\n \"\",\n \"\"\n },\n {\n \"\",\n \"http:\/\/www.msb.de\",\n \"http:\/\/www.msb.de\",\n \"http\",\n 0,\n \"\",\n \"www.msb.de\",\n \"\",\n \"\",\n \"\",\n \"\"\n },\n {\n \"http:\/\/www.msb.de\/\",\n \"lib\/helpers\",\n \"http:\/\/www.msb.de\/lib\/helpers\",\n \"http\",\n 0,\n \"\",\n \"www.msb.de\",\n \"\",\n \"\/lib\/helpers\",\n \"\",\n \"\"\n }\n\n\n }; \/\/ URITestEntry tests[]\n\n\n const unsigned int test_count = sizeof(tests) \/ sizeof(tests[0]);\n try {\n for (unsigned int i = 0; i < test_count; ++i) {\n std::cout << \"executing test number \" << i << \" with uri \" << tests[i].uri << std::endl;\n \n zorba::URI uri;\n if (tests[i].base.empty()) {\n uri = zorba::URI(tests[i].uri);\n } else {\n zorba::URI base(tests[i].base);\n uri = zorba::URI(base, tests[i].uri);\n }\n if (uri.toString() != tests[i].text) {\n std::cerr << \"uri text \" << uri.toString() << \" is not equal to \" << tests[i].text << std::endl;\n return 2;\n }\n if (uri.get_scheme() != tests[i].scheme)\n return 3;\n if (uri.get_port() != tests[i].port) {\n std::cerr << \"port \" << uri.get_port() << \" is not equal to \" << tests[i].port << std::endl;\n return 4;\n }\n if (uri.get_fragment() != tests[i].fragment) {\n std::cerr << \"fragment \" << uri.get_fragment() << \" is not equal to \" << tests[i].fragment << std::endl;\n return 5;\n }\n if (uri.get_host() != tests[i].host) {\n std::cerr << \"host \" << uri.get_host() << \" is not equal to \" << tests[i].host << std::endl;\n return 6;\n }\n if (uri.get_reg_based_authority() != tests[i].regbased_authority) {\n std::cerr << \"regbased_authority \" << uri.get_reg_based_authority() << \" is not equal to \" \n << tests[i].regbased_authority << std::endl;\n return 7;\n }\n if (uri.get_user_info() != tests[i].userinfo) {\n std::cerr << \"userinfo \" << uri.get_user_info() << \" is not equal to \" << tests[i].userinfo << std::endl;\n return 8;\n }\n if (uri.get_path() != tests[i].path) {\n std::cerr << \"path \" << uri.get_path() << \" is not equal to \" << tests[i].path << std::endl;\n return 9;\n }\n if (uri.get_query() != tests[i].query) {\n std::cerr << \"query \" << uri.get_query() << \" is not equal to \" << tests[i].query << std::endl;\n return 10;\n }\n std::cout << \"result: \" << uri.toString() << std::endl;\n }\n } catch (zorba::error::ZorbaError & e) {\n std::cerr << e.theDescription << std::endl;\n return 11;\n }\n\n zorba::xqpString lToEncode(\"\/a \/b\/c\");\n zorba::xqpString lEncoded = lToEncode.encodeForUri(\"\/\",1);\n std::cout << \"encoded \" << lEncoded << std::endl;\n\n std::cout << \"decoded \" << lEncoded.decodeFromUri() << std::endl;\n\n return 0;\n\n}\n<commit_msg>Fixed uri unitest.<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 \"zorbatypes\/xqpstring.h\"\n#include \"zorbatypes\/URI.h\"\n#include \"zorbaerrors\/error_manager.h\"\n\nstruct URITestEntry\n{\n zorba::xqpString base;\n zorba::xqpString uri;\n zorba::xqpString text;\n zorba::xqpString scheme;\n int port;\n zorba::xqpString fragment;\n zorba::xqpString host;\n zorba::xqpString regbased_authority;\n zorba::xqpString path;\n zorba::xqpString userinfo;\n zorba::xqpString query;\n};\n\nint uri(int argc, char* argv[]) \n{\n zorba::xqpString foo(\"\/b\");\n if (foo.endsWith(\"\/..\"))\n std::cout << foo << \" ends with \" << \"\/..\" << std::endl;\n if (foo.endsWith(\"\/\\\\.\\\\.\"))\n std::cout << foo << \" ends with \" << \"\/\\\\.\\\\.\" << std::endl;\n\n\n URITestEntry tests[] = \n {\n {\n \"\",\n \"http:\/\/www.zorba-xquery.com\/\",\n \"http:\/\/www.zorba-xquery.com\/\",\n \"http\",\n 0,\n \"\",\n \"www.zorba-xquery.com\",\n \"\",\n \"\/\",\n \"\",\n \"\"\n },\n {\n \"\",\n \"http:\/\/www.zorba-xquery.com\/?abc=true\",\n \"http:\/\/www.zorba-xquery.com\/?abc=true\",\n \"http\",\n 0,\n \"\",\n \"www.zorba-xquery.com\",\n \"\",\n \"\/\",\n \"\",\n \"abc=true\"\n },\n {\n \"\",\n \"http:\/\/www.zorba-xquery.com:8080\/?abc=true\",\n \"http:\/\/www.zorba-xquery.com:8080\/?abc=true\",\n \"http\",\n 8080,\n \"\",\n \"www.zorba-xquery.com\",\n \"\",\n \"\/\",\n \"\",\n \"abc=true\"\n },\n {\n \"\",\n \"http:\/\/user@www.zorba-xquery.com:8080\/?abc=true\",\n \"http:\/\/user@www.zorba-xquery.com:8080\/?abc=true\",\n \"http\",\n 8080,\n \"\",\n \"www.zorba-xquery.com\",\n \"\",\n \"\/\",\n \"user\",\n \"abc=true\"\n },\n {\n \"\",\n \"http:\/\/user@www.zorba-xquery.com:8080\/path1\/path2?abc=true\",\n \"http:\/\/user@www.zorba-xquery.com:8080\/path1\/path2?abc=true\",\n \"http\",\n 8080,\n \"\",\n \"www.zorba-xquery.com\",\n \"\",\n \"\/path1\/path2\",\n \"user\",\n \"abc=true\"\n },\n {\n \"\",\n \"http:\/\/user@www.zorba-xquery.com:8080\/path1\/path2?abc=true&bcd=false#fragment\",\n \"http:\/\/user@www.zorba-xquery.com:8080\/path1\/path2?abc=true&bcd=false#fragment\",\n \"http\",\n 8080,\n \"fragment\",\n \"www.zorba-xquery.com\",\n \"\",\n \"\/path1\/path2\",\n \"user\",\n \"abc=true&bcd=false\"\n },\n {\n \"\",\n \"ftp:\/\/ftp.is.co.za\/rfc\/rfc1808.txt\",\n \"ftp:\/\/ftp.is.co.za\/rfc\/rfc1808.txt\",\n \"ftp\",\n 0,\n \"\",\n \"ftp.is.co.za\",\n \"\",\n \"\/rfc\/rfc1808.txt\",\n \"\",\n \"\"\n },\n {\n \"\",\n \"http:\/\/thomas@[2001:6f8:9000:876:cccc:bbbb::]:123\/test\",\n \"http:\/\/thomas@[2001:6f8:9000:876:cccc:bbbb::]:123\/test\",\n \"http\",\n 123,\n \"\",\n \"[2001:6f8:9000:876:cccc:bbbb::]\",\n \"\",\n \"\/test\",\n \"thomas\",\n \"\"\n },\n \/\/ uri resolver tests\n {\n \"http:\/\/a\/b\/c\/d;p?q\",\n \"g\",\n \"http:\/\/a\/b\/c\/g\",\n \"http\",\n 0,\n \"\",\n \"a\",\n \"\",\n \"\/b\/c\/g\",\n \"\",\n \"\"\n },\n {\n \"http:\/\/a\/b\/c\/d;p?q\",\n \".\/g\",\n \"http:\/\/a\/b\/c\/g\",\n \"http\",\n 0,\n \"\",\n \"a\",\n \"\",\n \"\/b\/c\/g\",\n \"\",\n \"\"\n },\n {\n \"http:\/\/a\/b\/c\/d;p?q\",\n \"g\/\",\n \"http:\/\/a\/b\/c\/g\/\",\n \"http\",\n 0,\n \"\",\n \"a\",\n \"\",\n \"\/b\/c\/g\/\",\n \"\",\n \"\"\n },\n {\n \"http:\/\/a\/b\/c\/d;p?q\",\n \"\/g\",\n \"http:\/\/a\/g\",\n \"http\",\n 0,\n \"\",\n \"a\",\n \"\",\n \"\/g\",\n \"\",\n \"\"\n },\n {\n \"http:\/\/a\/b\/c\/d;p?q\",\n \"?y\",\n \"http:\/\/a\/b\/c\/?y\",\n \"http\",\n 0,\n \"\",\n \"a\",\n \"\",\n \"\/b\/c\/\",\n \"\",\n \"y\"\n },\n {\n \"http:\/\/a\/b\/c\/d;p?q\",\n \"g?y\",\n \"http:\/\/a\/b\/c\/g?y\",\n \"http\",\n 0,\n \"\",\n \"a\",\n \"\",\n \"\/b\/c\/g\",\n \"\",\n \"y\"\n } \/\/,\n \/\/{\n \/\/ \"http:\/\/a\/b\/c\/d;p?q\",\n \/\/ \"#s\",\n \/\/ \"http:\/\/a\/b\/c\/d;p?q#s\",\n \/\/ \"http\",\n \/\/ 0,\n \/\/ \"s\",\n \/\/ \"a\",\n \/\/ \"\",\n \/\/ \"\/b\/c\/g\",\n \/\/ \"\",\n \/\/ \"\"\n \/\/}\n ,\n {\n \"http:\/\/a\/b\/c\/d;p?q\",\n \"g#s\",\n \"http:\/\/a\/b\/c\/g#s\",\n \"http\",\n 0,\n \"s\",\n \"a\",\n \"\",\n \"\/b\/c\/g\",\n \"\",\n \"\"\n },\n {\n \"http:\/\/a\/b\/c\/d;p?q\",\n \"g?y#s\",\n \"http:\/\/a\/b\/c\/g?y#s\",\n \"http\",\n 0,\n \"s\",\n \"a\",\n \"\",\n \"\/b\/c\/g\",\n \"\",\n \"y\"\n },\n {\n \"http:\/\/a\/b\/c\/d;p?q\",\n \";x\",\n \"http:\/\/a\/b\/c\/;x\",\n \"http\",\n 0,\n \"\",\n \"a\",\n \"\",\n \"\/b\/c\/;x\",\n \"\",\n \"\"\n },\n {\n \"http:\/\/a\/b\/c\/d;p?q\",\n \"g;x\",\n \"http:\/\/a\/b\/c\/g;x\",\n \"http\",\n 0,\n \"\",\n \"a\",\n \"\",\n \"\/b\/c\/g;x\",\n \"\",\n \"\"\n },\n {\n \"http:\/\/a\/b\/c\/d;p?q\",\n \"g;x?y#s\",\n \"http:\/\/a\/b\/c\/g;x?y#s\",\n \"http\",\n 0,\n \"s\",\n \"a\",\n \"\",\n \"\/b\/c\/g;x\",\n \"\",\n \"y\"\n },\n {\n \"http:\/\/a\/b\/c\/d;p?q\",\n \".\",\n \"http:\/\/a\/b\/c\/\",\n \"http\",\n 0,\n \"\",\n \"a\",\n \"\",\n \"\/b\/c\/\",\n \"\",\n \"\"\n },\n {\n \"http:\/\/a\/b\/c\/d;p?q\",\n \".\/\",\n \"http:\/\/a\/b\/c\/\",\n \"http\",\n 0,\n \"\",\n \"a\",\n \"\",\n \"\/b\/c\/\",\n \"\",\n \"\"\n },\n {\n \"http:\/\/a\/b\/c\/d;p?q\",\n \"..\",\n \"http:\/\/a\/b\/\",\n \"http\",\n 0,\n \"\",\n \"a\",\n \"\",\n \"\/b\/\",\n \"\",\n \"\"\n },\n {\n \"http:\/\/a\/b\/c\/d;p?q\",\n \"..\/\",\n \"http:\/\/a\/b\/\",\n \"http\",\n 0,\n \"\",\n \"a\",\n \"\",\n \"\/b\/\",\n \"\",\n \"\"\n },\n {\n \"http:\/\/a\/b\/c\/d;p?q\",\n \"..\/g\",\n \"http:\/\/a\/b\/g\",\n \"http\",\n 0,\n \"\",\n \"a\",\n \"\",\n \"\/b\/g\",\n \"\",\n \"\"\n },\n {\n \"http:\/\/a\/b\/c\/d;p?q\",\n \"..\/..\",\n \"http:\/\/a\/\",\n \"http\",\n 0,\n \"\",\n \"a\",\n \"\",\n \"\/\",\n \"\",\n \"\"\n },\n {\n \"http:\/\/a\/b\/c\/d;p?q\",\n \"..\/..\/\",\n \"http:\/\/a\/\",\n \"http\",\n 0,\n \"\",\n \"a\",\n \"\",\n \"\/\",\n \"\",\n \"\"\n },\n {\n \"http:\/\/a\/b\/c\/d;p?q\",\n \"..\/..\/g\",\n \"http:\/\/a\/g\",\n \"http\",\n 0,\n \"\",\n \"a\",\n \"\",\n \"\/g\",\n \"\",\n \"\"\n },\n {\n \"http:\/\/a\/b\/c\/d;p?q\",\n \"g;x=1\/.\/y\",\n \"http:\/\/a\/b\/c\/g;x=1\/y\",\n \"http\",\n 0,\n \"\",\n \"a\",\n \"\",\n \"\/b\/c\/g;x=1\/y\",\n \"\",\n \"\"\n },\n {\n \"http:\/\/a\/b\/c\/d;p?q\",\n \"g;x=1\/..\/y\",\n \"http:\/\/a\/b\/c\/y\",\n \"http\",\n 0,\n \"\",\n \"a\",\n \"\",\n \"\/b\/c\/y\",\n \"\",\n \"\"\n },\n {\n \"http:\/\/a\/b\/c\/d;p?q\",\n \"g#s\/..\/x\",\n \"http:\/\/a\/b\/c\/g#s\/..\/x\",\n \"http\",\n 0,\n \"s\/..\/x\",\n \"a\",\n \"\",\n \"\/b\/c\/g\",\n \"\",\n \"\"\n },\n {\n \"\",\n \"file:\/\/d:\/a\/b\/c\",\n \"file:\/\/d:\/a\/b\/c\",\n \"file\",\n 0,\n \"\",\n \"\",\n \"d:\",\n \"\/a\/b\/c\",\n \"\",\n \"\"\n },\n {\n \"file:\/\/a\",\n \"\/a\/b\/c\",\n \"file:\/\/a\/a\/b\/c\",\n \"file\",\n 0,\n \"\",\n \"a\",\n \"\",\n \"\/a\/b\/c\",\n \"\",\n \"\"\n },\n {\n \"\",\n \"http:\/\/www.msb.de\",\n \"http:\/\/www.msb.de\",\n \"http\",\n 0,\n \"\",\n \"www.msb.de\",\n \"\",\n \"\",\n \"\",\n \"\"\n },\n {\n \"http:\/\/www.msb.de\/\",\n \"lib\/helpers\",\n \"http:\/\/www.msb.de\/lib\/helpers\",\n \"http\",\n 0,\n \"\",\n \"www.msb.de\",\n \"\",\n \"\/lib\/helpers\",\n \"\",\n \"\"\n }\n }; \/\/ URITestEntry tests[]\n\n\n const unsigned int test_count = sizeof(tests) \/ sizeof(tests[0]);\n try {\n for (unsigned int i = 0; i < test_count; ++i) {\n std::cout << \"executing test number \" << i << \" with uri \" << tests[i].uri << std::endl;\n \n zorba::URI uri;\n if (tests[i].base.empty()) {\n uri = zorba::URI(tests[i].uri);\n } else {\n zorba::URI base(tests[i].base);\n uri = zorba::URI(base, tests[i].uri);\n }\n if (uri.toString() != tests[i].text) {\n std::cerr << \"uri text \" << uri.toString() << \" is not equal to \" << tests[i].text << std::endl;\n return 2;\n }\n if (uri.get_scheme() != tests[i].scheme)\n return 3;\n if (uri.get_port() != tests[i].port) {\n std::cerr << \"port \" << uri.get_port() << \" is not equal to \" << tests[i].port << std::endl;\n return 4;\n }\n if (uri.get_fragment() != tests[i].fragment) {\n std::cerr << \"fragment \" << uri.get_fragment() << \" is not equal to \" << tests[i].fragment << std::endl;\n return 5;\n }\n if (uri.get_host() != tests[i].host) {\n std::cerr << \"host \" << uri.get_host() << \" is not equal to \" << tests[i].host << std::endl;\n return 6;\n }\n if (uri.get_reg_based_authority() != tests[i].regbased_authority) {\n std::cerr << \"regbased_authority \" << uri.get_reg_based_authority() << \" is not equal to \" \n << tests[i].regbased_authority << std::endl;\n return 7;\n }\n if (uri.get_user_info() != tests[i].userinfo) {\n std::cerr << \"userinfo \" << uri.get_user_info() << \" is not equal to \" << tests[i].userinfo << std::endl;\n return 8;\n }\n if (uri.get_path() != tests[i].path) {\n std::cerr << \"path \" << uri.get_path() << \" is not equal to \" << tests[i].path << std::endl;\n return 9;\n }\n if (uri.get_query() != tests[i].query) {\n std::cerr << \"query \" << uri.get_query() << \" is not equal to \" << tests[i].query << std::endl;\n return 10;\n }\n std::cout << \"result: \" << uri.toString() << std::endl;\n }\n } catch (zorba::error::ZorbaError & e) {\n std::cerr << e.theDescription << std::endl;\n return 11;\n }\n\n zorba::xqpString lToEncode(\"\/a \/b\/c\");\n zorba::xqpString lEncoded = lToEncode.encodeForUri(\"\/\",1);\n std::cout << \"encoded \" << lEncoded << std::endl;\n\n std::cout << \"decoded \" << lEncoded.decodeFromUri() << std::endl;\n\n return 0;\n\n}\n<|endoftext|>"} {"text":"<commit_before>\/**************************************************************************\n**\n** This file is part of Qt Creator\n**\n** Copyright (c) 2012 Nokia Corporation and\/or its subsidiary(-ies).\n**\n** Contact: http:\/\/www.qt-project.org\/\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**\n**************************************************************************\/\n\n#include \"toolchainmanager.h\"\n\n#include \"abi.h\"\n#include \"kitinformation.h\"\n#include \"toolchain.h\"\n\n#include <coreplugin\/icore.h>\n\n#include <extensionsystem\/pluginmanager.h>\n\n#include <utils\/persistentsettings.h>\n#include <utils\/qtcassert.h>\n\n#include <QCoreApplication>\n#include <QDir>\n#include <QSettings>\n\nstatic const char TOOLCHAIN_DATA_KEY[] = \"ToolChain.\";\nstatic const char TOOLCHAIN_COUNT_KEY[] = \"ToolChain.Count\";\nstatic const char TOOLCHAIN_FILE_VERSION_KEY[] = \"Version\";\nstatic const char DEFAULT_DEBUGGER_COUNT_KEY[] = \"DefaultDebugger.Count\";\nstatic const char DEFAULT_DEBUGGER_ABI_KEY[] = \"DefaultDebugger.Abi.\";\nstatic const char DEFAULT_DEBUGGER_PATH_KEY[] = \"DefaultDebugger.Path.\";\nstatic const char TOOLCHAIN_FILENAME[] = \"\/qtcreator\/toolchains.xml\";\nstatic const char LEGACY_TOOLCHAIN_FILENAME[] = \"\/toolChains.xml\";\n\nusing Utils::PersistentSettingsWriter;\nusing Utils::PersistentSettingsReader;\n\nstatic Utils::FileName settingsFileName(const QString &path)\n{\n QFileInfo settingsLocation(ExtensionSystem::PluginManager::settings()->fileName());\n return Utils::FileName::fromString(settingsLocation.absolutePath() + path);\n}\n\nnamespace ProjectExplorer {\n\nToolChainManager *ToolChainManager::m_instance = 0;\n\nnamespace Internal {\n\n\/\/ --------------------------------------------------------------------------\n\/\/ ToolChainManagerPrivate\n\/\/ --------------------------------------------------------------------------\n\nclass ToolChainManagerPrivate\n{\npublic:\n ToolChainManagerPrivate(ToolChainManager *parent);\n ~ToolChainManagerPrivate();\n\n QList<ToolChain *> &toolChains();\n\n ToolChainManager *q;\n QMap<QString, Utils::FileName> m_abiToDebugger;\n Utils::PersistentSettingsWriter *m_writer;\n\nprivate:\n QList<ToolChain *> m_toolChains;\n};\n\nToolChainManagerPrivate::ToolChainManagerPrivate(ToolChainManager *parent)\n : q(parent), m_writer(0)\n{ }\n\nToolChainManagerPrivate::~ToolChainManagerPrivate()\n{ delete m_writer; }\n\nQList<ToolChain *> &ToolChainManagerPrivate::toolChains()\n{\n if (!m_writer)\n q->restoreToolChains();\n return m_toolChains;\n}\n\n} \/\/ namespace Internal\n\n\/\/ --------------------------------------------------------------------------\n\/\/ ToolChainManager\n\/\/ --------------------------------------------------------------------------\n\nToolChainManager *ToolChainManager::instance()\n{\n return m_instance;\n}\n\nToolChainManager::ToolChainManager(QObject *parent) :\n QObject(parent),\n d(new Internal::ToolChainManagerPrivate(this))\n{\n Q_ASSERT(!m_instance);\n m_instance = this;\n\n connect(Core::ICore::instance(), SIGNAL(saveSettingsRequested()),\n this, SLOT(saveToolChains()));\n connect(this, SIGNAL(toolChainAdded(ProjectExplorer::ToolChain*)),\n this, SIGNAL(toolChainsChanged()));\n connect(this, SIGNAL(toolChainRemoved(ProjectExplorer::ToolChain*)),\n this, SIGNAL(toolChainsChanged()));\n connect(this, SIGNAL(toolChainUpdated(ProjectExplorer::ToolChain*)),\n this, SIGNAL(toolChainsChanged()));\n}\n\nvoid ToolChainManager::restoreToolChains()\n{\n QTC_ASSERT(!d->m_writer, return);\n d->m_writer =\n new Utils::PersistentSettingsWriter(settingsFileName(QLatin1String(TOOLCHAIN_FILENAME)), QLatin1String(\"QtCreatorToolChains\"));\n\n QList<ToolChain *> tcsToRegister;\n QList<ToolChain *> tcsToCheck;\n\n \/\/ read all tool chains from SDK\n QFileInfo systemSettingsFile(Core::ICore::settings(QSettings::SystemScope)->fileName());\n QList<ToolChain *> readTcs =\n restoreToolChains(Utils::FileName::fromString(systemSettingsFile.absolutePath() + QLatin1String(TOOLCHAIN_FILENAME)));\n \/\/ make sure we mark these as autodetected!\n foreach (ToolChain *tc, readTcs)\n tc->setAutoDetected(true);\n\n tcsToRegister = readTcs; \/\/ SDK TCs are always considered to be up-to-date, so no need to\n \/\/ recheck them.\n\n \/\/ read all tool chains from user file.\n \/\/ Read legacy settings once and keep them around...\n Utils::FileName fileName = settingsFileName(QLatin1String(TOOLCHAIN_FILENAME));\n if (!fileName.toFileInfo().exists())\n fileName = settingsFileName(QLatin1String(LEGACY_TOOLCHAIN_FILENAME));\n readTcs = restoreToolChains(fileName);\n\n foreach (ToolChain *tc, readTcs) {\n if (tc->isAutoDetected())\n tcsToCheck.append(tc);\n else\n tcsToRegister.append(tc);\n }\n readTcs.clear();\n\n \/\/ Then auto detect\n QList<ToolChain *> detectedTcs;\n QList<ToolChainFactory *> factories = ExtensionSystem::PluginManager::getObjects<ToolChainFactory>();\n foreach (ToolChainFactory *f, factories)\n detectedTcs.append(f->autoDetect());\n\n \/\/ Find\/update autodetected tool chains:\n ToolChain *toStore = 0;\n foreach (ToolChain *currentDetected, detectedTcs) {\n toStore = currentDetected;\n\n \/\/ Check whether we had this TC stored and prefer the old one with the old id:\n for (int i = 0; i < tcsToCheck.count(); ++i) {\n if (*(tcsToCheck.at(i)) == *currentDetected) {\n toStore = tcsToCheck.at(i);\n tcsToCheck.removeAt(i);\n delete currentDetected;\n break;\n }\n }\n registerToolChain(toStore);\n }\n\n \/\/ Delete all loaded autodetected tool chains that were not rediscovered:\n qDeleteAll(tcsToCheck);\n\n \/\/ Store manual tool chains\n foreach (ToolChain *tc, tcsToRegister)\n registerToolChain(tc);\n}\n\nToolChainManager::~ToolChainManager()\n{\n \/\/ Deregister tool chains\n QList<ToolChain *> copy = d->toolChains();\n foreach (ToolChain *tc, copy)\n deregisterToolChain(tc);\n\n delete d;\n m_instance = 0;\n}\n\nvoid ToolChainManager::saveToolChains()\n{\n QVariantMap data;\n data.insert(QLatin1String(TOOLCHAIN_FILE_VERSION_KEY), 1);\n\n int count = 0;\n foreach (ToolChain *tc, d->toolChains()) {\n if (tc->isValid()) {\n QVariantMap tmp = tc->toMap();\n if (tmp.isEmpty())\n continue;\n data.insert(QString::fromLatin1(TOOLCHAIN_DATA_KEY) + QString::number(count), tmp);\n ++count;\n }\n }\n data.insert(QLatin1String(TOOLCHAIN_COUNT_KEY), count);\n d->m_writer->save(data, Core::ICore::mainWindow());\n\n \/\/ Do not save default debuggers! Those are set by the SDK!\n}\n\nQList<ToolChain *> ToolChainManager::restoreToolChains(const Utils::FileName &fileName)\n{\n QList<ToolChain *> result;\n\n PersistentSettingsReader reader;\n if (!reader.load(fileName))\n return result;\n QVariantMap data = reader.restoreValues();\n\n \/\/ Check version:\n int version = data.value(QLatin1String(TOOLCHAIN_FILE_VERSION_KEY), 0).toInt();\n if (version < 1)\n return result;\n\n \/\/ Read default debugger settings (if any)\n int count = data.value(QLatin1String(DEFAULT_DEBUGGER_COUNT_KEY)).toInt();\n for (int i = 0; i < count; ++i) {\n const QString abiKey = QString::fromLatin1(DEFAULT_DEBUGGER_ABI_KEY) + QString::number(i);\n if (!data.contains(abiKey))\n continue;\n const QString pathKey = QString::fromLatin1(DEFAULT_DEBUGGER_PATH_KEY) + QString::number(i);\n if (!data.contains(pathKey))\n continue;\n d->m_abiToDebugger.insert(data.value(abiKey).toString(),\n Utils::FileName::fromString(data.value(pathKey).toString()));\n }\n\n QList<ToolChainFactory *> factories = ExtensionSystem::PluginManager::getObjects<ToolChainFactory>();\n\n count = data.value(QLatin1String(TOOLCHAIN_COUNT_KEY), 0).toInt();\n for (int i = 0; i < count; ++i) {\n const QString key = QString::fromLatin1(TOOLCHAIN_DATA_KEY) + QString::number(i);\n if (!data.contains(key))\n break;\n\n const QVariantMap tcMap = data.value(key).toMap();\n\n bool restored = false;\n foreach (ToolChainFactory *f, factories) {\n if (f->canRestore(tcMap)) {\n if (ToolChain *tc = f->restore(tcMap)) {\n result.append(tc);\n restored = true;\n break;\n }\n }\n }\n if (!restored)\n qWarning(\"Warning: Unable to restore compiler '%s' stored in %s.\",\n qPrintable(ToolChainFactory::idFromMap(tcMap)),\n qPrintable(fileName.toUserOutput()));\n }\n return result;\n}\n\nQList<ToolChain *> ToolChainManager::toolChains() const\n{\n return d->toolChains();\n}\n\nQList<ToolChain *> ToolChainManager::findToolChains(const Abi &abi) const\n{\n QList<ToolChain *> result;\n foreach (ToolChain *tc, toolChains()) {\n Abi targetAbi = tc->targetAbi();\n if (targetAbi.isCompatibleWith(abi))\n result.append(tc);\n }\n return result;\n}\n\nToolChain *ToolChainManager::findToolChain(const QString &id) const\n{\n if (id.isEmpty())\n return 0;\n\n foreach (ToolChain *tc, d->toolChains()) {\n if (tc->id() == id)\n return tc;\n }\n return 0;\n}\n\nUtils::FileName ToolChainManager::defaultDebugger(const Abi &abi) const\n{\n return d->m_abiToDebugger.value(abi.toString());\n}\n\nvoid ToolChainManager::notifyAboutUpdate(ProjectExplorer::ToolChain *tc)\n{\n if (!tc || !toolChains().contains(tc))\n return;\n emit toolChainUpdated(tc);\n}\n\nbool ToolChainManager::registerToolChain(ToolChain *tc)\n{\n if (!tc || d->toolChains().contains(tc))\n return true;\n foreach (ToolChain *current, d->toolChains()) {\n if (*tc == *current && !tc->isAutoDetected())\n return false;\n }\n\n d->toolChains().append(tc);\n emit toolChainAdded(tc);\n return true;\n}\n\nvoid ToolChainManager::deregisterToolChain(ToolChain *tc)\n{\n if (!tc || !d->toolChains().contains(tc))\n return;\n d->toolChains().removeOne(tc);\n emit toolChainRemoved(tc);\n delete tc;\n}\n\n} \/\/ namespace ProjectExplorer\n<commit_msg>Warn when failing to restore auto-detected tool chains<commit_after>\/**************************************************************************\n**\n** This file is part of Qt Creator\n**\n** Copyright (c) 2012 Nokia Corporation and\/or its subsidiary(-ies).\n**\n** Contact: http:\/\/www.qt-project.org\/\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**\n**************************************************************************\/\n\n#include \"toolchainmanager.h\"\n\n#include \"abi.h\"\n#include \"kitinformation.h\"\n#include \"toolchain.h\"\n\n#include <coreplugin\/icore.h>\n\n#include <extensionsystem\/pluginmanager.h>\n\n#include <utils\/persistentsettings.h>\n#include <utils\/qtcassert.h>\n\n#include <QCoreApplication>\n#include <QDir>\n#include <QSettings>\n\nstatic const char TOOLCHAIN_DATA_KEY[] = \"ToolChain.\";\nstatic const char TOOLCHAIN_COUNT_KEY[] = \"ToolChain.Count\";\nstatic const char TOOLCHAIN_FILE_VERSION_KEY[] = \"Version\";\nstatic const char DEFAULT_DEBUGGER_COUNT_KEY[] = \"DefaultDebugger.Count\";\nstatic const char DEFAULT_DEBUGGER_ABI_KEY[] = \"DefaultDebugger.Abi.\";\nstatic const char DEFAULT_DEBUGGER_PATH_KEY[] = \"DefaultDebugger.Path.\";\nstatic const char TOOLCHAIN_FILENAME[] = \"\/qtcreator\/toolchains.xml\";\nstatic const char LEGACY_TOOLCHAIN_FILENAME[] = \"\/toolChains.xml\";\n\nusing Utils::PersistentSettingsWriter;\nusing Utils::PersistentSettingsReader;\n\nstatic Utils::FileName settingsFileName(const QString &path)\n{\n QFileInfo settingsLocation(ExtensionSystem::PluginManager::settings()->fileName());\n return Utils::FileName::fromString(settingsLocation.absolutePath() + path);\n}\n\nnamespace ProjectExplorer {\n\nToolChainManager *ToolChainManager::m_instance = 0;\n\nnamespace Internal {\n\n\/\/ --------------------------------------------------------------------------\n\/\/ ToolChainManagerPrivate\n\/\/ --------------------------------------------------------------------------\n\nclass ToolChainManagerPrivate\n{\npublic:\n ToolChainManagerPrivate(ToolChainManager *parent);\n ~ToolChainManagerPrivate();\n\n QList<ToolChain *> &toolChains();\n\n ToolChainManager *q;\n QMap<QString, Utils::FileName> m_abiToDebugger;\n Utils::PersistentSettingsWriter *m_writer;\n\nprivate:\n QList<ToolChain *> m_toolChains;\n};\n\nToolChainManagerPrivate::ToolChainManagerPrivate(ToolChainManager *parent)\n : q(parent), m_writer(0)\n{ }\n\nToolChainManagerPrivate::~ToolChainManagerPrivate()\n{ delete m_writer; }\n\nQList<ToolChain *> &ToolChainManagerPrivate::toolChains()\n{\n if (!m_writer)\n q->restoreToolChains();\n return m_toolChains;\n}\n\n} \/\/ namespace Internal\n\n\/\/ --------------------------------------------------------------------------\n\/\/ ToolChainManager\n\/\/ --------------------------------------------------------------------------\n\nToolChainManager *ToolChainManager::instance()\n{\n return m_instance;\n}\n\nToolChainManager::ToolChainManager(QObject *parent) :\n QObject(parent),\n d(new Internal::ToolChainManagerPrivate(this))\n{\n Q_ASSERT(!m_instance);\n m_instance = this;\n\n connect(Core::ICore::instance(), SIGNAL(saveSettingsRequested()),\n this, SLOT(saveToolChains()));\n connect(this, SIGNAL(toolChainAdded(ProjectExplorer::ToolChain*)),\n this, SIGNAL(toolChainsChanged()));\n connect(this, SIGNAL(toolChainRemoved(ProjectExplorer::ToolChain*)),\n this, SIGNAL(toolChainsChanged()));\n connect(this, SIGNAL(toolChainUpdated(ProjectExplorer::ToolChain*)),\n this, SIGNAL(toolChainsChanged()));\n}\n\nvoid ToolChainManager::restoreToolChains()\n{\n QTC_ASSERT(!d->m_writer, return);\n d->m_writer =\n new Utils::PersistentSettingsWriter(settingsFileName(QLatin1String(TOOLCHAIN_FILENAME)), QLatin1String(\"QtCreatorToolChains\"));\n\n QList<ToolChain *> tcsToRegister;\n QList<ToolChain *> tcsToCheck;\n\n \/\/ read all tool chains from SDK\n QFileInfo systemSettingsFile(Core::ICore::settings(QSettings::SystemScope)->fileName());\n QList<ToolChain *> readTcs =\n restoreToolChains(Utils::FileName::fromString(systemSettingsFile.absolutePath() + QLatin1String(TOOLCHAIN_FILENAME)));\n \/\/ make sure we mark these as autodetected!\n foreach (ToolChain *tc, readTcs)\n tc->setAutoDetected(true);\n\n tcsToRegister = readTcs; \/\/ SDK TCs are always considered to be up-to-date, so no need to\n \/\/ recheck them.\n\n \/\/ read all tool chains from user file.\n \/\/ Read legacy settings once and keep them around...\n Utils::FileName fileName = settingsFileName(QLatin1String(TOOLCHAIN_FILENAME));\n if (!fileName.toFileInfo().exists())\n fileName = settingsFileName(QLatin1String(LEGACY_TOOLCHAIN_FILENAME));\n readTcs = restoreToolChains(fileName);\n\n foreach (ToolChain *tc, readTcs) {\n if (tc->isAutoDetected())\n tcsToCheck.append(tc);\n else\n tcsToRegister.append(tc);\n }\n readTcs.clear();\n\n \/\/ Then auto detect\n QList<ToolChain *> detectedTcs;\n QList<ToolChainFactory *> factories = ExtensionSystem::PluginManager::getObjects<ToolChainFactory>();\n foreach (ToolChainFactory *f, factories)\n detectedTcs.append(f->autoDetect());\n\n \/\/ Find\/update autodetected tool chains:\n ToolChain *toStore = 0;\n foreach (ToolChain *currentDetected, detectedTcs) {\n toStore = currentDetected;\n\n \/\/ Check whether we had this TC stored and prefer the old one with the old id:\n for (int i = 0; i < tcsToCheck.count(); ++i) {\n if (*(tcsToCheck.at(i)) == *currentDetected) {\n toStore = tcsToCheck.at(i);\n tcsToCheck.removeAt(i);\n delete currentDetected;\n break;\n }\n }\n registerToolChain(toStore);\n }\n\n \/\/ Delete all loaded autodetected tool chains that were not rediscovered:\n foreach (ToolChain *tc, tcsToCheck) {\n qWarning() << QString::fromLatin1(\"ToolChain \\\"%1\\\" (%2) dropped since it was not auto-detected again\")\n .arg(tc->displayName()).arg(tc->id());\n delete tc;\n }\n\n \/\/ Store manual tool chains\n foreach (ToolChain *tc, tcsToRegister)\n registerToolChain(tc);\n}\n\nToolChainManager::~ToolChainManager()\n{\n \/\/ Deregister tool chains\n QList<ToolChain *> copy = d->toolChains();\n foreach (ToolChain *tc, copy)\n deregisterToolChain(tc);\n\n delete d;\n m_instance = 0;\n}\n\nvoid ToolChainManager::saveToolChains()\n{\n QVariantMap data;\n data.insert(QLatin1String(TOOLCHAIN_FILE_VERSION_KEY), 1);\n\n int count = 0;\n foreach (ToolChain *tc, d->toolChains()) {\n if (tc->isValid()) {\n QVariantMap tmp = tc->toMap();\n if (tmp.isEmpty())\n continue;\n data.insert(QString::fromLatin1(TOOLCHAIN_DATA_KEY) + QString::number(count), tmp);\n ++count;\n }\n }\n data.insert(QLatin1String(TOOLCHAIN_COUNT_KEY), count);\n d->m_writer->save(data, Core::ICore::mainWindow());\n\n \/\/ Do not save default debuggers! Those are set by the SDK!\n}\n\nQList<ToolChain *> ToolChainManager::restoreToolChains(const Utils::FileName &fileName)\n{\n QList<ToolChain *> result;\n\n PersistentSettingsReader reader;\n if (!reader.load(fileName))\n return result;\n QVariantMap data = reader.restoreValues();\n\n \/\/ Check version:\n int version = data.value(QLatin1String(TOOLCHAIN_FILE_VERSION_KEY), 0).toInt();\n if (version < 1)\n return result;\n\n \/\/ Read default debugger settings (if any)\n int count = data.value(QLatin1String(DEFAULT_DEBUGGER_COUNT_KEY)).toInt();\n for (int i = 0; i < count; ++i) {\n const QString abiKey = QString::fromLatin1(DEFAULT_DEBUGGER_ABI_KEY) + QString::number(i);\n if (!data.contains(abiKey))\n continue;\n const QString pathKey = QString::fromLatin1(DEFAULT_DEBUGGER_PATH_KEY) + QString::number(i);\n if (!data.contains(pathKey))\n continue;\n d->m_abiToDebugger.insert(data.value(abiKey).toString(),\n Utils::FileName::fromString(data.value(pathKey).toString()));\n }\n\n QList<ToolChainFactory *> factories = ExtensionSystem::PluginManager::getObjects<ToolChainFactory>();\n\n count = data.value(QLatin1String(TOOLCHAIN_COUNT_KEY), 0).toInt();\n for (int i = 0; i < count; ++i) {\n const QString key = QString::fromLatin1(TOOLCHAIN_DATA_KEY) + QString::number(i);\n if (!data.contains(key))\n break;\n\n const QVariantMap tcMap = data.value(key).toMap();\n\n bool restored = false;\n foreach (ToolChainFactory *f, factories) {\n if (f->canRestore(tcMap)) {\n if (ToolChain *tc = f->restore(tcMap)) {\n result.append(tc);\n restored = true;\n break;\n }\n }\n }\n if (!restored)\n qWarning(\"Warning: Unable to restore compiler '%s' stored in %s.\",\n qPrintable(ToolChainFactory::idFromMap(tcMap)),\n qPrintable(fileName.toUserOutput()));\n }\n return result;\n}\n\nQList<ToolChain *> ToolChainManager::toolChains() const\n{\n return d->toolChains();\n}\n\nQList<ToolChain *> ToolChainManager::findToolChains(const Abi &abi) const\n{\n QList<ToolChain *> result;\n foreach (ToolChain *tc, toolChains()) {\n Abi targetAbi = tc->targetAbi();\n if (targetAbi.isCompatibleWith(abi))\n result.append(tc);\n }\n return result;\n}\n\nToolChain *ToolChainManager::findToolChain(const QString &id) const\n{\n if (id.isEmpty())\n return 0;\n\n foreach (ToolChain *tc, d->toolChains()) {\n if (tc->id() == id)\n return tc;\n }\n return 0;\n}\n\nUtils::FileName ToolChainManager::defaultDebugger(const Abi &abi) const\n{\n return d->m_abiToDebugger.value(abi.toString());\n}\n\nvoid ToolChainManager::notifyAboutUpdate(ProjectExplorer::ToolChain *tc)\n{\n if (!tc || !toolChains().contains(tc))\n return;\n emit toolChainUpdated(tc);\n}\n\nbool ToolChainManager::registerToolChain(ToolChain *tc)\n{\n if (!tc || d->toolChains().contains(tc))\n return true;\n foreach (ToolChain *current, d->toolChains()) {\n if (*tc == *current && !tc->isAutoDetected())\n return false;\n }\n\n d->toolChains().append(tc);\n emit toolChainAdded(tc);\n return true;\n}\n\nvoid ToolChainManager::deregisterToolChain(ToolChain *tc)\n{\n if (!tc || !d->toolChains().contains(tc))\n return;\n d->toolChains().removeOne(tc);\n emit toolChainRemoved(tc);\n delete tc;\n}\n\n} \/\/ namespace ProjectExplorer\n<|endoftext|>"} {"text":"<commit_before>#include \"nuFATE.h\"\r\n\r\n\r\n\r\ndouble nuFACE::readDoubleAttribute(hid_t object, std::string name){\r\n double target;\r\n hid_t attribute_id = H5Aopen(object,name.c_str(),H5P_DEFAULT);\r\n herr_t status = H5Aread(attribute_id, H5T_NATIVE_DOUBLE, &target);\r\n if(status<0)\r\n throw std::runtime_error(\"Failed to read attribute '\"+name+\"'\");\r\n H5Aclose(attribute_id);\r\n return target;\r\n}\r\n\r\ndouble* nuFACE::logspace(double Emin,double Emax,unsigned int div){\r\n if(div==0)\r\n throw std::length_error(\"number of samples requested from logspace must be nonzero\");\r\n double logpoints[div];\r\n double Emin_log,Emax_log;\r\n Emin_log = log(Emin);\r\n Emax_log = log(Emax);\r\n \r\n double step_log = (Emax_log - Emin_log)\/double(div-1);\r\n \r\n logpoints[0]=Emin;\r\n double EE = Emin_log+step_log;\r\n for(unsigned int i=1; i<div-1; i++, EE+=step_log)\r\n logpoints[i] = exp(EE);\r\n logpoints[div-1]=Emax;\r\n double* logpoints_ = &logpoints[0];\r\n return logpoints_;\r\n}\r\n\r\ndouble* nuFACE::get_glashow_total(double NumNodes, double* energy_nodes){\r\n double GF = 1.16e-5\r\n double hbarc = 1.97e-14\r\n double GW = 2.085\r\n double MW = 80.385e0\r\n double mmu = 0.106e0\r\n double me = 511.e-6\r\n double pi = 3.14159265358979323846\r\n glashow_total_ = (double *)malloc(NumNodes*sizeof(double));\r\n\r\n for(int i=0; i<=NumNodes; i++){\r\n double x = *(glashow_total_+i);\r\n *(glashow_total_ +i) = 2.*me*(*(energy_nodes+i));\r\n *(glashow_total_ +i) = 1. \/3.*std::pow(GF,2)*x\/pi*std::pow((1.-(std::pow(mmu,2)-std::pow(me,2))\/x),2)\/(std::pow((1.-x\/std::pow(MW,2)),2)+std::pow(GW,2)\/std::pow(MW,2))*0.676\/0.1057*std::pow(hbarc,2);\r\n }\r\n return glashow_total_;\r\n}\r\n\r\n\r\ndouble* nuFACE::get_RHS_matrices(double NumNodes, double* energy_nodes, std::shared_ptr<double> sigma_array_, double* dxs_array_){\r\n \r\n DeltaE_ = (double *)malloc(NumNodes*sizeof(double));\r\n for(int i = 0; i <= NumNodes-1;i++){\r\n *(DeltaE_ + i) = log10(*(energy_nodes+i+1)) - log10(*(energy_nodes+i));\r\n }\r\n\r\n double RHSMatrix[NumNodes][NumNodes] = {};\r\n \r\n for(int i = 0; i <= NumNodes; i++) \r\n {\r\n for(int j= i+1; j <= NumNodes )\r\n {\r\n double e1 = 1.\/ *(energy_nodes+j);\r\n double e2 = *(energy_nodes+i) * *(energy_nodes+i);\r\n RHSMatrix[i][j] = *(DeltaE_ + j - 1) * *(dxs_array_+j * dxsdim[1]+i) * e1 * e2;\r\n }\r\n }\r\n\r\n double* RHSMatrix_ = &RHSMatrix[0][0];\r\n return RHSMatrix_;\r\n} \r\n\r\nnuFACE::get_eigs(int flavor, double gamma, string h5_filename) {\r\n\r\n newflavor = flavor;\r\n newgamma = gamma;\r\n newh5_filename = h5_filename;\r\n\r\n \/\/open h5file containing cross sections\r\n\r\n hid_t file_id,group_id,root_id;\r\n\r\n file_id = H5Fopen(h5_filename.c_str(), H5F_ACC_RDONLY, H5P_DEFAULT);\r\n root_id = H5Gopen(file_id, \"\/\", H5P_DEFAULT);\r\n\r\n std::string grptot = \"\/total_cross_sections\";\r\n std::string grpdiff = \"\/differential_cross_sections\";\r\n group_id = H5Gopen(root_id, grptot.c_str(), H5P_DEFAULT);\r\n \r\n \/\/Get energy information\r\n double Emin = readDoubleAttribute(group_id, 'max_energy')\r\n double Emax = readDoubleAttribute(group_id, 'min_energy')\r\n double NumNodes = readDoubleAttribute(group_id, 'number_energy_nodes')\r\n energy_nodes = logspace(Emin, Emax, Numnodes)\r\n\r\n \/\/Get sigma_array \r\n \r\n if (flavor == -1) {\r\n hsize_t sarraysize[1];\r\n H5LTget_dataset_info(group_id,\"nuebarxs\", sarraysize,NULL,NULL);\r\n sigma_array_ = std::make_shared<double>(sarraysize[0]); \r\n H5LTread_dataset_double(group_id, \"nuebarxs\", sigma_array_);\r\n } else if (flavor == -2){\r\n hsize_t sarraysize[1];\r\n H5LTget_dataset_info(group_id,\"numubarxs\", sarraysize,NULL,NULL);\r\n sigma_array_ = std::make_shared<double>(sarraysize[0]); \r\n H5LTread_dataset_double(group_id, \"numubarxs\", sigma_array_);\r\n } else if (flavor == -3){\r\n hsize_t sarraysize[1];\r\n H5LTget_dataset_info(group_id,\"nutaubarxs\", sarraysize,NULL,NULL);\r\n sigma_array_ = std::make_shared<double>(sarraysize[0]); \r\n H5LTread_dataset_double(group_id, \"nutaubarxs\", sigma_array_); \r\n } else if (flavor == 1){\r\n hsize_t sarraysize[1];\r\n H5LTget_dataset_info(group_id,\"nuexs\", sarraysize,NULL,NULL);\r\n sigma_array_ = std::make_shared<double>(sarraysize[0]); \r\n H5LTread_dataset_double(group_id, \"nuexs\", sigma_array_);\r\n } else if (flavor == 2){\r\n hsize_t sarraysize[1];\r\n H5LTget_dataset_info(group_id,\"numuxs\", sarraysize,NULL,NULL);\r\n sigma_array_ = std::make_shared<double>(sarraysize[0]); \r\n H5LTread_dataset_double(group_id, \"numuxs\", sigma_array_);\r\n } else if (flavor == 3){\r\n hsize_t sarraysize[1];\r\n H5LTget_dataset_info(group_id,\"nutauxs\", sarraysize,NULL,NULL);\r\n sigma_array_ = std::make_shared<double>(sarraysize[0]); \r\n H5LTread_dataset_double(group_id, \"nutauxs\", sigma_array_);\r\n }\r\n \r\n \/\/Get differential cross sections\r\n \r\n hsize_t dxarraysize[2];\r\n group_id = H5Gopen(root_id, grpdiff.c_str(), H5P_DEFAULT);\r\n \r\n if (flavor > 0){\r\n H5LTget_dataset_info(group_id,\"dxsnu\", dxarraysize,NULL,NULL); \r\n size_t dim1 = dxarraysize[0];\r\n size_t dim2 = dxarraysize[1];\r\n dxsdim[0] = dxarraysize[0];\r\n dxsdim[1] = dxarraysize[1];\r\n dxs_array_ = (double *)malloc(dim1*dim2*sizeof(double));\r\n H5LTread_dataset(group_id, \"dxsnu\", dxs_array_);\r\n } else {\r\n H5LTget_dataset_info(group_id,\"dxsnubar\", dxarraysize,NULL,NULL);\r\n size_t dim1 = dxarraysize[0];\r\n size_t dim2 = dxarraysize[1];\r\n dxsdim[0] = dxarraysize[0];\r\n dxsdim[1] = dxarraysize[1];\r\n dxs_array_ = (double *)malloc(dim1*dim2*sizeof(double));\r\n H5LTread_dataset(group_id, \"dxsnu\", dxs_array_);\r\n }\r\n\r\n \/\/Find RHS matrix\r\n \r\n RHSMatrix_ = get_RHS_matrices(NumNodes, energy_nodes, sigma_array_, dxs_array_);\r\n\r\n \/\/Account for tau regeneration\/Glashow resonance\r\n\r\n if (flavor = -3){\r\n std:string grptau = \"\/tau_decay_spectrum\";\r\n group_id = H5Gopen(root_id, grptau.c_str(), H5P_DEFAULT);\r\n hsize_t tauarraysize[2];\r\n H5LTget_dataset_info(group_id,\"tbarfull\", tauarraysize,NULL,NULL);\r\n size_t dim1 = tauarraysize[0];\r\n size_t dim2 = taurraysize[1];\r\n tau_array_ = (double *)malloc(dim1*dim2*sizeof(double));\r\n H5LTread_dataset(group_id, \"tbarfull\", tau_array_);\r\n RHregen_ = get_RHS_matrices(NumNodes, energy_nodes, sigma_array_, tau_array_);\r\n for (int i = 0; i<=NumNodes; i++){\r\n for(int j=0; j<=NumNodes;j++)\r\n *(RHSMatrix_+i*NumNodes+j) = *(RHSMatrix_+i*NumNodes+j) + *(RHregen_+i*NumNodes+j);\r\n }\r\n } else if(flavor = 3){\r\n std:string grptau = \"\/tau_decay_spectrum\";\r\n group_id = H5Gopen(root_id, grptau.c_str(), H5P_DEFAULT);\r\n hsize_t tauarraysize[2];\r\n H5LTget_dataset_info(group_id,\"tfull\", tauarraysize,NULL,NULL);\r\n size_t dim1 = tauarraysize[0];\r\n size_t dim2 = taurraysize[1];\r\n tau_array_ = (double *)malloc(dim1*dim2*sizeof(double));\r\n H5LTread_dataset(group_id, \"tbarfull\", tau_array_);\r\n RHregen_ = get_RHS_matrices(NumNodes, energy_nodes, sigma_array_, tau_array_);\r\n for (int i = 0; i<=NumNodes; i++){\r\n for(int j=0; j<=NumNodes;j++)\r\n *(RHSMatrix_+i*NumNodes+j) = *(RHSMatrix_+i*NumNodes+j) + *(RHregen_+i*NumNodes+j);\r\n }\r\n } else if(flavor = -1){\r\n glashow_total_ = get_glashow_total(energy_nodes);\r\n for (int i = 0; i<=sarraysize[0]; i++){\r\n *(sigma_array_+i) = *(sigma_array_+i) +\r\n }\r\n }\r\n \r\n}\r\n\r\n\r\nint nuFACE::getFlavor() const {\r\n return newflavor;\r\n}\r\n\r\ndouble nuFACE::getGamma() const {\r\n return newgamma;\r\n}\r\n\r\nstring nuFACE::getFilename() const {\r\n return newh5_filename;\r\n}\r\n<commit_msg>Update nuFACE.cpp<commit_after>#include \"nuFATE.h\"\r\n\r\n\r\n\r\ndouble nuFACE::readDoubleAttribute(hid_t object, std::string name){\r\n double target;\r\n hid_t attribute_id = H5Aopen(object,name.c_str(),H5P_DEFAULT);\r\n herr_t status = H5Aread(attribute_id, H5T_NATIVE_DOUBLE, &target);\r\n if(status<0)\r\n throw std::runtime_error(\"Failed to read attribute '\"+name+\"'\");\r\n H5Aclose(attribute_id);\r\n return target;\r\n}\r\n\r\ndouble* nuFACE::logspace(double Emin,double Emax,unsigned int div){\r\n if(div==0)\r\n throw std::length_error(\"number of samples requested from logspace must be nonzero\");\r\n double logpoints[div];\r\n double Emin_log,Emax_log;\r\n Emin_log = log(Emin);\r\n Emax_log = log(Emax);\r\n \r\n double step_log = (Emax_log - Emin_log)\/double(div-1);\r\n \r\n logpoints[0]=Emin;\r\n double EE = Emin_log+step_log;\r\n for(unsigned int i=1; i<div-1; i++, EE+=step_log)\r\n logpoints[i] = exp(EE);\r\n logpoints[div-1]=Emax;\r\n double* logpoints_ = &logpoints[0];\r\n return logpoints_;\r\n}\r\n\r\ndouble* nuFACE::get_glashow_total(double NumNodes, double* energy_nodes){\r\n double GF = 1.16e-5\r\n double hbarc = 1.97e-14\r\n double GW = 2.085\r\n double MW = 80.385e0\r\n double mmu = 0.106e0\r\n double me = 511.e-6\r\n double pi = 3.14159265358979323846\r\n glashow_total_ = (double *)malloc(NumNodes*sizeof(double));\r\n\r\n for(int i=0; i<NumNodes; i++){\r\n double x = *(glashow_total_+i);\r\n *(glashow_total_ +i) = 2.*me*(*(energy_nodes+i));\r\n *(glashow_total_ +i) = 1. \/3.*std::pow(GF,2)*x\/pi*std::pow((1.-(std::pow(mmu,2)-std::pow(me,2))\/x),2)\/(std::pow((1.-x\/std::pow(MW,2)),2)+std::pow(GW,2)\/std::pow(MW,2))*0.676\/0.1057*std::pow(hbarc,2);\r\n }\r\n return glashow_total_;\r\n}\r\n\r\n\r\ndouble* nuFACE::get_RHS_matrices(double NumNodes, double* energy_nodes, std::shared_ptr<double> sigma_array_, double* dxs_array_){\r\n \r\n DeltaE_ = (double *)malloc(NumNodes*sizeof(double));\r\n for(int i = 0; i < NumNodes-1;i++){\r\n *(DeltaE_ + i) = log10(*(energy_nodes+i+1)) - log10(*(energy_nodes+i));\r\n }\r\n\r\n double RHSMatrix[NumNodes][NumNodes] = {};\r\n \r\n for(int i = 0; i < NumNodes; i++) \r\n {\r\n for(int j= i+1; j < NumNodes )\r\n {\r\n double e1 = 1.\/ *(energy_nodes+j);\r\n double e2 = *(energy_nodes+i) * *(energy_nodes+i);\r\n RHSMatrix[i][j] = *(DeltaE_ + j - 1) * *(dxs_array_+j * dxsdim[1]+i) * e1 * e2;\r\n }\r\n }\r\n\r\n double* RHSMatrix_ = &RHSMatrix[0][0];\r\n return RHSMatrix_;\r\n} \r\n\r\nnuFACE::get_eigs(int flavor, double gamma, string h5_filename) {\r\n\r\n newflavor = flavor;\r\n newgamma = gamma;\r\n newh5_filename = h5_filename;\r\n\r\n \/\/open h5file containing cross sections\r\n\r\n hid_t file_id,group_id,root_id;\r\n\r\n file_id = H5Fopen(h5_filename.c_str(), H5F_ACC_RDONLY, H5P_DEFAULT);\r\n root_id = H5Gopen(file_id, \"\/\", H5P_DEFAULT);\r\n\r\n std::string grptot = \"\/total_cross_sections\";\r\n std::string grpdiff = \"\/differential_cross_sections\";\r\n group_id = H5Gopen(root_id, grptot.c_str(), H5P_DEFAULT);\r\n \r\n \/\/Get energy information\r\n double Emin = readDoubleAttribute(group_id, 'max_energy')\r\n double Emax = readDoubleAttribute(group_id, 'min_energy')\r\n double NumNodes = readDoubleAttribute(group_id, 'number_energy_nodes')\r\n energy_nodes = logspace(Emin, Emax, Numnodes)\r\n\r\n \/\/Get sigma_array \r\n \r\n if (flavor == -1) {\r\n hsize_t sarraysize[1];\r\n H5LTget_dataset_info(group_id,\"nuebarxs\", sarraysize,NULL,NULL);\r\n sigma_array_ = std::make_shared<double>(sarraysize[0]); \r\n H5LTread_dataset_double(group_id, \"nuebarxs\", sigma_array_);\r\n } else if (flavor == -2){\r\n hsize_t sarraysize[1];\r\n H5LTget_dataset_info(group_id,\"numubarxs\", sarraysize,NULL,NULL);\r\n sigma_array_ = std::make_shared<double>(sarraysize[0]); \r\n H5LTread_dataset_double(group_id, \"numubarxs\", sigma_array_);\r\n } else if (flavor == -3){\r\n hsize_t sarraysize[1];\r\n H5LTget_dataset_info(group_id,\"nutaubarxs\", sarraysize,NULL,NULL);\r\n sigma_array_ = std::make_shared<double>(sarraysize[0]); \r\n H5LTread_dataset_double(group_id, \"nutaubarxs\", sigma_array_); \r\n } else if (flavor == 1){\r\n hsize_t sarraysize[1];\r\n H5LTget_dataset_info(group_id,\"nuexs\", sarraysize,NULL,NULL);\r\n sigma_array_ = std::make_shared<double>(sarraysize[0]); \r\n H5LTread_dataset_double(group_id, \"nuexs\", sigma_array_);\r\n } else if (flavor == 2){\r\n hsize_t sarraysize[1];\r\n H5LTget_dataset_info(group_id,\"numuxs\", sarraysize,NULL,NULL);\r\n sigma_array_ = std::make_shared<double>(sarraysize[0]); \r\n H5LTread_dataset_double(group_id, \"numuxs\", sigma_array_);\r\n } else if (flavor == 3){\r\n hsize_t sarraysize[1];\r\n H5LTget_dataset_info(group_id,\"nutauxs\", sarraysize,NULL,NULL);\r\n sigma_array_ = std::make_shared<double>(sarraysize[0]); \r\n H5LTread_dataset_double(group_id, \"nutauxs\", sigma_array_);\r\n }\r\n \r\n \/\/Get differential cross sections\r\n \r\n hsize_t dxarraysize[2];\r\n group_id = H5Gopen(root_id, grpdiff.c_str(), H5P_DEFAULT);\r\n \r\n if (flavor > 0){\r\n H5LTget_dataset_info(group_id,\"dxsnu\", dxarraysize,NULL,NULL); \r\n size_t dim1 = dxarraysize[0];\r\n size_t dim2 = dxarraysize[1];\r\n dxsdim[0] = dxarraysize[0];\r\n dxsdim[1] = dxarraysize[1];\r\n dxs_array_ = (double *)malloc(dim1*dim2*sizeof(double));\r\n H5LTread_dataset(group_id, \"dxsnu\", dxs_array_);\r\n } else {\r\n H5LTget_dataset_info(group_id,\"dxsnubar\", dxarraysize,NULL,NULL);\r\n size_t dim1 = dxarraysize[0];\r\n size_t dim2 = dxarraysize[1];\r\n dxsdim[0] = dxarraysize[0];\r\n dxsdim[1] = dxarraysize[1];\r\n dxs_array_ = (double *)malloc(dim1*dim2*sizeof(double));\r\n H5LTread_dataset(group_id, \"dxsnu\", dxs_array_);\r\n }\r\n\r\n \/\/Find RHS matrix\r\n \r\n RHSMatrix_ = get_RHS_matrices(NumNodes, energy_nodes, sigma_array_, dxs_array_);\r\n\r\n \/\/Account for tau regeneration\/Glashow resonance\r\n\r\n if (flavor == -3){\r\n std:string grptau = \"\/tau_decay_spectrum\";\r\n group_id = H5Gopen(root_id, grptau.c_str(), H5P_DEFAULT);\r\n hsize_t tauarraysize[2];\r\n H5LTget_dataset_info(group_id,\"tbarfull\", tauarraysize,NULL,NULL);\r\n size_t dim1 = tauarraysize[0];\r\n size_t dim2 = taurraysize[1];\r\n tau_array_ = (double *)malloc(dim1*dim2*sizeof(double));\r\n H5LTread_dataset(group_id, \"tbarfull\", tau_array_);\r\n RHregen_ = get_RHS_matrices(NumNodes, energy_nodes, sigma_array_, tau_array_);\r\n for (int i = 0; i<NumNodes; i++){\r\n for(int j=0; j<NumNodes;j++)\r\n *(RHSMatrix_+i*NumNodes+j) = *(RHSMatrix_+i*NumNodes+j) + *(RHregen_+i*NumNodes+j);\r\n }\r\n } else if(flavor == 3){\r\n std:string grptau = \"\/tau_decay_spectrum\";\r\n group_id = H5Gopen(root_id, grptau.c_str(), H5P_DEFAULT);\r\n hsize_t tauarraysize[2];\r\n H5LTget_dataset_info(group_id,\"tfull\", tauarraysize,NULL,NULL);\r\n size_t dim1 = tauarraysize[0];\r\n size_t dim2 = taurraysize[1];\r\n tau_array_ = (double *)malloc(dim1*dim2*sizeof(double));\r\n H5LTread_dataset(group_id, \"tbarfull\", tau_array_);\r\n RHregen_ = get_RHS_matrices(NumNodes, energy_nodes, sigma_array_, tau_array_);\r\n for (int i = 0; i<NumNodes; i++){\r\n for(int j=0; j<NumNodes;j++)\r\n *(RHSMatrix_+i*NumNodes+j) = *(RHSMatrix_+i*NumNodes+j) + *(RHregen_+i*NumNodes+j);\r\n }\r\n } else if(flavor == -1){\r\n double* glashow_total_ = get_glashow_total(energy_nodes);\r\n for (int i = 0; i < sarraysize[0]; i++){\r\n *(sigma_array_+i) = *(sigma_array_+i) + *(glashow_total_ + i)\/2.; \r\n *(RHSMatrix_ +i) = *(RHSMatrix_ +i) + *(glashow_partial_ + i)\/2.;\r\n\r\n }\r\n }\r\n phi_0_ = (double *)malloc(NumNodes*sizeof(double));\r\n for (int i = 0; i < NumNodes; i++){\r\n *(phi_0_ + i) = std::pow(*(energy_nodes +i),(2-gamma));\r\n }\r\n for (int i = 0; i < sarraysize[0]; i++){\r\n *(RHSMatrix_+i*sarraysize[0]+i) = *(RHSMatrix_+i*sarraysize[0]+i) + *(sigma_array_+i); \r\n }\r\n\r\n \/\/compute eigenvalues and eigenvectors\r\n\r\n gsl_matrix_view m = gsl_matrix_view_array(RHSMatrix_, NumNodes, NumNodes);\r\n gsl_vector *eval = gsl_vector_alloc (NumNodes);\r\n gsl_matrix *evec = gsl_matrix_alloc (NumNodes, NumNodes);\r\n gsl_eigen_nonsymmv_workspace * w = gsl_eigen_nonsymmv_alloc (NumNodes);\r\n\r\n gsl_eigen_nonsymmv (&m.matrix, eval, evec, w);\r\n\r\n int s;\r\n gsl_vector *ci = gsl_vector_alloc(NumNodes);\r\n gsl_permutation *p = gsl_permutation_alloc(NumNodes);\r\n \r\n gsl_linalg_LU_decomp (&m.matrix, p, &s);\r\n gsl_linalg_LU_solve (&m.matrix, p, phi_0_, ci);\r\n\r\n \/\/free unneeded memory\r\n gsl_permutation_free (p);\r\n gsl_eigen_nonsymmv_free (w);\r\n\r\n return eval, evec, ci, energy_nodes, phi_0_;\r\n}\r\n\r\n\r\nint nuFACE::getFlavor() const {\r\n return newflavor;\r\n}\r\n\r\ndouble nuFACE::getGamma() const {\r\n return newgamma;\r\n}\r\n\r\nstring nuFACE::getFilename() const {\r\n return newh5_filename;\r\n}\r\n<|endoftext|>"} {"text":"<commit_before>\/\/\n\/\/ This file is part of the Marble Virtual Globe.\n\/\/\n\/\/ This program is free software licensed under the GNU LGPL. You can\n\/\/ find a copy of this license in LICENSE.txt in the top directory of\n\/\/ the source code.\n\/\/\n\/\/ Copyright 2011 Valery Kharitonov <kharvd@gmail.com>\n\/\/\n\n\/\/ Self\n#include \"PostalCodeItem.h\"\n\n\/\/ Marble\n#include \"GeoPainter.h\"\n#include \"ViewportParams.h\"\n\n\/\/ Qt\n#include <QtGui\/QFontMetrics>\n\nusing namespace Marble;\n\nconst QFont PostalCodeItem::s_font = QFont( \"Sans Serif\", 10, QFont::Bold );\nconst int PostalCodeItem::s_labelOutlineWidth = 5;\n\nPostalCodeItem::PostalCodeItem( QObject *parent )\n : AbstractDataPluginItem( parent )\n{\n setSize( QSize( 0, 0 ) );\n}\n\nPostalCodeItem::~PostalCodeItem()\n{\n}\n\nQString PostalCodeItem::itemType() const\n{\n return \"postalCodeItem\";\n}\n\nbool PostalCodeItem::initialized()\n{\n return !m_text.isEmpty();\n}\n\nbool PostalCodeItem::operator<( const AbstractDataPluginItem *other ) const\n{\n return this->id() < other->id();\n}\n\nQString PostalCodeItem::text() const\n{\n return m_text;\n}\n\nvoid PostalCodeItem::setText( const QString& text )\n{\n QFontMetrics metrics( s_font );\n setSize( metrics.size( 0, text ) + QSize( 10, 10 ) );\n m_text = text;\n}\n\nvoid PostalCodeItem::paint( GeoPainter *painter, ViewportParams *viewport,\n const QString& renderPos, GeoSceneLayer * layer )\n{\n Q_UNUSED( renderPos )\n Q_UNUSED( layer )\n Q_UNUSED( viewport )\n\n painter->save();\n\n const int fontAscent = QFontMetrics( s_font ).ascent();\n\n QPen outlinepen( Qt::white );\n outlinepen.setWidthF( s_labelOutlineWidth );\n QBrush outlinebrush( Qt::black );\n\n const QPointF baseline( s_labelOutlineWidth \/ 2.0, fontAscent );\n\n QPainterPath outlinepath;\n outlinepath.addText( baseline, s_font, m_text );\n\n painter->setRenderHint( QPainter::Antialiasing, true );\n painter->setPen( outlinepen );\n painter->setBrush( outlinebrush );\n painter->drawPath( outlinepath );\n painter->setPen( Qt::NoPen );\n painter->drawPath( outlinepath );\n painter->setRenderHint( QPainter::Antialiasing, false );\n\n painter->restore();\n}\n\n#include \"PostalCodeItem.moc\"\n<commit_msg>enable caching<commit_after>\/\/\n\/\/ This file is part of the Marble Virtual Globe.\n\/\/\n\/\/ This program is free software licensed under the GNU LGPL. You can\n\/\/ find a copy of this license in LICENSE.txt in the top directory of\n\/\/ the source code.\n\/\/\n\/\/ Copyright 2011 Valery Kharitonov <kharvd@gmail.com>\n\/\/\n\n\/\/ Self\n#include \"PostalCodeItem.h\"\n\n\/\/ Marble\n#include \"GeoPainter.h\"\n#include \"ViewportParams.h\"\n\n\/\/ Qt\n#include <QtGui\/QFontMetrics>\n\nusing namespace Marble;\n\nconst QFont PostalCodeItem::s_font = QFont( \"Sans Serif\", 10, QFont::Bold );\nconst int PostalCodeItem::s_labelOutlineWidth = 5;\n\nPostalCodeItem::PostalCodeItem( QObject *parent )\n : AbstractDataPluginItem( parent )\n{\n setSize( QSize( 0, 0 ) );\n setCacheMode( ItemCoordinateCache );\n}\n\nPostalCodeItem::~PostalCodeItem()\n{\n}\n\nQString PostalCodeItem::itemType() const\n{\n return \"postalCodeItem\";\n}\n\nbool PostalCodeItem::initialized()\n{\n return !m_text.isEmpty();\n}\n\nbool PostalCodeItem::operator<( const AbstractDataPluginItem *other ) const\n{\n return this->id() < other->id();\n}\n\nQString PostalCodeItem::text() const\n{\n return m_text;\n}\n\nvoid PostalCodeItem::setText( const QString& text )\n{\n QFontMetrics metrics( s_font );\n setSize( metrics.size( 0, text ) + QSize( 10, 10 ) );\n m_text = text;\n}\n\nvoid PostalCodeItem::paint( GeoPainter *painter, ViewportParams *viewport,\n const QString& renderPos, GeoSceneLayer * layer )\n{\n Q_UNUSED( renderPos )\n Q_UNUSED( layer )\n Q_UNUSED( viewport )\n\n painter->save();\n\n const int fontAscent = QFontMetrics( s_font ).ascent();\n\n QPen outlinepen( Qt::white );\n outlinepen.setWidthF( s_labelOutlineWidth );\n QBrush outlinebrush( Qt::black );\n\n const QPointF baseline( s_labelOutlineWidth \/ 2.0, fontAscent );\n\n QPainterPath outlinepath;\n outlinepath.addText( baseline, s_font, m_text );\n\n painter->setRenderHint( QPainter::Antialiasing, true );\n painter->setPen( outlinepen );\n painter->setBrush( outlinebrush );\n painter->drawPath( outlinepath );\n painter->setPen( Qt::NoPen );\n painter->drawPath( outlinepath );\n painter->setRenderHint( QPainter::Antialiasing, false );\n\n painter->restore();\n}\n\n#include \"PostalCodeItem.moc\"\n<|endoftext|>"} {"text":"<commit_before>#include <errno.h>\n\n#include <cstdint>\n\n#include \"caffe2\/core\/db.h\"\n#include \"glog\/logging.h\"\n#include \"zmq.h\"\n\nnamespace caffe2 {\nnamespace db {\n\ntypedef char ZmqCommand;\ntypedef int ZmqMessageSize;\nconst ZmqCommand kQueryMessageSize = 's';\nconst ZmqCommand kGet = 'g';\n\nclass ZmqDBCursor : public Cursor {\n public:\n explicit ZmqDBCursor(void* requester)\n : requester_(requester), buffer_(nullptr), received_size_(0),\n buffer_size_(0) {\n \/\/ Figure out the buffer size.\n CHECK_EQ(\n zmq_send(requester_, &kQueryMessageSize, sizeof(ZmqCommand), 0),\n sizeof(ZmqCommand))\n << \"Incorrect zmq communication when querying message size.\";\n CHECK_EQ(\n zmq_recv(requester_, &buffer_size_, sizeof(ZmqMessageSize), 0),\n sizeof(ZmqMessageSize))\n << \"Incorrect zmq communication when fetching message size.\";\n CHECK_GT(buffer_size_, 0) << \"Incorrect buffer size obtained.\";\n buffer_.reset(new char[buffer_size_]);\n \/\/ obtain the first value.\n Next();\n }\n\n ~ZmqDBCursor() {}\n void SeekToFirst() override { \/* do nothing *\/ }\n void Next() override {\n CHECK_EQ(\n zmq_send(requester_, &kGet, sizeof(ZmqCommand), 0), sizeof(ZmqCommand))\n << \"Incorrect zmq communication when sending request.\";\n received_size_ = zmq_recv(requester_, buffer_.get(), buffer_size_, 0);\n CHECK_GT(received_size_, 0) << \"Received no message.\";\n }\n string key() override { return \"\"; }\n string value() override {\n return string(buffer_.get(), received_size_);\n }\n virtual bool Valid() { return true; }\n\n private:\n void* requester_;\n unique_ptr<char[]> buffer_;\n int received_size_;\n ZmqMessageSize buffer_size_;\n};\n\n\nclass ZmqDB : public DB {\n public:\n ZmqDB(const string& source, Mode mode)\n : DB(source, mode), context_(zmq_ctx_new()),\n requester_(zmq_socket(context_, ZMQ_REQ)) {\n CHECK_EQ(mode, READ) << \"ZeroMQ DB only supports read mode.\";\n VLOG(1) << \"Connecting to ZeroMQ server: \" << source;\n int ret = zmq_connect(requester_, source.c_str());\n CHECK_EQ(ret, 0) << \"Error in connecting to zmq server. \"\n << \"Error is: \" << errno;\n VLOG(1) << \"Opened ZeroMQ server: \" << source;\n }\n\n ~ZmqDB() { Close(); }\n\n void Close() override {\n if (!requester_) {\n zmq_close(requester_);\n requester_ = nullptr;\n zmq_ctx_destroy(context_);\n context_ = nullptr;\n }\n }\n\n Cursor* NewCursor() override {\n return new ZmqDBCursor(requester_);\n }\n Transaction* NewTransaction() override {\n \/\/ TODO(Yangqing): Do I really need to just do log fatal?\n LOG(FATAL) << \"ZeroMQ DB does not support writing with a transaction.\";\n return nullptr; \/\/ dummy placeholder to suppress old compiler warnings.\n }\n\n private:\n void* context_;\n void* requester_;\n};\n\nREGISTER_CAFFE2_DB(ZmqDB, ZmqDB);\n\/\/ For lazy-minded, one can also call with lower-case name.\nREGISTER_CAFFE2_DB(zmqdb, ZmqDB);\n\n} \/\/ namespace db\n} \/\/ namespace caffe2\n<commit_msg>zmqdb: make clear error message that zmq 3+ is required.<commit_after>#include <errno.h>\n\n#include <cstdint>\n\n#include \"caffe2\/core\/db.h\"\n#include \"glog\/logging.h\"\n#include \"zmq.h\"\n\n#if ZMQ_VERSION_MAJOR < 3\n#error \"ZmqDB requires ZMQ version 3 or above.\"\n#endif\n\nnamespace caffe2 {\nnamespace db {\n\ntypedef char ZmqCommand;\ntypedef int ZmqMessageSize;\nconst ZmqCommand kQueryMessageSize = 's';\nconst ZmqCommand kGet = 'g';\n\nclass ZmqDBCursor : public Cursor {\n public:\n explicit ZmqDBCursor(void* requester)\n : requester_(requester), buffer_(nullptr), received_size_(0),\n buffer_size_(0) {\n \/\/ Figure out the buffer size.\n CHECK_EQ(\n zmq_send(requester_, &kQueryMessageSize, sizeof(ZmqCommand), 0),\n sizeof(ZmqCommand))\n << \"Incorrect zmq communication when querying message size.\";\n CHECK_EQ(\n zmq_recv(requester_, &buffer_size_, sizeof(ZmqMessageSize), 0),\n sizeof(ZmqMessageSize))\n << \"Incorrect zmq communication when fetching message size.\";\n CHECK_GT(buffer_size_, 0) << \"Incorrect buffer size obtained.\";\n buffer_.reset(new char[buffer_size_]);\n \/\/ obtain the first value.\n Next();\n }\n\n ~ZmqDBCursor() {}\n void SeekToFirst() override { \/* do nothing *\/ }\n void Next() override {\n CHECK_EQ(\n zmq_send(requester_, &kGet, sizeof(ZmqCommand), 0), sizeof(ZmqCommand))\n << \"Incorrect zmq communication when sending request.\";\n received_size_ = zmq_recv(requester_, buffer_.get(), buffer_size_, 0);\n CHECK_GT(received_size_, 0) << \"Received no message.\";\n }\n string key() override { return \"\"; }\n string value() override {\n return string(buffer_.get(), received_size_);\n }\n virtual bool Valid() { return true; }\n\n private:\n void* requester_;\n unique_ptr<char[]> buffer_;\n int received_size_;\n ZmqMessageSize buffer_size_;\n};\n\n\nclass ZmqDB : public DB {\n public:\n ZmqDB(const string& source, Mode mode)\n : DB(source, mode), context_(zmq_ctx_new()),\n requester_(zmq_socket(context_, ZMQ_REQ)) {\n CHECK_EQ(mode, READ) << \"ZeroMQ DB only supports read mode.\";\n VLOG(1) << \"Connecting to ZeroMQ server: \" << source;\n int ret = zmq_connect(requester_, source.c_str());\n CHECK_EQ(ret, 0) << \"Error in connecting to zmq server. \"\n << \"Error is: \" << errno;\n VLOG(1) << \"Opened ZeroMQ server: \" << source;\n }\n\n ~ZmqDB() { Close(); }\n\n void Close() override {\n if (!requester_) {\n zmq_close(requester_);\n requester_ = nullptr;\n zmq_ctx_destroy(context_);\n context_ = nullptr;\n }\n }\n\n Cursor* NewCursor() override {\n return new ZmqDBCursor(requester_);\n }\n Transaction* NewTransaction() override {\n \/\/ TODO(Yangqing): Do I really need to just do log fatal?\n LOG(FATAL) << \"ZeroMQ DB does not support writing with a transaction.\";\n return nullptr; \/\/ dummy placeholder to suppress old compiler warnings.\n }\n\n private:\n void* context_;\n void* requester_;\n};\n\nREGISTER_CAFFE2_DB(ZmqDB, ZmqDB);\n\/\/ For lazy-minded, one can also call with lower-case name.\nREGISTER_CAFFE2_DB(zmqdb, ZmqDB);\n\n} \/\/ namespace db\n} \/\/ namespace caffe2\n<|endoftext|>"} {"text":"<commit_before>\/\/===========================================\n\/\/ Lumina-DE source code\n\/\/ Copyright (c) 2014, Ken Moore\n\/\/ Available under the 3-clause BSD license\n\/\/ See the LICENSE file for full details\n\/\/===========================================\n#ifdef __DragonFly__\n#include \"LuminaOS.h\"\n#include <unistd.h>\n\n\/\/can't read xbrightness settings - assume invalid until set\nstatic int screenbrightness = -1;\nstatic int audiovolume = -1;\n\nQString LOS::OSName(){ return \"DragonFly BSD\"; }\n\n\/\/OS-specific prefix(s)\nQString LOS::AppPrefix(){ return \"\/usr\/local\/\"; } \/\/Prefix for applications\nQString LOS::SysPrefix(){ return \"\/usr\/\"; } \/\/Prefix for system\n\n\/\/OS-specific application shortcuts (*.desktop files)\nQString LOS::ControlPanelShortcut(){ return \"\"; } \/\/system control panel\nQString LOS::AppStoreShortcut(){ return \"\"; } \/\/graphical app\/pkg manager\nQString LOS::QtConfigShortcut(){ return \"\/usr\/local\/bin\/qtconfig-qt4\"; } \/\/qtconfig binary (NOT *.desktop file)\n\n\/\/ ==== ExternalDevicePaths() ====\nQStringList LOS::ExternalDevicePaths(){\n \/\/Returns: QStringList[<type>::::<filesystem>::::<path>]\n \/\/Note: <type> = [USB, HDRIVE, DVD, SDCARD, UNKNOWN]\n QStringList devs = LUtils::getCmdOutput(\"mount\");\n \/\/Now check the output\n for(int i=0; i<devs.length(); i++){\n if(devs[i].startsWith(\"\/dev\/\")){\n QString type = devs[i].section(\" on \",0,0);\n\ttype.remove(\"\/dev\/\");\n \/\/Determine the type of hardware device based on the dev node\n if(type.startsWith(\"da\")){ type = \"USB\"; }\n else if(type.startsWith(\"ada\")){ type = \"HDRIVE\"; }\n else if(type.startsWith(\"mmsd\")){ type = \"SDCARD\"; }\n else if(type.startsWith(\"cd\")||type.startsWith(\"acd\")){ type=\"DVD\"; }\n else{ type = \"UNKNOWN\"; }\n \/\/Now put the device in the proper output format\n devs[i] = type+\"::::\"+devs[i].section(\"(\",1,1).section(\",\",0,0)+\"::::\"+devs[i].section(\" on \",1,50).section(\"(\",0,0).simplified();\n }else{\n \/\/invalid device - remove it from the list\n devs.removeAt(i);\n i--;\n }\n }\n return devs;\n}\n\n\/\/Read screen brightness information\nint LOS::ScreenBrightness(){\n \/\/Returns: Screen Brightness as a percentage (0-100, with -1 for errors)\n if(screenbrightness==-1){\n if(QFile::exists(QDir::homePath()+\"\/.lumina\/.currentxbrightness\")){\n int val = LUtils::readFile(QDir::homePath()+\"\/.lumina\/.currentxbrightness\").join(\"\").simplified().toInt();\n screenbrightness = val;\n }\n }\n \/\/If it gets to this point, then we have a valid (but new) installation\n if(screenbrightness<0){ screenbrightness = 100; } \/\/default value for systems\n\n return screenbrightness;\t\n}\n\n\/\/Set screen brightness\nvoid LOS::setScreenBrightness(int percent){\n if(percent == -1){ return; } \/\/This is usually an invalid value passed directly to the setter\n \/\/ensure bounds\n if(percent<0){percent=0;}\n else if(percent>100){ percent=100; }\n \/\/Run the command(s)\n bool success = false;\n float pf = percent\/100.0; \/\/convert to a decimel\n \/\/Run the command\n QString cmd = \"xbrightness %1\";\n cmd = cmd.arg( QString::number( int(65535*pf) ) );\n success = (0 == LUtils::runCmd(cmd) );\n \/\/Save the result for later\n if(!success){ screenbrightness = -1; }\n else{ screenbrightness = percent; }\n LUtils::writeFile(QDir::homePath()+\"\/.lumina\/.currentxbrightness\", QStringList() << QString::number(screenbrightness), true);\n}\n\n\/\/Read the current volume\nint LOS::audioVolume(){ \/\/Returns: audio volume as a percentage (0-100, with -1 for errors)\n int out = audiovolume;\n if(out < 0){\n \/\/First time session check: Load the last setting for this user\n QString info = LUtils::readFile(QDir::homePath()+\"\/.lumina\/.currentvolume\").join(\"\");\n if(!info.isEmpty()){\n out = info.simplified().toInt();\n audiovolume = out; \/\/unset this internal flag\n return out;\n }\n }\n\n \/\/probe the system for the current volume (other utils could be changing it)\n QString info = LUtils::getCmdOutput(\"mixer -S vol\").join(\":\").simplified(); \/\/ignores any other lines\n if(!info.isEmpty()){\n int L = info.section(\":\",1,1).toInt();\n int R = info.section(\":\",2,2).toInt();\n if(L>R){ out = L; }\n else{ out = R; }\n if(out != audiovolume){\n \/\/Volume changed by other utility: adjust the saved value as well\n LUtils::writeFile(QDir::homePath()+\"\/.lumina\/.currentvolume\", QStringList() << QString::number(out), true);\n }\n audiovolume = out;\n }\n\n return out;\n}\n\n\/\/Set the current volume\nvoid LOS::setAudioVolume(int percent){\n if(percent<0){percent=0;}\n else if(percent>100){percent=100;}\n QString info = LUtils::getCmdOutput(\"mixer -S vol\").join(\":\").simplified(); \/\/ignores any other lines\n if(!info.isEmpty()){\n int L = info.section(\":\",1,1).toInt();\n int R = info.section(\":\",2,2).toInt();\n int diff = L-R;\n if((percent == L) && (L==R)){ return; } \/\/already set to that volume\n if(diff<0){ R=percent; L=percent+diff; } \/\/R Greater\n else{ L=percent; R=percent-diff; } \/\/L Greater or equal\n \/\/Check bounds\n if(L<0){L=0;}else if(L>100){L=100;}\n if(R<0){R=0;}else if(R>100){R=100;}\n \/\/Run Command\n audiovolume = percent; \/\/save for checking later\n LUtils::runCmd(\"mixer vol \"+QString::number(L)+\":\"+QString::number(R));\n LUtils::writeFile(QDir::homePath()+\"\/.lumina\/.currentvolume\", QStringList() << QString::number(percent), true);\n }\n}\n\n\/\/Change the current volume a set amount (+ or -)\nvoid LOS::changeAudioVolume(int percentdiff){\n QString info = LUtils::getCmdOutput(\"mixer -S vol\").join(\":\").simplified(); \/\/ignores any other lines\n if(!info.isEmpty()){\n int L = info.section(\":\",1,1).toInt() + percentdiff;\n int R = info.section(\":\",2,2).toInt() + percentdiff;\n \/\/Check bounds\n if(L<0){L=0;}else if(L>100){L=100;}\n if(R<0){R=0;}else if(R>100){R=100;}\n \/\/Run Command\n LUtils::runCmd(\"mixer vol \"+QString::number(L)+\":\"+QString::number(R));\n }\t\n}\n\n\/\/Check if a graphical audio mixer is installed\nbool LOS::hasMixerUtility(){\n return QFile::exists(\"\/usr\/local\/bin\/pc-mixer\");\n}\n\n\/\/Launch the graphical audio mixer utility\nvoid LOS::startMixerUtility(){\n QProcess::startDetached(\"pc-mixer -notray\");\n}\n\n\/\/Check for user system permission (shutdown\/restart)\nbool LOS::userHasShutdownAccess(){\n return true; \/\/not implemented yet\n}\n\n\/\/System Shutdown\nvoid LOS::systemShutdown(){ \/\/start poweroff sequence\n QProcess::startDetached(\"shutdown -p now\");\n}\n\n\/\/System Restart\nvoid LOS::systemRestart(){ \/\/start reboot sequence\n QProcess::startDetached(\"shutdown -r now\");\n}\n\n\/\/Check for suspend support\nbool LOS::systemCanSuspend(){\n return false;\n}\n\n\/\/Put the system into the suspend state\nvoid LOS::systemSuspend(){\n\n}\n\n\/\/Battery Availability\nbool LOS::hasBattery(){\n int val = LUtils::getCmdOutput(\"apm -l\").join(\"\").toInt();\n return (val >= 0 && val <= 100);\n}\n\n\/\/Battery Charge Level\nint LOS::batteryCharge(){ \/\/Returns: percent charge (0-100), anything outside that range is counted as an error\n int charge = LUtils::getCmdOutput(\"apm -l\").join(\"\").toInt();\n if(charge > 100){ charge = -1; } \/\/invalid charge \n return charge;\t\n}\n\n\/\/Battery Charging State\nbool LOS::batteryIsCharging(){\n return (LUtils::getCmdOutput(\"apm -a\").join(\"\").simplified() == \"1\");\n}\n\n\/\/Battery Time Remaining\nint LOS::batterySecondsLeft(){ \/\/Returns: estimated number of seconds remaining\n return LUtils::getCmdOutput(\"apm -t\").join(\"\").toInt();\n}\n\n\/\/File Checksums\nQStringList LOS::Checksums(QStringList filepaths){ \/\/Return: checksum of the input file\n return QStringList();\n}\n\n\/\/file system capacity\nQString LOS::FileSystemCapacity(QString dir) { \/\/Return: percentage capacity as give by the df command\n QStringList mountInfo = LUtils::getCmdOutput(\"df \\\"\" + dir+\"\\\"\");\n QString::SectionFlag skipEmpty = QString::SectionSkipEmpty;\n \/\/we take the 5th word on the 2 line\n QString capacity = mountInfo[1].section(\" \",4,4, skipEmpty);\n return capacity;\n}\n\nQStringList LOS::CPUTemperatures(){ \/\/Returns: List containing the temperature of any CPU's (\"50C\" for example)\n return QStringList(); \/\/not implemented yet\n}\n\nint LOS::CPUUsagePercent(){ \/\/Returns: Overall percentage of the amount of CPU cycles in use (-1 for errors)\n return -1; \/\/not implemented yet\n}\n\nint LOS::MemoryUsagePercent(){\n return -1; \/\/not implemented yet\n}\n\nQStringList LOS::DiskUsage(){ \/\/Returns: List of current read\/write stats for each device\n return QStringList(); \/\/not implemented yet\n}\n#endif\n<commit_msg>DragonFly does not have graphical mixer<commit_after>\/\/===========================================\n\/\/ Lumina-DE source code\n\/\/ Copyright (c) 2014, Ken Moore\n\/\/ Available under the 3-clause BSD license\n\/\/ See the LICENSE file for full details\n\/\/===========================================\n#ifdef __DragonFly__\n#include \"LuminaOS.h\"\n#include <unistd.h>\n\n\/\/can't read xbrightness settings - assume invalid until set\nstatic int screenbrightness = -1;\nstatic int audiovolume = -1;\n\nQString LOS::OSName(){ return \"DragonFly BSD\"; }\n\n\/\/OS-specific prefix(s)\nQString LOS::AppPrefix(){ return \"\/usr\/local\/\"; } \/\/Prefix for applications\nQString LOS::SysPrefix(){ return \"\/usr\/\"; } \/\/Prefix for system\n\n\/\/OS-specific application shortcuts (*.desktop files)\nQString LOS::ControlPanelShortcut(){ return \"\"; } \/\/system control panel\nQString LOS::AppStoreShortcut(){ return \"\"; } \/\/graphical app\/pkg manager\nQString LOS::QtConfigShortcut(){ return \"\/usr\/local\/bin\/qtconfig-qt4\"; } \/\/qtconfig binary (NOT *.desktop file)\n\n\/\/ ==== ExternalDevicePaths() ====\nQStringList LOS::ExternalDevicePaths(){\n \/\/Returns: QStringList[<type>::::<filesystem>::::<path>]\n \/\/Note: <type> = [USB, HDRIVE, DVD, SDCARD, UNKNOWN]\n QStringList devs = LUtils::getCmdOutput(\"mount\");\n \/\/Now check the output\n for(int i=0; i<devs.length(); i++){\n if(devs[i].startsWith(\"\/dev\/\")){\n QString type = devs[i].section(\" on \",0,0);\n\ttype.remove(\"\/dev\/\");\n \/\/Determine the type of hardware device based on the dev node\n if(type.startsWith(\"da\")){ type = \"USB\"; }\n else if(type.startsWith(\"ada\")){ type = \"HDRIVE\"; }\n else if(type.startsWith(\"mmsd\")){ type = \"SDCARD\"; }\n else if(type.startsWith(\"cd\")||type.startsWith(\"acd\")){ type=\"DVD\"; }\n else{ type = \"UNKNOWN\"; }\n \/\/Now put the device in the proper output format\n devs[i] = type+\"::::\"+devs[i].section(\"(\",1,1).section(\",\",0,0)+\"::::\"+devs[i].section(\" on \",1,50).section(\"(\",0,0).simplified();\n }else{\n \/\/invalid device - remove it from the list\n devs.removeAt(i);\n i--;\n }\n }\n return devs;\n}\n\n\/\/Read screen brightness information\nint LOS::ScreenBrightness(){\n \/\/Returns: Screen Brightness as a percentage (0-100, with -1 for errors)\n if(screenbrightness==-1){\n if(QFile::exists(QDir::homePath()+\"\/.lumina\/.currentxbrightness\")){\n int val = LUtils::readFile(QDir::homePath()+\"\/.lumina\/.currentxbrightness\").join(\"\").simplified().toInt();\n screenbrightness = val;\n }\n }\n \/\/If it gets to this point, then we have a valid (but new) installation\n if(screenbrightness<0){ screenbrightness = 100; } \/\/default value for systems\n\n return screenbrightness;\t\n}\n\n\/\/Set screen brightness\nvoid LOS::setScreenBrightness(int percent){\n if(percent == -1){ return; } \/\/This is usually an invalid value passed directly to the setter\n \/\/ensure bounds\n if(percent<0){percent=0;}\n else if(percent>100){ percent=100; }\n \/\/Run the command(s)\n bool success = false;\n float pf = percent\/100.0; \/\/convert to a decimel\n \/\/Run the command\n QString cmd = \"xbrightness %1\";\n cmd = cmd.arg( QString::number( int(65535*pf) ) );\n success = (0 == LUtils::runCmd(cmd) );\n \/\/Save the result for later\n if(!success){ screenbrightness = -1; }\n else{ screenbrightness = percent; }\n LUtils::writeFile(QDir::homePath()+\"\/.lumina\/.currentxbrightness\", QStringList() << QString::number(screenbrightness), true);\n}\n\n\/\/Read the current volume\nint LOS::audioVolume(){ \/\/Returns: audio volume as a percentage (0-100, with -1 for errors)\n int out = audiovolume;\n if(out < 0){\n \/\/First time session check: Load the last setting for this user\n QString info = LUtils::readFile(QDir::homePath()+\"\/.lumina\/.currentvolume\").join(\"\");\n if(!info.isEmpty()){\n out = info.simplified().toInt();\n audiovolume = out; \/\/unset this internal flag\n return out;\n }\n }\n\n \/\/probe the system for the current volume (other utils could be changing it)\n QString info = LUtils::getCmdOutput(\"mixer -S vol\").join(\":\").simplified(); \/\/ignores any other lines\n if(!info.isEmpty()){\n int L = info.section(\":\",1,1).toInt();\n int R = info.section(\":\",2,2).toInt();\n if(L>R){ out = L; }\n else{ out = R; }\n if(out != audiovolume){\n \/\/Volume changed by other utility: adjust the saved value as well\n LUtils::writeFile(QDir::homePath()+\"\/.lumina\/.currentvolume\", QStringList() << QString::number(out), true);\n }\n audiovolume = out;\n }\n\n return out;\n}\n\n\/\/Set the current volume\nvoid LOS::setAudioVolume(int percent){\n if(percent<0){percent=0;}\n else if(percent>100){percent=100;}\n QString info = LUtils::getCmdOutput(\"mixer -S vol\").join(\":\").simplified(); \/\/ignores any other lines\n if(!info.isEmpty()){\n int L = info.section(\":\",1,1).toInt();\n int R = info.section(\":\",2,2).toInt();\n int diff = L-R;\n if((percent == L) && (L==R)){ return; } \/\/already set to that volume\n if(diff<0){ R=percent; L=percent+diff; } \/\/R Greater\n else{ L=percent; R=percent-diff; } \/\/L Greater or equal\n \/\/Check bounds\n if(L<0){L=0;}else if(L>100){L=100;}\n if(R<0){R=0;}else if(R>100){R=100;}\n \/\/Run Command\n audiovolume = percent; \/\/save for checking later\n LUtils::runCmd(\"mixer vol \"+QString::number(L)+\":\"+QString::number(R));\n LUtils::writeFile(QDir::homePath()+\"\/.lumina\/.currentvolume\", QStringList() << QString::number(percent), true);\n }\n}\n\n\/\/Change the current volume a set amount (+ or -)\nvoid LOS::changeAudioVolume(int percentdiff){\n QString info = LUtils::getCmdOutput(\"mixer -S vol\").join(\":\").simplified(); \/\/ignores any other lines\n if(!info.isEmpty()){\n int L = info.section(\":\",1,1).toInt() + percentdiff;\n int R = info.section(\":\",2,2).toInt() + percentdiff;\n \/\/Check bounds\n if(L<0){L=0;}else if(L>100){L=100;}\n if(R<0){R=0;}else if(R>100){R=100;}\n \/\/Run Command\n LUtils::runCmd(\"mixer vol \"+QString::number(L)+\":\"+QString::number(R));\n }\t\n}\n\n\/\/Check if a graphical audio mixer is installed\nbool LOS::hasMixerUtility(){\n return false; \/\/not implemented yet for DragonFly\n}\n\n\/\/Launch the graphical audio mixer utility\nvoid LOS::startMixerUtility(){\n \/\/Not implemented yet for DragonFly\n}\n\n\/\/Check for user system permission (shutdown\/restart)\nbool LOS::userHasShutdownAccess(){\n return true; \/\/not implemented yet\n}\n\n\/\/System Shutdown\nvoid LOS::systemShutdown(){ \/\/start poweroff sequence\n QProcess::startDetached(\"shutdown -p now\");\n}\n\n\/\/System Restart\nvoid LOS::systemRestart(){ \/\/start reboot sequence\n QProcess::startDetached(\"shutdown -r now\");\n}\n\n\/\/Check for suspend support\nbool LOS::systemCanSuspend(){\n return false;\n}\n\n\/\/Put the system into the suspend state\nvoid LOS::systemSuspend(){\n\n}\n\n\/\/Battery Availability\nbool LOS::hasBattery(){\n int val = LUtils::getCmdOutput(\"apm -l\").join(\"\").toInt();\n return (val >= 0 && val <= 100);\n}\n\n\/\/Battery Charge Level\nint LOS::batteryCharge(){ \/\/Returns: percent charge (0-100), anything outside that range is counted as an error\n int charge = LUtils::getCmdOutput(\"apm -l\").join(\"\").toInt();\n if(charge > 100){ charge = -1; } \/\/invalid charge \n return charge;\t\n}\n\n\/\/Battery Charging State\nbool LOS::batteryIsCharging(){\n return (LUtils::getCmdOutput(\"apm -a\").join(\"\").simplified() == \"1\");\n}\n\n\/\/Battery Time Remaining\nint LOS::batterySecondsLeft(){ \/\/Returns: estimated number of seconds remaining\n return LUtils::getCmdOutput(\"apm -t\").join(\"\").toInt();\n}\n\n\/\/File Checksums\nQStringList LOS::Checksums(QStringList filepaths){ \/\/Return: checksum of the input file\n return QStringList();\n}\n\n\/\/file system capacity\nQString LOS::FileSystemCapacity(QString dir) { \/\/Return: percentage capacity as give by the df command\n QStringList mountInfo = LUtils::getCmdOutput(\"df \\\"\" + dir+\"\\\"\");\n QString::SectionFlag skipEmpty = QString::SectionSkipEmpty;\n \/\/we take the 5th word on the 2 line\n QString capacity = mountInfo[1].section(\" \",4,4, skipEmpty);\n return capacity;\n}\n\nQStringList LOS::CPUTemperatures(){ \/\/Returns: List containing the temperature of any CPU's (\"50C\" for example)\n return QStringList(); \/\/not implemented yet\n}\n\nint LOS::CPUUsagePercent(){ \/\/Returns: Overall percentage of the amount of CPU cycles in use (-1 for errors)\n return -1; \/\/not implemented yet\n}\n\nint LOS::MemoryUsagePercent(){\n return -1; \/\/not implemented yet\n}\n\nQStringList LOS::DiskUsage(){ \/\/Returns: List of current read\/write stats for each device\n return QStringList(); \/\/not implemented yet\n}\n#endif\n<|endoftext|>"} {"text":"<commit_before>\/*\n *\n *\/\n\n\/\/ #include <fcntl.h>\n\/\/ #include <linux\/types.h>\n\/\/ #include <linux\/spi\/spidev.h>\n\/\/ #include <sys\/ioctl.h>\n\/\/ #include <unistd.h>\n\n#include <thread>\n\n#include \"unix\/log.hpp\"\n#include \"mcu\/constant.h\"\n\n#include \"device.hpp\"\n#include \"mcu-decode.hpp\"\n#include \"mcu-encode.hpp\"\n#include \"serial-id.hpp\"\n\nnamespace led_d\n{\n\n char_t device_t::write_buffer[buffer_size];\n char_t device_t::read_buffer[buffer_size];\n\n namespace {\n\n auto block_delay = std::chrono::milliseconds (1);\n \/\/auto empty_delay = std::chrono::milliseconds (30);\n\n \/\/ fixme: !!!\n \/\/ auto device_delay = 5;\n \/\/ auto device_mode = 0;\n \/\/ auto device_bits = 8;\n \/\/ auto device_speed = 1000;\n\n } \/\/ namespace anonymous\n\n device_t::device_t (const std::string &\/*path*\/, mcu_queue_t &to_queue,\n mcu_queue_t &from_queue, bool show_msg)\n : \/\/m_path (path),\n \/\/m_device (0),\n m_go (true),\n m_to_queue (to_queue),\n m_from_queue (from_queue),\n m_show_msg (show_msg)\n {\n }\n\n device_t::~device_t ()\n {\n m_bitbang.stop ();\n\n m_gpio.stop ();\n }\n\n void device_t::start ()\n {\n \/\/ gpio is first, we need to enable level shifter\n m_gpio.start ();\n\n \/\/ open unix device\n m_bitbang.start (m_gpio.get_chip ());\n\n m_to_queue.push\n (mcu::encode::join (serial::get (), MSG_ID_VERSION, PROTOCOL_VERSION));\n\n while (m_go == true) {\n if (((m_block.is_engaged () == true)\n && (m_gpio.is_irq_raised () == false))\n || (m_to_queue.empty () == true)) {\n std::this_thread::sleep_for (block_delay);\n continue;\n }\n if (m_gpio.is_irq_raised () == true) {\n \/\/ we are interested in gpio-irq only if 'to_queue' is empty\n write_msg (mcu::encode::join (SERIAL_ID_TO_IGNORE, MSG_ID_QUERY));\n continue;\n }\n auto msg = m_to_queue.pop ();\n if (msg)\n write_msg (*msg);\n }\n }\n\n void device_t::stop ()\n {\n m_go = false;\n\n m_bitbang.stop ();\n\n \/\/ fixme: smth else ???\n }\n\n void device_t::write_msg (const mcu_msg_t &msg_src)\n {\n char_t serial_id = mcu::decode::get_serial (msg_src);\n\n \/\/\n \/\/ eye-catch | size | serial | msg-id | xxx\n \/\/\n mcu_msg_t msg = msg_src;\n mcu::encode::wrap (msg);\n\n if (serial_id != SERIAL_ID_TO_IGNORE)\n m_block.engage (serial_id);\n\n mcu_msg_t in_msg;\n m_bitbang.transfer (msg, in_msg);\n\n if (m_show_msg == true) {\n log_t::buffer_t buf;\n if (serial_id != SERIAL_ID_TO_IGNORE) {\n buf << \"serial out: \" << (int) serial_id;\n log_t::info (buf);\n }\n log_t::clear (buf);\n buf << \"out: \";\n for (auto &num : msg)\n buf << (int) num << \" \";\n log_t::info (buf);\n log_t::clear (buf);\n buf << \"in: \";\n for (auto &num : in_msg)\n buf << (int) num << \" \";\n log_t::info (buf);\n }\n\n msg.clear ();\n for (auto &number : in_msg)\n if (m_parse.push (number, msg) == true) {\n char_t serial = 0;\n char_t msg_id = MSG_ID_EMPTY;\n if (mcu::decode::split (msg, serial, msg_id) == true) {\n m_block.relax (serial);\n if ((m_show_msg == true)\n && (serial != SERIAL_ID_TO_IGNORE)) {\n log_t::buffer_t buf;\n buf << \"serial in: \" << (int) serial;\n log_t::info (buf);\n }\n if (msg_id != MSG_ID_STATUS)\n \/\/ special handling is needed, otherwise just drop msg\n m_from_queue.push (msg);\n } else {\n log_t::buffer_t buf;\n buf << \"spi: Failed to decode mcu message\";\n log_t::error (buf);\n }\n }\n }\n\n \/\/ void device_t::device_write (uint32_t msg_size)\n \/\/ {\n \/\/ spi_ioc_transfer buf;\n \/\/ buf.tx_buf = (unsigned long) write_buffer;\n \/\/ buf.rx_buf = (unsigned long) read_buffer;\n \/\/ buf.len = msg_size;\n \/\/ buf.delay_usecs = spi_delay;\n \/\/ buf.speed_hz = 0;\n \/\/ buf.bits_per_word = 0;\n \/\/\n \/\/ if (ioctl (m_device, SPI_IOC_MESSAGE (1), &buf) < 0) {\n \/\/ log_t::buffer_t buf;\n \/\/ buf << \"spi: Failed to send spi message to mcu\";\n \/\/ log_t::error (buf);\n \/\/ }\n \/\/ }\n \/\/\n \/\/ void spi_t::device_stop ()\n \/\/ {\n \/\/ if (m_device > 0) {\n \/\/ close (m_device);\n \/\/ m_device = 0;\n \/\/ }\n \/\/ }\n \/\/\n \/\/ void spi_t::device_start ()\n \/\/ {\n \/\/ m_device = open (m_path.c_str (), O_RDWR);\n \/\/ if (m_device < 0)\n \/\/ throw std::runtime_error (\"Failed to open spi device\");\n \/\/ if (ioctl (m_device, SPI_IOC_WR_MODE, &spi_mode) < 0)\n \/\/ throw std::runtime_error (\"Failed to set spi write mode\");\n \/\/ if (ioctl (m_device, SPI_IOC_RD_MODE, &spi_mode) < 0)\n \/\/ throw std::runtime_error (\"Failed to set spi read mode\");\n \/\/ if (ioctl (m_device, SPI_IOC_WR_BITS_PER_WORD, &spi_bits) < 0)\n \/\/ throw std::runtime_error (\"Failed to set spi write bits\");\n \/\/ if (ioctl (m_device, SPI_IOC_RD_BITS_PER_WORD, &spi_bits) < 0)\n \/\/ throw std::runtime_error (\"Failed to set spi read bits\");\n \/\/ if (ioctl (m_device, SPI_IOC_WR_MAX_SPEED_HZ, &spi_speed) < 0)\n \/\/ throw std::runtime_error (\"Failed to set spi write speed\");\n \/\/ if (ioctl (m_device, SPI_IOC_RD_MAX_SPEED_HZ, &spi_speed) < 0)\n \/\/ throw std::runtime_error (\"Failed to set spi read speed\");\n \/\/ }\n\n} \/\/ namespace led_d\n<commit_msg>pi: Return prev code in device.cpp loop<commit_after>\/*\n *\n *\/\n\n\/\/ #include <fcntl.h>\n\/\/ #include <linux\/types.h>\n\/\/ #include <linux\/spi\/spidev.h>\n\/\/ #include <sys\/ioctl.h>\n\/\/ #include <unistd.h>\n\n#include <thread>\n\n#include \"unix\/log.hpp\"\n#include \"mcu\/constant.h\"\n\n#include \"device.hpp\"\n#include \"mcu-decode.hpp\"\n#include \"mcu-encode.hpp\"\n#include \"serial-id.hpp\"\n\nnamespace led_d\n{\n\n char_t device_t::write_buffer[buffer_size];\n char_t device_t::read_buffer[buffer_size];\n\n namespace {\n\n auto block_delay = std::chrono::milliseconds (1);\n \/\/auto empty_delay = std::chrono::milliseconds (30);\n\n \/\/ fixme: !!!\n \/\/ auto device_delay = 5;\n \/\/ auto device_mode = 0;\n \/\/ auto device_bits = 8;\n \/\/ auto device_speed = 1000;\n\n } \/\/ namespace anonymous\n\n device_t::device_t (const std::string &\/*path*\/, mcu_queue_t &to_queue,\n mcu_queue_t &from_queue, bool show_msg)\n : \/\/m_path (path),\n \/\/m_device (0),\n m_go (true),\n m_to_queue (to_queue),\n m_from_queue (from_queue),\n m_show_msg (show_msg)\n {\n }\n\n device_t::~device_t ()\n {\n m_bitbang.stop ();\n\n m_gpio.stop ();\n }\n\n void device_t::start ()\n {\n \/\/ gpio is first, we need to enable level shifter\n m_gpio.start ();\n\n \/\/ open unix device\n m_bitbang.start (m_gpio.get_chip ());\n\n m_to_queue.push\n (mcu::encode::join (serial::get (), MSG_ID_VERSION, PROTOCOL_VERSION));\n\n \/\/ fixme:\n \/\/ It is better to avoid using delay here,\n \/\/ but unclear how to do it\n while (m_go == true) {\n if ((m_block.is_engaged () == true)\n && (m_gpio.is_irq_raised () == false)) {\n std::this_thread::sleep_for (block_delay);\n continue;\n }\n if (m_gpio.is_irq_raised () == true) {\n \/\/ we are interested in gpio-irq only if 'to_queue' is empty\n write_msg (mcu::encode::join (SERIAL_ID_TO_IGNORE, MSG_ID_QUERY));\n continue;\n }\n auto msg = m_to_queue.pop ();\n if (msg)\n write_msg (*msg);\n }\n }\n\n void device_t::stop ()\n {\n m_go = false;\n\n m_bitbang.stop ();\n\n \/\/ fixme: smth else ???\n }\n\n void device_t::write_msg (const mcu_msg_t &msg_src)\n {\n char_t serial_id = mcu::decode::get_serial (msg_src);\n\n \/\/\n \/\/ eye-catch | size | serial | msg-id | xxx\n \/\/\n mcu_msg_t msg = msg_src;\n mcu::encode::wrap (msg);\n\n if (serial_id != SERIAL_ID_TO_IGNORE)\n m_block.engage (serial_id);\n\n mcu_msg_t in_msg;\n m_bitbang.transfer (msg, in_msg);\n\n if (m_show_msg == true) {\n log_t::buffer_t buf;\n if (serial_id != SERIAL_ID_TO_IGNORE) {\n buf << \"serial out: \" << (int) serial_id;\n log_t::info (buf);\n }\n log_t::clear (buf);\n buf << \"out: \";\n for (auto &num : msg)\n buf << (int) num << \" \";\n log_t::info (buf);\n log_t::clear (buf);\n buf << \"in: \";\n for (auto &num : in_msg)\n buf << (int) num << \" \";\n log_t::info (buf);\n }\n\n msg.clear ();\n for (auto &number : in_msg)\n if (m_parse.push (number, msg) == true) {\n char_t serial = 0;\n char_t msg_id = MSG_ID_EMPTY;\n if (mcu::decode::split (msg, serial, msg_id) == true) {\n m_block.relax (serial);\n if ((m_show_msg == true)\n && (serial != SERIAL_ID_TO_IGNORE)) {\n log_t::buffer_t buf;\n buf << \"serial in: \" << (int) serial;\n log_t::info (buf);\n }\n if (msg_id != MSG_ID_STATUS)\n \/\/ special handling is needed, otherwise just drop msg\n m_from_queue.push (msg);\n } else {\n log_t::buffer_t buf;\n buf << \"spi: Failed to decode mcu message\";\n log_t::error (buf);\n }\n }\n }\n\n \/\/ void device_t::device_write (uint32_t msg_size)\n \/\/ {\n \/\/ spi_ioc_transfer buf;\n \/\/ buf.tx_buf = (unsigned long) write_buffer;\n \/\/ buf.rx_buf = (unsigned long) read_buffer;\n \/\/ buf.len = msg_size;\n \/\/ buf.delay_usecs = spi_delay;\n \/\/ buf.speed_hz = 0;\n \/\/ buf.bits_per_word = 0;\n \/\/\n \/\/ if (ioctl (m_device, SPI_IOC_MESSAGE (1), &buf) < 0) {\n \/\/ log_t::buffer_t buf;\n \/\/ buf << \"spi: Failed to send spi message to mcu\";\n \/\/ log_t::error (buf);\n \/\/ }\n \/\/ }\n \/\/\n \/\/ void spi_t::device_stop ()\n \/\/ {\n \/\/ if (m_device > 0) {\n \/\/ close (m_device);\n \/\/ m_device = 0;\n \/\/ }\n \/\/ }\n \/\/\n \/\/ void spi_t::device_start ()\n \/\/ {\n \/\/ m_device = open (m_path.c_str (), O_RDWR);\n \/\/ if (m_device < 0)\n \/\/ throw std::runtime_error (\"Failed to open spi device\");\n \/\/ if (ioctl (m_device, SPI_IOC_WR_MODE, &spi_mode) < 0)\n \/\/ throw std::runtime_error (\"Failed to set spi write mode\");\n \/\/ if (ioctl (m_device, SPI_IOC_RD_MODE, &spi_mode) < 0)\n \/\/ throw std::runtime_error (\"Failed to set spi read mode\");\n \/\/ if (ioctl (m_device, SPI_IOC_WR_BITS_PER_WORD, &spi_bits) < 0)\n \/\/ throw std::runtime_error (\"Failed to set spi write bits\");\n \/\/ if (ioctl (m_device, SPI_IOC_RD_BITS_PER_WORD, &spi_bits) < 0)\n \/\/ throw std::runtime_error (\"Failed to set spi read bits\");\n \/\/ if (ioctl (m_device, SPI_IOC_WR_MAX_SPEED_HZ, &spi_speed) < 0)\n \/\/ throw std::runtime_error (\"Failed to set spi write speed\");\n \/\/ if (ioctl (m_device, SPI_IOC_RD_MAX_SPEED_HZ, &spi_speed) < 0)\n \/\/ throw std::runtime_error (\"Failed to set spi read speed\");\n \/\/ }\n\n} \/\/ namespace led_d\n<|endoftext|>"} {"text":"<commit_before>\/\/ MS WARNINGS MACRO\n#define _SCL_SECURE_NO_WARNINGS\n\n\/\/ Macro: Program Settings\n#define ENABLE_NETWORK_IO 0\n\n#include <iostream>\n#include <deque>\n#include <boost\/noncopyable.hpp>\n#include \"data_type.hpp\"\n#include \"pixel_sorter.hpp\"\n#include \"ppm_reader.hpp\"\n#include \"splitter.hpp\"\n#include \"algorithm.hpp\"\n#include \"algorithm_2.hpp\"\n#include \"gui.hpp\"\n#include \"network.hpp\"\n\n#include <sort_algorithm\/yrange2.hpp>\n#include <sort_algorithm\/yrange5.hpp>\n#include <sort_algorithm\/genetic.hpp>\n#include <sort_algorithm\/Murakami.hpp>\n\nclass position_manager : boost::noncopyable\n{\npublic:\n typedef question_data position_type;\n\n position_manager() = default;\n virtual ~position_manager() = default;\n\n template<class T>\n void add(T && pos)\n {\n std::lock_guard<std::mutex> lock(mutex_);\n items_.push_back(std::forward<T>(pos));\n }\n\n position_type get()\n {\n std::lock_guard<std::mutex> lock(mutex_);\n auto res = items_.front();\n items_.pop_front();\n return res;\n }\n\n bool empty()\n {\n return items_.empty();\n }\n\nprivate:\n std::mutex mutex_;\n std::deque<position_type> items_;\n};\n\nclass analyzer : boost::noncopyable\n{\npublic:\n explicit analyzer(int const problem_id, std::string const& player_id)\n : client_(), problem_id_(problem_id), player_id_(player_id)\n {\n }\n virtual ~analyzer() = default;\n\n void operator() (position_manager& manager)\n {\n \/\/ 問題文の入手\n raw_data_ = get_raw_question();\n data_ = get_skelton_question(raw_data_);\n \n \/\/ 2次元画像に分割\n split_image_ = splitter().split_image(raw_data_);\n \n \/\/ 原画像推測部\n \/\/ TODO: yrangeなどの実行\n auto sorter_resolve = sorter_(raw_data_, split_image_);\n \/\/data_.block = std::move(sorter_resolve);\n data_.block = sorter_resolve;\n manager.add(convert_block(data_)); \/\/ 解答\n\n \/\/ TODO: yrange5の実行(並列化)\n \n \/\/ 画面表示をいくつか(yrange\/Murakmi\/yrange5\/algo2 etc.)\n std::vector<boost::shared_ptr<gui::impl::MoveWindow>> windows;\n\n windows.push_back(\n gui::make_mansort_window(split_image_, sorter_resolve, \"Murakami\")\n );\n windows.push_back(\n gui::make_mansort_window(split_image_, sorter_resolve, \"Murakami\")\n );\n\n boost::thread th(\n [&]()\n {\n \/\/ futureリストでvalidを巡回し，閉じられたWindowから解とする\n while(!windows.empty())\n {\n for(auto it = windows.begin(); it != windows.end();)\n {\n auto res = gui::get_result(*it);\n if(res)\n {\n data_.block = res.get();\n manager.add(convert_block(data_)); \/\/ 解答\n\n it = windows.erase(it);\n }\n else ++it;\n }\n }\n });\n\n gui::wait_all_window();\n\n th.join();\n \n }\n\n std::string submit(answer_type const& ans) const\n {\n auto submit_result = client_.submit(problem_id_, player_id_, ans);\n return submit_result.get();\n }\n\nprivate:\n question_raw_data get_raw_question() const\n {\n#if ENABLE_NETWORK_IO\n \/\/ ネットワーク通信から\n std::string const data = client_.get_problem(01).get();\n return ppm_reader().from_data(data);\n#else\n \/\/ ファイルから\n std::string const path(\"prob01.ppm\");\n return ppm_reader().from_file(path);\n#endif\n }\n\n question_data get_skelton_question(question_raw_data const& raw) const\n {\n question_data formed = {\n problem_id_,\n player_id_,\n raw.split_num,\n raw.selectable_num,\n raw.cost.first,\n raw.cost.second,\n std::vector<std::vector<point_type>>()\n };\n\n return formed;\n }\n\n question_data convert_block(question_data const& data) const\n {\n auto res = data.clone();\n\n for(int i = 0; i < data.size.second; ++i)\n {\n for(int j = 0; j < data.size.first; ++j)\n {\n auto const& target = data.block[i][j];\n res.block[target.y][target.x] = point_type{j, i};\n }\n }\n\n return res;\n }\n\n int const problem_id_;\n std::string const player_id_;\n\n question_raw_data raw_data_;\n question_data data_;\n split_image_type split_image_;\n\n mutable network::client client_;\n pixel_sorter<Murakami> sorter_;\n};\n\nquestion_data convert_block(question_data const& data)\n{\n auto res = data.clone();\n\n for(int i = 0; i < data.size.second; ++i)\n {\n for(int j = 0; j < data.size.first; ++j)\n {\n auto const& target = data.block[i][j];\n res.block[target.y][target.x] = point_type{j, i};\n }\n }\n\n return res;\n}\n\nint main()\n{\n auto const ploblemid = 1;\n auto const token = \"3935105806\";\n\n analyzer analyze(ploblemid, token);\n algorithm_2 algo;\n position_manager manager;\n\n boost::thread thread(boost::bind(&analyzer::operator(), &analyze, std::ref(manager)));\n\n while(true)\n {\n if(!manager.empty())\n {\n \/\/ 手順探索部\n algo.reset(manager.get());\n auto const answer = algo.get();\n\n if(answer)\n {\n \/\/ 解が見つかった\n \/\/ TODO: 前より良くなったら提出など\n\/\/ auto result = analyze.submit(answer.get());\n\/\/ std::cout << \"Submit Result: \" << result << std::endl;\n std::cout << \"Test\";\n }\n }\n }\n\n thread.join();\n \n return 0;\n}\n\n<commit_msg>提出(もしくはエミュレート)操作の挿入．77行目付近のTODOは，yrange5の仕様変更が必要だ．<commit_after>\/\/ MS WARNINGS MACRO\n#define _SCL_SECURE_NO_WARNINGS\n\n\/\/ Macro: Program Settings\n#define ENABLE_NETWORK_IO 0\n\n#include <iostream>\n#include <deque>\n#include <boost\/noncopyable.hpp>\n#include \"data_type.hpp\"\n#include \"pixel_sorter.hpp\"\n#include \"ppm_reader.hpp\"\n#include \"splitter.hpp\"\n#include \"algorithm.hpp\"\n#include \"algorithm_2.hpp\"\n#include \"gui.hpp\"\n#include \"network.hpp\"\n#include \"test_tool.hpp\"\n\n#include <sort_algorithm\/yrange2.hpp>\n#include <sort_algorithm\/yrange5.hpp>\n#include <sort_algorithm\/genetic.hpp>\n#include <sort_algorithm\/Murakami.hpp>\n\nclass position_manager : boost::noncopyable\n{\npublic:\n typedef question_data position_type;\n\n position_manager() = default;\n virtual ~position_manager() = default;\n\n template<class T>\n void add(T && pos)\n {\n std::lock_guard<std::mutex> lock(mutex_);\n items_.push_back(std::forward<T>(pos));\n }\n\n position_type get()\n {\n std::lock_guard<std::mutex> lock(mutex_);\n auto res = items_.front();\n items_.pop_front();\n return res;\n }\n\n bool empty()\n {\n return items_.empty();\n }\n\nprivate:\n std::mutex mutex_;\n std::deque<position_type> items_;\n};\n\nclass analyzer : boost::noncopyable\n{\npublic:\n explicit analyzer(int const problem_id, std::string const& player_id)\n : client_(), problem_id_(problem_id), player_id_(player_id)\n {\n }\n virtual ~analyzer() = default;\n\n void operator() (position_manager& manager)\n {\n \/\/ 問題文の入手\n raw_data_ = get_raw_question();\n data_ = get_skelton_question(raw_data_);\n \n \/\/ 2次元画像に分割\n split_image_ = splitter().split_image(raw_data_);\n \n \/\/ 原画像推測部\n \/\/ TODO: yrangeなどの実行\n auto sorter_resolve = sorter_(raw_data_, split_image_);\n \/\/data_.block = std::move(sorter_resolve);\n data_.block = sorter_resolve;\n manager.add(convert_block(data_)); \/\/ 解答\n\n \/\/ TODO: yrange5の実行(並列化)\n \n \/\/ 画面表示をいくつか(yrange\/Murakmi\/yrange5\/algo2 etc.)\n std::vector<boost::shared_ptr<gui::impl::MoveWindow>> windows;\n\n windows.push_back(\n gui::make_mansort_window(split_image_, sorter_resolve, \"Murakami\")\n );\n windows.push_back(\n gui::make_mansort_window(split_image_, sorter_resolve, \"Murakami\")\n );\n\n boost::thread th(\n [&]()\n {\n \/\/ futureリストでvalidを巡回し，閉じられたWindowから解とする\n while(!windows.empty())\n {\n for(auto it = windows.begin(); it != windows.end();)\n {\n auto res = gui::get_result(*it);\n if(res)\n {\n data_.block = res.get();\n manager.add(convert_block(data_)); \/\/ 解答\n\n it = windows.erase(it);\n }\n else ++it;\n }\n }\n });\n\n gui::wait_all_window();\n\n th.join();\n \n }\n\n std::string submit(answer_type const& ans) const\n {\n auto submit_result = client_.submit(problem_id_, player_id_, ans);\n return submit_result.get();\n }\n\nprivate:\n question_raw_data get_raw_question() const\n {\n#if ENABLE_NETWORK_IO\n \/\/ ネットワーク通信から\n std::string const data = client_.get_problem(01).get();\n return ppm_reader().from_data(data);\n#else\n \/\/ ファイルから\n std::string const path(\"prob01.ppm\");\n return ppm_reader().from_file(path);\n#endif\n }\n\n question_data get_skelton_question(question_raw_data const& raw) const\n {\n question_data formed = {\n problem_id_,\n player_id_,\n raw.split_num,\n raw.selectable_num,\n raw.cost.first,\n raw.cost.second,\n std::vector<std::vector<point_type>>()\n };\n\n return formed;\n }\n\n question_data convert_block(question_data const& data) const\n {\n auto res = data.clone();\n\n for(int i = 0; i < data.size.second; ++i)\n {\n for(int j = 0; j < data.size.first; ++j)\n {\n auto const& target = data.block[i][j];\n res.block[target.y][target.x] = point_type{j, i};\n }\n }\n\n return res;\n }\n\n int const problem_id_;\n std::string const player_id_;\n\n question_raw_data raw_data_;\n question_data data_;\n split_image_type split_image_;\n\n mutable network::client client_;\n pixel_sorter<Murakami> sorter_;\n};\n\nquestion_data convert_block(question_data const& data)\n{\n auto res = data.clone();\n\n for(int i = 0; i < data.size.second; ++i)\n {\n for(int j = 0; j < data.size.first; ++j)\n {\n auto const& target = data.block[i][j];\n res.block[target.y][target.x] = point_type{j, i};\n }\n }\n\n return res;\n}\n\nint main()\n{\n auto const ploblemid = 1;\n auto const token = \"3935105806\";\n\n analyzer analyze(ploblemid, token);\n algorithm_2 algo;\n position_manager manager;\n\n boost::thread thread(boost::bind(&analyzer::operator(), &analyze, std::ref(manager)));\n\n while(true)\n {\n if(!manager.empty())\n {\n \/\/ 手順探索部\n auto question = manager.get();\n algo.reset(question);\n auto const answer = algo.get();\n\n if(answer) \/\/ 解が見つかった\n {\n#if ENABLE_NETWORK_IO\n \/\/ TODO: 前より良くなったら提出など(普通にいらないかも．提出前に目grepしてるわけだし)\n auto result = analyze.submit(answer.get());\n std::cout << \"Submit Result: \" << result << std::endl;\n#else\n test_tool::emulator emu(question);\n auto result = emu.start(answer.get());\n std::cout << \"Wrong: \" << result.wrong << std::endl;\n std::cout << \"Cost : \" << result.cost << std::endl;\n std::cout << \"---\" << std::endl;\n#endif\n }\n }\n }\n\n thread.join();\n \n return 0;\n}\n\n<|endoftext|>"} {"text":"<commit_before>\/*\nCopyright 2016 Fixstars Corporation\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 <iostream>\n#include <iomanip>\n#include <string>\n#include <chrono>\n\n#include <opencv2\/core\/core.hpp>\n#include <opencv2\/highgui\/highgui.hpp>\n#include <opencv2\/imgproc\/imgproc.hpp>\n#include <cuda_runtime.h>\n\n#include <libsgm.h>\n\n#define ASSERT_MSG(expr, msg) \\\n\tif (!(expr)) { \\\n\t\tstd::cerr << msg << std::endl; \\\n\t\tstd::exit(EXIT_FAILURE); \\\n\t} \\\n\nstruct device_buffer\n{\n\tdevice_buffer() : data(nullptr) {}\n\tdevice_buffer(size_t count) { allocate(count); }\n\tvoid allocate(size_t count) { cudaMalloc(&data, count); }\n\t~device_buffer() { cudaFree(data); }\n\tvoid* data;\n};\n\n\/\/ Camera Parameters\nstruct CameraParameters\n{\n\tfloat fu; \/\/!< focal length x (pixel)\n\tfloat fv; \/\/!< focal length y (pixel)\n\tfloat u0; \/\/!< principal point x (pixel)\n\tfloat v0; \/\/!< principal point y (pixel)\n\tfloat baseline; \/\/!< baseline (meter)\n\tfloat height; \/\/!< height position (meter), ignored when ROAD_ESTIMATION_AUTO\n\tfloat tilt; \/\/!< tilt angle (radian), ignored when ROAD_ESTIMATION_AUTO\n};\n\n\/\/ Transformation between pixel coordinate and world coordinate\nstruct CoordinateTransform\n{\n\tCoordinateTransform(const CameraParameters& camera) : camera(camera)\n\t{\n\t\tsinTilt = (sinf(camera.tilt));\n\t\tcosTilt = (cosf(camera.tilt));\n\t\tbf = camera.baseline * camera.fu;\n\t\tinvfu = 1.f \/ camera.fu;\n\t\tinvfv = 1.f \/ camera.fv;\n\t}\n\n\tinline cv::Point3f imageToWorld(const cv::Point2f& pt, float d) const\n\t{\n\t\tconst float u = pt.x;\n\t\tconst float v = pt.y;\n\n\t\tconst float Zc = bf \/ d;\n\t\tconst float Xc = invfu * (u - camera.u0) * Zc;\n\t\tconst float Yc = invfv * (v - camera.v0) * Zc;\n\n\t\tconst float Xw = Xc;\n\t\tconst float Yw = Yc * cosTilt + Zc * sinTilt;\n\t\tconst float Zw = Zc * cosTilt - Yc * sinTilt;\n\n\t\treturn cv::Point3f(Xw, Yw, Zw);\n\t}\n\n\tCameraParameters camera;\n\tfloat sinTilt, cosTilt, bf, invfu, invfv;\n};\n\ntemplate <class... Args>\nstatic std::string format_string(const char* fmt, Args... args)\n{\n\tconst int BUF_SIZE = 1024;\n\tchar buf[BUF_SIZE];\n\tstd::snprintf(buf, BUF_SIZE, fmt, args...);\n\treturn std::string(buf);\n}\n\nstatic cv::Scalar computeColor(float val)\n{\n\tconst float hscale = 6.f;\n\tfloat h = 0.6f * (1.f - val), s = 1.f, v = 1.f;\n\tfloat r, g, b;\n\n\tstatic const int sector_data[][3] =\n\t{ { 1,3,0 },{ 1,0,2 },{ 3,0,1 },{ 0,2,1 },{ 0,1,3 },{ 2,1,0 } };\n\tfloat tab[4];\n\tint sector;\n\th *= hscale;\n\tif (h < 0)\n\t\tdo h += 6; while (h < 0);\n\telse if (h >= 6)\n\t\tdo h -= 6; while (h >= 6);\n\tsector = cvFloor(h);\n\th -= sector;\n\tif ((unsigned)sector >= 6u)\n\t{\n\t\tsector = 0;\n\t\th = 0.f;\n\t}\n\n\ttab[0] = v;\n\ttab[1] = v*(1.f - s);\n\ttab[2] = v*(1.f - s*h);\n\ttab[3] = v*(1.f - s*(1.f - h));\n\n\tb = tab[sector_data[sector][0]];\n\tg = tab[sector_data[sector][1]];\n\tr = tab[sector_data[sector][2]];\n\treturn 255 * cv::Scalar(b, g, r);\n}\n\nvoid reprojectPointsTo3D(const cv::Mat& disparity, const CameraParameters& camera, std::vector<cv::Point3f>& points, bool subpixeled)\n{\n\tCV_Assert(disparity.type() == CV_8U || disparity.type() == CV_16U);\n\n\tCoordinateTransform tf(camera);\n\n\tpoints.clear();\n\tpoints.reserve(disparity.rows * disparity.cols);\n\n\tfor (int y = 0; y < disparity.rows; y++)\n\t{\n\t\tfor (int x = 0; x < disparity.cols; x++)\n\t\t{\n\t\t\tshort raw;\n\t\t\tswitch (disparity.elemSize1()) {\n\t\t\tcase 1:\n\t\t\t\traw = disparity.at<uchar>(y, x);\n\t\t\t\tbreak;\n\t\t\tcase 2:\n\t\t\t\traw = disparity.at<ushort>(y, x);\n\t\t\t\tbreak;\n\t\t\tdefault:\n\t\t\t\tCV_Assert(false);\n\t\t\t}\n\t\t\tfloat d = raw;\n\t\t\tif (subpixeled) {\n\t\t\t\td \/= sgm::StereoSGM::SUBPIXEL_SCALE;\n\t\t\t}\n\t\t\tif (d > 0)\n\t\t\t\tpoints.push_back(tf.imageToWorld(cv::Point(x, y), d));\n\t\t}\n\t}\n}\n\nvoid drawPoints3D(const std::vector<cv::Point3f>& points, cv::Mat& draw)\n{\n\tconst int SIZE_X = 512;\n\tconst int SIZE_Z = 1024;\n\tconst int maxz = 20; \/\/ [meter]\n\tconst double pixelsPerMeter = 1. * SIZE_Z \/ maxz;\n\n\tdraw = cv::Mat::zeros(SIZE_Z, SIZE_X, CV_8UC3);\n\n\tfor (const cv::Point3f& pt : points)\n\t{\n\t\tconst float X = pt.x;\n\t\tconst float Z = pt.z;\n\n\t\tconst int u = cvRound(pixelsPerMeter * X) + SIZE_X \/ 2;\n\t\tconst int v = SIZE_Z - cvRound(pixelsPerMeter * Z);\n\n\t\tconst cv::Scalar color = computeColor(std::min(Z, 1.f * maxz) \/ maxz);\n\t\tcv::circle(draw, cv::Point(u, v), 1, color);\n\t}\n}\n\nint main(int argc, char* argv[])\n{\n\tif (argc < 4) {\n\t\tstd::cout << \"usage: \" << argv[0] << \" left-image-format right-image-format camera.xml [dizp_size] [ouput_depth] [subpixel]\" << std::endl;\n\t\treturn 0;\n\t}\n\n\tconst int first_frame = 1;\n\n\tcv::Mat I1 = cv::imread(format_string(argv[1], first_frame), -1);\n\tcv::Mat I2 = cv::imread(format_string(argv[2], first_frame), -1);\n\tconst cv::FileStorage cvfs(argv[3], cv::FileStorage::READ);\n\tconst int disp_size = argc >= 5 ? std::stoi(argv[4]) : 128;\n\tconst int output_depth = argc >= 6 ? std::stoi(argv[5]) : 16;\n\tconst bool subpixel = argc >= 7 ? std::stoi(argv[6]) != 0 : true;\n\n\tASSERT_MSG(!I1.empty() && !I2.empty(), \"imread failed.\");\n\tASSERT_MSG(cvfs.isOpened(), \"camera.xml read failed.\");\n\tASSERT_MSG(I1.size() == I2.size() && I1.type() == I2.type(), \"input images must be same size and type.\");\n\tASSERT_MSG(I1.type() == CV_8U || I1.type() == CV_16U, \"input image format must be CV_8U or CV_16U.\");\n\tASSERT_MSG(disp_size == 64 || disp_size == 128, \"disparity size must be 64 or 128.\");\n\tASSERT_MSG(output_depth == 8 || output_depth == 16, \"output depth must be 8 or 16\");\n\n\t\/\/ read camera parameters\n\tconst cv::FileNode node(cvfs.fs, NULL);\n\tCameraParameters camera;\n\tcamera.fu = node[\"FocalLengthX\"];\n\tcamera.fv = node[\"FocalLengthY\"];\n\tcamera.u0 = node[\"CenterX\"];\n\tcamera.v0 = node[\"CenterY\"];\n\tcamera.baseline = node[\"BaseLine\"];\n\tcamera.tilt = node[\"Tilt\"];\n\n\tconst int width = I1.cols;\n\tconst int height = I1.rows;\n\n\tconst int input_depth = I1.type() == CV_8U ? 8 : 16;\n\tconst int input_bytes = input_depth * width * height \/ 8;\n\tconst int output_bytes = output_depth * width * height \/ 8;\n\n\tconst sgm::StereoSGM::Parameters params{10, 120, 0.95f, subpixel};\n\n\tsgm::StereoSGM sgm(width, height, disp_size, input_depth, output_depth, sgm::EXECUTE_INOUT_CUDA2CUDA, params);\n\n\tcv::Mat disparity(height, width, output_depth == 8 ? CV_8U : CV_16U);\n\tcv::Mat disparity_8u, disparity_color, draw;\n\tstd::vector<cv::Point3f> points;\n\n\tdevice_buffer d_I1(input_bytes), d_I2(input_bytes), d_disparity(output_bytes);\n\n\tfor (int frame_no = first_frame;; frame_no++) {\n\n\t\tI1 = cv::imread(format_string(argv[1], frame_no), -1);\n\t\tI2 = cv::imread(format_string(argv[2], frame_no), -1);\n\t\tif (I1.empty() || I2.empty()) {\n\t\t\tframe_no = first_frame;\n\t\t\tcontinue;\n\t\t}\n\n\t\tcudaMemcpy(d_I1.data, I1.data, input_bytes, cudaMemcpyHostToDevice);\n\t\tcudaMemcpy(d_I2.data, I2.data, input_bytes, cudaMemcpyHostToDevice);\n\n\t\tconst auto t1 = std::chrono::system_clock::now();\n\n\t\tsgm.execute(d_I1.data, d_I2.data, d_disparity.data);\n\t\tcudaDeviceSynchronize();\n\n\t\tconst auto t2 = std::chrono::system_clock::now();\n\t\tconst auto duration = std::chrono::duration_cast<std::chrono::microseconds>(t2 - t1).count();\n\t\tconst double fps = 1e6 \/ duration;\n\n\t\tcudaMemcpy(disparity.data, d_disparity.data, output_bytes, cudaMemcpyDeviceToHost);\n\n\t\t\/\/ draw results\n\t\tif (I1.type() != CV_8U) {\n\t\t\tcv::normalize(I1, I1, 0, 255, cv::NORM_MINMAX);\n\t\t\tI1.convertTo(I1, CV_8U);\n\t\t}\n\n\t\tif (subpixel) {\n\t\t\tdisparity.convertTo(disparity_8u, CV_8U, 255. \/ disp_size \/ sgm::StereoSGM::SUBPIXEL_SCALE);\n\t\t} else {\n\t\t\tdisparity.convertTo(disparity_8u, CV_8U, 255. \/ disp_size);\n\t\t}\n\t\treprojectPointsTo3D(disparity, camera, points, subpixel);\n\t\tdrawPoints3D(points, draw);\n\n\t\tcv::applyColorMap(disparity_8u, disparity_color, cv::COLORMAP_JET);\n\t\tcv::putText(disparity_color, format_string(\"sgm execution time: %4.1f[msec] %4.1f[FPS]\", 1e-3 * duration, fps),\n\t\t\tcv::Point(50, 50), 2, 0.75, cv::Scalar(255, 255, 255));\n\n\t\tcv::imshow(\"left image\", I1);\n\t\tcv::imshow(\"disparity\", disparity_color);\n\t\tcv::imshow(\"points\", draw);\n\n\t\tconst char c = cv::waitKey(1);\n\t\tif (c == 27) \/\/ ESC\n\t\t\tbreak;\n\t}\n\n\treturn 0;\n}\n<commit_msg>Use CV_32F<commit_after>\/*\nCopyright 2016 Fixstars Corporation\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 <iostream>\n#include <iomanip>\n#include <string>\n#include <chrono>\n\n#include <opencv2\/core\/core.hpp>\n#include <opencv2\/highgui\/highgui.hpp>\n#include <opencv2\/imgproc\/imgproc.hpp>\n#include <cuda_runtime.h>\n\n#include <libsgm.h>\n\n#define ASSERT_MSG(expr, msg) \\\n\tif (!(expr)) { \\\n\t\tstd::cerr << msg << std::endl; \\\n\t\tstd::exit(EXIT_FAILURE); \\\n\t} \\\n\nstruct device_buffer\n{\n\tdevice_buffer() : data(nullptr) {}\n\tdevice_buffer(size_t count) { allocate(count); }\n\tvoid allocate(size_t count) { cudaMalloc(&data, count); }\n\t~device_buffer() { cudaFree(data); }\n\tvoid* data;\n};\n\n\/\/ Camera Parameters\nstruct CameraParameters\n{\n\tfloat fu; \/\/!< focal length x (pixel)\n\tfloat fv; \/\/!< focal length y (pixel)\n\tfloat u0; \/\/!< principal point x (pixel)\n\tfloat v0; \/\/!< principal point y (pixel)\n\tfloat baseline; \/\/!< baseline (meter)\n\tfloat height; \/\/!< height position (meter), ignored when ROAD_ESTIMATION_AUTO\n\tfloat tilt; \/\/!< tilt angle (radian), ignored when ROAD_ESTIMATION_AUTO\n};\n\n\/\/ Transformation between pixel coordinate and world coordinate\nstruct CoordinateTransform\n{\n\tCoordinateTransform(const CameraParameters& camera) : camera(camera)\n\t{\n\t\tsinTilt = (sinf(camera.tilt));\n\t\tcosTilt = (cosf(camera.tilt));\n\t\tbf = camera.baseline * camera.fu;\n\t\tinvfu = 1.f \/ camera.fu;\n\t\tinvfv = 1.f \/ camera.fv;\n\t}\n\n\tinline cv::Point3f imageToWorld(const cv::Point2f& pt, float d) const\n\t{\n\t\tconst float u = pt.x;\n\t\tconst float v = pt.y;\n\n\t\tconst float Zc = bf \/ d;\n\t\tconst float Xc = invfu * (u - camera.u0) * Zc;\n\t\tconst float Yc = invfv * (v - camera.v0) * Zc;\n\n\t\tconst float Xw = Xc;\n\t\tconst float Yw = Yc * cosTilt + Zc * sinTilt;\n\t\tconst float Zw = Zc * cosTilt - Yc * sinTilt;\n\n\t\treturn cv::Point3f(Xw, Yw, Zw);\n\t}\n\n\tCameraParameters camera;\n\tfloat sinTilt, cosTilt, bf, invfu, invfv;\n};\n\ntemplate <class... Args>\nstatic std::string format_string(const char* fmt, Args... args)\n{\n\tconst int BUF_SIZE = 1024;\n\tchar buf[BUF_SIZE];\n\tstd::snprintf(buf, BUF_SIZE, fmt, args...);\n\treturn std::string(buf);\n}\n\nstatic cv::Scalar computeColor(float val)\n{\n\tconst float hscale = 6.f;\n\tfloat h = 0.6f * (1.f - val), s = 1.f, v = 1.f;\n\tfloat r, g, b;\n\n\tstatic const int sector_data[][3] =\n\t{ { 1,3,0 },{ 1,0,2 },{ 3,0,1 },{ 0,2,1 },{ 0,1,3 },{ 2,1,0 } };\n\tfloat tab[4];\n\tint sector;\n\th *= hscale;\n\tif (h < 0)\n\t\tdo h += 6; while (h < 0);\n\telse if (h >= 6)\n\t\tdo h -= 6; while (h >= 6);\n\tsector = cvFloor(h);\n\th -= sector;\n\tif ((unsigned)sector >= 6u)\n\t{\n\t\tsector = 0;\n\t\th = 0.f;\n\t}\n\n\ttab[0] = v;\n\ttab[1] = v*(1.f - s);\n\ttab[2] = v*(1.f - s*h);\n\ttab[3] = v*(1.f - s*(1.f - h));\n\n\tb = tab[sector_data[sector][0]];\n\tg = tab[sector_data[sector][1]];\n\tr = tab[sector_data[sector][2]];\n\treturn 255 * cv::Scalar(b, g, r);\n}\n\nvoid reprojectPointsTo3D(const cv::Mat& disparity, const CameraParameters& camera, std::vector<cv::Point3f>& points, bool subpixeled)\n{\n\tCV_Assert(disparity.type() == CV_32F);\n\n\tCoordinateTransform tf(camera);\n\n\tpoints.clear();\n\tpoints.reserve(disparity.rows * disparity.cols);\n\n\tfor (int y = 0; y < disparity.rows; y++)\n\t{\n\t\tfor (int x = 0; x < disparity.cols; x++)\n\t\t{\n\t\t\tconst float d = disparity.at<float>(y, x);\n\t\t\tif (d > 0)\n\t\t\t\tpoints.push_back(tf.imageToWorld(cv::Point(x, y), d));\n\t\t}\n\t}\n}\n\nvoid drawPoints3D(const std::vector<cv::Point3f>& points, cv::Mat& draw)\n{\n\tconst int SIZE_X = 512;\n\tconst int SIZE_Z = 1024;\n\tconst int maxz = 20; \/\/ [meter]\n\tconst double pixelsPerMeter = 1. * SIZE_Z \/ maxz;\n\n\tdraw = cv::Mat::zeros(SIZE_Z, SIZE_X, CV_8UC3);\n\n\tfor (const cv::Point3f& pt : points)\n\t{\n\t\tconst float X = pt.x;\n\t\tconst float Z = pt.z;\n\n\t\tconst int u = cvRound(pixelsPerMeter * X) + SIZE_X \/ 2;\n\t\tconst int v = SIZE_Z - cvRound(pixelsPerMeter * Z);\n\n\t\tconst cv::Scalar color = computeColor(std::min(Z, 1.f * maxz) \/ maxz);\n\t\tcv::circle(draw, cv::Point(u, v), 1, color);\n\t}\n}\n\nint main(int argc, char* argv[])\n{\n\tif (argc < 4) {\n\t\tstd::cout << \"usage: \" << argv[0] << \" left-image-format right-image-format camera.xml [dizp_size] [ouput_depth] [subpixel]\" << std::endl;\n\t\treturn 0;\n\t}\n\n\tconst int first_frame = 1;\n\n\tcv::Mat I1 = cv::imread(format_string(argv[1], first_frame), -1);\n\tcv::Mat I2 = cv::imread(format_string(argv[2], first_frame), -1);\n\tconst cv::FileStorage cvfs(argv[3], cv::FileStorage::READ);\n\tconst int disp_size = argc >= 5 ? std::stoi(argv[4]) : 128;\n\tconst int output_depth = argc >= 6 ? std::stoi(argv[5]) : 16;\n\tconst bool subpixel = argc >= 7 ? std::stoi(argv[6]) != 0 : true;\n\n\tASSERT_MSG(!I1.empty() && !I2.empty(), \"imread failed.\");\n\tASSERT_MSG(cvfs.isOpened(), \"camera.xml read failed.\");\n\tASSERT_MSG(I1.size() == I2.size() && I1.type() == I2.type(), \"input images must be same size and type.\");\n\tASSERT_MSG(I1.type() == CV_8U || I1.type() == CV_16U, \"input image format must be CV_8U or CV_16U.\");\n\tASSERT_MSG(disp_size == 64 || disp_size == 128, \"disparity size must be 64 or 128.\");\n\tASSERT_MSG(output_depth == 8 || output_depth == 16, \"output depth must be 8 or 16\");\n\n\t\/\/ read camera parameters\n\tconst cv::FileNode node(cvfs.fs, NULL);\n\tCameraParameters camera;\n\tcamera.fu = node[\"FocalLengthX\"];\n\tcamera.fv = node[\"FocalLengthY\"];\n\tcamera.u0 = node[\"CenterX\"];\n\tcamera.v0 = node[\"CenterY\"];\n\tcamera.baseline = node[\"BaseLine\"];\n\tcamera.tilt = node[\"Tilt\"];\n\n\tconst int width = I1.cols;\n\tconst int height = I1.rows;\n\n\tconst int input_depth = I1.type() == CV_8U ? 8 : 16;\n\tconst int input_bytes = input_depth * width * height \/ 8;\n\tconst int output_bytes = output_depth * width * height \/ 8;\n\n\tconst sgm::StereoSGM::Parameters params{10, 120, 0.95f, subpixel};\n\n\tsgm::StereoSGM sgm(width, height, disp_size, input_depth, output_depth, sgm::EXECUTE_INOUT_CUDA2CUDA, params);\n\n\tcv::Mat disparity(height, width, output_depth == 8 ? CV_8U : CV_16U);\n\tcv::Mat disparity_8u, disparity_32f, disparity_color, draw;\n\tstd::vector<cv::Point3f> points;\n\n\tdevice_buffer d_I1(input_bytes), d_I2(input_bytes), d_disparity(output_bytes);\n\n\tfor (int frame_no = first_frame;; frame_no++) {\n\n\t\tI1 = cv::imread(format_string(argv[1], frame_no), -1);\n\t\tI2 = cv::imread(format_string(argv[2], frame_no), -1);\n\t\tif (I1.empty() || I2.empty()) {\n\t\t\tframe_no = first_frame;\n\t\t\tcontinue;\n\t\t}\n\n\t\tcudaMemcpy(d_I1.data, I1.data, input_bytes, cudaMemcpyHostToDevice);\n\t\tcudaMemcpy(d_I2.data, I2.data, input_bytes, cudaMemcpyHostToDevice);\n\n\t\tconst auto t1 = std::chrono::system_clock::now();\n\n\t\tsgm.execute(d_I1.data, d_I2.data, d_disparity.data);\n\t\tcudaDeviceSynchronize();\n\n\t\tconst auto t2 = std::chrono::system_clock::now();\n\t\tconst auto duration = std::chrono::duration_cast<std::chrono::microseconds>(t2 - t1).count();\n\t\tconst double fps = 1e6 \/ duration;\n\n\t\tcudaMemcpy(disparity.data, d_disparity.data, output_bytes, cudaMemcpyDeviceToHost);\n\n\t\t\/\/ draw results\n\t\tif (I1.type() != CV_8U) {\n\t\t\tcv::normalize(I1, I1, 0, 255, cv::NORM_MINMAX);\n\t\t\tI1.convertTo(I1, CV_8U);\n\t\t}\n\n\t\tdisparity.convertTo(disparity_32f, CV_32F, subpixel ? 1. \/ sgm::StereoSGM::SUBPIXEL_SCALE : 1);\n\t\treprojectPointsTo3D(disparity_32f, camera, points, subpixel);\n\t\tdrawPoints3D(points, draw);\n\n\t\tdisparity_32f.convertTo(disparity_8u, CV_8U, 255. \/ disp_size);\n\t\tcv::applyColorMap(disparity_8u, disparity_color, cv::COLORMAP_JET);\n\t\tcv::putText(disparity_color, format_string(\"sgm execution time: %4.1f[msec] %4.1f[FPS]\", 1e-3 * duration, fps),\n\t\t\tcv::Point(50, 50), 2, 0.75, cv::Scalar(255, 255, 255));\n\n\t\tcv::imshow(\"left image\", I1);\n\t\tcv::imshow(\"disparity\", disparity_color);\n\t\tcv::imshow(\"points\", draw);\n\n\t\tconst char c = cv::waitKey(1);\n\t\tif (c == 27) \/\/ ESC\n\t\t\tbreak;\n\t}\n\n\treturn 0;\n}\n<|endoftext|>"} {"text":"<commit_before>\/\/===- Dominators.cpp - Dominator Calculation -----------------------------===\/\/\n\/\/\n\/\/ This file implements simple dominator construction algorithms for finding\n\/\/ forward dominators. Postdominators are available in libanalysis, but are not\n\/\/ included in libvmcore, because it's not needed. Forward dominators are\n\/\/ needed to support the Verifier pass.\n\/\/\n\/\/===----------------------------------------------------------------------===\/\/\n\n#include \"llvm\/Analysis\/Dominators.h\"\n#include \"llvm\/Support\/CFG.h\"\n#include \"llvm\/Assembly\/Writer.h\"\n#include \"Support\/DepthFirstIterator.h\"\n#include \"Support\/SetOperations.h\"\nusing std::set;\n\n\/\/===----------------------------------------------------------------------===\/\/\n\/\/ DominatorSet Implementation\n\/\/===----------------------------------------------------------------------===\/\/\n\nstatic RegisterAnalysis<DominatorSet>\nA(\"domset\", \"Dominator Set Construction\", true);\n\n\/\/ dominates - Return true if A dominates B. This performs the special checks\n\/\/ neccesary if A and B are in the same basic block.\n\/\/\nbool DominatorSetBase::dominates(Instruction *A, Instruction *B) const {\n BasicBlock *BBA = A->getParent(), *BBB = B->getParent();\n if (BBA != BBB) return dominates(BBA, BBB);\n \n \/\/ Loop through the basic block until we find A or B.\n BasicBlock::iterator I = BBA->begin();\n for (; &*I != A && &*I != B; ++I) \/*empty*\/;\n \n \/\/ A dominates B if it is found first in the basic block...\n return &*I == A;\n}\n\n\nvoid DominatorSet::calculateDominatorsFromBlock(BasicBlock *RootBB) {\n bool Changed;\n Doms[RootBB].insert(RootBB); \/\/ Root always dominates itself...\n do {\n Changed = false;\n\n DomSetType WorkingSet;\n df_iterator<BasicBlock*> It = df_begin(RootBB), End = df_end(RootBB);\n for ( ; It != End; ++It) {\n BasicBlock *BB = *It;\n pred_iterator PI = pred_begin(BB), PEnd = pred_end(BB);\n if (PI != PEnd) { \/\/ Is there SOME predecessor?\n\t\/\/ Loop until we get to a predecessor that has had it's dom set filled\n\t\/\/ in at least once. We are guaranteed to have this because we are\n\t\/\/ traversing the graph in DFO and have handled start nodes specially.\n\t\/\/\n\twhile (Doms[*PI].empty()) ++PI;\n\tWorkingSet = Doms[*PI];\n\n\tfor (++PI; PI != PEnd; ++PI) { \/\/ Intersect all of the predecessor sets\n\t DomSetType &PredSet = Doms[*PI];\n\t if (PredSet.size())\n\t set_intersect(WorkingSet, PredSet);\n\t}\n }\n\t\n WorkingSet.insert(BB); \/\/ A block always dominates itself\n DomSetType &BBSet = Doms[BB];\n if (BBSet != WorkingSet) {\n\tBBSet.swap(WorkingSet); \/\/ Constant time operation!\n\tChanged = true; \/\/ The sets changed.\n }\n WorkingSet.clear(); \/\/ Clear out the set for next iteration\n }\n } while (Changed);\n}\n\n\n\n\/\/ runOnFunction - This method calculates the forward dominator sets for the\n\/\/ specified function.\n\/\/\nbool DominatorSet::runOnFunction(Function &F) {\n Doms.clear(); \/\/ Reset from the last time we were run...\n Root = &F.getEntryNode();\n assert(pred_begin(Root) == pred_end(Root) &&\n\t \"Root node has predecessors in function!\");\n\n \/\/ Calculate dominator sets for the reachable basic blocks...\n calculateDominatorsFromBlock(Root);\n\n \/\/ Every basic block in the function should at least dominate themselves, and\n \/\/ thus every basic block should have an entry in Doms. The one case where we\n \/\/ miss this is when a basic block is unreachable. To get these we now do an\n \/\/ extra pass over the function, calculating dominator information for\n \/\/ unreachable blocks.\n \/\/\n for (Function::iterator I = F.begin(), E = F.end(); I != E; ++I)\n if (Doms[I].empty()) {\n calculateDominatorsFromBlock(I);\n }\n\n return false;\n}\n\n\nstatic std::ostream &operator<<(std::ostream &o, const set<BasicBlock*> &BBs) {\n for (set<BasicBlock*>::const_iterator I = BBs.begin(), E = BBs.end();\n I != E; ++I) {\n o << \" \";\n WriteAsOperand(o, *I, false);\n o << \"\\n\";\n }\n return o;\n}\n\nvoid DominatorSetBase::print(std::ostream &o) const {\n for (const_iterator I = begin(), E = end(); I != E; ++I)\n o << \"=============================--------------------------------\\n\"\n << \"\\nDominator Set For Basic Block\\n\" << I->first\n << \"-------------------------------\\n\" << I->second << \"\\n\";\n}\n\n\/\/===----------------------------------------------------------------------===\/\/\n\/\/ ImmediateDominators Implementation\n\/\/===----------------------------------------------------------------------===\/\/\n\nstatic RegisterAnalysis<ImmediateDominators>\nC(\"idom\", \"Immediate Dominators Construction\", true);\n\n\/\/ calcIDoms - Calculate the immediate dominator mapping, given a set of\n\/\/ dominators for every basic block.\nvoid ImmediateDominatorsBase::calcIDoms(const DominatorSetBase &DS) {\n \/\/ Loop over all of the nodes that have dominators... figuring out the IDOM\n \/\/ for each node...\n \/\/\n for (DominatorSet::const_iterator DI = DS.begin(), DEnd = DS.end(); \n DI != DEnd; ++DI) {\n BasicBlock *BB = DI->first;\n const DominatorSet::DomSetType &Dominators = DI->second;\n unsigned DomSetSize = Dominators.size();\n if (DomSetSize == 1) continue; \/\/ Root node... IDom = null\n\n \/\/ Loop over all dominators of this node. This corresponds to looping over\n \/\/ nodes in the dominator chain, looking for a node whose dominator set is\n \/\/ equal to the current nodes, except that the current node does not exist\n \/\/ in it. This means that it is one level higher in the dom chain than the\n \/\/ current node, and it is our idom!\n \/\/\n DominatorSet::DomSetType::const_iterator I = Dominators.begin();\n DominatorSet::DomSetType::const_iterator End = Dominators.end();\n for (; I != End; ++I) { \/\/ Iterate over dominators...\n \/\/ All of our dominators should form a chain, where the number of elements\n \/\/ in the dominator set indicates what level the node is at in the chain.\n \/\/ We want the node immediately above us, so it will have an identical \n \/\/ dominator set, except that BB will not dominate it... therefore it's\n \/\/ dominator set size will be one less than BB's...\n \/\/\n if (DS.getDominators(*I).size() == DomSetSize - 1) {\n\tIDoms[BB] = *I;\n\tbreak;\n }\n }\n }\n}\n\nvoid ImmediateDominatorsBase::print(std::ostream &o) const {\n for (const_iterator I = begin(), E = end(); I != E; ++I)\n o << \"=============================--------------------------------\\n\"\n << \"\\nImmediate Dominator For Basic Block\\n\" << *I->first\n << \"is: \\n\" << *I->second << \"\\n\";\n}\n\n\n\/\/===----------------------------------------------------------------------===\/\/\n\/\/ DominatorTree Implementation\n\/\/===----------------------------------------------------------------------===\/\/\n\nstatic RegisterAnalysis<DominatorTree>\nE(\"domtree\", \"Dominator Tree Construction\", true);\n\n\/\/ DominatorTreeBase::reset - Free all of the tree node memory.\n\/\/\nvoid DominatorTreeBase::reset() { \n for (NodeMapType::iterator I = Nodes.begin(), E = Nodes.end(); I != E; ++I)\n delete I->second;\n Nodes.clear();\n}\n\n\nvoid DominatorTree::calculate(const DominatorSet &DS) {\n Nodes[Root] = new Node(Root, 0); \/\/ Add a node for the root...\n\n \/\/ Iterate over all nodes in depth first order...\n for (df_iterator<BasicBlock*> I = df_begin(Root), E = df_end(Root);\n I != E; ++I) {\n BasicBlock *BB = *I;\n const DominatorSet::DomSetType &Dominators = DS.getDominators(BB);\n unsigned DomSetSize = Dominators.size();\n if (DomSetSize == 1) continue; \/\/ Root node... IDom = null\n \n \/\/ Loop over all dominators of this node. This corresponds to looping over\n \/\/ nodes in the dominator chain, looking for a node whose dominator set is\n \/\/ equal to the current nodes, except that the current node does not exist\n \/\/ in it. This means that it is one level higher in the dom chain than the\n \/\/ current node, and it is our idom! We know that we have already added\n \/\/ a DominatorTree node for our idom, because the idom must be a\n \/\/ predecessor in the depth first order that we are iterating through the\n \/\/ function.\n \/\/\n DominatorSet::DomSetType::const_iterator I = Dominators.begin();\n DominatorSet::DomSetType::const_iterator End = Dominators.end();\n for (; I != End; ++I) { \/\/ Iterate over dominators...\n \/\/ All of our dominators should form a chain, where the number of\n \/\/ elements in the dominator set indicates what level the node is at in\n \/\/ the chain. We want the node immediately above us, so it will have\n \/\/ an identical dominator set, except that BB will not dominate it...\n \/\/ therefore it's dominator set size will be one less than BB's...\n \/\/\n if (DS.getDominators(*I).size() == DomSetSize - 1) {\n \/\/ We know that the immediate dominator should already have a node, \n \/\/ because we are traversing the CFG in depth first order!\n \/\/\n Node *IDomNode = Nodes[*I];\n assert(IDomNode && \"No node for IDOM?\");\n \n \/\/ Add a new tree node for this BasicBlock, and link it as a child of\n \/\/ IDomNode\n Nodes[BB] = IDomNode->addChild(new Node(BB, IDomNode));\n break;\n }\n }\n }\n}\n\n\nstatic std::ostream &operator<<(std::ostream &o,\n const DominatorTreeBase::Node *Node) {\n return o << Node->getNode()\n << \"\\n------------------------------------------\\n\";\n}\n\nstatic void PrintDomTree(const DominatorTreeBase::Node *N, std::ostream &o,\n unsigned Lev) {\n o << \"Level #\" << Lev << \": \" << N;\n for (DominatorTreeBase::Node::const_iterator I = N->begin(), E = N->end(); \n I != E; ++I) {\n PrintDomTree(*I, o, Lev+1);\n }\n}\n\nvoid DominatorTreeBase::print(std::ostream &o) const {\n o << \"=============================--------------------------------\\n\"\n << \"Inorder Dominator Tree:\\n\";\n PrintDomTree(Nodes.find(getRoot())->second, o, 1);\n}\n\n\n\/\/===----------------------------------------------------------------------===\/\/\n\/\/ DominanceFrontier Implementation\n\/\/===----------------------------------------------------------------------===\/\/\n\nstatic RegisterAnalysis<DominanceFrontier>\nG(\"domfrontier\", \"Dominance Frontier Construction\", true);\n\nconst DominanceFrontier::DomSetType &\nDominanceFrontier::calculate(const DominatorTree &DT, \n const DominatorTree::Node *Node) {\n \/\/ Loop over CFG successors to calculate DFlocal[Node]\n BasicBlock *BB = Node->getNode();\n DomSetType &S = Frontiers[BB]; \/\/ The new set to fill in...\n\n for (succ_iterator SI = succ_begin(BB), SE = succ_end(BB);\n SI != SE; ++SI) {\n \/\/ Does Node immediately dominate this successor?\n if (DT[*SI]->getIDom() != Node)\n S.insert(*SI);\n }\n\n \/\/ At this point, S is DFlocal. Now we union in DFup's of our children...\n \/\/ Loop through and visit the nodes that Node immediately dominates (Node's\n \/\/ children in the IDomTree)\n \/\/\n for (DominatorTree::Node::const_iterator NI = Node->begin(), NE = Node->end();\n NI != NE; ++NI) {\n DominatorTree::Node *IDominee = *NI;\n const DomSetType &ChildDF = calculate(DT, IDominee);\n\n DomSetType::const_iterator CDFI = ChildDF.begin(), CDFE = ChildDF.end();\n for (; CDFI != CDFE; ++CDFI) {\n if (!Node->dominates(DT[*CDFI]))\n\tS.insert(*CDFI);\n }\n }\n\n return S;\n}\n\nvoid DominanceFrontierBase::print(std::ostream &o) const {\n for (const_iterator I = begin(), E = end(); I != E; ++I) {\n o << \"=============================--------------------------------\\n\"\n << \"\\nDominance Frontier For Basic Block\\n\";\n WriteAsOperand(o, I->first, false);\n o << \" is: \\n\" << I->second << \"\\n\";\n }\n}\n<commit_msg> - Add methods to ImmediateDominators & DominatorTree to allow updates - Make DominatorTree::Node not inherit from std::vector<commit_after>\/\/===- Dominators.cpp - Dominator Calculation -----------------------------===\/\/\n\/\/\n\/\/ This file implements simple dominator construction algorithms for finding\n\/\/ forward dominators. Postdominators are available in libanalysis, but are not\n\/\/ included in libvmcore, because it's not needed. Forward dominators are\n\/\/ needed to support the Verifier pass.\n\/\/\n\/\/===----------------------------------------------------------------------===\/\/\n\n#include \"llvm\/Analysis\/Dominators.h\"\n#include \"llvm\/Support\/CFG.h\"\n#include \"llvm\/Assembly\/Writer.h\"\n#include \"Support\/DepthFirstIterator.h\"\n#include \"Support\/SetOperations.h\"\nusing std::set;\n\n\/\/===----------------------------------------------------------------------===\/\/\n\/\/ DominatorSet Implementation\n\/\/===----------------------------------------------------------------------===\/\/\n\nstatic RegisterAnalysis<DominatorSet>\nA(\"domset\", \"Dominator Set Construction\", true);\n\n\/\/ dominates - Return true if A dominates B. This performs the special checks\n\/\/ neccesary if A and B are in the same basic block.\n\/\/\nbool DominatorSetBase::dominates(Instruction *A, Instruction *B) const {\n BasicBlock *BBA = A->getParent(), *BBB = B->getParent();\n if (BBA != BBB) return dominates(BBA, BBB);\n \n \/\/ Loop through the basic block until we find A or B.\n BasicBlock::iterator I = BBA->begin();\n for (; &*I != A && &*I != B; ++I) \/*empty*\/;\n \n \/\/ A dominates B if it is found first in the basic block...\n return &*I == A;\n}\n\n\nvoid DominatorSet::calculateDominatorsFromBlock(BasicBlock *RootBB) {\n bool Changed;\n Doms[RootBB].insert(RootBB); \/\/ Root always dominates itself...\n do {\n Changed = false;\n\n DomSetType WorkingSet;\n df_iterator<BasicBlock*> It = df_begin(RootBB), End = df_end(RootBB);\n for ( ; It != End; ++It) {\n BasicBlock *BB = *It;\n pred_iterator PI = pred_begin(BB), PEnd = pred_end(BB);\n if (PI != PEnd) { \/\/ Is there SOME predecessor?\n\t\/\/ Loop until we get to a predecessor that has had it's dom set filled\n\t\/\/ in at least once. We are guaranteed to have this because we are\n\t\/\/ traversing the graph in DFO and have handled start nodes specially.\n\t\/\/\n\twhile (Doms[*PI].empty()) ++PI;\n\tWorkingSet = Doms[*PI];\n\n\tfor (++PI; PI != PEnd; ++PI) { \/\/ Intersect all of the predecessor sets\n\t DomSetType &PredSet = Doms[*PI];\n\t if (PredSet.size())\n\t set_intersect(WorkingSet, PredSet);\n\t}\n }\n\t\n WorkingSet.insert(BB); \/\/ A block always dominates itself\n DomSetType &BBSet = Doms[BB];\n if (BBSet != WorkingSet) {\n\tBBSet.swap(WorkingSet); \/\/ Constant time operation!\n\tChanged = true; \/\/ The sets changed.\n }\n WorkingSet.clear(); \/\/ Clear out the set for next iteration\n }\n } while (Changed);\n}\n\n\n\n\/\/ runOnFunction - This method calculates the forward dominator sets for the\n\/\/ specified function.\n\/\/\nbool DominatorSet::runOnFunction(Function &F) {\n Doms.clear(); \/\/ Reset from the last time we were run...\n Root = &F.getEntryNode();\n assert(pred_begin(Root) == pred_end(Root) &&\n\t \"Root node has predecessors in function!\");\n\n \/\/ Calculate dominator sets for the reachable basic blocks...\n calculateDominatorsFromBlock(Root);\n\n \/\/ Every basic block in the function should at least dominate themselves, and\n \/\/ thus every basic block should have an entry in Doms. The one case where we\n \/\/ miss this is when a basic block is unreachable. To get these we now do an\n \/\/ extra pass over the function, calculating dominator information for\n \/\/ unreachable blocks.\n \/\/\n for (Function::iterator I = F.begin(), E = F.end(); I != E; ++I)\n if (Doms[I].empty()) {\n calculateDominatorsFromBlock(I);\n }\n\n return false;\n}\n\n\nstatic std::ostream &operator<<(std::ostream &o, const set<BasicBlock*> &BBs) {\n for (set<BasicBlock*>::const_iterator I = BBs.begin(), E = BBs.end();\n I != E; ++I) {\n o << \" \";\n WriteAsOperand(o, *I, false);\n o << \"\\n\";\n }\n return o;\n}\n\nvoid DominatorSetBase::print(std::ostream &o) const {\n for (const_iterator I = begin(), E = end(); I != E; ++I)\n o << \"=============================--------------------------------\\n\"\n << \"\\nDominator Set For Basic Block\\n\" << I->first\n << \"-------------------------------\\n\" << I->second << \"\\n\";\n}\n\n\/\/===----------------------------------------------------------------------===\/\/\n\/\/ ImmediateDominators Implementation\n\/\/===----------------------------------------------------------------------===\/\/\n\nstatic RegisterAnalysis<ImmediateDominators>\nC(\"idom\", \"Immediate Dominators Construction\", true);\n\n\/\/ calcIDoms - Calculate the immediate dominator mapping, given a set of\n\/\/ dominators for every basic block.\nvoid ImmediateDominatorsBase::calcIDoms(const DominatorSetBase &DS) {\n \/\/ Loop over all of the nodes that have dominators... figuring out the IDOM\n \/\/ for each node...\n \/\/\n for (DominatorSet::const_iterator DI = DS.begin(), DEnd = DS.end(); \n DI != DEnd; ++DI) {\n BasicBlock *BB = DI->first;\n const DominatorSet::DomSetType &Dominators = DI->second;\n unsigned DomSetSize = Dominators.size();\n if (DomSetSize == 1) continue; \/\/ Root node... IDom = null\n\n \/\/ Loop over all dominators of this node. This corresponds to looping over\n \/\/ nodes in the dominator chain, looking for a node whose dominator set is\n \/\/ equal to the current nodes, except that the current node does not exist\n \/\/ in it. This means that it is one level higher in the dom chain than the\n \/\/ current node, and it is our idom!\n \/\/\n DominatorSet::DomSetType::const_iterator I = Dominators.begin();\n DominatorSet::DomSetType::const_iterator End = Dominators.end();\n for (; I != End; ++I) { \/\/ Iterate over dominators...\n \/\/ All of our dominators should form a chain, where the number of elements\n \/\/ in the dominator set indicates what level the node is at in the chain.\n \/\/ We want the node immediately above us, so it will have an identical \n \/\/ dominator set, except that BB will not dominate it... therefore it's\n \/\/ dominator set size will be one less than BB's...\n \/\/\n if (DS.getDominators(*I).size() == DomSetSize - 1) {\n\tIDoms[BB] = *I;\n\tbreak;\n }\n }\n }\n}\n\nvoid ImmediateDominatorsBase::print(std::ostream &o) const {\n for (const_iterator I = begin(), E = end(); I != E; ++I)\n o << \"=============================--------------------------------\\n\"\n << \"\\nImmediate Dominator For Basic Block\\n\" << *I->first\n << \"is: \\n\" << *I->second << \"\\n\";\n}\n\n\n\/\/===----------------------------------------------------------------------===\/\/\n\/\/ DominatorTree Implementation\n\/\/===----------------------------------------------------------------------===\/\/\n\nstatic RegisterAnalysis<DominatorTree>\nE(\"domtree\", \"Dominator Tree Construction\", true);\n\n\/\/ DominatorTreeBase::reset - Free all of the tree node memory.\n\/\/\nvoid DominatorTreeBase::reset() { \n for (NodeMapType::iterator I = Nodes.begin(), E = Nodes.end(); I != E; ++I)\n delete I->second;\n Nodes.clear();\n}\n\nvoid DominatorTreeBase::Node2::setIDom(Node2 *NewIDom) {\n assert(IDom && \"No immediate dominator?\");\n if (IDom != NewIDom) {\n std::vector<Node*>::iterator I =\n std::find(IDom->Children.begin(), IDom->Children.end(), this);\n assert(I != IDom->Children.end() &&\n \"Not in immediate dominator children set!\");\n \/\/ I am no longer your child...\n IDom->Children.erase(I);\n\n \/\/ Switch to new dominator\n IDom = NewIDom;\n IDom->Children.push_back(this);\n }\n}\n\n\n\nvoid DominatorTree::calculate(const DominatorSet &DS) {\n Nodes[Root] = new Node(Root, 0); \/\/ Add a node for the root...\n\n \/\/ Iterate over all nodes in depth first order...\n for (df_iterator<BasicBlock*> I = df_begin(Root), E = df_end(Root);\n I != E; ++I) {\n BasicBlock *BB = *I;\n const DominatorSet::DomSetType &Dominators = DS.getDominators(BB);\n unsigned DomSetSize = Dominators.size();\n if (DomSetSize == 1) continue; \/\/ Root node... IDom = null\n \n \/\/ Loop over all dominators of this node. This corresponds to looping over\n \/\/ nodes in the dominator chain, looking for a node whose dominator set is\n \/\/ equal to the current nodes, except that the current node does not exist\n \/\/ in it. This means that it is one level higher in the dom chain than the\n \/\/ current node, and it is our idom! We know that we have already added\n \/\/ a DominatorTree node for our idom, because the idom must be a\n \/\/ predecessor in the depth first order that we are iterating through the\n \/\/ function.\n \/\/\n DominatorSet::DomSetType::const_iterator I = Dominators.begin();\n DominatorSet::DomSetType::const_iterator End = Dominators.end();\n for (; I != End; ++I) { \/\/ Iterate over dominators...\n \/\/ All of our dominators should form a chain, where the number of\n \/\/ elements in the dominator set indicates what level the node is at in\n \/\/ the chain. We want the node immediately above us, so it will have\n \/\/ an identical dominator set, except that BB will not dominate it...\n \/\/ therefore it's dominator set size will be one less than BB's...\n \/\/\n if (DS.getDominators(*I).size() == DomSetSize - 1) {\n \/\/ We know that the immediate dominator should already have a node, \n \/\/ because we are traversing the CFG in depth first order!\n \/\/\n Node *IDomNode = Nodes[*I];\n assert(IDomNode && \"No node for IDOM?\");\n \n \/\/ Add a new tree node for this BasicBlock, and link it as a child of\n \/\/ IDomNode\n Nodes[BB] = IDomNode->addChild(new Node(BB, IDomNode));\n break;\n }\n }\n }\n}\n\n\nstatic std::ostream &operator<<(std::ostream &o,\n const DominatorTreeBase::Node *Node) {\n return o << Node->getNode()\n << \"\\n------------------------------------------\\n\";\n}\n\nstatic void PrintDomTree(const DominatorTreeBase::Node *N, std::ostream &o,\n unsigned Lev) {\n o << \"Level #\" << Lev << \": \" << N;\n for (DominatorTreeBase::Node::const_iterator I = N->begin(), E = N->end(); \n I != E; ++I) {\n PrintDomTree(*I, o, Lev+1);\n }\n}\n\nvoid DominatorTreeBase::print(std::ostream &o) const {\n o << \"=============================--------------------------------\\n\"\n << \"Inorder Dominator Tree:\\n\";\n PrintDomTree(Nodes.find(getRoot())->second, o, 1);\n}\n\n\n\/\/===----------------------------------------------------------------------===\/\/\n\/\/ DominanceFrontier Implementation\n\/\/===----------------------------------------------------------------------===\/\/\n\nstatic RegisterAnalysis<DominanceFrontier>\nG(\"domfrontier\", \"Dominance Frontier Construction\", true);\n\nconst DominanceFrontier::DomSetType &\nDominanceFrontier::calculate(const DominatorTree &DT, \n const DominatorTree::Node *Node) {\n \/\/ Loop over CFG successors to calculate DFlocal[Node]\n BasicBlock *BB = Node->getNode();\n DomSetType &S = Frontiers[BB]; \/\/ The new set to fill in...\n\n for (succ_iterator SI = succ_begin(BB), SE = succ_end(BB);\n SI != SE; ++SI) {\n \/\/ Does Node immediately dominate this successor?\n if (DT[*SI]->getIDom() != Node)\n S.insert(*SI);\n }\n\n \/\/ At this point, S is DFlocal. Now we union in DFup's of our children...\n \/\/ Loop through and visit the nodes that Node immediately dominates (Node's\n \/\/ children in the IDomTree)\n \/\/\n for (DominatorTree::Node::const_iterator NI = Node->begin(), NE = Node->end();\n NI != NE; ++NI) {\n DominatorTree::Node *IDominee = *NI;\n const DomSetType &ChildDF = calculate(DT, IDominee);\n\n DomSetType::const_iterator CDFI = ChildDF.begin(), CDFE = ChildDF.end();\n for (; CDFI != CDFE; ++CDFI) {\n if (!Node->dominates(DT[*CDFI]))\n\tS.insert(*CDFI);\n }\n }\n\n return S;\n}\n\nvoid DominanceFrontierBase::print(std::ostream &o) const {\n for (const_iterator I = begin(), E = end(); I != E; ++I) {\n o << \"=============================--------------------------------\\n\"\n << \"\\nDominance Frontier For Basic Block\\n\";\n WriteAsOperand(o, I->first, false);\n o << \" is: \\n\" << I->second << \"\\n\";\n }\n}\n<|endoftext|>"} {"text":"<commit_before>\/******************************************************************************\n * ____ _ _____ *\n * \/ ___| \/ \\ | ___| C++ *\n * | | \/ _ \\ | |_ Actor *\n * | |___ \/ ___ \\| _| Framework *\n * \\____\/_\/ \\_|_| *\n * *\n * Copyright 2011-2018 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\/config.hpp\"\n\n#define CAF_SUITE actor_clock\n#include \"caf\/test\/dsl.hpp\"\n\n#include <chrono>\n#include <memory>\n\n#include \"caf\/all.hpp\"\n#include \"caf\/detail\/test_actor_clock.hpp\"\n#include \"caf\/raw_event_based_actor.hpp\"\n\nusing namespace caf;\n\nnamespace {\n\nusing std::chrono::seconds;\n\nstruct testee_state {\n uint32_t timeout_id = 41;\n};\n\nbehavior testee(stateful_actor<testee_state, raw_event_based_actor>* self,\n detail::test_actor_clock* t) {\n return {\n [=](ok_atom) {\n auto n = t->now() + seconds(10);\n self->state.timeout_id += 1;\n t->set_receive_timeout(n, self, self->state.timeout_id);\n },\n [=](add_atom) {\n auto n = t->now() + seconds(10);\n self->state.timeout_id += 1;\n auto mid = make_message_id(self->state.timeout_id).response_id();\n t->set_request_timeout(n, self, mid);\n },\n [](const timeout_msg&) {\n \/\/ nop\n },\n [](const error&) {\n \/\/ nop\n },\n [](const std::string&) {\n \/\/ nop\n },\n [=](group& grp) {\n self->join(grp);\n },\n [=](exit_msg& x) {\n self->quit(x.reason);\n }\n };\n}\n\nstruct fixture : test_coordinator_fixture<> {\n detail::test_actor_clock t;\n actor aut;\n\n fixture() : aut(sys.spawn<lazy_init>(testee, &t)) {\n \/\/ nop\n }\n};\n\nstruct tid {\n uint32_t value;\n};\n\ninline bool operator==(const timeout_msg& x, const tid& y) {\n return x.timeout_id == y.value;\n}\n\n} \/\/ namespace <anonymous>\n\nCAF_TEST_FIXTURE_SCOPE(timer_tests, fixture)\n\nCAF_TEST(single_receive_timeout) {\n \/\/ Have AUT call t.set_receive_timeout().\n self->send(aut, ok_atom::value);\n expect((ok_atom), from(self).to(aut).with(_));\n CAF_CHECK_EQUAL(t.schedule().size(), 1u);\n CAF_CHECK_EQUAL(t.actor_lookup().size(), 1u);\n \/\/ Advance time to send timeout message.\n t.advance_time(seconds(10));\n CAF_CHECK_EQUAL(t.schedule().size(), 0u);\n CAF_CHECK_EQUAL(t.actor_lookup().size(), 0u);\n \/\/ Have AUT receive the timeout.\n expect((timeout_msg), from(aut).to(aut).with(tid{42}));\n}\n\nCAF_TEST(override_receive_timeout) {\n \/\/ Have AUT call t.set_receive_timeout().\n self->send(aut, ok_atom::value);\n expect((ok_atom), from(self).to(aut).with(_));\n CAF_CHECK_EQUAL(t.schedule().size(), 1u);\n CAF_CHECK_EQUAL(t.actor_lookup().size(), 1u);\n \/\/ Have AUT call t.set_timeout() again.\n self->send(aut, ok_atom::value);\n expect((ok_atom), from(self).to(aut).with(_));\n CAF_CHECK_EQUAL(t.schedule().size(), 1u);\n CAF_CHECK_EQUAL(t.actor_lookup().size(), 1u);\n \/\/ Advance time to send timeout message.\n t.advance_time(seconds(10));\n CAF_CHECK_EQUAL(t.schedule().size(), 0u);\n CAF_CHECK_EQUAL(t.actor_lookup().size(), 0u);\n \/\/ Have AUT receive the timeout.\n expect((timeout_msg), from(aut).to(aut).with(tid{43}));\n}\n\nCAF_TEST(single_request_timeout) {\n \/\/ Have AUT call t.set_request_timeout().\n self->send(aut, add_atom::value);\n expect((add_atom), from(self).to(aut).with(_));\n CAF_CHECK_EQUAL(t.schedule().size(), 1u);\n CAF_CHECK_EQUAL(t.actor_lookup().size(), 1u);\n \/\/ Advance time to send timeout message.\n t.advance_time(seconds(10));\n CAF_CHECK_EQUAL(t.schedule().size(), 0u);\n CAF_CHECK_EQUAL(t.actor_lookup().size(), 0u);\n \/\/ Have AUT receive the timeout.\n expect((error), from(aut).to(aut).with(sec::request_timeout));\n}\n\nCAF_TEST(mixed_receive_and_request_timeouts) {\n \/\/ Have AUT call t.set_receive_timeout().\n self->send(aut, ok_atom::value);\n expect((ok_atom), from(self).to(aut).with(_));\n CAF_CHECK_EQUAL(t.schedule().size(), 1u);\n CAF_CHECK_EQUAL(t.actor_lookup().size(), 1u);\n \/\/ Cause the request timeout to arrive later.\n t.advance_time(seconds(5));\n \/\/ Have AUT call t.set_request_timeout().\n self->send(aut, add_atom::value);\n expect((add_atom), from(self).to(aut).with(_));\n CAF_CHECK_EQUAL(t.schedule().size(), 2u);\n CAF_CHECK_EQUAL(t.actor_lookup().size(), 2u);\n \/\/ Advance time to send receive timeout message.\n t.advance_time(seconds(5));\n CAF_CHECK_EQUAL(t.schedule().size(), 1u);\n CAF_CHECK_EQUAL(t.actor_lookup().size(), 1u);\n \/\/ Have AUT receive the timeout.\n expect((timeout_msg), from(aut).to(aut).with(tid{42}));\n \/\/ Advance time to send request timeout message.\n t.advance_time(seconds(10));\n CAF_CHECK_EQUAL(t.schedule().size(), 0u);\n CAF_CHECK_EQUAL(t.actor_lookup().size(), 0u);\n \/\/ Have AUT receive the timeout.\n expect((error), from(aut).to(aut).with(sec::request_timeout));\n}\n\nCAF_TEST(delay_actor_message) {\n \/\/ Schedule a message for now + 10s.\n auto n = t.now() + seconds(10);\n auto autptr = actor_cast<strong_actor_ptr>(aut);\n t.schedule_message(n, autptr,\n make_mailbox_element(autptr, make_message_id(),\n no_stages, \"foo\"));\n CAF_CHECK_EQUAL(t.schedule().size(), 1u);\n CAF_CHECK_EQUAL(t.actor_lookup().size(), 0u);\n \/\/ Advance time to send the message.\n t.advance_time(seconds(10));\n CAF_CHECK_EQUAL(t.schedule().size(), 0u);\n CAF_CHECK_EQUAL(t.actor_lookup().size(), 0u);\n \/\/ Have AUT receive the message.\n expect((std::string), from(aut).to(aut).with(\"foo\"));\n}\n\nCAF_TEST(delay_group_message) {\n \/\/ Have AUT join the group.\n auto grp = sys.groups().anonymous();\n self->send(aut, grp);\n expect((group), from(self).to(aut).with(_));\n \/\/ Schedule a message for now + 10s.\n auto n = t.now() + seconds(10);\n auto autptr = actor_cast<strong_actor_ptr>(aut);\n t.schedule_message(n, std::move(grp), autptr, make_message(\"foo\"));\n CAF_CHECK_EQUAL(t.schedule().size(), 1u);\n CAF_CHECK_EQUAL(t.actor_lookup().size(), 0u);\n \/\/ Advance time to send the message.\n t.advance_time(seconds(10));\n CAF_CHECK_EQUAL(t.schedule().size(), 0u);\n CAF_CHECK_EQUAL(t.actor_lookup().size(), 0u);\n \/\/ Have AUT receive the message.\n expect((std::string), from(aut).to(aut).with(\"foo\"));\n \/\/ Kill AUT (necessary because the group keeps a reference around).\n self->send_exit(aut, exit_reason::kill);\n expect((exit_msg), from(self).to(aut).with(_));\n}\n\nCAF_TEST_FIXTURE_SCOPE_END()\n<commit_msg>Fix actor clock unit test<commit_after>\/******************************************************************************\n * ____ _ _____ *\n * \/ ___| \/ \\ | ___| C++ *\n * | | \/ _ \\ | |_ Actor *\n * | |___ \/ ___ \\| _| Framework *\n * \\____\/_\/ \\_|_| *\n * *\n * Copyright 2011-2018 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\/config.hpp\"\n\n#define CAF_SUITE actor_clock\n#include \"caf\/test\/dsl.hpp\"\n\n#include <chrono>\n#include <memory>\n\n#include \"caf\/all.hpp\"\n#include \"caf\/detail\/test_actor_clock.hpp\"\n#include \"caf\/raw_event_based_actor.hpp\"\n\nusing namespace caf;\n\nnamespace {\n\nusing std::chrono::seconds;\n\nstruct testee_state {\n uint64_t timeout_id = 41;\n};\n\nbehavior testee(stateful_actor<testee_state, raw_event_based_actor>* self,\n detail::test_actor_clock* t) {\n return {\n [=](ok_atom) {\n auto n = t->now() + seconds(10);\n self->state.timeout_id += 1;\n t->set_ordinary_timeout(n, self, atom(\"\"), self->state.timeout_id);\n },\n [=](add_atom) {\n auto n = t->now() + seconds(10);\n self->state.timeout_id += 1;\n auto mid = make_message_id(self->state.timeout_id).response_id();\n t->set_request_timeout(n, self, mid);\n },\n [](const timeout_msg&) {\n \/\/ nop\n },\n [](const error&) {\n \/\/ nop\n },\n [](const std::string&) {\n \/\/ nop\n },\n [=](group& grp) {\n self->join(grp);\n },\n [=](exit_msg& x) {\n self->quit(x.reason);\n }\n };\n}\n\nstruct fixture : test_coordinator_fixture<> {\n detail::test_actor_clock t;\n actor aut;\n\n fixture() : aut(sys.spawn<lazy_init>(testee, &t)) {\n \/\/ nop\n }\n};\n\nstruct tid {\n uint32_t value;\n};\n\ninline bool operator==(const timeout_msg& x, const tid& y) {\n return x.timeout_id == y.value;\n}\n\n} \/\/ namespace <anonymous>\n\nCAF_TEST_FIXTURE_SCOPE(timer_tests, fixture)\n\nCAF_TEST(single_receive_timeout) {\n \/\/ Have AUT call t.set_receive_timeout().\n self->send(aut, ok_atom::value);\n expect((ok_atom), from(self).to(aut).with(_));\n CAF_CHECK_EQUAL(t.schedule().size(), 1u);\n CAF_CHECK_EQUAL(t.actor_lookup().size(), 1u);\n \/\/ Advance time to send timeout message.\n t.advance_time(seconds(10));\n CAF_CHECK_EQUAL(t.schedule().size(), 0u);\n CAF_CHECK_EQUAL(t.actor_lookup().size(), 0u);\n \/\/ Have AUT receive the timeout.\n expect((timeout_msg), from(aut).to(aut).with(tid{42}));\n}\n\nCAF_TEST(override_receive_timeout) {\n \/\/ Have AUT call t.set_receive_timeout().\n self->send(aut, ok_atom::value);\n expect((ok_atom), from(self).to(aut).with(_));\n CAF_CHECK_EQUAL(t.schedule().size(), 1u);\n CAF_CHECK_EQUAL(t.actor_lookup().size(), 1u);\n \/\/ Have AUT call t.set_timeout() again.\n self->send(aut, ok_atom::value);\n expect((ok_atom), from(self).to(aut).with(_));\n CAF_CHECK_EQUAL(t.schedule().size(), 1u);\n CAF_CHECK_EQUAL(t.actor_lookup().size(), 1u);\n \/\/ Advance time to send timeout message.\n t.advance_time(seconds(10));\n CAF_CHECK_EQUAL(t.schedule().size(), 0u);\n CAF_CHECK_EQUAL(t.actor_lookup().size(), 0u);\n \/\/ Have AUT receive the timeout.\n expect((timeout_msg), from(aut).to(aut).with(tid{43}));\n}\n\nCAF_TEST(single_request_timeout) {\n \/\/ Have AUT call t.set_request_timeout().\n self->send(aut, add_atom::value);\n expect((add_atom), from(self).to(aut).with(_));\n CAF_CHECK_EQUAL(t.schedule().size(), 1u);\n CAF_CHECK_EQUAL(t.actor_lookup().size(), 1u);\n \/\/ Advance time to send timeout message.\n t.advance_time(seconds(10));\n CAF_CHECK_EQUAL(t.schedule().size(), 0u);\n CAF_CHECK_EQUAL(t.actor_lookup().size(), 0u);\n \/\/ Have AUT receive the timeout.\n expect((error), from(aut).to(aut).with(sec::request_timeout));\n}\n\nCAF_TEST(mixed_receive_and_request_timeouts) {\n \/\/ Have AUT call t.set_receive_timeout().\n self->send(aut, ok_atom::value);\n expect((ok_atom), from(self).to(aut).with(_));\n CAF_CHECK_EQUAL(t.schedule().size(), 1u);\n CAF_CHECK_EQUAL(t.actor_lookup().size(), 1u);\n \/\/ Cause the request timeout to arrive later.\n t.advance_time(seconds(5));\n \/\/ Have AUT call t.set_request_timeout().\n self->send(aut, add_atom::value);\n expect((add_atom), from(self).to(aut).with(_));\n CAF_CHECK_EQUAL(t.schedule().size(), 2u);\n CAF_CHECK_EQUAL(t.actor_lookup().size(), 2u);\n \/\/ Advance time to send receive timeout message.\n t.advance_time(seconds(5));\n CAF_CHECK_EQUAL(t.schedule().size(), 1u);\n CAF_CHECK_EQUAL(t.actor_lookup().size(), 1u);\n \/\/ Have AUT receive the timeout.\n expect((timeout_msg), from(aut).to(aut).with(tid{42}));\n \/\/ Advance time to send request timeout message.\n t.advance_time(seconds(10));\n CAF_CHECK_EQUAL(t.schedule().size(), 0u);\n CAF_CHECK_EQUAL(t.actor_lookup().size(), 0u);\n \/\/ Have AUT receive the timeout.\n expect((error), from(aut).to(aut).with(sec::request_timeout));\n}\n\nCAF_TEST(delay_actor_message) {\n \/\/ Schedule a message for now + 10s.\n auto n = t.now() + seconds(10);\n auto autptr = actor_cast<strong_actor_ptr>(aut);\n t.schedule_message(n, autptr,\n make_mailbox_element(autptr, make_message_id(),\n no_stages, \"foo\"));\n CAF_CHECK_EQUAL(t.schedule().size(), 1u);\n CAF_CHECK_EQUAL(t.actor_lookup().size(), 0u);\n \/\/ Advance time to send the message.\n t.advance_time(seconds(10));\n CAF_CHECK_EQUAL(t.schedule().size(), 0u);\n CAF_CHECK_EQUAL(t.actor_lookup().size(), 0u);\n \/\/ Have AUT receive the message.\n expect((std::string), from(aut).to(aut).with(\"foo\"));\n}\n\nCAF_TEST(delay_group_message) {\n \/\/ Have AUT join the group.\n auto grp = sys.groups().anonymous();\n self->send(aut, grp);\n expect((group), from(self).to(aut).with(_));\n \/\/ Schedule a message for now + 10s.\n auto n = t.now() + seconds(10);\n auto autptr = actor_cast<strong_actor_ptr>(aut);\n t.schedule_message(n, std::move(grp), autptr, make_message(\"foo\"));\n CAF_CHECK_EQUAL(t.schedule().size(), 1u);\n CAF_CHECK_EQUAL(t.actor_lookup().size(), 0u);\n \/\/ Advance time to send the message.\n t.advance_time(seconds(10));\n CAF_CHECK_EQUAL(t.schedule().size(), 0u);\n CAF_CHECK_EQUAL(t.actor_lookup().size(), 0u);\n \/\/ Have AUT receive the message.\n expect((std::string), from(aut).to(aut).with(\"foo\"));\n \/\/ Kill AUT (necessary because the group keeps a reference around).\n self->send_exit(aut, exit_reason::kill);\n expect((exit_msg), from(self).to(aut).with(_));\n}\n\nCAF_TEST_FIXTURE_SCOPE_END()\n<|endoftext|>"} {"text":"<commit_before>#include <thread>\n#include <condition_variable>\n#include <mutex>\n#include <sstream>\n\n#include <lcm\/lcm-cpp.hpp>\n#include <ConciseArgs>\n\n#include <drc_utils\/LcmWrapper.hpp>\n#include <drc_utils\/BotWrapper.hpp>\n\n#include <bot_lcmgl_client\/lcmgl.h>\n\n#include <lcmtypes\/drc\/map_scans_t.hpp>\n#include <lcmtypes\/drc\/affordance_collection_t.hpp>\n\n#include <maps\/ScanBundleView.hpp>\n#include <maps\/LcmTranslator.hpp>\n\n#include <pcl\/common\/io.h>\n#include <pcl\/filters\/passthrough.h>\n\n#include \"BlockFitter.hpp\"\n\nstruct State {\n drc::BotWrapper::Ptr mBotWrapper;\n drc::LcmWrapper::Ptr mLcmWrapper;\n bool mRunContinuously;\n bool mDoFilter;\n bool mRemoveGround;\n bool mDebug;\n Eigen::Vector3f mBlockSize;\n int mAlgorithm; \/\/ TODO: use algo\n\n drc::map_scans_t mData;\n int64_t mLastDataTime;\n Eigen::Isometry3f mSensorPose;\n Eigen::Isometry3f mGroundPose;\n\n std::thread mWorkerThread;\n std::condition_variable mCondition;\n std::mutex mProcessMutex;\n std::mutex mDataMutex;\n\n State() {\n mRunContinuously = false;\n mDoFilter = true;\n mRemoveGround = true;\n mDebug = false;\n mAlgorithm = 0; \/\/ TODO\n mBlockSize << 0, 0, 0;\n }\n\n void start() {\n mLastDataTime = 0;\n mData.utime = 0;\n mLcmWrapper->get()->subscribe(\"MAP_SCANS\", &State::onScans, this);\n mWorkerThread = std::thread(std::ref(*this));\n mLcmWrapper->startHandleThread(true);\n }\n\n void stop() {\n mLcmWrapper->stopHandleThread();\n if (mWorkerThread.joinable()) mWorkerThread.join();\n }\n\n void operator()() {\n while (true) {\n \/\/ wait for data\n std::unique_lock<std::mutex> lock(mProcessMutex);\n mCondition.wait_for(lock, std::chrono::milliseconds(100));\n\n \/\/ grab data\n drc::map_scans_t data;\n Eigen::Isometry3f sensorPose;\n Eigen::Isometry3f groundPose;\n {\n std::unique_lock<std::mutex> dataLock(mDataMutex);\n if (mData.utime <= mLastDataTime) continue;\n data = mData;\n sensorPose = mSensorPose;\n groundPose = mGroundPose;\n mLastDataTime = mData.utime;\n }\n\n \/\/ convert scans to point cloud\n \/\/ TODO: could do this scan by scan and save away high deltas\n maps::ScanBundleView view;\n maps::LcmTranslator::fromLcm(data, view);\n auto rawCloud = view.getAsPointCloud();\n planeseg::LabeledCloud::Ptr cloud(new planeseg::LabeledCloud());\n pcl::copyPointCloud(*rawCloud, *cloud);\n\n \/\/ remove points outside bbox\n planeseg::LabeledCloud::Ptr tempCloud(new planeseg::LabeledCloud());\n pcl::PassThrough<pcl::PointXYZL> pass;\n pass.setInputCloud(cloud);\n pass.setFilterFieldName(\"y\");\n pass.setFilterLimits (-3.0, 3.0);\n pass.filter(*tempCloud);\n std::swap(cloud, tempCloud);\n\n \/\/ process\n planeseg::BlockFitter fitter;\n fitter.setSensorPose(sensorPose.translation(),\n sensorPose.rotation().col(2));\n fitter.setGroundBand(groundPose.translation()[2]-1.0,\n groundPose.translation()[2]+0.5);\n if (mDoFilter) fitter.setAreaThresholds(0.8, 1.2);\n else fitter.setAreaThresholds(0, 1000);\n if (mBlockSize.norm() > 1e-5) fitter.setBlockDimensions(mBlockSize);\n fitter.setRemoveGround(mRemoveGround);\n fitter.setDebug(mDebug);\n fitter.setCloud(cloud);\n auto result = fitter.go();\n if (!result.mSuccess) {\n std::cout << \"error: could not detect blocks\" << std::endl;\n continue;\n }\n\n \/\/ construct json string\n std::string json;\n json += \"{\\n\";\n json += \" \\\"command\\\": \\\"echo_response\\\",\\n\";\n json += \" \\\"descriptions\\\": {\\n\";\n std::string timeString = std::to_string(mBotWrapper->getCurrentTime());\n for (int i = 0; i < (int)result.mBlocks.size(); ++i) {\n const auto& block = result.mBlocks[i];\n std::string dimensionsString, positionString, quaternionString;\n {\n std::ostringstream oss;\n Eigen::Vector3f size = block.mSize;\n oss << size[0] << \", \" << size[1] << \", \" << size[2];\n dimensionsString = oss.str();\n }\n {\n std::ostringstream oss;\n Eigen::Vector3f p = block.mPose.translation();\n oss << p[0] << \", \" << p[1] << \", \" << p[2];\n positionString = oss.str();\n }\n {\n std::ostringstream oss;\n Eigen::Quaternionf q(block.mPose.rotation());\n oss << q.w() << \", \" << q.x() << \", \" << q.y() << \", \" << q.z();\n quaternionString = oss.str();\n }\n std::string uuid = timeString + \"_\" + std::to_string(i+1);\n \n json += \" \\\"\" + uuid + \"\\\": {\\n\";\n json += \" \\\"classname\\\": \\\"BoxAffordanceItem\\\",\\n\";\n json += \" \\\"pose\\\": [[\" + positionString + \"], [\" +\n quaternionString + \"]],\\n\";\n json += \" \\\"uuid\\\": \\\"\" + uuid + \"\\\",\\n\";\n json += \" \\\"Dimensions\\\": [\" + dimensionsString + \"],\\n\";\n json += \" \\\"Name\\\": \\\"cinderblock \" + std::to_string(i) + \"\\\"\\n\";\n if (i == (int)result.mBlocks.size()-1) json += \" }\\n\";\n else json += \" },\\n\";\n }\n json += \" },\\n\";\n json += \" \\\"commandId\\\": \\\"\" + timeString + \"\\\",\\n\";\n json += \" \\\"collectionId\\\": \\\"block-fitter\\\"\\n\";\n json += \"}\\n\";\n\n \/\/ publish result\n drc::affordance_collection_t msg;\n msg.utime = data.utime;\n msg.name = json;\n msg.naffs = 0;\n mLcmWrapper->get()->publish(\"AFFORDANCE_COLLECTION_COMMAND\", &msg);\n std::cout << \"Published affordance collection\" << std::endl;\n\n \/\/ publish lcmgl\n if (mDebug) {\n bot_lcmgl_t* lcmgl;\n lcmgl = bot_lcmgl_init(mLcmWrapper->get()->getUnderlyingLCM(),\n \"block-fitter\");\n for (const auto& block : result.mBlocks) {\n bot_lcmgl_color3f(lcmgl, 1, 0, 0);\n bot_lcmgl_line_width(lcmgl, 4);\n bot_lcmgl_begin(lcmgl, LCMGL_LINE_LOOP);\n for (const auto& pt : block.mHull) {\n bot_lcmgl_vertex3f(lcmgl, pt[0], pt[1], pt[2]);\n }\n bot_lcmgl_end(lcmgl);\n }\n bot_lcmgl_switch_buffer(lcmgl);\n bot_lcmgl_destroy(lcmgl);\n }\n\n if (!mRunContinuously) break;\n }\n mLcmWrapper->stopHandleThread();\n }\n\n\n void onScans(const lcm::ReceiveBuffer* iBuf,\n const std::string& iChannel,\n const drc::map_scans_t* iMessage) {\n std::unique_lock<std::mutex> lock(mDataMutex);\n mData = *iMessage;\n mBotWrapper->getTransform(\"head\", \"local\", mSensorPose, iMessage->utime);\n mBotWrapper->getTransform(\"ground\", \"local\", mGroundPose, iMessage->utime);\n mCondition.notify_one();\n }\n};\n\nint main(const int iArgc, const char** iArgv) {\n\n std::string sizeString(\"\");\n State state;\n\n ConciseArgs opt(iArgc, (char**)iArgv);\n opt.add(state.mRunContinuously, \"c\", \"continuous\", \"run continuously\");\n opt.add(state.mDoFilter, \"f\", \"filter\", \"filter blocks based on size\");\n opt.add(sizeString, \"s\", \"blocksize\", \"prior size for blocks \\\"x y z\\\"\");\n opt.add(state.mRemoveGround, \"g\", \"remove-ground\",\n \"whether to remove ground before processing\");\n opt.add(state.mAlgorithm, \"a\", \"algorithm\",\n \"0=min_area, 1=closest_size, 2=closest_hull\");\n opt.add(state.mDebug, \"d\", \"debug\", \"debug flag\");\n opt.parse();\n\n if (sizeString.length() > 0) {\n std::istringstream iss(sizeString);\n float x, y, z;\n if (iss >> x) {\n if (iss >> y) {\n if (iss >> z) {\n state.mBlockSize << x,y,z;\n std::cout << \"using block size \" << state.mBlockSize.transpose() <<\n std::endl;\n }\n }\n }\n }\n\n state.mBotWrapper.reset(new drc::BotWrapper());\n state.mLcmWrapper.reset(new drc::LcmWrapper(state.mBotWrapper->getLcm()));\n\n state.start();\n state.stop();\n\n return 1;\n}\n<commit_msg>make sure valid ground and head poses are available before processing; properly filter points in region around robot<commit_after>#include <thread>\n#include <condition_variable>\n#include <mutex>\n#include <sstream>\n\n#include <lcm\/lcm-cpp.hpp>\n#include <ConciseArgs>\n\n#include <drc_utils\/LcmWrapper.hpp>\n#include <drc_utils\/BotWrapper.hpp>\n\n#include <bot_lcmgl_client\/lcmgl.h>\n\n#include <lcmtypes\/drc\/map_scans_t.hpp>\n#include <lcmtypes\/drc\/affordance_collection_t.hpp>\n\n#include <maps\/ScanBundleView.hpp>\n#include <maps\/LcmTranslator.hpp>\n\n#include <pcl\/common\/io.h>\n#include <pcl\/filters\/passthrough.h>\n\n#include \"BlockFitter.hpp\"\n\nstruct State {\n drc::BotWrapper::Ptr mBotWrapper;\n drc::LcmWrapper::Ptr mLcmWrapper;\n bool mRunContinuously;\n bool mDoFilter;\n bool mRemoveGround;\n bool mDebug;\n Eigen::Vector3f mBlockSize;\n int mAlgorithm; \/\/ TODO: use algo\n\n drc::map_scans_t mData;\n int64_t mLastDataTime;\n Eigen::Isometry3f mSensorPose;\n Eigen::Isometry3f mGroundPose;\n\n std::thread mWorkerThread;\n std::condition_variable mCondition;\n std::mutex mProcessMutex;\n std::mutex mDataMutex;\n\n State() {\n mRunContinuously = false;\n mDoFilter = true;\n mRemoveGround = true;\n mDebug = false;\n mAlgorithm = 0; \/\/ TODO\n mBlockSize << 0, 0, 0;\n }\n\n void start() {\n mLastDataTime = 0;\n mData.utime = 0;\n mLcmWrapper->get()->subscribe(\"MAP_SCANS\", &State::onScans, this);\n mWorkerThread = std::thread(std::ref(*this));\n mLcmWrapper->startHandleThread(true);\n }\n\n void stop() {\n mLcmWrapper->stopHandleThread();\n if (mWorkerThread.joinable()) mWorkerThread.join();\n }\n\n void operator()() {\n while (true) {\n \/\/ wait for data\n std::unique_lock<std::mutex> lock(mProcessMutex);\n mCondition.wait_for(lock, std::chrono::milliseconds(100));\n\n \/\/ grab data\n drc::map_scans_t data;\n Eigen::Isometry3f sensorPose;\n Eigen::Isometry3f groundPose;\n {\n std::unique_lock<std::mutex> dataLock(mDataMutex);\n if (mData.utime <= mLastDataTime) continue;\n data = mData;\n sensorPose = mSensorPose;\n groundPose = mGroundPose;\n mLastDataTime = mData.utime;\n }\n\n \/\/ convert scans to point cloud\n \/\/ TODO: could do this scan by scan and save away high deltas\n maps::ScanBundleView view;\n maps::LcmTranslator::fromLcm(data, view);\n auto rawCloud = view.getAsPointCloud();\n planeseg::LabeledCloud::Ptr cloud(new planeseg::LabeledCloud());\n pcl::copyPointCloud(*rawCloud, *cloud);\n\n \/\/ remove points outside max radius\n const float kValidRadius = 5; \/\/ meters; TODO: could make this a param\n const float kValidRadius2 = kValidRadius*kValidRadius;\n planeseg::LabeledCloud::Ptr tempCloud(new planeseg::LabeledCloud());\n for (int i = 0; i < (int)cloud->size(); ++i) {\n Eigen::Vector3f p = cloud->points[i].getVector3fMap();\n float dist2 = (p-sensorPose.translation()).squaredNorm();\n if (dist2 > kValidRadius2) continue;\n tempCloud->push_back(cloud->points[i]);\n }\n std::swap(cloud, tempCloud);\n\n \/\/ process\n planeseg::BlockFitter fitter;\n fitter.setSensorPose(sensorPose.translation(),\n sensorPose.rotation().col(2));\n fitter.setGroundBand(groundPose.translation()[2]-1.0,\n groundPose.translation()[2]+0.5);\n if (mDoFilter) fitter.setAreaThresholds(0.8, 1.2);\n else fitter.setAreaThresholds(0, 1000);\n if (mBlockSize.norm() > 1e-5) fitter.setBlockDimensions(mBlockSize);\n fitter.setRemoveGround(mRemoveGround);\n fitter.setDebug(mDebug);\n fitter.setCloud(cloud);\n auto result = fitter.go();\n if (!result.mSuccess) {\n std::cout << \"error: could not detect blocks\" << std::endl;\n continue;\n }\n\n \/\/ construct json string\n std::string json;\n json += \"{\\n\";\n json += \" \\\"command\\\": \\\"echo_response\\\",\\n\";\n json += \" \\\"descriptions\\\": {\\n\";\n std::string timeString = std::to_string(mBotWrapper->getCurrentTime());\n for (int i = 0; i < (int)result.mBlocks.size(); ++i) {\n const auto& block = result.mBlocks[i];\n std::string dimensionsString, positionString, quaternionString;\n {\n std::ostringstream oss;\n Eigen::Vector3f size = block.mSize;\n oss << size[0] << \", \" << size[1] << \", \" << size[2];\n dimensionsString = oss.str();\n }\n {\n std::ostringstream oss;\n Eigen::Vector3f p = block.mPose.translation();\n oss << p[0] << \", \" << p[1] << \", \" << p[2];\n positionString = oss.str();\n }\n {\n std::ostringstream oss;\n Eigen::Quaternionf q(block.mPose.rotation());\n oss << q.w() << \", \" << q.x() << \", \" << q.y() << \", \" << q.z();\n quaternionString = oss.str();\n }\n std::string uuid = timeString + \"_\" + std::to_string(i+1);\n \n json += \" \\\"\" + uuid + \"\\\": {\\n\";\n json += \" \\\"classname\\\": \\\"BoxAffordanceItem\\\",\\n\";\n json += \" \\\"pose\\\": [[\" + positionString + \"], [\" +\n quaternionString + \"]],\\n\";\n json += \" \\\"uuid\\\": \\\"\" + uuid + \"\\\",\\n\";\n json += \" \\\"Dimensions\\\": [\" + dimensionsString + \"],\\n\";\n json += \" \\\"Name\\\": \\\"cinderblock \" + std::to_string(i) + \"\\\"\\n\";\n if (i == (int)result.mBlocks.size()-1) json += \" }\\n\";\n else json += \" },\\n\";\n }\n json += \" },\\n\";\n json += \" \\\"commandId\\\": \\\"\" + timeString + \"\\\",\\n\";\n json += \" \\\"collectionId\\\": \\\"block-fitter\\\"\\n\";\n json += \"}\\n\";\n\n \/\/ publish result\n drc::affordance_collection_t msg;\n msg.utime = data.utime;\n msg.name = json;\n msg.naffs = 0;\n mLcmWrapper->get()->publish(\"AFFORDANCE_COLLECTION_COMMAND\", &msg);\n std::cout << \"Published affordance collection\" << std::endl;\n\n \/\/ publish lcmgl\n if (mDebug) {\n bot_lcmgl_t* lcmgl;\n lcmgl = bot_lcmgl_init(mLcmWrapper->get()->getUnderlyingLCM(),\n \"block-fitter\");\n for (const auto& block : result.mBlocks) {\n bot_lcmgl_color3f(lcmgl, 1, 0, 0);\n bot_lcmgl_line_width(lcmgl, 4);\n bot_lcmgl_begin(lcmgl, LCMGL_LINE_LOOP);\n for (const auto& pt : block.mHull) {\n bot_lcmgl_vertex3f(lcmgl, pt[0], pt[1], pt[2]);\n }\n bot_lcmgl_end(lcmgl);\n }\n bot_lcmgl_switch_buffer(lcmgl);\n bot_lcmgl_destroy(lcmgl);\n }\n\n if (!mRunContinuously) break;\n }\n mLcmWrapper->stopHandleThread();\n }\n\n\n void onScans(const lcm::ReceiveBuffer* iBuf,\n const std::string& iChannel,\n const drc::map_scans_t* iMessage) {\n std::unique_lock<std::mutex> lock(mDataMutex);\n mData = *iMessage;\n int64_t scanTime = iMessage->utime;\n int64_t headPoseTime = mBotWrapper->getLatestTime(\"head\", \"local\");\n int64_t groundPoseTime = mBotWrapper->getLatestTime(\"ground\", \"local\");\n if ((std::abs(headPoseTime-scanTime) > 1e6) ||\n (std::abs(groundPoseTime-scanTime) > 1e6)) {\n std::cout << \"warning: got scans but no valid pose found\" << std::endl;\n return;\n }\n mBotWrapper->getTransform(\"head\", \"local\", mSensorPose, iMessage->utime);\n mBotWrapper->getTransform(\"ground\", \"local\", mGroundPose, iMessage->utime);\n mCondition.notify_one();\n }\n};\n\nint main(const int iArgc, const char** iArgv) {\n\n std::string sizeString(\"\");\n State state;\n\n ConciseArgs opt(iArgc, (char**)iArgv);\n opt.add(state.mRunContinuously, \"c\", \"continuous\", \"run continuously\");\n opt.add(state.mDoFilter, \"f\", \"filter\", \"filter blocks based on size\");\n opt.add(sizeString, \"s\", \"blocksize\", \"prior size for blocks \\\"x y z\\\"\");\n opt.add(state.mRemoveGround, \"g\", \"remove-ground\",\n \"whether to remove ground before processing\");\n opt.add(state.mAlgorithm, \"a\", \"algorithm\",\n \"0=min_area, 1=closest_size, 2=closest_hull\");\n opt.add(state.mDebug, \"d\", \"debug\", \"debug flag\");\n opt.parse();\n\n if (sizeString.length() > 0) {\n std::istringstream iss(sizeString);\n float x, y, z;\n if (iss >> x) {\n if (iss >> y) {\n if (iss >> z) {\n state.mBlockSize << x,y,z;\n std::cout << \"using block size \" << state.mBlockSize.transpose() <<\n std::endl;\n }\n }\n }\n }\n\n state.mBotWrapper.reset(new drc::BotWrapper());\n state.mLcmWrapper.reset(new drc::LcmWrapper(state.mBotWrapper->getLcm()));\n\n state.start();\n state.stop();\n\n return 1;\n}\n<|endoftext|>"} {"text":"<commit_before>#include <tiffio.h>\n#include <FAST\/Data\/ImagePyramid.hpp>\n#include <FAST\/Data\/Image.hpp>\n#include <FAST\/Algorithms\/ImagePatch\/PatchGenerator.hpp>\n#include <QFile>\n#include \"TIFFImagePyramidExporter.hpp\"\n\n\nnamespace fast {\n\nvoid fast::TIFFImagePyramidExporter::loadAttributes() {\n FileExporter::loadAttributes();\n}\n\nvoid TIFFImagePyramidExporter::execute() {\n if(m_filename.empty())\n throw Exception(\"Must set filename in TIFFImagePyramidExporter\");\n\n auto imagePyramid = getInputData<ImagePyramid>();\n\n if(imagePyramid->usesTIFF()) {\n \/\/ If image pyramid is using TIFF backend. It is already stored on disk, we just need to copy it..\n if(fileExists(m_filename)) {\n \/\/ If destination file already exists, we have to remove the existing file, or copy will not run.\n QFile::remove(m_filename.c_str());\n }\n QFile::copy(imagePyramid->getTIFFPath().c_str(), m_filename.c_str());\n return;\n }\n \/\/ If not, we need to do a patch based copy\n\n const Vector3f spacing = imagePyramid->getSpacing();\n\n ImageCompression compression = m_compression;\n if(!m_compressionSet || m_compression == ImageCompression::UNSPECIFIED) {\n \/\/ Default compression\n if(imagePyramid->getNrOfChannels() == 1) {\n compression = ImageCompression::LZW;\n } else if(imagePyramid->getNrOfChannels() == 3 || imagePyramid->getNrOfChannels() == 4) {\n compression = ImageCompression::JPEG;\n } else {\n throw Exception(\"Unexpected nr of channels in ImagePyramid: \" + std::to_string(imagePyramid->getNrOfChannels()));\n }\n }\n\n uint photometric = PHOTOMETRIC_RGB;\n uint bitsPerSample = 8;\n uint samplesPerPixel = 3; \/\/ RGBA image pyramid is converted to RGB with getPatchAsImage\n if(imagePyramid->getNrOfChannels() == 1) {\n photometric = PHOTOMETRIC_MINISBLACK; \/\/ Photometric mask causes crash..\n samplesPerPixel = 1;\n }\n\n auto tiff = TIFFOpen(m_filename.c_str(), \"w8\");\n if(tiff == nullptr) {\n throw Exception(\"Unable to open file \" + m_filename + \" in TIFFImagePyramidExporter\");\n }\n\n \/\/ For each level, we need to 1) write fields, 2) write tiles\n \/\/ We have to go from highest res level first\n for(int level = 0; level < imagePyramid->getNrOfLevels(); ++level) {\n reportInfo() << \"Writing level \" << level << reportEnd();\n\n \/\/ Write base tags\n TIFFSetField(tiff, TIFFTAG_PHOTOMETRIC, photometric);\n TIFFSetField(tiff, TIFFTAG_BITSPERSAMPLE, bitsPerSample);\n TIFFSetField(tiff, TIFFTAG_SAMPLEFORMAT, SAMPLEFORMAT_UINT);\n TIFFSetField(tiff, TIFFTAG_SAMPLESPERPIXEL, (uint16_t)samplesPerPixel);\n TIFFSetField(tiff, TIFFTAG_PLANARCONFIG, PLANARCONFIG_CONTIG);\n TIFFSetField(tiff, TIFFTAG_ORIENTATION, ORIENTATION_TOPLEFT);\n\n if(level > 0) {\n \/\/ All levels except highest res level should have this tag?\n TIFFSetField(tiff, TIFFTAG_SUBFILETYPE, FILETYPE_REDUCEDIMAGE);\n }\n switch(compression) {\n case ImageCompression::RAW:\n TIFFSetField(tiff, TIFFTAG_COMPRESSION, COMPRESSION_NONE);\n break;\n case ImageCompression::LZW:\n TIFFSetField(tiff, TIFFTAG_COMPRESSION, COMPRESSION_LZW);\n break;\n case ImageCompression::JPEG:\n TIFFSetField(tiff, TIFFTAG_COMPRESSION, COMPRESSION_JPEG);\n break;\n case ImageCompression::JPEG2000:\n \/\/ TODO NOT IMPLEMENTED\n throw NotImplementedException();\n TIFFSetField(tiff, TIFFTAG_COMPRESSION, COMPRESSION_JP2000);\n break;\n }\n\n TIFFSetField(tiff, TIFFTAG_TILEWIDTH, imagePyramid->getLevelTileWidth(level));\n TIFFSetField(tiff, TIFFTAG_TILELENGTH, imagePyramid->getLevelTileHeight(level));\n TIFFSetField(tiff, TIFFTAG_IMAGEWIDTH, imagePyramid->getLevelWidth(level));\n TIFFSetField(tiff, TIFFTAG_IMAGELENGTH, imagePyramid->getLevelHeight(level));\n if(spacing.x() != 1 && spacing.y() != 1) { \/\/ Spacing == 1 means not set.\n TIFFSetField(tiff, TIFFTAG_RESOLUTIONUNIT, RESUNIT_CENTIMETER);\n float scaleX = (float) imagePyramid->getFullWidth() \/ imagePyramid->getLevelWidth(level);\n float scaleY = (float) imagePyramid->getFullHeight() \/ imagePyramid->getLevelHeight(level);\n TIFFSetField(tiff, TIFFTAG_XRESOLUTION,\n 1.0f \/ (spacing.x() \/ 10) * scaleX); \/\/ Convert to cm, and adjust for level\n TIFFSetField(tiff, TIFFTAG_YRESOLUTION,\n 1.0f \/ (spacing.y() \/ 10) * scaleY); \/\/ Convert to cm, and adjust for level\n }\n\n auto generator = PatchGenerator::New();\n generator->setInputData(imagePyramid);\n generator->setPatchLevel(level);\n generator->setPatchSize(imagePyramid->getLevelTileWidth(level), imagePyramid->getLevelTileHeight(level));\n auto port = generator->getOutputPort();\n\n Image::pointer image;\n int counter = 0;\n do {\n generator->update();\n image = port->getNextFrame<Image>();\n\n \/\/ Write tile to tiff level\n if(image->getWidth() != imagePyramid->getLevelTileWidth(level) || image->getHeight() != imagePyramid->getLevelTileHeight(level)) {\n \/\/ Have to pad the image, TIFF expects all tiles to be equal\n \/\/ TODO improve\n auto paddedImage = Image::create(imagePyramid->getLevelTileWidth(level), imagePyramid->getLevelTileHeight(level), image->getDataType(), image->getNrOfChannels());\n if(imagePyramid->getNrOfChannels() >= 3) {\n paddedImage->fill(255);\n } else {\n paddedImage->fill(0);\n }\n auto device = std::dynamic_pointer_cast<OpenCLDevice>(getMainDevice());\n {\n auto dest = paddedImage->getOpenCLImageAccess(ACCESS_READ_WRITE, device);\n auto src = image->getOpenCLImageAccess(ACCESS_READ, device);\n device->getCommandQueue().enqueueCopyImage(*src->get2DImage(), *dest->get2DImage(),\n createOrigoRegion(), createOrigoRegion(),\n createRegion(image->getSize()));\n device->getCommandQueue().finish();\n }\n if(image->isLastFrame())\n paddedImage->setLastFrame(\"PatchGenerator\");\n image = paddedImage;\n }\n auto data = image->getImageAccess(ACCESS_READ)->get();\n std::size_t byteSize = getSizeOfDataType(image->getDataType(), image->getNrOfChannels())*image->getNrOfVoxels();\n mRuntimeManager->startRegularTimer(\"TIFF write\");\n TIFFWriteEncodedTile(tiff, counter, data, byteSize);\n mRuntimeManager->stopRegularTimer(\"TIFF write\");\n ++counter;\n mRuntimeManager->printAll();\n } while(!image->isLastFrame());\n\n TIFFWriteDirectory(tiff);\n }\n\n TIFFClose(tiff);\n}\n\nTIFFImagePyramidExporter::TIFFImagePyramidExporter() : TIFFImagePyramidExporter(\"\") {\n}\n\nTIFFImagePyramidExporter::TIFFImagePyramidExporter(std::string filename, ImageCompression compression) : FileExporter(filename) {\n createInputPort<ImagePyramid>(0);\n if(compression != ImageCompression::UNSPECIFIED)\n setCompression(compression);\n}\n\nvoid TIFFImagePyramidExporter::setCompression(ImageCompression compression) {\n m_compressionSet = true;\n m_compression = compression;\n}\n\n}<commit_msg>Enabled TIFFImagePyramidExporter to also accept regular images, and not just image pyramids<commit_after>#include <tiffio.h>\n#include <FAST\/Data\/ImagePyramid.hpp>\n#include <FAST\/Data\/Image.hpp>\n#include <FAST\/Algorithms\/ImagePatch\/PatchGenerator.hpp>\n#include <QFile>\n#include \"TIFFImagePyramidExporter.hpp\"\n\n\nnamespace fast {\n\nvoid fast::TIFFImagePyramidExporter::loadAttributes() {\n FileExporter::loadAttributes();\n}\n\nvoid TIFFImagePyramidExporter::execute() {\n if(m_filename.empty())\n throw Exception(\"Must set filename in TIFFImagePyramidExporter\");\n\n auto input = getInputData<DataObject>();\n auto imagePyramid = std::dynamic_pointer_cast<ImagePyramid>(input);\n if(imagePyramid == nullptr) {\n reportInfo() << \"Data given to TIFFImagePyramidExporter was an Image, not an ImagePyramid, converting ...\" << reportEnd();\n auto image = std::dynamic_pointer_cast<Image>(input);\n imagePyramid = ImagePyramid::create(image->getWidth(), image->getHeight(), image->getNrOfChannels(), 256, 256);\n imagePyramid->setSpacing(image->getSpacing());\n SceneGraph::setParentNode(imagePyramid, image);\n auto access = imagePyramid->getAccess(ACCESS_READ_WRITE);\n for(int y = 0; y < image->getHeight(); y += 256) {\n for(int x = 0; x < image->getWidth(); x += 256) {\n auto width = std::min(image->getWidth() - x - 1, 256);\n auto height = std::min(image->getHeight() - y - 1, 256);\n access->setPatch(0, x, y, image->crop(Vector2i(x, y), Vector2i(width, height)));\n }\n }\n }\n\n if(imagePyramid->usesTIFF()) {\n \/\/ If image pyramid is using TIFF backend. It is already stored on disk, we just need to copy it..\n if(fileExists(m_filename)) {\n \/\/ If destination file already exists, we have to remove the existing file, or copy will not run.\n QFile::remove(m_filename.c_str());\n }\n QFile::copy(imagePyramid->getTIFFPath().c_str(), m_filename.c_str());\n return;\n }\n \/\/ If not, we need to do a patch based copy\n\n const Vector3f spacing = imagePyramid->getSpacing();\n\n ImageCompression compression = m_compression;\n if(!m_compressionSet || m_compression == ImageCompression::UNSPECIFIED) {\n \/\/ Default compression\n if(imagePyramid->getNrOfChannels() == 1) {\n compression = ImageCompression::LZW;\n } else if(imagePyramid->getNrOfChannels() == 3 || imagePyramid->getNrOfChannels() == 4) {\n compression = ImageCompression::JPEG;\n } else {\n throw Exception(\"Unexpected nr of channels in ImagePyramid: \" + std::to_string(imagePyramid->getNrOfChannels()));\n }\n }\n\n uint photometric = PHOTOMETRIC_RGB;\n uint bitsPerSample = 8;\n uint samplesPerPixel = 3; \/\/ RGBA image pyramid is converted to RGB with getPatchAsImage\n if(imagePyramid->getNrOfChannels() == 1) {\n photometric = PHOTOMETRIC_MINISBLACK; \/\/ Photometric mask causes crash..\n samplesPerPixel = 1;\n }\n\n auto tiff = TIFFOpen(m_filename.c_str(), \"w8\");\n if(tiff == nullptr) {\n throw Exception(\"Unable to open file \" + m_filename + \" in TIFFImagePyramidExporter\");\n }\n\n \/\/ For each level, we need to 1) write fields, 2) write tiles\n \/\/ We have to go from highest res level first\n for(int level = 0; level < imagePyramid->getNrOfLevels(); ++level) {\n reportInfo() << \"Writing level \" << level << reportEnd();\n\n \/\/ Write base tags\n TIFFSetField(tiff, TIFFTAG_PHOTOMETRIC, photometric);\n TIFFSetField(tiff, TIFFTAG_BITSPERSAMPLE, bitsPerSample);\n TIFFSetField(tiff, TIFFTAG_SAMPLEFORMAT, SAMPLEFORMAT_UINT);\n TIFFSetField(tiff, TIFFTAG_SAMPLESPERPIXEL, (uint16_t)samplesPerPixel);\n TIFFSetField(tiff, TIFFTAG_PLANARCONFIG, PLANARCONFIG_CONTIG);\n TIFFSetField(tiff, TIFFTAG_ORIENTATION, ORIENTATION_TOPLEFT);\n\n if(level > 0) {\n \/\/ All levels except highest res level should have this tag?\n TIFFSetField(tiff, TIFFTAG_SUBFILETYPE, FILETYPE_REDUCEDIMAGE);\n }\n switch(compression) {\n case ImageCompression::RAW:\n TIFFSetField(tiff, TIFFTAG_COMPRESSION, COMPRESSION_NONE);\n break;\n case ImageCompression::LZW:\n TIFFSetField(tiff, TIFFTAG_COMPRESSION, COMPRESSION_LZW);\n break;\n case ImageCompression::JPEG:\n TIFFSetField(tiff, TIFFTAG_COMPRESSION, COMPRESSION_JPEG);\n break;\n case ImageCompression::JPEG2000:\n \/\/ TODO NOT IMPLEMENTED\n throw NotImplementedException();\n TIFFSetField(tiff, TIFFTAG_COMPRESSION, COMPRESSION_JP2000);\n break;\n }\n\n TIFFSetField(tiff, TIFFTAG_TILEWIDTH, imagePyramid->getLevelTileWidth(level));\n TIFFSetField(tiff, TIFFTAG_TILELENGTH, imagePyramid->getLevelTileHeight(level));\n TIFFSetField(tiff, TIFFTAG_IMAGEWIDTH, imagePyramid->getLevelWidth(level));\n TIFFSetField(tiff, TIFFTAG_IMAGELENGTH, imagePyramid->getLevelHeight(level));\n if(spacing.x() != 1 && spacing.y() != 1) { \/\/ Spacing == 1 means not set.\n TIFFSetField(tiff, TIFFTAG_RESOLUTIONUNIT, RESUNIT_CENTIMETER);\n float scaleX = (float) imagePyramid->getFullWidth() \/ imagePyramid->getLevelWidth(level);\n float scaleY = (float) imagePyramid->getFullHeight() \/ imagePyramid->getLevelHeight(level);\n TIFFSetField(tiff, TIFFTAG_XRESOLUTION,\n 1.0f \/ (spacing.x() \/ 10) * scaleX); \/\/ Convert to cm, and adjust for level\n TIFFSetField(tiff, TIFFTAG_YRESOLUTION,\n 1.0f \/ (spacing.y() \/ 10) * scaleY); \/\/ Convert to cm, and adjust for level\n }\n\n auto generator = PatchGenerator::New();\n generator->setInputData(imagePyramid);\n generator->setPatchLevel(level);\n generator->setPatchSize(imagePyramid->getLevelTileWidth(level), imagePyramid->getLevelTileHeight(level));\n auto port = generator->getOutputPort();\n\n Image::pointer image;\n int counter = 0;\n do {\n generator->update();\n image = port->getNextFrame<Image>();\n\n \/\/ Write tile to tiff level\n if(image->getWidth() != imagePyramid->getLevelTileWidth(level) || image->getHeight() != imagePyramid->getLevelTileHeight(level)) {\n \/\/ Have to pad the image, TIFF expects all tiles to be equal\n \/\/ TODO improve\n auto paddedImage = Image::create(imagePyramid->getLevelTileWidth(level), imagePyramid->getLevelTileHeight(level), image->getDataType(), image->getNrOfChannels());\n if(imagePyramid->getNrOfChannels() >= 3) {\n paddedImage->fill(255);\n } else {\n paddedImage->fill(0);\n }\n auto device = std::dynamic_pointer_cast<OpenCLDevice>(getMainDevice());\n {\n auto dest = paddedImage->getOpenCLImageAccess(ACCESS_READ_WRITE, device);\n auto src = image->getOpenCLImageAccess(ACCESS_READ, device);\n device->getCommandQueue().enqueueCopyImage(*src->get2DImage(), *dest->get2DImage(),\n createOrigoRegion(), createOrigoRegion(),\n createRegion(image->getSize()));\n device->getCommandQueue().finish();\n }\n if(image->isLastFrame())\n paddedImage->setLastFrame(\"PatchGenerator\");\n image = paddedImage;\n }\n auto data = image->getImageAccess(ACCESS_READ)->get();\n std::size_t byteSize = getSizeOfDataType(image->getDataType(), image->getNrOfChannels())*image->getNrOfVoxels();\n mRuntimeManager->startRegularTimer(\"TIFF write\");\n TIFFWriteEncodedTile(tiff, counter, data, byteSize);\n mRuntimeManager->stopRegularTimer(\"TIFF write\");\n ++counter;\n mRuntimeManager->printAll();\n } while(!image->isLastFrame());\n\n TIFFWriteDirectory(tiff);\n }\n\n TIFFClose(tiff);\n}\n\nTIFFImagePyramidExporter::TIFFImagePyramidExporter() : TIFFImagePyramidExporter(\"\") {\n}\n\nTIFFImagePyramidExporter::TIFFImagePyramidExporter(std::string filename, ImageCompression compression) : FileExporter(filename) {\n createInputPort<ImagePyramid>(0);\n if(compression != ImageCompression::UNSPECIFIED)\n setCompression(compression);\n}\n\nvoid TIFFImagePyramidExporter::setCompression(ImageCompression compression) {\n m_compressionSet = true;\n m_compression = compression;\n}\n\n}<|endoftext|>"} {"text":"<commit_before>\/*\n This file is part of libkcal.\n\n Copyright (c) 2004 Cornelius Schumacher <schumacher@kde.org>\n\n This library is free software; you can redistribute it and\/or\n modify it under the terms of the GNU Library General Public\n License as published by the Free Software Foundation; either\n version 2 of the License, or (at your option) any later version.\n\n This library is distributed in the hope that it will be useful,\n but WITHOUT ANY WARRANTY; without even the implied warranty of\n MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU\n Library General Public License for more details.\n\n You should have received a copy of the GNU Library General Public License\n along with this library; see the file COPYING.LIB. If not, write to\n the Free Software Foundation, Inc., 59 Temple Place - Suite 330,\n Boston, MA 02111-1307, USA.\n*\/\n\n#include <qbuttongroup.h>\n#include <qlayout.h>\n#include <qradiobutton.h>\n#include <qspinbox.h>\n#include <qhbox.h>\n#include <qlabel.h>\n\n#include <klocale.h>\n#include <kdebug.h>\n\n#include \"resourcecached.h\"\n\n#include \"resourcecachedconfig.h\"\n\nusing namespace KCal;\n\nResourceCachedReloadConfig::ResourceCachedReloadConfig( QWidget *parent,\n const char *name )\n : QWidget( parent, name )\n{\n QBoxLayout *topLayout = new QVBoxLayout( this );\n\n mGroup = new QButtonGroup( 1, Horizontal, i18n(\"Automatic Reload\"), this );\n topLayout->addWidget( mGroup );\n new QRadioButton( i18n(\"Never\"), mGroup );\n new QRadioButton( i18n(\"On startup\"), mGroup );\n\n QRadioButton *intervalRadio = new QRadioButton( i18n(\"Regular Interval\"),\n mGroup );\n connect( intervalRadio, SIGNAL( stateChanged( int ) ),\n SLOT( slotIntervalStateChanged( int ) ) );\n QHBox *intervalBox = new QHBox( mGroup );\n new QLabel( i18n(\"Interval in minutes\"), intervalBox );\n mIntervalSpin = new QSpinBox( intervalBox );\n mIntervalSpin->setEnabled( false );\n}\n\nvoid ResourceCachedReloadConfig::loadSettings( ResourceCached *resource )\n{\n mGroup->setButton( resource->reloadPolicy() );\n}\n\nvoid ResourceCachedReloadConfig::saveSettings( ResourceCached *resource )\n{\n resource->setReloadPolicy( mGroup->selectedId() );\n}\n\nvoid ResourceCachedReloadConfig::slotIntervalStateChanged( int state )\n{\n if ( state == QButton::On ) mIntervalSpin->setEnabled( true );\n else mIntervalSpin->setEnabled( false );\n}\n\n\nResourceCachedSaveConfig::ResourceCachedSaveConfig( QWidget *parent,\n const char *name )\n : QWidget( parent, name )\n{\n QBoxLayout *topLayout = new QVBoxLayout( this );\n\n mGroup = new QButtonGroup( 1, Horizontal, i18n(\"Automatic Save\"), this );\n topLayout->addWidget( mGroup );\n new QRadioButton( i18n(\"Never\"), mGroup );\n new QRadioButton( i18n(\"On exit\"), mGroup );\n\n QRadioButton *intervalRadio = new QRadioButton( i18n(\"Regular Interval\"),\n mGroup );\n connect( intervalRadio, SIGNAL( stateChanged( int ) ),\n SLOT( slotIntervalStateChanged( int ) ) );\n QHBox *intervalBox = new QHBox( mGroup );\n new QLabel( i18n(\"Interval in minutes\"), intervalBox );\n mIntervalSpin = new QSpinBox( intervalBox );\n mIntervalSpin->setEnabled( false );\n\n new QRadioButton( i18n(\"Delayed after changes\"), mGroup );\n new QRadioButton( i18n(\"On every change\"), mGroup );\n}\n\nvoid ResourceCachedSaveConfig::loadSettings( ResourceCached *resource )\n{\n mGroup->setButton( resource->savePolicy() );\n}\n\nvoid ResourceCachedSaveConfig::saveSettings( ResourceCached *resource )\n{\n resource->setSavePolicy( mGroup->selectedId() );\n}\n\nvoid ResourceCachedSaveConfig::slotIntervalStateChanged( int state )\n{\n if ( state == QButton::On ) mIntervalSpin->setEnabled( true );\n else mIntervalSpin->setEnabled( false );\n}\n\n#include \"resourcecachedconfig.moc\"\n<commit_msg>Load and save interval settings.<commit_after>\/*\n This file is part of libkcal.\n\n Copyright (c) 2004 Cornelius Schumacher <schumacher@kde.org>\n\n This library is free software; you can redistribute it and\/or\n modify it under the terms of the GNU Library General Public\n License as published by the Free Software Foundation; either\n version 2 of the License, or (at your option) any later version.\n\n This library is distributed in the hope that it will be useful,\n but WITHOUT ANY WARRANTY; without even the implied warranty of\n MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU\n Library General Public License for more details.\n\n You should have received a copy of the GNU Library General Public License\n along with this library; see the file COPYING.LIB. If not, write to\n the Free Software Foundation, Inc., 59 Temple Place - Suite 330,\n Boston, MA 02111-1307, USA.\n*\/\n\n#include <qbuttongroup.h>\n#include <qlayout.h>\n#include <qradiobutton.h>\n#include <qspinbox.h>\n#include <qhbox.h>\n#include <qlabel.h>\n\n#include <klocale.h>\n#include <kdebug.h>\n\n#include \"resourcecached.h\"\n\n#include \"resourcecachedconfig.h\"\n\nusing namespace KCal;\n\nResourceCachedReloadConfig::ResourceCachedReloadConfig( QWidget *parent,\n const char *name )\n : QWidget( parent, name )\n{\n QBoxLayout *topLayout = new QVBoxLayout( this );\n\n mGroup = new QButtonGroup( 1, Horizontal, i18n(\"Automatic Reload\"), this );\n topLayout->addWidget( mGroup );\n new QRadioButton( i18n(\"Never\"), mGroup );\n new QRadioButton( i18n(\"On startup\"), mGroup );\n\n QRadioButton *intervalRadio = new QRadioButton( i18n(\"Regular Interval\"),\n mGroup );\n connect( intervalRadio, SIGNAL( stateChanged( int ) ),\n SLOT( slotIntervalStateChanged( int ) ) );\n QHBox *intervalBox = new QHBox( mGroup );\n new QLabel( i18n(\"Interval in minutes\"), intervalBox );\n mIntervalSpin = new QSpinBox( intervalBox );\n mIntervalSpin->setEnabled( false );\n}\n\nvoid ResourceCachedReloadConfig::loadSettings( ResourceCached *resource )\n{\n mGroup->setButton( resource->reloadPolicy() );\n mIntervalSpin->setValue( resource->reloadInterval() );\n}\n\nvoid ResourceCachedReloadConfig::saveSettings( ResourceCached *resource )\n{\n resource->setReloadPolicy( mGroup->selectedId() );\n resource->setReloadInterval( mIntervalSpin->value() );\n}\n\nvoid ResourceCachedReloadConfig::slotIntervalStateChanged( int state )\n{\n if ( state == QButton::On ) mIntervalSpin->setEnabled( true );\n else mIntervalSpin->setEnabled( false );\n}\n\n\nResourceCachedSaveConfig::ResourceCachedSaveConfig( QWidget *parent,\n const char *name )\n : QWidget( parent, name )\n{\n QBoxLayout *topLayout = new QVBoxLayout( this );\n\n mGroup = new QButtonGroup( 1, Horizontal, i18n(\"Automatic Save\"), this );\n topLayout->addWidget( mGroup );\n new QRadioButton( i18n(\"Never\"), mGroup );\n new QRadioButton( i18n(\"On exit\"), mGroup );\n\n QRadioButton *intervalRadio = new QRadioButton( i18n(\"Regular Interval\"),\n mGroup );\n connect( intervalRadio, SIGNAL( stateChanged( int ) ),\n SLOT( slotIntervalStateChanged( int ) ) );\n QHBox *intervalBox = new QHBox( mGroup );\n new QLabel( i18n(\"Interval in minutes\"), intervalBox );\n mIntervalSpin = new QSpinBox( intervalBox );\n mIntervalSpin->setEnabled( false );\n\n new QRadioButton( i18n(\"Delayed after changes\"), mGroup );\n new QRadioButton( i18n(\"On every change\"), mGroup );\n}\n\nvoid ResourceCachedSaveConfig::loadSettings( ResourceCached *resource )\n{\n mGroup->setButton( resource->savePolicy() );\n mIntervalSpin->setValue( resource->saveInterval() );\n}\n\nvoid ResourceCachedSaveConfig::saveSettings( ResourceCached *resource )\n{\n resource->setSavePolicy( mGroup->selectedId() );\n resource->setSaveInterval( mIntervalSpin->value() );\n}\n\nvoid ResourceCachedSaveConfig::slotIntervalStateChanged( int state )\n{\n if ( state == QButton::On ) mIntervalSpin->setEnabled( true );\n else mIntervalSpin->setEnabled( false );\n}\n\n#include \"resourcecachedconfig.moc\"\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#include \"BluetoothServer.hxx\"\n#include <stdio.h>\n\n#ifdef LINUX\n#include <gio\/gio.h>\n#include <sys\/unistd.h>\n#include <sys\/socket.h>\n#endif\n#include <tools\/debug.hxx>\n#include <tools\/stream.hxx>\n\n#ifdef LINUX\n#include \"bluetooth\/bluetooth.h\"\n#include \"bluetooth\/rfcomm.h\"\n#endif\n\n\n#include \"Communicator.hxx\"\n\nusing namespace sd;\n\nBluetoothServer::BluetoothServer( std::vector<Communicator*>* pCommunicators ):\n Thread( \"BluetoothServer\" ),\n mpCommunicators( pCommunicators )\n{\n}\n\nBluetoothServer::~BluetoothServer()\n{\n}\n\nstruct oslSocketImpl {\n int m_Socket;\n int m_nLastError;\n void* m_CloseCallback;\n void* m_CallbackArg;\n oslInterlockedCount m_nRefCount;\n#if defined(LINUX)\n sal_Bool m_bIsAccepting;\n sal_Bool m_bIsInShutdown;\n#endif\n};\n\n\nvoid BluetoothServer::execute()\n{\n#ifdef LINUX\n g_type_init();\n GError* aError = NULL;\n GDBusConnection* aConnection = g_bus_get_sync( G_BUS_TYPE_SYSTEM, NULL, &aError );\n if ( aError )\n {\n g_error_free( aError );\n }\n\n GVariant *aAdapter = g_dbus_connection_call_sync( aConnection,\n \"org.bluez\", \"\/\", \"org.bluez.Manager\",\n \"DefaultAdapter\", NULL,\n G_VARIANT_TYPE_TUPLE,\n G_DBUS_CALL_FLAGS_NONE, -1, NULL, &aError);\n GVariant *aAdapterName = g_variant_get_child_value( aAdapter, 0 );\n if ( aError )\n {\n g_error_free( aError );\n }\n\/\/ fprintf( stderr, (const char*) g_variant_get_string( aAdapterName, NULL ) );\n\n\n\/\/ GDBusObjectManager* aManager = g_dbus_object_manager_client_new_sync( aConnection,\n\/\/ G_DBUS_OBJECT_MANAGER_CLIENT_FLAGS_NONE, \"org.bluez.Manager\", \"\/org\/bluez\",\n\/\/ NULL, NULL, NULL, NULL, &aError );\n\/\/ if ( aError )\n\/\/ {\n\/\/ fprintf( stderr, aError->message );\n\/\/ g_error_free( aError );\n\/\/ }\n\n GVariant *aRecordHandle = g_dbus_connection_call_sync( aConnection,\n \"org.bluez\", g_variant_get_string( aAdapterName, NULL ), \"org.bluez.Service\",\n \"AddRecord\",\n g_variant_new(\"(s)\",\n \"<?xml version='1.0' encoding= 'UTF-8' ?><record><attribute id='0x0001'><sequence><uuid value='0x1101' \/><\/sequence><\/attribute><attribute id='0x0004'><sequence><sequence><uuid value='0x0100' \/><\/sequence><sequence><uuid value='0x0003' \/><uint8 value='0x05' \/><\/sequence><\/sequence><\/attribute><attribute id='0x0005'><sequence><uuid value='0x1002' \/><\/sequence><\/attribute><attribute id='0x0006'><sequence><uint16 value='0x656e' \/><uint16 value='0x006a' \/><uint16 value='0x0100' \/><\/sequence><\/attribute><attribute id='0x0009'><sequence><sequence><uuid value='0x1101' \/><uint16 value='0x0100' \/><\/sequence><\/sequence><\/attribute><attribute id='0x0100'><text value='Serial Port' \/><\/attribute><attribute id='0x0101'><text value='COM Port' \/><\/attribute><\/record>\"),\n G_VARIANT_TYPE_TUPLE,\n G_DBUS_CALL_FLAGS_NONE, -1, NULL, &aError);\n if ( aError )\n {\n g_error_free( aError );\n }\n (void) aRecordHandle;\n \/\/ Remove handle again at some point\n\/\/ g_variant_unref( aRet );\n\/\/ fprintf( stderr, \"Manager gotten\\n\" );\n\/\/\n\/\/ \/\/ Name for default adapter\n\/\/ GVariant *aAdapter = g_dbus_connection_call_sync( aConnection,\n\/\/ \"org.bluez\", \"\/\", \"org.bluez.Manager\",\n\/\/ \"DefaultAdapter\", NULL,\n\/\/ G_VARIANT_TYPE_TUPLE,\n\/\/ G_DBUS_CALL_FLAGS_NONE, -1, NULL, &aError);\n\/\/ GVariant *aAdapterName = g_variant_get_child_value( aAdapter, 0 );\n\/\/ if ( aError )\n\/\/ {\n\/\/ fprintf( stderr, aError->message );\n\/\/ g_error_free( aError );\n\/\/ }\n\/\/ fprintf( stderr, (const char*) g_variant_get_string( aAdapterName, NULL ) );\n\n\n\n\n\/\/ g_type_init();\n\/\/ GError* aError = NULL;\n\/\/ GDBusConnection* aConnection = g_bus_get_sync( G_BUS_TYPE_SYSTEM, NULL, &aError );\n\/\/ fprintf( stderr, \"Connection gotten\\n\" );\n\/\/ if ( aError )\n\/\/ {\n\/\/ fprintf( stderr, aError->message );\n\/\/ g_error_free( aError );\n\/\/ }\n\/\/ \/\/ GDBusObjectManager* aManager = g_dbus_object_manager_client_new_sync( aConnection,\n\/\/ \/\/ G_DBUS_OBJECT_MANAGER_CLIENT_FLAGS_NONE, \"org.bluez.Manager\", \"\/org\/bluez\",\n\/\/ \/\/ NULL, NULL, NULL, NULL, &aError );\n\/\/ \/\/ if ( aError )\n\/\/ \/\/ {\n\/\/ \/\/ fprintf( stderr, aError->message );\n\/\/ \/\/ g_error_free( aError );\n\/\/ \/\/ }\n\/\/ fprintf( stderr, \"Manager gotten\\n\" );\n\/\/\n\/\/ \/\/ Name for default adapter\n\/\/ GVariant *aAdapter = g_dbus_connection_call_sync( aConnection,\n\/\/ \"org.bluez\", \"\/\", \"org.bluez.Manager\",\n\/\/ \"DefaultAdapter\", NULL,\n\/\/ G_VARIANT_TYPE_TUPLE,\n\/\/ G_DBUS_CALL_FLAGS_NONE, -1, NULL, &aError);\n\/\/ GVariant *aAdapterName = g_variant_get_child_value( aAdapter, 0 );\n\/\/ if ( aError )\n\/\/ {\n\/\/ fprintf( stderr, aError->message );\n\/\/ g_error_free( aError );\n\/\/ }\n\/\/ fprintf( stderr, (const char*) g_variant_get_string( aAdapterName, NULL ) );\n\n\n \/\/ ---------------- DEVICE ADDRESS\n int aSocket;\n if ( (aSocket = socket( AF_BLUETOOTH, SOCK_STREAM, BTPROTO_RFCOMM )) < 0 )\n {\n \/\/ Error\n return;\n }\n\n sockaddr_rc aAddr;\n aAddr.rc_family = AF_BLUETOOTH;\n aAddr.rc_bdaddr = {{0, 0, 0, 0, 0, 0}}; \/\/ BDADDR_ANY is broken\n aAddr.rc_channel = 5;\n\n if ( bind( aSocket, (sockaddr*) &aAddr, sizeof(aAddr)) < 0 ) {\n close( aSocket );\n return;\n }\n\n if ( listen( aSocket, 1 ) < 0 )\n {\n close( aSocket );\n return;\n }\n\n sockaddr_rc aRemoteAddr;\n socklen_t aRemoteAddrLen = sizeof(aRemoteAddr);\n int bSocket;\n if ( (bSocket = accept(aSocket, (sockaddr*) &aRemoteAddr, &aRemoteAddrLen)) < 0 )\n {\n close( aSocket );\n return;\n } else {\n\/\/ fprintf( stderr, \"Accepted Bluetooth\\n\" );\n\n Communicator* pCommunicator = new Communicator( new BufferedStreamSocket( bSocket) );\n mpCommunicators->push_back( pCommunicator );\n pCommunicator->launch();\n\n }\n\n#endif\n\n#ifdef WIN32\n\n#endif\n\n#ifdef MACOSX\n\n#endif\n}\n\n\nBluetoothServer *sd::BluetoothServer::spServer = NULL;\n\nvoid BluetoothServer::setup( std::vector<Communicator*>* pCommunicators )\n{\n if (spServer)\n return;\n\n spServer = new BluetoothServer( pCommunicators );\n spServer->launch();\n}\n\n\n\/* vim:set shiftwidth=4 softtabstop=4 expandtab: *\/<commit_msg>Remove extended initializer list -- use memset for BDADDR_ANY.<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#include \"BluetoothServer.hxx\"\n#include <stdio.h>\n\n#ifdef LINUX\n#include <gio\/gio.h>\n#include <sys\/unistd.h>\n#include <sys\/socket.h>\n#endif\n#include <tools\/debug.hxx>\n#include <tools\/stream.hxx>\n\n#ifdef LINUX\n#include \"bluetooth\/bluetooth.h\"\n#include \"bluetooth\/rfcomm.h\"\n#endif\n\n\n#include \"Communicator.hxx\"\n\nusing namespace sd;\n\nBluetoothServer::BluetoothServer( std::vector<Communicator*>* pCommunicators ):\n Thread( \"BluetoothServer\" ),\n mpCommunicators( pCommunicators )\n{\n}\n\nBluetoothServer::~BluetoothServer()\n{\n}\n\nstruct oslSocketImpl {\n int m_Socket;\n int m_nLastError;\n void* m_CloseCallback;\n void* m_CallbackArg;\n oslInterlockedCount m_nRefCount;\n#if defined(LINUX)\n sal_Bool m_bIsAccepting;\n sal_Bool m_bIsInShutdown;\n#endif\n};\n\n\nvoid BluetoothServer::execute()\n{\n#ifdef LINUX\n g_type_init();\n GError* aError = NULL;\n GDBusConnection* aConnection = g_bus_get_sync( G_BUS_TYPE_SYSTEM, NULL, &aError );\n if ( aError )\n {\n g_error_free( aError );\n }\n\n GVariant *aAdapter = g_dbus_connection_call_sync( aConnection,\n \"org.bluez\", \"\/\", \"org.bluez.Manager\",\n \"DefaultAdapter\", NULL,\n G_VARIANT_TYPE_TUPLE,\n G_DBUS_CALL_FLAGS_NONE, -1, NULL, &aError);\n GVariant *aAdapterName = g_variant_get_child_value( aAdapter, 0 );\n if ( aError )\n {\n g_error_free( aError );\n }\n\/\/ fprintf( stderr, (const char*) g_variant_get_string( aAdapterName, NULL ) );\n\n\n\/\/ GDBusObjectManager* aManager = g_dbus_object_manager_client_new_sync( aConnection,\n\/\/ G_DBUS_OBJECT_MANAGER_CLIENT_FLAGS_NONE, \"org.bluez.Manager\", \"\/org\/bluez\",\n\/\/ NULL, NULL, NULL, NULL, &aError );\n\/\/ if ( aError )\n\/\/ {\n\/\/ fprintf( stderr, aError->message );\n\/\/ g_error_free( aError );\n\/\/ }\n\n GVariant *aRecordHandle = g_dbus_connection_call_sync( aConnection,\n \"org.bluez\", g_variant_get_string( aAdapterName, NULL ), \"org.bluez.Service\",\n \"AddRecord\",\n g_variant_new(\"(s)\",\n \"<?xml version='1.0' encoding= 'UTF-8' ?><record><attribute id='0x0001'><sequence><uuid value='0x1101' \/><\/sequence><\/attribute><attribute id='0x0004'><sequence><sequence><uuid value='0x0100' \/><\/sequence><sequence><uuid value='0x0003' \/><uint8 value='0x05' \/><\/sequence><\/sequence><\/attribute><attribute id='0x0005'><sequence><uuid value='0x1002' \/><\/sequence><\/attribute><attribute id='0x0006'><sequence><uint16 value='0x656e' \/><uint16 value='0x006a' \/><uint16 value='0x0100' \/><\/sequence><\/attribute><attribute id='0x0009'><sequence><sequence><uuid value='0x1101' \/><uint16 value='0x0100' \/><\/sequence><\/sequence><\/attribute><attribute id='0x0100'><text value='Serial Port' \/><\/attribute><attribute id='0x0101'><text value='COM Port' \/><\/attribute><\/record>\"),\n G_VARIANT_TYPE_TUPLE,\n G_DBUS_CALL_FLAGS_NONE, -1, NULL, &aError);\n if ( aError )\n {\n g_error_free( aError );\n }\n (void) aRecordHandle;\n \/\/ Remove handle again at some point\n\/\/ g_variant_unref( aRet );\n\/\/ fprintf( stderr, \"Manager gotten\\n\" );\n\/\/\n\/\/ \/\/ Name for default adapter\n\/\/ GVariant *aAdapter = g_dbus_connection_call_sync( aConnection,\n\/\/ \"org.bluez\", \"\/\", \"org.bluez.Manager\",\n\/\/ \"DefaultAdapter\", NULL,\n\/\/ G_VARIANT_TYPE_TUPLE,\n\/\/ G_DBUS_CALL_FLAGS_NONE, -1, NULL, &aError);\n\/\/ GVariant *aAdapterName = g_variant_get_child_value( aAdapter, 0 );\n\/\/ if ( aError )\n\/\/ {\n\/\/ fprintf( stderr, aError->message );\n\/\/ g_error_free( aError );\n\/\/ }\n\/\/ fprintf( stderr, (const char*) g_variant_get_string( aAdapterName, NULL ) );\n\n\n\n\n\/\/ g_type_init();\n\/\/ GError* aError = NULL;\n\/\/ GDBusConnection* aConnection = g_bus_get_sync( G_BUS_TYPE_SYSTEM, NULL, &aError );\n\/\/ fprintf( stderr, \"Connection gotten\\n\" );\n\/\/ if ( aError )\n\/\/ {\n\/\/ fprintf( stderr, aError->message );\n\/\/ g_error_free( aError );\n\/\/ }\n\/\/ \/\/ GDBusObjectManager* aManager = g_dbus_object_manager_client_new_sync( aConnection,\n\/\/ \/\/ G_DBUS_OBJECT_MANAGER_CLIENT_FLAGS_NONE, \"org.bluez.Manager\", \"\/org\/bluez\",\n\/\/ \/\/ NULL, NULL, NULL, NULL, &aError );\n\/\/ \/\/ if ( aError )\n\/\/ \/\/ {\n\/\/ \/\/ fprintf( stderr, aError->message );\n\/\/ \/\/ g_error_free( aError );\n\/\/ \/\/ }\n\/\/ fprintf( stderr, \"Manager gotten\\n\" );\n\/\/\n\/\/ \/\/ Name for default adapter\n\/\/ GVariant *aAdapter = g_dbus_connection_call_sync( aConnection,\n\/\/ \"org.bluez\", \"\/\", \"org.bluez.Manager\",\n\/\/ \"DefaultAdapter\", NULL,\n\/\/ G_VARIANT_TYPE_TUPLE,\n\/\/ G_DBUS_CALL_FLAGS_NONE, -1, NULL, &aError);\n\/\/ GVariant *aAdapterName = g_variant_get_child_value( aAdapter, 0 );\n\/\/ if ( aError )\n\/\/ {\n\/\/ fprintf( stderr, aError->message );\n\/\/ g_error_free( aError );\n\/\/ }\n\/\/ fprintf( stderr, (const char*) g_variant_get_string( aAdapterName, NULL ) );\n\n\n \/\/ ---------------- DEVICE ADDRESS\n int aSocket;\n if ( (aSocket = socket( AF_BLUETOOTH, SOCK_STREAM, BTPROTO_RFCOMM )) < 0 )\n {\n \/\/ Error\n return;\n }\n\n sockaddr_rc aAddr;\n aAddr.rc_family = AF_BLUETOOTH;\n\/\/ aAddr.rc_bdaddr = {{0, 0, 0, 0, 0, 0}}; \/\/ BDADDR_ANY is broken\n memset( &aAddr.rc_bdaddr, 0, sizeof( aAddr.rc_bdaddr ) );\n aAddr.rc_channel = 5;\n\n if ( bind( aSocket, (sockaddr*) &aAddr, sizeof(aAddr)) < 0 ) {\n close( aSocket );\n return;\n }\n\n if ( listen( aSocket, 1 ) < 0 )\n {\n close( aSocket );\n return;\n }\n\n sockaddr_rc aRemoteAddr;\n socklen_t aRemoteAddrLen = sizeof(aRemoteAddr);\n int bSocket;\n if ( (bSocket = accept(aSocket, (sockaddr*) &aRemoteAddr, &aRemoteAddrLen)) < 0 )\n {\n close( aSocket );\n return;\n } else {\n\/\/ fprintf( stderr, \"Accepted Bluetooth\\n\" );\n\n Communicator* pCommunicator = new Communicator( new BufferedStreamSocket( bSocket) );\n mpCommunicators->push_back( pCommunicator );\n pCommunicator->launch();\n\n }\n\n#endif\n\n#ifdef WIN32\n\n#endif\n\n#ifdef MACOSX\n\n#endif\n}\n\n\nBluetoothServer *sd::BluetoothServer::spServer = NULL;\n\nvoid BluetoothServer::setup( std::vector<Communicator*>* pCommunicators )\n{\n if (spServer)\n return;\n\n spServer = new BluetoothServer( pCommunicators );\n spServer->launch();\n}\n\n\n\/* vim:set shiftwidth=4 softtabstop=4 expandtab: *\/<|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 _STGDIR_HXX\n#define _STGDIR_HXX\n\n#include \"stgavl.hxx\"\n#include \"stgelem.hxx\"\n#include \"stgstrms.hxx\"\n\nclass StgIo;\nclass StgEntry;\nclass StgDirEntry;\nclass StgDirStrm;\n\nclass BaseStorageStream;\nclass StgDirEntry : public StgAvlNode\n{\n friend class StgIterator;\n friend class StgDirStrm;\n StgEntry aSave; \/\/ original dir entry\n StgDirEntry* pUp; \/\/ parent directory\n StgDirEntry* pDown; \/\/ child directory for storages\n StgDirEntry** ppRoot; \/\/ root of TOC tree\n StgStrm* pStgStrm; \/\/ storage stream\n StgTmpStrm* pTmpStrm; \/\/ temporary stream\n StgTmpStrm* pCurStrm; \/\/ temp stream after commit\n sal_Int32 nEntry; \/\/ entry # in TOC stream (temp)\n sal_Int32 nPos; \/\/ current position\n sal_Bool bDirty; \/\/ dirty directory entry\n sal_Bool bCreated; \/\/ newly created entry\n sal_Bool bRemoved; \/\/ removed per Invalidate()\n sal_Bool bRenamed; \/\/ renamed\n void InitMembers(); \/\/ ctor helper\n virtual short Compare( const StgAvlNode* ) const;\n sal_Bool StoreStream( StgIo& ); \/\/ store the stream\n sal_Bool StoreStreams( StgIo& ); \/\/ store all streams\n void RevertAll(); \/\/ revert the whole tree\n sal_Bool Strm2Tmp(); \/\/ copy stgstream to temp file\n sal_Bool Tmp2Strm(); \/\/ copy temp file to stgstream\npublic:\n StgEntry aEntry; \/\/ entry data\n sal_Int32 nRefCnt; \/\/ reference count\n StreamMode nMode; \/\/ open mode\n sal_Bool bTemp; \/\/ sal_True: delete on dir flush\n sal_Bool bDirect; \/\/ sal_True: direct mode\n sal_Bool bZombie; \/\/ sal_True: Removed From StgIo\n sal_Bool bInvalid; \/\/ sal_True: invalid entry\n StgDirEntry( const void*, sal_Bool * pbOk );\n StgDirEntry( const StgEntry& );\n ~StgDirEntry();\n\n void Invalidate( sal_Bool=sal_False ); \/\/ invalidate all open entries\n void Enum( sal_Int32& ); \/\/ enumerate entries for iteration\n void DelTemp( sal_Bool ); \/\/ delete temporary entries\n sal_Bool Store( StgDirStrm& ); \/\/ save entry into dir strm\n sal_Bool IsContained( StgDirEntry* ); \/\/ check if subentry\n\n void SetDirty() { bDirty = sal_True; }\n sal_Bool IsDirty();\n void ClearDirty();\n\n sal_Bool Commit();\n sal_Bool Revert();\n\n void OpenStream( StgIo&, sal_Bool=sal_False ); \/\/ set up an approbiate stream\n void Close();\n sal_Int32 GetSize();\n sal_Bool SetSize( sal_Int32 );\n sal_Int32 Seek( sal_Int32 );\n sal_Int32 Tell() { return nPos; }\n sal_Int32 Read( void*, sal_Int32 );\n sal_Int32 Write( const void*, sal_Int32 );\n void Copy( BaseStorageStream& );\n};\n\nclass StgDirStrm : public StgDataStrm\n{\n friend class StgIterator;\n StgDirEntry* pRoot; \/\/ root of dir tree\n short nEntries; \/\/ entries per page\n void SetupEntry( sal_Int32, StgDirEntry* );\npublic:\n StgDirStrm( StgIo& );\n ~StgDirStrm();\n virtual sal_Bool SetSize( sal_Int32 ); \/\/ change the size\n sal_Bool Store();\n void* GetEntry( sal_Int32 n, sal_Bool=sal_False );\/\/ get an entry\n StgDirEntry* GetRoot() { return pRoot; }\n StgDirEntry* Find( StgDirEntry&, const String& );\n StgDirEntry* Create( StgDirEntry&, const String&, StgEntryType );\n sal_Bool Remove( StgDirEntry&, const String& );\n sal_Bool Rename( StgDirEntry&, const String&, const String& );\n sal_Bool Move( StgDirEntry&, StgDirEntry&, const String& );\n};\n\nclass StgIterator : public StgAvlIterator\n{\npublic:\n StgIterator( StgDirEntry& rStg ) : StgAvlIterator( rStg.pDown ) {}\n StgDirEntry* First() { return (StgDirEntry*) StgAvlIterator::First(); }\n StgDirEntry* Next() { return (StgDirEntry*) StgAvlIterator::Next(); }\n StgDirEntry* Last() { return (StgDirEntry*) StgAvlIterator::Last(); }\n StgDirEntry* Prev() { return (StgDirEntry*) StgAvlIterator::Prev(); }\n};\n\n#endif\n\n\/* vim:set shiftwidth=4 softtabstop=4 expandtab: *\/\n<commit_msg>unused inline<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 _STGDIR_HXX\n#define _STGDIR_HXX\n\n#include \"stgavl.hxx\"\n#include \"stgelem.hxx\"\n#include \"stgstrms.hxx\"\n\nclass StgIo;\nclass StgEntry;\nclass StgDirEntry;\nclass StgDirStrm;\n\nclass BaseStorageStream;\nclass StgDirEntry : public StgAvlNode\n{\n friend class StgIterator;\n friend class StgDirStrm;\n StgEntry aSave; \/\/ original dir entry\n StgDirEntry* pUp; \/\/ parent directory\n StgDirEntry* pDown; \/\/ child directory for storages\n StgDirEntry** ppRoot; \/\/ root of TOC tree\n StgStrm* pStgStrm; \/\/ storage stream\n StgTmpStrm* pTmpStrm; \/\/ temporary stream\n StgTmpStrm* pCurStrm; \/\/ temp stream after commit\n sal_Int32 nEntry; \/\/ entry # in TOC stream (temp)\n sal_Int32 nPos; \/\/ current position\n sal_Bool bDirty; \/\/ dirty directory entry\n sal_Bool bCreated; \/\/ newly created entry\n sal_Bool bRemoved; \/\/ removed per Invalidate()\n sal_Bool bRenamed; \/\/ renamed\n void InitMembers(); \/\/ ctor helper\n virtual short Compare( const StgAvlNode* ) const;\n sal_Bool StoreStream( StgIo& ); \/\/ store the stream\n sal_Bool StoreStreams( StgIo& ); \/\/ store all streams\n void RevertAll(); \/\/ revert the whole tree\n sal_Bool Strm2Tmp(); \/\/ copy stgstream to temp file\n sal_Bool Tmp2Strm(); \/\/ copy temp file to stgstream\npublic:\n StgEntry aEntry; \/\/ entry data\n sal_Int32 nRefCnt; \/\/ reference count\n StreamMode nMode; \/\/ open mode\n sal_Bool bTemp; \/\/ sal_True: delete on dir flush\n sal_Bool bDirect; \/\/ sal_True: direct mode\n sal_Bool bZombie; \/\/ sal_True: Removed From StgIo\n sal_Bool bInvalid; \/\/ sal_True: invalid entry\n StgDirEntry( const void*, sal_Bool * pbOk );\n StgDirEntry( const StgEntry& );\n ~StgDirEntry();\n\n void Invalidate( sal_Bool=sal_False ); \/\/ invalidate all open entries\n void Enum( sal_Int32& ); \/\/ enumerate entries for iteration\n void DelTemp( sal_Bool ); \/\/ delete temporary entries\n sal_Bool Store( StgDirStrm& ); \/\/ save entry into dir strm\n sal_Bool IsContained( StgDirEntry* ); \/\/ check if subentry\n\n void SetDirty() { bDirty = sal_True; }\n sal_Bool IsDirty();\n void ClearDirty();\n\n sal_Bool Commit();\n sal_Bool Revert();\n\n void OpenStream( StgIo&, sal_Bool=sal_False ); \/\/ set up an approbiate stream\n void Close();\n sal_Int32 GetSize();\n sal_Bool SetSize( sal_Int32 );\n sal_Int32 Seek( sal_Int32 );\n sal_Int32 Tell() { return nPos; }\n sal_Int32 Read( void*, sal_Int32 );\n sal_Int32 Write( const void*, sal_Int32 );\n void Copy( BaseStorageStream& );\n};\n\nclass StgDirStrm : public StgDataStrm\n{\n friend class StgIterator;\n StgDirEntry* pRoot; \/\/ root of dir tree\n short nEntries; \/\/ entries per page\n void SetupEntry( sal_Int32, StgDirEntry* );\npublic:\n StgDirStrm( StgIo& );\n ~StgDirStrm();\n virtual sal_Bool SetSize( sal_Int32 ); \/\/ change the size\n sal_Bool Store();\n void* GetEntry( sal_Int32 n, sal_Bool=sal_False );\/\/ get an entry\n StgDirEntry* GetRoot() { return pRoot; }\n StgDirEntry* Find( StgDirEntry&, const String& );\n StgDirEntry* Create( StgDirEntry&, const String&, StgEntryType );\n sal_Bool Remove( StgDirEntry&, const String& );\n sal_Bool Rename( StgDirEntry&, const String&, const String& );\n sal_Bool Move( StgDirEntry&, StgDirEntry&, const String& );\n};\n\nclass StgIterator : public StgAvlIterator\n{\npublic:\n StgIterator( StgDirEntry& rStg ) : StgAvlIterator( rStg.pDown ) {}\n StgDirEntry* First() { return (StgDirEntry*) StgAvlIterator::First(); }\n StgDirEntry* Next() { return (StgDirEntry*) StgAvlIterator::Next(); }\n StgDirEntry* Prev() { return (StgDirEntry*) StgAvlIterator::Prev(); }\n};\n\n#endif\n\n\/* vim:set shiftwidth=4 softtabstop=4 expandtab: *\/\n<|endoftext|>"} {"text":"<commit_before>#include <pybind11\/pybind11.h>\n#include <pybind11\/stl.h>\n#include <kms++.h>\n\nnamespace py = pybind11;\n\nusing namespace kms;\nusing namespace std;\n\nvoid init_pykmsbase(py::module &m)\n{\n\tpy::class_<Card>(m, \"Card\")\n\t\t\t.def(py::init<>())\n\t\t\t.def_property_readonly(\"fd\", &Card::fd)\n\t\t\t.def(\"get_first_connected_connector\", &Card::get_first_connected_connector)\n\t\t\t.def_property_readonly(\"connectors\", &Card::get_connectors)\n\t\t\t.def_property_readonly(\"crtcs\", &Card::get_crtcs)\n\t\t\t.def_property_readonly(\"encoders\", &Card::get_encoders)\n\t\t\t.def_property_readonly(\"planes\", &Card::get_planes)\n\t\t\t.def_property_readonly(\"has_atomic\", &Card::has_atomic)\n\t\t\t.def(\"call_page_flip_handlers\", &Card::call_page_flip_handlers)\n\t\t\t.def(\"get_prop\", (Property* (Card::*)(uint32_t) const)&Card::get_prop)\n\t\t\t.def(\"get_prop\", (Property* (Card::*)(const string&) const)&Card::get_prop)\n\t\t\t;\n\n\tpy::class_<DrmObject, DrmObject*>(m, \"DrmObject\")\n\t\t\t.def_property_readonly(\"id\", &DrmObject::id)\n\t\t\t.def_property_readonly(\"card\", &DrmObject::card)\n\t\t\t;\n\n\tpy::class_<DrmPropObject, DrmPropObject*>(m, \"DrmPropObject\", py::base<DrmObject>())\n\t\t\t.def(\"refresh_props\", &DrmPropObject::refresh_props)\n\t\t\t.def_property_readonly(\"prop_map\", &DrmPropObject::get_prop_map)\n\t\t\t.def(\"get_prop_value\", (uint64_t (DrmPropObject::*)(const string&) const)&DrmPropObject::get_prop_value)\n\t\t\t.def(\"set_prop_value\",(int (DrmPropObject::*)(const string&, uint64_t)) &DrmPropObject::set_prop_value)\n\t\t\t.def(\"get_prop_value_as_blob\", &DrmPropObject::get_prop_value_as_blob)\n\t\t\t;\n\n\tpy::class_<Connector, Connector*>(m, \"Connector\", py::base<DrmPropObject>())\n\t\t\t.def_property_readonly(\"fullname\", &Connector::fullname)\n\t\t\t.def(\"get_default_mode\", &Connector::get_default_mode)\n\t\t\t.def(\"get_current_crtc\", &Connector::get_current_crtc)\n\t\t\t.def(\"get_modes\", &Connector::get_modes)\n\t\t\t.def(\"__repr__\", [](const Connector& o) { return \"<pykms.Connector \" + to_string(o.id()) + \">\"; })\n\t\t\t;\n\n\tpy::class_<Crtc, Crtc*>(m, \"Crtc\", py::base<DrmPropObject>())\n\t\t\t.def(\"set_mode\", &Crtc::set_mode)\n\t\t\t.def(\"page_flip\", &Crtc::page_flip)\n\t\t\t.def(\"set_plane\", &Crtc::set_plane)\n\t\t\t.def_property_readonly(\"possible_planes\", &Crtc::get_possible_planes)\n\t\t\t.def_property_readonly(\"primary_plane\", &Crtc::get_primary_plane)\n\t\t\t.def(\"__repr__\", [](const Crtc& o) { return \"<pykms.Crtc \" + to_string(o.id()) + \">\"; })\n\t\t\t;\n\n\tpy::class_<Encoder, Encoder*>(m, \"Encoder\", py::base<DrmPropObject>())\n\t\t\t;\n\n\tpy::class_<Plane, Plane*>(m, \"Plane\", py::base<DrmPropObject>())\n\t\t\t.def(\"supports_crtc\", &Plane::supports_crtc)\n\t\t\t.def_property_readonly(\"plane_type\", &Plane::plane_type)\n\t\t\t.def(\"__repr__\", [](const Plane& o) { return \"<pykms.Plane \" + to_string(o.id()) + \">\"; })\n\t\t\t;\n\n\tpy::enum_<PlaneType>(m, \"PlaneType\")\n\t\t\t.value(\"Overlay\", PlaneType::Overlay)\n\t\t\t.value(\"Primary\", PlaneType::Primary)\n\t\t\t.value(\"Cursor\", PlaneType::Cursor)\n\t\t\t;\n\n\tpy::class_<Property, Property*>(m, \"Property\", py::base<DrmObject>())\n\t\t\t.def_property_readonly(\"name\", &Property::name)\n\t\t\t;\n\n\tpy::class_<Blob>(m, \"Blob\", py::base<DrmObject>())\n\t\t\t.def(\"__init__\", [](Blob& instance, Card& card, py::buffer buf) {\n\t\t\t\tpy::buffer_info info = buf.request();\n\t\t\t\tif (info.ndim != 1)\n\t\t\t\t\tthrow std::runtime_error(\"Incompatible buffer dimension!\");\n\n\t\t\t\tnew (&instance) Blob(card, info.ptr, info.size * info.itemsize);\n\t\t\t})\n\t\t\t.def_property_readonly(\"data\", &Blob::data)\n\t\t\t;\n\n\tpy::class_<Framebuffer>(m, \"Framebuffer\", py::base<DrmObject>())\n\t\t\t;\n\n\tpy::class_<DumbFramebuffer>(m, \"DumbFramebuffer\", py::base<Framebuffer>())\n\t\t\t.def(py::init<Card&, uint32_t, uint32_t, const string&>(),\n\t\t\t py::keep_alive<1, 2>())\t\/\/ Keep Card alive until this is destructed\n\t\t\t.def_property_readonly(\"width\", &DumbFramebuffer::width)\n\t\t\t.def_property_readonly(\"height\", &DumbFramebuffer::height)\n\t\t\t;\n\n\tpy::class_<Videomode>(m, \"Videomode\")\n\t\t\t.def(py::init<>())\n\n\t\t\t.def_readwrite(\"name\", &Videomode::name)\n\n\t\t\t.def_readwrite(\"clock\", &Videomode::clock)\n\n\t\t\t.def_readwrite(\"hdisplay\", &Videomode::hdisplay)\n\t\t\t.def_readwrite(\"hsync_start\", &Videomode::hsync_start)\n\t\t\t.def_readwrite(\"hsync_end\", &Videomode::hsync_end)\n\t\t\t.def_readwrite(\"htotal\", &Videomode::htotal)\n\n\t\t\t.def_readwrite(\"vdisplay\", &Videomode::vdisplay)\n\t\t\t.def_readwrite(\"vsync_start\", &Videomode::vsync_start)\n\t\t\t.def_readwrite(\"vsync_end\", &Videomode::vsync_end)\n\t\t\t.def_readwrite(\"vtotal\", &Videomode::vtotal)\n\n\t\t\t.def_readwrite(\"vrefresh\", &Videomode::vrefresh)\n\n\t\t\t.def_readwrite(\"flags\", &Videomode::flags)\n\t\t\t.def_readwrite(\"type\", &Videomode::type)\n\t\t\t;\n\n\tpy::class_<AtomicReq>(m, \"AtomicReq\")\n\t\t\t.def(py::init<Card&>(),\n\t\t\t py::keep_alive<1, 2>())\t\/\/ Keep Card alive until this is destructed\n\t\t\t.def(\"add\", (void (AtomicReq::*)(DrmObject*, const string&, uint64_t)) &AtomicReq::add)\n\t\t\t.def(\"test\", &AtomicReq::test)\n\t\t\t.def(\"commit\", &AtomicReq::commit)\n\t\t\t.def(\"commit_sync\", &AtomicReq::commit_sync)\n\t\t\t;\n}\n<commit_msg>py: fix AtomicReq bindings<commit_after>#include <pybind11\/pybind11.h>\n#include <pybind11\/stl.h>\n#include <kms++.h>\n\nnamespace py = pybind11;\n\nusing namespace kms;\nusing namespace std;\n\nvoid init_pykmsbase(py::module &m)\n{\n\tpy::class_<Card>(m, \"Card\")\n\t\t\t.def(py::init<>())\n\t\t\t.def_property_readonly(\"fd\", &Card::fd)\n\t\t\t.def(\"get_first_connected_connector\", &Card::get_first_connected_connector)\n\t\t\t.def_property_readonly(\"connectors\", &Card::get_connectors)\n\t\t\t.def_property_readonly(\"crtcs\", &Card::get_crtcs)\n\t\t\t.def_property_readonly(\"encoders\", &Card::get_encoders)\n\t\t\t.def_property_readonly(\"planes\", &Card::get_planes)\n\t\t\t.def_property_readonly(\"has_atomic\", &Card::has_atomic)\n\t\t\t.def(\"call_page_flip_handlers\", &Card::call_page_flip_handlers)\n\t\t\t.def(\"get_prop\", (Property* (Card::*)(uint32_t) const)&Card::get_prop)\n\t\t\t.def(\"get_prop\", (Property* (Card::*)(const string&) const)&Card::get_prop)\n\t\t\t;\n\n\tpy::class_<DrmObject, DrmObject*>(m, \"DrmObject\")\n\t\t\t.def_property_readonly(\"id\", &DrmObject::id)\n\t\t\t.def_property_readonly(\"card\", &DrmObject::card)\n\t\t\t;\n\n\tpy::class_<DrmPropObject, DrmPropObject*>(m, \"DrmPropObject\", py::base<DrmObject>())\n\t\t\t.def(\"refresh_props\", &DrmPropObject::refresh_props)\n\t\t\t.def_property_readonly(\"prop_map\", &DrmPropObject::get_prop_map)\n\t\t\t.def(\"get_prop_value\", (uint64_t (DrmPropObject::*)(const string&) const)&DrmPropObject::get_prop_value)\n\t\t\t.def(\"set_prop_value\",(int (DrmPropObject::*)(const string&, uint64_t)) &DrmPropObject::set_prop_value)\n\t\t\t.def(\"get_prop_value_as_blob\", &DrmPropObject::get_prop_value_as_blob)\n\t\t\t;\n\n\tpy::class_<Connector, Connector*>(m, \"Connector\", py::base<DrmPropObject>())\n\t\t\t.def_property_readonly(\"fullname\", &Connector::fullname)\n\t\t\t.def(\"get_default_mode\", &Connector::get_default_mode)\n\t\t\t.def(\"get_current_crtc\", &Connector::get_current_crtc)\n\t\t\t.def(\"get_modes\", &Connector::get_modes)\n\t\t\t.def(\"__repr__\", [](const Connector& o) { return \"<pykms.Connector \" + to_string(o.id()) + \">\"; })\n\t\t\t;\n\n\tpy::class_<Crtc, Crtc*>(m, \"Crtc\", py::base<DrmPropObject>())\n\t\t\t.def(\"set_mode\", &Crtc::set_mode)\n\t\t\t.def(\"page_flip\", &Crtc::page_flip)\n\t\t\t.def(\"set_plane\", &Crtc::set_plane)\n\t\t\t.def_property_readonly(\"possible_planes\", &Crtc::get_possible_planes)\n\t\t\t.def_property_readonly(\"primary_plane\", &Crtc::get_primary_plane)\n\t\t\t.def(\"__repr__\", [](const Crtc& o) { return \"<pykms.Crtc \" + to_string(o.id()) + \">\"; })\n\t\t\t;\n\n\tpy::class_<Encoder, Encoder*>(m, \"Encoder\", py::base<DrmPropObject>())\n\t\t\t;\n\n\tpy::class_<Plane, Plane*>(m, \"Plane\", py::base<DrmPropObject>())\n\t\t\t.def(\"supports_crtc\", &Plane::supports_crtc)\n\t\t\t.def_property_readonly(\"plane_type\", &Plane::plane_type)\n\t\t\t.def(\"__repr__\", [](const Plane& o) { return \"<pykms.Plane \" + to_string(o.id()) + \">\"; })\n\t\t\t;\n\n\tpy::enum_<PlaneType>(m, \"PlaneType\")\n\t\t\t.value(\"Overlay\", PlaneType::Overlay)\n\t\t\t.value(\"Primary\", PlaneType::Primary)\n\t\t\t.value(\"Cursor\", PlaneType::Cursor)\n\t\t\t;\n\n\tpy::class_<Property, Property*>(m, \"Property\", py::base<DrmObject>())\n\t\t\t.def_property_readonly(\"name\", &Property::name)\n\t\t\t;\n\n\tpy::class_<Blob>(m, \"Blob\", py::base<DrmObject>())\n\t\t\t.def(\"__init__\", [](Blob& instance, Card& card, py::buffer buf) {\n\t\t\t\tpy::buffer_info info = buf.request();\n\t\t\t\tif (info.ndim != 1)\n\t\t\t\t\tthrow std::runtime_error(\"Incompatible buffer dimension!\");\n\n\t\t\t\tnew (&instance) Blob(card, info.ptr, info.size * info.itemsize);\n\t\t\t})\n\t\t\t.def_property_readonly(\"data\", &Blob::data)\n\t\t\t;\n\n\tpy::class_<Framebuffer>(m, \"Framebuffer\", py::base<DrmObject>())\n\t\t\t;\n\n\tpy::class_<DumbFramebuffer>(m, \"DumbFramebuffer\", py::base<Framebuffer>())\n\t\t\t.def(py::init<Card&, uint32_t, uint32_t, const string&>(),\n\t\t\t py::keep_alive<1, 2>())\t\/\/ Keep Card alive until this is destructed\n\t\t\t.def_property_readonly(\"width\", &DumbFramebuffer::width)\n\t\t\t.def_property_readonly(\"height\", &DumbFramebuffer::height)\n\t\t\t;\n\n\tpy::class_<Videomode>(m, \"Videomode\")\n\t\t\t.def(py::init<>())\n\n\t\t\t.def_readwrite(\"name\", &Videomode::name)\n\n\t\t\t.def_readwrite(\"clock\", &Videomode::clock)\n\n\t\t\t.def_readwrite(\"hdisplay\", &Videomode::hdisplay)\n\t\t\t.def_readwrite(\"hsync_start\", &Videomode::hsync_start)\n\t\t\t.def_readwrite(\"hsync_end\", &Videomode::hsync_end)\n\t\t\t.def_readwrite(\"htotal\", &Videomode::htotal)\n\n\t\t\t.def_readwrite(\"vdisplay\", &Videomode::vdisplay)\n\t\t\t.def_readwrite(\"vsync_start\", &Videomode::vsync_start)\n\t\t\t.def_readwrite(\"vsync_end\", &Videomode::vsync_end)\n\t\t\t.def_readwrite(\"vtotal\", &Videomode::vtotal)\n\n\t\t\t.def_readwrite(\"vrefresh\", &Videomode::vrefresh)\n\n\t\t\t.def_readwrite(\"flags\", &Videomode::flags)\n\t\t\t.def_readwrite(\"type\", &Videomode::type)\n\t\t\t;\n\n\tpy::class_<AtomicReq>(m, \"AtomicReq\")\n\t\t\t.def(py::init<Card&>(),\n\t\t\t py::keep_alive<1, 2>())\t\/\/ Keep Card alive until this is destructed\n\t\t\t.def(\"add\", (void (AtomicReq::*)(DrmObject*, const string&, uint64_t)) &AtomicReq::add)\n\t\t\t.def(\"test\", &AtomicReq::test, py::arg(\"allow_modeset\") = false)\n\t\t\t.def(\"commit\", &AtomicReq::commit, py::arg(\"data\"), py::arg(\"allow_modeset\") = false)\n\t\t\t.def(\"commit_sync\", &AtomicReq::commit_sync, py::arg(\"allow_modeset\") = false)\n\t\t\t;\n}\n<|endoftext|>"} {"text":"<commit_before>\/****************************************************************************\n**\n** The MIT License (MIT)\n**\n** Copyright (c) 2016 The University of Sheffield (www.sheffield.ac.uk)\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 <core\/RandomDistributions.h>\n#include <core\/utils\/LinearInterpolator.h>\n#include <random>\n#include <complex>\n#include <math.h>\n#include <algorithm>\n\n\nusing CODeM::Utils::LinearInterpolator;\nusing namespace std;\n\nnamespace CODeM {\n\n\/\/\/ IDISTRIBUTION\nIDistribution::IDistribution()\n : m_lb(0.0),\n m_ub(1.0),\n m_dz(1.0),\n m_nSamples(0),\n m_quantileInterpolator(0),\n m_updated(false)\n{\n\n}\n\nIDistribution::~IDistribution()\n{\n if(m_quantileInterpolator != 0) {\n delete m_quantileInterpolator;\n }\n}\n\ndouble IDistribution::sample()\n{\n if(!m_updated) {\n computeDistribution();\n }\n\n \/\/ A value between 0-1: 0==>lb , 1==>ub\n double sample = m_quantileInterpolator->interpolate(randUni());\n return sample;\n}\n\nvector<double> IDistribution::zSamples()\n{\n if(!m_updated) {\n computeDistribution();\n }\n\n return m_z;\n}\n\nvector<double> IDistribution::pdf()\n{\n if(!m_updated) {\n computeDistribution();\n }\n\n return m_pdf;\n}\n\nvector<double> IDistribution::cdf()\n{\n if(!m_updated) {\n computeDistribution();\n }\n\n return m_cdf;\n}\n\nvoid IDistribution::defineResolution(double dz)\n{\n if(dz > 0) {\n \/\/ make sure the range is a multiple of m_dz, and m_dz <= dz\n m_dz = (m_ub-m_lb) \/ ceil((m_ub-m_lb)\/dz);\n }\n\n m_updated = false;\n}\n\ndouble IDistribution::resolution() const\n{\n return m_dz;\n}\n\nvoid IDistribution::defineBoundaries(double lb, double ub)\n{\n if(lb >= ub) {\n if(lb == 0) {\n ub = DistMinInterval;\n } else if(lb > 0) {\n ub = lb * (1 + DistMinInterval);\n } else {\n lb = ub * (1 + DistMinInterval);\n }\n }\n\n double oldRange = m_ub - m_lb;\n double newRange = ub - lb;\n double ratio = newRange \/ oldRange;\n\n m_lb = lb;\n m_ub = ub;\n\n defineResolution(m_dz * ratio);\n\n m_updated = false;\n}\n\ndouble IDistribution::lowerBound() const\n{\n return m_lb;\n}\n\ndouble IDistribution::upperBound() const\n{\n return m_ub;\n}\n\nvoid IDistribution::computeDistribution()\n{\n m_z.clear();\n m_pdf.clear();\n m_cdf.clear();\n\n generateZ();\n generatePDF();\n calculateCDF();\n\n if(m_quantileInterpolator == 0) {\n m_quantileInterpolator = new LinearInterpolator(m_cdf, m_z);\n } else {\n m_quantileInterpolator->defineXY(m_cdf, m_z);\n }\n\n m_updated = true;\n}\n\nvoid IDistribution::calculateCDF()\n{\n m_cdf.assign(m_nSamples, 0.0);\n double cur = 0.0;\n double next = 0.0;\n for(int i=0; i<m_nSamples-1; i++) {\n cur = m_pdf[i];\n next = m_pdf[i+1];\n m_cdf[i+1] = m_cdf[i] + (cur+next)\/2.0 * (m_z[i+1] - m_z[i]);\n }\n\n \/\/ normalise\n double factor = *(m_cdf.end());\n if(factor == 1.0) {\n return;\n } else if(factor == 0.0) {\n double probability = 1.0\/(m_ub - m_lb);\n m_pdf.assign(m_nSamples, probability);\n calculateCDF();\n } else {\n\/\/ for(int i=0; i<m_cdf.size(); i++) {\n\/\/ m_pdf[i] \/= factor;\n\/\/ m_cdf[i] \/= factor;\n\/\/ }\n \/\/ Try this instead. TODO: remove the comment if it works\n transform(m_pdf.begin(), m_pdf.end(), m_pdf.begin(),\n [factor](double p){return p\/factor;});\n transform(m_cdf.begin(), m_cdf.end(), m_cdf.begin(),\n [factor](double p){return p\/factor;});\n }\n}\n\nvoid IDistribution::generateEquallySpacedZ()\n{\n m_nSamples = (int)((m_ub - m_lb) \/ m_dz) + 1;\n m_z.resize(m_nSamples);\n double zz = m_lb;\n for(int i = 0; i < m_z.size() - 1; i++) {\n m_z[i] = zz;\n zz += m_dz;\n }\n m_z[m_z.size() - 1] = m_ub;\n}\n\n\/\/\/ UNIFORM DISTRIBUTION\nUniformDistribution::UniformDistribution()\n{\n\n}\n\nUniformDistribution::UniformDistribution(double lb, double ub)\n{\n defineBoundaries(lb, ub);\n defineResolution(m_ub - m_lb);\n}\n\nUniformDistribution::~UniformDistribution()\n{\n\n}\n\ndouble UniformDistribution::sample()\n{\n return m_lb + randUni() * (m_ub - m_lb);\n}\n\nvoid UniformDistribution::generateZ()\n{\n generateEquallySpacedZ();\n}\n\nvoid UniformDistribution::generatePDF()\n{\n double probability = 1.0\/(m_ub - m_lb);\n m_pdf.assign(m_nSamples, probability);\n}\n\n\/\/\/ LINEAR DISTRIBUTION\nLinearDistribution::LinearDistribution()\n : m_ascend(true)\n{\n defineResolution((m_ub-m_lb) \/ 2.0);\n}\n\nLinearDistribution::LinearDistribution(double lb, double ub, bool ascend)\n : m_ascend(ascend)\n{\n defineBoundaries(lb, ub);\n defineResolution((m_ub-m_lb) \/ 2.0);\n}\n\nLinearDistribution::~LinearDistribution()\n{\n\n}\n\ndouble LinearDistribution::sample()\n{\n double r = randUni();\n double samp;\n if(m_ascend) {\n samp = m_lb + sqrt(r) * (m_ub - m_lb);\n } else {\n samp = m_ub - sqrt(1 - r) * (m_ub - m_lb);\n }\n return samp;\n}\n\nvoid LinearDistribution::generateZ()\n{\n generateEquallySpacedZ();\n}\n\nvoid LinearDistribution::generatePDF()\n{\n if(m_z.empty()) {\n generateZ();\n }\n\n double maxProbability = 2\/(m_ub - m_lb);\n m_pdf = vector<double>(m_nSamples);\n if(isAscend()) {\n for(int i=0; i<m_nSamples; i++) {\n m_pdf[i] = maxProbability * (m_z[i] - m_lb) \/ (m_ub - m_lb);\n }\n } else {\n for(int i=0; i<m_nSamples; i++) {\n m_pdf[i] = maxProbability * (m_ub - m_z[i]) \/ (m_ub - m_lb);\n }\n }\n}\n\nbool LinearDistribution::isAscend() const\n{\n return m_ascend;\n}\n\nvoid LinearDistribution::defineAscend(bool a)\n{\n if(m_ascend != a) {\n m_updated = false;\n }\n m_ascend = a;\n}\n\n\/\/\/ PEAK DISTRIBUTION\nPeakDistribution::PeakDistribution()\n : m_tendency(0.5),\n m_locality(1.0)\n{\n defineResolution(1.0 \/ (DistNSamples - 1));\n}\n\nPeakDistribution::PeakDistribution(double tendency, double locality)\n{\n defineTendencyAndLocality(tendency, locality);\n}\n\nPeakDistribution::~PeakDistribution()\n{\n\n}\n\nvoid PeakDistribution::defineTendencyAndLocality(double tendency, double locality)\n{\n if(tendency < 0.0) {\n tendency = 0.0;\n } else if(tendency > 1.0) {\n tendency = 1.0;\n }\n m_tendency = tendency;\n\n if(locality < 0.0) {\n locality = 0.0;\n } else if(locality > 1.0) {\n locality = 1.0;\n }\n\n m_locality = locality;\n\n defineResolution(1.0\/(m_locality+0.1)\/(DistNSamples-1));\n}\n\ndouble PeakDistribution::tendency() const\n{\n return m_tendency;\n}\n\ndouble PeakDistribution::locality() const\n{\n return m_locality;\n}\n\nvoid PeakDistribution::generateZ()\n{\n generateEquallySpacedZ();\n}\n\nvoid PeakDistribution::generatePDF()\n{\n m_pdf.resize(m_nSamples);\n\n double shift = PI * m_tendency;\n double N = DistPeakMinN + m_locality\n * (DistPeakMaxN - DistPeakMinN);\n vector<complex<double> > psiN(m_nSamples, complex<double>(0, 0));\n\n double nMax = max(3*N, DistPeakMinNBasisFunc);\n nMax = min(nMax, DistPeakMaxNBasisFunc);\n for(int n = 1; n <= nMax; n++) {\n double cNn = sqrt( (pow(N, n) * exp(-N) \/ factorial(n)));\n vector<double> psi = eigenFunction(n);\n for(int i=0; i<m_nSamples; i++) {\n complex<double> j(0.0, 1.0);\n psiN[i] += cNn * exp(-j * shift * (n + 0.5)) * psi[i];\n }\n }\n for(int i=0; i<m_nSamples; i++) {\n m_pdf[i] = real(conj(psiN[i]) * psiN[i]);\n }\n}\n\nvector<double> PeakDistribution::eigenFunction(int n)\n{\n double Lz = m_ub - m_lb;\n double An = sqrt(2.0 \/ Lz);\n\n vector<double> psi(m_nSamples, 0.0);\n for(int i=1; i<m_nSamples-1; i++) {\n psi[i] = An * sin(PI * n * (m_z[i] - m_lb) \/ Lz);\n }\n return psi;\n}\n\n\n\/\/\/ MERGED DISTRIBUTION\nMergedDistribution::MergedDistribution()\n{\n\n}\n\nMergedDistribution::~MergedDistribution()\n{\n for(int i = 0; i < m_distributions.size(); i++) {\n delete m_distributions[i];\n }\n}\n\nvoid MergedDistribution::generateZ()\n{\n int nDistributions = (int)m_distributions.size();\n\n if(nDistributions == 0) {\n return;\n }\n\n for(int i=0; i<nDistributions; i++) {\n addZSamplesOfOneDistribution(m_distributions[i]);\n }\n}\n\nvoid MergedDistribution::addZSamplesOfOneDistribution(IDistribution* d)\n{\n vector<double> newZ = d->zSamples();\n if(newZ.empty()) {\n return;\n }\n vector<double>::iterator iNew = newZ.begin();\n vector<double>::iterator iExist = m_z.begin();\n \/\/ merge newZ and m_z into augZ\n vector<double> augZ;\n\n\/\/ int iNew = 0; \/\/ iterator for newZ\n\/\/ int iAug = 0; \/\/ iterator for m_z\n\n while((iNew != newZ.end()) && (iExist != m_z.end())) {\n if(*iNew == *iExist) {\n augZ.push_back(*iExist++);\n iNew++;\n }\n else if(*iNew < *iExist) {\n augZ.push_back(*iNew++);\n }\n else {\n augZ.push_back(*iExist++);\n }\n }\n\n while(iNew != newZ.end()) {\n augZ.push_back(*iNew++);\n }\n\n while(iExist != m_z.end()) {\n augZ.push_back(*iExist++);\n }\n\n m_z.swap(augZ);\n m_lb = m_z.front();\n m_ub = m_z.back();\n m_nSamples = (int)m_z.size();\n augZ.clear();\n}\n\nvoid MergedDistribution::generatePDF()\n{\n size_t nDistributions = m_distributions.size();\n\n if(nDistributions == 0) {\n return;\n }\n\n m_pdf.resize(m_nSamples);\n\n for(int i=0; i<nDistributions; i++) {\n addOnePDF(m_distributions[i], m_ratios[i]);\n }\n}\n\nvoid MergedDistribution::addOnePDF(IDistribution* d, double ratio)\n{\n \/\/ call this function only after the samples are integrated into m_z\n vector<double> newPDF = d->pdf();\n if(newPDF.empty()) {\n return;\n }\n vector<double> newZ = d->zSamples();\n\n \/\/ find the range of the new pdf\n vector<double>::iterator first = m_z.begin();\n vector<double>::iterator last = m_z.end();\n vector<double>::iterator pdfIter = m_pdf.begin();\n\n while(newZ.front() > *first) {\n ++first;\n ++pdfIter;\n }\n while(newZ.back() < *last) {\n --last;\n }\n\n \/\/Interpolate the new pdf over the new samples in its range\n LinearInterpolator pdfInterpolator(newZ, newPDF);\n vector<double> tmp = pdfInterpolator.interpolateV(vector<double>(first, last));\n newPDF.swap(tmp);\n\n \/\/ add the new pdf times its weight to the existing pdf\n vector<double>::iterator newIter;\n for(newIter = newPDF.begin(); newIter == newPDF.end(); ++newIter, ++pdfIter) {\n *pdfIter += (*newIter * ratio);\n }\n}\n\nvoid MergedDistribution::appendDistribution(IDistribution* d)\n{\n appendDistribution(d, 1.0);\n}\n\nvoid MergedDistribution::appendDistribution(IDistribution* d, double ratio)\n{\n m_distributions.push_back(d);\n m_ratios.push_back(max(ratio, 0.0));\n computeDistribution();\n}\n\n} \/\/ namespace CODeM\n<commit_msg>bug fix<commit_after>\/****************************************************************************\n**\n** The MIT License (MIT)\n**\n** Copyright (c) 2016 The University of Sheffield (www.sheffield.ac.uk)\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 <core\/RandomDistributions.h>\n#include <core\/utils\/LinearInterpolator.h>\n#include <random>\n#include <complex>\n#include <math.h>\n#include <algorithm>\n\n\nusing CODeM::Utils::LinearInterpolator;\nusing namespace std;\n\nnamespace CODeM {\n\n\/\/\/ IDISTRIBUTION\nIDistribution::IDistribution()\n : m_lb(0.0),\n m_ub(1.0),\n m_dz(1.0),\n m_nSamples(0),\n m_quantileInterpolator(0),\n m_updated(false)\n{\n\n}\n\nIDistribution::~IDistribution()\n{\n if(m_quantileInterpolator != 0) {\n delete m_quantileInterpolator;\n }\n}\n\ndouble IDistribution::sample()\n{\n if(!m_updated) {\n computeDistribution();\n }\n\n \/\/ A value between 0-1: 0==>lb , 1==>ub\n double sample = m_quantileInterpolator->interpolate(randUni());\n return sample;\n}\n\nvector<double> IDistribution::zSamples()\n{\n if(!m_updated) {\n computeDistribution();\n }\n\n return m_z;\n}\n\nvector<double> IDistribution::pdf()\n{\n if(!m_updated) {\n computeDistribution();\n }\n\n return m_pdf;\n}\n\nvector<double> IDistribution::cdf()\n{\n if(!m_updated) {\n computeDistribution();\n }\n\n return m_cdf;\n}\n\nvoid IDistribution::defineResolution(double dz)\n{\n if(dz > 0) {\n \/\/ make sure the range is a multiple of m_dz, and m_dz <= dz\n m_dz = (m_ub-m_lb) \/ ceil((m_ub-m_lb)\/dz);\n }\n\n m_updated = false;\n}\n\ndouble IDistribution::resolution() const\n{\n return m_dz;\n}\n\nvoid IDistribution::defineBoundaries(double lb, double ub)\n{\n if(lb >= ub) {\n if(lb == 0) {\n ub = DistMinInterval;\n } else if(lb > 0) {\n ub = lb * (1 + DistMinInterval);\n } else {\n lb = ub * (1 + DistMinInterval);\n }\n }\n\n double oldRange = m_ub - m_lb;\n double newRange = ub - lb;\n double ratio = newRange \/ oldRange;\n\n m_lb = lb;\n m_ub = ub;\n\n defineResolution(m_dz * ratio);\n\n m_updated = false;\n}\n\ndouble IDistribution::lowerBound() const\n{\n return m_lb;\n}\n\ndouble IDistribution::upperBound() const\n{\n return m_ub;\n}\n\nvoid IDistribution::computeDistribution()\n{\n m_z.clear();\n m_pdf.clear();\n m_cdf.clear();\n\n generateZ();\n generatePDF();\n calculateCDF();\n\n if(m_quantileInterpolator == 0) {\n m_quantileInterpolator = new LinearInterpolator(m_cdf, m_z);\n } else {\n m_quantileInterpolator->defineXY(m_cdf, m_z);\n }\n\n m_updated = true;\n}\n\nvoid IDistribution::calculateCDF()\n{\n m_cdf.assign(m_nSamples, 0.0);\n double cur = 0.0;\n double next = 0.0;\n for(int i=0; i<m_nSamples-1; i++) {\n cur = m_pdf[i];\n next = m_pdf[i+1];\n m_cdf[i+1] = m_cdf[i] + (cur+next)\/2.0 * (m_z[i+1] - m_z[i]);\n }\n\n \/\/ normalise\n double factor = m_cdf.back();\n if(factor == 1.0) {\n return;\n } else if(factor == 0.0) {\n double probability = 1.0\/(m_ub - m_lb);\n m_pdf.assign(m_nSamples, probability);\n calculateCDF();\n } else {\n\/\/ for(int i=0; i<m_cdf.size(); i++) {\n\/\/ m_pdf[i] \/= factor;\n\/\/ m_cdf[i] \/= factor;\n\/\/ }\n \/\/ Try this instead. TODO: remove the comment if it works\n transform(m_pdf.begin(), m_pdf.end(), m_pdf.begin(),\n [factor](double p){return p\/factor;});\n transform(m_cdf.begin(), m_cdf.end(), m_cdf.begin(),\n [factor](double p){return p\/factor;});\n }\n}\n\nvoid IDistribution::generateEquallySpacedZ()\n{\n m_nSamples = (int)((m_ub - m_lb) \/ m_dz) + 1;\n m_z.resize(m_nSamples);\n double zz = m_lb;\n for(int i = 0; i < m_z.size() - 1; i++) {\n m_z[i] = zz;\n zz += m_dz;\n }\n m_z[m_z.size() - 1] = m_ub;\n}\n\n\/\/\/ UNIFORM DISTRIBUTION\nUniformDistribution::UniformDistribution()\n{\n\n}\n\nUniformDistribution::UniformDistribution(double lb, double ub)\n{\n defineBoundaries(lb, ub);\n defineResolution(m_ub - m_lb);\n}\n\nUniformDistribution::~UniformDistribution()\n{\n\n}\n\ndouble UniformDistribution::sample()\n{\n return m_lb + randUni() * (m_ub - m_lb);\n}\n\nvoid UniformDistribution::generateZ()\n{\n generateEquallySpacedZ();\n}\n\nvoid UniformDistribution::generatePDF()\n{\n double probability = 1.0\/(m_ub - m_lb);\n m_pdf.assign(m_nSamples, probability);\n}\n\n\/\/\/ LINEAR DISTRIBUTION\nLinearDistribution::LinearDistribution()\n : m_ascend(true)\n{\n defineResolution((m_ub-m_lb) \/ 2.0);\n}\n\nLinearDistribution::LinearDistribution(double lb, double ub, bool ascend)\n : m_ascend(ascend)\n{\n defineBoundaries(lb, ub);\n defineResolution((m_ub-m_lb) \/ 2.0);\n}\n\nLinearDistribution::~LinearDistribution()\n{\n\n}\n\ndouble LinearDistribution::sample()\n{\n double r = randUni();\n double samp;\n if(m_ascend) {\n samp = m_lb + sqrt(r) * (m_ub - m_lb);\n } else {\n samp = m_ub - sqrt(1 - r) * (m_ub - m_lb);\n }\n return samp;\n}\n\nvoid LinearDistribution::generateZ()\n{\n generateEquallySpacedZ();\n}\n\nvoid LinearDistribution::generatePDF()\n{\n if(m_z.empty()) {\n generateZ();\n }\n\n double maxProbability = 2\/(m_ub - m_lb);\n m_pdf = vector<double>(m_nSamples);\n if(isAscend()) {\n for(int i=0; i<m_nSamples; i++) {\n m_pdf[i] = maxProbability * (m_z[i] - m_lb) \/ (m_ub - m_lb);\n }\n } else {\n for(int i=0; i<m_nSamples; i++) {\n m_pdf[i] = maxProbability * (m_ub - m_z[i]) \/ (m_ub - m_lb);\n }\n }\n}\n\nbool LinearDistribution::isAscend() const\n{\n return m_ascend;\n}\n\nvoid LinearDistribution::defineAscend(bool a)\n{\n if(m_ascend != a) {\n m_updated = false;\n }\n m_ascend = a;\n}\n\n\/\/\/ PEAK DISTRIBUTION\nPeakDistribution::PeakDistribution()\n : m_tendency(0.5),\n m_locality(1.0)\n{\n defineResolution(1.0 \/ (DistNSamples - 1));\n}\n\nPeakDistribution::PeakDistribution(double tendency, double locality)\n{\n defineTendencyAndLocality(tendency, locality);\n}\n\nPeakDistribution::~PeakDistribution()\n{\n\n}\n\nvoid PeakDistribution::defineTendencyAndLocality(double tendency, double locality)\n{\n if(tendency < 0.0) {\n tendency = 0.0;\n } else if(tendency > 1.0) {\n tendency = 1.0;\n }\n m_tendency = tendency;\n\n if(locality < 0.0) {\n locality = 0.0;\n } else if(locality > 1.0) {\n locality = 1.0;\n }\n\n m_locality = locality;\n\n defineResolution(1.0\/(m_locality+0.1)\/(DistNSamples-1));\n}\n\ndouble PeakDistribution::tendency() const\n{\n return m_tendency;\n}\n\ndouble PeakDistribution::locality() const\n{\n return m_locality;\n}\n\nvoid PeakDistribution::generateZ()\n{\n generateEquallySpacedZ();\n}\n\nvoid PeakDistribution::generatePDF()\n{\n m_pdf.resize(m_nSamples);\n\n double shift = PI * m_tendency;\n double N = DistPeakMinN + m_locality\n * (DistPeakMaxN - DistPeakMinN);\n vector<complex<double> > psiN(m_nSamples, complex<double>(0, 0));\n\n double nMax = max(3*N, DistPeakMinNBasisFunc);\n nMax = min(nMax, DistPeakMaxNBasisFunc);\n for(int n = 1; n <= nMax; n++) {\n double cNn = sqrt( (pow(N, n) * exp(-N) \/ factorial(n)));\n vector<double> psi = eigenFunction(n);\n for(int i=0; i<m_nSamples; i++) {\n complex<double> j(0.0, 1.0);\n psiN[i] += cNn * exp(-j * shift * (n + 0.5)) * psi[i];\n }\n }\n for(int i=0; i<m_nSamples; i++) {\n m_pdf[i] = real(conj(psiN[i]) * psiN[i]);\n }\n}\n\nvector<double> PeakDistribution::eigenFunction(int n)\n{\n double Lz = m_ub - m_lb;\n double An = sqrt(2.0 \/ Lz);\n\n vector<double> psi(m_nSamples, 0.0);\n for(int i=1; i<m_nSamples-1; i++) {\n psi[i] = An * sin(PI * n * (m_z[i] - m_lb) \/ Lz);\n }\n return psi;\n}\n\n\n\/\/\/ MERGED DISTRIBUTION\nMergedDistribution::MergedDistribution()\n{\n\n}\n\nMergedDistribution::~MergedDistribution()\n{\n for(int i = 0; i < m_distributions.size(); i++) {\n delete m_distributions[i];\n }\n}\n\nvoid MergedDistribution::generateZ()\n{\n int nDistributions = (int)m_distributions.size();\n\n if(nDistributions == 0) {\n return;\n }\n\n for(int i=0; i<nDistributions; i++) {\n addZSamplesOfOneDistribution(m_distributions[i]);\n }\n}\n\nvoid MergedDistribution::addZSamplesOfOneDistribution(IDistribution* d)\n{\n vector<double> newZ = d->zSamples();\n if(newZ.empty()) {\n return;\n }\n vector<double>::iterator iNew = newZ.begin();\n vector<double>::iterator iExist = m_z.begin();\n \/\/ merge newZ and m_z into augZ\n vector<double> augZ;\n\n\/\/ int iNew = 0; \/\/ iterator for newZ\n\/\/ int iAug = 0; \/\/ iterator for m_z\n\n while((iNew != newZ.end()) && (iExist != m_z.end())) {\n if(*iNew == *iExist) {\n augZ.push_back(*iExist++);\n iNew++;\n }\n else if(*iNew < *iExist) {\n augZ.push_back(*iNew++);\n }\n else {\n augZ.push_back(*iExist++);\n }\n }\n\n while(iNew != newZ.end()) {\n augZ.push_back(*iNew++);\n }\n\n while(iExist != m_z.end()) {\n augZ.push_back(*iExist++);\n }\n\n m_z.swap(augZ);\n m_lb = m_z.front();\n m_ub = m_z.back();\n m_nSamples = (int)m_z.size();\n augZ.clear();\n}\n\nvoid MergedDistribution::generatePDF()\n{\n size_t nDistributions = m_distributions.size();\n\n if(nDistributions == 0) {\n return;\n }\n\n m_pdf.resize(m_nSamples);\n\n for(int i=0; i<nDistributions; i++) {\n addOnePDF(m_distributions[i], m_ratios[i]);\n }\n}\n\nvoid MergedDistribution::addOnePDF(IDistribution* d, double ratio)\n{\n \/\/ call this function only after the samples are integrated into m_z\n vector<double> newPDF = d->pdf();\n if(newPDF.empty()) {\n return;\n }\n vector<double> newZ = d->zSamples();\n\n \/\/ find the range of the new pdf\n vector<double>::iterator first = m_z.begin();\n vector<double>::iterator last = m_z.end();\n vector<double>::iterator pdfIter = m_pdf.begin();\n\n while(newZ.front() > *first) {\n ++first;\n ++pdfIter;\n }\n while(newZ.back() < *last) {\n --last;\n }\n\n \/\/Interpolate the new pdf over the new samples in its range\n LinearInterpolator pdfInterpolator(newZ, newPDF);\n vector<double> tmp = pdfInterpolator.interpolateV(vector<double>(first, last));\n newPDF.swap(tmp);\n\n \/\/ add the new pdf times its weight to the existing pdf\n vector<double>::iterator newIter;\n for(newIter = newPDF.begin(); newIter == newPDF.end(); ++newIter, ++pdfIter) {\n *pdfIter += (*newIter * ratio);\n }\n}\n\nvoid MergedDistribution::appendDistribution(IDistribution* d)\n{\n appendDistribution(d, 1.0);\n}\n\nvoid MergedDistribution::appendDistribution(IDistribution* d, double ratio)\n{\n m_distributions.push_back(d);\n m_ratios.push_back(max(ratio, 0.0));\n computeDistribution();\n}\n\n} \/\/ namespace CODeM\n<|endoftext|>"} {"text":"<commit_before>\/*\n * This file is part of accounts-ui\n *\n * Copyright (C) 2009-2010 Nokia Corporation.\n *\n * Contact: Alberto Mardegan <alberto.mardegan@nokia.com>\n *\n * This library is free software; you can redistribute it and\/or\n * modify it under the terms of the GNU Lesser General Public License\n * version 2.1 as published by the Free Software Foundation.\n *\n * This library is distributed in the hope that it will be useful, but\n * WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU\n * Lesser General Public License for more details.\n *\n * You should have received a copy of the GNU Lesser General Public\n * License along with this library; if not, write to the Free Software\n * Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA\n * 02110-1301 USA\n *\/\n\n\/\/project\n#include \"add-account-page.h\"\n#include \"service-selection-page.h\"\n#include \"service-model.h\"\n#include \"service-helper.h\"\n#include \"sort-service-model.h\"\n#include \"provider-plugin-process.h\"\n#include \"account-sync-handler.h\"\n#include \"genericaccountsetupform.h\"\n#include \"account-setup-finished-page.h\"\n\n\/\/Accounts\n#include <Accounts\/Account>\n#include <Accounts\/Manager>\n\n\/\/Meegotouch\n#include <MLocale>\n#include <MLabel>\n#include <MLayout>\n#include <MLinearLayoutPolicy>\n#include <MImageWidget>\n#include <MButton>\n#include <MWidgetCreator>\n#include <MPannableViewport>\n#include <MPositionIndicator>\n\n\/\/Qt\n#include <QString>\n#include <QSortFilterProxyModel>\n#include <QRegExp>\n#include <QDebug>\n\nusing namespace Accounts;\n\nM_REGISTER_WIDGET_NO_CREATE(AccountsUI::AddAccountPage)\n\nnamespace AccountsUI {\n\nclass AddAccountPagePrivate\n{\npublic:\n AddAccountPagePrivate()\n : context(0),\n syncHandler(0)\n {}\n ~AddAccountPagePrivate()\n {\n qDeleteAll(serviceContextList);\n }\n AbstractAccountSetupContext *context;\n QList<AbstractServiceSetupContext*> serviceContextList;\n AccountSyncHandler *syncHandler;\n QList<AbstractSetupContext*> abstractContexts;\n QString serviceType;\n Accounts::ServiceList hiddenServiceList;\n};\n\nAddAccountPage::AddAccountPage(AbstractAccountSetupContext *context,\n QGraphicsItem *parent)\n : MApplicationPage(parent)\n , d_ptr(new AddAccountPagePrivate())\n{\n Q_D(AddAccountPage);\n Q_ASSERT(context);\n setStyleName(\"AccountsUiPage\");\n setEscapeMode(MApplicationPageModel::EscapeAuto);\n d->context = context;\n d->serviceType = context->serviceType();\n pannableViewport()->positionIndicator()->setStyleName(\"CommonPositionIndicatorInverted\");\n}\n\nAddAccountPage::~AddAccountPage()\n{\n Q_D(AddAccountPage);\n delete d;\n}\n\nvoid AddAccountPage::createContent()\n{\n Q_D(AddAccountPage);\n Q_ASSERT(centralWidget());\n\n \/\/% \"Add new account\"\n setTitle(qtTrId(\"qtn_acc_add_new_account_title\"));\n\n \/\/ layout\n MLayout *layout = new MLayout(centralWidget());\n layout->setContentsMargins(0, 0, 0, 0);\n MLinearLayoutPolicy *layoutPolicy =\n new MLinearLayoutPolicy( layout, Qt::Vertical );\n\n \/\/ plugin widget has the provider info and credentials widget\n QGraphicsLayoutItem *pluginWidget = d->context->widget();\n layoutPolicy->addItem(pluginWidget);\n\n \/\/ TODO : this part is just for testing purposes, to jump to service selection page, without going through authentication\n if (!qgetenv(\"ACCOUNTSUI_SKIP_VALIDATION\").isEmpty()) {\n MButton *nextButton = new MButton(\"Skip Validation\");\n connect(nextButton, SIGNAL(clicked()), this, SLOT(navigateToServiceSelectionPage()));\n layoutPolicy->addItem(nextButton);\n }\n\n \/\/ login Ok, go to next page\n connect(d->context, SIGNAL(validated()), SLOT(navigateToServiceSelectionPage()));\n connect(d->context, SIGNAL(validated()), SLOT(showMenuBar()));\n\n \/\/process indicator\n connect(d->context, SIGNAL(validating()), SLOT(hideMenuBar()));\n connect(d->context, SIGNAL(error(AccountsUI::ErrorCode, const QString &)),\n this, SLOT(onError(AccountsUI::ErrorCode, const QString &)));\n\n \/\/cancelling\n connect((GenericAccountSetupForm*)pluginWidget, SIGNAL(stopButtonPressed()),\n d->context, SLOT(stopAuthSession()));\n connect((GenericAccountSetupForm*)pluginWidget, SIGNAL(stopButtonPressed()),\n d->context, SLOT(showMenuBar()));\n}\n\nvoid AddAccountPage::setHiddenServices(const Accounts::ServiceList &hiddenServices)\n{\n Q_D(AddAccountPage);\n d->hiddenServiceList = hiddenServices;\n}\n\nAccountSyncHandler *AddAccountPage::accountSyncHandler()\n{\n Q_D(AddAccountPage);\n return d->syncHandler;\n}\n\nvoid AddAccountPage::navigateToServiceSelectionPage()\n{\n Q_D(AddAccountPage);\n disconnect(d->context, SIGNAL(validated()), this, SLOT(navigateToServiceSelectionPage()));\n\n ServiceModel *serviceModel = new ServiceModel(d->context->account(), this);\n\n SortServiceModel *sortModel = new SortServiceModel(this);\n sortModel->setSourceModel(serviceModel);\n sortModel->setHiddenServices(d->hiddenServiceList);\n sortModel->sort(ServiceModel::ServiceNameColumn);\n\n d->serviceContextList = ServiceModel::createServiceContexts(sortModel, d->context, this);\n\n if (d->serviceContextList.count() == 0 ||\n (d->serviceContextList.count() == 1 &&\n !d->serviceContextList.at(0)->hasMandatorySettings())) {\n\n d->syncHandler = new AccountSyncHandler(this);\n connect(d->syncHandler, SIGNAL(syncStateChanged(const SyncState&)),\n this, SLOT(onSyncStateChanged(const SyncState&)));\n d->context->account()->selectService(NULL);\n d->context->account()->setEnabled(true);\n\n d->abstractContexts.append(d->context);\n if (d->serviceContextList.count() == 1) {\n d->context->account()->selectService(d->serviceContextList.at(0)->service());\n d->context->account()->setEnabled(true);\n d->abstractContexts.append(d->serviceContextList.at(0));\n }\n\n setProgressIndicatorVisible(true);\n\n qDebug() << Q_FUNC_INFO;\n d->syncHandler->validate(d->abstractContexts);\n return;\n }\n\n openServiceSelectionPage(d->context, d->serviceContextList);\n}\n\nvoid AddAccountPage::openServiceSelectionPage(AccountsUI::AbstractAccountSetupContext *context,\n QList<AccountsUI::AbstractServiceSetupContext *> &serviceContextList)\n{\n ServiceSelectionPage *serviceSelectionPage =\n new ServiceSelectionPage(context, serviceContextList);\n connect(serviceSelectionPage,SIGNAL(backButtonClicked()),\n this,SLOT(appear()));\n connect(serviceSelectionPage,SIGNAL(backButtonClicked()),\n this, SLOT(clearServiceContextList()));\n connect(serviceSelectionPage,SIGNAL(backButtonClicked()),\n serviceSelectionPage,SLOT(deleteLater()));\n\n serviceSelectionPage->appear();\n}\n\nvoid AddAccountPage::onSyncStateChanged(const SyncState &state)\n{\n\n qDebug() << Q_FUNC_INFO;\n Q_D(AddAccountPage);\n\n switch (state) {\n case NotValidated:\n qDebug() << Q_FUNC_INFO << __LINE__;\n showMenuBar();\n break;\n case NotStored:\n qDebug() << Q_FUNC_INFO << __LINE__;\n showMenuBar();\n break;\n case Validated:\n d->syncHandler->store(d->abstractContexts);\n break;\n case Stored:\n if (d->serviceType.isEmpty()) {\n connect(d->context->account(), SIGNAL(synced()),\n ProviderPluginProcess::instance(), SLOT(quit()));\n d->context->account()->sync();\n showMenuBar();\n } else {\n d->context->account()->sync();\n AccountSetupFinishedPage *page = new AccountSetupFinishedPage(d->context);\n page->appear();\n }\n break;\n default:\n return;\n }\n}\n\nvoid AddAccountPage::clearServiceContextList()\n{\n Q_D(AddAccountPage);\n d->serviceContextList.clear();\n}\n\nvoid AddAccountPage::hideMenuBar()\n{\n setComponentsDisplayMode(NavigationBar, MApplicationPageModel::Hide);\n}\n\nvoid AddAccountPage::showMenuBar()\n{\n setComponentsDisplayMode(NavigationBar, MApplicationPageModel::Show);\n}\n\nvoid AddAccountPage::onError(AccountsUI::ErrorCode, const QString &)\n{\n showMenuBar();\n}\n\n} \/\/namespace\n<commit_msg>Fixes: NB#285410 - check for lastPageActions instead of service type for transitioning to SetupFinished page<commit_after>\/*\n * This file is part of accounts-ui\n *\n * Copyright (C) 2009-2010 Nokia Corporation.\n *\n * Contact: Alberto Mardegan <alberto.mardegan@nokia.com>\n *\n * This library is free software; you can redistribute it and\/or\n * modify it under the terms of the GNU Lesser General Public License\n * version 2.1 as published by the Free Software Foundation.\n *\n * This library is distributed in the hope that it will be useful, but\n * WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU\n * Lesser General Public License for more details.\n *\n * You should have received a copy of the GNU Lesser General Public\n * License along with this library; if not, write to the Free Software\n * Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA\n * 02110-1301 USA\n *\/\n\n\/\/project\n#include \"add-account-page.h\"\n#include \"service-selection-page.h\"\n#include \"service-model.h\"\n#include \"service-helper.h\"\n#include \"sort-service-model.h\"\n#include \"provider-plugin-process.h\"\n#include \"account-sync-handler.h\"\n#include \"genericaccountsetupform.h\"\n#include \"account-setup-finished-page.h\"\n#include \"last-page-actions.h\"\n\n\/\/Accounts\n#include <Accounts\/Account>\n#include <Accounts\/Manager>\n\n\/\/Meegotouch\n#include <MLocale>\n#include <MLabel>\n#include <MLayout>\n#include <MLinearLayoutPolicy>\n#include <MImageWidget>\n#include <MButton>\n#include <MWidgetCreator>\n#include <MPannableViewport>\n#include <MPositionIndicator>\n\n\/\/Qt\n#include <QString>\n#include <QSortFilterProxyModel>\n#include <QRegExp>\n#include <QDebug>\n\nusing namespace Accounts;\n\nM_REGISTER_WIDGET_NO_CREATE(AccountsUI::AddAccountPage)\n\nnamespace AccountsUI {\n\nclass AddAccountPagePrivate\n{\npublic:\n AddAccountPagePrivate()\n : context(0),\n syncHandler(0)\n {}\n ~AddAccountPagePrivate()\n {\n qDeleteAll(serviceContextList);\n }\n AbstractAccountSetupContext *context;\n QList<AbstractServiceSetupContext*> serviceContextList;\n AccountSyncHandler *syncHandler;\n QList<AbstractSetupContext*> abstractContexts;\n QString serviceType;\n Accounts::ServiceList hiddenServiceList;\n};\n\nAddAccountPage::AddAccountPage(AbstractAccountSetupContext *context,\n QGraphicsItem *parent)\n : MApplicationPage(parent)\n , d_ptr(new AddAccountPagePrivate())\n{\n Q_D(AddAccountPage);\n Q_ASSERT(context);\n setStyleName(\"AccountsUiPage\");\n setEscapeMode(MApplicationPageModel::EscapeAuto);\n d->context = context;\n d->serviceType = context->serviceType();\n pannableViewport()->positionIndicator()->setStyleName(\"CommonPositionIndicatorInverted\");\n}\n\nAddAccountPage::~AddAccountPage()\n{\n Q_D(AddAccountPage);\n delete d;\n}\n\nvoid AddAccountPage::createContent()\n{\n Q_D(AddAccountPage);\n Q_ASSERT(centralWidget());\n\n \/\/% \"Add new account\"\n setTitle(qtTrId(\"qtn_acc_add_new_account_title\"));\n\n \/\/ layout\n MLayout *layout = new MLayout(centralWidget());\n layout->setContentsMargins(0, 0, 0, 0);\n MLinearLayoutPolicy *layoutPolicy =\n new MLinearLayoutPolicy( layout, Qt::Vertical );\n\n \/\/ plugin widget has the provider info and credentials widget\n QGraphicsLayoutItem *pluginWidget = d->context->widget();\n layoutPolicy->addItem(pluginWidget);\n\n \/\/ TODO : this part is just for testing purposes, to jump to service selection page, without going through authentication\n if (!qgetenv(\"ACCOUNTSUI_SKIP_VALIDATION\").isEmpty()) {\n MButton *nextButton = new MButton(\"Skip Validation\");\n connect(nextButton, SIGNAL(clicked()), this, SLOT(navigateToServiceSelectionPage()));\n layoutPolicy->addItem(nextButton);\n }\n\n \/\/ login Ok, go to next page\n connect(d->context, SIGNAL(validated()), SLOT(navigateToServiceSelectionPage()));\n connect(d->context, SIGNAL(validated()), SLOT(showMenuBar()));\n\n \/\/process indicator\n connect(d->context, SIGNAL(validating()), SLOT(hideMenuBar()));\n connect(d->context, SIGNAL(error(AccountsUI::ErrorCode, const QString &)),\n this, SLOT(onError(AccountsUI::ErrorCode, const QString &)));\n\n \/\/cancelling\n connect((GenericAccountSetupForm*)pluginWidget, SIGNAL(stopButtonPressed()),\n d->context, SLOT(stopAuthSession()));\n connect((GenericAccountSetupForm*)pluginWidget, SIGNAL(stopButtonPressed()),\n d->context, SLOT(showMenuBar()));\n}\n\nvoid AddAccountPage::setHiddenServices(const Accounts::ServiceList &hiddenServices)\n{\n Q_D(AddAccountPage);\n d->hiddenServiceList = hiddenServices;\n}\n\nAccountSyncHandler *AddAccountPage::accountSyncHandler()\n{\n Q_D(AddAccountPage);\n return d->syncHandler;\n}\n\nvoid AddAccountPage::navigateToServiceSelectionPage()\n{\n Q_D(AddAccountPage);\n disconnect(d->context, SIGNAL(validated()), this, SLOT(navigateToServiceSelectionPage()));\n\n ServiceModel *serviceModel = new ServiceModel(d->context->account(), this);\n\n SortServiceModel *sortModel = new SortServiceModel(this);\n sortModel->setSourceModel(serviceModel);\n sortModel->setHiddenServices(d->hiddenServiceList);\n sortModel->sort(ServiceModel::ServiceNameColumn);\n\n d->serviceContextList = ServiceModel::createServiceContexts(sortModel, d->context, this);\n\n if (d->serviceContextList.count() == 0 ||\n (d->serviceContextList.count() == 1 &&\n !d->serviceContextList.at(0)->hasMandatorySettings())) {\n\n d->syncHandler = new AccountSyncHandler(this);\n connect(d->syncHandler, SIGNAL(syncStateChanged(const SyncState&)),\n this, SLOT(onSyncStateChanged(const SyncState&)));\n d->context->account()->selectService(NULL);\n d->context->account()->setEnabled(true);\n\n d->abstractContexts.append(d->context);\n if (d->serviceContextList.count() == 1) {\n d->context->account()->selectService(d->serviceContextList.at(0)->service());\n d->context->account()->setEnabled(true);\n d->abstractContexts.append(d->serviceContextList.at(0));\n }\n\n setProgressIndicatorVisible(true);\n\n qDebug() << Q_FUNC_INFO;\n d->syncHandler->validate(d->abstractContexts);\n return;\n }\n\n openServiceSelectionPage(d->context, d->serviceContextList);\n}\n\nvoid AddAccountPage::openServiceSelectionPage(AccountsUI::AbstractAccountSetupContext *context,\n QList<AccountsUI::AbstractServiceSetupContext *> &serviceContextList)\n{\n ServiceSelectionPage *serviceSelectionPage =\n new ServiceSelectionPage(context, serviceContextList);\n connect(serviceSelectionPage,SIGNAL(backButtonClicked()),\n this,SLOT(appear()));\n connect(serviceSelectionPage,SIGNAL(backButtonClicked()),\n this, SLOT(clearServiceContextList()));\n connect(serviceSelectionPage,SIGNAL(backButtonClicked()),\n serviceSelectionPage,SLOT(deleteLater()));\n\n serviceSelectionPage->appear();\n}\n\nvoid AddAccountPage::onSyncStateChanged(const SyncState &state)\n{\n\n qDebug() << Q_FUNC_INFO;\n Q_D(AddAccountPage);\n\n switch (state) {\n case NotValidated:\n qDebug() << Q_FUNC_INFO << __LINE__;\n showMenuBar();\n break;\n case NotStored:\n qDebug() << Q_FUNC_INFO << __LINE__;\n showMenuBar();\n break;\n case Validated:\n d->syncHandler->store(d->abstractContexts);\n break;\n case Stored:\n if (ProviderPluginProcess::instance()->lastPageActions()\n\t\t\t .serviceActions().isEmpty()) {\n connect(d->context->account(), SIGNAL(synced()),\n ProviderPluginProcess::instance(), SLOT(quit()));\n d->context->account()->sync();\n showMenuBar();\n } else {\n d->context->account()->sync();\n AccountSetupFinishedPage *page = new AccountSetupFinishedPage(d->context);\n page->appear();\n }\n break;\n default:\n return;\n }\n}\n\nvoid AddAccountPage::clearServiceContextList()\n{\n Q_D(AddAccountPage);\n d->serviceContextList.clear();\n}\n\nvoid AddAccountPage::hideMenuBar()\n{\n setComponentsDisplayMode(NavigationBar, MApplicationPageModel::Hide);\n}\n\nvoid AddAccountPage::showMenuBar()\n{\n setComponentsDisplayMode(NavigationBar, MApplicationPageModel::Show);\n}\n\nvoid AddAccountPage::onError(AccountsUI::ErrorCode, const QString &)\n{\n showMenuBar();\n}\n\n} \/\/namespace\n<|endoftext|>"} {"text":"<commit_before>\/\/ Copyright 2015 Matt Heard\n\/\/ http:\/\/mattheard.net\n\/\/ matt@mattheard.net\n\/\/ @mattheard\n\n#include <opencv2\/opencv.hpp>\n#include <iostream>\n#include <string>\n\nusing cv::Mat;\n\nMat buildLookUpTable(const int divideWith) {\n const int rows = 1;\n const int cols = 256;\n const int type = CV_8U;\n const Mat table(rows, cols, type);\n for (int i = 0; i < 256; ++i) {\n const int reduced = divideWith * (i \/ divideWith);\n table.data[i] = (uchar) reduced;\n }\n return table;\n}\n\nint main(int argc, char **argv) {\n using std::string;\n const int expectedNumArgs = 3;\n if (argc != expectedNumArgs) {\n const string cmdName = \"ReduceColours\";\n const string argsDesc = \" <Image_Path> <Reduce_By>\";\n std::cout << \"Usage: \" << cmdName << argsDesc << std::endl;\n return -1;\n }\n const string inputFilename = argv[1];\n const Mat srcImg = cv::imread(inputFilename);\n if (!srcImg.data) {\n const string err = \"No image data\";\n std::cerr << err << std::endl;\n return -1;\n }\n const int divideWith = atoi(argv[2]);\n if (divideWith < 1) {\n std::cout << \"Invalid number entered for dividing.\" << std::endl;\n return -1;\n }\n const Mat lookUpTable = buildLookUpTable(divideWith);\n Mat dstImg;\n LUT(srcImg, lookUpTable, dstImg);\n const string outputFilename = \"reduced.jpg\";\n imwrite(outputFilename, dstImg);\n return 0;\n}\n<commit_msg>Remove unrelated, copied code<commit_after>\/\/ Copyright 2015 Matt Heard\n\/\/ http:\/\/mattheard.net\n\/\/ matt@mattheard.net\n\/\/ @mattheard\n\n#include <opencv2\/opencv.hpp>\n#include <iostream>\n#include <string>\n\nint main(int argc, char **argv) {\n using std::string;\n const int expectedNumArgs = 4;\n if (argc != expectedNumArgs) {\n const string cmdName = \"Blend\";\n const string argsDesc = \" <Image1_Path> <Image2_Path> <Alpha>\";\n std::cout << \"Usage: \" << cmdName << argsDesc << std::endl;\n return -1;\n }\n return 0;\n}\n<|endoftext|>"} {"text":"<commit_before><commit_msg>Try another FileLock api for Linux<commit_after><|endoftext|>"} {"text":"<commit_before>#include \"SecondLife.h\"\r\n#include <stdio.h>\r\n\r\nint main()\r\n{\n\t\/\/Packet* packet;\n\tbool success;\r\n\tSecondLife* client = new SecondLife();\n\n\tif (client->loadKeywords(\"keywords.txt\") == 0) {\r\n\t\tprintf(\"Loaded keyword file\\n\");\r\n\t} else {\r\n\t\tprintf(\"Failed to load the keyword file\\n\");\r\n\r\n\t\tdelete client;\r\n\t\treturn -1;\r\n\t}\r\n\t\r\n\tif (client->decryptCommFile(\"comm.dat\", \"output.txt\") == 0) {\r\n\t\tprintf(\"Decrypted comm file\\n\");\r\n\t} else {\r\n\t\tprintf(\"Failed to decrypt the comm file\\n\");\r\n\t}\r\n\r\n\tif (client->buildProtocolMap(\"output.txt\") == 0) {\r\n\t\tprintf(\"Built protocol map\\n\");\r\n\t} else {\r\n\t\tprintf(\"Failed to build the protocol map\\n\");\r\n\r\n\t\tdelete client;\r\n\t\treturn -2;\r\n\t}\n\n\tclient->_protocol->printMap();\n\n\t\/\/printf(\"Building UseCircuitCode packet\\n\");\n\t\/\/packet = new Packet(client->_protocol);\n\t\/\/success = packet->setCommand(\"UseCircuitCode\");\n\n\tif (success) {\n\t\t\/\/byte agentID[16] = {0x00,0x01,0x02,0x03,0x04,0x05,0x06,0x07,0x08,0x09,0x0A,0x0B,0x0C,0x0D,0x0E,0x0F};\n\t\t\/\/packet->setField(\"CircuitCode\", 1, \"ID\", agentID);\n\t\tboost::asio::ipv4::address address(\"192.168.0.105\");\n\t\tclient->_network->connectSim(address, 1000, 12345, true);\n\t} else {\n\t\tprintf(\"Failed to build the AddCircuitCode packet\");\n\t}\r\n\n\t\/\/delete packet;\r\n\tdelete client;\r\n\treturn 0;\r\n}\r\n<commit_msg>First alpha release * Fixed several nasty malloc\/memcpy\/realloc bugs * Added sleeps to the threads * Hack to make the packet flags correct (for now) * Added a default callback and fixed the callback handler * Misc. fixes<commit_after>#include \"SecondLife.h\"\r\n#include <stdio.h>\r\n\r\nSecondLife* client;\r\n\r\nvoid loginHandler(loginParameters login)\r\n{\r\n\tLLUUID tempID;\r\n\r\n\tif (login.reason.length()) {\r\n\t\tprintf(\"Login failed\\n\");\r\n\t} else {\r\n\t\t\/\/ Set the variables received from login\r\n\t\tclient->session_id((LLUUID)login.session_id);\r\n\t\tclient->secure_session_id((LLUUID)login.secure_session_id);\r\n\t\tclient->agent_id((LLUUID)login.agent_id);\r\n\r\n\t\tboost::asio::ipv4::address address(login.sim_ip);\r\n\t\tclient->_network->connectSim(address, login.sim_port, login.circuit_code, true);\r\n\r\n\t\tPacket* packet = new Packet(\"CompleteAgentMovement\", client->_protocol);\r\n\r\n\t\ttempID = client->agent_id();\r\n\t\tpacket->setField(\"AgentData\", 1, \"AgentID\", &tempID);\r\n\t\ttempID = client->session_id();\r\n\t\tpacket->setField(\"AgentData\", 1, \"SessionID\", &tempID);\r\n\t\tpacket->setField(\"AgentData\", 1, \"CircuitCode\", &login.circuit_code);\r\n\r\n\t\tclient->_network->sendPacket(packet);\r\n\r\n\t\twhile (1) {\r\n\t\t\tclient->tick();\r\n\t\t}\r\n\t}\r\n}\r\n\r\nbool receivedPacket(std::string command, Packet* packet)\r\n{\r\n\tbyte* data = packet->rawData();\r\n\tsize_t length = packet->length();\r\n\t\r\n\t\/\/ Debug\r\n\tprintf(\"Received datagram, length: %u\\n\", length);\r\n\tfor (size_t i = 0; i < length; i++) {\r\n\t\tprintf(\"%02x \", data[i]);\r\n\t}\r\n\tprintf(\"\\n\");\r\n\t\r\n\treturn true;\r\n}\r\n\r\nint main()\r\n{\r\n\tclient = new SecondLife();\r\n\r\n\tif (client->loadKeywords(\"keywords.txt\") == 0) {\r\n\t\tprintf(\"Loaded keyword file\\n\");\r\n\t} else {\r\n\t\tprintf(\"Failed to load the keyword file\\n\");\r\n\r\n\t\tdelete client;\r\n\t\treturn -1;\r\n\t}\r\n\t\r\n\tif (client->decryptCommFile(\"comm.dat\", \"output.txt\") == 0) {\r\n\t\tprintf(\"Decrypted comm file\\n\");\r\n\t} else {\r\n\t\tprintf(\"Failed to decrypt the comm file\\n\");\r\n\t}\r\n\r\n\tif (client->buildProtocolMap(\"output.txt\") == 0) {\r\n\t\tprintf(\"Built protocol map\\n\");\r\n\t} else {\r\n\t\tprintf(\"Failed to build the protocol map\\n\");\r\n\r\n\t\tdelete client;\r\n\t\treturn -2;\r\n\t}\r\n\r\n\t\/\/client->_protocol->printMap();\r\n\r\n\tclient->registerCallback(\"Default\", &receivedPacket);\r\n\t\r\n\tclient->login(\"First\", \"Last\", \"password\", \"00:00:00:00:00:00\", \"Win\", \"0\", \"test_app\", \"email@address.com\", loginHandler);\r\n\r\n\tdelete client;\r\n\treturn 0;\r\n}\r\n<|endoftext|>"} {"text":"<commit_before>\/\/ Copyright (c) 2010 The Chromium Authors. All rights reserved.\n\/\/ Use of this source code is governed by a BSD-style license that can be\n\/\/ found in the LICENSE file.\n\n#include <string>\n\n#include \"chrome\/browser\/child_process_security_policy.h\"\n#include \"chrome\/browser\/chromeos\/login\/account_screen.h\"\n#include \"chrome\/browser\/chromeos\/login\/wizard_controller.h\"\n#include \"chrome\/browser\/chromeos\/login\/wizard_in_process_browser_test.h\"\n#include \"chrome\/common\/url_constants.h\"\n#include \"chrome\/test\/in_process_browser_test.h\"\n#include \"chrome\/test\/ui_test_utils.h\"\n#include \"net\/url_request\/url_request_about_job.h\"\n#include \"net\/url_request\/url_request_filter.h\"\n#include \"testing\/gmock\/include\/gmock\/gmock.h\"\n#include \"testing\/gtest\/include\/gtest\/gtest.h\"\n\nnamespace chromeos {\n\nclass AccountScreenTest : public WizardInProcessBrowserTest {\n public:\n AccountScreenTest(): WizardInProcessBrowserTest(\"account\") {\n }\n\n protected:\n \/\/ Overridden from WizardInProcessBrowserTest:\n virtual void SetUpWizard() {\n HTTPTestServer* server = StartHTTPServer();\n ASSERT_TRUE(server != NULL);\n GURL new_account_page_url(server->TestServerPage(\"files\/new_account.html\"));\n AccountScreen::set_new_account_page_url(new_account_page_url);\n AccountScreen::set_check_for_https(false);\n }\n\n private:\n DISALLOW_COPY_AND_ASSIGN(AccountScreenTest);\n};\n\n\/\/ A basic test. It does not care how things evolve after the URL is\n\/\/ loaded. Thus no message loop is started. Just check that initial\n\/\/ status is expected.\nIN_PROC_BROWSER_TEST_F(AccountScreenTest, TestBasic) {\n ASSERT_TRUE(controller());\n EXPECT_EQ(controller()->GetAccountScreen(), controller()->current_screen());\n}\n\nstatic void QuitUIMessageLoop() {\n MessageLoopForUI::current()->Quit();\n}\n\nstatic bool inspector_called = false; \/\/ had to use global flag as\n \/\/ InspectorHook() doesn't have context.\n\nstatic URLRequestJob* InspectorHook(URLRequest* request,\n const std::string& scheme) {\n LOG(INFO) << \"Intercepted: \" << request->url() << \", scheme: \" << scheme;\n\n \/\/ Expect that the parameters are the same as new_account.html gave us.\n EXPECT_STREQ(\"cros:\/\/inspector\/?param1=value1+param2\",\n request->url().spec().c_str());\n inspector_called = true;\n ChromeThread::PostTask(ChromeThread::UI, FROM_HERE,\n NewRunnableFunction(QuitUIMessageLoop));\n\n \/\/ Do not navigate to the given URL. Navigate to about:blank instead.\n return new URLRequestAboutJob(request);\n}\n\nIN_PROC_BROWSER_TEST_F(AccountScreenTest, TestSchemeInspector) {\n ChildProcessSecurityPolicy::GetInstance()->RegisterWebSafeScheme(\n chrome::kCrosScheme);\n URLRequestFilter::GetInstance()->AddHostnameHandler(chrome::kCrosScheme,\n \"inspector\",\n &InspectorHook);\n EXPECT_FALSE(inspector_called);\n ui_test_utils::RunMessageLoop();\n EXPECT_TRUE(inspector_called);\n}\n\n} \/\/ namespace chromeos\n<commit_msg>Mark AccountScreenTest.TestSchemeInspector 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 <string>\n\n#include \"chrome\/browser\/child_process_security_policy.h\"\n#include \"chrome\/browser\/chromeos\/login\/account_screen.h\"\n#include \"chrome\/browser\/chromeos\/login\/wizard_controller.h\"\n#include \"chrome\/browser\/chromeos\/login\/wizard_in_process_browser_test.h\"\n#include \"chrome\/common\/url_constants.h\"\n#include \"chrome\/test\/in_process_browser_test.h\"\n#include \"chrome\/test\/ui_test_utils.h\"\n#include \"net\/url_request\/url_request_about_job.h\"\n#include \"net\/url_request\/url_request_filter.h\"\n#include \"testing\/gmock\/include\/gmock\/gmock.h\"\n#include \"testing\/gtest\/include\/gtest\/gtest.h\"\n\nnamespace chromeos {\n\nclass AccountScreenTest : public WizardInProcessBrowserTest {\n public:\n AccountScreenTest(): WizardInProcessBrowserTest(\"account\") {\n }\n\n protected:\n \/\/ Overridden from WizardInProcessBrowserTest:\n virtual void SetUpWizard() {\n HTTPTestServer* server = StartHTTPServer();\n ASSERT_TRUE(server != NULL);\n GURL new_account_page_url(server->TestServerPage(\"files\/new_account.html\"));\n AccountScreen::set_new_account_page_url(new_account_page_url);\n AccountScreen::set_check_for_https(false);\n }\n\n private:\n DISALLOW_COPY_AND_ASSIGN(AccountScreenTest);\n};\n\n\/\/ A basic test. It does not care how things evolve after the URL is\n\/\/ loaded. Thus no message loop is started. Just check that initial\n\/\/ status is expected.\nIN_PROC_BROWSER_TEST_F(AccountScreenTest, TestBasic) {\n ASSERT_TRUE(controller());\n EXPECT_EQ(controller()->GetAccountScreen(), controller()->current_screen());\n}\n\nstatic void QuitUIMessageLoop() {\n MessageLoopForUI::current()->Quit();\n}\n\nstatic bool inspector_called = false; \/\/ had to use global flag as\n \/\/ InspectorHook() doesn't have context.\n\nstatic URLRequestJob* InspectorHook(URLRequest* request,\n const std::string& scheme) {\n LOG(INFO) << \"Intercepted: \" << request->url() << \", scheme: \" << scheme;\n\n \/\/ Expect that the parameters are the same as new_account.html gave us.\n EXPECT_STREQ(\"cros:\/\/inspector\/?param1=value1+param2\",\n request->url().spec().c_str());\n inspector_called = true;\n ChromeThread::PostTask(ChromeThread::UI, FROM_HERE,\n NewRunnableFunction(QuitUIMessageLoop));\n\n \/\/ Do not navigate to the given URL. Navigate to about:blank instead.\n return new URLRequestAboutJob(request);\n}\n\nIN_PROC_BROWSER_TEST_F(AccountScreenTest, FLAKY_TestSchemeInspector) {\n ChildProcessSecurityPolicy::GetInstance()->RegisterWebSafeScheme(\n chrome::kCrosScheme);\n URLRequestFilter::GetInstance()->AddHostnameHandler(chrome::kCrosScheme,\n \"inspector\",\n &InspectorHook);\n EXPECT_FALSE(inspector_called);\n ui_test_utils::RunMessageLoop();\n EXPECT_TRUE(inspector_called);\n}\n\n} \/\/ namespace chromeos\n<|endoftext|>"} {"text":"<commit_before>#ifndef STAN_SERVICES_SAMPLE_INIT_WINDOWED_ADAPT_HPP\n#define STAN_SERVICES_SAMPLE_INIT_WINDOWED_ADAPT_HPP\n\n#include <stan\/interface_callbacks\/writer\/base_writer.hpp>\n#include <stan\/mcmc\/base_mcmc.hpp>\n#include <stan\/services\/arguments\/categorical_argument.hpp>\n#include <stan\/math\/prim\/mat\/fun\/Eigen.hpp>\n#include <stan\/services\/sample\/init_adapt.hpp>\n#include <ostream>\n\nnamespace stan {\n namespace services {\n namespace sample {\n\n template<class Sampler>\n bool\n init_windowed_adapt(stan::mcmc::base_mcmc* sampler,\n stan::services::categorical_argument* adapt,\n unsigned int num_warmup,\n const Eigen::VectorXd& cont_params,\n interface_callbacks::writer::base_writer& writer) {\n init_adapt<Sampler>(sampler, adapt, cont_params, writer);\n\n unsigned int init_buffer\n = dynamic_cast<u_int_argument*>(adapt->arg(\"init_buffer\"))->value();\n unsigned int term_buffer\n = dynamic_cast<u_int_argument*>(adapt->arg(\"term_buffer\"))->value();\n unsigned int window\n = dynamic_cast<u_int_argument*>(adapt->arg(\"window\"))->value();\n\n dynamic_cast<Sampler*>(sampler)\n ->set_window_params(num_warmup, init_buffer, term_buffer,\n window, writer);\n\n return true;\n }\n\n }\n }\n}\n#endif\n<commit_msg>Adding one more use of an error writer<commit_after>#ifndef STAN_SERVICES_SAMPLE_INIT_WINDOWED_ADAPT_HPP\n#define STAN_SERVICES_SAMPLE_INIT_WINDOWED_ADAPT_HPP\n\n#include <stan\/interface_callbacks\/writer\/base_writer.hpp>\n#include <stan\/mcmc\/base_mcmc.hpp>\n#include <stan\/services\/arguments\/categorical_argument.hpp>\n#include <stan\/math\/prim\/mat\/fun\/Eigen.hpp>\n#include <stan\/services\/sample\/init_adapt.hpp>\n#include <ostream>\n\nnamespace stan {\n namespace services {\n namespace sample {\n\n template<class Sampler>\n bool\n init_windowed_adapt(stan::mcmc::base_mcmc* sampler,\n stan::services::categorical_argument* adapt,\n unsigned int num_warmup,\n const Eigen::VectorXd& cont_params,\n interface_callbacks::writer::base_writer& info_writer,\n interface_callbacks::writer::base_writer& error_writer) {\n init_adapt<Sampler>(sampler, adapt, cont_params, info_writer, error_writer);\n\n unsigned int init_buffer\n = dynamic_cast<u_int_argument*>(adapt->arg(\"init_buffer\"))->value();\n unsigned int term_buffer\n = dynamic_cast<u_int_argument*>(adapt->arg(\"term_buffer\"))->value();\n unsigned int window\n = dynamic_cast<u_int_argument*>(adapt->arg(\"window\"))->value();\n\n dynamic_cast<Sampler*>(sampler)\n ->set_window_params(num_warmup, init_buffer, term_buffer,\n window, info_writer);\n\n return true;\n }\n\n }\n }\n}\n#endif\n<|endoftext|>"} {"text":"<commit_before>#include <stdint.h>\n#include \"receiver.h\"\n\n\nReceiver::Receiver(\n uint8_t spiClockPin,\n uint8_t spiDataPin,\n uint8_t spiSelectPin\n) {\n this->driver.init(spiClockPin, spiDataPin, spiSelectPin);\n}\n\n\nvoid Receiver::setFrequency(uint16_t frequency) {\n uint16_t flO = (frequency - 479) \/ 2;\n uint16_t regN = frequency \/ 32;\n uint16_t regA = frequency % 32;\n uint16_t synthRegB = (regN << 7) | regA;\n\n this->driver.setSynthRegisterB(synthRegB);\n}\n\n\n\n<commit_msg>Fix broken synth reg A gen<commit_after>#include <stdint.h>\n#include \"receiver.h\"\n\n\nReceiver::Receiver(\n uint8_t spiClockPin,\n uint8_t spiDataPin,\n uint8_t spiSelectPin\n) {\n this->driver.init(spiClockPin, spiDataPin, spiSelectPin);\n}\n\n\nvoid Receiver::setFrequency(uint16_t frequency) {\n uint16_t fLo = (frequency - 479) \/ 2;\n uint16_t regN = fLo \/ 32;\n uint16_t regA = fLo % 32;\n uint16_t synthRegB = (regN << 7) | regA;\n\n this->driver.setSynthRegisterB(synthRegB);\n}\n\n\n\n<|endoftext|>"} {"text":"<commit_before>#include \"client.h\"\n#include \"duckchat.h\"\n\n\/\/#include <stdio.h>\n\/\/#include <sys\/socket.h>\n\/\/#include <string.h>\n\/\/#include <netinet\/in.h>\n\/\/#include <stdlib.h>\n\n#include <iostream>\n#include <string>\n#include <vector>\n#include <sstream>\n#include <netinet\/in.h>\n\n\/\/using namespace std;\n\n\/\/enum Commands {EXIT, JOIN, LEAVE, LIST, WHO, SWITCH};\nint kClientPort = 5001;\nstruct sockaddr_in client_addr;\nstruct sockaddr_in server_addr;\nint client_socket;\nstd::vector<char *> delete_queue;\n\nvoid Error(const char *msg) {\n perror(msg);\n exit(1);\n}\n\n\/\/char *StringToCharStar(std::string input) {\n\/\/ char *tmp = new char[input.length() + 1];\n\/\/ strcpy(tmp, input.c_str());\n\/\/\n\/\/ return tmp;\n\/\/}\n\nvoid Connect(char *server, int port) {\n printf(\"Connecting to %s\\n\", server);\n\n memset((char *) &client_addr, 0, sizeof(client_addr));\n client_addr.sin_family = AF_INET;\n client_addr.sin_addr.s_addr = htonl(INADDR_ANY);\n client_addr.sin_port = htons(kClientPort);\n\n memset((char *) &server_addr, 0, sizeof(server_addr));\n server_addr.sin_family = AF_INET;\n server_addr.sin_addr.s_addr = htonl(INADDR_ANY); \/\/ TODO figure out how to handle ex: ix.cs.uoregon.edu\n server_addr.sin_port = htons(port);\n\n if ((client_socket = socket(AF_INET, SOCK_DGRAM, 0)) < 0) {\n Error(\"client: can't open socket\\n\");\n }\n\n if (bind(client_socket, (struct sockaddr *) &client_addr, sizeof(client_addr)) < 0) {\n Error(\"client: bind failed\\n\");\n }\n}\n\nvoid Send(std::string input) {\n char *message = new char[input.length() + 1];\n strcpy(message, input.c_str());\n\n if (sendto(client_socket, message, strlen(message), 0, (struct sockaddr *) &server_addr, sizeof(server_addr)) < 0) {\n Error(\"client: failed to send message\\n\");\n }\n\n delete message;\n}\n\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\nbool ProcessInput(std::string input) {\n std::vector<std::string> inputs = StringSplit(input);\n bool result = true;\n\n if (inputs[0] == \"\/exit\") {\n Send(inputs[0]);\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 << \"Invalid command\" << std::endl;\n }\n\n return result;\n}\n\nint main(int argc, char *argv[]) {\n char *server;\n int port;\n std::string username;\n std::string input;\n\/\/ delete_queue = std::vector<char *>();\n\n if (argc < 4) {\n fprintf(stderr,\"usage: client [server name] [port] [username]\\n\");\n exit(1);\n }\n\n server = argv[1];\n port = atoi(argv[2]);\n username = argv[3];\n\n Connect(server, port);\n\n Send(username);\n\n \/\/ TODO handle response from send\n\n while(1) {\n std::cout << \"> \";\n getline(std::cin, input);\n\n if (input[0] == '\/') {\n if (!ProcessInput(input)) {\n break;\n }\n } else {\n \/\/ Sending chat messages\n Send(input);\n }\n\n }\n\n return 0;\n}\n<commit_msg>Client now sends login to server<commit_after>#include \"client.h\"\n#include \"duckchat.h\"\n\n#include <iostream>\n#include <string>\n#include <vector>\n#include <sstream>\n#include <netinet\/in.h>\n\nint kClientPort = 5001;\nstruct sockaddr_in client_addr;\nstruct sockaddr_in server_addr;\nint client_socket;\nstd::vector<char *> delete_queue;\n\n\n\n\nvoid Error(const char *msg) {\n perror(msg);\n exit(1);\n}\n\n\n\nvoid Connect(char *server, int port) {\n printf(\"Connecting to %s\\n\", server);\n\n memset((char *) &client_addr, 0, sizeof(client_addr));\n client_addr.sin_family = AF_INET;\n client_addr.sin_addr.s_addr = htonl(INADDR_ANY);\n client_addr.sin_port = htons(kClientPort);\n\n memset((char *) &server_addr, 0, sizeof(server_addr));\n server_addr.sin_family = AF_INET;\n server_addr.sin_addr.s_addr = htonl(INADDR_ANY); \/\/ TODO figure out how to handle ex: ix.cs.uoregon.edu\n server_addr.sin_port = htons(port);\n\n if ((client_socket = socket(AF_INET, SOCK_DGRAM, 0)) < 0) {\n Error(\"client: can't open socket\\n\");\n }\n\n if (bind(client_socket, (struct sockaddr *) &client_addr, sizeof(client_addr)) < 0) {\n Error(\"client: bind failed\\n\");\n }\n}\n\n\n\n\nint SendLogin(struct request_login user_login) {\n void* message[sizeof(struct request_login)];\n memcpy(message, &user_login, sizeof(struct request_login));\n\n if (sendto(client_socket, message, sizeof(struct request_login), 0, (struct sockaddr *) &server_addr, sizeof(server_addr)) < 0) {\n Error(\"client: failed to send message\\n\");\n return 1;\n }\n\n return 0;\n}\n\n\n\n\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\n\nbool ProcessInput(std::string input) {\n std::vector<std::string> inputs = StringSplit(input);\n bool result = true;\n\n if (inputs[0] == \"\/exit\") {\n\/\/ Send(inputs[0]);\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 << \"Invalid command\" << std::endl;\n }\n\n return result;\n}\n\n\n\n\n\nint main(int argc, char *argv[]) {\n char *server;\n int port;\n char *username;\n std::string input;\n\n if (argc < 4) {\n fprintf(stderr,\"usage: client [server name] [port] [username]\\n\");\n exit(1);\n }\n\n server = argv[1];\n port = atoi(argv[2]);\n username = argv[3];\n\n Connect(server, port);\n\n struct request_login user_login;\n memset((char *) &user_login, 0, sizeof(user_login));\n user_login.req_type = REQ_LOGIN;\n strncpy(user_login.req_username, username, USERNAME_MAX);\n\n SendLogin(user_login);\n\n \/\/ TODO handle response from send\n\n while(1) {\n std::cout << \"> \";\n getline(std::cin, input);\n\n if (input[0] == '\/') {\n if (!ProcessInput(input)) {\n break;\n }\n } else {\n \/\/ Sending chat messages\n\/\/ Send(input);\n }\n\n }\n\n return 0;\n}\n<|endoftext|>"} {"text":"<commit_before>\/\/ Copyright (c) 2010 The Chromium Authors. All rights reserved.\n\/\/ Use of this source code is governed by a BSD-style license that can be\n\/\/ found in the LICENSE file.\n\n#include \"base\/command_line.h\"\n#include \"base\/message_loop.h\"\n#include \"chrome\/browser\/chromeos\/login\/account_screen.h\"\n#include \"chrome\/browser\/chromeos\/login\/wizard_controller.h\"\n#include \"chrome\/common\/chrome_switches.h\"\n#include \"chrome\/test\/in_process_browser_test.h\"\n#include \"chrome\/test\/ui_test_utils.h\"\n\nnamespace chromeos {\n\nclass AccountScreenTest : public InProcessBrowserTest {\n public:\n AccountScreenTest() {\n }\n\n protected:\n virtual void SetUpCommandLine(CommandLine* command_line) {\n command_line->AppendSwitch(switches::kLoginManager);\n command_line->AppendSwitchWithValue(switches::kLoginScreen, L\"account\");\n command_line->AppendSwitchWithValue(switches::kLoginScreenSize,\n L\"1024,600\");\n }\n\n virtual Browser* CreateBrowser(Profile* profile) {\n return NULL;\n }\n\n private:\n DISALLOW_COPY_AND_ASSIGN(AccountScreenTest);\n};\n\nIN_PROC_BROWSER_TEST_F(AccountScreenTest, TestBasic) {\n WizardController* controller = WizardController::default_controller();\n ASSERT_TRUE(NULL != controller);\n EXPECT_EQ(controller->GetAccountScreen(), controller->current_screen());\n \/\/ Close login manager windows.\n MessageLoop::current()->DeleteSoon(FROM_HERE, controller);\n \/\/ End the message loop to quit the test since there's no browser window\n \/\/ created.\n MessageLoop::current()->Quit();\n}\n\n} \/\/ namespace chromeos\n\n<commit_msg>Mark AccountScreenTest.TestBasic 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\/command_line.h\"\n#include \"base\/message_loop.h\"\n#include \"chrome\/browser\/chromeos\/login\/account_screen.h\"\n#include \"chrome\/browser\/chromeos\/login\/wizard_controller.h\"\n#include \"chrome\/common\/chrome_switches.h\"\n#include \"chrome\/test\/in_process_browser_test.h\"\n#include \"chrome\/test\/ui_test_utils.h\"\n\nnamespace chromeos {\n\nclass AccountScreenTest : public InProcessBrowserTest {\n public:\n AccountScreenTest() {\n }\n\n protected:\n virtual void SetUpCommandLine(CommandLine* command_line) {\n command_line->AppendSwitch(switches::kLoginManager);\n command_line->AppendSwitchWithValue(switches::kLoginScreen, L\"account\");\n command_line->AppendSwitchWithValue(switches::kLoginScreenSize,\n L\"1024,600\");\n }\n\n virtual Browser* CreateBrowser(Profile* profile) {\n return NULL;\n }\n\n private:\n DISALLOW_COPY_AND_ASSIGN(AccountScreenTest);\n};\n\nIN_PROC_BROWSER_TEST_F(AccountScreenTest, FLAKY_TestBasic) {\n WizardController* controller = WizardController::default_controller();\n ASSERT_TRUE(NULL != controller);\n EXPECT_EQ(controller->GetAccountScreen(), controller->current_screen());\n \/\/ Close login manager windows.\n MessageLoop::current()->DeleteSoon(FROM_HERE, controller);\n \/\/ End the message loop to quit the test since there's no browser window\n \/\/ created.\n MessageLoop::current()->Quit();\n}\n\n} \/\/ namespace chromeos\n<|endoftext|>"} {"text":"<commit_before><commit_msg>fix for multiple faces by sorting faces vector left to right and using vectors for labels\/colors (#159)<commit_after><|endoftext|>"} {"text":"<commit_before>\/\/===-- ARMTargetMachine.cpp - Define TargetMachine for ARM ---------------===\/\/\n\/\/\n\/\/ The LLVM Compiler Infrastructure\n\/\/\n\/\/ This file was developed by the \"Instituto Nokia de Tecnologia\" and\n\/\/ is distributed under the University of Illinois Open Source\n\/\/ License. See LICENSE.TXT for details.\n\/\/\n\/\/===----------------------------------------------------------------------===\/\/\n\/\/\n\/\/\n\/\/===----------------------------------------------------------------------===\/\/\n\n#include \"ARMTargetMachine.h\"\n#include \"ARMTargetAsmInfo.h\"\n#include \"ARMFrameInfo.h\"\n#include \"ARM.h\"\n#include \"llvm\/Module.h\"\n#include \"llvm\/PassManager.h\"\n#include \"llvm\/Support\/CommandLine.h\"\n#include \"llvm\/Target\/TargetMachineRegistry.h\"\n#include \"llvm\/Target\/TargetOptions.h\"\nusing namespace llvm;\n\nstatic cl::opt<bool> DisableLdStOpti(\"disable-arm-loadstore-opti\", cl::Hidden,\n cl::desc(\"Disable load store optimization pass\"));\n\nnamespace {\n \/\/ Register the target.\n RegisterTarget<ARMTargetMachine> X(\"arm\", \" ARM\");\n}\n\n\/\/\/ TargetMachine ctor - Create an ILP32 architecture model\n\/\/\/\nARMTargetMachine::ARMTargetMachine(const Module &M, const std::string &FS)\n : Subtarget(M, FS),\n DataLayout(Subtarget.isTargetDarwin() ?\n std::string(\"e-p:32:32-d:32-l:32\") :\n std::string(\"e-p:32:32-d:64-l:64\")),\n InstrInfo(Subtarget),\n FrameInfo(Subtarget) {}\n\nunsigned ARMTargetMachine::getModuleMatchQuality(const Module &M) {\n std::string TT = M.getTargetTriple();\n if (TT.size() >= 4 && std::string(TT.begin(), TT.begin()+4) == \"arm-\")\n return 20;\n\n if (M.getPointerSize() == Module::Pointer32)\n return 1;\n else\n return 0;\n}\n\n\nconst TargetAsmInfo *ARMTargetMachine::createTargetAsmInfo() const {\n return new ARMTargetAsmInfo(*this);\n}\n\n\n\/\/ Pass Pipeline Configuration\nbool ARMTargetMachine::addInstSelector(FunctionPassManager &PM, bool Fast) {\n PM.add(createARMISelDag(*this));\n return false;\n}\n\nbool ARMTargetMachine::addPreEmitPass(FunctionPassManager &PM, bool Fast) {\n \/\/ FIXME: temporarily disabling load \/ store optimization pass for Thumb mode.\n if (!Fast && !DisableLdStOpti && !Subtarget.isThumb())\n PM.add(createARMLoadStoreOptimizationPass());\n \n PM.add(createARMConstantIslandPass());\n return true;\n}\n\nbool ARMTargetMachine::addAssemblyEmitter(FunctionPassManager &PM, bool Fast, \n std::ostream &Out) {\n \/\/ Output assembly language.\n PM.add(createARMCodePrinterPass(Out, *this));\n return false;\n}\n<commit_msg>ARM AAPCS abi (Linux, etc.) requires 8-byte double \/ long alignment; Mac requires 4-bytes alignment.<commit_after>\/\/===-- ARMTargetMachine.cpp - Define TargetMachine for ARM ---------------===\/\/\n\/\/\n\/\/ The LLVM Compiler Infrastructure\n\/\/\n\/\/ This file was developed by the \"Instituto Nokia de Tecnologia\" and\n\/\/ is distributed under the University of Illinois Open Source\n\/\/ License. See LICENSE.TXT for details.\n\/\/\n\/\/===----------------------------------------------------------------------===\/\/\n\/\/\n\/\/\n\/\/===----------------------------------------------------------------------===\/\/\n\n#include \"ARMTargetMachine.h\"\n#include \"ARMTargetAsmInfo.h\"\n#include \"ARMFrameInfo.h\"\n#include \"ARM.h\"\n#include \"llvm\/Module.h\"\n#include \"llvm\/PassManager.h\"\n#include \"llvm\/Support\/CommandLine.h\"\n#include \"llvm\/Target\/TargetMachineRegistry.h\"\n#include \"llvm\/Target\/TargetOptions.h\"\nusing namespace llvm;\n\nstatic cl::opt<bool> DisableLdStOpti(\"disable-arm-loadstore-opti\", cl::Hidden,\n cl::desc(\"Disable load store optimization pass\"));\n\nnamespace {\n \/\/ Register the target.\n RegisterTarget<ARMTargetMachine> X(\"arm\", \" ARM\");\n}\n\n\/\/\/ TargetMachine ctor - Create an ILP32 architecture model\n\/\/\/\nARMTargetMachine::ARMTargetMachine(const Module &M, const std::string &FS)\n : Subtarget(M, FS),\n DataLayout(Subtarget.isTargetDarwin() ?\n std::string(\"e-p:32:32-d:32:32-l:32:32\") :\n std::string(\"e-p:32:32-d:32:64-l:32:64\")),\n InstrInfo(Subtarget),\n FrameInfo(Subtarget) {}\n\nunsigned ARMTargetMachine::getModuleMatchQuality(const Module &M) {\n std::string TT = M.getTargetTriple();\n if (TT.size() >= 4 && std::string(TT.begin(), TT.begin()+4) == \"arm-\")\n return 20;\n\n if (M.getPointerSize() == Module::Pointer32)\n return 1;\n else\n return 0;\n}\n\n\nconst TargetAsmInfo *ARMTargetMachine::createTargetAsmInfo() const {\n return new ARMTargetAsmInfo(*this);\n}\n\n\n\/\/ Pass Pipeline Configuration\nbool ARMTargetMachine::addInstSelector(FunctionPassManager &PM, bool Fast) {\n PM.add(createARMISelDag(*this));\n return false;\n}\n\nbool ARMTargetMachine::addPreEmitPass(FunctionPassManager &PM, bool Fast) {\n \/\/ FIXME: temporarily disabling load \/ store optimization pass for Thumb mode.\n if (!Fast && !DisableLdStOpti && !Subtarget.isThumb())\n PM.add(createARMLoadStoreOptimizationPass());\n \n PM.add(createARMConstantIslandPass());\n return true;\n}\n\nbool ARMTargetMachine::addAssemblyEmitter(FunctionPassManager &PM, bool Fast, \n std::ostream &Out) {\n \/\/ Output assembly language.\n PM.add(createARMCodePrinterPass(Out, *this));\n return false;\n}\n<|endoftext|>"} {"text":"<commit_before>\/**\n * @file BackProject_Demo2.cpp\n * @brief Sample code for backproject function usage ( a bit more elaborated )\n * @author OpenCV team\n *\/\n\n#include \"opencv2\/imgproc\/imgproc.hpp\"\n#include \"opencv2\/highgui\/highgui.hpp\"\n\n#include <iostream>\n\nusing namespace cv;\nusing namespace std;\n\n\/\/\/ Global Variables\nMat src; Mat hsv; Mat hue; \nMat mask;\n\nint lo = 20; int up = 20;\nchar* window_image = \"Source image\";\n\n\/\/\/ Function Headers\nvoid Hist_and_Backproj( );\nvoid pickPoint (int event, int x, int y, int, void* );\n\n\/**\n * @function main\n *\/\nint main( int argc, char** argv )\n{\n \/\/\/ Read the image\n src = imread( argv[1], 1 );\n \/\/\/ Transform it to HSV\n cvtColor( src, hsv, CV_BGR2HSV );\n\n \/\/\/ Use only the Hue value\n hue.create( hsv.size(), hsv.depth() );\n\n int ch[] = { 0, 0 };\n mixChannels( &hsv, 1, &hue, 1, ch, 1 ); \n\n \/\/\/ Show the image \n namedWindow( window_image, CV_WINDOW_AUTOSIZE );\n imshow( window_image, src );\n\n \/\/\/ Set Trackbars for floodfill thresholds\n createTrackbar( \"Low thresh\", window_image, &lo, 255, 0 );\n createTrackbar( \"High thresh\", window_image, &up, 255, 0 );\n \/\/\/ Set a Mouse Callback\n setMouseCallback( window_image, pickPoint, 0 );\n\n waitKey(0);\n return 0;\n}\n\n\/**\n * @function pickPoint\n *\/\nvoid pickPoint (int event, int x, int y, int, void* )\n{\n if( event != CV_EVENT_LBUTTONDOWN )\n { return; }\n\n \/\/ Fill and get the mask\n Point seed = Point( x, y );\n \n int newMaskVal = 255;\n Scalar newVal = Scalar( 120, 120, 120 );\n\n int connectivity = 8;\n int flags = connectivity + (newMaskVal << 8 ) + FLOODFILL_FIXED_RANGE + FLOODFILL_MASK_ONLY;\n\n Mat mask2 = Mat::zeros( src.rows + 2, src.cols + 2, CV_8UC1 );\n floodFill( src, mask2, seed, newVal, 0, Scalar( lo, lo, lo ), Scalar( up, up, up), flags ); \n mask = mask2( Range( 1, mask2.rows - 1 ), Range( 1, mask2.cols - 1 ) );\n cout<<\"rows: \"<<mask.rows<<\" columns: \"<<mask.cols<<endl;\n imshow( \"Mask\", mask );\n\n Hist_and_Backproj( );\n}\n\n\/**\n * @function Hist_and_Backproj\n *\/\nvoid Hist_and_Backproj( )\n{\n MatND hist;\n int h_bins = 30; int s_bins = 32;\n int histSize[] = { h_bins, s_bins }; \n\n float h_range[] = { 0, 179 };\n float s_range[] = { 0, 255 };\n const float* ranges[] = { h_range, s_range };\n\n int channels[] = { 0, 1 };\n\n \/\/\/ Get the Histogram and normalize it\n calcHist( &hsv, 1, channels, mask, hist, 2, histSize, ranges, true, false );\n\n normalize( hist, hist, 0, 255, NORM_MINMAX, -1, Mat() );\n\n \/\/\/ Get Backprojection\n MatND backproj;\n calcBackProject( &hsv, 1, channels, hist, backproj, ranges, 1, true );\n \n \/\/\/ Draw the backproj\n imshow( \"BackProj\", backproj );\n\n}\n<commit_msg>Fixed small inconsistency in sample code calcBackProject_Demo2.cpp<commit_after>\/**\n * @file BackProject_Demo2.cpp\n * @brief Sample code for backproject function usage ( a bit more elaborated )\n * @author OpenCV team\n *\/\n\n#include \"opencv2\/imgproc\/imgproc.hpp\"\n#include \"opencv2\/highgui\/highgui.hpp\"\n\n#include <iostream>\n\nusing namespace cv;\nusing namespace std;\n\n\/\/\/ Global Variables\nMat src; Mat hsv; \nMat mask;\n\nint lo = 20; int up = 20;\nchar* window_image = \"Source image\";\n\n\/\/\/ Function Headers\nvoid Hist_and_Backproj( );\nvoid pickPoint (int event, int x, int y, int, void* );\n\n\/**\n * @function main\n *\/\nint main( int argc, char** argv )\n{\n \/\/\/ Read the image\n src = imread( argv[1], 1 );\n \/\/\/ Transform it to HSV\n cvtColor( src, hsv, CV_BGR2HSV );\n\n \/\/\/ Show the image \n namedWindow( window_image, CV_WINDOW_AUTOSIZE );\n imshow( window_image, src );\n\n \/\/\/ Set Trackbars for floodfill thresholds\n createTrackbar( \"Low thresh\", window_image, &lo, 255, 0 );\n createTrackbar( \"High thresh\", window_image, &up, 255, 0 );\n \/\/\/ Set a Mouse Callback\n setMouseCallback( window_image, pickPoint, 0 );\n\n waitKey(0);\n return 0;\n}\n\n\/**\n * @function pickPoint\n *\/\nvoid pickPoint (int event, int x, int y, int, void* )\n{\n if( event != CV_EVENT_LBUTTONDOWN )\n { return; }\n\n \/\/ Fill and get the mask\n Point seed = Point( x, y );\n \n int newMaskVal = 255;\n Scalar newVal = Scalar( 120, 120, 120 );\n\n int connectivity = 8;\n int flags = connectivity + (newMaskVal << 8 ) + FLOODFILL_FIXED_RANGE + FLOODFILL_MASK_ONLY;\n\n Mat mask2 = Mat::zeros( src.rows + 2, src.cols + 2, CV_8UC1 );\n floodFill( src, mask2, seed, newVal, 0, Scalar( lo, lo, lo ), Scalar( up, up, up), flags ); \n mask = mask2( Range( 1, mask2.rows - 1 ), Range( 1, mask2.cols - 1 ) );\n\n imshow( \"Mask\", mask );\n\n Hist_and_Backproj( );\n}\n\n\/**\n * @function Hist_and_Backproj\n *\/\nvoid Hist_and_Backproj( )\n{\n MatND hist;\n int h_bins = 30; int s_bins = 32;\n int histSize[] = { h_bins, s_bins }; \n\n float h_range[] = { 0, 179 };\n float s_range[] = { 0, 255 };\n const float* ranges[] = { h_range, s_range };\n\n int channels[] = { 0, 1 };\n\n \/\/\/ Get the Histogram and normalize it\n calcHist( &hsv, 1, channels, mask, hist, 2, histSize, ranges, true, false );\n\n normalize( hist, hist, 0, 255, NORM_MINMAX, -1, Mat() );\n\n \/\/\/ Get Backprojection\n MatND backproj;\n calcBackProject( &hsv, 1, channels, hist, backproj, ranges, 1, true );\n \n \/\/\/ Draw the backproj\n imshow( \"BackProj\", backproj );\n\n}\n<|endoftext|>"} {"text":"<commit_before>\/\/ Begin CVS Header\n\/\/ $Source: \/Volumes\/Home\/Users\/shoops\/cvs\/copasi_dev\/copasi\/UI\/CQExpressionWidget.cpp,v $\n\/\/ $Revision: 1.32 $\n\/\/ $Name: $\n\/\/ $Author: shoops $\n\/\/ $Date: 2009\/01\/08 16:07:44 $\n\/\/ End CVS Header\n\n\/\/ Copyright (C) 2008 by Pedro Mendes, Virginia Tech Intellectual\n\/\/ Properties, Inc., EML Research, gGmbH, University of Heidelberg,\n\/\/ and The University of Manchester.\n\/\/ All rights reserved.\n\n\/\/ Copyright (C) 2001 - 2007 by Pedro Mendes, Virginia Tech Intellectual\n\/\/ Properties, Inc. and EML Research, gGmbH.\n\/\/ All rights reserved.\n\n#include <iostream>\n\n#include <qlabel.h>\n#include <qcombobox.h>\n\/\/Added by qt3to4:\n#include <QKeyEvent>\n\n#include \"CQExpressionWidget.h\"\n#include \"CQMessageBox.h\"\n#include \"CCopasiSelectionDialog.h\"\n#include \"qtUtilities.h\"\n\n#include \"copasi.h\"\n\n#include \"CopasiDataModel\/CCopasiDataModel.h\"\n#include \"function\/CExpression.h\"\n#include \"utilities\/CAnnotatedMatrix.h\"\n#include \"model\/CModel.h\"\n#include \"CQMatrixDialog.h\"\n#include \"qtUtilities.h\"\n\nCQExpressionHighlighter::CQExpressionHighlighter(CQExpressionWidget* ew)\n : Q3SyntaxHighlighter(ew)\n{}\n\nint CQExpressionHighlighter::highlightParagraph (const QString & text, int \/* endStateOfLastPara *\/)\n{\n int pos = 0;\n int oldpos = -1;\n int delta;\n\n while (true)\n {\n pos = text.find(\"<\", pos);\n if (pos == -1)\n delta = 0;\n else\n delta = pos - oldpos - 1;\n setFormat(oldpos + 1, delta, QColor(0, 0, 0));\n if (pos == -1) break;\n oldpos = pos;\n\n pos = text.find(\">\", pos);\n while (pos > 0 && text[pos - 1] == '\\\\')\n pos = text.find(\">\", pos + 1);\n\n if (pos == -1)\n delta = 0;\n else\n delta = pos - oldpos + 1;\n\n setFormat(oldpos, delta, QColor(100, 0, 200));\n if (pos == -1) break;\n oldpos = pos;\n }\n return 0;\n}\n\n\/\/***********************************************************************\n\nCQValidatorExpression::CQValidatorExpression(Q3TextEdit * parent, const char * name, bool isBoolean):\n CQValidator< Q3TextEdit >(parent, name),\n mExpression()\n{\n mExpression.setBoolean(isBoolean);\n}\n\n\/**\n * This function ensures that any characters on Expression Widget are validated\n * to go to further processes.\n *\/\nQValidator::State CQValidatorExpression::validate(QString & input, int & pos) const\n {\n if (const_cast< CExpression * >(&mExpression)->setInfix(TO_UTF8(input)) &&\n const_cast< CExpression * >(&mExpression)->compile())\n {\n QString Input = mpLineEdit->text();\n return CQValidator< Q3TextEdit >::validate(Input, pos);\n }\n\n setColor(Invalid);\n return Intermediate;\n }\n\n\/**\n * Function to get CExpression object\n *\/\nCExpression *CQValidatorExpression::getExpression()\n{\n \/\/ return const_cast< CExpression * >(&mExpression);\n return &mExpression;\n}\n\n\/\/***********************************************************************\n\nCQExpressionWidget::CQExpressionWidget(QWidget * parent, const char * name, bool isBoolean)\n : Q3TextEdit(parent, name),\n mOldPar(0),\n mOldPos(0),\n mExpressionType(CCopasiSimpleSelectionTree::TRANSIENT_EXPRESSION),\n mpCurrentObject(NULL),\n mNewName(\"\")\n{\n setTextFormat(Qt::PlainText);\n setTabChangesFocus(true);\n\n new CQExpressionHighlighter(this);\n\n int h, s, v;\n\n mSavedColor = paletteBackgroundColor();\n mSavedColor.getHsv(&h, &s, &v);\n\n if (s < 20) s = 20;\n mChangedColor.setHsv(240, s, v);\n\n mpValidator = new CQValidatorExpression(this, \"\", isBoolean);\n mpValidator->revalidate();\n\n connect(this, SIGNAL(cursorPositionChanged(int, int)),\n this, SLOT(slotCursorPositionChanged(int, int)));\n connect(this, SIGNAL(selectionChanged()),\n this, SLOT(slotSelectionChanged()));\n connect(this, SIGNAL(textChanged()),\n this, SLOT(slotTextChanged()));\n}\n\nvoid CQExpressionWidget::keyPressEvent (QKeyEvent * e)\n{\n \/\/filter \"<\" and \">\"\n if (e->text() == \"<\")\n return;\n if (e->text() == \">\")\n return;\n\n Q3TextEdit::keyPressEvent(e);\n}\n\nvoid CQExpressionWidget::slotSelectionChanged()\n{\n int par1, par2, pos1, pos2;\n getSelection(&par1, &pos1, &par2, &pos2);\n\n if (par1 == -1) \/\/no selection, do nothing\n {\n getSelection(&mOldPar1, &mOldPos1, &mOldPar2, &mOldPos2);\n return;\n }\n\n \/\/make sure a selection contains an object completely or not at all\n \/\/TODO\n bool iio1 = isInObject(par1, pos1);\n bool iio2 = isInObject(par2, pos2);\n\n \/\/if both borders are outside do nothing.\n\n \/\/if at least one is inside clear selection\n if (iio1 || iio2)\n removeSelection();\n\n \/\/TODO: right now the any invalid selection is just cleared.\n \/\/in some cases it would be nicer for the user if it would be\n \/\/extended instead\n\n getSelection(&mOldPar1, &mOldPos1, &mOldPar2, &mOldPos2);\n}\n\n\/**\n * This slot checks any characters that are newly typed on Expression Widget.\n *\/\nvoid CQExpressionWidget::slotTextChanged()\n{\n int pos = 0;\n QString Expression = FROM_UTF8(getExpression());\n emit valid(mpValidator->validate(Expression, pos) == QValidator::Acceptable);\n}\n\nvoid CQExpressionWidget::slotCursorPositionChanged(int para, int pos)\n{\n \/\/check if we are inside an object\n if (isInObject(para, pos))\n {\n int newpos;\n \/\/first decide in which direction we want to leave the object\n if (compareCursorPositions(mOldPar, mOldPos, para, pos))\n {\n \/\/move right\n newpos = text(para).find(\">\", pos);\n if (newpos != -1)\n setCursorPosition(para, newpos + 1);\n }\n else\n {\n \/\/move left\n newpos = text(para).findRev(\"<\", pos);\n if (newpos != -1)\n setCursorPosition(para, newpos);\n }\n }\n\n getCursorPosition(&mOldPar, &mOldPos);\n}\n\nbool CQExpressionWidget::isInObject()\n{\n int para, pos;\n getCursorPosition(¶, &pos);\n return isInObject(para, pos);\n\n \/* \/\/the following code assumes the presence of the syntax highlighter\n if (color() == QColor(0,0,0)) return false;\n\n if (pos==0) return false;\n\n QString t = text(para);\n if (t[pos-1] == '>') return false;\n\n return true;*\/\n}\n\nbool CQExpressionWidget::isInObject(int par, int pos)\n{\n if (pos == 0) return false;\n\n bool result = false;\n\n QString tmp = text(par);\n\n \/\/first look to the left\n int lo, lc;\n lo = tmp.findRev('<', pos - 1);\n lc = tmp.findRev('>', pos - 1);\n while (lc > 0 && tmp[lc - 1] == '\\\\')\n lc = tmp.findRev('>', lc - 1);\n\n if ((lo == -1) && (lc == -1))\n result = false;\n else if (lc == -1)\n result = true;\n else if (lo == -1)\n {\n result = false;\n }\n else if (lo < lc)\n result = false;\n else \/\/ lo > lc\n result = true;\n\n \/\/TODO: we could implement a consistency check by trying to find the same\n \/\/information from looking to the right.\n\n return result;\n}\n\nbool CQExpressionWidget::compareCursorPositions(int parold, int posold, int par, int pos)\n{\n if (par > parold) return true;\n if (par < parold) return false;\n\n \/\/we are in the same paragraph\n if (pos > posold) return true;\n return false;\n}\n\nvoid CQExpressionWidget::doKeyboardAction(Q3TextEdit::KeyboardAction action)\n{\n int para, pos;\n getCursorPosition(¶, &pos);\n\n \/\/handle backspace and delete. All other actions are ignored\n switch (action)\n {\n case Q3TextEdit::ActionBackspace:\n if (pos == 0) return;\n if (text(para)[pos - 1] == '>')\n {\n QString tmp = text(para);\n int left = tmp.findRev('<', pos);\n setSelection(para, left, para, pos);\n removeSelectedText();\n }\n else\n Q3TextEdit::doKeyboardAction(action);\n break;\n\n case Q3TextEdit::ActionDelete:\n if ((unsigned int) pos == text().length()) return;\n if (text(para)[pos] == '<')\n {\n QString tmp = text(para);\n int right = tmp.find('>', pos);\n setSelection(para, pos, para, right + 1);\n removeSelectedText();\n }\n else\n Q3TextEdit::doKeyboardAction(action);\n break;\n\n default:\n Q3TextEdit::doKeyboardAction(action);\n break;\n }\n}\n\nvoid CQExpressionWidget::setExpression(const std::string & expression)\n{\n \/\/ Reset the parse list.\n mParseList.clear();\n\n std::string Expression = expression;\n std::string out_str = \"\";\n\n unsigned C_INT32 i = 0;\n\n while (i < Expression.length())\n {\n if (Expression[i] == '<')\n {\n i++;\n std::string objectName = \"\";\n\n while (Expression[i] != '>' && i < Expression.length())\n {\n if (Expression[i] == '\\\\')\n objectName += Expression[i++];\n\n objectName += Expression[i];\n i++;\n }\n\n CCopasiObjectName temp_CN(objectName);\n CCopasiObject * temp_object = const_cast<CCopasiObject *>(RootContainer.getObject(temp_CN));\n if (temp_object != NULL)\n {\n std::string DisplayName = temp_object->getObjectDisplayName();\n mParseList[DisplayName] = temp_object;\n\n \/\/ We need to escape >\n std::string::size_type pos = DisplayName.find_first_of(\"\\\\>\");\n while (pos != std::string::npos)\n {\n DisplayName.insert(pos, \"\\\\\");\n pos += 2;\n pos = DisplayName.find_first_of(\"\\\\>\", pos);\n }\n\n out_str += \"<\" + DisplayName + \">\";\n }\n continue;\n }\n\n else if (Expression[i] == '>')\n {\n \/\/do nothing\n }\n\n else\n {\n out_str += Expression[i];\n }\n\n i++;\n }\n\n setText(FROM_UTF8(out_str));\n\n mpValidator->saved();\n\n return;\n}\n\nstd::string CQExpressionWidget::getExpression() const\n {\n std::string DisplayName = \"\";\n std::string InfixCN = \"\";\n\n std::string InfixDispayName = TO_UTF8(text());\n std::map< std::string, const CCopasiObject *>::const_iterator it;\n\n unsigned int i;\n for (i = 0; i < InfixDispayName.length(); i++)\n {\n InfixCN += InfixDispayName[i];\n DisplayName = \"\";\n\n if (InfixDispayName[i] == '<')\n {\n i++;\n while (i < InfixDispayName.length() && InfixDispayName[i] != '>')\n {\n if (InfixDispayName[i] == '\\\\') \/\/ '\\' is an escape character.\n i++;\n\n DisplayName += InfixDispayName[i++];\n }\n\n it = mParseList.find(DisplayName);\n\n if (it != mParseList.end())\n InfixCN += it->second->getCN() + \">\";\n else\n InfixCN = InfixCN.substr(0, InfixCN.length() - 1);\n }\n }\n\n return InfixCN;\n }\n\/*\nCExpression *CQExpressionWidget::getExpression()\n{\n\/\/ return const_cast< CExpression * >(&mExpression);\n return &(mpValidator->mExpression);\n}*\/\n\nvoid CQExpressionWidget::setExpressionType(const CCopasiSimpleSelectionTree::SelectionFlag & expressionType)\n{\n mExpressionType = expressionType;\n}\n\nvoid CQExpressionWidget::slotSelectObject()\n{\n const CCopasiObject * pObject =\n CCopasiSelectionDialog::getObjectSingle(this, mExpressionType);\n\n if (pObject)\n {\n \/\/ Check whether the object is valid\n if (!CCopasiSimpleSelectionTree::filter(mExpressionType, pObject))\n {\n CQMessageBox::critical(this, \"Invalid Selection\",\n \"The use of the selected object is not allowed in this type of expression.\");\n return;\n }\n\n std::string Insert = pObject->getObjectDisplayName();\n mParseList[Insert] = pObject;\n\n \/\/ We need to escape >\n std::string::size_type pos = Insert.find_first_of(\"\\\\>\");\n while (pos != std::string::npos)\n {\n Insert.insert(pos, \"\\\\\");\n pos += 2;\n pos = Insert.find_first_of(\"\\\\>\", pos);\n }\n\n insert(FROM_UTF8(\"<\" + Insert + \">\"));\n }\n}\n<commit_msg>Fixed warning message.<commit_after>\/\/ Begin CVS Header\n\/\/ $Source: \/Volumes\/Home\/Users\/shoops\/cvs\/copasi_dev\/copasi\/UI\/CQExpressionWidget.cpp,v $\n\/\/ $Revision: 1.33 $\n\/\/ $Name: $\n\/\/ $Author: shoops $\n\/\/ $Date: 2009\/01\/08 17:53:44 $\n\/\/ End CVS Header\n\n\/\/ Copyright (C) 2008 by Pedro Mendes, Virginia Tech Intellectual\n\/\/ Properties, Inc., EML Research, gGmbH, University of Heidelberg,\n\/\/ and The University of Manchester.\n\/\/ All rights reserved.\n\n\/\/ Copyright (C) 2001 - 2007 by Pedro Mendes, Virginia Tech Intellectual\n\/\/ Properties, Inc. and EML Research, gGmbH.\n\/\/ All rights reserved.\n\n#include <iostream>\n\n#include <qlabel.h>\n#include <qcombobox.h>\n\/\/Added by qt3to4:\n#include <QKeyEvent>\n\n#include \"CQExpressionWidget.h\"\n#include \"CQMessageBox.h\"\n#include \"CCopasiSelectionDialog.h\"\n#include \"qtUtilities.h\"\n\n#include \"copasi.h\"\n\n#include \"CopasiDataModel\/CCopasiDataModel.h\"\n#include \"function\/CExpression.h\"\n#include \"utilities\/CAnnotatedMatrix.h\"\n#include \"model\/CModel.h\"\n#include \"CQMatrixDialog.h\"\n#include \"qtUtilities.h\"\n\nCQExpressionHighlighter::CQExpressionHighlighter(CQExpressionWidget* ew)\n : Q3SyntaxHighlighter(ew)\n{}\n\nint CQExpressionHighlighter::highlightParagraph (const QString & text, int \/* endStateOfLastPara *\/)\n{\n int pos = 0;\n int oldpos = -1;\n int delta;\n\n while (true)\n {\n pos = text.find(\"<\", pos);\n if (pos == -1)\n delta = 0;\n else\n delta = pos - oldpos - 1;\n setFormat(oldpos + 1, delta, QColor(0, 0, 0));\n if (pos == -1) break;\n oldpos = pos;\n\n pos = text.find(\">\", pos);\n while (pos > 0 && text[pos - 1] == '\\\\')\n pos = text.find(\">\", pos + 1);\n\n if (pos == -1)\n delta = 0;\n else\n delta = pos - oldpos + 1;\n\n setFormat(oldpos, delta, QColor(100, 0, 200));\n if (pos == -1) break;\n oldpos = pos;\n }\n return 0;\n}\n\n\/\/***********************************************************************\n\nCQValidatorExpression::CQValidatorExpression(Q3TextEdit * parent, const char * name, bool isBoolean):\n CQValidator< Q3TextEdit >(parent, name),\n mExpression()\n{\n mExpression.setBoolean(isBoolean);\n}\n\n\/**\n * This function ensures that any characters on Expression Widget are validated\n * to go to further processes.\n *\/\nQValidator::State CQValidatorExpression::validate(QString & input, int & pos) const\n {\n if (const_cast< CExpression * >(&mExpression)->setInfix(TO_UTF8(input)) &&\n const_cast< CExpression * >(&mExpression)->compile())\n {\n QString Input = mpLineEdit->text();\n return CQValidator< Q3TextEdit >::validate(Input, pos);\n }\n\n setColor(Invalid);\n return Intermediate;\n }\n\n\/**\n * Function to get CExpression object\n *\/\nCExpression *CQValidatorExpression::getExpression()\n{\n \/\/ return const_cast< CExpression * >(&mExpression);\n return &mExpression;\n}\n\n\/\/***********************************************************************\n\nCQExpressionWidget::CQExpressionWidget(QWidget * parent, const char * name, bool isBoolean)\n : Q3TextEdit(parent, name),\n mOldPar(0),\n mOldPos(0),\n mExpressionType(CCopasiSimpleSelectionTree::TRANSIENT_EXPRESSION),\n mpCurrentObject(NULL),\n mNewName(\"\")\n{\n setTextFormat(Qt::PlainText);\n setTabChangesFocus(true);\n\n new CQExpressionHighlighter(this);\n\n int h, s, v;\n\n mSavedColor = paletteBackgroundColor();\n mSavedColor.getHsv(&h, &s, &v);\n\n if (s < 20) s = 20;\n mChangedColor.setHsv(240, s, v);\n\n mpValidator = new CQValidatorExpression(this, \"\", isBoolean);\n mpValidator->revalidate();\n\n connect(this, SIGNAL(cursorPositionChanged(int, int)),\n this, SLOT(slotCursorPositionChanged(int, int)));\n connect(this, SIGNAL(selectionChanged()),\n this, SLOT(slotSelectionChanged()));\n connect(this, SIGNAL(textChanged()),\n this, SLOT(slotTextChanged()));\n}\n\nvoid CQExpressionWidget::keyPressEvent (QKeyEvent * e)\n{\n \/\/filter \"<\" and \">\"\n if (e->text() == \"<\")\n return;\n if (e->text() == \">\")\n return;\n\n Q3TextEdit::keyPressEvent(e);\n}\n\nvoid CQExpressionWidget::slotSelectionChanged()\n{\n int par1, par2, pos1, pos2;\n getSelection(&par1, &pos1, &par2, &pos2);\n\n if (par1 == -1) \/\/no selection, do nothing\n {\n getSelection(&mOldPar1, &mOldPos1, &mOldPar2, &mOldPos2);\n return;\n }\n\n \/\/make sure a selection contains an object completely or not at all\n \/\/TODO\n bool iio1 = isInObject(par1, pos1);\n bool iio2 = isInObject(par2, pos2);\n\n \/\/if both borders are outside do nothing.\n\n \/\/if at least one is inside clear selection\n if (iio1 || iio2)\n removeSelection();\n\n \/\/TODO: right now the any invalid selection is just cleared.\n \/\/in some cases it would be nicer for the user if it would be\n \/\/extended instead\n\n getSelection(&mOldPar1, &mOldPos1, &mOldPar2, &mOldPos2);\n}\n\n\/**\n * This slot checks any characters that are newly typed on Expression Widget.\n *\/\nvoid CQExpressionWidget::slotTextChanged()\n{\n int pos = 0;\n QString Expression = FROM_UTF8(getExpression());\n emit valid(mpValidator->validate(Expression, pos) == QValidator::Acceptable);\n}\n\nvoid CQExpressionWidget::slotCursorPositionChanged(int para, int pos)\n{\n \/\/check if we are inside an object\n if (isInObject(para, pos))\n {\n int newpos;\n \/\/first decide in which direction we want to leave the object\n if (compareCursorPositions(mOldPar, mOldPos, para, pos))\n {\n \/\/move right\n newpos = text(para).find(\">\", pos);\n if (newpos != -1)\n setCursorPosition(para, newpos + 1);\n }\n else\n {\n \/\/move left\n newpos = text(para).findRev(\"<\", pos);\n if (newpos != -1)\n setCursorPosition(para, newpos);\n }\n }\n\n getCursorPosition(&mOldPar, &mOldPos);\n}\n\nbool CQExpressionWidget::isInObject()\n{\n int para, pos;\n getCursorPosition(¶, &pos);\n return isInObject(para, pos);\n\n \/* \/\/the following code assumes the presence of the syntax highlighter\n if (color() == QColor(0,0,0)) return false;\n\n if (pos==0) return false;\n\n QString t = text(para);\n if (t[pos-1] == '>') return false;\n\n return true;*\/\n}\n\nbool CQExpressionWidget::isInObject(int par, int pos)\n{\n if (pos == 0) return false;\n\n bool result = false;\n\n QString tmp = text(par);\n\n \/\/first look to the left\n int lo, lc;\n lo = tmp.findRev('<', pos - 1);\n lc = tmp.findRev('>', pos - 1);\n while (lc > 0 && tmp[lc - 1] == '\\\\')\n lc = tmp.findRev('>', lc - 1);\n\n if ((lo == -1) && (lc == -1))\n result = false;\n else if (lc == -1)\n result = true;\n else if (lo == -1)\n {\n result = false;\n }\n else if (lo < lc)\n result = false;\n else \/\/ lo > lc\n result = true;\n\n \/\/TODO: we could implement a consistency check by trying to find the same\n \/\/information from looking to the right.\n\n return result;\n}\n\nbool CQExpressionWidget::compareCursorPositions(int parold, int posold, int par, int pos)\n{\n if (par > parold) return true;\n if (par < parold) return false;\n\n \/\/we are in the same paragraph\n if (pos > posold) return true;\n return false;\n}\n\nvoid CQExpressionWidget::doKeyboardAction(Q3TextEdit::KeyboardAction action)\n{\n int para, pos;\n getCursorPosition(¶, &pos);\n\n \/\/handle backspace and delete. All other actions are ignored\n switch (action)\n {\n case Q3TextEdit::ActionBackspace:\n if (pos == 0) return;\n if (text(para)[pos - 1] == '>')\n {\n QString tmp = text(para);\n int left = tmp.findRev('<', pos);\n setSelection(para, left, para, pos);\n removeSelectedText();\n }\n else\n Q3TextEdit::doKeyboardAction(action);\n break;\n\n case Q3TextEdit::ActionDelete:\n if (pos == text().length()) return;\n if (text(para)[pos] == '<')\n {\n QString tmp = text(para);\n int right = tmp.find('>', pos);\n setSelection(para, pos, para, right + 1);\n removeSelectedText();\n }\n else\n Q3TextEdit::doKeyboardAction(action);\n break;\n\n default:\n Q3TextEdit::doKeyboardAction(action);\n break;\n }\n}\n\nvoid CQExpressionWidget::setExpression(const std::string & expression)\n{\n \/\/ Reset the parse list.\n mParseList.clear();\n\n std::string Expression = expression;\n std::string out_str = \"\";\n\n unsigned C_INT32 i = 0;\n\n while (i < Expression.length())\n {\n if (Expression[i] == '<')\n {\n i++;\n std::string objectName = \"\";\n\n while (Expression[i] != '>' && i < Expression.length())\n {\n if (Expression[i] == '\\\\')\n objectName += Expression[i++];\n\n objectName += Expression[i];\n i++;\n }\n\n CCopasiObjectName temp_CN(objectName);\n CCopasiObject * temp_object = const_cast<CCopasiObject *>(RootContainer.getObject(temp_CN));\n if (temp_object != NULL)\n {\n std::string DisplayName = temp_object->getObjectDisplayName();\n mParseList[DisplayName] = temp_object;\n\n \/\/ We need to escape >\n std::string::size_type pos = DisplayName.find_first_of(\"\\\\>\");\n while (pos != std::string::npos)\n {\n DisplayName.insert(pos, \"\\\\\");\n pos += 2;\n pos = DisplayName.find_first_of(\"\\\\>\", pos);\n }\n\n out_str += \"<\" + DisplayName + \">\";\n }\n continue;\n }\n\n else if (Expression[i] == '>')\n {\n \/\/do nothing\n }\n\n else\n {\n out_str += Expression[i];\n }\n\n i++;\n }\n\n setText(FROM_UTF8(out_str));\n\n mpValidator->saved();\n\n return;\n}\n\nstd::string CQExpressionWidget::getExpression() const\n {\n std::string DisplayName = \"\";\n std::string InfixCN = \"\";\n\n std::string InfixDispayName = TO_UTF8(text());\n std::map< std::string, const CCopasiObject *>::const_iterator it;\n\n unsigned int i;\n for (i = 0; i < InfixDispayName.length(); i++)\n {\n InfixCN += InfixDispayName[i];\n DisplayName = \"\";\n\n if (InfixDispayName[i] == '<')\n {\n i++;\n while (i < InfixDispayName.length() && InfixDispayName[i] != '>')\n {\n if (InfixDispayName[i] == '\\\\') \/\/ '\\' is an escape character.\n i++;\n\n DisplayName += InfixDispayName[i++];\n }\n\n it = mParseList.find(DisplayName);\n\n if (it != mParseList.end())\n InfixCN += it->second->getCN() + \">\";\n else\n InfixCN = InfixCN.substr(0, InfixCN.length() - 1);\n }\n }\n\n return InfixCN;\n }\n\/*\nCExpression *CQExpressionWidget::getExpression()\n{\n\/\/ return const_cast< CExpression * >(&mExpression);\n return &(mpValidator->mExpression);\n}*\/\n\nvoid CQExpressionWidget::setExpressionType(const CCopasiSimpleSelectionTree::SelectionFlag & expressionType)\n{\n mExpressionType = expressionType;\n}\n\nvoid CQExpressionWidget::slotSelectObject()\n{\n const CCopasiObject * pObject =\n CCopasiSelectionDialog::getObjectSingle(this, mExpressionType);\n\n if (pObject)\n {\n \/\/ Check whether the object is valid\n if (!CCopasiSimpleSelectionTree::filter(mExpressionType, pObject))\n {\n CQMessageBox::critical(this, \"Invalid Selection\",\n \"The use of the selected object is not allowed in this type of expression.\");\n return;\n }\n\n std::string Insert = pObject->getObjectDisplayName();\n mParseList[Insert] = pObject;\n\n \/\/ We need to escape >\n std::string::size_type pos = Insert.find_first_of(\"\\\\>\");\n while (pos != std::string::npos)\n {\n Insert.insert(pos, \"\\\\\");\n pos += 2;\n pos = Insert.find_first_of(\"\\\\>\", pos);\n }\n\n insert(FROM_UTF8(\"<\" + Insert + \">\"));\n }\n}\n<|endoftext|>"} {"text":"<commit_before>\/* AFE Firmware for smart home devices\n LICENSE: https:\/\/github.com\/tschaban\/AFE-Firmware\/blob\/master\/LICENSE\n DOC: http:\/\/smart-house.adrian.czabanowski.com\/afe-firmware-pl\/ *\/\n\n#include \"AFE-Web-Server.h\"\n\nAFEWebServer::AFEWebServer() {}\n\nvoid AFEWebServer::begin() {\n httpUpdater.setup(&server);\n server.begin();\n}\n\nvoid AFEWebServer::listener() { server.handleClient(); }\n\nboolean AFEWebServer::httpAPIlistener() { return receivedHTTPCommand; }\n\nvoid AFEWebServer::publishHTML(String page) {\n server.send(200, \"text\/html\", page);\n}\n\nvoid AFEWebServer::sendJSON(String json) {\n server.send(200, \"application\/json\", json);\n}\n\nvoid AFEWebServer::handle(const char *uri,\n ESP8266WebServer::THandlerFunction handler) {\n \/\/ Serial << endl << \"INFO: Added url : \" << uri << \" for listening\";\n server.on(uri, handler);\n}\n\nHTTPCOMMAND AFEWebServer::getHTTPCommand() {\n receivedHTTPCommand = false;\n return httpCommand;\n}\n\nvoid AFEWebServer::generate() {\n \/* @TODO this method is not writen well *\/\n\n if (_refreshConfiguration) {\n _refreshConfiguration = false;\n Device.begin();\n }\n\n const String optionName = getOptionName();\n uint8_t command = getCommand();\n\n if (optionName == \"language\") {\n uint8_t data;\n if (command == SERVER_CMD_SAVE) {\n data = getLanguageData();\n }\n publishHTML(ConfigurationPanel.getLanguageConfigurationSite(\n optionName, getCommand(), data));\n\n if (command == SERVER_CMD_SAVE) {\n Device.reboot(Device.getMode());\n }\n } else if (optionName == \"device\") {\n DEVICE data;\n if (command == SERVER_CMD_SAVE) {\n data = getDeviceData();\n }\n publishHTML(ConfigurationPanel.getDeviceConfigurationSite(\n optionName, getCommand(), data));\n } else if (optionName == \"network\") {\n NETWORK data;\n if (command == SERVER_CMD_SAVE) {\n data = getNetworkData();\n }\n publishHTML(ConfigurationPanel.getNetworkConfigurationSite(\n optionName, getCommand(), data));\n\n } else if (optionName == \"mqtt\") {\n MQTT data;\n if (command == SERVER_CMD_SAVE) {\n data = getMQTTData();\n }\n publishHTML(ConfigurationPanel.getMQTTConfigurationSite(\n optionName, getCommand(), data));\n } else if (optionName == \"domoticz\") {\n DOMOTICZ data;\n if (command == SERVER_CMD_SAVE) {\n data = getDomoticzServerData();\n }\n publishHTML(ConfigurationPanel.getDomoticzServerConfigurationSite(\n optionName, getCommand(), data));\n } else if (optionName == \"led\") {\n LED data[sizeof(Device.configuration.isLED)] = {};\n uint8_t dataLedID;\n if (command == SERVER_CMD_SAVE) {\n for (uint8_t i = 0; i < sizeof(Device.configuration.isLED); i++) {\n data[i] = getLEDData(i);\n }\n dataLedID = getSystemLEDData();\n }\n publishHTML(ConfigurationPanel.getLEDConfigurationSite(\n optionName, getCommand(), data, dataLedID));\n } else if (optionName == \"exit\") {\n publishHTML(ConfigurationPanel.getSite(optionName, getCommand(), true));\n Device.reboot(MODE_NORMAL);\n } else if (optionName == \"reset\") {\n publishHTML(ConfigurationPanel.getSite(optionName, getCommand(), false));\n if (command == 1) {\n Device.setDevice();\n Device.reboot(MODE_ACCESS_POINT);\n }\n } else if (optionName == \"help\") {\n publishHTML(ConfigurationPanel.getSite(optionName, getCommand(),\n command == 0 ? false : true));\n if (command == 1) {\n Device.reboot(MODE_CONFIGURATION);\n } else if (command == 2) {\n Device.reboot(MODE_ACCESS_POINT);\n }\n } else {\n for (uint8_t i = 0; i < sizeof(Device.configuration.isRelay); i++) {\n if (Device.configuration.isRelay[i]) {\n if (optionName == \"relay\" + String(i)) {\n RELAY data = {};\n if (command == SERVER_CMD_SAVE) {\n data = getRelayData(i);\n }\n publishHTML(ConfigurationPanel.getRelayConfigurationSite(\n optionName, getCommand(), data, i));\n }\n } else {\n break;\n }\n }\n\n for (uint8_t i = 0; i < sizeof(Device.configuration.isSwitch); i++) {\n if (Device.configuration.isSwitch[i]) {\n if (optionName == \"switch\" + String(i)) {\n SWITCH data = {};\n if (command == SERVER_CMD_SAVE) {\n data = getSwitchData(i);\n }\n publishHTML(ConfigurationPanel.getSwitchConfigurationSite(\n optionName, getCommand(), data, i));\n }\n } else {\n break;\n }\n }\n }\n}\n\nString AFEWebServer::getOptionName() {\n\n if (Device.getMode() == MODE_NORMAL) {\n \/* Recived HTTP API Command *\/\n if (server.hasArg(\"command\")) {\n \/* Constructing command *\/\n server.arg(\"command\").toCharArray(httpCommand.command,\n sizeof(httpCommand.command));\n if (server.arg(\"device\")) {\n server.arg(\"device\").toCharArray(httpCommand.device,\n sizeof(httpCommand.device));\n } else {\n memset(httpCommand.device, 0, sizeof httpCommand.device);\n }\n if (server.arg(\"name\")) {\n server.arg(\"name\").toCharArray(httpCommand.name,\n sizeof(httpCommand.name));\n } else {\n memset(httpCommand.name, 0, sizeof httpCommand.name);\n }\n\n if (server.arg(\"source\")) {\n server.arg(\"source\").toCharArray(httpCommand.source,\n sizeof(httpCommand.source));\n } else {\n memset(httpCommand.source, 0, sizeof httpCommand.source);\n }\n \/*\n Serial << endl\n << \"GET: Device=\" << httpCommand.device\n << \" Name=\" << httpCommand.name << \" Source=\" <<\n httpCommand.source\n << \" Command=\" << httpCommand.command;\n *\/\n receivedHTTPCommand = true;\n return server.arg(\"command\");\n\n } else {\n return \"help\";\n }\n } else {\n if (server.hasArg(\"option\")) {\n return server.arg(\"option\");\n } else {\n return \"device\";\n }\n }\n}\n\nuint8_t AFEWebServer::getCommand() {\n if (server.hasArg(\"cmd\")) {\n return server.arg(\"cmd\").toInt();\n }\n}\n\nDEVICE AFEWebServer::getDeviceData() {\n DEVICE data;\n\n _refreshConfiguration =\n true; \/\/ it will cause that device configuration will be refeshed\n\n if (server.arg(\"dn\").length() > 0) {\n server.arg(\"dn\").toCharArray(data.name, sizeof(data.name));\n } else {\n data.name[0] = '\\0';\n }\n\n server.arg(\"h\").length() > 0 ? data.httpAPI = true : data.httpAPI = false;\n\n server.arg(\"m\").length() > 0 ? data.mqttAPI = true : data.mqttAPI = false;\n\n server.arg(\"d\").length() > 0 ? data.domoticzAPI = true\n : data.domoticzAPI = false;\n\n for (uint8_t i = 0; i < sizeof(Device.configuration.isLED); i++) {\n server.arg(\"hl\").toInt() > i ? data.isLED[i] = true : data.isLED[i] = false;\n }\n\n for (uint8_t i = 0; i < sizeof(Device.configuration.isRelay); i++) {\n server.arg(\"hr\").toInt() > i ? data.isRelay[i] = true\n : data.isRelay[i] = false;\n }\n\n for (uint8_t i = 0; i < sizeof(Device.configuration.isSwitch); i++) {\n server.arg(\"hs\").toInt() > i ? data.isSwitch[i] = true\n : data.isSwitch[i] = false;\n }\n\n return data;\n}\n\nNETWORK AFEWebServer::getNetworkData() {\n NETWORK data;\n if (server.arg(\"s\").length() > 0) {\n server.arg(\"s\").toCharArray(data.ssid, sizeof(data.ssid) + 1);\n } else {\n data.ssid[0] = '\\0';\n }\n\n if (server.arg(\"p\").length() > 0) {\n server.arg(\"p\").toCharArray(data.password, sizeof(data.password) + 1);\n } else {\n data.password[0] = '\\0';\n }\n\n if (server.arg(\"d\").length() > 0) {\n data.isDHCP = true;\n } else {\n data.isDHCP = false;\n }\n\n if (server.arg(\"d1\").length() > 0 && server.arg(\"d2\").length() > 0 &&\n server.arg(\"d3\").length() > 0 && server.arg(\"d4\").length() > 0) {\n\n data.ip = IPAddress(server.arg(\"d1\").toInt(), server.arg(\"d2\").toInt(),\n server.arg(\"d3\").toInt(), server.arg(\"d4\").toInt());\n }\n if (server.arg(\"g1\").length() > 0 && server.arg(\"g2\").length() > 0 &&\n server.arg(\"g3\").length() > 0 && server.arg(\"g4\").length() > 0) {\n\n data.gateway =\n IPAddress(server.arg(\"g1\").toInt(), server.arg(\"g2\").toInt(),\n server.arg(\"g3\").toInt(), server.arg(\"g4\").toInt());\n }\n if (server.arg(\"s1\").length() > 0 && server.arg(\"s2\").length() > 0 &&\n server.arg(\"s3\").length() > 0 && server.arg(\"s4\").length() > 0) {\n\n data.subnet = IPAddress(server.arg(\"s1\").toInt(), server.arg(\"s2\").toInt(),\n server.arg(\"s3\").toInt(), server.arg(\"s4\").toInt());\n }\n if (server.arg(\"na\").length() > 0) {\n data.noConnectionAttempts = server.arg(\"na\").toInt();\n }\n if (server.arg(\"wc\").length() > 0) {\n data.waitTimeConnections = server.arg(\"wc\").toInt();\n }\n if (server.arg(\"ws\").length() > 0) {\n data.waitTimeSeries = server.arg(\"ws\").toInt();\n }\n\n return data;\n}\n\nMQTT AFEWebServer::getMQTTData() {\n MQTT data;\n if (server.arg(\"h\").length() > 0) {\n server.arg(\"h\").toCharArray(data.host, sizeof(data.host) + 1);\n } else {\n data.host[0] = '\\0';\n }\n\n if (server.arg(\"m1\").length() > 0 && server.arg(\"m2\").length() > 0 &&\n server.arg(\"m3\").length() > 0 && server.arg(\"m4\").length() > 0) {\n\n data.ip = IPAddress(server.arg(\"m1\").toInt(), server.arg(\"m2\").toInt(),\n server.arg(\"m3\").toInt(), server.arg(\"m4\").toInt());\n }\n\n if (server.arg(\"p\").length() > 0) {\n data.port = server.arg(\"p\").toInt();\n }\n\n if (server.arg(\"u\").length() > 0) {\n server.arg(\"u\").toCharArray(data.user, sizeof(data.user) + 1);\n } else {\n data.user[0] = '\\0';\n }\n\n if (server.arg(\"s\").length() > 0) {\n server.arg(\"s\").toCharArray(data.password, sizeof(data.password) + 1);\n } else {\n data.password[0] = '\\0';\n }\n\n if (server.arg(\"t\").length() > 0) {\n server.arg(\"t\").toCharArray(data.topic, sizeof(data.topic) + 1);\n } else {\n data.topic[0] = '\\0';\n }\n\n return data;\n}\n\nDOMOTICZ AFEWebServer::getDomoticzServerData() {\n DOMOTICZ data;\n\n if (server.arg(\"t\").length() > 0) {\n data.protocol = server.arg(\"t\").toInt();\n }\n\n if (server.arg(\"h\").length() > 0) {\n server.arg(\"h\").toCharArray(data.host, sizeof(data.host) + 1);\n }\n\n if (server.arg(\"p\").length() > 0) {\n data.port = server.arg(\"p\").toInt();\n }\n\n if (server.arg(\"u\").length() > 0) {\n server.arg(\"u\").toCharArray(data.user, sizeof(data.user) + 1);\n } else {\n data.user[0] = '\\0';\n }\n if (server.arg(\"s\").length() > 0) {\n server.arg(\"s\").toCharArray(data.password, sizeof(data.password) + 1);\n } else {\n data.password[0] = '\\0';\n }\n\n return data;\n}\n\nRELAY AFEWebServer::getRelayData(uint8_t id) {\n RELAY data;\n\n if (server.arg(\"g\" + String(id)).length() > 0) {\n data.gpio = server.arg(\"g\" + String(id)).toInt();\n }\n\n if (server.arg(\"ot\" + String(id)).length() > 0) {\n data.timeToOff = server.arg(\"ot\" + String(id)).toFloat();\n }\n\n if (server.arg(\"pr\" + String(id)).length() > 0) {\n data.statePowerOn = server.arg(\"pr\" + String(id)).toInt();\n }\n\n if (server.arg(\"n\" + String(id)).length() > 0) {\n server.arg(\"n\" + String(id)).toCharArray(data.name, sizeof(data.name) + 1);\n }\n\n if (server.arg(\"mc\" + String(id)).length() > 0) {\n data.stateMQTTConnected = server.arg(\"mc\" + String(id)).toInt();\n }\n\n if (server.arg(\"l\" + String(id)).length() > 0) {\n data.ledID = server.arg(\"l\" + String(id)).toInt();\n }\n\n if (server.arg(\"x\" + String(id)).length() > 0) {\n data.idx = server.arg(\"x\" + String(id)).toInt();\n }\n\n return data;\n}\n\nSWITCH AFEWebServer::getSwitchData(uint8_t id) {\n SWITCH data;\n\n if (server.arg(\"t\" + String(id)).length() > 0) {\n data.type = server.arg(\"t\" + String(id)).toInt();\n }\n\n if (server.arg(\"s\" + String(id)).length() > 0) {\n data.sensitiveness = server.arg(\"s\" + String(id)).toInt();\n }\n\n if (server.arg(\"f\" + String(id)).length() > 0) {\n data.functionality = server.arg(\"f\" + String(id)).toInt();\n }\n\n if (server.arg(\"g\" + String(id)).length() > 0) {\n data.gpio = server.arg(\"g\" + String(id)).toInt();\n }\n\n if (server.arg(\"r\" + String(id)).length() > 0) {\n data.relayID = server.arg(\"r\" + String(id)).toInt();\n }\n\n return data;\n}\n\nLED AFEWebServer::getLEDData(uint8_t id) {\n LED data;\n if (server.arg(\"g\" + String(id)).length() > 0) {\n data.gpio = server.arg(\"g\" + String(id)).toInt();\n }\n\n server.arg(\"o\" + String(id)).length() > 0\n ? data.changeToOppositeValue = true\n : data.changeToOppositeValue = false;\n\n return data;\n}\n\nuint8_t AFEWebServer::getSystemLEDData() {\n uint8_t data;\n\n if (server.arg(\"i\").length() > 0) {\n data = server.arg(\"i\").toInt();\n }\n\n return data;\n}\n\nuint8_t AFEWebServer::getLanguageData() {\n return server.arg(\"l\").length() > 0 ? server.arg(\"l\").toInt() : 1;\n}\n<commit_msg>replaced getCommand() with command<commit_after>\/* AFE Firmware for smart home devices\n LICENSE: https:\/\/github.com\/tschaban\/AFE-Firmware\/blob\/master\/LICENSE\n DOC: http:\/\/smart-house.adrian.czabanowski.com\/afe-firmware-pl\/ *\/\n\n#include \"AFE-Web-Server.h\"\n\nAFEWebServer::AFEWebServer() {}\n\nvoid AFEWebServer::begin() {\n httpUpdater.setup(&server);\n server.begin();\n}\n\nvoid AFEWebServer::listener() { server.handleClient(); }\n\nboolean AFEWebServer::httpAPIlistener() { return receivedHTTPCommand; }\n\nvoid AFEWebServer::publishHTML(String page) {\n server.send(200, \"text\/html\", page);\n}\n\nvoid AFEWebServer::sendJSON(String json) {\n server.send(200, \"application\/json\", json);\n}\n\nvoid AFEWebServer::handle(const char *uri,\n ESP8266WebServer::THandlerFunction handler) {\n \/\/ Serial << endl << \"INFO: Added url : \" << uri << \" for listening\";\n server.on(uri, handler);\n}\n\nHTTPCOMMAND AFEWebServer::getHTTPCommand() {\n receivedHTTPCommand = false;\n return httpCommand;\n}\n\nvoid AFEWebServer::generate() {\n \/* @TODO this method is not writen well *\/\n\n if (_refreshConfiguration) {\n _refreshConfiguration = false;\n Device.begin();\n }\n\n const String optionName = getOptionName();\n uint8_t command = getCommand();\n\n if (optionName == \"language\") {\n uint8_t data;\n if (command == SERVER_CMD_SAVE) {\n data = getLanguageData();\n }\n publishHTML(ConfigurationPanel.getLanguageConfigurationSite(optionName,\n command, data));\n\n if (command == SERVER_CMD_SAVE) {\n Device.reboot(Device.getMode());\n }\n } else if (optionName == \"device\") {\n DEVICE data;\n if (command == SERVER_CMD_SAVE) {\n data = getDeviceData();\n }\n publishHTML(ConfigurationPanel.getDeviceConfigurationSite(optionName,\n command, data));\n } else if (optionName == \"network\") {\n NETWORK data;\n if (command == SERVER_CMD_SAVE) {\n data = getNetworkData();\n }\n publishHTML(ConfigurationPanel.getNetworkConfigurationSite(optionName,\n command, data));\n\n } else if (optionName == \"mqtt\") {\n MQTT data;\n if (command == SERVER_CMD_SAVE) {\n data = getMQTTData();\n }\n publishHTML(\n ConfigurationPanel.getMQTTConfigurationSite(optionName, command, data));\n } else if (optionName == \"domoticz\") {\n DOMOTICZ data;\n if (command == SERVER_CMD_SAVE) {\n data = getDomoticzServerData();\n }\n publishHTML(ConfigurationPanel.getDomoticzServerConfigurationSite(\n optionName, command, data));\n } else if (optionName == \"led\") {\n LED data[sizeof(Device.configuration.isLED)] = {};\n uint8_t dataLedID;\n if (command == SERVER_CMD_SAVE) {\n for (uint8_t i = 0; i < sizeof(Device.configuration.isLED); i++) {\n data[i] = getLEDData(i);\n }\n dataLedID = getSystemLEDData();\n }\n publishHTML(ConfigurationPanel.getLEDConfigurationSite(optionName, command,\n data, dataLedID));\n } else if (optionName == \"exit\") {\n publishHTML(ConfigurationPanel.getSite(optionName, command, true));\n Device.reboot(MODE_NORMAL);\n } else if (optionName == \"reset\") {\n publishHTML(ConfigurationPanel.getSite(optionName, command, false));\n if (command == 1) {\n Device.setDevice();\n Device.reboot(MODE_ACCESS_POINT);\n }\n } else if (optionName == \"help\") {\n publishHTML(ConfigurationPanel.getSite(optionName, command,\n command == 0 ? false : true));\n if (command == 1) {\n Device.reboot(MODE_CONFIGURATION);\n } else if (command == 2) {\n Device.reboot(MODE_ACCESS_POINT);\n }\n } else {\n for (uint8_t i = 0; i < sizeof(Device.configuration.isRelay); i++) {\n if (Device.configuration.isRelay[i]) {\n if (optionName == \"relay\" + String(i)) {\n RELAY data = {};\n if (command == SERVER_CMD_SAVE) {\n data = getRelayData(i);\n }\n publishHTML(ConfigurationPanel.getRelayConfigurationSite(\n optionName, command, data, i));\n }\n } else {\n break;\n }\n }\n\n for (uint8_t i = 0; i < sizeof(Device.configuration.isSwitch); i++) {\n if (Device.configuration.isSwitch[i]) {\n if (optionName == \"switch\" + String(i)) {\n SWITCH data = {};\n if (command == SERVER_CMD_SAVE) {\n data = getSwitchData(i);\n }\n publishHTML(ConfigurationPanel.getSwitchConfigurationSite(\n optionName, command, data, i));\n }\n } else {\n break;\n }\n }\n }\n}\n\nString AFEWebServer::getOptionName() {\n\n if (Device.getMode() == MODE_NORMAL) {\n \/* Recived HTTP API Command *\/\n if (server.hasArg(\"command\")) {\n \/* Constructing command *\/\n server.arg(\"command\").toCharArray(httpCommand.command,\n sizeof(httpCommand.command));\n if (server.arg(\"device\")) {\n server.arg(\"device\").toCharArray(httpCommand.device,\n sizeof(httpCommand.device));\n } else {\n memset(httpCommand.device, 0, sizeof httpCommand.device);\n }\n if (server.arg(\"name\")) {\n server.arg(\"name\").toCharArray(httpCommand.name,\n sizeof(httpCommand.name));\n } else {\n memset(httpCommand.name, 0, sizeof httpCommand.name);\n }\n\n if (server.arg(\"source\")) {\n server.arg(\"source\").toCharArray(httpCommand.source,\n sizeof(httpCommand.source));\n } else {\n memset(httpCommand.source, 0, sizeof httpCommand.source);\n }\n \/*\n Serial << endl\n << \"GET: Device=\" << httpCommand.device\n << \" Name=\" << httpCommand.name << \" Source=\" <<\n httpCommand.source\n << \" Command=\" << httpCommand.command;\n *\/\n receivedHTTPCommand = true;\n return server.arg(\"command\");\n\n } else {\n return \"help\";\n }\n } else {\n if (server.hasArg(\"option\")) {\n return server.arg(\"option\");\n } else {\n return \"device\";\n }\n }\n}\n\nuint8_t AFEWebServer::getCommand() {\n if (server.hasArg(\"cmd\")) {\n return server.arg(\"cmd\").toInt();\n }\n}\n\nDEVICE AFEWebServer::getDeviceData() {\n DEVICE data;\n\n _refreshConfiguration =\n true; \/\/ it will cause that device configuration will be refeshed\n\n if (server.arg(\"dn\").length() > 0) {\n server.arg(\"dn\").toCharArray(data.name, sizeof(data.name));\n } else {\n data.name[0] = '\\0';\n }\n\n server.arg(\"h\").length() > 0 ? data.httpAPI = true : data.httpAPI = false;\n\n server.arg(\"m\").length() > 0 ? data.mqttAPI = true : data.mqttAPI = false;\n\n server.arg(\"d\").length() > 0 ? data.domoticzAPI = true\n : data.domoticzAPI = false;\n\n for (uint8_t i = 0; i < sizeof(Device.configuration.isLED); i++) {\n server.arg(\"hl\").toInt() > i ? data.isLED[i] = true : data.isLED[i] = false;\n }\n\n for (uint8_t i = 0; i < sizeof(Device.configuration.isRelay); i++) {\n server.arg(\"hr\").toInt() > i ? data.isRelay[i] = true\n : data.isRelay[i] = false;\n }\n\n for (uint8_t i = 0; i < sizeof(Device.configuration.isSwitch); i++) {\n server.arg(\"hs\").toInt() > i ? data.isSwitch[i] = true\n : data.isSwitch[i] = false;\n }\n\n return data;\n}\n\nNETWORK AFEWebServer::getNetworkData() {\n NETWORK data;\n if (server.arg(\"s\").length() > 0) {\n server.arg(\"s\").toCharArray(data.ssid, sizeof(data.ssid) + 1);\n } else {\n data.ssid[0] = '\\0';\n }\n\n if (server.arg(\"p\").length() > 0) {\n server.arg(\"p\").toCharArray(data.password, sizeof(data.password) + 1);\n } else {\n data.password[0] = '\\0';\n }\n\n if (server.arg(\"d\").length() > 0) {\n data.isDHCP = true;\n } else {\n data.isDHCP = false;\n }\n\n if (server.arg(\"d1\").length() > 0 && server.arg(\"d2\").length() > 0 &&\n server.arg(\"d3\").length() > 0 && server.arg(\"d4\").length() > 0) {\n\n data.ip = IPAddress(server.arg(\"d1\").toInt(), server.arg(\"d2\").toInt(),\n server.arg(\"d3\").toInt(), server.arg(\"d4\").toInt());\n }\n if (server.arg(\"g1\").length() > 0 && server.arg(\"g2\").length() > 0 &&\n server.arg(\"g3\").length() > 0 && server.arg(\"g4\").length() > 0) {\n\n data.gateway =\n IPAddress(server.arg(\"g1\").toInt(), server.arg(\"g2\").toInt(),\n server.arg(\"g3\").toInt(), server.arg(\"g4\").toInt());\n }\n if (server.arg(\"s1\").length() > 0 && server.arg(\"s2\").length() > 0 &&\n server.arg(\"s3\").length() > 0 && server.arg(\"s4\").length() > 0) {\n\n data.subnet = IPAddress(server.arg(\"s1\").toInt(), server.arg(\"s2\").toInt(),\n server.arg(\"s3\").toInt(), server.arg(\"s4\").toInt());\n }\n if (server.arg(\"na\").length() > 0) {\n data.noConnectionAttempts = server.arg(\"na\").toInt();\n }\n if (server.arg(\"wc\").length() > 0) {\n data.waitTimeConnections = server.arg(\"wc\").toInt();\n }\n if (server.arg(\"ws\").length() > 0) {\n data.waitTimeSeries = server.arg(\"ws\").toInt();\n }\n\n return data;\n}\n\nMQTT AFEWebServer::getMQTTData() {\n MQTT data;\n if (server.arg(\"h\").length() > 0) {\n server.arg(\"h\").toCharArray(data.host, sizeof(data.host) + 1);\n } else {\n data.host[0] = '\\0';\n }\n\n if (server.arg(\"m1\").length() > 0 && server.arg(\"m2\").length() > 0 &&\n server.arg(\"m3\").length() > 0 && server.arg(\"m4\").length() > 0) {\n\n data.ip = IPAddress(server.arg(\"m1\").toInt(), server.arg(\"m2\").toInt(),\n server.arg(\"m3\").toInt(), server.arg(\"m4\").toInt());\n }\n\n if (server.arg(\"p\").length() > 0) {\n data.port = server.arg(\"p\").toInt();\n }\n\n if (server.arg(\"u\").length() > 0) {\n server.arg(\"u\").toCharArray(data.user, sizeof(data.user) + 1);\n } else {\n data.user[0] = '\\0';\n }\n\n if (server.arg(\"s\").length() > 0) {\n server.arg(\"s\").toCharArray(data.password, sizeof(data.password) + 1);\n } else {\n data.password[0] = '\\0';\n }\n\n if (server.arg(\"t\").length() > 0) {\n server.arg(\"t\").toCharArray(data.topic, sizeof(data.topic) + 1);\n } else {\n data.topic[0] = '\\0';\n }\n\n return data;\n}\n\nDOMOTICZ AFEWebServer::getDomoticzServerData() {\n DOMOTICZ data;\n\n if (server.arg(\"t\").length() > 0) {\n data.protocol = server.arg(\"t\").toInt();\n }\n\n if (server.arg(\"h\").length() > 0) {\n server.arg(\"h\").toCharArray(data.host, sizeof(data.host) + 1);\n }\n\n if (server.arg(\"p\").length() > 0) {\n data.port = server.arg(\"p\").toInt();\n }\n\n if (server.arg(\"u\").length() > 0) {\n server.arg(\"u\").toCharArray(data.user, sizeof(data.user) + 1);\n } else {\n data.user[0] = '\\0';\n }\n if (server.arg(\"s\").length() > 0) {\n server.arg(\"s\").toCharArray(data.password, sizeof(data.password) + 1);\n } else {\n data.password[0] = '\\0';\n }\n\n return data;\n}\n\nRELAY AFEWebServer::getRelayData(uint8_t id) {\n RELAY data;\n\n if (server.arg(\"g\" + String(id)).length() > 0) {\n data.gpio = server.arg(\"g\" + String(id)).toInt();\n }\n\n if (server.arg(\"ot\" + String(id)).length() > 0) {\n data.timeToOff = server.arg(\"ot\" + String(id)).toFloat();\n }\n\n if (server.arg(\"pr\" + String(id)).length() > 0) {\n data.statePowerOn = server.arg(\"pr\" + String(id)).toInt();\n }\n\n if (server.arg(\"n\" + String(id)).length() > 0) {\n server.arg(\"n\" + String(id)).toCharArray(data.name, sizeof(data.name) + 1);\n }\n\n if (server.arg(\"mc\" + String(id)).length() > 0) {\n data.stateMQTTConnected = server.arg(\"mc\" + String(id)).toInt();\n }\n\n if (server.arg(\"l\" + String(id)).length() > 0) {\n data.ledID = server.arg(\"l\" + String(id)).toInt();\n }\n\n if (server.arg(\"x\" + String(id)).length() > 0) {\n data.idx = server.arg(\"x\" + String(id)).toInt();\n }\n\n return data;\n}\n\nSWITCH AFEWebServer::getSwitchData(uint8_t id) {\n SWITCH data;\n\n if (server.arg(\"t\" + String(id)).length() > 0) {\n data.type = server.arg(\"t\" + String(id)).toInt();\n }\n\n if (server.arg(\"s\" + String(id)).length() > 0) {\n data.sensitiveness = server.arg(\"s\" + String(id)).toInt();\n }\n\n if (server.arg(\"f\" + String(id)).length() > 0) {\n data.functionality = server.arg(\"f\" + String(id)).toInt();\n }\n\n if (server.arg(\"g\" + String(id)).length() > 0) {\n data.gpio = server.arg(\"g\" + String(id)).toInt();\n }\n\n if (server.arg(\"r\" + String(id)).length() > 0) {\n data.relayID = server.arg(\"r\" + String(id)).toInt();\n }\n\n return data;\n}\n\nLED AFEWebServer::getLEDData(uint8_t id) {\n LED data;\n if (server.arg(\"g\" + String(id)).length() > 0) {\n data.gpio = server.arg(\"g\" + String(id)).toInt();\n }\n\n server.arg(\"o\" + String(id)).length() > 0\n ? data.changeToOppositeValue = true\n : data.changeToOppositeValue = false;\n\n return data;\n}\n\nuint8_t AFEWebServer::getSystemLEDData() {\n uint8_t data;\n\n if (server.arg(\"i\").length() > 0) {\n data = server.arg(\"i\").toInt();\n }\n\n return data;\n}\n\nuint8_t AFEWebServer::getLanguageData() {\n return server.arg(\"l\").length() > 0 ? server.arg(\"l\").toInt() : 1;\n}\n<|endoftext|>"} {"text":"<commit_before>#include <osrm\/coordinate.hpp>\n\n#include <boost\/test\/unit_test.hpp>\n\n\/\/ Regression test for bug captured in #1347\nBOOST_AUTO_TEST_CASE(regression_test_1347)\n{\n FixedPointCoordinate u(10 * COORDINATE_PRECISION, -100 * COORDINATE_PRECISION);\n FixedPointCoordinate v(10.001 * COORDINATE_PRECISION, -100.002 * COORDINATE_PRECISION);\n FixedPointCoordinate q(10.002 * COORDINATE_PRECISION, -100.001 * COORDINATE_PRECISION);\n\n float d1 = FixedPointCoordinate::ComputePerpendicularDistance(u, v, q);\n\n float ratio;\n FixedPointCoordinate nearest_location;\n float d2 = FixedPointCoordinate::ComputePerpendicularDistance(u, v, q, nearest_location, ratio);\n\n BOOST_CHECK_LE(std::abs(d1 - d2), 0.01);\n}\n\n<commit_msg>make floating point number literal a float<commit_after>#include <osrm\/coordinate.hpp>\n\n#include <boost\/test\/unit_test.hpp>\n\n\/\/ Regression test for bug captured in #1347\nBOOST_AUTO_TEST_CASE(regression_test_1347)\n{\n FixedPointCoordinate u(10 * COORDINATE_PRECISION, -100 * COORDINATE_PRECISION);\n FixedPointCoordinate v(10.001 * COORDINATE_PRECISION, -100.002 * COORDINATE_PRECISION);\n FixedPointCoordinate q(10.002 * COORDINATE_PRECISION, -100.001 * COORDINATE_PRECISION);\n\n float d1 = FixedPointCoordinate::ComputePerpendicularDistance(u, v, q);\n\n float ratio;\n FixedPointCoordinate nearest_location;\n float d2 = FixedPointCoordinate::ComputePerpendicularDistance(u, v, q, nearest_location, ratio);\n\n BOOST_CHECK_LE(std::abs(d1 - d2), 0.01f);\n}\n\n<|endoftext|>"} {"text":"<commit_before>#pragma once\n\n#include \"kernel.hh\"\n#include \"refcache.hh\"\n#include \"chainhash.hh\"\n#include \"radix_array.hh\"\n#include \"page_info.hh\"\n#include \"kalloc.hh\"\n#include \"fs.h\"\n\nclass mdir;\nclass mfile;\nclass mdev;\nclass msock;\n\nclass mnode : public refcache::weak_referenced\n{\npublic:\n struct types {\n enum {\n dir = 1,\n file,\n dev,\n sock,\n };\n };\n\n static sref<mnode> get(u64 n);\n static sref<mnode> alloc(u8 type);\n\n void cache_pin(bool flag);\n u8 type() const;\n\n mdir* as_dir();\n const mdir* as_dir() const;\n mfile* as_file();\n const mfile* as_file() const;\n mdev* as_dev();\n const mdev* as_dev() const;\n msock* as_sock();\n const msock* as_sock() const;\n\n class linkcount : public refcache::referenced {\n public:\n linkcount() : refcache::referenced(0) {};\n void onzero() override;\n };\n\n const u64 inum_;\n linkcount nlink_;\n\nprotected:\n mnode(u64 inum);\n\nprivate:\n void onzero() override;\n\n std::atomic<bool> cache_pin_;\n std::atomic<bool> dirty_;\n std::atomic<bool> valid_;\n};\n\n\/*\n * An mlinkref represents a link count reference on an mnode.\n * The caller must ensure that mlinkref::acquire() is not called\n * after mnode::nlink_ reaches stable zero, perhaps by blocking\n * refcache epochs using cli when looking up the inode number in\n * a directory.\n *\n * Each mlinkref holds a reference to the mnode as well, to ensure\n * that the memory used to store the nlink_ count is not evicted\n * before all of the refcache deltas are flushed. Otherwise this\n * would just be an sref<linkcount>.\n *\/\nclass mlinkref {\npublic:\n mlinkref() {}\n mlinkref(sref<mnode> mref) : m_(mref) {}\n\n sref<mnode> mn() {\n return m_;\n }\n\n bool held() {\n return !!l_;\n }\n\n \/*\n * Increment the link count on the mnode.\n *\/\n void acquire() {\n assert(m_ && !l_);\n l_ = sref<mnode::linkcount>::newref(&m_->nlink_);\n }\n\n \/*\n * Transfer an existing link count on the mnode to this mlinkref.\n *\/\n void transfer() {\n assert(m_ && !l_);\n l_ = sref<mnode::linkcount>::transfer(&m_->nlink_);\n }\n\nprivate:\n \/*\n * The order is important due to C++ constructor\/destructor\n * rules: we must hold the mnode reference while manipulating\n * the linkcount reference.\n *\/\n sref<mnode> m_;\n sref<mnode::linkcount> l_;\n};\n\n\nclass mdir : public mnode {\nprivate:\n mdir(u64 inum) : mnode(inum), map_(257) {}\n NEW_DELETE_OPS(mdir);\n friend sref<mnode> mnode::get(u64);\n\n class filecount : public refcache::referenced {\n public:\n filecount() : refcache::referenced(0) {};\n void onzero() override {};\n };\n\n chainhash<strbuf<DIRSIZ>, u64> map_;\n\npublic:\n bool insert(const strbuf<DIRSIZ>& name, mlinkref* ilink) {\n if (name == \".\")\n return false;\n if (!map_.insert(name, ilink->mn()->inum_))\n return false;\n assert(ilink->held());\n ilink->mn()->nlink_.inc();\n return true;\n }\n\n bool remove(const strbuf<DIRSIZ>& name, sref<mnode> m) {\n if (!map_.remove(name, m->inum_))\n return false;\n m->nlink_.dec();\n return true;\n }\n\n bool replace(const strbuf<DIRSIZ>& name, sref<mnode> mold, mlinkref* ilinknew) {\n if (!map_.replace(name, mold->inum_, ilinknew->mn()->inum_))\n return false;\n assert(ilinknew->held());\n ilinknew->mn()->nlink_.inc();\n mold->nlink_.dec();\n return true;\n }\n\n sref<mnode> lookup(const strbuf<DIRSIZ>& name) const {\n if (name == \".\")\n return mnode::get(inum_);\n\n u64 iprev = -1;\n for (;;) {\n u64 inum;\n if (!map_.lookup(name, &inum))\n return sref<mnode>();\n\n sref<mnode> m = mnode::get(inum);\n if (m)\n return m;\n\n \/*\n * The inode was GCed between the lookup and mnode::get().\n * Retry the lookup. Crash if we repeatedly can't find\n * the same inode (to make such bugs easier to track down).\n *\/\n assert(inum != iprev);\n iprev = inum;\n }\n }\n\n mlinkref lookup_link(const strbuf<DIRSIZ>& name) const {\n if (name == \".\")\n \/*\n * We cannot convert the name \".\" to a link count on the mnode,\n * because \".\" does not hold a link count of its own.\n *\/\n return mlinkref();\n\n for (;;) {\n sref<mnode> m = lookup(name);\n if (!m)\n return mlinkref();\n\n scoped_cli cli;\n \/*\n * Retry the lookup, now that we have an sref<mnode>, since\n * we don't want to do lookup's mnode::get() under cli.\n *\/\n u64 inum;\n if (!map_.lookup(name, &inum) || inum != m->inum_)\n \/*\n * The name has either been unlinked or changed to point\n * to another inode. Retry.\n *\/\n continue;\n\n mlinkref ilink(m);\n\n \/*\n * At this point, we know the inode had a non-zero link\n * count prior to the second lookup. Since we are holding\n * cli, refcache cannot advance its epoch, and will not\n * garbage-collect the inode until after we release cli.\n *\n * Mild POSIX violation: an inode can appear to have a\n * zero link count, according to fstat, but get a positive\n * link counter later, because the fstat occurs after the\n * last name has been unlinked, but before we increment\n * the link count here.\n *\/\n\n ilink.acquire();\n\n \/*\n * Mild POSIX violation: an inode can appear to have a\n * link count, according to fstat, that is higher than\n * the number of all its names. For instance, sys_link()\n * first grabs a mlinkref on the existing name, and then\n * drops it if the new name already exists.\n *\/\n\n return ilink;\n }\n }\n\n bool enumerate(const strbuf<DIRSIZ>* prev, strbuf<DIRSIZ>* name) const {\n if (!prev) {\n *name = \".\";\n return true;\n }\n\n if (*prev == \".\")\n prev = nullptr;\n\n return map_.enumerate(prev, name);\n }\n\n bool kill(sref<mnode> parent) {\n if (!map_.remove_and_kill(\"..\", parent->inum_))\n return false;\n\n parent->nlink_.dec();\n return true;\n }\n\n bool killed() const {\n return map_.killed();\n }\n};\n\ninline mdir*\nmnode::as_dir()\n{\n assert(type() == types::dir);\n return static_cast<mdir*>(this);\n}\n\ninline const mdir*\nmnode::as_dir() const\n{\n assert(type() == types::dir);\n return static_cast<const mdir*>(this);\n}\n\n\nclass mfile : public mnode {\nprivate:\n mfile(u64 inum) : mnode(inum), size_(0) {}\n NEW_DELETE_OPS(mfile);\n friend sref<mnode> mnode::get(u64);\n\n struct page_state {\n enum {\n FLAG_LOCK_BIT = 0,\n FLAG_LOCK = 1 << FLAG_LOCK_BIT,\n FLAG_SET = 1 << 1,\n };\n\n page_state() : flags(0) {}\n page_state(sref<page_info> p) : flags(FLAG_SET), pg(p) {}\n\n bool is_set() const {\n return flags & FLAG_SET;\n }\n\n bit_spinlock get_lock() {\n return bit_spinlock(&flags, FLAG_LOCK_BIT);\n }\n\n u64 flags;\n sref<page_info> pg;\n };\n\n enum { maxidx = __SIZE_MAX__ \/ PGSIZE + 1 };\n radix_array<page_state, maxidx, PGSIZE,\n kalloc_allocator<page_state>> pages_;\n\n spinlock resize_lock_;\n seqcount<u32> size_seq_;\n u64 size_;\n\npublic:\n class resizer : public lock_guard<spinlock>,\n public seq_writer {\n private:\n resizer(mfile* mf) : lock_guard<spinlock>(&mf->resize_lock_),\n seq_writer(&mf->size_seq_),\n mf_(mf) {}\n mfile* mf_;\n friend class mfile;\n\n public:\n resizer() : mf_(nullptr) {}\n explicit operator bool () const { return !!mf_; }\n u64 read_size() { return mf_->size_; }\n void resize_nogrow(u64 size);\n void resize_append(u64 size, sref<page_info> pi);\n };\n\n resizer write_size() {\n return resizer(this);\n }\n\n seq_reader<u64> read_size() {\n return seq_reader<u64>(&size_, &size_seq_);\n }\n\n sref<page_info> get_page(u64 pageidx);\n};\n\ninline mfile*\nmnode::as_file()\n{\n assert(type() == types::file);\n return static_cast<mfile*>(this);\n}\n\ninline const mfile*\nmnode::as_file() const\n{\n assert(type() == types::file);\n return static_cast<const mfile*>(this);\n}\n\n\nclass mdev : public mnode {\nprivate:\n mdev(u64 inum) : mnode(inum), major_(0), minor_(0) {}\n NEW_DELETE_OPS(mdev);\n friend sref<mnode> mnode::get(u64);\n\n u16 major_;\n u16 minor_;\n\npublic:\n u16 major() const { return major_; }\n u16 minor() const { return minor_; }\n\n void init(u16 major, u16 minor) {\n assert(!major_ && !minor_);\n major_ = major;\n minor_ = minor;\n }\n};\n\ninline mdev*\nmnode::as_dev()\n{\n assert(type() == types::dev);\n return static_cast<mdev*>(this);\n}\n\ninline const mdev*\nmnode::as_dev() const\n{\n assert(type() == types::dev);\n return static_cast<const mdev*>(this);\n}\n\n\nclass msock : public mnode {\nprivate:\n msock(u64 inum) : mnode(inum), localsock_(nullptr) {}\n NEW_DELETE_OPS(msock);\n friend sref<mnode> mnode::get(u64);\n\n localsock* localsock_;\n\npublic:\n localsock* get_sock() const { return localsock_; }\n\n void init(localsock* ls) {\n assert(!localsock_);\n localsock_ = ls;\n }\n};\n\ninline msock*\nmnode::as_sock()\n{\n assert(type() == types::sock);\n return static_cast<msock*>(this);\n}\n\ninline const msock*\nmnode::as_sock() const\n{\n assert(type() == types::sock);\n return static_cast<const msock*>(this);\n}\n<commit_msg>filecount no longer needed<commit_after>#pragma once\n\n#include \"kernel.hh\"\n#include \"refcache.hh\"\n#include \"chainhash.hh\"\n#include \"radix_array.hh\"\n#include \"page_info.hh\"\n#include \"kalloc.hh\"\n#include \"fs.h\"\n\nclass mdir;\nclass mfile;\nclass mdev;\nclass msock;\n\nclass mnode : public refcache::weak_referenced\n{\npublic:\n struct types {\n enum {\n dir = 1,\n file,\n dev,\n sock,\n };\n };\n\n static sref<mnode> get(u64 n);\n static sref<mnode> alloc(u8 type);\n\n void cache_pin(bool flag);\n u8 type() const;\n\n mdir* as_dir();\n const mdir* as_dir() const;\n mfile* as_file();\n const mfile* as_file() const;\n mdev* as_dev();\n const mdev* as_dev() const;\n msock* as_sock();\n const msock* as_sock() const;\n\n class linkcount : public refcache::referenced {\n public:\n linkcount() : refcache::referenced(0) {};\n void onzero() override;\n };\n\n const u64 inum_;\n linkcount nlink_;\n\nprotected:\n mnode(u64 inum);\n\nprivate:\n void onzero() override;\n\n std::atomic<bool> cache_pin_;\n std::atomic<bool> dirty_;\n std::atomic<bool> valid_;\n};\n\n\/*\n * An mlinkref represents a link count reference on an mnode.\n * The caller must ensure that mlinkref::acquire() is not called\n * after mnode::nlink_ reaches stable zero, perhaps by blocking\n * refcache epochs using cli when looking up the inode number in\n * a directory.\n *\n * Each mlinkref holds a reference to the mnode as well, to ensure\n * that the memory used to store the nlink_ count is not evicted\n * before all of the refcache deltas are flushed. Otherwise this\n * would just be an sref<linkcount>.\n *\/\nclass mlinkref {\npublic:\n mlinkref() {}\n mlinkref(sref<mnode> mref) : m_(mref) {}\n\n sref<mnode> mn() {\n return m_;\n }\n\n bool held() {\n return !!l_;\n }\n\n \/*\n * Increment the link count on the mnode.\n *\/\n void acquire() {\n assert(m_ && !l_);\n l_ = sref<mnode::linkcount>::newref(&m_->nlink_);\n }\n\n \/*\n * Transfer an existing link count on the mnode to this mlinkref.\n *\/\n void transfer() {\n assert(m_ && !l_);\n l_ = sref<mnode::linkcount>::transfer(&m_->nlink_);\n }\n\nprivate:\n \/*\n * The order is important due to C++ constructor\/destructor\n * rules: we must hold the mnode reference while manipulating\n * the linkcount reference.\n *\/\n sref<mnode> m_;\n sref<mnode::linkcount> l_;\n};\n\n\nclass mdir : public mnode {\nprivate:\n mdir(u64 inum) : mnode(inum), map_(257) {}\n NEW_DELETE_OPS(mdir);\n friend sref<mnode> mnode::get(u64);\n\n chainhash<strbuf<DIRSIZ>, u64> map_;\n\npublic:\n bool insert(const strbuf<DIRSIZ>& name, mlinkref* ilink) {\n if (name == \".\")\n return false;\n if (!map_.insert(name, ilink->mn()->inum_))\n return false;\n assert(ilink->held());\n ilink->mn()->nlink_.inc();\n return true;\n }\n\n bool remove(const strbuf<DIRSIZ>& name, sref<mnode> m) {\n if (!map_.remove(name, m->inum_))\n return false;\n m->nlink_.dec();\n return true;\n }\n\n bool replace(const strbuf<DIRSIZ>& name, sref<mnode> mold, mlinkref* ilinknew) {\n if (!map_.replace(name, mold->inum_, ilinknew->mn()->inum_))\n return false;\n assert(ilinknew->held());\n ilinknew->mn()->nlink_.inc();\n mold->nlink_.dec();\n return true;\n }\n\n sref<mnode> lookup(const strbuf<DIRSIZ>& name) const {\n if (name == \".\")\n return mnode::get(inum_);\n\n u64 iprev = -1;\n for (;;) {\n u64 inum;\n if (!map_.lookup(name, &inum))\n return sref<mnode>();\n\n sref<mnode> m = mnode::get(inum);\n if (m)\n return m;\n\n \/*\n * The inode was GCed between the lookup and mnode::get().\n * Retry the lookup. Crash if we repeatedly can't find\n * the same inode (to make such bugs easier to track down).\n *\/\n assert(inum != iprev);\n iprev = inum;\n }\n }\n\n mlinkref lookup_link(const strbuf<DIRSIZ>& name) const {\n if (name == \".\")\n \/*\n * We cannot convert the name \".\" to a link count on the mnode,\n * because \".\" does not hold a link count of its own.\n *\/\n return mlinkref();\n\n for (;;) {\n sref<mnode> m = lookup(name);\n if (!m)\n return mlinkref();\n\n scoped_cli cli;\n \/*\n * Retry the lookup, now that we have an sref<mnode>, since\n * we don't want to do lookup's mnode::get() under cli.\n *\/\n u64 inum;\n if (!map_.lookup(name, &inum) || inum != m->inum_)\n \/*\n * The name has either been unlinked or changed to point\n * to another inode. Retry.\n *\/\n continue;\n\n mlinkref ilink(m);\n\n \/*\n * At this point, we know the inode had a non-zero link\n * count prior to the second lookup. Since we are holding\n * cli, refcache cannot advance its epoch, and will not\n * garbage-collect the inode until after we release cli.\n *\n * Mild POSIX violation: an inode can appear to have a\n * zero link count, according to fstat, but get a positive\n * link counter later, because the fstat occurs after the\n * last name has been unlinked, but before we increment\n * the link count here.\n *\/\n\n ilink.acquire();\n\n \/*\n * Mild POSIX violation: an inode can appear to have a\n * link count, according to fstat, that is higher than\n * the number of all its names. For instance, sys_link()\n * first grabs a mlinkref on the existing name, and then\n * drops it if the new name already exists.\n *\/\n\n return ilink;\n }\n }\n\n bool enumerate(const strbuf<DIRSIZ>* prev, strbuf<DIRSIZ>* name) const {\n if (!prev) {\n *name = \".\";\n return true;\n }\n\n if (*prev == \".\")\n prev = nullptr;\n\n return map_.enumerate(prev, name);\n }\n\n bool kill(sref<mnode> parent) {\n if (!map_.remove_and_kill(\"..\", parent->inum_))\n return false;\n\n parent->nlink_.dec();\n return true;\n }\n\n bool killed() const {\n return map_.killed();\n }\n};\n\ninline mdir*\nmnode::as_dir()\n{\n assert(type() == types::dir);\n return static_cast<mdir*>(this);\n}\n\ninline const mdir*\nmnode::as_dir() const\n{\n assert(type() == types::dir);\n return static_cast<const mdir*>(this);\n}\n\n\nclass mfile : public mnode {\nprivate:\n mfile(u64 inum) : mnode(inum), size_(0) {}\n NEW_DELETE_OPS(mfile);\n friend sref<mnode> mnode::get(u64);\n\n struct page_state {\n enum {\n FLAG_LOCK_BIT = 0,\n FLAG_LOCK = 1 << FLAG_LOCK_BIT,\n FLAG_SET = 1 << 1,\n };\n\n page_state() : flags(0) {}\n page_state(sref<page_info> p) : flags(FLAG_SET), pg(p) {}\n\n bool is_set() const {\n return flags & FLAG_SET;\n }\n\n bit_spinlock get_lock() {\n return bit_spinlock(&flags, FLAG_LOCK_BIT);\n }\n\n u64 flags;\n sref<page_info> pg;\n };\n\n enum { maxidx = __SIZE_MAX__ \/ PGSIZE + 1 };\n radix_array<page_state, maxidx, PGSIZE,\n kalloc_allocator<page_state>> pages_;\n\n spinlock resize_lock_;\n seqcount<u32> size_seq_;\n u64 size_;\n\npublic:\n class resizer : public lock_guard<spinlock>,\n public seq_writer {\n private:\n resizer(mfile* mf) : lock_guard<spinlock>(&mf->resize_lock_),\n seq_writer(&mf->size_seq_),\n mf_(mf) {}\n mfile* mf_;\n friend class mfile;\n\n public:\n resizer() : mf_(nullptr) {}\n explicit operator bool () const { return !!mf_; }\n u64 read_size() { return mf_->size_; }\n void resize_nogrow(u64 size);\n void resize_append(u64 size, sref<page_info> pi);\n };\n\n resizer write_size() {\n return resizer(this);\n }\n\n seq_reader<u64> read_size() {\n return seq_reader<u64>(&size_, &size_seq_);\n }\n\n sref<page_info> get_page(u64 pageidx);\n};\n\ninline mfile*\nmnode::as_file()\n{\n assert(type() == types::file);\n return static_cast<mfile*>(this);\n}\n\ninline const mfile*\nmnode::as_file() const\n{\n assert(type() == types::file);\n return static_cast<const mfile*>(this);\n}\n\n\nclass mdev : public mnode {\nprivate:\n mdev(u64 inum) : mnode(inum), major_(0), minor_(0) {}\n NEW_DELETE_OPS(mdev);\n friend sref<mnode> mnode::get(u64);\n\n u16 major_;\n u16 minor_;\n\npublic:\n u16 major() const { return major_; }\n u16 minor() const { return minor_; }\n\n void init(u16 major, u16 minor) {\n assert(!major_ && !minor_);\n major_ = major;\n minor_ = minor;\n }\n};\n\ninline mdev*\nmnode::as_dev()\n{\n assert(type() == types::dev);\n return static_cast<mdev*>(this);\n}\n\ninline const mdev*\nmnode::as_dev() const\n{\n assert(type() == types::dev);\n return static_cast<const mdev*>(this);\n}\n\n\nclass msock : public mnode {\nprivate:\n msock(u64 inum) : mnode(inum), localsock_(nullptr) {}\n NEW_DELETE_OPS(msock);\n friend sref<mnode> mnode::get(u64);\n\n localsock* localsock_;\n\npublic:\n localsock* get_sock() const { return localsock_; }\n\n void init(localsock* ls) {\n assert(!localsock_);\n localsock_ = ls;\n }\n};\n\ninline msock*\nmnode::as_sock()\n{\n assert(type() == types::sock);\n return static_cast<msock*>(this);\n}\n\ninline const msock*\nmnode::as_sock() const\n{\n assert(type() == types::sock);\n return static_cast<const msock*>(this);\n}\n<|endoftext|>"} {"text":"<commit_before>#include <cv.h>\n#include <highgui.h>\n#include <iostream>\n\nusing namespace cv;\nusing namespace std;\n\nvoid help(){\n cout << \"This is Crative Commons work, do what you like... \" << endl;\n cout << \"Usage: .\/binary <image_name> \" << endl;\n cout << \"Hot keys: \\n\"\n \"\\tr\/R toggle croping \\n\"\n \"\\tc\/C toggle camera \\n\"\n \"\\ts\/S toggle taking screenshoot\\n\"\n \"\\th\/H toggle Hough Transform on screenshot\\n\"\n \"\\te\/E toggle edge detetction \\n\" \n \"\\tt\/T toggle template matching\\n\";\n }\n\nvoid canny_edge();\nvoid cannyTreshold( int, void* );\nvoid cannyTreshold2( int, void* );\nvoid init_camera();\nvoid onMouse( int event, int x, int y, int flags, void* param );\nvoid draw_box( Mat& img, Rect rect );\nvoid crop_image( Mat& img, Rect rect );\nvoid match_template_on_crop( int match_method, Mat& templ );\nvoid getPoints( int event, int x, int y, int flags, void* param );\nvoid savePoint( int x, int y );\nvoid callHoughTransform( Mat& img, Rect rect );\n\nMat temp, mat_image, gray_image, frame, ss;\nMat templ, result, imgRoi, imgRoi2;\nMat dst, detected_edges;\n\nPoint pt1, pt2, pt3, pt4;\nint n;\nRect box, box2;\nbool drawing_box = false;\nchar ** global_argv;\nint match_method = 0;\nint lowThreshold;\nint ratio = 3;\nint const max_lowThreshold = 100;\n\nint main(int argc, char** argv) {\n help();\n global_argv = argv;\n \n if (argc < 2) {\n cout << \" Usage: \"<< argv[0] <<\" <image> \" << endl;\n return -1;\n }\n\n char* imageName = argv[1];\n mat_image = imread( imageName, CV_LOAD_IMAGE_COLOR);\n \n if( !mat_image.data ) {\n cout << \" Could not open or find the image\" << endl;\n return -1;\n }\n\n while ( 1 ){\n namedWindow( imageName, CV_WINDOW_AUTOSIZE );\n imshow( imageName, mat_image );\n\n char c = waitKey(10);\n switch( c )\n {\n case 27:\n cout << \"Exiting ... \\n \";\n return 0;\n case 'e':\n canny_edge();\n break;\n case 'E':\n destroyWindow(\"canny edge\");\n break;\n case 'r':\n cout << \"Setting callback, calling crop_image ...\\n\";\n setMouseCallback( imageName, onMouse, (void*)&mat_image );\n break;\n case 'R':\n destroyWindow( \"ImgROI\" );\n break;\n case 'c':\n init_camera();\n break;\n case 't':\n match_template_on_crop( 2, imgRoi );\n break;\n case 'T':\n destroyWindow( \"source\" );\n destroyWindow( \"result\" );\n break;\n case 'S':\n destroyWindow( \"snapshot\" );\n break;\n case 'h':\n callHoughTransform( ss, box2 );\n break;\n }\n }\n\n return 0;\n}\n\nvoid onMouse( int event, int x, int y, int flags, void* param ) {\n Mat& image = *(Mat*) param;\n switch( event )\n {\n case CV_EVENT_LBUTTONDOWN:\n drawing_box = true;\n box = Rect(x, y, 0, 0);\n break;\n case CV_EVENT_MOUSEMOVE: \n if( drawing_box ) {\n box.width = x-box.x;\n box.height = y-box.y;\n }\n break;\n case CV_EVENT_LBUTTONUP: \n drawing_box = false;\n if( box.width<0 ) {\n box.x+=box.width;\n box.width *= -1;\n }\n if( box.height<0 ) {\n box.y+=box.height;\n box.height*=-1;\n }\n cout << \"box coordinates \\n\" \n << \"x\\t y\\t height\\t width\\n\"\n << box.x << \"\\t\" << box.y << \"\\t\" \n << box.height << \"\\t\" << box.width << \"\\n\";\n crop_image( image, box);\n draw_box( image, box );\n break;\n }\n} \n\nvoid draw_box( Mat& img, Rect rect ){\n rectangle( img, rect.tl(), rect.br(), Scalar(0,0,255));\n}\n\nvoid crop_image( Mat& img, Rect rect ){\n imgRoi = img( rect );\n namedWindow( \"ImgROI\", CV_WINDOW_AUTOSIZE );\n imshow( \"ImgROI\", imgRoi );\n \/* gornji kod kopira samo header u imgRoi\n * ako treba kopirat i sliku moze se ovako:\n imgRoi.copyTo(temp);\n namedWindow( \"temp\", CV_WINDOW_AUTOSIZE );\n imshow( \"temp\", temp );\n *\/\n}\n\nvoid canny_edge(){\n cout << \"calling canny... \\n\";\n cvtColor( mat_image, gray_image, CV_RGB2GRAY);\n namedWindow( \"canny edge\", CV_WINDOW_AUTOSIZE);\n createTrackbar( \"Min Treshold: \", \"canny edge\", &lowThreshold, max_lowThreshold, cannyTreshold );\n}\n\nvoid cannyTreshold( int, void* ){\n Canny( gray_image, detected_edges, lowThreshold, lowThreshold*ratio, 3 );\n dst = Scalar::all(0);\n gray_image.copyTo( dst, detected_edges);\n imshow( \"canny edge\", dst);\n}\n\nvoid init_camera(){\n cout << \"Starting camera mode... \\n\";\n VideoCapture cap(0);\n if( !cap.isOpened() ){\n cerr << \"fail preko default camere \\n\";\n cout << \"isprobavam argv2 \" \n << global_argv[2] << endl;\n cap.open( global_argv[2] );\n if( !cap.isOpened() ){\n cerr << \"fail i preko argv[2] \\n\";\n }\n }\n while( 1 ){\n cap >> frame;\n if(!frame.data) break;\n namedWindow( \"camera\", CV_WINDOW_AUTOSIZE );\n imshow( \"camera\", frame );\n char c = waitKey(10);\n if( c == 'C' ){\n destroyWindow(\"camera\");\n break;\n }\n switch ( c ) {\n case 's':\n frame.copyTo( ss );\n namedWindow( \"snapshot\", CV_WINDOW_AUTOSIZE );\n imshow( \"snapshot\", ss );\n cout << \" Setting MouseCallback getPoints \" << endl;\n setMouseCallback( \"snapshot\", getPoints, 0 );\n break;\n }\n }\n}\n\nvoid match_template_on_crop( int match_method, Mat& templ ){\n \/\/\/ Source image to display\n Mat img_display;\n mat_image.copyTo( img_display );\n\n \/\/\/ Create the result matrix\n int result_cols = mat_image.cols - templ.cols + 1;\n int result_rows = mat_image.rows - templ.rows + 1; \n\n result.create( result_cols, result_rows, CV_32FC1 );\n\n \/\/\/ Do the Matching and Normalize\n matchTemplate( mat_image, templ, result, match_method );\n normalize( result, result, 0, 1, NORM_MINMAX, -1, Mat() );\n\n \/\/\/ Localizing the best match with minMaxLoc\n double minVal; double maxVal; Point minLoc; Point maxLoc;\n Point matchLoc;\n\n minMaxLoc( result, &minVal, &maxVal, &minLoc, &maxLoc, Mat() );\n\n \/\/\/ For SQDIFF and SQDIFF_NORMED, the best matches are lower values. For all the other methods, the higher the better\n if( match_method == CV_TM_SQDIFF || match_method == CV_TM_SQDIFF_NORMED )\n { matchLoc = minLoc; }\n else \n { matchLoc = maxLoc; }\n\n \/\/\/ Show me what you got\n rectangle( img_display, matchLoc, Point( matchLoc.x + templ.cols , matchLoc.y + templ.rows ), Scalar::all(0), 2, 8, 0 ); \n rectangle( result, matchLoc, Point( matchLoc.x + templ.cols , matchLoc.y + templ.rows ), Scalar::all(0), 2, 8, 0 ); \n\n namedWindow( \"source\", CV_WINDOW_AUTOSIZE );\n namedWindow( \"result\", CV_WINDOW_AUTOSIZE );\n imshow( \"source\", img_display );\n imshow( \"result\", result );\n}\n\nvoid savePoint( int x, int y ){\n n++;\n if ( n == 1 ){\n pt1.x = x;\n pt1.y = y;\n cout << pt1.x << \" \" << pt1.y << endl;\n }\n if ( n == 2 ){ \n pt2.x = x;\n pt2.y = y;\n cout << pt2.x << \" \" << pt2.y << endl;\n }\n if ( n == 3 ){ \n pt3.x = x;\n pt3.y = y;\n cout << pt3.x << \" \" << pt3.y << endl;\n }\n if ( n == 4 ){ \n pt4.x = x;\n pt4.y = y;\n box2.x = pt1.x;\n box2.y = pt1.y;\n box2.width = pt4.x - box2.x;\n box2.height = pt4.y - box2.y;\n cout << pt4.x << \" \" << pt4.y << endl;\n cout << box2.width << \" \" << box2.height << endl;\n }\n}\n\nvoid getPoints( int event, int x, int y, int flags, void* param ) {\n switch( event ) {\n case CV_EVENT_LBUTTONDOWN:\n break;\n case CV_EVENT_LBUTTONUP:\n savePoint( x, y );\n break;\n }\n}\nvoid cannyTreshold2( int, void* ){\n Canny( temp, detected_edges, lowThreshold, lowThreshold*ratio, 3 );\n dst = Scalar::all(0);\n imgRoi2.copyTo( dst, detected_edges);\n imshow( \"imageRoi2\", dst);\n}\n\nvoid callHoughTransform( Mat& img, Rect rect ){\n imgRoi2 = img( rect );\n cvtColor( imgRoi2, temp, CV_RGB2GRAY);\n namedWindow( \"imageRoi2\", CV_WINDOW_AUTOSIZE);\n createTrackbar( \"Min Treshold: \", \"imageRoi2\", &lowThreshold, max_lowThreshold, cannyTreshold2 );\n\n\/* cvtColor( imgRoi2, temp, CV_RGB2GRAY );\n Canny( temp, temp, 50, 100, 3 );\n namedWindow( \"ImgRoi2\", CV_WINDOW_AUTOSIZE );\n imshow( \"ImgRoi2\", temp ); *\/\n vector<Vec2f> lines;\n HoughLines(temp, lines, 1, CV_PI\/180, 100, 0, 0 );\n \/*\n temp: Output of the edge detector. \n lines: A vector that will store the parameters (r,\\theta) of the detected lines\n rho : The resolution of the parameter r in pixels. We use 1 pixel.\n theta: The resolution of the parameter \\theta in radians. We use 1 degree (CV_PI\/180)\n threshold: The minimum number of intersections to “detect” a line\n srn and stn: Default parameters to zero. Check OpenCV reference for more info.\n *\/ \n \/\/ izvuci prvu linija, koja bi trebala vektor od dva elementa\n \/\/ ro'' i theta\n \/\/ prebacit ro u k.s. slike a ne ROI ro=ro'' +pt1.x*cos theta + \n \/\/ +pt1.y*sin theta\n \/\/ findExtrinsci, predat xml, vraca R koji treba konvertirit u 3*3 pogledi rodrigez, \n \/\/ pomonzit R i P(iz xml, camera matrix) jedanko A\n \/\/ pomnozit t i P dobijemo B\n \/\/ dobijemo lamde\n \/\/ \n \/\/ \n\/* Mat cdst;\n imgRoi2.copyTo( cdst );\n for( size_t i = 0; i < lines.size(); i++ )\n {\n float rho2 = lines[i][0], theta = lines[i][1];\n Point pt1, pt2;\n double a = cos(theta), b = sin(theta);\n double x0 = a*rho2, y0 = b*rho2;\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( cdst, pt1, pt2, Scalar(0,0,255), 3, CV_AA);\n }\n imshow(\"detected lines\", cdst);\n\/*\n float rho_crtano = lines[0][0], theta = lines[0][1];\n float rho; \n rho = rho_crtano + pt1.x * cos( theta ) + pt1.y * sin( theta );\n\n \n FileStorage fs(\"calib\/cam.xml\", FileStorage::READ);\n cout << \"procitao \" << endl;\n Mat intrinsics, distortion;\n fs[\"camera_matrix\"] >> intrinsics; \/\/3*3\n fs[\"distortion_coefficients\"] >> distortion; \/\/4*1, kod mene 5*1\n*\/\n \n}\n<commit_msg>dodani object i image points<commit_after>#include <cv.h>\n#include <highgui.h>\n#include <iostream>\n\nusing namespace cv;\nusing namespace std;\n\nvoid help(){\n cout << \"This is Crative Commons work, do what you like... \" << endl;\n cout << \"Usage: .\/binary <image_name> \" << endl;\n cout << \"Hot keys: \\n\"\n \"\\tr\/R toggle croping \\n\"\n \"\\tc\/C toggle camera \\n\"\n \"\\ts\/S toggle taking screenshoot\\n\"\n \"\\th\/H toggle Hough Transform on screenshot\\n\"\n \"\\te\/E toggle edge detetction \\n\" \n \"\\tt\/T toggle template matching\\n\";\n }\n\nvoid canny_edge();\nvoid cannyTreshold( int, void* );\nvoid cannyTreshold2( int, void* );\nvoid init_camera();\nvoid onMouse( int event, int x, int y, int flags, void* param );\nvoid draw_box( Mat& img, Rect rect );\nvoid crop_image( Mat& img, Rect rect );\nvoid match_template_on_crop( int match_method, Mat& templ );\nvoid getPoints( int event, int x, int y, int flags, void* param );\nvoid savePoint( int x, int y );\nvoid callHoughTransform( );\nvoid cannyForHT( Mat& img, Rect rect );\n\nMat temp, mat_image, gray_image, frame, ss;\nMat templ, result, imgRoi, imgRoi2;\nMat dst, detected_edges;\n\nPoint pt1, pt2, pt3, pt4;\nvector<Point2f> imagePoints(4);\nint n;\nRect box, box2;\nbool drawing_box = false;\nchar ** global_argv;\nint match_method = 0;\nint lowThreshold;\nint ratio = 3;\nint const max_lowThreshold = 100;\n\nint main(int argc, char** argv) {\n help();\n global_argv = argv;\n \n if (argc < 2) {\n cout << \" Usage: \"<< argv[0] <<\" <image> \" << endl;\n return -1;\n }\n\n char* imageName = argv[1];\n mat_image = imread( imageName, CV_LOAD_IMAGE_COLOR);\n \n if( !mat_image.data ) {\n cout << \" Could not open or find the image\" << endl;\n return -1;\n }\n\n while ( 1 ){\n namedWindow( imageName, CV_WINDOW_AUTOSIZE );\n imshow( imageName, mat_image );\n\n char c = waitKey(10);\n switch( c )\n {\n case 27:\n cout << \"Exiting ... \\n \";\n return 0;\n case 'e':\n canny_edge();\n break;\n case 'E':\n destroyWindow(\"canny edge\");\n break;\n case 'r':\n cout << \"Setting callback, calling crop_image ...\\n\";\n setMouseCallback( imageName, onMouse, (void*)&mat_image );\n break;\n case 'R':\n destroyWindow( \"ImgROI\" );\n break;\n case 'c':\n init_camera();\n break;\n case 't':\n match_template_on_crop( 2, imgRoi );\n break;\n case 'T':\n destroyWindow( \"source\" );\n destroyWindow( \"result\" );\n break;\n case 'S':\n destroyWindow( \"snapshot\" );\n break;\n case 'h':\n cannyForHT( ss, box2 );\n \/\/callHoughTransform( ss, box2 );\n break;\n case 'H':\n callHoughTransform( );\n break;\n }\n }\n\n return 0;\n}\n\nvoid onMouse( int event, int x, int y, int flags, void* param ) {\n Mat& image = *(Mat*) param;\n switch( event )\n {\n case CV_EVENT_LBUTTONDOWN:\n drawing_box = true;\n box = Rect(x, y, 0, 0);\n break;\n case CV_EVENT_MOUSEMOVE: \n if( drawing_box ) {\n box.width = x-box.x;\n box.height = y-box.y;\n }\n break;\n case CV_EVENT_LBUTTONUP: \n drawing_box = false;\n if( box.width<0 ) {\n box.x+=box.width;\n box.width *= -1;\n }\n if( box.height<0 ) {\n box.y+=box.height;\n box.height*=-1;\n }\n cout << \"box coordinates \\n\" \n << \"x\\t y\\t height\\t width\\n\"\n << box.x << \"\\t\" << box.y << \"\\t\" \n << box.height << \"\\t\" << box.width << \"\\n\";\n crop_image( image, box);\n draw_box( image, box );\n break;\n }\n} \n\nvoid draw_box( Mat& img, Rect rect ){\n rectangle( img, rect.tl(), rect.br(), Scalar(0,0,255));\n}\n\nvoid crop_image( Mat& img, Rect rect ){\n imgRoi = img( rect );\n namedWindow( \"ImgROI\", CV_WINDOW_AUTOSIZE );\n imshow( \"ImgROI\", imgRoi );\n \/* gornji kod kopira samo header u imgRoi\n * ako treba kopirat i sliku moze se ovako:\n imgRoi.copyTo(temp);\n namedWindow( \"temp\", CV_WINDOW_AUTOSIZE );\n imshow( \"temp\", temp );\n *\/\n}\n\nvoid canny_edge(){\n cout << \"calling canny... \\n\";\n cvtColor( mat_image, gray_image, CV_RGB2GRAY);\n namedWindow( \"canny edge\", CV_WINDOW_AUTOSIZE);\n createTrackbar( \"Min Treshold: \", \"canny edge\", &lowThreshold, max_lowThreshold, cannyTreshold );\n}\n\nvoid cannyTreshold( int, void* ){\n Canny( gray_image, detected_edges, lowThreshold, lowThreshold*ratio, 3 );\n dst = Scalar::all(0);\n gray_image.copyTo( dst, detected_edges);\n imshow( \"canny edge\", dst);\n}\n\nvoid init_camera(){\n cout << \"Starting camera mode... \\n\";\n VideoCapture cap(0);\n if( !cap.isOpened() ){\n cerr << \"fail preko default camere \\n\";\n cout << \"isprobavam argv2 \" \n << global_argv[2] << endl;\n cap.open( global_argv[2] );\n if( !cap.isOpened() ){\n cerr << \"fail i preko argv[2] \\n\";\n }\n }\n while( 1 ){\n cap >> frame;\n if(!frame.data) break;\n namedWindow( \"camera\", CV_WINDOW_AUTOSIZE );\n imshow( \"camera\", frame );\n char c = waitKey(10);\n if( c == 'C' ){\n destroyWindow(\"camera\");\n break;\n }\n switch ( c ) {\n case 's':\n frame.copyTo( ss );\n namedWindow( \"snapshot\", CV_WINDOW_AUTOSIZE );\n imshow( \"snapshot\", ss );\n cout << \" Setting MouseCallback getPoints \" << endl;\n setMouseCallback( \"snapshot\", getPoints, 0 );\n break;\n }\n }\n}\n\nvoid match_template_on_crop( int match_method, Mat& templ ){\n \/\/\/ Source image to display\n Mat img_display;\n mat_image.copyTo( img_display );\n\n \/\/\/ Create the result matrix\n int result_cols = mat_image.cols - templ.cols + 1;\n int result_rows = mat_image.rows - templ.rows + 1; \n\n result.create( result_cols, result_rows, CV_32FC1 );\n\n \/\/\/ Do the Matching and Normalize\n matchTemplate( mat_image, templ, result, match_method );\n normalize( result, result, 0, 1, NORM_MINMAX, -1, Mat() );\n\n \/\/\/ Localizing the best match with minMaxLoc\n double minVal; double maxVal; Point minLoc; Point maxLoc;\n Point matchLoc;\n\n minMaxLoc( result, &minVal, &maxVal, &minLoc, &maxLoc, Mat() );\n\n \/\/\/ For SQDIFF and SQDIFF_NORMED, the best matches are lower values. For all the other methods, the higher the better\n if( match_method == CV_TM_SQDIFF || match_method == CV_TM_SQDIFF_NORMED )\n { matchLoc = minLoc; }\n else \n { matchLoc = maxLoc; }\n\n \/\/\/ Show me what you got\n rectangle( img_display, matchLoc, Point( matchLoc.x + templ.cols , matchLoc.y + templ.rows ), Scalar::all(0), 2, 8, 0 ); \n rectangle( result, matchLoc, Point( matchLoc.x + templ.cols , matchLoc.y + templ.rows ), Scalar::all(0), 2, 8, 0 ); \n\n namedWindow( \"source\", CV_WINDOW_AUTOSIZE );\n namedWindow( \"result\", CV_WINDOW_AUTOSIZE );\n imshow( \"source\", img_display );\n imshow( \"result\", result );\n}\n\nvoid savePoint( int x, int y ){\n n++;\n if ( n == 1 ){\n pt1.x = x;\n pt1.y = y;\n imagePoints[0] = Point2f( x, y );\n cout << pt1.x << \" \" << pt1.y << endl;\n }\n if ( n == 2 ){ \n pt2.x = x;\n pt2.y = y;\n imagePoints[1] = Point2f( x, y );\n cout << pt2.x << \" \" << pt2.y << endl;\n }\n if ( n == 3 ){ \n pt3.x = x;\n pt3.y = y;\n imagePoints[2] = Point2f( x, y );\n cout << pt3.x << \" \" << pt3.y << endl;\n }\n if ( n == 4 ){ \n pt4.x = x;\n pt4.y = y;\n imagePoints[3] = Point2f( x, y );\n box2.x = pt1.x;\n box2.y = pt1.y;\n box2.width = pt4.x - box2.x;\n box2.height = pt4.y - box2.y;\n cout << pt4.x << \" \" << pt4.y << endl;\n cout << box2.width << \" \" << box2.height << endl;\n }\n}\n\nvoid getPoints( int event, int x, int y, int flags, void* param ) {\n switch( event ) {\n case CV_EVENT_LBUTTONDOWN:\n break;\n case CV_EVENT_LBUTTONUP:\n savePoint( x, y );\n break;\n }\n}\nvoid cannyTreshold2( int, void* ){\n Canny( temp, detected_edges, lowThreshold, lowThreshold*ratio, 3 );\n dst = Scalar::all(0);\n temp.copyTo( dst, detected_edges);\n imshow( \"imageRoi2\", dst);\n}\n\nvoid cannyForHT( Mat& img, Rect rect ){\n imgRoi2 = img( rect );\n cvtColor( imgRoi2, temp, CV_RGB2GRAY);\n namedWindow( \"imageRoi2\", CV_WINDOW_AUTOSIZE);\n createTrackbar( \"Min Treshold: \", \"imageRoi2\", &lowThreshold, max_lowThreshold, cannyTreshold2 );\n}\n\n\nvoid callHoughTransform( ){\n vector<Vec2f> lines;\n HoughLines( temp, lines, 1, CV_PI\/180, 100, 0, 0 );\n \/\/ temp nije output edge detectora, treba izmjeniti\n \/*\n temp: Output of the edge detector. \n lines: A vector that will store the parameters (r,\\theta) of the detected lines\n *\/ \n \/\/ izvuci prvu linija, koja bi trebala vektor od dva elementa\n \/\/ ro'' i theta\n \/\/ prebacit ro u k.s. slike a ne ROI ro=ro'' +pt1.x*cos theta + \n \/\/ +pt1.y*sin theta\n \/\/ findExtrinsci, predat xml, vraca R koji treba konvertirit u 3*3 pogledi rodrigez, \n \/\/ pomonzit R i P(iz xml, camera matrix) jedanko A\n \/\/ pomnozit t i P dobijemo B\n \/\/ dobijemo lamde\n \/\/ \n float rho, rho_roi, theta;\n rho_roi= lines[0][0];\n theta = lines[0][1];\n \/\/ prebacivanje u k.s. slike\n rho = rho_roi + pt1.x * cos( theta ) + pt1.y * sin( theta );\n \n \/\/ ucitavanje \n FileStorage fs(\"calib\/cam.xml\", FileStorage::READ);\n cout << \"procitao \" << rho << \" \" << theta << endl;\n Mat intrinsics, distortion;\n fs[\"camera_matrix\"] >> intrinsics; \/\/3*3\n fs[\"distortion_coefficients\"] >> distortion; \/\/4*1, kod mene 5*1\n cout << \"idemo dalj\" << endl;\n\n vector<Point3f> objectPoints(4);\n objectPoints[0] = Point3f( 0, 0, 0 );\n objectPoints[1] = Point3f( 0, 0, 0 );\n objectPoints[2] = Point3f( 0, 0, 0 );\n objectPoints[3] = Point3f( 0, 0, 0 );\n cout << \"A vector of 3D Object Points = \" << objectPoints << endl << endl;\n cout << \"A vector of 2D Image Points = \" << imagePoints << endl << endl;\n\n \/\/cvFindExtrinsicCameraParams2() je zamjenjen s solvePnP()\n \/\/solvePnP(Mat(objectPoints), Mat(imagePoints), intrinsics, distortion, rvec, tvec, false);\n \n}\n<|endoftext|>"} {"text":"<commit_before>#include \"connection_manager.hpp\"\n#include \"karabiner_version.h\"\n#include \"logger.hpp\"\n\nint main(int argc, const char* argv[]) {\n signal(SIGUSR1, SIG_IGN);\n signal(SIGUSR2, SIG_IGN);\n\n logger::get_logger().info(\"version {0}\", karabiner_version);\n\n connection_manager manager;\n\n CFRunLoopRun();\n return 0;\n}\n<commit_msg>create configuration directory at launch<commit_after>#include \"connection_manager.hpp\"\n#include \"karabiner_version.h\"\n#include \"logger.hpp\"\n#include \"constants.hpp\"\n\nint main(int argc, const char* argv[]) {\n signal(SIGUSR1, SIG_IGN);\n signal(SIGUSR2, SIG_IGN);\n\n logger::get_logger().info(\"version {0}\", karabiner_version);\n\n mkdir(constants::get_configuration_directory(), 0700);\n\n connection_manager manager;\n\n CFRunLoopRun();\n return 0;\n}\n<|endoftext|>"} {"text":"<commit_before>#include <iostream>\n#include <boost\/filesystem.hpp>\n#include <boost\/regex.hpp>\n#include <utils\/LibCvTools\/random_generator.hpp>\n#include <vector>\n#include <set>\n\nnamespace files {\n\ninline bool create_on_check(const std::string &path)\n{\n if(!boost::filesystem3::exists(path)) {\n std::cout << \"Directory is not existing, therefore creating it as sub dir!\" << std::endl;\n if(!boost::filesystem3::create_directories(path)) {\n std::cerr << \"Cannot create directory '\" << path << \"' !\" << std::endl;\n return false;\n }\n }\n return true;\n}\n\ninline bool read_yml_img(const std::string &path, std::vector<std::string> &imgs, std::vector<std::string> &ymls)\n{\n boost::regex e_yaml(\".*\\\\.(yml)\");\n boost::regex e_jpg(\".*\\\\.(jpg)\");\n if(boost::filesystem3::is_directory(path)) {\n boost::filesystem3::directory_iterator end_iter;\n for(boost::filesystem3::directory_iterator dir_itr( path ); dir_itr != end_iter; ++dir_itr) {\n try {\n boost::cmatch what;\n if (boost::filesystem3::is_regular_file( dir_itr->status())) {\n std::string current = dir_itr->path().string();\n if(boost::regex_match(current.c_str(), what, e_yaml) && what[0].matched) {\n ymls.push_back(current);\n }\n if(boost::regex_match(current.c_str(), what, e_jpg) && what[0].matched) {\n imgs.push_back(current);\n }\n }\n }\n catch ( const std::exception & ex ){\n std::cerr << dir_itr->path().filename() << \" \" << ex.what() << std::endl;\n }\n }\n }\n\n return imgs.size() > 0 && imgs.size() == ymls.size();\n}\n\n}\n\nint main(int argc, char *argv[])\n{\n std::string path = boost::filesystem3::current_path().string();\n\n if(argc < 3 ) {\n std::cout << \"Arguments : [<src path>] <train set> <validation set>\" << std::endl;\n return 1;\n }\n\n std::string path_train = argv[1];\n std::string path_valid = argv[2];\n if(argc == 4) {\n path = argv[1];\n path_train = argv[2];\n path_valid = argv[3];\n }\n\n if(path_train == \"\" || path_valid == \"\") {\n std::cerr << \"Path length was 0 !\" << std::endl;\n return 1;\n }\n\n if(path_train[path_train.length() - 1] != '\/')\n path_train += '\/';\n\n if(path_valid[path_valid.length() - 1] != '\/')\n path_valid += '\/';\n\n if(!files::create_on_check(path_train))\n return 1;\n if(!files::create_on_check(path_valid))\n return 1;\n\n std::vector<std::string> img_paths;\n std::vector<std::string> yml_paths;\n if(!files::read_yml_img(path, img_paths, yml_paths) || yml_paths.size() == 0 || img_paths.size() == 0) {\n std::cerr << \"Directory not readable, no files given or the amount of .yml and .img files is not matching!\" << std::endl;\n if(yml_paths.size() == 0) {\n std::cerr << \"No yml paths found !\" << std::endl;\n }\n\n if(img_paths.size() == 0) {\n std::cout << \"No images where found!\" << std::endl;\n }\n return 1;\n }\n\n std::sort(yml_paths.begin(), yml_paths.end());\n std::sort(img_paths.begin(), img_paths.end());\n\n \/\/\/ SAMPLE 30% TRAIN DATA AND 70% VALIDATION DATA\n\n std::set<int> sample_indeces;\n int sample_elements = .3 * img_paths.size();\n RandomGeneratorInt generator(0, img_paths.size() - 1);\n while(sample_indeces.size() < sample_elements) {\n sample_indeces.insert(generator.generate());\n }\n\n std::vector<std::string> train_images;\n for(std::set<int>::iterator it = sample_indeces.begin() ; it != sample_indeces.end() ; ++it) {\n train_images.push_back(img_paths[*it]);\n }\n\n for(std::set<int>::iterator it = sample_indeces.begin() ; it != sample_indeces.end() ; ++it) {\n img_paths.erase(img_paths.begin() + *it);\n yml_paths.erase(yml_paths.begin() + *it);\n }\n\n\n \/\/\/ DO THE COPY STUFF\n \/\/\/ TRAIN\n for(std::vector<std::string>::iterator it = train_images.begin() ; it != train_images.end() ; ++it) {\n boost::filesystem3::path src(*it);\n boost::filesystem3::path dst(path_train + src.filename().string());\n boost::filesystem3::copy_file(src, dst, boost::filesystem3::copy_option::overwrite_if_exists);\n }\n\n for(int i = 0 ; i < img_paths.size() ; ++i) {\n boost::filesystem3::path src_img(img_paths[i]);\n boost::filesystem3::path src_yml(yml_paths[i]);\n boost::filesystem3::path dst_img(path_valid + src_img.filename().string());\n boost::filesystem3::path dst_yml(path_valid + src_yml.filename().string());\n boost::filesystem3::copy_file(src_img, dst_img, boost::filesystem3::copy_option::overwrite_if_exists);\n boost::filesystem3::copy_file(src_yml, dst_yml, boost::filesystem3::copy_option::overwrite_if_exists);\n\n }\n\n std::cout << \"Sets were generated!\" << std::endl;\n return 0;\n}\n\n<commit_msg>fix<commit_after>#include <iostream>\n#include <boost\/filesystem.hpp>\n#include <boost\/regex.hpp>\n#include <utils\/LibCvTools\/random_generator.hpp>\n#include <vector>\n#include <set>\n\nnamespace files {\n\ninline bool create_on_check(const std::string &path)\n{\n if(!boost::filesystem3::exists(path)) {\n std::cout << \"Directory is not existing, therefore creating it as sub dir!\" << std::endl;\n if(!boost::filesystem3::create_directories(path)) {\n std::cerr << \"Cannot create directory '\" << path << \"' !\" << std::endl;\n return false;\n }\n }\n return true;\n}\n\ninline bool read_yml_img(const std::string &path, std::vector<std::string> &imgs, std::vector<std::string> &ymls)\n{\n boost::regex e_yaml(\".*\\\\.(yml)\");\n boost::regex e_jpg(\".*\\\\.(jpg)\");\n if(boost::filesystem3::is_directory(path)) {\n boost::filesystem3::directory_iterator end_iter;\n for(boost::filesystem3::directory_iterator dir_itr( path ); dir_itr != end_iter; ++dir_itr) {\n try {\n boost::cmatch what;\n if (boost::filesystem3::is_regular_file( dir_itr->status())) {\n std::string current = dir_itr->path().string();\n if(boost::regex_match(current.c_str(), what, e_yaml) && what[0].matched) {\n ymls.push_back(current);\n }\n if(boost::regex_match(current.c_str(), what, e_jpg) && what[0].matched) {\n imgs.push_back(current);\n }\n }\n }\n catch ( const std::exception & ex ){\n std::cerr << dir_itr->path().filename() << \" \" << ex.what() << std::endl;\n }\n }\n }\n\n return imgs.size() > 0 && imgs.size() == ymls.size();\n}\n\n}\n\nint main(int argc, char *argv[])\n{\n std::string path = boost::filesystem3::current_path().string();\n\n if(argc < 3 ) {\n std::cout << \"Arguments : [<src path>] <train set> <validation set>\" << std::endl;\n return 1;\n }\n\n std::string path_train = argv[1];\n std::string path_valid = argv[2];\n if(argc == 4) {\n path = argv[1];\n path_train = argv[2];\n path_valid = argv[3];\n }\n\n if(path_train == \"\" || path_valid == \"\") {\n std::cerr << \"Path length was 0 !\" << std::endl;\n return 1;\n }\n\n if(path_train[path_train.length() - 1] != '\/')\n path_train += '\/';\n\n if(path_valid[path_valid.length() - 1] != '\/')\n path_valid += '\/';\n\n if(!files::create_on_check(path_train))\n return 1;\n if(!files::create_on_check(path_valid))\n return 1;\n\n std::vector<std::string> img_paths;\n std::vector<std::string> yml_paths;\n if(!files::read_yml_img(path, img_paths, yml_paths) || yml_paths.size() == 0 || img_paths.size() == 0) {\n std::cerr << \"Directory not readable, no files given or the amount of .yml and .img files is not matching!\" << std::endl;\n if(yml_paths.size() == 0) {\n std::cerr << \"No yml paths found !\" << std::endl;\n }\n\n if(img_paths.size() == 0) {\n std::cout << \"No images where found!\" << std::endl;\n }\n return 1;\n }\n\n std::sort(yml_paths.begin(), yml_paths.end());\n std::sort(img_paths.begin(), img_paths.end());\n\n \/\/\/ SAMPLE 70% TRAIN DATA AND 30% VALIDATION DATA\n\n std::set<int> sample_indeces;\n int sample_elements = .3 * img_paths.size();\n RandomGeneratorInt generator(0, img_paths.size() - 1);\n while(sample_indeces.size() < sample_elements) {\n sample_indeces.insert(generator.generate());\n }\n\n std::vector<std::string> train_images;\n for(std::set<int>::iterator it = sample_indeces.begin() ; it != sample_indeces.end() ; ++it) {\n train_images.push_back(img_paths[*it]);\n }\n\n for(std::set<int>::iterator it = sample_indeces.begin() ; it != sample_indeces.end() ; ++it) {\n img_paths.erase(img_paths.begin() + *it);\n yml_paths.erase(yml_paths.begin() + *it);\n }\n\n\n \/\/\/ DO THE COPY STUFF\n \/\/\/ TRAIN\n for(std::vector<std::string>::iterator it = train_images.begin() ; it != train_images.end() ; ++it) {\n boost::filesystem3::path src(*it);\n boost::filesystem3::path dst(path_train + src.filename().string());\n boost::filesystem3::copy_file(src, dst, boost::filesystem3::copy_option::overwrite_if_exists);\n }\n\n for(int i = 0 ; i < img_paths.size() ; ++i) {\n boost::filesystem3::path src_img(img_paths[i]);\n boost::filesystem3::path src_yml(yml_paths[i]);\n boost::filesystem3::path dst_img(path_valid + src_img.filename().string());\n boost::filesystem3::path dst_yml(path_valid + src_yml.filename().string());\n boost::filesystem3::copy_file(src_img, dst_img, boost::filesystem3::copy_option::overwrite_if_exists);\n boost::filesystem3::copy_file(src_yml, dst_yml, boost::filesystem3::copy_option::overwrite_if_exists);\n\n }\n\n std::cout << \"Sets were generated!\" << std::endl;\n return 0;\n}\n\n<|endoftext|>"} {"text":"<commit_before>\/\/===-- X86TargetMachine.cpp - Define TargetMachine for the X86 -----------===\/\/\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 defines the X86 specific subclass of TargetMachine.\n\/\/\n\/\/===----------------------------------------------------------------------===\/\/\n\n#include \"X86TargetMachine.h\"\n#include \"X86.h\"\n#include \"llvm\/Module.h\"\n#include \"llvm\/PassManager.h\"\n#include \"llvm\/CodeGen\/IntrinsicLowering.h\"\n#include \"llvm\/CodeGen\/MachineFunction.h\"\n#include \"llvm\/CodeGen\/Passes.h\"\n#include \"llvm\/Target\/TargetOptions.h\"\n#include \"llvm\/Target\/TargetMachineRegistry.h\"\n#include \"llvm\/Transforms\/Scalar.h\"\n#include \"llvm\/Support\/CommandLine.h\"\n#include \"llvm\/ADT\/Statistic.h\"\nusing namespace llvm;\n\nX86VectorEnum llvm::X86Vector = NoSSE;\n\n\/\/\/ X86TargetMachineModule - Note that this is used on hosts that cannot link\n\/\/\/ in a library unless there are references into the library. In particular,\n\/\/\/ it seems that it is not possible to get things to work on Win32 without\n\/\/\/ this. Though it is unused, do not remove it.\nextern \"C\" int X86TargetMachineModule;\nint X86TargetMachineModule = 0;\n\nnamespace {\n cl::opt<bool> NoSSAPeephole(\"disable-ssa-peephole\", cl::init(true),\n cl::desc(\"Disable the ssa-based peephole optimizer \"\n \"(defaults to disabled)\"));\n cl::opt<bool> DisableOutput(\"disable-x86-llc-output\", cl::Hidden,\n cl::desc(\"Disable the X86 asm printer, for use \"\n \"when profiling the code generator.\"));\n\n#if 0\n \/\/ FIXME: This should eventually be handled with target triples and\n \/\/ subtarget support!\n cl::opt<X86VectorEnum, true>\n SSEArg(\n cl::desc(\"Enable SSE support in the X86 target:\"),\n cl::values(\n clEnumValN(SSE, \"sse\", \" Enable SSE support\"),\n clEnumValN(SSE2, \"sse2\", \" Enable SSE and SSE2 support\"),\n clEnumValN(SSE3, \"sse3\", \" Enable SSE, SSE2, and SSE3 support\"),\n clEnumValEnd),\n cl::location(X86Vector), cl::init(NoSSE));\n#endif\n\n \/\/ Register the target.\n RegisterTarget<X86TargetMachine> X(\"x86\", \" IA-32 (Pentium and above)\");\n}\n\nunsigned X86TargetMachine::getJITMatchQuality() {\n#if defined(i386) || defined(__i386__) || defined(__x86__) || defined(_M_IX86)\n return 10;\n#else\n return 0;\n#endif\n}\n\nunsigned X86TargetMachine::getModuleMatchQuality(const Module &M) {\n \/\/ We strongly match \"i[3-9]86-*\".\n std::string TT = M.getTargetTriple();\n if (TT.size() >= 5 && TT[0] == 'i' && TT[2] == '8' && TT[3] == '6' &&\n TT[4] == '-' && TT[1] - '3' < 6)\n return 20;\n\n if (M.getEndianness() == Module::LittleEndian &&\n M.getPointerSize() == Module::Pointer32)\n return 10; \/\/ Weak match\n else if (M.getEndianness() != Module::AnyEndianness ||\n M.getPointerSize() != Module::AnyPointerSize)\n return 0; \/\/ Match for some other target\n\n return getJITMatchQuality()\/2;\n}\n\n\/\/\/ X86TargetMachine ctor - Create an ILP32 architecture model\n\/\/\/\nX86TargetMachine::X86TargetMachine(const Module &M, IntrinsicLowering *IL)\n : TargetMachine(\"X86\", IL, true, 4, 4, 4, 4, 4),\n FrameInfo(TargetFrameInfo::StackGrowsDown, 8, -4),\n JITInfo(*this) {\n}\n\n\n\/\/ addPassesToEmitAssembly - We currently use all of the same passes as the JIT\n\/\/ does to emit statically compiled machine code.\nbool X86TargetMachine::addPassesToEmitAssembly(PassManager &PM,\n\t\t\t\t\t std::ostream &Out) {\n \/\/ FIXME: Implement efficient support for garbage collection intrinsics.\n PM.add(createLowerGCPass());\n\n \/\/ FIXME: Implement the invoke\/unwind instructions!\n PM.add(createLowerInvokePass());\n\n \/\/ FIXME: Implement the switch instruction in the instruction selector!\n PM.add(createLowerSwitchPass());\n\n \/\/ Make sure that no unreachable blocks are instruction selected.\n PM.add(createUnreachableBlockEliminationPass());\n\n PM.add(createX86SimpleInstructionSelector(*this));\n\n \/\/ Run optional SSA-based machine code optimizations next...\n if (!NoSSAPeephole)\n PM.add(createX86SSAPeepholeOptimizerPass());\n\n \/\/ Print the instruction selected machine code...\n if (PrintMachineCode)\n PM.add(createMachineFunctionPrinterPass(&std::cerr));\n\n \/\/ Perform register allocation to convert to a concrete x86 representation\n PM.add(createRegisterAllocator());\n\n if (PrintMachineCode)\n PM.add(createMachineFunctionPrinterPass(&std::cerr));\n\n PM.add(createX86FloatingPointStackifierPass());\n\n if (PrintMachineCode)\n PM.add(createMachineFunctionPrinterPass(&std::cerr));\n\n \/\/ Insert prolog\/epilog code. Eliminate abstract frame index references...\n PM.add(createPrologEpilogCodeInserter());\n\n PM.add(createX86PeepholeOptimizerPass());\n\n if (PrintMachineCode) \/\/ Print the register-allocated code\n PM.add(createX86CodePrinterPass(std::cerr, *this));\n\n if (!DisableOutput)\n PM.add(createX86CodePrinterPass(Out, *this));\n\n \/\/ Delete machine code for this function\n PM.add(createMachineCodeDeleter());\n\n return false; \/\/ success!\n}\n\n\/\/\/ addPassesToJITCompile - Add passes to the specified pass manager to\n\/\/\/ implement a fast dynamic compiler for this target. Return true if this is\n\/\/\/ not supported for this target.\n\/\/\/\nvoid X86JITInfo::addPassesToJITCompile(FunctionPassManager &PM) {\n \/\/ FIXME: Implement efficient support for garbage collection intrinsics.\n PM.add(createLowerGCPass());\n\n \/\/ FIXME: Implement the invoke\/unwind instructions!\n PM.add(createLowerInvokePass());\n\n \/\/ FIXME: Implement the switch instruction in the instruction selector!\n PM.add(createLowerSwitchPass());\n\n \/\/ Make sure that no unreachable blocks are instruction selected.\n PM.add(createUnreachableBlockEliminationPass());\n\n PM.add(createX86SimpleInstructionSelector(TM));\n\n \/\/ Run optional SSA-based machine code optimizations next...\n if (!NoSSAPeephole)\n PM.add(createX86SSAPeepholeOptimizerPass());\n\n \/\/ FIXME: Add SSA based peephole optimizer here.\n\n \/\/ Print the instruction selected machine code...\n if (PrintMachineCode)\n PM.add(createMachineFunctionPrinterPass(&std::cerr));\n\n \/\/ Perform register allocation to convert to a concrete x86 representation\n PM.add(createRegisterAllocator());\n\n if (PrintMachineCode)\n PM.add(createMachineFunctionPrinterPass(&std::cerr));\n\n PM.add(createX86FloatingPointStackifierPass());\n\n if (PrintMachineCode)\n PM.add(createMachineFunctionPrinterPass(&std::cerr));\n\n \/\/ Insert prolog\/epilog code. Eliminate abstract frame index references...\n PM.add(createPrologEpilogCodeInserter());\n\n PM.add(createX86PeepholeOptimizerPass());\n\n if (PrintMachineCode) \/\/ Print the register-allocated code\n PM.add(createX86CodePrinterPass(std::cerr, TM));\n}\n\n<commit_msg>Allow the selection-dag based selector to be diabled with -disable-pattern-isel.<commit_after>\/\/===-- X86TargetMachine.cpp - Define TargetMachine for the X86 -----------===\/\/\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 defines the X86 specific subclass of TargetMachine.\n\/\/\n\/\/===----------------------------------------------------------------------===\/\/\n\n#include \"X86TargetMachine.h\"\n#include \"X86.h\"\n#include \"llvm\/Module.h\"\n#include \"llvm\/PassManager.h\"\n#include \"llvm\/CodeGen\/IntrinsicLowering.h\"\n#include \"llvm\/CodeGen\/MachineFunction.h\"\n#include \"llvm\/CodeGen\/Passes.h\"\n#include \"llvm\/Target\/TargetOptions.h\"\n#include \"llvm\/Target\/TargetMachineRegistry.h\"\n#include \"llvm\/Transforms\/Scalar.h\"\n#include \"llvm\/Support\/CommandLine.h\"\n#include \"llvm\/ADT\/Statistic.h\"\nusing namespace llvm;\n\nX86VectorEnum llvm::X86Vector = NoSSE;\n\n\/\/\/ X86TargetMachineModule - Note that this is used on hosts that cannot link\n\/\/\/ in a library unless there are references into the library. In particular,\n\/\/\/ it seems that it is not possible to get things to work on Win32 without\n\/\/\/ this. Though it is unused, do not remove it.\nextern \"C\" int X86TargetMachineModule;\nint X86TargetMachineModule = 0;\n\nnamespace {\n cl::opt<bool> NoSSAPeephole(\"disable-ssa-peephole\", cl::init(true),\n cl::desc(\"Disable the ssa-based peephole optimizer \"\n \"(defaults to disabled)\"));\n cl::opt<bool> DisableOutput(\"disable-x86-llc-output\", cl::Hidden,\n cl::desc(\"Disable the X86 asm printer, for use \"\n \"when profiling the code generator.\"));\n cl::opt<bool> DisablePatternISel(\"disable-pattern-isel\", cl::Hidden,\n cl::desc(\"Disable the pattern isel XXX FIXME\"),\n cl::init(true));\n\n#if 0\n \/\/ FIXME: This should eventually be handled with target triples and\n \/\/ subtarget support!\n cl::opt<X86VectorEnum, true>\n SSEArg(\n cl::desc(\"Enable SSE support in the X86 target:\"),\n cl::values(\n clEnumValN(SSE, \"sse\", \" Enable SSE support\"),\n clEnumValN(SSE2, \"sse2\", \" Enable SSE and SSE2 support\"),\n clEnumValN(SSE3, \"sse3\", \" Enable SSE, SSE2, and SSE3 support\"),\n clEnumValEnd),\n cl::location(X86Vector), cl::init(NoSSE));\n#endif\n\n \/\/ Register the target.\n RegisterTarget<X86TargetMachine> X(\"x86\", \" IA-32 (Pentium and above)\");\n}\n\nunsigned X86TargetMachine::getJITMatchQuality() {\n#if defined(i386) || defined(__i386__) || defined(__x86__) || defined(_M_IX86)\n return 10;\n#else\n return 0;\n#endif\n}\n\nunsigned X86TargetMachine::getModuleMatchQuality(const Module &M) {\n \/\/ We strongly match \"i[3-9]86-*\".\n std::string TT = M.getTargetTriple();\n if (TT.size() >= 5 && TT[0] == 'i' && TT[2] == '8' && TT[3] == '6' &&\n TT[4] == '-' && TT[1] - '3' < 6)\n return 20;\n\n if (M.getEndianness() == Module::LittleEndian &&\n M.getPointerSize() == Module::Pointer32)\n return 10; \/\/ Weak match\n else if (M.getEndianness() != Module::AnyEndianness ||\n M.getPointerSize() != Module::AnyPointerSize)\n return 0; \/\/ Match for some other target\n\n return getJITMatchQuality()\/2;\n}\n\n\/\/\/ X86TargetMachine ctor - Create an ILP32 architecture model\n\/\/\/\nX86TargetMachine::X86TargetMachine(const Module &M, IntrinsicLowering *IL)\n : TargetMachine(\"X86\", IL, true, 4, 4, 4, 4, 4),\n FrameInfo(TargetFrameInfo::StackGrowsDown, 8, -4),\n JITInfo(*this) {\n}\n\n\n\/\/ addPassesToEmitAssembly - We currently use all of the same passes as the JIT\n\/\/ does to emit statically compiled machine code.\nbool X86TargetMachine::addPassesToEmitAssembly(PassManager &PM,\n\t\t\t\t\t std::ostream &Out) {\n \/\/ FIXME: Implement efficient support for garbage collection intrinsics.\n PM.add(createLowerGCPass());\n\n \/\/ FIXME: Implement the invoke\/unwind instructions!\n PM.add(createLowerInvokePass());\n\n \/\/ FIXME: Implement the switch instruction in the instruction selector!\n PM.add(createLowerSwitchPass());\n\n \/\/ Make sure that no unreachable blocks are instruction selected.\n PM.add(createUnreachableBlockEliminationPass());\n\n if (DisablePatternISel)\n PM.add(createX86SimpleInstructionSelector(*this));\n else\n PM.add(createX86PatternInstructionSelector(*this));\n\n \/\/ Run optional SSA-based machine code optimizations next...\n if (!NoSSAPeephole)\n PM.add(createX86SSAPeepholeOptimizerPass());\n\n \/\/ Print the instruction selected machine code...\n if (PrintMachineCode)\n PM.add(createMachineFunctionPrinterPass(&std::cerr));\n\n \/\/ Perform register allocation to convert to a concrete x86 representation\n PM.add(createRegisterAllocator());\n\n if (PrintMachineCode)\n PM.add(createMachineFunctionPrinterPass(&std::cerr));\n\n PM.add(createX86FloatingPointStackifierPass());\n\n if (PrintMachineCode)\n PM.add(createMachineFunctionPrinterPass(&std::cerr));\n\n \/\/ Insert prolog\/epilog code. Eliminate abstract frame index references...\n PM.add(createPrologEpilogCodeInserter());\n\n PM.add(createX86PeepholeOptimizerPass());\n\n if (PrintMachineCode) \/\/ Print the register-allocated code\n PM.add(createX86CodePrinterPass(std::cerr, *this));\n\n if (!DisableOutput)\n PM.add(createX86CodePrinterPass(Out, *this));\n\n \/\/ Delete machine code for this function\n PM.add(createMachineCodeDeleter());\n\n return false; \/\/ success!\n}\n\n\/\/\/ addPassesToJITCompile - Add passes to the specified pass manager to\n\/\/\/ implement a fast dynamic compiler for this target. Return true if this is\n\/\/\/ not supported for this target.\n\/\/\/\nvoid X86JITInfo::addPassesToJITCompile(FunctionPassManager &PM) {\n \/\/ FIXME: Implement efficient support for garbage collection intrinsics.\n PM.add(createLowerGCPass());\n\n \/\/ FIXME: Implement the invoke\/unwind instructions!\n PM.add(createLowerInvokePass());\n\n \/\/ FIXME: Implement the switch instruction in the instruction selector!\n PM.add(createLowerSwitchPass());\n\n \/\/ Make sure that no unreachable blocks are instruction selected.\n PM.add(createUnreachableBlockEliminationPass());\n\n if (DisablePatternISel)\n PM.add(createX86SimpleInstructionSelector(TM));\n else\n PM.add(createX86PatternInstructionSelector(TM));\n\n \/\/ Run optional SSA-based machine code optimizations next...\n if (!NoSSAPeephole)\n PM.add(createX86SSAPeepholeOptimizerPass());\n\n \/\/ FIXME: Add SSA based peephole optimizer here.\n\n \/\/ Print the instruction selected machine code...\n if (PrintMachineCode)\n PM.add(createMachineFunctionPrinterPass(&std::cerr));\n\n \/\/ Perform register allocation to convert to a concrete x86 representation\n PM.add(createRegisterAllocator());\n\n if (PrintMachineCode)\n PM.add(createMachineFunctionPrinterPass(&std::cerr));\n\n PM.add(createX86FloatingPointStackifierPass());\n\n if (PrintMachineCode)\n PM.add(createMachineFunctionPrinterPass(&std::cerr));\n\n \/\/ Insert prolog\/epilog code. Eliminate abstract frame index references...\n PM.add(createPrologEpilogCodeInserter());\n\n PM.add(createX86PeepholeOptimizerPass());\n\n if (PrintMachineCode) \/\/ Print the register-allocated code\n PM.add(createX86CodePrinterPass(std::cerr, TM));\n}\n\n<|endoftext|>"} {"text":"<commit_before>\/*\n * This file is part of TelepathyQt4\n *\n * Copyright (C) 2009-2010 Collabora Ltd. <http:\/\/www.collabora.co.uk\/>\n * Copyright (C) 2009-2010 Nokia Corporation\n *\n * This library is free software; you can redistribute it and\/or\n * modify it under the terms of the GNU Lesser General Public\n * License as published by the Free Software Foundation; either\n * version 2.1 of the License, or (at your option) any later version.\n *\n * This library is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU\n * Lesser General Public License for more details.\n *\n * You should have received a copy of the GNU Lesser General Public\n * License along with this library; if not, write to the Free Software\n * Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA\n *\/\n\n#include <TelepathyQt4\/ConnectionCapabilities>\n\n#include \"TelepathyQt4\/future-internal.h\"\n\n#include <TelepathyQt4\/Constants>\n#include <TelepathyQt4\/Types>\n\nnamespace Tp\n{\n\n\/**\n * \\class ConnectionCapabilities\n * \\ingroup clientconn\n * \\headerfile TelepathyQt4\/connection-capabilities.h <TelepathyQt4\/ConnectionCapabilities>\n *\n * \\brief The ConnectionCapabilities class provides an object representing the\n * capabilities of a Connection.\n *\/\n\n\/**\n * Construct a new ConnectionCapabilities object.\n *\/\nConnectionCapabilities::ConnectionCapabilities()\n : CapabilitiesBase(false)\n{\n}\n\n\/**\n * Construct a new ConnectionCapabilities object using the give \\a rccs.\n *\n * \\param rccs RequestableChannelClassList representing the capabilities of a\n * Connection.\n *\/\nConnectionCapabilities::ConnectionCapabilities(const RequestableChannelClassList &rccs)\n : CapabilitiesBase(rccs, false)\n{\n}\n\n\/**\n * Construct a new ConnectionCapabilities object using the give \\a rccSpecs.\n *\n * \\param rccSpecs RequestableChannelClassSpecList representing the capabilities of a\n * Connection.\n *\/\nConnectionCapabilities::ConnectionCapabilities(const RequestableChannelClassSpecList &rccSpecs)\n : CapabilitiesBase(rccSpecs, false)\n{\n}\n\n\/**\n * Class destructor.\n *\/\nConnectionCapabilities::~ConnectionCapabilities()\n{\n}\n\n\/**\n * Return true if named text chatrooms can be joined by providing a\n * chatroom identifier.\n *\n * If the protocol is such that chatrooms can be joined, but only via\n * a more elaborate D-Bus API than normal (because more information is needed),\n * then this method will return false.\n *\n * \\return \\c true if Account::ensureTextChatroom() can be expected to work.\n *\/\nbool ConnectionCapabilities::textChatrooms() const\n{\n RequestableChannelClassSpecList rccSpecs = allClassSpecs();\n foreach (const RequestableChannelClassSpec &rccSpec, rccSpecs) {\n if (!rccSpec.fixedProperties().size() == 2) {\n continue;\n }\n\n if (rccSpec.channelType() == TPQT4_IFACE_CHANNEL_TYPE_TEXT &&\n rccSpec.targetHandleType() == HandleTypeRoom) {\n return true;\n }\n }\n return false;\n}\n\n\/**\n * Return whether creating conference media calls is supported.\n *\n * \\return \\c true if supported, \\c false otherwise.\n *\/\nbool ConnectionCapabilities::conferenceStreamedMediaCalls() const\n{\n RequestableChannelClassSpecList rccSpecs = allClassSpecs();\n foreach (const RequestableChannelClassSpec &rccSpec, rccSpecs) {\n if (rccSpec.channelType() == TPQT4_IFACE_CHANNEL_TYPE_STREAMED_MEDIA &&\n (rccSpec.allowsProperty(QLatin1String(TPQT4_IFACE_CHANNEL_INTERFACE_CONFERENCE_ASCII \".InitialChannels\")) ||\n rccSpec.allowsProperty(QLatin1String(TPQT4_FUTURE_IFACE_CHANNEL_INTERFACE_CONFERENCE_ASCII \".InitialChannels\")))) {\n return true;\n }\n }\n return false;\n}\n\n\/**\n * Return whether creating conference media calls is supported.\n *\n * This method will also check whether inviting new contacts when creating a conference media call\n * channel by providing additional members to initial invitees (as opposed to merging several\n * channels into one new conference channel) is supported.\n *\n * If providing additional members is supported, it is also possible to request conference media\n * calls with fewer than two (even zero) already established media calls.\n *\n * \\return \\c true if supported, \\c false otherwise.\n *\/\nbool ConnectionCapabilities::conferenceStreamedMediaCallsWithInvitees() const\n{\n RequestableChannelClassSpecList rccSpecs = allClassSpecs();\n foreach (const RequestableChannelClassSpec &rccSpec, rccSpecs) {\n if (rccSpec.channelType() == TPQT4_IFACE_CHANNEL_TYPE_STREAMED_MEDIA &&\n (rccSpec.allowsProperty(QLatin1String(TPQT4_IFACE_CHANNEL_INTERFACE_CONFERENCE_ASCII \".InitialChannels\")) ||\n rccSpec.allowsProperty(QLatin1String(TPQT4_FUTURE_IFACE_CHANNEL_INTERFACE_CONFERENCE_ASCII \".InitialChannels\"))) &&\n (rccSpec.allowsProperty(QLatin1String(TPQT4_IFACE_CHANNEL_INTERFACE_CONFERENCE_ASCII \".InitialInviteeHandles\")) ||\n rccSpec.allowsProperty(QLatin1String(TPQT4_FUTURE_IFACE_CHANNEL_INTERFACE_CONFERENCE_ASCII \".InitialInviteeHandles\")))) {\n return true;\n }\n }\n return false;\n}\n\n\/**\n * Return whether creating conference text chats is supported.\n *\n * \\return \\c true if supported, \\c false otherwise.\n *\/\nbool ConnectionCapabilities::conferenceTextChats() const\n{\n RequestableChannelClassSpecList rccSpecs = allClassSpecs();\n foreach (const RequestableChannelClassSpec &rccSpec, rccSpecs) {\n if (rccSpec.channelType() == TPQT4_IFACE_CHANNEL_TYPE_TEXT &&\n (rccSpec.allowsProperty(QLatin1String(TPQT4_IFACE_CHANNEL_INTERFACE_CONFERENCE_ASCII \".InitialChannels\")) ||\n rccSpec.allowsProperty(QLatin1String(TPQT4_FUTURE_IFACE_CHANNEL_INTERFACE_CONFERENCE_ASCII \".InitialChannels\")))) {\n return true;\n }\n }\n return false;\n}\n\n\/**\n * Return whether creating conference text chats is supported.\n *\n * This method will also check whether inviting new contacts when creating a conference text chat\n * channel by providing additional members to initial invitees (as opposed to merging several\n * channels into one new conference channel) is supported.\n *\n * If providing additional members is supported, it is also possible to request conference text\n * chats with fewer than two (even zero) already established text chats.\n *\n * \\return \\c true if supported, \\c false otherwise.\n *\/\nbool ConnectionCapabilities::conferenceTextChatsWithInvitees() const\n{\n RequestableChannelClassSpecList rccSpecs = allClassSpecs();\n foreach (const RequestableChannelClassSpec &rccSpec, rccSpecs) {\n if (rccSpec.channelType() == TPQT4_IFACE_CHANNEL_TYPE_TEXT &&\n (rccSpec.allowsProperty(QLatin1String(TPQT4_IFACE_CHANNEL_INTERFACE_CONFERENCE_ASCII \".InitialChannels\")) ||\n rccSpec.allowsProperty(QLatin1String(TPQT4_FUTURE_IFACE_CHANNEL_INTERFACE_CONFERENCE_ASCII \".InitialChannels\"))) &&\n (rccSpec.allowsProperty(QLatin1String(TPQT4_IFACE_CHANNEL_INTERFACE_CONFERENCE_ASCII \".InitialInviteeHandles\")) ||\n rccSpec.allowsProperty(QLatin1String(TPQT4_FUTURE_IFACE_CHANNEL_INTERFACE_CONFERENCE_ASCII \".InitialInviteeHandles\")))) {\n return true;\n }\n }\n return false;\n}\n\n\/**\n * Return whether creating conference text chat rooms is supported.\n *\n * \\return \\c true if supported, \\c false otherwise.\n *\/\nbool ConnectionCapabilities::conferenceTextChatrooms() const\n{\n RequestableChannelClassSpecList rccSpecs = allClassSpecs();\n foreach (const RequestableChannelClassSpec &rccSpec, rccSpecs) {\n if (rccSpec.channelType() == TPQT4_IFACE_CHANNEL_TYPE_TEXT &&\n rccSpec.targetHandleType() == HandleTypeRoom &&\n (rccSpec.allowsProperty(QLatin1String(TPQT4_IFACE_CHANNEL_INTERFACE_CONFERENCE_ASCII \".InitialChannels\")) ||\n rccSpec.allowsProperty(QLatin1String(TPQT4_FUTURE_IFACE_CHANNEL_INTERFACE_CONFERENCE_ASCII \".InitialChannels\")))) {\n return true;\n }\n }\n return false;\n}\n\n\/**\n * Return whether creating conference text chat rooms is supported.\n *\n * This method will also check whether inviting new contacts when creating a conference text chat\n * room channel by providing additional members to initial invitees (as opposed to merging several\n * channels into one new conference channel) is supported.\n *\n * If providing additional members is supported, it is also possible to request conference text\n * chat rooms with fewer than two (even zero) already established text chat rooms.\n *\n * \\return \\c true if supported, \\c false otherwise.\n *\/\nbool ConnectionCapabilities::conferenceTextChatroomsWithInvitees() const\n{\n RequestableChannelClassSpecList rccSpecs = allClassSpecs();\n foreach (const RequestableChannelClassSpec &rccSpec, rccSpecs) {\n if (rccSpec.channelType() == TPQT4_IFACE_CHANNEL_TYPE_TEXT &&\n rccSpec.targetHandleType() == HandleTypeRoom &&\n (rccSpec.allowsProperty(QLatin1String(TPQT4_IFACE_CHANNEL_INTERFACE_CONFERENCE_ASCII \".InitialChannels\")) ||\n rccSpec.allowsProperty(QLatin1String(TPQT4_FUTURE_IFACE_CHANNEL_INTERFACE_CONFERENCE_ASCII \".InitialChannels\"))) &&\n (rccSpec.allowsProperty(QLatin1String(TPQT4_IFACE_CHANNEL_INTERFACE_CONFERENCE_ASCII \".InitialInviteeHandles\")) ||\n rccSpec.allowsProperty(QLatin1String(TPQT4_FUTURE_IFACE_CHANNEL_INTERFACE_CONFERENCE_ASCII \".InitialInviteeHandles\")))) {\n return true;\n }\n }\n return false;\n}\n\n\/**\n * Return whether creating a ContactSearch channel is supported.\n *\n * \\return \\c true if supported, \\c false otherwise.\n *\/\nbool ConnectionCapabilities::contactSearch()\n{\n RequestableChannelClassSpecList rccSpecs = allClassSpecs();\n foreach (const RequestableChannelClassSpec &rccSpec, rccSpecs) {\n if (rccSpec.channelType() == TPQT4_IFACE_CHANNEL_TYPE_CONTACT_SEARCH) {\n return true;\n }\n }\n return false;\n}\n\n\/**\n * Return whether creating a ContactSearch channel specifying a server is supported.\n *\n * \\return \\c true if supported, \\c false otherwise.\n *\/\nbool ConnectionCapabilities::contactSearchWithSpecificServer() const\n{\n RequestableChannelClassSpecList rccSpecs = allClassSpecs();\n foreach (const RequestableChannelClassSpec &rccSpec, rccSpecs) {\n if (rccSpec.channelType() == TPQT4_IFACE_CHANNEL_TYPE_CONTACT_SEARCH &&\n rccSpec.allowsProperty(QLatin1String(TPQT4_IFACE_CHANNEL_TYPE_CONTACT_SEARCH_ASCII \".Server\"))) {\n return true;\n }\n }\n return false;\n}\n\n\/**\n * Return whether creating a ContactSearch channel specifying a limit is supported.\n *\n * \\return \\c true if supported, \\c false otherwise.\n *\/\nbool ConnectionCapabilities::contactSearchWithLimit() const\n{\n RequestableChannelClassSpecList rccSpecs = allClassSpecs();\n foreach (const RequestableChannelClassSpec &rccSpec, rccSpecs) {\n if (rccSpec.channelType() == TPQT4_IFACE_CHANNEL_TYPE_CONTACT_SEARCH &&\n rccSpec.allowsProperty(QLatin1String(TPQT4_IFACE_CHANNEL_TYPE_CONTACT_SEARCH_ASCII \".Limit\"))) {\n return true;\n }\n }\n return false;\n}\n\n\/**\n * \\deprecated Use textChatrooms() instead.\n *\/\nbool ConnectionCapabilities::supportsTextChatrooms() const\n{\n return textChatrooms();\n}\n\n\/**\n * \\deprecated Use conferenceStreamedMediaCalls() or conferenceStreamedMediaCallsWithInvitees()\n * instead.\n *\/\nbool ConnectionCapabilities::supportsConferenceMediaCalls(bool withInitialInvitees) const\n{\n if (withInitialInvitees) {\n return conferenceStreamedMediaCallsWithInvitees();\n }\n return conferenceStreamedMediaCalls();\n}\n\n\/**\n * \\deprecated Use conferenceTextChats() instead.\n *\/\nbool ConnectionCapabilities::supportsConferenceTextChats(bool withInitialInvitees) const\n{\n if (withInitialInvitees) {\n return conferenceTextChatsWithInvitees();\n }\n return conferenceTextChats();\n}\n\n\/**\n * \\deprecated Use conferenceTextChatrooms() instead.\n *\/\nbool ConnectionCapabilities::supportsConferenceTextChatrooms(bool withInitialInvitees) const\n{\n if (withInitialInvitees) {\n return conferenceTextChatroomsWithInvitees();\n }\n return conferenceTextChatrooms();\n}\n\n\/**\n * \\deprecated Use contactSearch() instead.\n *\/\nbool ConnectionCapabilities::supportsContactSearch()\n{\n return contactSearch();\n}\n\n\/**\n * \\deprecated Use contactSearchWithSpecificServer() instead.\n *\/\nbool ConnectionCapabilities::supportsContactSearchWithSpecificServer() const\n{\n return contactSearchWithSpecificServer();\n}\n\n\/**\n * \\deprecated Use contactSearchWithLimit() instead.\n *\/\nbool ConnectionCapabilities::supportsContactSearchWithLimit() const\n{\n return contactSearchWithLimit();\n}\n\n} \/\/ Tp\n<commit_msg>ConnectionCapabilities: Use new macros.<commit_after>\/*\n * This file is part of TelepathyQt4\n *\n * Copyright (C) 2009-2010 Collabora Ltd. <http:\/\/www.collabora.co.uk\/>\n * Copyright (C) 2009-2010 Nokia Corporation\n *\n * This library is free software; you can redistribute it and\/or\n * modify it under the terms of the GNU Lesser General Public\n * License as published by the Free Software Foundation; either\n * version 2.1 of the License, or (at your option) any later version.\n *\n * This library is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU\n * Lesser General Public License for more details.\n *\n * You should have received a copy of the GNU Lesser General Public\n * License along with this library; if not, write to the Free Software\n * Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA\n *\/\n\n#include <TelepathyQt4\/ConnectionCapabilities>\n\n#include \"TelepathyQt4\/future-internal.h\"\n\n#include <TelepathyQt4\/Constants>\n#include <TelepathyQt4\/Types>\n\nnamespace Tp\n{\n\n\/**\n * \\class ConnectionCapabilities\n * \\ingroup clientconn\n * \\headerfile TelepathyQt4\/connection-capabilities.h <TelepathyQt4\/ConnectionCapabilities>\n *\n * \\brief The ConnectionCapabilities class provides an object representing the\n * capabilities of a Connection.\n *\/\n\n\/**\n * Construct a new ConnectionCapabilities object.\n *\/\nConnectionCapabilities::ConnectionCapabilities()\n : CapabilitiesBase(false)\n{\n}\n\n\/**\n * Construct a new ConnectionCapabilities object using the give \\a rccs.\n *\n * \\param rccs RequestableChannelClassList representing the capabilities of a\n * Connection.\n *\/\nConnectionCapabilities::ConnectionCapabilities(const RequestableChannelClassList &rccs)\n : CapabilitiesBase(rccs, false)\n{\n}\n\n\/**\n * Construct a new ConnectionCapabilities object using the give \\a rccSpecs.\n *\n * \\param rccSpecs RequestableChannelClassSpecList representing the capabilities of a\n * Connection.\n *\/\nConnectionCapabilities::ConnectionCapabilities(const RequestableChannelClassSpecList &rccSpecs)\n : CapabilitiesBase(rccSpecs, false)\n{\n}\n\n\/**\n * Class destructor.\n *\/\nConnectionCapabilities::~ConnectionCapabilities()\n{\n}\n\n\/**\n * Return true if named text chatrooms can be joined by providing a\n * chatroom identifier.\n *\n * If the protocol is such that chatrooms can be joined, but only via\n * a more elaborate D-Bus API than normal (because more information is needed),\n * then this method will return false.\n *\n * \\return \\c true if Account::ensureTextChatroom() can be expected to work.\n *\/\nbool ConnectionCapabilities::textChatrooms() const\n{\n RequestableChannelClassSpecList rccSpecs = allClassSpecs();\n foreach (const RequestableChannelClassSpec &rccSpec, rccSpecs) {\n if (!rccSpec.fixedProperties().size() == 2) {\n continue;\n }\n\n if (rccSpec.channelType() == TP_QT4_IFACE_CHANNEL_TYPE_TEXT &&\n rccSpec.targetHandleType() == HandleTypeRoom) {\n return true;\n }\n }\n return false;\n}\n\n\/**\n * Return whether creating conference media calls is supported.\n *\n * \\return \\c true if supported, \\c false otherwise.\n *\/\nbool ConnectionCapabilities::conferenceStreamedMediaCalls() const\n{\n RequestableChannelClassSpecList rccSpecs = allClassSpecs();\n foreach (const RequestableChannelClassSpec &rccSpec, rccSpecs) {\n if (rccSpec.channelType() == TP_QT4_IFACE_CHANNEL_TYPE_STREAMED_MEDIA &&\n (rccSpec.allowsProperty(TP_QT4_IFACE_CHANNEL_INTERFACE_CONFERENCE + QLatin1String(\".InitialChannels\")) ||\n rccSpec.allowsProperty(TP_QT4_FUTURE_IFACE_CHANNEL_INTERFACE_CONFERENCE + QLatin1String(\".InitialChannels\")))) {\n return true;\n }\n }\n return false;\n}\n\n\/**\n * Return whether creating conference media calls is supported.\n *\n * This method will also check whether inviting new contacts when creating a conference media call\n * channel by providing additional members to initial invitees (as opposed to merging several\n * channels into one new conference channel) is supported.\n *\n * If providing additional members is supported, it is also possible to request conference media\n * calls with fewer than two (even zero) already established media calls.\n *\n * \\return \\c true if supported, \\c false otherwise.\n *\/\nbool ConnectionCapabilities::conferenceStreamedMediaCallsWithInvitees() const\n{\n RequestableChannelClassSpecList rccSpecs = allClassSpecs();\n foreach (const RequestableChannelClassSpec &rccSpec, rccSpecs) {\n if (rccSpec.channelType() == TP_QT4_IFACE_CHANNEL_TYPE_STREAMED_MEDIA &&\n (rccSpec.allowsProperty(TP_QT4_IFACE_CHANNEL_INTERFACE_CONFERENCE + QLatin1String(\".InitialChannels\")) ||\n rccSpec.allowsProperty(TP_QT4_FUTURE_IFACE_CHANNEL_INTERFACE_CONFERENCE + QLatin1String(\".InitialChannels\"))) &&\n (rccSpec.allowsProperty(TP_QT4_IFACE_CHANNEL_INTERFACE_CONFERENCE + QLatin1String(\".InitialInviteeHandles\")) ||\n rccSpec.allowsProperty(TP_QT4_FUTURE_IFACE_CHANNEL_INTERFACE_CONFERENCE + QLatin1String(\".InitialInviteeHandles\")))) {\n return true;\n }\n }\n return false;\n}\n\n\/**\n * Return whether creating conference text chats is supported.\n *\n * \\return \\c true if supported, \\c false otherwise.\n *\/\nbool ConnectionCapabilities::conferenceTextChats() const\n{\n RequestableChannelClassSpecList rccSpecs = allClassSpecs();\n foreach (const RequestableChannelClassSpec &rccSpec, rccSpecs) {\n if (rccSpec.channelType() == TP_QT4_IFACE_CHANNEL_TYPE_TEXT &&\n (rccSpec.allowsProperty(TP_QT4_IFACE_CHANNEL_INTERFACE_CONFERENCE + QLatin1String(\".InitialChannels\")) ||\n rccSpec.allowsProperty(TP_QT4_FUTURE_IFACE_CHANNEL_INTERFACE_CONFERENCE + QLatin1String(\".InitialChannels\")))) {\n return true;\n }\n }\n return false;\n}\n\n\/**\n * Return whether creating conference text chats is supported.\n *\n * This method will also check whether inviting new contacts when creating a conference text chat\n * channel by providing additional members to initial invitees (as opposed to merging several\n * channels into one new conference channel) is supported.\n *\n * If providing additional members is supported, it is also possible to request conference text\n * chats with fewer than two (even zero) already established text chats.\n *\n * \\return \\c true if supported, \\c false otherwise.\n *\/\nbool ConnectionCapabilities::conferenceTextChatsWithInvitees() const\n{\n RequestableChannelClassSpecList rccSpecs = allClassSpecs();\n foreach (const RequestableChannelClassSpec &rccSpec, rccSpecs) {\n if (rccSpec.channelType() == TP_QT4_IFACE_CHANNEL_TYPE_TEXT &&\n (rccSpec.allowsProperty(TP_QT4_IFACE_CHANNEL_INTERFACE_CONFERENCE + QLatin1String(\".InitialChannels\")) ||\n rccSpec.allowsProperty(TP_QT4_FUTURE_IFACE_CHANNEL_INTERFACE_CONFERENCE + QLatin1String(\".InitialChannels\"))) &&\n (rccSpec.allowsProperty(TP_QT4_IFACE_CHANNEL_INTERFACE_CONFERENCE + QLatin1String(\".InitialInviteeHandles\")) ||\n rccSpec.allowsProperty(TP_QT4_FUTURE_IFACE_CHANNEL_INTERFACE_CONFERENCE + QLatin1String(\".InitialInviteeHandles\")))) {\n return true;\n }\n }\n return false;\n}\n\n\/**\n * Return whether creating conference text chat rooms is supported.\n *\n * \\return \\c true if supported, \\c false otherwise.\n *\/\nbool ConnectionCapabilities::conferenceTextChatrooms() const\n{\n RequestableChannelClassSpecList rccSpecs = allClassSpecs();\n foreach (const RequestableChannelClassSpec &rccSpec, rccSpecs) {\n if (rccSpec.channelType() == TP_QT4_IFACE_CHANNEL_TYPE_TEXT &&\n rccSpec.targetHandleType() == HandleTypeRoom &&\n (rccSpec.allowsProperty(TP_QT4_IFACE_CHANNEL_INTERFACE_CONFERENCE + QLatin1String(\".InitialChannels\")) ||\n rccSpec.allowsProperty(TP_QT4_FUTURE_IFACE_CHANNEL_INTERFACE_CONFERENCE + QLatin1String(\".InitialChannels\")))) {\n return true;\n }\n }\n return false;\n}\n\n\/**\n * Return whether creating conference text chat rooms is supported.\n *\n * This method will also check whether inviting new contacts when creating a conference text chat\n * room channel by providing additional members to initial invitees (as opposed to merging several\n * channels into one new conference channel) is supported.\n *\n * If providing additional members is supported, it is also possible to request conference text\n * chat rooms with fewer than two (even zero) already established text chat rooms.\n *\n * \\return \\c true if supported, \\c false otherwise.\n *\/\nbool ConnectionCapabilities::conferenceTextChatroomsWithInvitees() const\n{\n RequestableChannelClassSpecList rccSpecs = allClassSpecs();\n foreach (const RequestableChannelClassSpec &rccSpec, rccSpecs) {\n if (rccSpec.channelType() == TP_QT4_IFACE_CHANNEL_TYPE_TEXT &&\n rccSpec.targetHandleType() == HandleTypeRoom &&\n (rccSpec.allowsProperty(TP_QT4_IFACE_CHANNEL_INTERFACE_CONFERENCE + QLatin1String(\".InitialChannels\")) ||\n rccSpec.allowsProperty(TP_QT4_FUTURE_IFACE_CHANNEL_INTERFACE_CONFERENCE + QLatin1String(\".InitialChannels\"))) &&\n (rccSpec.allowsProperty(TP_QT4_IFACE_CHANNEL_INTERFACE_CONFERENCE + QLatin1String(\".InitialInviteeHandles\")) ||\n rccSpec.allowsProperty(TP_QT4_FUTURE_IFACE_CHANNEL_INTERFACE_CONFERENCE + QLatin1String(\".InitialInviteeHandles\")))) {\n return true;\n }\n }\n return false;\n}\n\n\/**\n * Return whether creating a ContactSearch channel is supported.\n *\n * \\return \\c true if supported, \\c false otherwise.\n *\/\nbool ConnectionCapabilities::contactSearch()\n{\n RequestableChannelClassSpecList rccSpecs = allClassSpecs();\n foreach (const RequestableChannelClassSpec &rccSpec, rccSpecs) {\n if (rccSpec.channelType() == TP_QT4_IFACE_CHANNEL_TYPE_CONTACT_SEARCH) {\n return true;\n }\n }\n return false;\n}\n\n\/**\n * Return whether creating a ContactSearch channel specifying a server is supported.\n *\n * \\return \\c true if supported, \\c false otherwise.\n *\/\nbool ConnectionCapabilities::contactSearchWithSpecificServer() const\n{\n RequestableChannelClassSpecList rccSpecs = allClassSpecs();\n foreach (const RequestableChannelClassSpec &rccSpec, rccSpecs) {\n if (rccSpec.channelType() == TP_QT4_IFACE_CHANNEL_TYPE_CONTACT_SEARCH &&\n rccSpec.allowsProperty(TP_QT4_IFACE_CHANNEL_TYPE_CONTACT_SEARCH + QLatin1String(\".Server\"))) {\n return true;\n }\n }\n return false;\n}\n\n\/**\n * Return whether creating a ContactSearch channel specifying a limit is supported.\n *\n * \\return \\c true if supported, \\c false otherwise.\n *\/\nbool ConnectionCapabilities::contactSearchWithLimit() const\n{\n RequestableChannelClassSpecList rccSpecs = allClassSpecs();\n foreach (const RequestableChannelClassSpec &rccSpec, rccSpecs) {\n if (rccSpec.channelType() == TP_QT4_IFACE_CHANNEL_TYPE_CONTACT_SEARCH &&\n rccSpec.allowsProperty(TP_QT4_IFACE_CHANNEL_TYPE_CONTACT_SEARCH + QLatin1String(\".Limit\"))) {\n return true;\n }\n }\n return false;\n}\n\n\/**\n * \\deprecated Use textChatrooms() instead.\n *\/\nbool ConnectionCapabilities::supportsTextChatrooms() const\n{\n return textChatrooms();\n}\n\n\/**\n * \\deprecated Use conferenceStreamedMediaCalls() or conferenceStreamedMediaCallsWithInvitees()\n * instead.\n *\/\nbool ConnectionCapabilities::supportsConferenceMediaCalls(bool withInitialInvitees) const\n{\n if (withInitialInvitees) {\n return conferenceStreamedMediaCallsWithInvitees();\n }\n return conferenceStreamedMediaCalls();\n}\n\n\/**\n * \\deprecated Use conferenceTextChats() instead.\n *\/\nbool ConnectionCapabilities::supportsConferenceTextChats(bool withInitialInvitees) const\n{\n if (withInitialInvitees) {\n return conferenceTextChatsWithInvitees();\n }\n return conferenceTextChats();\n}\n\n\/**\n * \\deprecated Use conferenceTextChatrooms() instead.\n *\/\nbool ConnectionCapabilities::supportsConferenceTextChatrooms(bool withInitialInvitees) const\n{\n if (withInitialInvitees) {\n return conferenceTextChatroomsWithInvitees();\n }\n return conferenceTextChatrooms();\n}\n\n\/**\n * \\deprecated Use contactSearch() instead.\n *\/\nbool ConnectionCapabilities::supportsContactSearch()\n{\n return contactSearch();\n}\n\n\/**\n * \\deprecated Use contactSearchWithSpecificServer() instead.\n *\/\nbool ConnectionCapabilities::supportsContactSearchWithSpecificServer() const\n{\n return contactSearchWithSpecificServer();\n}\n\n\/**\n * \\deprecated Use contactSearchWithLimit() instead.\n *\/\nbool ConnectionCapabilities::supportsContactSearchWithLimit() const\n{\n return contactSearchWithLimit();\n}\n\n} \/\/ Tp\n<|endoftext|>"} {"text":"<commit_before>\/\/===- JITTest.cpp - Unit tests for the JIT -------------------------------===\/\/\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 \"gtest\/gtest.h\"\n#include \"llvm\/ADT\/OwningPtr.h\"\n#include \"llvm\/BasicBlock.h\"\n#include \"llvm\/Constant.h\"\n#include \"llvm\/Constants.h\"\n#include \"llvm\/DerivedTypes.h\"\n#include \"llvm\/ExecutionEngine\/JIT.h\"\n#include \"llvm\/ExecutionEngine\/JITMemoryManager.h\"\n#include \"llvm\/Function.h\"\n#include \"llvm\/GlobalValue.h\"\n#include \"llvm\/GlobalVariable.h\"\n#include \"llvm\/LLVMContext.h\"\n#include \"llvm\/Module.h\"\n#include \"llvm\/ModuleProvider.h\"\n#include \"llvm\/Support\/IRBuilder.h\"\n#include \"llvm\/Support\/TypeBuilder.h\"\n#include \"llvm\/Target\/TargetSelect.h\"\n#include \"llvm\/Type.h\"\n\nusing namespace llvm;\n\nnamespace {\n\nFunction *makeReturnGlobal(std::string Name, GlobalVariable *G, Module *M) {\n std::vector<const Type*> params;\n const FunctionType *FTy = FunctionType::get(G->getType()->getElementType(),\n params, false);\n Function *F = Function::Create(FTy, GlobalValue::ExternalLinkage, Name, M);\n BasicBlock *Entry = BasicBlock::Create(M->getContext(), \"entry\", F);\n IRBuilder<> builder(Entry);\n Value *Load = builder.CreateLoad(G);\n const Type *GTy = G->getType()->getElementType();\n Value *Add = builder.CreateAdd(Load, ConstantInt::get(GTy, 1LL));\n builder.CreateStore(Add, G);\n builder.CreateRet(Add);\n return F;\n}\n\nclass JITTest : public testing::Test {\n protected:\n virtual void SetUp() {\n M = new Module(\"<main>\", Context);\n std::string Error;\n TheJIT.reset(EngineBuilder(M).setEngineKind(EngineKind::JIT)\n .setErrorStr(&Error).create());\n ASSERT_TRUE(TheJIT.get() != NULL) << Error;\n }\n\n LLVMContext Context;\n Module *M; \/\/ Owned by ExecutionEngine.\n OwningPtr<ExecutionEngine> TheJIT;\n};\n\n\/\/ Regression test for a bug. The JIT used to allocate globals inside the same\n\/\/ memory block used for the function, and when the function code was freed,\n\/\/ the global was left in the same place. This test allocates a function\n\/\/ that uses and global, deallocates it, and then makes sure that the global\n\/\/ stays alive after that.\nTEST(JIT, GlobalInFunction) {\n LLVMContext context;\n Module *M = new Module(\"<main>\", context);\n ExistingModuleProvider *MP = new ExistingModuleProvider(M);\n\n JITMemoryManager *MemMgr = JITMemoryManager::CreateDefaultMemManager();\n \/\/ Tell the memory manager to poison freed memory so that accessing freed\n \/\/ memory is more easily tested.\n MemMgr->setPoisonMemory(true);\n std::string Error;\n OwningPtr<ExecutionEngine> JIT(EngineBuilder(MP)\n .setEngineKind(EngineKind::JIT)\n .setErrorStr(&Error)\n .setJITMemoryManager(MemMgr)\n \/\/ The next line enables the fix:\n .setAllocateGVsWithCode(false)\n .create());\n ASSERT_EQ(Error, \"\");\n\n \/\/ Create a global variable.\n const Type *GTy = Type::getInt32Ty(context);\n GlobalVariable *G = new GlobalVariable(\n *M,\n GTy,\n false, \/\/ Not constant.\n GlobalValue::InternalLinkage,\n Constant::getNullValue(GTy),\n \"myglobal\");\n\n \/\/ Make a function that points to a global.\n Function *F1 = makeReturnGlobal(\"F1\", G, M);\n\n \/\/ Get the pointer to the native code to force it to JIT the function and\n \/\/ allocate space for the global.\n void (*F1Ptr)() =\n reinterpret_cast<void(*)()>((intptr_t)JIT->getPointerToFunction(F1));\n\n \/\/ Since F1 was codegen'd, a pointer to G should be available.\n int32_t *GPtr = (int32_t*)JIT->getPointerToGlobalIfAvailable(G);\n ASSERT_NE((int32_t*)NULL, GPtr);\n EXPECT_EQ(0, *GPtr);\n\n \/\/ F1() should increment G.\n F1Ptr();\n EXPECT_EQ(1, *GPtr);\n\n \/\/ Make a second function identical to the first, referring to the same\n \/\/ global.\n Function *F2 = makeReturnGlobal(\"F2\", G, M);\n void (*F2Ptr)() =\n reinterpret_cast<void(*)()>((intptr_t)JIT->getPointerToFunction(F2));\n\n \/\/ F2() should increment G.\n F2Ptr();\n EXPECT_EQ(2, *GPtr);\n\n \/\/ Deallocate F1.\n JIT->freeMachineCodeForFunction(F1);\n\n \/\/ F2() should *still* increment G.\n F2Ptr();\n EXPECT_EQ(3, *GPtr);\n}\n\nint PlusOne(int arg) {\n return arg + 1;\n}\n\nTEST_F(JITTest, FarCallToKnownFunction) {\n \/\/ x86-64 can only make direct calls to functions within 32 bits of\n \/\/ the current PC. To call anything farther away, we have to load\n \/\/ the address into a register and call through the register. The\n \/\/ current JIT does this by allocating a stub for any far call.\n \/\/ There was a bug in which the JIT tried to emit a direct call when\n \/\/ the target was already in the JIT's global mappings and lazy\n \/\/ compilation was disabled.\n\n Function *KnownFunction = Function::Create(\n TypeBuilder<int(int), false>::get(Context),\n GlobalValue::ExternalLinkage, \"known\", M);\n TheJIT->addGlobalMapping(KnownFunction, (void*)(intptr_t)PlusOne);\n\n \/\/ int test() { return known(7); }\n Function *TestFunction = Function::Create(\n TypeBuilder<int(), false>::get(Context),\n GlobalValue::ExternalLinkage, \"test\", M);\n BasicBlock *Entry = BasicBlock::Create(Context, \"entry\", TestFunction);\n IRBuilder<> Builder(Entry);\n Value *result = Builder.CreateCall(\n KnownFunction,\n ConstantInt::get(TypeBuilder<int, false>::get(Context), 7));\n Builder.CreateRet(result);\n\n TheJIT->EnableDlsymStubs(false);\n TheJIT->DisableLazyCompilation();\n int (*TestFunctionPtr)() = reinterpret_cast<int(*)()>(\n (intptr_t)TheJIT->getPointerToFunction(TestFunction));\n \/\/ This used to crash in trying to call PlusOne().\n EXPECT_EQ(8, TestFunctionPtr());\n}\n\n#if !defined(__arm__) && !defined(__powerpc__)\n\/\/ Test a function C which calls A and B which call each other.\nTEST_F(JITTest, NonLazyCompilationStillNeedsStubs) {\n TheJIT->DisableLazyCompilation();\n\n const FunctionType *Func1Ty =\n cast<FunctionType>(TypeBuilder<void(void), false>::get(Context));\n std::vector<const Type*> arg_types;\n arg_types.push_back(Type::getInt1Ty(Context));\n const FunctionType *FuncTy = FunctionType::get(\n Type::getVoidTy(Context), arg_types, false);\n Function *Func1 = Function::Create(Func1Ty, Function::ExternalLinkage,\n \"func1\", M);\n Function *Func2 = Function::Create(FuncTy, Function::InternalLinkage,\n \"func2\", M);\n Function *Func3 = Function::Create(FuncTy, Function::InternalLinkage,\n \"func3\", M);\n BasicBlock *Block1 = BasicBlock::Create(Context, \"block1\", Func1);\n BasicBlock *Block2 = BasicBlock::Create(Context, \"block2\", Func2);\n BasicBlock *True2 = BasicBlock::Create(Context, \"cond_true\", Func2);\n BasicBlock *False2 = BasicBlock::Create(Context, \"cond_false\", Func2);\n BasicBlock *Block3 = BasicBlock::Create(Context, \"block3\", Func3);\n BasicBlock *True3 = BasicBlock::Create(Context, \"cond_true\", Func3);\n BasicBlock *False3 = BasicBlock::Create(Context, \"cond_false\", Func3);\n\n \/\/ Make Func1 call Func2(0) and Func3(0).\n IRBuilder<> Builder(Block1);\n Builder.CreateCall(Func2, ConstantInt::getTrue(Context));\n Builder.CreateCall(Func3, ConstantInt::getTrue(Context));\n Builder.CreateRetVoid();\n\n \/\/ void Func2(bool b) { if (b) { Func3(false); return; } return; }\n Builder.SetInsertPoint(Block2);\n Builder.CreateCondBr(Func2->arg_begin(), True2, False2);\n Builder.SetInsertPoint(True2);\n Builder.CreateCall(Func3, ConstantInt::getFalse(Context));\n Builder.CreateRetVoid();\n Builder.SetInsertPoint(False2);\n Builder.CreateRetVoid();\n\n \/\/ void Func3(bool b) { if (b) { Func2(false); return; } return; }\n Builder.SetInsertPoint(Block3);\n Builder.CreateCondBr(Func3->arg_begin(), True3, False3);\n Builder.SetInsertPoint(True3);\n Builder.CreateCall(Func2, ConstantInt::getFalse(Context));\n Builder.CreateRetVoid();\n Builder.SetInsertPoint(False3);\n Builder.CreateRetVoid();\n\n \/\/ Compile the function to native code\n void (*F1Ptr)() =\n reinterpret_cast<void(*)()>((intptr_t)TheJIT->getPointerToFunction(Func1));\n\n F1Ptr();\n}\n\n\/\/ Regression test for PR5162. This used to trigger an AssertingVH inside the\n\/\/ JIT's Function to stub mapping.\nTEST_F(JITTest, NonLazyLeaksNoStubs) {\n TheJIT->DisableLazyCompilation();\n\n \/\/ Create two functions with a single basic block each.\n const FunctionType *FuncTy =\n cast<FunctionType>(TypeBuilder<int(), false>::get(Context));\n Function *Func1 = Function::Create(FuncTy, Function::ExternalLinkage,\n \"func1\", M);\n Function *Func2 = Function::Create(FuncTy, Function::InternalLinkage,\n \"func2\", M);\n BasicBlock *Block1 = BasicBlock::Create(Context, \"block1\", Func1);\n BasicBlock *Block2 = BasicBlock::Create(Context, \"block2\", Func2);\n\n \/\/ The first function calls the second and returns the result\n IRBuilder<> Builder(Block1);\n Value *Result = Builder.CreateCall(Func2);\n Builder.CreateRet(Result);\n\n \/\/ The second function just returns a constant\n Builder.SetInsertPoint(Block2);\n Builder.CreateRet(ConstantInt::get(TypeBuilder<int, false>::get(Context),42));\n\n \/\/ Compile the function to native code\n (void)TheJIT->getPointerToFunction(Func1);\n\n \/\/ Free the JIT state for the functions\n TheJIT->freeMachineCodeForFunction(Func1);\n TheJIT->freeMachineCodeForFunction(Func2);\n\n \/\/ Delete the first function (and show that is has no users)\n EXPECT_EQ(Func1->getNumUses(), 0u);\n Func1->eraseFromParent();\n\n \/\/ Delete the second function (and show that it has no users - it had one,\n \/\/ func1 but that's gone now)\n EXPECT_EQ(Func2->getNumUses(), 0u);\n Func2->eraseFromParent();\n}\n#endif\n\n\/\/ This code is copied from JITEventListenerTest, but it only runs once for all\n\/\/ the tests in this directory. Everything seems fine, but that's strange\n\/\/ behavior.\nclass JITEnvironment : public testing::Environment {\n virtual void SetUp() {\n \/\/ Required to create a JIT.\n InitializeNativeTarget();\n }\n};\ntesting::Environment* const jit_env =\n testing::AddGlobalTestEnvironment(new JITEnvironment);\n\n}\n<commit_msg>PowerPC ifdef'ing considered more complicated than one might like.<commit_after>\/\/===- JITTest.cpp - Unit tests for the JIT -------------------------------===\/\/\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 \"gtest\/gtest.h\"\n#include \"llvm\/ADT\/OwningPtr.h\"\n#include \"llvm\/BasicBlock.h\"\n#include \"llvm\/Constant.h\"\n#include \"llvm\/Constants.h\"\n#include \"llvm\/DerivedTypes.h\"\n#include \"llvm\/ExecutionEngine\/JIT.h\"\n#include \"llvm\/ExecutionEngine\/JITMemoryManager.h\"\n#include \"llvm\/Function.h\"\n#include \"llvm\/GlobalValue.h\"\n#include \"llvm\/GlobalVariable.h\"\n#include \"llvm\/LLVMContext.h\"\n#include \"llvm\/Module.h\"\n#include \"llvm\/ModuleProvider.h\"\n#include \"llvm\/Support\/IRBuilder.h\"\n#include \"llvm\/Support\/TypeBuilder.h\"\n#include \"llvm\/Target\/TargetSelect.h\"\n#include \"llvm\/Type.h\"\n\nusing namespace llvm;\n\nnamespace {\n\nFunction *makeReturnGlobal(std::string Name, GlobalVariable *G, Module *M) {\n std::vector<const Type*> params;\n const FunctionType *FTy = FunctionType::get(G->getType()->getElementType(),\n params, false);\n Function *F = Function::Create(FTy, GlobalValue::ExternalLinkage, Name, M);\n BasicBlock *Entry = BasicBlock::Create(M->getContext(), \"entry\", F);\n IRBuilder<> builder(Entry);\n Value *Load = builder.CreateLoad(G);\n const Type *GTy = G->getType()->getElementType();\n Value *Add = builder.CreateAdd(Load, ConstantInt::get(GTy, 1LL));\n builder.CreateStore(Add, G);\n builder.CreateRet(Add);\n return F;\n}\n\nclass JITTest : public testing::Test {\n protected:\n virtual void SetUp() {\n M = new Module(\"<main>\", Context);\n std::string Error;\n TheJIT.reset(EngineBuilder(M).setEngineKind(EngineKind::JIT)\n .setErrorStr(&Error).create());\n ASSERT_TRUE(TheJIT.get() != NULL) << Error;\n }\n\n LLVMContext Context;\n Module *M; \/\/ Owned by ExecutionEngine.\n OwningPtr<ExecutionEngine> TheJIT;\n};\n\n\/\/ Regression test for a bug. The JIT used to allocate globals inside the same\n\/\/ memory block used for the function, and when the function code was freed,\n\/\/ the global was left in the same place. This test allocates a function\n\/\/ that uses and global, deallocates it, and then makes sure that the global\n\/\/ stays alive after that.\nTEST(JIT, GlobalInFunction) {\n LLVMContext context;\n Module *M = new Module(\"<main>\", context);\n ExistingModuleProvider *MP = new ExistingModuleProvider(M);\n\n JITMemoryManager *MemMgr = JITMemoryManager::CreateDefaultMemManager();\n \/\/ Tell the memory manager to poison freed memory so that accessing freed\n \/\/ memory is more easily tested.\n MemMgr->setPoisonMemory(true);\n std::string Error;\n OwningPtr<ExecutionEngine> JIT(EngineBuilder(MP)\n .setEngineKind(EngineKind::JIT)\n .setErrorStr(&Error)\n .setJITMemoryManager(MemMgr)\n \/\/ The next line enables the fix:\n .setAllocateGVsWithCode(false)\n .create());\n ASSERT_EQ(Error, \"\");\n\n \/\/ Create a global variable.\n const Type *GTy = Type::getInt32Ty(context);\n GlobalVariable *G = new GlobalVariable(\n *M,\n GTy,\n false, \/\/ Not constant.\n GlobalValue::InternalLinkage,\n Constant::getNullValue(GTy),\n \"myglobal\");\n\n \/\/ Make a function that points to a global.\n Function *F1 = makeReturnGlobal(\"F1\", G, M);\n\n \/\/ Get the pointer to the native code to force it to JIT the function and\n \/\/ allocate space for the global.\n void (*F1Ptr)() =\n reinterpret_cast<void(*)()>((intptr_t)JIT->getPointerToFunction(F1));\n\n \/\/ Since F1 was codegen'd, a pointer to G should be available.\n int32_t *GPtr = (int32_t*)JIT->getPointerToGlobalIfAvailable(G);\n ASSERT_NE((int32_t*)NULL, GPtr);\n EXPECT_EQ(0, *GPtr);\n\n \/\/ F1() should increment G.\n F1Ptr();\n EXPECT_EQ(1, *GPtr);\n\n \/\/ Make a second function identical to the first, referring to the same\n \/\/ global.\n Function *F2 = makeReturnGlobal(\"F2\", G, M);\n void (*F2Ptr)() =\n reinterpret_cast<void(*)()>((intptr_t)JIT->getPointerToFunction(F2));\n\n \/\/ F2() should increment G.\n F2Ptr();\n EXPECT_EQ(2, *GPtr);\n\n \/\/ Deallocate F1.\n JIT->freeMachineCodeForFunction(F1);\n\n \/\/ F2() should *still* increment G.\n F2Ptr();\n EXPECT_EQ(3, *GPtr);\n}\n\nint PlusOne(int arg) {\n return arg + 1;\n}\n\nTEST_F(JITTest, FarCallToKnownFunction) {\n \/\/ x86-64 can only make direct calls to functions within 32 bits of\n \/\/ the current PC. To call anything farther away, we have to load\n \/\/ the address into a register and call through the register. The\n \/\/ current JIT does this by allocating a stub for any far call.\n \/\/ There was a bug in which the JIT tried to emit a direct call when\n \/\/ the target was already in the JIT's global mappings and lazy\n \/\/ compilation was disabled.\n\n Function *KnownFunction = Function::Create(\n TypeBuilder<int(int), false>::get(Context),\n GlobalValue::ExternalLinkage, \"known\", M);\n TheJIT->addGlobalMapping(KnownFunction, (void*)(intptr_t)PlusOne);\n\n \/\/ int test() { return known(7); }\n Function *TestFunction = Function::Create(\n TypeBuilder<int(), false>::get(Context),\n GlobalValue::ExternalLinkage, \"test\", M);\n BasicBlock *Entry = BasicBlock::Create(Context, \"entry\", TestFunction);\n IRBuilder<> Builder(Entry);\n Value *result = Builder.CreateCall(\n KnownFunction,\n ConstantInt::get(TypeBuilder<int, false>::get(Context), 7));\n Builder.CreateRet(result);\n\n TheJIT->EnableDlsymStubs(false);\n TheJIT->DisableLazyCompilation();\n int (*TestFunctionPtr)() = reinterpret_cast<int(*)()>(\n (intptr_t)TheJIT->getPointerToFunction(TestFunction));\n \/\/ This used to crash in trying to call PlusOne().\n EXPECT_EQ(8, TestFunctionPtr());\n}\n\n#if !defined(__arm__) && !defined(__powerpc__) && !defined(__ppc__)\n\/\/ Test a function C which calls A and B which call each other.\nTEST_F(JITTest, NonLazyCompilationStillNeedsStubs) {\n TheJIT->DisableLazyCompilation();\n\n const FunctionType *Func1Ty =\n cast<FunctionType>(TypeBuilder<void(void), false>::get(Context));\n std::vector<const Type*> arg_types;\n arg_types.push_back(Type::getInt1Ty(Context));\n const FunctionType *FuncTy = FunctionType::get(\n Type::getVoidTy(Context), arg_types, false);\n Function *Func1 = Function::Create(Func1Ty, Function::ExternalLinkage,\n \"func1\", M);\n Function *Func2 = Function::Create(FuncTy, Function::InternalLinkage,\n \"func2\", M);\n Function *Func3 = Function::Create(FuncTy, Function::InternalLinkage,\n \"func3\", M);\n BasicBlock *Block1 = BasicBlock::Create(Context, \"block1\", Func1);\n BasicBlock *Block2 = BasicBlock::Create(Context, \"block2\", Func2);\n BasicBlock *True2 = BasicBlock::Create(Context, \"cond_true\", Func2);\n BasicBlock *False2 = BasicBlock::Create(Context, \"cond_false\", Func2);\n BasicBlock *Block3 = BasicBlock::Create(Context, \"block3\", Func3);\n BasicBlock *True3 = BasicBlock::Create(Context, \"cond_true\", Func3);\n BasicBlock *False3 = BasicBlock::Create(Context, \"cond_false\", Func3);\n\n \/\/ Make Func1 call Func2(0) and Func3(0).\n IRBuilder<> Builder(Block1);\n Builder.CreateCall(Func2, ConstantInt::getTrue(Context));\n Builder.CreateCall(Func3, ConstantInt::getTrue(Context));\n Builder.CreateRetVoid();\n\n \/\/ void Func2(bool b) { if (b) { Func3(false); return; } return; }\n Builder.SetInsertPoint(Block2);\n Builder.CreateCondBr(Func2->arg_begin(), True2, False2);\n Builder.SetInsertPoint(True2);\n Builder.CreateCall(Func3, ConstantInt::getFalse(Context));\n Builder.CreateRetVoid();\n Builder.SetInsertPoint(False2);\n Builder.CreateRetVoid();\n\n \/\/ void Func3(bool b) { if (b) { Func2(false); return; } return; }\n Builder.SetInsertPoint(Block3);\n Builder.CreateCondBr(Func3->arg_begin(), True3, False3);\n Builder.SetInsertPoint(True3);\n Builder.CreateCall(Func2, ConstantInt::getFalse(Context));\n Builder.CreateRetVoid();\n Builder.SetInsertPoint(False3);\n Builder.CreateRetVoid();\n\n \/\/ Compile the function to native code\n void (*F1Ptr)() =\n reinterpret_cast<void(*)()>((intptr_t)TheJIT->getPointerToFunction(Func1));\n\n F1Ptr();\n}\n\n\/\/ Regression test for PR5162. This used to trigger an AssertingVH inside the\n\/\/ JIT's Function to stub mapping.\nTEST_F(JITTest, NonLazyLeaksNoStubs) {\n TheJIT->DisableLazyCompilation();\n\n \/\/ Create two functions with a single basic block each.\n const FunctionType *FuncTy =\n cast<FunctionType>(TypeBuilder<int(), false>::get(Context));\n Function *Func1 = Function::Create(FuncTy, Function::ExternalLinkage,\n \"func1\", M);\n Function *Func2 = Function::Create(FuncTy, Function::InternalLinkage,\n \"func2\", M);\n BasicBlock *Block1 = BasicBlock::Create(Context, \"block1\", Func1);\n BasicBlock *Block2 = BasicBlock::Create(Context, \"block2\", Func2);\n\n \/\/ The first function calls the second and returns the result\n IRBuilder<> Builder(Block1);\n Value *Result = Builder.CreateCall(Func2);\n Builder.CreateRet(Result);\n\n \/\/ The second function just returns a constant\n Builder.SetInsertPoint(Block2);\n Builder.CreateRet(ConstantInt::get(TypeBuilder<int, false>::get(Context),42));\n\n \/\/ Compile the function to native code\n (void)TheJIT->getPointerToFunction(Func1);\n\n \/\/ Free the JIT state for the functions\n TheJIT->freeMachineCodeForFunction(Func1);\n TheJIT->freeMachineCodeForFunction(Func2);\n\n \/\/ Delete the first function (and show that is has no users)\n EXPECT_EQ(Func1->getNumUses(), 0u);\n Func1->eraseFromParent();\n\n \/\/ Delete the second function (and show that it has no users - it had one,\n \/\/ func1 but that's gone now)\n EXPECT_EQ(Func2->getNumUses(), 0u);\n Func2->eraseFromParent();\n}\n#endif\n\n\/\/ This code is copied from JITEventListenerTest, but it only runs once for all\n\/\/ the tests in this directory. Everything seems fine, but that's strange\n\/\/ behavior.\nclass JITEnvironment : public testing::Environment {\n virtual void SetUp() {\n \/\/ Required to create a JIT.\n InitializeNativeTarget();\n }\n};\ntesting::Environment* const jit_env =\n testing::AddGlobalTestEnvironment(new JITEnvironment);\n\n}\n<|endoftext|>"} {"text":"<commit_before>#include <iostream>\n\nclass Fracao {\n private:\n int num;\n int den;\n\n friend std::ostream &operator<<( std::ostream &saida, const Fracao &a );\n friend std::istream &operator>>( std::istream &entrada, Fracao &a );\n\n public:\n void imprimir( void ) const {\n std::cout << *this << '\\n';\n }\n\n void setNum( const int num ) {\n this->num = num;\n }\n\n void setDen( const int den ) {\n if( den != 0 ) {\n this->den = den;\n } else {\n std::cout << \"Erro denominador\" << '\\n';\n this->den = 1;\n }\n }\n\n int getNum( void ) const {\n return num;\n }\n\n int getDen( void ) const {\n return den;\n }\n\n Fracao( const int num, const int den ) {\n setNum( num );\n setDen( den );\n\n imprimir();\n }\n\n ~Fracao( void ) {\n std::cout << \"Destrutor: \";\n imprimir();\n std::cout << '\\n';\n }\n\n Fracao operator*( const Fracao &b ) const {\n return Fracao( this->getNum() * b.getNum(), this->getDen() * b.getDen() );\n }\n\n Fracao operator*( const int &b ) const {\n return Fracao( this->getNum() * b, this->getDen() );\n }\n\n Fracao operator+( const Fracao &b ) const {\n if( this->getDen() == b.getDen() ) {\n return Fracao( this->getNum() + b.getNum(), this->getDen() );\n } else {\n return Fracao( this->getNum() * b.getDen() + b.getNum() * this->getDen(),\n this->getDen() * b.getDen() );\n }\n }\n\n Fracao operator+( const int &a ) const {\n return Fracao( a * this->getDen() + this->getNum(), this->getDen() );\n }\n\n Fracao operator-( const Fracao &b ) const {\n if( this->getDen() == b.getDen() ) {\n return Fracao( this->getNum() - b.getNum(), this->getDen() );\n } else {\n return Fracao( this->getNum() * b.getDen() + b.getNum() * this->getDen(),\n this->getDen() * b.getDen() );\n }\n }\n\n Fracao operator-( const int &a ) const {\n return Fracao( this->getNum() - a * this->getDen(), this->getDen() );\n }\n\n Fracao operator\/( const Fracao &b ) const {\n return Fracao( this->getNum() * b.getDen(), this->getDen() * b.getNum() );\n }\n\n Fracao operator\/( const int &a ) const {\n return Fracao( this->getNum(), a * this->getDen() );\n }\n};\n\nFracao operator*( const int &b, const Fracao &a ) {\n return Fracao( a.getNum() * b, a.getDen() );\n}\n\nFracao operator+( const int &a, const Fracao &b ) {\n return Fracao( a * b.getDen() + b.getNum(), b.getDen() );\n}\n\nFracao operator-( const int &a, const Fracao &b ) {\n return Fracao( a * b.getDen() - b.getNum(), b.getDen() );\n}\n\nFracao operator\/( const int &a, const Fracao &b ) {\n return Fracao( a * b.getDen(), b.getNum() );\n}\n\nstd::istream &operator>>( std::istream &entrada, Fracao &a ) {\n int numerador, denominador;\n char barra;\n\n entrada >> numerador >> barra >> denominador;\n\n a.setNum( numerador );\n a.setDen( denominador );\n\n return entrada;\n}\n\nstd::ostream &operator<<( std::ostream &saida, const Fracao &a ) {\n saida << a.num << \"\/\" << a.den;\n return saida;\n}\n\nint main( void ) {\n Fracao a( 1, 2 );\n Fracao b( 2, 4 );\n\n std::cout << \"A:\" << a << '\\n';\n\n Fracao resultado = a * b;\n\n std::cin >> b;\n std::cout << b << '\\n';\n\n return 0;\n}\n<commit_msg>Sobrecarga operadores relacionais<commit_after>#include <iostream>\n\nclass Fracao {\n private:\n int num;\n int den;\n\n friend std::ostream &operator<<( std::ostream &saida, const Fracao &a );\n friend std::istream &operator>>( std::istream &entrada, Fracao &a );\n\n public:\n void imprimir( void ) const {\n std::cout << *this << '\\n';\n }\n\n void setNum( const int num ) {\n this->num = num;\n }\n\n void setDen( const int den ) {\n if( den != 0 ) {\n this->den = den;\n } else {\n std::cout << \"Erro denominador\" << '\\n';\n this->den = 1;\n }\n }\n\n int getNum( void ) const {\n return num;\n }\n\n int getDen( void ) const {\n return den;\n }\n\n Fracao( const int num, const int den ) {\n setNum( num );\n setDen( den );\n\n imprimir();\n }\n\n ~Fracao( void ) {\n std::cout << \"Destrutor: \";\n imprimir();\n std::cout << '\\n';\n }\n\n Fracao operator*( const Fracao &b ) const {\n return Fracao( this->getNum() * b.getNum(), this->getDen() * b.getDen() );\n }\n\n Fracao operator*( const int &b ) const {\n return Fracao( this->getNum() * b, this->getDen() );\n }\n\n Fracao operator+( const Fracao &b ) const {\n if( this->getDen() == b.getDen() ) {\n return Fracao( this->getNum() + b.getNum(), this->getDen() );\n } else {\n return Fracao( this->getNum() * b.getDen() + b.getNum() * this->getDen(),\n this->getDen() * b.getDen() );\n }\n }\n\n Fracao operator+( const int &a ) const {\n return Fracao( a * this->getDen() + this->getNum(), this->getDen() );\n }\n\n Fracao operator-( const Fracao &b ) const {\n if( this->getDen() == b.getDen() ) {\n return Fracao( this->getNum() - b.getNum(), this->getDen() );\n } else {\n return Fracao( this->getNum() * b.getDen() + b.getNum() * this->getDen(),\n this->getDen() * b.getDen() );\n }\n }\n\n Fracao operator-( const int &a ) const {\n return Fracao( this->getNum() - a * this->getDen(), this->getDen() );\n }\n\n Fracao operator\/( const Fracao &b ) const {\n return Fracao( this->getNum() * b.getDen(), this->getDen() * b.getNum() );\n }\n\n Fracao operator\/( const int &a ) const {\n return Fracao( this->getNum(), a * this->getDen() );\n }\n\n bool operator>( const Fracao &b ) const {\n return ( (float)this->num \/ this->den > (float)b.num \/ b.den );\n }\n\n bool operator==( const Fracao &b ) const {\n return ( (float)this->num \/ this->den == (float)b.num \/ b.den );\n }\n\n bool operator<( const Fracao &b ) const {\n return ( (float)this->num \/ this->den < (float)b.num \/ b.den );\n }\n\n bool operator!=( const Fracao &b ) const {\n return ( !( *this == b ) );\n }\n};\n\nFracao operator*( const int &b, const Fracao &a ) {\n return Fracao( a.getNum() * b, a.getDen() );\n}\n\nFracao operator+( const int &a, const Fracao &b ) {\n return Fracao( a * b.getDen() + b.getNum(), b.getDen() );\n}\n\nFracao operator-( const int &a, const Fracao &b ) {\n return Fracao( a * b.getDen() - b.getNum(), b.getDen() );\n}\n\nFracao operator\/( const int &a, const Fracao &b ) {\n return Fracao( a * b.getDen(), b.getNum() );\n}\n\nstd::istream &operator>>( std::istream &entrada, Fracao &a ) {\n int numerador, denominador;\n char barra;\n\n entrada >> numerador >> barra >> denominador;\n\n a.setNum( numerador );\n a.setDen( denominador );\n\n return entrada;\n}\n\nstd::ostream &operator<<( std::ostream &saida, const Fracao &a ) {\n saida << a.num << \"\/\" << a.den;\n return saida;\n}\n\nint main( void ) {\n Fracao a( 1, 2 );\n Fracao b( 1, 4 );\n\n std::cout << \"A:\" << a << '\\n';\n\n if( b > a ) {\n std::cout << \"B>A\" << '\\n';\n } else {\n std::cout << \"B<=A\" << '\\n';\n }\n\n Fracao resultado = a * b;\n\n std::cin >> b;\n std::cout << b << '\\n';\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\/partition.hpp\"\n\n#include <caf\/event_based_actor.hpp>\n#include <caf\/local_actor.hpp>\n#include <caf\/make_counted.hpp>\n#include <caf\/stateful_actor.hpp>\n\n#include \"vast\/concept\/printable\/to_string.hpp\"\n#include \"vast\/concept\/printable\/vast\/expression.hpp\"\n#include \"vast\/concept\/printable\/vast\/uuid.hpp\"\n#include \"vast\/detail\/assert.hpp\"\n#include \"vast\/event.hpp\"\n#include \"vast\/expression_visitors.hpp\"\n#include \"vast\/ids.hpp\"\n#include \"vast\/load.hpp\"\n#include \"vast\/logger.hpp\"\n#include \"vast\/save.hpp\"\n#include \"vast\/system\/atoms.hpp\"\n#include \"vast\/system\/index.hpp\"\n#include \"vast\/system\/spawn_indexer.hpp\"\n#include \"vast\/system\/table_indexer.hpp\"\n#include \"vast\/time.hpp\"\n\nusing namespace std::chrono;\nusing namespace caf;\n\nnamespace vast::system {\n\npartition::partition(index_state* state, uuid id, size_t max_capacity)\n : state_(state),\n id_(std::move(id)),\n capacity_(max_capacity) {\n \/\/ If the directory already exists, we must have some state from the past and\n \/\/ are pre-loading all INDEXER types we are aware of.\n VAST_ASSERT(state != nullptr);\n}\n\npartition::~partition() noexcept {\n flush_to_disk();\n}\n\n\/\/ -- persistence --------------------------------------------------------------\n\ncaf::error partition::init() {\n VAST_TRACE(\"\");\n auto file_path = meta_file();\n if (!exists(file_path))\n return ec::no_such_file;\n if (auto err = load(nullptr, file_path , meta_data_))\n return err;\n VAST_DEBUG(state_->self, \"loaded partition\", id_, \"from disk with\",\n meta_data_.types.size(), \"layouts\");\n return caf::none;\n}\n\ncaf::error partition::flush_to_disk() {\n if (meta_data_.dirty) {\n \/\/ Write all layouts to disk.\n if (auto err = save(nullptr, meta_file(), meta_data_))\n return err;\n meta_data_.dirty = false;\n }\n \/\/ Write state for each layout to disk.\n for (auto& kvp : table_indexers_)\n if (auto err = kvp.second.flush_to_disk())\n return err;\n return caf::none;\n}\n\n\/\/ -- properties ---------------------------------------------------------------\n\nnamespace {\n\nusing eval_mapping = evaluation_map::mapped_type;\n\ncaf::actor fetch_indexer(table_indexer& tbl, const data_extractor& dx,\n [[maybe_unused]] relational_operator op,\n [[maybe_unused]] const data& x) {\n VAST_TRACE(VAST_ARG(tbl), VAST_ARG(dx), VAST_ARG(op), VAST_ARG(x));\n \/\/ Sanity check.\n if (dx.offset.empty())\n return nullptr;\n auto& r = caf::get<record_type>(dx.type);\n auto k = r.resolve(dx.offset);\n VAST_ASSERT(k);\n auto index = r.flat_index_at(dx.offset);\n if (!index) {\n VAST_DEBUG(tbl.state().self, \"got invalid offset for record type\", dx.type);\n return nullptr;\n }\n return tbl.indexer_at(*index);\n}\n\ncaf::actor fetch_indexer(table_indexer& tbl, const attribute_extractor& ex,\n relational_operator op, const data& x) {\n VAST_TRACE(VAST_ARG(tbl), VAST_ARG(ex), VAST_ARG(op), VAST_ARG(x));\n auto& layout = tbl.layout();\n \/\/ Predicate of form \"&type == ...\"\n if (ex.attr == system::type_atom::value) {\n VAST_ASSERT(caf::holds_alternative<std::string>(x));\n \/\/ Doesn't apply if the query name doesn't match our type.\n if (layout.name() != caf::get<std::string>(x))\n return nullptr;\n \/\/ We know the answer immediately: all IDs that are part of the table.\n \/\/ However, we still have to \"lift\" this result into an actor for the\n \/\/ EVALUATOR.\n \/\/ TODO: Spawning a one-shot actor is quite expensive. Maybe the\n \/\/ table_indexer could instead maintain this actor lazily.\n auto row_ids = tbl.row_ids();\n return tbl.state().self->spawn([row_ids]() -> caf::behavior {\n return [=](const curried_predicate&) { return row_ids; };\n });\n }\n if (ex.attr == system::time_atom::value) {\n \/\/ TODO: reconsider whether we still want to support \"&time ...\" queries.\n VAST_ASSERT(caf::holds_alternative<timestamp>(x));\n if (layout.fields.empty() || layout.fields[0].type != timestamp_type{})\n return nullptr;\n record_type rs_rec{{\"timestamp\", timestamp_type{}}};\n type t = rs_rec;\n data_extractor dx{t, vast::offset{0}};\n \/\/ Redirect to \"ordinary data lookup\" on column 0.\n return fetch_indexer(tbl, dx, op, x);\n }\n VAST_WARNING(tbl.state().self, \"got unsupported attribute:\", ex.attr);\n return nullptr;\n}\n\n} \/\/ namespace\n\nevaluation_map partition::eval(const expression& expr) {\n evaluation_map result;\n \/\/ Step #1: use the expression to select matching layouts.\n for (auto layout : layouts()) {\n \/\/ Step #2: Split the resolved expression into its predicates and select\n \/\/ all matching INDEXER actors per predicate.\n auto resolved = resolve(expr, layout);\n \/\/ Skip any layout that we cannot resolve.\n if (resolved.empty())\n continue;\n \/\/ Add triples (offset, curried predicate, and INDEXER) to evaluation map.\n auto& triples = result[layout];\n for (auto& kvp: resolved) {\n auto& pred = kvp.second;\n auto hdl = caf::visit(detail::overload(\n [&](const attribute_extractor& ex,\n const data& x) {\n return fetch_indexer(get_or_add(layout).first,\n ex, pred.op, x);\n },\n [&](const data_extractor& dx, const data& x) {\n return fetch_indexer(get_or_add(layout).first,\n dx, pred.op, x);\n },\n [](const auto&, const auto&) {\n return caf::actor{};\n }),\n pred.lhs, pred.rhs);\n if (hdl != nullptr) {\n VAST_DEBUG_ANON(__func__, \"adds INDEXER\", hdl, \"to the evaluation map\");\n triples.emplace_back(kvp.first, curried(pred), std::move(hdl));\n }\n }\n }\n return result;\n}\n\nstd::vector<record_type> partition::layouts() const {\n std::vector<record_type> result;\n auto& ts = meta_data_.types;\n result.reserve(ts.size());\n std::transform(ts.begin(), ts.end(), std::back_inserter(result),\n [](auto& kvp) { return kvp.second; });\n return result;\n}\n\npath partition::base_dir() const {\n return state_->dir \/ to_string(id_);\n}\n\npath partition::meta_file() const {\n return base_dir() \/ \"meta\";\n}\n\nstd::pair<table_indexer&, bool> partition::get_or_add(const record_type& key) {\n VAST_TRACE(VAST_ARG(key));\n auto i = table_indexers_.find(key);\n if (i != table_indexers_.end())\n return {i->second, false};\n auto digest = to_digest(key);\n add_layout(digest, key);\n auto result = table_indexers_.emplace(key, table_indexer{this, key});\n VAST_ASSERT(result.second == true);\n return {result.first->second, true};\n\n}\n\n} \/\/ namespace vast::system\n\nnamespace std {\n\nnamespace {\n\nusing pptr = vast::system::partition_ptr;\n\n} \/\/ namespace <anonymous>\n\nsize_t hash<pptr>::operator()(const pptr& ptr) const {\n hash<vast::uuid> f;\n return ptr != nullptr ? f(ptr->id()) : 0u;\n}\n\n} \/\/ namespace std\n<commit_msg>Fix time attribute lookup in fetch_indexer<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\/partition.hpp\"\n\n#include <caf\/event_based_actor.hpp>\n#include <caf\/local_actor.hpp>\n#include <caf\/make_counted.hpp>\n#include <caf\/stateful_actor.hpp>\n\n#include \"vast\/concept\/printable\/to_string.hpp\"\n#include \"vast\/concept\/printable\/vast\/expression.hpp\"\n#include \"vast\/concept\/printable\/vast\/uuid.hpp\"\n#include \"vast\/detail\/assert.hpp\"\n#include \"vast\/event.hpp\"\n#include \"vast\/expression_visitors.hpp\"\n#include \"vast\/ids.hpp\"\n#include \"vast\/load.hpp\"\n#include \"vast\/logger.hpp\"\n#include \"vast\/save.hpp\"\n#include \"vast\/system\/atoms.hpp\"\n#include \"vast\/system\/index.hpp\"\n#include \"vast\/system\/spawn_indexer.hpp\"\n#include \"vast\/system\/table_indexer.hpp\"\n#include \"vast\/time.hpp\"\n\nusing namespace std::chrono;\nusing namespace caf;\n\nnamespace vast::system {\n\npartition::partition(index_state* state, uuid id, size_t max_capacity)\n : state_(state),\n id_(std::move(id)),\n capacity_(max_capacity) {\n \/\/ If the directory already exists, we must have some state from the past and\n \/\/ are pre-loading all INDEXER types we are aware of.\n VAST_ASSERT(state != nullptr);\n}\n\npartition::~partition() noexcept {\n flush_to_disk();\n}\n\n\/\/ -- persistence --------------------------------------------------------------\n\ncaf::error partition::init() {\n VAST_TRACE(\"\");\n auto file_path = meta_file();\n if (!exists(file_path))\n return ec::no_such_file;\n if (auto err = load(nullptr, file_path , meta_data_))\n return err;\n VAST_DEBUG(state_->self, \"loaded partition\", id_, \"from disk with\",\n meta_data_.types.size(), \"layouts\");\n return caf::none;\n}\n\ncaf::error partition::flush_to_disk() {\n if (meta_data_.dirty) {\n \/\/ Write all layouts to disk.\n if (auto err = save(nullptr, meta_file(), meta_data_))\n return err;\n meta_data_.dirty = false;\n }\n \/\/ Write state for each layout to disk.\n for (auto& kvp : table_indexers_)\n if (auto err = kvp.second.flush_to_disk())\n return err;\n return caf::none;\n}\n\n\/\/ -- properties ---------------------------------------------------------------\n\nnamespace {\n\nusing eval_mapping = evaluation_map::mapped_type;\n\ncaf::actor fetch_indexer(table_indexer& tbl, const data_extractor& dx,\n [[maybe_unused]] relational_operator op,\n [[maybe_unused]] const data& x) {\n VAST_TRACE(VAST_ARG(tbl), VAST_ARG(dx), VAST_ARG(op), VAST_ARG(x));\n \/\/ Sanity check.\n if (dx.offset.empty())\n return nullptr;\n auto& r = caf::get<record_type>(dx.type);\n auto k = r.resolve(dx.offset);\n VAST_ASSERT(k);\n auto index = r.flat_index_at(dx.offset);\n if (!index) {\n VAST_DEBUG(tbl.state().self, \"got invalid offset for record type\", dx.type);\n return nullptr;\n }\n return tbl.indexer_at(*index);\n}\n\ncaf::actor fetch_indexer(table_indexer& tbl, const attribute_extractor& ex,\n relational_operator op, const data& x) {\n VAST_TRACE(VAST_ARG(tbl), VAST_ARG(ex), VAST_ARG(op), VAST_ARG(x));\n auto& layout = tbl.layout();\n \/\/ Predicate of form \"&type == ...\"\n if (ex.attr == system::type_atom::value) {\n VAST_ASSERT(caf::holds_alternative<std::string>(x));\n \/\/ Doesn't apply if the query name doesn't match our type.\n if (layout.name() != caf::get<std::string>(x))\n return nullptr;\n \/\/ We know the answer immediately: all IDs that are part of the table.\n \/\/ However, we still have to \"lift\" this result into an actor for the\n \/\/ EVALUATOR.\n \/\/ TODO: Spawning a one-shot actor is quite expensive. Maybe the\n \/\/ table_indexer could instead maintain this actor lazily.\n auto row_ids = tbl.row_ids();\n return tbl.state().self->spawn([row_ids]() -> caf::behavior {\n return [=](const curried_predicate&) { return row_ids; };\n });\n }\n \/\/ Predicate of form \"&time == ...\"\n if (ex.attr == system::time_atom::value) {\n VAST_ASSERT(caf::holds_alternative<timestamp>(x));\n \/\/ Find the column with attribute 'time'.\n auto pred = [](auto& x) {\n return caf::holds_alternative<timestamp_type>(x.type)\n && has_attribute(x.type, \"time\");\n };\n auto& fs = layout.fields;\n auto i = std::find_if(fs.begin(), fs.end(), pred);\n if (i == fs.end())\n return nullptr;\n \/\/ Redirect to \"ordinary data lookup\".\n auto pos = static_cast<size_t>(std::distance(fs.begin(), i));\n data_extractor dx{layout, vast::offset{pos}};\n return fetch_indexer(tbl, dx, op, x);\n }\n VAST_WARNING(tbl.state().self, \"got unsupported attribute:\", ex.attr);\n return nullptr;\n}\n\n} \/\/ namespace\n\nevaluation_map partition::eval(const expression& expr) {\n evaluation_map result;\n \/\/ Step #1: use the expression to select matching layouts.\n for (auto layout : layouts()) {\n \/\/ Step #2: Split the resolved expression into its predicates and select\n \/\/ all matching INDEXER actors per predicate.\n auto resolved = resolve(expr, layout);\n \/\/ Skip any layout that we cannot resolve.\n if (resolved.empty())\n continue;\n \/\/ Add triples (offset, curried predicate, and INDEXER) to evaluation map.\n auto& triples = result[layout];\n for (auto& kvp: resolved) {\n auto& pred = kvp.second;\n auto hdl = caf::visit(detail::overload(\n [&](const attribute_extractor& ex,\n const data& x) {\n return fetch_indexer(get_or_add(layout).first,\n ex, pred.op, x);\n },\n [&](const data_extractor& dx, const data& x) {\n return fetch_indexer(get_or_add(layout).first,\n dx, pred.op, x);\n },\n [](const auto&, const auto&) {\n return caf::actor{};\n }),\n pred.lhs, pred.rhs);\n if (hdl != nullptr) {\n VAST_DEBUG_ANON(__func__, \"adds INDEXER\", hdl, \"to the evaluation map\");\n triples.emplace_back(kvp.first, curried(pred), std::move(hdl));\n }\n }\n }\n return result;\n}\n\nstd::vector<record_type> partition::layouts() const {\n std::vector<record_type> result;\n auto& ts = meta_data_.types;\n result.reserve(ts.size());\n std::transform(ts.begin(), ts.end(), std::back_inserter(result),\n [](auto& kvp) { return kvp.second; });\n return result;\n}\n\npath partition::base_dir() const {\n return state_->dir \/ to_string(id_);\n}\n\npath partition::meta_file() const {\n return base_dir() \/ \"meta\";\n}\n\nstd::pair<table_indexer&, bool> partition::get_or_add(const record_type& key) {\n VAST_TRACE(VAST_ARG(key));\n auto i = table_indexers_.find(key);\n if (i != table_indexers_.end())\n return {i->second, false};\n auto digest = to_digest(key);\n add_layout(digest, key);\n auto result = table_indexers_.emplace(key, table_indexer{this, key});\n VAST_ASSERT(result.second == true);\n return {result.first->second, true};\n\n}\n\n} \/\/ namespace vast::system\n\nnamespace std {\n\nnamespace {\n\nusing pptr = vast::system::partition_ptr;\n\n} \/\/ namespace <anonymous>\n\nsize_t hash<pptr>::operator()(const pptr& ptr) const {\n hash<vast::uuid> f;\n return ptr != nullptr ? f(ptr->id()) : 0u;\n}\n\n} \/\/ namespace std\n<|endoftext|>"} {"text":"<commit_before>\/**\n * @file sparse_autoencoder_test.cpp\n * @author Siddharth Agrawal\n *\n * Test the SparseAutoencoder class.\n *\/\n#include <mlpack\/methods\/sparse_autoencoder\/sparse_autoencoder.hpp>\n#include <mlpack\/methods\/sparse_autoencoder\/sparse_autoencoder_function.hpp>\n#include <mlpack\/methods\/sparse_autoencoder\/activation_functions\/logistic_function.hpp>\n\n#include <mlpack\/core.hpp>\n#include <mlpack\/methods\/sparse_autoencoder\/layer\/base_layer.hpp>\n\n#include <boost\/test\/unit_test.hpp>\n#include \"old_boost_test_definitions.hpp\"\n\nusing namespace mlpack;\nusing namespace arma;\n\nusing SigmoidLayer = nn::SigmoidLayer<nn::LogisticFunction>;\n\n\/\/sparse autoencoder function\nusing SAEF = nn::SparseAutoencoderFunction<SigmoidLayer, SigmoidLayer>;\n\/\/sparse autoencoder function greedy\nusing SAEFG = nn::SparseAutoencoderFunction<SigmoidLayer, SigmoidLayer, std::true_type>;\n\nBOOST_AUTO_TEST_SUITE(SparseAutoencoderTest2);\n\nBOOST_AUTO_TEST_CASE(SparseAutoencoderFunctionEvaluate)\n{\n const size_t vSize = 5;\n const size_t hSize = 3;\n const size_t r = 2 * hSize + 1;\n const size_t c = vSize + 1;\n\n \/\/ Simple fake dataset.\n arma::mat data1(\"0.1 0.2 0.3 0.4 0.5;\"\n \"0.1 0.2 0.3 0.4 0.5;\"\n \"0.1 0.2 0.3 0.4 0.5;\"\n \"0.1 0.2 0.3 0.4 0.5;\"\n \"0.1 0.2 0.3 0.4 0.5\");\n \/\/ Transpose of the above dataset.\n arma::mat data2 = data1.t();\n\n \/\/ Create a SparseAutoencoderFunction. Regularization and KL divergence terms\n \/\/ ignored.\n SAEF saf1(data1, vSize, hSize, 0, 0);\n\n \/\/ Test using first dataset. Values were calculated using Octave.\n BOOST_REQUIRE_CLOSE(saf1.Evaluate(arma::ones(r, c)), 1.190472606540, 1e-5);\n BOOST_REQUIRE_CLOSE(saf1.Evaluate(arma::zeros(r, c)), 0.150000000000, 1e-5);\n BOOST_REQUIRE_CLOSE(saf1.Evaluate(-arma::ones(r, c)), 0.048800332266, 1e-5);\n\n \/\/ Create a SparseAutoencoderFunction. Regularization and KL divergence terms\n \/\/ ignored.\n SAEF saf2(data2, vSize, hSize, 0, 0);\n\n \/\/ Test using second dataset. Values were calculated using Octave.\n BOOST_REQUIRE_CLOSE(saf2.Evaluate(arma::ones(r, c)), 1.197585812647, 1e-5);\n BOOST_REQUIRE_CLOSE(saf2.Evaluate(arma::zeros(r, c)), 0.150000000000, 1e-5);\n BOOST_REQUIRE_CLOSE(saf2.Evaluate(-arma::ones(r, c)), 0.063466617408, 1e-5);\n}\n\nBOOST_AUTO_TEST_CASE(SparseAutoencoderFunctionRandomEvaluate)\n{\n const size_t points = 1000;\n const size_t trials = 50;\n const size_t vSize = 20;\n const size_t hSize = 10;\n const size_t l1 = hSize;\n const size_t l2 = vSize;\n const size_t l3 = 2 * hSize;\n\n \/\/ Initialize a random dataset.\n arma::mat data;\n data.randu(vSize, points);\n\n \/\/ Create a SparseAutoencoderFunction. Regularization and KL divergence terms\n \/\/ ignored.\n SAEF saf(data, vSize, hSize, 0, 0);\n\n \/\/ Run a number of trials.\n for (size_t i = 0; i < trials; i++)\n {\n \/\/ Create a random set of parameters.\n arma::mat parameters;\n parameters.randu(l3 + 1, l2 + 1);\n\n double reconstructionError = 0;\n\n \/\/ Compute error for each training example.\n for (size_t j = 0; j < points; j++)\n {\n arma::mat hiddenLayer, outputLayer, diff;\n\n hiddenLayer = 1.0 \/\n (1 + arma::exp(-(parameters.submat(0, 0, l1 - 1, l2 - 1) *\n data.col(j) + parameters.submat(0, l2, l1 - 1, l2))));\n outputLayer = 1.0 \/\n (1 + arma::exp(-(parameters.submat(l1, 0, l3 - 1,l2 - 1).t()\n * hiddenLayer + parameters.submat(l3, 0, l3, l2 - 1).t())));\n diff = outputLayer - data.col(j);\n\n reconstructionError += 0.5 * arma::sum(arma::sum(diff % diff));\n }\n reconstructionError \/= points;\n\n \/\/ Compare with the value returned by the function.\n BOOST_REQUIRE_CLOSE(saf.Evaluate(parameters), reconstructionError, 1e-5);\n }\n}\n\nBOOST_AUTO_TEST_CASE(SparseAutoencoderFunctionRegularizationEvaluate)\n{\n const size_t points = 1000;\n const size_t trials = 50;\n const size_t vSize = 20;\n const size_t hSize = 10;\n const size_t l2 = vSize;\n const size_t l3 = 2 * hSize;\n\n \/\/ Initialize a random dataset.\n arma::mat data;\n data.randu(vSize, points);\n\n \/\/ 3 objects for comparing regularization costs.\n SAEF safNoReg(data, vSize, hSize, 0, 0);\n SAEF safSmallReg(data, vSize, hSize, 0.5, 0);\n SAEF safBigReg(data, vSize, hSize, 20, 0);\n\n \/\/ Run a number of trials.\n for (size_t i = 0; i < trials; i++)\n {\n \/\/ Create a random set of parameters.\n arma::mat parameters;\n parameters.randu(l3 + 1, l2 + 1);\n\n double wL2SquaredNorm;\n\n wL2SquaredNorm = arma::accu(parameters.submat(0, 0, l3 - 1, l2 - 1) %\n parameters.submat(0, 0, l3 - 1, l2 - 1));\n\n \/\/ Calculate regularization terms.\n const double smallRegTerm = 0.25 * wL2SquaredNorm;\n const double bigRegTerm = 10 * wL2SquaredNorm;\n\n BOOST_REQUIRE_CLOSE(safNoReg.Evaluate(parameters) + smallRegTerm,\n safSmallReg.Evaluate(parameters), 1e-5);\n BOOST_REQUIRE_CLOSE(safNoReg.Evaluate(parameters) + bigRegTerm,\n safBigReg.Evaluate(parameters), 1e-5);\n }\n}\n\nBOOST_AUTO_TEST_CASE(SparseAutoencoderFunctionKLDivergenceEvaluate)\n{\n const size_t points = 1000;\n const size_t trials = 50;\n const size_t vSize = 20;\n const size_t hSize = 10;\n const size_t l1 = hSize;\n const size_t l2 = vSize;\n const size_t l3 = 2 * hSize;\n\n const double rho = 0.01;\n\n \/\/ Initialize a random dataset.\n arma::mat data;\n data.randu(vSize, points);\n\n \/\/ 3 objects for comparing divergence costs.\n SAEF safNoDiv(data, vSize, hSize, 0, 0, rho);\n SAEF safSmallDiv(data, vSize, hSize, 0, 5, rho);\n SAEF safBigDiv(data, vSize, hSize, 0, 20, rho);\n\n \/\/ Run a number of trials.\n for(size_t i = 0; i < trials; i++)\n {\n \/\/ Create a random set of parameters.\n arma::mat parameters;\n parameters.randu(l3 + 1, l2 + 1);\n\n arma::mat rhoCap;\n rhoCap.zeros(hSize, 1);\n\n \/\/ Compute hidden layer activations for each example.\n for (size_t j = 0; j < points; j++)\n {\n arma::mat hiddenLayer;\n\n hiddenLayer = 1.0 \/ (1 +\n arma::exp(-(parameters.submat(0, 0, l1 - 1, l2 - 1) *\n data.col(j) + parameters.submat(0, l2, l1 - 1, l2))));\n rhoCap += hiddenLayer;\n }\n rhoCap \/= points;\n\n \/\/ Calculate divergence terms.\n const double smallDivTerm = 5 * arma::accu(rho * arma::log(rho \/ rhoCap) +\n (1 - rho) * arma::log((1 - rho) \/ (1 - rhoCap)));\n const double bigDivTerm = 20 * arma::accu(rho * arma::log(rho \/ rhoCap) +\n (1 - rho) * arma::log((1 - rho) \/ (1 - rhoCap)));\n\n BOOST_REQUIRE_CLOSE(safNoDiv.Evaluate(parameters) + smallDivTerm,\n safSmallDiv.Evaluate(parameters), 1e-5);\n BOOST_REQUIRE_CLOSE(safNoDiv.Evaluate(parameters) + bigDivTerm,\n safBigDiv.Evaluate(parameters), 1e-5);\n }\n}\n\nBOOST_AUTO_TEST_CASE(SparseAutoencoderFunctionGradient)\n{\n const size_t points = 1000;\n const size_t vSize = 20;\n const size_t hSize = 10;\n const size_t l2 = vSize;\n const size_t l3 = 2 * hSize;\n\n \/\/ Initialize a random dataset.\n arma::mat data;\n data.randu(vSize, points);\n\n \/\/ 3 objects for 3 terms in the cost function. Each term contributes towards\n \/\/ the gradient and thus need to be checked independently.\n SAEFG saf1(data, vSize, hSize, 0, 0);\n SAEFG saf2(data, vSize, hSize, 20, 0);\n SAEFG saf3(data, vSize, hSize, 20, 20);\n\n \/\/ Create a random set of parameters.\n arma::mat parameters;\n parameters.randu(l3 + 1, l2 + 1);\n\n \/\/ Get gradients for the current parameters.\n arma::mat gradient1, gradient2, gradient3;\n saf1.Gradient(parameters, gradient1);\n saf2.Gradient(parameters, gradient2);\n saf3.Gradient(parameters, gradient3);\n\n \/\/ Perturbation constant.\n const double epsilon = 0.0001;\n double costPlus1, costMinus1, numGradient1;\n double costPlus2, costMinus2, numGradient2;\n double costPlus3, costMinus3, numGradient3;\n\n \/\/ For each parameter.\n for (size_t i = 0; i <= l3; i++)\n {\n for (size_t j = 0; j <= l2; j++)\n {\n \/\/ Perturb parameter with a positive constant and get costs.\n parameters(i, j) += epsilon;\n costPlus1 = saf1.Evaluate(parameters);\n costPlus2 = saf2.Evaluate(parameters);\n costPlus3 = saf3.Evaluate(parameters);\n\n \/\/ Perturb parameter with a negative constant and get costs.\n parameters(i, j) -= 2 * epsilon;\n costMinus1 = saf1.Evaluate(parameters);\n costMinus2 = saf2.Evaluate(parameters);\n costMinus3 = saf3.Evaluate(parameters);\n\n \/\/ Compute numerical gradients using the costs calculated above.\n numGradient1 = (costPlus1 - costMinus1) \/ (2 * epsilon);\n numGradient2 = (costPlus2 - costMinus2) \/ (2 * epsilon);\n numGradient3 = (costPlus3 - costMinus3) \/ (2 * epsilon);\n\n \/\/ Restore the parameter value.\n parameters(i, j) += epsilon;\n\n \/\/ Compare numerical and backpropagation gradient values.\n BOOST_REQUIRE_CLOSE(numGradient1, gradient1(i, j), 1e-2);\n BOOST_REQUIRE_CLOSE(numGradient2, gradient2(i, j), 1e-2);\n BOOST_REQUIRE_CLOSE(numGradient3, gradient3(i, j), 1e-2);\n }\n }\n}\n\nBOOST_AUTO_TEST_CASE(SparseAutoencoderMoveTest)\n{\n using SAE = mlpack::nn::SparseAutoencoder<>;\n SAE sae1(2, 2); \n SAE sae2(std::move(sae1));\n BOOST_REQUIRE(sae1.Parameters().n_elem == 0);\n BOOST_REQUIRE(sae1.VisibleSize(), sae2.VisibleSize());\n BOOST_REQUIRE(sae1.HiddenSize(), sae2.HiddenSize());\n BOOST_REQUIRE_CLOSE(sae1.Lambda(), sae2.Lambda(), 1e-5);\n BOOST_REQUIRE_CLOSE(sae1.Beta(), sae2.Beta(), 1e-5);\n BOOST_REQUIRE_CLOSE(sae1.Rho(), sae2.Rho(), 1e-5);\n}\n\nBOOST_AUTO_TEST_SUITE_END();\n<commit_msg>refine test case of move<commit_after>\/**\n * @file sparse_autoencoder_test.cpp\n * @author Siddharth Agrawal\n *\n * Test the SparseAutoencoder class.\n *\/\n#include <mlpack\/methods\/sparse_autoencoder\/sparse_autoencoder.hpp>\n#include <mlpack\/methods\/sparse_autoencoder\/sparse_autoencoder_function.hpp>\n#include <mlpack\/methods\/sparse_autoencoder\/activation_functions\/logistic_function.hpp>\n\n#include <mlpack\/core.hpp>\n#include <mlpack\/methods\/sparse_autoencoder\/layer\/base_layer.hpp>\n\n#include <boost\/test\/unit_test.hpp>\n#include \"old_boost_test_definitions.hpp\"\n\nusing namespace mlpack;\nusing namespace arma;\n\nusing SigmoidLayer = nn::SigmoidLayer<nn::LogisticFunction>;\n\n\/\/sparse autoencoder function\nusing SAEF = nn::SparseAutoencoderFunction<SigmoidLayer, SigmoidLayer>;\n\/\/sparse autoencoder function greedy\nusing SAEFG = nn::SparseAutoencoderFunction<SigmoidLayer, SigmoidLayer, std::true_type>;\n\nBOOST_AUTO_TEST_SUITE(SparseAutoencoderTest2);\n\nBOOST_AUTO_TEST_CASE(SparseAutoencoderFunctionEvaluate)\n{\n const size_t vSize = 5;\n const size_t hSize = 3;\n const size_t r = 2 * hSize + 1;\n const size_t c = vSize + 1;\n\n \/\/ Simple fake dataset.\n arma::mat data1(\"0.1 0.2 0.3 0.4 0.5;\"\n \"0.1 0.2 0.3 0.4 0.5;\"\n \"0.1 0.2 0.3 0.4 0.5;\"\n \"0.1 0.2 0.3 0.4 0.5;\"\n \"0.1 0.2 0.3 0.4 0.5\");\n \/\/ Transpose of the above dataset.\n arma::mat data2 = data1.t();\n\n \/\/ Create a SparseAutoencoderFunction. Regularization and KL divergence terms\n \/\/ ignored.\n SAEF saf1(data1, vSize, hSize, 0, 0);\n\n \/\/ Test using first dataset. Values were calculated using Octave.\n BOOST_REQUIRE_CLOSE(saf1.Evaluate(arma::ones(r, c)), 1.190472606540, 1e-5);\n BOOST_REQUIRE_CLOSE(saf1.Evaluate(arma::zeros(r, c)), 0.150000000000, 1e-5);\n BOOST_REQUIRE_CLOSE(saf1.Evaluate(-arma::ones(r, c)), 0.048800332266, 1e-5);\n\n \/\/ Create a SparseAutoencoderFunction. Regularization and KL divergence terms\n \/\/ ignored.\n SAEF saf2(data2, vSize, hSize, 0, 0);\n\n \/\/ Test using second dataset. Values were calculated using Octave.\n BOOST_REQUIRE_CLOSE(saf2.Evaluate(arma::ones(r, c)), 1.197585812647, 1e-5);\n BOOST_REQUIRE_CLOSE(saf2.Evaluate(arma::zeros(r, c)), 0.150000000000, 1e-5);\n BOOST_REQUIRE_CLOSE(saf2.Evaluate(-arma::ones(r, c)), 0.063466617408, 1e-5);\n}\n\nBOOST_AUTO_TEST_CASE(SparseAutoencoderFunctionRandomEvaluate)\n{\n const size_t points = 1000;\n const size_t trials = 50;\n const size_t vSize = 20;\n const size_t hSize = 10;\n const size_t l1 = hSize;\n const size_t l2 = vSize;\n const size_t l3 = 2 * hSize;\n\n \/\/ Initialize a random dataset.\n arma::mat data;\n data.randu(vSize, points);\n\n \/\/ Create a SparseAutoencoderFunction. Regularization and KL divergence terms\n \/\/ ignored.\n SAEF saf(data, vSize, hSize, 0, 0);\n\n \/\/ Run a number of trials.\n for (size_t i = 0; i < trials; i++)\n {\n \/\/ Create a random set of parameters.\n arma::mat parameters;\n parameters.randu(l3 + 1, l2 + 1);\n\n double reconstructionError = 0;\n\n \/\/ Compute error for each training example.\n for (size_t j = 0; j < points; j++)\n {\n arma::mat hiddenLayer, outputLayer, diff;\n\n hiddenLayer = 1.0 \/\n (1 + arma::exp(-(parameters.submat(0, 0, l1 - 1, l2 - 1) *\n data.col(j) + parameters.submat(0, l2, l1 - 1, l2))));\n outputLayer = 1.0 \/\n (1 + arma::exp(-(parameters.submat(l1, 0, l3 - 1,l2 - 1).t()\n * hiddenLayer + parameters.submat(l3, 0, l3, l2 - 1).t())));\n diff = outputLayer - data.col(j);\n\n reconstructionError += 0.5 * arma::sum(arma::sum(diff % diff));\n }\n reconstructionError \/= points;\n\n \/\/ Compare with the value returned by the function.\n BOOST_REQUIRE_CLOSE(saf.Evaluate(parameters), reconstructionError, 1e-5);\n }\n}\n\nBOOST_AUTO_TEST_CASE(SparseAutoencoderFunctionRegularizationEvaluate)\n{\n const size_t points = 1000;\n const size_t trials = 50;\n const size_t vSize = 20;\n const size_t hSize = 10;\n const size_t l2 = vSize;\n const size_t l3 = 2 * hSize;\n\n \/\/ Initialize a random dataset.\n arma::mat data;\n data.randu(vSize, points);\n\n \/\/ 3 objects for comparing regularization costs.\n SAEF safNoReg(data, vSize, hSize, 0, 0);\n SAEF safSmallReg(data, vSize, hSize, 0.5, 0);\n SAEF safBigReg(data, vSize, hSize, 20, 0);\n\n \/\/ Run a number of trials.\n for (size_t i = 0; i < trials; i++)\n {\n \/\/ Create a random set of parameters.\n arma::mat parameters;\n parameters.randu(l3 + 1, l2 + 1);\n\n double wL2SquaredNorm;\n\n wL2SquaredNorm = arma::accu(parameters.submat(0, 0, l3 - 1, l2 - 1) %\n parameters.submat(0, 0, l3 - 1, l2 - 1));\n\n \/\/ Calculate regularization terms.\n const double smallRegTerm = 0.25 * wL2SquaredNorm;\n const double bigRegTerm = 10 * wL2SquaredNorm;\n\n BOOST_REQUIRE_CLOSE(safNoReg.Evaluate(parameters) + smallRegTerm,\n safSmallReg.Evaluate(parameters), 1e-5);\n BOOST_REQUIRE_CLOSE(safNoReg.Evaluate(parameters) + bigRegTerm,\n safBigReg.Evaluate(parameters), 1e-5);\n }\n}\n\nBOOST_AUTO_TEST_CASE(SparseAutoencoderFunctionKLDivergenceEvaluate)\n{\n const size_t points = 1000;\n const size_t trials = 50;\n const size_t vSize = 20;\n const size_t hSize = 10;\n const size_t l1 = hSize;\n const size_t l2 = vSize;\n const size_t l3 = 2 * hSize;\n\n const double rho = 0.01;\n\n \/\/ Initialize a random dataset.\n arma::mat data;\n data.randu(vSize, points);\n\n \/\/ 3 objects for comparing divergence costs.\n SAEF safNoDiv(data, vSize, hSize, 0, 0, rho);\n SAEF safSmallDiv(data, vSize, hSize, 0, 5, rho);\n SAEF safBigDiv(data, vSize, hSize, 0, 20, rho);\n\n \/\/ Run a number of trials.\n for(size_t i = 0; i < trials; i++)\n {\n \/\/ Create a random set of parameters.\n arma::mat parameters;\n parameters.randu(l3 + 1, l2 + 1);\n\n arma::mat rhoCap;\n rhoCap.zeros(hSize, 1);\n\n \/\/ Compute hidden layer activations for each example.\n for (size_t j = 0; j < points; j++)\n {\n arma::mat hiddenLayer;\n\n hiddenLayer = 1.0 \/ (1 +\n arma::exp(-(parameters.submat(0, 0, l1 - 1, l2 - 1) *\n data.col(j) + parameters.submat(0, l2, l1 - 1, l2))));\n rhoCap += hiddenLayer;\n }\n rhoCap \/= points;\n\n \/\/ Calculate divergence terms.\n const double smallDivTerm = 5 * arma::accu(rho * arma::log(rho \/ rhoCap) +\n (1 - rho) * arma::log((1 - rho) \/ (1 - rhoCap)));\n const double bigDivTerm = 20 * arma::accu(rho * arma::log(rho \/ rhoCap) +\n (1 - rho) * arma::log((1 - rho) \/ (1 - rhoCap)));\n\n BOOST_REQUIRE_CLOSE(safNoDiv.Evaluate(parameters) + smallDivTerm,\n safSmallDiv.Evaluate(parameters), 1e-5);\n BOOST_REQUIRE_CLOSE(safNoDiv.Evaluate(parameters) + bigDivTerm,\n safBigDiv.Evaluate(parameters), 1e-5);\n }\n}\n\nBOOST_AUTO_TEST_CASE(SparseAutoencoderFunctionGradient)\n{\n const size_t points = 1000;\n const size_t vSize = 20;\n const size_t hSize = 10;\n const size_t l2 = vSize;\n const size_t l3 = 2 * hSize;\n\n \/\/ Initialize a random dataset.\n arma::mat data;\n data.randu(vSize, points);\n\n \/\/ 3 objects for 3 terms in the cost function. Each term contributes towards\n \/\/ the gradient and thus need to be checked independently.\n SAEFG saf1(data, vSize, hSize, 0, 0);\n SAEFG saf2(data, vSize, hSize, 20, 0);\n SAEFG saf3(data, vSize, hSize, 20, 20);\n\n \/\/ Create a random set of parameters.\n arma::mat parameters;\n parameters.randu(l3 + 1, l2 + 1);\n\n \/\/ Get gradients for the current parameters.\n arma::mat gradient1, gradient2, gradient3;\n saf1.Gradient(parameters, gradient1);\n saf2.Gradient(parameters, gradient2);\n saf3.Gradient(parameters, gradient3);\n\n \/\/ Perturbation constant.\n const double epsilon = 0.0001;\n double costPlus1, costMinus1, numGradient1;\n double costPlus2, costMinus2, numGradient2;\n double costPlus3, costMinus3, numGradient3;\n\n \/\/ For each parameter.\n for (size_t i = 0; i <= l3; i++)\n {\n for (size_t j = 0; j <= l2; j++)\n {\n \/\/ Perturb parameter with a positive constant and get costs.\n parameters(i, j) += epsilon;\n costPlus1 = saf1.Evaluate(parameters);\n costPlus2 = saf2.Evaluate(parameters);\n costPlus3 = saf3.Evaluate(parameters);\n\n \/\/ Perturb parameter with a negative constant and get costs.\n parameters(i, j) -= 2 * epsilon;\n costMinus1 = saf1.Evaluate(parameters);\n costMinus2 = saf2.Evaluate(parameters);\n costMinus3 = saf3.Evaluate(parameters);\n\n \/\/ Compute numerical gradients using the costs calculated above.\n numGradient1 = (costPlus1 - costMinus1) \/ (2 * epsilon);\n numGradient2 = (costPlus2 - costMinus2) \/ (2 * epsilon);\n numGradient3 = (costPlus3 - costMinus3) \/ (2 * epsilon);\n\n \/\/ Restore the parameter value.\n parameters(i, j) += epsilon;\n\n \/\/ Compare numerical and backpropagation gradient values.\n BOOST_REQUIRE_CLOSE(numGradient1, gradient1(i, j), 1e-2);\n BOOST_REQUIRE_CLOSE(numGradient2, gradient2(i, j), 1e-2);\n BOOST_REQUIRE_CLOSE(numGradient3, gradient3(i, j), 1e-2);\n }\n }\n}\n\nBOOST_AUTO_TEST_CASE(SparseAutoencoderMoveTest)\n{\n using SAE = mlpack::nn::SparseAutoencoder<>;\n\n SAE sae1(2, 2);\n sae1.Lambda(0.45);\n sae1.Beta(0.33);\n sae1.Rho(0.11);\n const auto Params = sae1.Parameters();\n\n SAE sae2(std::move(sae1));\n BOOST_REQUIRE(sae1.Parameters().n_elem == 0);\n BOOST_REQUIRE(sae1.VisibleSize() == sae2.VisibleSize());\n BOOST_REQUIRE(sae1.HiddenSize() == sae2.HiddenSize());\n BOOST_REQUIRE_CLOSE(sae1.Lambda(), sae2.Lambda(), 1e-5);\n BOOST_REQUIRE_CLOSE(sae1.Beta(), sae2.Beta(), 1e-5);\n BOOST_REQUIRE_CLOSE(sae1.Rho(), sae2.Rho(), 1e-5);\n\n const auto Params2 = sae2.Parameters();\n auto func = [](double lhs, double rhs)\n {\n BOOST_REQUIRE_CLOSE(lhs, rhs, 1e-5);\n return true;\n };\n std::equal(std::begin(Params), std::end(Params),\n std::begin(Params2),\n func);\n}\n\nBOOST_AUTO_TEST_SUITE_END();\n<|endoftext|>"} {"text":"<commit_before>\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\n\/\/ Copyright (c) 2007-2009, Image Engine Design Inc. All rights reserved.\n\/\/\n\/\/ Redistribution and use in source and binary forms, with or without\n\/\/ modification, are permitted provided that the following conditions are\n\/\/ met:\n\/\/\n\/\/ * Redistributions of source code must retain the above copyright\n\/\/ notice, this list of conditions and the following disclaimer.\n\/\/\n\/\/ * Redistributions in binary form must reproduce the above copyright\n\/\/ notice, this list of conditions and the following disclaimer in the\n\/\/ documentation and\/or other materials provided with the distribution.\n\/\/\n\/\/ * Neither the name of Image Engine Design nor the names of any\n\/\/ other contributors to this software may be used to endorse or\n\/\/ promote products derived from this software without specific prior\n\/\/ written permission.\n\/\/\n\/\/ THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS \"AS\n\/\/ IS\" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO,\n\/\/ THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR\n\/\/ PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR\n\/\/ CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,\n\/\/ EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,\n\/\/ PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR\n\/\/ PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF\n\/\/ LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING\n\/\/ NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS\n\/\/ SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.\n\/\/\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n#include \"IECoreMaya\/Parameter.h\"\n#include \"IECoreMaya\/NumericTraits.h\"\n#include \"IECoreMaya\/ToMayaObjectConverter.h\"\n#include \"IECoreMaya\/FromMayaObjectConverter.h\"\n#include \"IECoreMaya\/CompoundNumericParameterHandler.h\"\n\n#include \"IECore\/SimpleTypedData.h\"\n#include \"IECore\/NumericParameter.h\"\n#include \"IECore\/CompoundParameter.h\"\n#include \"IECore\/TypedParameter.h\"\n\n#include \"maya\/MFnNumericAttribute.h\"\n#include \"maya\/MFnCompoundAttribute.h\"\n\n\nusing namespace IECoreMaya;\nusing namespace Imath;\nusing namespace boost;\n\nstatic ParameterHandler::Description< CompoundNumericParameterHandler<V2i> > v2iRegistrar( IECore::V2iParameter::staticTypeId() );\nstatic ParameterHandler::Description< CompoundNumericParameterHandler<V3i> > v3iRegistrar( IECore::V3iParameter::staticTypeId() );\n\nstatic ParameterHandler::Description< CompoundNumericParameterHandler<V2f> > v2fRegistrar( IECore::V2fParameter::staticTypeId() );\nstatic ParameterHandler::Description< CompoundNumericParameterHandler<V3f> > v3fRegistrar( IECore::V3fParameter::staticTypeId() );\n\nstatic ParameterHandler::Description< CompoundNumericParameterHandler<V2d> > v2dRegistrar( IECore::V2dParameter::staticTypeId() );\nstatic ParameterHandler::Description< CompoundNumericParameterHandler<V3d> > v3dRegistrar( IECore::V3dParameter::staticTypeId() );\n\nstatic ParameterHandler::Description< CompoundNumericParameterHandler<Color3f> > color3fRegistrar( IECore::Color3fParameter::staticTypeId() );\n\ntemplate<typename T>\nMStatus CompoundNumericParameterHandler<T>::update( IECore::ConstParameterPtr parameter, MObject &attribute ) const\n{\n\ttypename IECore::TypedParameter<T>::ConstPtr p = IECore::runTimeCast<const IECore::TypedParameter<T> >( parameter );\n\tif( !p )\n\t{\n\t\treturn MS::kFailure;\n\t}\n\n\tMFnNumericAttribute fnNAttr( attribute );\n\tif( !fnNAttr.hasObj( attribute ) )\n\t{\n\t\treturn MS::kFailure;\n\t}\n\n\tif( fnNAttr.unitType()!=NumericTraits<T>::dataType() )\n\t{\n\t\treturn MS::kFailure;\n\t}\n\n\t\/\/\/ Set the default value one child attribute at a time. It would appear that using the variants of setDefault\n\t\/\/\/ whicn take 2 or 3 arguments can exercise a Maya bug.\n\tT defValue = p->typedDefaultValue();\n\tfor( unsigned i=0; i<T::dimensions(); i++ )\n\t{\n\t\tMStatus s;\n\t\tMObject childAttr = fnNAttr.child( i, &s );\n\t\tif ( !s )\n\t\t{\n\t\t\treturn s;\n\t\t}\n\t\tMFnNumericAttribute fnChildNAttr( childAttr, &s );\n\t\tif ( !s )\n\t\t{\n\t\t\treturn s;\n\t\t}\n\t\ts = fnChildNAttr.setDefault( defValue[i] );\n\t\tif ( !s )\n\t\t{\n\t\t\treturn s;\n\t\t}\n\t}\n\n#ifndef NDEBUG\n\t\/\/\/ Verify that the defaults have been set correctly. Only do this in asserted builds.\n\tswitch( T::dimensions() )\n\t{\n\t\tcase 2 :\n\t\t\t{\n\t\t\t\ttypename T::BaseType c0, c1 ;\n\t\t\t\tMStatus s = fnNAttr.getDefault( c0, c1 );\n\t\t\t\tassert( s );\n\t\t\t\tassert( c0 == defValue[0] );\n\t\t\t\tassert( c1 == defValue[1] );\n\t\t\t}\n\t\t\tbreak;\n\t\tcase 3 :\n\t\t\t{\n\t\t\t\ttypename T::BaseType c0, c1, c2;\n\t\t\t\tMStatus s = fnNAttr.getDefault( c0, c1, c2 );\n\t\t\t\tassert( s );\n\t\t\t\tassert( c0 == defValue[0] );\n\t\t\t\tassert( c1 == defValue[1] );\n\t\t\t\tassert( c2 == defValue[2] );\n\t\t\t}\n\t\t\tbreak;\n\t\tdefault :\n\t\t\tassert( false );\n\t}\n#endif\n\n\tfnNAttr.setUsedAsColor( NumericTraits<T>::isColor() );\n\n\tbool keyable = true;\n\tbool channelBox = true;\n\n\tconst IECore::ConstCompoundObjectPtr userData = parameter->userData();\n\tassert( userData );\n\n\tconst IECore::ConstCompoundObjectPtr maya = userData->member<const IECore::CompoundObject>(\"maya\");\n\tif (maya)\n\t{\n\t\tconst IECore::ConstBoolDataPtr keyableData = maya->member<const IECore::BoolData>(\"keyable\");\n\t\tif (keyableData)\n\t\t{\n\t\t\tkeyable = keyableData->readable();\n\t\t}\n\n\t\tconst IECore::ConstBoolDataPtr channelBoxData = maya->member<const IECore::BoolData>(\"channelBox\");\n\t\tif (channelBoxData)\n\t\t{\n\t\t\tchannelBox = channelBoxData->readable();\n\t\t}\n\t}\n\n\tfnNAttr.setKeyable( keyable );\n\n\t\/\/ Calling setChannelBox(true) disables keying\n\tif (!keyable)\n\t{\n\t\tfnNAttr.setChannelBox( channelBox );\n\t}\n\n\treturn MS::kSuccess;\n}\n\ntemplate<typename T>\nMObject CompoundNumericParameterHandler<T>::create( IECore::ConstParameterPtr parameter, const MString &attributeName ) const\n{\n\ttypename IECore::TypedParameter<T>::ConstPtr p = IECore::runTimeCast<const IECore::TypedParameter<T> >( parameter );\n\tif( !p )\n\t{\n\t\treturn MObject::kNullObj;\n\t}\n\n\tMFnNumericAttribute fnNAttr;\n\tMObject result;\n\tswitch( T::dimensions() )\n\t{\n\t\tcase 2 :\n\t\t\t{\n\t\t\t\tassert( !NumericTraits<T>::isColor() );\n\t\t\t\tMObject e0 = fnNAttr.create( attributeName + \"X\", attributeName + \"X\", NumericTraits<T>::baseDataType() );\n\t\t\t\tMObject e1 = fnNAttr.create( attributeName + \"Y\", attributeName + \"Y\", NumericTraits<T>::baseDataType() );\n\t\t\t\tresult = fnNAttr.create( attributeName, attributeName, e0, e1 );\n\t\t\t}\n\t\t\tbreak;\n\t\tcase 3 :\n\t\t\tif( NumericTraits<T>::isColor() )\n\t\t\t{\n\t\t\t\tresult = fnNAttr.createColor( attributeName, attributeName );\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\tMObject e0 = fnNAttr.create( attributeName + \"X\", attributeName + \"X\", NumericTraits<T>::baseDataType() );\n\t\t\t\tMObject e1 = fnNAttr.create( attributeName + \"Y\", attributeName + \"Y\", NumericTraits<T>::baseDataType() );\n\t\t\t\tMObject e2 = fnNAttr.create( attributeName + \"Z\", attributeName + \"Z\", NumericTraits<T>::baseDataType() );\n\t\t\t\tresult = fnNAttr.create( attributeName, attributeName, e0, e1, e2 );\n\t\t\t}\n\t\t\tbreak;\n\t\tdefault :\n\t\t\tassert( false );\n\t\t\tresult = MObject::kNullObj;\n\t}\n\n\tupdate( parameter, result );\n\treturn result;\n}\n\ntemplate<typename T>\nMStatus CompoundNumericParameterHandler<T>::setValue( IECore::ConstParameterPtr parameter, MPlug &plug ) const\n{\n\ttypename IECore::TypedParameter<T>::ConstPtr p = IECore::runTimeCast<const IECore::TypedParameter<T> >( parameter );\n\tif( !p )\n\t{\n\t\treturn MS::kFailure;\n\t}\n\n\tif( plug.numChildren() != T::dimensions() )\n\t{\n\t\treturn MS::kFailure;\n\t}\n\n\tT v = p->getTypedValue();\n\tfor( unsigned i=0; i<plug.numChildren(); i++ )\n\t{\n\t\tMStatus s = plug.child( i ).setValue( v[i] );\n\t\tif( !s )\n\t\t{\n\t\t\treturn s;\n\t\t}\n\t}\n\n\treturn MS::kSuccess;\n}\n\ntemplate<typename T>\nMStatus CompoundNumericParameterHandler<T>::setValue( const MPlug &plug, IECore::ParameterPtr parameter ) const\n{\n\ttypename IECore::TypedParameter<T>::Ptr p = IECore::runTimeCast<IECore::TypedParameter<T> >( parameter );\n\tif( !p )\n\t{\n\t\treturn MS::kFailure;\n\t}\n\n\tif( plug.numChildren() != T::dimensions() )\n\t{\n\t\treturn MS::kFailure;\n\t}\n\n\tT v;\n\tfor( unsigned i=0; i<plug.numChildren(); i++ )\n\t{\n\t\tMStatus s = plug.child( i ).getValue( v[i] );\n\t\tif( !s )\n\t\t{\n\t\t\treturn s;\n\t\t}\n\t}\n\n\tp->setTypedValue( v );\n\treturn MS::kSuccess;\n}\n<commit_msg>Fixed typo.<commit_after>\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\n\/\/ Copyright (c) 2007-2010, 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 \"IECoreMaya\/Parameter.h\"\n#include \"IECoreMaya\/NumericTraits.h\"\n#include \"IECoreMaya\/ToMayaObjectConverter.h\"\n#include \"IECoreMaya\/FromMayaObjectConverter.h\"\n#include \"IECoreMaya\/CompoundNumericParameterHandler.h\"\n\n#include \"IECore\/SimpleTypedData.h\"\n#include \"IECore\/NumericParameter.h\"\n#include \"IECore\/CompoundParameter.h\"\n#include \"IECore\/TypedParameter.h\"\n\n#include \"maya\/MFnNumericAttribute.h\"\n#include \"maya\/MFnCompoundAttribute.h\"\n\n\nusing namespace IECoreMaya;\nusing namespace Imath;\nusing namespace boost;\n\nstatic ParameterHandler::Description< CompoundNumericParameterHandler<V2i> > v2iRegistrar( IECore::V2iParameter::staticTypeId() );\nstatic ParameterHandler::Description< CompoundNumericParameterHandler<V3i> > v3iRegistrar( IECore::V3iParameter::staticTypeId() );\n\nstatic ParameterHandler::Description< CompoundNumericParameterHandler<V2f> > v2fRegistrar( IECore::V2fParameter::staticTypeId() );\nstatic ParameterHandler::Description< CompoundNumericParameterHandler<V3f> > v3fRegistrar( IECore::V3fParameter::staticTypeId() );\n\nstatic ParameterHandler::Description< CompoundNumericParameterHandler<V2d> > v2dRegistrar( IECore::V2dParameter::staticTypeId() );\nstatic ParameterHandler::Description< CompoundNumericParameterHandler<V3d> > v3dRegistrar( IECore::V3dParameter::staticTypeId() );\n\nstatic ParameterHandler::Description< CompoundNumericParameterHandler<Color3f> > color3fRegistrar( IECore::Color3fParameter::staticTypeId() );\n\ntemplate<typename T>\nMStatus CompoundNumericParameterHandler<T>::update( IECore::ConstParameterPtr parameter, MObject &attribute ) const\n{\n\ttypename IECore::TypedParameter<T>::ConstPtr p = IECore::runTimeCast<const IECore::TypedParameter<T> >( parameter );\n\tif( !p )\n\t{\n\t\treturn MS::kFailure;\n\t}\n\n\tMFnNumericAttribute fnNAttr( attribute );\n\tif( !fnNAttr.hasObj( attribute ) )\n\t{\n\t\treturn MS::kFailure;\n\t}\n\n\tif( fnNAttr.unitType()!=NumericTraits<T>::dataType() )\n\t{\n\t\treturn MS::kFailure;\n\t}\n\n\t\/\/\/ Set the default value one child attribute at a time. It would appear that using the variants of setDefault\n\t\/\/\/ which take 2 or 3 arguments can exercise a Maya bug.\n\tT defValue = p->typedDefaultValue();\n\tfor( unsigned i=0; i<T::dimensions(); i++ )\n\t{\n\t\tMStatus s;\n\t\tMObject childAttr = fnNAttr.child( i, &s );\n\t\tif ( !s )\n\t\t{\n\t\t\treturn s;\n\t\t}\n\t\tMFnNumericAttribute fnChildNAttr( childAttr, &s );\n\t\tif ( !s )\n\t\t{\n\t\t\treturn s;\n\t\t}\n\t\ts = fnChildNAttr.setDefault( defValue[i] );\n\t\tif ( !s )\n\t\t{\n\t\t\treturn s;\n\t\t}\n\t}\n\n#ifndef NDEBUG\n\t\/\/\/ Verify that the defaults have been set correctly. Only do this in asserted builds.\n\tswitch( T::dimensions() )\n\t{\n\t\tcase 2 :\n\t\t\t{\n\t\t\t\ttypename T::BaseType c0, c1 ;\n\t\t\t\tMStatus s = fnNAttr.getDefault( c0, c1 );\n\t\t\t\tassert( s );\n\t\t\t\tassert( c0 == defValue[0] );\n\t\t\t\tassert( c1 == defValue[1] );\n\t\t\t}\n\t\t\tbreak;\n\t\tcase 3 :\n\t\t\t{\n\t\t\t\ttypename T::BaseType c0, c1, c2;\n\t\t\t\tMStatus s = fnNAttr.getDefault( c0, c1, c2 );\n\t\t\t\tassert( s );\n\t\t\t\tassert( c0 == defValue[0] );\n\t\t\t\tassert( c1 == defValue[1] );\n\t\t\t\tassert( c2 == defValue[2] );\n\t\t\t}\n\t\t\tbreak;\n\t\tdefault :\n\t\t\tassert( false );\n\t}\n#endif\n\n\tfnNAttr.setUsedAsColor( NumericTraits<T>::isColor() );\n\n\tbool keyable = true;\n\tbool channelBox = true;\n\n\tconst IECore::ConstCompoundObjectPtr userData = parameter->userData();\n\tassert( userData );\n\n\tconst IECore::ConstCompoundObjectPtr maya = userData->member<const IECore::CompoundObject>(\"maya\");\n\tif (maya)\n\t{\n\t\tconst IECore::ConstBoolDataPtr keyableData = maya->member<const IECore::BoolData>(\"keyable\");\n\t\tif (keyableData)\n\t\t{\n\t\t\tkeyable = keyableData->readable();\n\t\t}\n\n\t\tconst IECore::ConstBoolDataPtr channelBoxData = maya->member<const IECore::BoolData>(\"channelBox\");\n\t\tif (channelBoxData)\n\t\t{\n\t\t\tchannelBox = channelBoxData->readable();\n\t\t}\n\t}\n\n\tfnNAttr.setKeyable( keyable );\n\n\t\/\/ Calling setChannelBox(true) disables keying\n\tif (!keyable)\n\t{\n\t\tfnNAttr.setChannelBox( channelBox );\n\t}\n\n\treturn MS::kSuccess;\n}\n\ntemplate<typename T>\nMObject CompoundNumericParameterHandler<T>::create( IECore::ConstParameterPtr parameter, const MString &attributeName ) const\n{\n\ttypename IECore::TypedParameter<T>::ConstPtr p = IECore::runTimeCast<const IECore::TypedParameter<T> >( parameter );\n\tif( !p )\n\t{\n\t\treturn MObject::kNullObj;\n\t}\n\n\tMFnNumericAttribute fnNAttr;\n\tMObject result;\n\tswitch( T::dimensions() )\n\t{\n\t\tcase 2 :\n\t\t\t{\n\t\t\t\tassert( !NumericTraits<T>::isColor() );\n\t\t\t\tMObject e0 = fnNAttr.create( attributeName + \"X\", attributeName + \"X\", NumericTraits<T>::baseDataType() );\n\t\t\t\tMObject e1 = fnNAttr.create( attributeName + \"Y\", attributeName + \"Y\", NumericTraits<T>::baseDataType() );\n\t\t\t\tresult = fnNAttr.create( attributeName, attributeName, e0, e1 );\n\t\t\t}\n\t\t\tbreak;\n\t\tcase 3 :\n\t\t\tif( NumericTraits<T>::isColor() )\n\t\t\t{\n\t\t\t\tresult = fnNAttr.createColor( attributeName, attributeName );\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\tMObject e0 = fnNAttr.create( attributeName + \"X\", attributeName + \"X\", NumericTraits<T>::baseDataType() );\n\t\t\t\tMObject e1 = fnNAttr.create( attributeName + \"Y\", attributeName + \"Y\", NumericTraits<T>::baseDataType() );\n\t\t\t\tMObject e2 = fnNAttr.create( attributeName + \"Z\", attributeName + \"Z\", NumericTraits<T>::baseDataType() );\n\t\t\t\tresult = fnNAttr.create( attributeName, attributeName, e0, e1, e2 );\n\t\t\t}\n\t\t\tbreak;\n\t\tdefault :\n\t\t\tassert( false );\n\t\t\tresult = MObject::kNullObj;\n\t}\n\n\tupdate( parameter, result );\n\treturn result;\n}\n\ntemplate<typename T>\nMStatus CompoundNumericParameterHandler<T>::setValue( IECore::ConstParameterPtr parameter, MPlug &plug ) const\n{\n\ttypename IECore::TypedParameter<T>::ConstPtr p = IECore::runTimeCast<const IECore::TypedParameter<T> >( parameter );\n\tif( !p )\n\t{\n\t\treturn MS::kFailure;\n\t}\n\n\tif( plug.numChildren() != T::dimensions() )\n\t{\n\t\treturn MS::kFailure;\n\t}\n\n\tT v = p->getTypedValue();\n\tfor( unsigned i=0; i<plug.numChildren(); i++ )\n\t{\n\t\tMStatus s = plug.child( i ).setValue( v[i] );\n\t\tif( !s )\n\t\t{\n\t\t\treturn s;\n\t\t}\n\t}\n\n\treturn MS::kSuccess;\n}\n\ntemplate<typename T>\nMStatus CompoundNumericParameterHandler<T>::setValue( const MPlug &plug, IECore::ParameterPtr parameter ) const\n{\n\ttypename IECore::TypedParameter<T>::Ptr p = IECore::runTimeCast<IECore::TypedParameter<T> >( parameter );\n\tif( !p )\n\t{\n\t\treturn MS::kFailure;\n\t}\n\n\tif( plug.numChildren() != T::dimensions() )\n\t{\n\t\treturn MS::kFailure;\n\t}\n\n\tT v;\n\tfor( unsigned i=0; i<plug.numChildren(); i++ )\n\t{\n\t\tMStatus s = plug.child( i ).getValue( v[i] );\n\t\tif( !s )\n\t\t{\n\t\t\treturn s;\n\t\t}\n\t}\n\n\tp->setTypedValue( v );\n\treturn MS::kSuccess;\n}\n<|endoftext|>"} {"text":"<commit_before>\/*\n * The MIT License (MIT)\n *\n * Copyright (c) 2017 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 <QHostAddress>\n#include <QMap>\n#include <QObject>\n#include <QTest>\n\n#include <qmdnsengine\/dns.h>\n#include <qmdnsengine\/record.h>\n\n#define PARSE_RECORD(r) \\\n quint16 offset = 0; \\\n QMdnsEngine::Record record; \\\n bool result = QMdnsEngine::parseRecord( \\\n QByteArray(r, sizeof(r)), \\\n offset, \\\n record \\\n )\n\n#define WRITE_RECORD() \\\n QByteArray packet; \\\n quint16 offset; \\\n NameMap nameMap; \\\n QMdnsEngine::writeRecord(packet, offset, record, nameMap)\n\ntypedef QMap<QByteArray, quint16> NameMap;\n\nconst char NameSimple[] = {\n '\\x04', '_', 't', 'c', 'p',\n '\\x05', 'l', 'o', 'c', 'a', 'l',\n '\\0'\n};\n\nconst char NamePointer[] = {\n '\\x04', '_', 't', 'c', 'p',\n '\\x05', 'l', 'o', 'c', 'a', 'l',\n '\\0',\n '\\x04', 't', 'e', 's', 't',\n '\\xc0', '\\0'\n};\n\nconst char NameCorrupt[] = {\n '\\x03', '1', '2'\n};\n\nconst char RecordA[] = {\n '\\x04', 't', 'e', 's', 't', '\\0',\n '\\x00', '\\x01',\n '\\x80', '\\x01',\n '\\x00', '\\x00', '\\x0e', '\\x10',\n '\\x00', '\\x04',\n '\\x7f', '\\x00', '\\x00', '\\x01'\n};\n\nconst char RecordAAAA[] = {\n '\\x04', 't', 'e', 's', 't', '\\0',\n '\\x00', '\\x1c',\n '\\x00', '\\x01',\n '\\x00', '\\x00', '\\x0e', '\\x10',\n '\\x00', '\\x10',\n '\\x00', '\\x00', '\\x00', '\\x00', '\\x00', '\\x00', '\\x00', '\\x00',\n '\\x00', '\\x00', '\\x00', '\\x00', '\\x00', '\\x00', '\\x00', '\\x01'\n};\n\nconst char RecordPTR[] = {\n '\\x04', 't', 'e', 's', 't', '\\0',\n '\\x00', '\\x0c',\n '\\x00', '\\x01',\n '\\x00', '\\x00', '\\x0e', '\\x10',\n '\\x00', '\\x07',\n '\\x05', 't', 'e', 's', 't', '2', '\\0',\n};\n\nconst char RecordSRV[] = {\n '\\x04', 't', 'e', 's', 't', '\\0',\n '\\x00', '\\x21',\n '\\x00', '\\x01',\n '\\x00', '\\x00', '\\x0e', '\\x10',\n '\\x00', '\\x0d',\n '\\x00', '\\x01', '\\x00', '\\x02', '\\x00', '\\x03',\n '\\x05', 't', 'e', 's', 't', '2', '\\0',\n};\n\nconst char RecordTXT[] = {\n '\\x04', 't', 'e', 's', 't', '\\0',\n '\\x00', '\\x10',\n '\\x00', '\\x01',\n '\\x00', '\\x00', '\\x0e', '\\x10',\n '\\x00', '\\x06',\n '\\x03', 'a', '=', 'a',\n '\\x01', 'b'\n};\n\nconst QByteArray Name(\"test.\");\nconst quint32 Ttl = 3600;\nconst QHostAddress Ipv4Address(\"127.0.0.1\");\nconst QHostAddress Ipv6Address(\"::1\");\nconst QByteArray Target(\"test2.\");\nconst quint16 Priority = 1;\nconst quint16 Weight = 2;\nconst quint16 Port = 3;\nconst QMap<QByteArray, QByteArray> Attributes{\n {\"a\", \"a\"},\n {\"b\", QByteArray()}\n};\n\nclass TestDns : public QObject\n{\n Q_OBJECT\n\nprivate Q_SLOTS:\n\n void testParseName_data();\n void testParseName();\n\n void testWriteName_data();\n void testWriteName();\n\n void testParseRecordA();\n void testParseRecordAAAA();\n void testParseRecordPTR();\n void testParseRecordSRV();\n void testParseRecordTXT();\n\n void testWriteRecordA();\n void testWriteRecordAAAA();\n void testWriteRecordPTR();\n void testWriteRecordSRV();\n void testWriteRecordTXT();\n};\n\nvoid TestDns::testParseName_data()\n{\n QTest::addColumn<QByteArray>(\"packet\");\n QTest::addColumn<quint16>(\"initialOffset\");\n QTest::addColumn<quint16>(\"correctOffset\");\n QTest::addColumn<QByteArray>(\"correctName\");\n QTest::addColumn<bool>(\"correctResult\");\n\n QTest::newRow(\"simple\")\n << QByteArray(NameSimple, sizeof(NameSimple))\n << static_cast<quint16>(0)\n << static_cast<quint16>(12)\n << QByteArray(\"_tcp.local.\")\n << true;\n\n QTest::newRow(\"pointer\")\n << QByteArray(NamePointer, sizeof(NamePointer))\n << static_cast<quint16>(12)\n << static_cast<quint16>(19)\n << QByteArray(\"test._tcp.local.\")\n << true;\n\n QTest::newRow(\"corrupt data\")\n << QByteArray(NameCorrupt, sizeof(NameCorrupt))\n << static_cast<quint16>(0)\n << static_cast<quint16>(0)\n << QByteArray()\n << false;\n}\n\nvoid TestDns::testParseName()\n{\n QFETCH(QByteArray, packet);\n QFETCH(quint16, initialOffset);\n QFETCH(quint16, correctOffset);\n QFETCH(QByteArray, correctName);\n QFETCH(bool, correctResult);\n\n quint16 offset = initialOffset;\n QByteArray name;\n bool result = QMdnsEngine::parseName(packet, offset, name);\n\n QCOMPARE(result, correctResult);\n if (result) {\n QCOMPARE(offset, correctOffset);\n QCOMPARE(name, correctName);\n }\n}\n\nvoid TestDns::testWriteName_data()\n{\n QTest::addColumn<QByteArray>(\"initialPacket\");\n QTest::addColumn<quint16>(\"initialOffset\");\n QTest::addColumn<quint16>(\"correctOffset\");\n QTest::addColumn<QByteArray>(\"name\");\n QTest::addColumn<NameMap>(\"nameMap\");\n QTest::addColumn<QByteArray>(\"correctPacket\");\n\n QTest::newRow(\"simple\")\n << QByteArray()\n << static_cast<quint16>(0)\n << static_cast<quint16>(12)\n << QByteArray(\"_tcp.local.\")\n << NameMap()\n << QByteArray(NameSimple, sizeof(NameSimple));\n\n QTest::newRow(\"pointer\")\n << QByteArray(NameSimple, sizeof(NameSimple))\n << static_cast<quint16>(sizeof(NameSimple))\n << static_cast<quint16>(19)\n << QByteArray(\"test._tcp.local.\")\n << NameMap{{\"_tcp.local\", 0}}\n << QByteArray(NamePointer, sizeof(NamePointer));\n}\n\nvoid TestDns::testWriteName()\n{\n QFETCH(QByteArray, initialPacket);\n QFETCH(quint16, initialOffset);\n QFETCH(QByteArray, name);\n QFETCH(NameMap, nameMap);\n QFETCH(QByteArray, correctPacket);\n\n QByteArray packet = initialPacket;\n quint16 offset = initialOffset;\n QMdnsEngine::writeName(packet, offset, name, nameMap);\n\n QCOMPARE(packet, correctPacket);\n QCOMPARE(offset, correctOffset);\n}\n\nvoid TestDns::testParseRecordA()\n{\n PARSE_RECORD(RecordA);\n\n QCOMPARE(result, true);\n QCOMPARE(record.name(), Name);\n QCOMPARE(record.type(), static_cast<quint16>(QMdnsEngine::A));\n QCOMPARE(record.flushCache(), true);\n QCOMPARE(record.ttl(), Ttl);\n QCOMPARE(record.address(), Ipv4Address);\n}\n\nvoid TestDns::testParseRecordAAAA()\n{\n PARSE_RECORD(RecordAAAA);\n\n QCOMPARE(result, true);\n QCOMPARE(record.type(), static_cast<quint16>(QMdnsEngine::AAAA));\n QCOMPARE(record.address(), Ipv6Address);\n}\n\nvoid TestDns::testParseRecordPTR()\n{\n PARSE_RECORD(RecordPTR);\n\n QCOMPARE(result, true);\n QCOMPARE(record.type(), static_cast<quint16>(QMdnsEngine::PTR));\n QCOMPARE(record.target(), QByteArray(\"test2.\"));\n}\n\nvoid TestDns::testParseRecordSRV()\n{\n PARSE_RECORD(RecordSRV);\n\n QCOMPARE(result, true);\n QCOMPARE(record.type(), static_cast<quint16>(QMdnsEngine::SRV));\n QCOMPARE(record.priority(), Priority);\n QCOMPARE(record.weight(), Weight);\n QCOMPARE(record.port(), Port);\n QCOMPARE(record.target(), Target);\n}\n\nvoid TestDns::testParseRecordTXT()\n{\n PARSE_RECORD(RecordTXT);\n\n QCOMPARE(result, true);\n QCOMPARE(record.type(), static_cast<quint16>(QMdnsEngine::TXT));\n QCOMPARE(record.attributes(), Attributes);\n}\n\nvoid TestDns::testWriteRecordA()\n{\n QMdnsEngine::Record record;\n record.setName(Name);\n record.setType(QMdnsEngine::A);\n record.setFlushCache(true);\n record.setTtl(Ttl);\n record.setAddress(Ipv4Address);\n\n WRITE_RECORD();\n\n QCOMPARE(packet, QByteArray(RecordA, sizeof(RecordA)));\n}\n\nvoid TestDns::testWriteRecordAAAA()\n{\n QMdnsEngine::Record record;\n record.setName(Name);\n record.setType(QMdnsEngine::AAAA);\n record.setTtl(Ttl);\n record.setAddress(Ipv6Address);\n\n WRITE_RECORD();\n\n QCOMPARE(packet, QByteArray(RecordAAAA, sizeof(RecordAAAA)));\n}\n\nvoid TestDns::testWriteRecordPTR()\n{\n QMdnsEngine::Record record;\n record.setName(Name);\n record.setType(QMdnsEngine::PTR);\n record.setTtl(Ttl);\n record.setTarget(Target);\n\n WRITE_RECORD();\n\n QCOMPARE(packet, QByteArray(RecordPTR, sizeof(RecordPTR)));\n}\n\nvoid TestDns::testWriteRecordSRV()\n{\n QMdnsEngine::Record record;\n record.setName(Name);\n record.setType(QMdnsEngine::SRV);\n record.setTtl(Ttl);\n record.setPriority(Priority);\n record.setWeight(Weight);\n record.setPort(Port);\n record.setTarget(Target);\n\n WRITE_RECORD();\n\n QCOMPARE(packet, QByteArray(RecordSRV, sizeof(RecordSRV)));\n}\n\nvoid TestDns::testWriteRecordTXT()\n{\n QMdnsEngine::Record record;\n record.setName(Name);\n record.setType(QMdnsEngine::TXT);\n record.setTtl(Ttl);\n for (auto i = Attributes.constBegin(); i != Attributes.constEnd(); ++i) {\n record.addAttribute(i.key(), i.value());\n }\n\n WRITE_RECORD();\n\n QCOMPARE(packet, QByteArray(RecordTXT, sizeof(RecordTXT)));\n}\n\nQTEST_MAIN(TestDns)\n#include \"TestDns.moc\"\n<commit_msg>Revert fix for unused variable warning.<commit_after>\/*\n * The MIT License (MIT)\n *\n * Copyright (c) 2017 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 <QHostAddress>\n#include <QMap>\n#include <QObject>\n#include <QTest>\n\n#include <qmdnsengine\/dns.h>\n#include <qmdnsengine\/record.h>\n\n#define PARSE_RECORD(r) \\\n quint16 offset = 0; \\\n QMdnsEngine::Record record; \\\n bool result = QMdnsEngine::parseRecord( \\\n QByteArray(r, sizeof(r)), \\\n offset, \\\n record \\\n )\n\n#define WRITE_RECORD() \\\n QByteArray packet; \\\n quint16 offset; \\\n NameMap nameMap; \\\n QMdnsEngine::writeRecord(packet, offset, record, nameMap)\n\ntypedef QMap<QByteArray, quint16> NameMap;\n\nconst char NameSimple[] = {\n '\\x04', '_', 't', 'c', 'p',\n '\\x05', 'l', 'o', 'c', 'a', 'l',\n '\\0'\n};\n\nconst char NamePointer[] = {\n '\\x04', '_', 't', 'c', 'p',\n '\\x05', 'l', 'o', 'c', 'a', 'l',\n '\\0',\n '\\x04', 't', 'e', 's', 't',\n '\\xc0', '\\0'\n};\n\nconst char NameCorrupt[] = {\n '\\x03', '1', '2'\n};\n\nconst char RecordA[] = {\n '\\x04', 't', 'e', 's', 't', '\\0',\n '\\x00', '\\x01',\n '\\x80', '\\x01',\n '\\x00', '\\x00', '\\x0e', '\\x10',\n '\\x00', '\\x04',\n '\\x7f', '\\x00', '\\x00', '\\x01'\n};\n\nconst char RecordAAAA[] = {\n '\\x04', 't', 'e', 's', 't', '\\0',\n '\\x00', '\\x1c',\n '\\x00', '\\x01',\n '\\x00', '\\x00', '\\x0e', '\\x10',\n '\\x00', '\\x10',\n '\\x00', '\\x00', '\\x00', '\\x00', '\\x00', '\\x00', '\\x00', '\\x00',\n '\\x00', '\\x00', '\\x00', '\\x00', '\\x00', '\\x00', '\\x00', '\\x01'\n};\n\nconst char RecordPTR[] = {\n '\\x04', 't', 'e', 's', 't', '\\0',\n '\\x00', '\\x0c',\n '\\x00', '\\x01',\n '\\x00', '\\x00', '\\x0e', '\\x10',\n '\\x00', '\\x07',\n '\\x05', 't', 'e', 's', 't', '2', '\\0',\n};\n\nconst char RecordSRV[] = {\n '\\x04', 't', 'e', 's', 't', '\\0',\n '\\x00', '\\x21',\n '\\x00', '\\x01',\n '\\x00', '\\x00', '\\x0e', '\\x10',\n '\\x00', '\\x0d',\n '\\x00', '\\x01', '\\x00', '\\x02', '\\x00', '\\x03',\n '\\x05', 't', 'e', 's', 't', '2', '\\0',\n};\n\nconst char RecordTXT[] = {\n '\\x04', 't', 'e', 's', 't', '\\0',\n '\\x00', '\\x10',\n '\\x00', '\\x01',\n '\\x00', '\\x00', '\\x0e', '\\x10',\n '\\x00', '\\x06',\n '\\x03', 'a', '=', 'a',\n '\\x01', 'b'\n};\n\nconst QByteArray Name(\"test.\");\nconst quint32 Ttl = 3600;\nconst QHostAddress Ipv4Address(\"127.0.0.1\");\nconst QHostAddress Ipv6Address(\"::1\");\nconst QByteArray Target(\"test2.\");\nconst quint16 Priority = 1;\nconst quint16 Weight = 2;\nconst quint16 Port = 3;\nconst QMap<QByteArray, QByteArray> Attributes{\n {\"a\", \"a\"},\n {\"b\", QByteArray()}\n};\n\nclass TestDns : public QObject\n{\n Q_OBJECT\n\nprivate Q_SLOTS:\n\n void testParseName_data();\n void testParseName();\n\n void testWriteName_data();\n void testWriteName();\n\n void testParseRecordA();\n void testParseRecordAAAA();\n void testParseRecordPTR();\n void testParseRecordSRV();\n void testParseRecordTXT();\n\n void testWriteRecordA();\n void testWriteRecordAAAA();\n void testWriteRecordPTR();\n void testWriteRecordSRV();\n void testWriteRecordTXT();\n};\n\nvoid TestDns::testParseName_data()\n{\n QTest::addColumn<QByteArray>(\"packet\");\n QTest::addColumn<quint16>(\"initialOffset\");\n QTest::addColumn<quint16>(\"correctOffset\");\n QTest::addColumn<QByteArray>(\"correctName\");\n QTest::addColumn<bool>(\"correctResult\");\n\n QTest::newRow(\"simple\")\n << QByteArray(NameSimple, sizeof(NameSimple))\n << static_cast<quint16>(0)\n << static_cast<quint16>(12)\n << QByteArray(\"_tcp.local.\")\n << true;\n\n QTest::newRow(\"pointer\")\n << QByteArray(NamePointer, sizeof(NamePointer))\n << static_cast<quint16>(12)\n << static_cast<quint16>(19)\n << QByteArray(\"test._tcp.local.\")\n << true;\n\n QTest::newRow(\"corrupt data\")\n << QByteArray(NameCorrupt, sizeof(NameCorrupt))\n << static_cast<quint16>(0)\n << static_cast<quint16>(0)\n << QByteArray()\n << false;\n}\n\nvoid TestDns::testParseName()\n{\n QFETCH(QByteArray, packet);\n QFETCH(quint16, initialOffset);\n QFETCH(quint16, correctOffset);\n QFETCH(QByteArray, correctName);\n QFETCH(bool, correctResult);\n\n quint16 offset = initialOffset;\n QByteArray name;\n bool result = QMdnsEngine::parseName(packet, offset, name);\n\n QCOMPARE(result, correctResult);\n if (result) {\n QCOMPARE(offset, correctOffset);\n QCOMPARE(name, correctName);\n }\n}\n\nvoid TestDns::testWriteName_data()\n{\n QTest::addColumn<QByteArray>(\"initialPacket\");\n QTest::addColumn<quint16>(\"initialOffset\");\n QTest::addColumn<quint16>(\"correctOffset\");\n QTest::addColumn<QByteArray>(\"name\");\n QTest::addColumn<NameMap>(\"nameMap\");\n QTest::addColumn<QByteArray>(\"correctPacket\");\n\n QTest::newRow(\"simple\")\n << QByteArray()\n << static_cast<quint16>(0)\n << static_cast<quint16>(12)\n << QByteArray(\"_tcp.local.\")\n << NameMap()\n << QByteArray(NameSimple, sizeof(NameSimple));\n\n QTest::newRow(\"pointer\")\n << QByteArray(NameSimple, sizeof(NameSimple))\n << static_cast<quint16>(sizeof(NameSimple))\n << static_cast<quint16>(19)\n << QByteArray(\"test._tcp.local.\")\n << NameMap{{\"_tcp.local\", 0}}\n << QByteArray(NamePointer, sizeof(NamePointer));\n}\n\nvoid TestDns::testWriteName()\n{\n QFETCH(QByteArray, initialPacket);\n QFETCH(quint16, initialOffset);\n QFETCH(quint16, correctOffset);\n QFETCH(QByteArray, name);\n QFETCH(NameMap, nameMap);\n QFETCH(QByteArray, correctPacket);\n\n QByteArray packet = initialPacket;\n quint16 offset = initialOffset;\n QMdnsEngine::writeName(packet, offset, name, nameMap);\n\n QCOMPARE(packet, correctPacket);\n QCOMPARE(offset, correctOffset);\n}\n\nvoid TestDns::testParseRecordA()\n{\n PARSE_RECORD(RecordA);\n\n QCOMPARE(result, true);\n QCOMPARE(record.name(), Name);\n QCOMPARE(record.type(), static_cast<quint16>(QMdnsEngine::A));\n QCOMPARE(record.flushCache(), true);\n QCOMPARE(record.ttl(), Ttl);\n QCOMPARE(record.address(), Ipv4Address);\n}\n\nvoid TestDns::testParseRecordAAAA()\n{\n PARSE_RECORD(RecordAAAA);\n\n QCOMPARE(result, true);\n QCOMPARE(record.type(), static_cast<quint16>(QMdnsEngine::AAAA));\n QCOMPARE(record.address(), Ipv6Address);\n}\n\nvoid TestDns::testParseRecordPTR()\n{\n PARSE_RECORD(RecordPTR);\n\n QCOMPARE(result, true);\n QCOMPARE(record.type(), static_cast<quint16>(QMdnsEngine::PTR));\n QCOMPARE(record.target(), QByteArray(\"test2.\"));\n}\n\nvoid TestDns::testParseRecordSRV()\n{\n PARSE_RECORD(RecordSRV);\n\n QCOMPARE(result, true);\n QCOMPARE(record.type(), static_cast<quint16>(QMdnsEngine::SRV));\n QCOMPARE(record.priority(), Priority);\n QCOMPARE(record.weight(), Weight);\n QCOMPARE(record.port(), Port);\n QCOMPARE(record.target(), Target);\n}\n\nvoid TestDns::testParseRecordTXT()\n{\n PARSE_RECORD(RecordTXT);\n\n QCOMPARE(result, true);\n QCOMPARE(record.type(), static_cast<quint16>(QMdnsEngine::TXT));\n QCOMPARE(record.attributes(), Attributes);\n}\n\nvoid TestDns::testWriteRecordA()\n{\n QMdnsEngine::Record record;\n record.setName(Name);\n record.setType(QMdnsEngine::A);\n record.setFlushCache(true);\n record.setTtl(Ttl);\n record.setAddress(Ipv4Address);\n\n WRITE_RECORD();\n\n QCOMPARE(packet, QByteArray(RecordA, sizeof(RecordA)));\n}\n\nvoid TestDns::testWriteRecordAAAA()\n{\n QMdnsEngine::Record record;\n record.setName(Name);\n record.setType(QMdnsEngine::AAAA);\n record.setTtl(Ttl);\n record.setAddress(Ipv6Address);\n\n WRITE_RECORD();\n\n QCOMPARE(packet, QByteArray(RecordAAAA, sizeof(RecordAAAA)));\n}\n\nvoid TestDns::testWriteRecordPTR()\n{\n QMdnsEngine::Record record;\n record.setName(Name);\n record.setType(QMdnsEngine::PTR);\n record.setTtl(Ttl);\n record.setTarget(Target);\n\n WRITE_RECORD();\n\n QCOMPARE(packet, QByteArray(RecordPTR, sizeof(RecordPTR)));\n}\n\nvoid TestDns::testWriteRecordSRV()\n{\n QMdnsEngine::Record record;\n record.setName(Name);\n record.setType(QMdnsEngine::SRV);\n record.setTtl(Ttl);\n record.setPriority(Priority);\n record.setWeight(Weight);\n record.setPort(Port);\n record.setTarget(Target);\n\n WRITE_RECORD();\n\n QCOMPARE(packet, QByteArray(RecordSRV, sizeof(RecordSRV)));\n}\n\nvoid TestDns::testWriteRecordTXT()\n{\n QMdnsEngine::Record record;\n record.setName(Name);\n record.setType(QMdnsEngine::TXT);\n record.setTtl(Ttl);\n for (auto i = Attributes.constBegin(); i != Attributes.constEnd(); ++i) {\n record.addAttribute(i.key(), i.value());\n }\n\n WRITE_RECORD();\n\n QCOMPARE(packet, QByteArray(RecordTXT, sizeof(RecordTXT)));\n}\n\nQTEST_MAIN(TestDns)\n#include \"TestDns.moc\"\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\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\n\/\/ Connects to the server at a the given port.\nvoid Connect(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 \/\/ Try each address until we successfully connect().\n \/\/ If socket() (or connect()) fails, close the socket and try 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\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 RequestSay(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 RequestLogin(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 RequestLogout() {\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 RequestJoin(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\/\/ 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\/\/ 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 RequestLogout();\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\/\/ std::string input;\n\n\/\/ struct timeval timeout;\n fd_set read_set;\n\/\/ int file_desc = 0;\n int result;\n char receive_buffer[kBufferSize];\n memset(&receive_buffer, 0, kBufferSize);\n\n char stdin_buffer[kBufferSize];\n memset(&stdin_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 Connect(domain, port_str);\n\n RequestLogin(username);\n\n channel = (char *) \"Common\";\n RequestJoin(channel);\n\n \/\/ TODO handle response from send\n\n std::cout << \">\" << std::flush;\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 std::cout << \"entering if STDIN\" << std::endl;\n\n int read_stdin_size = read(STDIN_FILENO, stdin_buffer, kBufferSize);\n \n std::cout << \"after read STDIN\" << std::endl;\n\n if (read_stdin_size != 0) {\n if (stdin_buffer[0] == '\/') {\n ProcessInput(stdin_buffer);\n } else {\n \/\/ Send chat messages\n StripChar(stdin_buffer, '\\n');\n RequestSay(stdin_buffer);\n }\n }\n\n memset(&stdin_buffer, 0, kBufferSize);\n } \/\/ end of if STDIN_FILENO\n\n 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 \/\/ TODO capture user input, store, clean input, then print buffer, afterward replace input\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 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 std::cout << \">\" << std::flush;\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>use can to capture input before deleting<commit_after>#include <netdb.h>\n#include <unistd.h>\n#include <sys\/fcntl.h>\n\n#include \"client.h\"\n#include \"duckchat.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\n\/\/ Connects to the server at a the given port.\nvoid Connect(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 \/\/ Try each address until we successfully connect().\n \/\/ If socket() (or connect()) fails, close the socket and try 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\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 RequestSay(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 RequestLogin(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 RequestLogout() {\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 RequestJoin(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\/\/ 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\/\/ 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 RequestLogout();\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\n\/\/ struct timeval timeout;\n fd_set read_set;\n\/\/ int file_desc = 0;\n int result;\n char receive_buffer[kBufferSize];\n memset(&receive_buffer, 0, kBufferSize);\n\n char stdin_buffer[kBufferSize];\n memset(&stdin_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 Connect(domain, port_str);\n\n RequestLogin(username);\n\n channel = (char *) \"Common\";\n RequestJoin(channel);\n\n \/\/ TODO handle response from send\n\n std::cout << \">\" << std::flush;\n\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 int read_stdin_size = read(STDIN_FILENO, stdin_buffer, kBufferSize);\n\n if (read_stdin_size != 0) {\n if (stdin_buffer[0] == '\/') {\n ProcessInput(stdin_buffer);\n } else {\n \/\/ Send chat messages\n StripChar(stdin_buffer, '\\n');\n RequestSay(stdin_buffer);\n }\n }\n\n memset(&stdin_buffer, 0, kBufferSize);\n } \/\/ end of if STDIN_FILENO\n\n 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 \/\/ TODO capture user input, store, clean input, then print buffer, afterward replace input\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 struct text_say say;\n memcpy(&say, receive_buffer, sizeof(struct text_say));\n std::cin >> input;\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 std::cout << \">\" << input << std::flush;\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>#ifndef _UNTOOLS_UCBSTREAMHELPER_HXX\n#define _UNTOOLS_UCBSTREAMHELPER_HXX\n\n#ifndef _COM_SUN_STAR_UNO_REFERENCE_HXX_\n#include <com\/sun\/star\/uno\/Reference.hxx>\n#endif\n\n#include <tools\/stream.hxx>\n\nnamespace com\n{\n namespace sun\n {\n namespace star\n {\n namespace task\n {\n class XInteractionHandler;\n }\n namespace io\n {\n class XStream;\n class XInputStream;\n }\n }\n }\n};\n\n#define NS_UNO ::com::sun::star::uno\n#define NS_IO ::com::sun::star::io\n#define NS_TASK ::com::sun::star::task\n\nclass String;\nnamespace utl\n{\n class UcbLockBytesHandler;\n\n class UcbStreamHelper : public SvStream\n {\n public:\n static SvStream* CreateStream( const String& rFileName, StreamMode eOpenMode,\n UcbLockBytesHandler* pHandler=0, sal_Bool bForceSynchron=sal_True );\n static SvStream* CreateStream( const String& rFileName, StreamMode eOpenMode,\n NS_UNO::Reference < NS_TASK::XInteractionHandler >,\n UcbLockBytesHandler* pHandler=0, sal_Bool bForceSynchron=sal_True );\n static SvStream* CreateStream( const String& rFileName, StreamMode eOpenMode,\n sal_Bool bFileExists,\n UcbLockBytesHandler* pHandler=0, sal_Bool bForceSynchron=sal_True );\n static SvStream* CreateStream( NS_UNO::Reference < NS_IO::XInputStream > xStream );\n static SvStream* CreateStream( NS_UNO::Reference < NS_IO::XStream > xStream );\n };\n};\n\n#endif\n<commit_msg>INTEGRATION: CWS mav09 (1.3.140); FILE MERGED 2004\/07\/08 08:28:40 mav 1.3.140.4: RESYNC: (1.4-1.5); FILE MERGED 2004\/04\/29 16:49:45 mav 1.3.140.3: RESYNC: (1.3-1.4); FILE MERGED 2004\/04\/15 14:36:31 mba 1.3.140.2: #ii27773#: create Stream from XStream 2004\/04\/15 14:34:57 mba 1.3.140.1: #ii27773#: create Stream from XStream<commit_after>#ifndef _UNTOOLS_UCBSTREAMHELPER_HXX\n#define _UNTOOLS_UCBSTREAMHELPER_HXX\n\n#ifndef _COM_SUN_STAR_UNO_REFERENCE_HXX_\n#include <com\/sun\/star\/uno\/Reference.hxx>\n#endif\n#ifndef _COM_SUN_STAR_IO_XINPUTSTREAM_HPP_\n#include <com\/sun\/star\/io\/XInputStream.hpp>\n#endif\n#ifndef _COM_SUN_STAR_IO_XSTREAM_HPP_\n#include <com\/sun\/star\/io\/XStream.hpp>\n#endif\n\n#include <tools\/stream.hxx>\n\nnamespace com\n{\n namespace sun\n {\n namespace star\n {\n namespace task\n {\n class XInteractionHandler;\n }\n namespace io\n {\n class XStream;\n class XInputStream;\n }\n }\n }\n};\n\n#define NS_UNO ::com::sun::star::uno\n#define NS_IO ::com::sun::star::io\n#define NS_TASK ::com::sun::star::task\n\nclass String;\nnamespace utl\n{\n class UcbLockBytesHandler;\n\n class UcbStreamHelper : public SvStream\n {\n public:\n static SvStream* CreateStream( const String& rFileName, StreamMode eOpenMode,\n UcbLockBytesHandler* pHandler=0, sal_Bool bForceSynchron=sal_True );\n static SvStream* CreateStream( const String& rFileName, StreamMode eOpenMode,\n NS_UNO::Reference < NS_TASK::XInteractionHandler >,\n UcbLockBytesHandler* pHandler=0, sal_Bool bForceSynchron=sal_True );\n static SvStream* CreateStream( const String& rFileName, StreamMode eOpenMode,\n sal_Bool bFileExists,\n UcbLockBytesHandler* pHandler=0, sal_Bool bForceSynchron=sal_True );\n static SvStream* CreateStream( NS_UNO::Reference < NS_IO::XInputStream > xStream );\n static SvStream* CreateStream( NS_UNO::Reference < NS_IO::XStream > xStream );\n };\n};\n\n#endif\n<|endoftext|>"} {"text":"<commit_before>#include \"include\/Node.hpp\"\n#include \"include\/Tree.hpp\"\n#include <cstddef>\n#include <iostream>\n\nint main() {\n Node< std::string >* node = new Node< std::string >( 1, \"Lorhan\", nullptr, nullptr );\n std::cout << node->getValue() << std::endl;\n std::cout << node->left << std::endl;\n std::cout << node->right << std::endl;\n delete node;\n\n Tree< std::string > tree = Tree< std::string >();\n tree.insert( 10, \"!\" );\n tree.insert( 1, \"Lorhan\" );\n tree.insert( 2, \"Sohaky\" );\n tree.insert( 3, \"top\" );\n tree.insert( 4, \"da\" );\n tree.insert( 5, \"balada\" );\n std::cout << tree << std::endl;\n\n std::cout << tree.searchByValue( \"top\" ) << std::endl;\n std::cout << tree.searchByKey( 3 ) << std::endl;\n\n std::cout << \"\\n\\n\";\n Tree< char > tree2 = Tree< char >();\n\n tree2.insert( 2, '2' );\n tree2.insert( 1, '1' );\n tree2.insert( 4, '4' );\n tree2.insert( 3, '3' );\n tree2.insert( 5, '5' );\n std::cout << tree2 << std::endl;\n\n return 0;\n}\n<commit_msg>Teste da função de remoção<commit_after>#include \"include\/Node.hpp\"\n#include \"include\/Tree.hpp\"\n#include <cstddef>\n#include <iostream>\n\nint main() {\n Node< std::string >* node = new Node< std::string >( 1, \"Lorhan\", nullptr, nullptr );\n std::cout << node->getValue() << std::endl;\n std::cout << node->left << std::endl;\n std::cout << node->right << std::endl;\n delete node;\n\n Tree< std::string > tree = Tree< std::string >();\n tree.insert( 10, \"!\" );\n tree.insert( 1, \"Lorhan\" );\n tree.insert( 2, \"Sohaky\" );\n tree.insert( 3, \"top\" );\n tree.insert( 4, \"da\" );\n tree.insert( 5, \"balada\" );\n std::cout << tree << std::endl;\n\n std::cout << tree.searchByValue( \"top\" ) << std::endl;\n std::cout << tree.searchByKey( 3 ) << std::endl;\n\n std::cout << \"\\n\\n\";\n Tree< char > tree2 = Tree< char >();\n\n tree2.insert( 2, '2' );\n tree2.insert( 1, '1' );\n tree2.insert( 4, '4' );\n tree2.insert( 3, '3' );\n tree2.insert( 5, '5' );\n std::cout << tree2 << std::endl;\n\n tree2.remove( 4 );\n std::cout << tree2 << std::endl;\n tree2.remove( 2 );\n std::cout << tree2 << std::endl;\n\n return 0;\n}\n<|endoftext|>"} {"text":"<commit_before>#include <stdio.h>\n#include <stdlib.h>\n#include <string.h>\n\nint MDC(int n, int m);\n\n\nint MDC(int n, int m){\n\tint a;\n\tint b;\n\tint resultado;\n\n\n\ttemp_bool_1 = n > m;\n\ttemp_bool_1= !temp_bool_1;\n\tif( temp_bool_1 ) goto L_if_end_1;\n\t\ta = n;\n\n\tb = m;\n\n\n\tL_if_end_1:\n\t\ta = m;\n\n\tb = n;\n\n\n\tL_if_chain_end_1:\n\n\ttemp_bool_2 = b == 0;\n\ttemp_bool_2= !temp_bool_2;\n\tif( temp_bool_2 ) goto L_if_end_2;\n\t\tresultado = m;\n\n\n\tL_if_end_2:\n\t\tresultado = MDC(a,b);\n;\n\n\n\tL_if_chain_end_2:\n\n\treturn resultado;\n}\n\n\nint main() {\n\tint temp_bool_1;\n\tint temp_bool_2;\n\n\tint a;\n\tint b;\n\tint res;\n\n\n\n\n\tprintf( \"%s\" , \"Digite dois inteiros, por favor: \\n\" );\n\n\tscanf( \"%d\" , &a );\n\n\tscanf( \"%d\" , &b );\n\n\tres = MDC(a,b);\n;\n\n\tprintf( \"%s\" , \"MDC entre os dois: \" );\n\tprintf( \"%d\" , res );\n\tprintf( \"%s\" , \"\\n\" );\n\n\treturn 0;\n}\n\n<commit_msg>Useless file<commit_after><|endoftext|>"} {"text":"<commit_before><commit_msg>pass first AXI communication in multi-thread simulation<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 \"android_webview\/browser\/aw_browser_main_parts.h\"\n\n#include \"android_webview\/browser\/aw_browser_context.h\"\n#include \"android_webview\/browser\/aw_dev_tools_discovery_provider.h\"\n#include \"android_webview\/browser\/aw_media_client_android.h\"\n#include \"android_webview\/browser\/aw_result_codes.h\"\n#include \"android_webview\/browser\/deferred_gpu_command_service.h\"\n#include \"android_webview\/common\/aw_resource.h\"\n#include \"android_webview\/common\/aw_switches.h\"\n#include \"base\/android\/apk_assets.h\"\n#include \"base\/android\/build_info.h\"\n#include \"base\/android\/locale_utils.h\"\n#include \"base\/android\/memory_pressure_listener_android.h\"\n#include \"base\/command_line.h\"\n#include \"base\/files\/file_path.h\"\n#include \"base\/path_service.h\"\n#include \"content\/public\/browser\/android\/synchronous_compositor.h\"\n#include \"content\/public\/browser\/render_frame_host.h\"\n#include \"content\/public\/browser\/render_process_host.h\"\n#include \"content\/public\/common\/content_client.h\"\n#include \"content\/public\/common\/content_switches.h\"\n#include \"content\/public\/common\/result_codes.h\"\n#include \"content\/public\/common\/url_utils.h\"\n#include \"media\/base\/android\/media_client_android.h\"\n#include \"net\/android\/network_change_notifier_factory_android.h\"\n#include \"net\/base\/network_change_notifier.h\"\n#include \"ui\/base\/l10n\/l10n_util.h\"\n#include \"ui\/base\/layout.h\"\n#include \"ui\/base\/resource\/resource_bundle.h\"\n#include \"ui\/base\/resource\/resource_bundle_android.h\"\n#include \"ui\/base\/ui_base_paths.h\"\n#include \"ui\/gl\/gl_surface.h\"\n\nnamespace android_webview {\n\nAwBrowserMainParts::AwBrowserMainParts(AwBrowserContext* browser_context)\n : browser_context_(browser_context) {\n}\n\nAwBrowserMainParts::~AwBrowserMainParts() {\n}\n\nvoid AwBrowserMainParts::PreEarlyInitialization() {\n net::NetworkChangeNotifier::SetFactory(\n new net::NetworkChangeNotifierFactoryAndroid());\n\n \/\/ Android WebView does not use default MessageLoop. It has its own\n \/\/ Android specific MessageLoop. Also see MainMessageLoopRun.\n DCHECK(!main_message_loop_.get());\n main_message_loop_.reset(new base::MessageLoopForUI);\n base::MessageLoopForUI::current()->Start();\n}\n\nint AwBrowserMainParts::PreCreateThreads() {\n base::MemoryMappedFile::Region pak_region =\n base::MemoryMappedFile::Region::kWholeFile;\n\n \/\/ TODO(primiano, mkosiba): GetApplicationLocale requires a ResourceBundle\n \/\/ instance to be present to work correctly so we call this (knowing it will\n \/\/ fail) just to create the ResourceBundle instance. We should refactor\n \/\/ ResourceBundle\/GetApplicationLocale to not require an instance to be\n \/\/ initialized.\n ui::SetLocalePaksStoredInApk(true);\n ui::ResourceBundle::InitSharedInstanceWithLocale(\n base::android::GetDefaultLocale(),\n NULL,\n ui::ResourceBundle::DO_NOT_LOAD_COMMON_RESOURCES);\n std::string locale = l10n_util::GetApplicationLocale(std::string());\n std::string pak_path = ui::GetPathForAndroidLocalePakWithinApk(locale);\n int pak_fd = base::android::OpenApkAsset(pak_path, &pak_region);\n if (pak_fd != -1) {\n ui::ResourceBundle::CleanupSharedInstance();\n ui::ResourceBundle::InitSharedInstanceWithPakFileRegion(\n base::File(pak_fd), pak_region);\n } else {\n LOG(WARNING) << \"Failed to load \" << locale << \".pak from the apk. \"\n \"Bringing up WebView without any locale\";\n }\n\n \/\/ Try to directly mmap the webviewchromium.pak from the apk. Fall back to\n \/\/ load from file, using PATH_SERVICE, otherwise.\n pak_fd = base::android::OpenApkAsset(\"assets\/webviewchromium.pak\",\n &pak_region);\n if (pak_fd != -1) {\n ui::ResourceBundle::GetSharedInstance().AddDataPackFromFileRegion(\n base::File(pak_fd), pak_region, ui::SCALE_FACTOR_NONE);\n } else {\n base::FilePath pak_path;\n PathService::Get(ui::DIR_RESOURCE_PAKS_ANDROID, &pak_path);\n LOG(WARNING) << \"Cannot load webviewchromium.pak assets from the apk. \"\n \"Falling back loading it from \" << pak_path.MaybeAsASCII();\n ui::ResourceBundle::GetSharedInstance().AddDataPackFromPath(\n pak_path.AppendASCII(\"webviewchromium.pak\"), ui::SCALE_FACTOR_NONE);\n }\n\n base::android::MemoryPressureListenerAndroid::RegisterSystemCallback(\n base::android::AttachCurrentThread());\n DeferredGpuCommandService::SetInstance();\n\n return content::RESULT_CODE_NORMAL_EXIT;\n}\n\nvoid AwBrowserMainParts::PreMainMessageLoopRun() {\n browser_context_->PreMainMessageLoopRun();\n\n AwDevToolsDiscoveryProvider::Install();\n\n media::SetMediaClientAndroid(\n new AwMediaClientAndroid(AwResource::GetConfigKeySystemUuidMapping()));\n\n if (base::CommandLine::ForCurrentProcess()->HasSwitch(\n switches::kUseInProcCommandBuffer)) {\n gfx::GLSurface::InitializeOneOff();\n } else {\n content::SynchronousCompositor::SetUseIpcCommandBuffer();\n }\n\n content::RenderFrameHost::AllowInjectingJavaScriptForAndroidWebView();\n\n \/\/ This is needed for WebView Classic backwards compatibility\n \/\/ See crbug.com\/298495\n content::SetMaxURLChars(20 * 1024 * 1024);\n}\n\nbool AwBrowserMainParts::MainMessageLoopRun(int* result_code) {\n \/\/ Android WebView does not use default MessageLoop. It has its own\n \/\/ Android specific MessageLoop.\n return true;\n}\n\n} \/\/ namespace android_webview\n<commit_msg>[Android WebView] Clean up resources loading logic<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 \"android_webview\/browser\/aw_browser_main_parts.h\"\n\n#include \"android_webview\/browser\/aw_browser_context.h\"\n#include \"android_webview\/browser\/aw_dev_tools_discovery_provider.h\"\n#include \"android_webview\/browser\/aw_media_client_android.h\"\n#include \"android_webview\/browser\/aw_result_codes.h\"\n#include \"android_webview\/browser\/deferred_gpu_command_service.h\"\n#include \"android_webview\/common\/aw_resource.h\"\n#include \"android_webview\/common\/aw_switches.h\"\n#include \"base\/android\/apk_assets.h\"\n#include \"base\/android\/build_info.h\"\n#include \"base\/android\/locale_utils.h\"\n#include \"base\/android\/memory_pressure_listener_android.h\"\n#include \"base\/command_line.h\"\n#include \"base\/files\/file_path.h\"\n#include \"base\/path_service.h\"\n#include \"content\/public\/browser\/android\/synchronous_compositor.h\"\n#include \"content\/public\/browser\/render_frame_host.h\"\n#include \"content\/public\/browser\/render_process_host.h\"\n#include \"content\/public\/common\/content_client.h\"\n#include \"content\/public\/common\/content_switches.h\"\n#include \"content\/public\/common\/result_codes.h\"\n#include \"content\/public\/common\/url_utils.h\"\n#include \"media\/base\/android\/media_client_android.h\"\n#include \"net\/android\/network_change_notifier_factory_android.h\"\n#include \"net\/base\/network_change_notifier.h\"\n#include \"ui\/base\/l10n\/l10n_util.h\"\n#include \"ui\/base\/layout.h\"\n#include \"ui\/base\/resource\/resource_bundle.h\"\n#include \"ui\/base\/resource\/resource_bundle_android.h\"\n#include \"ui\/base\/ui_base_paths.h\"\n#include \"ui\/gl\/gl_surface.h\"\n\nnamespace android_webview {\n\nAwBrowserMainParts::AwBrowserMainParts(AwBrowserContext* browser_context)\n : browser_context_(browser_context) {\n}\n\nAwBrowserMainParts::~AwBrowserMainParts() {\n}\n\nvoid AwBrowserMainParts::PreEarlyInitialization() {\n net::NetworkChangeNotifier::SetFactory(\n new net::NetworkChangeNotifierFactoryAndroid());\n\n \/\/ Android WebView does not use default MessageLoop. It has its own\n \/\/ Android specific MessageLoop. Also see MainMessageLoopRun.\n DCHECK(!main_message_loop_.get());\n main_message_loop_.reset(new base::MessageLoopForUI);\n base::MessageLoopForUI::current()->Start();\n}\n\nint AwBrowserMainParts::PreCreateThreads() {\n ui::SetLocalePaksStoredInApk(true);\n std::string locale = ui::ResourceBundle::InitSharedInstanceWithLocale(\n base::android::GetDefaultLocale(),\n NULL,\n ui::ResourceBundle::DO_NOT_LOAD_COMMON_RESOURCES);\n if (locale.empty()) {\n LOG(WARNING) << \"Failed to load locale .pak from the apk. \"\n \"Bringing up WebView without any locale\";\n }\n\n \/\/ Try to directly mmap the webviewchromium.pak from the apk. Fall back to\n \/\/ load from file, using PATH_SERVICE, otherwise.\n base::FilePath pak_file_path;\n PathService::Get(ui::DIR_RESOURCE_PAKS_ANDROID, &pak_file_path);\n pak_file_path = pak_file_path.AppendASCII(\"webviewchromium.pak\");\n ui::LoadMainAndroidPackFile(\"assets\/webviewchromium.pak\", pak_file_path);\n\n base::android::MemoryPressureListenerAndroid::RegisterSystemCallback(\n base::android::AttachCurrentThread());\n DeferredGpuCommandService::SetInstance();\n\n return content::RESULT_CODE_NORMAL_EXIT;\n}\n\nvoid AwBrowserMainParts::PreMainMessageLoopRun() {\n browser_context_->PreMainMessageLoopRun();\n\n AwDevToolsDiscoveryProvider::Install();\n\n media::SetMediaClientAndroid(\n new AwMediaClientAndroid(AwResource::GetConfigKeySystemUuidMapping()));\n\n if (base::CommandLine::ForCurrentProcess()->HasSwitch(\n switches::kUseInProcCommandBuffer)) {\n gfx::GLSurface::InitializeOneOff();\n } else {\n content::SynchronousCompositor::SetUseIpcCommandBuffer();\n }\n\n content::RenderFrameHost::AllowInjectingJavaScriptForAndroidWebView();\n\n \/\/ This is needed for WebView Classic backwards compatibility\n \/\/ See crbug.com\/298495\n content::SetMaxURLChars(20 * 1024 * 1024);\n}\n\nbool AwBrowserMainParts::MainMessageLoopRun(int* result_code) {\n \/\/ Android WebView does not use default MessageLoop. It has its own\n \/\/ Android specific MessageLoop.\n return true;\n}\n\n} \/\/ namespace android_webview\n<|endoftext|>"} {"text":"<commit_before>#include <stdio.h>\n#include <inttypes.h>\n#include <lcm\/lcm.h>\n#include <iostream>\n#include <limits>\n\n#include \"joints2frames.hpp\"\n#include <ConciseArgs>\n\nusing namespace std;\nusing namespace boost;\nusing namespace boost::assign;\n\n\/\/ false usually, set true to disable the limiting:\n#define DONT_LIMIT_FREQUENCY FALSE\n\njoints2frames::joints2frames(boost::shared_ptr<lcm::LCM> &lcm_, bool show_labels_, bool show_triads_,\n bool standalone_head_, bool multisense_sim_):\n lcm_(lcm_), show_labels_(show_labels_), show_triads_(show_triads_),\n standalone_head_(standalone_head_),\n multisense_sim_(multisense_sim_){\n \n botparam_ = bot_param_new_from_server(lcm_->getUnderlyingLCM(), 0);\n \n \n model_ = boost::shared_ptr<ModelClient>(new ModelClient(lcm_->getUnderlyingLCM(), 0));\n KDL::Tree tree;\n if (!kdl_parser::treeFromString( model_->getURDFString() ,tree)){\n cerr << \"ERROR: Failed to extract kdl tree from xml robot description\" << endl;\n exit(-1);\n }\n fksolver_ = boost::shared_ptr<KDL::TreeFkSolverPosFull_recursive>(new KDL::TreeFkSolverPosFull_recursive(tree));\n \n \/\/ Vis Config:\n pc_vis_ = new pronto_vis( lcm_->getUnderlyingLCM());\n \/\/ obj: id name type reset\n pc_vis_->obj_cfg_list.push_back( obj_cfg(6001,\"Frames\",5,1) );\n lcm_->subscribe(\"EST_ROBOT_STATE\",&joints2frames::robot_state_handler,this); \n\n #if DONT_LIMIT_FREQUENCY\n std::cout << \"Output signals will not limited in rate\\n\"; \n #else\n std::cout << \"Output signals will be limited to these rates:\\n\";\n pub_frequency_[\"BODY_TO_HEAD\"] = FrequencyLimit(0, 1E6\/getMaxFrequency( \"head\") );\n pub_frequency_[\"BODY_TO_RHAND_FORCE_TORQUE\"] = FrequencyLimit(0, 1E6\/getMaxFrequency( \"r_hand_force_torque\" ) );\n pub_frequency_[\"BODY_TO_LHAND_FORCE_TORQUE\"] = FrequencyLimit(0, 1E6\/getMaxFrequency( \"l_hand_force_torque\" ) );\n #endif\n}\n\n\ndouble joints2frames::getMaxFrequency(std::string query_root){\n double max_frequency=1.0; \n \n string query = \"coordinate_frames.\" + query_root+ \".max_frequency\";\n \n if ( bot_param_get_double(botparam_, query.c_str() , &max_frequency) == 0){\n std::cout << max_frequency << \"Hz \\t| \" << query_root << \"\\n\";\n }else{\n max_frequency =1.0;\n std::cout << max_frequency << \"Hz \\t| \" << query_root << \" ###### not found. using default ######\\n\";\n }\n return max_frequency;\n}\n\nEigen::Isometry3d KDLToEigen(KDL::Frame tf){\n Eigen::Isometry3d tf_out;\n tf_out.setIdentity();\n tf_out.translation() << tf.p[0], tf.p[1], tf.p[2];\n Eigen::Quaterniond q;\n tf.M.GetQuaternion( q.x() , q.y(), q.z(), q.w());\n tf_out.rotate(q); \n return tf_out;\n}\n\nvoid joints2frames::publishPose(Eigen::Isometry3d pose, int64_t utime, std::string channel){\n if (!shouldPublish(utime, channel) )\n return; \n \n bot_core::pose_t pose_msg;\n pose_msg.utime = utime;\n pose_msg.pos[0] = pose.translation().x();\n pose_msg.pos[1] = pose.translation().y();\n pose_msg.pos[2] = pose.translation().z(); \n Eigen::Quaterniond r_x(pose.rotation());\n pose_msg.orientation[0] = r_x.w(); \n pose_msg.orientation[1] = r_x.x(); \n pose_msg.orientation[2] = r_x.y(); \n pose_msg.orientation[3] = r_x.z(); \n lcm_->publish( channel, &pose_msg);\n}\n\n\nvoid joints2frames::publishRigidTransform(Eigen::Isometry3d pose, int64_t utime, std::string channel){\n if (!shouldPublish(utime, channel) )\n return; \n\n bot_core::rigid_transform_t tf;\n tf.utime = utime;\n tf.trans[0] = pose.translation().x();\n tf.trans[1] = pose.translation().y();\n tf.trans[2] = pose.translation().z();\n Eigen::Quaterniond quat(pose.rotation());\n tf.quat[0] = quat.w();\n tf.quat[1] = quat.x();\n tf.quat[2] = quat.y();\n tf.quat[3] = quat.z();\n lcm_->publish(channel, &tf); \n}\n\n\/\/ find the channel and check to see if it should be published\n\/\/ true: publish | false: dont publish\n\/\/ then update the utime that it was last published at\nbool joints2frames::shouldPublish(int64_t utime, std::string channel){\n #if DONT_LIMIT_FREQUENCY\n return true;\n #endif\n \n std::map<string,FrequencyLimit>::iterator it;\n it = pub_frequency_.find( channel );\n \n if(it == pub_frequency_.end()){\n std::cout << channel << \" was not found in the pub_frequency list - not publishing\\n\";\n return false; \n }\n \n if (utime < it->second.last_utime ){\n it->second.last_utime = 0;\n std::cout << utime << \" detected negative time change for \" << channel << \" resetting last_utime\\n\";\n }\n \n if (utime > it->second.min_period + it->second.last_utime ){\n it->second.last_utime = utime; \n return true;\n }\n \n \/\/ if published recently - then dont publish again\n return false;\n}\n\nvoid joints2frames::robot_state_handler(const lcm::ReceiveBuffer* rbuf, const std::string& channel, const drc::robot_state_t* msg){\n \n \/\/ 0. Extract World Pose of body:\n Eigen::Isometry3d world_to_body;\n world_to_body.setIdentity();\n world_to_body.translation() << msg->pose.translation.x, msg->pose.translation.y, msg->pose.translation.z;\n Eigen::Quaterniond quat = Eigen::Quaterniond(msg->pose.rotation.w, msg->pose.rotation.x, \n msg->pose.rotation.y, msg->pose.rotation.z);\n world_to_body.rotate(quat); \n \n \/\/ 1. Solve for Forward Kinematics:\n \/\/ call a routine that calculates the transforms the joint_state_t* msg.\n map<string, double> jointpos_in;\n map<string, KDL::Frame > cartpos_out;\n for (uint i=0; i< (uint) msg->num_joints; i++) \/\/cast to uint to suppress compiler warning\n jointpos_in.insert(make_pair(msg->joint_name[i], msg->joint_position[i]));\n \n \/\/ Calculate forward position kinematics\n bool kinematics_status;\n bool flatten_tree=true; \/\/ determines absolute transforms to robot origin, otherwise relative transforms between joints.\n kinematics_status = fksolver_->JntToCart(jointpos_in,cartpos_out,flatten_tree);\n if(kinematics_status>=0){\n \/\/ cout << \"Success!\" <<endl;\n }else{\n cerr << \"Error: could not calculate forward kinematics!\" <<endl;\n return;\n }\n \n if (multisense_sim_){\n vector<string>::iterator it;\n vector<string> vec;\n vec = msg->joint_name;\n it=find(vec.begin(),vec.end(),\"hokuyo_joint\");\n\n if(it != vec.end()){\n int hokuyo_idx = (it-vec.begin());\n\n double angle = msg->joint_position[hokuyo_idx];\n \/\/ publish message for bot_frames\n bot_core::rigid_transform_t preToPostFrame;\n preToPostFrame.utime = msg->utime;\n preToPostFrame.trans[0] = 0;\n preToPostFrame.trans[1] = 0;\n preToPostFrame.trans[2] = 0;\n preToPostFrame.quat[0] = std::cos(angle\/2);\n preToPostFrame.quat[1] = 0;\n preToPostFrame.quat[2] = 0;\n preToPostFrame.quat[3] = std::sin(angle\/2);\n lcm_->publish(\"PRE_SPINDLE_TO_POST_SPINDLE\",\n &preToPostFrame);\n }\n }\n\n\n \/\/ 2a. Determine the required BOT_FRAMES transforms:\n Eigen::Isometry3d body_to_head, body_to_hokuyo_link;\n bool body_to_head_found =false;\n bool body_to_hokuyo_link_found = false;\n for( map<string, KDL::Frame >::iterator ii=cartpos_out.begin(); ii!=cartpos_out.end(); ++ii){\n std::string link = (*ii).first;\n if ( (*ii).first.compare( \"head\" ) == 0 ){\n body_to_head = KDLToEigen( (*ii).second );\n body_to_head_found=true;\n }else if( (*ii).first.compare( \"hokuyo_link\" ) == 0 ){\n body_to_hokuyo_link = KDLToEigen( (*ii).second );\n body_to_hokuyo_link_found=true;\n }else if( (*ii).first.compare( \"r_hand_force_torque\" ) == 0 ){ \/\/ ft sensor\n publishRigidTransform( KDLToEigen( (*ii).second ) , msg->utime, \"BODY_TO_RHAND_FORCE_TORQUE\" ); \n }else if( (*ii).first.compare( \"l_hand_force_torque\" ) == 0 ){ \/\/ ft sensor\n publishRigidTransform( KDLToEigen( (*ii).second ) , msg->utime, \"BODY_TO_LHAND_FORCE_TORQUE\" );\n }\n }\n\n \/\/ 2b. Republish the required BOT_FRAMES transforms:\n if (body_to_head_found){\n publishRigidTransform(body_to_head, msg->utime, \"BODY_TO_HEAD\");\n }\n if (standalone_head_){\n \/\/ If publishing from the head alone, then the head is also the body link:\n publishRigidTransform(body_to_hokuyo_link, msg->utime, \"HEAD_TO_HOKUYO_LINK\" );\n }\n \n \/\/ 3. Loop through joints and extract world positions:\n if (show_triads_){\n int counter =msg->utime; \n std::vector<Isometry3dTime> body_to_jointTs, world_to_jointsT;\n std::vector< int64_t > body_to_joint_utimes;\n std::vector< std::string > joint_names;\n for( map<string, KDL::Frame >::iterator ii=cartpos_out.begin(); ii!=cartpos_out.end(); ++ii){\n std::string joint = (*ii).first;\n \/\/cout << joint << \": \\n\";\n joint_names.push_back( joint );\n body_to_joint_utimes.push_back( counter);\n \n Eigen::Isometry3d body_to_joint = KDLToEigen( (*ii).second );\n Isometry3dTime body_to_jointT(counter, body_to_joint);\n body_to_jointTs.push_back(body_to_jointT);\n \/\/ convert to world positions\n Isometry3dTime world_to_jointT(counter, world_to_body*body_to_joint);\n world_to_jointsT.push_back(world_to_jointT);\n counter++;\n }\n \n pc_vis_->pose_collection_to_lcm_from_list(6001, world_to_jointsT); \/\/ all joints in world frame\n if (show_labels_)\n pc_vis_->text_collection_to_lcm(6002, 6001, \"Frames [Labels]\", joint_names, body_to_joint_utimes );\n }\n}\n\n\nint\nmain(int argc, char ** argv){\n bool labels = false;\n bool triads = false;\n bool standalone_head = false;\n bool multisense_sim = false;\n ConciseArgs opt(argc, (char**)argv);\n opt.add(triads, \"t\", \"triads\",\"Frame Triads - show no not\");\n opt.add(labels, \"l\", \"labels\",\"Frame Labels - show no not\");\n opt.add(standalone_head, \"s\", \"standalone_head\",\"Standalone Sensor Head\");\n opt.add(multisense_sim, \"m\", \"multisense_sim\",\"In sim, publish PRE_SPINDLE_TO_POST_SPINDLE\");\n opt.parse();\n if (labels){ \/\/ require triads if labels is to be published\n triads=true;\n }\n \n std::cout << \"triads: \" << triads << \"\\n\";\n std::cout << \"labels: \" << labels << \"\\n\";\n\n boost::shared_ptr<lcm::LCM> lcm(new lcm::LCM(\"\") );\n if(!lcm->good())\n return 1; \n \n joints2frames app(lcm,labels,triads, standalone_head, multisense_sim);\n while(0 == lcm->handle());\n return 0;\n}\n<commit_msg>minor typo fix<commit_after>#include <stdio.h>\n#include <inttypes.h>\n#include <lcm\/lcm.h>\n#include <iostream>\n#include <limits>\n\n#include \"joints2frames.hpp\"\n#include <ConciseArgs>\n\nusing namespace std;\nusing namespace boost;\nusing namespace boost::assign;\n\n\/\/ false usually, set true to disable the limiting:\n#define DONT_LIMIT_FREQUENCY FALSE\n\njoints2frames::joints2frames(boost::shared_ptr<lcm::LCM> &lcm_, bool show_labels_, bool show_triads_,\n bool standalone_head_, bool multisense_sim_):\n lcm_(lcm_), show_labels_(show_labels_), show_triads_(show_triads_),\n standalone_head_(standalone_head_),\n multisense_sim_(multisense_sim_){\n \n botparam_ = bot_param_new_from_server(lcm_->getUnderlyingLCM(), 0);\n \n \n model_ = boost::shared_ptr<ModelClient>(new ModelClient(lcm_->getUnderlyingLCM(), 0));\n KDL::Tree tree;\n if (!kdl_parser::treeFromString( model_->getURDFString() ,tree)){\n cerr << \"ERROR: Failed to extract kdl tree from xml robot description\" << endl;\n exit(-1);\n }\n fksolver_ = boost::shared_ptr<KDL::TreeFkSolverPosFull_recursive>(new KDL::TreeFkSolverPosFull_recursive(tree));\n \n \/\/ Vis Config:\n pc_vis_ = new pronto_vis( lcm_->getUnderlyingLCM());\n \/\/ obj: id name type reset\n pc_vis_->obj_cfg_list.push_back( obj_cfg(6001,\"Frames\",5,1) );\n lcm_->subscribe(\"EST_ROBOT_STATE\",&joints2frames::robot_state_handler,this); \n\n #if DONT_LIMIT_FREQUENCY\n std::cout << \"Output signals will not limited in rate\\n\"; \n #else\n std::cout << \"Output signals will be limited to these rates:\\n\";\n pub_frequency_[\"BODY_TO_HEAD\"] = FrequencyLimit(0, 1E6\/getMaxFrequency( \"head\") );\n pub_frequency_[\"BODY_TO_RHAND_FORCE_TORQUE\"] = FrequencyLimit(0, 1E6\/getMaxFrequency( \"r_hand_force_torque\" ) );\n pub_frequency_[\"BODY_TO_LHAND_FORCE_TORQUE\"] = FrequencyLimit(0, 1E6\/getMaxFrequency( \"l_hand_force_torque\" ) );\n #endif\n}\n\n\ndouble joints2frames::getMaxFrequency(std::string query_root){\n double max_frequency=1.0; \n \n string query = \"coordinate_frames.\" + query_root+ \".max_frequency\";\n \n if ( bot_param_get_double(botparam_, query.c_str() , &max_frequency) == 0){\n std::cout << max_frequency << \"Hz \\t| \" << query_root << \"\\n\";\n }else{\n max_frequency =1.0;\n std::cout << max_frequency << \"Hz \\t| \" << query_root << \" ###### not found. using default ######\\n\";\n }\n return max_frequency;\n}\n\nEigen::Isometry3d KDLToEigen(KDL::Frame tf){\n Eigen::Isometry3d tf_out;\n tf_out.setIdentity();\n tf_out.translation() << tf.p[0], tf.p[1], tf.p[2];\n Eigen::Quaterniond q;\n tf.M.GetQuaternion( q.x() , q.y(), q.z(), q.w());\n tf_out.rotate(q); \n return tf_out;\n}\n\nvoid joints2frames::publishPose(Eigen::Isometry3d pose, int64_t utime, std::string channel){\n if (!shouldPublish(utime, channel) )\n return; \n \n bot_core::pose_t pose_msg;\n pose_msg.utime = utime;\n pose_msg.pos[0] = pose.translation().x();\n pose_msg.pos[1] = pose.translation().y();\n pose_msg.pos[2] = pose.translation().z(); \n Eigen::Quaterniond r_x(pose.rotation());\n pose_msg.orientation[0] = r_x.w(); \n pose_msg.orientation[1] = r_x.x(); \n pose_msg.orientation[2] = r_x.y(); \n pose_msg.orientation[3] = r_x.z(); \n lcm_->publish( channel, &pose_msg);\n}\n\n\nvoid joints2frames::publishRigidTransform(Eigen::Isometry3d pose, int64_t utime, std::string channel){\n if (!shouldPublish(utime, channel) )\n return; \n\n bot_core::rigid_transform_t tf;\n tf.utime = utime;\n tf.trans[0] = pose.translation().x();\n tf.trans[1] = pose.translation().y();\n tf.trans[2] = pose.translation().z();\n Eigen::Quaterniond quat(pose.rotation());\n tf.quat[0] = quat.w();\n tf.quat[1] = quat.x();\n tf.quat[2] = quat.y();\n tf.quat[3] = quat.z();\n lcm_->publish(channel, &tf); \n}\n\n\/\/ find the channel and check to see if it should be published\n\/\/ true: publish | false: dont publish\n\/\/ then update the utime that it was last published at\nbool joints2frames::shouldPublish(int64_t utime, std::string channel){\n #if DONT_LIMIT_FREQUENCY\n return true;\n #endif\n \n std::map<string,FrequencyLimit>::iterator it;\n it = pub_frequency_.find( channel );\n \n if(it == pub_frequency_.end()){\n std::cout << channel << \" was not found in the pub_frequency list - not publishing\\n\";\n return false; \n }\n \n if (utime < it->second.last_utime ){\n it->second.last_utime = 0;\n std::cout << utime << \" detected negative time change for \" << channel << \" resetting last_utime\\n\";\n }\n \n if (utime > it->second.min_period + it->second.last_utime ){\n it->second.last_utime = utime; \n return true;\n }\n \n \/\/ if published recently - then dont publish again\n return false;\n}\n\nvoid joints2frames::robot_state_handler(const lcm::ReceiveBuffer* rbuf, const std::string& channel, const drc::robot_state_t* msg){\n \n \/\/ 0. Extract World Pose of body:\n Eigen::Isometry3d world_to_body;\n world_to_body.setIdentity();\n world_to_body.translation() << msg->pose.translation.x, msg->pose.translation.y, msg->pose.translation.z;\n Eigen::Quaterniond quat = Eigen::Quaterniond(msg->pose.rotation.w, msg->pose.rotation.x, \n msg->pose.rotation.y, msg->pose.rotation.z);\n world_to_body.rotate(quat); \n \n \/\/ 1. Solve for Forward Kinematics:\n \/\/ call a routine that calculates the transforms the joint_state_t* msg.\n map<string, double> jointpos_in;\n map<string, KDL::Frame > cartpos_out;\n for (uint i=0; i< (uint) msg->num_joints; i++) \/\/cast to uint to suppress compiler warning\n jointpos_in.insert(make_pair(msg->joint_name[i], msg->joint_position[i]));\n \n \/\/ Calculate forward position kinematics\n bool kinematics_status;\n bool flatten_tree=true; \/\/ determines absolute transforms to robot origin, otherwise relative transforms between joints.\n kinematics_status = fksolver_->JntToCart(jointpos_in,cartpos_out,flatten_tree);\n if(kinematics_status>=0){\n \/\/ cout << \"Success!\" <<endl;\n }else{\n cerr << \"Error: could not calculate forward kinematics!\" <<endl;\n return;\n }\n \n if (multisense_sim_){\n vector<string>::iterator it;\n vector<string> vec;\n vec = msg->joint_name;\n it=find(vec.begin(),vec.end(),\"hokuyo_joint\");\n\n if(it != vec.end()){\n int hokuyo_idx = (it-vec.begin());\n\n double angle = msg->joint_position[hokuyo_idx];\n \/\/ publish message for bot_frames\n bot_core::rigid_transform_t preToPostFrame;\n preToPostFrame.utime = msg->utime;\n preToPostFrame.trans[0] = 0;\n preToPostFrame.trans[1] = 0;\n preToPostFrame.trans[2] = 0;\n preToPostFrame.quat[0] = std::cos(angle\/2);\n preToPostFrame.quat[1] = 0;\n preToPostFrame.quat[2] = 0;\n preToPostFrame.quat[3] = std::sin(angle\/2);\n lcm_->publish(\"PRE_SPINDLE_TO_POST_SPINDLE\",\n &preToPostFrame);\n }\n }\n\n\n \/\/ 2a. Determine the required BOT_FRAMES transforms:\n Eigen::Isometry3d body_to_head, body_to_hokuyo_link;\n bool body_to_head_found =false;\n bool body_to_hokuyo_link_found = false;\n for( map<string, KDL::Frame >::iterator ii=cartpos_out.begin(); ii!=cartpos_out.end(); ++ii){\n std::string link = (*ii).first;\n if ( (*ii).first.compare( \"head\" ) == 0 ){\n body_to_head = KDLToEigen( (*ii).second );\n body_to_head_found=true;\n }else if( (*ii).first.compare( \"hokuyo_link\" ) == 0 ){\n body_to_hokuyo_link = KDLToEigen( (*ii).second );\n body_to_hokuyo_link_found=true;\n }else if( (*ii).first.compare( \"r_hand_force_torque\" ) == 0 ){ \/\/ ft sensor\n publishRigidTransform( KDLToEigen( (*ii).second ) , msg->utime, \"BODY_TO_RHAND_FORCE_TORQUE\" ); \n }else if( (*ii).first.compare( \"l_hand_force_torque\" ) == 0 ){ \/\/ ft sensor\n publishRigidTransform( KDLToEigen( (*ii).second ) , msg->utime, \"BODY_TO_LHAND_FORCE_TORQUE\" );\n }\n }\n\n \/\/ 2b. Republish the required BOT_FRAMES transforms:\n if (body_to_head_found){\n publishRigidTransform(body_to_head, msg->utime, \"BODY_TO_HEAD\");\n }\n if (standalone_head_){\n \/\/ If publishing from the head alone, then the head is also the body link:\n publishRigidTransform(body_to_hokuyo_link, msg->utime, \"HEAD_TO_HOKUYO_LINK\" );\n }\n \n \/\/ 3. Loop through joints and extract world positions:\n if (show_triads_){\n int counter =msg->utime; \n std::vector<Isometry3dTime> body_to_jointTs, world_to_jointsT;\n std::vector< int64_t > body_to_joint_utimes;\n std::vector< std::string > joint_names;\n for( map<string, KDL::Frame >::iterator ii=cartpos_out.begin(); ii!=cartpos_out.end(); ++ii){\n std::string joint = (*ii).first;\n \/\/cout << joint << \": \\n\";\n joint_names.push_back( joint );\n body_to_joint_utimes.push_back( counter);\n \n Eigen::Isometry3d body_to_joint = KDLToEigen( (*ii).second );\n Isometry3dTime body_to_jointT(counter, body_to_joint);\n body_to_jointTs.push_back(body_to_jointT);\n \/\/ convert to world positions\n Isometry3dTime world_to_jointT(counter, world_to_body*body_to_joint);\n world_to_jointsT.push_back(world_to_jointT);\n counter++;\n }\n \n pc_vis_->pose_collection_to_lcm_from_list(6001, world_to_jointsT); \/\/ all joints in world frame\n if (show_labels_)\n pc_vis_->text_collection_to_lcm(6002, 6001, \"Frames [Labels]\", joint_names, body_to_joint_utimes );\n }\n}\n\n\nint\nmain(int argc, char ** argv){\n bool labels = false;\n bool triads = false;\n bool standalone_head = false;\n bool multisense_sim = false;\n ConciseArgs opt(argc, (char**)argv);\n opt.add(triads, \"t\", \"triads\",\"Publish Frame Triads\");\n opt.add(labels, \"l\", \"labels\",\"Publish Frame Labels\");\n opt.add(standalone_head, \"s\", \"standalone_head\",\"Standalone Sensor Head\");\n opt.add(multisense_sim, \"m\", \"multisense_sim\",\"In sim, publish PRE_SPINDLE_TO_POST_SPINDLE\");\n opt.parse();\n if (labels){ \/\/ require triads if labels is to be published\n triads=true;\n }\n \n std::cout << \"triads: \" << triads << \"\\n\";\n std::cout << \"labels: \" << labels << \"\\n\";\n\n boost::shared_ptr<lcm::LCM> lcm(new lcm::LCM(\"\") );\n if(!lcm->good())\n return 1; \n \n joints2frames app(lcm,labels,triads, standalone_head, multisense_sim);\n while(0 == lcm->handle());\n return 0;\n}\n<|endoftext|>"} {"text":"<commit_before>#include \"rosplan_planning_system\/PlanDispatcher.h\"\n#include <map>\n\nnamespace KCL_rosplan {\n\n\tint PlanDispatcher::getCurrentAction() {\n\t\treturn current_action;\n\t}\n\n\tvoid PlanDispatcher::reset() {\n\t\tdispatch_paused = false;\n\t\tcurrent_action = 0;\n\t\taction_received.clear();\n\t\taction_completed.clear();\n\t\treplan_requested = false;\n\t}\n\n\t\/*-----------------*\/\n\t\/* action dispatch *\/\n\t\/*-----------------*\/\n\n\t\/*\n\t * Loop through and publish planned actions\n\t *\/\n\tbool PlanDispatcher::dispatchPlan(const std::vector<rosplan_dispatch_msgs::ActionDispatch> &actionList, double missionStart, double planStart) {\n\n\t\tros::NodeHandle nh(\"~\");\n\t\tros::Rate loop_rate(10);\n\n\t\tROS_INFO(\"KCL: (PS) Dispatching plan\");\n\t\treplan_requested = false;\n\t\tbool repeatAction = false;\n\t\twhile (ros::ok() && actionList.size() > current_action) {\n\n\t\t\t\/\/ get next action\n\t\t\trosplan_dispatch_msgs::ActionDispatch currentMessage = actionList[current_action];\n\t\t\tif((unsigned int)currentMessage.action_id != current_action)\n\t\t\t\tROS_ERROR(\"KCL: (PS) Message action_id [%d] does not meet expected [%zu]\", currentMessage.action_id, current_action);\n\n\t\t\t\/\/ loop while waiting for dispatch time\n\t\t\tif(!dispatch_on_completion) {\n\t\t\t\tdouble wait_period = 10.0;\n\t\t\t\tint wait_print = (int)(currentMessage.dispatch_time + planStart - ros::WallTime::now().toSec()) \/ wait_period;\n\t\t\t\twhile (ros::ok() && ros::WallTime::now().toSec() < currentMessage.dispatch_time + planStart) {\n\t\t\t\t\tros::spinOnce();\n\t\t\t\t\tloop_rate.sleep();\n\t\t\t\t\tdouble remaining = planStart + currentMessage.dispatch_time - ros::WallTime::now().toSec();\n\t\t\t\t\tif(wait_print > (int)remaining \/ wait_period) {\n\t\t\t\t\t\tROS_INFO(\"KCL: (PS) Waiting %f before dispatching action: [%i, %s, %f, %f]\",\n\t\t\t\t\t\t\t\tremaining,currentMessage.action_id, currentMessage.name.c_str(),\n\t\t\t\t\t\t\t\t (currentMessage.dispatch_time+planStart-missionStart), currentMessage.duration);\n\t\t\t\t\t\twait_print--;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\n\t\t\tif(!checkPreconditions(currentMessage)) {\n\t\t\t\tROS_INFO(\"KCL: (PS) Preconditions not achieved [%i, %s]\", currentMessage.action_id, currentMessage.name.c_str());\n\t\t\t}\n\n\t\t\t\/\/ dispatch action\n\t\t\tROS_INFO(\"KCL: (PS) Dispatching action [%i, %s, %f, %f]\", currentMessage.action_id, currentMessage.name.c_str(), (currentMessage.dispatch_time+planStart-missionStart), currentMessage.duration);\n\t\t\taction_publisher.publish(currentMessage);\n\t\t\tdouble late_print = (ros::WallTime::now().toSec() - (currentMessage.dispatch_time + planStart));\n\t\t\tif(late_print>0.1) ROS_INFO(\"KCL: (PS) Action [%i] is %f second(s) late\", currentMessage.action_id, late_print);\n\n\t\t\t\/\/ wait for action to complete\n\t\t\tif(!dispatch_concurrent) {\n\t\t\t\tint counter = 0;\n\t\t\t\twhile (ros::ok() && !action_completed[current_action]) {\n\t\t\t\t\tros::spinOnce();\n\t\t\t\t\tloop_rate.sleep();\n\t\t\t\t\tcounter++;\n\t\t\t\t\tif (counter == 2000) {\n\t\t\t\t\t\tROS_INFO(\"KCL: (PS) Action %i timed out now. Cancelling...\", currentMessage.action_id);\n\t\t\t\t\t\trosplan_dispatch_msgs::ActionDispatch cancelMessage;\n\t\t\t\t\t\tcancelMessage.action_id = currentMessage.action_id;\n\t\t\t\t\t\tcancelMessage.name = \"cancel_action\";\n\t\t\t\t\t\taction_publisher.publish(cancelMessage);\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\n\t\t\t\/\/ get ready for next action\n\t\t\tif(!repeatAction) current_action++;\n\t\t\trepeatAction = false;\n\t\t\taction_received[current_action] = false;\n\t\t\taction_completed[current_action] = false;\n\n\t\t\t\/\/ finish dispatch and replan\n\t\t\tif(replan_requested) return false;\n\t\t}\n\t\treturn true;\n\t}\n\n\tbool PlanDispatcher::checkPreconditions(rosplan_dispatch_msgs::ActionDispatch msg) {\n\n\t\t\/\/ setup service call\n\t\tros::NodeHandle nh;\n\t\tros::ServiceClient queryKnowledgeClient = nh.serviceClient<rosplan_knowledge_msgs::KnowledgeQueryService>(\"\/kcl_rosplan\/query_knowledge_base\");\n\t\trosplan_knowledge_msgs::KnowledgeQueryService querySrv;\n\n\t\tstd::map<std::string, std::vector<std::vector<std::string> > >::iterator oit;\n\t\toit = environment.domain_operator_precondition_map.find(msg.name);\n\t\tif(oit==environment.domain_operator_precondition_map.end()) return false;\n\n\t\t\/\/ iterate through conditions\n\t\tstd::vector<std::vector<std::string> >::iterator cit = oit->second.begin();\n\t\tfor(; cit!=oit->second.end(); cit++) {\n\t\t\t\n\t\t\trosplan_knowledge_msgs::KnowledgeItem condition;\n\t\t\t\n\t\t\t\/\/ set fact or function\n\t\t\tstd::map<std::string,std::vector<std::string> >::iterator dit = environment.domain_predicates.find((*cit)[0]);\n\t\t\tif(dit!=environment.domain_predicates.end()) condition.knowledge_type = rosplan_knowledge_msgs::KnowledgeItem::DOMAIN_ATTRIBUTE;\n\n\t\t\tdit = environment.domain_functions.find((*cit)[0]);\n\t\t\tif(dit!=environment.domain_functions.end()) condition.knowledge_type = rosplan_knowledge_msgs::KnowledgeItem::DOMAIN_FUNCTION;\n\n\t\t\t\/\/ populate parameters\n\t\t\tcondition.attribute_name = (*cit)[0];\n\t\t\tint index = 1;\n\t\t\tstd::vector<std::string>::iterator pit;\n\t\t\tfor(pit=environment.domain_predicates[condition.attribute_name].begin();\n\t\t\t\t\tpit!=environment.domain_predicates[condition.attribute_name].end(); pit++) {\n\t\t\t\t\/\/ set parameter label to predicate label\n\t\t\t\tdiagnostic_msgs::KeyValue param;\n\t\t\t\tparam.key = *pit;\n\t\t\t\t\/\/ find label as it is in domain operator\n\t\t\t\tstd::string conditionKey = (*cit)[index];\n\t\t\t\tindex++;\n\t\t\t\t\/\/ set value\n\t\t\t\tstd::vector<diagnostic_msgs::KeyValue>::iterator opit;\n\t\t\t\tfor(opit = msg.parameters.begin(); opit!=msg.parameters.end(); opit++) {\n\t\t\t\t\tif(0==opit->value.compare(conditionKey))\n\t\t\t\t\t\tparam.value = opit->value;\n\t\t\t\t}\n\t\t\t\tcondition.values.push_back(param);\n\t\t\t}\n\t\t\tquerySrv.request.knowledge.push_back(condition);\n\t\t}\n\n\t\t\/\/ check conditions in knowledge base\n\t\tif (queryKnowledgeClient.call(querySrv)) {\n\t\t\t\n\t\t\tif(!querySrv.response.all_true) {\n\t\t\t\tstd::vector<rosplan_knowledge_msgs::KnowledgeItem>::iterator kit;\n\t\t\t\tfor(kit=querySrv.response.false_knowledge.begin(); kit != querySrv.response.false_knowledge.end(); kit++)\n\t\t\t\t\tROS_INFO(\"KCL: (PS) [%s]\", kit->attribute_name.c_str());\n\t\t\t}\n\t\t\treturn querySrv.response.all_true;\n\n\t\t} else {\n\t\t\tROS_ERROR(\"KCL: (PS) Failed to call service \/kcl_rosplan\/query_knowledge_base\");\n\t\t}\n\t}\n\n\t\/*------------------*\/\n\t\/* general feedback *\/\n\t\/*------------------*\/\n\n\t\/**\n\t * listen to and process actionFeedback topic.\n\t *\/\n\tvoid PlanDispatcher::feedbackCallback(const rosplan_dispatch_msgs::ActionFeedback::ConstPtr& msg) {\n\n\t\t\/\/ create error if the action is unrecognised\n\t\tROS_INFO(\"KCL: (PS) Feedback received [%i,%s]\", msg->action_id, msg->status.c_str());\n\t\tif(current_action != (unsigned int)msg->action_id)\n\t\t\tROS_ERROR(\"KCL: (PS) Unexpected action ID: %d; current action: %zu\", msg->action_id, current_action);\n\n\t\t\/\/ action enabled\n\t\tif(!action_received[msg->action_id] && (0 == msg->status.compare(\"action enabled\")))\n\t\t\taction_received[msg->action_id] = true;\n\t\t\n\t\t\/\/ more specific feedback\n\t\tactionFeedback(msg);\n\n\t\t\/\/ action completed (successfuly)\n\t\tif(!action_completed[msg->action_id] && 0 == msg->status.compare(\"action achieved\"))\n\t\t\taction_completed[msg->action_id] = true;\n\n\t\t\/\/ action completed (failed)\n\t\tif(!action_completed[msg->action_id] && 0 == msg->status.compare(\"action failed\")) {\n\t\t\treplan_requested = true;\n\t\t\taction_completed[msg->action_id] = true;\n\t\t}\n\t}\n\n\t\/*---------------------------*\/\n\t\/* Specific action responses *\/\n\t\/*---------------------------*\/\n\n\t\/**\n\t * processes single action feedback message.\n\t * This method serves as the hook for defining more interesting behaviour on action feedback.\n\t *\/\n\tvoid PlanDispatcher::actionFeedback(const rosplan_dispatch_msgs::ActionFeedback::ConstPtr& msg) {\n\t\t\/\/ nothing yet...\n\t}\n} \/\/ close namespace\n<commit_msg>Prints<commit_after>#include \"rosplan_planning_system\/PlanDispatcher.h\"\n#include <map>\n\nnamespace KCL_rosplan {\n\n\tint PlanDispatcher::getCurrentAction() {\n\t\treturn current_action;\n\t}\n\n\tvoid PlanDispatcher::reset() {\n\t\tdispatch_paused = false;\n\t\tcurrent_action = 0;\n\t\taction_received.clear();\n\t\taction_completed.clear();\n\t\treplan_requested = false;\n\t}\n\n\t\/*-----------------*\/\n\t\/* action dispatch *\/\n\t\/*-----------------*\/\n\n\t\/*\n\t * Loop through and publish planned actions\n\t *\/\n\tbool PlanDispatcher::dispatchPlan(const std::vector<rosplan_dispatch_msgs::ActionDispatch> &actionList, double missionStart, double planStart) {\n\n\t\tros::NodeHandle nh(\"~\");\n\t\tros::Rate loop_rate(10);\n\n\t\tROS_INFO(\"KCL: (PS) Dispatching plan\");\n\t\treplan_requested = false;\n\t\tbool repeatAction = false;\n\t\twhile (ros::ok() && actionList.size() > current_action) {\n\n\t\t\t\/\/ get next action\n\t\t\trosplan_dispatch_msgs::ActionDispatch currentMessage = actionList[current_action];\n\t\t\tif((unsigned int)currentMessage.action_id != current_action)\n\t\t\t\tROS_ERROR(\"KCL: (PS) Message action_id [%d] does not meet expected [%zu]\", currentMessage.action_id, current_action);\n\n\t\t\t\/\/ loop while waiting for dispatch time\n\t\t\tif(!dispatch_on_completion) {\n\t\t\t\tdouble wait_period = 10.0;\n\t\t\t\tint wait_print = (int)(currentMessage.dispatch_time + planStart - ros::WallTime::now().toSec()) \/ wait_period;\n\t\t\t\twhile (ros::ok() && ros::WallTime::now().toSec() < currentMessage.dispatch_time + planStart) {\n\t\t\t\t\tros::spinOnce();\n\t\t\t\t\tloop_rate.sleep();\n\t\t\t\t\tdouble remaining = planStart + currentMessage.dispatch_time - ros::WallTime::now().toSec();\n\t\t\t\t\tif(wait_print > (int)remaining \/ wait_period) {\n\t\t\t\t\t\tROS_INFO(\"KCL: (PS) Waiting %f before dispatching action: [%i, %s, %f, %f]\",\n\t\t\t\t\t\t\t\tremaining,currentMessage.action_id, currentMessage.name.c_str(),\n\t\t\t\t\t\t\t\t (currentMessage.dispatch_time+planStart-missionStart), currentMessage.duration);\n\t\t\t\t\t\twait_print--;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\n\t\t\tif(!checkPreconditions(currentMessage)) {\n\t\t\t\tROS_INFO(\"KCL: (PS) Preconditions not achieved [%i, %s]\", currentMessage.action_id, currentMessage.name.c_str());\n\t\t\t}\n\n\t\t\t\/\/ dispatch action\n\t\t\tROS_INFO(\"KCL: (PS) Dispatching action [%i, %s, %f, %f]\", currentMessage.action_id, currentMessage.name.c_str(), (currentMessage.dispatch_time+planStart-missionStart), currentMessage.duration);\n\t\t\taction_publisher.publish(currentMessage);\n\t\t\tdouble late_print = (ros::WallTime::now().toSec() - (currentMessage.dispatch_time + planStart));\n\t\t\tif(late_print>0.1) ROS_INFO(\"KCL: (PS) Action [%i] is %f second(s) late\", currentMessage.action_id, late_print);\n\n\t\t\t\/\/ wait for action to complete\n\t\t\tif(!dispatch_concurrent) {\n\t\t\t\tint counter = 0;\n\t\t\t\twhile (ros::ok() && !action_completed[current_action]) {\n\t\t\t\t\tros::spinOnce();\n\t\t\t\t\tloop_rate.sleep();\n\t\t\t\t\tcounter++;\n\t\t\t\t\tif (counter == 2000) {\n\t\t\t\t\t\tROS_INFO(\"KCL: (PS) Action %i timed out now. Cancelling...\", currentMessage.action_id);\n\t\t\t\t\t\trosplan_dispatch_msgs::ActionDispatch cancelMessage;\n\t\t\t\t\t\tcancelMessage.action_id = currentMessage.action_id;\n\t\t\t\t\t\tcancelMessage.name = \"cancel_action\";\n\t\t\t\t\t\taction_publisher.publish(cancelMessage);\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\n\t\t\t\/\/ get ready for next action\n\t\t\tif(!repeatAction) current_action++;\n\t\t\trepeatAction = false;\n\t\t\taction_received[current_action] = false;\n\t\t\taction_completed[current_action] = false;\n\n\t\t\t\/\/ finish dispatch and replan\n\t\t\tif(replan_requested) return false;\n\t\t}\n\t\treturn true;\n\t}\n\n\tbool PlanDispatcher::checkPreconditions(rosplan_dispatch_msgs::ActionDispatch msg) {\n\n\t\t\/\/ setup service call\n\t\tros::NodeHandle nh;\n\t\tros::ServiceClient queryKnowledgeClient = nh.serviceClient<rosplan_knowledge_msgs::KnowledgeQueryService>(\"\/kcl_rosplan\/query_knowledge_base\");\n\t\trosplan_knowledge_msgs::KnowledgeQueryService querySrv;\n\n\t\tstd::map<std::string, std::vector<std::vector<std::string> > >::iterator oit;\n\t\toit = environment.domain_operator_precondition_map.find(msg.name);\n\t\tif(oit==environment.domain_operator_precondition_map.end()) return false;\n\n\t\t\/\/ iterate through conditions\n\t\tstd::vector<std::vector<std::string> >::iterator cit = oit->second.begin();\n\t\tfor(; cit!=oit->second.end(); cit++) {\n\t\t\t\n\t\t\trosplan_knowledge_msgs::KnowledgeItem condition;\n\t\t\t\n\t\t\t\/\/ set fact or function\n\t\t\tstd::map<std::string,std::vector<std::string> >::iterator dit = environment.domain_predicates.find((*cit)[0]);\n\t\t\tif(dit!=environment.domain_predicates.end()) condition.knowledge_type = rosplan_knowledge_msgs::KnowledgeItem::DOMAIN_ATTRIBUTE;\n\n\t\t\tdit = environment.domain_functions.find((*cit)[0]);\n\t\t\tif(dit!=environment.domain_functions.end()) condition.knowledge_type = rosplan_knowledge_msgs::KnowledgeItem::DOMAIN_FUNCTION;\n\n\t\t\t\/\/ populate parameters\nstd::cout << \"---\" << std::endl;\n\t\t\tcondition.attribute_name = (*cit)[0];\nstd::cout << condition.attribute_name << std::endl;\n\t\t\tint index = 1;\n\t\t\tstd::vector<std::string>::iterator pit;\n\t\t\tfor(pit=environment.domain_predicates[condition.attribute_name].begin();\n\t\t\t\t\tpit!=environment.domain_predicates[condition.attribute_name].end(); pit++) {\n\t\t\t\t\/\/ set parameter label to predicate label\n\t\t\t\tdiagnostic_msgs::KeyValue param;\n\t\t\t\tparam.key = *pit;\nstd::cout << \"-\" << *pit;\n\t\t\t\t\/\/ find label as it is in domain operator\n\t\t\t\tstd::string conditionKey = (*cit)[index];\n\t\t\t\tindex++;\n\t\t\t\t\/\/ set value\n\t\t\t\tstd::vector<diagnostic_msgs::KeyValue>::iterator opit;\n\t\t\t\tfor(opit = msg.parameters.begin(); opit!=msg.parameters.end(); opit++) {\n\t\t\t\t\tif(0==opit->value.compare(conditionKey)) {\n\t\t\t\t\t\tparam.value = opit->value;\nstd::cout << \" : \" << opit->value;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\tcondition.values.push_back(param);\nstd::cout << std::endl;\n\t\t\t}\n\t\t\tquerySrv.request.knowledge.push_back(condition);\n\t\t}\n\n\t\t\/\/ check conditions in knowledge base\n\t\tif (queryKnowledgeClient.call(querySrv)) {\n\t\t\t\n\t\t\tif(!querySrv.response.all_true) {\n\t\t\t\tstd::vector<rosplan_knowledge_msgs::KnowledgeItem>::iterator kit;\n\t\t\t\tfor(kit=querySrv.response.false_knowledge.begin(); kit != querySrv.response.false_knowledge.end(); kit++)\n\t\t\t\t\tROS_INFO(\"KCL: (PS) [%s]\", kit->attribute_name.c_str());\n\t\t\t}\n\t\t\treturn querySrv.response.all_true;\n\n\t\t} else {\n\t\t\tROS_ERROR(\"KCL: (PS) Failed to call service \/kcl_rosplan\/query_knowledge_base\");\n\t\t}\n\t}\n\n\t\/*------------------*\/\n\t\/* general feedback *\/\n\t\/*------------------*\/\n\n\t\/**\n\t * listen to and process actionFeedback topic.\n\t *\/\n\tvoid PlanDispatcher::feedbackCallback(const rosplan_dispatch_msgs::ActionFeedback::ConstPtr& msg) {\n\n\t\t\/\/ create error if the action is unrecognised\n\t\tROS_INFO(\"KCL: (PS) Feedback received [%i,%s]\", msg->action_id, msg->status.c_str());\n\t\tif(current_action != (unsigned int)msg->action_id)\n\t\t\tROS_ERROR(\"KCL: (PS) Unexpected action ID: %d; current action: %zu\", msg->action_id, current_action);\n\n\t\t\/\/ action enabled\n\t\tif(!action_received[msg->action_id] && (0 == msg->status.compare(\"action enabled\")))\n\t\t\taction_received[msg->action_id] = true;\n\t\t\n\t\t\/\/ more specific feedback\n\t\tactionFeedback(msg);\n\n\t\t\/\/ action completed (successfuly)\n\t\tif(!action_completed[msg->action_id] && 0 == msg->status.compare(\"action achieved\"))\n\t\t\taction_completed[msg->action_id] = true;\n\n\t\t\/\/ action completed (failed)\n\t\tif(!action_completed[msg->action_id] && 0 == msg->status.compare(\"action failed\")) {\n\t\t\treplan_requested = true;\n\t\t\taction_completed[msg->action_id] = true;\n\t\t}\n\t}\n\n\t\/*---------------------------*\/\n\t\/* Specific action responses *\/\n\t\/*---------------------------*\/\n\n\t\/**\n\t * processes single action feedback message.\n\t * This method serves as the hook for defining more interesting behaviour on action feedback.\n\t *\/\n\tvoid PlanDispatcher::actionFeedback(const rosplan_dispatch_msgs::ActionFeedback::ConstPtr& msg) {\n\t\t\/\/ nothing yet...\n\t}\n} \/\/ close namespace\n<|endoftext|>"} {"text":"<commit_before>\n#include <stdlib.h> \/* srand, rand *\/\n\n#include <chrono>\n#include <iostream>\n#include <fstream>\n#include <string>\n#include <algorithm>\n\n#include \"bpmf.h\"\n\nusing namespace std;\nusing namespace Eigen;\n\ntypedef SparseMatrix<double> SparseMatrixD;\n\nconst int num_feat = 32;\nunsigned num_p = 0;\nunsigned num_m = 0;\n\nconst int alpha = 2;\nconst int nsims = 20;\nconst int burnin = 5;\n\ndouble mean_rating = .0;\n\nSparseMatrixD M;\ntypedef Eigen::Triplet<double> T;\nvector<T> probe_vec;\n\ntypedef Matrix<double, num_feat, 1> VectorNd;\ntypedef Matrix<double, num_feat, num_feat> MatrixNNd;\ntypedef Matrix<double, num_feat, Dynamic> MatrixNXd;\n\nVectorNd mu_u;\nVectorNd mu_m;\nMatrixNNd Lambda_u;\nMatrixNNd Lambda_m;\nMatrixNXd sample_u;\nMatrixNXd sample_m;\n\n\/\/ parameters of Inv-Whishart distribution (see paper for details)\nMatrixNNd WI_u;\nconst int b0_u = 2;\nconst int df_u = num_feat;\nVectorNd mu0_u;\n\nMatrixNNd WI_m;\nconst int b0_m = 2;\nconst int df_m = num_feat;\nVectorNd mu0_m;\n\nvoid loadChemo(const char* fname)\n{\n std::vector<T> lst;\n lst.reserve(100000);\n \n FILE *f = fopen(fname, \"r\");\n assert(f && \"Could not open file\");\n\n \/\/ skip header\n char buf[2048];\n fscanf(f, \"%s\\n\", buf);\n\n \/\/ data\n unsigned i, j;\n double v;\n while (!feof(f)) {\n if (!fscanf(f, \"%d,%d,%lg\\n\", &i, &j, &v)) continue;\n i--;\n j--;\n\n if ((rand() % 5) == 0) {\n probe_vec.push_back(T(i,j,log10(v)));\n } \n#ifndef TEST_SAMPLE\n else \/\/ if not in test case -> remove probe_vec from lst\n#endif\n {\n num_p = std::max(num_p, i);\n num_m = std::max(num_m, j);\n mean_rating += v;\n lst.push_back(T(i,j,log10(v)));\n }\n }\n num_p++;\n num_m++;\n mean_rating \/= lst.size();\n fclose(f);\n\n M = SparseMatrix<double>(num_p, num_m);\n M.setFromTriplets(lst.begin(), lst.end());\n}\n\nvoid init() {\n mean_rating = M.sum() \/ M.nonZeros();\n Lambda_u.setIdentity();\n Lambda_m.setIdentity();\n\n sample_u = MatrixNXd(num_feat,num_p);\n sample_m = MatrixNXd(num_feat,num_m);\n sample_u.setZero();\n sample_m.setZero();\n\n \/\/ parameters of Inv-Whishart distribution (see paper for details)\n WI_u.setIdentity();\n mu0_u.setZero();\n\n WI_m.setIdentity();\n mu0_m.setZero();\n}\n\npair<double,double> eval_probe_vec(const vector<T> &probe_vec, const MatrixNXd &sample_m, const MatrixNXd &sample_u, double mean_rating)\n{\n unsigned n = probe_vec.size();\n unsigned correct = 0;\n double diff = .0;\n for(auto t : probe_vec) {\n double prediction = sample_m.col(t.col()).dot(sample_u.col(t.row())) + mean_rating;\n \/\/cout << \"prediction: \" << prediction - mean_rating << \" + \" << mean_rating << \" = \" << prediction << endl;\n \/\/cout << \"actual: \" << t.value() << endl;\n correct += (t.value() < log10(200)) == (prediction < log10(200));\n diff += abs(t.value() - prediction);\n }\n \n return std::make_pair((double)correct \/ n, diff \/ n);\n}\n\nvoid sample_movie(MatrixNXd &s, int mm, const SparseMatrixD &mat, double mean_rating, \n const MatrixNXd &samples, int alpha, const VectorNd &mu_u, const MatrixNNd &Lambda_u)\n{\n int i = 0;\n MatrixNXd E(num_feat,mat.col(mm).nonZeros());\n VectorXd rr(mat.col(mm).nonZeros());\n \/\/cout << \"movie \" << endl;\n for (SparseMatrixD::InnerIterator it(mat,mm); it; ++it, ++i) {\n \/\/ cout << \"M[\" << it.row() << \",\" << it.col() << \"] = \" << it.value() << endl;\n E.col(i) = samples.col(it.row());\n rr(i) = it.value() - mean_rating;\n }\n\n\n auto MM = E * E.transpose();\n auto MMs = alpha * MM;\n MatrixNNd covar = (Lambda_u + MMs).inverse();\n VectorNd MMrr = (E * rr) * alpha;\n auto U = Lambda_u * mu_u;\n auto mu = covar * (MMrr + U);\n\n MatrixNNd chol = covar.llt().matrixL();\n#ifdef TEST_SAMPLE\n auto r(num_feat); r.setConstant(0.25);\n#else\n auto r = nrandn(num_feat);\n#endif\n s.col(mm) = chol * r + mu;\n\n#ifdef TEST_SAMPLE\n cout << \"movie \" << mm << \":\" << result.cols() << \" x\" << result.rows() << endl;\n cout << \"mean rating \" << mean_rating << endl;\n cout << \"E = [\" << E << \"]\" << endl;\n cout << \"rr = [\" << rr << \"]\" << endl;\n cout << \"MM = [\" << MM << \"]\" << endl;\n cout << \"Lambda_u = [\" << Lambda_u << \"]\" << endl;\n cout << \"covar = [\" << covar << \"]\" << endl;\n cout << \"mu = [\" << mu << \"]\" << endl;\n cout << \"chol = [\" << chol << \"]\" << endl;\n cout << \"rand = [\" << r <<\"]\" << endl;\n cout << \"result = [\" << result << \"]\" << endl;\n#endif\n\n}\n\n#ifdef TEST_SAMPLE\nvoid test() {\n MatrixNXd sample_u(num_p);\n MatrixNXd sample_m(num_m);\n\n mu_m.setZero();\n Lambda_m.setIdentity();\n sample_u.setConstant(2.0);\n Lambda_m *= 0.5;\n sample_m.col(0) = sample_movie(0, M, mean_rating, sample_u, alpha, mu_m, Lambda_m);\n}\n\n#else\n\nvoid run() {\n auto start = std::chrono::steady_clock::now();\n\n SparseMatrixD Mt = M.transpose();\n\n std::cout << \"Sampling\" << endl;\n for(int i=0; i<nsims; ++i) {\n\n \/\/ Sample from movie hyperparams\n tie(mu_m, Lambda_m) = CondNormalWishart(sample_m, mu0_m, b0_m, WI_m, df_m);\n\n \/\/ Sample from user hyperparams\n tie(mu_u, Lambda_u) = CondNormalWishart(sample_u, mu0_u, b0_u, WI_u, df_u);\n\n#pragma omp parallel for\n for(int mm = 0; mm < num_m; ++mm) {\n sample_movie(sample_m, mm, M, mean_rating, sample_u, alpha, mu_m, Lambda_m);\n }\n\n#pragma omp parallel for\n for(int uu = 0; uu < num_p; ++uu) {\n sample_movie(sample_u, uu, Mt, mean_rating, sample_m, alpha, mu_u, Lambda_u);\n }\n\n auto eval = eval_probe_vec(probe_vec, sample_m, sample_u, mean_rating);\n double norm_u = sample_u.norm();\n double norm_m = sample_m.norm();\n auto end = std::chrono::steady_clock::now();\n auto elapsed = std::chrono::duration<double>(end - start);\n double samples_per_sec = (i + 1) * (num_p + num_m) \/ elapsed.count();\n\n printf(\"Iteration %d:\\t num_correct: %3.2f%%\\tavg_diff: %3.2f\\tFU(%6.2f)\\tFM(%6.2f)\\tSamples\/sec: %6.2f\\n\",\n i, 100*eval.first, eval.second, norm_u, norm_m, samples_per_sec);\n }\n}\n\n#endif\n\nint main(int argc, char *argv[])\n{\n const char *fname = argv[1];\n assert(fname && \"filename missing\");\n Eigen::initParallel();\n Eigen::setNbThreads(1);\n\n loadChemo(fname);\n init();\n#ifdef TEST_SAMPLE\n test();\n#else\n run();\n#endif\n\n return 0;\n}\n<commit_msg>c++: now using matrix market matrices<commit_after>\n#include <stdlib.h> \/* srand, rand *\/\n\n#include <chrono>\n#include <iostream>\n#include <fstream>\n#include <string>\n#include <algorithm>\n\n#include <unsupported\/Eigen\/SparseExtra>\n\n#include \"bpmf.h\"\n\nusing namespace std;\nusing namespace Eigen;\n\ntypedef SparseMatrix<double> SparseMatrixD;\n\nconst int num_feat = 32;\n\nconst int alpha = 2;\nconst int nsims = 20;\nconst int burnin = 5;\n\ndouble mean_rating = .0;\n\nSparseMatrixD M, P;\n\ntypedef Matrix<double, num_feat, 1> VectorNd;\ntypedef Matrix<double, num_feat, num_feat> MatrixNNd;\ntypedef Matrix<double, num_feat, Dynamic> MatrixNXd;\n\nVectorNd mu_u;\nVectorNd mu_m;\nMatrixNNd Lambda_u;\nMatrixNNd Lambda_m;\nMatrixNXd sample_u;\nMatrixNXd sample_m;\n\n\/\/ parameters of Inv-Whishart distribution (see paper for details)\nMatrixNNd WI_u;\nconst int b0_u = 2;\nconst int df_u = num_feat;\nVectorNd mu0_u;\n\nMatrixNNd WI_m;\nconst int b0_m = 2;\nconst int df_m = num_feat;\nVectorNd mu0_m;\n\nvoid init() {\n mean_rating = M.sum() \/ M.nonZeros();\n Lambda_u.setIdentity();\n Lambda_m.setIdentity();\n\n sample_u = MatrixNXd(num_feat,M.rows());\n sample_m = MatrixNXd(num_feat,M.cols());\n sample_u.setZero();\n sample_m.setZero();\n\n \/\/ parameters of Inv-Whishart distribution (see paper for details)\n WI_u.setIdentity();\n mu0_u.setZero();\n\n WI_m.setIdentity();\n mu0_m.setZero();\n}\n\npair<double,double> eval_probe_vec(const MatrixNXd &sample_m, const MatrixNXd &sample_u, double mean_rating)\n{\n unsigned n = P.nonZeros();\n unsigned correct = 0;\n double diff = .0;\n for (int k=0; k<P.outerSize(); ++k)\n for (SparseMatrix<double>::InnerIterator it(P,k); it; ++it) {\n double prediction = sample_m.col(it.col()).dot(sample_u.col(it.row())) + mean_rating;\n \/\/cout << \"prediction: \" << prediction - mean_rating << \" + \" << mean_rating << \" = \" << prediction << endl;\n \/\/cout << \"actual: \" << it.value() << endl;\n correct += (it.value() < log10(200)) == (prediction < log10(200));\n diff += abs(it.value() - prediction);\n }\n \n return std::make_pair((double)correct \/ n, diff \/ n);\n}\n\nvoid sample_movie(MatrixNXd &s, int mm, const SparseMatrixD &mat, double mean_rating, \n const MatrixNXd &samples, int alpha, const VectorNd &mu_u, const MatrixNNd &Lambda_u)\n{\n int i = 0;\n MatrixNXd E(num_feat,mat.col(mm).nonZeros());\n VectorXd rr(mat.col(mm).nonZeros());\n \/\/cout << \"movie \" << endl;\n for (SparseMatrixD::InnerIterator it(mat,mm); it; ++it, ++i) {\n \/\/ cout << \"M[\" << it.row() << \",\" << it.col() << \"] = \" << it.value() << endl;\n E.col(i) = samples.col(it.row());\n rr(i) = it.value() - mean_rating;\n }\n\n\n auto MM = E * E.transpose();\n auto MMs = alpha * MM;\n MatrixNNd covar = (Lambda_u + MMs).inverse();\n VectorNd MMrr = (E * rr) * alpha;\n auto U = Lambda_u * mu_u;\n auto mu = covar * (MMrr + U);\n\n MatrixNNd chol = covar.llt().matrixL();\n#ifdef TEST_SAMPLE\n auto r(num_feat); r.setConstant(0.25);\n#else\n auto r = nrandn(num_feat);\n#endif\n s.col(mm) = chol * r + mu;\n\n#ifdef TEST_SAMPLE\n cout << \"movie \" << mm << \":\" << result.cols() << \" x\" << result.rows() << endl;\n cout << \"mean rating \" << mean_rating << endl;\n cout << \"E = [\" << E << \"]\" << endl;\n cout << \"rr = [\" << rr << \"]\" << endl;\n cout << \"MM = [\" << MM << \"]\" << endl;\n cout << \"Lambda_u = [\" << Lambda_u << \"]\" << endl;\n cout << \"covar = [\" << covar << \"]\" << endl;\n cout << \"mu = [\" << mu << \"]\" << endl;\n cout << \"chol = [\" << chol << \"]\" << endl;\n cout << \"rand = [\" << r <<\"]\" << endl;\n cout << \"result = [\" << result << \"]\" << endl;\n#endif\n\n}\n\n#ifdef TEST_SAMPLE\nvoid test() {\n MatrixNXd sample_u(M.rows());\n MatrixNXd sample_m(M.cols());\n\n mu_m.setZero();\n Lambda_m.setIdentity();\n sample_u.setConstant(2.0);\n Lambda_m *= 0.5;\n sample_m.col(0) = sample_movie(0, M, mean_rating, sample_u, alpha, mu_m, Lambda_m);\n}\n\n#else\n\nvoid run() {\n auto start = std::chrono::steady_clock::now();\n\n SparseMatrixD Mt = M.transpose();\n\n std::cout << \"Sampling\" << endl;\n for(int i=0; i<nsims; ++i) {\n\n \/\/ Sample from movie hyperparams\n tie(mu_m, Lambda_m) = CondNormalWishart(sample_m, mu0_m, b0_m, WI_m, df_m);\n\n \/\/ Sample from user hyperparams\n tie(mu_u, Lambda_u) = CondNormalWishart(sample_u, mu0_u, b0_u, WI_u, df_u);\n\n#pragma omp parallel for\n for(int mm = 0; mm < M.cols(); ++mm) {\n sample_movie(sample_m, mm, M, mean_rating, sample_u, alpha, mu_m, Lambda_m);\n }\n\n#pragma omp parallel for\n for(int uu = 0; uu < M.rows(); ++uu) {\n sample_movie(sample_u, uu, Mt, mean_rating, sample_m, alpha, mu_u, Lambda_u);\n }\n\n auto eval = eval_probe_vec(sample_m, sample_u, mean_rating);\n double norm_u = sample_u.norm();\n double norm_m = sample_m.norm();\n auto end = std::chrono::steady_clock::now();\n auto elapsed = std::chrono::duration<double>(end - start);\n double samples_per_sec = (i + 1) * (M.rows() + M.cols()) \/ elapsed.count();\n\n printf(\"Iteration %d:\\t num_correct: %3.2f%%\\tavg_diff: %3.2f\\tFU(%6.2f)\\tFM(%6.2f)\\tSamples\/sec: %6.2f\\n\",\n i, 100*eval.first, eval.second, norm_u, norm_m, samples_per_sec);\n }\n}\n\n#endif\n\nint main(int argc, char *argv[])\n{\n assert(argv[1] && argv[2] && \"filename missing\");\n Eigen::initParallel();\n Eigen::setNbThreads(1);\n\n loadMarket(M, argv[1]);\n loadMarket(P, argv[2]);\n\n init();\n#ifdef TEST_SAMPLE\n test();\n#else\n run();\n#endif\n\n return 0;\n}\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 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\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.SetTolerance(tolerance);\n\n\t\/\/\/\/solver.lcp_omega_bilateral = lcp_omega_bilateral; \/\/\/\/ not used anywhere?\n\tsolver.bilateral = &bilateral;\n\tsolver.Initial(step, data_container);\n\n\t\/\/\/\/bilateral.ComputeJacobians(); \/\/\/\/ no-op\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\t\/\/thrust::copy_n(data_container->host_data.gamma_data.begin() + data_container->number_of_rigid_rigid * 6, data_container->number_of_bilaterals, data_container->host_data.gamma_bilateral.begin());\n\t\/\/for (int i = 0; i < data_container->number_of_bilaterals; i++) {\n\t\/\/\tdata_container->host_data.gamma_bilateral[i] *= .5;\n\t\/\/}\n\n\tsolver.ComputeImpulses();\n\n\ttot_iterations = solver.GetIteration();\n\tresidual = solver.GetResidual();\n\n\t\/\/\/\/for (int i = 0; i < solver.iter_hist.size(); i++) {\n\t\/\/\/\/\tAtIterationEnd(solver.maxd_hist[i], solver.maxdeltalambda_hist[i], solver.iter_hist[i]);\n\t\/\/\/\/}\n\n\n}\n\n<commit_msg>Some cleanup related to bilateral constraints.<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\t\/\/ Return now if there are no (bilateral) constraints\n\tif (number_of_constraints == 0)\n\t\treturn;\n\n\tdata_container->host_data.rhs_data.resize(number_of_constraints);\n\tdata_container->host_data.diag.resize(number_of_constraints);\n\tdata_container->host_data.gamma_data.resize(number_of_constraints);\n\n\t\/\/\/\/ TODO: Is this needed? If yes, we should initialize gamma_bilateral anyway...\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(); \/\/\/\/ currently not used\n\tsolver.iter_hist.clear(); \/\/\/\/\n\n\tsolver.SetTolerance(tolerance);\n\n\t\/\/\/\/solver.lcp_omega_bilateral = lcp_omega_bilateral; \/\/\/\/ not used anywhere?\n\tsolver.bilateral = &bilateral;\n\tsolver.Initial(step, data_container);\n\n\t\/\/\/\/bilateral.ComputeJacobians(); \/\/\/\/ no-op\n\tbilateral.ComputeRHS();\n\n\tsolver.SolveStab(data_container->host_data.gamma_bilateral, data_container->host_data.rhs_data, max_iter_bilateral);\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\tsolver.ComputeImpulses();\n\n\ttot_iterations = solver.GetIteration();\n\tresidual = solver.GetResidual();\n\n\t\/\/\/\/for (int i = 0; i < solver.iter_hist.size(); i++) {\n\t\/\/\/\/\tAtIterationEnd(solver.maxd_hist[i], solver.maxdeltalambda_hist[i], solver.iter_hist[i]);\n\t\/\/\/\/}\n\n\n}\n\n<|endoftext|>"} {"text":"<commit_before>\/******************************************************************************\n * Copyright 2017 The Apollo Authors. All Rights Reserved.\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n *****************************************************************************\/\n#include <vector>\n\n#include \"gtest\/gtest.h\"\n#include \"modules\/common\/util\/testdata\/simple.pb.h\"\n\n#include \"modules\/common\/util\/util.h\"\n\nnamespace apollo {\nnamespace common {\nnamespace util {\n\nTEST(Util, MaxElement) {\n EXPECT_EQ(3, MaxElement(std::vector<int>{1, 2, 3}));\n EXPECT_FLOAT_EQ(3.3, MaxElement(std::vector<float>{1.1, 2.2, 3.3}));\n}\n\nTEST(Util, MinElement) {\n EXPECT_EQ(1, MinElement(std::vector<int>{1, 2, 3}));\n EXPECT_FLOAT_EQ(1.1, MinElement(std::vector<float>{1.1, 2.2, 3.3}));\n}\n\nTEST(Util, IsProtoEqual) {\n test::SimpleRepeatedMessage sim1;\n for (int i = 0; i < 10; ++i) {\n auto* t = sim1.add_message();\n t->set_integer(i);\n t->set_text(std::to_string(i));\n }\n auto sim2 = sim1;\n EXPECT_TRUE(IsProtoEqual(sim1, sim2));\n sim2.mutable_message(0)->set_integer(-1);\n EXPECT_FALSE(IsProtoEqual(sim1, sim2));\n}\n\nTEST(Util, DistanceXY) {\n class TestPoint {\n public:\n TestPoint(double x, double y) : x_(x), y_(y) {}\n double x() const { return x_; }\n double y() const { return y_; }\n\n private:\n double x_ = 0.0;\n double y_ = 0.0;\n };\n EXPECT_DOUBLE_EQ(0.0, DistanceXY(TestPoint(0, 0), TestPoint(0, 0)));\n EXPECT_DOUBLE_EQ(1.0, DistanceXY(TestPoint(1, 0), TestPoint(0, 0)));\n EXPECT_DOUBLE_EQ(1.0, DistanceXY(TestPoint(0, 0), TestPoint(1, 0)));\n EXPECT_DOUBLE_EQ(0.0, DistanceXY(TestPoint(1, 0), TestPoint(1, 0)));\n}\n\nTEST(Util, uniform_slice) {\n std::vector<double> result;\n uniform_slice(0.0, 10.0, 3, &result);\n ASSERT_EQ(4, result.size());\n EXPECT_DOUBLE_EQ(0.0, result[0]);\n EXPECT_DOUBLE_EQ(3.3333333, result[1]);\n EXPECT_DOUBLE_EQ(6.6666666, result[2]);\n EXPECT_DOUBLE_EQ(10.0, result[3]);\n\n uniform_slice(0.0, -10.0, 3, &result);\n ASSERT_EQ(4, result.size());\n EXPECT_DOUBLE_EQ(0.0, result[0]);\n EXPECT_DOUBLE_EQ(-3.3333333, result[1]);\n EXPECT_DOUBLE_EQ(-6.6666666, result[2]);\n EXPECT_DOUBLE_EQ(-10.0, result[3]);\n}\n\n} \/\/ namespace util\n} \/\/ namespace common\n} \/\/ namespace apollo\n<commit_msg>common: fix unit test.<commit_after>\/******************************************************************************\n * Copyright 2017 The Apollo Authors. All Rights Reserved.\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n *****************************************************************************\/\n#include <vector>\n\n#include \"gtest\/gtest.h\"\n#include \"modules\/common\/util\/testdata\/simple.pb.h\"\n\n#include \"modules\/common\/util\/util.h\"\n\nnamespace apollo {\nnamespace common {\nnamespace util {\n\nTEST(Util, MaxElement) {\n EXPECT_EQ(3, MaxElement(std::vector<int>{1, 2, 3}));\n EXPECT_FLOAT_EQ(3.3, MaxElement(std::vector<float>{1.1, 2.2, 3.3}));\n}\n\nTEST(Util, MinElement) {\n EXPECT_EQ(1, MinElement(std::vector<int>{1, 2, 3}));\n EXPECT_FLOAT_EQ(1.1, MinElement(std::vector<float>{1.1, 2.2, 3.3}));\n}\n\nTEST(Util, IsProtoEqual) {\n test::SimpleRepeatedMessage sim1;\n for (int i = 0; i < 10; ++i) {\n auto* t = sim1.add_message();\n t->set_integer(i);\n t->set_text(std::to_string(i));\n }\n auto sim2 = sim1;\n EXPECT_TRUE(IsProtoEqual(sim1, sim2));\n sim2.mutable_message(0)->set_integer(-1);\n EXPECT_FALSE(IsProtoEqual(sim1, sim2));\n}\n\nTEST(Util, DistanceXY) {\n class TestPoint {\n public:\n TestPoint(double x, double y) : x_(x), y_(y) {}\n double x() const { return x_; }\n double y() const { return y_; }\n\n private:\n double x_ = 0.0;\n double y_ = 0.0;\n };\n EXPECT_DOUBLE_EQ(0.0, DistanceXY(TestPoint(0, 0), TestPoint(0, 0)));\n EXPECT_DOUBLE_EQ(1.0, DistanceXY(TestPoint(1, 0), TestPoint(0, 0)));\n EXPECT_DOUBLE_EQ(1.0, DistanceXY(TestPoint(0, 0), TestPoint(1, 0)));\n EXPECT_DOUBLE_EQ(0.0, DistanceXY(TestPoint(1, 0), TestPoint(1, 0)));\n}\n\nTEST(Util, uniform_slice) {\n std::vector<double> result;\n uniform_slice(0.0, 10.0, 3, &result);\n ASSERT_EQ(4, result.size());\n EXPECT_DOUBLE_EQ(0.0, result[0]);\n EXPECT_DOUBLE_EQ(3.3333333333333335, result[1]);\n EXPECT_DOUBLE_EQ(6.666666666666667, result[2]);\n EXPECT_DOUBLE_EQ(10.0, result[3]);\n\n uniform_slice(0.0, -10.0, 3, &result);\n ASSERT_EQ(4, result.size());\n EXPECT_DOUBLE_EQ(0.0, result[0]);\n EXPECT_DOUBLE_EQ(-3.3333333333333335, result[1]);\n EXPECT_DOUBLE_EQ(-6.666666666666667, result[2]);\n EXPECT_DOUBLE_EQ(-10.0, result[3]);\n}\n\n} \/\/ namespace util\n} \/\/ namespace common\n} \/\/ namespace apollo\n<|endoftext|>"} {"text":"<commit_before>\/\/ Used for testing, do not use it as an example\n#include <qpp.h>\n#include <experimental\/test.h>\n\/\/ #include <MATLAB\/matlab.h>\nusing namespace qpp;\nusing std::cout;\nusing std::endl;\n\nint main()\n{\n int i = 42;\n std::cout << i++ << std::endl;\n std::cout << i << std::endl;\n}\n<commit_msg>commit<commit_after>\/\/ Used for testing, do not use it as an example\n#include <qpp.h>\n#include <experimental\/test.h>\n\/\/ #include <MATLAB\/matlab.h>\nusing namespace qpp;\nusing std::cout;\nusing std::endl;\n\nint main()\n{\n \n}\n<|endoftext|>"} {"text":"<commit_before>\/\/ Source: http:\/\/www.daniweb.com\/software-development\/cpp\/code\/427500\/calculator-using-shunting-yard-algorithm#\n\/\/ Author: Jesse Brown\n\/\/ Modifications: Brandon Amos\n\n#include <cstdlib>\n#include <iostream>\n#include <sstream>\n#include <stdexcept>\n\n#include \"shunting-yard.h\"\n\nint ShuntingYard::precedence(std::string op) const {\n return op_precedence_[op];\n}\n\nint ShuntingYard::stack_precedence() const { \n if (op_stack_.empty()) {\n return -1;\n }\n return precedence(op_stack_.top());\n}\n\nbool isVariableChar(const char c) {\n return isalpha(c) || c == '_';\n}\n\ntokenQueue_t ShuntingYard::convert(const std::string &infix) {\n const char* token = infix.c_str();\n while (*token) {\n while (*token && isspace(*token)) ++token;\n if (!*token) break;\n\n if (isdigit(*token)) {\n \/\/ If the token is a number, add it to the output queue.\n char* nextToken = 0;\n double digit = strtod(token, &nextToken);\n# ifdef DEBUG\n std::cout << digit << std::endl;\n# endif\n rpn_.push(new Token<double>(digit));\n token = nextToken;\n } else if (isVariableChar(*token)) {\n \/\/ If the function is a variable, resolve it and\n \/\/ add the parsed number to the output queue.\n if (!vars_) {\n std::cerr << \"Error: Detected variable, \" <<\n \"but the variable map is null.\" << std::endl;\n exit(42);\n }\n\n std::stringstream ss;\n ss << *token;\n ++token;\n while (isVariableChar(*token)) {\n ss << *token;\n ++token;\n }\n std::string key = ss.str();\n std::map<std::string, double>::iterator it = vars_->find(key);\n if (it == vars_->end()) {\n std::cerr << \"Error: Unable to find the variable '\" <<\n key << \"'.\" << std::endl;\n exit(42);\n }\n double val = vars_->find(key)->second;\n# ifdef DEBUG\n std::cout << val << std::endl;\n# endif\n rpn_.push(new Token<double>(val));;\n } else {\n \/\/ Otherwise, the variable is an operator or paranthesis.\n switch (*token) {\n case '(':\n op_stack_.push(\"(\");\n ++token;\n break;\n case ')':\n while (op_stack_.top().compare(\"(\")) {\n rpn_.push(new Token<std::string>(op_stack_.top()));\n op_stack_.pop();\n }\n op_stack_.pop();\n ++token;\n break;\n default:\n {\n \/\/ Let p(o) denote the precedence of an operator o.\n \/\/\n \/\/ If the token is an operator, o1, then\n \/\/ While there is an operator token, o2, at the top\n \/\/ and p(o1) <= p(o2), then\n \/\/ pop o2 off the stack onto the output queue.\n \/\/ Push o1 on the stack.\n std::stringstream ss;\n ss << *token;\n ++token;\n while (*token && !isspace(*token) && !isdigit(*token)\n && *token != '(' && *token != ')') {\n ss << *token;\n ++token;\n }\n ss.clear();\n std::string str;\n ss >> str;\n# ifdef DEBUG\n std::cout << str << std::endl;\n# endif\n\n while (!op_stack_.empty() &&\n precedence(str) <= stack_precedence()) {\n rpn_.push(new Token<std::string>(op_stack_.top()));\n op_stack_.pop();\n }\n op_stack_.push(str);\n }\n }\n }\n }\n while (!op_stack_.empty()) {\n rpn_.push(new Token<std::string>(op_stack_.top()));\n op_stack_.pop();\n }\n return rpn_;\n}\n\ntokenQueue_t ShuntingYard::to_rpn() {\n return convert(expr_);\n}\n\nShuntingYard::ShuntingYard (const std::string& infix,\n std::map<std::string, double>* vars) : expr_(infix), vars_(vars) {\n op_precedence_[\"(\"] = -1;\n op_precedence_[\"<<\"] = 1; op_precedence_[\">>\"] = 1;\n op_precedence_[\"+\"] = 2; op_precedence_[\"-\"] = 2;\n op_precedence_[\"*\"] = 3; op_precedence_[\"\/\"] = 3;\n}\n\nvoid calculator::consume(std::string op, std::stack<double>* operands) { \n double right = operands->top(); operands->pop();\n double left = operands->top(); operands->pop();\n if (!op.compare(\"+\")) {\n operands->push(left + right);\n } else if (!op.compare(\"*\")) {\n operands->push(left * right);\n } else if (!op.compare(\"-\")) {\n operands->push(left - right);\n } else if (!op.compare(\"\/\")) {\n operands->push(left \/ right);\n } else if (!op.compare(\"<<\")) {\n operands->push((int) left << (int) right);\n } else if (!op.compare(\">>\")) {\n operands->push((int) left >> (int) right);\n } else {\n throw std::domain_error(\"Unknown operator: '\" + op + \"'.\");\n }\n} \n\ndouble calculator::calculate(const std::string& expr,\n std::map<std::string, double>* vars) { \n ShuntingYard shunting(expr, vars);\n tokenQueue_t rpn = shunting.to_rpn();\n\n std::stack<double> operands;\n while (!rpn.empty()) {\n TokenBase* base = rpn.front();\n rpn.pop();\n\n Token<std::string>* strTok = dynamic_cast<Token<std::string>*>(base);\n if (strTok) {\n consume(strTok->val, &operands);\n delete base;\n continue;\n }\n\n Token<double>* doubleTok = dynamic_cast<Token<double>*>(base);\n if (doubleTok) {\n operands.push(doubleTok->val);\n delete base;\n continue;\n }\n\n std::cerr << \"Invalid token.\" << std::endl;\n exit(42);\n }\n return operands.top();\n}\n<commit_msg>Improve error checking.<commit_after>\/\/ Source: http:\/\/www.daniweb.com\/software-development\/cpp\/code\/427500\/calculator-using-shunting-yard-algorithm#\n\/\/ Author: Jesse Brown\n\/\/ Modifications: Brandon Amos\n\n#include <cstdlib>\n#include <iostream>\n#include <sstream>\n#include <stdexcept>\n\n#include \"shunting-yard.h\"\n\nint ShuntingYard::precedence(std::string op) const {\n return op_precedence_[op];\n}\n\nint ShuntingYard::stack_precedence() const { \n if (op_stack_.empty()) {\n return -1;\n }\n return precedence(op_stack_.top());\n}\n\nbool isVariableChar(const char c) {\n return isalpha(c) || c == '_';\n}\n\ntokenQueue_t ShuntingYard::convert(const std::string &infix) {\n const char* token = infix.c_str();\n while (*token) {\n while (*token && isspace(*token)) ++token;\n if (!*token) break;\n\n if (isdigit(*token)) {\n \/\/ If the token is a number, add it to the output queue.\n char* nextToken = 0;\n double digit = strtod(token, &nextToken);\n# ifdef DEBUG\n std::cout << digit << std::endl;\n# endif\n rpn_.push(new Token<double>(digit));\n token = nextToken;\n } else if (isVariableChar(*token)) {\n \/\/ If the function is a variable, resolve it and\n \/\/ add the parsed number to the output queue.\n if (!vars_) {\n throw std::domain_error(\n \"Detected variable, but the variable map is null.\");\n }\n\n std::stringstream ss;\n ss << *token;\n ++token;\n while (isVariableChar(*token)) {\n ss << *token;\n ++token;\n }\n std::string key = ss.str();\n std::map<std::string, double>::iterator it = vars_->find(key);\n if (it == vars_->end()) {\n throw std::domain_error(\n \"Unable to find the variable '\" + key + \"'.\");\n }\n double val = vars_->find(key)->second;\n# ifdef DEBUG\n std::cout << val << std::endl;\n# endif\n rpn_.push(new Token<double>(val));;\n } else {\n \/\/ Otherwise, the variable is an operator or paranthesis.\n switch (*token) {\n case '(':\n op_stack_.push(\"(\");\n ++token;\n break;\n case ')':\n while (op_stack_.top().compare(\"(\")) {\n rpn_.push(new Token<std::string>(op_stack_.top()));\n op_stack_.pop();\n }\n op_stack_.pop();\n ++token;\n break;\n default:\n {\n \/\/ Let p(o) denote the precedence of an operator o.\n \/\/\n \/\/ If the token is an operator, o1, then\n \/\/ While there is an operator token, o2, at the top\n \/\/ and p(o1) <= p(o2), then\n \/\/ pop o2 off the stack onto the output queue.\n \/\/ Push o1 on the stack.\n std::stringstream ss;\n ss << *token;\n ++token;\n while (*token && !isspace(*token) && !isdigit(*token)\n && *token != '(' && *token != ')') {\n ss << *token;\n ++token;\n }\n ss.clear();\n std::string str;\n ss >> str;\n# ifdef DEBUG\n std::cout << str << std::endl;\n# endif\n\n while (!op_stack_.empty() &&\n precedence(str) <= stack_precedence()) {\n rpn_.push(new Token<std::string>(op_stack_.top()));\n op_stack_.pop();\n }\n op_stack_.push(str);\n }\n }\n }\n }\n while (!op_stack_.empty()) {\n rpn_.push(new Token<std::string>(op_stack_.top()));\n op_stack_.pop();\n }\n return rpn_;\n}\n\ntokenQueue_t ShuntingYard::to_rpn() {\n return convert(expr_);\n}\n\nShuntingYard::ShuntingYard (const std::string& infix,\n std::map<std::string, double>* vars) : expr_(infix), vars_(vars) {\n op_precedence_[\"(\"] = -1;\n op_precedence_[\"<<\"] = 1; op_precedence_[\">>\"] = 1;\n op_precedence_[\"+\"] = 2; op_precedence_[\"-\"] = 2;\n op_precedence_[\"*\"] = 3; op_precedence_[\"\/\"] = 3;\n}\n\nvoid calculator::consume(std::string op, std::stack<double>* operands) { \n if (operands->size() < 2) {\n throw std::domain_error(\"Invalid equation.\");\n }\n double right = operands->top(); operands->pop();\n double left = operands->top(); operands->pop();\n if (!op.compare(\"+\")) {\n operands->push(left + right);\n } else if (!op.compare(\"*\")) {\n operands->push(left * right);\n } else if (!op.compare(\"-\")) {\n operands->push(left - right);\n } else if (!op.compare(\"\/\")) {\n operands->push(left \/ right);\n } else if (!op.compare(\"<<\")) {\n operands->push((int) left << (int) right);\n } else if (!op.compare(\">>\")) {\n operands->push((int) left >> (int) right);\n } else {\n throw std::domain_error(\"Unknown operator: '\" + op + \"'.\");\n }\n} \n\ndouble calculator::calculate(const std::string& expr,\n std::map<std::string, double>* vars) { \n ShuntingYard shunting(expr, vars);\n tokenQueue_t rpn = shunting.to_rpn();\n\n std::stack<double> operands;\n while (!rpn.empty()) {\n TokenBase* base = rpn.front();\n rpn.pop();\n\n Token<std::string>* strTok = dynamic_cast<Token<std::string>*>(base);\n if (strTok) {\n consume(strTok->val, &operands);\n delete base;\n continue;\n }\n\n Token<double>* doubleTok = dynamic_cast<Token<double>*>(base);\n if (doubleTok) {\n operands.push(doubleTok->val);\n delete base;\n continue;\n }\n\n throw std::domain_error(\"Invalid token.\");\n }\n return operands.top();\n}\n<|endoftext|>"} {"text":"<commit_before>\/\/===-- BitWriter.cpp -----------------------------------------------------===\/\/\n\/\/\n\/\/ The LLVM Compiler Infrastructure\n\/\/\n\/\/ This file is distributed under the University of Illinois Open Source\n\/\/ License. See LICENSE.TXT for details.\n\/\/\n\/\/===----------------------------------------------------------------------===\/\/\n\n#include \"llvm-c\/BitWriter.h\"\n#include \"llvm\/Bitcode\/ReaderWriter.h\"\n#include \"llvm\/Support\/raw_ostream.h\"\nusing namespace llvm;\n\n\n\/*===-- Operations on modules ---------------------------------------------===*\/\n\nint LLVMWriteBitcodeToFile(LLVMModuleRef M, const char *Path) {\n std::string ErrorInfo;\n raw_fd_ostream OS(Path, ErrorInfo,\n raw_fd_ostream::F_Binary);\n \n if (!ErrorInfo.empty())\n return -1;\n \n WriteBitcodeToFile(unwrap(M), OS);\n return 0;\n}\n\n#if defined(__GNUC__) && (__GNUC__ > 3 || __GNUC__ == 3 && __GNUC_MINOR >= 4)\n#include <ext\/stdio_filebuf.h>\n\nint LLVMWriteBitcodeToFileHandle(LLVMModuleRef M, int FileHandle) {\n raw_fd_ostream OS(FileHandle, false);\n \n WriteBitcodeToFile(unwrap(M), OS);\n return 0;\n}\n\n#else\n\nint LLVMWriteBitcodeToFileHandle(LLVMModuleRef M, int FileHandle) {\n return -1; \/\/ Not supported.\n}\n\n#endif\n<commit_msg>LLVMWriteBitcodeToFileHandle should work on all architectures now.<commit_after>\/\/===-- BitWriter.cpp -----------------------------------------------------===\/\/\n\/\/\n\/\/ The LLVM Compiler Infrastructure\n\/\/\n\/\/ This file is distributed under the University of Illinois Open Source\n\/\/ License. See LICENSE.TXT for details.\n\/\/\n\/\/===----------------------------------------------------------------------===\/\/\n\n#include \"llvm-c\/BitWriter.h\"\n#include \"llvm\/Bitcode\/ReaderWriter.h\"\n#include \"llvm\/Support\/raw_ostream.h\"\nusing namespace llvm;\n\n\n\/*===-- Operations on modules ---------------------------------------------===*\/\n\nint LLVMWriteBitcodeToFile(LLVMModuleRef M, const char *Path) {\n std::string ErrorInfo;\n raw_fd_ostream OS(Path, ErrorInfo,\n raw_fd_ostream::F_Binary);\n \n if (!ErrorInfo.empty())\n return -1;\n \n WriteBitcodeToFile(unwrap(M), OS);\n return 0;\n}\n\nint LLVMWriteBitcodeToFileHandle(LLVMModuleRef M, int FileHandle) {\n raw_fd_ostream OS(FileHandle, false);\n \n WriteBitcodeToFile(unwrap(M), OS);\n return 0;\n}\n<|endoftext|>"} {"text":"<commit_before>\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\r\n\/\/\r\n\/\/ License Agreement:\r\n\/\/\r\n\/\/ The following are Copyright 2008, Daniel nnerby\r\n\/\/\r\n\/\/ All rights reserved.\r\n\/\/\r\n\/\/ Redistribution and use in source and binary forms, with or without\r\n\/\/ modification, are permitted provided that the following conditions are met:\r\n\/\/\r\n\/\/ * Redistributions of source code must retain the above copyright notice,\r\n\/\/ this list of conditions and the following disclaimer.\r\n\/\/\r\n\/\/ * Redistributions in binary form must reproduce the above copyright\r\n\/\/ notice, this list of conditions and the following disclaimer in the\r\n\/\/ documentation and\/or other materials provided with the distribution.\r\n\/\/\r\n\/\/ * Neither the name of the author nor the names of other contributors may\r\n\/\/ be used to endorse or promote products derived from this software\r\n\/\/ without specific prior written permission.\r\n\/\/\r\n\/\/ THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS \"AS IS\"\r\n\/\/ AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE\r\n\/\/ IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE\r\n\/\/ ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE\r\n\/\/ LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR\r\n\/\/ CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF\r\n\/\/ SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS\r\n\/\/ INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN\r\n\/\/ CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)\r\n\/\/ ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE\r\n\/\/ POSSIBILITY OF SUCH DAMAGE.\r\n\/\/\r\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\r\n\r\n#include \"pch.hpp\"\r\n#include <core\/Library\/LocalDB.h>\r\n#include <core\/Query\/Base.h>\r\n#include <core\/Preferences.h>\r\n\r\n#include <boost\/bind.hpp>\r\n\r\nusing namespace musik::core;\r\n\r\n\r\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\r\n\/\/\/\\brief\r\n\/\/\/Constructor.\r\n\/\/\/\r\n\/\/\/The constructor will not start the Library.\r\n\/\/\/\r\n\/\/\/\\see\r\n\/\/\/Startup\r\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\r\nLibrary::LocalDB::LocalDB(void){\r\n}\r\n\r\nLibrary::LocalDB::~LocalDB(void){\r\n}\r\n\r\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\r\n\/\/\/\\brief\r\n\/\/\/Get a short status string of what is going on in the Library.\r\n\/\/\/\r\n\/\/\/\\returns\r\n\/\/\/Information string.\r\n\/\/\/\r\n\/\/\/The information is mostly used to get the information\r\n\/\/\/about the Indexer.\r\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\r\nutfstring Library::LocalDB::GetInfo(){\r\n return this->indexer.GetStatus();\r\n}\r\n\r\n\r\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\r\n\/\/\/\\brief\r\n\/\/\/Startup the library threads.\r\n\/\/\/\r\n\/\/\/\\returns\r\n\/\/\/True if successfully started. This should always be true. Nothing else is expected.\r\n\/\/\/\r\n\/\/\/Start up the Library like this:\r\n\/\/\/\\code\r\n\/\/\/ \/\/ Create a library\r\n\/\/\/ musik::core::Library::LocalDB library;\r\n\/\/\/ \/\/ Start the library (and indexer that is included)\r\n\/\/\/ library.Startup();\r\n\/\/\/ \/\/ The library is now ready to recieve queries\r\n\/\/\/\\endcode\r\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\r\nbool Library::LocalDB::Startup(){\r\n\r\n \/\/ Start the library thread\r\n this->threads.create_thread(boost::bind(&Library::LocalDB::ThreadLoop,this));\r\n\r\n return true;\r\n}\r\n\r\n\r\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\r\n\/\/\/\\brief\r\n\/\/\/Create all tables, indexes, etc in the database.\r\n\/\/\/\r\n\/\/\/This will assume that the database has been initialized.\r\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\r\nvoid Library::LocalDB::CreateDatabase(){\r\n \/\/ Create the tracks-table\r\n this->db.Execute(\"CREATE TABLE IF NOT EXISTS tracks (\"\r\n \"id INTEGER PRIMARY KEY AUTOINCREMENT,\"\r\n \"track INTEGER DEFAULT 0,\"\r\n \"bpm REAL DEFAULT 0,\"\r\n \"duration INTEGER DEFAULT 0,\"\r\n \"filesize INTEGER DEFAULT 0,\"\r\n \"year INTEGER DEFAULT 0,\"\r\n \"visual_genre_id INTEGER DEFAULT 0,\"\r\n \"visual_artist_id INTEGER DEFAULT 0,\"\r\n \"album_id INTEGER DEFAULT 0,\"\r\n \"folder_id INTEGER DEFAULT 0,\"\r\n \"title TEXT default '',\"\r\n \"filename TEXT default '',\"\r\n \"filetime INTEGER DEFAULT 0,\"\r\n \"thumbnail_id INTEGER DEFAULT 0,\"\r\n \"sort_order1 INTEGER)\");\r\n\r\n \/\/ Create the genres-table\r\n this->db.Execute(\"CREATE TABLE IF NOT EXISTS genres (\"\r\n \"id INTEGER PRIMARY KEY AUTOINCREMENT,\"\r\n \"name TEXT default '',\"\r\n \"aggregated INTEGER DEFAULT 0,\"\r\n \"sort_order INTEGER DEFAULT 0)\");\r\n\r\n this->db.Execute(\"CREATE TABLE IF NOT EXISTS track_genres (\"\r\n \"id INTEGER PRIMARY KEY AUTOINCREMENT,\"\r\n \"track_id INTEGER DEFAULT 0,\"\r\n \"genre_id INTEGER DEFAULT 0)\");\r\n\r\n \/\/ Create the artists-table\r\n this->db.Execute(\"CREATE TABLE IF NOT EXISTS artists (\"\r\n \"id INTEGER PRIMARY KEY AUTOINCREMENT,\"\r\n \"name TEXT default '',\"\r\n \"aggregated INTEGER DEFAULT 0,\"\r\n \"sort_order INTEGER DEFAULT 0)\");\r\n\r\n this->db.Execute(\"CREATE TABLE IF NOT EXISTS track_artists (\"\r\n \"id INTEGER PRIMARY KEY AUTOINCREMENT,\"\r\n \"track_id INTEGER DEFAULT 0,\"\r\n \"artist_id INTEGER DEFAULT 0)\");\r\n\r\n \/\/ Create the meta-tables\r\n this->db.Execute(\"CREATE TABLE IF NOT EXISTS meta_keys (\"\r\n \"id INTEGER PRIMARY KEY AUTOINCREMENT,\"\r\n \"name TEXT)\");\r\n\r\n this->db.Execute(\"CREATE TABLE IF NOT EXISTS meta_values (\"\r\n \"id INTEGER PRIMARY KEY AUTOINCREMENT,\"\r\n \"meta_key_id INTEGER DEFAULT 0,\"\r\n \"sort_order INTEGER DEFAULT 0,\"\r\n \"content TEXT)\");\r\n\r\n this->db.Execute(\"CREATE TABLE IF NOT EXISTS track_meta (\"\r\n \"id INTEGER PRIMARY KEY AUTOINCREMENT,\"\r\n \"track_id INTEGER DEFAULT 0,\"\r\n \"meta_value_id INTEGER DEFAULT 0)\");\r\n\r\n \/\/ Create the albums-table\r\n this->db.Execute(\"CREATE TABLE IF NOT EXISTS albums (\"\r\n \"id INTEGER PRIMARY KEY AUTOINCREMENT,\"\r\n \"name TEXT default '',\"\r\n \"thumbnail_id INTEGER default 0,\"\r\n \"sort_order INTEGER DEFAULT 0)\");\r\n\r\n \/\/ Create the paths-table\r\n this->db.Execute(\"CREATE TABLE IF NOT EXISTS paths (\"\r\n \"id INTEGER PRIMARY KEY AUTOINCREMENT,\"\r\n \"path TEXT default ''\"\r\n \")\");\r\n\r\n \/\/ Create the folders-table\r\n this->db.Execute(\"CREATE TABLE IF NOT EXISTS folders (\"\r\n \"id INTEGER PRIMARY KEY AUTOINCREMENT,\"\r\n \"name TEXT default '',\"\r\n \"fullpath TEXT default '',\"\r\n \"parent_id INTEGER DEFAULT 0,\"\r\n \"path_id INTEGER DEFAULT 0\"\r\n \")\");\r\n\r\n \/\/ Create the folders-table\r\n this->db.Execute(\"CREATE TABLE IF NOT EXISTS thumbnails (\"\r\n \"id INTEGER PRIMARY KEY AUTOINCREMENT,\"\r\n \"filename TEXT default '',\"\r\n \"filesize INTEGER DEFAULT 0,\"\r\n \"checksum INTEGER DEFAULT 0\"\r\n \")\");\r\n\r\n \/\/ Create the playlists-table\r\n this->db.Execute(\"CREATE TABLE IF NOT EXISTS playlists (\"\r\n \"id INTEGER PRIMARY KEY AUTOINCREMENT,\"\r\n \"name TEXT default ''\"\r\n \")\");\r\n \/\/ Create the playlists-table\r\n this->db.Execute(\"CREATE TABLE IF NOT EXISTS playlist_tracks (\"\r\n \"track_id INTEGER DEFAULT 0,\"\r\n \"playlist_id INTEGER DEFAULT 0,\"\r\n \"sort_order INTEGER DEFAULT 0\"\r\n \")\");\r\n\r\n\r\n \/\/ INDEXES\r\n this->db.Execute(\"CREATE UNIQUE INDEX IF NOT EXISTS folders_index ON folders (name,parent_id,path_id)\");\r\n this->db.Execute(\"CREATE UNIQUE INDEX IF NOT EXISTS paths_index ON paths (path)\");\r\n this->db.Execute(\"CREATE INDEX IF NOT EXISTS genre_index ON genres (sort_order)\");\r\n this->db.Execute(\"CREATE INDEX IF NOT EXISTS artist_index ON artists (sort_order)\");\r\n this->db.Execute(\"CREATE INDEX IF NOT EXISTS album_index ON albums (sort_order)\");\r\n this->db.Execute(\"CREATE INDEX IF NOT EXISTS track_index1 ON tracks (album_id,sort_order1)\");\r\n this->db.Execute(\"CREATE INDEX IF NOT EXISTS track_index7 ON tracks (folder_id)\");\r\n this->db.Execute(\"CREATE INDEX IF NOT EXISTS thumbnail_index ON thumbnails (filesize)\");\r\n\r\n this->db.Execute(\"CREATE INDEX IF NOT EXISTS trackgenre_index1 ON track_genres (track_id,genre_id)\");\r\n this->db.Execute(\"CREATE INDEX IF NOT EXISTS trackgenre_index2 ON track_genres (genre_id,track_id)\");\r\n this->db.Execute(\"CREATE INDEX IF NOT EXISTS trackartist_index1 ON track_artists (track_id,artist_id)\");\r\n this->db.Execute(\"CREATE INDEX IF NOT EXISTS trackartist_index2 ON track_artists (artist_id,track_id)\");\r\n this->db.Execute(\"CREATE INDEX IF NOT EXISTS trackmeta_index1 ON track_meta (track_id,meta_value_id)\");\r\n this->db.Execute(\"CREATE INDEX IF NOT EXISTS trackmeta_index2 ON track_meta (meta_value_id,track_id)\");\r\n this->db.Execute(\"CREATE INDEX IF NOT EXISTS metakey_index1 ON meta_keys (name)\");\r\n this->db.Execute(\"CREATE INDEX IF NOT EXISTS metavalues_index1 ON meta_values (meta_key_id)\");\r\n\r\n this->db.Execute(\"CREATE INDEX IF NOT EXISTS playlist_index ON playlist_tracks (playlist_id,sort_order)\");\r\n\r\n this->db.Execute(\"ANALYZE\");\r\n}\r\n\r\n\r\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\r\n\/\/\/\\brief\r\n\/\/\/Main loop the library thread is running in.\r\n\/\/\/\r\n\/\/\/The loop will run until Exit(true) has been called.\r\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\r\nvoid Library::LocalDB::ThreadLoop(){\r\n\r\n Preferences prefs(\"Library\");\r\n\r\n utfstring database(this->GetDBPath());\r\n this->db.Open(database.c_str(),0,prefs.GetInt(\"DatabaseCache\",4096));\r\n\r\n this->CreateDatabase();\r\n\r\n \/\/ Startup the indexer\r\n this->indexer.database = database;\r\n this->indexer.Startup(this->GetLibraryDirectory());\r\n\r\n while(!this->Exit()){\r\n Query::Ptr query(this->GetNextQuery());\r\n\r\n if(query){ \/\/ No empty query\r\n\r\n \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\r\n \/\/ Add to the finished queries\r\n {\r\n boost::mutex::scoped_lock lock(this->libraryMutex);\r\n this->bCurrentQueryCanceled = false;\r\n this->runningQuery = query;\r\n this->outgoingQueries.push_back(query);\r\n\r\n \/\/ Set query as started\r\n query->status |= Query::Base::Status::Started;\r\n }\r\n\r\n \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\r\n \/\/ Lets parse the query\r\n query->ParseQuery(this,this->db);\r\n {\r\n boost::mutex::scoped_lock lock(this->libraryMutex);\r\n this->runningQuery.reset();\r\n \/\/ And set it as finished\r\n query->status |= Query::Base::Status::Ended;\r\n }\r\n\r\n \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\r\n \/\/ Notify that the Query is finished.\r\n this->waitCondition.notify_all();\r\n\r\n }else{\r\n\r\n \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\r\n \/\/ Tricky part, waiting for queries to be added.\r\n \/\/ Not sure I'm doing this the right way.\r\n \/\/ Could this part lead to a deadlock???\r\n boost::mutex::scoped_lock lock(this->libraryMutex);\r\n if(!this->exit && this->incomingQueries.size()==0 ){\r\n this->waitCondition.wait(lock);\r\n }\r\n }\r\n }\r\n\r\n}\r\n\r\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\r\n\/\/\/\\brief\r\n\/\/\/Cancel the current running query\r\n\/\/\/\r\n\/\/\/This method will also send a sqlite3_interrupt to cancel the\r\n\/\/\/current running SQL Query\r\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\r\nvoid Library::LocalDB::CancelCurrentQuery( ){\r\n this->bCurrentQueryCanceled = true;\r\n this->db.Interrupt();\r\n}\r\n\r\nmusik::core::Indexer *Library::LocalDB::Indexer(){\r\n return &this->indexer;\r\n}\r\n\r\n\r\n<commit_msg>Bugfix: Wrong destruction order in Library::LocalDB made Library break when queue was running.<commit_after>\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\r\n\/\/\r\n\/\/ License Agreement:\r\n\/\/\r\n\/\/ The following are Copyright 2008, Daniel nnerby\r\n\/\/\r\n\/\/ All rights reserved.\r\n\/\/\r\n\/\/ Redistribution and use in source and binary forms, with or without\r\n\/\/ modification, are permitted provided that the following conditions are met:\r\n\/\/\r\n\/\/ * Redistributions of source code must retain the above copyright notice,\r\n\/\/ this list of conditions and the following disclaimer.\r\n\/\/\r\n\/\/ * Redistributions in binary form must reproduce the above copyright\r\n\/\/ notice, this list of conditions and the following disclaimer in the\r\n\/\/ documentation and\/or other materials provided with the distribution.\r\n\/\/\r\n\/\/ * Neither the name of the author nor the names of other contributors may\r\n\/\/ be used to endorse or promote products derived from this software\r\n\/\/ without specific prior written permission.\r\n\/\/\r\n\/\/ THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS \"AS IS\"\r\n\/\/ AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE\r\n\/\/ IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE\r\n\/\/ ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE\r\n\/\/ LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR\r\n\/\/ CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF\r\n\/\/ SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS\r\n\/\/ INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN\r\n\/\/ CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)\r\n\/\/ ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE\r\n\/\/ POSSIBILITY OF SUCH DAMAGE.\r\n\/\/\r\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\r\n\r\n#include \"pch.hpp\"\r\n#include <core\/Library\/LocalDB.h>\r\n#include <core\/Query\/Base.h>\r\n#include <core\/Preferences.h>\r\n\r\n#include <boost\/bind.hpp>\r\n\r\nusing namespace musik::core;\r\n\r\n\r\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\r\n\/\/\/\\brief\r\n\/\/\/Constructor.\r\n\/\/\/\r\n\/\/\/The constructor will not start the Library.\r\n\/\/\/\r\n\/\/\/\\see\r\n\/\/\/Startup\r\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\r\nLibrary::LocalDB::LocalDB(void){\r\n}\r\n\r\nLibrary::LocalDB::~LocalDB(void){\r\n this->Exit(true);\r\n this->threads.join_all();\r\n}\r\n\r\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\r\n\/\/\/\\brief\r\n\/\/\/Get a short status string of what is going on in the Library.\r\n\/\/\/\r\n\/\/\/\\returns\r\n\/\/\/Information string.\r\n\/\/\/\r\n\/\/\/The information is mostly used to get the information\r\n\/\/\/about the Indexer.\r\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\r\nutfstring Library::LocalDB::GetInfo(){\r\n return this->indexer.GetStatus();\r\n}\r\n\r\n\r\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\r\n\/\/\/\\brief\r\n\/\/\/Startup the library threads.\r\n\/\/\/\r\n\/\/\/\\returns\r\n\/\/\/True if successfully started. This should always be true. Nothing else is expected.\r\n\/\/\/\r\n\/\/\/Start up the Library like this:\r\n\/\/\/\\code\r\n\/\/\/ \/\/ Create a library\r\n\/\/\/ musik::core::Library::LocalDB library;\r\n\/\/\/ \/\/ Start the library (and indexer that is included)\r\n\/\/\/ library.Startup();\r\n\/\/\/ \/\/ The library is now ready to recieve queries\r\n\/\/\/\\endcode\r\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\r\nbool Library::LocalDB::Startup(){\r\n\r\n \/\/ Start the library thread\r\n this->threads.create_thread(boost::bind(&Library::LocalDB::ThreadLoop,this));\r\n\r\n return true;\r\n}\r\n\r\n\r\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\r\n\/\/\/\\brief\r\n\/\/\/Create all tables, indexes, etc in the database.\r\n\/\/\/\r\n\/\/\/This will assume that the database has been initialized.\r\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\r\nvoid Library::LocalDB::CreateDatabase(){\r\n \/\/ Create the tracks-table\r\n this->db.Execute(\"CREATE TABLE IF NOT EXISTS tracks (\"\r\n \"id INTEGER PRIMARY KEY AUTOINCREMENT,\"\r\n \"track INTEGER DEFAULT 0,\"\r\n \"bpm REAL DEFAULT 0,\"\r\n \"duration INTEGER DEFAULT 0,\"\r\n \"filesize INTEGER DEFAULT 0,\"\r\n \"year INTEGER DEFAULT 0,\"\r\n \"visual_genre_id INTEGER DEFAULT 0,\"\r\n \"visual_artist_id INTEGER DEFAULT 0,\"\r\n \"album_id INTEGER DEFAULT 0,\"\r\n \"folder_id INTEGER DEFAULT 0,\"\r\n \"title TEXT default '',\"\r\n \"filename TEXT default '',\"\r\n \"filetime INTEGER DEFAULT 0,\"\r\n \"thumbnail_id INTEGER DEFAULT 0,\"\r\n \"sort_order1 INTEGER)\");\r\n\r\n \/\/ Create the genres-table\r\n this->db.Execute(\"CREATE TABLE IF NOT EXISTS genres (\"\r\n \"id INTEGER PRIMARY KEY AUTOINCREMENT,\"\r\n \"name TEXT default '',\"\r\n \"aggregated INTEGER DEFAULT 0,\"\r\n \"sort_order INTEGER DEFAULT 0)\");\r\n\r\n this->db.Execute(\"CREATE TABLE IF NOT EXISTS track_genres (\"\r\n \"id INTEGER PRIMARY KEY AUTOINCREMENT,\"\r\n \"track_id INTEGER DEFAULT 0,\"\r\n \"genre_id INTEGER DEFAULT 0)\");\r\n\r\n \/\/ Create the artists-table\r\n this->db.Execute(\"CREATE TABLE IF NOT EXISTS artists (\"\r\n \"id INTEGER PRIMARY KEY AUTOINCREMENT,\"\r\n \"name TEXT default '',\"\r\n \"aggregated INTEGER DEFAULT 0,\"\r\n \"sort_order INTEGER DEFAULT 0)\");\r\n\r\n this->db.Execute(\"CREATE TABLE IF NOT EXISTS track_artists (\"\r\n \"id INTEGER PRIMARY KEY AUTOINCREMENT,\"\r\n \"track_id INTEGER DEFAULT 0,\"\r\n \"artist_id INTEGER DEFAULT 0)\");\r\n\r\n \/\/ Create the meta-tables\r\n this->db.Execute(\"CREATE TABLE IF NOT EXISTS meta_keys (\"\r\n \"id INTEGER PRIMARY KEY AUTOINCREMENT,\"\r\n \"name TEXT)\");\r\n\r\n this->db.Execute(\"CREATE TABLE IF NOT EXISTS meta_values (\"\r\n \"id INTEGER PRIMARY KEY AUTOINCREMENT,\"\r\n \"meta_key_id INTEGER DEFAULT 0,\"\r\n \"sort_order INTEGER DEFAULT 0,\"\r\n \"content TEXT)\");\r\n\r\n this->db.Execute(\"CREATE TABLE IF NOT EXISTS track_meta (\"\r\n \"id INTEGER PRIMARY KEY AUTOINCREMENT,\"\r\n \"track_id INTEGER DEFAULT 0,\"\r\n \"meta_value_id INTEGER DEFAULT 0)\");\r\n\r\n \/\/ Create the albums-table\r\n this->db.Execute(\"CREATE TABLE IF NOT EXISTS albums (\"\r\n \"id INTEGER PRIMARY KEY AUTOINCREMENT,\"\r\n \"name TEXT default '',\"\r\n \"thumbnail_id INTEGER default 0,\"\r\n \"sort_order INTEGER DEFAULT 0)\");\r\n\r\n \/\/ Create the paths-table\r\n this->db.Execute(\"CREATE TABLE IF NOT EXISTS paths (\"\r\n \"id INTEGER PRIMARY KEY AUTOINCREMENT,\"\r\n \"path TEXT default ''\"\r\n \")\");\r\n\r\n \/\/ Create the folders-table\r\n this->db.Execute(\"CREATE TABLE IF NOT EXISTS folders (\"\r\n \"id INTEGER PRIMARY KEY AUTOINCREMENT,\"\r\n \"name TEXT default '',\"\r\n \"fullpath TEXT default '',\"\r\n \"parent_id INTEGER DEFAULT 0,\"\r\n \"path_id INTEGER DEFAULT 0\"\r\n \")\");\r\n\r\n \/\/ Create the folders-table\r\n this->db.Execute(\"CREATE TABLE IF NOT EXISTS thumbnails (\"\r\n \"id INTEGER PRIMARY KEY AUTOINCREMENT,\"\r\n \"filename TEXT default '',\"\r\n \"filesize INTEGER DEFAULT 0,\"\r\n \"checksum INTEGER DEFAULT 0\"\r\n \")\");\r\n\r\n \/\/ Create the playlists-table\r\n this->db.Execute(\"CREATE TABLE IF NOT EXISTS playlists (\"\r\n \"id INTEGER PRIMARY KEY AUTOINCREMENT,\"\r\n \"name TEXT default ''\"\r\n \")\");\r\n \/\/ Create the playlists-table\r\n this->db.Execute(\"CREATE TABLE IF NOT EXISTS playlist_tracks (\"\r\n \"track_id INTEGER DEFAULT 0,\"\r\n \"playlist_id INTEGER DEFAULT 0,\"\r\n \"sort_order INTEGER DEFAULT 0\"\r\n \")\");\r\n\r\n\r\n \/\/ INDEXES\r\n this->db.Execute(\"CREATE UNIQUE INDEX IF NOT EXISTS folders_index ON folders (name,parent_id,path_id)\");\r\n this->db.Execute(\"CREATE UNIQUE INDEX IF NOT EXISTS paths_index ON paths (path)\");\r\n this->db.Execute(\"CREATE INDEX IF NOT EXISTS genre_index ON genres (sort_order)\");\r\n this->db.Execute(\"CREATE INDEX IF NOT EXISTS artist_index ON artists (sort_order)\");\r\n this->db.Execute(\"CREATE INDEX IF NOT EXISTS album_index ON albums (sort_order)\");\r\n this->db.Execute(\"CREATE INDEX IF NOT EXISTS track_index1 ON tracks (album_id,sort_order1)\");\r\n this->db.Execute(\"CREATE INDEX IF NOT EXISTS track_index7 ON tracks (folder_id)\");\r\n this->db.Execute(\"CREATE INDEX IF NOT EXISTS thumbnail_index ON thumbnails (filesize)\");\r\n\r\n this->db.Execute(\"CREATE INDEX IF NOT EXISTS trackgenre_index1 ON track_genres (track_id,genre_id)\");\r\n this->db.Execute(\"CREATE INDEX IF NOT EXISTS trackgenre_index2 ON track_genres (genre_id,track_id)\");\r\n this->db.Execute(\"CREATE INDEX IF NOT EXISTS trackartist_index1 ON track_artists (track_id,artist_id)\");\r\n this->db.Execute(\"CREATE INDEX IF NOT EXISTS trackartist_index2 ON track_artists (artist_id,track_id)\");\r\n this->db.Execute(\"CREATE INDEX IF NOT EXISTS trackmeta_index1 ON track_meta (track_id,meta_value_id)\");\r\n this->db.Execute(\"CREATE INDEX IF NOT EXISTS trackmeta_index2 ON track_meta (meta_value_id,track_id)\");\r\n this->db.Execute(\"CREATE INDEX IF NOT EXISTS metakey_index1 ON meta_keys (name)\");\r\n this->db.Execute(\"CREATE INDEX IF NOT EXISTS metavalues_index1 ON meta_values (meta_key_id)\");\r\n\r\n this->db.Execute(\"CREATE INDEX IF NOT EXISTS playlist_index ON playlist_tracks (playlist_id,sort_order)\");\r\n\r\n this->db.Execute(\"ANALYZE\");\r\n}\r\n\r\n\r\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\r\n\/\/\/\\brief\r\n\/\/\/Main loop the library thread is running in.\r\n\/\/\/\r\n\/\/\/The loop will run until Exit(true) has been called.\r\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\r\nvoid Library::LocalDB::ThreadLoop(){\r\n\r\n Preferences prefs(\"Library\");\r\n\r\n utfstring database(this->GetDBPath());\r\n this->db.Open(database.c_str(),0,prefs.GetInt(\"DatabaseCache\",4096));\r\n\r\n this->CreateDatabase();\r\n\r\n \/\/ Startup the indexer\r\n this->indexer.database = database;\r\n this->indexer.Startup(this->GetLibraryDirectory());\r\n\r\n while(!this->Exit()){\r\n Query::Ptr query(this->GetNextQuery());\r\n\r\n if(query){ \/\/ No empty query\r\n\r\n \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\r\n \/\/ Add to the finished queries\r\n {\r\n boost::mutex::scoped_lock lock(this->libraryMutex);\r\n this->bCurrentQueryCanceled = false;\r\n this->runningQuery = query;\r\n this->outgoingQueries.push_back(query);\r\n\r\n \/\/ Set query as started\r\n query->status |= Query::Base::Status::Started;\r\n }\r\n\r\n \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\r\n \/\/ Lets parse the query\r\n query->ParseQuery(this,this->db);\r\n {\r\n boost::mutex::scoped_lock lock(this->libraryMutex);\r\n this->runningQuery.reset();\r\n \/\/ And set it as finished\r\n query->status |= Query::Base::Status::Ended;\r\n }\r\n\r\n \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\r\n \/\/ Notify that the Query is finished.\r\n this->waitCondition.notify_all();\r\n\r\n }else{\r\n\r\n \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\r\n \/\/ Tricky part, waiting for queries to be added.\r\n \/\/ Not sure I'm doing this the right way.\r\n \/\/ Could this part lead to a deadlock???\r\n boost::mutex::scoped_lock lock(this->libraryMutex);\r\n if(!this->exit && this->incomingQueries.size()==0 ){\r\n this->waitCondition.wait(lock);\r\n }\r\n }\r\n }\r\n\r\n}\r\n\r\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\r\n\/\/\/\\brief\r\n\/\/\/Cancel the current running query\r\n\/\/\/\r\n\/\/\/This method will also send a sqlite3_interrupt to cancel the\r\n\/\/\/current running SQL Query\r\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\r\nvoid Library::LocalDB::CancelCurrentQuery( ){\r\n this->bCurrentQueryCanceled = true;\r\n this->db.Interrupt();\r\n}\r\n\r\nmusik::core::Indexer *Library::LocalDB::Indexer(){\r\n return &this->indexer;\r\n}\r\n\r\n\r\n<|endoftext|>"} {"text":"<commit_before>\n#pragma once\n\n\n#include <reflectionzeug\/property\/PropertyGroup.h>\n\n\nnamespace reflectionzeug\n{\n\n\ntemplate <typename Type, typename... Args>\nProperty<Type> * PropertyGroup::addProperty(const std::string & name, Args&&... args)\n{\n \/\/ Create new property\n auto property = new Property<Type>(name, std::forward<Args>(args)...);\n if (this->addProperty(property))\n {\n return property;\n }\n\n \/\/ Error, delete property and return\n delete property;\n return nullptr;\n}\n\ntemplate <typename Type>\nType PropertyGroup::value(const std::string & path) const\n{\n \/\/ Get property by path\n const AbstractProperty * property = this->property(path);\n if (!property) {\n return nullptr;\n }\n\n \/\/ Convert into requested type\n Property<Type> * typed = property->as<Property<Type>>();\n if (!typed) {\n return nullptr;\n }\n\n \/\/ Get value\n return typed->value();\n}\n\ntemplate <typename Type>\nvoid PropertyGroup::setValue(const std::string & path, const Type & value)\n{\n \/\/ Get property by path\n const AbstractProperty * property = this->property(path);\n if (!property) {\n return;\n }\n\n \/\/ Convert into requested type\n Property<Type> * typed = property->as<Property<Type>>();\n if (!typed) {\n return;\n }\n\n \/\/ Set value\n typed->setValue(value);\n}\n\n\n} \/\/ namespace reflectionzeug\n<commit_msg>Add Property.h include, remove const qualifier for AbstractProperty in PropertyGroup.hpp<commit_after>\n#pragma once\n\n\n#include <reflectionzeug\/property\/PropertyGroup.h>\n#include <reflectionzeug\/property\/Property.h>\n\n\nnamespace reflectionzeug\n{\n\n\ntemplate <typename Type, typename... Args>\nProperty<Type> * PropertyGroup::addProperty(const std::string & name, Args&&... args)\n{\n \/\/ Create new property\n auto property = new Property<Type>(name, std::forward<Args>(args)...);\n if (this->addProperty(property))\n {\n return property;\n }\n\n \/\/ Error, delete property and return\n delete property;\n return nullptr;\n}\n\ntemplate <typename Type>\nType PropertyGroup::value(const std::string & path) const\n{\n \/\/ Get property by path\n AbstractProperty * property = this->property(path);\n if (!property) {\n return nullptr;\n }\n\n \/\/ Convert into requested type\n Property<Type> * typed = property->as<Property<Type>>();\n if (!typed) {\n return nullptr;\n }\n\n \/\/ Get value\n return typed->value();\n}\n\ntemplate <typename Type>\nvoid PropertyGroup::setValue(const std::string & path, const Type & value)\n{\n \/\/ Get property by path\n AbstractProperty * property = this->property(path);\n if (!property) {\n return;\n }\n\n \/\/ Convert into requested type\n Property<Type> * typed = property->as<Property<Type>>();\n if (!typed) {\n return;\n }\n\n \/\/ Set value\n typed->setValue(value);\n}\n\n\n} \/\/ namespace reflectionzeug\n<|endoftext|>"} {"text":"<commit_before>#ifndef LUABIND_CRTP_ITERATOR_HPP_INCLUDED\n#define LUABIND_CRTP_ITERATOR_HPP_INCLUDED\n#include <iterator>\n\nnamespace luabind {\n\tnamespace detail {\n\n\t\ttemplate< typename CRTP, typename Category, typename ValueType, typename ReferenceType = ValueType&, typename DifferenceType = ptrdiff_t >\n\t\tclass crtp_iterator :\n\t\t\tpublic std::iterator<Category, ValueType, DifferenceType, ValueType*, ReferenceType >\n\t\t{\n\t\tpublic:\n\t\t\tusing base_type = std::iterator<Category, ValueType, DifferenceType, ValueType*, ReferenceType >;\n\n\n\t\t\tCRTP& operator++()\n\t\t\t{ \n\t\t\t\tupcast().increment();\n\t\t\t\treturn upcast();\n\t\t\t}\n\n\t\t\tCRTP operator++(int)\n\t\t\t{ \n\t\t\t\tCRTP tmp(*this);\n\t\t\t\tupcast().increment();\n\t\t\t\treturn tmp; \n\t\t\t}\n\n\t\t\tbool operator==(const CRTP& rhs)\n\t\t\t{\n\t\t\t\treturn upcast().equal(rhs);\n\t\t\t}\n\n\t\t\tbool operator!=(const CRTP& rhs)\n\t\t\t{\n\t\t\t\treturn !upcast().equal(rhs);\n\t\t\t}\n\t\t\t\n\t\t\ttypename base_type::reference operator*()\n\t\t\t{\n\t\t\t\treturn upcast().dereference();\n\t\t\t}\n\n\t\t\ttypename base_type::reference operator->()\n\t\t\t{\n\t\t\t\treturn upcast().dereference();\n\t\t\t}\n\n\t\tprivate:\n\t\t\tCRTP& upcast() { return static_cast<CRTP&>(*this); }\n\t\t\tconst CRTP& upcast() const { return static_cast<const CRTP&>(*this); }\n\t\t};\n\n\t}\n}\n\n\n\n\n\n\n#endif\n\n<commit_msg>fixed iterator post-increment<commit_after>#ifndef LUABIND_CRTP_ITERATOR_HPP_INCLUDED\n#define LUABIND_CRTP_ITERATOR_HPP_INCLUDED\n#include <iterator>\n\nnamespace luabind {\n\tnamespace detail {\n\n\t\ttemplate< typename CRTP, typename Category, typename ValueType, typename ReferenceType = ValueType&, typename DifferenceType = ptrdiff_t >\n\t\tclass crtp_iterator :\n\t\t\tpublic std::iterator<Category, ValueType, DifferenceType, ValueType*, ReferenceType >\n\t\t{\n\t\tpublic:\n\t\t\tusing base_type = std::iterator<Category, ValueType, DifferenceType, ValueType*, ReferenceType >;\n\n\n\t\t\tCRTP& operator++()\n\t\t\t{ \n\t\t\t\tupcast().increment();\n\t\t\t\treturn upcast();\n\t\t\t}\n\n\t\t\tCRTP operator++(int)\n\t\t\t{ \n\t\t\t\tCRTP tmp(upcast());\n\t\t\t\tupcast().increment();\n\t\t\t\treturn tmp; \n\t\t\t}\n\n\t\t\tbool operator==(const CRTP& rhs)\n\t\t\t{\n\t\t\t\treturn upcast().equal(rhs);\n\t\t\t}\n\n\t\t\tbool operator!=(const CRTP& rhs)\n\t\t\t{\n\t\t\t\treturn !upcast().equal(rhs);\n\t\t\t}\n\t\t\t\n\t\t\ttypename base_type::reference operator*()\n\t\t\t{\n\t\t\t\treturn upcast().dereference();\n\t\t\t}\n\n\t\t\ttypename base_type::reference operator->()\n\t\t\t{\n\t\t\t\treturn upcast().dereference();\n\t\t\t}\n\n\t\tprivate:\n\t\t\tCRTP& upcast() { return static_cast<CRTP&>(*this); }\n\t\t\tconst CRTP& upcast() const { return static_cast<const CRTP&>(*this); }\n\t\t};\n\n\t}\n}\n\n\n\n\n\n\n#endif\n\n<|endoftext|>"} {"text":"<commit_before>\/****************************************************************************\n *\n * Copyright (c) 2016 - 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#include <drivers\/linux_gpio\/linux_gpio.h>\n#include <px4_posix.h>\n#include <sys\/types.h>\n#include <sys\/stat.h>\n#include <fcntl.h>\n\n#define PIN_INDEX_BUFFER_MAX (16)\n#define PIN_DIRECTION_BUFFER_MAX (30 + PIN_INDEX_BUFFER_MAX)\n#define PIN_VALUE_BUFFER_MAX (26 + PIN_INDEX_BUFFER_MAX)\n\nLinuxGPIO::LinuxGPIO(unsigned int pin)\n\t: _pin(pin)\n{\n}\n\nint LinuxGPIO::exportPin()\n{\n\treturn LinuxGPIO::_exportPin(_pin);\n}\n\nint LinuxGPIO::unexportPin()\n{\n\treturn LinuxGPIO::_unexportPin(_pin);\n}\n\nint LinuxGPIO::setDirection(LinuxGPIO::Direction dir)\n{\n\treturn LinuxGPIO::_setDirection(_pin, (int)dir);\n}\n\nint LinuxGPIO::readValue()\n{\n\treturn LinuxGPIO::_readValue(_pin);\n}\n\nint LinuxGPIO::writeValue(LinuxGPIO::Value value)\n{\n\treturn LinuxGPIO::_writeValue(_pin, (unsigned int)value);\n}\n\nint LinuxGPIO::_exportPin(unsigned int pin)\n{\n\tchar pinIndex[PIN_INDEX_BUFFER_MAX];\n\tint fd;\n\tint ret;\n\tint bytes_to_write;\n\n\tfd = open(\"\/sys\/class\/gpio\/export\", O_WRONLY);\n\n\tif (fd == -1) {\n\t\tint err = errno;\n\t\tPX4_ERR(\"export failed: open: %s (%d)\", strerror(err), err);\n\t\treturn -1;\n\t}\n\n\tbytes_to_write = snprintf(pinIndex, PIN_INDEX_BUFFER_MAX, \"%u\", pin);\n\tret = write(fd, pinIndex, bytes_to_write);\n\n\tif (ret == -1) {\n\t\tint err = errno;\n\t\tPX4_ERR(\"export failed: write: %s (%d)\", strerror(err), err);\n\t\tgoto cleanup;\n\n\t} else if (ret != bytes_to_write) {\n\t\tPX4_ERR(\"failed to write: incomplete %d != %d\", ret, bytes_to_write);\n\t\tgoto cleanup;\n\t}\n\n\tret = 0;\n\ncleanup:\n\tclose(fd);\n\n\treturn ret;\n}\n\nint LinuxGPIO::_unexportPin(unsigned int pin)\n{\n\tchar pinIndex[PIN_INDEX_BUFFER_MAX];\n\tint fd;\n\tint ret;\n\tint bytes_to_write;\n\n\tfd = open(\"\/sys\/class\/gpio\/unexport\", O_WRONLY);\n\n\tif (fd == -1) {\n\t\tint err = errno;\n\t\tPX4_ERR(\"unexport %u: open: %s (%d)\", pin, strerror(err), err);\n\t\treturn -1;\n\t}\n\n\tbytes_to_write = snprintf(pinIndex, PIN_INDEX_BUFFER_MAX, \"%u\", pin);\n\tret = write(fd, pinIndex, bytes_to_write);\n\n\tif (ret == -1) {\n\t\tint err = errno;\n\t\tPX4_ERR(\"unexport %u: write: %s (%d)\", pin, strerror(err), err);\n\t\tgoto cleanup;\n\n\t} else if (ret != bytes_to_write) {\n\t\tPX4_ERR(\"unexport %u: write incomplete %d != %d\", pin, ret, bytes_to_write);\n\t\tgoto cleanup;\n\t}\n\n\tret = 0;\n\ncleanup:\n\tclose(fd);\n\n\treturn ret;\n}\n\nint LinuxGPIO::_setDirection(unsigned int pin, int dir)\n{\n\tchar path[PIN_DIRECTION_BUFFER_MAX];\n\tint fd;\n\tint ret;\n\n\tsnprintf(path, PIN_DIRECTION_BUFFER_MAX, \"\/sys\/class\/gpio\/gpio%d\/direction\", pin);\n\tfd = open(path, O_WRONLY);\n\n\tif (fd == -1) {\n\t\tint err = errno;\n\t\tPX4_ERR(\"dir %u: open: %s (%d)\", pin, strerror(err), err);\n\t\treturn -1;\n\t}\n\n\tif (dir == 0) {\n\t\tret = write(fd, \"in\", 2);\n\n\t} else {\n\t\tret = write(fd, \"out\", 3);\n\t}\n\n\tif (ret == -1) {\n\t\tint err = errno;\n\t\tPX4_ERR(\"dir %u: write: %s (%d)\", pin, strerror(err), err);\n\t\tgoto cleanup;\n\t}\n\n\tret = 0;\n\ncleanup:\n\tclose(fd);\n\n\treturn ret;\n}\n\nint LinuxGPIO::_readValue(int pin)\n{\n\tchar path[PIN_VALUE_BUFFER_MAX];\n\tchar buf[2];\n\tint fd;\n\tint ret;\n\n\tsnprintf(path, PIN_VALUE_BUFFER_MAX, \"\/sys\/class\/gpio\/gpio%d\/value\", pin);\n\tfd = open(path, O_RDONLY);\n\n\tif (fd == -1) {\n\t\tint err = errno;\n\t\tPX4_ERR(\"read %u: open: %s (%d)\", pin, strerror(err), err);\n\t\treturn -1;\n\t}\n\n\tret = read(fd, buf, sizeof(buf));\n\n\tif (ret == -1) {\n\t\tint err = errno;\n\t\tPX4_ERR(\"read %u: write: %s (%d)\", pin, strerror(err), err);\n\t\tgoto cleanup;\n\t}\n\n\tret = 0;\n\n\tret = strtol(buf, nullptr, 10);\n\ncleanup:\n\tclose(fd);\n\n\treturn ret;\n}\n\nint LinuxGPIO::_writeValue(int pin, unsigned int value)\n{\n\tchar path[PIN_VALUE_BUFFER_MAX];\n\tchar buf[2];\n\tint fd;\n\tint ret;\n\n\tif (value != (unsigned int)Value::LOW && value != (unsigned int)Value::HIGH) {\n\t\treturn -EINVAL;\n\t}\n\n\tsnprintf(path, PIN_VALUE_BUFFER_MAX, \"\/sys\/class\/gpio\/gpio%d\/value\", pin);\n\tfd = open(path, O_WRONLY);\n\n\tif (fd == -1) {\n\t\tint err = errno;\n\t\tPX4_ERR(\"set %u: open: %s (%d)\", pin, strerror(err), err);\n\t\treturn -1;\n\t}\n\n\tint buflen = snprintf(buf, sizeof(buf), \"%u\", value);\n\n\tret = write(fd, buf, buflen);\n\n\tif (ret == -1) {\n\t\tint err = errno;\n\t\tPX4_ERR(\"set %u: write: %s (%d)\", pin, strerror(err), err);\n\t\tgoto cleanup;\n\t}\n\n\tret = 0;\n\ncleanup:\n\tclose(fd);\n\n\treturn ret;\n}\n\n<commit_msg>linux_gpio: check if pin is already exported<commit_after>\/****************************************************************************\n *\n * Copyright (c) 2016 - 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#include <drivers\/linux_gpio\/linux_gpio.h>\n#include <px4_posix.h>\n#include <sys\/types.h>\n#include <sys\/stat.h>\n#include <fcntl.h>\n\n#define PIN_INDEX_BUFFER_MAX (16)\n#define PIN_DIRECTION_BUFFER_MAX (30 + PIN_INDEX_BUFFER_MAX)\n#define PIN_VALUE_BUFFER_MAX (26 + PIN_INDEX_BUFFER_MAX)\n\nLinuxGPIO::LinuxGPIO(unsigned int pin)\n\t: _pin(pin)\n{\n}\n\nint LinuxGPIO::exportPin()\n{\n\treturn LinuxGPIO::_exportPin(_pin);\n}\n\nint LinuxGPIO::unexportPin()\n{\n\treturn LinuxGPIO::_unexportPin(_pin);\n}\n\nint LinuxGPIO::setDirection(LinuxGPIO::Direction dir)\n{\n\treturn LinuxGPIO::_setDirection(_pin, (int)dir);\n}\n\nint LinuxGPIO::readValue()\n{\n\treturn LinuxGPIO::_readValue(_pin);\n}\n\nint LinuxGPIO::writeValue(LinuxGPIO::Value value)\n{\n\treturn LinuxGPIO::_writeValue(_pin, (unsigned int)value);\n}\n\nint LinuxGPIO::_exportPin(unsigned int pin)\n{\n\tchar pinIndex[PIN_INDEX_BUFFER_MAX];\n\tint fd;\n\tint ret;\n\tint bytes_to_write;\n\n\tif (_readValue(pin) != -1) {\n\t\t\/* GPIO is already exported *\/\n\t\treturn 0;\n\t}\n\n\tfd = open(\"\/sys\/class\/gpio\/export\", O_WRONLY);\n\n\tif (fd == -1) {\n\t\tint err = errno;\n\t\tPX4_ERR(\"export failed: open: %s (%d)\", strerror(err), err);\n\t\treturn -1;\n\t}\n\n\tbytes_to_write = snprintf(pinIndex, PIN_INDEX_BUFFER_MAX, \"%u\", pin);\n\tret = write(fd, pinIndex, bytes_to_write);\n\n\tif (ret == -1) {\n\t\tint err = errno;\n\t\tPX4_ERR(\"export failed: write: %s (%d)\", strerror(err), err);\n\t\tgoto cleanup;\n\n\t} else if (ret != bytes_to_write) {\n\t\tPX4_ERR(\"failed to write: incomplete %d != %d\", ret, bytes_to_write);\n\t\tgoto cleanup;\n\t}\n\n\tret = 0;\n\ncleanup:\n\tclose(fd);\n\n\treturn ret;\n}\n\nint LinuxGPIO::_unexportPin(unsigned int pin)\n{\n\tchar pinIndex[PIN_INDEX_BUFFER_MAX];\n\tint fd;\n\tint ret;\n\tint bytes_to_write;\n\n\tfd = open(\"\/sys\/class\/gpio\/unexport\", O_WRONLY);\n\n\tif (fd == -1) {\n\t\tint err = errno;\n\t\tPX4_ERR(\"unexport %u: open: %s (%d)\", pin, strerror(err), err);\n\t\treturn -1;\n\t}\n\n\tbytes_to_write = snprintf(pinIndex, PIN_INDEX_BUFFER_MAX, \"%u\", pin);\n\tret = write(fd, pinIndex, bytes_to_write);\n\n\tif (ret == -1) {\n\t\tint err = errno;\n\t\tPX4_ERR(\"unexport %u: write: %s (%d)\", pin, strerror(err), err);\n\t\tgoto cleanup;\n\n\t} else if (ret != bytes_to_write) {\n\t\tPX4_ERR(\"unexport %u: write incomplete %d != %d\", pin, ret, bytes_to_write);\n\t\tgoto cleanup;\n\t}\n\n\tret = 0;\n\ncleanup:\n\tclose(fd);\n\n\treturn ret;\n}\n\nint LinuxGPIO::_setDirection(unsigned int pin, int dir)\n{\n\tchar path[PIN_DIRECTION_BUFFER_MAX];\n\tint fd;\n\tint ret;\n\n\tsnprintf(path, PIN_DIRECTION_BUFFER_MAX, \"\/sys\/class\/gpio\/gpio%d\/direction\", pin);\n\tfd = open(path, O_WRONLY);\n\n\tif (fd == -1) {\n\t\tint err = errno;\n\t\tPX4_ERR(\"dir %u: open: %s (%d)\", pin, strerror(err), err);\n\t\treturn -1;\n\t}\n\n\tif (dir == 0) {\n\t\tret = write(fd, \"in\", 2);\n\n\t} else {\n\t\tret = write(fd, \"out\", 3);\n\t}\n\n\tif (ret == -1) {\n\t\tint err = errno;\n\t\tPX4_ERR(\"dir %u: write: %s (%d)\", pin, strerror(err), err);\n\t\tgoto cleanup;\n\t}\n\n\tret = 0;\n\ncleanup:\n\tclose(fd);\n\n\treturn ret;\n}\n\nint LinuxGPIO::_readValue(int pin)\n{\n\tchar path[PIN_VALUE_BUFFER_MAX];\n\tchar buf[2];\n\tint fd;\n\tint ret;\n\n\tsnprintf(path, PIN_VALUE_BUFFER_MAX, \"\/sys\/class\/gpio\/gpio%d\/value\", pin);\n\tfd = open(path, O_RDONLY);\n\n\tif (fd == -1) {\n\t\tint err = errno;\n\t\tPX4_ERR(\"read %u: open: %s (%d)\", pin, strerror(err), err);\n\t\treturn -1;\n\t}\n\n\tret = read(fd, buf, sizeof(buf));\n\n\tif (ret == -1) {\n\t\tint err = errno;\n\t\tPX4_ERR(\"read %u: write: %s (%d)\", pin, strerror(err), err);\n\t\tgoto cleanup;\n\t}\n\n\tret = 0;\n\n\tret = strtol(buf, nullptr, 10);\n\ncleanup:\n\tclose(fd);\n\n\treturn ret;\n}\n\nint LinuxGPIO::_writeValue(int pin, unsigned int value)\n{\n\tchar path[PIN_VALUE_BUFFER_MAX];\n\tchar buf[2];\n\tint fd;\n\tint ret;\n\n\tif (value != (unsigned int)Value::LOW && value != (unsigned int)Value::HIGH) {\n\t\treturn -EINVAL;\n\t}\n\n\tsnprintf(path, PIN_VALUE_BUFFER_MAX, \"\/sys\/class\/gpio\/gpio%d\/value\", pin);\n\tfd = open(path, O_WRONLY);\n\n\tif (fd == -1) {\n\t\tint err = errno;\n\t\tPX4_ERR(\"set %u: open: %s (%d)\", pin, strerror(err), err);\n\t\treturn -1;\n\t}\n\n\tint buflen = snprintf(buf, sizeof(buf), \"%u\", value);\n\n\tret = write(fd, buf, buflen);\n\n\tif (ret == -1) {\n\t\tint err = errno;\n\t\tPX4_ERR(\"set %u: write: %s (%d)\", pin, strerror(err), err);\n\t\tgoto cleanup;\n\t}\n\n\tret = 0;\n\ncleanup:\n\tclose(fd);\n\n\treturn ret;\n}\n\n<|endoftext|>"} {"text":"<commit_before>\/\/ ================================================================================================\n\/\/ Shadowrect.cpp\n\/\/\n\/\/ Copyright (C) 2001 Herf Consulting LLC. All rights reserved.\n\/\/\n\/\/ Please do not redistribute this source code.\n\/\/\n\/\/\t This source is provided \"as-is,\" and Herf Consulting LLC will not be liable\n\/\/ for any damages resulting from its use or misuse.\n\/\/\n\/\/ ================================================================================================\n\n#include <stdio.h>\n#include <stdlib.h>\n\n#pragma warning(disable: 4244)\n\n\ntypedef unsigned long uint32;\ntypedef long int32;\ntypedef float real32;\ntypedef unsigned char uint8;\n\n\/\/ Globals (ack)\nuint32 bg = 0xFFFFFF;\nreal32 srad = 5.1f;\nuint32 opac = 153;\nuint8 *sprof = NULL;\nuint8 *rgbbuf = NULL;\nuint32 sprofsize = 0;\n\n\/\/ shadow offsets in bitmap space\nint32 xoff = 2;\nint32 yoff = 3;\n\n\/\/ offsets from bitmap to output space\nint32 xbitmap = 0, ybitmap = 0;\n\n\/\/ size of bitmap\nint32 width, height;\n\n\/\/ size of output\nint32 outwidth, outheight;\n\n\/\/ output state\nint32 outputY = 0;\n\nint32 topql, topqt, topqr, topqb;\n\nFILE *in = stdin;\n\n\/\/ ================================================================================================\n\/\/ approximation to the gaussian integral [x, infty]\n\/\/ ================================================================================================\nstatic inline real32 gi(real32 x)\n{\n\tconst real32 i6 = 1.f \/ 6.0f;\n\tconst real32 i4 = 1.f \/ 4.0f;\n\tconst real32 i3 = 1.f \/ 3.0f;\n\n\tif (x > 1.5f) return 0.0f;\n\tif (x < -1.5f) return 1.0f;\n\n\treal32 x2 = x * x;\n\treal32 x3 = x2 * x;\n\n\tif (x > 0.5) return .5625 - ( x3 * i6 - 3 * x2 * i4 + 1.125 * x);\n\tif (x > -0.5) return 0.5 - (0.75 * x - x3 * i3);\n\t\t\t\t return 0.4375 + (-x3 * i6 - 3 * x2 * i4 - 1.125 * x);\n}\n\nstatic int32 UpdateProfile()\n{\n\tint32 size = srad * 3 + 1;\n\tint32 c = size >> 1;\n\n\tsprof = new uint8[size];\n\tsprofsize = size;\n\tif (sprof == NULL) return -1;\n\n\treal32 invr = 1.f \/ srad;\n\tfor (int32 x = 1; x < size; x ++) {\n\t\treal32 xp = (c - x) * invr;\n\t\treal32 gint = gi(xp);\n\t\tsprof[x] = 255 - int32(255.f * gint);\n\t}\n\t\/\/ unstable here!\n\tsprof[0] = 255;\n\n\treturn 0;\n}\n\nchar line[2048];\nstatic char GetLine() {\n\tif (fgets(line, 2048, in)) {\n\t\treturn line[0];\n\t} else {\n\t\treturn 0;\n\t}\n}\n\nstatic int32 Initialize() \n{\n\tuint32 ignoreme;\n\n\t\/\/ try to parse PPM\n\tGetLine();\tif (line[0] != 'P' || line[1] != '6') return -1;\n\twhile (GetLine() == '#') {}\n\tif (sscanf(line, \"%d %d\\n\", &width, &height) != 2) return -1;\n\twhile (GetLine() == '#') {}\n\tif (sscanf(line, \"%d\\n\", &ignoreme) != 1) return -1;\n\tif (ignoreme != 255) return -1;\n\n\trgbbuf = new uint8[width * 3];\n\tif (!rgbbuf) return -1;\n\n\t\/\/ setup shadow based on width, height\n\tint32 sl = int(-srad * 1.5) + xoff;\n\tint32 sr = int( srad * 1.5 + width + 0.9999) + xoff;\n\tint32 st = int(-srad * 1.5) + yoff;\n\tint32 sb = int( srad * 1.5 + height + 0.9999) + yoff;\n\n\tif (sl < 0) {\n\t\txbitmap = -sl;\n\t\tsr += xbitmap;\n\t\tsl = 0;\n\t}\n\tif (st < 0) {\n\t\tybitmap = -st;\n\t\tsb += ybitmap;\n\t\tst = 0;\n\t}\n\n\tint32 maxx = sr - sl;\n\tint32 maxy = sb - st;\n\tint32 bitx = width + xbitmap;\n\tint32 bity = height + ybitmap;\n\n\tif (bitx > maxx) maxx = bitx;\n\tif (bity > maxy) maxy = bity;\n\n\toutwidth = maxx;\n\toutheight = maxy;\n\n\tprintf(\"P6\\n# Not created by the GIMP\\n%d %d\\n255\\n\", outwidth, outheight);\n\n\t\/\/ find top quadrant of shadow * 2 (.1 fixed point)\n\ttopql = xoff + xbitmap;\n\ttopqr = width + xoff + xbitmap;\n\ttopqt = yoff + ybitmap;\n\ttopqb = height + yoff + ybitmap;\n\n\ttopqb = topqt + topqb;\n\ttopqt += topqt;\n\n\ttopqr = topql + topqr;\n\ttopql += topql;\n\n\t\/\/ we've computed xbitmap, ybitmap, outwidth, outheight\n\treturn UpdateProfile();\n}\n\n\/\/ ================================================================================================\n\/\/ multiply with black\n\/\/ ================================================================================================\nstatic inline void PixelDarken(uint32 &d, const uint32 amt)\n{\n\tuint32 rb = d & 0xFF00FF;\n\tuint32 g = d & 0x00FF00;\n\td &= 0xFF000000;\n\n\trb = rb * amt & 0xFF00FF00;\n\tg = g * amt & 0x00FF0000;\n\n\trb |= g;\n\td |= (rb >> 8);\n}\n\n\/\/ scan from x0 to x1 using outputY as the scanline\nint32 ScanAbs(int32 x0, int32 x1)\n{\n\tif (x1 <= x0) return 0;\n\n\tint32 maxi = sprofsize - 1;\n\n\tint32 filll2 = x0 * 2;\n\tint32 fillr2 = x1 * 2;\n\n\tint32 center = (sprofsize & ~1) - 1;\/\/(sprof.Used() & ~1) - 1;\n\n\tint32 w = topqr - topql - center;\n\tint32 h = topqb - topqt - center;\n\n\t\/\/ scan\n\tint32 y = outputY;\n\n\tint32 dy = abs(y * 2 - topqb) - h;\n\tint32 oy = dy >> 1;\n\tif (oy < 0) oy = 0;\n\t\n\tuint32 sh0 = sprof[oy];\n\n\tsh0 = sh0 * opac >> 8;\n\n\t\/\/uint32 *dp0 = dst.Pixel(x0, y);\n\tfor (int32 x = filll2; x < fillr2; x += 2) {\n\n\t\tint32 dx = abs(x - topqr) - w;\n\t\tint32 ox = dx >> 1;\n\t\tif (ox < 0) ox = 0;\n\n\t\tuint32 sh = 256 - ((sprof[ox]) * sh0 >> 8);\n\t\t\/\/uint32 sh = (sprof[ox]) * sh0 >> 8;\n\t\t\n\t\tuint32 dst = bg;\n\t\tPixelDarken(dst, sh);\n\t\tputchar(dst >> 16 & 0xFF);\n\t\tputchar(dst >> 8 & 0xFF);\n\t\tputchar(dst & 0xFF);\n\t}\n\n\treturn 0;\n}\n\nstatic int32 ProcessLine()\n{\n\t\/\/ write a line for \"outputY\"\n\tif (outputY < ybitmap || outputY >= (ybitmap + height)) {\n\t\t\/\/ \"write\"\n\t\t\/\/ write a whole line of shadow\n\t\tScanAbs(0, outwidth);\n\t} else {\n\t\t\/\/ \"read-write\"\n\t\t\/\/ clip and write a line of the input bitmap\n\t\tScanAbs(0, xbitmap);\n\n\t\t\/\/ in case read fails, fill buffer with bg color\n\t\tuint8 *rgb = rgbbuf;\n\t\tfor (int32 i = 0; i < width; i++) {\n\t\t\trgb[0] = bg >> 16 & 0xFF;\n\t\t\trgb[1] = bg >> 8 & 0xFF;\n\t\t\trgb[2] = bg & 0xFF;\n\t\t\trgb += 3;\n\t\t}\n\t\tfread(rgbbuf, 3, width, in);\n\t\tfwrite(rgbbuf, 3, width, stdout);\n\t\tScanAbs(xbitmap + width, outwidth);\n\t}\n\n\toutputY ++;\n\n\treturn 0;\n}\n\n\n\/\/ shadowrect main:\n\/\/ give a background color (\"#FFFFFF\")\n\/\/ give a shadow radius (5.1)\n\/\/ give a shadow X offset (2)\n\/\/ give a shadow Y offset (3)\n\/\/ give an opacity (0.6)\n\nint main(int argc, char **argv)\n{\n\tin = fopen(\"test.ppm\", \"rb\");\n\n\tif (argc < 1) { \n\t\tprintf(\"Usage: %s [background] [radius] [xoffset] [yoffset] [%opacity]\\x13\", argv[0]);\n\t\treturn -1;\n\t}\n\n\tswitch (argc) {\n\tcase 6:\n\t\topac = uint32(2.56 * atof(argv[5]));\n\tcase 5:\n\t\tyoff = atoi(argv[4]);\n\tcase 4:\n\t\txoff = atoi(argv[3]);\n\tcase 3:\n\t\tsrad = atof(argv[2]);\n\tcase 2:\n\t \tif (argv[1][0] == '#') argv[1]++;\n\t\tbg = strtol(argv[1], NULL, 16);\n\t}\n\n\tif (Initialize() != 0) {\n\t\tfprintf(stderr, \"Input is not a valid PPM\\n\");\n\t\treturn -1;\t\/\/ format problem\n\t}\n\t\n\twhile (outputY < outheight) {\n\t\tProcessLine();\n\t}\n\n\tif (rgbbuf) delete rgbbuf; rgbbuf = NULL;\n\tif (sprof) delete sprof; sprof = NULL;\n\n\treturn 0;\n}\n\n<commit_msg>update header to reflect apache license :)<commit_after>\/\/ ================================================================================================\n\/\/ Shadowrect.cpp\n\/\/\n\/\/ Copyright (C) 2001 Herf Consulting LLC. All rights reserved.\n\/\/\n\/\/ ================================================================================================\n\n#include <stdio.h>\n#include <stdlib.h>\n\n#pragma warning(disable: 4244)\n\n\ntypedef unsigned long uint32;\ntypedef long int32;\ntypedef float real32;\ntypedef unsigned char uint8;\n\n\/\/ Globals (ack)\nuint32 bg = 0xFFFFFF;\nreal32 srad = 5.1f;\nuint32 opac = 153;\nuint8 *sprof = NULL;\nuint8 *rgbbuf = NULL;\nuint32 sprofsize = 0;\n\n\/\/ shadow offsets in bitmap space\nint32 xoff = 2;\nint32 yoff = 3;\n\n\/\/ offsets from bitmap to output space\nint32 xbitmap = 0, ybitmap = 0;\n\n\/\/ size of bitmap\nint32 width, height;\n\n\/\/ size of output\nint32 outwidth, outheight;\n\n\/\/ output state\nint32 outputY = 0;\n\nint32 topql, topqt, topqr, topqb;\n\nFILE *in = stdin;\n\n\/\/ ================================================================================================\n\/\/ approximation to the gaussian integral [x, infty]\n\/\/ ================================================================================================\nstatic inline real32 gi(real32 x)\n{\n\tconst real32 i6 = 1.f \/ 6.0f;\n\tconst real32 i4 = 1.f \/ 4.0f;\n\tconst real32 i3 = 1.f \/ 3.0f;\n\n\tif (x > 1.5f) return 0.0f;\n\tif (x < -1.5f) return 1.0f;\n\n\treal32 x2 = x * x;\n\treal32 x3 = x2 * x;\n\n\tif (x > 0.5) return .5625 - ( x3 * i6 - 3 * x2 * i4 + 1.125 * x);\n\tif (x > -0.5) return 0.5 - (0.75 * x - x3 * i3);\n\t\t\t\t return 0.4375 + (-x3 * i6 - 3 * x2 * i4 - 1.125 * x);\n}\n\nstatic int32 UpdateProfile()\n{\n\tint32 size = srad * 3 + 1;\n\tint32 c = size >> 1;\n\n\tsprof = new uint8[size];\n\tsprofsize = size;\n\tif (sprof == NULL) return -1;\n\n\treal32 invr = 1.f \/ srad;\n\tfor (int32 x = 1; x < size; x ++) {\n\t\treal32 xp = (c - x) * invr;\n\t\treal32 gint = gi(xp);\n\t\tsprof[x] = 255 - int32(255.f * gint);\n\t}\n\t\/\/ unstable here!\n\tsprof[0] = 255;\n\n\treturn 0;\n}\n\nchar line[2048];\nstatic char GetLine() {\n\tif (fgets(line, 2048, in)) {\n\t\treturn line[0];\n\t} else {\n\t\treturn 0;\n\t}\n}\n\nstatic int32 Initialize() \n{\n\tuint32 ignoreme;\n\n\t\/\/ try to parse PPM\n\tGetLine();\tif (line[0] != 'P' || line[1] != '6') return -1;\n\twhile (GetLine() == '#') {}\n\tif (sscanf(line, \"%d %d\\n\", &width, &height) != 2) return -1;\n\twhile (GetLine() == '#') {}\n\tif (sscanf(line, \"%d\\n\", &ignoreme) != 1) return -1;\n\tif (ignoreme != 255) return -1;\n\n\trgbbuf = new uint8[width * 3];\n\tif (!rgbbuf) return -1;\n\n\t\/\/ setup shadow based on width, height\n\tint32 sl = int(-srad * 1.5) + xoff;\n\tint32 sr = int( srad * 1.5 + width + 0.9999) + xoff;\n\tint32 st = int(-srad * 1.5) + yoff;\n\tint32 sb = int( srad * 1.5 + height + 0.9999) + yoff;\n\n\tif (sl < 0) {\n\t\txbitmap = -sl;\n\t\tsr += xbitmap;\n\t\tsl = 0;\n\t}\n\tif (st < 0) {\n\t\tybitmap = -st;\n\t\tsb += ybitmap;\n\t\tst = 0;\n\t}\n\n\tint32 maxx = sr - sl;\n\tint32 maxy = sb - st;\n\tint32 bitx = width + xbitmap;\n\tint32 bity = height + ybitmap;\n\n\tif (bitx > maxx) maxx = bitx;\n\tif (bity > maxy) maxy = bity;\n\n\toutwidth = maxx;\n\toutheight = maxy;\n\n\tprintf(\"P6\\n# Not created by the GIMP\\n%d %d\\n255\\n\", outwidth, outheight);\n\n\t\/\/ find top quadrant of shadow * 2 (.1 fixed point)\n\ttopql = xoff + xbitmap;\n\ttopqr = width + xoff + xbitmap;\n\ttopqt = yoff + ybitmap;\n\ttopqb = height + yoff + ybitmap;\n\n\ttopqb = topqt + topqb;\n\ttopqt += topqt;\n\n\ttopqr = topql + topqr;\n\ttopql += topql;\n\n\t\/\/ we've computed xbitmap, ybitmap, outwidth, outheight\n\treturn UpdateProfile();\n}\n\n\/\/ ================================================================================================\n\/\/ multiply with black\n\/\/ ================================================================================================\nstatic inline void PixelDarken(uint32 &d, const uint32 amt)\n{\n\tuint32 rb = d & 0xFF00FF;\n\tuint32 g = d & 0x00FF00;\n\td &= 0xFF000000;\n\n\trb = rb * amt & 0xFF00FF00;\n\tg = g * amt & 0x00FF0000;\n\n\trb |= g;\n\td |= (rb >> 8);\n}\n\n\/\/ scan from x0 to x1 using outputY as the scanline\nint32 ScanAbs(int32 x0, int32 x1)\n{\n\tif (x1 <= x0) return 0;\n\n\tint32 maxi = sprofsize - 1;\n\n\tint32 filll2 = x0 * 2;\n\tint32 fillr2 = x1 * 2;\n\n\tint32 center = (sprofsize & ~1) - 1;\/\/(sprof.Used() & ~1) - 1;\n\n\tint32 w = topqr - topql - center;\n\tint32 h = topqb - topqt - center;\n\n\t\/\/ scan\n\tint32 y = outputY;\n\n\tint32 dy = abs(y * 2 - topqb) - h;\n\tint32 oy = dy >> 1;\n\tif (oy < 0) oy = 0;\n\t\n\tuint32 sh0 = sprof[oy];\n\n\tsh0 = sh0 * opac >> 8;\n\n\t\/\/uint32 *dp0 = dst.Pixel(x0, y);\n\tfor (int32 x = filll2; x < fillr2; x += 2) {\n\n\t\tint32 dx = abs(x - topqr) - w;\n\t\tint32 ox = dx >> 1;\n\t\tif (ox < 0) ox = 0;\n\n\t\tuint32 sh = 256 - ((sprof[ox]) * sh0 >> 8);\n\t\t\/\/uint32 sh = (sprof[ox]) * sh0 >> 8;\n\t\t\n\t\tuint32 dst = bg;\n\t\tPixelDarken(dst, sh);\n\t\tputchar(dst >> 16 & 0xFF);\n\t\tputchar(dst >> 8 & 0xFF);\n\t\tputchar(dst & 0xFF);\n\t}\n\n\treturn 0;\n}\n\nstatic int32 ProcessLine()\n{\n\t\/\/ write a line for \"outputY\"\n\tif (outputY < ybitmap || outputY >= (ybitmap + height)) {\n\t\t\/\/ \"write\"\n\t\t\/\/ write a whole line of shadow\n\t\tScanAbs(0, outwidth);\n\t} else {\n\t\t\/\/ \"read-write\"\n\t\t\/\/ clip and write a line of the input bitmap\n\t\tScanAbs(0, xbitmap);\n\n\t\t\/\/ in case read fails, fill buffer with bg color\n\t\tuint8 *rgb = rgbbuf;\n\t\tfor (int32 i = 0; i < width; i++) {\n\t\t\trgb[0] = bg >> 16 & 0xFF;\n\t\t\trgb[1] = bg >> 8 & 0xFF;\n\t\t\trgb[2] = bg & 0xFF;\n\t\t\trgb += 3;\n\t\t}\n\t\tfread(rgbbuf, 3, width, in);\n\t\tfwrite(rgbbuf, 3, width, stdout);\n\t\tScanAbs(xbitmap + width, outwidth);\n\t}\n\n\toutputY ++;\n\n\treturn 0;\n}\n\n\n\/\/ shadowrect main:\n\/\/ give a background color (\"#FFFFFF\")\n\/\/ give a shadow radius (5.1)\n\/\/ give a shadow X offset (2)\n\/\/ give a shadow Y offset (3)\n\/\/ give an opacity (0.6)\n\nint main(int argc, char **argv)\n{\n\tin = fopen(\"test.ppm\", \"rb\");\n\n\tif (argc < 1) { \n\t\tprintf(\"Usage: %s [background] [radius] [xoffset] [yoffset] [%opacity]\\x13\", argv[0]);\n\t\treturn -1;\n\t}\n\n\tswitch (argc) {\n\tcase 6:\n\t\topac = uint32(2.56 * atof(argv[5]));\n\tcase 5:\n\t\tyoff = atoi(argv[4]);\n\tcase 4:\n\t\txoff = atoi(argv[3]);\n\tcase 3:\n\t\tsrad = atof(argv[2]);\n\tcase 2:\n\t \tif (argv[1][0] == '#') argv[1]++;\n\t\tbg = strtol(argv[1], NULL, 16);\n\t}\n\n\tif (Initialize() != 0) {\n\t\tfprintf(stderr, \"Input is not a valid PPM\\n\");\n\t\treturn -1;\t\/\/ format problem\n\t}\n\t\n\twhile (outputY < outheight) {\n\t\tProcessLine();\n\t}\n\n\tif (rgbbuf) delete rgbbuf; rgbbuf = NULL;\n\tif (sprof) delete sprof; sprof = NULL;\n\n\treturn 0;\n}\n\n<|endoftext|>"} {"text":"<commit_before>\/\/ Authors: Axel Naumann, Philippe Canal, Danilo Piparo\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#ifndef ROOT_STAGE1_BUILD\n#include \"rootclingTCling.h\"\n#include \"rootclingIO.h\"\n#endif\n\n#include \"rootcling_impl.h\"\n#include \"RConfigure.h\"\n#include \"RConfig.h\"\n\n#include <iostream>\n\n#ifdef _WIN32\n# ifdef system\n# undef system\n# endif\n# include <windows.h>\n# include <Tlhelp32.h> \/\/ for MAX_MODULE_NAME32\n# include <process.h>\n# define PATH_MAX _MAX_PATH\n# ifdef interface\n\/\/ prevent error coming from clang\/AST\/Attrs.inc\n# undef interface\n# endif\n#else \/\/ _WIN32\n# include <limits.h>\n# include <unistd.h>\n# include <dlfcn.h>\n#endif\n\n#ifdef __APPLE__\n#include <libgen.h> \/\/ Needed for basename\n#include <mach-o\/dyld.h>\n#endif\n\nextern \"C\" {\nR__DLLEXPORT void usedToIdentifyRootClingByDlSym() {}\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n#ifdef __ICC\n#pragma warning disable 69\n#endif\n\n\nint main(int argc, char **argv)\n{\n \/\/ Force the emission of the symbol - the compiler cannot know that argv\n \/\/ is always set.\n if (!argv) {\n auto dummyVal = (int)(long)&usedToIdentifyRootClingByDlSym;\n return dummyVal;\n }\n\n ROOT::Internal::RootCling::DriverConfig config{};\n#ifdef R__HAVE_LLVMRESOURCEDIR\n config.fLLVMResourceDir= \"@R__LLVMRESOURCEDIR@\";\n#endif\n\n#ifdef ROOT_STAGE1_BUILD\n config.fBuildingROOTStage1 = true;\n#else\n config.fBuildingROOTStage1 = false;\n config.fTROOT__GetExtraInterpreterArgs = &TROOT__GetExtraInterpreterArgs;\n config.fTCling__GetInterpreter = &TCling__GetInterpreter;\n config.fInitializeStreamerInfoROOTFile = &InitializeStreamerInfoROOTFile;\n config.fAddStreamerInfoToROOTFile = &AddStreamerInfoToROOTFile;\n config.fAddTypedefToROOTFile = &AddTypedefToROOTFile;\n config.fAddEnumToROOTFile = &AddEnumToROOTFile;\n config.fAddAncestorPCMROOTFile = &AddAncestorPCMROOTFile;\n config.fCloseStreamerInfoROOTFile = &CloseStreamerInfoROOTFile;\n#endif\n return rootcling_driver(argc, argv, config);\n}\n<commit_msg>Simply use symbol from libCling; rootcling links against it.<commit_after>\/\/ Authors: Axel Naumann, Philippe Canal, Danilo Piparo\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#ifndef ROOT_STAGE1_BUILD\n#include \"rootclingTCling.h\"\n#include \"rootclingIO.h\"\n#endif\n\n#include \"rootcling_impl.h\"\n#include \"RConfigure.h\"\n#include \"RConfig.h\"\n\n#include <iostream>\n\n#ifdef _WIN32\n# ifdef system\n# undef system\n# endif\n# include <windows.h>\n# include <Tlhelp32.h> \/\/ for MAX_MODULE_NAME32\n# include <process.h>\n# define PATH_MAX _MAX_PATH\n# ifdef interface\n\/\/ prevent error coming from clang\/AST\/Attrs.inc\n# undef interface\n# endif\n#else \/\/ _WIN32\n# include <limits.h>\n# include <unistd.h>\n# include <dlfcn.h>\n#endif\n\n#ifdef __APPLE__\n#include <libgen.h> \/\/ Needed for basename\n#include <mach-o\/dyld.h>\n#endif\n\nextern \"C\" {\nR__DLLEXPORT void usedToIdentifyRootClingByDlSym() {}\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n#ifdef __ICC\n#pragma warning disable 69\n#endif\n\n\nint main(int argc, char **argv)\n{\n \/\/ Force the emission of the symbol - the compiler cannot know that argv\n \/\/ is always set.\n if (!argv) {\n auto dummyVal = (int)(long)&usedToIdentifyRootClingByDlSym;\n return dummyVal;\n }\n\n ROOT::Internal::RootCling::DriverConfig config{};\n#ifdef R__HAVE_LLVMRESOURCEDIR\n config.fLLVMResourceDir= \"@R__LLVMRESOURCEDIR@\";\n#endif\n\n#ifdef ROOT_STAGE1_BUILD\n config.fBuildingROOTStage1 = true;\n#else\n config.fBuildingROOTStage1 = false;\n config.fTROOT__GetExtraInterpreterArgs = &TROOT__GetExtraInterpreterArgs;\n config.fTCling__GetInterpreter = &TCling__GetInterpreter;\n config.fInitializeStreamerInfoROOTFile = &InitializeStreamerInfoROOTFile;\n config.fAddStreamerInfoToROOTFile = &AddStreamerInfoToROOTFile;\n config.fAddTypedefToROOTFile = &AddTypedefToROOTFile;\n config.fAddEnumToROOTFile = &AddEnumToROOTFile;\n config.fAddAncestorPCMROOTFile = &AddAncestorPCMROOTFile;\n config.fCloseStreamerInfoROOTFile = &CloseStreamerInfoROOTFile;\n#endif\n return ROOT_rootcling_Driver(argc, argv, config);\n}\n<|endoftext|>"} {"text":"<commit_before><commit_msg>fixed note off velocity<commit_after><|endoftext|>"} {"text":"<commit_before>#include \"Camera2DTargetedComponent.h\"\n\n#include \"Entities\/Components\/Transform3DComponent.h\"\n#include \"Entities\/ComponentTypeEnum.h\"\n#include \"Game\/Game.h\"\n\nnamespace CasaEngine\n{\n\tCamera2DTargetedComponent::Camera2DTargetedComponent(BaseEntity *entity) :\n\t\tCamera2DComponent(entity, CAMERA_2D_TARGETED),\n\t\tm_pTargetedEntity(nullptr)\n\t{\n\t}\n\n\tvoid Camera2DTargetedComponent::Update(const GameTime& gameTime_)\n\t{\n\t\tif (m_pTargetedEntity != nullptr)\n\t\t{\n\t\t\tauto viewport = GetViewport();\n\t\t\tconst auto winSize = Game::Instance().GetWindowSize();\n\t\t\tauto* const transform_3d_component = m_pTargetedEntity->GetComponentMgr()->GetComponent<Transform3DComponent>();\n\t\t\tCA_ASSERT(transform_3d_component != nullptr, \"cameracomponent : the target need to have a Transform3DComponent\");\n\t\t\tconst auto targetPosition = transform_3d_component->GetPosition();\n\n\t\t\tconst Rectangle deadZone(m_Offset.x + static_cast<float>(winSize.x) * (1.0f - m_DeadZoneRatio.x) \/ 2.0f,\n\t\t\t\tm_Offset.y + static_cast<float>(winSize.y) * (1.0f - m_DeadZoneRatio.y) \/ 2.0f,\n\t\t\t\twinSize.x * m_DeadZoneRatio.x,\n\t\t\t\twinSize.y * m_DeadZoneRatio.y);\n\n\t\t\tif (deadZone.Intersects(Vector2(targetPosition.x, targetPosition.y)) == INT_OUT)\n\t\t\t{\n\t\t\t\tif (targetPosition.x < deadZone.Left())\n\t\t\t\t{\n\t\t\t\t\tm_Offset.x -= deadZone.Left() - targetPosition.x;\n\t\t\t\t}\n\t\t\t\telse if (targetPosition.x > deadZone.Right())\n\t\t\t\t{\n\t\t\t\t\tm_Offset.x += targetPosition.x - deadZone.Right();\n\t\t\t\t}\n\n\t\t\t\tif (targetPosition.y < deadZone.Top())\n\t\t\t\t{\n\t\t\t\t\tm_Offset.y -= deadZone.Top() - targetPosition.y;\n\t\t\t\t}\n\t\t\t\telse if (targetPosition.y > deadZone.Bottom())\n\t\t\t\t{\n\t\t\t\t\tm_Offset.y += targetPosition.y - deadZone.Bottom();\n\t\t\t\t}\n\n\t\t\t\t\/\/limits\n\t\t\t\tif (m_Offset.x > m_Limits.Right() - static_cast<int>(winSize.x))\n\t\t\t\t{\n\t\t\t\t\tm_Offset.x = m_Limits.Right() - static_cast<int>(winSize.x);\n\t\t\t\t}\n\n\t\t\t\tif (m_Offset.x < m_Limits.Left())\n\t\t\t\t{\n\t\t\t\t\tm_Offset.x = m_Limits.Left();\n\t\t\t\t}\n\n\t\t\t\tif (m_Offset.y > m_Limits.Bottom() - static_cast<int>(winSize.y))\n\t\t\t\t{\n\t\t\t\t\tm_Offset.y = m_Limits.Bottom() - static_cast<int>(winSize.y);\n\t\t\t\t}\n\n\t\t\t\tif (m_Offset.y < m_Limits.Top())\n\t\t\t\t{\n\t\t\t\t\tm_Offset.y = m_Limits.Top();\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\n\tvoid Camera2DTargetedComponent::ComputeViewMatrix()\n\t{\n\t\tm_ViewMatrix = Matrix4::CreateTranslation(-m_Offset.x, -m_Offset.y, -50.0f);\n\t}\n\n\tvoid Camera2DTargetedComponent::SetTargetedEntity(BaseEntity* pTargetedEntity)\n\t{\n\t\tm_pTargetedEntity = pTargetedEntity;\n\t}\n\n\tvoid Camera2DTargetedComponent::SetDeadZoneRatio(Vector2 deadZoneRatio)\n\t{\n\t\tm_DeadZoneRatio = deadZoneRatio;\n\t}\n\n\tVector2I Camera2DTargetedComponent::GetOffset() const\n\t{\n\t\treturn m_Offset;\n\t}\n\n\tvoid Camera2DTargetedComponent::SetOffset(Vector2I offset)\n\t{\n\t\tm_Offset = offset;\n\t}\n\n\tRectangleI Camera2DTargetedComponent::GetLimits() const\n\t{\n\t\treturn m_Limits;\n\t}\n\n\tvoid Camera2DTargetedComponent::SetLimits(RectangleI limits)\n\t{\n\t\tm_Limits = limits;\n\t}\n}\n<commit_msg>fix Camera2DTargetedComponent<commit_after>#include \"Camera2DTargetedComponent.h\"\n\n#include \"Entities\/Components\/Transform3DComponent.h\"\n#include \"Entities\/ComponentTypeEnum.h\"\n#include \"Game\/Game.h\"\n\nnamespace CasaEngine\n{\n\tCamera2DTargetedComponent::Camera2DTargetedComponent(BaseEntity *entity) :\n\t\tCamera2DComponent(entity, CAMERA_2D_TARGETED),\n\t\tm_pTargetedEntity(nullptr)\n\t{\n\t}\n\n\tvoid Camera2DTargetedComponent::Update(const GameTime& gameTime_)\n\t{\n\t\tif (m_pTargetedEntity != nullptr)\n\t\t{\n\t\t\tauto viewport = GetViewport();\n\t\t\tconst auto winSize = Game::Instance().GetWindowSize();\n\t\t\tauto* const transform_3d_component = m_pTargetedEntity->GetComponentMgr()->GetComponent<Transform3DComponent>();\n\t\t\tCA_ASSERT(transform_3d_component != nullptr, \"cameracomponent : the target need to have a Transform3DComponent\");\n\t\t\tconst auto targetPosition = transform_3d_component->GetPosition();\n\n\t\t\tconst Rectangle deadZone(m_Offset.x + static_cast<float>(winSize.x) * (1.0f - m_DeadZoneRatio.x) \/ 2.0f,\n\t\t\t\tm_Offset.y + static_cast<float>(winSize.y) * (1.0f - m_DeadZoneRatio.y) \/ 2.0f,\n\t\t\t\twinSize.x * m_DeadZoneRatio.x,\n\t\t\t\twinSize.y * m_DeadZoneRatio.y);\n\n\t\t\tif (deadZone.Intersects(Vector2(targetPosition.x, targetPosition.y)) == INT_OUT)\n\t\t\t{\n\t\t\t\tm_needToComputeViewMatrix = true;\n\n\t\t\t\tif (targetPosition.x < deadZone.Left())\n\t\t\t\t{\n\t\t\t\t\tm_Offset.x -= deadZone.Left() - targetPosition.x;\n\t\t\t\t}\n\t\t\t\telse if (targetPosition.x > deadZone.Right())\n\t\t\t\t{\n\t\t\t\t\tm_Offset.x += targetPosition.x - deadZone.Right();\n\t\t\t\t}\n\n\t\t\t\tif (targetPosition.y < deadZone.Top())\n\t\t\t\t{\n\t\t\t\t\tm_Offset.y -= deadZone.Top() - targetPosition.y;\n\t\t\t\t}\n\t\t\t\telse if (targetPosition.y > deadZone.Bottom())\n\t\t\t\t{\n\t\t\t\t\tm_Offset.y += targetPosition.y - deadZone.Bottom();\n\t\t\t\t}\n\n\t\t\t\t\/\/limits\n\t\t\t\tif (m_Offset.x > m_Limits.Right() - static_cast<int>(winSize.x))\n\t\t\t\t{\n\t\t\t\t\tm_Offset.x = m_Limits.Right() - static_cast<int>(winSize.x);\n\t\t\t\t}\n\n\t\t\t\tif (m_Offset.x < m_Limits.Left())\n\t\t\t\t{\n\t\t\t\t\tm_Offset.x = m_Limits.Left();\n\t\t\t\t}\n\n\t\t\t\tif (m_Offset.y > m_Limits.Bottom() - static_cast<int>(winSize.y))\n\t\t\t\t{\n\t\t\t\t\tm_Offset.y = m_Limits.Bottom() - static_cast<int>(winSize.y);\n\t\t\t\t}\n\n\t\t\t\tif (m_Offset.y < m_Limits.Top())\n\t\t\t\t{\n\t\t\t\t\tm_Offset.y = m_Limits.Top();\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\n\tvoid Camera2DTargetedComponent::ComputeViewMatrix()\n\t{\n\t\tm_ViewMatrix = Matrix4::CreateTranslation(-m_Offset.x, -m_Offset.y, -50.0f);\n\t}\n\n\tvoid Camera2DTargetedComponent::SetTargetedEntity(BaseEntity* pTargetedEntity)\n\t{\n\t\tm_pTargetedEntity = pTargetedEntity;\n\t}\n\n\tvoid Camera2DTargetedComponent::SetDeadZoneRatio(Vector2 deadZoneRatio)\n\t{\n\t\tm_DeadZoneRatio = deadZoneRatio;\n\t}\n\n\tVector2I Camera2DTargetedComponent::GetOffset() const\n\t{\n\t\treturn m_Offset;\n\t}\n\n\tvoid Camera2DTargetedComponent::SetOffset(Vector2I offset)\n\t{\n\t\tm_Offset = offset;\n\t}\n\n\tRectangleI Camera2DTargetedComponent::GetLimits() const\n\t{\n\t\treturn m_Limits;\n\t}\n\n\tvoid Camera2DTargetedComponent::SetLimits(RectangleI limits)\n\t{\n\t\tm_Limits = limits;\n\t}\n}\n<|endoftext|>"} {"text":"<commit_before>\/*\n* Reader of \/dev\/random and company\n* (C) 1999-2009,2013 Jack Lloyd\n*\n* Distributed under the terms of the Botan license\n*\/\n\n#include <botan\/internal\/dev_random.h>\n\n#include <sys\/types.h>\n#include <sys\/select.h>\n#include <sys\/stat.h>\n#include <unistd.h>\n#include <fcntl.h>\n#include <string.h>\n\nnamespace Botan {\n\nnamespace {\n\nint open_nonblocking(const char* pathname)\n {\n#ifndef O_NONBLOCK\n #define O_NONBLOCK 0\n#endif\n\n#ifndef O_NOCTTY\n #define O_NOCTTY 0\n#endif\n\n const int flags = O_RDONLY | O_NONBLOCK | O_NOCTTY;\n return ::open(pathname, flags);\n }\n\n}\n\n\/**\nDevice_EntropySource constructor\nOpen a file descriptor to each (available) device in fsnames\n*\/\nDevice_EntropySource::Device_EntropySource(const std::vector<std::string>& fsnames)\n {\n for(size_t i = 0; i != fsnames.size(); ++i)\n {\n fd_type fd = open_nonblocking(fsnames[i].c_str());\n if(fd >= 0 && fd < FD_SETSIZE)\n devices.push_back(fd);\n }\n }\n\n\/**\nDevice_EntropySource destructor: close all open devices\n*\/\nDevice_EntropySource::~Device_EntropySource()\n {\n for(size_t i = 0; i != devices.size(); ++i)\n ::close(devices[i]);\n }\n\n\/**\n* Gather entropy from a RNG device\n*\/\nvoid Device_EntropySource::poll(Entropy_Accumulator& accum)\n {\n if(devices.empty())\n return;\n\n const size_t ENTROPY_BITS_PER_BYTE = 8;\n const size_t MS_WAIT_TIME = 32;\n const size_t READ_ATTEMPT = accum.desired_remaining_bits() \/ 4;\n\n secure_vector<byte>& io_buffer = accum.get_io_buffer(READ_ATTEMPT);\n\n int max_fd = devices[0];\n fd_set read_set;\n FD_ZERO(&read_set);\n for(size_t i = 0; i != devices.size(); ++i)\n {\n FD_SET(devices[i], &read_set);\n max_fd = std::max(devices[i], max_fd);\n }\n\n struct ::timeval timeout;\n\n timeout.tv_sec = (MS_WAIT_TIME \/ 1000);\n timeout.tv_usec = (MS_WAIT_TIME % 1000) * 1000;\n\n if(::select(max_fd + 1, &read_set, 0, 0, &timeout) < 0)\n return;\n\n for(size_t i = 0; i != devices.size(); ++i)\n {\n if(FD_ISSET(devices[i], &read_set))\n {\n const ssize_t got = ::read(devices[i], &io_buffer[0], io_buffer.size());\n accum.add(&io_buffer[0], got, ENTROPY_BITS_PER_BYTE);\n }\n }\n }\n\n}\n<commit_msg>Simplify device opening, and avoid leaking a file descriptor if it was too large to fit in an fd_set.<commit_after>\/*\n* Reader of \/dev\/random and company\n* (C) 1999-2009,2013 Jack Lloyd\n*\n* Distributed under the terms of the Botan license\n*\/\n\n#include <botan\/internal\/dev_random.h>\n#include <botan\/internal\/rounding.h>\n\n#include <sys\/types.h>\n#include <sys\/select.h>\n#include <sys\/stat.h>\n#include <unistd.h>\n#include <fcntl.h>\n#include <string.h>\n\nnamespace Botan {\n\n\/**\nDevice_EntropySource constructor\nOpen a file descriptor to each (available) device in fsnames\n*\/\nDevice_EntropySource::Device_EntropySource(const std::vector<std::string>& fsnames)\n {\n#ifndef O_NONBLOCK\n #define O_NONBLOCK 0\n#endif\n\n#ifndef O_NOCTTY\n #define O_NOCTTY 0\n#endif\n\n const int flags = O_RDONLY | O_NONBLOCK | O_NOCTTY;\n\n for(auto fsname : fsnames)\n {\n fd_type fd = ::open(fsname.c_str(), flags);\n\n if(fd >= 0 && fd < FD_SETSIZE)\n devices.push_back(fd);\n else if(fd >= 0)\n ::close(fd);\n }\n }\n\n\/**\nDevice_EntropySource destructor: close all open devices\n*\/\nDevice_EntropySource::~Device_EntropySource()\n {\n for(size_t i = 0; i != devices.size(); ++i)\n ::close(devices[i]);\n }\n\n\/**\n* Gather entropy from a RNG device\n*\/\nvoid Device_EntropySource::poll(Entropy_Accumulator& accum)\n {\n if(devices.empty())\n return;\n\n const size_t ENTROPY_BITS_PER_BYTE = 8;\n const size_t MS_WAIT_TIME = 32;\n const size_t READ_ATTEMPT = std::min<size_t>(accum.desired_remaining_bits() \/ 8, 16);\n\n int max_fd = devices[0];\n fd_set read_set;\n FD_ZERO(&read_set);\n for(size_t i = 0; i != devices.size(); ++i)\n {\n FD_SET(devices[i], &read_set);\n max_fd = std::max(devices[i], max_fd);\n }\n\n struct ::timeval timeout;\n\n timeout.tv_sec = (MS_WAIT_TIME \/ 1000);\n timeout.tv_usec = (MS_WAIT_TIME % 1000) * 1000;\n\n if(::select(max_fd + 1, &read_set, 0, 0, &timeout) < 0)\n return;\n\n secure_vector<byte>& io_buffer = accum.get_io_buffer(READ_ATTEMPT);\n\n for(size_t i = 0; i != devices.size(); ++i)\n {\n if(FD_ISSET(devices[i], &read_set))\n {\n const ssize_t got = ::read(devices[i], &io_buffer[0], io_buffer.size());\n accum.add(&io_buffer[0], got, ENTROPY_BITS_PER_BYTE);\n }\n }\n }\n\n}\n<|endoftext|>"} {"text":"<commit_before>\/*\n * Copyright (c) 2012-2016 Daniele Bartolini and individual contributors.\n * License: https:\/\/github.com\/taylor001\/crown\/blob\/master\/LICENSE\n *\/\n\n#include \"path.h\"\n#include <ctype.h> \/\/ isalpha\n#include <string.h> \/\/ strlen, strrchr\n\nnamespace crown\n{\nnamespace path\n{\n\tbool is_absolute(const char* path)\n\t{\n\t\tCE_ASSERT(path != NULL, \"Path must be != NULL\");\n#if CROWN_PLATFORM_POSIX\n\t\treturn strlen32(path) > 0 && path[0] == PATH_SEPARATOR;\n#elif CROWN_PLATFORM_WINDOWS\n\t\treturn strlen32(path) > 2 && isalpha(path[0]) && path[1] == ':' && path[2] == PATH_SEPARATOR;\n#endif\n\t}\n\n\tbool is_root(const char* path)\n\t{\n\t\tCE_ASSERT(path != NULL, \"Path must be != NULL\");\n#if CROWN_PLATFORM_POSIX\n\t\treturn is_absolute(path) && strlen32(path) == 1;\n#elif CROWN_PLATFORM_WINDOWS\n\t\treturn is_absolute(path) && strlen32(path) == 3;\n#endif\n\t}\n\n\tvoid join(const char* a, const char* b, DynamicString& path)\n\t{\n\t\tconst u32 la = strlen32(a);\n\t\tconst u32 lb = strlen32(b);\n\t\tpath.reserve(la + lb + 1);\n\t\tpath += a;\n\t\tpath += PATH_SEPARATOR;\n\t\tpath += b;\n\t}\n\n\tconst char* basename(const char* path)\n\t{\n\t\tconst char* ls = strrchr(path, '\/');\n\t\treturn ls == NULL ? path : ls + 1;\n\t}\n\n\tconst char* extension(const char* path)\n\t{\n\t\tconst char* ld = strrchr(path, '.');\n\t\treturn ld == NULL ? NULL : ld + 1;\n\t}\n} \/\/ namespace path\n} \/\/ namespace crown\n<commit_msg>Cleanup<commit_after>\/*\n * Copyright (c) 2012-2016 Daniele Bartolini and individual contributors.\n * License: https:\/\/github.com\/taylor001\/crown\/blob\/master\/LICENSE\n *\/\n\n#include \"path.h\"\n#include <ctype.h> \/\/ isalpha\n#include <string.h> \/\/ strlen, strrchr\n\nnamespace crown\n{\nnamespace path\n{\n\tbool is_absolute(const char* path)\n\t{\n\t\tCE_ASSERT(path != NULL, \"Path must be != NULL\");\n#if CROWN_PLATFORM_POSIX\n\t\treturn strlen32(path) > 0\n\t\t\t&& path[0] == PATH_SEPARATOR\n\t\t\t;\n#elif CROWN_PLATFORM_WINDOWS\n\t\treturn strlen32(path) > 2\n\t\t\t&& isalpha(path[0])\n\t\t\t&& path[1] == ':'\n\t\t\t&& path[2] == PATH_SEPARATOR\n\t\t\t;\n#endif\n\t}\n\n\tbool is_root(const char* path)\n\t{\n\t\tCE_ASSERT(path != NULL, \"Path must be != NULL\");\n#if CROWN_PLATFORM_POSIX\n\t\treturn is_absolute(path) && strlen32(path) == 1;\n#elif CROWN_PLATFORM_WINDOWS\n\t\treturn is_absolute(path) && strlen32(path) == 3;\n#endif\n\t}\n\n\tvoid join(const char* a, const char* b, DynamicString& path)\n\t{\n\t\tconst u32 la = strlen32(a);\n\t\tconst u32 lb = strlen32(b);\n\t\tpath.reserve(la + lb + 1);\n\t\tpath += a;\n\t\tpath += PATH_SEPARATOR;\n\t\tpath += b;\n\t}\n\n\tconst char* basename(const char* path)\n\t{\n\t\tconst char* ls = strrchr(path, '\/');\n\t\treturn ls == NULL ? path : ls + 1;\n\t}\n\n\tconst char* extension(const char* path)\n\t{\n\t\tconst char* ld = strrchr(path, '.');\n\t\treturn ld == NULL ? NULL : ld + 1;\n\t}\n} \/\/ namespace path\n} \/\/ namespace crown\n<|endoftext|>"} {"text":"<commit_before>\/*\n * The Apache Software License, Version 1.1\n *\n * Copyright (c) 1999-2000 The Apache Software Foundation. All rights\n * reserved.\n *\n * Redistribution and use in source and binary forms, with or without\n * modification, are permitted provided that the following conditions\n * are met:\n *\n * 1. Redistributions of source code must retain the above copyright\n * notice, this list of conditions and the following disclaimer.\n *\n * 2. Redistributions in binary form must reproduce the above copyright\n * notice, this list of conditions and the following disclaimer in\n * the documentation and\/or other materials provided with the\n * distribution.\n *\n * 3. The end-user documentation included with the redistribution,\n * if any, must include the following acknowledgment:\n * \"This product includes software developed by the\n * Apache Software Foundation (http:\/\/www.apache.org\/).\"\n * Alternately, this acknowledgment may appear in the software itself,\n * if and wherever such third-party acknowledgments normally appear.\n *\n * 4. The names \"Xerces\" and \"Apache Software Foundation\" must\n * not be used to endorse or promote products derived from this\n * software without prior written permission. For written\n * permission, please contact apache\\@apache.org.\n *\n * 5. Products derived from this software may not be called \"Apache\",\n * nor may \"Apache\" appear in their name, without prior written\n * permission of the Apache Software Foundation.\n *\n * THIS SOFTWARE IS PROVIDED ``AS IS'' AND ANY EXPRESSED OR IMPLIED\n * WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES\n * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE\n * DISCLAIMED. IN NO EVENT SHALL THE APACHE SOFTWARE FOUNDATION OR\n * ITS CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,\n * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT\n * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF\n * USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND\n * ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,\n * OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT\n * OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF\n * SUCH DAMAGE.\n * ====================================================================\n *\n * This software consists of voluntary contributions made by many\n * individuals on behalf of the Apache Software Foundation, and was\n * originally based on software copyright (c) 1999, International\n * Business Machines, Inc., http:\/\/www.ibm.com . For more information\n * on the Apache Software Foundation, please see\n * <http:\/\/www.apache.org\/>.\n *\/\n\n\/*\n * $Log$\n * Revision 1.7 2002\/11\/12 17:27:49 tng\n * DOM Message: add new domain for DOM Messages.\n *\n * Revision 1.6 2002\/11\/04 22:24:43 peiyongz\n * Locale setting for message loader\n *\n * Revision 1.5 2002\/11\/04 15:10:40 tng\n * C++ Namespace Support.\n *\n * Revision 1.4 2002\/10\/10 21:07:55 peiyongz\n * load resource files using environement vars and base name\n *\n * Revision 1.3 2002\/10\/02 17:08:50 peiyongz\n * XMLString::equals() to replace XMLString::compareString()\n *\n * Revision 1.2 2002\/09\/30 22:20:40 peiyongz\n * Build with ICU MsgLoader\n *\n * Revision 1.1.1.1 2002\/02\/01 22:22:19 peiyongz\n * sane_include\n *\n * Revision 1.7 2002\/01\/21 14:52:25 tng\n * [Bug 5847] ICUMsgLoader can't be compiled with gcc 3.0.3 and ICU2. And also fix the memory leak introduced by Bug 2730 fix.\n *\n * Revision 1.6 2001\/11\/01 23:39:18 jasons\n * 2001-11-01 Jason E. Stewart <jason@openinformatics.com>\n *\n * \t* src\/util\/MsgLoaders\/ICU\/ICUMsgLoader.hpp (Repository):\n * \t* src\/util\/MsgLoaders\/ICU\/ICUMsgLoader.cpp (Repository):\n * \tUpdated to compile with ICU-1.8.1\n *\n * Revision 1.5 2000\/03\/02 19:55:14 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.4 2000\/02\/06 07:48:21 rahulj\n * Year 2K copyright swat.\n *\n * Revision 1.3 2000\/01\/19 00:58:38 roddey\n * Update to support new ICU 1.4 release.\n *\n * Revision 1.2 1999\/11\/19 21:24:03 aruna1\n * incorporated ICU 1.3.1 related changes int he file\n *\n * Revision 1.1.1.1 1999\/11\/09 01:07:23 twl\n * Initial checkin\n *\n * Revision 1.4 1999\/11\/08 20:45:26 rahul\n * Swat for adding in Product name and CVS comment log variable.\n *\n *\/\n\n\n\/\/ ---------------------------------------------------------------------------\n\/\/ Includes\n\/\/ ---------------------------------------------------------------------------\n#include <xercesc\/util\/XercesDefs.hpp>\n#include <xercesc\/util\/PlatformUtils.hpp>\n#include <xercesc\/util\/XMLMsgLoader.hpp>\n#include <xercesc\/util\/XMLString.hpp>\n#include <xercesc\/util\/XMLUniDefs.hpp>\n#include <xercesc\/util\/Janitor.hpp>\n#include \"ICUMsgLoader.hpp\"\n\n#include \"string.h\"\n#include <stdio.h>\n#include <stdlib.h>\n\nXERCES_CPP_NAMESPACE_BEGIN\n\n\/\/ ---------------------------------------------------------------------------\n\/\/ Local static methods\n\/\/ ---------------------------------------------------------------------------\n\n\/\/ ---------------------------------------------------------------------------\n\/\/ Public Constructors and Destructor\n\/\/ ---------------------------------------------------------------------------\nICUMsgLoader::ICUMsgLoader(const XMLCh* const msgDomain)\n:fLocaleBundle(0)\n,fDomainBundle(0)\n{\n \/***\n\t Validate msgDomain\n ***\/\n if (!XMLString::equals(msgDomain, XMLUni::fgXMLErrDomain) &&\n !XMLString::equals(msgDomain, XMLUni::fgExceptDomain) &&\n !XMLString::equals(msgDomain, XMLUni::fgXMLDOMMsgDomain) &&\n !XMLString::equals(msgDomain, XMLUni::fgValidityDomain) )\n {\n XMLPlatformUtils::panic(XMLPlatformUtils::Panic_UnknownMsgDomain);\n }\n\n\t\/***\n\t Resolve domainName\n\t***\/\n\tint index = XMLString::lastIndexOf(msgDomain, chForwardSlash);\n\tchar* domainName = XMLString::transcode(&(msgDomain[index + 1]));\n ArrayJanitor<char> jan1(domainName);\n\n \/***\n\t Resolve location\n\n\t REVISIT: another approach would be: through some system API\n\t\t which returns the directory of the XercescLib and\n\t\t that directory would be used to locate the\n\t\t \t\t resource bundle\n ***\/\n char locationBuf[1024];\n memset(locationBuf, 0, sizeof locationBuf);\n\tchar *nlsHome = getenv(\"XERCESC_NLS_HOME\");\n\n if (nlsHome)\n\t{\n\t\tstrcpy(locationBuf, nlsHome);\n strcat(locationBuf, U_FILE_SEP_STRING);\n\t}\n\n strcat(locationBuf, \"XercescErrMsg\");\n\n\t\/***\n\t Open the locale-specific resource bundle\n\t***\/\n UErrorCode err = U_ZERO_ERROR;\n fLocaleBundle = ures_open(locationBuf, XMLMsgLoader::getLocale(), &err);\n if (!U_SUCCESS(err) || fLocaleBundle == NULL)\n {\n XMLPlatformUtils::panic(XMLPlatformUtils::Panic_CantLoadMsgDomain);\n }\n\n\t\/***\n\t Open the domain specific resource bundle within\n\t\tthe locale-specific resource bundle\n\t***\/\n\terr = U_ZERO_ERROR;\n\tfDomainBundle = ures_getByKey(fLocaleBundle, domainName, NULL, &err);\n\n\tif (!U_SUCCESS(err) || fDomainBundle == NULL)\n\t{\n XMLPlatformUtils::panic(XMLPlatformUtils::Panic_CantLoadMsgDomain);\n\t}\n\n}\n\nICUMsgLoader::~ICUMsgLoader()\n{\n ures_close(fDomainBundle);\n ures_close(fLocaleBundle);\n}\n\n\n\/\/ ---------------------------------------------------------------------------\n\/\/ Implementation of the virtual message loader API\n\/\/ ---------------------------------------------------------------------------\nbool ICUMsgLoader::loadMsg( const XMLMsgLoader::XMLMsgId msgToLoad\n , XMLCh* const toFill\n , const unsigned int maxChars)\n{\n UErrorCode err = U_ZERO_ERROR;\n int32_t strLen = 0;\n\n \/\/ Assuming array format\n const UChar *name = ures_getStringByIndex(fDomainBundle, (int32_t)msgToLoad-1, &strLen, &err);\n\n if (!U_SUCCESS(err) || (name == NULL))\n {\n return false;\n }\n\n int retStrLen = strLen > maxChars ? maxChars : strLen;\n\n if (sizeof(UChar)==sizeof(XMLCh))\n {\n XMLString::moveChars(toFill, (XMLCh*)name, retStrLen);\n toFill[retStrLen] = (XMLCh) 0;\n }\n else\n {\n XMLCh* retStr = toFill;\n const UChar *srcPtr = name;\n\n while (retStrLen--)\n *retStr++ = *srcPtr++;\n\n *retStr = 0;\n }\n\n return true;\n}\n\n\nbool ICUMsgLoader::loadMsg( const XMLMsgLoader::XMLMsgId msgToLoad\n , XMLCh* const toFill\n , const unsigned int maxChars\n , const XMLCh* const repText1\n , const XMLCh* const repText2\n , const XMLCh* const repText3\n , const XMLCh* const repText4)\n{\n \/\/ Call the other version to load up the message\n if (!loadMsg(msgToLoad, toFill, maxChars))\n return false;\n\n \/\/ And do the token replacement\n XMLString::replaceTokens(toFill, maxChars, repText1, repText2, repText3, repText4);\n return true;\n}\n\n\nbool ICUMsgLoader::loadMsg( const XMLMsgLoader::XMLMsgId msgToLoad\n , XMLCh* const toFill\n , const unsigned int maxChars\n , const char* const repText1\n , const char* const repText2\n , const char* const repText3\n , const char* const repText4)\n{\n \/\/\n \/\/ Transcode the provided parameters and call the other version,\n \/\/ which will do the replacement work.\n \/\/\n XMLCh* tmp1 = 0;\n XMLCh* tmp2 = 0;\n XMLCh* tmp3 = 0;\n XMLCh* tmp4 = 0;\n\n bool bRet = false;\n if (repText1)\n tmp1 = XMLString::transcode(repText1);\n if (repText2)\n tmp2 = XMLString::transcode(repText2);\n if (repText3)\n tmp3 = XMLString::transcode(repText3);\n if (repText4)\n tmp4 = XMLString::transcode(repText4);\n\n bRet = loadMsg(msgToLoad, toFill, maxChars, tmp1, tmp2, tmp3, tmp4);\n\n if (tmp1)\n delete [] tmp1;\n if (tmp2)\n delete [] tmp2;\n if (tmp3)\n delete [] tmp3;\n if (tmp4)\n delete [] tmp4;\n\n return bRet;\n}\n\nXERCES_CPP_NAMESPACE_END\n<commit_msg>fix to warning C4018: '>' : signed\/unsigned mismatch<commit_after>\/*\n * The Apache Software License, Version 1.1\n *\n * Copyright (c) 1999-2000 The Apache Software Foundation. All rights\n * reserved.\n *\n * Redistribution and use in source and binary forms, with or without\n * modification, are permitted provided that the following conditions\n * are met:\n *\n * 1. Redistributions of source code must retain the above copyright\n * notice, this list of conditions and the following disclaimer.\n *\n * 2. Redistributions in binary form must reproduce the above copyright\n * notice, this list of conditions and the following disclaimer in\n * the documentation and\/or other materials provided with the\n * distribution.\n *\n * 3. The end-user documentation included with the redistribution,\n * if any, must include the following acknowledgment:\n * \"This product includes software developed by the\n * Apache Software Foundation (http:\/\/www.apache.org\/).\"\n * Alternately, this acknowledgment may appear in the software itself,\n * if and wherever such third-party acknowledgments normally appear.\n *\n * 4. The names \"Xerces\" and \"Apache Software Foundation\" must\n * not be used to endorse or promote products derived from this\n * software without prior written permission. For written\n * permission, please contact apache\\@apache.org.\n *\n * 5. Products derived from this software may not be called \"Apache\",\n * nor may \"Apache\" appear in their name, without prior written\n * permission of the Apache Software Foundation.\n *\n * THIS SOFTWARE IS PROVIDED ``AS IS'' AND ANY EXPRESSED OR IMPLIED\n * WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES\n * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE\n * DISCLAIMED. IN NO EVENT SHALL THE APACHE SOFTWARE FOUNDATION OR\n * ITS CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,\n * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT\n * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF\n * USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND\n * ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,\n * OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT\n * OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF\n * SUCH DAMAGE.\n * ====================================================================\n *\n * This software consists of voluntary contributions made by many\n * individuals on behalf of the Apache Software Foundation, and was\n * originally based on software copyright (c) 1999, International\n * Business Machines, Inc., http:\/\/www.ibm.com . For more information\n * on the Apache Software Foundation, please see\n * <http:\/\/www.apache.org\/>.\n *\/\n\n\/*\n * $Log$\n * Revision 1.8 2002\/11\/20 20:28:17 peiyongz\n * fix to warning C4018: '>' : signed\/unsigned mismatch\n *\n * Revision 1.7 2002\/11\/12 17:27:49 tng\n * DOM Message: add new domain for DOM Messages.\n *\n * Revision 1.6 2002\/11\/04 22:24:43 peiyongz\n * Locale setting for message loader\n *\n * Revision 1.5 2002\/11\/04 15:10:40 tng\n * C++ Namespace Support.\n *\n * Revision 1.4 2002\/10\/10 21:07:55 peiyongz\n * load resource files using environement vars and base name\n *\n * Revision 1.3 2002\/10\/02 17:08:50 peiyongz\n * XMLString::equals() to replace XMLString::compareString()\n *\n * Revision 1.2 2002\/09\/30 22:20:40 peiyongz\n * Build with ICU MsgLoader\n *\n * Revision 1.1.1.1 2002\/02\/01 22:22:19 peiyongz\n * sane_include\n *\n * Revision 1.7 2002\/01\/21 14:52:25 tng\n * [Bug 5847] ICUMsgLoader can't be compiled with gcc 3.0.3 and ICU2. And also fix the memory leak introduced by Bug 2730 fix.\n *\n * Revision 1.6 2001\/11\/01 23:39:18 jasons\n * 2001-11-01 Jason E. Stewart <jason@openinformatics.com>\n *\n * \t* src\/util\/MsgLoaders\/ICU\/ICUMsgLoader.hpp (Repository):\n * \t* src\/util\/MsgLoaders\/ICU\/ICUMsgLoader.cpp (Repository):\n * \tUpdated to compile with ICU-1.8.1\n *\n * Revision 1.5 2000\/03\/02 19:55:14 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.4 2000\/02\/06 07:48:21 rahulj\n * Year 2K copyright swat.\n *\n * Revision 1.3 2000\/01\/19 00:58:38 roddey\n * Update to support new ICU 1.4 release.\n *\n * Revision 1.2 1999\/11\/19 21:24:03 aruna1\n * incorporated ICU 1.3.1 related changes int he file\n *\n * Revision 1.1.1.1 1999\/11\/09 01:07:23 twl\n * Initial checkin\n *\n * Revision 1.4 1999\/11\/08 20:45:26 rahul\n * Swat for adding in Product name and CVS comment log variable.\n *\n *\/\n\n\n\/\/ ---------------------------------------------------------------------------\n\/\/ Includes\n\/\/ ---------------------------------------------------------------------------\n#include <xercesc\/util\/XercesDefs.hpp>\n#include <xercesc\/util\/PlatformUtils.hpp>\n#include <xercesc\/util\/XMLMsgLoader.hpp>\n#include <xercesc\/util\/XMLString.hpp>\n#include <xercesc\/util\/XMLUniDefs.hpp>\n#include <xercesc\/util\/Janitor.hpp>\n#include \"ICUMsgLoader.hpp\"\n\n#include \"string.h\"\n#include <stdio.h>\n#include <stdlib.h>\n\nXERCES_CPP_NAMESPACE_BEGIN\n\n\/\/ ---------------------------------------------------------------------------\n\/\/ Local static methods\n\/\/ ---------------------------------------------------------------------------\n\n\/\/ ---------------------------------------------------------------------------\n\/\/ Public Constructors and Destructor\n\/\/ ---------------------------------------------------------------------------\nICUMsgLoader::ICUMsgLoader(const XMLCh* const msgDomain)\n:fLocaleBundle(0)\n,fDomainBundle(0)\n{\n \/***\n\t Validate msgDomain\n ***\/\n if (!XMLString::equals(msgDomain, XMLUni::fgXMLErrDomain) &&\n !XMLString::equals(msgDomain, XMLUni::fgExceptDomain) &&\n !XMLString::equals(msgDomain, XMLUni::fgXMLDOMMsgDomain) &&\n !XMLString::equals(msgDomain, XMLUni::fgValidityDomain) )\n {\n XMLPlatformUtils::panic(XMLPlatformUtils::Panic_UnknownMsgDomain);\n }\n\n\t\/***\n\t Resolve domainName\n\t***\/\n\tint index = XMLString::lastIndexOf(msgDomain, chForwardSlash);\n\tchar* domainName = XMLString::transcode(&(msgDomain[index + 1]));\n ArrayJanitor<char> jan1(domainName);\n\n \/***\n\t Resolve location\n\n\t REVISIT: another approach would be: through some system API\n\t\t which returns the directory of the XercescLib and\n\t\t that directory would be used to locate the\n\t\t \t\t resource bundle\n ***\/\n char locationBuf[1024];\n memset(locationBuf, 0, sizeof locationBuf);\n\tchar *nlsHome = getenv(\"XERCESC_NLS_HOME\");\n\n if (nlsHome)\n\t{\n\t\tstrcpy(locationBuf, nlsHome);\n strcat(locationBuf, U_FILE_SEP_STRING);\n\t}\n\n strcat(locationBuf, \"XercescErrMsg\");\n\n\t\/***\n\t Open the locale-specific resource bundle\n\t***\/\n UErrorCode err = U_ZERO_ERROR;\n fLocaleBundle = ures_open(locationBuf, XMLMsgLoader::getLocale(), &err);\n if (!U_SUCCESS(err) || fLocaleBundle == NULL)\n {\n XMLPlatformUtils::panic(XMLPlatformUtils::Panic_CantLoadMsgDomain);\n }\n\n\t\/***\n\t Open the domain specific resource bundle within\n\t\tthe locale-specific resource bundle\n\t***\/\n\terr = U_ZERO_ERROR;\n\tfDomainBundle = ures_getByKey(fLocaleBundle, domainName, NULL, &err);\n\n\tif (!U_SUCCESS(err) || fDomainBundle == NULL)\n\t{\n XMLPlatformUtils::panic(XMLPlatformUtils::Panic_CantLoadMsgDomain);\n\t}\n\n}\n\nICUMsgLoader::~ICUMsgLoader()\n{\n ures_close(fDomainBundle);\n ures_close(fLocaleBundle);\n}\n\n\n\/\/ ---------------------------------------------------------------------------\n\/\/ Implementation of the virtual message loader API\n\/\/ ---------------------------------------------------------------------------\nbool ICUMsgLoader::loadMsg( const XMLMsgLoader::XMLMsgId msgToLoad\n , XMLCh* const toFill\n , const unsigned int maxChars)\n{\n UErrorCode err = U_ZERO_ERROR;\n int32_t strLen = 0;\n\n \/\/ Assuming array format\n const UChar *name = ures_getStringByIndex(fDomainBundle, (int32_t)msgToLoad-1, &strLen, &err);\n\n if (!U_SUCCESS(err) || (name == NULL))\n {\n return false;\n }\n\n int retStrLen = strLen > (int32_t)maxChars ? maxChars : strLen;\n\n if (sizeof(UChar)==sizeof(XMLCh))\n {\n XMLString::moveChars(toFill, (XMLCh*)name, retStrLen);\n toFill[retStrLen] = (XMLCh) 0;\n }\n else\n {\n XMLCh* retStr = toFill;\n const UChar *srcPtr = name;\n\n while (retStrLen--)\n *retStr++ = *srcPtr++;\n\n *retStr = 0;\n }\n\n return true;\n}\n\n\nbool ICUMsgLoader::loadMsg( const XMLMsgLoader::XMLMsgId msgToLoad\n , XMLCh* const toFill\n , const unsigned int maxChars\n , const XMLCh* const repText1\n , const XMLCh* const repText2\n , const XMLCh* const repText3\n , const XMLCh* const repText4)\n{\n \/\/ Call the other version to load up the message\n if (!loadMsg(msgToLoad, toFill, maxChars))\n return false;\n\n \/\/ And do the token replacement\n XMLString::replaceTokens(toFill, maxChars, repText1, repText2, repText3, repText4);\n return true;\n}\n\n\nbool ICUMsgLoader::loadMsg( const XMLMsgLoader::XMLMsgId msgToLoad\n , XMLCh* const toFill\n , const unsigned int maxChars\n , const char* const repText1\n , const char* const repText2\n , const char* const repText3\n , const char* const repText4)\n{\n \/\/\n \/\/ Transcode the provided parameters and call the other version,\n \/\/ which will do the replacement work.\n \/\/\n XMLCh* tmp1 = 0;\n XMLCh* tmp2 = 0;\n XMLCh* tmp3 = 0;\n XMLCh* tmp4 = 0;\n\n bool bRet = false;\n if (repText1)\n tmp1 = XMLString::transcode(repText1);\n if (repText2)\n tmp2 = XMLString::transcode(repText2);\n if (repText3)\n tmp3 = XMLString::transcode(repText3);\n if (repText4)\n tmp4 = XMLString::transcode(repText4);\n\n bRet = loadMsg(msgToLoad, toFill, maxChars, tmp1, tmp2, tmp3, tmp4);\n\n if (tmp1)\n delete [] tmp1;\n if (tmp2)\n delete [] tmp2;\n if (tmp3)\n delete [] tmp3;\n if (tmp4)\n delete [] tmp4;\n\n return bRet;\n}\n\nXERCES_CPP_NAMESPACE_END\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\n#include <iostream>\n#include <string>\n\n#include <nomlib\/graphics.hpp>\n#include <nomlib\/gui.hpp>\n#include <nomlib\/system.hpp>\n\n\/\/\/ File path name of the resources directory; this must be a relative file path.\nconst std::string APP_RESOURCES_DIR = \"Resources\";\n\nconst nom::Path p;\nconst std::string RESOURCE_ICON = APP_RESOURCES_DIR + p.native() + \"icon.png\";\nconst std::string RESOURCE_BITMAP_FONT = APP_RESOURCES_DIR + p.native() + \"VIII.png\";\nconst std::string RESOURCE_BITMAP_SMALL_FONT = APP_RESOURCES_DIR + p.native() + \"VIII_small.png\";\nconst std::string RESOURCE_TRUETYPE_FONT = APP_RESOURCES_DIR + p.native() + \"arial.ttf\";\n\n\/\/\/ Name of our application.\nconst std::string APP_NAME = \"nom::BitmapFont\";\n\n\/\/\/ Width, in pixels, of our effective rendering surface.\nconst nom::int32 WINDOW_WIDTH = 768;\n\n\/\/\/ Height, in pixels, of our effective rendering surface.\nconst nom::int32 WINDOW_HEIGHT = 448;\n\n\/\/\/ Relative filename path to saved screenshot example\n\/\/\/\n\/\/\/ Default path should resolve to the same directory as the app example\n\/\/\/ executable\nconst std::string OUTPUT_SCREENSHOT_FILENAME = \"screenshot.png\";\n\n\/\/const std::string RESOURCE_FONT_TEXT_STRING = \"!\"#$%&'()*+,-.\/\/0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\\]^_`abcdefghijklmnopqrstuvwxyz{|}~\";\nconst std::string RESOURCE_FONT_TEXT_STRING = \"ABCDEFGHIJKLMNOPQRSTUVWXYZ\\nabcdefghijklmnopqrstuvwxyz\\n0123456789\\n...\\n,'[]()\/\\\\n\";\n\n\/\/\/ \\brief nom::BitmapFont usage example\nclass App: public nom::SDL_App\n{\n public:\n App ( nom::int32 argc, char* argv[] )\n {\n NOM_LOG_TRACE ( NOM );\n\n \/\/ Fatal error; if we are not able to complete this step, it means that\n \/\/ we probably cannot rely on our resource paths!\n if ( nom::nomlib_init ( argc, argv ) == false )\n {\n nom::DialogMessageBox ( APP_NAME, \"Could not initialize nomlib.\" );\n exit ( NOM_EXIT_FAILURE );\n }\n } \/\/ App\n\n ~App ( void )\n {\n NOM_LOG_TRACE ( NOM );\n } \/\/ ~App\n\n bool onInit ( void )\n {\n nom::uint32 window_flags = 0; \/\/SDL_WINDOW_RESIZABLE\n if ( nom::set_hint ( SDL_HINT_RENDER_VSYNC, \"0\" ) == false )\n {\nNOM_LOG_INFO ( NOM, \"Could not disable vertical refresh.\" );\n }\n\/*\n if ( nom::set_hint ( SDL_HINT_RENDER_SCALE_QUALITY, \"Nearest\" ) == false )\n {\n NOM_LOG_INFO ( NOM, \"Could not set scale quality.\" );\n }\n*\/\n if ( this->window.create ( APP_NAME, WINDOW_WIDTH, WINDOW_HEIGHT, window_flags ) == false )\n {\n return false;\n }\n this->window_size = this->window.size();\n\n if ( this->window.set_window_icon ( RESOURCE_ICON ) == false )\n {\n nom::DialogMessageBox ( APP_NAME, \"Could not load window icon: \" + RESOURCE_ICON );\n return false;\n }\n\n if ( this->bitmap_font.load ( RESOURCE_BITMAP_FONT, NOM_COLOR4U_MAGENTA ) == false )\n {\n nom::DialogMessageBox ( APP_NAME, \"Could not load BitmapFont: \" + RESOURCE_BITMAP_FONT );\n return false;\n }\n\n if ( this->bitmap_small_font.load ( RESOURCE_BITMAP_SMALL_FONT, NOM_COLOR4U_MAGENTA ) == false )\n {\n nom::DialogMessageBox ( APP_NAME, \"Could not load BitmapFont: \" + RESOURCE_BITMAP_SMALL_FONT );\n return false;\n }\n\n if ( this->truetype_font.load ( RESOURCE_TRUETYPE_FONT, NOM_COLOR4U_WHITE ) == false )\n {\n nom::DialogMessageBox ( APP_NAME, \"Could not load TrueTypeFont: \" + RESOURCE_TRUETYPE_FONT );\n return false;\n }\n\n\/*\n this->truetype_font.setFontSize ( 18 );\n this->truetype_font.setRenderingStyle ( nom::IFont::RenderStyle::Blended );\n this->truetype_font.setColor ( NOM_COLOR4U_WHITE );\n this->truetype_font.setText ( \"Use arrow keys to change cursor!\" );\n this->truetype_font.setPosition ( nom::Coords ( ( window_size.x - 200 ) \/ 2, window_size.y - 100 ) );\n*\/\n\nNOM_DUMP_VAR(this->label.type());\nNOM_DUMP_VAR(this->label_title.type());\n this->label.set_font ( this->bitmap_font );\n this->label_title.set_font ( this->bitmap_small_font );\n\n this->label.set_position ( ( this->window_size.x - this->label.width() ) \/ 2,\n ( this->window_size.y - this->label.height() ) \/ 2\n );\n\n this->label_title.set_position ( ( this->window_size.x - this->label_title.width() ) \/ 2,\n ( this->window_size.y - this->label_title.height() ) \/ 8\n );\n\n this->label.set_text ( RESOURCE_FONT_TEXT_STRING );\n \/\/this->label_title.set_text ( \"INFO\" );\n this->label.set_color ( NOM_COLOR4U_WHITE );\n this->label_title.set_color ( NOM_COLOR4U_RED );\n \/\/this->label.set_style ( nom::Label::FontStyle::Faded );\n this->label.set_alignment ( nom::Label::TextAlignment::MiddleCenter );\n \/\/this->label_title.set_alignment ( nom::Label::TextAlignment::MiddleLeft );\nNOM_DUMP_VAR(this->label.type());\nNOM_DUMP_VAR(this->label_title.type());\n\n return true;\n } \/\/ onInit\n\n nom::int32 Run ( void )\n {\n this->update.start();\n this->fps.start();\n\n \/\/ 1. Events\n \/\/ 2. Logic\n \/\/ 3. Render\n while ( this->running() == true )\n {\n while ( this->PollEvents ( &this->event ) )\n {\n this->onEvent ( &this->event );\n }\n\n this->window.update();\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->show_fps() == true )\n {\n this->window.set_window_title ( APP_NAME + \" - \" + this->fps.asString() + ' ' + \"fps\" );\n }\n else\n {\n this->window.set_window_title ( APP_NAME + \" [\" + std::to_string(this->window.window_id()) + \"]\" + \" - \" + \"Display\" + ' ' + std::to_string ( this->window.window_display_id() ) );\n }\n\n this->update.restart();\n } \/\/ end refresh cycle\n\n this->window.fill ( NOM_COLOR4U_PRIMARY_COLORKEY );\n\n this->label.draw ( this->window );\n this->label_title.draw ( this->window );\n } \/\/ end while SDL_App::running() is true\n\n return NOM_EXIT_SUCCESS;\n } \/\/ Run\n\n private:\n \/\/\/ Event handler for key down actions\n \/\/\/\n \/\/\/ Re-implements nom::Input::onKeyDown()\n void onKeyDown ( nom::int32 key, nom::int32 mod, nom::uint32 window_id )\n {\n switch ( key )\n {\n default: break;\n\n \/\/ Use inherited SDL_App::onQuit() method -- you may also provide your own\n \/\/ event handler for this.\n case SDLK_ESCAPE:\n case SDLK_q: this->onQuit(); break;\n\n case SDLK_BACKSLASH:\n {\n if ( this->toggle_fps() )\n {\n \/\/ Stub for doing something cool here\n }\n else\n {\n \/\/ Stub for doing something cool here\n }\n break;\n }\n\n case SDLK_F1:\n {\n if ( this->window.save_screenshot( OUTPUT_SCREENSHOT_FILENAME ) == false )\n {\n nom::DialogMessageBox( APP_NAME, \"Could not save screenshot\");\n }\n break;\n }\n\n case SDLK_f:\n {\n if ( this->window.fullscreen() == true )\n {\n this->window.toggle_fullscreen();\n }\n else if ( this->window.fullscreen() == false )\n {\n this->window.toggle_fullscreen();\n\n \/\/ Scale window contents up by the new width & height\n this->window.set_logical_size ( this->window_size.x, this->window_size.y );\n }\n }\n break;\n } \/\/ end switch key\n } \/\/ onKeyDown\n\n private:\n \/\/\/ Window handle\n nom::Window window;\n nom::Point2i window_size;\n\n \/\/\/ Interval at which we refresh the frames per second counter\n nom::Timer update;\n\n \/\/\/ Timer for tracking frames per second\n nom::FPS fps;\n\n \/\/\/ Input events\n Input::Event event;\n\n nom::BitmapFont bitmap_font;\n nom::BitmapFont bitmap_small_font;\n\n nom::TrueTypeFont truetype_font;\n\n nom::Label label;\n nom::Label label_title;\n}; \/\/ class App\n\nnom::int32 main ( nom::int32 argc, char* argv[] )\n{\n App game ( argc, argv );\n\n if ( game.onInit() == false )\n {\n nom::DialogMessageBox ( APP_NAME, \"Could not initialize application.\" );\n return NOM_EXIT_FAILURE;\n }\n\n return game.Run();\n\n \/\/ ...Goodbye cruel world..!\n}\n<commit_msg>examples\/fonts: Disable loading of small bitmap font<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\n#include <iostream>\n#include <string>\n\n#include <nomlib\/graphics.hpp>\n#include <nomlib\/gui.hpp>\n#include <nomlib\/system.hpp>\n\n\/\/\/ File path name of the resources directory; this must be a relative file path.\nconst std::string APP_RESOURCES_DIR = \"Resources\";\n\nconst nom::Path p;\nconst std::string RESOURCE_ICON = APP_RESOURCES_DIR + p.native() + \"icon.png\";\nconst std::string RESOURCE_BITMAP_FONT = APP_RESOURCES_DIR + p.native() + \"VIII.png\";\nconst std::string RESOURCE_BITMAP_SMALL_FONT = APP_RESOURCES_DIR + p.native() + \"VIII_small.png\";\nconst std::string RESOURCE_TRUETYPE_FONT = APP_RESOURCES_DIR + p.native() + \"arial.ttf\";\n\n\/\/\/ Name of our application.\nconst std::string APP_NAME = \"nom::BitmapFont\";\n\n\/\/\/ Width, in pixels, of our effective rendering surface.\nconst nom::int32 WINDOW_WIDTH = 768;\n\n\/\/\/ Height, in pixels, of our effective rendering surface.\nconst nom::int32 WINDOW_HEIGHT = 448;\n\n\/\/\/ Relative filename path to saved screenshot example\n\/\/\/\n\/\/\/ Default path should resolve to the same directory as the app example\n\/\/\/ executable\nconst std::string OUTPUT_SCREENSHOT_FILENAME = \"screenshot.png\";\n\n\/\/const std::string RESOURCE_FONT_TEXT_STRING = \"!\"#$%&'()*+,-.\/\/0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\\]^_`abcdefghijklmnopqrstuvwxyz{|}~\";\nconst std::string RESOURCE_FONT_TEXT_STRING = \"ABCDEFGHIJKLMNOPQRSTUVWXYZ\\nabcdefghijklmnopqrstuvwxyz\\n0123456789\\n...\\n,'[]()\/\\\\n\";\n\/\/const std::string RESOURCE_FONT_TEXT_STRING = \"A\";\n\n\/\/\/ \\brief nom::BitmapFont usage example\nclass App: public nom::SDL_App\n{\n public:\n App ( nom::int32 argc, char* argv[] )\n {\n NOM_LOG_TRACE ( NOM );\n\n \/\/ Fatal error; if we are not able to complete this step, it means that\n \/\/ we probably cannot rely on our resource paths!\n if ( nom::nomlib_init ( argc, argv ) == false )\n {\n nom::DialogMessageBox ( APP_NAME, \"Could not initialize nomlib.\" );\n exit ( NOM_EXIT_FAILURE );\n }\n } \/\/ App\n\n ~App ( void )\n {\n NOM_LOG_TRACE ( NOM );\n } \/\/ ~App\n\n bool onInit ( void )\n {\n nom::uint32 window_flags = 0; \/\/SDL_WINDOW_RESIZABLE\n if ( nom::set_hint ( SDL_HINT_RENDER_VSYNC, \"0\" ) == false )\n {\nNOM_LOG_INFO ( NOM, \"Could not disable vertical refresh.\" );\n }\n\/*\n if ( nom::set_hint ( SDL_HINT_RENDER_SCALE_QUALITY, \"Nearest\" ) == false )\n {\n NOM_LOG_INFO ( NOM, \"Could not set scale quality.\" );\n }\n*\/\n if ( this->window.create ( APP_NAME, WINDOW_WIDTH, WINDOW_HEIGHT, window_flags ) == false )\n {\n return false;\n }\n this->window_size = this->window.size();\n\n if ( this->window.set_window_icon ( RESOURCE_ICON ) == false )\n {\n nom::DialogMessageBox ( APP_NAME, \"Could not load window icon: \" + RESOURCE_ICON );\n return false;\n }\n\n if ( this->bitmap_font.load ( RESOURCE_BITMAP_FONT, NOM_COLOR4U_MAGENTA ) == false )\n {\n nom::DialogMessageBox ( APP_NAME, \"Could not load BitmapFont: \" + RESOURCE_BITMAP_FONT );\n return false;\n }\n\/*\n if ( this->bitmap_small_font.load ( RESOURCE_BITMAP_SMALL_FONT, NOM_COLOR4U_MAGENTA ) == false )\n {\n nom::DialogMessageBox ( APP_NAME, \"Could not load BitmapFont: \" + RESOURCE_BITMAP_SMALL_FONT );\n return false;\n }\n*\/\n if ( this->truetype_font.load ( RESOURCE_TRUETYPE_FONT, NOM_COLOR4U_WHITE ) == false )\n {\n nom::DialogMessageBox ( APP_NAME, \"Could not load TrueTypeFont: \" + RESOURCE_TRUETYPE_FONT );\n return false;\n }\n\n\/*\n this->truetype_font.setFontSize ( 18 );\n this->truetype_font.setRenderingStyle ( nom::IFont::RenderStyle::Blended );\n this->truetype_font.setColor ( NOM_COLOR4U_WHITE );\n this->truetype_font.setText ( \"Use arrow keys to change cursor!\" );\n this->truetype_font.setPosition ( nom::Coords ( ( window_size.x - 200 ) \/ 2, window_size.y - 100 ) );\n*\/\n\nNOM_DUMP_VAR(this->label.type());\nNOM_DUMP_VAR(this->label_title.type());\n this->label.set_font ( this->bitmap_font );\n \/\/this->label_title.set_font ( this->bitmap_small_font );\n\n this->label.set_position ( ( this->window_size.x - this->label.width() ) \/ 2,\n ( this->window_size.y - this->label.height() ) \/ 2\n );\n\/*\n this->label_title.set_position ( ( this->window_size.x - this->label_title.width() ) \/ 2,\n ( this->window_size.y - this->label_title.height() ) \/ 8\n );\n*\/\n this->label.set_text ( RESOURCE_FONT_TEXT_STRING );\n \/\/this->label_title.set_text ( \"INFO\" );\n this->label.set_color ( NOM_COLOR4U_WHITE );\n \/\/this->label_title.set_color ( NOM_COLOR4U_RED );\n \/\/this->label.set_style ( nom::Label::FontStyle::Faded );\n this->label.set_alignment ( nom::Label::TextAlignment::MiddleCenter );\n \/\/this->label_title.set_alignment ( nom::Label::TextAlignment::MiddleLeft );\nNOM_DUMP_VAR(this->label.type());\nNOM_DUMP_VAR(this->label_title.type());\n\n return true;\n } \/\/ onInit\n\n nom::int32 Run ( void )\n {\n this->update.start();\n this->fps.start();\n\n \/\/ 1. Events\n \/\/ 2. Logic\n \/\/ 3. Render\n while ( this->running() == true )\n {\n while ( this->PollEvents ( &this->event ) )\n {\n this->onEvent ( &this->event );\n }\n\n this->window.update();\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->show_fps() == true )\n {\n this->window.set_window_title ( APP_NAME + \" - \" + this->fps.asString() + ' ' + \"fps\" );\n }\n else\n {\n this->window.set_window_title ( APP_NAME + \" [\" + std::to_string(this->window.window_id()) + \"]\" + \" - \" + \"Display\" + ' ' + std::to_string ( this->window.window_display_id() ) );\n }\n\n this->update.restart();\n } \/\/ end refresh cycle\n\n this->window.fill ( NOM_COLOR4U_PRIMARY_COLORKEY );\n this->label.draw ( this->window );\n\n \/\/this->label_title.draw ( this->window );\n } \/\/ end while SDL_App::running() is true\n\n return NOM_EXIT_SUCCESS;\n } \/\/ Run\n\n private:\n \/\/\/ Event handler for key down actions\n \/\/\/\n \/\/\/ Re-implements nom::Input::onKeyDown()\n void onKeyDown ( nom::int32 key, nom::int32 mod, nom::uint32 window_id )\n {\n switch ( key )\n {\n default: break;\n\n \/\/ Use inherited SDL_App::onQuit() method -- you may also provide your own\n \/\/ event handler for this.\n case SDLK_ESCAPE:\n case SDLK_q: this->onQuit(); break;\n\n case SDLK_BACKSLASH:\n {\n if ( this->toggle_fps() )\n {\n \/\/ Stub for doing something cool here\n }\n else\n {\n \/\/ Stub for doing something cool here\n }\n break;\n }\n\n case SDLK_F1:\n {\n if ( this->window.save_screenshot( OUTPUT_SCREENSHOT_FILENAME ) == false )\n {\n nom::DialogMessageBox( APP_NAME, \"Could not save screenshot\");\n }\n break;\n }\n\n case SDLK_f:\n {\n if ( this->window.fullscreen() == true )\n {\n this->window.toggle_fullscreen();\n }\n else if ( this->window.fullscreen() == false )\n {\n this->window.toggle_fullscreen();\n\n \/\/ Scale window contents up by the new width & height\n this->window.set_logical_size ( this->window_size.x, this->window_size.y );\n }\n }\n break;\n } \/\/ end switch key\n } \/\/ onKeyDown\n\n private:\n \/\/\/ Window handle\n nom::Window window;\n nom::Point2i window_size;\n\n \/\/\/ Interval at which we refresh the frames per second counter\n nom::Timer update;\n\n \/\/\/ Timer for tracking frames per second\n nom::FPS fps;\n\n \/\/\/ Input events\n Input::Event event;\n\n nom::BitmapFont bitmap_font;\n nom::BitmapFont bitmap_small_font;\n\n nom::TrueTypeFont truetype_font;\n\n nom::Label label;\n nom::Label label_title;\n}; \/\/ class App\n\nnom::int32 main ( nom::int32 argc, char* argv[] )\n{\n App game ( argc, argv );\n\n if ( game.onInit() == false )\n {\n nom::DialogMessageBox ( APP_NAME, \"Could not initialize application.\" );\n return NOM_EXIT_FAILURE;\n }\n\n return game.Run();\n\n \/\/ ...Goodbye cruel world..!\n}\n<|endoftext|>"} {"text":"<commit_before>\/\/\n\/\/ Copyright (C) 2013 Mateusz Łoskot <mateusz@loskot.net>\n\/\/ Copyright (C) 2013 Digia Plc and\/or its subsidiary(-ies).\n\/\/\n\/\/ This file is part of Qt Creator Boost.Build plugin project.\n\/\/\n\/\/ This is free software; you can redistribute and\/or modify it under\n\/\/ the terms of the GNU Lesser General Public License, Version 2.1\n\/\/ as published by the Free Software Foundation.\n\/\/ See accompanying file LICENSE.txt or copy at \n\/\/ http:\/\/www.gnu.org\/licenses\/lgpl-2.1-standalone.html.\n\/\/\n#include \"bbprojectnode.hpp\"\n#include \"bbproject.hpp\"\n#include \"bbutility.hpp\"\n\/\/ Qt Creator\n#include <coreplugin\/idocument.h>\n#include <projectexplorer\/projectnodes.h>\n#include <utils\/qtcassert.h>\n\/\/ Qt\n#include <QFutureInterface>\n#include <QHash>\n#include <QList>\n#include <QSet>\n#include <QString>\n#include <QStringList>\n\nnamespace BoostBuildProjectManager {\nnamespace Internal {\n\nProjectNode::ProjectNode(Project* project, Core::IDocument* projectFile)\n : ProjectExplorer::ProjectNode(projectFile->filePath().toString())\n , project_(project)\n , projectFile_(projectFile)\n{\n \/\/ TODO: setDisplayName(QFileInfo(projectFile->filePath()).completeBaseName());\n}\n\nbool ProjectNode::hasBuildTargets() const\n{\n return false;\n}\n\nQList<ProjectExplorer::ProjectAction>\nProjectNode::supportedActions(Node* node) const\n{\n Q_UNUSED(node);\n\n \/\/ TODO: Jamfiles (auto)editing not supported, does it make sense to manage files?\n return QList<ProjectExplorer::ProjectAction>();\n}\n\nbool ProjectNode::canAddSubProject(QString const& filePath) const\n{\n Q_UNUSED(filePath)\n return false;\n}\n\nbool ProjectNode::addSubProjects(QStringList const& filePaths)\n{\n Q_UNUSED(filePaths)\n return false;\n}\n\nbool ProjectNode::removeSubProjects(QStringList const& filePath)\n{\n Q_UNUSED(filePath)\n return false;\n}\n\nbool ProjectNode::addFiles(QStringList const& filePaths, QStringList* notAdded = 0)\n{\n Q_UNUSED(filePaths);\n Q_UNUSED(notAdded);\n return false;\n}\n\nbool ProjectNode::removeFiles(QStringList const& filePaths, QStringList* notRemoved = 0)\n{\n Q_UNUSED(filePaths);\n Q_UNUSED(notRemoved);\n return false;\n}\n\nbool ProjectNode::deleteFiles(QStringList const& filePaths)\n{\n Q_UNUSED(filePaths);\n return false;\n}\n\nbool ProjectNode::renameFile(QString const& filePath, QString const& newFilePath)\n{\n Q_UNUSED(filePath);\n Q_UNUSED(newFilePath);\n return false;\n}\n\nQList<ProjectExplorer::RunConfiguration*> ProjectNode::runConfigurationsFor(Node* node)\n{\n Q_UNUSED(node);\n return QList<ProjectExplorer::RunConfiguration*>();\n}\n\nvoid ProjectNode::refresh(QSet<QString> oldFileList)\n{\n \/\/ The idea of refreshing files in project explorer taken from GenericProjectManager\n\n \/\/ Only do this once, at first run.\n if (oldFileList.isEmpty())\n {\n using ProjectExplorer::FileNode;\n FileNode* projectFileNode = new FileNode(project_->projectFilePath().toString()\n , ProjectExplorer::ProjectFileType\n , Constants::FileNotGenerated);\n\n FileNode* filesFileNode = new FileNode(project_->filesFilePath()\n , ProjectExplorer::ProjectFileType\n , Constants::FileNotGenerated);\n\n FileNode* includesFileNode = new FileNode(project_->includesFilePath()\n , ProjectExplorer::ProjectFileType\n , Constants::FileNotGenerated);\n\n addFileNodes(QList<FileNode*>()\n << projectFileNode << filesFileNode << includesFileNode);\n }\n\n oldFileList.remove(project_->filesFilePath());\n oldFileList.remove(project_->includesFilePath());\n\n QSet<QString> newFileList = project_->files().toSet();\n newFileList.remove(project_->filesFilePath());\n newFileList.remove(project_->includesFilePath());\n\n \/\/ Calculate set of added and removed files\n QSet<QString> removed = oldFileList;\n removed.subtract(newFileList);\n QSet<QString> added = newFileList;\n added.subtract(oldFileList);\n\n typedef QHash<QString, QStringList> FilesInPaths;\n typedef FilesInPaths::ConstIterator FilesInPathsIterator;\n using ProjectExplorer::FileNode;\n using ProjectExplorer::FileType;\n QString const baseDir = QFileInfo(path()).absolutePath();\n\n \/\/ Process all added files\n FilesInPaths filesInPaths = Utility::sortFilesIntoPaths(baseDir, added);\n for (FilesInPathsIterator it = filesInPaths.constBegin(),\n cend = filesInPaths.constEnd(); it != cend; ++it)\n {\n \/\/ Create node\n QString const& filePath = it.key();\n QStringList parts;\n if (!filePath.isEmpty())\n parts = filePath.split(QLatin1Char('\/'));\n\n FolderNode* folder = findFolderByName(parts, parts.size());\n if (!folder)\n folder = createFolderByName(parts, parts.size());\n\n \/\/ Attach content to node\n QList<FileNode*> fileNodes;\n foreach (QString const& file, it.value())\n {\n \/\/ TODO: handle various types, mime to FileType\n FileType fileType = ProjectExplorer::SourceType;\n FileNode* fileNode = new FileNode(file, fileType, Constants::FileNotGenerated);\n fileNodes.append(fileNode);\n }\n\n addFileNodes(fileNodes);\n }\n\n \/\/ Process all removed files\n filesInPaths = Utility::sortFilesIntoPaths(baseDir, removed);\n for (FilesInPathsIterator it = filesInPaths.constBegin(),\n cend = filesInPaths.constEnd(); it != cend; ++it)\n {\n \/\/ Create node\n QString const& filePath = it.key();\n QStringList parts;\n if (!filePath.isEmpty())\n parts = filePath.split(QLatin1Char('\/'));\n FolderNode* folder = findFolderByName(parts, parts.size());\n\n QList<FileNode*> fileNodes;\n foreach (QString const& file, it.value())\n {\n foreach (FileNode* fn, folder->fileNodes())\n if (fn->path() == file)\n fileNodes.append(fn);\n }\n\n removeFileNodes(fileNodes);\n }\n\n \/\/ Clean up\n foreach (FolderNode* fn, subFolderNodes())\n removeEmptySubFolders(this, fn);\n\n}\n\nvoid ProjectNode::removeEmptySubFolders(FolderNode* parent, FolderNode* subParent)\n{\n foreach (FolderNode* fn, subParent->subFolderNodes())\n removeEmptySubFolders(subParent, fn);\n\n if (subParent->subFolderNodes().isEmpty() && subParent->fileNodes().isEmpty())\n removeFolderNodes(QList<FolderNode*>() << subParent);\n}\n\nQString appendPathComponents(QStringList const& components, int const end)\n{\n QString folderName;\n for (int i = 0; i < end; ++i)\n {\n folderName.append(components.at(i));\n folderName += QLatin1Char('\/');\n }\n return folderName;\n}\n\nProjectExplorer::FolderNode*\nProjectNode::createFolderByName(QStringList const& components, int const end)\n{\n if (end == 0)\n return this;\n\n using ProjectExplorer::FolderNode;\n QString const baseDir = QFileInfo(path()).path();\n QString const folderName = appendPathComponents(components, end);\n FolderNode* folder = new FolderNode(baseDir + QLatin1Char('\/') + folderName);\n folder->setDisplayName(components.at(end - 1));\n\n FolderNode* parent = findFolderByName(components, end - 1);\n if (!parent)\n parent = createFolderByName(components, end - 1);\n addFolderNodes(QList<FolderNode*>() << folder);\n\n return folder;\n}\n\nProjectExplorer::FolderNode*\nProjectNode::findFolderByName(QStringList const& components, int const end) const\n{\n if (end == 0)\n return const_cast<ProjectNode*>(this);\n\n using ProjectExplorer::FolderNode;\n FolderNode *parent = findFolderByName(components, end - 1);\n if (!parent)\n return 0;\n\n QString const folderName = appendPathComponents(components, end);\n QString const baseDir = QFileInfo(path()).path();\n foreach (FolderNode* fn, parent->subFolderNodes())\n {\n if (fn->path() == baseDir + QLatin1Char('\/') + folderName)\n return fn;\n }\n\n return 0;\n}\n\n} \/\/ namespace Internal\n} \/\/ namespace BoostBuildProjectManager\n<commit_msg>Clarify conversions between QString and Utils::FileName<commit_after>\/\/\n\/\/ Copyright (C) 2013 Mateusz Łoskot <mateusz@loskot.net>\n\/\/ Copyright (C) 2013 Digia Plc and\/or its subsidiary(-ies).\n\/\/\n\/\/ This file is part of Qt Creator Boost.Build plugin project.\n\/\/\n\/\/ This is free software; you can redistribute and\/or modify it under\n\/\/ the terms of the GNU Lesser General Public License, Version 2.1\n\/\/ as published by the Free Software Foundation.\n\/\/ See accompanying file LICENSE.txt or copy at \n\/\/ http:\/\/www.gnu.org\/licenses\/lgpl-2.1-standalone.html.\n\/\/\n#include \"bbprojectnode.hpp\"\n#include \"bbproject.hpp\"\n#include \"bbutility.hpp\"\n\/\/ Qt Creator\n#include <coreplugin\/idocument.h>\n#include <projectexplorer\/projectnodes.h>\n#include <utils\/qtcassert.h>\n\/\/ Qt\n#include <QFutureInterface>\n#include <QHash>\n#include <QList>\n#include <QSet>\n#include <QString>\n#include <QStringList>\n\nnamespace BoostBuildProjectManager {\nnamespace Internal {\n\nProjectNode::ProjectNode(Project* project, Core::IDocument* projectFile)\n : ProjectExplorer::ProjectNode(projectFile->filePath())\n , project_(project)\n , projectFile_(projectFile)\n{\n \/\/ TODO: setDisplayName(QFileInfo(projectFile->filePath()).completeBaseName());\n}\n\nbool ProjectNode::hasBuildTargets() const\n{\n return false;\n}\n\nQList<ProjectExplorer::ProjectAction>\nProjectNode::supportedActions(Node* node) const\n{\n Q_UNUSED(node);\n\n \/\/ TODO: Jamfiles (auto)editing not supported, does it make sense to manage files?\n return QList<ProjectExplorer::ProjectAction>();\n}\n\nbool ProjectNode::canAddSubProject(QString const& filePath) const\n{\n Q_UNUSED(filePath)\n return false;\n}\n\nbool ProjectNode::addSubProjects(QStringList const& filePaths)\n{\n Q_UNUSED(filePaths)\n return false;\n}\n\nbool ProjectNode::removeSubProjects(QStringList const& filePath)\n{\n Q_UNUSED(filePath)\n return false;\n}\n\nbool ProjectNode::addFiles(QStringList const& filePaths, QStringList* notAdded = 0)\n{\n Q_UNUSED(filePaths);\n Q_UNUSED(notAdded);\n return false;\n}\n\nbool ProjectNode::removeFiles(QStringList const& filePaths, QStringList* notRemoved = 0)\n{\n Q_UNUSED(filePaths);\n Q_UNUSED(notRemoved);\n return false;\n}\n\nbool ProjectNode::deleteFiles(QStringList const& filePaths)\n{\n Q_UNUSED(filePaths);\n return false;\n}\n\nbool ProjectNode::renameFile(QString const& filePath, QString const& newFilePath)\n{\n Q_UNUSED(filePath);\n Q_UNUSED(newFilePath);\n return false;\n}\n\nQList<ProjectExplorer::RunConfiguration*> ProjectNode::runConfigurationsFor(Node* node)\n{\n Q_UNUSED(node);\n return QList<ProjectExplorer::RunConfiguration*>();\n}\n\nvoid ProjectNode::refresh(QSet<QString> oldFileList)\n{\n \/\/ The idea of refreshing files in project explorer taken from GenericProjectManager\n\n \/\/ Only do this once, at first run.\n if (oldFileList.isEmpty())\n {\n using ProjectExplorer::FileNode;\n FileNode* projectFileNode = new FileNode(project_->projectFilePath()\n , ProjectExplorer::ProjectFileType\n , Constants::FileNotGenerated);\n\n FileNode* filesFileNode = new FileNode(Utils::FileName::fromString(project_->filesFilePath())\n , ProjectExplorer::ProjectFileType\n , Constants::FileNotGenerated);\n\n FileNode* includesFileNode = new FileNode(Utils::FileName::fromString(project_->includesFilePath())\n , ProjectExplorer::ProjectFileType\n , Constants::FileNotGenerated);\n\n addFileNodes(QList<FileNode*>()\n << projectFileNode << filesFileNode << includesFileNode);\n }\n\n oldFileList.remove(project_->filesFilePath());\n oldFileList.remove(project_->includesFilePath());\n\n QSet<QString> newFileList = project_->files().toSet();\n newFileList.remove(project_->filesFilePath());\n newFileList.remove(project_->includesFilePath());\n\n \/\/ Calculate set of added and removed files\n QSet<QString> removed = oldFileList;\n removed.subtract(newFileList);\n QSet<QString> added = newFileList;\n added.subtract(oldFileList);\n\n typedef QHash<QString, QStringList> FilesInPaths;\n typedef FilesInPaths::ConstIterator FilesInPathsIterator;\n using ProjectExplorer::FileNode;\n using ProjectExplorer::FileType;\n QString const baseDir = QFileInfo(path().toString()).absolutePath();\n\n \/\/ Process all added files\n FilesInPaths filesInPaths = Utility::sortFilesIntoPaths(baseDir, added);\n for (FilesInPathsIterator it = filesInPaths.constBegin(),\n cend = filesInPaths.constEnd(); it != cend; ++it)\n {\n \/\/ Create node\n QString const& filePath = it.key();\n QStringList parts;\n if (!filePath.isEmpty())\n parts = filePath.split(QLatin1Char('\/'));\n\n FolderNode* folder = findFolderByName(parts, parts.size());\n if (!folder)\n folder = createFolderByName(parts, parts.size());\n\n \/\/ Attach content to node\n QList<FileNode*> fileNodes;\n foreach (QString const& file, it.value())\n {\n \/\/ TODO: handle various types, mime to FileType\n FileType fileType = ProjectExplorer::SourceType;\n FileNode* fileNode = new FileNode(Utils::FileName::fromString(file), fileType, Constants::FileNotGenerated);\n fileNodes.append(fileNode);\n }\n\n addFileNodes(fileNodes);\n }\n\n \/\/ Process all removed files\n filesInPaths = Utility::sortFilesIntoPaths(baseDir, removed);\n for (FilesInPathsIterator it = filesInPaths.constBegin(),\n cend = filesInPaths.constEnd(); it != cend; ++it)\n {\n \/\/ Create node\n QString const& filePath = it.key();\n QStringList parts;\n if (!filePath.isEmpty())\n parts = filePath.split(QLatin1Char('\/'));\n FolderNode* folder = findFolderByName(parts, parts.size());\n\n QList<FileNode*> fileNodes;\n foreach (QString const& file, it.value())\n {\n foreach (FileNode* fn, folder->fileNodes())\n if (fn->path() == Utils::FileName::fromString(file))\n fileNodes.append(fn);\n }\n\n removeFileNodes(fileNodes);\n }\n\n \/\/ Clean up\n foreach (FolderNode* fn, subFolderNodes())\n removeEmptySubFolders(this, fn);\n\n}\n\nvoid ProjectNode::removeEmptySubFolders(FolderNode* parent, FolderNode* subParent)\n{\n foreach (FolderNode* fn, subParent->subFolderNodes())\n removeEmptySubFolders(subParent, fn);\n\n if (subParent->subFolderNodes().isEmpty() && subParent->fileNodes().isEmpty())\n removeFolderNodes(QList<FolderNode*>() << subParent);\n}\n\nQString appendPathComponents(QStringList const& components, int const end)\n{\n QString folderName;\n for (int i = 0; i < end; ++i)\n {\n folderName.append(components.at(i));\n folderName += QLatin1Char('\/');\n }\n return folderName;\n}\n\nProjectExplorer::FolderNode*\nProjectNode::createFolderByName(QStringList const& components, int const end)\n{\n if (end == 0)\n return this;\n\n using ProjectExplorer::FolderNode;\n QString const baseDir = QFileInfo(path().toString()).path();\n QString const folderName = appendPathComponents(components, end);\n FolderNode* folder = new FolderNode(Utils::FileName::fromString(baseDir + QLatin1Char('\/') + folderName));\n folder->setDisplayName(components.at(end - 1));\n\n FolderNode* parent = findFolderByName(components, end - 1);\n if (!parent)\n parent = createFolderByName(components, end - 1);\n addFolderNodes(QList<FolderNode*>() << folder);\n\n return folder;\n}\n\nProjectExplorer::FolderNode*\nProjectNode::findFolderByName(QStringList const& components, int const end) const\n{\n if (end == 0)\n return const_cast<ProjectNode*>(this);\n\n using ProjectExplorer::FolderNode;\n FolderNode *parent = findFolderByName(components, end - 1);\n if (!parent)\n return 0;\n\n QString const folderName = appendPathComponents(components, end);\n QString const baseDir = QFileInfo(path().toString()).path();\n foreach (FolderNode* fn, parent->subFolderNodes())\n {\n if (fn->path() == Utils::FileName::fromString(baseDir + QLatin1Char('\/') + folderName))\n return fn;\n }\n\n return 0;\n}\n\n} \/\/ namespace Internal\n} \/\/ namespace BoostBuildProjectManager\n<|endoftext|>"} {"text":"<commit_before>#include \"bochs.h\"\n\nbx_iodebug_c bx_iodebug;\nbx_iodebug_c *bx_iodebug_ptr;\n\n struct bx_iodebug_s_type {\n Boolean enabled;\n unsigned int register_select;\n Bit32u registers[2];\n Bit32u monitored_mem_areas_start[BX_IODEBUG_MAX_AREAS];\n Bit32u monitored_mem_areas_end[BX_IODEBUG_MAX_AREAS];\n } bx_iodebug_s;\n\n\n\n\n\/\/ Constructor\nbx_iodebug_c::bx_iodebug_c( void )\n{\n put(\"IODEBUG\");\n settype(IODEBUGLOG);\n\n}\n\n\n\n\n\n\/\/ Destructor\nbx_iodebug_c::~bx_iodebug_c( void )\n{\n}\n\n\n\n\n\nint bx_iodebug_c::init( bx_devices_c *d )\n{\n int i;\n\n BX_IODEBUG_THIS devices = d;\n BX_IODEBUG_THIS devices->register_io_read_handler(this, read_handler, 0x8A00,\"BOCHS IODEBUG\");\n BX_IODEBUG_THIS devices->register_io_write_handler(this, write_handler, 0x8A00,\"BOCHS IODEBUG\");\n BX_IODEBUG_THIS devices->register_io_write_handler(this, write_handler, 0x8A01,\"BOCHS IODEBUG\");\n fprintf( stderr, \"IODEBUG initialized\\n\");\n\n bx_iodebug_s.enabled = 0;\n bx_iodebug_s.register_select = 0;\n for(i=0;i<BX_IODEBUG_MAX_AREAS;i++) {\n bx_iodebug_s.monitored_mem_areas_start[i] = 0;\n bx_iodebug_s.monitored_mem_areas_end[i] = 0;\n }\n\n return(1);\n}\n\n\n\n\nBit32u bx_iodebug_c::read_handler(void *this_ptr, Bit32u addr, unsigned io_len)\n{\n bx_iodebug_ptr = (bx_iodebug_c *) this_ptr;\n return( bx_iodebug_ptr->read(addr, io_len) );\n}\n\n\n\n\n\n\nBit32u bx_iodebug_c::read( Bit32u addr, unsigned io_len )\n{\n\n if(bx_iodebug_s.enabled) return(0x8A00);\n return(0);\n}\n\n\n\n\n\n\n\n\n\n\nvoid bx_iodebug_c::write_handler(void *this_ptr, Bit32u addr, Bit32u dvalue, unsigned io_len)\n{\n bx_iodebug_c *class_ptr = (bx_iodebug_c *) this_ptr;\n class_ptr->write( addr, dvalue, io_len );\n}\n\n\n\n\n\n\nvoid bx_iodebug_c::write( Bit32u addr, Bit32u dvalue, unsigned int io_len )\n{\n\n\n fprintf(stderr, \"IODEBUG addr: %4x\\tdvalue: %8x\\tio_len: %8x\\n\", (unsigned int)addr, (unsigned int)dvalue, io_len);\n\n if( addr == 0x8A01 && io_len == 2 )\n {\n bx_iodebug_s.registers[bx_iodebug_s.register_select] =\n (bx_iodebug_s.registers[bx_iodebug_s.register_select] << 16) +\n\t(dvalue & 0x0000FFFF );\n }\n\n if( (addr != 0x8A00) || (io_len != 2) ) return;\n\n if( !bx_iodebug_s.enabled )\n {\n if( dvalue == 0x8A00 )\n {\n bx_iodebug_s.enabled = 1;\n fprintf(stderr, \"IODEBUG enabled\\n\");\n bx_iodebug_s.registers[0] = 0;\n bx_iodebug_s.registers[1] = 0;\n }\n return;\n }\n\n switch( dvalue )\n {\n case( 0x8A01 ):\n bx_iodebug_s.register_select = 0;\n fprintf( stderr, \"IODEBUG register 0 selected\\n\");\n break;\n\n case( 0x8A02 ):\n bx_iodebug_s.register_select = 1;\n fprintf( stderr, \"IODEBUG register 1 selected\\n\");\n break;\n\n case( 0x8A80 ):\n bx_iodebug_s.register_select = 0;\n bx_iodebug_c::add_range(\n bx_iodebug_s.registers[0],\n\t bx_iodebug_s.registers[1]);\n bx_iodebug_s.registers[0] = 0;\n bx_iodebug_s.registers[1] = 0;\n break;\n\n case( 0x8AFF ):\n bx_iodebug_s.enabled = 0;\n fprintf( stderr, \"IODEBUG device deactivated\\n\");\n break;\n\n default:\n fprintf(stderr,\"IODEBUG unsupported register code\\n\");\n }\n}\n\n\n\n\n\n\n\n\n\/\/ Static function\nvoid bx_iodebug_c::mem_write( BX_CPU_C *cpu, Bit32u addr, unsigned len, void *data)\n{\n Bit32u data32;\n Bit16u data16;\n Bit8u data8;\n\n unsigned int area;\n if( !bx_iodebug_s.enabled ) return;\n\n area = bx_iodebug_c::range_test( addr, len );\n \/\/ Device is enabled, testing address ranges\n if( area )\n {\n area--;\n fprintf( stderr,\n \"IODEBUG write to monitored memory area: %2i\\tby EIP:\\t\\t%08X\\n\\trange start: \\t\\t%08X\\trange end:\\t%08X\\n\\taddress accessed:\\t%08X\\tdata written:\\t\",\n\t area,\n\t bx_cpu.eip,\n\t bx_iodebug_s.monitored_mem_areas_start[area],\n\t bx_iodebug_s.monitored_mem_areas_end[area],\n\t (unsigned int)addr);\n data32 = * (Bit32u *)data;\n data16 = (Bit16u)data32;\n data8 = (Bit8u)data32;\n\n switch(len)\n {\n case(1):\n fprintf(stderr,\"%02X\\n\", (unsigned int)data8);\n\tbreak;\n\n case(2):\n fprintf(stderr,\"%04X\\n\", (unsigned int)data16);\n\tbreak;\n\n case(4):\n fprintf(stderr,\"%08X\\n\", (unsigned int)data32);\n\tbreak;\n\n default:\n fprintf(stderr, \"unsupported write size\\n\");\n }\n }\n}\n\n\n\n\n\n\n\n\nvoid bx_iodebug_c::mem_read( BX_CPU_C *cpu, Bit32u addr, unsigned len, void *data)\n{\n if( !bx_iodebug_s.enabled ) return;\n\n \/\/ Device is enabled, testing address range\n}\n\n\n\n\n\n\n\nunsigned int bx_iodebug_c::range_test( Bit32u addr, unsigned int len )\n{\n unsigned int i;\n\n for(i=0;i<BX_IODEBUG_MAX_AREAS;i++)\n {\n if( (bx_iodebug_s.monitored_mem_areas_start[i]!=0) ||\n (bx_iodebug_s.monitored_mem_areas_end[i]!=0) )\n {\n if( (Bit32u)(addr+len-1) < bx_iodebug_s.monitored_mem_areas_start[i] )\n continue;\n if( addr < bx_iodebug_s.monitored_mem_areas_end[i] )\n {\n return(++i);\n }\n }\t\n }\n return(0);\n}\n\n\n\n\n\n\nvoid bx_iodebug_c::add_range( Bit32u addr_start, Bit32u addr_end )\n{\n unsigned int i;\n for(i=0;i<BX_IODEBUG_MAX_AREAS;i++)\n {\n if( !bx_iodebug_s.monitored_mem_areas_start[i] &&\n !bx_iodebug_s.monitored_mem_areas_end[i] )\n {\n\tbx_iodebug_s.monitored_mem_areas_start[i] = addr_start;\n\tbx_iodebug_s.monitored_mem_areas_end[i] = addr_end;\n\tfprintf(stderr, \"IODEBUG added range successfully in slot: %i\\n\",i);\n\treturn;\n }\n }\n fprintf(stderr, \"IODEBUG unable to register memory range, all slots taken\\n\");\n}\n<commit_msg>added support for the debugger, it now returns to the debugger prompt<commit_after>#include \"bochs.h\"\n\n\n\nbx_iodebug_c bx_iodebug;\nbx_iodebug_c *bx_iodebug_ptr;\n\n struct bx_iodebug_s_type {\n Boolean enabled;\n unsigned int register_select;\n Bit32u registers[2];\n Bit32u monitored_mem_areas_start[BX_IODEBUG_MAX_AREAS];\n Bit32u monitored_mem_areas_end[BX_IODEBUG_MAX_AREAS];\n } bx_iodebug_s;\n\n\n\n\n\/\/ Constructor\nbx_iodebug_c::bx_iodebug_c( void )\n{\n put(\"IODEBUG\");\n settype(IODEBUGLOG);\n\n}\n\n\n\n\n\n\/\/ Destructor\nbx_iodebug_c::~bx_iodebug_c( void )\n{\n}\n\n\n\n\n\nint bx_iodebug_c::init( bx_devices_c *d )\n{\n int i;\n\n BX_IODEBUG_THIS devices = d;\n BX_IODEBUG_THIS devices->register_io_read_handler(this, read_handler, 0x8A00,\"BOCHS IODEBUG\");\n BX_IODEBUG_THIS devices->register_io_write_handler(this, write_handler, 0x8A00,\"BOCHS IODEBUG\");\n BX_IODEBUG_THIS devices->register_io_write_handler(this, write_handler, 0x8A01,\"BOCHS IODEBUG\");\n\/\/ fprintf( stderr, \"IODEBUG initialized\\n\");\n\n bx_iodebug_s.enabled = 0;\n bx_iodebug_s.register_select = 0;\n for(i=0;i<BX_IODEBUG_MAX_AREAS;i++) {\n bx_iodebug_s.monitored_mem_areas_start[i] = 0;\n bx_iodebug_s.monitored_mem_areas_end[i] = 0;\n }\n\n return(1);\n}\n\n\n\n\nBit32u bx_iodebug_c::read_handler(void *this_ptr, Bit32u addr, unsigned io_len)\n{\n bx_iodebug_ptr = (bx_iodebug_c *) this_ptr;\n return( bx_iodebug_ptr->read(addr, io_len) );\n}\n\n\n\n\n\n\nBit32u bx_iodebug_c::read( Bit32u addr, unsigned io_len )\n{\n\n if(bx_iodebug_s.enabled) return(0x8A00);\n return(0);\n}\n\n\n\n\n\n\n\n\n\n\nvoid bx_iodebug_c::write_handler(void *this_ptr, Bit32u addr, Bit32u dvalue, unsigned io_len)\n{\n bx_iodebug_c *class_ptr = (bx_iodebug_c *) this_ptr;\n class_ptr->write( addr, dvalue, io_len );\n}\n\n\n\n\n\n\nvoid bx_iodebug_c::write( Bit32u addr, Bit32u dvalue, unsigned int io_len )\n{\n\n\n\/\/ fprintf(stderr, \"IODEBUG addr: %4x\\tdvalue: %8x\\tio_len: %8x\\n\", (unsigned int)addr, (unsigned int)dvalue, io_len);\n\n if( addr == 0x8A01 && io_len == 2 )\n {\n bx_iodebug_s.registers[bx_iodebug_s.register_select] =\n (bx_iodebug_s.registers[bx_iodebug_s.register_select] << 16) +\n\t(dvalue & 0x0000FFFF );\n }\n\n if( (addr != 0x8A00) || (io_len != 2) ) return;\n\n if( !bx_iodebug_s.enabled )\n {\n if( dvalue == 0x8A00 )\n {\n bx_iodebug_s.enabled = 1;\n\/\/ fprintf(stderr, \"IODEBUG enabled\\n\");\n bx_iodebug_s.registers[0] = 0;\n bx_iodebug_s.registers[1] = 0;\n }\n return;\n }\n\n switch( dvalue )\n {\n case( 0x8A01 ):\n bx_iodebug_s.register_select = 0;\n\/\/ fprintf( stderr, \"IODEBUG register 0 selected\\n\");\n break;\n\n case( 0x8A02 ):\n bx_iodebug_s.register_select = 1;\n\/\/ fprintf( stderr, \"IODEBUG register 1 selected\\n\");\n break;\n\n case( 0x8A80 ):\n bx_iodebug_s.register_select = 0;\n bx_iodebug_c::add_range(\n bx_iodebug_s.registers[0],\n\t bx_iodebug_s.registers[1]);\n bx_iodebug_s.registers[0] = 0;\n bx_iodebug_s.registers[1] = 0;\n break;\n\n case( 0x8AFF ):\n bx_iodebug_s.enabled = 0;\n\/\/ fprintf( stderr, \"IODEBUG device deactivated\\n\");\n\/\/ break;\n\n\/\/ default:\n\/\/ fprintf(stderr,\"IODEBUG unsupported register code\\n\");\n }\n}\n\n\n\n\n\n\n\n\n\/\/ Static function\nvoid bx_iodebug_c::mem_write( BX_CPU_C *cpu, Bit32u addr, unsigned len, void *data)\n{\n Bit32u data32;\n Bit16u data16;\n Bit8u data8;\n\n unsigned int area;\n if( !bx_iodebug_s.enabled ) return;\n\n area = bx_iodebug_c::range_test( addr, len );\n \/\/ Device is enabled, testing address ranges\n if( area )\n {\n area--;\n#if BX_DEBUGGER\n fprintf( stdout, \"%s @ eip: %8X wrote at monitored memory location %8X\\n\", cpu->name, cpu->eip, addr);\n bx_guard.interrupt_requested=1;\n#else\n fprintf( stderr,\n \"IODEBUG write to monitored memory area: %2i\\tby EIP:\\t\\t%08X\\n\\trange start: \\t\\t%08X\\trange end:\\t%08X\\n\\taddress accessed:\\t%08X\\tdata written:\\t\",\n\t area,\n\t cpu->eip,\n\t bx_iodebug_s.monitored_mem_areas_start[area],\n\t bx_iodebug_s.monitored_mem_areas_end[area],\n\t (unsigned int)addr);\n\n data32 = * (Bit32u *)data;\n data16 = (Bit16u)data32;\n data8 = (Bit8u)data32;\n\n switch(len)\n {\n case(1):\n fprintf(stderr,\"%02X\\n\", (unsigned int)data8);\n\tbreak;\n\n case(2):\n fprintf(stderr,\"%04X\\n\", (unsigned int)data16);\n\tbreak;\n\n case(4):\n fprintf(stderr,\"%08X\\n\", (unsigned int)data32);\n\tbreak;\n\n default:\n fprintf(stderr, \"unsupported write size\\n\");\n }\n#endif\n }\n}\n\n\n\n\n\n\n\n\nvoid bx_iodebug_c::mem_read( BX_CPU_C *cpu, Bit32u addr, unsigned len, void *data)\n{\n Bit32u data32;\n Bit16u data16;\n Bit8u data8;\n\n unsigned int area;\n if( !bx_iodebug_s.enabled ) return;\n\n area = bx_iodebug_c::range_test( addr, len );\n \/\/ Device is enabled, testing address ranges\n if( area )\n {\n area--;\n#if BX_DEBUGGER\n fprintf( stdout, \"%s @ eip: %8X wrote at monitored memory location %8X\\n\", cpu->name, cpu->eip, addr);\n bx_guard.interrupt_requested=1;\n#else\n fprintf( stderr,\n \"IODEBUG read to monitored memory area: %2i\\tby EIP:\\t\\t%08X\\n\\trange start: \\t\\t%08X\\trange end:\\t%08X\\n\\taddress accessed:\\t%08X\\tdata written:\\t\",\n\t area,\n\t cpu->eip,\n\t bx_iodebug_s.monitored_mem_areas_start[area],\n\t bx_iodebug_s.monitored_mem_areas_end[area],\n\t (unsigned int)addr);\n data32 = * (Bit32u *)data;\n data16 = (Bit16u)data32;\n data8 = (Bit8u)data32;\n\n switch(len)\n {\n case(1):\n fprintf(stderr,\"%02X\\n\", (unsigned int)data8);\n\tbreak;\n\n case(2):\n fprintf(stderr,\"%04X\\n\", (unsigned int)data16);\n\tbreak;\n\n case(4):\n fprintf(stderr,\"%08X\\n\", (unsigned int)data32);\n\tbreak;\n\n default:\n fprintf(stderr, \"unsupported write size\\n\");\n }\n#endif\n }\n}\n\n\n\n\n\n\n\nunsigned int bx_iodebug_c::range_test( Bit32u addr, unsigned int len )\n{\n unsigned int i;\n\n for(i=0;i<BX_IODEBUG_MAX_AREAS;i++)\n {\n if( (bx_iodebug_s.monitored_mem_areas_start[i]!=0) ||\n (bx_iodebug_s.monitored_mem_areas_end[i]!=0) )\n {\n if( (Bit32u)(addr+len-1) < bx_iodebug_s.monitored_mem_areas_start[i] )\n continue;\n if( addr < bx_iodebug_s.monitored_mem_areas_end[i] )\n {\n return(++i);\n }\n }\t\n }\n return(0);\n}\n\n\n\n\n\n\nvoid bx_iodebug_c::add_range( Bit32u addr_start, Bit32u addr_end )\n{\n unsigned int i;\n for(i=0;i<BX_IODEBUG_MAX_AREAS;i++)\n {\n if( !bx_iodebug_s.monitored_mem_areas_start[i] &&\n !bx_iodebug_s.monitored_mem_areas_end[i] )\n {\n\tbx_iodebug_s.monitored_mem_areas_start[i] = addr_start;\n\tbx_iodebug_s.monitored_mem_areas_end[i] = addr_end;\n\/\/\tfprintf(stderr, \"IODEBUG added range successfully in slot: %i\\n\",i);\n\treturn;\n }\n }\n\/\/ fprintf(stderr, \"IODEBUG unable to register memory range, all slots taken\\n\");\n}\n<|endoftext|>"} {"text":"<commit_before><commit_msg>Planning: remove dup code<commit_after><|endoftext|>"} {"text":"<commit_before>\/*\n* Copyright (c) 2003-2006 Rony Shapiro <ronys@users.sourceforge.net>.\n* All rights reserved. Use of the code is allowed under the\n* Artistic License 2.0 terms, as specified in the LICENSE file\n* distributed with this code, or available from\n* http:\/\/www.opensource.org\/licenses\/artistic-license-2.0.php\n*\/\n\/\/#define TEST_MYSTRING\n#define TEST_TWOFISH\n#define TEST_SHA256\n#define TEST_HMAC_SHA256\n#define TEST_XSTRING\n\n#ifdef TEST_MYSTRING\n#include \"MyStringTest.h\"\n#endif\n#ifdef TEST_TWOFISH\n#include \"TwoFishTest.h\"\n#endif\n#ifdef TEST_SHA256\n#include \"SHA256Test.h\"\n#endif\n#ifdef TEST_HMAC_SHA256\n#include \"HMAC_SHA256Test.h\"\n#endif\n#ifdef TEST_XSTRING\n#include \"StringXTest.h\"\n#endif\n#include <iostream>\nusing namespace std;\n\nint main()\n{\n#ifdef TEST_MYSTRING\n CMyStringTest t1;\n t1.setStream(&cout);\n t1.run();\n t1.report();\n#endif\n#ifdef TEST_TWOFISH\n CTwoFishTest t2;\n t2.setStream(&cout);\n t2.run();\n t2.report();\n#endif\n#ifdef TEST_SHA256\n CSHA256Test t3;\n t3.setStream(&cout);\n t3.run();\n t3.report();\n#endif\n#ifdef TEST_HMAC_SHA256\n CHMAC_SHA256Test t4;\n t4.setStream(&cout);\n t4.run();\n t4.report();\n#endif\n#ifdef TEST_XSTRING\n StringXTest t5;\n t5.setStream(&cout);\n t5.run();\n t5.report();\n#endif\n return 0;\n}\n<commit_msg>Murphy - wait with CMyString for Linux for now...<commit_after>\/*\n* Copyright (c) 2003-2006 Rony Shapiro <ronys@users.sourceforge.net>.\n* All rights reserved. Use of the code is allowed under the\n* Artistic License 2.0 terms, as specified in the LICENSE file\n* distributed with this code, or available from\n* http:\/\/www.opensource.org\/licenses\/artistic-license-2.0.php\n*\/\n#define TEST_MYSTRING\n#define TEST_TWOFISH\n#define TEST_SHA256\n#define TEST_HMAC_SHA256\n#define TEST_STRINGX\n\n#ifdef TEST_MYSTRING\n#include \"MyStringTest.h\"\n#endif\n#ifdef TEST_TWOFISH\n#include \"TwoFishTest.h\"\n#endif\n#ifdef TEST_SHA256\n#include \"SHA256Test.h\"\n#endif\n#ifdef TEST_HMAC_SHA256\n#include \"HMAC_SHA256Test.h\"\n#endif\n#ifdef TEST_STRINGX\n#include \"StringXTest.h\"\n#endif\n#include <iostream>\nusing namespace std;\n\nint main()\n{\n#ifdef TEST_MYSTRING\n CMyStringTest t1;\n t1.setStream(&cout);\n t1.run();\n t1.report();\n#endif\n#ifdef TEST_TWOFISH\n CTwoFishTest t2;\n t2.setStream(&cout);\n t2.run();\n t2.report();\n#endif\n#ifdef TEST_SHA256\n CSHA256Test t3;\n t3.setStream(&cout);\n t3.run();\n t3.report();\n#endif\n#ifdef TEST_HMAC_SHA256\n CHMAC_SHA256Test t4;\n t4.setStream(&cout);\n t4.run();\n t4.report();\n#endif\n#ifdef TEST_STRINGX\n StringXTest t5;\n t5.setStream(&cout);\n t5.run();\n t5.report();\n#endif\n return 0;\n}\n<|endoftext|>"} {"text":"<commit_before>\/*\n * Copyright (c) 2016, Nils Asmussen\n * All rights reserved.\n *\n * Redistribution and use in source and binary forms, with or without\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 * The views and conclusions contained in the software and documentation are\n * those of the authors and should not be interpreted as representing official\n * policies, either expressed or implied, of the FreeBSD Project.\n *\/\n\n#include \"cpu\/dtu-accel\/yieldsm.hh\"\n\nstd::string\nYieldSM::stateName() const\n{\n std::ostringstream os;\n static const char *names[] =\n {\n \"CHECK\", \"WAIT\", \"REPORT\", \"SYSCALL\", \"SLEEP\"\n };\n os << names[static_cast<size_t>(state)];\n if (state == YLD_SYSCALL)\n os << \":\" << syscsm->stateName();\n return os.str();\n}\n\nPacketPtr\nYieldSM::tick()\n{\n PacketPtr pkt = nullptr;\n\n switch(state)\n {\n case State::YLD_CHECK:\n {\n pkt = accel->createPacket(\n DtuAccel::RCTMUX_YIELD, sizeof(uint64_t), MemCmd::ReadReq\n );\n break;\n }\n case State::YLD_WAIT:\n {\n yieldStart = accel->curCycle();\n pkt = accel->createDtuCmdPkt(Dtu::Command::SLEEP, 0, 0, 0, report);\n break;\n }\n case State::YLD_REPORT:\n {\n syscall.opcode = 10; \/* VPE_CTRL *\/\n syscall.vpe_sel = 0; \/* self *\/\n syscall.op = 2; \/* VCTRL_YIELD *\/\n syscall.arg = 0; \/* unused *\/\n\n pkt = accel->createPacket(\n accel->sendMsgAddr(), sizeof(syscall), MemCmd::WriteReq\n );\n memcpy(pkt->getPtr<void>(), &syscall, sizeof(syscall));\n break;\n }\n case State::YLD_SYSCALL:\n {\n pkt = syscsm->tick();\n break;\n }\n case State::YLD_SLEEP:\n {\n pkt = accel->createDtuCmdPkt(Dtu::Command::SLEEP, 0, 0, 0, 0);\n break;\n }\n }\n\n return pkt;\n}\n\nbool\nYieldSM::handleMemResp(PacketPtr pkt)\n{\n auto lastState = state;\n\n switch(state)\n {\n case State::YLD_CHECK:\n {\n report = *pkt->getConstPtr<uint64_t>();\n if (report > 0)\n state = State::YLD_WAIT;\n else\n state = State::YLD_SLEEP;\n break;\n }\n case State::YLD_WAIT:\n {\n if (accel->curCycle() < yieldStart + report)\n return true;\n\n state = State::YLD_REPORT;\n break;\n }\n case State::YLD_REPORT:\n {\n syscsm->start(sizeof(syscall));\n state = State::YLD_SYSCALL;\n break;\n }\n case State::YLD_SYSCALL:\n {\n if(syscsm->handleMemResp(pkt))\n state = State::YLD_SLEEP;\n break;\n }\n case State::YLD_SLEEP:\n {\n return true;\n }\n }\n\n stateChanged = state != lastState;\n\n return false;\n}\n<commit_msg>DtuAccel: use syscall constants in yield SM.<commit_after>\/*\n * Copyright (c) 2016, Nils Asmussen\n * All rights reserved.\n *\n * Redistribution and use in source and binary forms, with or without\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 * The views and conclusions contained in the software and documentation are\n * those of the authors and should not be interpreted as representing official\n * policies, either expressed or implied, of the FreeBSD Project.\n *\/\n\n#include \"cpu\/dtu-accel\/yieldsm.hh\"\n\nstd::string\nYieldSM::stateName() const\n{\n std::ostringstream os;\n static const char *names[] =\n {\n \"CHECK\", \"WAIT\", \"REPORT\", \"SYSCALL\", \"SLEEP\"\n };\n os << names[static_cast<size_t>(state)];\n if (state == YLD_SYSCALL)\n os << \":\" << syscsm->stateName();\n return os.str();\n}\n\nPacketPtr\nYieldSM::tick()\n{\n PacketPtr pkt = nullptr;\n\n switch(state)\n {\n case State::YLD_CHECK:\n {\n pkt = accel->createPacket(\n DtuAccel::RCTMUX_YIELD, sizeof(uint64_t), MemCmd::ReadReq\n );\n break;\n }\n case State::YLD_WAIT:\n {\n yieldStart = accel->curCycle();\n pkt = accel->createDtuCmdPkt(Dtu::Command::SLEEP, 0, 0, 0, report);\n break;\n }\n case State::YLD_REPORT:\n {\n syscall.opcode = SyscallSM::VPE_CTRL;\n syscall.vpe_sel = 0; \/* self *\/\n syscall.op = SyscallSM::VCTRL_YIELD;\n syscall.arg = 0; \/* unused *\/\n\n pkt = accel->createPacket(\n accel->sendMsgAddr(), sizeof(syscall), MemCmd::WriteReq\n );\n memcpy(pkt->getPtr<void>(), &syscall, sizeof(syscall));\n break;\n }\n case State::YLD_SYSCALL:\n {\n pkt = syscsm->tick();\n break;\n }\n case State::YLD_SLEEP:\n {\n pkt = accel->createDtuCmdPkt(Dtu::Command::SLEEP, 0, 0, 0, 0);\n break;\n }\n }\n\n return pkt;\n}\n\nbool\nYieldSM::handleMemResp(PacketPtr pkt)\n{\n auto lastState = state;\n\n switch(state)\n {\n case State::YLD_CHECK:\n {\n report = *pkt->getConstPtr<uint64_t>();\n if (report > 0)\n state = State::YLD_WAIT;\n else\n state = State::YLD_SLEEP;\n break;\n }\n case State::YLD_WAIT:\n {\n if (accel->curCycle() < yieldStart + report)\n return true;\n\n state = State::YLD_REPORT;\n break;\n }\n case State::YLD_REPORT:\n {\n syscsm->start(sizeof(syscall));\n state = State::YLD_SYSCALL;\n break;\n }\n case State::YLD_SYSCALL:\n {\n if(syscsm->handleMemResp(pkt))\n state = State::YLD_SLEEP;\n break;\n }\n case State::YLD_SLEEP:\n {\n return true;\n }\n }\n\n stateChanged = state != lastState;\n\n return false;\n}\n<|endoftext|>"} {"text":"<commit_before>#pragma once\n\n\/\/ ----------------------------------------------------------------------\n\/\/ std::vector<std::string> split(const std::string& s, const std::string& delim, bool keep_empty = Split::KeepEmpty)\n\/\/ Split string by delimiter into array of substrings\n\/\/ std::vector<std::string> split(const std::string& s, const std::string& delim, bool keep_empty = Split::KeepEmpty)\n\n\/\/ std::string strip(std::string source)\n\/\/ Removes leading and trailing spaces from string\n\/\/\n\/\/ ----------------------------------------------------------------------\n\n#include <string>\n#include <vector>\n#include <cctype>\n#include <algorithm>\n#include <cstring>\n#include <iterator>\n#include <utility>\n#include <initializer_list>\n#include <numeric>\n\n\/\/ ----------------------------------------------------------------------\n\nnamespace string\n{\n\n\/\/ ----------------------------------------------------------------------\n\n enum class Split { RemoveEmpty, KeepEmpty };\n\n \/\/ http:\/\/stackoverflow.com\/questions\/236129\/split-a-string-in-c\n inline std::vector<std::string> split(std::string s, std::string delim, Split keep_empty = Split::KeepEmpty)\n {\n std::vector<std::string> result;\n if (! delim.empty()) {\n for (std::string::iterator substart = s.begin(), subend = substart; substart <= s.end(); substart = subend + static_cast<std::string::difference_type>(delim.size())) {\n subend = std::search(substart, s.end(), delim.begin(), delim.end());\n if (substart != subend || keep_empty == Split::KeepEmpty) {\n result.push_back(std::string(substart, subend));\n }\n }\n }\n else {\n result.push_back(s);\n }\n return result;\n }\n\n \/\/ ----------------------------------------------------------------------\n\n namespace _internal {\n template <typename InputIterator, typename Source> inline std::pair<InputIterator, InputIterator> strip_begin_end(Source& source)\n {\n auto predicate = [](auto c) { return std::isspace(c); }; \/\/ have to use lambda, other compiler cannot infer Predicate type from isspace\n auto e = std::find_if_not(source.rbegin(), source.rend(), predicate);\n auto b = std::find_if_not(source.begin(), e.base(), predicate);\n return std::make_pair(b, e.base());\n }\n } \/\/ namespace _internal\n\n \/\/ inline std::string& strip(std::string& source)\n \/\/ {\n \/\/ auto be = _internal::strip_begin_end<std::string::iterator>(source);\n \/\/ source.erase(be.second, source.end()); \/\/ erase at the end first\n \/\/ source.erase(source.begin(), be.first); \/\/ invalidates be.second!\n \/\/ return source;\n \/\/ }\n\n \/\/ inline std::string strip(std::string&& source)\n \/\/ {\n \/\/ auto be = _internal::strip_begin_end<std::string::iterator>(source);\n \/\/ source.erase(be.second, source.end()); \/\/ erase at the end first\n \/\/ source.erase(source.begin(), be.first); \/\/ invalidates be.second!\n \/\/ return source;\n \/\/ }\n\n inline std::string strip(std::string source)\n {\n auto be = _internal::strip_begin_end<std::string::const_iterator>(source);\n return std::string(be.first, be.second);\n }\n\n \/\/ ----------------------------------------------------------------------\n\n inline std::string replace(std::string source, std::string look_for, std::string replace_with)\n {\n std::string result;\n std::string::size_type start = 0;\n while (true) {\n const auto pos = source.find(look_for, start);\n if (pos != std::string::npos) {\n result.append(source.begin() + static_cast<std::string::difference_type>(start), source.begin() + static_cast<std::string::difference_type>(pos));\n result.append(replace_with);\n start = pos + look_for.size();\n }\n else {\n result.append(source.begin() + static_cast<std::string::difference_type>(start), source.end());\n break;\n }\n }\n return result;\n }\n\n \/\/ ----------------------------------------------------------------------\n\n \/\/ inline std::string& lower(std::string& source)\n \/\/ {\n \/\/ std::transform(source.begin(), source.end(), source.begin(), ::tolower);\n \/\/ return source;\n \/\/ }\n\n inline std::string lower(std::string source)\n {\n std::string result;\n std::transform(source.begin(), source.end(), std::back_inserter(result), ::tolower);\n return result;\n }\n\n \/\/ inline std::string& upper(std::string& source)\n \/\/ {\n \/\/ std::transform(source.begin(), source.end(), source.begin(), ::toupper);\n \/\/ return source;\n \/\/ }\n\n inline std::string upper(std::string source)\n {\n std::string result;\n std::transform(source.begin(), source.end(), std::back_inserter(result), ::toupper);\n return result;\n }\n\n \/\/ inline std::string& capitalize(std::string& source)\n \/\/ {\n \/\/ if (!source.empty()) {\n \/\/ std::transform(source.begin(), source.begin() + 1, source.begin(), ::toupper);\n \/\/ std::transform(source.begin() + 1, source.end(), source.begin() + 1, ::tolower);\n \/\/ }\n \/\/ return source;\n \/\/ }\n\n inline std::string capitalize(std::string source)\n {\n std::string result;\n if (!source.empty()) {\n std::transform(source.begin(), source.begin() + 1, std::back_inserter(result), ::toupper);\n std::transform(source.begin() + 1, source.end(), std::back_inserter(result), ::tolower);\n }\n return result;\n }\n\n template <typename Collection> inline std::string join(std::string separator, const Collection& values)\n {\n const size_t resulting_size = std::accumulate(values.begin(), values.end(), separator.size() * (values.size() - 1), [](size_t acc, const std::string& n) -> size_t { return acc + n.size(); });\n std::string result;\n result.reserve(resulting_size);\n for (const auto& value: values) {\n if (!result.empty())\n result.append(separator);\n result.append(value);\n }\n return result;\n }\n\n\/\/ ----------------------------------------------------------------------\n\n} \/\/ namespace string\n\n\/\/ ----------------------------------------------------------------------\n\/\/\/ Local Variables:\n\/\/\/ eval: (if (fboundp 'eu-rename-buffer) (eu-rename-buffer))\n\/\/\/ End:\n<commit_msg>improvements in string::join<commit_after>#pragma once\n\n\/\/ ----------------------------------------------------------------------\n\/\/ std::vector<std::string> split(const std::string& s, const std::string& delim, bool keep_empty = Split::KeepEmpty)\n\/\/ Split string by delimiter into array of substrings\n\/\/ std::vector<std::string> split(const std::string& s, const std::string& delim, bool keep_empty = Split::KeepEmpty)\n\n\/\/ std::string strip(std::string source)\n\/\/ Removes leading and trailing spaces from string\n\/\/\n\/\/ ----------------------------------------------------------------------\n\n#include <string>\n#include <vector>\n#include <cctype>\n#include <algorithm>\n#include <cstring>\n#include <iterator>\n#include <utility>\n#include <initializer_list>\n#include <numeric>\n\n\/\/ ----------------------------------------------------------------------\n\nnamespace string\n{\n\n\/\/ ----------------------------------------------------------------------\n\n enum class Split { RemoveEmpty, KeepEmpty };\n\n \/\/ http:\/\/stackoverflow.com\/questions\/236129\/split-a-string-in-c\n inline std::vector<std::string> split(std::string s, std::string delim, Split keep_empty = Split::KeepEmpty)\n {\n std::vector<std::string> result;\n if (! delim.empty()) {\n for (std::string::iterator substart = s.begin(), subend = substart; substart <= s.end(); substart = subend + static_cast<std::string::difference_type>(delim.size())) {\n subend = std::search(substart, s.end(), delim.begin(), delim.end());\n if (substart != subend || keep_empty == Split::KeepEmpty) {\n result.push_back(std::string(substart, subend));\n }\n }\n }\n else {\n result.push_back(s);\n }\n return result;\n }\n\n \/\/ ----------------------------------------------------------------------\n\n namespace _internal {\n template <typename InputIterator, typename Source> inline std::pair<InputIterator, InputIterator> strip_begin_end(Source& source)\n {\n auto predicate = [](auto c) { return std::isspace(c); }; \/\/ have to use lambda, other compiler cannot infer Predicate type from isspace\n auto e = std::find_if_not(source.rbegin(), source.rend(), predicate);\n auto b = std::find_if_not(source.begin(), e.base(), predicate);\n return std::make_pair(b, e.base());\n }\n } \/\/ namespace _internal\n\n \/\/ inline std::string& strip(std::string& source)\n \/\/ {\n \/\/ auto be = _internal::strip_begin_end<std::string::iterator>(source);\n \/\/ source.erase(be.second, source.end()); \/\/ erase at the end first\n \/\/ source.erase(source.begin(), be.first); \/\/ invalidates be.second!\n \/\/ return source;\n \/\/ }\n\n \/\/ inline std::string strip(std::string&& source)\n \/\/ {\n \/\/ auto be = _internal::strip_begin_end<std::string::iterator>(source);\n \/\/ source.erase(be.second, source.end()); \/\/ erase at the end first\n \/\/ source.erase(source.begin(), be.first); \/\/ invalidates be.second!\n \/\/ return source;\n \/\/ }\n\n inline std::string strip(std::string source)\n {\n auto be = _internal::strip_begin_end<std::string::const_iterator>(source);\n return std::string(be.first, be.second);\n }\n\n \/\/ ----------------------------------------------------------------------\n\n inline std::string replace(std::string source, std::string look_for, std::string replace_with)\n {\n std::string result;\n std::string::size_type start = 0;\n while (true) {\n const auto pos = source.find(look_for, start);\n if (pos != std::string::npos) {\n result.append(source.begin() + static_cast<std::string::difference_type>(start), source.begin() + static_cast<std::string::difference_type>(pos));\n result.append(replace_with);\n start = pos + look_for.size();\n }\n else {\n result.append(source.begin() + static_cast<std::string::difference_type>(start), source.end());\n break;\n }\n }\n return result;\n }\n\n \/\/ ----------------------------------------------------------------------\n\n \/\/ inline std::string& lower(std::string& source)\n \/\/ {\n \/\/ std::transform(source.begin(), source.end(), source.begin(), ::tolower);\n \/\/ return source;\n \/\/ }\n\n inline std::string lower(std::string source)\n {\n std::string result;\n std::transform(source.begin(), source.end(), std::back_inserter(result), ::tolower);\n return result;\n }\n\n \/\/ inline std::string& upper(std::string& source)\n \/\/ {\n \/\/ std::transform(source.begin(), source.end(), source.begin(), ::toupper);\n \/\/ return source;\n \/\/ }\n\n inline std::string upper(std::string source)\n {\n std::string result;\n std::transform(source.begin(), source.end(), std::back_inserter(result), ::toupper);\n return result;\n }\n\n \/\/ inline std::string& capitalize(std::string& source)\n \/\/ {\n \/\/ if (!source.empty()) {\n \/\/ std::transform(source.begin(), source.begin() + 1, source.begin(), ::toupper);\n \/\/ std::transform(source.begin() + 1, source.end(), source.begin() + 1, ::tolower);\n \/\/ }\n \/\/ return source;\n \/\/ }\n\n inline std::string capitalize(std::string source)\n {\n std::string result;\n if (!source.empty()) {\n std::transform(source.begin(), source.begin() + 1, std::back_inserter(result), ::toupper);\n std::transform(source.begin() + 1, source.end(), std::back_inserter(result), ::tolower);\n }\n return result;\n }\n\n template <typename Collection> inline std::string join(std::string separator, const Collection& values)\n {\n std::string result;\n if (!values.empty()) {\n const size_t resulting_size = std::accumulate(values.begin(), values.end(), separator.size() * (values.size() - 1), [](size_t acc, const std::string& n) -> size_t { return acc + n.size(); });\n result.reserve(resulting_size);\n for (const auto& value: values) {\n if (!result.empty())\n result.append(separator);\n result.append(value);\n }\n }\n return result;\n }\n\n\/\/ ----------------------------------------------------------------------\n\n} \/\/ namespace string\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) 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 *\/\n\n#include \"config\/use_checker.hh\"\n\n#include \"arch\/alpha\/faults.hh\"\n#include \"arch\/alpha\/isa_traits.hh\"\n#include \"base\/cprintf.hh\"\n#include \"base\/statistics.hh\"\n#include \"base\/timebuf.hh\"\n#include \"cpu\/checker\/thread_context.hh\"\n#include \"sim\/sim_events.hh\"\n#include \"sim\/stats.hh\"\n\n#include \"cpu\/o3\/alpha\/cpu.hh\"\n#include \"cpu\/o3\/alpha\/params.hh\"\n#include \"cpu\/o3\/alpha\/thread_context.hh\"\n#include \"cpu\/o3\/comm.hh\"\n#include \"cpu\/o3\/thread_state.hh\"\n\n#if FULL_SYSTEM\n#include \"arch\/alpha\/osfpal.hh\"\n#include \"arch\/isa_traits.hh\"\n#include \"arch\/kernel_stats.hh\"\n#include \"cpu\/quiesce_event.hh\"\n#include \"sim\/sim_exit.hh\"\n#include \"sim\/system.hh\"\n#endif\n\ntemplate <class Impl>\nAlphaO3CPU<Impl>::AlphaO3CPU(Params *params)\n#if FULL_SYSTEM\n : FullO3CPU<Impl>(params), itb(params->itb), dtb(params->dtb)\n#else\n : FullO3CPU<Impl>(params)\n#endif\n{\n DPRINTF(O3CPU, \"Creating AlphaO3CPU object.\\n\");\n\n \/\/ Setup any thread state.\n this->thread.resize(this->numThreads);\n\n for (int i = 0; i < this->numThreads; ++i) {\n#if FULL_SYSTEM\n \/\/ SMT is not supported in FS mode yet.\n assert(this->numThreads == 1);\n this->thread[i] = new Thread(this, 0);\n this->thread[i]->setStatus(ThreadContext::Suspended);\n#else\n if (i < params->workload.size()) {\n DPRINTF(O3CPU, \"Workload[%i] process is %#x\",\n i, this->thread[i]);\n this->thread[i] = new Thread(this, i, params->workload[i], i);\n\n this->thread[i]->setStatus(ThreadContext::Suspended);\n\n \/\/usedTids[i] = true;\n \/\/threadMap[i] = i;\n } else {\n \/\/Allocate Empty thread so M5 can use later\n \/\/when scheduling threads to CPU\n Process* dummy_proc = NULL;\n\n this->thread[i] = new Thread(this, i, dummy_proc, i);\n \/\/usedTids[i] = false;\n }\n#endif \/\/ !FULL_SYSTEM\n\n ThreadContext *tc;\n\n \/\/ Setup the TC that will serve as the interface to the threads\/CPU.\n AlphaTC<Impl> *alpha_tc =\n new AlphaTC<Impl>;\n\n tc = alpha_tc;\n\n \/\/ If we're using a checker, then the TC should be the\n \/\/ CheckerThreadContext.\n#if USE_CHECKER\n if (params->checker) {\n tc = new CheckerThreadContext<AlphaTC<Impl> >(\n alpha_tc, this->checker);\n }\n#endif\n\n alpha_tc->cpu = this;\n alpha_tc->thread = this->thread[i];\n\n#if FULL_SYSTEM\n \/\/ Setup quiesce event.\n this->thread[i]->quiesceEvent = new EndQuiesceEvent(tc);\n\n Port *mem_port;\n FunctionalPort *phys_port;\n VirtualPort *virt_port;\n phys_port = new FunctionalPort(csprintf(\"%s-%d-funcport\",\n name(), i));\n mem_port = this->system->physmem->getPort(\"functional\");\n mem_port->setPeer(phys_port);\n phys_port->setPeer(mem_port);\n\n virt_port = new VirtualPort(csprintf(\"%s-%d-vport\",\n name(), i));\n mem_port = this->system->physmem->getPort(\"functional\");\n mem_port->setPeer(virt_port);\n virt_port->setPeer(mem_port);\n\n this->thread[i]->setPhysPort(phys_port);\n this->thread[i]->setVirtPort(virt_port);\n#endif\n \/\/ Give the thread the TC.\n this->thread[i]->tc = tc;\n\n \/\/ Add the TC to the CPU's list of TC's.\n this->threadContexts.push_back(tc);\n }\n\n for (int i=0; i < this->numThreads; i++) {\n this->thread[i]->setFuncExeInst(0);\n }\n\n \/\/ Sets CPU pointers. These must be set at this level because the CPU\n \/\/ pointers are defined to be the highest level of CPU class.\n this->fetch.setCPU(this);\n this->decode.setCPU(this);\n this->rename.setCPU(this);\n this->iew.setCPU(this);\n this->commit.setCPU(this);\n\n this->rob.setCPU(this);\n this->regFile.setCPU(this);\n\n lockAddr = 0;\n lockFlag = false;\n}\n\ntemplate <class Impl>\nvoid\nAlphaO3CPU<Impl>::regStats()\n{\n \/\/ Register stats for everything that has stats.\n this->fullCPURegStats();\n this->fetch.regStats();\n this->decode.regStats();\n this->rename.regStats();\n this->iew.regStats();\n this->commit.regStats();\n}\n\n\ntemplate <class Impl>\nTheISA::MiscReg\nAlphaO3CPU<Impl>::readMiscReg(int misc_reg, unsigned tid)\n{\n return this->regFile.readMiscReg(misc_reg, tid);\n}\n\ntemplate <class Impl>\nTheISA::MiscReg\nAlphaO3CPU<Impl>::readMiscRegWithEffect(int misc_reg, unsigned tid)\n{\n return this->regFile.readMiscRegWithEffect(misc_reg, tid);\n}\n\ntemplate <class Impl>\nvoid\nAlphaO3CPU<Impl>::setMiscReg(int misc_reg, const MiscReg &val, unsigned tid)\n{\n this->regFile.setMiscReg(misc_reg, val, tid);\n}\n\ntemplate <class Impl>\nvoid\nAlphaO3CPU<Impl>::setMiscRegWithEffect(int misc_reg, const MiscReg &val,\n unsigned tid)\n{\n this->regFile.setMiscRegWithEffect(misc_reg, val, tid);\n}\n\ntemplate <class Impl>\nvoid\nAlphaO3CPU<Impl>::squashFromTC(unsigned tid)\n{\n this->thread[tid]->inSyscall = true;\n this->commit.generateTCEvent(tid);\n}\n\n#if FULL_SYSTEM\n\ntemplate <class Impl>\nvoid\nAlphaO3CPU<Impl>::post_interrupt(int int_num, int index)\n{\n BaseCPU::post_interrupt(int_num, index);\n\n if (this->thread[0]->status() == ThreadContext::Suspended) {\n DPRINTF(IPI,\"Suspended Processor awoke\\n\");\n this->threadContexts[0]->activate();\n }\n}\n\ntemplate <class Impl>\nFault\nAlphaO3CPU<Impl>::hwrei(unsigned tid)\n{\n \/\/ Need to clear the lock flag upon returning from an interrupt.\n this->setMiscReg(TheISA::Lock_Flag_DepTag, false, tid);\n\n this->thread[tid]->kernelStats->hwrei();\n\n this->checkInterrupts = true;\n\n \/\/ FIXME: XXX check for interrupts? XXX\n return NoFault;\n}\n\ntemplate <class Impl>\nbool\nAlphaO3CPU<Impl>::simPalCheck(int palFunc, unsigned tid)\n{\n if (this->thread[tid]->kernelStats)\n this->thread[tid]->kernelStats->callpal(palFunc,\n this->threadContexts[tid]);\n\n switch (palFunc) {\n case PAL::halt:\n halt();\n if (--System::numSystemsRunning == 0)\n exitSimLoop(\"all cpus halted\");\n break;\n\n case PAL::bpt:\n case PAL::bugchk:\n if (this->system->breakpoint())\n return false;\n break;\n }\n\n return true;\n}\n\ntemplate <class Impl>\nvoid\nAlphaO3CPU<Impl>::processInterrupts()\n{\n \/\/ Check for interrupts here. For now can copy the code that\n \/\/ exists within isa_fullsys_traits.hh. Also assume that thread 0\n \/\/ is the one that handles the interrupts.\n \/\/ @todo: Possibly consolidate the interrupt checking code.\n \/\/ @todo: Allow other threads to handle interrupts.\n\n \/\/ Check if there are any outstanding interrupts\n \/\/Handle the interrupts\n Fault interrupt = this->interrupts.getInterrupt(this->tcBase(0));\n\n if (interrupt != NoFault) {\n this->checkInterrupts = false;\n this->trap(interrupt, 0);\n }\n}\n\n#endif \/\/ FULL_SYSTEM\n\ntemplate <class Impl>\nvoid\nAlphaO3CPU<Impl>::trap(Fault fault, unsigned tid)\n{\n \/\/ Pass the thread's TC into the invoke method.\n fault->invoke(this->threadContexts[tid]);\n}\n\n#if !FULL_SYSTEM\n\ntemplate <class Impl>\nvoid\nAlphaO3CPU<Impl>::syscall(int64_t callnum, int tid)\n{\n DPRINTF(O3CPU, \"[tid:%i] Executing syscall().\\n\\n\", tid);\n\n DPRINTF(Activity,\"Activity: syscall() called.\\n\");\n\n \/\/ Temporarily increase this by one to account for the syscall\n \/\/ instruction.\n ++(this->thread[tid]->funcExeInst);\n\n \/\/ Execute the actual syscall.\n this->thread[tid]->syscall(callnum);\n\n \/\/ Decrease funcExeInst by one as the normal commit will handle\n \/\/ incrementing it.\n --(this->thread[tid]->funcExeInst);\n}\n\ntemplate <class Impl>\nTheISA::IntReg\nAlphaO3CPU<Impl>::getSyscallArg(int i, int tid)\n{\n return this->readArchIntReg(AlphaISA::ArgumentReg0 + i, tid);\n}\n\ntemplate <class Impl>\nvoid\nAlphaO3CPU<Impl>::setSyscallArg(int i, IntReg val, int tid)\n{\n this->setArchIntReg(AlphaISA::ArgumentReg0 + i, val, tid);\n}\n\ntemplate <class Impl>\nvoid\nAlphaO3CPU<Impl>::setSyscallReturn(SyscallReturn return_value, int tid)\n{\n \/\/ check for error condition. Alpha syscall convention is to\n \/\/ indicate success\/failure in reg a3 (r19) and put the\n \/\/ return value itself in the standard return value reg (v0).\n if (return_value.successful()) {\n \/\/ no error\n this->setArchIntReg(TheISA::SyscallSuccessReg, 0, tid);\n this->setArchIntReg(TheISA::ReturnValueReg, return_value.value(), tid);\n } else {\n \/\/ got an error, return details\n this->setArchIntReg(TheISA::SyscallSuccessReg, (IntReg) -1, tid);\n this->setArchIntReg(TheISA::ReturnValueReg, -return_value.value(), tid);\n }\n}\n#endif\n<commit_msg>The Lock_Flag_DepTag went away earlier, and using TheISA gives the false impression that this code is ISA independent.<commit_after>\/*\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 *\/\n\n#include \"config\/use_checker.hh\"\n\n#include \"arch\/alpha\/faults.hh\"\n#include \"arch\/alpha\/isa_traits.hh\"\n#include \"base\/cprintf.hh\"\n#include \"base\/statistics.hh\"\n#include \"base\/timebuf.hh\"\n#include \"cpu\/checker\/thread_context.hh\"\n#include \"sim\/sim_events.hh\"\n#include \"sim\/stats.hh\"\n\n#include \"cpu\/o3\/alpha\/cpu.hh\"\n#include \"cpu\/o3\/alpha\/params.hh\"\n#include \"cpu\/o3\/alpha\/thread_context.hh\"\n#include \"cpu\/o3\/comm.hh\"\n#include \"cpu\/o3\/thread_state.hh\"\n\n#if FULL_SYSTEM\n#include \"arch\/alpha\/osfpal.hh\"\n#include \"arch\/isa_traits.hh\"\n#include \"arch\/kernel_stats.hh\"\n#include \"cpu\/quiesce_event.hh\"\n#include \"sim\/sim_exit.hh\"\n#include \"sim\/system.hh\"\n#endif\n\ntemplate <class Impl>\nAlphaO3CPU<Impl>::AlphaO3CPU(Params *params)\n#if FULL_SYSTEM\n : FullO3CPU<Impl>(params), itb(params->itb), dtb(params->dtb)\n#else\n : FullO3CPU<Impl>(params)\n#endif\n{\n DPRINTF(O3CPU, \"Creating AlphaO3CPU object.\\n\");\n\n \/\/ Setup any thread state.\n this->thread.resize(this->numThreads);\n\n for (int i = 0; i < this->numThreads; ++i) {\n#if FULL_SYSTEM\n \/\/ SMT is not supported in FS mode yet.\n assert(this->numThreads == 1);\n this->thread[i] = new Thread(this, 0);\n this->thread[i]->setStatus(ThreadContext::Suspended);\n#else\n if (i < params->workload.size()) {\n DPRINTF(O3CPU, \"Workload[%i] process is %#x\",\n i, this->thread[i]);\n this->thread[i] = new Thread(this, i, params->workload[i], i);\n\n this->thread[i]->setStatus(ThreadContext::Suspended);\n\n \/\/usedTids[i] = true;\n \/\/threadMap[i] = i;\n } else {\n \/\/Allocate Empty thread so M5 can use later\n \/\/when scheduling threads to CPU\n Process* dummy_proc = NULL;\n\n this->thread[i] = new Thread(this, i, dummy_proc, i);\n \/\/usedTids[i] = false;\n }\n#endif \/\/ !FULL_SYSTEM\n\n ThreadContext *tc;\n\n \/\/ Setup the TC that will serve as the interface to the threads\/CPU.\n AlphaTC<Impl> *alpha_tc =\n new AlphaTC<Impl>;\n\n tc = alpha_tc;\n\n \/\/ If we're using a checker, then the TC should be the\n \/\/ CheckerThreadContext.\n#if USE_CHECKER\n if (params->checker) {\n tc = new CheckerThreadContext<AlphaTC<Impl> >(\n alpha_tc, this->checker);\n }\n#endif\n\n alpha_tc->cpu = this;\n alpha_tc->thread = this->thread[i];\n\n#if FULL_SYSTEM\n \/\/ Setup quiesce event.\n this->thread[i]->quiesceEvent = new EndQuiesceEvent(tc);\n\n Port *mem_port;\n FunctionalPort *phys_port;\n VirtualPort *virt_port;\n phys_port = new FunctionalPort(csprintf(\"%s-%d-funcport\",\n name(), i));\n mem_port = this->system->physmem->getPort(\"functional\");\n mem_port->setPeer(phys_port);\n phys_port->setPeer(mem_port);\n\n virt_port = new VirtualPort(csprintf(\"%s-%d-vport\",\n name(), i));\n mem_port = this->system->physmem->getPort(\"functional\");\n mem_port->setPeer(virt_port);\n virt_port->setPeer(mem_port);\n\n this->thread[i]->setPhysPort(phys_port);\n this->thread[i]->setVirtPort(virt_port);\n#endif\n \/\/ Give the thread the TC.\n this->thread[i]->tc = tc;\n\n \/\/ Add the TC to the CPU's list of TC's.\n this->threadContexts.push_back(tc);\n }\n\n for (int i=0; i < this->numThreads; i++) {\n this->thread[i]->setFuncExeInst(0);\n }\n\n \/\/ Sets CPU pointers. These must be set at this level because the CPU\n \/\/ pointers are defined to be the highest level of CPU class.\n this->fetch.setCPU(this);\n this->decode.setCPU(this);\n this->rename.setCPU(this);\n this->iew.setCPU(this);\n this->commit.setCPU(this);\n\n this->rob.setCPU(this);\n this->regFile.setCPU(this);\n\n lockAddr = 0;\n lockFlag = false;\n}\n\ntemplate <class Impl>\nvoid\nAlphaO3CPU<Impl>::regStats()\n{\n \/\/ Register stats for everything that has stats.\n this->fullCPURegStats();\n this->fetch.regStats();\n this->decode.regStats();\n this->rename.regStats();\n this->iew.regStats();\n this->commit.regStats();\n}\n\n\ntemplate <class Impl>\nTheISA::MiscReg\nAlphaO3CPU<Impl>::readMiscReg(int misc_reg, unsigned tid)\n{\n return this->regFile.readMiscReg(misc_reg, tid);\n}\n\ntemplate <class Impl>\nTheISA::MiscReg\nAlphaO3CPU<Impl>::readMiscRegWithEffect(int misc_reg, unsigned tid)\n{\n return this->regFile.readMiscRegWithEffect(misc_reg, tid);\n}\n\ntemplate <class Impl>\nvoid\nAlphaO3CPU<Impl>::setMiscReg(int misc_reg, const MiscReg &val, unsigned tid)\n{\n this->regFile.setMiscReg(misc_reg, val, tid);\n}\n\ntemplate <class Impl>\nvoid\nAlphaO3CPU<Impl>::setMiscRegWithEffect(int misc_reg, const MiscReg &val,\n unsigned tid)\n{\n this->regFile.setMiscRegWithEffect(misc_reg, val, tid);\n}\n\ntemplate <class Impl>\nvoid\nAlphaO3CPU<Impl>::squashFromTC(unsigned tid)\n{\n this->thread[tid]->inSyscall = true;\n this->commit.generateTCEvent(tid);\n}\n\n#if FULL_SYSTEM\n\ntemplate <class Impl>\nvoid\nAlphaO3CPU<Impl>::post_interrupt(int int_num, int index)\n{\n BaseCPU::post_interrupt(int_num, index);\n\n if (this->thread[0]->status() == ThreadContext::Suspended) {\n DPRINTF(IPI,\"Suspended Processor awoke\\n\");\n this->threadContexts[0]->activate();\n }\n}\n\ntemplate <class Impl>\nFault\nAlphaO3CPU<Impl>::hwrei(unsigned tid)\n{\n \/\/ Need to clear the lock flag upon returning from an interrupt.\n this->setMiscReg(AlphaISA::MISCREG_LOCKFLAG, false, tid);\n\n this->thread[tid]->kernelStats->hwrei();\n\n this->checkInterrupts = true;\n\n \/\/ FIXME: XXX check for interrupts? XXX\n return NoFault;\n}\n\ntemplate <class Impl>\nbool\nAlphaO3CPU<Impl>::simPalCheck(int palFunc, unsigned tid)\n{\n if (this->thread[tid]->kernelStats)\n this->thread[tid]->kernelStats->callpal(palFunc,\n this->threadContexts[tid]);\n\n switch (palFunc) {\n case PAL::halt:\n halt();\n if (--System::numSystemsRunning == 0)\n exitSimLoop(\"all cpus halted\");\n break;\n\n case PAL::bpt:\n case PAL::bugchk:\n if (this->system->breakpoint())\n return false;\n break;\n }\n\n return true;\n}\n\ntemplate <class Impl>\nvoid\nAlphaO3CPU<Impl>::processInterrupts()\n{\n \/\/ Check for interrupts here. For now can copy the code that\n \/\/ exists within isa_fullsys_traits.hh. Also assume that thread 0\n \/\/ is the one that handles the interrupts.\n \/\/ @todo: Possibly consolidate the interrupt checking code.\n \/\/ @todo: Allow other threads to handle interrupts.\n\n \/\/ Check if there are any outstanding interrupts\n \/\/Handle the interrupts\n Fault interrupt = this->interrupts.getInterrupt(this->tcBase(0));\n\n if (interrupt != NoFault) {\n this->checkInterrupts = false;\n this->trap(interrupt, 0);\n }\n}\n\n#endif \/\/ FULL_SYSTEM\n\ntemplate <class Impl>\nvoid\nAlphaO3CPU<Impl>::trap(Fault fault, unsigned tid)\n{\n \/\/ Pass the thread's TC into the invoke method.\n fault->invoke(this->threadContexts[tid]);\n}\n\n#if !FULL_SYSTEM\n\ntemplate <class Impl>\nvoid\nAlphaO3CPU<Impl>::syscall(int64_t callnum, int tid)\n{\n DPRINTF(O3CPU, \"[tid:%i] Executing syscall().\\n\\n\", tid);\n\n DPRINTF(Activity,\"Activity: syscall() called.\\n\");\n\n \/\/ Temporarily increase this by one to account for the syscall\n \/\/ instruction.\n ++(this->thread[tid]->funcExeInst);\n\n \/\/ Execute the actual syscall.\n this->thread[tid]->syscall(callnum);\n\n \/\/ Decrease funcExeInst by one as the normal commit will handle\n \/\/ incrementing it.\n --(this->thread[tid]->funcExeInst);\n}\n\ntemplate <class Impl>\nTheISA::IntReg\nAlphaO3CPU<Impl>::getSyscallArg(int i, int tid)\n{\n return this->readArchIntReg(AlphaISA::ArgumentReg0 + i, tid);\n}\n\ntemplate <class Impl>\nvoid\nAlphaO3CPU<Impl>::setSyscallArg(int i, IntReg val, int tid)\n{\n this->setArchIntReg(AlphaISA::ArgumentReg0 + i, val, tid);\n}\n\ntemplate <class Impl>\nvoid\nAlphaO3CPU<Impl>::setSyscallReturn(SyscallReturn return_value, int tid)\n{\n \/\/ check for error condition. Alpha syscall convention is to\n \/\/ indicate success\/failure in reg a3 (r19) and put the\n \/\/ return value itself in the standard return value reg (v0).\n if (return_value.successful()) {\n \/\/ no error\n this->setArchIntReg(TheISA::SyscallSuccessReg, 0, tid);\n this->setArchIntReg(TheISA::ReturnValueReg, return_value.value(), tid);\n } else {\n \/\/ got an error, return details\n this->setArchIntReg(TheISA::SyscallSuccessReg, (IntReg) -1, tid);\n this->setArchIntReg(TheISA::ReturnValueReg, -return_value.value(), tid);\n }\n}\n#endif\n<|endoftext|>"} {"text":"<commit_before>#include \"KeyIDClient.h\"\n#include <cpprest\/filestream.h>\n#include <chrono>\n\nusing namespace std;\nusing namespace web;\nusing namespace web::http;\nusing namespace web::http::client;\nusing namespace concurrency::streams;\n\n\/\/\/ <summary>\n\/\/\/ KeyID services client.\n\/\/\/ <\/summary>\n\/\/\/ <param name=\"settings\"> KeyID settings struct<\/param>\nKeyIDClient::KeyIDClient(KeyIDSettings settings)\n{\n\tthis->settings = settings;\n\tthis->service = make_shared<KeyIDService>(settings.url, settings.license, settings.timeout);\n}\n\nKeyIDClient::KeyIDClient()\n{\n\tthis->service = make_shared<KeyIDService>(settings.url, settings.license, settings.timeout);\n}\n\n\/\/\/ <summary>\n\/\/\/ KeyID client destructor.\n\/\/\/ <\/summary>\nKeyIDClient::~KeyIDClient()\n{\n}\n\nconst KeyIDSettings& KeyIDClient::GetSettings()\n{\n\treturn settings;\n}\n\nvoid KeyIDClient::SetSettings(KeyIDSettings settings)\n{\n\tthis->settings = settings;\n}\n\n\/\/\/ <summary>\n\/\/\/ Saves a given KeyID profile entry.\n\/\/\/ <\/summary>\n\/\/\/ <param name=\"entityID\">Profile name to save.<\/param>\n\/\/\/ <param name=\"tsData\">Typing sample data to save.<\/param>\n\/\/\/ <param name=\"sessionID\">Session identifier for logging purposes.<\/param>\n\/\/\/ <returns>JSON value (task)<\/returns>\npplx::task<web::json::value> KeyIDClient::SaveProfile(std::wstring entityID, std::wstring tsData, std::wstring sessionID)\n{\n\t\/*\n\t\/\/ try to save profile without a token\n\treturn service->SaveProfile(entityID, tsData)\n\t.then([=](http_response response)\n\t{\n\t\tjson::value data = ParseResponse(response);\n\n\t\t\/\/ token is required\n\t\tif (data[L\"Error\"].as_string() != L\"\")\n\t\t{\n\t\t\t\/\/ get a save token\n\t\t\treturn service->SaveToken(entityID, tsData)\n\t\t\t.then([=](http_response response)\n\t\t\t{\n\t\t\t\tjson::value data = ParseResponse(response);\n\t\t\t\t\/\/ try to save profile with a token\n\t\t\t\treturn service->SaveProfile(entityID, tsData, data[L\"Token\"].as_string());\n\t\t\t})\n\t\t\t.then([=](http_response response)\n\t\t\t{\n\t\t\t\tjson::value data = ParseResponse(response);\n\t\t\t\t\/\/todo this isn't a task?\n\t\t\t\treturn data;\n\t\t\t});\n\t\t}\n\n\t\treturn pplx::task_from_result(data);\n\t});\n\t*\/\n\n\t\/\/ get a save token\n\treturn service->SaveToken(entityID, tsData)\n\t\t.then([=](http_response response)\n\t{\n\t\tjson::value data = ParseResponse(response);\n\t\t\/\/ try to save profile with a token\n\t\treturn service->SaveProfile(entityID, tsData, data[L\"Token\"].as_string());\n\t})\n\t\t.then([=](http_response response)\n\t{\n\t\tjson::value data = ParseResponse(response);\n\t\t\/\/todo this isn't a task?\n\t\treturn data;\n\t});\n}\n\n\/\/\/ <summary>\n\/\/\/ Removes a KeyID profile.\n\/\/\/ <\/summary>\n\/\/\/ <param name=\"entityID\">Profile name to remove.<\/param>\n\/\/\/ <param name=\"tsData\">Optional typing sample for removal authorization.<\/param>\n\/\/\/ <param name=\"sessionID\">Session identifier for logging purposes.<\/param>\n\/\/\/ <returns>JSON value (task)<\/returns>\npplx::task<web::json::value> KeyIDClient::RemoveProfile(std::wstring entityID, std::wstring tsData, std::wstring sessionID)\n{\n\t\/\/ get a removal token\n\treturn service->RemoveToken(entityID, tsData)\n\t.then([=](http_response response)\n\t{\n\t\tjson::value data = ParseResponse(response);\n\n\t\t\/\/ remove profile\n\t\tif (data.has_field(L\"Token\")) {\n\t\t\treturn service->RemoveProfile(entityID, data[L\"Token\"].as_string())\n\t\t\t\t.then([=](http_response response)\n\t\t\t{\n\t\t\t\tjson::value data = ParseResponse(response);\n\t\t\t\treturn pplx::task_from_result(data);\n\t\t\t});\n\t\t}\n\t\telse\n\t\t\treturn pplx::task_from_result(data);\n\t});\n}\n\n\/\/\/ <summary>\n\/\/\/ Evaluates a KeyID profile.\n\/\/\/ <\/summary>\n\/\/\/ <param name=\"entityID\">Profile name to evaluate.<\/param>\n\/\/\/ <param name=\"tsData\">Typing sample to evaluate against profile.<\/param>\n\/\/\/ <param name=\"sessionID\">Session identifier for logging purposes.<\/param>\n\/\/\/ <returns><\/returns>\npplx::task<web::json::value> KeyIDClient::EvaluateProfile(std::wstring entityID, std::wstring tsData, std::wstring sessionID)\n{\n\tlong long nonceTime = DotNetTicks();\n\n\treturn service->Nonce(nonceTime)\n\t.then([=](http_response response)\n\t{\n\t\treturn service->EvaluateSample(entityID, tsData, response.extract_string().get());\n\t})\n\t.then([=](http_response response)\n\t{\n\t\tjson::value data = ParseResponse(response);\n\n\t\t\/\/ return early if there is an error\n\t\tif (data[L\"Error\"].as_string() != L\"\")\n\t\t{\n\t\t\treturn data;\n\t\t}\n\n\t\t\/\/ coerce string to boolean\n\t\tdata[L\"Match\"] = json::value::boolean(AlphaToBool(data[L\"Match\"].as_string()));\n\t\tdata[L\"IsReady\"] = json::value::boolean(AlphaToBool(data[L\"IsReady\"].as_string()));\n\n\t\t\/\/ set match to true and return early if using passive validation\n\t\tif (settings.passiveValidation)\n\t\t{\n\t\t\tdata[L\"Match\"] = json::value::boolean(true);\n\t\t\treturn data;\n\t\t}\n\t\t\/\/ evaluate match value using custom threshold if enabled\n\t\telse if (settings.customThreshold)\n\t\t{\n\t\t\tdata[L\"Match\"] = json::value::boolean(EvalThreshold(data[L\"Confidence\"].as_double(), data[L\"Fidelity\"].as_double()));\n\t\t}\n\n\t\treturn data;\n\t});\n}\n\n\/\/\/ <summary>\n\/\/\/ Evaluates a given profile and adds typing sample to profile.\n\/\/\/ <\/summary>\n\/\/\/ <param name=\"entityID\">Profile to evaluate.<\/param>\n\/\/\/ <param name=\"tsData\">Typing sample to evaluate and save.<\/param>\n\/\/\/ <param name=\"sessionID\">Session identifier for logging purposes.<\/param>\n\/\/\/ <returns><\/returns>\npplx::task<web::json::value> KeyIDClient::LoginPassiveEnrollment(std::wstring entityID, std::wstring tsData, std::wstring sessionID)\n{\n\treturn EvaluateProfile(entityID, tsData, sessionID)\n\t.then([=](json::value data)\n\t{\n\t\t\/\/ in base case that no profile exists save profile async and return early\n\t\tif (data[L\"Error\"].as_string() == L\"EntityID does not exist.\" ||\n\t\t\tdata[L\"Error\"].as_string() == L\"The profile has too little data for a valid evaluation.\" ||\n\t\t\tdata[L\"Error\"].as_string() == L\"The entry varied so much from the model, no evaluation is possible.\")\n\t\t{\n\t\t\treturn SaveProfile(entityID, tsData, sessionID)\n\t\t\t.then([=](json::value saveData)\n\t\t\t{\n\t\t\t\tjson::value evalData = data;\n\t\t\t\tevalData[L\"Match\"] = json::value::boolean(true);\n\t\t\t\tevalData[L\"IsReady\"] = json::value::boolean(false);\n\t\t\t\tevalData[L\"Confidence\"] = json::value::number(100.0);\n\t\t\t\tevalData[L\"Fidelity\"] = json::value::number(100.0);\n\t\t\t\treturn evalData;\n\t\t\t});\n\t\t}\n\n\t\t\/\/ if profile is not ready save profile async and return early\n\t\tif (data[L\"IsReady\"].as_bool() == false)\n\t\t{\n\t\t\treturn SaveProfile(entityID, tsData, sessionID)\n\t\t\t.then([=](json::value saveData)\n\t\t\t{\n\t\t\t\tjson::value evalData = data;\n\t\t\t\tevalData[L\"Match\"] = json::value::boolean(true);\n\t\t\t\treturn evalData;\n\t\t\t});\n\t\t}\n\n\t\treturn pplx::task_from_result(data);\n\t});\n}\n\n\/\/\/ <summary>\n\/\/\/ Returns profile information without modifying the profile.\n\/\/\/ <\/summary>\n\/\/\/ <param name=\"entityID\">Profile to inspect.<\/param>\n\/\/\/ <returns><\/returns>\npplx::task<web::json::value> KeyIDClient::GetProfileInfo(std::wstring entityID)\n{\n\treturn service->GetProfileInfo(entityID)\n\t.then([=](http_response response)\n\t{\n\t\tjson::value data = ParseResponse(response);\n\t\treturn pplx::task_from_result(data);\n\t});\n}\n\n\/\/\/ <summary>\n\/\/\/ Compares a given confidence and fidelity against pre-determined thresholds.\n\/\/\/ <\/summary>\n\/\/\/ <param name=\"confidence\">KeyID evaluation confidence.<\/param>\n\/\/\/ <param name=\"fidelity\">KeyID evaluation fidelity.<\/param>\n\/\/\/ <returns>Whether confidence and fidelity meet thresholds.<\/returns>\nbool KeyIDClient::EvalThreshold(double confidence, double fidelity)\n{\n\tif (confidence >= settings.thresholdConfidence &&\n\t\tfidelity >= settings.thresholdFidelity)\n\t{\n\t\treturn true;\n\t}\n\telse\n\t{\n\t\treturn false;\n\t}\n}\n\n\/\/\/ <summary>\n\/\/\/ Converts a string value like 'true' to a boolean object.\n\/\/\/ <\/summary>\n\/\/\/ <param name=\"input\">String to convert to boolean.<\/param>\n\/\/\/ <returns>Boolean value.<\/returns>\nbool KeyIDClient::AlphaToBool(std::wstring input)\n{\n\tstd::transform(input.begin(), input.end(), input.begin(), ::toupper);\n\n\tif (input == L\"TRUE\")\n\t\treturn true;\n\telse\n\t\treturn false;\n}\n\n\/\/\/ <summary>\n\/\/\/ Converts current time to Microsoft .Net 'ticks'. A tick is 100 nanoseconds.\n\/\/\/ <\/summary>\n\/\/\/ <returns>Current time in 'ticks'.<\/returns>\nlong long KeyIDClient::DotNetTicks()\n{\n\tconst long long EPOCH_OFFSET = 621355968000000000;\n\tconst long MS_PER_TICK = 10000;\n\tlong long ms_since_epoch = std::chrono::duration_cast<std::chrono::milliseconds>(std::chrono::system_clock::now().time_since_epoch()).count();\n\tlong long ticks = ((ms_since_epoch * MS_PER_TICK) + EPOCH_OFFSET);\n\treturn ticks;\n}\n\n\/\/\/ <summary>\n\/\/\/ Extracts a JSON value from a http_response\n\/\/\/ <\/summary>\n\/\/\/ <param name=\"response\">HTTP response<\/param>\n\/\/\/ <returns>JSON value<\/returns>\nweb::json::value KeyIDClient::ParseResponse(const web::http::http_response& response)\n{\n\tif (response.status_code() == status_codes::OK)\n\t{\n\t\treturn response.extract_json().get();\n\t}\n\telse\n\t{\n\t\tthrow http_exception(L\"HTTP response not 200 OK.\");\n\t}\n}<commit_msg>Oops commit.<commit_after>#include \"KeyIDClient.h\"\n#include <cpprest\/filestream.h>\n#include <chrono>\n\nusing namespace std;\nusing namespace web;\nusing namespace web::http;\nusing namespace web::http::client;\nusing namespace concurrency::streams;\n\n\/\/\/ <summary>\n\/\/\/ KeyID services client.\n\/\/\/ <\/summary>\n\/\/\/ <param name=\"settings\"> KeyID settings struct<\/param>\nKeyIDClient::KeyIDClient(KeyIDSettings settings)\n{\n\tthis->settings = settings;\n\tthis->service = make_shared<KeyIDService>(settings.url, settings.license, settings.timeout);\n}\n\nKeyIDClient::KeyIDClient()\n{\n\tthis->service = make_shared<KeyIDService>(settings.url, settings.license, settings.timeout);\n}\n\n\/\/\/ <summary>\n\/\/\/ KeyID client destructor.\n\/\/\/ <\/summary>\nKeyIDClient::~KeyIDClient()\n{\n}\n\nconst KeyIDSettings& KeyIDClient::GetSettings()\n{\n\treturn settings;\n}\n\nvoid KeyIDClient::SetSettings(KeyIDSettings settings)\n{\n\tthis->settings = settings;\n}\n\n\/\/\/ <summary>\n\/\/\/ Saves a given KeyID profile entry.\n\/\/\/ <\/summary>\n\/\/\/ <param name=\"entityID\">Profile name to save.<\/param>\n\/\/\/ <param name=\"tsData\">Typing sample data to save.<\/param>\n\/\/\/ <param name=\"sessionID\">Session identifier for logging purposes.<\/param>\n\/\/\/ <returns>JSON value (task)<\/returns>\npplx::task<web::json::value> KeyIDClient::SaveProfile(std::wstring entityID, std::wstring tsData, std::wstring sessionID)\n{\n\t\/\/ try to save profile without a token\n\treturn service->SaveProfile(entityID, tsData)\n\t.then([=](http_response response)\n\t{\n\t\tjson::value data = ParseResponse(response);\n\n\t\t\/\/ token is required\n\t\tif (data[L\"Error\"].as_string() != L\"\")\n\t\t{\n\t\t\t\/\/ get a save token\n\t\t\treturn service->SaveToken(entityID, tsData)\n\t\t\t.then([=](http_response response)\n\t\t\t{\n\t\t\t\tjson::value data = ParseResponse(response);\n\t\t\t\t\/\/ try to save profile with a token\n\t\t\t\treturn service->SaveProfile(entityID, tsData, data[L\"Token\"].as_string());\n\t\t\t})\n\t\t\t.then([=](http_response response)\n\t\t\t{\n\t\t\t\tjson::value data = ParseResponse(response);\n\t\t\t\t\/\/todo this isn't a task?\n\t\t\t\treturn data;\n\t\t\t});\n\t\t}\n\n\t\treturn pplx::task_from_result(data);\n\t});\n}\n\n\/\/\/ <summary>\n\/\/\/ Removes a KeyID profile.\n\/\/\/ <\/summary>\n\/\/\/ <param name=\"entityID\">Profile name to remove.<\/param>\n\/\/\/ <param name=\"tsData\">Optional typing sample for removal authorization.<\/param>\n\/\/\/ <param name=\"sessionID\">Session identifier for logging purposes.<\/param>\n\/\/\/ <returns>JSON value (task)<\/returns>\npplx::task<web::json::value> KeyIDClient::RemoveProfile(std::wstring entityID, std::wstring tsData, std::wstring sessionID)\n{\n\t\/\/ get a removal token\n\treturn service->RemoveToken(entityID, tsData)\n\t.then([=](http_response response)\n\t{\n\t\tjson::value data = ParseResponse(response);\n\n\t\t\/\/ remove profile\n\t\tif (data.has_field(L\"Token\")) {\n\t\t\treturn service->RemoveProfile(entityID, data[L\"Token\"].as_string())\n\t\t\t\t.then([=](http_response response)\n\t\t\t{\n\t\t\t\tjson::value data = ParseResponse(response);\n\t\t\t\treturn pplx::task_from_result(data);\n\t\t\t});\n\t\t}\n\t\telse\n\t\t\treturn pplx::task_from_result(data);\n\t});\n}\n\n\/\/\/ <summary>\n\/\/\/ Evaluates a KeyID profile.\n\/\/\/ <\/summary>\n\/\/\/ <param name=\"entityID\">Profile name to evaluate.<\/param>\n\/\/\/ <param name=\"tsData\">Typing sample to evaluate against profile.<\/param>\n\/\/\/ <param name=\"sessionID\">Session identifier for logging purposes.<\/param>\n\/\/\/ <returns><\/returns>\npplx::task<web::json::value> KeyIDClient::EvaluateProfile(std::wstring entityID, std::wstring tsData, std::wstring sessionID)\n{\n\tlong long nonceTime = DotNetTicks();\n\n\treturn service->Nonce(nonceTime)\n\t.then([=](http_response response)\n\t{\n\t\treturn service->EvaluateSample(entityID, tsData, response.extract_string().get());\n\t})\n\t.then([=](http_response response)\n\t{\n\t\tjson::value data = ParseResponse(response);\n\n\t\t\/\/ return early if there is an error\n\t\tif (data[L\"Error\"].as_string() != L\"\")\n\t\t{\n\t\t\treturn data;\n\t\t}\n\n\t\t\/\/ coerce string to boolean\n\t\tdata[L\"Match\"] = json::value::boolean(AlphaToBool(data[L\"Match\"].as_string()));\n\t\tdata[L\"IsReady\"] = json::value::boolean(AlphaToBool(data[L\"IsReady\"].as_string()));\n\n\t\t\/\/ set match to true and return early if using passive validation\n\t\tif (settings.passiveValidation)\n\t\t{\n\t\t\tdata[L\"Match\"] = json::value::boolean(true);\n\t\t\treturn data;\n\t\t}\n\t\t\/\/ evaluate match value using custom threshold if enabled\n\t\telse if (settings.customThreshold)\n\t\t{\n\t\t\tdata[L\"Match\"] = json::value::boolean(EvalThreshold(data[L\"Confidence\"].as_double(), data[L\"Fidelity\"].as_double()));\n\t\t}\n\n\t\treturn data;\n\t});\n}\n\n\/\/\/ <summary>\n\/\/\/ Evaluates a given profile and adds typing sample to profile.\n\/\/\/ <\/summary>\n\/\/\/ <param name=\"entityID\">Profile to evaluate.<\/param>\n\/\/\/ <param name=\"tsData\">Typing sample to evaluate and save.<\/param>\n\/\/\/ <param name=\"sessionID\">Session identifier for logging purposes.<\/param>\n\/\/\/ <returns><\/returns>\npplx::task<web::json::value> KeyIDClient::LoginPassiveEnrollment(std::wstring entityID, std::wstring tsData, std::wstring sessionID)\n{\n\treturn EvaluateProfile(entityID, tsData, sessionID)\n\t.then([=](json::value data)\n\t{\n\t\t\/\/ in base case that no profile exists save profile async and return early\n\t\tif (data[L\"Error\"].as_string() == L\"EntityID does not exist.\" ||\n\t\t\tdata[L\"Error\"].as_string() == L\"The profile has too little data for a valid evaluation.\" ||\n\t\t\tdata[L\"Error\"].as_string() == L\"The entry varied so much from the model, no evaluation is possible.\")\n\t\t{\n\t\t\treturn SaveProfile(entityID, tsData, sessionID)\n\t\t\t.then([=](json::value saveData)\n\t\t\t{\n\t\t\t\tjson::value evalData = data;\n\t\t\t\tevalData[L\"Match\"] = json::value::boolean(true);\n\t\t\t\tevalData[L\"IsReady\"] = json::value::boolean(false);\n\t\t\t\tevalData[L\"Confidence\"] = json::value::number(100.0);\n\t\t\t\tevalData[L\"Fidelity\"] = json::value::number(100.0);\n\t\t\t\treturn evalData;\n\t\t\t});\n\t\t}\n\n\t\t\/\/ if profile is not ready save profile async and return early\n\t\tif (data[L\"IsReady\"].as_bool() == false)\n\t\t{\n\t\t\treturn SaveProfile(entityID, tsData, sessionID)\n\t\t\t.then([=](json::value saveData)\n\t\t\t{\n\t\t\t\tjson::value evalData = data;\n\t\t\t\tevalData[L\"Match\"] = json::value::boolean(true);\n\t\t\t\treturn evalData;\n\t\t\t});\n\t\t}\n\n\t\treturn pplx::task_from_result(data);\n\t});\n}\n\n\/\/\/ <summary>\n\/\/\/ Returns profile information without modifying the profile.\n\/\/\/ <\/summary>\n\/\/\/ <param name=\"entityID\">Profile to inspect.<\/param>\n\/\/\/ <returns><\/returns>\npplx::task<web::json::value> KeyIDClient::GetProfileInfo(std::wstring entityID)\n{\n\treturn service->GetProfileInfo(entityID)\n\t.then([=](http_response response)\n\t{\n\t\tjson::value data = ParseResponse(response);\n\t\treturn pplx::task_from_result(data);\n\t});\n}\n\n\/\/\/ <summary>\n\/\/\/ Compares a given confidence and fidelity against pre-determined thresholds.\n\/\/\/ <\/summary>\n\/\/\/ <param name=\"confidence\">KeyID evaluation confidence.<\/param>\n\/\/\/ <param name=\"fidelity\">KeyID evaluation fidelity.<\/param>\n\/\/\/ <returns>Whether confidence and fidelity meet thresholds.<\/returns>\nbool KeyIDClient::EvalThreshold(double confidence, double fidelity)\n{\n\tif (confidence >= settings.thresholdConfidence &&\n\t\tfidelity >= settings.thresholdFidelity)\n\t{\n\t\treturn true;\n\t}\n\telse\n\t{\n\t\treturn false;\n\t}\n}\n\n\/\/\/ <summary>\n\/\/\/ Converts a string value like 'true' to a boolean object.\n\/\/\/ <\/summary>\n\/\/\/ <param name=\"input\">String to convert to boolean.<\/param>\n\/\/\/ <returns>Boolean value.<\/returns>\nbool KeyIDClient::AlphaToBool(std::wstring input)\n{\n\tstd::transform(input.begin(), input.end(), input.begin(), ::toupper);\n\n\tif (input == L\"TRUE\")\n\t\treturn true;\n\telse\n\t\treturn false;\n}\n\n\/\/\/ <summary>\n\/\/\/ Converts current time to Microsoft .Net 'ticks'. A tick is 100 nanoseconds.\n\/\/\/ <\/summary>\n\/\/\/ <returns>Current time in 'ticks'.<\/returns>\nlong long KeyIDClient::DotNetTicks()\n{\n\tconst long long EPOCH_OFFSET = 621355968000000000;\n\tconst long MS_PER_TICK = 10000;\n\tlong long ms_since_epoch = std::chrono::duration_cast<std::chrono::milliseconds>(std::chrono::system_clock::now().time_since_epoch()).count();\n\tlong long ticks = ((ms_since_epoch * MS_PER_TICK) + EPOCH_OFFSET);\n\treturn ticks;\n}\n\n\/\/\/ <summary>\n\/\/\/ Extracts a JSON value from a http_response\n\/\/\/ <\/summary>\n\/\/\/ <param name=\"response\">HTTP response<\/param>\n\/\/\/ <returns>JSON value<\/returns>\nweb::json::value KeyIDClient::ParseResponse(const web::http::http_response& response)\n{\n\tif (response.status_code() == status_codes::OK)\n\t{\n\t\treturn response.extract_json().get();\n\t}\n\telse\n\t{\n\t\tthrow http_exception(L\"HTTP response not 200 OK.\");\n\t}\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-2017 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 \"spellsuggestionsitem.h\"\n#include \"..\/Common\/defines.h\"\n#include \"..\/Common\/imetadataoperator.h\"\n#include \"..\/Common\/basickeywordsmodel.h\"\n#include \"..\/Common\/basicmetadatamodel.h\"\n\nnamespace SpellCheck {\n SpellSuggestionsItem::SpellSuggestionsItem(const QString &word, const QString &origin) :\n QAbstractListModel(),\n m_Word(word),\n m_ReplacementOrigin(origin),\n m_ReplacementIndex(-1),\n m_ReplacementSucceeded(false)\n {\n }\n\n SpellSuggestionsItem::SpellSuggestionsItem(const QString &word):\n QAbstractListModel(),\n m_Word(word),\n m_ReplacementOrigin(word),\n m_ReplacementIndex(-1),\n m_ReplacementSucceeded(false)\n {\n }\n\n SpellSuggestionsItem::~SpellSuggestionsItem() {\n\n }\n\n bool SpellSuggestionsItem::setReplacementIndex(int value) {\n bool result = (value != m_ReplacementIndex) && (value != -1);\n\n if (result) {\n QVector<int> roles;\n roles << IsSelectedRole;\n int prevIndexToUpdate = m_ReplacementIndex;\n m_ReplacementIndex = value;\n\n if (prevIndexToUpdate != -1) {\n QModelIndex prev = this->index(prevIndexToUpdate);\n emit dataChanged(prev, prev, roles);\n }\n\n QModelIndex curr = this->index(value);\n emit dataChanged(curr, curr, roles);\n } else {\n if ((value == m_ReplacementIndex) ||\n (value == -1 && m_ReplacementIndex != -1)) {\n int prevIndexToUpdate = m_ReplacementIndex;\n m_ReplacementIndex = -1;\n\n QModelIndex prev = this->index(prevIndexToUpdate);\n QVector<int> roles;\n roles << IsSelectedRole;\n emit dataChanged(prev, prev, roles);\n result = true;\n }\n }\n\n return result;\n }\n\n void SpellSuggestionsItem::setSuggestions(const QStringList &suggestions) {\n beginResetModel();\n m_Suggestions.clear();\n m_Suggestions.append(suggestions);\n endResetModel();\n }\n\n int SpellSuggestionsItem::rowCount(const QModelIndex &parent) const {\n Q_UNUSED(parent);\n return m_Suggestions.length();\n }\n\n QVariant SpellSuggestionsItem::data(const QModelIndex &index, int role) const {\n int row = index.row();\n if (row < 0 || row >= m_Suggestions.length()) { return QVariant(); }\n\n switch (role) {\n case SuggestionRole:\n return m_Suggestions.at(row);\n case IsSelectedRole:\n return (m_ReplacementIndex == row);\n default:\n return QVariant();\n }\n }\n\n Qt::ItemFlags SpellSuggestionsItem::flags(const QModelIndex &index) const {\n int row = index.row();\n if (row < 0 || row >= m_Suggestions.length()) {\n return Qt::ItemIsEnabled;\n }\n\n return QAbstractItemModel::flags(index) | Qt::ItemIsEditable;\n }\n\n bool SpellSuggestionsItem::setData(const QModelIndex &index, const QVariant &value, int role) {\n int row = index.row();\n if (row < 0 || row >= m_Suggestions.length()) return false;\n\n bool result = false;\n\n switch (role) {\n case EditReplacementIndexRole:\n result = setReplacementIndex(value.toInt());\n break;\n default:\n return false;\n }\n\n return result;\n }\n\n QHash<int, QByteArray> SpellSuggestionsItem::roleNames() const {\n QHash<int, QByteArray> roles;\n roles[SuggestionRole] = \"suggestion\";\n roles[IsSelectedRole] = \"isselected\";\n roles[EditReplacementIndexRole] = \"editreplacementindex\";\n return roles;\n }\n\n KeywordSpellSuggestions::KeywordSpellSuggestions(const QString &keyword, int originalIndex, const QString &origin) :\n SpellSuggestionsItem(keyword, origin),\n m_OriginalIndex(originalIndex),\n m_ReplaceResult(Common::KeywordReplaceResult::Unknown)\n {\n }\n\n KeywordSpellSuggestions::KeywordSpellSuggestions(const QString &keyword, int originalIndex):\n SpellSuggestionsItem(keyword),\n m_OriginalIndex(originalIndex),\n m_ReplaceResult(Common::KeywordReplaceResult::Unknown)\n {\n }\n\n KeywordSpellSuggestions::~KeywordSpellSuggestions() {\n }\n\n void KeywordSpellSuggestions::replaceToSuggested() {\n if (anyReplacementSelected()) {\n const QString &word = getWord();\n const QString &replacement = getReplacement();\n this->replaceToSuggested(word, replacement);\n }\n }\n\n void KeywordSpellSuggestions::replaceToSuggested(const QString &word, const QString &replacement) {\n LOG_INFO << word << \"-->\" << replacement;\n auto *item = getMetadataOperator();\n Common::KeywordReplaceResult result = item->fixKeywordSpelling(m_OriginalIndex, word, replacement);\n setReplacementSucceeded(result == Common::KeywordReplaceResult::Succeeded);\n m_ReplaceResult = result;\n }\n\n DescriptionSpellSuggestions::DescriptionSpellSuggestions(const QString &word):\n SpellSuggestionsItem(word)\n {\n }\n\n DescriptionSpellSuggestions::~DescriptionSpellSuggestions() {\n }\n\n void DescriptionSpellSuggestions::replaceToSuggested() {\n if (anyReplacementSelected()) {\n const QString &word = getWord();\n const QString &replacement = getReplacement();\n this->replaceToSuggested(word, replacement);\n }\n }\n\n void DescriptionSpellSuggestions::replaceToSuggested(const QString &word, const QString &replacement) {\n LOG_INFO << word << \"-->\" << replacement;\n auto *item = getMetadataOperator();\n bool success = item->fixDescriptionSpelling(word, replacement);\n setReplacementSucceeded(success);\n\n if (!success) {\n LOG_WARNING << \"Failed to replace in description\" << word << \"to\" << replacement;\n }\n }\n\n TitleSpellSuggestions::TitleSpellSuggestions(const QString &word):\n SpellSuggestionsItem(word)\n {\n }\n\n TitleSpellSuggestions::~TitleSpellSuggestions() {\n }\n\n void TitleSpellSuggestions::replaceToSuggested() {\n if (anyReplacementSelected()) {\n const QString &word = getWord();\n const QString &replacement = getReplacement();\n this->replaceToSuggested(word, replacement);\n }\n }\n\n void TitleSpellSuggestions::replaceToSuggested(const QString &word, const QString &replacement) {\n LOG_INFO << word << \"-->\" << replacement;\n auto *item = getMetadataOperator();\n bool success = item->fixTitleSpelling(word, replacement);\n setReplacementSucceeded(success);\n\n if (!success) {\n LOG_WARNING << \"Failed to replace in title\" << word << \"to\" << replacement;\n }\n }\n\n CombinedSpellSuggestions::CombinedSpellSuggestions(const QString &word, std::vector<std::shared_ptr<SpellSuggestionsItem> > &suggestions):\n SpellSuggestionsItem(word, tr(\"multireplace\")),\n m_SpellSuggestions(std::move(suggestions))\n {\n Q_ASSERT(!m_SpellSuggestions.empty());\n }\n\n CombinedSpellSuggestions::~CombinedSpellSuggestions() {\n }\n\n std::vector<std::shared_ptr<KeywordSpellSuggestions> > CombinedSpellSuggestions::getKeywordsDuplicateSuggestions() const {\n std::vector<std::shared_ptr<KeywordSpellSuggestions> > keywordsSuggestions;\n\n for (auto &item: m_SpellSuggestions) {\n std::shared_ptr<KeywordSpellSuggestions> keywordsItem = std::dynamic_pointer_cast<KeywordSpellSuggestions>(item);\n if (keywordsItem && keywordsItem->isPotentialDuplicate()) {\n keywordsSuggestions.push_back(keywordsItem);\n }\n }\n\n return keywordsSuggestions;\n }\n\n void CombinedSpellSuggestions::replaceToSuggested() {\n if (anyReplacementSelected()) {\n const QString &word = getWord();\n const QString &replacement = getReplacement();\n this->replaceToSuggested(word, replacement);\n }\n }\n\n void CombinedSpellSuggestions::replaceToSuggested(const QString &word, const QString &replacement) {\n size_t size = m_SpellSuggestions.size();\n LOG_INFO << size << \"item(s)\";\n bool anySucceeded = false;\n\n for (size_t i = 0; i < size; ++i) {\n auto &suggestionItem = m_SpellSuggestions.at(i);\n suggestionItem->replaceToSuggested(word, replacement);\n\n LOG_INTEGRATION_TESTS << i << \"item's result is:\" << suggestionItem->getReplacementSucceeded();\n\n if (suggestionItem->getReplacementSucceeded()) {\n anySucceeded = true;\n }\n }\n\n setReplacementSucceeded(anySucceeded);\n }\n}\n<commit_msg>Cosmetic improvements [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-2017 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 \"spellsuggestionsitem.h\"\n#include \"..\/Common\/defines.h\"\n#include \"..\/Common\/imetadataoperator.h\"\n#include \"..\/Common\/basickeywordsmodel.h\"\n#include \"..\/Common\/basicmetadatamodel.h\"\n\nnamespace SpellCheck {\n SpellSuggestionsItem::SpellSuggestionsItem(const QString &word, const QString &origin) :\n QAbstractListModel(),\n m_MetadataOperator(nullptr),\n m_Word(word),\n m_ReplacementOrigin(origin),\n m_ReplacementIndex(-1),\n m_ReplacementSucceeded(false)\n {\n }\n\n SpellSuggestionsItem::SpellSuggestionsItem(const QString &word):\n QAbstractListModel(),\n m_MetadataOperator(nullptr),\n m_Word(word),\n m_ReplacementOrigin(word),\n m_ReplacementIndex(-1),\n m_ReplacementSucceeded(false)\n {\n }\n\n SpellSuggestionsItem::~SpellSuggestionsItem() {\n\n }\n\n bool SpellSuggestionsItem::setReplacementIndex(int value) {\n bool result = (value != m_ReplacementIndex) && (value != -1);\n\n if (result) {\n QVector<int> roles;\n roles << IsSelectedRole;\n int prevIndexToUpdate = m_ReplacementIndex;\n m_ReplacementIndex = value;\n\n if (prevIndexToUpdate != -1) {\n QModelIndex prev = this->index(prevIndexToUpdate);\n emit dataChanged(prev, prev, roles);\n }\n\n QModelIndex curr = this->index(value);\n emit dataChanged(curr, curr, roles);\n } else {\n if ((value == m_ReplacementIndex) ||\n (value == -1 && m_ReplacementIndex != -1)) {\n int prevIndexToUpdate = m_ReplacementIndex;\n m_ReplacementIndex = -1;\n\n QModelIndex prev = this->index(prevIndexToUpdate);\n QVector<int> roles;\n roles << IsSelectedRole;\n emit dataChanged(prev, prev, roles);\n result = true;\n }\n }\n\n return result;\n }\n\n void SpellSuggestionsItem::setSuggestions(const QStringList &suggestions) {\n beginResetModel();\n m_Suggestions.clear();\n m_Suggestions.append(suggestions);\n endResetModel();\n }\n\n int SpellSuggestionsItem::rowCount(const QModelIndex &parent) const {\n Q_UNUSED(parent);\n return m_Suggestions.length();\n }\n\n QVariant SpellSuggestionsItem::data(const QModelIndex &index, int role) const {\n int row = index.row();\n if (row < 0 || row >= m_Suggestions.length()) { return QVariant(); }\n\n switch (role) {\n case SuggestionRole:\n return m_Suggestions.at(row);\n case IsSelectedRole:\n return (m_ReplacementIndex == row);\n default:\n return QVariant();\n }\n }\n\n Qt::ItemFlags SpellSuggestionsItem::flags(const QModelIndex &index) const {\n int row = index.row();\n if (row < 0 || row >= m_Suggestions.length()) {\n return Qt::ItemIsEnabled;\n }\n\n return QAbstractItemModel::flags(index) | Qt::ItemIsEditable;\n }\n\n bool SpellSuggestionsItem::setData(const QModelIndex &index, const QVariant &value, int role) {\n int row = index.row();\n if (row < 0 || row >= m_Suggestions.length()) return false;\n\n bool result = false;\n\n switch (role) {\n case EditReplacementIndexRole:\n result = setReplacementIndex(value.toInt());\n break;\n default:\n return false;\n }\n\n return result;\n }\n\n QHash<int, QByteArray> SpellSuggestionsItem::roleNames() const {\n QHash<int, QByteArray> roles;\n roles[SuggestionRole] = \"suggestion\";\n roles[IsSelectedRole] = \"isselected\";\n roles[EditReplacementIndexRole] = \"editreplacementindex\";\n return roles;\n }\n\n KeywordSpellSuggestions::KeywordSpellSuggestions(const QString &keyword, int originalIndex, const QString &origin) :\n SpellSuggestionsItem(keyword, origin),\n m_OriginalIndex(originalIndex),\n m_ReplaceResult(Common::KeywordReplaceResult::Unknown)\n {\n }\n\n KeywordSpellSuggestions::KeywordSpellSuggestions(const QString &keyword, int originalIndex):\n SpellSuggestionsItem(keyword),\n m_OriginalIndex(originalIndex),\n m_ReplaceResult(Common::KeywordReplaceResult::Unknown)\n {\n }\n\n KeywordSpellSuggestions::~KeywordSpellSuggestions() {\n }\n\n void KeywordSpellSuggestions::replaceToSuggested() {\n if (anyReplacementSelected()) {\n const QString &word = getWord();\n const QString &replacement = getReplacement();\n this->replaceToSuggested(word, replacement);\n }\n }\n\n void KeywordSpellSuggestions::replaceToSuggested(const QString &word, const QString &replacement) {\n LOG_INFO << word << \"-->\" << replacement;\n auto *item = getMetadataOperator();\n Common::KeywordReplaceResult result = item->fixKeywordSpelling(m_OriginalIndex, word, replacement);\n setReplacementSucceeded(result == Common::KeywordReplaceResult::Succeeded);\n m_ReplaceResult = result;\n }\n\n DescriptionSpellSuggestions::DescriptionSpellSuggestions(const QString &word):\n SpellSuggestionsItem(word)\n {\n }\n\n DescriptionSpellSuggestions::~DescriptionSpellSuggestions() {\n }\n\n void DescriptionSpellSuggestions::replaceToSuggested() {\n if (anyReplacementSelected()) {\n const QString &word = getWord();\n const QString &replacement = getReplacement();\n this->replaceToSuggested(word, replacement);\n }\n }\n\n void DescriptionSpellSuggestions::replaceToSuggested(const QString &word, const QString &replacement) {\n LOG_INFO << word << \"-->\" << replacement;\n auto *item = getMetadataOperator();\n bool success = item->fixDescriptionSpelling(word, replacement);\n setReplacementSucceeded(success);\n\n if (!success) {\n LOG_WARNING << \"Failed to replace in description\" << word << \"to\" << replacement;\n }\n }\n\n TitleSpellSuggestions::TitleSpellSuggestions(const QString &word):\n SpellSuggestionsItem(word)\n {\n }\n\n TitleSpellSuggestions::~TitleSpellSuggestions() {\n }\n\n void TitleSpellSuggestions::replaceToSuggested() {\n if (anyReplacementSelected()) {\n const QString &word = getWord();\n const QString &replacement = getReplacement();\n this->replaceToSuggested(word, replacement);\n }\n }\n\n void TitleSpellSuggestions::replaceToSuggested(const QString &word, const QString &replacement) {\n LOG_INFO << word << \"-->\" << replacement;\n auto *item = getMetadataOperator();\n bool success = item->fixTitleSpelling(word, replacement);\n setReplacementSucceeded(success);\n\n if (!success) {\n LOG_WARNING << \"Failed to replace in title\" << word << \"to\" << replacement;\n }\n }\n\n CombinedSpellSuggestions::CombinedSpellSuggestions(const QString &word, std::vector<std::shared_ptr<SpellSuggestionsItem> > &suggestions):\n SpellSuggestionsItem(word, tr(\"multireplace\")),\n m_SpellSuggestions(std::move(suggestions))\n {\n Q_ASSERT(!m_SpellSuggestions.empty());\n }\n\n CombinedSpellSuggestions::~CombinedSpellSuggestions() {\n }\n\n std::vector<std::shared_ptr<KeywordSpellSuggestions> > CombinedSpellSuggestions::getKeywordsDuplicateSuggestions() const {\n std::vector<std::shared_ptr<KeywordSpellSuggestions> > keywordsSuggestions;\n\n for (auto &item: m_SpellSuggestions) {\n std::shared_ptr<KeywordSpellSuggestions> keywordsItem = std::dynamic_pointer_cast<KeywordSpellSuggestions>(item);\n if (keywordsItem && keywordsItem->isPotentialDuplicate()) {\n keywordsSuggestions.push_back(keywordsItem);\n }\n }\n\n return keywordsSuggestions;\n }\n\n void CombinedSpellSuggestions::replaceToSuggested() {\n if (anyReplacementSelected()) {\n const QString &word = getWord();\n const QString &replacement = getReplacement();\n this->replaceToSuggested(word, replacement);\n }\n }\n\n void CombinedSpellSuggestions::replaceToSuggested(const QString &word, const QString &replacement) {\n size_t size = m_SpellSuggestions.size();\n LOG_INFO << size << \"item(s)\";\n bool anySucceeded = false;\n\n for (size_t i = 0; i < size; ++i) {\n auto &suggestionItem = m_SpellSuggestions.at(i);\n suggestionItem->replaceToSuggested(word, replacement);\n\n LOG_INTEGRATION_TESTS << i << \"item's result is:\" << suggestionItem->getReplacementSucceeded();\n\n if (suggestionItem->getReplacementSucceeded()) {\n anySucceeded = true;\n }\n }\n\n setReplacementSucceeded(anySucceeded);\n }\n}\n<|endoftext|>"} {"text":"<commit_before>#include \"cnn\/nodes.h\"\n#include \"cnn\/cnn.h\"\n#include \"cnn\/training.h\"\n#include \"cnn\/timing.h\"\n#include \"cnn\/rnn.h\"\n#include \"cnn\/gru.h\"\n#include \"cnn\/lstm.h\"\n#include \"cnn\/dglstm.h\"\n#include \"cnn\/dict.h\"\n#include \"cnn\/expr.h\"\n#include \"cnn\/cnn-helper.h\"\n#include <iostream>\n#include <fstream>\n#include <sstream>\n\n#include <boost\/archive\/text_iarchive.hpp>\n#include <boost\/archive\/text_oarchive.hpp>\n#include <boost\/program_options\/parsers.hpp>\n#include <boost\/program_options\/variables_map.hpp>\n\nusing namespace std;\nusing namespace cnn;\n\nlong LAYERS = 2;\nlong INPUT_DIM = 8; \/\/256\nlong HIDDEN_DIM = 24; \/\/ 1024\nlong VOCAB_SIZE = 0;\n\ncnn::Dict d;\nint kSOS;\nint kEOS;\n\ntemplate <class Builder>\nstruct RNNLanguageModel {\n LookupParameters* p_c;\n Parameters* p_R;\n Parameters* p_bias;\n Builder builder;\n explicit RNNLanguageModel(Model& model) : builder(LAYERS, INPUT_DIM, HIDDEN_DIM, &model) {\n p_c = model.add_lookup_parameters(VOCAB_SIZE, {INPUT_DIM}); \n p_R = model.add_parameters({VOCAB_SIZE, HIDDEN_DIM});\n p_bias = model.add_parameters({VOCAB_SIZE});\n }\n\n \/\/ return Expression of total loss\n Expression BuildLMGraph(const vector<int>& sent, ComputationGraph& cg) {\n const unsigned slen = sent.size() - 1;\n builder.new_graph(cg); \/\/ reset RNN builder for new graph\n builder.start_new_sequence();\n Expression i_R = parameter(cg, p_R); \/\/ hidden -> word rep parameter\n Expression i_bias = parameter(cg, p_bias); \/\/ word bias\n vector<Expression> errs;\n for (unsigned t = 0; t < slen; ++t) {\n Expression i_x_t = lookup(cg, p_c, sent[t]);\n \/\/ y_t = RNN(x_t)\n Expression i_y_t = builder.add_input(i_x_t);\n Expression i_r_t = i_bias + i_R * i_y_t;\n \n \/\/ we can easily look at intermidiate values\n\/\/ std::vector<float> r_t = as_vector(i_r_t.value());\n \/\/ for (float f : r_t) cout << f << \" \"; cout << endl;\n \/\/ cout << \"[\" << as_scalar(pick(i_r_t, sent[t+1]).value()) << \"]\" << endl;\n\n \/\/ LogSoftmax followed by PickElement can be written in one step\n \/\/ using PickNegLogSoftmax\n#if 0\n Expression i_ydist = logsoftmax(i_r_t);\n errs.push_back(pick(i_ydist, sent[t+1]));\n#if 0\n Expression i_ydist = softmax(i_r_t);\n i_ydist = log(i_ydist)\n errs.push_back(pick(i_ydist, sent[t+1]));\n#endif\n#else\n Expression i_err = pickneglogsoftmax(i_r_t, sent[t+1]);\n errs.push_back(i_err);\n#endif\n }\n Expression i_nerr = sum(errs);\n#if 0\n return -i_nerr;\n#else\n return i_nerr;\n#endif\n }\n\n \/\/ return Expression for total loss\n void RandomSample(int max_len = 150) {\n cerr << endl;\n ComputationGraph cg;\n builder.new_graph(cg); \/\/ reset RNN builder for new graph\n builder.start_new_sequence();\n \n Expression i_R = parameter(cg, p_R);\n Expression i_bias = parameter(cg, p_bias);\n vector<Expression> errs;\n int len = 0;\n int cur = kSOS;\n while(len < max_len && cur != kEOS) {\n ++len;\n Expression i_x_t = lookup(cg, p_c, cur);\n \/\/ y_t = RNN(x_t)\n Expression i_y_t = builder.add_input(i_x_t);\n Expression i_r_t = i_bias + i_R * i_y_t;\n \n Expression ydist = softmax(i_r_t);\n \n unsigned w = 0;\n while (w == 0 || (int)w == kSOS) {\n auto dist = as_vector(cg.incremental_forward());\n double p = rand01();\n for (; w < dist.size(); ++w) {\n p -= dist[w];\n if (p < 0.0) { break; }\n }\n if (w == dist.size()) w = kEOS;\n }\n cerr << (len == 1 ? \"\" : \" \") << d.Convert(w);\n cur = w;\n }\n cerr << endl;\n }\n};\n\ntemplate <class LM_t>\nvoid train(Model &model, LM_t &lm,\n const vector<vector<int>>& training,\n const vector<vector<int>>& dev,\n Trainer *sgd, const string& fname,\n bool randomSample)\n{\n double best = 9e+99;\n unsigned report_every_i = 50;\n unsigned dev_every_i_reports = 500;\n unsigned si = training.size();\n vector<unsigned> order(training.size());\n for (unsigned i = 0; i < order.size(); ++i) order[i] = i;\n bool first = true;\n int report = 0;\n unsigned lines = 0;\n while (1) {\n Timer iteration(\"completed in\");\n double loss = 0;\n unsigned chars = 0;\n for (unsigned i = 0; i < report_every_i; ++i) {\n if (si == training.size()) {\n si = 0;\n if (first) { first = false; }\n else { sgd->update_epoch(); }\n cerr << \"**SHUFFLE\\n\";\n shuffle(order.begin(), order.end(), *rndeng);\n }\n\n \/\/ build graph for this instance\n ComputationGraph cg;\n auto& sent = training[order[si]];\n chars += sent.size() - 1;\n ++si;\n lm.BuildLMGraph(sent, cg);\n loss += as_scalar(cg.forward());\n cg.backward();\n sgd->update();\n ++lines;\n }\n sgd->status();\n cerr << \" E = \" << (loss \/ chars) << \" ppl=\" << exp(loss \/ chars) << ' ';\n\n if (randomSample)\n lm.RandomSample();\n\n \/\/ show score on dev data?\n report++;\n if (report % dev_every_i_reports == 0) {\n double dloss = 0;\n int dchars = 0;\n for (auto& sent : dev) {\n ComputationGraph cg;\n lm.BuildLMGraph(sent, cg);\n dloss += as_scalar(cg.forward());\n dchars += sent.size() - 1;\n }\n if (dloss < best) {\n best = dloss;\n ofstream out(fname);\n boost::archive::text_oarchive oa(out);\n oa << model;\n }\n else{\n sgd->eta *= 0.5;\n }\n cerr << \"\\n***TEST E = \" << (dloss \/ dchars) << \" ppl=\" << exp(dloss \/ dchars) << ' ';\n }\n }\n}\n\ntemplate <class LM_t>\nvoid testcorpus(Model &model, LM_t &lm,\n const vector<vector<int>>& dev)\n{\n unsigned lines = 0;\n double dloss = 0;\n int dchars = 0;\n for (auto& sent : dev) {\n ComputationGraph cg;\n lm.BuildLMGraph(sent, cg);\n dloss += as_scalar(cg.forward());\n dchars += sent.size() - 1;\n }\n\n cerr << \"\\n***DEV [epoch=\" << (lines \/ (double)dev.size()) << \"] E = \" << (dloss \/ dchars) << \" ppl=\" << exp(dloss \/ dchars) << ' ';\n}\n\nvoid initialise(Model &model, const string &filename)\n{\n cerr << \"Initialising model parameters from file: \" << filename << endl;\n ifstream in(filename);\n boost::archive::text_iarchive ia(in);\n ia >> model;\n}\n\nint main(int argc, char** argv) {\n cnn::Initialize(argc, argv);\n\n \/\/ command line processing\n using namespace boost::program_options;\n variables_map vm;\n options_description opts(\"Allowed options\");\n opts.add_options()\n (\"help\", \"print help message\")\n (\"seed,s\", value<int>()->default_value(217), \"random seed number\")\n (\"train,t\", value<string>(), \"file containing training sentences\")\n (\"devel,d\", value<string>(), \"file containing development sentences.\")\n (\"test,T\", value<string>(), \"file containing testing source sentences\")\n (\"initialise,i\", value<string>(), \"load initial parameters from file\")\n (\"parameters,p\", value<string>(), \"save best parameters to this file\")\n (\"layers,l\", value<int>()->default_value(LAYERS), \"use <num> layers for RNN components\")\n (\"hidden,h\", value<int>()->default_value(HIDDEN_DIM), \"use <num> dimensions for recurrent hidden states\")\n (\"gru\", \"use Gated Recurrent Unit (GRU) for recurrent structure; default RNN\")\n (\"lstm\", \"use Long Short Term Memory (GRU) for recurrent structure; default RNN\")\n (\"dglstm\", \"use depth-gated LSTM for recurrent structure; default RNN\")\n (\"dglstmem\", \"use depth-gated LSTM with external memory for recurrent structure; default RNN\")\n (\"nmn\", \"use NMN type method with external memory for recurrent structure; default RNN\")\n (\"verbose,v\", \"be extremely chatty\")\n (\"generate,g\", value<bool>()->default_value(false), \"generate random samples\")\n ;\n store(parse_command_line(argc, argv, opts), vm);\n\n string flavour;\n if (vm.count(\"gru\"))\tflavour = \"gru\";\n else if (vm.count(\"lstm\"))\tflavour = \"lstm\";\n else if (vm.count(\"rnnem\"))\tflavour = \"rnnem\";\n else if (vm.count(\"dglstm\")) flavour = \"dglstm\";\n else if (vm.count(\"nmn\")) flavour = \"nmn\";\n else\t\t\tflavour = \"rnn\";\n\n\n LAYERS = vm[\"layers\"].as<int>();\n HIDDEN_DIM = vm[\"hidden\"].as<int>();\n\n bool generateSample = false;\n generateSample = vm[\"generate\"].as<bool>();\n\n string fname;\n if (vm.count(\"parameters\")) {\n fname = vm[\"parameters\"].as<string>();\n }\n else {\n ostringstream os;\n os << \"lm\"\n << '_' << LAYERS\n << '_' << HIDDEN_DIM\n << '_' << flavour\n << \"-pid\" << getpid() << \".params\";\n fname = os.str();\n }\n\n cerr << \"Parameters will be written to: \" << fname << endl;\n\n if (vm.count(\"help\") || vm.count(\"train\") != 1 || (vm.count(\"devel\") != 1 && vm.count(\"test\") != 1)) {\n cout << opts << \"\\n\";\n return 1;\n }\n\n kSOS = d.Convert(\"<s>\");\n kEOS = d.Convert(\"<\/s>\");\n vector<vector<int>> training, dev, test;\n string line;\n int tlc = 0;\n int ttoks = 0;\n\n string infile = vm[\"train\"].as<string>();\n cerr << \"Reading training data from \" << infile << \"...\\n\";\n\n {\n ifstream in(infile);\n assert(in);\n while(getline(in, line)) {\n ++tlc;\n training.push_back(ReadSentence(line, &d));\n ttoks += training.back().size();\n if (training.back().front() != kSOS && training.back().back() != kEOS) {\n cerr << \"Training sentence in \" << infile << \":\" << tlc << \" didn't start or end with <s>, <\/s>\\n\";\n abort();\n }\n }\n cerr << tlc << \" lines, \" << ttoks << \" tokens, \" << d.size() << \" types\\n\";\n }\n d.Freeze(); \/\/ no new word types allowed\n VOCAB_SIZE = d.size();\n\n if (vm.count(\"devel\") > 0)\n {\n int dlc = 0;\n int dtoks = 0;\n string devfile = vm[\"devel\"].as<string>();\n cerr << \"Reading training data from \" << devfile << \"...\\n\";\n {\n ifstream in(devfile);\n assert(in);\n while (getline(in, line)) {\n ++dlc;\n dev.push_back(ReadSentence(line, &d));\n dtoks += dev.back().size();\n if (dev.back().front() != kSOS && dev.back().back() != kEOS) {\n cerr << \"Dev sentence in \" << devfile << \":\" << tlc << \" didn't start or end with <s>, <\/s>\\n\";\n abort();\n }\n }\n cerr << dlc << \" lines, \" << dtoks << \" tokens\\n\";\n }\n }\n\n Model model;\n bool use_momentum = false;\n Trainer* sgd = nullptr;\n \/\/if (use_momentum)\n \/\/ sgd = new MomentumSGDTrainer(&model);\n \/\/else\n sgd = new SimpleSGDTrainer(&model);\n\n if (vm.count(\"test\") == 0)\n {\n if (vm.count(\"lstm\")) {\n cerr << \"%% Using LSTM recurrent units\" << endl;\n RNNLanguageModel<LSTMBuilder> lm(model);\n train(model, lm, training, dev, sgd, fname, generateSample);\n }\n else if (vm.count(\"dglstm\")) {\n cerr << \"%% Using DGLSTM recurrent units\" << endl;\n RNNLanguageModel<DGLSTMBuilder> lm(model);\n train(model, lm, training, dev, sgd, fname, generateSample);\n }\n }\n else\n {\n string testfile = vm[\"test\"].as<string>();\n int dlc = 0;\n int dtoks = 0;\n cerr << \"Reading training data from \" << testfile << \"...\\n\";\n {\n ifstream in(testfile);\n assert(in);\n while (getline(in, line)) {\n ++dlc;\n test.push_back(ReadSentence(line, &d));\n dtoks += test.back().size();\n if (test.back().front() != kSOS && test.back().back() != kEOS) {\n cerr << \"Dev sentence in \" << testfile << \":\" << tlc << \" didn't start or end with <s>, <\/s>\\n\";\n abort();\n }\n }\n cerr << dlc << \" lines, \" << dtoks << \" tokens\\n\";\n }\n\n if (vm.count(\"test\"))\n {\n if (vm.count(\"lstm\")){\n cerr << \"%% using LSTM recurrent units\" << endl;\n RNNLanguageModel<LSTMBuilder> lm(model);\n if (vm.count(\"initialise\"))\n initialise(model, vm[\"initialise\"].as<string>());\n testcorpus(model, lm, test);\n }\n if (vm.count(\"dglstm\")){\n cerr << \"%% using DGLSTM recurrent units\" << endl;\n RNNLanguageModel<DGLSTMBuilder> lm(model);\n if (vm.count(\"initialise\"))\n initialise(model, vm[\"initialise\"].as<string>());\n testcorpus(model, lm, test);\n }\n }\n }\n\n \/\/RNNLanguageModel<SimpleRNNBuilder> lm(model);\n if (argc == 4) {\n string fname = argv[3];\n ifstream in(fname);\n boost::archive::text_iarchive ia(in);\n ia >> model;\n }\n\n delete sgd;\n}\n\n<commit_msg>fixed rnnlm2 serialization bug. need to close file handler after searialization<commit_after>#include \"cnn\/nodes.h\"\n#include \"cnn\/cnn.h\"\n#include \"cnn\/training.h\"\n#include \"cnn\/timing.h\"\n#include \"cnn\/rnn.h\"\n#include \"cnn\/gru.h\"\n#include \"cnn\/lstm.h\"\n#include \"cnn\/dglstm.h\"\n#include \"cnn\/dict.h\"\n#include \"cnn\/expr.h\"\n#include \"cnn\/cnn-helper.h\"\n#include <iostream>\n#include <fstream>\n#include <sstream>\n\n#include <boost\/archive\/text_iarchive.hpp>\n#include <boost\/archive\/text_oarchive.hpp>\n#include <boost\/archive\/text_iarchive.hpp>\n#include <boost\/archive\/text_oarchive.hpp>\n#include <boost\/program_options\/parsers.hpp>\n#include <boost\/program_options\/variables_map.hpp>\n\nusing namespace std;\nusing namespace cnn;\n\nlong LAYERS = 2;\nlong INPUT_DIM = 8; \/\/256\nlong HIDDEN_DIM = 24; \/\/ 1024\nlong VOCAB_SIZE = 0;\n\ncnn::Dict d;\nint kSOS;\nint kEOS;\n\ntemplate <class Builder>\nstruct RNNLanguageModel {\n LookupParameters* p_c;\n Parameters* p_R;\n Parameters* p_bias;\n Builder builder;\n explicit RNNLanguageModel(Model& model) : builder(LAYERS, INPUT_DIM, HIDDEN_DIM, &model) {\n p_c = model.add_lookup_parameters(VOCAB_SIZE, {INPUT_DIM}); \n p_R = model.add_parameters({VOCAB_SIZE, HIDDEN_DIM});\n p_bias = model.add_parameters({VOCAB_SIZE});\n }\n\n \/\/ return Expression of total loss\n Expression BuildLMGraph(const vector<int>& sent, ComputationGraph& cg) {\n const unsigned slen = sent.size() - 1;\n builder.new_graph(cg); \/\/ reset RNN builder for new graph\n builder.start_new_sequence();\n Expression i_R = parameter(cg, p_R); \/\/ hidden -> word rep parameter\n Expression i_bias = parameter(cg, p_bias); \/\/ word bias\n vector<Expression> errs;\n for (unsigned t = 0; t < slen; ++t) {\n Expression i_x_t = lookup(cg, p_c, sent[t]);\n \/\/ y_t = RNN(x_t)\n Expression i_y_t = builder.add_input(i_x_t);\n Expression i_r_t = i_bias + i_R * i_y_t;\n \n \/\/ we can easily look at intermidiate values\n\/\/ std::vector<float> r_t = as_vector(i_r_t.value());\n \/\/ for (float f : r_t) cout << f << \" \"; cout << endl;\n \/\/ cout << \"[\" << as_scalar(pick(i_r_t, sent[t+1]).value()) << \"]\" << endl;\n\n \/\/ LogSoftmax followed by PickElement can be written in one step\n \/\/ using PickNegLogSoftmax\n#if 0\n Expression i_ydist = logsoftmax(i_r_t);\n errs.push_back(pick(i_ydist, sent[t+1]));\n#if 0\n Expression i_ydist = softmax(i_r_t);\n i_ydist = log(i_ydist)\n errs.push_back(pick(i_ydist, sent[t+1]));\n#endif\n#else\n Expression i_err = pickneglogsoftmax(i_r_t, sent[t+1]);\n errs.push_back(i_err);\n#endif\n }\n Expression i_nerr = sum(errs);\n#if 0\n return -i_nerr;\n#else\n return i_nerr;\n#endif\n }\n\n \/\/ return Expression for total loss\n void RandomSample(int max_len = 150) {\n cerr << endl;\n ComputationGraph cg;\n builder.new_graph(cg); \/\/ reset RNN builder for new graph\n builder.start_new_sequence();\n \n Expression i_R = parameter(cg, p_R);\n Expression i_bias = parameter(cg, p_bias);\n vector<Expression> errs;\n int len = 0;\n int cur = kSOS;\n while(len < max_len && cur != kEOS) {\n ++len;\n Expression i_x_t = lookup(cg, p_c, cur);\n \/\/ y_t = RNN(x_t)\n Expression i_y_t = builder.add_input(i_x_t);\n Expression i_r_t = i_bias + i_R * i_y_t;\n \n Expression ydist = softmax(i_r_t);\n \n unsigned w = 0;\n while (w == 0 || (int)w == kSOS) {\n auto dist = as_vector(cg.incremental_forward());\n double p = rand01();\n for (; w < dist.size(); ++w) {\n p -= dist[w];\n if (p < 0.0) { break; }\n }\n if (w == dist.size()) w = kEOS;\n }\n cerr << (len == 1 ? \"\" : \" \") << d.Convert(w);\n cur = w;\n }\n cerr << endl;\n }\n};\n\ntemplate <class LM_t>\nvoid train(Model &model, LM_t &lm,\n const vector<vector<int>>& training,\n const vector<vector<int>>& dev,\n Trainer *sgd, const string& fname,\n bool randomSample)\n{\n double best = 9e+99;\n unsigned report_every_i = 50;\n unsigned dev_every_i_reports = 500;\n unsigned si = training.size();\n vector<unsigned> order(training.size());\n for (unsigned i = 0; i < order.size(); ++i) order[i] = i;\n bool first = true;\n int report = 0;\n unsigned lines = 0;\n\n ofstream out(fname, ofstream::out);\n boost::archive::text_oarchive oa(out);\n oa << model;\n out.close();\n\n while (1) {\n Timer iteration(\"completed in\");\n double loss = 0;\n unsigned chars = 0;\n for (unsigned i = 0; i < report_every_i; ++i) {\n if (si == training.size()) {\n si = 0;\n if (first) { first = false; }\n else { sgd->update_epoch(); }\n cerr << \"**SHUFFLE\\n\";\n shuffle(order.begin(), order.end(), *rndeng);\n }\n\n \/\/ build graph for this instance\n ComputationGraph cg;\n auto& sent = training[order[si]];\n chars += sent.size() - 1;\n ++si;\n lm.BuildLMGraph(sent, cg);\n loss += as_scalar(cg.forward());\n cg.backward();\n sgd->update();\n ++lines;\n }\n sgd->status();\n cerr << \" E = \" << (loss \/ chars) << \" ppl=\" << exp(loss \/ chars) << ' ';\n\n if (randomSample)\n lm.RandomSample();\n\n \/\/ show score on dev data?\n report++;\n if (report % dev_every_i_reports == 0) {\n double dloss = 0;\n int dchars = 0;\n for (auto& sent : dev) {\n ComputationGraph cg;\n lm.BuildLMGraph(sent, cg);\n dloss += as_scalar(cg.forward());\n dchars += sent.size() - 1;\n }\n if (dloss < best) {\n best = dloss;\n ofstream out(fname, ofstream::out);\n boost::archive::text_oarchive oa(out);\n oa << model;\n }\n else{\n sgd->eta *= 0.5;\n }\n cerr << \"\\n***TEST E = \" << (dloss \/ dchars) << \" ppl=\" << exp(dloss \/ dchars) << ' ';\n }\n }\n}\n\ntemplate <class LM_t>\nvoid testcorpus(Model &model, LM_t &lm,\n const vector<vector<int>>& dev)\n{\n unsigned lines = 0;\n double dloss = 0;\n int dchars = 0;\n for (auto& sent : dev) {\n ComputationGraph cg;\n lm.BuildLMGraph(sent, cg);\n dloss += as_scalar(cg.forward());\n dchars += sent.size() - 1;\n }\n\n cerr << \"\\n***DEV [epoch=\" << (lines \/ (double)dev.size()) << \"] E = \" << (dloss \/ dchars) << \" ppl=\" << exp(dloss \/ dchars) << ' ';\n}\n\nvoid initialise(Model &model, const string &filename)\n{\n cerr << \"Initialising model parameters from file: \" << filename << endl;\n ifstream in(filename, ifstream::in);\n boost::archive::text_iarchive ia(in);\n ia >> model;\n}\n\nint main(int argc, char** argv) {\n cnn::Initialize(argc, argv);\n\n \/\/ command line processing\n using namespace boost::program_options;\n variables_map vm;\n options_description opts(\"Allowed options\");\n opts.add_options()\n (\"help\", \"print help message\")\n (\"seed,s\", value<int>()->default_value(217), \"random seed number\")\n (\"train,t\", value<string>(), \"file containing training sentences\")\n (\"devel,d\", value<string>(), \"file containing development sentences.\")\n (\"test,T\", value<string>(), \"file containing testing source sentences\")\n (\"initialise,i\", value<string>(), \"load initial parameters from file\")\n (\"parameters,p\", value<string>(), \"save best parameters to this file\")\n (\"layers,l\", value<int>()->default_value(LAYERS), \"use <num> layers for RNN components\")\n (\"hidden,h\", value<int>()->default_value(HIDDEN_DIM), \"use <num> dimensions for recurrent hidden states\")\n (\"gru\", \"use Gated Recurrent Unit (GRU) for recurrent structure; default RNN\")\n (\"lstm\", \"use Long Short Term Memory (GRU) for recurrent structure; default RNN\")\n (\"dglstm\", \"use depth-gated LSTM for recurrent structure; default RNN\")\n (\"dglstmem\", \"use depth-gated LSTM with external memory for recurrent structure; default RNN\")\n (\"nmn\", \"use NMN type method with external memory for recurrent structure; default RNN\")\n (\"verbose,v\", \"be extremely chatty\")\n (\"generate,g\", value<bool>()->default_value(false), \"generate random samples\")\n ;\n store(parse_command_line(argc, argv, opts), vm);\n\n string flavour;\n if (vm.count(\"gru\"))\tflavour = \"gru\";\n else if (vm.count(\"lstm\"))\tflavour = \"lstm\";\n else if (vm.count(\"rnnem\"))\tflavour = \"rnnem\";\n else if (vm.count(\"dglstm\")) flavour = \"dglstm\";\n else if (vm.count(\"nmn\")) flavour = \"nmn\";\n else\t\t\tflavour = \"rnn\";\n\n\n LAYERS = vm[\"layers\"].as<int>();\n HIDDEN_DIM = vm[\"hidden\"].as<int>();\n\n bool generateSample = false;\n generateSample = vm[\"generate\"].as<bool>();\n\n string fname;\n if (vm.count(\"parameters\")) {\n fname = vm[\"parameters\"].as<string>();\n }\n else {\n ostringstream os;\n os << \"lm\"\n << '_' << LAYERS\n << '_' << HIDDEN_DIM\n << '_' << flavour\n << \"-pid\" << getpid() << \".params\";\n fname = os.str();\n }\n\n cerr << \"Parameters will be written to: \" << fname << endl;\n\n if (vm.count(\"help\") || vm.count(\"train\") != 1 || (vm.count(\"devel\") != 1 && vm.count(\"test\") != 1)) {\n cout << opts << \"\\n\";\n return 1;\n }\n\n kSOS = d.Convert(\"<s>\");\n kEOS = d.Convert(\"<\/s>\");\n vector<vector<int>> training, dev, test;\n string line;\n int tlc = 0;\n int ttoks = 0;\n\n string infile = vm[\"train\"].as<string>();\n cerr << \"Reading training data from \" << infile << \"...\\n\";\n\n {\n ifstream in(infile);\n assert(in);\n while(getline(in, line)) {\n ++tlc;\n training.push_back(ReadSentence(line, &d));\n ttoks += training.back().size();\n if (training.back().front() != kSOS && training.back().back() != kEOS) {\n cerr << \"Training sentence in \" << infile << \":\" << tlc << \" didn't start or end with <s>, <\/s>\\n\";\n abort();\n }\n }\n cerr << tlc << \" lines, \" << ttoks << \" tokens, \" << d.size() << \" types\\n\";\n }\n d.Freeze(); \/\/ no new word types allowed\n VOCAB_SIZE = d.size();\n\n if (vm.count(\"devel\") > 0)\n {\n int dlc = 0;\n int dtoks = 0;\n string devfile = vm[\"devel\"].as<string>();\n cerr << \"Reading training data from \" << devfile << \"...\\n\";\n {\n ifstream in(devfile);\n assert(in);\n while (getline(in, line)) {\n ++dlc;\n dev.push_back(ReadSentence(line, &d));\n dtoks += dev.back().size();\n if (dev.back().front() != kSOS && dev.back().back() != kEOS) {\n cerr << \"Dev sentence in \" << devfile << \":\" << tlc << \" didn't start or end with <s>, <\/s>\\n\";\n abort();\n }\n }\n cerr << dlc << \" lines, \" << dtoks << \" tokens\\n\";\n }\n }\n\n Model model;\n bool use_momentum = false;\n Trainer* sgd = nullptr;\n \/\/if (use_momentum)\n \/\/ sgd = new MomentumSGDTrainer(&model);\n \/\/else\n sgd = new SimpleSGDTrainer(&model);\n\n if (vm.count(\"test\") == 0)\n {\n if (vm.count(\"lstm\")) {\n cerr << \"%% Using LSTM recurrent units\" << endl;\n RNNLanguageModel<LSTMBuilder> lm(model);\n train(model, lm, training, dev, sgd, fname, generateSample);\n }\n else if (vm.count(\"dglstm\")) {\n cerr << \"%% Using DGLSTM recurrent units\" << endl;\n RNNLanguageModel<DGLSTMBuilder> lm(model);\n train(model, lm, training, dev, sgd, fname, generateSample);\n }\n }\n else\n {\n string testfile = vm[\"test\"].as<string>();\n int dlc = 0;\n int dtoks = 0;\n cerr << \"Reading training data from \" << testfile << \"...\\n\";\n {\n ifstream in(testfile);\n assert(in);\n while (getline(in, line)) {\n ++dlc;\n test.push_back(ReadSentence(line, &d));\n dtoks += test.back().size();\n if (test.back().front() != kSOS && test.back().back() != kEOS) {\n cerr << \"Dev sentence in \" << testfile << \":\" << tlc << \" didn't start or end with <s>, <\/s>\\n\";\n abort();\n }\n }\n cerr << dlc << \" lines, \" << dtoks << \" tokens\\n\";\n }\n\n if (vm.count(\"test\"))\n {\n if (vm.count(\"lstm\")){\n cerr << \"%% using LSTM recurrent units\" << endl;\n RNNLanguageModel<LSTMBuilder> lm(model);\n if (vm.count(\"initialise\"))\n initialise(model, vm[\"initialise\"].as<string>());\n testcorpus(model, lm, test);\n }\n if (vm.count(\"dglstm\")){\n cerr << \"%% using DGLSTM recurrent units\" << endl;\n RNNLanguageModel<DGLSTMBuilder> lm(model);\n if (vm.count(\"initialise\"))\n initialise(model, vm[\"initialise\"].as<string>());\n testcorpus(model, lm, test);\n }\n }\n }\n\n \/\/RNNLanguageModel<SimpleRNNBuilder> lm(model);\n if (argc == 4) {\n string fname = argv[3];\n ifstream in(fname);\n boost::archive::text_iarchive ia(in);\n ia >> model;\n }\n\n delete sgd;\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 \"chrome\/browser\/tab_contents\/web_contents_view.h\"\n\n#include \"chrome\/browser\/renderer_host\/render_process_host.h\"\n#include \"chrome\/browser\/renderer_host\/render_widget_host.h\"\n#include \"chrome\/browser\/renderer_host\/render_widget_host_view.h\"\n#include \"chrome\/browser\/tab_contents\/tab_contents_delegate.h\"\n#include \"chrome\/browser\/tab_contents\/web_contents.h\"\n\nWebContentsView::WebContentsView(WebContents* web_contents)\n : web_contents_(web_contents) {\n}\n\nvoid WebContentsView::RenderWidgetHostDestroyed(RenderWidgetHost* host) {\n for (PendingWidgetViews::iterator i = pending_widget_views_.begin();\n i != pending_widget_views_.end(); ++i) {\n if (host->view() == i->second) {\n pending_widget_views_.erase(i);\n return;\n }\n }\n}\n\nvoid WebContentsView::CreateNewWindow(int route_id,\n base::WaitableEvent* modal_dialog_event) {\n \/\/ Create the new web contents. This will automatically create the new\n \/\/ WebContentsView. In the future, we may want to create the view separately.\n WebContents* new_contents =\n new WebContents(web_contents()->profile(),\n web_contents()->GetSiteInstance(),\n route_id,\n modal_dialog_event);\n new_contents->SetupController(web_contents()->profile());\n WebContentsView* new_view = new_contents->view();\n\n \/\/ TODO(brettw) it seems bogus that we have to call this function on the\n \/\/ newly created object and give it one of its own member variables.\n new_view->CreateViewForWidget(new_contents->render_view_host());\n\n \/\/ Save the created window associated with the route so we can show it later.\n pending_contents_[route_id] = new_contents;\n}\n\nvoid WebContentsView::CreateNewWidget(int route_id, bool activatable) {\n \/\/ Save the created widget associated with the route so we can show it later.\n pending_widget_views_[route_id] = CreateNewWidgetInternal(route_id,\n activatable);\n}\n\nvoid WebContentsView::ShowCreatedWindow(int route_id,\n WindowOpenDisposition disposition,\n const gfx::Rect& initial_pos,\n bool user_gesture) {\n PendingContents::iterator iter = pending_contents_.find(route_id);\n if (iter == pending_contents_.end()) {\n DCHECK(false);\n return;\n }\n\n WebContents* new_web_contents = iter->second;\n pending_contents_.erase(route_id);\n\n if (!new_web_contents->render_widget_host_view() ||\n !new_web_contents->process()->channel()) {\n \/\/ The view has gone away or the renderer crashed. Nothing to do.\n return;\n }\n\n \/\/ TODO(brettw) this seems bogus to reach into here and initialize the host.\n new_web_contents->render_view_host()->Init();\n web_contents()->AddNewContents(new_web_contents, disposition, initial_pos,\n user_gesture);\n}\n\nvoid WebContentsView::ShowCreatedWidget(int route_id,\n const gfx::Rect& initial_pos) {\n PendingWidgetViews::iterator iter = pending_widget_views_.find(route_id);\n if (iter == pending_widget_views_.end()) {\n DCHECK(false);\n return;\n }\n\n RenderWidgetHostView* widget_host_view = iter->second;\n pending_widget_views_.erase(route_id);\n\n ShowCreatedWidgetInternal(widget_host_view, initial_pos);\n}\n\nRenderWidgetHostView* WebContentsView::CreateNewWidgetInternal(\n int route_id,\n bool activatable) {\n RenderWidgetHost* widget_host =\n new RenderWidgetHost(web_contents_->process(), route_id);\n RenderWidgetHostView* widget_view =\n RenderWidgetHostView::CreateViewForWidget(widget_host);\n widget_view->set_activatable(activatable);\n\n return widget_view;\n}\n\nvoid WebContentsView::ShowCreatedWidgetInternal(\n RenderWidgetHostView* widget_host_view,\n const gfx::Rect& initial_pos) {\n RenderWidgetHost* widget_host = widget_host_view->GetRenderWidgetHost();\n if (!widget_host->process()->channel()) {\n \/\/ The view has gone away or the renderer crashed. Nothing to do.\n return;\n }\n\n widget_host_view->InitAsPopup(\n web_contents_->render_widget_host_view(), initial_pos);\n if (web_contents_->delegate())\n web_contents_->delegate()->RenderWidgetShowing();\n widget_host->Init();\n}\n<commit_msg>Disable inactive rendering for the frame before select popups are initialized, since initializing shows them which causes activation to change.<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\/tab_contents\/web_contents_view.h\"\n\n#include \"chrome\/browser\/renderer_host\/render_process_host.h\"\n#include \"chrome\/browser\/renderer_host\/render_widget_host.h\"\n#include \"chrome\/browser\/renderer_host\/render_widget_host_view.h\"\n#include \"chrome\/browser\/tab_contents\/tab_contents_delegate.h\"\n#include \"chrome\/browser\/tab_contents\/web_contents.h\"\n\nWebContentsView::WebContentsView(WebContents* web_contents)\n : web_contents_(web_contents) {\n}\n\nvoid WebContentsView::RenderWidgetHostDestroyed(RenderWidgetHost* host) {\n for (PendingWidgetViews::iterator i = pending_widget_views_.begin();\n i != pending_widget_views_.end(); ++i) {\n if (host->view() == i->second) {\n pending_widget_views_.erase(i);\n return;\n }\n }\n}\n\nvoid WebContentsView::CreateNewWindow(int route_id,\n base::WaitableEvent* modal_dialog_event) {\n \/\/ Create the new web contents. This will automatically create the new\n \/\/ WebContentsView. In the future, we may want to create the view separately.\n WebContents* new_contents =\n new WebContents(web_contents()->profile(),\n web_contents()->GetSiteInstance(),\n route_id,\n modal_dialog_event);\n new_contents->SetupController(web_contents()->profile());\n WebContentsView* new_view = new_contents->view();\n\n \/\/ TODO(brettw) it seems bogus that we have to call this function on the\n \/\/ newly created object and give it one of its own member variables.\n new_view->CreateViewForWidget(new_contents->render_view_host());\n\n \/\/ Save the created window associated with the route so we can show it later.\n pending_contents_[route_id] = new_contents;\n}\n\nvoid WebContentsView::CreateNewWidget(int route_id, bool activatable) {\n \/\/ Save the created widget associated with the route so we can show it later.\n pending_widget_views_[route_id] = CreateNewWidgetInternal(route_id,\n activatable);\n}\n\nvoid WebContentsView::ShowCreatedWindow(int route_id,\n WindowOpenDisposition disposition,\n const gfx::Rect& initial_pos,\n bool user_gesture) {\n PendingContents::iterator iter = pending_contents_.find(route_id);\n if (iter == pending_contents_.end()) {\n DCHECK(false);\n return;\n }\n\n WebContents* new_web_contents = iter->second;\n pending_contents_.erase(route_id);\n\n if (!new_web_contents->render_widget_host_view() ||\n !new_web_contents->process()->channel()) {\n \/\/ The view has gone away or the renderer crashed. Nothing to do.\n return;\n }\n\n \/\/ TODO(brettw) this seems bogus to reach into here and initialize the host.\n new_web_contents->render_view_host()->Init();\n web_contents()->AddNewContents(new_web_contents, disposition, initial_pos,\n user_gesture);\n}\n\nvoid WebContentsView::ShowCreatedWidget(int route_id,\n const gfx::Rect& initial_pos) {\n PendingWidgetViews::iterator iter = pending_widget_views_.find(route_id);\n if (iter == pending_widget_views_.end()) {\n DCHECK(false);\n return;\n }\n\n RenderWidgetHostView* widget_host_view = iter->second;\n pending_widget_views_.erase(route_id);\n\n ShowCreatedWidgetInternal(widget_host_view, initial_pos);\n}\n\nRenderWidgetHostView* WebContentsView::CreateNewWidgetInternal(\n int route_id,\n bool activatable) {\n RenderWidgetHost* widget_host =\n new RenderWidgetHost(web_contents_->process(), route_id);\n RenderWidgetHostView* widget_view =\n RenderWidgetHostView::CreateViewForWidget(widget_host);\n widget_view->set_activatable(activatable);\n\n return widget_view;\n}\n\nvoid WebContentsView::ShowCreatedWidgetInternal(\n RenderWidgetHostView* widget_host_view,\n const gfx::Rect& initial_pos) {\n RenderWidgetHost* widget_host = widget_host_view->GetRenderWidgetHost();\n if (!widget_host->process()->channel()) {\n \/\/ The view has gone away or the renderer crashed. Nothing to do.\n return;\n }\n\n if (web_contents_->delegate())\n web_contents_->delegate()->RenderWidgetShowing();\n widget_host_view->InitAsPopup(\n web_contents_->render_widget_host_view(), initial_pos);\n widget_host->Init();\n}\n<|endoftext|>"} {"text":"<commit_before>#ifndef STAN_MATH_PRIM_MAT_FUN_CORR_MATRIX_CONSTRAIN_HPP\n#define STAN_MATH_PRIM_MAT_FUN_CORR_MATRIX_CONSTRAIN_HPP\n\n#include <stan\/math\/prim\/mat\/fun\/Eigen.hpp>\n#include <stan\/math\/prim\/mat\/meta\/index_type.hpp>\n#include <stan\/math\/prim\/scal\/err\/check_size_match.hpp>\n#include <stan\/math\/prim\/scal\/fun\/corr_constrain.hpp>\n#include <stan\/math\/prim\/mat\/fun\/read_corr_matrix.hpp>\n#include <stdexcept>\n\nnamespace stan {\nnamespace math {\n\n\/**\n * Return the correlation matrix of the specified dimensionality\n * derived from the specified vector of unconstrained values. The\n * input vector must be of length \\f${k \\choose 2} =\n * \\frac{k(k-1)}{2}\\f$. The values in the input vector represent\n * unconstrained (partial) correlations among the dimensions.\n *\n * <p>The transform based on partial correlations is as specified\n * in\n *\n * <ul><li> Lewandowski, Daniel, Dorota Kurowicka, and Harry\n * Joe. 2009. Generating random correlation matrices based on\n * vines and extended onion method. <i>Journal of Multivariate\n * Analysis<\/i> <b>100<\/b>:1989–-2001. <\/li><\/ul>\n *\n * <p>The free vector entries are first constrained to be\n * valid correlation values using <code>corr_constrain(T)<\/code>.\n *\n * @param x Vector of unconstrained partial correlations.\n * @param k Dimensionality of returned correlation matrix.\n * @tparam T Type of scalar.\n * @throw std::invalid_argument if x is not a valid correlation\n * matrix.\n *\/\ntemplate <typename T>\nEigen::Matrix<T, Eigen::Dynamic, Eigen::Dynamic> corr_matrix_constrain(\n const Eigen::Matrix<T, Eigen::Dynamic, 1>& x,\n typename math::index_type<Eigen::Matrix<T, Eigen::Dynamic, 1> >::type k) {\n using Eigen::Dynamic;\n using Eigen::Matrix;\n typedef typename index_type<Matrix<T, Dynamic, 1> >::type size_type;\n\n size_type k_choose_2 = (k * (k - 1)) \/ 2;\n check_size_match(\"cov_matrix_constrain\", \"x.size()\", x.size(), \"k_choose_2\",\n k_choose_2);\n Eigen::Array<T, Eigen::Dynamic, 1> cpcs(k_choose_2);\n for (size_type i = 0; i < k_choose_2; ++i)\n cpcs[i] = corr_constrain(x[i]);\n return read_corr_matrix(cpcs, k);\n}\n\n\/**\n * Return the correlation matrix of the specified dimensionality\n * derived from the specified vector of unconstrained values. The\n * input vector must be of length \\f${k \\choose 2} =\n * \\frac{k(k-1)}{2}\\f$. The values in the input vector represent\n * unconstrained (partial) correlations among the dimensions.\n *\n * <p>The transform is as specified for\n * <code>corr_matrix_constrain(Matrix, size_t)<\/code>; the\n * paper it cites also defines the Jacobians for correlation inputs,\n * which are composed with the correlation constrained Jacobians\n * defined in <code>corr_constrain(T, double)<\/code> for\n * this function.\n *\n * @param x Vector of unconstrained partial correlations.\n * @param k Dimensionality of returned correlation matrix.\n * @param lp Log probability reference to increment.\n * @tparam T Type of scalar.\n *\/\ntemplate <typename T>\nEigen::Matrix<T, Eigen::Dynamic, Eigen::Dynamic> corr_matrix_constrain(\n const Eigen::Matrix<T, Eigen::Dynamic, 1>& x,\n typename math::index_type<Eigen::Matrix<T, Eigen::Dynamic, 1> >::type k,\n T& lp) {\n using Eigen::Array;\n using Eigen::Dynamic;\n using Eigen::Matrix;\n typedef typename index_type<Matrix<T, Dynamic, 1> >::type size_type;\n\n size_type k_choose_2 = (k * (k - 1)) \/ 2;\n check_size_match(\"cov_matrix_constrain\", \"x.size()\", x.size(), \"k_choose_2\",\n k_choose_2);\n Array<T, Dynamic, 1> cpcs(k_choose_2);\n for (size_type i = 0; i < k_choose_2; ++i)\n cpcs[i] = corr_constrain(x[i], lp);\n return read_corr_matrix(cpcs, k, lp);\n}\n\n} \/\/ namespace math\n} \/\/ namespace stan\n#endif\n<commit_msg>include meta.hpp<commit_after>#ifndef STAN_MATH_PRIM_MAT_FUN_CORR_MATRIX_CONSTRAIN_HPP\n#define STAN_MATH_PRIM_MAT_FUN_CORR_MATRIX_CONSTRAIN_HPP\n\n#include <stan\/math\/prim\/meta.hpp>\n#include <stan\/math\/prim\/mat\/fun\/Eigen.hpp>\n#include <stan\/math\/prim\/scal\/err\/check_size_match.hpp>\n#include <stan\/math\/prim\/scal\/fun\/corr_constrain.hpp>\n#include <stan\/math\/prim\/mat\/fun\/read_corr_matrix.hpp>\n#include <stdexcept>\n\nnamespace stan {\nnamespace math {\n\n\/**\n * Return the correlation matrix of the specified dimensionality\n * derived from the specified vector of unconstrained values. The\n * input vector must be of length \\f${k \\choose 2} =\n * \\frac{k(k-1)}{2}\\f$. The values in the input vector represent\n * unconstrained (partial) correlations among the dimensions.\n *\n * <p>The transform based on partial correlations is as specified\n * in\n *\n * <ul><li> Lewandowski, Daniel, Dorota Kurowicka, and Harry\n * Joe. 2009. Generating random correlation matrices based on\n * vines and extended onion method. <i>Journal of Multivariate\n * Analysis<\/i> <b>100<\/b>:1989–-2001. <\/li><\/ul>\n *\n * <p>The free vector entries are first constrained to be\n * valid correlation values using <code>corr_constrain(T)<\/code>.\n *\n * @param x Vector of unconstrained partial correlations.\n * @param k Dimensionality of returned correlation matrix.\n * @tparam T Type of scalar.\n * @throw std::invalid_argument if x is not a valid correlation\n * matrix.\n *\/\ntemplate <typename T>\nEigen::Matrix<T, Eigen::Dynamic, Eigen::Dynamic> corr_matrix_constrain(\n const Eigen::Matrix<T, Eigen::Dynamic, 1>& x,\n typename math::index_type<Eigen::Matrix<T, Eigen::Dynamic, 1> >::type k) {\n using Eigen::Dynamic;\n using Eigen::Matrix;\n typedef typename index_type<Matrix<T, Dynamic, 1> >::type size_type;\n\n size_type k_choose_2 = (k * (k - 1)) \/ 2;\n check_size_match(\"cov_matrix_constrain\", \"x.size()\", x.size(), \"k_choose_2\",\n k_choose_2);\n Eigen::Array<T, Eigen::Dynamic, 1> cpcs(k_choose_2);\n for (size_type i = 0; i < k_choose_2; ++i)\n cpcs[i] = corr_constrain(x[i]);\n return read_corr_matrix(cpcs, k);\n}\n\n\/**\n * Return the correlation matrix of the specified dimensionality\n * derived from the specified vector of unconstrained values. The\n * input vector must be of length \\f${k \\choose 2} =\n * \\frac{k(k-1)}{2}\\f$. The values in the input vector represent\n * unconstrained (partial) correlations among the dimensions.\n *\n * <p>The transform is as specified for\n * <code>corr_matrix_constrain(Matrix, size_t)<\/code>; the\n * paper it cites also defines the Jacobians for correlation inputs,\n * which are composed with the correlation constrained Jacobians\n * defined in <code>corr_constrain(T, double)<\/code> for\n * this function.\n *\n * @param x Vector of unconstrained partial correlations.\n * @param k Dimensionality of returned correlation matrix.\n * @param lp Log probability reference to increment.\n * @tparam T Type of scalar.\n *\/\ntemplate <typename T>\nEigen::Matrix<T, Eigen::Dynamic, Eigen::Dynamic> corr_matrix_constrain(\n const Eigen::Matrix<T, Eigen::Dynamic, 1>& x,\n typename math::index_type<Eigen::Matrix<T, Eigen::Dynamic, 1> >::type k,\n T& lp) {\n using Eigen::Array;\n using Eigen::Dynamic;\n using Eigen::Matrix;\n typedef typename index_type<Matrix<T, Dynamic, 1> >::type size_type;\n\n size_type k_choose_2 = (k * (k - 1)) \/ 2;\n check_size_match(\"cov_matrix_constrain\", \"x.size()\", x.size(), \"k_choose_2\",\n k_choose_2);\n Array<T, Dynamic, 1> cpcs(k_choose_2);\n for (size_type i = 0; i < k_choose_2; ++i)\n cpcs[i] = corr_constrain(x[i], lp);\n return read_corr_matrix(cpcs, k, lp);\n}\n\n} \/\/ namespace math\n} \/\/ namespace stan\n#endif\n<|endoftext|>"} {"text":"<commit_before>\/*\n * Copyright (C) 2008 Nokia Corporation.\n *\n * Contact: Marius Vollmer <marius.vollmer@nokia.com>\n *\n * This library is free software; you can redistribute it and\/or\n * modify it under the terms of the GNU Lesser General Public License\n * version 2.1 as published by the Free Software Foundation.\n *\n * This library is distributed in the hope that it will be useful, but\n * WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU\n * Lesser General Public License for more details.\n *\n * You should have received a copy of the GNU Lesser General Public\n * License along with this library; if not, write to the Free Software\n * Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA\n * 02110-1301 USA\n *\n *\/\n\n#include \"contextc.h\"\n#include \"service.h\"\n#include \"property.h\"\n#include \"group.h\"\n#include \"logging.h\"\n#include \"sconnect.h\"\n#include \"listeners.h\"\n#include \"loggingfeatures.h\"\n\n#include <QCoreApplication>\n\nnamespace ContextProvider {\n}\n\nusing namespace ContextProvider;\n\n\/*!\n \\page CApi C Api\n\n \\brief The libcontextprovider library offers a simple plain-C API to be used\n from any C program.\n\n \\section Usage\n\n \\code\n context_provider_init(DBUS_BUS_SESSION, \"org.test.provider\");\n\n context_provider_install_key(\"Battery.OnBattery\", 0, NULL, NULL);\n context_provider_install_key(\"Battery.ChargePercentage\", 0, NULL, NULL);\n\n context_provider_set_boolean(\"Battery.OnBattery\", 1);\n context_provider_set_integer(\"Battery.ChargePercentage\", 55);\n \\endcode\n\n The above code snippet starts a service at \"org.test.provider\" with two\n keys (\"Battery.OnBattery\", \"Battery.ChargePercentage\") and sets their\n respective values.\n\n Note: If the provider used other D-Bus bindings than QDBus, the\n service name (\"org.test.provider\") needs to be unique, i.e., the\n provider process should not register it itself.\n\n \\section Callbacks\n\n The context_provider_install_key function and context_provider_install_group function\n take arguments specyfying the callback function. The callback is executed when the\n subscription status changes for the key or the key group (first subscriber\n appears or last subscriber goes away). Basing on this info the provider can\n manage it's resources. It's okay also to use the callback function to actually\n set the value.\n\n \\code\n void callback_function_example(int subscribed, void* user_data)\n {\n if (subscribed) {\n \/\/ First subscriber appeared.\n \/\/ Start ie. pooling the data.\n } else {\n \/\/ Last subscribed disappeared.\n \/\/ Stop pooling data, release resources.\n }\n }\n \\endcode\n*\/\n\nstatic Service *cService;\nstatic QList<Listener*> *listeners = NULL;\n\n\/\/\/ Initializes and starts the service with a given \\a bus_type and a \\a bus_name.\n\/\/\/ The \\a bus_type can be DBUS_BUS_SESSION or DBUS_BUS_SYSTEM. This function can be\n\/\/\/ called only once till a matching context_provider_stop is called.\nint context_provider_init (DBusBusType bus_type, const char* bus_name)\n{\n contextDebug() << F_C << bus_name;\n\n static char arg[] = \"libcontextprovider\";\n static char* p = arg;\n static int argc = 1;\n static QCoreApplication* app = 0;\n\n if (QCoreApplication::instance() == 0) {\n \/\/ No QCoreApplication created, so crate one.\n \/\/ This will also create an event dispatcher (QEventDispatcherGlibPrivate.)\n app = new QCoreApplication(argc, &p);\n }\n\n if (cService != NULL) {\n contextCritical() << \"Service already initialized. You can only initialize one service with C API\";\n return 0;\n }\n\n cService = new Service(bus_type == DBUS_BUS_SESSION\n ? QDBusConnection::SessionBus\n : QDBusConnection::SystemBus,\n bus_name);\n listeners = new QList<Listener*>;\n\n return 1;\n}\n\n\/\/\/ Stops the currently started service with context_provider_init. After calling\n\/\/\/ this function a new service can be started by calling context_provider_init.\nvoid context_provider_stop (void)\n{\n contextDebug() << F_C;\n if (cService) {\n contextDebug() << \"Stopping service\";\n\n \/\/ Delete all listeners\n if (listeners) {\n Q_FOREACH (Listener *listener, *listeners)\n delete listener;\n }\n delete listeners; listeners = NULL;\n\n delete cService;\n cService = NULL;\n }\n \/\/ We cannot destroy the QCoreApplication we might have created; it must\n \/\/ be kept alive in case the provider calls init again.\n}\n\n\/\/\/ Installs (adds) a \\a key to be provided by the service. The callback function \\a\n\/\/\/ subscription_changed_cb will be called with the passed user data \\a subscription_changed_cb_target\n\/\/\/ when the status of the subscription changes -- when the first subscriber appears or the\n\/\/\/ last subscriber disappears. The \\a clear_values_on_subscribe when enabled will automatically\n\/\/\/ clear (set to null\/undetermined) the group keys on first subscribe.\nvoid context_provider_install_key (const char* key,\n int clear_values_on_subscribe,\n ContextProviderSubscriptionChangedCallback subscription_changed_cb,\n void* subscription_changed_cb_target)\n{\n contextDebug() << F_C << key;\n\n if (! cService) {\n contextCritical() << \"Can't install key:\" << key << \"because no service started.\";\n return;\n }\n\n listeners->append(new PropertyListener(*cService, key,\n clear_values_on_subscribe,\n subscription_changed_cb, subscription_changed_cb_target));\n cService->restart();\n}\n\n\/\/\/ Installs (adds) a \\a key_group to be provided by the service. The \\a key_group is a NULL-terminated\n\/\/\/ array containing the keys. The callback function \\a subscription_changed_cb will be called with the\n\/\/\/ passed user data \\a subscription_changed_cb_target when the status of the subscription changes --\n\/\/\/ when the first subscriber appears or the last subscriber disappears. The \\a clear_values_on_subscribe\n\/\/\/ when enabled will automatically clear (set to null\/undetermined) the group keys on first subscribe.\nvoid context_provider_install_group (char* const * key_group,\n int clear_values_on_subscribe,\n ContextProviderSubscriptionChangedCallback subscription_changed_cb,\n void* subscription_changed_cb_target)\n{\n contextDebug() << F_C;\n\n if (! cService) {\n contextCritical() << \"Can't install key group because no service started.\";\n return;\n }\n\n QStringList keys;\n int i = 0;\n while(key_group[i] != NULL) {\n QString key = QString(key_group[i]);\n\n keys << key;\n i++;\n }\n\n listeners->append(new GroupListener(*cService, keys,\n clear_values_on_subscribe,\n subscription_changed_cb, subscription_changed_cb_target));\n cService->restart();\n}\n\n\/\/\/ Sets the \\a key to a specified integer \\a value.\nvoid context_provider_set_integer (const char* key, int value)\n{\n contextDebug() << F_C << key << value;\n if (cService)\n cService->setValue(key, value);\n}\n\n\/\/\/ Sets the \\a key to a specified double \\a value.\nvoid context_provider_set_double (const char* key, double value)\n{\n contextDebug() << F_C << key << value;\n if (cService)\n cService->setValue(key, value);\n}\n\n\/\/\/ Sets the \\a key to a specified boolean \\a value.\nvoid context_provider_set_boolean (const char* key, int value)\n{\n contextDebug() << F_C << key << value;\n if (cService)\n cService->setValue(key, (value != 0));\n}\n\n\/\/\/ Sets the \\a key to a specified string \\a value. \\a value should be UTF-8.\nvoid context_provider_set_string (const char* key, const char* value)\n{\n contextDebug() << F_C << key << value;\n if (cService)\n cService->setValue(key, QString::fromUtf8(value));\n}\n\n\/\/\/ Sets the \\a key to NULL. In other words - unsets the key.\nvoid context_provider_set_null (const char* key)\n{\n contextDebug() << F_C << key;\n if (cService)\n cService->setValue(key, QVariant());\n}\n\n\/\/\/ Sets the value of \\a key to the specified \\a map. If \\a free_map is TRUE,\n\/\/\/ frees the map, which becomes invalid afterwards.\n\/\/\/\n\/\/\/ \\sa context_provider_map_new, context_provider_map_set_*\nvoid context_provider_set_map (const char* key, void* map, int free_map)\n{\n QVariantMap *qvm = reinterpret_cast<QVariantMap *>(map);\n cService->setValue(key, QVariant(*qvm));\n if (free_map)\n delete qvm;\n}\n\n\/\/\/ Creates an opaque map for use with the context_provider_map_set_* family\n\/\/\/ of functions. Free it with context_provider_map_free().\nvoid *context_provider_map_new ()\n{\n return new QVariantMap();\n}\n\n\/\/\/ Free the \\a map created by context_provider_map_new().\nvoid context_provider_map_free (void* map)\n{\n delete reinterpret_cast<QVariantMap *>(map);\n}\n\n\/\/\/ Sets \\a key to the integer \\a value in \\a map.\nvoid context_provider_map_set_integer(void* map, const char* key, int value)\n{\n QVariantMap *qvm = reinterpret_cast<QVariantMap *>(map);\n qvm->insert(key, QVariant(value));\n}\n\n\/\/\/ Sets \\a key to the double \\a value in \\a map.\nvoid context_provider_map_set_double (void* map, const char* key, double value)\n{\n QVariantMap *qvm = reinterpret_cast<QVariantMap *>(map);\n qvm->insert(key, QVariant(value));\n}\n\n\/\/\/ Sets \\a key to the boolean \\a value in \\a map.\nvoid context_provider_map_set_boolean(void* map, const char* key, int value)\n{\n QVariantMap *qvm = reinterpret_cast<QVariantMap *>(map);\n qvm->insert(key, QVariant(value != 0));\n}\n\n\/\/\/ Sets \\a key to the string \\a value in \\a map.\nvoid context_provider_map_set_string (void* map, const char* key, const char* value)\n{\n QVariantMap *qvm = reinterpret_cast<QVariantMap *>(map);\n qvm->insert(key, QVariant(value));\n}\n\n\/\/\/ Sets \\a key to the map \\a value in \\a map. NOTE: \\a value is freed, and\n\/\/\/ becomes invalid after this call.\nvoid context_provider_map_set_map (void* map, const char* key, void* value)\n{\n QVariantMap *qvm = reinterpret_cast<QVariantMap *>(map);\n QVariantMap *other = reinterpret_cast<QVariantMap *>(value);\n qvm->insert(key, QVariant(*other));\n delete other;\n}\n\n\/\/\/ Sets \\a key to the list \\a value in \\a map. NOTE: \\a value is freed, and\n\/\/\/ becomes invalid after this call.\nvoid context_provider_map_set_list(void* map, const char* key, void* value)\n{\n QVariantMap *qvm = reinterpret_cast<QVariantMap *>(map);\n QVariantList *list = reinterpret_cast<QVariantList *>(value);\n qvm->insert(key, QVariant(*list));\n delete list;\n}\n\n\/\/\/ Sets the value of \\a key to the specified \\a list. If \\a free_list is\n\/\/\/ TRUE, the list is freed.\n\/\/\/\n\/\/\/ \\sa context_provider_list_new, context_provider_list_add_*\nvoid context_provider_set_list(const char* key, void* list, int free_list)\n{\n QVariantList *qvl = reinterpret_cast<QVariantList *>(list);\n cService->setValue(key, QVariant(*qvl));\n if (free_list)\n delete qvl;\n}\n\n\/\/\/ Creates an opaque list for use with the context_provider_list_add_* family\n\/\/\/ of functions. Free it with context_provider_list_free().\nvoid *context_provider_list_new()\n{\n return new QVariantList();\n}\n\n\/\/\/ Frees the list created by context_provider_list_new(). Use\n\/\/\/ context_provider_list_free() to free it.\nvoid context_provider_list_free(void* list)\n{\n delete reinterpret_cast<QVariantList *>(list);\n}\n\n\/\/\/ Appends the integer \\a value to \\a list.\nvoid context_provider_list_add_integer(void* list, int value)\n{\n QVariantList *qvl = reinterpret_cast<QVariantList *>(list);\n qvl->append(QVariant(value));\n}\n\n\/\/\/ Appends the double \\a value to \\a list.\nvoid context_provider_list_add_double(void* list, double value)\n{\n QVariantList *qvl = reinterpret_cast<QVariantList *>(list);\n qvl->append(QVariant(value));\n}\n\n\/\/\/ Appends the boolean \\a value to \\a list.\nvoid context_provider_list_add_boolean(void* list, int value)\n{\n QVariantList *qvl = reinterpret_cast<QVariantList *>(list);\n qvl->append(QVariant(value != 0));\n}\n\n\/\/\/ Appends the string \\a value to \\a list.\nvoid context_provider_list_add_string(void* list, const char* value)\n{\n QVariantList *qvl = reinterpret_cast<QVariantList *>(list);\n qvl->append(QVariant(value));\n}\n\n\/\/\/ Appends the specified map (\\a value) to \\a list. NOTE: \\a value is freed\n\/\/\/ and becomes invalid after this call.\nvoid context_provider_list_add_map(void* list, void* value)\n{\n QVariantList *qvl = reinterpret_cast<QVariantList *>(list);\n QVariantMap *qvm = reinterpret_cast<QVariantMap *>(value);\n qvl->append(QVariant(*qvm));\n delete qvm;\n}\n\n\/\/\/ Appends the specified list \\a value to \\a list. NOTE: \\a value is freed,\n\/\/\/ and becomes invalid after this call.\nvoid context_provider_list_add_list(void* list, void* value)\n{\n QVariantList *qvl = reinterpret_cast<QVariantList *>(list);\n QVariantList *vl = reinterpret_cast<QVariantList *>(value);\n qvl->append(QVariant(*vl));\n delete vl;\n}\n<commit_msg>context_provider_map_set_string, _add_string: the same UTF-8 fix.<commit_after>\/*\n * Copyright (C) 2008 Nokia Corporation.\n *\n * Contact: Marius Vollmer <marius.vollmer@nokia.com>\n *\n * This library is free software; you can redistribute it and\/or\n * modify it under the terms of the GNU Lesser General Public License\n * version 2.1 as published by the Free Software Foundation.\n *\n * This library is distributed in the hope that it will be useful, but\n * WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU\n * Lesser General Public License for more details.\n *\n * You should have received a copy of the GNU Lesser General Public\n * License along with this library; if not, write to the Free Software\n * Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA\n * 02110-1301 USA\n *\n *\/\n\n#include \"contextc.h\"\n#include \"service.h\"\n#include \"property.h\"\n#include \"group.h\"\n#include \"logging.h\"\n#include \"sconnect.h\"\n#include \"listeners.h\"\n#include \"loggingfeatures.h\"\n\n#include <QCoreApplication>\n\nnamespace ContextProvider {\n}\n\nusing namespace ContextProvider;\n\n\/*!\n \\page CApi C Api\n\n \\brief The libcontextprovider library offers a simple plain-C API to be used\n from any C program.\n\n \\section Usage\n\n \\code\n context_provider_init(DBUS_BUS_SESSION, \"org.test.provider\");\n\n context_provider_install_key(\"Battery.OnBattery\", 0, NULL, NULL);\n context_provider_install_key(\"Battery.ChargePercentage\", 0, NULL, NULL);\n\n context_provider_set_boolean(\"Battery.OnBattery\", 1);\n context_provider_set_integer(\"Battery.ChargePercentage\", 55);\n \\endcode\n\n The above code snippet starts a service at \"org.test.provider\" with two\n keys (\"Battery.OnBattery\", \"Battery.ChargePercentage\") and sets their\n respective values.\n\n Note: If the provider used other D-Bus bindings than QDBus, the\n service name (\"org.test.provider\") needs to be unique, i.e., the\n provider process should not register it itself.\n\n \\section Callbacks\n\n The context_provider_install_key function and context_provider_install_group function\n take arguments specyfying the callback function. The callback is executed when the\n subscription status changes for the key or the key group (first subscriber\n appears or last subscriber goes away). Basing on this info the provider can\n manage it's resources. It's okay also to use the callback function to actually\n set the value.\n\n \\code\n void callback_function_example(int subscribed, void* user_data)\n {\n if (subscribed) {\n \/\/ First subscriber appeared.\n \/\/ Start ie. pooling the data.\n } else {\n \/\/ Last subscribed disappeared.\n \/\/ Stop pooling data, release resources.\n }\n }\n \\endcode\n*\/\n\nstatic Service *cService;\nstatic QList<Listener*> *listeners = NULL;\n\n\/\/\/ Initializes and starts the service with a given \\a bus_type and a \\a bus_name.\n\/\/\/ The \\a bus_type can be DBUS_BUS_SESSION or DBUS_BUS_SYSTEM. This function can be\n\/\/\/ called only once till a matching context_provider_stop is called.\nint context_provider_init (DBusBusType bus_type, const char* bus_name)\n{\n contextDebug() << F_C << bus_name;\n\n static char arg[] = \"libcontextprovider\";\n static char* p = arg;\n static int argc = 1;\n static QCoreApplication* app = 0;\n\n if (QCoreApplication::instance() == 0) {\n \/\/ No QCoreApplication created, so crate one.\n \/\/ This will also create an event dispatcher (QEventDispatcherGlibPrivate.)\n app = new QCoreApplication(argc, &p);\n }\n\n if (cService != NULL) {\n contextCritical() << \"Service already initialized. You can only initialize one service with C API\";\n return 0;\n }\n\n cService = new Service(bus_type == DBUS_BUS_SESSION\n ? QDBusConnection::SessionBus\n : QDBusConnection::SystemBus,\n bus_name);\n listeners = new QList<Listener*>;\n\n return 1;\n}\n\n\/\/\/ Stops the currently started service with context_provider_init. After calling\n\/\/\/ this function a new service can be started by calling context_provider_init.\nvoid context_provider_stop (void)\n{\n contextDebug() << F_C;\n if (cService) {\n contextDebug() << \"Stopping service\";\n\n \/\/ Delete all listeners\n if (listeners) {\n Q_FOREACH (Listener *listener, *listeners)\n delete listener;\n }\n delete listeners; listeners = NULL;\n\n delete cService;\n cService = NULL;\n }\n \/\/ We cannot destroy the QCoreApplication we might have created; it must\n \/\/ be kept alive in case the provider calls init again.\n}\n\n\/\/\/ Installs (adds) a \\a key to be provided by the service. The callback function \\a\n\/\/\/ subscription_changed_cb will be called with the passed user data \\a subscription_changed_cb_target\n\/\/\/ when the status of the subscription changes -- when the first subscriber appears or the\n\/\/\/ last subscriber disappears. The \\a clear_values_on_subscribe when enabled will automatically\n\/\/\/ clear (set to null\/undetermined) the group keys on first subscribe.\nvoid context_provider_install_key (const char* key,\n int clear_values_on_subscribe,\n ContextProviderSubscriptionChangedCallback subscription_changed_cb,\n void* subscription_changed_cb_target)\n{\n contextDebug() << F_C << key;\n\n if (! cService) {\n contextCritical() << \"Can't install key:\" << key << \"because no service started.\";\n return;\n }\n\n listeners->append(new PropertyListener(*cService, key,\n clear_values_on_subscribe,\n subscription_changed_cb, subscription_changed_cb_target));\n cService->restart();\n}\n\n\/\/\/ Installs (adds) a \\a key_group to be provided by the service. The \\a key_group is a NULL-terminated\n\/\/\/ array containing the keys. The callback function \\a subscription_changed_cb will be called with the\n\/\/\/ passed user data \\a subscription_changed_cb_target when the status of the subscription changes --\n\/\/\/ when the first subscriber appears or the last subscriber disappears. The \\a clear_values_on_subscribe\n\/\/\/ when enabled will automatically clear (set to null\/undetermined) the group keys on first subscribe.\nvoid context_provider_install_group (char* const * key_group,\n int clear_values_on_subscribe,\n ContextProviderSubscriptionChangedCallback subscription_changed_cb,\n void* subscription_changed_cb_target)\n{\n contextDebug() << F_C;\n\n if (! cService) {\n contextCritical() << \"Can't install key group because no service started.\";\n return;\n }\n\n QStringList keys;\n int i = 0;\n while(key_group[i] != NULL) {\n QString key = QString(key_group[i]);\n\n keys << key;\n i++;\n }\n\n listeners->append(new GroupListener(*cService, keys,\n clear_values_on_subscribe,\n subscription_changed_cb, subscription_changed_cb_target));\n cService->restart();\n}\n\n\/\/\/ Sets the \\a key to a specified integer \\a value.\nvoid context_provider_set_integer (const char* key, int value)\n{\n contextDebug() << F_C << key << value;\n if (cService)\n cService->setValue(key, value);\n}\n\n\/\/\/ Sets the \\a key to a specified double \\a value.\nvoid context_provider_set_double (const char* key, double value)\n{\n contextDebug() << F_C << key << value;\n if (cService)\n cService->setValue(key, value);\n}\n\n\/\/\/ Sets the \\a key to a specified boolean \\a value.\nvoid context_provider_set_boolean (const char* key, int value)\n{\n contextDebug() << F_C << key << value;\n if (cService)\n cService->setValue(key, (value != 0));\n}\n\n\/\/\/ Sets the \\a key to a specified string \\a value. \\a value should be UTF-8.\nvoid context_provider_set_string (const char* key, const char* value)\n{\n contextDebug() << F_C << key << value;\n if (cService)\n cService->setValue(key, QString::fromUtf8(value));\n}\n\n\/\/\/ Sets the \\a key to NULL. In other words - unsets the key.\nvoid context_provider_set_null (const char* key)\n{\n contextDebug() << F_C << key;\n if (cService)\n cService->setValue(key, QVariant());\n}\n\n\/\/\/ Sets the value of \\a key to the specified \\a map. If \\a free_map is TRUE,\n\/\/\/ frees the map, which becomes invalid afterwards.\n\/\/\/\n\/\/\/ \\sa context_provider_map_new, context_provider_map_set_*\nvoid context_provider_set_map (const char* key, void* map, int free_map)\n{\n QVariantMap *qvm = reinterpret_cast<QVariantMap *>(map);\n cService->setValue(key, QVariant(*qvm));\n if (free_map)\n delete qvm;\n}\n\n\/\/\/ Creates an opaque map for use with the context_provider_map_set_* family\n\/\/\/ of functions. Free it with context_provider_map_free().\nvoid *context_provider_map_new ()\n{\n return new QVariantMap();\n}\n\n\/\/\/ Free the \\a map created by context_provider_map_new().\nvoid context_provider_map_free (void* map)\n{\n delete reinterpret_cast<QVariantMap *>(map);\n}\n\n\/\/\/ Sets \\a key to the integer \\a value in \\a map.\nvoid context_provider_map_set_integer(void* map, const char* key, int value)\n{\n QVariantMap *qvm = reinterpret_cast<QVariantMap *>(map);\n qvm->insert(key, QVariant(value));\n}\n\n\/\/\/ Sets \\a key to the double \\a value in \\a map.\nvoid context_provider_map_set_double (void* map, const char* key, double value)\n{\n QVariantMap *qvm = reinterpret_cast<QVariantMap *>(map);\n qvm->insert(key, QVariant(value));\n}\n\n\/\/\/ Sets \\a key to the boolean \\a value in \\a map.\nvoid context_provider_map_set_boolean(void* map, const char* key, int value)\n{\n QVariantMap *qvm = reinterpret_cast<QVariantMap *>(map);\n qvm->insert(key, QVariant(value != 0));\n}\n\n\/\/\/ Sets \\a key to the string \\a value in \\a map.\nvoid context_provider_map_set_string (void* map, const char* key, const char* value)\n{\n QVariantMap *qvm = reinterpret_cast<QVariantMap *>(map);\n qvm->insert(key, QVariant(QString::fromUtf8(value)));\n}\n\n\/\/\/ Sets \\a key to the map \\a value in \\a map. NOTE: \\a value is freed, and\n\/\/\/ becomes invalid after this call.\nvoid context_provider_map_set_map (void* map, const char* key, void* value)\n{\n QVariantMap *qvm = reinterpret_cast<QVariantMap *>(map);\n QVariantMap *other = reinterpret_cast<QVariantMap *>(value);\n qvm->insert(key, QVariant(*other));\n delete other;\n}\n\n\/\/\/ Sets \\a key to the list \\a value in \\a map. NOTE: \\a value is freed, and\n\/\/\/ becomes invalid after this call.\nvoid context_provider_map_set_list(void* map, const char* key, void* value)\n{\n QVariantMap *qvm = reinterpret_cast<QVariantMap *>(map);\n QVariantList *list = reinterpret_cast<QVariantList *>(value);\n qvm->insert(key, QVariant(*list));\n delete list;\n}\n\n\/\/\/ Sets the value of \\a key to the specified \\a list. If \\a free_list is\n\/\/\/ TRUE, the list is freed.\n\/\/\/\n\/\/\/ \\sa context_provider_list_new, context_provider_list_add_*\nvoid context_provider_set_list(const char* key, void* list, int free_list)\n{\n QVariantList *qvl = reinterpret_cast<QVariantList *>(list);\n cService->setValue(key, QVariant(*qvl));\n if (free_list)\n delete qvl;\n}\n\n\/\/\/ Creates an opaque list for use with the context_provider_list_add_* family\n\/\/\/ of functions. Free it with context_provider_list_free().\nvoid *context_provider_list_new()\n{\n return new QVariantList();\n}\n\n\/\/\/ Frees the list created by context_provider_list_new(). Use\n\/\/\/ context_provider_list_free() to free it.\nvoid context_provider_list_free(void* list)\n{\n delete reinterpret_cast<QVariantList *>(list);\n}\n\n\/\/\/ Appends the integer \\a value to \\a list.\nvoid context_provider_list_add_integer(void* list, int value)\n{\n QVariantList *qvl = reinterpret_cast<QVariantList *>(list);\n qvl->append(QVariant(value));\n}\n\n\/\/\/ Appends the double \\a value to \\a list.\nvoid context_provider_list_add_double(void* list, double value)\n{\n QVariantList *qvl = reinterpret_cast<QVariantList *>(list);\n qvl->append(QVariant(value));\n}\n\n\/\/\/ Appends the boolean \\a value to \\a list.\nvoid context_provider_list_add_boolean(void* list, int value)\n{\n QVariantList *qvl = reinterpret_cast<QVariantList *>(list);\n qvl->append(QVariant(value != 0));\n}\n\n\/\/\/ Appends the string \\a value to \\a list.\nvoid context_provider_list_add_string(void* list, const char* value)\n{\n QVariantList *qvl = reinterpret_cast<QVariantList *>(list);\n qvl->append(QVariant(QString::fromUtf8(value)));\n}\n\n\/\/\/ Appends the specified map (\\a value) to \\a list. NOTE: \\a value is freed\n\/\/\/ and becomes invalid after this call.\nvoid context_provider_list_add_map(void* list, void* value)\n{\n QVariantList *qvl = reinterpret_cast<QVariantList *>(list);\n QVariantMap *qvm = reinterpret_cast<QVariantMap *>(value);\n qvl->append(QVariant(*qvm));\n delete qvm;\n}\n\n\/\/\/ Appends the specified list \\a value to \\a list. NOTE: \\a value is freed,\n\/\/\/ and becomes invalid after this call.\nvoid context_provider_list_add_list(void* list, void* value)\n{\n QVariantList *qvl = reinterpret_cast<QVariantList *>(list);\n QVariantList *vl = reinterpret_cast<QVariantList *>(value);\n qvl->append(QVariant(*vl));\n delete vl;\n}\n<|endoftext|>"} {"text":"<commit_before>\/** \\file MediaTypeUtil.cc\n * \\brief Implementation of Media Type utility functions.\n * \\author Dr. Gordon W. Paynter\n * \\author Dr. Johannes Ruscheinski\n *\/\n\n\/*\n * Copyright 2004-2008 Project iVia.\n * Copyright 2004-2008 The Regents of The University of California.\n * Copyright 2016 Universitätsbibliothek Tübingen.\n *\n * This file is part of the libiViaCore package.\n *\n * The libiViaCore package is free software; you can redistribute it and\/or\n * modify it under the terms of the GNU Lesser General Public License as published\n * by the Free Software Foundation; either version 2 of the License, or\n * (at your option) any later version.\n *\n * libiViaCore is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the\n * GNU Lesser General Public License for more details.\n *\n * You should have received a copy of the GNU Lesser General Public License\n * along with libiViaCore; if not, write to the Free Software\n * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA\n *\/\n\n#include \"MediaTypeUtil.h\"\n#include <stdexcept>\n#include <cctype>\n#include <alloca.h>\n#include <magic.h>\n#include \"File.h\"\n#include \"HttpHeader.h\"\n#include \"PerlCompatRegExp.h\"\n#include \"StringUtil.h\"\n#include \"Url.h\"\n#include \"util.h\"\n#include \"WebUtil.h\"\n#include \"XMLParser.h\"\n#include <iostream>\n\n\nnamespace MediaTypeUtil {\n\n\nstd::string GetHtmlMediaType(const std::string &document) {\n static const PerlCompatRegExp doctype_regexp(\"^\\\\s*<(?:!DOCTYPE\\\\s+HTML\\\\s+PUBLIC\\\\s+\\\"-\/\/W3C\/\/DTD\\\\s+){0,1}(X?HTML)|<html>\",\n PerlCompatRegExp::OPTIMIZE_FOR_MULTIPLE_USE, PCRE_CASELESS);\n\n \/\/ If we have a match we have either HTML or XHTML...\n std::string matched_substring;\n if (doctype_regexp.match(document) and doctype_regexp.getMatchedSubstring(1, &matched_substring))\n return matched_substring.length() == 4 ? \"text\/html\" : \"text\/xhtml\";\n\n \/\/ ...otherwise we have no idea what we have:\n return \"\";\n}\n\n\nstatic std::string LZ4_MAGIC(\"\\000\\042\\115\\030\");\n\n\n\/\/ GetMediaType -- Get the media type of a document.\n\/\/\nstd::string GetMediaType(const std::string &document, const bool auto_simplify) {\n if (document.empty())\n return \"\";\n\n \/\/ 1. See if we have (X)HTML:\n std::string media_type(GetHtmlMediaType(document));\n if (not media_type.empty())\n return media_type;\n\n \/\/ 2. Check for LZ4 compression:\n if (document.substr(0, 4) == LZ4_MAGIC)\n return \"application\/lz4\";\n\n \/\/ 3. Next try libmagic:\n const magic_t cookie = ::magic_open(MAGIC_MIME);\n if (unlikely(cookie == nullptr))\n throw std::runtime_error(\"in MediaTypeUtil::GetMediaType: could not open libmagic!\");\n\n \/\/ Load the default \"magic\" definitions file:\n if (unlikely(::magic_load(cookie, nullptr \/* use default magic file *\/) != 0)) {\n ::magic_close(cookie);\n throw std::runtime_error(\"in MediaTypeUtil::GetMediaType: could not load libmagic (\"\n + std::string(::magic_error(cookie)) + \").\");\n }\n\n \/\/ Use magic to get the mime type of the buffer:\n const char *magic_mime_type = ::magic_buffer(cookie, document.c_str(), document.length());\n if (unlikely(magic_mime_type == nullptr)) {\n ::magic_close(cookie);\n throw std::runtime_error(\"in MediaTypeUtil::GetMediaType: error in libmagic (\"\n + std::string(::magic_error(cookie)) + \").\");\n }\n\n \/\/ Attempt to remove possible leading junk (no idea why libmagic behaves in this manner every now and then):\n if (std::strncmp(magic_mime_type, \"\\\\012- \", 6) == 0)\n magic_mime_type += 6;\n\n \/\/ Close the library:\n media_type = magic_mime_type;\n ::magic_close(cookie);\n\n \/\/ 4. If the libmagic could not determine the document's MIME type, test for XML:\n if (media_type.empty() and document.size() > 5)\n return std::strncmp(document.c_str(), \"<?xml\", 5) == 0 ? \"text\/xml\" : \"\";\n\n if (auto_simplify)\n SimplifyMediaType(&media_type);\n\n return media_type;\n}\n\n\nstd::string GetMediaType(const std::string &document, std::string * const subtype, const bool auto_simplify) {\n std::string media_type(GetMediaType(document, auto_simplify));\n \/\/ also include \"text\/html\" which is reported by libmagic if xml prolog is missing\n if (media_type == \"text\/xml\" or (media_type == \"text\/html\" and not (GetHtmlMediaType(document) == \"text\/html\"))) {\n XMLParser parser(document, XMLParser::XML_STRING);\n XMLParser::XMLPart part;\n if (parser.skipTo(XMLParser::XMLPart::OPENING_TAG, \"\", &part)) {\n const auto xmlns(part.attributes_.find(\"xmlns\"));\n if (part.data_ == \"TEI\" and xmlns != part.attributes_.end() and xmlns->second == \"http:\/\/www.tei-c.org\/ns\/1.0\") {\n media_type = \"text\/xml\";\n *subtype = \"tei\";\n }\n }\n }\n\n return media_type;\n}\n\n\nstd::string GetFileMediaType(const std::string &filename, const bool auto_simplify) {\n const magic_t cookie(::magic_open(MAGIC_MIME | MAGIC_SYMLINK));\n if (unlikely(cookie == nullptr))\n throw std::runtime_error(\"in MediaTypeUtil::GetMediaType: could not open libmagic!\");\n\n \/\/ Load the default \"magic\" definitions file:\n if (unlikely(::magic_load(cookie, nullptr \/* use default magic file *\/) != 0)) {\n ::magic_close(cookie);\n throw std::runtime_error(\"in MediaTypeUtil::GetMediaType: could not load libmagic (\"\n + std::string(::magic_error(cookie)) + \").\");\n }\n\n \/\/ Use magic to get the mime type of the buffer:\n const char *magic_mime_type(::magic_file(cookie, filename.c_str()));\n if (unlikely(magic_mime_type == nullptr)) {\n ::magic_close(cookie);\n throw std::runtime_error(\"in MediaTypeUtil::GetFileMediaType: error in libmagic (\"\n + std::string(::magic_error(cookie)) + \").\");\n }\n\n \/\/ Attempt to remove possible leading junk (no idea why libmagic behaves in this manner every now and then):\n if (std::strncmp(magic_mime_type, \"\\\\012- \", 6) == 0)\n magic_mime_type += 6;\n\n \/\/ Close the library:\n std::string media_type(magic_mime_type);\n ::magic_close(cookie);\n\n if (auto_simplify)\n SimplifyMediaType(&media_type);\n\n if (StringUtil::StartsWith(media_type, \"application\/octet-stream\")) {\n File input(filename, \"r\");\n if (unlikely(input.anErrorOccurred()))\n logger->error(\"in MediaTypeUtil::GetFileMediaType: failed to open \\\"\" + filename + \"\\\" for reading!\");\n char * const buf(reinterpret_cast<char *>(::alloca(LZ4_MAGIC.size())));\n if ((input.read(buf, sizeof(buf)) == sizeof(buf)) and std::strncmp(LZ4_MAGIC.c_str(), buf, LZ4_MAGIC.size()) == 0)\n return \"application\/lz4\";\n }\n\n return media_type;\n}\n\n\n\/\/ GetMediaType -- get the media type of a Web page.\n\/\/\nstd::string GetMediaType(const std::string &page_header, const std::string &page_body, const bool auto_simplify) {\n \/\/ First, attempt to find the media type in the header:\n HttpHeader http_header(page_header);\n if (http_header.isValid()) {\n std::string media_type(http_header.getMediaType());\n if (not media_type.empty()) {\n StringUtil::ASCIIToLower(&media_type);\n if (auto_simplify)\n SimplifyMediaType(&media_type);\n return media_type;\n }\n }\n\n \/\/ Otherwise, check the content:\n return GetMediaType(page_body, auto_simplify);\n}\n\n\n\/\/ GetMediaType -- Get the MediaType of the page. Returns true if \"media_type\" is known and set.\n\/\/\nbool GetMediaType(const Url &url, const HttpHeader &http_header, const std::string &page_content,\n std::string * const media_type, const bool auto_simplify)\n{\n \/\/ First, attempt to find the media type in the header:\n if (http_header.isValid()) {\n *media_type = http_header.getMediaType();\n if (not media_type->empty()) {\n if (auto_simplify)\n SimplifyMediaType(media_type);\n return true;\n }\n }\n\n \/\/ Second, attempt to use the \"magic\" library (libmagic) to analyse the page:\n *media_type = MediaTypeUtil::GetMediaType(page_content);\n if (not media_type->empty()) {\n if (auto_simplify)\n SimplifyMediaType(media_type);\n return true;\n }\n\n \/\/ Third, guess based on URL:\n *media_type = WebUtil::GuessMediaType(url);\n if (not media_type->empty() and auto_simplify)\n SimplifyMediaType(media_type);\n return not media_type->empty();\n}\n\n\nstd::string GetMediaType(const HttpHeader &http_header, const std::string &page_body, const bool auto_simplify) {\n std::string media_type;\n\n \/\/ First, attempt to find the media type in the header:\n if (http_header.isValid()) {\n media_type = http_header.getMediaType();\n if (not media_type.empty()) {\n StringUtil::ASCIIToLower(&media_type);\n if (auto_simplify)\n SimplifyMediaType(&media_type);\n return media_type;\n }\n }\n\n \/\/ Second, attempt to use the \"magic\" library (libmagic) to analyse the page:\n media_type = MediaTypeUtil::GetMediaType(page_body, auto_simplify);\n\n return media_type;\n}\n\n\nbool GetMediaType(const std::string &url, const HttpHeader &http_header, const std::string &page_content,\n std::string * const media_type, const bool auto_simplify)\n{\n return GetMediaType(Url(url), http_header, page_content, media_type, auto_simplify);\n}\n\n\nbool SimplifyMediaType(std::string * const media_type) {\n if (media_type->empty())\n return false;\n\n \/\/ This is the format of the Content-Type field for Web pages:\n \/\/ media-type = type \"\/\" subtype *( \";\" parameter )\n \/\/ type = token\n \/\/ subtype = token\n \/\/ See: http:\/\/www.w3.org\/Protocols\/rfc2616\/rfc2616-sec3.html#sec3.7\n\n const std::string initial_media_type(*media_type);\n\n \/\/ Search for a semicolon and delete any 'parameter' parts:\n const std::string::size_type semicolon_pos(media_type->find(';'));\n if (semicolon_pos != std::string::npos)\n media_type->resize(semicolon_pos);\n else { \/\/ Try a space instead of a semicolon.\n const std::string::size_type space_pos(media_type->find(' '));\n if (space_pos != std::string::npos)\n media_type->resize(space_pos);\n }\n\n StringUtil::TrimWhite(media_type);\n\n \/\/ Return if \"media_type\" has changed:\n return initial_media_type != *media_type;\n}\n\n\n} \/\/ namespace MediaTypeUtil\n<commit_msg>Remove debug include<commit_after>\/** \\file MediaTypeUtil.cc\n * \\brief Implementation of Media Type utility functions.\n * \\author Dr. Gordon W. Paynter\n * \\author Dr. Johannes Ruscheinski\n *\/\n\n\/*\n * Copyright 2004-2008 Project iVia.\n * Copyright 2004-2008 The Regents of The University of California.\n * Copyright 2016 Universitätsbibliothek Tübingen.\n *\n * This file is part of the libiViaCore package.\n *\n * The libiViaCore package is free software; you can redistribute it and\/or\n * modify it under the terms of the GNU Lesser General Public License as published\n * by the Free Software Foundation; either version 2 of the License, or\n * (at your option) any later version.\n *\n * libiViaCore is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the\n * GNU Lesser General Public License for more details.\n *\n * You should have received a copy of the GNU Lesser General Public License\n * along with libiViaCore; if not, write to the Free Software\n * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA\n *\/\n\n#include \"MediaTypeUtil.h\"\n#include <stdexcept>\n#include <cctype>\n#include <alloca.h>\n#include <magic.h>\n#include \"File.h\"\n#include \"HttpHeader.h\"\n#include \"PerlCompatRegExp.h\"\n#include \"StringUtil.h\"\n#include \"Url.h\"\n#include \"util.h\"\n#include \"WebUtil.h\"\n#include \"XMLParser.h\"\n\n\nnamespace MediaTypeUtil {\n\n\nstd::string GetHtmlMediaType(const std::string &document) {\n static const PerlCompatRegExp doctype_regexp(\"^\\\\s*<(?:!DOCTYPE\\\\s+HTML\\\\s+PUBLIC\\\\s+\\\"-\/\/W3C\/\/DTD\\\\s+){0,1}(X?HTML)|<html>\",\n PerlCompatRegExp::OPTIMIZE_FOR_MULTIPLE_USE, PCRE_CASELESS);\n\n \/\/ If we have a match we have either HTML or XHTML...\n std::string matched_substring;\n if (doctype_regexp.match(document) and doctype_regexp.getMatchedSubstring(1, &matched_substring))\n return matched_substring.length() == 4 ? \"text\/html\" : \"text\/xhtml\";\n\n \/\/ ...otherwise we have no idea what we have:\n return \"\";\n}\n\n\nstatic std::string LZ4_MAGIC(\"\\000\\042\\115\\030\");\n\n\n\/\/ GetMediaType -- Get the media type of a document.\n\/\/\nstd::string GetMediaType(const std::string &document, const bool auto_simplify) {\n if (document.empty())\n return \"\";\n\n \/\/ 1. See if we have (X)HTML:\n std::string media_type(GetHtmlMediaType(document));\n if (not media_type.empty())\n return media_type;\n\n \/\/ 2. Check for LZ4 compression:\n if (document.substr(0, 4) == LZ4_MAGIC)\n return \"application\/lz4\";\n\n \/\/ 3. Next try libmagic:\n const magic_t cookie = ::magic_open(MAGIC_MIME);\n if (unlikely(cookie == nullptr))\n throw std::runtime_error(\"in MediaTypeUtil::GetMediaType: could not open libmagic!\");\n\n \/\/ Load the default \"magic\" definitions file:\n if (unlikely(::magic_load(cookie, nullptr \/* use default magic file *\/) != 0)) {\n ::magic_close(cookie);\n throw std::runtime_error(\"in MediaTypeUtil::GetMediaType: could not load libmagic (\"\n + std::string(::magic_error(cookie)) + \").\");\n }\n\n \/\/ Use magic to get the mime type of the buffer:\n const char *magic_mime_type = ::magic_buffer(cookie, document.c_str(), document.length());\n if (unlikely(magic_mime_type == nullptr)) {\n ::magic_close(cookie);\n throw std::runtime_error(\"in MediaTypeUtil::GetMediaType: error in libmagic (\"\n + std::string(::magic_error(cookie)) + \").\");\n }\n\n \/\/ Attempt to remove possible leading junk (no idea why libmagic behaves in this manner every now and then):\n if (std::strncmp(magic_mime_type, \"\\\\012- \", 6) == 0)\n magic_mime_type += 6;\n\n \/\/ Close the library:\n media_type = magic_mime_type;\n ::magic_close(cookie);\n\n \/\/ 4. If the libmagic could not determine the document's MIME type, test for XML:\n if (media_type.empty() and document.size() > 5)\n return std::strncmp(document.c_str(), \"<?xml\", 5) == 0 ? \"text\/xml\" : \"\";\n\n if (auto_simplify)\n SimplifyMediaType(&media_type);\n\n return media_type;\n}\n\n\nstd::string GetMediaType(const std::string &document, std::string * const subtype, const bool auto_simplify) {\n std::string media_type(GetMediaType(document, auto_simplify));\n \/\/ also include \"text\/html\" which is reported by libmagic if xml prolog is missing\n if (media_type == \"text\/xml\" or (media_type == \"text\/html\" and not (GetHtmlMediaType(document) == \"text\/html\"))) {\n XMLParser parser(document, XMLParser::XML_STRING);\n XMLParser::XMLPart part;\n if (parser.skipTo(XMLParser::XMLPart::OPENING_TAG, \"\", &part)) {\n const auto xmlns(part.attributes_.find(\"xmlns\"));\n if (part.data_ == \"TEI\" and xmlns != part.attributes_.end() and xmlns->second == \"http:\/\/www.tei-c.org\/ns\/1.0\") {\n media_type = \"text\/xml\";\n *subtype = \"tei\";\n }\n }\n }\n\n return media_type;\n}\n\n\nstd::string GetFileMediaType(const std::string &filename, const bool auto_simplify) {\n const magic_t cookie(::magic_open(MAGIC_MIME | MAGIC_SYMLINK));\n if (unlikely(cookie == nullptr))\n throw std::runtime_error(\"in MediaTypeUtil::GetMediaType: could not open libmagic!\");\n\n \/\/ Load the default \"magic\" definitions file:\n if (unlikely(::magic_load(cookie, nullptr \/* use default magic file *\/) != 0)) {\n ::magic_close(cookie);\n throw std::runtime_error(\"in MediaTypeUtil::GetMediaType: could not load libmagic (\"\n + std::string(::magic_error(cookie)) + \").\");\n }\n\n \/\/ Use magic to get the mime type of the buffer:\n const char *magic_mime_type(::magic_file(cookie, filename.c_str()));\n if (unlikely(magic_mime_type == nullptr)) {\n ::magic_close(cookie);\n throw std::runtime_error(\"in MediaTypeUtil::GetFileMediaType: error in libmagic (\"\n + std::string(::magic_error(cookie)) + \").\");\n }\n\n \/\/ Attempt to remove possible leading junk (no idea why libmagic behaves in this manner every now and then):\n if (std::strncmp(magic_mime_type, \"\\\\012- \", 6) == 0)\n magic_mime_type += 6;\n\n \/\/ Close the library:\n std::string media_type(magic_mime_type);\n ::magic_close(cookie);\n\n if (auto_simplify)\n SimplifyMediaType(&media_type);\n\n if (StringUtil::StartsWith(media_type, \"application\/octet-stream\")) {\n File input(filename, \"r\");\n if (unlikely(input.anErrorOccurred()))\n logger->error(\"in MediaTypeUtil::GetFileMediaType: failed to open \\\"\" + filename + \"\\\" for reading!\");\n char * const buf(reinterpret_cast<char *>(::alloca(LZ4_MAGIC.size())));\n if ((input.read(buf, sizeof(buf)) == sizeof(buf)) and std::strncmp(LZ4_MAGIC.c_str(), buf, LZ4_MAGIC.size()) == 0)\n return \"application\/lz4\";\n }\n\n return media_type;\n}\n\n\n\/\/ GetMediaType -- get the media type of a Web page.\n\/\/\nstd::string GetMediaType(const std::string &page_header, const std::string &page_body, const bool auto_simplify) {\n \/\/ First, attempt to find the media type in the header:\n HttpHeader http_header(page_header);\n if (http_header.isValid()) {\n std::string media_type(http_header.getMediaType());\n if (not media_type.empty()) {\n StringUtil::ASCIIToLower(&media_type);\n if (auto_simplify)\n SimplifyMediaType(&media_type);\n return media_type;\n }\n }\n\n \/\/ Otherwise, check the content:\n return GetMediaType(page_body, auto_simplify);\n}\n\n\n\/\/ GetMediaType -- Get the MediaType of the page. Returns true if \"media_type\" is known and set.\n\/\/\nbool GetMediaType(const Url &url, const HttpHeader &http_header, const std::string &page_content,\n std::string * const media_type, const bool auto_simplify)\n{\n \/\/ First, attempt to find the media type in the header:\n if (http_header.isValid()) {\n *media_type = http_header.getMediaType();\n if (not media_type->empty()) {\n if (auto_simplify)\n SimplifyMediaType(media_type);\n return true;\n }\n }\n\n \/\/ Second, attempt to use the \"magic\" library (libmagic) to analyse the page:\n *media_type = MediaTypeUtil::GetMediaType(page_content);\n if (not media_type->empty()) {\n if (auto_simplify)\n SimplifyMediaType(media_type);\n return true;\n }\n\n \/\/ Third, guess based on URL:\n *media_type = WebUtil::GuessMediaType(url);\n if (not media_type->empty() and auto_simplify)\n SimplifyMediaType(media_type);\n return not media_type->empty();\n}\n\n\nstd::string GetMediaType(const HttpHeader &http_header, const std::string &page_body, const bool auto_simplify) {\n std::string media_type;\n\n \/\/ First, attempt to find the media type in the header:\n if (http_header.isValid()) {\n media_type = http_header.getMediaType();\n if (not media_type.empty()) {\n StringUtil::ASCIIToLower(&media_type);\n if (auto_simplify)\n SimplifyMediaType(&media_type);\n return media_type;\n }\n }\n\n \/\/ Second, attempt to use the \"magic\" library (libmagic) to analyse the page:\n media_type = MediaTypeUtil::GetMediaType(page_body, auto_simplify);\n\n return media_type;\n}\n\n\nbool GetMediaType(const std::string &url, const HttpHeader &http_header, const std::string &page_content,\n std::string * const media_type, const bool auto_simplify)\n{\n return GetMediaType(Url(url), http_header, page_content, media_type, auto_simplify);\n}\n\n\nbool SimplifyMediaType(std::string * const media_type) {\n if (media_type->empty())\n return false;\n\n \/\/ This is the format of the Content-Type field for Web pages:\n \/\/ media-type = type \"\/\" subtype *( \";\" parameter )\n \/\/ type = token\n \/\/ subtype = token\n \/\/ See: http:\/\/www.w3.org\/Protocols\/rfc2616\/rfc2616-sec3.html#sec3.7\n\n const std::string initial_media_type(*media_type);\n\n \/\/ Search for a semicolon and delete any 'parameter' parts:\n const std::string::size_type semicolon_pos(media_type->find(';'));\n if (semicolon_pos != std::string::npos)\n media_type->resize(semicolon_pos);\n else { \/\/ Try a space instead of a semicolon.\n const std::string::size_type space_pos(media_type->find(' '));\n if (space_pos != std::string::npos)\n media_type->resize(space_pos);\n }\n\n StringUtil::TrimWhite(media_type);\n\n \/\/ Return if \"media_type\" has changed:\n return initial_media_type != *media_type;\n}\n\n\n} \/\/ namespace MediaTypeUtil\n<|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\/ValuePrinter.h\"\n\n#include \"cling\/Interpreter\/CValuePrinter.h\"\n#include \"cling\/Interpreter\/ValuePrinterInfo.h\"\n#include \"cling\/Interpreter\/StoredValueRef.h\"\n#include \"cling\/Interpreter\/Value.h\"\n\n#include \"clang\/AST\/ASTContext.h\"\n#include \"clang\/AST\/Decl.h\"\n#include \"clang\/AST\/DeclCXX.h\"\n#include \"clang\/AST\/Expr.h\"\n#include \"clang\/AST\/Type.h\"\n\n#include \"llvm\/Support\/raw_ostream.h\"\n#include \"llvm\/ExecutionEngine\/GenericValue.h\"\n\n#include <string>\n#include <sstream>\n#include <cstdio>\n\n\/\/ Fragment copied from LLVM's raw_ostream.cpp\n#if defined(_MSC_VER)\n#ifndef STDIN_FILENO\n# define STDIN_FILENO 0\n#endif\n#ifndef STDOUT_FILENO\n# define STDOUT_FILENO 1\n#endif\n#ifndef STDERR_FILENO\n# define STDERR_FILENO 2\n#endif\n#else\n\/\/#if defined(HAVE_UNISTD_H)\n# include <unistd.h>\n\/\/#endif\n#endif\n\nusing namespace cling;\n\n\/\/ Implements the CValuePrinter interface.\nextern \"C\" void cling_PrintValue(void* \/*clang::Expr**\/ E,\n void* \/*clang::ASTContext**\/ C,\n const void* value) {\n clang::Expr* Exp = (clang::Expr*)E;\n clang::ASTContext* Context = (clang::ASTContext*)C;\n ValuePrinterInfo VPI(Exp->getType(), Context);\n\n \/\/ We need stream that doesn't close its file descriptor, thus we are not\n \/\/ using llvm::outs. Keeping file descriptor open we will be able to use\n \/\/ the results in pipes (Savannah #99234).\n llvm::raw_fd_ostream outs (STDOUT_FILENO, \/*ShouldClose*\/false);\n\n valuePrinterInternal::flushToStream(outs, printType(value, value, VPI)\n + printValue(value, value, VPI));\n}\n\n\nstatic void StreamValue(llvm::raw_ostream& o, const void* const p,\n const ValuePrinterInfo& VPI);\n\nstatic void StreamChar(llvm::raw_ostream& o, const char v) {\n if (isprint(v))\n o << '\"' << v << \"\\\"\";\n else {\n o << \"\\\\0x\";\n o.write_hex(v);\n }\n}\n\nstatic void StreamCharPtr(llvm::raw_ostream& o, const char* const v) {\n if (!v) {\n o << \"<<<NULL>>>\";\n return;\n }\n o << '\"';\n const char* p = v;\n for (;*p && p - v < 128; ++p) {\n o << *p;\n }\n if (*p) o << \"\\\"...\";\n else o << \"\\\"\";\n}\n\nstatic void StreamRef(llvm::raw_ostream& o, const void* v) {\n o <<\"&\" << v;\n}\n\nstatic void StreamPtr(llvm::raw_ostream& o, const void* v) {\n o << v;\n}\n\nstatic void StreamArr(llvm::raw_ostream& o, const void* p,\n const ValuePrinterInfo& VPI) {\n const clang::QualType& Ty = VPI.getType();\n clang::ASTContext& C = *VPI.getASTContext();\n const clang::ArrayType* ArrTy = Ty->getAsArrayTypeUnsafe();\n clang::QualType ElementTy = ArrTy->getElementType();\n if (ElementTy->isCharType())\n StreamCharPtr(o, (const char*)p);\n else if (Ty->isConstantArrayType()) {\n \/\/ Stream a constant array by streaming up to 5 elements.\n const clang::ConstantArrayType* CArrTy\n = C.getAsConstantArrayType(Ty);\n const llvm::APInt& APSize = CArrTy->getSize();\n size_t ElBytes = C.getTypeSize(ElementTy) \/ C.getCharWidth();\n size_t Size = (size_t)APSize.getZExtValue();\n o << \"{ \";\n ValuePrinterInfo ElVPI(ElementTy, &C);\n for (size_t i = 0; i < Size; ++i) {\n StreamValue(o, ((const char*)p) + i * ElBytes, ElVPI);\n if (i + 1 < Size) {\n if (i == 4) {\n o << \"...\";\n break;\n }\n else o << \", \";\n }\n }\n o << \" }\";\n } else\n StreamPtr(o, p);\n}\n\nstatic void StreamFunction(llvm::raw_ostream& o, const void* addr,\n ValuePrinterInfo VPI) {\n o << \"Function @\" << addr << '\\n';\n\n const clang::DeclRefExpr* DeclRefExp\n = llvm::dyn_cast_or_null<clang::DeclRefExpr>(VPI.getExpr());\n const clang::FunctionDecl* FD = 0;\n if (DeclRefExp)\n FD = llvm::dyn_cast_or_null<clang::FunctionDecl>(DeclRefExp->getDecl());\n if (FD) {\n clang::SourceRange SRange = FD->getSourceRange();\n const char* cBegin = 0;\n const char* cEnd = 0;\n bool Invalid;\n if (SRange.isValid()) {\n clang::SourceManager& SM = VPI.getASTContext()->getSourceManager();\n clang::SourceLocation LocBegin = SRange.getBegin();\n LocBegin = SM.getExpansionRange(LocBegin).first;\n o << \" at \" << SM.getFilename(LocBegin);\n unsigned LineNo = SM.getSpellingLineNumber(LocBegin, &Invalid);\n if (!Invalid)\n o << ':' << LineNo;\n o << \":\\n\";\n bool Invalid = false;\n cBegin = SM.getCharacterData(LocBegin, &Invalid);\n if (!Invalid) {\n clang::SourceLocation LocEnd = SRange.getEnd();\n LocEnd = SM.getExpansionRange(LocEnd).second;\n cEnd = SM.getCharacterData(LocEnd, &Invalid);\n if (Invalid)\n cBegin = 0;\n } else {\n cBegin = 0;\n }\n }\n if (cBegin && cEnd && cEnd > cBegin && cEnd - cBegin < 16 * 1024) {\n o << llvm::StringRef(cBegin, cEnd - cBegin + 1);\n } else {\n const clang::FunctionDecl* FDef;\n if (FD->hasBody(FDef))\n FD = FDef;\n FD->print(o);\n \/\/const clang::FunctionDecl* FD\n \/\/ = llvm::cast<const clang::FunctionType>(Ty)->getDecl();\n }\n } else {\n o << \":\\n\";\n \/\/ type-based printing:\n VPI.getType().print(o, VPI.getASTContext()->getPrintingPolicy());\n }\n \/\/ type-based print() never and decl-based print() sometimes does not include\n \/\/ a final newline:\n o << '\\n';\n}\n\nstatic void StreamLongDouble(llvm::raw_ostream& o, const Value* value,\n clang::ASTContext& C) {\n llvm::APFloat LDbl(C.getFloatTypeSemantics(value->getClangType()),\n value->getGV().IntVal);\n llvm::SmallString<24> Buf;\n LDbl.toString(Buf);\n o << Buf << 'L';\n}\n\nstatic void StreamClingValue(llvm::raw_ostream& o, const Value* value,\n clang::ASTContext& C) {\n if (!value || !value->isValid()) {\n o << \"<<<invalid>>> @\" << value;\n } else {\n o << \"boxes [\";\n o << \"(\"\n << value->getClangType().getAsString(C.getPrintingPolicy())\n << \") \";\n clang::QualType valType = value->getClangType().getDesugaredType(C);\n if (C.hasSameType(valType, C.LongDoubleTy))\n StreamLongDouble(o, value, C);\n else if (valType->isFloatingType())\n o << value->getGV().DoubleVal;\n else if (valType->isIntegerType())\n o << value->getGV().IntVal.getSExtValue();\n else if (valType->isBooleanType())\n o << value->getGV().IntVal.getBoolValue();\n else\n StreamValue(o, value->getGV().PointerVal,\n ValuePrinterInfo(valType, &C));\n o << \"]\";\n }\n}\n\nstatic void StreamObj(llvm::raw_ostream& o, const void* v,\n const ValuePrinterInfo& VPI) {\n const clang::Type* Ty = VPI.getType().getTypePtr();\n if (clang::CXXRecordDecl* CXXRD = Ty->getAsCXXRecordDecl()) {\n std::string QualName = CXXRD->getQualifiedNameAsString();\n if (QualName == \"cling::StoredValueRef\"){\n valuePrinterInternal::StreamStoredValueRef(o, (const StoredValueRef*)v,\n *VPI.getASTContext());\n return;\n } else if (QualName == \"cling::Value\") {\n StreamClingValue(o, (const Value*)v, *VPI.getASTContext());\n return;\n }\n } \/\/ if CXXRecordDecl\n\n \/\/ TODO: Print the object members.\n o << \"@\" << v;\n}\n\nstatic void StreamValue(llvm::raw_ostream& o, const void* const p,\n const ValuePrinterInfo& VPI) {\n clang::ASTContext& C = *VPI.getASTContext();\n clang::QualType Ty = VPI.getType().getDesugaredType(C);\n if (const clang::BuiltinType *BT\n = llvm::dyn_cast<clang::BuiltinType>(Ty.getCanonicalType())) {\n switch (BT->getKind()) {\n case clang::BuiltinType::Bool:\n if (*(const bool*)p) o << \"true\";\n else o << \"false\"; break;\n case clang::BuiltinType::Char_U:\n case clang::BuiltinType::UChar:\n case clang::BuiltinType::Char_S:\n case clang::BuiltinType::SChar: StreamChar(o, *(const char*)p); break;\n case clang::BuiltinType::Short: o << *(const short*)p; break;\n case clang::BuiltinType::UShort:\n o << *(const unsigned short*)p;\n break;\n case clang::BuiltinType::Int: o << *(const int*)p; break;\n case clang::BuiltinType::UInt:\n o << *(const unsigned int*)p;\n break;\n case clang::BuiltinType::Long: o << *(const long*)p; break;\n case clang::BuiltinType::ULong:\n o << *(const unsigned long*)p;\n break;\n case clang::BuiltinType::LongLong:\n o << *(const long long*)p;\n break;\n case clang::BuiltinType::ULongLong:\n o << *(const unsigned long long*)p;\n break;\n case clang::BuiltinType::Float: o << *(const float*)p; break;\n case clang::BuiltinType::Double: o << *(const double*)p; break;\n case clang::BuiltinType::LongDouble: {\n std::stringstream ssLD;\n ssLD << *(const long double*)p;\n o << ssLD.str() << 'L'; break;\n }\n default:\n StreamObj(o, p, ValuePrinterInfo(Ty, &C));\n }\n }\n else if (Ty.getAsString().compare(\"class std::basic_string<char>\") == 0\n || Ty.getAsString().compare(\"class std::__1::basic_string<char, \"\n \"struct std::__1::char_traits<char>, \"\n \"class std::__1::allocator<char> >\")\n == 0) {\n StreamObj(o, p, ValuePrinterInfo(Ty, &C));\n o << \" \"; \/\/ force a space\n o <<\"c_str: \";\n StreamCharPtr(o, ((const char*) (*(const std::string*)p).c_str()));\n }\n else if (Ty->isEnumeralType()) {\n clang::EnumDecl* ED = Ty->getAs<clang::EnumType>()->getDecl();\n uint64_t value = *(const uint64_t*)p;\n bool IsFirst = true;\n llvm::APSInt ValAsAPSInt = C.MakeIntValue(value, Ty);\n for (clang::EnumDecl::enumerator_iterator I = ED->enumerator_begin(),\n E = ED->enumerator_end(); I != E; ++I) {\n if (I->getInitVal() == ValAsAPSInt) {\n if (!IsFirst) {\n o << \" ? \";\n }\n o << \"(\" << I->getQualifiedNameAsString() << \")\";\n IsFirst = false;\n }\n }\n o << \" : (int) \" << ValAsAPSInt.toString(\/*Radix = *\/10);\n }\n else if (Ty->isReferenceType())\n StreamRef(o, p);\n else if (Ty->isPointerType()) {\n clang::QualType PointeeTy = Ty->getPointeeType();\n if (PointeeTy->isCharType())\n StreamCharPtr(o, (const char*)p);\n else\n StreamPtr(o, p);\n }\n else if (Ty->isArrayType())\n StreamArr(o, p, ValuePrinterInfo(Ty, &C));\n else if (Ty->isFunctionType())\n StreamFunction(o, p, VPI);\n else\n StreamObj(o, p, ValuePrinterInfo(Ty, &C));\n}\n\nnamespace cling {\nnamespace valuePrinterInternal {\n std::string printValue_Default(const void* const p,\n const ValuePrinterInfo& VPI) {\n std::string buf;\n {\n llvm::raw_string_ostream o(buf);\n StreamValue(o, p, VPI);\n }\n return buf;\n }\n\n std::string printType_Default(const ValuePrinterInfo& VPI) {\n std::string buf;\n {\n llvm::raw_string_ostream o(buf);\n o << \"(\";\n o << VPI.getType().getAsString();\n o << \") \";\n }\n return buf;\n }\n\n void StreamStoredValueRef(llvm::raw_ostream& o,\n const StoredValueRef* VR,\n clang::ASTContext& C) {\n if (VR->isValid()) {\n StreamClingValue(o, &VR->get(), C);\n } else {\n o << \"<<<invalid>>> @\" << VR;\n }\n }\n\n void flushToStream(llvm::raw_ostream& o, const std::string& s) {\n \/\/ We want to keep stdout and o in sync if o is different from stdout.\n fflush(stdout);\n o << s;\n o.flush();\n }\n} \/\/ end namespace valuePrinterInternal\n} \/\/ end namespace cling\n<commit_msg>Stream refs by streaming the ref'ed object.<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\/ValuePrinter.h\"\n\n#include \"cling\/Interpreter\/CValuePrinter.h\"\n#include \"cling\/Interpreter\/ValuePrinterInfo.h\"\n#include \"cling\/Interpreter\/StoredValueRef.h\"\n#include \"cling\/Interpreter\/Value.h\"\n\n#include \"clang\/AST\/ASTContext.h\"\n#include \"clang\/AST\/Decl.h\"\n#include \"clang\/AST\/DeclCXX.h\"\n#include \"clang\/AST\/Expr.h\"\n#include \"clang\/AST\/Type.h\"\n\n#include \"llvm\/Support\/raw_ostream.h\"\n#include \"llvm\/ExecutionEngine\/GenericValue.h\"\n\n#include <string>\n#include <sstream>\n#include <cstdio>\n\n\/\/ Fragment copied from LLVM's raw_ostream.cpp\n#if defined(_MSC_VER)\n#ifndef STDIN_FILENO\n# define STDIN_FILENO 0\n#endif\n#ifndef STDOUT_FILENO\n# define STDOUT_FILENO 1\n#endif\n#ifndef STDERR_FILENO\n# define STDERR_FILENO 2\n#endif\n#else\n\/\/#if defined(HAVE_UNISTD_H)\n# include <unistd.h>\n\/\/#endif\n#endif\n\nusing namespace cling;\n\n\/\/ Implements the CValuePrinter interface.\nextern \"C\" void cling_PrintValue(void* \/*clang::Expr**\/ E,\n void* \/*clang::ASTContext**\/ C,\n const void* value) {\n clang::Expr* Exp = (clang::Expr*)E;\n clang::ASTContext* Context = (clang::ASTContext*)C;\n ValuePrinterInfo VPI(Exp->getType(), Context);\n\n \/\/ We need stream that doesn't close its file descriptor, thus we are not\n \/\/ using llvm::outs. Keeping file descriptor open we will be able to use\n \/\/ the results in pipes (Savannah #99234).\n llvm::raw_fd_ostream outs (STDOUT_FILENO, \/*ShouldClose*\/false);\n\n valuePrinterInternal::flushToStream(outs, printType(value, value, VPI)\n + printValue(value, value, VPI));\n}\n\n\nstatic void StreamValue(llvm::raw_ostream& o, const void* const p,\n const ValuePrinterInfo& VPI);\n\nstatic void StreamChar(llvm::raw_ostream& o, const char v) {\n if (isprint(v))\n o << '\"' << v << \"\\\"\";\n else {\n o << \"\\\\0x\";\n o.write_hex(v);\n }\n}\n\nstatic void StreamCharPtr(llvm::raw_ostream& o, const char* const v) {\n if (!v) {\n o << \"<<<NULL>>>\";\n return;\n }\n o << '\"';\n const char* p = v;\n for (;*p && p - v < 128; ++p) {\n o << *p;\n }\n if (*p) o << \"\\\"...\";\n else o << \"\\\"\";\n}\n\nstatic void StreamRef(llvm::raw_ostream& o, const void* v,\n const ValuePrinterInfo& VPI) {\n const clang::ReferenceType* RTy\n = llvm::dyn_cast<clang::ReferenceType>(VPI.getType().getTypePtr());\n ValuePrinterInfo VPIRefed(RTy->getPointeeType(), VPI.getASTContext());\n StreamValue(o, v, VPIRefed);\n}\n\nstatic void StreamPtr(llvm::raw_ostream& o, const void* v) {\n o << v;\n}\n\nstatic void StreamArr(llvm::raw_ostream& o, const void* p,\n const ValuePrinterInfo& VPI) {\n const clang::QualType& Ty = VPI.getType();\n clang::ASTContext& C = *VPI.getASTContext();\n const clang::ArrayType* ArrTy = Ty->getAsArrayTypeUnsafe();\n clang::QualType ElementTy = ArrTy->getElementType();\n if (ElementTy->isCharType())\n StreamCharPtr(o, (const char*)p);\n else if (Ty->isConstantArrayType()) {\n \/\/ Stream a constant array by streaming up to 5 elements.\n const clang::ConstantArrayType* CArrTy\n = C.getAsConstantArrayType(Ty);\n const llvm::APInt& APSize = CArrTy->getSize();\n size_t ElBytes = C.getTypeSize(ElementTy) \/ C.getCharWidth();\n size_t Size = (size_t)APSize.getZExtValue();\n o << \"{ \";\n ValuePrinterInfo ElVPI(ElementTy, &C);\n for (size_t i = 0; i < Size; ++i) {\n StreamValue(o, ((const char*)p) + i * ElBytes, ElVPI);\n if (i + 1 < Size) {\n if (i == 4) {\n o << \"...\";\n break;\n }\n else o << \", \";\n }\n }\n o << \" }\";\n } else\n StreamPtr(o, p);\n}\n\nstatic void StreamFunction(llvm::raw_ostream& o, const void* addr,\n ValuePrinterInfo VPI) {\n o << \"Function @\" << addr << '\\n';\n\n const clang::DeclRefExpr* DeclRefExp\n = llvm::dyn_cast_or_null<clang::DeclRefExpr>(VPI.getExpr());\n const clang::FunctionDecl* FD = 0;\n if (DeclRefExp)\n FD = llvm::dyn_cast_or_null<clang::FunctionDecl>(DeclRefExp->getDecl());\n if (FD) {\n clang::SourceRange SRange = FD->getSourceRange();\n const char* cBegin = 0;\n const char* cEnd = 0;\n bool Invalid;\n if (SRange.isValid()) {\n clang::SourceManager& SM = VPI.getASTContext()->getSourceManager();\n clang::SourceLocation LocBegin = SRange.getBegin();\n LocBegin = SM.getExpansionRange(LocBegin).first;\n o << \" at \" << SM.getFilename(LocBegin);\n unsigned LineNo = SM.getSpellingLineNumber(LocBegin, &Invalid);\n if (!Invalid)\n o << ':' << LineNo;\n o << \":\\n\";\n bool Invalid = false;\n cBegin = SM.getCharacterData(LocBegin, &Invalid);\n if (!Invalid) {\n clang::SourceLocation LocEnd = SRange.getEnd();\n LocEnd = SM.getExpansionRange(LocEnd).second;\n cEnd = SM.getCharacterData(LocEnd, &Invalid);\n if (Invalid)\n cBegin = 0;\n } else {\n cBegin = 0;\n }\n }\n if (cBegin && cEnd && cEnd > cBegin && cEnd - cBegin < 16 * 1024) {\n o << llvm::StringRef(cBegin, cEnd - cBegin + 1);\n } else {\n const clang::FunctionDecl* FDef;\n if (FD->hasBody(FDef))\n FD = FDef;\n FD->print(o);\n \/\/const clang::FunctionDecl* FD\n \/\/ = llvm::cast<const clang::FunctionType>(Ty)->getDecl();\n }\n } else {\n o << \":\\n\";\n \/\/ type-based printing:\n VPI.getType().print(o, VPI.getASTContext()->getPrintingPolicy());\n }\n \/\/ type-based print() never and decl-based print() sometimes does not include\n \/\/ a final newline:\n o << '\\n';\n}\n\nstatic void StreamLongDouble(llvm::raw_ostream& o, const Value* value,\n clang::ASTContext& C) {\n llvm::APFloat LDbl(C.getFloatTypeSemantics(value->getClangType()),\n value->getGV().IntVal);\n llvm::SmallString<24> Buf;\n LDbl.toString(Buf);\n o << Buf << 'L';\n}\n\nstatic void StreamClingValue(llvm::raw_ostream& o, const Value* value,\n clang::ASTContext& C) {\n if (!value || !value->isValid()) {\n o << \"<<<invalid>>> @\" << value;\n } else {\n o << \"boxes [\";\n o << \"(\"\n << value->getClangType().getAsString(C.getPrintingPolicy())\n << \") \";\n clang::QualType valType = value->getClangType().getDesugaredType(C);\n if (C.hasSameType(valType, C.LongDoubleTy))\n StreamLongDouble(o, value, C);\n else if (valType->isFloatingType())\n o << value->getGV().DoubleVal;\n else if (valType->isIntegerType())\n o << value->getGV().IntVal.getSExtValue();\n else if (valType->isBooleanType())\n o << value->getGV().IntVal.getBoolValue();\n else\n StreamValue(o, value->getGV().PointerVal,\n ValuePrinterInfo(valType, &C));\n o << \"]\";\n }\n}\n\nstatic void StreamObj(llvm::raw_ostream& o, const void* v,\n const ValuePrinterInfo& VPI) {\n const clang::Type* Ty = VPI.getType().getTypePtr();\n if (clang::CXXRecordDecl* CXXRD = Ty->getAsCXXRecordDecl()) {\n std::string QualName = CXXRD->getQualifiedNameAsString();\n if (QualName == \"cling::StoredValueRef\"){\n valuePrinterInternal::StreamStoredValueRef(o, (const StoredValueRef*)v,\n *VPI.getASTContext());\n return;\n } else if (QualName == \"cling::Value\") {\n StreamClingValue(o, (const Value*)v, *VPI.getASTContext());\n return;\n }\n } \/\/ if CXXRecordDecl\n\n \/\/ TODO: Print the object members.\n o << \"@\" << v;\n}\n\nstatic void StreamValue(llvm::raw_ostream& o, const void* const p,\n const ValuePrinterInfo& VPI) {\n clang::ASTContext& C = *VPI.getASTContext();\n clang::QualType Ty = VPI.getType().getDesugaredType(C);\n if (const clang::BuiltinType *BT\n = llvm::dyn_cast<clang::BuiltinType>(Ty.getCanonicalType())) {\n switch (BT->getKind()) {\n case clang::BuiltinType::Bool:\n if (*(const bool*)p) o << \"true\";\n else o << \"false\"; break;\n case clang::BuiltinType::Char_U:\n case clang::BuiltinType::UChar:\n case clang::BuiltinType::Char_S:\n case clang::BuiltinType::SChar: StreamChar(o, *(const char*)p); break;\n case clang::BuiltinType::Short: o << *(const short*)p; break;\n case clang::BuiltinType::UShort:\n o << *(const unsigned short*)p;\n break;\n case clang::BuiltinType::Int: o << *(const int*)p; break;\n case clang::BuiltinType::UInt:\n o << *(const unsigned int*)p;\n break;\n case clang::BuiltinType::Long: o << *(const long*)p; break;\n case clang::BuiltinType::ULong:\n o << *(const unsigned long*)p;\n break;\n case clang::BuiltinType::LongLong:\n o << *(const long long*)p;\n break;\n case clang::BuiltinType::ULongLong:\n o << *(const unsigned long long*)p;\n break;\n case clang::BuiltinType::Float: o << *(const float*)p; break;\n case clang::BuiltinType::Double: o << *(const double*)p; break;\n case clang::BuiltinType::LongDouble: {\n std::stringstream ssLD;\n ssLD << *(const long double*)p;\n o << ssLD.str() << 'L'; break;\n }\n default:\n StreamObj(o, p, ValuePrinterInfo(Ty, &C));\n }\n }\n else if (Ty.getAsString().compare(\"class std::basic_string<char>\") == 0\n || Ty.getAsString().compare(\"class std::__1::basic_string<char, \"\n \"struct std::__1::char_traits<char>, \"\n \"class std::__1::allocator<char> >\")\n == 0) {\n StreamObj(o, p, ValuePrinterInfo(Ty, &C));\n o << \" \"; \/\/ force a space\n o <<\"c_str: \";\n StreamCharPtr(o, ((const char*) (*(const std::string*)p).c_str()));\n }\n else if (Ty->isEnumeralType()) {\n clang::EnumDecl* ED = Ty->getAs<clang::EnumType>()->getDecl();\n uint64_t value = *(const uint64_t*)p;\n bool IsFirst = true;\n llvm::APSInt ValAsAPSInt = C.MakeIntValue(value, Ty);\n for (clang::EnumDecl::enumerator_iterator I = ED->enumerator_begin(),\n E = ED->enumerator_end(); I != E; ++I) {\n if (I->getInitVal() == ValAsAPSInt) {\n if (!IsFirst) {\n o << \" ? \";\n }\n o << \"(\" << I->getQualifiedNameAsString() << \")\";\n IsFirst = false;\n }\n }\n o << \" : (int) \" << ValAsAPSInt.toString(\/*Radix = *\/10);\n }\n else if (Ty->isReferenceType())\n StreamRef(o, p, VPI);\n else if (Ty->isPointerType()) {\n clang::QualType PointeeTy = Ty->getPointeeType();\n if (PointeeTy->isCharType())\n StreamCharPtr(o, (const char*)p);\n else\n StreamPtr(o, p);\n }\n else if (Ty->isArrayType())\n StreamArr(o, p, ValuePrinterInfo(Ty, &C));\n else if (Ty->isFunctionType())\n StreamFunction(o, p, VPI);\n else\n StreamObj(o, p, ValuePrinterInfo(Ty, &C));\n}\n\nnamespace cling {\nnamespace valuePrinterInternal {\n std::string printValue_Default(const void* const p,\n const ValuePrinterInfo& VPI) {\n std::string buf;\n {\n llvm::raw_string_ostream o(buf);\n StreamValue(o, p, VPI);\n }\n return buf;\n }\n\n std::string printType_Default(const ValuePrinterInfo& VPI) {\n std::string buf;\n {\n llvm::raw_string_ostream o(buf);\n o << \"(\";\n o << VPI.getType().getAsString();\n o << \") \";\n }\n return buf;\n }\n\n void StreamStoredValueRef(llvm::raw_ostream& o,\n const StoredValueRef* VR,\n clang::ASTContext& C) {\n if (VR->isValid()) {\n StreamClingValue(o, &VR->get(), C);\n } else {\n o << \"<<<invalid>>> @\" << VR;\n }\n }\n\n void flushToStream(llvm::raw_ostream& o, const std::string& s) {\n \/\/ We want to keep stdout and o in sync if o is different from stdout.\n fflush(stdout);\n o << s;\n o.flush();\n }\n} \/\/ end namespace valuePrinterInternal\n} \/\/ end namespace cling\n<|endoftext|>"} {"text":"<commit_before>\/*\n * Copyright (c) 1999-2004 Sourceforge JACOB Project.\n * All rights reserved. Originator: Dan Adler (http:\/\/danadler.com).\n * Get more information about JACOB at http:\/\/sourceforge.net\/projects\/jacob-project\n *\n * This library is free software; you can redistribute it and\/or\n * modify it under the terms of the GNU Lesser General Public\n * License as published by the Free Software Foundation; either\n * version 2.1 of the License, or (at your option) any later version.\n *\n * This library is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU\n * Lesser General Public License for more details.\n *\n * You should have received 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#include \"stdafx.h\"\n#include <objbase.h>\n#include \"Dispatch.h\"\n\/\/ Win32 support for Ole Automation\n#include <wchar.h>\n#include <string.h>\n#include <atlbase.h>\n#include <oleauto.h>\n#include <olectl.h>\n#include \"util.h\"\n\nextern \"C\" {\n\nJNIEXPORT jint JNICALL Java_com_jacob_com_IUnknown_toEnumVariant\n (JNIEnv *env, jobject obj, jint pointer) {\n IDispatch *dispatch = (IDispatch *) pointer;\n LCID lcid = 2048; \/\/ <--- heh\n unsigned int argErr;\n EXCEPINFO excepinfo;\n DISPPARAMS dispParams;\n VARIANT result;\n IEnumVARIANT *pEnum = NULL;\n\n VariantInit(&result);\n dispParams.rgvarg = NULL;\n dispParams.rgdispidNamedArgs = NULL;\n dispParams.cNamedArgs = 0;\n dispParams.cArgs = 0;\n memset(&excepinfo, 0, sizeof(excepinfo));\n HRESULT hr = dispatch->Invoke(DISPID_NEWENUM, IID_NULL, lcid, \n DISPATCH_METHOD | DISPATCH_PROPERTYGET, &dispParams, &result,\n &excepinfo, &argErr);\n\n if (FAILED(hr)) {\n VariantClear(&result);\n ThrowComFail(env, \"failed to get IEnum Interface\", hr);\n }\n\n if (V_VT(&result) == VT_UNKNOWN) {\n hr = V_UNKNOWN(&result)->QueryInterface(IID_IEnumVARIANT, (void **) &pEnum);\n } else if (V_VT(&result) == VT_DISPATCH) {\n hr = V_DISPATCH(&result)->QueryInterface(IID_IEnumVARIANT, (void **) &pEnum);\n }\n if (FAILED(hr) || !pEnum) {\n VariantClear(&result);\n ThrowComFail(env, \"failed to get IEnum Interface\", hr);\n }\n\n VariantClear(&result);\n\n return (jint) pEnum;\n}\n\n\/*\n * Class: IUnknown\n * Method: release\n * Signature: (I)V\n *\/\nJNIEXPORT void JNICALL Java_com_jacob_com_IUnknown_release\n (JNIEnv *env, jclass obj, jint pointer) {\n IUnknown* self = (IUnknown *) pointer;\n if(self != NULL) self->Release();\n}\n\n}\n<commit_msg>Mild retweaking<commit_after>\/*\n * Copyright (c) 1999-2004 Sourceforge JACOB Project.\n * All rights reserved. Originator: Dan Adler (http:\/\/danadler.com).\n * Get more information about JACOB at http:\/\/sourceforge.net\/projects\/jacob-project\n *\n * This library is free software; you can redistribute it and\/or\n * modify it under the terms of the GNU Lesser General Public\n * License as published by the Free Software Foundation; either\n * version 2.1 of the License, or (at your option) any later version.\n *\n * This library is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU\n * Lesser General Public License for more details.\n *\n * You should have received 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#include \"stdafx.h\"\n#include <objbase.h>\n#include \"Dispatch.h\"\n\/\/ Win32 support for Ole Automation\n#include <wchar.h>\n#include <string.h>\n#include <atlbase.h>\n#include <oleauto.h>\n#include <olectl.h>\n#include \"util.h\"\n\nextern \"C\" {\n\nJNIEXPORT jint JNICALL Java_com_jacob_com_IUnknown_toEnumVariant\n (JNIEnv *env, jobject obj, jint pointer) {\n IDispatch *dispatch = (IDispatch *) pointer;\n LCID lcid = 2048; \/\/ <--- heh\n unsigned int argErr;\n EXCEPINFO excepinfo;\n DISPPARAMS dispParams;\n VARIANT result;\n IEnumVARIANT *pEnum = NULL;\n\n VariantInit(&result);\n dispParams.rgvarg = NULL;\n dispParams.rgdispidNamedArgs = NULL;\n dispParams.cNamedArgs = 0;\n dispParams.cArgs = 0;\n memset(&excepinfo, 0, sizeof(excepinfo));\n HRESULT hr = dispatch->Invoke(DISPID_NEWENUM, IID_NULL, lcid, \n DISPATCH_METHOD | DISPATCH_PROPERTYGET, &dispParams, &result,\n &excepinfo, &argErr);\n\n if (FAILED(hr)) {\n VariantClear(&result);\n ThrowComFail(env, \"failed to get IEnum Interface\", hr);\n }\n\n if (V_VT(&result) == VT_UNKNOWN) {\n hr = V_UNKNOWN(&result)->QueryInterface(IID_IEnumVARIANT, (void **) &pEnum);\n } else if (V_VT(&result) == VT_DISPATCH) {\n hr = V_DISPATCH(&result)->QueryInterface(IID_IEnumVARIANT, (void **) &pEnum);\n }\n VariantClear(&result);\n \n if (FAILED(hr) || !pEnum) ThrowComFail(env, \"failed to get IEnum Interface\", hr);\n\n return (jint) pEnum;\n}\n\n\/*\n * Class: IUnknown\n * Method: release\n * Signature: (I)V\n *\/\nJNIEXPORT void JNICALL Java_com_jacob_com_IUnknown_release\n (JNIEnv *env, jclass obj, jint pointer) {\n IUnknown* self = (IUnknown *) pointer;\n if(self != NULL) self->Release();\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\/login\/user_view.h\"\n\n#include \"app\/l10n_util.h\"\n#include \"app\/resource_bundle.h\"\n#include \"chrome\/browser\/chromeos\/login\/helper.h\"\n#include \"chrome\/browser\/chromeos\/login\/rounded_rect_painter.h\"\n#include \"chrome\/browser\/chromeos\/login\/rounded_view.h\"\n#include \"gfx\/canvas.h\"\n#include \"gfx\/canvas_skia.h\"\n#include \"gfx\/rect.h\"\n#include \"grit\/generated_resources.h\"\n#include \"grit\/theme_resources.h\"\n#include \"views\/background.h\"\n#include \"views\/controls\/button\/text_button.h\"\n#include \"views\/controls\/image_view.h\"\n#include \"views\/controls\/label.h\"\n#include \"views\/controls\/link.h\"\n#include \"views\/painter.h\"\n\nnamespace {\n\n\/\/ Background color and corner radius of the login status label and\n\/\/ signout button.\nconst SkColor kSignoutBackgroundColor = 0xFF007700;\nconst int kSignoutBackgroundCornerRadius = 4;\n\n\/\/ Horiz\/Vert insets for Signout view.\nconst int kSignoutViewHorizontalInsets = 10;\nconst int kSignoutViewVerticalInsets = 5;\n\n\/\/ Padding between remove button and top right image corner.\nconst int kRemoveButtonPadding = 3;\n\n\/\/ Draws green-ish background for signout view with\n\/\/ rounded corners at the bottom.\nclass SignoutBackgroundPainter : public views::Painter {\n virtual void Paint(int w, int h, gfx::Canvas* canvas) {\n SkRect rect = {0, 0, w, h};\n SkPath path;\n SkScalar corners[] = {\n 0, 0,\n 0, 0,\n kSignoutBackgroundCornerRadius,\n kSignoutBackgroundCornerRadius,\n kSignoutBackgroundCornerRadius,\n kSignoutBackgroundCornerRadius,\n };\n path.addRoundRect(rect, corners);\n SkPaint paint;\n paint.setStyle(SkPaint::kFill_Style);\n paint.setFlags(SkPaint::kAntiAlias_Flag);\n paint.setColor(kSignoutBackgroundColor);\n canvas->AsCanvasSkia()->drawPath(path, paint);\n }\n};\n\n} \/\/ namespace\n\nnamespace chromeos {\n\nusing login::kBackgroundColor;\nusing login::kTextColor;\nusing login::kUserImageSize;\n\n\/\/ The view that shows the Sign out button below the user's image.\nclass SignoutView : public views::View {\n public:\n explicit SignoutView(views::LinkController* link_controller) {\n ResourceBundle& rb = ResourceBundle::GetSharedInstance();\n const gfx::Font& font = rb.GetFont(ResourceBundle::SmallFont);\n\n active_user_label_ = new views::Label(\n l10n_util::GetString(IDS_SCREEN_LOCK_ACTIVE_USER));\n active_user_label_->SetFont(font);\n active_user_label_->SetColor(kTextColor);\n\n signout_link_ = new views::Link(\n l10n_util::GetString(IDS_SCREEN_LOCK_SIGN_OUT));\n signout_link_->SetController(link_controller);\n signout_link_->SetFont(font);\n signout_link_->SetColor(kTextColor);\n signout_link_->SetFocusable(true);\n\n AddChildView(active_user_label_);\n AddChildView(signout_link_);\n\n set_background(views::Background::CreateBackgroundPainter(\n true, new SignoutBackgroundPainter()));\n }\n\n \/\/ views::View overrides.\n virtual void Layout() {\n gfx::Size label = active_user_label_->GetPreferredSize();\n gfx::Size button = signout_link_->GetPreferredSize();\n active_user_label_->SetBounds(\n kSignoutViewHorizontalInsets, (height() - label.height()) \/ 2,\n label.width(), label.height());\n signout_link_->SetBounds(\n width() - button.width() - kSignoutViewHorizontalInsets,\n (height() - button.height()) \/ 2,\n button.width(), button.height());\n }\n\n virtual gfx::Size GetPreferredSize() {\n gfx::Size label = active_user_label_->GetPreferredSize();\n gfx::Size button = signout_link_->GetPreferredSize();\n return gfx::Size(label.width() + button.width(),\n std::max(label.height(), button.height()) +\n kSignoutViewVerticalInsets * 2);\n }\n\n views::Link* signout_link() { return signout_link_; }\n\n private:\n friend class UserView;\n\n views::Label* active_user_label_;\n views::Link* signout_link_;\n\n DISALLOW_COPY_AND_ASSIGN(SignoutView);\n};\n\nclass RemoveButton : public views::TextButton {\n public:\n RemoveButton(views::ButtonListener* listener,\n const SkBitmap& icon,\n const std::wstring& text,\n const gfx::Point& top_right)\n : views::TextButton(listener, std::wstring()),\n icon_(icon),\n text_(text),\n top_right_(top_right),\n was_first_click_(false) {\n SetEnabledColor(SK_ColorWHITE);\n SetDisabledColor(SK_ColorWHITE);\n SetHighlightColor(SK_ColorWHITE);\n SetHoverColor(SK_ColorWHITE);\n SetIcon(icon_);\n UpdatePosition();\n }\n\n protected:\n \/\/ Overridden from View:\n virtual void OnMouseExited(const views::MouseEvent& event) {\n SetIcon(icon_);\n views::TextButton::SetText(std::wstring());\n ClearMaxTextSize();\n set_background(NULL);\n set_border(new views::TextButtonBorder);\n UpdatePosition();\n views::TextButton::OnMouseExited(event);\n was_first_click_ = false;\n }\n\n void NotifyClick(const views::Event& event) {\n if (!was_first_click_) {\n \/\/ On first click transform image to \"remove\" label.\n SetIcon(SkBitmap());\n views::TextButton::SetText(text_);\n\n const SkColor kStrokeColor = SK_ColorWHITE;\n const SkColor kButtonColor = 0xFFE94949;\n const int kStrokeWidth = 1;\n const int kVerticalPadding = 4;\n const int kHorizontalPadding = 8;\n const int kCornerRadius = 4;\n\n set_background(\n CreateRoundedBackground(\n kCornerRadius, kStrokeWidth, kButtonColor, kStrokeColor));\n\n set_border(\n views::Border::CreateEmptyBorder(kVerticalPadding,\n kHorizontalPadding,\n kVerticalPadding,\n kHorizontalPadding));\n\n UpdatePosition();\n was_first_click_ = true;\n } else {\n \/\/ On second click propagate to base class to fire ButtonPressed.\n views::TextButton::NotifyClick(event);\n }\n }\n\n void SetText(const std::wstring& text) {\n text_ = text;\n }\n\n private:\n \/\/ Update button position and schedule paint event for the view and parent.\n void UpdatePosition() {\n gfx::Size size = GetPreferredSize();\n gfx::Point origin = top_right_;\n origin.Offset(-size.width(), 0);\n SetBounds(gfx::Rect(origin, size));\n\n if (GetParent())\n GetParent()->SchedulePaint();\n }\n\n SkBitmap icon_;\n std::wstring text_;\n gfx::Point top_right_;\n bool was_first_click_;\n\n DISALLOW_COPY_AND_ASSIGN(RemoveButton);\n};\n\nclass PodImageView : public views::ImageView {\n public:\n PodImageView() { }\n\n void SetImage(const SkBitmap& image, const SkBitmap& image_hot) {\n image_ = image;\n image_hot_ = image_hot;\n views::ImageView::SetImage(image_);\n }\n\n protected:\n \/\/ Overridden from View:\n virtual void OnMouseEntered(const views::MouseEvent& event) {\n views::ImageView::SetImage(image_hot_);\n }\n\n virtual void OnMouseExited(const views::MouseEvent& event) {\n views::ImageView::SetImage(image_);\n }\n\n private:\n SkBitmap image_;\n SkBitmap image_hot_;\n\n DISALLOW_COPY_AND_ASSIGN(PodImageView);\n};\n\nUserView::UserView(Delegate* delegate, bool is_login, bool need_background)\n : delegate_(delegate),\n signout_view_(NULL),\n image_view_(NULL),\n remove_button_(NULL) {\n DCHECK(delegate);\n if (!is_login)\n signout_view_ = new SignoutView(this);\n\n if (need_background)\n image_view_ = new RoundedView<PodImageView>;\n else\n image_view_ = new PodImageView;\n\n Init(need_background);\n}\n\nvoid UserView::Init(bool need_background) {\n if (need_background) {\n image_view_->set_background(\n views::Background::CreateSolidBackground(kBackgroundColor));\n }\n\n \/\/ UserView's layout never changes, so let's layout once here.\n image_view_->SetBounds(0, 0, kUserImageSize, kUserImageSize);\n AddChildView(image_view_);\n\n if (signout_view_) {\n signout_view_->SetBounds(0, kUserImageSize, kUserImageSize,\n signout_view_->GetPreferredSize().height());\n AddChildView(signout_view_);\n }\n\n ResourceBundle& rb = ResourceBundle::GetSharedInstance();\n remove_button_ = new RemoveButton(\n this,\n *rb.GetBitmapNamed(IDR_CLOSE_BAR_H),\n l10n_util::GetString(IDS_LOGIN_REMOVE),\n gfx::Point(kUserImageSize - kRemoveButtonPadding, kRemoveButtonPadding));\n remove_button_->SetVisible(false);\n AddChildView(remove_button_);\n}\n\nvoid UserView::SetImage(const SkBitmap& image, const SkBitmap& image_hot) {\n int desired_size = std::min(image.width(), image.height());\n \/\/ Desired size is not preserved if it's greater than 75% of kUserImageSize.\n if (desired_size * 4 > 3 * kUserImageSize)\n desired_size = kUserImageSize;\n image_view_->SetImageSize(gfx::Size(desired_size, desired_size));\n image_view_->SetImage(image, image_hot);\n}\n\nvoid UserView::SetTooltipText(const std::wstring& text) {\n DCHECK(image_view_);\n image_view_->SetTooltipText(text);\n}\n\ngfx::Size UserView::GetPreferredSize() {\n return gfx::Size(\n kUserImageSize,\n kUserImageSize +\n (signout_view_ ? signout_view_->GetPreferredSize().height() : 0));\n}\n\nvoid UserView::SetSignoutEnabled(bool enabled) {\n DCHECK(signout_view_);\n signout_view_->signout_link_->SetEnabled(enabled);\n}\n\nvoid UserView::LinkActivated(views::Link* source, int event_flags) {\n DCHECK(delegate_);\n DCHECK(signout_view_);\n if (signout_view_->signout_link_ == source)\n delegate_->OnSignout();\n}\n\nvoid UserView::SetRemoveButtonVisible(bool flag) {\n remove_button_->SetVisible(flag);\n}\n\nvoid UserView::ButtonPressed(views::Button* sender, const views::Event& event) {\n DCHECK(delegate_);\n if (remove_button_ == sender)\n delegate_->OnRemoveUser();\n}\n\nvoid UserView::OnLocaleChanged() {\n remove_button_->SetText(l10n_util::GetString(IDS_LOGIN_REMOVE));\n}\n\n} \/\/ namespace chromeos\n<commit_msg>User pods show hand cursor on hover Re-applying from http:\/\/codereview.chromium.org\/5986005\/, LGTM is there.<commit_after>\/\/ Copyright (c) 2010 The Chromium Authors. All rights reserved.\n\/\/ Use of this source code is governed by a BSD-style license that can be\n\/\/ found in the LICENSE file.\n\n#include \"chrome\/browser\/chromeos\/login\/user_view.h\"\n\n#include \"app\/l10n_util.h\"\n#include \"app\/resource_bundle.h\"\n#include \"chrome\/browser\/chromeos\/login\/helper.h\"\n#include \"chrome\/browser\/chromeos\/login\/rounded_rect_painter.h\"\n#include \"chrome\/browser\/chromeos\/login\/rounded_view.h\"\n#include \"gfx\/canvas.h\"\n#include \"gfx\/canvas_skia.h\"\n#include \"gfx\/gtk_util.h\"\n#include \"gfx\/rect.h\"\n#include \"grit\/generated_resources.h\"\n#include \"grit\/theme_resources.h\"\n#include \"views\/background.h\"\n#include \"views\/controls\/button\/text_button.h\"\n#include \"views\/controls\/image_view.h\"\n#include \"views\/controls\/label.h\"\n#include \"views\/controls\/link.h\"\n#include \"views\/painter.h\"\n\nnamespace {\n\n\/\/ Background color and corner radius of the login status label and\n\/\/ signout button.\nconst SkColor kSignoutBackgroundColor = 0xFF007700;\nconst int kSignoutBackgroundCornerRadius = 4;\n\n\/\/ Horiz\/Vert insets for Signout view.\nconst int kSignoutViewHorizontalInsets = 10;\nconst int kSignoutViewVerticalInsets = 5;\n\n\/\/ Padding between remove button and top right image corner.\nconst int kRemoveButtonPadding = 3;\n\n\/\/ Draws green-ish background for signout view with\n\/\/ rounded corners at the bottom.\nclass SignoutBackgroundPainter : public views::Painter {\n virtual void Paint(int w, int h, gfx::Canvas* canvas) {\n SkRect rect = {0, 0, w, h};\n SkPath path;\n SkScalar corners[] = {\n 0, 0,\n 0, 0,\n kSignoutBackgroundCornerRadius,\n kSignoutBackgroundCornerRadius,\n kSignoutBackgroundCornerRadius,\n kSignoutBackgroundCornerRadius,\n };\n path.addRoundRect(rect, corners);\n SkPaint paint;\n paint.setStyle(SkPaint::kFill_Style);\n paint.setFlags(SkPaint::kAntiAlias_Flag);\n paint.setColor(kSignoutBackgroundColor);\n canvas->AsCanvasSkia()->drawPath(path, paint);\n }\n};\n\n} \/\/ namespace\n\nnamespace chromeos {\n\nusing login::kBackgroundColor;\nusing login::kTextColor;\nusing login::kUserImageSize;\n\n\/\/ The view that shows the Sign out button below the user's image.\nclass SignoutView : public views::View {\n public:\n explicit SignoutView(views::LinkController* link_controller) {\n ResourceBundle& rb = ResourceBundle::GetSharedInstance();\n const gfx::Font& font = rb.GetFont(ResourceBundle::SmallFont);\n\n active_user_label_ = new views::Label(\n l10n_util::GetString(IDS_SCREEN_LOCK_ACTIVE_USER));\n active_user_label_->SetFont(font);\n active_user_label_->SetColor(kTextColor);\n\n signout_link_ = new views::Link(\n l10n_util::GetString(IDS_SCREEN_LOCK_SIGN_OUT));\n signout_link_->SetController(link_controller);\n signout_link_->SetFont(font);\n signout_link_->SetColor(kTextColor);\n signout_link_->SetFocusable(true);\n\n AddChildView(active_user_label_);\n AddChildView(signout_link_);\n\n set_background(views::Background::CreateBackgroundPainter(\n true, new SignoutBackgroundPainter()));\n }\n\n \/\/ views::View overrides.\n virtual void Layout() {\n gfx::Size label = active_user_label_->GetPreferredSize();\n gfx::Size button = signout_link_->GetPreferredSize();\n active_user_label_->SetBounds(\n kSignoutViewHorizontalInsets, (height() - label.height()) \/ 2,\n label.width(), label.height());\n signout_link_->SetBounds(\n width() - button.width() - kSignoutViewHorizontalInsets,\n (height() - button.height()) \/ 2,\n button.width(), button.height());\n }\n\n virtual gfx::Size GetPreferredSize() {\n gfx::Size label = active_user_label_->GetPreferredSize();\n gfx::Size button = signout_link_->GetPreferredSize();\n return gfx::Size(label.width() + button.width(),\n std::max(label.height(), button.height()) +\n kSignoutViewVerticalInsets * 2);\n }\n\n views::Link* signout_link() { return signout_link_; }\n\n private:\n friend class UserView;\n\n views::Label* active_user_label_;\n views::Link* signout_link_;\n\n DISALLOW_COPY_AND_ASSIGN(SignoutView);\n};\n\nclass RemoveButton : public views::TextButton {\n public:\n RemoveButton(views::ButtonListener* listener,\n const SkBitmap& icon,\n const std::wstring& text,\n const gfx::Point& top_right)\n : views::TextButton(listener, std::wstring()),\n icon_(icon),\n text_(text),\n top_right_(top_right),\n was_first_click_(false) {\n SetEnabledColor(SK_ColorWHITE);\n SetDisabledColor(SK_ColorWHITE);\n SetHighlightColor(SK_ColorWHITE);\n SetHoverColor(SK_ColorWHITE);\n SetIcon(icon_);\n UpdatePosition();\n }\n\n protected:\n \/\/ Overridden from View:\n virtual void OnMouseExited(const views::MouseEvent& event) {\n SetIcon(icon_);\n views::TextButton::SetText(std::wstring());\n ClearMaxTextSize();\n set_background(NULL);\n set_border(new views::TextButtonBorder);\n UpdatePosition();\n views::TextButton::OnMouseExited(event);\n was_first_click_ = false;\n }\n\n void NotifyClick(const views::Event& event) {\n if (!was_first_click_) {\n \/\/ On first click transform image to \"remove\" label.\n SetIcon(SkBitmap());\n views::TextButton::SetText(text_);\n\n const SkColor kStrokeColor = SK_ColorWHITE;\n const SkColor kButtonColor = 0xFFE94949;\n const int kStrokeWidth = 1;\n const int kVerticalPadding = 4;\n const int kHorizontalPadding = 8;\n const int kCornerRadius = 4;\n\n set_background(\n CreateRoundedBackground(\n kCornerRadius, kStrokeWidth, kButtonColor, kStrokeColor));\n\n set_border(\n views::Border::CreateEmptyBorder(kVerticalPadding,\n kHorizontalPadding,\n kVerticalPadding,\n kHorizontalPadding));\n\n UpdatePosition();\n was_first_click_ = true;\n } else {\n \/\/ On second click propagate to base class to fire ButtonPressed.\n views::TextButton::NotifyClick(event);\n }\n }\n\n void SetText(const std::wstring& text) {\n text_ = text;\n }\n\n private:\n \/\/ Update button position and schedule paint event for the view and parent.\n void UpdatePosition() {\n gfx::Size size = GetPreferredSize();\n gfx::Point origin = top_right_;\n origin.Offset(-size.width(), 0);\n SetBounds(gfx::Rect(origin, size));\n\n if (GetParent())\n GetParent()->SchedulePaint();\n }\n\n SkBitmap icon_;\n std::wstring text_;\n gfx::Point top_right_;\n bool was_first_click_;\n\n DISALLOW_COPY_AND_ASSIGN(RemoveButton);\n};\n\nclass PodImageView : public views::ImageView {\n public:\n PodImageView() { }\n\n void SetImage(const SkBitmap& image, const SkBitmap& image_hot) {\n image_ = image;\n image_hot_ = image_hot;\n views::ImageView::SetImage(image_);\n }\n\n protected:\n \/\/ Overridden from View:\n virtual void OnMouseEntered(const views::MouseEvent& event) {\n views::ImageView::SetImage(image_hot_);\n }\n\n virtual void OnMouseExited(const views::MouseEvent& event) {\n views::ImageView::SetImage(image_);\n }\n\n gfx::NativeCursor GetCursorForPoint(\n views::Event::EventType event_type,\n const gfx::Point& p) {\n return gfx::GetCursor(GDK_HAND2);\n }\n\n private:\n SkBitmap image_;\n SkBitmap image_hot_;\n\n DISALLOW_COPY_AND_ASSIGN(PodImageView);\n};\n\nUserView::UserView(Delegate* delegate, bool is_login, bool need_background)\n : delegate_(delegate),\n signout_view_(NULL),\n image_view_(NULL),\n remove_button_(NULL) {\n DCHECK(delegate);\n if (!is_login)\n signout_view_ = new SignoutView(this);\n\n if (need_background)\n image_view_ = new RoundedView<PodImageView>;\n else\n image_view_ = new PodImageView;\n\n Init(need_background);\n}\n\nvoid UserView::Init(bool need_background) {\n if (need_background) {\n image_view_->set_background(\n views::Background::CreateSolidBackground(kBackgroundColor));\n }\n\n \/\/ UserView's layout never changes, so let's layout once here.\n image_view_->SetBounds(0, 0, kUserImageSize, kUserImageSize);\n AddChildView(image_view_);\n\n if (signout_view_) {\n signout_view_->SetBounds(0, kUserImageSize, kUserImageSize,\n signout_view_->GetPreferredSize().height());\n AddChildView(signout_view_);\n }\n\n ResourceBundle& rb = ResourceBundle::GetSharedInstance();\n remove_button_ = new RemoveButton(\n this,\n *rb.GetBitmapNamed(IDR_CLOSE_BAR_H),\n l10n_util::GetString(IDS_LOGIN_REMOVE),\n gfx::Point(kUserImageSize - kRemoveButtonPadding, kRemoveButtonPadding));\n remove_button_->SetVisible(false);\n AddChildView(remove_button_);\n}\n\nvoid UserView::SetImage(const SkBitmap& image, const SkBitmap& image_hot) {\n int desired_size = std::min(image.width(), image.height());\n \/\/ Desired size is not preserved if it's greater than 75% of kUserImageSize.\n if (desired_size * 4 > 3 * kUserImageSize)\n desired_size = kUserImageSize;\n image_view_->SetImageSize(gfx::Size(desired_size, desired_size));\n image_view_->SetImage(image, image_hot);\n}\n\nvoid UserView::SetTooltipText(const std::wstring& text) {\n DCHECK(image_view_);\n image_view_->SetTooltipText(text);\n}\n\ngfx::Size UserView::GetPreferredSize() {\n return gfx::Size(\n kUserImageSize,\n kUserImageSize +\n (signout_view_ ? signout_view_->GetPreferredSize().height() : 0));\n}\n\nvoid UserView::SetSignoutEnabled(bool enabled) {\n DCHECK(signout_view_);\n signout_view_->signout_link_->SetEnabled(enabled);\n}\n\nvoid UserView::LinkActivated(views::Link* source, int event_flags) {\n DCHECK(delegate_);\n DCHECK(signout_view_);\n if (signout_view_->signout_link_ == source)\n delegate_->OnSignout();\n}\n\nvoid UserView::SetRemoveButtonVisible(bool flag) {\n remove_button_->SetVisible(flag);\n}\n\nvoid UserView::ButtonPressed(views::Button* sender, const views::Event& event) {\n DCHECK(delegate_);\n if (remove_button_ == sender)\n delegate_->OnRemoveUser();\n}\n\nvoid UserView::OnLocaleChanged() {\n remove_button_->SetText(l10n_util::GetString(IDS_LOGIN_REMOVE));\n}\n\n} \/\/ namespace chromeos\n<|endoftext|>"} {"text":"<commit_before>\/*************************************************************************\n *\n * $RCSfile: unourl.cxx,v $\n *\n * $Revision: 1.1 $\n *\n * last change: $Author: sb $ $Date: 2002-10-02 15:31:56 $\n *\n * The Contents of this file are made available subject to the terms of\n * either of the following licenses\n *\n * - GNU Lesser General Public License Version 2.1\n * - Sun Industry Standards Source License Version 1.1\n *\n * Sun Microsystems Inc., October, 2000\n *\n * GNU Lesser General Public License Version 2.1\n * =============================================\n * Copyright 2000 by Sun Microsystems, Inc.\n * 901 San Antonio Road, Palo Alto, CA 94303, USA\n *\n * This library is free software; you can redistribute it and\/or\n * modify it under the terms of the GNU Lesser General Public\n * License version 2.1, as published by the Free Software Foundation.\n *\n * This library is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU\n * Lesser General Public License for more details.\n *\n * You should have received a copy of the GNU Lesser General Public\n * License along with this library; if not, write to the Free Software\n * Foundation, Inc., 59 Temple Place, Suite 330, Boston,\n * MA 02111-1307 USA\n *\n *\n * Sun Industry Standards Source License Version 1.1\n * =================================================\n * The contents of this file are subject to the Sun Industry Standards\n * Source License Version 1.1 (the \"License\"); You may not use this file\n * except in compliance with the License. You may obtain a copy of the\n * License at http:\/\/www.openoffice.org\/license.html.\n *\n * Software provided under this License is provided on an \"AS IS\" basis,\n * WITHOUT WARRANTY OF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING,\n * WITHOUT LIMITATION, WARRANTIES THAT THE SOFTWARE IS FREE OF DEFECTS,\n * MERCHANTABLE, FIT FOR A PARTICULAR PURPOSE, OR NON-INFRINGING.\n * See the License for the specific provisions governing your rights and\n * obligations concerning the Software.\n *\n * The Initial Developer of the Original Code is: Sun Microsystems, Inc.\n *\n * Copyright: 2002 by Sun Microsystems, Inc.\n *\n * All Rights Reserved.\n *\n * Contributor(s): _______________________________________\n *\n *\n ************************************************************************\/\n\n#include \"cppuhelper\/unourl.hxx\"\n\n#include \"osl\/diagnose.h\"\n#include \"rtl\/malformeduriexception.hxx\"\n#include \"rtl\/string.h\"\n#include \"rtl\/textenc.h\"\n#include \"rtl\/uri.h\"\n#include \"rtl\/uri.hxx\"\n#include \"rtl\/ustring.h\"\n#include \"rtl\/ustring.hxx\"\n#include \"sal\/types.h\"\n\n#include <map>\n\nusing cppu::UnoUrl;\nusing cppu::UnoUrlDescriptor;\n\nnamespace {\n\ninline bool isAlphanum(sal_Unicode c)\n{\n return c >= 0x30 && c <= 0x39 \/\/ '0'--'9'\n || c >= 0x41 && c <= 0x5A \/\/ 'A'--'Z'\n || c >= 0x61 && c <= 0x7A; \/\/ 'a'--'z'\n}\n\n}\n\nclass UnoUrlDescriptor::Impl\n{\npublic:\n typedef std::map< rtl::OUString, rtl::OUString > Parameters;\n\n rtl::OUString m_aDescriptor;\n rtl::OUString m_aName;\n Parameters m_aParameters;\n\n \/** @exception rtl::MalformedUriException\n *\/\n explicit inline Impl(rtl::OUString const & m_aDescriptor);\n\n inline Impl * clone() const { return new Impl(*this); }\n};\n\ninline UnoUrlDescriptor::Impl::Impl(rtl::OUString const & rDescriptor)\n{\n m_aDescriptor = rDescriptor;\n enum State { STATE_NAME0, STATE_NAME, STATE_KEY0, STATE_KEY, STATE_VALUE };\n State eState = STATE_NAME0;\n sal_Int32 nStart;\n rtl::OUString aKey;\n for (sal_Int32 i = 0;; ++i)\n {\n bool bEnd = i == rDescriptor.getLength();\n sal_Unicode c = bEnd ? 0 : rDescriptor.getStr()[i];\n switch (eState)\n {\n case STATE_NAME0:\n if (bEnd || !isAlphanum(c))\n throw rtl::MalformedUriException(\n rtl::OUString(RTL_CONSTASCII_USTRINGPARAM(\n \"UNO URL contains bad descriptor name\")));\n nStart = i;\n eState = STATE_NAME;\n break;\n\n case STATE_NAME:\n if (bEnd || c == 0x2C) \/\/ ','\n {\n m_aName\n = rDescriptor.copy(nStart, i - nStart).toAsciiLowerCase();\n eState = STATE_KEY0;\n }\n else if (!isAlphanum(c))\n throw rtl::MalformedUriException(\n rtl::OUString(RTL_CONSTASCII_USTRINGPARAM(\n \"UNO URL contains bad descriptor name\")));\n break;\n\n case STATE_KEY0:\n if (bEnd || !isAlphanum(c))\n throw rtl::MalformedUriException(\n rtl::OUString(RTL_CONSTASCII_USTRINGPARAM(\n \"UNO URL contains bad parameter key\")));\n nStart = i;\n eState = STATE_KEY;\n break;\n\n case STATE_KEY:\n if (c == 0x3D) \/\/ '='\n {\n aKey = rDescriptor.copy(nStart, i - nStart).toAsciiLowerCase();\n nStart = i + 1;\n eState = STATE_VALUE;\n }\n else if (bEnd || !isAlphanum(c))\n throw rtl::MalformedUriException(\n rtl::OUString(RTL_CONSTASCII_USTRINGPARAM(\n \"UNO URL contains bad parameter key\")));\n break;\n\n case STATE_VALUE:\n if (bEnd || c == 0x2C) \/\/ ','\n {\n if (!m_aParameters.insert(\n Parameters::value_type(\n aKey,\n rtl::Uri::decode(rDescriptor.copy(nStart,\n i - nStart),\n rtl_UriDecodeWithCharset,\n RTL_TEXTENCODING_UTF8))).second)\n throw rtl::MalformedUriException(\n rtl::OUString(\n RTL_CONSTASCII_USTRINGPARAM(\n \"UNO URL contains duplicated parameter\")));\n eState = STATE_KEY0;\n }\n break;\n }\n if (bEnd)\n break;\n }\n}\n\nUnoUrlDescriptor::UnoUrlDescriptor(rtl::OUString const & rDescriptor):\n m_xImpl(new Impl(rDescriptor))\n{}\n\nUnoUrlDescriptor::UnoUrlDescriptor(std::auto_ptr< Impl > & rImpl):\n m_xImpl(rImpl)\n{}\n\nUnoUrlDescriptor::UnoUrlDescriptor(UnoUrlDescriptor const & rOther):\n m_xImpl(rOther.m_xImpl->clone())\n{}\n\nUnoUrlDescriptor::~UnoUrlDescriptor()\n{}\n\nUnoUrlDescriptor & UnoUrlDescriptor::operator =(UnoUrlDescriptor const & rOther)\n{\n m_xImpl.reset(rOther.m_xImpl->clone());\n return *this;\n}\n\nrtl::OUString const & UnoUrlDescriptor::getDescriptor() const\n{\n return m_xImpl->m_aDescriptor;\n}\n\nrtl::OUString const & UnoUrlDescriptor::getName() const\n{\n return m_xImpl->m_aName;\n}\n\nbool UnoUrlDescriptor::hasParameter(rtl::OUString const & rKey) const\n{\n return m_xImpl->m_aParameters.find(rKey.toAsciiLowerCase())\n != m_xImpl->m_aParameters.end();\n}\n\nrtl::OUString UnoUrlDescriptor::getParameter(rtl::OUString const & rKey) const\n{\n Impl::Parameters::const_iterator\n aIt(m_xImpl->m_aParameters.find(rKey.toAsciiLowerCase()));\n return aIt == m_xImpl->m_aParameters.end() ? rtl::OUString() : aIt->second;\n}\n\nclass UnoUrl::Impl\n{\npublic:\n UnoUrlDescriptor m_aConnection;\n UnoUrlDescriptor m_aProtocol;\n rtl::OUString m_aObjectName;\n\n inline Impl * clone() const { return new Impl(*this); }\n\n \/** @exception rtl::MalformedUriException\n *\/\n static inline Impl * create(rtl::OUString const & rUrl);\n\nprivate:\n inline Impl(std::auto_ptr< UnoUrlDescriptor::Impl > & rConnection,\n std::auto_ptr< UnoUrlDescriptor::Impl > & rProtocol,\n rtl::OUString const & rObjectName);\n};\n\ninline UnoUrl::Impl::Impl(std::auto_ptr< UnoUrlDescriptor::Impl > & rConnection,\n std::auto_ptr< UnoUrlDescriptor::Impl > & rProtocol,\n rtl::OUString const & rObjectName):\n m_aConnection(rConnection),\n m_aProtocol(rProtocol),\n m_aObjectName(rObjectName)\n{}\n\ninline UnoUrl::Impl * UnoUrl::Impl::create(rtl::OUString const & rUrl)\n{\n if (!rUrl.matchIgnoreAsciiCaseAsciiL(RTL_CONSTASCII_STRINGPARAM(\"uno:\"), 0))\n throw rtl::MalformedUriException(\n rtl::OUString(RTL_CONSTASCII_USTRINGPARAM(\n \"UNO URL does not start with \\\"uno:\\\"\")));\n sal_Int32 i = RTL_CONSTASCII_LENGTH(\"uno:\");\n sal_Int32 j = rUrl.indexOf(';', i);\n if (j < 0)\n throw rtl::MalformedUriException(\n rtl::OUString(RTL_CONSTASCII_USTRINGPARAM(\n \"UNO URL has too few semicolons\")));\n std::auto_ptr< UnoUrlDescriptor::Impl >\n xConnection(new UnoUrlDescriptor::Impl(rUrl.copy(i, j - i)));\n i = j + 1;\n j = rUrl.indexOf(0x3B, i); \/\/ ';'\n if (j < 0)\n throw rtl::MalformedUriException(\n rtl::OUString(RTL_CONSTASCII_USTRINGPARAM(\n \"UNO URL has too few semicolons\")));\n std::auto_ptr< UnoUrlDescriptor::Impl >\n xProtocol(new UnoUrlDescriptor::Impl(rUrl.copy(i, j - i)));\n i = j + 1;\n if (i == rUrl.getLength())\n throw rtl::MalformedUriException(\n rtl::OUString(RTL_CONSTASCII_USTRINGPARAM(\n \"UNO URL contains empty ObjectName\")));\n for (j = i; j < rUrl.getLength(); ++j)\n {\n sal_Unicode c = rUrl.getStr()[j];\n if (!isAlphanum(c) && c != 0x21 && c != 0x24 \/\/ '!', '$'\n && c != 0x26 && c != 0x27 && c != 0x28 \/\/ '&', ''', '('\n && c != 0x28 && c != 0x2A && c != 0x2B \/\/ ')', '*', '+'\n && c != 0x2C && c != 0x2D && c != 0x2E \/\/ ',', '-', '.'\n && c != 0x2F && c != 0x3A && c != 0x3D \/\/ '\/', ':', '='\n && c != 0x3F && c != 0x40 && c != 0x5F \/\/ '?', '@', '_'\n && c != 0x7E) \/\/ '~'\n throw rtl::MalformedUriException(\n rtl::OUString(RTL_CONSTASCII_USTRINGPARAM(\n \"UNO URL contains invalid ObjectName\")));\n }\n return new Impl(xConnection, xProtocol, rUrl.copy(i));\n}\n\nUnoUrl::UnoUrl(rtl::OUString const & rUrl): m_xImpl(Impl::create(rUrl))\n{}\n\nUnoUrl::UnoUrl(UnoUrl const & rOther): m_xImpl(rOther.m_xImpl->clone())\n{}\n\nUnoUrl::~UnoUrl()\n{}\n\nUnoUrl & UnoUrl::operator =(UnoUrl const & rOther)\n{\n m_xImpl.reset(rOther.m_xImpl->clone());\n return *this;\n}\n\nUnoUrlDescriptor const & UnoUrl::getConnection() const\n{\n return m_xImpl->m_aConnection;\n}\n\nUnoUrlDescriptor const & UnoUrl::getProtocol() const\n{\n return m_xImpl->m_aProtocol;\n}\n\nrtl::OUString const & UnoUrl::getObjectName() const\n{\n return m_xImpl->m_aObjectName;\n}\n<commit_msg>INTEGRATION: CWS ooo20031216 (1.1.76); FILE MERGED 2003\/12\/23 10:55:35 waratah 1.1.76.1: #i1858# add default to initialise a potentially unitialised variable<commit_after>\/*************************************************************************\n *\n * $RCSfile: unourl.cxx,v $\n *\n * $Revision: 1.2 $\n *\n * last change: $Author: hr $ $Date: 2004-02-04 11:55: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: 2002 by Sun Microsystems, Inc.\n *\n * All Rights Reserved.\n *\n * Contributor(s): _______________________________________\n *\n *\n ************************************************************************\/\n\n#include \"cppuhelper\/unourl.hxx\"\n\n#include \"osl\/diagnose.h\"\n#include \"rtl\/malformeduriexception.hxx\"\n#include \"rtl\/string.h\"\n#include \"rtl\/textenc.h\"\n#include \"rtl\/uri.h\"\n#include \"rtl\/uri.hxx\"\n#include \"rtl\/ustring.h\"\n#include \"rtl\/ustring.hxx\"\n#include \"sal\/types.h\"\n\n#include <map>\n\nusing cppu::UnoUrl;\nusing cppu::UnoUrlDescriptor;\n\nnamespace {\n\ninline bool isAlphanum(sal_Unicode c)\n{\n return c >= 0x30 && c <= 0x39 \/\/ '0'--'9'\n || c >= 0x41 && c <= 0x5A \/\/ 'A'--'Z'\n || c >= 0x61 && c <= 0x7A; \/\/ 'a'--'z'\n}\n\n}\n\nclass UnoUrlDescriptor::Impl\n{\npublic:\n typedef std::map< rtl::OUString, rtl::OUString > Parameters;\n\n rtl::OUString m_aDescriptor;\n rtl::OUString m_aName;\n Parameters m_aParameters;\n\n \/** @exception rtl::MalformedUriException\n *\/\n explicit inline Impl(rtl::OUString const & m_aDescriptor);\n\n inline Impl * clone() const { return new Impl(*this); }\n};\n\ninline UnoUrlDescriptor::Impl::Impl(rtl::OUString const & rDescriptor)\n{\n m_aDescriptor = rDescriptor;\n enum State { STATE_NAME0, STATE_NAME, STATE_KEY0, STATE_KEY, STATE_VALUE };\n State eState = STATE_NAME0;\n sal_Int32 nStart = 0;\n rtl::OUString aKey;\n for (sal_Int32 i = 0;; ++i)\n {\n bool bEnd = i == rDescriptor.getLength();\n sal_Unicode c = bEnd ? 0 : rDescriptor.getStr()[i];\n switch (eState)\n {\n case STATE_NAME0:\n if (bEnd || !isAlphanum(c))\n throw rtl::MalformedUriException(\n rtl::OUString(RTL_CONSTASCII_USTRINGPARAM(\n \"UNO URL contains bad descriptor name\")));\n nStart = i;\n eState = STATE_NAME;\n break;\n\n case STATE_NAME:\n if (bEnd || c == 0x2C) \/\/ ','\n {\n m_aName\n = rDescriptor.copy(nStart, i - nStart).toAsciiLowerCase();\n eState = STATE_KEY0;\n }\n else if (!isAlphanum(c))\n throw rtl::MalformedUriException(\n rtl::OUString(RTL_CONSTASCII_USTRINGPARAM(\n \"UNO URL contains bad descriptor name\")));\n break;\n\n case STATE_KEY0:\n if (bEnd || !isAlphanum(c))\n throw rtl::MalformedUriException(\n rtl::OUString(RTL_CONSTASCII_USTRINGPARAM(\n \"UNO URL contains bad parameter key\")));\n nStart = i;\n eState = STATE_KEY;\n break;\n\n case STATE_KEY:\n if (c == 0x3D) \/\/ '='\n {\n aKey = rDescriptor.copy(nStart, i - nStart).toAsciiLowerCase();\n nStart = i + 1;\n eState = STATE_VALUE;\n }\n else if (bEnd || !isAlphanum(c))\n throw rtl::MalformedUriException(\n rtl::OUString(RTL_CONSTASCII_USTRINGPARAM(\n \"UNO URL contains bad parameter key\")));\n break;\n\n case STATE_VALUE:\n if (bEnd || c == 0x2C) \/\/ ','\n {\n if (!m_aParameters.insert(\n Parameters::value_type(\n aKey,\n rtl::Uri::decode(rDescriptor.copy(nStart,\n i - nStart),\n rtl_UriDecodeWithCharset,\n RTL_TEXTENCODING_UTF8))).second)\n throw rtl::MalformedUriException(\n rtl::OUString(\n RTL_CONSTASCII_USTRINGPARAM(\n \"UNO URL contains duplicated parameter\")));\n eState = STATE_KEY0;\n }\n break;\n }\n if (bEnd)\n break;\n }\n}\n\nUnoUrlDescriptor::UnoUrlDescriptor(rtl::OUString const & rDescriptor):\n m_xImpl(new Impl(rDescriptor))\n{}\n\nUnoUrlDescriptor::UnoUrlDescriptor(std::auto_ptr< Impl > & rImpl):\n m_xImpl(rImpl)\n{}\n\nUnoUrlDescriptor::UnoUrlDescriptor(UnoUrlDescriptor const & rOther):\n m_xImpl(rOther.m_xImpl->clone())\n{}\n\nUnoUrlDescriptor::~UnoUrlDescriptor()\n{}\n\nUnoUrlDescriptor & UnoUrlDescriptor::operator =(UnoUrlDescriptor const & rOther)\n{\n m_xImpl.reset(rOther.m_xImpl->clone());\n return *this;\n}\n\nrtl::OUString const & UnoUrlDescriptor::getDescriptor() const\n{\n return m_xImpl->m_aDescriptor;\n}\n\nrtl::OUString const & UnoUrlDescriptor::getName() const\n{\n return m_xImpl->m_aName;\n}\n\nbool UnoUrlDescriptor::hasParameter(rtl::OUString const & rKey) const\n{\n return m_xImpl->m_aParameters.find(rKey.toAsciiLowerCase())\n != m_xImpl->m_aParameters.end();\n}\n\nrtl::OUString UnoUrlDescriptor::getParameter(rtl::OUString const & rKey) const\n{\n Impl::Parameters::const_iterator\n aIt(m_xImpl->m_aParameters.find(rKey.toAsciiLowerCase()));\n return aIt == m_xImpl->m_aParameters.end() ? rtl::OUString() : aIt->second;\n}\n\nclass UnoUrl::Impl\n{\npublic:\n UnoUrlDescriptor m_aConnection;\n UnoUrlDescriptor m_aProtocol;\n rtl::OUString m_aObjectName;\n\n inline Impl * clone() const { return new Impl(*this); }\n\n \/** @exception rtl::MalformedUriException\n *\/\n static inline Impl * create(rtl::OUString const & rUrl);\n\nprivate:\n inline Impl(std::auto_ptr< UnoUrlDescriptor::Impl > & rConnection,\n std::auto_ptr< UnoUrlDescriptor::Impl > & rProtocol,\n rtl::OUString const & rObjectName);\n};\n\ninline UnoUrl::Impl::Impl(std::auto_ptr< UnoUrlDescriptor::Impl > & rConnection,\n std::auto_ptr< UnoUrlDescriptor::Impl > & rProtocol,\n rtl::OUString const & rObjectName):\n m_aConnection(rConnection),\n m_aProtocol(rProtocol),\n m_aObjectName(rObjectName)\n{}\n\ninline UnoUrl::Impl * UnoUrl::Impl::create(rtl::OUString const & rUrl)\n{\n if (!rUrl.matchIgnoreAsciiCaseAsciiL(RTL_CONSTASCII_STRINGPARAM(\"uno:\"), 0))\n throw rtl::MalformedUriException(\n rtl::OUString(RTL_CONSTASCII_USTRINGPARAM(\n \"UNO URL does not start with \\\"uno:\\\"\")));\n sal_Int32 i = RTL_CONSTASCII_LENGTH(\"uno:\");\n sal_Int32 j = rUrl.indexOf(';', i);\n if (j < 0)\n throw rtl::MalformedUriException(\n rtl::OUString(RTL_CONSTASCII_USTRINGPARAM(\n \"UNO URL has too few semicolons\")));\n std::auto_ptr< UnoUrlDescriptor::Impl >\n xConnection(new UnoUrlDescriptor::Impl(rUrl.copy(i, j - i)));\n i = j + 1;\n j = rUrl.indexOf(0x3B, i); \/\/ ';'\n if (j < 0)\n throw rtl::MalformedUriException(\n rtl::OUString(RTL_CONSTASCII_USTRINGPARAM(\n \"UNO URL has too few semicolons\")));\n std::auto_ptr< UnoUrlDescriptor::Impl >\n xProtocol(new UnoUrlDescriptor::Impl(rUrl.copy(i, j - i)));\n i = j + 1;\n if (i == rUrl.getLength())\n throw rtl::MalformedUriException(\n rtl::OUString(RTL_CONSTASCII_USTRINGPARAM(\n \"UNO URL contains empty ObjectName\")));\n for (j = i; j < rUrl.getLength(); ++j)\n {\n sal_Unicode c = rUrl.getStr()[j];\n if (!isAlphanum(c) && c != 0x21 && c != 0x24 \/\/ '!', '$'\n && c != 0x26 && c != 0x27 && c != 0x28 \/\/ '&', ''', '('\n && c != 0x28 && c != 0x2A && c != 0x2B \/\/ ')', '*', '+'\n && c != 0x2C && c != 0x2D && c != 0x2E \/\/ ',', '-', '.'\n && c != 0x2F && c != 0x3A && c != 0x3D \/\/ '\/', ':', '='\n && c != 0x3F && c != 0x40 && c != 0x5F \/\/ '?', '@', '_'\n && c != 0x7E) \/\/ '~'\n throw rtl::MalformedUriException(\n rtl::OUString(RTL_CONSTASCII_USTRINGPARAM(\n \"UNO URL contains invalid ObjectName\")));\n }\n return new Impl(xConnection, xProtocol, rUrl.copy(i));\n}\n\nUnoUrl::UnoUrl(rtl::OUString const & rUrl): m_xImpl(Impl::create(rUrl))\n{}\n\nUnoUrl::UnoUrl(UnoUrl const & rOther): m_xImpl(rOther.m_xImpl->clone())\n{}\n\nUnoUrl::~UnoUrl()\n{}\n\nUnoUrl & UnoUrl::operator =(UnoUrl const & rOther)\n{\n m_xImpl.reset(rOther.m_xImpl->clone());\n return *this;\n}\n\nUnoUrlDescriptor const & UnoUrl::getConnection() const\n{\n return m_xImpl->m_aConnection;\n}\n\nUnoUrlDescriptor const & UnoUrl::getProtocol() const\n{\n return m_xImpl->m_aProtocol;\n}\n\nrtl::OUString const & UnoUrl::getObjectName() const\n{\n return m_xImpl->m_aObjectName;\n}\n<|endoftext|>"} {"text":"<commit_before>\/*\n ***********************************************************************************************************************\n *\n * Copyright (c) 2019-2021 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 all\n * copies or substantial portions of the Software.\n *\n * THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\n * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\n * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE\n * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\n * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,\n * OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE\n * SOFTWARE.\n *\n **********************************************************************************************************************\/\n\/**\n ***********************************************************************************************************************\n * @file LgcContext.cpp\n * @brief LLPC source file: implementation of llpc::LgcContext class for creating and using lgc::Builder\n ***********************************************************************************************************************\n *\/\n#include \"lgc\/LgcContext.h\"\n#include \"lgc\/Builder.h\"\n#include \"lgc\/PassManager.h\"\n#include \"lgc\/patch\/Patch.h\"\n#include \"lgc\/state\/PassManagerCache.h\"\n#include \"lgc\/state\/PipelineState.h\"\n#include \"lgc\/state\/TargetInfo.h\"\n#include \"lgc\/util\/Debug.h\"\n#include \"lgc\/util\/Internal.h\"\n#include \"llvm\/Analysis\/TargetLibraryInfo.h\"\n#include \"llvm\/Bitcode\/BitcodeWriterPass.h\"\n#include \"llvm\/CodeGen\/CommandFlags.h\"\n#include \"llvm\/CodeGen\/LinkAllCodegenComponents.h\"\n#include \"llvm\/IR\/IRPrintingPasses.h\"\n#include \"llvm\/InitializePasses.h\"\n#include \"llvm\/Support\/CodeGen.h\"\n#include \"llvm\/Support\/CommandLine.h\"\n#include \"llvm\/Support\/TargetRegistry.h\"\n#include \"llvm\/Support\/TargetSelect.h\"\n#include \"llvm\/Target\/TargetMachine.h\"\n#include \"llvm\/Target\/TargetOptions.h\"\n\n#define DEBUG_TYPE \"lgc-context\"\n\nnamespace llvm {\n\nnamespace cl {\n\n\/\/ Set the optimization level\nextern opt<CodeGenOpt::Level> OptLevel;\n\n} \/\/ namespace cl\n} \/\/ namespace llvm\n\nusing namespace lgc;\nusing namespace llvm;\n\nnamespace llvm {\nvoid initializeBuilderReplayerPass(PassRegistry &);\n} \/\/ namespace llvm\n\nstatic codegen::RegisterCodeGenFlags CGF;\n\n#ifndef NDEBUG\nstatic bool Initialized;\n#endif\n\nraw_ostream *LgcContext::m_llpcOuts;\n\n\/\/ -emit-llvm: emit LLVM assembly instead of ISA\nstatic cl::opt<bool> EmitLlvm(\"emit-llvm\", cl::desc(\"Emit LLVM assembly instead of AMD GPU ISA\"), cl::init(false));\n\n\/\/ -emit-llvm-bc: emit LLVM bitcode instead of ISA\nstatic cl::opt<bool> EmitLlvmBc(\"emit-llvm-bc\", cl::desc(\"Emit LLVM bitcode instead of AMD GPU ISA\"), cl::init(false));\n\n\/\/ -emit-lgc: emit LLVM assembly suitable for input to LGC (middle-end compiler)\nstatic cl::opt<bool> EmitLgc(\"emit-lgc\", cl::desc(\"Emit LLVM assembly suitable for input to LGC (middle-end compiler)\"),\n cl::init(false));\n\n\/\/ -show-encoding: show the instruction encoding when emitting assembler. This mirrors llvm-mc behaviour\nstatic cl::opt<bool> ShowEncoding(\"show-encoding\", cl::desc(\"Show instruction encodings\"), cl::init(false));\n\n\/\/ =====================================================================================================================\n\/\/ Set default for a command-line option, but only if command-line processing has not happened yet, or did not see\n\/\/ an occurrence of this option.\n\/\/\n\/\/ @param name : Option name\n\/\/ @param value : Default option value\nstatic void setOptionDefault(const char *name, StringRef value) {\n auto optIterator = cl::getRegisteredOptions().find(name);\n assert(optIterator != cl::getRegisteredOptions().end() && \"Failed to find option to set default\");\n cl::Option *opt = optIterator->second;\n if (opt->getNumOccurrences())\n return;\n \/\/ Setting MultiArg means that addOccurrence will not increment the option's occurrence count, so the user\n \/\/ can still specify it to override our default here.\n bool setFailed = opt->addOccurrence(0, opt->ArgStr, value, \/*MultiArg=*\/true);\n assert(!setFailed && \"Failed to set default for option\");\n ((void)setFailed);\n}\n\n\/\/ =====================================================================================================================\n\/\/ Initialize the middle-end. This must be called before the first LgcContext::Create, although you are\n\/\/ allowed to call it again after that. It must also be called before LLVM command-line processing, so\n\/\/ that you can use a pass name in an option such as -print-after. If multiple concurrent compiles are\n\/\/ possible, this should be called in a thread-safe way.\nvoid LgcContext::initialize() {\n#ifndef NDEBUG\n Initialized = true;\n#endif\n\n auto &passRegistry = *PassRegistry::getPassRegistry();\n\n \/\/ Initialize LLVM target: AMDGPU\n LLVMInitializeAMDGPUTargetInfo();\n LLVMInitializeAMDGPUTarget();\n LLVMInitializeAMDGPUTargetMC();\n LLVMInitializeAMDGPUAsmPrinter();\n LLVMInitializeAMDGPUAsmParser();\n LLVMInitializeAMDGPUDisassembler();\n\n \/\/ Initialize core LLVM passes so they can be referenced by -stop-before etc.\n initializeCore(passRegistry);\n initializeTransformUtils(passRegistry);\n initializeScalarOpts(passRegistry);\n initializeVectorization(passRegistry);\n initializeInstCombine(passRegistry);\n initializeAggressiveInstCombine(passRegistry);\n initializeIPO(passRegistry);\n initializeCodeGen(passRegistry);\n initializeShadowStackGCLoweringPass(passRegistry);\n initializeExpandReductionsPass(passRegistry);\n initializeRewriteSymbolsLegacyPassPass(passRegistry);\n\n \/\/ Initialize LGC passes so they can be referenced by -stop-before etc.\n initializeUtilPasses(passRegistry);\n initializeStatePasses(passRegistry);\n initializeBuilderReplayerPass(passRegistry);\n initializePatchPasses(passRegistry);\n\n \/\/ Initialize some command-line option defaults.\n setOptionDefault(\"filetype\", \"obj\");\n setOptionDefault(\"amdgpu-unroll-max-block-to-analyze\", \"20\");\n setOptionDefault(\"unroll-max-percent-threshold-boost\", \"1000\");\n setOptionDefault(\"unroll-allow-partial\", \"1\");\n \/\/ TODO: phi-of-ops optimization in NewGVN has some problems, we temporarily\n \/\/ disable this to avoid mis-compile, see (https:\/\/github.com\/GPUOpen-Drivers\/llpc\/issues\/1206).\n setOptionDefault(\"enable-phi-of-ops\", \"0\");\n setOptionDefault(\"simplifycfg-sink-common\", \"0\");\n setOptionDefault(\"amdgpu-vgpr-index-mode\", \"1\"); \/\/ force VGPR indexing on GFX8\n setOptionDefault(\"amdgpu-atomic-optimizations\", \"1\");\n setOptionDefault(\"use-gpu-divergence-analysis\", \"1\");\n setOptionDefault(\"structurizecfg-skip-uniform-regions\", \"1\");\n setOptionDefault(\"spec-exec-max-speculation-cost\", \"10\");\n#if !defined(LLVM_HAVE_BRANCH_AMD_GFX)\n#warning[!amd-gfx] Conditional discard transformations not supported\n#else\n setOptionDefault(\"amdgpu-conditional-discard-transformations\", \"1\");\n#endif\n}\n\n\/\/ =====================================================================================================================\n\/\/ Create the LgcContext. Returns nullptr on failure to recognize the AMDGPU target whose name is specified\n\/\/\n\/\/ @param context : LLVM context to give each Builder\n\/\/ @param gpuName : LLVM GPU name (e.g. \"gfx900\"); empty to use -mcpu option setting\n\/\/ @param palAbiVersion : PAL pipeline ABI version to compile for\nLgcContext *LgcContext::Create(LLVMContext &context, StringRef gpuName, unsigned palAbiVersion) {\n assert(Initialized && \"Must call LgcContext::Initialize before LgcContext::Create\");\n\n LgcContext *builderContext = new LgcContext(context, palAbiVersion);\n\n std::string mcpuName = codegen::getMCPU(); \/\/ -mcpu setting from llvm\/CodeGen\/CommandFlags.h\n if (gpuName == \"\")\n gpuName = mcpuName;\n\n builderContext->m_targetInfo = new TargetInfo;\n if (!builderContext->m_targetInfo->setTargetInfo(gpuName)) {\n delete builderContext;\n return nullptr;\n }\n\n \/\/ Get the LLVM target and create the target machine. This should not fail, as we determined above\n \/\/ that we support the requested target.\n const std::string triple = \"amdgcn--amdpal\";\n std::string errMsg;\n const Target *target = TargetRegistry::lookupTarget(triple, errMsg);\n \/\/ Allow no signed zeros - this enables omod modifiers (div:2, mul:2)\n TargetOptions targetOpts;\n targetOpts.NoSignedZerosFPMath = true;\n\n \/\/ Enable instruction encoding output - outputs hex in comment mirroring\n \/\/ llvm-mc behaviour\n if (ShowEncoding) {\n targetOpts.MCOptions.ShowMCEncoding = true;\n targetOpts.MCOptions.AsmVerbose = true;\n }\n\n LLPC_OUTS(\"TargetMachine optimization level = \" << cl::OptLevel << \"\\n\");\n\n builderContext->m_targetMachine =\n target->createTargetMachine(triple, gpuName, \"\", targetOpts, Optional<Reloc::Model>(), None, cl::OptLevel);\n assert(builderContext->m_targetMachine);\n return builderContext;\n}\n\n\/\/ =====================================================================================================================\n\/\/\n\/\/ @param context : LLVM context to give each Builder\n\/\/ @param palAbiVersion : PAL pipeline ABI version to compile for\nLgcContext::LgcContext(LLVMContext &context, unsigned palAbiVersion) : m_context(context) {\n}\n\n\/\/ =====================================================================================================================\nLgcContext::~LgcContext() {\n delete m_targetMachine;\n delete m_targetInfo;\n delete m_passManagerCache;\n}\n\n\/\/ =====================================================================================================================\n\/\/ Create a Pipeline object for a pipeline compile.\n\/\/ This actually creates a PipelineState, but returns the Pipeline superclass that is visible to\n\/\/ the front-end.\nPipeline *LgcContext::createPipeline() {\n return new PipelineState(this, EmitLgc);\n}\n\n\/\/ =====================================================================================================================\n\/\/ Create a Builder object. For a shader compile (pPipeline is nullptr), useBuilderRecorder is ignored\n\/\/ because it always uses BuilderRecorder.\n\/\/\n\/\/ @param pipeline : Pipeline object for pipeline compile, nullptr for shader compile\n\/\/ @param useBuilderRecorder : True to use BuilderRecorder, false to use BuilderImpl\nBuilder *LgcContext::createBuilder(Pipeline *pipeline, bool useBuilderRecorder) {\n if (!pipeline || useBuilderRecorder || EmitLgc)\n return Builder::createBuilderRecorder(this, pipeline, EmitLgc);\n return Builder::createBuilderImpl(this, pipeline);\n}\n\n\/\/ =====================================================================================================================\n\/\/ Prepare a pass manager. This manually adds a target-aware TLI pass, so middle-end optimizations do not think that\n\/\/ we have library functions.\n\/\/\n\/\/ @param [in\/out] passMgr : Pass manager\nvoid LgcContext::preparePassManager(legacy::PassManager *passMgr) {\n TargetLibraryInfoImpl targetLibInfo(getTargetMachine()->getTargetTriple());\n\n \/\/ Adjust it to allow memcpy and memset.\n \/\/ TODO: Investigate why the latter is necessary. I found that\n \/\/ test\/shaderdb\/ObjStorageBlock_TestMemCpyInt32.comp\n \/\/ got unrolled far too much, and at too late a stage for the descriptor loads to be commoned up. It might\n \/\/ be an unfortunate interaction between LoopIdiomRecognize and fat pointer laundering.\n targetLibInfo.setAvailable(LibFunc_memcpy);\n targetLibInfo.setAvailable(LibFunc_memset);\n\n auto targetLibInfoPass = new TargetLibraryInfoWrapperPass(targetLibInfo);\n passMgr->add(targetLibInfoPass);\n}\n\n\/\/ =====================================================================================================================\n\/\/ Adds target passes to pass manager, depending on \"-filetype\" and \"-emit-llvm\" options\n\/\/\n\/\/ @param [in\/out] passMgr : Pass manager to add passes to\n\/\/ @param codeGenTimer : Timer to time target passes with, nullptr if not timing\n\/\/ @param [out] outStream : Output stream\nvoid LgcContext::addTargetPasses(lgc::PassManager &passMgr, Timer *codeGenTimer, raw_pwrite_stream &outStream) {\n \/\/ Start timer for codegen passes.\n if (codeGenTimer)\n passMgr.add(createStartStopTimer(codeGenTimer, true));\n\n \/\/ Dump the module just before codegen.\n if (raw_ostream *outs = getLgcOuts()) {\n passMgr.add(\n createPrintModulePass(*outs, \"===============================================================================\\n\"\n \"\/\/ LLPC final pipeline module info\\n\"));\n }\n\n if (EmitLlvm && EmitLlvmBc)\n report_fatal_error(\"-emit-llvm conflicts with -emit-llvm-bc\");\n\n if (EmitLlvm) {\n \/\/ For -emit-llvm, add a pass to output the LLVM IR, then tell the pass manager to stop adding\n \/\/ passes. We do it this way to ensure that we still get the immutable passes from\n \/\/ TargetMachine::addPassesToEmitFile, as they can affect LLVM middle-end optimizations.\n passMgr.add(createPrintModulePass(outStream));\n passMgr.stop();\n }\n\n if (EmitLlvmBc) {\n \/\/ For -emit-llvm-bc, add a pass to output the LLVM IR, then tell the pass manager to stop adding\n \/\/ passes. We do it this way to ensure that we still get the immutable passes from\n \/\/ TargetMachine::addPassesToEmitFile, as they can affect LLVM middle-end optimizations.\n passMgr.add(createBitcodeWriterPass(outStream));\n passMgr.stop();\n }\n\n \/\/ TODO: We should probably be using InitTargetOptionsFromCodeGenFlags() here.\n \/\/ Currently we are not, and it would give an \"unused function\" warning when compiled with\n \/\/ CLANG. So we avoid the warning by referencing it here.\n (void(&codegen::InitTargetOptionsFromCodeGenFlags)); \/\/ unused\n\n if (getTargetMachine()->addPassesToEmitFile(passMgr, outStream, nullptr, codegen::getFileType()))\n report_fatal_error(\"Target machine cannot emit a file of this type\");\n\n \/\/ Stop timer for codegen passes.\n if (codeGenTimer)\n passMgr.add(createStartStopTimer(codeGenTimer, false));\n}\n\n\/\/ =====================================================================================================================\n\/\/ Get pass manager cache\nPassManagerCache *LgcContext::getPassManagerCache() {\n if (!m_passManagerCache)\n m_passManagerCache = new PassManagerCache(this);\n return m_passManagerCache;\n}\n<commit_msg>Revert \"Disable phi-of-op optimization in NewGVN\"<commit_after>\/*\n ***********************************************************************************************************************\n *\n * Copyright (c) 2019-2021 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 all\n * copies or substantial portions of the Software.\n *\n * THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\n * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\n * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE\n * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\n * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,\n * OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE\n * SOFTWARE.\n *\n **********************************************************************************************************************\/\n\/**\n ***********************************************************************************************************************\n * @file LgcContext.cpp\n * @brief LLPC source file: implementation of llpc::LgcContext class for creating and using lgc::Builder\n ***********************************************************************************************************************\n *\/\n#include \"lgc\/LgcContext.h\"\n#include \"lgc\/Builder.h\"\n#include \"lgc\/PassManager.h\"\n#include \"lgc\/patch\/Patch.h\"\n#include \"lgc\/state\/PassManagerCache.h\"\n#include \"lgc\/state\/PipelineState.h\"\n#include \"lgc\/state\/TargetInfo.h\"\n#include \"lgc\/util\/Debug.h\"\n#include \"lgc\/util\/Internal.h\"\n#include \"llvm\/Analysis\/TargetLibraryInfo.h\"\n#include \"llvm\/Bitcode\/BitcodeWriterPass.h\"\n#include \"llvm\/CodeGen\/CommandFlags.h\"\n#include \"llvm\/CodeGen\/LinkAllCodegenComponents.h\"\n#include \"llvm\/IR\/IRPrintingPasses.h\"\n#include \"llvm\/InitializePasses.h\"\n#include \"llvm\/Support\/CodeGen.h\"\n#include \"llvm\/Support\/CommandLine.h\"\n#include \"llvm\/Support\/TargetRegistry.h\"\n#include \"llvm\/Support\/TargetSelect.h\"\n#include \"llvm\/Target\/TargetMachine.h\"\n#include \"llvm\/Target\/TargetOptions.h\"\n\n#define DEBUG_TYPE \"lgc-context\"\n\nnamespace llvm {\n\nnamespace cl {\n\n\/\/ Set the optimization level\nextern opt<CodeGenOpt::Level> OptLevel;\n\n} \/\/ namespace cl\n} \/\/ namespace llvm\n\nusing namespace lgc;\nusing namespace llvm;\n\nnamespace llvm {\nvoid initializeBuilderReplayerPass(PassRegistry &);\n} \/\/ namespace llvm\n\nstatic codegen::RegisterCodeGenFlags CGF;\n\n#ifndef NDEBUG\nstatic bool Initialized;\n#endif\n\nraw_ostream *LgcContext::m_llpcOuts;\n\n\/\/ -emit-llvm: emit LLVM assembly instead of ISA\nstatic cl::opt<bool> EmitLlvm(\"emit-llvm\", cl::desc(\"Emit LLVM assembly instead of AMD GPU ISA\"), cl::init(false));\n\n\/\/ -emit-llvm-bc: emit LLVM bitcode instead of ISA\nstatic cl::opt<bool> EmitLlvmBc(\"emit-llvm-bc\", cl::desc(\"Emit LLVM bitcode instead of AMD GPU ISA\"), cl::init(false));\n\n\/\/ -emit-lgc: emit LLVM assembly suitable for input to LGC (middle-end compiler)\nstatic cl::opt<bool> EmitLgc(\"emit-lgc\", cl::desc(\"Emit LLVM assembly suitable for input to LGC (middle-end compiler)\"),\n cl::init(false));\n\n\/\/ -show-encoding: show the instruction encoding when emitting assembler. This mirrors llvm-mc behaviour\nstatic cl::opt<bool> ShowEncoding(\"show-encoding\", cl::desc(\"Show instruction encodings\"), cl::init(false));\n\n\/\/ =====================================================================================================================\n\/\/ Set default for a command-line option, but only if command-line processing has not happened yet, or did not see\n\/\/ an occurrence of this option.\n\/\/\n\/\/ @param name : Option name\n\/\/ @param value : Default option value\nstatic void setOptionDefault(const char *name, StringRef value) {\n auto optIterator = cl::getRegisteredOptions().find(name);\n assert(optIterator != cl::getRegisteredOptions().end() && \"Failed to find option to set default\");\n cl::Option *opt = optIterator->second;\n if (opt->getNumOccurrences())\n return;\n \/\/ Setting MultiArg means that addOccurrence will not increment the option's occurrence count, so the user\n \/\/ can still specify it to override our default here.\n bool setFailed = opt->addOccurrence(0, opt->ArgStr, value, \/*MultiArg=*\/true);\n assert(!setFailed && \"Failed to set default for option\");\n ((void)setFailed);\n}\n\n\/\/ =====================================================================================================================\n\/\/ Initialize the middle-end. This must be called before the first LgcContext::Create, although you are\n\/\/ allowed to call it again after that. It must also be called before LLVM command-line processing, so\n\/\/ that you can use a pass name in an option such as -print-after. If multiple concurrent compiles are\n\/\/ possible, this should be called in a thread-safe way.\nvoid LgcContext::initialize() {\n#ifndef NDEBUG\n Initialized = true;\n#endif\n\n auto &passRegistry = *PassRegistry::getPassRegistry();\n\n \/\/ Initialize LLVM target: AMDGPU\n LLVMInitializeAMDGPUTargetInfo();\n LLVMInitializeAMDGPUTarget();\n LLVMInitializeAMDGPUTargetMC();\n LLVMInitializeAMDGPUAsmPrinter();\n LLVMInitializeAMDGPUAsmParser();\n LLVMInitializeAMDGPUDisassembler();\n\n \/\/ Initialize core LLVM passes so they can be referenced by -stop-before etc.\n initializeCore(passRegistry);\n initializeTransformUtils(passRegistry);\n initializeScalarOpts(passRegistry);\n initializeVectorization(passRegistry);\n initializeInstCombine(passRegistry);\n initializeAggressiveInstCombine(passRegistry);\n initializeIPO(passRegistry);\n initializeCodeGen(passRegistry);\n initializeShadowStackGCLoweringPass(passRegistry);\n initializeExpandReductionsPass(passRegistry);\n initializeRewriteSymbolsLegacyPassPass(passRegistry);\n\n \/\/ Initialize LGC passes so they can be referenced by -stop-before etc.\n initializeUtilPasses(passRegistry);\n initializeStatePasses(passRegistry);\n initializeBuilderReplayerPass(passRegistry);\n initializePatchPasses(passRegistry);\n\n \/\/ Initialize some command-line option defaults.\n setOptionDefault(\"filetype\", \"obj\");\n setOptionDefault(\"amdgpu-unroll-max-block-to-analyze\", \"20\");\n setOptionDefault(\"unroll-max-percent-threshold-boost\", \"1000\");\n setOptionDefault(\"unroll-allow-partial\", \"1\");\n setOptionDefault(\"simplifycfg-sink-common\", \"0\");\n setOptionDefault(\"amdgpu-vgpr-index-mode\", \"1\"); \/\/ force VGPR indexing on GFX8\n setOptionDefault(\"amdgpu-atomic-optimizations\", \"1\");\n setOptionDefault(\"use-gpu-divergence-analysis\", \"1\");\n setOptionDefault(\"structurizecfg-skip-uniform-regions\", \"1\");\n setOptionDefault(\"spec-exec-max-speculation-cost\", \"10\");\n#if !defined(LLVM_HAVE_BRANCH_AMD_GFX)\n#warning[!amd-gfx] Conditional discard transformations not supported\n#else\n setOptionDefault(\"amdgpu-conditional-discard-transformations\", \"1\");\n#endif\n}\n\n\/\/ =====================================================================================================================\n\/\/ Create the LgcContext. Returns nullptr on failure to recognize the AMDGPU target whose name is specified\n\/\/\n\/\/ @param context : LLVM context to give each Builder\n\/\/ @param gpuName : LLVM GPU name (e.g. \"gfx900\"); empty to use -mcpu option setting\n\/\/ @param palAbiVersion : PAL pipeline ABI version to compile for\nLgcContext *LgcContext::Create(LLVMContext &context, StringRef gpuName, unsigned palAbiVersion) {\n assert(Initialized && \"Must call LgcContext::Initialize before LgcContext::Create\");\n\n LgcContext *builderContext = new LgcContext(context, palAbiVersion);\n\n std::string mcpuName = codegen::getMCPU(); \/\/ -mcpu setting from llvm\/CodeGen\/CommandFlags.h\n if (gpuName == \"\")\n gpuName = mcpuName;\n\n builderContext->m_targetInfo = new TargetInfo;\n if (!builderContext->m_targetInfo->setTargetInfo(gpuName)) {\n delete builderContext;\n return nullptr;\n }\n\n \/\/ Get the LLVM target and create the target machine. This should not fail, as we determined above\n \/\/ that we support the requested target.\n const std::string triple = \"amdgcn--amdpal\";\n std::string errMsg;\n const Target *target = TargetRegistry::lookupTarget(triple, errMsg);\n \/\/ Allow no signed zeros - this enables omod modifiers (div:2, mul:2)\n TargetOptions targetOpts;\n targetOpts.NoSignedZerosFPMath = true;\n\n \/\/ Enable instruction encoding output - outputs hex in comment mirroring\n \/\/ llvm-mc behaviour\n if (ShowEncoding) {\n targetOpts.MCOptions.ShowMCEncoding = true;\n targetOpts.MCOptions.AsmVerbose = true;\n }\n\n LLPC_OUTS(\"TargetMachine optimization level = \" << cl::OptLevel << \"\\n\");\n\n builderContext->m_targetMachine =\n target->createTargetMachine(triple, gpuName, \"\", targetOpts, Optional<Reloc::Model>(), None, cl::OptLevel);\n assert(builderContext->m_targetMachine);\n return builderContext;\n}\n\n\/\/ =====================================================================================================================\n\/\/\n\/\/ @param context : LLVM context to give each Builder\n\/\/ @param palAbiVersion : PAL pipeline ABI version to compile for\nLgcContext::LgcContext(LLVMContext &context, unsigned palAbiVersion) : m_context(context) {\n}\n\n\/\/ =====================================================================================================================\nLgcContext::~LgcContext() {\n delete m_targetMachine;\n delete m_targetInfo;\n delete m_passManagerCache;\n}\n\n\/\/ =====================================================================================================================\n\/\/ Create a Pipeline object for a pipeline compile.\n\/\/ This actually creates a PipelineState, but returns the Pipeline superclass that is visible to\n\/\/ the front-end.\nPipeline *LgcContext::createPipeline() {\n return new PipelineState(this, EmitLgc);\n}\n\n\/\/ =====================================================================================================================\n\/\/ Create a Builder object. For a shader compile (pPipeline is nullptr), useBuilderRecorder is ignored\n\/\/ because it always uses BuilderRecorder.\n\/\/\n\/\/ @param pipeline : Pipeline object for pipeline compile, nullptr for shader compile\n\/\/ @param useBuilderRecorder : True to use BuilderRecorder, false to use BuilderImpl\nBuilder *LgcContext::createBuilder(Pipeline *pipeline, bool useBuilderRecorder) {\n if (!pipeline || useBuilderRecorder || EmitLgc)\n return Builder::createBuilderRecorder(this, pipeline, EmitLgc);\n return Builder::createBuilderImpl(this, pipeline);\n}\n\n\/\/ =====================================================================================================================\n\/\/ Prepare a pass manager. This manually adds a target-aware TLI pass, so middle-end optimizations do not think that\n\/\/ we have library functions.\n\/\/\n\/\/ @param [in\/out] passMgr : Pass manager\nvoid LgcContext::preparePassManager(legacy::PassManager *passMgr) {\n TargetLibraryInfoImpl targetLibInfo(getTargetMachine()->getTargetTriple());\n\n \/\/ Adjust it to allow memcpy and memset.\n \/\/ TODO: Investigate why the latter is necessary. I found that\n \/\/ test\/shaderdb\/ObjStorageBlock_TestMemCpyInt32.comp\n \/\/ got unrolled far too much, and at too late a stage for the descriptor loads to be commoned up. It might\n \/\/ be an unfortunate interaction between LoopIdiomRecognize and fat pointer laundering.\n targetLibInfo.setAvailable(LibFunc_memcpy);\n targetLibInfo.setAvailable(LibFunc_memset);\n\n auto targetLibInfoPass = new TargetLibraryInfoWrapperPass(targetLibInfo);\n passMgr->add(targetLibInfoPass);\n}\n\n\/\/ =====================================================================================================================\n\/\/ Adds target passes to pass manager, depending on \"-filetype\" and \"-emit-llvm\" options\n\/\/\n\/\/ @param [in\/out] passMgr : Pass manager to add passes to\n\/\/ @param codeGenTimer : Timer to time target passes with, nullptr if not timing\n\/\/ @param [out] outStream : Output stream\nvoid LgcContext::addTargetPasses(lgc::PassManager &passMgr, Timer *codeGenTimer, raw_pwrite_stream &outStream) {\n \/\/ Start timer for codegen passes.\n if (codeGenTimer)\n passMgr.add(createStartStopTimer(codeGenTimer, true));\n\n \/\/ Dump the module just before codegen.\n if (raw_ostream *outs = getLgcOuts()) {\n passMgr.add(\n createPrintModulePass(*outs, \"===============================================================================\\n\"\n \"\/\/ LLPC final pipeline module info\\n\"));\n }\n\n if (EmitLlvm && EmitLlvmBc)\n report_fatal_error(\"-emit-llvm conflicts with -emit-llvm-bc\");\n\n if (EmitLlvm) {\n \/\/ For -emit-llvm, add a pass to output the LLVM IR, then tell the pass manager to stop adding\n \/\/ passes. We do it this way to ensure that we still get the immutable passes from\n \/\/ TargetMachine::addPassesToEmitFile, as they can affect LLVM middle-end optimizations.\n passMgr.add(createPrintModulePass(outStream));\n passMgr.stop();\n }\n\n if (EmitLlvmBc) {\n \/\/ For -emit-llvm-bc, add a pass to output the LLVM IR, then tell the pass manager to stop adding\n \/\/ passes. We do it this way to ensure that we still get the immutable passes from\n \/\/ TargetMachine::addPassesToEmitFile, as they can affect LLVM middle-end optimizations.\n passMgr.add(createBitcodeWriterPass(outStream));\n passMgr.stop();\n }\n\n \/\/ TODO: We should probably be using InitTargetOptionsFromCodeGenFlags() here.\n \/\/ Currently we are not, and it would give an \"unused function\" warning when compiled with\n \/\/ CLANG. So we avoid the warning by referencing it here.\n (void(&codegen::InitTargetOptionsFromCodeGenFlags)); \/\/ unused\n\n if (getTargetMachine()->addPassesToEmitFile(passMgr, outStream, nullptr, codegen::getFileType()))\n report_fatal_error(\"Target machine cannot emit a file of this type\");\n\n \/\/ Stop timer for codegen passes.\n if (codeGenTimer)\n passMgr.add(createStartStopTimer(codeGenTimer, false));\n}\n\n\/\/ =====================================================================================================================\n\/\/ Get pass manager cache\nPassManagerCache *LgcContext::getPassManagerCache() {\n if (!m_passManagerCache)\n m_passManagerCache = new PassManagerCache(this);\n return m_passManagerCache;\n}\n<|endoftext|>"} {"text":"<commit_before>#include \"raven_sqlite.h\"\n\n#include <cstdio>\n#include <stdarg.h>\n#include <cstring>\n\nusing std::string;\nusing std::vector;\nusing std::wstring;\n\n#ifdef _mingw_\n#include <cstring>\n#define vswprintf_s vsnwprintf\n#define vsprintf_s vsnprintf\n#pragma GCC diagnostic ignored \"-Wwrite-strings\"\n#endif\n\nnamespace raven\n{\n\tnamespace sqlite\n\t{\n\n\t\t\/**\n\n\t\tOpen database file UTF16\n\n\t\t@param[in] fname\n\n\t\t*\/\n\t\tvoid cDB::Open(const wchar_t *fname)\n\t\t{\n\t\t\tif (db)\n\t\t\t{\n\t\t\t\tmyError = \"ERROR: db already open\";\n\t\t\t\treturn;\n\t\t\t}\n\t\t\tint ret = sqlite3_open16(fname, &db);\n\t\t\tif (ret)\n\t\t\t{\n\t\t\t\tmyError = \"ERROR: failed to open db\";\n\t\t\t\treturn;\n\t\t\t}\n\t\t\tif (!db)\n\t\t\t{\n\t\t\t\tmyError = \"ERROR: failed to open db\";\n\t\t\t\treturn;\n\t\t\t}\n\t\t\tmyError = 0;\n\t\t}\n\t\t\/**\n\n\t\tOpen database file UTF8\n\n\t\t@param[in] fname\n\n\t\t*\/\n\t\tvoid cDB::Open(const char *fname)\n\t\t{\n\t\t\tif (db)\n\t\t\t{\n\t\t\t\tmyError = \"ERROR: db already open\";\n\t\t\t\treturn;\n\t\t\t}\n\t\t\tint ret = sqlite3_open(fname, &db);\n\t\t\tif (ret)\n\t\t\t{\n\t\t\t\tmyError = \"ERROR: failed to open db\";\n\t\t\t\treturn;\n\t\t\t}\n\t\t\tif (!db)\n\t\t\t{\n\t\t\t\tmyError = \"ERROR: failed to open db\";\n\t\t\t\treturn;\n\t\t\t}\n\t\t\tmyError = 0;\n\t\t}\n\n\t\tvoid cDB::Close()\n\t\t{\n\t\t\tif (db)\n\t\t\t\tsqlite3_close(db);\n\t\t\tdb = 0;\n\t\t}\n\n\t\tcDB::~cDB()\n\t\t{\n\t\t\tClose();\n\t\t}\n\n\t\tint cDB::Query(const wchar_t *f, ...)\n\t\t{\n\t\t\tif (!db)\n\t\t\t{\n\t\t\t\tmyError = \"ERROR: db not open\";\n\t\t\t\treturn -1;\n\t\t\t}\n\n\t\t\tva_list _Arglist;\n\t\t\tva_start(_Arglist, f);\n\t\t\tint r;\n\n\t\t\t\/\/ clear results\n\t\t\tmyResult.clear();\n\t\t\tmyError = 0;\n\n\t\t\t\/\/ format query\n\t\t\tr = vswprintf_s(queryformatted, 999, f, _Arglist);\n\t\t\tva_end(_Arglist);\n\t\t\tif (r < 1)\n\t\t\t{\n\t\t\t\tmyError = \"Query string too long for buffer\";\n\t\t\t\treturn -1;\n\t\t\t}\n\n\t\t\t\/\/ submit query - just one\n\t\t\tsqlite3_stmt *st = 0;\n\t\t\tint ret;\n\t\t\tvoid const *tail = 0;\n\t\t\tret = sqlite3_prepare16_v2(db, queryformatted, -1, &st, &tail);\n\t\t\tif (ret != SQLITE_OK)\n\t\t\t{\n\t\t\t\t\/\/ error in query - provide human readable msg\n\t\t\t\tint nErrMsg = 1 + (int)strlen(sqlite3_errmsg(db));\n\t\t\t\tmyError = (char *)sqlite3_malloc(nErrMsg);\n\t\t\t\tif (myError)\n\t\t\t\t{\n\t\t\t\t\tmemcpy((void *)myError, sqlite3_errmsg(db), nErrMsg);\n\t\t\t\t}\n\t\t\t\telse\n\t\t\t\t{\n\t\t\t\t\tmyError = \"out of memory\";\n\t\t\t\t}\n\t\t\t\treturn -1;\n\t\t\t}\n\n\t\t\tif (sqlite3_step(st) != SQLITE_ROW)\n\t\t\t{\n\t\t\t\t\/\/ no data returned, so finalize\n\t\t\t\tsqlite3_finalize(st);\n\t\t\t\treturn 0;\n\t\t\t}\n\n\t\t\t\/\/ check for some results\n\t\t\tif (!st)\n\t\t\t\treturn 0;\n\t\t\tmyColCount = sqlite3_column_count(st);\n\t\t\tif (!myColCount)\n\t\t\t{\n\t\t\t\treturn 0;\n\t\t\t}\n\n\t\t\tint row_count = 0;\n\t\t\t\/\/ loop over rows returned\n\t\t\tdo\n\t\t\t{\n\t\t\t\t\/\/ loop over columns\n\t\t\t\tfor (int kcol = 0; kcol < myColCount; kcol++)\n\t\t\t\t{\n\t\t\t\t\t\/\/ check for null value\n\t\t\t\t\tif (sqlite3_column_type(st, kcol) == SQLITE_NULL)\n\t\t\t\t\t\tmyResult.push_back(wstring(L\"\"));\n\t\t\t\t\telse\n\t\t\t\t\t\tmyResult.push_back(wstring((wchar_t *)sqlite3_column_text16(st, kcol)));\n\t\t\t\t}\n\t\t\t\trow_count++;\n\t\t\t} while (sqlite3_step(st) == SQLITE_ROW);\n\n\t\t\t\/\/ clean up\n\t\t\tsqlite3_finalize(st);\n\n\t\t\treturn row_count;\n\t\t}\n\t\tint cDB::Query(const char *f, ...)\n\t\t{\n\t\t\tif (!db)\n\t\t\t{\n\t\t\t\tmyError = \"ERROR: db not open\";\n\t\t\t\treturn -1;\n\t\t\t}\n\n\t\t\tva_list _Arglist;\n\t\t\tva_start(_Arglist, f);\n\t\t\tint r;\n\n\t\t\t\/\/ clear results\n\t\t\tmyResultA.clear();\n\t\t\tmyError = 0;\n\n\t\t\t\/\/ format query\n\t\t\tr = vsprintf_s(queryformattedA, 1999, f, _Arglist);\n\t\t\tva_end(_Arglist);\n\t\t\tif (r < 1)\n\t\t\t{\n\t\t\t\tmyError = \"Query string too long for buffer\";\n\t\t\t\treturn -1;\n\t\t\t}\n\n\t\t\t\/\/ submit query - just one\n\t\t\tsqlite3_stmt *st = 0;\n\t\t\tint ret;\n\t\t\tchar const *tail = 0;\n\t\t\tret = sqlite3_prepare_v2(db, queryformattedA, -1, &st, &tail);\n\t\t\tif (ret != SQLITE_OK)\n\t\t\t{\n\t\t\t\t\/\/ error in query - provide human readable msg\n\t\t\t\tint nErrMsg = 1 + (int)strlen(sqlite3_errmsg(db));\n\t\t\t\tmyError = (char *)sqlite3_malloc(nErrMsg);\n\t\t\t\tif (myError)\n\t\t\t\t{\n\t\t\t\t\tmemcpy((void *)myError, sqlite3_errmsg(db), nErrMsg);\n\t\t\t\t}\n\t\t\t\telse\n\t\t\t\t{\n\t\t\t\t\tmyError = \"out of memory\";\n\t\t\t\t}\n\t\t\t\treturn -1;\n\t\t\t}\n\n\t\t\tif (sqlite3_step(st) != SQLITE_ROW)\n\t\t\t{\n\t\t\t\t\/\/ no data returned, so finalize\n\t\t\t\tsqlite3_finalize(st);\n\t\t\t\treturn 0;\n\t\t\t}\n\n\t\t\t\/\/ check for some results\n\t\t\tif (!st)\n\t\t\t\treturn 0;\n\t\t\tmyColCount = sqlite3_column_count(st);\n\t\t\tif (!myColCount)\n\t\t\t{\n\t\t\t\treturn 0;\n\t\t\t}\n\n\t\t\tint row_count = 0;\n\t\t\t\/\/ loop over rows returned\n\t\t\tdo\n\t\t\t{\n\t\t\t\t\/\/ loop over columns\n\t\t\t\tfor (int kcol = 0; kcol < myColCount; kcol++)\n\t\t\t\t{\n\t\t\t\t\t\/\/ check for null value\n\t\t\t\t\tif (sqlite3_column_type(st, kcol) == SQLITE_NULL)\n\t\t\t\t\t\tmyResultA.push_back(string(\"\"));\n\t\t\t\t\telse\n\t\t\t\t\t\tmyResultA.push_back(string((char *)sqlite3_column_text(st, kcol)));\n\t\t\t\t}\n\t\t\t\trow_count++;\n\t\t\t} while (sqlite3_step(st) == SQLITE_ROW);\n\n\t\t\t\/\/ clean up\n\t\t\tsqlite3_finalize(st);\n\n\t\t\treturn row_count;\n\t\t}\n\t\tsqlite3_stmt *cDB::Prepare(\n\t\t\tconst std::string &f)\n\t\t{\n\t\t\tstmt = 0;\n\t\t\tconst char *tail = 0;\n\t\t\tint ret = sqlite3_prepare_v2(\n\t\t\t\tdb,\n\t\t\t\tf.c_str(),\n\t\t\t\t-1,\n\t\t\t\t&stmt,\n\t\t\t\t&tail);\n\t\t\tif (ret != SQLITE_OK)\n\t\t\t{\n\t\t\t\tstmt = 0;\n\t\t\t\tdecodeError();\n\t\t\t\treturn stmt;\n\t\t\t}\n\t\t\treturn stmt;\n\t\t}\n\t\tint cDB::Bind(int index, int value)\n\t\t{\n\t\t\tif (!stmt)\n\t\t\t{\n\t\t\t\tmyError = \"no compiled statement\";\n\t\t\t\treturn -1;\n\t\t\t}\n\t\t\tif (sqlite3_bind_int(stmt, index, value))\n\t\t\t{\n\t\t\t\tdecodeError();\n\t\t\t\treturn -1;\n\t\t\t}\n\t\t\treturn 0;\n\t\t}\n\t\tint cDB::Bind(int index, double value)\n\t\t{\n\t\t\tif (!stmt)\n\t\t\t{\n\t\t\t\tmyError = \"no compiled statement\";\n\t\t\t\treturn -1;\n\t\t\t}\n\t\t\tif (sqlite3_bind_double(stmt, index, value))\n\t\t\t{\n\t\t\t\tdecodeError();\n\t\t\t\treturn -1;\n\t\t\t}\n\t\t\treturn 0;\n\t\t}\n\t\tint cDB::Bind(int index, void *p, int size)\n\t\t{\n\t\t\tif (!stmt)\n\t\t\t{\n\t\t\t\tmyError = \"no compiled statement\";\n\t\t\t\treturn -1;\n\t\t\t}\n\t\t\tif (sqlite3_bind_blob(stmt, index, p, size, SQLITE_STATIC))\n\t\t\t{\n\t\t\t\tdecodeError();\n\t\t\t\treturn -1;\n\t\t\t}\n\t\t\treturn 0;\n\t\t}\n\t\tint cDB::Bind(int index, const std::string &str)\n\t\t{\n\t\t\tif (!stmt)\n\t\t\t{\n\t\t\t\tmyError = \"no compiled statement\";\n\t\t\t\treturn -1;\n\t\t\t}\n\t\t\tif (sqlite3_bind_text(stmt, index, str.c_str(), str.length(), SQLITE_STATIC))\n\t\t\t{\n\t\t\t\tdecodeError();\n\t\t\t\treturn -1;\n\t\t\t}\n\t\t\treturn 0;\n\t\t}\n\t\tvoid cDB::decodeError()\n\t\t{\n\t\t\tint nErrMsg = 1 + (int)strlen(sqlite3_errmsg(db));\n\t\t\tmyError = (char *)sqlite3_malloc(nErrMsg);\n\t\t\tif (myError)\n\t\t\t{\n\t\t\t\tmemcpy((void *)myError, sqlite3_errmsg(db), nErrMsg);\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\tmyError = \"out of memory\";\n\t\t\t}\n\t\t}\n\t}\n}\n<commit_msg>Remove compiler warnings<commit_after>#include \"raven_sqlite.h\"\n\n#include <cstdio>\n#include <stdarg.h>\n#include <cstring>\n\nusing std::string;\nusing std::vector;\nusing std::wstring;\n\n#ifdef _mingw_\n#include <cstring>\n#define vswprintf_s vsnwprintf\n#define vsprintf_s vsnprintf\n#pragma GCC diagnostic ignored \"-Wwrite-strings\"\n#endif\n\nnamespace raven\n{\n\tnamespace sqlite\n\t{\n\n\t\t\/**\n\n\t\tOpen database file UTF16\n\n\t\t@param[in] fname\n\n\t\t*\/\n\t\tvoid cDB::Open(const wchar_t *fname)\n\t\t{\n\t\t\tif (db)\n\t\t\t{\n\t\t\t\tmyError = (char*)\"ERROR: db already open\";\n\t\t\t\treturn;\n\t\t\t}\n\t\t\tint ret = sqlite3_open16(fname, &db);\n\t\t\tif (ret)\n\t\t\t{\n\t\t\t\tmyError = (char*)\"ERROR: failed to open db\";\n\t\t\t\treturn;\n\t\t\t}\n\t\t\tif (!db)\n\t\t\t{\n\t\t\t\tmyError = (char*)\"ERROR: failed to open db\";\n\t\t\t\treturn;\n\t\t\t}\n\t\t\tmyError = 0;\n\t\t}\n\t\t\/**\n\n\t\tOpen database file UTF8\n\n\t\t@param[in] fname\n\n\t\t*\/\n\t\tvoid cDB::Open(const char *fname)\n\t\t{\n\t\t\tif (db)\n\t\t\t{\n\t\t\t\tmyError = (char*)\"ERROR: db already open\";\n\t\t\t\treturn;\n\t\t\t}\n\t\t\tint ret = sqlite3_open(fname, &db);\n\t\t\tif (ret)\n\t\t\t{\n\t\t\t\tmyError = (char*)\"ERROR: failed to open db\";\n\t\t\t\treturn;\n\t\t\t}\n\t\t\tif (!db)\n\t\t\t{\n\t\t\t\tmyError = (char*)\"ERROR: failed to open db\";\n\t\t\t\treturn;\n\t\t\t}\n\t\t\tmyError = 0;\n\t\t}\n\n\t\tvoid cDB::Close()\n\t\t{\n\t\t\tif (db)\n\t\t\t\tsqlite3_close(db);\n\t\t\tdb = 0;\n\t\t}\n\n\t\tcDB::~cDB()\n\t\t{\n\t\t\tClose();\n\t\t}\n\n\t\tint cDB::Query(const wchar_t *f, ...)\n\t\t{\n\t\t\tif (!db)\n\t\t\t{\n\t\t\t\tmyError = (char*)\"ERROR: db not open\";\n\t\t\t\treturn -1;\n\t\t\t}\n\n\t\t\tva_list _Arglist;\n\t\t\tva_start(_Arglist, f);\n\t\t\tint r;\n\n\t\t\t\/\/ clear results\n\t\t\tmyResult.clear();\n\t\t\tmyError = 0;\n\n\t\t\t\/\/ format query\n\t\t\tr = vswprintf_s(queryformatted, 999, f, _Arglist);\n\t\t\tva_end(_Arglist);\n\t\t\tif (r < 1)\n\t\t\t{\n\t\t\t\tmyError = (char*)\"Query string too long for buffer\";\n\t\t\t\treturn -1;\n\t\t\t}\n\n\t\t\t\/\/ submit query - just one\n\t\t\tsqlite3_stmt *st = 0;\n\t\t\tint ret;\n\t\t\tvoid const *tail = 0;\n\t\t\tret = sqlite3_prepare16_v2(db, queryformatted, -1, &st, &tail);\n\t\t\tif (ret != SQLITE_OK)\n\t\t\t{\n\t\t\t\t\/\/ error in query - provide human readable msg\n\t\t\t\tint nErrMsg = 1 + (int)strlen(sqlite3_errmsg(db));\n\t\t\t\tmyError = (char *)sqlite3_malloc(nErrMsg);\n\t\t\t\tif (myError)\n\t\t\t\t{\n\t\t\t\t\tmemcpy((void *)myError, sqlite3_errmsg(db), nErrMsg);\n\t\t\t\t}\n\t\t\t\telse\n\t\t\t\t{\n\t\t\t\t\tmyError = (char*)\"out of memory\";\n\t\t\t\t}\n\t\t\t\treturn -1;\n\t\t\t}\n\n\t\t\tif (sqlite3_step(st) != SQLITE_ROW)\n\t\t\t{\n\t\t\t\t\/\/ no data returned, so finalize\n\t\t\t\tsqlite3_finalize(st);\n\t\t\t\treturn 0;\n\t\t\t}\n\n\t\t\t\/\/ check for some results\n\t\t\tif (!st)\n\t\t\t\treturn 0;\n\t\t\tmyColCount = sqlite3_column_count(st);\n\t\t\tif (!myColCount)\n\t\t\t{\n\t\t\t\treturn 0;\n\t\t\t}\n\n\t\t\tint row_count = 0;\n\t\t\t\/\/ loop over rows returned\n\t\t\tdo\n\t\t\t{\n\t\t\t\t\/\/ loop over columns\n\t\t\t\tfor (int kcol = 0; kcol < myColCount; kcol++)\n\t\t\t\t{\n\t\t\t\t\t\/\/ check for null value\n\t\t\t\t\tif (sqlite3_column_type(st, kcol) == SQLITE_NULL)\n\t\t\t\t\t\tmyResult.push_back(wstring(L\"\"));\n\t\t\t\t\telse\n\t\t\t\t\t\tmyResult.push_back(wstring((wchar_t *)sqlite3_column_text16(st, kcol)));\n\t\t\t\t}\n\t\t\t\trow_count++;\n\t\t\t} while (sqlite3_step(st) == SQLITE_ROW);\n\n\t\t\t\/\/ clean up\n\t\t\tsqlite3_finalize(st);\n\n\t\t\treturn row_count;\n\t\t}\n\t\tint cDB::Query(const char *f, ...)\n\t\t{\n\t\t\tif (!db)\n\t\t\t{\n\t\t\t\tmyError = (char*)\"ERROR: db not open\";\n\t\t\t\treturn -1;\n\t\t\t}\n\n\t\t\tva_list _Arglist;\n\t\t\tva_start(_Arglist, f);\n\t\t\tint r;\n\n\t\t\t\/\/ clear results\n\t\t\tmyResultA.clear();\n\t\t\tmyError = 0;\n\n\t\t\t\/\/ format query\n\t\t\tr = vsprintf_s(queryformattedA, 1999, f, _Arglist);\n\t\t\tva_end(_Arglist);\n\t\t\tif (r < 1)\n\t\t\t{\n\t\t\t\tmyError = (char*)\"Query string too long for buffer\";\n\t\t\t\treturn -1;\n\t\t\t}\n\n\t\t\t\/\/ submit query - just one\n\t\t\tsqlite3_stmt *st = 0;\n\t\t\tint ret;\n\t\t\tchar const *tail = 0;\n\t\t\tret = sqlite3_prepare_v2(db, queryformattedA, -1, &st, &tail);\n\t\t\tif (ret != SQLITE_OK)\n\t\t\t{\n\t\t\t\t\/\/ error in query - provide human readable msg\n\t\t\t\tint nErrMsg = 1 + (int)strlen(sqlite3_errmsg(db));\n\t\t\t\tmyError = (char *)sqlite3_malloc(nErrMsg);\n\t\t\t\tif (myError)\n\t\t\t\t{\n\t\t\t\t\tmemcpy((void *)myError, sqlite3_errmsg(db), nErrMsg);\n\t\t\t\t}\n\t\t\t\telse\n\t\t\t\t{\n\t\t\t\t\tmyError = (char*)\"out of memory\";\n\t\t\t\t}\n\t\t\t\treturn -1;\n\t\t\t}\n\n\t\t\tif (sqlite3_step(st) != SQLITE_ROW)\n\t\t\t{\n\t\t\t\t\/\/ no data returned, so finalize\n\t\t\t\tsqlite3_finalize(st);\n\t\t\t\treturn 0;\n\t\t\t}\n\n\t\t\t\/\/ check for some results\n\t\t\tif (!st)\n\t\t\t\treturn 0;\n\t\t\tmyColCount = sqlite3_column_count(st);\n\t\t\tif (!myColCount)\n\t\t\t{\n\t\t\t\treturn 0;\n\t\t\t}\n\n\t\t\tint row_count = 0;\n\t\t\t\/\/ loop over rows returned\n\t\t\tdo\n\t\t\t{\n\t\t\t\t\/\/ loop over columns\n\t\t\t\tfor (int kcol = 0; kcol < myColCount; kcol++)\n\t\t\t\t{\n\t\t\t\t\t\/\/ check for null value\n\t\t\t\t\tif (sqlite3_column_type(st, kcol) == SQLITE_NULL)\n\t\t\t\t\t\tmyResultA.push_back(string(\"\"));\n\t\t\t\t\telse\n\t\t\t\t\t\tmyResultA.push_back(string((char *)sqlite3_column_text(st, kcol)));\n\t\t\t\t}\n\t\t\t\trow_count++;\n\t\t\t} while (sqlite3_step(st) == SQLITE_ROW);\n\n\t\t\t\/\/ clean up\n\t\t\tsqlite3_finalize(st);\n\n\t\t\treturn row_count;\n\t\t}\n\t\tsqlite3_stmt *cDB::Prepare(\n\t\t\tconst std::string &f)\n\t\t{\n\t\t\tstmt = 0;\n\t\t\tconst char *tail = 0;\n\t\t\tint ret = sqlite3_prepare_v2(\n\t\t\t\tdb,\n\t\t\t\tf.c_str(),\n\t\t\t\t-1,\n\t\t\t\t&stmt,\n\t\t\t\t&tail);\n\t\t\tif (ret != SQLITE_OK)\n\t\t\t{\n\t\t\t\tstmt = 0;\n\t\t\t\tdecodeError();\n\t\t\t\treturn stmt;\n\t\t\t}\n\t\t\treturn stmt;\n\t\t}\n\t\tint cDB::Bind(int index, int value)\n\t\t{\n\t\t\tif (!stmt)\n\t\t\t{\n\t\t\t\tmyError = (char*)\"no compiled statement\";\n\t\t\t\treturn -1;\n\t\t\t}\n\t\t\tif (sqlite3_bind_int(stmt, index, value))\n\t\t\t{\n\t\t\t\tdecodeError();\n\t\t\t\treturn -1;\n\t\t\t}\n\t\t\treturn 0;\n\t\t}\n\t\tint cDB::Bind(int index, double value)\n\t\t{\n\t\t\tif (!stmt)\n\t\t\t{\n\t\t\t\tmyError = (char*)\"no compiled statement\";\n\t\t\t\treturn -1;\n\t\t\t}\n\t\t\tif (sqlite3_bind_double(stmt, index, value))\n\t\t\t{\n\t\t\t\tdecodeError();\n\t\t\t\treturn -1;\n\t\t\t}\n\t\t\treturn 0;\n\t\t}\n\t\tint cDB::Bind(int index, void *p, int size)\n\t\t{\n\t\t\tif (!stmt)\n\t\t\t{\n\t\t\t\tmyError = (char*)\"no compiled statement\";\n\t\t\t\treturn -1;\n\t\t\t}\n\t\t\tif (sqlite3_bind_blob(stmt, index, p, size, SQLITE_STATIC))\n\t\t\t{\n\t\t\t\tdecodeError();\n\t\t\t\treturn -1;\n\t\t\t}\n\t\t\treturn 0;\n\t\t}\n\t\tint cDB::Bind(int index, const std::string &str)\n\t\t{\n\t\t\tif (!stmt)\n\t\t\t{\n\t\t\t\tmyError = (char*)\"no compiled statement\";\n\t\t\t\treturn -1;\n\t\t\t}\n\t\t\tif (sqlite3_bind_text(stmt, index, str.c_str(), str.length(), SQLITE_STATIC))\n\t\t\t{\n\t\t\t\tdecodeError();\n\t\t\t\treturn -1;\n\t\t\t}\n\t\t\treturn 0;\n\t\t}\n\t\tvoid cDB::decodeError()\n\t\t{\n\t\t\tint nErrMsg = 1 + (int)strlen(sqlite3_errmsg(db));\n\t\t\tmyError = (char *)sqlite3_malloc(nErrMsg);\n\t\t\tif (myError)\n\t\t\t{\n\t\t\t\tmemcpy((void *)myError, sqlite3_errmsg(db), nErrMsg);\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\tmyError = (char*)\"out of memory\";\n\t\t\t}\n\t\t}\n\t}\n}\n<|endoftext|>"} {"text":"<commit_before><?hh\nabstract class BaseStore {\n protected $class;\n protected $db;\n\n public function __construct(string $collection = null, string $class = null) {\n if (defined('static::COLLECTION') && defined('static::MODEL')) {\n $collection = static::COLLECTION;\n $class = static::MODEL;\n }\n\n invariant($collection && $class, 'Collection or class not provided');\n\n $this->collection = $collection;\n $this->class = $class;\n $this->db = MongoInstance::get($collection);\n }\n\n public function db() {\n return $this->db;\n }\n\n public function find(\n array $query = [],\n ?int $skip = 0,\n ?int $limit = 0): BaseModel {\n $docs = $this->db->find($query);\n $class = $this->class;\n\n if ($skip !== null) {\n $docs = $docs->skip($skip);\n }\n\n if ($limit !== null) {\n $limit = $docs->limit($limit);\n }\n\n foreach ($docs as $doc) {\n yield new $class($doc);\n }\n }\n\n public function distinct(string $key, array $query = []) {\n $docs = $this->db->distinct($key, $query);\n return !is_array($docs) ? [] : $docs;\n }\n\n public function findOne(array $query): ?BaseModel {\n $doc = $this->db->findOne($query);\n $class = $this->class;\n return $doc ? new $class($doc) : null;\n }\n\n public function findById(MongoId $id): ?BaseModel {\n return $this->findOne(['_id' => $id]);\n }\n\n public function count(array $query): int {\n return $this->db->count($query);\n }\n\n protected function ensureType(BaseModel $item): bool {\n return class_exists($this->class) && is_a($item, $this->class);\n }\n\n public function remove(BaseModel $item) {\n if (!$this->ensureType($item)) {\n throw new Exception('Invalid object provided, expected ' . $this->class);\n return false;\n }\n\n if ($item == null) {\n return false;\n }\n\n try {\n if ($item->getID()) {\n $this->db->remove($item->document());\n return true;\n } else {\n return false;\n }\n } catch (MongoException $e) {\n l('MongoException:', $e->getMessage());\n return false;\n }\n }\n\n public function removeWhere($query = []) {\n try {\n $this->db->remove($query);\n return true;\n } catch (MongoException $e) {\n l('MongoException:', $e->getMessage());\n return false;\n }\n }\n\n public function removeById($id) {\n return $this->removeWhere(['_id' => mid($id)]);\n }\n\n public function aggregate(BaseAggregation $aggregation) {\n return call_user_func_array(\n [$this->db, 'aggregate'],\n $aggregation->getPipeline());\n }\n\n public function mapReduce(\n MongoCode $map,\n MongoCode $reduce,\n array $query = null,\n array $config = null) {\n\n $options = [\n 'mapreduce' => $this->collection,\n 'map' => $map,\n 'reduce' => $reduce,\n 'out' => ['inline' => true]];\n\n if ($query) {\n $options['query'] = $query;\n }\n\n if ($config) {\n unset($options['mapreduce']);\n unset($options['map']);\n unset($options['reduce']);\n unset($options['query']);\n $options = array_merge($options, $config);\n }\n\n $res = MongoInstance::get()->command($options);\n\n if (idx($res, 'ok')) {\n return $res;\n } else {\n l('MapReduce error:', $res);\n return null;\n }\n }\n\n public function save(BaseModel &$item) {\n if (!$this->ensureType($item)) {\n throw new Exception('Invalid object provided, expected ' . $this->class);\n return false;\n }\n\n if ($item == null) {\n return false;\n }\n\n try {\n if (!$item->getID()) {\n $id = new MongoId();\n $item->setID($id);\n $document = $item->document();\n $this->db->insert($document);\n } else {\n $document = $item->document();\n $this->db->save($document);\n }\n return true;\n } catch (MongoException $e) {\n l('MongoException:', $e->getMessage());\n return false;\n }\n return true;\n }\n}\n\nclass BaseStoreCursor {\n protected\n $class,\n $count,\n $cursor,\n $next;\n\n public function __construct($class, $count, $cursor, $skip, $limit) {\n $this->class = $class;\n $this->count = $count;\n $this->cursor = $cursor;\n $this->next = $count > $limit ? $skip + 1 : null;\n }\n\n public function count() {\n return $this->count;\n }\n\n public function nextPage() {\n return $this->next;\n }\n\n public function docs() {\n $class = $this->class;\n foreach ($this->cursor as $entry) {\n yield new $class($entry);\n }\n }\n}\n\nclass BaseAggregation {\n protected $pipeline;\n public function __construct() {\n $this->pipeline = [];\n }\n\n public function getPipeline() {\n return $this->pipeline;\n }\n\n public function project(array $spec) {\n if (!empty($spec)) {\n $this->pipeline[] = ['$project' => $spec];\n }\n return $this;\n }\n\n public function match(array $spec) {\n if (!empty($spec)) {\n $this->pipeline[] = ['$match' => $spec];\n }\n return $this;\n }\n\n public function limit($limit) {\n $this->pipeline[] = ['$limit' => $limit];\n return $this;\n }\n\n public function skip($skip) {\n $this->pipeline[] = ['$skip' => $skip];\n return $this;\n }\n\n public function unwind($field) {\n $this->pipeline[] = ['$unwind' => '$' . $field];\n return $this;\n }\n\n public function group(array $spec) {\n if (!empty($spec)) {\n $this->pipeline[] = ['$group' => $spec];\n }\n return $this;\n }\n\n public function sort(array $spec) {\n if (!empty($spec)) {\n $this->pipeline[] = ['$sort' => $spec];\n }\n return $this;\n }\n\n public static function addToSet(string $field): array {\n return ['$addToSet' => '$' . $field];\n }\n\n public static function sum($value = 1): array {\n if (!is_numeric($value)) {\n $value = '$' . $value;\n }\n return ['$sum' => $value];\n }\n\n public function __call($name, $args) {\n $field = array_pop($args);\n switch ($name) {\n case 'addToSet':\n case 'first':\n case 'last':\n case 'max':\n case 'min':\n case 'avg':\n return ['$' . $name => '$' . $field];\n }\n\n throw new RuntimeException('Method not found: ' . $name);\n }\n\n public function push($field) {\n if (is_array($field)) {\n foreach ($field as &$f) {\n $f = '$' . $f;\n }\n } else {\n $field = '$' . $field;\n }\n\n return ['$push' => $field];\n }\n}\n\nabstract class BaseModel {\n public ?MongoId $_id;\n public function __construct(array<string, mixed> $document = []) {\n\n foreach ($document as $key => $value) {\n if (property_exists($this, $key)) {\n $this->$key = $key == '_id' ? mid($value) : $value;\n }\n }\n }\n\n public function document(): array<string, mixed> {\n return get_object_vars($this);\n }\n\n final public function getID(): ?MongoId {\n return $this->_id;\n }\n\n final public function setID(MongoId $_id): void {\n $this->_id = $_id;\n }\n\n public function __call($method, $args) {\n if (strpos($method, 'get') === 0) {\n $op = 'get';\n } elseif (strpos($method, 'set') === 0) {\n $op = 'set';\n } elseif (strpos($method, 'remove') === 0) {\n $op = 'remove';\n } elseif (strpos($method, 'has') === 0) {\n $op = 'has';\n } else {\n $e = sprintf('Method \"%s\" not found in %s', $method, get_called_class());\n throw new RuntimeException($e);\n return null;\n }\n\n \/\/ $method = preg_replace('\/^(get|set|remove|has)\/i', '', $method);\n $method = preg_replace('\/^(get|set)\/i', '', $method);\n\n preg_match_all(\n '!([A-Z][A-Z0-9]*(?=$|[A-Z][a-z0-9])|[A-Za-z][a-z0-9]+)!',\n $method,\n $matches);\n\n $ret = $matches[0];\n foreach ($ret as &$match) {\n $match = $match == strtoupper($match) ?\n strtolower($match) :\n lcfirst($match);\n }\n\n $field = implode('_', $ret);\n\n $arg = array_pop($args);\n\n switch ($op) {\n case 'set':\n $this->$field = $arg;\n return;\n\n case 'get':\n invariant(\n property_exists($this, $field),\n '%s is not a valid field for %s',\n $field,\n get_called_class());\n return $this->$field;\n }\n }\n}\n<commit_msg>BaseStore methods can now be called both as static and as instance method<commit_after><?hh\nabstract class BaseStore {\n protected $class;\n protected $db;\n\n protected static $instance;\n\n public function __construct(string $collection = null, string $class = null) {\n if (defined('static::COLLECTION') && defined('static::MODEL')) {\n $collection = static::COLLECTION;\n $class = static::MODEL;\n }\n\n invariant($collection && $class, 'Collection or class not provided');\n\n $this->collection = $collection;\n $this->class = $class;\n $this->db = MongoInstance::get($collection);\n }\n\n protected static function i() {\n if (!self::$instance) {\n self::$instance = new static();\n }\n\n return self::$instance;\n }\n\n public function db() {\n return self::i()->db;\n }\n\n public function find(\n array $query = [],\n ?int $skip = 0,\n ?int $limit = 0): BaseModel {\n $docs = self::i()->db->find($query);\n $class = self::i()->class;\n\n if ($skip !== null) {\n $docs = $docs->skip($skip);\n }\n\n if ($limit !== null) {\n $limit = $docs->limit($limit);\n }\n\n foreach ($docs as $doc) {\n yield new $class($doc);\n }\n }\n\n public function distinct(string $key, array $query = []) {\n $docs = self::i()->db->distinct($key, $query);\n return !is_array($docs) ? [] : $docs;\n }\n\n public function findOne(array $query): ?BaseModel {\n $doc = self::i()->db->findOne($query);\n $class = self::i()->class;\n return $doc ? new $class($doc) : null;\n }\n\n public function findById(MongoId $id): ?BaseModel {\n return self::i()->findOne(['_id' => $id]);\n }\n\n public function count(array $query): int {\n return self::i()->db->count($query);\n }\n\n protected function ensureType(BaseModel $item): bool {\n return class_exists(self::i()->class) && is_a($item, $this->class);\n }\n\n public function remove(BaseModel $item) {\n if (!self::i()->ensureType($item)) {\n throw new Exception(\n 'Invalid object provided, expected ' . self::i()->class);\n return false;\n }\n\n if ($item == null) {\n return false;\n }\n\n try {\n if ($item->getID()) {\n self::i()->db->remove($item->document());\n return true;\n } else {\n return false;\n }\n } catch (MongoException $e) {\n l('MongoException:', $e->getMessage());\n return false;\n }\n }\n\n public function removeWhere($query = []) {\n try {\n self::i()->db->remove($query);\n return true;\n } catch (MongoException $e) {\n l('MongoException:', $e->getMessage());\n return false;\n }\n }\n\n public function removeById($id) {\n return self::i()->removeWhere(['_id' => mid($id)]);\n }\n\n public function aggregate(BaseAggregation $aggregation) {\n return call_user_func_array(\n [self::i()->db, 'aggregate'],\n $aggregation->getPipeline());\n }\n\n public function mapReduce(\n MongoCode $map,\n MongoCode $reduce,\n array $query = null,\n array $config = null) {\n\n $options = [\n 'mapreduce' => self::i()->collection,\n 'map' => $map,\n 'reduce' => $reduce,\n 'out' => ['inline' => true]];\n\n if ($query) {\n $options['query'] = $query;\n }\n\n if ($config) {\n unset($options['mapreduce']);\n unset($options['map']);\n unset($options['reduce']);\n unset($options['query']);\n $options = array_merge($options, $config);\n }\n\n $res = MongoInstance::get()->command($options);\n\n if (idx($res, 'ok')) {\n return $res;\n } else {\n l('MapReduce error:', $res);\n return null;\n }\n }\n\n public function save(BaseModel &$item) {\n if (!self::i()->ensureType($item)) {\n throw new Exception(\n 'Invalid object provided, expected ' . self::i()->class);\n return false;\n }\n\n if ($item == null) {\n return false;\n }\n\n try {\n if (!$item->getID()) {\n $id = new MongoId();\n $item->setID($id);\n $document = $item->document();\n self::i()->db->insert($document);\n } else {\n $document = $item->document();\n self::i()->db->save($document);\n }\n return true;\n } catch (MongoException $e) {\n l('MongoException:', $e->getMessage());\n return false;\n }\n return true;\n }\n}\n\nclass BaseStoreCursor {\n protected\n $class,\n $count,\n $cursor,\n $next;\n\n public function __construct($class, $count, $cursor, $skip, $limit) {\n $this->class = $class;\n $this->count = $count;\n $this->cursor = $cursor;\n $this->next = $count > $limit ? $skip + 1 : null;\n }\n\n public function count() {\n return $this->count;\n }\n\n public function nextPage() {\n return $this->next;\n }\n\n public function docs() {\n $class = $this->class;\n foreach ($this->cursor as $entry) {\n yield new $class($entry);\n }\n }\n}\n\nclass BaseAggregation {\n protected $pipeline;\n public function __construct() {\n $this->pipeline = [];\n }\n\n public function getPipeline() {\n return $this->pipeline;\n }\n\n public function project(array $spec) {\n if (!empty($spec)) {\n $this->pipeline[] = ['$project' => $spec];\n }\n return $this;\n }\n\n public function match(array $spec) {\n if (!empty($spec)) {\n $this->pipeline[] = ['$match' => $spec];\n }\n return $this;\n }\n\n public function limit($limit) {\n $this->pipeline[] = ['$limit' => $limit];\n return $this;\n }\n\n public function skip($skip) {\n $this->pipeline[] = ['$skip' => $skip];\n return $this;\n }\n\n public function unwind($field) {\n $this->pipeline[] = ['$unwind' => '$' . $field];\n return $this;\n }\n\n public function group(array $spec) {\n if (!empty($spec)) {\n $this->pipeline[] = ['$group' => $spec];\n }\n return $this;\n }\n\n public function sort(array $spec) {\n if (!empty($spec)) {\n $this->pipeline[] = ['$sort' => $spec];\n }\n return $this;\n }\n\n public static function addToSet(string $field): array {\n return ['$addToSet' => '$' . $field];\n }\n\n public static function sum($value = 1): array {\n if (!is_numeric($value)) {\n $value = '$' . $value;\n }\n return ['$sum' => $value];\n }\n\n public function __call($name, $args) {\n $field = array_pop($args);\n switch ($name) {\n case 'addToSet':\n case 'first':\n case 'last':\n case 'max':\n case 'min':\n case 'avg':\n return ['$' . $name => '$' . $field];\n }\n\n throw new RuntimeException('Method not found: ' . $name);\n }\n\n public function push($field) {\n if (is_array($field)) {\n foreach ($field as &$f) {\n $f = '$' . $f;\n }\n } else {\n $field = '$' . $field;\n }\n\n return ['$push' => $field];\n }\n}\n\nabstract class BaseModel {\n public ?MongoId $_id;\n public function __construct(array<string, mixed> $document = []) {\n\n foreach ($document as $key => $value) {\n if (property_exists($this, $key)) {\n $this->$key = $key == '_id' ? mid($value) : $value;\n }\n }\n }\n\n public function document(): array<string, mixed> {\n return get_object_vars($this);\n }\n\n final public function getID(): ?MongoId {\n return $this->_id;\n }\n\n final public function setID(MongoId $_id): void {\n $this->_id = $_id;\n }\n\n public function __call($method, $args) {\n if (strpos($method, 'get') === 0) {\n $op = 'get';\n } elseif (strpos($method, 'set') === 0) {\n $op = 'set';\n } elseif (strpos($method, 'remove') === 0) {\n $op = 'remove';\n } elseif (strpos($method, 'has') === 0) {\n $op = 'has';\n } else {\n $e = sprintf('Method \"%s\" not found in %s', $method, get_called_class());\n throw new RuntimeException($e);\n return null;\n }\n\n \/\/ $method = preg_replace('\/^(get|set|remove|has)\/i', '', $method);\n $method = preg_replace('\/^(get|set)\/i', '', $method);\n\n preg_match_all(\n '!([A-Z][A-Z0-9]*(?=$|[A-Z][a-z0-9])|[A-Za-z][a-z0-9]+)!',\n $method,\n $matches);\n\n $ret = $matches[0];\n foreach ($ret as &$match) {\n $match = $match == strtoupper($match) ?\n strtolower($match) :\n lcfirst($match);\n }\n\n $field = implode('_', $ret);\n\n $arg = array_pop($args);\n\n switch ($op) {\n case 'set':\n $this->$field = $arg;\n return;\n\n case 'get':\n invariant(\n property_exists($this, $field),\n '%s is not a valid field for %s',\n $field,\n get_called_class());\n return $this->$field;\n }\n }\n}\n<|endoftext|>"} {"text":"<commit_before>\/\/===- lib\/ReaderWriter\/FileArchive.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 \"lld\/Core\/ArchiveLibraryFile.h\"\n#include \"lld\/Core\/LLVM.h\"\n#include \"lld\/Core\/LinkingContext.h\"\n#include \"lld\/Core\/Parallel.h\"\n#include \"llvm\/ADT\/Hashing.h\"\n#include \"llvm\/ADT\/StringRef.h\"\n#include \"llvm\/Object\/Archive.h\"\n#include \"llvm\/Object\/ObjectFile.h\"\n#include \"llvm\/Support\/Debug.h\"\n#include \"llvm\/Support\/Format.h\"\n#include \"llvm\/Support\/MemoryBuffer.h\"\n#include <memory>\n#include <mutex>\n#include <set>\n#include <unordered_map>\n\nusing llvm::object::Archive;\nusing llvm::object::ObjectFile;\nusing llvm::object::SymbolRef;\nusing llvm::object::symbol_iterator;\nusing llvm::object::object_error;\n\nnamespace lld {\n\nnamespace {\n\n\/\/\/ \\brief The FileArchive class represents an Archive Library file\nclass FileArchive : public lld::ArchiveLibraryFile {\npublic:\n FileArchive(std::unique_ptr<MemoryBuffer> mb, const Registry ®,\n StringRef path, bool logLoading)\n : ArchiveLibraryFile(path), _mb(std::shared_ptr<MemoryBuffer>(mb.release())),\n _registry(reg), _logLoading(logLoading) {}\n\n \/\/\/ \\brief Check if any member of the archive contains an Atom with the\n \/\/\/ specified name and return the File object for that member, or nullptr.\n const File *find(StringRef name, bool dataSymbolOnly) const override {\n auto member = _symbolMemberMap.find(name);\n if (member == _symbolMemberMap.end())\n return nullptr;\n Archive::child_iterator ci = member->second;\n\n \/\/ Don't return a member already returned\n const char *memberStart = ci->getBuffer().data();\n if (_membersInstantiated.count(memberStart))\n return nullptr;\n if (dataSymbolOnly && !isDataSymbol(ci, name))\n return nullptr;\n\n _membersInstantiated.insert(memberStart);\n\n \/\/ Check if a file is preloaded.\n {\n std::lock_guard<std::mutex> lock(_mutex);\n auto it = _preloaded.find(memberStart);\n if (it != _preloaded.end()) {\n std::unique_ptr<Future<const File *>> &p = it->second;\n Future<const File *> *future = p.get();\n return future->get();\n }\n }\n\n std::unique_ptr<File> result;\n if (instantiateMember(ci, result))\n return nullptr;\n\n \/\/ give up the pointer so that this object no longer manages it\n return result.release();\n }\n\n \/\/ Instantiate a member file containing a given symbol name.\n void preload(TaskGroup &group, StringRef name) override {\n auto member = _symbolMemberMap.find(name);\n if (member == _symbolMemberMap.end())\n return;\n Archive::child_iterator ci = member->second;\n\n \/\/ Do nothing if a member is already instantiated.\n const char *memberStart = ci->getBuffer().data();\n if (_membersInstantiated.count(memberStart))\n return;\n\n std::lock_guard<std::mutex> lock(_mutex);\n if (_preloaded.find(memberStart) != _preloaded.end())\n return;\n\n \/\/ Instantiate the member\n auto *future = new Future<const File *>();\n _preloaded[memberStart] = std::unique_ptr<Future<const File *>>(future);\n\n group.spawn([=] {\n std::unique_ptr<File> result;\n std::error_code ec = instantiateMember(ci, result);\n future->set(ec ? nullptr : result.release());\n });\n }\n\n \/\/\/ \\brief parse each member\n std::error_code\n parseAllMembers(std::vector<std::unique_ptr<File>> &result) override {\n if (std::error_code ec = parse())\n return ec;\n for (auto mf = _archive->child_begin(), me = _archive->child_end();\n mf != me; ++mf) {\n std::unique_ptr<File> file;\n if (std::error_code ec = instantiateMember(mf, file))\n return ec;\n result.push_back(std::move(file));\n }\n return std::error_code();\n }\n\n const atom_collection<DefinedAtom> &defined() const override {\n return _definedAtoms;\n }\n\n const atom_collection<UndefinedAtom> &undefined() const override {\n return _undefinedAtoms;\n }\n\n const atom_collection<SharedLibraryAtom> &sharedLibrary() const override {\n return _sharedLibraryAtoms;\n }\n\n const atom_collection<AbsoluteAtom> &absolute() const override {\n return _absoluteAtoms;\n }\n\n std::error_code buildTableOfContents() {\n DEBUG_WITH_TYPE(\"FileArchive\", llvm::dbgs()\n << \"Table of contents for archive '\"\n << _archive->getFileName() << \"':\\n\");\n for (auto i = _archive->symbol_begin(), e = _archive->symbol_end();\n i != e; ++i) {\n StringRef name = i->getName();\n ErrorOr<Archive::child_iterator> memberOrErr = i->getMember();\n if (std::error_code ec = memberOrErr.getError())\n return ec;\n Archive::child_iterator member = memberOrErr.get();\n DEBUG_WITH_TYPE(\n \"FileArchive\",\n llvm::dbgs() << llvm::format(\"0x%08llX \", member->getBuffer().data())\n << \"'\" << name << \"'\\n\");\n _symbolMemberMap[name] = member;\n }\n return std::error_code();\n }\n\n \/\/\/ Returns a set of all defined symbols in the archive.\n std::set<StringRef> getDefinedSymbols() override {\n parse();\n std::set<StringRef> ret;\n for (const auto &e : _symbolMemberMap)\n ret.insert(e.first);\n return ret;\n }\n\nprotected:\n std::error_code doParse() override {\n \/\/ Make Archive object which will be owned by FileArchive object.\n std::error_code ec;\n _archive.reset(new Archive(_mb->getMemBufferRef(), ec));\n if (ec)\n return ec;\n if ((ec = buildTableOfContents()))\n return ec;\n return std::error_code();\n }\n\nprivate:\n std::error_code\n instantiateMember(Archive::child_iterator member,\n std::unique_ptr<File> &result) const {\n ErrorOr<llvm::MemoryBufferRef> mbOrErr = member->getMemoryBufferRef();\n if (std::error_code ec = mbOrErr.getError())\n return ec;\n llvm::MemoryBufferRef mb = mbOrErr.get();\n std::string memberPath = (_archive->getFileName() + \"(\"\n + mb.getBufferIdentifier() + \")\").str();\n\n if (_logLoading)\n llvm::errs() << memberPath << \"\\n\";\n\n std::unique_ptr<MemoryBuffer> memberMB(MemoryBuffer::getMemBuffer(\n mb.getBuffer(), mb.getBufferIdentifier(), false));\n\n std::vector<std::unique_ptr<File>> files;\n if (std::error_code ec = _registry.loadFile(std::move(memberMB), files))\n return ec;\n assert(files.size() == 1);\n result = std::move(files[0]);\n if (std::error_code ec = result->parse())\n return ec;\n result->setArchivePath(_archive->getFileName());\n\n \/\/ The memory buffer is co-owned by the archive file and the children,\n \/\/ so that the bufffer is deallocated when all the members are destructed.\n result->setSharedMemoryBuffer(_mb);\n return std::error_code();\n }\n\n \/\/ Parses the given memory buffer as an object file, and returns true\n \/\/ code if the given symbol is a data symbol. If the symbol is not a data\n \/\/ symbol or does not exist, returns false.\n bool isDataSymbol(Archive::child_iterator member, StringRef symbol) const {\n ErrorOr<llvm::MemoryBufferRef> buf = member->getMemoryBufferRef();\n if (buf.getError())\n return false;\n std::unique_ptr<MemoryBuffer> mb(MemoryBuffer::getMemBuffer(\n buf.get().getBuffer(), buf.get().getBufferIdentifier(), false));\n\n auto objOrErr(ObjectFile::createObjectFile(mb->getMemBufferRef()));\n if (objOrErr.getError())\n return false;\n std::unique_ptr<ObjectFile> obj = std::move(objOrErr.get());\n SymbolRef::Type symtype;\n uint32_t symflags;\n symbol_iterator ibegin = obj->symbol_begin();\n symbol_iterator iend = obj->symbol_end();\n StringRef symbolname;\n\n for (symbol_iterator i = ibegin; i != iend; ++i) {\n \/\/ Get symbol name\n if (i->getName(symbolname))\n return false;\n if (symbolname != symbol)\n continue;\n\n \/\/ Get symbol flags\n symflags = i->getFlags();\n\n if (symflags <= SymbolRef::SF_Undefined)\n continue;\n\n \/\/ Get Symbol Type\n if (i->getType(symtype))\n return false;\n\n if (symtype == SymbolRef::ST_Data)\n return true;\n }\n return false;\n }\n\nprivate:\n typedef std::unordered_map<StringRef, Archive::child_iterator> MemberMap;\n typedef std::set<const char *> InstantiatedSet;\n\n std::shared_ptr<MemoryBuffer> _mb;\n const Registry &_registry;\n std::unique_ptr<Archive> _archive;\n mutable MemberMap _symbolMemberMap;\n mutable InstantiatedSet _membersInstantiated;\n atom_collection_vector<DefinedAtom> _definedAtoms;\n atom_collection_vector<UndefinedAtom> _undefinedAtoms;\n atom_collection_vector<SharedLibraryAtom> _sharedLibraryAtoms;\n atom_collection_vector<AbsoluteAtom> _absoluteAtoms;\n bool _logLoading;\n mutable std::vector<std::unique_ptr<MemoryBuffer>> _memberBuffers;\n mutable std::map<const char *, std::unique_ptr<Future<const File *>>> _preloaded;\n mutable std::mutex _mutex;\n};\n\nclass ArchiveReader : public Reader {\npublic:\n ArchiveReader(bool logLoading) : _logLoading(logLoading) {}\n\n bool canParse(file_magic magic, StringRef,\n const MemoryBuffer &) const override {\n return (magic == llvm::sys::fs::file_magic::archive);\n }\n\n std::error_code\n loadFile(std::unique_ptr<MemoryBuffer> mb, const Registry ®,\n std::vector<std::unique_ptr<File>> &result) const override {\n StringRef path = mb->getBufferIdentifier();\n std::unique_ptr<FileArchive> file(\n new FileArchive(std::move(mb), reg, path, _logLoading));\n result.push_back(std::move(file));\n return std::error_code();\n }\n\nprivate:\n bool _logLoading;\n};\n\n} \/\/ anonymous namespace\n\nvoid Registry::addSupportArchives(bool logLoading) {\n add(std::unique_ptr<Reader>(new ArchiveReader(logLoading)));\n}\n\n} \/\/ end namespace lld\n<commit_msg>Make a private function private.<commit_after>\/\/===- lib\/ReaderWriter\/FileArchive.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 \"lld\/Core\/ArchiveLibraryFile.h\"\n#include \"lld\/Core\/LLVM.h\"\n#include \"lld\/Core\/LinkingContext.h\"\n#include \"lld\/Core\/Parallel.h\"\n#include \"llvm\/ADT\/Hashing.h\"\n#include \"llvm\/ADT\/StringRef.h\"\n#include \"llvm\/Object\/Archive.h\"\n#include \"llvm\/Object\/ObjectFile.h\"\n#include \"llvm\/Support\/Debug.h\"\n#include \"llvm\/Support\/Format.h\"\n#include \"llvm\/Support\/MemoryBuffer.h\"\n#include <memory>\n#include <mutex>\n#include <set>\n#include <unordered_map>\n\nusing llvm::object::Archive;\nusing llvm::object::ObjectFile;\nusing llvm::object::SymbolRef;\nusing llvm::object::symbol_iterator;\nusing llvm::object::object_error;\n\nnamespace lld {\n\nnamespace {\n\n\/\/\/ \\brief The FileArchive class represents an Archive Library file\nclass FileArchive : public lld::ArchiveLibraryFile {\npublic:\n FileArchive(std::unique_ptr<MemoryBuffer> mb, const Registry ®,\n StringRef path, bool logLoading)\n : ArchiveLibraryFile(path), _mb(std::shared_ptr<MemoryBuffer>(mb.release())),\n _registry(reg), _logLoading(logLoading) {}\n\n \/\/\/ \\brief Check if any member of the archive contains an Atom with the\n \/\/\/ specified name and return the File object for that member, or nullptr.\n const File *find(StringRef name, bool dataSymbolOnly) const override {\n auto member = _symbolMemberMap.find(name);\n if (member == _symbolMemberMap.end())\n return nullptr;\n Archive::child_iterator ci = member->second;\n\n \/\/ Don't return a member already returned\n const char *memberStart = ci->getBuffer().data();\n if (_membersInstantiated.count(memberStart))\n return nullptr;\n if (dataSymbolOnly && !isDataSymbol(ci, name))\n return nullptr;\n\n _membersInstantiated.insert(memberStart);\n\n \/\/ Check if a file is preloaded.\n {\n std::lock_guard<std::mutex> lock(_mutex);\n auto it = _preloaded.find(memberStart);\n if (it != _preloaded.end()) {\n std::unique_ptr<Future<const File *>> &p = it->second;\n Future<const File *> *future = p.get();\n return future->get();\n }\n }\n\n std::unique_ptr<File> result;\n if (instantiateMember(ci, result))\n return nullptr;\n\n \/\/ give up the pointer so that this object no longer manages it\n return result.release();\n }\n\n \/\/ Instantiate a member file containing a given symbol name.\n void preload(TaskGroup &group, StringRef name) override {\n auto member = _symbolMemberMap.find(name);\n if (member == _symbolMemberMap.end())\n return;\n Archive::child_iterator ci = member->second;\n\n \/\/ Do nothing if a member is already instantiated.\n const char *memberStart = ci->getBuffer().data();\n if (_membersInstantiated.count(memberStart))\n return;\n\n std::lock_guard<std::mutex> lock(_mutex);\n if (_preloaded.find(memberStart) != _preloaded.end())\n return;\n\n \/\/ Instantiate the member\n auto *future = new Future<const File *>();\n _preloaded[memberStart] = std::unique_ptr<Future<const File *>>(future);\n\n group.spawn([=] {\n std::unique_ptr<File> result;\n std::error_code ec = instantiateMember(ci, result);\n future->set(ec ? nullptr : result.release());\n });\n }\n\n \/\/\/ \\brief parse each member\n std::error_code\n parseAllMembers(std::vector<std::unique_ptr<File>> &result) override {\n if (std::error_code ec = parse())\n return ec;\n for (auto mf = _archive->child_begin(), me = _archive->child_end();\n mf != me; ++mf) {\n std::unique_ptr<File> file;\n if (std::error_code ec = instantiateMember(mf, file))\n return ec;\n result.push_back(std::move(file));\n }\n return std::error_code();\n }\n\n const atom_collection<DefinedAtom> &defined() const override {\n return _definedAtoms;\n }\n\n const atom_collection<UndefinedAtom> &undefined() const override {\n return _undefinedAtoms;\n }\n\n const atom_collection<SharedLibraryAtom> &sharedLibrary() const override {\n return _sharedLibraryAtoms;\n }\n\n const atom_collection<AbsoluteAtom> &absolute() const override {\n return _absoluteAtoms;\n }\n\n \/\/\/ Returns a set of all defined symbols in the archive.\n std::set<StringRef> getDefinedSymbols() override {\n parse();\n std::set<StringRef> ret;\n for (const auto &e : _symbolMemberMap)\n ret.insert(e.first);\n return ret;\n }\n\nprotected:\n std::error_code doParse() override {\n \/\/ Make Archive object which will be owned by FileArchive object.\n std::error_code ec;\n _archive.reset(new Archive(_mb->getMemBufferRef(), ec));\n if (ec)\n return ec;\n if ((ec = buildTableOfContents()))\n return ec;\n return std::error_code();\n }\n\nprivate:\n std::error_code\n instantiateMember(Archive::child_iterator member,\n std::unique_ptr<File> &result) const {\n ErrorOr<llvm::MemoryBufferRef> mbOrErr = member->getMemoryBufferRef();\n if (std::error_code ec = mbOrErr.getError())\n return ec;\n llvm::MemoryBufferRef mb = mbOrErr.get();\n std::string memberPath = (_archive->getFileName() + \"(\"\n + mb.getBufferIdentifier() + \")\").str();\n\n if (_logLoading)\n llvm::errs() << memberPath << \"\\n\";\n\n std::unique_ptr<MemoryBuffer> memberMB(MemoryBuffer::getMemBuffer(\n mb.getBuffer(), mb.getBufferIdentifier(), false));\n\n std::vector<std::unique_ptr<File>> files;\n if (std::error_code ec = _registry.loadFile(std::move(memberMB), files))\n return ec;\n assert(files.size() == 1);\n result = std::move(files[0]);\n if (std::error_code ec = result->parse())\n return ec;\n result->setArchivePath(_archive->getFileName());\n\n \/\/ The memory buffer is co-owned by the archive file and the children,\n \/\/ so that the bufffer is deallocated when all the members are destructed.\n result->setSharedMemoryBuffer(_mb);\n return std::error_code();\n }\n\n \/\/ Parses the given memory buffer as an object file, and returns true\n \/\/ code if the given symbol is a data symbol. If the symbol is not a data\n \/\/ symbol or does not exist, returns false.\n bool isDataSymbol(Archive::child_iterator member, StringRef symbol) const {\n ErrorOr<llvm::MemoryBufferRef> buf = member->getMemoryBufferRef();\n if (buf.getError())\n return false;\n std::unique_ptr<MemoryBuffer> mb(MemoryBuffer::getMemBuffer(\n buf.get().getBuffer(), buf.get().getBufferIdentifier(), false));\n\n auto objOrErr(ObjectFile::createObjectFile(mb->getMemBufferRef()));\n if (objOrErr.getError())\n return false;\n std::unique_ptr<ObjectFile> obj = std::move(objOrErr.get());\n SymbolRef::Type symtype;\n uint32_t symflags;\n symbol_iterator ibegin = obj->symbol_begin();\n symbol_iterator iend = obj->symbol_end();\n StringRef symbolname;\n\n for (symbol_iterator i = ibegin; i != iend; ++i) {\n \/\/ Get symbol name\n if (i->getName(symbolname))\n return false;\n if (symbolname != symbol)\n continue;\n\n \/\/ Get symbol flags\n symflags = i->getFlags();\n\n if (symflags <= SymbolRef::SF_Undefined)\n continue;\n\n \/\/ Get Symbol Type\n if (i->getType(symtype))\n return false;\n\n if (symtype == SymbolRef::ST_Data)\n return true;\n }\n return false;\n }\n\n std::error_code buildTableOfContents() {\n DEBUG_WITH_TYPE(\"FileArchive\", llvm::dbgs()\n << \"Table of contents for archive '\"\n << _archive->getFileName() << \"':\\n\");\n for (auto i = _archive->symbol_begin(), e = _archive->symbol_end();\n i != e; ++i) {\n StringRef name = i->getName();\n ErrorOr<Archive::child_iterator> memberOrErr = i->getMember();\n if (std::error_code ec = memberOrErr.getError())\n return ec;\n Archive::child_iterator member = memberOrErr.get();\n DEBUG_WITH_TYPE(\n \"FileArchive\",\n llvm::dbgs() << llvm::format(\"0x%08llX \", member->getBuffer().data())\n << \"'\" << name << \"'\\n\");\n _symbolMemberMap[name] = member;\n }\n return std::error_code();\n }\n\n typedef std::unordered_map<StringRef, Archive::child_iterator> MemberMap;\n typedef std::set<const char *> InstantiatedSet;\n\n std::shared_ptr<MemoryBuffer> _mb;\n const Registry &_registry;\n std::unique_ptr<Archive> _archive;\n mutable MemberMap _symbolMemberMap;\n mutable InstantiatedSet _membersInstantiated;\n atom_collection_vector<DefinedAtom> _definedAtoms;\n atom_collection_vector<UndefinedAtom> _undefinedAtoms;\n atom_collection_vector<SharedLibraryAtom> _sharedLibraryAtoms;\n atom_collection_vector<AbsoluteAtom> _absoluteAtoms;\n bool _logLoading;\n mutable std::vector<std::unique_ptr<MemoryBuffer>> _memberBuffers;\n mutable std::map<const char *, std::unique_ptr<Future<const File *>>> _preloaded;\n mutable std::mutex _mutex;\n};\n\nclass ArchiveReader : public Reader {\npublic:\n ArchiveReader(bool logLoading) : _logLoading(logLoading) {}\n\n bool canParse(file_magic magic, StringRef,\n const MemoryBuffer &) const override {\n return (magic == llvm::sys::fs::file_magic::archive);\n }\n\n std::error_code\n loadFile(std::unique_ptr<MemoryBuffer> mb, const Registry ®,\n std::vector<std::unique_ptr<File>> &result) const override {\n StringRef path = mb->getBufferIdentifier();\n std::unique_ptr<FileArchive> file(\n new FileArchive(std::move(mb), reg, path, _logLoading));\n result.push_back(std::move(file));\n return std::error_code();\n }\n\nprivate:\n bool _logLoading;\n};\n\n} \/\/ anonymous namespace\n\nvoid Registry::addSupportArchives(bool logLoading) {\n add(std::unique_ptr<Reader>(new ArchiveReader(logLoading)));\n}\n\n} \/\/ end namespace lld\n<|endoftext|>"} {"text":"<commit_before>\/\/\n\/\/ IORemoteCommand.cpp\n\/\/ libio\n\/\/\n\/\/ Created by Sidney Just\n\/\/ Copyright (c) 2012 by Sidney Just\n\/\/ Permission is hereby granted, free of charge, to any person obtaining a copy of this software and associated \n\/\/ documentation files (the \"Software\"), to deal in the Software without restriction, including without limitation \n\/\/ the rights to use, copy, modify, merge, publish, distribute, sublicense, and\/or sell copies of the Software, \n\/\/ and to permit persons to whom the Software is furnished to do so, subject to the following conditions:\n\/\/ The above copyright notice and this permission notice shall be included in all copies or substantial portions of the Software.\n\/\/ THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR IMPLIED, \n\/\/ INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS FOR A PARTICULAR \n\/\/ PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE \n\/\/ FOR ANY CLAIM, DAMAGES OR 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 OTHER DEALINGS IN THE SOFTWARE.\n\/\/\n\n#include \"IORemoteCommand.h\"\n\n#ifdef super\n#undef super\n#endif\n#define super IOEventSource\n\nIORegisterClass(IORemoteCommand, super);\n\nIORemoteCommand *IORemoteCommand::init()\n{\n\treturn (IORemoteCommand *)super::init();\n}\n\nIORemoteCommand *IORemoteCommand::initWithAction(IOObject *owner, Action action)\n{\n\treturn (IORemoteCommand *)super::initWithAction(owner, action);\n}\n\nvoid IORemoteCommand::doWork()\n{\n\tkern_spinlock_lock(&_lock);\n\n\tif(!_waiting || _cancelled)\n\t{\n\t\tkern_spinlock_unlock(&_lock);\n\t\treturn;\n\t}\n\n\t_executing = true;\n\tkern_spinlock_unlock(&_lock);\n\n\t_action(_owner, _arg0, _arg1, _arg2, _arg3, _arg4);\n\n\tkern_spinlock_lock(&_lock);\n\t_executing = false;\n\t_executed = true;\n\t_waiting = false;\n\tkern_spinlock_unlock(&_lock);\n\n\t_caller->wakeup();\n}\n\nIOReturn IORemoteCommand::executeAction(Action action, void *arg0, void *arg1, void *arg2, void *arg3, void *arg4)\n{\n\tAction temp = _action;\n\t_action = action;\n\n\tIOReturn result = executeCommand(arg0, arg1, arg2, arg3, arg4);\n\n\t_action = temp;\n\treturn result;\n}\n\nIOReturn IORemoteCommand::executeCommand(void *arg0, void *arg1, void *arg2, void *arg3, void *arg4)\n{\n\tif(_runLoop->isOnThread())\n\t{\n\t\t_action(_owner, _arg0, _arg1, _arg2, _arg3, _arg4);\n\t\treturn kIOReturnSuccess;\n\t}\n\n\tkern_spinlock_lock(&_lock);\n\n\t_cancelled = false;\n\t_waiting = true;\n\t_caller = IOThread::currentThread();\n\n\t_arg0 = arg0;\n\t_arg1 = arg1;\n\t_arg2 = arg2;\n\t_arg3 = arg3;\n\t_arg4 = arg4;\n\n\tkern_spinlock_unlock(&_lock);\n\n\tuint64_t timeout = (_timeout > 0) ? _timeout : 10;\n\twhile(1)\n\t{\n\t\t_caller->sleep(timeout);\n\n\t\tkern_spinlock_lock(&_lock);\n\n\t\tif(_executed)\n\t\t{\n\t\t\tkern_spinlock_unlock(&_lock);\n\t\t\treturn kIOReturnSuccess;\n\t\t}\n\n\t\tif(_timeout > 0 && !_executing)\n\t\t{\n\t\t\t_cancelled = true;\n\t\t\tkern_spinlock_unlock(&_lock);\n\t\t\treturn kIOReturnTimeout;\n\t\t}\n\n\t\tkern_spinlock_unlock(&_lock);\n\t}\n}\n<commit_msg>Fixed a bug inside IORemoteCommand (should be merged with Firedrake!)<commit_after>\/\/\n\/\/ IORemoteCommand.cpp\n\/\/ libio\n\/\/\n\/\/ Created by Sidney Just\n\/\/ Copyright (c) 2012 by Sidney Just\n\/\/ Permission is hereby granted, free of charge, to any person obtaining a copy of this software and associated \n\/\/ documentation files (the \"Software\"), to deal in the Software without restriction, including without limitation \n\/\/ the rights to use, copy, modify, merge, publish, distribute, sublicense, and\/or sell copies of the Software, \n\/\/ and to permit persons to whom the Software is furnished to do so, subject to the following conditions:\n\/\/ The above copyright notice and this permission notice shall be included in all copies or substantial portions of the Software.\n\/\/ THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR IMPLIED, \n\/\/ INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS FOR A PARTICULAR \n\/\/ PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE \n\/\/ FOR ANY CLAIM, DAMAGES OR 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 OTHER DEALINGS IN THE SOFTWARE.\n\/\/\n\n#include \"IORemoteCommand.h\"\n\n#ifdef super\n#undef super\n#endif\n#define super IOEventSource\n\nIORegisterClass(IORemoteCommand, super);\n\nIORemoteCommand *IORemoteCommand::init()\n{\n\treturn (IORemoteCommand *)super::init();\n}\n\nIORemoteCommand *IORemoteCommand::initWithAction(IOObject *owner, Action action)\n{\n\treturn (IORemoteCommand *)super::initWithAction(owner, action);\n}\n\nvoid IORemoteCommand::doWork()\n{\n\tkern_spinlock_lock(&_lock);\n\n\tif(!_waiting || _cancelled)\n\t{\n\t\tkern_spinlock_unlock(&_lock);\n\t\treturn;\n\t}\n\n\t_executing = true;\n\tkern_spinlock_unlock(&_lock);\n\n\t_action(_owner, _arg0, _arg1, _arg2, _arg3, _arg4);\n\n\tkern_spinlock_lock(&_lock);\n\t_executing = false;\n\t_executed = true;\n\t_waiting = false;\n\tkern_spinlock_unlock(&_lock);\n\n\t_caller->wakeup();\n}\n\nIOReturn IORemoteCommand::executeAction(Action action, void *arg0, void *arg1, void *arg2, void *arg3, void *arg4)\n{\n\tAction temp = _action;\n\t_action = action;\n\n\tIOReturn result = executeCommand(arg0, arg1, arg2, arg3, arg4);\n\n\t_action = temp;\n\treturn result;\n}\n\nIOReturn IORemoteCommand::executeCommand(void *arg0, void *arg1, void *arg2, void *arg3, void *arg4)\n{\n\tif(_runLoop->isOnThread())\n\t{\n\t\t_action(_owner, arg0, arg1, arg2, arg3, arg4);\n\t\treturn kIOReturnSuccess;\n\t}\n\n\tkern_spinlock_lock(&_lock);\n\n\t_cancelled = false;\n\t_waiting = true;\n\t_caller = IOThread::currentThread();\n\n\t_arg0 = arg0;\n\t_arg1 = arg1;\n\t_arg2 = arg2;\n\t_arg3 = arg3;\n\t_arg4 = arg4;\n\n\tkern_spinlock_unlock(&_lock);\n\n\tuint64_t timeout = (_timeout > 0) ? _timeout : 10;\n\twhile(1)\n\t{\n\t\t_caller->sleep(timeout);\n\n\t\tkern_spinlock_lock(&_lock);\n\n\t\tif(_executed)\n\t\t{\n\t\t\tkern_spinlock_unlock(&_lock);\n\t\t\treturn kIOReturnSuccess;\n\t\t}\n\n\t\tif(_timeout > 0 && !_executing)\n\t\t{\n\t\t\t_cancelled = true;\n\t\t\tkern_spinlock_unlock(&_lock);\n\t\t\treturn kIOReturnTimeout;\n\t\t}\n\n\t\tkern_spinlock_unlock(&_lock);\n\t}\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-2011 Francois Beaune\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 \"generictilerenderer.h\"\n\n\/\/ appleseed.renderer headers.\n#include \"renderer\/kernel\/rendering\/generic\/pixelsampler.h\"\n#include \"renderer\/kernel\/rendering\/isamplerenderer.h\"\n#include \"renderer\/kernel\/shading\/shadingresult.h\"\n#include \"renderer\/modeling\/frame\/frame.h\"\n\n\/\/ appleseed.foundation headers.\n#include \"foundation\/image\/canvasproperties.h\"\n#include \"foundation\/image\/tile.h\"\n#include \"foundation\/math\/minmax.h\"\n#include \"foundation\/math\/ordering.h\"\n#include \"foundation\/math\/qmc.h\"\n#include \"foundation\/math\/scalar.h\"\n#include \"foundation\/platform\/breakpoint.h\"\n#include \"foundation\/utility\/job.h\"\n\n\/\/ Standard headers.\n#include <vector>\n\nusing namespace foundation;\nusing namespace std;\n\n\/\/ Define this symbol to break execution into the debugger\n\/\/ when a specific pixel is about to be rendered.\n\/\/ #define DEBUG_BREAK_AT_PIXEL Vector<size_t, 2>(0, 0)\n\nnamespace renderer\n{\n\nnamespace\n{\n \/\/\n \/\/ Generic tile renderer.\n \/\/\n \/\/ Reference for composition algebra with alpha channels:\n \/\/\n \/\/ http:\/\/keithp.com\/~keithp\/porterduff\/p253-porter.pdf\n \/\/\n\n class GenericTileRenderer\n : public ITileRenderer\n {\n public:\n GenericTileRenderer(\n const Frame& frame,\n ISampleRendererFactory* factory,\n const ParamArray& params)\n : m_params(params)\n , m_sample_renderer(factory->create())\n {\n \/\/ Retrieve frame properties.\n const CanvasProperties& properties = frame.properties();\n const size_t num_pixels = properties.m_tile_width * properties.m_tile_height;\n\n \/\/ Generate pixel ordering.\n vector<size_t> ordering;\n ordering.reserve(num_pixels);\n hilbert_ordering(\n ordering,\n properties.m_tile_width,\n properties.m_tile_height);\n assert(ordering.size() == num_pixels);\n\n \/\/ Convert pixel ordering to (x, y) representation.\n m_pixel_ordering.resize(num_pixels);\n for (size_t i = 0; i < num_pixels; ++i)\n {\n const size_t x = ordering[i] % properties.m_tile_width;\n const size_t y = ordering[i] \/ properties.m_tile_width;\n assert(x < properties.m_tile_width);\n assert(y < properties.m_tile_height);\n m_pixel_ordering[i].x = static_cast<uint16>(x);\n m_pixel_ordering[i].y = static_cast<uint16>(y);\n }\n\n \/\/ Compute the approximate size of one side of the subpixel grid inside a pixel.\n m_sqrt_max_samples =\n round<size_t>(sqrt(static_cast<double>(m_params.m_max_samples)));\n RENDERER_LOG_INFO(\n \"effective subpixel grid size: \" FMT_SIZE_T \"x\" FMT_SIZE_T,\n m_sqrt_max_samples,\n m_sqrt_max_samples);\n\n \/\/ Initialize the pixel sampler.\n m_pixel_sampler.initialize(m_sqrt_max_samples);\n\n m_rcp_sample_canvas_width = 1.0 \/ (properties.m_canvas_width * m_sqrt_max_samples);\n m_rcp_sample_canvas_height = 1.0 \/ (properties.m_canvas_height * m_sqrt_max_samples);\n m_rcp_sample_count = 1.0f \/ (m_sqrt_max_samples * m_sqrt_max_samples);\n }\n\n virtual void release()\n {\n delete this;\n }\n\n virtual void render_tile(\n const Frame& frame,\n const size_t tile_x,\n const size_t tile_y,\n AbortSwitch& abort_switch)\n {\n \/\/ Retrieve frame properties.\n const CanvasProperties& properties = frame.properties();\n\n assert(tile_x < properties.m_tile_count_x);\n assert(tile_y < properties.m_tile_count_y);\n\n \/\/ Access the tile.\n Tile& tile = frame.tile(tile_x, tile_y);\n const size_t tile_width = tile.get_width();\n const size_t tile_height = tile.get_height();\n const size_t tile_origin_x = properties.m_tile_width * tile_x;\n const size_t tile_origin_y = properties.m_tile_height * tile_y;\n\n \/\/ Precompute some stuff.\n const LightingConditions& lighting_conditions =\n frame.get_lighting_conditions();\n\n \/\/ Loop over tile pixels.\n const size_t num_pixels = m_pixel_ordering.size();\n for (size_t i = 0; i < num_pixels; ++i)\n {\n \/\/ Retrieve the coordinates of the pixel in the tile.\n const size_t tx = static_cast<size_t>(m_pixel_ordering[i].x);\n const size_t ty = static_cast<size_t>(m_pixel_ordering[i].y);\n\n \/\/ Skip pixels outside of the tile.\n if (tx >= tile_width || ty >= tile_height)\n continue;\n\n \/\/ Compute the coordinates of the pixel in the image.\n const size_t ix = tile_origin_x + tx;\n const size_t iy = tile_origin_y + ty;\n\n \/\/ Skip pixels outside the crop window, if cropping is enabled.\n if (m_params.m_crop)\n {\n if (static_cast<int>(ix) < m_params.m_crop_window[0] ||\n static_cast<int>(iy) < m_params.m_crop_window[1] ||\n static_cast<int>(ix) > m_params.m_crop_window[2] ||\n static_cast<int>(iy) > m_params.m_crop_window[3])\n {\n \/\/ Pixels outside the crop window are set to transparent black.\n tile.set_pixel(tx, ty, Color4f(0.0f));\n continue;\n }\n }\n\n#ifdef DEBUG_BREAK_AT_PIXEL\n\n \/\/ Break in the debugger when this pixel is reached.\n if (Vector<size_t, 2>(ix, iy) == DEBUG_BREAK_AT_PIXEL)\n BREAKPOINT();\n\n#endif\n\n \/\/ Initialize the pixel color.\n Color4f pixel_color(0.0f);\n\n if (!abort_switch.is_aborted())\n {\n \/\/ Render, filter and accumulate samples.\n const size_t base_sx = ix * m_sqrt_max_samples;\n const size_t base_sy = iy * m_sqrt_max_samples;\n for (size_t sy = 0; sy < m_sqrt_max_samples; ++sy)\n {\n for (size_t sx = 0; sx < m_sqrt_max_samples; ++sx)\n {\n \/\/ Compute the sample position in sample space and the instance number.\n Vector2d s;\n size_t instance;\n m_pixel_sampler.sample(\n base_sx + sx,\n base_sy + sy,\n s,\n instance);\n\n \/\/ Compute the sample position in NDC.\n const Vector2d sample_position =\n frame.get_sample_position(s.x, s.y);\n\n \/\/ Create a sampling context.\n SamplingContext sampling_context(\n m_rng,\n 2, \/\/ number of dimensions\n 0, \/\/ number of samples\n instance); \/\/ initial instance number\n\n \/\/ Render the sample.\n ShadingResult shading_result;\n m_sample_renderer->render_sample(\n sampling_context,\n sample_position,\n shading_result);\n\n \/\/ todo: implement proper sample filtering.\n \/\/ todo: detect invalid sample values (NaN, infinity, etc.), set\n \/\/ them to black and mark them as faulty in the diagnostic map.\n\n \/\/ Transform the sample to the linear RGB color space.\n shading_result.transform_to_linear_rgb(lighting_conditions);\n\n \/\/ Accumulate the sample.\n pixel_color[0] += shading_result.m_color[0];\n pixel_color[1] += shading_result.m_color[1];\n pixel_color[2] += shading_result.m_color[2];\n pixel_color[3] += shading_result.m_alpha[0];\n }\n }\n\n \/\/ Finish computing the pixel color.\n pixel_color *= m_rcp_sample_count;\n }\n\n \/\/ Store the pixel color into the tile.\n tile.set_pixel(tx, ty, pixel_color);\n }\n }\n\n private:\n struct Parameters\n {\n const size_t m_min_samples; \/\/ minimum number of samples per pixel\n const size_t m_max_samples; \/\/ maximum number of samples per pixel\n bool m_crop; \/\/ is cropping enabled?\n Vector4i m_crop_window; \/\/ crop window\n\n \/\/ Constructor, extract parameters.\n explicit Parameters(const ParamArray& params)\n : m_min_samples ( params.get_required<size_t>(\"min_samples\", 1) )\n , m_max_samples ( params.get_required<size_t>(\"max_samples\", 1) )\n {\n \/\/ Retrieve crop window parameter.\n m_crop = params.strings().exist(\"crop_window\");\n if (m_crop)\n {\n m_crop_window =\n params.get_required<Vector4i>(\n \"crop_window\",\n Vector4i(0, 0, 65535, 65535));\n }\n }\n };\n\n \/\/ Pixel coordinates in a tile; max tile size is 65536 x 65536 pixels.\n typedef Vector<uint16, 2> Pixel;\n\n const Parameters m_params;\n auto_release_ptr<ISampleRenderer> m_sample_renderer;\n\n vector<Pixel> m_pixel_ordering;\n PixelSampler m_pixel_sampler;\n\n size_t m_sqrt_max_samples;\n double m_rcp_sample_canvas_width;\n double m_rcp_sample_canvas_height;\n float m_rcp_sample_count;\n\n SamplingContext::RNGType m_rng;\n };\n}\n\n\n\/\/\n\/\/ GenericTileRendererFactory class implementation.\n\/\/\n\nGenericTileRendererFactory::GenericTileRendererFactory(\n const Frame& frame,\n ISampleRendererFactory* factory,\n const ParamArray& params)\n : m_frame(frame)\n , m_factory(factory) \n , m_params(params)\n{\n}\n\nvoid GenericTileRendererFactory::release()\n{\n delete this;\n}\n\nITileRenderer* GenericTileRendererFactory::create()\n{\n return\n new GenericTileRenderer(\n m_frame,\n m_factory,\n m_params);\n}\n\nITileRenderer* GenericTileRendererFactory::create(\n const Frame& frame,\n ISampleRendererFactory* factory,\n const ParamArray& params)\n{\n return\n new GenericTileRenderer(\n frame,\n factory,\n params);\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-2011 Francois Beaune\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 \"generictilerenderer.h\"\n\n\/\/ appleseed.renderer headers.\n#include \"renderer\/kernel\/rendering\/generic\/pixelsampler.h\"\n#include \"renderer\/kernel\/rendering\/isamplerenderer.h\"\n#include \"renderer\/kernel\/shading\/shadingresult.h\"\n#include \"renderer\/modeling\/frame\/frame.h\"\n\n\/\/ appleseed.foundation headers.\n#include \"foundation\/image\/canvasproperties.h\"\n#include \"foundation\/image\/tile.h\"\n#include \"foundation\/math\/minmax.h\"\n#include \"foundation\/math\/ordering.h\"\n#include \"foundation\/math\/qmc.h\"\n#include \"foundation\/math\/scalar.h\"\n#include \"foundation\/platform\/breakpoint.h\"\n#include \"foundation\/utility\/job.h\"\n\n\/\/ Standard headers.\n#include <vector>\n\nusing namespace foundation;\nusing namespace std;\n\nnamespace renderer\n{\n\nnamespace\n{\n \/\/\n \/\/ Generic tile renderer.\n \/\/\n \/\/ Reference for composition algebra with alpha channels:\n \/\/\n \/\/ http:\/\/keithp.com\/~keithp\/porterduff\/p253-porter.pdf\n \/\/\n\n \/\/ Define this symbol to break execution into the debugger\n \/\/ when a specific pixel is about to be rendered.\n \/\/ #define DEBUG_BREAK_AT_PIXEL Vector<size_t, 2>(0, 0)\n\n class GenericTileRenderer\n : public ITileRenderer\n {\n public:\n GenericTileRenderer(\n const Frame& frame,\n ISampleRendererFactory* factory,\n const ParamArray& params)\n : m_params(params)\n , m_sample_renderer(factory->create())\n {\n \/\/ Retrieve frame properties.\n const CanvasProperties& properties = frame.properties();\n const size_t num_pixels = properties.m_tile_width * properties.m_tile_height;\n\n \/\/ Generate pixel ordering.\n vector<size_t> ordering;\n ordering.reserve(num_pixels);\n hilbert_ordering(\n ordering,\n properties.m_tile_width,\n properties.m_tile_height);\n assert(ordering.size() == num_pixels);\n\n \/\/ Convert pixel ordering to (x, y) representation.\n m_pixel_ordering.resize(num_pixels);\n for (size_t i = 0; i < num_pixels; ++i)\n {\n const size_t x = ordering[i] % properties.m_tile_width;\n const size_t y = ordering[i] \/ properties.m_tile_width;\n assert(x < properties.m_tile_width);\n assert(y < properties.m_tile_height);\n m_pixel_ordering[i].x = static_cast<uint16>(x);\n m_pixel_ordering[i].y = static_cast<uint16>(y);\n }\n\n \/\/ Compute the approximate size of one side of the subpixel grid inside a pixel.\n m_sqrt_max_samples =\n round<size_t>(sqrt(static_cast<double>(m_params.m_max_samples)));\n RENDERER_LOG_INFO(\n \"effective subpixel grid size: \" FMT_SIZE_T \"x\" FMT_SIZE_T,\n m_sqrt_max_samples,\n m_sqrt_max_samples);\n\n \/\/ Initialize the pixel sampler.\n m_pixel_sampler.initialize(m_sqrt_max_samples);\n\n m_rcp_sample_canvas_width = 1.0 \/ (properties.m_canvas_width * m_sqrt_max_samples);\n m_rcp_sample_canvas_height = 1.0 \/ (properties.m_canvas_height * m_sqrt_max_samples);\n m_rcp_sample_count = 1.0f \/ (m_sqrt_max_samples * m_sqrt_max_samples);\n }\n\n virtual void release()\n {\n delete this;\n }\n\n virtual void render_tile(\n const Frame& frame,\n const size_t tile_x,\n const size_t tile_y,\n AbortSwitch& abort_switch)\n {\n \/\/ Retrieve frame properties.\n const CanvasProperties& properties = frame.properties();\n\n assert(tile_x < properties.m_tile_count_x);\n assert(tile_y < properties.m_tile_count_y);\n\n \/\/ Access the tile.\n Tile& tile = frame.tile(tile_x, tile_y);\n const size_t tile_width = tile.get_width();\n const size_t tile_height = tile.get_height();\n const size_t tile_origin_x = properties.m_tile_width * tile_x;\n const size_t tile_origin_y = properties.m_tile_height * tile_y;\n\n \/\/ Precompute some stuff.\n const LightingConditions& lighting_conditions =\n frame.get_lighting_conditions();\n\n \/\/ Loop over tile pixels.\n const size_t num_pixels = m_pixel_ordering.size();\n for (size_t i = 0; i < num_pixels; ++i)\n {\n \/\/ Retrieve the coordinates of the pixel in the tile.\n const size_t tx = static_cast<size_t>(m_pixel_ordering[i].x);\n const size_t ty = static_cast<size_t>(m_pixel_ordering[i].y);\n\n \/\/ Skip pixels outside of the tile.\n if (tx >= tile_width || ty >= tile_height)\n continue;\n\n \/\/ Compute the coordinates of the pixel in the image.\n const size_t ix = tile_origin_x + tx;\n const size_t iy = tile_origin_y + ty;\n\n \/\/ Skip pixels outside the crop window, if cropping is enabled.\n if (m_params.m_crop)\n {\n if (static_cast<int>(ix) < m_params.m_crop_window[0] ||\n static_cast<int>(iy) < m_params.m_crop_window[1] ||\n static_cast<int>(ix) > m_params.m_crop_window[2] ||\n static_cast<int>(iy) > m_params.m_crop_window[3])\n {\n \/\/ Pixels outside the crop window are set to transparent black.\n tile.set_pixel(tx, ty, Color4f(0.0f));\n continue;\n }\n }\n\n#ifdef DEBUG_BREAK_AT_PIXEL\n\n \/\/ Break in the debugger when this pixel is reached.\n if (Vector<size_t, 2>(ix, iy) == DEBUG_BREAK_AT_PIXEL)\n BREAKPOINT();\n\n#endif\n\n \/\/ Initialize the pixel color.\n Color4f pixel_color(0.0f);\n\n if (!abort_switch.is_aborted())\n {\n \/\/ Render, filter and accumulate samples.\n const size_t base_sx = ix * m_sqrt_max_samples;\n const size_t base_sy = iy * m_sqrt_max_samples;\n for (size_t sy = 0; sy < m_sqrt_max_samples; ++sy)\n {\n for (size_t sx = 0; sx < m_sqrt_max_samples; ++sx)\n {\n \/\/ Compute the sample position in sample space and the instance number.\n Vector2d s;\n size_t instance;\n m_pixel_sampler.sample(\n base_sx + sx,\n base_sy + sy,\n s,\n instance);\n\n \/\/ Compute the sample position in NDC.\n const Vector2d sample_position =\n frame.get_sample_position(s.x, s.y);\n\n \/\/ Create a sampling context.\n SamplingContext sampling_context(\n m_rng,\n 2, \/\/ number of dimensions\n 0, \/\/ number of samples\n instance); \/\/ initial instance number\n\n \/\/ Render the sample.\n ShadingResult shading_result;\n m_sample_renderer->render_sample(\n sampling_context,\n sample_position,\n shading_result);\n\n \/\/ todo: implement proper sample filtering.\n \/\/ todo: detect invalid sample values (NaN, infinity, etc.), set\n \/\/ them to black and mark them as faulty in the diagnostic map.\n\n \/\/ Transform the sample to the linear RGB color space.\n shading_result.transform_to_linear_rgb(lighting_conditions);\n\n \/\/ Accumulate the sample.\n pixel_color[0] += shading_result.m_color[0];\n pixel_color[1] += shading_result.m_color[1];\n pixel_color[2] += shading_result.m_color[2];\n pixel_color[3] += shading_result.m_alpha[0];\n }\n }\n\n \/\/ Finish computing the pixel color.\n pixel_color *= m_rcp_sample_count;\n }\n\n \/\/ Store the pixel color into the tile.\n tile.set_pixel(tx, ty, pixel_color);\n }\n }\n\n private:\n struct Parameters\n {\n const size_t m_min_samples; \/\/ minimum number of samples per pixel\n const size_t m_max_samples; \/\/ maximum number of samples per pixel\n bool m_crop; \/\/ is cropping enabled?\n Vector4i m_crop_window; \/\/ crop window\n\n \/\/ Constructor, extract parameters.\n explicit Parameters(const ParamArray& params)\n : m_min_samples ( params.get_required<size_t>(\"min_samples\", 1) )\n , m_max_samples ( params.get_required<size_t>(\"max_samples\", 1) )\n {\n \/\/ Retrieve crop window parameter.\n m_crop = params.strings().exist(\"crop_window\");\n if (m_crop)\n {\n m_crop_window =\n params.get_required<Vector4i>(\n \"crop_window\",\n Vector4i(0, 0, 65535, 65535));\n }\n }\n };\n\n \/\/ Pixel coordinates in a tile; max tile size is 65536 x 65536 pixels.\n typedef Vector<uint16, 2> Pixel;\n\n const Parameters m_params;\n auto_release_ptr<ISampleRenderer> m_sample_renderer;\n\n vector<Pixel> m_pixel_ordering;\n PixelSampler m_pixel_sampler;\n\n size_t m_sqrt_max_samples;\n double m_rcp_sample_canvas_width;\n double m_rcp_sample_canvas_height;\n float m_rcp_sample_count;\n\n SamplingContext::RNGType m_rng;\n };\n}\n\n\n\/\/\n\/\/ GenericTileRendererFactory class implementation.\n\/\/\n\nGenericTileRendererFactory::GenericTileRendererFactory(\n const Frame& frame,\n ISampleRendererFactory* factory,\n const ParamArray& params)\n : m_frame(frame)\n , m_factory(factory) \n , m_params(params)\n{\n}\n\nvoid GenericTileRendererFactory::release()\n{\n delete this;\n}\n\nITileRenderer* GenericTileRendererFactory::create()\n{\n return\n new GenericTileRenderer(\n m_frame,\n m_factory,\n m_params);\n}\n\nITileRenderer* GenericTileRendererFactory::create(\n const Frame& frame,\n ISampleRendererFactory* factory,\n const ParamArray& params)\n{\n return\n new GenericTileRenderer(\n frame,\n factory,\n params);\n}\n\n} \/\/ namespace renderer\n<|endoftext|>"} {"text":"<commit_before>\/\/===- lib\/ReaderWriter\/FileArchive.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 \"lld\/Core\/ArchiveLibraryFile.h\"\n#include \"lld\/Core\/LLVM.h\"\n#include \"lld\/Core\/LinkingContext.h\"\n#include \"lld\/Core\/Parallel.h\"\n#include \"llvm\/ADT\/Hashing.h\"\n#include \"llvm\/ADT\/StringRef.h\"\n#include \"llvm\/Object\/Archive.h\"\n#include \"llvm\/Object\/ObjectFile.h\"\n#include \"llvm\/Support\/Debug.h\"\n#include \"llvm\/Support\/Format.h\"\n#include \"llvm\/Support\/MemoryBuffer.h\"\n#include <memory>\n#include <mutex>\n#include <set>\n#include <unordered_map>\n\nusing llvm::object::Archive;\nusing llvm::object::ObjectFile;\nusing llvm::object::SymbolRef;\nusing llvm::object::symbol_iterator;\nusing llvm::object::object_error;\n\nnamespace lld {\n\nnamespace {\n\n\/\/\/ \\brief The FileArchive class represents an Archive Library file\nclass FileArchive : public lld::ArchiveLibraryFile {\npublic:\n FileArchive(std::unique_ptr<MemoryBuffer> mb, const Registry ®,\n StringRef path, bool logLoading)\n : ArchiveLibraryFile(path), _mb(std::shared_ptr<MemoryBuffer>(mb.release())),\n _registry(reg), _logLoading(logLoading) {}\n\n \/\/\/ \\brief Check if any member of the archive contains an Atom with the\n \/\/\/ specified name and return the File object for that member, or nullptr.\n File *find(StringRef name, bool dataSymbolOnly) override {\n auto member = _symbolMemberMap.find(name);\n if (member == _symbolMemberMap.end())\n return nullptr;\n Archive::child_iterator ci = member->second;\n\n \/\/ Don't return a member already returned\n const char *memberStart = ci->getBuffer().data();\n if (_membersInstantiated.count(memberStart))\n return nullptr;\n if (dataSymbolOnly && !isDataSymbol(ci, name))\n return nullptr;\n\n _membersInstantiated.insert(memberStart);\n\n \/\/ Check if a file is preloaded.\n {\n std::lock_guard<std::mutex> lock(_mutex);\n auto it = _preloaded.find(memberStart);\n if (it != _preloaded.end()) {\n std::unique_ptr<Future<File *>> &p = it->second;\n Future<File *> *future = p.get();\n return future->get();\n }\n }\n\n std::unique_ptr<File> result;\n if (instantiateMember(ci, result))\n return nullptr;\n\n \/\/ give up the pointer so that this object no longer manages it\n return result.release();\n }\n\n \/\/ Instantiate a member file containing a given symbol name.\n void preload(TaskGroup &group, StringRef name) override {\n auto member = _symbolMemberMap.find(name);\n if (member == _symbolMemberMap.end())\n return;\n Archive::child_iterator ci = member->second;\n\n \/\/ Do nothing if a member is already instantiated.\n const char *memberStart = ci->getBuffer().data();\n if (_membersInstantiated.count(memberStart))\n return;\n\n std::lock_guard<std::mutex> lock(_mutex);\n if (_preloaded.find(memberStart) != _preloaded.end())\n return;\n\n \/\/ Instantiate the member\n auto *future = new Future<File *>();\n _preloaded[memberStart] = std::unique_ptr<Future<File *>>(future);\n\n group.spawn([=] {\n std::unique_ptr<File> result;\n std::error_code ec = instantiateMember(ci, result);\n future->set(ec ? nullptr : result.release());\n });\n }\n\n \/\/\/ \\brief parse each member\n std::error_code\n parseAllMembers(std::vector<std::unique_ptr<File>> &result) override {\n if (std::error_code ec = parse())\n return ec;\n for (auto mf = _archive->child_begin(), me = _archive->child_end();\n mf != me; ++mf) {\n std::unique_ptr<File> file;\n if (std::error_code ec = instantiateMember(mf, file))\n return ec;\n result.push_back(std::move(file));\n }\n return std::error_code();\n }\n\n const atom_collection<DefinedAtom> &defined() const override {\n return _definedAtoms;\n }\n\n const atom_collection<UndefinedAtom> &undefined() const override {\n return _undefinedAtoms;\n }\n\n const atom_collection<SharedLibraryAtom> &sharedLibrary() const override {\n return _sharedLibraryAtoms;\n }\n\n const atom_collection<AbsoluteAtom> &absolute() const override {\n return _absoluteAtoms;\n }\n\n \/\/\/ Returns a set of all defined symbols in the archive.\n std::set<StringRef> getDefinedSymbols() override {\n parse();\n std::set<StringRef> ret;\n for (const auto &e : _symbolMemberMap)\n ret.insert(e.first);\n return ret;\n }\n\nprotected:\n std::error_code doParse() override {\n \/\/ Make Archive object which will be owned by FileArchive object.\n std::error_code ec;\n _archive.reset(new Archive(_mb->getMemBufferRef(), ec));\n if (ec)\n return ec;\n if ((ec = buildTableOfContents()))\n return ec;\n return std::error_code();\n }\n\nprivate:\n std::error_code\n instantiateMember(Archive::child_iterator member,\n std::unique_ptr<File> &result) const {\n ErrorOr<llvm::MemoryBufferRef> mbOrErr = member->getMemoryBufferRef();\n if (std::error_code ec = mbOrErr.getError())\n return ec;\n llvm::MemoryBufferRef mb = mbOrErr.get();\n std::string memberPath = (_archive->getFileName() + \"(\"\n + mb.getBufferIdentifier() + \")\").str();\n\n if (_logLoading)\n llvm::errs() << memberPath << \"\\n\";\n\n std::unique_ptr<MemoryBuffer> memberMB(MemoryBuffer::getMemBuffer(\n mb.getBuffer(), mb.getBufferIdentifier(), false));\n\n std::vector<std::unique_ptr<File>> files;\n if (std::error_code ec = _registry.loadFile(std::move(memberMB), files))\n return ec;\n assert(files.size() == 1);\n result = std::move(files[0]);\n if (std::error_code ec = result->parse())\n return ec;\n result->setArchivePath(_archive->getFileName());\n\n \/\/ The memory buffer is co-owned by the archive file and the children,\n \/\/ so that the bufffer is deallocated when all the members are destructed.\n result->setSharedMemoryBuffer(_mb);\n return std::error_code();\n }\n\n \/\/ Parses the given memory buffer as an object file, and returns true\n \/\/ code if the given symbol is a data symbol. If the symbol is not a data\n \/\/ symbol or does not exist, returns false.\n bool isDataSymbol(Archive::child_iterator member, StringRef symbol) const {\n ErrorOr<llvm::MemoryBufferRef> buf = member->getMemoryBufferRef();\n if (buf.getError())\n return false;\n std::unique_ptr<MemoryBuffer> mb(MemoryBuffer::getMemBuffer(\n buf.get().getBuffer(), buf.get().getBufferIdentifier(), false));\n\n auto objOrErr(ObjectFile::createObjectFile(mb->getMemBufferRef()));\n if (objOrErr.getError())\n return false;\n std::unique_ptr<ObjectFile> obj = std::move(objOrErr.get());\n\n for (SymbolRef sym : obj->symbols()) {\n \/\/ Skip until we find the symbol.\n StringRef name;\n if (sym.getName(name))\n return false;\n if (name != symbol)\n continue;\n uint32_t flags = sym.getFlags();\n if (flags <= SymbolRef::SF_Undefined)\n continue;\n\n \/\/ Returns true if it's a data symbol.\n SymbolRef::Type type;\n if (sym.getType(type))\n return false;\n if (type == SymbolRef::ST_Data)\n return true;\n }\n return false;\n }\n\n std::error_code buildTableOfContents() {\n DEBUG_WITH_TYPE(\"FileArchive\", llvm::dbgs()\n << \"Table of contents for archive '\"\n << _archive->getFileName() << \"':\\n\");\n for (const Archive::Symbol &sym : _archive->symbols()) {\n StringRef name = sym.getName();\n ErrorOr<Archive::child_iterator> memberOrErr = sym.getMember();\n if (std::error_code ec = memberOrErr.getError())\n return ec;\n Archive::child_iterator member = memberOrErr.get();\n DEBUG_WITH_TYPE(\n \"FileArchive\",\n llvm::dbgs() << llvm::format(\"0x%08llX \", member->getBuffer().data())\n << \"'\" << name << \"'\\n\");\n _symbolMemberMap[name] = member;\n }\n return std::error_code();\n }\n\n typedef std::unordered_map<StringRef, Archive::child_iterator> MemberMap;\n typedef std::set<const char *> InstantiatedSet;\n\n std::shared_ptr<MemoryBuffer> _mb;\n const Registry &_registry;\n std::unique_ptr<Archive> _archive;\n MemberMap _symbolMemberMap;\n InstantiatedSet _membersInstantiated;\n atom_collection_vector<DefinedAtom> _definedAtoms;\n atom_collection_vector<UndefinedAtom> _undefinedAtoms;\n atom_collection_vector<SharedLibraryAtom> _sharedLibraryAtoms;\n atom_collection_vector<AbsoluteAtom> _absoluteAtoms;\n bool _logLoading;\n std::vector<std::unique_ptr<MemoryBuffer>> _memberBuffers;\n std::map<const char *, std::unique_ptr<Future<File *>>> _preloaded;\n std::mutex _mutex;\n};\n\nclass ArchiveReader : public Reader {\npublic:\n ArchiveReader(bool logLoading) : _logLoading(logLoading) {}\n\n bool canParse(file_magic magic, const MemoryBuffer &) const override {\n return magic == llvm::sys::fs::file_magic::archive;\n }\n\n std::error_code\n loadFile(std::unique_ptr<MemoryBuffer> mb, const Registry ®,\n std::vector<std::unique_ptr<File>> &result) const override {\n StringRef path = mb->getBufferIdentifier();\n std::unique_ptr<FileArchive> file(\n new FileArchive(std::move(mb), reg, path, _logLoading));\n result.push_back(std::move(file));\n return std::error_code();\n }\n\nprivate:\n bool _logLoading;\n};\n\n} \/\/ anonymous namespace\n\nvoid Registry::addSupportArchives(bool logLoading) {\n add(std::unique_ptr<Reader>(new ArchiveReader(logLoading)));\n}\n\n} \/\/ end namespace lld\n<commit_msg>Remove unused vectors from FileArchive.<commit_after>\/\/===- lib\/ReaderWriter\/FileArchive.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 \"lld\/Core\/ArchiveLibraryFile.h\"\n#include \"lld\/Core\/LLVM.h\"\n#include \"lld\/Core\/LinkingContext.h\"\n#include \"lld\/Core\/Parallel.h\"\n#include \"llvm\/ADT\/Hashing.h\"\n#include \"llvm\/ADT\/StringRef.h\"\n#include \"llvm\/Object\/Archive.h\"\n#include \"llvm\/Object\/ObjectFile.h\"\n#include \"llvm\/Support\/Debug.h\"\n#include \"llvm\/Support\/Format.h\"\n#include \"llvm\/Support\/MemoryBuffer.h\"\n#include <memory>\n#include <mutex>\n#include <set>\n#include <unordered_map>\n\nusing llvm::object::Archive;\nusing llvm::object::ObjectFile;\nusing llvm::object::SymbolRef;\nusing llvm::object::symbol_iterator;\nusing llvm::object::object_error;\n\nnamespace lld {\n\nnamespace {\n\n\/\/\/ \\brief The FileArchive class represents an Archive Library file\nclass FileArchive : public lld::ArchiveLibraryFile {\npublic:\n FileArchive(std::unique_ptr<MemoryBuffer> mb, const Registry ®,\n StringRef path, bool logLoading)\n : ArchiveLibraryFile(path), _mb(std::shared_ptr<MemoryBuffer>(mb.release())),\n _registry(reg), _logLoading(logLoading) {}\n\n \/\/\/ \\brief Check if any member of the archive contains an Atom with the\n \/\/\/ specified name and return the File object for that member, or nullptr.\n File *find(StringRef name, bool dataSymbolOnly) override {\n auto member = _symbolMemberMap.find(name);\n if (member == _symbolMemberMap.end())\n return nullptr;\n Archive::child_iterator ci = member->second;\n\n \/\/ Don't return a member already returned\n const char *memberStart = ci->getBuffer().data();\n if (_membersInstantiated.count(memberStart))\n return nullptr;\n if (dataSymbolOnly && !isDataSymbol(ci, name))\n return nullptr;\n\n _membersInstantiated.insert(memberStart);\n\n \/\/ Check if a file is preloaded.\n {\n std::lock_guard<std::mutex> lock(_mutex);\n auto it = _preloaded.find(memberStart);\n if (it != _preloaded.end()) {\n std::unique_ptr<Future<File *>> &p = it->second;\n Future<File *> *future = p.get();\n return future->get();\n }\n }\n\n std::unique_ptr<File> result;\n if (instantiateMember(ci, result))\n return nullptr;\n\n \/\/ give up the pointer so that this object no longer manages it\n return result.release();\n }\n\n \/\/ Instantiate a member file containing a given symbol name.\n void preload(TaskGroup &group, StringRef name) override {\n auto member = _symbolMemberMap.find(name);\n if (member == _symbolMemberMap.end())\n return;\n Archive::child_iterator ci = member->second;\n\n \/\/ Do nothing if a member is already instantiated.\n const char *memberStart = ci->getBuffer().data();\n if (_membersInstantiated.count(memberStart))\n return;\n\n std::lock_guard<std::mutex> lock(_mutex);\n if (_preloaded.find(memberStart) != _preloaded.end())\n return;\n\n \/\/ Instantiate the member\n auto *future = new Future<File *>();\n _preloaded[memberStart] = std::unique_ptr<Future<File *>>(future);\n\n group.spawn([=] {\n std::unique_ptr<File> result;\n std::error_code ec = instantiateMember(ci, result);\n future->set(ec ? nullptr : result.release());\n });\n }\n\n \/\/\/ \\brief parse each member\n std::error_code\n parseAllMembers(std::vector<std::unique_ptr<File>> &result) override {\n if (std::error_code ec = parse())\n return ec;\n for (auto mf = _archive->child_begin(), me = _archive->child_end();\n mf != me; ++mf) {\n std::unique_ptr<File> file;\n if (std::error_code ec = instantiateMember(mf, file))\n return ec;\n result.push_back(std::move(file));\n }\n return std::error_code();\n }\n\n const atom_collection<DefinedAtom> &defined() const override {\n return _noDefinedAtoms;\n }\n\n const atom_collection<UndefinedAtom> &undefined() const override {\n return _noUndefinedAtoms;\n }\n\n const atom_collection<SharedLibraryAtom> &sharedLibrary() const override {\n return _noSharedLibraryAtoms;\n }\n\n const atom_collection<AbsoluteAtom> &absolute() const override {\n return _noAbsoluteAtoms;\n }\n\n \/\/\/ Returns a set of all defined symbols in the archive.\n std::set<StringRef> getDefinedSymbols() override {\n parse();\n std::set<StringRef> ret;\n for (const auto &e : _symbolMemberMap)\n ret.insert(e.first);\n return ret;\n }\n\nprotected:\n std::error_code doParse() override {\n \/\/ Make Archive object which will be owned by FileArchive object.\n std::error_code ec;\n _archive.reset(new Archive(_mb->getMemBufferRef(), ec));\n if (ec)\n return ec;\n if ((ec = buildTableOfContents()))\n return ec;\n return std::error_code();\n }\n\nprivate:\n std::error_code\n instantiateMember(Archive::child_iterator member,\n std::unique_ptr<File> &result) const {\n ErrorOr<llvm::MemoryBufferRef> mbOrErr = member->getMemoryBufferRef();\n if (std::error_code ec = mbOrErr.getError())\n return ec;\n llvm::MemoryBufferRef mb = mbOrErr.get();\n std::string memberPath = (_archive->getFileName() + \"(\"\n + mb.getBufferIdentifier() + \")\").str();\n\n if (_logLoading)\n llvm::errs() << memberPath << \"\\n\";\n\n std::unique_ptr<MemoryBuffer> memberMB(MemoryBuffer::getMemBuffer(\n mb.getBuffer(), mb.getBufferIdentifier(), false));\n\n std::vector<std::unique_ptr<File>> files;\n if (std::error_code ec = _registry.loadFile(std::move(memberMB), files))\n return ec;\n assert(files.size() == 1);\n result = std::move(files[0]);\n if (std::error_code ec = result->parse())\n return ec;\n result->setArchivePath(_archive->getFileName());\n\n \/\/ The memory buffer is co-owned by the archive file and the children,\n \/\/ so that the bufffer is deallocated when all the members are destructed.\n result->setSharedMemoryBuffer(_mb);\n return std::error_code();\n }\n\n \/\/ Parses the given memory buffer as an object file, and returns true\n \/\/ code if the given symbol is a data symbol. If the symbol is not a data\n \/\/ symbol or does not exist, returns false.\n bool isDataSymbol(Archive::child_iterator member, StringRef symbol) const {\n ErrorOr<llvm::MemoryBufferRef> buf = member->getMemoryBufferRef();\n if (buf.getError())\n return false;\n std::unique_ptr<MemoryBuffer> mb(MemoryBuffer::getMemBuffer(\n buf.get().getBuffer(), buf.get().getBufferIdentifier(), false));\n\n auto objOrErr(ObjectFile::createObjectFile(mb->getMemBufferRef()));\n if (objOrErr.getError())\n return false;\n std::unique_ptr<ObjectFile> obj = std::move(objOrErr.get());\n\n for (SymbolRef sym : obj->symbols()) {\n \/\/ Skip until we find the symbol.\n StringRef name;\n if (sym.getName(name))\n return false;\n if (name != symbol)\n continue;\n uint32_t flags = sym.getFlags();\n if (flags <= SymbolRef::SF_Undefined)\n continue;\n\n \/\/ Returns true if it's a data symbol.\n SymbolRef::Type type;\n if (sym.getType(type))\n return false;\n if (type == SymbolRef::ST_Data)\n return true;\n }\n return false;\n }\n\n std::error_code buildTableOfContents() {\n DEBUG_WITH_TYPE(\"FileArchive\", llvm::dbgs()\n << \"Table of contents for archive '\"\n << _archive->getFileName() << \"':\\n\");\n for (const Archive::Symbol &sym : _archive->symbols()) {\n StringRef name = sym.getName();\n ErrorOr<Archive::child_iterator> memberOrErr = sym.getMember();\n if (std::error_code ec = memberOrErr.getError())\n return ec;\n Archive::child_iterator member = memberOrErr.get();\n DEBUG_WITH_TYPE(\n \"FileArchive\",\n llvm::dbgs() << llvm::format(\"0x%08llX \", member->getBuffer().data())\n << \"'\" << name << \"'\\n\");\n _symbolMemberMap[name] = member;\n }\n return std::error_code();\n }\n\n typedef std::unordered_map<StringRef, Archive::child_iterator> MemberMap;\n typedef std::set<const char *> InstantiatedSet;\n\n std::shared_ptr<MemoryBuffer> _mb;\n const Registry &_registry;\n std::unique_ptr<Archive> _archive;\n MemberMap _symbolMemberMap;\n InstantiatedSet _membersInstantiated;\n bool _logLoading;\n std::vector<std::unique_ptr<MemoryBuffer>> _memberBuffers;\n std::map<const char *, std::unique_ptr<Future<File *>>> _preloaded;\n std::mutex _mutex;\n};\n\nclass ArchiveReader : public Reader {\npublic:\n ArchiveReader(bool logLoading) : _logLoading(logLoading) {}\n\n bool canParse(file_magic magic, const MemoryBuffer &) const override {\n return magic == llvm::sys::fs::file_magic::archive;\n }\n\n std::error_code\n loadFile(std::unique_ptr<MemoryBuffer> mb, const Registry ®,\n std::vector<std::unique_ptr<File>> &result) const override {\n StringRef path = mb->getBufferIdentifier();\n std::unique_ptr<FileArchive> file(\n new FileArchive(std::move(mb), reg, path, _logLoading));\n result.push_back(std::move(file));\n return std::error_code();\n }\n\nprivate:\n bool _logLoading;\n};\n\n} \/\/ anonymous namespace\n\nvoid Registry::addSupportArchives(bool logLoading) {\n add(std::unique_ptr<Reader>(new ArchiveReader(logLoading)));\n}\n\n} \/\/ end namespace lld\n<|endoftext|>"} {"text":"<commit_before>\/\/ This is the main DLL file.\n\n#include \"liblzma_wrapper.h\"\n\n\n\/\/\/ Information about a .xz file\ntypedef struct {\n\t\/\/\/ Combined Index of all Streams in the file\n\tlzma_index *idx;\n\n\t\/\/\/ Total amount of Stream Padding\n\tuint64_t stream_padding;\n\n\t\/\/\/ Highest memory usage so far\n\tuint64_t memusage_max;\n\n\t\/\/\/ True if all Blocks so far have Compressed Size and\n\t\/\/\/ Uncompressed Size fields\n\tbool all_have_sizes;\n\n\t\/\/\/ Oldest XZ Utils version that will decompress the file\n\tuint32_t min_version;\n\n} xz_file_info;\n\nstatic String^ message_strm(lzma_ret code)\n{\n\tswitch (code) {\n\tcase LZMA_NO_CHECK:\n\t\treturn (\"No integrity check; not verifying file integrity\");\n\n\tcase LZMA_UNSUPPORTED_CHECK:\n\t\treturn (\"Unsupported type of integrity check; \"\n\t\t\t\"not verifying file integrity\");\n\n\tcase LZMA_MEM_ERROR:\n\t\treturn (\"Memory error\");\n\n\tcase LZMA_MEMLIMIT_ERROR:\n\t\treturn (\"Memory usage limit reached\");\n\n\tcase LZMA_FORMAT_ERROR:\n\t\treturn (\"File format not recognized\");\n\n\tcase LZMA_OPTIONS_ERROR:\n\t\treturn (\"Unsupported options\");\n\n\tcase LZMA_DATA_ERROR:\n\t\treturn (\"Compressed data is corrupt\");\n\n\tcase LZMA_BUF_ERROR:\n\t\treturn (\"Unexpected end of input\");\n\n\tcase LZMA_OK:\n\tcase LZMA_STREAM_END:\n\tcase LZMA_GET_CHECK:\n\tcase LZMA_PROG_ERROR:\n\t\t\/\/ Without \"default\", compiler will warn if new constants\n\t\t\/\/ are added to lzma_ret, it is not too easy to forget to\n\t\t\/\/ add the new constants to this function.\n\t\tbreak;\n\t}\n\n\treturn (\"Internal error (bug)\");\n}\n\nstatic bool io_pread(Stream ^stream, array<Byte>^buf, size_t size, int64_t pos)\n{\n\tif (stream->Seek(pos, SeekOrigin::Begin) != pos)\n\t\tthrow gcnew InvalidDataException(\"unable to seek to pos\");\n\tif (stream->Read(buf, 0, size) != size)\n\t\tthrow gcnew InvalidDataException(\"unable to read size\");\n\treturn true;\n}\n\nstruct xz_file_basic_info\n{\n\tuint64_t stream_count;\n\tuint64_t block_count;\n\tuint64_t file_size;\n\tuint64_t uncompressed_size;\n};\n\nstatic void liblzma_wrapper::parse_indexes(liblzma_wrapper::XZFileInfo ^xfbi, Stream ^stream)\n{\n\txz_file_info sxfi = { NULL, 0, 0, true, 50000002 };\n\txz_file_info *xfi = &sxfi;\n\tint64_t length = stream->Length;\n\tif (length < 2 * LZMA_STREAM_HEADER_SIZE)\n\t\tthrow gcnew InvalidDataException(\"Too small to be a valid .xz file\");\n\n\tlzma_stream_flags header_flags;\n\tlzma_stream_flags footer_flags;\n\tlzma_ret ret;\n\n\t\/\/ lzma_stream for the Index decoder\n\tlzma_stream strm = LZMA_STREAM_INIT;\n\n\t\/\/ All Indexes decoded so far\n\tlzma_index *combined_index = NULL;\n\n\t\/\/ The Index currently being decoded\n\tlzma_index *this_index = NULL;\n\n\ttry {\n\n\n\t\t\/\/ Current position in the file. We parse the file backwards so\n\t\t\/\/ initialize it to point to the end of the file.\n\t\tint64_t pos = length;\n\t\tarray<Byte>^ nums = gcnew array<Byte>(IO_BUFFER_SIZE);\n\t\tpin_ptr<Byte> pp = &nums[0];\n\t\tuint8_t *buf_u8 = pp;\n\t\tuint32_t *buf_u32 = (uint32_t *)(buf_u8);\n\n\t\t\/\/ Each loop iteration decodes one Index.\n\t\tdo {\n\t\t\t\/\/ Check that there is enough data left to contain at least\n\t\t\t\/\/ the Stream Header and Stream Footer. This check cannot\n\t\t\t\/\/ fail in the first pass of this loop.\n\t\t\tif (pos < 2 * LZMA_STREAM_HEADER_SIZE)\n\t\t\t\tthrow gcnew InvalidDataException(message_strm(LZMA_DATA_ERROR));\n\n\t\t\tpos -= LZMA_STREAM_HEADER_SIZE;\n\t\t\tlzma_vli stream_padding = 0;\n\n\t\t\t\/\/ Locate the Stream Footer. There may be Stream Padding which\n\t\t\t\/\/ we must skip when reading backwards.\n\t\t\twhile (true) {\n\t\t\t\tif (pos < LZMA_STREAM_HEADER_SIZE)\n\t\t\t\t\tthrow gcnew InvalidDataException(message_strm(LZMA_DATA_ERROR));\n\n\t\t\t\tio_pread(stream, nums, LZMA_STREAM_HEADER_SIZE, pos);\n\n\t\t\t\t\/\/ Stream Padding is always a multiple of four bytes.\n\t\t\t\tint i = 2;\n\t\t\t\tif (buf_u32[i] != 0)\n\t\t\t\t\tbreak;\n\n\t\t\t\t\/\/ To avoid calling io_pread() for every four bytes\n\t\t\t\t\/\/ of Stream Padding, take advantage that we read\n\t\t\t\t\/\/ 12 bytes (LZMA_STREAM_HEADER_SIZE) already and\n\t\t\t\t\/\/ check them too before calling io_pread() again.\n\t\t\t\tdo {\n\t\t\t\t\tstream_padding += 4;\n\t\t\t\t\tpos -= 4;\n\t\t\t\t\t--i;\n\t\t\t\t} while (i >= 0 && buf_u32[i] == 0);\n\t\t\t}\n\n\t\t\t\/\/ Decode the Stream Footer.\n\t\t\tret = lzma_stream_footer_decode(&footer_flags, buf_u8);\n\t\t\tif (ret != LZMA_OK)\n\t\t\t\tthrow gcnew InvalidDataException(message_strm(ret));\n\n\t\t\t\/\/ Check that the Stream Footer doesn't specify something\n\t\t\t\/\/ that we don't support. This can only happen if the xz\n\t\t\t\/\/ version is older than liblzma and liblzma supports\n\t\t\t\/\/ something new.\n\t\t\t\/\/\n\t\t\t\/\/ It is enough to check Stream Footer. Stream Header must\n\t\t\t\/\/ match when it is compared against Stream Footer with\n\t\t\t\/\/ lzma_stream_flags_compare().\n\t\t\tif (footer_flags.version != 0)\n\t\t\t\tthrow gcnew InvalidDataException(message_strm(LZMA_OPTIONS_ERROR));\n\n\t\t\t\/\/ Check that the size of the Index field looks sane.\n\t\t\tlzma_vli index_size = footer_flags.backward_size;\n\t\t\tif ((lzma_vli)(pos) < index_size + LZMA_STREAM_HEADER_SIZE)\n\t\t\t\tthrow gcnew InvalidDataException(message_strm(LZMA_DATA_ERROR));\n\n\t\t\t\/\/ Set pos to the beginning of the Index.\n\t\t\tpos -= index_size;\n\n\t\t\t\/\/ Decode the Index.\n\t\t\tret = lzma_index_decoder(&strm, &this_index, UINT64_MAX);\n\t\t\tif (ret != LZMA_OK)\n\t\t\t\tthrow gcnew InvalidDataException(message_strm(ret));\n\n\t\t\tdo {\n\t\t\t\t\/\/ Don't give the decoder more input than the\n\t\t\t\t\/\/ Index size.\n\t\t\t\tstrm.avail_in = (size_t)(IO_BUFFER_SIZE < index_size ? IO_BUFFER_SIZE : index_size);\n\t\t\t\tio_pread(stream, nums, strm.avail_in, pos);\n\n\t\t\t\tpos += strm.avail_in;\n\t\t\t\tindex_size -= strm.avail_in;\n\n\t\t\t\tstrm.next_in = buf_u8;\n\t\t\t\tret = lzma_code(&strm, LZMA_RUN);\n\n\t\t\t} while (ret == LZMA_OK);\n\n\t\t\t\/\/ If the decoding seems to be successful, check also that\n\t\t\t\/\/ the Index decoder consumed as much input as indicated\n\t\t\t\/\/ by the Backward Size field.\n\t\t\tif (ret == LZMA_STREAM_END)\n\t\t\t\tif (index_size != 0 || strm.avail_in != 0)\n\t\t\t\t\tret = LZMA_DATA_ERROR;\n\n\t\t\tif (ret != LZMA_STREAM_END) {\n\t\t\t\t\/\/ LZMA_BUFFER_ERROR means that the Index decoder\n\t\t\t\t\/\/ would have liked more input than what the Index\n\t\t\t\t\/\/ size should be according to Stream Footer.\n\t\t\t\t\/\/ The message for LZMA_DATA_ERROR makes more\n\t\t\t\t\/\/ sense in that case.\n\t\t\t\tif (ret == LZMA_BUF_ERROR)\n\t\t\t\t\tret = LZMA_DATA_ERROR;\n\n\t\t\t\tthrow gcnew InvalidDataException(message_strm(ret));\n\t\t\t}\n\n\t\t\t\/\/ Decode the Stream Header and check that its Stream Flags\n\t\t\t\/\/ match the Stream Footer.\n\t\t\tpos -= footer_flags.backward_size + LZMA_STREAM_HEADER_SIZE;\n\t\t\tif ((lzma_vli)(pos) < lzma_index_total_size(this_index))\n\t\t\t\tthrow gcnew InvalidDataException(message_strm(LZMA_DATA_ERROR));\n\n\t\t\tpos -= lzma_index_total_size(this_index);\n\t\t\tio_pread(stream, nums, LZMA_STREAM_HEADER_SIZE, pos);\n\n\t\t\tret = lzma_stream_header_decode(&header_flags, buf_u8);\n\t\t\tif (ret != LZMA_OK)\n\t\t\t\tthrow gcnew InvalidDataException(message_strm(ret));\n\n\t\t\tret = lzma_stream_flags_compare(&header_flags, &footer_flags);\n\t\t\tif (ret != LZMA_OK)\n\t\t\t\tthrow gcnew InvalidDataException(message_strm(ret));\n\n\t\t\t\/\/ Store the decoded Stream Flags into this_index. This is\n\t\t\t\/\/ needed so that we can print which Check is used in each\n\t\t\t\/\/ Stream.\n\t\t\tret = lzma_index_stream_flags(this_index, &footer_flags);\n\t\t\tif (ret != LZMA_OK)\n\t\t\t\tthrow gcnew InvalidOperationException(message_strm(ret));\n\n\t\t\t\/\/ Store also the size of the Stream Padding field. It is\n\t\t\t\/\/ needed to show the offsets of the Streams correctly.\n\t\t\tret = lzma_index_stream_padding(this_index, stream_padding);\n\t\t\tif (ret != LZMA_OK)\n\t\t\t\tthrow gcnew InvalidOperationException(message_strm(ret));\n\n\t\t\tif (combined_index != NULL) {\n\t\t\t\t\/\/ Append the earlier decoded Indexes\n\t\t\t\t\/\/ after this_index.\n\t\t\t\tret = lzma_index_cat(\n\t\t\t\t\tthis_index, combined_index, NULL);\n\t\t\t\tif (ret != LZMA_OK)\n\t\t\t\t\tthrow gcnew InvalidOperationException(message_strm(ret));\n\t\t\t}\n\n\t\t\tcombined_index = this_index;\n\t\t\tthis_index = NULL;\n\n\t\t\txfi->stream_padding += stream_padding;\n\n\t\t} while (pos > 0);\n\n\t\t\/\/ All OK. Make combined_index available to the caller.\n\t\txfi->idx = combined_index;\n\n\n\t\txfbi->stream_count = lzma_index_stream_count(xfi->idx);\n\t\txfbi->block_count = lzma_index_block_count(xfi->idx);\n\t\txfbi->file_size = lzma_index_file_size(xfi->idx);\n\t\txfbi->uncompressed_size = lzma_index_uncompressed_size(xfi->idx);\n\t}\n\tfinally\n\t{\n\t\tlzma_end(&strm);\n\t\tlzma_index_end(combined_index, NULL);\n\t\tlzma_index_end(this_index, NULL);\n\t}\n}\n\nint liblzma_wrapper::LZMAStream::Read(cli::array<unsigned char, 1> ^buffer, int offset, int size)\n{\n\tif (bCompress)\n\t\tthrow gcnew InvalidOperationException(\"Operation not supported\");\n\n\tif (strm->avail_in == 0)\n\t{\n\t\tstrm->avail_in = stream->Read(gc_buf, 0, gc_buf->Length);\n\t\tpin_ptr<Byte> pp_inbuf = &gc_buf[0];\n\t\tstrm->next_in = pp_inbuf;\n\t}\n\n\n\tpin_ptr<Byte> pp_outbuf = &buffer[0];\n\tstrm->next_out = pp_outbuf + offset;\n\tstrm->avail_out = size;\n\n\tret = lzma_code(strm, LZMA_RUN);\n\n\tif (ret != LZMA_OK && ret != LZMA_STREAM_END)\n\t\tthrow gcnew InvalidOperationException(message_strm(ret));\n\n\treturn size - strm->avail_out;\n}\n\nvoid liblzma_wrapper::LZMAStream::Flush()\n{\n\tif (bCompress)\n\t{\n\t\tdo\n\t\t{\n\t\t\tstrm->next_in = nullptr;\n\t\t\tstrm->avail_in = 0;\n\n\t\t\tpin_ptr<Byte> pp_outbuf = &gc_buf[0];\n\t\t\tstrm->next_out = pp_outbuf;\n\t\t\tsize_t outlen = gc_buf->Length;\n\t\t\tstrm->avail_out = outlen;\n\n\t\t\tret = lzma_code(strm, LZMA_FINISH);\n\n\t\t\tif (ret != LZMA_OK && ret != LZMA_STREAM_END)\n\t\t\t\tthrow gcnew InvalidOperationException(message_strm(ret));\n\n\t\t\tint64_t avail = outlen - strm->avail_out;\n\t\t\tif (avail > 0)\n\t\t\t\tstream->Write(gc_buf, 0, avail);\n\t\t} while (strm->avail_in > 0);\n\t}\n}\n\nvoid liblzma_wrapper::LZMAStream::Write(cli::array<unsigned char, 1> ^buffer, int offset, int size)\n{\n\tif (!bCompress)\n\t\tthrow gcnew InvalidOperationException(\"Operation not supported\");\n\n\tpin_ptr<Byte> pp_inbuf = &buffer[0];\n\tstrm->next_in = pp_inbuf + offset;\n\tstrm->avail_in = size;\n\n\twhile (strm->avail_in > 0)\n\t{\n\t\tpin_ptr<Byte> pp_outbuf = &gc_buf[0];\n\t\tstrm->next_out = pp_outbuf;\n\t\tsize_t outlen = gc_buf->Length;\n\t\tstrm->avail_out = outlen;\n\n\t\tret = lzma_code(strm, LZMA_RUN);\n\n\t\tif (ret != LZMA_OK && ret != LZMA_STREAM_END)\n\t\t\tthrow gcnew InvalidOperationException(message_strm(ret));\n\n\t\tint64_t avail = outlen - strm->avail_out;\n\t\tif (avail > 0)\n\t\t\tstream->Write(gc_buf, 0, avail);\n\t}\n}\n<commit_msg>Fix conversion warnings in liblzma_wrapper<commit_after>\/\/ This is the main DLL file.\n\n#include \"liblzma_wrapper.h\"\n\n\n\/\/\/ Information about a .xz file\ntypedef struct {\n\t\/\/\/ Combined Index of all Streams in the file\n\tlzma_index *idx;\n\n\t\/\/\/ Total amount of Stream Padding\n\tuint64_t stream_padding;\n\n\t\/\/\/ Highest memory usage so far\n\tuint64_t memusage_max;\n\n\t\/\/\/ True if all Blocks so far have Compressed Size and\n\t\/\/\/ Uncompressed Size fields\n\tbool all_have_sizes;\n\n\t\/\/\/ Oldest XZ Utils version that will decompress the file\n\tuint32_t min_version;\n\n} xz_file_info;\n\nstatic String^ message_strm(lzma_ret code)\n{\n\tswitch (code) {\n\tcase LZMA_NO_CHECK:\n\t\treturn (\"No integrity check; not verifying file integrity\");\n\n\tcase LZMA_UNSUPPORTED_CHECK:\n\t\treturn (\"Unsupported type of integrity check; \"\n\t\t\t\"not verifying file integrity\");\n\n\tcase LZMA_MEM_ERROR:\n\t\treturn (\"Memory error\");\n\n\tcase LZMA_MEMLIMIT_ERROR:\n\t\treturn (\"Memory usage limit reached\");\n\n\tcase LZMA_FORMAT_ERROR:\n\t\treturn (\"File format not recognized\");\n\n\tcase LZMA_OPTIONS_ERROR:\n\t\treturn (\"Unsupported options\");\n\n\tcase LZMA_DATA_ERROR:\n\t\treturn (\"Compressed data is corrupt\");\n\n\tcase LZMA_BUF_ERROR:\n\t\treturn (\"Unexpected end of input\");\n\n\tcase LZMA_OK:\n\tcase LZMA_STREAM_END:\n\tcase LZMA_GET_CHECK:\n\tcase LZMA_PROG_ERROR:\n\t\t\/\/ Without \"default\", compiler will warn if new constants\n\t\t\/\/ are added to lzma_ret, it is not too easy to forget to\n\t\t\/\/ add the new constants to this function.\n\t\tbreak;\n\t}\n\n\treturn (\"Internal error (bug)\");\n}\n\nstatic bool io_pread(Stream ^stream, array<Byte>^buf, size_t size, int64_t pos)\n{\n\tif (stream->Seek(pos, SeekOrigin::Begin) != pos)\n\t\tthrow gcnew InvalidDataException(\"unable to seek to pos\");\n\tif (stream->Read(buf, 0, size) != size)\n\t\tthrow gcnew InvalidDataException(\"unable to read size\");\n\treturn true;\n}\n\nstruct xz_file_basic_info\n{\n\tuint64_t stream_count;\n\tuint64_t block_count;\n\tuint64_t file_size;\n\tuint64_t uncompressed_size;\n};\n\nstatic void liblzma_wrapper::parse_indexes(liblzma_wrapper::XZFileInfo ^xfbi, Stream ^stream)\n{\n\txz_file_info sxfi = { NULL, 0, 0, true, 50000002 };\n\txz_file_info *xfi = &sxfi;\n\tint64_t length = stream->Length;\n\tif (length < 2 * LZMA_STREAM_HEADER_SIZE)\n\t\tthrow gcnew InvalidDataException(\"Too small to be a valid .xz file\");\n\n\tlzma_stream_flags header_flags;\n\tlzma_stream_flags footer_flags;\n\tlzma_ret ret;\n\n\t\/\/ lzma_stream for the Index decoder\n\tlzma_stream strm = LZMA_STREAM_INIT;\n\n\t\/\/ All Indexes decoded so far\n\tlzma_index *combined_index = NULL;\n\n\t\/\/ The Index currently being decoded\n\tlzma_index *this_index = NULL;\n\n\ttry {\n\n\n\t\t\/\/ Current position in the file. We parse the file backwards so\n\t\t\/\/ initialize it to point to the end of the file.\n\t\tint64_t pos = length;\n\t\tarray<Byte>^ nums = gcnew array<Byte>(IO_BUFFER_SIZE);\n\t\tpin_ptr<Byte> pp = &nums[0];\n\t\tuint8_t *buf_u8 = pp;\n\t\tuint32_t *buf_u32 = (uint32_t *)(buf_u8);\n\n\t\t\/\/ Each loop iteration decodes one Index.\n\t\tdo {\n\t\t\t\/\/ Check that there is enough data left to contain at least\n\t\t\t\/\/ the Stream Header and Stream Footer. This check cannot\n\t\t\t\/\/ fail in the first pass of this loop.\n\t\t\tif (pos < 2 * LZMA_STREAM_HEADER_SIZE)\n\t\t\t\tthrow gcnew InvalidDataException(message_strm(LZMA_DATA_ERROR));\n\n\t\t\tpos -= LZMA_STREAM_HEADER_SIZE;\n\t\t\tlzma_vli stream_padding = 0;\n\n\t\t\t\/\/ Locate the Stream Footer. There may be Stream Padding which\n\t\t\t\/\/ we must skip when reading backwards.\n\t\t\twhile (true) {\n\t\t\t\tif (pos < LZMA_STREAM_HEADER_SIZE)\n\t\t\t\t\tthrow gcnew InvalidDataException(message_strm(LZMA_DATA_ERROR));\n\n\t\t\t\tio_pread(stream, nums, LZMA_STREAM_HEADER_SIZE, pos);\n\n\t\t\t\t\/\/ Stream Padding is always a multiple of four bytes.\n\t\t\t\tint i = 2;\n\t\t\t\tif (buf_u32[i] != 0)\n\t\t\t\t\tbreak;\n\n\t\t\t\t\/\/ To avoid calling io_pread() for every four bytes\n\t\t\t\t\/\/ of Stream Padding, take advantage that we read\n\t\t\t\t\/\/ 12 bytes (LZMA_STREAM_HEADER_SIZE) already and\n\t\t\t\t\/\/ check them too before calling io_pread() again.\n\t\t\t\tdo {\n\t\t\t\t\tstream_padding += 4;\n\t\t\t\t\tpos -= 4;\n\t\t\t\t\t--i;\n\t\t\t\t} while (i >= 0 && buf_u32[i] == 0);\n\t\t\t}\n\n\t\t\t\/\/ Decode the Stream Footer.\n\t\t\tret = lzma_stream_footer_decode(&footer_flags, buf_u8);\n\t\t\tif (ret != LZMA_OK)\n\t\t\t\tthrow gcnew InvalidDataException(message_strm(ret));\n\n\t\t\t\/\/ Check that the Stream Footer doesn't specify something\n\t\t\t\/\/ that we don't support. This can only happen if the xz\n\t\t\t\/\/ version is older than liblzma and liblzma supports\n\t\t\t\/\/ something new.\n\t\t\t\/\/\n\t\t\t\/\/ It is enough to check Stream Footer. Stream Header must\n\t\t\t\/\/ match when it is compared against Stream Footer with\n\t\t\t\/\/ lzma_stream_flags_compare().\n\t\t\tif (footer_flags.version != 0)\n\t\t\t\tthrow gcnew InvalidDataException(message_strm(LZMA_OPTIONS_ERROR));\n\n\t\t\t\/\/ Check that the size of the Index field looks sane.\n\t\t\tlzma_vli index_size = footer_flags.backward_size;\n\t\t\tif ((lzma_vli)(pos) < index_size + LZMA_STREAM_HEADER_SIZE)\n\t\t\t\tthrow gcnew InvalidDataException(message_strm(LZMA_DATA_ERROR));\n\n\t\t\t\/\/ Set pos to the beginning of the Index.\n\t\t\tpos -= index_size;\n\n\t\t\t\/\/ Decode the Index.\n\t\t\tret = lzma_index_decoder(&strm, &this_index, UINT64_MAX);\n\t\t\tif (ret != LZMA_OK)\n\t\t\t\tthrow gcnew InvalidDataException(message_strm(ret));\n\n\t\t\tdo {\n\t\t\t\t\/\/ Don't give the decoder more input than the\n\t\t\t\t\/\/ Index size.\n\t\t\t\tstrm.avail_in = (size_t)(IO_BUFFER_SIZE < index_size ? IO_BUFFER_SIZE : index_size);\n\t\t\t\tio_pread(stream, nums, strm.avail_in, pos);\n\n\t\t\t\tpos += strm.avail_in;\n\t\t\t\tindex_size -= strm.avail_in;\n\n\t\t\t\tstrm.next_in = buf_u8;\n\t\t\t\tret = lzma_code(&strm, LZMA_RUN);\n\n\t\t\t} while (ret == LZMA_OK);\n\n\t\t\t\/\/ If the decoding seems to be successful, check also that\n\t\t\t\/\/ the Index decoder consumed as much input as indicated\n\t\t\t\/\/ by the Backward Size field.\n\t\t\tif (ret == LZMA_STREAM_END)\n\t\t\t\tif (index_size != 0 || strm.avail_in != 0)\n\t\t\t\t\tret = LZMA_DATA_ERROR;\n\n\t\t\tif (ret != LZMA_STREAM_END) {\n\t\t\t\t\/\/ LZMA_BUFFER_ERROR means that the Index decoder\n\t\t\t\t\/\/ would have liked more input than what the Index\n\t\t\t\t\/\/ size should be according to Stream Footer.\n\t\t\t\t\/\/ The message for LZMA_DATA_ERROR makes more\n\t\t\t\t\/\/ sense in that case.\n\t\t\t\tif (ret == LZMA_BUF_ERROR)\n\t\t\t\t\tret = LZMA_DATA_ERROR;\n\n\t\t\t\tthrow gcnew InvalidDataException(message_strm(ret));\n\t\t\t}\n\n\t\t\t\/\/ Decode the Stream Header and check that its Stream Flags\n\t\t\t\/\/ match the Stream Footer.\n\t\t\tpos -= footer_flags.backward_size + LZMA_STREAM_HEADER_SIZE;\n\t\t\tif ((lzma_vli)(pos) < lzma_index_total_size(this_index))\n\t\t\t\tthrow gcnew InvalidDataException(message_strm(LZMA_DATA_ERROR));\n\n\t\t\tpos -= lzma_index_total_size(this_index);\n\t\t\tio_pread(stream, nums, LZMA_STREAM_HEADER_SIZE, pos);\n\n\t\t\tret = lzma_stream_header_decode(&header_flags, buf_u8);\n\t\t\tif (ret != LZMA_OK)\n\t\t\t\tthrow gcnew InvalidDataException(message_strm(ret));\n\n\t\t\tret = lzma_stream_flags_compare(&header_flags, &footer_flags);\n\t\t\tif (ret != LZMA_OK)\n\t\t\t\tthrow gcnew InvalidDataException(message_strm(ret));\n\n\t\t\t\/\/ Store the decoded Stream Flags into this_index. This is\n\t\t\t\/\/ needed so that we can print which Check is used in each\n\t\t\t\/\/ Stream.\n\t\t\tret = lzma_index_stream_flags(this_index, &footer_flags);\n\t\t\tif (ret != LZMA_OK)\n\t\t\t\tthrow gcnew InvalidOperationException(message_strm(ret));\n\n\t\t\t\/\/ Store also the size of the Stream Padding field. It is\n\t\t\t\/\/ needed to show the offsets of the Streams correctly.\n\t\t\tret = lzma_index_stream_padding(this_index, stream_padding);\n\t\t\tif (ret != LZMA_OK)\n\t\t\t\tthrow gcnew InvalidOperationException(message_strm(ret));\n\n\t\t\tif (combined_index != NULL) {\n\t\t\t\t\/\/ Append the earlier decoded Indexes\n\t\t\t\t\/\/ after this_index.\n\t\t\t\tret = lzma_index_cat(\n\t\t\t\t\tthis_index, combined_index, NULL);\n\t\t\t\tif (ret != LZMA_OK)\n\t\t\t\t\tthrow gcnew InvalidOperationException(message_strm(ret));\n\t\t\t}\n\n\t\t\tcombined_index = this_index;\n\t\t\tthis_index = NULL;\n\n\t\t\txfi->stream_padding += stream_padding;\n\n\t\t} while (pos > 0);\n\n\t\t\/\/ All OK. Make combined_index available to the caller.\n\t\txfi->idx = combined_index;\n\n\n\t\txfbi->stream_count = lzma_index_stream_count(xfi->idx);\n\t\txfbi->block_count = lzma_index_block_count(xfi->idx);\n\t\txfbi->file_size = lzma_index_file_size(xfi->idx);\n\t\txfbi->uncompressed_size = lzma_index_uncompressed_size(xfi->idx);\n\t}\n\tfinally\n\t{\n\t\tlzma_end(&strm);\n\t\tlzma_index_end(combined_index, NULL);\n\t\tlzma_index_end(this_index, NULL);\n\t}\n}\n\nint liblzma_wrapper::LZMAStream::Read(cli::array<unsigned char, 1> ^buffer, int offset, int size)\n{\n\tif (bCompress)\n\t\tthrow gcnew InvalidOperationException(\"Operation not supported\");\n\n\tif (strm->avail_in == 0)\n\t{\n\t\tstrm->avail_in = stream->Read(gc_buf, 0, gc_buf->Length);\n\t\tpin_ptr<Byte> pp_inbuf = &gc_buf[0];\n\t\tstrm->next_in = pp_inbuf;\n\t}\n\n\n\tpin_ptr<Byte> pp_outbuf = &buffer[0];\n\tstrm->next_out = pp_outbuf + offset;\n\tstrm->avail_out = size;\n\n\tret = lzma_code(strm, LZMA_RUN);\n\n\tif (ret != LZMA_OK && ret != LZMA_STREAM_END)\n\t\tthrow gcnew InvalidOperationException(message_strm(ret));\n\n\treturn size - strm->avail_out;\n}\n\nvoid liblzma_wrapper::LZMAStream::Flush()\n{\n\tif (bCompress)\n\t{\n\t\tdo\n\t\t{\n\t\t\tstrm->next_in = nullptr;\n\t\t\tstrm->avail_in = 0;\n\n\t\t\tpin_ptr<Byte> pp_outbuf = &gc_buf[0];\n\t\t\tstrm->next_out = pp_outbuf;\n\t\t\tsize_t outlen = gc_buf->Length;\n\t\t\tstrm->avail_out = outlen;\n\n\t\t\tret = lzma_code(strm, LZMA_FINISH);\n\n\t\t\tif (ret != LZMA_OK && ret != LZMA_STREAM_END)\n\t\t\t\tthrow gcnew InvalidOperationException(message_strm(ret));\n\n\t\t\tint64_t avail = outlen - strm->avail_out;\n\t\t\tif (avail > 0)\n\t\t\t\tstream->Write(gc_buf, 0, (int)avail);\n\t\t} while (strm->avail_in > 0);\n\t}\n}\n\nvoid liblzma_wrapper::LZMAStream::Write(cli::array<unsigned char, 1> ^buffer, int offset, int size)\n{\n\tif (!bCompress)\n\t\tthrow gcnew InvalidOperationException(\"Operation not supported\");\n\n\tpin_ptr<Byte> pp_inbuf = &buffer[0];\n\tstrm->next_in = pp_inbuf + offset;\n\tstrm->avail_in = size;\n\n\twhile (strm->avail_in > 0)\n\t{\n\t\tpin_ptr<Byte> pp_outbuf = &gc_buf[0];\n\t\tstrm->next_out = pp_outbuf;\n\t\tsize_t outlen = gc_buf->Length;\n\t\tstrm->avail_out = outlen;\n\n\t\tret = lzma_code(strm, LZMA_RUN);\n\n\t\tif (ret != LZMA_OK && ret != LZMA_STREAM_END)\n\t\t\tthrow gcnew InvalidOperationException(message_strm(ret));\n\n\t\tint64_t avail = outlen - strm->avail_out;\n\t\tif (avail > 0)\n\t\t\tstream->Write(gc_buf, 0, (int)avail);\n\t}\n}\n<|endoftext|>"} {"text":"<commit_before>\/*=========================================================================\n\n Program: Visualization Toolkit\n Module: vtkImagePipe.cxx\n\n Copyright (c) John Baxter, Robarts Research Institute\n All rights reserved.\n\n This software is distributed WITHOUT ANY WARRANTY; without even\n the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR\n PURPOSE. See the above copyright notice for more information.\n\n=========================================================================*\/\n#include \"vtkImagePipe.h\"\n\n#include \"vtkObjectFactory.h\"\n#include \"vtkDataArray.h\"\n#include \"vtkUnsignedCharArray.h\"\n#include \"vtkCriticalSection.h\"\n#include \"vtkTimerLog.h\"\n\n#include \"vtkPointData.h\"\n\n#include <iostream>\n\n#include <unistd.h>\n\nvtkStandardNewMacro(vtkImagePipe);\n\nextern \"C\"\nstruct vtkImagePipeInitData {\n\tint extent[6];\n\tdouble origin[3];\n\tdouble spacing[3];\n\tint scalarType;\n\tint scalarSize;\n\tint numComponents;\n\tint imageSize; \/\/can also be used to weakly confirm data integrity\n};\n\n\n\/\/----------------------------------------------------------------------------\nvtkImagePipe::vtkImagePipe()\n{\n\t\/\/set some reasonable default values\n\tthis->Initialized = 0;\n\n\tthis->controller = vtkSocketController::New();\n\tthis->controller->Initialize();\n\tthreader = vtkMultiThreader::New();\n\n\t\/\/initialize to neither client nor server, but unset\n\tthis->isServer = false;\n\tthis->serverSet = false;\n\tthis->portNumber = -1;\n\tthis->IPAddress = 0;\n\tthis->serverSocket = 0;\n\tthis->clientSocket = 0;\n\tthis->buffer = 0;\n\tthis->ImageSize = 0;\n\n\t\/\/initialize the mutex locks\n\tthis->newThreadLock = vtkMutexLock::New();\n\tthis->rwBufferLock = vtkReadWriteLock::New();\n\n}\n\n\/\/----------------------------------------------------------------------------\nvtkImagePipe::~vtkImagePipe()\n{\n this->ReleaseSystemResources();\n this->newThreadLock->Delete();\n this->rwBufferLock->Delete();\n this->threader->Delete();\n} \n\n\/\/----------------------------------------------------------------------------\nvoid vtkImagePipe::ReleaseSystemResources()\n{\n\tif( !this->Initialized ) return;\n\n\tif( !this->isServer ){\n\t\tint request = -1;\n\t\tthis->clientSocket->Send( (void*) &request, sizeof(request) );\n\t\tthis->clientSocket->CloseSocket();\n\t}else{\n\t\tthis->threader->TerminateThread( this->mainServerThread );\n\t}\n\n\tif( this->serverSocket ){\n\t\tthis->serverSocket->CloseSocket();\n\t\tthis->serverSocket->Delete();\n\t\tthis->serverSocket = 0;\n\t}\n\tif( this->clientSocket ){\n\t\tthis->clientSocket->CloseSocket();\n\t\tthis->clientSocket->Delete();\n\t\tthis->clientSocket = 0;\n\t}\n\tthis->portNumber = -1;\n\tthis->IPAddress = 0;\n\tthis->isServer = false;\n\tthis->serverSet = false;\n\tthis->Initialized = 0;\n}\n\n\/\/----------------------------------------------------------------------------\nvoid vtkImagePipe::SetInput( vtkImageData* in ){\n\tif( !this->serverSet || !this->isServer ){\n\t\tvtkErrorMacro(<<\"Must be in server mode.\");\n\t\treturn;\n\t}\n\n\tthis->buffer = in;\n}\n\n\/\/----------------------------------------------------------------------------\nvtkImageData* vtkImagePipe::GetOutput( ){\n\tif( !this->serverSet || this->isServer ){\n\t\tvtkErrorMacro(<<\"Must be in client mode.\");\n\t\treturn 0 ;\n\t}\n\tif( !this->Initialized ){\n\t\tvtkErrorMacro(<<\"Must be initialized first.\");\n\t\treturn 0 ;\n\t}\n\n\treturn this->buffer;\n}\n\n\/\/----------------------------------------------------------------------------\nvoid vtkImagePipe::SetAsServer( bool isServer ){\n\n\t\/\/ if we are already initialized, you cannot set the server status\n\tif (this->Initialized){\n\t\tvtkErrorMacro(<<\"Must uninitialize before changing parameters.\");\n\t\treturn;\n\t}\n\n\tthis->isServer = isServer;\n\tif( this->serverSocket ){\n\t\tthis->serverSocket->CloseSocket();\n\t\tthis->serverSocket->Delete();\n\t\tthis->serverSocket = 0;\n\t}\n\tif( this->clientSocket ){\n\t\tthis->clientSocket->CloseSocket();\n\t\tthis->clientSocket->Delete();\n\t\tthis->clientSocket = 0;\n\t}\n\tif( isServer ) this->serverSocket = vtkServerSocket::New();\n\telse this->clientSocket = vtkClientSocket::New();\n\tthis->serverSet = true;\n}\n\nvoid vtkImagePipe::SetSourceAddress( char* ipAddress, int portNumber ){\n\t\n\t\/\/ if we are already initialized, you cannot set the server status\n\tif (this->Initialized){\n\t\tvtkErrorMacro(<<\"Must uninitialize before changing parameters.\");\n\t\treturn;\n\t}\n\n\tif( portNumber < 0 ) {\n\t\tvtkErrorMacro(<<\"Invalid port number.\");\n\t\treturn;\n\t}\n\n\tif( !this->serverSet ) {\n\t\tvtkErrorMacro(<<\"Must first specify whether client or server using SetAsServer().\");\n\t\treturn;\n\t}\n\n\tif( this->isServer ){\n\t\tif( this->serverSocket->CreateServer( portNumber ) ){\n\t\t\tvtkErrorMacro(<<\"Could not connect to port.\");\n\t\t\treturn;\n\t\t}else{\n\t\t\tthis->portNumber = portNumber;\n\t\t}\n\t}else{\n\t\tthis->IPAddress = ipAddress;\n\t\tthis->portNumber = portNumber;\n\t}\n}\n\n\/\/----------------------------------------------------------------------------\nvoid vtkImagePipe::PrintSelf(ostream& os, vtkIndent indent)\n{\n\n}\n\n\/\/----------------------------------------------------------------------------\nvoid vtkImagePipe::Initialize()\n{\n\t\/\/ if we are already initialized, do not initialize again\n\tif (this->Initialized){\n\t\treturn;\n\t}\n\n\t\/\/if we haven't set the client-server status, \n\tif ( !this->serverSet || this->portNumber == -1 ){\n\t\tvtkErrorMacro(<<\"Set the client\/server settings before initialization.\");\n\t\treturn;\n\t}\n\n\t\/\/if we are the server, make sure we have input set\n\tif( this->isServer ){\n\t\tif( !this->buffer ){\n\t\t\tvtkErrorMacro(<<\"Need to set the input.\");\n\t\t\treturn;\n\t\t}\n\t\tthis->mainServerThread = this->threader->SpawnThread( (vtkThreadFunctionType) &FirstServerSideUpdate, (void*) this );\n\t}\n\n\t\/\/create the connection if a client\n\tif( !this->isServer ){\n\t\tint connectedStatus = this->clientSocket->ConnectToServer( this->IPAddress, this->portNumber );\n\t\tif( connectedStatus ){\n\t\t\tvtkErrorMacro(<<\"Could not connect to server side socket.\");\n\t\t\treturn;\n\t\t}\n\t}\n\n\t\/\/create output buffer if client\n\tif( !this->isServer ){\n\t\tbuffer = vtkImageData::New();\n\t}\n\n\t\/\/ Initialization worked\n\tthis->Initialized = 1;\n\n} \n\nvoid* vtkImagePipe::FirstServerSideUpdate(vtkMultiThreader::ThreadInfo *data){\n\t\n\tvtkImagePipe *self = (vtkImagePipe *)(data->UserData);\n\t\n\t\/\/enter the infinite loop\n\twhile(true){\n\t\t\/\/check for any new clients\n\t\tvtkClientSocket* newClient = self->serverSocket->WaitForConnection(1);\n\t\tif( newClient ){\n\t\t\tself->newThreadLock->Lock();\n\t\t\tself->clientSocket = newClient;\n\t\t\tself->threader->SpawnThread( (vtkThreadFunctionType) &ServerSideUpdate, (void*) self );\n\t\t}else{\n\t\t\tsleep( 100 );\n\t\t}\n\t}\n\treturn 0;\n\n}\n\nvoid* vtkImagePipe::ServerSideUpdate(vtkMultiThreader::ThreadInfo *data){\n\t\n\t\/\/collect server and client information\n\tvtkImagePipe *self = (vtkImagePipe *)(data->UserData);\n\tvtkClientSocket* client = self->clientSocket;\n\tself->newThreadLock->Unlock();\n\n\t\/\/enter the infinite loop\n\twhile(true){\n\n\t\t\/\/if we have a request, push data onto the pipe\n\t\tint request = 0;\n\t\tint amount = client->Receive( &request, sizeof(request), 1 );\n\t\tif( amount == 0 ) break;\n\t\telse if( amount < sizeof(request) ) continue;\n\t\telse if( request != 1 ) break;\n\t\t\n\t\t\/\/read lock the buffer\n\t\tself->rwBufferLock->ReaderLock();\n\n\t\t\/\/create the info structure\n\t\tvtkImagePipeInitData initData;\n\t\tself->buffer->GetExtent( initData.extent );\n\t\tself->buffer->GetSpacing( initData.spacing );\n\t\tself->buffer->GetOrigin( initData.origin );\n\t\tinitData.scalarType = self->buffer->GetScalarType();\n\t\tinitData.numComponents = self->buffer->GetNumberOfScalarComponents();\n\t\tinitData.scalarSize = self->buffer->GetScalarSize();\n\t\tinitData.imageSize = (initData.extent[1] - initData.extent[0] + 1) *\n\t\t\t\t\t\t\t\t(initData.extent[3] - initData.extent[2] + 1) *\n\t\t\t\t\t\t\t\t(initData.extent[5] - initData.extent[4] + 1) *\n\t\t\t\t\t\t\t\tinitData.numComponents * initData.scalarSize;\n\t\tself->ImageSize = initData.imageSize;\n\n\t\t\/\/send over the data\n\t\tclient->Send( (void*) &initData, sizeof(initData) );\n\t\tclient->Send( self->buffer->GetScalarPointer(), self->ImageSize );\n\t\t\n\t\t\/\/read unlock the buffer\n\t\tself->rwBufferLock->ReaderUnlock();\n\n\t}\n\n\tclient->CloseSocket();\n\treturn 0;\n\n}\n\nvoid vtkImagePipe::Update(){\n\tif( !this->Initialized ) return;\n\tif( this->isServer ){\n\t\t\/\/protect buffer updating with read\/write lock\n\t\tthis->rwBufferLock->WriterLock();\n\t\tthis->buffer->Update();\n\t\tthis->rwBufferLock->WriterUnlock();\n\t}else{\n\t\tClientSideUpdate();\n\t}\n}\n\nvoid vtkImagePipe::ClientSideUpdate(){\n\n\t\/\/send input request\n\tint request = 1;\n\tint serverThere = this->clientSocket->Send( &request, sizeof(request) );\n\tif( !serverThere ){\n\t\tvtkErrorMacro(<<\"Server unavailable.\");\n\t\treturn;\n\t}\n\n\t\/\/collect input parameters and change the output buffer if needed\n\tvtkImagePipeInitData initData;\n\tserverThere = clientSocket->Receive( (void*) &initData, sizeof(initData), 1 );\n\tif( !serverThere ){\n\t\tvtkErrorMacro(<<\"Server unavailable.\");\n\t\treturn;\n\t}\n\tthis->buffer->SetSpacing( initData.spacing );\n\tthis->buffer->SetOrigin( initData.origin );\n\tthis->buffer->SetExtent( initData.extent );\n\tthis->buffer->SetNumberOfScalarComponents( initData.numComponents );\n\tthis->buffer->SetScalarType( initData.scalarType );\n\tint calcImageSize = (initData.extent[1] - initData.extent[0] + 1) *\n\t\t\t\t\t\t(initData.extent[3] - initData.extent[2] + 1) *\n\t\t\t\t\t\t(initData.extent[5] - initData.extent[4] + 1) *\n\t\t\t\t\t\tinitData.numComponents * initData.scalarSize;\n\tthis->ImageSize = initData.imageSize;\n\tif( this->ImageSize != calcImageSize ){\n\t\tvtkErrorMacro(<<\"Image information packet does not conform to the image size error check.\");\n\t\treturn;\n\t}\n\tthis->buffer->AllocateScalars();\n\n\t\/\/grab the data from the socket\n\tserverThere = this->clientSocket->Receive( this->buffer->GetScalarPointer(), this->ImageSize, 1 );\n\tif( !serverThere ){\n\t\tvtkErrorMacro(<<\"Server unavailable.\");\n\t\treturn;\n\t}\n\n}\n<commit_msg>FIX: Sleep command should now be OS independent.<commit_after>\/*=========================================================================\n\n Program: Visualization Toolkit\n Module: vtkImagePipe.cxx\n\n Copyright (c) John Baxter, Robarts Research Institute\n All rights reserved.\n\n This software is distributed WITHOUT ANY WARRANTY; without even\n the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR\n PURPOSE. See the above copyright notice for more information.\n\n=========================================================================*\/\n#include \"vtkImagePipe.h\"\n\n#include \"vtkObjectFactory.h\"\n#include \"vtkDataArray.h\"\n#include \"vtkUnsignedCharArray.h\"\n#include \"vtkCriticalSection.h\"\n#include \"vtkTimerLog.h\"\n\n#include \"vtkPointData.h\"\n\n#include <iostream>\n\nvtkStandardNewMacro(vtkImagePipe);\n\nextern \"C\"\nstruct vtkImagePipeInitData {\n\tint extent[6];\n\tdouble origin[3];\n\tdouble spacing[3];\n\tint scalarType;\n\tint scalarSize;\n\tint numComponents;\n\tint imageSize; \/\/can also be used to weakly confirm data integrity\n};\n\n\n\/\/----------------------------------------------------------------------------\nvtkImagePipe::vtkImagePipe()\n{\n\t\/\/set some reasonable default values\n\tthis->Initialized = 0;\n\n\tthis->controller = vtkSocketController::New();\n\tthis->controller->Initialize();\n\tthreader = vtkMultiThreader::New();\n\n\t\/\/initialize to neither client nor server, but unset\n\tthis->isServer = false;\n\tthis->serverSet = false;\n\tthis->portNumber = -1;\n\tthis->IPAddress = 0;\n\tthis->serverSocket = 0;\n\tthis->clientSocket = 0;\n\tthis->buffer = 0;\n\tthis->ImageSize = 0;\n\n\t\/\/initialize the mutex locks\n\tthis->newThreadLock = vtkMutexLock::New();\n\tthis->rwBufferLock = vtkReadWriteLock::New();\n\n}\n\n\/\/----------------------------------------------------------------------------\nvtkImagePipe::~vtkImagePipe()\n{\n this->ReleaseSystemResources();\n this->newThreadLock->Delete();\n this->rwBufferLock->Delete();\n this->threader->Delete();\n} \n\n\/\/----------------------------------------------------------------------------\nvoid vtkImagePipe::ReleaseSystemResources()\n{\n\tif( !this->Initialized ) return;\n\n\tif( !this->isServer ){\n\t\tint request = -1;\n\t\tthis->clientSocket->Send( (void*) &request, sizeof(request) );\n\t\tthis->clientSocket->CloseSocket();\n\t}else{\n\t\tthis->threader->TerminateThread( this->mainServerThread );\n\t}\n\n\tif( this->serverSocket ){\n\t\tthis->serverSocket->CloseSocket();\n\t\tthis->serverSocket->Delete();\n\t\tthis->serverSocket = 0;\n\t}\n\tif( this->clientSocket ){\n\t\tthis->clientSocket->CloseSocket();\n\t\tthis->clientSocket->Delete();\n\t\tthis->clientSocket = 0;\n\t}\n\tthis->portNumber = -1;\n\tthis->IPAddress = 0;\n\tthis->isServer = false;\n\tthis->serverSet = false;\n\tthis->Initialized = 0;\n}\n\n\/\/----------------------------------------------------------------------------\nvoid vtkImagePipe::SetInput( vtkImageData* in ){\n\tif( !this->serverSet || !this->isServer ){\n\t\tvtkErrorMacro(<<\"Must be in server mode.\");\n\t\treturn;\n\t}\n\n\tthis->buffer = in;\n}\n\n\/\/----------------------------------------------------------------------------\nvtkImageData* vtkImagePipe::GetOutput( ){\n\tif( !this->serverSet || this->isServer ){\n\t\tvtkErrorMacro(<<\"Must be in client mode.\");\n\t\treturn 0 ;\n\t}\n\tif( !this->Initialized ){\n\t\tvtkErrorMacro(<<\"Must be initialized first.\");\n\t\treturn 0 ;\n\t}\n\n\treturn this->buffer;\n}\n\n\/\/----------------------------------------------------------------------------\nvoid vtkImagePipe::SetAsServer( bool isServer ){\n\n\t\/\/ if we are already initialized, you cannot set the server status\n\tif (this->Initialized){\n\t\tvtkErrorMacro(<<\"Must uninitialize before changing parameters.\");\n\t\treturn;\n\t}\n\n\tthis->isServer = isServer;\n\tif( this->serverSocket ){\n\t\tthis->serverSocket->CloseSocket();\n\t\tthis->serverSocket->Delete();\n\t\tthis->serverSocket = 0;\n\t}\n\tif( this->clientSocket ){\n\t\tthis->clientSocket->CloseSocket();\n\t\tthis->clientSocket->Delete();\n\t\tthis->clientSocket = 0;\n\t}\n\tif( isServer ) this->serverSocket = vtkServerSocket::New();\n\telse this->clientSocket = vtkClientSocket::New();\n\tthis->serverSet = true;\n}\n\nvoid vtkImagePipe::SetSourceAddress( char* ipAddress, int portNumber ){\n\t\n\t\/\/ if we are already initialized, you cannot set the server status\n\tif (this->Initialized){\n\t\tvtkErrorMacro(<<\"Must uninitialize before changing parameters.\");\n\t\treturn;\n\t}\n\n\tif( portNumber < 0 ) {\n\t\tvtkErrorMacro(<<\"Invalid port number.\");\n\t\treturn;\n\t}\n\n\tif( !this->serverSet ) {\n\t\tvtkErrorMacro(<<\"Must first specify whether client or server using SetAsServer().\");\n\t\treturn;\n\t}\n\n\tif( this->isServer ){\n\t\tif( this->serverSocket->CreateServer( portNumber ) ){\n\t\t\tvtkErrorMacro(<<\"Could not connect to port.\");\n\t\t\treturn;\n\t\t}else{\n\t\t\tthis->portNumber = portNumber;\n\t\t}\n\t}else{\n\t\tthis->IPAddress = ipAddress;\n\t\tthis->portNumber = portNumber;\n\t}\n}\n\n\/\/----------------------------------------------------------------------------\nvoid vtkImagePipe::PrintSelf(ostream& os, vtkIndent indent)\n{\n\n}\n\n\/\/----------------------------------------------------------------------------\nvoid vtkImagePipe::Initialize()\n{\n\t\/\/ if we are already initialized, do not initialize again\n\tif (this->Initialized){\n\t\treturn;\n\t}\n\n\t\/\/if we haven't set the client-server status, \n\tif ( !this->serverSet || this->portNumber == -1 ){\n\t\tvtkErrorMacro(<<\"Set the client\/server settings before initialization.\");\n\t\treturn;\n\t}\n\n\t\/\/if we are the server, make sure we have input set\n\tif( this->isServer ){\n\t\tif( !this->buffer ){\n\t\t\tvtkErrorMacro(<<\"Need to set the input.\");\n\t\t\treturn;\n\t\t}\n\t\tthis->mainServerThread = this->threader->SpawnThread( (vtkThreadFunctionType) &FirstServerSideUpdate, (void*) this );\n\t}\n\n\t\/\/create the connection if a client\n\tif( !this->isServer ){\n\t\tint connectedStatus = this->clientSocket->ConnectToServer( this->IPAddress, this->portNumber );\n\t\tif( connectedStatus ){\n\t\t\tvtkErrorMacro(<<\"Could not connect to server side socket.\");\n\t\t\treturn;\n\t\t}\n\t}\n\n\t\/\/create output buffer if client\n\tif( !this->isServer ){\n\t\tbuffer = vtkImageData::New();\n\t}\n\n\t\/\/ Initialization worked\n\tthis->Initialized = 1;\n\n} \n\n\/\/----------------------------------------------------------------------------\n\/\/ platform-independent sleep function\nstatic inline void vtkSleep(double duration)\n{\n duration = duration; \/\/ avoid warnings\n \/\/ sleep according to OS preference\n#ifdef _WIN32\n Sleep((int)(1000*duration));\n#elif defined(__FreeBSD__) || defined(__linux__) || defined(sgi)\n struct timespec sleep_time, dummy;\n sleep_time.tv_sec = (int)duration;\n sleep_time.tv_nsec = (int)(1000000000*(duration-sleep_time.tv_sec));\n nanosleep(&sleep_time,&dummy);\n#endif\n}\n\/\/----------------------------------------------------------------------------\n\nvoid* vtkImagePipe::FirstServerSideUpdate(vtkMultiThreader::ThreadInfo *data){\n\t\n\tvtkImagePipe *self = (vtkImagePipe *)(data->UserData);\n\t\n\t\/\/enter the infinite loop\n\twhile(true){\n\t\t\/\/check for any new clients\n\t\tvtkClientSocket* newClient = self->serverSocket->WaitForConnection(1);\n\t\tif( newClient ){\n\t\t\tself->newThreadLock->Lock();\n\t\t\tself->clientSocket = newClient;\n\t\t\tself->threader->SpawnThread( (vtkThreadFunctionType) &ServerSideUpdate, (void*) self );\n\t\t}else{\n\t\t\tvtkSleep(100);\n\t\t}\n\t}\n\treturn 0;\n\n}\n\nvoid* vtkImagePipe::ServerSideUpdate(vtkMultiThreader::ThreadInfo *data){\n\t\n\t\/\/collect server and client information\n\tvtkImagePipe *self = (vtkImagePipe *)(data->UserData);\n\tvtkClientSocket* client = self->clientSocket;\n\tself->newThreadLock->Unlock();\n\n\t\/\/enter the infinite loop\n\twhile(true){\n\n\t\t\/\/if we have a request, push data onto the pipe\n\t\tint request = 0;\n\t\tint amount = client->Receive( &request, sizeof(request), 1 );\n\t\tif( amount == 0 ) break;\n\t\telse if( amount < sizeof(request) ) continue;\n\t\telse if( request != 1 ) break;\n\t\t\n\t\t\/\/read lock the buffer\n\t\tself->rwBufferLock->ReaderLock();\n\n\t\t\/\/create the info structure\n\t\tvtkImagePipeInitData initData;\n\t\tself->buffer->GetExtent( initData.extent );\n\t\tself->buffer->GetSpacing( initData.spacing );\n\t\tself->buffer->GetOrigin( initData.origin );\n\t\tinitData.scalarType = self->buffer->GetScalarType();\n\t\tinitData.numComponents = self->buffer->GetNumberOfScalarComponents();\n\t\tinitData.scalarSize = self->buffer->GetScalarSize();\n\t\tinitData.imageSize = (initData.extent[1] - initData.extent[0] + 1) *\n\t\t\t\t\t\t\t\t(initData.extent[3] - initData.extent[2] + 1) *\n\t\t\t\t\t\t\t\t(initData.extent[5] - initData.extent[4] + 1) *\n\t\t\t\t\t\t\t\tinitData.numComponents * initData.scalarSize;\n\t\tself->ImageSize = initData.imageSize;\n\n\t\t\/\/send over the data\n\t\tclient->Send( (void*) &initData, sizeof(initData) );\n\t\tclient->Send( self->buffer->GetScalarPointer(), self->ImageSize );\n\t\t\n\t\t\/\/read unlock the buffer\n\t\tself->rwBufferLock->ReaderUnlock();\n\n\t}\n\n\tclient->CloseSocket();\n\treturn 0;\n\n}\n\nvoid vtkImagePipe::Update(){\n\tif( !this->Initialized ) return;\n\tif( this->isServer ){\n\t\t\/\/protect buffer updating with read\/write lock\n\t\tthis->rwBufferLock->WriterLock();\n\t\tthis->buffer->Update();\n\t\tthis->rwBufferLock->WriterUnlock();\n\t}else{\n\t\tClientSideUpdate();\n\t}\n}\n\nvoid vtkImagePipe::ClientSideUpdate(){\n\n\t\/\/send input request\n\tint request = 1;\n\tint serverThere = this->clientSocket->Send( &request, sizeof(request) );\n\tif( !serverThere ){\n\t\tvtkErrorMacro(<<\"Server unavailable.\");\n\t\treturn;\n\t}\n\n\t\/\/collect input parameters and change the output buffer if needed\n\tvtkImagePipeInitData initData;\n\tserverThere = clientSocket->Receive( (void*) &initData, sizeof(initData), 1 );\n\tif( !serverThere ){\n\t\tvtkErrorMacro(<<\"Server unavailable.\");\n\t\treturn;\n\t}\n\tthis->buffer->SetSpacing( initData.spacing );\n\tthis->buffer->SetOrigin( initData.origin );\n\tthis->buffer->SetExtent( initData.extent );\n\tthis->buffer->SetNumberOfScalarComponents( initData.numComponents );\n\tthis->buffer->SetScalarType( initData.scalarType );\n\tint calcImageSize = (initData.extent[1] - initData.extent[0] + 1) *\n\t\t\t\t\t\t(initData.extent[3] - initData.extent[2] + 1) *\n\t\t\t\t\t\t(initData.extent[5] - initData.extent[4] + 1) *\n\t\t\t\t\t\tinitData.numComponents * initData.scalarSize;\n\tthis->ImageSize = initData.imageSize;\n\tif( this->ImageSize != calcImageSize ){\n\t\tvtkErrorMacro(<<\"Image information packet does not conform to the image size error check.\");\n\t\treturn;\n\t}\n\tthis->buffer->AllocateScalars();\n\n\t\/\/grab the data from the socket\n\tserverThere = this->clientSocket->Receive( this->buffer->GetScalarPointer(), this->ImageSize, 1 );\n\tif( !serverThere ){\n\t\tvtkErrorMacro(<<\"Server unavailable.\");\n\t\treturn;\n\t}\n\n}\n<|endoftext|>"} {"text":"<commit_before><commit_msg>Don't consider a certificate revoked if we don't have fresh revocation status of the certificate.<commit_after><|endoftext|>"} {"text":"<commit_before>\/\/ Copyright (c) 2014 GitHub, Inc. All rights reserved.\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\/ui\/views\/menu_bar.h\"\n\n#if defined(USE_X11)\n#include \"gtk\/gtk.h\"\n#endif\n\n#include \"atom\/browser\/ui\/views\/menu_delegate.h\"\n#include \"atom\/browser\/ui\/views\/submenu_button.h\"\n#include \"ui\/base\/models\/menu_model.h\"\n#include \"ui\/views\/background.h\"\n#include \"ui\/views\/layout\/box_layout.h\"\n\n#if defined(OS_WIN)\n#include \"ui\/gfx\/color_utils.h\"\n#elif defined(USE_X11)\n#include \"chrome\/browser\/ui\/libgtk2ui\/owned_widget_gtk2.h\"\n#include \"chrome\/browser\/ui\/libgtk2ui\/skia_utils_gtk2.h\"\n#endif\n\nnamespace atom {\n\nnamespace {\n\nconst char kViewClassName[] = \"AtomMenuBar\";\n\n\/\/ Default color of the menu bar.\nconst SkColor kDefaultColor = SkColorSetARGB(255, 233, 233, 233);\n\n#if defined(USE_X11)\nvoid GetMenuBarColor(SkColor* enabled, SkColor* disabled, SkColor* highlight,\n SkColor* hover, SkColor* background) {\n libgtk2ui::OwnedWidgetGtk fake_menu_bar;\n fake_menu_bar.Own(gtk_menu_bar_new());\n\n GtkStyle* style = gtk_rc_get_style(fake_menu_bar.get());\n *enabled = libgtk2ui::GdkColorToSkColor(style->fg[GTK_STATE_NORMAL]);\n *disabled = libgtk2ui::GdkColorToSkColor(style->fg[GTK_STATE_INSENSITIVE]);\n *highlight = libgtk2ui::GdkColorToSkColor(style->fg[GTK_STATE_SELECTED]);\n *hover = libgtk2ui::GdkColorToSkColor(style->fg[GTK_STATE_PRELIGHT]);\n *background = libgtk2ui::GdkColorToSkColor(style->bg[GTK_STATE_NORMAL]);\n}\n#endif\n\n} \/\/ namespace\n\nMenuBar::MenuBar()\n : background_color_(kDefaultColor),\n menu_model_(NULL) {\n#if defined(OS_WIN)\n background_color_ = color_utils::GetSysSkColor(COLOR_MENUBAR);\n#elif defined(USE_X11)\n GetMenuBarColor(&enabled_color_, &disabled_color_, &highlight_color_,\n &hover_color_, &background_color_);\n#endif\n\n set_background(views::Background::CreateSolidBackground(background_color_));\n SetLayoutManager(new views::BoxLayout(\n views::BoxLayout::kHorizontal, 0, 0, 0));\n}\n\nMenuBar::~MenuBar() {\n}\n\nvoid MenuBar::SetMenu(ui::MenuModel* model) {\n menu_model_ = model;\n RemoveAllChildViews(true);\n\n for (int i = 0; i < model->GetItemCount(); ++i) {\n SubmenuButton* button = new SubmenuButton(this, model->GetLabelAt(i), this);\n button->set_tag(i);\n\n#if defined(USE_X11)\n button->SetEnabledColor(enabled_color_);\n button->SetDisabledColor(disabled_color_);\n button->SetHighlightColor(highlight_color_);\n button->SetHoverColor(hover_color_);\n button->SetUnderlineColor(enabled_color_);\n#endif\n\n AddChildView(button);\n }\n}\n\nvoid MenuBar::SetAcceleratorVisibility(bool visible) {\n for (int i = 0; i < child_count(); ++i)\n static_cast<SubmenuButton*>(child_at(i))->SetAcceleratorVisibility(visible);\n}\n\nint MenuBar::GetAcceleratorIndex(base::char16 key) {\n for (int i = 0; i < child_count(); ++i) {\n SubmenuButton* button = static_cast<SubmenuButton*>(child_at(i));\n if (button->accelerator() == key)\n return i;\n }\n return -1;\n}\n\nvoid MenuBar::ActivateAccelerator(base::char16 key) {\n int i = GetAcceleratorIndex(key);\n if (i != -1) {\n SetAcceleratorVisibility(false);\n static_cast<SubmenuButton*>(child_at(i))->Activate();\n }\n}\n\nint MenuBar::GetItemCount() const {\n return menu_model_->GetItemCount();\n}\n\nbool MenuBar::GetMenuButtonFromScreenPoint(const gfx::Point& point,\n ui::MenuModel** menu_model,\n views::MenuButton** button) {\n gfx::Point location(point);\n views::View::ConvertPointFromScreen(this, &location);\n\n if (location.x() < 0 || location.x() >= width() || location.y() < 0 ||\n location.y() >= height())\n return false;\n\n for (int i = 0; i < child_count(); ++i) {\n views::View* view = child_at(i);\n if (view->bounds().Contains(location) &&\n (menu_model_->GetTypeAt(i) == ui::MenuModel::TYPE_SUBMENU)) {\n *menu_model = menu_model_->GetSubmenuModelAt(i);\n *button = static_cast<views::MenuButton*>(view);\n return true;\n }\n }\n\n return false;\n}\n\nconst char* MenuBar::GetClassName() const {\n return kViewClassName;\n}\n\nvoid MenuBar::ButtonPressed(views::Button* sender, const ui::Event& event) {\n}\n\nvoid MenuBar::OnMenuButtonClicked(views::View* source,\n const gfx::Point& point) {\n if (!menu_model_)\n return;\n\n views::MenuButton* button = static_cast<views::MenuButton*>(source);\n int id = button->tag();\n ui::MenuModel::ItemType type = menu_model_->GetTypeAt(id);\n if (type != ui::MenuModel::TYPE_SUBMENU)\n return;\n\n menu_delegate_.reset(new MenuDelegate(this));\n menu_delegate_->RunMenu(menu_model_->GetSubmenuModelAt(id), button);\n}\n\n} \/\/ namespace atom\n<commit_msg>views: Always hide accelerator when submenu is activated.<commit_after>\/\/ Copyright (c) 2014 GitHub, Inc. All rights reserved.\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\/ui\/views\/menu_bar.h\"\n\n#if defined(USE_X11)\n#include \"gtk\/gtk.h\"\n#endif\n\n#include \"atom\/browser\/ui\/views\/menu_delegate.h\"\n#include \"atom\/browser\/ui\/views\/submenu_button.h\"\n#include \"ui\/base\/models\/menu_model.h\"\n#include \"ui\/views\/background.h\"\n#include \"ui\/views\/layout\/box_layout.h\"\n\n#if defined(OS_WIN)\n#include \"ui\/gfx\/color_utils.h\"\n#elif defined(USE_X11)\n#include \"chrome\/browser\/ui\/libgtk2ui\/owned_widget_gtk2.h\"\n#include \"chrome\/browser\/ui\/libgtk2ui\/skia_utils_gtk2.h\"\n#endif\n\nnamespace atom {\n\nnamespace {\n\nconst char kViewClassName[] = \"AtomMenuBar\";\n\n\/\/ Default color of the menu bar.\nconst SkColor kDefaultColor = SkColorSetARGB(255, 233, 233, 233);\n\n#if defined(USE_X11)\nvoid GetMenuBarColor(SkColor* enabled, SkColor* disabled, SkColor* highlight,\n SkColor* hover, SkColor* background) {\n libgtk2ui::OwnedWidgetGtk fake_menu_bar;\n fake_menu_bar.Own(gtk_menu_bar_new());\n\n GtkStyle* style = gtk_rc_get_style(fake_menu_bar.get());\n *enabled = libgtk2ui::GdkColorToSkColor(style->fg[GTK_STATE_NORMAL]);\n *disabled = libgtk2ui::GdkColorToSkColor(style->fg[GTK_STATE_INSENSITIVE]);\n *highlight = libgtk2ui::GdkColorToSkColor(style->fg[GTK_STATE_SELECTED]);\n *hover = libgtk2ui::GdkColorToSkColor(style->fg[GTK_STATE_PRELIGHT]);\n *background = libgtk2ui::GdkColorToSkColor(style->bg[GTK_STATE_NORMAL]);\n}\n#endif\n\n} \/\/ namespace\n\nMenuBar::MenuBar()\n : background_color_(kDefaultColor),\n menu_model_(NULL) {\n#if defined(OS_WIN)\n background_color_ = color_utils::GetSysSkColor(COLOR_MENUBAR);\n#elif defined(USE_X11)\n GetMenuBarColor(&enabled_color_, &disabled_color_, &highlight_color_,\n &hover_color_, &background_color_);\n#endif\n\n set_background(views::Background::CreateSolidBackground(background_color_));\n SetLayoutManager(new views::BoxLayout(\n views::BoxLayout::kHorizontal, 0, 0, 0));\n}\n\nMenuBar::~MenuBar() {\n}\n\nvoid MenuBar::SetMenu(ui::MenuModel* model) {\n menu_model_ = model;\n RemoveAllChildViews(true);\n\n for (int i = 0; i < model->GetItemCount(); ++i) {\n SubmenuButton* button = new SubmenuButton(this, model->GetLabelAt(i), this);\n button->set_tag(i);\n\n#if defined(USE_X11)\n button->SetEnabledColor(enabled_color_);\n button->SetDisabledColor(disabled_color_);\n button->SetHighlightColor(highlight_color_);\n button->SetHoverColor(hover_color_);\n button->SetUnderlineColor(enabled_color_);\n#endif\n\n AddChildView(button);\n }\n}\n\nvoid MenuBar::SetAcceleratorVisibility(bool visible) {\n for (int i = 0; i < child_count(); ++i)\n static_cast<SubmenuButton*>(child_at(i))->SetAcceleratorVisibility(visible);\n}\n\nint MenuBar::GetAcceleratorIndex(base::char16 key) {\n for (int i = 0; i < child_count(); ++i) {\n SubmenuButton* button = static_cast<SubmenuButton*>(child_at(i));\n if (button->accelerator() == key)\n return i;\n }\n return -1;\n}\n\nvoid MenuBar::ActivateAccelerator(base::char16 key) {\n int i = GetAcceleratorIndex(key);\n if (i != -1)\n static_cast<SubmenuButton*>(child_at(i))->Activate();\n}\n\nint MenuBar::GetItemCount() const {\n return menu_model_->GetItemCount();\n}\n\nbool MenuBar::GetMenuButtonFromScreenPoint(const gfx::Point& point,\n ui::MenuModel** menu_model,\n views::MenuButton** button) {\n gfx::Point location(point);\n views::View::ConvertPointFromScreen(this, &location);\n\n if (location.x() < 0 || location.x() >= width() || location.y() < 0 ||\n location.y() >= height())\n return false;\n\n for (int i = 0; i < child_count(); ++i) {\n views::View* view = child_at(i);\n if (view->bounds().Contains(location) &&\n (menu_model_->GetTypeAt(i) == ui::MenuModel::TYPE_SUBMENU)) {\n *menu_model = menu_model_->GetSubmenuModelAt(i);\n *button = static_cast<views::MenuButton*>(view);\n return true;\n }\n }\n\n return false;\n}\n\nconst char* MenuBar::GetClassName() const {\n return kViewClassName;\n}\n\nvoid MenuBar::ButtonPressed(views::Button* sender, const ui::Event& event) {\n}\n\nvoid MenuBar::OnMenuButtonClicked(views::View* source,\n const gfx::Point& point) {\n \/\/ Hide the accelerator when a submenu is activated.\n SetAcceleratorVisibility(false);\n\n if (!menu_model_)\n return;\n\n views::MenuButton* button = static_cast<views::MenuButton*>(source);\n int id = button->tag();\n ui::MenuModel::ItemType type = menu_model_->GetTypeAt(id);\n if (type != ui::MenuModel::TYPE_SUBMENU)\n return;\n\n menu_delegate_.reset(new MenuDelegate(this));\n menu_delegate_->RunMenu(menu_model_->GetSubmenuModelAt(id), button);\n}\n\n} \/\/ namespace atom\n<|endoftext|>"} {"text":"<commit_before>#include <iostream>\n#include <unordered_map>\n#include <string>\n\n\nclass Node{\n public:\n std::unordered_map<char, Node*> values;\n bool end_word;\n \n Node():end_word{true}{}\n};\n\n\nclass Trie{\n private:\n Node root;\n Node * current;\n\n public:\n void add_word(const std::string & s){\n for (char c : s){\n if (root.\n }\n }\n};\n\nint main(){\n Trie a;\n a.add_word(\"abc\");\n\n return 0;\n}\n\n<commit_msg>working, but needs improvemnt when counting the elements<commit_after>#include <iostream>\n#include <unordered_map>\n#include <string>\n\n\nclass Node{\n public:\n std::unordered_map<char, Node*> hash;\n bool end_word;\n \n Node():end_word{false}{}\n\n ~Node(){\n for (auto it = hash.begin(); it != hash.end(); it++){\n delete it->second;\n }\n }\n\n};\n\n\nclass Trie{\n private:\n Node root;\n public:\n void add_word(const std::string & s){\n Node * aux = &root;\n for (int i=0; i < s.size(); i++){\n char c = s.at(i);\n std::unordered_map<char, Node*>::iterator it = aux->hash.find(c);\n if (it != aux->hash.end()){\n aux = it->second;\n }\n else {\n aux->hash.emplace(c, new Node());\n it = aux->hash.find(c);\n aux = it->second;\n }\n if (i==s.size()-1){\n aux->end_word = true;\n }\n }\n }\n \n void count_end_words(Node * aux, int & counter){\n if (aux->hash.empty()){\n return;\n }\n \n for(auto it = aux->hash.begin(); it!= aux->hash.end(); it++){\n if (it->second->end_word)\n counter++;\n count_end_words(it->second, counter);\n }\n }\n\n int count_words_starting_with(const std::string &s){\n Node * aux = &root;\n for (const char c : s){\n std::unordered_map<char, Node*>::iterator it = aux->hash.find(c);\n if (it == aux->hash.end()){\n \/**letter does not exist in the current branch, therefore, \n * the word does not exist in the trie *\/\n return 0;\n }\n aux = it->second;\n }\n int count = 0;\n if (aux->end_word)\n count++;\n count_end_words(aux, count);\n return count;\n }\n};\n\nint main(){\n int n;\n std::cin >> n;\n Trie trie;\n for(int i = 0; i < n; i++){\n std::string s;\n std::cin >> s;\n if(!s.compare(\"add\")){\n std::cin >> s;\n trie.add_word(s);\n } else {\n std::cin >> s;\n std::cout << trie.count_words_starting_with(s) << std::endl;\n }\n }\n\n return 0;\n}\n\n<|endoftext|>"} {"text":"<commit_before>\/*\r\n * Copyright (c) 2007 Digital Bazaar, Inc. All rights reserved.\r\n *\/\r\n#include \"AsymmetricKey.h\"\r\n\r\nusing namespace std;\r\nusing namespace db::crypto;\r\n\r\nAsymmetricKey::AsymmetricKey(EVP_PKEY* pkey)\r\n{\r\n \/\/ set the public\/private key structure\r\n mKey = pkey;\r\n mAlgorithm = NULL;\r\n}\r\n\r\nAsymmetricKey::~AsymmetricKey()\r\n{\r\n \/\/ free the public\/private key structure\r\n EVP_PKEY_free(mKey);\r\n \r\n if(mAlgorithm != NULL)\r\n {\r\n delete mAlgorithm;\r\n }\r\n}\r\n\r\nEVP_PKEY* AsymmetricKey::getPKEY()\r\n{\r\n return mKey;\r\n}\r\n\r\nconst char* AsymmetricKey::getAlgorithm()\r\n{\r\n if(mAlgorithm == NULL)\r\n {\r\n switch(EVP_PKEY_type(getPKEY()->type))\r\n {\r\n case EVP_PKEY_DSA:\r\n mAlgorithm = \"DSA\";\r\n break;\r\n case EVP_PKEY_RSA:\r\n mAlgorithm = \"RSA\";\r\n break;\r\n default:\r\n mAlgorithm = \"NONE\";\r\n }\r\n }\r\n \r\n return mAlgorithm;\r\n}\r\n\r\nunsigned int AsymmetricKey::getOutputSize()\r\n{\r\n return EVP_PKEY_size(getPKEY());\r\n}\r\n<commit_msg>Fixed memory leak with mAlgorithm in AsymmetricKey.<commit_after>\/*\r\n * Copyright (c) 2007 Digital Bazaar, Inc. All rights reserved.\r\n *\/\r\n#include \"AsymmetricKey.h\"\r\n\r\nusing namespace std;\r\nusing namespace db::crypto;\r\n\r\nAsymmetricKey::AsymmetricKey(EVP_PKEY* pkey)\r\n{\r\n \/\/ set the public\/private key structure\r\n mKey = pkey;\r\n mAlgorithm = NULL;\r\n}\r\n\r\nAsymmetricKey::~AsymmetricKey()\r\n{\r\n \/\/ free the public\/private key structure\r\n EVP_PKEY_free(mKey);\r\n \r\n if(mAlgorithm != NULL)\r\n {\r\n delete [] mAlgorithm;\r\n }\r\n}\r\n\r\nEVP_PKEY* AsymmetricKey::getPKEY()\r\n{\r\n return mKey;\r\n}\r\n\r\nconst char* AsymmetricKey::getAlgorithm()\r\n{\r\n if(mAlgorithm == NULL)\r\n {\r\n switch(EVP_PKEY_type(getPKEY()->type))\r\n {\r\n case EVP_PKEY_DSA:\r\n mAlgorithm = new char[4];\r\n strcpy(mAlgorithm, \"DSA\");\r\n break;\r\n case EVP_PKEY_RSA:\r\n mAlgorithm = new char[4];\r\n strcpy(mAlgorithm, \"RSA\");\r\n break;\r\n default:\r\n mAlgorithm = new char[5];\r\n strcpy(mAlgorithm, \"NONE\");\r\n }\r\n }\r\n \r\n return mAlgorithm;\r\n}\r\n\r\nunsigned int AsymmetricKey::getOutputSize()\r\n{\r\n return EVP_PKEY_size(getPKEY());\r\n}\r\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 = 0;\n long shape[N];\n shape[0] = 0L;\n for(auto const& a : ai) {\n shape[0] += a.shape[0];\n n += a.flat_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<commit_msg>Improve concatenate implementation<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#include \"pythonic\/__builtin__\/sum.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.flat_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 namespace details {\n\n template<class ...Types>\n void concatenate(std::tuple<Types...> const& a, typename assignable<typename __combined<Types...>::type>::type::dtype* iter, utils::int_<1>)\n {\n typename types::numpy_expr_to_ndarray<typename std::tuple_element<sizeof...(Types) - 1, std::tuple<Types...>>::type>::type t = std::get<sizeof...(Types) - 1>(a); \/\/ We force evaluation of the ndarray\n std::copy(t.fbegin(), t.fend(), iter);\n }\n\n template<size_t M, class ...Types>\n void concatenate(std::tuple<Types...> const& a, typename assignable<typename __combined<Types...>::type>::type::dtype* iter, utils::int_<M>)\n {\n typename types::numpy_expr_to_ndarray<typename std::tuple_element<sizeof...(Types) - M, std::tuple<Types...>>::type>::type t = std::get<sizeof...(Types) - M>(a); \/\/ We force evaluation of the ndarray\n iter = std::copy(t.fbegin(), t.fend(), iter);\n concatenate(a, iter, utils::int_<M-1>());\n }\n\n template<size_t N>\n long first_dim(types::array<long, N> const& fake_shape)\n {\n \/\/ FIXME This is a hack to force list.fake_shape evaluation to types::array\n return fake_shape[0];\n }\n\n template<class... Types, int... I>\n size_t concatenate_size(std::tuple<Types...> const& args, utils::seq<I...>)\n {\n return __builtin__::sum(std::make_tuple(first_dim<std::tuple_element<0, std::tuple<Types...>>::type::value>(std::get<I-1>(args).shape)...));\n }\n\n }\n\n template<class... Types>\n typename assignable<typename __combined<Types...>::type>::type\n concatenate(std::tuple<Types...> const& args) {\n\n using return_type = typename assignable<typename __combined<Types...>::type>::type;\n using T = typename return_type::dtype;\n\n types::array<long, return_type::value> shape = std::get<0>(args).shape;\n size_t n = shape[0];\n shape[0] = details::concatenate_size(args, typename utils::gens<1+sizeof...(Types)>::type{});\n n = size_t(std::get<0>(args).flat_size() * shape[0] \/ double(n));\n\n T* buffer = (T*)malloc(sizeof(T) * n);\n details::concatenate(args, buffer, utils::int_<sizeof...(Types)>());\n\n return types::ndarray<T,return_type::value>(buffer, shape);\n }\n\n PROXY(pythonic::numpy, concatenate);\n\n }\n\n}\n\n#endif\n<|endoftext|>"} {"text":"<commit_before>\/\/ Copyright (c) 2014 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\/ui\/views\/menu_bar.h\"\n\n#if defined(USE_X11)\n#include \"gtk\/gtk.h\"\n#endif\n\n#include \"atom\/browser\/ui\/views\/menu_delegate.h\"\n#include \"atom\/browser\/ui\/views\/submenu_button.h\"\n#include \"ui\/base\/models\/menu_model.h\"\n#include \"ui\/views\/background.h\"\n#include \"ui\/views\/layout\/box_layout.h\"\n\n#if defined(OS_WIN)\n#include \"ui\/gfx\/color_utils.h\"\n#elif defined(USE_X11)\n#include \"chrome\/browser\/ui\/libgtkui\/skia_utils_gtk.h\"\n#endif\n\nnamespace atom {\n\nnamespace {\n\nconst char kViewClassName[] = \"ElectronMenuBar\";\n\n\/\/ Default color of the menu bar.\nconst SkColor kDefaultColor = SkColorSetARGB(255, 233, 233, 233);\n\n#if defined(USE_X11)\nvoid GetMenuBarColor(SkColor* enabled, SkColor* disabled, SkColor* highlight,\n SkColor* hover, SkColor* background) {\n GtkWidget* menu_bar = gtk_menu_bar_new();\n\n GtkStyle* style = gtk_rc_get_style(menu_bar);\n *enabled = libgtkui::GdkColorToSkColor(style->fg[GTK_STATE_NORMAL]);\n *disabled = libgtkui::GdkColorToSkColor(style->fg[GTK_STATE_INSENSITIVE]);\n *highlight = libgtkui::GdkColorToSkColor(style->fg[GTK_STATE_SELECTED]);\n *hover = libgtkui::GdkColorToSkColor(style->fg[GTK_STATE_PRELIGHT]);\n *background = libgtkui::GdkColorToSkColor(style->bg[GTK_STATE_NORMAL]);\n\n gtk_widget_destroy(menu_bar);\n}\n#endif\n\n} \/\/ namespace\n\nMenuBar::MenuBar(NativeWindow* window)\n : background_color_(kDefaultColor),\n menu_model_(NULL),\n window_(window) {\n UpdateMenuBarColor();\n SetLayoutManager(new views::BoxLayout(views::BoxLayout::kHorizontal));\n}\n\nMenuBar::~MenuBar() {\n}\n\nvoid MenuBar::SetMenu(AtomMenuModel* model) {\n menu_model_ = model;\n RemoveAllChildViews(true);\n\n for (int i = 0; i < model->GetItemCount(); ++i) {\n SubmenuButton* button = new SubmenuButton(model->GetLabelAt(i),\n this,\n background_color_);\n button->set_tag(i);\n\n#if defined(USE_X11)\n button->SetTextColor(views::Button::STATE_NORMAL, enabled_color_);\n button->SetTextColor(views::Button::STATE_DISABLED, disabled_color_);\n button->SetTextColor(views::Button::STATE_PRESSED, highlight_color_);\n button->SetTextColor(views::Button::STATE_HOVERED, hover_color_);\n button->SetUnderlineColor(enabled_color_);\n#elif defined(OS_WIN)\n button->SetUnderlineColor(color_utils::GetSysSkColor(COLOR_GRAYTEXT));\n#endif\n\n AddChildView(button);\n }\n}\n\nvoid MenuBar::SetAcceleratorVisibility(bool visible) {\n for (int i = 0; i < child_count(); ++i)\n static_cast<SubmenuButton*>(child_at(i))->SetAcceleratorVisibility(visible);\n}\n\nint MenuBar::GetAcceleratorIndex(base::char16 key) {\n for (int i = 0; i < child_count(); ++i) {\n SubmenuButton* button = static_cast<SubmenuButton*>(child_at(i));\n if (button->accelerator() == key)\n return i;\n }\n return -1;\n}\n\nvoid MenuBar::ActivateAccelerator(base::char16 key) {\n int i = GetAcceleratorIndex(key);\n if (i != -1)\n static_cast<SubmenuButton*>(child_at(i))->Activate(nullptr);\n}\n\nint MenuBar::GetItemCount() const {\n return menu_model_->GetItemCount();\n}\n\nbool MenuBar::GetMenuButtonFromScreenPoint(const gfx::Point& point,\n AtomMenuModel** menu_model,\n views::MenuButton** button) {\n gfx::Point location(point);\n views::View::ConvertPointFromScreen(this, &location);\n\n if (location.x() < 0 || location.x() >= width() || location.y() < 0 ||\n location.y() >= height())\n return false;\n\n for (int i = 0; i < child_count(); ++i) {\n views::View* view = child_at(i);\n if (view->GetMirroredBounds().Contains(location) &&\n (menu_model_->GetTypeAt(i) == AtomMenuModel::TYPE_SUBMENU)) {\n *menu_model = menu_model_->GetSubmenuModelAt(i);\n *button = static_cast<views::MenuButton*>(view);\n return true;\n }\n }\n\n return false;\n}\n\nconst char* MenuBar::GetClassName() const {\n return kViewClassName;\n}\n\nvoid MenuBar::OnMenuButtonClicked(views::MenuButton* source,\n const gfx::Point& point,\n const ui::Event* event) {\n \/\/ Hide the accelerator when a submenu is activated.\n SetAcceleratorVisibility(false);\n\n if (!menu_model_)\n return;\n\n if (!window_->IsFocused())\n window_->Focus(true);\n\n int id = source->tag();\n AtomMenuModel::ItemType type = menu_model_->GetTypeAt(id);\n if (type != AtomMenuModel::TYPE_SUBMENU) {\n menu_model_->ActivatedAt(id, 0);\n return;\n }\n\n \/\/ Deleted in MenuDelegate::OnMenuClosed\n MenuDelegate* menu_delegate = new MenuDelegate(this);\n menu_delegate->RunMenu(menu_model_->GetSubmenuModelAt(id), source);\n}\n\nvoid MenuBar::OnNativeThemeChanged(const ui::NativeTheme* theme) {\n UpdateMenuBarColor();\n}\n\nvoid MenuBar::UpdateMenuBarColor() {\n#if defined(OS_WIN)\n background_color_ = color_utils::GetSysSkColor(COLOR_MENUBAR);\n#elif defined(USE_X11)\n GetMenuBarColor(&enabled_color_, &disabled_color_, &highlight_color_,\n &hover_color_, &background_color_);\n#endif\n set_background(views::Background::CreateSolidBackground(background_color_));\n}\n\n} \/\/ namespace atom\n<commit_msg>Clean up views::Background.<commit_after>\/\/ Copyright (c) 2014 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\/ui\/views\/menu_bar.h\"\n\n#if defined(USE_X11)\n#include \"gtk\/gtk.h\"\n#endif\n\n#include \"atom\/browser\/ui\/views\/menu_delegate.h\"\n#include \"atom\/browser\/ui\/views\/submenu_button.h\"\n#include \"ui\/base\/models\/menu_model.h\"\n#include \"ui\/views\/background.h\"\n#include \"ui\/views\/layout\/box_layout.h\"\n\n#if defined(OS_WIN)\n#include \"ui\/gfx\/color_utils.h\"\n#elif defined(USE_X11)\n#include \"chrome\/browser\/ui\/libgtkui\/skia_utils_gtk.h\"\n#endif\n\nnamespace atom {\n\nnamespace {\n\nconst char kViewClassName[] = \"ElectronMenuBar\";\n\n\/\/ Default color of the menu bar.\nconst SkColor kDefaultColor = SkColorSetARGB(255, 233, 233, 233);\n\n#if defined(USE_X11)\nvoid GetMenuBarColor(SkColor* enabled, SkColor* disabled, SkColor* highlight,\n SkColor* hover, SkColor* background) {\n GtkWidget* menu_bar = gtk_menu_bar_new();\n\n GtkStyle* style = gtk_rc_get_style(menu_bar);\n *enabled = libgtkui::GdkColorToSkColor(style->fg[GTK_STATE_NORMAL]);\n *disabled = libgtkui::GdkColorToSkColor(style->fg[GTK_STATE_INSENSITIVE]);\n *highlight = libgtkui::GdkColorToSkColor(style->fg[GTK_STATE_SELECTED]);\n *hover = libgtkui::GdkColorToSkColor(style->fg[GTK_STATE_PRELIGHT]);\n *background = libgtkui::GdkColorToSkColor(style->bg[GTK_STATE_NORMAL]);\n\n gtk_widget_destroy(menu_bar);\n}\n#endif\n\n} \/\/ namespace\n\nMenuBar::MenuBar(NativeWindow* window)\n : background_color_(kDefaultColor),\n menu_model_(NULL),\n window_(window) {\n UpdateMenuBarColor();\n SetLayoutManager(new views::BoxLayout(views::BoxLayout::kHorizontal));\n}\n\nMenuBar::~MenuBar() {\n}\n\nvoid MenuBar::SetMenu(AtomMenuModel* model) {\n menu_model_ = model;\n RemoveAllChildViews(true);\n\n for (int i = 0; i < model->GetItemCount(); ++i) {\n SubmenuButton* button = new SubmenuButton(model->GetLabelAt(i),\n this,\n background_color_);\n button->set_tag(i);\n\n#if defined(USE_X11)\n button->SetTextColor(views::Button::STATE_NORMAL, enabled_color_);\n button->SetTextColor(views::Button::STATE_DISABLED, disabled_color_);\n button->SetTextColor(views::Button::STATE_PRESSED, highlight_color_);\n button->SetTextColor(views::Button::STATE_HOVERED, hover_color_);\n button->SetUnderlineColor(enabled_color_);\n#elif defined(OS_WIN)\n button->SetUnderlineColor(color_utils::GetSysSkColor(COLOR_GRAYTEXT));\n#endif\n\n AddChildView(button);\n }\n}\n\nvoid MenuBar::SetAcceleratorVisibility(bool visible) {\n for (int i = 0; i < child_count(); ++i)\n static_cast<SubmenuButton*>(child_at(i))->SetAcceleratorVisibility(visible);\n}\n\nint MenuBar::GetAcceleratorIndex(base::char16 key) {\n for (int i = 0; i < child_count(); ++i) {\n SubmenuButton* button = static_cast<SubmenuButton*>(child_at(i));\n if (button->accelerator() == key)\n return i;\n }\n return -1;\n}\n\nvoid MenuBar::ActivateAccelerator(base::char16 key) {\n int i = GetAcceleratorIndex(key);\n if (i != -1)\n static_cast<SubmenuButton*>(child_at(i))->Activate(nullptr);\n}\n\nint MenuBar::GetItemCount() const {\n return menu_model_->GetItemCount();\n}\n\nbool MenuBar::GetMenuButtonFromScreenPoint(const gfx::Point& point,\n AtomMenuModel** menu_model,\n views::MenuButton** button) {\n gfx::Point location(point);\n views::View::ConvertPointFromScreen(this, &location);\n\n if (location.x() < 0 || location.x() >= width() || location.y() < 0 ||\n location.y() >= height())\n return false;\n\n for (int i = 0; i < child_count(); ++i) {\n views::View* view = child_at(i);\n if (view->GetMirroredBounds().Contains(location) &&\n (menu_model_->GetTypeAt(i) == AtomMenuModel::TYPE_SUBMENU)) {\n *menu_model = menu_model_->GetSubmenuModelAt(i);\n *button = static_cast<views::MenuButton*>(view);\n return true;\n }\n }\n\n return false;\n}\n\nconst char* MenuBar::GetClassName() const {\n return kViewClassName;\n}\n\nvoid MenuBar::OnMenuButtonClicked(views::MenuButton* source,\n const gfx::Point& point,\n const ui::Event* event) {\n \/\/ Hide the accelerator when a submenu is activated.\n SetAcceleratorVisibility(false);\n\n if (!menu_model_)\n return;\n\n if (!window_->IsFocused())\n window_->Focus(true);\n\n int id = source->tag();\n AtomMenuModel::ItemType type = menu_model_->GetTypeAt(id);\n if (type != AtomMenuModel::TYPE_SUBMENU) {\n menu_model_->ActivatedAt(id, 0);\n return;\n }\n\n \/\/ Deleted in MenuDelegate::OnMenuClosed\n MenuDelegate* menu_delegate = new MenuDelegate(this);\n menu_delegate->RunMenu(menu_model_->GetSubmenuModelAt(id), source);\n}\n\nvoid MenuBar::OnNativeThemeChanged(const ui::NativeTheme* theme) {\n UpdateMenuBarColor();\n}\n\nvoid MenuBar::UpdateMenuBarColor() {\n#if defined(OS_WIN)\n background_color_ = color_utils::GetSysSkColor(COLOR_MENUBAR);\n#elif defined(USE_X11)\n GetMenuBarColor(&enabled_color_, &disabled_color_, &highlight_color_,\n &hover_color_, &background_color_);\n#endif\n SetBackground(views::CreateSolidBackground(background_color_));\n}\n\n} \/\/ namespace atom\n<|endoftext|>"} {"text":"<commit_before>\/*\n * Copyright (C) 2013 Marcin Zdun\n *\n * Permission is hereby granted, free of charge, to any person\n * obtaining a copy of this software and associated documentation\n * files (the \"Software\"), to deal in the Software without\n * restriction, including without limitation the rights to use, copy,\n * modify, merge, publish, distribute, sublicense, and\/or sell copies\n * of the Software, and to permit persons to whom the Software is\n * furnished to do so, subject to the following conditions:\n *\n * The above copyright notice and this permission notice shall be\n * included in all copies or substantial portions of the Software.\n *\n * THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND,\n * EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF\n * MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND\n * NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS\n * BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN\n * ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN\n * CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE\n * SOFTWARE.\n *\/\n\n#ifndef __LIBSTUDIO_FUNDAMENTALS_HPP__\n#define __LIBSTUDIO_FUNDAMENTALS_HPP__\n\n#include <cmath>\n\nnamespace studio\n{\n\tnamespace math\n\t{\n\t\tinline long double __abs(long double ld)\n\t\t{\n\t\t\tif (ld < 0) return -ld;\n\t\t\treturn ld;\n\t\t}\n\n\t\ttemplate <size_t width, size_t height>\n\t\tclass MatrixBase\n\t\t{\n\t\tprotected:\n\t\t\tlong double m_data[width*height];\n\t\tpublic:\n\t\t\tenum\n\t\t\t{\n\t\t\t\tmy_width = width,\n\t\t\t\tmy_height = height\n\t\t\t};\n\t\t\tlong double at(size_t x, size_t y) const { return m_data[x + y * width]; }\n\t\t\tlong double& at(size_t x, size_t y) { return m_data[x + y * width]; }\n\t\t};\n\n\t\ttemplate <size_t common, size_t width, size_t height>\n\t\tvoid matrix_multiply(MatrixBase<width, height>& out, const MatrixBase<common, height>& lhs, const MatrixBase<width, common>& rhs)\n\t\t{\n\t\t\tfor (size_t w = 0; w < width; ++w)\n\t\t\t{\n\t\t\t\tfor (size_t h = 0; h < height; ++h)\n\t\t\t\t{\n\t\t\t\t\tout.at(w, h) = 0;\n\t\t\t\t\tfor (size_t c = 0; c < common; ++c)\n\t\t\t\t\t{\n\t\t\t\t\t\tout.at(w, h) += lhs.at(c, h) * rhs.at(w, c);\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n#define MATRIX_OPS(Type) \\\n\ttypedef Type my_t; \\\n\tType(const Type& rhs) \\\n\t{ \\\n\t\tfor (size_t i = 0; i < sizeof(m_data) \/ sizeof(m_data[0]); ++i) \\\n\t\t\tm_data[i] = rhs.m_data[i]; \\\n\t} \\\n\\\n\tType(Type&& rhs) \\\n\t{ \\\n\t\tfor (size_t i = 0; i < sizeof(m_data) \/ sizeof(m_data[0]); ++i) \\\n\t\t{\\\n\t\t\tm_data[i] = rhs.m_data[i]; \\\n\t\t\trhs.m_data[i] = 0; \\\n\t\t}\\\n\t} \\\n\\\n\tType& operator = (const Type& rhs) \\\n\t{ \\\n\t\tfor (size_t i = 0; i < sizeof(m_data) \/ sizeof(m_data[0]); ++i) \\\n\t\t\tm_data[i] = rhs.m_data[i]; \\\n\t\treturn *this; \\\n\t} \\\n\\\n\tType& operator = (Type && rhs) \\\n\t{ \\\n\t\tfor (size_t i = 0; i < sizeof(m_data) \/ sizeof(m_data[0]); ++i) \\\n\t\t{\\\n\t\t\tm_data[i] = rhs.m_data[i]; \\\n\t\t\trhs.m_data[i] = 0; \\\n\t\t}\\\n\t\treturn *this; \\\n\t} \\\n\\\n\tmy_t& set_at(size_t x, size_t y, long double val) { m_data[x + y * my_width] = val; return *this; }\n\n#define MATRIX_PROP(name, pos) \\\n\tlong double name() const { return m_data[pos]; } \\\n\tlong double& name() { return m_data[pos]; } \\\n\tmy_t& set_ ## name(long double val) { m_data[pos] = val; return *this; }\n\n\n\t\tclass Matrix : public MatrixBase<4, 4>\n\t\t{\n\t\tpublic:\n\t\t\tMatrix()\n\t\t\t{\n\t\t\t\t\/\/ identity\n\t\t\t\tfor (size_t i = 0; i < sizeof(m_data) \/ sizeof(m_data[0]); ++i)\n\t\t\t\t\tm_data[i] = i % 15 ? 0 : 1;\n\t\t\t}\n\n\t\t\tMATRIX_OPS(Matrix)\n\n\t\t\tstatic Matrix identity() { return Matrix(); }\n\t\t\tstatic Matrix translate(long double dx, long double dy = 0, long double dz = 0)\n\t\t\t{\n\t\t\t\treturn Matrix().set_at(3, 0, dx).set_at(3, 1, dy).set_at(3, 2, dz);\n\t\t\t}\n\t\t\tstatic Matrix scale(long double sx, long double sy = 0, long double sz = 0)\n\t\t\t{\n\t\t\t\tif (__abs(sy) < 0.00001) sy = sx;\n\t\t\t\tif (__abs(sz) < 0.00001) sz = sy;\n\t\t\t\treturn Matrix().set_at(0, 0, sx).set_at(1, 1, sy).set_at(2, 2, sz);\n\t\t\t}\n\t\t\tstatic Matrix rotateX(long double theta)\n\t\t\t{\n\t\t\t\tlong double cosTheta = std::cos(theta);\n\t\t\t\tlong double sinTheta = std::sin(theta);\n\t\t\t\treturn Matrix().set_at(2, 2, cosTheta).set_at(3, 2, -sinTheta).set_at(2, 3, sinTheta).set_at(3, 3, cosTheta);\n\t\t\t}\n\t\t\tstatic Matrix rotateY(long double theta)\n\t\t\t{\n\t\t\t\tlong double cosTheta = std::cos(theta);\n\t\t\t\tlong double sinTheta = std::sin(theta);\n\t\t\t\treturn Matrix().set_at(0, 0, cosTheta).set_at(3, 0, sinTheta).set_at(0, 3, -sinTheta).set_at(3, 3, cosTheta);\n\t\t\t}\n\t\t\tstatic Matrix rotateZ(long double theta)\n\t\t\t{\n\t\t\t\tlong double cosTheta = std::cos(theta);\n\t\t\t\tlong double sinTheta = std::sin(theta);\n\t\t\t\treturn Matrix().set_at(0, 0, cosTheta).set_at(1, 0, -sinTheta).set_at(0, 1, sinTheta).set_at(1, 1, cosTheta);\n\t\t\t}\n\t\t};\n\n\t\tclass Vertex : public MatrixBase<1, 4>\n\t\t{\n\t\tpublic:\n\t\t\tVertex()\n\t\t\t{\n\t\t\t\tfor (size_t i = 0; i < my_height - 1; ++i)\n\t\t\t\t\tm_data[i] = 0;\n\t\t\t\tm_data[my_height - 1] = 1;\n\t\t\t}\n\t\t\tVertex(long double x, long double y, long double z)\n\t\t\t{\n\t\t\t\tm_data[0] = x;\n\t\t\t\tm_data[1] = y;\n\t\t\t\tm_data[2] = z;\n\t\t\t\tm_data[3] = 1;\n\t\t\t}\n\t\t\tMATRIX_OPS(Vertex);\n\t\t\tMATRIX_PROP(x, 0);\n\t\t\tMATRIX_PROP(y, 1);\n\t\t\tMATRIX_PROP(z, 2);\n\t\t};\n\n\t\tclass Vector : public MatrixBase<1, 4>\n\t\t{\n\t\tpublic:\n\t\t\tVector()\n\t\t\t{\n\t\t\t\tfor (size_t i = 0; i < my_height; ++i)\n\t\t\t\t\tm_data[i] = i == my_height - 1 ? 1 : 0;\n\t\t\t}\n\t\t\tVector(long double i, long double j, long double k)\n\t\t\t{\n\t\t\t\tm_data[0] = i;\n\t\t\t\tm_data[1] = j;\n\t\t\t\tm_data[2] = k;\n\t\t\t\tm_data[3] = 1;\n\t\t\t}\n\t\t\tMATRIX_OPS(Vector);\n\t\t\tMATRIX_PROP(i, 0);\n\t\t\tMATRIX_PROP(j, 1);\n\t\t\tMATRIX_PROP(k, 2);\n\n\t\t\tlong double length() const { return std::sqrt(lengthSquared()); }\n\t\t\tlong double lengthSquared() const { return dotProduct(*this, *this); }\n\n#define COORD(next, prev) (lhs.next() * rhs.prev() - rhs.next() * lhs.prev())\n\t\t\tstatic Vector crossProduct(const Vector& lhs, const Vector& rhs)\n\t\t\t{\n\t\t\t\treturn { COORD(j, k), COORD(k, i), COORD(i, j) };\n\t\t\t}\n#undef COORD\n\n\t\t\tstatic long double dotProduct(const Vector& lhs, const Vector& rhs)\n\t\t\t{\n\t\t\t\treturn lhs.i() * rhs.i() + lhs.j() * rhs.j() + lhs.k() * rhs.k();\n\t\t\t}\n\n\t\t\tstatic long double cosTheta(const Vector& lhs, const Vector& rhs);\n\t\t};\n\n\t\tinline Vector operator - (const Vertex& lhs, const Vertex& rhs)\n\t\t{\n\t\t\treturn { lhs.x() - rhs.x(), lhs.y() - rhs.y(), lhs.z() - rhs.z() };\n\t\t}\n\n\t\tinline Vector operator* (const Matrix& lhs, const Vector& rhs)\n\t\t{\n\t\t\tVector v;\n\t\t\tmatrix_multiply(v, lhs, rhs);\n\t\t\treturn v;\n\t\t}\n\n\t\tinline Vertex operator* (const Matrix& lhs, const Vertex& rhs)\n\t\t{\n\t\t\tVertex v;\n\t\t\tmatrix_multiply(v, lhs, rhs);\n\t\t\treturn v;\n\t\t}\n\n\t\tinline Matrix operator* (const Matrix& lhs, const Matrix& rhs)\n\t\t{\n\t\t\tMatrix m;\n\t\t\tmatrix_multiply(m, lhs, rhs);\n\t\t\treturn m;\n\t\t}\n\n\t}\n}\n\n#endif \/\/__LIBSTUDIO_FUNDAMENTALS_HPP__<commit_msg>Fixing identity matrix<commit_after>\/*\n * Copyright (C) 2013 Marcin Zdun\n *\n * Permission is hereby granted, free of charge, to any person\n * obtaining a copy of this software and associated documentation\n * files (the \"Software\"), to deal in the Software without\n * restriction, including without limitation the rights to use, copy,\n * modify, merge, publish, distribute, sublicense, and\/or sell copies\n * of the Software, and to permit persons to whom the Software is\n * furnished to do so, subject to the following conditions:\n *\n * The above copyright notice and this permission notice shall be\n * included in all copies or substantial portions of the Software.\n *\n * THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND,\n * EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF\n * MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND\n * NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS\n * BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN\n * ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN\n * CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE\n * SOFTWARE.\n *\/\n\n#ifndef __LIBSTUDIO_FUNDAMENTALS_HPP__\n#define __LIBSTUDIO_FUNDAMENTALS_HPP__\n\n#include <cmath>\n\nnamespace studio\n{\n\tnamespace math\n\t{\n\t\tinline long double __abs(long double ld)\n\t\t{\n\t\t\tif (ld < 0) return -ld;\n\t\t\treturn ld;\n\t\t}\n\n\t\ttemplate <size_t width, size_t height>\n\t\tclass MatrixBase\n\t\t{\n\t\tprotected:\n\t\t\tlong double m_data[width*height];\n\t\tpublic:\n\t\t\tenum\n\t\t\t{\n\t\t\t\tmy_width = width,\n\t\t\t\tmy_height = height\n\t\t\t};\n\t\t\tlong double at(size_t x, size_t y) const { return m_data[x + y * width]; }\n\t\t\tlong double& at(size_t x, size_t y) { return m_data[x + y * width]; }\n\t\t};\n\n\t\ttemplate <size_t common, size_t width, size_t height>\n\t\tvoid matrix_multiply(MatrixBase<width, height>& out, const MatrixBase<common, height>& lhs, const MatrixBase<width, common>& rhs)\n\t\t{\n\t\t\tfor (size_t w = 0; w < width; ++w)\n\t\t\t{\n\t\t\t\tfor (size_t h = 0; h < height; ++h)\n\t\t\t\t{\n\t\t\t\t\tout.at(w, h) = 0;\n\t\t\t\t\tfor (size_t c = 0; c < common; ++c)\n\t\t\t\t\t{\n\t\t\t\t\t\tout.at(w, h) += lhs.at(c, h) * rhs.at(w, c);\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n#define MATRIX_OPS(Type) \\\n\ttypedef Type my_t; \\\n\tType(const Type& rhs) \\\n\t{ \\\n\t\tfor (size_t i = 0; i < sizeof(m_data) \/ sizeof(m_data[0]); ++i) \\\n\t\t\tm_data[i] = rhs.m_data[i]; \\\n\t} \\\n\\\n\tType(Type&& rhs) \\\n\t{ \\\n\t\tfor (size_t i = 0; i < sizeof(m_data) \/ sizeof(m_data[0]); ++i) \\\n\t\t{\\\n\t\t\tm_data[i] = rhs.m_data[i]; \\\n\t\t\trhs.m_data[i] = 0; \\\n\t\t}\\\n\t} \\\n\\\n\tType& operator = (const Type& rhs) \\\n\t{ \\\n\t\tfor (size_t i = 0; i < sizeof(m_data) \/ sizeof(m_data[0]); ++i) \\\n\t\t\tm_data[i] = rhs.m_data[i]; \\\n\t\treturn *this; \\\n\t} \\\n\\\n\tType& operator = (Type && rhs) \\\n\t{ \\\n\t\tfor (size_t i = 0; i < sizeof(m_data) \/ sizeof(m_data[0]); ++i) \\\n\t\t{\\\n\t\t\tm_data[i] = rhs.m_data[i]; \\\n\t\t\trhs.m_data[i] = 0; \\\n\t\t}\\\n\t\treturn *this; \\\n\t} \\\n\\\n\tmy_t& set_at(size_t x, size_t y, long double val) { m_data[x + y * my_width] = val; return *this; }\n\n#define MATRIX_PROP(name, pos) \\\n\tlong double name() const { return m_data[pos]; } \\\n\tlong double& name() { return m_data[pos]; } \\\n\tmy_t& set_ ## name(long double val) { m_data[pos] = val; return *this; }\n\n\n\t\tclass Matrix : public MatrixBase<4, 4>\n\t\t{\n\t\tpublic:\n\t\t\tMatrix()\n\t\t\t{\n\t\t\t\t\/\/ identity\n\t\t\t\tfor (size_t i = 0; i < sizeof(m_data) \/ sizeof(m_data[0]); ++i)\n\t\t\t\t\tm_data[i] = i % 5 ? 0 : 1;\n\t\t\t}\n\n\t\t\tMATRIX_OPS(Matrix)\n\n\t\t\tstatic Matrix identity() { return Matrix(); }\n\t\t\tstatic Matrix translate(long double dx, long double dy = 0, long double dz = 0)\n\t\t\t{\n\t\t\t\treturn Matrix().set_at(3, 0, dx).set_at(3, 1, dy).set_at(3, 2, dz);\n\t\t\t}\n\t\t\tstatic Matrix scale(long double sx, long double sy = 0, long double sz = 0)\n\t\t\t{\n\t\t\t\tif (__abs(sy) < 0.00001) sy = sx;\n\t\t\t\tif (__abs(sz) < 0.00001) sz = sy;\n\t\t\t\treturn Matrix().set_at(0, 0, sx).set_at(1, 1, sy).set_at(2, 2, sz);\n\t\t\t}\n\t\t\tstatic Matrix rotateX(long double theta)\n\t\t\t{\n\t\t\t\tlong double cosTheta = std::cos(theta);\n\t\t\t\tlong double sinTheta = std::sin(theta);\n\t\t\t\treturn Matrix().set_at(2, 2, cosTheta).set_at(3, 2, -sinTheta).set_at(2, 3, sinTheta).set_at(3, 3, cosTheta);\n\t\t\t}\n\t\t\tstatic Matrix rotateY(long double theta)\n\t\t\t{\n\t\t\t\tlong double cosTheta = std::cos(theta);\n\t\t\t\tlong double sinTheta = std::sin(theta);\n\t\t\t\treturn Matrix().set_at(0, 0, cosTheta).set_at(3, 0, sinTheta).set_at(0, 3, -sinTheta).set_at(3, 3, cosTheta);\n\t\t\t}\n\t\t\tstatic Matrix rotateZ(long double theta)\n\t\t\t{\n\t\t\t\tlong double cosTheta = std::cos(theta);\n\t\t\t\tlong double sinTheta = std::sin(theta);\n\t\t\t\treturn Matrix().set_at(0, 0, cosTheta).set_at(1, 0, -sinTheta).set_at(0, 1, sinTheta).set_at(1, 1, cosTheta);\n\t\t\t}\n\t\t};\n\n\t\tclass Vertex : public MatrixBase<1, 4>\n\t\t{\n\t\tpublic:\n\t\t\tVertex()\n\t\t\t{\n\t\t\t\tfor (size_t i = 0; i < my_height - 1; ++i)\n\t\t\t\t\tm_data[i] = 0;\n\t\t\t\tm_data[my_height - 1] = 1;\n\t\t\t}\n\t\t\tVertex(long double x, long double y, long double z)\n\t\t\t{\n\t\t\t\tm_data[0] = x;\n\t\t\t\tm_data[1] = y;\n\t\t\t\tm_data[2] = z;\n\t\t\t\tm_data[3] = 1;\n\t\t\t}\n\t\t\tMATRIX_OPS(Vertex);\n\t\t\tMATRIX_PROP(x, 0);\n\t\t\tMATRIX_PROP(y, 1);\n\t\t\tMATRIX_PROP(z, 2);\n\t\t};\n\n\t\tclass Vector : public MatrixBase<1, 4>\n\t\t{\n\t\tpublic:\n\t\t\tVector()\n\t\t\t{\n\t\t\t\tfor (size_t i = 0; i < my_height; ++i)\n\t\t\t\t\tm_data[i] = i == my_height - 1 ? 1 : 0;\n\t\t\t}\n\t\t\tVector(long double i, long double j, long double k)\n\t\t\t{\n\t\t\t\tm_data[0] = i;\n\t\t\t\tm_data[1] = j;\n\t\t\t\tm_data[2] = k;\n\t\t\t\tm_data[3] = 1;\n\t\t\t}\n\t\t\tMATRIX_OPS(Vector);\n\t\t\tMATRIX_PROP(i, 0);\n\t\t\tMATRIX_PROP(j, 1);\n\t\t\tMATRIX_PROP(k, 2);\n\n\t\t\tlong double length() const { return std::sqrt(lengthSquared()); }\n\t\t\tlong double lengthSquared() const { return dotProduct(*this, *this); }\n\n#define COORD(next, prev) (lhs.next() * rhs.prev() - rhs.next() * lhs.prev())\n\t\t\tstatic Vector crossProduct(const Vector& lhs, const Vector& rhs)\n\t\t\t{\n\t\t\t\treturn { COORD(j, k), COORD(k, i), COORD(i, j) };\n\t\t\t}\n#undef COORD\n\n\t\t\tstatic long double dotProduct(const Vector& lhs, const Vector& rhs)\n\t\t\t{\n\t\t\t\treturn lhs.i() * rhs.i() + lhs.j() * rhs.j() + lhs.k() * rhs.k();\n\t\t\t}\n\n\t\t\tstatic long double cosTheta(const Vector& lhs, const Vector& rhs);\n\t\t};\n\n\t\tinline Vector operator - (const Vertex& lhs, const Vertex& rhs)\n\t\t{\n\t\t\treturn { lhs.x() - rhs.x(), lhs.y() - rhs.y(), lhs.z() - rhs.z() };\n\t\t}\n\n\t\tinline Vector operator* (const Matrix& lhs, const Vector& rhs)\n\t\t{\n\t\t\tVector v;\n\t\t\tmatrix_multiply(v, lhs, rhs);\n\t\t\treturn v;\n\t\t}\n\n\t\tinline Vertex operator* (const Matrix& lhs, const Vertex& rhs)\n\t\t{\n\t\t\tVertex v;\n\t\t\tmatrix_multiply(v, lhs, rhs);\n\t\t\treturn v;\n\t\t}\n\n\t\tinline Matrix operator* (const Matrix& lhs, const Matrix& rhs)\n\t\t{\n\t\t\tMatrix m;\n\t\t\tmatrix_multiply(m, lhs, rhs);\n\t\t\treturn m;\n\t\t}\n\n\t}\n}\n\n#endif \/\/__LIBSTUDIO_FUNDAMENTALS_HPP__<|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 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 \"minimizebutton.h\"\n\n\/\/ Qt headers.\n#include <QAction>\n#include <QDockWidget>\n#include <QMouseEvent>\n#include <QStyle>\n\nnamespace appleseed {\nnamespace studio {\n\n\/\/\n\/\/ MinimizeButton class implementation.\n\/\/\n\nMinimizeButton::MinimizeButton(QDockWidget* dock_widget, QWidget* parent)\n : QPushButton(dock_widget->windowTitle(), parent)\n , m_dock_widget(dock_widget)\n , m_on(true)\n , m_minimized(false)\n{\n setObjectName(QString::fromUtf8(\"ToggleButtonOn\"));\n connect(\n m_dock_widget->toggleViewAction(), SIGNAL(toggled(bool)),\n SLOT(slot_minimize()));\n}\n\nbool MinimizeButton::is_on() const\n{\n return m_on;\n}\n\nvoid MinimizeButton::set_fullscreen(const bool on)\n{\n if (on)\n {\n \/\/ Setting fullscreen on\n m_minimized = m_on;\n if (!m_on)\n m_dock_widget->toggleViewAction()->activate(QAction::Trigger);\n }\n else\n {\n \/\/ Deactivating fullscreen\n \/\/ Keep state before fullscreen\n if (!m_minimized)\n m_dock_widget->toggleViewAction()->activate(QAction::Trigger);\n }\n}\n\nvoid MinimizeButton::mousePressEvent(QMouseEvent* event)\n{\n if (event->buttons() & Qt::LeftButton)\n m_dock_widget->toggleViewAction()->activate(QAction::Trigger);\n}\n\nvoid MinimizeButton::slot_minimize()\n{\n m_on = !m_on;\n if (m_on)\n setObjectName(QString::fromUtf8(\"ToggleButtonOn\"));\n else\n setObjectName(QString::fromUtf8(\"ToggleButtonOff\"));\n\n \/\/ Force stylesheet reloading for this widget\n style()->unpolish(this);\n style()->polish(this);\n}\n\n} \/\/ namespace studio\n} \/\/ namespace appleseed\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) 2010-2013 Francois Beaune, Jupiter Jazz Limited\n\/\/ Copyright (c) 2014 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 \"minimizebutton.h\"\n\n\/\/ Qt headers.\n#include <QAction>\n#include <QDockWidget>\n#include <QMouseEvent>\n#include <QStyle>\n\nnamespace appleseed {\nnamespace studio {\n\n\/\/\n\/\/ MinimizeButton class implementation.\n\/\/\n\nMinimizeButton::MinimizeButton(QDockWidget* dock_widget, QWidget* parent)\n : QPushButton(dock_widget->windowTitle(), parent)\n , m_dock_widget(dock_widget)\n , m_on(true)\n , m_minimized(false)\n{\n setObjectName(QString::fromUtf8(\"ToggleButtonOn\"));\n connect(\n m_dock_widget->toggleViewAction(), SIGNAL(toggled(bool)),\n SLOT(slot_minimize()));\n}\n\nbool MinimizeButton::is_on() const\n{\n return m_on;\n}\n\nvoid MinimizeButton::set_fullscreen(const bool on)\n{\n if (on)\n {\n \/\/ Setting fullscreen on.\n m_minimized = m_on;\n if (!m_on)\n m_dock_widget->toggleViewAction()->activate(QAction::Trigger);\n }\n else\n {\n \/\/ Deactivating fullscreen. Keep state before fullscreen.\n if (!m_minimized)\n m_dock_widget->toggleViewAction()->activate(QAction::Trigger);\n }\n}\n\nvoid MinimizeButton::mousePressEvent(QMouseEvent* event)\n{\n if (event->buttons() & Qt::LeftButton)\n m_dock_widget->toggleViewAction()->activate(QAction::Trigger);\n}\n\nvoid MinimizeButton::slot_minimize()\n{\n m_on = !m_on;\n\n setObjectName(QString::fromUtf8(m_on ? \"ToggleButtonOn\" : \"ToggleButtonOff\"));\n\n \/\/ Force stylesheet reloading for this widget.\n style()->unpolish(this);\n style()->polish(this);\n}\n\n} \/\/ namespace studio\n} \/\/ namespace appleseed\n<|endoftext|>"} {"text":"<commit_before>\/* mbed Microcontroller Library\n * Copyright (c) 2006-2015 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 \"mbed-drivers\/mbed.h\"\n#include \"ble\/BLE.h\"\n#include \"ble\/services\/iBeacon.h\"\n\nstatic iBeacon* ibeaconPtr;\n\n\/**\n * This function is called when the ble initialization process has failled\n *\/\nvoid onBleInitError(BLE &ble, ble_error_t error)\n{\n \/* Initialization error handling should go here *\/\n}\n\n\/**\n * Callback triggered when the ble initialization process has finished\n *\/\nvoid bleInitComplete(BLE::InitializationCompleteCallbackContext *params)\n{\n BLE& ble = params->ble;\n ble_error_t error = params->error;\n\n if (error != BLE_ERROR_NONE) {\n \/* In case of error, forward the error handling to onBleInitError *\/\n onBleInitError(ble, error);\n return;\n }\n\n \/* Ensure that it is the default instance of BLE *\/\n if(ble.getInstanceID() != BLE::DEFAULT_INSTANCE) {\n return;\n }\n\n \/**\n * The Beacon payload has the following composition:\n * 128-Bit \/ 16byte UUID = E2 0A 39 F4 73 F5 4B C4 A1 2F 17 D1 AD 07 A9 61\n * Major\/Minor = 0x1122 \/ 0x3344\n * Tx Power = 0xC8 = 200, 2's compliment is 256-200 = (-56dB)\n *\n * Note: please remember to calibrate your beacons TX Power for more accurate results.\n *\/\n static const uint8_t uuid[] = {0xE2, 0x0A, 0x39, 0xF4, 0x73, 0xF5, 0x4B, 0xC4,\n 0xA1, 0x2F, 0x17, 0xD1, 0xAD, 0x07, 0xA9, 0x61};\n uint16_t majorNumber = 1122;\n uint16_t minorNumber = 3344;\n uint16_t txPower = 0xC8;\n ibeaconPtr = new iBeacon(ble, uuid, majorNumber, minorNumber, txPower);\n\n ble.gap().setAdvertisingInterval(1000); \/* 1000ms. *\/\n ble.gap().startAdvertising();\n}\n\nvoid app_start(int, char**)\n{\n BLE &ble = BLE::Instance();\n ble.init(bleInitComplete);\n}\n<commit_msg>Fixed indentation in BLE_Beacon demo source<commit_after>\/* mbed Microcontroller Library\n * Copyright (c) 2006-2015 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 \"mbed-drivers\/mbed.h\"\n#include \"ble\/BLE.h\"\n#include \"ble\/services\/iBeacon.h\"\n\nstatic iBeacon* ibeaconPtr;\n\n\/**\n * This function is called when the ble initialization process has failled\n *\/\nvoid onBleInitError(BLE &ble, ble_error_t error)\n{\n \/* Initialization error handling should go here *\/\n}\n\n\/**\n * Callback triggered when the ble initialization process has finished\n *\/\nvoid bleInitComplete(BLE::InitializationCompleteCallbackContext *params)\n{\n BLE& ble = params->ble;\n ble_error_t error = params->error;\n\n if (error != BLE_ERROR_NONE) {\n \/* In case of error, forward the error handling to onBleInitError *\/\n onBleInitError(ble, error);\n return;\n }\n\n \/* Ensure that it is the default instance of BLE *\/\n if(ble.getInstanceID() != BLE::DEFAULT_INSTANCE) {\n return;\n }\n\n \/**\n * The Beacon payload has the following composition:\n * 128-Bit \/ 16byte UUID = E2 0A 39 F4 73 F5 4B C4 A1 2F 17 D1 AD 07 A9 61\n * Major\/Minor = 0x1122 \/ 0x3344\n * Tx Power = 0xC8 = 200, 2's compliment is 256-200 = (-56dB)\n *\n * Note: please remember to calibrate your beacons TX Power for more accurate results.\n *\/\n static const uint8_t uuid[] = {0xE2, 0x0A, 0x39, 0xF4, 0x73, 0xF5, 0x4B, 0xC4,\n 0xA1, 0x2F, 0x17, 0xD1, 0xAD, 0x07, 0xA9, 0x61};\n uint16_t majorNumber = 1122;\n uint16_t minorNumber = 3344;\n uint16_t txPower = 0xC8;\n ibeaconPtr = new iBeacon(ble, uuid, majorNumber, minorNumber, txPower);\n\n ble.gap().setAdvertisingInterval(1000); \/* 1000ms. *\/\n ble.gap().startAdvertising();\n}\n\nvoid app_start(int, char**)\n{\n BLE &ble = BLE::Instance();\n ble.init(bleInitComplete);\n}\n<|endoftext|>"} {"text":"<commit_before>\/\/===--- Backend.cpp - Interface to LLVM backend technologies -------------===\/\/\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 \"clang\/Frontend\/ASTConsumers.h\"\n#include \"clang\/CodeGen\/ModuleBuilder.h\"\n#include \"clang\/Frontend\/CompileOptions.h\"\n#include \"clang\/AST\/ASTContext.h\"\n#include \"clang\/AST\/ASTConsumer.h\"\n#include \"clang\/AST\/DeclGroup.h\"\n#include \"clang\/Basic\/TargetInfo.h\"\n#include \"llvm\/Module.h\"\n#include \"llvm\/ModuleProvider.h\"\n#include \"llvm\/PassManager.h\"\n#include \"llvm\/ADT\/OwningPtr.h\"\n#include \"llvm\/Assembly\/PrintModulePass.h\"\n#include \"llvm\/Analysis\/CallGraph.h\"\n#include \"llvm\/Analysis\/Verifier.h\"\n#include \"llvm\/Bitcode\/ReaderWriter.h\"\n#include \"llvm\/CodeGen\/RegAllocRegistry.h\"\n#include \"llvm\/CodeGen\/SchedulerRegistry.h\"\n#include \"llvm\/Support\/Compiler.h\"\n#include \"llvm\/Support\/FormattedStream.h\"\n#include \"llvm\/Support\/StandardPasses.h\"\n#include \"llvm\/Support\/Timer.h\"\n#include \"llvm\/System\/Path.h\"\n#include \"llvm\/System\/Program.h\"\n#include \"llvm\/Target\/SubtargetFeature.h\"\n#include \"llvm\/Target\/TargetData.h\"\n#include \"llvm\/Target\/TargetMachine.h\"\n#include \"llvm\/Target\/TargetRegistry.h\"\nusing namespace clang;\nusing namespace llvm;\n\nnamespace {\n class VISIBILITY_HIDDEN BackendConsumer : public ASTConsumer {\n BackendAction Action;\n CompileOptions CompileOpts;\n llvm::raw_ostream *AsmOutStream;\n llvm::formatted_raw_ostream FormattedOutStream;\n ASTContext *Context;\n\n Timer LLVMIRGeneration;\n Timer CodeGenerationTime;\n \n llvm::OwningPtr<CodeGenerator> Gen;\n \n llvm::Module *TheModule;\n llvm::TargetData *TheTargetData;\n\n mutable llvm::ModuleProvider *ModuleProvider;\n mutable FunctionPassManager *CodeGenPasses;\n mutable PassManager *PerModulePasses;\n mutable FunctionPassManager *PerFunctionPasses;\n\n FunctionPassManager *getCodeGenPasses() const;\n PassManager *getPerModulePasses() const;\n FunctionPassManager *getPerFunctionPasses() const;\n\n void CreatePasses();\n\n \/\/\/ AddEmitPasses - Add passes necessary to emit assembly or LLVM\n \/\/\/ IR.\n \/\/\/\n \/\/\/ \\return True on success. On failure \\arg Error will be set to\n \/\/\/ a user readable error message.\n bool AddEmitPasses(std::string &Error);\n\n void EmitAssembly();\n \n public: \n BackendConsumer(BackendAction action, Diagnostic &Diags, \n const LangOptions &langopts, const CompileOptions &compopts,\n const std::string &infile, llvm::raw_ostream* OS,\n LLVMContext& C) :\n Action(action), \n CompileOpts(compopts),\n AsmOutStream(OS),\n LLVMIRGeneration(\"LLVM IR Generation Time\"),\n CodeGenerationTime(\"Code Generation Time\"),\n Gen(CreateLLVMCodeGen(Diags, infile, compopts, C)),\n TheModule(0), TheTargetData(0), ModuleProvider(0),\n CodeGenPasses(0), PerModulePasses(0), PerFunctionPasses(0) {\n \n if (AsmOutStream)\n FormattedOutStream.setStream(*AsmOutStream,\n formatted_raw_ostream::PRESERVE_STREAM);\n \n \/\/ Enable -time-passes if -ftime-report is enabled.\n llvm::TimePassesIsEnabled = CompileOpts.TimePasses;\n }\n\n ~BackendConsumer() {\n delete TheTargetData;\n delete ModuleProvider;\n delete CodeGenPasses;\n delete PerModulePasses;\n delete PerFunctionPasses;\n }\n\n virtual void Initialize(ASTContext &Ctx) {\n Context = &Ctx;\n \n if (CompileOpts.TimePasses)\n LLVMIRGeneration.startTimer();\n \n Gen->Initialize(Ctx);\n\n TheModule = Gen->GetModule();\n ModuleProvider = new ExistingModuleProvider(TheModule);\n TheTargetData = new llvm::TargetData(Ctx.Target.getTargetDescription());\n \n if (CompileOpts.TimePasses)\n LLVMIRGeneration.stopTimer();\n }\n \n virtual void HandleTopLevelDecl(DeclGroupRef D) {\n PrettyStackTraceDecl CrashInfo(*D.begin(), SourceLocation(),\n Context->getSourceManager(),\n \"LLVM IR generation of declaration\");\n \n if (CompileOpts.TimePasses)\n LLVMIRGeneration.startTimer();\n\n Gen->HandleTopLevelDecl(D);\n\n if (CompileOpts.TimePasses)\n LLVMIRGeneration.stopTimer();\n }\n \n virtual void HandleTranslationUnit(ASTContext &C) {\n {\n PrettyStackTraceString CrashInfo(\"Per-file LLVM IR generation\");\n if (CompileOpts.TimePasses)\n LLVMIRGeneration.startTimer();\n\n Gen->HandleTranslationUnit(C);\n\n if (CompileOpts.TimePasses)\n LLVMIRGeneration.stopTimer();\n }\n\n \/\/ EmitAssembly times and registers crash info itself.\n EmitAssembly();\n \n \/\/ Force a flush here in case we never get released.\n if (AsmOutStream)\n FormattedOutStream.flush();\n }\n \n virtual void HandleTagDeclDefinition(TagDecl *D) {\n PrettyStackTraceDecl CrashInfo(D, SourceLocation(),\n Context->getSourceManager(),\n \"LLVM IR generation of declaration\");\n Gen->HandleTagDeclDefinition(D);\n }\n\n virtual void CompleteTentativeDefinition(VarDecl *D) {\n Gen->CompleteTentativeDefinition(D);\n }\n }; \n}\n\nFunctionPassManager *BackendConsumer::getCodeGenPasses() const {\n if (!CodeGenPasses) {\n CodeGenPasses = new FunctionPassManager(ModuleProvider);\n CodeGenPasses->add(new TargetData(*TheTargetData));\n }\n\n return CodeGenPasses;\n}\n\nPassManager *BackendConsumer::getPerModulePasses() const {\n if (!PerModulePasses) {\n PerModulePasses = new PassManager();\n PerModulePasses->add(new TargetData(*TheTargetData));\n }\n\n return PerModulePasses;\n}\n\nFunctionPassManager *BackendConsumer::getPerFunctionPasses() const {\n if (!PerFunctionPasses) {\n PerFunctionPasses = new FunctionPassManager(ModuleProvider);\n PerFunctionPasses->add(new TargetData(*TheTargetData));\n }\n\n return PerFunctionPasses;\n}\n\nbool BackendConsumer::AddEmitPasses(std::string &Error) {\n if (Action == Backend_EmitNothing)\n return true;\n\n if (Action == Backend_EmitBC) {\n getPerModulePasses()->add(createBitcodeWriterPass(*AsmOutStream));\n } else if (Action == Backend_EmitLL) {\n getPerModulePasses()->add(createPrintModulePass(AsmOutStream));\n } else {\n bool Fast = CompileOpts.OptimizationLevel == 0;\n\n \/\/ Create the TargetMachine for generating code.\n std::string Triple = TheModule->getTargetTriple();\n const llvm::Target *TheTarget = TargetRegistry::lookupTarget(Triple, Error);\n if (!TheTarget) {\n Error = std::string(\"Unable to get target machine: \") + Error;\n return false;\n }\n\n std::string FeaturesStr;\n if (CompileOpts.CPU.size() || CompileOpts.Features.size()) {\n SubtargetFeatures Features;\n Features.setCPU(CompileOpts.CPU);\n for (std::vector<std::string>::iterator \n it = CompileOpts.Features.begin(),\n ie = CompileOpts.Features.end(); it != ie; ++it)\n Features.AddFeature(*it);\n FeaturesStr = Features.getString();\n }\n TargetMachine *TM = TheTarget->createTargetMachine(*TheModule, Triple, \n FeaturesStr);\n \n \/\/ Set register scheduler & allocation policy.\n RegisterScheduler::setDefault(createDefaultScheduler);\n RegisterRegAlloc::setDefault(Fast ? createLocalRegisterAllocator : \n createLinearScanRegisterAllocator); \n\n \/\/ From llvm-gcc:\n \/\/ If there are passes we have to run on the entire module, we do codegen\n \/\/ as a separate \"pass\" after that happens.\n \/\/ FIXME: This is disabled right now until bugs can be worked out. Reenable\n \/\/ this for fast -O0 compiles!\n FunctionPassManager *PM = getCodeGenPasses();\n CodeGenOpt::Level OptLevel = CodeGenOpt::Default;\n\n switch (CompileOpts.OptimizationLevel) {\n default: break;\n case 0: OptLevel = CodeGenOpt::None; break;\n case 3: OptLevel = CodeGenOpt::Aggressive; break;\n }\n\n \/\/ Normal mode, emit a .s file by running the code generator.\n \/\/ Note, this also adds codegenerator level optimization passes.\n switch (TM->addPassesToEmitFile(*PM, FormattedOutStream,\n TargetMachine::AssemblyFile, OptLevel)) {\n default:\n case FileModel::Error:\n Error = \"Unable to interface with target machine!\\n\";\n return false;\n case FileModel::AsmFile:\n break;\n }\n \n if (TM->addPassesToEmitFileFinish(*CodeGenPasses, (MachineCodeEmitter *)0,\n OptLevel)) {\n Error = \"Unable to interface with target machine!\\n\";\n return false;\n }\n }\n\n return true;\n}\n\nvoid BackendConsumer::CreatePasses() {\n \/\/ In -O0 if checking is disabled, we don't even have per-function passes.\n if (CompileOpts.VerifyModule)\n getPerFunctionPasses()->add(createVerifierPass());\n\n \/\/ Assume that standard function passes aren't run for -O0.\n if (CompileOpts.OptimizationLevel > 0)\n llvm::createStandardFunctionPasses(getPerFunctionPasses(),\n CompileOpts.OptimizationLevel);\n\n llvm::Pass *InliningPass = 0;\n switch (CompileOpts.Inlining) {\n case CompileOptions::NoInlining: break;\n case CompileOptions::NormalInlining: {\n \/\/ Inline small functions\n unsigned Threshold = (CompileOpts.OptimizeSize ||\n CompileOpts.OptimizationLevel < 3) ? 50 : 200;\n InliningPass = createFunctionInliningPass(Threshold);\n break;\n }\n case CompileOptions::OnlyAlwaysInlining:\n InliningPass = createAlwaysInlinerPass(); \/\/ Respect always_inline\n break;\n }\n\n \/\/ For now we always create per module passes.\n PassManager *PM = getPerModulePasses();\n llvm::createStandardModulePasses(PM, CompileOpts.OptimizationLevel, \n CompileOpts.OptimizeSize, \n CompileOpts.UnitAtATime,\n CompileOpts.UnrollLoops,\n CompileOpts.SimplifyLibCalls,\n \/*HaveExceptions=*\/true,\n InliningPass);\n}\n\n\/\/\/ EmitAssembly - Handle interaction with LLVM backend to generate\n\/\/\/ actual machine code. \nvoid BackendConsumer::EmitAssembly() {\n \/\/ Silently ignore if we weren't initialized for some reason.\n if (!TheModule || !TheTargetData)\n return;\n \n TimeRegion Region(CompileOpts.TimePasses ? &CodeGenerationTime : 0);\n\n \/\/ Make sure IR generation is happy with the module. This is\n \/\/ released by the module provider.\n Module *M = Gen->ReleaseModule();\n if (!M) {\n \/\/ The module has been released by IR gen on failures, do not\n \/\/ double free.\n ModuleProvider->releaseModule();\n TheModule = 0;\n return;\n }\n\n assert(TheModule == M && \"Unexpected module change during IR generation\");\n\n CreatePasses();\n\n std::string Error;\n if (!AddEmitPasses(Error)) {\n \/\/ FIXME: Don't fail this way.\n llvm::cerr << \"ERROR: \" << Error << \"\\n\";\n ::exit(1);\n }\n\n \/\/ Run passes. For now we do all passes at once, but eventually we\n \/\/ would like to have the option of streaming code generation.\n\n if (PerFunctionPasses) {\n PrettyStackTraceString CrashInfo(\"Per-function optimization\");\n \n PerFunctionPasses->doInitialization();\n for (Module::iterator I = M->begin(), E = M->end(); I != E; ++I)\n if (!I->isDeclaration())\n PerFunctionPasses->run(*I);\n PerFunctionPasses->doFinalization();\n }\n \n if (PerModulePasses) {\n PrettyStackTraceString CrashInfo(\"Per-module optimization passes\");\n PerModulePasses->run(*M);\n }\n \n if (CodeGenPasses) {\n PrettyStackTraceString CrashInfo(\"Code generation\");\n CodeGenPasses->doInitialization();\n for (Module::iterator I = M->begin(), E = M->end(); I != E; ++I)\n if (!I->isDeclaration())\n CodeGenPasses->run(*I);\n CodeGenPasses->doFinalization();\n }\n}\n\nASTConsumer *clang::CreateBackendConsumer(BackendAction Action,\n Diagnostic &Diags,\n const LangOptions &LangOpts,\n const CompileOptions &CompileOpts,\n const std::string& InFile,\n llvm::raw_ostream* OS,\n LLVMContext& C) {\n return new BackendConsumer(Action, Diags, LangOpts, CompileOpts,\n InFile, OS, C);\n}\n<commit_msg>Update for LLVM API change<commit_after>\/\/===--- Backend.cpp - Interface to LLVM backend technologies -------------===\/\/\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 \"clang\/Frontend\/ASTConsumers.h\"\n#include \"clang\/CodeGen\/ModuleBuilder.h\"\n#include \"clang\/Frontend\/CompileOptions.h\"\n#include \"clang\/AST\/ASTContext.h\"\n#include \"clang\/AST\/ASTConsumer.h\"\n#include \"clang\/AST\/DeclGroup.h\"\n#include \"clang\/Basic\/TargetInfo.h\"\n#include \"llvm\/Module.h\"\n#include \"llvm\/ModuleProvider.h\"\n#include \"llvm\/PassManager.h\"\n#include \"llvm\/ADT\/OwningPtr.h\"\n#include \"llvm\/Assembly\/PrintModulePass.h\"\n#include \"llvm\/Analysis\/CallGraph.h\"\n#include \"llvm\/Analysis\/Verifier.h\"\n#include \"llvm\/Bitcode\/ReaderWriter.h\"\n#include \"llvm\/CodeGen\/RegAllocRegistry.h\"\n#include \"llvm\/CodeGen\/SchedulerRegistry.h\"\n#include \"llvm\/Support\/Compiler.h\"\n#include \"llvm\/Support\/FormattedStream.h\"\n#include \"llvm\/Support\/StandardPasses.h\"\n#include \"llvm\/Support\/Timer.h\"\n#include \"llvm\/System\/Path.h\"\n#include \"llvm\/System\/Program.h\"\n#include \"llvm\/Target\/SubtargetFeature.h\"\n#include \"llvm\/Target\/TargetData.h\"\n#include \"llvm\/Target\/TargetMachine.h\"\n#include \"llvm\/Target\/TargetRegistry.h\"\nusing namespace clang;\nusing namespace llvm;\n\nnamespace {\n class VISIBILITY_HIDDEN BackendConsumer : public ASTConsumer {\n BackendAction Action;\n CompileOptions CompileOpts;\n llvm::raw_ostream *AsmOutStream;\n llvm::formatted_raw_ostream FormattedOutStream;\n ASTContext *Context;\n\n Timer LLVMIRGeneration;\n Timer CodeGenerationTime;\n \n llvm::OwningPtr<CodeGenerator> Gen;\n \n llvm::Module *TheModule;\n llvm::TargetData *TheTargetData;\n\n mutable llvm::ModuleProvider *ModuleProvider;\n mutable FunctionPassManager *CodeGenPasses;\n mutable PassManager *PerModulePasses;\n mutable FunctionPassManager *PerFunctionPasses;\n\n FunctionPassManager *getCodeGenPasses() const;\n PassManager *getPerModulePasses() const;\n FunctionPassManager *getPerFunctionPasses() const;\n\n void CreatePasses();\n\n \/\/\/ AddEmitPasses - Add passes necessary to emit assembly or LLVM\n \/\/\/ IR.\n \/\/\/\n \/\/\/ \\return True on success. On failure \\arg Error will be set to\n \/\/\/ a user readable error message.\n bool AddEmitPasses(std::string &Error);\n\n void EmitAssembly();\n \n public: \n BackendConsumer(BackendAction action, Diagnostic &Diags, \n const LangOptions &langopts, const CompileOptions &compopts,\n const std::string &infile, llvm::raw_ostream* OS,\n LLVMContext& C) :\n Action(action), \n CompileOpts(compopts),\n AsmOutStream(OS),\n LLVMIRGeneration(\"LLVM IR Generation Time\"),\n CodeGenerationTime(\"Code Generation Time\"),\n Gen(CreateLLVMCodeGen(Diags, infile, compopts, C)),\n TheModule(0), TheTargetData(0), ModuleProvider(0),\n CodeGenPasses(0), PerModulePasses(0), PerFunctionPasses(0) {\n \n if (AsmOutStream)\n FormattedOutStream.setStream(*AsmOutStream,\n formatted_raw_ostream::PRESERVE_STREAM);\n \n \/\/ Enable -time-passes if -ftime-report is enabled.\n llvm::TimePassesIsEnabled = CompileOpts.TimePasses;\n }\n\n ~BackendConsumer() {\n delete TheTargetData;\n delete ModuleProvider;\n delete CodeGenPasses;\n delete PerModulePasses;\n delete PerFunctionPasses;\n }\n\n virtual void Initialize(ASTContext &Ctx) {\n Context = &Ctx;\n \n if (CompileOpts.TimePasses)\n LLVMIRGeneration.startTimer();\n \n Gen->Initialize(Ctx);\n\n TheModule = Gen->GetModule();\n ModuleProvider = new ExistingModuleProvider(TheModule);\n TheTargetData = new llvm::TargetData(Ctx.Target.getTargetDescription());\n \n if (CompileOpts.TimePasses)\n LLVMIRGeneration.stopTimer();\n }\n \n virtual void HandleTopLevelDecl(DeclGroupRef D) {\n PrettyStackTraceDecl CrashInfo(*D.begin(), SourceLocation(),\n Context->getSourceManager(),\n \"LLVM IR generation of declaration\");\n \n if (CompileOpts.TimePasses)\n LLVMIRGeneration.startTimer();\n\n Gen->HandleTopLevelDecl(D);\n\n if (CompileOpts.TimePasses)\n LLVMIRGeneration.stopTimer();\n }\n \n virtual void HandleTranslationUnit(ASTContext &C) {\n {\n PrettyStackTraceString CrashInfo(\"Per-file LLVM IR generation\");\n if (CompileOpts.TimePasses)\n LLVMIRGeneration.startTimer();\n\n Gen->HandleTranslationUnit(C);\n\n if (CompileOpts.TimePasses)\n LLVMIRGeneration.stopTimer();\n }\n\n \/\/ EmitAssembly times and registers crash info itself.\n EmitAssembly();\n \n \/\/ Force a flush here in case we never get released.\n if (AsmOutStream)\n FormattedOutStream.flush();\n }\n \n virtual void HandleTagDeclDefinition(TagDecl *D) {\n PrettyStackTraceDecl CrashInfo(D, SourceLocation(),\n Context->getSourceManager(),\n \"LLVM IR generation of declaration\");\n Gen->HandleTagDeclDefinition(D);\n }\n\n virtual void CompleteTentativeDefinition(VarDecl *D) {\n Gen->CompleteTentativeDefinition(D);\n }\n }; \n}\n\nFunctionPassManager *BackendConsumer::getCodeGenPasses() const {\n if (!CodeGenPasses) {\n CodeGenPasses = new FunctionPassManager(ModuleProvider);\n CodeGenPasses->add(new TargetData(*TheTargetData));\n }\n\n return CodeGenPasses;\n}\n\nPassManager *BackendConsumer::getPerModulePasses() const {\n if (!PerModulePasses) {\n PerModulePasses = new PassManager();\n PerModulePasses->add(new TargetData(*TheTargetData));\n }\n\n return PerModulePasses;\n}\n\nFunctionPassManager *BackendConsumer::getPerFunctionPasses() const {\n if (!PerFunctionPasses) {\n PerFunctionPasses = new FunctionPassManager(ModuleProvider);\n PerFunctionPasses->add(new TargetData(*TheTargetData));\n }\n\n return PerFunctionPasses;\n}\n\nbool BackendConsumer::AddEmitPasses(std::string &Error) {\n if (Action == Backend_EmitNothing)\n return true;\n\n if (Action == Backend_EmitBC) {\n getPerModulePasses()->add(createBitcodeWriterPass(*AsmOutStream));\n } else if (Action == Backend_EmitLL) {\n getPerModulePasses()->add(createPrintModulePass(AsmOutStream));\n } else {\n bool Fast = CompileOpts.OptimizationLevel == 0;\n\n \/\/ Create the TargetMachine for generating code.\n std::string Triple = TheModule->getTargetTriple();\n const llvm::Target *TheTarget = TargetRegistry::lookupTarget(Triple, Error);\n if (!TheTarget) {\n Error = std::string(\"Unable to get target machine: \") + Error;\n return false;\n }\n\n std::string FeaturesStr;\n if (CompileOpts.CPU.size() || CompileOpts.Features.size()) {\n SubtargetFeatures Features;\n Features.setCPU(CompileOpts.CPU);\n for (std::vector<std::string>::iterator \n it = CompileOpts.Features.begin(),\n ie = CompileOpts.Features.end(); it != ie; ++it)\n Features.AddFeature(*it);\n FeaturesStr = Features.getString();\n }\n TargetMachine *TM = TheTarget->createTargetMachine(Triple, FeaturesStr);\n \n \/\/ Set register scheduler & allocation policy.\n RegisterScheduler::setDefault(createDefaultScheduler);\n RegisterRegAlloc::setDefault(Fast ? createLocalRegisterAllocator : \n createLinearScanRegisterAllocator); \n\n \/\/ From llvm-gcc:\n \/\/ If there are passes we have to run on the entire module, we do codegen\n \/\/ as a separate \"pass\" after that happens.\n \/\/ FIXME: This is disabled right now until bugs can be worked out. Reenable\n \/\/ this for fast -O0 compiles!\n FunctionPassManager *PM = getCodeGenPasses();\n CodeGenOpt::Level OptLevel = CodeGenOpt::Default;\n\n switch (CompileOpts.OptimizationLevel) {\n default: break;\n case 0: OptLevel = CodeGenOpt::None; break;\n case 3: OptLevel = CodeGenOpt::Aggressive; break;\n }\n\n \/\/ Normal mode, emit a .s file by running the code generator.\n \/\/ Note, this also adds codegenerator level optimization passes.\n switch (TM->addPassesToEmitFile(*PM, FormattedOutStream,\n TargetMachine::AssemblyFile, OptLevel)) {\n default:\n case FileModel::Error:\n Error = \"Unable to interface with target machine!\\n\";\n return false;\n case FileModel::AsmFile:\n break;\n }\n \n if (TM->addPassesToEmitFileFinish(*CodeGenPasses, (MachineCodeEmitter *)0,\n OptLevel)) {\n Error = \"Unable to interface with target machine!\\n\";\n return false;\n }\n }\n\n return true;\n}\n\nvoid BackendConsumer::CreatePasses() {\n \/\/ In -O0 if checking is disabled, we don't even have per-function passes.\n if (CompileOpts.VerifyModule)\n getPerFunctionPasses()->add(createVerifierPass());\n\n \/\/ Assume that standard function passes aren't run for -O0.\n if (CompileOpts.OptimizationLevel > 0)\n llvm::createStandardFunctionPasses(getPerFunctionPasses(),\n CompileOpts.OptimizationLevel);\n\n llvm::Pass *InliningPass = 0;\n switch (CompileOpts.Inlining) {\n case CompileOptions::NoInlining: break;\n case CompileOptions::NormalInlining: {\n \/\/ Inline small functions\n unsigned Threshold = (CompileOpts.OptimizeSize ||\n CompileOpts.OptimizationLevel < 3) ? 50 : 200;\n InliningPass = createFunctionInliningPass(Threshold);\n break;\n }\n case CompileOptions::OnlyAlwaysInlining:\n InliningPass = createAlwaysInlinerPass(); \/\/ Respect always_inline\n break;\n }\n\n \/\/ For now we always create per module passes.\n PassManager *PM = getPerModulePasses();\n llvm::createStandardModulePasses(PM, CompileOpts.OptimizationLevel, \n CompileOpts.OptimizeSize, \n CompileOpts.UnitAtATime,\n CompileOpts.UnrollLoops,\n CompileOpts.SimplifyLibCalls,\n \/*HaveExceptions=*\/true,\n InliningPass);\n}\n\n\/\/\/ EmitAssembly - Handle interaction with LLVM backend to generate\n\/\/\/ actual machine code. \nvoid BackendConsumer::EmitAssembly() {\n \/\/ Silently ignore if we weren't initialized for some reason.\n if (!TheModule || !TheTargetData)\n return;\n \n TimeRegion Region(CompileOpts.TimePasses ? &CodeGenerationTime : 0);\n\n \/\/ Make sure IR generation is happy with the module. This is\n \/\/ released by the module provider.\n Module *M = Gen->ReleaseModule();\n if (!M) {\n \/\/ The module has been released by IR gen on failures, do not\n \/\/ double free.\n ModuleProvider->releaseModule();\n TheModule = 0;\n return;\n }\n\n assert(TheModule == M && \"Unexpected module change during IR generation\");\n\n CreatePasses();\n\n std::string Error;\n if (!AddEmitPasses(Error)) {\n \/\/ FIXME: Don't fail this way.\n llvm::cerr << \"ERROR: \" << Error << \"\\n\";\n ::exit(1);\n }\n\n \/\/ Run passes. For now we do all passes at once, but eventually we\n \/\/ would like to have the option of streaming code generation.\n\n if (PerFunctionPasses) {\n PrettyStackTraceString CrashInfo(\"Per-function optimization\");\n \n PerFunctionPasses->doInitialization();\n for (Module::iterator I = M->begin(), E = M->end(); I != E; ++I)\n if (!I->isDeclaration())\n PerFunctionPasses->run(*I);\n PerFunctionPasses->doFinalization();\n }\n \n if (PerModulePasses) {\n PrettyStackTraceString CrashInfo(\"Per-module optimization passes\");\n PerModulePasses->run(*M);\n }\n \n if (CodeGenPasses) {\n PrettyStackTraceString CrashInfo(\"Code generation\");\n CodeGenPasses->doInitialization();\n for (Module::iterator I = M->begin(), E = M->end(); I != E; ++I)\n if (!I->isDeclaration())\n CodeGenPasses->run(*I);\n CodeGenPasses->doFinalization();\n }\n}\n\nASTConsumer *clang::CreateBackendConsumer(BackendAction Action,\n Diagnostic &Diags,\n const LangOptions &LangOpts,\n const CompileOptions &CompileOpts,\n const std::string& InFile,\n llvm::raw_ostream* OS,\n LLVMContext& C) {\n return new BackendConsumer(Action, Diags, LangOpts, CompileOpts,\n InFile, OS, C);\n}\n<|endoftext|>"} {"text":"<commit_before>#include <avalon\/physics\/loadercallbacks.h>\n#include \"Box2D\/Box2D.h\"\n#include <avalon\/physics\/Box2dContainer.h>\n#include <boost\/any.hpp>\n\nnamespace avalon {\nnamespace physics {\nnamespace loadercallbacks {\n\navalon::io::TiledMapLoader::Callback createShapes(int filterCategory, bool isSensor)\n{\n return [filterCategory](const avalon::io::TiledMapLoader::Configuration& config) {\n\n float x = boost::any_cast<float>(config.settings.at(\"x\"));\n float y = boost::any_cast<float>(config.settings.at(\"y\"));\n float w = boost::any_cast<float>(config.settings.at(\"width\"));\n float h = boost::any_cast<float>(config.settings.at(\"height\"));\n\n float density = 0.0;\n float friction = 1.0;\n float restitution = 0.0;\n std::string bodytype = \"static\";\n\n if (config.settings.count(\"friction\")) {\n friction = boost::any_cast<float>(config.settings.at(\"friction\"));\n }\n if (config.settings.count(\"density\")) {\n density = boost::any_cast<float>(config.settings.at(\"density\"));\n }\n if (config.settings.count(\"restitution\")) {\n restitution = boost::any_cast<float>(config.settings.at(\"restitution\"));\n }\n if (config.settings.count(\"bodytype\")) {\n bodytype = boost::any_cast<std::string>(config.settings.at(\"bodytype\"));\n }\n\n std::string type = \"static\";\n\n \/\/ create the body\n b2BodyDef bodyDef;\n\n if (type == \"static\") {\n bodyDef.type = b2_staticBody;\n } else if (type == \"dynamic\") {\n bodyDef.type = b2_dynamicBody;\n } else if (type == \"kinematic\") {\n bodyDef.type = b2_kinematicBody;\n } else {\n throw new std::invalid_argument(\"Unknown box2d type\");\n }\n\n bodyDef.position.Set((x + (w \/ 2.0f)) \/ config.box2dContainer->pixelsInMeter,\n (y + (h \/ 2.0f)) \/ config.box2dContainer->pixelsInMeter);\n b2Body* body = config.box2dContainer->world->CreateBody(&bodyDef);\n\n std::string shapeType = \"rectangle\";\n\n if (config.settings.count(\"polylinePoints\") > 0)\n shapeType = \"polylinePoints\";\n\n if (config.settings.count(\"points\") > 0)\n shapeType = \"points\";\n\n\n std::shared_ptr<b2Shape> shape;\n\n if (shapeType == \"rectangle\") {\n shape = initRectangleShape(w, h, config.box2dContainer->pixelsInMeter);\n } else if (shapeType == \"polylinePoints\") {\n auto pointList = boost::any_cast<std::list<cocos2d::Point>>(config.settings.at(\"polylinePoints\"));\n if (pointList.size() == 2) {\n int c = 0;\n cocos2d::Point points[2];\n for (auto& p : pointList) {\n points[c] = p;\n ++c;\n }\n shape = initEdgeShape(points[0], points[1], config.box2dContainer->pixelsInMeter);\n } else {\n shape = initChainShape(pointList, config.box2dContainer->pixelsInMeter);\n }\n } else if (shapeType == \"points\") {\n auto pointList = boost::any_cast<std::list<cocos2d::Point>>(config.settings.at(\"points\"));\n if (pointList.size() == 2) {\n int c = 0;\n cocos2d::Point points[2];\n for (auto& p : pointList) {\n points[c] = p;\n ++c;\n }\n shape = initEdgeShape(points[0], points[1], config.box2dContainer->pixelsInMeter);\n } else {\n shape = initChainShape(pointList, config.box2dContainer->pixelsInMeter, true);\n }\n }\n\n \/\/ create the fixture\n b2FixtureDef fixtureDef;\n fixtureDef.shape = shape.get();\n body->CreateFixture(&fixtureDef);\n };\n}\n\nstd::shared_ptr<b2PolygonShape> initRectangleShape(float width, float height, float pixelsInMeter)\n{\n auto shape = make_shared<b2PolygonShape>();\n shape->SetAsBox((width \/ pixelsInMeter) * 0.5f, (height \/ pixelsInMeter) * 0.5f);\n return shape;\n}\n\nstd::shared_ptr<b2PolygonShape> initPolygonShape(int width, int height, float pixelsInMeter)\n{\n auto shape = initRectangleShape(width, height, pixelsInMeter);\n return shape;\n}\n\nstd::shared_ptr<b2CircleShape> initCircleShape()\n{\n auto shape = make_shared<b2CircleShape>();\n return shape;\n}\n\nstd::shared_ptr<b2ChainShape> initChainShape(std::list<cocos2d::Point> points, float pixelsInMeter, bool loop)\n{\n\n std::vector<b2Vec2> vecs;\n vecs.reserve(points.size());\n\n for (auto& p : points) {\n p = p \/ pixelsInMeter;\n vecs.push_back({p.x, -p.y});\n }\n \n auto shape = make_shared<b2ChainShape>();\n\n if (loop) {\n shape->CreateLoop(&vecs[0], points.size());\n } else {\n shape->CreateChain(&vecs[0], points.size());\n }\n\n return shape;\n}\n\nstd::shared_ptr<b2EdgeShape> initEdgeShape(cocos2d::Point p1, cocos2d::Point p2, float pixelsInMeter)\n{\n p1 = p1 \/ pixelsInMeter;\n p2 = p2 \/ pixelsInMeter;\n auto shape = make_shared<b2EdgeShape>();\n shape->Set({p1.x, p1.y}, {p2.x, p2.y});\n return shape;\n}\n \n} \/\/ namesapce loadercallbacks\n} \/\/ namespace physics\n} \/\/ namespace avalon\n<commit_msg>removed unused functions<commit_after>#include <avalon\/physics\/loadercallbacks.h>\n#include \"Box2D\/Box2D.h\"\n#include <avalon\/physics\/Box2dContainer.h>\n#include <boost\/any.hpp>\n\nnamespace avalon {\nnamespace physics {\nnamespace loadercallbacks {\n\navalon::io::TiledMapLoader::Callback createShapes(int filterCategory, bool isSensor)\n{\n return [filterCategory](const avalon::io::TiledMapLoader::Configuration& config) {\n\n float x = boost::any_cast<float>(config.settings.at(\"x\"));\n float y = boost::any_cast<float>(config.settings.at(\"y\"));\n float w = boost::any_cast<float>(config.settings.at(\"width\"));\n float h = boost::any_cast<float>(config.settings.at(\"height\"));\n\n float density = 0.0;\n float friction = 1.0;\n float restitution = 0.0;\n std::string bodytype = \"static\";\n\n if (config.settings.count(\"friction\")) {\n friction = boost::any_cast<float>(config.settings.at(\"friction\"));\n }\n if (config.settings.count(\"density\")) {\n density = boost::any_cast<float>(config.settings.at(\"density\"));\n }\n if (config.settings.count(\"restitution\")) {\n restitution = boost::any_cast<float>(config.settings.at(\"restitution\"));\n }\n if (config.settings.count(\"bodytype\")) {\n bodytype = boost::any_cast<std::string>(config.settings.at(\"bodytype\"));\n }\n\n std::string type = \"static\";\n\n \/\/ create the body\n b2BodyDef bodyDef;\n\n if (type == \"static\") {\n bodyDef.type = b2_staticBody;\n } else if (type == \"dynamic\") {\n bodyDef.type = b2_dynamicBody;\n } else if (type == \"kinematic\") {\n bodyDef.type = b2_kinematicBody;\n } else {\n throw new std::invalid_argument(\"Unknown box2d type\");\n }\n\n bodyDef.position.Set((x + (w \/ 2.0f)) \/ config.box2dContainer->pixelsInMeter,\n (y + (h \/ 2.0f)) \/ config.box2dContainer->pixelsInMeter);\n b2Body* body = config.box2dContainer->world->CreateBody(&bodyDef);\n\n std::string shapeType = \"rectangle\";\n\n if (config.settings.count(\"polylinePoints\") > 0)\n shapeType = \"polylinePoints\";\n\n if (config.settings.count(\"points\") > 0)\n shapeType = \"points\";\n\n\n std::shared_ptr<b2Shape> shape;\n\n if (shapeType == \"rectangle\") {\n shape = initRectangleShape(w, h, config.box2dContainer->pixelsInMeter);\n } else if (shapeType == \"polylinePoints\") {\n auto pointList = boost::any_cast<std::list<cocos2d::Point>>(config.settings.at(\"polylinePoints\"));\n if (pointList.size() == 2) {\n int c = 0;\n cocos2d::Point points[2];\n for (auto& p : pointList) {\n points[c] = p;\n ++c;\n }\n shape = initEdgeShape(points[0], points[1], config.box2dContainer->pixelsInMeter);\n } else {\n shape = initChainShape(pointList, config.box2dContainer->pixelsInMeter);\n }\n } else if (shapeType == \"points\") {\n auto pointList = boost::any_cast<std::list<cocos2d::Point>>(config.settings.at(\"points\"));\n if (pointList.size() == 2) {\n int c = 0;\n cocos2d::Point points[2];\n for (auto& p : pointList) {\n points[c] = p;\n ++c;\n }\n shape = initEdgeShape(points[0], points[1], config.box2dContainer->pixelsInMeter);\n } else {\n shape = initChainShape(pointList, config.box2dContainer->pixelsInMeter, true);\n }\n }\n\n \/\/ create the fixture\n b2FixtureDef fixtureDef;\n fixtureDef.shape = shape.get();\n body->CreateFixture(&fixtureDef);\n };\n}\n\nstd::shared_ptr<b2PolygonShape> initRectangleShape(float width, float height, float pixelsInMeter)\n{\n auto shape = make_shared<b2PolygonShape>();\n shape->SetAsBox((width \/ pixelsInMeter) * 0.5f, (height \/ pixelsInMeter) * 0.5f);\n return shape;\n}\n\nstd::shared_ptr<b2ChainShape> initChainShape(std::list<cocos2d::Point> points, float pixelsInMeter, bool loop)\n{\n\n std::vector<b2Vec2> vecs;\n vecs.reserve(points.size());\n\n for (auto& p : points) {\n p = p \/ pixelsInMeter;\n vecs.push_back({p.x, -p.y});\n }\n \n auto shape = make_shared<b2ChainShape>();\n\n if (loop) {\n shape->CreateLoop(&vecs[0], points.size());\n } else {\n shape->CreateChain(&vecs[0], points.size());\n }\n\n return shape;\n}\n\nstd::shared_ptr<b2EdgeShape> initEdgeShape(cocos2d::Point p1, cocos2d::Point p2, float pixelsInMeter)\n{\n p1 = p1 \/ pixelsInMeter;\n p2 = p2 \/ pixelsInMeter;\n auto shape = make_shared<b2EdgeShape>();\n shape->Set({p1.x, p1.y}, {p2.x, p2.y});\n return shape;\n}\n \n} \/\/ namesapce loadercallbacks\n} \/\/ namespace physics\n} \/\/ namespace avalon\n<|endoftext|>"} {"text":"<commit_before>\/\/===- lib\/Linker\/LinkItems.cpp - Link LLVM objects and libraries ---------===\/\/\n\/\/ \n\/\/ The LLVM Compiler Infrastructure\n\/\/\n\/\/ This file was developed by Reid Spencer and is distributed under the \n\/\/ University of Illinois Open Source License. See LICENSE.TXT for details.\n\/\/ \n\/\/===----------------------------------------------------------------------===\/\/\n\/\/\n\/\/ This file contains routines to handle linking together LLVM bytecode files,\n\/\/ and to handle annoying things like static libraries.\n\/\/\n\/\/===----------------------------------------------------------------------===\/\/\n\n#include \"llvm\/Linker.h\"\n#include \"llvm\/Module.h\"\n#include \"llvm\/ModuleProvider.h\"\n#include \"llvm\/PassManager.h\"\n#include \"llvm\/ADT\/SetOperations.h\"\n#include \"llvm\/Bytecode\/Reader.h\"\n#include \"llvm\/Bytecode\/Archive.h\"\n#include \"llvm\/Bytecode\/WriteBytecodePass.h\"\n#include \"llvm\/Target\/TargetData.h\"\n#include \"llvm\/Transforms\/IPO.h\"\n#include \"llvm\/Transforms\/Scalar.h\"\n#include \"llvm\/Config\/config.h\"\n#include \"llvm\/Support\/CommandLine.h\"\n#include \"llvm\/Support\/FileUtilities.h\"\n#include \"llvm\/Support\/Timer.h\"\n#include \"llvm\/System\/Signals.h\"\n#include \"llvm\/Support\/SystemUtils.h\"\n#include <algorithm>\n#include <fstream>\n#include <memory>\n#include <set>\nusing namespace llvm;\n\nstatic bool \nLinkOneLibrary(const char*progname, Module* HeadModule, \n const std::string& Lib, \n const std::vector<std::string>& LibPaths,\n bool Verbose, bool Native) {\n\n \/\/ String in which to receive error messages.\n std::string ErrorMessage;\n\n \/\/ Determine where this library lives.\n std::string Pathname = FindLib(Lib, LibPaths);\n if (Pathname.empty()) {\n \/\/ If the pathname does not exist, then simply return if we're doing a \n \/\/ native link and give a warning if we're doing a bytecode link.\n if (!Native) {\n std::cerr << progname << \": warning: Cannot find library '\"\n << Lib << \"'\\n\";\n return false;\n }\n }\n\n \/\/ A user may specify an ar archive without -l, perhaps because it\n \/\/ is not installed as a library. Detect that and link the library.\n if (IsArchive(Pathname)) {\n if (Verbose)\n std::cerr << \"Trying to link archive '\" << Pathname << \"' (-l\"\n << Lib << \")\\n\";\n\n if (LinkInArchive(HeadModule, Pathname, &ErrorMessage, Verbose)) {\n std::cerr << progname << \": \" << ErrorMessage\n << \": Error linking in archive '\" << Pathname << \"' (-l\"\n << Lib << \")\\n\";\n return true;\n }\n } else {\n std::cerr << progname << \": WARNING: Supposed library -l\"\n << Lib << \" isn't a library.\\n\";\n }\n return false;\n}\n\n\/\/ LinkItems - preserve link order for an arbitrary set of linkage items.\nModule* \nllvm::LinkItems(const char *progname, const LinkItemList& Items,\n const std::vector<std::string>& LibPaths,\n bool Verbose, bool Native) {\n\n \/\/ Construct the HeadModule to contain the result of the linkage\n std::auto_ptr<Module> HeadModule(new Module(progname));\n\n \/\/ Construct a mutable path list we can add paths to. This list will always\n \/\/ have LLVM_LIB_SEARCH_PATH at the end so we place it there now.\n std::vector<std::string> MyLibPaths(LibPaths);\n MyLibPaths.insert(MyLibPaths.begin(),\".\");\n char* SearchPath = getenv(\"LLVM_LIB_SEARCH_PATH\");\n if (SearchPath)\n MyLibPaths.push_back(SearchPath);\n\n \/\/ For each linkage item ...\n for (LinkItemList::const_iterator I = Items.begin(), E = Items.end(); \n I != E; ++I) {\n if (I->second) {\n \/\/ Link in the library suggested.\n if (LinkOneLibrary(progname,HeadModule.get(),I->first,MyLibPaths,\n Verbose,Native))\n return 0;\n } else {\n std::vector<std::string> Files;\n Files.push_back(I->first);\n if (LinkFiles(progname,HeadModule.get(),Files,Verbose))\n return 0;\n }\n }\n\n \/\/ At this point we have processed all the link items provided to us. Since\n \/\/ we have an aggregated module at this point, the dependent libraries in\n \/\/ that module should also be aggregated with duplicates eliminated. This is\n \/\/ now the time to process the dependent libraries to resolve any remaining\n \/\/ symbols.\n const Module::LibraryListType& DepLibs = HeadModule->getLibraries();\n for (Module::LibraryListType::const_iterator I = DepLibs.begin(), \n E = DepLibs.end(); I != E; ++I) {\n if(LinkOneLibrary(progname,HeadModule.get(),*I,MyLibPaths,Verbose,Native))\n return 0;\n }\n\n return HeadModule.release();\n}\n\n\/\/ BuildLinkItems -- This function\nvoid llvm::BuildLinkItems(\n LinkItemList& Items,\n const cl::list<std::string>& Files,\n const cl::list<std::string>& Libraries) {\n\n \/\/ Build the list of linkage items for LinkItems. \n\n cl::list<std::string>::const_iterator fileIt = Files.begin();\n cl::list<std::string>::const_iterator libIt = Libraries.begin();\n\n int libPos = -1, filePos = -1;\n while ( 1 ) {\n if (libIt != Libraries.end())\n libPos = Libraries.getPosition(libIt - Libraries.begin());\n else\n libPos = -1;\n if (fileIt != Files.end())\n filePos = Files.getPosition(fileIt - Files.begin());\n else\n filePos = -1;\n\n if (filePos != -1 && (libPos == -1 || filePos < libPos)) {\n \/\/ Add a source file\n Items.push_back(std::make_pair(*fileIt++, false));\n } else if (libPos != -1 && (filePos == -1 || libPos < filePos)) {\n \/\/ Add a library\n Items.push_back(std::make_pair(*libIt++, true));\n } else {\n break; \/\/ we're done with the list\n }\n }\n}\n<commit_msg>For PR351: \\ * Remove redundant static function LinkOneLibrary. \\ * Remove unneded #includes \\ * Convert FileSupport usage to sys::Path instead<commit_after>\/\/===- lib\/Linker\/LinkItems.cpp - Link LLVM objects and libraries ---------===\/\/\n\/\/ \n\/\/ The LLVM Compiler Infrastructure\n\/\/\n\/\/ This file was developed by Reid Spencer and is distributed under the \n\/\/ University of Illinois Open Source License. See LICENSE.TXT for details.\n\/\/ \n\/\/===----------------------------------------------------------------------===\/\/\n\/\/\n\/\/ This file contains routines to handle linking together LLVM bytecode files,\n\/\/ and to handle annoying things like static libraries.\n\/\/\n\/\/===----------------------------------------------------------------------===\/\/\n\n#include \"llvm\/Linker.h\"\n#include \"llvm\/Module.h\"\n\nusing namespace llvm;\n\n\/\/ LinkItems - preserve link order for an arbitrary set of linkage items.\nbool\nLinker::LinkInItems(const ItemList& Items) {\n \/\/ For each linkage item ...\n for (ItemList::const_iterator I = Items.begin(), E = Items.end(); \n I != E; ++I) {\n if (I->second) {\n \/\/ Link in the library suggested.\n if (LinkInLibrary(I->first))\n return true;\n } else {\n if (LinkInFile(sys::Path(I->first)))\n return true;\n }\n }\n\n \/\/ At this point we have processed all the link items provided to us. Since\n \/\/ we have an aggregated module at this point, the dependent libraries in\n \/\/ that module should also be aggregated with duplicates eliminated. This is\n \/\/ now the time to process the dependent libraries to resolve any remaining\n \/\/ symbols.\n const Module::LibraryListType& DepLibs = Composite->getLibraries();\n for (Module::LibraryListType::const_iterator I = DepLibs.begin(), \n E = DepLibs.end(); I != E; ++I) {\n if(LinkInLibrary(*I))\n return true;\n }\n\n return false;\n}\n<|endoftext|>"} {"text":"<commit_before>#pragma once\n\n#include <vector>\n\n#include \"acmacs-base\/fmt.hh\"\n#include \"acmacs-base\/range-v3.hh\"\n\n\/\/ ----------------------------------------------------------------------\n\nnamespace acmacs\n{\n namespace detail\n {\n template <typename Key, typename Value> class map_base_t\n {\n public:\n using entry_type = std::pair<Key, Value>;\n using const_iterator = typename std::vector<entry_type>::const_iterator;\n\n \/\/ map_base_t() = default;\n virtual ~map_base_t() = default;\n\n bool empty() const noexcept { return data_.empty(); }\n constexpr const auto& data() const noexcept { return data_; }\n\n template <typename Range> void collect(Range&& rng, bool check_result = true)\n {\n data_ = rng | ranges::to<std::vector>;\n sorted_ = false;\n if (check_result && data_.size() > 1)\n check();\n }\n\n template <typename EKey, typename EValue> auto& emplace(EKey&& key, EValue&& value)\n {\n sorted_ = false;\n return data_.emplace_back(std::forward<EKey>(key), std::forward<EValue>(value));\n }\n\n protected:\n constexpr auto& data() noexcept { return data_; }\n \/\/ constexpr bool sorted() const noexcept { return sorted_; }\n\n template <typename FindKey> const_iterator find_first(const FindKey& key) const noexcept\n {\n sort();\n return std::lower_bound(std::begin(data_), std::end(data_), key, [](const auto& e1, const auto& k2) { return e1.first < k2; });\n }\n\n virtual void check() const {}\n\n void sort() const noexcept\n {\n if (!sorted_) {\n ranges::sort(data_, [](const auto& e1, const auto& e2) { return e1.first < e2.first; });\n sorted_ = true;\n }\n }\n\n private:\n mutable std::vector<entry_type> data_;\n mutable bool sorted_{false};\n\n };\n } \/\/ namespace detail\n\n \/\/ ----------------------------------------------------------------------\n\n \/\/ see seqdb.cc Seqdb::hash_index() for sample usage\n template <typename Key, typename Value> class map_with_duplicating_keys_t : public detail::map_base_t<Key, Value>\n {\n public:\n using const_iterator = typename detail::map_base_t<Key, Value>::const_iterator;\n\n template <typename FindKey> std::pair<const_iterator, const_iterator> find(const FindKey& key) const noexcept\n {\n const auto first = this->find_first(key);\n \/\/ first may point to the wrong key, if key is not in the map\n return {first, std::find_if(first, std::end(this->data()), [&key](const auto& en) { return en.first != key; })};\n }\n\n };\n\n \/\/ ----------------------------------------------------------------------\n\n class map_with_unique_keys_error : public std::runtime_error\n {\n public:\n using std::runtime_error::runtime_error;\n };\n\n \/\/ see seqdb.cc Seqdb::seq_id_index() for sample usage\n template <typename Key, typename Value> class map_with_unique_keys_t : public detail::map_base_t<Key, Value>\n {\n public:\n using const_iterator = typename detail::map_base_t<Key, Value>::const_iterator;\n\n template <typename FindKey> const Value* find(const FindKey& key) const noexcept\n {\n if (const auto first = this->find_first(key); first->first == key)\n return &first->second;\n else\n return nullptr;\n }\n\n protected:\n void check() const override\n {\n this->sort();\n for (auto cur = std::next(std::begin(this->data())); cur != std::end(this->data()); ++cur) {\n if (cur->first == std::prev(cur)->first)\n throw map_with_unique_keys_error{\"duplicating keys within map_with_unique_keys_t\"};\n }\n }\n\n };\n\n \/\/ ----------------------------------------------------------------------\n\n template <typename Key, typename Value> class small_map_with_unique_keys_t\n {\n public:\n using entry_type = std::pair<Key, Value>;\n using const_iterator = typename std::vector<entry_type>::const_iterator;\n\n small_map_with_unique_keys_t() = default;\n \/\/ template <typename Iter> small_map_with_unique_keys_t(Iter first, Iter last) : data_(first, last) {}\n small_map_with_unique_keys_t(std::initializer_list<entry_type> init) : data_{init} {}\n\n constexpr const auto& data() const noexcept { return data_; }\n auto begin() const noexcept { return data_.begin(); }\n auto end() const noexcept { return data_.end(); }\n auto empty() const noexcept { return data_.empty(); }\n auto size() const noexcept { return data_.size(); }\n\n template <typename K> auto find(const K& key) const noexcept\n {\n return std::find_if(std::begin(data_), std::end(data_), [&key](const auto& en) { return en.first == key; });\n }\n\n template <typename K> auto find(const K& key) noexcept\n {\n return std::find_if(std::begin(data_), std::end(data_), [&key](const auto& en) { return en.first == key; });\n }\n\n Value& at(const Key& key)\n {\n if (const auto found = find(key); found != std::end(data_))\n return found->second;\n throw std::out_of_range{fmt::format(\"acmacs::small_map_with_unique_keys_t::at(): no key: {}\", key)};\n }\n\n const Value& at(const Key& key) const\n {\n if (const auto found = find(key); found != std::end(data_))\n return found->second;\n throw std::out_of_range{fmt::format(\"acmacs::small_map_with_unique_keys_t::at(): no key: {}\", key)};\n }\n\n auto& emplace_or_replace(const Key& key, const Value& value)\n {\n if (auto found = find(key); found != end())\n return *found;\n else\n return data_.emplace_back(key, value);\n }\n\n private:\n std::vector<entry_type> data_;\n };\n\n \/\/ ----------------------------------------------------------------------\n\n template <typename Key, typename Value> class flat_map_t\n {\n public:\n using key_type = Key;\n using value_type = Value;\n using entry_type = std::pair<Key, Value>;\n\n flat_map_t() = default;\n template <typename Iter> flat_map_t(Iter first, Iter last) : data_(first, last) {}\n flat_map_t(std::initializer_list<entry_type> init) : data_{init} {}\n\n auto begin() const { return data_.begin(); }\n auto end() const { return data_.end(); }\n auto empty() const { return data_.empty(); }\n auto size() const { return data_.size(); }\n const auto& operator[](size_t index) const { return data_[index]; }\n const auto& back() const { return data_.back(); }\n auto& back() { return data_.back(); }\n void sort_by_key()\n {\n std::sort(std::begin(data_), std::end(data_), [](const auto& e1, const auto& e2) { return e1.first < e2.first; });\n }\n void sort_by_value()\n {\n std::sort(std::begin(data_), std::end(data_), [](const auto& e1, const auto& e2) { return e1.second < e2.second; });\n }\n void sort_by_value_reverse()\n {\n std::sort(std::begin(data_), std::end(data_), [](const auto& e1, const auto& e2) { return e1.second > e2.second; });\n }\n\n template <typename K> auto find(const K& key) const\n {\n return std::find_if(std::begin(data_), std::end(data_), [&key](const auto& en) { return en.first == key; });\n }\n\n template <typename K> auto find(const K& key)\n {\n return std::find_if(std::begin(data_), std::end(data_), [&key](const auto& en) { return en.first == key; });\n }\n template <typename K> bool exists(const K& key) const { return find(key) != std::end(data_); }\n\n Value& at(const Key& key)\n {\n if (const auto found = find(key); found != std::end(data_))\n return found->second;\n throw std::out_of_range{fmt::format(\"acmacs::flat_map_t::at(): no key: {}\", key)};\n }\n\n const Value& at(const Key& key) const\n {\n if (const auto found = find(key); found != std::end(data_))\n return found->second;\n throw std::out_of_range{fmt::format(\"acmacs::flat_map_t::at(): no key: {}\", key)};\n }\n\n const Value* at_ptr(const Key& key) const\n {\n if (const auto found = find(key); found != std::end(data_))\n return &found->second;\n else\n return nullptr;\n }\n\n auto& emplace(const Key& key, const Value& value) { return data_.emplace_back(key, value); }\n auto& emplace(Key&& key, Value&& value) { return data_.emplace_back(std::move(key), std::move(value)); }\n\n auto& emplace_or_replace(const Key& key, const Value& value)\n {\n if (auto found = find(key); found != std::end(data_)) {\n found->second = value;\n return *found;\n }\n else\n return emplace(key, value);\n }\n\n auto& emplace_not_replace(const Key& key, const Value& value)\n {\n if (auto found = find(key); found != std::end(data_))\n return *found;\n else\n return emplace(key, value);\n }\n\n auto& emplace_not_replace(const Key& key)\n {\n if (auto found = find(key); found != std::end(data_))\n return *found;\n else\n return emplace(key, Value{});\n }\n\n void reserve(size_t sz) { data_.reserve(sz); }\n\n private:\n std::vector<entry_type> data_;\n };\n\n} \/\/ namespace acmacs\n\n\/\/ ----------------------------------------------------------------------\n\/\/\/ Local Variables:\n\/\/\/ eval: (if (fboundp 'eu-rename-buffer) (eu-rename-buffer))\n\/\/\/ End:\n<commit_msg>small_map_with_unique_keys_t improvements<commit_after>#pragma once\n\n#include <vector>\n\n#include \"acmacs-base\/fmt.hh\"\n#include \"acmacs-base\/range-v3.hh\"\n\n\/\/ ----------------------------------------------------------------------\n\nnamespace acmacs\n{\n namespace detail\n {\n template <typename Key, typename Value> class map_base_t\n {\n public:\n using entry_type = std::pair<Key, Value>;\n using const_iterator = typename std::vector<entry_type>::const_iterator;\n\n \/\/ map_base_t() = default;\n virtual ~map_base_t() = default;\n\n bool empty() const noexcept { return data_.empty(); }\n constexpr const auto& data() const noexcept { return data_; }\n\n template <typename Range> void collect(Range&& rng, bool check_result = true)\n {\n data_ = rng | ranges::to<std::vector>;\n sorted_ = false;\n if (check_result && data_.size() > 1)\n check();\n }\n\n template <typename EKey, typename EValue> auto& emplace(EKey&& key, EValue&& value)\n {\n sorted_ = false;\n return data_.emplace_back(std::forward<EKey>(key), std::forward<EValue>(value));\n }\n\n protected:\n constexpr auto& data() noexcept { return data_; }\n \/\/ constexpr bool sorted() const noexcept { return sorted_; }\n\n template <typename FindKey> const_iterator find_first(const FindKey& key) const noexcept\n {\n sort();\n return std::lower_bound(std::begin(data_), std::end(data_), key, [](const auto& e1, const auto& k2) { return e1.first < k2; });\n }\n\n virtual void check() const {}\n\n void sort() const noexcept\n {\n if (!sorted_) {\n ranges::sort(data_, [](const auto& e1, const auto& e2) { return e1.first < e2.first; });\n sorted_ = true;\n }\n }\n\n private:\n mutable std::vector<entry_type> data_;\n mutable bool sorted_{false};\n\n };\n } \/\/ namespace detail\n\n \/\/ ----------------------------------------------------------------------\n\n \/\/ see seqdb.cc Seqdb::hash_index() for sample usage\n template <typename Key, typename Value> class map_with_duplicating_keys_t : public detail::map_base_t<Key, Value>\n {\n public:\n using const_iterator = typename detail::map_base_t<Key, Value>::const_iterator;\n\n template <typename FindKey> std::pair<const_iterator, const_iterator> find(const FindKey& key) const noexcept\n {\n const auto first = this->find_first(key);\n \/\/ first may point to the wrong key, if key is not in the map\n return {first, std::find_if(first, std::end(this->data()), [&key](const auto& en) { return en.first != key; })};\n }\n\n };\n\n \/\/ ----------------------------------------------------------------------\n\n class map_with_unique_keys_error : public std::runtime_error\n {\n public:\n using std::runtime_error::runtime_error;\n };\n\n \/\/ see seqdb.cc Seqdb::seq_id_index() for sample usage\n template <typename Key, typename Value> class map_with_unique_keys_t : public detail::map_base_t<Key, Value>\n {\n public:\n using const_iterator = typename detail::map_base_t<Key, Value>::const_iterator;\n\n template <typename FindKey> const Value* find(const FindKey& key) const noexcept\n {\n if (const auto first = this->find_first(key); first->first == key)\n return &first->second;\n else\n return nullptr;\n }\n\n protected:\n void check() const override\n {\n this->sort();\n for (auto cur = std::next(std::begin(this->data())); cur != std::end(this->data()); ++cur) {\n if (cur->first == std::prev(cur)->first)\n throw map_with_unique_keys_error{\"duplicating keys within map_with_unique_keys_t\"};\n }\n }\n\n };\n\n \/\/ ----------------------------------------------------------------------\n\n template <typename Key, typename Value> class small_map_with_unique_keys_t\n {\n public:\n using entry_type = std::pair<Key, Value>;\n using const_iterator = typename std::vector<entry_type>::const_iterator;\n\n small_map_with_unique_keys_t() = default;\n \/\/ template <typename Iter> small_map_with_unique_keys_t(Iter first, Iter last) : data_(first, last) {}\n small_map_with_unique_keys_t(std::initializer_list<entry_type> init) : data_{init} {}\n\n constexpr const auto& data() const noexcept { return data_; }\n auto begin() const noexcept { return data_.begin(); }\n auto end() const noexcept { return data_.end(); }\n auto empty() const noexcept { return data_.empty(); }\n auto size() const noexcept { return data_.size(); }\n\n template <typename K> auto find(const K& key) const noexcept\n {\n return std::find_if(std::begin(data_), std::end(data_), [&key](const auto& en) { return en.first == key; });\n }\n\n template <typename K> auto find(const K& key) noexcept\n {\n return std::find_if(std::begin(data_), std::end(data_), [&key](const auto& en) { return en.first == key; });\n }\n\n template <typename K, typename Callback> void find_then(const K& key, Callback callback) const noexcept\n {\n if (const auto& en = find(key); en != std::end(data_))\n callback(en->second);\n }\n\n template <typename K> Value& get(const K& key)\n {\n if (const auto found = find(key); found != std::end(data_))\n return found->second;\n throw std::out_of_range{fmt::format(\"acmacs::small_map_with_unique_keys_t::at(): no key: {}\", key)};\n }\n\n template <typename K> const Value& get(const K& key) const\n {\n if (const auto found = find(key); found != std::end(data_))\n return found->second;\n throw std::out_of_range{fmt::format(\"acmacs::small_map_with_unique_keys_t::at(): no key: {}\", key)};\n }\n\n template <typename K, typename V> const Value& get_or(const K& key, const V& dflt) const\n {\n if (const auto found = find(key); found != std::end(data_))\n return found->second;\n else\n return dflt;\n }\n\n template <typename K, typename V> auto& emplace_or_replace(const K& key, const V& value)\n {\n if (auto found = find(key); found != end()) {\n found->second = Value{value};\n return *found;\n }\n else\n return data_.emplace_back(Key{key}, Value{value});\n }\n\n template <typename K, typename V = Value> auto& emplace_not_replace(const K& key, const V& value = V{})\n {\n if (auto found = find(key); found != end())\n return *found;\n else\n return data_.emplace_back(Key{key}, Value{value});\n }\n\n private:\n std::vector<entry_type> data_;\n\n }; \/\/ small_map_with_unique_keys_t<Key, Value>\n\n \/\/ ----------------------------------------------------------------------\n\n template <typename Key, typename Value> class flat_map_t\n {\n public:\n using key_type = Key;\n using value_type = Value;\n using entry_type = std::pair<Key, Value>;\n\n flat_map_t() = default;\n template <typename Iter> flat_map_t(Iter first, Iter last) : data_(first, last) {}\n flat_map_t(std::initializer_list<entry_type> init) : data_{init} {}\n\n auto begin() const { return data_.begin(); }\n auto end() const { return data_.end(); }\n auto empty() const { return data_.empty(); }\n auto size() const { return data_.size(); }\n const auto& operator[](size_t index) const { return data_[index]; }\n const auto& back() const { return data_.back(); }\n auto& back() { return data_.back(); }\n void sort_by_key()\n {\n std::sort(std::begin(data_), std::end(data_), [](const auto& e1, const auto& e2) { return e1.first < e2.first; });\n }\n void sort_by_value()\n {\n std::sort(std::begin(data_), std::end(data_), [](const auto& e1, const auto& e2) { return e1.second < e2.second; });\n }\n void sort_by_value_reverse()\n {\n std::sort(std::begin(data_), std::end(data_), [](const auto& e1, const auto& e2) { return e1.second > e2.second; });\n }\n\n template <typename K> auto find(const K& key) const\n {\n return std::find_if(std::begin(data_), std::end(data_), [&key](const auto& en) { return en.first == key; });\n }\n\n template <typename K> auto find(const K& key)\n {\n return std::find_if(std::begin(data_), std::end(data_), [&key](const auto& en) { return en.first == key; });\n }\n template <typename K> bool exists(const K& key) const { return find(key) != std::end(data_); }\n\n Value& at(const Key& key)\n {\n if (const auto found = find(key); found != std::end(data_))\n return found->second;\n throw std::out_of_range{fmt::format(\"acmacs::flat_map_t::at(): no key: {}\", key)};\n }\n\n const Value& at(const Key& key) const\n {\n if (const auto found = find(key); found != std::end(data_))\n return found->second;\n throw std::out_of_range{fmt::format(\"acmacs::flat_map_t::at(): no key: {}\", key)};\n }\n\n const Value* at_ptr(const Key& key) const\n {\n if (const auto found = find(key); found != std::end(data_))\n return &found->second;\n else\n return nullptr;\n }\n\n auto& emplace(const Key& key, const Value& value) { return data_.emplace_back(key, value); }\n auto& emplace(Key&& key, Value&& value) { return data_.emplace_back(std::move(key), std::move(value)); }\n\n auto& emplace_or_replace(const Key& key, const Value& value)\n {\n if (auto found = find(key); found != std::end(data_)) {\n found->second = value;\n return *found;\n }\n else\n return emplace(key, value);\n }\n\n auto& emplace_not_replace(const Key& key, const Value& value)\n {\n if (auto found = find(key); found != std::end(data_))\n return *found;\n else\n return emplace(key, value);\n }\n\n auto& emplace_not_replace(const Key& key)\n {\n if (auto found = find(key); found != std::end(data_))\n return *found;\n else\n return emplace(key, Value{});\n }\n\n void reserve(size_t sz) { data_.reserve(sz); }\n\n private:\n std::vector<entry_type> data_;\n };\n\n} \/\/ namespace acmacs\n\n\/\/ ----------------------------------------------------------------------\n\/\/\/ Local Variables:\n\/\/\/ eval: (if (fboundp 'eu-rename-buffer) (eu-rename-buffer))\n\/\/\/ End:\n<|endoftext|>"} {"text":"<commit_before>\/\/ 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 \"config.h\"\n\n#include <string>\n\n#include \"Document.h\"\n#include \"EventListener.h\"\n#include \"InspectorController.h\"\n#include \"InspectorFrontend.h\"\n#include \"InspectorResource.h\"\n#include \"Node.h\"\n#include \"Page.h\"\n#include \"PlatformString.h\"\n#include \"ScriptObject.h\"\n#include \"ScriptState.h\"\n#include \"ScriptValue.h\"\n#include \"V8Binding.h\"\n#include \"V8Proxy.h\"\n#include <wtf\/OwnPtr.h>\n#undef LOG\n\n#include \"base\/values.h\"\n#include \"webkit\/api\/public\/WebDataSource.h\"\n#include \"webkit\/api\/public\/WebURL.h\"\n#include \"webkit\/api\/public\/WebURLRequest.h\"\n#include \"webkit\/glue\/devtools\/bound_object.h\"\n#include \"webkit\/glue\/devtools\/debugger_agent_impl.h\"\n#include \"webkit\/glue\/devtools\/debugger_agent_manager.h\"\n#include \"webkit\/glue\/devtools\/dom_agent_impl.h\"\n#include \"webkit\/glue\/glue_util.h\"\n#include \"webkit\/glue\/webdevtoolsagent_delegate.h\"\n#include \"webkit\/glue\/webdevtoolsagent_impl.h\"\n#include \"webkit\/glue\/webview_impl.h\"\n\nusing WebCore::Document;\nusing WebCore::InspectorController;\nusing WebCore::InspectorFrontend;\nusing WebCore::InspectorResource;\nusing WebCore::Node;\nusing WebCore::Page;\nusing WebCore::ScriptObject;\nusing WebCore::ScriptState;\nusing WebCore::ScriptValue;\nusing WebCore::String;\nusing WebCore::V8ClassIndex;\nusing WebCore::V8DOMWrapper;\nusing WebCore::V8Proxy;\nusing WebKit::WebDataSource;\nusing WebKit::WebFrame;\nusing WebKit::WebURLRequest;\n\nWebDevToolsAgentImpl::WebDevToolsAgentImpl(\n WebViewImpl* web_view_impl,\n WebDevToolsAgentDelegate* delegate)\n : host_id_(delegate->GetHostId()),\n delegate_(delegate),\n web_view_impl_(web_view_impl),\n document_(NULL),\n attached_(false) {\n debugger_agent_delegate_stub_.set(new DebuggerAgentDelegateStub(this));\n dom_agent_delegate_stub_.set(new DomAgentDelegateStub(this));\n tools_agent_delegate_stub_.set(new ToolsAgentDelegateStub(this));\n tools_agent_native_delegate_stub_.set(new ToolsAgentNativeDelegateStub(this));\n}\n\nWebDevToolsAgentImpl::~WebDevToolsAgentImpl() {\n DebuggerAgentManager::OnWebViewClosed(web_view_impl_);\n DisposeUtilityContext();\n}\n\nvoid WebDevToolsAgentImpl::DisposeUtilityContext() {\n if (!utility_context_.IsEmpty()) {\n utility_context_.Dispose();\n utility_context_.Clear();\n }\n}\n\nvoid WebDevToolsAgentImpl::Attach() {\n if (attached_) {\n return;\n }\n debugger_agent_impl_.set(\n new DebuggerAgentImpl(web_view_impl_,\n debugger_agent_delegate_stub_.get(),\n this));\n Page* page = web_view_impl_->page();\n dom_agent_impl_.set(new DomAgentImpl(dom_agent_delegate_stub_.get()));\n\n \/\/ We are potentially attaching to the running page -> init agents with\n \/\/ Document if any.\n Document* doc = page->mainFrame()->document();\n if (doc) {\n \/\/ Reuse existing context in case detached\/attached.\n if (utility_context_.IsEmpty()) {\n debugger_agent_impl_->ResetUtilityContext(doc, &utility_context_);\n InitDevToolsAgentHost();\n }\n\n dom_agent_impl_->SetDocument(doc);\n\n InspectorController* ic = web_view_impl_->page()->inspectorController();\n \/\/ Unhide resources panel if necessary.\n tools_agent_delegate_stub_->SetResourcesPanelEnabled(\n ic->resourceTrackingEnabled());\n v8::HandleScope scope;\n ScriptState* state = scriptStateFromPage(web_view_impl_->page());\n ic->setFrontendProxyObject(\n state,\n ScriptObject(state, utility_context_->Global()));\n \/\/ Allow controller to send messages to the frontend.\n ic->setWindowVisible(true, false);\n }\n attached_ = true;\n}\n\nvoid WebDevToolsAgentImpl::Detach() {\n \/\/ Prevent controller from sending messages to the frontend.\n InspectorController* ic = web_view_impl_->page()->inspectorController();\n ic->setWindowVisible(false, false);\n HideDOMNodeHighlight();\n devtools_agent_host_.set(NULL);\n debugger_agent_impl_.set(NULL);\n dom_agent_impl_.set(NULL);\n attached_ = false;\n}\n\nvoid WebDevToolsAgentImpl::OnNavigate() {\n DebuggerAgentManager::OnNavigate();\n}\n\nvoid WebDevToolsAgentImpl::SetMainFrameDocumentReady(bool ready) {\n if (!attached_) {\n return;\n }\n\n \/\/ We were attached prior to the page load -> init agents with Document.\n Document* doc;\n if (ready) {\n Page* page = web_view_impl_->page();\n doc = page->mainFrame()->document();\n } else {\n doc = NULL;\n }\n if (doc) {\n debugger_agent_impl_->ResetUtilityContext(doc, &utility_context_);\n InitDevToolsAgentHost();\n }\n dom_agent_impl_->SetDocument(doc);\n}\n\nvoid WebDevToolsAgentImpl::DidCommitLoadForFrame(\n WebViewImpl* webview,\n WebFrame* frame,\n bool is_new_navigation) {\n if (!attached_) {\n DisposeUtilityContext();\n return;\n }\n WebDataSource* ds = frame->dataSource();\n const WebURLRequest& request = ds->request();\n GURL url = ds->hasUnreachableURL() ?\n ds->unreachableURL() :\n request.url();\n if (webview->GetMainFrame() == frame) {\n tools_agent_delegate_stub_->FrameNavigate(\n url.possibly_invalid_spec());\n }\n InspectorController* ic = webview->page()->inspectorController();\n \/\/ Unhide resources panel if necessary.\n tools_agent_delegate_stub_->SetResourcesPanelEnabled(\n ic->resourceTrackingEnabled());\n}\n\nvoid WebDevToolsAgentImpl::WindowObjectCleared(WebFrameImpl* webframe) {\n DebuggerAgentManager::SetHostId(webframe, host_id_);\n if (attached_) {\n \/\/ Push context id into the client if it is already attached.\n debugger_agent_delegate_stub_->SetContextId(host_id_);\n }\n}\n\nvoid WebDevToolsAgentImpl::ForceRepaint() {\n delegate_->ForceRepaint();\n}\n\nvoid WebDevToolsAgentImpl::HighlightDOMNode(int node_id) {\n if (!attached_) {\n return;\n }\n Node* node = dom_agent_impl_->GetNodeForId(node_id);\n if (!node) {\n return;\n }\n Page* page = web_view_impl_->page();\n page->inspectorController()->highlight(node);\n}\n\nvoid WebDevToolsAgentImpl::HideDOMNodeHighlight() {\n Page* page = web_view_impl_->page();\n if (page) {\n page->inspectorController()->hideHighlight();\n }\n}\n\nvoid WebDevToolsAgentImpl::ExecuteUtilityFunction(\n int call_id,\n const String& function_name,\n const String& json_args) {\n String result;\n String exception;\n result = debugger_agent_impl_->ExecuteUtilityFunction(utility_context_,\n function_name, json_args, &exception);\n tools_agent_delegate_stub_->DidExecuteUtilityFunction(call_id,\n result, exception);\n}\n\nvoid WebDevToolsAgentImpl::EvaluateJavaScript(\n int call_id,\n const WebCore::String& source) {\n String exception;\n String result = debugger_agent_impl_->EvaluateJavaScript(utility_context_,\n source, &exception);\n tools_agent_delegate_stub_->DidEvaluateJavaScript(call_id, result, exception);\n}\n\nvoid WebDevToolsAgentImpl::ClearConsoleMessages() {\n Page* page = web_view_impl_->page();\n if (page) {\n page->inspectorController()->clearConsoleMessages();\n }\n}\n\nvoid WebDevToolsAgentImpl::GetResourceContent(\n int call_id,\n int identifier) {\n String content;\n Page* page = web_view_impl_->page();\n if (page) {\n RefPtr<InspectorResource> resource =\n page->inspectorController()->resources().get(identifier);\n if (resource.get()) {\n content = resource->sourceString();\n }\n }\n tools_agent_native_delegate_stub_->DidGetResourceContent(call_id, content);\n}\n\nvoid WebDevToolsAgentImpl::SetResourceTrackingEnabled(\n bool enabled,\n bool always) {\n \/\/ Hide \/ unhide resources panel if necessary.\n tools_agent_delegate_stub_->SetResourcesPanelEnabled(enabled);\n\n InspectorController* ic = web_view_impl_->page()->inspectorController();\n if (enabled) {\n ic->enableResourceTracking(always);\n } else {\n ic->disableResourceTracking(always);\n }\n}\n\nvoid WebDevToolsAgentImpl::DispatchMessageFromClient(\n const std::string& class_name,\n const std::string& method_name,\n const std::string& raw_msg) {\n OwnPtr<ListValue> message(\n static_cast<ListValue*>(DevToolsRpc::ParseMessage(raw_msg)));\n if (ToolsAgentDispatch::Dispatch(\n this, class_name, method_name, *message.get())) {\n return;\n }\n\n if (!attached_) {\n return;\n }\n\n if (debugger_agent_impl_.get() &&\n DebuggerAgentDispatch::Dispatch(\n debugger_agent_impl_.get(), class_name, method_name,\n *message.get())) {\n return;\n }\n\n if (DomAgentDispatch::Dispatch(\n dom_agent_impl_.get(), class_name, method_name, *message.get())) {\n return;\n }\n}\n\nvoid WebDevToolsAgentImpl::InspectElement(int x, int y) {\n Node* node = web_view_impl_->GetNodeForWindowPos(x, y);\n if (!node) {\n return;\n }\n\n int node_id = dom_agent_impl_->PushNodePathToClient(node);\n tools_agent_delegate_stub_->UpdateFocusedNode(node_id);\n}\n\nvoid WebDevToolsAgentImpl::SendRpcMessage(\n const std::string& class_name,\n const std::string& method_name,\n const std::string& raw_msg) {\n delegate_->SendMessageToClient(class_name, method_name, raw_msg);\n}\n\nvoid WebDevToolsAgentImpl::InitDevToolsAgentHost() {\n devtools_agent_host_.set(\n new BoundObject(utility_context_, this, \"DevToolsAgentHost\"));\n devtools_agent_host_->AddProtoFunction(\n \"dispatch\",\n WebDevToolsAgentImpl::JsDispatchOnClient);\n devtools_agent_host_->AddProtoFunction(\n \"getNodeForId\",\n WebDevToolsAgentImpl::JsGetNodeForId);\n devtools_agent_host_->Build();\n\n v8::HandleScope scope;\n v8::Context::Scope utility_scope(utility_context_);\n InspectorController* ic = web_view_impl_->page()->inspectorController();\n utility_context_->Global()->Set(\n v8::String::New(\"InspectorController\"),\n V8DOMWrapper::convertToV8Object(V8ClassIndex::INSPECTORBACKEND,\n ic->inspectorBackend()));\n}\n\n\/\/ static\nv8::Handle<v8::Value> WebDevToolsAgentImpl::JsDispatchOnClient(\n const v8::Arguments& args) {\n v8::TryCatch exception_catcher;\n String message = WebCore::toWebCoreStringWithNullCheck(args[0]);\n if (message.isEmpty() || exception_catcher.HasCaught()) {\n return v8::Undefined();\n }\n WebDevToolsAgentImpl* agent = static_cast<WebDevToolsAgentImpl*>(\n v8::External::Cast(*args.Data())->Value());\n agent->tools_agent_delegate_stub_->DispatchOnClient(message);\n return v8::Undefined();\n}\n\n\/\/ static\nv8::Handle<v8::Value> WebDevToolsAgentImpl::JsGetNodeForId(\n const v8::Arguments& args) {\n int node_id = static_cast<int>(args[0]->NumberValue());\n WebDevToolsAgentImpl* agent = static_cast<WebDevToolsAgentImpl*>(\n v8::External::Cast(*args.Data())->Value());\n Node* node = agent->dom_agent_impl_->GetNodeForId(node_id);\n return V8DOMWrapper::convertToV8Object(V8ClassIndex::NODE, node);\n}\n\n\/\/ static\nvoid WebDevToolsAgent::ExecuteDebuggerCommand(\n const std::string& command,\n int caller_id) {\n DebuggerAgentManager::ExecuteDebuggerCommand(command, caller_id);\n}\n\n\/\/ static\nvoid WebDevToolsAgent::SetMessageLoopDispatchHandler(\n MessageLoopDispatchHandler handler) {\n DebuggerAgentManager::SetMessageLoopDispatchHandler(handler);\n}\n<commit_msg>Fix Chromium canary^h^h^h^H parrot build: remove InspectorController::clearConsole call.<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 \"config.h\"\n\n#include <string>\n\n#include \"Document.h\"\n#include \"EventListener.h\"\n#include \"InspectorController.h\"\n#include \"InspectorFrontend.h\"\n#include \"InspectorResource.h\"\n#include \"Node.h\"\n#include \"Page.h\"\n#include \"PlatformString.h\"\n#include \"ScriptObject.h\"\n#include \"ScriptState.h\"\n#include \"ScriptValue.h\"\n#include \"V8Binding.h\"\n#include \"V8Proxy.h\"\n#include <wtf\/OwnPtr.h>\n#undef LOG\n\n#include \"base\/values.h\"\n#include \"webkit\/api\/public\/WebDataSource.h\"\n#include \"webkit\/api\/public\/WebURL.h\"\n#include \"webkit\/api\/public\/WebURLRequest.h\"\n#include \"webkit\/glue\/devtools\/bound_object.h\"\n#include \"webkit\/glue\/devtools\/debugger_agent_impl.h\"\n#include \"webkit\/glue\/devtools\/debugger_agent_manager.h\"\n#include \"webkit\/glue\/devtools\/dom_agent_impl.h\"\n#include \"webkit\/glue\/glue_util.h\"\n#include \"webkit\/glue\/webdevtoolsagent_delegate.h\"\n#include \"webkit\/glue\/webdevtoolsagent_impl.h\"\n#include \"webkit\/glue\/webview_impl.h\"\n\nusing WebCore::Document;\nusing WebCore::InspectorController;\nusing WebCore::InspectorFrontend;\nusing WebCore::InspectorResource;\nusing WebCore::Node;\nusing WebCore::Page;\nusing WebCore::ScriptObject;\nusing WebCore::ScriptState;\nusing WebCore::ScriptValue;\nusing WebCore::String;\nusing WebCore::V8ClassIndex;\nusing WebCore::V8DOMWrapper;\nusing WebCore::V8Proxy;\nusing WebKit::WebDataSource;\nusing WebKit::WebFrame;\nusing WebKit::WebURLRequest;\n\nWebDevToolsAgentImpl::WebDevToolsAgentImpl(\n WebViewImpl* web_view_impl,\n WebDevToolsAgentDelegate* delegate)\n : host_id_(delegate->GetHostId()),\n delegate_(delegate),\n web_view_impl_(web_view_impl),\n document_(NULL),\n attached_(false) {\n debugger_agent_delegate_stub_.set(new DebuggerAgentDelegateStub(this));\n dom_agent_delegate_stub_.set(new DomAgentDelegateStub(this));\n tools_agent_delegate_stub_.set(new ToolsAgentDelegateStub(this));\n tools_agent_native_delegate_stub_.set(new ToolsAgentNativeDelegateStub(this));\n}\n\nWebDevToolsAgentImpl::~WebDevToolsAgentImpl() {\n DebuggerAgentManager::OnWebViewClosed(web_view_impl_);\n DisposeUtilityContext();\n}\n\nvoid WebDevToolsAgentImpl::DisposeUtilityContext() {\n if (!utility_context_.IsEmpty()) {\n utility_context_.Dispose();\n utility_context_.Clear();\n }\n}\n\nvoid WebDevToolsAgentImpl::Attach() {\n if (attached_) {\n return;\n }\n debugger_agent_impl_.set(\n new DebuggerAgentImpl(web_view_impl_,\n debugger_agent_delegate_stub_.get(),\n this));\n Page* page = web_view_impl_->page();\n dom_agent_impl_.set(new DomAgentImpl(dom_agent_delegate_stub_.get()));\n\n \/\/ We are potentially attaching to the running page -> init agents with\n \/\/ Document if any.\n Document* doc = page->mainFrame()->document();\n if (doc) {\n \/\/ Reuse existing context in case detached\/attached.\n if (utility_context_.IsEmpty()) {\n debugger_agent_impl_->ResetUtilityContext(doc, &utility_context_);\n InitDevToolsAgentHost();\n }\n\n dom_agent_impl_->SetDocument(doc);\n\n InspectorController* ic = web_view_impl_->page()->inspectorController();\n \/\/ Unhide resources panel if necessary.\n tools_agent_delegate_stub_->SetResourcesPanelEnabled(\n ic->resourceTrackingEnabled());\n v8::HandleScope scope;\n ScriptState* state = scriptStateFromPage(web_view_impl_->page());\n ic->setFrontendProxyObject(\n state,\n ScriptObject(state, utility_context_->Global()));\n \/\/ Allow controller to send messages to the frontend.\n ic->setWindowVisible(true, false);\n }\n attached_ = true;\n}\n\nvoid WebDevToolsAgentImpl::Detach() {\n \/\/ Prevent controller from sending messages to the frontend.\n InspectorController* ic = web_view_impl_->page()->inspectorController();\n ic->setWindowVisible(false, false);\n HideDOMNodeHighlight();\n devtools_agent_host_.set(NULL);\n debugger_agent_impl_.set(NULL);\n dom_agent_impl_.set(NULL);\n attached_ = false;\n}\n\nvoid WebDevToolsAgentImpl::OnNavigate() {\n DebuggerAgentManager::OnNavigate();\n}\n\nvoid WebDevToolsAgentImpl::SetMainFrameDocumentReady(bool ready) {\n if (!attached_) {\n return;\n }\n\n \/\/ We were attached prior to the page load -> init agents with Document.\n Document* doc;\n if (ready) {\n Page* page = web_view_impl_->page();\n doc = page->mainFrame()->document();\n } else {\n doc = NULL;\n }\n if (doc) {\n debugger_agent_impl_->ResetUtilityContext(doc, &utility_context_);\n InitDevToolsAgentHost();\n }\n dom_agent_impl_->SetDocument(doc);\n}\n\nvoid WebDevToolsAgentImpl::DidCommitLoadForFrame(\n WebViewImpl* webview,\n WebFrame* frame,\n bool is_new_navigation) {\n if (!attached_) {\n DisposeUtilityContext();\n return;\n }\n WebDataSource* ds = frame->dataSource();\n const WebURLRequest& request = ds->request();\n GURL url = ds->hasUnreachableURL() ?\n ds->unreachableURL() :\n request.url();\n if (webview->GetMainFrame() == frame) {\n tools_agent_delegate_stub_->FrameNavigate(\n url.possibly_invalid_spec());\n }\n InspectorController* ic = webview->page()->inspectorController();\n \/\/ Unhide resources panel if necessary.\n tools_agent_delegate_stub_->SetResourcesPanelEnabled(\n ic->resourceTrackingEnabled());\n}\n\nvoid WebDevToolsAgentImpl::WindowObjectCleared(WebFrameImpl* webframe) {\n DebuggerAgentManager::SetHostId(webframe, host_id_);\n if (attached_) {\n \/\/ Push context id into the client if it is already attached.\n debugger_agent_delegate_stub_->SetContextId(host_id_);\n }\n}\n\nvoid WebDevToolsAgentImpl::ForceRepaint() {\n delegate_->ForceRepaint();\n}\n\nvoid WebDevToolsAgentImpl::HighlightDOMNode(int node_id) {\n if (!attached_) {\n return;\n }\n Node* node = dom_agent_impl_->GetNodeForId(node_id);\n if (!node) {\n return;\n }\n Page* page = web_view_impl_->page();\n page->inspectorController()->highlight(node);\n}\n\nvoid WebDevToolsAgentImpl::HideDOMNodeHighlight() {\n Page* page = web_view_impl_->page();\n if (page) {\n page->inspectorController()->hideHighlight();\n }\n}\n\nvoid WebDevToolsAgentImpl::ExecuteUtilityFunction(\n int call_id,\n const String& function_name,\n const String& json_args) {\n String result;\n String exception;\n result = debugger_agent_impl_->ExecuteUtilityFunction(utility_context_,\n function_name, json_args, &exception);\n tools_agent_delegate_stub_->DidExecuteUtilityFunction(call_id,\n result, exception);\n}\n\nvoid WebDevToolsAgentImpl::EvaluateJavaScript(\n int call_id,\n const WebCore::String& source) {\n String exception;\n String result = debugger_agent_impl_->EvaluateJavaScript(utility_context_,\n source, &exception);\n tools_agent_delegate_stub_->DidEvaluateJavaScript(call_id, result, exception);\n}\n\nvoid WebDevToolsAgentImpl::ClearConsoleMessages() {\n\/\/ TODO(pfeldman): restore once migrated to DOMAgent.\n\/\/ Page* page = web_view_impl_->page();\n\/\/ if (page) {\n\/\/ page->inspectorController()->clearConsoleMessages();\n\/\/ }\n}\n\nvoid WebDevToolsAgentImpl::GetResourceContent(\n int call_id,\n int identifier) {\n String content;\n Page* page = web_view_impl_->page();\n if (page) {\n RefPtr<InspectorResource> resource =\n page->inspectorController()->resources().get(identifier);\n if (resource.get()) {\n content = resource->sourceString();\n }\n }\n tools_agent_native_delegate_stub_->DidGetResourceContent(call_id, content);\n}\n\nvoid WebDevToolsAgentImpl::SetResourceTrackingEnabled(\n bool enabled,\n bool always) {\n \/\/ Hide \/ unhide resources panel if necessary.\n tools_agent_delegate_stub_->SetResourcesPanelEnabled(enabled);\n\n InspectorController* ic = web_view_impl_->page()->inspectorController();\n if (enabled) {\n ic->enableResourceTracking(always);\n } else {\n ic->disableResourceTracking(always);\n }\n}\n\nvoid WebDevToolsAgentImpl::DispatchMessageFromClient(\n const std::string& class_name,\n const std::string& method_name,\n const std::string& raw_msg) {\n OwnPtr<ListValue> message(\n static_cast<ListValue*>(DevToolsRpc::ParseMessage(raw_msg)));\n if (ToolsAgentDispatch::Dispatch(\n this, class_name, method_name, *message.get())) {\n return;\n }\n\n if (!attached_) {\n return;\n }\n\n if (debugger_agent_impl_.get() &&\n DebuggerAgentDispatch::Dispatch(\n debugger_agent_impl_.get(), class_name, method_name,\n *message.get())) {\n return;\n }\n\n if (DomAgentDispatch::Dispatch(\n dom_agent_impl_.get(), class_name, method_name, *message.get())) {\n return;\n }\n}\n\nvoid WebDevToolsAgentImpl::InspectElement(int x, int y) {\n Node* node = web_view_impl_->GetNodeForWindowPos(x, y);\n if (!node) {\n return;\n }\n\n int node_id = dom_agent_impl_->PushNodePathToClient(node);\n tools_agent_delegate_stub_->UpdateFocusedNode(node_id);\n}\n\nvoid WebDevToolsAgentImpl::SendRpcMessage(\n const std::string& class_name,\n const std::string& method_name,\n const std::string& raw_msg) {\n delegate_->SendMessageToClient(class_name, method_name, raw_msg);\n}\n\nvoid WebDevToolsAgentImpl::InitDevToolsAgentHost() {\n devtools_agent_host_.set(\n new BoundObject(utility_context_, this, \"DevToolsAgentHost\"));\n devtools_agent_host_->AddProtoFunction(\n \"dispatch\",\n WebDevToolsAgentImpl::JsDispatchOnClient);\n devtools_agent_host_->AddProtoFunction(\n \"getNodeForId\",\n WebDevToolsAgentImpl::JsGetNodeForId);\n devtools_agent_host_->Build();\n\n v8::HandleScope scope;\n v8::Context::Scope utility_scope(utility_context_);\n InspectorController* ic = web_view_impl_->page()->inspectorController();\n utility_context_->Global()->Set(\n v8::String::New(\"InspectorController\"),\n V8DOMWrapper::convertToV8Object(V8ClassIndex::INSPECTORBACKEND,\n ic->inspectorBackend()));\n}\n\n\/\/ static\nv8::Handle<v8::Value> WebDevToolsAgentImpl::JsDispatchOnClient(\n const v8::Arguments& args) {\n v8::TryCatch exception_catcher;\n String message = WebCore::toWebCoreStringWithNullCheck(args[0]);\n if (message.isEmpty() || exception_catcher.HasCaught()) {\n return v8::Undefined();\n }\n WebDevToolsAgentImpl* agent = static_cast<WebDevToolsAgentImpl*>(\n v8::External::Cast(*args.Data())->Value());\n agent->tools_agent_delegate_stub_->DispatchOnClient(message);\n return v8::Undefined();\n}\n\n\/\/ static\nv8::Handle<v8::Value> WebDevToolsAgentImpl::JsGetNodeForId(\n const v8::Arguments& args) {\n int node_id = static_cast<int>(args[0]->NumberValue());\n WebDevToolsAgentImpl* agent = static_cast<WebDevToolsAgentImpl*>(\n v8::External::Cast(*args.Data())->Value());\n Node* node = agent->dom_agent_impl_->GetNodeForId(node_id);\n return V8DOMWrapper::convertToV8Object(V8ClassIndex::NODE, node);\n}\n\n\/\/ static\nvoid WebDevToolsAgent::ExecuteDebuggerCommand(\n const std::string& command,\n int caller_id) {\n DebuggerAgentManager::ExecuteDebuggerCommand(command, caller_id);\n}\n\n\/\/ static\nvoid WebDevToolsAgent::SetMessageLoopDispatchHandler(\n MessageLoopDispatchHandler handler) {\n DebuggerAgentManager::SetMessageLoopDispatchHandler(handler);\n}\n<|endoftext|>"} {"text":"<commit_before>#pragma once\n\n#include \"acmacs-base\/fmt.hh\"\n#include \"acmacs-base\/rjson.hh\"\n#include \"acmacs-base\/flat-map.hh\"\n\n\/\/ ----------------------------------------------------------------------\n\nnamespace acmacs::settings::inline v2\n{\n class error : public std::runtime_error\n {\n using std::runtime_error::runtime_error;\n };\n\n class Settings\n {\n public:\n Settings() = default;\n Settings(const std::vector<std::string_view>& filenames) { load(filenames); }\n virtual ~Settings() = default;\n\n \/\/ read settings from files, upon reading each file apply \"init\" in it (if found)\n void load(const std::vector<std::string_view>& filenames)\n {\n for (const auto& filename : filenames)\n load(filename);\n }\n void load(std::string_view filename);\n\n \/\/ substitute vars in name, find name in environment or in data_ or in built-in and apply it\n \/\/ if name starts with ? do nothing\n \/\/ if name not found, throw\n virtual void apply(std::string_view name = \"main\") const;\n void apply(const char* name) const { apply(std::string_view{name}); }\n\n \/\/ substitute vars in name, find name in the top of data_ and apply it\n \/\/ do nothing if name starts with ? or if it is not found in top of data_\n virtual void apply_top(std::string_view name) const;\n\n virtual bool apply_built_in(std::string_view name) const; \/\/ returns true if built-in command with that name found and applied\n\n void setenv_from_string(std::string_view key, std::string_view value);\n template <typename T> void setenv(std::string_view key, T&& value) { setenv(key, rjson::value{std::forward<T>(value)}); }\n\n const rjson::value& getenv(std::string_view key) const { return environment_.get(static_cast<std::string>(environment_.substitute(key))); }\n template <typename T> T getenv(std::string_view key, T&& a_default) const\n {\n if (const auto& val = environment_.get(static_cast<std::string>(environment_.substitute(key))); val.is_string()) {\n auto orig = static_cast<std::string>(val);\n for (size_t num_subst = 0; num_subst < 10; ++num_subst) {\n const auto substituted = environment_.substitute(std::string_view{orig});\n if (substituted.is_string() && orig != static_cast<std::string>(substituted))\n orig = substituted;\n else\n return static_cast<T>(substituted);\n }\n throw error(fmt::format(\"Settings::getenv: too many substitutions in {}\", val));\n }\n else if (!val.is_const_null())\n return static_cast<T>(val);\n else\n return std::move(a_default);\n }\n\n std::string getenv(std::string_view key, const char* a_default) const { return getenv(key, std::string{a_default}); }\n void printenv() const { environment_.print(); }\n\n protected:\n template <typename... Key> const rjson::value& get(Key&&... keys) const;\n void apply(const rjson::value& entry) const;\n\n private:\n class Environment\n {\n public:\n Environment() { push(); }\n\n const rjson::value& get(std::string_view key) const;\n void push() { data_.emplace_back(); }\n void pop() { data_.erase(std::prev(std::end(data_))); }\n size_t size() const { return data_.size(); }\n void add(std::string_view key, const rjson::value& val) { data_.rbegin()->emplace_or_replace(std::string{key}, val); }\n void add(std::string_view key, rjson::value&& val) { data_.rbegin()->emplace_or_replace(std::string{key}, std::move(val)); }\n void print() const;\n void print_key_value() const;\n\n rjson::value substitute(std::string_view source) const;\n\n private:\n std::vector<acmacs::flat_map_t<std::string, rjson::value>> data_;\n\n rjson::value substitute(const rjson::value& source) const;\n };\n\n std::vector<rjson::value> data_;\n mutable Environment environment_;\n\n void push_and_apply(const rjson::object& entry) const;\n\n friend class Subenvironment;\n };\n} \/\/ namespace acmacs::settings::inline v2\n\n\/\/ ----------------------------------------------------------------------\n\nnamespace acmacs::settings::inline v2\n{\n template <typename... Key> const rjson::value& Settings::get(Key && ... keys) const\n {\n for (auto it = data_.rbegin(); it != data_.rend(); ++it) {\n if (const auto& val = it->get(std::forward<Key>(keys)...); !val.is_const_null())\n return val;\n }\n return rjson::ConstNull;\n\n } \/\/ acmacs::settings::v2::Settings::get\n\n template <> inline void Settings::setenv(std::string_view key, const rjson::value& value) { environment_.add(key, value); }\n template <> inline void Settings::setenv(std::string_view key, rjson::value && value) { environment_.add(key, std::move(value)); }\n\n} \/\/ namespace acmacs::settings::inline v2\n\n\/\/ ----------------------------------------------------------------------\n\/\/\/ Local Variables:\n\/\/\/ eval: (if (fboundp 'eu-rename-buffer) (eu-rename-buffer))\n\/\/\/ End:\n<commit_msg>settings-v2<commit_after>#pragma once\n\n#include \"acmacs-base\/fmt.hh\"\n#include \"acmacs-base\/rjson.hh\"\n#include \"acmacs-base\/flat-map.hh\"\n\n\/\/ ----------------------------------------------------------------------\n\nnamespace acmacs::settings::inline v2\n{\n class error : public std::runtime_error\n {\n using std::runtime_error::runtime_error;\n };\n\n class Settings\n {\n public:\n Settings() = default;\n Settings(const std::vector<std::string_view>& filenames) { load(filenames); }\n virtual ~Settings() = default;\n\n \/\/ read settings from files, upon reading each file apply \"init\" in it (if found)\n void load(const std::vector<std::string_view>& filenames)\n {\n for (const auto& filename : filenames)\n load(filename);\n }\n void load(std::string_view filename);\n\n \/\/ substitute vars in name, find name in environment or in data_ or in built-in and apply it\n \/\/ if name starts with ? do nothing\n \/\/ if name not found, throw\n virtual void apply(std::string_view name = \"main\") const;\n void apply(const char* name) const { apply(std::string_view{name}); }\n\n \/\/ substitute vars in name, find name in the top of data_ and apply it\n \/\/ do nothing if name starts with ? or if it is not found in top of data_\n virtual void apply_top(std::string_view name) const;\n\n virtual bool apply_built_in(std::string_view name) const; \/\/ returns true if built-in command with that name found and applied\n\n void setenv_from_string(std::string_view key, std::string_view value);\n template <typename T> void setenv(std::string_view key, T&& value) { setenv(key, rjson::value{std::forward<T>(value)}); }\n\n const rjson::value& getenv(std::string_view key) const { return environment_.get(static_cast<std::string>(environment_.substitute(key))); }\n template <typename T> T getenv(std::string_view key, T&& a_default) const\n {\n if (const auto& val = environment_.get(static_cast<std::string>(environment_.substitute(key))); val.is_string()) {\n auto orig = static_cast<std::string>(val);\n for (size_t num_subst = 0; num_subst < 10; ++num_subst) {\n const auto substituted = environment_.substitute(std::string_view{orig});\n if (substituted.is_string() && orig != static_cast<std::string>(substituted))\n orig = substituted;\n else if (substituted.is_const_null()) \/\/ substitutions lead to const-null\n return std::move(a_default);\n else\n return static_cast<T>(substituted);\n }\n throw error(fmt::format(\"Settings::getenv: too many substitutions in {}\", val));\n }\n else if (!val.is_const_null())\n return static_cast<T>(val);\n else\n return std::move(a_default);\n }\n\n std::string getenv(std::string_view key, const char* a_default) const { return getenv(key, std::string{a_default}); }\n void printenv() const { environment_.print(); }\n\n protected:\n template <typename... Key> const rjson::value& get(Key&&... keys) const;\n void apply(const rjson::value& entry) const;\n\n private:\n class Environment\n {\n public:\n Environment() { push(); }\n\n const rjson::value& get(std::string_view key) const;\n void push() { data_.emplace_back(); }\n void pop() { data_.erase(std::prev(std::end(data_))); }\n size_t size() const { return data_.size(); }\n void add(std::string_view key, const rjson::value& val) { data_.rbegin()->emplace_or_replace(std::string{key}, val); }\n void add(std::string_view key, rjson::value&& val) { data_.rbegin()->emplace_or_replace(std::string{key}, std::move(val)); }\n void print() const;\n void print_key_value() const;\n\n rjson::value substitute(std::string_view source) const;\n\n private:\n std::vector<acmacs::flat_map_t<std::string, rjson::value>> data_;\n\n rjson::value substitute(const rjson::value& source) const;\n };\n\n std::vector<rjson::value> data_;\n mutable Environment environment_;\n\n void push_and_apply(const rjson::object& entry) const;\n\n friend class Subenvironment;\n };\n} \/\/ namespace acmacs::settings::inline v2\n\n\/\/ ----------------------------------------------------------------------\n\nnamespace acmacs::settings::inline v2\n{\n template <typename... Key> const rjson::value& Settings::get(Key && ... keys) const\n {\n for (auto it = data_.rbegin(); it != data_.rend(); ++it) {\n if (const auto& val = it->get(std::forward<Key>(keys)...); !val.is_const_null())\n return val;\n }\n return rjson::ConstNull;\n\n } \/\/ acmacs::settings::v2::Settings::get\n\n template <> inline void Settings::setenv(std::string_view key, const rjson::value& value) { environment_.add(key, value); }\n template <> inline void Settings::setenv(std::string_view key, rjson::value && value) { environment_.add(key, std::move(value)); }\n\n} \/\/ namespace acmacs::settings::inline v2\n\n\/\/ ----------------------------------------------------------------------\n\/\/\/ Local Variables:\n\/\/\/ eval: (if (fboundp 'eu-rename-buffer) (eu-rename-buffer))\n\/\/\/ End:\n<|endoftext|>"} {"text":"<commit_before>\/\/------------------------------------------------------------------------------\n\/\/ CLING - the C++ LLVM-based InterpreterG :)\n\/\/ version: $Id$\n\/\/ author: Vassil Vassilev <vasil.georgiev.vasilev@cern.ch>\n\/\/------------------------------------------------------------------------------\n\n#include \"cling\/Interpreter\/ValuePrinter.h\"\n\n#include \"cling\/Interpreter\/CValuePrinter.h\"\n#include \"cling\/Interpreter\/ValuePrinterInfo.h\"\n#include \"cling\/Interpreter\/StoredValueRef.h\"\n#include \"cling\/Interpreter\/Value.h\"\n\n#include \"clang\/AST\/ASTContext.h\"\n#include \"clang\/AST\/Decl.h\"\n#include \"clang\/AST\/DeclCXX.h\"\n#include \"clang\/AST\/Expr.h\"\n#include \"clang\/AST\/Type.h\"\n\n#include \"llvm\/Support\/raw_ostream.h\"\n\n#include <string>\n\n\/\/ Implements the CValuePrinter interface.\nextern \"C\" void cling_PrintValue(void* \/*clang::Expr**\/ E,\n void* \/*clang::ASTContext**\/ C,\n const void* value) {\n clang::Expr* Exp = (clang::Expr*)E;\n clang::ASTContext* Context = (clang::ASTContext*)C;\n cling::ValuePrinterInfo VPI(Exp, Context);\n cling::printValuePublic(llvm::outs(), value, value, VPI);\n\n cling::flushOStream(llvm::outs());\n}\n\n\nstatic void StreamChar(llvm::raw_ostream& o, const char v,\n const char* Sep = \"\\n\") {\n o << '\"' << v << \"\\\"\" << Sep;\n}\n\nstatic void StreamCharPtr(llvm::raw_ostream& o, const char* const v,\n const char* Sep = \"\\n\") {\n o << '\"';\n const char* p = v;\n for (;*p && p - v < 128; ++p) {\n o << *p;\n }\n if (*p) o << \"\\\"...\" << Sep;\n else o << \"\\\"\" << Sep;\n}\n\nstatic void StreamRef(llvm::raw_ostream& o, const void* v,\n const char* Sep = \"\\n\") {\n o <<\"&\" << v << Sep;\n}\n\nstatic void StreamPtr(llvm::raw_ostream& o, const void* v,\n const char* Sep = \"\\n\") {\n o << v << Sep;\n}\n\nstatic void StreamValue(llvm::raw_ostream& o, const void* const p,\n const cling::ValuePrinterInfo& VPI,\n clang::QualType Ty,\n const char* Sep = \"\\n\");\n\nstatic void StreamArr(llvm::raw_ostream& o, const void* p,\n const cling::ValuePrinterInfo& VPI,\n clang::QualType Ty,\n const char* Sep = \"\\n\") {\n const clang::ASTContext& C = *VPI.getASTContext();\n const clang::ArrayType* ArrTy = Ty->getAsArrayTypeUnsafe();\n clang::QualType ElementTy = ArrTy->getElementType();\n if (ElementTy->isCharType())\n StreamCharPtr(o, (const char*)p);\n else if (Ty->isConstantArrayType()) {\n \/\/ Stream a constant array by streaming up to 5 elements.\n const clang::ConstantArrayType* CArrTy\n = C.getAsConstantArrayType(Ty);\n const llvm::APInt& APSize = CArrTy->getSize();\n size_t ElBytes = C.getTypeSize(ElementTy) \/ C.getCharWidth();\n size_t Size = (size_t)APSize.getZExtValue();\n o << \"{ \";\n for (size_t i = 0; i < Size; ++i) {\n StreamValue(o, ((char*)p) + i * ElBytes, VPI, ElementTy, \" \");\n if (i + 1 < Size) {\n if (i == 4) {\n o << \"...\";\n break;\n }\n else o << \", \";\n }\n }\n o << \" }\" << Sep;\n } else\n StreamPtr(o, p, Sep);\n}\n\nstatic void StreamObj(llvm::raw_ostream& o, const void* v,\n const cling::ValuePrinterInfo& VPI,\n clang::QualType QTy,\n const char* Sep = \"\\n\") {\n const clang::Type* Ty = QTy.getTypePtr();\n if (clang::CXXRecordDecl* CXXRD = Ty->getAsCXXRecordDecl()) {\n const cling::Value* value = 0;\n if (CXXRD->getQualifiedNameAsString().compare(\"cling::StoredValueRef\") == 0){\n const cling::StoredValueRef* VR = (const cling::StoredValueRef*)v;\n if (VR->isValid()) {\n value = &VR->get();\n } else {\n o << \"<<<invalid>>> \";\n }\n } else if (CXXRD->getQualifiedNameAsString().compare(\"cling::Value\") == 0) {\n value = (const cling::Value*)v;\n }\n if (value) {\n if (value->isValid()) {\n o << \"boxes [\";\n const clang::ASTContext& C = *VPI.getASTContext();\n o <<\n \"(\" <<\n value->type.getAsString(C.getPrintingPolicy()) <<\n \") \";\n clang::QualType valType = value->type.getDesugaredType(C);\n if (valType->isFloatingType())\n o << value->value.DoubleVal;\n else if (valType->isIntegerType())\n o << value->value.IntVal.getSExtValue();\n else if (valType->isBooleanType())\n o << value->value.IntVal.getBoolValue();\n else\n StreamValue(o, value->value.PointerVal, VPI, valType, \"\");\n o << \"]\" << Sep;\n\n return;\n } else\n o << \"<<<invalid>>> \";\n }\n } \/\/ if CXXRecordDecl\n\n \/\/ TODO: Print the object members.\n o << \"@\" << v << Sep;\n}\n\nstatic void StreamValue(llvm::raw_ostream& o, const void* const p,\n const cling::ValuePrinterInfo& VPI,\n clang::QualType Ty,\n const char* Sep \/*= \"\\n\"*\/) {\n const clang::ASTContext& C = *VPI.getASTContext();\n Ty = Ty.getDesugaredType(C);\n if (const clang::BuiltinType *BT\n = llvm::dyn_cast<clang::BuiltinType>(Ty.getCanonicalType())) {\n switch (BT->getKind()) {\n case clang::BuiltinType::Bool:\n if (*(const bool*)p) o << \"true\" << Sep;\n else o << \"false\" << Sep; break;\n case clang::BuiltinType::Char_U:\n case clang::BuiltinType::UChar:\n case clang::BuiltinType::Char_S:\n case clang::BuiltinType::SChar: StreamChar(o, *(const char*)p); break;\n case clang::BuiltinType::Short: o << *(const short*)p << Sep; break;\n case clang::BuiltinType::UShort:\n o << *(const unsigned short*)p << Sep;\n break;\n case clang::BuiltinType::Int: o << *(const int*)p << Sep; break;\n case clang::BuiltinType::UInt:\n o << *(const unsigned int*)p << Sep;\n break;\n case clang::BuiltinType::Long: o << *(const long*)p << Sep; break;\n case clang::BuiltinType::ULong:\n o << *(const unsigned long*)p << Sep;\n break;\n case clang::BuiltinType::LongLong:\n o << *(const long long*)p << Sep;\n break;\n case clang::BuiltinType::ULongLong:\n o << *(const unsigned long long*)p << Sep;\n break;\n case clang::BuiltinType::Float: o << *(const float*)p << Sep; break;\n case clang::BuiltinType::Double: o << *(const double*)p << Sep; break;\n default:\n StreamObj(o, p, VPI, Ty, Sep);\n }\n }\n else if (Ty.getAsString().compare(\"class std::basic_string<char>\") == 0) {\n StreamObj(o, p, VPI, Ty, Sep);\n o <<\"c_str: \";\n StreamCharPtr(o, ((const char*) (*(const std::string*)p).c_str()), Sep);\n }\n else if (Ty->isEnumeralType()) {\n StreamObj(o, p, VPI, Ty, Sep);\n clang::EnumDecl* ED = Ty->getAs<clang::EnumType>()->getDecl();\n uint64_t value = *(const uint64_t*)p;\n bool IsFirst = true;\n llvm::APSInt ValAsAPSInt = C.MakeIntValue(value, Ty);\n for (clang::EnumDecl::enumerator_iterator I = ED->enumerator_begin(),\n E = ED->enumerator_end(); I != E; ++I) {\n if (I->getInitVal() == ValAsAPSInt) {\n if (!IsFirst) {\n o << \" ? \";\n }\n o << \"(\" << I->getQualifiedNameAsString() << \")\";\n IsFirst = false;\n }\n }\n o << \" : (int) \" << ValAsAPSInt.toString(\/*Radix = *\/10) << Sep;\n }\n else if (Ty->isReferenceType())\n StreamRef(o, p, Sep);\n else if (Ty->isPointerType()) {\n clang::QualType PointeeTy = Ty->getPointeeType();\n if (PointeeTy->isCharType())\n StreamCharPtr(o, (const char*)p, Sep);\n else\n StreamPtr(o, p, Sep);\n }\n else if (Ty->isArrayType())\n StreamArr(o, p, VPI, Ty, Sep);\n else\n StreamObj(o, p, VPI, Ty, Sep);\n}\n\nnamespace cling {\n void printValuePublicDefault(llvm::raw_ostream& o, const void* const p,\n const ValuePrinterInfo& VPI) {\n const clang::Expr* E = VPI.getExpr();\n o << \"(\";\n o << E->getType().getAsString();\n o << \") \";\n StreamValue(o, p, VPI, VPI.getExpr()->getType());\n }\n\n void flushOStream(llvm::raw_ostream& o) {\n o.flush();\n }\n\n} \/\/ end namespace cling\n<commit_msg>Const correctness.<commit_after>\/\/------------------------------------------------------------------------------\n\/\/ CLING - the C++ LLVM-based InterpreterG :)\n\/\/ version: $Id$\n\/\/ author: Vassil Vassilev <vasil.georgiev.vasilev@cern.ch>\n\/\/------------------------------------------------------------------------------\n\n#include \"cling\/Interpreter\/ValuePrinter.h\"\n\n#include \"cling\/Interpreter\/CValuePrinter.h\"\n#include \"cling\/Interpreter\/ValuePrinterInfo.h\"\n#include \"cling\/Interpreter\/StoredValueRef.h\"\n#include \"cling\/Interpreter\/Value.h\"\n\n#include \"clang\/AST\/ASTContext.h\"\n#include \"clang\/AST\/Decl.h\"\n#include \"clang\/AST\/DeclCXX.h\"\n#include \"clang\/AST\/Expr.h\"\n#include \"clang\/AST\/Type.h\"\n\n#include \"llvm\/Support\/raw_ostream.h\"\n\n#include <string>\n\n\/\/ Implements the CValuePrinter interface.\nextern \"C\" void cling_PrintValue(void* \/*clang::Expr**\/ E,\n void* \/*clang::ASTContext**\/ C,\n const void* value) {\n clang::Expr* Exp = (clang::Expr*)E;\n clang::ASTContext* Context = (clang::ASTContext*)C;\n cling::ValuePrinterInfo VPI(Exp, Context);\n cling::printValuePublic(llvm::outs(), value, value, VPI);\n\n cling::flushOStream(llvm::outs());\n}\n\n\nstatic void StreamChar(llvm::raw_ostream& o, const char v,\n const char* Sep = \"\\n\") {\n o << '\"' << v << \"\\\"\" << Sep;\n}\n\nstatic void StreamCharPtr(llvm::raw_ostream& o, const char* const v,\n const char* Sep = \"\\n\") {\n o << '\"';\n const char* p = v;\n for (;*p && p - v < 128; ++p) {\n o << *p;\n }\n if (*p) o << \"\\\"...\" << Sep;\n else o << \"\\\"\" << Sep;\n}\n\nstatic void StreamRef(llvm::raw_ostream& o, const void* v,\n const char* Sep = \"\\n\") {\n o <<\"&\" << v << Sep;\n}\n\nstatic void StreamPtr(llvm::raw_ostream& o, const void* v,\n const char* Sep = \"\\n\") {\n o << v << Sep;\n}\n\nstatic void StreamValue(llvm::raw_ostream& o, const void* const p,\n const cling::ValuePrinterInfo& VPI,\n clang::QualType Ty,\n const char* Sep = \"\\n\");\n\nstatic void StreamArr(llvm::raw_ostream& o, const void* p,\n const cling::ValuePrinterInfo& VPI,\n clang::QualType Ty,\n const char* Sep = \"\\n\") {\n const clang::ASTContext& C = *VPI.getASTContext();\n const clang::ArrayType* ArrTy = Ty->getAsArrayTypeUnsafe();\n clang::QualType ElementTy = ArrTy->getElementType();\n if (ElementTy->isCharType())\n StreamCharPtr(o, (const char*)p);\n else if (Ty->isConstantArrayType()) {\n \/\/ Stream a constant array by streaming up to 5 elements.\n const clang::ConstantArrayType* CArrTy\n = C.getAsConstantArrayType(Ty);\n const llvm::APInt& APSize = CArrTy->getSize();\n size_t ElBytes = C.getTypeSize(ElementTy) \/ C.getCharWidth();\n size_t Size = (size_t)APSize.getZExtValue();\n o << \"{ \";\n for (size_t i = 0; i < Size; ++i) {\n StreamValue(o, ((const char*)p) + i * ElBytes, VPI, ElementTy, \" \");\n if (i + 1 < Size) {\n if (i == 4) {\n o << \"...\";\n break;\n }\n else o << \", \";\n }\n }\n o << \" }\" << Sep;\n } else\n StreamPtr(o, p, Sep);\n}\n\nstatic void StreamObj(llvm::raw_ostream& o, const void* v,\n const cling::ValuePrinterInfo& VPI,\n clang::QualType QTy,\n const char* Sep = \"\\n\") {\n const clang::Type* Ty = QTy.getTypePtr();\n if (clang::CXXRecordDecl* CXXRD = Ty->getAsCXXRecordDecl()) {\n const cling::Value* value = 0;\n if (CXXRD->getQualifiedNameAsString().compare(\"cling::StoredValueRef\") == 0){\n const cling::StoredValueRef* VR = (const cling::StoredValueRef*)v;\n if (VR->isValid()) {\n value = &VR->get();\n } else {\n o << \"<<<invalid>>> \";\n }\n } else if (CXXRD->getQualifiedNameAsString().compare(\"cling::Value\") == 0) {\n value = (const cling::Value*)v;\n }\n if (value) {\n if (value->isValid()) {\n o << \"boxes [\";\n const clang::ASTContext& C = *VPI.getASTContext();\n o <<\n \"(\" <<\n value->type.getAsString(C.getPrintingPolicy()) <<\n \") \";\n clang::QualType valType = value->type.getDesugaredType(C);\n if (valType->isFloatingType())\n o << value->value.DoubleVal;\n else if (valType->isIntegerType())\n o << value->value.IntVal.getSExtValue();\n else if (valType->isBooleanType())\n o << value->value.IntVal.getBoolValue();\n else\n StreamValue(o, value->value.PointerVal, VPI, valType, \"\");\n o << \"]\" << Sep;\n\n return;\n } else\n o << \"<<<invalid>>> \";\n }\n } \/\/ if CXXRecordDecl\n\n \/\/ TODO: Print the object members.\n o << \"@\" << v << Sep;\n}\n\nstatic void StreamValue(llvm::raw_ostream& o, const void* const p,\n const cling::ValuePrinterInfo& VPI,\n clang::QualType Ty,\n const char* Sep \/*= \"\\n\"*\/) {\n const clang::ASTContext& C = *VPI.getASTContext();\n Ty = Ty.getDesugaredType(C);\n if (const clang::BuiltinType *BT\n = llvm::dyn_cast<clang::BuiltinType>(Ty.getCanonicalType())) {\n switch (BT->getKind()) {\n case clang::BuiltinType::Bool:\n if (*(const bool*)p) o << \"true\" << Sep;\n else o << \"false\" << Sep; break;\n case clang::BuiltinType::Char_U:\n case clang::BuiltinType::UChar:\n case clang::BuiltinType::Char_S:\n case clang::BuiltinType::SChar: StreamChar(o, *(const char*)p); break;\n case clang::BuiltinType::Short: o << *(const short*)p << Sep; break;\n case clang::BuiltinType::UShort:\n o << *(const unsigned short*)p << Sep;\n break;\n case clang::BuiltinType::Int: o << *(const int*)p << Sep; break;\n case clang::BuiltinType::UInt:\n o << *(const unsigned int*)p << Sep;\n break;\n case clang::BuiltinType::Long: o << *(const long*)p << Sep; break;\n case clang::BuiltinType::ULong:\n o << *(const unsigned long*)p << Sep;\n break;\n case clang::BuiltinType::LongLong:\n o << *(const long long*)p << Sep;\n break;\n case clang::BuiltinType::ULongLong:\n o << *(const unsigned long long*)p << Sep;\n break;\n case clang::BuiltinType::Float: o << *(const float*)p << Sep; break;\n case clang::BuiltinType::Double: o << *(const double*)p << Sep; break;\n default:\n StreamObj(o, p, VPI, Ty, Sep);\n }\n }\n else if (Ty.getAsString().compare(\"class std::basic_string<char>\") == 0) {\n StreamObj(o, p, VPI, Ty, Sep);\n o <<\"c_str: \";\n StreamCharPtr(o, ((const char*) (*(const std::string*)p).c_str()), Sep);\n }\n else if (Ty->isEnumeralType()) {\n StreamObj(o, p, VPI, Ty, Sep);\n clang::EnumDecl* ED = Ty->getAs<clang::EnumType>()->getDecl();\n uint64_t value = *(const uint64_t*)p;\n bool IsFirst = true;\n llvm::APSInt ValAsAPSInt = C.MakeIntValue(value, Ty);\n for (clang::EnumDecl::enumerator_iterator I = ED->enumerator_begin(),\n E = ED->enumerator_end(); I != E; ++I) {\n if (I->getInitVal() == ValAsAPSInt) {\n if (!IsFirst) {\n o << \" ? \";\n }\n o << \"(\" << I->getQualifiedNameAsString() << \")\";\n IsFirst = false;\n }\n }\n o << \" : (int) \" << ValAsAPSInt.toString(\/*Radix = *\/10) << Sep;\n }\n else if (Ty->isReferenceType())\n StreamRef(o, p, Sep);\n else if (Ty->isPointerType()) {\n clang::QualType PointeeTy = Ty->getPointeeType();\n if (PointeeTy->isCharType())\n StreamCharPtr(o, (const char*)p, Sep);\n else\n StreamPtr(o, p, Sep);\n }\n else if (Ty->isArrayType())\n StreamArr(o, p, VPI, Ty, Sep);\n else\n StreamObj(o, p, VPI, Ty, Sep);\n}\n\nnamespace cling {\n void printValuePublicDefault(llvm::raw_ostream& o, const void* const p,\n const ValuePrinterInfo& VPI) {\n const clang::Expr* E = VPI.getExpr();\n o << \"(\";\n o << E->getType().getAsString();\n o << \") \";\n StreamValue(o, p, VPI, VPI.getExpr()->getType());\n }\n\n void flushOStream(llvm::raw_ostream& o) {\n o.flush();\n }\n\n} \/\/ end namespace cling\n<|endoftext|>"} {"text":"<commit_before>\/\/ Time: O(n)\n\/\/ Space: O(logn)\n\n\/**\n * Definition of SegmentTreeNode:\n * class SegmentTreeNode {\n * public:\n * int start, end;\n * SegmentTreeNode *left, *right;\n * SegmentTreeNode(int start, int end) {\n * this->start = start, this->end = end;\n * this->left = this->right = NULL;\n * }\n * }\n *\/\nclass Solution {\npublic:\n \/**\n *@param start, end: Denote an segment \/ interval\n *@return: The root of Segment Tree\n *\/\n SegmentTreeNode * build(int start, int end) {\n if (start > end) {\n return nullptr;\n }\n\n \/\/ The root's start and end is given by build method.\n SegmentTreeNode *root = new SegmentTreeNode(start, end);\n\n \/\/ If start equals to end, there will be no children for this node.\n if (start == end) {\n return root;\n }\n\n \/\/ Left child: start=A.left, end=(A.left + A.right) \/ 2.\n root->left = build(start, (start + end) \/ 2);\n\n \/\/ Right child: start=(A.left + A.right) \/ 2 + 1, end=A.right.\n root->right = build((start + end) \/ 2 + 1, end);\n\n return root;\n }\n};\n<commit_msg>Update segment-tree-build.cpp<commit_after>\/\/ Time: O(n)\n\/\/ Space: O(h) = O(logn)\n\n\/**\n * Definition of SegmentTreeNode:\n * class SegmentTreeNode {\n * public:\n * int start, end;\n * SegmentTreeNode *left, *right;\n * SegmentTreeNode(int start, int end) {\n * this->start = start, this->end = end;\n * this->left = this->right = NULL;\n * }\n * }\n *\/\nclass Solution {\npublic:\n \/**\n *@param start, end: Denote an segment \/ interval\n *@return: The root of Segment Tree\n *\/\n SegmentTreeNode * build(int start, int end) {\n if (start > end) {\n return nullptr;\n }\n\n \/\/ The root's start and end is given by build method.\n SegmentTreeNode *root = new SegmentTreeNode(start, end);\n\n \/\/ If start equals to end, there will be no children for this node.\n if (start == end) {\n return root;\n }\n\n \/\/ Left child: start=A.left, end=(A.left + A.right) \/ 2.\n root->left = build(start, (start + end) \/ 2);\n\n \/\/ Right child: start=(A.left + A.right) \/ 2 + 1, end=A.right.\n root->right = build((start + end) \/ 2 + 1, end);\n\n return root;\n }\n};\n<|endoftext|>"} {"text":"<commit_before>\/*****************************************************************************\n * Help.cpp : Help and About dialogs\n ****************************************************************************\n * Copyright (C) 2007 the VideoLAN team\n * $Id$\n *\n * Authors: Jean-Baptiste Kempf <jb (at) videolan.org>\n * Rémi Duraffort <ivoire (at) via.ecp.fr>\n *\n * This program is free software; you can redistribute it and\/or modify\n * it under the terms of the GNU General Public License as published by\n * the Free Software Foundation; either version 2 of the License, or\n * (at your option) any later version.\n *\n * This program is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the\n * GNU General Public License for more details.\n *\n * You should have received a copy of the GNU General Public License\n * along with this program; if not, write to the Free Software\n * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston MA 02110-1301, USA.\n *****************************************************************************\/\n\n#ifdef HAVE_CONFIG_H\n# include \"config.h\"\n#endif\n\n#include <vlc_common.h>\n\n#include \"dialogs\/help.hpp\"\n#include <vlc_about.h>\n\n#ifdef UPDATE_CHECK\n#include <vlc_update.h>\n#endif\n\n#include \"dialogs_provider.hpp\"\n\n#include <vlc_intf_strings.h>\n\n#include <QTextBrowser>\n#include <QTabWidget>\n#include <QFile>\n#include <QLabel>\n#include <QString>\n#include <QDialogButtonBox>\n#include <QEvent>\n#include <QFileDialog>\n#include <QDate>\n\n\nHelpDialog *HelpDialog::instance = NULL;\n\nHelpDialog::HelpDialog( intf_thread_t *_p_intf ) : QVLCFrame( _p_intf )\n\n{\n setWindowTitle( qtr( \"Help\" ) );\n setMinimumSize( 250, 300 );\n\n QGridLayout *layout = new QGridLayout( this );\n QTextBrowser *helpBrowser = new QTextBrowser( this );\n helpBrowser->setOpenExternalLinks( true );\n helpBrowser->setHtml( I_LONGHELP );\n QPushButton *closeButton = new QPushButton( qtr( \"&Close\" ) );\n closeButton->setDefault( true );\n\n layout->addWidget( helpBrowser, 0, 0, 1, 0 );\n layout->addWidget( closeButton, 1, 3 );\n\n BUTTONACT( closeButton, close() );\n readSettings( \"Help\", QSize( 400, 450 ) );\n}\n\nHelpDialog::~HelpDialog()\n{\n writeSettings( \"Help\" );\n}\n\nvoid HelpDialog::close()\n{\n toggleVisible();\n}\n\nAboutDialog *AboutDialog::instance = NULL;\n\nAboutDialog::AboutDialog( QWidget *parent, intf_thread_t *_p_intf)\n : QVLCDialog( parent, _p_intf )\n{\n setWindowTitle( qtr( \"About\" ) );\n resize( 600, 500 );\n setMinimumSize( 600, 500 );\n\n QGridLayout *layout = new QGridLayout( this );\n QTabWidget *tab = new QTabWidget( this );\n\n QPushButton *closeButton = new QPushButton( qtr( \"&Close\" ) );\n closeButton->setSizePolicy( QSizePolicy::Minimum, QSizePolicy::Minimum );\n closeButton->setDefault( true );\n\n QLabel *introduction = new QLabel(\n qtr( \"VLC media player\" \" \" VERSION_MESSAGE ) );\n QLabel *iconVLC = new QLabel;\n if( QDate::currentDate().dayOfYear() >= 354 )\n iconVLC->setPixmap( QPixmap( \":\/vlc48-christmas.png\" ) );\n else\n iconVLC->setPixmap( QPixmap( \":\/vlc48.png\" ) );\n layout->addWidget( iconVLC, 0, 0, 1, 1 );\n layout->addWidget( introduction, 0, 1, 1, 7 );\n layout->addWidget( tab, 1, 0, 1, 8 );\n layout->addWidget( closeButton, 2, 6, 1, 2 );\n\n \/* Main Introduction *\/\n QWidget *infoWidget = new QWidget( this );\n QHBoxLayout *infoLayout = new QHBoxLayout( infoWidget );\n QLabel *infoLabel = new QLabel(\n qtr( \"VLC media player is a free media player, \"\n \"encoder and streamer that can read from files, \"\n \"CDs, DVDs, network streams, capture cards and even more!\\n\"\n \"Also, VLC works on essentially every popular platform.\\n\\n\" )\n + qtr( \"This version of VLC was compiled by:\\n \" )\n + qfu( VLC_CompileBy() )+ \"@\" + qfu( VLC_CompileHost() ) + \".\"\n + qfu( VLC_CompileDomain() ) + \".\\n\"\n + \"Compiler: \" + qfu( VLC_Compiler() ) + \".\\n\"\n + qtr( \"Based on Git commit: \" ) + qfu( VLC_Changeset() ) + \".\\n\"\n + qtr( \"You are using the Qt4 Interface.\\n\\n\" )\n + qtr( \"Copyright © \" COPYRIGHT_YEARS \" by the VideoLAN Team.\\n\" )\n + \"vlc@videolan.org, http:\/\/www.videolan.org\" );\n infoLabel->setWordWrap( infoLabel );\n\n QLabel *iconVLC2 = new QLabel;\n if( QDate::currentDate().dayOfYear() >= 354 )\n iconVLC2->setPixmap( QPixmap( \":\/vlc128-christmas.png\" ) );\n else\n iconVLC2->setPixmap( QPixmap( \":\/vlc128.png\" ) );\n infoLayout->addWidget( iconVLC2 );\n infoLayout->addWidget( infoLabel );\n\n \/* GPL License *\/\n QTextEdit *licenseEdit = new QTextEdit( this );\n licenseEdit->setText( qfu( psz_license ) );\n licenseEdit->setReadOnly( true );\n\n \/* People who helped *\/\n QWidget *thanksWidget = new QWidget( this );\n QVBoxLayout *thanksLayout = new QVBoxLayout( thanksWidget );\n\n QLabel *thanksLabel = new QLabel( qtr( \"We would like to thank the whole \"\n \"community, the testers, our users and the following people \"\n \"(and the missing ones...) for their collaboration to \"\n \"provide the best software.\" ) );\n thanksLabel->setWordWrap( true );\n thanksLayout->addWidget( thanksLabel );\n QTextEdit *thanksEdit = new QTextEdit( this );\n thanksEdit->setText( qfu( psz_thanks ) );\n thanksEdit->setReadOnly( true );\n thanksLayout->addWidget( thanksEdit );\n\n \/* People who wrote the software *\/\n QTextEdit *authorsEdit = new QTextEdit( this );\n authorsEdit->setText( qfu( psz_authors ) );\n authorsEdit->setReadOnly( true );\n\n \/* add the tabs to the Tabwidget *\/\n tab->addTab( infoWidget, qtr( \"About\" ) );\n tab->addTab( authorsEdit, qtr( \"Authors\" ) );\n tab->addTab( thanksWidget, qtr(\"Thanks\") );\n tab->addTab( licenseEdit, qtr(\"License\") );\n\n BUTTONACT( closeButton, close() );\n}\n\nAboutDialog::~AboutDialog()\n{\n}\n\nvoid AboutDialog::close()\n{\n toggleVisible();\n}\n\n#ifdef UPDATE_CHECK\n\n\/*****************************************************************************\n * UpdateDialog\n *****************************************************************************\/\n\/* callback to get information from the core *\/\nstatic void UpdateCallback( void *data, bool b_ret )\n{\n UpdateDialog* UDialog = (UpdateDialog *)data;\n QEvent* event;\n\n if( b_ret )\n event = new QEvent( (QEvent::Type)UDOkEvent );\n else\n event = new QEvent( (QEvent::Type)UDErrorEvent );\n\n QApplication::postEvent( UDialog, event );\n}\n\nUpdateDialog *UpdateDialog::instance = NULL;\n\nUpdateDialog::UpdateDialog( intf_thread_t *_p_intf ) : QVLCFrame( _p_intf )\n{\n setWindowTitle( qtr( \"Update\" ) );\n\n QGridLayout *layout = new QGridLayout( this );\n\n QPushButton *closeButton = new QPushButton( qtr( \"&Close\" ) );\n updateButton = new QPushButton( qtr( \"&Update List\" ) );\n updateButton->setDefault( true );\n QDialogButtonBox *buttonBox = new QDialogButtonBox( Qt::Horizontal );\n buttonBox->addButton( updateButton, QDialogButtonBox::ActionRole );\n buttonBox->addButton( closeButton, QDialogButtonBox::AcceptRole );\n\n updateLabel = new QLabel( qtr( \"Checking for an update...\" ) );\n updateLabel->setWordWrap( true );\n\n layout->addWidget( updateLabel, 0, 0 );\n layout->addWidget( buttonBox, 1, 0 );\n\n BUTTONACT( updateButton, UpdateOrDownload() );\n BUTTONACT( closeButton, close() );\n\n \/* Create the update structure *\/\n p_update = update_New( p_intf );\n b_checked = false;\n\n readSettings( \"Update\", QSize( 120, 80 ) );\n\n \/* Check for updates *\/\n UpdateOrDownload();\n}\n\nUpdateDialog::~UpdateDialog()\n{\n update_Delete( p_update );\n writeSettings( \"Update\" );\n}\n\nvoid UpdateDialog::close()\n{\n toggleVisible();\n}\n\n\/* Check for updates *\/\nvoid UpdateDialog::UpdateOrDownload()\n{\n if( !b_checked )\n {\n updateButton->setEnabled( false );\n msg_Dbg( p_intf, \"Launching an update request\" );\n update_Check( p_update, UpdateCallback, this );\n }\n else\n {\n updateButton->setEnabled( false );\n QString dest_dir = QFileDialog::getExistingDirectory( this,\n qtr( \"Select a directory ...\" ),\n qfu( config_GetHomeDir() ) );\n\n if( dest_dir != \"\" )\n {\n toggleVisible();\n update_Download( p_update, qtu( dest_dir ) );\n }\n else\n updateButton->setEnabled( true );\n }\n}\n\n\/* Handle the events *\/\nvoid UpdateDialog::customEvent( QEvent *event )\n{\n if( event->type() == UDOkEvent )\n updateNotify( true );\n else\n updateNotify( false );\n}\n\n\/* Notify the end of the update_Check *\/\nvoid UpdateDialog::updateNotify( bool b_result )\n{\n \/* The update finish without errors *\/\n if( b_result )\n {\n if( update_NeedUpgrade( p_update ) )\n {\n update_release_t *p_release = update_GetRelease( p_update );\n assert( p_release );\n b_checked = true;\n updateButton->setText( \"Download\" );\n updateLabel->setText( qtr( \"There is a new version of VLC :\\n\" )\n + qfu( p_release->psz_desc ) );\n }\n else\n updateLabel->setText( qtr( \"You have the latest version of VLC\" ) );\n }\n else\n updateLabel->setText(\n qtr( \"An error occurred while checking for updates\" ) );\n\n adjustSize();\n updateButton->setEnabled( true );\n}\n\n#endif\n\n<commit_msg>Stick to ASCII in gettext messages<commit_after>\/*****************************************************************************\n * Help.cpp : Help and About dialogs\n ****************************************************************************\n * Copyright (C) 2007 the VideoLAN team\n * $Id$\n *\n * Authors: Jean-Baptiste Kempf <jb (at) videolan.org>\n * Rémi Duraffort <ivoire (at) via.ecp.fr>\n *\n * This program is free software; you can redistribute it and\/or modify\n * it under the terms of the GNU General Public License as published by\n * the Free Software Foundation; either version 2 of the License, or\n * (at your option) any later version.\n *\n * This program is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the\n * GNU General Public License for more details.\n *\n * You should have received a copy of the GNU General Public License\n * along with this program; if not, write to the Free Software\n * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston MA 02110-1301, USA.\n *****************************************************************************\/\n\n#ifdef HAVE_CONFIG_H\n# include \"config.h\"\n#endif\n\n#include <vlc_common.h>\n\n#include \"dialogs\/help.hpp\"\n#include <vlc_about.h>\n\n#ifdef UPDATE_CHECK\n#include <vlc_update.h>\n#endif\n\n#include \"dialogs_provider.hpp\"\n\n#include <vlc_intf_strings.h>\n\n#include <QTextBrowser>\n#include <QTabWidget>\n#include <QFile>\n#include <QLabel>\n#include <QString>\n#include <QDialogButtonBox>\n#include <QEvent>\n#include <QFileDialog>\n#include <QDate>\n\n\nHelpDialog *HelpDialog::instance = NULL;\n\nHelpDialog::HelpDialog( intf_thread_t *_p_intf ) : QVLCFrame( _p_intf )\n\n{\n setWindowTitle( qtr( \"Help\" ) );\n setMinimumSize( 250, 300 );\n\n QGridLayout *layout = new QGridLayout( this );\n QTextBrowser *helpBrowser = new QTextBrowser( this );\n helpBrowser->setOpenExternalLinks( true );\n helpBrowser->setHtml( I_LONGHELP );\n QPushButton *closeButton = new QPushButton( qtr( \"&Close\" ) );\n closeButton->setDefault( true );\n\n layout->addWidget( helpBrowser, 0, 0, 1, 0 );\n layout->addWidget( closeButton, 1, 3 );\n\n BUTTONACT( closeButton, close() );\n readSettings( \"Help\", QSize( 400, 450 ) );\n}\n\nHelpDialog::~HelpDialog()\n{\n writeSettings( \"Help\" );\n}\n\nvoid HelpDialog::close()\n{\n toggleVisible();\n}\n\nAboutDialog *AboutDialog::instance = NULL;\n\nAboutDialog::AboutDialog( QWidget *parent, intf_thread_t *_p_intf)\n : QVLCDialog( parent, _p_intf )\n{\n setWindowTitle( qtr( \"About\" ) );\n resize( 600, 500 );\n setMinimumSize( 600, 500 );\n\n QGridLayout *layout = new QGridLayout( this );\n QTabWidget *tab = new QTabWidget( this );\n\n QPushButton *closeButton = new QPushButton( qtr( \"&Close\" ) );\n closeButton->setSizePolicy( QSizePolicy::Minimum, QSizePolicy::Minimum );\n closeButton->setDefault( true );\n\n QLabel *introduction = new QLabel(\n qtr( \"VLC media player\" \" \" VERSION_MESSAGE ) );\n QLabel *iconVLC = new QLabel;\n if( QDate::currentDate().dayOfYear() >= 354 )\n iconVLC->setPixmap( QPixmap( \":\/vlc48-christmas.png\" ) );\n else\n iconVLC->setPixmap( QPixmap( \":\/vlc48.png\" ) );\n layout->addWidget( iconVLC, 0, 0, 1, 1 );\n layout->addWidget( introduction, 0, 1, 1, 7 );\n layout->addWidget( tab, 1, 0, 1, 8 );\n layout->addWidget( closeButton, 2, 6, 1, 2 );\n\n \/* Main Introduction *\/\n QWidget *infoWidget = new QWidget( this );\n QHBoxLayout *infoLayout = new QHBoxLayout( infoWidget );\n QLabel *infoLabel = new QLabel(\n qtr( \"VLC media player is a free media player, \"\n \"encoder and streamer that can read from files, \"\n \"CDs, DVDs, network streams, capture cards and even more!\\n\"\n \"Also, VLC works on essentially every popular platform.\\n\\n\" )\n + qtr( \"This version of VLC was compiled by:\\n \" )\n + qfu( VLC_CompileBy() )+ \"@\" + qfu( VLC_CompileHost() ) + \".\"\n + qfu( VLC_CompileDomain() ) + \".\\n\"\n + \"Compiler: \" + qfu( VLC_Compiler() ) + \".\\n\"\n + qtr( \"Based on Git commit: \" ) + qfu( VLC_Changeset() ) + \".\\n\"\n + qtr( \"You are using the Qt4 Interface.\\n\\n\" )\n + qtr( \"Copyright (C) \" COPYRIGHT_YEARS \" by the VideoLAN Team.\\n\" )\n + \"vlc@videolan.org, http:\/\/www.videolan.org\" );\n infoLabel->setWordWrap( infoLabel );\n\n QLabel *iconVLC2 = new QLabel;\n if( QDate::currentDate().dayOfYear() >= 354 )\n iconVLC2->setPixmap( QPixmap( \":\/vlc128-christmas.png\" ) );\n else\n iconVLC2->setPixmap( QPixmap( \":\/vlc128.png\" ) );\n infoLayout->addWidget( iconVLC2 );\n infoLayout->addWidget( infoLabel );\n\n \/* GPL License *\/\n QTextEdit *licenseEdit = new QTextEdit( this );\n licenseEdit->setText( qfu( psz_license ) );\n licenseEdit->setReadOnly( true );\n\n \/* People who helped *\/\n QWidget *thanksWidget = new QWidget( this );\n QVBoxLayout *thanksLayout = new QVBoxLayout( thanksWidget );\n\n QLabel *thanksLabel = new QLabel( qtr( \"We would like to thank the whole \"\n \"community, the testers, our users and the following people \"\n \"(and the missing ones...) for their collaboration to \"\n \"provide the best software.\" ) );\n thanksLabel->setWordWrap( true );\n thanksLayout->addWidget( thanksLabel );\n QTextEdit *thanksEdit = new QTextEdit( this );\n thanksEdit->setText( qfu( psz_thanks ) );\n thanksEdit->setReadOnly( true );\n thanksLayout->addWidget( thanksEdit );\n\n \/* People who wrote the software *\/\n QTextEdit *authorsEdit = new QTextEdit( this );\n authorsEdit->setText( qfu( psz_authors ) );\n authorsEdit->setReadOnly( true );\n\n \/* add the tabs to the Tabwidget *\/\n tab->addTab( infoWidget, qtr( \"About\" ) );\n tab->addTab( authorsEdit, qtr( \"Authors\" ) );\n tab->addTab( thanksWidget, qtr(\"Thanks\") );\n tab->addTab( licenseEdit, qtr(\"License\") );\n\n BUTTONACT( closeButton, close() );\n}\n\nAboutDialog::~AboutDialog()\n{\n}\n\nvoid AboutDialog::close()\n{\n toggleVisible();\n}\n\n#ifdef UPDATE_CHECK\n\n\/*****************************************************************************\n * UpdateDialog\n *****************************************************************************\/\n\/* callback to get information from the core *\/\nstatic void UpdateCallback( void *data, bool b_ret )\n{\n UpdateDialog* UDialog = (UpdateDialog *)data;\n QEvent* event;\n\n if( b_ret )\n event = new QEvent( (QEvent::Type)UDOkEvent );\n else\n event = new QEvent( (QEvent::Type)UDErrorEvent );\n\n QApplication::postEvent( UDialog, event );\n}\n\nUpdateDialog *UpdateDialog::instance = NULL;\n\nUpdateDialog::UpdateDialog( intf_thread_t *_p_intf ) : QVLCFrame( _p_intf )\n{\n setWindowTitle( qtr( \"Update\" ) );\n\n QGridLayout *layout = new QGridLayout( this );\n\n QPushButton *closeButton = new QPushButton( qtr( \"&Close\" ) );\n updateButton = new QPushButton( qtr( \"&Update List\" ) );\n updateButton->setDefault( true );\n QDialogButtonBox *buttonBox = new QDialogButtonBox( Qt::Horizontal );\n buttonBox->addButton( updateButton, QDialogButtonBox::ActionRole );\n buttonBox->addButton( closeButton, QDialogButtonBox::AcceptRole );\n\n updateLabel = new QLabel( qtr( \"Checking for an update...\" ) );\n updateLabel->setWordWrap( true );\n\n layout->addWidget( updateLabel, 0, 0 );\n layout->addWidget( buttonBox, 1, 0 );\n\n BUTTONACT( updateButton, UpdateOrDownload() );\n BUTTONACT( closeButton, close() );\n\n \/* Create the update structure *\/\n p_update = update_New( p_intf );\n b_checked = false;\n\n readSettings( \"Update\", QSize( 120, 80 ) );\n\n \/* Check for updates *\/\n UpdateOrDownload();\n}\n\nUpdateDialog::~UpdateDialog()\n{\n update_Delete( p_update );\n writeSettings( \"Update\" );\n}\n\nvoid UpdateDialog::close()\n{\n toggleVisible();\n}\n\n\/* Check for updates *\/\nvoid UpdateDialog::UpdateOrDownload()\n{\n if( !b_checked )\n {\n updateButton->setEnabled( false );\n msg_Dbg( p_intf, \"Launching an update request\" );\n update_Check( p_update, UpdateCallback, this );\n }\n else\n {\n updateButton->setEnabled( false );\n QString dest_dir = QFileDialog::getExistingDirectory( this,\n qtr( \"Select a directory ...\" ),\n qfu( config_GetHomeDir() ) );\n\n if( dest_dir != \"\" )\n {\n toggleVisible();\n update_Download( p_update, qtu( dest_dir ) );\n }\n else\n updateButton->setEnabled( true );\n }\n}\n\n\/* Handle the events *\/\nvoid UpdateDialog::customEvent( QEvent *event )\n{\n if( event->type() == UDOkEvent )\n updateNotify( true );\n else\n updateNotify( false );\n}\n\n\/* Notify the end of the update_Check *\/\nvoid UpdateDialog::updateNotify( bool b_result )\n{\n \/* The update finish without errors *\/\n if( b_result )\n {\n if( update_NeedUpgrade( p_update ) )\n {\n update_release_t *p_release = update_GetRelease( p_update );\n assert( p_release );\n b_checked = true;\n updateButton->setText( \"Download\" );\n updateLabel->setText( qtr( \"There is a new version of VLC :\\n\" )\n + qfu( p_release->psz_desc ) );\n }\n else\n updateLabel->setText( qtr( \"You have the latest version of VLC\" ) );\n }\n else\n updateLabel->setText(\n qtr( \"An error occurred while checking for updates\" ) );\n\n adjustSize();\n updateButton->setEnabled( true );\n}\n\n#endif\n\n<|endoftext|>"} {"text":"<commit_before>\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\n\/\/ Copyright 2006 - 2015, Paul Beckingham, Federico Hernandez.\n\/\/\n\/\/ Permission is hereby granted, free of charge, to any person obtaining a copy\n\/\/ of this software and associated documentation files (the \"Software\"), to deal\n\/\/ in the Software without restriction, including without limitation the rights\n\/\/ to use, copy, modify, merge, publish, distribute, sublicense, and\/or sell\n\/\/ copies of the Software, and to permit persons to whom the Software is\n\/\/ furnished to do so, subject to the following conditions:\n\/\/\n\/\/ The above copyright notice and this permission notice shall be included\n\/\/ in all copies or substantial portions of the Software.\n\/\/\n\/\/ THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS\n\/\/ OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\n\/\/ FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL\n\/\/ THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\n\/\/ LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,\n\/\/ OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE\n\/\/ SOFTWARE.\n\/\/\n\/\/ http:\/\/www.opensource.org\/licenses\/mit-license.php\n\/\/\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n#include <cmake.h>\n#include <sstream>\n#include <string>\n#include <stdio.h>\n#include <stdlib.h>\n#include <string.h>\n#include <Nibbler.h>\n#include <Lexer.h>\n#include <Duration.h>\n#include <text.h>\n\n#define DAY 86400\n#define HOUR 3600\n#define MINUTE 60\n#define SECOND 1\n\nstatic struct\n{\n std::string unit;\n int seconds;\n bool standalone;\n} durations[] =\n{\n \/\/ These are sorted by first character, then length, so that Nibbler::getOneOf\n \/\/ returns a maximal match.\n {\"annual\", 365 * DAY, true},\n {\"biannual\", 730 * DAY, true},\n {\"bimonthly\", 61 * DAY, true},\n {\"biweekly\", 14 * DAY, true},\n {\"biyearly\", 730 * DAY, true},\n {\"daily\", 1 * DAY, true},\n {\"days\", 1 * DAY, false},\n {\"day\", 1 * DAY, true},\n {\"d\", 1 * DAY, false},\n {\"fortnight\", 14 * DAY, true},\n {\"hours\", 1 * HOUR, false},\n {\"hour\", 1 * HOUR, true},\n {\"hrs\", 1 * HOUR, false},\n {\"hr\", 1 * HOUR, true},\n {\"h\", 1 * HOUR, false},\n {\"minutes\", 1 * MINUTE, false},\n {\"minute\", 1 * MINUTE, true},\n {\"mins\", 1 * MINUTE, false},\n {\"min\", 1 * MINUTE, true},\n {\"monthly\", 30 * DAY, true},\n {\"months\", 30 * DAY, false},\n {\"month\", 30 * DAY, true},\n {\"mnths\", 30 * DAY, false},\n {\"mths\", 30 * DAY, false},\n {\"mth\", 30 * DAY, true},\n {\"mos\", 30 * DAY, false},\n {\"mo\", 30 * DAY, true},\n {\"m\", 30 * DAY, false},\n {\"quarterly\", 91 * DAY, true},\n {\"quarters\", 91 * DAY, false},\n {\"quarter\", 91 * DAY, true},\n {\"qrtrs\", 91 * DAY, false},\n {\"qrtr\", 91 * DAY, true},\n {\"qtrs\", 91 * DAY, false},\n {\"qtr\", 91 * DAY, true},\n {\"q\", 91 * DAY, false},\n {\"semiannual\", 183 * DAY, true},\n {\"sennight\", 14 * DAY, false},\n {\"seconds\", 1 * SECOND, false},\n {\"second\", 1 * SECOND, true},\n {\"secs\", 1 * SECOND, false},\n {\"sec\", 1 * SECOND, true},\n {\"s\", 1 * SECOND, false},\n {\"weekdays\", 1 * DAY, true},\n {\"weekly\", 7 * DAY, true},\n {\"weeks\", 7 * DAY, false},\n {\"week\", 7 * DAY, true},\n {\"wks\", 7 * DAY, false},\n {\"wk\", 7 * DAY, true},\n {\"w\", 7 * DAY, false},\n {\"yearly\", 365 * DAY, true},\n {\"years\", 365 * DAY, false},\n {\"year\", 365 * DAY, true},\n {\"yrs\", 365 * DAY, false},\n {\"yr\", 365 * DAY, true},\n {\"y\", 365 * DAY, false},\n};\n\n#define NUM_DURATIONS (sizeof (durations) \/ sizeof (durations[0]))\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nDuration::Duration ()\n: _secs (0)\n{\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nDuration::Duration (time_t input)\n: _secs (input)\n{\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nDuration::Duration (const std::string& input)\n: _secs (0)\n{\n if (Lexer::isAllDigits (input))\n {\n time_t value = (time_t) strtol (input.c_str (), NULL, 10);\n if (value == 0 || value > 60)\n {\n _secs = value;\n return;\n }\n }\n\n std::string::size_type idx = 0;\n parse (input, idx);\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nDuration::~Duration ()\n{\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nbool Duration::operator< (const Duration& other)\n{\n return _secs < other._secs;\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nbool Duration::operator> (const Duration& other)\n{\n return _secs > other._secs;\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nDuration& Duration::operator= (const Duration& other)\n{\n if (this != &other)\n _secs = other._secs;\n\n return *this;\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nDuration::operator time_t () const\n{\n return _secs;\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nDuration::operator std::string () const\n{\n std::stringstream s;\n s << _secs;\n return s.str ();\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nstd::string Duration::format () const\n{\n char formatted[24];\n float days = (float) _secs \/ 86400.0;\n\n if (_secs >= 86400 * 365)\n sprintf (formatted, \"%.1f year%s\",\n (days \/ 365),\n ((int) (float) (days \/ 365) == 1 ? \"\" : \"s\"));\n else if (_secs > 86400 * 84)\n sprintf (formatted, \"%1d month%s\",\n (int) (float) (days \/ 30),\n ((int) (float) (days \/ 30) == 1 ? \"\" : \"s\"));\n else if (_secs > 86400 * 13)\n sprintf (formatted, \"%d week%s\",\n (int) (float) (days \/ 7.0),\n ((int) (float) (days \/ 7.0) == 1 ? \"\" : \"s\"));\n else if (_secs >= 86400)\n sprintf (formatted, \"%d day%s\",\n (int) days,\n ((int) days == 1 ? \"\" : \"s\"));\n else if (_secs >= 3600)\n sprintf (formatted, \"%d hour%s\",\n (int) (float) (_secs \/ 3600),\n ((int) (float) (_secs \/ 3600) == 1 ? \"\" : \"s\"));\n else if (_secs >= 60)\n sprintf (formatted, \"%d minute%s\",\n (int) (float) (_secs \/ 60),\n ((int) (float) (_secs \/ 60) == 1 ? \"\" : \"s\"));\n else if (_secs >= 1)\n sprintf (formatted, \"%d second%s\",\n (int) _secs,\n ((int) _secs == 1 ? \"\" : \"s\"));\n else\n strcpy (formatted, \"-\"); \/\/ no i18n\n\n return std::string (formatted);\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nstd::string Duration::formatCompact () const\n{\n char formatted[24];\n float days = (float) _secs \/ 86400.0;\n\n if (_secs >= 86400 * 365) sprintf (formatted, \"%.1fy\", (days \/ 365.0));\n else if (_secs >= 86400 * 84) sprintf (formatted, \"%1dmo\", (int) (days \/ 30));\n else if (_secs >= 86400 * 13) sprintf (formatted, \"%dw\", (int) (float) (days \/ 7.0));\n else if (_secs >= 86400) sprintf (formatted, \"%dd\", (int) days);\n else if (_secs >= 3600) sprintf (formatted, \"%dh\", (int) (_secs \/ 3600));\n else if (_secs >= 60) sprintf (formatted, \"%dmin\", (int) (_secs \/ 60));\n else if (_secs >= 1) sprintf (formatted, \"%ds\", (int) _secs);\n else formatted[0] = '\\0';\n\n return std::string (formatted);\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nstd::string Duration::formatPrecise () const\n{\n char formatted[24];\n\n int days = _secs \/ 86400;\n int hours = (_secs % 86400) \/ 3600;\n int minutes = (_secs % 3600) \/ 60;\n int seconds = _secs % 60;\n\n if (days > 0) sprintf (formatted, \"%dd %d:%02d:%02d\", days, hours, minutes, seconds);\n else sprintf (formatted, \"%d:%02d:%02d\", hours, minutes, seconds);\n\n return std::string (formatted);\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nstd::string Duration::formatSeconds () const\n{\n char formatted[24];\n sprintf (formatted, \"%llus\", (unsigned long long)_secs);\n return std::string (formatted);\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nstd::string Duration::formatISO () const\n{\n if (_secs)\n {\n time_t t = _secs;\n int seconds = t % 60; t \/= 60;\n int minutes = t % 60; t \/= 60;\n int hours = t % 24; t \/= 24;\n int days = t % 30; t \/= 30;\n int months = t % 12; t \/= 12;\n int years = t;\n\n std::stringstream s;\n s << 'P';\n if (years) s << years << 'Y';\n if (months) s << months << 'M';\n if (days) s << days << 'D';\n\n if (hours || minutes || seconds)\n {\n s << 'T';\n if (hours) s << hours << 'H';\n if (minutes) s << minutes << 'M';\n if (seconds) s << seconds << 'S';\n }\n\n return s.str ();\n }\n else\n {\n return \"PT0S\";\n }\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nbool Duration::parse (const std::string& input, std::string::size_type& start)\n{\n auto original_start = start;\n Nibbler n (input.substr (start));\n\n \/\/ Static and so preserved between calls.\n static std::vector <std::string> units;\n if (units.size () == 0)\n for (unsigned int i = 0; i < NUM_DURATIONS; i++)\n units.push_back (durations[i].unit);\n\n std::string number;\n std::string unit;\n\n if (n.getOneOf (units, unit))\n {\n if (n.depleted () ||\n Lexer::isWhitespace (n.next ()) ||\n Lexer::isSingleCharOperator (n.next ()))\n {\n start = original_start + n.cursor ();\n\n \/\/ Linear lookup - should be logarithmic.\n for (unsigned int i = 0; i < NUM_DURATIONS; i++)\n {\n if (durations[i].unit == unit &&\n durations[i].standalone == true)\n {\n _secs = static_cast <int> (durations[i].seconds);\n return true;\n }\n }\n }\n }\n\n else if (n.getNumber (number) &&\n number.find ('e') == std::string::npos &&\n number.find ('E') == std::string::npos &&\n (number.find ('+') == std::string::npos || number.find ('+') == 0) &&\n (number.find ('-') == std::string::npos || number.find ('-') == 0))\n {\n n.skipWS ();\n if (n.getOneOf (units, unit))\n {\n if (n.depleted () ||\n Lexer::isWhitespace (n.next ()) ||\n Lexer::isSingleCharOperator (n.next ()))\n {\n start = original_start + n.cursor ();\n double quantity = strtod (number.c_str (), NULL);\n\n \/\/ Linear lookup - should be logarithmic.\n double seconds = 1;\n for (unsigned int i = 0; i < NUM_DURATIONS; i++)\n {\n if (durations[i].unit == unit)\n {\n seconds = durations[i].seconds;\n _secs = static_cast <int> (quantity * static_cast <double> (seconds));\n return true;\n }\n }\n }\n }\n }\n\n return false;\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n<commit_msg>Duration: Addressed problem of UUID\/Duration overlap<commit_after>\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\n\/\/ Copyright 2006 - 2015, Paul Beckingham, Federico Hernandez.\n\/\/\n\/\/ Permission is hereby granted, free of charge, to any person obtaining a copy\n\/\/ of this software and associated documentation files (the \"Software\"), to deal\n\/\/ in the Software without restriction, including without limitation the rights\n\/\/ to use, copy, modify, merge, publish, distribute, sublicense, and\/or sell\n\/\/ copies of the Software, and to permit persons to whom the Software is\n\/\/ furnished to do so, subject to the following conditions:\n\/\/\n\/\/ The above copyright notice and this permission notice shall be included\n\/\/ in all copies or substantial portions of the Software.\n\/\/\n\/\/ THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS\n\/\/ OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\n\/\/ FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL\n\/\/ THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\n\/\/ LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,\n\/\/ OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE\n\/\/ SOFTWARE.\n\/\/\n\/\/ http:\/\/www.opensource.org\/licenses\/mit-license.php\n\/\/\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n#include <cmake.h>\n#include <sstream>\n#include <string>\n#include <stdio.h>\n#include <stdlib.h>\n#include <string.h>\n#include <Nibbler.h>\n#include <Lexer.h>\n#include <Duration.h>\n#include <text.h>\n\n#define DAY 86400\n#define HOUR 3600\n#define MINUTE 60\n#define SECOND 1\n\nstatic struct\n{\n std::string unit;\n int seconds;\n bool standalone;\n} durations[] =\n{\n \/\/ These are sorted by first character, then length, so that Nibbler::getOneOf\n \/\/ returns a maximal match.\n {\"annual\", 365 * DAY, true},\n {\"biannual\", 730 * DAY, true},\n {\"bimonthly\", 61 * DAY, true},\n {\"biweekly\", 14 * DAY, true},\n {\"biyearly\", 730 * DAY, true},\n {\"daily\", 1 * DAY, true},\n {\"days\", 1 * DAY, false},\n {\"day\", 1 * DAY, true},\n {\"d\", 1 * DAY, false},\n {\"fortnight\", 14 * DAY, true},\n {\"hours\", 1 * HOUR, false},\n {\"hour\", 1 * HOUR, true},\n {\"hrs\", 1 * HOUR, false},\n {\"hr\", 1 * HOUR, true},\n {\"h\", 1 * HOUR, false},\n {\"minutes\", 1 * MINUTE, false},\n {\"minute\", 1 * MINUTE, true},\n {\"mins\", 1 * MINUTE, false},\n {\"min\", 1 * MINUTE, true},\n {\"monthly\", 30 * DAY, true},\n {\"months\", 30 * DAY, false},\n {\"month\", 30 * DAY, true},\n {\"mnths\", 30 * DAY, false},\n {\"mths\", 30 * DAY, false},\n {\"mth\", 30 * DAY, true},\n {\"mos\", 30 * DAY, false},\n {\"mo\", 30 * DAY, true},\n {\"m\", 30 * DAY, false},\n {\"quarterly\", 91 * DAY, true},\n {\"quarters\", 91 * DAY, false},\n {\"quarter\", 91 * DAY, true},\n {\"qrtrs\", 91 * DAY, false},\n {\"qrtr\", 91 * DAY, true},\n {\"qtrs\", 91 * DAY, false},\n {\"qtr\", 91 * DAY, true},\n {\"q\", 91 * DAY, false},\n {\"semiannual\", 183 * DAY, true},\n {\"sennight\", 14 * DAY, false},\n {\"seconds\", 1 * SECOND, false},\n {\"second\", 1 * SECOND, true},\n {\"secs\", 1 * SECOND, false},\n {\"sec\", 1 * SECOND, true},\n {\"s\", 1 * SECOND, false},\n {\"weekdays\", 1 * DAY, true},\n {\"weekly\", 7 * DAY, true},\n {\"weeks\", 7 * DAY, false},\n {\"week\", 7 * DAY, true},\n {\"wks\", 7 * DAY, false},\n {\"wk\", 7 * DAY, true},\n {\"w\", 7 * DAY, false},\n {\"yearly\", 365 * DAY, true},\n {\"years\", 365 * DAY, false},\n {\"year\", 365 * DAY, true},\n {\"yrs\", 365 * DAY, false},\n {\"yr\", 365 * DAY, true},\n {\"y\", 365 * DAY, false},\n};\n\n#define NUM_DURATIONS (sizeof (durations) \/ sizeof (durations[0]))\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nDuration::Duration ()\n: _secs (0)\n{\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nDuration::Duration (time_t input)\n: _secs (input)\n{\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nDuration::Duration (const std::string& input)\n: _secs (0)\n{\n if (Lexer::isAllDigits (input))\n {\n time_t value = (time_t) strtol (input.c_str (), NULL, 10);\n if (value == 0 || value > 60)\n {\n _secs = value;\n return;\n }\n }\n\n std::string::size_type idx = 0;\n parse (input, idx);\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nDuration::~Duration ()\n{\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nbool Duration::operator< (const Duration& other)\n{\n return _secs < other._secs;\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nbool Duration::operator> (const Duration& other)\n{\n return _secs > other._secs;\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nDuration& Duration::operator= (const Duration& other)\n{\n if (this != &other)\n _secs = other._secs;\n\n return *this;\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nDuration::operator time_t () const\n{\n return _secs;\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nDuration::operator std::string () const\n{\n std::stringstream s;\n s << _secs;\n return s.str ();\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nstd::string Duration::format () const\n{\n char formatted[24];\n float days = (float) _secs \/ 86400.0;\n\n if (_secs >= 86400 * 365)\n sprintf (formatted, \"%.1f year%s\",\n (days \/ 365),\n ((int) (float) (days \/ 365) == 1 ? \"\" : \"s\"));\n else if (_secs > 86400 * 84)\n sprintf (formatted, \"%1d month%s\",\n (int) (float) (days \/ 30),\n ((int) (float) (days \/ 30) == 1 ? \"\" : \"s\"));\n else if (_secs > 86400 * 13)\n sprintf (formatted, \"%d week%s\",\n (int) (float) (days \/ 7.0),\n ((int) (float) (days \/ 7.0) == 1 ? \"\" : \"s\"));\n else if (_secs >= 86400)\n sprintf (formatted, \"%d day%s\",\n (int) days,\n ((int) days == 1 ? \"\" : \"s\"));\n else if (_secs >= 3600)\n sprintf (formatted, \"%d hour%s\",\n (int) (float) (_secs \/ 3600),\n ((int) (float) (_secs \/ 3600) == 1 ? \"\" : \"s\"));\n else if (_secs >= 60)\n sprintf (formatted, \"%d minute%s\",\n (int) (float) (_secs \/ 60),\n ((int) (float) (_secs \/ 60) == 1 ? \"\" : \"s\"));\n else if (_secs >= 1)\n sprintf (formatted, \"%d second%s\",\n (int) _secs,\n ((int) _secs == 1 ? \"\" : \"s\"));\n else\n strcpy (formatted, \"-\"); \/\/ no i18n\n\n return std::string (formatted);\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nstd::string Duration::formatCompact () const\n{\n char formatted[24];\n float days = (float) _secs \/ 86400.0;\n\n if (_secs >= 86400 * 365) sprintf (formatted, \"%.1fy\", (days \/ 365.0));\n else if (_secs >= 86400 * 84) sprintf (formatted, \"%1dmo\", (int) (days \/ 30));\n else if (_secs >= 86400 * 13) sprintf (formatted, \"%dw\", (int) (float) (days \/ 7.0));\n else if (_secs >= 86400) sprintf (formatted, \"%dd\", (int) days);\n else if (_secs >= 3600) sprintf (formatted, \"%dh\", (int) (_secs \/ 3600));\n else if (_secs >= 60) sprintf (formatted, \"%dmin\", (int) (_secs \/ 60));\n else if (_secs >= 1) sprintf (formatted, \"%ds\", (int) _secs);\n else formatted[0] = '\\0';\n\n return std::string (formatted);\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nstd::string Duration::formatPrecise () const\n{\n char formatted[24];\n\n int days = _secs \/ 86400;\n int hours = (_secs % 86400) \/ 3600;\n int minutes = (_secs % 3600) \/ 60;\n int seconds = _secs % 60;\n\n if (days > 0) sprintf (formatted, \"%dd %d:%02d:%02d\", days, hours, minutes, seconds);\n else sprintf (formatted, \"%d:%02d:%02d\", hours, minutes, seconds);\n\n return std::string (formatted);\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nstd::string Duration::formatSeconds () const\n{\n char formatted[24];\n sprintf (formatted, \"%llus\", (unsigned long long)_secs);\n return std::string (formatted);\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nstd::string Duration::formatISO () const\n{\n if (_secs)\n {\n time_t t = _secs;\n int seconds = t % 60; t \/= 60;\n int minutes = t % 60; t \/= 60;\n int hours = t % 24; t \/= 24;\n int days = t % 30; t \/= 30;\n int months = t % 12; t \/= 12;\n int years = t;\n\n std::stringstream s;\n s << 'P';\n if (years) s << years << 'Y';\n if (months) s << months << 'M';\n if (days) s << days << 'D';\n\n if (hours || minutes || seconds)\n {\n s << 'T';\n if (hours) s << hours << 'H';\n if (minutes) s << minutes << 'M';\n if (seconds) s << seconds << 'S';\n }\n\n return s.str ();\n }\n else\n {\n return \"PT0S\";\n }\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nbool Duration::parse (const std::string& input, std::string::size_type& start)\n{\n auto original_start = start;\n Nibbler n (input.substr (start));\n\n \/\/ Static and so preserved between calls.\n static std::vector <std::string> units;\n if (units.size () == 0)\n for (unsigned int i = 0; i < NUM_DURATIONS; i++)\n units.push_back (durations[i].unit);\n\n std::string number;\n std::string unit;\n\n if (n.getOneOf (units, unit))\n {\n if (n.depleted () ||\n Lexer::isWhitespace (n.next ()) ||\n Lexer::isSingleCharOperator (n.next ()))\n {\n start = original_start + n.cursor ();\n\n \/\/ Linear lookup - should be logarithmic.\n for (unsigned int i = 0; i < NUM_DURATIONS; i++)\n {\n if (durations[i].unit == unit &&\n durations[i].standalone == true)\n {\n _secs = static_cast <int> (durations[i].seconds);\n return true;\n }\n }\n }\n }\n\n else if (n.getNumber (number) &&\n number.find ('e') == std::string::npos &&\n number.find ('E') == std::string::npos &&\n (number.find ('+') == std::string::npos || number.find ('+') == 0) &&\n (number.find ('-') == std::string::npos || number.find ('-') == 0))\n {\n n.skipWS ();\n if (n.getOneOf (units, unit))\n {\n \/\/ The \"d\" unit is a special case, because it is the only one that can\n \/\/ legitimately occur at the beginning of a UUID, and be followed by an\n \/\/ operator:\n \/\/\n \/\/ 1111111d-0000-0000-0000-000000000000\n \/\/\n \/\/ Because Lexer::isDuration is higher precedence than Lexer::isUUID,\n \/\/ the above UUID looks like:\n \/\/\n \/\/ <1111111d> <-> ...\n \/\/ duration op ...\n \/\/\n \/\/ So as a special case, durations, with units of \"d\" are rejected if the\n \/\/ quantity exceeds 10000.\n \/\/\n if (unit == \"d\" &&\n strtol (number.c_str (), NULL, 10) > 10000)\n return false;\n\n if (n.depleted () ||\n Lexer::isWhitespace (n.next ()) ||\n Lexer::isSingleCharOperator (n.next ()))\n {\n start = original_start + n.cursor ();\n double quantity = strtod (number.c_str (), NULL);\n\n \/\/ Linear lookup - should be logarithmic.\n double seconds = 1;\n for (unsigned int i = 0; i < NUM_DURATIONS; i++)\n {\n if (durations[i].unit == unit)\n {\n seconds = durations[i].seconds;\n _secs = static_cast <int> (quantity * static_cast <double> (seconds));\n return true;\n }\n }\n }\n }\n }\n\n return false;\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n<|endoftext|>"} {"text":"<commit_before>\/*****************************************************************************\n * sout.cpp : Stream output dialog ( old-style )\n ****************************************************************************\n * Copyright (C) 2007-2009 the VideoLAN team\n *\n * $Id$\n *\n * Authors: Clément Stenac <zorglub@videolan.org>\n * 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\n * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston MA 02110-1301, USA.\n *****************************************************************************\/\n\n#ifdef HAVE_CONFIG_H\n# include \"config.h\"\n#endif\n\n#include \"dialogs\/sout.hpp\"\n#include \"util\/qt_dirs.hpp\"\n#include \"components\/sout\/sout_widgets.hpp\"\n\n#include <QString>\n#include <QFileDialog>\n#include <QToolButton>\n#include <assert.h>\n\nSoutDialog::SoutDialog( QWidget *parent, intf_thread_t *_p_intf, const QString& inputMRL )\n : QVLCDialog( parent, _p_intf )\n{\n setWindowTitle( qtr( \"Stream Output\" ) );\n setWindowRole( \"vlc-stream-output\" );\n\n \/* UI stuff *\/\n ui.setupUi( this );\n ui.inputBox->setMRL( inputMRL );\n ui.helpEdit->setPlainText( qtr(\"This dialog will allow you to stream or \"\n \"convert your media for use locally, on your private network, \"\n \"or on the Internet.\\n\"\n \"You should start by checking that source matches what you want \"\n \"your input to be and then press the \\\"Next\\\" \"\n \"button to continue.\\n\") );\n\n ui.mrlEdit->setToolTip ( qtr( \"Stream output string.\\n\"\n \"This is automatically generated \"\n \"when you change the above settings,\\n\"\n \"but you can change it manually.\" ) ) ;\n\n#if 0\n \/* This needs Qt4.5 to be cool *\/\n ui.destTab->setTabsClosable( true );\n#else\n closeTabButton = new QToolButton( this );\n ui.destTab->setCornerWidget( closeTabButton );\n closeTabButton->hide();\n closeTabButton->setAutoRaise( true );\n closeTabButton->setIcon( QIcon( \":\/toolbar\/clear\" ) );\n BUTTONACT( closeTabButton, closeTab() );\n#endif\n CONNECT( ui.destTab, currentChanged( int ), this, tabChanged( int ) );\n ui.destTab->setTabIcon( 0, QIcon( \":\/buttons\/playlist\/playlist_add\" ) );\n\n ui.destBox->addItem( qtr( \"File\" ) );\n ui.destBox->addItem( \"HTTP\" );\n ui.destBox->addItem( \"MS-WMSP (MMSH)\" );\n ui.destBox->addItem( \"RTP \/ Transport Stream\" );\n ui.destBox->addItem( \"UDP (legacy)\" );\n ui.destBox->addItem( \"IceCast\" );\n\n BUTTONACT( ui.addButton, addDest() );\n\n\/\/ \/* Connect everything to the updateMRL function *\/\n#define CB( x ) CONNECT( ui.x, toggled( bool ), this, updateMRL() );\n#define CT( x ) CONNECT( ui.x, textChanged( const QString& ), this, updateMRL() );\n#define CS( x ) CONNECT( ui.x, valueChanged( int ), this, updateMRL() );\n#define CC( x ) CONNECT( ui.x, currentIndexChanged( int ), this, updateMRL() );\n\n \/* Misc *\/\n CB( soutAll ); CS( ttl ); CT( sapName ); CT( sapGroup );\n CB( localOutput );\n CONNECT( ui.profileSelect, optionsChanged(), this, updateMRL() );\n\n okButton = new QPushButton( qtr( \"&Stream\" ) );\n QPushButton *cancelButton = new QPushButton( qtr( \"&Cancel\" ) );\n\n okButton->setDefault( true );\n ui.acceptButtonBox->addButton( okButton, QDialogButtonBox::AcceptRole );\n ui.acceptButtonBox->addButton( cancelButton, QDialogButtonBox::RejectRole );\n\n BUTTONACT( okButton, ok() );\n BUTTONACT( cancelButton, cancel() );\n\n BUTTONACT( ui.nextButton, next() );\n BUTTONACT( ui.nextButton2, next() );\n BUTTONACT( ui.prevButton, prev() );\n BUTTONACT( ui.prevButton2, prev() );\n\n#undef CC\n#undef CS\n#undef CT\n#undef CB\n}\n\nvoid SoutDialog::next()\n{\n ui.toolBox->setCurrentIndex( ui.toolBox->currentIndex() + 1 );\n}\n\nvoid SoutDialog::prev()\n{\n ui.toolBox->setCurrentIndex( ui.toolBox->currentIndex() - 1 );\n}\n\nvoid SoutDialog::tabChanged( int i )\n{\n closeTabButton->setVisible( (i != 0) );\n}\n\nvoid SoutDialog::closeTab()\n{\n int i = ui.destTab->currentIndex();\n if( i == 0 ) return;\n\n QWidget *temp = ui.destTab->currentWidget();\n ui.destTab->removeTab( i );\n delete temp;\n updateMRL();\n}\n\nvoid SoutDialog::addDest( )\n{\n int index;\n switch( ui.destBox->currentIndex() )\n {\n case 0:\n {\n FileDestBox *fdb = new FileDestBox( this );\n index = ui.destTab->addTab( fdb, qtr( \"File\" ) );\n CONNECT( fdb, mrlUpdated(), this, updateMRL() );\n }\n break;\n case 1:\n {\n HTTPDestBox *hdb = new HTTPDestBox( this );\n index = ui.destTab->addTab( hdb, \"HTTP\" );\n CONNECT( hdb, mrlUpdated(), this, updateMRL() );\n }\n break;\n case 2:\n {\n MMSHDestBox *mdb = new MMSHDestBox( this );\n index = ui.destTab->addTab( mdb, \"WMSP\" );\n CONNECT( mdb, mrlUpdated(), this, updateMRL() );\n }\n break;\n case 3:\n {\n RTPDestBox *rdb = new RTPDestBox( this );\n index = ui.destTab->addTab( rdb, \"RTP\/TS\" );\n CONNECT( rdb, mrlUpdated(), this, updateMRL() );\n }\n break;\n case 4:\n {\n UDPDestBox *udb = new UDPDestBox( this );\n index = ui.destTab->addTab( udb, \"UDP\" );\n CONNECT( udb, mrlUpdated(), this, updateMRL() );\n }\n break;\n case 5:\n {\n ICEDestBox *idb = new ICEDestBox( this );\n index = ui.destTab->addTab( idb, \"Icecast\" );\n CONNECT( idb, mrlUpdated(), this, updateMRL() );\n }\n break;\n default:\n assert(0);\n }\n\n ui.destTab->setCurrentIndex( index );\n updateMRL();\n}\n\nvoid SoutDialog::ok()\n{\n mrl = ui.mrlEdit->toPlainText();\n accept();\n}\n\nvoid SoutDialog::cancel()\n{\n mrl.clear();\n reject();\n}\n\nvoid SoutDialog::updateMRL()\n{\n QString qs_mux = ui.profileSelect->getMux();\n\n SoutMrl smrl( \":sout=#\" );\n if( !ui.profileSelect->getTranscode().isEmpty() && ui.transcodeBox->isChecked() )\n {\n smrl.begin( ui.profileSelect->getTranscode() );\n smrl.end();\n }\n\n bool multi = false;\n\n if( ui.destTab->count() >= 3 ||\n ( ui.destTab->count() == 2 && ui.localOutput->isChecked() ) )\n multi = true;\n\n if( multi )\n smrl.begin( \"duplicate\" );\n\n for( int i = 1; i < ui.destTab->count(); i++ )\n {\n VirtualDestBox *vdb = qobject_cast<VirtualDestBox *>(ui.destTab->widget( i ));\n QString tempMRL = vdb->getMRL( qs_mux );\n\n if( tempMRL.isEmpty() ) continue;\n if( multi )\n smrl.option( \"dst\", tempMRL );\n else\n {\n smrl.begin( tempMRL);\n smrl.end();\n }\n }\n if( ui.localOutput->isChecked() )\n {\n if( multi )\n smrl.option( \"dst\", \"display\" );\n else\n {\n smrl.begin( \"display\" );\n smrl.end();\n }\n }\n\n if ( multi ) smrl.end();\n\n mrl = smrl.getMrl();\n\n \/* FIXME, deal with SAP\n sout.b_sap = ui.sap->isChecked();\n sout.psz_group = strdup( qtu( ui.sapGroup->text() ) );\n sout.psz_name = strdup( qtu( ui.sapName->text() ) ); *\/\n\n if( ui.soutAll->isChecked() ) mrl.append( \" :sout-all\" );\n\n mrl.append( \" :sout-keep\" );\n\n ui.mrlEdit->setPlainText( mrl );\n}\n\n<commit_msg>Code factorization<commit_after>\/*****************************************************************************\n * sout.cpp : Stream output dialog ( old-style )\n ****************************************************************************\n * Copyright (C) 2007-2009 the VideoLAN team\n *\n * $Id$\n *\n * Authors: Clément Stenac <zorglub@videolan.org>\n * 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\n * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston MA 02110-1301, USA.\n *****************************************************************************\/\n\n#ifdef HAVE_CONFIG_H\n# include \"config.h\"\n#endif\n\n#include \"dialogs\/sout.hpp\"\n#include \"util\/qt_dirs.hpp\"\n#include \"components\/sout\/sout_widgets.hpp\"\n\n#include <QString>\n#include <QFileDialog>\n#include <QToolButton>\n#include <assert.h>\n\nSoutDialog::SoutDialog( QWidget *parent, intf_thread_t *_p_intf, const QString& inputMRL )\n : QVLCDialog( parent, _p_intf )\n{\n setWindowTitle( qtr( \"Stream Output\" ) );\n setWindowRole( \"vlc-stream-output\" );\n\n \/* UI stuff *\/\n ui.setupUi( this );\n ui.inputBox->setMRL( inputMRL );\n ui.helpEdit->setPlainText( qtr(\"This dialog will allow you to stream or \"\n \"convert your media for use locally, on your private network, \"\n \"or on the Internet.\\n\"\n \"You should start by checking that source matches what you want \"\n \"your input to be and then press the \\\"Next\\\" \"\n \"button to continue.\\n\") );\n\n ui.mrlEdit->setToolTip ( qtr( \"Stream output string.\\n\"\n \"This is automatically generated \"\n \"when you change the above settings,\\n\"\n \"but you can change it manually.\" ) ) ;\n\n#if 0\n \/* This needs Qt4.5 to be cool *\/\n ui.destTab->setTabsClosable( true );\n#else\n closeTabButton = new QToolButton( this );\n ui.destTab->setCornerWidget( closeTabButton );\n closeTabButton->hide();\n closeTabButton->setAutoRaise( true );\n closeTabButton->setIcon( QIcon( \":\/toolbar\/clear\" ) );\n BUTTONACT( closeTabButton, closeTab() );\n#endif\n CONNECT( ui.destTab, currentChanged( int ), this, tabChanged( int ) );\n ui.destTab->setTabIcon( 0, QIcon( \":\/buttons\/playlist\/playlist_add\" ) );\n\n ui.destBox->addItem( qtr( \"File\" ) );\n ui.destBox->addItem( \"HTTP\" );\n ui.destBox->addItem( \"MS-WMSP (MMSH)\" );\n ui.destBox->addItem( \"RTP \/ Transport Stream\" );\n ui.destBox->addItem( \"UDP (legacy)\" );\n ui.destBox->addItem( \"IceCast\" );\n\n BUTTONACT( ui.addButton, addDest() );\n\n\/\/ \/* Connect everything to the updateMRL function *\/\n#define CB( x ) CONNECT( ui.x, toggled( bool ), this, updateMRL() );\n#define CT( x ) CONNECT( ui.x, textChanged( const QString& ), this, updateMRL() );\n#define CS( x ) CONNECT( ui.x, valueChanged( int ), this, updateMRL() );\n#define CC( x ) CONNECT( ui.x, currentIndexChanged( int ), this, updateMRL() );\n\n \/* Misc *\/\n CB( soutAll ); CS( ttl ); CT( sapName ); CT( sapGroup );\n CB( localOutput );\n CONNECT( ui.profileSelect, optionsChanged(), this, updateMRL() );\n\n okButton = new QPushButton( qtr( \"&Stream\" ) );\n QPushButton *cancelButton = new QPushButton( qtr( \"&Cancel\" ) );\n\n okButton->setDefault( true );\n ui.acceptButtonBox->addButton( okButton, QDialogButtonBox::AcceptRole );\n ui.acceptButtonBox->addButton( cancelButton, QDialogButtonBox::RejectRole );\n\n BUTTONACT( okButton, ok() );\n BUTTONACT( cancelButton, cancel() );\n\n BUTTONACT( ui.nextButton, next() );\n BUTTONACT( ui.nextButton2, next() );\n BUTTONACT( ui.prevButton, prev() );\n BUTTONACT( ui.prevButton2, prev() );\n\n#undef CC\n#undef CS\n#undef CT\n#undef CB\n}\n\nvoid SoutDialog::next()\n{\n ui.toolBox->setCurrentIndex( ui.toolBox->currentIndex() + 1 );\n}\n\nvoid SoutDialog::prev()\n{\n ui.toolBox->setCurrentIndex( ui.toolBox->currentIndex() - 1 );\n}\n\nvoid SoutDialog::tabChanged( int i )\n{\n closeTabButton->setVisible( (i != 0) );\n}\n\nvoid SoutDialog::closeTab()\n{\n int i = ui.destTab->currentIndex();\n if( i == 0 ) return;\n\n QWidget *temp = ui.destTab->currentWidget();\n ui.destTab->removeTab( i );\n delete temp;\n updateMRL();\n}\n\nvoid SoutDialog::addDest( )\n{\n VirtualDestBox *db;\n QString caption;\n\n switch( ui.destBox->currentIndex() )\n {\n case 0:\n db = new FileDestBox( this );\n caption = qtr( \"File\" );\n break;\n case 1:\n db = new HTTPDestBox( this );\n caption = qfu( \"HTTP\" );\n break;\n case 2:\n db = new MMSHDestBox( this );\n caption = qfu( \"WMSP\" );\n break;\n case 3:\n db = new RTPDestBox( this );\n caption = \"RTP\/TS\";\n break;\n case 4:\n db = new UDPDestBox( this );\n caption = \"UDP\";\n break;\n case 5:\n db = new ICEDestBox( this );\n caption = \"Icecast\";\n break;\n default:\n assert(0);\n }\n\n int index = ui.destTab->addTab( db, caption );\n CONNECT( db, mrlUpdated(), this, updateMRL() );\n ui.destTab->setCurrentIndex( index );\n updateMRL();\n}\n\nvoid SoutDialog::ok()\n{\n mrl = ui.mrlEdit->toPlainText();\n accept();\n}\n\nvoid SoutDialog::cancel()\n{\n mrl.clear();\n reject();\n}\n\nvoid SoutDialog::updateMRL()\n{\n QString qs_mux = ui.profileSelect->getMux();\n\n SoutMrl smrl( \":sout=#\" );\n if( !ui.profileSelect->getTranscode().isEmpty() && ui.transcodeBox->isChecked() )\n {\n smrl.begin( ui.profileSelect->getTranscode() );\n smrl.end();\n }\n\n bool multi = false;\n\n if( ui.destTab->count() >= 3 ||\n ( ui.destTab->count() == 2 && ui.localOutput->isChecked() ) )\n multi = true;\n\n if( multi )\n smrl.begin( \"duplicate\" );\n\n for( int i = 1; i < ui.destTab->count(); i++ )\n {\n VirtualDestBox *vdb = qobject_cast<VirtualDestBox *>(ui.destTab->widget( i ));\n QString tempMRL = vdb->getMRL( qs_mux );\n\n if( tempMRL.isEmpty() ) continue;\n if( multi )\n smrl.option( \"dst\", tempMRL );\n else\n {\n smrl.begin( tempMRL);\n smrl.end();\n }\n }\n if( ui.localOutput->isChecked() )\n {\n if( multi )\n smrl.option( \"dst\", \"display\" );\n else\n {\n smrl.begin( \"display\" );\n smrl.end();\n }\n }\n\n if ( multi ) smrl.end();\n\n mrl = smrl.getMrl();\n\n \/* FIXME, deal with SAP\n sout.b_sap = ui.sap->isChecked();\n sout.psz_group = strdup( qtu( ui.sapGroup->text() ) );\n sout.psz_name = strdup( qtu( ui.sapName->text() ) ); *\/\n\n if( ui.soutAll->isChecked() ) mrl.append( \" :sout-all\" );\n\n mrl.append( \" :sout-keep\" );\n\n ui.mrlEdit->setPlainText( mrl );\n}\n\n<|endoftext|>"} {"text":"<commit_before>#include \"Smartcar.h\"\n\nESCMotor::ESCMotor(unsigned short pin) {\n\t_pin = pin;\n\tsetFreqsAndSpeeds();\n\tsetAllowedSpeedLimits();\n}\n\nvoid ESCMotor::setFreqsAndSpeeds(){\n\tFULL_FORWARD = 50;\n FULL_BACKWARD = 80;\n\tIDLE_RAW_SPEED = 1500;\n\tMAX_FRONT_RAW_SPEED = 2000;\n\tMAX_BACK_RAW_SPEED = 1000;\n\t_speed = IDLE_RAW_SPEED;\n}\n\nvoid ESCMotor::init(){\n\tattach(_pin); \/\/attach the servo to its pin\n}\n\nvoid ESCMotor::setSpeed(int speed){ \/\/receives a speed in the scale of -100 to 100\n\t_speed = filterSpeed(speed); \/\/_speed now holds a value between MAX_BACK_ALLOWED_SPEED and MAX_FRONT_ALLOWED_SPEED\n\twriteMicroseconds(_speed); \/\/write the appropriate pwm signal to the servo\n}\n<commit_msg>Adjusting the values in the ESC motor so it makes more sense for the average use cases<commit_after>#include \"Smartcar.h\"\n\nESCMotor::ESCMotor(unsigned short pin) {\n\t_pin = pin;\n\tsetFreqsAndSpeeds();\n\tsetAllowedSpeedLimits();\n}\n\nvoid ESCMotor::setFreqsAndSpeeds(){\n\tFULL_FORWARD = 100;\n FULL_BACKWARD = 100;\n\tIDLE_RAW_SPEED = 1500;\n\tMAX_FRONT_RAW_SPEED = 1800;\n\tMAX_BACK_RAW_SPEED = 1200;\n\t_speed = IDLE_RAW_SPEED;\n}\n\nvoid ESCMotor::init(){\n\tattach(_pin); \/\/attach the servo to its pin\n}\n\nvoid ESCMotor::setSpeed(int speed){ \/\/receives a speed in the scale of -100 to 100\n\t_speed = filterSpeed(speed); \/\/_speed now holds a value between MAX_BACK_ALLOWED_SPEED and MAX_FRONT_ALLOWED_SPEED\n\twriteMicroseconds(_speed); \/\/write the appropriate pwm signal to the servo\n}\n<|endoftext|>"} {"text":"<commit_before>\/*\n Filename: EngineUI.cpp\n Purpose: Draws the EngineUI and console on top of rendering\n\n Part of Engine2D\n\n Copyright (C) 2014 Vbitz\n\n Licensed under the Apache License, Version 2.0 (the \"License\");\n you may not use this file except in compliance with the License.\n You may obtain a copy of the License at\n\n http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n\n Unless required by applicable law or agreed to in writing, software\n distributed under the License is distributed on an \"AS IS\" BASIS,\n WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n See the License for the specific language governing permissions and\n limitations under the License.\n*\/\n\n#include \"EngineUI.hpp\"\n\n#include \"FramePerfMonitor.hpp\"\n#include \"Config.hpp\"\n#include \"Profiler.hpp\"\n\nnamespace Engine {\n char getSpecialChars(int key) {\n switch (key) {\n case '[': return '{';\n case ']': return '}';\n case '-': return '_';\n case '=': return '+';\n case '\\\\': return '|';\n case '`': return '~';\n case '1': return '!';\n case '2': return '@';\n case '3': return '#';\n case '4': return '$';\n case '5': return '%';\n case '6': return '^';\n case '7': return '&';\n case '8': return '*';\n case '9': return '(';\n case '0': return ')';\n case ',': return '<';\n case '.': return '>';\n case ';': return ':';\n case '\\'': return '\"';\n case '\/': return '?';\n default: return key;\n }\n }\n \n EngineUI::EngineUI(Application* app) : _app(app) {\n this->_draw = new Draw2D(GetRenderGL());\n }\n \n void EngineUI::Draw() {\n if (!Config::GetBoolean(\"core.debug.engineUI\")) {\n return;\n }\n \n RenderGL3* renderGL = GetRenderGL();\n \n renderGL->ResetMatrix();\n \n if (!_showConsole) {\n renderGL->SetColor(25 \/ 255.0f, 25 \/ 255.0f, 25 \/ 255.0f);\n } else {\n renderGL->SetColor(40 \/ 255.0f, 40 \/ 255.0f, 40 \/ 255.0f, 0.95f);\n }\n \n this->_draw->Rect(0.0f, 0.0f, this->_app->GetScreenWidth(), _showConsole ? this->_app->GetScreenHeight() : 14);\n \n renderGL->SetFont(\"basic\", 10);\n if (!this->_showConsole) {\n renderGL->SetColor(220 \/ 255.0f, 220 \/ 255.0f, 220 \/ 255.0f);\n } else {\n renderGL->SetColor(1.0f, 1.0f, 1.0f);\n }\n \n if (Config::GetBoolean(\"core.debug.profiler\")) {\n double drawTime = Profiler::GetTime(\"Draw\");\n this->_lastDrawTimes[this->_currentLastDrawTimePos++] = drawTime;\n \n if (this->_currentLastDrawTimePos > 100) {\n this->_currentLastDrawTimePos = 0;\n }\n \n this->_ss.str(\"\");\n this->_ss.precision(4);\n this->_ss << \"FPS: \" << FramePerfMonitor::GetFPS();\n this->_ss << \" | DrawTime: \" << drawTime;\n renderGL->Print(this->_app->GetScreenWidth() - 220, 4, this->_ss.str().c_str());\n \n renderGL->DisableSmooth();\n \n this->_draw->LineGraph(this->_app->GetScreenWidth() - 430, 14, 2, 200, this->_lastDrawTimes, 100);\n \n renderGL->EnableSmooth();\n }\n \n renderGL->Print(10, 4, \"-- Engine2D --\");\n \n if (!_showConsole) {\n return;\n }\n \n std::vector<Logger::LogEvent>* logEvents = Logger::GetEvents();\n \n bool showVerbose = Config::GetBoolean(\"core.debug.engineUI.showVerboseLog\"); \/\/ pretty cheap\n \n int i = this->_app->GetScreenHeight() - 40;\n \n for (auto iterator = logEvents->rbegin(); iterator < logEvents->rend(); iterator++) {\n if (iterator->Hidden) {\n continue; \/\/ don't show it if it's hidden\n }\n \n if (iterator->Type == Logger::LogType_Text) {\n if (iterator->Level == Logger::LogLevel_Verbose && !showVerbose) {\n i -= 6; \/\/ add some padding to show that a message is there, just hidden\n renderGL->SetColor(80 \/ 255.0f, 80 \/ 255.0f, 80 \/ 255.0f);\n this->_draw->Rect(0, i + 2, this->_app->GetScreenWidth(), 2);\n } else {\n i -= 22;\n if (iterator->Level == Logger::LogLevel_Highlight) {\n renderGL->SetColor(200 \/ 255.0f, 200 \/ 255.0f, 200 \/ 255.0f, 0.9f);\n this->_draw->Rect(0, i + 1, this->_app->GetScreenWidth(), 20);\n } else {\n renderGL->SetColor(30 \/ 255.0f, 30 \/ 255.0f, 30 \/ 255.0f, 0.9f);\n this->_draw->Rect(60, i + 1, this->_app->GetScreenWidth() - 60, 20);\n }\n }\n }\n \n switch (iterator->Level) {\n case Logger::LogLevel_Verbose:\n renderGL->SetColor(205 \/ 255.0f, 205 \/ 255.0f, 205 \/ 255.0f);\n break;\n case Logger::LogLevel_User:\n renderGL->SetColor(255 \/ 255.0f, 0 \/ 255.0f, 255 \/ 255.0f);\n break;\n case Logger::LogLevel_ConsoleInput:\n renderGL->SetColor(0 \/ 255.0f, 191 \/ 255.0f, 255 \/ 255.0f);\n break;\n case Logger::LogLevel_Log:\n renderGL->SetColor(250 \/ 255.0f, 250 \/ 255.0f, 250 \/ 255.0f);\n break;\n case Logger::LogLevel_Warning:\n renderGL->SetColor(255 \/ 255.0f, 165 \/ 255.0f, 0 \/ 255.0f);\n break;\n case Logger::LogLevel_Error:\n renderGL->SetColor(178 \/ 255.0f, 34 \/ 255.0f, 34 \/ 255.0f);\n break;\n case Logger::LogLevel_Highlight:\n renderGL->SetColor(0.1f, 0.1f, 0.1f);\n break;\n case Logger::LogLevel_TestLog:\n renderGL->SetColor(250 \/ 255.0f, 250 \/ 255.0f, 250 \/ 255.0f);\n break;\n case Logger::LogLevel_TestError:\n renderGL->SetColor(178 \/ 255.0f, 34 \/ 255.0f, 34 \/ 255.0f);\n break;\n }\n \n std::string time = std::to_string(iterator->time);\n time.resize(6, '0');\n \n if (iterator->Level != Logger::LogLevel_Verbose || showVerbose) {\n renderGL->Print(5, i + 7, (time + \"s\").c_str());\n }\n \n if (iterator->Level != Logger::LogLevel_Verbose || showVerbose) {\n if (iterator->Type == Logger::LogType_Text) {\n renderGL->Print(65, i + 7, iterator->Event.c_str());\n } else if (iterator->Type == Logger::LogType_Graphical) {\n i -= (*iterator->GraphEvent)(65, i);\n }\n }\n \n if (i < 35) {\n break;\n }\n }\n \n renderGL->SetColor(0.0f, 0.0f, 0.0f, 0.85f);\n this->_draw->Rect(5, this->_app->GetScreenHeight() - 30, this->_app->GetScreenWidth() - 10, 25);\n \n renderGL->SetColor(1.0f, 1.0f, 1.0f);\n renderGL->SetFont(\"basic\", 12);\n renderGL->Print(10, this->_app->GetScreenHeight() - 22, (this->_currentConsoleInput.str() + \"_\").c_str());\n }\n \n#ifndef _PLATFORM_WIN32\n#define KEY_CONSOLE 161\n#else\n#define KEY_CONSOLE 96\n#endif\n\n void EngineUI::OnKeyPress(int key, int press, bool shift) {\n if (!Config::GetBoolean(\"core.debug.engineUI\")) {\n return;\n }\n \n if (key == KEY_CONSOLE && press == GLFW_PRESS) { \/\/ `\n this->ToggleConsole();\n } else if (key == GLFW_KEY_F10 && press == GLFW_PRESS) { \/\/ f10\n Events::Emit(\"dumpProfile\");\n }\n\n if (!_showConsole) {\n return;\n }\n\n if (key < 256 && (press == GLFW_PRESS || press == GLFW_REPEAT) && key != KEY_CONSOLE && key != GLFW_KEY_ENTER) {\n#ifndef _PLATFORM_WIN32\n this->_currentConsoleInput << (char) (shift ? getSpecialChars(key) : (char) std::tolower(key));\n#else\n currentConsoleInput << (char) (shift ? getSpecialChars(key) : tolower(key));\n#endif\n } else if (key == GLFW_KEY_BACKSPACE && (press == GLFW_PRESS || press == GLFW_REPEAT)) {\n std::string str = this->_currentConsoleInput.str();\n if (str.length() > 0) {\n str.resize(str.length() - 1);\n this->_currentConsoleInput.str(str);\n if (str.length() != 0) {\n this->_currentConsoleInput.seekp(str.length());\n }\n }\n } else if (key == GLFW_KEY_UP && press == GLFW_PRESS) {\n if (this->_currentHistoryLine > 0) {\n this->_currentHistoryLine--;\n this->_currentConsoleInput.str(this->_commandHistory[this->_currentHistoryLine]);\n if (this->_currentConsoleInput.str().length() != 0) {\n this->_currentConsoleInput.seekp(this->_currentConsoleInput.str().length());\n }\n }\n } else if (key == GLFW_KEY_DOWN && press == GLFW_PRESS) {\n if (this->_commandHistory.size() > 0 && this->_currentHistoryLine < this->_commandHistory.size() - 1) {\n this->_currentHistoryLine++;\n this->_currentConsoleInput.str(this->_commandHistory[this->_currentHistoryLine]);\n if (this->_currentConsoleInput.str().length() != 0) {\n this->_currentConsoleInput.seekp(this->_currentConsoleInput.str().length());\n }\n }\n } else if (key == GLFW_KEY_ENTER && press == GLFW_PRESS) {\n std::string command = this->_currentConsoleInput.str();\n this->_app->RunCommand(command);\n if (this->_commandHistory.size() == 0 || this->_commandHistory[this->_commandHistory.size() - 1] != command) {\n this->_commandHistory.push_back(command);\n }\n this->_currentHistoryLine = this->_commandHistory.size();\n this->_currentConsoleInput.str(\"\");\n }\n }\n \n void EngineUI::SetActive(bool active) {\n this->_active = active;\n }\n \n void EngineUI::ToggleConsole() {\n this->_showConsole = !this->_showConsole;\n }\n \n void EngineUI::ClearConsole() {\n Logger::HideAllEvents();\n }\n \n bool EngineUI::ConsoleActive() {\n return this->_showConsole;\n }\n}<commit_msg>EngineUI now fetches RenderGL from Application<commit_after>\/*\n Filename: EngineUI.cpp\n Purpose: Draws the EngineUI and console on top of rendering\n\n Part of Engine2D\n\n Copyright (C) 2014 Vbitz\n\n Licensed under the Apache License, Version 2.0 (the \"License\");\n you may not use this file except in compliance with the License.\n You may obtain a copy of the License at\n\n http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n\n Unless required by applicable law or agreed to in writing, software\n distributed under the License is distributed on an \"AS IS\" BASIS,\n WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n See the License for the specific language governing permissions and\n limitations under the License.\n*\/\n\n#include \"EngineUI.hpp\"\n\n#include \"FramePerfMonitor.hpp\"\n#include \"Config.hpp\"\n#include \"Profiler.hpp\"\n\nnamespace Engine {\n char getSpecialChars(int key) {\n switch (key) {\n case '[': return '{';\n case ']': return '}';\n case '-': return '_';\n case '=': return '+';\n case '\\\\': return '|';\n case '`': return '~';\n case '1': return '!';\n case '2': return '@';\n case '3': return '#';\n case '4': return '$';\n case '5': return '%';\n case '6': return '^';\n case '7': return '&';\n case '8': return '*';\n case '9': return '(';\n case '0': return ')';\n case ',': return '<';\n case '.': return '>';\n case ';': return ':';\n case '\\'': return '\"';\n case '\/': return '?';\n default: return key;\n }\n }\n \n EngineUI::EngineUI(Application* app) : _app(app) {\n this->_draw = new Draw2D(app->GetRender());\n }\n \n void EngineUI::Draw() {\n if (!Config::GetBoolean(\"core.debug.engineUI\")) {\n return;\n }\n \n RenderGL3* renderGL = this->_draw->GetRender();\n \n renderGL->ResetMatrix();\n \n if (!_showConsole) {\n renderGL->SetColor(25 \/ 255.0f, 25 \/ 255.0f, 25 \/ 255.0f);\n } else {\n renderGL->SetColor(40 \/ 255.0f, 40 \/ 255.0f, 40 \/ 255.0f, 0.95f);\n }\n \n this->_draw->Rect(0.0f, 0.0f, this->_app->GetScreenWidth(), _showConsole ? this->_app->GetScreenHeight() : 14);\n \n renderGL->SetFont(\"basic\", 10);\n if (!this->_showConsole) {\n renderGL->SetColor(220 \/ 255.0f, 220 \/ 255.0f, 220 \/ 255.0f);\n } else {\n renderGL->SetColor(1.0f, 1.0f, 1.0f);\n }\n \n if (Config::GetBoolean(\"core.debug.profiler\")) {\n double drawTime = Profiler::GetTime(\"Draw\");\n this->_lastDrawTimes[this->_currentLastDrawTimePos++] = drawTime;\n \n if (this->_currentLastDrawTimePos > 100) {\n this->_currentLastDrawTimePos = 0;\n }\n \n this->_ss.str(\"\");\n this->_ss.precision(4);\n this->_ss << \"FPS: \" << FramePerfMonitor::GetFPS();\n this->_ss << \" | DrawTime: \" << drawTime;\n renderGL->Print(this->_app->GetScreenWidth() - 220, 4, this->_ss.str().c_str());\n \n renderGL->DisableSmooth();\n \n this->_draw->LineGraph(this->_app->GetScreenWidth() - 430, 14, 2, 200, this->_lastDrawTimes, 100);\n \n renderGL->EnableSmooth();\n }\n \n renderGL->Print(10, 4, \"-- Engine2D --\");\n \n if (!_showConsole) {\n return;\n }\n \n std::vector<Logger::LogEvent>* logEvents = Logger::GetEvents();\n \n bool showVerbose = Config::GetBoolean(\"core.debug.engineUI.showVerboseLog\"); \/\/ pretty cheap\n \n int i = this->_app->GetScreenHeight() - 40;\n \n for (auto iterator = logEvents->rbegin(); iterator < logEvents->rend(); iterator++) {\n if (iterator->Hidden) {\n continue; \/\/ don't show it if it's hidden\n }\n \n if (iterator->Type == Logger::LogType_Text) {\n if (iterator->Level == Logger::LogLevel_Verbose && !showVerbose) {\n i -= 6; \/\/ add some padding to show that a message is there, just hidden\n renderGL->SetColor(80 \/ 255.0f, 80 \/ 255.0f, 80 \/ 255.0f);\n this->_draw->Rect(0, i + 2, this->_app->GetScreenWidth(), 2);\n } else {\n i -= 22;\n if (iterator->Level == Logger::LogLevel_Highlight) {\n renderGL->SetColor(200 \/ 255.0f, 200 \/ 255.0f, 200 \/ 255.0f, 0.9f);\n this->_draw->Rect(0, i + 1, this->_app->GetScreenWidth(), 20);\n } else {\n renderGL->SetColor(30 \/ 255.0f, 30 \/ 255.0f, 30 \/ 255.0f, 0.9f);\n this->_draw->Rect(60, i + 1, this->_app->GetScreenWidth() - 60, 20);\n }\n }\n }\n \n switch (iterator->Level) {\n case Logger::LogLevel_Verbose:\n renderGL->SetColor(205 \/ 255.0f, 205 \/ 255.0f, 205 \/ 255.0f);\n break;\n case Logger::LogLevel_User:\n renderGL->SetColor(255 \/ 255.0f, 0 \/ 255.0f, 255 \/ 255.0f);\n break;\n case Logger::LogLevel_ConsoleInput:\n renderGL->SetColor(0 \/ 255.0f, 191 \/ 255.0f, 255 \/ 255.0f);\n break;\n case Logger::LogLevel_Log:\n renderGL->SetColor(250 \/ 255.0f, 250 \/ 255.0f, 250 \/ 255.0f);\n break;\n case Logger::LogLevel_Warning:\n renderGL->SetColor(255 \/ 255.0f, 165 \/ 255.0f, 0 \/ 255.0f);\n break;\n case Logger::LogLevel_Error:\n renderGL->SetColor(178 \/ 255.0f, 34 \/ 255.0f, 34 \/ 255.0f);\n break;\n case Logger::LogLevel_Highlight:\n renderGL->SetColor(0.1f, 0.1f, 0.1f);\n break;\n case Logger::LogLevel_TestLog:\n renderGL->SetColor(250 \/ 255.0f, 250 \/ 255.0f, 250 \/ 255.0f);\n break;\n case Logger::LogLevel_TestError:\n renderGL->SetColor(178 \/ 255.0f, 34 \/ 255.0f, 34 \/ 255.0f);\n break;\n }\n \n std::string time = std::to_string(iterator->time);\n time.resize(6, '0');\n \n if (iterator->Level != Logger::LogLevel_Verbose || showVerbose) {\n renderGL->Print(5, i + 7, (time + \"s\").c_str());\n }\n \n if (iterator->Level != Logger::LogLevel_Verbose || showVerbose) {\n if (iterator->Type == Logger::LogType_Text) {\n renderGL->Print(65, i + 7, iterator->Event.c_str());\n } else if (iterator->Type == Logger::LogType_Graphical) {\n i -= (*iterator->GraphEvent)(65, i);\n }\n }\n \n if (i < 35) {\n break;\n }\n }\n \n renderGL->SetColor(0.0f, 0.0f, 0.0f, 0.85f);\n this->_draw->Rect(5, this->_app->GetScreenHeight() - 30, this->_app->GetScreenWidth() - 10, 25);\n \n renderGL->SetColor(1.0f, 1.0f, 1.0f);\n renderGL->SetFont(\"basic\", 12);\n renderGL->Print(10, this->_app->GetScreenHeight() - 22, (this->_currentConsoleInput.str() + \"_\").c_str());\n }\n \n#ifndef _PLATFORM_WIN32\n#define KEY_CONSOLE 161\n#else\n#define KEY_CONSOLE 96\n#endif\n\n void EngineUI::OnKeyPress(int key, int press, bool shift) {\n if (!Config::GetBoolean(\"core.debug.engineUI\")) {\n return;\n }\n \n if (key == KEY_CONSOLE && press == GLFW_PRESS) { \/\/ `\n this->ToggleConsole();\n } else if (key == GLFW_KEY_F10 && press == GLFW_PRESS) { \/\/ f10\n Events::Emit(\"dumpProfile\");\n }\n\n if (!_showConsole) {\n return;\n }\n\n if (key < 256 && (press == GLFW_PRESS || press == GLFW_REPEAT) && key != KEY_CONSOLE && key != GLFW_KEY_ENTER) {\n#ifndef _PLATFORM_WIN32\n this->_currentConsoleInput << (char) (shift ? getSpecialChars(key) : (char) std::tolower(key));\n#else\n currentConsoleInput << (char) (shift ? getSpecialChars(key) : tolower(key));\n#endif\n } else if (key == GLFW_KEY_BACKSPACE && (press == GLFW_PRESS || press == GLFW_REPEAT)) {\n std::string str = this->_currentConsoleInput.str();\n if (str.length() > 0) {\n str.resize(str.length() - 1);\n this->_currentConsoleInput.str(str);\n if (str.length() != 0) {\n this->_currentConsoleInput.seekp(str.length());\n }\n }\n } else if (key == GLFW_KEY_UP && press == GLFW_PRESS) {\n if (this->_currentHistoryLine > 0) {\n this->_currentHistoryLine--;\n this->_currentConsoleInput.str(this->_commandHistory[this->_currentHistoryLine]);\n if (this->_currentConsoleInput.str().length() != 0) {\n this->_currentConsoleInput.seekp(this->_currentConsoleInput.str().length());\n }\n }\n } else if (key == GLFW_KEY_DOWN && press == GLFW_PRESS) {\n if (this->_commandHistory.size() > 0 && this->_currentHistoryLine < this->_commandHistory.size() - 1) {\n this->_currentHistoryLine++;\n this->_currentConsoleInput.str(this->_commandHistory[this->_currentHistoryLine]);\n if (this->_currentConsoleInput.str().length() != 0) {\n this->_currentConsoleInput.seekp(this->_currentConsoleInput.str().length());\n }\n }\n } else if (key == GLFW_KEY_ENTER && press == GLFW_PRESS) {\n std::string command = this->_currentConsoleInput.str();\n this->_app->RunCommand(command);\n if (this->_commandHistory.size() == 0 || this->_commandHistory[this->_commandHistory.size() - 1] != command) {\n this->_commandHistory.push_back(command);\n }\n this->_currentHistoryLine = this->_commandHistory.size();\n this->_currentConsoleInput.str(\"\");\n }\n }\n \n void EngineUI::SetActive(bool active) {\n this->_active = active;\n }\n \n void EngineUI::ToggleConsole() {\n this->_showConsole = !this->_showConsole;\n }\n \n void EngineUI::ClearConsole() {\n Logger::HideAllEvents();\n }\n \n bool EngineUI::ConsoleActive() {\n return this->_showConsole;\n }\n}<|endoftext|>"} {"text":"<commit_before>\/\/ Font.cc\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\n#include \"StringUtil.hh\"\n#include \"stringstream.hh\"\n#include \"Font.hh\"\n#include \"FontImp.hh\"\n#include \"I18n.hh\"\n#include \"App.hh\"\n\n#ifdef HAVE_CONFIG_H\n#include \"config.h\"\n#endif \/\/ HAVE_CONFIG_H\n\n\/\/ for antialias \n#ifdef USE_XFT\n#include \"XftFontImp.hh\"\n#endif \/\/ USE_XFT\n\n\/\/ for multibyte support\n#ifdef USE_XMB\n#include \"XmbFontImp.hh\"\n#endif \/\/USE_XMB\n\n\/\/ standard font system\n#include \"XFontImp.hh\"\n\n#include \"GContext.hh\"\n\/\/use gnu extensions\n#ifndef _GNU_SOURCE\n#define _GNU_SOURCE\n#endif \/\/_GNU_SOURCE\n\n#ifndef __USE_GNU\n#define __USE_GNU\n#endif \/\/__USE_GNU\n\n#include <iostream> \n#ifdef HAVE_CSTRING\n #include <cstring>\n#else\n #include <string.h>\n#endif\n#ifdef HAVE_CSTDLIB\n #include <cstdlib>\n#else\n #include <stdlib.h>\n#endif\n#include <list>\n#include <map>\n#include <typeinfo>\n#include <langinfo.h>\n\n\n#ifdef HAVE_CSTDLIB\n #include <cstdlib>\n#else\n #include <stdlib.h>\n#endif\n\nusing namespace std;\n\n\nnamespace {\n\n#ifdef HAVE_SETLOCALE\n#include <locale.h>\n#endif \/\/HAVE_SETLOCALE\n\n#ifdef HAVE_ICONV\n\/**\n Recodes the text from one encoding to another\n assuming cd is correct\n @param cd the iconv type\n @param msg text to be converted\n @param len number of chars to convert\n @return the recoded string, or 0 on failure\n*\/\nchar* recode(iconv_t cd,\n const char *msg, size_t size) {\n\n \/\/ If empty message, yes this can happen, return\n if(strlen(msg) == 0 || size == 0) \n return 0;\n\n if(strlen(msg) < size)\n size = strlen(msg);\n \n size_t inbytesleft = size;\n size_t outbytesleft = 4*inbytesleft;\n char *new_msg = new char[outbytesleft];\n char *new_msg_ptr = new_msg;\n char *msg_ptr = strdup(msg);\n char *orig_msg_ptr = msg_ptr; \/\/ msg_ptr modified in iconv call\n size_t result = (size_t)(-1);\n\n#ifdef HAVE_CONST_ICONV \n result = iconv(cd, (const char**)(&msg_ptr), &inbytesleft, &new_msg, &outbytesleft);\n#else\n result = iconv(cd, &msg_ptr, &inbytesleft, &new_msg, &outbytesleft);\n#endif \/\/ HAVE_CONST_ICONV\n\n if (result == (size_t)(-1)) {\n \/\/ iconv can fail for three reasons\n \/\/ 1) Invalid multibyte sequence is encountered in the input\n \/\/ 2) An incomplete multibyte sequence \n \/\/ 3) The output buffer has no more room for the next converted character.\n \/\/ So we the delete new message and return original message\n delete[] new_msg_ptr;\n free(orig_msg_ptr);\n return 0;\n }\n free(orig_msg_ptr);\n\n *new_msg = '\\0';\n \n if(inbytesleft != 0) {\n delete[] new_msg_ptr;\n return 0;\n }\n\n return new_msg_ptr;\n}\n#else\n\nchar *recode(int cd,\n const char *msg, size_t size) {\n return 0;\n}\n#endif \/\/ HAVE_ICONV\n\n\/\/ use to map <font1>|<font2>|<font3> => <fontthatworks>\ntypedef std::map<std::string, std::string> StringMap;\ntypedef StringMap::iterator StringMapIt;\nStringMap lookup_map;\n\n\/\/ stores <fontthatworks and the fontimp\ntypedef std::map<std::string, FbTk::FontImp* > FontCache;\ntypedef FontCache::iterator FontCacheIt;\nFontCache font_cache;\n\n\nvoid resetEffects(FbTk::Font* font) {\n font->setHalo(false);\n font->setHaloColor(FbTk::Color(\"white\", DefaultScreen(FbTk::App::instance()->display())));\n font->setShadow(false);\n font->setShadowColor(FbTk::Color(\"black\", DefaultScreen(FbTk::App::instance()->display())));\n font->setShadowOffY(2);\n font->setShadowOffX(2);\n}\n\n}; \/\/ end nameless namespace\n\n\n\nnamespace FbTk {\n\nbool Font::s_multibyte = false; \nbool Font::s_utf8mode = false;\n\n\nvoid Font::init() {\n \/\/ must be set before the first XFontSet is created\n setlocale(LC_CTYPE, \"\");\n}\n\nvoid Font::shutdown() {\n\n FontCacheIt fit;\n for (fit = font_cache.begin(); fit != font_cache.end(); fit++) {\n FontImp* font = fit->second;\n if (font) {\n FontCacheIt it;\n for (it = fit; it != font_cache.end(); it++)\n if (it->second == font)\n it->second = 0;\n delete font;\n }\n }\n}\n\nFont::Font(const char *name):\n m_fontimp(0),\n m_rotated(false), \n m_shadow(false), m_shadow_color(\"black\", DefaultScreen(App::instance()->display())), \n m_shadow_offx(2), m_shadow_offy(2),\n m_halo(false), m_halo_color(\"white\", DefaultScreen(App::instance()->display())),\n#ifdef HAVE_ICONV\n m_iconv((iconv_t)(-1))\n#else\n m_iconv(-1)\n#endif \/\/ HAVE_ICONV\n{\n \/\/ MB_CUR_MAX returns the size of a char in the current locale\n if (MB_CUR_MAX > 1) \/\/ more than one byte, then we're multibyte\n s_multibyte = true;\n\n \/\/ check for utf-8 mode\n#ifdef CODESET\n char *locale_codeset = nl_langinfo(CODESET);\n#else \/\/ openbsd doesnt have this (yet?)\n char *locale_codeset = 0;\n#endif \/\/ CODESET\n\n if (locale_codeset && strcmp(\"UTF-8\", locale_codeset) == 0) {\n s_utf8mode = true;\n } else if (locale_codeset != 0) {\n \/\/ if locale isn't UTF-8 we try to\n \/\/ create a iconv pointer so we can\n \/\/ convert non utf-8 strings to utf-8\n\n#ifdef DEBUG\n cerr<<\"FbTk::Font: check UTF-8 convert for codeset = \"<<locale_codeset<<endl;\n#endif \/\/ DEBUG\n\n#ifdef HAVE_ICONV\n m_iconv = iconv_open(\"UTF-8\", locale_codeset);\n if(m_iconv == (iconv_t)(-1)) {\n cerr<<\"FbTk::Font: code error: from \"<<locale_codeset<<\" to: UTF-8\"<<endl;\n \/\/ if we failed with iconv then we can't convert\n \/\/ the strings to utf-8, so we disable utf8 mode\n s_utf8mode = false;\n } else {\n \/\/ success, we can now enable utf8mode \n \/\/ and if antialias is on later we can recode\n \/\/ the non utf-8 string to utf-8 and use utf-8 \n \/\/ drawing functions\n s_utf8mode = true;\n }\n#endif \/\/ HAVE_ICONV\n }\n\n#ifdef DEBUG\n cerr<<\"FbTk::Font m_iconv = \"<<(int)m_iconv<<endl;\n#endif \/\/ DEBUG\n\n if (name != 0) {\n load(name);\n }\n\n}\n\nFont::~Font() {\n#ifdef HAVE_ICONV\n if (m_iconv != (iconv_t)(-1))\n iconv_close(m_iconv);\n#endif \/\/ HAVE_ICONV\n}\n\nbool Font::load(const std::string &name) {\n\n if (name.size() == 0)\n return false;\n \n bool ret = false;\n StringMapIt lookup_entry;\n FontCacheIt cache_entry;\n\n \/\/ check if one of <font1>|<font2>|<font3> is already there\n if ((lookup_entry = lookup_map.find(name)) != lookup_map.end() &&\n (cache_entry = font_cache.find(lookup_entry->second)) != font_cache.end()) {\n m_fontstr = cache_entry->first;\n m_fontimp = cache_entry->second;\n resetEffects(this);\n return true;\n }\n \n \/\/ split up the namelist\n typedef std::list<std::string> StringList;\n typedef StringList::iterator StringListIt;\n StringList names;\n FbTk::StringUtil::stringtok<StringList>(names, name, \"|\");\n \n StringListIt name_it;\n for (name_it = names.begin(); name_it != names.end(); name_it++) {\n FbTk::StringUtil::removeTrailingWhitespace(*name_it);\n FbTk::StringUtil::removeFirstWhitespace(*name_it);\n\n if ((cache_entry = font_cache.find(*name_it)) != font_cache.end()) {\n m_fontstr = cache_entry->first;\n m_fontimp = cache_entry->second;\n lookup_map[name] = m_fontstr;\n resetEffects(this);\n return true;\n }\n\n FontImp* tmp_font(0);\n \n#ifdef USE_XFT\n if ((*name_it)[0] != '-')\n tmp_font = new XftFontImp(0, s_utf8mode);\n#endif \/\/ USE_XFT\n \n if (!tmp_font) {\n#ifdef USE_XMB\n if (s_multibyte || s_utf8mode)\n tmp_font = new XmbFontImp(0, s_utf8mode);\n else \/\/ basic font implementation\n#endif \/\/ USE_XMB\n tmp_font = new XFontImp();\n }\n\n if (tmp_font && tmp_font->load((*name_it).c_str())) {\n lookup_map[name] = (*name_it);\n m_fontimp = tmp_font;\n font_cache[(*name_it)] = tmp_font;\n m_fontstr = name;\n resetEffects(this);\n return true;\n }\n \n delete tmp_font;\n }\n\n return false;\n}\n\nunsigned int Font::textWidth(const char * const text, unsigned int size) const {\n#ifdef HAVE_ICONV\n if (m_fontimp->utf8() && m_iconv != (iconv_t)(-1)) {\n char* rtext = recode(m_iconv, text, size);\n if (rtext != 0)\n size = strlen(rtext);\n unsigned int r = m_fontimp->textWidth(rtext ? rtext : text, size);\n if (rtext != 0)\n delete[] rtext;\n return r;\n }\n#endif \/\/ HAVE_ICONV\n return m_fontimp->textWidth(text, size);\n}\n\nunsigned int Font::height() const {\n return m_fontimp->height();\n}\n\nint Font::ascent() const {\n return m_fontimp->ascent();\n}\n\nint Font::descent() const { \n return m_fontimp->descent();\n}\n\nvoid Font::drawText(const FbDrawable &w, int screen, GC gc,\n const char *text, size_t len, int x, int y, \n bool rotate) const {\n if (text == 0 || len == 0)\n return;\n\n char* rtext = 0;\n\n \/\/ so we don't end up in a loop with m_shadow\n static bool first_run = true; \n \n#ifdef HAVE_ICONV\n if (m_fontimp->utf8() && m_iconv != (iconv_t)(-1) && first_run) {\n rtext = recode(m_iconv, text, len);\n if (rtext != 0) {\n len = strlen(rtext);\n \/\/ ok, we can't use utf8 mode since the string is invalid\n }\n } \n#endif \/\/ HAVE_ICONV\n\n const char *real_text = rtext ? rtext : text;\n\n \/\/ draw \"effects\" first\n if (first_run) {\n if (m_shadow) {\n FbTk::GContext shadow_gc(w);\n shadow_gc.setForeground(m_shadow_color);\n first_run = false;\n drawText(w, screen, shadow_gc.gc(), real_text, len,\n x + m_shadow_offx, y + m_shadow_offy, rotate);\n first_run = true;\n } else if (m_halo) {\n FbTk::GContext halo_gc(w);\n halo_gc.setForeground(m_halo_color);\n first_run = false;\n drawText(w, screen, halo_gc.gc(), real_text, len, x + 1, y + 1, rotate);\n drawText(w, screen, halo_gc.gc(), real_text, len, x - 1, y + 1, rotate);\n drawText(w, screen, halo_gc.gc(), real_text, len, x - 1, y - 1, rotate);\n drawText(w, screen, halo_gc.gc(), real_text, len, x + 1, y - 1, rotate);\n first_run = true;\n }\n }\n\n if (!rotate && isRotated()) {\n \/\/ if this was called with request to not rotated the text\n \/\/ we just forward it to the implementation that handles rotation\n \/\/ currently just XFontImp\n \/\/ Using dynamic_cast just temporarly until there's a better solution \n \/\/ to put in FontImp\n try {\n XFontImp *font = dynamic_cast<XFontImp *>(m_fontimp);\n font->setRotate(false); \/\/ disable rotation temporarly\n\n font->drawText(w, screen, gc, real_text, len, x, y);\n font->setRotate(true); \/\/ enable rotation\n } catch (std::bad_cast &bc) {\n \/\/ draw normal...\n m_fontimp->drawText(w, screen, gc, real_text, len, x, y);\n }\n\n } else\n m_fontimp->drawText(w, screen, gc, real_text, len, x, y);\t\t\n\n if (rtext != 0)\n delete[] rtext;\n\n}\t\n\nvoid Font::rotate(float angle) {\n\/* TODO: reimplement rotated text\n#ifdef USE_XFT\n \/\/ if we are rotated and we are changing to horiz text \n \/\/ and we were antialiased before we rotated then change to XftFontImp\n if (isRotated() && angle == 0 && !m_xftfontstr.empty())\n m_fontimp.reset(new XftFontImp(m_fontstr.c_str(),s_utf8mode));\n#endif \/\/ USE_XFT\n \/\/ change to a font imp that handles rotated fonts (i.e just XFontImp at the moment)\n \/\/ if we're going to rotate this font\n if (angle != 0 && !isRotated()) {\n m_fontimp.reset(new XFontImp(m_fontstr.c_str()));\n if (!m_fontimp->loaded()) \/\/ if it failed to load font, try default font fixed\n m_fontimp->load(\"fixed\");\n }\n\n \/\/Note: only XFontImp implements FontImp::rotate\n m_fontimp->rotate(angle);\n\n m_rotated = (angle == 0 ? false : true);\n m_angle = angle;\n *\/\n}\n\n\n};\n\n<commit_msg>removed unused variable<commit_after>\/\/ Font.cc\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\n#include \"StringUtil.hh\"\n#include \"stringstream.hh\"\n#include \"Font.hh\"\n#include \"FontImp.hh\"\n#include \"I18n.hh\"\n#include \"App.hh\"\n\n#ifdef HAVE_CONFIG_H\n#include \"config.h\"\n#endif \/\/ HAVE_CONFIG_H\n\n\/\/ for antialias \n#ifdef USE_XFT\n#include \"XftFontImp.hh\"\n#endif \/\/ USE_XFT\n\n\/\/ for multibyte support\n#ifdef USE_XMB\n#include \"XmbFontImp.hh\"\n#endif \/\/USE_XMB\n\n\/\/ standard font system\n#include \"XFontImp.hh\"\n\n#include \"GContext.hh\"\n\/\/use gnu extensions\n#ifndef _GNU_SOURCE\n#define _GNU_SOURCE\n#endif \/\/_GNU_SOURCE\n\n#ifndef __USE_GNU\n#define __USE_GNU\n#endif \/\/__USE_GNU\n\n#include <iostream> \n#ifdef HAVE_CSTRING\n #include <cstring>\n#else\n #include <string.h>\n#endif\n#ifdef HAVE_CSTDLIB\n #include <cstdlib>\n#else\n #include <stdlib.h>\n#endif\n#include <list>\n#include <map>\n#include <typeinfo>\n#include <langinfo.h>\n\n\n#ifdef HAVE_CSTDLIB\n #include <cstdlib>\n#else\n #include <stdlib.h>\n#endif\n\nusing namespace std;\n\n\nnamespace {\n\n#ifdef HAVE_SETLOCALE\n#include <locale.h>\n#endif \/\/HAVE_SETLOCALE\n\n#ifdef HAVE_ICONV\n\/**\n Recodes the text from one encoding to another\n assuming cd is correct\n @param cd the iconv type\n @param msg text to be converted\n @param len number of chars to convert\n @return the recoded string, or 0 on failure\n*\/\nchar* recode(iconv_t cd,\n const char *msg, size_t size) {\n\n \/\/ If empty message, yes this can happen, return\n if(strlen(msg) == 0 || size == 0) \n return 0;\n\n if(strlen(msg) < size)\n size = strlen(msg);\n \n size_t inbytesleft = size;\n size_t outbytesleft = 4*inbytesleft;\n char *new_msg = new char[outbytesleft];\n char *new_msg_ptr = new_msg;\n char *msg_ptr = strdup(msg);\n char *orig_msg_ptr = msg_ptr; \/\/ msg_ptr modified in iconv call\n size_t result = (size_t)(-1);\n\n#ifdef HAVE_CONST_ICONV \n result = iconv(cd, (const char**)(&msg_ptr), &inbytesleft, &new_msg, &outbytesleft);\n#else\n result = iconv(cd, &msg_ptr, &inbytesleft, &new_msg, &outbytesleft);\n#endif \/\/ HAVE_CONST_ICONV\n\n if (result == (size_t)(-1)) {\n \/\/ iconv can fail for three reasons\n \/\/ 1) Invalid multibyte sequence is encountered in the input\n \/\/ 2) An incomplete multibyte sequence \n \/\/ 3) The output buffer has no more room for the next converted character.\n \/\/ So we the delete new message and return original message\n delete[] new_msg_ptr;\n free(orig_msg_ptr);\n return 0;\n }\n free(orig_msg_ptr);\n\n *new_msg = '\\0';\n \n if(inbytesleft != 0) {\n delete[] new_msg_ptr;\n return 0;\n }\n\n return new_msg_ptr;\n}\n#else\n\nchar *recode(int cd,\n const char *msg, size_t size) {\n return 0;\n}\n#endif \/\/ HAVE_ICONV\n\n\/\/ use to map <font1>|<font2>|<font3> => <fontthatworks>\ntypedef std::map<std::string, std::string> StringMap;\ntypedef StringMap::iterator StringMapIt;\nStringMap lookup_map;\n\n\/\/ stores <fontthatworks and the fontimp\ntypedef std::map<std::string, FbTk::FontImp* > FontCache;\ntypedef FontCache::iterator FontCacheIt;\nFontCache font_cache;\n\n\nvoid resetEffects(FbTk::Font* font) {\n font->setHalo(false);\n font->setHaloColor(FbTk::Color(\"white\", DefaultScreen(FbTk::App::instance()->display())));\n font->setShadow(false);\n font->setShadowColor(FbTk::Color(\"black\", DefaultScreen(FbTk::App::instance()->display())));\n font->setShadowOffY(2);\n font->setShadowOffX(2);\n}\n\n}; \/\/ end nameless namespace\n\n\n\nnamespace FbTk {\n\nbool Font::s_multibyte = false; \nbool Font::s_utf8mode = false;\n\n\nvoid Font::init() {\n \/\/ must be set before the first XFontSet is created\n setlocale(LC_CTYPE, \"\");\n}\n\nvoid Font::shutdown() {\n\n FontCacheIt fit;\n for (fit = font_cache.begin(); fit != font_cache.end(); fit++) {\n FontImp* font = fit->second;\n if (font) {\n FontCacheIt it;\n for (it = fit; it != font_cache.end(); it++)\n if (it->second == font)\n it->second = 0;\n delete font;\n }\n }\n}\n\nFont::Font(const char *name):\n m_fontimp(0),\n m_rotated(false), \n m_shadow(false), m_shadow_color(\"black\", DefaultScreen(App::instance()->display())), \n m_shadow_offx(2), m_shadow_offy(2),\n m_halo(false), m_halo_color(\"white\", DefaultScreen(App::instance()->display())),\n#ifdef HAVE_ICONV\n m_iconv((iconv_t)(-1))\n#else\n m_iconv(-1)\n#endif \/\/ HAVE_ICONV\n{\n \/\/ MB_CUR_MAX returns the size of a char in the current locale\n if (MB_CUR_MAX > 1) \/\/ more than one byte, then we're multibyte\n s_multibyte = true;\n\n \/\/ check for utf-8 mode\n#ifdef CODESET\n char *locale_codeset = nl_langinfo(CODESET);\n#else \/\/ openbsd doesnt have this (yet?)\n char *locale_codeset = 0;\n#endif \/\/ CODESET\n\n if (locale_codeset && strcmp(\"UTF-8\", locale_codeset) == 0) {\n s_utf8mode = true;\n } else if (locale_codeset != 0) {\n \/\/ if locale isn't UTF-8 we try to\n \/\/ create a iconv pointer so we can\n \/\/ convert non utf-8 strings to utf-8\n\n#ifdef DEBUG\n cerr<<\"FbTk::Font: check UTF-8 convert for codeset = \"<<locale_codeset<<endl;\n#endif \/\/ DEBUG\n\n#ifdef HAVE_ICONV\n m_iconv = iconv_open(\"UTF-8\", locale_codeset);\n if(m_iconv == (iconv_t)(-1)) {\n cerr<<\"FbTk::Font: code error: from \"<<locale_codeset<<\" to: UTF-8\"<<endl;\n \/\/ if we failed with iconv then we can't convert\n \/\/ the strings to utf-8, so we disable utf8 mode\n s_utf8mode = false;\n } else {\n \/\/ success, we can now enable utf8mode \n \/\/ and if antialias is on later we can recode\n \/\/ the non utf-8 string to utf-8 and use utf-8 \n \/\/ drawing functions\n s_utf8mode = true;\n }\n#endif \/\/ HAVE_ICONV\n }\n\n#ifdef DEBUG\n cerr<<\"FbTk::Font m_iconv = \"<<(int)m_iconv<<endl;\n#endif \/\/ DEBUG\n\n if (name != 0) {\n load(name);\n }\n\n}\n\nFont::~Font() {\n#ifdef HAVE_ICONV\n if (m_iconv != (iconv_t)(-1))\n iconv_close(m_iconv);\n#endif \/\/ HAVE_ICONV\n}\n\nbool Font::load(const std::string &name) {\n\n if (name.size() == 0)\n return false;\n \n StringMapIt lookup_entry;\n FontCacheIt cache_entry;\n\n \/\/ check if one of <font1>|<font2>|<font3> is already there\n if ((lookup_entry = lookup_map.find(name)) != lookup_map.end() &&\n (cache_entry = font_cache.find(lookup_entry->second)) != font_cache.end()) {\n m_fontstr = cache_entry->first;\n m_fontimp = cache_entry->second;\n resetEffects(this);\n return true;\n }\n \n \/\/ split up the namelist\n typedef std::list<std::string> StringList;\n typedef StringList::iterator StringListIt;\n StringList names;\n FbTk::StringUtil::stringtok<StringList>(names, name, \"|\");\n \n StringListIt name_it;\n for (name_it = names.begin(); name_it != names.end(); name_it++) {\n FbTk::StringUtil::removeTrailingWhitespace(*name_it);\n FbTk::StringUtil::removeFirstWhitespace(*name_it);\n\n if ((cache_entry = font_cache.find(*name_it)) != font_cache.end()) {\n m_fontstr = cache_entry->first;\n m_fontimp = cache_entry->second;\n lookup_map[name] = m_fontstr;\n resetEffects(this);\n return true;\n }\n\n FontImp* tmp_font(0);\n \n#ifdef USE_XFT\n if ((*name_it)[0] != '-')\n tmp_font = new XftFontImp(0, s_utf8mode);\n#endif \/\/ USE_XFT\n \n if (!tmp_font) {\n#ifdef USE_XMB\n if (s_multibyte || s_utf8mode)\n tmp_font = new XmbFontImp(0, s_utf8mode);\n else \/\/ basic font implementation\n#endif \/\/ USE_XMB\n tmp_font = new XFontImp();\n }\n\n if (tmp_font && tmp_font->load((*name_it).c_str())) {\n lookup_map[name] = (*name_it);\n m_fontimp = tmp_font;\n font_cache[(*name_it)] = tmp_font;\n m_fontstr = name;\n resetEffects(this);\n return true;\n }\n \n delete tmp_font;\n }\n\n return false;\n}\n\nunsigned int Font::textWidth(const char * const text, unsigned int size) const {\n#ifdef HAVE_ICONV\n if (m_fontimp->utf8() && m_iconv != (iconv_t)(-1)) {\n char* rtext = recode(m_iconv, text, size);\n if (rtext != 0)\n size = strlen(rtext);\n unsigned int r = m_fontimp->textWidth(rtext ? rtext : text, size);\n if (rtext != 0)\n delete[] rtext;\n return r;\n }\n#endif \/\/ HAVE_ICONV\n return m_fontimp->textWidth(text, size);\n}\n\nunsigned int Font::height() const {\n return m_fontimp->height();\n}\n\nint Font::ascent() const {\n return m_fontimp->ascent();\n}\n\nint Font::descent() const { \n return m_fontimp->descent();\n}\n\nvoid Font::drawText(const FbDrawable &w, int screen, GC gc,\n const char *text, size_t len, int x, int y, \n bool rotate) const {\n if (text == 0 || len == 0)\n return;\n\n char* rtext = 0;\n\n \/\/ so we don't end up in a loop with m_shadow\n static bool first_run = true; \n \n#ifdef HAVE_ICONV\n if (m_fontimp->utf8() && m_iconv != (iconv_t)(-1) && first_run) {\n rtext = recode(m_iconv, text, len);\n if (rtext != 0) {\n len = strlen(rtext);\n \/\/ ok, we can't use utf8 mode since the string is invalid\n }\n } \n#endif \/\/ HAVE_ICONV\n\n const char *real_text = rtext ? rtext : text;\n\n \/\/ draw \"effects\" first\n if (first_run) {\n if (m_shadow) {\n FbTk::GContext shadow_gc(w);\n shadow_gc.setForeground(m_shadow_color);\n first_run = false;\n drawText(w, screen, shadow_gc.gc(), real_text, len,\n x + m_shadow_offx, y + m_shadow_offy, rotate);\n first_run = true;\n } else if (m_halo) {\n FbTk::GContext halo_gc(w);\n halo_gc.setForeground(m_halo_color);\n first_run = false;\n drawText(w, screen, halo_gc.gc(), real_text, len, x + 1, y + 1, rotate);\n drawText(w, screen, halo_gc.gc(), real_text, len, x - 1, y + 1, rotate);\n drawText(w, screen, halo_gc.gc(), real_text, len, x - 1, y - 1, rotate);\n drawText(w, screen, halo_gc.gc(), real_text, len, x + 1, y - 1, rotate);\n first_run = true;\n }\n }\n\n if (!rotate && isRotated()) {\n \/\/ if this was called with request to not rotated the text\n \/\/ we just forward it to the implementation that handles rotation\n \/\/ currently just XFontImp\n \/\/ Using dynamic_cast just temporarly until there's a better solution \n \/\/ to put in FontImp\n try {\n XFontImp *font = dynamic_cast<XFontImp *>(m_fontimp);\n font->setRotate(false); \/\/ disable rotation temporarly\n\n font->drawText(w, screen, gc, real_text, len, x, y);\n font->setRotate(true); \/\/ enable rotation\n } catch (std::bad_cast &bc) {\n \/\/ draw normal...\n m_fontimp->drawText(w, screen, gc, real_text, len, x, y);\n }\n\n } else\n m_fontimp->drawText(w, screen, gc, real_text, len, x, y);\t\t\n\n if (rtext != 0)\n delete[] rtext;\n\n}\t\n\nvoid Font::rotate(float angle) {\n\/* TODO: reimplement rotated text\n#ifdef USE_XFT\n \/\/ if we are rotated and we are changing to horiz text \n \/\/ and we were antialiased before we rotated then change to XftFontImp\n if (isRotated() && angle == 0 && !m_xftfontstr.empty())\n m_fontimp.reset(new XftFontImp(m_fontstr.c_str(),s_utf8mode));\n#endif \/\/ USE_XFT\n \/\/ change to a font imp that handles rotated fonts (i.e just XFontImp at the moment)\n \/\/ if we're going to rotate this font\n if (angle != 0 && !isRotated()) {\n m_fontimp.reset(new XFontImp(m_fontstr.c_str()));\n if (!m_fontimp->loaded()) \/\/ if it failed to load font, try default font fixed\n m_fontimp->load(\"fixed\");\n }\n\n \/\/Note: only XFontImp implements FontImp::rotate\n m_fontimp->rotate(angle);\n\n m_rotated = (angle == 0 ? false : true);\n m_angle = angle;\n *\/\n}\n\n\n};\n\n<|endoftext|>"} {"text":"<commit_before>\n#include <cstring>\n#include <algorithm>\n\n#include \"Furigana.h\"\n#include \"Utf8.h\"\n\nstd::unordered_map<uint32_t, uint32_t> Furigana::KataToHiraTable;\n\nconst char Furigana::katakanas[][4] = {\n \"ァ\",\"ア\",\"ィ\",\"イ\",\"ゥ\",\"ウ\",\"ェ\",\"エ\",\"ォ\",\"オ\",\n \"カ\",\"ガ\",\"キ\",\"ギ\",\"ク\",\"グ\",\"ケ\",\"ゲ\",\"コ\",\"ゴ\",\n \"サ\",\"ザ\",\"シ\",\"ジ\",\"ス\",\"ズ\",\"セ\",\"ゼ\",\"ソ\",\"ゾ\",\n \"タ\",\"ダ\",\"チ\",\"ヂ\",\"ッ\",\"ツ\",\"ヅ\",\"テ\",\"デ\",\"ト\",\n \"ド\",\"ナ\",\"ニ\",\"ヌ\",\"ネ\",\"ノ\",\"ハ\",\"バ\",\"パ\",\"ヒ\",\n \"ビ\",\"ピ\",\"フ\",\"ブ\",\"プ\",\"ヘ\",\"ベ\",\"ペ\",\"ホ\",\"ボ\",\n \"ポ\",\"マ\",\"ミ\",\"ム\",\"メ\",\"モ\",\"ャ\",\"ヤ\",\"ュ\",\"ユ\",\n \"ョ\",\"ヨ\",\"ラ\",\"リ\",\"ル\",\"レ\",\"ロ\",\"ヮ\",\"ワ\",\"ヲ\",\n \"ン\",\"ヴ\",\"ヵ\",\"ヶ\"\n};\n\nconst char Furigana::hiraganas[][4] = {\n \"ぁ\",\"あ\",\"ぃ\",\"い\",\"ぅ\",\"う\",\"ぇ\",\"え\",\"ぉ\",\"お\",\n \"か\",\"が\",\"き\",\"ぎ\",\"く\",\"ぐ\",\"け\",\"げ\",\"こ\",\"ご\",\n \"さ\",\"ざ\",\"し\",\"じ\",\"す\",\"ず\",\"せ\",\"ぜ\",\"そ\",\"ぞ\",\n \"た\",\"だ\",\"ち\",\"ぢ\",\"っ\",\"つ\",\"づ\",\"て\",\"で\",\"と\",\n \"ど\",\"な\",\"に\",\"ぬ\",\"ね\",\"の\",\"は\",\"ば\",\"ぱ\",\"ひ\",\n \"び\",\"ぴ\",\"ふ\",\"ぶ\",\"ぷ\",\"へ\",\"べ\",\"ぺ\",\"ほ\",\"ぼ\",\n \"ぽ\",\"ま\",\"み\",\"む\",\"め\",\"も\",\"ゃ\",\"や\",\"ゅ\",\"ゆ\",\n \"ょ\",\"よ\",\"ら\",\"り\",\"る\",\"れ\",\"ろ\",\"ゎ\",\"わ\",\"を\",\n \"ん\",\"ゔ\",\"ゕ\",\"ゖ\"\n};\n\nFurigana::Furigana() {\n \/* Initialize the katakana to hiragana hash table. *\/\n static size_t numKanas = sizeof(Furigana::katakanas)\/sizeof(Furigana::katakanas[0]);\n for (int i = 0; i < numKanas; i++) {\n uint32_t katakana = *(uint32_t*)Furigana::katakanas[i];\n uint32_t hiragana = *(uint32_t*)Furigana::hiraganas[i];\n Furigana::KataToHiraTable.insert(std::make_pair(katakana, hiragana));\n }\n}\n\n\/**\n * Return the given string with katakanas converted\n * to their hiragana equivalents.\n *\/\nstd::string Furigana::katakana_to_hiragana(std::string katakana)\n{\n const char *str = katakana.c_str();\n char character[5] = { '\\0' }; \/* 4 UTF-8 bytes + '\\0' = 5 *\/\n std::string hiraganas;\n\n while (utf8_getc(&str, character, sizeof(character)-1)) {\n auto res = Furigana::KataToHiraTable.find(*(uint32_t*)character);\n if (res != Furigana::KataToHiraTable.end()) {\n std::memcpy(character, &res->second, sizeof(character)-1);\n }\n\n hiraganas.append(character, std::strlen(character));\n }\n\n return hiraganas;\n}\n\nstatic inline void remove_spaces(std::string &str)\n{\n str.erase(\n std::remove_if(\n str.begin(),\n str.end(),\n (int(*)(int))std::isspace),\n str.end()\n );\n}\n\n\/**\n * Given two strings, check if they start with the same characters. If so,\n * return the length (in bytes) of equal part, or zero otherwise.\n * Return zero if the strings are equal.\n *\/\nstatic size_t find_initial_equal_chars(char *kanjis_start, char *reading_start)\n{\n const char *kanjis = (const char*) kanjis_start;\n const char *reading = (const char*) reading_start;\n const char *kanjis_prev;\n char kanji_char[5] = { '\\0' }; \/* 4 UTF-8 bytes + '\\0' = 5 *\/\n char kana_char[5] = { '\\0' }; \/* 4 UTF-8 bytes + '\\0' = 5 *\/\n\n if (strcmp(kanjis, reading) == 0) {\n return 0;\n }\n\n while (true) {\n kanjis_prev = kanjis;\n int more_kanjis = utf8_getc(&kanjis, kanji_char, sizeof(kanji_char)-1);\n int more_reading = utf8_getc(&reading, kana_char, sizeof(kana_char)-1);\n if (!more_kanjis || !more_reading ||\n strncmp(kanji_char, kana_char, sizeof(kanji_char)) != 0) {\n break;\n }\n }\n return kanjis_prev - kanjis_start;\n}\n\n\/**\n * Find how much we should trim the given reading and kanji strings.\n * Returns the length of head and tail to trim.\n *\/\nstatic void find_trim_boundaries(\n std::string kanjis_std,\n std::string reading_std,\n size_t *start_len,\n size_t *end_len\n) {\n char *kanjis = strdup(kanjis_std.c_str());\n char *reading = strdup(reading_std.c_str());\n\n *start_len = find_initial_equal_chars(kanjis, reading);\n utf8_strrev(kanjis);\n utf8_strrev(reading);\n *end_len = find_initial_equal_chars(kanjis, reading);\n free(kanjis);\n free(reading);\n}\n\n\/**\n * Split the given strings into one, two, or three parts, giving the\n * provided head and tail length.\n *\/\nstatic std::vector<std::pair<std::string, std::string> > split_furigana(\n std::string kanjisString,\n std::string readingString,\n int start_len,\n int end_len\n) {\n std::vector<std::pair<std::string, std::string> > tokens;\n tokens.push_back(std::pair<std::string, std::string>(\n kanjisString.substr(\n start_len, kanjisString.length() - end_len - start_len\n ),\n readingString.substr(\n start_len, readingString.length() - end_len - start_len\n )\n ));\n if (start_len > 0) {\n tokens.insert(\n tokens.begin(),\n std::pair<std::string, std::string>(\n kanjisString.substr(0, start_len),\n readingString.substr(0, start_len)\n )\n );\n }\n if (end_len > 0) {\n tokens.push_back(std::pair<std::string, std::string>(\n kanjisString.substr(kanjisString.length() - end_len),\n readingString.substr(readingString.length() - end_len)\n ));\n }\n return tokens;\n}\n\n\/**\n * Removes useless furiganas at the beginning and at the end.\n *\/\nstd::vector<std::pair<std::string, std::string> > Furigana::tokenize(\n std::string kanjisString,\n std::string readingString\n) {\n size_t start_len, end_len;\n\n remove_spaces(readingString);\n readingString = this->katakana_to_hiragana(readingString);\n find_trim_boundaries(\n this->katakana_to_hiragana(kanjisString),\n readingString,\n &start_len,\n &end_len\n );\n\n auto tokens = split_furigana(\n kanjisString,\n readingString,\n start_len,\n end_len\n );\n\n for (auto& text : tokens) {\n if (this->katakana_to_hiragana(text.first) == text.second) {\n text.second = \"\";\n }\n }\n\n return tokens;\n}\n<commit_msg>Split furigana on markers and remove trimming<commit_after>\n#include <cstring>\n#include <algorithm>\n\n#include \"Furigana.h\"\n#include \"Utf8.h\"\n\n#define WARIFURI_SEPARATOR '.'\n\nstd::unordered_map<uint32_t, uint32_t> Furigana::KataToHiraTable;\n\nconst char Furigana::katakanas[][4] = {\n \"ァ\",\"ア\",\"ィ\",\"イ\",\"ゥ\",\"ウ\",\"ェ\",\"エ\",\"ォ\",\"オ\",\n \"カ\",\"ガ\",\"キ\",\"ギ\",\"ク\",\"グ\",\"ケ\",\"ゲ\",\"コ\",\"ゴ\",\n \"サ\",\"ザ\",\"シ\",\"ジ\",\"ス\",\"ズ\",\"セ\",\"ゼ\",\"ソ\",\"ゾ\",\n \"タ\",\"ダ\",\"チ\",\"ヂ\",\"ッ\",\"ツ\",\"ヅ\",\"テ\",\"デ\",\"ト\",\n \"ド\",\"ナ\",\"ニ\",\"ヌ\",\"ネ\",\"ノ\",\"ハ\",\"バ\",\"パ\",\"ヒ\",\n \"ビ\",\"ピ\",\"フ\",\"ブ\",\"プ\",\"ヘ\",\"ベ\",\"ペ\",\"ホ\",\"ボ\",\n \"ポ\",\"マ\",\"ミ\",\"ム\",\"メ\",\"モ\",\"ャ\",\"ヤ\",\"ュ\",\"ユ\",\n \"ョ\",\"ヨ\",\"ラ\",\"リ\",\"ル\",\"レ\",\"ロ\",\"ヮ\",\"ワ\",\"ヲ\",\n \"ン\",\"ヴ\",\"ヵ\",\"ヶ\"\n};\n\nconst char Furigana::hiraganas[][4] = {\n \"ぁ\",\"あ\",\"ぃ\",\"い\",\"ぅ\",\"う\",\"ぇ\",\"え\",\"ぉ\",\"お\",\n \"か\",\"が\",\"き\",\"ぎ\",\"く\",\"ぐ\",\"け\",\"げ\",\"こ\",\"ご\",\n \"さ\",\"ざ\",\"し\",\"じ\",\"す\",\"ず\",\"せ\",\"ぜ\",\"そ\",\"ぞ\",\n \"た\",\"だ\",\"ち\",\"ぢ\",\"っ\",\"つ\",\"づ\",\"て\",\"で\",\"と\",\n \"ど\",\"な\",\"に\",\"ぬ\",\"ね\",\"の\",\"は\",\"ば\",\"ぱ\",\"ひ\",\n \"び\",\"ぴ\",\"ふ\",\"ぶ\",\"ぷ\",\"へ\",\"べ\",\"ぺ\",\"ほ\",\"ぼ\",\n \"ぽ\",\"ま\",\"み\",\"む\",\"め\",\"も\",\"ゃ\",\"や\",\"ゅ\",\"ゆ\",\n \"ょ\",\"よ\",\"ら\",\"り\",\"る\",\"れ\",\"ろ\",\"ゎ\",\"わ\",\"を\",\n \"ん\",\"ゔ\",\"ゕ\",\"ゖ\"\n};\n\nFurigana::Furigana() {\n \/* Initialize the katakana to hiragana hash table. *\/\n static size_t numKanas = sizeof(Furigana::katakanas)\/sizeof(Furigana::katakanas[0]);\n for (int i = 0; i < numKanas; i++) {\n uint32_t katakana = *(uint32_t*)Furigana::katakanas[i];\n uint32_t hiragana = *(uint32_t*)Furigana::hiraganas[i];\n Furigana::KataToHiraTable.insert(std::make_pair(katakana, hiragana));\n }\n}\n\n\/**\n * Return the given string with katakanas converted\n * to their hiragana equivalents.\n *\/\nstd::string Furigana::katakana_to_hiragana(std::string katakana)\n{\n const char *str = katakana.c_str();\n char character[5] = { '\\0' }; \/* 4 UTF-8 bytes + '\\0' = 5 *\/\n std::string hiraganas;\n\n while (utf8_getc(&str, character, sizeof(character)-1)) {\n auto res = Furigana::KataToHiraTable.find(*(uint32_t*)character);\n if (res != Furigana::KataToHiraTable.end()) {\n std::memcpy(character, &res->second, sizeof(character)-1);\n }\n\n hiraganas.append(character, std::strlen(character));\n }\n\n return hiraganas;\n}\n\nstatic inline void remove_spaces(std::string &str)\n{\n str.erase(\n std::remove_if(\n str.begin(),\n str.end(),\n (int(*)(int))std::isspace),\n str.end()\n );\n}\n\n\/**\n * Given two strings, check if they start with the same characters. If so,\n * return the length (in bytes) of equal part, or zero otherwise.\n * Return zero if the strings are equal.\n *\/\nstatic size_t find_initial_equal_chars(char *kanjis_start, char *reading_start)\n{\n const char *kanjis = (const char*) kanjis_start;\n const char *reading = (const char*) reading_start;\n const char *kanjis_prev;\n char kanji_char[5] = { '\\0' }; \/* 4 UTF-8 bytes + '\\0' = 5 *\/\n char kana_char[5] = { '\\0' }; \/* 4 UTF-8 bytes + '\\0' = 5 *\/\n\n if (strcmp(kanjis, reading) == 0) {\n return 0;\n }\n\n while (true) {\n kanjis_prev = kanjis;\n int more_kanjis = utf8_getc(&kanjis, kanji_char, sizeof(kanji_char)-1);\n int more_reading = utf8_getc(&reading, kana_char, sizeof(kana_char)-1);\n if (!more_kanjis || !more_reading ||\n strncmp(kanji_char, kana_char, sizeof(kanji_char)) != 0) {\n break;\n }\n }\n return kanjis_prev - kanjis_start;\n}\n\n\/**\n * Split the given string into one or more parts,\n * giving the provided separator character.\n * Each token in readingString matches one char of kanjisString.\n * Several consecutive separator characters means the token\n * spans on multiple chars of kanjisString.\n *\/\nstatic std::vector<std::pair<std::string, std::string> > split_furigana(\n std::string kanjisString,\n std::string readingString,\n const char separator\n) {\n std::vector<std::pair<std::string, std::string> > tokens;\n const char *kanjis = kanjisString.c_str();\n std::size_t reading_start = 0, reading_end = 0;\n char kanji_char[5] = { '\\0' }; \/* 4 UTF-8 bytes + '\\0' = 5 *\/\n\n while (true) {\n int more_kanjis = utf8_getc(&kanjis, kanji_char, sizeof(kanji_char)-1);\n std::string kanji_chars(kanji_char);\n reading_end = readingString.find(separator, reading_start);\n std::string reading_chars\n = readingString.substr(reading_start, reading_end - reading_start);\n\n \/* Consecutive separators: the reading spans on the previous kanji *\/\n if (reading_start == reading_end) {\n kanji_chars = tokens.back().first + kanji_chars;\n reading_chars = tokens.back().second;\n tokens.pop_back();\n }\n\n \/* Stuff the remaining kanjis if we reached the end of the readings *\/\n if (reading_end == std::string::npos && more_kanjis) {\n while (more_kanjis = utf8_getc(&kanjis, kanji_char,\n sizeof(kanji_char)-1)) {\n kanji_chars += kanji_char;\n }\n }\n\n tokens.push_back(std::pair<std::string, std::string>(\n kanji_chars,\n reading_chars\n ));\n if (!more_kanjis || reading_end == std::string::npos) {\n break;\n }\n reading_start = reading_end + 1;\n }\n return tokens;\n}\n\n\/**\n * Removes useless furiganas at the beginning and at the end.\n *\/\nstd::vector<std::pair<std::string, std::string> > Furigana::tokenize(\n std::string kanjisString,\n std::string readingString\n) {\n size_t start_len, end_len;\n\n remove_spaces(readingString);\n readingString = this->katakana_to_hiragana(readingString);\n\n auto tokens = split_furigana(\n kanjisString,\n readingString,\n WARIFURI_SEPARATOR\n );\n\n for (auto& text : tokens) {\n if (this->katakana_to_hiragana(text.first) == text.second) {\n text.second = \"\";\n }\n }\n\n return tokens;\n}\n<|endoftext|>"} {"text":"<commit_before>#include \"Geometry.h\"\n\n#include <math.h>\n\n#include \"Logger.h\"\n\n\/*static*\/ std::unique_ptr<Geometry>\nGeometry::Sphere(int sectors, int rings, float radius, bool genNormals, bool genTangents, bool genTexCoords)\n{\n\tif (genTangents)\n\t{\n\t\tLogger::Log(\"Error: tried to generate a sphere with tangents, which is not implemented! Ignoring instruction.\");\n\n\t\tif (!(genNormals && genTexCoords))\n\t\t{\n\t\t\tLogger::Log(\"Error: tried to generate a sphere with tangents but without tex-coords and normals, which is not possible!\");\n\t\t\treturn nullptr;\n\t\t}\n\t}\n\n\tstd::unique_ptr<Geometry> sphere{ new Geometry() };\n\n\tsphere->positions.resize(rings * sectors * 3);\n\tif (genNormals) sphere->normals.resize(rings * sectors * 3);\n\tif (genTangents) sphere->tangents.resize(rings * sectors * 3);\n\tif (genTexCoords) sphere->texCoords.resize(rings * sectors * 2);\n\n\tauto p = sphere->positions.begin();\n\tauto n = sphere->normals.begin();\n\tauto t = sphere->tangents.begin();\n\tauto tex = sphere->texCoords.begin();\n\n\tfloat const R = 1.0f \/ (float)(rings-1);\n\tfloat const S = 1.0f \/ (float)(sectors-1);\n\n\tfor(int r = 0; r < rings; r++)\n\t{\n\t\tfor(int s = 0; s < sectors; s++)\n\t\t{\n\t\t\tconst float y = sinf( -M_PI_2 + M_PI * r * R );\n\t\t\tconst float x = cosf(2*M_PI * s * S) * sin( M_PI * r * R );\n\t\t\tconst float z = sinf(2*M_PI * s * S) * sin( M_PI * r * R );\n\n\t\t\t*p++ = x * radius;\n\t\t\t*p++ = y * radius;\n\t\t\t*p++ = z * radius;\n\n\t\t\tif (genNormals)\n\t\t\t{\n\t\t\t\t*n++ = x;\n\t\t\t\t*n++ = y;\n\t\t\t\t*n++ = z;\n\t\t\t}\n\n\t\t\tif (genTangents)\n\t\t\t{\n\t\t\t\t\/\/ TODO: Implement!\n\t\t\t\t*t++ = 0.0f;\n\t\t\t\t*t++ = 0.0f;\n\t\t\t\t*t++ = 0.0f;\n\t\t\t}\n\n\t\t\tif (genTexCoords)\n\t\t\t{\n\t\t\t\t*tex++ = s * S;\n\t\t\t\t*tex++ = r * R;\n\t\t\t}\n\t\t}\n\t}\n\n\tsphere->indices.resize(rings * sectors * 6); \/\/ resize for triangles\n\tstd::vector<unsigned int>::iterator i = sphere->indices.begin();\n\tfor(int r = 0; r < rings - 1; ++r)\n\t{\n\t\tfor(int s = 0; s < sectors - 1; ++s)\n\t\t{\n\t\t\tconst int i0 = r * sectors + s;\n\t\t\tconst int i1 = r * sectors + (s + 1);\n\t\t\tconst int i2 = (r + 1) * sectors + (s + 1);\n\t\t\tconst int i3 = (r + 1) * sectors + s;\n\n\t\t\t\/\/ Triangles\n\t\t\t*i++ = i0;\n\t\t\t*i++ = i1;\n\t\t\t*i++ = i2;\n\n\t\t\t*i++ = i0;\n\t\t\t*i++ = i2;\n\t\t\t*i++ = i3;\n\n\n\t\t\t\/\/ Quads\n\t\t\t\/\/*i++ = i0;\n\t\t\t\/\/*i++ = i1;\n\t\t\t\/\/*i++ = i2;\n\t\t\t\/\/*i++ = i3;\n\t\t}\n\t}\n\n\treturn sphere;\n}\n<commit_msg>Fix winding order for generated sphere geometry<commit_after>#include \"Geometry.h\"\n\n#include <math.h>\n\n#include \"Logger.h\"\n\n\/*static*\/ std::unique_ptr<Geometry>\nGeometry::Sphere(int sectors, int rings, float radius, bool genNormals, bool genTangents, bool genTexCoords)\n{\n\tif (genTangents)\n\t{\n\t\tLogger::Log(\"Error: tried to generate a sphere with tangents, which is not implemented! Ignoring instruction.\");\n\n\t\tif (!(genNormals && genTexCoords))\n\t\t{\n\t\t\tLogger::Log(\"Error: tried to generate a sphere with tangents but without tex-coords and normals, which is not possible!\");\n\t\t\treturn nullptr;\n\t\t}\n\t}\n\n\tstd::unique_ptr<Geometry> sphere{ new Geometry() };\n\n\tsphere->positions.resize(rings * sectors * 3);\n\tif (genNormals) sphere->normals.resize(rings * sectors * 3);\n\tif (genTangents) sphere->tangents.resize(rings * sectors * 3);\n\tif (genTexCoords) sphere->texCoords.resize(rings * sectors * 2);\n\n\tauto p = sphere->positions.begin();\n\tauto n = sphere->normals.begin();\n\tauto t = sphere->tangents.begin();\n\tauto tex = sphere->texCoords.begin();\n\n\tfloat const R = 1.0f \/ (float)(rings-1);\n\tfloat const S = 1.0f \/ (float)(sectors-1);\n\n\tfor(int r = 0; r < rings; r++)\n\t{\n\t\tfor(int s = 0; s < sectors; s++)\n\t\t{\n\t\t\tconst float y = sinf( -M_PI_2 + M_PI * r * R );\n\t\t\tconst float x = cosf(2*M_PI * s * S) * sin( M_PI * r * R );\n\t\t\tconst float z = sinf(2*M_PI * s * S) * sin( M_PI * r * R );\n\n\t\t\t*p++ = x * radius;\n\t\t\t*p++ = y * radius;\n\t\t\t*p++ = z * radius;\n\n\t\t\tif (genNormals)\n\t\t\t{\n\t\t\t\t*n++ = x;\n\t\t\t\t*n++ = y;\n\t\t\t\t*n++ = z;\n\t\t\t}\n\n\t\t\tif (genTangents)\n\t\t\t{\n\t\t\t\t\/\/ TODO: Implement!\n\t\t\t\t*t++ = 0.0f;\n\t\t\t\t*t++ = 0.0f;\n\t\t\t\t*t++ = 0.0f;\n\t\t\t}\n\n\t\t\tif (genTexCoords)\n\t\t\t{\n\t\t\t\t*tex++ = s * S;\n\t\t\t\t*tex++ = r * R;\n\t\t\t}\n\t\t}\n\t}\n\n\tsphere->indices.resize(rings * sectors * 6); \/\/ resize for triangles\n\tstd::vector<unsigned int>::iterator i = sphere->indices.begin();\n\tfor(int r = 0; r < rings - 1; ++r)\n\t{\n\t\tfor(int s = 0; s < sectors - 1; ++s)\n\t\t{\n\t\t\tconst int i0 = r * sectors + s;\n\t\t\tconst int i1 = r * sectors + (s + 1);\n\t\t\tconst int i2 = (r + 1) * sectors + (s + 1);\n\t\t\tconst int i3 = (r + 1) * sectors + s;\n\n\t\t\t\/\/ Triangles\n\t\t\t*i++ = i2;\n\t\t\t*i++ = i1;\n\t\t\t*i++ = i0;\n\n\t\t\t*i++ = i3;\n\t\t\t*i++ = i2;\n\t\t\t*i++ = i0;\n\n\n\t\t\t\/\/ Quads\n\t\t\t\/\/*i++ = i0;\n\t\t\t\/\/*i++ = i1;\n\t\t\t\/\/*i++ = i2;\n\t\t\t\/\/*i++ = i3;\n\t\t}\n\t}\n\n\treturn sphere;\n}\n<|endoftext|>"} {"text":"<commit_before>\/\/ Copyright (C) 2017 Elviss Strazdins\n\/\/ This file is part of the Ouzel engine.\n\n#include \"core\/CompileConfig.h\"\n\n#if OUZEL_PLATFORM_RASPBIAN && OUZEL_SUPPORTS_OPENGL\n\n#include \"RendererOGLRasp.h\"\n#include \"core\/Engine.h\"\n#include \"core\/raspbian\/WindowRasp.h\"\n#include \"utils\/Log.h\"\n\nnamespace ouzel\n{\n namespace graphics\n {\n RendererOGLRasp::RendererOGLRasp():\n running(false)\n {\n }\n\n RendererOGLRasp::~RendererOGLRasp()\n {\n running = false;\n flushDrawCommands();\n if (renderThread.joinable()) renderThread.join();\n\n if (context)\n {\n if (!eglMakeCurrent(display, EGL_NO_SURFACE, EGL_NO_SURFACE, EGL_NO_CONTEXT))\n {\n Log(Log::Level::ERR) << \"Failed to unset EGL context, error: \" << eglGetError();\n }\n\n if (!eglDestroyContext(display, context))\n {\n Log(Log::Level::ERR) << \"Failed to destroy EGL context, error: \" << eglGetError();\n }\n }\n\n if (surface)\n {\n if (!eglDestroySurface(display, surface))\n {\n Log(Log::Level::ERR) << \"Failed to destroy EGL surface, error: \" << eglGetError();\n }\n }\n\n if (display)\n {\n if (!eglTerminate(display))\n {\n Log(Log::Level::ERR) << \"Failed to terminate EGL\";\n }\n }\n }\n\n bool RendererOGLRasp::init(Window* newWindow,\n const Size2& newSize,\n uint32_t newSampleCount,\n Texture::Filter newTextureFilter,\n uint32_t newMaxAnisotropy,\n bool newVerticalSync,\n bool newDepth,\n bool newDebugRenderer)\n {\n display = eglGetDisplay(EGL_DEFAULT_DISPLAY);\n\n if (!display)\n {\n Log(Log::Level::ERR) << \"Failed to get display, error: \" << eglGetError();\n return false;\n }\n\n if (!eglInitialize(display, nullptr, nullptr))\n {\n Log(Log::Level::ERR) << \"Failed to initialize EGL, error: \" << eglGetError();\n return false;\n }\n\n const EGLint attributeList[] =\n {\n EGL_RED_SIZE, 8,\n EGL_GREEN_SIZE, 8,\n EGL_BLUE_SIZE, 8,\n EGL_ALPHA_SIZE, 8,\n EGL_DEPTH_SIZE, newDepth ? 24 : 0,\n EGL_SURFACE_TYPE, EGL_WINDOW_BIT,\n EGL_SAMPLE_BUFFERS, (newSampleCount > 1) ? 1 : 0,\n EGL_SAMPLES, static_cast<int>(newSampleCount),\n EGL_NONE\n };\n EGLConfig config;\n EGLint numConfig;\n if (!eglChooseConfig(display, attributeList, &config, 1, &numConfig))\n {\n Log(Log::Level::ERR) << \"Failed to choose EGL config, error: \" << eglGetError();\n return false;\n }\n\n if (!eglBindAPI(EGL_OPENGL_ES_API))\n {\n Log(Log::Level::ERR) << \"Failed to bind OpenGL ES API, error: \" << eglGetError();\n return false;\n }\n\n uint32_t width = static_cast<uint32_t>(newSize.v[0]);\n uint32_t height = static_cast<uint32_t>(newSize.v[1]);\n\n VC_RECT_T dstRect;\n dstRect.x = 0;\n dstRect.y = 0;\n dstRect.width = width;\n dstRect.height = height;\n\n VC_RECT_T srcRect;\n srcRect.x = 0;\n srcRect.y = 0;\n srcRect.width = width;\n srcRect.height = height;\n\n DISPMANX_DISPLAY_HANDLE_T dispmanDisplay = vc_dispmanx_display_open(0);\n DISPMANX_UPDATE_HANDLE_T dispmanUpdate = vc_dispmanx_update_start(0);\n\n DISPMANX_ELEMENT_HANDLE_T dispmanElement = vc_dispmanx_element_add(dispmanUpdate, dispmanDisplay,\n 0, &dstRect, 0,\n &srcRect, DISPMANX_PROTECTION_NONE,\n 0, 0, DISPMANX_NO_ROTATE);\n\n nativewindow.element = dispmanElement;\n nativewindow.width = width;\n nativewindow.height = height;\n vc_dispmanx_update_submit_sync(dispmanUpdate);\n\n surface = eglCreateWindowSurface(display, config, reinterpret_cast<EGLNativeWindowType>(&nativewindow), nullptr);\n if (surface == EGL_NO_SURFACE)\n {\n Log(Log::Level::ERR) << \"Failed to create EGL window surface, error: \" << eglGetError();\n return false;\n }\n\n for (EGLint version = 3; version >= 2; --version)\n {\n std::vector<EGLint> contextAttributes =\n {\n EGL_CONTEXT_CLIENT_VERSION, version\n };\n\n if (newDebugRenderer)\n {\n contextAttributes.push_back(EGL_CONTEXT_FLAGS_KHR);\n contextAttributes.push_back(EGL_CONTEXT_OPENGL_DEBUG_BIT_KHR);\n }\n\n contextAttributes.push_back(EGL_NONE);\n\n context = eglCreateContext(display, config, EGL_NO_CONTEXT, contextAttributes.data());\n\n if (context != EGL_NO_CONTEXT)\n {\n apiMajorVersion = version;\n apiMinorVersion = 0;\n Log(Log::Level::INFO) << \"EGL OpenGL ES \" << version << \" context created\";\n break;\n }\n }\n\n if (context == EGL_NO_CONTEXT)\n {\n Log(Log::Level::ERR) << \"Failed to create EGL context, error: \" << eglGetError();\n return false;\n }\n\n if (!eglMakeCurrent(display, surface, surface, context))\n {\n Log(Log::Level::ERR) << \"Failed to set current EGL context, error: \" << eglGetError();\n return false;\n }\n\n if (!eglSwapInterval(display, newVerticalSync ? 1 : 0))\n {\n Log(Log::Level::ERR) << \"Failed to set EGL frame interval, error: \" << eglGetError();\n return false;\n }\n\n if (!RendererOGL::init(newWindow,\n newSize,\n newSampleCount,\n newTextureFilter,\n newMaxAnisotropy,\n newVerticalSync,\n newDepth,\n newDebugRenderer))\n {\n return false;\n }\n\n if (!eglMakeCurrent(display, EGL_NO_SURFACE, EGL_NO_SURFACE, EGL_NO_CONTEXT))\n {\n Log(Log::Level::ERR) << \"Failed to unset EGL context, error: \" << eglGetError();\n return false;\n }\n\n running = true;\n renderThread = std::thread(&RendererOGLRasp::main, this);\n\n return true;\n }\n\n bool RendererOGLRasp::lockContext()\n {\n if (!eglMakeCurrent(display, surface, surface, context))\n {\n Log(Log::Level::ERR) << \"Failed to set current EGL context, error: \" << eglGetError();\n return false;\n }\n\n return true;\n }\n\n bool RendererOGLRasp::swapBuffers()\n {\n if (eglSwapBuffers(display, surface) != EGL_TRUE)\n {\n Log(Log::Level::ERR) << \"Failed to swap buffers, error: \" << eglGetError();\n return false;\n }\n\n return true;\n }\n\n void RendererOGLRasp::main()\n {\n while (running)\n {\n process();\n }\n\n if (!eglMakeCurrent(display, EGL_NO_SURFACE, EGL_NO_SURFACE, EGL_NO_CONTEXT))\n {\n Log(Log::Level::ERR) << \"Failed to unset EGL context, error: \" << eglGetError();\n return false;\n }\n }\n } \/\/ namespace graphics\n} \/\/ namespace ouzel\n\n#endif\n<commit_msg>Remove the unneeded return<commit_after>\/\/ Copyright (C) 2017 Elviss Strazdins\n\/\/ This file is part of the Ouzel engine.\n\n#include \"core\/CompileConfig.h\"\n\n#if OUZEL_PLATFORM_RASPBIAN && OUZEL_SUPPORTS_OPENGL\n\n#include \"RendererOGLRasp.h\"\n#include \"core\/Engine.h\"\n#include \"core\/raspbian\/WindowRasp.h\"\n#include \"utils\/Log.h\"\n\nnamespace ouzel\n{\n namespace graphics\n {\n RendererOGLRasp::RendererOGLRasp():\n running(false)\n {\n }\n\n RendererOGLRasp::~RendererOGLRasp()\n {\n running = false;\n flushDrawCommands();\n if (renderThread.joinable()) renderThread.join();\n\n if (context)\n {\n if (!eglMakeCurrent(display, EGL_NO_SURFACE, EGL_NO_SURFACE, EGL_NO_CONTEXT))\n {\n Log(Log::Level::ERR) << \"Failed to unset EGL context, error: \" << eglGetError();\n }\n\n if (!eglDestroyContext(display, context))\n {\n Log(Log::Level::ERR) << \"Failed to destroy EGL context, error: \" << eglGetError();\n }\n }\n\n if (surface)\n {\n if (!eglDestroySurface(display, surface))\n {\n Log(Log::Level::ERR) << \"Failed to destroy EGL surface, error: \" << eglGetError();\n }\n }\n\n if (display)\n {\n if (!eglTerminate(display))\n {\n Log(Log::Level::ERR) << \"Failed to terminate EGL\";\n }\n }\n }\n\n bool RendererOGLRasp::init(Window* newWindow,\n const Size2& newSize,\n uint32_t newSampleCount,\n Texture::Filter newTextureFilter,\n uint32_t newMaxAnisotropy,\n bool newVerticalSync,\n bool newDepth,\n bool newDebugRenderer)\n {\n display = eglGetDisplay(EGL_DEFAULT_DISPLAY);\n\n if (!display)\n {\n Log(Log::Level::ERR) << \"Failed to get display, error: \" << eglGetError();\n return false;\n }\n\n if (!eglInitialize(display, nullptr, nullptr))\n {\n Log(Log::Level::ERR) << \"Failed to initialize EGL, error: \" << eglGetError();\n return false;\n }\n\n const EGLint attributeList[] =\n {\n EGL_RED_SIZE, 8,\n EGL_GREEN_SIZE, 8,\n EGL_BLUE_SIZE, 8,\n EGL_ALPHA_SIZE, 8,\n EGL_DEPTH_SIZE, newDepth ? 24 : 0,\n EGL_SURFACE_TYPE, EGL_WINDOW_BIT,\n EGL_SAMPLE_BUFFERS, (newSampleCount > 1) ? 1 : 0,\n EGL_SAMPLES, static_cast<int>(newSampleCount),\n EGL_NONE\n };\n EGLConfig config;\n EGLint numConfig;\n if (!eglChooseConfig(display, attributeList, &config, 1, &numConfig))\n {\n Log(Log::Level::ERR) << \"Failed to choose EGL config, error: \" << eglGetError();\n return false;\n }\n\n if (!eglBindAPI(EGL_OPENGL_ES_API))\n {\n Log(Log::Level::ERR) << \"Failed to bind OpenGL ES API, error: \" << eglGetError();\n return false;\n }\n\n uint32_t width = static_cast<uint32_t>(newSize.v[0]);\n uint32_t height = static_cast<uint32_t>(newSize.v[1]);\n\n VC_RECT_T dstRect;\n dstRect.x = 0;\n dstRect.y = 0;\n dstRect.width = width;\n dstRect.height = height;\n\n VC_RECT_T srcRect;\n srcRect.x = 0;\n srcRect.y = 0;\n srcRect.width = width;\n srcRect.height = height;\n\n DISPMANX_DISPLAY_HANDLE_T dispmanDisplay = vc_dispmanx_display_open(0);\n DISPMANX_UPDATE_HANDLE_T dispmanUpdate = vc_dispmanx_update_start(0);\n\n DISPMANX_ELEMENT_HANDLE_T dispmanElement = vc_dispmanx_element_add(dispmanUpdate, dispmanDisplay,\n 0, &dstRect, 0,\n &srcRect, DISPMANX_PROTECTION_NONE,\n 0, 0, DISPMANX_NO_ROTATE);\n\n nativewindow.element = dispmanElement;\n nativewindow.width = width;\n nativewindow.height = height;\n vc_dispmanx_update_submit_sync(dispmanUpdate);\n\n surface = eglCreateWindowSurface(display, config, reinterpret_cast<EGLNativeWindowType>(&nativewindow), nullptr);\n if (surface == EGL_NO_SURFACE)\n {\n Log(Log::Level::ERR) << \"Failed to create EGL window surface, error: \" << eglGetError();\n return false;\n }\n\n for (EGLint version = 3; version >= 2; --version)\n {\n std::vector<EGLint> contextAttributes =\n {\n EGL_CONTEXT_CLIENT_VERSION, version\n };\n\n if (newDebugRenderer)\n {\n contextAttributes.push_back(EGL_CONTEXT_FLAGS_KHR);\n contextAttributes.push_back(EGL_CONTEXT_OPENGL_DEBUG_BIT_KHR);\n }\n\n contextAttributes.push_back(EGL_NONE);\n\n context = eglCreateContext(display, config, EGL_NO_CONTEXT, contextAttributes.data());\n\n if (context != EGL_NO_CONTEXT)\n {\n apiMajorVersion = version;\n apiMinorVersion = 0;\n Log(Log::Level::INFO) << \"EGL OpenGL ES \" << version << \" context created\";\n break;\n }\n }\n\n if (context == EGL_NO_CONTEXT)\n {\n Log(Log::Level::ERR) << \"Failed to create EGL context, error: \" << eglGetError();\n return false;\n }\n\n if (!eglMakeCurrent(display, surface, surface, context))\n {\n Log(Log::Level::ERR) << \"Failed to set current EGL context, error: \" << eglGetError();\n return false;\n }\n\n if (!eglSwapInterval(display, newVerticalSync ? 1 : 0))\n {\n Log(Log::Level::ERR) << \"Failed to set EGL frame interval, error: \" << eglGetError();\n return false;\n }\n\n if (!RendererOGL::init(newWindow,\n newSize,\n newSampleCount,\n newTextureFilter,\n newMaxAnisotropy,\n newVerticalSync,\n newDepth,\n newDebugRenderer))\n {\n return false;\n }\n\n if (!eglMakeCurrent(display, EGL_NO_SURFACE, EGL_NO_SURFACE, EGL_NO_CONTEXT))\n {\n Log(Log::Level::ERR) << \"Failed to unset EGL context, error: \" << eglGetError();\n return false;\n }\n\n running = true;\n renderThread = std::thread(&RendererOGLRasp::main, this);\n\n return true;\n }\n\n bool RendererOGLRasp::lockContext()\n {\n if (!eglMakeCurrent(display, surface, surface, context))\n {\n Log(Log::Level::ERR) << \"Failed to set current EGL context, error: \" << eglGetError();\n return false;\n }\n\n return true;\n }\n\n bool RendererOGLRasp::swapBuffers()\n {\n if (eglSwapBuffers(display, surface) != EGL_TRUE)\n {\n Log(Log::Level::ERR) << \"Failed to swap buffers, error: \" << eglGetError();\n return false;\n }\n\n return true;\n }\n\n void RendererOGLRasp::main()\n {\n while (running)\n {\n process();\n }\n\n if (!eglMakeCurrent(display, EGL_NO_SURFACE, EGL_NO_SURFACE, EGL_NO_CONTEXT))\n {\n Log(Log::Level::ERR) << \"Failed to unset EGL context, error: \" << eglGetError();\n }\n }\n } \/\/ namespace graphics\n} \/\/ namespace ouzel\n\n#endif\n<|endoftext|>"} {"text":"<commit_before>\/\/ Copyright 2021 MozoLM 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\/\/ Basic authentication end-to-end tests.\n\n#include <filesystem>\n#include <string>\n\n#include \"gmock\/gmock.h\"\n#include \"mozolm\/stubs\/status-matchers.h\"\n#include \"protobuf-matchers\/protocol-buffer-matchers.h\"\n#include \"gtest\/gtest.h\"\n#include \"absl\/container\/flat_hash_map.h\"\n#include \"absl\/status\/status.h\"\n#include \"absl\/strings\/str_cat.h\"\n#include \"mozolm\/grpc\/auth_test_utils.h\"\n#include \"mozolm\/grpc\/client_helper.h\"\n#include \"mozolm\/grpc\/server_helper.h\"\n#include \"mozolm\/utils\/file_util.h\"\n#include \"mozolm\/stubs\/status_macros.h\"\n\nnamespace mozolm {\nnamespace grpc {\nnamespace {\n\nconst char kModelsTestDir[] =\n \"mozolm\/models\/testdata\";\nconst char kCharFstModelFilename[] = \"gutenberg_en_char_ngram_o2_kn.fst\";\nconst char kUdsEndpointName[] = \"auth_end2end_test.sock\";\nconstexpr double kClientTimeoutSec = 1.0;\n\n\/\/ The test fixtures are currently parametrized by the socket type (UDS\/TCP).\nclass AuthEnd2EndTest : public ::testing::TestWithParam<bool> {\n protected:\n void SetUp() override {\n test::ReadAllSslCredentials(&ssl_name2contents_);\n }\n\n void TearDown() override {\n \/\/ Clean up UDS, if configured.\n if (!uds_path_.empty() && std::filesystem::exists(uds_path_)) {\n EXPECT_TRUE(std::filesystem::remove(uds_path_));\n }\n }\n\n \/\/ Given the configuration, builds and starts the server. Then builds the\n \/\/ client and attempts to speak to the server.\n absl::Status BuildAndRun(const ClientConfig &config) const {\n \/\/ Initialize and start the server.\n ServerHelper server;\n RETURN_IF_ERROR(server.Init(config_.server()));\n RETURN_IF_ERROR((server.Run(\/* wait_till_terminated= *\/false)));\n\n \/\/ Initialize and start the client.\n ClientConfig current_config = config;\n InitConfigDefaults(¤t_config);\n if (uds_path_.empty()) { \/\/ Not using UDS.\n const int server_port = server.server().selected_port();\n EXPECT_LT(0, server_port) << \"Invalid port: \" << server_port;\n current_config.mutable_server()->set_address_uri(\n absl::StrCat(\"localhost:\", server_port));\n }\n ClientHelper client;\n RETURN_IF_ERROR(client.Init(current_config));\n\n \/\/ Send one random generation request.\n std::string result;\n RETURN_IF_ERROR(client.RandGen(\/* context_string= *\/\"\", &result));\n EXPECT_FALSE(result.empty());\n return absl::OkStatus();\n }\n\n \/\/ Initializes core server and client configuration. Enabling `use_uds` will\n \/\/ configure the UNIX Domain socket (UDS) endpoint, otherwise regular TCP\n \/\/ sockets are used.\n void InitConfig(ClientConfig *config, bool use_uds) {\n \/\/ Initialize server part.\n ServerConfig *server_config = config->mutable_server();\n if (use_uds) {\n uds_path_ = file::TempFilePath(kUdsEndpointName);\n server_config->set_address_uri(absl::StrCat(\"unix:\/\/\", uds_path_));\n } else {\n server_config->set_address_uri(\"localhost:0\");\n }\n server_config->set_wait_for_clients(false);\n auto *model = server_config->mutable_model_hub_config()->add_model_config();\n model->set_type(ModelConfig::CHAR_NGRAM_FST);\n model->mutable_storage()->set_model_file(\n ModelPath(kModelsTestDir, kCharFstModelFilename));\n\n \/\/ Initialize the client part.\n config->set_timeout_sec(kClientTimeoutSec);\n }\n\n \/\/ Fills in server SSL config.\n void MakeServerSslConfig(ServerConfig *config, bool verify_clients) {\n ServerAuthConfig *auth = config->mutable_auth();\n auth->set_credential_type(CREDENTIAL_SSL);\n auth->mutable_ssl()->set_client_verify(verify_clients);\n auth->mutable_ssl()->set_server_key(\n ssl_name2contents_[test::kSslServerPrivateKeyFile]);\n auth->mutable_ssl()->set_server_cert(\n ssl_name2contents_[test::kSslServerPublicCertFile]);\n }\n\n \/\/ Returns full path to the model.\n std::string ModelPath(std::string_view model_dir,\n std::string_view model_filename) const {\n const std::filesystem::path model_path = (\n std::filesystem::current_path() \/\n model_dir \/ model_filename).make_preferred();\n return model_path.string();\n }\n\n \/\/ Mapping between the names of SSL credential files and the actual contents.\n absl::flat_hash_map<std::string, std::string> ssl_name2contents_;\n\n \/\/ Global configuration (this includes both client and the server).\n ClientConfig config_;\n\n \/\/ UNIX Domain Socket (UDS) path.\n std::string uds_path_;\n};\n\n\/\/ Check insecure credentials.\nTEST_P(AuthEnd2EndTest, CheckInsecure) {\n InitConfig(&config_, \/* use_uds= *\/GetParam());\n EXPECT_OK(BuildAndRun(config_));\n}\n\n\/\/ The certificate presented by the client is not checked by the server at all.\nTEST_P(AuthEnd2EndTest, CheckSslNoClientVerification) {\n InitConfig(&config_, \/* use_uds= *\/GetParam());\n\n \/\/ Prepare the server credentials and run insecure client.\n MakeServerSslConfig(config_.mutable_server(), \/* verify_clients= *\/false);\n EXPECT_FALSE(BuildAndRun(config_).ok());\n\n \/\/ Prepare the client credentials by setting the target name. Will use the\n \/\/ server public certificate authority from the server config.\n ClientAuthConfig *auth = config_.mutable_auth();\n auth->mutable_ssl()->set_target_name_override(test::kSslAltServerName);\n EXPECT_OK(BuildAndRun(config_));\n}\n\n\/\/ Mutual SSL\/TLS verification: server requests client certificate and enforces\n\/\/ that the client presents a certificate. This uses Certificate Authority (CA).\nTEST_P(AuthEnd2EndTest, CheckSslWithClientVerification) {\n InitConfig(&config_, \/* use_uds= *\/GetParam());\n\n \/\/ Prepare the server credentials and run insecure client.\n MakeServerSslConfig(config_.mutable_server(), \/* verify_clients= *\/true);\n EXPECT_FALSE(BuildAndRun(config_).ok());\n\n \/\/ Check that correctly setting target name override is not enough as client\n \/\/ does not present any credentials.\n ClientAuthConfig::SslConfig *client_ssl =\n config_.mutable_auth()->mutable_ssl();\n client_ssl->set_target_name_override(test::kSslAltServerName);\n EXPECT_FALSE(BuildAndRun(config_).ok());\n\n \/\/ Set up all the required certificates and keys. The server certificate and\n \/\/ key are already set up. Check successful handshake and run.\n ServerAuthConfig *server_auth = config_.mutable_server()->mutable_auth();\n server_auth->mutable_ssl()->set_custom_ca_cert(\n ssl_name2contents_[test::kSslClientCentralAuthCertFile]);\n client_ssl->set_client_cert(\n ssl_name2contents_[test::kSslClientPublicCertFile]);\n client_ssl->set_client_key(\n ssl_name2contents_[test::kSslClientPrivateKeyFile]);\n EXPECT_OK(BuildAndRun(config_));\n}\n\nINSTANTIATE_TEST_SUITE_P(\n AuthEnd2EndTestSuite, AuthEnd2EndTest,\n \/\/ Use UNIX Domain Sockets (UDS) or the default TCP sockets.\n ::testing::Values(false, true));\n\n} \/\/ namespace\n} \/\/ namespace grpc\n} \/\/ namespace mozolm\n<commit_msg>Disable UDS test on Windows. UDS is only supported in new Windows versions.<commit_after>\/\/ Copyright 2021 MozoLM 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\/\/ Basic authentication end-to-end tests.\n\n#include <filesystem>\n#include <string>\n\n#include \"gmock\/gmock.h\"\n#include \"mozolm\/stubs\/status-matchers.h\"\n#include \"protobuf-matchers\/protocol-buffer-matchers.h\"\n#include \"gtest\/gtest.h\"\n#include \"absl\/container\/flat_hash_map.h\"\n#include \"absl\/status\/status.h\"\n#include \"absl\/strings\/str_cat.h\"\n#include \"mozolm\/grpc\/auth_test_utils.h\"\n#include \"mozolm\/grpc\/client_helper.h\"\n#include \"mozolm\/grpc\/server_helper.h\"\n#include \"mozolm\/utils\/file_util.h\"\n#include \"mozolm\/stubs\/status_macros.h\"\n\nnamespace mozolm {\nnamespace grpc {\nnamespace {\n\nconst char kModelsTestDir[] =\n \"mozolm\/models\/testdata\";\nconst char kCharFstModelFilename[] = \"gutenberg_en_char_ngram_o2_kn.fst\";\nconst char kUdsEndpointName[] = \"auth_end2end_test.sock\";\nconstexpr double kClientTimeoutSec = 1.0;\n\n\/\/ The test fixtures are currently parametrized by the socket type (UDS\/TCP).\nclass AuthEnd2EndTest : public ::testing::TestWithParam<bool> {\n protected:\n void SetUp() override {\n test::ReadAllSslCredentials(&ssl_name2contents_);\n }\n\n void TearDown() override {\n \/\/ Clean up UDS, if configured.\n if (!uds_path_.empty() && std::filesystem::exists(uds_path_)) {\n EXPECT_TRUE(std::filesystem::remove(uds_path_));\n }\n }\n\n \/\/ Given the configuration, builds and starts the server. Then builds the\n \/\/ client and attempts to speak to the server.\n absl::Status BuildAndRun(const ClientConfig &config) const {\n \/\/ Initialize and start the server.\n ServerHelper server;\n RETURN_IF_ERROR(server.Init(config_.server()));\n RETURN_IF_ERROR((server.Run(\/* wait_till_terminated= *\/false)));\n\n \/\/ Initialize and start the client.\n ClientConfig current_config = config;\n InitConfigDefaults(¤t_config);\n if (uds_path_.empty()) { \/\/ Not using UDS.\n const int server_port = server.server().selected_port();\n EXPECT_LT(0, server_port) << \"Invalid port: \" << server_port;\n current_config.mutable_server()->set_address_uri(\n absl::StrCat(\"localhost:\", server_port));\n }\n ClientHelper client;\n RETURN_IF_ERROR(client.Init(current_config));\n\n \/\/ Send one random generation request.\n std::string result;\n RETURN_IF_ERROR(client.RandGen(\/* context_string= *\/\"\", &result));\n EXPECT_FALSE(result.empty());\n return absl::OkStatus();\n }\n\n \/\/ Initializes core server and client configuration. Enabling `use_uds` will\n \/\/ configure the UNIX Domain socket (UDS) endpoint, otherwise regular TCP\n \/\/ sockets are used.\n void InitConfig(ClientConfig *config, bool use_uds) {\n \/\/ Initialize server part.\n ServerConfig *server_config = config->mutable_server();\n if (use_uds) {\n uds_path_ = file::TempFilePath(kUdsEndpointName);\n server_config->set_address_uri(absl::StrCat(\"unix:\/\/\", uds_path_));\n } else {\n server_config->set_address_uri(\"localhost:0\");\n }\n server_config->set_wait_for_clients(false);\n auto *model = server_config->mutable_model_hub_config()->add_model_config();\n model->set_type(ModelConfig::CHAR_NGRAM_FST);\n model->mutable_storage()->set_model_file(\n ModelPath(kModelsTestDir, kCharFstModelFilename));\n\n \/\/ Initialize the client part.\n config->set_timeout_sec(kClientTimeoutSec);\n }\n\n \/\/ Fills in server SSL config.\n void MakeServerSslConfig(ServerConfig *config, bool verify_clients) {\n ServerAuthConfig *auth = config->mutable_auth();\n auth->set_credential_type(CREDENTIAL_SSL);\n auth->mutable_ssl()->set_client_verify(verify_clients);\n auth->mutable_ssl()->set_server_key(\n ssl_name2contents_[test::kSslServerPrivateKeyFile]);\n auth->mutable_ssl()->set_server_cert(\n ssl_name2contents_[test::kSslServerPublicCertFile]);\n }\n\n \/\/ Returns full path to the model.\n std::string ModelPath(std::string_view model_dir,\n std::string_view model_filename) const {\n const std::filesystem::path model_path = (\n std::filesystem::current_path() \/\n model_dir \/ model_filename).make_preferred();\n return model_path.string();\n }\n\n \/\/ Mapping between the names of SSL credential files and the actual contents.\n absl::flat_hash_map<std::string, std::string> ssl_name2contents_;\n\n \/\/ Global configuration (this includes both client and the server).\n ClientConfig config_;\n\n \/\/ UNIX Domain Socket (UDS) path.\n std::string uds_path_;\n};\n\n\/\/ Check insecure credentials.\nTEST_P(AuthEnd2EndTest, CheckInsecure) {\n InitConfig(&config_, \/* use_uds= *\/GetParam());\n EXPECT_OK(BuildAndRun(config_));\n}\n\n\/\/ The certificate presented by the client is not checked by the server at all.\nTEST_P(AuthEnd2EndTest, CheckSslNoClientVerification) {\n InitConfig(&config_, \/* use_uds= *\/GetParam());\n\n \/\/ Prepare the server credentials and run insecure client.\n MakeServerSslConfig(config_.mutable_server(), \/* verify_clients= *\/false);\n EXPECT_FALSE(BuildAndRun(config_).ok());\n\n \/\/ Prepare the client credentials by setting the target name. Will use the\n \/\/ server public certificate authority from the server config.\n ClientAuthConfig *auth = config_.mutable_auth();\n auth->mutable_ssl()->set_target_name_override(test::kSslAltServerName);\n EXPECT_OK(BuildAndRun(config_));\n}\n\n\/\/ Mutual SSL\/TLS verification: server requests client certificate and enforces\n\/\/ that the client presents a certificate. This uses Certificate Authority (CA).\nTEST_P(AuthEnd2EndTest, CheckSslWithClientVerification) {\n InitConfig(&config_, \/* use_uds= *\/GetParam());\n\n \/\/ Prepare the server credentials and run insecure client.\n MakeServerSslConfig(config_.mutable_server(), \/* verify_clients= *\/true);\n EXPECT_FALSE(BuildAndRun(config_).ok());\n\n \/\/ Check that correctly setting target name override is not enough as client\n \/\/ does not present any credentials.\n ClientAuthConfig::SslConfig *client_ssl =\n config_.mutable_auth()->mutable_ssl();\n client_ssl->set_target_name_override(test::kSslAltServerName);\n EXPECT_FALSE(BuildAndRun(config_).ok());\n\n \/\/ Set up all the required certificates and keys. The server certificate and\n \/\/ key are already set up. Check successful handshake and run.\n ServerAuthConfig *server_auth = config_.mutable_server()->mutable_auth();\n server_auth->mutable_ssl()->set_custom_ca_cert(\n ssl_name2contents_[test::kSslClientCentralAuthCertFile]);\n client_ssl->set_client_cert(\n ssl_name2contents_[test::kSslClientPublicCertFile]);\n client_ssl->set_client_key(\n ssl_name2contents_[test::kSslClientPrivateKeyFile]);\n EXPECT_OK(BuildAndRun(config_));\n}\n\nINSTANTIATE_TEST_SUITE_P(\n AuthEnd2EndTestSuite, AuthEnd2EndTest,\n \/\/ Use UNIX Domain Sockets (UDS) or the default TCP sockets.\n#if !defined(_MSC_VER)\n ::testing::Values(\/* use_uds= *\/false, \/* use_uds= *\/true));\n#elif defined(_WIN32) || defined(_WIN64)\n \/\/ UNIX domain sockets are not supported in older versions of Windows.\n \/\/ See: https:\/\/devblogs.microsoft.com\/commandline\/af_unix-comes-to-windows\/\n ::testing::Values(\/* use_uds= *\/false));\n#endif \/\/ _MSC_VER (Windows).\n\n} \/\/ namespace\n} \/\/ namespace grpc\n} \/\/ namespace mozolm\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 \"otbStandardShader.h\"\n#include \"otbFragmentShaderRegistry.h\"\n#include <GL\/glew.h>\n\nnamespace otb\n{\n\nStandardShader::StandardShader()\n : m_MinRed(0),\n m_MaxRed(255),\n m_MinGreen(0),\n m_MaxGreen(255),\n m_MinBlue(0),\n m_MaxBlue(255),\n m_UseNoData(true),\n m_NoData(0),\n m_Gamma(1.),\n m_Alpha(1.),\n m_CurrentRed(0),\n m_CurrentGreen(0),\n m_CurrentBlue(0),\n m_LocalContrastRange(50),\n m_SpectralAngleRange(10),\n m_Center(),\n m_Radius(200),\n m_ChessboardSize(256),\n m_SliderPosition(500),\n m_VerticalSlider(false),\n m_ShaderType(SHADER_STANDARD)\n{\n this->BuildShader();\n}\n\nStandardShader::~StandardShader()\n{}\n\nstd::string StandardShader::GetSource() const\n{\n return \"#version 130 \\n\" \\\n \"uniform sampler2D src;\\n\" \\\n \"uniform vec4 shader_a;\\n\" \\\n \"uniform vec4 shader_b;\\n\" \\\n \"uniform int shader_use_no_data;\\n\" \\\n \"uniform float shader_no_data;\\n\" \\\n \"uniform vec3 shader_current;\\n\" \\\n \"uniform vec4 shader_gamma;\\n\" \\\n \"uniform float shader_alpha;\\n\" \\\n \"uniform vec2 shader_center;\\n\" \\\n \"uniform int shader_type;\\n\" \\\n \"uniform float shader_radius;\\n\" \\\n \"uniform float shader_localc_range;\\n\" \\\n \"uniform float shader_spectral_angle_range;\\n\" \\\n \"uniform float shader_chessboard_size;\\n\" \\\n \"uniform float shader_slider_pos;\\n\" \\\n \"uniform int shader_vertical_slider_flag;\\n\" \\\n \"void main (void) {\\n\" \\\n \"vec4 p = texture2D(src, gl_TexCoord[0].xy);\\n\" \\\n \"gl_FragColor = clamp(pow((p+shader_b)*shader_a,shader_gamma), 0.0, 1.0);\\n\" \\\n \"gl_FragColor[3] = clamp(shader_alpha,0.0,1.0);\\n\" \\\n \"if(shader_use_no_data > 0 && vec3(p) == vec3(shader_no_data)){\\n\" \\\n \"gl_FragColor[3] = 0.;\\n\" \\\n \"}\\n\" \\\n \"float alpha = gl_FragColor[3];\\n\" \\\n \"float dist = distance(gl_FragCoord.xy,shader_center);\\n\" \\\n \"if(shader_type == 1)\\n\" \\\n \"{\\n\" \\\n \"if(dist < shader_radius)\\n\" \\\n \"{\\n\" \\\n \"vec3 tmp = clamp((vec3(p)-vec3(shader_current)+vec3(shader_localc_range))\/(2.*vec3(shader_localc_range)),0.0,1.0);\\n\" \\\n \"gl_FragColor[0] = tmp[0];\\n\" \\\n \"gl_FragColor[1] = tmp[1];\\n\" \\\n \"gl_FragColor[2] = tmp[2];\\n\" \\\n \"gl_FragColor[3] = alpha;\\n\" \\\n \"}\\n\" \\\n \"}\\n\" \\\n \"else if(shader_type == 2)\" \\\n \"{\\n\" \\\n \"gl_FragColor[3] = dist > shader_radius ? 1.0 : 0.0; \\n\" \\\n \"}\\n\" \\\n \"else if(shader_type == 3)\\n\" \\\n \"{\\n\" \\\n \"float alpha = (mod(floor(gl_FragCoord.x \/ shader_chessboard_size), 2.0) == 0.) != (mod(floor(gl_FragCoord.y \/ shader_chessboard_size), 2.0) == 1.) ? shader_alpha : 0.0;\\n\" \\\n \"gl_FragColor[3] = clamp(alpha,0.0,1.0);\\n\" \\\n \"}\\n\" \\\n \"else if(shader_type == 4)\\n\" \\\n \"{\\n\" \\\n \"float alpha = (shader_vertical_slider_flag == 0 && gl_FragCoord.x > shader_slider_pos) || (shader_vertical_slider_flag == 1 && gl_FragCoord.y > shader_slider_pos) ? 1.0 : 0.0;\\n\" \\\n \"gl_FragColor[3] = clamp(alpha,0.0,1.0);\\n\" \\\n \"}\\n\" \\\n \"else if(shader_type == 5)\\n\" \\\n \"{\\n\" \\\n \"if(dist < shader_radius)\\n\" \\\n \"{\\n\" \\\n \"float angle = acos(clamp(dot(vec3(p),shader_current)\/(length(vec3(p))*length(shader_current)),-1.0,1.0));\\n\" \\\n \"vec3 tmp = clamp(vec3(1.-shader_spectral_angle_range*abs(angle)\/3.142),0.0,1.0);\\n\" \\\n \"gl_FragColor[0] = tmp[0];\\n\" \\\n \"gl_FragColor[1] = tmp[1];\\n\" \\\n \"gl_FragColor[2] = tmp[2];\\n\" \\\n \"gl_FragColor[3] = alpha;\\n\" \\\n \"}\\n\" \\\n \"}\\n\" \\\n \"else if(shader_type == 6)\\n\" \\\n \"{\\n\" \\\n \"if(dist < shader_radius)\\n\" \\\n \"{\\n\" \\\n \"vec2 size = vec2(textureSize(src,0));\\n\" \\\n \"vec2 dx = vec2(gl_TexCoord[0].xy);\\n\" \\\n \"dx[0]+=1.0\/size[0];\\n\" \\\n \"vec2 dy = vec2(gl_TexCoord[0].xy);\\n\" \\\n \"dy[1]+=1.0\/size[1];\\n\" \\\n \"vec4 pdx = texture2D(src, dx);\\n\" \\\n \"vec4 pdy = texture2D(src, dy);\\n\" \\\n \"gl_FragColor = clamp(pow(shader_a*(0.5*abs((pdx-p))+ 0.5*abs((pdy-p))),shader_gamma),0.0,1.0);\\n\" \\\n \"gl_FragColor[3] = alpha;\\n\" \\\n \"}\\n\" \\\n \"}\\n\" \\\n \"}\"\n;}\n\nstd::string StandardShader::GetName() const\n{\n return \"StandardShader\";\n}\n\nvoid StandardShader::SetupShader()\n{\n\/\/ Compute shifts and scales\n double shr,shg,shb,scr,scg,scb;\n shr = -m_MinRed;\n shg = -m_MinGreen;\n shb = -m_MinBlue;\n scr = 1.\/(m_MaxRed-m_MinRed);\n scg = 1.\/(m_MaxGreen-m_MinGreen);\n scb = 1.\/(m_MaxBlue-m_MinBlue);\n \n GLint shader_a = glGetUniformLocation(otb::FragmentShaderRegistry::Instance()->GetShaderProgram(\"StandardShader\"), \"shader_a\");\n glUniform4f(shader_a,scr,scg,scb,1.);\n\n GLint shader_b = glGetUniformLocation(otb::FragmentShaderRegistry::Instance()->GetShaderProgram(\"StandardShader\"), \"shader_b\");\n glUniform4f(shader_b,shr,shg,shb,0);\n\n GLint shader_use_no_data = glGetUniformLocation(otb::FragmentShaderRegistry::Instance()->GetShaderProgram(\"StandardShader\"), \"shader_use_no_data\");\n glUniform1i(shader_use_no_data,m_UseNoData);\n\n GLint shader_no_data = glGetUniformLocation(otb::FragmentShaderRegistry::Instance()->GetShaderProgram(\"StandardShader\"), \"shader_no_data\");\n glUniform1f(shader_no_data,m_NoData);\n\n GLint shader_gamma = glGetUniformLocation(otb::FragmentShaderRegistry::Instance()->GetShaderProgram(\"StandardShader\"), \"shader_gamma\");\n glUniform4f(shader_gamma,m_Gamma,m_Gamma,m_Gamma,m_Gamma);\n\n GLint shader_alpha = glGetUniformLocation(otb::FragmentShaderRegistry::Instance()->GetShaderProgram(\"StandardShader\"), \"shader_alpha\");\n glUniform1f(shader_alpha,m_Alpha);\n\n GLint shader_radius = glGetUniformLocation(otb::FragmentShaderRegistry::Instance()->GetShaderProgram(\"StandardShader\"), \"shader_radius\");\n glUniform1f(shader_radius,m_Radius);\n\n GLint shader_center = glGetUniformLocation(otb::FragmentShaderRegistry::Instance()->GetShaderProgram(\"StandardShader\"), \"shader_center\");\n glUniform2f(shader_center,m_Center[0],m_Center[1]);\n \n GLint shader_type = glGetUniformLocation(otb::FragmentShaderRegistry::Instance()->GetShaderProgram(\"StandardShader\"), \"shader_type\");\n glUniform1i(shader_type,m_ShaderType);\n\n GLint shader_current = glGetUniformLocation(otb::FragmentShaderRegistry::Instance()->GetShaderProgram(\"StandardShader\"), \"shader_current\");\n glUniform3f(shader_current,m_CurrentRed,m_CurrentGreen,m_CurrentBlue);\n\n GLint shader_localc_range = glGetUniformLocation(otb::FragmentShaderRegistry::Instance()->GetShaderProgram(\"StandardShader\"), \"shader_localc_range\");\n glUniform1f(shader_localc_range,m_LocalContrastRange);\n\n GLint shader_spectral_angle_range = glGetUniformLocation(otb::FragmentShaderRegistry::Instance()->GetShaderProgram(\"StandardShader\"), \"shader_spectral_angle_range\");\n glUniform1f(shader_spectral_angle_range,m_SpectralAngleRange);\n\n GLint shader_chessboard_size = glGetUniformLocation(otb::FragmentShaderRegistry::Instance()->GetShaderProgram(\"StandardShader\"), \"shader_chessboard_size\");\n glUniform1f(shader_chessboard_size,m_ChessboardSize);\n\n GLint shader_slider_pos = glGetUniformLocation(otb::FragmentShaderRegistry::Instance()->GetShaderProgram(\"StandardShader\"), \"shader_slider_pos\");\n glUniform1f(shader_slider_pos,m_SliderPosition);\n\n GLint shader_vertical_slider_flag = glGetUniformLocation(otb::FragmentShaderRegistry::Instance()->GetShaderProgram(\"StandardShader\"), \"shader_vertical_slider_flag\");\n glUniform1i(shader_vertical_slider_flag,m_VerticalSlider);\n\n}\n\n\n} \/\/ End namespace otb\n\n<commit_msg>ENH: Adding a small factor to gradient for better visualisation<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 \"otbStandardShader.h\"\n#include \"otbFragmentShaderRegistry.h\"\n#include <GL\/glew.h>\n\nnamespace otb\n{\n\nStandardShader::StandardShader()\n : m_MinRed(0),\n m_MaxRed(255),\n m_MinGreen(0),\n m_MaxGreen(255),\n m_MinBlue(0),\n m_MaxBlue(255),\n m_UseNoData(true),\n m_NoData(0),\n m_Gamma(1.),\n m_Alpha(1.),\n m_CurrentRed(0),\n m_CurrentGreen(0),\n m_CurrentBlue(0),\n m_LocalContrastRange(50),\n m_SpectralAngleRange(10),\n m_Center(),\n m_Radius(200),\n m_ChessboardSize(256),\n m_SliderPosition(500),\n m_VerticalSlider(false),\n m_ShaderType(SHADER_STANDARD)\n{\n this->BuildShader();\n}\n\nStandardShader::~StandardShader()\n{}\n\nstd::string StandardShader::GetSource() const\n{\n return \"#version 130 \\n\" \\\n \"uniform sampler2D src;\\n\" \\\n \"uniform vec4 shader_a;\\n\" \\\n \"uniform vec4 shader_b;\\n\" \\\n \"uniform int shader_use_no_data;\\n\" \\\n \"uniform float shader_no_data;\\n\" \\\n \"uniform vec3 shader_current;\\n\" \\\n \"uniform vec4 shader_gamma;\\n\" \\\n \"uniform float shader_alpha;\\n\" \\\n \"uniform vec2 shader_center;\\n\" \\\n \"uniform int shader_type;\\n\" \\\n \"uniform float shader_radius;\\n\" \\\n \"uniform float shader_localc_range;\\n\" \\\n \"uniform float shader_spectral_angle_range;\\n\" \\\n \"uniform float shader_chessboard_size;\\n\" \\\n \"uniform float shader_slider_pos;\\n\" \\\n \"uniform int shader_vertical_slider_flag;\\n\" \\\n \"void main (void) {\\n\" \\\n \"vec4 p = texture2D(src, gl_TexCoord[0].xy);\\n\" \\\n \"gl_FragColor = clamp(pow((p+shader_b)*shader_a,shader_gamma), 0.0, 1.0);\\n\" \\\n \"gl_FragColor[3] = clamp(shader_alpha,0.0,1.0);\\n\" \\\n \"if(shader_use_no_data > 0 && vec3(p) == vec3(shader_no_data)){\\n\" \\\n \"gl_FragColor[3] = 0.;\\n\" \\\n \"}\\n\" \\\n \"float alpha = gl_FragColor[3];\\n\" \\\n \"float dist = distance(gl_FragCoord.xy,shader_center);\\n\" \\\n \"if(shader_type == 1)\\n\" \\\n \"{\\n\" \\\n \"if(dist < shader_radius)\\n\" \\\n \"{\\n\" \\\n \"vec3 tmp = clamp((vec3(p)-vec3(shader_current)+vec3(shader_localc_range))\/(2.*vec3(shader_localc_range)),0.0,1.0);\\n\" \\\n \"gl_FragColor[0] = tmp[0];\\n\" \\\n \"gl_FragColor[1] = tmp[1];\\n\" \\\n \"gl_FragColor[2] = tmp[2];\\n\" \\\n \"gl_FragColor[3] = alpha;\\n\" \\\n \"}\\n\" \\\n \"}\\n\" \\\n \"else if(shader_type == 2)\" \\\n \"{\\n\" \\\n \"gl_FragColor[3] = dist > shader_radius ? 1.0 : 0.0; \\n\" \\\n \"}\\n\" \\\n \"else if(shader_type == 3)\\n\" \\\n \"{\\n\" \\\n \"float alpha = (mod(floor(gl_FragCoord.x \/ shader_chessboard_size), 2.0) == 0.) != (mod(floor(gl_FragCoord.y \/ shader_chessboard_size), 2.0) == 1.) ? shader_alpha : 0.0;\\n\" \\\n \"gl_FragColor[3] = clamp(alpha,0.0,1.0);\\n\" \\\n \"}\\n\" \\\n \"else if(shader_type == 4)\\n\" \\\n \"{\\n\" \\\n \"float alpha = (shader_vertical_slider_flag == 0 && gl_FragCoord.x > shader_slider_pos) || (shader_vertical_slider_flag == 1 && gl_FragCoord.y > shader_slider_pos) ? 1.0 : 0.0;\\n\" \\\n \"gl_FragColor[3] = clamp(alpha,0.0,1.0);\\n\" \\\n \"}\\n\" \\\n \"else if(shader_type == 5)\\n\" \\\n \"{\\n\" \\\n \"if(dist < shader_radius)\\n\" \\\n \"{\\n\" \\\n \"float angle = acos(clamp(dot(vec3(p),shader_current)\/(length(vec3(p))*length(shader_current)),-1.0,1.0));\\n\" \\\n \"vec3 tmp = clamp(vec3(1.-shader_spectral_angle_range*abs(angle)\/3.142),0.0,1.0);\\n\" \\\n \"gl_FragColor[0] = tmp[0];\\n\" \\\n \"gl_FragColor[1] = tmp[1];\\n\" \\\n \"gl_FragColor[2] = tmp[2];\\n\" \\\n \"gl_FragColor[3] = alpha;\\n\" \\\n \"}\\n\" \\\n \"}\\n\" \\\n \"else if(shader_type == 6)\\n\" \\\n \"{\\n\" \\\n \"if(dist < shader_radius)\\n\" \\\n \"{\\n\" \\\n \"vec2 size = vec2(textureSize(src,0));\\n\" \\\n \"vec2 dx = vec2(gl_TexCoord[0].xy);\\n\" \\\n \"dx[0]+=1.0\/size[0];\\n\" \\\n \"vec2 dy = vec2(gl_TexCoord[0].xy);\\n\" \\\n \"dy[1]+=1.0\/size[1];\\n\" \\\n \"vec4 pdx = texture2D(src, dx);\\n\" \\\n \"vec4 pdy = texture2D(src, dy);\\n\" \\\n \"gl_FragColor = clamp(pow(5*shader_a*(0.5*abs((pdx-p))+ 0.5*abs((pdy-p))),shader_gamma),0.0,1.0);\\n\" \\\n \"gl_FragColor[3] = alpha;\\n\" \\\n \"}\\n\" \\\n \"}\\n\" \\\n \"}\"\n;}\n\nstd::string StandardShader::GetName() const\n{\n return \"StandardShader\";\n}\n\nvoid StandardShader::SetupShader()\n{\n\/\/ Compute shifts and scales\n double shr,shg,shb,scr,scg,scb;\n shr = -m_MinRed;\n shg = -m_MinGreen;\n shb = -m_MinBlue;\n scr = 1.\/(m_MaxRed-m_MinRed);\n scg = 1.\/(m_MaxGreen-m_MinGreen);\n scb = 1.\/(m_MaxBlue-m_MinBlue);\n \n GLint shader_a = glGetUniformLocation(otb::FragmentShaderRegistry::Instance()->GetShaderProgram(\"StandardShader\"), \"shader_a\");\n glUniform4f(shader_a,scr,scg,scb,1.);\n\n GLint shader_b = glGetUniformLocation(otb::FragmentShaderRegistry::Instance()->GetShaderProgram(\"StandardShader\"), \"shader_b\");\n glUniform4f(shader_b,shr,shg,shb,0);\n\n GLint shader_use_no_data = glGetUniformLocation(otb::FragmentShaderRegistry::Instance()->GetShaderProgram(\"StandardShader\"), \"shader_use_no_data\");\n glUniform1i(shader_use_no_data,m_UseNoData);\n\n GLint shader_no_data = glGetUniformLocation(otb::FragmentShaderRegistry::Instance()->GetShaderProgram(\"StandardShader\"), \"shader_no_data\");\n glUniform1f(shader_no_data,m_NoData);\n\n GLint shader_gamma = glGetUniformLocation(otb::FragmentShaderRegistry::Instance()->GetShaderProgram(\"StandardShader\"), \"shader_gamma\");\n glUniform4f(shader_gamma,m_Gamma,m_Gamma,m_Gamma,m_Gamma);\n\n GLint shader_alpha = glGetUniformLocation(otb::FragmentShaderRegistry::Instance()->GetShaderProgram(\"StandardShader\"), \"shader_alpha\");\n glUniform1f(shader_alpha,m_Alpha);\n\n GLint shader_radius = glGetUniformLocation(otb::FragmentShaderRegistry::Instance()->GetShaderProgram(\"StandardShader\"), \"shader_radius\");\n glUniform1f(shader_radius,m_Radius);\n\n GLint shader_center = glGetUniformLocation(otb::FragmentShaderRegistry::Instance()->GetShaderProgram(\"StandardShader\"), \"shader_center\");\n glUniform2f(shader_center,m_Center[0],m_Center[1]);\n \n GLint shader_type = glGetUniformLocation(otb::FragmentShaderRegistry::Instance()->GetShaderProgram(\"StandardShader\"), \"shader_type\");\n glUniform1i(shader_type,m_ShaderType);\n\n GLint shader_current = glGetUniformLocation(otb::FragmentShaderRegistry::Instance()->GetShaderProgram(\"StandardShader\"), \"shader_current\");\n glUniform3f(shader_current,m_CurrentRed,m_CurrentGreen,m_CurrentBlue);\n\n GLint shader_localc_range = glGetUniformLocation(otb::FragmentShaderRegistry::Instance()->GetShaderProgram(\"StandardShader\"), \"shader_localc_range\");\n glUniform1f(shader_localc_range,m_LocalContrastRange);\n\n GLint shader_spectral_angle_range = glGetUniformLocation(otb::FragmentShaderRegistry::Instance()->GetShaderProgram(\"StandardShader\"), \"shader_spectral_angle_range\");\n glUniform1f(shader_spectral_angle_range,m_SpectralAngleRange);\n\n GLint shader_chessboard_size = glGetUniformLocation(otb::FragmentShaderRegistry::Instance()->GetShaderProgram(\"StandardShader\"), \"shader_chessboard_size\");\n glUniform1f(shader_chessboard_size,m_ChessboardSize);\n\n GLint shader_slider_pos = glGetUniformLocation(otb::FragmentShaderRegistry::Instance()->GetShaderProgram(\"StandardShader\"), \"shader_slider_pos\");\n glUniform1f(shader_slider_pos,m_SliderPosition);\n\n GLint shader_vertical_slider_flag = glGetUniformLocation(otb::FragmentShaderRegistry::Instance()->GetShaderProgram(\"StandardShader\"), \"shader_vertical_slider_flag\");\n glUniform1i(shader_vertical_slider_flag,m_VerticalSlider);\n\n}\n\n\n} \/\/ End namespace otb\n\n<|endoftext|>"} {"text":"<commit_before>\/*-----------------------------------------------------------------------------\n This source file is part of Hopsan NG\n\n Copyright (c) 2011 \n Mikael Axin, Robert Braun, Alessandro Dell'Amico, Björn Eriksson,\n Peter Nordin, Karl Pettersson, Petter Krus, Ingo Staack\n\n This file is provided \"as is\", with no guarantee or warranty for the\n functionality or reliability of the contents. All contents in this file is\n the original work of the copyright holders at the Division of Fluid and\n Mechatronic Systems (Flumes) at Linköping University. Modifying, using or\n redistributing any part of this file is prohibited without explicit\n permission from the copyright holders.\n-----------------------------------------------------------------------------*\/\n\n\/\/!\n\/\/! @file MechanicAngularVelocityTransformer.hpp\n\/\/! @author Robert Braun <robert.braun@liu.se>\n\/\/! @date 2010-08-05\n\/\/!\n\/\/! @brief Contains an angular velocity transformer component\n\/\/!\n\/\/$Id$\n\n#ifndef MECHANICANGULARVELOCITYTRANSFORMER_HPP_INCLUDED\n#define MECHANICANGULARVELOCITYTRANSFORMER_HPP_INCLUDED\n\n#include \"ComponentEssentials.h\"\n#include \"ComponentUtilities.h\"\n\nnamespace hopsan {\n\n \/\/!\n \/\/! @brief\n \/\/! @ingroup MechanicalComponents\n \/\/!\n class MechanicAngularVelocityTransformer : public ComponentQ\n {\n\n private:\n double *mpW;\n double *mpND_t, *mpND_a, *mpND_w, *mpND_c, *mpND_Zx;\n Integrator mInt;\n Port *mpIn, *mpOut;\n\n public:\n static Component *Creator()\n {\n return new MechanicAngularVelocityTransformer();\n }\n\n void configure()\n {\n mpIn = addReadPort(\"in\", \"NodeSignal\", Port::NotRequired);\n mpOut = addPowerPort(\"out\", \"NodeMechanicRotational\");\n addInputVariable(\"omega\", \"Generated angular velocity\", \"[rad\/s]\", 0.0, &mpW);\n }\n\n\n void initialize()\n {\n mpND_t = getSafeNodeDataPtr(mpOut, NodeMechanicRotational::Torque);\n mpND_a = getSafeNodeDataPtr(mpOut, NodeMechanicRotational::Angle);\n mpND_w = getSafeNodeDataPtr(mpOut, NodeMechanicRotational::AngularVelocity);\n mpND_c = getSafeNodeDataPtr(mpOut, NodeMechanicRotational::WaveVariable);\n mpND_Zx = getSafeNodeDataPtr(mpOut, NodeMechanicRotational::CharImpedance);\n\n mInt.initialize(mTimestep, (*mpW), 0.0);\n }\n\n\n void simulateOneTimestep()\n {\n \/\/Get variable values from nodes\n double w, c, Zx, a, t;\n w = (*mpW);\n c = (*mpND_c);\n Zx = (*mpND_Zx);\n\n \/\/Spring equations\n a = mInt.update(w);\n t = c + Zx*w;\n\n \/\/Write values to nodes\n (*mpND_t) = t;\n (*mpND_a) = a;\n (*mpND_w) = w;\n }\n };\n}\n\n#endif \/\/ MECHANICANGULARVELOCITYTRANSFORMER_HPP_INCLUDED\n\n\n\n\n<commit_msg>Removed useless inport<commit_after>\/*-----------------------------------------------------------------------------\n This source file is part of Hopsan NG\n\n Copyright (c) 2011 \n Mikael Axin, Robert Braun, Alessandro Dell'Amico, Björn Eriksson,\n Peter Nordin, Karl Pettersson, Petter Krus, Ingo Staack\n\n This file is provided \"as is\", with no guarantee or warranty for the\n functionality or reliability of the contents. All contents in this file is\n the original work of the copyright holders at the Division of Fluid and\n Mechatronic Systems (Flumes) at Linköping University. Modifying, using or\n redistributing any part of this file is prohibited without explicit\n permission from the copyright holders.\n-----------------------------------------------------------------------------*\/\n\n\/\/!\n\/\/! @file MechanicAngularVelocityTransformer.hpp\n\/\/! @author Robert Braun <robert.braun@liu.se>\n\/\/! @date 2010-08-05\n\/\/!\n\/\/! @brief Contains an angular velocity transformer component\n\/\/!\n\/\/$Id$\n\n#ifndef MECHANICANGULARVELOCITYTRANSFORMER_HPP_INCLUDED\n#define MECHANICANGULARVELOCITYTRANSFORMER_HPP_INCLUDED\n\n#include \"ComponentEssentials.h\"\n#include \"ComponentUtilities.h\"\n\nnamespace hopsan {\n\n \/\/!\n \/\/! @brief\n \/\/! @ingroup MechanicalComponents\n \/\/!\n class MechanicAngularVelocityTransformer : public ComponentQ\n {\n\n private:\n Integrator mInt;\n Port *mpOut;\n double *mpOut_t, *mpOut_a, *mpOut_w, *mpOut_c, *mpOut_Zx;\n double *mpW;\n\n public:\n static Component *Creator()\n {\n return new MechanicAngularVelocityTransformer();\n }\n\n void configure()\n {\n mpOut = addPowerPort(\"out\", \"NodeMechanicRotational\");\n addInputVariable(\"omega\", \"Generated angular velocity\", \"[rad\/s]\", 0.0, &mpW);\n }\n\n\n void initialize()\n {\n mpOut_t = getSafeNodeDataPtr(mpOut, NodeMechanicRotational::Torque);\n mpOut_a = getSafeNodeDataPtr(mpOut, NodeMechanicRotational::Angle);\n mpOut_w = getSafeNodeDataPtr(mpOut, NodeMechanicRotational::AngularVelocity);\n mpOut_c = getSafeNodeDataPtr(mpOut, NodeMechanicRotational::WaveVariable);\n mpOut_Zx = getSafeNodeDataPtr(mpOut, NodeMechanicRotational::CharImpedance);\n\n mInt.initialize(mTimestep, (*mpW), (*mpOut_a));\n }\n\n\n void simulateOneTimestep()\n {\n \/\/Get variable values from nodes\n double a, t;\n const double w = (*mpW);\n const double c = (*mpOut_c);\n const double Zx = (*mpOut_Zx);\n\n \/\/Spring equations\n a = mInt.update(w);\n t = c + Zx*w;\n\n \/\/Write values to nodes\n (*mpOut_t) = t;\n (*mpOut_a) = a;\n (*mpOut_w) = w;\n }\n };\n}\n\n#endif \/\/ MECHANICANGULARVELOCITYTRANSFORMER_HPP_INCLUDED\n\n\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#include \"mitkPyramidImageRegistrationMethod.h\"\n\n#include \"mitkException.h\"\n#include \"mitkImageAccessByItk.h\"\n\nmitk::PyramidImageRegistrationMethod::PyramidImageRegistrationMethod()\n : m_FixedImage(NULL),\n m_MovingImage(NULL),\n m_CrossModalityRegistration(true),\n m_UseAffineTransform(true),\n m_UseWindowedSincInterpolator(false),\n m_UseNearestNeighborInterpolator(false),\n m_UseMask(false),\n m_EstimatedParameters(NULL),\n m_InitialParameters(NULL),\n m_Verbose(false)\n{\n\n}\n\nmitk::PyramidImageRegistrationMethod::~PyramidImageRegistrationMethod()\n{\n if( m_EstimatedParameters != NULL)\n {\n delete [] m_EstimatedParameters;\n }\n\n}\n\nvoid mitk::PyramidImageRegistrationMethod::SetFixedImage(mitk::Image::Pointer fixed)\n{\n if( fixed.IsNotNull() )\n {\n m_FixedImage = fixed;\n }\n}\n\nvoid mitk::PyramidImageRegistrationMethod::SetMovingImage(mitk::Image::Pointer moving)\n{\n if( moving.IsNotNull() )\n {\n m_MovingImage = moving;\n }\n}\n\n\nvoid mitk::PyramidImageRegistrationMethod::SetFixedImageMask(mitk::Image::Pointer mask)\n{\n m_FixedImageMask = mask;\n}\n\nvoid mitk::PyramidImageRegistrationMethod::Update()\n{\n if( m_MovingImage.IsNull() )\n {\n mitkThrow() << \" Moving image is null\";\n }\n\n if( m_FixedImage.IsNull() )\n {\n mitkThrow() << \" Moving image is null\";\n }\n\n unsigned int allowedDimension = 3;\n\n if( m_FixedImage->GetDimension() != allowedDimension ||\n m_MovingImage->GetDimension() != allowedDimension )\n {\n mitkThrow() << \" Only 3D Images supported.\";\n }\n\n \/\/\n \/\/ One possibility: use the FixedDimesnionByItk, but this instantiates ALL possible\n \/\/ pixel type combinations!\n \/\/ AccessTwoImagesFixedDimensionByItk( m_FixedImage, m_MovingImage, RegisterTwoImages, 3);\n \/\/ in helper: TypeSubset : short, float\n AccessTwoImagesFixedDimensionTypeSubsetByItk( m_FixedImage, m_MovingImage, RegisterTwoImages, 3);\n\n}\n\nmitk::PyramidImageRegistrationMethod::TransformMatrixType mitk::PyramidImageRegistrationMethod\n::GetLastRotationMatrix()\n{\n TransformMatrixType output;\n if( m_EstimatedParameters == NULL )\n {\n output.set_identity();\n return output;\n }\n\n typedef itk::MatrixOffsetTransformBase< double, 3, 3> BaseTransformType;\n BaseTransformType::Pointer base_transform = BaseTransformType::New();\n\n if( this->m_UseAffineTransform )\n {\n typedef itk::AffineTransform< double > TransformType;\n TransformType::Pointer transform = TransformType::New();\n\n TransformType::ParametersType affine_params( TransformType::ParametersDimension );\n this->GetParameters( &affine_params[0] );\n\n transform->SetParameters( affine_params );\n base_transform = transform;\n }\n else\n {\n typedef itk::Euler3DTransform< double > RigidTransformType;\n RigidTransformType::Pointer rtransform = RigidTransformType::New();\n\n RigidTransformType::ParametersType rigid_params( RigidTransformType::ParametersDimension );\n this->GetParameters( &rigid_params[0] );\n\n rtransform->SetParameters( rigid_params );\n\n base_transform = rtransform;\n }\n\n return base_transform->GetMatrix().GetVnlMatrix();\n\n}\n\nmitk::Image::Pointer mitk::PyramidImageRegistrationMethod\n::GetResampledMovingImage()\n{\n\n mitk::Image::Pointer output = mitk::Image::New();\n \/\/output->Initialize( this->m_FixedImage );\n\n AccessFixedDimensionByItk_1( this->m_MovingImage, ResampleMitkImage, 3, output );\n\n return output;\n\n}\n\nmitk::Image::Pointer mitk::PyramidImageRegistrationMethod::GetResampledMovingImage(mitk::Image::Pointer movingImage, double* transform)\n{\n mitk::Image::Pointer output = mitk::Image::New();\n\n\n unsigned int dim = 12;\n if( !m_UseAffineTransform )\n dim = 6;\n\n if (m_EstimatedParameters == NULL)\n m_EstimatedParameters = new double[dim];\n\n double tmpParams[12];\n \/\/ save and set temporal transformation values\n for( unsigned int i=0; i<dim; i++)\n {\n tmpParams[i] = m_EstimatedParameters[i];\n m_EstimatedParameters[i] = transform[i];\n }\n\n AccessFixedDimensionByItk_1( movingImage, ResampleMitkImage, 3, output );\n\n \/\/ Restore old values\n for( unsigned int i=0; i<dim; i++)\n {\n m_EstimatedParameters[i] = tmpParams[i];\n }\n\n return output;\n\n}\n<commit_msg>Fixed variable initialization<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 \"mitkPyramidImageRegistrationMethod.h\"\n\n#include \"mitkException.h\"\n#include \"mitkImageAccessByItk.h\"\n\nmitk::PyramidImageRegistrationMethod::PyramidImageRegistrationMethod()\n : m_FixedImage(NULL),\n m_MovingImage(NULL),\n m_CrossModalityRegistration(true),\n m_UseAffineTransform(true),\n m_UseWindowedSincInterpolator(false),\n m_UseNearestNeighborInterpolator(false),\n m_UseMask(false),\n m_EstimatedParameters(0),\n m_InitialParameters(0),\n m_Verbose(false)\n{\n\n}\n\nmitk::PyramidImageRegistrationMethod::~PyramidImageRegistrationMethod()\n{\n if( m_EstimatedParameters != NULL)\n {\n delete [] m_EstimatedParameters;\n }\n\n}\n\nvoid mitk::PyramidImageRegistrationMethod::SetFixedImage(mitk::Image::Pointer fixed)\n{\n if( fixed.IsNotNull() )\n {\n m_FixedImage = fixed;\n }\n}\n\nvoid mitk::PyramidImageRegistrationMethod::SetMovingImage(mitk::Image::Pointer moving)\n{\n if( moving.IsNotNull() )\n {\n m_MovingImage = moving;\n }\n}\n\n\nvoid mitk::PyramidImageRegistrationMethod::SetFixedImageMask(mitk::Image::Pointer mask)\n{\n m_FixedImageMask = mask;\n}\n\nvoid mitk::PyramidImageRegistrationMethod::Update()\n{\n if( m_MovingImage.IsNull() )\n {\n mitkThrow() << \" Moving image is null\";\n }\n\n if( m_FixedImage.IsNull() )\n {\n mitkThrow() << \" Moving image is null\";\n }\n\n unsigned int allowedDimension = 3;\n\n if( m_FixedImage->GetDimension() != allowedDimension ||\n m_MovingImage->GetDimension() != allowedDimension )\n {\n mitkThrow() << \" Only 3D Images supported.\";\n }\n\n \/\/\n \/\/ One possibility: use the FixedDimesnionByItk, but this instantiates ALL possible\n \/\/ pixel type combinations!\n \/\/ AccessTwoImagesFixedDimensionByItk( m_FixedImage, m_MovingImage, RegisterTwoImages, 3);\n \/\/ in helper: TypeSubset : short, float\n AccessTwoImagesFixedDimensionTypeSubsetByItk( m_FixedImage, m_MovingImage, RegisterTwoImages, 3);\n\n}\n\nmitk::PyramidImageRegistrationMethod::TransformMatrixType mitk::PyramidImageRegistrationMethod\n::GetLastRotationMatrix()\n{\n TransformMatrixType output;\n if( m_EstimatedParameters == NULL )\n {\n output.set_identity();\n return output;\n }\n\n typedef itk::MatrixOffsetTransformBase< double, 3, 3> BaseTransformType;\n BaseTransformType::Pointer base_transform = BaseTransformType::New();\n\n if( this->m_UseAffineTransform )\n {\n typedef itk::AffineTransform< double > TransformType;\n TransformType::Pointer transform = TransformType::New();\n\n TransformType::ParametersType affine_params( TransformType::ParametersDimension );\n this->GetParameters( &affine_params[0] );\n\n transform->SetParameters( affine_params );\n base_transform = transform;\n }\n else\n {\n typedef itk::Euler3DTransform< double > RigidTransformType;\n RigidTransformType::Pointer rtransform = RigidTransformType::New();\n\n RigidTransformType::ParametersType rigid_params( RigidTransformType::ParametersDimension );\n this->GetParameters( &rigid_params[0] );\n\n rtransform->SetParameters( rigid_params );\n\n base_transform = rtransform;\n }\n\n return base_transform->GetMatrix().GetVnlMatrix();\n\n}\n\nmitk::Image::Pointer mitk::PyramidImageRegistrationMethod\n::GetResampledMovingImage()\n{\n\n mitk::Image::Pointer output = mitk::Image::New();\n \/\/output->Initialize( this->m_FixedImage );\n\n AccessFixedDimensionByItk_1( this->m_MovingImage, ResampleMitkImage, 3, output );\n\n return output;\n\n}\n\nmitk::Image::Pointer mitk::PyramidImageRegistrationMethod::GetResampledMovingImage(mitk::Image::Pointer movingImage, double* transform)\n{\n mitk::Image::Pointer output = mitk::Image::New();\n\n\n unsigned int dim = 12;\n if( !m_UseAffineTransform )\n dim = 6;\n\n if (m_EstimatedParameters == NULL)\n m_EstimatedParameters = new double[dim];\n\n double tmpParams[12];\n \/\/ save and set temporal transformation values\n for( unsigned int i=0; i<dim; i++)\n {\n tmpParams[i] = m_EstimatedParameters[i];\n m_EstimatedParameters[i] = transform[i];\n }\n\n AccessFixedDimensionByItk_1( movingImage, ResampleMitkImage, 3, output );\n\n \/\/ Restore old values\n for( unsigned int i=0; i<dim; i++)\n {\n m_EstimatedParameters[i] = tmpParams[i];\n }\n\n return output;\n\n}\n<|endoftext|>"} {"text":"<commit_before>#include \"TChain.h\"\n#include \"TH1.h\"\n#include \"TH2.h\"\n#include \"TH3.h\"\n#include \"TList.h\"\n#include \"AliAnalysisTask.h\"\n#include \"AliAnalysisManager.h\"\n#include \"AliAODEvent.h\"\n#include \"AliAODInputHandler.h\"\n#include \"AliAnalysisTaskParticleYieldRatioCorrelationsEfficiency.h\"\n#include \"AliAODMCParticle.h\"\n#include \"AliMultSelection.h\"\n\nusing namespace std;\n\nClassImp(AliAnalysisTaskParticleYieldRatioCorrelationsEfficiency)\n\n AliAnalysisTaskParticleYieldRatioCorrelationsEfficiency::AliAnalysisTaskParticleYieldRatioCorrelationsEfficiency() : AliAnalysisTaskSE(),\n fAOD(0), fOutputList(0)\n{\n \/\/ default constructor, don't allocate memory here!\n \/\/ this is used by root for IO purposes, it needs to remain empty\n}\n\/\/_____________________________________________________________________________\nAliAnalysisTaskParticleYieldRatioCorrelationsEfficiency::AliAnalysisTaskParticleYieldRatioCorrelationsEfficiency(const char *name) : AliAnalysisTaskSE(name),\n fAOD(0), fOutputList(0)\n{\n \/\/ constructor\n DefineInput(0, TChain::Class());\n DefineOutput(1, TList::Class());\n}\n\/\/_____________________________________________________________________________\nAliAnalysisTaskParticleYieldRatioCorrelationsEfficiency::~AliAnalysisTaskParticleYieldRatioCorrelationsEfficiency()\n{\n \/\/ destructor\n if (fOutputList)\n {\n delete fOutputList;\n }\n}\n\/\/_____________________________________________________________________________\nvoid AliAnalysisTaskParticleYieldRatioCorrelationsEfficiency::UserCreateOutputObjects()\n{\n fOutputList = new TList();\n fOutputList->SetOwner(kTRUE);\n\n AliAnalysisManager *man = AliAnalysisManager::GetAnalysisManager();\n if (man)\n {\n AliInputEventHandler *inputHandler = dynamic_cast<AliInputEventHandler *>(man->GetInputEventHandler());\n if (inputHandler)\n fPIDResponse = inputHandler->GetPIDResponse();\n else\n AliFatal(\"Input handler needed\");\n }\n PostData(1, fOutputList);\n}\n\/\/_____________________________________________________________________________\nvoid AliAnalysisTaskParticleYieldRatioCorrelationsEfficiency::UserExec(Option_t *)\n{\n fAOD = dynamic_cast<AliAODEvent *>(InputEvent());\n\n if (!fAOD)\n {\n PostData(1, fOutputList);\n return;\n }\n PostData(1, fOutputList);\n}\n\/\/_____________________________________________________________________________\nvoid AliAnalysisTaskParticleYieldRatioCorrelationsEfficiency::Terminate(Option_t *)\n{\n \/\/ terminate\n \/\/ called at the END of the analysis (when all events are processed)\n}\n\/\/_____________________________________________________________________________\n<commit_msg>Update AliAnalysisTaskParticleYieldRatioCorrelationsEfficiency.cxx<commit_after>#include \"TChain.h\"\n#include \"TH1.h\"\n#include \"TH2.h\"\n#include \"TH3.h\"\n#include \"TList.h\"\n#include \"AliAnalysisTask.h\"\n#include \"AliAnalysisManager.h\"\n#include \"AliAODEvent.h\"\n#include \"AliAODInputHandler.h\"\n#include \"AliAnalysisTaskParticleYieldRatioCorrelationsEfficiency.h\"\n#include \"AliAODMCParticle.h\"\n#include \"AliMultSelection.h\"\n\nusing namespace std;\n\nClassImp(AliAnalysisTaskParticleYieldRatioCorrelationsEfficiency)\n\n AliAnalysisTaskParticleYieldRatioCorrelationsEfficiency::AliAnalysisTaskParticleYieldRatioCorrelationsEfficiency() : AliAnalysisTaskSE(),\n fAOD(0), fOutputList(0), fDeDx(0), fTOF(0), fHistEventsCut(0), fAliEventCuts(0), fHistTracksCut(0)\n{\n \/\/ default constructor, don't allocate memory here!\n \/\/ this is used by root for IO purposes, it needs to remain empty\n}\n\/\/_____________________________________________________________________________\nAliAnalysisTaskParticleYieldRatioCorrelationsEfficiency::AliAnalysisTaskParticleYieldRatioCorrelationsEfficiency(const char *name) : AliAnalysisTaskSE(name),\n fAOD(0), fOutputList(0), fDeDx(0), fTOF(0), fHistEventsCut(0), fAliEventCuts(0), fHistTracksCut(0)\n{\n \/\/ constructor\n DefineInput(0, TChain::Class());\n DefineOutput(1, TList::Class());\n}\n\/\/_____________________________________________________________________________\nAliAnalysisTaskParticleYieldRatioCorrelationsEfficiency::~AliAnalysisTaskParticleYieldRatioCorrelationsEfficiency()\n{\n \/\/ destructor\n if (fOutputList)\n {\n delete fOutputList;\n }\n}\n\/\/_____________________________________________________________________________\nvoid AliAnalysisTaskParticleYieldRatioCorrelationsEfficiency::UserCreateOutputObjects()\n{\n fOutputList = new TList();\n fOutputList->SetOwner(kTRUE);\n\n fHistEventsCut = new TH1F(\"fHistEventsCut\", \";NEvents\", 6, 0, 6);\n fHistTracksCut = new TH1F(\"fHistTracksCut\", \";Ntracks\", 6, 0, 5);\n fHistEventsCut->GetXaxis()->SetBinLabel(1, \"minBias\");\n fHistEventsCut->GetXaxis()->SetBinLabel(2, \"centrality\");\n fHistEventsCut->GetXaxis()->SetBinLabel(3, \"NContributors\");\n fHistEventsCut->GetXaxis()->SetBinLabel(4, \"vertex\");\n fHistEventsCut->GetXaxis()->SetBinLabel(5, \"AliEventCuts\");\n fHistTracksCut->GetXaxis()->SetBinLabel(1, \"minBias\");\n fHistTracksCut->GetXaxis()->SetBinLabel(2, \"FilterBit\");\n fHistTracksCut->GetXaxis()->SetBinLabel(3, \"Eta\");\n fHistTracksCut->GetXaxis()->SetBinLabel(4, \"pT\");\n fHistTracksCut->GetXaxis()->SetBinLabel(5, \"TOF\");\n fDeDx = new TH2D(\"DeDx\", \";p_{TPC};dE\/dx (a.u.)\", 200, 0.2, 2, 250, 0, 2000);\n fTOF = new TH2D(\"fTOF\", \";p_{TPC};t\", 200, 0.2, 2, 200, -4000, 4000);\n fOutputList->Add(fDeDx);\n fOutputList->Add(fTOF);\n for (int iSort = 0; iSort < 4; iSort++)\n {\n fDeDxSorts[iSort] = new TH2D(Form(\"DeDxSort%d\", iSort), \";p_{TPC};dE\/dx (a.u.)\", 200, 0.2, 2, 250, 0, 2000);\n fTOFSorts[iSort] = new TH2D(Form(\"fTOFSort%d\", iSort), \";p_{TPC};t\", 200, 0.2, 2, 200, -4000, 4000);\n fOutputList->Add(fDeDxSorts[iSort]);\n fOutputList->Add(fTOFSorts[iSort]);\n }\n fOutputList->Add(fHistEventsCut);\n fOutputList->Add(fHistTracksCut);\n\n for (int iCent = 0; iCent < nCentrClasses; iCent++)\n {\n for (int iEta = 0; iEta < nEtaClasses; iEta++)\n {\n for (int iSort = 0; iSort < nSorts; iSort++)\n {\n NGenTracks[iCent][iEta][iSort] = new TH3D(Form(\"NGenTracksC%dEta%dSort%d\", iCent, iEta, iSort), \";P_{T};Ntracks\",\n nPBins, minP, maxP, nPhiBins, 0, TMath::TwoPi(), nVertexBins, Vertexmin, Vertexmax);\n EfficiencyTracking[iCent][iEta][iSort] = new TH3D(Form(\"EfficiencyTrackingC%dEta%dSort%d\", iCent, iEta, iSort), \";P_{T};EfficiencyTracking\",\n nPBins, minP, maxP, nPhiBins, 0, TMath::TwoPi(), nVertexBins, Vertexmin, Vertexmax);\n ContaminationTracking[iCent][iEta][iSort] = new TH3D(Form(\"ContaminationTrackingC%dEta%dSort%d\", iCent, iEta, iSort), \";P_{T};ContaminationTracking\",\n nPBins, minP, maxP, nPhiBins, 0, TMath::TwoPi(), nVertexBins, Vertexmin, Vertexmax);\n NReconstTracks[iCent][iEta][iSort] = new TH3D(Form(\"NReconstTracksC%dEta%dSort%d\", iCent, iEta, iSort), \";P_{T};Ntracks\",\n nPBins, minP, maxP, nPhiBins, 0, TMath::TwoPi(), nVertexBins, Vertexmin, Vertexmax);\n\n NTrueTracks[iCent][iEta][iSort] = new TH3D(Form(\"NTrueTracksC%dEta%dSort%d\", iCent, iEta, iSort), \";P_{T};Ntracks\",\n nPBins, minP, maxP, nPhiBins, 0, TMath::TwoPi(), nVertexBins, Vertexmin, Vertexmax);\n EfficiencyPID[iCent][iEta][iSort] = new TH3D(Form(\"EfficiencyPIDC%dEta%dSort%d\", iCent, iEta, iSort), \";P_{T};EfficiencyPID\",\n nPBins, minP, maxP, nPhiBins, 0, TMath::TwoPi(), nVertexBins, Vertexmin, Vertexmax);\n ContaminationPID[iCent][iEta][iSort] = new TH3D(Form(\"ContaminationPIDC%dEta%dSort%d\", iCent, iEta, iSort), \";P_{T};ContaminationPID\",\n nPBins, minP, maxP, nPhiBins, 0, TMath::TwoPi(), nVertexBins, Vertexmin, Vertexmax);\n NTracksInCut[iCent][iEta][iSort] = new TH3D(Form(\"NTracksInCutC%dEta%dSort%d\", iCent, iEta, iSort), \";P_{T};Ntracks\",\n nPBins, minP, maxP, nPhiBins, 0, TMath::TwoPi(), nVertexBins, Vertexmin, Vertexmax);\n\n fOutputList->Add(NGenTracks[iCent][iEta][iSort]);\n fOutputList->Add(EfficiencyTracking[iCent][iEta][iSort]);\n fOutputList->Add(ContaminationTracking[iCent][iEta][iSort]);\n fOutputList->Add(NReconstTracks[iCent][iEta][iSort]);\n\n fOutputList->Add(NTrueTracks[iCent][iEta][iSort]);\n fOutputList->Add(EfficiencyPID[iCent][iEta][iSort]);\n fOutputList->Add(ContaminationPID[iCent][iEta][iSort]);\n fOutputList->Add(NTracksInCut[iCent][iEta][iSort]);\n }\n }\n }\n\n for (int iSort = 0; iSort < nSorts; iSort++)\n {\n purityAll[iSort] = new TH1D(Form(\"pur%d\", iSort), \"\", nPBins, minP, maxP);\n fOutputList->Add(purityAll[iSort]);\n for (int jSort = 0; jSort < nSorts; jSort++)\n {\n purity[iSort][jSort] = new TH1D(Form(\"pur%din%d\", jSort, iSort), \"\", nPBins, minP, maxP);\n fOutputList->Add(purity[iSort][jSort]);\n }\n }\n fHistQASPDTrackletsvsV0MCent = new TH2D(\"fHistQASPDTrackletsvsV0MCent\", \";V0M Percentile;N Tracklets in SPD\", 100, 0, 100, 400, 0, 1e4);\n fOutputList->Add(fHistQASPDTrackletsvsV0MCent);\n if (!pbpb)\n {\n fAliEventCuts = new AliEventCuts();\n fAliEventCuts->SetupRun2pp();\n }\n AliAnalysisManager *man = AliAnalysisManager::GetAnalysisManager();\n if (man)\n {\n AliInputEventHandler *inputHandler = dynamic_cast<AliInputEventHandler *>(man->GetInputEventHandler());\n if (inputHandler)\n fPIDResponse = inputHandler->GetPIDResponse();\n else\n AliFatal(\"Input handler needed\");\n }\n PostData(1, fOutputList);\n}\n\/\/_____________________________________________________________________________\nvoid AliAnalysisTaskParticleYieldRatioCorrelationsEfficiency::UserExec(Option_t *)\n{\n fAOD = dynamic_cast<AliAODEvent *>(InputEvent());\n\n if (!fAOD)\n {\n PostData(1, fOutputList);\n return;\n }\n fHistEventsCut->Fill(\"minBias\", 1);\n if (!pbpb && !fAliEventCuts->AcceptEvent(fAOD))\n {\n PostData(1, fOutputList);\n return;\n }\n\n Float_t centr;\n Int_t NTrackletsSPD;\n if (0)\n {\n AliCentrality *centrality = fAOD->GetCentrality();\n centr = centrality->GetCentralityPercentile(\"V0M\");\n }\n else\n {\n AliMultSelection *MultSelection = 0x0;\n MultSelection = (AliMultSelection *)fAOD->FindListObject(\"MultSelection\");\n if (MultSelection)\n {\n centr = MultSelection->GetMultiplicityPercentile(\"V0M\");\n NTrackletsSPD = MultSelection->GetEstimator(\"SPDTracklets\")->GetValue();\n }\n else\n {\n fHistEventsCut->Fill(\"AliEventCuts\", 1);\n PostData(1, fOutputList);\n return;\n }\n }\n \/\/centrality cut:\n if (centr < minCent || centr > maxCent)\n {\n PostData(1, fOutputList);\n return;\n }\n fHistEventsCut->Fill(\"centrality\", 1);\n fHistQASPDTrackletsvsV0MCent->Fill(centr, NTrackletsSPD);\n if (1)\n {\n TF1 *fSPDvsV0M_DownLimit = new TF1(\"fSPDvsV0M_DownLimit\", \"exp(8.1456-0.0354*x-3.8e-04*x*x)\", 0, 80);\n TF1 *fSPDvsV0M_UperLimit = new TF1(\"fSPDvsV0M_UperLimit\", \"exp(8.58-0.036*x-4.4e-05*x*x)\", 0, 80);\n if (NTrackletsSPD < fSPDvsV0M_DownLimit->Eval(centr) || NTrackletsSPD > fSPDvsV0M_UperLimit->Eval(centr))\n {\n PostData(1, fOutputList);\n return;\n }\n fHistEventsCut->Fill(\"SPDvsV0M\", 1);\n }\n const AliAODVertex *vtx = fAOD->GetPrimaryVertex();\n if (vtx->GetNContributors() < 1)\n {\n PostData(1, fOutputList);\n return;\n }\n fHistEventsCut->Fill(\"NContributors\", 1);\n if (fabs((Float_t)vtx->GetZ()) > 8)\n {\n PostData(1, fOutputList);\n return;\n }\n fHistEventsCut->Fill(\"vertex\", 1);\n Float_t vertex = (Float_t)vtx->GetZ();\n Int_t nTracks(fAOD->GetNumberOfTracks());\n Int_t EtaBin, CentrBin;\n int sort = 20;\n CentrBin = (centr - minCent) \/ ((maxCent - minCent) \/ nCentrClasses);\n \/\/CentrBin = centr<=5?0:(centr<=10?1: 2+(centr-10)\/((maxCent-10)\/(nCentrClasses-2)) ); \/\/if first bins are 0-5 & 5-10\n int NAcceptedtracks = 0;\n fHistTracksCut->Fill(\"minBias\", nTracks);\n\n AliAODInputHandler *eventHandler = dynamic_cast<AliAODInputHandler *>(AliAnalysisManager::GetAnalysisManager()->GetInputEventHandler());\n AliMCEvent *fMC = eventHandler->MCEvent();\n Int_t nMCTracks(fMC->GetNumberOfTracks());\n Float_t PtCut[3] = {0.2, 0.5, 0.5};\n Float_t nSigmaBoundary[3] = {0.5, 0.32, 0.7};\n\n \/\/Track loop:\n for (Int_t i(0); i < nTracks; i++)\n {\n AliAODTrack *track = static_cast<AliAODTrack *>(fAOD->GetTrack(i));\n if (!track || !track->TestFilterBit(filterBit))\n continue;\n fHistTracksCut->Fill(\"FilterBit\", 1);\n if (fabs(track->Eta()) >= 0.8)\n continue;\n fHistTracksCut->Fill(\"Eta\", 1);\n if (track->Pt() < minP || track->Pt() > maxP)\n continue;\n fHistTracksCut->Fill(\"pT\", 1);\n EtaBin = (0.8 + track->Eta()) \/ (1.6 \/ nEtaClasses);\n\n Float_t nOfSigmasTPC_el = fPIDResponse->NumberOfSigmasTPC(track, AliPID::kElectron);\n Float_t nOfSigmasTPC_pi = fPIDResponse->NumberOfSigmasTPC(track, AliPID::kPion);\n Float_t nOfSigmasTPC_K = fPIDResponse->NumberOfSigmasTPC(track, AliPID::kKaon);\n Float_t nOfSigmasTPC_p = fPIDResponse->NumberOfSigmasTPC(track, AliPID::kProton);\n\n Float_t nOfSigmasTOF_pi = fPIDResponse->NumberOfSigmasTOF(track, AliPID::kPion, fPIDResponse->GetTOFResponse().GetTimeZero());\n Float_t nOfSigmasTOF_K = fPIDResponse->NumberOfSigmasTOF(track, AliPID::kKaon, fPIDResponse->GetTOFResponse().GetTimeZero());\n Float_t nOfSigmasTOF_p = fPIDResponse->NumberOfSigmasTOF(track, AliPID::kProton, fPIDResponse->GetTOFResponse().GetTimeZero());\n\n if (fabs(nOfSigmasTOF_pi > 900))\n {\n fHistTracksCut->Fill(\"TOF\", 1);\n continue;\n }\n if (fabs(nOfSigmasTOF_K > 900))\n {\n continue;\n }\n if (fabs(nOfSigmasTOF_p > 900))\n {\n continue;\n }\n if (track->GetTPCCrossedRows() <= nCrossedRows)\n {\n continue;\n }\n\n Float_t Pt = track->Pt();\n Float_t Px = track->Px();\n Float_t Py = track->Py();\n Float_t Pz = track->Pz();\n Float_t Moment = track->GetTPCmomentum();\n Float_t Phi = track->Phi();\n Float_t Eta = track->Eta();\n Float_t DeDx = track->GetTPCsignal();\n Float_t Charge = track->Charge();\n fDeDx->Fill(Moment, DeDx);\n fTOF->Fill(Moment, track->GetTOFsignal());\n\n if (IsMC && fMC)\n {\n int label = track->GetLabel();\n AliAODMCParticle *part = (AliAODMCParticle *)fMC->GetTrack(abs(label));\n if (part)\n {\n\n if (fabs(part->GetPdgCode()) == 211)\n sort = 0;\n if (fabs(part->GetPdgCode()) == 321)\n sort = 1;\n if (fabs(part->GetPdgCode()) == 2212)\n sort = 2;\n if (fabs(part->GetPdgCode()) == 11)\n sort = 3;\n if (fabs(part->GetPdgCode()) == 1000010020)\n sort = 4;\n\n if ((sort >= 0 && sort <= 3) && Pt > PtCut[sort])\n {\n if (part->IsPhysicalPrimary())\n EfficiencyTracking[CentrBin][EtaBin][sort * 2 + (Charge < 0 ? 0 : 1)]->Fill(Pt, Phi, vertex);\n else\n ContaminationTracking[CentrBin][EtaBin][sort * 2 + (Charge < 0 ? 0 : 1)]->Fill(Pt, Phi, vertex);\n NReconstTracks[CentrBin][EtaBin][sort * 2 + (Charge < 0 ? 0 : 1)]->Fill(Pt, Phi, vertex);\n }\n }\n }\n\n Float_t nSigma_comb_pi = sqrt(nOfSigmasTPC_pi * nOfSigmasTPC_pi + nOfSigmasTOF_pi * nOfSigmasTOF_pi);\n Float_t nSigma_comb_K = sqrt(nOfSigmasTPC_K * nOfSigmasTPC_K + nOfSigmasTOF_K * nOfSigmasTOF_K);\n Float_t nSigma_comb_p = sqrt(nOfSigmasTPC_p * nOfSigmasTPC_p + nOfSigmasTOF_p * nOfSigmasTOF_p);\n\n \/\/Fill TH3D hists for maps\n bool selected_pi = false;\n if (Pt < nSigmaBoundary[0] && fabs(nOfSigmasTPC_pi) < nSigma && fabs(nOfSigmasTPC_K) > 3 && fabs(nOfSigmasTPC_p) > 3 && fabs(nOfSigmasTPC_el) > 1)\n selected_pi = true;\n if (Pt > nSigmaBoundary[0] && nSigma_comb_pi < nSigma && nSigma_comb_K > 3 && nSigma_comb_p > 3)\n selected_pi = true;\n if (selected_pi)\n {\n if (Charge < 0)\n {\n NTracksInCut[CentrBin][EtaBin][0]->Fill(Pt, Phi, vertex);\n if (sort == 0)\n EfficiencyPID[CentrBin][EtaBin][0]->Fill(Pt, Phi, vertex);\n else\n ContaminationPID[CentrBin][EtaBin][0]->Fill(Pt, Phi, vertex);\n purity[0][sort * 2 + (Charge < 0 ? 0 : 1)]->Fill(Pt);\n purityAll[0]->Fill(Pt);\n }\n if (Charge > 0)\n {\n NTracksInCut[CentrBin][EtaBin][1]->Fill(Pt, Phi, vertex);\n if (sort == 0)\n EfficiencyPID[CentrBin][EtaBin][1]->Fill(Pt, Phi, vertex);\n else\n ContaminationPID[CentrBin][EtaBin][1]->Fill(Pt, Phi, vertex);\n purity[1][sort * 2 + (Charge < 0 ? 0 : 1)]->Fill(Pt);\n purityAll[1]->Fill(Pt);\n }\n fDeDxSorts[0]->Fill(Moment, DeDx);\n fTOFSorts[0]->Fill(Moment, track->GetTOFsignal());\n }\n\n bool selected_K = false;\n if (Pt < nSigmaBoundary[1] && fabs(nOfSigmasTPC_K) < nSigma && fabs(nOfSigmasTPC_pi) > 3 && fabs(nOfSigmasTPC_p) > 3) \/\/ && fabs( nOfSigmasTPC_el)>1 )\n selected_K = true;\n if (Pt > nSigmaBoundary[1] && nSigma_comb_K < nSigma && nSigma_comb_pi > 3 && nSigma_comb_p > 3)\n selected_K = true;\n if (selected_K && Pt > PtCut[1])\n {\n if (Charge < 0)\n {\n NTracksInCut[CentrBin][EtaBin][2]->Fill(Pt, Phi, vertex);\n if (sort == 1)\n EfficiencyPID[CentrBin][EtaBin][2]->Fill(Pt, Phi, vertex);\n else\n ContaminationPID[CentrBin][EtaBin][2]->Fill(Pt, Phi, vertex);\n purity[2][sort * 2 + (Charge < 0 ? 0 : 1)]->Fill(Pt);\n purityAll[2]->Fill(Pt);\n }\n if (Charge > 0)\n {\n NTracksInCut[CentrBin][EtaBin][3]->Fill(Pt, Phi, vertex);\n if (sort == 1)\n EfficiencyPID[CentrBin][EtaBin][3]->Fill(Pt, Phi, vertex);\n else\n ContaminationPID[CentrBin][EtaBin][3]->Fill(Pt, Phi, vertex);\n purity[3][sort * 2 + (Charge < 0 ? 0 : 1)]->Fill(Pt);\n purityAll[3]->Fill(Pt);\n }\n fDeDxSorts[1]->Fill(Moment, DeDx);\n fTOFSorts[1]->Fill(Moment, track->GetTOFsignal());\n }\n\n bool selected_p = false;\n if (Pt < nSigmaBoundary[2] && fabs(nOfSigmasTPC_p) < nSigma && fabs(nOfSigmasTPC_pi) > 3 && fabs(nOfSigmasTPC_K) > 3 && fabs(nOfSigmasTPC_el) > 1)\n selected_p = true;\n if (Pt > nSigmaBoundary[2] && nSigma_comb_p < nSigma && nSigma_comb_pi > 3 && nSigma_comb_K > 3)\n selected_p = true;\n if (selected_p && Pt > PtCut[2])\n {\n if (Charge < 0)\n {\n NTracksInCut[CentrBin][EtaBin][4]->Fill(Pt, Phi, vertex);\n if (sort == 2)\n EfficiencyPID[CentrBin][EtaBin][4]->Fill(Pt, Phi, vertex);\n else\n ContaminationPID[CentrBin][EtaBin][4]->Fill(Pt, Phi, vertex);\n purity[4][sort * 2 + (Charge < 0 ? 0 : 1)]->Fill(Pt);\n purityAll[4]->Fill(Pt);\n }\n if (Charge > 0)\n {\n NTracksInCut[CentrBin][EtaBin][5]->Fill(Pt, Phi, vertex);\n if (sort == 2)\n EfficiencyPID[CentrBin][EtaBin][5]->Fill(Pt, Phi, vertex);\n else\n ContaminationPID[CentrBin][EtaBin][5]->Fill(Pt, Phi, vertex);\n purity[5][sort * 2 + (Charge < 0 ? 0 : 1)]->Fill(Pt);\n purityAll[5]->Fill(Pt);\n }\n fDeDxSorts[2]->Fill(Moment, DeDx);\n fTOFSorts[2]->Fill(Moment, track->GetTOFsignal());\n }\n\n bool selected_el = false;\n if (fabs(nOfSigmasTPC_p) > 3 && fabs(nOfSigmasTPC_pi) > 3 && fabs(nOfSigmasTPC_K) > 3 && fabs(nOfSigmasTPC_el) < 2)\n selected_el = true;\n if (selected_el)\n {\n if (Charge < 0)\n {\n NTracksInCut[CentrBin][EtaBin][6]->Fill(Pt, Phi, vertex);\n if (sort == 3)\n EfficiencyPID[CentrBin][EtaBin][6]->Fill(Pt, Phi, vertex);\n else\n ContaminationPID[CentrBin][EtaBin][6]->Fill(Pt, Phi, vertex);\n purity[6][sort * 2 + (Charge < 0 ? 0 : 1)]->Fill(Pt);\n purityAll[6]->Fill(Pt);\n }\n if (Charge > 0)\n {\n NTracksInCut[CentrBin][EtaBin][7]->Fill(Pt, Phi, vertex);\n if (sort == 3)\n EfficiencyPID[CentrBin][EtaBin][7]->Fill(Pt, Phi, vertex);\n else\n ContaminationPID[CentrBin][EtaBin][7]->Fill(Pt, Phi, vertex);\n purity[7][sort * 2 + (Charge < 0 ? 0 : 1)]->Fill(Pt);\n purityAll[7]->Fill(Pt);\n }\n fDeDxSorts[3]->Fill(Moment, DeDx);\n fTOFSorts[3]->Fill(Moment, track->GetTOFsignal());\n }\n if ((sort >= 0 && sort <= 3) && Pt > PtCut[sort])\n NTrueTracks[CentrBin][EtaBin][sort * 2 + (Charge < 0 ? 0 : 1)]->Fill(Pt, Phi, vertex);\n \/\/end of filling TH3D hists for maps\n\n NAcceptedtracks++;\n }\n \/\/ end of track loop\n\n int nAcceptedGenTracks = 0;\n\n if (IsMC && fMC)\n {\n \/\/Generated particles track loop\n for (Int_t i(0); i < nMCTracks; i++)\n {\n AliAODMCParticle *trackMC = (AliAODMCParticle *)fMC->GetTrack(i);\n\n if (trackMC && trackMC->IsPhysicalPrimary() && fabs(trackMC->Eta()) < 0.8 && trackMC->Pt() >= minP && trackMC->Pt() <= maxP)\n {\n Float_t GenPt = trackMC->Pt();\n Float_t GenPhi = trackMC->Phi();\n Float_t GenEta = trackMC->Eta();\n Float_t GenCharge = trackMC->Charge();\n\n if (fabs(trackMC->GetPdgCode()) == 211)\n sort = 0;\n if (fabs(trackMC->GetPdgCode()) == 321)\n sort = 1;\n if (fabs(trackMC->GetPdgCode()) == 2212)\n sort = 2;\n if (fabs(trackMC->GetPdgCode()) == 11)\n sort = 3;\n if (fabs(trackMC->GetPdgCode()) == 1000010020)\n sort = 4;\n nAcceptedGenTracks++;\n\n if ((sort >= 0 && sort <= 3) && GenPt > PtCut[sort] && GenCharge != 0)\n {\n EtaBin = (0.8 + GenEta) \/ (1.6 \/ nEtaClasses);\n NGenTracks[CentrBin][EtaBin][sort * 2 + (GenCharge < 0 ? 0 : 1)]->Fill(GenPt, GenPhi, vertex);\n }\n }\n }\n }\n PostData(1, fOutputList);\n}\n\/\/_____________________________________________________________________________\nvoid AliAnalysisTaskParticleYieldRatioCorrelationsEfficiency::Terminate(Option_t *)\n{\n \/\/ terminate\n \/\/ called at the END of the analysis (when all events are processed)\n}\n\/\/_____________________________________________________________________________\n<|endoftext|>"} {"text":"<commit_before><commit_msg>Add analysis for correction maps<commit_after><|endoftext|>"} {"text":"<commit_before>\/\/ Scintilla source code edit control\n\/** @file LexSpice.cxx\n ** Lexer for Spice\n **\/\n\/\/ Copyright 2006 by Fabien Proriol <proriol.fabien.dev@saint-pal.com>\n\/\/ The License.txt file describes the conditions under which this software may be distributed.\n\n#include <stdlib.h>\n#include <ctype.h>\n#include <string.h>\n#include <stdio.h>\n\n#include \"Platform.h\"\n\n#include \"Accessor.h\"\n#include \"StyleContext.h\"\n#include \"PropSet.h\"\n#include \"KeyWords.h\"\n#include \"SciLexer.h\"\n#include \"SString.h\"\n\n\/*\n * Interface\n *\/\n\nstatic void ColouriseDocument(\n unsigned int startPos,\n int length,\n int initStyle,\n WordList *keywordlists[],\n Accessor &styler);\n\nstatic const char * const spiceWordListDesc[] = {\n \"Keywords\", \/\/ SPICE command\n \"Keywords2\", \/\/ SPICE functions\n \"Keywords3\", \/\/ SPICE params\n 0\n};\n\nLexerModule lmSpice(SCLEX_SPICE, ColouriseDocument, \"spice\", NULL, spiceWordListDesc);\n\n\/*\n * Implementation\n *\/\n\nstatic void ColouriseComment(StyleContext& sc, bool& apostropheStartsAttribute);\nstatic void ColouriseDelimiter(StyleContext& sc, bool& apostropheStartsAttribute);\nstatic void ColouriseNumber(StyleContext& sc, bool& apostropheStartsAttribute);\nstatic void ColouriseWhiteSpace(StyleContext& sc, bool& apostropheStartsAttribute);\nstatic void ColouriseWord(StyleContext& sc, WordList& keywords, WordList& keywords2, WordList& keywords3, bool& apostropheStartsAttribute);\n\nstatic inline bool IsDelimiterCharacter(int ch);\nstatic inline bool IsNumberStartCharacter(int ch);\nstatic inline bool IsNumberCharacter(int ch);\nstatic inline bool IsSeparatorOrDelimiterCharacter(int ch);\nstatic inline bool IsWordStartCharacter(int ch);\nstatic inline bool IsWordCharacter(int ch);\n\nstatic void ColouriseComment(StyleContext& sc, bool&) {\n sc.SetState(SCE_SPICE_COMMENTLINE);\n while (!sc.atLineEnd) {\n sc.Forward();\n }\n}\n\nstatic void ColouriseDelimiter(StyleContext& sc, bool& apostropheStartsAttribute) {\n apostropheStartsAttribute = sc.Match (')');\n sc.SetState(SCE_SPICE_DELIMITER);\n sc.ForwardSetState(SCE_SPICE_DEFAULT);\n}\n\nstatic void ColouriseNumber(StyleContext& sc, bool& apostropheStartsAttribute) {\n apostropheStartsAttribute = true;\n SString number;\n sc.SetState(SCE_SPICE_NUMBER);\n \/\/ Get all characters up to a delimiter or a separator, including points, but excluding\n \/\/ double points (ranges).\n while (!IsSeparatorOrDelimiterCharacter(sc.ch) || (sc.ch == '.' && sc.chNext != '.')) {\n number += static_cast<char>(sc.ch);\n sc.Forward();\n }\n \/\/ Special case: exponent with sign\n if ((sc.chPrev == 'e' || sc.chPrev == 'E') &&\n (sc.ch == '+' || sc.ch == '-')) {\n number += static_cast<char>(sc.ch);\n sc.Forward ();\n while (!IsSeparatorOrDelimiterCharacter(sc.ch)) {\n number += static_cast<char>(sc.ch);\n sc.Forward();\n }\n }\n sc.SetState(SCE_SPICE_DEFAULT);\n}\n\nstatic void ColouriseWhiteSpace(StyleContext& sc, bool& ) {\n sc.SetState(SCE_SPICE_DEFAULT);\n sc.ForwardSetState(SCE_SPICE_DEFAULT);\n}\n\nstatic void ColouriseWord(StyleContext& sc, WordList& keywords, WordList& keywords2, WordList& keywords3, bool& apostropheStartsAttribute) {\n apostropheStartsAttribute = true;\n sc.SetState(SCE_SPICE_IDENTIFIER);\n SString word;\n while (!sc.atLineEnd && !IsSeparatorOrDelimiterCharacter(sc.ch)) {\n word += static_cast<char>(tolower(sc.ch));\n sc.Forward();\n }\n if (keywords.InList(word.c_str())) {\n sc.ChangeState(SCE_SPICE_KEYWORD);\n if (word != \"all\") {\n apostropheStartsAttribute = false;\n }\n }\n else if (keywords2.InList(word.c_str())) {\n sc.ChangeState(SCE_SPICE_KEYWORD2);\n if (word != \"all\") {\n apostropheStartsAttribute = false;\n }\n }\n else if (keywords3.InList(word.c_str())) {\n sc.ChangeState(SCE_SPICE_KEYWORD3);\n if (word != \"all\") {\n apostropheStartsAttribute = false;\n }\n }\n sc.SetState(SCE_SPICE_DEFAULT);\n}\n\n\/\/\n\/\/ ColouriseDocument\n\/\/\nstatic void ColouriseDocument(\n unsigned int startPos,\n int length,\n int initStyle,\n WordList *keywordlists[],\n Accessor &styler) {\n WordList &keywords = *keywordlists[0];\n WordList &keywords2 = *keywordlists[1];\n WordList &keywords3 = *keywordlists[2];\n StyleContext sc(startPos, length, initStyle, styler);\n int lineCurrent = styler.GetLine(startPos);\n bool apostropheStartsAttribute = (styler.GetLineState(lineCurrent) & 1) != 0;\n while (sc.More()) {\n if (sc.atLineEnd) {\n \/\/ Go to the next line\n sc.Forward();\n lineCurrent++;\n \/\/ Remember the line state for future incremental lexing\n styler.SetLineState(lineCurrent, apostropheStartsAttribute);\n \/\/ Don't continue any styles on the next line\n sc.SetState(SCE_SPICE_DEFAULT);\n }\n \/\/ Comments\n if ((sc.Match('*') && sc.atLineStart) || sc.Match('*','~')) {\n ColouriseComment(sc, apostropheStartsAttribute);\n \/\/ Whitespace\n } else if (IsASpace(sc.ch)) {\n ColouriseWhiteSpace(sc, apostropheStartsAttribute);\n \/\/ Delimiters\n } else if (IsDelimiterCharacter(sc.ch)) {\n ColouriseDelimiter(sc, apostropheStartsAttribute);\n \/\/ Numbers\n } else if (IsADigit(sc.ch) || sc.ch == '#') {\n ColouriseNumber(sc, apostropheStartsAttribute);\n \/\/ Keywords or identifiers\n } else {\n ColouriseWord(sc, keywords, keywords2, keywords3, apostropheStartsAttribute);\n }\n }\n sc.Complete();\n}\n\nstatic inline bool IsDelimiterCharacter(int ch) {\n switch (ch) {\n case '&':\n case '\\'':\n case '(':\n case ')':\n case '*':\n case '+':\n case ',':\n case '-':\n case '.':\n case '\/':\n case ':':\n case ';':\n case '<':\n case '=':\n case '>':\n case '|':\n return true;\n default:\n return false;\n }\n}\n\nstatic inline bool IsNumberCharacter(int ch) {\n return IsNumberStartCharacter(ch) ||\n ch == '_' ||\n ch == '.' ||\n ch == '#' ||\n (ch >= 'a' && ch <= 'f') ||\n (ch >= 'A' && ch <= 'F');\n}\n\nstatic inline bool IsNumberStartCharacter(int ch) {\n return IsADigit(ch);\n}\n\nstatic inline bool IsSeparatorOrDelimiterCharacter(int ch) {\n return IsASpace(ch) || IsDelimiterCharacter(ch);\n}\n\nstatic inline bool IsWordCharacter(int ch) {\n return IsWordStartCharacter(ch) || IsADigit(ch);\n}\n\nstatic inline bool IsWordStartCharacter(int ch) {\n return (isascii(ch) && isalpha(ch)) || ch == '_';\n}\n<commit_msg>Removed email address.<commit_after>\/\/ Scintilla source code edit control\n\/** @file LexSpice.cxx\n ** Lexer for Spice\n **\/\n\/\/ Copyright 2006 by Fabien Proriol\n\/\/ The License.txt file describes the conditions under which this software may be distributed.\n\n#include <stdlib.h>\n#include <ctype.h>\n#include <string.h>\n#include <stdio.h>\n\n#include \"Platform.h\"\n\n#include \"Accessor.h\"\n#include \"StyleContext.h\"\n#include \"PropSet.h\"\n#include \"KeyWords.h\"\n#include \"SciLexer.h\"\n#include \"SString.h\"\n\n\/*\n * Interface\n *\/\n\nstatic void ColouriseDocument(\n unsigned int startPos,\n int length,\n int initStyle,\n WordList *keywordlists[],\n Accessor &styler);\n\nstatic const char * const spiceWordListDesc[] = {\n \"Keywords\", \/\/ SPICE command\n \"Keywords2\", \/\/ SPICE functions\n \"Keywords3\", \/\/ SPICE params\n 0\n};\n\nLexerModule lmSpice(SCLEX_SPICE, ColouriseDocument, \"spice\", NULL, spiceWordListDesc);\n\n\/*\n * Implementation\n *\/\n\nstatic void ColouriseComment(StyleContext& sc, bool& apostropheStartsAttribute);\nstatic void ColouriseDelimiter(StyleContext& sc, bool& apostropheStartsAttribute);\nstatic void ColouriseNumber(StyleContext& sc, bool& apostropheStartsAttribute);\nstatic void ColouriseWhiteSpace(StyleContext& sc, bool& apostropheStartsAttribute);\nstatic void ColouriseWord(StyleContext& sc, WordList& keywords, WordList& keywords2, WordList& keywords3, bool& apostropheStartsAttribute);\n\nstatic inline bool IsDelimiterCharacter(int ch);\nstatic inline bool IsNumberStartCharacter(int ch);\nstatic inline bool IsNumberCharacter(int ch);\nstatic inline bool IsSeparatorOrDelimiterCharacter(int ch);\nstatic inline bool IsWordStartCharacter(int ch);\nstatic inline bool IsWordCharacter(int ch);\n\nstatic void ColouriseComment(StyleContext& sc, bool&) {\n sc.SetState(SCE_SPICE_COMMENTLINE);\n while (!sc.atLineEnd) {\n sc.Forward();\n }\n}\n\nstatic void ColouriseDelimiter(StyleContext& sc, bool& apostropheStartsAttribute) {\n apostropheStartsAttribute = sc.Match (')');\n sc.SetState(SCE_SPICE_DELIMITER);\n sc.ForwardSetState(SCE_SPICE_DEFAULT);\n}\n\nstatic void ColouriseNumber(StyleContext& sc, bool& apostropheStartsAttribute) {\n apostropheStartsAttribute = true;\n SString number;\n sc.SetState(SCE_SPICE_NUMBER);\n \/\/ Get all characters up to a delimiter or a separator, including points, but excluding\n \/\/ double points (ranges).\n while (!IsSeparatorOrDelimiterCharacter(sc.ch) || (sc.ch == '.' && sc.chNext != '.')) {\n number += static_cast<char>(sc.ch);\n sc.Forward();\n }\n \/\/ Special case: exponent with sign\n if ((sc.chPrev == 'e' || sc.chPrev == 'E') &&\n (sc.ch == '+' || sc.ch == '-')) {\n number += static_cast<char>(sc.ch);\n sc.Forward ();\n while (!IsSeparatorOrDelimiterCharacter(sc.ch)) {\n number += static_cast<char>(sc.ch);\n sc.Forward();\n }\n }\n sc.SetState(SCE_SPICE_DEFAULT);\n}\n\nstatic void ColouriseWhiteSpace(StyleContext& sc, bool& ) {\n sc.SetState(SCE_SPICE_DEFAULT);\n sc.ForwardSetState(SCE_SPICE_DEFAULT);\n}\n\nstatic void ColouriseWord(StyleContext& sc, WordList& keywords, WordList& keywords2, WordList& keywords3, bool& apostropheStartsAttribute) {\n apostropheStartsAttribute = true;\n sc.SetState(SCE_SPICE_IDENTIFIER);\n SString word;\n while (!sc.atLineEnd && !IsSeparatorOrDelimiterCharacter(sc.ch)) {\n word += static_cast<char>(tolower(sc.ch));\n sc.Forward();\n }\n if (keywords.InList(word.c_str())) {\n sc.ChangeState(SCE_SPICE_KEYWORD);\n if (word != \"all\") {\n apostropheStartsAttribute = false;\n }\n }\n else if (keywords2.InList(word.c_str())) {\n sc.ChangeState(SCE_SPICE_KEYWORD2);\n if (word != \"all\") {\n apostropheStartsAttribute = false;\n }\n }\n else if (keywords3.InList(word.c_str())) {\n sc.ChangeState(SCE_SPICE_KEYWORD3);\n if (word != \"all\") {\n apostropheStartsAttribute = false;\n }\n }\n sc.SetState(SCE_SPICE_DEFAULT);\n}\n\n\/\/\n\/\/ ColouriseDocument\n\/\/\nstatic void ColouriseDocument(\n unsigned int startPos,\n int length,\n int initStyle,\n WordList *keywordlists[],\n Accessor &styler) {\n WordList &keywords = *keywordlists[0];\n WordList &keywords2 = *keywordlists[1];\n WordList &keywords3 = *keywordlists[2];\n StyleContext sc(startPos, length, initStyle, styler);\n int lineCurrent = styler.GetLine(startPos);\n bool apostropheStartsAttribute = (styler.GetLineState(lineCurrent) & 1) != 0;\n while (sc.More()) {\n if (sc.atLineEnd) {\n \/\/ Go to the next line\n sc.Forward();\n lineCurrent++;\n \/\/ Remember the line state for future incremental lexing\n styler.SetLineState(lineCurrent, apostropheStartsAttribute);\n \/\/ Don't continue any styles on the next line\n sc.SetState(SCE_SPICE_DEFAULT);\n }\n \/\/ Comments\n if ((sc.Match('*') && sc.atLineStart) || sc.Match('*','~')) {\n ColouriseComment(sc, apostropheStartsAttribute);\n \/\/ Whitespace\n } else if (IsASpace(sc.ch)) {\n ColouriseWhiteSpace(sc, apostropheStartsAttribute);\n \/\/ Delimiters\n } else if (IsDelimiterCharacter(sc.ch)) {\n ColouriseDelimiter(sc, apostropheStartsAttribute);\n \/\/ Numbers\n } else if (IsADigit(sc.ch) || sc.ch == '#') {\n ColouriseNumber(sc, apostropheStartsAttribute);\n \/\/ Keywords or identifiers\n } else {\n ColouriseWord(sc, keywords, keywords2, keywords3, apostropheStartsAttribute);\n }\n }\n sc.Complete();\n}\n\nstatic inline bool IsDelimiterCharacter(int ch) {\n switch (ch) {\n case '&':\n case '\\'':\n case '(':\n case ')':\n case '*':\n case '+':\n case ',':\n case '-':\n case '.':\n case '\/':\n case ':':\n case ';':\n case '<':\n case '=':\n case '>':\n case '|':\n return true;\n default:\n return false;\n }\n}\n\nstatic inline bool IsNumberCharacter(int ch) {\n return IsNumberStartCharacter(ch) ||\n ch == '_' ||\n ch == '.' ||\n ch == '#' ||\n (ch >= 'a' && ch <= 'f') ||\n (ch >= 'A' && ch <= 'F');\n}\n\nstatic inline bool IsNumberStartCharacter(int ch) {\n return IsADigit(ch);\n}\n\nstatic inline bool IsSeparatorOrDelimiterCharacter(int ch) {\n return IsASpace(ch) || IsDelimiterCharacter(ch);\n}\n\nstatic inline bool IsWordCharacter(int ch) {\n return IsWordStartCharacter(ch) || IsADigit(ch);\n}\n\nstatic inline bool IsWordStartCharacter(int ch) {\n return (isascii(ch) && isalpha(ch)) || ch == '_';\n}\n<|endoftext|>"} {"text":"<commit_before>#include \"LuaCpp\/LuaException.hpp\"\n#include \"LuaCpp\/LuaTable.hpp\"\n\nnamespace luacpp\n{\n\tLuaTable LuaTable::create(lua_State* state)\n\t{\n\t\tLuaTable table;\n\n\t\tlua_newtable(state);\n\n\t\ttable.setReference(LuaReference::create(state));\n\n\t\tlua_pop(state, 1);\n\n\t\treturn table;\n\t}\n\n\tLuaTable::LuaTable() : LuaValue()\n\t{\n\t}\n\n\tLuaTable::LuaTable(const LuaTable& other) : LuaValue(other)\n\t{\n\t}\n\n\tLuaTable::~LuaTable()\n\t{\n\t}\n\n\tbool LuaTable::setMetatable(const LuaTable& table)\n\t{\n\t\tif (!table.getReference()->isValid())\n\t\t{\n\t\t\tthrow LuaException(\"Meta table reference is not valid!\");\n\t\t}\n\n\t\tthis->pushValue();\n\t\ttable.pushValue();\n\n\t\tlua_setmetatable(luaState, -2);\n\n\t\tlua_pop(luaState, 1);\n\n\t\treturn true;\n\t}\n\n\tvoid LuaTable::setReference(luacpp::LuaReferencePtr reference)\n\t{\n\t\treference->pushValue();\n\n\t\tlua_State* L = reference->getState();\n\n\t\tif (lua_type(L, -1) != LUA_TTABLE)\n\t\t{\n\t\t\tlua_pop(L, 1);\n\t\t\tthrow LuaException(\"Reference does not refere to a table!\");\n\t\t}\n\t\telse\n\t\t{\n\t\t\tlua_pop(L, 1);\n\t\t\tLuaValue::setReference(reference);\n\t\t}\n\t}\n\n\tsize_t LuaTable::getLength()\n\t{\n\t\tthis->pushValue();\n\n\t\tsize_t length = lua_objlen(luaState, -1);\n\n\t\tlua_pop(luaState, 1);\n\n\t\treturn length;\n\t}\n\n\tLuaTableIterator LuaTable::iterator()\n\t{\n\t\tthis->pushValue();\n\n\t\treturn LuaTableIterator(this);\n\t}\n\n\tLuaTableIterator::LuaTableIterator(LuaTable* parent) : parent(parent)\n\t{\n\t\t\/\/ Prepare the iteration\n\t\tlua_pushnil(parent->luaState);\n\t}\n\n\tbool LuaTableIterator::toNext()\n\t{\n\t\treturn lua_next(parent->luaState, -2) != 0;\n\t}\n}<commit_msg>Clean up the stack when we are done iterating<commit_after>#include \"LuaCpp\/LuaException.hpp\"\n#include \"LuaCpp\/LuaTable.hpp\"\n\nnamespace luacpp\n{\n\tLuaTable LuaTable::create(lua_State* state)\n\t{\n\t\tLuaTable table;\n\n\t\tlua_newtable(state);\n\n\t\ttable.setReference(LuaReference::create(state));\n\n\t\tlua_pop(state, 1);\n\n\t\treturn table;\n\t}\n\n\tLuaTable::LuaTable() : LuaValue()\n\t{\n\t}\n\n\tLuaTable::LuaTable(const LuaTable& other) : LuaValue(other)\n\t{\n\t}\n\n\tLuaTable::~LuaTable()\n\t{\n\t}\n\n\tbool LuaTable::setMetatable(const LuaTable& table)\n\t{\n\t\tif (!table.getReference()->isValid())\n\t\t{\n\t\t\tthrow LuaException(\"Meta table reference is not valid!\");\n\t\t}\n\n\t\tthis->pushValue();\n\t\ttable.pushValue();\n\n\t\tlua_setmetatable(luaState, -2);\n\n\t\tlua_pop(luaState, 1);\n\n\t\treturn true;\n\t}\n\n\tvoid LuaTable::setReference(luacpp::LuaReferencePtr reference)\n\t{\n\t\treference->pushValue();\n\n\t\tlua_State* L = reference->getState();\n\n\t\tif (lua_type(L, -1) != LUA_TTABLE)\n\t\t{\n\t\t\tlua_pop(L, 1);\n\t\t\tthrow LuaException(\"Reference does not refere to a table!\");\n\t\t}\n\t\telse\n\t\t{\n\t\t\tlua_pop(L, 1);\n\t\t\tLuaValue::setReference(reference);\n\t\t}\n\t}\n\n\tsize_t LuaTable::getLength()\n\t{\n\t\tthis->pushValue();\n\n\t\tsize_t length = lua_objlen(luaState, -1);\n\n\t\tlua_pop(luaState, 1);\n\n\t\treturn length;\n\t}\n\n\tLuaTableIterator LuaTable::iterator()\n\t{\n\t\tthis->pushValue();\n\n\t\treturn LuaTableIterator(this);\n\t}\n\n\tLuaTableIterator::LuaTableIterator(LuaTable* parent) : parent(parent)\n\t{\n\t\t\/\/ Prepare the iteration\n\t\tlua_pushnil(parent->luaState);\n\t}\n\n\tbool LuaTableIterator::toNext()\n\t{\n\t\tif (lua_next(parent->luaState, -2) == 0)\n\t\t{\n\t\t\t\/\/ Pop the table we are iterating\n\t\t\tlua_pop(parent->luaState, 1);\n\t\t\treturn false;\n\t\t}\n\t\telse\n\t\t{\n\t\t\treturn true;\n\t\t}\n\t}\n}<|endoftext|>"} {"text":"<commit_before>\/*! \\file MatTools.cpp\n \\brief Implements the MatTools class used by the Generic Repository \n \\author Kathryn D. Huff\n *\/\n#include <iostream>\n#include <fstream>\n#include <deque>\n#include <time.h>\n#include <assert.h>\n\n\n#include \"CycException.h\"\n#include \"CycLimits.h\"\n#include \"MatTools.h\"\n#include \"Material.h\"\n#include \"Logger.h\"\n#include \"Timer.h\"\n\nusing namespace std;\n\n\/\/- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - \npair<IsoVector, double> MatTools::sum_mats(deque<mat_rsrc_ptr> mats){\n IsoVector vec;\n CompMapPtr sum_comp = CompMapPtr(new CompMap(MASS));\n double tot = 0;\n double kg = 0;\n map<Iso, vector<double> > to_sum;\n vector<double> tot_vec;\n\n if( !mats.empty() ){ \n CompMapPtr comp_to_add;\n deque<mat_rsrc_ptr>::iterator mat;\n int iso;\n CompMap::const_iterator comp;\n for(mat = mats.begin(); mat != mats.end(); ++mat){ \n comp_to_add = (*mat)->unnormalizeComp(MASS, KG);\n for(comp = (*comp_to_add).begin(); comp != (*comp_to_add).end(); ++comp) {\n iso = comp->first;\n if(to_sum.find(iso)==to_sum.end()) {\n to_sum.insert(make_pair(iso, vector<double>()));\n }\n to_sum[iso].push_back(comp->second);\n }\n }\n map<Iso, vector<double> >::const_iterator it; \n for(it=to_sum.begin(); it!=to_sum.end(); ++it) { \n (*sum_comp)[(*it).first] = KahanSum((*it).second);\n tot_vec.push_back((*sum_comp)[iso]);\n }\n tot = KahanSum(tot_vec);\n } else {\n (*sum_comp)[92235] = 0;\n }\n vec = IsoVector(sum_comp);\n return make_pair(vec, tot);\n}\n\n\/\/- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - \ndouble MatTools::KahanSum(vector<double> input){\n \/\/ http:\/\/en.wikipedia.org\/wiki\/Kahan_summation_algorithm\n double y, t;\n double sum = 0.0;\n \/\/A running compensation for lost low-order bits.\n double c = 0.0; \n for(vector<double>::iterator i = input.begin(); i!=input.end(); ++i){\n y = *i - c;\n \/\/So far, so good: c is zero.\n t = sum + y;\n \/\/Alas, sum is big, y small, so low-order digits of y are lost.\n c = (t - sum) - y;\n \/\/(t - sum) recovers the high-order part of y; subtracting y recovers -(low part of y)\n sum = t;\n \/\/Algebraically, c should always be zero. Beware eagerly optimising compilers!\n \/\/Next time around, the lost low part will be added to y in a fresh attempt.\n }\n return sum;\n}\n\n\/\/- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - \nmat_rsrc_ptr MatTools::extract(const CompMapPtr comp_to_rem, double kg_to_rem, \n deque<mat_rsrc_ptr>& mat_list, double threshold){\n comp_to_rem->massify();\n mat_rsrc_ptr left_over = mat_rsrc_ptr(new Material(comp_to_rem));\n left_over->setQuantity(0);\n \/\/ absorb them together.\n while(!mat_list.empty()) { \n left_over->absorb(mat_list.back());\n mat_list.pop_back();\n }\n mat_rsrc_ptr to_ret;\n if( left_over->mass(KG) >= threshold ) {\n to_ret = left_over->extract(comp_to_rem, kg_to_rem, KG, threshold);\n mat_list.push_back(left_over);\n } else { \n to_ret = mat_rsrc_ptr(left_over);\n }\n return to_ret;\n}\n\n\/\/- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - \nIsoConcMap MatTools::comp_to_conc_map(CompMapPtr comp, double mass, double vol){\n MatTools::validate_finite_pos(vol);\n MatTools::validate_finite_pos(mass);\n comp->massify();\n\n IsoConcMap to_ret;\n if( vol==0 ) {\n to_ret = zeroConcMap();\n } else {\n int iso;\n double m_iso;\n CompMap::const_iterator it;\n it=(*comp).begin();\n while(it!= (*comp).end() ){\n iso = (*it).first;\n m_iso=((*it).second)*mass;\n to_ret.insert(make_pair(iso, m_iso\/vol));\n ++it;\n } \n }\n return to_ret;\n}\n\n\/\/- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - \nIsoConcMap MatTools::zeroConcMap(){\n IsoConcMap to_ret;\n to_ret[92235] = 0;\n return to_ret;\n}\n\/\/- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - \npair<CompMapPtr, double> MatTools::conc_to_comp_map(IsoConcMap conc, double vol){\n MatTools::validate_finite_pos(vol);\n\n CompMapPtr comp = CompMapPtr(new CompMap(MASS));\n double mass(0);\n int iso;\n double c_iso;\n double m_iso;\n CompMap::const_iterator it;\n it=conc.begin();\n while(it!= conc.end() ){\n iso = (*it).first;\n c_iso=((*it).second);\n m_iso = c_iso*vol;\n (*comp)[iso] = m_iso;\n mass+=m_iso;\n ++it;\n } \n (*comp).normalize();\n pair<CompMapPtr, double> to_ret = make_pair(CompMapPtr(comp), mass);\n return to_ret;\n}\n\n\/\/- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - \ndouble MatTools::V_f(double V_T, double theta){\n validate_percent(theta);\n validate_finite_pos(V_T);\n return theta*V_T;\n}\n\n\/\/- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - \ndouble MatTools::V_ff(double V_T, double theta, double d){\n validate_percent(d);\n return d*V_f(V_T, theta);\n}\n\n\/\/- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - \ndouble MatTools::V_mf(double V_T, double theta, double d){\n return (V_f(V_T,theta) - V_ff(V_T, theta, d));\n}\n\n\/\/- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - \ndouble MatTools::V_s(double V_T, double theta){\n return (V_T - V_f(V_T, theta));\n}\n\n\/\/- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - \ndouble MatTools::V_ds(double V_T, double theta, double d){\n validate_percent(d);\n return d*V_s(V_T, theta);\n}\n\n\/\/- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - \ndouble MatTools::V_ms(double V_T, double theta, double d){\n return (V_s(V_T, theta) - V_ds(V_T, theta, d));\n}\n\n\/\/- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - \nvoid MatTools::validate_percent(double per){\n if( per <= 1 && per >= 0 ){\n return;\n } else if ( per < 0) {\n throw CycRangeException(\"The value is not a valid percent. It is less than zero.\");\n } else if ( per > 1) {\n throw CycRangeException(\"The value is not a valid percent. It is greater than one.\");\n }\n}\n\n\/\/- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - \nvoid MatTools::validate_finite_pos(double pos){\n if ( pos >= numeric_limits<double>::infinity() ) {\n throw CycRangeException(\"The value is not positive and finite. It is infinite.\");\n } \n validate_pos(pos);\n}\n\n\/\/- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - \nvoid MatTools::validate_pos(double pos){\n if ( pos < 0) {\n std::stringstream ss;\n ss << \"The value \" \n << pos\n << \" is not positive and finite. It is less than zero.\" ;;\n throw CycRangeException(ss.str());\n }\n}\n\n\/\/- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - \nvoid MatTools::validate_nonzero(double nonzero){\n if ( nonzero == 0 )\n throw CycRangeException(\"The value is zero.\");\n}\n\n\/\/- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - \nIsoConcMap MatTools::scaleConcMap(IsoConcMap C_0, double scalar){\n MatTools::validate_finite_pos(scalar);\n double orig;\n IsoConcMap::const_iterator it;\n for(it = C_0.begin(); it != C_0.end(); ++it) { \n orig = C_0[(*it).first];\n C_0[(*it).first] = orig*scalar;\n }\n return C_0;\n}\n\n\/\/- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - \nIsoConcMap MatTools::addConcMaps(IsoConcMap orig, IsoConcMap to_add){\n IsoConcMap to_ret;\n IsoConcMap::const_iterator it;\n for(it = orig.begin(); it != orig.end(); ++it) {\n Iso iso=(*it).first;\n if(to_add.find(iso) != to_add.end()) {\n to_ret[iso] = (*it).second + to_add[iso];\n } else {\n to_ret[iso] = (*it).second;\n }\n }\n for(it = to_add.begin(); it != to_add.end(); ++it) {\n Iso iso=(*it).first;\n if(orig.find(iso) == orig.end()) {\n to_ret[iso] = (*it).second;\n }\n }\n return to_ret;\n}\n\n\/\/- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - \npair<CompMapPtr, double> MatTools::subtractCompMaps(pair<CompMapPtr, double> orig_pair, pair<CompMapPtr, double> to_subtract_pair){\n CompMapPtr orig = CompMapPtr(orig_pair.first);\n double o_kg = orig_pair.second;\n CompMapPtr to_subtract = CompMapPtr(to_subtract_pair.first);\n double s_kg = to_subtract_pair.second;\n CompMapPtr to_ret = CompMapPtr(new CompMap(MASS));\n double to_ret_kg = 0;\n\n CompMap::const_iterator it;\n for(it = (*orig).begin(); it != (*orig).end(); ++it) {\n Iso iso=(*it).first;\n if(to_subtract->map().find(iso) != to_subtract->map().end()) {\n (*to_ret)[iso] = (*it).second*o_kg - (*to_subtract)[iso]*s_kg;\n } else {\n (*to_ret)[iso] = (*it).second*o_kg;\n }\n to_ret_kg += (*to_ret)[iso];\n }\n for(it = (*to_subtract).begin(); it != (*to_subtract).end(); ++it) {\n Iso iso=(*it).first;\n if(orig->map().find(iso) == orig->map().end()) {\n std::stringstream msg_ss;\n msg_ss << \"Cannot subtract a superset of isotopes from a subset\";\n LOG(LEV_ERROR, \"GRDRNuc\") <<msg_ss.str();;\n throw CycNegativeValueException(msg_ss.str());\n }\n }\n return make_pair(CompMapPtr(to_ret), to_ret_kg);\n}\n\n\/\/- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - \nint MatTools::isoToElem(int iso) { \n int N = iso % 1000;\n return (iso-N)\/1000;\n}\n\n\n\/\/- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - \nvector<double> MatTools::linspace(double a, double b, int n) {\n vector<double> array(0); \/\/ optional preallocation\n double step = (b-a)\/(n-1);\n while(a <= b) {\n array.push_back(a);\n a += step; \/\/ could recode to better handle rounding errors\n }\n return array;\n}\n\n\n<commit_msg>iso had no meaning where I was using it. better now.<commit_after>\/*! \\file MatTools.cpp\n \\brief Implements the MatTools class used by the Generic Repository \n \\author Kathryn D. Huff\n *\/\n#include <iostream>\n#include <fstream>\n#include <deque>\n#include <time.h>\n#include <assert.h>\n\n\n#include \"CycException.h\"\n#include \"CycLimits.h\"\n#include \"MatTools.h\"\n#include \"Material.h\"\n#include \"Logger.h\"\n#include \"Timer.h\"\n\nusing namespace std;\n\n\/\/- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - \npair<IsoVector, double> MatTools::sum_mats(deque<mat_rsrc_ptr> mats){\n IsoVector vec;\n CompMapPtr sum_comp = CompMapPtr(new CompMap(MASS));\n double tot = 0;\n double kg = 0;\n map<Iso, vector<double> > to_sum;\n vector<double> tot_vec;\n\n if( !mats.empty() ){ \n CompMapPtr comp_to_add;\n deque<mat_rsrc_ptr>::iterator mat;\n int iso;\n CompMap::const_iterator comp;\n for(mat = mats.begin(); mat != mats.end(); ++mat){ \n comp_to_add = (*mat)->unnormalizeComp(MASS, KG);\n for(comp = (*comp_to_add).begin(); comp != (*comp_to_add).end(); ++comp) {\n iso = comp->first;\n if(to_sum.find(iso)==to_sum.end()) {\n to_sum.insert(make_pair(iso, vector<double>()));\n }\n to_sum[iso].push_back(comp->second);\n }\n }\n map<Iso, vector<double> >::const_iterator it; \n for(it=to_sum.begin(); it!=to_sum.end(); ++it) { \n iso = (*it).first;\n (*sum_comp)[iso] = KahanSum((*it).second);\n tot_vec.push_back((*sum_comp)[iso]);\n }\n tot = KahanSum(tot_vec);\n } else {\n (*sum_comp)[92235] = 0;\n }\n vec = IsoVector(sum_comp);\n return make_pair(vec, tot);\n}\n\n\/\/- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - \ndouble MatTools::KahanSum(vector<double> input){\n \/\/ http:\/\/en.wikipedia.org\/wiki\/Kahan_summation_algorithm\n double y, t;\n double sum = 0.0;\n \/\/A running compensation for lost low-order bits.\n double c = 0.0; \n for(vector<double>::iterator i = input.begin(); i!=input.end(); ++i){\n y = *i - c;\n \/\/So far, so good: c is zero.\n t = sum + y;\n \/\/Alas, sum is big, y small, so low-order digits of y are lost.\n c = (t - sum) - y;\n \/\/(t - sum) recovers the high-order part of y; subtracting y recovers -(low part of y)\n sum = t;\n \/\/Algebraically, c should always be zero. Beware eagerly optimising compilers!\n \/\/Next time around, the lost low part will be added to y in a fresh attempt.\n }\n return sum;\n}\n\n\/\/- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - \nmat_rsrc_ptr MatTools::extract(const CompMapPtr comp_to_rem, double kg_to_rem, \n deque<mat_rsrc_ptr>& mat_list, double threshold){\n comp_to_rem->massify();\n mat_rsrc_ptr left_over = mat_rsrc_ptr(new Material(comp_to_rem));\n left_over->setQuantity(0);\n \/\/ absorb them together.\n while(!mat_list.empty()) { \n left_over->absorb(mat_list.back());\n mat_list.pop_back();\n }\n mat_rsrc_ptr to_ret;\n if( left_over->mass(KG) >= threshold ) {\n to_ret = left_over->extract(comp_to_rem, kg_to_rem, KG, threshold);\n mat_list.push_back(left_over);\n } else { \n to_ret = mat_rsrc_ptr(left_over);\n }\n return to_ret;\n}\n\n\/\/- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - \nIsoConcMap MatTools::comp_to_conc_map(CompMapPtr comp, double mass, double vol){\n MatTools::validate_finite_pos(vol);\n MatTools::validate_finite_pos(mass);\n comp->massify();\n\n IsoConcMap to_ret;\n if( vol==0 ) {\n to_ret = zeroConcMap();\n } else {\n int iso;\n double m_iso;\n CompMap::const_iterator it;\n it=(*comp).begin();\n while(it!= (*comp).end() ){\n iso = (*it).first;\n m_iso=((*it).second)*mass;\n to_ret.insert(make_pair(iso, m_iso\/vol));\n ++it;\n } \n }\n return to_ret;\n}\n\n\/\/- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - \nIsoConcMap MatTools::zeroConcMap(){\n IsoConcMap to_ret;\n to_ret[92235] = 0;\n return to_ret;\n}\n\/\/- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - \npair<CompMapPtr, double> MatTools::conc_to_comp_map(IsoConcMap conc, double vol){\n MatTools::validate_finite_pos(vol);\n\n CompMapPtr comp = CompMapPtr(new CompMap(MASS));\n double mass(0);\n int iso;\n double c_iso;\n double m_iso;\n CompMap::const_iterator it;\n it=conc.begin();\n while(it!= conc.end() ){\n iso = (*it).first;\n c_iso=((*it).second);\n m_iso = c_iso*vol;\n (*comp)[iso] = m_iso;\n mass+=m_iso;\n ++it;\n } \n (*comp).normalize();\n pair<CompMapPtr, double> to_ret = make_pair(CompMapPtr(comp), mass);\n return to_ret;\n}\n\n\/\/- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - \ndouble MatTools::V_f(double V_T, double theta){\n validate_percent(theta);\n validate_finite_pos(V_T);\n return theta*V_T;\n}\n\n\/\/- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - \ndouble MatTools::V_ff(double V_T, double theta, double d){\n validate_percent(d);\n return d*V_f(V_T, theta);\n}\n\n\/\/- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - \ndouble MatTools::V_mf(double V_T, double theta, double d){\n return (V_f(V_T,theta) - V_ff(V_T, theta, d));\n}\n\n\/\/- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - \ndouble MatTools::V_s(double V_T, double theta){\n return (V_T - V_f(V_T, theta));\n}\n\n\/\/- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - \ndouble MatTools::V_ds(double V_T, double theta, double d){\n validate_percent(d);\n return d*V_s(V_T, theta);\n}\n\n\/\/- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - \ndouble MatTools::V_ms(double V_T, double theta, double d){\n return (V_s(V_T, theta) - V_ds(V_T, theta, d));\n}\n\n\/\/- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - \nvoid MatTools::validate_percent(double per){\n if( per <= 1 && per >= 0 ){\n return;\n } else if ( per < 0) {\n throw CycRangeException(\"The value is not a valid percent. It is less than zero.\");\n } else if ( per > 1) {\n throw CycRangeException(\"The value is not a valid percent. It is greater than one.\");\n }\n}\n\n\/\/- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - \nvoid MatTools::validate_finite_pos(double pos){\n if ( pos >= numeric_limits<double>::infinity() ) {\n throw CycRangeException(\"The value is not positive and finite. It is infinite.\");\n } \n validate_pos(pos);\n}\n\n\/\/- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - \nvoid MatTools::validate_pos(double pos){\n if ( pos < 0) {\n std::stringstream ss;\n ss << \"The value \" \n << pos\n << \" is not positive and finite. It is less than zero.\" ;;\n throw CycRangeException(ss.str());\n }\n}\n\n\/\/- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - \nvoid MatTools::validate_nonzero(double nonzero){\n if ( nonzero == 0 )\n throw CycRangeException(\"The value is zero.\");\n}\n\n\/\/- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - \nIsoConcMap MatTools::scaleConcMap(IsoConcMap C_0, double scalar){\n MatTools::validate_finite_pos(scalar);\n double orig;\n IsoConcMap::const_iterator it;\n for(it = C_0.begin(); it != C_0.end(); ++it) { \n orig = C_0[(*it).first];\n C_0[(*it).first] = orig*scalar;\n }\n return C_0;\n}\n\n\/\/- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - \nIsoConcMap MatTools::addConcMaps(IsoConcMap orig, IsoConcMap to_add){\n IsoConcMap to_ret;\n IsoConcMap::const_iterator it;\n for(it = orig.begin(); it != orig.end(); ++it) {\n Iso iso=(*it).first;\n if(to_add.find(iso) != to_add.end()) {\n to_ret[iso] = (*it).second + to_add[iso];\n } else {\n to_ret[iso] = (*it).second;\n }\n }\n for(it = to_add.begin(); it != to_add.end(); ++it) {\n Iso iso=(*it).first;\n if(orig.find(iso) == orig.end()) {\n to_ret[iso] = (*it).second;\n }\n }\n return to_ret;\n}\n\n\/\/- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - \npair<CompMapPtr, double> MatTools::subtractCompMaps(pair<CompMapPtr, double> orig_pair, pair<CompMapPtr, double> to_subtract_pair){\n CompMapPtr orig = CompMapPtr(orig_pair.first);\n double o_kg = orig_pair.second;\n CompMapPtr to_subtract = CompMapPtr(to_subtract_pair.first);\n double s_kg = to_subtract_pair.second;\n CompMapPtr to_ret = CompMapPtr(new CompMap(MASS));\n double to_ret_kg = 0;\n\n CompMap::const_iterator it;\n for(it = (*orig).begin(); it != (*orig).end(); ++it) {\n Iso iso=(*it).first;\n if(to_subtract->map().find(iso) != to_subtract->map().end()) {\n (*to_ret)[iso] = (*it).second*o_kg - (*to_subtract)[iso]*s_kg;\n } else {\n (*to_ret)[iso] = (*it).second*o_kg;\n }\n to_ret_kg += (*to_ret)[iso];\n }\n for(it = (*to_subtract).begin(); it != (*to_subtract).end(); ++it) {\n Iso iso=(*it).first;\n if(orig->map().find(iso) == orig->map().end()) {\n std::stringstream msg_ss;\n msg_ss << \"Cannot subtract a superset of isotopes from a subset\";\n LOG(LEV_ERROR, \"GRDRNuc\") <<msg_ss.str();;\n throw CycNegativeValueException(msg_ss.str());\n }\n }\n return make_pair(CompMapPtr(to_ret), to_ret_kg);\n}\n\n\/\/- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - \nint MatTools::isoToElem(int iso) { \n int N = iso % 1000;\n return (iso-N)\/1000;\n}\n\n\n\/\/- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - \nvector<double> MatTools::linspace(double a, double b, int n) {\n vector<double> array(0); \/\/ optional preallocation\n double step = (b-a)\/(n-1);\n while(a <= b) {\n array.push_back(a);\n a += step; \/\/ could recode to better handle rounding errors\n }\n return array;\n}\n\n\n<|endoftext|>"} {"text":"<commit_before>\/*! \\file MatTools.cpp\n \\brief Implements the MatTools class used by the Generic Repository \n \\author Kathryn D. Huff\n *\/\n#include <iostream>\n#include <fstream>\n#include <deque>\n#include <time.h>\n#include <assert.h>\n\n\n#include \"CycException.h\"\n#include \"Logger.h\"\n#include \"Timer.h\"\n#include \"MatTools.h\"\n#include \"Material.h\"\n\nusing namespace std;\n\n\/\/- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - \npair<IsoVector, double> MatTools::sum_mats(deque<mat_rsrc_ptr> mats){\n IsoVector vec;\n CompMapPtr sum_comp = CompMapPtr(new CompMap(MASS));\n double kg = 0;\n\n if( !mats.empty() ){ \n CompMapPtr comp_to_add;\n deque<mat_rsrc_ptr>::iterator mat;\n int iso;\n CompMap::const_iterator comp;\n\n for(mat = mats.begin(); mat != mats.end(); ++mat){ \n kg += (*mat)->mass(MassUnit(KG));\n comp_to_add = (*mat)->isoVector().comp();\n comp_to_add->massify();\n for(comp = (*comp_to_add).begin(); comp != (*comp_to_add).end(); ++comp) {\n iso = comp->first;\n if(sum_comp->count(iso)!=0) {\n (*sum_comp)[iso] = (*sum_comp)[iso] + (comp->second)*kg;\n } else { \n (*sum_comp)[iso] = (comp->second)*kg;\n }\n }\n }\n } else {\n (*sum_comp)[92235] = 0;\n }\n vec = IsoVector(sum_comp);\n return make_pair(vec, kg);\n}\n\n\/\/- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - \nmat_rsrc_ptr MatTools::extract(const CompMapPtr comp_to_rem, double kg_to_rem, deque<mat_rsrc_ptr>& mat_list){\n mat_rsrc_ptr left_over = mat_rsrc_ptr(new Material(comp_to_rem));\n left_over->setQuantity(0);\n while(!mat_list.empty()) { \n left_over->absorb(mat_list.back());\n mat_list.pop_back();\n }\n mat_rsrc_ptr to_ret = left_over->extract(comp_to_rem, kg_to_rem);\n mat_list.push_back(left_over);\n return to_ret;\n}\n\n\/\/- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - \nIsoConcMap MatTools::comp_to_conc_map(CompMapPtr comp, double mass, double vol){\n MatTools::validate_finite_pos(vol);\n MatTools::validate_finite_pos(mass);\n\n IsoConcMap to_ret;\n int iso;\n double m_iso;\n CompMap::const_iterator it;\n it=(*comp).begin();\n while(it!= (*comp).end() ){\n iso = (*it).first;\n m_iso=((*it).second)*mass;\n to_ret.insert(make_pair(iso, m_iso\/vol));\n ++it;\n } \n return to_ret;\n}\n\n\/\/- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - \npair<CompMapPtr, double> MatTools::conc_to_comp_map(IsoConcMap conc, double vol){\n MatTools::validate_finite_pos(vol);\n\n CompMapPtr comp = CompMapPtr(new CompMap(MASS));\n double mass;\n int iso;\n double c_iso;\n double m_iso;\n CompMap::const_iterator it;\n it=conc.begin();\n while(it!= conc.end() ){\n iso = (*it).first;\n c_iso=((*it).second);\n m_iso = c_iso*vol;\n (*comp)[iso] = m_iso;\n mass+=m_iso;\n ++it;\n } \n (*comp).normalize();\n pair<CompMapPtr, double> to_ret = make_pair(comp, mass);\n return to_ret;\n}\n\n\/\/- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - \ndouble MatTools::V_f(double V_T, double theta){\n validate_percent(theta);\n validate_finite_pos(V_T);\n return theta*V_T;\n}\n\n\/\/- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - \ndouble MatTools::V_ff(double V_T, double theta, double d){\n validate_percent(d);\n return d*V_f(V_T, theta);\n}\n\n\/\/- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - \ndouble MatTools::V_mf(double V_T, double theta, double d){\n return (V_f(V_T,theta) - V_ff(V_T, theta, d));\n}\n\n\/\/- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - \ndouble MatTools::V_s(double V_T, double theta){\n return (V_T - V_f(V_T, theta));\n}\n\n\/\/- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - \ndouble MatTools::V_ds(double V_T, double theta, double d){\n validate_percent(d);\n return d*V_s(V_T, theta);\n}\n\n\/\/- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - \ndouble MatTools::V_ms(double V_T, double theta, double d){\n return (V_s(V_T, theta) - V_ds(V_T, theta, d));\n}\n\n\/\/- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - \nvoid MatTools::validate_percent(double per){\n if( per <= 1 && per >= 0 ){\n return;\n } else if ( per < 0) {\n throw CycRangeException(\"The value is not a valid percent. It is less than zero.\");\n } else if ( per > 1) {\n throw CycRangeException(\"The value is not a valid percent. It is greater than one.\");\n }\n}\n\n\/\/- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - \nvoid MatTools::validate_finite_pos(double pos){\n if( pos >= 0 ){\n return;\n } else if ( pos < 0) {\n throw CycRangeException(\"The value is not positive and finite. It is less than zero.\");\n } else if ( pos >= numeric_limits<double>::infinity() ) {\n throw CycRangeException(\"The value is not positive and finite. It is greater than infty.\");\n }\n\n}\n\n\/\/- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - \nIsoConcMap MatTools::scaleConcMap(IsoConcMap C_0, double scalar){\n double orig;\n IsoConcMap::iterator it;\n for(it = C_0.begin(); it != C_0.end(); ++it) { \n orig = C_0[(*it).first];\n C_0[(*it).first] = orig*scalar;\n }\n return C_0;\n}\n<commit_msg>uninitialized variable<commit_after>\/*! \\file MatTools.cpp\n \\brief Implements the MatTools class used by the Generic Repository \n \\author Kathryn D. Huff\n *\/\n#include <iostream>\n#include <fstream>\n#include <deque>\n#include <time.h>\n#include <assert.h>\n\n\n#include \"CycException.h\"\n#include \"Logger.h\"\n#include \"Timer.h\"\n#include \"MatTools.h\"\n#include \"Material.h\"\n\nusing namespace std;\n\n\/\/- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - \npair<IsoVector, double> MatTools::sum_mats(deque<mat_rsrc_ptr> mats){\n IsoVector vec;\n CompMapPtr sum_comp = CompMapPtr(new CompMap(MASS));\n double kg = 0;\n\n if( !mats.empty() ){ \n CompMapPtr comp_to_add;\n deque<mat_rsrc_ptr>::iterator mat;\n int iso;\n CompMap::const_iterator comp;\n\n for(mat = mats.begin(); mat != mats.end(); ++mat){ \n kg += (*mat)->mass(MassUnit(KG));\n comp_to_add = (*mat)->isoVector().comp();\n comp_to_add->massify();\n for(comp = (*comp_to_add).begin(); comp != (*comp_to_add).end(); ++comp) {\n iso = comp->first;\n if(sum_comp->count(iso)!=0) {\n (*sum_comp)[iso] = (*sum_comp)[iso] + (comp->second)*kg;\n } else { \n (*sum_comp)[iso] = (comp->second)*kg;\n }\n }\n }\n } else {\n (*sum_comp)[92235] = 0;\n }\n vec = IsoVector(sum_comp);\n return make_pair(vec, kg);\n}\n\n\/\/- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - \nmat_rsrc_ptr MatTools::extract(const CompMapPtr comp_to_rem, double kg_to_rem, deque<mat_rsrc_ptr>& mat_list){\n mat_rsrc_ptr left_over = mat_rsrc_ptr(new Material(comp_to_rem));\n left_over->setQuantity(0);\n while(!mat_list.empty()) { \n left_over->absorb(mat_list.back());\n mat_list.pop_back();\n }\n mat_rsrc_ptr to_ret = left_over->extract(comp_to_rem, kg_to_rem);\n mat_list.push_back(left_over);\n return to_ret;\n}\n\n\/\/- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - \nIsoConcMap MatTools::comp_to_conc_map(CompMapPtr comp, double mass, double vol){\n MatTools::validate_finite_pos(vol);\n MatTools::validate_finite_pos(mass);\n\n IsoConcMap to_ret;\n int iso;\n double m_iso;\n CompMap::const_iterator it;\n it=(*comp).begin();\n while(it!= (*comp).end() ){\n iso = (*it).first;\n m_iso=((*it).second)*mass;\n to_ret.insert(make_pair(iso, m_iso\/vol));\n ++it;\n } \n return to_ret;\n}\n\n\/\/- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - \npair<CompMapPtr, double> MatTools::conc_to_comp_map(IsoConcMap conc, double vol){\n MatTools::validate_finite_pos(vol);\n\n CompMapPtr comp = CompMapPtr(new CompMap(MASS));\n double mass(0);\n int iso;\n double c_iso;\n double m_iso;\n CompMap::const_iterator it;\n it=conc.begin();\n while(it!= conc.end() ){\n iso = (*it).first;\n c_iso=((*it).second);\n m_iso = c_iso*vol;\n (*comp)[iso] = m_iso;\n mass+=m_iso;\n ++it;\n } \n (*comp).normalize();\n pair<CompMapPtr, double> to_ret = make_pair(comp, mass);\n return to_ret;\n}\n\n\/\/- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - \ndouble MatTools::V_f(double V_T, double theta){\n validate_percent(theta);\n validate_finite_pos(V_T);\n return theta*V_T;\n}\n\n\/\/- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - \ndouble MatTools::V_ff(double V_T, double theta, double d){\n validate_percent(d);\n return d*V_f(V_T, theta);\n}\n\n\/\/- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - \ndouble MatTools::V_mf(double V_T, double theta, double d){\n return (V_f(V_T,theta) - V_ff(V_T, theta, d));\n}\n\n\/\/- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - \ndouble MatTools::V_s(double V_T, double theta){\n return (V_T - V_f(V_T, theta));\n}\n\n\/\/- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - \ndouble MatTools::V_ds(double V_T, double theta, double d){\n validate_percent(d);\n return d*V_s(V_T, theta);\n}\n\n\/\/- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - \ndouble MatTools::V_ms(double V_T, double theta, double d){\n return (V_s(V_T, theta) - V_ds(V_T, theta, d));\n}\n\n\/\/- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - \nvoid MatTools::validate_percent(double per){\n if( per <= 1 && per >= 0 ){\n return;\n } else if ( per < 0) {\n throw CycRangeException(\"The value is not a valid percent. It is less than zero.\");\n } else if ( per > 1) {\n throw CycRangeException(\"The value is not a valid percent. It is greater than one.\");\n }\n}\n\n\/\/- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - \nvoid MatTools::validate_finite_pos(double pos){\n if( pos >= 0 ){\n return;\n } else if ( pos < 0) {\n throw CycRangeException(\"The value is not positive and finite. It is less than zero.\");\n } else if ( pos >= numeric_limits<double>::infinity() ) {\n throw CycRangeException(\"The value is not positive and finite. It is greater than infty.\");\n }\n\n}\n\n\/\/- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - \nIsoConcMap MatTools::scaleConcMap(IsoConcMap C_0, double scalar){\n double orig;\n IsoConcMap::iterator it;\n for(it = C_0.begin(); it != C_0.end(); ++it) { \n orig = C_0[(*it).first];\n C_0[(*it).first] = orig*scalar;\n }\n return C_0;\n}\n<|endoftext|>"} {"text":"<commit_before>#include \"Material.h\"\n#include \"Filesystem.h\"\n#include \"kit\/log\/log.h\"\n#include <boost\/filesystem.hpp>\n#include <vector>\n#include <fstream>\n#include <sstream>\n#include <string>\n#include <algorithm>\nusing namespace std;\nnamespace fs = boost::filesystem;\n\nconst std::vector<std::string> Material :: s_ExtraMapNames = {\n \"NRM\",\n \"DISP\",\n \"SPEC\",\n \"OCC\"\n};\n\nMaterial :: Material(\n const std::string& fn,\n Cache<Resource, std::string>* cache\n):\n m_Filename(fn),\n m_pCache(cache)\n{\n string fn_real = Filesystem::cutInternal(fn);\n string ext = Filesystem::getExtension(fn_real);\n string cut = Filesystem::cutExtension(fn_real);\n string emb = Filesystem::getInternal(fn);\n if(ext == \"mtl\")\n load_mtllib(fn_real, emb);\n else if(ext == \"json\")\n load_json(fn);\n else {\n static unsigned class_id = cache->class_id(\"texture\");\n m_Textures.push_back(make_shared<Texture>(\n tuple<string, ICache*>(fn, cache)\n ));\n for(auto&& t: s_ExtraMapNames) {\n auto tfn = cut + \"_\" + t + \".\" + ext;\n tfn = cache->transform(tfn);\n if(fs::exists(\n fs::path(tfn)\n )){\n m_Textures.push_back(make_shared<Texture>(\n tuple<string, ICache*>(tfn, cache)\n ));\n }else{\n \/\/break;\n }\n }\n }\n}\n\nvoid Material :: load_json(string fn)\n{\n \/\/ ??? m_bComposite = true;\n}\n\nvoid Material :: load_mtllib(string fn, string material)\n{\n m_bComposite = true;\n \n fstream f(fn);\n if(!f.good()) {\n ERROR(READ, Filesystem::getFileName(fn) + \":\" + material);\n }\n \n string itr_material;\n string line;\n while(getline(f, line))\n {\n istringstream ss(line);\n string nothing;\n ss >> nothing;\n if(boost::starts_with(line, \"newmtl\")) {\n ss >> itr_material;\n continue;\n }\n if(material != itr_material)\n continue;\n if(boost::starts_with(line, \"map_Kd\"))\n {\n string tfn;\n ss >> tfn;\n tfn = Filesystem::getFileName(tfn);\n \n auto tex = m_pCache->cache_as<ITexture>(tfn);\n \/\/ should throw instead of returning null\n assert(tex);\n m_Textures.push_back(tex);\n }\n }\n}\n\nMaterial :: ~Material()\n{\n}\n\n\/\/unsigned int Material :: id(Pass* pass) const\n\/\/{\n\/\/ return 0;\n\/\/}\n\nvoid Material :: bind(Pass* pass, unsigned slot) const\n{\n \/\/const unsigned sz = m_Textures.size();\n const unsigned sz = min<unsigned>(1, m_Textures.size());\n \/\/ prevents pointless texture_slots state change for proxy material\n if(!m_bComposite) {\n pass->texture_slots(0);\n \/\/unsigned slot_bits = 0;\n \/\/for(unsigned i=0; i<sz; ++i) {\n \/\/ if(m_Textures[i])\n \/\/ slot_bits |= 1 << i;\n \/\/}\n \/\/pass->texture_slots(slot_bits);\n }\n if(sz){\n for(unsigned i=0; i<sz; ++i) {\n if(m_Textures[i])\n m_Textures[i]->bind(pass, i);\n else {\n pass->texture(0,i);\n break;\n }\n }\n }else{\n pass->texture(0,0);\n }\n}\n\n\/*static*\/ bool Material :: supported(\n string fn,\n Cache<Resource, std::string>* cache\n){\n string fn_real = Filesystem::cutInternal(Filesystem::getFileName(fn));\n string ext = Filesystem::getExtension(fn_real);\n string cut = Filesystem::cutExtension(fn_real);\n string emb = Filesystem::getInternal(fn);\n \n if(ext==\"mtllib\")\n return true;\n else if(ext==\"json\")\n return true;\n\n unsigned compat = 0U;\n for(auto&& t: s_ExtraMapNames) {\n auto tfn = cut + \"_\" + t + \".\" + ext;\n tfn = cache->transform(tfn);\n if(fs::exists(\n fs::path(tfn)\n )){\n ++compat;\n }\n }\n \/\/ all detail maps exist\n return compat;\n \/\/if(compat == s_ExtraMapNames.size())\n \/\/ return true;\n \/\/ partial compatibility probably means user forgot one, so we'll warn\n \/\/if(compat)\n \/\/{\n \/\/ \/\/ TODO: remove this warning\n \/\/ \/\/WARNINGf(\"Material \\\"%s\\\" is missing %s out of %s detail maps\",\n \/\/ \/\/ Filesystem::getFileName(fn) %\n \/\/ \/\/ (s_ExtraMapNames.size() - compat) %\n \/\/ \/\/ s_ExtraMapNames.size()\n \/\/ \/\/);\n \/\/}\n \/\/return false;\n}\n\n<commit_msg>fixed incorrect size check<commit_after>#include \"Material.h\"\n#include \"Filesystem.h\"\n#include \"kit\/log\/log.h\"\n#include <boost\/filesystem.hpp>\n#include <vector>\n#include <fstream>\n#include <sstream>\n#include <string>\n#include <algorithm>\nusing namespace std;\nnamespace fs = boost::filesystem;\n\nconst std::vector<std::string> Material :: s_ExtraMapNames = {\n \"NRM\",\n \"DISP\",\n \"SPEC\",\n \"OCC\"\n};\n\nMaterial :: Material(\n const std::string& fn,\n Cache<Resource, std::string>* cache\n):\n m_Filename(fn),\n m_pCache(cache)\n{\n string fn_real = Filesystem::cutInternal(fn);\n string ext = Filesystem::getExtension(fn_real);\n string cut = Filesystem::cutExtension(fn_real);\n string emb = Filesystem::getInternal(fn);\n if(ext == \"mtl\")\n load_mtllib(fn_real, emb);\n else if(ext == \"json\")\n load_json(fn);\n else {\n static unsigned class_id = cache->class_id(\"texture\");\n m_Textures.push_back(make_shared<Texture>(\n tuple<string, ICache*>(fn, cache)\n ));\n for(auto&& t: s_ExtraMapNames) {\n auto tfn = cut + \"_\" + t + \".\" + ext;\n tfn = cache->transform(tfn);\n if(fs::exists(\n fs::path(tfn)\n )){\n m_Textures.push_back(make_shared<Texture>(\n tuple<string, ICache*>(tfn, cache)\n ));\n }else{\n \/\/break;\n }\n }\n }\n}\n\nvoid Material :: load_json(string fn)\n{\n \/\/ ??? m_bComposite = true;\n}\n\nvoid Material :: load_mtllib(string fn, string material)\n{\n m_bComposite = true;\n \n fstream f(fn);\n if(!f.good()) {\n ERROR(READ, Filesystem::getFileName(fn) + \":\" + material);\n }\n \n string itr_material;\n string line;\n while(getline(f, line))\n {\n istringstream ss(line);\n string nothing;\n ss >> nothing;\n if(boost::starts_with(line, \"newmtl\")) {\n ss >> itr_material;\n continue;\n }\n if(material != itr_material)\n continue;\n if(boost::starts_with(line, \"map_Kd\"))\n {\n string tfn;\n ss >> tfn;\n tfn = Filesystem::getFileName(tfn);\n \n auto tex = m_pCache->cache_as<ITexture>(tfn);\n \/\/ should throw instead of returning null\n assert(tex);\n m_Textures.push_back(tex);\n }\n }\n}\n\nMaterial :: ~Material()\n{\n}\n\n\/\/unsigned int Material :: id(Pass* pass) const\n\/\/{\n\/\/ return 0;\n\/\/}\n\nvoid Material :: bind(Pass* pass, unsigned slot) const\n{\n \/\/const unsigned sz = m_Textures.size();\n const unsigned sz = max<unsigned>(1, m_Textures.size());\n \/\/ prevents pointless texture_slots state change for proxy material\n if(!m_bComposite) {\n pass->texture_slots(0);\n \/\/unsigned slot_bits = 0;\n \/\/for(unsigned i=0; i<sz; ++i) {\n \/\/ if(m_Textures[i])\n \/\/ slot_bits |= 1 << i;\n \/\/}\n \/\/pass->texture_slots(slot_bits);\n }\n \/\/if(sz){\n for(unsigned i=0; i<sz; ++i) {\n if(m_Textures[i])\n m_Textures[i]->bind(pass, i);\n else {\n pass->texture(0,i);\n break;\n }\n }\n \/\/}else{\n \/\/ pass->texture(0,0);\n \/\/}\n}\n\n\/*static*\/ bool Material :: supported(\n string fn,\n Cache<Resource, std::string>* cache\n){\n string fn_real = Filesystem::cutInternal(Filesystem::getFileName(fn));\n string ext = Filesystem::getExtension(fn_real);\n string cut = Filesystem::cutExtension(fn_real);\n string emb = Filesystem::getInternal(fn);\n \n if(ext==\"mtllib\")\n return true;\n else if(ext==\"json\")\n return true;\n\n unsigned compat = 0U;\n for(auto&& t: s_ExtraMapNames) {\n auto tfn = cut + \"_\" + t + \".\" + ext;\n tfn = cache->transform(tfn);\n if(fs::exists(\n fs::path(tfn)\n )){\n ++compat;\n }\n }\n \/\/ all detail maps exist\n return compat;\n \/\/if(compat == s_ExtraMapNames.size())\n \/\/ return true;\n \/\/ partial compatibility probably means user forgot one, so we'll warn\n \/\/if(compat)\n \/\/{\n \/\/ \/\/ TODO: remove this warning\n \/\/ \/\/WARNINGf(\"Material \\\"%s\\\" is missing %s out of %s detail maps\",\n \/\/ \/\/ Filesystem::getFileName(fn) %\n \/\/ \/\/ (s_ExtraMapNames.size() - compat) %\n \/\/ \/\/ s_ExtraMapNames.size()\n \/\/ \/\/);\n \/\/}\n \/\/return false;\n}\n\n<|endoftext|>"} {"text":"<commit_before>#include \"Odometry.h\"\r\n#include <cstdint>\r\n#include \"WProgram.h\"\r\n#include \"Device.h\"\r\n#include \"config.h\"\r\n\r\nnamespace tamproxy {\r\n Odometer::Odometer(Encoder& lEncoder, Encoder& rEncoder, Gyro& gyro, float alpha)\r\n : _encL(lEncoder),\r\n _encR(rEncoder),\r\n _gyro(gyro),\r\n _alpha(alpha),\r\n _lastTime(micros()),\r\n _lastMeanEnc(0),\r\n _gyroTot(0) { }\r\n\r\n std::vector<uint8_t> Odometer::handleRequest(std::vector<uint8_t> &request)\r\n {\r\n if (request[0] == ODOMETER_READ_CODE) {\r\n if (request.size() != 1) return {REQUEST_LENGTH_INVALID_CODE};\r\n\r\n std::vector<uint8_t> res(3*4 + 1);\r\n size_t i = 0;\r\n for(float f : {_angle, _x, _y}) {\r\n \/\/ here be dragons\r\n uint32_t val = *reinterpret_cast<uint32_t*>(&f);\r\n res[i++] = static_cast<uint8_t>(val>>24);\r\n res[i++] = static_cast<uint8_t>(val>>16);\r\n res[i++] = static_cast<uint8_t>(val>>8);\r\n res[i++] = static_cast<uint8_t>(val);\r\n }\r\n res[i++] = _gyroOk;\r\n return res;\r\n }\r\n else {\r\n return {REQUEST_BODY_INVALID_CODE};\r\n }\r\n }\r\n\r\n void Odometer::update()\r\n {\r\n const float ticksPerRev = 3200.0;\r\n const float wheelRadius = 3.78125 \/ 2;\r\n const float baseWidth = 15.3; \/\/inches\r\n const float ticksPerRad = ticksPerRev \/ (2*M_PI);\r\n\r\n uint32_t lEncVal = _encL.read();\r\n uint32_t rEncVal = _encR.read();\r\n\r\n \/\/ be careful about overflow here\r\n int32_t diffEnc = rEncVal - lEncVal;\r\n uint32_t meanEnc = lEncVal + diffEnc\/2;\r\n\r\n float encAngle = (diffEnc\/ticksPerRad) * wheelRadius\/baseWidth;\r\n\r\n \/\/ Use the gyro, if possible\r\n int16_t rawGyro = _gyro.read(_gyroOk);\r\n if(_gyroOk) {\r\n float gyroRead = Gyro::toRadians(rawGyro);\r\n\r\n _gyroTot += gyroRead*(micros() - _lastTime) \/ 1e6;\r\n _angle = _alpha*_gyroTot + (1-_alpha)*encAngle;\r\n }\r\n else {\r\n _angle = encAngle;\r\n }\r\n\r\n float dr = static_cast<int32_t>(meanEnc - _lastMeanEnc)\/ticksPerRad * wheelRadius;\r\n _x += dr * cos(_angle);\r\n _y += dr * sin(_angle);\r\n\r\n _lastTime = micros();\r\n _lastMeanEnc = meanEnc;\r\n }\r\n}<commit_msg>Make sure that we use the same value of micros() when integrating and updating!<commit_after>#include \"Odometry.h\"\r\n#include <cstdint>\r\n#include \"WProgram.h\"\r\n#include \"Device.h\"\r\n#include \"config.h\"\r\n\r\nnamespace tamproxy {\r\n Odometer::Odometer(Encoder& lEncoder, Encoder& rEncoder, Gyro& gyro, float alpha)\r\n : _encL(lEncoder),\r\n _encR(rEncoder),\r\n _gyro(gyro),\r\n _alpha(alpha),\r\n _lastTime(micros()),\r\n _lastMeanEnc(0),\r\n _gyroTot(0) { }\r\n\r\n std::vector<uint8_t> Odometer::handleRequest(std::vector<uint8_t> &request)\r\n {\r\n if (request[0] == ODOMETER_READ_CODE) {\r\n if (request.size() != 1) return {REQUEST_LENGTH_INVALID_CODE};\r\n\r\n std::vector<uint8_t> res(3*4 + 1);\r\n size_t i = 0;\r\n for(float f : {_angle, _x, _y}) {\r\n \/\/ here be dragons\r\n uint32_t val = *reinterpret_cast<uint32_t*>(&f);\r\n res[i++] = static_cast<uint8_t>(val>>24);\r\n res[i++] = static_cast<uint8_t>(val>>16);\r\n res[i++] = static_cast<uint8_t>(val>>8);\r\n res[i++] = static_cast<uint8_t>(val);\r\n }\r\n res[i++] = _gyroOk;\r\n return res;\r\n }\r\n else {\r\n return {REQUEST_BODY_INVALID_CODE};\r\n }\r\n }\r\n\r\n void Odometer::update()\r\n {\r\n const float ticksPerRev = 3200.0;\r\n const float wheelRadius = 3.78125 \/ 2;\r\n const float baseWidth = 15.3; \/\/inches\r\n const float ticksPerRad = ticksPerRev \/ (2*M_PI);\r\n\r\n uint32_t lEncVal = _encL.read();\r\n uint32_t rEncVal = _encR.read();\r\n\r\n \/\/ be careful about overflow here\r\n int32_t diffEnc = rEncVal - lEncVal;\r\n uint32_t meanEnc = lEncVal + diffEnc\/2;\r\n\r\n float encAngle = (diffEnc\/ticksPerRad) * wheelRadius\/baseWidth;\r\n\r\n \/\/ Use the gyro, if possible\r\n int16_t rawGyro = _gyro.read(_gyroOk);\r\n uint32_t currTime = micros();\r\n\r\n if(_gyroOk) {\r\n float gyroRead = Gyro::toRadians(rawGyro);\r\n\r\n _gyroTot += gyroRead*(currTime - _lastTime) \/ 1e6;\r\n _angle = _alpha*_gyroTot + (1-_alpha)*encAngle;\r\n }\r\n else {\r\n _angle = encAngle;\r\n }\r\n\r\n float dr = static_cast<int32_t>(meanEnc - _lastMeanEnc)\/ticksPerRad * wheelRadius;\r\n _x += dr * cos(_angle);\r\n _y += dr * sin(_angle);\r\n\r\n _lastTime = currTime;\r\n _lastMeanEnc = meanEnc;\r\n }\r\n}<|endoftext|>"} {"text":"<commit_before>\/\/ Copyright 2015 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 <ReadData.hpp>\n\nnamespace AstroData {\n\nRingBufferError::RingBufferError() {}\n\nRingBufferError::~RingBufferError() throw () {}\n\nconst char * RingBufferError::what() const throw() {\n return (\"Impossible to read from the PSRDada ring buffer.\");\n}\n\nvoid readZappedChannels(Observation & observation, const std::string & inputFileName, std::vector< uint8_t > & zappedChannels) {\n unsigned int nrChannels = 0;\n std::ifstream input;\n\n input.open(inputFileName);\n while ( !input.eof() ) {\n unsigned int channel = 0;\n\n input >> channel;\n if ( channel < observation.getNrChannels() ) {\n zappedChannels[channel] = 1;\n nrChannels++;\n }\n }\n input.close();\n observation.setNrZappedChannels(nrChannels);\n}\n\n} \/\/ AstroData\n\n<commit_msg>Fix to avoid empty files. Could still be improved, but it is enough for now.<commit_after>\/\/ Copyright 2015 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 <ReadData.hpp>\n\nnamespace AstroData {\n\nRingBufferError::RingBufferError() {}\n\nRingBufferError::~RingBufferError() throw () {}\n\nconst char * RingBufferError::what() const throw() {\n return (\"Impossible to read from the PSRDada ring buffer.\");\n}\n\nvoid readZappedChannels(Observation & observation, const std::string & inputFileName, std::vector< uint8_t > & zappedChannels) {\n unsigned int nrChannels = 0;\n std::ifstream input;\n\n input.open(inputFileName);\n while ( !input.eof() ) {\n unsigned int channel = observation.getNrChannels();\n\n input >> channel;\n if ( channel < observation.getNrChannels() ) {\n zappedChannels[channel] = 1;\n nrChannels++;\n }\n }\n input.close();\n observation.setNrZappedChannels(nrChannels);\n}\n\n} \/\/ AstroData\n\n<|endoftext|>"} {"text":"<commit_before>#include \"Renderer.h\"\n#include <sstream>\n#include <GL\/glu.h>\n#include <FTGL\/ftgl.h>\n#include <cmath>\n#include \"GLFW.h\"\n#include \"Universe.h\"\n#include \"DataStore.h\"\n\nnamespace\n{\n double rad2deg(double rad)\n {\n return 57.29577951308232087721 * rad;\n }\n\n unsigned int createStarDisplayList(const TextureManager& textures)\n {\n unsigned int index = glGenLists(1);\n\n glNewList(index, GL_COMPILE);\n\n glBindTexture(GL_TEXTURE_2D, textures.getTextureHandle(\"star\"));\n\n glBegin(GL_QUADS);\n glTexCoord2f(0.0f, 0.0f); glVertex2f(-1.0, -1.0);\n glTexCoord2f(0.0f, 1.0f); glVertex2f(-1.0, 1.0);\n glTexCoord2f(1.0f, 1.0f); glVertex2f(1.0, 1.0);\n glTexCoord2f(1.0f, 0.0f); glVertex2f(1.0, -1.0);\n glEnd();\n\n glEndList();\n\n return index;\n }\n}\n\nRenderer::Renderer(DataStore& datastore):\n m_datastore(datastore)\n{\n}\n\nvoid Renderer::init()\n{\n glfw::swapInterval(0);\n\n glClearColor(0.0, 0.0, 0.0, 0.0);\n glShadeModel(GL_SMOOTH);\n glEnable(GL_TEXTURE_2D);\n glEnable(GL_BLEND);\n\n glPixelStorei(GL_UNPACK_ALIGNMENT, 1);\n glBlendFunc(GL_SRC_ALPHA,GL_ONE_MINUS_SRC_ALPHA);\n glTexEnvf(GL_TEXTURE_ENV, GL_TEXTURE_ENV_MODE, GL_ADD);\n\n const double minX = m_datastore.get<double>(\"viewport-min-x\");\n const double minY = m_datastore.get<double>(\"viewport-min-y\");\n const double maxX = m_datastore.get<double>(\"viewport-max-x\");\n const double maxY = m_datastore.get<double>(\"viewport-max-y\");\n\n set_viewport(0, 0, maxX - minX, maxY - minY);\n set_projection(minX, maxX, minY, maxY);\n\n load_texture(m_datastore.get<std::string>(\"images-star\"), \"star\");\n\n m_starDisplayList = createStarDisplayList(m_textures);\n}\n\nvoid Renderer::set_viewport(int x, int y, int w, int h) {\n glViewport(x, y, w, h);\n glMatrixMode(GL_PROJECTION);\n glLoadIdentity();\n}\n\nvoid Renderer::set_projection(double left, double right, double bottom, double top) {\n glOrtho(left, right, bottom, top, -1, 1);\n glMatrixMode(GL_MODELVIEW);\n glLoadIdentity();\n}\n\nvoid Renderer::load_texture(const std::string& path, const std::string& key) {\n m_textures.loadTexture(path, key);\n}\n\nvoid Renderer::render(const Universe& universe) const\n{\n glClear(GL_COLOR_BUFFER_BIT | GL_DEPTH_BUFFER_BIT);\n glLoadIdentity();\n\n const StarList& stars = universe.stars();\n for(StarList::const_iterator it = stars.begin(); it != stars.end(); it++){\n const Star* star = *it;\n glColor3f(star->cr, star->cg, star->cb);\n glPushMatrix();\n glTranslatef(star->x, star->y, 0.0);\n glScalef(star->r, star->r, star->r);\n glCallList(m_starDisplayList);\n glPopMatrix();\n }\n}\n\nvoid Renderer::render_text(int x, int y, const std::string& text) const\n{\n FTPixmapFont font(m_datastore.get<std::string>(\"debug-font-family\").c_str());\n\n font.FaceSize(m_datastore.get<int>(\"debug-font-size\"));\n font.Render(text.c_str(), -1, FTPoint(x, y));\n}\n\n<commit_msg>use polygon to represent stars<commit_after>#include \"Renderer.h\"\n#include <sstream>\n#include <GL\/glu.h>\n#include <FTGL\/ftgl.h>\n#include <cmath>\n#include \"GLFW.h\"\n#include \"Universe.h\"\n#include \"DataStore.h\"\n\nnamespace\n{\n double rad2deg(double rad)\n {\n return 57.29577951308232087721 * rad;\n }\n\n unsigned int createStarDisplayList(const TextureManager& textures)\n {\n unsigned int index = glGenLists(1);\n\n glNewList(index, GL_COMPILE);\n\n glBegin(GL_TRIANGLE_FAN);\n glColor3f(1,0,1);\n glVertex2f(0.0f, 0.0f);\n glColor3f(1,1,1);\n\n const float pi = M_PI;\n\n const int n = 36;\n for(int i = 0; i <= n; ++i) {\n const float x = cos(2 * pi * i \/ n);\n const float y = sin(2 * pi * i \/ n);\n glVertex2f(x, y);\n }\n\n glEnd();\n\n glEndList();\n\n return index;\n }\n}\n\nRenderer::Renderer(DataStore& datastore):\n m_datastore(datastore)\n{\n}\n\nvoid Renderer::init()\n{\n glfw::swapInterval(0);\n\n glClearColor(0.0, 0.0, 0.0, 0.0);\n\n const double minX = m_datastore.get<double>(\"viewport-min-x\");\n const double minY = m_datastore.get<double>(\"viewport-min-y\");\n const double maxX = m_datastore.get<double>(\"viewport-max-x\");\n const double maxY = m_datastore.get<double>(\"viewport-max-y\");\n\n set_viewport(0, 0, maxX - minX, maxY - minY);\n set_projection(minX, maxX, minY, maxY);\n\n load_texture(m_datastore.get<std::string>(\"images-star\"), \"star\");\n\n m_starDisplayList = createStarDisplayList(m_textures);\n}\n\nvoid Renderer::set_viewport(int x, int y, int w, int h) {\n glViewport(x, y, w, h);\n glMatrixMode(GL_PROJECTION);\n glLoadIdentity();\n}\n\nvoid Renderer::set_projection(double left, double right, double bottom, double top) {\n glOrtho(left, right, bottom, top, -1, 1);\n glMatrixMode(GL_MODELVIEW);\n glLoadIdentity();\n}\n\nvoid Renderer::load_texture(const std::string& path, const std::string& key) {\n m_textures.loadTexture(path, key);\n}\n\nvoid Renderer::render(const Universe& universe) const\n{\n glClear(GL_COLOR_BUFFER_BIT);\n glLoadIdentity();\n\n const StarList& stars = universe.stars();\n for(StarList::const_iterator it = stars.begin(); it != stars.end(); it++){\n const Star* star = *it;\n glColor3f(star->cr, star->cg, star->cb);\n glPushMatrix();\n glTranslatef(star->x, star->y, 0.0);\n glScalef(star->r, star->r, star->r);\n glCallList(m_starDisplayList);\n glPopMatrix();\n }\n}\n\nvoid Renderer::render_text(int x, int y, const std::string& text) const\n{\n FTPixmapFont font(m_datastore.get<std::string>(\"debug-font-family\").c_str());\n\n font.FaceSize(m_datastore.get<int>(\"debug-font-size\"));\n font.Render(text.c_str(), -1, FTPoint(x, y));\n}\n\n<|endoftext|>"} {"text":"<commit_before>\n#include <stdlib.h>\n#include <string.h>\n\n#include \"SKIP_LIST.h\"\n\nnamespace SKIP_LIST {\n\n struct HANDLE {\n int (*compare) ( void const * node1, void const * node2 );\n int max_level;\n int current_level;\n double prob;\n unsigned short rand_state[3];\n size_t num_items;\n struct NODE * header;\n };\n\n struct HANDLE * init( int (*compare) ( void const * node1, void const * node2 ), int max_level, double prob ) {\n struct HANDLE *h = (struct HANDLE *) calloc( 1, sizeof(struct HANDLE) );\n h->compare = compare;\n if(max_level < 1) max_level = 32;\n if(prob < 0 || prob >= 1) prob = 0.25;\n h->max_level = max_level;\n h->current_level = 0;\n h->prob = prob;\n h->header = (struct NODE *) calloc( 1, sizeof(struct NODE) + sizeof(struct NODE*) * h->max_level );\n h->header->data = NULL;\n h->header->num_forward = h->max_level;\n h->num_items = 0;\n return h;\n }\n\n void destroy( struct HANDLE *& h ) {\n free(h);\n h = NULL;\n }\n\n int generate_level( HANDLE * h ) {\n int level = 0;\n double r;\n do {\n r = erand48(h->rand_state);\n ++level;\n } while(r < h->prob && level < h->max_level);\n return level;\n }\n\n void insert( struct HANDLE * h, void * item, size_t item_len ) {\n struct NODE ** update = (struct NODE **) calloc( 1, sizeof(struct NODE*) * h->max_level );\n struct NODE * n = h->header;\n struct NODE ** forward = (struct NODE **) (n+1);\n for( int i=h->current_level; i>0; --i ) {\n while( n->num_forward >= i && forward[i-1] && h->compare((forward[i-1])->data, item) < 0 ) {\n\tn = forward[i-1];\n\tforward = (struct NODE **) (n+1);\n }\n update[i-1] = n;\n }\n n = *(struct NODE **) (n+1);\n if( n && h->compare(n->data, item) == 0 )\n return;\n else {\n int new_level = generate_level( h );\n if( new_level > h->current_level ) {\n\tfor( int i=h->current_level; i<new_level; ++i ) {\n\t update[i] = h->header;\n\t}\n\th->current_level = new_level;\n }\n NODE * new_node = (struct NODE *) calloc( 1, sizeof(struct NODE) + item_len + sizeof(struct NODE*) * new_level );\n new_node->data = ((char *) (new_node+1)) + sizeof(struct NODE *) * new_level;\n memcpy( new_node->data, item, item_len );\n new_node->data_len = item_len;\n new_node->num_forward = new_level;\n struct NODE ** nforward = (struct NODE **) (new_node+1);\n for( int i=0; i<new_level; ++i ) {\n\tstruct NODE ** forward = (struct NODE **) (update[i]+1);\n\tnforward[i] = forward[i];\n\tforward[i] = new_node;\n }\n h->num_items += 1;\n }\n free( update );\n }\n\n void remove( struct HANDLE * h, void * item ) {\n struct NODE ** update = (struct NODE **) calloc( 1, sizeof(struct NODE*) * h->max_level );\n struct NODE * n = h->header;\n struct NODE ** forward = (struct NODE **) (n+1);\n for( int i=h->current_level; i>0; --i ) {\n while( n->num_forward >= i && forward[i-1] && h->compare((forward[i-1])->data, item) < 0 ) {\n\tn = forward[i-1];\n\tforward = (struct NODE **) (n+1);\n }\n update[i-1] = n;\n }\n n = *(struct NODE **) (n+1);\n struct NODE ** nforward = (struct NODE **) (n+1);\n if( h->compare(n->data, item) == 0 ) {\n for( int i=0; i<h->current_level; ++i ) {\n\tstruct NODE ** forward = (struct NODE **) (update[i]+1);\n\tif( forward[i] != n )\n\t break;\n\tforward[i] = nforward[i];\n }\n free( n );\n struct NODE ** hforward = (struct NODE **) (h->header+1);\n while( h->current_level > 1 && hforward[h->current_level] == NULL )\n\th->current_level--;\n h->num_items -= 1;\n }\n free( update );\n }\n\n void * find( struct HANDLE * h, void const * item ) {\n struct NODE * n = h->header;\n struct NODE ** forward = (struct NODE **) (n+1);\n for( int i=h->current_level; i>0; --i ) {\n while( n->num_forward >= i && forward[i-1] && h->compare((forward[i-1])->data, item) < 0 ) {\n\tn = forward[i-1];\n\tforward = (struct NODE **) (n+1);\n }\n }\n n = *(struct NODE **) (n+1);\n return (n && h->compare(n->data, item) == 0) ? n->data : NULL;\n }\n\n struct NODE * first( struct HANDLE * h ) {\n struct NODE * n = h->header;\n struct NODE ** forward = (struct NODE **) (n+1);\n if( forward[0] ) {\n n = forward[0];\n return n;\n }\n return NULL;\n }\n\n struct NODE * next ( struct NODE * n ) {\n if( !n ) return NULL;\n struct NODE ** forward = (struct NODE **) (n+1);\n if( forward[0] ) {\n n = forward[0];\n return n;\n }\n return NULL;\n }\n\n size_t size( struct HANDLE * h ) {\n return h->num_items;\n }\n};\n<commit_msg>Update SKIP_LIST.cc<commit_after>\n#include <stdlib.h>\n#include <string.h>\n\n#include \"SKIP_LIST.h\"\n\nnamespace SKIP_LIST {\n\n struct HANDLE {\n int (*compare) ( void const * node1, void const * node2 );\n int max_level;\n int current_level;\n double prob;\n unsigned short rand_state[3];\n size_t num_items;\n struct NODE * header;\n };\n\n struct HANDLE * init( int (*compare) ( void const * node1, void const * node2 ), int max_level, double prob ) {\n struct HANDLE *h = (struct HANDLE *) calloc( 1, sizeof(struct HANDLE) );\n h->compare = compare;\n if(max_level < 1) max_level = 32;\n if(prob < 0 || prob >= 1) prob = 0.25;\n h->max_level = max_level;\n h->current_level = 0;\n h->prob = prob;\n h->header = (struct NODE *) calloc( 1, sizeof(struct NODE) + sizeof(struct NODE*) * h->max_level );\n h->header->data = NULL;\n h->header->num_forward = h->max_level;\n h->num_items = 0;\n return h;\n }\n\n void destroy( struct HANDLE *& h ) {\n free(h);\n h = NULL;\n }\n\n int generate_level( HANDLE * h ) {\n int level = 0;\n double r;\n do {\n r = erand48(h->rand_state);\n ++level;\n } while(r < h->prob && level < h->max_level);\n return level;\n }\n\n void insert( struct HANDLE * h, void * item, size_t item_len ) {\n struct NODE ** update = (struct NODE **) calloc( 1, sizeof(struct NODE*) * h->max_level );\n struct NODE * n = h->header;\n struct NODE ** forward = (struct NODE **) (n+1);\n for( int i=h->current_level; i>0; --i ) {\n while( n->num_forward >= i && forward[i-1] && h->compare((forward[i-1])->data, item) < 0 ) {\n\tn = forward[i-1];\n\tforward = (struct NODE **) (n+1);\n }\n update[i-1] = n;\n }\n n = *(struct NODE **) (n+1);\n if( n && h->compare(n->data, item) == 0 ) {\n \tfree( update );\n \treturn;\n }\n else {\n int new_level = generate_level( h );\n if( new_level > h->current_level ) {\n\tfor( int i=h->current_level; i<new_level; ++i ) {\n\t update[i] = h->header;\n\t}\n\th->current_level = new_level;\n }\n NODE * new_node = (struct NODE *) calloc( 1, sizeof(struct NODE) + item_len + sizeof(struct NODE*) * new_level );\n new_node->data = ((char *) (new_node+1)) + sizeof(struct NODE *) * new_level;\n memcpy( new_node->data, item, item_len );\n new_node->data_len = item_len;\n new_node->num_forward = new_level;\n struct NODE ** nforward = (struct NODE **) (new_node+1);\n for( int i=0; i<new_level; ++i ) {\n\tstruct NODE ** forward = (struct NODE **) (update[i]+1);\n\tnforward[i] = forward[i];\n\tforward[i] = new_node;\n }\n h->num_items += 1;\n }\n free( update );\n }\n\n void remove( struct HANDLE * h, void * item ) {\n struct NODE ** update = (struct NODE **) calloc( 1, sizeof(struct NODE*) * h->max_level );\n struct NODE * n = h->header;\n struct NODE ** forward = (struct NODE **) (n+1);\n for( int i=h->current_level; i>0; --i ) {\n while( n->num_forward >= i && forward[i-1] && h->compare((forward[i-1])->data, item) < 0 ) {\n\tn = forward[i-1];\n\tforward = (struct NODE **) (n+1);\n }\n update[i-1] = n;\n }\n n = *(struct NODE **) (n+1);\n struct NODE ** nforward = (struct NODE **) (n+1);\n if( h->compare(n->data, item) == 0 ) {\n for( int i=0; i<h->current_level; ++i ) {\n\tstruct NODE ** forward = (struct NODE **) (update[i]+1);\n\tif( forward[i] != n )\n\t break;\n\tforward[i] = nforward[i];\n }\n free( n );\n struct NODE ** hforward = (struct NODE **) (h->header+1);\n while( h->current_level > 1 && hforward[h->current_level] == NULL )\n\th->current_level--;\n h->num_items -= 1;\n }\n free( update );\n }\n\n void * find( struct HANDLE * h, void const * item ) {\n struct NODE * n = h->header;\n struct NODE ** forward = (struct NODE **) (n+1);\n for( int i=h->current_level; i>0; --i ) {\n while( n->num_forward >= i && forward[i-1] && h->compare((forward[i-1])->data, item) < 0 ) {\n\tn = forward[i-1];\n\tforward = (struct NODE **) (n+1);\n }\n }\n n = *(struct NODE **) (n+1);\n return (n && h->compare(n->data, item) == 0) ? n->data : NULL;\n }\n\n struct NODE * first( struct HANDLE * h ) {\n struct NODE * n = h->header;\n struct NODE ** forward = (struct NODE **) (n+1);\n if( forward[0] ) {\n n = forward[0];\n return n;\n }\n return NULL;\n }\n\n struct NODE * next ( struct NODE * n ) {\n if( !n ) return NULL;\n struct NODE ** forward = (struct NODE **) (n+1);\n if( forward[0] ) {\n n = forward[0];\n return n;\n }\n return NULL;\n }\n\n size_t size( struct HANDLE * h ) {\n return h->num_items;\n }\n};\n<|endoftext|>"} {"text":"<commit_before>#include \"Solution.h\"\n#include \"Location.h\"\n#include <cmath>\n#include <cstdlib>\n#include <utility>\n#include <stdio.h>\n\nSolution::Solution()\n{\n \/\/ctor\n}\n\nSolution::Solution(double cost, double infeasibilityCost):\n cost_(cost), infeasibilityCost_(infeasibilityCost){\n}\n\nSolution::~Solution()\n{\n driverInst_.clear();\n trailerInst_.clear();\n stockLevelInst_.clear();\n safetyLevelInst_.clear();\n}\n\nvoid Solution::clear(){\n for(std::vector<std::vector<Shift*> > c : driverInst_){\n for(std::vector<Shift*> b : c){\n b.clear();\n }\n c.clear();\n }\n driverInst_.clear();\n\n for(std::vector<std::vector<Shift*> > c : trailerInst_){\n for(std::vector<Shift*> b : c){\n b.clear();\n }\n c.clear();\n }\n trailerInst_.clear();\n\n for(std::vector<double> a : stockLevelInst_){\n a.clear();\n }\n stockLevelInst_.clear();\n\n for(std::vector<std::vector<Stop*> > a : locationInstStop_){\n for(std::vector<Stop*> b : a)\n b.clear();\n a.clear();\n }\n locationInstStop_.clear();\n\n safetyLevelInst_.clear();\n\n infeasibilityCost_=-1;\n cost_=-1;\n}\n\nvoid Solution::reset(){\n std::vector<Shift*> v;\n v.resize(2,NULL);\n v.clear();\n\n clear();\n driverInst_.resize(InputData::getDrivers()->size());\n for(std::vector<std::vector<Shift*> > a : driverInst_){\n a.resize(InputData::getNumInst(),v);\n }\n\n trailerInst_.resize(InputData::getTrailers()->size());\n for(std::vector<std::vector<Shift*> > a : trailerInst_){\n a.resize(InputData::getNumInst(),v);\n }\n\n safetyLevelInst_.clear();\n stockLevelInst_.resize(InputData::getLocations()->size());\n int i=0;\n bool safetyLevelReached = false;\n for(Location* loc : *(InputData::getLocations())){\n switch(loc->getType()){\n case Location::BASE:{\n stockLevelInst_[i].clear();\n }break;\n case Location::SOURCE:{\n stockLevelInst_[i].resize(InputData::getNumInst(),INFINITY);\n }break;\n case Location::CUSTOMER:{\n Customer* c=(Customer*)loc;\n stockLevelInst_[i].resize(InputData::getNumInst(),c->getInitialQuantity());\n for(unsigned int j=1;j< c->getForecast()->size();j++){\n stockLevelInst_[i][j]=stockLevelInst_[i][j-1]-(*(c->getForecast()))[j];\n if(!safetyLevelReached && stockLevelInst_[i][j]<c->getSafetyLevel()){\n safetyLevelReached = true;\n safetyLevelInst_.insert(std::make_pair(j,c));\n }\n }\n }break;\n }\n i++;\n }\n\n std::vector<Stop*> s;\n s.resize(2,NULL);\n s.clear();\n locationInstStop_.resize(InputData::getLocations()->size());\n for(std::vector<std::vector<Stop*> > a : locationInstStop_){\n a.resize(InputData::getNumInst(),s);\n }\n}\n\n\nint Solution::checkShift(Shift* shift){\n \/\/ Shift* shift;\n int i;\n std::vector<Stop*>::iterator stopIt = shift->getStop()->begin();\n Stop* stop=*(stopIt);\n\n if(!shift->getDriver()->canDrive(shift->getTrailer())){\n return Penalty::TRAILER_DRIVER_COMPATIBILITY;\n }\n\n \/\/retrieve trailer quantity\n double trailerQuant = shift->getTrailer()->getInicialQuantity();\n for(i=shift->getInitialInstant()-1; i>=0; i--){\n if(!getTrailerInst()->at(shift->getTrailer()->getIndex()).at(i).empty()){\n Shift* lastShift = getTrailerInst()->at(shift->getTrailer()->getIndex()).at(i).at(0);\n\/\/ trailerQuant = lastShift->getFinalQuantity();\/\/TODO criar esse metodo\n }\n }\n\/\/ TODO: criar getInitialQuantity\n\/\/ if(trailerQuant!=shift->getInitialQuantity()){\n\/\/ return Penalty::TRAILER_INITIAL_QUANTITY;\n\/\/ }\n\n \/\/falta checar se na primeira hora tem um shift terminando\n for(i= shift->getInitialInstant(); i<=shift->getFinalInstant(); ++i){\n \/\/check if driver is available\n if(!getDriverInst()->at(shift->getDriver()->getIndex()).at(i).empty()){\n return Penalty::DRIVER_INTERSHIFT_DURATION;\n }\n \/\/check if trailer is available\n if(!getTrailerInst()->at(shift->getTrailer()->getIndex()).at(i).empty()){\n return Penalty::TRAILER_SHIFTS_OVERLAP;\n }\n \/\/check if location is availble\n if(stop!=NULL && stop->getArriveTime() >= i && stop->getArriveTime() < i+1){\n for(int k=i; k<i+stop->getLocation()->getSetupTime();k++){\n if(!getLocationInstStop()->at(stop->getLocation()->getIndex()).at(i).empty()){\n return Penalty::STOP_ARRIVAL_TIME;\n }\n }\n trailerQuant-=stop->getQuantity();\n if(trailerQuant<0){\n return Penalty::TRAILER_NON_NEGATIVE_QUANTITY;\n }else if(trailerQuant > shift->getTrailer()->getCapacity()){\n return Penalty::TRAILER_MAX_CAPACITY;\n }\n if(stop->getLocation()->getType()==Location::CUSTOMER){\n Customer* customer= (Customer*) stop->getLocation();\n if(!customer->isTrailerAllowed(shift->getTrailer())){\n return Penalty::CUSTOMER_TRAILER_COMPATIBILITY;\n }\n \/\/check stockLevel\n for(int k=i;k< (int)getStockLevelInst()->size();k++){\n if( getStockLevelInst()->at(customer->getIndex()).at(k)+\n stop->getQuantity() > customer->getCapacity() ){\n return Penalty::CUSTOMER_MAX_TANK_CAPACITY;\n }\n }\n }else if(stop->getLocation()->getType()==Location::SOURCE){\n Source* source= (Source*) stop->getLocation();\n for(int k=i;k< (int)getStockLevelInst()->size();k++){\n if( getStockLevelInst()->at(source->getIndex()).at(k)+\n stop->getQuantity() < 0 ){\n return Penalty::SOURCE_NON_NEGATIVE_CAPACITY;\/\/TODO replace source_non by source\n }\n }\n if(stop->getQuantity()>0){\n printf(\"Stop deve ter quantidade negativa se location for source\\n\");\n return Penalty::SOURCE_MAX_TANK_CAPACITY;\n }\n }\n stopIt++;\n stop= (stopIt!=shift->getStop()->end()) ? *stopIt : NULL;\n }\n }\n}\n\nbool Solution::checkStop(Stop* stop){\n \/*\n 1 Does the Shift Fits?\n Verify if there is not another Stop at the instant\n 2 Conflict with another driver\/trailer\n Verify if there is another Stop in the same location at the same instant\n *\/\n}\n\nvoid Solution::insertShift(Shift* shift){\n \/\/Hour interval\n int iniHour_ = (shift->getInitialInstant());\/\/Initial hour of the shift\n int finalHour_ = (shift->getFinalInstant());\/\/Final hour of the shift\n\n \/\/driverInst_\n int driverIndex_ = shift->getDriver()->getIndex();\/\/Get the shift's driver index\n for(int i=iniHour_;i<=finalHour_;i++){\n driverInst_[driverIndex_][i].push_back(shift);\/\/Add the shift on the driver's Instants list\n }\n\n \/\/trailerInst_\n int trailerIndex_ = shift->getTrailer()->getIndex();\/\/Get the shift's trailer index\n for(int i=iniHour_;i<=finalHour_;i++){\n trailerInst_[trailerIndex_][i].push_back(shift);\/\/Add the shift on the trailer's Instants list\n }\n\n \/\/locationInstStop_\n for(int j=0;j<shift->getStop()->size();j++){\/\/j = stop\n int locationIndex_ = shift->getStop()->at(j)->getLocation()->getIndex();\/\/Getting each location index\n\n double iniHourStop_ = shift->getStop()->at(j)->getArriveTime();\/\/initial our of arrival at location\n double finalHourStop_ = shift->getStop()->at(j)->getArriveTime();\/\/setting up the final hour of arrival\/ hour of departure from location\n\n if( instanceof<Customer>(shift->getStop()->at(j)->getLocation())){\n finalHourStop_ += ((Customer*)shift->getStop()->at(j)->getLocation())->getSetupTime();\n }else if( instanceof<Source>(shift->getStop()->at(j)->getLocation()) ){\n finalHourStop_ += ((Source*)shift->getStop()->at(j)->getLocation())->getSetupTime();\n }\n\n for(int i=iniHourStop_;i<=finalHourStop_;i++){\n locationInstStop_[locationIndex_][i].push_back(shift->getStop()->at(j));\/\/Adding the stop on the Instant list\n }\n }\n shift->setSolution(this);\n}\n\nvoid Solution::removeShift(Shift* shift){\n \/\/Hour interval\n int iniHour_ = (shift->getInitialInstant());\n int finalHour_ = (shift->getFinalInstant());\n\n \/\/driverInst_\n int driverIndex_ = shift->getDriver()->getIndex();\n for(int i=iniHour_;i<=finalHour_;i++){\n for(int j=0;j<driverInst_[driverIndex_][i].size();j++){\/\/For every hour on the driver's list\n if(driverInst_[driverIndex_][i].at(j)==shift){\/\/Checking to see if the shift is present on that position\n driverInst_[driverIndex_][i].erase(driverInst_[driverIndex_][i].begin()+j);\/\/If it is, remove it.\n }\n }\n }\n\n \/\/trailerInst_\n int trailerIndex_ = shift->getTrailer()->getIndex();\n for(int i=iniHour_;i<=finalHour_;i++){\n for(int j=0;j<trailerInst_[trailerIndex_][i].size();j++){\/\/For every hour on the trailer's list\n if(trailerInst_[trailerIndex_][i].at(j)==shift){\/\/Checking to see if the shift is present on that position\n trailerInst_[trailerIndex_][i].erase(trailerInst_[trailerIndex_][i].begin()+j);\/\/If it is, remove it.\n }\n }\n }\n \/\/locationInstStop_\n for(int j=0;j<shift->getStop()->size();j++){\/\/j = stop\n int locationIndex_ = shift->getStop()->at(j)->getLocation()->getIndex();\/\/Getting each location index\n\n double iniHourStop_ = shift->getStop()->at(j)->getArriveTime();\/\/initial our of arrival at location\n double finalHourStop_ = shift->getStop()->at(j)->getArriveTime();\/\/setting up the final hour of arrival\/ hour of departure from location\n\n if( instanceof<Customer>(shift->getStop()->at(j)->getLocation())){\n finalHourStop_ += ((Customer*)shift->getStop()->at(j)->getLocation())->getSetupTime();\n\n \/\/Updating the Stock of the customer\n for(int time=iniHourStop_;time<stockLevelInst_[locationIndex_].size();time++){\n if(stockLevelInst_[locationIndex_][time]==0)\n break;\n\n stockLevelInst_[locationIndex_][time] -= shift->getStop()->at(j)->getQuantity();\n\n if(stockLevelInst_[locationIndex_][time]<0){\n stockLevelInst_[locationIndex_][time]=0;\n }\n }\n\n }\n\t\telse if( instanceof<Source>(shift->getStop()->at(j)->getLocation()) ){\n finalHourStop_ += ((Source*)shift->getStop()->at(j)->getLocation())->getSetupTime();\n }\n\n for(int i=iniHourStop_;i<=finalHourStop_;i++){\n for(int k=0;k<locationInstStop_[locationIndex_][i].size();k++){\/\/For every hour on the locations's list\n if(locationInstStop_[locationIndex_][i].at(k) == shift->getStop()->at(j)){\n\n \/\/Removing Stop\n locationInstStop_[locationIndex_][i].erase(locationInstStop_[locationIndex_][i].begin()+k);\/\/If it is, remove it.\n }\n }\n }\n }\n shift->setSolution(NULL);\n \/**\n\n TODO -> VERIFICAR OS SHIFTS VIZINHOS DO TRAILER\n MODIFICAR OS ESTOQUES DE TODOS OS STOPS\n RETORNAR OS NOVO CUSTO\n **\/\n\n}\n\nvoid Solution::insertStopInShift(Shift* shift, Stop* stop){\n}\n\nvoid Solution::removeStopFromShift(Shift* shift, Stop* stop){\n}\n\n\nvoid Solution::calcCost(){\n double totalQuantity = 0;\n double cost = 0;\n\n int maxTankCapacity = 0;\n int safetyLevel = 0;\n int runOut = 0;\n\n for(int i=0;i<trailerInst_.size();i++){\n Shift* shift = NULL;\n for(int j=0;j<trailerInst_.at(i).size();j++){\n for(int k=0;k<trailerInst_.at(i).at(j).size();k++){\n if(shift == NULL || shift != trailerInst_.at(i).at(j).at(k)){\n shift = trailerInst_.at(i).at(j).at(k);\n cost += shift->getCost();\n totalQuantity += shift->getQuantityDelivered();\n }\n }\n }\n }\n\n cost_ = cost\/totalQuantity;\n\n \/\/chegando se violou restries\n for(Customer* c: *InputData::getCustomers()){\n for(double i: stockLevelInst_.at(c->getIndex())){\n if(c->getCapacity() < i){\n maxTankCapacity++;\n }\n\n if(c->getSafetyLevel() > i){\n safetyLevel++;\n }\n\n if(0 >= i){\n runOut++;\n }\n }\n }\n\n cost += maxTankCapacity * Penalties::getValue(CUSTOMER_MAX_TANK_CAPACITY) +\n safetyLevel * Penalties::getValue(CUSTOMER_SAFETY_LEVEL) +\n runOut * Penalties::getValue(CUSTOMER_RUN_OUT);\n\n}\n<commit_msg>Alterações em removeShift<commit_after>#include \"Solution.h\"\n#include \"Location.h\"\n#include <cmath>\n#include <cstdlib>\n#include <utility>\n#include <stdio.h>\n\nSolution::Solution()\n{\n \/\/ctor\n}\n\nSolution::Solution(double cost, double infeasibilityCost):\n cost_(cost), infeasibilityCost_(infeasibilityCost){\n}\n\nSolution::~Solution()\n{\n driverInst_.clear();\n trailerInst_.clear();\n stockLevelInst_.clear();\n safetyLevelInst_.clear();\n}\n\nvoid Solution::clear(){\n for(std::vector<std::vector<Shift*> > c : driverInst_){\n for(std::vector<Shift*> b : c){\n b.clear();\n }\n c.clear();\n }\n driverInst_.clear();\n\n for(std::vector<std::vector<Shift*> > c : trailerInst_){\n for(std::vector<Shift*> b : c){\n b.clear();\n }\n c.clear();\n }\n trailerInst_.clear();\n\n for(std::vector<double> a : stockLevelInst_){\n a.clear();\n }\n stockLevelInst_.clear();\n\n for(std::vector<std::vector<Stop*> > a : locationInstStop_){\n for(std::vector<Stop*> b : a)\n b.clear();\n a.clear();\n }\n locationInstStop_.clear();\n\n safetyLevelInst_.clear();\n\n infeasibilityCost_=-1;\n cost_=-1;\n}\n\nvoid Solution::reset(){\n std::vector<Shift*> v;\n v.resize(2,NULL);\n v.clear();\n\n clear();\n driverInst_.resize(InputData::getDrivers()->size());\n for(std::vector<std::vector<Shift*> > a : driverInst_){\n a.resize(InputData::getNumInst(),v);\n }\n\n trailerInst_.resize(InputData::getTrailers()->size());\n for(std::vector<std::vector<Shift*> > a : trailerInst_){\n a.resize(InputData::getNumInst(),v);\n }\n\n safetyLevelInst_.clear();\n stockLevelInst_.resize(InputData::getLocations()->size());\n int i=0;\n bool safetyLevelReached = false;\n for(Location* loc : *(InputData::getLocations())){\n switch(loc->getType()){\n case Location::BASE:{\n stockLevelInst_[i].clear();\n }break;\n case Location::SOURCE:{\n stockLevelInst_[i].resize(InputData::getNumInst(),INFINITY);\n }break;\n case Location::CUSTOMER:{\n Customer* c=(Customer*)loc;\n stockLevelInst_[i].resize(InputData::getNumInst(),c->getInitialQuantity());\n for(unsigned int j=1;j< c->getForecast()->size();j++){\n stockLevelInst_[i][j]=stockLevelInst_[i][j-1]-(*(c->getForecast()))[j];\n if(!safetyLevelReached && stockLevelInst_[i][j]<c->getSafetyLevel()){\n safetyLevelReached = true;\n safetyLevelInst_.insert(std::make_pair(j,c));\n }\n }\n }break;\n }\n i++;\n }\n\n std::vector<Stop*> s;\n s.resize(2,NULL);\n s.clear();\n locationInstStop_.resize(InputData::getLocations()->size());\n for(std::vector<std::vector<Stop*> > a : locationInstStop_){\n a.resize(InputData::getNumInst(),s);\n }\n}\n\n\nint Solution::checkShift(Shift* shift){\n \/\/ Shift* shift;\n int i;\n std::vector<Stop*>::iterator stopIt = shift->getStop()->begin();\n Stop* stop=*(stopIt);\n\n if(!shift->getDriver()->canDrive(shift->getTrailer())){\n return Penalty::TRAILER_DRIVER_COMPATIBILITY;\n }\n\n \/\/retrieve trailer quantity\n double trailerQuant = shift->getTrailer()->getInicialQuantity();\n for(i=shift->getInitialInstant()-1; i>=0; i--){\n if(!getTrailerInst()->at(shift->getTrailer()->getIndex()).at(i).empty()){\n Shift* lastShift = getTrailerInst()->at(shift->getTrailer()->getIndex()).at(i).at(0);\n\/\/ trailerQuant = lastShift->getFinalQuantity();\/\/TODO criar esse metodo\n }\n }\n\/\/ TODO: criar getInitialQuantity\n\/\/ if(trailerQuant!=shift->getInitialQuantity()){\n\/\/ return Penalty::TRAILER_INITIAL_QUANTITY;\n\/\/ }\n\n \/\/falta checar se na primeira hora tem um shift terminando\n for(i= shift->getInitialInstant(); i<=shift->getFinalInstant(); ++i){\n \/\/check if driver is available\n if(!getDriverInst()->at(shift->getDriver()->getIndex()).at(i).empty()){\n return Penalty::DRIVER_INTERSHIFT_DURATION;\n }\n \/\/check if trailer is available\n if(!getTrailerInst()->at(shift->getTrailer()->getIndex()).at(i).empty()){\n return Penalty::TRAILER_SHIFTS_OVERLAP;\n }\n \/\/check if location is availble\n if(stop!=NULL && stop->getArriveTime() >= i && stop->getArriveTime() < i+1){\n for(int k=i; k<i+stop->getLocation()->getSetupTime();k++){\n if(!getLocationInstStop()->at(stop->getLocation()->getIndex()).at(i).empty()){\n return Penalty::STOP_ARRIVAL_TIME;\n }\n }\n trailerQuant-=stop->getQuantity();\n if(trailerQuant<0){\n return Penalty::TRAILER_NON_NEGATIVE_QUANTITY;\n }else if(trailerQuant > shift->getTrailer()->getCapacity()){\n return Penalty::TRAILER_MAX_CAPACITY;\n }\n if(stop->getLocation()->getType()==Location::CUSTOMER){\n Customer* customer= (Customer*) stop->getLocation();\n if(!customer->isTrailerAllowed(shift->getTrailer())){\n return Penalty::CUSTOMER_TRAILER_COMPATIBILITY;\n }\n \/\/check stockLevel\n for(int k=i;k< (int)getStockLevelInst()->size();k++){\n if( getStockLevelInst()->at(customer->getIndex()).at(k)+\n stop->getQuantity() > customer->getCapacity() ){\n return Penalty::CUSTOMER_MAX_TANK_CAPACITY;\n }\n }\n }else if(stop->getLocation()->getType()==Location::SOURCE){\n Source* source= (Source*) stop->getLocation();\n for(int k=i;k< (int)getStockLevelInst()->size();k++){\n if( getStockLevelInst()->at(source->getIndex()).at(k)+\n stop->getQuantity() < 0 ){\n return Penalty::SOURCE_NON_NEGATIVE_CAPACITY;\/\/TODO replace source_non by source\n }\n }\n if(stop->getQuantity()>0){\n printf(\"Stop deve ter quantidade negativa se location for source\\n\");\n return Penalty::SOURCE_MAX_TANK_CAPACITY;\n }\n }\n stopIt++;\n stop= (stopIt!=shift->getStop()->end()) ? *stopIt : NULL;\n }\n }\n}\n\nbool Solution::checkStop(Stop* stop){\n \/*\n 1 Does the Shift Fits?\n Verify if there is not another Stop at the instant\n 2 Conflict with another driver\/trailer\n Verify if there is another Stop in the same location at the same instant\n *\/\n}\n\nvoid Solution::insertShift(Shift* shift){\n \/\/Hour interval\n int iniHour_ = (shift->getInitialInstant());\/\/Initial hour of the shift\n int finalHour_ = (shift->getFinalInstant());\/\/Final hour of the shift\n\n \/\/driverInst_\n int driverIndex_ = shift->getDriver()->getIndex();\/\/Get the shift's driver index\n for(int i=iniHour_;i<=finalHour_;i++){\n driverInst_[driverIndex_][i].push_back(shift);\/\/Add the shift on the driver's Instants list\n }\n\n \/\/trailerInst_\n int trailerIndex_ = shift->getTrailer()->getIndex();\/\/Get the shift's trailer index\n for(int i=iniHour_;i<=finalHour_;i++){\n trailerInst_[trailerIndex_][i].push_back(shift);\/\/Add the shift on the trailer's Instants list\n }\n\n \/\/locationInstStop_\n for(int j=0;j<shift->getStop()->size();j++){\/\/j = stop\n int locationIndex_ = shift->getStop()->at(j)->getLocation()->getIndex();\/\/Getting each location index\n\n double iniHourStop_ = shift->getStop()->at(j)->getArriveTime();\/\/initial our of arrival at location\n double finalHourStop_ = shift->getStop()->at(j)->getArriveTime();\/\/setting up the final hour of arrival\/ hour of departure from location\n\n if( instanceof<Customer>(shift->getStop()->at(j)->getLocation())){\n finalHourStop_ += ((Customer*)shift->getStop()->at(j)->getLocation())->getSetupTime();\n }else if( instanceof<Source>(shift->getStop()->at(j)->getLocation()) ){\n finalHourStop_ += ((Source*)shift->getStop()->at(j)->getLocation())->getSetupTime();\n }\n\n for(int i=iniHourStop_;i<=finalHourStop_;i++){\n locationInstStop_[locationIndex_][i].push_back(shift->getStop()->at(j));\/\/Adding the stop on the Instant list\n }\n }\n shift->setSolution(this);\n}\n\nvoid Solution::removeShift(Shift* shift){\n \/\/Hour interval\n int iniHour_ = (shift->getInitialInstant());\n int finalHour_ = (shift->getFinalInstant());\n\n \/\/driverInst_\n int driverIndex_ = shift->getDriver()->getIndex();\n for(int i=iniHour_;i<=finalHour_;i++){\n for(int j=0;j<driverInst_[driverIndex_][i].size();j++){\/\/For every hour on the driver's list\n if(driverInst_[driverIndex_][i].at(j)==shift){\/\/Checking to see if the shift is present on that position\n driverInst_[driverIndex_][i].erase(driverInst_[driverIndex_][i].begin()+j);\/\/If it is, remove it.\n }\n }\n }\n\n \/\/trailerInst_\n int trailerIndex_ = shift->getTrailer()->getIndex();\n for(int i=iniHour_;i<=finalHour_;i++){\n for(int j=0;j<trailerInst_[trailerIndex_][i].size();j++){\/\/For every hour on the trailer's list\n if(trailerInst_[trailerIndex_][i].at(j)==shift){\/\/Checking to see if the shift is present on that position\n trailerInst_[trailerIndex_][i].erase(trailerInst_[trailerIndex_][i].begin()+j);\/\/If it is, remove it.\n }\n }\n }\n\n \/\/locationInstStop_\n for(int j=0;j<shift->getStop()->size();j++){\/\/j = stop\n int locationIndex_ = shift->getStop()->at(j)->getLocation()->getIndex();\/\/Getting each location index\n\n double iniHourStop_ = shift->getStop()->at(j)->getArriveTime();\/\/initial hour of arrival at location\n double finalHourStop_ = shift->getStop()->at(j)->getArriveTime();\/\/setting up the final hour of arrival\/ hour of departure from location\n\n if( instanceof<Customer>(shift->getStop()->at(j)->getLocation())){\n finalHourStop_ += ((Customer*)shift->getStop()->at(j)->getLocation())->getSetupTime();\n\n \/\/Updating the Stock of the customer\n for(int time=iniHourStop_;time<stockLevelInst_[locationIndex_].size();time++){\n if(stockLevelInst_[locationIndex_][time]==0)\n break;\n\n stockLevelInst_[locationIndex_][time] -= shift->getStop()->at(j)->getQuantity();\n\n if(stockLevelInst_[locationIndex_][time]<0){\n stockLevelInst_[locationIndex_][time]=0;\n }\n }\n\n }\n\t\telse if( instanceof<Source>(shift->getStop()->at(j)->getLocation()) ){\n finalHourStop_ += ((Source*)shift->getStop()->at(j)->getLocation())->getSetupTime();\n }\n\n for(int i=iniHourStop_;i<=finalHourStop_;i++){\n for(int k=0;k<locationInstStop_[locationIndex_][i].size();k++){\/\/For every hour on the locations's list\n if(locationInstStop_[locationIndex_][i].at(k) == shift->getStop()->at(j)){\n\n \/\/Removing Stop\n locationInstStop_[locationIndex_][i].erase(locationInstStop_[locationIndex_][i].begin()+k);\/\/If it is, remove it.\n }\n }\n }\n }\n shift->setSolution(NULL);\n calcCost();\n \/**\n\n TODO -> ( )VERIFICAR OS SHIFTS VIZINHOS DO TRAILER\n (x)MODIFICAR OS ESTOQUES DE TODOS OS STOPS\n (x)RETORNAR OS NOVOS CUSTO\n **\/\n\n}\n\nvoid Solution::insertStopInShift(Shift* shift, Stop* stop){\n}\n\nvoid Solution::removeStopFromShift(Shift* shift, Stop* stop){\n}\n\n\nvoid Solution::calcCost(){\n double totalQuantity = 0;\n double cost = 0;\n\n int maxTankCapacity = 0;\n int safetyLevel = 0;\n int runOut = 0;\n\n for(int i=0;i<trailerInst_.size();i++){\n Shift* shift = NULL;\n for(int j=0;j<trailerInst_.at(i).size();j++){\n for(int k=0;k<trailerInst_.at(i).at(j).size();k++){\n if(shift == NULL || shift != trailerInst_.at(i).at(j).at(k)){\n shift = trailerInst_.at(i).at(j).at(k);\n cost += shift->getCost();\n totalQuantity += shift->getQuantityDelivered();\n }\n }\n }\n }\n\n cost_ = cost\/totalQuantity;\n\n \/\/chegando se violou restries\n for(Customer* c: *InputData::getCustomers()){\n for(double i: stockLevelInst_.at(c->getIndex())){\n if(c->getCapacity() < i){\n maxTankCapacity++;\n }\n\n if(c->getSafetyLevel() > i){\n safetyLevel++;\n }\n\n if(0 >= i){\n runOut++;\n }\n }\n }\n\n cost += maxTankCapacity * Penalties::getValue(CUSTOMER_MAX_TANK_CAPACITY) +\n safetyLevel * Penalties::getValue(CUSTOMER_SAFETY_LEVEL) +\n runOut * Penalties::getValue(CUSTOMER_RUN_OUT);\n\n}\n<|endoftext|>"} {"text":"<commit_before>#include <cassert>\n#include \"tinyxml2.h\"\n#include \"onut.h\"\n#include \"crypto.h\"\n#include \"zlib\/zlib.h\"\n\nnamespace onut\n{\n TiledMap::sLayer::~sLayer()\n {\n }\n\n TiledMap::sTileLayer::~sTileLayer()\n {\n if (tileIds) delete[] tileIds;\n }\n\n TiledMap::sObjectLayer::~sObjectLayer()\n {\n if (pObjects) delete[] pObjects;\n }\n\n TiledMap::sTileLayerInternal::~sTileLayerInternal()\n {\n if (tiles) delete[] tiles;\n }\n\n TiledMap::TiledMap(const std::string &map, onut::ContentManager<> *pContentManager)\n {\n tinyxml2::XMLDocument doc;\n doc.LoadFile(map.c_str());\n assert(!doc.Error());\n auto pXMLMap = doc.FirstChildElement(\"map\");\n assert(pXMLMap);\n\n \/\/ Tilesets\n for (auto pXMLTileset = pXMLMap->FirstChildElement(\"tileset\"); pXMLTileset; pXMLTileset = pXMLTileset->NextSiblingElement(\"tileset\"))\n {\n ++m_tilesetCount;\n }\n assert(m_tilesetCount);\n m_tileSets = new sTileSet[m_tilesetCount];\n m_tilesetCount = 0;\n for (auto pXMLTileset = pXMLMap->FirstChildElement(\"tileset\"); pXMLTileset; pXMLTileset = pXMLTileset->NextSiblingElement(\"tileset\"))\n {\n auto &pTileSet = m_tileSets[m_tilesetCount];\n\n pTileSet.name = pXMLTileset->Attribute(\"name\");\n pTileSet.firstId = pXMLTileset->IntAttribute(\"firstgid\");\n assert(pTileSet.firstId);\n pTileSet.tileWidth = pXMLTileset->IntAttribute(\"tilewidth\");\n assert(pTileSet.tileWidth);\n pTileSet.tileHeight = pXMLTileset->IntAttribute(\"tileheight\");\n assert(pTileSet.tileHeight);\n\n auto pXMLImage = pXMLTileset->FirstChildElement(\"image\");\n assert(pXMLImage);\n auto szImageFilename = pXMLImage->Attribute(\"source\");\n assert(szImageFilename);\n auto filename = getPath(map) + \"\/\" + szImageFilename;\n pTileSet.pTexture = pContentManager->getResource<Texture>(filename);\n\n ++m_tilesetCount;\n }\n\n \/\/ Layers\n for (auto pXMLLayer = pXMLMap->FirstChildElement(); pXMLLayer; pXMLLayer = pXMLLayer->NextSiblingElement())\n {\n if (!strcmp(pXMLLayer->Name(), \"layer\") ||\n !strcmp(pXMLLayer->Name(), \"objectgroup\"))\n {\n ++m_layerCount;\n }\n }\n assert(m_layerCount);\n m_layers = new sLayer*[m_layerCount];\n m_layerCount = 0;\n for (auto pXMLLayer = pXMLMap->FirstChildElement(); pXMLLayer; pXMLLayer = pXMLLayer->NextSiblingElement())\n {\n if (!strcmp(pXMLLayer->Name(), \"layer\"))\n {\n m_layers[m_layerCount] = new sTileLayerInternal();\n auto &pLayer = *(sTileLayerInternal*)m_layers[m_layerCount];\n\n pLayer.name = pXMLLayer->Attribute(\"name\");\n if (pXMLLayer->Attribute(\"visible\"))\n {\n pLayer.isVisible = pXMLLayer->BoolAttribute(\"visible\");\n }\n\n pLayer.width = pXMLLayer->IntAttribute(\"width\");\n assert(pLayer.width);\n pLayer.height = pXMLLayer->IntAttribute(\"height\");\n assert(pLayer.height);\n m_width = std::max<>(m_width, pLayer.width);\n m_height = std::max<>(m_height, pLayer.height);\n auto len = pLayer.width * pLayer.height;\n pLayer.tileIds = new uint32_t[len];\n\n auto pXMLData = pXMLLayer->FirstChildElement(\"data\");\n assert(pXMLData);\n auto szEncoding = pXMLData->Attribute(\"encoding\");\n auto szCompression = pXMLData->Attribute(\"compression\");\n\n if (!szEncoding)\n {\n int i = 0;\n for (auto pXMLTile = pXMLData->FirstChildElement(\"tile\"); pXMLTile; pXMLTile = pXMLTile->NextSiblingElement(\"tile\"), ++i)\n {\n auto id = pXMLTile->IntAttribute(\"gid\");\n assert(i < len);\n pLayer.tileIds[i] = id;\n }\n assert(i == len);\n }\n else\n {\n auto szData = pXMLData->GetText();\n assert(szData);\n auto pos = std::string(szData).find_first_not_of(\"\\n \");\n assert(pos < strlen(szData));\n szData = szData + pos;\n\n if (!strcmp(szEncoding, \"csv\"))\n {\n auto csvData = splitString(szData, ',');\n assert(static_cast<int>(csvData.size()) == len);\n for (int i = 0; i < len; ++i)\n {\n try\n {\n pLayer.tileIds[i] = static_cast<uint32_t>(std::stoul(csvData[i]));\n }\n catch (std::exception e)\n {\n assert(false);\n }\n }\n }\n else if (!strcmp(szEncoding, \"base64\"))\n {\n auto decoded = base64_decode(szData);\n if (!szCompression)\n {\n assert(static_cast<int>(decoded.size()) == len * 4);\n memcpy(pLayer.tileIds, decoded.data(), 4 * len);\n }\n else if (!strcmp(szCompression, \"gzip\"))\n {\n int err;\n z_stream d_stream; \/\/ decompression stream\n\n d_stream.zalloc = (alloc_func)0;\n d_stream.zfree = (free_func)0;\n d_stream.opaque = (voidpf)0;\n\n d_stream.next_in = reinterpret_cast<Bytef*>(decoded.data()); \/\/ where deflated is a pointer the the compressed data buffer\n d_stream.avail_in = static_cast<uInt>(decoded.size()); \/\/ where deflatedLen is the length of the compressed data\n d_stream.next_out = reinterpret_cast<Bytef*>(pLayer.tileIds); \/\/ where inflated is a pointer to the resulting uncompressed data buffer\n d_stream.avail_out = static_cast<uInt>(len * 4); \/\/ where inflatedLen is the size of the uncompressed data buffer\n\n err = inflateInit2(&d_stream, 31);\n assert(err == Z_OK);\n err = inflate(&d_stream, Z_FINISH);\n assert(err == Z_STREAM_END);\n err = inflateEnd(&d_stream);\n assert(err == Z_OK);\n }\n else if (!strcmp(szCompression, \"zlib\"))\n {\n int err;\n z_stream d_stream; \/\/ decompression stream\n\n d_stream.zalloc = (alloc_func)0;\n d_stream.zfree = (free_func)0;\n d_stream.opaque = (voidpf)0;\n\n d_stream.next_in = reinterpret_cast<Bytef*>(decoded.data()); \/\/ where deflated is a pointer the the compressed data buffer\n d_stream.avail_in = static_cast<uInt>(decoded.size()); \/\/ where deflatedLen is the length of the compressed data\n d_stream.next_out = reinterpret_cast<Bytef*>(pLayer.tileIds); \/\/ where inflated is a pointer to the resulting uncompressed data buffer\n d_stream.avail_out = static_cast<uInt>(len * 4); \/\/ where inflatedLen is the size of the uncompressed data buffer\n\n err = inflateInit2(&d_stream, 15 + 32);\n assert(err == Z_OK);\n err = inflate(&d_stream, Z_FINISH);\n assert(err == Z_STREAM_END);\n err = inflateEnd(&d_stream);\n assert(err == Z_OK);\n }\n }\n }\n\n \/\/ Resolve the tiles to tilesets\n pLayer.tiles = new sTile[len];\n for (int i = 0; i < len; ++i)\n {\n auto pTile = pLayer.tiles + i;\n auto tileId = pLayer.tileIds[i];\n if (tileId == 0)\n {\n continue;\n }\n auto pTileSet = m_tileSets;\n for (int j = 0; j < m_tilesetCount; ++j, pTileSet)\n {\n if (pTileSet->firstId > static_cast<int>(tileId)) break;\n }\n pTile->pTileset = pTileSet;\n auto texSize = pTileSet->pTexture->getSize();\n auto fitW = texSize.x \/ 40;\n auto fitH = texSize.y \/ 40;\n auto onTextureId = tileId - pTileSet->firstId;\n pTile->UVs.x = static_cast<float>((onTextureId % fitW) * pTileSet->tileWidth) \/ static_cast<float>(texSize.x);\n pTile->UVs.y = static_cast<float>((onTextureId \/ fitH) * pTileSet->tileHeight) \/ static_cast<float>(texSize.y);\n pTile->UVs.z = static_cast<float>((onTextureId % fitW + 1) * pTileSet->tileWidth) \/ static_cast<float>(texSize.x);\n pTile->UVs.w = static_cast<float>((onTextureId \/ fitH + 1) * pTileSet->tileHeight) \/ static_cast<float>(texSize.y);\n pTile->rect.x = static_cast<float>((i % pLayer.width) * pTileSet->tileWidth);\n pTile->rect.y = static_cast<float>((i \/ pLayer.height) * pTileSet->tileHeight);\n pTile->rect.z = static_cast<float>(pTileSet->tileWidth);\n pTile->rect.w = static_cast<float>(pTileSet->tileHeight);\n }\n\n ++m_layerCount;\n }\n else if (!strcmp(pXMLLayer->Name(), \"objectgroup\"))\n {\n m_layers[m_layerCount] = new sObjectLayer();\n auto &pLayer = *(sObjectLayer*)m_layers[m_layerCount];\n\n pLayer.name = pXMLLayer->Attribute(\"name\");\n if (pXMLLayer->Attribute(\"visible\"))\n {\n pLayer.isVisible = pXMLLayer->BoolAttribute(\"visible\");\n }\n\n for (auto pXMLObject = pXMLLayer->FirstChildElement(\"object\"); pXMLObject; pXMLObject = pXMLObject->NextSiblingElement(\"object\"))\n {\n pLayer.objectCount++;\n }\n pLayer.pObjects = new sObject[pLayer.objectCount];\n pLayer.objectCount = 0;\n for (auto pXMLObject = pXMLLayer->FirstChildElement(\"object\"); pXMLObject; pXMLObject = pXMLObject->NextSiblingElement(\"object\"))\n {\n auto &object = pLayer.pObjects[pLayer.objectCount];\n pLayer.objectCount++;\n \n object.id = pXMLObject->IntAttribute(\"id\");\n if (pXMLObject->Attribute(\"name\")) object.name = pXMLObject->Attribute(\"name\");\n if (pXMLObject->Attribute(\"type\")) object.type = pXMLObject->Attribute(\"type\");\n object.position.x = pXMLObject->FloatAttribute(\"x\");\n object.position.y = pXMLObject->FloatAttribute(\"y\");\n object.size.x = pXMLObject->FloatAttribute(\"width\");\n object.size.y = pXMLObject->FloatAttribute(\"160\");\n\n auto pXMLProperties = pXMLObject->FirstChildElement(\"properties\");\n if (pXMLProperties)\n {\n for (auto pXMLProperty = pXMLProperties->FirstChildElement(\"property\"); pXMLProperty; pXMLProperty = pXMLProperty->NextSiblingElement(\"property\"))\n {\n if (pXMLProperty->Attribute(\"name\") &&\n pXMLProperty->Attribute(\"value\"))\n {\n object.properties[pXMLProperty->Attribute(\"name\")] = pXMLProperty->Attribute(\"value\");\n }\n }\n }\n }\n\n ++m_layerCount;\n }\n }\n\n \/\/TODO: Compile the graphics by batch of 16x16 terrain chunks\n }\n\n TiledMap::~TiledMap()\n {\n if (m_layers)\n {\n for (auto i = 0; i < m_layerCount; ++i)\n {\n if (m_layers[i]) delete m_layers[i];\n }\n delete[] m_layers;\n }\n if (m_tileSets) delete[] m_tileSets;\n }\n\n TiledMap::sLayer *TiledMap::getLayer(const std::string &name) const\n {\n for (int i = 0; i < m_layerCount; ++i)\n {\n if (m_layers[i]->name == name) return m_layers[i];\n }\n return nullptr;\n }\n\n void TiledMap::render(const RECT &rect)\n {\n for (int i = 0; i < m_layerCount; ++i)\n {\n if (!m_layers[i]->isVisible) continue;\n renderLayer(rect, m_layers[i]);\n }\n }\n\n void TiledMap::renderLayer(const RECT &rect, int index)\n {\n renderLayer(rect, m_layers[index]);\n }\n\n void TiledMap::renderLayer(const RECT &rect, const std::string &name)\n {\n renderLayer(rect, getLayer(name));\n }\n\n void TiledMap::renderLayer(const RECT &in_rect, sLayer *in_pLayer)\n {\n auto pLayer = dynamic_cast<sTileLayerInternal*>(in_pLayer);\n if (!pLayer) return;\n\n RECT rect = in_rect;\n rect.left = std::max<>(0l, rect.left);\n rect.top = std::max<>(0l, rect.top);\n rect.right = std::min<>(static_cast<LONG>(m_width - 1), rect.right);\n rect.bottom = std::min<>(static_cast<LONG>(m_height - 1), rect.bottom);\n\n egModelPush();\n egModelIdentity();\n egModelMult(&m_transform._11);\n\n OSB->begin();\n for (LONG y = rect.top; y <= rect.bottom; ++y)\n {\n sTile *pTile = pLayer->tiles + y * m_width + rect.left;\n for (LONG x = rect.left; x <= rect.right; ++x, ++pTile)\n {\n if (!pTile->pTileset) continue;\n OSB->drawRectWithUVs(pTile->pTileset->pTexture, pTile->rect, pTile->UVs);\n }\n }\n OSB->end();\n\n egModelPop();\n }\n};\n<commit_msg>Fixed size.y not being set<commit_after>#include <cassert>\n#include \"tinyxml2.h\"\n#include \"onut.h\"\n#include \"crypto.h\"\n#include \"zlib\/zlib.h\"\n\nnamespace onut\n{\n TiledMap::sLayer::~sLayer()\n {\n }\n\n TiledMap::sTileLayer::~sTileLayer()\n {\n if (tileIds) delete[] tileIds;\n }\n\n TiledMap::sObjectLayer::~sObjectLayer()\n {\n if (pObjects) delete[] pObjects;\n }\n\n TiledMap::sTileLayerInternal::~sTileLayerInternal()\n {\n if (tiles) delete[] tiles;\n }\n\n TiledMap::TiledMap(const std::string &map, onut::ContentManager<> *pContentManager)\n {\n tinyxml2::XMLDocument doc;\n doc.LoadFile(map.c_str());\n assert(!doc.Error());\n auto pXMLMap = doc.FirstChildElement(\"map\");\n assert(pXMLMap);\n\n \/\/ Tilesets\n for (auto pXMLTileset = pXMLMap->FirstChildElement(\"tileset\"); pXMLTileset; pXMLTileset = pXMLTileset->NextSiblingElement(\"tileset\"))\n {\n ++m_tilesetCount;\n }\n assert(m_tilesetCount);\n m_tileSets = new sTileSet[m_tilesetCount];\n m_tilesetCount = 0;\n for (auto pXMLTileset = pXMLMap->FirstChildElement(\"tileset\"); pXMLTileset; pXMLTileset = pXMLTileset->NextSiblingElement(\"tileset\"))\n {\n auto &pTileSet = m_tileSets[m_tilesetCount];\n\n pTileSet.name = pXMLTileset->Attribute(\"name\");\n pTileSet.firstId = pXMLTileset->IntAttribute(\"firstgid\");\n assert(pTileSet.firstId);\n pTileSet.tileWidth = pXMLTileset->IntAttribute(\"tilewidth\");\n assert(pTileSet.tileWidth);\n pTileSet.tileHeight = pXMLTileset->IntAttribute(\"tileheight\");\n assert(pTileSet.tileHeight);\n\n auto pXMLImage = pXMLTileset->FirstChildElement(\"image\");\n assert(pXMLImage);\n auto szImageFilename = pXMLImage->Attribute(\"source\");\n assert(szImageFilename);\n auto filename = getPath(map) + \"\/\" + szImageFilename;\n pTileSet.pTexture = pContentManager->getResource<Texture>(filename);\n\n ++m_tilesetCount;\n }\n\n \/\/ Layers\n for (auto pXMLLayer = pXMLMap->FirstChildElement(); pXMLLayer; pXMLLayer = pXMLLayer->NextSiblingElement())\n {\n if (!strcmp(pXMLLayer->Name(), \"layer\") ||\n !strcmp(pXMLLayer->Name(), \"objectgroup\"))\n {\n ++m_layerCount;\n }\n }\n assert(m_layerCount);\n m_layers = new sLayer*[m_layerCount];\n m_layerCount = 0;\n for (auto pXMLLayer = pXMLMap->FirstChildElement(); pXMLLayer; pXMLLayer = pXMLLayer->NextSiblingElement())\n {\n if (!strcmp(pXMLLayer->Name(), \"layer\"))\n {\n m_layers[m_layerCount] = new sTileLayerInternal();\n auto &pLayer = *(sTileLayerInternal*)m_layers[m_layerCount];\n\n pLayer.name = pXMLLayer->Attribute(\"name\");\n if (pXMLLayer->Attribute(\"visible\"))\n {\n pLayer.isVisible = pXMLLayer->BoolAttribute(\"visible\");\n }\n\n pLayer.width = pXMLLayer->IntAttribute(\"width\");\n assert(pLayer.width);\n pLayer.height = pXMLLayer->IntAttribute(\"height\");\n assert(pLayer.height);\n m_width = std::max<>(m_width, pLayer.width);\n m_height = std::max<>(m_height, pLayer.height);\n auto len = pLayer.width * pLayer.height;\n pLayer.tileIds = new uint32_t[len];\n\n auto pXMLData = pXMLLayer->FirstChildElement(\"data\");\n assert(pXMLData);\n auto szEncoding = pXMLData->Attribute(\"encoding\");\n auto szCompression = pXMLData->Attribute(\"compression\");\n\n if (!szEncoding)\n {\n int i = 0;\n for (auto pXMLTile = pXMLData->FirstChildElement(\"tile\"); pXMLTile; pXMLTile = pXMLTile->NextSiblingElement(\"tile\"), ++i)\n {\n auto id = pXMLTile->IntAttribute(\"gid\");\n assert(i < len);\n pLayer.tileIds[i] = id;\n }\n assert(i == len);\n }\n else\n {\n auto szData = pXMLData->GetText();\n assert(szData);\n auto pos = std::string(szData).find_first_not_of(\"\\n \");\n assert(pos < strlen(szData));\n szData = szData + pos;\n\n if (!strcmp(szEncoding, \"csv\"))\n {\n auto csvData = splitString(szData, ',');\n assert(static_cast<int>(csvData.size()) == len);\n for (int i = 0; i < len; ++i)\n {\n try\n {\n pLayer.tileIds[i] = static_cast<uint32_t>(std::stoul(csvData[i]));\n }\n catch (std::exception e)\n {\n assert(false);\n }\n }\n }\n else if (!strcmp(szEncoding, \"base64\"))\n {\n auto decoded = base64_decode(szData);\n if (!szCompression)\n {\n assert(static_cast<int>(decoded.size()) == len * 4);\n memcpy(pLayer.tileIds, decoded.data(), 4 * len);\n }\n else if (!strcmp(szCompression, \"gzip\"))\n {\n int err;\n z_stream d_stream; \/\/ decompression stream\n\n d_stream.zalloc = (alloc_func)0;\n d_stream.zfree = (free_func)0;\n d_stream.opaque = (voidpf)0;\n\n d_stream.next_in = reinterpret_cast<Bytef*>(decoded.data()); \/\/ where deflated is a pointer the the compressed data buffer\n d_stream.avail_in = static_cast<uInt>(decoded.size()); \/\/ where deflatedLen is the length of the compressed data\n d_stream.next_out = reinterpret_cast<Bytef*>(pLayer.tileIds); \/\/ where inflated is a pointer to the resulting uncompressed data buffer\n d_stream.avail_out = static_cast<uInt>(len * 4); \/\/ where inflatedLen is the size of the uncompressed data buffer\n\n err = inflateInit2(&d_stream, 31);\n assert(err == Z_OK);\n err = inflate(&d_stream, Z_FINISH);\n assert(err == Z_STREAM_END);\n err = inflateEnd(&d_stream);\n assert(err == Z_OK);\n }\n else if (!strcmp(szCompression, \"zlib\"))\n {\n int err;\n z_stream d_stream; \/\/ decompression stream\n\n d_stream.zalloc = (alloc_func)0;\n d_stream.zfree = (free_func)0;\n d_stream.opaque = (voidpf)0;\n\n d_stream.next_in = reinterpret_cast<Bytef*>(decoded.data()); \/\/ where deflated is a pointer the the compressed data buffer\n d_stream.avail_in = static_cast<uInt>(decoded.size()); \/\/ where deflatedLen is the length of the compressed data\n d_stream.next_out = reinterpret_cast<Bytef*>(pLayer.tileIds); \/\/ where inflated is a pointer to the resulting uncompressed data buffer\n d_stream.avail_out = static_cast<uInt>(len * 4); \/\/ where inflatedLen is the size of the uncompressed data buffer\n\n err = inflateInit2(&d_stream, 15 + 32);\n assert(err == Z_OK);\n err = inflate(&d_stream, Z_FINISH);\n assert(err == Z_STREAM_END);\n err = inflateEnd(&d_stream);\n assert(err == Z_OK);\n }\n }\n }\n\n \/\/ Resolve the tiles to tilesets\n pLayer.tiles = new sTile[len];\n for (int i = 0; i < len; ++i)\n {\n auto pTile = pLayer.tiles + i;\n auto tileId = pLayer.tileIds[i];\n if (tileId == 0)\n {\n continue;\n }\n auto pTileSet = m_tileSets;\n for (int j = 0; j < m_tilesetCount; ++j, pTileSet)\n {\n if (pTileSet->firstId > static_cast<int>(tileId)) break;\n }\n pTile->pTileset = pTileSet;\n auto texSize = pTileSet->pTexture->getSize();\n auto fitW = texSize.x \/ 40;\n auto fitH = texSize.y \/ 40;\n auto onTextureId = tileId - pTileSet->firstId;\n pTile->UVs.x = static_cast<float>((onTextureId % fitW) * pTileSet->tileWidth) \/ static_cast<float>(texSize.x);\n pTile->UVs.y = static_cast<float>((onTextureId \/ fitH) * pTileSet->tileHeight) \/ static_cast<float>(texSize.y);\n pTile->UVs.z = static_cast<float>((onTextureId % fitW + 1) * pTileSet->tileWidth) \/ static_cast<float>(texSize.x);\n pTile->UVs.w = static_cast<float>((onTextureId \/ fitH + 1) * pTileSet->tileHeight) \/ static_cast<float>(texSize.y);\n pTile->rect.x = static_cast<float>((i % pLayer.width) * pTileSet->tileWidth);\n pTile->rect.y = static_cast<float>((i \/ pLayer.height) * pTileSet->tileHeight);\n pTile->rect.z = static_cast<float>(pTileSet->tileWidth);\n pTile->rect.w = static_cast<float>(pTileSet->tileHeight);\n }\n\n ++m_layerCount;\n }\n else if (!strcmp(pXMLLayer->Name(), \"objectgroup\"))\n {\n m_layers[m_layerCount] = new sObjectLayer();\n auto &pLayer = *(sObjectLayer*)m_layers[m_layerCount];\n\n pLayer.name = pXMLLayer->Attribute(\"name\");\n if (pXMLLayer->Attribute(\"visible\"))\n {\n pLayer.isVisible = pXMLLayer->BoolAttribute(\"visible\");\n }\n\n for (auto pXMLObject = pXMLLayer->FirstChildElement(\"object\"); pXMLObject; pXMLObject = pXMLObject->NextSiblingElement(\"object\"))\n {\n pLayer.objectCount++;\n }\n pLayer.pObjects = new sObject[pLayer.objectCount];\n pLayer.objectCount = 0;\n for (auto pXMLObject = pXMLLayer->FirstChildElement(\"object\"); pXMLObject; pXMLObject = pXMLObject->NextSiblingElement(\"object\"))\n {\n auto &object = pLayer.pObjects[pLayer.objectCount];\n pLayer.objectCount++;\n \n object.id = pXMLObject->IntAttribute(\"id\");\n if (pXMLObject->Attribute(\"name\")) object.name = pXMLObject->Attribute(\"name\");\n if (pXMLObject->Attribute(\"type\")) object.type = pXMLObject->Attribute(\"type\");\n object.position.x = pXMLObject->FloatAttribute(\"x\");\n object.position.y = pXMLObject->FloatAttribute(\"y\");\n object.size.x = pXMLObject->FloatAttribute(\"width\");\n object.size.y = pXMLObject->FloatAttribute(\"height\");\n\n auto pXMLProperties = pXMLObject->FirstChildElement(\"properties\");\n if (pXMLProperties)\n {\n for (auto pXMLProperty = pXMLProperties->FirstChildElement(\"property\"); pXMLProperty; pXMLProperty = pXMLProperty->NextSiblingElement(\"property\"))\n {\n if (pXMLProperty->Attribute(\"name\") &&\n pXMLProperty->Attribute(\"value\"))\n {\n object.properties[pXMLProperty->Attribute(\"name\")] = pXMLProperty->Attribute(\"value\");\n }\n }\n }\n }\n\n ++m_layerCount;\n }\n }\n\n \/\/TODO: Compile the graphics by batch of 16x16 terrain chunks\n }\n\n TiledMap::~TiledMap()\n {\n if (m_layers)\n {\n for (auto i = 0; i < m_layerCount; ++i)\n {\n if (m_layers[i]) delete m_layers[i];\n }\n delete[] m_layers;\n }\n if (m_tileSets) delete[] m_tileSets;\n }\n\n TiledMap::sLayer *TiledMap::getLayer(const std::string &name) const\n {\n for (int i = 0; i < m_layerCount; ++i)\n {\n if (m_layers[i]->name == name) return m_layers[i];\n }\n return nullptr;\n }\n\n void TiledMap::render(const RECT &rect)\n {\n for (int i = 0; i < m_layerCount; ++i)\n {\n if (!m_layers[i]->isVisible) continue;\n renderLayer(rect, m_layers[i]);\n }\n }\n\n void TiledMap::renderLayer(const RECT &rect, int index)\n {\n renderLayer(rect, m_layers[index]);\n }\n\n void TiledMap::renderLayer(const RECT &rect, const std::string &name)\n {\n renderLayer(rect, getLayer(name));\n }\n\n void TiledMap::renderLayer(const RECT &in_rect, sLayer *in_pLayer)\n {\n auto pLayer = dynamic_cast<sTileLayerInternal*>(in_pLayer);\n if (!pLayer) return;\n\n RECT rect = in_rect;\n rect.left = std::max<>(0l, rect.left);\n rect.top = std::max<>(0l, rect.top);\n rect.right = std::min<>(static_cast<LONG>(m_width - 1), rect.right);\n rect.bottom = std::min<>(static_cast<LONG>(m_height - 1), rect.bottom);\n\n egModelPush();\n egModelIdentity();\n egModelMult(&m_transform._11);\n\n OSB->begin();\n for (LONG y = rect.top; y <= rect.bottom; ++y)\n {\n sTile *pTile = pLayer->tiles + y * m_width + rect.left;\n for (LONG x = rect.left; x <= rect.right; ++x, ++pTile)\n {\n if (!pTile->pTileset) continue;\n OSB->drawRectWithUVs(pTile->pTileset->pTexture, pTile->rect, pTile->UVs);\n }\n }\n OSB->end();\n\n egModelPop();\n }\n};\n<|endoftext|>"} {"text":"<commit_before>\/\/ Copyright (c) 2019 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 <tuple>\n#include \"common.hh\"\n\nnamespace avl7 {\n\nstruct AVLNodeBase;\nusing BasePtr = AVLNodeBase*;\nusing ConstBasePtr = const AVLNodeBase*;\n\nstatic constexpr int kHeightMask = 0xff;\n\nstruct AVLNodeBase {\n BasePtr parent;\n BasePtr left;\n BasePtr right;\n int height;\n\n inline int lheight() const noexcept { return left ? left->height : 0; }\n inline int rheight() const noexcept { return right ? right->height : 0; }\n inline void update_height() noexcept { height = Xt::max(lheight(), rheight()) + 1; }\n\n static inline BasePtr _minimum(BasePtr x) noexcept {\n while (x->left != nullptr)\n x = x->left;\n return x;\n }\n\n static inline ConstBasePtr _minimum(ConstBasePtr x) noexcept {\n return _minimum(const_cast<BasePtr>(x));\n }\n\n static inline BasePtr _maximum(BasePtr x) noexcept {\n while (x->right != nullptr)\n x = x->right;\n return x;\n }\n\n static inline ConstBasePtr _maximum(ConstBasePtr x) noexcept {\n return _maximum(const_cast<BasePtr>(x));\n }\n};\n\ninline void __avlnode_replace_child(\n BasePtr x, BasePtr y, BasePtr p, BasePtr& root) noexcept {\n if (p != nullptr) {\n if (root == x)\n root = y;\n else if (p->left == x)\n p->left = y;\n else\n p->right = y;\n }\n else {\n root = y;\n }\n}\n\ninline BasePtr avlnode_rotate_left(BasePtr x, BasePtr& root) noexcept {\n \/\/ | |\n \/\/ x y\n \/\/ \\ \/ \\\n \/\/ y x b\n \/\/ \/ \\ \\\n \/\/ [a] b [a]\n\n BasePtr y = x->right;\n x->right = y->left;\n if (x->right != nullptr)\n x->right->parent = x;\n y->parent = x->parent;\n __avlnode_replace_child(x, y, x->parent, root);\n y->left = x;\n x->parent = y;\n x->update_height();\n y->update_height();\n\n return y;\n}\n\ninline BasePtr avlnode_rotate_right(BasePtr x, BasePtr& root) noexcept {\n \/\/ | |\n \/\/ x y\n \/\/ \/ \/ \\\n \/\/ y a x\n \/\/ \/ \\ \/\n \/\/ a [b] [b]\n\n BasePtr y = x->left;\n x->left = y->right;\n if (x->left != nullptr)\n x->left->parent = x;\n y->parent = x->parent;\n __avlnode_replace_child(x, y, x->parent, root);\n y->right = x;\n x->parent = y;\n x->update_height();\n y->update_height();\n\n return y;\n}\n\ntemplate <typename ValueType> struct AVLNode : public AVLNodeBase {\n ValueType value;\n};\n\nstruct AVLIterBase {\n BasePtr _node{};\n\n AVLIterBase() noexcept {}\n AVLIterBase(BasePtr x) noexcept : _node(x) {}\n AVLIterBase(ConstBasePtr x) noexcept : _node(const_cast<BasePtr>(x)) {}\n\n void increment() noexcept {\n if (_node->right != nullptr) {\n _node = _node->right;\n while (_node->left != nullptr)\n _node = _node->left;\n }\n else {\n BasePtr y = _node->parent;\n while (_node == y->right) {\n _node = y;\n y = y->parent;\n }\n if (_node->right != y)\n _node = y;\n }\n }\n\n void decrement() noexcept {\n if (_node->height == kHeightMask && _node->parent->parent == _node) {\n _node = _node->right;\n }\n else if (_node->left != nullptr) {\n _node = _node->left;\n while (_node->right != nullptr)\n _node = _node->right;\n }\n else {\n BasePtr y = _node->parent;\n while (_node == y->left) {\n _node = y;\n y = y->parent;\n }\n _node = y;\n }\n }\n};\n\ntemplate <typename _Tp, typename _Ref, typename _Ptr>\nstruct AVLIter : public AVLIterBase {\n using Iter = AVLIter<_Tp, _Tp&, _Tp*>;\n using Self = AVLIter<_Tp, _Ref, _Ptr>;\n using Ref = _Ref;\n using Ptr = _Ptr;\n using Link = AVLNode<_Tp>*;\n using ConstLink = const AVLNode<_Tp>*;\n\n AVLIter() noexcept {}\n AVLIter(BasePtr x) noexcept : AVLIterBase(x) {}\n AVLIter(ConstBasePtr x) noexcept : AVLIterBase(x) {}\n AVLIter(const Iter& x) noexcept : AVLIterBase(x._node) {}\n\n inline Link node() noexcept { return Link(_node); }\n inline ConstLink node() const noexcept { return ConstLink(_node); }\n\n inline bool operator==(const Self& r) const noexcept { return _node == r._node; }\n inline bool operator!=(const Self& r) const noexcept { return _node != r._node; }\n inline Ref operator*() const noexcept { return Link(_node)->value; }\n inline Ptr operator->() const noexcept { return &Link(_node)->value; }\n Self& operator++() noexcept { increment(); return *this; }\n Self operator++(int) noexcept { Self tmp(*this); increment(); return tmp; }\n Self& operator--() noexcept { decrement(); return *this; }\n Self operator--(int) noexcept { Self tmp(*this); decrement(); return tmp; }\n};\n\ntemplate <typename Tp,\n typename Less = std::less<Tp>, typename Equal = std::equal_to<Tp>>\nclass AVLTree final : private UnCopyable {\npublic:\n using ValueType = Tp;\n using SizeType = std::size_t;\n using Iter = AVLIter<Tp, Tp&, Tp*>;\n using ConstIter = AVLIter<Tp, const Tp&, const Tp*>;\n using Ref = Tp&;\n using ConstRef = const Tp&;\nprivate:\n using Node = AVLNode<ValueType>;\n using Link = Node*;\n using ConstLink = const Node*;\n using Alloc = Xt::SimpleAlloc<Node>;\n\n SizeType size_{};\n Node head_{};\n Less less_comp_{};\n Equal equal_comp_{};\n\n inline Link& _root() noexcept { return (Link&)head_.parent; }\n inline ConstLink& _root() const noexcept { return (ConstLink&)head_.parent; }\n inline Link& _tail() noexcept { return (Link&)&head_; }\n inline ConstLink& _tail() const noexcept { return (ConstLink&)&head_; }\n inline Link& _lmost() noexcept { return (Link&)head_.left; }\n inline ConstLink& _lmost() const noexcept { return (ConstLink&)head_.left; }\n inline Link& _rmost() noexcept { return (Link&)head_.right; }\n inline ConstLink& _rmost() const noexcept { return (ConstLink&)head_.right; }\n\n static inline Link _parent(BasePtr& x) noexcept { return Link(x->parent); }\n static inline ConstLink _parent(ConstBasePtr x) noexcept { return _parent(const_cast<BasePtr>(x)); }\n static inline Link _left(BasePtr x) noexcept { return Link(x->left); }\n static inline ConstLink _left(ConstBasePtr x) noexcept { return _left(const_cast<BasePtr>(x)); }\n static inline Link _right(BasePtr x) noexcept { return Link(x->right); }\n static inline ConstLink _right(ConstBasePtr x) noexcept { return _right(const_cast<BasePtr>(x)); }\n\n inline Link get_node(const ValueType& x) { return Alloc::allocate(); }\n inline void put_node(Link p) { Alloc::deallocate(p); }\n\n inline void init() noexcept {\n size_ = 0;\n head_.parent = nullptr;\n head_.left = head_.right = &head_;\n head_.height = kHeightMask;\n }\n\n Link create_node(const ValueType& x) {\n Link tmp = get_node(x);\n try {\n Xt::construct(&tmp->value, x);\n }\n catch (...) {\n put_node(tmp);\n throw;\n }\n return tmp;\n }\n\n void destroy_node(Link p) {\n Xt::destroy(&p->value);\n put_node(p);\n }\npublic:\n AVLTree() noexcept { init(); }\n ~AVLTree() noexcept {}\n};\n\n\n}\n\nvoid test_avl7() {\n avl7::AVLTree<int> t;\n}\n<commit_msg>:construction: chore(avl): add insert and erase methods for avl-tree<commit_after>\/\/ Copyright (c) 2019 ASMlover. All rights reserved.\n\/\/\n\/\/ Redistribution and use in source and binary forms, with or without\n\/\/ modification, are permitted provided that the following conditions\n\/\/ are met:\n\/\/\n\/\/ * Redistributions of source code must retain the above copyright\n\/\/ notice, this list ofconditions and the following disclaimer.\n\/\/\n\/\/ * Redistributions in binary form must reproduce the above copyright\n\/\/ notice, this list of conditions and the following disclaimer in\n\/\/ the documentation and\/or other materialsprovided with the\n\/\/ distribution.\n\/\/\n\/\/ THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS\n\/\/ \"AS IS\" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT\n\/\/ LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS\n\/\/ FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE\n\/\/ COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT,\n\/\/ INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING,\n\/\/ BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;\n\/\/ LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER\n\/\/ CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT\n\/\/ LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN\n\/\/ ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE\n\/\/ POSSIBILITY OF SUCH DAMAGE.\n#include <iostream>\n#include <tuple>\n#include \"common.hh\"\n\nnamespace avl7 {\n\nstruct AVLNodeBase;\nusing BasePtr = AVLNodeBase*;\nusing ConstBasePtr = const AVLNodeBase*;\n\nstatic constexpr int kHeightMask = 0xff;\n\nstruct AVLNodeBase {\n BasePtr parent;\n BasePtr left;\n BasePtr right;\n int height;\n\n inline int lheight() const noexcept { return left ? left->height : 0; }\n inline int rheight() const noexcept { return right ? right->height : 0; }\n inline void update_height() noexcept { height = Xt::max(lheight(), rheight()) + 1; }\n\n static inline BasePtr _minimum(BasePtr x) noexcept {\n while (x->left != nullptr)\n x = x->left;\n return x;\n }\n\n static inline ConstBasePtr _minimum(ConstBasePtr x) noexcept {\n return _minimum(const_cast<BasePtr>(x));\n }\n\n static inline BasePtr _maximum(BasePtr x) noexcept {\n while (x->right != nullptr)\n x = x->right;\n return x;\n }\n\n static inline ConstBasePtr _maximum(ConstBasePtr x) noexcept {\n return _maximum(const_cast<BasePtr>(x));\n }\n};\n\ninline void __avlnode_replace_child(\n BasePtr x, BasePtr y, BasePtr p, BasePtr& root) noexcept {\n if (p != nullptr) {\n if (root == x)\n root = y;\n else if (p->left == x)\n p->left = y;\n else\n p->right = y;\n }\n else {\n root = y;\n }\n}\n\ninline BasePtr avlnode_rotate_left(BasePtr x, BasePtr& root) noexcept {\n \/\/ | |\n \/\/ x y\n \/\/ \\ \/ \\\n \/\/ y x b\n \/\/ \/ \\ \\\n \/\/ [a] b [a]\n\n BasePtr y = x->right;\n x->right = y->left;\n if (x->right != nullptr)\n x->right->parent = x;\n y->parent = x->parent;\n __avlnode_replace_child(x, y, x->parent, root);\n y->left = x;\n x->parent = y;\n x->update_height();\n y->update_height();\n\n return y;\n}\n\ninline BasePtr avlnode_rotate_right(BasePtr x, BasePtr& root) noexcept {\n \/\/ | |\n \/\/ x y\n \/\/ \/ \/ \\\n \/\/ y a x\n \/\/ \/ \\ \/\n \/\/ a [b] [b]\n\n BasePtr y = x->left;\n x->left = y->right;\n if (x->left != nullptr)\n x->left->parent = x;\n y->parent = x->parent;\n __avlnode_replace_child(x, y, x->parent, root);\n y->right = x;\n x->parent = y;\n x->update_height();\n y->update_height();\n\n return y;\n}\n\ninline BasePtr avlnode_fix_left(BasePtr a, BasePtr& root) noexcept {\n \/\/ | | |\n \/\/ a a c\n \/\/ \/ \\ \/ \\ \/ \\\n \/\/ [d] b [d] c \/ \\\n \/\/ \/ \\ \/ \\ a b\n \/\/ c [g] e b \/ \\ \/ \\\n \/\/ \/ \\ \/ \\ [d] e f [g]\n \/\/ e f f [g]\n\n BasePtr b = a->right;\n if (b->lheight() > b->rheight())\n avlnode_rotate_right(b, root);\n a = avlnode_rotate_left(a, root);\n\n return a;\n}\n\ninline BasePtr avlnode_fix_right(BasePtr a, BasePtr& root) noexcept {\n \/\/ | | |\n \/\/ a a c\n \/\/ \/ \\ \/ \\ \/ \\\n \/\/ b [g] c [g] \/ \\\n \/\/ \/ \\ \/ \\ b a\n \/\/ [d] c b f \/ \\ \/ \\\n \/\/ \/ \\ \/ \\ [d] e f [g]\n \/\/ e f [d] e\n\n BasePtr b = a->left;\n if (b->lheight() < b->rheight())\n avlnode_rotate_left(b, root);\n a = avlnode_rotate_right(a, root);\n\n return a;\n}\n\ninline void avlnode_rebalance(BasePtr node, BasePtr& root) noexcept {\n while (node != root) {\n int lh = node->lheight();\n int rh = node->rheight();\n int height = Xt::max(lh, rh) + 1;\n int diff = lh - rh;\n\n if (node->height != height)\n node->height = height;\n else if (diff >= -1 && diff <= 1)\n break;\n\n if (diff <= -2)\n node = avlnode_fix_left(node, root);\n else if (diff >= 2)\n node = avlnode_fix_right(node, root);\n\n node = node->parent;\n }\n}\n\ninline void avlnode_insert(\n bool insert_left, BasePtr x, BasePtr p, AVLNodeBase& header) noexcept {\n BasePtr& root = header.parent;\n\n x->parent = p;\n x->left = x->right = nullptr;\n x->height = 0;\n\n if (insert_left) {\n p->left = x;\n if (p == &header)\n header.parent = header.right = x;\n else if (p == header.left)\n header.left = x;\n }\n else {\n p->right = x;\n if (p == header.right)\n header.right = x;\n }\n avlnode_rebalance(x, root);\n}\n\ninline void avlnode_erase(BasePtr x, AVLNodeBase& header) noexcept {\n BasePtr& root = header.parent;\n BasePtr& lmost = header.left;\n BasePtr& rmost = header.right;\n BasePtr orig = x;\n\n BasePtr p = nullptr;\n BasePtr y = nullptr;\n if (x->left != nullptr && x->right != nullptr) {\n x = x->right;\n while (x->left != nullptr)\n x = x->left;\n y = x->right;\n p = x->parent;\n if (y != nullptr)\n y->parent = p;\n __avlnode_replace_child(x, y, p, root);\n if (x->parent == orig)\n p = x;\n x->parent = orig->parent;\n x->left = orig->left;\n x->right = orig->right;\n x->height = orig->height;\n __avlnode_replace_child(orig, x, x->parent, root);\n if (x->right != nullptr)\n x->right->parent = x;\n }\n else {\n y = x->left != nullptr ? x->left : x->right;\n p = x->parent;\n __avlnode_replace_child(x, y, p, root);\n if (y != nullptr)\n y->parent = p;\n }\n if (p != nullptr)\n avlnode_rebalance(p, root);\n\n if (root == orig)\n root = y;\n\n if (lmost == orig || lmost == nullptr)\n lmost = root != nullptr ? AVLNodeBase::_minimum(root) : &header;\n if (rmost == orig || rmost == nullptr)\n rmost = root != nullptr ? AVLNodeBase::_maximum(root) : &header;\n}\n\ntemplate <typename ValueType> struct AVLNode : public AVLNodeBase {\n ValueType value;\n};\n\nstruct AVLIterBase {\n BasePtr _node{};\n\n AVLIterBase() noexcept {}\n AVLIterBase(BasePtr x) noexcept : _node(x) {}\n AVLIterBase(ConstBasePtr x) noexcept : _node(const_cast<BasePtr>(x)) {}\n\n void increment() noexcept {\n if (_node->right != nullptr) {\n _node = _node->right;\n while (_node->left != nullptr)\n _node = _node->left;\n }\n else {\n BasePtr y = _node->parent;\n while (_node == y->right) {\n _node = y;\n y = y->parent;\n }\n if (_node->right != y)\n _node = y;\n }\n }\n\n void decrement() noexcept {\n if (_node->height == kHeightMask && _node->parent->parent == _node) {\n _node = _node->right;\n }\n else if (_node->left != nullptr) {\n _node = _node->left;\n while (_node->right != nullptr)\n _node = _node->right;\n }\n else {\n BasePtr y = _node->parent;\n while (_node == y->left) {\n _node = y;\n y = y->parent;\n }\n _node = y;\n }\n }\n};\n\ntemplate <typename _Tp, typename _Ref, typename _Ptr>\nstruct AVLIter : public AVLIterBase {\n using Iter = AVLIter<_Tp, _Tp&, _Tp*>;\n using Self = AVLIter<_Tp, _Ref, _Ptr>;\n using Ref = _Ref;\n using Ptr = _Ptr;\n using Link = AVLNode<_Tp>*;\n using ConstLink = const AVLNode<_Tp>*;\n\n AVLIter() noexcept {}\n AVLIter(BasePtr x) noexcept : AVLIterBase(x) {}\n AVLIter(ConstBasePtr x) noexcept : AVLIterBase(x) {}\n AVLIter(const Iter& x) noexcept : AVLIterBase(x._node) {}\n\n inline Link node() noexcept { return Link(_node); }\n inline ConstLink node() const noexcept { return ConstLink(_node); }\n\n inline bool operator==(const Self& r) const noexcept { return _node == r._node; }\n inline bool operator!=(const Self& r) const noexcept { return _node != r._node; }\n inline Ref operator*() const noexcept { return Link(_node)->value; }\n inline Ptr operator->() const noexcept { return &Link(_node)->value; }\n Self& operator++() noexcept { increment(); return *this; }\n Self operator++(int) noexcept { Self tmp(*this); increment(); return tmp; }\n Self& operator--() noexcept { decrement(); return *this; }\n Self operator--(int) noexcept { Self tmp(*this); decrement(); return tmp; }\n};\n\ntemplate <typename Tp,\n typename Less = std::less<Tp>, typename Equal = std::equal_to<Tp>>\nclass AVLTree final : private UnCopyable {\npublic:\n using ValueType = Tp;\n using SizeType = std::size_t;\n using Iter = AVLIter<Tp, Tp&, Tp*>;\n using ConstIter = AVLIter<Tp, const Tp&, const Tp*>;\n using Ref = Tp&;\n using ConstRef = const Tp&;\nprivate:\n using Node = AVLNode<ValueType>;\n using Link = Node*;\n using ConstLink = const Node*;\n using Alloc = Xt::SimpleAlloc<Node>;\n\n SizeType size_{};\n Node head_{};\n Less less_comp_{};\n Equal equal_comp_{};\n\n inline Link& _root() noexcept { return (Link&)head_.parent; }\n inline ConstLink& _root() const noexcept { return (ConstLink&)head_.parent; }\n inline Link& _lmost() noexcept { return (Link&)head_.left; }\n inline ConstLink& _lmost() const noexcept { return (ConstLink&)head_.left; }\n inline Link& _rmost() noexcept { return (Link&)head_.right; }\n inline ConstLink& _rmost() const noexcept { return (ConstLink&)head_.right; }\n\n static inline Link _parent(BasePtr& x) noexcept { return Link(x->parent); }\n static inline ConstLink _parent(ConstBasePtr x) noexcept { return _parent(const_cast<BasePtr>(x)); }\n static inline Link _left(BasePtr x) noexcept { return Link(x->left); }\n static inline ConstLink _left(ConstBasePtr x) noexcept { return _left(const_cast<BasePtr>(x)); }\n static inline Link _right(BasePtr x) noexcept { return Link(x->right); }\n static inline ConstLink _right(ConstBasePtr x) noexcept { return _right(const_cast<BasePtr>(x)); }\n\n inline Link get_node(const ValueType& x) { return Alloc::allocate(); }\n inline void put_node(Link p) { Alloc::deallocate(p); }\n\n inline void init() noexcept {\n size_ = 0;\n head_.parent = nullptr;\n head_.left = head_.right = &head_;\n head_.height = kHeightMask;\n }\n\n Link create_node(const ValueType& x) {\n Link tmp = get_node(x);\n try {\n Xt::construct(&tmp->value, x);\n }\n catch (...) {\n put_node(tmp);\n throw;\n }\n return tmp;\n }\n\n void destroy_node(Link p) {\n Xt::destroy(&p->value);\n put_node(p);\n }\n\n inline std::tuple<bool, Link, bool> find_insert_pos(const ValueType& value) {\n Link x = _root();\n Link y = &head_;\n while (x != nullptr) {\n if (equal_comp_(value, x->value))\n return std::make_tuple(false, nullptr, false);\n\n y = x;\n x = less_comp_(value, x->value) ? _left(x) : _right(x);\n }\n\n bool insert_left = x != nullptr || y == &head_ || less_comp_(value, y->value);\n return std::make_tuple(true, y, insert_left);\n }\n\n void insert_aux(const ValueType& value) {\n auto [r, p, insert_left] = find_insert_pos(value);\n if (r) {\n avlnode_insert(insert_left, create_node(value), p, head_);\n ++size_;\n }\n }\n\n void erase_aux(Link p) {\n if (!empty()) {\n avlnode_erase(p, head_);\n destroy_node(p);\n --size_;\n }\n }\npublic:\n AVLTree() noexcept { init(); }\n ~AVLTree() noexcept {}\n\n inline bool empty() const noexcept { return size_ == 0; }\n inline SizeType size() const noexcept { return size_; }\n inline Iter begin() noexcept { return Iter(head_.left); }\n inline ConstIter begin() const noexcept { return ConstIter(head_.left); }\n inline Iter end() noexcept { return Iter(&head_); }\n inline ConstIter end() const noexcept { return ConstIter(&head_); }\n inline Ref get_head() noexcept { return *begin(); }\n inline ConstRef get_head() const noexcept { return *begin(); }\n inline Ref get_tail() noexcept { return *(--end()); }\n inline ConstRef get_tail() const noexcept { return *(--end()); }\n\n template <typename Function> inline void for_each(Function&& fn) {\n for (auto i = begin(); i != end(); ++i)\n fn(*i);\n }\n\n void insert(const ValueType& x) { insert_aux(x); }\n void erase(ConstIter pos) { erase_aux(pos.node()); }\n};\n\n\n}\n\nvoid test_avl7() {\n avl7::AVLTree<int> t;\n auto show_avl = [&t] {\n std::cout << \"\\navl-tree count is: \" << t.size() << std::endl;\n if (!t.empty())\n std::cout << \"avl-tree {\" << t.get_head() << \", \" << t.get_tail() << \"}\" << std::endl;\n t.for_each([](int value) {\n std::cout << \"avl-tree item value is: \" << value << std::endl;\n });\n };\n\n auto show_reverse = [&t] {\n for (auto i = t.end(); i != t.begin();)\n std::cout << \"avl-tree reverse item value is: \" << *(--i) << std::endl;\n };\n\n t.insert(34);\n t.insert(67);\n t.insert(56);\n t.insert(45);\n t.insert(23);\n t.insert(13);\n t.insert(3);\n t.insert(7);\n show_avl();\n show_reverse();\n\n t.erase(t.begin());\n show_avl();\n show_reverse();\n}\n<|endoftext|>"} {"text":"<commit_before>#include \"gtest\/gtest.h\"\n\n#include <pistache\/net.h>\n\n#include <stdexcept>\n#include <iostream>\n\n#include <sys\/socket.h>\n#include <netinet\/in.h>\n#include <arpa\/inet.h>\n\nusing namespace Pistache;\n\nTEST(net_test, port_creation)\n{\n Port port1(3000);\n ASSERT_FALSE(port1.isReserved());\n uint16_t value1 = port1;\n ASSERT_EQ(value1, 3000);\n ASSERT_EQ(port1.toString(), \"3000\");\n\n Port port2(80);\n ASSERT_TRUE(port2.isReserved());\n uint16_t value2 = port2;\n ASSERT_EQ(value2, 80);\n ASSERT_EQ(port2.toString(), \"80\");\n}\n\nTEST(net_test, address_creation)\n{\n Address address1(\"127.0.0.1:8080\");\n ASSERT_EQ(address1.host(), \"127.0.0.1\");\n ASSERT_EQ(address1.family(), AF_INET);\n ASSERT_EQ(address1.port(), 8080);\n\n std::string addr = \"127.0.0.1\";\n Address address2(addr, Port(8080));\n ASSERT_EQ(address2.host(), \"127.0.0.1\");\n ASSERT_EQ(address2.family(), AF_INET);\n ASSERT_EQ(address2.port(), 8080);\n\n Address address3(Ipv4(127, 0, 0, 1), Port(8080));\n ASSERT_EQ(address3.host(), \"127.0.0.1\");\n ASSERT_EQ(address3.family(), AF_INET);\n ASSERT_EQ(address3.port(), 8080);\n\n Address address4(Ipv4::any(), Port(8080));\n ASSERT_EQ(address4.host(), \"0.0.0.0\");\n ASSERT_EQ(address4.family(), AF_INET);\n ASSERT_EQ(address4.port(), 8080);\n\n Address address5(\"*:8080\");\n ASSERT_EQ(address5.host(), \"0.0.0.0\");\n ASSERT_EQ(address5.family(), AF_INET);\n ASSERT_EQ(address5.port(), 8080);\n\n Address address6(\"[::1]:8080\");\n ASSERT_EQ(address6.host(), \"::1\");\n ASSERT_EQ(address6.family(), AF_INET6);\n ASSERT_EQ(address6.port(), 8080);\n\n std::string addr2 = \"[::1]\";\n Address address7(addr2, Port(8080));\n ASSERT_EQ(address7.host(), \"::1\");\n ASSERT_EQ(address7.family(), AF_INET6);\n ASSERT_EQ(address7.port(), 8080);\n\n Address address8(Ipv6(0, 0, 0, 0, 0, 0, 0, 1), Port(8080));\n ASSERT_EQ(address8.host(), \"::1\");\n ASSERT_EQ(address8.family(), AF_INET6);\n ASSERT_EQ(address8.port(), 8080);\n\n Address address9(Ipv6::any(true), Port(8080));\n ASSERT_EQ(address9.host(), \"::\");\n ASSERT_EQ(address9.family(), AF_INET6);\n ASSERT_EQ(address9.port(), 8080);\n\n Address address10(\"[::]:8080\");\n ASSERT_EQ(address10.host(), \"::\");\n ASSERT_EQ(address10.family(), AF_INET6);\n ASSERT_EQ(address10.port(), 8080);\n\n Address address11(\"[2001:0DB8:AABB:CCDD:EEFF:0011:2233:4455]:8080\");\n ASSERT_EQ(address11.host(), \"2001:db8:aabb:ccdd:eeff:11:2233:4455\");\n ASSERT_EQ(address11.family(), AF_INET6);\n ASSERT_EQ(address11.port(), 8080);\n\n Address address12(Ipv4::loopback(), Port(8080));\n ASSERT_EQ(address12.host(), \"127.0.0.1\");\n ASSERT_EQ(address12.family(), AF_INET);\n ASSERT_EQ(address12.port(), 8080);\n\n Address address13(Ipv6::loopback(true), Port(8080));\n ASSERT_EQ(address13.host(), \"::1\");\n ASSERT_EQ(address13.family(), AF_INET6);\n ASSERT_EQ(address13.port(), 8080);\n\n Address address14(\"127.0.0.1\");\n ASSERT_EQ(address14.host(), \"127.0.0.1\");\n ASSERT_EQ(address14.family(), AF_INET);\n ASSERT_EQ(address14.port(), 80);\n\n Address address15(\"www.example.com\");\n ASSERT_EQ(address15.host(), \"93.184.216.34\");\n ASSERT_EQ(address15.family(), AF_INET);\n ASSERT_EQ(address15.port(), 80);\n \n Address address16(IP(127, 0, 0, 1), Port(8080));\n ASSERT_EQ(address16.host(), \"127.0.0.1\");\n ASSERT_EQ(address16.family(), AF_INET);\n ASSERT_EQ(address16.port(), 8080);\n\n Address address17(IP::any(), Port(8080));\n ASSERT_EQ(address17.host(), \"0.0.0.0\");\n ASSERT_EQ(address17.family(), AF_INET);\n ASSERT_EQ(address17.port(), 8080);\n \n Address address18(IP(2, 0, 0, 0, 0, 0, 0, 1), Port(8080));\n ASSERT_EQ(address18.host(), \"2::1\");\n ASSERT_EQ(address18.family(), AF_INET6);\n ASSERT_EQ(address18.port(), 8080);\n\n Address address19(IP::any(true), Port(8080));\n ASSERT_EQ(address19.host(), \"::\");\n ASSERT_EQ(address19.family(), AF_INET6);\n ASSERT_EQ(address19.port(), 8080);\n \n Address address20(IP::loopback(true), Port(8080));\n ASSERT_EQ(address20.host(), \"::1\");\n ASSERT_EQ(address20.family(), AF_INET6);\n ASSERT_EQ(address20.port(), 8080);\n \n Address address21(IP::loopback(), Port(8080));\n ASSERT_EQ(address21.host(), \"127.0.0.1\");\n ASSERT_EQ(address21.family(), AF_INET);\n ASSERT_EQ(address21.port(), 8080);\n\n Address address22(\"[2001:0DB8:AABB:CCDD:EEFF:0011:2233:4455]\");\n ASSERT_EQ(address11.host(), \"2001:db8:aabb:ccdd:eeff:11:2233:4455\");\n ASSERT_EQ(address11.family(), AF_INET6);\n ASSERT_EQ(address11.port(), 8080);\n\n}\n\nTEST(net_test, invalid_address)\n{\n ASSERT_THROW(Address(\"127.0.0.1:9999999\"), std::invalid_argument);\n ASSERT_THROW(Address(\"127.0.0.1:\"), std::invalid_argument);\n ASSERT_THROW(Address(\"127.0.0.1:-10\"), std::invalid_argument);\n\n ASSERT_THROW(Address(\"[GGGG:GGGG:GGGG:GGGG:GGGG:GGGG:GGGG:GGGG]:8080\");, std::invalid_argument);\n ASSERT_THROW(Address(\"[::GGGG]:8080\");, std::invalid_argument);\n ASSERT_THROW(Address(\"256.256.256.256:8080\");, std::invalid_argument);\n ASSERT_THROW(Address(\"1.0.0.256:8080\");, std::invalid_argument);\n}\n\nTEST(net_test, address_parser)\n{\n AddressParser ap1(\"127.0.0.1:80\");\n ASSERT_EQ(ap1.rawHost(), \"127.0.0.1\");\n ASSERT_EQ(ap1.rawPort(), \"80\");\n ASSERT_EQ(ap1.family(), AF_INET);\n ASSERT_EQ(ap1.hasColon(), true);\n\n AddressParser ap2(\"example.com\");\n ASSERT_EQ(ap2.rawHost(), \"example.com\");\n ASSERT_EQ(ap2.rawPort(), \"\");\n ASSERT_EQ(ap2.family(), AF_INET);\n ASSERT_EQ(ap2.hasColon(), false);\n\n AddressParser ap3(\"[2001:0DB8:AABB:CCDD:EEFF:0011:2233:4455]:8080\");\n ASSERT_EQ(ap3.rawHost(), \"[2001:0DB8:AABB:CCDD:EEFF:0011:2233:4455]\");\n ASSERT_EQ(ap3.rawPort(), \"8080\");\n ASSERT_EQ(ap3.family(), AF_INET6);\n\n ASSERT_THROW(AddressParser(\"127.0.0.1:\");, std::invalid_argument);\n ASSERT_THROW(AddressParser(\"[::]:\");, std::invalid_argument);\n}\n<commit_msg>Fixed typo in unit test address22 and added address23<commit_after>#include \"gtest\/gtest.h\"\n\n#include <pistache\/net.h>\n\n#include <stdexcept>\n#include <iostream>\n\n#include <sys\/socket.h>\n#include <netinet\/in.h>\n#include <arpa\/inet.h>\n\nusing namespace Pistache;\n\nTEST(net_test, port_creation)\n{\n Port port1(3000);\n ASSERT_FALSE(port1.isReserved());\n uint16_t value1 = port1;\n ASSERT_EQ(value1, 3000);\n ASSERT_EQ(port1.toString(), \"3000\");\n\n Port port2(80);\n ASSERT_TRUE(port2.isReserved());\n uint16_t value2 = port2;\n ASSERT_EQ(value2, 80);\n ASSERT_EQ(port2.toString(), \"80\");\n}\n\nTEST(net_test, address_creation)\n{\n Address address1(\"127.0.0.1:8080\");\n ASSERT_EQ(address1.host(), \"127.0.0.1\");\n ASSERT_EQ(address1.family(), AF_INET);\n ASSERT_EQ(address1.port(), 8080);\n\n std::string addr = \"127.0.0.1\";\n Address address2(addr, Port(8080));\n ASSERT_EQ(address2.host(), \"127.0.0.1\");\n ASSERT_EQ(address2.family(), AF_INET);\n ASSERT_EQ(address2.port(), 8080);\n\n Address address3(Ipv4(127, 0, 0, 1), Port(8080));\n ASSERT_EQ(address3.host(), \"127.0.0.1\");\n ASSERT_EQ(address3.family(), AF_INET);\n ASSERT_EQ(address3.port(), 8080);\n\n Address address4(Ipv4::any(), Port(8080));\n ASSERT_EQ(address4.host(), \"0.0.0.0\");\n ASSERT_EQ(address4.family(), AF_INET);\n ASSERT_EQ(address4.port(), 8080);\n\n Address address5(\"*:8080\");\n ASSERT_EQ(address5.host(), \"0.0.0.0\");\n ASSERT_EQ(address5.family(), AF_INET);\n ASSERT_EQ(address5.port(), 8080);\n\n Address address6(\"[::1]:8080\");\n ASSERT_EQ(address6.host(), \"::1\");\n ASSERT_EQ(address6.family(), AF_INET6);\n ASSERT_EQ(address6.port(), 8080);\n\n std::string addr2 = \"[::1]\";\n Address address7(addr2, Port(8080));\n ASSERT_EQ(address7.host(), \"::1\");\n ASSERT_EQ(address7.family(), AF_INET6);\n ASSERT_EQ(address7.port(), 8080);\n\n Address address8(Ipv6(0, 0, 0, 0, 0, 0, 0, 1), Port(8080));\n ASSERT_EQ(address8.host(), \"::1\");\n ASSERT_EQ(address8.family(), AF_INET6);\n ASSERT_EQ(address8.port(), 8080);\n\n Address address9(Ipv6::any(true), Port(8080));\n ASSERT_EQ(address9.host(), \"::\");\n ASSERT_EQ(address9.family(), AF_INET6);\n ASSERT_EQ(address9.port(), 8080);\n\n Address address10(\"[::]:8080\");\n ASSERT_EQ(address10.host(), \"::\");\n ASSERT_EQ(address10.family(), AF_INET6);\n ASSERT_EQ(address10.port(), 8080);\n\n Address address11(\"[2001:0DB8:AABB:CCDD:EEFF:0011:2233:4455]:8080\");\n ASSERT_EQ(address11.host(), \"2001:db8:aabb:ccdd:eeff:11:2233:4455\");\n ASSERT_EQ(address11.family(), AF_INET6);\n ASSERT_EQ(address11.port(), 8080);\n\n Address address12(Ipv4::loopback(), Port(8080));\n ASSERT_EQ(address12.host(), \"127.0.0.1\");\n ASSERT_EQ(address12.family(), AF_INET);\n ASSERT_EQ(address12.port(), 8080);\n\n Address address13(Ipv6::loopback(true), Port(8080));\n ASSERT_EQ(address13.host(), \"::1\");\n ASSERT_EQ(address13.family(), AF_INET6);\n ASSERT_EQ(address13.port(), 8080);\n\n Address address14(\"127.0.0.1\");\n ASSERT_EQ(address14.host(), \"127.0.0.1\");\n ASSERT_EQ(address14.family(), AF_INET);\n ASSERT_EQ(address14.port(), 80);\n\n Address address15(\"www.example.com\");\n ASSERT_EQ(address15.host(), \"93.184.216.34\");\n ASSERT_EQ(address15.family(), AF_INET);\n ASSERT_EQ(address15.port(), 80);\n \n Address address16(IP(127, 0, 0, 1), Port(8080));\n ASSERT_EQ(address16.host(), \"127.0.0.1\");\n ASSERT_EQ(address16.family(), AF_INET);\n ASSERT_EQ(address16.port(), 8080);\n\n Address address17(IP::any(), Port(8080));\n ASSERT_EQ(address17.host(), \"0.0.0.0\");\n ASSERT_EQ(address17.family(), AF_INET);\n ASSERT_EQ(address17.port(), 8080);\n \n Address address18(IP(2, 0, 0, 0, 0, 0, 0, 1), Port(8080));\n ASSERT_EQ(address18.host(), \"2::1\");\n ASSERT_EQ(address18.family(), AF_INET6);\n ASSERT_EQ(address18.port(), 8080);\n\n Address address19(IP::any(true), Port(8080));\n ASSERT_EQ(address19.host(), \"::\");\n ASSERT_EQ(address19.family(), AF_INET6);\n ASSERT_EQ(address19.port(), 8080);\n \n Address address20(IP::loopback(true), Port(8080));\n ASSERT_EQ(address20.host(), \"::1\");\n ASSERT_EQ(address20.family(), AF_INET6);\n ASSERT_EQ(address20.port(), 8080);\n \n Address address21(IP::loopback(), Port(8080));\n ASSERT_EQ(address21.host(), \"127.0.0.1\");\n ASSERT_EQ(address21.family(), AF_INET);\n ASSERT_EQ(address21.port(), 8080);\n\n Address address22(\"[2001:0DB8:AABB:CCDD:EEFF:0011:2233:4455]\");\n ASSERT_EQ(address22.host(), \"2001:db8:aabb:ccdd:eeff:11:2233:4455\");\n ASSERT_EQ(address22.family(), AF_INET6);\n ASSERT_EQ(address22.port(), 80);\n\n Address address23(\"[::]\");\n ASSERT_EQ(address23.host(), \"::\");\n ASSERT_EQ(address23.family(), AF_INET6);\n ASSERT_EQ(address23.port(), 80);\n\n}\n\nTEST(net_test, invalid_address)\n{\n ASSERT_THROW(Address(\"127.0.0.1:9999999\"), std::invalid_argument);\n ASSERT_THROW(Address(\"127.0.0.1:\"), std::invalid_argument);\n ASSERT_THROW(Address(\"127.0.0.1:-10\"), std::invalid_argument);\n\n ASSERT_THROW(Address(\"[GGGG:GGGG:GGGG:GGGG:GGGG:GGGG:GGGG:GGGG]:8080\");, std::invalid_argument);\n ASSERT_THROW(Address(\"[::GGGG]:8080\");, std::invalid_argument);\n ASSERT_THROW(Address(\"256.256.256.256:8080\");, std::invalid_argument);\n ASSERT_THROW(Address(\"1.0.0.256:8080\");, std::invalid_argument);\n}\n\nTEST(net_test, address_parser)\n{\n AddressParser ap1(\"127.0.0.1:80\");\n ASSERT_EQ(ap1.rawHost(), \"127.0.0.1\");\n ASSERT_EQ(ap1.rawPort(), \"80\");\n ASSERT_EQ(ap1.family(), AF_INET);\n ASSERT_EQ(ap1.hasColon(), true);\n\n AddressParser ap2(\"example.com\");\n ASSERT_EQ(ap2.rawHost(), \"example.com\");\n ASSERT_EQ(ap2.rawPort(), \"\");\n ASSERT_EQ(ap2.family(), AF_INET);\n ASSERT_EQ(ap2.hasColon(), false);\n\n AddressParser ap3(\"[2001:0DB8:AABB:CCDD:EEFF:0011:2233:4455]:8080\");\n ASSERT_EQ(ap3.rawHost(), \"[2001:0DB8:AABB:CCDD:EEFF:0011:2233:4455]\");\n ASSERT_EQ(ap3.rawPort(), \"8080\");\n ASSERT_EQ(ap3.family(), AF_INET6);\n\n ASSERT_THROW(AddressParser(\"127.0.0.1:\");, std::invalid_argument);\n ASSERT_THROW(AddressParser(\"[::]:\");, std::invalid_argument);\n}\n<|endoftext|>"} {"text":"<commit_before>#include \"Matrix.h\"\n#include <string>\n#include <iostream>\n#include <string>\n#include <sstream>\n\nusing namespace std;\n\nMatrix::Matrix() {\n\tthis->rows = 0;\n\tthis->cols = 0;\n}\n\nMatrix::Matrix(int rows, int cols) {\n\tresize(rows, cols);\n}\n\nMatrix::Matrix(const Matrix& m) {\n\tint i, j;\n\n\tresize(m.rows, m.cols);\n\n\tfor(i = 0; i < this->rows; i++) {\n\t\tfor(j = 0; j < this->cols; j++) {\n\t\t\tthis->matrix[i][j] = m.matrix[i][j];\n\t\t}\n\t}\n}\n\nvoid Matrix::resize(int rows, int cols) {\n\tint i, j;\n\n\tif(this->rows > 0 && this->cols > 0) {\n\t\tfor(i = 0; i < this->rows; i++) {\n\t\t\tfree(this->matrix[i]);\n\t\t}\n\t\tfree(this->matrix);\n\n\t}\n\n\tthis->matrix = (float**) malloc(rows * sizeof(float*));\n\tfor (i = 0; i < rows; i++){\n\t\tthis->matrix[i] = (float*) malloc(cols * sizeof(float));\n\t\tfor(j = 0; j < cols; j++)\n\t\t\tthis->matrix[i][j] = 0;\n\t}\n\n\tthis->rows = rows;\n\tthis->cols = cols;\n\n\treturn;\n}\n\nvoid Matrix::set(int row, int col, float value) {\n\tthis->matrix[row][col] = value;\n}\n\nfloat Matrix::get(int row, int col) {\n\treturn matrix[row][col];\n}\n\nint Matrix::getRows() {\n\treturn this->rows;\n}\n\nint Matrix::getCols() {\n\treturn this->cols;\n}\n\nint* Matrix::getSize() {\n\tstatic int size[] = { this->rows, this->cols };\n\treturn size;\n}\n\n\n\nMatrix Matrix::multiply(const Matrix& m) {\n\tint i, j, k;\n\tfloat sum = 0;\n\n\tif(this->cols != m.rows)\n\t\tthrow 30;\n\n\tMatrix result(this->rows, m.cols);\n\n\tfor(i = 0; i < this->rows; i++) {\n\t\tfor(j = 0; j < m.cols; j++) {\n\t\t\tfor(k = 0; k < m.rows; k++) {\n\t\t\t\tsum = sum + (this->matrix[i][k] * m.matrix[k][j]);\n\t\t\t}\n\t\t\tresult.set(i,j, sum);\n\t\t\tsum = 0;\n\t\t}\n\t}\n\treturn result;\n}\n\nMatrix Matrix::pow(int power) {\n\tint i;\n\tMatrix result(*this);\n\n\tfor(i = 1; i < power; i++) {\n\t\tresult = this->multiply(result);\n\t}\n\n\treturn result;\n}\n\nvoid Matrix::fill() {\n\tint i, j;\n\n\tfor(i = 0; i < this->rows; i++) {\n\t\tfor(j = 0; j < this->cols; j++) {\n\t\t\tthis->matrix[i][j] = rand();\n\t\t}\n\t}\n}\n\nstring Matrix::toString() {\n\tstd::ostringstream val;\n\tint i, j;\n\tstring result(\"\");\n\n\tfor(i = 0; i < this->rows; i++) {\n\t\tfor(j = 0; j < this->cols; j++) {\n\t\t\tval.str(\"\");\n\t\t\tval << this->matrix[i][j];\n\t\t\tresult += val.str();\n\t\t\tresult += \"\\t\";\n\t\t}\n\t\tresult += \"\\n\";\n\t}\n\n\treturn result;\n}\n<commit_msg>Abmessungen in toString<commit_after>#include \"Matrix.h\"\n#include <string>\n#include <iostream>\n#include <string>\n#include <sstream>\n\nusing namespace std;\n\nMatrix::Matrix() {\n\tthis->rows = 0;\n\tthis->cols = 0;\n}\n\nMatrix::Matrix(int rows, int cols) {\n\tresize(rows, cols);\n}\n\nMatrix::Matrix(const Matrix& m) {\n\tint i, j;\n\n\tresize(m.rows, m.cols);\n\n\tfor(i = 0; i < this->rows; i++) {\n\t\tfor(j = 0; j < this->cols; j++) {\n\t\t\tthis->matrix[i][j] = m.matrix[i][j];\n\t\t}\n\t}\n}\n\nvoid Matrix::resize(int rows, int cols) {\n\tint i, j;\n\n\tif(this->rows > 0 && this->cols > 0) {\n\t\tfor(i = 0; i < this->rows; i++) {\n\t\t\tfree(this->matrix[i]);\n\t\t}\n\t\tfree(this->matrix);\n\n\t}\n\n\tthis->matrix = (float**) malloc(rows * sizeof(float*));\n\tfor (i = 0; i < rows; i++){\n\t\tthis->matrix[i] = (float*) malloc(cols * sizeof(float));\n\t\tfor(j = 0; j < cols; j++)\n\t\t\tthis->matrix[i][j] = 0;\n\t}\n\n\tthis->rows = rows;\n\tthis->cols = cols;\n\n\treturn;\n}\n\nvoid Matrix::set(int row, int col, float value) {\n\tthis->matrix[row][col] = value;\n}\n\nfloat Matrix::get(int row, int col) {\n\treturn matrix[row][col];\n}\n\nint Matrix::getRows() {\n\treturn this->rows;\n}\n\nint Matrix::getCols() {\n\treturn this->cols;\n}\n\nint* Matrix::getSize() {\n\tstatic int size[] = { this->rows, this->cols };\n\treturn size;\n}\n\n\n\nMatrix Matrix::multiply(const Matrix& m) {\n\tint i, j, k;\n\tfloat sum = 0;\n\n\tif(this->cols != m.rows)\n\t\tthrow 30;\n\n\tMatrix result(this->rows, m.cols);\n\n\tfor(i = 0; i < this->rows; i++) {\n\t\tfor(j = 0; j < m.cols; j++) {\n\t\t\tfor(k = 0; k < m.rows; k++) {\n\t\t\t\tsum = sum + (this->matrix[i][k] * m.matrix[k][j]);\n\t\t\t}\n\t\t\tresult.set(i,j, sum);\n\t\t\tsum = 0;\n\t\t}\n\t}\n\treturn result;\n}\n\nMatrix Matrix::pow(int power) {\n\tint i;\n\tMatrix result(*this);\n\n\tfor(i = 1; i < power; i++) {\n\t\tresult = this->multiply(result);\n\t}\n\n\treturn result;\n}\n\nvoid Matrix::fill() {\n\tint i, j;\n\n\tfor(i = 0; i < this->rows; i++) {\n\t\tfor(j = 0; j < this->cols; j++) {\n\t\t\tthis->matrix[i][j] = rand();\n\t\t}\n\t}\n}\n\nstring Matrix::toString() {\n\tstd::ostringstream val;\n\tint i, j;\n\tstring result(\"\");\n\n\tval << \"\\n\\n\" << this->rows << \"x\" << this->cols << \" Matrix\\n\";\n\tresult += val.str();\n\n\n\tfor(i = 0; i < this->rows; i++) {\n\t\tfor(j = 0; j < this->cols; j++) {\n\t\t\tval.str(\"\");\n\t\t\tval << this->matrix[i][j];\n\t\t\tresult += val.str();\n\t\t\tresult += \"\\t\";\n\t\t}\n\t\tresult += \"\\n\";\n\t}\n\n\treturn result;\n}\n<|endoftext|>"} {"text":"<commit_before>\/\/ geography.cpp\r\n\/\/\r\n#include \"common\/common.h\"\r\n#include \"geography.h\"\r\n#include \"math_util.h\"\r\n#include \"system\/page_info.h\"\r\n\r\nnamespace sdl { namespace db {\r\n\r\ngeo_mem::geo_mem(data_type && m): m_data(std::move(m)) \r\n{\r\n init_geography();\r\n m_type = init_type();\r\n SDL_ASSERT(m_type != spatial_type::null);\r\n}\r\n\r\nvoid geo_mem::swap(geo_mem & v)\r\n{\r\n m_data.swap(v.m_data);\r\n m_buf.swap(v.m_buf);\r\n std::swap(m_type, v.m_type);\r\n std::swap(m_geography, v.m_geography);\r\n}\r\n\r\nvoid geo_mem::init_geography()\r\n{\r\n SDL_ASSERT(!m_geography && !m_buf);\r\n if (mem_size(m_data) > sizeof(geo_data)) {\r\n if (m_data.size() == 1) {\r\n m_geography = reinterpret_cast<geo_data const *>(m_data[0].first);\r\n }\r\n else {\r\n reset_new(m_buf, make_vector(m_data));\r\n m_geography = reinterpret_cast<geo_data const *>(m_buf->data());\r\n }\r\n }\r\n else {\r\n throw_error<geo_mem_error>(\"bad geography\");\r\n }\r\n SDL_ASSERT(m_geography->data.SRID == 4326);\r\n}\r\n\r\nspatial_type geo_mem::init_type()\r\n{\r\n static_assert(sizeof(geo_data) < sizeof(geo_point), \"\");\r\n static_assert(sizeof(geo_point) < sizeof(geo_multipolygon), \"\");\r\n static_assert(sizeof(geo_pointarray) < sizeof(geo_linesegment), \"\");\r\n static_assert(sizeof(geo_multipolygon) == sizeof(geo_pointarray), \"\");\r\n static_assert(sizeof(geo_linestring) == sizeof(geo_pointarray), \"\");\r\n\r\n geo_data const * const data = m_geography;\r\n size_t const data_size = mem_size(m_data);\r\n\r\n if (data_size == sizeof(geo_point)) { \/\/ 22 bytes\r\n if (data->data.tag == spatial_tag::t_point) {\r\n return spatial_type::point;\r\n }\r\n SDL_ASSERT(0);\r\n return spatial_type::null;\r\n }\r\n if (data_size == sizeof(geo_linesegment)) { \/\/ 38 bytes\r\n if (data->data.tag == spatial_tag::t_linesegment) {\r\n return spatial_type::linesegment;\r\n }\r\n SDL_ASSERT(0);\r\n return spatial_type::null;\r\n }\r\n if (data_size >= sizeof(geo_pointarray)) { \/\/ 26 bytes\r\n if (data->data.tag == spatial_tag::t_linestring) {\r\n SDL_ASSERT(!reinterpret_cast<const geo_linestring *>(data)->tail(data_size));\r\n return spatial_type::linestring;\r\n }\r\n if (data->data.tag == spatial_tag::t_multipolygon) {\r\n geo_base_polygon const * const pp = reinterpret_cast<const geo_base_polygon *>(data);\r\n geo_tail const * const tail = pp->tail(data_size);\r\n if (tail) {\r\n if (tail->size() > 1) { \r\n SDL_ASSERT(tail->data.reserved.num == 0);\r\n SDL_ASSERT(tail->data.numobj.num > 1);\r\n if (tail->data.numobj.tag == 1) {\r\n SDL_ASSERT(tail->data.reserved.tag == 1); \r\n return spatial_type::multilinestring;\r\n }\r\n else {\r\n SDL_ASSERT((tail->data.reserved.tag == 0) || (tail->data.reserved.tag == 2)); \r\n SDL_ASSERT(tail->data.numobj.tag == 2);\r\n SDL_ASSERT(!pp->ring_empty());\r\n return spatial_type::multipolygon; \/\/ or polygon with interior rings\r\n }\r\n }\r\n else {\r\n SDL_ASSERT(tail->data.reserved.num == 0);\r\n SDL_ASSERT(tail->data.reserved.tag == 1);\r\n SDL_ASSERT(tail->data.numobj.num == 1);\r\n if (tail->data.numobj.tag == 1) {\r\n return spatial_type::linestring;\r\n }\r\n else {\r\n SDL_ASSERT(tail->data.numobj.tag == 2);\r\n SDL_ASSERT(pp->ring_num() == 1);\r\n return spatial_type::polygon;\r\n }\r\n }\r\n }\r\n SDL_ASSERT(0); \/\/ to be tested\r\n return spatial_type::linestring;\r\n }\r\n }\r\n SDL_ASSERT(0);\r\n return spatial_type::null;\r\n}\r\n\r\nstd::string geo_mem::STAsText() const {\r\n if (!is_null()) {\r\n return to_string::type(*this);\r\n }\r\n SDL_ASSERT(0);\r\n return{};\r\n}\r\n\r\nbool geo_mem::STContains(spatial_point const & p) const\r\n{\r\n switch (m_type) {\r\n case spatial_type::point: return cast_point()->STContains(p);\r\n\/\/ case spatial_type::linestring: return false; \/\/cast_linestring()->STContains(p);\r\n case spatial_type::polygon: return cast_polygon()->STContains(p);\r\n\/\/ case spatial_type::linesegment: return false; \/\/cast_linesegment()->STContains(p);\r\n\/\/ case spatial_type::multilinestring: return false; \/\/cast_multilinestring()->STContains(p);\r\n case spatial_type::multipolygon: return cast_multipolygon()->STContains(p);\r\n default:\r\n return false;\r\n }\r\n}\r\n\r\ngeo_tail const * geo_mem::get_tail() const\r\n{\r\n if (m_type == spatial_type::multipolygon) {\r\n return cast_multipolygon()->tail(mem_size(data()));\r\n }\r\n if (m_type == spatial_type::multilinestring) {\r\n return cast_multilinestring()->tail(mem_size(data()));\r\n }\r\n return nullptr;\r\n}\r\n\r\ngeo_tail const * geo_mem::get_tail_multipolygon() const\r\n{\r\n if (m_type == spatial_type::multipolygon) {\r\n return cast_multipolygon()->tail(mem_size(data()));\r\n }\r\n SDL_ASSERT(0);\r\n return nullptr;\r\n}\r\n\r\ngeo_mem::vec_orientation\r\ngeo_mem::ring_orient() const\r\n{\r\n if (geo_tail const * const tail = get_tail_multipolygon()) {\r\n const size_t size = tail->size();\r\n vec_orientation result(size, orientation::exterior);\r\n point_access exterior = get_subobj(0);\r\n bool point_on_vertix = false;\r\n for (size_t i = 1; i < size; ++i) {\r\n point_access next = get_subobj(i);\r\n for (auto const & p : next) {\r\n if (math_util::point_in_polygon(exterior.begin(), exterior.end(), p, point_on_vertix)) {\r\n if (!point_on_vertix) {\r\n result[i] = orientation::interior;\r\n break;\r\n }\r\n }\r\n else {\r\n exterior = next;\r\n break;\r\n }\r\n }\r\n }\r\n return result;\r\n }\r\n return {};\r\n}\r\n\r\n\/\/------------------------------------------------------------------------\r\n\r\n} \/\/ db\r\n} \/\/ sdl\r\n\r\n#if SDL_DEBUG\r\nnamespace sdl {\r\n namespace db {\r\n namespace {\r\n class unit_test {\r\n public:\r\n unit_test()\r\n {\r\n if (1) {\r\n using vec = geo_mem::vec_orientation;\r\n SDL_TRACE(sizeof(vec));\r\n vec t1(4, orientation::interior);\r\n vec t2(10, orientation::interior);\r\n SDL_ASSERT(t1.use_buf());\r\n SDL_ASSERT(!t2.use_buf());\r\n vec m1(std::move(t1));\r\n vec m2(std::move(t2));\r\n vec m11, m22;\r\n m11 = std::move(m1);\r\n m22 = std::move(m2);\r\n SDL_ASSERT(m11.size() == 4);\r\n SDL_ASSERT(m22.size() == 10);\r\n m22 = std::move(m11);\r\n SDL_ASSERT(m22.size() == 4);\r\n }\r\n }\r\n };\r\n static unit_test s_test;\r\n }\r\n } \/\/ db\r\n} \/\/ sdl\r\n#endif \/\/#if SV_DEBUG<commit_msg>enum class winding<commit_after>\/\/ geography.cpp\r\n\/\/\r\n#include \"common\/common.h\"\r\n#include \"geography.h\"\r\n#include \"math_util.h\"\r\n#include \"system\/page_info.h\"\r\n\r\nnamespace sdl { namespace db {\r\n\r\ngeo_mem::geo_mem(data_type && m): m_data(std::move(m)) \r\n{\r\n init_geography();\r\n m_type = init_type();\r\n SDL_ASSERT(m_type != spatial_type::null);\r\n}\r\n\r\nvoid geo_mem::swap(geo_mem & v)\r\n{\r\n m_data.swap(v.m_data);\r\n m_buf.swap(v.m_buf);\r\n std::swap(m_type, v.m_type);\r\n std::swap(m_geography, v.m_geography);\r\n}\r\n\r\nvoid geo_mem::init_geography()\r\n{\r\n SDL_ASSERT(!m_geography && !m_buf);\r\n if (mem_size(m_data) > sizeof(geo_data)) {\r\n if (m_data.size() == 1) {\r\n m_geography = reinterpret_cast<geo_data const *>(m_data[0].first);\r\n }\r\n else {\r\n reset_new(m_buf, make_vector(m_data));\r\n m_geography = reinterpret_cast<geo_data const *>(m_buf->data());\r\n }\r\n }\r\n else {\r\n throw_error<geo_mem_error>(\"bad geography\");\r\n }\r\n SDL_ASSERT(m_geography->data.SRID == 4326);\r\n}\r\n\r\nspatial_type geo_mem::init_type()\r\n{\r\n static_assert(sizeof(geo_data) < sizeof(geo_point), \"\");\r\n static_assert(sizeof(geo_point) < sizeof(geo_multipolygon), \"\");\r\n static_assert(sizeof(geo_pointarray) < sizeof(geo_linesegment), \"\");\r\n static_assert(sizeof(geo_multipolygon) == sizeof(geo_pointarray), \"\");\r\n static_assert(sizeof(geo_linestring) == sizeof(geo_pointarray), \"\");\r\n\r\n geo_data const * const data = m_geography;\r\n size_t const data_size = mem_size(m_data);\r\n\r\n if (data_size == sizeof(geo_point)) { \/\/ 22 bytes\r\n if (data->data.tag == spatial_tag::t_point) {\r\n return spatial_type::point;\r\n }\r\n SDL_ASSERT(0);\r\n return spatial_type::null;\r\n }\r\n if (data_size == sizeof(geo_linesegment)) { \/\/ 38 bytes\r\n if (data->data.tag == spatial_tag::t_linesegment) {\r\n return spatial_type::linesegment;\r\n }\r\n SDL_ASSERT(0);\r\n return spatial_type::null;\r\n }\r\n if (data_size >= sizeof(geo_pointarray)) { \/\/ 26 bytes\r\n if (data->data.tag == spatial_tag::t_linestring) {\r\n SDL_ASSERT(!reinterpret_cast<const geo_linestring *>(data)->tail(data_size));\r\n return spatial_type::linestring;\r\n }\r\n if (data->data.tag == spatial_tag::t_multipolygon) {\r\n geo_base_polygon const * const pp = reinterpret_cast<const geo_base_polygon *>(data);\r\n geo_tail const * const tail = pp->tail(data_size);\r\n if (tail) {\r\n if (tail->size() > 1) { \r\n SDL_ASSERT(tail->data.reserved.num == 0);\r\n SDL_ASSERT(tail->data.numobj.num > 1);\r\n if (tail->data.numobj.tag == 1) {\r\n SDL_ASSERT(tail->data.reserved.tag == 1); \r\n return spatial_type::multilinestring;\r\n }\r\n else {\r\n SDL_ASSERT((tail->data.reserved.tag == 0) || (tail->data.reserved.tag == 2)); \r\n SDL_ASSERT(tail->data.numobj.tag == 2);\r\n SDL_ASSERT(!pp->ring_empty());\r\n return spatial_type::multipolygon; \/\/ or polygon with interior rings\r\n }\r\n }\r\n else {\r\n SDL_ASSERT(tail->data.reserved.num == 0);\r\n SDL_ASSERT(tail->data.reserved.tag == 1);\r\n SDL_ASSERT(tail->data.numobj.num == 1);\r\n if (tail->data.numobj.tag == 1) {\r\n return spatial_type::linestring;\r\n }\r\n else {\r\n SDL_ASSERT(tail->data.numobj.tag == 2);\r\n SDL_ASSERT(pp->ring_num() == 1);\r\n return spatial_type::polygon;\r\n }\r\n }\r\n }\r\n SDL_ASSERT(0); \/\/ to be tested\r\n return spatial_type::linestring;\r\n }\r\n }\r\n SDL_ASSERT(0);\r\n return spatial_type::null;\r\n}\r\n\r\nstd::string geo_mem::STAsText() const {\r\n if (!is_null()) {\r\n return to_string::type(*this);\r\n }\r\n SDL_ASSERT(0);\r\n return{};\r\n}\r\n\r\nbool geo_mem::STContains(spatial_point const & p) const\r\n{\r\n switch (m_type) {\r\n case spatial_type::point: return cast_point()->STContains(p);\r\n\/\/ case spatial_type::linestring: return false; \/\/cast_linestring()->STContains(p);\r\n case spatial_type::polygon: return cast_polygon()->STContains(p);\r\n\/\/ case spatial_type::linesegment: return false; \/\/cast_linesegment()->STContains(p);\r\n\/\/ case spatial_type::multilinestring: return false; \/\/cast_multilinestring()->STContains(p);\r\n case spatial_type::multipolygon: return cast_multipolygon()->STContains(p);\r\n default:\r\n return false;\r\n }\r\n}\r\n\r\ngeo_tail const * geo_mem::get_tail() const\r\n{\r\n if (m_type == spatial_type::multipolygon) {\r\n return cast_multipolygon()->tail(mem_size(data()));\r\n }\r\n if (m_type == spatial_type::multilinestring) {\r\n return cast_multilinestring()->tail(mem_size(data()));\r\n }\r\n return nullptr;\r\n}\r\n\r\ngeo_tail const * geo_mem::get_tail_multipolygon() const\r\n{\r\n if (m_type == spatial_type::multipolygon) {\r\n return cast_multipolygon()->tail(mem_size(data()));\r\n }\r\n SDL_ASSERT(0);\r\n return nullptr;\r\n}\r\n\r\ngeo_mem::vec_orientation\r\ngeo_mem::ring_orient() const\r\n{\r\n if (geo_tail const * const tail = get_tail_multipolygon()) {\r\n const size_t size = tail->size();\r\n vec_orientation result(size, orientation::exterior);\r\n point_access exterior = get_subobj(0);\r\n bool point_on_vertix = false;\r\n for (size_t i = 1; i < size; ++i) {\r\n point_access next = get_subobj(i);\r\n for (auto const & p : next) {\r\n if (math_util::point_in_polygon(exterior.begin(), exterior.end(), p, point_on_vertix)) {\r\n if (!point_on_vertix) {\r\n result[i] = orientation::interior;\r\n break;\r\n }\r\n }\r\n else {\r\n exterior = next;\r\n break;\r\n }\r\n }\r\n }\r\n return result;\r\n }\r\n return {};\r\n}\r\n\r\n\/\/------------------------------------------------------------------------\r\n\r\n} \/\/ db\r\n} \/\/ sdl\r\n\r\n#if SDL_DEBUG\r\nnamespace sdl {\r\n namespace db {\r\n namespace {\r\n class unit_test {\r\n public:\r\n unit_test()\r\n {\r\n if (1) {\r\n using vec = geo_mem::vec_orientation;\r\n \/\/SDL_TRACE(sizeof(vec));\r\n vec t1(4, orientation::interior);\r\n vec t2(10, orientation::interior);\r\n SDL_ASSERT(t1.use_buf());\r\n SDL_ASSERT(!t2.use_buf());\r\n vec m1(std::move(t1));\r\n vec m2(std::move(t2));\r\n vec m11, m22;\r\n m11 = std::move(m1);\r\n m22 = std::move(m2);\r\n SDL_ASSERT(m11.size() == 4);\r\n SDL_ASSERT(m22.size() == 10);\r\n m22 = std::move(m11);\r\n SDL_ASSERT(m22.size() == 4);\r\n }\r\n }\r\n };\r\n static unit_test s_test;\r\n }\r\n } \/\/ db\r\n} \/\/ sdl\r\n#endif \/\/#if SV_DEBUG<|endoftext|>"} {"text":"<commit_before>\/\/ Copyright 2019 Google LLC, Andrew Hines\n\/\/\n\/\/ Licensed under the Apache License, Version 2.0 (the \"License\");\n\/\/ you may not use this file except in compliance with the License.\n\/\/ You may obtain a copy of the License at\n\/\/\n\/\/ http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n\/\/\n\/\/ Unless required by applicable law or agreed to in writing, software\n\/\/ distributed under the License is distributed on an \"AS IS\" BASIS,\n\/\/ WITHOUT WARRANTIES OR CONDITIONS OF 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 \"alignment.h\"\n\n#include <memory>\n#include <utility>\n\n#include \"amatrix.h\"\n#include \"audio_signal.h\"\n#include \"envelope.h\"\n#include \"xcorr.h\"\n\nnamespace Visqol {\nstd::tuple<AudioSignal, AudioSignal, double> Alignment::AlignAndTruncate(\n const AudioSignal &ref_signal, const AudioSignal °_signal) {\n auto alignment_result = Alignment::GloballyAlign(ref_signal, deg_signal);\n AudioSignal aligned_deg_signal = std::get<0>(alignment_result);\n double lag = std::get<1>(alignment_result);\n auto &ref_matrix = ref_signal.data_matrix;\n \/\/ Take the aligned degraded matrix.\n auto °_matrix = aligned_deg_signal.data_matrix;\n AMatrix<double> new_ref_matrix = ref_matrix;\n AMatrix<double> new_deg_matrix = deg_matrix;\n\n \/\/ Truncate the two aligned signals to match lengths.\n \/\/ If the lag is positive or negative, the starts are aligned.\n \/\/ (The front of deg_signal is zero padded or truncated).\n if (ref_matrix.NumRows() > deg_matrix.NumRows()) {\n new_ref_matrix = ref_matrix.GetRows(0, deg_matrix.NumRows() - 1);\n } else if (ref_matrix.NumRows() < deg_matrix.NumRows()) {\n \/\/ For positive lag, the beginning of ref is now aligned with zeros, so\n \/\/ that amount should be truncated.\n new_ref_matrix = ref_matrix.GetRows(int(lag * ref_signal.sample_rate),\n ref_matrix.NumRows() - 1);\n \/\/ Truncate the zeros off the deg matrix as well.\n new_deg_matrix = deg_matrix.GetRows((int)(lag * deg_signal.sample_rate),\n ref_matrix.NumRows() - 1);\n }\n\n AudioSignal new_deg_signal{new_deg_matrix, deg_signal.sample_rate};\n AudioSignal new_ref_signal{new_ref_matrix, ref_signal.sample_rate};\n return std::make_tuple(new_ref_signal, new_deg_signal, lag);\n}\n\nstd::tuple<AudioSignal, double> Alignment::GloballyAlign(\n const AudioSignal &ref_signal, const AudioSignal °_signal) {\n auto &ref_matrix = ref_signal.data_matrix;\n auto °_matrix = deg_signal.data_matrix;\n auto ref_upper_env = Envelope::CalcUpperEnv(ref_matrix);\n auto deg_upper_env = Envelope::CalcUpperEnv(deg_matrix);\n auto best_lag = XCorr::CalcBestLag(ref_upper_env, deg_upper_env);\n\n \/\/ Limit the lag to half a patch.\n if (best_lag == 0 || std::abs(best_lag) > (double) ref_matrix.NumRows() \/ 2) {\n return std::make_tuple(deg_signal, 0);\n } else {\n \/\/ align degraded matrix\n AMatrix<double> new_deg_matrix;\n \/\/ If the same point of the reference comes after the degraded\n \/\/ (negative lag), truncate the rows before the refrence.\n \/\/ If the reference comes before the degraded, prepend zeros\n \/\/ to the degraded.\n if (best_lag < 0) {\n new_deg_matrix = deg_matrix.GetRows(std::abs(best_lag),\n deg_matrix.NumRows() - 1);\n } else {\n new_deg_matrix = AMatrix<double>::Filled(best_lag, 1, 0.0);\n new_deg_matrix = new_deg_matrix.JoinVertically(deg_matrix);\n }\n AudioSignal new_deg_signal{std::move(new_deg_matrix),\n deg_signal.sample_rate};\n return std::make_tuple(new_deg_signal, best_lag \/ (double) deg_signal.sample_rate);\n }\n}\n} \/\/ namespace Visqol\n<commit_msg>Add missing tuple header<commit_after>\/\/ Copyright 2019 Google LLC, Andrew Hines\n\/\/\n\/\/ Licensed under the Apache License, Version 2.0 (the \"License\");\n\/\/ you may not use this file except in compliance with the License.\n\/\/ You may obtain a copy of the License at\n\/\/\n\/\/ http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n\/\/\n\/\/ Unless required by applicable law or agreed to in writing, software\n\/\/ distributed under the License is distributed on an \"AS IS\" BASIS,\n\/\/ WITHOUT WARRANTIES OR CONDITIONS OF 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 \"alignment.h\"\n\n#include <memory>\n#include <tuple>\n#include <utility>\n\n#include \"amatrix.h\"\n#include \"audio_signal.h\"\n#include \"envelope.h\"\n#include \"xcorr.h\"\n\nnamespace Visqol {\nstd::tuple<AudioSignal, AudioSignal, double> Alignment::AlignAndTruncate(\n const AudioSignal &ref_signal, const AudioSignal °_signal) {\n auto alignment_result = Alignment::GloballyAlign(ref_signal, deg_signal);\n AudioSignal aligned_deg_signal = std::get<0>(alignment_result);\n double lag = std::get<1>(alignment_result);\n auto &ref_matrix = ref_signal.data_matrix;\n \/\/ Take the aligned degraded matrix.\n auto °_matrix = aligned_deg_signal.data_matrix;\n AMatrix<double> new_ref_matrix = ref_matrix;\n AMatrix<double> new_deg_matrix = deg_matrix;\n\n \/\/ Truncate the two aligned signals to match lengths.\n \/\/ If the lag is positive or negative, the starts are aligned.\n \/\/ (The front of deg_signal is zero padded or truncated).\n if (ref_matrix.NumRows() > deg_matrix.NumRows()) {\n new_ref_matrix = ref_matrix.GetRows(0, deg_matrix.NumRows() - 1);\n } else if (ref_matrix.NumRows() < deg_matrix.NumRows()) {\n \/\/ For positive lag, the beginning of ref is now aligned with zeros, so\n \/\/ that amount should be truncated.\n new_ref_matrix = ref_matrix.GetRows(int(lag * ref_signal.sample_rate),\n ref_matrix.NumRows() - 1);\n \/\/ Truncate the zeros off the deg matrix as well.\n new_deg_matrix = deg_matrix.GetRows((int)(lag * deg_signal.sample_rate),\n ref_matrix.NumRows() - 1);\n }\n\n AudioSignal new_deg_signal{new_deg_matrix, deg_signal.sample_rate};\n AudioSignal new_ref_signal{new_ref_matrix, ref_signal.sample_rate};\n return std::make_tuple(new_ref_signal, new_deg_signal, lag);\n}\n\nstd::tuple<AudioSignal, double> Alignment::GloballyAlign(\n const AudioSignal &ref_signal, const AudioSignal °_signal) {\n auto &ref_matrix = ref_signal.data_matrix;\n auto °_matrix = deg_signal.data_matrix;\n auto ref_upper_env = Envelope::CalcUpperEnv(ref_matrix);\n auto deg_upper_env = Envelope::CalcUpperEnv(deg_matrix);\n auto best_lag = XCorr::CalcBestLag(ref_upper_env, deg_upper_env);\n\n \/\/ Limit the lag to half a patch.\n if (best_lag == 0 || std::abs(best_lag) > (double) ref_matrix.NumRows() \/ 2) {\n return std::make_tuple(deg_signal, 0);\n } else {\n \/\/ align degraded matrix\n AMatrix<double> new_deg_matrix;\n \/\/ If the same point of the reference comes after the degraded\n \/\/ (negative lag), truncate the rows before the refrence.\n \/\/ If the reference comes before the degraded, prepend zeros\n \/\/ to the degraded.\n if (best_lag < 0) {\n new_deg_matrix = deg_matrix.GetRows(std::abs(best_lag),\n deg_matrix.NumRows() - 1);\n } else {\n new_deg_matrix = AMatrix<double>::Filled(best_lag, 1, 0.0);\n new_deg_matrix = new_deg_matrix.JoinVertically(deg_matrix);\n }\n AudioSignal new_deg_signal{std::move(new_deg_matrix),\n deg_signal.sample_rate};\n return std::make_tuple(new_deg_signal, best_lag \/ (double) deg_signal.sample_rate);\n }\n}\n} \/\/ namespace Visqol\n<|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) any later version.\n *\n * This library is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU\n * Lesser General Public License for more details.\n *\n * You should have received 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 <QQmlEngine>\n#include <QQmlContext>\n#include <QQmlComponent>\n\n#include <QStandardPaths>\n#include <QDebug>\n#include <QThread>\n\n#include <KDBusService>\n#include <KLocalizedString>\n\n#include <QApplication>\n#include <QCommandLineParser>\n#include <QCommandLineOption>\n\n#include <iostream>\n\nint main(int argc, char** argv)\n{\n QApplication app(argc, argv);\n app.setApplicationDisplayName(\"Peruse\");\n\n KDBusService service(KDBusService::Unique);\n\n QCommandLineParser parser;\n parser.addOption(QCommandLineOption(\"reset\", i18n(\"Reset the database\")));\n parser.addHelpOption();\n parser.process(app);\n\n if (parser.positionalArguments().size() > 1) {\n parser.showHelp(1);\n }\n\n if (parser.isSet(\"reset\")) {\n\/\/ KokoConfig config;\n\/\/ config.reset();\n\n\/\/ ImageStorage::reset();\n }\n\n QThread trackerThread;\n\n QStringList locations = QStandardPaths::standardLocations(QStandardPaths::DocumentsLocation);\n locations << QStandardPaths::standardLocations(QStandardPaths::DownloadLocation);\n Q_ASSERT(locations.size() >= 1);\n\/\/ qDebug() << locations;\n\/\/ FileSystemTracker tracker;\n\/\/ tracker.setFolder(locations.first());\n\/\/ tracker.moveToThread(&trackerThread);\n\n\/\/ Koko::Processor processor;\n\/\/ QObject::connect(&tracker, &FileSystemTracker::imageAdded, &processor, &Koko::Processor::addFile);\n\/\/ QObject::connect(&tracker, &FileSystemTracker::imageRemoved, &processor, &Koko::Processor::removeFile);\n\/\/ QObject::connect(&tracker, &FileSystemTracker::initialScanComplete, &processor, &Koko::Processor::initialScanCompleted);\n\/\/ \n\/\/ trackerThread.start();\n\/\/ tracker.init();\n\/\/ \n\/\/ KokoConfig config;\n\n QQmlEngine engine;\n QQmlContext* objectContext = engine.rootContext();\n QString platformEnv(qgetenv(\"PLASMA_PLATFORM\"));\n engine.rootContext()->setContextProperty(\"PLASMA_PLATFORM\", platformEnv);\n engine.rootContext()->setContextProperty(\"bookLocations\", locations);\n \/\/ Yes, i realise this is a touch on the ugly side. I have found no better way to allow for\n \/\/ things like the archive book model to create imageproviders for the archives\n engine.rootContext()->setContextProperty(\"globalQmlEngine\", &engine);\n\n QString path;\n if (platformEnv.startsWith(\"phone\")) {\n path = QStandardPaths::locate(QStandardPaths::DataLocation, \"qml\/MobileMain.qml\");\n } else {\n path = QStandardPaths::locate(QStandardPaths::DataLocation, \"qml\/Main.qml\");\n }\n QQmlComponent component(&engine, path);\n if (component.isError()) {\n std::cout << component.errorString().toUtf8().constData() << std::endl;\n Q_ASSERT(0);\n }\n Q_ASSERT(component.status() == QQmlComponent::Ready);\n\n QObject* obj = component.create(objectContext);\n Q_ASSERT(obj);\n\n int rt = app.exec();\n\/\/ trackerThread.quit();\n return rt;\n}\n<commit_msg>Always use the mobile version for now<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) any later version.\n *\n * This library is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU\n * Lesser General Public License for more details.\n *\n * You should have received 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 <QQmlEngine>\n#include <QQmlContext>\n#include <QQmlComponent>\n\n#include <QStandardPaths>\n#include <QDebug>\n#include <QThread>\n\n#include <KDBusService>\n#include <KLocalizedString>\n\n#include <QApplication>\n#include <QCommandLineParser>\n#include <QCommandLineOption>\n\n#include <iostream>\n\nint main(int argc, char** argv)\n{\n QApplication app(argc, argv);\n app.setApplicationDisplayName(\"Peruse\");\n\n KDBusService service(KDBusService::Unique);\n\n QCommandLineParser parser;\n parser.addOption(QCommandLineOption(\"reset\", i18n(\"Reset the database\")));\n parser.addHelpOption();\n parser.process(app);\n\n if (parser.positionalArguments().size() > 1) {\n parser.showHelp(1);\n }\n\n if (parser.isSet(\"reset\")) {\n\/\/ KokoConfig config;\n\/\/ config.reset();\n\n\/\/ ImageStorage::reset();\n }\n\n QThread trackerThread;\n\n QStringList locations = QStandardPaths::standardLocations(QStandardPaths::DocumentsLocation);\n locations << QStandardPaths::standardLocations(QStandardPaths::DownloadLocation);\n Q_ASSERT(locations.size() >= 1);\n\/\/ qDebug() << locations;\n\/\/ FileSystemTracker tracker;\n\/\/ tracker.setFolder(locations.first());\n\/\/ tracker.moveToThread(&trackerThread);\n\n\/\/ Koko::Processor processor;\n\/\/ QObject::connect(&tracker, &FileSystemTracker::imageAdded, &processor, &Koko::Processor::addFile);\n\/\/ QObject::connect(&tracker, &FileSystemTracker::imageRemoved, &processor, &Koko::Processor::removeFile);\n\/\/ QObject::connect(&tracker, &FileSystemTracker::initialScanComplete, &processor, &Koko::Processor::initialScanCompleted);\n\/\/ \n\/\/ trackerThread.start();\n\/\/ tracker.init();\n\/\/ \n\/\/ KokoConfig config;\n\n QQmlEngine engine;\n QQmlContext* objectContext = engine.rootContext();\n QString platformEnv(qgetenv(\"PLASMA_PLATFORM\"));\n engine.rootContext()->setContextProperty(\"PLASMA_PLATFORM\", platformEnv);\n engine.rootContext()->setContextProperty(\"bookLocations\", locations);\n \/\/ Yes, i realise this is a touch on the ugly side. I have found no better way to allow for\n \/\/ things like the archive book model to create imageproviders for the archives\n engine.rootContext()->setContextProperty(\"globalQmlEngine\", &engine);\n\n QString path;\n\/\/ if (platformEnv.startsWith(\"phone\")) {\n \/\/ Once we've got a functional desktop version, restore this check. Right now it doesn't make a lot of sense.\n if(true) {\n path = QStandardPaths::locate(QStandardPaths::DataLocation, \"qml\/MobileMain.qml\");\n } else {\n path = QStandardPaths::locate(QStandardPaths::DataLocation, \"qml\/Main.qml\");\n }\n QQmlComponent component(&engine, path);\n if (component.isError()) {\n std::cout << component.errorString().toUtf8().constData() << std::endl;\n Q_ASSERT(0);\n }\n Q_ASSERT(component.status() == QQmlComponent::Ready);\n\n QObject* obj = component.create(objectContext);\n Q_ASSERT(obj);\n\n int rt = app.exec();\n\/\/ trackerThread.quit();\n return rt;\n}\n<|endoftext|>"} {"text":"<commit_before>#include <QtQuick>\n\n#include \"person.h\"\n#include \"company.h\"\n\n#include <sailfishapp.h>\n#include <QScopedPointer>\n#include <QQuickView>\n#include <QQmlEngine>\n#include <QGuiApplication>\n\n#include \"Logger\"\n#include \"LogManager\"\n\n\/\/ Includes below are needed for manual configuration. If you use .conf file for configuring,\n\/\/ just PropertyConfigurator is enough\n\/\/#include \"ConsoleAppender\"\n\/\/#include \"ColorConsoleAppender\"\n\/\/#include \"SimpleTimeLayout\"\n\/\/#include \"SystemlogAppender\"\n\/\/#include \"Level\"\n\/\/#include \"DailyRollingFileAppender\"\n\/\/#include \"helpers\/factory.h\"\n\/\/#include \"Appender\"\n\n\n#include \"PropertyConfigurator\"\n\n#include <QFile>\n#include \"qmllogger.h\"\n\n\/\/Log4Qt::Appender *create_system_log_appender() {\n\/\/ return new Log4Qt::SystemLogAppender;\n\/\/}\n\n\/**\n * @brief initLogging\n * @param app Is used for determining app-specific config, log file locations, etc\n *\/\nvoid initLogging(const QCoreApplication& app)\n{\n\n const QString& binaryName = QCoreApplication::applicationName();\n const QString logConfigFilePath(\"\/home\/nemo\/.config\/\" + binaryName + \"\/log4qt.conf\");\n const QString fallbackLogConfigPath(\"\/usr\/share\/\" + binaryName + \"\/log4qt.conf\");\n\n const QString& usedConfigFile = QFile::exists(logConfigFilePath) ? logConfigFilePath : fallbackLogConfigPath;\n Log4Qt::PropertyConfigurator::configure(usedConfigFile);\n Log4Qt::LogManager::setHandleQtMessages(true);\n\n qDebug() << \"Using following log config file: \" << usedConfigFile;\n\n\n \/**\n \/\/ Normally you call it all from .conf properties, but you can instantiate it manually too\n Log4Qt::Factory::registerAppender(\"org.apache.log4j.SystemLogAppender\", create_system_log_appender);\n Log4Qt::LogManager::rootLogger();\n\n \/\/ Note that it doesn't work for QML logs from device\n\n Log4Qt::SimpleTimeLayout *p_layout = new Log4Qt::SimpleTimeLayout();\n\n p_layout->setName(QLatin1String(\"root layout\"));\n p_layout->activateOptions();\n\n \/\/ Create an appender\n Log4Qt::ColorConsoleAppender *p_consoleAppender = new Log4Qt::ColorConsoleAppender(p_layout, Log4Qt::ColorConsoleAppender::STDOUT_TARGET);\n p_consoleAppender->setName(QLatin1String(\"root console appender\"));\n p_consoleAppender->activateOptions();\n\n Log4Qt::SystemLogAppender *p_syslogAppender = new Log4Qt::SystemLogAppender();\n p_syslogAppender->setServiceName(\"journalctl\");\n p_syslogAppender->setName(QLatin1String(\"root sysylog appender\"));\n p_syslogAppender->setLayout(p_layout);\n\n \/\/ Root logger gets all levels of logs, but let's send only\n \/\/ important ones to syslog\n p_syslogAppender->setThreshold(Log4Qt::Level(Log4Qt::Level::ERROR_INT));\n\n p_syslogAppender->activateOptions();\n\n Log4Qt::DailyRollingFileAppender *p_fileAppender =\n new Log4Qt::DailyRollingFileAppender();\n p_fileAppender->setFile(QStandardPaths::writableLocation(QStandardPaths::CacheLocation)\n + \"\/\" + applicationName + \"\/\" + applicationName +\".log\");\n p_fileAppender->setDatePattern(Log4Qt::DailyRollingFileAppender::DAILY_ROLLOVER);\n p_fileAppender->setLayout(p_layout);\n p_syslogAppender->setName(QLatin1String(\"root file appender\"));\n p_fileAppender->activateOptions();\n\n\n \/\/ Set appenders on root logger\n Log4Qt::Logger::rootLogger()->addAppender(p_consoleAppender);\n Log4Qt::Logger::rootLogger()->addAppender(p_syslogAppender);\n Log4Qt::Logger::rootLogger()->addAppender(p_fileAppender);\n *\/\n\n Log4Qt::Logger::logger(QLatin1String(\"Main Logger\"))->info(\"Logging started\");\n\n\n bool handingMessages = Log4Qt::LogManager::handleQtMessages();\n qDebug() << \"Intercepting messages from qDebug is \" << handingMessages;\n qDebug() << \"temp loc\" << QStandardPaths::standardLocations(QStandardPaths::TempLocation);\n qDebug() << \"config loc\" << QStandardPaths::standardLocations(QStandardPaths::ConfigLocation);\n qDebug() << \"cache loc\" << QStandardPaths::standardLocations(QStandardPaths::CacheLocation);\n qDebug() << \"generic cache loc\" << QStandardPaths::standardLocations(QStandardPaths::GenericCacheLocation);\n qDebug() << \"data loc\" << QStandardPaths::standardLocations(QStandardPaths::DataLocation);\n qDebug() << \"generic data loc\" << QStandardPaths::standardLocations(QStandardPaths::GenericDataLocation);\n qDebug() << \"appName: \" << QCoreApplication::applicationName();\n qDebug() << \"appFilePath: \" << QCoreApplication::applicationFilePath();\n qDebug() << \"appDirPath: \" << QCoreApplication::applicationDirPath();\n}\n\n\nint main(int argc, char *argv[])\n{\n\n qmlRegisterType<Person>(\"harbour.log4qtdemo\", 0, 1, \"Person\");\n qmlRegisterType<Company>(\"harbour.log4qtdemo\", 0, 1, \"Company\");\n qmlRegisterType<QmlLogger>(\"harbour.log4qtdemo\", 0, 1, \"Logger\");\n QScopedPointer<QGuiApplication> app(SailfishApp::application(argc, argv));\n initLogging(*app);\n\n QScopedPointer<QQuickView> view(SailfishApp::createView());\n qDebug() << \"app's name: \" << app->applicationName();\n qDebug() << \"app's die path: \" << app->applicationDirPath();\n\n view->setSource(SailfishApp::pathTo(\"qml\/main.qml\"));\n\/\/ view->rootContext()->setContextProperty(\"appVersion\", APP_VERSION);\n\/\/ view->rootContext()->setContextProperty(\"appBuildNum\", APP_BUILDNUM);\n\/\/ view->engine()->addImportPath(SailfishApp::pathTo(\"qml\/components\").toString());\n\/\/ view->engine()->addImportPath(SailfishApp::pathTo(\"lib\").toString());\n\n view->show();\n\n return app->exec();\n}\n<commit_msg>Minor cleanup<commit_after>#include <QtQuick>\n\n#include \"person.h\"\n#include \"company.h\"\n\n#include <sailfishapp.h>\n#include <QScopedPointer>\n#include <QQuickView>\n#include <QQmlEngine>\n#include <QGuiApplication>\n\n#include \"Logger\"\n#include \"LogManager\"\n\n\/\/ Includes below are needed for manual configuration. If you use .conf file for configuring,\n\/\/ just PropertyConfigurator is enough\n\/\/#include \"ConsoleAppender\"\n\/\/#include \"ColorConsoleAppender\"\n\/\/#include \"SimpleTimeLayout\"\n\/\/#include \"SystemlogAppender\"\n\/\/#include \"Level\"\n\/\/#include \"DailyRollingFileAppender\"\n\/\/#include \"helpers\/factory.h\"\n\/\/#include \"Appender\"\n\n\n#include \"PropertyConfigurator\"\n\n#include <QFile>\n#include \"qmllogger.h\"\n\n\/\/Log4Qt::Appender *create_system_log_appender() {\n\/\/ return new Log4Qt::SystemLogAppender;\n\/\/}\n\n\/**\n * @brief initLogging\n * @param app Is used for determining app-specific config, log file locations, etc\n *\/\nvoid initLogging()\n{\n const QString& binaryName = QCoreApplication::applicationName();\n const QString logConfigFilePath(\"\/home\/nemo\/.config\/\" + binaryName + \"\/log4qt.conf\");\n const QString fallbackLogConfigPath(\"\/usr\/share\/\" + binaryName + \"\/log4qt.conf\");\n\n const QString& usedConfigFile = QFile::exists(logConfigFilePath) ? logConfigFilePath : fallbackLogConfigPath;\n Log4Qt::PropertyConfigurator::configure(usedConfigFile);\n Log4Qt::LogManager::setHandleQtMessages(true);\n\n qDebug() << \"Using following log config file: \" << usedConfigFile;\n\n\n \/**\n \/\/ Normally you call it all from .conf properties, but you can instantiate it manually too\n Log4Qt::Factory::registerAppender(\"org.apache.log4j.SystemLogAppender\", create_system_log_appender);\n Log4Qt::LogManager::rootLogger();\n\n \/\/ Note that it doesn't work for QML logs from device\n\n Log4Qt::SimpleTimeLayout *p_layout = new Log4Qt::SimpleTimeLayout();\n\n p_layout->setName(QLatin1String(\"root layout\"));\n p_layout->activateOptions();\n\n \/\/ Create an appender\n Log4Qt::ColorConsoleAppender *p_consoleAppender = new Log4Qt::ColorConsoleAppender(p_layout, Log4Qt::ColorConsoleAppender::STDOUT_TARGET);\n p_consoleAppender->setName(QLatin1String(\"root console appender\"));\n p_consoleAppender->activateOptions();\n\n Log4Qt::SystemLogAppender *p_syslogAppender = new Log4Qt::SystemLogAppender();\n p_syslogAppender->setServiceName(\"journalctl\");\n p_syslogAppender->setName(QLatin1String(\"root sysylog appender\"));\n p_syslogAppender->setLayout(p_layout);\n\n \/\/ Root logger gets all levels of logs, but let's send only\n \/\/ important ones to syslog\n p_syslogAppender->setThreshold(Log4Qt::Level(Log4Qt::Level::ERROR_INT));\n\n p_syslogAppender->activateOptions();\n\n Log4Qt::DailyRollingFileAppender *p_fileAppender =\n new Log4Qt::DailyRollingFileAppender();\n p_fileAppender->setFile(QStandardPaths::writableLocation(QStandardPaths::CacheLocation)\n + \"\/\" + applicationName + \"\/\" + applicationName +\".log\");\n p_fileAppender->setDatePattern(Log4Qt::DailyRollingFileAppender::DAILY_ROLLOVER);\n p_fileAppender->setLayout(p_layout);\n p_syslogAppender->setName(QLatin1String(\"root file appender\"));\n p_fileAppender->activateOptions();\n\n\n \/\/ Set appenders on root logger\n Log4Qt::Logger::rootLogger()->addAppender(p_consoleAppender);\n Log4Qt::Logger::rootLogger()->addAppender(p_syslogAppender);\n Log4Qt::Logger::rootLogger()->addAppender(p_fileAppender);\n *\/\n\n Log4Qt::Logger::logger(QLatin1String(\"Main Logger\"))->info(\"Logging started\");\n\n\n bool handingMessages = Log4Qt::LogManager::handleQtMessages();\n qDebug() << \"Intercepting messages from qDebug is \" << handingMessages;\n qDebug() << \"temp loc\" << QStandardPaths::standardLocations(QStandardPaths::TempLocation);\n qDebug() << \"config loc\" << QStandardPaths::standardLocations(QStandardPaths::ConfigLocation);\n qDebug() << \"cache loc\" << QStandardPaths::standardLocations(QStandardPaths::CacheLocation);\n qDebug() << \"generic cache loc\" << QStandardPaths::standardLocations(QStandardPaths::GenericCacheLocation);\n qDebug() << \"data loc\" << QStandardPaths::standardLocations(QStandardPaths::DataLocation);\n qDebug() << \"generic data loc\" << QStandardPaths::standardLocations(QStandardPaths::GenericDataLocation);\n qDebug() << \"appName: \" << QCoreApplication::applicationName();\n qDebug() << \"appFilePath: \" << QCoreApplication::applicationFilePath();\n qDebug() << \"appDirPath: \" << QCoreApplication::applicationDirPath();\n}\n\n\nint main(int argc, char *argv[])\n{\n\n qmlRegisterType<Person>(\"harbour.log4qtdemo\", 0, 1, \"Person\");\n qmlRegisterType<Company>(\"harbour.log4qtdemo\", 0, 1, \"Company\");\n qmlRegisterType<QmlLogger>(\"harbour.log4qtdemo\", 0, 1, \"Logger\");\n QScopedPointer<QGuiApplication> app(SailfishApp::application(argc, argv));\n initLogging();\n\n QScopedPointer<QQuickView> view(SailfishApp::createView());\n qDebug() << \"app's name: \" << app->applicationName();\n qDebug() << \"app's die path: \" << app->applicationDirPath();\n\n view->setSource(SailfishApp::pathTo(\"qml\/main.qml\"));\n\/\/ view->rootContext()->setContextProperty(\"appVersion\", APP_VERSION);\n\/\/ view->rootContext()->setContextProperty(\"appBuildNum\", APP_BUILDNUM);\n\/\/ view->engine()->addImportPath(SailfishApp::pathTo(\"qml\/components\").toString());\n\/\/ view->engine()->addImportPath(SailfishApp::pathTo(\"lib\").toString());\n\n view->show();\n\n return app->exec();\n}\n<|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) any later version.\n *\n * This library is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU\n * Lesser General Public License for more details.\n *\n * You should have received 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 <QQmlEngine>\n#include <QQmlContext>\n#include <QQmlComponent>\n\n#include <QStandardPaths>\n#include <QDebug>\n#include <QThread>\n\n#include <KDBusService>\n#include <KLocalizedString>\n\n#include <QApplication>\n#include <QCommandLineParser>\n#include <QCommandLineOption>\n\n#include <iostream>\n\nint main(int argc, char** argv)\n{\n QApplication app(argc, argv);\n app.setApplicationDisplayName(\"Peruse\");\n\n KDBusService service(KDBusService::Unique);\n\n QCommandLineParser parser;\n parser.addOption(QCommandLineOption(\"reset\", i18n(\"Reset the database\")));\n parser.addHelpOption();\n parser.process(app);\n\n if (parser.positionalArguments().size() > 1) {\n parser.showHelp(1);\n }\n\n if (parser.isSet(\"reset\")) {\n\/\/ KokoConfig config;\n\/\/ config.reset();\n\n\/\/ ImageStorage::reset();\n }\n\n QThread trackerThread;\n\n QStringList locations = QStandardPaths::standardLocations(QStandardPaths::HomeLocation);\n Q_ASSERT(locations.size() >= 1);\n\/\/ qDebug() << locations;\n\/\/ FileSystemTracker tracker;\n\/\/ tracker.setFolder(locations.first());\n\/\/ tracker.moveToThread(&trackerThread);\n\n\/\/ Koko::Processor processor;\n\/\/ QObject::connect(&tracker, &FileSystemTracker::imageAdded, &processor, &Koko::Processor::addFile);\n\/\/ QObject::connect(&tracker, &FileSystemTracker::imageRemoved, &processor, &Koko::Processor::removeFile);\n\/\/ QObject::connect(&tracker, &FileSystemTracker::initialScanComplete, &processor, &Koko::Processor::initialScanCompleted);\n\/\/ \n\/\/ trackerThread.start();\n\/\/ tracker.init();\n\/\/ \n\/\/ KokoConfig config;\n\n QQmlEngine engine;\n QQmlContext* objectContext = engine.rootContext();\n engine.rootContext()->setContextProperty(\"PLASMA_PLATFORM\", QString(qgetenv(\"PLASMA_PLATFORM\")));\n engine.rootContext()->setContextProperty(\"bookLocations\", locations);\n \/\/ Yes, i realise this is a touch on the ugly side. I have found no better way to allow for\n \/\/ things like the archive book model to create imageproviders for the archives\n engine.rootContext()->setContextProperty(\"globalQmlEngine\", &engine);\n\n QString path;\n if (qgetenv(\"PLASMA_PLATFORM\") == QByteArray(\"phone\")) {\n path = QStandardPaths::locate(QStandardPaths::DataLocation, \"qml\/MobileMain.qml\");\n } else {\n path = QStandardPaths::locate(QStandardPaths::DataLocation, \"qml\/Main.qml\");\n }\n QQmlComponent component(&engine, path);\n if (component.isError()) {\n std::cout << component.errorString().toUtf8().constData() << std::endl;\n Q_ASSERT(0);\n }\n Q_ASSERT(component.status() == QQmlComponent::Ready);\n\n QObject* obj = component.create(objectContext);\n Q_ASSERT(obj);\n\n int rt = app.exec();\n\/\/ trackerThread.quit();\n return rt;\n}\n<commit_msg>Less assumptions, more proper platform sniff<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) any later version.\n *\n * This library is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU\n * Lesser General Public License for more details.\n *\n * You should have received 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 <QQmlEngine>\n#include <QQmlContext>\n#include <QQmlComponent>\n\n#include <QStandardPaths>\n#include <QDebug>\n#include <QThread>\n\n#include <KDBusService>\n#include <KLocalizedString>\n\n#include <QApplication>\n#include <QCommandLineParser>\n#include <QCommandLineOption>\n\n#include <iostream>\n\nint main(int argc, char** argv)\n{\n QApplication app(argc, argv);\n app.setApplicationDisplayName(\"Peruse\");\n\n KDBusService service(KDBusService::Unique);\n\n QCommandLineParser parser;\n parser.addOption(QCommandLineOption(\"reset\", i18n(\"Reset the database\")));\n parser.addHelpOption();\n parser.process(app);\n\n if (parser.positionalArguments().size() > 1) {\n parser.showHelp(1);\n }\n\n if (parser.isSet(\"reset\")) {\n\/\/ KokoConfig config;\n\/\/ config.reset();\n\n\/\/ ImageStorage::reset();\n }\n\n QThread trackerThread;\n\n QStringList locations = QStandardPaths::standardLocations(QStandardPaths::HomeLocation);\n Q_ASSERT(locations.size() >= 1);\n\/\/ qDebug() << locations;\n\/\/ FileSystemTracker tracker;\n\/\/ tracker.setFolder(locations.first());\n\/\/ tracker.moveToThread(&trackerThread);\n\n\/\/ Koko::Processor processor;\n\/\/ QObject::connect(&tracker, &FileSystemTracker::imageAdded, &processor, &Koko::Processor::addFile);\n\/\/ QObject::connect(&tracker, &FileSystemTracker::imageRemoved, &processor, &Koko::Processor::removeFile);\n\/\/ QObject::connect(&tracker, &FileSystemTracker::initialScanComplete, &processor, &Koko::Processor::initialScanCompleted);\n\/\/ \n\/\/ trackerThread.start();\n\/\/ tracker.init();\n\/\/ \n\/\/ KokoConfig config;\n\n QQmlEngine engine;\n QQmlContext* objectContext = engine.rootContext();\n QString platformEnv(qgetenv(\"PLASMA_PLATFORM\"));\n engine.rootContext()->setContextProperty(\"PLASMA_PLATFORM\", platformEnv);\n engine.rootContext()->setContextProperty(\"bookLocations\", locations);\n \/\/ Yes, i realise this is a touch on the ugly side. I have found no better way to allow for\n \/\/ things like the archive book model to create imageproviders for the archives\n engine.rootContext()->setContextProperty(\"globalQmlEngine\", &engine);\n\n QString path;\n if (platformEnv.startsWith(\"phone\")) {\n path = QStandardPaths::locate(QStandardPaths::DataLocation, \"qml\/MobileMain.qml\");\n } else {\n path = QStandardPaths::locate(QStandardPaths::DataLocation, \"qml\/Main.qml\");\n }\n QQmlComponent component(&engine, path);\n if (component.isError()) {\n std::cout << component.errorString().toUtf8().constData() << std::endl;\n Q_ASSERT(0);\n }\n Q_ASSERT(component.status() == QQmlComponent::Ready);\n\n QObject* obj = component.create(objectContext);\n Q_ASSERT(obj);\n\n int rt = app.exec();\n\/\/ trackerThread.quit();\n return rt;\n}\n<|endoftext|>"} {"text":"<commit_before>class Solution {\npublic:\n \/**\n * Get all distinct N-Queen solutions\n * @param n: The number of queens\n * @return: All distinct solutions\n * For example, A string '...Q' shows a queen on forth position\n *\/\n\n vector<vector<string> > rt_st;\n int n;\n\n\n vector<vector<string> > solveNQueens(int n) {\n \/\/ write your code here\n \tstring s1,s2,s3;\n std::vector<string> v_str;\n vector<int> v_int;\n\n if (n<1) return rt_st;\n this->n=n;\n\n int rt_flag=bfs(n,0,v_int);\n\n if(rt_flag==1) return rt_st;\n else cout<<rt_flag<<endl;\n \t rt_st.clear();\n }\n\n vector<string> vecInt_to_vecstring(std::vector<int> &v){\n \tint i,j,k;\n \tstring s1;\n \tstd::vector<string> rt_s;\n \tfor (auto v1:v){\n \t\ts1.clear(); \n \t\tfor (i=1;i<=n;i++) s1+='.';\n \t\ts1[v1]='Q';\n\n \t\trt_s.push_back(s1);\n\n \t}\n\n \treturn rt_s;\n }\n\n int bfs(int n,int i,std::vector<int> &v){\n\n \tif (i==n) rt_st.push_back(vecInt_to_vecstring(v));\n\n \tint j,k;\n\n \tfor (j=1;j<=n;j++){\n \t\tif (find(v.begin(),v.end(),j)!=v.end()){\n\n \t\t\tv.push_back(j); \t\t\t\n \t\t\tbfs(n,i+1,v);\n \t\t\tv.pop_back();\n\n \t\t}\n \t\telse{\n \t\t\tcontinue;\n \t\t}\n \t}\n\n \treturn 1;\n\n\n }\n\n};\n<commit_msg>Debugging 33<commit_after>class Solution {\npublic:\n \/**\n * Get all distinct N-Queen solutions\n * @param n: The number of queens\n * @return: All distinct solutions\n * For example, A string '...Q' shows a queen on forth position\n *\/\n\n vector<vector<string> > rt_st;\n int n;\n\n\n vector<vector<string> > solveNQueens(int n) {\n \/\/ write your code here\n \tstring s1,s2,s3;\n std::vector<string> v_str;\n vector<int> v_int;\n\n if (n<1) return rt_st;\n this->n=n;\n\n int rt_flag=bfs(n,0,v_int);\n\n if(rt_flag==1) return rt_st;\n else cout<<rt_flag<<endl;\n \t rt_st.clear();\n }\n\n vector<string> vecInt_to_vecstring(std::vector<int> &v){\n \tint i,j,k;\n \tstring s1;\n \tstd::vector<string> rt_s;\n \tfor (auto v1:v){\n \t\ts1.clear(); \n \t\tfor (i=1;i<=n;i++) s1+='.';\n \t\ts1[v1]='Q';\n\n \t\trt_s.push_back(s1);\n\n \t}\n\n \treturn rt_s;\n }\n\n int bfs(int n,int i,std::vector<int> &v){\n\n \tif (i==n) rt_st.push_back(vecInt_to_vecstring(v));\n\n \tint j,k;\n \tlong long dj_status=0,dj_status_bf=0;\n \tfor (const auto v1:v){\n \t\tdj_status=dj_status|(1<<v1);\n \t\tcout<<v1<<\" \";\n \t}\n \t\n \tdj_status_bf=dj_status;\n \tdj_status = ((dj_status<<1) | (dj_status>>1));\n \tcout<<dj_status<<endl;\n\n\n \tfor (j=1;j<=n;j++){\n\n \t\tif (find(v.begin(),v.end(),j)==v.end()){ \t\t\t\n \t\t\t\n \t\t\t\n\t\t\t\tif ( ( dj_status & (1<<j)) == 0){\n\t\t\t\t\tv.push_back(j); \t\t\t\n \t\t\t\tbfs(n,i+1,v);\n \t\t\t\tv.pop_back();\n\t\t\t\t}\n \t\t\t\n\n \t\t}\n \t\telse{\n \t\t\tcontinue;\n \t\t}\n \t}\n\n \treturn 1;\n\n\n }\n\n};\n<|endoftext|>"} {"text":"<commit_before>class Solution {\npublic:\n \/**\n * @param A: A string includes Upper Case letters\n * @param B: A string includes Upper Case letter\n * @return: if string A contains all of the characters in B return true \n * else return false\n *\/\n\n typedef map<char,int> charHash;\n\n charHash keyHashLize(string s){\n \tcharHash s1;\n \tfor (int i=0;i<s.length();i++){\n \t\tif (s1[s[i]]) s1[s[i]]++;\n \t\telse s1[s[i]]=1;\n \t}\n\n \treturn s1;\n }\n\n\n bool compareStrings(string A, string B) {\n \/\/ write your code here\n\n charHash s1=keyHashLize(A),t1=keyHashLize(B);\n if (!A.length() and B.length()) return false;\n if (!B.length()) return true;\n\n for (charHash::iterator t2=t1.begin();t2 != t1.end();t2++)\n {\n \tif (! t2->second <= s1[t2->first] ) return false; \t\n }\n\n return true;\n\n }\n};\n<commit_msg>Solve No.55 in C++<commit_after>class Solution {\npublic:\n \/**\n * @param A: A string includes Upper Case letters\n * @param B: A string includes Upper Case letter\n * @return: if string A contains all of the characters in B return true \n * else return false\n *\/\n\n typedef map<char,int> charHash;\n\n charHash keyHashLize(string s){\n \tcharHash s1;\n \t\n \tfor (int i=0;i<26;++i){\n \t s1['A'+i]=0;\n \t s1['a'+i]=0;\n \t}\n \tfor (int i=0;i<s.length();i++){\n \t\tif (s1[s[i]]) s1[s[i]]++;\n \t\telse s1[s[i]]=1;\n \t}\n\n \treturn s1;\n }\n\n\n bool compareStrings(string A, string B) {\n \/\/ write your code here\n\n charHash s1=keyHashLize(A),t1=keyHashLize(B);\n if (!A.length() and B.length()) return false;\n if (!B.length()) return true;\n\n for (charHash::iterator t2=t1.begin();t2 != t1.end();t2++)\n {\n \tif (! (t2->second <= s1[t2->first]) ) return false; \t\n }\n\n return true;\n\n }\n};\n<|endoftext|>"} {"text":"<commit_before>\/*\n Copyright 2012 David Robillard <http:\/\/drobilla.net>\n\n Permission to use, copy, modify, and\/or distribute this software for any\n purpose with or without fee is hereby granted, provided that the above\n copyright notice and this permission notice appear in all copies.\n\n THIS SOFTWARE IS PROVIDED \"AS IS\" AND THE AUTHOR DISCLAIMS ALL WARRANTIES\n WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF\n MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR\n ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES\n WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN\n ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF\n OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE.\n*\/\n\n\/**\n @file pugl_win.cpp Windows\/WGL Pugl Implementation.\n*\/\n\n#include <windows.h>\n#include <windowsx.h>\n#include <GL\/gl.h>\n\n#include <stdio.h>\n#include <stdlib.h>\n\n#include \"pugl_internal.h\"\n\n#ifndef WM_MOUSEWHEEL\n# define WM_MOUSEWHEEL 0x020A\n#endif\n#ifndef WM_MOUSEHWHEEL\n# define WM_MOUSEHWHEEL 0x020E\n#endif\n#ifndef WHEEL_DELTA\n# define WHEEL_DELTA 120\n#endif\n\nconst int LOCAL_CLOSE_MSG = WM_USER + 50;\n\nstruct PuglInternalsImpl {\n\tHWND hwnd;\n\tHDC hdc;\n\tHGLRC hglrc;\n\tWNDCLASS wc;\n};\n\nLRESULT CALLBACK\nwndProc(HWND hwnd, UINT message, WPARAM wParam, LPARAM lParam);\n\nPuglView*\npuglCreate(PuglNativeWindow parent,\n const char* title,\n int width,\n int height,\n bool resizable,\n bool visible)\n{\n\tPuglView* view = (PuglView*)calloc(1, sizeof(PuglView));\n\tPuglInternals* impl = (PuglInternals*)calloc(1, sizeof(PuglInternals));\n\tif (!view || !impl) {\n\t\treturn NULL;\n\t}\n\n\tview->impl = impl;\n\tview->width = width;\n\tview->height = height;\n\n\t\/\/ FIXME: This is nasty, and pugl should not have static anything.\n\t\/\/ Should class be a parameter? Does this make sense on other platforms?\n\tstatic int wc_count = 0;\n\tchar classNameBuf[256];\n\t_snprintf(classNameBuf, sizeof(classNameBuf), \"%s_%d\\n\", title, wc_count++);\n\n\timpl->wc.style = CS_OWNDC;\n\timpl->wc.lpfnWndProc = wndProc;\n\timpl->wc.cbClsExtra = 0;\n\timpl->wc.cbWndExtra = 0;\n\timpl->wc.hInstance = 0;\n\timpl->wc.hIcon = LoadIcon(NULL, IDI_APPLICATION);\n\timpl->wc.hCursor = LoadCursor(NULL, IDC_ARROW);\n\timpl->wc.hbrBackground = (HBRUSH)GetStockObject(BLACK_BRUSH);\n\timpl->wc.lpszMenuName = NULL;\n\timpl->wc.lpszClassName = classNameBuf;\n\tRegisterClass(&impl->wc);\n\n\tint winFlags = WS_POPUPWINDOW | WS_CAPTION;\n\tif (resizable) {\n\t\twinFlags |= WS_SIZEBOX;\n\t}\n\n\t\/\/ Adjust the overall window size to accomodate our requested client size\n\tRECT wr = { 0, 0, width, height };\n\tAdjustWindowRectEx(&wr, winFlags, FALSE, WS_EX_TOPMOST);\n\n\timpl->hwnd = CreateWindowEx(\n\t\tWS_EX_TOPMOST,\n \t\tclassNameBuf, title,\n\t\t(addToDesktop ? WS_VISIBLE : 0) | (parent ? WS_CHILD : winFlags),\n\t\t0, 0, wr.right-wr.left, wr.bottom-wr.top,\n\t\t(HWND)parent, NULL, NULL, NULL);\n\n\tif (!impl->hwnd) {\n\t\tfree(impl);\n\t\tfree(view);\n\t\treturn NULL;\n\t}\n\n\tSetWindowLongPtr(impl->hwnd, GWL_USERDATA, (LONG)view);\n\n\timpl->hdc = GetDC(impl->hwnd);\n\n\tPIXELFORMATDESCRIPTOR pfd;\n\tZeroMemory(&pfd, sizeof(pfd));\n\tpfd.nSize = sizeof(pfd);\n\tpfd.nVersion = 1;\n\tpfd.dwFlags = PFD_DRAW_TO_WINDOW | PFD_SUPPORT_OPENGL | PFD_DOUBLEBUFFER;\n\tpfd.iPixelType = PFD_TYPE_RGBA;\n\tpfd.cColorBits = 24;\n\tpfd.cDepthBits = 16;\n\tpfd.iLayerType = PFD_MAIN_PLANE;\n\n\tint format = ChoosePixelFormat(impl->hdc, &pfd);\n\tSetPixelFormat(impl->hdc, format, &pfd);\n\n\timpl->hglrc = wglCreateContext(impl->hdc);\n\twglMakeCurrent(impl->hdc, impl->hglrc);\n\n\tview->width = width;\n\tview->height = height;\n\n\treturn view;\n}\n\nvoid\npuglDestroy(PuglView* view)\n{\n\twglMakeCurrent(NULL, NULL);\n\twglDeleteContext(view->impl->hglrc);\n\tReleaseDC(view->impl->hwnd, view->impl->hdc);\n\tDestroyWindow(view->impl->hwnd);\n\tUnregisterClass(view->impl->wc.lpszClassName, NULL);\n\tfree(view->impl);\n\tfree(view);\n}\n\nstatic void\npuglReshape(PuglView* view, int width, int height)\n{\n\twglMakeCurrent(view->impl->hdc, view->impl->hglrc);\n\n\tif (view->reshapeFunc) {\n\t\tview->reshapeFunc(view, width, height);\n\t} else {\n\t\tpuglDefaultReshape(view, width, height);\n\t}\n\n\tview->width = width;\n\tview->height = height;\n}\n\nvoid\npuglDisplay(PuglView* view)\n{\n\twglMakeCurrent(view->impl->hdc, view->impl->hglrc);\n\tglClear(GL_COLOR_BUFFER_BIT | GL_DEPTH_BUFFER_BIT);\n\tglLoadIdentity();\n\n\tif (view->displayFunc) {\n\t\tview->displayFunc(view);\n\t}\n\n\tglFlush();\n\tSwapBuffers(view->impl->hdc);\n\tview->redisplay = false;\n}\n\nstatic PuglKey\nkeySymToSpecial(int sym)\n{\n\tswitch (sym) {\n\tcase VK_F1: return PUGL_KEY_F1;\n\tcase VK_F2: return PUGL_KEY_F2;\n\tcase VK_F3: return PUGL_KEY_F3;\n\tcase VK_F4: return PUGL_KEY_F4;\n\tcase VK_F5: return PUGL_KEY_F5;\n\tcase VK_F6: return PUGL_KEY_F6;\n\tcase VK_F7: return PUGL_KEY_F7;\n\tcase VK_F8: return PUGL_KEY_F8;\n\tcase VK_F9: return PUGL_KEY_F9;\n\tcase VK_F10: return PUGL_KEY_F10;\n\tcase VK_F11: return PUGL_KEY_F11;\n\tcase VK_F12: return PUGL_KEY_F12;\n\tcase VK_LEFT: return PUGL_KEY_LEFT;\n\tcase VK_UP: return PUGL_KEY_UP;\n\tcase VK_RIGHT: return PUGL_KEY_RIGHT;\n\tcase VK_DOWN: return PUGL_KEY_DOWN;\n\tcase VK_PRIOR: return PUGL_KEY_PAGE_UP;\n\tcase VK_NEXT: return PUGL_KEY_PAGE_DOWN;\n\tcase VK_HOME: return PUGL_KEY_HOME;\n\tcase VK_END: return PUGL_KEY_END;\n\tcase VK_INSERT: return PUGL_KEY_INSERT;\n\tcase VK_SHIFT: return PUGL_KEY_SHIFT;\n\tcase VK_CONTROL: return PUGL_KEY_CTRL;\n\tcase VK_MENU: return PUGL_KEY_ALT;\n\tcase VK_LWIN: return PUGL_KEY_SUPER;\n\tcase VK_RWIN: return PUGL_KEY_SUPER;\n\t}\n\treturn (PuglKey)0;\n}\n\nstatic void\nprocessMouseEvent(PuglView* view, int button, bool press, LPARAM lParam)\n{\n\tview->event_timestamp_ms = GetMessageTime();\n\tif (press) {\n\t\tSetCapture(view->impl->hwnd);\n\t} else {\n\t\tReleaseCapture();\n\t}\n\n\tif (view->mouseFunc) {\n\t\tview->mouseFunc(view, button, press,\n\t\t GET_X_LPARAM(lParam),\n\t\t GET_Y_LPARAM(lParam));\n\t}\n}\n\nstatic void\nsetModifiers(PuglView* view)\n{\n\tview->mods = 0;\n\tview->mods |= (GetKeyState(VK_SHIFT) < 0) ? PUGL_MOD_SHIFT : 0;\n\tview->mods |= (GetKeyState(VK_CONTROL) < 0) ? PUGL_MOD_CTRL : 0;\n\tview->mods |= (GetKeyState(VK_MENU) < 0) ? PUGL_MOD_ALT : 0;\n\tview->mods |= (GetKeyState(VK_LWIN) < 0) ? PUGL_MOD_SUPER : 0;\n\tview->mods |= (GetKeyState(VK_RWIN) < 0) ? PUGL_MOD_SUPER : 0;\n}\n\nstatic LRESULT\nhandleMessage(PuglView* view, UINT message, WPARAM wParam, LPARAM lParam)\n{\n\tPAINTSTRUCT ps;\n\tPuglKey key;\n\n\tsetModifiers(view);\n\tswitch (message) {\n\tcase WM_CREATE:\n\tcase WM_SHOWWINDOW:\n\tcase WM_SIZE:\n\t\tRECT rect;\n\t\tGetClientRect(view->impl->hwnd, &rect);\n\t\tpuglReshape(view, rect.right, rect.bottom);\n\t\tview->width = rect.right;\n\t\tview->height = rect.bottom;\n\t\tbreak;\n\tcase WM_PAINT:\n\t\tBeginPaint(view->impl->hwnd, &ps);\n\t\tpuglDisplay(view);\n\t\tEndPaint(view->impl->hwnd, &ps);\n\t\tbreak;\n\tcase WM_MOUSEMOVE:\n\t\tif (view->motionFunc) {\n\t\t\tview->motionFunc(view, GET_X_LPARAM(lParam), GET_Y_LPARAM(lParam));\n\t\t}\n\t\tbreak;\n\tcase WM_LBUTTONDOWN:\n\t\tprocessMouseEvent(view, 1, true, lParam);\n\t\tbreak;\n\tcase WM_MBUTTONDOWN:\n\t\tprocessMouseEvent(view, 2, true, lParam);\n\t\tbreak;\n\tcase WM_RBUTTONDOWN:\n\t\tprocessMouseEvent(view, 3, true, lParam);\n\t\tbreak;\n\tcase WM_LBUTTONUP:\n\t\tprocessMouseEvent(view, 1, false, lParam);\n\t\tbreak;\n\tcase WM_MBUTTONUP:\n\t\tprocessMouseEvent(view, 2, false, lParam);\n\t\tbreak;\n\tcase WM_RBUTTONUP:\n\t\tprocessMouseEvent(view, 3, false, lParam);\n\t\tbreak;\n\tcase WM_MOUSEWHEEL:\n\t\tif (view->scrollFunc) {\n\t\t\tview->scrollFunc(\n\t\t\t\tview, GET_X_LPARAM(lParam), GET_Y_LPARAM(lParam),\n\t\t\t\t(int16_t)HIWORD(wParam) \/ (float)WHEEL_DELTA);\n\t\t}\n\t\tbreak;\n\tcase WM_MOUSEHWHEEL:\n\t\tif (view->scrollFunc) {\n\t\t\tview->scrollFunc(\n\t\t\t\tview, GET_X_LPARAM(lParam), GET_Y_LPARAM(lParam),\n\t\t\t\t(int16_t)HIWORD(wParam) \/ float(WHEEL_DELTA), 0);\n\t\t}\n\t\tbreak;\n\tcase WM_KEYDOWN:\n\t\tview->event_timestamp_ms = (GetMessageTime());\n\t\tif (view->ignoreKeyRepeat && (lParam & (1 << 30))) {\n\t\t\tbreak;\n\t\t} \/\/ else nobreak\n\tcase WM_KEYUP:\n\t\tif ((key = keySymToSpecial(wParam))) {\n\t\t\tif (view->specialFunc) {\n\t\t\t\tview->specialFunc(view, message == WM_KEYDOWN, key);\n\t\t\t}\n\t\t} else if (view->keyboardFunc) {\n\t\t\tview->keyboardFunc(view, message == WM_KEYDOWN, wParam);\n\t\t}\n\t\tbreak;\n\tcase WM_QUIT:\n\tcase LOCAL_CLOSE_MSG:\n\t\tif (view->closeFunc) {\n\t\t\tview->closeFunc(view);\n\t\t}\n\t\tbreak;\n\tdefault:\n\t\treturn DefWindowProc(\n\t\t\tview->impl->hwnd, message, wParam, lParam);\n\t}\n\n\treturn 0;\n}\n\nPuglStatus\npuglProcessEvents(PuglView* view)\n{\n\tMSG msg;\n\twhile (PeekMessage(&msg, view->impl->hwnd, 0, 0, PM_REMOVE)) {\n\t\thandleMessage(view, msg.message, msg.wParam, msg.lParam);\n\t}\n\n\n\tif (view->redisplay) {\n\t\tInvalidateRect(view->impl->hwnd, NULL, FALSE);\n\t}\n\n\treturn PUGL_SUCCESS;\n}\n\nLRESULT CALLBACK\nwndProc(HWND hwnd, UINT message, WPARAM wParam, LPARAM lParam)\n{\n\tPuglView* view = (PuglView*)GetWindowLongPtr(hwnd, GWL_USERDATA);\n\tswitch (message) {\n\tcase WM_CREATE:\n\t\tPostMessage(hwnd, WM_SHOWWINDOW, TRUE, 0);\n\t\treturn 0;\n\tcase WM_CLOSE:\n\t\tPostMessage(hwnd, LOCAL_CLOSE_MSG, wParam, lParam);\n\t\treturn 0;\n\tcase WM_DESTROY:\n\t\treturn 0;\n\tdefault:\n\t\tif (view) {\n\t\t\treturn handleMessage(view, message, wParam, lParam);\n\t\t} else {\n\t\t\treturn DefWindowProc(hwnd, message, wParam, lParam);\n\t\t}\n\t}\n}\n\nvoid\npuglPostRedisplay(PuglView* view)\n{\n\tview->redisplay = true;\n}\n\nPuglNativeWindow\npuglGetNativeWindow(PuglView* view)\n{\n\treturn (PuglNativeWindow)view->impl->hwnd;\n}\n<commit_msg>Fix compilation error on Windows. I think.<commit_after>\/*\n Copyright 2012 David Robillard <http:\/\/drobilla.net>\n\n Permission to use, copy, modify, and\/or distribute this software for any\n purpose with or without fee is hereby granted, provided that the above\n copyright notice and this permission notice appear in all copies.\n\n THIS SOFTWARE IS PROVIDED \"AS IS\" AND THE AUTHOR DISCLAIMS ALL WARRANTIES\n WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF\n MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR\n ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES\n WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN\n ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF\n OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE.\n*\/\n\n\/**\n @file pugl_win.cpp Windows\/WGL Pugl Implementation.\n*\/\n\n#include <windows.h>\n#include <windowsx.h>\n#include <GL\/gl.h>\n\n#include <stdio.h>\n#include <stdlib.h>\n\n#include \"pugl_internal.h\"\n\n#ifndef WM_MOUSEWHEEL\n# define WM_MOUSEWHEEL 0x020A\n#endif\n#ifndef WM_MOUSEHWHEEL\n# define WM_MOUSEHWHEEL 0x020E\n#endif\n#ifndef WHEEL_DELTA\n# define WHEEL_DELTA 120\n#endif\n\nconst int LOCAL_CLOSE_MSG = WM_USER + 50;\n\nstruct PuglInternalsImpl {\n\tHWND hwnd;\n\tHDC hdc;\n\tHGLRC hglrc;\n\tWNDCLASS wc;\n};\n\nLRESULT CALLBACK\nwndProc(HWND hwnd, UINT message, WPARAM wParam, LPARAM lParam);\n\nPuglView*\npuglCreate(PuglNativeWindow parent,\n const char* title,\n int width,\n int height,\n bool resizable,\n bool visible)\n{\n\tPuglView* view = (PuglView*)calloc(1, sizeof(PuglView));\n\tPuglInternals* impl = (PuglInternals*)calloc(1, sizeof(PuglInternals));\n\tif (!view || !impl) {\n\t\treturn NULL;\n\t}\n\n\tview->impl = impl;\n\tview->width = width;\n\tview->height = height;\n\n\t\/\/ FIXME: This is nasty, and pugl should not have static anything.\n\t\/\/ Should class be a parameter? Does this make sense on other platforms?\n\tstatic int wc_count = 0;\n\tchar classNameBuf[256];\n\t_snprintf(classNameBuf, sizeof(classNameBuf), \"%s_%d\\n\", title, wc_count++);\n\n\timpl->wc.style = CS_OWNDC;\n\timpl->wc.lpfnWndProc = wndProc;\n\timpl->wc.cbClsExtra = 0;\n\timpl->wc.cbWndExtra = 0;\n\timpl->wc.hInstance = 0;\n\timpl->wc.hIcon = LoadIcon(NULL, IDI_APPLICATION);\n\timpl->wc.hCursor = LoadCursor(NULL, IDC_ARROW);\n\timpl->wc.hbrBackground = (HBRUSH)GetStockObject(BLACK_BRUSH);\n\timpl->wc.lpszMenuName = NULL;\n\timpl->wc.lpszClassName = classNameBuf;\n\tRegisterClass(&impl->wc);\n\n\tint winFlags = WS_POPUPWINDOW | WS_CAPTION;\n\tif (resizable) {\n\t\twinFlags |= WS_SIZEBOX;\n\t}\n\n\t\/\/ Adjust the overall window size to accomodate our requested client size\n\tRECT wr = { 0, 0, width, height };\n\tAdjustWindowRectEx(&wr, winFlags, FALSE, WS_EX_TOPMOST);\n\n\timpl->hwnd = CreateWindowEx(\n\t\tWS_EX_TOPMOST,\n \t\tclassNameBuf, title,\n\t\t(visible ? WS_VISIBLE : 0) | (parent ? WS_CHILD : winFlags),\n\t\t0, 0, wr.right-wr.left, wr.bottom-wr.top,\n\t\t(HWND)parent, NULL, NULL, NULL);\n\n\tif (!impl->hwnd) {\n\t\tfree(impl);\n\t\tfree(view);\n\t\treturn NULL;\n\t}\n\n\tSetWindowLongPtr(impl->hwnd, GWL_USERDATA, (LONG)view);\n\n\timpl->hdc = GetDC(impl->hwnd);\n\n\tPIXELFORMATDESCRIPTOR pfd;\n\tZeroMemory(&pfd, sizeof(pfd));\n\tpfd.nSize = sizeof(pfd);\n\tpfd.nVersion = 1;\n\tpfd.dwFlags = PFD_DRAW_TO_WINDOW | PFD_SUPPORT_OPENGL | PFD_DOUBLEBUFFER;\n\tpfd.iPixelType = PFD_TYPE_RGBA;\n\tpfd.cColorBits = 24;\n\tpfd.cDepthBits = 16;\n\tpfd.iLayerType = PFD_MAIN_PLANE;\n\n\tint format = ChoosePixelFormat(impl->hdc, &pfd);\n\tSetPixelFormat(impl->hdc, format, &pfd);\n\n\timpl->hglrc = wglCreateContext(impl->hdc);\n\twglMakeCurrent(impl->hdc, impl->hglrc);\n\n\tview->width = width;\n\tview->height = height;\n\n\treturn view;\n}\n\nvoid\npuglDestroy(PuglView* view)\n{\n\twglMakeCurrent(NULL, NULL);\n\twglDeleteContext(view->impl->hglrc);\n\tReleaseDC(view->impl->hwnd, view->impl->hdc);\n\tDestroyWindow(view->impl->hwnd);\n\tUnregisterClass(view->impl->wc.lpszClassName, NULL);\n\tfree(view->impl);\n\tfree(view);\n}\n\nstatic void\npuglReshape(PuglView* view, int width, int height)\n{\n\twglMakeCurrent(view->impl->hdc, view->impl->hglrc);\n\n\tif (view->reshapeFunc) {\n\t\tview->reshapeFunc(view, width, height);\n\t} else {\n\t\tpuglDefaultReshape(view, width, height);\n\t}\n\n\tview->width = width;\n\tview->height = height;\n}\n\nvoid\npuglDisplay(PuglView* view)\n{\n\twglMakeCurrent(view->impl->hdc, view->impl->hglrc);\n\tglClear(GL_COLOR_BUFFER_BIT | GL_DEPTH_BUFFER_BIT);\n\tglLoadIdentity();\n\n\tif (view->displayFunc) {\n\t\tview->displayFunc(view);\n\t}\n\n\tglFlush();\n\tSwapBuffers(view->impl->hdc);\n\tview->redisplay = false;\n}\n\nstatic PuglKey\nkeySymToSpecial(int sym)\n{\n\tswitch (sym) {\n\tcase VK_F1: return PUGL_KEY_F1;\n\tcase VK_F2: return PUGL_KEY_F2;\n\tcase VK_F3: return PUGL_KEY_F3;\n\tcase VK_F4: return PUGL_KEY_F4;\n\tcase VK_F5: return PUGL_KEY_F5;\n\tcase VK_F6: return PUGL_KEY_F6;\n\tcase VK_F7: return PUGL_KEY_F7;\n\tcase VK_F8: return PUGL_KEY_F8;\n\tcase VK_F9: return PUGL_KEY_F9;\n\tcase VK_F10: return PUGL_KEY_F10;\n\tcase VK_F11: return PUGL_KEY_F11;\n\tcase VK_F12: return PUGL_KEY_F12;\n\tcase VK_LEFT: return PUGL_KEY_LEFT;\n\tcase VK_UP: return PUGL_KEY_UP;\n\tcase VK_RIGHT: return PUGL_KEY_RIGHT;\n\tcase VK_DOWN: return PUGL_KEY_DOWN;\n\tcase VK_PRIOR: return PUGL_KEY_PAGE_UP;\n\tcase VK_NEXT: return PUGL_KEY_PAGE_DOWN;\n\tcase VK_HOME: return PUGL_KEY_HOME;\n\tcase VK_END: return PUGL_KEY_END;\n\tcase VK_INSERT: return PUGL_KEY_INSERT;\n\tcase VK_SHIFT: return PUGL_KEY_SHIFT;\n\tcase VK_CONTROL: return PUGL_KEY_CTRL;\n\tcase VK_MENU: return PUGL_KEY_ALT;\n\tcase VK_LWIN: return PUGL_KEY_SUPER;\n\tcase VK_RWIN: return PUGL_KEY_SUPER;\n\t}\n\treturn (PuglKey)0;\n}\n\nstatic void\nprocessMouseEvent(PuglView* view, int button, bool press, LPARAM lParam)\n{\n\tview->event_timestamp_ms = GetMessageTime();\n\tif (press) {\n\t\tSetCapture(view->impl->hwnd);\n\t} else {\n\t\tReleaseCapture();\n\t}\n\n\tif (view->mouseFunc) {\n\t\tview->mouseFunc(view, button, press,\n\t\t GET_X_LPARAM(lParam),\n\t\t GET_Y_LPARAM(lParam));\n\t}\n}\n\nstatic void\nsetModifiers(PuglView* view)\n{\n\tview->mods = 0;\n\tview->mods |= (GetKeyState(VK_SHIFT) < 0) ? PUGL_MOD_SHIFT : 0;\n\tview->mods |= (GetKeyState(VK_CONTROL) < 0) ? PUGL_MOD_CTRL : 0;\n\tview->mods |= (GetKeyState(VK_MENU) < 0) ? PUGL_MOD_ALT : 0;\n\tview->mods |= (GetKeyState(VK_LWIN) < 0) ? PUGL_MOD_SUPER : 0;\n\tview->mods |= (GetKeyState(VK_RWIN) < 0) ? PUGL_MOD_SUPER : 0;\n}\n\nstatic LRESULT\nhandleMessage(PuglView* view, UINT message, WPARAM wParam, LPARAM lParam)\n{\n\tPAINTSTRUCT ps;\n\tPuglKey key;\n\n\tsetModifiers(view);\n\tswitch (message) {\n\tcase WM_CREATE:\n\tcase WM_SHOWWINDOW:\n\tcase WM_SIZE:\n\t\tRECT rect;\n\t\tGetClientRect(view->impl->hwnd, &rect);\n\t\tpuglReshape(view, rect.right, rect.bottom);\n\t\tview->width = rect.right;\n\t\tview->height = rect.bottom;\n\t\tbreak;\n\tcase WM_PAINT:\n\t\tBeginPaint(view->impl->hwnd, &ps);\n\t\tpuglDisplay(view);\n\t\tEndPaint(view->impl->hwnd, &ps);\n\t\tbreak;\n\tcase WM_MOUSEMOVE:\n\t\tif (view->motionFunc) {\n\t\t\tview->motionFunc(view, GET_X_LPARAM(lParam), GET_Y_LPARAM(lParam));\n\t\t}\n\t\tbreak;\n\tcase WM_LBUTTONDOWN:\n\t\tprocessMouseEvent(view, 1, true, lParam);\n\t\tbreak;\n\tcase WM_MBUTTONDOWN:\n\t\tprocessMouseEvent(view, 2, true, lParam);\n\t\tbreak;\n\tcase WM_RBUTTONDOWN:\n\t\tprocessMouseEvent(view, 3, true, lParam);\n\t\tbreak;\n\tcase WM_LBUTTONUP:\n\t\tprocessMouseEvent(view, 1, false, lParam);\n\t\tbreak;\n\tcase WM_MBUTTONUP:\n\t\tprocessMouseEvent(view, 2, false, lParam);\n\t\tbreak;\n\tcase WM_RBUTTONUP:\n\t\tprocessMouseEvent(view, 3, false, lParam);\n\t\tbreak;\n\tcase WM_MOUSEWHEEL:\n\t\tif (view->scrollFunc) {\n\t\t\tview->scrollFunc(\n\t\t\t\tview, GET_X_LPARAM(lParam), GET_Y_LPARAM(lParam),\n\t\t\t\t(int16_t)HIWORD(wParam) \/ (float)WHEEL_DELTA);\n\t\t}\n\t\tbreak;\n\tcase WM_MOUSEHWHEEL:\n\t\tif (view->scrollFunc) {\n\t\t\tview->scrollFunc(\n\t\t\t\tview, GET_X_LPARAM(lParam), GET_Y_LPARAM(lParam),\n\t\t\t\t(int16_t)HIWORD(wParam) \/ float(WHEEL_DELTA), 0);\n\t\t}\n\t\tbreak;\n\tcase WM_KEYDOWN:\n\t\tview->event_timestamp_ms = (GetMessageTime());\n\t\tif (view->ignoreKeyRepeat && (lParam & (1 << 30))) {\n\t\t\tbreak;\n\t\t} \/\/ else nobreak\n\tcase WM_KEYUP:\n\t\tif ((key = keySymToSpecial(wParam))) {\n\t\t\tif (view->specialFunc) {\n\t\t\t\tview->specialFunc(view, message == WM_KEYDOWN, key);\n\t\t\t}\n\t\t} else if (view->keyboardFunc) {\n\t\t\tview->keyboardFunc(view, message == WM_KEYDOWN, wParam);\n\t\t}\n\t\tbreak;\n\tcase WM_QUIT:\n\tcase LOCAL_CLOSE_MSG:\n\t\tif (view->closeFunc) {\n\t\t\tview->closeFunc(view);\n\t\t}\n\t\tbreak;\n\tdefault:\n\t\treturn DefWindowProc(\n\t\t\tview->impl->hwnd, message, wParam, lParam);\n\t}\n\n\treturn 0;\n}\n\nPuglStatus\npuglProcessEvents(PuglView* view)\n{\n\tMSG msg;\n\twhile (PeekMessage(&msg, view->impl->hwnd, 0, 0, PM_REMOVE)) {\n\t\thandleMessage(view, msg.message, msg.wParam, msg.lParam);\n\t}\n\n\n\tif (view->redisplay) {\n\t\tInvalidateRect(view->impl->hwnd, NULL, FALSE);\n\t}\n\n\treturn PUGL_SUCCESS;\n}\n\nLRESULT CALLBACK\nwndProc(HWND hwnd, UINT message, WPARAM wParam, LPARAM lParam)\n{\n\tPuglView* view = (PuglView*)GetWindowLongPtr(hwnd, GWL_USERDATA);\n\tswitch (message) {\n\tcase WM_CREATE:\n\t\tPostMessage(hwnd, WM_SHOWWINDOW, TRUE, 0);\n\t\treturn 0;\n\tcase WM_CLOSE:\n\t\tPostMessage(hwnd, LOCAL_CLOSE_MSG, wParam, lParam);\n\t\treturn 0;\n\tcase WM_DESTROY:\n\t\treturn 0;\n\tdefault:\n\t\tif (view) {\n\t\t\treturn handleMessage(view, message, wParam, lParam);\n\t\t} else {\n\t\t\treturn DefWindowProc(hwnd, message, wParam, lParam);\n\t\t}\n\t}\n}\n\nvoid\npuglPostRedisplay(PuglView* view)\n{\n\tview->redisplay = true;\n}\n\nPuglNativeWindow\npuglGetNativeWindow(PuglView* view)\n{\n\treturn (PuglNativeWindow)view->impl->hwnd;\n}\n<|endoftext|>"} {"text":"<commit_before>#include <bson.h>\n#include <stdio.h>\n#include \"hphp\/runtime\/base\/base-includes.h\"\n\nnamespace HPHP {\n\nstatic bool\ncbson_loads_visit_int64 (const bson_iter_t *iter,\n const char* key,\n int64_t v_int64,\n Array *output)\n{\n output->add(String(key),v_int64);\n \n return false;\n}\n\nstatic bool\ncbson_loads_visit_bool (const bson_iter_t *iter,\n const char *key,\n bool v_bool,\n Array *output)\n{\n output->add(String(key), v_bool);\n return false;\n}\n\n\nstatic bool\ncbson_loads_visit_array (const bson_iter_t *iter,\n const char *key,\n const bson_t v_array,\n Array *output)\n{\n output->add(String(key), v_array)\n return false;\n}\n\nstatic bool\ncbson_loads_visit_double (const bson_iter_t *iter,\n const char *key,\n double v_double,\n Array *output)\n{\n output->add(String(key),v_double);\n return false;\n}\n\nstatic bool\ncbson_loads_visit_utf8 (const bson_iter_t *iter,\n const char *key,\n size_t v_utf8_len,\n const char *v_utf8,\n Array *output)\n{\n output->add(String(key),v_utf8); \n return false;\n}\n\n\nstatic const bson_visitor_t gLoadsVisitors = {\n .visit_double = cbson_loads_visit_double,\n .visit_utf8 = cbson_loads_visit_utf8,\n .visit_array = cbson_loads_visit_array,\n .visit_bool = cbson_loads_visit_bool,\n .visit_int64 = cbson_loads_visit_int64;\n};\n\nstatic Array * \ncbson_loads (bson_t * bson) \n{\n bson_reader_t * reader;\n const bson_t * b;\n bson_iter_t iter;\n bool eof;\n\n Array ret = Array();\n\n reader = bson_reader_new_from_data((uint8_t *)bson.c_str(), bson.size());\n\n if (!(b = bson_reader_read(reader, &eof))\n {\n std::cout << \"Buffer contained invalid BSON.\" << endl;\n return NULL;\n }\n\n do {\n if (!bson_iter_init(&iter, b))\n {\n bson_reader_destroy(reader);\n std::cout << \"Failed to initiate iterator.\" << endl;\n return NULL;\n }\n bson_iter_visit_all(&iter, &gLoadsVisitors, &ret); \n } while ((b = bson_reader_read(reader, &eof)));\n\n bson_reader_destroy(reader);\n\n if (!eof) {\n std::cout << \"Buffer contained invalid BSON.\" << endl;\n return NULL;\n }\n\n return ret;\n}\n}\n<commit_msg>Fixed missing parentheses<commit_after>#include <bson.h>\n#include <stdio.h>\n#include \"hphp\/runtime\/base\/base-includes.h\"\n\nnamespace HPHP {\n\nstatic bool\ncbson_loads_visit_int64 (const bson_iter_t *iter,\n const char* key,\n int64_t v_int64,\n Array *output)\n{\n output->add(String(key),v_int64);\n \n return false;\n}\n\nstatic bool\ncbson_loads_visit_bool (const bson_iter_t *iter,\n const char *key,\n bool v_bool,\n Array *output)\n{\n output->add(String(key), v_bool);\n return false;\n}\n\n\nstatic bool\ncbson_loads_visit_array (const bson_iter_t *iter,\n const char *key,\n const bson_t v_array,\n Array *output)\n{\n output->add(String(key), v_array)\n return false;\n}\n\nstatic bool\ncbson_loads_visit_double (const bson_iter_t *iter,\n const char *key,\n double v_double,\n Array *output)\n{\n output->add(String(key),v_double);\n return false;\n}\n\nstatic bool\ncbson_loads_visit_utf8 (const bson_iter_t *iter,\n const char *key,\n size_t v_utf8_len,\n const char *v_utf8,\n Array *output)\n{\n output->add(String(key),v_utf8); \n return false;\n}\n\n\nstatic const bson_visitor_t gLoadsVisitors = {\n .visit_double = cbson_loads_visit_double,\n .visit_utf8 = cbson_loads_visit_utf8,\n .visit_array = cbson_loads_visit_array,\n .visit_bool = cbson_loads_visit_bool,\n .visit_int64 = cbson_loads_visit_int64;\n};\n\nstatic Array * \ncbson_loads (bson_t * bson) \n{\n bson_reader_t * reader;\n const bson_t * b;\n bson_iter_t iter;\n bool eof;\n\n Array ret = Array();\n\n reader = bson_reader_new_from_data((uint8_t *)bson.c_str(), bson.size());\n\n if (!(b = bson_reader_read(reader, &eof)))\n {\n std::cout << \"Buffer contained invalid BSON.\" << endl;\n return NULL;\n }\n\n do {\n if (!bson_iter_init(&iter, b))\n {\n bson_reader_destroy(reader);\n std::cout << \"Failed to initiate iterator.\" << endl;\n return NULL;\n }\n bson_iter_visit_all(&iter, &gLoadsVisitors, &ret); \n } while ((b = bson_reader_read(reader, &eof)));\n\n bson_reader_destroy(reader);\n\n if (!eof) {\n std::cout << \"Buffer contained invalid BSON.\" << endl;\n return NULL;\n }\n\n return ret;\n}\n}\n<|endoftext|>"} {"text":"<commit_before>\/*!\n * \\file rect_atlas.cpp\n * \\brief file rect_atlas.cpp\n *\n * Adapted from: WRATHAtlasBase.cpp and WRATHAtlas.cpp of WRATH:\n *\n * Copyright 2013 by Nomovok Ltd.\n * Contact: info@nomovok.com\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@nomovok.com>\n * \\author Kevin Rogovin <kevin.rogovin@intel.com>\n *\n *\/\n\n#include <algorithm>\n#include <ciso646>\n\n#include \"rect_atlas.hpp\"\n\n\nnamespace\n{\n enum tree_size_t\n {\n num_rects,\n num_with_children,\n num_without_children,\n\n tree_size_count\n };\n\n typedef fastuidraw::vecN<int, tree_size_count> TreeSizeCount;\n\n \/*\n * Tree structure to construct the texture atlas,\n * basic idea is very simple: walk the tree until one finds\n * a node where the image can fit.\n *\n * if .second is routine_fail, then the routine\n * failed.\n *\n * If .first of the return value of add or remove\n * is not the same as the object, then the return value\n * represents a new child and the old object should be deleted.\n *\n * if .first of the return value of add or remove\n * is the same as the object, then the routine succeeded\n * and the object should not be deleted.\n *\/\n class tree_base\n {\n public:\n typedef fastuidraw::detail::RectAtlas::rectangle rectangle;\n typedef fastuidraw::ivec2 ivec2;\n typedef fastuidraw::detail::SimplePool<4096> SimplePool;\n\n tree_base(const ivec2 &bl, const ivec2 &sz):\n m_minX_minY(bl), m_size(sz),\n m_free_area(m_size.x() * m_size.y())\n {}\n\n const ivec2&\n size(void) const\n {\n return m_size;\n }\n\n int\n free_area(void) const\n {\n return m_free_area;\n }\n\n int\n area(void) const\n {\n return m_size.x() * m_size.y();\n }\n\n const ivec2&\n minX_minY(void) const\n {\n return m_minX_minY;\n }\n\n virtual\n TreeSizeCount\n count(void) const = 0;\n\n tree_base*\n add(SimplePool &pool, rectangle *rect);\n\n private:\n \/*\n * A return value of nullptr indicates failure;\n * a return value of non-null but different, means\n * change pointer to callee.\n *\/\n virtual\n tree_base*\n add_implement(SimplePool&, rectangle*) = 0;\n\n ivec2 m_minX_minY, m_size;\n int m_free_area;\n };\n\n \/* a tree_node_without_children represents\n * a Node which has NO child Node's\n * but may or maynot have a rectangle.\n *\/\n class tree_node_without_children:public tree_base\n {\n public:\n tree_node_without_children(const ivec2 &bl, const ivec2 &sz,\n rectangle *rect = nullptr);\n\n rectangle*\n data(void);\n\n virtual\n TreeSizeCount\n count(void) const\n {\n TreeSizeCount return_value;\n\n return_value[num_rects] = (m_rectangle) ? 1u : 0u;\n return_value[num_with_children] = 0;\n return_value[num_without_children] = 1;\n\n return return_value;\n }\n\n private:\n virtual\n tree_base*\n add_implement (SimplePool&, rectangle*);\n\n rectangle *m_rectangle;\n };\n\n \/* a tree node with children has _3_ children.\n * they are spawned when a tree_node_wihout_children\n * has a rectangle added but it already has a rectangle.\n *\/\n class tree_node_with_children:public tree_base\n {\n public:\n tree_node_with_children(SimplePool &pool,\n tree_node_without_children *src,\n bool split_x, bool split_y);\n\n virtual\n TreeSizeCount\n count(void) const\n {\n TreeSizeCount return_value;\n\n return_value[num_rects] = 0u;\n return_value[num_with_children] = 1;\n return_value[num_without_children] = 0;\n\n return return_value\n + m_children[0]->count()\n + m_children[1]->count()\n + m_children[2]->count();\n }\n\n private:\n virtual\n tree_base*\n add_implement (SimplePool&, rectangle*);\n\n fastuidraw::vecN<tree_base*, 3> m_children;\n };\n\n class tree_sorter\n {\n public:\n bool\n operator()(tree_base *lhs, tree_base *rhs) const\n {\n \/* we want to list the smallest \"size\" first\n * to avoid splitting large elements\n *\/\n return lhs->area() < rhs->area();\n }\n };\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ tree_base methods\ntree_base*\ntree_base::\nadd(SimplePool &pool, rectangle *rect)\n{\n \/* We are doing a very, very simple quick rejection\n * test where we reject any rectangle which has\n * area larger than this's area() or if any of the\n * dimensions are greater than this's size. This\n * is far from ideal, and the correct thing would be\n * to create bins (perhaps keyed by log2) in each\n * dimension to quickly choose a node to split.\n * This would prevent the tree walk entirely and\n * then the root would need a list of nodes\n * available and the ability to remove elements\n * from the lists fast (perhaps std::map<K, std::list>)\n * would work. Only the creation of objects of\n * type tree_node_without_children would modify the\n * list, as would their deconsuction.\n *\/\n FASTUIDRAWassert(m_free_area >= 0);\n if (rect->area() <= m_free_area\n && rect->size().x() <= m_size.x()\n && rect->size().y() <= m_size.y())\n {\n tree_base *return_value;\n return_value = add_implement(pool, rect);\n if (return_value)\n {\n m_free_area -= rect->area();\n }\n\n return return_value;\n }\n else\n {\n return nullptr;\n }\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ tree_node_without_children methods\ntree_node_without_children::\ntree_node_without_children(const ivec2 &bl, const ivec2 &sz,\n rectangle *rect):\n tree_base(bl, sz),\n m_rectangle(rect)\n{\n}\n\ntree_base::rectangle*\ntree_node_without_children::\ndata(void)\n{\n return m_rectangle;\n}\n\ntree_base*\ntree_node_without_children::\nadd_implement(SimplePool &pool, rectangle *im)\n{\n FASTUIDRAWassert(im->size().x() <= size().x());\n FASTUIDRAWassert(im->size().y() <= size().y());\n\n if (m_rectangle == nullptr)\n {\n \/\/do not have a rect so we take it (and move it).\n m_rectangle = im;\n m_rectangle->move(minX_minY());\n\n return this;\n }\n\n \/\/we have a rectangle already, we need to check\n \/\/if we can split in such a way to take im:\n int dx, dy;\n bool split_y_works, split_x_works;\n\n dx = size().x() - m_rectangle->size().x();\n dy = size().y() - m_rectangle->size().y();\n\n split_y_works = (dy >= im->size().y());\n split_x_works = (dx >= im->size().x());\n\n if (!split_x_works && !split_y_works)\n {\n return nullptr;\n }\n\n if (split_x_works && split_y_works)\n {\n \/\/choose a split that is nicest\n \/\/by making the other split false.\n\n \/\/whoever has the most room left over is the split.\n if (dx > dy)\n {\n split_y_works = false;\n }\n else\n {\n split_x_works = false;\n }\n }\n\n tree_base *new_node;\n\n \/\/new_node will hold this->m_rectange:\n new_node = pool.create<tree_node_with_children>(pool, this, split_x_works, split_y_works);\n\n \/\/add the new rectangle im to new_node:\n new_node = new_node->add(pool, im);\n FASTUIDRAWassert(new_node);\n\n return new_node;\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ tree_node_with_children methods\ntree_node_with_children::\ntree_node_with_children(SimplePool &pool,\n tree_node_without_children *src,\n bool split_x_works, bool split_y_works):\n tree_base(src->minX_minY(), src->size()),\n m_children(nullptr, nullptr, nullptr)\n{\n rectangle *R(src->data());\n FASTUIDRAWassert(R != nullptr);\n\n m_children[2] = pool.create<tree_node_without_children>(R->minX_minY(), R->size(), R);\n\n \/* Perhaps we should consider delaying creating m_children[0] and m_children[1]\n * until the first request come to this to add a rectangle so that we can\n * possibly take a bigger rectangle.\n *\/\n if (split_x_works)\n {\n m_children[0]\n = pool.create<tree_node_without_children>(ivec2(minX_minY().x(), minX_minY().y() + R->size().y()),\n ivec2(R->size().x(), size().y() - R->size().y()) );\n\n m_children[1]\n = pool.create<tree_node_without_children>(ivec2(minX_minY().x() + R->size().x(), minX_minY().y()),\n ivec2(size().x() - R->size().x(), size().y()) );\n }\n else\n {\n FASTUIDRAWassert(split_y_works);\n FASTUIDRAWunused(split_y_works);\n\n m_children[0]\n = pool.create<tree_node_without_children>(ivec2(minX_minY().x() + R->size().x(), minX_minY().y()),\n ivec2(size().x() - R->size().x(), R->size().y()) );\n\n m_children[1]\n = pool.create<tree_node_without_children>(ivec2(minX_minY().x(), minX_minY().y() + R->size().y()),\n ivec2(size().x(), size().y() - R->size().y()) );\n }\n\n std::sort(m_children.begin(), m_children.end(), tree_sorter());\n}\n\ntree_base*\ntree_node_with_children::\nadd_implement(SimplePool &pool, rectangle *im)\n{\n tree_base *R;\n for(int i = 0; i < 3; ++i)\n {\n R = m_children[i]->add(pool, im);\n if (R)\n {\n m_children[i] = R;\n return this;\n }\n }\n\n return nullptr;\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ fastuidraw::detail::RectAtlas methods\nfastuidraw::detail::RectAtlas::\nRectAtlas(const ivec2 &dimensions):\n m_empty_rect(ivec2(0, 0))\n{\n m_data = m_pool.create<tree_node_without_children>(ivec2(0,0), dimensions, nullptr);\n}\n\nfastuidraw::detail::RectAtlas::\n~RectAtlas()\n{\n}\n\nfastuidraw::ivec2\nfastuidraw::detail::RectAtlas::\nsize(void) const\n{\n tree_base *root;\n root = static_cast<tree_base*>(m_data);\n FASTUIDRAWassert(root != nullptr);\n return root->size();\n}\n\nvoid\nfastuidraw::detail::RectAtlas::\nclear(void)\n{\n ivec2 dimensions(size());\n\n tree_base *root;\n root = static_cast<tree_base*>(m_data);\n\n \/**\n std::cout << \"Clear: \" << root->count()\n << \", free_area = \" << root->free_area()\n << \"(\" << 100.0f * static_cast<float>(root->free_area()) \/ static_cast<float>(root->area()) << \"%)\"\n << \"\\n\";\n \/**\/\n\n m_pool.clear();\n m_data = m_pool.create<tree_node_without_children>(ivec2(0,0), dimensions, nullptr);\n}\n\nconst fastuidraw::detail::RectAtlas::rectangle*\nfastuidraw::detail::RectAtlas::\nadd_rectangle(const ivec2 &dimensions)\n{\n rectangle *return_value(nullptr);\n tree_base *root, *R;\n\n root = static_cast<tree_base*>(m_data);\n if (dimensions.x() > 0 && dimensions.y() > 0)\n {\n \/\/attempt to add the rect:\n return_value = m_pool.create<rectangle>(dimensions);\n R = root->add(m_pool, return_value);\n\n if (R)\n {\n root = R;\n }\n else\n {\n return_value = nullptr;\n }\n }\n else\n {\n return_value = &m_empty_rect;\n }\n\n m_data = root;\n return return_value;\n}\n<commit_msg>fastuidraw\/private\/rect_atlas: improve performance<commit_after>\/*!\n * \\file rect_atlas.cpp\n * \\brief file rect_atlas.cpp\n *\n * Adapted from: WRATHAtlasBase.cpp and WRATHAtlas.cpp of WRATH:\n *\n * Copyright 2013 by Nomovok Ltd.\n * Contact: info@nomovok.com\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@nomovok.com>\n * \\author Kevin Rogovin <kevin.rogovin@intel.com>\n *\n *\/\n\n#include <algorithm>\n#include <ciso646>\n\n#include \"rect_atlas.hpp\"\n\n\nnamespace\n{\n enum tree_size_t\n {\n num_rects,\n num_with_children,\n num_without_children,\n\n tree_size_count\n };\n\n class tree_node_without_children;\n typedef fastuidraw::vecN<int, tree_size_count> TreeSizeCount;\n\n \/*\n * Tree structure to construct the texture atlas,\n * basic idea is very simple: walk the tree until one finds\n * a node where the image can fit.\n *\n * if .second is routine_fail, then the routine\n * failed.\n *\n * If .first of the return value of add or remove\n * is not the same as the object, then the return value\n * represents a new child and the old object should be deleted.\n *\n * if .first of the return value of add or remove\n * is the same as the object, then the routine succeeded\n * and the object should not be deleted.\n *\/\n class tree_base\n {\n public:\n typedef fastuidraw::detail::RectAtlas::rectangle rectangle;\n typedef fastuidraw::ivec2 ivec2;\n typedef fastuidraw::detail::SimplePool<4096> SimplePool;\n\n tree_base(const ivec2 &bl, const ivec2 &sz):\n m_minX_minY(bl), m_size(sz)\n {}\n\n const ivec2&\n size(void) const\n {\n return m_size;\n }\n\n int\n area(void) const\n {\n return m_size.x() * m_size.y();\n }\n\n const ivec2&\n minX_minY(void) const\n {\n return m_minX_minY;\n }\n\n tree_node_without_children*\n widest_possible_rectangle(void) { return m_widest; }\n\n tree_node_without_children*\n tallest_possible_rectangle(void) { return m_tallest; }\n\n tree_node_without_children*\n biggest_possible_rectangle(void) { return m_biggest; }\n\n virtual\n TreeSizeCount\n count(void) const = 0;\n\n tree_base*\n add(SimplePool &pool, rectangle *rect);\n\n protected:\n tree_node_without_children *m_widest, *m_tallest, *m_biggest;\n\n private:\n \/*\n * A return value of nullptr indicates failure;\n * a return value of non-null but different, means\n * change pointer to callee.\n *\/\n virtual\n tree_base*\n add_implement(SimplePool&, rectangle*) = 0;\n\n ivec2 m_minX_minY, m_size;\n };\n\n \/* a tree_node_without_children represents\n * a Node which has NO child Node's\n * but may or maynot have a rectangle.\n *\/\n class tree_node_without_children:public tree_base\n {\n public:\n tree_node_without_children(const ivec2 &bl, const ivec2 &sz,\n rectangle *rect = nullptr);\n\n rectangle*\n data(void);\n\n int\n widest_possible(void) const\n {\n return size().x();\n }\n\n int\n tallest_possible(void) const\n {\n return size().y();\n }\n\n int\n biggest_possible(void) const\n {\n int A(area());\n\n return m_rectangle ?\n A - m_rectangle->area() :\n A;\n }\n\n virtual\n TreeSizeCount\n count(void) const\n {\n TreeSizeCount return_value;\n\n return_value[num_rects] = (m_rectangle) ? 1u : 0u;\n return_value[num_with_children] = 0;\n return_value[num_without_children] = 1;\n\n return return_value;\n }\n\n private:\n virtual\n tree_base*\n add_implement(SimplePool&, rectangle*);\n\n rectangle *m_rectangle;\n };\n\n \/* a tree node with children has _3_ children.\n * they are spawned when a tree_node_wihout_children\n * has a rectangle added but it already has a rectangle.\n *\/\n class tree_node_with_children:public tree_base\n {\n public:\n tree_node_with_children(SimplePool &pool,\n tree_node_without_children *src,\n bool split_x, bool split_y);\n\n virtual\n TreeSizeCount\n count(void) const\n {\n TreeSizeCount return_value;\n\n return_value[num_rects] = 0u;\n return_value[num_with_children] = 1;\n return_value[num_without_children] = 0;\n\n return return_value\n + m_children[0]->count()\n + m_children[1]->count()\n + m_children[2]->count();\n }\n\n private:\n virtual\n tree_base*\n add_implement(SimplePool&, rectangle*);\n\n void\n recompute_possible(void);\n\n fastuidraw::vecN<tree_base*, 3> m_children;\n };\n\n class tree_sorter\n {\n public:\n bool\n operator()(tree_base *lhs, tree_base *rhs) const\n {\n \/* we want to list the smallest \"size\" first\n * to avoid splitting large elements\n *\/\n return lhs->area() < rhs->area();\n }\n };\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ tree_base methods\ntree_base*\ntree_base::\nadd(SimplePool &pool, rectangle *rect)\n{\n \/* We are doing a very, very simple quick rejection\n * test where we reject any rectangle which has\n * area larger than this's area() or if any of the\n * dimensions are greater than this's size. This\n * is far from ideal, and the correct thing would be\n * to create bins (perhaps keyed by log2) in each\n * dimension to quickly choose a node to split.\n * This would prevent the tree walk entirely and\n * then the root would need a list of nodes\n * available and the ability to remove elements\n * from the lists fast (perhaps std::map<K, std::list>)\n * would work. Only the creation of objects of\n * type tree_node_without_children would modify the\n * list, as would their deconsuction.\n *\/\n if (rect->area() <= biggest_possible_rectangle()->biggest_possible()\n && rect->size().x() <= widest_possible_rectangle()->widest_possible()\n && rect->size().y() <= tallest_possible_rectangle()->tallest_possible())\n {\n tree_base *return_value;\n\n return_value = add_implement(pool, rect);\n return return_value;\n }\n else\n {\n return nullptr;\n }\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ tree_node_without_children methods\ntree_node_without_children::\ntree_node_without_children(const ivec2 &bl, const ivec2 &sz,\n rectangle *rect):\n tree_base(bl, sz),\n m_rectangle(rect)\n{\n m_widest = m_tallest = m_biggest = this;\n}\n\ntree_base::rectangle*\ntree_node_without_children::\ndata(void)\n{\n return m_rectangle;\n}\n\ntree_base*\ntree_node_without_children::\nadd_implement(SimplePool &pool, rectangle *im)\n{\n FASTUIDRAWassert(im->size().x() <= size().x());\n FASTUIDRAWassert(im->size().y() <= size().y());\n\n if (m_rectangle == nullptr)\n {\n \/\/do not have a rect so we take it (and move it).\n m_rectangle = im;\n m_rectangle->move(minX_minY());\n\n return this;\n }\n\n \/\/we have a rectangle already, we need to check\n \/\/if we can split in such a way to take im:\n int dx, dy;\n bool split_y_works, split_x_works;\n\n dx = size().x() - m_rectangle->size().x();\n dy = size().y() - m_rectangle->size().y();\n\n split_y_works = (dy >= im->size().y());\n split_x_works = (dx >= im->size().x());\n\n if (!split_x_works && !split_y_works)\n {\n return nullptr;\n }\n\n if (split_x_works && split_y_works)\n {\n \/\/choose a split that is nicest\n \/\/by making the other split false.\n\n \/\/whoever has the most room left over is the split.\n if (dx > dy)\n {\n split_y_works = false;\n }\n else\n {\n split_x_works = false;\n }\n }\n\n tree_base *new_node;\n\n \/\/new_node will hold this->m_rectange:\n new_node = pool.create<tree_node_with_children>(pool, this, split_x_works, split_y_works);\n\n \/\/add the new rectangle im to new_node:\n new_node = new_node->add(pool, im);\n FASTUIDRAWassert(new_node);\n\n return new_node;\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ tree_node_with_children methods\ntree_node_with_children::\ntree_node_with_children(SimplePool &pool,\n tree_node_without_children *src,\n bool split_x_works, bool split_y_works):\n tree_base(src->minX_minY(), src->size()),\n m_children(nullptr, nullptr, nullptr)\n{\n rectangle *R(src->data());\n FASTUIDRAWassert(R != nullptr);\n\n m_children[2] = pool.create<tree_node_without_children>(R->minX_minY(), R->size(), R);\n\n \/* Perhaps we should consider delaying creating m_children[0] and m_children[1]\n * until the first request come to this to add a rectangle so that we can\n * possibly take a bigger rectangle.\n *\/\n if (split_x_works)\n {\n m_children[0]\n = pool.create<tree_node_without_children>(ivec2(minX_minY().x(), minX_minY().y() + R->size().y()),\n ivec2(R->size().x(), size().y() - R->size().y()) );\n\n m_children[1]\n = pool.create<tree_node_without_children>(ivec2(minX_minY().x() + R->size().x(), minX_minY().y()),\n ivec2(size().x() - R->size().x(), size().y()) );\n }\n else\n {\n FASTUIDRAWassert(split_y_works);\n FASTUIDRAWunused(split_y_works);\n\n m_children[0]\n = pool.create<tree_node_without_children>(ivec2(minX_minY().x() + R->size().x(), minX_minY().y()),\n ivec2(size().x() - R->size().x(), R->size().y()) );\n\n m_children[1]\n = pool.create<tree_node_without_children>(ivec2(minX_minY().x(), minX_minY().y() + R->size().y()),\n ivec2(size().x(), size().y() - R->size().y()) );\n }\n\n std::sort(m_children.begin(), m_children.end(), tree_sorter());\n recompute_possible();\n}\n\ntree_base*\ntree_node_with_children::\nadd_implement(SimplePool &pool, rectangle *im)\n{\n tree_base *R;\n for(int i = 0; i < 3; ++i)\n {\n R = m_children[i]->add(pool, im);\n if (R)\n {\n m_children[i] = R;\n recompute_possible();\n return this;\n }\n }\n\n return nullptr;\n}\n\nvoid\ntree_node_with_children::\nrecompute_possible(void)\n{\n m_widest = m_children[0]->widest_possible_rectangle();\n m_tallest = m_children[0]->tallest_possible_rectangle();\n m_biggest = m_children[0]->biggest_possible_rectangle();\n\n for (int i = 1; i < 3; ++i)\n {\n tree_node_without_children *p;\n\n p = m_children[i]->widest_possible_rectangle();\n if (p->widest_possible() > m_widest->widest_possible())\n {\n m_widest = p;\n }\n\n p = m_children[i]->tallest_possible_rectangle();\n if (p->tallest_possible() > m_tallest->tallest_possible())\n {\n m_tallest = p;\n }\n\n p = m_children[i]->biggest_possible_rectangle();\n if (p->biggest_possible() > m_biggest->biggest_possible())\n {\n m_biggest = p;\n }\n }\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ fastuidraw::detail::RectAtlas methods\nfastuidraw::detail::RectAtlas::\nRectAtlas(const ivec2 &dimensions):\n m_empty_rect(ivec2(0, 0))\n{\n m_data = m_pool.create<tree_node_without_children>(ivec2(0,0), dimensions, nullptr);\n}\n\nfastuidraw::detail::RectAtlas::\n~RectAtlas()\n{\n}\n\nfastuidraw::ivec2\nfastuidraw::detail::RectAtlas::\nsize(void) const\n{\n tree_base *root;\n root = static_cast<tree_base*>(m_data);\n FASTUIDRAWassert(root != nullptr);\n return root->size();\n}\n\nvoid\nfastuidraw::detail::RectAtlas::\nclear(void)\n{\n ivec2 dimensions(size());\n\n tree_base *root;\n root = static_cast<tree_base*>(m_data);\n\n \/**\n std::cout << \"Clear: \" << root->count()\n << \", free_area = \" << root->free_area()\n << \"(\" << 100.0f * static_cast<float>(root->free_area()) \/ static_cast<float>(root->area()) << \"%)\"\n << \"\\n\";\n \/**\/\n\n m_pool.clear();\n m_data = m_pool.create<tree_node_without_children>(ivec2(0,0), dimensions, nullptr);\n}\n\nconst fastuidraw::detail::RectAtlas::rectangle*\nfastuidraw::detail::RectAtlas::\nadd_rectangle(const ivec2 &dimensions)\n{\n rectangle *return_value(nullptr);\n tree_base *root, *R;\n\n root = static_cast<tree_base*>(m_data);\n if (dimensions.x() > 0 && dimensions.y() > 0)\n {\n \/\/attempt to add the rect:\n return_value = m_pool.create<rectangle>(dimensions);\n R = root->add(m_pool, return_value);\n\n if (R)\n {\n root = R;\n }\n else\n {\n return_value = nullptr;\n }\n }\n else\n {\n return_value = &m_empty_rect;\n }\n\n m_data = root;\n return return_value;\n}\n<|endoftext|>"} {"text":"<commit_before>\/\/ Copyright 2008 Paul Hodge\n\n#include <iostream>\n#include <fstream>\n\n#include \"common_headers.h\"\n\n#include \"ast.h\"\n#include \"branch.h\"\n#include \"builtins.h\"\n#include \"builtin_types.h\"\n#include \"cpp_interface.h\"\n#include \"function.h\"\n#include \"importing.h\"\n#include \"list.h\"\n#include \"parser.h\"\n#include \"runtime.h\"\n#include \"term.h\"\n#include \"token_stream.h\"\n#include \"type.h\"\n#include \"values.h\"\n#include \"setup_builtin_functions.h\"\n\n\nnamespace circa {\n\nBranch* KERNEL = NULL;\nTerm* VAR_FUNCTION_GENERATOR = NULL;\nTerm* VAR_FUNCTION_FEEDBACK_ASSIGN = NULL;\nTerm* INT_TYPE = NULL;\nTerm* FLOAT_TYPE = NULL;\nTerm* BOOL_TYPE = NULL;\nTerm* STRING_TYPE = NULL;\nTerm* TYPE_TYPE = NULL;\nTerm* FUNCTION_TYPE = NULL;\nTerm* CODEUNIT_TYPE = NULL;\nTerm* BRANCH_TYPE = NULL;\nTerm* ANY_TYPE = NULL;\nTerm* VOID_TYPE = NULL;\nTerm* REFERENCE_TYPE = NULL;\nTerm* LIST_TYPE = NULL;\nTerm* MAP_TYPE = NULL;\nTerm* VAR_INT = NULL;\nTerm* VAR_FLOAT = NULL;\nTerm* VAR_STRING = NULL;\nTerm* VAR_BOOL = NULL;\nTerm* CONSTANT_0 = NULL;\nTerm* CONSTANT_1 = NULL;\nTerm* CONSTANT_2 = NULL;\nTerm* CONSTANT_TRUE = NULL;\nTerm* CONSTANT_FALSE = NULL;\nTerm* UNKNOWN_FUNCTION = NULL;\nTerm* APPLY_FEEDBACK = NULL;\nTerm* ADD_FUNC = NULL;\nTerm* MULT_FUNC = NULL;\n\nvoid empty_evaluate_function(Term*) { }\nvoid empty_alloc_function(Term*) { }\n\nvoid var_function_generator(Term* caller)\n{\n assert(caller->input(0) != NULL);\n\n Function& output = as_function(caller);\n Type& type = as_type(caller->input(0));\n output.name = \"var-\" + type.name;\n output.outputType = caller->input(0);\n output.pureFunction = false;\n output.evaluate = empty_evaluate_function;\n output.feedbackPropogateFunction = VAR_FUNCTION_FEEDBACK_ASSIGN;\n}\n\nTerm* get_global(std::string name)\n{\n if (KERNEL->containsName(name))\n return KERNEL->getNamed(name);\n\n return NULL;\n}\n\nvoid bootstrap_kernel()\n{\n \/\/ This is a crazy function. We need to create the 5 core functions in our system,\n \/\/ all of which need to reference each other or themselves.\n \/\/\n \/\/ Here is what we need to create:\n \/\/\n \/\/ var-function-generator(Type) -> Function\n \/\/ Given a type, returns a function which is a 'plain value' function. This term\n \/\/ has function const-Function.\n \/\/ const-Type() -> Type\n \/\/ Function which returns a Type value. This is created by var-function-generator\n \/\/ const-Function() -> Function\n \/\/ Function which returns a Function value. This is created by var-function-generator.\n \/\/ Type Function\n \/\/ Stores the Type object for functions. This term has function const-Type\n \/\/ Type Type\n \/\/ Stores the Type object for types. This term has function const-Type\n\n KERNEL = new Branch();\n\n \/\/ Create var-function-generator function\n VAR_FUNCTION_GENERATOR = new Term();\n VAR_FUNCTION_GENERATOR->owningBranch = KERNEL;\n VAR_FUNCTION_GENERATOR->value = new Function();\n as_function(VAR_FUNCTION_GENERATOR).name = \"var-function-generator\";\n as_function(VAR_FUNCTION_GENERATOR).pureFunction = true;\n as_function(VAR_FUNCTION_GENERATOR).evaluate = var_function_generator;\n KERNEL->bindName(VAR_FUNCTION_GENERATOR, \"var-function-generator\");\n\n \/\/ Create const-Type function\n Term* constTypeFunc = new Term();\n constTypeFunc->owningBranch = KERNEL;\n constTypeFunc->function = VAR_FUNCTION_GENERATOR;\n constTypeFunc->value = new Function();\n as_function(constTypeFunc).name = \"const-Type\";\n as_function(constTypeFunc).pureFunction = true;\n\n \/\/ Create Type type\n TYPE_TYPE = new Term();\n TYPE_TYPE->owningBranch = KERNEL;\n TYPE_TYPE->function = constTypeFunc;\n TYPE_TYPE->type = TYPE_TYPE;\n initialize_type_type(TYPE_TYPE);\n as_type(TYPE_TYPE).remapPointers = Type::typeRemapPointers;\n as_type(TYPE_TYPE).visitPointers = Type::typeVisitPointers;\n KERNEL->bindName(TYPE_TYPE, \"Type\");\n\n \/\/ Implant the Type type\n set_input(constTypeFunc, 0, TYPE_TYPE);\n as_function(VAR_FUNCTION_GENERATOR).inputTypes.setAt(0, TYPE_TYPE);\n as_function(constTypeFunc).outputType = TYPE_TYPE;\n\n \/\/ Create const-Function function\n Term* constFuncFunc = new Term();\n constFuncFunc->owningBranch = KERNEL;\n constFuncFunc->function = VAR_FUNCTION_GENERATOR;\n constFuncFunc->value = new Function();\n as_function(constFuncFunc).name = \"const-Function\";\n as_function(constFuncFunc).pureFunction = true;\n KERNEL->bindName(constFuncFunc, \"const-Function\");\n\n \/\/ Implant const-Function\n VAR_FUNCTION_GENERATOR->function = constFuncFunc;\n\n \/\/ Create Function type\n FUNCTION_TYPE = new Term();\n FUNCTION_TYPE->owningBranch = KERNEL;\n FUNCTION_TYPE->function = constTypeFunc;\n FUNCTION_TYPE->type = TYPE_TYPE;\n FUNCTION_TYPE->value = alloc_from_type(TYPE_TYPE);\n as_type(FUNCTION_TYPE).name = \"Function\";\n as_type(FUNCTION_TYPE).alloc = cpp_interface::templated_alloc<Function>;\n as_type(FUNCTION_TYPE).duplicate = Function::duplicate;\n as_type(FUNCTION_TYPE).dealloc = cpp_interface::templated_dealloc<Function>;\n as_type(FUNCTION_TYPE).remapPointers = Function::remapPointers;\n as_type(FUNCTION_TYPE).visitPointers = Function::visitPointers;\n KERNEL->bindName(FUNCTION_TYPE, \"Function\");\n\n \/\/ Implant Function type\n set_input(VAR_FUNCTION_GENERATOR, 0, TYPE_TYPE);\n set_input(constFuncFunc, 0, FUNCTION_TYPE);\n VAR_FUNCTION_GENERATOR->type = FUNCTION_TYPE;\n constFuncFunc->type = FUNCTION_TYPE;\n constTypeFunc->type = FUNCTION_TYPE;\n as_function(VAR_FUNCTION_GENERATOR).outputType = FUNCTION_TYPE;\n as_function(constFuncFunc).outputType = FUNCTION_TYPE;\n\n \/\/ Don't let these terms get updated\n VAR_FUNCTION_GENERATOR->needsUpdate = false;\n constFuncFunc->needsUpdate = false;\n constTypeFunc->needsUpdate = false;\n FUNCTION_TYPE->needsUpdate = false;\n TYPE_TYPE->needsUpdate = false;\n}\n\nvoid unknown_function__evaluate(Term* caller)\n{\n std::cout << \"Warning, calling an unknown function: \"\n << as_string(caller->state) << std::endl;\n}\n\nnamespace var_function {\n\n void feedback_assign(Term* caller)\n {\n Term* target = caller->input(0);\n Term* desired = caller->input(1);\n\n duplicate_value(desired, target);\n }\n}\n\nvoid initialize_constants()\n{\n BRANCH_TYPE = quick_create_cpp_type<Branch>(*KERNEL, \"Branch\");\n as_type(BRANCH_TYPE).remapPointers = Branch::hosted_remap_pointers;\n as_type(BRANCH_TYPE).visitPointers = Branch::hosted_visit_pointers;\n\n LIST_TYPE = quick_create_cpp_type<List>(*KERNEL, \"List\");\n as_type(LIST_TYPE).toString = List__toString;\n\n quick_create_cpp_type<Dictionary>(*KERNEL, \"Dictionary\");\n\n VAR_INT = get_var_function(*KERNEL, INT_TYPE);\n VAR_FLOAT = get_var_function(*KERNEL, FLOAT_TYPE);\n VAR_STRING = get_var_function(*KERNEL, STRING_TYPE);\n VAR_BOOL = get_var_function(*KERNEL, BOOL_TYPE);\n\n CONSTANT_0 = float_var(*KERNEL, 0);\n CONSTANT_1 = float_var(*KERNEL, 1);\n CONSTANT_2 = float_var(*KERNEL, 2);\n\n CONSTANT_TRUE = apply_function(*KERNEL, BOOL_TYPE, ReferenceList());\n as_bool(CONSTANT_TRUE) = true;\n KERNEL->bindName(CONSTANT_TRUE, \"true\");\n CONSTANT_FALSE = apply_function(*KERNEL, BOOL_TYPE, ReferenceList());\n as_bool(CONSTANT_FALSE) = false;\n KERNEL->bindName(CONSTANT_FALSE, \"false\");\n\n Term* pi = apply_function(*KERNEL, FLOAT_TYPE, ReferenceList());\n as_float(pi) = 3.14159;\n KERNEL->bindName(pi, \"PI\");\n\n Term* tokenStreamType = \n quick_create_cpp_type<token_stream::TokenStream>(*KERNEL, \"TokenStream\");\n register_cpp_toString<token_stream::TokenStream>(tokenStreamType);\n}\n\nvoid initialize_builtin_functions(Branch* kernel)\n{\n setup_builtin_functions(*kernel);\n\n ADD_FUNC = kernel->getNamed(\"add\");\n MULT_FUNC = kernel->getNamed(\"mult\");\n\n assert(ADD_FUNC != NULL);\n assert(MULT_FUNC != NULL);\n\n UNKNOWN_FUNCTION = quick_create_function(kernel, \"unknown-function\",\n unknown_function__evaluate,\n ReferenceList(ANY_TYPE), ANY_TYPE);\n as_function(UNKNOWN_FUNCTION).stateType = STRING_TYPE;\n\n VAR_FUNCTION_FEEDBACK_ASSIGN = quick_create_function(kernel, \"var-function-feedback-assign\",\n var_function::feedback_assign,\n ReferenceList(ANY_TYPE, ANY_TYPE), VOID_TYPE);\n\n as_function(VAR_INT).feedbackPropogateFunction = VAR_FUNCTION_FEEDBACK_ASSIGN;\n as_function(VAR_FLOAT).feedbackPropogateFunction = VAR_FUNCTION_FEEDBACK_ASSIGN;\n as_function(VAR_BOOL).feedbackPropogateFunction = VAR_FUNCTION_FEEDBACK_ASSIGN;\n as_function(VAR_STRING).feedbackPropogateFunction = VAR_FUNCTION_FEEDBACK_ASSIGN;\n}\n\nvoid initialize()\n{\n bootstrap_kernel();\n initialize_builtin_types(*KERNEL);\n initialize_constants();\n initialize_list_functions(KERNEL);\n\n \/\/ Then everything else:\n initialize_builtin_functions(KERNEL);\n initialize_functions(KERNEL);\n}\n\nvoid shutdown()\n{\n delete KERNEL;\n KERNEL = NULL;\n}\n\nTerm* get_var_function(Branch& branch, Term* type)\n{\n Term* result = apply_function(branch, VAR_FUNCTION_GENERATOR, ReferenceList(type));\n evaluate_term(result);\n return result;\n}\n\n} \/\/ namespace circa\n<commit_msg>Fix problem where values were being stolen from some constants<commit_after>\/\/ Copyright 2008 Paul Hodge\n\n#include <iostream>\n#include <fstream>\n\n#include \"common_headers.h\"\n\n#include \"ast.h\"\n#include \"branch.h\"\n#include \"builtins.h\"\n#include \"builtin_types.h\"\n#include \"cpp_interface.h\"\n#include \"function.h\"\n#include \"importing.h\"\n#include \"list.h\"\n#include \"parser.h\"\n#include \"runtime.h\"\n#include \"term.h\"\n#include \"token_stream.h\"\n#include \"type.h\"\n#include \"values.h\"\n#include \"setup_builtin_functions.h\"\n\n\nnamespace circa {\n\nBranch* KERNEL = NULL;\nTerm* VAR_FUNCTION_GENERATOR = NULL;\nTerm* VAR_FUNCTION_FEEDBACK_ASSIGN = NULL;\nTerm* INT_TYPE = NULL;\nTerm* FLOAT_TYPE = NULL;\nTerm* BOOL_TYPE = NULL;\nTerm* STRING_TYPE = NULL;\nTerm* TYPE_TYPE = NULL;\nTerm* FUNCTION_TYPE = NULL;\nTerm* CODEUNIT_TYPE = NULL;\nTerm* BRANCH_TYPE = NULL;\nTerm* ANY_TYPE = NULL;\nTerm* VOID_TYPE = NULL;\nTerm* REFERENCE_TYPE = NULL;\nTerm* LIST_TYPE = NULL;\nTerm* MAP_TYPE = NULL;\nTerm* VAR_INT = NULL;\nTerm* VAR_FLOAT = NULL;\nTerm* VAR_STRING = NULL;\nTerm* VAR_BOOL = NULL;\nTerm* CONSTANT_0 = NULL;\nTerm* CONSTANT_1 = NULL;\nTerm* CONSTANT_2 = NULL;\nTerm* CONSTANT_TRUE = NULL;\nTerm* CONSTANT_FALSE = NULL;\nTerm* UNKNOWN_FUNCTION = NULL;\nTerm* APPLY_FEEDBACK = NULL;\nTerm* ADD_FUNC = NULL;\nTerm* MULT_FUNC = NULL;\n\nvoid empty_evaluate_function(Term*) { }\nvoid empty_alloc_function(Term*) { }\n\nvoid var_function_generator(Term* caller)\n{\n assert(caller->input(0) != NULL);\n\n Function& output = as_function(caller);\n Type& type = as_type(caller->input(0));\n output.name = \"var-\" + type.name;\n output.outputType = caller->input(0);\n output.pureFunction = false;\n output.evaluate = empty_evaluate_function;\n output.feedbackPropogateFunction = VAR_FUNCTION_FEEDBACK_ASSIGN;\n}\n\nTerm* get_global(std::string name)\n{\n if (KERNEL->containsName(name))\n return KERNEL->getNamed(name);\n\n return NULL;\n}\n\nvoid bootstrap_kernel()\n{\n \/\/ This is a crazy function. We need to create the 5 core functions in our system,\n \/\/ all of which need to reference each other or themselves.\n \/\/\n \/\/ Here is what we need to create:\n \/\/\n \/\/ var-function-generator(Type) -> Function\n \/\/ Given a type, returns a function which is a 'plain value' function. This term\n \/\/ has function const-Function.\n \/\/ const-Type() -> Type\n \/\/ Function which returns a Type value. This is created by var-function-generator\n \/\/ const-Function() -> Function\n \/\/ Function which returns a Function value. This is created by var-function-generator.\n \/\/ Type Function\n \/\/ Stores the Type object for functions. This term has function const-Type\n \/\/ Type Type\n \/\/ Stores the Type object for types. This term has function const-Type\n\n KERNEL = new Branch();\n\n \/\/ Create var-function-generator function\n VAR_FUNCTION_GENERATOR = new Term();\n VAR_FUNCTION_GENERATOR->owningBranch = KERNEL;\n VAR_FUNCTION_GENERATOR->value = new Function();\n as_function(VAR_FUNCTION_GENERATOR).name = \"var-function-generator\";\n as_function(VAR_FUNCTION_GENERATOR).pureFunction = true;\n as_function(VAR_FUNCTION_GENERATOR).evaluate = var_function_generator;\n KERNEL->bindName(VAR_FUNCTION_GENERATOR, \"var-function-generator\");\n\n \/\/ Create const-Type function\n Term* constTypeFunc = new Term();\n constTypeFunc->owningBranch = KERNEL;\n constTypeFunc->function = VAR_FUNCTION_GENERATOR;\n constTypeFunc->value = new Function();\n as_function(constTypeFunc).name = \"const-Type\";\n as_function(constTypeFunc).pureFunction = true;\n\n \/\/ Create Type type\n TYPE_TYPE = new Term();\n TYPE_TYPE->owningBranch = KERNEL;\n TYPE_TYPE->function = constTypeFunc;\n TYPE_TYPE->type = TYPE_TYPE;\n initialize_type_type(TYPE_TYPE);\n as_type(TYPE_TYPE).remapPointers = Type::typeRemapPointers;\n as_type(TYPE_TYPE).visitPointers = Type::typeVisitPointers;\n KERNEL->bindName(TYPE_TYPE, \"Type\");\n\n \/\/ Implant the Type type\n set_input(constTypeFunc, 0, TYPE_TYPE);\n as_function(VAR_FUNCTION_GENERATOR).inputTypes.setAt(0, TYPE_TYPE);\n as_function(constTypeFunc).outputType = TYPE_TYPE;\n\n \/\/ Create const-Function function\n Term* constFuncFunc = new Term();\n constFuncFunc->owningBranch = KERNEL;\n constFuncFunc->function = VAR_FUNCTION_GENERATOR;\n constFuncFunc->value = new Function();\n as_function(constFuncFunc).name = \"const-Function\";\n as_function(constFuncFunc).pureFunction = true;\n KERNEL->bindName(constFuncFunc, \"const-Function\");\n\n \/\/ Implant const-Function\n VAR_FUNCTION_GENERATOR->function = constFuncFunc;\n\n \/\/ Create Function type\n FUNCTION_TYPE = new Term();\n FUNCTION_TYPE->owningBranch = KERNEL;\n FUNCTION_TYPE->function = constTypeFunc;\n FUNCTION_TYPE->type = TYPE_TYPE;\n FUNCTION_TYPE->value = alloc_from_type(TYPE_TYPE);\n as_type(FUNCTION_TYPE).name = \"Function\";\n as_type(FUNCTION_TYPE).alloc = cpp_interface::templated_alloc<Function>;\n as_type(FUNCTION_TYPE).duplicate = Function::duplicate;\n as_type(FUNCTION_TYPE).dealloc = cpp_interface::templated_dealloc<Function>;\n as_type(FUNCTION_TYPE).remapPointers = Function::remapPointers;\n as_type(FUNCTION_TYPE).visitPointers = Function::visitPointers;\n KERNEL->bindName(FUNCTION_TYPE, \"Function\");\n\n \/\/ Implant Function type\n set_input(VAR_FUNCTION_GENERATOR, 0, TYPE_TYPE);\n set_input(constFuncFunc, 0, FUNCTION_TYPE);\n VAR_FUNCTION_GENERATOR->type = FUNCTION_TYPE;\n constFuncFunc->type = FUNCTION_TYPE;\n constTypeFunc->type = FUNCTION_TYPE;\n as_function(VAR_FUNCTION_GENERATOR).outputType = FUNCTION_TYPE;\n as_function(constFuncFunc).outputType = FUNCTION_TYPE;\n\n \/\/ Don't let these terms get updated\n VAR_FUNCTION_GENERATOR->needsUpdate = false;\n constFuncFunc->needsUpdate = false;\n constTypeFunc->needsUpdate = false;\n FUNCTION_TYPE->needsUpdate = false;\n TYPE_TYPE->needsUpdate = false;\n}\n\nvoid unknown_function__evaluate(Term* caller)\n{\n std::cout << \"Warning, calling an unknown function: \"\n << as_string(caller->state) << std::endl;\n}\n\nnamespace var_function {\n\n void feedback_assign(Term* caller)\n {\n Term* target = caller->input(0);\n Term* desired = caller->input(1);\n\n duplicate_value(desired, target);\n }\n}\n\nvoid initialize_constants()\n{\n BRANCH_TYPE = quick_create_cpp_type<Branch>(*KERNEL, \"Branch\");\n as_type(BRANCH_TYPE).remapPointers = Branch::hosted_remap_pointers;\n as_type(BRANCH_TYPE).visitPointers = Branch::hosted_visit_pointers;\n\n LIST_TYPE = quick_create_cpp_type<List>(*KERNEL, \"List\");\n as_type(LIST_TYPE).toString = List__toString;\n\n quick_create_cpp_type<Dictionary>(*KERNEL, \"Dictionary\");\n\n VAR_INT = get_var_function(*KERNEL, INT_TYPE);\n VAR_FLOAT = get_var_function(*KERNEL, FLOAT_TYPE);\n VAR_STRING = get_var_function(*KERNEL, STRING_TYPE);\n VAR_BOOL = get_var_function(*KERNEL, BOOL_TYPE);\n\n CONSTANT_0 = float_var(*KERNEL, 0);\n CONSTANT_1 = float_var(*KERNEL, 1);\n CONSTANT_2 = float_var(*KERNEL, 2);\n\n CONSTANT_TRUE = apply_function(*KERNEL, BOOL_TYPE, ReferenceList());\n as_bool(CONSTANT_TRUE) = true;\n CONSTANT_TRUE->stealingOk = false;\n KERNEL->bindName(CONSTANT_TRUE, \"true\");\n\n CONSTANT_FALSE = apply_function(*KERNEL, BOOL_TYPE, ReferenceList());\n as_bool(CONSTANT_FALSE) = false;\n CONSTANT_FALSE->stealingOk = false;\n KERNEL->bindName(CONSTANT_FALSE, \"false\");\n\n Term* pi = apply_function(*KERNEL, FLOAT_TYPE, ReferenceList());\n as_float(pi) = 3.14159;\n KERNEL->bindName(pi, \"PI\");\n\n Term* tokenStreamType = \n quick_create_cpp_type<token_stream::TokenStream>(*KERNEL, \"TokenStream\");\n register_cpp_toString<token_stream::TokenStream>(tokenStreamType);\n}\n\nvoid initialize_builtin_functions(Branch* kernel)\n{\n setup_builtin_functions(*kernel);\n\n ADD_FUNC = kernel->getNamed(\"add\");\n MULT_FUNC = kernel->getNamed(\"mult\");\n\n assert(ADD_FUNC != NULL);\n assert(MULT_FUNC != NULL);\n\n UNKNOWN_FUNCTION = quick_create_function(kernel, \"unknown-function\",\n unknown_function__evaluate,\n ReferenceList(ANY_TYPE), ANY_TYPE);\n as_function(UNKNOWN_FUNCTION).stateType = STRING_TYPE;\n\n VAR_FUNCTION_FEEDBACK_ASSIGN = quick_create_function(kernel, \"var-function-feedback-assign\",\n var_function::feedback_assign,\n ReferenceList(ANY_TYPE, ANY_TYPE), VOID_TYPE);\n\n as_function(VAR_INT).feedbackPropogateFunction = VAR_FUNCTION_FEEDBACK_ASSIGN;\n as_function(VAR_FLOAT).feedbackPropogateFunction = VAR_FUNCTION_FEEDBACK_ASSIGN;\n as_function(VAR_BOOL).feedbackPropogateFunction = VAR_FUNCTION_FEEDBACK_ASSIGN;\n as_function(VAR_STRING).feedbackPropogateFunction = VAR_FUNCTION_FEEDBACK_ASSIGN;\n}\n\nvoid initialize()\n{\n bootstrap_kernel();\n initialize_builtin_types(*KERNEL);\n initialize_constants();\n initialize_list_functions(KERNEL);\n\n \/\/ Then everything else:\n initialize_builtin_functions(KERNEL);\n initialize_functions(KERNEL);\n}\n\nvoid shutdown()\n{\n delete KERNEL;\n KERNEL = NULL;\n}\n\nTerm* get_var_function(Branch& branch, Term* type)\n{\n Term* result = apply_function(branch, VAR_FUNCTION_GENERATOR, ReferenceList(type));\n evaluate_term(result);\n return result;\n}\n\n} \/\/ namespace circa\n<|endoftext|>"} {"text":"<commit_before>#include \"Ant.hpp\"\n#include \"..\/nav\/Node.hpp\"\n#include \"..\/nav\/NavGraphHelper.hpp\"\n#include \"..\/worldobject\/AntHome.hpp\"\n#include \"..\/goal\/AntGoal.hpp\"\n#include \"..\/goal\/AntEat.hpp\"\n#include \"..\/goal\/AntForage.hpp\"\n#include \"..\/goal\/AntExplore.hpp\"\n#include \"..\/goal\/AntMoveToNode.hpp\"\n#include \"..\/util\/make_unique.hpp\"\n#include \"..\/knowledge\/Percept.hpp\"\n#include \"..\/knowledge\/AntPercept.hpp\"\n\n#include <iostream>\n\n\/\/ Christopher D. Canfield\n\/\/ October 2013\n\/\/ Ant.cpp\n\nusing cdc::Ant;\nusing cdc::Percept;\nusing cdc::GuiEventManager;\nusing cdc::Node;\nusing cdc::NavGraphHelper;\nusing cdc::AntHome;\nusing cdc::AntGoal;\nusing cdc::AntMoveToNode;\n\nusing std::unique_ptr;\nusing std::cout;\nusing std::endl;\nusing std::move;\n\n\nbool Ant::wasTextureLoaded = false;\nsf::Texture* Ant::texture = nullptr;\nsf::Texture* Ant::textureDead = nullptr;\nsf::Texture* Ant::textureWithFood = nullptr;\n\n\nAnt::Ant(GuiEventManager& manager, AntHome& home, NavGraphHelper& graphHelper, const Node& startNode) :\n\t\tButton(manager),\n\t\tkb(home, graphHelper),\n\t\tisSelected(false)\n{\n\tif (!Ant::wasTextureLoaded)\n\t{\n\t\tif (Ant::texture == nullptr)\n\t\t{\n\t\t\tAnt::texture = new sf::Texture;\n\t\t\tAnt::textureWithFood = new sf::Texture;\n\t\t\tAnt::textureDead = new sf::Texture;\n\t\t}\n\n\t\tif (!Ant::texture->loadFromFile(\"res\/ant.png\"))\n\t\t{\n\t\t\tstd::cout << \"Unable to load ant image: res\/ant.png\" << std::endl;\n\t\t}\n\t\tif (!Ant::textureWithFood->loadFromFile(\"res\/ant - holding food.png\"))\n\t\t{\n\t\t\tstd::cout << \"Unable to load ant image: res\/ant - holding food.png\" << std::endl;\n\t\t}\n\t\tif (!Ant::textureDead->loadFromFile(\"res\/ant - dead.png\"));\n\t\t{\n\t\t\tstd::cout << \"Unable to load ant image: res\/ant - dead.png\";\n\t\t}\n\t\tAnt::wasTextureLoaded = true;\n\t}\n\n\tauto antSprite = make_unique<sf::Sprite>(*Ant::texture);\t\t\t\n\tsetDefaultImage(std::move(antSprite));\n\tsetOriginToCenter();\n\n\tdeadAntSprite.setTexture(*Ant::textureDead, true);\n\tdeadAntSprite.setOrigin(deadAntSprite.getGlobalBounds().width \/ 1.9f, deadAntSprite.getGlobalBounds().height \/ 1.9f);\n\tantWithFoodSprite.setTexture(*Ant::textureWithFood, true);\n\tantWithFoodSprite.setOrigin(antWithFoodSprite.getGlobalBounds().width \/ 1.9f, antWithFoodSprite.getGlobalBounds().height \/ 1.9f);\n\n\t\/\/ Ants don't need to know about mouse move events.\n\tmanager.removeMouseMoveListener(*this);\n\tmanager.addDirectMouseMoveListener(*this);\n\n\tmanager.addClickListener(*this);\n\n\tgoal = make_unique<AntForage>();\n\tsetPositionToNode(startNode);\n}\n\nAnt::Ant(Ant&& other) :\n\tButton(move(other)),\n\tkb(move(other.kb)),\n\tstats(other.stats),\n\tgoal(move(other.goal)),\n\tisSelected(other.isSelected),\n\tdeadAntSprite(other.deadAntSprite)\n{\n}\n\nAnt::~Ant()\n{\n}\n\nvoid Ant::update(uint ticks, const Percept& percept)\n{\n\tif (!isDead())\n\t{\n\t\tprocessHunger(ticks, stats);\n\t\tif (stats.isHoldingFood)\n\t\t{\n\t\t\tantWithFoodSprite.setPosition(getPosition());\n\t\t\tantWithFoodSprite.setRotation(getRotation());\n\t\t}\n\t\t\n\t\t\/\/ Process the goal if one is set, or set a new one if not.\n\t\tif (!goal->isFinished())\n\t\t{\n\t\t\tauto antPercept = AntPercept(percept);\n\t\t\tgoal->update(*this, ticks, antPercept);\n\t\t}\n\t\telse\n\t\t{\n\t\t\tgoal = getNewGoal(stats);\n\t\t}\n\t}\n}\n\n\nvoid Ant::setPositionToNode(const Node& node)\n{\n\tkb.lastNodePassed = const_cast<Node*>(&node);\n\tsetPosition(node.getPixelX<int>(), node.getPixelY<int>());\n}\n\nconst Node* Ant::popLastKnownFoodPosition()\n{\n\tif (!kb.lastKnownFoodPosition.empty())\n\t{\n\t\tauto mostRecent = kb.lastKnownFoodPosition.front();\n\t\tkb.lastKnownFoodPosition.pop_front();\n\t\treturn mostRecent;\n\t}\n\telse\n\t{\n\t\treturn nullptr;\n\t}\n}\n\nuint Ant::getHunger() const\n{\n\treturn stats.hunger;\n}\n\nAntHome& Ant::getHome() const\n{\n\treturn kb.home;\n}\n\nbool Ant::isDead() const\n{\n\treturn stats.isDead;\n}\n\nvoid Ant::kill()\n{\n\tonDeath();\n}\n\nNode& Ant::getNode() const\n{\n\treturn *kb.lastNodePassed;\n}\n\n\n\nvoid Ant::onDirectGuiEvent(const sf::Event& e)\n{\n\tif (e.type == sf::Event::MouseButtonReleased && !isSelected)\n\t{\n\t\tisSelected = true;\n\t\tselectedTimer.restart();\n\t\tcout << \"Ant \" << getObserverId().toString() << \" selected\" << endl;\n\t\tcout << \" Hunger: \" << stats.hunger << \"% | \" << (!isDead() ? \"Is Alive\" : \"Is Dead\") << endl;\n\t\tcout << \" Current Goal: \" << goal->toString() << endl;\n\t}\n}\n\nvoid Ant::onGuiEvent(const sf::Event& e)\n{\n\tif (e.type == sf::Event::MouseButtonReleased && isSelected && selectedTimer.getElapsedTime().asMilliseconds() > 300)\n\t{\n\t\tisSelected = false;\n\t}\n}\n\nvoid Ant::draw(sf::RenderTarget &target, sf::RenderStates states) const\n{\n\tif (isDead())\n\t{\n\t\ttarget.draw(deadAntSprite, states);\n\t}\n\telse if (stats.isHoldingFood)\n\t{\n\t\ttarget.draw(antWithFoodSprite, states);\n\t}\n\telse\n\t{\n\t\tButton::draw(target, states);\n\t}\n\n\tif (isSelected && goal != nullptr)\n\t{\n\t\tgoal->drawPath(target, states, this->getNode());\n\t}\n}\n\n\n\/\/\/\/\/\/ Private & protected methods \/\/\/\/\/\/\n\nvoid Ant::onDeath()\n{\n\tif (!stats.isDead)\n\t{\n\t\tif (isSelected) cout << \" Ant \" << getObserverId().toString() << \" has died\" << endl;\n\t\tstats.isDead = true;\n\t\tdeadAntSprite.setPosition(getPosition());\n\t\tdeadAntSprite.setRotation(getRotation());\n\t}\n}\n\nvoid Ant::processHunger(uint ticks, AntStats& stats)\n{\n\tif (ticks >= stats.nextHungerIncrease)\n\t{\n\t\tif (stats.hunger >= stats.maxHunger)\n\t\t{\n\t\t\t\/\/ The ant has starved to death.\n\t\t\tonDeath();\n\t\t}\n\t\telse\n\t\t{\n\t\t\t++stats.hunger;\n\t\t\tif (isSelected) cout << \" Hunger: \" << stats.hunger << endl;\n\t\t\t\/\/ Modify the hunger increase rate by between 0.65 and 1.35, to \n\t\t\t\/\/ differentiate the behaviors of the ants.\n\t\t\tfloat modifier = random.getInteger(65, 135) \/ 100.f;\n\t\t\tstats.nextHungerIncrease += static_cast<uint>(stats.hungerIncreaseRate * modifier);\n\t\t}\n\t}\n}\n\nvoid Ant::setAntWithFoodSpritePosition(float x, float y, float rotation)\n{\n\tantWithFoodSprite.setPosition(x, y);\n\tantWithFoodSprite.setRotation(rotation);\n}\n\nunique_ptr<AntGoal> Ant::getNewGoal(AntStats& stats)\n{\n\tusing std::move;\n\t\/\/ Higher = hungrier when the ant starts looking for food to eat.\n\tconst uint hungry = 60;\n\n\t\/\/ Look for food if hungry. This takes priority over other potential goals.\n\tif (stats.hunger > hungry)\n\t{\n\t\tauto newGoal = unique_ptr<AntEat>(new AntEat());\n\t\tif (isSelected) cout << \" Goal changed: \" << newGoal->toString() << endl;\n\t\treturn move(newGoal);\n\t}\n\n\t\/\/ The chance that the ant will explore rather than forage, from 1 to 100.\n\tconst int exploreChance = 1;\n\tint decision = random.getInteger(1, 100);\n\tif (decision <= exploreChance)\n\t{\n\t\tauto newGoal = unique_ptr<AntExplore>(new AntExplore());\n\t\tif (isSelected) cout << \" Goal changed: \" << newGoal->toString() << endl;\n\t\treturn move(newGoal);\n\t}\n\telse\n\t{\n\t\tauto newGoal = unique_ptr<AntForage>(new AntForage());\n\t\tif (isSelected) cout << \" Goal changed: \" << newGoal->toString() << endl;\n\t\treturn move(newGoal);\n\t}\n}\n\n\n\/\/\/\/\/\/ Struct constructors \/\/\/\/\/\/\n\nAnt::AntKnowledgeBase::AntKnowledgeBase(AntHome& home, NavGraphHelper& graphHelper) :\n\thome(home),\n\tnavGraphHelper(graphHelper),\n\t\/\/ Up to four food piles are remembered by the ant.\n\tlastKnownFoodPosition(4),\n\tlastNodePassed(nullptr)\n{\n}\n\nAnt::AntStats::AntStats() :\n\thungerIncreaseRate(180),\t\/\/ default ticks per second is 60, so this gives a rate of 3 seconds per increase in hunger.\n\thunger(0),\n\tnextHungerIncrease(hungerIncreaseRate),\n\tmaxHunger(100),\n\tisHoldingFood(false),\n\tisDead(false),\n\tmovementSpeed(3.5f)\n{\n}<commit_msg>Minor hunger formatting fix<commit_after>#include \"Ant.hpp\"\n#include \"..\/nav\/Node.hpp\"\n#include \"..\/nav\/NavGraphHelper.hpp\"\n#include \"..\/worldobject\/AntHome.hpp\"\n#include \"..\/goal\/AntGoal.hpp\"\n#include \"..\/goal\/AntEat.hpp\"\n#include \"..\/goal\/AntForage.hpp\"\n#include \"..\/goal\/AntExplore.hpp\"\n#include \"..\/goal\/AntMoveToNode.hpp\"\n#include \"..\/util\/make_unique.hpp\"\n#include \"..\/knowledge\/Percept.hpp\"\n#include \"..\/knowledge\/AntPercept.hpp\"\n\n#include <iostream>\n\n\/\/ Christopher D. Canfield\n\/\/ October 2013\n\/\/ Ant.cpp\n\nusing cdc::Ant;\nusing cdc::Percept;\nusing cdc::GuiEventManager;\nusing cdc::Node;\nusing cdc::NavGraphHelper;\nusing cdc::AntHome;\nusing cdc::AntGoal;\nusing cdc::AntMoveToNode;\n\nusing std::unique_ptr;\nusing std::cout;\nusing std::endl;\nusing std::move;\n\n\nbool Ant::wasTextureLoaded = false;\nsf::Texture* Ant::texture = nullptr;\nsf::Texture* Ant::textureDead = nullptr;\nsf::Texture* Ant::textureWithFood = nullptr;\n\n\nAnt::Ant(GuiEventManager& manager, AntHome& home, NavGraphHelper& graphHelper, const Node& startNode) :\n\t\tButton(manager),\n\t\tkb(home, graphHelper),\n\t\tisSelected(false)\n{\n\tif (!Ant::wasTextureLoaded)\n\t{\n\t\tif (Ant::texture == nullptr)\n\t\t{\n\t\t\tAnt::texture = new sf::Texture;\n\t\t\tAnt::textureWithFood = new sf::Texture;\n\t\t\tAnt::textureDead = new sf::Texture;\n\t\t}\n\n\t\tif (!Ant::texture->loadFromFile(\"res\/ant.png\"))\n\t\t{\n\t\t\tstd::cout << \"Unable to load ant image: res\/ant.png\" << std::endl;\n\t\t}\n\t\tif (!Ant::textureWithFood->loadFromFile(\"res\/ant - holding food.png\"))\n\t\t{\n\t\t\tstd::cout << \"Unable to load ant image: res\/ant - holding food.png\" << std::endl;\n\t\t}\n\t\tif (!Ant::textureDead->loadFromFile(\"res\/ant - dead.png\"));\n\t\t{\n\t\t\tstd::cout << \"Unable to load ant image: res\/ant - dead.png\";\n\t\t}\n\t\tAnt::wasTextureLoaded = true;\n\t}\n\n\tauto antSprite = make_unique<sf::Sprite>(*Ant::texture);\t\t\t\n\tsetDefaultImage(std::move(antSprite));\n\tsetOriginToCenter();\n\n\tdeadAntSprite.setTexture(*Ant::textureDead, true);\n\tdeadAntSprite.setOrigin(deadAntSprite.getGlobalBounds().width \/ 1.9f, deadAntSprite.getGlobalBounds().height \/ 1.9f);\n\tantWithFoodSprite.setTexture(*Ant::textureWithFood, true);\n\tantWithFoodSprite.setOrigin(antWithFoodSprite.getGlobalBounds().width \/ 1.9f, antWithFoodSprite.getGlobalBounds().height \/ 1.9f);\n\n\t\/\/ Ants don't need to know about mouse move events.\n\tmanager.removeMouseMoveListener(*this);\n\tmanager.addDirectMouseMoveListener(*this);\n\n\tmanager.addClickListener(*this);\n\n\tgoal = make_unique<AntForage>();\n\tsetPositionToNode(startNode);\n}\n\nAnt::Ant(Ant&& other) :\n\tButton(move(other)),\n\tkb(move(other.kb)),\n\tstats(other.stats),\n\tgoal(move(other.goal)),\n\tisSelected(other.isSelected),\n\tdeadAntSprite(other.deadAntSprite)\n{\n}\n\nAnt::~Ant()\n{\n}\n\nvoid Ant::update(uint ticks, const Percept& percept)\n{\n\tif (!isDead())\n\t{\n\t\tprocessHunger(ticks, stats);\n\t\tif (stats.isHoldingFood)\n\t\t{\n\t\t\tantWithFoodSprite.setPosition(getPosition());\n\t\t\tantWithFoodSprite.setRotation(getRotation());\n\t\t}\n\t\t\n\t\t\/\/ Process the goal if one is set, or set a new one if not.\n\t\tif (!goal->isFinished())\n\t\t{\n\t\t\tauto antPercept = AntPercept(percept);\n\t\t\tgoal->update(*this, ticks, antPercept);\n\t\t}\n\t\telse\n\t\t{\n\t\t\tgoal = getNewGoal(stats);\n\t\t}\n\t}\n}\n\n\nvoid Ant::setPositionToNode(const Node& node)\n{\n\tkb.lastNodePassed = const_cast<Node*>(&node);\n\tsetPosition(node.getPixelX<int>(), node.getPixelY<int>());\n}\n\nconst Node* Ant::popLastKnownFoodPosition()\n{\n\tif (!kb.lastKnownFoodPosition.empty())\n\t{\n\t\tauto mostRecent = kb.lastKnownFoodPosition.front();\n\t\tkb.lastKnownFoodPosition.pop_front();\n\t\treturn mostRecent;\n\t}\n\telse\n\t{\n\t\treturn nullptr;\n\t}\n}\n\nuint Ant::getHunger() const\n{\n\treturn stats.hunger;\n}\n\nAntHome& Ant::getHome() const\n{\n\treturn kb.home;\n}\n\nbool Ant::isDead() const\n{\n\treturn stats.isDead;\n}\n\nvoid Ant::kill()\n{\n\tonDeath();\n}\n\nNode& Ant::getNode() const\n{\n\treturn *kb.lastNodePassed;\n}\n\n\n\nvoid Ant::onDirectGuiEvent(const sf::Event& e)\n{\n\tif (e.type == sf::Event::MouseButtonReleased && !isSelected)\n\t{\n\t\tisSelected = true;\n\t\tselectedTimer.restart();\n\t\tcout << \"Ant \" << getObserverId().toString() << \" selected\" << endl;\n\t\tcout << \" Hunger: \" << stats.hunger << \"% | \" << (!isDead() ? \"Is Alive\" : \"Is Dead\") << endl;\n\t\tcout << \" Current Goal: \" << goal->toString() << endl;\n\t}\n}\n\nvoid Ant::onGuiEvent(const sf::Event& e)\n{\n\tif (e.type == sf::Event::MouseButtonReleased && isSelected && selectedTimer.getElapsedTime().asMilliseconds() > 300)\n\t{\n\t\tisSelected = false;\n\t}\n}\n\nvoid Ant::draw(sf::RenderTarget &target, sf::RenderStates states) const\n{\n\tif (isDead())\n\t{\n\t\ttarget.draw(deadAntSprite, states);\n\t}\n\telse if (stats.isHoldingFood)\n\t{\n\t\ttarget.draw(antWithFoodSprite, states);\n\t}\n\telse\n\t{\n\t\tButton::draw(target, states);\n\t}\n\n\tif (isSelected && goal != nullptr)\n\t{\n\t\tgoal->drawPath(target, states, this->getNode());\n\t}\n}\n\n\n\/\/\/\/\/\/ Private & protected methods \/\/\/\/\/\/\n\nvoid Ant::onDeath()\n{\n\tif (!stats.isDead)\n\t{\n\t\tif (isSelected) cout << \" Ant \" << getObserverId().toString() << \" has died\" << endl;\n\t\tstats.isDead = true;\n\t\tdeadAntSprite.setPosition(getPosition());\n\t\tdeadAntSprite.setRotation(getRotation());\n\t}\n}\n\nvoid Ant::processHunger(uint ticks, AntStats& stats)\n{\n\tif (ticks >= stats.nextHungerIncrease)\n\t{\n\t\tif (stats.hunger >= stats.maxHunger)\n\t\t{\n\t\t\t\/\/ The ant has starved to death.\n\t\t\tonDeath();\n\t\t}\n\t\telse\n\t\t{\n\t\t\t++stats.hunger;\n\t\t\tif (isSelected) cout << \" Hunger: \" << stats.hunger << \"%\" << endl;\n\t\t\t\/\/ Modify the hunger increase rate by between 0.65 and 1.35, to \n\t\t\t\/\/ differentiate the behaviors of the ants.\n\t\t\tfloat modifier = random.getInteger(65, 135) \/ 100.f;\n\t\t\tstats.nextHungerIncrease += static_cast<uint>(stats.hungerIncreaseRate * modifier);\n\t\t}\n\t}\n}\n\nvoid Ant::setAntWithFoodSpritePosition(float x, float y, float rotation)\n{\n\tantWithFoodSprite.setPosition(x, y);\n\tantWithFoodSprite.setRotation(rotation);\n}\n\nunique_ptr<AntGoal> Ant::getNewGoal(AntStats& stats)\n{\n\tusing std::move;\n\t\/\/ Higher = hungrier when the ant starts looking for food to eat.\n\tconst uint hungry = 60;\n\n\t\/\/ Look for food if hungry. This takes priority over other potential goals.\n\tif (stats.hunger > hungry)\n\t{\n\t\tauto newGoal = unique_ptr<AntEat>(new AntEat());\n\t\tif (isSelected) cout << \" Goal changed: \" << newGoal->toString() << endl;\n\t\treturn move(newGoal);\n\t}\n\n\t\/\/ The chance that the ant will explore rather than forage, from 1 to 100.\n\tconst int exploreChance = 1;\n\tint decision = random.getInteger(1, 100);\n\tif (decision <= exploreChance)\n\t{\n\t\tauto newGoal = unique_ptr<AntExplore>(new AntExplore());\n\t\tif (isSelected) cout << \" Goal changed: \" << newGoal->toString() << endl;\n\t\treturn move(newGoal);\n\t}\n\telse\n\t{\n\t\tauto newGoal = unique_ptr<AntForage>(new AntForage());\n\t\tif (isSelected) cout << \" Goal changed: \" << newGoal->toString() << endl;\n\t\treturn move(newGoal);\n\t}\n}\n\n\n\/\/\/\/\/\/ Struct constructors \/\/\/\/\/\/\n\nAnt::AntKnowledgeBase::AntKnowledgeBase(AntHome& home, NavGraphHelper& graphHelper) :\n\thome(home),\n\tnavGraphHelper(graphHelper),\n\t\/\/ Up to four food piles are remembered by the ant.\n\tlastKnownFoodPosition(4),\n\tlastNodePassed(nullptr)\n{\n}\n\nAnt::AntStats::AntStats() :\n\thungerIncreaseRate(180),\t\/\/ default ticks per second is 60, so this gives a rate of 3 seconds per increase in hunger.\n\thunger(0),\n\tnextHungerIncrease(hungerIncreaseRate),\n\tmaxHunger(100),\n\tisHoldingFood(false),\n\tisDead(false),\n\tmovementSpeed(3.5f)\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\/\/ This file is originally ported from ROS1:\n\/\/ https:\/\/github.com\/ros\/common_msgs\/blob\/89069bc\/sensor_msgs\/include\/sensor_msgs\/fill_image.h\n\n#ifndef FILLIMAGE_HH\n#define FILLIMAGE_HH\n\n#include \"sensor_msgs\/Image.h\"\n#include \"sensor_msgs\/image_encodings.h\"\n\nnamespace sensor_msgs\n{\n\n static inline bool fillImage(Image& image,\n const std::string& encoding_arg,\n uint32_t rows_arg,\n uint32_t cols_arg,\n uint32_t step_arg,\n const void* data_arg)\n {\n image.encoding = encoding_arg;\n image.height = rows_arg;\n image.width = cols_arg;\n image.step = step_arg;\n size_t st0 = (step_arg * rows_arg);\n image.data.resize(st0);\n memcpy(&image.data[0], data_arg, st0);\n\n image.is_bigendian = 0;\n return true;\n }\n\n static inline void clearImage(Image& image)\n {\n image.data.resize(0);\n }\n}\n\n\n#endif\n\n<commit_msg>ROS 2 port: conform to linters and add documentation<commit_after>\/\/ Copyright (c) 2008, Willow Garage, Inc.\n\/\/ All rights reserved.\n\/\/\n\/\/ Software License Agreement (BSD License 2.0)\n\/\/\n\/\/ 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\/\/ This file is originally ported from ROS1:\n\/\/ https:\/\/github.com\/ros\/common_msgs\/blob\/89069bc\/sensor_msgs\/include\/sensor_msgs\/fill_image.h\n\n#ifndef SENSOR_MSGS__FILL_IMAGE_HPP_\n#define SENSOR_MSGS__FILL_IMAGE_HPP_\n\n#include <string>\n\n#include \"sensor_msgs\/msg\/image.hpp\"\n#include \"sensor_msgs\/image_encodings.hpp\"\n\nnamespace sensor_msgs\n{\n\/\/\/ Fill an image message.\n\/**\n * \\param[out] image Image to be filled.\n * \\param[in] encoding_arg Encoding type, such as sensor_msgs::image_encodings::RGB8.\n * \\param[in] rows_arg Number of rows.\n * \\param[in] cols_arg Number of columns.\n * \\param[in] step_arg Step size.\n * \\param[in] data_arg Data to fill image with.\n * \\return True if successful.\n *\/\nstatic inline bool fillImage(\n msg::Image & image,\n const std::string & encoding_arg,\n uint32_t rows_arg,\n uint32_t cols_arg,\n uint32_t step_arg,\n const void * data_arg)\n{\n image.encoding = encoding_arg;\n image.height = rows_arg;\n image.width = cols_arg;\n image.step = step_arg;\n size_t st0 = (step_arg * rows_arg);\n image.data.resize(st0);\n memcpy(&image.data[0], data_arg, st0);\n\n image.is_bigendian = 0;\n return true;\n}\n\n\/\/\/ Clear the data of an image message.\n\/**\n * \\details All fields but `data` are kept the same.\n * \\param[out]image Image to be cleared.\n *\/\nstatic inline void clearImage(msg::Image & image)\n{\n image.data.resize(0);\n}\n} \/\/ namespace sensor_msgs\n\n#endif \/\/ SENSOR_MSGS__FILL_IMAGE_HPP_\n<|endoftext|>"} {"text":"<commit_before>#include <boost\/functional\/hash\/hash.hpp>\n\n#include <deque>\n#include <unordered_set>\n#include <vector>\n\n#include <assert.h>\n#include <stddef.h>\n#include <stdio.h>\n#include <string.h>\n#include <strings.h>\n\nint board[5][4] = {\n\/\/ 0 1 2 3\n { 1, 2, 2, 3, }, \/\/ 0\n { 1, 2, 2, 3, }, \/\/ 1\n { 4, 5, 5, 6, }, \/\/ 2\n { 4, 7, 8, 6, }, \/\/ 3\n { 9, 0, 0, 10 } }; \/\/ 4\n\nstruct Mask;\n\nconst int kRows = 5;\nconst int kColumns = 4;\nconst int kBlocks = 10;\n\nenum class Shape \/\/ : int8_t\n{\n kInvalid,\n kSingle,\n kHorizon,\n kVertical,\n kSquare,\n};\n\nstruct Block\n{\n Shape shape;\n int left, top; \/\/ int8_t\n\n Block()\n : shape(Shape::kInvalid),\n left(-1),\n top(-1)\n {\n }\n\n Block(Shape s, int left, int top)\n : shape(s),\n left(left),\n top(top)\n {\n assert(shape != Shape::kInvalid);\n assert(left >= 0 && left < kColumns);\n assert(top >= 0 && top < kRows);\n }\n\n int bottom() const\n {\n const static int delta[] = { 0, 0, 0, 1, 1, };\n assert(shape != Shape::kInvalid);\n return top + delta[static_cast<int>(shape)];\n }\n\n int right() const\n {\n const static int delta[] = { 0, 0, 1, 0, 1, };\n assert(shape != Shape::kInvalid);\n return left + delta[static_cast<int>(shape)];\n }\n\n void mask(int8_t value, Mask* mask) const;\n};\n\nstruct Mask\n{\n Mask()\n {\n bzero(board_, sizeof(board_));\n }\n\n bool operator==(const Mask& rhs) const\n {\n return memcmp(board_, rhs.board_, sizeof board_) == 0;\n }\n\n size_t hashValue() const\n {\n const int8_t* begin = board_[0];\n return boost::hash_range(begin, begin + sizeof(board_));\n }\n\n void print() const\n {\n for (int i = 0; i < kRows; ++i)\n {\n for (int j = 0; j < kColumns; ++j)\n {\n printf(\" %c\", board_[i][j] + '0');\n }\n printf(\"\\n\");\n }\n }\n\n void set(int8_t value, int y, int x)\n {\n assert(value > 0);\n assert(x >= 0 && x < kColumns);\n assert(y >= 0 && y < kRows);\n assert(board_[y][x] == 0);\n board_[y][x] = value;\n }\n\n bool empty(int y, int x) const\n {\n assert(x >= 0 && x < kColumns);\n assert(y >= 0 && y < kRows);\n return board_[y][x] == 0;\n }\n\n private:\n int8_t board_[kRows][kColumns];\n};\n\nnamespace std\n{\n template<> struct hash<Mask>\n {\n size_t operator()(const Mask& x) const\n {\n return x.hashValue();\n }\n };\n}\n\ninline void Block::mask(int8_t value, Mask* mask) const\n{\n mask->set(value, top, left);\n switch (shape)\n {\n case Shape::kHorizon:\n mask->set(value, top, left+1);\n break;\n case Shape::kVertical:\n mask->set(value, top+1, left);\n break;\n case Shape::kSquare:\n mask->set(value, top, left+1);\n mask->set(value, top+1, left);\n mask->set(value, top+1, left+1);\n break;\n default:\n assert(shape == Shape::kSingle);\n ;\n }\n}\n\nstruct State\n{\n Mask toMask() const\n {\n Mask m;\n for (int i = 0; i < kBlocks; ++i)\n {\n Block b = blocks_[i];\n b.mask(static_cast<int>(b.shape), &m);\n }\n return m;\n }\n\n bool isSolved() const\n {\n \/\/ FIXME: magic number\n Block square = blocks_[1];\n assert(square.shape == Shape::kSquare);\n return (square.left == 1 && square.top == 3);\n }\n\n template<typename FUNC>\n void move(const FUNC& func) const\n {\n if (0)\n {\n std::function<void(const State&)> typecheck = func;\n }\n const Mask mask = toMask();\n\n for (int i = 0; i < kBlocks; ++i)\n {\n Block b = blocks_[i];\n if (b.top > 0 && mask.empty(b.top-1, b.left))\n {\n bool moveUp = false;\n if (b.shape == Shape::kHorizon || b.shape == Shape::kSquare)\n {\n if (mask.empty(b.top-1, b.left+1))\n moveUp = true;\n }\n else\n moveUp = true;\n if (moveUp)\n {\n State next = *this;\n next.step++;\n next.blocks_[i].top--;\n func(next);\n }\n }\n\n if (b.bottom() < kRows-1 && mask.empty(b.bottom()+1, b.left))\n {\n bool moveDown = false;\n if (b.shape == Shape::kHorizon || b.shape == Shape::kSquare)\n {\n if (mask.empty(b.bottom()+1, b.left+1))\n moveDown = true;\n }\n else\n moveDown = true;\n if (moveDown)\n {\n State next = *this;\n next.step++;\n next.blocks_[i].top++;\n func(next);\n }\n }\n\n if (b.left > 0 && mask.empty(b.top, b.left-1))\n {\n bool moveLeft = false;\n if (b.shape == Shape::kVertical || b.shape == Shape::kSquare)\n {\n if (mask.empty(b.top+1, b.left-1))\n moveLeft = true;\n }\n else\n moveLeft = true;\n if (moveLeft)\n {\n State next = *this;\n next.step++;\n next.blocks_[i].left--;\n func(next);\n }\n }\n\n if (b.right() < kColumns-1 && mask.empty(b.top, b.right()+1))\n {\n bool moveRight = false;\n if (b.shape == Shape::kVertical || b.shape == Shape::kSquare)\n {\n if (mask.empty(b.top+1, b.right()+1))\n moveRight = true;\n }\n else\n moveRight = true;\n if (moveRight)\n {\n State next = *this;\n next.step++;\n next.blocks_[i].left++;\n func(next);\n }\n }\n }\n }\n\n \/\/ std::vector<State> moves() const;\n\n Block blocks_[kBlocks];\n int step = 0;\n};\n\nint main()\n{\n printf(\"sizeof(Mask) = %zd, sizeof(State) = %zd\\n\", sizeof(Mask), sizeof(State));\n std::unordered_set<Mask> seen;\n std::deque<State> queue;\n\n State initial;\n initial.blocks_[0] = Block(Shape::kVertical, 0, 0);\n initial.blocks_[1] = Block(Shape::kSquare, 1, 0);\n initial.blocks_[2] = Block(Shape::kVertical, 3, 0);\n initial.blocks_[3] = Block(Shape::kVertical, 0, 2);\n initial.blocks_[4] = Block(Shape::kHorizon, 1, 2);\n initial.blocks_[5] = Block(Shape::kVertical, 3, 2);\n initial.blocks_[6] = Block(Shape::kSingle, 1, 3);\n initial.blocks_[7] = Block(Shape::kSingle, 2, 3);\n initial.blocks_[8] = Block(Shape::kSingle, 0, 4);\n initial.blocks_[9] = Block(Shape::kSingle, 3, 4);\n\n queue.push_back(initial);\n seen.insert(initial.toMask());\n\n while (!queue.empty())\n {\n const State curr = queue.front();\n queue.pop_front();\n\n if (curr.isSolved())\n {\n printf(\"found solution with %d steps\\n\", curr.step);\n break;\n }\n else if (curr.step > 200)\n {\n printf(\"too many steps.\\n\");\n break;\n }\n\n curr.move([&seen, &queue](const State& next) {\n auto result = seen.insert(next.toMask());\n if (result.second)\n queue.push_back(next);\n });\n\n \/\/ for (const State& next : curr.moves())\n \/\/ {\n \/\/ auto result = seen.insert(next.toMask());\n \/\/ if (result.second)\n \/\/ queue.push_back(next);\n \/\/ }\n }\n}\n<commit_msg>fix issue #3.<commit_after>#include <boost\/functional\/hash\/hash.hpp>\n\n#include <deque>\n#include <type_traits>\n#include <unordered_set>\n#include <vector>\n\n#include <assert.h>\n#include <stddef.h>\n#include <stdio.h>\n#include <string.h>\n#include <strings.h>\n\nint board[5][4] = {\n\/\/ 0 1 2 3\n { 1, 2, 2, 3, }, \/\/ 0\n { 1, 2, 2, 3, }, \/\/ 1\n { 4, 5, 5, 6, }, \/\/ 2\n { 4, 7, 8, 6, }, \/\/ 3\n { 9, 0, 0, 10 } }; \/\/ 4\n\nstruct Mask;\n\nconst int kRows = 5;\nconst int kColumns = 4;\nconst int kBlocks = 10;\n\nenum class Shape \/\/ : int8_t\n{\n kInvalid,\n kSingle,\n kHorizon,\n kVertical,\n kSquare,\n};\n\nstruct Block\n{\n Shape shape;\n int left, top; \/\/ int8_t\n\n Block()\n : shape(Shape::kInvalid),\n left(-1),\n top(-1)\n {\n }\n\n Block(Shape s, int left, int top)\n : shape(s),\n left(left),\n top(top)\n {\n assert(shape != Shape::kInvalid);\n assert(left >= 0 && left < kColumns);\n assert(top >= 0 && top < kRows);\n }\n\n int bottom() const\n {\n const static int delta[] = { 0, 0, 0, 1, 1, };\n assert(shape != Shape::kInvalid);\n return top + delta[static_cast<int>(shape)];\n }\n\n int right() const\n {\n const static int delta[] = { 0, 0, 1, 0, 1, };\n assert(shape != Shape::kInvalid);\n return left + delta[static_cast<int>(shape)];\n }\n\n void mask(int8_t value, Mask* mask) const;\n};\n\nstruct Mask\n{\n Mask()\n {\n bzero(board_, sizeof(board_));\n }\n\n bool operator==(const Mask& rhs) const\n {\n return memcmp(board_, rhs.board_, sizeof board_) == 0;\n }\n\n size_t hashValue() const\n {\n const int8_t* begin = board_[0];\n return boost::hash_range(begin, begin + sizeof(board_));\n }\n\n void print() const\n {\n for (int i = 0; i < kRows; ++i)\n {\n for (int j = 0; j < kColumns; ++j)\n {\n printf(\" %c\", board_[i][j] + '0');\n }\n printf(\"\\n\");\n }\n }\n\n void set(int8_t value, int y, int x)\n {\n assert(value > 0);\n assert(x >= 0 && x < kColumns);\n assert(y >= 0 && y < kRows);\n assert(board_[y][x] == 0);\n board_[y][x] = value;\n }\n\n bool empty(int y, int x) const\n {\n assert(x >= 0 && x < kColumns);\n assert(y >= 0 && y < kRows);\n return board_[y][x] == 0;\n }\n\n private:\n int8_t board_[kRows][kColumns];\n};\n\nnamespace std\n{\n template<> struct hash<Mask>\n {\n size_t operator()(const Mask& x) const\n {\n return x.hashValue();\n }\n };\n}\n\ninline void Block::mask(int8_t value, Mask* mask) const\n{\n mask->set(value, top, left);\n switch (shape)\n {\n case Shape::kHorizon:\n mask->set(value, top, left+1);\n break;\n case Shape::kVertical:\n mask->set(value, top+1, left);\n break;\n case Shape::kSquare:\n mask->set(value, top, left+1);\n mask->set(value, top+1, left);\n mask->set(value, top+1, left+1);\n break;\n default:\n assert(shape == Shape::kSingle);\n ;\n }\n}\n\nstruct State\n{\n Mask toMask() const\n {\n Mask m;\n for (int i = 0; i < kBlocks; ++i)\n {\n Block b = blocks_[i];\n b.mask(static_cast<int>(b.shape), &m);\n }\n return m;\n }\n\n bool isSolved() const\n {\n \/\/ FIXME: magic number\n Block square = blocks_[1];\n assert(square.shape == Shape::kSquare);\n return (square.left == 1 && square.top == 3);\n }\n\n template<typename FUNC>\n void move(const FUNC& func) const\n {\n static_assert(std::is_convertible<FUNC, std::function<void(const State&)>>::value,\n \"func must be callable with a 'const State&' parameter.\");\n const Mask mask = toMask();\n\n for (int i = 0; i < kBlocks; ++i)\n {\n Block b = blocks_[i];\n if (b.top > 0 && mask.empty(b.top-1, b.left))\n {\n bool moveUp = false;\n if (b.shape == Shape::kHorizon || b.shape == Shape::kSquare)\n {\n if (mask.empty(b.top-1, b.left+1))\n moveUp = true;\n }\n else\n moveUp = true;\n if (moveUp)\n {\n State next = *this;\n next.step++;\n next.blocks_[i].top--;\n func(next);\n }\n }\n\n if (b.bottom() < kRows-1 && mask.empty(b.bottom()+1, b.left))\n {\n bool moveDown = false;\n if (b.shape == Shape::kHorizon || b.shape == Shape::kSquare)\n {\n if (mask.empty(b.bottom()+1, b.left+1))\n moveDown = true;\n }\n else\n moveDown = true;\n if (moveDown)\n {\n State next = *this;\n next.step++;\n next.blocks_[i].top++;\n func(next);\n }\n }\n\n if (b.left > 0 && mask.empty(b.top, b.left-1))\n {\n bool moveLeft = false;\n if (b.shape == Shape::kVertical || b.shape == Shape::kSquare)\n {\n if (mask.empty(b.top+1, b.left-1))\n moveLeft = true;\n }\n else\n moveLeft = true;\n if (moveLeft)\n {\n State next = *this;\n next.step++;\n next.blocks_[i].left--;\n func(next);\n }\n }\n\n if (b.right() < kColumns-1 && mask.empty(b.top, b.right()+1))\n {\n bool moveRight = false;\n if (b.shape == Shape::kVertical || b.shape == Shape::kSquare)\n {\n if (mask.empty(b.top+1, b.right()+1))\n moveRight = true;\n }\n else\n moveRight = true;\n if (moveRight)\n {\n State next = *this;\n next.step++;\n next.blocks_[i].left++;\n func(next);\n }\n }\n }\n }\n\n \/\/ std::vector<State> moves() const;\n\n Block blocks_[kBlocks];\n int step = 0;\n};\n\nint main()\n{\n printf(\"sizeof(Mask) = %zd, sizeof(State) = %zd\\n\", sizeof(Mask), sizeof(State));\n std::unordered_set<Mask> seen;\n std::deque<State> queue;\n\n State initial;\n initial.blocks_[0] = Block(Shape::kVertical, 0, 0);\n initial.blocks_[1] = Block(Shape::kSquare, 1, 0);\n initial.blocks_[2] = Block(Shape::kVertical, 3, 0);\n initial.blocks_[3] = Block(Shape::kVertical, 0, 2);\n initial.blocks_[4] = Block(Shape::kHorizon, 1, 2);\n initial.blocks_[5] = Block(Shape::kVertical, 3, 2);\n initial.blocks_[6] = Block(Shape::kSingle, 1, 3);\n initial.blocks_[7] = Block(Shape::kSingle, 2, 3);\n initial.blocks_[8] = Block(Shape::kSingle, 0, 4);\n initial.blocks_[9] = Block(Shape::kSingle, 3, 4);\n\n queue.push_back(initial);\n seen.insert(initial.toMask());\n\n while (!queue.empty())\n {\n const State curr = queue.front();\n queue.pop_front();\n\n if (curr.isSolved())\n {\n printf(\"found solution with %d steps\\n\", curr.step);\n break;\n }\n else if (curr.step > 200)\n {\n printf(\"too many steps.\\n\");\n break;\n }\n\n curr.move([&seen, &queue](const State& next) {\n auto result = seen.insert(next.toMask());\n if (result.second)\n queue.push_back(next);\n });\n\n \/\/ for (const State& next : curr.moves())\n \/\/ {\n \/\/ auto result = seen.insert(next.toMask());\n \/\/ if (result.second)\n \/\/ queue.push_back(next);\n \/\/ }\n }\n}\n<|endoftext|>"} {"text":"<commit_before>\/**********************************************************************\n * File: mainblk.c (Formerly main.c)\n * Description: Function to call from main() to setup.\n * Author:\t\t\t\t\tRay Smith\n * Created:\t\t\t\t\tTue Oct 22 11:09:40 BST 1991\n *\n * (C) Copyright 1991, Hewlett-Packard Ltd.\n ** Licensed under the Apache License, Version 2.0 (the \"License\");\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 \"fileerr.h\"\n#ifdef __UNIX__\n#include <unistd.h>\n#include <signal.h>\n#else\n#include <io.h>\n#endif\n#include <stdlib.h>\n#include \"ccutil.h\"\n\n#define VARDIR \"configs\/\" \/**< variables files *\/\n#define EXTERN\n\nconst ERRCODE NO_PATH =\n\"Warning:explicit path for executable will not be used for configs\";\nstatic const ERRCODE USAGE = \"Usage\";\n\nnamespace tesseract {\n\/**********************************************************************\n * main_setup\n *\n * Main for mithras demo program. Read the arguments and set up globals.\n **********************************************************************\/\n\n\/**\n * @brief CCUtil::main_setup - set location of tessdata and name of image\n *\n * @param argv0 - paths to the directory with language files and config files.\n * An actual value of argv0 is used if not NULL, otherwise TESSDATA_PREFIX is\n * used if not NULL, next try to use compiled in -DTESSDATA_PREFIX. If previous\n * is not sucessul - use current directory.\n * @param basename - name of image\n *\/\nvoid CCUtil::main_setup(const char *argv0, const char *basename) {\n imagebasename = basename; \/**< name of image *\/\n\n if (argv0 != NULL) {\n datadir = argv0;\n } else {\n if (getenv(\"TESSDATA_PREFIX\")) {\n datadir = getenv(\"TESSDATA_PREFIX\");\n } else {\n#ifdef TESSDATA_PREFIX\n#define _STR(a) #a\n#define _XSTR(a) _STR(a)\n datadir = _XSTR(TESSDATA_PREFIX);\n#undef _XSTR\n#undef _STR\n#endif\n }\n }\n\n \/\/ datadir may still be empty:\n if (datadir.length() == 0) {\n datadir = \".\/\";\n } else {\n \/\/ Remove tessdata from the end if present, as we will add it back!\n int length = datadir.length();\n if (length >= 8 && strcmp(&datadir[length - 8], \"tessdata\") == 0)\n datadir.truncate_at(length - 8);\n else if (length >= 9 && strcmp(&datadir[length - 9], \"tessdata\/\") == 0)\n datadir.truncate_at(length - 9);\n }\n\n \/\/ check for missing directory separator\n const char *lastchar = datadir.string();\n lastchar += datadir.length() - 1;\n if ((strcmp(lastchar, \"\/\") != 0) && (strcmp(lastchar, \"\\\\\") != 0))\n datadir += \"\/\";\n\n datadir += m_data_sub_dir; \/**< data directory *\/\n}\n} \/\/ namespace tesseract\n<commit_msg>Get tessdata prefix from executable path (only for Windows)<commit_after>\/**********************************************************************\n * File: mainblk.c (Formerly main.c)\n * Description: Function to call from main() to setup.\n * Author: Ray Smith\n * Created: Tue Oct 22 11:09:40 BST 1991\n *\n * (C) Copyright 1991, Hewlett-Packard Ltd.\n ** Licensed under the Apache License, Version 2.0 (the \"License\");\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 \"fileerr.h\"\n#ifdef __UNIX__\n#include <unistd.h>\n#include <signal.h>\n#else\n#include <io.h>\n#endif\n#include <stdlib.h>\n#include \"ccutil.h\"\n\n#define VARDIR \"configs\/\" \/**< variables files *\/\n#define EXTERN\n\nconst ERRCODE NO_PATH =\n\"Warning:explicit path for executable will not be used for configs\";\nstatic const ERRCODE USAGE = \"Usage\";\n\nnamespace tesseract {\n\/**********************************************************************\n * main_setup\n *\n * Main for mithras demo program. Read the arguments and set up globals.\n **********************************************************************\/\n\n\/**\n * @brief CCUtil::main_setup - set location of tessdata and name of image\n *\n * @param argv0 - paths to the directory with language files and config files.\n * An actual value of argv0 is used if not NULL, otherwise TESSDATA_PREFIX is\n * used if not NULL, next try to use compiled in -DTESSDATA_PREFIX. If previous\n * is not successful - use current directory.\n * @param basename - name of image\n *\/\nvoid CCUtil::main_setup(const char *argv0, const char *basename) {\n imagebasename = basename; \/**< name of image *\/\n\n char *tessdata_prefix = getenv(\"TESSDATA_PREFIX\");\n\n if (argv0 != NULL) {\n \/* Use tessdata prefix from the command line. *\/\n datadir = argv0;\n } else if (tessdata_prefix) {\n \/* Use tessdata prefix from the environment. *\/\n datadir = tessdata_prefix;\n#if defined(_WIN32)\n } else if (datadir == NULL || access(datadir.string(), 0) != 0) {\n \/* Look for tessdata in directory of executable. *\/\n static char dir[128];\n static char exe[128];\n DWORD length = GetModuleFileName(NULL, exe, sizeof(exe));\n if (length > 0 && length < sizeof(exe)) {\n _splitpath(exe, NULL, dir, NULL, NULL);\n datadir = dir;\n }\n#endif \/* _WIN32 *\/\n#if defined(TESSDATA_PREFIX)\n } else {\n \/* Use tessdata prefix which was compiled in. *\/\n#define _STR(a) #a\n#define _XSTR(a) _STR(a)\n datadir = _XSTR(TESSDATA_PREFIX);\n#undef _XSTR\n#undef _STR\n#endif\n }\n\n \/\/ datadir may still be empty:\n if (datadir.length() == 0) {\n datadir = \".\/\";\n } else {\n \/\/ Remove tessdata from the end if present, as we will add it back!\n int length = datadir.length();\n if (length >= 8 && strcmp(&datadir[length - 8], \"tessdata\") == 0)\n datadir.truncate_at(length - 8);\n else if (length >= 9 && strcmp(&datadir[length - 9], \"tessdata\/\") == 0)\n datadir.truncate_at(length - 9);\n }\n\n \/\/ check for missing directory separator\n const char *lastchar = datadir.string();\n lastchar += datadir.length() - 1;\n if ((strcmp(lastchar, \"\/\") != 0) && (strcmp(lastchar, \"\\\\\") != 0))\n datadir += \"\/\";\n\n datadir += m_data_sub_dir; \/**< data directory *\/\n}\n} \/\/ namespace tesseract\n<|endoftext|>"} {"text":"<commit_before>\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\n\/\/ SneezyMUD - All rights reserved, SneezyMUD Coding Team\n\/\/ \"task.cc\" - All functions related to tasks that keep mobs\/PCs busy\n\/\/\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n#if 0\n Batopr 8-10-96:\n to start a task, do:\n start_task(this, obj, rp, TASK_MEDITATE, arg, 0, in_room, 1, 0, 40);\n\n obj and rp can be NULL\n arg is probably \"\"\n \n timeLeft: (the first 0)\n - generally used as a counter of the number of interations of\n CMD_TASK_CONTINUE that have been encountered.\n - can be any (int) value desired \n \n in_room: (sets ch->task->was_in_room)\n - task should check current room vs this.\n reason: start the task and let my group leader move me around mud.\n\n status (the 1)\n - a ubyte.\n - some tasks set this to one value in start_task and check in\n CMD_TASK_CONTINUE status. If its not what it was initted to, do the\n continue code. at the bottom of CONTINUE, set it to some new value.\n The reason for doing this is that the first call to CMD_TASK_CONTINUE is\n almost instantaneous with when it was started.\n - probably a better way to do this would be by initing timeLeft to 0\n in start_task and incrementing it 1 for each call to CONTINUE. CONTINUE\n code would only execute if timeLeft > 0. That would free the status byte\n for use any way we want.\n\n flags:\n - an int, use depends on the task.\n\n nextUpdate:\n - NOT WHAT IT SEEMS: \n start_task() says ch->task->nextUpdate = nextUpdate.\n - calls to CMD_TASK_CONTINUE occur if pulse > ch->task->nextUpdate\n - notice that because pulse is typically big, calls to TASK CONTINUE are\n virtually instantaneous.\n - it is not until the first call to CMD_TASK_CONTINUE that we typically set\n ch->task->nextUpdate = pulse + xxxx\n - this leads to the status trick defined above.\n - SO BASICALLY, THIS VALUE IS WORTHLESS\n#endif\n\n#include \"stdsneezy.h\"\n\n\/\/FYI: CMD_TASK_CONTINUE is checked once per PULSE_MOBACT\n\ntaskData::taskData() :\n task(TASK_BOGUS),\n nextUpdate(0),\n timeLeft(0),\n orig_arg(NULL),\n wasInRoom(0),\n status(0),\n flags(0),\n obj(NULL),\n room(NULL)\n{\n}\n\ntaskData::taskData(const taskData &a) :\n task(a.task),\n nextUpdate(a.nextUpdate),\n timeLeft(a.timeLeft),\n wasInRoom(a.wasInRoom),\n status(a.status),\n flags(a.flags),\n obj(a.obj),\n room(a.room)\n{\n orig_arg = mud_str_dup(a.orig_arg);\n}\n\ntaskData & taskData::operator=(const taskData &a)\n{\n if (this == &a) return *this;\n task = a.task;\n status = a.status;\n nextUpdate = a.nextUpdate;\n timeLeft = a.timeLeft;\n flags = a.flags;\n wasInRoom = a.wasInRoom;\n obj = a.obj;\n room = a.room;\n delete [] orig_arg;\n orig_arg = mud_str_dup(a.orig_arg);\n return *this;\n}\n\ntaskData::~taskData()\n{\n delete [] orig_arg;\n orig_arg = NULL;\n\n if (obj)\n obj->setIsTaskObj(false);\n}\n\nvoid taskData::calcNextUpdate(int pulse, int interval) \n{\n nextUpdate = pulse + interval;\n nextUpdate %= 2400;\n}\n\nvoid TBeing::stopTask()\n{\n if (!task)\n return;\n\n delete [] task->orig_arg;\n task->orig_arg = NULL;\n\n if (task->obj)\n task->obj->setIsTaskObj(false);\n\n delete task;\n task = NULL;\n}\n\nint start_task(TBeing *ch, TThing *t, TRoom *rp, taskTypeT task, const char *arg, int timeLeft, ushort wasInRoom, ubyte status, int flags, int nextUpdate)\n{\n if (!ch || (ch->task)) {\n vlogf(LOG_BUG, fmt(\"%s got to bad place in start_task (%d). Tell Brutius or Batopr\") % \n (ch ? ch->getName() : \"Unknown\") % task);\n if (ch)\n ch->sendTo(\"Problem in task. Bug Brutius.\\n\\r\");\n return FALSE;\n }\n if (!(ch->task = new taskData)) {\n vlogf(LOG_BUG, fmt(\"Couldn't allocate memory in start_task for %s\") % ch->getName());\n return FALSE;\n }\n\n ch->task->orig_arg = mud_str_dup(arg);\n ch->task->obj = dynamic_cast<TObj *>(t);\n ch->task->room = rp;\n ch->task->task = task;\n ch->task->timeLeft = timeLeft;\n ch->task->wasInRoom = wasInRoom;\n ch->task->status = status;\n ch->task->flags = flags;\n ch->task->nextUpdate = nextUpdate;\n\n if (ch->task->obj)\n ch->task->obj->setIsTaskObj(true);\n\n return TRUE;\n}\n\nvoid warn_busy(TBeing *ch)\n{\n if (!ch || !(ch->task)) {\n vlogf(LOG_BUG, fmt(\"%s got to bad place in warn_busy. Tell Brutius or Batopr\") % \n (ch ? ch->getName() : \"Unknown\"));\n return;\n }\n ch->sendTo(tasks[ch->task->task].you_are_busy_msg);\n ch->sendTo(\"Type 'abort' or 'stop' to quit what you are doing.\\n\\r\");\n}\n\nint task_bogus(TBeing *ch, cmdTypeT, const char *, int , TRoom *, TObj *)\n{\n ch->sendTo(\"Um... you hit a buggy spot in the code. Tell an immort or something.\\n\\r\");\n vlogf(LOG_BUG, fmt(\"%s was busy doing a buggy task! Yikes!\") % ch->getName());\n ch->stopTask();\n\n return FALSE;\n}\n\n\/\/ first argument, the task name, should be a verb for the \"look\" commands \n\/\/ display and the stat command \nTaskEntry tasks[NUM_TASKS] =\n{\n {\"performing a bogus task\", \"You are busy doing nothing.\\n\\r\", task_bogus},\n {\"sharpening a weapon\", \"You are too busy sharpening.\\n\\r\", task_sharpening},\n {\"blacksmithing\", \"You are too busy blacksmithing.\\n\\r\", task_blacksmithing},\n {\"fixing something\", \"You are too busy fixing something.\\n\\r\", task_repair_dead},\n {\"regrowing something\", \"You are too busy regrowing something.\\n\\r\", task_repair_organic},\n {\"regrowing something\", \"You are too busy regrowing something.\\n\\r\", task_repair_wood},\n {\"fixing something\", \"You are too busy fixing something.\\n\\r\", task_repair_magical},\n {\"fixing something\", \"You are too busy fixing something.\\n\\r\", task_repair_rock},\n {\"tinkering with something\", \"You are too busy tinkering with something.\\n\\r\", task_blacksmithing_advanced},\n {\"mending\", \"You are too busy mending.\\n\\r\", task_mend_hide},\n {\"mending\", \"You are too busy mending.\\n\\r\", task_mend},\n {\"fixing something\", \"You are too busy fixing something.\\n\\r\", task_repair_spiritual},\n {\"setting a trap\", \"You are too busy setting your trap.\\n\\r\", task_trap_door},\n {\"taking items\", \"You are too busy taking items from the room.\\n\\r\", task_get},\n {\"casting a spell\", \"You are too busy casting your spell.\\n\\r\", task_spell_friends},\n {\"meditating\", \"You are too busy meditating.\\n\\r\", task_meditate},\n {\"sitting\",\"You rather like sitting.\\n\\r\",task_sit},\n {\"resting\",\"You're far too laid back at the moment.\\n\\r\",task_rest},\n {\"sleeping\",\"You're a wee bit too unconscious to try that.\\n\\r\",task_sleep},\n {\"picking a lock\", \"You don't feel like giving up on this lock just yet.\\n\\r\",task_picklock},\n {\"repenting\", \"You are too busy repenting.\\n\\r\", task_penance},\n {\"brewing\", \"You are brewing and must concentrate!\\n\\r\", task_brew},\n {\"smoothing\", \"You are too busy smoothing.\\n\\r\", task_dulling},\n {\"skinning\", \"You are too busy skinning.\\n\\r\", task_skinning},\n {\"scribing\", \"You are scribing and must concentrate!\\n\\r\", task_scribe},\n {\"setting a trap\", \"You are too busy setting your trap.\\n\\r\", task_trap_container},\n {\"setting a trap\", \"You are too busy setting your trap.\\n\\r\", task_trap_mine},\n {\"setting a trap\", \"You are too busy setting your trap.\\n\\r\", task_trap_grenade},\n {\"meditating\", \"You are too busy meditating.\\n\\r\", task_yoginsa},\n {\"attuning a symbol\", \"You are too busy attuning.\\n\\r\", task_attuning},\n {\"tracking\", \"You are too busy tracking.\\n\\r\", task_tracking},\n \/\/ Until the seekwater task is stripped from the tracking task, need to make\n \/\/ the message comply.\n \/\/ {\"tracking down someone\", \"You are too busy tracking.\\n\\r\", task_tracking},\n {\"searching for water\", \"You are too busy searching for water.\\n\\r\", task_seekwater},\n {\"searching for secret exits\", \"You are too busy searching for secret exits.\\n\\r\", task_search},\n {\"starting a fire\", \"You are too busy trying to start a fire.\\n\\r\", task_lightfire},\n {\"planting seeds\", \"You are too busy planting some seeds.\\n\\r\", task_plant},\n {\"creating something\", \"You are too busy trying to create something.\\n\\r\", task_createEngine},\n {\"charging\", \"You are too busy barreling down on someone.\\n\\r\", task_charge},\n {\"whittling\", \"You are too busy using your whittle skills.\\n\\r\", task_whittle},\n {\"stave charging\", \"You are too busy charging a stave.\\n\\r\", task_stavecharging},\n {\"in a defensive trance\", \"Not while you're in a defensive trance!\\n\\r\", task_trance_of_blades},\n {\"sacrificing\", \"Not while you are performing the sacrificial ritual of life!\\n\\r\", task_sacrifice},\n {\"fishing\", \"You are too busy fishing.\\n\\r\", task_fishing},\n {\"logging\", \"You are too busy logging.\\n\\r\", task_logging},\n {\"extinguishing\", \"You are too busy putting a fire out.\\n\\r\", task_extinguish_my_ass},\n {\"butchering\", \"You are too busy butchering a corpse.\\n\\r\", task_butchering},\n {\"cooking\", \"You are too busy cooking.\\n\\r\", task_cook},\n {\"loading a handgonne\", \"You are too busy loading your handgonne.\\n\\r\", task_handgonne_load},\n {\"loading a cannon\", \"You are too busy loading your cannon.\\n\\r\", task_cannon_load},\n {\"trapping an arrow\", \"You are too busy trapping your arrow.\\n\\r\", task_trap_arrow},\n {\"riding\", \"You are too busy riding.\\n\\r\", task_ride},\n};\n\nbool TBeing::nobrainerTaskCommand(cmdTypeT cmd)\n{\n switch (cmd) {\n case CMD_SAY:\n case CMD_SAY2:\n case CMD_GLANCE:\n case CMD_TELL:\n case CMD_SHOUT:\n case CMD_WEATHER:\n case CMD_INVENTORY:\n case CMD_EQUIPMENT:\n case CMD_SMILE:\n case CMD_SHAKE:\n case CMD_NOD:\n case CMD_GT:\n case CMD_WIZNET:\n case CMD_REPLY:\n return TRUE;\n default:\n return FALSE;\n }\n}\n\nbool TBeing::utilityTaskCommand(cmdTypeT cmd)\n{\n switch (cmd) {\n case CMD_EQUIPMENT:\n case CMD_WIZLIST:\n case CMD_LOOK:\n case CMD_LIMBS: \/\/ not realistic, but let's just be nice\n case CMD_SPELLS:\n case CMD_RITUALS:\n case CMD_GLANCE:\n case CMD_TIME:\n case CMD_SCORE:\n case CMD_TROPHY:\n case CMD_HELP:\n case CMD_ZONES:\n case CMD_WHO:\n case CMD_NEWS:\n case CMD_CREDITS:\n case CMD_WIZNEWS:\n case CMD_SAVE:\n case CMD_IDEA:\n case CMD_TYPO:\n case CMD_BUG:\n case CMD_LEVELS:\n case CMD_ATTRIBUTE:\n case CMD_WORLD:\n case CMD_CLS:\n case CMD_PROMPT:\n case CMD_ALIAS:\n case CMD_CLEAR:\n case CMD_HISTORY:\n case CMD_COLOR:\n case CMD_MOTD:\n case CMD_TITLE:\n case CMD_PRACTICE:\n case CMD_NOSHOUT:\n case CMD_DESCRIPTION:\n case CMD_LIST: \/\/ for list faction\n case CMD_ATTACK:\n case CMD_GROUP:\n case CMD_AFK:\n case CMD_WEATHER:\n case CMD_TOGGLE:\n return TRUE;\n default:\n return FALSE;\n }\n}\n\n\n\n\n\n<commit_msg>-fixed a small issue with task processing with the GET_ALL tasking. Since it doesnt use the standard tasking pump, ive removed object tracking. Please report any bugs found which involve \"get all\", deleting an object, and a crash.<commit_after>\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\n\/\/ SneezyMUD - All rights reserved, SneezyMUD Coding Team\n\/\/ \"task.cc\" - All functions related to tasks that keep mobs\/PCs busy\n\/\/\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n#if 0\n Batopr 8-10-96:\n to start a task, do:\n start_task(this, obj, rp, TASK_MEDITATE, arg, 0, in_room, 1, 0, 40);\n\n obj and rp can be NULL\n arg is probably \"\"\n \n timeLeft: (the first 0)\n - generally used as a counter of the number of interations of\n CMD_TASK_CONTINUE that have been encountered.\n - can be any (int) value desired \n \n in_room: (sets ch->task->was_in_room)\n - task should check current room vs this.\n reason: start the task and let my group leader move me around mud.\n\n status (the 1)\n - a ubyte.\n - some tasks set this to one value in start_task and check in\n CMD_TASK_CONTINUE status. If its not what it was initted to, do the\n continue code. at the bottom of CONTINUE, set it to some new value.\n The reason for doing this is that the first call to CMD_TASK_CONTINUE is\n almost instantaneous with when it was started.\n - probably a better way to do this would be by initing timeLeft to 0\n in start_task and incrementing it 1 for each call to CONTINUE. CONTINUE\n code would only execute if timeLeft > 0. That would free the status byte\n for use any way we want.\n\n flags:\n - an int, use depends on the task.\n\n nextUpdate:\n - NOT WHAT IT SEEMS: \n start_task() says ch->task->nextUpdate = nextUpdate.\n - calls to CMD_TASK_CONTINUE occur if pulse > ch->task->nextUpdate\n - notice that because pulse is typically big, calls to TASK CONTINUE are\n virtually instantaneous.\n - it is not until the first call to CMD_TASK_CONTINUE that we typically set\n ch->task->nextUpdate = pulse + xxxx\n - this leads to the status trick defined above.\n - SO BASICALLY, THIS VALUE IS WORTHLESS\n#endif\n\n#include \"stdsneezy.h\"\n\n\/\/FYI: CMD_TASK_CONTINUE is checked once per PULSE_MOBACT\n\ntaskData::taskData() :\n task(TASK_BOGUS),\n nextUpdate(0),\n timeLeft(0),\n orig_arg(NULL),\n wasInRoom(0),\n status(0),\n flags(0),\n obj(NULL),\n room(NULL)\n{\n}\n\ntaskData::taskData(const taskData &a) :\n task(a.task),\n nextUpdate(a.nextUpdate),\n timeLeft(a.timeLeft),\n wasInRoom(a.wasInRoom),\n status(a.status),\n flags(a.flags),\n obj(a.obj),\n room(a.room)\n{\n orig_arg = mud_str_dup(a.orig_arg);\n}\n\ntaskData & taskData::operator=(const taskData &a)\n{\n if (this == &a) return *this;\n task = a.task;\n status = a.status;\n nextUpdate = a.nextUpdate;\n timeLeft = a.timeLeft;\n flags = a.flags;\n wasInRoom = a.wasInRoom;\n obj = a.obj;\n room = a.room;\n delete [] orig_arg;\n orig_arg = mud_str_dup(a.orig_arg);\n return *this;\n}\n\ntaskData::~taskData()\n{\n delete [] orig_arg;\n orig_arg = NULL;\n\n if (obj)\n obj->setIsTaskObj(false);\n}\n\nvoid taskData::calcNextUpdate(int pulse, int interval) \n{\n nextUpdate = pulse + interval;\n nextUpdate %= 2400;\n}\n\nvoid TBeing::stopTask()\n{\n if (!task)\n return;\n\n delete [] task->orig_arg;\n task->orig_arg = NULL;\n\n if (task->obj)\n task->obj->setIsTaskObj(false);\n\n delete task;\n task = NULL;\n}\n\nint start_task(TBeing *ch, TThing *t, TRoom *rp, taskTypeT task, const char *arg, int timeLeft, ushort wasInRoom, ubyte status, int flags, int nextUpdate)\n{\n if (!ch || (ch->task)) {\n vlogf(LOG_BUG, fmt(\"%s got to bad place in start_task (%d). Tell Brutius or Batopr\") % \n (ch ? ch->getName() : \"Unknown\") % task);\n if (ch)\n ch->sendTo(\"Problem in task. Bug Brutius.\\n\\r\");\n return FALSE;\n }\n if (!(ch->task = new taskData)) {\n vlogf(LOG_BUG, fmt(\"Couldn't allocate memory in start_task for %s\") % ch->getName());\n return FALSE;\n }\n\n ch->task->orig_arg = mud_str_dup(arg);\n ch->task->obj = dynamic_cast<TObj *>(t);\n ch->task->room = rp;\n ch->task->task = task;\n ch->task->timeLeft = timeLeft;\n ch->task->wasInRoom = wasInRoom;\n ch->task->status = status;\n ch->task->flags = flags;\n ch->task->nextUpdate = nextUpdate;\n\n \/\/ TASK_GET_ALL is wierd and doesn't use standard tasking processing - skip tracking of objs\n if (task != TASK_GET_ALL && ch->task->obj)\n ch->task->obj->setIsTaskObj(true);\n\n return TRUE;\n}\n\nvoid warn_busy(TBeing *ch)\n{\n if (!ch || !(ch->task)) {\n vlogf(LOG_BUG, fmt(\"%s got to bad place in warn_busy. Tell Brutius or Batopr\") % \n (ch ? ch->getName() : \"Unknown\"));\n return;\n }\n ch->sendTo(tasks[ch->task->task].you_are_busy_msg);\n ch->sendTo(\"Type 'abort' or 'stop' to quit what you are doing.\\n\\r\");\n}\n\nint task_bogus(TBeing *ch, cmdTypeT, const char *, int , TRoom *, TObj *)\n{\n ch->sendTo(\"Um... you hit a buggy spot in the code. Tell an immort or something.\\n\\r\");\n vlogf(LOG_BUG, fmt(\"%s was busy doing a buggy task! Yikes!\") % ch->getName());\n ch->stopTask();\n\n return FALSE;\n}\n\n\/\/ first argument, the task name, should be a verb for the \"look\" commands \n\/\/ display and the stat command \nTaskEntry tasks[NUM_TASKS] =\n{\n {\"performing a bogus task\", \"You are busy doing nothing.\\n\\r\", task_bogus},\n {\"sharpening a weapon\", \"You are too busy sharpening.\\n\\r\", task_sharpening},\n {\"blacksmithing\", \"You are too busy blacksmithing.\\n\\r\", task_blacksmithing},\n {\"fixing something\", \"You are too busy fixing something.\\n\\r\", task_repair_dead},\n {\"regrowing something\", \"You are too busy regrowing something.\\n\\r\", task_repair_organic},\n {\"regrowing something\", \"You are too busy regrowing something.\\n\\r\", task_repair_wood},\n {\"fixing something\", \"You are too busy fixing something.\\n\\r\", task_repair_magical},\n {\"fixing something\", \"You are too busy fixing something.\\n\\r\", task_repair_rock},\n {\"tinkering with something\", \"You are too busy tinkering with something.\\n\\r\", task_blacksmithing_advanced},\n {\"mending\", \"You are too busy mending.\\n\\r\", task_mend_hide},\n {\"mending\", \"You are too busy mending.\\n\\r\", task_mend},\n {\"fixing something\", \"You are too busy fixing something.\\n\\r\", task_repair_spiritual},\n {\"setting a trap\", \"You are too busy setting your trap.\\n\\r\", task_trap_door},\n {\"taking items\", \"You are too busy taking items from the room.\\n\\r\", task_get},\n {\"casting a spell\", \"You are too busy casting your spell.\\n\\r\", task_spell_friends},\n {\"meditating\", \"You are too busy meditating.\\n\\r\", task_meditate},\n {\"sitting\",\"You rather like sitting.\\n\\r\",task_sit},\n {\"resting\",\"You're far too laid back at the moment.\\n\\r\",task_rest},\n {\"sleeping\",\"You're a wee bit too unconscious to try that.\\n\\r\",task_sleep},\n {\"picking a lock\", \"You don't feel like giving up on this lock just yet.\\n\\r\",task_picklock},\n {\"repenting\", \"You are too busy repenting.\\n\\r\", task_penance},\n {\"brewing\", \"You are brewing and must concentrate!\\n\\r\", task_brew},\n {\"smoothing\", \"You are too busy smoothing.\\n\\r\", task_dulling},\n {\"skinning\", \"You are too busy skinning.\\n\\r\", task_skinning},\n {\"scribing\", \"You are scribing and must concentrate!\\n\\r\", task_scribe},\n {\"setting a trap\", \"You are too busy setting your trap.\\n\\r\", task_trap_container},\n {\"setting a trap\", \"You are too busy setting your trap.\\n\\r\", task_trap_mine},\n {\"setting a trap\", \"You are too busy setting your trap.\\n\\r\", task_trap_grenade},\n {\"meditating\", \"You are too busy meditating.\\n\\r\", task_yoginsa},\n {\"attuning a symbol\", \"You are too busy attuning.\\n\\r\", task_attuning},\n {\"tracking\", \"You are too busy tracking.\\n\\r\", task_tracking},\n \/\/ Until the seekwater task is stripped from the tracking task, need to make\n \/\/ the message comply.\n \/\/ {\"tracking down someone\", \"You are too busy tracking.\\n\\r\", task_tracking},\n {\"searching for water\", \"You are too busy searching for water.\\n\\r\", task_seekwater},\n {\"searching for secret exits\", \"You are too busy searching for secret exits.\\n\\r\", task_search},\n {\"starting a fire\", \"You are too busy trying to start a fire.\\n\\r\", task_lightfire},\n {\"planting seeds\", \"You are too busy planting some seeds.\\n\\r\", task_plant},\n {\"creating something\", \"You are too busy trying to create something.\\n\\r\", task_createEngine},\n {\"charging\", \"You are too busy barreling down on someone.\\n\\r\", task_charge},\n {\"whittling\", \"You are too busy using your whittle skills.\\n\\r\", task_whittle},\n {\"stave charging\", \"You are too busy charging a stave.\\n\\r\", task_stavecharging},\n {\"in a defensive trance\", \"Not while you're in a defensive trance!\\n\\r\", task_trance_of_blades},\n {\"sacrificing\", \"Not while you are performing the sacrificial ritual of life!\\n\\r\", task_sacrifice},\n {\"fishing\", \"You are too busy fishing.\\n\\r\", task_fishing},\n {\"logging\", \"You are too busy logging.\\n\\r\", task_logging},\n {\"extinguishing\", \"You are too busy putting a fire out.\\n\\r\", task_extinguish_my_ass},\n {\"butchering\", \"You are too busy butchering a corpse.\\n\\r\", task_butchering},\n {\"cooking\", \"You are too busy cooking.\\n\\r\", task_cook},\n {\"loading a handgonne\", \"You are too busy loading your handgonne.\\n\\r\", task_handgonne_load},\n {\"loading a cannon\", \"You are too busy loading your cannon.\\n\\r\", task_cannon_load},\n {\"trapping an arrow\", \"You are too busy trapping your arrow.\\n\\r\", task_trap_arrow},\n {\"riding\", \"You are too busy riding.\\n\\r\", task_ride},\n};\n\nbool TBeing::nobrainerTaskCommand(cmdTypeT cmd)\n{\n switch (cmd) {\n case CMD_SAY:\n case CMD_SAY2:\n case CMD_GLANCE:\n case CMD_TELL:\n case CMD_SHOUT:\n case CMD_WEATHER:\n case CMD_INVENTORY:\n case CMD_EQUIPMENT:\n case CMD_SMILE:\n case CMD_SHAKE:\n case CMD_NOD:\n case CMD_GT:\n case CMD_WIZNET:\n case CMD_REPLY:\n return TRUE;\n default:\n return FALSE;\n }\n}\n\nbool TBeing::utilityTaskCommand(cmdTypeT cmd)\n{\n switch (cmd) {\n case CMD_EQUIPMENT:\n case CMD_WIZLIST:\n case CMD_LOOK:\n case CMD_LIMBS: \/\/ not realistic, but let's just be nice\n case CMD_SPELLS:\n case CMD_RITUALS:\n case CMD_GLANCE:\n case CMD_TIME:\n case CMD_SCORE:\n case CMD_TROPHY:\n case CMD_HELP:\n case CMD_ZONES:\n case CMD_WHO:\n case CMD_NEWS:\n case CMD_CREDITS:\n case CMD_WIZNEWS:\n case CMD_SAVE:\n case CMD_IDEA:\n case CMD_TYPO:\n case CMD_BUG:\n case CMD_LEVELS:\n case CMD_ATTRIBUTE:\n case CMD_WORLD:\n case CMD_CLS:\n case CMD_PROMPT:\n case CMD_ALIAS:\n case CMD_CLEAR:\n case CMD_HISTORY:\n case CMD_COLOR:\n case CMD_MOTD:\n case CMD_TITLE:\n case CMD_PRACTICE:\n case CMD_NOSHOUT:\n case CMD_DESCRIPTION:\n case CMD_LIST: \/\/ for list faction\n case CMD_ATTACK:\n case CMD_GROUP:\n case CMD_AFK:\n case CMD_WEATHER:\n case CMD_TOGGLE:\n return TRUE;\n default:\n return FALSE;\n }\n}\n\n\n\n\n\n<|endoftext|>"} {"text":"<commit_before>\/*\n * Software License Agreement (BSD License)\n *\n * Copyright (c) 2011, The MITRE Corporation\n * All rights reserved.\n *\n * Redistribution and use in source and binary forms, with or without\n * modification, are permitted provided that the following conditions\n * are met:\n *\n * * Redistributions of source code 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: Keven Ring <keven@mitre.org>\n *\/\n\n#include <pcl\/point_cloud.h>\n#include <pcl\/point_types.h>\n#include <pcl\/common\/time.h> \/\/fps calculations\n#include <pcl\/io\/hdl_grabber.h>\n#include <pcl\/visualization\/point_cloud_color_handlers.h>\n#include <pcl\/visualization\/cloud_viewer.h>\n#include <pcl\/visualization\/image_viewer.h>\n#include <pcl\/io\/openni_camera\/openni_driver.h>\n#include <pcl\/console\/parse.h>\n#include <pcl\/visualization\/boost.h>\n#include <pcl\/visualization\/mouse_event.h>\n#include <vector>\n#include <string>\n#include <boost\/algorithm\/string.hpp>\n#include <typeinfo>\n\nusing namespace std;\nusing namespace pcl;\nusing namespace pcl::console;\nusing namespace pcl::visualization;\n\n#define SHOW_FPS 0\n#if SHOW_FPS\n#define FPS_CALC(_WHAT_) \\\ndo \\\n{ \\\n static unsigned count = 0;\\\n static double last = getTime ();\\\n double now = getTime (); \\\n ++count; \\\n if (now - last >= 1.0) \\\n { \\\n std::cout << \"Average framerate(\"<< _WHAT_ << \"): \" << double(count)\/double(now - last) << \" Hz\" << std::endl; \\\n count = 0; \\\n last = now; \\\n } \\\n}while(false)\n#else\n#define FPS_CALC(_WHAT_) \\\ndo \\\n{ \\\n}while(false)\n#endif\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\ntemplate<typename PointType>\nclass SimpleHDLViewer\n{\n public:\n typedef PointCloud<PointType> Cloud;\n typedef typename Cloud::ConstPtr CloudConstPtr;\n\n SimpleHDLViewer (Grabber& grabber,\n PointCloudColorHandler<PointType> &handler) \n : cloud_viewer_ (new PCLVisualizer (\"PCL HDL Cloud\"))\n , grabber_ (grabber)\n , handler_ (handler)\n {\n }\n\n void \n cloud_callback (const CloudConstPtr& cloud)\n {\n FPS_CALC (\"cloud callback\");\n boost::mutex::scoped_lock lock (cloud_mutex_);\n cloud_ = cloud;\n \/\/std::cout << cloud->points[0] << \" \" << cloud->size () << std::endl;\n }\n\n void \n cloud_callback (const CloudConstPtr& cloud, float startAngle,\n float endAngle)\n {\n FPS_CALC (\"cloud callback\");\n boost::mutex::scoped_lock lock (cloud_mutex_);\n cloud_ = cloud;\n }\n\n void \n keyboard_callback (const KeyboardEvent& event,\n void* cookie)\n {\n if (event.keyUp ())\n {\n return;\n }\n }\n\n void \n mouse_callback (const MouseEvent& mouse_event,\n void* cookie)\n {\n if (mouse_event.getType () == MouseEvent::MouseButtonPress && \n mouse_event.getButton () == MouseEvent::LeftButton)\n {\n cout << mouse_event.getX () << \" , \" << mouse_event.getY () << endl;\n }\n }\n\n void \n run ()\n {\n cloud_viewer_->addCoordinateSystem (3.0);\n cloud_viewer_->setBackgroundColor (0, 0, 0);\n cloud_viewer_->initCameraParameters ();\n cloud_viewer_->setCameraPosition (0.0, 0.0, 30.0, 0.0, 1.0, 0.0, 0);\n cloud_viewer_->setCameraClipDistances (0.0, 50.0);\n \/\/cloud_viewer_->registerMouseCallback(&SimpleHDLViewer::mouse_callback, *this);\n \/\/cloud_viewer_->registerKeyboardCallback (&SimpleHDLViewer::keyboard_callback, *this);\n\n \/\/boost::function<void(const CloudConstPtr&, float, float)> cloud_cb = boost::bind(&SimpleHDLViewer::cloud_callback, this, _1, _2, _3);\n boost::function<void (const CloudConstPtr&)> cloud_cb = boost::bind (\n &SimpleHDLViewer::cloud_callback, this, _1);\n boost::signals2::connection cloud_connection = grabber_.registerCallback (\n cloud_cb);\n\n grabber_.start ();\n\n while (!cloud_viewer_->wasStopped ())\n {\n CloudConstPtr cloud;\n\n \/\/ See if we can get a cloud\n if (cloud_mutex_.try_lock ())\n {\n cloud_.swap (cloud);\n cloud_mutex_.unlock ();\n }\n\n if (cloud)\n {\n FPS_CALC(\"drawing cloud\");\n handler_.setInputCloud (cloud);\n if (!cloud_viewer_->updatePointCloud (cloud, handler_, \"HDL\"))\n cloud_viewer_->addPointCloud (cloud, handler_, \"HDL\");\n\n cloud_viewer_->spinOnce ();\n }\n\n if (!grabber_.isRunning ())\n cloud_viewer_->spin ();\n\n boost::this_thread::sleep (boost::posix_time::microseconds (100));\n }\n\n grabber_.stop ();\n\n cloud_connection.disconnect ();\n }\n\n boost::shared_ptr<PCLVisualizer> cloud_viewer_;\n boost::shared_ptr<ImageViewer> image_viewer_;\n\n Grabber& grabber_;\n boost::mutex cloud_mutex_;\n boost::mutex image_mutex_;\n\n CloudConstPtr cloud_;\n PointCloudColorHandler<PointType> &handler_;\n};\n\nvoid\nusage (char ** argv)\n{\n cout << \"usage: \" << argv[0]\n << \" [-hdlCalibration <path-to-calibration-file>] [-pcapFile <path-to-pcap-file>] [-h | --help] [-format XYZ(default)|XYZI|XYZRGB]\"\n << endl;\n cout << argv[0] << \" -h | --help : shows this help\" << endl;\n return;\n}\n\nint \nmain (int argc, char ** argv)\n{\n std::string hdlCalibration, pcapFile, format (\"XYZ\");\n\n if (find_switch (argc, argv, \"-h\") || \n find_switch (argc, argv, \"--help\"))\n {\n usage (argv);\n return (0);\n }\n\n parse_argument (argc, argv, \"-calibrationFile\", hdlCalibration);\n parse_argument (argc, argv, \"-pcapFile\", pcapFile);\n parse_argument (argc, argv, \"-format\", format);\n\n HDLGrabber grabber (hdlCalibration, pcapFile);\n\n if (boost::iequals (format, std::string (\"XYZ\")))\n {\n std::vector<double> fcolor (3); fcolor[0] = fcolor[1] = fcolor[2] = 255.0;\n pcl::console::parse_3x_arguments (argc, argv, \"-fc\", fcolor[0], fcolor[1], fcolor[2]);\n PointCloudColorHandlerCustom<PointXYZ> color_handler (fcolor[0], fcolor[1], fcolor[2]);\n\n SimpleHDLViewer<PointXYZ> v (grabber, color_handler);\n v.run ();\n }\n else if (boost::iequals (format, std::string (\"XYZI\")))\n {\n PointCloudColorHandlerGenericField<PointXYZI> color_handler (\"intensity\");\n\n SimpleHDLViewer<PointXYZI> v (grabber, color_handler);\n v.run ();\n }\n else if (boost::iequals (format, std::string (\"XYZRGB\")))\n {\n PointCloudColorHandlerRGBField<PointXYZRGBA> color_handler;\n\n SimpleHDLViewer<PointXYZRGBA> v (grabber, color_handler);\n v.run ();\n }\n return (0);\n}\n\n<commit_msg>sample test<commit_after>\/*\n * Software License Agreement (BSD License)\n *\n * Copyright (c) 2011, The MITRE Corporation\n * All rights reserved.\n *\n * Redistribution and use in source and binary forms, with or without\n * modification, are permitted provided that the following conditions\n * are met:\n *\n * * Redistributions of source code 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: Keven Ring <keven@mitre.org>\n *\/\n\n#include <pcl\/point_cloud.h>\n#include <pcl\/point_types.h>\n#include <pcl\/common\/time.h> \/\/fps calculations\n#include <pcl\/io\/hdl_grabber.h>\n#include <pcl\/visualization\/point_cloud_color_handlers.h>\n#include <pcl\/visualization\/cloud_viewer.h>\n#include <pcl\/visualization\/image_viewer.h>\n#include <pcl\/io\/openni_camera\/openni_driver.h>\n#include <pcl\/console\/parse.h>\n#include <pcl\/visualization\/boost.h>\n#include <pcl\/visualization\/mouse_event.h>\n#include <vector>\n#include <string>\n#include <boost\/algorithm\/string.hpp>\n#include <typeinfo>\n\nusing namespace std;\nusing namespace pcl;\nusing namespace pcl::console;\nusing namespace pcl::visualization;\n\n#define SHOW_FPS 0\n#if SHOW_FPS\n#define FPS_CALC(_WHAT_) \\\ndo \\\n{ \\\n static unsigned count = 0;\\\n static double last = getTime ();\\\n double now = getTime (); \\\n ++count; \\\n if (now - last >= 1.0) \\\n { \\\n std::cout << \"Average framerate(\"<< _WHAT_ << \"): \" << double(count)\/double(now - last) << \" Hz\" << std::endl; \\\n count = 0; \\\n last = now; \\\n } \\\n}while(false)\n#else\n#define FPS_CALC(_WHAT_) \\\ndo \\\n{ \\\n}while(false)\n#endif\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\ntemplate<typename PointType>\nclass SimpleHDLViewer\n{\n public:\n typedef PointCloud<PointType> Cloud;\n typedef typename Cloud::ConstPtr CloudConstPtr;\n\n SimpleHDLViewer (Grabber& grabber,\n PointCloudColorHandler<PointType> &handler) \n : cloud_viewer_ (new PCLVisualizer (\"PCL HDL Cloud\"))\n , grabber_ (grabber)\n , handler_ (handler)\n {\n }\n\n void \n cloud_callback (const CloudConstPtr& cloud)\n {\n FPS_CALC (\"cloud callback\");\n boost::mutex::scoped_lock lock (cloud_mutex_);\n cloud_ = cloud;\n \/\/std::cout << cloud->points[0] << \" \" << cloud->size () << std::endl;\n }\n\n void \n cloud_callback (const CloudConstPtr& cloud, float startAngle,\n float endAngle)\n {\n FPS_CALC (\"cloud callback\");\n boost::mutex::scoped_lock lock (cloud_mutex_);\n cloud_ = cloud;\n }\n\n void \n keyboard_callback (const KeyboardEvent& event,\n void* cookie)\n {\n if (event.keyUp ())\n {\n return;\n }\n }\n\n void \n mouse_callback (const MouseEvent& mouse_event,\n void* cookie)\n {\n if (mouse_event.getType () == MouseEvent::MouseButtonPress && \n mouse_event.getButton () == MouseEvent::LeftButton)\n {\n cout << mouse_event.getX () << \" , \" << mouse_event.getY () << endl;\n }\n }\n\n void \n run ()\n {\n cloud_viewer_->addCoordinateSystem (3.0);\n cloud_viewer_->setBackgroundColor (0, 0, 0);\n cloud_viewer_->initCameraParameters ();\n cloud_viewer_->setCameraPosition (0.0, 0.0, 30.0, 0.0, 1.0, 0.0, 0);\n cloud_viewer_->setCameraClipDistances (0.0, 50.0);\n \/\/cloud_viewer_->registerMouseCallback(&SimpleHDLViewer::mouse_callback, *this);\n \/\/cloud_viewer_->registerKeyboardCallback (&SimpleHDLViewer::keyboard_callback, *this);\n\n \/\/boost::function<void(const CloudConstPtr&, float, float)> cloud_cb = boost::bind(&SimpleHDLViewer::cloud_callback, this, _1, _2, _3);\n boost::function<void (const CloudConstPtr&)> cloud_cb = boost::bind (\n &SimpleHDLViewer::cloud_callback, this, _1);\n boost::signals2::connection cloud_connection = grabber_.registerCallback (\n cloud_cb);\n\n grabber_.start ();\n\n while (!cloud_viewer_->wasStopped ())\n {\n CloudConstPtr cloud;\n\n \/\/ See if we can get a cloud\n if (cloud_mutex_.try_lock ())\n {\n cloud_.swap (cloud);\n cloud_mutex_.unlock ();\n }\n\n if (cloud)\n {\n FPS_CALC(\"drawing cloud\");\n handler_.setInputCloud (cloud);\n if (!cloud_viewer_->updatePointCloud (cloud, handler_, \"HDL\"))\n cloud_viewer_->addPointCloud (cloud, handler_, \"HDL\");\n\n cloud_viewer_->spinOnce ();\n }\n\n if (!grabber_.isRunning ())\n cloud_viewer_->spin ();\n\n boost::this_thread::sleep (boost::posix_time::microseconds (100));\n }\n\n grabber_.stop ();\n\n cloud_connection.disconnect ();\n }\n\n boost::shared_ptr<PCLVisualizer> cloud_viewer_;\n boost::shared_ptr<ImageViewer> image_viewer_;\n\n Grabber& grabber_;\n boost::mutex cloud_mutex_;\n boost::mutex image_mutex_;\n\n CloudConstPtr cloud_;\n PointCloudColorHandler<PointType> &handler_;\n};\n\nvoid\nusage (char ** argv)\n{\n cout << \"usage: \" << argv[0]\n << \" [-hdlCalibration <path-to-calibration-file>] [-pcapFile <path-to-pcap-file>] [-h | --help] [-format XYZ(default)|XYZI|XYZRGB]\"\n << endl;\n cout << argv[0] << \" -h | --help : shows this help\" << endl;\n return;\n}\n\nint \nmain (int argc, char ** argv)\n{\n std::string hdlCalibration, pcapFile, format (\"XYZ\");\n\n if (find_switch (argc, argv, \"-h\") || \n find_switch (argc, argv, \"--help\"))\n {\n usage (argv);\n return (0);\n }\n\n parse_argument (argc, argv, \"-calibrationFile\", hdlCalibration);\n parse_argument (argc, argv, \"-pcapFile\", pcapFile);\n parse_argument (argc, argv, \"-format\", format);\n\n HDLGrabber grabber (hdlCalibration, pcapFile);\n\n cout << format << endl;\n if (boost::iequals (format, std::string (\"XYZ\")))\n {\n std::vector<double> fcolor (3); fcolor[0] = fcolor[1] = fcolor[2] = 255.0;\n pcl::console::parse_3x_arguments (argc, argv, \"-fc\", fcolor[0], fcolor[1], fcolor[2]);\n PointCloudColorHandlerCustom<PointXYZ> color_handler (fcolor[0], fcolor[1], fcolor[2]);\n\n SimpleHDLViewer<PointXYZ> v (grabber, color_handler);\n v.run ();\n }\n else if (boost::iequals (format, std::string (\"XYZI\")))\n {\n PointCloudColorHandlerGenericField<PointXYZI> color_handler (\"intensity\");\n\n SimpleHDLViewer<PointXYZI> v (grabber, color_handler);\n v.run ();\n }\n else if (boost::iequals (format, std::string (\"XYZRGB\")))\n {\n PointCloudColorHandlerRGBField<PointXYZRGBA> color_handler;\n\n SimpleHDLViewer<PointXYZRGBA> v (grabber, color_handler);\n v.run ();\n }\n return (0);\n}\n\n<|endoftext|>"} {"text":"<commit_before>#include \"doocore\/io\/EasyTuple.h\"\r\n\r\n\/\/ from STL\r\n#include <string>\r\n#include <sstream>\r\n#include <vector>\r\n\r\n\/\/ from Boost\r\n#include <boost\/assign\/std\/vector.hpp>\r\nusing namespace boost::assign;\r\n\r\n\/\/ from ROOT\r\n#include \"TFile.h\"\r\n#include \"TTree.h\"\r\n\r\n\/\/ from RooFit\r\n#include \"RooArgSet.h\"\r\n#include \"RooLinkedListIter.h\"\r\n#include \"RooAbsArg.h\"\r\n#include \"RooDataSet.h\"\r\n#include \"RooFormulaVar.h\"\r\n#include \"RooCategory.h\"\r\n#include \"RooRealVar.h\"\r\n#include \"RooCmdArg.h\"\r\n\r\n\/\/ from project\r\n#include \"doocore\/io\/MsgStream.h\"\r\n\r\nusing namespace ROOT;\r\nusing namespace RooFit;\r\n\r\ndoocore::io::EasyTuple::EasyTuple(const std::string& file_name, const std::string& tree_name, const RooArgSet& argset)\r\n: file_(NULL),\r\n tree_(NULL),\r\n argset_(NULL),\r\n dataset_(NULL),\r\n tree_name_(tree_name),\r\n num_maximum_events_(-1),\r\n cut_variable_range_(kCutExclusive)\r\n{\r\n file_ = new TFile(file_name.c_str());\r\n argset_ = new RooArgSet(argset);\r\n \r\n if (file_ == NULL || file_->IsZombie() || file_->GetNkeys() <= 0) {\r\n serr << \"File \" << file_name << \" could not be opened properly.\" << endmsg;\r\n throw 1;\r\n }\r\n \r\n tree_ = dynamic_cast<TTree*>(file_->Get(tree_name.c_str()));\r\n if (tree_ == NULL) {\r\n serr << \"Tree \" << tree_name << \" could not be opened properly.\" << endmsg;\r\n throw 2;\r\n }\r\n \r\n if (argset.getSize() > 0) tree_->SetBranchStatus(\"*\", 0);\r\n \r\n RooLinkedListIter* it = (RooLinkedListIter*)argset.createIterator();\r\n RooAbsArg* arg = NULL;\r\n \r\n while ((arg=(RooAbsArg*)it->Next())) {\r\n RooRealVar* var = dynamic_cast<RooRealVar*>(arg);\r\n RooCategory* cat = dynamic_cast<RooCategory*>(arg);\r\n \r\n if (var != NULL || cat != NULL) {\r\n if (tree_->GetBranch(arg->GetName()) == NULL) {\r\n swarn << \"Branch \" << arg->GetName() << \" not in tree. Ignoring.\" << endmsg;\r\n } else {\r\n tree_->SetBranchStatus(arg->GetName(), 1);\r\n }\r\n }\r\n }\r\n delete it;\r\n}\r\n\r\ndoocore::io::EasyTuple::EasyTuple(TTree* tree, const RooArgSet& argset)\r\n: file_(NULL),\r\ntree_(tree),\r\nargset_(NULL),\r\ndataset_(NULL),\r\nnum_maximum_events_(-1),\r\ncut_variable_range_(kCutExclusive)\r\n{\r\n argset_ = new RooArgSet(argset);\r\n \r\n if (argset.getSize() > 0) tree_->SetBranchStatus(\"*\", 0);\r\n \r\n RooLinkedListIter* it = (RooLinkedListIter*)argset.createIterator();\r\n RooAbsArg* arg = NULL;\r\n \r\n while ((arg=(RooAbsArg*)it->Next())) {\r\n RooRealVar* var = dynamic_cast<RooRealVar*>(arg);\r\n RooCategory* cat = dynamic_cast<RooCategory*>(arg);\r\n \r\n if (var != NULL || cat != NULL) {\r\n if (tree_->GetBranch(arg->GetName()) == NULL) {\r\n swarn << \"Branch \" << arg->GetName() << \" not in tree. Ignoring.\" << endmsg;\r\n } else {\r\n tree_->SetBranchStatus(arg->GetName(), 1);\r\n }\r\n }\r\n }\r\n delete it;\r\n}\r\n\r\ndoocore::io::EasyTuple::EasyTuple(const EasyTuple& other)\r\n: file_(NULL),\r\ntree_(NULL),\r\nargset_(NULL),\r\ndataset_(NULL),\r\ntree_name_(other.tree_name_),\r\nnum_maximum_events_(other.num_maximum_events_),\r\ncut_variable_range_(other.cut_variable_range_)\r\n{\r\n argset_ = new RooArgSet(*other.argset_);\r\n \r\n if (other.file_ == NULL) {\r\n tree_ = other.tree_;\r\n } else {\r\n file_ = new TFile(other.file_->GetName());\r\n \r\n if (file_ == NULL || file_->IsZombie() || file_->GetNkeys() <= 0) {\r\n serr << \"File could not be opened properly.\" << endmsg;\r\n throw 1;\r\n }\r\n \r\n tree_ = dynamic_cast<TTree*>(file_->Get(tree_name_.c_str()));\r\n if (tree_ == NULL) {\r\n serr << \"Tree \" << tree_name_ << \" could not be opened properly.\" << endmsg;\r\n throw 2;\r\n }\r\n \r\n if (argset_->getSize() > 0) tree_->SetBranchStatus(\"*\", 0);\r\n \r\n RooLinkedListIter* it = (RooLinkedListIter*)argset_->createIterator();\r\n RooAbsArg* arg = NULL;\r\n \r\n while ((arg=(RooAbsArg*)it->Next())) {\r\n RooRealVar* var = dynamic_cast<RooRealVar*>(arg);\r\n RooCategory* cat = dynamic_cast<RooCategory*>(arg);\r\n \r\n if (var != NULL || cat != NULL) {\r\n if (tree_->GetBranch(arg->GetName()) == NULL) {\r\n swarn << \"Branch \" << arg->GetName() << \" not in tree. Ignoring.\" << endmsg;\r\n } else {\r\n tree_->SetBranchStatus(arg->GetName(), 1);\r\n }\r\n }\r\n }\r\n delete it;\r\n\r\n if (num_maximum_events_>=0) {\r\n set_num_maximum_events(num_maximum_events_);\r\n }\r\n \r\n if (other.dataset_ != NULL) {\r\n dataset_ = new RooDataSet(*other.dataset_);\r\n }\r\n }\r\n}\r\n\r\ndoocore::io::EasyTuple::~EasyTuple() {\r\n if (dataset_ != NULL) delete dataset_;\r\n if (argset_ != NULL) delete argset_;\r\n if (tree_ != NULL && file_!= NULL) delete tree_;\r\n if (file_ != NULL) delete file_;\r\n}\r\n\r\nRooDataSet& doocore::io::EasyTuple::ConvertToDataSet(const RooCmdArg& arg1,\r\n const RooCmdArg& arg2,\r\n const RooCmdArg& arg3,\r\n const RooCmdArg& arg4,\r\n const RooCmdArg& arg5,\r\n const RooCmdArg& arg6,\r\n const RooCmdArg& arg7) {\r\n if (argset_ == NULL) {\r\n serr << \"Internal argset not set. Cannot convert to RooDataSet without this.\" << endmsg;\r\n throw 4;\r\n }\r\n \r\n return ConvertToDataSet(*argset_, arg1, arg2, arg3, arg4, arg5, arg6, arg7);\r\n}\r\n\r\nRooDataSet& doocore::io::EasyTuple::ConvertToDataSet(const RooArgSet& argset,\r\n const RooCmdArg& arg1,\r\n const RooCmdArg& arg2,\r\n const RooCmdArg& arg3,\r\n const RooCmdArg& arg4,\r\n const RooCmdArg& arg5,\r\n const RooCmdArg& arg6,\r\n const RooCmdArg& arg7) {\r\n if (dataset_ != NULL) {\r\n serr << \"Dataset was converted before. Maybe you want to use doocore::io::EasyTuple::dataset().\" << endmsg;\r\n throw 3;\r\n }\r\n \r\n \/\/ filter out formula vars and additionally cut on all variable ranges\r\n RooLinkedListIter* it = (RooLinkedListIter*)argset.createIterator();\r\n RooAbsArg* arg = NULL;\r\n RooArgSet new_set;\r\n std::vector<RooFormulaVar*> formulas;\r\n std::string cut_variables=\"\";\r\n std::stringstream stream_cut_variables;\r\n std::string less_operator = cut_variable_range_==kCutInclusive ? \"<=\" : \"<\";\r\n std::string greater_operator = cut_variable_range_==kCutInclusive ? \">=\" : \">\";\r\n \r\n while ((arg=(RooAbsArg*)it->Next())) {\r\n RooFormulaVar* formula = dynamic_cast<RooFormulaVar*>(arg);\r\n RooRealVar* var = dynamic_cast<RooRealVar*>(arg);\r\n \r\n if (formula == NULL) {\r\n new_set.add(*arg);\r\n \r\n if (var != NULL && cut_variable_range_ != kNoCuts) {\r\n if (var->hasMin()) stream_cut_variables << \"&&\" << var->GetName() << greater_operator << var->getMin();\r\n if (var->hasMax()) stream_cut_variables << \"&&\" << var->GetName() << less_operator << var->getMax();\r\n }\r\n } else {\r\n formulas.push_back(formula);\r\n }\r\n }\r\n delete it;\r\n \r\n \/\/ \tRooCmdArg(const char* name, Int_t i1 = 0, Int_t i2 = 0, Double_t d1 = 0, Double_t d2 = 0, const char* s1 = 0, const char* s2 = 0, const TObject* o1 = 0, const TObject* o2 = 0, const RooCmdArg* ca = 0, const char* s3 = 0, const RooArgSet* c1 = 0, const RooArgSet* c2 = 0)\r\n \/\/ RooCmdArg(\"CutSpec\",0,0,0,0,cutSpec,0,0,0) ;\r\n \r\n std::vector<RooCmdArg> args;\r\n args += arg1, arg2, arg3, arg4, arg5, arg6, arg7;\r\n \r\n bool found_cut_arg = false;\r\n for (std::vector<RooCmdArg>::iterator it=args.begin(), end=args.end();\r\n it != end; ++it) {\r\n std::string name = it->GetName();\r\n if (name == \"CutSpec\") {\r\n if ((void*)it->getString(0) != NULL) {\r\n std::string user_cut_string(it->getString(0));\r\n if (user_cut_string.length() > 0) stream_cut_variables << \"&&\" << user_cut_string;\r\n }\r\n cut_variables = stream_cut_variables.str();\r\n if (cut_variables.length() > 2) {\r\n cut_variables = cut_variables.substr(2);\r\n }\r\n \r\n sinfo << \"Converting dataset with cut '\" << cut_variables << \"'\" << endmsg;\r\n *it = Cut(cut_variables.c_str());\r\n found_cut_arg = true;\r\n }\r\n }\r\n if (!found_cut_arg) {\r\n cut_variables = stream_cut_variables.str();\r\n if (cut_variables.length() > 0) {\r\n cut_variables = cut_variables.substr(2);\r\n std::string name = args[6].GetName();\r\n if (name != \"\") {\r\n swarn << \"doocore::io::EasyTuple::ConvertToDataSet(...): Have to delete last passed RooCmdArg \" << name << \" to apply necessary cut.\" << endmsg;\r\n }\r\n sinfo << \"Converting dataset with cut \" << cut_variables << endmsg;\r\n args[6] = Cut(cut_variables.c_str());\r\n }\r\n }\r\n \r\n \/\/temp: copy tree \r\n \/\/tree_ = tree_->CopyTree(\"\", \"\", 800000);\r\n \/\/tree_->SetEntries(300000);\r\n \r\n dataset_ = new RooDataSet(\"dataset\",\"dataset\",new_set,Import(*tree_), args[0],\r\n args[1], args[2], args[3], args[4], args[5], args[6]);\r\n \r\n for (std::vector<RooFormulaVar*>::const_iterator it = formulas.begin();\r\n it != formulas.end(); ++it) {\r\n sinfo << \"Adding formula \" << (*it)->GetName() << \" to dataset.\" << endmsg;\r\n dataset_->addColumn(**it);\r\n }\r\n \r\n return *dataset_;\r\n}\r\n\r\nRooRealVar& doocore::io::EasyTuple::Var(const std::string& name) {\r\n if (dataset_ != NULL && dataset_->get()->find(name.c_str()) != NULL) {\r\n RooRealVar* var = dynamic_cast<RooRealVar*>(dataset_->get()->find(name.c_str()));\r\n if (var != NULL) {\r\n return *var;\r\n } else {\r\n serr << \"Variable \" << name << \" in dataset is not of type RooRealVar.\" << endmsg;\r\n throw 5;\r\n }\r\n } else {\r\n serr << \"Variable \" << name << \" not in dataset or tuple not converted to dataset.\" << endmsg;\r\n throw 5;\r\n }\r\n}\r\n\r\nconst RooRealVar& doocore::io::EasyTuple::Var(const std::string& name) const {\r\n return const_cast<doocore::io::EasyTuple*>(this)->Var(name);\r\n}\r\n<commit_msg>EasyTuple: default cut behaviour changed to inclusive cuts<commit_after>#include \"doocore\/io\/EasyTuple.h\"\r\n\r\n\/\/ from STL\r\n#include <string>\r\n#include <sstream>\r\n#include <vector>\r\n\r\n\/\/ from Boost\r\n#include <boost\/assign\/std\/vector.hpp>\r\nusing namespace boost::assign;\r\n\r\n\/\/ from ROOT\r\n#include \"TFile.h\"\r\n#include \"TTree.h\"\r\n\r\n\/\/ from RooFit\r\n#include \"RooArgSet.h\"\r\n#include \"RooLinkedListIter.h\"\r\n#include \"RooAbsArg.h\"\r\n#include \"RooDataSet.h\"\r\n#include \"RooFormulaVar.h\"\r\n#include \"RooCategory.h\"\r\n#include \"RooRealVar.h\"\r\n#include \"RooCmdArg.h\"\r\n\r\n\/\/ from project\r\n#include \"doocore\/io\/MsgStream.h\"\r\n\r\nusing namespace ROOT;\r\nusing namespace RooFit;\r\n\r\ndoocore::io::EasyTuple::EasyTuple(const std::string& file_name, const std::string& tree_name, const RooArgSet& argset)\r\n: file_(NULL),\r\n tree_(NULL),\r\n argset_(NULL),\r\n dataset_(NULL),\r\n tree_name_(tree_name),\r\n num_maximum_events_(-1),\r\n cut_variable_range_(kCutInclusive)\r\n{\r\n file_ = new TFile(file_name.c_str());\r\n argset_ = new RooArgSet(argset);\r\n \r\n if (file_ == NULL || file_->IsZombie() || file_->GetNkeys() <= 0) {\r\n serr << \"File \" << file_name << \" could not be opened properly.\" << endmsg;\r\n throw 1;\r\n }\r\n \r\n tree_ = dynamic_cast<TTree*>(file_->Get(tree_name.c_str()));\r\n if (tree_ == NULL) {\r\n serr << \"Tree \" << tree_name << \" could not be opened properly.\" << endmsg;\r\n throw 2;\r\n }\r\n \r\n if (argset.getSize() > 0) tree_->SetBranchStatus(\"*\", 0);\r\n \r\n RooLinkedListIter* it = (RooLinkedListIter*)argset.createIterator();\r\n RooAbsArg* arg = NULL;\r\n \r\n while ((arg=(RooAbsArg*)it->Next())) {\r\n RooRealVar* var = dynamic_cast<RooRealVar*>(arg);\r\n RooCategory* cat = dynamic_cast<RooCategory*>(arg);\r\n \r\n if (var != NULL || cat != NULL) {\r\n if (tree_->GetBranch(arg->GetName()) == NULL) {\r\n swarn << \"Branch \" << arg->GetName() << \" not in tree. Ignoring.\" << endmsg;\r\n } else {\r\n tree_->SetBranchStatus(arg->GetName(), 1);\r\n }\r\n }\r\n }\r\n delete it;\r\n}\r\n\r\ndoocore::io::EasyTuple::EasyTuple(TTree* tree, const RooArgSet& argset)\r\n: file_(NULL),\r\ntree_(tree),\r\nargset_(NULL),\r\ndataset_(NULL),\r\nnum_maximum_events_(-1),\r\ncut_variable_range_(kCutInclusive)\r\n{\r\n argset_ = new RooArgSet(argset);\r\n \r\n if (argset.getSize() > 0) tree_->SetBranchStatus(\"*\", 0);\r\n \r\n RooLinkedListIter* it = (RooLinkedListIter*)argset.createIterator();\r\n RooAbsArg* arg = NULL;\r\n \r\n while ((arg=(RooAbsArg*)it->Next())) {\r\n RooRealVar* var = dynamic_cast<RooRealVar*>(arg);\r\n RooCategory* cat = dynamic_cast<RooCategory*>(arg);\r\n \r\n if (var != NULL || cat != NULL) {\r\n if (tree_->GetBranch(arg->GetName()) == NULL) {\r\n swarn << \"Branch \" << arg->GetName() << \" not in tree. Ignoring.\" << endmsg;\r\n } else {\r\n tree_->SetBranchStatus(arg->GetName(), 1);\r\n }\r\n }\r\n }\r\n delete it;\r\n}\r\n\r\ndoocore::io::EasyTuple::EasyTuple(const EasyTuple& other)\r\n: file_(NULL),\r\ntree_(NULL),\r\nargset_(NULL),\r\ndataset_(NULL),\r\ntree_name_(other.tree_name_),\r\nnum_maximum_events_(other.num_maximum_events_),\r\ncut_variable_range_(other.cut_variable_range_)\r\n{\r\n argset_ = new RooArgSet(*other.argset_);\r\n \r\n if (other.file_ == NULL) {\r\n tree_ = other.tree_;\r\n } else {\r\n file_ = new TFile(other.file_->GetName());\r\n \r\n if (file_ == NULL || file_->IsZombie() || file_->GetNkeys() <= 0) {\r\n serr << \"File could not be opened properly.\" << endmsg;\r\n throw 1;\r\n }\r\n \r\n tree_ = dynamic_cast<TTree*>(file_->Get(tree_name_.c_str()));\r\n if (tree_ == NULL) {\r\n serr << \"Tree \" << tree_name_ << \" could not be opened properly.\" << endmsg;\r\n throw 2;\r\n }\r\n \r\n if (argset_->getSize() > 0) tree_->SetBranchStatus(\"*\", 0);\r\n \r\n RooLinkedListIter* it = (RooLinkedListIter*)argset_->createIterator();\r\n RooAbsArg* arg = NULL;\r\n \r\n while ((arg=(RooAbsArg*)it->Next())) {\r\n RooRealVar* var = dynamic_cast<RooRealVar*>(arg);\r\n RooCategory* cat = dynamic_cast<RooCategory*>(arg);\r\n \r\n if (var != NULL || cat != NULL) {\r\n if (tree_->GetBranch(arg->GetName()) == NULL) {\r\n swarn << \"Branch \" << arg->GetName() << \" not in tree. Ignoring.\" << endmsg;\r\n } else {\r\n tree_->SetBranchStatus(arg->GetName(), 1);\r\n }\r\n }\r\n }\r\n delete it;\r\n\r\n if (num_maximum_events_>=0) {\r\n set_num_maximum_events(num_maximum_events_);\r\n }\r\n \r\n if (other.dataset_ != NULL) {\r\n dataset_ = new RooDataSet(*other.dataset_);\r\n }\r\n }\r\n}\r\n\r\ndoocore::io::EasyTuple::~EasyTuple() {\r\n if (dataset_ != NULL) delete dataset_;\r\n if (argset_ != NULL) delete argset_;\r\n if (tree_ != NULL && file_!= NULL) delete tree_;\r\n if (file_ != NULL) delete file_;\r\n}\r\n\r\nRooDataSet& doocore::io::EasyTuple::ConvertToDataSet(const RooCmdArg& arg1,\r\n const RooCmdArg& arg2,\r\n const RooCmdArg& arg3,\r\n const RooCmdArg& arg4,\r\n const RooCmdArg& arg5,\r\n const RooCmdArg& arg6,\r\n const RooCmdArg& arg7) {\r\n if (argset_ == NULL) {\r\n serr << \"Internal argset not set. Cannot convert to RooDataSet without this.\" << endmsg;\r\n throw 4;\r\n }\r\n \r\n return ConvertToDataSet(*argset_, arg1, arg2, arg3, arg4, arg5, arg6, arg7);\r\n}\r\n\r\nRooDataSet& doocore::io::EasyTuple::ConvertToDataSet(const RooArgSet& argset,\r\n const RooCmdArg& arg1,\r\n const RooCmdArg& arg2,\r\n const RooCmdArg& arg3,\r\n const RooCmdArg& arg4,\r\n const RooCmdArg& arg5,\r\n const RooCmdArg& arg6,\r\n const RooCmdArg& arg7) {\r\n if (dataset_ != NULL) {\r\n serr << \"Dataset was converted before. Maybe you want to use doocore::io::EasyTuple::dataset().\" << endmsg;\r\n throw 3;\r\n }\r\n \r\n \/\/ filter out formula vars and additionally cut on all variable ranges\r\n RooLinkedListIter* it = (RooLinkedListIter*)argset.createIterator();\r\n RooAbsArg* arg = NULL;\r\n RooArgSet new_set;\r\n std::vector<RooFormulaVar*> formulas;\r\n std::string cut_variables=\"\";\r\n std::stringstream stream_cut_variables;\r\n std::string less_operator = cut_variable_range_==kCutInclusive ? \"<=\" : \"<\";\r\n std::string greater_operator = cut_variable_range_==kCutInclusive ? \">=\" : \">\";\r\n \r\n while ((arg=(RooAbsArg*)it->Next())) {\r\n RooFormulaVar* formula = dynamic_cast<RooFormulaVar*>(arg);\r\n RooRealVar* var = dynamic_cast<RooRealVar*>(arg);\r\n \r\n if (formula == NULL) {\r\n new_set.add(*arg);\r\n \r\n if (var != NULL && cut_variable_range_ != kNoCuts) {\r\n if (var->hasMin()) stream_cut_variables << \"&&\" << var->GetName() << greater_operator << var->getMin();\r\n if (var->hasMax()) stream_cut_variables << \"&&\" << var->GetName() << less_operator << var->getMax();\r\n }\r\n } else {\r\n formulas.push_back(formula);\r\n }\r\n }\r\n delete it;\r\n \r\n \/\/ \tRooCmdArg(const char* name, Int_t i1 = 0, Int_t i2 = 0, Double_t d1 = 0, Double_t d2 = 0, const char* s1 = 0, const char* s2 = 0, const TObject* o1 = 0, const TObject* o2 = 0, const RooCmdArg* ca = 0, const char* s3 = 0, const RooArgSet* c1 = 0, const RooArgSet* c2 = 0)\r\n \/\/ RooCmdArg(\"CutSpec\",0,0,0,0,cutSpec,0,0,0) ;\r\n \r\n std::vector<RooCmdArg> args;\r\n args += arg1, arg2, arg3, arg4, arg5, arg6, arg7;\r\n \r\n bool found_cut_arg = false;\r\n for (std::vector<RooCmdArg>::iterator it=args.begin(), end=args.end();\r\n it != end; ++it) {\r\n std::string name = it->GetName();\r\n if (name == \"CutSpec\") {\r\n if ((void*)it->getString(0) != NULL) {\r\n std::string user_cut_string(it->getString(0));\r\n if (user_cut_string.length() > 0) stream_cut_variables << \"&&\" << user_cut_string;\r\n }\r\n cut_variables = stream_cut_variables.str();\r\n if (cut_variables.length() > 2) {\r\n cut_variables = cut_variables.substr(2);\r\n }\r\n \r\n sinfo << \"Converting dataset with cut '\" << cut_variables << \"'\" << endmsg;\r\n *it = Cut(cut_variables.c_str());\r\n found_cut_arg = true;\r\n }\r\n }\r\n if (!found_cut_arg) {\r\n cut_variables = stream_cut_variables.str();\r\n if (cut_variables.length() > 0) {\r\n cut_variables = cut_variables.substr(2);\r\n std::string name = args[6].GetName();\r\n if (name != \"\") {\r\n swarn << \"doocore::io::EasyTuple::ConvertToDataSet(...): Have to delete last passed RooCmdArg \" << name << \" to apply necessary cut.\" << endmsg;\r\n }\r\n sinfo << \"Converting dataset with cut \" << cut_variables << endmsg;\r\n args[6] = Cut(cut_variables.c_str());\r\n }\r\n }\r\n \r\n \/\/temp: copy tree \r\n \/\/tree_ = tree_->CopyTree(\"\", \"\", 800000);\r\n \/\/tree_->SetEntries(300000);\r\n \r\n dataset_ = new RooDataSet(\"dataset\",\"dataset\",new_set,Import(*tree_), args[0],\r\n args[1], args[2], args[3], args[4], args[5], args[6]);\r\n \r\n for (std::vector<RooFormulaVar*>::const_iterator it = formulas.begin();\r\n it != formulas.end(); ++it) {\r\n sinfo << \"Adding formula \" << (*it)->GetName() << \" to dataset.\" << endmsg;\r\n dataset_->addColumn(**it);\r\n }\r\n \r\n return *dataset_;\r\n}\r\n\r\nRooRealVar& doocore::io::EasyTuple::Var(const std::string& name) {\r\n if (dataset_ != NULL && dataset_->get()->find(name.c_str()) != NULL) {\r\n RooRealVar* var = dynamic_cast<RooRealVar*>(dataset_->get()->find(name.c_str()));\r\n if (var != NULL) {\r\n return *var;\r\n } else {\r\n serr << \"Variable \" << name << \" in dataset is not of type RooRealVar.\" << endmsg;\r\n throw 5;\r\n }\r\n } else {\r\n serr << \"Variable \" << name << \" not in dataset or tuple not converted to dataset.\" << endmsg;\r\n throw 5;\r\n }\r\n}\r\n\r\nconst RooRealVar& doocore::io::EasyTuple::Var(const std::string& name) const {\r\n return const_cast<doocore::io::EasyTuple*>(this)->Var(name);\r\n}\r\n<|endoftext|>"} {"text":"<commit_before>#include \"command.hpp\"\n#include <vector>\n#include <string>\n\nnamespace cygscript {\n\nclass ExecCommand : public ICommand\n{\n\tstd::vector<std::wstring> _args;\n\npublic:\n\t\/**\n\t * Constructor.\n\t *\n\t * @param std::vector<std::wstring> args Wide arguments from main function\n\t *\/\n\tExecCommand(std::vector<std::wstring> args) : _args(args) {\n\t}\n\n\t\/**\n\t * Run command.\n\t *\n\t * @return int Exit code\n\t *\/\n\tint run();\n\nprivate:\n\t\/**\n\t * Get the arguments for script execution.\n\t *\n\t * @return std::vector<std::wstring> A list of wstring arguments\n\t *\/\n\tstd::vector<std::wstring> _getExecArgs();\n\n\t\/**\n\t * Get the command line for \/bin\/sh.\n\t *\n\t * @param const std::vector<std::wstring> args Wide arguments\n\t * @return std::wstring Command line\n\t *\/\n\tstd::wstring _getExecCmd(const std::vector<std::wstring> args);\n\n\t\/**\n\t * Execute script using a given command line.\n\t *\n\t * @param std::wstring cmd_line Command line\n\t * @throws std::runtime_error on failure\n\t *\/\n\tvoid _execute(const std::wstring& cmd_line);\n\n\t\/**\n\t * Check whether given path exists and is a regular file or symlink.\n\t *\n\t * @param std::wstring path Path\n\t * @return bool True if file exists\n\t *\/\n\tbool _fileExists(const std::wstring& path);\n\n\t\/**\n\t * Check whether given path is in Windows format.\n\t *\n\t * @param std::wstring path Path\n\t * @param bool must_exist Whether file must exist\n\t * @return bool True if path is in Windows format\n\t *\/\n\tbool _isWinPath(const std::wstring& path, bool must_exist);\n\n\t\/**\n\t * Convert Windows path to POSIX format.\n\t *\n\t * @param std::wstring path Windows formatted path\n\t * @return std::string POSIX path in UTF-8 charset\n\t *\/\n\tstd::string _pathWinToPosix(const std::wstring& path);\n\n\t\/**\n\t * Convert 8.3 short path to long path format.\n\t *\n\t * @param const std::wstring& path Short path\n\t * @return std::wstring Long path\n\t *\/\n\tstd::wstring _toLongPath(const std::wstring& path);\n\n\t\/**\n\t * Escape command line argument with Windows semantics.\n\t *\n\t * @param std::wstring arg Argument\n\t * @return std::wstring Escaped argument\n\t *\/\n\tstd::wstring _escapeWinArg(const std::wstring& arg);\n\n\t\/**\n\t * Escape command line argument with Posix semantics.\n\t *\n\t * @param std::wstring arg Argument\n\t * @return std::wstring Escaped argument\n\t *\/\n\tstd::wstring _escapePosixArg(const std::wstring& arg);\n\n\t\/**\n\t * Replace all occurences of a string.\n\t *\n\t * @param std::wstring& str String to modify\n\t * @param const std::wstring& from Substring to search\n\t * @param const std::wstring& to Replacement string\n\t *\/\n\tvoid _replaceAll(std::wstring& str, const std::wstring& from,\n\t const std::wstring& to);\n\n\t\/**\n\t * Get readable script name for the shell window title.\n\t *\n\t * @return std::wstring\n\t *\/\n\tstd::wstring _getScriptName(const std::wstring& path);\n};\n\n}\n<commit_msg>Fix comment<commit_after>#include \"command.hpp\"\n#include <vector>\n#include <string>\n\nnamespace cygscript {\n\nclass ExecCommand : public ICommand\n{\n\tstd::vector<std::wstring> _args;\n\npublic:\n\t\/**\n\t * Constructor.\n\t *\n\t * @param std::vector<std::wstring> args Wide arguments from main function\n\t *\/\n\tExecCommand(std::vector<std::wstring> args) : _args(args) {\n\t}\n\n\t\/**\n\t * Run command.\n\t *\n\t * @return int Exit code\n\t *\/\n\tint run();\n\nprivate:\n\t\/**\n\t * Get the arguments for script execution.\n\t *\n\t * @return std::vector<std::wstring> A list of wstring arguments\n\t *\/\n\tstd::vector<std::wstring> _getExecArgs();\n\n\t\/**\n\t * Get the command line for \/bin\/bash.\n\t *\n\t * @param const std::vector<std::wstring> args Wide arguments\n\t * @return std::wstring Command line\n\t *\/\n\tstd::wstring _getExecCmd(const std::vector<std::wstring> args);\n\n\t\/**\n\t * Execute script using a given command line.\n\t *\n\t * @param std::wstring cmd_line Command line\n\t * @throws std::runtime_error on failure\n\t *\/\n\tvoid _execute(const std::wstring& cmd_line);\n\n\t\/**\n\t * Check whether given path exists and is a regular file or symlink.\n\t *\n\t * @param std::wstring path Path\n\t * @return bool True if file exists\n\t *\/\n\tbool _fileExists(const std::wstring& path);\n\n\t\/**\n\t * Check whether given path is in Windows format.\n\t *\n\t * @param std::wstring path Path\n\t * @param bool must_exist Whether file must exist\n\t * @return bool True if path is in Windows format\n\t *\/\n\tbool _isWinPath(const std::wstring& path, bool must_exist);\n\n\t\/**\n\t * Convert Windows path to POSIX format.\n\t *\n\t * @param std::wstring path Windows formatted path\n\t * @return std::string POSIX path in UTF-8 charset\n\t *\/\n\tstd::string _pathWinToPosix(const std::wstring& path);\n\n\t\/**\n\t * Convert 8.3 short path to long path format.\n\t *\n\t * @param const std::wstring& path Short path\n\t * @return std::wstring Long path\n\t *\/\n\tstd::wstring _toLongPath(const std::wstring& path);\n\n\t\/**\n\t * Escape command line argument with Windows semantics.\n\t *\n\t * @param std::wstring arg Argument\n\t * @return std::wstring Escaped argument\n\t *\/\n\tstd::wstring _escapeWinArg(const std::wstring& arg);\n\n\t\/**\n\t * Escape command line argument with Posix semantics.\n\t *\n\t * @param std::wstring arg Argument\n\t * @return std::wstring Escaped argument\n\t *\/\n\tstd::wstring _escapePosixArg(const std::wstring& arg);\n\n\t\/**\n\t * Replace all occurences of a string.\n\t *\n\t * @param std::wstring& str String to modify\n\t * @param const std::wstring& from Substring to search\n\t * @param const std::wstring& to Replacement string\n\t *\/\n\tvoid _replaceAll(std::wstring& str, const std::wstring& from,\n\t const std::wstring& to);\n\n\t\/**\n\t * Get readable script name for the shell window title.\n\t *\n\t * @return std::wstring\n\t *\/\n\tstd::wstring _getScriptName(const std::wstring& path);\n};\n\n}\n<|endoftext|>"} {"text":"<commit_before>\/*\n * Copyright 2012 Google Inc.\n *\n * Use of this source code is governed by a BSD-style license that can be\n * found in the LICENSE file.\n *\/\n\n#include \"GrGradientEffects.h\"\n#include \"gl\/GrGLProgramStage.h\"\n#include \"GrProgramStageFactory.h\"\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nclass GrGLRadialGradient : public GrGLProgramStage {\n\npublic:\n\n GrGLRadialGradient(const GrProgramStageFactory& factory,\n const GrCustomStage&) : INHERITED (factory) { }\n virtual ~GrGLRadialGradient() { }\n\n virtual void emitVS(GrGLShaderBuilder* state,\n const char* vertexCoords) SK_OVERRIDE { }\n virtual void emitFS(GrGLShaderBuilder* state,\n const char* outputColor,\n const char* inputColor,\n const char* samplerName) SK_OVERRIDE;\n\n static StageKey GenKey(const GrCustomStage& s) { return 0; }\n\nprivate:\n\n typedef GrGLProgramStage INHERITED;\n\n};\n\nvoid GrGLRadialGradient::emitFS(GrGLShaderBuilder* state,\n const char* outputColor,\n const char* inputColor,\n const char* samplerName) {\n state->fSampleCoords.printf(\"vec2(length(%s.xy), 0.5)\",\n state->fSampleCoords.c_str());\n state->fComplexCoord = true;\n\n state->emitDefaultFetch(outputColor, samplerName);\n}\n\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n\nGrRadialGradient::GrRadialGradient() {\n\n}\n\nGrRadialGradient::~GrRadialGradient() {\n\n}\n\n\nconst GrProgramStageFactory& GrRadialGradient::getFactory() const {\n return GrTProgramStageFactory<GrRadialGradient>::getInstance();\n}\n\nbool GrRadialGradient::isEqual(const GrCustomStage& sBase) const {\n return true;\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nclass GrGLRadial2Gradient : public GrGLProgramStage {\n\npublic:\n\n GrGLRadial2Gradient(const GrProgramStageFactory& factory,\n const GrCustomStage&);\n virtual ~GrGLRadial2Gradient() { }\n\n virtual void setupVariables(GrGLShaderBuilder* state,\n int stage) SK_OVERRIDE;\n virtual void emitVS(GrGLShaderBuilder* state,\n const char* vertexCoords) SK_OVERRIDE;\n virtual void emitFS(GrGLShaderBuilder* state,\n const char* outputColor,\n const char* inputColor,\n const char* samplerName) SK_OVERRIDE;\n virtual void initUniforms(const GrGLInterface*, int programID) SK_OVERRIDE;\n virtual void setData(const GrGLInterface*,\n const GrGLTexture&,\n const GrCustomStage&,\n int stageNum) SK_OVERRIDE;\n\n static StageKey GenKey(const GrCustomStage& s) {\n return (static_cast<const GrRadial2Gradient&>(s).isDegenerate());\n }\n\nprotected:\n\n const GrGLShaderVar* fParamVar;\n GrGLint fParamLocation;\n\n const char* fVSVaryingName;\n const char* fFSVaryingName;\n\n bool fIsDegenerate;\n\n \/\/ @{\n \/\/\/ Values last uploaded as uniforms\n\n GrScalar fCachedCenter;\n GrScalar fCachedRadius;\n SkBool8 fCachedPosRoot;\n\n \/\/ @}\n\nprivate:\n\n typedef GrGLProgramStage INHERITED;\n\n};\n\nGrGLRadial2Gradient::GrGLRadial2Gradient(\n const GrProgramStageFactory& factory,\n const GrCustomStage& baseData)\n : INHERITED(factory)\n , fParamVar(NULL)\n , fVSVaryingName(NULL)\n , fFSVaryingName(NULL)\n , fCachedCenter(GR_ScalarMax)\n , fCachedRadius(-GR_ScalarMax)\n , fCachedPosRoot(0) {\n\n const GrRadial2Gradient& data =\n static_cast<const GrRadial2Gradient&>(baseData);\n fIsDegenerate = data.isDegenerate();\n}\n\nvoid GrGLRadial2Gradient::setupVariables(GrGLShaderBuilder* state, int stage) {\n fParamVar = &state->addUniform(\n GrGLShaderBuilder::kBoth_VariableLifetime,\n kFloat_GrSLType, \"uRadial2Params\", stage, 6);\n\n fParamLocation = GrGLProgramStage::kUseUniform;\n\n \/\/ For radial gradients without perspective we can pass the linear\n \/\/ part of the quadratic as a varying.\n if (state->fVaryingDims == state->fCoordDims) {\n state->addVarying(kFloat_GrSLType, \"Radial2BCoeff\", stage,\n &fVSVaryingName, &fFSVaryingName);\n }\n}\n\nvoid GrGLRadial2Gradient::emitVS(GrGLShaderBuilder* state,\n const char* vertexCoords) {\n GrStringBuilder* code = &state->fVSCode;\n GrStringBuilder p2;\n GrStringBuilder p3;\n fParamVar->appendArrayAccess(2, &p2);\n fParamVar->appendArrayAccess(3, &p3);\n\n \/\/ For radial gradients without perspective we can pass the linear\n \/\/ part of the quadratic as a varying.\n if (state->fVaryingDims == state->fCoordDims) {\n \/\/ r2Var = 2 * (r2Parm[2] * varCoord.x - r2Param[3])\n code->appendf(\"\\t%s = 2.0 *(%s * %s.x - %s);\\n\",\n fVSVaryingName, p2.c_str(),\n vertexCoords, p3.c_str());\n }\n}\n\nvoid GrGLRadial2Gradient::emitFS(GrGLShaderBuilder* state,\n const char* outputColor,\n const char* inputColor,\n const char* samplerName) {\n GrStringBuilder* code = &state->fFSCode;\n GrStringBuilder cName(\"c\");\n GrStringBuilder ac4Name(\"ac4\");\n GrStringBuilder rootName(\"root\");\n GrStringBuilder p0;\n GrStringBuilder p1;\n GrStringBuilder p2;\n GrStringBuilder p3;\n GrStringBuilder p4;\n GrStringBuilder p5;\n fParamVar->appendArrayAccess(0, &p0);\n fParamVar->appendArrayAccess(1, &p1);\n fParamVar->appendArrayAccess(2, &p2);\n fParamVar->appendArrayAccess(3, &p3);\n fParamVar->appendArrayAccess(4, &p4);\n fParamVar->appendArrayAccess(5, &p5);\n\n \/\/ If we we're able to interpolate the linear component,\n \/\/ bVar is the varying; otherwise compute it\n GrStringBuilder bVar;\n if (state->fCoordDims == state->fVaryingDims) {\n bVar = fFSVaryingName;\n GrAssert(2 == state->fVaryingDims);\n } else {\n GrAssert(3 == state->fVaryingDims);\n bVar = \"b\";\n \/\/bVar.appendS32(stageNum);\n code->appendf(\"\\tfloat %s = 2.0 * (%s * %s.x - %s);\\n\",\n bVar.c_str(), p2.c_str(),\n state->fSampleCoords.c_str(), p3.c_str());\n }\n\n \/\/ c = (x^2)+(y^2) - params[4]\n code->appendf(\"\\tfloat %s = dot(%s, %s) - %s;\\n\",\n cName.c_str(), state->fSampleCoords.c_str(),\n state->fSampleCoords.c_str(),\n p4.c_str());\n\n \/\/ If we aren't degenerate, emit some extra code, and accept a slightly\n \/\/ more complex coord.\n if (fIsDegenerate) {\n\n \/\/ ac4 = 4.0 * params[0] * c\n code->appendf(\"\\tfloat %s = %s * 4.0 * %s;\\n\",\n ac4Name.c_str(), p0.c_str(),\n cName.c_str());\n\n \/\/ root = sqrt(b^2-4ac)\n \/\/ (abs to avoid exception due to fp precision)\n code->appendf(\"\\tfloat %s = sqrt(abs(%s*%s - %s));\\n\",\n rootName.c_str(), bVar.c_str(), bVar.c_str(),\n ac4Name.c_str());\n\n \/\/ x coord is: (-b + params[5] * sqrt(b^2-4ac)) * params[1]\n \/\/ y coord is 0.5 (texture is effectively 1D)\n state->fSampleCoords.printf(\"vec2((-%s + %s * %s) * %s, 0.5)\",\n bVar.c_str(), p5.c_str(),\n rootName.c_str(), p1.c_str());\n } else {\n \/\/ x coord is: -c\/b\n \/\/ y coord is 0.5 (texture is effectively 1D)\n state->fSampleCoords.printf(\"vec2((-%s \/ %s), 0.5)\",\n cName.c_str(), bVar.c_str());\n }\n state->fComplexCoord = true;\n\n state->emitDefaultFetch(outputColor, samplerName);\n}\n\nvoid GrGLRadial2Gradient::initUniforms(const GrGLInterface* gl, int programID) {\n GR_GL_CALL_RET(gl, fParamLocation,\n GetUniformLocation(programID, fParamVar->getName().c_str()));\n}\n\nvoid GrGLRadial2Gradient::setData(const GrGLInterface* gl,\n const GrGLTexture& texture,\n const GrCustomStage& baseData,\n int stageNum) {\n const GrRadial2Gradient& data =\n static_cast<const GrRadial2Gradient&>(baseData);\n GrAssert(data.isDegenerate() == fIsDegenerate);\n GrScalar centerX1 = data.center();\n GrScalar radius0 = data.radius();\n if (fCachedCenter != centerX1 ||\n fCachedRadius != radius0 ||\n fCachedPosRoot != data.isPosRoot()) {\n\n GrScalar a = GrMul(centerX1, centerX1) - GR_Scalar1;\n\n \/\/ When we're in the degenerate (linear) case, the second\n \/\/ value will be INF but the program doesn't read it. (We\n \/\/ use the same 6 uniforms even though we don't need them\n \/\/ all in the linear case just to keep the code complexity\n \/\/ down).\n float values[6] = {\n GrScalarToFloat(a),\n 1 \/ (2.f * GrScalarToFloat(a)),\n GrScalarToFloat(centerX1),\n GrScalarToFloat(radius0),\n GrScalarToFloat(GrMul(radius0, radius0)),\n data.isPosRoot() ? 1.f : -1.f\n };\n\n GR_GL_CALL(gl, Uniform1fv(fParamLocation, 6, values));\n fCachedCenter = centerX1;\n fCachedRadius = radius0;\n fCachedPosRoot = data.isPosRoot();\n }\n}\n\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nGrRadial2Gradient::GrRadial2Gradient(GrScalar center,\n GrScalar radius,\n bool posRoot)\n : fCenterX1 (center)\n , fRadius0 (radius)\n , fPosRoot (posRoot) {\n\n}\n\nGrRadial2Gradient::~GrRadial2Gradient() {\n\n}\n\n\nconst GrProgramStageFactory& GrRadial2Gradient::getFactory() const {\n return GrTProgramStageFactory<GrRadial2Gradient>::getInstance();\n}\n\nbool GrRadial2Gradient::isEqual(const GrCustomStage& sBase) const {\n const GrRadial2Gradient& s = static_cast<const GrRadial2Gradient&>(sBase);\n return (this->isDegenerate() == s.isDegenerate());\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nclass GrGLSweepGradient : public GrGLProgramStage {\n\npublic:\n\n GrGLSweepGradient(const GrProgramStageFactory& factory,\n const GrCustomStage&) : INHERITED (factory) { }\n virtual ~GrGLSweepGradient() { }\n\n virtual void emitVS(GrGLShaderBuilder* state,\n const char* vertexCoords) SK_OVERRIDE { }\n virtual void emitFS(GrGLShaderBuilder* state,\n const char* outputColor,\n const char* inputColor,\n const char* samplerName) SK_OVERRIDE;\n\n static StageKey GenKey(const GrCustomStage& s) { return 0; }\n\nprivate:\n\n typedef GrGLProgramStage INHERITED;\n\n};\n\nvoid GrGLSweepGradient::emitFS(GrGLShaderBuilder* state,\n const char* outputColor,\n const char* inputColor,\n const char* samplerName) {\n state->fSampleCoords.printf(\n \"vec2(atan(- %s.y, - %s.x) * 0.1591549430918 + 0.5, 0.5)\",\n state->fSampleCoords.c_str(), state->fSampleCoords.c_str());\n state->fComplexCoord = true;\n\n state->emitDefaultFetch(outputColor, samplerName);\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nGrSweepGradient::GrSweepGradient() {\n\n}\n\nGrSweepGradient::~GrSweepGradient() {\n\n}\n\nconst GrProgramStageFactory& GrSweepGradient::getFactory() const {\n return GrTProgramStageFactory<GrSweepGradient>::getInstance();\n}\n\nbool GrSweepGradient::isEqual(const GrCustomStage& sBase) const {\n return true;\n}\n\n<commit_msg>SkBool8 -> bool to suppress warning (verbal LGTM from TomH)<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 \"GrGradientEffects.h\"\n#include \"gl\/GrGLProgramStage.h\"\n#include \"GrProgramStageFactory.h\"\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nclass GrGLRadialGradient : public GrGLProgramStage {\n\npublic:\n\n GrGLRadialGradient(const GrProgramStageFactory& factory,\n const GrCustomStage&) : INHERITED (factory) { }\n virtual ~GrGLRadialGradient() { }\n\n virtual void emitVS(GrGLShaderBuilder* state,\n const char* vertexCoords) SK_OVERRIDE { }\n virtual void emitFS(GrGLShaderBuilder* state,\n const char* outputColor,\n const char* inputColor,\n const char* samplerName) SK_OVERRIDE;\n\n static StageKey GenKey(const GrCustomStage& s) { return 0; }\n\nprivate:\n\n typedef GrGLProgramStage INHERITED;\n\n};\n\nvoid GrGLRadialGradient::emitFS(GrGLShaderBuilder* state,\n const char* outputColor,\n const char* inputColor,\n const char* samplerName) {\n state->fSampleCoords.printf(\"vec2(length(%s.xy), 0.5)\",\n state->fSampleCoords.c_str());\n state->fComplexCoord = true;\n\n state->emitDefaultFetch(outputColor, samplerName);\n}\n\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n\nGrRadialGradient::GrRadialGradient() {\n\n}\n\nGrRadialGradient::~GrRadialGradient() {\n\n}\n\n\nconst GrProgramStageFactory& GrRadialGradient::getFactory() const {\n return GrTProgramStageFactory<GrRadialGradient>::getInstance();\n}\n\nbool GrRadialGradient::isEqual(const GrCustomStage& sBase) const {\n return true;\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nclass GrGLRadial2Gradient : public GrGLProgramStage {\n\npublic:\n\n GrGLRadial2Gradient(const GrProgramStageFactory& factory,\n const GrCustomStage&);\n virtual ~GrGLRadial2Gradient() { }\n\n virtual void setupVariables(GrGLShaderBuilder* state,\n int stage) SK_OVERRIDE;\n virtual void emitVS(GrGLShaderBuilder* state,\n const char* vertexCoords) SK_OVERRIDE;\n virtual void emitFS(GrGLShaderBuilder* state,\n const char* outputColor,\n const char* inputColor,\n const char* samplerName) SK_OVERRIDE;\n virtual void initUniforms(const GrGLInterface*, int programID) SK_OVERRIDE;\n virtual void setData(const GrGLInterface*,\n const GrGLTexture&,\n const GrCustomStage&,\n int stageNum) SK_OVERRIDE;\n\n static StageKey GenKey(const GrCustomStage& s) {\n return (static_cast<const GrRadial2Gradient&>(s).isDegenerate());\n }\n\nprotected:\n\n const GrGLShaderVar* fParamVar;\n GrGLint fParamLocation;\n\n const char* fVSVaryingName;\n const char* fFSVaryingName;\n\n bool fIsDegenerate;\n\n \/\/ @{\n \/\/\/ Values last uploaded as uniforms\n\n GrScalar fCachedCenter;\n GrScalar fCachedRadius;\n bool fCachedPosRoot;\n\n \/\/ @}\n\nprivate:\n\n typedef GrGLProgramStage INHERITED;\n\n};\n\nGrGLRadial2Gradient::GrGLRadial2Gradient(\n const GrProgramStageFactory& factory,\n const GrCustomStage& baseData)\n : INHERITED(factory)\n , fParamVar(NULL)\n , fVSVaryingName(NULL)\n , fFSVaryingName(NULL)\n , fCachedCenter(GR_ScalarMax)\n , fCachedRadius(-GR_ScalarMax)\n , fCachedPosRoot(0) {\n\n const GrRadial2Gradient& data =\n static_cast<const GrRadial2Gradient&>(baseData);\n fIsDegenerate = data.isDegenerate();\n}\n\nvoid GrGLRadial2Gradient::setupVariables(GrGLShaderBuilder* state, int stage) {\n fParamVar = &state->addUniform(\n GrGLShaderBuilder::kBoth_VariableLifetime,\n kFloat_GrSLType, \"uRadial2Params\", stage, 6);\n\n fParamLocation = GrGLProgramStage::kUseUniform;\n\n \/\/ For radial gradients without perspective we can pass the linear\n \/\/ part of the quadratic as a varying.\n if (state->fVaryingDims == state->fCoordDims) {\n state->addVarying(kFloat_GrSLType, \"Radial2BCoeff\", stage,\n &fVSVaryingName, &fFSVaryingName);\n }\n}\n\nvoid GrGLRadial2Gradient::emitVS(GrGLShaderBuilder* state,\n const char* vertexCoords) {\n GrStringBuilder* code = &state->fVSCode;\n GrStringBuilder p2;\n GrStringBuilder p3;\n fParamVar->appendArrayAccess(2, &p2);\n fParamVar->appendArrayAccess(3, &p3);\n\n \/\/ For radial gradients without perspective we can pass the linear\n \/\/ part of the quadratic as a varying.\n if (state->fVaryingDims == state->fCoordDims) {\n \/\/ r2Var = 2 * (r2Parm[2] * varCoord.x - r2Param[3])\n code->appendf(\"\\t%s = 2.0 *(%s * %s.x - %s);\\n\",\n fVSVaryingName, p2.c_str(),\n vertexCoords, p3.c_str());\n }\n}\n\nvoid GrGLRadial2Gradient::emitFS(GrGLShaderBuilder* state,\n const char* outputColor,\n const char* inputColor,\n const char* samplerName) {\n GrStringBuilder* code = &state->fFSCode;\n GrStringBuilder cName(\"c\");\n GrStringBuilder ac4Name(\"ac4\");\n GrStringBuilder rootName(\"root\");\n GrStringBuilder p0;\n GrStringBuilder p1;\n GrStringBuilder p2;\n GrStringBuilder p3;\n GrStringBuilder p4;\n GrStringBuilder p5;\n fParamVar->appendArrayAccess(0, &p0);\n fParamVar->appendArrayAccess(1, &p1);\n fParamVar->appendArrayAccess(2, &p2);\n fParamVar->appendArrayAccess(3, &p3);\n fParamVar->appendArrayAccess(4, &p4);\n fParamVar->appendArrayAccess(5, &p5);\n\n \/\/ If we we're able to interpolate the linear component,\n \/\/ bVar is the varying; otherwise compute it\n GrStringBuilder bVar;\n if (state->fCoordDims == state->fVaryingDims) {\n bVar = fFSVaryingName;\n GrAssert(2 == state->fVaryingDims);\n } else {\n GrAssert(3 == state->fVaryingDims);\n bVar = \"b\";\n \/\/bVar.appendS32(stageNum);\n code->appendf(\"\\tfloat %s = 2.0 * (%s * %s.x - %s);\\n\",\n bVar.c_str(), p2.c_str(),\n state->fSampleCoords.c_str(), p3.c_str());\n }\n\n \/\/ c = (x^2)+(y^2) - params[4]\n code->appendf(\"\\tfloat %s = dot(%s, %s) - %s;\\n\",\n cName.c_str(), state->fSampleCoords.c_str(),\n state->fSampleCoords.c_str(),\n p4.c_str());\n\n \/\/ If we aren't degenerate, emit some extra code, and accept a slightly\n \/\/ more complex coord.\n if (fIsDegenerate) {\n\n \/\/ ac4 = 4.0 * params[0] * c\n code->appendf(\"\\tfloat %s = %s * 4.0 * %s;\\n\",\n ac4Name.c_str(), p0.c_str(),\n cName.c_str());\n\n \/\/ root = sqrt(b^2-4ac)\n \/\/ (abs to avoid exception due to fp precision)\n code->appendf(\"\\tfloat %s = sqrt(abs(%s*%s - %s));\\n\",\n rootName.c_str(), bVar.c_str(), bVar.c_str(),\n ac4Name.c_str());\n\n \/\/ x coord is: (-b + params[5] * sqrt(b^2-4ac)) * params[1]\n \/\/ y coord is 0.5 (texture is effectively 1D)\n state->fSampleCoords.printf(\"vec2((-%s + %s * %s) * %s, 0.5)\",\n bVar.c_str(), p5.c_str(),\n rootName.c_str(), p1.c_str());\n } else {\n \/\/ x coord is: -c\/b\n \/\/ y coord is 0.5 (texture is effectively 1D)\n state->fSampleCoords.printf(\"vec2((-%s \/ %s), 0.5)\",\n cName.c_str(), bVar.c_str());\n }\n state->fComplexCoord = true;\n\n state->emitDefaultFetch(outputColor, samplerName);\n}\n\nvoid GrGLRadial2Gradient::initUniforms(const GrGLInterface* gl, int programID) {\n GR_GL_CALL_RET(gl, fParamLocation,\n GetUniformLocation(programID, fParamVar->getName().c_str()));\n}\n\nvoid GrGLRadial2Gradient::setData(const GrGLInterface* gl,\n const GrGLTexture& texture,\n const GrCustomStage& baseData,\n int stageNum) {\n const GrRadial2Gradient& data =\n static_cast<const GrRadial2Gradient&>(baseData);\n GrAssert(data.isDegenerate() == fIsDegenerate);\n GrScalar centerX1 = data.center();\n GrScalar radius0 = data.radius();\n if (fCachedCenter != centerX1 ||\n fCachedRadius != radius0 ||\n fCachedPosRoot != data.isPosRoot()) {\n\n GrScalar a = GrMul(centerX1, centerX1) - GR_Scalar1;\n\n \/\/ When we're in the degenerate (linear) case, the second\n \/\/ value will be INF but the program doesn't read it. (We\n \/\/ use the same 6 uniforms even though we don't need them\n \/\/ all in the linear case just to keep the code complexity\n \/\/ down).\n float values[6] = {\n GrScalarToFloat(a),\n 1 \/ (2.f * GrScalarToFloat(a)),\n GrScalarToFloat(centerX1),\n GrScalarToFloat(radius0),\n GrScalarToFloat(GrMul(radius0, radius0)),\n data.isPosRoot() ? 1.f : -1.f\n };\n\n GR_GL_CALL(gl, Uniform1fv(fParamLocation, 6, values));\n fCachedCenter = centerX1;\n fCachedRadius = radius0;\n fCachedPosRoot = data.isPosRoot();\n }\n}\n\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nGrRadial2Gradient::GrRadial2Gradient(GrScalar center,\n GrScalar radius,\n bool posRoot)\n : fCenterX1 (center)\n , fRadius0 (radius)\n , fPosRoot (posRoot) {\n\n}\n\nGrRadial2Gradient::~GrRadial2Gradient() {\n\n}\n\n\nconst GrProgramStageFactory& GrRadial2Gradient::getFactory() const {\n return GrTProgramStageFactory<GrRadial2Gradient>::getInstance();\n}\n\nbool GrRadial2Gradient::isEqual(const GrCustomStage& sBase) const {\n const GrRadial2Gradient& s = static_cast<const GrRadial2Gradient&>(sBase);\n return (this->isDegenerate() == s.isDegenerate());\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nclass GrGLSweepGradient : public GrGLProgramStage {\n\npublic:\n\n GrGLSweepGradient(const GrProgramStageFactory& factory,\n const GrCustomStage&) : INHERITED (factory) { }\n virtual ~GrGLSweepGradient() { }\n\n virtual void emitVS(GrGLShaderBuilder* state,\n const char* vertexCoords) SK_OVERRIDE { }\n virtual void emitFS(GrGLShaderBuilder* state,\n const char* outputColor,\n const char* inputColor,\n const char* samplerName) SK_OVERRIDE;\n\n static StageKey GenKey(const GrCustomStage& s) { return 0; }\n\nprivate:\n\n typedef GrGLProgramStage INHERITED;\n\n};\n\nvoid GrGLSweepGradient::emitFS(GrGLShaderBuilder* state,\n const char* outputColor,\n const char* inputColor,\n const char* samplerName) {\n state->fSampleCoords.printf(\n \"vec2(atan(- %s.y, - %s.x) * 0.1591549430918 + 0.5, 0.5)\",\n state->fSampleCoords.c_str(), state->fSampleCoords.c_str());\n state->fComplexCoord = true;\n\n state->emitDefaultFetch(outputColor, samplerName);\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nGrSweepGradient::GrSweepGradient() {\n\n}\n\nGrSweepGradient::~GrSweepGradient() {\n\n}\n\nconst GrProgramStageFactory& GrSweepGradient::getFactory() const {\n return GrTProgramStageFactory<GrSweepGradient>::getInstance();\n}\n\nbool GrSweepGradient::isEqual(const GrCustomStage& sBase) const {\n return true;\n}\n\n<|endoftext|>"} {"text":"<commit_before>\/\/ SystemInfo-Win32.cpp\n\/\/\n\/\/ Copyright 2013 tomas <tomasp@videotron.ca>\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,\n\/\/ MA 02110-1301, USA.\n\n#include <orion\/SystemInfo.h>\n\n#ifndef _WIN32_WINNT\n#define _WIN32_WINNT 0x0500\n#endif\n\n#include <windows.h>\n#include <lmcons.h> \/* For UNLEN *\/\n#include <process.h>\n\n#if 0 \/\/ndef __MINGW64__\n#include <ddk\/ntifs.h>\n\ntypedef struct _SYSTEM_PROCESSOR_PERFORMANCE_INFORMATION {\nLARGE_INTEGER IdleTime;\n LARGE_INTEGER KernelTime;\n LARGE_INTEGER UserTime;\n LARGE_INTEGER DpcTime;\n LARGE_INTEGER InterruptTime;\n ULONG InterruptCount; \n} SYSTEM_PROCESSOR_PERFORMANCE_INFORMATION;\n#else\n#include <winternl.h>\n#endif\n\n#include <psapi.h>\n\n#include <orion\/StringUtils.h>\n\n#define ARRAY_SIZE(a) (sizeof(a) \/ sizeof((a)[0]))\n\nnamespace orion\n{\nnamespace systeminfo\n{\n\n\/\/--------------------------------------------------------------------\nvoid get_loaded_modules(unsigned long process_id, ModuleList& modules)\n{\n DWORD cbNeeded;\n\n \/\/ Get a list of all the modules in this process.\n HANDLE process_handle = OpenProcess(PROCESS_QUERY_INFORMATION |\n PROCESS_VM_READ,\n FALSE, \n process_id);\n if (process_handle == nullptr)\n return;\n\n HMODULE module_handles[1024];\n\n if (EnumProcessModulesEx(process_handle, module_handles, sizeof(module_handles), &cbNeeded, LIST_MODULES_ALL)) \n {\n for (int i = 0; i < (cbNeeded \/ sizeof(HMODULE)); i++) \n {\n wchar_t module_name[MAX_PATH];\n\n \/\/ Get the full path to the module's file.\n if (GetModuleFileNameExW(process_handle, module_handles[i], module_name, sizeof(module_name))) \n {\n \/\/ Print the module name and handle value.\n modules.push_back(wstring_to_utf8(module_name));\n }\n }\n }\n CloseHandle(process_handle);\n}\n\nstd::string get_cpu_model()\n{\n const uint32_t max_length = 4096;\n\n DWORD type = REG_SZ;\n HKEY hKey = nullptr;\n DWORD length = max_length;\n wchar_t value[max_length];\n\n ZeroMemory(value, max_length);\n\n const wchar_t* keyToOpen = L\"HARDWARE\\\\DESCRIPTION\\\\System\\\\CentralProcessor\\\\0\";\n const wchar_t* valueToFind = L\"ProcessorNameString\";\n\n RegOpenKeyExW(HKEY_LOCAL_MACHINE, keyToOpen, 0, KEY_READ, &hKey);\n RegQueryValueExW(hKey, valueToFind, nullptr, &type, (LPBYTE)&value, &length);\n RegCloseKey(hKey);\n\n std::string cpuName = wstring_to_utf8(value);\n\n SYSTEM_INFO sysinfo;\n ZeroMemory(&sysinfo, sizeof(SYSTEM_INFO));\n GetSystemInfo(&sysinfo);\n\n const uint64_t cpuThreadCount = sysinfo.dwNumberOfProcessors;\n std::string cpuInfo = cpuName + \" (\" + std::to_string(cpuThreadCount);\n\n if (cpuThreadCount == 1)\n cpuInfo.append(\" thread)\");\n else\n cpuInfo.append(\" threads)\");\n\n return cpuInfo;\n}\n\nstd::vector<CpuInfo> get_cpu_info()\n{\n std::vector<CpuInfo> cpu_infos;\n\n SYSTEM_INFO system_info;\n ZeroMemory(&system_info, sizeof(SYSTEM_INFO));\n\n GetSystemInfo(&system_info);\n\n int32_t cpu_count = system_info.dwNumberOfProcessors;\n\n SYSTEM_PROCESSOR_PERFORMANCE_INFORMATION* sppi = nullptr;\n ULONG result_size;\n\n DWORD sppi_size = cpu_count * sizeof(*sppi);\n sppi = (SYSTEM_PROCESSOR_PERFORMANCE_INFORMATION*)malloc(sppi_size);\n\n NTSTATUS status = NtQuerySystemInformation(SystemProcessorPerformanceInformation,\n sppi,\n sppi_size,\n &result_size);\n\n if (not NT_SUCCESS(status)) \n {\n \/\/ err = RtlNtStatusToDosError(status);\n RtlNtStatusToDosError(status);\n free(sppi);\n return cpu_infos;\n }\n\n\n for (int32_t i = 0; i < cpu_count; i++)\n {\n WCHAR key_name[128];\n HKEY processor_key;\n\n int len = _snwprintf(key_name,\n ARRAY_SIZE(key_name),\n L\"HARDWARE\\\\DESCRIPTION\\\\System\\\\CentralProcessor\\\\%d\", i);\n\n DWORD ret = RegOpenKeyExW(HKEY_LOCAL_MACHINE, key_name, 0, KEY_QUERY_VALUE, &processor_key);\n\n if (ret != ERROR_SUCCESS) \n {\n \/\/ err = GetLastError();\n \/\/ free(sppi);\n }\n\n DWORD cpu_speed;\n DWORD cpu_speed_size = sizeof(cpu_speed);\n\n ret = RegQueryValueExW(processor_key, L\"~MHz\", NULL, NULL, (BYTE*) &cpu_speed, &cpu_speed_size);\n\n if (ret != ERROR_SUCCESS) \n {\n \/\/ err = GetLastError();\n \/\/ free(sppi);\n \/\/ RegCloseKey(processor_key);\n }\n\n WCHAR cpu_brand[256];\n DWORD cpu_brand_size = sizeof(cpu_brand);\n\n ret = RegQueryValueExW(processor_key, L\"ProcessorNameString\", NULL, NULL, (BYTE*) &cpu_brand, &cpu_brand_size);\n\n if (ret != ERROR_SUCCESS) \n {\n \/\/ err = GetLastError();\n \/\/ free(sppi);\n \/\/ RegCloseKey(processor_key);\n }\n\n RegCloseKey(processor_key);\n\n CpuTimes cpu_times;\n\n cpu_times.user = sppi[i].UserTime.QuadPart \/ 10000;\n cpu_times.nice = 0;\n cpu_times.sys = (sppi[i].KernelTime.QuadPart - sppi[i].IdleTime.QuadPart) \/ 10000;\n cpu_times.idle = sppi[i].IdleTime.QuadPart \/ 10000;\n#if 0 \/\/ndef __MINGW64__\n cpu_times.irq = sppi[i].InterruptTime.QuadPart \/ 10000;\n#else\n cpu_times.irq = sppi[i].Reserved1[0].QuadPart \/ 10000;\n#endif\n\n\n len = WideCharToMultiByte(CP_UTF8, 0, cpu_brand, cpu_brand_size \/ sizeof(WCHAR), NULL, 0, NULL, NULL);\n\n if (len == 0) \n {\n \/\/ err = GetLastError();\n \/\/ free(sppi);\n }\n\n char* model = new char[len];\n\n len = WideCharToMultiByte(CP_UTF8, 0, cpu_brand, cpu_brand_size \/ sizeof(WCHAR), model, len, NULL, NULL);\n\n if (len == 0) \n {\n \/\/ err = GetLastError();\n \/\/ free(sppi);\n }\n\n CpuInfo cpu_info(model, cpu_speed, cpu_times);\n\n cpu_infos.push_back(cpu_info);\n\n delete [] model;\n }\n\n free(sppi);\n\n return cpu_infos;\n}\n\nstd::string get_os_version()\n{\n OSVERSIONINFOEX osvi;\n\n ZeroMemory(&osvi, sizeof(OSVERSIONINFOEX));\n\n \/\/ Try calling GetVersionEx using the OSVERSIONINFOEX structure.\n \/\/ If that fails, try using the OSVERSIONINFO structure.\n osvi.dwOSVersionInfoSize = sizeof(OSVERSIONINFOEX);\n\n bool os_version_info_ex = GetVersionExW((OSVERSIONINFO*) &osvi);\n\n if (not os_version_info_ex) \n {\n osvi.dwOSVersionInfoSize = sizeof(OSVERSIONINFO);\n if (not GetVersionEx((OSVERSIONINFO*) &osvi))\n return \"\";\n }\n\n if (osvi.dwMajorVersion == 5 and \n osvi.dwMinorVersion == 1 and\n osvi.wServicePackMajor == 2 and\n osvi.wServicePackMinor == 0)\n return \"Microsoft Windows XP, Service Pack 2\";\n\n if (osvi.dwMajorVersion == 5 and \n osvi.dwMinorVersion == 1 and\n osvi.wServicePackMajor == 3 and\n osvi.wServicePackMinor == 0)\n return \"Microsoft Windows XP, Service Pack 3\";\n\n if (osvi.dwMajorVersion == 6 and \n osvi.dwMinorVersion == 0 and\n osvi.wServicePackMajor == 1 and\n osvi.wServicePackMinor == 0)\n return \"Microsoft Windows Vista, Service Pack 1\";\n\n if (osvi.dwMajorVersion == 6 and \n osvi.dwMinorVersion == 0 and\n osvi.wServicePackMajor == 2 and\n osvi.wServicePackMinor == 0)\n return \"Microsoft Windows Vista, Service Pack 2\";\n\n if (osvi.dwMajorVersion == 6 and \n osvi.dwMinorVersion == 0)\n return \"Microsoft Windows Vista\";\n\n if (osvi.dwMajorVersion == 6 and \n osvi.dwMinorVersion == 1 and\n osvi.wServicePackMajor == 1 and\n osvi.wServicePackMinor == 0)\n return \"Microsoft Windows 7, Service Pack 1\";\n\n if (osvi.dwMajorVersion == 6 and \n osvi.dwMinorVersion == 1)\n return \"Microsoft Windows 7\";\n\n if (osvi.dwMajorVersion == 6 and \n osvi.dwMinorVersion == 2)\n return \"Microsoft Windows 8\";\n\n if (osvi.dwMajorVersion == 6 and \n osvi.dwMinorVersion == 3)\n return \"Microsoft Windows 8.1\";\n\n return \"Microsoft Windows\";\n}\n\nstd::string get_host_name()\n{\n wchar_t hostname[100];\n DWORD size = sizeof (hostname);\n bool hostname_fail = not GetComputerNameW(hostname, &size);\n\n return hostname_fail ? \"localhost\" : wstring_to_utf8(hostname);\n}\n\nstd::string get_user_name()\n{\n std::string user_name;\n\n uint32_t len = UNLEN + 1;\n wchar_t buffer[UNLEN + 1];\n \n if (GetUserNameW(buffer, (LPDWORD) &len))\n {\n user_name = wstring_to_utf8(buffer);\n }\n return user_name;\n}\n\nint get_process_id()\n{\n return GetCurrentProcessId();\n}\n\nstd::string get_program_name()\n{\n HANDLE process_handle = OpenProcess(PROCESS_QUERY_INFORMATION |\n PROCESS_VM_READ,\n FALSE, get_process_id());\n if (process_handle == nullptr)\n return \"\";\n\n wchar_t module_name[MAX_PATH];\n\n GetModuleFileNameEx(process_handle,\n nullptr,\n module_name, sizeof(module_name)); \n\n CloseHandle(process_handle);\n\n return wstring_to_utf8(module_name);\n}\n\nvoid get_loadavg(double avg[3])\n{\n avg[0] = avg[1] = avg[2] = 0;\n}\n\nuint64_t get_free_memory()\n{\n MEMORYSTATUSEX memory_status;\n memory_status.dwLength = sizeof(memory_status);\n\n if (not GlobalMemoryStatusEx(&memory_status))\n {\n return -1;\n }\n\n return static_cast<uint64_t>(memory_status.ullAvailPhys);\n \n}\n\nuint64_t get_total_memory()\n{\n MEMORYSTATUSEX memory_status;\n memory_status.dwLength = sizeof(memory_status);\n\n if (not GlobalMemoryStatusEx(&memory_status))\n {\n return -1;\n }\n\n return static_cast<uint64_t>(memory_status.ullTotalPhys);\n \n}\n\n} \/\/ namespace systeminfo\n} \/\/ namespace orion\n<commit_msg>Fix compilation errors with gcc.<commit_after>\/\/ SystemInfo-Win32.cpp\n\/\/\n\/\/ Copyright 2013 tomas <tomasp@videotron.ca>\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,\n\/\/ MA 02110-1301, USA.\n\n#include <orion\/SystemInfo.h>\n\n#ifndef _WIN32_WINNT\n#define _WIN32_WINNT 0x0500\n#endif\n\n#include <windows.h>\n#include <lmcons.h> \/* For UNLEN *\/\n#include <process.h>\n\n#if 0 \/\/ndef __MINGW64__\n#include <ddk\/ntifs.h>\n\ntypedef struct _SYSTEM_PROCESSOR_PERFORMANCE_INFORMATION {\nLARGE_INTEGER IdleTime;\n LARGE_INTEGER KernelTime;\n LARGE_INTEGER UserTime;\n LARGE_INTEGER DpcTime;\n LARGE_INTEGER InterruptTime;\n ULONG InterruptCount; \n} SYSTEM_PROCESSOR_PERFORMANCE_INFORMATION;\n#else\n#include <winternl.h>\n#endif\n\n#include <psapi.h>\n\n#include <orion\/StringUtils.h>\n\n#define ARRAY_SIZE(a) (sizeof(a) \/ sizeof((a)[0]))\n\nnamespace orion\n{\nnamespace systeminfo\n{\n\n\/\/--------------------------------------------------------------------\nvoid get_loaded_modules(unsigned long process_id, ModuleList& modules)\n{\n DWORD cbNeeded;\n\n \/\/ Get a list of all the modules in this process.\n HANDLE process_handle = OpenProcess(PROCESS_QUERY_INFORMATION |\n PROCESS_VM_READ,\n FALSE, \n process_id);\n if (process_handle == nullptr)\n return;\n\n HMODULE module_handles[1024];\n\n if (EnumProcessModulesEx(process_handle, module_handles, sizeof(module_handles), &cbNeeded, LIST_MODULES_ALL)) \n {\n for (int i = 0; i < (cbNeeded \/ sizeof(HMODULE)); i++) \n {\n wchar_t module_name[MAX_PATH];\n\n \/\/ Get the full path to the module's file.\n if (GetModuleFileNameExW(process_handle, module_handles[i], module_name, sizeof(module_name))) \n {\n \/\/ Print the module name and handle value.\n modules.push_back(wstring_to_utf8(module_name));\n }\n }\n }\n CloseHandle(process_handle);\n}\n\nstd::string get_cpu_model()\n{\n const uint32_t max_length = 4096;\n\n DWORD type = REG_SZ;\n HKEY hKey = nullptr;\n DWORD length = max_length;\n wchar_t value[max_length];\n\n ZeroMemory(value, max_length);\n\n const wchar_t* keyToOpen = L\"HARDWARE\\\\DESCRIPTION\\\\System\\\\CentralProcessor\\\\0\";\n const wchar_t* valueToFind = L\"ProcessorNameString\";\n\n RegOpenKeyExW(HKEY_LOCAL_MACHINE, keyToOpen, 0, KEY_READ, &hKey);\n RegQueryValueExW(hKey, valueToFind, nullptr, &type, (LPBYTE)&value, &length);\n RegCloseKey(hKey);\n\n std::string cpuName = wstring_to_utf8(value);\n\n SYSTEM_INFO sysinfo;\n ZeroMemory(&sysinfo, sizeof(SYSTEM_INFO));\n GetSystemInfo(&sysinfo);\n\n const uint64_t cpuThreadCount = sysinfo.dwNumberOfProcessors;\n std::string cpuInfo = cpuName + \" (\" + std::to_string(cpuThreadCount);\n\n if (cpuThreadCount == 1)\n cpuInfo.append(\" thread)\");\n else\n cpuInfo.append(\" threads)\");\n\n return cpuInfo;\n}\n\nstd::vector<CpuInfo> get_cpu_info()\n{\n std::vector<CpuInfo> cpu_infos;\n\n SYSTEM_INFO system_info;\n ZeroMemory(&system_info, sizeof(SYSTEM_INFO));\n\n GetSystemInfo(&system_info);\n\n int32_t cpu_count = system_info.dwNumberOfProcessors;\n\n SYSTEM_PROCESSOR_PERFORMANCE_INFORMATION* sppi = nullptr;\n ULONG result_size;\n\n DWORD sppi_size = cpu_count * sizeof(*sppi);\n sppi = (SYSTEM_PROCESSOR_PERFORMANCE_INFORMATION*)malloc(sppi_size);\n\n NTSTATUS status = NtQuerySystemInformation(SystemProcessorPerformanceInformation,\n sppi,\n sppi_size,\n &result_size);\n\n if (not NT_SUCCESS(status)) \n {\n \/\/ err = RtlNtStatusToDosError(status);\n RtlNtStatusToDosError(status);\n free(sppi);\n return cpu_infos;\n }\n\n\n for (int32_t i = 0; i < cpu_count; i++)\n {\n WCHAR key_name[128];\n HKEY processor_key;\n\n int len = _snwprintf(key_name,\n ARRAY_SIZE(key_name),\n L\"HARDWARE\\\\DESCRIPTION\\\\System\\\\CentralProcessor\\\\%d\", i);\n\n DWORD ret = RegOpenKeyExW(HKEY_LOCAL_MACHINE, key_name, 0, KEY_QUERY_VALUE, &processor_key);\n\n if (ret != ERROR_SUCCESS) \n {\n \/\/ err = GetLastError();\n \/\/ free(sppi);\n }\n\n DWORD cpu_speed;\n DWORD cpu_speed_size = sizeof(cpu_speed);\n\n ret = RegQueryValueExW(processor_key, L\"~MHz\", NULL, NULL, (BYTE*) &cpu_speed, &cpu_speed_size);\n\n if (ret != ERROR_SUCCESS) \n {\n \/\/ err = GetLastError();\n \/\/ free(sppi);\n \/\/ RegCloseKey(processor_key);\n }\n\n WCHAR cpu_brand[256];\n DWORD cpu_brand_size = sizeof(cpu_brand);\n\n ret = RegQueryValueExW(processor_key, L\"ProcessorNameString\", NULL, NULL, (BYTE*) &cpu_brand, &cpu_brand_size);\n\n if (ret != ERROR_SUCCESS) \n {\n \/\/ err = GetLastError();\n \/\/ free(sppi);\n \/\/ RegCloseKey(processor_key);\n }\n\n RegCloseKey(processor_key);\n\n CpuTimes cpu_times;\n\n cpu_times.user = sppi[i].UserTime.QuadPart \/ 10000;\n cpu_times.nice = 0;\n cpu_times.sys = (sppi[i].KernelTime.QuadPart - sppi[i].IdleTime.QuadPart) \/ 10000;\n cpu_times.idle = sppi[i].IdleTime.QuadPart \/ 10000;\n#if 0 \/\/ndef __MINGW64__\n cpu_times.irq = sppi[i].InterruptTime.QuadPart \/ 10000;\n#else\n cpu_times.irq = sppi[i].Reserved1[0].QuadPart \/ 10000;\n#endif\n\n\n len = WideCharToMultiByte(CP_UTF8, 0, cpu_brand, cpu_brand_size \/ sizeof(WCHAR), NULL, 0, NULL, NULL);\n\n if (len == 0) \n {\n \/\/ err = GetLastError();\n \/\/ free(sppi);\n }\n\n char* model = new char[len];\n\n len = WideCharToMultiByte(CP_UTF8, 0, cpu_brand, cpu_brand_size \/ sizeof(WCHAR), model, len, NULL, NULL);\n\n if (len == 0) \n {\n \/\/ err = GetLastError();\n \/\/ free(sppi);\n }\n\n CpuInfo cpu_info(model, cpu_speed, cpu_times);\n\n cpu_infos.push_back(cpu_info);\n\n delete [] model;\n }\n\n free(sppi);\n\n return cpu_infos;\n}\n\nstd::string get_os_version()\n{\n OSVERSIONINFOEXW osvi;\n\n ZeroMemory(&osvi, sizeof(OSVERSIONINFOEXW));\n\n \/\/ Try calling GetVersionEx using the OSVERSIONINFOEX structure.\n \/\/ If that fails, try using the OSVERSIONINFO structure.\n osvi.dwOSVersionInfoSize = sizeof(OSVERSIONINFOEXW);\n\n bool os_version_info_ex = GetVersionExW((OSVERSIONINFOW*) &osvi);\n\n if (not os_version_info_ex) \n {\n osvi.dwOSVersionInfoSize = sizeof(OSVERSIONINFOEXW);\n if (not GetVersionExW((OSVERSIONINFOW*) &osvi))\n return \"\";\n }\n\n if (osvi.dwMajorVersion == 5 and \n osvi.dwMinorVersion == 1 and\n osvi.wServicePackMajor == 2 and\n osvi.wServicePackMinor == 0)\n return \"Microsoft Windows XP, Service Pack 2\";\n\n if (osvi.dwMajorVersion == 5 and \n osvi.dwMinorVersion == 1 and\n osvi.wServicePackMajor == 3 and\n osvi.wServicePackMinor == 0)\n return \"Microsoft Windows XP, Service Pack 3\";\n\n if (osvi.dwMajorVersion == 6 and \n osvi.dwMinorVersion == 0 and\n osvi.wServicePackMajor == 1 and\n osvi.wServicePackMinor == 0)\n return \"Microsoft Windows Vista, Service Pack 1\";\n\n if (osvi.dwMajorVersion == 6 and \n osvi.dwMinorVersion == 0 and\n osvi.wServicePackMajor == 2 and\n osvi.wServicePackMinor == 0)\n return \"Microsoft Windows Vista, Service Pack 2\";\n\n if (osvi.dwMajorVersion == 6 and \n osvi.dwMinorVersion == 0)\n return \"Microsoft Windows Vista\";\n\n if (osvi.dwMajorVersion == 6 and \n osvi.dwMinorVersion == 1 and\n osvi.wServicePackMajor == 1 and\n osvi.wServicePackMinor == 0)\n return \"Microsoft Windows 7, Service Pack 1\";\n\n if (osvi.dwMajorVersion == 6 and \n osvi.dwMinorVersion == 1)\n return \"Microsoft Windows 7\";\n\n if (osvi.dwMajorVersion == 6 and \n osvi.dwMinorVersion == 2)\n return \"Microsoft Windows 8\";\n\n if (osvi.dwMajorVersion == 6 and \n osvi.dwMinorVersion == 3)\n return \"Microsoft Windows 8.1\";\n\n return \"Microsoft Windows\";\n}\n\nstd::string get_host_name()\n{\n wchar_t hostname[100];\n DWORD size = sizeof (hostname);\n bool hostname_fail = not GetComputerNameW(hostname, &size);\n\n return hostname_fail ? \"localhost\" : wstring_to_utf8(hostname);\n}\n\nstd::string get_user_name()\n{\n std::string user_name;\n\n uint32_t len = UNLEN + 1;\n wchar_t buffer[UNLEN + 1];\n \n if (GetUserNameW(buffer, (LPDWORD) &len))\n {\n user_name = wstring_to_utf8(buffer);\n }\n return user_name;\n}\n\nint get_process_id()\n{\n return GetCurrentProcessId();\n}\n\nstd::string get_program_name()\n{\n HANDLE process_handle = OpenProcess(PROCESS_QUERY_INFORMATION |\n PROCESS_VM_READ,\n FALSE, get_process_id());\n if (process_handle == nullptr)\n return \"\";\n\n wchar_t module_name[MAX_PATH];\n\n GetModuleFileNameExW(process_handle,\n nullptr,\n module_name, sizeof(module_name)); \n\n CloseHandle(process_handle);\n\n return wstring_to_utf8(module_name);\n}\n\nvoid get_loadavg(double avg[3])\n{\n avg[0] = avg[1] = avg[2] = 0;\n}\n\nuint64_t get_free_memory()\n{\n MEMORYSTATUSEX memory_status;\n memory_status.dwLength = sizeof(memory_status);\n\n if (not GlobalMemoryStatusEx(&memory_status))\n {\n return -1;\n }\n\n return static_cast<uint64_t>(memory_status.ullAvailPhys);\n \n}\n\nuint64_t get_total_memory()\n{\n MEMORYSTATUSEX memory_status;\n memory_status.dwLength = sizeof(memory_status);\n\n if (not GlobalMemoryStatusEx(&memory_status))\n {\n return -1;\n }\n\n return static_cast<uint64_t>(memory_status.ullTotalPhys);\n \n}\n\n} \/\/ namespace systeminfo\n} \/\/ namespace orion\n<|endoftext|>"} {"text":"<commit_before>#include <cmath>\n\n#include \"ingameelements\/weapons\/hammer.h\"\n#include \"renderer.h\"\n#include \"ingameelements\/heroes\/reinhardt.h\"\n#include \"ingameelements\/projectiles\/firestrike.h\"\n\n#include \"engine.h\"\n\nvoid Hammer::init(uint64_t id_, Gamestate &state, EntityPtr owner_)\n{\n Weapon::init(id_, state, owner_);\n\n barrierptr = state.make_entity<ReinhardtShield>(state, team, owner_);\n\n firestrikeanim.init(herofolder()+\"firestrikebackarm\/\");\n firestrikeanim.active(false);\n firestrikedelay.init(firestrikeanim.timer.duration * 0.5,\n std::bind(&Hammer::createfirestrike, this, std::placeholders::_1));\n firestrikedelay.active = false;\n}\n\nvoid Hammer::renderbehind(Renderer &renderer, Gamestate &state)\n{\n std::string mainsprite;\n Reinhardt &c = state.get<Reinhardt>(state.get<Player>(owner).character);\n if (firestrikeanim.active())\n {\n mainsprite = firestrikeanim.getframepath();\n }\n else if (barrier(state).active)\n {\n mainsprite = herofolder()+\"shield\/back\";\n\n }\n else\n {\n mainsprite = herofolder()+\"arm\/back\";\n }\n ALLEGRO_BITMAP *sprite = renderer.spriteloader.requestsprite(mainsprite);\n double spriteoffset_x = renderer.spriteloader.get_spriteoffset_x(mainsprite)*renderer.zoom;\n double spriteoffset_y = renderer.spriteloader.get_spriteoffset_y(mainsprite)*renderer.zoom;\n double rel_x = (x - renderer.cam_x)*renderer.zoom;\n double rel_y = (y - renderer.cam_y)*renderer.zoom;\n double attachpt_x = getbackattachpoint_x(state)*renderer.zoom;\n double attachpt_y = getbackattachpoint_y(state)*renderer.zoom;\n\n ALLEGRO_BITMAP *outline = renderer.spriteloader.requestspriteoutline(mainsprite);\n ALLEGRO_COLOR outlinecolor = al_map_rgb(225, 17, 17);\n\n al_set_target_bitmap(renderer.midground);\n if (c.weaponvisible(state))\n {\n if (c.isflipped)\n {\n al_draw_scaled_rotated_bitmap(sprite, spriteoffset_x, spriteoffset_y, rel_x-attachpt_x, rel_y-attachpt_y,\n -1, 1, (aimdirection+3.1415)*barrier(state).active, 0);\n if (state.get<Player>(renderer.myself).team != team)\n {\n \/\/ Draw enemy outline\n al_draw_tinted_scaled_rotated_bitmap(outline, outlinecolor, attachpt_x+spriteoffset_x, attachpt_y+spriteoffset_y, rel_x, rel_y,\n -1, 1, (aimdirection+3.1415)*barrier(state).active, 0);\n }\n }\n else\n {\n al_draw_rotated_bitmap(sprite, spriteoffset_x, spriteoffset_y, rel_x-attachpt_x, rel_y-attachpt_y, aimdirection*barrier(state).active, 0);\n if (state.get<Player>(renderer.myself).team != team)\n {\n \/\/ Draw enemy outline\n al_draw_tinted_rotated_bitmap(outline, outlinecolor, attachpt_x+spriteoffset_x, attachpt_y+spriteoffset_y, rel_x, rel_y, aimdirection*barrier(state).active, 0);\n }\n }\n }\n}\n\nvoid Hammer::render(Renderer &renderer, Gamestate &state)\n{\n std::string mainsprite;\n Reinhardt &c = state.get<Reinhardt>(state.get<Player>(owner).character);\n if (firestrikeanim.active())\n {\n mainsprite = herofolder()+\"firestrikefrontarm\/\"+std::to_string(firestrikeanim.getframe());\n }\n else if (barrier(state).active)\n {\n mainsprite = herofolder()+\"shield\/front\";\n\n }\n else\n {\n mainsprite = herofolder()+\"arm\/front\";\n }\n ALLEGRO_BITMAP *sprite = renderer.spriteloader.requestsprite(mainsprite);\n double spriteoffset_x = renderer.spriteloader.get_spriteoffset_x(mainsprite)*renderer.zoom;\n double spriteoffset_y = renderer.spriteloader.get_spriteoffset_y(mainsprite)*renderer.zoom;\n double rel_x = (x - renderer.cam_x)*renderer.zoom;\n double rel_y = (y - renderer.cam_y)*renderer.zoom;\n double attachpt_x = getattachpoint_x(state)*renderer.zoom;\n double attachpt_y = getattachpoint_y(state)*renderer.zoom;\n\n ALLEGRO_BITMAP *outline = renderer.spriteloader.requestspriteoutline(mainsprite);\n ALLEGRO_COLOR outlinecolor = al_map_rgb(225, 17, 17);\n\n al_set_target_bitmap(renderer.midground);\n if (c.weaponvisible(state))\n {\n if (c.isflipped)\n {\n al_draw_scaled_rotated_bitmap(sprite, -attachpt_x+spriteoffset_x, attachpt_y+spriteoffset_y, rel_x, rel_y, -1, 1, 0, 0);\n if (state.get<Player>(renderer.myself).team != team)\n {\n \/\/ Draw enemy outline\n al_draw_tinted_scaled_rotated_bitmap(outline, outlinecolor, attachpt_x+spriteoffset_x, attachpt_y+spriteoffset_y, rel_x, rel_y, -1, 1, 0, 0);\n }\n }\n else\n {\n al_draw_bitmap(sprite, rel_x - (attachpt_x+spriteoffset_x), rel_y - (attachpt_y+spriteoffset_y), 0);\n if (state.get<Player>(renderer.myself).team != team)\n {\n \/\/ Draw enemy outline\n al_draw_tinted_bitmap(outline, outlinecolor, rel_x - (attachpt_x+spriteoffset_x), rel_y - (attachpt_y+spriteoffset_y), 0);\n }\n }\n }\n\n barrier(state).render(renderer, state);\n}\n\nvoid Hammer::beginstep(Gamestate &state, double frametime)\n{\n Weapon::beginstep(state, frametime);\n barrier(state).beginstep(state, frametime);\n firestrikeanim.update(state, frametime);\n firestrikedelay.update(state, frametime);\n}\n\nvoid Hammer::midstep(Gamestate &state, double frametime)\n{\n Weapon::midstep(state, frametime);\n barrier(state).midstep(state, frametime);\n}\n\nvoid Hammer::endstep(Gamestate &state, double frametime)\n{\n Weapon::endstep(state, frametime);\n barrier(state).endstep(state, frametime);\n}\n\nvoid Hammer::wantfireprimary(Gamestate &state)\n{\n if (state.engine.isserver and not firinganim.active() and not firestrikeanim.active())\n {\n fireprimary(state);\n state.engine.sendbuffer.write<uint8_t>(PRIMARY_FIRED);\n state.engine.sendbuffer.write<uint8_t>(state.findplayerid(owner));\n }\n}\n\nvoid Hammer::fireprimary(Gamestate &state)\n{\n firinganim.reset();\n firinganim.active(true);\n}\n\nvoid Hammer::wantfiresecondary(Gamestate &state)\n{\n \/\/ Do nothing\n}\n\nvoid Hammer::firesecondary(Gamestate &state)\n{\n \/\/ Do nothing\n}\n\nvoid Hammer::createfirestrike(Gamestate &state)\n{\n Firestrike &firestrike = state.get<Firestrike&>(state.make_entity<Firestrike>(state, owner));\n firestrike.x = x + std::cos(aimdirection) * 40;\n firestrike.y = y + std::sin(aimdirection) * 40;\n firestrike.hspeed = firestrike.SPEED * std::cos(aimdirection);\n firestrike.vspeed = firestrike.SPEED * std::sin(aimdirection);\n}\n\ndouble Hammer::getattachpoint_x(Gamestate &state)\n{\n return 0;\n}\n\ndouble Hammer::getattachpoint_y(Gamestate &state)\n{\n return 8;\n}\n\ndouble Hammer::getbackattachpoint_x(Gamestate &state)\n{\n if (barrier(state).active)\n {\n return 6 * (state.get<Player&>(owner).getcharacter(state).isflipped ? 1:-1);\n }\n else\n {\n return 0;\n }\n}\n\ndouble Hammer::getbackattachpoint_y(Gamestate &state)\n{\n if (barrier(state).active)\n {\n return 10;\n }\n else\n {\n return 8;\n }\n}\n\nReinhardtShield& Hammer::barrier(Gamestate &state)\n{\n return state.get<ReinhardtShield>(barrierptr);\n}\n\nvoid Hammer::destroy(Gamestate &state)\n{\n barrier(state).destroy(state);\n Weapon::destroy(state);\n}\n\nvoid Hammer::interpolate(Entity &prev_entity, Entity &next_entity, double alpha)\n{\n Weapon::interpolate(prev_entity, next_entity, alpha);\n\n Hammer &prev_e = static_cast<Hammer&>(prev_entity);\n Hammer &next_e = static_cast<Hammer&>(next_entity);\n\n firestrikeanim.interpolate(prev_e.firestrikeanim, next_e.firestrikeanim, alpha);\n firestrikedelay.interpolate(prev_e.firestrikedelay, next_e.firestrikedelay, alpha);\n}<commit_msg>Removed the ability to firestrike through walls.<commit_after>#include <cmath>\n\n#include \"ingameelements\/weapons\/hammer.h\"\n#include \"renderer.h\"\n#include \"ingameelements\/heroes\/reinhardt.h\"\n#include \"ingameelements\/projectiles\/firestrike.h\"\n\n#include \"engine.h\"\n\nvoid Hammer::init(uint64_t id_, Gamestate &state, EntityPtr owner_)\n{\n Weapon::init(id_, state, owner_);\n\n barrierptr = state.make_entity<ReinhardtShield>(state, team, owner_);\n\n firestrikeanim.init(herofolder()+\"firestrikebackarm\/\");\n firestrikeanim.active(false);\n firestrikedelay.init(firestrikeanim.timer.duration * 0.5,\n std::bind(&Hammer::createfirestrike, this, std::placeholders::_1));\n firestrikedelay.active = false;\n}\n\nvoid Hammer::renderbehind(Renderer &renderer, Gamestate &state)\n{\n std::string mainsprite;\n Reinhardt &c = state.get<Reinhardt>(state.get<Player>(owner).character);\n if (firestrikeanim.active())\n {\n mainsprite = firestrikeanim.getframepath();\n }\n else if (barrier(state).active)\n {\n mainsprite = herofolder()+\"shield\/back\";\n\n }\n else\n {\n mainsprite = herofolder()+\"arm\/back\";\n }\n ALLEGRO_BITMAP *sprite = renderer.spriteloader.requestsprite(mainsprite);\n double spriteoffset_x = renderer.spriteloader.get_spriteoffset_x(mainsprite)*renderer.zoom;\n double spriteoffset_y = renderer.spriteloader.get_spriteoffset_y(mainsprite)*renderer.zoom;\n double rel_x = (x - renderer.cam_x)*renderer.zoom;\n double rel_y = (y - renderer.cam_y)*renderer.zoom;\n double attachpt_x = getbackattachpoint_x(state)*renderer.zoom;\n double attachpt_y = getbackattachpoint_y(state)*renderer.zoom;\n\n ALLEGRO_BITMAP *outline = renderer.spriteloader.requestspriteoutline(mainsprite);\n ALLEGRO_COLOR outlinecolor = al_map_rgb(225, 17, 17);\n\n al_set_target_bitmap(renderer.midground);\n if (c.weaponvisible(state))\n {\n if (c.isflipped)\n {\n al_draw_scaled_rotated_bitmap(sprite, spriteoffset_x, spriteoffset_y, rel_x-attachpt_x, rel_y-attachpt_y,\n -1, 1, (aimdirection+3.1415)*barrier(state).active, 0);\n if (state.get<Player>(renderer.myself).team != team)\n {\n \/\/ Draw enemy outline\n al_draw_tinted_scaled_rotated_bitmap(outline, outlinecolor, attachpt_x+spriteoffset_x, attachpt_y+spriteoffset_y, rel_x, rel_y,\n -1, 1, (aimdirection+3.1415)*barrier(state).active, 0);\n }\n }\n else\n {\n al_draw_rotated_bitmap(sprite, spriteoffset_x, spriteoffset_y, rel_x-attachpt_x, rel_y-attachpt_y, aimdirection*barrier(state).active, 0);\n if (state.get<Player>(renderer.myself).team != team)\n {\n \/\/ Draw enemy outline\n al_draw_tinted_rotated_bitmap(outline, outlinecolor, attachpt_x+spriteoffset_x, attachpt_y+spriteoffset_y, rel_x, rel_y, aimdirection*barrier(state).active, 0);\n }\n }\n }\n}\n\nvoid Hammer::render(Renderer &renderer, Gamestate &state)\n{\n std::string mainsprite;\n Reinhardt &c = state.get<Reinhardt>(state.get<Player>(owner).character);\n if (firestrikeanim.active())\n {\n mainsprite = herofolder()+\"firestrikefrontarm\/\"+std::to_string(firestrikeanim.getframe());\n }\n else if (barrier(state).active)\n {\n mainsprite = herofolder()+\"shield\/front\";\n\n }\n else\n {\n mainsprite = herofolder()+\"arm\/front\";\n }\n ALLEGRO_BITMAP *sprite = renderer.spriteloader.requestsprite(mainsprite);\n double spriteoffset_x = renderer.spriteloader.get_spriteoffset_x(mainsprite)*renderer.zoom;\n double spriteoffset_y = renderer.spriteloader.get_spriteoffset_y(mainsprite)*renderer.zoom;\n double rel_x = (x - renderer.cam_x)*renderer.zoom;\n double rel_y = (y - renderer.cam_y)*renderer.zoom;\n double attachpt_x = getattachpoint_x(state)*renderer.zoom;\n double attachpt_y = getattachpoint_y(state)*renderer.zoom;\n\n ALLEGRO_BITMAP *outline = renderer.spriteloader.requestspriteoutline(mainsprite);\n ALLEGRO_COLOR outlinecolor = al_map_rgb(225, 17, 17);\n\n al_set_target_bitmap(renderer.midground);\n if (c.weaponvisible(state))\n {\n if (c.isflipped)\n {\n al_draw_scaled_rotated_bitmap(sprite, -attachpt_x+spriteoffset_x, attachpt_y+spriteoffset_y, rel_x, rel_y, -1, 1, 0, 0);\n if (state.get<Player>(renderer.myself).team != team)\n {\n \/\/ Draw enemy outline\n al_draw_tinted_scaled_rotated_bitmap(outline, outlinecolor, attachpt_x+spriteoffset_x, attachpt_y+spriteoffset_y, rel_x, rel_y, -1, 1, 0, 0);\n }\n }\n else\n {\n al_draw_bitmap(sprite, rel_x - (attachpt_x+spriteoffset_x), rel_y - (attachpt_y+spriteoffset_y), 0);\n if (state.get<Player>(renderer.myself).team != team)\n {\n \/\/ Draw enemy outline\n al_draw_tinted_bitmap(outline, outlinecolor, rel_x - (attachpt_x+spriteoffset_x), rel_y - (attachpt_y+spriteoffset_y), 0);\n }\n }\n }\n\n barrier(state).render(renderer, state);\n}\n\nvoid Hammer::beginstep(Gamestate &state, double frametime)\n{\n Weapon::beginstep(state, frametime);\n barrier(state).beginstep(state, frametime);\n firestrikeanim.update(state, frametime);\n firestrikedelay.update(state, frametime);\n}\n\nvoid Hammer::midstep(Gamestate &state, double frametime)\n{\n Weapon::midstep(state, frametime);\n barrier(state).midstep(state, frametime);\n}\n\nvoid Hammer::endstep(Gamestate &state, double frametime)\n{\n Weapon::endstep(state, frametime);\n barrier(state).endstep(state, frametime);\n}\n\nvoid Hammer::wantfireprimary(Gamestate &state)\n{\n if (state.engine.isserver and not firinganim.active() and not firestrikeanim.active())\n {\n fireprimary(state);\n state.engine.sendbuffer.write<uint8_t>(PRIMARY_FIRED);\n state.engine.sendbuffer.write<uint8_t>(state.findplayerid(owner));\n }\n}\n\nvoid Hammer::fireprimary(Gamestate &state)\n{\n firinganim.reset();\n firinganim.active(true);\n}\n\nvoid Hammer::wantfiresecondary(Gamestate &state)\n{\n \/\/ Do nothing\n}\n\nvoid Hammer::firesecondary(Gamestate &state)\n{\n \/\/ Do nothing\n}\n\nvoid Hammer::createfirestrike(Gamestate &state)\n{\n Firestrike &firestrike = state.get<Firestrike&>(state.make_entity<Firestrike>(state, owner));\n firestrike.x = x + std::cos(aimdirection) * 40;\n firestrike.y = y + std::sin(aimdirection) * 40;\n firestrike.hspeed = firestrike.SPEED * std::cos(aimdirection);\n firestrike.vspeed = firestrike.SPEED * std::sin(aimdirection);\n\n if (state.currentmap->collideline(x, y, firestrike.x, firestrike.y))\n {\n firestrike.destroy(state);\n }\n}\n\ndouble Hammer::getattachpoint_x(Gamestate &state)\n{\n return 0;\n}\n\ndouble Hammer::getattachpoint_y(Gamestate &state)\n{\n return 8;\n}\n\ndouble Hammer::getbackattachpoint_x(Gamestate &state)\n{\n if (barrier(state).active)\n {\n return 6 * (state.get<Player&>(owner).getcharacter(state).isflipped ? 1:-1);\n }\n else\n {\n return 0;\n }\n}\n\ndouble Hammer::getbackattachpoint_y(Gamestate &state)\n{\n if (barrier(state).active)\n {\n return 10;\n }\n else\n {\n return 8;\n }\n}\n\nReinhardtShield& Hammer::barrier(Gamestate &state)\n{\n return state.get<ReinhardtShield>(barrierptr);\n}\n\nvoid Hammer::destroy(Gamestate &state)\n{\n barrier(state).destroy(state);\n Weapon::destroy(state);\n}\n\nvoid Hammer::interpolate(Entity &prev_entity, Entity &next_entity, double alpha)\n{\n Weapon::interpolate(prev_entity, next_entity, alpha);\n\n Hammer &prev_e = static_cast<Hammer&>(prev_entity);\n Hammer &next_e = static_cast<Hammer&>(next_entity);\n\n firestrikeanim.interpolate(prev_e.firestrikeanim, next_e.firestrikeanim, alpha);\n firestrikedelay.interpolate(prev_e.firestrikedelay, next_e.firestrikedelay, alpha);\n}<|endoftext|>"} {"text":"<commit_before>\n#pragma once\n\n#include \"quantities\/named_quantities.hpp\"\n\nnamespace principia {\nnamespace numerics {\nnamespace internal_arrays {\n\nusing quantities::Quotient;\nusing quantities::SquareRoot;\n\ntemplate<typename T>\nstruct CholeskyGenerator;\n\ntemplate<typename Scalar, template<typename S> typename UpperTriangularMatrix>\nstruct CholeskyGenerator<UpperTriangularMatrix<Scalar>> {\n using type = UpperTriangularMatrix<SquareRoot<Scalar>>;\n};\n\ntemplate<typename Scalar, int columns,\n template<typename S, int c> typename UpperTriangularMatrix>\nstruct CholeskyGenerator<UpperTriangularMatrix<Scalar, columns>> {\n using type = UpperTriangularMatrix<SquareRoot<Scalar>, columns>;\n};\n\n\n\/\/ If A is the upper half of a symmetric positive definite matrix, returns R so\n\/\/ that A = ᵗR R.\ntemplate<typename UpperTriangularMatrix>\ntypename CholeskyGenerator<UpperTriangularMatrix>::type\nCholeskyDecomposition(UpperTriangularMatrix const& A);\n\n\/\/ If A is the upper half of a symmetric matrix, returns R and D so that\n\/\/ A = ᵗR D R. The diagonal matrix is represented as a vector.\ntemplate<typename Scalar,\n template<typename S> typename UpperTriangularMatrix,\n template<typename S> typename Vector>\nvoid ᵗRDRDecomposition(UpperTriangularMatrix<Scalar> const& A,\n UpperTriangularMatrix<double>& R,\n Vector<Scalar>& D);\n\n\/\/ Returns x such that U x = b.\ntemplate<typename LScalar, typename RScalar,\n template<typename S> typename UpperTriangularMatrix,\n template<typename S> typename Vector>\nVector<Quotient<RScalar, LScalar>> BackSubstitution(\n UpperTriangularMatrix<LScalar> const& U,\n Vector<RScalar> const& b);\n\n\/\/ Return x such that L x = b.\ntemplate<typename LScalar, typename RScalar,\n template<typename S> typename LowerTriangularMatrix,\n template<typename S> typename Vector>\nVector<Quotient<RScalar, LScalar>> ForwardSubstitution(\n LowerTriangularMatrix<LScalar> const& L,\n Vector<RScalar> const& b);\n\n} \/\/ namespace internal_arrays\n\nusing internal_arrays::BackSubstitution;\nusing internal_arrays::CholeskyDecomposition;\nusing internal_arrays::ForwardSubstitution;\nusing internal_arrays::ᵗRDRDecomposition;\n\n} \/\/ namespace numerics\n} \/\/ namespace principia\n\n#include \"numerics\/matrix_computations_body.hpp\"\n<commit_msg>RDR generator.<commit_after>\n#pragma once\n\n#include \"quantities\/named_quantities.hpp\"\n\nnamespace principia {\nnamespace numerics {\nnamespace internal_arrays {\n\nusing quantities::Quotient;\nusing quantities::SquareRoot;\n\ntemplate<typename T>\nstruct CholeskyGenerator;\n\ntemplate<typename Scalar, template<typename S> typename UpperTriangularMatrix>\nstruct CholeskyGenerator<UpperTriangularMatrix<Scalar>> {\n using type = UpperTriangularMatrix<SquareRoot<Scalar>>;\n};\n\ntemplate<typename Scalar, int columns,\n template<typename S, int c> typename UpperTriangularMatrix>\nstruct CholeskyGenerator<UpperTriangularMatrix<Scalar, columns>> {\n using type = UpperTriangularMatrix<SquareRoot<Scalar>, columns>;\n};\n\ntemplate<typename T1, typename T2>\nstruct ᵗRDRGenerator;\n\ntemplate<typename Scalar,\n template<typename S> typename Vector,\n template<typename S> typename UpperTriangularMatrix>\nstruct ᵗRDRGenerator<UpperTriangularMatrix<Scalar>, Vector<Scalar>> {\n struct type {\n UpperTriangularMatrix<double> R;\n Vector<Scalar> D;\n };\n};\n\ntemplate<typename Scalar, int columns,\n template<typename S, int c> typename Vector,\n template<typename S, int c> typename UpperTriangularMatrix>\nstruct ᵗRDRGenerator<UpperTriangularMatrix<Scalar, columns>,\n Vector<Scalar, columns>> {\n struct type {\n UpperTriangularMatrix<double, columns> R;\n Vector<Scalar, columns>& D;\n };\n};\n\n\n\/\/ If A is the upper half of a symmetric positive definite matrix, returns R so\n\/\/ that A = ᵗR R.\ntemplate<typename UpperTriangularMatrix>\ntypename CholeskyGenerator<UpperTriangularMatrix>::type\nCholeskyDecomposition(UpperTriangularMatrix const& A);\n\n\/\/ If A is the upper half of a symmetric matrix, returns R and D so that\n\/\/ A = ᵗR D R. The diagonal matrix is represented as a vector.\ntemplate<typename Vector, typename UpperTriangularMatrix>\ntypename ᵗRDRGenerator<Vector, UpperTriangularMatrix>::type\nᵗRDRDecomposition(UpperTriangularMatrix const& A);\n\n\/\/ Returns x such that U x = b.\ntemplate<typename LScalar, typename RScalar,\n template<typename S> typename UpperTriangularMatrix,\n template<typename S> typename Vector>\nVector<Quotient<RScalar, LScalar>> BackSubstitution(\n UpperTriangularMatrix<LScalar> const& U,\n Vector<RScalar> const& b);\n\n\/\/ Return x such that L x = b.\ntemplate<typename LScalar, typename RScalar,\n template<typename S> typename LowerTriangularMatrix,\n template<typename S> typename Vector>\nVector<Quotient<RScalar, LScalar>> ForwardSubstitution(\n LowerTriangularMatrix<LScalar> const& L,\n Vector<RScalar> const& b);\n\n} \/\/ namespace internal_arrays\n\nusing internal_arrays::BackSubstitution;\nusing internal_arrays::CholeskyDecomposition;\nusing internal_arrays::ForwardSubstitution;\nusing internal_arrays::ᵗRDRDecomposition;\n\n} \/\/ namespace numerics\n} \/\/ namespace principia\n\n#include \"numerics\/matrix_computations_body.hpp\"\n<|endoftext|>"} {"text":"<commit_before>\/**\n * @File: FootTrajectoryGenerator.cpp\n *\n * @author <a href=\"mailto:xu@informatik.hu-berlin.de\">Xu, Yuan<\/a>\n * foot trajectory for walking\n *\/\n\n\n#include \"FootTrajectoryGenerator.h\"\n\nusing namespace std;\n\nPose3D FootTrajectorGenerator::genTrajectory(\n const Pose3D& oldFoot, const Pose3D& targetFoot,\n double cycle, double samplesDoubleSupport, double samplesSingleSupport, double extendDoubleSupport,\n double stepHeight, double footPitchOffset, double footYawOffset, double footRollOffset, double curveFactor)\n{\n double doubleSupportEnd = samplesDoubleSupport \/ 2 + extendDoubleSupport;\n double doubleSupportBegin = samplesDoubleSupport \/ 2 + samplesSingleSupport;\n samplesSingleSupport -= extendDoubleSupport;\n\n if (cycle <= doubleSupportEnd)\n {\n return oldFoot;\n }\n else if (cycle <= doubleSupportBegin)\n {\n \/\/ cout<<\"foot stat 1\"<<endl;\n double t = 1 - (doubleSupportBegin - cycle) \/ samplesSingleSupport;\n \/\/ double xp = 10*t*t*t - 15*t*t*t*t + 6*t*t*t*t*t;\n \/\/double xp = 1 \/ (1 + exp(-(t - 0.5) * curveFactor)); \/\/ this one has jumps for some values of curveFactor\n double xp = (1 - cos(t*Math::pi))*0.5;\n \/\/ double xp = exp( -1 * exp(-10*(t-0.5)) );\n \/\/ double yp = 16*t*t - 32*t*t*t + 16*t*t*t*t;\n \/\/ cout<<\"t = \"<<t<<endl;\n t = t * Math::pi - Math::pi_2;\n \/\/ double xp = (1+sin(t))*0.5;\n double yp = (1 + cos(t * 2))*0.5; \/\/cos(t);\n \/\/ if (t < 0) yp = cos(t);\n \/\/ cout<<\"t= \"<<t<<\" yp=\"<<yp<<endl;\n\n Pose3D foot;\n foot.translation.z = targetFoot.translation.z + yp*stepHeight;\n\n foot.translation.x = (1.0 - xp) * oldFoot.translation.x + xp * targetFoot.translation.x;\n foot.translation.y = (1.0 - xp) * oldFoot.translation.y + xp * targetFoot.translation.y;\n\n foot.rotation = RotationMatrix::getRotationX(footRollOffset * yp);\n foot.rotation.rotateY(Math::sgn(targetFoot.translation.x - oldFoot.translation.x) * footPitchOffset * yp);\n RotationMatrix rot = RotationMatrix::interpolate(oldFoot.rotation, targetFoot.rotation, xp);\n foot.rotation *= rot;\n\n return foot;\n }\n else\n {\n return targetFoot;\n }\n}\n\n\nPose3D FootTrajectorGenerator::stepControl(\n const Pose3D& oldFoot, \n const Pose3D& targetFoot,\n double cycle, \n double samplesDoubleSupport, \n double samplesSingleSupport, \n double extendDoubleSupport,\n double stepHeight, \n double footPitchOffset, \n double footYawOffset, \n double footRollOffset, \n double curveFactor,\n double speedDirection\n )\n{\n double doubleSupportEnd = samplesDoubleSupport \/ 2 + extendDoubleSupport;\n double doubleSupportBegin = samplesDoubleSupport \/ 2 + samplesSingleSupport;\n samplesSingleSupport -= extendDoubleSupport;\n\n if (cycle <= doubleSupportEnd)\n {\n return oldFoot;\n }\n else if (cycle <= doubleSupportBegin)\n {\n double t = 1 - (doubleSupportBegin - cycle) \/ samplesSingleSupport;\n \/\/double xp = 1 \/ (1 + exp(-(t - 0.5) * curveFactor));\/\/ this one has jumps for some values of curveFactor\n double xp = (1 - cos(t*Math::pi))*0.5;\n t = t * Math::pi - Math::pi_2;\n double zp = (1 + cos(t * 2))*0.5;\n\n \/\/ TODO: optmize\n Pose3D speedTarget = targetFoot;\n speedTarget.translate(cos(speedDirection)*30, sin(speedDirection)*30, 0);\n vector<Vector2<double> > vecX;\n vecX.push_back(Vector2<double>(0, oldFoot.translation.x));\n vecX.push_back(Vector2<double>(1, targetFoot.translation.x));\n vecX.push_back(Vector2<double>(1.1, speedTarget.translation.x));\n CubicSpline theCubicSplineX;\n theCubicSplineX.init(vecX);\n\n vector<Vector2<double> > vecY;\n vecY.push_back(Vector2<double>(0, oldFoot.translation.y));\n vecY.push_back(Vector2<double>(1, targetFoot.translation.y));\n vecY.push_back(Vector2<double>(1.1, speedTarget.translation.y));\n CubicSpline theCubicSplineY;\n theCubicSplineY.init(vecY);\n\n Pose3D foot;\n foot.translation.z = targetFoot.translation.z + zp*stepHeight;\n\n foot.translation.x = theCubicSplineX.y(xp);\n foot.translation.y = theCubicSplineY.y(xp);\n\n foot.rotation = RotationMatrix::getRotationX(footRollOffset * zp);\n foot.rotation.rotateY(Math::sgn(targetFoot.translation.x - oldFoot.translation.x) * footPitchOffset * zp);\n RotationMatrix rot = RotationMatrix::interpolate(oldFoot.rotation, targetFoot.rotation, xp);\n foot.rotation *= rot;\n\n return foot;\n }\n else\n {\n return targetFoot;\n }\n}\n<commit_msg>feature: first idea for a better trajectory for a kick<commit_after>\/**\n * @File: FootTrajectoryGenerator.cpp\n *\n * @author <a href=\"mailto:xu@informatik.hu-berlin.de\">Xu, Yuan<\/a>\n * foot trajectory for walking\n *\/\n\n\n#include \"FootTrajectoryGenerator.h\"\n\nusing namespace std;\n\nPose3D FootTrajectorGenerator::genTrajectory(\n const Pose3D& oldFoot, const Pose3D& targetFoot,\n double cycle, double samplesDoubleSupport, double samplesSingleSupport, double extendDoubleSupport,\n double stepHeight, double footPitchOffset, double footYawOffset, double footRollOffset, double curveFactor)\n{\n double doubleSupportEnd = samplesDoubleSupport \/ 2 + extendDoubleSupport;\n double doubleSupportBegin = samplesDoubleSupport \/ 2 + samplesSingleSupport;\n samplesSingleSupport -= extendDoubleSupport;\n\n if (cycle <= doubleSupportEnd)\n {\n return oldFoot;\n }\n else if (cycle <= doubleSupportBegin)\n {\n double t = 1 - (doubleSupportBegin - cycle) \/ samplesSingleSupport;\n\n \/\/ parameter for the step curve\n \/\/ NOTE: xp is used to interpolate the motion in x\/y-plane, while\n \/\/ yp is for the mition in the z-axis\n double xp = (1 - cos(t*Math::pi))*0.5;\n double yp = (1 - cos(t*Math::pi2))*0.5;\n\n Pose3D foot;\n foot.translation.z = targetFoot.translation.z + yp*stepHeight;\n\n foot.translation.x = (1.0 - xp) * oldFoot.translation.x + xp * targetFoot.translation.x;\n foot.translation.y = (1.0 - xp) * oldFoot.translation.y + xp * targetFoot.translation.y;\n\n foot.rotation = RotationMatrix::getRotationX(footRollOffset * yp);\n foot.rotation.rotateY(Math::sgn(targetFoot.translation.x - oldFoot.translation.x) * footPitchOffset * yp);\n RotationMatrix rot = RotationMatrix::interpolate(oldFoot.rotation, targetFoot.rotation, xp);\n foot.rotation *= rot;\n\n return foot;\n }\n else\n {\n return targetFoot;\n }\n}\n\n\nPose3D FootTrajectorGenerator::stepControl(\n const Pose3D& oldFoot, \n const Pose3D& targetFoot,\n double cycle, \n double samplesDoubleSupport, \n double samplesSingleSupport, \n double extendDoubleSupport,\n double stepHeight, \n double footPitchOffset, \n double footYawOffset, \n double footRollOffset, \n double curveFactor,\n double speedDirection\n )\n{\n double doubleSupportEnd = samplesDoubleSupport \/ 2 + extendDoubleSupport;\n double doubleSupportBegin = samplesDoubleSupport \/ 2 + samplesSingleSupport;\n samplesSingleSupport -= extendDoubleSupport;\n\n if (cycle <= doubleSupportEnd)\n {\n return oldFoot;\n }\n else if (cycle <= doubleSupportBegin)\n {\n double t = 1 - (doubleSupportBegin - cycle) \/ samplesSingleSupport;\n \/\/double xp = 1 \/ (1 + exp(-(t - 0.5) * curveFactor));\/\/ this one has jumps for some values of curveFactor\n double xp = (1 - cos(t*Math::pi))*0.5;\n double zp = (1 - cos(t*Math::pi2))*0.5;\n\n double s = 0.7;\n\n if(t < s) {\n xp = (1 - cos(t\/s*Math::pi))*0.5;\n } else {\n xp = 1.0;\n }\n\n \/\/ TODO: optmize\n Pose3D speedTarget = targetFoot;\n speedTarget.translate(cos(speedDirection)*30, sin(speedDirection)*30, 0);\n vector<Vector2<double> > vecX;\n vecX.push_back(Vector2<double>(0, oldFoot.translation.x));\n vecX.push_back(Vector2<double>(1, targetFoot.translation.x));\n vecX.push_back(Vector2<double>(1.1, speedTarget.translation.x));\n CubicSpline theCubicSplineX;\n theCubicSplineX.init(vecX);\n\n vector<Vector2<double> > vecY;\n vecY.push_back(Vector2<double>(0, oldFoot.translation.y));\n vecY.push_back(Vector2<double>(1, targetFoot.translation.y));\n vecY.push_back(Vector2<double>(1.1, speedTarget.translation.y));\n CubicSpline theCubicSplineY;\n theCubicSplineY.init(vecY);\n\n Pose3D foot;\n foot.translation.z = targetFoot.translation.z + zp*stepHeight;\n\n foot.translation.x = theCubicSplineX.y(xp);\n foot.translation.y = theCubicSplineY.y(xp);\n\n foot.rotation = RotationMatrix::getRotationX(footRollOffset * zp);\n foot.rotation.rotateY(Math::sgn(targetFoot.translation.x - oldFoot.translation.x) * footPitchOffset * zp);\n RotationMatrix rot = RotationMatrix::interpolate(oldFoot.rotation, targetFoot.rotation, xp);\n foot.rotation *= rot;\n\n return foot;\n }\n else\n {\n return targetFoot;\n }\n}\n<|endoftext|>"} {"text":"<commit_before>\/\/===-- asan_globals.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\/\/ Handle globals.\n\/\/===----------------------------------------------------------------------===\/\/\n#include \"asan_interceptors.h\"\n#include \"asan_internal.h\"\n#include \"asan_mapping.h\"\n#include \"asan_poisoning.h\"\n#include \"asan_report.h\"\n#include \"asan_stack.h\"\n#include \"asan_stats.h\"\n#include \"asan_thread.h\"\n#include \"sanitizer_common\/sanitizer_common.h\"\n#include \"sanitizer_common\/sanitizer_mutex.h\"\n#include \"sanitizer_common\/sanitizer_placement_new.h\"\n#include \"sanitizer_common\/sanitizer_stackdepot.h\"\n\nnamespace __asan {\n\ntypedef __asan_global Global;\n\nstruct ListOfGlobals {\n const Global *g;\n ListOfGlobals *next;\n};\n\nstatic BlockingMutex mu_for_globals(LINKER_INITIALIZED);\nstatic LowLevelAllocator allocator_for_globals;\nstatic ListOfGlobals *list_of_all_globals;\n\nstatic const int kDynamicInitGlobalsInitialCapacity = 512;\nstruct DynInitGlobal {\n Global g;\n bool initialized;\n};\ntypedef InternalMmapVector<DynInitGlobal> VectorOfGlobals;\n\/\/ Lazy-initialized and never deleted.\nstatic VectorOfGlobals *dynamic_init_globals;\n\n\/\/ We want to remember where a certain range of globals was registered.\nstruct GlobalRegistrationSite {\n u32 stack_id;\n Global *g_first, *g_last;\n};\ntypedef InternalMmapVector<GlobalRegistrationSite> GlobalRegistrationSiteVector;\nstatic GlobalRegistrationSiteVector *global_registration_site_vector;\n\nALWAYS_INLINE void PoisonShadowForGlobal(const Global *g, u8 value) {\n FastPoisonShadow(g->beg, g->size_with_redzone, value);\n}\n\nALWAYS_INLINE void PoisonRedZones(const Global &g) {\n uptr aligned_size = RoundUpTo(g.size, SHADOW_GRANULARITY);\n FastPoisonShadow(g.beg + aligned_size, g.size_with_redzone - aligned_size,\n kAsanGlobalRedzoneMagic);\n if (g.size != aligned_size) {\n FastPoisonShadowPartialRightRedzone(\n g.beg + RoundDownTo(g.size, SHADOW_GRANULARITY),\n g.size % SHADOW_GRANULARITY,\n SHADOW_GRANULARITY,\n kAsanGlobalRedzoneMagic);\n }\n}\n\nconst uptr kMinimalDistanceFromAnotherGlobal = 64;\n\nbool IsAddressNearGlobal(uptr addr, const __asan_global &g) {\n if (addr <= g.beg - kMinimalDistanceFromAnotherGlobal) return false;\n if (addr >= g.beg + g.size_with_redzone) return false;\n return true;\n}\n\nstatic void ReportGlobal(const Global &g, const char *prefix) {\n Report(\"%s Global[%p]: beg=%p size=%zu\/%zu name=%s module=%s dyn_init=%zu\\n\",\n prefix, &g, (void *)g.beg, g.size, g.size_with_redzone, g.name,\n g.module_name, g.has_dynamic_init);\n if (g.location) {\n Report(\" location (%p): name=%s[%p], %d %d\\n\", g.location,\n g.location->filename, g.location->filename, g.location->line_no,\n g.location->column_no);\n }\n}\n\nstatic bool DescribeOrGetInfoIfGlobal(uptr addr, uptr size, bool print,\n Global *output_global) {\n if (!flags()->report_globals) return false;\n BlockingMutexLock lock(&mu_for_globals);\n bool res = false;\n for (ListOfGlobals *l = list_of_all_globals; l; l = l->next) {\n const Global &g = *l->g;\n if (print) {\n if (flags()->report_globals >= 2)\n ReportGlobal(g, \"Search\");\n res |= DescribeAddressRelativeToGlobal(addr, size, g);\n } else {\n if (IsAddressNearGlobal(addr, g)) {\n CHECK(output_global);\n *output_global = g;\n return true;\n }\n }\n }\n return res;\n}\n\nbool DescribeAddressIfGlobal(uptr addr, uptr size) {\n return DescribeOrGetInfoIfGlobal(addr, size, \/* print *\/ true,\n \/* output_global *\/ nullptr);\n}\n\nbool GetInfoForAddressIfGlobal(uptr addr, AddressDescription *descr) {\n Global g = {};\n if (DescribeOrGetInfoIfGlobal(addr, \/* size *\/ 1, \/* print *\/ false, &g)) {\n internal_strncpy(descr->name, g.name, descr->name_size);\n descr->region_address = g.beg;\n descr->region_size = g.size;\n descr->region_kind = \"global\";\n return true;\n }\n return false;\n}\n\nu32 FindRegistrationSite(const Global *g) {\n CHECK(global_registration_site_vector);\n for (uptr i = 0, n = global_registration_site_vector->size(); i < n; i++) {\n GlobalRegistrationSite &grs = (*global_registration_site_vector)[i];\n if (g >= grs.g_first && g <= grs.g_last)\n return grs.stack_id;\n }\n return 0;\n}\n\n\/\/ Register a global variable.\n\/\/ This function may be called more than once for every global\n\/\/ so we store the globals in a map.\nstatic void RegisterGlobal(const Global *g) {\n CHECK(asan_inited);\n if (flags()->report_globals >= 2)\n ReportGlobal(*g, \"Added\");\n CHECK(flags()->report_globals);\n CHECK(AddrIsInMem(g->beg));\n CHECK(AddrIsAlignedByGranularity(g->beg));\n CHECK(AddrIsAlignedByGranularity(g->size_with_redzone));\n if (flags()->detect_odr_violation) {\n \/\/ Try detecting ODR (One Definition Rule) violation, i.e. the situation\n \/\/ where two globals with the same name are defined in different modules.\n if (__asan_region_is_poisoned(g->beg, g->size_with_redzone)) {\n \/\/ This check may not be enough: if the first global is much larger\n \/\/ the entire redzone of the second global may be within the first global.\n for (ListOfGlobals *l = list_of_all_globals; l; l = l->next) {\n if (g->beg == l->g->beg &&\n (flags()->detect_odr_violation >= 2 || g->size != l->g->size))\n ReportODRViolation(g, FindRegistrationSite(g),\n l->g, FindRegistrationSite(l->g));\n }\n }\n }\n if (CanPoisonMemory())\n PoisonRedZones(*g);\n ListOfGlobals *l = new(allocator_for_globals) ListOfGlobals;\n l->g = g;\n l->next = list_of_all_globals;\n list_of_all_globals = l;\n if (g->has_dynamic_init) {\n if (dynamic_init_globals == 0) {\n dynamic_init_globals = new(allocator_for_globals)\n VectorOfGlobals(kDynamicInitGlobalsInitialCapacity);\n }\n DynInitGlobal dyn_global = { *g, false };\n dynamic_init_globals->push_back(dyn_global);\n }\n}\n\nstatic void UnregisterGlobal(const Global *g) {\n CHECK(asan_inited);\n CHECK(flags()->report_globals);\n CHECK(AddrIsInMem(g->beg));\n CHECK(AddrIsAlignedByGranularity(g->beg));\n CHECK(AddrIsAlignedByGranularity(g->size_with_redzone));\n if (CanPoisonMemory())\n PoisonShadowForGlobal(g, 0);\n \/\/ We unpoison the shadow memory for the global but we do not remove it from\n \/\/ the list because that would require O(n^2) time with the current list\n \/\/ implementation. It might not be worth doing anyway.\n}\n\nvoid StopInitOrderChecking() {\n BlockingMutexLock lock(&mu_for_globals);\n if (!flags()->check_initialization_order || !dynamic_init_globals)\n return;\n flags()->check_initialization_order = false;\n for (uptr i = 0, n = dynamic_init_globals->size(); i < n; ++i) {\n DynInitGlobal &dyn_g = (*dynamic_init_globals)[i];\n const Global *g = &dyn_g.g;\n \/\/ Unpoison the whole global.\n PoisonShadowForGlobal(g, 0);\n \/\/ Poison redzones back.\n PoisonRedZones(*g);\n }\n}\n\n} \/\/ namespace __asan\n\n\/\/ ---------------------- Interface ---------------- {{{1\nusing namespace __asan; \/\/ NOLINT\n\n\/\/ Register an array of globals.\nvoid __asan_register_globals(__asan_global *globals, uptr n) {\n if (!flags()->report_globals) return;\n GET_STACK_TRACE_FATAL_HERE;\n u32 stack_id = StackDepotPut(stack);\n BlockingMutexLock lock(&mu_for_globals);\n if (!global_registration_site_vector)\n global_registration_site_vector =\n new(allocator_for_globals) GlobalRegistrationSiteVector(128);\n GlobalRegistrationSite site = {stack_id, &globals[0], &globals[n - 1]};\n global_registration_site_vector->push_back(site);\n if (flags()->report_globals >= 2) {\n PRINT_CURRENT_STACK();\n Printf(\"=== ID %d; %p %p\\n\", stack_id, &globals[0], &globals[n - 1]);\n }\n for (uptr i = 0; i < n; i++) {\n RegisterGlobal(&globals[i]);\n }\n}\n\n\/\/ Unregister an array of globals.\n\/\/ We must do this when a shared objects gets dlclosed.\nvoid __asan_unregister_globals(__asan_global *globals, uptr n) {\n if (!flags()->report_globals) return;\n BlockingMutexLock lock(&mu_for_globals);\n for (uptr i = 0; i < n; i++) {\n UnregisterGlobal(&globals[i]);\n }\n}\n\n\/\/ This method runs immediately prior to dynamic initialization in each TU,\n\/\/ when all dynamically initialized globals are unpoisoned. This method\n\/\/ poisons all global variables not defined in this TU, so that a dynamic\n\/\/ initializer can only touch global variables in the same TU.\nvoid __asan_before_dynamic_init(const char *module_name) {\n if (!flags()->check_initialization_order ||\n !CanPoisonMemory())\n return;\n bool strict_init_order = flags()->strict_init_order;\n CHECK(dynamic_init_globals);\n CHECK(module_name);\n CHECK(asan_inited);\n BlockingMutexLock lock(&mu_for_globals);\n if (flags()->report_globals >= 3)\n Printf(\"DynInitPoison module: %s\\n\", module_name);\n for (uptr i = 0, n = dynamic_init_globals->size(); i < n; ++i) {\n DynInitGlobal &dyn_g = (*dynamic_init_globals)[i];\n const Global *g = &dyn_g.g;\n if (dyn_g.initialized)\n continue;\n if (g->module_name != module_name)\n PoisonShadowForGlobal(g, kAsanInitializationOrderMagic);\n else if (!strict_init_order)\n dyn_g.initialized = true;\n }\n}\n\n\/\/ This method runs immediately after dynamic initialization in each TU, when\n\/\/ all dynamically initialized globals except for those defined in the current\n\/\/ TU are poisoned. It simply unpoisons all dynamically initialized globals.\nvoid __asan_after_dynamic_init() {\n if (!flags()->check_initialization_order ||\n !CanPoisonMemory())\n return;\n CHECK(asan_inited);\n BlockingMutexLock lock(&mu_for_globals);\n \/\/ FIXME: Optionally report that we're unpoisoning globals from a module.\n for (uptr i = 0, n = dynamic_init_globals->size(); i < n; ++i) {\n DynInitGlobal &dyn_g = (*dynamic_init_globals)[i];\n const Global *g = &dyn_g.g;\n if (!dyn_g.initialized) {\n \/\/ Unpoison the whole global.\n PoisonShadowForGlobal(g, 0);\n \/\/ Poison redzones back.\n PoisonRedZones(*g);\n }\n }\n}\n<commit_msg>[ASan] Print out a diagnostic when a global is unregistered<commit_after>\/\/===-- asan_globals.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\/\/ Handle globals.\n\/\/===----------------------------------------------------------------------===\/\/\n#include \"asan_interceptors.h\"\n#include \"asan_internal.h\"\n#include \"asan_mapping.h\"\n#include \"asan_poisoning.h\"\n#include \"asan_report.h\"\n#include \"asan_stack.h\"\n#include \"asan_stats.h\"\n#include \"asan_thread.h\"\n#include \"sanitizer_common\/sanitizer_common.h\"\n#include \"sanitizer_common\/sanitizer_mutex.h\"\n#include \"sanitizer_common\/sanitizer_placement_new.h\"\n#include \"sanitizer_common\/sanitizer_stackdepot.h\"\n\nnamespace __asan {\n\ntypedef __asan_global Global;\n\nstruct ListOfGlobals {\n const Global *g;\n ListOfGlobals *next;\n};\n\nstatic BlockingMutex mu_for_globals(LINKER_INITIALIZED);\nstatic LowLevelAllocator allocator_for_globals;\nstatic ListOfGlobals *list_of_all_globals;\n\nstatic const int kDynamicInitGlobalsInitialCapacity = 512;\nstruct DynInitGlobal {\n Global g;\n bool initialized;\n};\ntypedef InternalMmapVector<DynInitGlobal> VectorOfGlobals;\n\/\/ Lazy-initialized and never deleted.\nstatic VectorOfGlobals *dynamic_init_globals;\n\n\/\/ We want to remember where a certain range of globals was registered.\nstruct GlobalRegistrationSite {\n u32 stack_id;\n Global *g_first, *g_last;\n};\ntypedef InternalMmapVector<GlobalRegistrationSite> GlobalRegistrationSiteVector;\nstatic GlobalRegistrationSiteVector *global_registration_site_vector;\n\nALWAYS_INLINE void PoisonShadowForGlobal(const Global *g, u8 value) {\n FastPoisonShadow(g->beg, g->size_with_redzone, value);\n}\n\nALWAYS_INLINE void PoisonRedZones(const Global &g) {\n uptr aligned_size = RoundUpTo(g.size, SHADOW_GRANULARITY);\n FastPoisonShadow(g.beg + aligned_size, g.size_with_redzone - aligned_size,\n kAsanGlobalRedzoneMagic);\n if (g.size != aligned_size) {\n FastPoisonShadowPartialRightRedzone(\n g.beg + RoundDownTo(g.size, SHADOW_GRANULARITY),\n g.size % SHADOW_GRANULARITY,\n SHADOW_GRANULARITY,\n kAsanGlobalRedzoneMagic);\n }\n}\n\nconst uptr kMinimalDistanceFromAnotherGlobal = 64;\n\nbool IsAddressNearGlobal(uptr addr, const __asan_global &g) {\n if (addr <= g.beg - kMinimalDistanceFromAnotherGlobal) return false;\n if (addr >= g.beg + g.size_with_redzone) return false;\n return true;\n}\n\nstatic void ReportGlobal(const Global &g, const char *prefix) {\n Report(\"%s Global[%p]: beg=%p size=%zu\/%zu name=%s module=%s dyn_init=%zu\\n\",\n prefix, &g, (void *)g.beg, g.size, g.size_with_redzone, g.name,\n g.module_name, g.has_dynamic_init);\n if (g.location) {\n Report(\" location (%p): name=%s[%p], %d %d\\n\", g.location,\n g.location->filename, g.location->filename, g.location->line_no,\n g.location->column_no);\n }\n}\n\nstatic bool DescribeOrGetInfoIfGlobal(uptr addr, uptr size, bool print,\n Global *output_global) {\n if (!flags()->report_globals) return false;\n BlockingMutexLock lock(&mu_for_globals);\n bool res = false;\n for (ListOfGlobals *l = list_of_all_globals; l; l = l->next) {\n const Global &g = *l->g;\n if (print) {\n if (flags()->report_globals >= 2)\n ReportGlobal(g, \"Search\");\n res |= DescribeAddressRelativeToGlobal(addr, size, g);\n } else {\n if (IsAddressNearGlobal(addr, g)) {\n CHECK(output_global);\n *output_global = g;\n return true;\n }\n }\n }\n return res;\n}\n\nbool DescribeAddressIfGlobal(uptr addr, uptr size) {\n return DescribeOrGetInfoIfGlobal(addr, size, \/* print *\/ true,\n \/* output_global *\/ nullptr);\n}\n\nbool GetInfoForAddressIfGlobal(uptr addr, AddressDescription *descr) {\n Global g = {};\n if (DescribeOrGetInfoIfGlobal(addr, \/* size *\/ 1, \/* print *\/ false, &g)) {\n internal_strncpy(descr->name, g.name, descr->name_size);\n descr->region_address = g.beg;\n descr->region_size = g.size;\n descr->region_kind = \"global\";\n return true;\n }\n return false;\n}\n\nu32 FindRegistrationSite(const Global *g) {\n CHECK(global_registration_site_vector);\n for (uptr i = 0, n = global_registration_site_vector->size(); i < n; i++) {\n GlobalRegistrationSite &grs = (*global_registration_site_vector)[i];\n if (g >= grs.g_first && g <= grs.g_last)\n return grs.stack_id;\n }\n return 0;\n}\n\n\/\/ Register a global variable.\n\/\/ This function may be called more than once for every global\n\/\/ so we store the globals in a map.\nstatic void RegisterGlobal(const Global *g) {\n CHECK(asan_inited);\n if (flags()->report_globals >= 2)\n ReportGlobal(*g, \"Added\");\n CHECK(flags()->report_globals);\n CHECK(AddrIsInMem(g->beg));\n CHECK(AddrIsAlignedByGranularity(g->beg));\n CHECK(AddrIsAlignedByGranularity(g->size_with_redzone));\n if (flags()->detect_odr_violation) {\n \/\/ Try detecting ODR (One Definition Rule) violation, i.e. the situation\n \/\/ where two globals with the same name are defined in different modules.\n if (__asan_region_is_poisoned(g->beg, g->size_with_redzone)) {\n \/\/ This check may not be enough: if the first global is much larger\n \/\/ the entire redzone of the second global may be within the first global.\n for (ListOfGlobals *l = list_of_all_globals; l; l = l->next) {\n if (g->beg == l->g->beg &&\n (flags()->detect_odr_violation >= 2 || g->size != l->g->size))\n ReportODRViolation(g, FindRegistrationSite(g),\n l->g, FindRegistrationSite(l->g));\n }\n }\n }\n if (CanPoisonMemory())\n PoisonRedZones(*g);\n ListOfGlobals *l = new(allocator_for_globals) ListOfGlobals;\n l->g = g;\n l->next = list_of_all_globals;\n list_of_all_globals = l;\n if (g->has_dynamic_init) {\n if (dynamic_init_globals == 0) {\n dynamic_init_globals = new(allocator_for_globals)\n VectorOfGlobals(kDynamicInitGlobalsInitialCapacity);\n }\n DynInitGlobal dyn_global = { *g, false };\n dynamic_init_globals->push_back(dyn_global);\n }\n}\n\nstatic void UnregisterGlobal(const Global *g) {\n CHECK(asan_inited);\n if (flags()->report_globals >= 2)\n ReportGlobal(*g, \"Removed\");\n CHECK(flags()->report_globals);\n CHECK(AddrIsInMem(g->beg));\n CHECK(AddrIsAlignedByGranularity(g->beg));\n CHECK(AddrIsAlignedByGranularity(g->size_with_redzone));\n if (CanPoisonMemory())\n PoisonShadowForGlobal(g, 0);\n \/\/ We unpoison the shadow memory for the global but we do not remove it from\n \/\/ the list because that would require O(n^2) time with the current list\n \/\/ implementation. It might not be worth doing anyway.\n}\n\nvoid StopInitOrderChecking() {\n BlockingMutexLock lock(&mu_for_globals);\n if (!flags()->check_initialization_order || !dynamic_init_globals)\n return;\n flags()->check_initialization_order = false;\n for (uptr i = 0, n = dynamic_init_globals->size(); i < n; ++i) {\n DynInitGlobal &dyn_g = (*dynamic_init_globals)[i];\n const Global *g = &dyn_g.g;\n \/\/ Unpoison the whole global.\n PoisonShadowForGlobal(g, 0);\n \/\/ Poison redzones back.\n PoisonRedZones(*g);\n }\n}\n\n} \/\/ namespace __asan\n\n\/\/ ---------------------- Interface ---------------- {{{1\nusing namespace __asan; \/\/ NOLINT\n\n\/\/ Register an array of globals.\nvoid __asan_register_globals(__asan_global *globals, uptr n) {\n if (!flags()->report_globals) return;\n GET_STACK_TRACE_FATAL_HERE;\n u32 stack_id = StackDepotPut(stack);\n BlockingMutexLock lock(&mu_for_globals);\n if (!global_registration_site_vector)\n global_registration_site_vector =\n new(allocator_for_globals) GlobalRegistrationSiteVector(128);\n GlobalRegistrationSite site = {stack_id, &globals[0], &globals[n - 1]};\n global_registration_site_vector->push_back(site);\n if (flags()->report_globals >= 2) {\n PRINT_CURRENT_STACK();\n Printf(\"=== ID %d; %p %p\\n\", stack_id, &globals[0], &globals[n - 1]);\n }\n for (uptr i = 0; i < n; i++) {\n RegisterGlobal(&globals[i]);\n }\n}\n\n\/\/ Unregister an array of globals.\n\/\/ We must do this when a shared objects gets dlclosed.\nvoid __asan_unregister_globals(__asan_global *globals, uptr n) {\n if (!flags()->report_globals) return;\n BlockingMutexLock lock(&mu_for_globals);\n for (uptr i = 0; i < n; i++) {\n UnregisterGlobal(&globals[i]);\n }\n}\n\n\/\/ This method runs immediately prior to dynamic initialization in each TU,\n\/\/ when all dynamically initialized globals are unpoisoned. This method\n\/\/ poisons all global variables not defined in this TU, so that a dynamic\n\/\/ initializer can only touch global variables in the same TU.\nvoid __asan_before_dynamic_init(const char *module_name) {\n if (!flags()->check_initialization_order ||\n !CanPoisonMemory())\n return;\n bool strict_init_order = flags()->strict_init_order;\n CHECK(dynamic_init_globals);\n CHECK(module_name);\n CHECK(asan_inited);\n BlockingMutexLock lock(&mu_for_globals);\n if (flags()->report_globals >= 3)\n Printf(\"DynInitPoison module: %s\\n\", module_name);\n for (uptr i = 0, n = dynamic_init_globals->size(); i < n; ++i) {\n DynInitGlobal &dyn_g = (*dynamic_init_globals)[i];\n const Global *g = &dyn_g.g;\n if (dyn_g.initialized)\n continue;\n if (g->module_name != module_name)\n PoisonShadowForGlobal(g, kAsanInitializationOrderMagic);\n else if (!strict_init_order)\n dyn_g.initialized = true;\n }\n}\n\n\/\/ This method runs immediately after dynamic initialization in each TU, when\n\/\/ all dynamically initialized globals except for those defined in the current\n\/\/ TU are poisoned. It simply unpoisons all dynamically initialized globals.\nvoid __asan_after_dynamic_init() {\n if (!flags()->check_initialization_order ||\n !CanPoisonMemory())\n return;\n CHECK(asan_inited);\n BlockingMutexLock lock(&mu_for_globals);\n \/\/ FIXME: Optionally report that we're unpoisoning globals from a module.\n for (uptr i = 0, n = dynamic_init_globals->size(); i < n; ++i) {\n DynInitGlobal &dyn_g = (*dynamic_init_globals)[i];\n const Global *g = &dyn_g.g;\n if (!dyn_g.initialized) {\n \/\/ Unpoison the whole global.\n PoisonShadowForGlobal(g, 0);\n \/\/ Poison redzones back.\n PoisonRedZones(*g);\n }\n }\n}\n<|endoftext|>"} {"text":"<commit_before>\/*\n* RDRAND RNG\n* (C) 2016,2019 Jack Lloyd\n*\n* Botan is released under the Simplified BSD License (see license.txt)\n*\/\n\n#include <botan\/rdrand_rng.h>\n#include <botan\/loadstor.h>\n#include <botan\/cpuid.h>\n\n#if !defined(BOTAN_USE_GCC_INLINE_ASM)\n #include <immintrin.h>\n#endif\n\nnamespace Botan {\n\nnamespace {\n\n#if defined(BOTAN_TARGET_ARCH_IS_X86_64)\n typedef uint64_t rdrand_output;\n#else\n typedef uint32_t rdrand_output;\n#endif\n\nBOTAN_FUNC_ISA(\"rdrnd\")\nrdrand_output read_rdrand()\n {\n \/*\n * According to Intel, RDRAND is guaranteed to generate a random\n * number within 10 retries on a working CPU\n *\/\n const size_t RDRAND_RETRIES = 10;\n\n for(size_t i = 0; i < RDRAND_RETRIES; ++i)\n {\n rdrand_output r = 0;\n int cf = 0;\n\n#if defined(BOTAN_USE_GCC_INLINE_ASM)\n \/\/ same asm seq works for 32 and 64 bit\n asm(\"rdrand %0; adcl $0,%1\" :\n \"=r\" (r), \"=r\" (cf) : \"0\" (r), \"1\" (cf) : \"cc\");\n#elif defined(BOTAN_TARGET_ARCH_IS_X86_64)\n cf = _rdrand64_step(&r);\n#else\n cf = _rdrand32_step(&r);\n#endif\n if(1 == cf)\n {\n return r;\n }\n }\n\n throw PRNG_Unseeded(\"RDRAND read failed\");\n }\n\n}\n\nvoid RDRAND_RNG::randomize(uint8_t out[], size_t out_len)\n {\n while(out_len >= sizeof(rdrand_output))\n {\n const rdrand_output r = read_rdrand();\n store_le(r, out);\n out += sizeof(rdrand_output);\n out_len -= sizeof(rdrand_output);\n }\n\n if(out_len > 0) \/\/ at most sizeof(rdrand_output)-1\n {\n const rdrand_output r = read_rdrand();\n for(size_t i = 0; i != out_len; ++i)\n out[i] = get_byte(i, r);\n }\n }\n\nRDRAND_RNG::RDRAND_RNG()\n {\n if(!RDRAND_RNG::available())\n throw Invalid_State(\"Current CPU does not support RDRAND instruction\");\n }\n\n\/\/static\nbool RDRAND_RNG::available()\n {\n return CPUID::has_rdrand();\n }\n\n\/\/static\nuint32_t RDRAND_RNG::rdrand()\n {\n return static_cast<uint32_t>(read_rdrand());\n }\n\n\/\/static\nBOTAN_FUNC_ISA(\"rdrnd\")\nuint32_t RDRAND_RNG::rdrand_status(bool& ok)\n {\n ok = false;\n\n try\n {\n const uint32_t r = static_cast<uint32_t>(read_rdrand());\n ok = true;\n return r;\n }\n catch(PRNG_Unseeded&) {}\n\n return 0;\n }\n\n}\n<commit_msg>Avoid using BOTAN_ISA_FUNC on rdrand function unless needed<commit_after>\/*\n* RDRAND RNG\n* (C) 2016,2019 Jack Lloyd\n*\n* Botan is released under the Simplified BSD License (see license.txt)\n*\/\n\n#include <botan\/rdrand_rng.h>\n#include <botan\/loadstor.h>\n#include <botan\/cpuid.h>\n\n#if !defined(BOTAN_USE_GCC_INLINE_ASM)\n #include <immintrin.h>\n#endif\n\nnamespace Botan {\n\nnamespace {\n\n#if defined(BOTAN_TARGET_ARCH_IS_X86_64)\n typedef uint64_t rdrand_output;\n#else\n typedef uint32_t rdrand_output;\n#endif\n\n#if !defined(BOTAN_USE_GCC_INLINE_ASM)\nBOTAN_FUNC_ISA(\"rdrnd\")\n#endif\nrdrand_output read_rdrand()\n {\n \/*\n * According to Intel, RDRAND is guaranteed to generate a random\n * number within 10 retries on a working CPU\n *\/\n const size_t RDRAND_RETRIES = 10;\n\n for(size_t i = 0; i < RDRAND_RETRIES; ++i)\n {\n rdrand_output r = 0;\n int cf = 0;\n\n#if defined(BOTAN_USE_GCC_INLINE_ASM)\n \/\/ same asm seq works for 32 and 64 bit\n asm(\"rdrand %0; adcl $0,%1\" :\n \"=r\" (r), \"=r\" (cf) : \"0\" (r), \"1\" (cf) : \"cc\");\n#elif defined(BOTAN_TARGET_ARCH_IS_X86_64)\n cf = _rdrand64_step(&r);\n#else\n cf = _rdrand32_step(&r);\n#endif\n if(1 == cf)\n {\n return r;\n }\n }\n\n throw PRNG_Unseeded(\"RDRAND read failed\");\n }\n\n}\n\nvoid RDRAND_RNG::randomize(uint8_t out[], size_t out_len)\n {\n while(out_len >= sizeof(rdrand_output))\n {\n const rdrand_output r = read_rdrand();\n store_le(r, out);\n out += sizeof(rdrand_output);\n out_len -= sizeof(rdrand_output);\n }\n\n if(out_len > 0) \/\/ at most sizeof(rdrand_output)-1\n {\n const rdrand_output r = read_rdrand();\n for(size_t i = 0; i != out_len; ++i)\n out[i] = get_byte(i, r);\n }\n }\n\nRDRAND_RNG::RDRAND_RNG()\n {\n if(!RDRAND_RNG::available())\n throw Invalid_State(\"Current CPU does not support RDRAND instruction\");\n }\n\n\/\/static\nbool RDRAND_RNG::available()\n {\n return CPUID::has_rdrand();\n }\n\n\/\/static\nuint32_t RDRAND_RNG::rdrand()\n {\n return static_cast<uint32_t>(read_rdrand());\n }\n\n\/\/static\nBOTAN_FUNC_ISA(\"rdrnd\")\nuint32_t RDRAND_RNG::rdrand_status(bool& ok)\n {\n ok = false;\n\n try\n {\n const uint32_t r = static_cast<uint32_t>(read_rdrand());\n ok = true;\n return r;\n }\n catch(PRNG_Unseeded&) {}\n\n return 0;\n }\n\n}\n<|endoftext|>"} {"text":"<commit_before>#include \"RoadWarrior.h\"\n#include \"Backend.h\"\n#include \"RequestNotes.h\"\n#include \"HttpBackend.h\"\n#include \"FastCgiBackend.h\"\n#include <x0\/http\/HttpRequest.h>\n\nRoadWarrior::RoadWarrior(x0::HttpWorker* worker) :\n BackendManager(worker, \"__roadwarrior__\"),\n backendsLock_(),\n backends_()\n{\n}\n\nRoadWarrior::~RoadWarrior()\n{\n}\n\nBackend* RoadWarrior::acquireBackend(const x0::SocketSpec& spec, Type type)\n{\n std::lock_guard<std::mutex> _l(backendsLock_);\n\n auto bi = backends_.find(spec);\n if (bi != backends_.end()) {\n return bi->second.get();\n }\n\n Backend* backend = nullptr;\n switch (type) {\n case HTTP:\n backends_[spec].reset(backend = new HttpBackend(this, spec.str(), spec, 0, false));\n break;\n case FCGI:\n backends_[spec].reset(backend = new FastCgiBackend(this, spec.str(), spec, 0, false));\n break;\n }\n return backend;\n}\n\nvoid RoadWarrior::handleRequest(RequestNotes* rn, const x0::SocketSpec& spec, Type type)\n{\n Backend* backend = acquireBackend(spec, type);\n if (!backend) {\n rn->request->status = x0::HttpStatus::InternalServerError;\n rn->request->finish();\n }\n\n SchedulerStatus result = backend->tryProcess(rn);\n if (result != SchedulerStatus::Success) {\n rn->request->status = x0::HttpStatus::ServiceUnavailable;\n rn->request->finish();\n }\n}\n\nvoid RoadWarrior::reject(RequestNotes* rn)\n{\n \/\/ this request couldn't be served by the backend, so finish it with a 503 (Service Unavailable).\n\n auto r = rn->request;\n\n if (!r->status)\n r->status = x0::HttpStatus::ServiceUnavailable;\n\n r->finish();\n}\n\nvoid RoadWarrior::release(RequestNotes* rn)\n{\n \/\/ The passed backend just finished serving a request, so we might now pass it a queued request,\n \/\/ in case we would support queuing (do we want that?).\n}\n\nvoid RoadWarrior::writeJSON(x0::JsonWriter& json) const\n{\n json.beginObject(name());\n json.beginArray(\"members\");\n for (const auto& backend: backends_) {\n json.value(*backend.second);\n }\n json.endArray();\n json.endObject();\n}\n<commit_msg>[plugins] director: so let's do a little test...<commit_after>#include \"RoadWarrior.h\"\n#include \"Backend.h\"\n#include \"RequestNotes.h\"\n#include \"HttpBackend.h\"\n#include \"FastCgiBackend.h\"\n#include <x0\/http\/HttpRequest.h>\n\nRoadWarrior::RoadWarrior(x0::HttpWorker* worker) :\n BackendManager(worker, \"__roadwarrior__\"),\n backendsLock_(),\n backends_()\n{\n \/\/ so let's do a little test\n setTransferMode(TransferMode::MemoryAccel);\n}\n\nRoadWarrior::~RoadWarrior()\n{\n}\n\nBackend* RoadWarrior::acquireBackend(const x0::SocketSpec& spec, Type type)\n{\n std::lock_guard<std::mutex> _l(backendsLock_);\n\n auto bi = backends_.find(spec);\n if (bi != backends_.end()) {\n return bi->second.get();\n }\n\n Backend* backend = nullptr;\n switch (type) {\n case HTTP:\n backends_[spec].reset(backend = new HttpBackend(this, spec.str(), spec, 0, false));\n break;\n case FCGI:\n backends_[spec].reset(backend = new FastCgiBackend(this, spec.str(), spec, 0, false));\n break;\n }\n return backend;\n}\n\nvoid RoadWarrior::handleRequest(RequestNotes* rn, const x0::SocketSpec& spec, Type type)\n{\n Backend* backend = acquireBackend(spec, type);\n if (!backend) {\n rn->request->status = x0::HttpStatus::InternalServerError;\n rn->request->finish();\n }\n\n SchedulerStatus result = backend->tryProcess(rn);\n if (result != SchedulerStatus::Success) {\n rn->request->status = x0::HttpStatus::ServiceUnavailable;\n rn->request->finish();\n }\n}\n\nvoid RoadWarrior::reject(RequestNotes* rn)\n{\n \/\/ this request couldn't be served by the backend, so finish it with a 503 (Service Unavailable).\n\n auto r = rn->request;\n\n if (!r->status)\n r->status = x0::HttpStatus::ServiceUnavailable;\n\n r->finish();\n}\n\nvoid RoadWarrior::release(RequestNotes* rn)\n{\n \/\/ The passed backend just finished serving a request, so we might now pass it a queued request,\n \/\/ in case we would support queuing (do we want that?).\n}\n\nvoid RoadWarrior::writeJSON(x0::JsonWriter& json) const\n{\n json.beginObject(name());\n json.beginArray(\"members\");\n for (const auto& backend: backends_) {\n json.value(*backend.second);\n }\n json.endArray();\n json.endObject();\n}\n<|endoftext|>"} {"text":"<commit_before>\/*\n * This file is part of crash-reporter\n *\n * Copyright (C) 2010 Nokia Corporation and\/or its subsidiary(-ies).\n *\n * Contact: Ville Ilvonen <ville.p.ilvonen@nokia.com>\n * Author: Riku Halonen <riku.halonen@nokia.com>\n *\n * This program is free software; you can redistribute it and\/or\n * modify it under the terms of the GNU Lesser General Public License\n * version 2.1 as published by the Free Software Foundation.\n *\n * This program is distributed in the hope that it will be useful, but\n * WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU\n * Lesser General 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 St, Fifth Floor, Boston, MA\n * 02110-1301 USA\n *\n *\/\n\n\/\/ System includes.\n\n#include <sys\/types.h> \/\/ for chmod()\n#include <sys\/stat.h>\n\n#include <QDir>\n#include <QDebug>\n#include <QDirIterator>\n\n\/\/ User includes.\n\n#include \"creportercoredir.h\"\n#include \"creportercoredir_p.h\"\n#include \"creporterutils.h\"\n\n\/\/ Local macros and definitions.\n\n#define FILE_PERMISSION \t0777\n\n\/\/ Local constants.\n\nconst char rcore_file_name_filter[] = \"*.rcore\";\nconst char rcore_lzo_file_name_filter[] = \"*.rcore.lzo\";\n\n\/\/ ======== MEMBER FUNCTIONS ========\n\nCReporterCoreDir::CReporterCoreDir(QString& mpoint, QObject* parent)\n : QObject(parent), d_ptr(new CReporterCoreDirPrivate())\n{\n\td_ptr->mountpoint = mpoint;\n\tqDebug() << __PRETTY_FUNCTION__ << \"Mountpoint set to:\" << d_ptr->mountpoint;\n}\n\nCReporterCoreDir::~CReporterCoreDir()\n{\n\tdelete d_ptr;\n}\n\nQString CReporterCoreDir::getDirectory() const\n{\n return d_ptr->directory;\n}\n\nQString CReporterCoreDir::getMountpoint() const\n{\n return d_ptr->mountpoint;\n}\n\nvoid CReporterCoreDir::setDirectory(const QString& dir)\n{\n Q_D(CReporterCoreDir);\n\n\td->directory = dir;\n\tqDebug() << __PRETTY_FUNCTION__ << \"Directory set to:\" << d->directory;\n}\n\t\nvoid CReporterCoreDir::setMountpoint(const QString& mpoint)\n{\n Q_D(CReporterCoreDir);\n\n\td->mountpoint = mpoint;\n\tqDebug() << __PRETTY_FUNCTION__ << \"Mountpoint set to:\" << d->mountpoint;\n}\n\nvoid CReporterCoreDir::collectAllCoreFilesAtLocation(QStringList& coreList)\n{\n Q_D(CReporterCoreDir);\n\n\tqDebug() << __PRETTY_FUNCTION__ << \"Collecting cores from:\" << d->directory;\n\t\n\tQStringList filters;\n filters << QString(rcore_file_name_filter) << QString(rcore_lzo_file_name_filter);\n\n\t\/\/ Construct iterator for core-dumps directory.\n QDirIterator iter(d->directory, filters, QDir::Files | QDir::NoDotAndDotDot);\n\n while (iter.hasNext()) {\n QString filePath = iter.next();\n\t\n if (CReporterUtils::validateCore(filePath)) {\n coreList << filePath;\n }\n }\n}\n\nQString CReporterCoreDir::checkDirectoryForCores()\n{\n Q_D(CReporterCoreDir);\n\n\tQFileInfo fi;\n\tQString coreFilePath;\n\n\tQStringList filters;\n filters << QString(rcore_file_name_filter) << QString(rcore_lzo_file_name_filter);\n\n\t\/\/ Construct iterator for core-dumps directory.\n QDirIterator iter(d->directory, filters, QDir::Files | QDir::NoDotAndDotDot);\n\n\t\/\/ Iterate over files in the core-dumps directory.\t\t\n while (iter.hasNext()) {\n\t\t\n\t\titer.next();\n\t\tfi = iter.fileInfo();\n\n if (!d->coresAtDirectory.contains(fi.fileName()) &&\n CReporterUtils::validateCore(fi.fileName())) {\n\t\t\t\t\/\/ This is valid rich core file, which hasn't been processed before.\n\t\t\t\td->coresAtDirectory << fi.fileName();\n\t\t\t\tcoreFilePath = fi.absoluteFilePath();\n\t\t\t\tqDebug() << __PRETTY_FUNCTION__ << \"New core file:\" << fi.fileName();\n\t\t\t\tbreak;\n\t\t}\n\t}\n\n if (coreFilePath.isEmpty()) {\n\t\t\/\/ File was deleted by the user or client from the directory.\n\t\t\/\/ Refresh directory list.\n\t\tupdateCoreList();\n\t}\n\n\treturn coreFilePath;\n}\n\nvoid CReporterCoreDir::createCoreDirectory()\n{\n Q_D(CReporterCoreDir);\n\n if (CReporterUtils::isMounted(d->mountpoint))\n {\n \/\/ Construct new QDir pointing to mount point.\n QDir coreRoot(d->mountpoint);\n\n if (!coreRoot.exists(d->directory))\n {\n \/\/ If core-dumps -directory doesn't exist.\n \/\/ Create new sub-directory.\n if (coreRoot.exists(d->directory.left(d->directory.lastIndexOf('\/')))\n && coreRoot.mkdir(d->directory))\n {\n qDebug() << __PRETTY_FUNCTION__ << \"Created directory:\" << d->directory;\n chmod(CReporterUtils::qstringToChar(d->directory), FILE_PERMISSION);\n }\n else\n {\n qWarning() << __PRETTY_FUNCTION__ << \"Error while creating directory:\" << d->directory;\n }\n \/\/ Remove old entries from the list.\n d->coresAtDirectory.clear();\n }\n else\n {\n \/\/ There was a \"core-dumps\" directory already. Fetch possible core files.\n updateCoreList();\n }\n }\n}\n\nvoid CReporterCoreDir::updateCoreList()\n{\n Q_D(CReporterCoreDir);\n\n\tqDebug() << __PRETTY_FUNCTION__ << \"Refreshing core directory list.\";\n\n QDir dir(d->directory);\n dir.setFilter(QDir::Files | QDir::NoDotAndDotDot);\n dir.setNameFilters(QStringList() << rcore_file_name_filter << rcore_lzo_file_name_filter);\n\n\t\/\/ Remove old entries.\n\td->coresAtDirectory.clear();\n\n QDirIterator it(dir);\n while (it.hasNext()) {\n d->coresAtDirectory.append(it.next());\n }\n}\n\n\/\/ End of file\n<commit_msg>[coredir] Fix CReporterCoreDir::updateCoreList()<commit_after>\/*\n * This file is part of crash-reporter\n *\n * Copyright (C) 2010 Nokia Corporation and\/or its subsidiary(-ies).\n *\n * Contact: Ville Ilvonen <ville.p.ilvonen@nokia.com>\n * Author: Riku Halonen <riku.halonen@nokia.com>\n *\n * This program is free software; you can redistribute it and\/or\n * modify it under the terms of the GNU Lesser General Public License\n * version 2.1 as published by the Free Software Foundation.\n *\n * This program is distributed in the hope that it will be useful, but\n * WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU\n * Lesser General 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 St, Fifth Floor, Boston, MA\n * 02110-1301 USA\n *\n *\/\n\n\/\/ System includes.\n\n#include <sys\/types.h> \/\/ for chmod()\n#include <sys\/stat.h>\n\n#include <QDir>\n#include <QDebug>\n#include <QDirIterator>\n\n\/\/ User includes.\n\n#include \"creportercoredir.h\"\n#include \"creportercoredir_p.h\"\n#include \"creporterutils.h\"\n\n\/\/ Local macros and definitions.\n\n#define FILE_PERMISSION \t0777\n\n\/\/ Local constants.\n\nconst char rcore_file_name_filter[] = \"*.rcore\";\nconst char rcore_lzo_file_name_filter[] = \"*.rcore.lzo\";\n\n\/\/ ======== MEMBER FUNCTIONS ========\n\nCReporterCoreDir::CReporterCoreDir(QString& mpoint, QObject* parent)\n : QObject(parent), d_ptr(new CReporterCoreDirPrivate())\n{\n\td_ptr->mountpoint = mpoint;\n\tqDebug() << __PRETTY_FUNCTION__ << \"Mountpoint set to:\" << d_ptr->mountpoint;\n}\n\nCReporterCoreDir::~CReporterCoreDir()\n{\n\tdelete d_ptr;\n}\n\nQString CReporterCoreDir::getDirectory() const\n{\n return d_ptr->directory;\n}\n\nQString CReporterCoreDir::getMountpoint() const\n{\n return d_ptr->mountpoint;\n}\n\nvoid CReporterCoreDir::setDirectory(const QString& dir)\n{\n Q_D(CReporterCoreDir);\n\n\td->directory = dir;\n\tqDebug() << __PRETTY_FUNCTION__ << \"Directory set to:\" << d->directory;\n}\n\t\nvoid CReporterCoreDir::setMountpoint(const QString& mpoint)\n{\n Q_D(CReporterCoreDir);\n\n\td->mountpoint = mpoint;\n\tqDebug() << __PRETTY_FUNCTION__ << \"Mountpoint set to:\" << d->mountpoint;\n}\n\nvoid CReporterCoreDir::collectAllCoreFilesAtLocation(QStringList& coreList)\n{\n Q_D(CReporterCoreDir);\n\n\tqDebug() << __PRETTY_FUNCTION__ << \"Collecting cores from:\" << d->directory;\n\t\n\tQStringList filters;\n filters << QString(rcore_file_name_filter) << QString(rcore_lzo_file_name_filter);\n\n\t\/\/ Construct iterator for core-dumps directory.\n QDirIterator iter(d->directory, filters, QDir::Files | QDir::NoDotAndDotDot);\n\n while (iter.hasNext()) {\n QString filePath = iter.next();\n\t\n if (CReporterUtils::validateCore(filePath)) {\n coreList << filePath;\n }\n }\n}\n\nQString CReporterCoreDir::checkDirectoryForCores()\n{\n Q_D(CReporterCoreDir);\n\n\tQFileInfo fi;\n\tQString coreFilePath;\n\n\tQStringList filters;\n filters << QString(rcore_file_name_filter) << QString(rcore_lzo_file_name_filter);\n\n\t\/\/ Construct iterator for core-dumps directory.\n QDirIterator iter(d->directory, filters, QDir::Files | QDir::NoDotAndDotDot);\n\n\t\/\/ Iterate over files in the core-dumps directory.\t\t\n while (iter.hasNext()) {\n\t\t\n\t\titer.next();\n\t\tfi = iter.fileInfo();\n\n if (!d->coresAtDirectory.contains(fi.fileName()) &&\n CReporterUtils::validateCore(fi.fileName())) {\n\t\t\t\t\/\/ This is valid rich core file, which hasn't been processed before.\n\t\t\t\td->coresAtDirectory << fi.fileName();\n\t\t\t\tcoreFilePath = fi.absoluteFilePath();\n\t\t\t\tqDebug() << __PRETTY_FUNCTION__ << \"New core file:\" << fi.fileName();\n\t\t\t\tbreak;\n\t\t}\n\t}\n\n if (coreFilePath.isEmpty()) {\n\t\t\/\/ File was deleted by the user or client from the directory.\n\t\t\/\/ Refresh directory list.\n\t\tupdateCoreList();\n\t}\n\n\treturn coreFilePath;\n}\n\nvoid CReporterCoreDir::createCoreDirectory()\n{\n Q_D(CReporterCoreDir);\n\n if (CReporterUtils::isMounted(d->mountpoint))\n {\n \/\/ Construct new QDir pointing to mount point.\n QDir coreRoot(d->mountpoint);\n\n if (!coreRoot.exists(d->directory))\n {\n \/\/ If core-dumps -directory doesn't exist.\n \/\/ Create new sub-directory.\n if (coreRoot.exists(d->directory.left(d->directory.lastIndexOf('\/')))\n && coreRoot.mkdir(d->directory))\n {\n qDebug() << __PRETTY_FUNCTION__ << \"Created directory:\" << d->directory;\n chmod(CReporterUtils::qstringToChar(d->directory), FILE_PERMISSION);\n }\n else\n {\n qWarning() << __PRETTY_FUNCTION__ << \"Error while creating directory:\" << d->directory;\n }\n \/\/ Remove old entries from the list.\n d->coresAtDirectory.clear();\n }\n else\n {\n \/\/ There was a \"core-dumps\" directory already. Fetch possible core files.\n updateCoreList();\n }\n }\n}\n\nvoid CReporterCoreDir::updateCoreList()\n{\n Q_D(CReporterCoreDir);\n\n\tqDebug() << __PRETTY_FUNCTION__ << \"Refreshing core directory list.\";\n\n QDir dir(d->directory);\n dir.setFilter(QDir::Files | QDir::NoDotAndDotDot);\n dir.setNameFilters(QStringList() << rcore_file_name_filter << rcore_lzo_file_name_filter);\n\n\t\/\/ Remove old entries.\n\td->coresAtDirectory.clear();\n\n QDirIterator it(dir);\n while (it.hasNext()) {\n it.next();\n d->coresAtDirectory.append(it.fileName());\n }\n}\n\n\/\/ End of file\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 \"uncommentselection.h\"\n#include <QtGui\/QPlainTextEdit>\n#include <QtGui\/QTextCursor>\n#include <QtGui\/QTextBlock>\n#include <QtGui\/QTextDocument>\n\nvoid Utils::unCommentSelection(QPlainTextEdit *edit)\n{\n QTextCursor cursor = edit->textCursor();\n QTextDocument *doc = cursor.document();\n cursor.beginEditBlock();\n\n int pos = cursor.position();\n int anchor = cursor.anchor();\n int start = qMin(anchor, pos);\n int end = qMax(anchor, pos);\n bool anchorIsStart = (anchor == start);\n\n QTextBlock startBlock = doc->findBlock(start);\n QTextBlock endBlock = doc->findBlock(end);\n\n if (end > start && endBlock.position() == end) {\n --end;\n endBlock = endBlock.previous();\n }\n\n bool doCStyleUncomment = false;\n bool doCStyleComment = false;\n bool doCppStyleUncomment = false;\n\n bool hasSelection = cursor.hasSelection();\n\n if (hasSelection) {\n QString startText = startBlock.text();\n int startPos = start - startBlock.position();\n bool hasLeadingCharacters = !startText.left(startPos).trimmed().isEmpty();\n if ((startPos >= 2\n && startText.at(startPos-2) == QLatin1Char('\/')\n && startText.at(startPos-1) == QLatin1Char('*'))) {\n startPos -= 2;\n start -= 2;\n }\n\n bool hasSelStart = (startPos < startText.length() - 2\n && startText.at(startPos) == QLatin1Char('\/')\n && startText.at(startPos+1) == QLatin1Char('*'));\n\n\n QString endText = endBlock.text();\n int endPos = end - endBlock.position();\n bool hasTrailingCharacters = !endText.left(endPos).remove(QLatin1String(\"\/\/\")).trimmed().isEmpty()\n && !endText.mid(endPos).trimmed().isEmpty();\n if ((endPos <= endText.length() - 2\n && endText.at(endPos) == QLatin1Char('*')\n && endText.at(endPos+1) == QLatin1Char('\/'))) {\n endPos += 2;\n end += 2;\n }\n\n bool hasSelEnd = (endPos >= 2\n && endText.at(endPos-2) == QLatin1Char('*')\n && endText.at(endPos-1) == QLatin1Char('\/'));\n\n doCStyleUncomment = hasSelStart && hasSelEnd;\n doCStyleComment = !doCStyleUncomment && (hasLeadingCharacters || hasTrailingCharacters);\n }\n\n if (doCStyleUncomment) {\n cursor.setPosition(end);\n cursor.movePosition(QTextCursor::PreviousCharacter, QTextCursor::KeepAnchor, 2);\n cursor.removeSelectedText();\n cursor.setPosition(start);\n cursor.movePosition(QTextCursor::NextCharacter, QTextCursor::KeepAnchor, 2);\n cursor.removeSelectedText();\n } else if (doCStyleComment) {\n cursor.setPosition(end);\n cursor.insertText(QLatin1String(\"*\/\"));\n cursor.setPosition(start);\n cursor.insertText(QLatin1String(\"\/*\"));\n } else {\n endBlock = endBlock.next();\n doCppStyleUncomment = true;\n for (QTextBlock block = startBlock; block != endBlock; block = block.next()) {\n QString text = block.text();\n if (!text.trimmed().startsWith(QLatin1String(\"\/\/\"))) {\n doCppStyleUncomment = false;\n break;\n }\n }\n for (QTextBlock block = startBlock; block != endBlock; block = block.next()) {\n if (doCppStyleUncomment) {\n QString text = block.text();\n int i = 0;\n while (i < text.size() - 1) {\n if (text.at(i) == QLatin1Char('\/')\n && text.at(i + 1) == QLatin1Char('\/')) {\n cursor.setPosition(block.position() + i);\n cursor.movePosition(QTextCursor::NextCharacter, QTextCursor::KeepAnchor, 2);\n cursor.removeSelectedText();\n break;\n }\n if (!text.at(i).isSpace())\n break;\n ++i;\n }\n } else {\n cursor.setPosition(block.position());\n cursor.insertText(QLatin1String(\"\/\/\"));\n }\n }\n }\n\n \/\/ adjust selection when commenting out\n if (hasSelection && !doCStyleUncomment && !doCppStyleUncomment) {\n cursor = edit->textCursor();\n if (!doCStyleComment)\n start = startBlock.position(); \/\/ move the double slashes into the selection\n int lastSelPos = anchorIsStart ? cursor.position() : cursor.anchor();\n if (anchorIsStart) {\n cursor.setPosition(start);\n cursor.setPosition(lastSelPos, QTextCursor::KeepAnchor);\n } else {\n cursor.setPosition(lastSelPos);\n cursor.setPosition(start, QTextCursor::KeepAnchor);\n }\n edit->setTextCursor(cursor);\n }\n\n cursor.endEditBlock();\n}\n\n<commit_msg>Improve (un)comment selection in C++ style<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 \"uncommentselection.h\"\n#include <QtGui\/QPlainTextEdit>\n#include <QtGui\/QTextCursor>\n#include <QtGui\/QTextBlock>\n#include <QtGui\/QTextDocument>\n\nvoid Utils::unCommentSelection(QPlainTextEdit *edit)\n{\n QTextCursor cursor = edit->textCursor();\n QTextDocument *doc = cursor.document();\n cursor.beginEditBlock();\n\n int pos = cursor.position();\n int anchor = cursor.anchor();\n int start = qMin(anchor, pos);\n int end = qMax(anchor, pos);\n bool anchorIsStart = (anchor == start);\n\n QTextBlock startBlock = doc->findBlock(start);\n QTextBlock endBlock = doc->findBlock(end);\n\n if (end > start && endBlock.position() == end) {\n --end;\n endBlock = endBlock.previous();\n }\n\n bool doCStyleUncomment = false;\n bool doCStyleComment = false;\n bool doCppStyleUncomment = false;\n\n bool hasSelection = cursor.hasSelection();\n\n if (hasSelection) {\n QString startText = startBlock.text();\n int startPos = start - startBlock.position();\n bool hasLeadingCharacters = !startText.left(startPos).trimmed().isEmpty();\n if ((startPos >= 2\n && startText.at(startPos-2) == QLatin1Char('\/')\n && startText.at(startPos-1) == QLatin1Char('*'))) {\n startPos -= 2;\n start -= 2;\n }\n\n bool hasSelStart = (startPos < startText.length() - 2\n && startText.at(startPos) == QLatin1Char('\/')\n && startText.at(startPos+1) == QLatin1Char('*'));\n\n\n QString endText = endBlock.text();\n int endPos = end - endBlock.position();\n bool hasTrailingCharacters = !endText.left(endPos).remove(QLatin1String(\"\/\/\")).trimmed().isEmpty()\n && !endText.mid(endPos).trimmed().isEmpty();\n if ((endPos <= endText.length() - 2\n && endText.at(endPos) == QLatin1Char('*')\n && endText.at(endPos+1) == QLatin1Char('\/'))) {\n endPos += 2;\n end += 2;\n }\n\n bool hasSelEnd = (endPos >= 2\n && endText.at(endPos-2) == QLatin1Char('*')\n && endText.at(endPos-1) == QLatin1Char('\/'));\n\n doCStyleUncomment = hasSelStart && hasSelEnd;\n doCStyleComment = !doCStyleUncomment && (hasLeadingCharacters || hasTrailingCharacters);\n }\n\n if (doCStyleUncomment) {\n cursor.setPosition(end);\n cursor.movePosition(QTextCursor::PreviousCharacter, QTextCursor::KeepAnchor, 2);\n cursor.removeSelectedText();\n cursor.setPosition(start);\n cursor.movePosition(QTextCursor::NextCharacter, QTextCursor::KeepAnchor, 2);\n cursor.removeSelectedText();\n } else if (doCStyleComment) {\n cursor.setPosition(end);\n cursor.insertText(QLatin1String(\"*\/\"));\n cursor.setPosition(start);\n cursor.insertText(QLatin1String(\"\/*\"));\n } else {\n endBlock = endBlock.next();\n doCppStyleUncomment = true;\n for (QTextBlock block = startBlock; block != endBlock; block = block.next()) {\n QString text = block.text().trimmed();\n if (!text.isEmpty() && !text.startsWith(QLatin1String(\"\/\/\"))) {\n doCppStyleUncomment = false;\n break;\n }\n }\n for (QTextBlock block = startBlock; block != endBlock; block = block.next()) {\n if (doCppStyleUncomment) {\n QString text = block.text();\n int i = 0;\n while (i < text.size() - 1) {\n if (text.at(i) == QLatin1Char('\/')\n && text.at(i + 1) == QLatin1Char('\/')) {\n cursor.setPosition(block.position() + i);\n cursor.movePosition(QTextCursor::NextCharacter, QTextCursor::KeepAnchor, 2);\n cursor.removeSelectedText();\n break;\n }\n if (!text.at(i).isSpace())\n break;\n ++i;\n }\n } else {\n QString text = block.text();\n foreach(QChar c, text) {\n if (!c.isSpace()) {\n cursor.setPosition(block.position());\n cursor.insertText(QLatin1String(\"\/\/\"));\n break;\n }\n }\n }\n }\n }\n\n \/\/ adjust selection when commenting out\n if (hasSelection && !doCStyleUncomment && !doCppStyleUncomment) {\n cursor = edit->textCursor();\n if (!doCStyleComment)\n start = startBlock.position(); \/\/ move the double slashes into the selection\n int lastSelPos = anchorIsStart ? cursor.position() : cursor.anchor();\n if (anchorIsStart) {\n cursor.setPosition(start);\n cursor.setPosition(lastSelPos, QTextCursor::KeepAnchor);\n } else {\n cursor.setPosition(lastSelPos);\n cursor.setPosition(start, QTextCursor::KeepAnchor);\n }\n edit->setTextCursor(cursor);\n }\n\n cursor.endEditBlock();\n}\n\n<|endoftext|>"} {"text":"<commit_before>#ifndef SLAAUTOSUPPORTS_HPP_\n#define SLAAUTOSUPPORTS_HPP_\n\n#include <libslic3r\/ClipperUtils.hpp>\n#include <libslic3r\/Point.hpp>\n#include <libslic3r\/TriangleMesh.hpp>\n#include <libslic3r\/SLA\/SLACommon.hpp>\n\n#include <boost\/container\/small_vector.hpp>\n\n\/\/ #define SLA_AUTOSUPPORTS_DEBUG\n\nnamespace Slic3r {\n\nclass SLAAutoSupports {\npublic:\n struct Config {\n float density_relative;\n float minimal_distance;\n float head_diameter;\n \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n inline float support_force() const { return 10.f \/ density_relative; } \/\/ a force one point can support (arbitrary force unit)\n inline float tear_pressure() const { return 1.f; } \/\/ pressure that the display exerts (the force unit per mm2)\n };\n\n SLAAutoSupports(const TriangleMesh& mesh, const sla::EigenMesh3D& emesh, const std::vector<ExPolygons>& slices,\n const std::vector<float>& heights, const Config& config, std::function<void(void)> throw_on_cancel);\n const std::vector<sla::SupportPoint>& output() { return m_output; }\n\n\tstruct MyLayer;\n\n struct Structure {\n Structure(MyLayer &layer, const ExPolygon& poly, const BoundingBox &bbox, const Vec2f ¢roid, float area, float h) : \n layer(&layer), polygon(&poly), bbox(bbox), centroid(centroid), area(area), height(h)\n#ifdef SLA_AUTOSUPPORTS_DEBUG\n , unique_id(std::chrono::duration_cast<std::chrono::milliseconds>(std::chrono::system_clock::now().time_since_epoch()))\n#endif \/* SLA_AUTOSUPPORTS_DEBUG *\/\n {}\n MyLayer *layer;\n const ExPolygon* polygon = nullptr;\n const BoundingBox bbox;\n const Vec2f centroid = Vec2f::Zero();\n const float area = 0.f;\n float height = 0;\n \/\/ How well is this ExPolygon held to the print base?\n \/\/ Positive number, the higher the better.\n float supports_force_this_layer = 0.f;\n float supports_force_inherited = 0.f;\n float supports_force_total() const { return this->supports_force_this_layer + this->supports_force_inherited; }\n#ifdef SLA_AUTOSUPPORTS_DEBUG\n std::chrono::milliseconds unique_id;\n#endif \/* SLA_AUTOSUPPORTS_DEBUG *\/\n\n struct Link {\n\t\t\tLink(Structure *island, float overlap_area) : island(island), overlap_area(overlap_area) {}\n Structure *island;\n float overlap_area;\n };\n\n#ifdef NDEBUG\n\t\t\/\/ In release mode, use the optimized container.\n boost::container::small_vector<Link, 4> islands_above;\n boost::container::small_vector<Link, 4> islands_below;\n#else\n\t\t\/\/ In debug mode, use the standard vector, which is well handled by debugger visualizer.\n\t\tstd::vector<Link>\t\t\t\t\t \tislands_above;\n\t\tstd::vector<Link>\t\t\t\t\t\tislands_below;\n#endif\n \/\/ Overhangs, that are dangling considerably.\n ExPolygons dangling_areas;\n \/\/ Complete overhands.\n ExPolygons overhangs;\n \/\/ Overhangs, where the surface must slope.\n ExPolygons overhangs_slopes;\n float overhangs_area;\n\n bool overlaps(const Structure &rhs) const { \n return this->bbox.overlap(rhs.bbox) && (this->polygon->overlaps(*rhs.polygon) || rhs.polygon->overlaps(*this->polygon)); \n }\n float overlap_area(const Structure &rhs) const { \n double out = 0.;\n if (this->bbox.overlap(rhs.bbox)) {\n Polygons polys = intersection(to_polygons(*this->polygon), to_polygons(*rhs.polygon), false);\n for (const Polygon &poly : polys)\n out += poly.area();\n }\n return float(out);\n }\n float area_below() const { \n float area = 0.f; \n for (const Link &below : this->islands_below) \n area += below.island->area; \n return area;\n }\n Polygons polygons_below() const { \n size_t cnt = 0;\n\t\t\tfor (const Link &below : this->islands_below)\n cnt += 1 + below.island->polygon->holes.size();\n Polygons out;\n out.reserve(cnt);\n\t\t\tfor (const Link &below : this->islands_below) {\n out.emplace_back(below.island->polygon->contour);\n\t\t\t\tappend(out, below.island->polygon->holes);\n }\n return out;\n }\n ExPolygons expolygons_below() const { \n ExPolygons out;\n out.reserve(this->islands_below.size());\n for (const Link &below : this->islands_below)\n out.emplace_back(*below.island->polygon);\n return out;\n }\n \/\/ Positive deficit of the supports. If negative, this area is well supported. If positive, more supports need to be added.\n float support_force_deficit(const float tear_pressure) const { return this->area * tear_pressure - this->supports_force_total(); }\n };\n\n struct MyLayer {\n\t\tMyLayer(const size_t layer_id, coordf_t print_z) : layer_id(layer_id), print_z(print_z) {}\n size_t layer_id;\n coordf_t print_z;\n std::vector<Structure> islands;\n };\n\n struct RichSupportPoint {\n Vec3f position;\n Structure *island;\n };\n\n struct PointGrid3D {\n struct GridHash {\n std::size_t operator()(const Vec3i &cell_id) const {\n return std::hash<int>()(cell_id.x()) ^ std::hash<int>()(cell_id.y() * 593) ^ std::hash<int>()(cell_id.z() * 7919);\n }\n };\n typedef std::unordered_multimap<Vec3i, RichSupportPoint, GridHash> Grid;\n\n Vec3f cell_size;\n Grid grid;\n\n Vec3i cell_id(const Vec3f &pos) {\n return Vec3i(int(floor(pos.x() \/ cell_size.x())),\n int(floor(pos.y() \/ cell_size.y())),\n int(floor(pos.z() \/ cell_size.z())));\n }\n\n void insert(const Vec2f &pos, Structure *island) {\n RichSupportPoint pt;\n\t\t\tpt.position = Vec3f(pos.x(), pos.y(), float(island->layer->print_z));\n pt.island = island;\n grid.emplace(cell_id(pt.position), pt);\n }\n\n bool collides_with(const Vec2f &pos, Structure *island, float radius) {\n Vec3f pos3d(pos.x(), pos.y(), float(island->layer->print_z));\n Vec3i cell = cell_id(pos3d);\n std::pair<Grid::const_iterator, Grid::const_iterator> it_pair = grid.equal_range(cell);\n if (collides_with(pos3d, radius, it_pair.first, it_pair.second))\n return true;\n for (int i = -1; i < 2; ++ i)\n for (int j = -1; j < 2; ++ j)\n for (int k = -1; k < 1; ++ k) {\n if (i == 0 && j == 0 && k == 0)\n continue;\n it_pair = grid.equal_range(cell + Vec3i(i, j, k));\n if (collides_with(pos3d, radius, it_pair.first, it_pair.second))\n return true;\n }\n return false;\n }\n\n private:\n bool collides_with(const Vec3f &pos, float radius, Grid::const_iterator it_begin, Grid::const_iterator it_end) {\n for (Grid::const_iterator it = it_begin; it != it_end; ++ it) {\n\t\t\t\tfloat dist2 = (it->second.position - pos).squaredNorm();\n if (dist2 < radius * radius)\n return true;\n }\n return false;\n }\n };\n\nprivate:\n std::vector<sla::SupportPoint> m_output;\n\n SLAAutoSupports::Config m_config;\n\n float m_supports_force_total = 0.f;\n\n void process(const std::vector<ExPolygons>& slices, const std::vector<float>& heights);\n void uniformly_cover(const ExPolygons& islands, Structure& structure, PointGrid3D &grid3d, bool is_new_island = false, bool just_one = false);\n void project_onto_mesh(std::vector<sla::SupportPoint>& points) const;\n\n#ifdef SLA_AUTOSUPPORTS_DEBUG\n static void output_expolygons(const ExPolygons& expolys, const std::string &filename);\n static void output_structures(const std::vector<Structure> &structures);\n#endif \/\/ SLA_AUTOSUPPORTS_DEBUG\n\n std::function<void(void)> m_throw_on_cancel;\n const sla::EigenMesh3D& m_emesh;\n};\n\n\n} \/\/ namespace Slic3r\n\n\n#endif \/\/ SLAAUTOSUPPORTS_HPP_<commit_msg>Increased the default SLA support density to 130% of the previous value (100% now works as 130% before)<commit_after>#ifndef SLAAUTOSUPPORTS_HPP_\n#define SLAAUTOSUPPORTS_HPP_\n\n#include <libslic3r\/ClipperUtils.hpp>\n#include <libslic3r\/Point.hpp>\n#include <libslic3r\/TriangleMesh.hpp>\n#include <libslic3r\/SLA\/SLACommon.hpp>\n\n#include <boost\/container\/small_vector.hpp>\n\n\/\/ #define SLA_AUTOSUPPORTS_DEBUG\n\nnamespace Slic3r {\n\nclass SLAAutoSupports {\npublic:\n struct Config {\n float density_relative;\n float minimal_distance;\n float head_diameter;\n \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n inline float support_force() const { return 7.7f \/ density_relative; } \/\/ a force one point can support (arbitrary force unit)\n inline float tear_pressure() const { return 1.f; } \/\/ pressure that the display exerts (the force unit per mm2)\n };\n\n SLAAutoSupports(const TriangleMesh& mesh, const sla::EigenMesh3D& emesh, const std::vector<ExPolygons>& slices,\n const std::vector<float>& heights, const Config& config, std::function<void(void)> throw_on_cancel);\n const std::vector<sla::SupportPoint>& output() { return m_output; }\n\n\tstruct MyLayer;\n\n struct Structure {\n Structure(MyLayer &layer, const ExPolygon& poly, const BoundingBox &bbox, const Vec2f ¢roid, float area, float h) : \n layer(&layer), polygon(&poly), bbox(bbox), centroid(centroid), area(area), height(h)\n#ifdef SLA_AUTOSUPPORTS_DEBUG\n , unique_id(std::chrono::duration_cast<std::chrono::milliseconds>(std::chrono::system_clock::now().time_since_epoch()))\n#endif \/* SLA_AUTOSUPPORTS_DEBUG *\/\n {}\n MyLayer *layer;\n const ExPolygon* polygon = nullptr;\n const BoundingBox bbox;\n const Vec2f centroid = Vec2f::Zero();\n const float area = 0.f;\n float height = 0;\n \/\/ How well is this ExPolygon held to the print base?\n \/\/ Positive number, the higher the better.\n float supports_force_this_layer = 0.f;\n float supports_force_inherited = 0.f;\n float supports_force_total() const { return this->supports_force_this_layer + this->supports_force_inherited; }\n#ifdef SLA_AUTOSUPPORTS_DEBUG\n std::chrono::milliseconds unique_id;\n#endif \/* SLA_AUTOSUPPORTS_DEBUG *\/\n\n struct Link {\n\t\t\tLink(Structure *island, float overlap_area) : island(island), overlap_area(overlap_area) {}\n Structure *island;\n float overlap_area;\n };\n\n#ifdef NDEBUG\n\t\t\/\/ In release mode, use the optimized container.\n boost::container::small_vector<Link, 4> islands_above;\n boost::container::small_vector<Link, 4> islands_below;\n#else\n\t\t\/\/ In debug mode, use the standard vector, which is well handled by debugger visualizer.\n\t\tstd::vector<Link>\t\t\t\t\t \tislands_above;\n\t\tstd::vector<Link>\t\t\t\t\t\tislands_below;\n#endif\n \/\/ Overhangs, that are dangling considerably.\n ExPolygons dangling_areas;\n \/\/ Complete overhands.\n ExPolygons overhangs;\n \/\/ Overhangs, where the surface must slope.\n ExPolygons overhangs_slopes;\n float overhangs_area;\n\n bool overlaps(const Structure &rhs) const { \n return this->bbox.overlap(rhs.bbox) && (this->polygon->overlaps(*rhs.polygon) || rhs.polygon->overlaps(*this->polygon)); \n }\n float overlap_area(const Structure &rhs) const { \n double out = 0.;\n if (this->bbox.overlap(rhs.bbox)) {\n Polygons polys = intersection(to_polygons(*this->polygon), to_polygons(*rhs.polygon), false);\n for (const Polygon &poly : polys)\n out += poly.area();\n }\n return float(out);\n }\n float area_below() const { \n float area = 0.f; \n for (const Link &below : this->islands_below) \n area += below.island->area; \n return area;\n }\n Polygons polygons_below() const { \n size_t cnt = 0;\n\t\t\tfor (const Link &below : this->islands_below)\n cnt += 1 + below.island->polygon->holes.size();\n Polygons out;\n out.reserve(cnt);\n\t\t\tfor (const Link &below : this->islands_below) {\n out.emplace_back(below.island->polygon->contour);\n\t\t\t\tappend(out, below.island->polygon->holes);\n }\n return out;\n }\n ExPolygons expolygons_below() const { \n ExPolygons out;\n out.reserve(this->islands_below.size());\n for (const Link &below : this->islands_below)\n out.emplace_back(*below.island->polygon);\n return out;\n }\n \/\/ Positive deficit of the supports. If negative, this area is well supported. If positive, more supports need to be added.\n float support_force_deficit(const float tear_pressure) const { return this->area * tear_pressure - this->supports_force_total(); }\n };\n\n struct MyLayer {\n\t\tMyLayer(const size_t layer_id, coordf_t print_z) : layer_id(layer_id), print_z(print_z) {}\n size_t layer_id;\n coordf_t print_z;\n std::vector<Structure> islands;\n };\n\n struct RichSupportPoint {\n Vec3f position;\n Structure *island;\n };\n\n struct PointGrid3D {\n struct GridHash {\n std::size_t operator()(const Vec3i &cell_id) const {\n return std::hash<int>()(cell_id.x()) ^ std::hash<int>()(cell_id.y() * 593) ^ std::hash<int>()(cell_id.z() * 7919);\n }\n };\n typedef std::unordered_multimap<Vec3i, RichSupportPoint, GridHash> Grid;\n\n Vec3f cell_size;\n Grid grid;\n\n Vec3i cell_id(const Vec3f &pos) {\n return Vec3i(int(floor(pos.x() \/ cell_size.x())),\n int(floor(pos.y() \/ cell_size.y())),\n int(floor(pos.z() \/ cell_size.z())));\n }\n\n void insert(const Vec2f &pos, Structure *island) {\n RichSupportPoint pt;\n\t\t\tpt.position = Vec3f(pos.x(), pos.y(), float(island->layer->print_z));\n pt.island = island;\n grid.emplace(cell_id(pt.position), pt);\n }\n\n bool collides_with(const Vec2f &pos, Structure *island, float radius) {\n Vec3f pos3d(pos.x(), pos.y(), float(island->layer->print_z));\n Vec3i cell = cell_id(pos3d);\n std::pair<Grid::const_iterator, Grid::const_iterator> it_pair = grid.equal_range(cell);\n if (collides_with(pos3d, radius, it_pair.first, it_pair.second))\n return true;\n for (int i = -1; i < 2; ++ i)\n for (int j = -1; j < 2; ++ j)\n for (int k = -1; k < 1; ++ k) {\n if (i == 0 && j == 0 && k == 0)\n continue;\n it_pair = grid.equal_range(cell + Vec3i(i, j, k));\n if (collides_with(pos3d, radius, it_pair.first, it_pair.second))\n return true;\n }\n return false;\n }\n\n private:\n bool collides_with(const Vec3f &pos, float radius, Grid::const_iterator it_begin, Grid::const_iterator it_end) {\n for (Grid::const_iterator it = it_begin; it != it_end; ++ it) {\n\t\t\t\tfloat dist2 = (it->second.position - pos).squaredNorm();\n if (dist2 < radius * radius)\n return true;\n }\n return false;\n }\n };\n\nprivate:\n std::vector<sla::SupportPoint> m_output;\n\n SLAAutoSupports::Config m_config;\n\n float m_supports_force_total = 0.f;\n\n void process(const std::vector<ExPolygons>& slices, const std::vector<float>& heights);\n void uniformly_cover(const ExPolygons& islands, Structure& structure, PointGrid3D &grid3d, bool is_new_island = false, bool just_one = false);\n void project_onto_mesh(std::vector<sla::SupportPoint>& points) const;\n\n#ifdef SLA_AUTOSUPPORTS_DEBUG\n static void output_expolygons(const ExPolygons& expolys, const std::string &filename);\n static void output_structures(const std::vector<Structure> &structures);\n#endif \/\/ SLA_AUTOSUPPORTS_DEBUG\n\n std::function<void(void)> m_throw_on_cancel;\n const sla::EigenMesh3D& m_emesh;\n};\n\n\n} \/\/ namespace Slic3r\n\n\n#endif \/\/ SLAAUTOSUPPORTS_HPP_<|endoftext|>"} {"text":"<commit_before>#ifndef SLAAUTOSUPPORTS_HPP_\n#define SLAAUTOSUPPORTS_HPP_\n\n#include <libslic3r\/Point.hpp>\n\n\nnamespace Slic3r {\n\nclass ModelObject;\n\n\n\n\nclass SLAAutoSupports {\npublic:\n struct Config {\n float density_at_horizontal;\n float density_at_45;\n float minimal_z;\n };\n\n SLAAutoSupports(ModelObject& mo, const SLAAutoSupports::Config& c);\n void generate();\n\nprivate:\n TriangleMesh mesh;\n static float angle_from_normal(const stl_normal& normal) { return acos((-normal.normalized())(2)); }\n float get_required_density(float angle) const;\n static float approximate_geodesic_distance(const Vec3f& p1, const Vec3f& p2, Vec3f& n1, Vec3f& n2);\n\n ModelObject& m_model_object;\n SLAAutoSupports::Config m_config;\n};\n\n\n\n\n} \/\/ namespace Slic3r\n\n\n#endif \/\/ SLAAUTOSUPPORTS_HPP_<commit_msg>Fixed OSX build.<commit_after>#ifndef SLAAUTOSUPPORTS_HPP_\n#define SLAAUTOSUPPORTS_HPP_\n\n#include <libslic3r\/Point.hpp>\n#include <libslic3r\/TriangleMesh.hpp>\n\n\nnamespace Slic3r {\n\nclass ModelObject;\n\n\n\n\nclass SLAAutoSupports {\npublic:\n struct Config {\n float density_at_horizontal;\n float density_at_45;\n float minimal_z;\n };\n\n SLAAutoSupports(ModelObject& mo, const SLAAutoSupports::Config& c);\n void generate();\n\nprivate:\n TriangleMesh mesh;\n static float angle_from_normal(const stl_normal& normal) { return acos((-normal.normalized())(2)); }\n float get_required_density(float angle) const;\n static float approximate_geodesic_distance(const Vec3f& p1, const Vec3f& p2, Vec3f& n1, Vec3f& n2);\n\n ModelObject& m_model_object;\n SLAAutoSupports::Config m_config;\n};\n\n\n\n\n} \/\/ namespace Slic3r\n\n\n#endif \/\/ SLAAUTOSUPPORTS_HPP_<|endoftext|>"} {"text":"<commit_before>#pragma once\n\/*\n** Copyright (C) 2012 Aldebaran Robotics\n** See COPYING for the license\n*\/\n\n#ifndef _QIMESSAGING_TYPETUPLE_HXX_\n#define _QIMESSAGING_TYPETUPLE_HXX_\n\n#include <qi\/preproc.hpp>\n\nnamespace qi\n{\n namespace detail {\n template<typename T> void setFromStorage(T& ref, void* storage)\n {\n ref = *(T*)typeOf<T>()->ptrFromStorage(&storage);\n }\n }\n}\n\n#define QI_TYPE_STRUCT_DECLARE(name) \\\nnamespace qi { \\\n template<> struct TypeImpl<name>: public TypeTuple \\\n { \\\n public: \\\n virtual std::vector<Type*> memberTypes(void*); \\\n virtual void* get(void* storage, unsigned int index); \\\n virtual void set(void** storage, unsigned int index, void* valStorage); \\\n _QI_BOUNCE_TYPE_METHODS(DefaultTypeImplMethods<name>); \\\n }; }\n\n\n#define __QI_TUPLE_TYPE(_, what, field) res.push_back(typeOf(ptr->field));\n#define __QI_TUPLE_GET(_, what, field) if (i == index) return typeOf(ptr->field)->initializeStorage(&ptr->field); i++;\n#define __QI_TUPLE_SET(_, what, field) if (i == index) detail::setFromStorage(ptr->field, valueStorage); i++;\n#define __QI_TYPE_STRUCT_IMPLEMENT(name, inl, onSet, ...) \\\nnamespace qi { \\\n inl std::vector<Type*> TypeImpl<name>::memberTypes(void* storage) \\\n { \\\n name* ptr = 0; \\\n std::vector<Type*> res; \\\n QI_VAARGS_APPLY(__QI_TUPLE_TYPE, _, __VA_ARGS__); \\\n return res; \\\n } \\\n inl void* TypeImpl<name>::get(void* storage, unsigned int index) \\\n { \\\n unsigned int i = 0; \\\n name* ptr = (name*)ptrFromStorage(&storage); \\\n QI_VAARGS_APPLY(__QI_TUPLE_GET, _, __VA_ARGS__); \\\n return 0; \\\n } \\\n inl void TypeImpl<name>::set(void** storage, unsigned int index, void* valueStorage)\\\n { \\\n unsigned int i=0; \\\n name* ptr = (name*)ptrFromStorage(storage); \\\n QI_VAARGS_APPLY(__QI_TUPLE_SET, _, __VA_ARGS__); \\\n onSet \\\n }\\\n}\n\n#define QI_TYPE_STRUCT_PRIVATE_ACCESS(name) \\\nfriend class qi::TypeImpl<name>;\n\n#define QI_TYPE_STRUCT(name, ...) \\\n QI_TYPE_STRUCT_DECLARE(name) \\\n __QI_TYPE_STRUCT_IMPLEMENT(name, inline, \/**\/, __VA_ARGS__)\n\n#define QI_TYPE_STRUCT_EX(name, onSet, ...) \\\n QI_TYPE_STRUCT_DECLARE(name) \\\n __QI_TYPE_STRUCT_IMPLEMENT(name, inline, onSet, __VA_ARGS__)\n\n#define QI_TYPE_STRUCT_IMPLEMENT(name, ...) \\\n __QI_TYPE_STRUCT_IMPLEMENT(name, \/**\/, \/**\/, __VA_ARGS__)\n\n#define QI_TYPE_STRUCT_BOUNCE(name, bounceTo, conversion) \\\nnamespace qi { \\\ntemplate<> class TypeImpl<name>: public TypeTupleBouncer<name, bounceTo> \\\n{ \\\npublic: \\\n void adaptStorage(void** storage, void** adapted) \\\n { \\\n name* ptr = (name*)ptrFromStorage(storage); \\\n bounceTo * tptr = conversion(ptr); \\\n *adapted = bounceType()->initializeStorage(tptr); \\\n } \\\n};}\n\n\n\nnamespace qi {\n template<typename T, typename TO> class TypeTupleBouncer: public TypeTuple\n {\n public:\n TypeTuple* bounceType()\n {\n static Type* result = 0;\n if (!result)\n result = typeOf<TO>();\n return static_cast<TypeTuple*>(result);\n }\n virtual void adaptStorage(void** storage, void** adapted) = 0;\n typedef DefaultTypeImplMethods<T> Methods;\n virtual std::vector<Type*> memberTypes(void* storage)\n {\n void* astorage = 0;\n if (storage) \/\/ memberTypes should not require storage\n adaptStorage(&storage, &astorage);\n return bounceType()->memberTypes(astorage);\n }\n virtual void* get(void* storage, unsigned int index)\n {\n void* astorage;\n adaptStorage(&storage, &astorage);\n return bounceType()->get(astorage, index);\n }\n virtual void set(void** storage, unsigned int index, void* valStorage)\n {\n void* astorage;\n adaptStorage(storage, &astorage);\n bounceType()->set(&astorage, index, valStorage);\n }\n _QI_BOUNCE_TYPE_METHODS(Methods);\n };\n}\n#endif\n<commit_msg>indentation<commit_after>#pragma once\n\/*\n** Copyright (C) 2012 Aldebaran Robotics\n** See COPYING for the license\n*\/\n\n#ifndef _QIMESSAGING_TYPETUPLE_HXX_\n#define _QIMESSAGING_TYPETUPLE_HXX_\n\n#include <qi\/preproc.hpp>\n\nnamespace qi\n{\n namespace detail {\n template<typename T> void setFromStorage(T& ref, void* storage)\n {\n ref = *(T*)typeOf<T>()->ptrFromStorage(&storage);\n }\n }\n}\n\n#define QI_TYPE_STRUCT_DECLARE(name) \\\nnamespace qi { \\\n template<> struct TypeImpl<name>: public TypeTuple \\\n { \\\n public: \\\n virtual std::vector<Type*> memberTypes(void*); \\\n virtual void* get(void* storage, unsigned int index); \\\n virtual void set(void** storage, unsigned int index, void* valStorage); \\\n _QI_BOUNCE_TYPE_METHODS(DefaultTypeImplMethods<name>); \\\n }; }\n\n\n#define __QI_TUPLE_TYPE(_, what, field) res.push_back(typeOf(ptr->field));\n#define __QI_TUPLE_GET(_, what, field) if (i == index) return typeOf(ptr->field)->initializeStorage(&ptr->field); i++;\n#define __QI_TUPLE_SET(_, what, field) if (i == index) detail::setFromStorage(ptr->field, valueStorage); i++;\n#define __QI_TYPE_STRUCT_IMPLEMENT(name, inl, onSet, ...) \\\nnamespace qi { \\\n inl std::vector<Type*> TypeImpl<name>::memberTypes(void* storage) \\\n { \\\n name* ptr = 0; \\\n std::vector<Type*> res; \\\n QI_VAARGS_APPLY(__QI_TUPLE_TYPE, _, __VA_ARGS__); \\\n return res; \\\n } \\\n inl void* TypeImpl<name>::get(void* storage, unsigned int index) \\\n { \\\n unsigned int i = 0; \\\n name* ptr = (name*)ptrFromStorage(&storage); \\\n QI_VAARGS_APPLY(__QI_TUPLE_GET, _, __VA_ARGS__); \\\n return 0; \\\n } \\\n inl void TypeImpl<name>::set(void** storage, unsigned int index, void* valueStorage)\\\n { \\\n unsigned int i=0; \\\n name* ptr = (name*)ptrFromStorage(storage); \\\n QI_VAARGS_APPLY(__QI_TUPLE_SET, _, __VA_ARGS__); \\\n onSet \\\n }\\\n}\n\n#define QI_TYPE_STRUCT_PRIVATE_ACCESS(name) \\\nfriend class qi::TypeImpl<name>;\n\n#define QI_TYPE_STRUCT(name, ...) \\\n QI_TYPE_STRUCT_DECLARE(name) \\\n __QI_TYPE_STRUCT_IMPLEMENT(name, inline, \/**\/, __VA_ARGS__)\n\n#define QI_TYPE_STRUCT_EX(name, onSet, ...) \\\n QI_TYPE_STRUCT_DECLARE(name) \\\n __QI_TYPE_STRUCT_IMPLEMENT(name, inline, onSet, __VA_ARGS__)\n\n#define QI_TYPE_STRUCT_IMPLEMENT(name, ...) \\\n __QI_TYPE_STRUCT_IMPLEMENT(name, \/**\/, \/**\/, __VA_ARGS__)\n\n#define QI_TYPE_STRUCT_BOUNCE(name, bounceTo, conversion) \\\nnamespace qi { \\\ntemplate<> class TypeImpl<name>: public TypeTupleBouncer<name, bounceTo> \\\n{ \\\npublic: \\\n void adaptStorage(void** storage, void** adapted) \\\n { \\\n name* ptr = (name*)ptrFromStorage(storage); \\\n bounceTo * tptr = conversion(ptr); \\\n *adapted = bounceType()->initializeStorage(tptr); \\\n } \\\n};}\n\n\n\nnamespace qi {\n template<typename T, typename TO> class TypeTupleBouncer: public TypeTuple\n {\n public:\n TypeTuple* bounceType()\n {\n static Type* result = 0;\n if (!result)\n result = typeOf<TO>();\n return static_cast<TypeTuple*>(result);\n }\n\n virtual void adaptStorage(void** storage, void** adapted) = 0;\n\n typedef DefaultTypeImplMethods<T> Methods;\n virtual std::vector<Type*> memberTypes(void* storage)\n {\n void* astorage = 0;\n if (storage) \/\/ memberTypes should not require storage\n adaptStorage(&storage, &astorage);\n return bounceType()->memberTypes(astorage);\n }\n\n virtual void* get(void* storage, unsigned int index)\n {\n void* astorage;\n adaptStorage(&storage, &astorage);\n return bounceType()->get(astorage, index);\n }\n\n virtual void set(void** storage, unsigned int index, void* valStorage)\n {\n void* astorage;\n adaptStorage(storage, &astorage);\n bounceType()->set(&astorage, index, valStorage);\n }\n\n _QI_BOUNCE_TYPE_METHODS(Methods);\n };\n}\n#endif\n<|endoftext|>"} {"text":"<commit_before>\/*\n * This file is part of Maliit Plugins\n *\n * Copyright (C) 2012 Openismus GmbH\n *\n * Contact: maliit-discuss@lists.maliit.org\n *\n * Redistribution and use in source and binary forms, with or without modification,\n * are permitted provided that the following conditions are met:\n *\n * Redistributions of source code must retain the above copyright notice, this list\n * of conditions and the following disclaimer.\n * Redistributions in binary form must reproduce the above copyright notice, this list\n * of conditions and the following disclaimer in the documentation and\/or other materials\n * provided with the distribution.\n * Neither the name of Nokia Corporation nor the names of its contributors may be\n * used to endorse or promote products derived from this software without specific\n * prior written permission.\n *\n * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS \"AS IS\" AND ANY\n * EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF\n * MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL\n * THE COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,\n * EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF\n * 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,\n * OR TORT (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 \"abstractwordengine.h\"\n\nnamespace MaliitKeyboard {\nnamespace Logic {\n\n\/\/! \\class AbstractWordEngine\n\/\/! Provides word candidates based on text model. Derived classes need to\n\/\/! provide an implementation for \\a fetchCandidates().\n\/\/! \\sa Model::Text, computeCandidates().\n\n\/\/! \\fn void AbstractWordEngine::enabledChanged(bool enabled)\n\/\/! \\brief Emitted when word engine toggles word candidate updates on\/off.\n\/\/! \\param enabled Whether word engine is enabled.\n\n\/\/! \\fn void AbstractWordEngine::candidatesChanged(const WordCandidateList &candidates)\n\/\/! \\brief Emitted when new candidates have been computed.\n\/\/! \\param candidates The list of updated candidates.\n\n\/\/! \\fn WordCandidateList AbstractWordEngine::fetchCandidates(Model::Text *text)\n\/\/! \\brief Returns a list of candidates.\n\/\/!\n\/\/! Needs to be implemented by derived classes. Will not be called if engine\n\/\/! is disabled or text model has no preedit.\n\/\/! \\param text The text model.\n\nclass AbstractWordEnginePrivate\n{\npublic:\n bool enabled;\n\n explicit AbstractWordEnginePrivate();\n};\n\n\nAbstractWordEnginePrivate::AbstractWordEnginePrivate()\n : enabled(false)\n{}\n\n\n\/\/! \\param parent The owner of this instance. Can be 0, in case QObject\n\/\/! ownership is not required.\nAbstractWordEngine::AbstractWordEngine(QObject *parent)\n : QObject(parent)\n , d_ptr(new AbstractWordEnginePrivate)\n{}\n\n\nAbstractWordEngine::~AbstractWordEngine()\n{}\n\n\n\/\/! \\brief Returns whether the engine provides updates for word candidates.\nbool AbstractWordEngine::isEnabled() const\n{\n Q_D(const AbstractWordEngine);\n return d->enabled;\n}\n\n\n\/\/! \\brief Set whether the engine should provide updates for word candidates.\n\/\/! \\param enabled Setting to true will be ignored if there's no word\n\/\/! prediction or error correction backend available.\nvoid AbstractWordEngine::setEnabled(bool enabled)\n{\n Q_D(AbstractWordEngine);\n\n if (d->enabled != enabled) {\n clearCandidates();\n d->enabled = enabled;\n Q_EMIT enabledChanged(d->enabled);\n }\n}\n\n\n\/\/! \\brief Clears the current candidates.\n\/\/!\n\/\/! Only has an effect when word engine is enabled, in which case\n\/\/! candidatesCanged() is emitted.\nvoid AbstractWordEngine::clearCandidates()\n{\n if (isEnabled()) {\n Q_EMIT candidatesChanged(WordCandidateList());\n }\n}\n\n\n\/\/! \\brief Computes new candidates, based on text model.\n\/\/! \\param text The text model. Can trigger emission of candidatesChanged().\nvoid AbstractWordEngine::computeCandidates(Model::Text *text)\n{\n \/\/ FIXME: add possiblity to turn off the error correction for\n \/\/ entries that does not need it (like password entries). Also,\n \/\/ with that we probably will want to turn off preedit styling at\n \/\/ all.\n\n if (not isEnabled()\n || not text\n || text->preedit().isEmpty()\n || not text->preedit().at(text->preedit().length() - 1).isLetterOrNumber()) {\n \/\/ FIXME: We should here set some special preedit face in text\n \/\/ model (say Disabled or None) which would be interpreted by\n \/\/ editor to send no formatting informations along with\n \/\/ preedit string. When this is done, preedit-string test\n \/\/ needs to be adapted.\n return;\n }\n\n Q_EMIT candidatesChanged(fetchCandidates(text));\n}\n\nvoid AbstractWordEngine::addToUserDictionary(const QString &word)\n{\n Q_UNUSED(word);\n}\n\n}} \/\/ namespace MaliitKeyboard, Logic\n<commit_msg>Document AbstractWordEngine bit more.<commit_after>\/*\n * This file is part of Maliit Plugins\n *\n * Copyright (C) 2012 Openismus GmbH\n *\n * Contact: maliit-discuss@lists.maliit.org\n *\n * Redistribution and use in source and binary forms, with or without modification,\n * are permitted provided that the following conditions are met:\n *\n * Redistributions of source code must retain the above copyright notice, this list\n * of conditions and the following disclaimer.\n * Redistributions in binary form must reproduce the above copyright notice, this list\n * of conditions and the following disclaimer in the documentation and\/or other materials\n * provided with the distribution.\n * Neither the name of Nokia Corporation nor the names of its contributors may be\n * used to endorse or promote products derived from this software without specific\n * prior written permission.\n *\n * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS \"AS IS\" AND ANY\n * EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF\n * MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL\n * THE COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,\n * EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF\n * 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,\n * OR TORT (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 \"abstractwordengine.h\"\n\nnamespace MaliitKeyboard {\nnamespace Logic {\n\n\/\/! \\class AbstractWordEngine\n\/\/! \\brief Provides word candidates based on text model.\n\/\/!\n\/\/! Derived classes need to provide an implementation for\n\/\/! fetchCandidates() and, optionally, addToUserDictionary().\n\/\/! \\sa Model::Text, computeCandidates().\n\n\/\/! \\fn void AbstractWordEngine::enabledChanged(bool enabled)\n\/\/! \\brief Emitted when word engine toggles word candidate updates on\/off.\n\/\/! \\param enabled Whether word engine is enabled.\n\n\/\/! \\fn void AbstractWordEngine::candidatesChanged(const WordCandidateList &candidates)\n\/\/! \\brief Emitted when new candidates have been computed.\n\/\/! \\param candidates The list of updated candidates.\n\n\/\/! \\fn WordCandidateList AbstractWordEngine::fetchCandidates(Model::Text *text)\n\/\/! \\brief Returns a list of candidates.\n\/\/! \\param text The text model.\n\/\/!\n\/\/! Needs to be implemented by derived classes. Will not be called if engine\n\/\/! is disabled or text model has no preedit.\n\n\/\/! \\property AbstractWordEngine::enabled\n\/\/! \\brief Whether the engine provides updates for word candidates.\n\nclass AbstractWordEnginePrivate\n{\npublic:\n bool enabled;\n\n explicit AbstractWordEnginePrivate();\n};\n\nAbstractWordEnginePrivate::AbstractWordEnginePrivate()\n : enabled(false)\n{}\n\n\n\/\/! \\brief Constructor.\n\/\/! \\param parent The owner of this instance. Can be 0, in case QObject\n\/\/! ownership is not required.\nAbstractWordEngine::AbstractWordEngine(QObject *parent)\n : QObject(parent)\n , d_ptr(new AbstractWordEnginePrivate)\n{}\n\n\/\/! \\brief Destructor.\n\/\/!\n\/\/! Needs to be implemented in derived classes.\nAbstractWordEngine::~AbstractWordEngine()\n{}\n\n\n\/\/! \\brief Returns whether the word engine is enabled.\n\/\/! \\sa AbstractWordEngine::enabled\nbool AbstractWordEngine::isEnabled() const\n{\n Q_D(const AbstractWordEngine);\n return d->enabled;\n}\n\n\n\/\/! \\brief Set whether the engine should be enabled.\n\/\/! \\param enabled Setting to true will be ignored if there's no word\n\/\/! prediction or error correction backend available.\n\/\/! \\sa AbstractWordEngine::enabled\nvoid AbstractWordEngine::setEnabled(bool enabled)\n{\n Q_D(AbstractWordEngine);\n\n if (d->enabled != enabled) {\n clearCandidates();\n d->enabled = enabled;\n Q_EMIT enabledChanged(d->enabled);\n }\n}\n\n\n\/\/! \\brief Clears the current candidates.\n\/\/!\n\/\/! Only has an effect when word engine is enabled, in which case\n\/\/! candidatesCanged() is emitted.\nvoid AbstractWordEngine::clearCandidates()\n{\n if (isEnabled()) {\n Q_EMIT candidatesChanged(WordCandidateList());\n }\n}\n\n\n\/\/! \\brief Computes new candidates, based on text model.\n\/\/! \\param text The text model.\n\/\/!\n\/\/! Can trigger emission of candidatesChanged().\nvoid AbstractWordEngine::computeCandidates(Model::Text *text)\n{\n \/\/ FIXME: add possiblity to turn off the error correction for\n \/\/ entries that does not need it (like password entries). Also,\n \/\/ with that we probably will want to turn off preedit styling at\n \/\/ all.\n\n if (not isEnabled()\n || not text\n || text->preedit().isEmpty()\n || not text->preedit().at(text->preedit().length() - 1).isLetterOrNumber()) {\n \/\/ FIXME: We should here set some special preedit face in text\n \/\/ model (say Disabled or None) which would be interpreted by\n \/\/ editor to send no formatting informations along with\n \/\/ preedit string. When this is done, preedit-string test\n \/\/ needs to be adapted.\n return;\n }\n\n Q_EMIT candidatesChanged(fetchCandidates(text));\n}\n\n\/\/! \\brief Adds a word to user dictionary.\n\/\/! \\param word A word.\n\/\/!\n\/\/! Needs to be implemented in derived classes. This does nothing.\nvoid AbstractWordEngine::addToUserDictionary(const QString &word)\n{\n Q_UNUSED(word);\n}\n\n}} \/\/ namespace MaliitKeyboard, Logic\n<|endoftext|>"} {"text":"<commit_before>\/\/ Copyright 2010-2015 RethinkDB, all rights reserved.\n#ifndef CLUSTERING_TABLE_MANAGER_TABLE_META_CLIENT_HPP_\n#define CLUSTERING_TABLE_MANAGER_TABLE_META_CLIENT_HPP_\n\n#include \"clustering\/table_manager\/table_metadata.hpp\"\n#include \"concurrency\/cross_thread_watchable.hpp\"\n#include \"concurrency\/watchable_map.hpp\"\n\nclass multi_table_manager_t;\n\nclass no_such_table_exc_t : public std::runtime_error {\npublic:\n no_such_table_exc_t() :\n std::runtime_error(\"there is no table with the given name \/ UUID\") { }\n};\n\nclass ambiguous_table_exc_t : public std::runtime_error {\npublic:\n ambiguous_table_exc_t() :\n std::runtime_error(\"there are multiple tables with the given name\") { }\n};\n\nclass failed_table_op_exc_t : public std::runtime_error {\npublic:\n failed_table_op_exc_t() : std::runtime_error(\"the attempt to read or modify the \"\n \"table's configuration failed because none of the servers were accessible\") { }\n};\n\nclass maybe_failed_table_op_exc_t : public std::runtime_error {\npublic:\n maybe_failed_table_op_exc_t() : std::runtime_error(\"something went wrong while we \"\n \"were trying to modify the table's configuration; the modification may or may \"\n \"not have been applied\") { }\n};\n\n\/* `table_meta_client_t` is responsible for submitting client requests over the network\nto the `multi_table_manager_t`. It doesn't have any real state of its own; it's just a\nconvenient way of bundling together all of the objects that are necessary for submitting\na client request. *\/\nclass table_meta_client_t :\n public home_thread_mixin_t {\npublic:\n table_meta_client_t(\n mailbox_manager_t *_mailbox_manager,\n multi_table_manager_t *_multi_table_manager,\n watchable_map_t<peer_id_t, multi_table_manager_bcard_t>\n *_multi_table_manager_directory,\n watchable_map_t<std::pair<peer_id_t, namespace_id_t>, table_manager_bcard_t>\n *_table_manager_directory);\n\n \/* All of these functions can be called from any thread. *\/\n\n \/* `find()` determines the ID of the table with the given name in the given database.\n *\/\n void find(\n const database_id_t &database, const name_string_t &name,\n namespace_id_t *table_id_out, std::string *primary_key_out = nullptr)\n THROWS_ONLY(no_such_table_exc_t, ambiguous_table_exc_t);\n\n \/* `exists()` returns `true` if one or more tables exist with the given name in the\n given database. *\/\n bool exists(const database_id_t &database, const name_string_t &name);\n\n \/* `get_name()` determines the name, database, and primary key of the table with the\n given ID; it's the reverse of `find()`. It returns `false` if there is no existing\n table with that ID. `get_name()` will not block. *\/\n void get_name(\n const namespace_id_t &table_id,\n table_basic_config_t *basic_config_out)\n THROWS_ONLY(no_such_table_exc_t);\n\n \/* `list_names()` determines the IDs, names, databases, and primary keys of every\n table. It will not block. *\/\n void list_names(\n std::map<namespace_id_t, table_basic_config_t> *names_out);\n\n \/* `get_config()` fetches the configuration of the table with the given ID. It may\n block and it may fail. *\/\n void get_config(\n const namespace_id_t &table_id,\n signal_t *interruptor,\n table_config_and_shards_t *config_out)\n THROWS_ONLY(interrupted_exc_t, no_such_table_exc_t, failed_table_op_exc_t);\n\n \/* `list_configs()` fetches the configurations of every table at once. It may block.\n *\/\n void list_configs(\n signal_t *interruptor,\n std::map<namespace_id_t, table_config_and_shards_t> *configs_out)\n THROWS_ONLY(interrupted_exc_t, failed_table_op_exc_t);\n\n \/* `get_status()` returns the secondary index status of the table with the given ID.\n It may block. *\/\n void get_status(\n const namespace_id_t &table_id,\n signal_t *interruptor,\n std::map<std::string, std::pair<sindex_config_t, sindex_status_t> >\n *index_statuses_out,\n std::map<peer_id_t, contracts_and_contract_acks_t> *contracts_and_acks_out)\n THROWS_ONLY(interrupted_exc_t, no_such_table_exc_t, failed_table_op_exc_t);\n\n \/* `create()` creates a table with the given configuration. It sets `*table_id_out`\n to the ID of the newly generated table. It may block. If it returns successfully, the\n change will be visible in `find()`, etc. *\/\n void create(\n namespace_id_t new_table_id,\n const table_config_and_shards_t &new_config,\n signal_t *interruptor)\n THROWS_ONLY(interrupted_exc_t, failed_table_op_exc_t,\n maybe_failed_table_op_exc_t);\n\n \/* `drop()` drops the table with the given ID. It may block. If it returns `false`,\n the change may or may not have succeeded. If it returns successfully, the change will\n be visible in `find()`, etc. *\/\n void drop(\n const namespace_id_t &table_id,\n signal_t *interruptor)\n THROWS_ONLY(interrupted_exc_t, no_such_table_exc_t, failed_table_op_exc_t,\n maybe_failed_table_op_exc_t);\n\n \/* `set_config()` changes the configuration of the table with the given ID. It may\n block. If it returns successfully, the change will be visible in `find()`, etc. *\/\n void set_config(\n const namespace_id_t &table_id,\n const table_config_and_shards_t &new_config,\n signal_t *interruptor)\n THROWS_ONLY(interrupted_exc_t, no_such_table_exc_t, failed_table_op_exc_t,\n maybe_failed_table_op_exc_t);\n\nprivate:\n typedef std::pair<table_basic_config_t, multi_table_manager_bcard_t::timestamp_t>\n timestamped_basic_config_t;\n\n [[noreturn]] void throw_appropriate_exception(const namespace_id_t &table_id)\n THROWS_ONLY(no_such_table_exc_t, failed_table_op_exc_t);\n\n void wait_until_change_visible(\n const namespace_id_t &table_id,\n const std::function<bool(const timestamped_basic_config_t *)> &cb,\n signal_t *interruptor)\n THROWS_ONLY(interrupted_exc_t, maybe_failed_table_op_exc_t);\n\n mailbox_manager_t *const mailbox_manager;\n multi_table_manager_t *const multi_table_manager;\n watchable_map_t<peer_id_t, multi_table_manager_bcard_t>\n *const multi_table_manager_directory;\n watchable_map_t<std::pair<peer_id_t, namespace_id_t>, table_manager_bcard_t>\n *const table_manager_directory;\n\n \/* `table_basic_configs` distributes the `table_basic_config_t`s from the\n `multi_table_manager_t` to each thread, so that `find()`, `get_name()`, and\n `list_names()` can run without blocking. *\/\n all_thread_watchable_map_var_t<namespace_id_t, timestamped_basic_config_t>\n table_basic_configs;\n};\n\n#endif \/* CLUSTERING_TABLE_MANAGER_TABLE_META_CLIENT_HPP_ *\/\n\n<commit_msg>Add a comment explaining the exceptions in table_meta_client.hpp.<commit_after>\/\/ Copyright 2010-2015 RethinkDB, all rights reserved.\n#ifndef CLUSTERING_TABLE_MANAGER_TABLE_META_CLIENT_HPP_\n#define CLUSTERING_TABLE_MANAGER_TABLE_META_CLIENT_HPP_\n\n#include \"clustering\/table_manager\/table_metadata.hpp\"\n#include \"concurrency\/cross_thread_watchable.hpp\"\n#include \"concurrency\/watchable_map.hpp\"\n\nclass multi_table_manager_t;\n\n\/* These four exception classes are all thrown by `table_meta_client_t` to describe\ndifferent error conditions. There are several reasons why this is better than having\n`table_meta_client_t` just throw an `admin_op_exc_t`:\n\n 1. Sometimes we want to catch `no_such_table_exc_t` instead of reporting it to the user.\n For example, if we call `list_names()` and then run some other operation on each\n table in the list, we want to ignore any `no_such_table_exc_t`s thrown by that\n operation.\n\n 2. `table_meta_client_t` usually doesn't have access to the name of the table. The\n caller will typically catch the exception at a point where the table name is known\n and then produce a user-readable error message that includes the table name.\n\n 3. `table_meta_client_t` often doesn't have enough context to produce an optimal error\n message. The caller will typically add more context when it catches the exception and\n forwards it to the user. For example, instead of saying \"the table's configuration\n was not modified\" it can say \"the secondary index was not renamed\".\n\nNote that the exception descriptions here are mostly just for documentation; unless there\nis a bug, they will never be shown to the user. *\/\n\nclass no_such_table_exc_t : public std::runtime_error {\npublic:\n no_such_table_exc_t() :\n std::runtime_error(\"there is no table with the given name \/ UUID\") { }\n};\n\nclass ambiguous_table_exc_t : public std::runtime_error {\npublic:\n ambiguous_table_exc_t() :\n std::runtime_error(\"there are multiple tables with the given name\") { }\n};\n\nclass failed_table_op_exc_t : public std::runtime_error {\npublic:\n failed_table_op_exc_t() : std::runtime_error(\"the attempt to read or modify the \"\n \"table's configuration failed because none of the servers were accessible. if \"\n \"it was an attempt to modify, the modification did not take place.\") { }\n};\n\nclass maybe_failed_table_op_exc_t : public std::runtime_error {\npublic:\n maybe_failed_table_op_exc_t() : std::runtime_error(\"the attempt to modify the \"\n \"table's configuration failed because we lost contact with the servers after \"\n \"initiating the modification, or the Raft leader lost contact with its \"\n \"followers, or we timed out while waiting for the changes to propagate. the \"\n \"modification may or may not have taken place.\") { }\n};\n\n\/* `table_meta_client_t` is responsible for submitting client requests over the network\nto the `multi_table_manager_t`. It doesn't have any real state of its own; it's just a\nconvenient way of bundling together all of the objects that are necessary for submitting\na client request. *\/\nclass table_meta_client_t :\n public home_thread_mixin_t {\npublic:\n table_meta_client_t(\n mailbox_manager_t *_mailbox_manager,\n multi_table_manager_t *_multi_table_manager,\n watchable_map_t<peer_id_t, multi_table_manager_bcard_t>\n *_multi_table_manager_directory,\n watchable_map_t<std::pair<peer_id_t, namespace_id_t>, table_manager_bcard_t>\n *_table_manager_directory);\n\n \/* All of these functions can be called from any thread. *\/\n\n \/* `find()` determines the ID of the table with the given name in the given database.\n *\/\n void find(\n const database_id_t &database, const name_string_t &name,\n namespace_id_t *table_id_out, std::string *primary_key_out = nullptr)\n THROWS_ONLY(no_such_table_exc_t, ambiguous_table_exc_t);\n\n \/* `exists()` returns `true` if one or more tables exist with the given name in the\n given database. *\/\n bool exists(const database_id_t &database, const name_string_t &name);\n\n \/* `get_name()` determines the name, database, and primary key of the table with the\n given ID; it's the reverse of `find()`. It returns `false` if there is no existing\n table with that ID. `get_name()` will not block. *\/\n void get_name(\n const namespace_id_t &table_id,\n table_basic_config_t *basic_config_out)\n THROWS_ONLY(no_such_table_exc_t);\n\n \/* `list_names()` determines the IDs, names, databases, and primary keys of every\n table. It will not block. *\/\n void list_names(\n std::map<namespace_id_t, table_basic_config_t> *names_out);\n\n \/* `get_config()` fetches the configuration of the table with the given ID. It may\n block and it may fail. *\/\n void get_config(\n const namespace_id_t &table_id,\n signal_t *interruptor,\n table_config_and_shards_t *config_out)\n THROWS_ONLY(interrupted_exc_t, no_such_table_exc_t, failed_table_op_exc_t);\n\n \/* `list_configs()` fetches the configurations of every table at once. It may block.\n *\/\n void list_configs(\n signal_t *interruptor,\n std::map<namespace_id_t, table_config_and_shards_t> *configs_out)\n THROWS_ONLY(interrupted_exc_t, failed_table_op_exc_t);\n\n \/* `get_status()` returns the secondary index status of the table with the given ID.\n It may block. *\/\n void get_status(\n const namespace_id_t &table_id,\n signal_t *interruptor,\n std::map<std::string, std::pair<sindex_config_t, sindex_status_t> >\n *index_statuses_out,\n std::map<peer_id_t, contracts_and_contract_acks_t> *contracts_and_acks_out)\n THROWS_ONLY(interrupted_exc_t, no_such_table_exc_t, failed_table_op_exc_t);\n\n \/* `create()` creates a table with the given configuration. It sets `*table_id_out`\n to the ID of the newly generated table. It may block. If it returns successfully, the\n change will be visible in `find()`, etc. *\/\n void create(\n namespace_id_t new_table_id,\n const table_config_and_shards_t &new_config,\n signal_t *interruptor)\n THROWS_ONLY(interrupted_exc_t, failed_table_op_exc_t,\n maybe_failed_table_op_exc_t);\n\n \/* `drop()` drops the table with the given ID. It may block. If it returns `false`,\n the change may or may not have succeeded. If it returns successfully, the change will\n be visible in `find()`, etc. *\/\n void drop(\n const namespace_id_t &table_id,\n signal_t *interruptor)\n THROWS_ONLY(interrupted_exc_t, no_such_table_exc_t, failed_table_op_exc_t,\n maybe_failed_table_op_exc_t);\n\n \/* `set_config()` changes the configuration of the table with the given ID. It may\n block. If it returns successfully, the change will be visible in `find()`, etc. *\/\n void set_config(\n const namespace_id_t &table_id,\n const table_config_and_shards_t &new_config,\n signal_t *interruptor)\n THROWS_ONLY(interrupted_exc_t, no_such_table_exc_t, failed_table_op_exc_t,\n maybe_failed_table_op_exc_t);\n\nprivate:\n typedef std::pair<table_basic_config_t, multi_table_manager_bcard_t::timestamp_t>\n timestamped_basic_config_t;\n\n [[noreturn]] void throw_appropriate_exception(const namespace_id_t &table_id)\n THROWS_ONLY(no_such_table_exc_t, failed_table_op_exc_t);\n\n void wait_until_change_visible(\n const namespace_id_t &table_id,\n const std::function<bool(const timestamped_basic_config_t *)> &cb,\n signal_t *interruptor)\n THROWS_ONLY(interrupted_exc_t, maybe_failed_table_op_exc_t);\n\n mailbox_manager_t *const mailbox_manager;\n multi_table_manager_t *const multi_table_manager;\n watchable_map_t<peer_id_t, multi_table_manager_bcard_t>\n *const multi_table_manager_directory;\n watchable_map_t<std::pair<peer_id_t, namespace_id_t>, table_manager_bcard_t>\n *const table_manager_directory;\n\n \/* `table_basic_configs` distributes the `table_basic_config_t`s from the\n `multi_table_manager_t` to each thread, so that `find()`, `get_name()`, and\n `list_names()` can run without blocking. *\/\n all_thread_watchable_map_var_t<namespace_id_t, timestamped_basic_config_t>\n table_basic_configs;\n};\n\n#endif \/* CLUSTERING_TABLE_MANAGER_TABLE_META_CLIENT_HPP_ *\/\n\n<|endoftext|>"} {"text":"<commit_before>\/\/ str.cpp see license.txt for copyright and terms of use\n\/\/ code for str.h\n\/\/ Scott McPeak, 1995-2000 This file is public domain.\n\n#include \"str.h\" \/\/ this module\n\n#include <stdlib.h> \/\/ atoi\n#include <stdio.h> \/\/ sprintf\n#include <ctype.h> \/\/ isspace\n#include <string.h> \/\/ strcmp\n#include <iostream.h> \/\/ ostream << char*\n#include <assert.h> \/\/ assert\n#include <unistd.h> \/\/ write\n\n#include \"xassert.h\" \/\/ xassert\n#include \"ckheap.h\" \/\/ checkHeapNode\n#include \"flatten.h\" \/\/ Flatten\n#include \"nonport.h\" \/\/ vnprintf\n#include \"array.h\" \/\/ Array\n\n\n\/\/ ----------------------- string ---------------------\n\n\/\/ put the empty string itself in read-only memory\nchar const nul_byte = 0;\n\n\/\/ deliberately cast away the constness; I cannot declare\n\/\/ 'emptyString' to be const because it gets assigned to 's', but it\n\/\/ is nevertheless the intent that I never modify 'nul_byte'\nchar * const string::emptyString = const_cast<char*>(&nul_byte);\n\n\nstring::string(char const *src, int length, SmbaseStringFunc)\n{\n s=emptyString;\n setlength(length); \/\/ setlength already has the +1; sets final NUL\n memcpy(s, src, length);\n}\n\n\nvoid string::dup(char const *src)\n{\n \/\/ std::string does not accept NULL pointers\n xassert(src != NULL);\n\n if (src[0]==0) {\n s = emptyString;\n }\n else {\n s = new char[ strlen(src) + 1 ];\n xassert(s);\n strcpy(s, src);\n }\n}\n\nvoid string::kill()\n{\n if (s != emptyString) {\n delete[] s; \/\/ found by Coverity Prevent\n }\n}\n\n\nstring::string(Flatten&)\n : s(emptyString)\n{}\n\nvoid string::xfer(Flatten &flat)\n{\n flat.xferCharString(s);\n}\n\n\nint string::length() const\n{\n xassert(s);\n return strlen(s);\n}\n\nbool string::contains(char c) const\n{\n xassert(s);\n return !!strchr(s, c);\n}\n\n\nstring string::substring(int startIndex, int len) const\n{\n xassert(startIndex >= 0 &&\n len >= 0 &&\n startIndex + len <= length());\n\n return ::substring(s+startIndex, len);\n}\n\n\nstring &string::setlength(int length)\n{\n kill();\n if (length > 0) {\n s = new char[ length+1 ];\n xassert(s);\n s[length] = 0; \/\/ final NUL in expectation of 'length' chars\n s[0] = 0; \/\/ in case we just wanted to set allocated length\n }\n else {\n xassert(length == 0); \/\/ negative wouldn't make sense\n s = emptyString;\n }\n return *this;\n}\n\n\nint string::compareTo(string const &src) const\n{\n return compareTo(src.s);\n}\n\nint string::compareTo(char const *src) const\n{\n if (src == NULL) {\n src = emptyString;\n }\n return strcmp(s, src);\n}\n\n\nstring string::operator&(string const &tail) const\n{\n string dest(length() + tail.length(), SMBASE_STRING_FUNC);\n strcpy(dest.s, s);\n strcat(dest.s, tail.s);\n return dest;\n}\n\nstring& string::operator&=(string const &tail)\n{\n return *this = *this & tail;\n}\n\n\nvoid string::readdelim(istream &is, char const *delim)\n{\n stringBuilder sb;\n sb.readdelim(is, delim);\n operator= (sb);\n}\n\n\nvoid string::write(ostream &os) const\n{\n os << s; \/\/ standard char* writing routine\n}\n\n\nvoid string::selfCheck() const\n{ \n if (s != emptyString) {\n checkHeapNode(s);\n }\n}\n\n\n\/\/ ----------------------- rostring ---------------------\nint strcmp(rostring s1, rostring s2)\n { return strcmp(s1.c_str(), s2.c_str()); }\nint strcmp(rostring s1, char const *s2)\n { return strcmp(s1.c_str(), s2); }\nint strcmp(char const *s1, rostring s2)\n { return strcmp(s1, s2.c_str()); }\n\n\nchar const *strstr(rostring haystack, char const *needle)\n{\n return strstr(haystack.c_str(), needle);\n}\n\n\nint atoi(rostring s)\n{\n return atoi(toCStr(s));\n}\n\nstring substring(char const *p, int n)\n{\n return string(p, n, SMBASE_STRING_FUNC);\n}\n\n\n\/\/ --------------------- stringBuilder ------------------\nstringBuilder::stringBuilder(int len)\n{\n init(len);\n}\n\nvoid stringBuilder::init(int initSize)\n{\n size = initSize + EXTRA_SPACE + 1; \/\/ +1 to be like string::setlength\n s = new char[size];\n end = s;\n end[initSize] = 0;\n}\n\n\nvoid stringBuilder::dup(char const *str)\n{\n int len = strlen(str);\n init(len);\n strcpy(s, str);\n end += len;\n}\n\n\nstringBuilder::stringBuilder(char const *str)\n{\n dup(str);\n}\n\n\nstringBuilder::stringBuilder(char const *str, int len)\n{\n init(len);\n memcpy(s, str, len);\n end += len;\n}\n\n\nstringBuilder& stringBuilder::operator=(char const *src)\n{\n if (s != src) {\n kill();\n dup(src);\n }\n return *this;\n}\n\n\nstringBuilder& stringBuilder::setlength(int newlen)\n{\n kill();\n init(newlen);\n return *this;\n}\n\n\nvoid stringBuilder::adjustend(char* newend) \n{\n xassert(s <= newend && newend < s + size);\n\n end = newend;\n *end = 0; \/\/ sm 9\/29\/00: maintain invariant\n}\n\n\nvoid stringBuilder::truncate(int newLength)\n{\n xassert(0 <= newLength && newLength <= length());\n adjustend(s + newLength);\n}\n\n\nstringBuilder& stringBuilder::operator&= (char const *tail)\n{\n append(tail, strlen(tail));\n return *this;\n}\n\nvoid stringBuilder::append(char const *tail, int len)\n{\n ensure(length() + len);\n\n memcpy(end, tail, len);\n end += len;\n *end = 0;\n}\n\n\nstringBuilder& stringBuilder::indent(int amt)\n{\n xassert(amt >= 0);\n ensure(length() + amt);\n\n memset(end, ' ', amt);\n end += amt;\n *end = 0;\n \n return *this;\n}\n\n\nvoid stringBuilder::grow(int newMinLength)\n{\n \/\/ I want at least EXTRA_SPACE extra\n int newMinSize = newMinLength + EXTRA_SPACE + 1; \/\/ compute resulting allocated size\n\n \/\/ I want to grow at the rate of at least 50% each time\n int suggest = size * 3 \/ 2;\n\n \/\/ see which is bigger\n newMinSize = max(newMinSize, suggest);\n\n \/\/ remember old length..\n int len = length();\n\n \/\/ realloc s to be newMinSize bytes\n char *temp = new char[newMinSize];\n xassert(len+1 <= newMinSize); \/\/ prevent overrun\n memcpy(temp, s, len+1); \/\/ copy null too\n delete[] s;\n s = temp;\n\n \/\/ adjust other variables\n end = s + len;\n size = newMinSize;\n}\n\n\nstringBuilder& stringBuilder::operator<< (char c)\n{\n ensure(length() + 1);\n *(end++) = c;\n *end = 0;\n return *this;\n}\n\n\n#define MAKE_LSHIFT(Argtype, fmt) \\\n stringBuilder& stringBuilder::operator<< (Argtype arg) \\\n { \\\n char buf[60]; \/* big enough for all types *\/ \\\n int len = sprintf(buf, fmt, arg); \\\n if (len >= 60) {\t\t\t\t\t \\\n abort(); \/* too big *\/ \\\n } \\\n return *this << buf; \\\n }\n\nMAKE_LSHIFT(long, \"%ld\")\nMAKE_LSHIFT(unsigned long, \"%lu\")\nMAKE_LSHIFT(double, \"%g\")\nMAKE_LSHIFT(void*, \"%p\")\n\n#undef MAKE_LSHIFT\n\n\nstringBuilder& stringBuilder::operator<< (\n stringBuilder::Hex const &h)\n{\n char buf[32]; \/\/ should only need 19 for 64-bit word..\n int len = sprintf(buf, \"0x%lX\", h.value);\n if (len >= 20) {\n abort();\n }\n return *this << buf;\n\n \/\/ the length check above isn't perfect because we only find out there is\n \/\/ a problem *after* trashing the environment. it is for this reason I\n \/\/ use 'assert' instead of 'xassert' -- the former calls abort(), while the\n \/\/ latter throws an exception in anticipation of recoverability\n}\n\n\nstringBuilder& stringBuilder::operator<< (Manipulator manip)\n{\n return manip(*this);\n}\n\n\n\/\/ slow but reliable\nvoid stringBuilder::readdelim(istream &is, char const *delim)\n{\n char c;\n is.get(c);\n while (!is.eof() &&\n (!delim || !strchr(delim, c))) {\n *this << c;\n is.get(c);\n }\n}\n\n\n\/\/ ---------------------- toString ---------------------\n#define TOSTRING(type) \\\n string toString(type val) \\\n { \\\n return stringc << val; \\\n }\n\nTOSTRING(int)\nTOSTRING(unsigned)\nTOSTRING(char)\nTOSTRING(long)\nTOSTRING(float)\n\n#undef TOSTRING\n\n\/\/ this one is more liberal than 'stringc << null' because it gets\n\/\/ used by the PRINT_GENERIC macro in my astgen tool\nstring toString(char const *str)\n{\n if (!str) {\n return string(\"(null)\");\n }\n else {\n return string(str);\n }\n}\n\n\n\/\/ ------------------- stringf -----------------\nstring stringf(char const *format, ...)\n{\n va_list args;\n va_start(args, format);\n string ret = vstringf(format, args);\n va_end(args);\n return ret;\n}\n \n\n\/\/ this should eventually be put someplace more general...\n#ifndef va_copy\n #ifdef __va_copy\n #define va_copy(a,b) __va_copy(a,b)\n #else\n #define va_copy(a,b) (a)=(b)\n #endif\n#endif\n\n\nstring vstringf(char const *format, va_list args)\n{ \n \/\/ estimate string length\n va_list args2;\n va_copy(args2, args);\n int est = vnprintf(format, args2);\n va_end(args2);\n\n \/\/ allocate space\n Array<char> buf(est+1);\n\n \/\/ render the string\n int len = vsprintf(buf, format, args);\n\n \/\/ check the estimate, and fail *hard* if it was low, to avoid any\n \/\/ possibility that this might become exploitable in some context\n \/\/ (do *not* turn this check off in an NDEGUG build)\n if (len > est) {\n \/\/ don't go through fprintf, etc., because the state of memory\n \/\/ makes that risky\n static char const msg[] =\n \"fatal error: vnprintf failed to provide a conservative estimate,\\n\"\n \"memory is most likely corrupted\\n\";\n write(2 \/*stderr*\/, msg, strlen(msg));\n abort();\n }\n\n \/\/ happy\n return string(buf);\n}\n\n\n\/\/ ------------------ test code --------------------\n#ifdef TEST_STR\n\n#include <iostream.h> \/\/ cout\n\nvoid test(unsigned long val)\n{\n \/\/cout << stringb(val << \" in hex: 0x\" << stringBuilder::Hex(val)) << endl;\n\n cout << stringb(val << \" in hex: \" << SBHex(val)) << endl;\n}\n\nint main()\n{\n \/\/ for the moment I just want to test the hex formatting\n test(64);\n test(0xFFFFFFFF);\n test(0);\n test((unsigned long)(-1));\n test(1);\n\n cout << \"stringf: \" << stringf(\"int=%d hex=%X str=%s char=%c float=%f\",\n 5, 0xAA, \"hi\", 'f', 3.4) << endl; \n\n cout << \"tests passed\\n\";\n\n return 0;\n}\n\n#endif \/\/ TEST_STR\n<commit_msg>Optimize stringBuilder::operator=: don't re-allocate buffer unless necessary.<commit_after>\/\/ str.cpp see license.txt for copyright and terms of use\n\/\/ code for str.h\n\/\/ Scott McPeak, 1995-2000 This file is public domain.\n\n#include \"str.h\" \/\/ this module\n\n#include <stdlib.h> \/\/ atoi\n#include <stdio.h> \/\/ sprintf\n#include <ctype.h> \/\/ isspace\n#include <string.h> \/\/ strcmp\n#include <iostream.h> \/\/ ostream << char*\n#include <assert.h> \/\/ assert\n#include <unistd.h> \/\/ write\n\n#include \"xassert.h\" \/\/ xassert\n#include \"ckheap.h\" \/\/ checkHeapNode\n#include \"flatten.h\" \/\/ Flatten\n#include \"nonport.h\" \/\/ vnprintf\n#include \"array.h\" \/\/ Array\n\n\n\/\/ ----------------------- string ---------------------\n\n\/\/ put the empty string itself in read-only memory\nchar const nul_byte = 0;\n\n\/\/ deliberately cast away the constness; I cannot declare\n\/\/ 'emptyString' to be const because it gets assigned to 's', but it\n\/\/ is nevertheless the intent that I never modify 'nul_byte'\nchar * const string::emptyString = const_cast<char*>(&nul_byte);\n\n\nstring::string(char const *src, int length, SmbaseStringFunc)\n{\n s=emptyString;\n setlength(length); \/\/ setlength already has the +1; sets final NUL\n memcpy(s, src, length);\n}\n\n\nvoid string::dup(char const *src)\n{\n \/\/ std::string does not accept NULL pointers\n xassert(src != NULL);\n\n if (src[0]==0) {\n s = emptyString;\n }\n else {\n s = new char[ strlen(src) + 1 ];\n xassert(s);\n strcpy(s, src);\n }\n}\n\nvoid string::kill()\n{\n if (s != emptyString) {\n delete[] s; \/\/ found by Coverity Prevent\n }\n}\n\n\nstring::string(Flatten&)\n : s(emptyString)\n{}\n\nvoid string::xfer(Flatten &flat)\n{\n flat.xferCharString(s);\n}\n\n\nint string::length() const\n{\n xassert(s);\n return strlen(s);\n}\n\nbool string::contains(char c) const\n{\n xassert(s);\n return !!strchr(s, c);\n}\n\n\nstring string::substring(int startIndex, int len) const\n{\n xassert(startIndex >= 0 &&\n len >= 0 &&\n startIndex + len <= length());\n\n return ::substring(s+startIndex, len);\n}\n\n\nstring &string::setlength(int length)\n{\n kill();\n if (length > 0) {\n s = new char[ length+1 ];\n xassert(s);\n s[length] = 0; \/\/ final NUL in expectation of 'length' chars\n s[0] = 0; \/\/ in case we just wanted to set allocated length\n }\n else {\n xassert(length == 0); \/\/ negative wouldn't make sense\n s = emptyString;\n }\n return *this;\n}\n\n\nint string::compareTo(string const &src) const\n{\n return compareTo(src.s);\n}\n\nint string::compareTo(char const *src) const\n{\n if (src == NULL) {\n src = emptyString;\n }\n return strcmp(s, src);\n}\n\n\nstring string::operator&(string const &tail) const\n{\n string dest(length() + tail.length(), SMBASE_STRING_FUNC);\n strcpy(dest.s, s);\n strcat(dest.s, tail.s);\n return dest;\n}\n\nstring& string::operator&=(string const &tail)\n{\n return *this = *this & tail;\n}\n\n\nvoid string::readdelim(istream &is, char const *delim)\n{\n stringBuilder sb;\n sb.readdelim(is, delim);\n operator= (sb);\n}\n\n\nvoid string::write(ostream &os) const\n{\n os << s; \/\/ standard char* writing routine\n}\n\n\nvoid string::selfCheck() const\n{\n if (s != emptyString) {\n checkHeapNode(s);\n }\n}\n\n\n\/\/ ----------------------- rostring ---------------------\nint strcmp(rostring s1, rostring s2)\n { return strcmp(s1.c_str(), s2.c_str()); }\nint strcmp(rostring s1, char const *s2)\n { return strcmp(s1.c_str(), s2); }\nint strcmp(char const *s1, rostring s2)\n { return strcmp(s1, s2.c_str()); }\n\n\nchar const *strstr(rostring haystack, char const *needle)\n{\n return strstr(haystack.c_str(), needle);\n}\n\n\nint atoi(rostring s)\n{\n return atoi(toCStr(s));\n}\n\nstring substring(char const *p, int n)\n{\n return string(p, n, SMBASE_STRING_FUNC);\n}\n\n\n\/\/ --------------------- stringBuilder ------------------\nstringBuilder::stringBuilder(int len)\n{\n init(len);\n}\n\nvoid stringBuilder::init(int initSize)\n{\n size = initSize + EXTRA_SPACE + 1; \/\/ +1 to be like string::setlength\n s = new char[size];\n end = s;\n end[initSize] = 0;\n}\n\n\nvoid stringBuilder::dup(char const *str)\n{\n int len = strlen(str);\n init(len);\n strcpy(s, str);\n end += len;\n}\n\n\nstringBuilder::stringBuilder(char const *str)\n{\n dup(str);\n}\n\n\nstringBuilder::stringBuilder(char const *str, int len)\n{\n init(len);\n memcpy(s, str, len);\n end += len;\n}\n\n\nstringBuilder& stringBuilder::operator=(char const *src)\n{\n#if 1\n \/\/ quarl 2006-06-01\n \/\/ This implementation avoids re-allocation unless necessary.\n if (s != src) {\n int srclen = strlen(src)+1;\n if (srclen > size) { \/\/ need to re-allocate?\n delete s;\n s = new char[ srclen ];\n }\n xassert(s);\n memcpy(s, src, srclen); \/\/ copy string including NULL\n end = s + srclen - 1; \/\/ point to NULL\n }\n return *this;\n#else\n if (s != src) {\n kill();\n dup(src);\n }\n return *this;\n#endif\n}\n\n\nstringBuilder& stringBuilder::setlength(int newlen)\n{\n kill();\n init(newlen);\n return *this;\n}\n\n\nvoid stringBuilder::adjustend(char* newend)\n{\n xassert(s <= newend && newend < s + size);\n\n end = newend;\n *end = 0; \/\/ sm 9\/29\/00: maintain invariant\n}\n\n\nvoid stringBuilder::truncate(int newLength)\n{\n xassert(0 <= newLength && newLength <= length());\n adjustend(s + newLength);\n}\n\n\nstringBuilder& stringBuilder::operator&= (char const *tail)\n{\n append(tail, strlen(tail));\n return *this;\n}\n\nvoid stringBuilder::append(char const *tail, int len)\n{\n ensure(length() + len);\n\n memcpy(end, tail, len);\n end += len;\n *end = 0;\n}\n\n\nstringBuilder& stringBuilder::indent(int amt)\n{\n xassert(amt >= 0);\n ensure(length() + amt);\n\n memset(end, ' ', amt);\n end += amt;\n *end = 0;\n\n return *this;\n}\n\n\nvoid stringBuilder::grow(int newMinLength)\n{\n \/\/ I want at least EXTRA_SPACE extra\n int newMinSize = newMinLength + EXTRA_SPACE + 1; \/\/ compute resulting allocated size\n\n \/\/ I want to grow at the rate of at least 50% each time\n int suggest = size * 3 \/ 2;\n\n \/\/ see which is bigger\n newMinSize = max(newMinSize, suggest);\n\n \/\/ remember old length..\n int len = length();\n\n \/\/ realloc s to be newMinSize bytes\n char *temp = new char[newMinSize];\n xassert(len+1 <= newMinSize); \/\/ prevent overrun\n memcpy(temp, s, len+1); \/\/ copy null too\n delete[] s;\n s = temp;\n\n \/\/ adjust other variables\n end = s + len;\n size = newMinSize;\n}\n\n\nstringBuilder& stringBuilder::operator<< (char c)\n{\n ensure(length() + 1);\n *(end++) = c;\n *end = 0;\n return *this;\n}\n\n\n#define MAKE_LSHIFT(Argtype, fmt) \\\n stringBuilder& stringBuilder::operator<< (Argtype arg) \\\n { \\\n char buf[60]; \/* big enough for all types *\/ \\\n int len = sprintf(buf, fmt, arg); \\\n if (len >= 60) {\t\t\t\t\t \\\n abort(); \/* too big *\/ \\\n } \\\n return *this << buf; \\\n }\n\nMAKE_LSHIFT(long, \"%ld\")\nMAKE_LSHIFT(unsigned long, \"%lu\")\nMAKE_LSHIFT(double, \"%g\")\nMAKE_LSHIFT(void*, \"%p\")\n\n#undef MAKE_LSHIFT\n\n\nstringBuilder& stringBuilder::operator<< (\n stringBuilder::Hex const &h)\n{\n char buf[32]; \/\/ should only need 19 for 64-bit word..\n int len = sprintf(buf, \"0x%lX\", h.value);\n if (len >= 20) {\n abort();\n }\n return *this << buf;\n\n \/\/ the length check above isn't perfect because we only find out there is\n \/\/ a problem *after* trashing the environment. it is for this reason I\n \/\/ use 'assert' instead of 'xassert' -- the former calls abort(), while the\n \/\/ latter throws an exception in anticipation of recoverability\n}\n\n\nstringBuilder& stringBuilder::operator<< (Manipulator manip)\n{\n return manip(*this);\n}\n\n\n\/\/ slow but reliable\nvoid stringBuilder::readdelim(istream &is, char const *delim)\n{\n char c;\n is.get(c);\n while (!is.eof() &&\n (!delim || !strchr(delim, c))) {\n *this << c;\n is.get(c);\n }\n}\n\n\n\/\/ ---------------------- toString ---------------------\n#define TOSTRING(type) \\\n string toString(type val) \\\n { \\\n return stringc << val; \\\n }\n\nTOSTRING(int)\nTOSTRING(unsigned)\nTOSTRING(char)\nTOSTRING(long)\nTOSTRING(float)\n\n#undef TOSTRING\n\n\/\/ this one is more liberal than 'stringc << null' because it gets\n\/\/ used by the PRINT_GENERIC macro in my astgen tool\nstring toString(char const *str)\n{\n if (!str) {\n return string(\"(null)\");\n }\n else {\n return string(str);\n }\n}\n\n\n\/\/ ------------------- stringf -----------------\nstring stringf(char const *format, ...)\n{\n va_list args;\n va_start(args, format);\n string ret = vstringf(format, args);\n va_end(args);\n return ret;\n}\n\n\n\/\/ this should eventually be put someplace more general...\n#ifndef va_copy\n #ifdef __va_copy\n #define va_copy(a,b) __va_copy(a,b)\n #else\n #define va_copy(a,b) (a)=(b)\n #endif\n#endif\n\n\nstring vstringf(char const *format, va_list args)\n{\n \/\/ estimate string length\n va_list args2;\n va_copy(args2, args);\n int est = vnprintf(format, args2);\n va_end(args2);\n\n \/\/ allocate space\n Array<char> buf(est+1);\n\n \/\/ render the string\n int len = vsprintf(buf, format, args);\n\n \/\/ check the estimate, and fail *hard* if it was low, to avoid any\n \/\/ possibility that this might become exploitable in some context\n \/\/ (do *not* turn this check off in an NDEGUG build)\n if (len > est) {\n \/\/ don't go through fprintf, etc., because the state of memory\n \/\/ makes that risky\n static char const msg[] =\n \"fatal error: vnprintf failed to provide a conservative estimate,\\n\"\n \"memory is most likely corrupted\\n\";\n write(2 \/*stderr*\/, msg, strlen(msg));\n abort();\n }\n\n \/\/ happy\n return string(buf);\n}\n\n\n\/\/ ------------------ test code --------------------\n#ifdef TEST_STR\n\n#include <iostream.h> \/\/ cout\n\nvoid test(unsigned long val)\n{\n \/\/cout << stringb(val << \" in hex: 0x\" << stringBuilder::Hex(val)) << endl;\n\n cout << stringb(val << \" in hex: \" << SBHex(val)) << endl;\n}\n\nint main()\n{\n \/\/ for the moment I just want to test the hex formatting\n test(64);\n test(0xFFFFFFFF);\n test(0);\n test((unsigned long)(-1));\n test(1);\n\n cout << \"stringf: \" << stringf(\"int=%d hex=%X str=%s char=%c float=%f\",\n 5, 0xAA, \"hi\", 'f', 3.4) << endl;\n\n cout << \"tests passed\\n\";\n\n return 0;\n}\n\n#endif \/\/ TEST_STR\n<|endoftext|>"} {"text":"<commit_before>\/\/! @Alan\n\/\/!\n\/\/! Exercise 11.9:\n\/\/! Define a map that associates words with a list of\n\/\/! line numbers on which the word might occur.\n\/\/!\n\/\/! Exercise 11.10:\n\/\/! Could we define a map from vector<int>::iterator\n\/\/! to int? What about from list<int>::iterator to int?\n\/\/! In each case, if not, why not?\n\/\/ vector<int>::iterator to int is ok ,because < is defined\n\/\/ vector<int>::iterator to int is not ok,as no < is defined.\n#include <iostream>\n#include <map>\n#include <string>\n#include <algorithm>\n#include <list>\n\nint main()\n{\n \/\/! ex 11.9\n std::map<std::string, std::list<std::size_t>> m;\n\n \/\/! ex 11.10\n \/\/! can be declared.\n std::map<std::vector<int>::iterator, int> mv;\n std::map<std::list<int>::iterator, int> ml;\n\n\n std::vector<int> vi;\n mv.insert(std::pair<std::vector<int>::iterator, int>(vi.begin(),0));\n\n \/\/! but when using this one the compiler complained that\n \/\/! error: no match for 'operator<' in '__x < __y'\n std::list<int> li;\n ml.insert(std::pair<std::list<int>::iterator,int>(li.begin(),0));\n\n return 0;\n}\n\n\n<commit_msg>fix error<commit_after>\/\/! @Alan\n\/\/!\n\/\/! Exercise 11.9:\n\/\/! Define a map that associates words with a list of\n\/\/! line numbers on which the word might occur.\n\/\/!\n\/\/! Exercise 11.10:\n\/\/! Could we define a map from vector<int>::iterator\n\/\/! to int? What about from list<int>::iterator to int?\n\/\/! In each case, if not, why not?\n\/\/ vector<int>::iterator to int is ok ,because < is defined\n\/\/ list<int>::iterator to int is not ok,as no < is defined.\n#include <iostream>\n#include <map>\n#include <string>\n#include <algorithm>\n#include <list>\n\nint main()\n{\n \/\/! ex 11.9\n std::map<std::string, std::list<std::size_t>> m;\n\n \/\/! ex 11.10\n \/\/! can be declared.\n std::map<std::vector<int>::iterator, int> mv;\n std::map<std::list<int>::iterator, int> ml;\n\n\n std::vector<int> vi;\n mv.insert(std::pair<std::vector<int>::iterator, int>(vi.begin(),0));\n\n \/\/! but when using this one the compiler complained that\n \/\/! error: no match for 'operator<' in '__x < __y'\n std::list<int> li;\n ml.insert(std::pair<std::list<int>::iterator,int>(li.begin(),0));\n\n return 0;\n}\n\n\n<|endoftext|>"} {"text":"<commit_before>\/\/\n\/\/ ogles_gpgpu project - GPGPU for mobile devices and embedded systems using OpenGL ES 2.0\n\/\/\n\/\/ Author: Markus Konrad <post@mkonrad.net>, Winter 2014\/2015\n\/\/ http:\/\/www.mkonrad.net\n\/\/\n\/\/ See LICENSE file in project repository root for the license.\n\/\/\n\n#include \"..\/common_includes.h\"\n#include \"grad.h\"\n\nusing namespace std;\nusing namespace ogles_gpgpu;\n\nconst char *GradProc::fshaderGradSrc = OG_TO_STR\n(\n#if defined(OGLES_GPGPU_OPENGLES)\nprecision highp float;\n#endif\n \n varying vec2 textureCoordinate;\n varying vec2 leftTextureCoordinate;\n varying vec2 rightTextureCoordinate;\n \n varying vec2 topTextureCoordinate;\n varying vec2 topLeftTextureCoordinate;\n varying vec2 topRightTextureCoordinate;\n \n varying vec2 bottomTextureCoordinate;\n varying vec2 bottomLeftTextureCoordinate;\n varying vec2 bottomRightTextureCoordinate;\n \n uniform sampler2D inputImageTexture;\n \n uniform float strength;\n \n void main()\n {\n float bottomLeftIntensity = texture2D(inputImageTexture, bottomLeftTextureCoordinate).r;\n float topRightIntensity = texture2D(inputImageTexture, topRightTextureCoordinate).r;\n float topLeftIntensity = texture2D(inputImageTexture, topLeftTextureCoordinate).r;\n float bottomRightIntensity = texture2D(inputImageTexture, bottomRightTextureCoordinate).r;\n float leftIntensity = texture2D(inputImageTexture, leftTextureCoordinate).r;\n float rightIntensity = texture2D(inputImageTexture, rightTextureCoordinate).r;\n float bottomIntensity = texture2D(inputImageTexture, bottomTextureCoordinate).r;\n float topIntensity = texture2D(inputImageTexture, topTextureCoordinate).r;\n float y = -topLeftIntensity - (2.0 * topIntensity) - topRightIntensity + bottomLeftIntensity + (2.0 * bottomIntensity) + bottomRightIntensity;\n float x = -bottomLeftIntensity - (2.0 * leftIntensity) - topLeftIntensity + bottomRightIntensity + (2.0 * rightIntensity) + topRightIntensity;\n \n y = y \/ 8.0;\n x = x \/ 8.0;\n \n \/\/y = (bottomIntensity - topIntensity) \/ 2.0;\n \/\/x = (rightIntensity - leftIntensity) \/ 2.0;\n \n float mag = length(vec2(x, y));\n float theta = atan(y, x);\n if(theta < 0.0)\n {\n theta = theta + 3.14159;\n }\n \n float dx = (x + 1.0) \/ 2.0;\n float dy = (y + 1.0) \/ 2.0;\n \n mag = clamp(mag * strength, 0.0, 1.0);\n \n \/\/gl_FragColor = vec4(mag, mag, mag, 1.0);\n \/\/gl_FragColor = vec4(bottomLeftIntensity,bottomLeftIntensity,bottomLeftIntensity,1.0);\n gl_FragColor = vec4(mag, theta\/3.14159, clamp(dx, 0.0, 1.0), clamp(dy, 0.0, 1.0));\n }\n );\n\nGradProc::GradProc(float strength) : strength(strength) {\n\n}\n\nvoid GradProc::setUniforms() {\n Filter3x3Proc::setUniforms();\n glUniform1f(shParamUStrength, strength);\n}\n\nvoid GradProc::getUniforms() {\n Filter3x3Proc::getUniforms();\n shParamUInputTex = shader->getParam(UNIF, \"inputImageTexture\");\n shParamUStrength = shader->getParam(UNIF, \"strength\");\n}\n<commit_msg>added pi constant; don't clamp the magnitude in the output texture<commit_after>\/\/\n\/\/ ogles_gpgpu project - GPGPU for mobile devices and embedded systems using OpenGL ES 2.0\n\/\/\n\/\/ Author: Markus Konrad <post@mkonrad.net>, Winter 2014\/2015\n\/\/ http:\/\/www.mkonrad.net\n\/\/\n\/\/ See LICENSE file in project repository root for the license.\n\/\/\n\n#include \"..\/common_includes.h\"\n#include \"grad.h\"\n\nusing namespace std;\nusing namespace ogles_gpgpu;\n\nconst char *GradProc::fshaderGradSrc = OG_TO_STR\n(\n#if defined(OGLES_GPGPU_OPENGLES)\nprecision highp float;\n#endif\n \n varying vec2 textureCoordinate;\n varying vec2 leftTextureCoordinate;\n varying vec2 rightTextureCoordinate;\n \n varying vec2 topTextureCoordinate;\n varying vec2 topLeftTextureCoordinate;\n varying vec2 topRightTextureCoordinate;\n \n varying vec2 bottomTextureCoordinate;\n varying vec2 bottomLeftTextureCoordinate;\n varying vec2 bottomRightTextureCoordinate;\n \n uniform sampler2D inputImageTexture;\n \n uniform float strength;\n \n const float pi = 3.14159265359;\n \n void main()\n {\n float bottomLeftIntensity = texture2D(inputImageTexture, bottomLeftTextureCoordinate).r;\n float topRightIntensity = texture2D(inputImageTexture, topRightTextureCoordinate).r;\n float topLeftIntensity = texture2D(inputImageTexture, topLeftTextureCoordinate).r;\n float bottomRightIntensity = texture2D(inputImageTexture, bottomRightTextureCoordinate).r;\n float leftIntensity = texture2D(inputImageTexture, leftTextureCoordinate).r;\n float rightIntensity = texture2D(inputImageTexture, rightTextureCoordinate).r;\n float bottomIntensity = texture2D(inputImageTexture, bottomTextureCoordinate).r;\n float topIntensity = texture2D(inputImageTexture, topTextureCoordinate).r;\n float y = -topLeftIntensity - (2.0 * topIntensity) - topRightIntensity + bottomLeftIntensity + (2.0 * bottomIntensity) + bottomRightIntensity;\n float x = -bottomLeftIntensity - (2.0 * leftIntensity) - topLeftIntensity + bottomRightIntensity + (2.0 * rightIntensity) + topRightIntensity;\n \n y = y \/ 8.0;\n x = x \/ 8.0;\n \n \/\/y = (bottomIntensity - topIntensity) \/ 2.0;\n \/\/x = (rightIntensity - leftIntensity) \/ 2.0;\n \n float mag = length(vec2(x, y));\n float theta = atan(y, x);\n if(theta < 0.0)\n {\n theta = theta + pi;\n }\n \n float dx = (x + 1.0) \/ 2.0;\n float dy = (y + 1.0) \/ 2.0;\n \n \/\/gl_FragColor = vec4(mag, mag, mag, 1.0);\n \/\/gl_FragColor = vec4(bottomLeftIntensity,bottomLeftIntensity,bottomLeftIntensity,1.0);\n gl_FragColor = vec4(mag, clamp(theta\/pi, 0.0, 1.0), clamp(dx, 0.0, 1.0), clamp(dy, 0.0, 1.0));\n }\n );\n\nGradProc::GradProc(float strength) : strength(strength) {\n\n}\n\nvoid GradProc::setUniforms() {\n Filter3x3Proc::setUniforms();\n glUniform1f(shParamUStrength, strength);\n}\n\nvoid GradProc::getUniforms() {\n Filter3x3Proc::getUniforms();\n shParamUInputTex = shader->getParam(UNIF, \"inputImageTexture\");\n shParamUStrength = shader->getParam(UNIF, \"strength\");\n}\n<|endoftext|>"} {"text":"<commit_before>\/*\n * This file is part of the KDE libraries\n * Copyright (C) 2003 Benjamin C Meyer (ben+kdelibs at meyerhome dot net)\n *\n * This library is free software; you can redistribute it and\/or\n * modify it under the terms of the GNU Library General Public\n * License as published by the Free Software Foundation; either\n * version 2 of the License, or (at your option) any later version.\n *\n * This library is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU\n * Library General Public License for more details.\n *\n * You should have received a copy of the GNU Library General Public License\n * along with this library; see the file COPYING.LIB. If not, write to\n * the Free Software Foundation, Inc., 59 Temple Place - Suite 330,\n * Boston, MA 02111-1307, USA.\n *\/\n#include \"kautoconfig.h\"\n\n#include <kglobal.h>\n#include <qsqlpropertymap.h>\n#include <qobjectlist.h>\n#include <kconfig.h>\n#include <kapplication.h>\n\n\/**\n * Macro function to warn developers when they are making calls\n * that can never return anything of value\n *\/ \n#ifndef NDEBUG\n#include \"kdebug.h\"\n#define functionCallOrderCheck(functionName, returnValue) \\\n if(!d->retrievedSettings){ \\\n kdDebug(180) << \"KAutoConfig::\"functionName\"() was called before \" \\\n \"KAutoConfig::retrieveSettings(). This should NEVER happen. \" \\\n \"Please Fix.\" << endl; \\\n return returnValue; \\\n }\n#else\n#define functionCallOrderCheck(functionName, returnValue)\n#endif\n\nclass KAutoConfig::KAutoConfigPrivate {\n\npublic:\n KAutoConfigPrivate() : changed(false)\n#ifndef NDEBUG\n , retrievedSettings(false)\n#endif\n { init(); }\n\n \/\/ Widgets to parse\n QPtrList<QWidget> widgets;\n \/\/ Name of the group that KConfig should be set to for each widget.\n QMap<QWidget*, QString> groups;\n\n \/\/ Child widgets of widgets to ignore\n QPtrList<QWidget> ignore;\n\n \/\/ Reset to false after saveSettings returns true.\n bool changed;\n\n#ifndef NDEBUG\n \/\/ Many functions require this to be true to be of any value.\n bool retrievedSettings;\n#endif\n\n \/\/ Known widgets that can be configured\n QMap<QWidget*, QPtrList<QWidget> > autoWidgets;\n \/\/ Default values for the widgets.\n QMap<QWidget*, QVariant> defaultValues;\n \/\/ Widgets to not get properties on (QLabel etc)\n QAsciiDict<int> ignoreTheseWidgets;\n\n void init(){\n ignoreTheseWidgets.insert(\"QLabel\", new int(1));\n ignoreTheseWidgets.insert(\"QFrame\", new int(2));\n ignoreTheseWidgets.insert(\"QGroupBox\", new int(3));\n ignoreTheseWidgets.insert(\"QButtonGroup\", new int(4));\n ignoreTheseWidgets.insert(\"QWidget\", new int(5));\n ignoreTheseWidgets.setAutoDelete(true);\n\n static bool defaultKDEPropertyMapInstalled = false;\n if ( !defaultKDEPropertyMapInstalled && kapp ) {\n kapp->installKDEPropertyMap();\n defaultKDEPropertyMapInstalled = true;\n }\n }\n};\n\nKAutoConfig::KAutoConfig(KConfig *kconfig, QObject *parent,\n const char *name) : QObject(parent, name), config(kconfig) {\n d = new KAutoConfigPrivate();\n}\n\nKAutoConfig::KAutoConfig(QObject *parent, const char *name) :\n QObject(parent, name), config(KGlobal::config()) {\n d = new KAutoConfigPrivate();\n}\n\nKAutoConfig::~KAutoConfig(){\n delete d;\n}\n\nvoid KAutoConfig::addWidget(QWidget *widget, const QString &group){\n d->groups.insert(widget, group);\n d->widgets.append(widget);\n QPtrList<QWidget> newAutoConfigWidget;\n d->autoWidgets.insert(widget, newAutoConfigWidget );\n}\n\nvoid KAutoConfig::ignoreSubWidget(QWidget *widget){\n d->ignore.append(widget);\n}\n\nbool KAutoConfig::retrieveSettings(bool trackChanges){\n#ifndef NDEBUG\n if(d->retrievedSettings){\n kdDebug(180) << \"This should not happen. Function \"\n \"KAutoConfig::retrieveSettings() was called more then once, returning \"\n \"false. Please fix.\" << endl;\n return false;\n }\n d->retrievedSettings = true;\n#endif\n \n if(trackChanges){\n \/\/ QT\n changedMap.insert(\"QButton\", SIGNAL(stateChanged(int)));\n changedMap.insert(\"QCheckBox\", SIGNAL(stateChanged(int)));\n changedMap.insert(\"QPushButton\", SIGNAL(stateChanged(int)));\n changedMap.insert(\"QRadioButton\", SIGNAL(stateChanged(int)));\n changedMap.insert(\"QComboBox\", SIGNAL(activated (int)));\n \/\/qsqlproperty map doesn't store the text, but the value!\n \/\/changedMap.insert(\"QComboBox\", SIGNAL(textChanged(const QString &)));\n changedMap.insert(\"QDateEdit\", SIGNAL(valueChanged(const QDate &)));\n changedMap.insert(\"QDateTimeEdit\", SIGNAL(valueChanged(const QDateTime &)));\n changedMap.insert(\"QDial\", SIGNAL(valueChanged (int)));\n changedMap.insert(\"QLineEdit\", SIGNAL(textChanged(const QString &)));\n changedMap.insert(\"QSlider\", SIGNAL(valueChanged(int)));\n changedMap.insert(\"QSpinBox\", SIGNAL(valueChanged(int)));\n changedMap.insert(\"QTimeEdit\", SIGNAL(valueChanged(const QTime &)));\n changedMap.insert(\"QTextEdit\", SIGNAL(textChanged()));\n changedMap.insert(\"QTextBrowser\", SIGNAL(sourceChanged(const QString &)));\n changedMap.insert(\"QMultiLineEdit\", SIGNAL(textChanged()));\n changedMap.insert(\"QListBox\", SIGNAL(selectionChanged()));\n changedMap.insert(\"QTabWidget\", SIGNAL(currentChanged(QWidget *)));\n\n \/\/ KDE\n changedMap.insert( \"KComboBox\", SIGNAL(activated (int)));\n changedMap.insert( \"KFontCombo\", SIGNAL(activated (int)));\n changedMap.insert( \"KFontRequester\", SIGNAL(fontSelected(const QFont &)));\n changedMap.insert( \"KFontChooser\", SIGNAL(fontSelected(const QFont &)));\n changedMap.insert( \"KHistoryCombo\", SIGNAL(activated (int)));\n\n changedMap.insert( \"KColorButton\", SIGNAL(changed(const QColor &)));\n changedMap.insert( \"KDatePicker\", SIGNAL(dateSelected (QDate)));\n changedMap.insert( \"KEditListBox\", SIGNAL(changed()));\n changedMap.insert( \"KListBox\", SIGNAL(selectionChanged()));\n changedMap.insert( \"KLineEdit\", SIGNAL(textChanged(const QString &)));\n changedMap.insert( \"KPasswordEdit\", SIGNAL(textChanged(const QString &)));\n changedMap.insert( \"KRestrictedLine\", SIGNAL(textChanged(const QString &)));\n changedMap.insert( \"KTextBrowser\", SIGNAL(sourceChanged(const QString &)));\n changedMap.insert( \"KTextEdit\", SIGNAL(textChanged()));\n changedMap.insert( \"KURLRequester\", SIGNAL(textChanged (const QString& )));\n changedMap.insert( \"KIntNumInput\", SIGNAL(valueChanged (int)));\n changedMap.insert( \"KIntSpinBox\", SIGNAL(valueChanged (int)));\n changedMap.insert( \"KDoubleNumInput\", SIGNAL(valueChanged (double)));\n }\n\n \/\/ Go through all of the children of the widgets and find all known widgets\n QPtrListIterator<QWidget> it( d->widgets );\n QWidget *widget;\n bool usingDefaultValues = false;\n while ( (widget = it.current()) != 0 ) {\n ++it;\n config->setGroup(d->groups[widget]);\n usingDefaultValues |= parseChildren(widget, d->autoWidgets[widget], trackChanges);\n }\n return usingDefaultValues;\n}\n\nbool KAutoConfig::saveSettings() {\n functionCallOrderCheck(\"saveSettings\", false);\n\n QSqlPropertyMap *propertyMap = QSqlPropertyMap::defaultMap();\n \/\/ Go through all of the widgets\n QPtrListIterator<QWidget> it( d->widgets );\n QWidget *widget;\n while ( (widget = it.current()) != 0 ) {\n ++it;\n config->setGroup(d->groups[widget]);\n\n \/\/ Go through the known autowidgets of this widget and save\n QPtrListIterator<QWidget> it( d->autoWidgets[widget] );\n QWidget *groupWidget;\n bool widgetChanged = false;\n while ( (groupWidget = it.current()) != 0 ){\n ++it;\n QVariant defaultValue = d->defaultValues[groupWidget];\n QVariant currentValue = propertyMap->property(groupWidget);\n\n if(!config->hasDefault(groupWidget->name()) && currentValue == defaultValue){\n config->revertToDefault(groupWidget->name());\n widgetChanged = true;\n }\n else{\n QVariant savedValue = config->readPropertyEntry(groupWidget->name(),\n defaultValue);\n if(savedValue != currentValue){\n config->writeEntry(groupWidget->name(), currentValue);\n widgetChanged = true;\n }\n }\n }\n d->changed |= widgetChanged;\n if(widgetChanged)\n emit( settingsChanged(widget) );\n }\n\n if(d->changed){\n emit( settingsChanged() );\n d->changed = false;\n config->sync();\n return true;\n }\n return false;\n}\n\nbool KAutoConfig::hasChanged() const {\n functionCallOrderCheck(\"hasChanged\", false);\n\n QSqlPropertyMap *propertyMap = QSqlPropertyMap::defaultMap();\n \/\/ Go through all of the widgets\n QPtrListIterator<QWidget> it( d->widgets );\n QWidget *widget;\n while ( (widget = it.current()) != 0 ) {\n ++it;\n config->setGroup(d->groups[widget]);\n \/\/ Go through the known autowidgets of this widget and save\n QPtrListIterator<QWidget> it( d->autoWidgets[widget] );\n QWidget *groupWidget;\n while ( (groupWidget = it.current()) != 0 ){\n ++it;\n QVariant defaultValue = d->defaultValues[groupWidget];\n QVariant currentValue = propertyMap->property(groupWidget);\n QVariant savedValue = config->readPropertyEntry(groupWidget->name(),\n defaultValue);\n\n \/\/ Return once just one item is found to have changed.\n if((currentValue == defaultValue && savedValue != currentValue) ||\n (savedValue != currentValue))\n return true;\n }\n }\n return false;\n}\n\nbool KAutoConfig::isDefault() const {\n functionCallOrderCheck(\"isDefault\", false);\n\n QSqlPropertyMap *propertyMap = QSqlPropertyMap::defaultMap();\n \/\/ Go through all of the widgets\n QPtrListIterator<QWidget> it( d->widgets );\n QWidget *widget;\n while ( (widget = it.current()) != 0 ) {\n ++it;\n config->setGroup(d->groups[widget]);\n \/\/ Go through the known autowidgets of this widget and save\n QPtrListIterator<QWidget> it( d->autoWidgets[widget] );\n QWidget *groupWidget;\n while ( (groupWidget = it.current()) != 0 ){\n ++it;\n QVariant defaultValue = d->defaultValues[groupWidget];\n QVariant currentValue = propertyMap->property(groupWidget);\n if(currentValue != defaultValue){\n \/\/qDebug(\"groupWidget %s, has changed: default: %s new: %s\", groupWidget->name(), defaultValue.toString().latin1(), currentValue.toString().latin1());\n return false;\n }\n }\n }\n return true;\n}\n\nvoid KAutoConfig::resetSettings() const {\n functionCallOrderCheck(\"resetSettings\",);\n\n QSqlPropertyMap *propertyMap = QSqlPropertyMap::defaultMap();\n \/\/ Go through all of the widgets\n QPtrListIterator<QWidget> it( d->widgets );\n QWidget *widget;\n while ( (widget = it.current()) != 0 ) {\n ++it;\n config->setGroup(d->groups[widget]);\n\n \/\/ Go through the known autowidgets of this widget and save\n QPtrListIterator<QWidget> it( d->autoWidgets[widget] );\n QWidget *groupWidget;\n while ( (groupWidget = it.current()) != 0 ){\n ++it;\n QVariant defaultValue = d->defaultValues[groupWidget];\n if(defaultValue != propertyMap->property(groupWidget)){\n propertyMap->setProperty(groupWidget, defaultValue);\n d->changed = true;\n }\n }\n }\n}\n\nvoid KAutoConfig::reloadSettings() const {\n functionCallOrderCheck(\"reloadSettings\", );\n\n QSqlPropertyMap *propertyMap = QSqlPropertyMap::defaultMap();\n \/\/ Go through all of the widgets\n QPtrListIterator<QWidget> it( d->widgets );\n QWidget *pageWidget;\n while ( (pageWidget = it.current()) != 0 ) {\n ++it;\n config->setGroup(d->groups[pageWidget]);\n\n \/\/ Go through the known widgets of this page and reload\n QPtrListIterator<QWidget> it( d->autoWidgets[pageWidget] );\n QWidget *widget;\n while ( (widget = it.current()) != 0 ){\n ++it;\n QVariant defaultSetting = d->defaultValues[widget];\n QVariant setting = \n config->readPropertyEntry(widget->name(), defaultSetting);\n propertyMap->setProperty(widget, setting);\n }\n }\n d->changed = false;\n}\n\nbool KAutoConfig::parseChildren(const QWidget *widget,\n QPtrList<QWidget>& currentGroup, bool trackChanges){\n bool valueChanged = false;\n const QPtrList<QObject> *listOfChildren = widget->children();\n if(!listOfChildren)\n return valueChanged;\n\n QSqlPropertyMap *propertyMap = QSqlPropertyMap::defaultMap();\n QPtrListIterator<QObject> it( *listOfChildren );\n QObject *object;\n while ( (object = it.current()) != 0 )\n {\n ++it;\n if(!object->isWidgetType()){\n continue;\n }\n QWidget *childWidget = (QWidget *)object;\n if(d->ignore.containsRef(childWidget)){\n continue;\n }\n\n bool parseTheChildren = true;\n if( d->ignoreTheseWidgets[childWidget->className()] == 0 && \n childWidget->name(0) != NULL )\n {\n QVariant defaultSetting = propertyMap->property(childWidget);\n if(defaultSetting.isValid())\n {\n parseTheChildren = false;\n \/\/ Disable the widget if it is immutable?\n if(config->entryIsImmutable( childWidget->name()))\n childWidget->setEnabled(false);\n else\n {\n \/\/ FOR THOSE WHO ARE LOOKING\n \/\/ Here is the code were the widget is actually marked to watch.\n \/\/qDebug(\"KAutoConfig: Adding widget(%s)\",childWidget->name()); \n currentGroup.append(childWidget);\n d->defaultValues.insert(childWidget, defaultSetting);\n }\n \/\/ Get\/Set settings and connect up the changed signal\n QVariant setting =\n config->readPropertyEntry(childWidget->name(), defaultSetting);\n if(setting != defaultSetting)\n {\n propertyMap->setProperty(childWidget, setting);\n valueChanged = true;\n }\n if(trackChanges && changedMap.find(childWidget->className()) !=\n changedMap.end())\n {\n connect(childWidget, changedMap[childWidget->className()],\n this, SIGNAL(widgetModified()));\n }\n#ifndef NDEBUG\n else if(trackChanges &&\n changedMap.find(childWidget->className()) == changedMap.end())\n {\n kdDebug(180) << \"KAutoConfig::retrieveSettings, Unknown changed \"\n \"signal for widget:\" << childWidget->className() << endl;\n }\n#endif\n\n }\n#ifndef NDEBUG\n else\n { \n kdDebug(180) << \"KAutoConfig::retrieveSettings, Unknown widget:\" \n << childWidget->className() << endl;\n }\n#endif\n }\n if(parseTheChildren)\n {\n \/\/ this widget is not known as something we can store.\n \/\/ Maybe we can store one of its children.\n valueChanged |= parseChildren(childWidget, currentGroup, trackChanges);\n }\n }\n return valueChanged;\n}\n\n#include \"kautoconfig.moc\"\n\n<commit_msg>compilation in kde 3.1<commit_after>\/*\n * This file is part of the KDE libraries\n * Copyright (C) 2003 Benjamin C Meyer (ben+kdelibs at meyerhome dot net)\n *\n * This library is free software; you can redistribute it and\/or\n * modify it under the terms of the GNU Library General Public\n * License as published by the Free Software Foundation; either\n * version 2 of the License, or (at your option) any later version.\n *\n * This library is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU\n * Library General Public License for more details.\n *\n * You should have received a copy of the GNU Library General Public License\n * along with this library; see the file COPYING.LIB. If not, write to\n * the Free Software Foundation, Inc., 59 Temple Place - Suite 330,\n * Boston, MA 02111-1307, USA.\n *\/\n#include \"kautoconfig.h\"\n\n#include <kglobal.h>\n#include <qsqlpropertymap.h>\n#include <qobjectlist.h>\n#include <kconfig.h>\n#include <kapplication.h>\n#include <kdeversion.h>\n\n\/**\n * Macro function to warn developers when they are making calls\n * that can never return anything of value\n *\/ \n#ifndef NDEBUG\n#include \"kdebug.h\"\n#define functionCallOrderCheck(functionName, returnValue) \\\n if(!d->retrievedSettings){ \\\n kdDebug(180) << \"KAutoConfig::\"functionName\"() was called before \" \\\n \"KAutoConfig::retrieveSettings(). This should NEVER happen. \" \\\n \"Please Fix.\" << endl; \\\n return returnValue; \\\n }\n#else\n#define functionCallOrderCheck(functionName, returnValue)\n#endif\n\nclass KAutoConfig::KAutoConfigPrivate {\n\npublic:\n KAutoConfigPrivate() : changed(false)\n#ifndef NDEBUG\n , retrievedSettings(false)\n#endif\n { init(); }\n\n \/\/ Widgets to parse\n QPtrList<QWidget> widgets;\n \/\/ Name of the group that KConfig should be set to for each widget.\n QMap<QWidget*, QString> groups;\n\n \/\/ Child widgets of widgets to ignore\n QPtrList<QWidget> ignore;\n\n \/\/ Reset to false after saveSettings returns true.\n bool changed;\n\n#ifndef NDEBUG\n \/\/ Many functions require this to be true to be of any value.\n bool retrievedSettings;\n#endif\n\n \/\/ Known widgets that can be configured\n QMap<QWidget*, QPtrList<QWidget> > autoWidgets;\n \/\/ Default values for the widgets.\n QMap<QWidget*, QVariant> defaultValues;\n \/\/ Widgets to not get properties on (QLabel etc)\n QAsciiDict<int> ignoreTheseWidgets;\n\n void init(){\n ignoreTheseWidgets.insert(\"QLabel\", new int(1));\n ignoreTheseWidgets.insert(\"QFrame\", new int(2));\n ignoreTheseWidgets.insert(\"QGroupBox\", new int(3));\n ignoreTheseWidgets.insert(\"QButtonGroup\", new int(4));\n ignoreTheseWidgets.insert(\"QWidget\", new int(5));\n ignoreTheseWidgets.setAutoDelete(true);\n\n static bool defaultKDEPropertyMapInstalled = false;\n if ( !defaultKDEPropertyMapInstalled && kapp ) {\n kapp->installKDEPropertyMap();\n defaultKDEPropertyMapInstalled = true;\n }\n }\n};\n\nKAutoConfig::KAutoConfig(KConfig *kconfig, QObject *parent,\n const char *name) : QObject(parent, name), config(kconfig) {\n d = new KAutoConfigPrivate();\n}\n\nKAutoConfig::KAutoConfig(QObject *parent, const char *name) :\n QObject(parent, name), config(KGlobal::config()) {\n d = new KAutoConfigPrivate();\n}\n\nKAutoConfig::~KAutoConfig(){\n delete d;\n}\n\nvoid KAutoConfig::addWidget(QWidget *widget, const QString &group){\n d->groups.insert(widget, group);\n d->widgets.append(widget);\n QPtrList<QWidget> newAutoConfigWidget;\n d->autoWidgets.insert(widget, newAutoConfigWidget );\n}\n\nvoid KAutoConfig::ignoreSubWidget(QWidget *widget){\n d->ignore.append(widget);\n}\n\nbool KAutoConfig::retrieveSettings(bool trackChanges){\n#ifndef NDEBUG\n if(d->retrievedSettings){\n kdDebug(180) << \"This should not happen. Function \"\n \"KAutoConfig::retrieveSettings() was called more then once, returning \"\n \"false. Please fix.\" << endl;\n return false;\n }\n d->retrievedSettings = true;\n#endif\n \n if(trackChanges){\n \/\/ QT\n changedMap.insert(\"QButton\", SIGNAL(stateChanged(int)));\n changedMap.insert(\"QCheckBox\", SIGNAL(stateChanged(int)));\n changedMap.insert(\"QPushButton\", SIGNAL(stateChanged(int)));\n changedMap.insert(\"QRadioButton\", SIGNAL(stateChanged(int)));\n changedMap.insert(\"QComboBox\", SIGNAL(activated (int)));\n \/\/qsqlproperty map doesn't store the text, but the value!\n \/\/changedMap.insert(\"QComboBox\", SIGNAL(textChanged(const QString &)));\n changedMap.insert(\"QDateEdit\", SIGNAL(valueChanged(const QDate &)));\n changedMap.insert(\"QDateTimeEdit\", SIGNAL(valueChanged(const QDateTime &)));\n changedMap.insert(\"QDial\", SIGNAL(valueChanged (int)));\n changedMap.insert(\"QLineEdit\", SIGNAL(textChanged(const QString &)));\n changedMap.insert(\"QSlider\", SIGNAL(valueChanged(int)));\n changedMap.insert(\"QSpinBox\", SIGNAL(valueChanged(int)));\n changedMap.insert(\"QTimeEdit\", SIGNAL(valueChanged(const QTime &)));\n changedMap.insert(\"QTextEdit\", SIGNAL(textChanged()));\n changedMap.insert(\"QTextBrowser\", SIGNAL(sourceChanged(const QString &)));\n changedMap.insert(\"QMultiLineEdit\", SIGNAL(textChanged()));\n changedMap.insert(\"QListBox\", SIGNAL(selectionChanged()));\n changedMap.insert(\"QTabWidget\", SIGNAL(currentChanged(QWidget *)));\n\n \/\/ KDE\n changedMap.insert( \"KComboBox\", SIGNAL(activated (int)));\n changedMap.insert( \"KFontCombo\", SIGNAL(activated (int)));\n changedMap.insert( \"KFontRequester\", SIGNAL(fontSelected(const QFont &)));\n changedMap.insert( \"KFontChooser\", SIGNAL(fontSelected(const QFont &)));\n changedMap.insert( \"KHistoryCombo\", SIGNAL(activated (int)));\n\n changedMap.insert( \"KColorButton\", SIGNAL(changed(const QColor &)));\n changedMap.insert( \"KDatePicker\", SIGNAL(dateSelected (QDate)));\n changedMap.insert( \"KEditListBox\", SIGNAL(changed()));\n changedMap.insert( \"KListBox\", SIGNAL(selectionChanged()));\n changedMap.insert( \"KLineEdit\", SIGNAL(textChanged(const QString &)));\n changedMap.insert( \"KPasswordEdit\", SIGNAL(textChanged(const QString &)));\n changedMap.insert( \"KRestrictedLine\", SIGNAL(textChanged(const QString &)));\n changedMap.insert( \"KTextBrowser\", SIGNAL(sourceChanged(const QString &)));\n changedMap.insert( \"KTextEdit\", SIGNAL(textChanged()));\n changedMap.insert( \"KURLRequester\", SIGNAL(textChanged (const QString& )));\n changedMap.insert( \"KIntNumInput\", SIGNAL(valueChanged (int)));\n changedMap.insert( \"KIntSpinBox\", SIGNAL(valueChanged (int)));\n changedMap.insert( \"KDoubleNumInput\", SIGNAL(valueChanged (double)));\n }\n\n \/\/ Go through all of the children of the widgets and find all known widgets\n QPtrListIterator<QWidget> it( d->widgets );\n QWidget *widget;\n bool usingDefaultValues = false;\n while ( (widget = it.current()) != 0 ) {\n ++it;\n config->setGroup(d->groups[widget]);\n usingDefaultValues |= parseChildren(widget, d->autoWidgets[widget], trackChanges);\n }\n return usingDefaultValues;\n}\n\nbool KAutoConfig::saveSettings() {\n functionCallOrderCheck(\"saveSettings\", false);\n\n QSqlPropertyMap *propertyMap = QSqlPropertyMap::defaultMap();\n \/\/ Go through all of the widgets\n QPtrListIterator<QWidget> it( d->widgets );\n QWidget *widget;\n while ( (widget = it.current()) != 0 ) {\n ++it;\n config->setGroup(d->groups[widget]);\n\n \/\/ Go through the known autowidgets of this widget and save\n QPtrListIterator<QWidget> it( d->autoWidgets[widget] );\n QWidget *groupWidget;\n bool widgetChanged = false;\n while ( (groupWidget = it.current()) != 0 ){\n ++it;\n QVariant defaultValue = d->defaultValues[groupWidget];\n QVariant currentValue = propertyMap->property(groupWidget);\n#if KDE_IS_VERSION( 3, 1, 90 )\n if(!config->hasDefault(groupWidget->name()) && currentValue == defaultValue){\n config->revertToDefault(groupWidget->name());\n widgetChanged = true;\n }\n else{\n#endif\n QVariant savedValue = config->readPropertyEntry(groupWidget->name(),\n defaultValue);\n if(savedValue != currentValue){\n config->writeEntry(groupWidget->name(), currentValue);\n widgetChanged = true;\n }\n#if KDE_IS_VERSION( 3, 1, 90 )\n }\n#endif\n }\n d->changed |= widgetChanged;\n if(widgetChanged)\n emit( settingsChanged(widget) );\n }\n\n if(d->changed){\n emit( settingsChanged() );\n d->changed = false;\n config->sync();\n return true;\n }\n return false;\n}\n\nbool KAutoConfig::hasChanged() const {\n functionCallOrderCheck(\"hasChanged\", false);\n\n QSqlPropertyMap *propertyMap = QSqlPropertyMap::defaultMap();\n \/\/ Go through all of the widgets\n QPtrListIterator<QWidget> it( d->widgets );\n QWidget *widget;\n while ( (widget = it.current()) != 0 ) {\n ++it;\n config->setGroup(d->groups[widget]);\n \/\/ Go through the known autowidgets of this widget and save\n QPtrListIterator<QWidget> it( d->autoWidgets[widget] );\n QWidget *groupWidget;\n while ( (groupWidget = it.current()) != 0 ){\n ++it;\n QVariant defaultValue = d->defaultValues[groupWidget];\n QVariant currentValue = propertyMap->property(groupWidget);\n QVariant savedValue = config->readPropertyEntry(groupWidget->name(),\n defaultValue);\n\n \/\/ Return once just one item is found to have changed.\n if((currentValue == defaultValue && savedValue != currentValue) ||\n (savedValue != currentValue))\n return true;\n }\n }\n return false;\n}\n\nbool KAutoConfig::isDefault() const {\n functionCallOrderCheck(\"isDefault\", false);\n\n QSqlPropertyMap *propertyMap = QSqlPropertyMap::defaultMap();\n \/\/ Go through all of the widgets\n QPtrListIterator<QWidget> it( d->widgets );\n QWidget *widget;\n while ( (widget = it.current()) != 0 ) {\n ++it;\n config->setGroup(d->groups[widget]);\n \/\/ Go through the known autowidgets of this widget and save\n QPtrListIterator<QWidget> it( d->autoWidgets[widget] );\n QWidget *groupWidget;\n while ( (groupWidget = it.current()) != 0 ){\n ++it;\n QVariant defaultValue = d->defaultValues[groupWidget];\n QVariant currentValue = propertyMap->property(groupWidget);\n if(currentValue != defaultValue){\n \/\/qDebug(\"groupWidget %s, has changed: default: %s new: %s\", groupWidget->name(), defaultValue.toString().latin1(), currentValue.toString().latin1());\n return false;\n }\n }\n }\n return true;\n}\n\nvoid KAutoConfig::resetSettings() const {\n functionCallOrderCheck(\"resetSettings\",);\n\n QSqlPropertyMap *propertyMap = QSqlPropertyMap::defaultMap();\n \/\/ Go through all of the widgets\n QPtrListIterator<QWidget> it( d->widgets );\n QWidget *widget;\n while ( (widget = it.current()) != 0 ) {\n ++it;\n config->setGroup(d->groups[widget]);\n\n \/\/ Go through the known autowidgets of this widget and save\n QPtrListIterator<QWidget> it( d->autoWidgets[widget] );\n QWidget *groupWidget;\n while ( (groupWidget = it.current()) != 0 ){\n ++it;\n QVariant defaultValue = d->defaultValues[groupWidget];\n if(defaultValue != propertyMap->property(groupWidget)){\n propertyMap->setProperty(groupWidget, defaultValue);\n d->changed = true;\n }\n }\n }\n}\n\nvoid KAutoConfig::reloadSettings() const {\n functionCallOrderCheck(\"reloadSettings\", );\n\n QSqlPropertyMap *propertyMap = QSqlPropertyMap::defaultMap();\n \/\/ Go through all of the widgets\n QPtrListIterator<QWidget> it( d->widgets );\n QWidget *pageWidget;\n while ( (pageWidget = it.current()) != 0 ) {\n ++it;\n config->setGroup(d->groups[pageWidget]);\n\n \/\/ Go through the known widgets of this page and reload\n QPtrListIterator<QWidget> it( d->autoWidgets[pageWidget] );\n QWidget *widget;\n while ( (widget = it.current()) != 0 ){\n ++it;\n QVariant defaultSetting = d->defaultValues[widget];\n QVariant setting = \n config->readPropertyEntry(widget->name(), defaultSetting);\n propertyMap->setProperty(widget, setting);\n }\n }\n d->changed = false;\n}\n\nbool KAutoConfig::parseChildren(const QWidget *widget,\n QPtrList<QWidget>& currentGroup, bool trackChanges){\n bool valueChanged = false;\n const QPtrList<QObject> *listOfChildren = widget->children();\n if(!listOfChildren)\n return valueChanged;\n\n QSqlPropertyMap *propertyMap = QSqlPropertyMap::defaultMap();\n QPtrListIterator<QObject> it( *listOfChildren );\n QObject *object;\n while ( (object = it.current()) != 0 )\n {\n ++it;\n if(!object->isWidgetType()){\n continue;\n }\n QWidget *childWidget = (QWidget *)object;\n if(d->ignore.containsRef(childWidget)){\n continue;\n }\n\n bool parseTheChildren = true;\n if( d->ignoreTheseWidgets[childWidget->className()] == 0 && \n childWidget->name(0) != NULL )\n {\n QVariant defaultSetting = propertyMap->property(childWidget);\n if(defaultSetting.isValid())\n {\n parseTheChildren = false;\n \/\/ Disable the widget if it is immutable?\n if(config->entryIsImmutable( childWidget->name()))\n childWidget->setEnabled(false);\n else\n {\n \/\/ FOR THOSE WHO ARE LOOKING\n \/\/ Here is the code were the widget is actually marked to watch.\n \/\/qDebug(\"KAutoConfig: Adding widget(%s)\",childWidget->name()); \n currentGroup.append(childWidget);\n d->defaultValues.insert(childWidget, defaultSetting);\n }\n \/\/ Get\/Set settings and connect up the changed signal\n QVariant setting =\n config->readPropertyEntry(childWidget->name(), defaultSetting);\n if(setting != defaultSetting)\n {\n propertyMap->setProperty(childWidget, setting);\n valueChanged = true;\n }\n if(trackChanges && changedMap.find(childWidget->className()) !=\n changedMap.end())\n {\n connect(childWidget, changedMap[childWidget->className()],\n this, SIGNAL(widgetModified()));\n }\n#ifndef NDEBUG\n else if(trackChanges &&\n changedMap.find(childWidget->className()) == changedMap.end())\n {\n kdDebug(180) << \"KAutoConfig::retrieveSettings, Unknown changed \"\n \"signal for widget:\" << childWidget->className() << endl;\n }\n#endif\n\n }\n#ifndef NDEBUG\n else\n { \n kdDebug(180) << \"KAutoConfig::retrieveSettings, Unknown widget:\" \n << childWidget->className() << endl;\n }\n#endif\n }\n if(parseTheChildren)\n {\n \/\/ this widget is not known as something we can store.\n \/\/ Maybe we can store one of its children.\n valueChanged |= parseChildren(childWidget, currentGroup, trackChanges);\n }\n }\n return valueChanged;\n}\n\n#include \"kautoconfig.moc\"\n\n<|endoftext|>"} {"text":"<commit_before>\/\/ Copyright 2015 Open Source Robotics Foundation, Inc.\n\/\/\n\/\/ Licensed under the Apache License, Version 2.0 (the \"License\");\n\/\/ you may not use this file except in compliance with the License.\n\/\/ You may obtain a copy of the License at\n\/\/\n\/\/ http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n\/\/\n\/\/ Unless required by applicable law or agreed to in writing, software\n\/\/ distributed under the License is distributed on an \"AS IS\" BASIS,\n\/\/ WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n\/\/ See the License for the specific language governing permissions and\n\/\/ limitations under the License.\n\n#include <sstream>\n#include <stdexcept>\n#include <sys\/stat.h>\n\n#include <ament_index_cpp\/get_search_paths.hpp>\n\n#ifdef _WIN32\n#define stat _stat\n#endif\n\nnamespace ament_index_cpp\n{\n\nstd::list<std::string>\nget_search_paths()\n{\n char * ament_prefix_path = nullptr;\n const char * env_var = \"AMENT_PREFIX_PATH\";\n\n \/\/ get environment variable\n#ifndef _WIN32\n ament_prefix_path = getenv(env_var);\n#else\n size_t ament_prefix_path_size;\n _dupenv_s(&ament_prefix_path, &ament_prefix_path_size, env_var);\n#endif\n if (!ament_prefix_path || std::string(ament_prefix_path).empty()) {\n throw std::runtime_error(\"Environment variable 'AMENT_PREFIX_PATH' is not set or empty\");\n }\n\n \/\/ split at token into separate paths\n std::list<std::string> paths;\n std::stringstream ss(ament_prefix_path);\n std::string tok;\n#ifndef _WIN32\n char delim = ':';\n#else\n char delim = ';';\n#endif\n while (getline(ss, tok, delim)) {\n \/\/ skip non existing directories\n struct stat s;\n auto retcode = stat(tok.c_str(), &s);\n if (retcode) {\n continue;\n }\n#ifndef _WIN32\n if (!S_ISDIR(s.st_mode)) {\n#else\n if (s.st_mode & _S_IFDIR) {\n#endif\n continue;\n }\n\n paths.push_back(tok);\n }\n\n#ifdef _WIN32\n if (ament_prefix_path) {\n free(ament_prefix_path);\n }\n#endif\n\n return paths;\n}\n\n} \/\/ namespace\n<commit_msg>fix directory check on Windows<commit_after>\/\/ Copyright 2015 Open Source Robotics Foundation, Inc.\n\/\/\n\/\/ Licensed under the Apache License, Version 2.0 (the \"License\");\n\/\/ you may not use this file except in compliance with the License.\n\/\/ You may obtain a copy of the License at\n\/\/\n\/\/ http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n\/\/\n\/\/ Unless required by applicable law or agreed to in writing, software\n\/\/ distributed under the License is distributed on an \"AS IS\" BASIS,\n\/\/ WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n\/\/ See the License for the specific language governing permissions and\n\/\/ limitations under the License.\n\n#include <sstream>\n#include <stdexcept>\n#include <sys\/stat.h>\n\n#include <ament_index_cpp\/get_search_paths.hpp>\n\n#ifdef _WIN32\n#define stat _stat\n#endif\n\nnamespace ament_index_cpp\n{\n\nstd::list<std::string>\nget_search_paths()\n{\n char * ament_prefix_path = nullptr;\n const char * env_var = \"AMENT_PREFIX_PATH\";\n\n \/\/ get environment variable\n#ifndef _WIN32\n ament_prefix_path = getenv(env_var);\n#else\n size_t ament_prefix_path_size;\n _dupenv_s(&ament_prefix_path, &ament_prefix_path_size, env_var);\n#endif\n if (!ament_prefix_path || std::string(ament_prefix_path).empty()) {\n throw std::runtime_error(\"Environment variable 'AMENT_PREFIX_PATH' is not set or empty\");\n }\n\n \/\/ split at token into separate paths\n std::list<std::string> paths;\n std::stringstream ss(ament_prefix_path);\n std::string tok;\n#ifndef _WIN32\n char delim = ':';\n#else\n char delim = ';';\n#endif\n while (getline(ss, tok, delim)) {\n if (tok.empty()) {\n continue;\n }\n \/\/ skip non existing directories\n struct stat s;\n if (stat(tok.c_str(), &s)) {\n continue;\n }\n if ((s.st_mode & S_IFMT) == S_IFDIR) {\n paths.push_back(tok);\n }\n }\n\n#ifdef _WIN32\n if (ament_prefix_path) {\n free(ament_prefix_path);\n }\n#endif\n\n return paths;\n}\n\n} \/\/ namespace\n<|endoftext|>"} {"text":"<commit_before>\/* Copyright 2019 The TensorFlow Authors. All Rights Reserved.\n\nLicensed under the Apache License, Version 2.0 (the \"License\");\nyou may not use this file except in compliance with the License.\nYou may obtain a copy of the License at\n\n http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n\nUnless required by applicable law or agreed to in writing, software\ndistributed under the License is distributed on an \"AS IS\" BASIS,\nWITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\nSee the License for the specific language governing permissions and\nlimitations under the License.\n==============================================================================*\/\n\n#ifdef INTEL_MKL\n\n#define EIGEN_USE_THREADS\n\n#include \"mkldnn.hpp\"\n#include \"tensorflow\/core\/framework\/op.h\"\n#include \"tensorflow\/core\/framework\/op_kernel.h\"\n#include \"tensorflow\/core\/framework\/type_traits.h\"\n#include \"tensorflow\/core\/framework\/types.h\"\n#include \"tensorflow\/core\/graph\/mkl_graph_util.h\"\n#include \"tensorflow\/core\/kernels\/meta_support.h\"\n#include \"tensorflow\/core\/kernels\/quantization_utils.h\"\n#include \"tensorflow\/core\/lib\/core\/errors.h\"\n#include \"tensorflow\/core\/util\/mkl_util.h\"\n\nusing mkldnn::primitive_attr;\nusing mkldnn::stream;\n\nnamespace tensorflow {\n\ntypedef Eigen::ThreadPoolDevice CPUDevice;\n\ntemplate <typename Device, typename T>\nclass MklDequantizeOp : public OpKernel {\n public:\n explicit MklDequantizeOp(OpKernelConstruction* ctx) : OpKernel(ctx) {\n string mode_string;\n OP_REQUIRES_OK(ctx, ctx->GetAttr(\"mode\", &mode_string));\n OP_REQUIRES(ctx, mode_string == \"SCALED\",\n errors::InvalidArgument(\n \"MklDequantizeOp only supports 'SCALED' mode, but got '\" +\n mode_string + \"'\"));\n }\n\n void Compute(OpKernelContext* ctx) override {\n try {\n \/\/ Using CPU device\n auto cpu_engine = engine(engine::kind::cpu, 0);\n\n \/\/ Get the inputs\n const Tensor& src_tensor = MklGetInput(ctx, kSrcIndex);\n const float min_range =\n MklGetInput(ctx, kMinIndex).template flat<float>()(0);\n const float max_range =\n MklGetInput(ctx, kMaxIndex).template flat<float>()(0);\n\n \/\/ Get MklShape\n MklDnnShape src_mkl_shape;\n GetMklShape(ctx, kSrcIndex, &src_mkl_shape);\n\n \/\/ src_dims is the dimension of src_tensor\n \/\/ output_dims are same as src_dims\n auto src_dims = src_mkl_shape.IsMklTensor()\n ? src_mkl_shape.GetSizesAsMklDnnDims()\n : TFShapeToMklDnnDims(src_tensor.shape());\n auto output_dims = src_dims;\n\n \/\/ Create reorder memory for src and dst\n MklDnnData<T> src(&cpu_engine);\n MklDnnData<float> dst(&cpu_engine);\n\n std::shared_ptr<stream> reorder_stream;\n reorder_stream.reset(CreateStream(ctx, cpu_engine));\n\n \/\/ If input is in MKL layout, then simply grab input layout; otherwise,\n \/\/ construct input TF layout. For TF layout, although input shape\n \/\/ (src_dims) required is in MKL-DNN order, the layout is Tensorflow's\n \/\/ layout\n auto src_md = src_mkl_shape.IsMklTensor()\n ? src_mkl_shape.GetMklLayout()\n : memory::desc(src_dims, MklDnnType<T>(),\n src_dims.size() == 4 ? MEMORY_FORMAT::nhwc : MEMORY_FORMAT::nc); \n\n src.SetUsrMem(src_md, &src_tensor);\n src.SetUsrMemDataHandle(&src_tensor, reorder_stream);\n\n Tensor* output_tensor = nullptr;\n MklDnnShape output_mkl_shape;\n TensorShape output_tf_shape;\n memory::desc dst_md = memory::desc();\n if (src_mkl_shape.IsMklTensor()) {\n dst_md = memory::desc(src_mkl_shape.GetMklLayout().data);\n \/\/ There is no API in MKL-DNN v1.x to construct memory descriptor with\n \/\/ same .data field but different type.\n dst_md.data.data_type = memory::convert_to_c(MklDnnType<float>());\n } else {\n dst_md = memory::desc(src_dims, MklDnnType<float>(),\n src_dims.size() == 4 ? MEMORY_FORMAT::nhwc : MEMORY_FORMAT::nc); \n }\n\n \/\/ If input is MKL shape, output is also MKL shape.\n \/\/ If input is TF shape, output is also TF shape.\n if (src_mkl_shape.IsMklTensor()) {\n output_mkl_shape.SetMklTensor(true);\n output_mkl_shape.SetMklLayout(&dst_md);\n output_mkl_shape.SetElemType(MklDnnType<float>());\n output_mkl_shape.SetTfLayout(src_mkl_shape.GetDimension(),\n src_mkl_shape.GetSizesAsMklDnnDims(),\n src_mkl_shape.GetTfDataFormat());\n output_tf_shape.AddDim(dst_md.get_size() \/ sizeof(float));\n } else {\n output_mkl_shape.SetMklTensor(false);\n output_tf_shape = MklDnnDimsToTFShape(output_dims);\n }\n\n \/\/ Allocate MKL or TF output shape based on the above\n AllocateOutputSetMklShape(ctx, 0, &output_tensor, output_tf_shape,\n output_mkl_shape);\n dst.SetUsrMem(dst_md, output_tensor);\n dst.SetUsrMemDataHandle(output_tensor, reorder_stream);\n\n \/\/ The quantization logic here for mode SCALED is similar to the logic\n \/\/ in QuantizeAndDequantizeV2 and QuantizeAndDequantizeV3.\n static constexpr int num_bits = sizeof(T) * 8;\n const float max_abs = std::max(std::abs(min_range), std::abs(max_range));\n bool is_signed = std::is_signed<T>::value;\n \/\/ If it is signed, we try to keep 0.0 being 0 and drop one bucket. For\n \/\/ example, if it is 8 bits, we have the range [-127, 127]. So for input\n \/\/ range of [-x, x], the scale should be (2*x)\/254.\n \/\/\n \/\/ If it is unsigned and num_bits == 8, the range with 8 bits is [0, 255].\n \/\/ If the input range is [0, x], then the scale is x\/255 instead of 254 as\n \/\/ in the case above.\n const int target_bits = is_signed ? (num_bits - 1) : num_bits;\n const float target_range =\n static_cast<float>((uint64_t{1} << target_bits) - 1);\n const float scale_factor = max_abs \/ target_range;\n std::vector<float> scales;\n scales.push_back(scale_factor);\n primitive_attr attr;\n attr.set_output_scales(0, scales);\n std::vector<primitive> net;\n\n \/\/ Create reorder primitive and then execute.\n auto reorder_pd =\n ReorderPd(cpu_engine, src.GetUsrMem()->get_desc(), cpu_engine,\n dst.GetUsrMem()->get_desc(), attr);\n net.push_back(reorder(reorder_pd));\n std::vector<std::unordered_map<int, memory>> reorder_net_args;\n reorder_net_args.push_back({{MKLDNN_ARG_FROM, *src.GetUsrMem()},\n {MKLDNN_ARG_TO, *dst.GetUsrMem()}});\n execute_primitives(net, reorder_stream, reorder_net_args);\n } catch (mkldnn::error& e) {\n string error_msg = \"Status: \" + std::to_string(e.status) +\n \", message: \" + string(e.message) + \", in file \" +\n string(__FILE__) + \":\" + std::to_string(__LINE__);\n OP_REQUIRES_OK(\n ctx, errors::Aborted(\"Operation received an exception:\", error_msg));\n }\n }\n\n private:\n const size_t kSrcIndex = 0;\n const size_t kMinIndex = 1;\n const size_t kMaxIndex = 2;\n};\n\nREGISTER_KERNEL_BUILDER(Name(\"_MklDequantize\")\n .Device(DEVICE_CPU)\n .TypeConstraint<quint8>(\"T\")\n .Label(mkl_op_registry::kMklQuantizedOpLabel),\n MklDequantizeOp<CPUDevice, quint8>);\nREGISTER_KERNEL_BUILDER(Name(\"_MklDequantize\")\n .Device(DEVICE_CPU)\n .TypeConstraint<qint8>(\"T\")\n .Label(mkl_op_registry::kMklQuantizedOpLabel),\n MklDequantizeOp<CPUDevice, qint8>);\n\n} \/\/ namespace tensorflow\n\n#endif \/\/ INTEL_MKL\n<commit_msg>cleaning<commit_after>\/* Copyright 2019 The TensorFlow Authors. All Rights Reserved.\n\nLicensed under the Apache License, Version 2.0 (the \"License\");\nyou may not use this file except in compliance with the License.\nYou may obtain a copy of the License at\n\n http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n\nUnless required by applicable law or agreed to in writing, software\ndistributed under the License is distributed on an \"AS IS\" BASIS,\nWITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\nSee the License for the specific language governing permissions and\nlimitations under the License.\n==============================================================================*\/\n\n#ifdef INTEL_MKL\n\n#define EIGEN_USE_THREADS\n\n#include \"mkldnn.hpp\"\n#include \"tensorflow\/core\/framework\/op.h\"\n#include \"tensorflow\/core\/framework\/op_kernel.h\"\n#include \"tensorflow\/core\/framework\/type_traits.h\"\n#include \"tensorflow\/core\/framework\/types.h\"\n#include \"tensorflow\/core\/graph\/mkl_graph_util.h\"\n#include \"tensorflow\/core\/kernels\/meta_support.h\"\n#include \"tensorflow\/core\/kernels\/quantization_utils.h\"\n#include \"tensorflow\/core\/lib\/core\/errors.h\"\n#include \"tensorflow\/core\/util\/mkl_util.h\"\n\nusing mkldnn::primitive_attr;\nusing mkldnn::stream;\n\nnamespace tensorflow {\n\ntypedef Eigen::ThreadPoolDevice CPUDevice;\n\ntemplate <typename Device, typename T>\nclass MklDequantizeOp : public OpKernel {\n public:\n explicit MklDequantizeOp(OpKernelConstruction* ctx) : OpKernel(ctx) {\n string mode_string;\n OP_REQUIRES_OK(ctx, ctx->GetAttr(\"mode\", &mode_string));\n OP_REQUIRES(ctx, mode_string == \"SCALED\",\n errors::InvalidArgument(\n \"MklDequantizeOp only supports 'SCALED' mode, but got '\" +\n mode_string + \"'\"));\n }\n\n void Compute(OpKernelContext* ctx) override {\n try {\n \/\/ Using CPU device\n auto cpu_engine = engine(engine::kind::cpu, 0);\n\n \/\/ Get the inputs\n const Tensor& src_tensor = MklGetInput(ctx, kSrcIndex);\n const float min_range =\n MklGetInput(ctx, kMinIndex).template flat<float>()(0);\n const float max_range =\n MklGetInput(ctx, kMaxIndex).template flat<float>()(0);\n\n \/\/ Get MklShape\n MklDnnShape src_mkl_shape;\n GetMklShape(ctx, kSrcIndex, &src_mkl_shape);\n\n \/\/ src_dims is the dimension of src_tensor\n \/\/ output_dims are same as src_dims\n auto src_dims = src_mkl_shape.IsMklTensor()\n ? src_mkl_shape.GetSizesAsMklDnnDims()\n : TFShapeToMklDnnDims(src_tensor.shape());\n auto output_dims = src_dims;\n\n \/\/ Create reorder memory for src and dst\n MklDnnData<T> src(&cpu_engine);\n MklDnnData<float> dst(&cpu_engine);\n\n std::shared_ptr<stream> reorder_stream;\n reorder_stream.reset(CreateStream(ctx, cpu_engine));\n\n \/\/ If input is in MKL layout, then simply grab input layout; otherwise,\n \/\/ construct input TF layout. For TF layout, although input shape\n \/\/ (src_dims) required is in MKL-DNN order, the layout is Tensorflow's\n \/\/ layout\n auto src_md = src_mkl_shape.IsMklTensor()\n ? src_mkl_shape.GetMklLayout()\n : memory::desc(src_dims, MklDnnType<T>(),\n src_dims.size() == 4 ? MEMORY_FORMAT::nhwc : MEMORY_FORMAT::nc);\n\n src.SetUsrMem(src_md, &src_tensor);\n src.SetUsrMemDataHandle(&src_tensor, reorder_stream);\n\n Tensor* output_tensor = nullptr;\n MklDnnShape output_mkl_shape;\n TensorShape output_tf_shape;\n memory::desc dst_md = memory::desc();\n if (src_mkl_shape.IsMklTensor()) {\n dst_md = memory::desc(src_mkl_shape.GetMklLayout().data);\n \/\/ There is no API in MKL-DNN v1.x to construct memory descriptor with\n \/\/ same .data field but different type.\n dst_md.data.data_type = memory::convert_to_c(MklDnnType<float>());\n } else {\n dst_md = memory::desc(src_dims, MklDnnType<float>(),\n src_dims.size() == 4 ? MEMORY_FORMAT::nhwc : MEMORY_FORMAT::nc);\n }\n\n \/\/ If input is MKL shape, output is also MKL shape.\n \/\/ If input is TF shape, output is also TF shape.\n if (src_mkl_shape.IsMklTensor()) {\n output_mkl_shape.SetMklTensor(true);\n output_mkl_shape.SetMklLayout(&dst_md);\n output_mkl_shape.SetElemType(MklDnnType<float>());\n output_mkl_shape.SetTfLayout(src_mkl_shape.GetDimension(),\n src_mkl_shape.GetSizesAsMklDnnDims(),\n src_mkl_shape.GetTfDataFormat());\n output_tf_shape.AddDim(dst_md.get_size() \/ sizeof(float));\n } else {\n output_mkl_shape.SetMklTensor(false);\n output_tf_shape = MklDnnDimsToTFShape(output_dims);\n }\n\n \/\/ Allocate MKL or TF output shape based on the above\n AllocateOutputSetMklShape(ctx, 0, &output_tensor, output_tf_shape,\n output_mkl_shape);\n dst.SetUsrMem(dst_md, output_tensor);\n dst.SetUsrMemDataHandle(output_tensor, reorder_stream);\n\n \/\/ The quantization logic here for mode SCALED is similar to the logic\n \/\/ in QuantizeAndDequantizeV2 and QuantizeAndDequantizeV3.\n static constexpr int num_bits = sizeof(T) * 8;\n const float max_abs = std::max(std::abs(min_range), std::abs(max_range));\n bool is_signed = std::is_signed<T>::value;\n \/\/ If it is signed, we try to keep 0.0 being 0 and drop one bucket. For\n \/\/ example, if it is 8 bits, we have the range [-127, 127]. So for input\n \/\/ range of [-x, x], the scale should be (2*x)\/254.\n \/\/\n \/\/ If it is unsigned and num_bits == 8, the range with 8 bits is [0, 255].\n \/\/ If the input range is [0, x], then the scale is x\/255 instead of 254 as\n \/\/ in the case above.\n const int target_bits = is_signed ? (num_bits - 1) : num_bits;\n const float target_range =\n static_cast<float>((uint64_t{1} << target_bits) - 1);\n const float scale_factor = max_abs \/ target_range;\n std::vector<float> scales;\n scales.push_back(scale_factor);\n primitive_attr attr;\n attr.set_output_scales(0, scales);\n std::vector<primitive> net;\n\n \/\/ Create reorder primitive and then execute.\n auto reorder_pd =\n ReorderPd(cpu_engine, src.GetUsrMem()->get_desc(), cpu_engine,\n dst.GetUsrMem()->get_desc(), attr);\n net.push_back(reorder(reorder_pd));\n std::vector<std::unordered_map<int, memory>> reorder_net_args;\n reorder_net_args.push_back({{MKLDNN_ARG_FROM, *src.GetUsrMem()},\n {MKLDNN_ARG_TO, *dst.GetUsrMem()}});\n execute_primitives(net, reorder_stream, reorder_net_args);\n } catch (mkldnn::error& e) {\n string error_msg = \"Status: \" + std::to_string(e.status) +\n \", message: \" + string(e.message) + \", in file \" +\n string(__FILE__) + \":\" + std::to_string(__LINE__);\n OP_REQUIRES_OK(\n ctx, errors::Aborted(\"Operation received an exception:\", error_msg));\n }\n }\n\n private:\n const size_t kSrcIndex = 0;\n const size_t kMinIndex = 1;\n const size_t kMaxIndex = 2;\n};\n\nREGISTER_KERNEL_BUILDER(Name(\"_MklDequantize\")\n .Device(DEVICE_CPU)\n .TypeConstraint<quint8>(\"T\")\n .Label(mkl_op_registry::kMklQuantizedOpLabel),\n MklDequantizeOp<CPUDevice, quint8>);\nREGISTER_KERNEL_BUILDER(Name(\"_MklDequantize\")\n .Device(DEVICE_CPU)\n .TypeConstraint<qint8>(\"T\")\n .Label(mkl_op_registry::kMklQuantizedOpLabel),\n MklDequantizeOp<CPUDevice, qint8>);\n\n} \/\/ namespace tensorflow\n\n#endif \/\/ INTEL_MKL\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#include \"tensorflow\/core\/profiler\/utils\/xplane_visitor.h\"\n\n#include \"absl\/strings\/string_view.h\"\n\nnamespace tensorflow {\nnamespace profiler {\n\nXStatVisitor::XStatVisitor(const XPlaneVisitor* plane, const XStat* stat)\n : stat_(stat),\n metadata_(plane->GetStatMetadata(stat->metadata_id())),\n plane_(plane),\n type_(plane->GetStatType(stat->metadata_id())) {}\n\nabsl::string_view XStatVisitor::RefValue() const {\n const XStatMetadata* metadata = plane_->GetStatMetadata(stat_->ref_value());\n return metadata ? metadata->name() : \"\";\n}\n\nstd::string XStatVisitor::ToString() const {\n switch (stat_->value_case()) {\n case XStat::kInt64Value:\n return absl::StrCat(stat_->int64_value());\n case XStat::kUint64Value:\n return absl::StrCat(stat_->uint64_value());\n case XStat::kDoubleValue:\n return absl::StrCat(stat_->double_value());\n case XStat::kStrValue:\n return stat_->str_value();\n case XStat::kBytesValue:\n return \"<opaque bytes>\";\n case XStat::kRefValue:\n return plane_->GetStatMetadata(stat_->ref_value())->name();\n case XStat::VALUE_NOT_SET:\n return \"\";\n }\n}\n\nabsl::string_view XStatVisitor::StrOrRefValue() const {\n switch (stat_->value_case()) {\n case XStat::kStrValue:\n return stat_->str_value();\n case XStat::kRefValue:\n return plane_->GetStatMetadata(stat_->ref_value())->name();\n case XStat::kInt64Value:\n case XStat::kUint64Value:\n case XStat::kDoubleValue:\n case XStat::kBytesValue:\n case XStat::VALUE_NOT_SET:\n return absl::string_view();\n }\n}\n\nXEventVisitor::XEventVisitor(const XPlaneVisitor* plane, const XLine* line,\n const XEvent* event)\n : XStatsOwner<XEvent>(plane, event),\n plane_(plane),\n line_(line),\n event_(event),\n metadata_(plane->GetEventMetadata(event_->metadata_id())),\n type_(plane->GetEventType(event_->metadata_id())) {}\n\nXPlaneVisitor::XPlaneVisitor(const XPlane* plane,\n const TypeGetterList& event_type_getter_list,\n const TypeGetterList& stat_type_getter_list)\n : XStatsOwner<XPlane>(this, plane), plane_(plane) {\n for (const auto& event_type_getter : event_type_getter_list) {\n BuildEventTypeMap(plane, event_type_getter);\n }\n for (const auto& stat_type_getter : stat_type_getter_list) {\n BuildStatTypeMap(plane, stat_type_getter);\n }\n}\n\nvoid XPlaneVisitor::BuildEventTypeMap(const XPlane* plane,\n const TypeGetter& event_type_getter) {\n for (const auto& event_metadata : plane->event_metadata()) {\n uint64 metadata_id = event_metadata.first;\n const auto& metadata = event_metadata.second;\n absl::optional<int64> event_type = event_type_getter(metadata.name());\n if (event_type.has_value()) {\n auto result = event_metadata_id_map_.emplace(metadata_id, *event_type);\n DCHECK(result.second); \/\/ inserted\n event_type_map_.emplace(*event_type, &metadata);\n }\n }\n}\n\nvoid XPlaneVisitor::BuildStatTypeMap(const XPlane* plane,\n const TypeGetter& stat_type_getter) {\n for (const auto& stat_metadata : plane->stat_metadata()) {\n uint64 metadata_id = stat_metadata.first;\n const auto& metadata = stat_metadata.second;\n absl::optional<int64> stat_type = stat_type_getter(metadata.name());\n if (stat_type.has_value()) {\n auto result = stat_metadata_id_map_.emplace(metadata_id, *stat_type);\n DCHECK(result.second); \/\/ inserted\n stat_type_map_.emplace(*stat_type, &metadata);\n }\n }\n}\n\nconst XStatMetadata* XPlaneVisitor::GetStatMetadata(\n int64 stat_metadata_id) const {\n const auto& stat_metadata_map = plane_->stat_metadata();\n const auto it = stat_metadata_map.find(stat_metadata_id);\n if (it != stat_metadata_map.end()) return &it->second;\n return &XStatMetadata::default_instance();\n}\n\nabsl::optional<int64> XPlaneVisitor::GetStatType(int64 stat_metadata_id) const {\n const auto it = stat_metadata_id_map_.find(stat_metadata_id);\n if (it != stat_metadata_id_map_.end()) return it->second;\n return absl::nullopt;\n}\n\nabsl::optional<int64> XPlaneVisitor::GetStatMetadataId(int64 stat_type) const {\n const auto it = stat_type_map_.find(stat_type);\n if (it != stat_type_map_.end()) return it->second->id();\n return absl::nullopt;\n}\n\nconst XEventMetadata* XPlaneVisitor::GetEventMetadata(\n int64 event_metadata_id) const {\n const auto& event_metadata_map = plane_->event_metadata();\n const auto it = event_metadata_map.find(event_metadata_id);\n if (it != event_metadata_map.end()) return &it->second;\n return &XEventMetadata::default_instance();\n}\n\nabsl::optional<int64> XPlaneVisitor::GetEventType(\n int64 event_metadata_id) const {\n const auto it = event_metadata_id_map_.find(event_metadata_id);\n if (it != event_metadata_id_map_.end()) return it->second;\n return absl::nullopt;\n}\n\n} \/\/ namespace profiler\n} \/\/ namespace tensorflow\n<commit_msg>Fix a subtle use-after-free issue in XStatVisitor::RefValue()<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#include \"tensorflow\/core\/profiler\/utils\/xplane_visitor.h\"\n\n#include \"absl\/strings\/string_view.h\"\n\nnamespace tensorflow {\nnamespace profiler {\n\nXStatVisitor::XStatVisitor(const XPlaneVisitor* plane, const XStat* stat)\n : stat_(stat),\n metadata_(plane->GetStatMetadata(stat->metadata_id())),\n plane_(plane),\n type_(plane->GetStatType(stat->metadata_id())) {}\n\nabsl::string_view XStatVisitor::RefValue() const {\n const XStatMetadata* metadata = plane_->GetStatMetadata(stat_->ref_value());\n return metadata ? absl::string_view(metadata->name()) : absl::string_view();\n}\n\nstd::string XStatVisitor::ToString() const {\n switch (stat_->value_case()) {\n case XStat::kInt64Value:\n return absl::StrCat(stat_->int64_value());\n case XStat::kUint64Value:\n return absl::StrCat(stat_->uint64_value());\n case XStat::kDoubleValue:\n return absl::StrCat(stat_->double_value());\n case XStat::kStrValue:\n return stat_->str_value();\n case XStat::kBytesValue:\n return \"<opaque bytes>\";\n case XStat::kRefValue:\n return plane_->GetStatMetadata(stat_->ref_value())->name();\n case XStat::VALUE_NOT_SET:\n return \"\";\n }\n}\n\nabsl::string_view XStatVisitor::StrOrRefValue() const {\n switch (stat_->value_case()) {\n case XStat::kStrValue:\n return stat_->str_value();\n case XStat::kRefValue:\n return plane_->GetStatMetadata(stat_->ref_value())->name();\n case XStat::kInt64Value:\n case XStat::kUint64Value:\n case XStat::kDoubleValue:\n case XStat::kBytesValue:\n case XStat::VALUE_NOT_SET:\n return absl::string_view();\n }\n}\n\nXEventVisitor::XEventVisitor(const XPlaneVisitor* plane, const XLine* line,\n const XEvent* event)\n : XStatsOwner<XEvent>(plane, event),\n plane_(plane),\n line_(line),\n event_(event),\n metadata_(plane->GetEventMetadata(event_->metadata_id())),\n type_(plane->GetEventType(event_->metadata_id())) {}\n\nXPlaneVisitor::XPlaneVisitor(const XPlane* plane,\n const TypeGetterList& event_type_getter_list,\n const TypeGetterList& stat_type_getter_list)\n : XStatsOwner<XPlane>(this, plane), plane_(plane) {\n for (const auto& event_type_getter : event_type_getter_list) {\n BuildEventTypeMap(plane, event_type_getter);\n }\n for (const auto& stat_type_getter : stat_type_getter_list) {\n BuildStatTypeMap(plane, stat_type_getter);\n }\n}\n\nvoid XPlaneVisitor::BuildEventTypeMap(const XPlane* plane,\n const TypeGetter& event_type_getter) {\n for (const auto& event_metadata : plane->event_metadata()) {\n uint64 metadata_id = event_metadata.first;\n const auto& metadata = event_metadata.second;\n absl::optional<int64> event_type = event_type_getter(metadata.name());\n if (event_type.has_value()) {\n auto result = event_metadata_id_map_.emplace(metadata_id, *event_type);\n DCHECK(result.second); \/\/ inserted\n event_type_map_.emplace(*event_type, &metadata);\n }\n }\n}\n\nvoid XPlaneVisitor::BuildStatTypeMap(const XPlane* plane,\n const TypeGetter& stat_type_getter) {\n for (const auto& stat_metadata : plane->stat_metadata()) {\n uint64 metadata_id = stat_metadata.first;\n const auto& metadata = stat_metadata.second;\n absl::optional<int64> stat_type = stat_type_getter(metadata.name());\n if (stat_type.has_value()) {\n auto result = stat_metadata_id_map_.emplace(metadata_id, *stat_type);\n DCHECK(result.second); \/\/ inserted\n stat_type_map_.emplace(*stat_type, &metadata);\n }\n }\n}\n\nconst XStatMetadata* XPlaneVisitor::GetStatMetadata(\n int64 stat_metadata_id) const {\n const auto& stat_metadata_map = plane_->stat_metadata();\n const auto it = stat_metadata_map.find(stat_metadata_id);\n if (it != stat_metadata_map.end()) return &it->second;\n return &XStatMetadata::default_instance();\n}\n\nabsl::optional<int64> XPlaneVisitor::GetStatType(int64 stat_metadata_id) const {\n const auto it = stat_metadata_id_map_.find(stat_metadata_id);\n if (it != stat_metadata_id_map_.end()) return it->second;\n return absl::nullopt;\n}\n\nabsl::optional<int64> XPlaneVisitor::GetStatMetadataId(int64 stat_type) const {\n const auto it = stat_type_map_.find(stat_type);\n if (it != stat_type_map_.end()) return it->second->id();\n return absl::nullopt;\n}\n\nconst XEventMetadata* XPlaneVisitor::GetEventMetadata(\n int64 event_metadata_id) const {\n const auto& event_metadata_map = plane_->event_metadata();\n const auto it = event_metadata_map.find(event_metadata_id);\n if (it != event_metadata_map.end()) return &it->second;\n return &XEventMetadata::default_instance();\n}\n\nabsl::optional<int64> XPlaneVisitor::GetEventType(\n int64 event_metadata_id) const {\n const auto it = event_metadata_id_map_.find(event_metadata_id);\n if (it != event_metadata_id_map_.end()) return it->second;\n return absl::nullopt;\n}\n\n} \/\/ namespace profiler\n} \/\/ namespace tensorflow\n<|endoftext|>"} {"text":"<commit_before>\/*\n * opencog\/atoms\/reduct\/PlusLink.cc\n *\n * Copyright (C) 2015 Linas Vepstas\n * All Rights Reserved\n *\n * This program is free software; you can redistribute it and\/or modify\n * it under the terms of the GNU Affero General Public License v3 as\n * published by the Plus 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 * Plus Software Foundation, Inc.,\n * 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA.\n *\/\n\n#include <opencog\/atomspace\/atom_types.h>\n#include <opencog\/atomspace\/ClassServer.h>\n#include <opencog\/atoms\/NumberNode.h>\n#include \"PlusLink.h\"\n#include \"TimesLink.h\"\n\nusing namespace opencog;\n\nPlusLink::PlusLink(const HandleSeq& oset,\n TruthValuePtr tv,\n AttentionValuePtr av)\n : FoldLink(PLUS_LINK, oset, tv, av)\n{\n\tinit();\n}\n\nPlusLink::PlusLink(Type t, const HandleSeq& oset,\n TruthValuePtr tv,\n AttentionValuePtr av)\n : FoldLink(t, oset, tv, av)\n{\n\tif (not classserver().isA(t, PLUS_LINK))\n\t\tthrow InvalidParamException(TRACE_INFO, \"Expecting a PlusLink\");\n\tinit();\n}\n\nPlusLink::PlusLink(Type t, const Handle& a, const Handle& b,\n TruthValuePtr tv,\n AttentionValuePtr av)\n : FoldLink(t, a, b, tv, av)\n{\n\tif (not classserver().isA(t, PLUS_LINK))\n\t\tthrow InvalidParamException(TRACE_INFO, \"Expecting a PlusLink\");\n\tinit();\n}\n\nPlusLink::PlusLink(Link& l)\n : FoldLink(l)\n{\n\tType tscope = l.getType();\n\tif (not classserver().isA(tscope, PLUS_LINK))\n\t\tthrow InvalidParamException(TRACE_INFO, \"Expecting a PlusLink\");\n\tinit();\n}\n\nstatic double plus(double a, double b) { return a+b; }\n\nvoid PlusLink::init(void)\n{\n\tknil = 0.0;\n\tkons = plus;\n}\n\n\/\/ ============================================================\n\n\/\/\/ re-order the contents of a PlusLink into \"lexicographic\" order.\n\/\/\/\n\/\/\/ The goal of the re-ordering is to simplify the reduction code,\n\/\/\/ by placing atoms where they are easily found. For now, this\n\/\/\/ means:\n\/\/\/ first, all of the variables,\n\/\/\/ next, all compound expressions,\n\/\/\/ last, all number nodes (of which there should be only zero or one.)\n\/\/\/ We do not currently sort the variables, but maybe we should...?\n\/\/\/ The FoldLink::reduce() method already returns expressions that are\n\/\/\/ almost in the correct order.\nHandle PlusLink::reorder(void)\n{\n\tHandleSeq vars;\n\tHandleSeq exprs;\n\tHandleSeq numbers;\n\n\tfor (const Handle& h : _outgoing)\n\t{\n\t\tif (h->getType() == VARIABLE_NODE)\n\t\t\tvars.push_back(h);\n\t\telse if (h->getType() == NUMBER_NODE)\n\t\t\tnumbers.push_back(h);\n\t\telse\n\t\t\texprs.push_back(h);\n\t}\n\n\tif (1 < numbers.size())\n\t\tthrow RuntimeException(TRACE_INFO,\n\t\t \"Expecting the plus link to have already been reduced!\");\n\n\tHandleSeq result;\n\tfor (const Handle& h : vars) result.push_back(h);\n\tfor (const Handle& h : exprs) result.push_back(h);\n\tfor (const Handle& h : numbers) result.push_back(h);\n\n\treturn Handle(createPlusLink(result));\n}\n\n\/\/ ============================================================\n\n\/\/\/ Handle normalization of addition into multiplication.\n\/\/\/ aka \"mutiplicattive reduction\"\n\/\/\/\n\/\/\/ There are four cases handled here:\n\/\/\/ x+x ==> 2x\n\/\/\/ x + ax ==> (a+1) x\n\/\/\/ ax + x ==> (a+1) x\n\/\/\/ ax + bx ==> (a + b) x\n\/\/\/\nHandle PlusLink::reduce(void)\n{\n\t\/\/ First, let FoldLink do its stuff.\n\tHandle fold = FoldLink::reduce();\n\n\tif (PLUS_LINK != fold->getType()) return fold;\n\n\tPlusLinkPtr pfold(PlusLinkCast(fold));\n\tfold = pfold->reorder();\n\n\t\/\/ Now, look for repeated atoms, two atoms that appear twice\n\t\/\/ in the outgoing set. If they do, then can be mutliplied.\n\tLinkPtr lfold(LinkCast(fold));\n\n\tbool do_reduce = false;\n\tHandle reduct = Handle::UNDEFINED;\n\n\tconst HandleSeq& ofs = lfold->getOutgoingSet();\n\tsize_t fsz = ofs.size();\n\tfor (size_t i = 0; i < fsz; i++)\n\t{\n\t\tconst Handle& fi = ofs[i];\n\t\tfor (size_t j=i+1; j < fsz; j++)\n\t\t{\n\t\t\tconst Handle& fj = ofs[j];\n\n\t\t\t\/\/ Is atom in position i identical to atom in position j?\n\t\t\t\/\/ If so, then replace by 2*i\n\t\t\tif (fi == fj)\n\t\t\t{\n\t\t\t\tHandle two(createNumberNode(\"2\"));\n\t\t\t\treduct = Handle(createTimesLink(fi, two));\n\t\t\t\tdo_reduce = true;\n\t\t\t}\n\n\t\t\t\/\/ If j is (TimesLink a b) and i is identical to a,\n\t\t\t\/\/ then create (TimesLink a (b+1))\n\t\t\tif (fj->getType() == TIMES_LINK)\n\t\t\t{\n\t\t\t\tLinkPtr jlp = LinkCast(fj);\n\t\t\t\tif (fi == jlp->getOutgoingAtom(0))\n\t\t\t\t{\n\t\t\t\t\tHandle one(createNumberNode(\"1\"));\n\t\t\t\t\tHandleSeq rest;\n\t\t\t\t\trest.push_back(one);\n\n\t\t\t\t\tconst HandleSeq& jlpo = jlp->getOutgoingSet();\n\t\t\t\t\tsize_t jlpsz = jlpo.size();\n\t\t\t\t\tfor (size_t k=1; k<jlpsz; k++)\n\t\t\t\t\t\trest.push_back(jlpo[k]);\n\n\t\t\t\t\t\/\/ b_plus_one is now (b+1)\n\t\t\t\t\tPlusLinkPtr bpo = createPlusLink(rest);\n\t\t\t\t\tHandle b_plus_one(bpo->reduce());\n\n\t\t\t\t\treduct = Handle(createTimesLink(fi, b_plus_one));\n\t\t\t\t\tdo_reduce = true;\n\t\t\t\t}\n\t\t\t}\n\n\t\t\tif (do_reduce)\n\t\t\t{\n\t\t\t\tHandleSeq norm;\n\t\t\t\tnorm.push_back(reduct);\n\n\t\t\t\t\/\/ copy everything else, except for i and j.\n\t\t\t\tfor (size_t k = 0; k< fsz; k++)\n\t\t\t\t{\n\t\t\t\t\tif (k == i or k == j) continue;\n\t\t\t\t\tnorm.push_back(ofs[k]);\n\t\t\t\t}\n\n\t\t\t\tPlusLinkPtr plp = createPlusLink(norm);\n\n\t\t\t\tHandle red(plp->reduce());\n\n\t\t\t\t\/\/ Place the result into the same atomspace we are in.\n\t\t\t\t\/\/ XXX this is bad, buggy, uncomfortable, icky: it pollutes\n\t\t\t\t\/\/ the atomspace with intermediate results. This needs to\n\t\t\t\t\/\/ be fixed somehow. Right now, I don't know how.\n\t\t\t\tif (_atomTable)\n\t\t\t\t{\n\t\t\t\t\tAtomSpace* as = _atomTable->getAtomSpace();\n\t\t\t\t\treturn as->addAtom(red);\n\t\t\t\t}\n\t\t\t\treturn red;\n\t\t\t}\n\t\t}\n\t}\n\n\treturn fold;\n}\n<commit_msg>More reduction<commit_after>\/*\n * opencog\/atoms\/reduct\/PlusLink.cc\n *\n * Copyright (C) 2015 Linas Vepstas\n * All Rights Reserved\n *\n * This program is free software; you can redistribute it and\/or modify\n * it under the terms of the GNU Affero General Public License v3 as\n * published by the Plus 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 * Plus Software Foundation, Inc.,\n * 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA.\n *\/\n\n#include <opencog\/atomspace\/atom_types.h>\n#include <opencog\/atomspace\/ClassServer.h>\n#include <opencog\/atoms\/NumberNode.h>\n#include \"PlusLink.h\"\n#include \"TimesLink.h\"\n\nusing namespace opencog;\n\nPlusLink::PlusLink(const HandleSeq& oset,\n TruthValuePtr tv,\n AttentionValuePtr av)\n : FoldLink(PLUS_LINK, oset, tv, av)\n{\n\tinit();\n}\n\nPlusLink::PlusLink(Type t, const HandleSeq& oset,\n TruthValuePtr tv,\n AttentionValuePtr av)\n : FoldLink(t, oset, tv, av)\n{\n\tif (not classserver().isA(t, PLUS_LINK))\n\t\tthrow InvalidParamException(TRACE_INFO, \"Expecting a PlusLink\");\n\tinit();\n}\n\nPlusLink::PlusLink(Type t, const Handle& a, const Handle& b,\n TruthValuePtr tv,\n AttentionValuePtr av)\n : FoldLink(t, a, b, tv, av)\n{\n\tif (not classserver().isA(t, PLUS_LINK))\n\t\tthrow InvalidParamException(TRACE_INFO, \"Expecting a PlusLink\");\n\tinit();\n}\n\nPlusLink::PlusLink(Link& l)\n : FoldLink(l)\n{\n\tType tscope = l.getType();\n\tif (not classserver().isA(tscope, PLUS_LINK))\n\t\tthrow InvalidParamException(TRACE_INFO, \"Expecting a PlusLink\");\n\tinit();\n}\n\nstatic double plus(double a, double b) { return a+b; }\n\nvoid PlusLink::init(void)\n{\n\tknil = 0.0;\n\tkons = plus;\n}\n\n\/\/ ============================================================\n\n\/\/\/ re-order the contents of a PlusLink into \"lexicographic\" order.\n\/\/\/\n\/\/\/ The goal of the re-ordering is to simplify the reduction code,\n\/\/\/ by placing atoms where they are easily found. For now, this\n\/\/\/ means:\n\/\/\/ first, all of the variables,\n\/\/\/ next, all compound expressions,\n\/\/\/ last, all number nodes (of which there should be only zero or one.)\n\/\/\/ We do not currently sort the variables, but maybe we should...?\n\/\/\/ The FoldLink::reduce() method already returns expressions that are\n\/\/\/ almost in the correct order.\nHandle PlusLink::reorder(void)\n{\n\tHandleSeq vars;\n\tHandleSeq exprs;\n\tHandleSeq numbers;\n\n\tfor (const Handle& h : _outgoing)\n\t{\n\t\tif (h->getType() == VARIABLE_NODE)\n\t\t\tvars.push_back(h);\n\t\telse if (h->getType() == NUMBER_NODE)\n\t\t\tnumbers.push_back(h);\n\t\telse\n\t\t\texprs.push_back(h);\n\t}\n\n\tif (1 < numbers.size())\n\t\tthrow RuntimeException(TRACE_INFO,\n\t\t \"Expecting the plus link to have already been reduced!\");\n\n\tHandleSeq result;\n\tfor (const Handle& h : vars) result.push_back(h);\n\tfor (const Handle& h : exprs) result.push_back(h);\n\tfor (const Handle& h : numbers) result.push_back(h);\n\n\treturn Handle(createPlusLink(result));\n}\n\n\/\/ ============================================================\n\n\/\/\/ Handle normalization of addition into multiplication.\n\/\/\/ aka \"mutiplicattive reduction\"\n\/\/\/\n\/\/\/ There are four cases handled here:\n\/\/\/ x+x ==> 2x\n\/\/\/ x + ax ==> (a+1) x\n\/\/\/ ax + x ==> (a+1) x\n\/\/\/ ax + bx ==> (a + b) x\n\/\/\/\nHandle PlusLink::reduce(void)\n{\n\t\/\/ First, let FoldLink do its stuff.\n\tHandle fold = FoldLink::reduce();\n\n\tif (PLUS_LINK != fold->getType()) return fold;\n\n\tPlusLinkPtr pfold(PlusLinkCast(fold));\n\tfold = pfold->reorder();\n\n\t\/\/ Now, look for repeated atoms, two atoms that appear twice\n\t\/\/ in the outgoing set. If they do, then can be mutliplied.\n\tLinkPtr lfold(LinkCast(fold));\n\n\tbool do_reduce = false;\n\tHandle reduct = Handle::UNDEFINED;\n\n\tconst HandleSeq& ofs = lfold->getOutgoingSet();\n\tsize_t fsz = ofs.size();\n\tfor (size_t i = 0; i < fsz; i++)\n\t{\n\t\tconst Handle& fi = ofs[i];\n\t\tfor (size_t j=i+1; j < fsz; j++)\n\t\t{\n\t\t\tconst Handle& fj = ofs[j];\n\n\t\t\t\/\/ Is atom in position i identical to atom in position j?\n\t\t\t\/\/ If so, then replace by 2*i\n\t\t\tif (fi == fj)\n\t\t\t{\n\t\t\t\tHandle two(createNumberNode(\"2\"));\n\t\t\t\treduct = Handle(createTimesLink(fi, two));\n\t\t\t\tdo_reduce = true;\n\t\t\t}\n\n\t\t\t\/\/ If j is (TimesLink x a) and i is identical to x,\n\t\t\t\/\/ then create (TimesLink x (a+1))\n\t\t\t\/\/\n\t\t\t\/\/ If j is (TimesLink x a) and i is (TimesLink x b)\n\t\t\t\/\/ then create (TimesLink x (a+b))\n\t\t\t\/\/\n\t\t\telse if (fj->getType() == TIMES_LINK)\n\t\t\t{\n\t\t\t\tbool do_add = false;\n\t\t\t\tHandleSeq rest;\n\n\t\t\t\tLinkPtr ilp = LinkCast(fi);\n\t\t\t\tLinkPtr jlp = LinkCast(fj);\n\n\t\t\t\t\/\/ Handle the (a+1) case described above.\n\t\t\t\tif (fi == jlp->getOutgoingAtom(0))\n\t\t\t\t{\n\t\t\t\t\tHandle one(createNumberNode(\"1\"));\n\t\t\t\t\trest.push_back(one);\n\t\t\t\t\tdo_add = true;\n\t\t\t\t}\n\n\t\t\t\t\/\/ Handle the (a+b) case described above.\n\t\t\t\telse if (ilp->getOutgoingAtom(0) == jlp->getOutgoingAtom(0))\n\t\t\t\t{\n\t\t\t\t\tconst HandleSeq& ilpo = ilp->getOutgoingSet();\n\t\t\t\t\tsize_t ilpsz = ilpo.size();\n\t\t\t\t\tfor (size_t k=1; k<ilpsz; k++)\n\t\t\t\t\t\trest.push_back(ilpo[k]);\n\t\t\t\t\tdo_add = true;\n\t\t\t\t}\n\n\t\t\t\tif (do_add)\n\t\t\t\t{\n\t\t\t\t\tconst HandleSeq& jlpo = jlp->getOutgoingSet();\n\t\t\t\t\tsize_t jlpsz = jlpo.size();\n\t\t\t\t\tfor (size_t k=1; k<jlpsz; k++)\n\t\t\t\t\t\trest.push_back(jlpo[k]);\n\n\t\t\t\t\t\/\/ a_plus is now (a+1) or (a+b) as described above.\n\t\t\t\t\tPlusLinkPtr ap = createPlusLink(rest);\n\t\t\t\t\tHandle a_plus(ap->reduce());\n\n\t\t\t\t\treduct = Handle(createTimesLink(fi, a_plus));\n\t\t\t\t\tdo_reduce = true;\n\t\t\t\t}\n\t\t\t}\n\n\t\t\tif (do_reduce)\n\t\t\t{\n\t\t\t\tHandleSeq norm;\n\t\t\t\tnorm.push_back(reduct);\n\n\t\t\t\t\/\/ copy everything else, except for i and j.\n\t\t\t\tfor (size_t k = 0; k< fsz; k++)\n\t\t\t\t{\n\t\t\t\t\tif (k == i or k == j) continue;\n\t\t\t\t\tnorm.push_back(ofs[k]);\n\t\t\t\t}\n\n\t\t\t\tPlusLinkPtr plp = createPlusLink(norm);\n\n\t\t\t\tHandle red(plp->reduce());\n\n\t\t\t\t\/\/ Place the result into the same atomspace we are in.\n\t\t\t\t\/\/ XXX this is bad, buggy, uncomfortable, icky: it pollutes\n\t\t\t\t\/\/ the atomspace with intermediate results. This needs to\n\t\t\t\t\/\/ be fixed somehow. Right now, I don't know how.\n\t\t\t\tif (_atomTable)\n\t\t\t\t{\n\t\t\t\t\tAtomSpace* as = _atomTable->getAtomSpace();\n\t\t\t\t\treturn as->addAtom(red);\n\t\t\t\t}\n\t\t\t\treturn red;\n\t\t\t}\n\t\t}\n\t}\n\n\treturn fold;\n}\n<|endoftext|>"} {"text":"<commit_before>\/\/ Copyright (c) 2015\n\/\/ Author: Chrono Law\n#include <std.hpp>\nusing namespace std;\n\n#include <boost\/core\/lightweight_test.hpp>\n#include <boost\/utility.hpp>\n#include <boost\/dynamic_bitset.hpp>\nusing namespace boost;\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nvoid case1()\n{\n dynamic_bitset<> db1;\n dynamic_bitset<> db2(10);\n dynamic_bitset<> db3(0x16,\n BOOST_BINARY(10101)); \/\/注意这里\n dynamic_bitset<> db4(string(\"0100\"));\n dynamic_bitset<> db5(db3);\n\n dynamic_bitset<> db6;\n db6 = db4;\n\n cout << hex << db5.to_ulong() << endl;\n cout << db4[0] << db4[1] << db4[2] << endl;\n\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nvoid case2()\n{\n dynamic_bitset<> db;\n\n db.resize(10, true);\n cout << db << endl;\n\n db.resize(5);\n cout << db << endl;\n\n {\n dynamic_bitset<> db(5,BOOST_BINARY(01110));\n\n cout << db << endl;\n assert(db.size() == 5);\n\n db.clear();\n assert(db.empty()&& db.size()==0);\n\n }\n\n assert(dynamic_bitset<>(64).num_blocks()==1);\n assert(dynamic_bitset<>(65).num_blocks()==2);\n\n {\n dynamic_bitset<> db(5,BOOST_BINARY(01001));\n db.push_back(true);\n assert(db.to_ulong() == BOOST_BINARY_UL(101001));\n\n }\n\n {\n dynamic_bitset<> db(5,BOOST_BINARY(01001));\n db.append(BOOST_BINARY(101));\n assert(db.size() == sizeof(unsigned long)*8 + 5);\n cout << db << endl; \/\/0000000000000000000000000000010101001\n\n }\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nvoid case3()\n{\n dynamic_bitset<> db1(4, BOOST_BINARY(1010));\n\n db1[0] &= 1;\n db1[1] ^= 1;\n cout << db1 << endl;\n\n dynamic_bitset<> db2(4, BOOST_BINARY(0101));\n assert(db1 > db2);\n\n cout << (db1 ^ db2) << endl;\n cout << (db1 | db2) << endl;\n\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nvoid case4()\n{\n dynamic_bitset<> db(4, BOOST_BINARY(0101));\n\n assert(db.test(0) && !db.test(1));\n assert(db.any() && !db.none());\n assert(db.count() == 2);\n\n {\n dynamic_bitset<> db(4, BOOST_BINARY(0101));\n\n db.flip();\n assert(db.to_ulong() == BOOST_BINARY(1010));\n\n db.set();\n assert(!db.none());\n\n db.reset();\n assert(!db.any() );\n\n db.set(1, 1);\n assert(db.count() == 1);\n\n }\n\n {\n dynamic_bitset<> db(5, BOOST_BINARY(00101));\n\n auto pos = db.find_first();\n assert(pos == 0);\n\n pos = db.find_next(pos);\n assert(pos == 2);\n\n }\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nvoid case5()\n{\n dynamic_bitset<> db(10, BOOST_BINARY(1010101));\n cout << db.to_ulong() << endl; \/\/85\n\n db.append(10);\n cout << db.to_ulong() << endl;\n\n db.push_back(1);\n \/\/cout << db.to_ulong() << endl;\n BOOST_TEST_THROWS(db.to_ulong(), std::overflow_error);\n\n string str;\n to_string(db, str);\n cout << str << endl;\n\n dump_to_string(db , str);\n cout << str << endl;\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nvoid case6()\n{\n dynamic_bitset<> db1(5, BOOST_BINARY(10101));\n dynamic_bitset<> db2(5, BOOST_BINARY(10010));\n\n cout << (db1 | db2) << endl;\n cout << (db1 & db2) << endl;\n cout << (db1 - db2) << endl;\n\n dynamic_bitset<> db3(5, BOOST_BINARY(101));\n assert(db3.is_proper_subset_of(db1));\n\n dynamic_bitset<> db4(db2);\n assert(db4.is_subset_of(db2));\n assert(!db4.is_proper_subset_of(db2));\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nvoid func(int n)\n{\n \/\/cout << \"test \" << n << endl;\n\n dynamic_bitset<> db(n);\n db.set();\n \/\/cout << db.size() << endl;\n\n for (dynamic_bitset<>::size_type i = db.find_next(1);\n i != dynamic_bitset<>::npos ;\n i = db.find_next(i ) )\n {\n for (dynamic_bitset<>::size_type j = db.find_next(i);\n j != dynamic_bitset<>::npos ;\n j = db.find_next(j ))\n {\n if ( j % i == 0)\n {\n db[j] = 0;\n }\n }\n }\n\n cout << dec ;\n for (dynamic_bitset<>::size_type i = db.find_next(2);\n i != dynamic_bitset<>::npos ;\n i = db.find_next(i) )\n {\n cout << i << \", \";\n }\n\n}\n\nvoid case7()\n{\n func(10);\n func(50);\n}\n\nint main()\n{\n case1();\n case2();\n case3();\n case4();\n case5();\n case6();\n case7();\n}\n<commit_msg>dynamic bitest todo 171 fix<commit_after>\/\/ Copyright (c) 2015\n\/\/ Author: Chrono Law\n#include <std.hpp>\nusing namespace std;\n\n#include <boost\/core\/lightweight_test.hpp>\n#include <boost\/utility.hpp>\n#include <boost\/dynamic_bitset.hpp>\nusing namespace boost;\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nvoid case1()\n{\n dynamic_bitset<> db1;\n dynamic_bitset<> db2(10);\n dynamic_bitset<> db3(0x16,\n BOOST_BINARY(10101)); \/\/注意这里\n dynamic_bitset<> db4(string(\"0100\"));\n dynamic_bitset<> db5(db3);\n\n dynamic_bitset<> db6;\n db6 = db4;\n\n cout << hex << db5.to_ulong() << endl;\n cout << db4[0] << db4[1] << db4[2] << endl;\n\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nvoid case2()\n{\n dynamic_bitset<> db;\n\n db.resize(10, true);\n cout << db << endl;\n\n db.resize(5);\n cout << db << endl;\n\n {\n dynamic_bitset<> db(5,BOOST_BINARY(01110));\n\n cout << db << endl;\n assert(db.size() == 5);\n\n db.clear();\n assert(db.empty()&& db.size()==0);\n\n }\n\n assert(dynamic_bitset<>(64).num_blocks()==1);\n assert(dynamic_bitset<>(65).num_blocks()==2);\n\n {\n dynamic_bitset<> db(5,BOOST_BINARY(01001));\n db.push_back(true);\n assert(db.to_ulong() == BOOST_BINARY_UL(101001));\n\n }\n\n {\n dynamic_bitset<> db(5,BOOST_BINARY(01001));\n db.append(BOOST_BINARY(101));\n assert(db.size() == sizeof(unsigned long)*8 + 5);\n cout << db << endl; \/\/0000000000000000000000000000010101001\n\n }\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nvoid case3()\n{\n dynamic_bitset<> db1(4, BOOST_BINARY(1010));\n\n db1[0] &= 1;\n db1[1] ^= 1;\n cout << db1 << endl;\n\n dynamic_bitset<> db2(4, BOOST_BINARY(0101));\n assert(db1 > db2);\n\n cout << (db1 ^ db2) << endl;\n cout << (db1 | db2) << endl;\n\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nvoid case4()\n{\n dynamic_bitset<> db(4, BOOST_BINARY(0101));\n\n assert(db.test(0) && !db.test(1));\n assert(db.any() && !db.none());\n assert(db.count() == 2);\n\n {\n dynamic_bitset<> db(4, BOOST_BINARY(0101));\n\n db.flip();\n assert(db.to_ulong() == BOOST_BINARY(1010));\n\n db.set();\n assert(!db.none());\n\n db.reset();\n assert(!db.any() );\n\n db.set(1, 1);\n assert(db.count() == 1);\n\n }\n\n {\n dynamic_bitset<> db(5, BOOST_BINARY(00101));\n\n auto pos = db.find_first();\n assert(pos == 0);\n\n pos = db.find_next(pos);\n assert(pos == 2);\n\n }\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nvoid case5()\n{\n dynamic_bitset<> db(10, BOOST_BINARY(1010101));\n cout << db.to_ulong() << endl; \/\/85\n\n db.append(10);\n cout << db.to_ulong() << endl;\n\n \/\/ todo 171 fix\n \/\/db.push_back(1);\n \/\/cout << db.to_ulong() << endl;\n \/\/BOOST_TEST_THROWS(db.to_ulong(), std::overflow_error);\n\n string str;\n to_string(db, str);\n cout << str << endl;\n\n dump_to_string(db , str);\n cout << str << endl;\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nvoid case6()\n{\n dynamic_bitset<> db1(5, BOOST_BINARY(10101));\n dynamic_bitset<> db2(5, BOOST_BINARY(10010));\n\n cout << (db1 | db2) << endl;\n cout << (db1 & db2) << endl;\n cout << (db1 - db2) << endl;\n\n dynamic_bitset<> db3(5, BOOST_BINARY(101));\n assert(db3.is_proper_subset_of(db1));\n\n dynamic_bitset<> db4(db2);\n assert(db4.is_subset_of(db2));\n assert(!db4.is_proper_subset_of(db2));\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nvoid func(int n)\n{\n \/\/cout << \"test \" << n << endl;\n\n dynamic_bitset<> db(n);\n db.set();\n \/\/cout << db.size() << endl;\n\n for (dynamic_bitset<>::size_type i = db.find_next(1);\n i != dynamic_bitset<>::npos ;\n i = db.find_next(i ) )\n {\n for (dynamic_bitset<>::size_type j = db.find_next(i);\n j != dynamic_bitset<>::npos ;\n j = db.find_next(j ))\n {\n if ( j % i == 0)\n {\n db[j] = 0;\n }\n }\n }\n\n cout << dec ;\n for (dynamic_bitset<>::size_type i = db.find_next(2);\n i != dynamic_bitset<>::npos ;\n i = db.find_next(i) )\n {\n cout << i << \", \";\n }\n\n}\n\nvoid case7()\n{\n func(10);\n func(50);\n}\n\nint main()\n{\n case1();\n case2();\n case3();\n case4();\n case5();\n case6();\n case7();\n}\n<|endoftext|>"} {"text":"<commit_before>\/*\n * kinetic-cpp-examples\n * Copyright (C) 2014 Seagate Technology.\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\n#include <stdio.h>\n#include <stdlib.h>\n#include <memory>\n#include <vector>\n\n#include \"kinetic\/kinetic.h\"\n\nstatic const int kP2PBatchSize = 10;\nusing kinetic::KineticConnectionFactory;\nusing kinetic::Status;\nusing kinetic::KineticRecord;\n\nusing std::shared_ptr;\nusing std::make_shared;\nusing std::string;\nusing std::unique_ptr;\nusing std::vector;\nusing std::pair;\nusing std::make_pair;\n\nkinetic::P2PPushRequest prepare_request(const vector<kinetic::P2PPushOperation>& operations, const vector<pair<string, int>>& destinations, size_t currentDestination) {\n kinetic::P2PPushRequest request;\n\n request.host = destinations[currentDestination].first;\n request.port = destinations[currentDestination].second;\n\n request.operations = operations;\n\n if (currentDestination < destinations.size() - 1) {\n \/\/ Add the pipleline request onto this request's first operation\n request.operations[request.operations.size() - 1].request = make_shared<::kinetic::P2PPushRequest>(\n prepare_request(operations, destinations, currentDestination + 1));\n }\n\n return request;\n}\n\nvoid dispatch_request(shared_ptr<kinetic::BlockingKineticConnection> connection,\n const vector<kinetic::P2PPushOperation>& operations,\n const vector<pair<string, int>>& destinations) {\n kinetic::P2PPushRequest request = prepare_request(operations, destinations, 0);\n\n unique_ptr<vector<kinetic::KineticStatus>> statuses(new vector<kinetic::KineticStatus>());\n auto status = connection->P2PPush(request, statuses);\n if (!status.ok()) {\n printf(\"Error pushing: %d, %s\\n\", status.statusCode(), status.message().c_str());\n exit(1);\n }\n\n for (auto it = statuses->begin(); it != statuses->end(); ++it) {\n if (it->ok()) {\n printf(\".\");\n } else {\n printf(\"%s\", it->message().c_str());\n }\n }\n fflush(stdout);\n}\n\nint main(int argc, char* argv[]) {\n if (argc < 5 || argc % 2 != 1) {\n printf(\"%s: <source host> <source port> <destination host> <destination port> [<additional host> <additional port> ... ]\\n\", argv[0]);\n return 1;\n }\n\n const char* source_host = argv[1];\n int source_port = atoi(argv[2]);\n\n vector<pair<string, int>> destinations;\n\n printf(\"Copying from %s:%d\", source_host, source_port);\n\n for (int i = 3; i < argc; i += 2) {\n auto destination = make_pair(argv[i], atoi(argv[i + 1]));\n destinations.push_back(destination);\n printf(\" -> %s:%d\", destination.first, destination.second);\n }\n printf(\"\\n\");\n\n\n kinetic::ConnectionOptions options;\n options.host = source_host;\n options.port = source_port;\n options.user_id = 1;\n options.hmac_key = \"asdfasdf\";\n\n kinetic::KineticConnectionFactory kinetic_connection_factory = kinetic::NewKineticConnectionFactory();\n\n shared_ptr<kinetic::BlockingKineticConnection> blocking_connection;\n if(!kinetic_connection_factory.NewBlockingConnection(options, blocking_connection, 20).ok()){\n printf(\"Unable to connect\\n\");\n return 1;\n }\n\n vector<kinetic::P2PPushOperation> operations;\n\n \/\/ Build a key consisting of \"FFFFFF...\". In almost all cases this will come after the last\n \/\/ key in the drive\n string last_key;\n for (int i = 0; i < 4*1024; i++) {\n last_key += \"\\xFF\";\n }\n\n \/\/ Iterate over all the keys and print them out\n for (kinetic::KeyRangeIterator it = blocking_connection->IterateKeyRange(\"\", true, last_key, true, 100); it != kinetic::KeyRangeEnd(); ++it) {\n kinetic::P2PPushOperation op;\n op.key = *it;\n op.force = true;\n op.newKey = *it;\n operations.push_back(op);\n\n if (operations.size() > kP2PBatchSize) {\n dispatch_request(blocking_connection, operations, destinations);\n operations.clear();\n }\n }\n\n dispatch_request(blocking_connection, operations, destinations);\n\n printf(\"\\n\");\n\n\n\n return 0;\n}\n\n<commit_msg>More compiler friendly.<commit_after>\/*\n * kinetic-cpp-examples\n * Copyright (C) 2014 Seagate Technology.\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\n#include <stdio.h>\n#include <stdlib.h>\n#include <memory>\n#include <vector>\n\n#include \"kinetic\/kinetic.h\"\n\nstatic const int kP2PBatchSize = 10;\nusing kinetic::KineticConnectionFactory;\nusing kinetic::Status;\nusing kinetic::KineticRecord;\nusing kinetic::P2PPushRequest;\n\nusing std::shared_ptr;\nusing std::make_shared;\nusing std::string;\nusing std::unique_ptr;\nusing std::vector;\nusing std::pair;\nusing std::make_pair;\n\nkinetic::P2PPushRequest prepare_request(const vector<kinetic::P2PPushOperation>& operations, const vector<pair<string, int>>& destinations, size_t currentDestination) {\n kinetic::P2PPushRequest request;\n\n request.host = destinations[currentDestination].first;\n request.port = destinations[currentDestination].second;\n\n request.operations = operations;\n\n if (currentDestination < destinations.size() - 1) {\n \/\/ Add the pipleline request onto this request's first operation\n request.operations[request.operations.size() - 1].request = make_shared< P2PPushRequest >(\n prepare_request(operations, destinations, currentDestination + 1));\n }\n\n return request;\n}\n\nvoid dispatch_request(shared_ptr<kinetic::BlockingKineticConnection> connection,\n const vector<kinetic::P2PPushOperation>& operations,\n const vector<pair<string, int>>& destinations) {\n kinetic::P2PPushRequest request = prepare_request(operations, destinations, 0);\n\n unique_ptr<vector<kinetic::KineticStatus>> statuses(new vector<kinetic::KineticStatus>());\n auto status = connection->P2PPush(request, statuses);\n if (!status.ok()) {\n printf(\"Error pushing: %d, %s\\n\", status.statusCode(), status.message().c_str());\n exit(1);\n }\n\n for (auto it = statuses->begin(); it != statuses->end(); ++it) {\n if (it->ok()) {\n printf(\".\");\n } else {\n printf(\"%s\", it->message().c_str());\n }\n }\n fflush(stdout);\n}\n\nint main(int argc, char* argv[]) {\n if (argc < 5 || argc % 2 != 1) {\n printf(\"%s: <source host> <source port> <destination host> <destination port> [<additional host> <additional port> ... ]\\n\", argv[0]);\n return 1;\n }\n\n const char* source_host = argv[1];\n int source_port = atoi(argv[2]);\n\n vector<pair<string, int>> destinations;\n\n printf(\"Copying from %s:%d\", source_host, source_port);\n\n for (int i = 3; i < argc; i += 2) {\n auto destination = make_pair(argv[i], atoi(argv[i + 1]));\n destinations.push_back(destination);\n printf(\" -> %s:%d\", destination.first, destination.second);\n }\n printf(\"\\n\");\n\n\n kinetic::ConnectionOptions options;\n options.host = source_host;\n options.port = source_port;\n options.user_id = 1;\n options.hmac_key = \"asdfasdf\";\n\n kinetic::KineticConnectionFactory kinetic_connection_factory = kinetic::NewKineticConnectionFactory();\n\n shared_ptr<kinetic::BlockingKineticConnection> blocking_connection;\n if(!kinetic_connection_factory.NewBlockingConnection(options, blocking_connection, 20).ok()){\n printf(\"Unable to connect\\n\");\n return 1;\n }\n\n vector<kinetic::P2PPushOperation> operations;\n\n \/\/ Build a key consisting of \"FFFFFF...\". In almost all cases this will come after the last\n \/\/ key in the drive\n string last_key;\n for (int i = 0; i < 4*1024; i++) {\n last_key += \"\\xFF\";\n }\n\n \/\/ Iterate over all the keys and print them out\n for (kinetic::KeyRangeIterator it = blocking_connection->IterateKeyRange(\"\", true, last_key, true, 100); it != kinetic::KeyRangeEnd(); ++it) {\n kinetic::P2PPushOperation op;\n op.key = *it;\n op.force = true;\n op.newKey = *it;\n operations.push_back(op);\n\n if (operations.size() > (size_t)kP2PBatchSize) {\n dispatch_request(blocking_connection, operations, destinations);\n operations.clear();\n }\n }\n\n dispatch_request(blocking_connection, operations, destinations);\n\n printf(\"\\n\");\n\n\n\n return 0;\n}\n\n<|endoftext|>"} {"text":"<commit_before>\/\/ Copyright Andrew Resch 2008. 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\/ip_filter.hpp>\n#include <boost\/python.hpp>\n#include \"gil.hpp\"\n\nusing namespace boost::python;\nusing namespace libtorrent;\n\nnamespace\n{\n void add_rule(ip_filter& filter, std::string start, std::string end, int flags)\n {\n return filter.add_rule(address::from_string(start), address::from_string(end), flags);\n }\n \n int _access(ip_filter& filter, std::string addr)\n {\n return filter.access(address::from_string(addr));\n }\n}\n\nvoid bind_ip_filter()\n{\n class_<ip_filter>(\"ip_filter\")\n .def(\"add_rule\", add_rule)\n .def(\"access\", _access)\n .def(\"export_filter\", allow_threads(&ip_filter::export_filter))\n ;\n}\n\n<commit_msg>Fix building in windows<commit_after>\/\/ Copyright Andrew Resch 2008. 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\/ip_filter.hpp>\n#include <boost\/python.hpp>\n#include \"gil.hpp\"\n\nusing namespace boost::python;\nusing namespace libtorrent;\n\nnamespace\n{\n void add_rule(ip_filter& filter, std::string start, std::string end, int flags)\n {\n return filter.add_rule(address::from_string(start), address::from_string(end), flags);\n }\n\n int access0(ip_filter& filter, std::string addr)\n {\n return filter.access(address::from_string(addr));\n }\n}\n\nvoid bind_ip_filter()\n{\n class_<ip_filter>(\"ip_filter\")\n .def(\"add_rule\", add_rule)\n .def(\"access\", access0)\n .def(\"export_filter\", allow_threads(&ip_filter::export_filter))\n ;\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 \"pyAbstract.hpp\"\n\n#include \"LIEF\/Abstract\/Parser.hpp\"\n\n#include <string>\n\nnamespace LIEF {\ntemplate<>\nvoid create<Parser>(py::module& m) {\n\n m.def(\"parse\",\n [] (py::bytes bytes, const std::string& name) {\n std::string raw_str = bytes;\n std::vector<uint8_t> raw = {\n std::make_move_iterator(std::begin(raw_str)),\n std::make_move_iterator(std::end(raw_str))\n };\n return Parser::parse(std::move(raw), name);\n },\n \"Parse the given binary and return a \" RST_CLASS_REF(lief.Binary) \" object\",\n \"raw\"_a, \"name\"_a = \"\",\n py::return_value_policy::take_ownership);\n\n m.def(\"parse\",\n static_cast<std::unique_ptr<Binary> (*) (const std::string&)>(&Parser::parse),\n \"Parse the given binary and return a \" RST_CLASS_REF(lief.Binary) \" object\",\n \"filepath\"_a,\n py::return_value_policy::take_ownership);\n\n m.def(\"parse\",\n static_cast<std::unique_ptr<Binary> (*) (const std::vector<uint8_t>&, const std::string&)>(&Parser::parse),\n \"Parse the given binary and return a \" RST_CLASS_REF(lief.Binary) \" object\",\n \"raw\"_a, \"name\"_a = \"\",\n py::return_value_policy::take_ownership);\n\n\n\n m.def(\"parse\",\n [] (py::object byteio, const std::string& name) {\n auto&& io = py::module::import(\"io\");\n auto&& RawIOBase = io.attr(\"RawIOBase\");\n auto&& BufferedIOBase = io.attr(\"BufferedIOBase\");\n auto&& TextIOBase = io.attr(\"TextIOBase\");\n\n py::object rawio;\n\n\n if (py::isinstance(byteio, RawIOBase)) {\n rawio = byteio;\n }\n\n else if (py::isinstance(byteio, BufferedIOBase)) {\n rawio = byteio.attr(\"raw\");\n }\n\n else if (py::isinstance(byteio, TextIOBase)) {\n rawio = byteio.attr(\"buffer\").attr(\"raw\");\n }\n\n else {\n throw py::type_error(py::repr(byteio).cast<std::string>().c_str());\n }\n\n std::string raw_str = static_cast<py::bytes>(rawio.attr(\"readall\")());\n std::vector<uint8_t> raw = {\n std::make_move_iterator(std::begin(raw_str)),\n std::make_move_iterator(std::end(raw_str))\n };\n\n return Parser::parse(std::move(raw), name);\n },\n \"io\"_a,\n \"name\"_a = \"\",\n py::return_value_policy::take_ownership);\n}\n}\n<commit_msg>feature: release the GIL on parse<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 \"pyAbstract.hpp\"\n\n#include \"LIEF\/Abstract\/Parser.hpp\"\n\n#include <string>\n\nnamespace LIEF {\ntemplate<>\nvoid create<Parser>(py::module& m) {\n\n m.def(\"parse\",\n [] (py::bytes bytes, const std::string& name) {\n std::string raw_str = bytes;\n std::vector<uint8_t> raw = {\n std::make_move_iterator(std::begin(raw_str)),\n std::make_move_iterator(std::end(raw_str))\n };\n std::unique_ptr<Binary> binary;\n Py_BEGIN_ALLOW_THREADS\n binary = Parser::parse(std::move(raw), name);\n Py_END_ALLOW_THREADS\n return binary;\n },\n \"Parse the given binary and return a \" RST_CLASS_REF(lief.Binary) \" object\",\n \"raw\"_a, \"name\"_a = \"\",\n py::return_value_policy::take_ownership);\n\n m.def(\"parse\",\n [] (const std::string& name) {\n std::unique_ptr<Binary> binary;\n Py_BEGIN_ALLOW_THREADS\n binary = Parser::parse(name);\n Py_END_ALLOW_THREADS\n return binary;\n },\n \"Parse the given binary and return a \" RST_CLASS_REF(lief.Binary) \" object\",\n \"filepath\"_a,\n py::return_value_policy::take_ownership);\n\n m.def(\"parse\",\n [](const std::vector<uint8_t>& raw, const std::string& name) {\n std::unique_ptr<Binary> binary;\n Py_BEGIN_ALLOW_THREADS\n binary = Parser::parse(raw, name);\n Py_END_ALLOW_THREADS\n return binary;\n },\n \"Parse the given binary and return a \" RST_CLASS_REF(lief.Binary) \" object\",\n \"raw\"_a, \"name\"_a = \"\",\n py::return_value_policy::take_ownership);\n\n\n\n m.def(\"parse\",\n [] (py::object byteio, const std::string& name) {\n auto&& io = py::module::import(\"io\");\n auto&& RawIOBase = io.attr(\"RawIOBase\");\n auto&& BufferedIOBase = io.attr(\"BufferedIOBase\");\n auto&& TextIOBase = io.attr(\"TextIOBase\");\n\n py::object rawio;\n\n\n if (py::isinstance(byteio, RawIOBase)) {\n rawio = byteio;\n }\n\n else if (py::isinstance(byteio, BufferedIOBase)) {\n rawio = byteio.attr(\"raw\");\n }\n\n else if (py::isinstance(byteio, TextIOBase)) {\n rawio = byteio.attr(\"buffer\").attr(\"raw\");\n }\n\n else {\n throw py::type_error(py::repr(byteio).cast<std::string>().c_str());\n }\n\n std::string raw_str = static_cast<py::bytes>(rawio.attr(\"readall\")());\n std::vector<uint8_t> raw = {\n std::make_move_iterator(std::begin(raw_str)),\n std::make_move_iterator(std::end(raw_str))\n };\n\n std::unique_ptr<Binary> binary;\n Py_BEGIN_ALLOW_THREADS\n binary = Parser::parse(std::move(raw), name);\n Py_END_ALLOW_THREADS\n return binary;\n },\n \"io\"_a,\n \"name\"_a = \"\",\n py::return_value_policy::take_ownership);\n}\n}\n<|endoftext|>"} {"text":"<commit_before><commit_msg>small updates in fitting<commit_after><|endoftext|>"} {"text":"<commit_before>#include \"logger.h\" \/\/ we implement this\n\n#include \"stream.h\" \/\/ for tinfra::err\n#include \"trace.h\" \/\/ for TINFRA_NULL_SOURCE_LOCATION\n#include \"path.h\" \/\/ for basename\n#include \"exeinfo.h\" \/\/ for get_exepath\n#include \"thread.h\"\n\n#ifdef _WIN32\n#undef ERROR \/\/ defined by WINGDI\n#endif\n\n#include <time.h>\n#include <sstream> \/\/ for ostringstream\n#include <unistd.h> \/\/for getpid, win32 defaund yourself\n\nnamespace tinfra {\n\n\/\/\n\/\/ log_xxx routines\n\/\/\n\nvoid log_info(tstring const& m) { logger().info(m); }\nvoid log_info(tstring const& m, tinfra::trace::location const& loc) { logger().info(m,loc); }\n\nvoid log_warning(tstring const& m) { logger().warning(m); }\nvoid log_warning(tstring const& m, tinfra::trace::location const& loc) { logger().warning(m,loc); }\n\nvoid log_error(tstring const& m) { logger().error(m); }\nvoid log_error(tstring const& m, tinfra::trace::location const& loc) { logger().error(m,loc); }\n\nvoid log_fail(tstring const& m) { logger().fail(m); }\nvoid log_fail(tstring const& m, tinfra::trace::location const& loc) { logger().fail(m,loc); }\n\n\/\/\n\/\/ logger implementation\n\/\/\n\nlogger::logger():\n handler(log_handler::get_default()),\n component(\"\")\n{\n}\nlogger::logger(tstring const& c):\n handler(log_handler::get_default()),\n component(c)\n{\n}\n\nlogger::logger(log_handler& h):\n handler(h),\n component(\"\")\n{\n}\n\nlogger::logger(tstring const& c, log_handler& h):\n handler(h),\n component(c)\n{\n}\n\nlogger::~logger()\n{\n}\n\nvoid logger::log(log_level level, tstring const& m, tinfra::trace::location const& loc)\n{\n log_record record;\n record.level = level;\n record.component = this->component;\n record.message = m;\n ::time(&record.timestamp);\n record.location = loc;\n \n this->handler.log(record);\n}\n\nvoid logger::trace(tstring const& message)\n{\n this->log(TRACE, message, TINFRA_NULL_SOURCE_LOCATION);\n}\n\nvoid logger::trace(tstring const& message, tinfra::trace::location const& loc)\n{\n this->log(TRACE, message, loc);\n}\n\nvoid logger::info(tstring const& message)\n{\n this->log(tinfra::INFO, message, TINFRA_NULL_SOURCE_LOCATION);\n}\nvoid logger::info(tstring const& message, tinfra::trace::location const& loc)\n{\n this->log(tinfra::INFO, message, loc);\n}\n\nvoid logger::warning(tstring const& message)\n{\n this->log(tinfra::WARNING, message, TINFRA_NULL_SOURCE_LOCATION);\n}\nvoid logger::warning(tstring const& message, tinfra::trace::location const& loc)\n{\n this->log(tinfra::WARNING, message, loc);\n}\n\nvoid logger::error(tstring const& message)\n{\n this->log(tinfra::ERROR, message, TINFRA_NULL_SOURCE_LOCATION);\n}\nvoid logger::error(tstring const& message, tinfra::trace::location const& loc)\n{\n this->log(tinfra::ERROR, message, loc);\n}\n\nvoid logger::fail(tstring const& message)\n{\n this->log(tinfra::FAIL, message, TINFRA_NULL_SOURCE_LOCATION);\n}\nvoid logger::fail(tstring const& message, tinfra::trace::location const& loc)\n{\n this->log(tinfra::FAIL, message, loc);\n}\n\nstatic const char* log_level_to_string(log_level level)\n{\n switch( level ) {\n case FATAL: return \"FATAL\";\n case FAIL: return \"FAIL\";\n case ERROR: return \"ERROR\";\n case NOTICE: return \"NOTICE\";\n case WARNING: return \"WARNING\";\n case INFO: return \"INFO\";\n case TRACE: return \"TRACE\";\n default: return \"-\"; \n }\n}\n\n\/\/\n\/\/ generic_log_handler\n\/\/\ngeneric_log_handler::generic_log_handler(tinfra::output_stream& o):\n out(o)\n{\n}\ngeneric_log_handler::~generic_log_handler()\n{\n}\n\nstatic void print_log_header(std::ostream& formatter, log_record const& record)\n{\n using tinfra::path::basename;\n using tinfra::get_exepath;\n \/\/ well hardcoded, but why not\n \/\/ YYYY-MM-DD HH:MM:SS name[pid] level(component::func:source:line): message\n \n \/\/ date\n const char* LOG_TIME_FORMAT = \"%Y-%m-%d %H:%M:%S\";\n {\n \n struct tm exploded_time;\n#ifdef HAVE_LOCALTIME_R\n localtime_r(&record.timestamp, &exploded_time);\n#else\n struct tm* exploded_time2 = localtime(&record.timestamp);\n exploded_time = *exploded_time2;\n#endif\n char strtime_buf[256];\n strftime(strtime_buf, sizeof(strtime_buf), LOG_TIME_FORMAT, &exploded_time);\n formatter << strtime_buf << ' '; \n }\n \n \/\/ process name\n formatter << basename(get_exepath());\n \n \/\/ pid\n const bool show_pid = true;\n const bool show_tid = false;\n if( show_pid || show_tid ) {\n formatter << '[';\n if( show_pid ) \n formatter << getpid();\n if( show_pid && show_tid ) \n formatter << '\/';\n if( show_tid )\n formatter << \"tid=\" << tinfra::thread::thread::current().to_number();\n formatter << \"] \";\n }\n \n \/\/ level\n formatter << log_level_to_string(record.level);\n \n if( !record.component.empty() || record.location.name != 0 || record.location.filename != 0 ) {\n formatter << \"(\";\n \n \/\/ component\/func\/source location or -\n if( !record.component.empty() ) {\n formatter << record.component;\n }\n if( record.location.name != 0 ) {\n if( !record.component.empty() )\n formatter << \"::\";\n formatter << record.location.name;\n }\n if( record.location.filename != 0 ) {\n formatter << ':' << record.location.filename << ':' << record.location.line; \n }\n formatter << ')';\n }\n \n \n \/\/ message\n formatter << \": \";\n \n}\n\nstatic void print_maybe_multiline(tstring const& PS1, tstring const& PS2, tstring const& message, tinfra::output_stream& out)\n{\n \/\/ TODO: implement \"multiline behaviour\"\n size_t start = 0;\n bool finished = false;\n do {\n if( start == message.size() ) break;\n \n size_t eol = message.find_first_of('\\n', start);\n size_t len;\n if( eol == std::string::npos ) {\n if( start != message.size()-1 ) {\n len = std::string::npos;\n finished = true;\n } else {\n return;\n }\n } else { \n size_t pi = eol;\n if( pi > start+1 && message[eol-1] == '\\r' ) --pi;\n len = pi-start;\n }\n if( len != 0 ) {\n \/\/ TODO: create tinfra string builders\n std::ostringstream tmp;\n tmp << (start == 0 ? PS1: PS2) << message.substr(start, len) << std::endl;\n std::string const stmp = tmp.str();\n out.write(stmp.data(), stmp.size());\n }\n start = eol+1;\n } while( !finished );\n}\n\nstatic void print_maybe_multiline(tstring const& prefix, tstring const& message, tinfra::output_stream& out)\n{\n print_maybe_multiline(prefix,prefix,message,out);\n}\n\nvoid generic_log_handler::log(log_record const& record)\n{\n std::ostringstream formatter;\n print_log_header(formatter, record); \n const std::string header = formatter.str();\n \n print_maybe_multiline( header, header, record.message, this->out );\n}\n\n\/\/\n\/\/ log_handler\n\/\/\n\nstatic generic_log_handler cerr_log_handler(tinfra::err);\n\nstatic log_handler* custom_log_handler = 0;\n\nlog_handler::~log_handler()\n{\n}\n\n\/\/ singleton interface\nlog_handler& log_handler::get_default()\n{\n if( custom_log_handler != 0 ){\n return *custom_log_handler;\n \n } else {\n return cerr_log_handler;\n }\n}\n\nvoid log_handler::set_default(log_handler* h)\n{\n custom_log_handler = h;\n}\n\n} \/\/ end namespace tinfra\n\n<commit_msg>* logger: ported to w32<commit_after>#include \"logger.h\" \/\/ we implement this\n\n#include \"stream.h\" \/\/ for tinfra::err\n#include \"trace.h\" \/\/ for TINFRA_NULL_SOURCE_LOCATION\n#include \"path.h\" \/\/ for basename\n#include \"exeinfo.h\" \/\/ for get_exepath\n#include \"thread.h\"\n\n#ifdef _WIN32\n#undef ERROR \/\/ defined by WINGDI\n#endif\n\n#ifndef HAVE_PID\n#ifdef _WIN32\n#include <windows.h>\n#endif\n#else\n#include <unistd.h>\n#endif\n\n#include <time.h>\n#include <sstream> \/\/ for ostringstream\n\nnamespace tinfra {\n\n\/\/\n\/\/ log_xxx routines\n\/\/\n\nvoid log_info(tstring const& m) { logger().info(m); }\nvoid log_info(tstring const& m, tinfra::trace::location const& loc) { logger().info(m,loc); }\n\nvoid log_warning(tstring const& m) { logger().warning(m); }\nvoid log_warning(tstring const& m, tinfra::trace::location const& loc) { logger().warning(m,loc); }\n\nvoid log_error(tstring const& m) { logger().error(m); }\nvoid log_error(tstring const& m, tinfra::trace::location const& loc) { logger().error(m,loc); }\n\nvoid log_fail(tstring const& m) { logger().fail(m); }\nvoid log_fail(tstring const& m, tinfra::trace::location const& loc) { logger().fail(m,loc); }\n\n\/\/\n\/\/ logger implementation\n\/\/\n\nlogger::logger():\n handler(log_handler::get_default()),\n component(\"\")\n{\n}\nlogger::logger(tstring const& c):\n handler(log_handler::get_default()),\n component(c)\n{\n}\n\nlogger::logger(log_handler& h):\n handler(h),\n component(\"\")\n{\n}\n\nlogger::logger(tstring const& c, log_handler& h):\n handler(h),\n component(c)\n{\n}\n\nlogger::~logger()\n{\n}\n\nvoid logger::log(log_level level, tstring const& m, tinfra::trace::location const& loc)\n{\n log_record record;\n record.level = level;\n record.component = this->component;\n record.message = m;\n ::time(&record.timestamp);\n record.location = loc;\n \n this->handler.log(record);\n}\n\nvoid logger::trace(tstring const& message)\n{\n this->log(TRACE, message, TINFRA_NULL_SOURCE_LOCATION);\n}\n\nvoid logger::trace(tstring const& message, tinfra::trace::location const& loc)\n{\n this->log(TRACE, message, loc);\n}\n\nvoid logger::info(tstring const& message)\n{\n this->log(tinfra::INFO, message, TINFRA_NULL_SOURCE_LOCATION);\n}\nvoid logger::info(tstring const& message, tinfra::trace::location const& loc)\n{\n this->log(tinfra::INFO, message, loc);\n}\n\nvoid logger::warning(tstring const& message)\n{\n this->log(tinfra::WARNING, message, TINFRA_NULL_SOURCE_LOCATION);\n}\nvoid logger::warning(tstring const& message, tinfra::trace::location const& loc)\n{\n this->log(tinfra::WARNING, message, loc);\n}\n\nvoid logger::error(tstring const& message)\n{\n this->log(tinfra::ERROR, message, TINFRA_NULL_SOURCE_LOCATION);\n}\nvoid logger::error(tstring const& message, tinfra::trace::location const& loc)\n{\n this->log(tinfra::ERROR, message, loc);\n}\n\nvoid logger::fail(tstring const& message)\n{\n this->log(tinfra::FAIL, message, TINFRA_NULL_SOURCE_LOCATION);\n}\nvoid logger::fail(tstring const& message, tinfra::trace::location const& loc)\n{\n this->log(tinfra::FAIL, message, loc);\n}\n\nstatic const char* log_level_to_string(log_level level)\n{\n switch( level ) {\n case FATAL: return \"FATAL\";\n case FAIL: return \"FAIL\";\n case ERROR: return \"ERROR\";\n case NOTICE: return \"NOTICE\";\n case WARNING: return \"WARNING\";\n case INFO: return \"INFO\";\n case TRACE: return \"TRACE\";\n default: return \"-\"; \n }\n}\n\n\/\/\n\/\/ generic_log_handler\n\/\/\ngeneric_log_handler::generic_log_handler(tinfra::output_stream& o):\n out(o)\n{\n}\ngeneric_log_handler::~generic_log_handler()\n{\n}\n#ifndef HAVE_PID\n#ifdef _WIN32\nstatic int getpid() { \n return ::GetCurrentProcessId();\n}\n#endif\n#else\nstatic int getpid() { return -1; }\n#endif\nstatic void print_log_header(std::ostream& formatter, log_record const& record)\n{\n using tinfra::path::basename;\n using tinfra::get_exepath;\n \/\/ well hardcoded, but why not\n \/\/ YYYY-MM-DD HH:MM:SS name[pid] level(component::func:source:line): message\n \n \/\/ date\n const char* LOG_TIME_FORMAT = \"%Y-%m-%d %H:%M:%S\";\n {\n \n struct tm exploded_time;\n#ifdef HAVE_LOCALTIME_R\n localtime_r(&record.timestamp, &exploded_time);\n#else\n struct tm* exploded_time2 = localtime(&record.timestamp);\n exploded_time = *exploded_time2;\n#endif\n char strtime_buf[256];\n strftime(strtime_buf, sizeof(strtime_buf), LOG_TIME_FORMAT, &exploded_time);\n formatter << strtime_buf << ' '; \n }\n \n \/\/ process name\n formatter << basename(get_exepath());\n \n \/\/ pid\n const bool show_pid = true;\n const bool show_tid = false;\n if( show_pid || show_tid ) {\n formatter << '[';\n if( show_pid ) \n formatter << getpid();\n if( show_pid && show_tid ) \n formatter << '\/';\n if( show_tid )\n formatter << \"tid=\" << tinfra::thread::thread::current().to_number();\n formatter << \"] \";\n }\n \n \/\/ level\n formatter << log_level_to_string(record.level);\n \n if( !record.component.empty() || record.location.name != 0 || record.location.filename != 0 ) {\n formatter << \"(\";\n \n \/\/ component\/func\/source location or -\n if( !record.component.empty() ) {\n formatter << record.component;\n }\n if( record.location.name != 0 ) {\n if( !record.component.empty() )\n formatter << \"::\";\n formatter << record.location.name;\n }\n if( record.location.filename != 0 ) {\n formatter << ':' << record.location.filename << ':' << record.location.line; \n }\n formatter << ')';\n }\n \n \n \/\/ message\n formatter << \": \";\n \n}\n\nstatic void print_maybe_multiline(tstring const& PS1, tstring const& PS2, tstring const& message, tinfra::output_stream& out)\n{\n \/\/ TODO: implement \"multiline behaviour\"\n size_t start = 0;\n bool finished = false;\n do {\n if( start == message.size() ) break;\n \n size_t eol = message.find_first_of('\\n', start);\n size_t len;\n if( eol == std::string::npos ) {\n if( start != message.size()-1 ) {\n len = std::string::npos;\n finished = true;\n } else {\n return;\n }\n } else { \n size_t pi = eol;\n if( pi > start+1 && message[eol-1] == '\\r' ) --pi;\n len = pi-start;\n }\n if( len != 0 ) {\n \/\/ TODO: create tinfra string builders\n std::ostringstream tmp;\n tmp << (start == 0 ? PS1: PS2) << message.substr(start, len) << std::endl;\n std::string const stmp = tmp.str();\n out.write(stmp.data(), stmp.size());\n }\n start = eol+1;\n } while( !finished );\n}\n\nstatic void print_maybe_multiline(tstring const& prefix, tstring const& message, tinfra::output_stream& out)\n{\n print_maybe_multiline(prefix,prefix,message,out);\n}\n\nvoid generic_log_handler::log(log_record const& record)\n{\n std::ostringstream formatter;\n print_log_header(formatter, record); \n const std::string header = formatter.str();\n \n print_maybe_multiline( header, header, record.message, this->out );\n}\n\n\/\/\n\/\/ log_handler\n\/\/\n\nstatic generic_log_handler cerr_log_handler(tinfra::err);\n\nstatic log_handler* custom_log_handler = 0;\n\nlog_handler::~log_handler()\n{\n}\n\n\/\/ singleton interface\nlog_handler& log_handler::get_default()\n{\n if( custom_log_handler != 0 ){\n return *custom_log_handler;\n \n } else {\n return cerr_log_handler;\n }\n}\n\nvoid log_handler::set_default(log_handler* h)\n{\n custom_log_handler = h;\n}\n\n} \/\/ end namespace tinfra\n\n<|endoftext|>"} {"text":"<commit_before>#include \"vtpath.h\" \/\/ we implement this\n\n#include \"tinfra\/tstring.h\"\n#include \"tinfra\/any.h\"\n#include \"tinfra\/trace.h\"\n\n#include <vector>\n#include <stack>\n#include <deque>\n#include <iterator>\n#include <string>\n#include <stdexcept>\n\nnamespace tinfra {\n\n\/\/\n\/\/ vtpath_visit\n\/\/ \nstd::vector<const variant*> vtpath_visit(variant const& v, tstring const& expression)\n{\n vtpath_visitor vtpv(const_cast<variant*>(&v), expression);\n \n return std::vector<const variant*>(vtpv.begin(), vtpv.end());\n}\n\nstd::vector<variant*> vtpath_visit(variant& v, tstring const& expression)\n{\n vtpath_visitor vtpv(&v, expression);\n \n return std::vector<variant*>(vtpv.begin(), vtpv.end());\n}\n\n\/\/\n\/\/ vtpath_visitor\n\/\/ \n\nenum vpath_token_type {\n ROOT,\n CURRENT_OBJECT,\n CHILD,\n RECURSIVE_CHILD,\n WILDCARD_ALL,\n WILDCARD_OTHER,\n TOKEN\n};\nstruct vtpath_command {\n vpath_token_type type;\n \n variant expr;\n \n vtpath_command(vpath_token_type t): type(t) {}\n vtpath_command(vpath_token_type t, variant expr): type(t), expr(expr) {}\n};\n\n\/\/\n\/\/ vtpath_parse\n\/\/\ntinfra::module_tracer vtpath_parse_tracer(tinfra::tinfra_tracer, \"vtpath.parse\");\n\nvoid vtpath_parse_fail(std::string const& message)\n{\n throw std::runtime_error(tsprintf(\"vtpath: %s\", message)); \n}\n\nvoid vtpath_parse_expect(char v, char expect, const char* message)\n{\n if( v != expect ) {\n vtpath_parse_fail(tsprintf(\"expected '%s', but found '%s': %s\", expect, v, message)); \n }\n}\n\n\ntstring vpath_parse_selector(tstring expr, std::vector<vtpath_command>& result)\n \/\/ this function expects string is just after parsing starting [\n \/\/ it will consume ending ]\n \/\/ only [*] supported for now\n{\n while( expr.size() > 0 ) {\n switch(expr[0]) {\n case '*':\n TINFRA_TRACE(vtpath_parse_tracer, \"[*] -> WILDCARD_ALL\");\n result.push_back(vtpath_command(WILDCARD_ALL));\n vtpath_parse_expect(expr[1],']', \"* is supported only as alone token in selector\");\n return expr.substr(2);\n default:\n vtpath_parse_fail(\"only [*] wildcard is supported for now\");\n break;\n }\n }\n return expr;\n}\n\nvoid vtpath_parse(tstring expr, std::vector<vtpath_command>& result)\n{\n while( expr.size() > 0 ) {\n switch(expr[0]) {\n case '$':\n TINFRA_TRACE(vtpath_parse_tracer, \"$ -> ROOT\");\n result.push_back(vtpath_command(ROOT));\n expr=expr.substr(1);\n continue;\n case '.':\n if( expr.size() > 1 && expr[1] == '.' ) {\n TINFRA_TRACE(vtpath_parse_tracer, \".. -> RECURSIVE_CHILD\");\n result.push_back(vtpath_command(RECURSIVE_CHILD));\n expr=expr.substr(2);\n } else {\n TINFRA_TRACE(vtpath_parse_tracer, \". -> CHILD\");\n result.push_back(vtpath_command(CHILD));\n expr=expr.substr(1);\n }\n continue;\n case '*':\n TINFRA_TRACE(vtpath_parse_tracer, \"* -> WILDCARD_ALL\");\n result.push_back(vtpath_command(WILDCARD_ALL));\n expr=expr.substr(1);\n continue;\n case '[':\n expr = vpath_parse_selector(expr.substr(1), result);\n continue;\n default:\n {\n std::string name;\n while( expr.size() > 0 && isalpha(expr[0])) {\n name += expr[0];\n expr=expr.substr(1);\n }\n TINFRA_TRACE(vtpath_parse_tracer, name << \" -> TOKEN(\" << name << \")\");\n result.push_back(vtpath_command(TOKEN, name));\n continue;\n }\n }\n }\n \n}\n\ntinfra::module_tracer vtpath_exec_tracer(tinfra::tinfra_tracer, \"vtpath.exec\");\n\nstruct vtpath_parse_state {\n variant* current;\n \n \/\/ iterator in container\n variant::array_type::iterator iarray;\n variant::dict_type::iterator idict;\n int index;\n bool matching_finished;\n \/\/ iterator in expression-set\n std::vector<vtpath_command>::iterator icommand;\n};\n\nstruct vtpath_visitor::internal_data {\n variant* root;\n \/\/std::stirng expression;\n \n std::vector<vtpath_command> commands;\n \n std::stack<vtpath_parse_state> states;\n \n std::deque<variant*> result_queue;\n \/\/ helper methods\n vtpath_parse_state& top() {\n return this->states.top();\n }\n \n \/\/ process a match\n \/\/ node, a matched node\n \/\/ command, next command to process\n void match_found(variant* node, std::vector<vtpath_command>::iterator inext_command)\n {\n if( inext_command == commands.end() ) {\n TINFRA_TRACE(vtpath_exec_tracer, \"vpath_visit: matched result: \" << node << \": \" << *node);\n \/\/ if we're at end of pattern, i.e no rules\n \/\/ that means that we've been matched \"directly\"\n \/\/ so mark CURRENT as a result\n result_queue.push_back(node);\n return;\n } else {\n push_container(node, inext_command);\n }\n }\n void push_container(variant* node, std::vector<vtpath_command>::iterator inext_command)\n {\n vtpath_parse_state new_state;\n new_state.matching_finished = false;\n new_state.current = node;\n new_state.icommand = inext_command;\n new_state.index = 0;\n \n if( node->is_dict() ) {\n TINFRA_TRACE(vtpath_exec_tracer, \"vpath_visit: pushing dict: \" << node);\n new_state.idict = node->get_dict().begin();\n } else if( node->is_array() ) {\n TINFRA_TRACE(vtpath_exec_tracer, \"vpath_visit: pushing array: \" << node);\n new_state.iarray = node->get_array().begin();\n } else {\n \/\/ do nothing when\n \/\/ we've found leafs not at end of \n \/\/ command chain\n return;\n }\n this->states.push(new_state);\n }\n};\n\nvtpath_visitor::vtpath_visitor(variant* v, tstring const& expression):\n self(new internal_data())\n{\n self->root = v;\n vtpath_parse(expression, self->commands);\n if( self->commands.size() == 0 ) {\n vtpath_parse_fail(\"empty predicate\");\n }\n if( self->commands[0].type != ROOT ) {\n vtpath_parse_fail(\"first element shall be root\");\n }\n self->match_found(self->root, self->commands.begin()+1);\n}\nvtpath_visitor::~vtpath_visitor()\n{\n}\ninline std::ostream& operator <<(std::ostream& s, vtpath_command const& cmd)\n{\n s << '(';\n switch(cmd.type) {\n case ROOT: s << \"ROOT\"; break;\n case CURRENT_OBJECT: s << \"CURRENT_OBJECT\"; break;\n case CHILD: s << \"CHILD\"; break;\n case RECURSIVE_CHILD: s << \"RECURSIVE_CHILD\"; break;\n case WILDCARD_ALL: s << \"WILDCARD_ALL\"; break;\n case WILDCARD_OTHER: s << \"WILDCARD_OTHER\"; break;\n case TOKEN: s << \"TOKEN\"; break;\n }\n if( !cmd.expr.is_none() ) {\n s << \",\" << cmd.expr;\n }\n s << ')';\n return s;\n}\n\nbool vtpath_visitor::fetch_next(variant*& r)\n{\n while( self->result_queue.empty() ) {\n if( self->states.empty() )\n return false;\n \n vtpath_parse_state& top = self->top();\n if( top.matching_finished ) {\n TINFRA_TRACE(vtpath_exec_tracer, \"vpath_visit: matching finished in \" << top.current);\n self->states.pop();\n continue;\n }\n bool recursive = false;\n if( top.icommand->type == CHILD ) {\n \/\/ nothing\n } else if( top.icommand->type == RECURSIVE_CHILD ) {\n recursive = true;\n } else {\n TINFRA_TRACE(vtpath_exec_tracer, \"vpath_visit: state bad \" << top.icommand->type << \" popping state\");\n self->states.pop();\n continue;\n }\n TINFRA_TRACE(vtpath_exec_tracer, \"vpath_visit: node: \" << (*top.current) << \"(\" <<top.current << \") \" << *(top.icommand) << \" index=\" << top.index << \" recursive=\" << (int)recursive);\n \n \/\/ we still need at least one command\n TINFRA_ASSERT(top.icommand != self->commands.end()-1);\n vtpath_command const& child_match = *(top.icommand+1);\n TINFRA_TRACE(vtpath_exec_tracer, \"vpath_visit: node: next_command= \" << *(top.icommand+1));\n \n std::vector<vtpath_command>::iterator inext_command = (top.icommand+2);\n \n if( top.current->is_dict()) {\n variant::dict_type& dict = top.current->get_dict();\n if( child_match.type == WILDCARD_ALL || recursive) {\n \/\/ CURRENT.*, or recursive\n \/\/ in wildcard we MATCH all\n \/\/ in recursive we recurse to all\n if( top.idict != dict.end() ) {\n variant::dict_type::iterator idict = top.idict;\n top.idict++;\n top.index++;\n \n variant& match = idict->second;\n TINFRA_TRACE(vtpath_exec_tracer, \"vpath_visit: trying: \" << top.index-1 << \": \" << idict->first << \" -> \" << match);\n if( child_match.type == WILDCARD_ALL ) {\n \/\/ CURRENT.*, matches everything\n self->match_found(&match, inext_command);\n } else if( child_match.type == TOKEN ) {\n \/\/ CURRENT.TOKEN\n if( child_match.expr.is_string() ) {\n \/\/ CURRENT.TOKEN(string)\n \/\/ -> check if current matches TOKEN in dict\n TINFRA_ASSERT(child_match.expr.is_string());\n std::string const& token = child_match.expr.get_string();\n if( idict->first == token ) {\n self->match_found(&match, inext_command);\n }\n }\n } else {\n TINFRA_ASSERT(false);\n }\n if( recursive ) {\n \/\/ in recursive must reapply all rules from now on all containers\n self->push_container(&match, top.icommand);\n }\n } else {\n top.matching_finished = true;\n }\n } else if( child_match.type == TOKEN ) {\n \/\/ CURRENT.TOKEN, non-recursive\n \/\/ -> search for TOKEN in dict\n std::string const& token = child_match.expr.get_string();\n\n variant::dict_type::iterator i = dict.find(token);\n top.matching_finished = true;\n if( i != dict.end() ) {\n variant& match = i->second;\n self->match_found(&match, inext_command);\n }\n }\n } else if( top.current->is_array() ) {\n variant::array_type& array = top.current->get_array();\n if( child_match.type == WILDCARD_ALL || recursive) {\n \/\/ in wildcard we MATCH all\n \/\/ in recursive we recurse to all\n if( top.iarray != array.end() ) {\n variant::array_type::iterator iarray = top.iarray;\n top.iarray++;\n top.index++;\n \n variant& match = *iarray;\n TINFRA_TRACE(vtpath_exec_tracer, \"vpath_visit: trying: \" << top.index-1 << \": \" << match);\n if( child_match.type == WILDCARD_ALL ) {\n self->match_found(&match, inext_command);\n } else if( child_match.type == TOKEN ) {\n if( child_match.expr.is_integer()) {\n int current_index = (iarray - array.begin());\n int index = child_match.expr.get_integer();\n if( index == current_index ) {\n self->match_found(&match, inext_command);\n }\n }\n } else {\n TINFRA_ASSERT(false);\n }\n \n if( recursive ) {\n \/\/ in recursive must reapply all rules from now on all containers\n self->push_container(&match, top.icommand);\n }\n } else {\n top.matching_finished = true;\n }\n } else if( child_match.type == TOKEN ) {\n TINFRA_ASSERT(child_match.expr.is_integer());\n int index = child_match.expr.get_integer();\n top.matching_finished = true;\n if( index >= 0 && index < array.size() ) {\n variant& match = array[index];\n std::vector<vtpath_command>::iterator inext_command = (top.icommand+2);\n\n self->match_found(&match, inext_command);\n }\n \n }\n } \/\/ is array\n } \/\/ while result_queue is empty\n r = self->result_queue.front();\n self->result_queue.pop_front();\n return true;\n}\n\n} \/\/ end namespace tinfra\n\n<commit_msg>vtpath_parse: fix, word tokens parsing matches all isalnum() and underscore<commit_after>#include \"vtpath.h\" \/\/ we implement this\n\n#include \"tinfra\/tstring.h\"\n#include \"tinfra\/any.h\"\n#include \"tinfra\/trace.h\"\n\n#include <vector>\n#include <stack>\n#include <deque>\n#include <iterator>\n#include <string>\n#include <stdexcept>\n\nnamespace tinfra {\n\n\/\/\n\/\/ vtpath_visit\n\/\/ \nstd::vector<const variant*> vtpath_visit(variant const& v, tstring const& expression)\n{\n vtpath_visitor vtpv(const_cast<variant*>(&v), expression);\n \n return std::vector<const variant*>(vtpv.begin(), vtpv.end());\n}\n\nstd::vector<variant*> vtpath_visit(variant& v, tstring const& expression)\n{\n vtpath_visitor vtpv(&v, expression);\n \n return std::vector<variant*>(vtpv.begin(), vtpv.end());\n}\n\n\/\/\n\/\/ vtpath_visitor\n\/\/ \n\nenum vpath_token_type {\n ROOT,\n CURRENT_OBJECT,\n CHILD,\n RECURSIVE_CHILD,\n WILDCARD_ALL,\n WILDCARD_OTHER,\n TOKEN\n};\nstruct vtpath_command {\n vpath_token_type type;\n \n variant expr;\n \n vtpath_command(vpath_token_type t): type(t) {}\n vtpath_command(vpath_token_type t, variant expr): type(t), expr(expr) {}\n};\n\n\/\/\n\/\/ vtpath_parse\n\/\/\ntinfra::module_tracer vtpath_parse_tracer(tinfra::tinfra_tracer, \"vtpath.parse\");\n\nvoid vtpath_parse_fail(std::string const& message)\n{\n throw std::runtime_error(tsprintf(\"vtpath: %s\", message)); \n}\n\nvoid vtpath_parse_expect(char v, char expect, const char* message)\n{\n if( v != expect ) {\n vtpath_parse_fail(tsprintf(\"expected '%s', but found '%s': %s\", expect, v, message)); \n }\n}\n\n\ntstring vpath_parse_selector(tstring expr, std::vector<vtpath_command>& result)\n \/\/ this function expects string is just after parsing starting [\n \/\/ it will consume ending ]\n \/\/ only [*] supported for now\n{\n while( expr.size() > 0 ) {\n switch(expr[0]) {\n case '*':\n TINFRA_TRACE(vtpath_parse_tracer, \"[*] -> WILDCARD_ALL\");\n result.push_back(vtpath_command(WILDCARD_ALL));\n vtpath_parse_expect(expr[1],']', \"* is supported only as alone token in selector\");\n return expr.substr(2);\n default:\n vtpath_parse_fail(\"only [*] wildcard is supported for now\");\n break;\n }\n }\n return expr;\n}\n\nvoid vtpath_parse(tstring expr, std::vector<vtpath_command>& result)\n{\n while( expr.size() > 0 ) {\n switch(expr[0]) {\n case '$':\n TINFRA_TRACE(vtpath_parse_tracer, \"$ -> ROOT\");\n result.push_back(vtpath_command(ROOT));\n expr=expr.substr(1);\n continue;\n case '.':\n if( expr.size() > 1 && expr[1] == '.' ) {\n TINFRA_TRACE(vtpath_parse_tracer, \".. -> RECURSIVE_CHILD\");\n result.push_back(vtpath_command(RECURSIVE_CHILD));\n expr=expr.substr(2);\n } else {\n TINFRA_TRACE(vtpath_parse_tracer, \". -> CHILD\");\n result.push_back(vtpath_command(CHILD));\n expr=expr.substr(1);\n }\n continue;\n case '*':\n TINFRA_TRACE(vtpath_parse_tracer, \"* -> WILDCARD_ALL\");\n result.push_back(vtpath_command(WILDCARD_ALL));\n expr=expr.substr(1);\n continue;\n case '[':\n expr = vpath_parse_selector(expr.substr(1), result);\n continue;\n default:\n {\n std::string name;\n while( expr.size() > 0 && (isalnum(expr[0]) || expr[0] == '_')) {\n name += expr[0];\n expr=expr.substr(1);\n }\n TINFRA_TRACE(vtpath_parse_tracer, name << \" -> TOKEN(\" << name << \")\");\n result.push_back(vtpath_command(TOKEN, name));\n continue;\n }\n }\n }\n \n}\n\ntinfra::module_tracer vtpath_exec_tracer(tinfra::tinfra_tracer, \"vtpath.exec\");\n\nstruct vtpath_parse_state {\n variant* current;\n \n \/\/ iterator in container\n variant::array_type::iterator iarray;\n variant::dict_type::iterator idict;\n int index;\n bool matching_finished;\n \/\/ iterator in expression-set\n std::vector<vtpath_command>::iterator icommand;\n};\n\nstruct vtpath_visitor::internal_data {\n variant* root;\n \/\/std::stirng expression;\n \n std::vector<vtpath_command> commands;\n \n std::stack<vtpath_parse_state> states;\n \n std::deque<variant*> result_queue;\n \/\/ helper methods\n vtpath_parse_state& top() {\n return this->states.top();\n }\n \n \/\/ process a match\n \/\/ node, a matched node\n \/\/ command, next command to process\n void match_found(variant* node, std::vector<vtpath_command>::iterator inext_command)\n {\n if( inext_command == commands.end() ) {\n TINFRA_TRACE(vtpath_exec_tracer, \"vpath_visit: matched result: \" << node << \": \" << *node);\n \/\/ if we're at end of pattern, i.e no rules\n \/\/ that means that we've been matched \"directly\"\n \/\/ so mark CURRENT as a result\n result_queue.push_back(node);\n return;\n } else {\n push_container(node, inext_command);\n }\n }\n void push_container(variant* node, std::vector<vtpath_command>::iterator inext_command)\n {\n vtpath_parse_state new_state;\n new_state.matching_finished = false;\n new_state.current = node;\n new_state.icommand = inext_command;\n new_state.index = 0;\n \n if( node->is_dict() ) {\n TINFRA_TRACE(vtpath_exec_tracer, \"vpath_visit: pushing dict: \" << node);\n new_state.idict = node->get_dict().begin();\n } else if( node->is_array() ) {\n TINFRA_TRACE(vtpath_exec_tracer, \"vpath_visit: pushing array: \" << node);\n new_state.iarray = node->get_array().begin();\n } else {\n \/\/ do nothing when\n \/\/ we've found leafs not at end of \n \/\/ command chain\n return;\n }\n this->states.push(new_state);\n }\n};\n\nvtpath_visitor::vtpath_visitor(variant* v, tstring const& expression):\n self(new internal_data())\n{\n self->root = v;\n vtpath_parse(expression, self->commands);\n if( self->commands.size() == 0 ) {\n vtpath_parse_fail(\"empty predicate\");\n }\n if( self->commands[0].type != ROOT ) {\n vtpath_parse_fail(\"first element shall be root\");\n }\n self->match_found(self->root, self->commands.begin()+1);\n}\nvtpath_visitor::~vtpath_visitor()\n{\n}\ninline std::ostream& operator <<(std::ostream& s, vtpath_command const& cmd)\n{\n s << '(';\n switch(cmd.type) {\n case ROOT: s << \"ROOT\"; break;\n case CURRENT_OBJECT: s << \"CURRENT_OBJECT\"; break;\n case CHILD: s << \"CHILD\"; break;\n case RECURSIVE_CHILD: s << \"RECURSIVE_CHILD\"; break;\n case WILDCARD_ALL: s << \"WILDCARD_ALL\"; break;\n case WILDCARD_OTHER: s << \"WILDCARD_OTHER\"; break;\n case TOKEN: s << \"TOKEN\"; break;\n }\n if( !cmd.expr.is_none() ) {\n s << \",\" << cmd.expr;\n }\n s << ')';\n return s;\n}\n\nbool vtpath_visitor::fetch_next(variant*& r)\n{\n while( self->result_queue.empty() ) {\n if( self->states.empty() )\n return false;\n \n vtpath_parse_state& top = self->top();\n if( top.matching_finished ) {\n TINFRA_TRACE(vtpath_exec_tracer, \"vpath_visit: matching finished in \" << top.current);\n self->states.pop();\n continue;\n }\n bool recursive = false;\n if( top.icommand->type == CHILD ) {\n \/\/ nothing\n } else if( top.icommand->type == RECURSIVE_CHILD ) {\n recursive = true;\n } else {\n TINFRA_TRACE(vtpath_exec_tracer, \"vpath_visit: state bad \" << top.icommand->type << \" popping state\");\n self->states.pop();\n continue;\n }\n TINFRA_TRACE(vtpath_exec_tracer, \"vpath_visit: node: \" << (*top.current) << \"(\" <<top.current << \") \" << *(top.icommand) << \" index=\" << top.index << \" recursive=\" << (int)recursive);\n \n \/\/ we still need at least one command\n TINFRA_ASSERT(top.icommand != self->commands.end()-1);\n vtpath_command const& child_match = *(top.icommand+1);\n TINFRA_TRACE(vtpath_exec_tracer, \"vpath_visit: node: next_command= \" << *(top.icommand+1));\n \n std::vector<vtpath_command>::iterator inext_command = (top.icommand+2);\n \n if( top.current->is_dict()) {\n variant::dict_type& dict = top.current->get_dict();\n if( child_match.type == WILDCARD_ALL || recursive) {\n \/\/ CURRENT.*, or recursive\n \/\/ in wildcard we MATCH all\n \/\/ in recursive we recurse to all\n if( top.idict != dict.end() ) {\n variant::dict_type::iterator idict = top.idict;\n top.idict++;\n top.index++;\n \n variant& match = idict->second;\n TINFRA_TRACE(vtpath_exec_tracer, \"vpath_visit: trying: \" << top.index-1 << \": \" << idict->first << \" -> \" << match);\n if( child_match.type == WILDCARD_ALL ) {\n \/\/ CURRENT.*, matches everything\n self->match_found(&match, inext_command);\n } else if( child_match.type == TOKEN ) {\n \/\/ CURRENT.TOKEN\n if( child_match.expr.is_string() ) {\n \/\/ CURRENT.TOKEN(string)\n \/\/ -> check if current matches TOKEN in dict\n TINFRA_ASSERT(child_match.expr.is_string());\n std::string const& token = child_match.expr.get_string();\n if( idict->first == token ) {\n self->match_found(&match, inext_command);\n }\n }\n } else {\n TINFRA_ASSERT(false);\n }\n if( recursive ) {\n \/\/ in recursive must reapply all rules from now on all containers\n self->push_container(&match, top.icommand);\n }\n } else {\n top.matching_finished = true;\n }\n } else if( child_match.type == TOKEN ) {\n \/\/ CURRENT.TOKEN, non-recursive\n \/\/ -> search for TOKEN in dict\n std::string const& token = child_match.expr.get_string();\n\n variant::dict_type::iterator i = dict.find(token);\n top.matching_finished = true;\n if( i != dict.end() ) {\n variant& match = i->second;\n self->match_found(&match, inext_command);\n }\n }\n } else if( top.current->is_array() ) {\n variant::array_type& array = top.current->get_array();\n if( child_match.type == WILDCARD_ALL || recursive) {\n \/\/ in wildcard we MATCH all\n \/\/ in recursive we recurse to all\n if( top.iarray != array.end() ) {\n variant::array_type::iterator iarray = top.iarray;\n top.iarray++;\n top.index++;\n \n variant& match = *iarray;\n TINFRA_TRACE(vtpath_exec_tracer, \"vpath_visit: trying: \" << top.index-1 << \": \" << match);\n if( child_match.type == WILDCARD_ALL ) {\n self->match_found(&match, inext_command);\n } else if( child_match.type == TOKEN ) {\n if( child_match.expr.is_integer()) {\n int current_index = (iarray - array.begin());\n int index = child_match.expr.get_integer();\n if( index == current_index ) {\n self->match_found(&match, inext_command);\n }\n }\n } else {\n TINFRA_ASSERT(false);\n }\n \n if( recursive ) {\n \/\/ in recursive must reapply all rules from now on all containers\n self->push_container(&match, top.icommand);\n }\n } else {\n top.matching_finished = true;\n }\n } else if( child_match.type == TOKEN ) {\n TINFRA_ASSERT(child_match.expr.is_integer());\n int index = child_match.expr.get_integer();\n top.matching_finished = true;\n if( index >= 0 && index < array.size() ) {\n variant& match = array[index];\n std::vector<vtpath_command>::iterator inext_command = (top.icommand+2);\n\n self->match_found(&match, inext_command);\n }\n \n }\n } \/\/ is array\n } \/\/ while result_queue is empty\n r = self->result_queue.front();\n self->result_queue.pop_front();\n return true;\n}\n\n} \/\/ end namespace tinfra\n\n<|endoftext|>"} {"text":"<commit_before>\/******************************************************************************\n* SOFA, Simulation Open-Framework Architecture, version 1.0 beta 4 *\n* (c) 2006-2009 MGH, INRIA, USTL, UJF, CNRS *\n* *\n* This library is free software; you can redistribute it and\/or modify it *\n* under the terms of the GNU Lesser General Public License as published by *\n* the Free Software Foundation; either version 2.1 of the License, or (at *\n* your option) any later version. *\n* *\n* This library is distributed in the hope that it will be useful, but WITHOUT *\n* ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or *\n* FITNESS FOR A PARTICULAR PURPOSE. See the GNU Lesser General Public License *\n* for more details. *\n* *\n* You should have received a copy of the GNU Lesser General Public License *\n* along with this library; if not, write to the Free Software Foundation, *\n* Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA. *\n*******************************************************************************\n* SOFA :: Modules *\n* *\n* Authors: The SOFA Team and external contributors (see Authors.txt) *\n* *\n* Contact information: contact@sofa-framework.org *\n******************************************************************************\/\n#ifndef SOFA_COMPONENT_ENGINE_EXTRUDESURFACE_INL\n#define SOFA_COMPONENT_ENGINE_EXTRUDESURFACE_INL\n\n#if !defined(__GNUC__) || (__GNUC__ > 3 || (_GNUC__ == 3 && __GNUC_MINOR__ > 3))\n#pragma once\n#endif\n\n#include <sofa\/component\/engine\/ExtrudeSurface.h>\n#include <sofa\/helper\/gl\/template.h>\n#include <sofa\/helper\/gl\/BasicShapes.h>\n\nnamespace sofa\n{\n\nnamespace component\n{\n\nnamespace engine\n{\n\nusing namespace sofa::helper;\nusing namespace sofa::defaulttype;\nusing namespace core::objectmodel;\n\ntemplate <class DataTypes>\nExtrudeSurface<DataTypes>::ExtrudeSurface()\n : f_extrusionVertices( initData (&f_extrusionVertices, \"extrusionVertices\", \"Position coordinates of the extrusion\") )\n , f_surfaceVertices( initData (&f_surfaceVertices, \"surfaceVertices\", \"Position coordinates of the surface\") )\n , f_extrusionTriangles( initData (&f_extrusionTriangles, \"extrusionTriangles\", \"Triangles indices of the extrusion\") )\n , f_surfaceTriangles( initData (&f_surfaceTriangles, \"surfaceTriangles\", \"Indices of the triangles of the surface to extrude\") )\n{\n addInput(&f_surfaceTriangles);\n addInput(&f_surfaceVertices);\n\n addOutput(&f_extrusionVertices);\n addOutput(&f_extrusionTriangles);\n}\n\ntemplate <class DataTypes>\nvoid ExtrudeSurface<DataTypes>::init()\n{\n BaseMeshTopology* topology = dynamic_cast<BaseMeshTopology*>(getContext()->getTopology());\n if (topology != NULL)\n {\n BaseData* parent = topology->findField(\"triangles\");\n if (parent == NULL)\n {\n sout << \"ERROR: Topology \" << topology->getName() << \" does not contain triangles\" << sendl;\n }\n }\n else\n {\n sout << \"ERROR: Topology not found. Extrusion can not be computed\" << sendl;\n }\n\n if (!f_surfaceVertices.isSet() || !f_surfaceTriangles.isSet())\n {\n sout << \"ERROR: No indices or vertices given for extrusion\" << sendl;\n return;\n }\n\n}\n\ntemplate <class DataTypes>\nvoid ExtrudeSurface<DataTypes>::reinit()\n{\n update();\n}\n\ntemplate <class DataTypes>\nvoid ExtrudeSurface<DataTypes>::update()\n{\n dirty = false;\n\n BaseMeshTopology* topology = dynamic_cast<BaseMeshTopology*>(getContext()->getTopology());\n\n VecCoord* extrusionVertices = f_extrusionVertices.beginEdit();\n extrusionVertices->clear();\n helper::vector<BaseMeshTopology::Triangle>* extrusionTriangles = f_extrusionTriangles.beginEdit();\n extrusionTriangles->clear();\n\n const helper::vector<BaseMeshTopology::TriangleID>& surfaceTriangles = f_surfaceTriangles.getValue();\n const VecCoord& surfaceVertices = f_surfaceVertices.getValue();\n\n helper::vector<BaseMeshTopology::TriangleID>::const_iterator itTriangles, itTrianglesSide;\n\n std::map<int, int> pointMatching;\n std::map<BaseMeshTopology::Edge, bool > edgesOnBorder;\n std::set<int> pointsUsed;\n\n for (itTriangles=surfaceTriangles.begin() ; itTriangles != surfaceTriangles.end() ; itTriangles++)\n {\n BaseMeshTopology::Triangle triangle = topology->getTriangle(*itTriangles);\n\n VecCoord triangleCoord;\n\n BaseMeshTopology::Triangle t1, t2;\n \/\/fetch real coords\n for (unsigned int i=0 ; i<3 ; i++)\n triangleCoord.push_back(surfaceVertices[triangle[i]]);\n\n \/\/compute normal\n Coord n = cross(triangleCoord[1]-triangleCoord[0], triangleCoord[2]-triangleCoord[0]);\n\n \/\/create triangle from surface and the new triangle\n \/\/vertex created from surface has an even (2*n) index\n \/\/vertex created from the addition with the normal has an odd (2*n + 1) index\n \/\/a table is also used to map old vertex indices with the new set of indices\n for (unsigned int i=0 ; i<3 ; i++)\n {\n if (pointMatching.find(triangle[i]) == pointMatching.end())\n {\n extrusionVertices->push_back(surfaceVertices[triangle[i]]);\n extrusionVertices->push_back(surfaceVertices[triangle[i]] + n);\n\n pointMatching[triangle[i]] = extrusionVertices->size() - 2;\n\n t1[i] = extrusionVertices->size()-2;\n t2[i] = extrusionVertices->size()-1;\n }\n else\n {\n t1[i] = pointMatching[triangle[i]];\n t2[i] = pointMatching[triangle[i]] + 1;\n }\n }\n extrusionTriangles->push_back(t1);\n extrusionTriangles->push_back(t2);\n\n \/\/to get borders, we simply stock the edge and look if it is already in the table\n\n BaseMeshTopology::Edge e[3];\n if (t1[0] < t1[1])\n { e[0][0] = t1[0] ; e[0][1] = t1[1] ; }\n else\n { e[0][0] = t1[1] ; e[0][1] = t1[0] ; }\n\n if (t1[0] < t1[2])\n { e[1][0] = t1[0] ; e[1][1] = t1[2] ; }\n else\n { e[1][0] = t1[2] ; e[1][1] = t1[0] ; }\n\n if (t1[1] < t1[2])\n { e[2][0] = t1[1] ; e[2][1] = t1[2] ; }\n else\n { e[2][1] = t1[1] ; e[2][0] = t1[2] ; }\n\n for (unsigned int i=0 ; i<3 ; i++)\n {\n if ( edgesOnBorder.find(e[i]) == edgesOnBorder.end())\n edgesOnBorder[e[i]] = true;\n else\n edgesOnBorder[e[i]] = false;\n }\n }\n\n std::map<BaseMeshTopology::Edge, bool >::const_iterator itEdges;\n for (itEdges = edgesOnBorder.begin() ; itEdges != edgesOnBorder.end() ; itEdges++)\n {\n \/\/for each edge, we can get the \"mirrored one\" and construct 2 other triangles\n if ((*itEdges).second)\n {\n BaseMeshTopology::Edge e = (*itEdges).first;\n\n \/\/first triangle\n BaseMeshTopology::Triangle ft1;\n ft1[0] = e[0];\n ft1[1] = e[1];\n ft1[2] = e[0] + 1;\n\n \/\/second triangle\n BaseMeshTopology::Triangle ft2;\n ft2[0] = e[0] + 1;\n ft2[1] = e[1] + 1;\n ft2[2] = e[1];\n\n extrusionTriangles->push_back(ft1);\n extrusionTriangles->push_back(ft2);\n }\n }\n\n f_extrusionTriangles.endEdit();\n f_extrusionVertices.endEdit();\n}\n\ntemplate <class DataTypes>\nvoid ExtrudeSurface<DataTypes>::draw()\n{\n\n const helper::vector<BaseMeshTopology::TriangleID> &surfaceTriangles = f_surfaceTriangles.getValue();\n\n helper::vector<BaseMeshTopology::TriangleID>::const_iterator itTriangles;\n glDisable(GL_LIGHTING);\n\n if (!this->getContext()->getShowBehaviorModels())\n return;\n\n if (this->getContext()->getShowWireFrame())\n glPolygonMode(GL_FRONT_AND_BACK, GL_LINE);\n\n const helper::vector<BaseMeshTopology::Triangle> &extrusionTriangles = f_extrusionTriangles.getValue();\n const VecCoord& extrusionVertices = f_extrusionVertices.getValue();\n helper::vector<BaseMeshTopology::Triangle>::const_iterator it;\n\n \/\/Triangles From Surface\n\n glColor3f(1.0,0.0,0.0);\n glBegin(GL_TRIANGLES);\n for (unsigned int i=0 ; i<surfaceTriangles.size()*2 ; i+=2)\n {\n BaseMeshTopology::Triangle triangle = extrusionTriangles[i];\n\n for (unsigned int j=0 ; j<3 ; j++)\n {\n Coord p = (extrusionVertices[triangle[j]]);\n glVertex3f(p[0], p[1], p[2]);\n }\n }\n glEnd();\n\n \/\/Triangles From Extrusion\n glColor3f(0.0,1.0,0.0);\n glBegin(GL_TRIANGLES);\n for (unsigned int i=1 ; i<surfaceTriangles.size()*2 ; i+=2)\n {\n BaseMeshTopology::Triangle triangle = extrusionTriangles[i];\n\n for (unsigned int j=0 ; j<3 ; j++)\n {\n Coord p = (extrusionVertices[triangle[j]]);\n glVertex3f(p[0], p[1], p[2]);\n }\n }\n glEnd();\n\n \/\/Border Triangles\n glColor3f(0.0,0.0,1.0);\n glBegin(GL_TRIANGLES);\n for (unsigned int i=surfaceTriangles.size()*2 ; i<extrusionTriangles.size() ; i++)\n {\n BaseMeshTopology::Triangle triangle = extrusionTriangles[i];\n\n for (unsigned int j=0 ; j<3 ; j++)\n {\n Coord p = (extrusionVertices[triangle[j]]);\n glVertex3f(p[0], p[1], p[2]);\n }\n }\n glEnd();\n\n if (this->getContext()->getShowWireFrame())\n glPolygonMode(GL_FRONT_AND_BACK, GL_FILL);\n\n glEnable(GL_LIGHTING);\n}\n\n} \/\/ namespace engine\n\n} \/\/ namespace component\n\n} \/\/ namespace sofa\n\n#endif\n<commit_msg>r4838\/sofa-dev : UPDATE\/FIX : computation of the normal for the extruded surface<commit_after>\/******************************************************************************\n* SOFA, Simulation Open-Framework Architecture, version 1.0 beta 4 *\n* (c) 2006-2009 MGH, INRIA, USTL, UJF, CNRS *\n* *\n* This library is free software; you can redistribute it and\/or modify it *\n* under the terms of the GNU Lesser General Public License as published by *\n* the Free Software Foundation; either version 2.1 of the License, or (at *\n* your option) any later version. *\n* *\n* This library is distributed in the hope that it will be useful, but WITHOUT *\n* ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or *\n* FITNESS FOR A PARTICULAR PURPOSE. See the GNU Lesser General Public License *\n* for more details. *\n* *\n* You should have received a copy of the GNU Lesser General Public License *\n* along with this library; if not, write to the Free Software Foundation, *\n* Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA. *\n*******************************************************************************\n* SOFA :: Modules *\n* *\n* Authors: The SOFA Team and external contributors (see Authors.txt) *\n* *\n* Contact information: contact@sofa-framework.org *\n******************************************************************************\/\n#ifndef SOFA_COMPONENT_ENGINE_EXTRUDESURFACE_INL\n#define SOFA_COMPONENT_ENGINE_EXTRUDESURFACE_INL\n\n#if !defined(__GNUC__) || (__GNUC__ > 3 || (_GNUC__ == 3 && __GNUC_MINOR__ > 3))\n#pragma once\n#endif\n\n#include <sofa\/component\/engine\/ExtrudeSurface.h>\n#include <sofa\/helper\/gl\/template.h>\n#include <sofa\/helper\/gl\/BasicShapes.h>\n\nnamespace sofa\n{\n\nnamespace component\n{\n\nnamespace engine\n{\n\nusing namespace sofa::helper;\nusing namespace sofa::defaulttype;\nusing namespace core::objectmodel;\n\ntemplate <class DataTypes>\nExtrudeSurface<DataTypes>::ExtrudeSurface()\n : f_extrusionVertices( initData (&f_extrusionVertices, \"extrusionVertices\", \"Position coordinates of the extrusion\") )\n , f_surfaceVertices( initData (&f_surfaceVertices, \"surfaceVertices\", \"Position coordinates of the surface\") )\n , f_extrusionTriangles( initData (&f_extrusionTriangles, \"extrusionTriangles\", \"Triangles indices of the extrusion\") )\n , f_surfaceTriangles( initData (&f_surfaceTriangles, \"surfaceTriangles\", \"Indices of the triangles of the surface to extrude\") )\n{\n addInput(&f_surfaceTriangles);\n addInput(&f_surfaceVertices);\n\n addOutput(&f_extrusionVertices);\n addOutput(&f_extrusionTriangles);\n}\n\ntemplate <class DataTypes>\nvoid ExtrudeSurface<DataTypes>::init()\n{\n BaseMeshTopology* topology = dynamic_cast<BaseMeshTopology*>(getContext()->getTopology());\n if (topology != NULL)\n {\n BaseData* parent = topology->findField(\"triangles\");\n if (parent == NULL)\n {\n sout << \"ERROR: Topology \" << topology->getName() << \" does not contain triangles\" << sendl;\n }\n }\n else\n {\n sout << \"ERROR: Topology not found. Extrusion can not be computed\" << sendl;\n }\n\n if (!f_surfaceVertices.isSet() || !f_surfaceTriangles.isSet())\n {\n sout << \"ERROR: No indices or vertices given for extrusion\" << sendl;\n return;\n }\n\n}\n\ntemplate <class DataTypes>\nvoid ExtrudeSurface<DataTypes>::reinit()\n{\n update();\n}\n\ntemplate <class DataTypes>\nvoid ExtrudeSurface<DataTypes>::update()\n{\n dirty = false;\n\n BaseMeshTopology* topology = dynamic_cast<BaseMeshTopology*>(getContext()->getTopology());\n\n VecCoord* extrusionVertices = f_extrusionVertices.beginEdit();\n extrusionVertices->clear();\n helper::vector<BaseMeshTopology::Triangle>* extrusionTriangles = f_extrusionTriangles.beginEdit();\n extrusionTriangles->clear();\n\n const helper::vector<BaseMeshTopology::TriangleID>& surfaceTriangles = f_surfaceTriangles.getValue();\n const VecCoord& surfaceVertices = f_surfaceVertices.getValue();\n\n helper::vector<BaseMeshTopology::TriangleID>::const_iterator itTriangles, itTrianglesSide;\n\n std::map<int, int> pointMatching;\n std::map<BaseMeshTopology::Edge, bool > edgesOnBorder;\n std::set<int> pointsUsed;\n std::map<int, std::pair<Vec3, unsigned int> > normals;\n\n \/\/first loop to compute normals per point\n for (itTriangles=surfaceTriangles.begin() ; itTriangles != surfaceTriangles.end() ; itTriangles++)\n {\n BaseMeshTopology::Triangle triangle = topology->getTriangle(*itTriangles);\n VecCoord triangleCoord;\n\n \/\/fetch real coords\n for (unsigned int i=0 ; i<3 ; i++)\n triangleCoord.push_back(surfaceVertices[triangle[i]]);\n\n \/\/compute normal\n Coord n = cross(triangleCoord[1]-triangleCoord[0], triangleCoord[2]-triangleCoord[0]);\n for (unsigned int i=0 ; i<3 ; i++)\n {\n normals[triangle[i]].first += n;\n normals[triangle[i]].second++;\n }\n }\n\n \/\/average normals\n typename std::map<int, std::pair<Vec3, unsigned int> >::iterator itNormals;\n for (itNormals = normals.begin(); itNormals != normals.end() ; itNormals++)\n (*itNormals).second.first \/= (*itNormals).second.second;\n\n for (itTriangles=surfaceTriangles.begin() ; itTriangles != surfaceTriangles.end() ; itTriangles++)\n {\n BaseMeshTopology::Triangle triangle = topology->getTriangle(*itTriangles);\n BaseMeshTopology::Triangle t1, t2;\n\n \/\/create triangle from surface and the new triangle\n \/\/vertex created from surface has an even (2*n) index\n \/\/vertex created from the addition with the normal has an odd (2*n + 1) index\n \/\/a table is also used to map old vertex indices with the new set of indices\n for (unsigned int i=0 ; i<3 ; i++)\n {\n if (pointMatching.find(triangle[i]) == pointMatching.end())\n {\n extrusionVertices->push_back(surfaceVertices[triangle[i]]);\n extrusionVertices->push_back(surfaceVertices[triangle[i]] + normals[triangle[i]].first);\n\n pointMatching[triangle[i]] = extrusionVertices->size() - 2;\n\n t1[i] = extrusionVertices->size()-2;\n t2[i] = extrusionVertices->size()-1;\n }\n else\n {\n t1[i] = pointMatching[triangle[i]];\n t2[i] = pointMatching[triangle[i]] + 1;\n }\n }\n extrusionTriangles->push_back(t1);\n extrusionTriangles->push_back(t2);\n\n \/\/to get borders, we simply stock the edge and look if it is already in the table\n\n BaseMeshTopology::Edge e[3];\n if (t1[0] < t1[1])\n { e[0][0] = t1[0] ; e[0][1] = t1[1] ; }\n else\n { e[0][0] = t1[1] ; e[0][1] = t1[0] ; }\n\n if (t1[0] < t1[2])\n { e[1][0] = t1[0] ; e[1][1] = t1[2] ; }\n else\n { e[1][0] = t1[2] ; e[1][1] = t1[0] ; }\n\n if (t1[1] < t1[2])\n { e[2][0] = t1[1] ; e[2][1] = t1[2] ; }\n else\n { e[2][1] = t1[1] ; e[2][0] = t1[2] ; }\n\n for (unsigned int i=0 ; i<3 ; i++)\n {\n if ( edgesOnBorder.find(e[i]) == edgesOnBorder.end())\n edgesOnBorder[e[i]] = true;\n else\n edgesOnBorder[e[i]] = false;\n }\n }\n\n std::map<BaseMeshTopology::Edge, bool >::const_iterator itEdges;\n for (itEdges = edgesOnBorder.begin() ; itEdges != edgesOnBorder.end() ; itEdges++)\n {\n \/\/for each edge, we can get the \"mirrored one\" and construct 2 other triangles\n if ((*itEdges).second)\n {\n BaseMeshTopology::Edge e = (*itEdges).first;\n\n \/\/first triangle\n BaseMeshTopology::Triangle ft1;\n ft1[0] = e[0];\n ft1[1] = e[1];\n ft1[2] = e[0] + 1;\n\n \/\/second triangle\n BaseMeshTopology::Triangle ft2;\n ft2[0] = e[0] + 1;\n ft2[1] = e[1] + 1;\n ft2[2] = e[1];\n\n extrusionTriangles->push_back(ft1);\n extrusionTriangles->push_back(ft2);\n }\n }\n\n f_extrusionTriangles.endEdit();\n f_extrusionVertices.endEdit();\n}\n\ntemplate <class DataTypes>\nvoid ExtrudeSurface<DataTypes>::draw()\n{\n\n const helper::vector<BaseMeshTopology::TriangleID> &surfaceTriangles = f_surfaceTriangles.getValue();\n\n helper::vector<BaseMeshTopology::TriangleID>::const_iterator itTriangles;\n glDisable(GL_LIGHTING);\n\n if (!this->getContext()->getShowBehaviorModels())\n return;\n\n if (this->getContext()->getShowWireFrame())\n glPolygonMode(GL_FRONT_AND_BACK, GL_LINE);\n\n const helper::vector<BaseMeshTopology::Triangle> &extrusionTriangles = f_extrusionTriangles.getValue();\n const VecCoord& extrusionVertices = f_extrusionVertices.getValue();\n helper::vector<BaseMeshTopology::Triangle>::const_iterator it;\n\n \/\/Triangles From Surface\n\n glColor3f(1.0,0.0,0.0);\n glBegin(GL_TRIANGLES);\n for (unsigned int i=0 ; i<surfaceTriangles.size()*2 ; i+=2)\n {\n BaseMeshTopology::Triangle triangle = extrusionTriangles[i];\n\n for (unsigned int j=0 ; j<3 ; j++)\n {\n Coord p = (extrusionVertices[triangle[j]]);\n glVertex3f(p[0], p[1], p[2]);\n }\n }\n glEnd();\n\n \/\/Triangles From Extrusion\n glColor3f(0.0,1.0,0.0);\n glBegin(GL_TRIANGLES);\n for (unsigned int i=1 ; i<surfaceTriangles.size()*2 ; i+=2)\n {\n BaseMeshTopology::Triangle triangle = extrusionTriangles[i];\n\n for (unsigned int j=0 ; j<3 ; j++)\n {\n Coord p = (extrusionVertices[triangle[j]]);\n glVertex3f(p[0], p[1], p[2]);\n }\n }\n glEnd();\n\n \/\/Border Triangles\n glColor3f(0.0,0.0,1.0);\n glBegin(GL_TRIANGLES);\n for (unsigned int i=surfaceTriangles.size()*2 ; i<extrusionTriangles.size() ; i++)\n {\n BaseMeshTopology::Triangle triangle = extrusionTriangles[i];\n\n for (unsigned int j=0 ; j<3 ; j++)\n {\n Coord p = (extrusionVertices[triangle[j]]);\n glVertex3f(p[0], p[1], p[2]);\n }\n }\n glEnd();\n\n if (this->getContext()->getShowWireFrame())\n glPolygonMode(GL_FRONT_AND_BACK, GL_FILL);\n\n glEnable(GL_LIGHTING);\n}\n\n} \/\/ namespace engine\n\n} \/\/ namespace component\n\n} \/\/ namespace sofa\n\n#endif\n<|endoftext|>"} {"text":"<commit_before>\/**\n\\file\n\\brief Main header file for dsb::sequence.\n*\/\n#ifndef DSB_SEQUENCE_HPP\n#define DSB_SEQUENCE_HPP\n\n#include <cassert>\n#include <iterator>\n#include <memory>\n\n#include \"dsb\/config.h\"\n\n\nnamespace dsb\n{\n\n\/**\n\\brief Module that defines a sequence iteration abstraction, similar to\n standard iterators, but simpler.\n\nThe central class in this module is dsb::sequence::Sequence. Please see\nits documentation for more information.\n*\/\nnamespace sequence\n{\n\n\n\/**\n\\brief An interface for sequence implementations.\n\nTo create a new sequence type (e.g. to support a new kind of backing storage),\ncreate a class which inherits and implements this interface, and pass an\nobject of that class to the Sequence constructor.\n\n`ElementT` is the type of the elements in the sequence, i.e., the return type\nof Next().\n\n\\see Sequence\n*\/\ntemplate<typename ElementT>\nclass ISequenceImpl\n{\npublic:\n \/\/\/ Returns whether we have reached the end of the sequence.\n virtual bool Empty() = 0;\n\n \/**\n \\brief Returns the element currently at the front of the sequence\n and iterates one step past it.\n\n It is OK to assume that Empty() has, or would have, returned `false`\n before this function is called (but good practice to verify it with\n an assertion).\n *\/\n virtual ElementT Next() = 0;\n\n \/\/ Allows deletions through a base class pointer.\n virtual ~ISequenceImpl() { }\n};\n\n\n\/**\n\\brief A class that is used to iterate over a sequence of elements of\n type `ElementT`.\n\nThis class defines two functions, Empty() and Next(). The former returns\nwhether we have reached the end of the sequence, and the latter returns\nthe element at the head of the range and simultaneously iterates past it.\nThe idiomatic way to iterate a sequence is thus:\n~~~~{.cpp}\nwhile (!sequence.Empty()) {\n auto element = seq.Next();\n \/\/ Do stuff with element here\n}\n~~~~\n\nSequence objects fulfil the main purpose of standard iterators, but\nare different from them in several ways, some of which are advantages\nand others of which are drawbacks, depending on the situation:\n\n - A Sequence currently only allows one-way iteration. (In that respect\n it is similar to an [input iterator](http:\/\/www.cplusplus.com\/reference\/iterator\/InputIterator\/).)\n\n - A Sequence is actually more like a *pair* of iterators: the beginning\n and the end of the sequence. This makes it easier to use, because it\n is only necessary to keep track of one object instead of two. If `b`\n is the \"begin\" iterator and `e` is the \"end\" iterator, then Empty() is\n equivalent to `b==e`, while Next() is equivalent to `*b++`.\n\n - Iterators are typically value types, while Sequence has reference\n semantics. That is, if `a` is a sequence, and we set `b = a`, then\n calling either `a.Next()` or `b.Next()` will iterate both sequences\n one step.\n\n - The type of a Sequence only depends on the value of its elements, and\n not on the underlying container. That is, an object of type\n `Sequence<int>` may be used to iterate over the contents of a\n `std::vector<int>`, an `std::list<int>`, or even a plain array of\n `int`s.\n\n - A Sequence typically has worse performance than an iterator. This is\n related to the previous point. Polymorphic classes are used \"under the\n hood\" to hide the type of the underlying container, which means that\n calls to Empty() and Next() are indirect (virtual), and that memory for\n the underlying objects has to be dynamically allocated.\n\nThe Sequence class is just a thin wrapper around a `std::shared_ptr` to\nan object of type ISequenceImpl, which contains the actual implementation\nof the sequence. (This is how the type of the underlying container gets\nhidden.) To create a new sequence type it is therefore necessary to\ncreate a class that implements the ISequenceImpl interface.\n\nLike iterators, a Sequence object may be invalidated by changes to the\nunderlying storage. The circumstances under which this does or doesn't\nhappen are defined by the specific ISequenceImpl implementation used.\n\nFurthermore, if `ElementT` is a reference type (e.g. `int&`), it means that\nNext() returns a reference to the value in some underlying storage. In that\ncase, the lifetime of the reference is defined by the specific sequence\nimplementation.\n*\/\ntemplate<typename ElementT>\nclass Sequence\n{\npublic:\n \/\/\/ Constructs a new sequence with the given implementation.\n Sequence(std::shared_ptr<ISequenceImpl<ElementT>> impl\n = std::shared_ptr<ISequenceImpl<ElementT>>())\n : m_impl(impl)\n { }\n\n typedef ElementT ElementType;\n\n \/\/\/ Returns whether we have reached the end of the sequence.\n bool Empty() { return !m_impl.get() || m_impl->Empty(); }\n\n \/**\n \\brief Returns the element currently at the front of the sequence\n and iterates one step past it.\n\n Calling this function is only allowed if Empty() has, or would have,\n returned `false`.\n *\/\n ElementT Next() { return m_impl->Next(); }\n\nprivate:\n std::shared_ptr<ISequenceImpl<ElementT>> m_impl;\n};\n\n\n\/**\n\\brief A sequence implementation that wraps a pair of standard iterators.\n\n`Iterator` is the iterator type. The sequence is valid as long as the\niterators are valid (which again depends on the type of container iterated).\n\n\\see ArraySequence, ContainerSequence\n*\/\ntemplate<typename Iterator>\nclass IteratorSequenceImpl\n : public ISequenceImpl<typename std::iterator_traits<Iterator>::reference>\n{\npublic:\n \/**\n \\brief Constructor that takes the \"begin\" and \"end\" iterators of a\n sequence.\n\n The two iterators must be comparable.\n *\/\n IteratorSequenceImpl(Iterator begin, Iterator end)\n : m_begin(begin), m_end(end)\n { }\n\n bool Empty() DSB_FINAL override\n {\n return m_begin == m_end;\n }\n\n typename std::iterator_traits<Iterator>::reference Next() DSB_FINAL override\n {\n return *(m_begin++);\n }\n\nprivate:\n Iterator m_begin;\n Iterator m_end;\n};\n\n\n\/**\n\\brief Convenience function which returns a Sequence that iterates over the\n entire contents of a standard container.\n\nThe sequence is backed by an IteratorSequenceImpl.\n*\/\ntemplate<typename Container>\nSequence<typename std::iterator_traits<typename Container::iterator>::reference>\n ContainerSequence(Container& c)\n{\n typedef typename Container::iterator I;\n typedef typename std::iterator_traits<I>::reference E;\n return Sequence<E>(std::make_shared<IteratorSequenceImpl<I>>(\n c.begin(), c.end()));\n}\n\n\/\/ Same as the above, but for const containers.\ntemplate<typename Container>\nSequence<typename std::iterator_traits<typename Container::const_iterator>::reference>\n ContainerSequence(const Container& c)\n{\n typedef typename Container::const_iterator I;\n typedef typename std::iterator_traits<I>::reference E;\n return Sequence<E>(std::make_shared<IteratorSequenceImpl<I>>(\n c.cbegin(), c.cend()));\n}\n\n\n\/**\n\\brief Convenience function which returns a Sequence that iterates over the\n entire contents of an array.\n\nThe sequence is backed by an IteratorSequenceImpl.\n*\/\ntemplate<typename ElementT>\nSequence<ElementT&> ArraySequence(ElementT* pointer, size_t length)\n{\n return Sequence<ElementT&>(std::make_shared<IteratorSequenceImpl<ElementT*>>(\n pointer, pointer + length));\n}\n\n\n\/**\n\\brief A sequence implementation that allows iteration over the mapped values\n of a `std::map` or `std::unordered_map` (or any other type that has\n the same API).\n\nThe class stores and uses a pair of map iterators, so the sequence remains\nvalid under the same circumstances as the iterators.\n*\/\ntemplate<typename Map>\nclass MapValueSequenceImpl : public ISequenceImpl<typename Map::mapped_type&>\n{\npublic:\n \/\/\/ Constructor that takes a map object.\n MapValueSequenceImpl(Map& map)\n : m_begin(map.begin()), m_end(map.end())\n { }\n\n bool Empty() DSB_FINAL override\n {\n return m_begin == m_end;\n }\n\n typename Map::mapped_type& Next() DSB_FINAL override\n {\n return (m_begin++)->second;\n }\n\nprivate:\n typename Map::iterator m_begin;\n typename Map::iterator m_end;\n};\n\n\n\/**\n\\brief Convenience function that returns a sequence representation of the\n mapped values in a `std::map` or `std::unordered_map` (or any other\n type that has the same API).\n\nThis function allows for easy construction of a Sequence backed by a\nMapValueSequenceImpl, for example:\n~~~{.cpp}\nstd::map<int, double> m;\nSequence<double> s = MapValueSequence(m);\n~~~\n*\/\ntemplate<typename Map>\nSequence<typename Map::mapped_type&> MapValueSequence(Map& map)\n{\n return Sequence<typename Map::mapped_type&>(\n std::make_shared<MapValueSequenceImpl<Map>>(map));\n}\n\n\nnamespace detail\n{\n \/\/ Helper template that strips the & off a reference type.\n template<typename T> struct ValueType { typedef T Type; };\n template<typename T> struct ValueType<T&> { typedef T Type; };\n}\n\n\n\/**\n\\brief An implementation of an empty sequence, i.e. one for which Empty()\n is always `true`.\n*\/\ntemplate<typename ElementT>\nclass EmptySequenceImpl : public ISequenceImpl<ElementT>\n{\npublic:\n bool Empty() DSB_FINAL override { return true; }\n\n ElementT Next() DSB_FINAL override\n {\n assert(!\"Next() called on empty sequence\");\n return *(static_cast<typename detail::ValueType<ElementT>::Type*>(nullptr));\n }\n};\n\n\n\/\/\/ Returns an empty sequence, i.e. one for which Empty() is always `true`.\ntemplate<typename ElementT>\nSequence<ElementT> EmptySequence()\n{\n return Sequence<ElementT>(std::make_shared<EmptySequenceImpl<ElementT>>());\n}\n\n\n}} \/\/ namespace\n#endif \/\/ header guard\n<commit_msg>Added ConstSequence()<commit_after>\/**\n\\file\n\\brief Main header file for dsb::sequence.\n*\/\n#ifndef DSB_SEQUENCE_HPP\n#define DSB_SEQUENCE_HPP\n\n#include <cassert>\n#include <iterator>\n#include <memory>\n\n#include \"dsb\/config.h\"\n\n\nnamespace dsb\n{\n\n\/**\n\\brief Module that defines a sequence iteration abstraction, similar to\n standard iterators, but simpler.\n\nThe central class in this module is dsb::sequence::Sequence. Please see\nits documentation for more information.\n*\/\nnamespace sequence\n{\n\n\n\/**\n\\brief An interface for sequence implementations.\n\nTo create a new sequence type (e.g. to support a new kind of backing storage),\ncreate a class which inherits and implements this interface, and pass an\nobject of that class to the Sequence constructor.\n\n`ElementT` is the type of the elements in the sequence, i.e., the return type\nof Next().\n\n\\see Sequence\n*\/\ntemplate<typename ElementT>\nclass ISequenceImpl\n{\npublic:\n \/\/\/ Returns whether we have reached the end of the sequence.\n virtual bool Empty() = 0;\n\n \/**\n \\brief Returns the element currently at the front of the sequence\n and iterates one step past it.\n\n It is OK to assume that Empty() has, or would have, returned `false`\n before this function is called (but good practice to verify it with\n an assertion).\n *\/\n virtual ElementT Next() = 0;\n\n \/\/ Allows deletions through a base class pointer.\n virtual ~ISequenceImpl() { }\n};\n\n\n\/**\n\\brief A class that is used to iterate over a sequence of elements of\n type `ElementT`.\n\nThis class defines two functions, Empty() and Next(). The former returns\nwhether we have reached the end of the sequence, and the latter returns\nthe element at the head of the range and simultaneously iterates past it.\nThe idiomatic way to iterate a sequence is thus:\n~~~~{.cpp}\nwhile (!sequence.Empty()) {\n auto element = seq.Next();\n \/\/ Do stuff with element here\n}\n~~~~\n\nSequence objects fulfil the main purpose of standard iterators, but\nare different from them in several ways, some of which are advantages\nand others of which are drawbacks, depending on the situation:\n\n - A Sequence currently only allows one-way iteration. (In that respect\n it is similar to an [input iterator](http:\/\/www.cplusplus.com\/reference\/iterator\/InputIterator\/).)\n\n - A Sequence is actually more like a *pair* of iterators: the beginning\n and the end of the sequence. This makes it easier to use, because it\n is only necessary to keep track of one object instead of two. If `b`\n is the \"begin\" iterator and `e` is the \"end\" iterator, then Empty() is\n equivalent to `b==e`, while Next() is equivalent to `*b++`.\n\n - Iterators are typically value types, while Sequence has reference\n semantics. That is, if `a` is a sequence, and we set `b = a`, then\n calling either `a.Next()` or `b.Next()` will iterate both sequences\n one step.\n\n - The type of a Sequence only depends on the value of its elements, and\n not on the underlying container. That is, an object of type\n `Sequence<int>` may be used to iterate over the contents of a\n `std::vector<int>`, an `std::list<int>`, or even a plain array of\n `int`s.\n\n - A Sequence typically has worse performance than an iterator. This is\n related to the previous point. Polymorphic classes are used \"under the\n hood\" to hide the type of the underlying container, which means that\n calls to Empty() and Next() are indirect (virtual), and that memory for\n the underlying objects has to be dynamically allocated.\n\nThe Sequence class is just a thin wrapper around a `std::shared_ptr` to\nan object of type ISequenceImpl, which contains the actual implementation\nof the sequence. (This is how the type of the underlying container gets\nhidden.) To create a new sequence type it is therefore necessary to\ncreate a class that implements the ISequenceImpl interface.\n\nLike iterators, a Sequence object may be invalidated by changes to the\nunderlying storage. The circumstances under which this does or doesn't\nhappen are defined by the specific ISequenceImpl implementation used.\n\nFurthermore, if `ElementT` is a reference type (e.g. `int&`), it means that\nNext() returns a reference to the value in some underlying storage. In that\ncase, the lifetime of the reference is defined by the specific sequence\nimplementation.\n*\/\ntemplate<typename ElementT>\nclass Sequence\n{\npublic:\n \/\/\/ Constructs a new sequence with the given implementation.\n Sequence(std::shared_ptr<ISequenceImpl<ElementT>> impl\n = std::shared_ptr<ISequenceImpl<ElementT>>())\n : m_impl(impl)\n { }\n\n typedef ElementT ElementType;\n\n \/\/\/ Returns whether we have reached the end of the sequence.\n bool Empty() { return !m_impl.get() || m_impl->Empty(); }\n\n \/**\n \\brief Returns the element currently at the front of the sequence\n and iterates one step past it.\n\n Calling this function is only allowed if Empty() has, or would have,\n returned `false`.\n *\/\n ElementT Next() { return m_impl->Next(); }\n\nprivate:\n std::shared_ptr<ISequenceImpl<ElementT>> m_impl;\n};\n\n\n\/**\n\\brief A sequence implementation that wraps a pair of standard iterators.\n\n`Iterator` is the iterator type. The sequence is valid as long as the\niterators are valid (which again depends on the type of container iterated).\n\n\\see ArraySequence, ContainerSequence\n*\/\ntemplate<typename Iterator>\nclass IteratorSequenceImpl\n : public ISequenceImpl<typename std::iterator_traits<Iterator>::reference>\n{\npublic:\n \/**\n \\brief Constructor that takes the \"begin\" and \"end\" iterators of a\n sequence.\n\n The two iterators must be comparable.\n *\/\n IteratorSequenceImpl(Iterator begin, Iterator end)\n : m_begin(begin), m_end(end)\n { }\n\n bool Empty() DSB_FINAL override\n {\n return m_begin == m_end;\n }\n\n typename std::iterator_traits<Iterator>::reference Next() DSB_FINAL override\n {\n return *(m_begin++);\n }\n\nprivate:\n Iterator m_begin;\n Iterator m_end;\n};\n\n\n\/**\n\\brief Convenience function which returns a Sequence that iterates over the\n entire contents of a standard container.\n\nThe sequence is backed by an IteratorSequenceImpl.\n*\/\ntemplate<typename Container>\nSequence<typename std::iterator_traits<typename Container::iterator>::reference>\n ContainerSequence(Container& c)\n{\n typedef typename Container::iterator I;\n typedef typename std::iterator_traits<I>::reference E;\n return Sequence<E>(std::make_shared<IteratorSequenceImpl<I>>(\n c.begin(), c.end()));\n}\n\n\/\/ Same as the above, but for const containers.\ntemplate<typename Container>\nSequence<typename std::iterator_traits<typename Container::const_iterator>::reference>\n ContainerSequence(const Container& c)\n{\n typedef typename Container::const_iterator I;\n typedef typename std::iterator_traits<I>::reference E;\n return Sequence<E>(std::make_shared<IteratorSequenceImpl<I>>(\n c.cbegin(), c.cend()));\n}\n\n\n\/**\n\\brief Convenience function which returns a Sequence that iterates over the\n entire contents of an array.\n\nThe sequence is backed by an IteratorSequenceImpl.\n*\/\ntemplate<typename ElementT>\nSequence<ElementT&> ArraySequence(ElementT* pointer, size_t length)\n{\n return Sequence<ElementT&>(std::make_shared<IteratorSequenceImpl<ElementT*>>(\n pointer, pointer + length));\n}\n\n\n\/**\n\\brief A sequence implementation that allows iteration over the mapped values\n of a `std::map` or `std::unordered_map` (or any other type that has\n the same API).\n\nThe class stores and uses a pair of map iterators, so the sequence remains\nvalid under the same circumstances as the iterators.\n*\/\ntemplate<typename Map>\nclass MapValueSequenceImpl : public ISequenceImpl<typename Map::mapped_type&>\n{\npublic:\n \/\/\/ Constructor that takes a map object.\n MapValueSequenceImpl(Map& map)\n : m_begin(map.begin()), m_end(map.end())\n { }\n\n bool Empty() DSB_FINAL override\n {\n return m_begin == m_end;\n }\n\n typename Map::mapped_type& Next() DSB_FINAL override\n {\n return (m_begin++)->second;\n }\n\nprivate:\n typename Map::iterator m_begin;\n typename Map::iterator m_end;\n};\n\n\n\/**\n\\brief Convenience function that returns a sequence representation of the\n mapped values in a `std::map` or `std::unordered_map` (or any other\n type that has the same API).\n\nThis function allows for easy construction of a Sequence backed by a\nMapValueSequenceImpl, for example:\n~~~{.cpp}\nstd::map<int, double> m;\nSequence<double> s = MapValueSequence(m);\n~~~\n*\/\ntemplate<typename Map>\nSequence<typename Map::mapped_type&> MapValueSequence(Map& map)\n{\n return Sequence<typename Map::mapped_type&>(\n std::make_shared<MapValueSequenceImpl<Map>>(map));\n}\n\n\nnamespace detail\n{\n \/\/ Helper template that strips the & off a reference type.\n template<typename T> struct ValueType { typedef T Type; };\n template<typename T> struct ValueType<T&> { typedef T Type; };\n}\n\n\n\/**\n\\brief An implementation of an empty sequence, i.e. one for which Empty()\n is always `true`.\n*\/\ntemplate<typename ElementT>\nclass EmptySequenceImpl : public ISequenceImpl<ElementT>\n{\npublic:\n bool Empty() DSB_FINAL override { return true; }\n\n ElementT Next() DSB_FINAL override\n {\n assert(!\"Next() called on empty sequence\");\n return *(static_cast<typename detail::ValueType<ElementT>::Type*>(nullptr));\n }\n};\n\n\n\/\/\/ Returns an empty sequence, i.e. one for which Empty() is always `true`.\ntemplate<typename ElementT>\nSequence<ElementT> EmptySequence()\n{\n return Sequence<ElementT>(std::make_shared<EmptySequenceImpl<ElementT>>());\n}\n\n\n\/\/ A read-only view of another sequence; see ConstSequence().\ntemplate<typename DerefElementT>\nclass ConstSequenceImpl : public ISequenceImpl<const DerefElementT&>\n{\npublic:\n ConstSequenceImpl(Sequence<DerefElementT&> wrapThis) : m_wrapped(wrapThis) { }\n bool Empty() DSB_FINAL override { return m_wrapped.Empty(); }\n const DerefElementT& Next() DSB_FINAL override { return m_wrapped.Next(); }\nprivate:\n Sequence<DerefElementT&> m_wrapped;\n};\n\n\n\/**\n\\brief Returns a sequence which provides a read-only view of the elements in\n another sequence.\n*\/\ntemplate<typename DerefElementT>\nSequence<const DerefElementT&> ConstSequence(Sequence<DerefElementT&> sequence)\n{\n return Sequence<const DerefElementT&>(\n std::make_shared<ConstSequenceImpl<DerefElementT>>(sequence));\n}\n\n\n}} \/\/ namespace\n#endif \/\/ header guard\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 \"webkit\/glue\/plugins\/test\/plugin_client.h\"\n#include \"webkit\/glue\/plugins\/test\/plugin_arguments_test.h\"\n#include \"webkit\/glue\/plugins\/test\/plugin_delete_plugin_in_stream_test.h\"\n#include \"webkit\/glue\/plugins\/test\/plugin_get_javascript_url_test.h\"\n#include \"webkit\/glue\/plugins\/test\/plugin_geturl_test.h\"\n#include \"webkit\/glue\/plugins\/test\/plugin_javascript_open_popup.h\"\n#include \"webkit\/glue\/plugins\/test\/plugin_new_fails_test.h\"\n#include \"webkit\/glue\/plugins\/test\/plugin_private_test.h\"\n#include \"webkit\/glue\/plugins\/test\/plugin_npobject_lifetime_test.h\"\n#include \"webkit\/glue\/plugins\/test\/plugin_npobject_proxy_test.h\"\n#include \"webkit\/glue\/plugins\/test\/plugin_window_size_test.h\"\n#include \"webkit\/glue\/plugins\/test\/plugin_windowless_test.h\"\n#include \"third_party\/npapi\/bindings\/npapi.h\"\n#include \"third_party\/npapi\/bindings\/npruntime.h\"\n\nnamespace NPAPIClient {\n\nNPNetscapeFuncs* PluginClient::host_functions_;\n\nNPError PluginClient::GetEntryPoints(NPPluginFuncs* pFuncs) {\n if (pFuncs == NULL)\n return NPERR_INVALID_FUNCTABLE_ERROR;\n\n if (pFuncs->size < sizeof(NPPluginFuncs))\n return NPERR_INVALID_FUNCTABLE_ERROR;\n\n pFuncs->version = (NP_VERSION_MAJOR << 8) | NP_VERSION_MINOR;\n pFuncs->newp = NPP_New;\n pFuncs->destroy = NPP_Destroy;\n pFuncs->setwindow = NPP_SetWindow;\n pFuncs->newstream = NPP_NewStream;\n pFuncs->destroystream = NPP_DestroyStream;\n pFuncs->asfile = NPP_StreamAsFile;\n pFuncs->writeready = NPP_WriteReady;\n pFuncs->write = NPP_Write;\n pFuncs->print = NPP_Print;\n pFuncs->event = NPP_HandleEvent;\n pFuncs->urlnotify = NPP_URLNotify;\n pFuncs->getvalue = NPP_GetValue;\n pFuncs->setvalue = NPP_SetValue;\n pFuncs->javaClass = static_cast<JRIGlobalRef>(NPP_GetJavaClass);\n\n return NPERR_NO_ERROR;\n}\n\nNPError PluginClient::Initialize(NPNetscapeFuncs* pFuncs) {\n if (pFuncs == NULL) {\n return NPERR_INVALID_FUNCTABLE_ERROR;\n }\n\n if (static_cast<unsigned char>((pFuncs->version >> 8) & 0xff) >\n NP_VERSION_MAJOR) {\n return NPERR_INCOMPATIBLE_VERSION_ERROR;\n }\n\n host_functions_ = pFuncs;\n\n return NPERR_NO_ERROR;\n}\n\nNPError PluginClient::Shutdown() {\n return NPERR_NO_ERROR;\n}\n\n} \/\/ namespace NPAPIClient\n\nextern \"C\" {\nNPError NPP_New(NPMIMEType pluginType, NPP instance, uint16 mode,\n int16 argc, char* argn[], char* argv[], NPSavedData* saved) {\n if (instance == NULL)\n return NPERR_INVALID_INSTANCE_ERROR;\n\n \/\/ We look at the test name requested via the plugin arguments. We match\n \/\/ that against a given test and try to instantiate it.\n\n \/\/ lookup the name parameter\n std::string test_name;\n for (int name_index = 0; name_index < argc; name_index++)\n if (base::strcasecmp(argn[name_index], \"name\") == 0) {\n test_name = argv[name_index];\n break;\n }\n\n if (test_name.empty())\n return NPERR_GENERIC_ERROR; \/\/ no name found\n\n NPError ret = NPERR_GENERIC_ERROR;\n bool windowless_plugin = false;\n \n NPAPIClient::PluginTest *new_test = NULL;\n if (test_name == \"arguments\") {\n new_test = new NPAPIClient::PluginArgumentsTest(instance,\n NPAPIClient::PluginClient::HostFunctions());\n } else if (test_name == \"geturl\") {\n new_test = new NPAPIClient::PluginGetURLTest(instance,\n NPAPIClient::PluginClient::HostFunctions());\n } else if (test_name == \"npobject_proxy\") {\n new_test = new NPAPIClient::NPObjectProxyTest(instance,\n NPAPIClient::PluginClient::HostFunctions());\n#if defined(OS_WIN)\n \/\/ TODO(port): plugin_windowless_test.*.\n } else if (test_name == \"execute_script_delete_in_paint\" ||\n test_name == \"execute_script_delete_in_mouse_move\" ||\n test_name == \"delete_frame_test\") {\n new_test = new NPAPIClient::WindowlessPluginTest(instance,\n NPAPIClient::PluginClient::HostFunctions(), test_name);\n windowless_plugin = true;\n#endif\n } else if (test_name == \"getjavascripturl\") {\n new_test = new NPAPIClient::ExecuteGetJavascriptUrlTest(instance,\n NPAPIClient::PluginClient::HostFunctions());\n#if defined(OS_WIN)\n \/\/ TODO(port): plugin_window_size_test.*.\n } else if (test_name == \"checkwindowrect\") {\n new_test = new NPAPIClient::PluginWindowSizeTest(instance,\n NPAPIClient::PluginClient::HostFunctions());\n#endif\n } else if (test_name == \"self_delete_plugin_stream\") {\n new_test = new NPAPIClient::DeletePluginInStreamTest(instance,\n NPAPIClient::PluginClient::HostFunctions());\n#if defined(OS_WIN)\n \/\/ TODO(port): plugin_npobject_lifetime_test.*.\n } else if (test_name == \"npobject_lifetime_test\") {\n new_test = new NPAPIClient::NPObjectLifetimeTest(instance,\n NPAPIClient::PluginClient::HostFunctions());\n } else if (test_name == \"npobject_lifetime_test_second_instance\") {\n new_test = new NPAPIClient::NPObjectLifetimeTestInstance2(instance,\n NPAPIClient::PluginClient::HostFunctions());\n } else if (test_name == \"new_fails\") {\n new_test = new NPAPIClient::NewFailsTest(instance,\n NPAPIClient::PluginClient::HostFunctions());\n } else if (test_name == \"npobject_delete_plugin_in_evaluate\") {\n new_test = new NPAPIClient::NPObjectDeletePluginInNPN_Evaluate(instance,\n NPAPIClient::PluginClient::HostFunctions());\n#endif\n } else if (test_name ==\n \"plugin_javascript_open_popup_with_plugin\") {\n new_test = new NPAPIClient::ExecuteJavascriptOpenPopupWithPluginTest(\n instance, NPAPIClient::PluginClient::HostFunctions());\n } else if (test_name == \"plugin_popup_with_plugin_target\") {\n new_test = new NPAPIClient::ExecuteJavascriptPopupWindowTargetPluginTest(\n instance, NPAPIClient::PluginClient::HostFunctions());\n } else if (test_name == \"private\") {\n new_test = new NPAPIClient::PrivateTest(instance,\n NPAPIClient::PluginClient::HostFunctions());\n } else {\n \/\/ If we don't have a test case for this, create a\n \/\/ generic one which basically never fails.\n LOG(WARNING) << \"Unknown test name '\" << test_name\n << \"'; using default test.\";\n new_test = new NPAPIClient::PluginTest(instance,\n NPAPIClient::PluginClient::HostFunctions());\n }\n\n if (new_test) {\n ret = new_test->New(mode, argc, (const char**)argn,\n (const char**)argv, saved);\n if ((ret == NPERR_NO_ERROR) && windowless_plugin) {\n NPAPIClient::PluginClient::HostFunctions()->setvalue(\n instance, NPPVpluginWindowBool, NULL);\n }\n }\n\n return ret;\n}\n\nNPError NPP_Destroy(NPP instance, NPSavedData** save) {\n if (instance == NULL)\n return NPERR_INVALID_INSTANCE_ERROR;\n\n NPAPIClient::PluginTest *plugin =\n (NPAPIClient::PluginTest*)instance->pdata;\n delete plugin;\n\n \/\/ XXXMB - do work here.\n return NPERR_GENERIC_ERROR;\n}\n\nNPError NPP_SetWindow(NPP instance, NPWindow* pNPWindow) {\n if (instance == NULL)\n return NPERR_INVALID_INSTANCE_ERROR;\n\n if (pNPWindow->window == NULL) {\n return NPERR_NO_ERROR;\n }\n\n NPAPIClient::PluginTest *plugin =\n (NPAPIClient::PluginTest*)instance->pdata;\n\n return plugin->SetWindow(pNPWindow);\n}\n\nNPError NPP_NewStream(NPP instance, NPMIMEType type,\n NPStream* stream, NPBool seekable, uint16* stype) {\n if (instance == NULL)\n return NPERR_INVALID_INSTANCE_ERROR;\n\n NPAPIClient::PluginTest *plugin =\n (NPAPIClient::PluginTest*)instance->pdata;\n\n return plugin->NewStream(type, stream, seekable, stype);\n}\n\nint32 NPP_WriteReady(NPP instance, NPStream *stream) {\n if (instance == NULL)\n return NPERR_INVALID_INSTANCE_ERROR;\n\n NPAPIClient::PluginTest *plugin =\n (NPAPIClient::PluginTest*)instance->pdata;\n\n return plugin->WriteReady(stream);\n}\n\nint32 NPP_Write(NPP instance, NPStream *stream, int32 offset,\n int32 len, void *buffer) {\n if (instance == NULL)\n return NPERR_INVALID_INSTANCE_ERROR;\n\n NPAPIClient::PluginTest *plugin =\n (NPAPIClient::PluginTest*)instance->pdata;\n\n return plugin->Write(stream, offset, len, buffer);\n}\n\nNPError NPP_DestroyStream(NPP instance, NPStream *stream, NPError reason) {\n if (instance == NULL)\n return NPERR_INVALID_INSTANCE_ERROR;\n\n NPAPIClient::PluginTest *plugin =\n (NPAPIClient::PluginTest*)instance->pdata;\n\n return plugin->DestroyStream(stream, reason);\n}\n\nvoid NPP_StreamAsFile(NPP instance, NPStream* stream, const char* fname) {\n if (instance == NULL)\n return;\n\n NPAPIClient::PluginTest *plugin =\n (NPAPIClient::PluginTest*)instance->pdata;\n\n return plugin->StreamAsFile(stream, fname);\n}\n\nvoid NPP_Print(NPP instance, NPPrint* printInfo) {\n if (instance == NULL)\n return;\n\n \/\/ XXXMB - do work here.\n}\n\nvoid NPP_URLNotify(NPP instance, const char* url, NPReason reason,\n void* notifyData) {\n if (instance == NULL)\n return;\n\n NPAPIClient::PluginTest *plugin =\n (NPAPIClient::PluginTest*)instance->pdata;\n\n return plugin->URLNotify(url, reason, notifyData);\n}\n\nNPError NPP_GetValue(NPP instance, NPPVariable variable, void *value) {\n if (instance == NULL)\n return NPERR_INVALID_INSTANCE_ERROR;\n\n \/\/ XXXMB - do work here.\n return NPERR_GENERIC_ERROR;\n}\n\nNPError NPP_SetValue(NPP instance, NPNVariable variable, void *value) {\n if (instance == NULL)\n return NPERR_INVALID_INSTANCE_ERROR;\n\n \/\/ XXXMB - do work here.\n return NPERR_GENERIC_ERROR;\n}\n\nint16 NPP_HandleEvent(NPP instance, void* event) {\n if (instance == NULL)\n return 0;\n\n NPAPIClient::PluginTest *plugin =\n (NPAPIClient::PluginTest*)instance->pdata;\n\n return plugin->HandleEvent(event);\n}\n\nvoid* NPP_GetJavaClass(void) {\n \/\/ XXXMB - do work here.\n return NULL;\n}\n} \/\/ extern \"C\"\n<commit_msg>Fix build break due to incorrect merge, TBR=awalker<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 \"webkit\/glue\/plugins\/test\/plugin_client.h\"\n#include \"webkit\/glue\/plugins\/test\/plugin_arguments_test.h\"\n#include \"webkit\/glue\/plugins\/test\/plugin_delete_plugin_in_stream_test.h\"\n#include \"webkit\/glue\/plugins\/test\/plugin_get_javascript_url_test.h\"\n#include \"webkit\/glue\/plugins\/test\/plugin_geturl_test.h\"\n#include \"webkit\/glue\/plugins\/test\/plugin_javascript_open_popup.h\"\n#include \"webkit\/glue\/plugins\/test\/plugin_new_fails_test.h\"\n#include \"webkit\/glue\/plugins\/test\/plugin_private_test.h\"\n#include \"webkit\/glue\/plugins\/test\/plugin_npobject_lifetime_test.h\"\n#include \"webkit\/glue\/plugins\/test\/plugin_npobject_proxy_test.h\"\n#include \"webkit\/glue\/plugins\/test\/plugin_window_size_test.h\"\n#include \"webkit\/glue\/plugins\/test\/plugin_windowless_test.h\"\n#include \"third_party\/npapi\/bindings\/npapi.h\"\n#include \"third_party\/npapi\/bindings\/npruntime.h\"\n\nnamespace NPAPIClient {\n\nNPNetscapeFuncs* PluginClient::host_functions_;\n\nNPError PluginClient::GetEntryPoints(NPPluginFuncs* pFuncs) {\n if (pFuncs == NULL)\n return NPERR_INVALID_FUNCTABLE_ERROR;\n\n if (pFuncs->size < sizeof(NPPluginFuncs))\n return NPERR_INVALID_FUNCTABLE_ERROR;\n\n pFuncs->version = (NP_VERSION_MAJOR << 8) | NP_VERSION_MINOR;\n pFuncs->newp = NPP_New;\n pFuncs->destroy = NPP_Destroy;\n pFuncs->setwindow = NPP_SetWindow;\n pFuncs->newstream = NPP_NewStream;\n pFuncs->destroystream = NPP_DestroyStream;\n pFuncs->asfile = NPP_StreamAsFile;\n pFuncs->writeready = NPP_WriteReady;\n pFuncs->write = NPP_Write;\n pFuncs->print = NPP_Print;\n pFuncs->event = NPP_HandleEvent;\n pFuncs->urlnotify = NPP_URLNotify;\n pFuncs->getvalue = NPP_GetValue;\n pFuncs->setvalue = NPP_SetValue;\n pFuncs->javaClass = reinterpret_cast<JRIGlobalRef>(NPP_GetJavaClass);\n\n return NPERR_NO_ERROR;\n}\n\nNPError PluginClient::Initialize(NPNetscapeFuncs* pFuncs) {\n if (pFuncs == NULL) {\n return NPERR_INVALID_FUNCTABLE_ERROR;\n }\n\n if (static_cast<unsigned char>((pFuncs->version >> 8) & 0xff) >\n NP_VERSION_MAJOR) {\n return NPERR_INCOMPATIBLE_VERSION_ERROR;\n }\n\n host_functions_ = pFuncs;\n\n return NPERR_NO_ERROR;\n}\n\nNPError PluginClient::Shutdown() {\n return NPERR_NO_ERROR;\n}\n\n} \/\/ namespace NPAPIClient\n\nextern \"C\" {\nNPError NPP_New(NPMIMEType pluginType, NPP instance, uint16 mode,\n int16 argc, char* argn[], char* argv[], NPSavedData* saved) {\n if (instance == NULL)\n return NPERR_INVALID_INSTANCE_ERROR;\n\n \/\/ We look at the test name requested via the plugin arguments. We match\n \/\/ that against a given test and try to instantiate it.\n\n \/\/ lookup the name parameter\n std::string test_name;\n for (int name_index = 0; name_index < argc; name_index++)\n if (base::strcasecmp(argn[name_index], \"name\") == 0) {\n test_name = argv[name_index];\n break;\n }\n\n if (test_name.empty())\n return NPERR_GENERIC_ERROR; \/\/ no name found\n\n NPError ret = NPERR_GENERIC_ERROR;\n bool windowless_plugin = false;\n \n NPAPIClient::PluginTest *new_test = NULL;\n if (test_name == \"arguments\") {\n new_test = new NPAPIClient::PluginArgumentsTest(instance,\n NPAPIClient::PluginClient::HostFunctions());\n } else if (test_name == \"geturl\") {\n new_test = new NPAPIClient::PluginGetURLTest(instance,\n NPAPIClient::PluginClient::HostFunctions());\n } else if (test_name == \"npobject_proxy\") {\n new_test = new NPAPIClient::NPObjectProxyTest(instance,\n NPAPIClient::PluginClient::HostFunctions());\n#if defined(OS_WIN)\n \/\/ TODO(port): plugin_windowless_test.*.\n } else if (test_name == \"execute_script_delete_in_paint\" ||\n test_name == \"execute_script_delete_in_mouse_move\" ||\n test_name == \"delete_frame_test\") {\n new_test = new NPAPIClient::WindowlessPluginTest(instance,\n NPAPIClient::PluginClient::HostFunctions(), test_name);\n windowless_plugin = true;\n#endif\n } else if (test_name == \"getjavascripturl\") {\n new_test = new NPAPIClient::ExecuteGetJavascriptUrlTest(instance,\n NPAPIClient::PluginClient::HostFunctions());\n#if defined(OS_WIN)\n \/\/ TODO(port): plugin_window_size_test.*.\n } else if (test_name == \"checkwindowrect\") {\n new_test = new NPAPIClient::PluginWindowSizeTest(instance,\n NPAPIClient::PluginClient::HostFunctions());\n#endif\n } else if (test_name == \"self_delete_plugin_stream\") {\n new_test = new NPAPIClient::DeletePluginInStreamTest(instance,\n NPAPIClient::PluginClient::HostFunctions());\n#if defined(OS_WIN)\n \/\/ TODO(port): plugin_npobject_lifetime_test.*.\n } else if (test_name == \"npobject_lifetime_test\") {\n new_test = new NPAPIClient::NPObjectLifetimeTest(instance,\n NPAPIClient::PluginClient::HostFunctions());\n } else if (test_name == \"npobject_lifetime_test_second_instance\") {\n new_test = new NPAPIClient::NPObjectLifetimeTestInstance2(instance,\n NPAPIClient::PluginClient::HostFunctions());\n } else if (test_name == \"new_fails\") {\n new_test = new NPAPIClient::NewFailsTest(instance,\n NPAPIClient::PluginClient::HostFunctions());\n } else if (test_name == \"npobject_delete_plugin_in_evaluate\") {\n new_test = new NPAPIClient::NPObjectDeletePluginInNPN_Evaluate(instance,\n NPAPIClient::PluginClient::HostFunctions());\n#endif\n } else if (test_name ==\n \"plugin_javascript_open_popup_with_plugin\") {\n new_test = new NPAPIClient::ExecuteJavascriptOpenPopupWithPluginTest(\n instance, NPAPIClient::PluginClient::HostFunctions());\n } else if (test_name == \"plugin_popup_with_plugin_target\") {\n new_test = new NPAPIClient::ExecuteJavascriptPopupWindowTargetPluginTest(\n instance, NPAPIClient::PluginClient::HostFunctions());\n } else if (test_name == \"private\") {\n new_test = new NPAPIClient::PrivateTest(instance,\n NPAPIClient::PluginClient::HostFunctions());\n } else {\n \/\/ If we don't have a test case for this, create a\n \/\/ generic one which basically never fails.\n LOG(WARNING) << \"Unknown test name '\" << test_name\n << \"'; using default test.\";\n new_test = new NPAPIClient::PluginTest(instance,\n NPAPIClient::PluginClient::HostFunctions());\n }\n\n if (new_test) {\n ret = new_test->New(mode, argc, (const char**)argn,\n (const char**)argv, saved);\n if ((ret == NPERR_NO_ERROR) && windowless_plugin) {\n NPAPIClient::PluginClient::HostFunctions()->setvalue(\n instance, NPPVpluginWindowBool, NULL);\n }\n }\n\n return ret;\n}\n\nNPError NPP_Destroy(NPP instance, NPSavedData** save) {\n if (instance == NULL)\n return NPERR_INVALID_INSTANCE_ERROR;\n\n NPAPIClient::PluginTest *plugin =\n (NPAPIClient::PluginTest*)instance->pdata;\n delete plugin;\n\n \/\/ XXXMB - do work here.\n return NPERR_GENERIC_ERROR;\n}\n\nNPError NPP_SetWindow(NPP instance, NPWindow* pNPWindow) {\n if (instance == NULL)\n return NPERR_INVALID_INSTANCE_ERROR;\n\n if (pNPWindow->window == NULL) {\n return NPERR_NO_ERROR;\n }\n\n NPAPIClient::PluginTest *plugin =\n (NPAPIClient::PluginTest*)instance->pdata;\n\n return plugin->SetWindow(pNPWindow);\n}\n\nNPError NPP_NewStream(NPP instance, NPMIMEType type,\n NPStream* stream, NPBool seekable, uint16* stype) {\n if (instance == NULL)\n return NPERR_INVALID_INSTANCE_ERROR;\n\n NPAPIClient::PluginTest *plugin =\n (NPAPIClient::PluginTest*)instance->pdata;\n\n return plugin->NewStream(type, stream, seekable, stype);\n}\n\nint32 NPP_WriteReady(NPP instance, NPStream *stream) {\n if (instance == NULL)\n return NPERR_INVALID_INSTANCE_ERROR;\n\n NPAPIClient::PluginTest *plugin =\n (NPAPIClient::PluginTest*)instance->pdata;\n\n return plugin->WriteReady(stream);\n}\n\nint32 NPP_Write(NPP instance, NPStream *stream, int32 offset,\n int32 len, void *buffer) {\n if (instance == NULL)\n return NPERR_INVALID_INSTANCE_ERROR;\n\n NPAPIClient::PluginTest *plugin =\n (NPAPIClient::PluginTest*)instance->pdata;\n\n return plugin->Write(stream, offset, len, buffer);\n}\n\nNPError NPP_DestroyStream(NPP instance, NPStream *stream, NPError reason) {\n if (instance == NULL)\n return NPERR_INVALID_INSTANCE_ERROR;\n\n NPAPIClient::PluginTest *plugin =\n (NPAPIClient::PluginTest*)instance->pdata;\n\n return plugin->DestroyStream(stream, reason);\n}\n\nvoid NPP_StreamAsFile(NPP instance, NPStream* stream, const char* fname) {\n if (instance == NULL)\n return;\n\n NPAPIClient::PluginTest *plugin =\n (NPAPIClient::PluginTest*)instance->pdata;\n\n return plugin->StreamAsFile(stream, fname);\n}\n\nvoid NPP_Print(NPP instance, NPPrint* printInfo) {\n if (instance == NULL)\n return;\n\n \/\/ XXXMB - do work here.\n}\n\nvoid NPP_URLNotify(NPP instance, const char* url, NPReason reason,\n void* notifyData) {\n if (instance == NULL)\n return;\n\n NPAPIClient::PluginTest *plugin =\n (NPAPIClient::PluginTest*)instance->pdata;\n\n return plugin->URLNotify(url, reason, notifyData);\n}\n\nNPError NPP_GetValue(NPP instance, NPPVariable variable, void *value) {\n if (instance == NULL)\n return NPERR_INVALID_INSTANCE_ERROR;\n\n \/\/ XXXMB - do work here.\n return NPERR_GENERIC_ERROR;\n}\n\nNPError NPP_SetValue(NPP instance, NPNVariable variable, void *value) {\n if (instance == NULL)\n return NPERR_INVALID_INSTANCE_ERROR;\n\n \/\/ XXXMB - do work here.\n return NPERR_GENERIC_ERROR;\n}\n\nint16 NPP_HandleEvent(NPP instance, void* event) {\n if (instance == NULL)\n return 0;\n\n NPAPIClient::PluginTest *plugin =\n (NPAPIClient::PluginTest*)instance->pdata;\n\n return plugin->HandleEvent(event);\n}\n\nvoid* NPP_GetJavaClass(void) {\n \/\/ XXXMB - do work here.\n return NULL;\n}\n} \/\/ extern \"C\"\n<|endoftext|>"} {"text":"<commit_before>#include <ir\/index_manager\/index\/Indexer.h>\r\n#include <ir\/index_manager\/index\/FieldIndexer.h>\r\n#include <ir\/index_manager\/index\/TermReader.h>\r\n#include <ir\/index_manager\/index\/TermPositions.h>\r\n\r\n#include <boost\/filesystem.hpp>\r\n#include <boost\/filesystem\/path.hpp>\r\n\r\nusing namespace std;\r\n\r\nnamespace bfs = boost::filesystem;\r\n\r\nNS_IZENELIB_IR_BEGIN\r\n\r\nnamespace indexmanager\r\n{\r\n\r\nFieldIndexer::FieldIndexer(const char* field, MemCache* pCache, Indexer* pIndexer)\r\n :field_(field),pMemCache_(pCache),pIndexer_(pIndexer),vocFilePointer_(0),alloc_(0),sorter_(0),termCount_(0)\r\n{\r\n skipInterval_ = pIndexer_->getSkipInterval();\r\n maxSkipLevel_ = pIndexer_->getMaxSkipLevel();\r\n if (! pIndexer_->isRealTime())\r\n {\r\n std::string sorterName = field_+\".tmp\";\r\n bfs::path path(bfs::path(pIndexer->pConfigurationManager_->indexStrategy_.indexLocation_) \/bfs::path(sorterName));\r\n sorterFullPath_= path.string();\r\n sorter_=new izenelib::am::IzeneSort<uint32_t, uint8_t, true>(sorterFullPath_.c_str(), 120000000);\r\n }\r\n else\r\n alloc_ = new boost::scoped_alloc(recycle_);\r\n}\r\n\r\nFieldIndexer::~FieldIndexer()\r\n{\r\n \/*\r\n InMemoryPostingMap::iterator iter = postingMap_.begin()\r\n for(; iter !=postingMap_.end(); ++iter)\r\n {\r\n delete iter->second;\r\n }\r\n *\/\r\n if (alloc_) delete alloc_;\r\n pMemCache_ = NULL;\r\n if (sorter_) delete sorter_;\r\n}\r\n\r\nvoid convert(char* data, uint32_t termId, uint32_t docId, uint32_t offset)\r\n{\r\n char* pData = data;\r\n memcpy(pData, &(termId), sizeof(termId));\r\n pData += sizeof(termId);\r\n memcpy(pData, &(docId), sizeof(docId));\r\n pData += sizeof(docId);\r\n memcpy(pData, &(offset), sizeof(offset));\r\n pData += sizeof(offset);\r\n}\r\n\r\nvoid FieldIndexer::addField(docid_t docid, boost::shared_ptr<LAInput> laInput)\r\n{\r\n if (pIndexer_->isRealTime())\r\n {\r\n InMemoryPosting* curPosting;\r\n for (LAInput::iterator iter = laInput->begin(); iter != laInput->end(); ++iter)\r\n {\r\n InMemoryPostingMap::iterator postingIter = postingMap_.find(iter->termId_);\r\n if (postingIter == postingMap_.end())\r\n {\r\n \/\/curPosting = new InMemoryPosting(pMemCache_, skipInterval_, maxSkipLevel_);\r\n curPosting = BOOST_NEW(*alloc_, InMemoryPosting)(pMemCache_, skipInterval_, maxSkipLevel_);\r\n postingMap_[iter->termId_] = curPosting;\r\n }\r\n else\r\n curPosting = postingIter->second;\r\n curPosting->add(docid, iter->offset_);\r\n }\r\n }\r\n else\r\n {\r\n if (!sorter_)\r\n sorter_=new izenelib::am::IzeneSort<uint32_t, uint8_t, true>(sorterFullPath_.c_str(), 120000000);\r\n\r\n char data[12];\r\n for (LAInput::iterator iter = laInput->begin(); iter != laInput->end(); ++iter)\r\n {\r\n convert(data,iter->termId_,docid,iter->offset_);\r\n sorter_->add_data(12, data);\r\n }\r\n }\r\n}\r\n\r\nvoid FieldIndexer::addField(docid_t docid, boost::shared_ptr<ForwardIndex> forwardindex)\r\n{\r\n InMemoryPosting* curPosting;\r\n\r\n for (ForwardIndex::iterator iter = forwardindex->begin(); iter != forwardindex->end(); ++iter)\r\n {\r\n InMemoryPostingMap::iterator postingIter = postingMap_.find(iter->first);\r\n if (postingIter == postingMap_.end())\r\n {\r\n curPosting = BOOST_NEW(*alloc_, InMemoryPosting)(pMemCache_, skipInterval_, maxSkipLevel_);\r\n postingMap_[iter->first] = curPosting;\r\n }\r\n else\r\n curPosting = postingIter->second;\r\n\r\n ForwardIndexOffset::iterator\tendit = iter->second->end();\r\n for (ForwardIndexOffset::iterator it = iter->second->begin(); it != endit; ++it)\r\n curPosting->add(docid, *it);\r\n }\r\n}\r\n\r\nvoid FieldIndexer::reset()\r\n{\r\n InMemoryPosting* pPosting;\r\n for (InMemoryPostingMap::iterator iter = postingMap_.begin(); iter !=postingMap_.end(); ++iter)\r\n {\r\n pPosting = iter->second;\r\n if (!pPosting->hasNoChunk())\r\n {\r\n pPosting->reset();\t\t\/\/\/clear posting data\r\n }\r\n }\r\n postingMap_.clear();\r\n termCount_ = 0;\r\n}\r\n\r\nvoid writeTermInfo(IndexOutput* pVocWriter, termid_t tid, const TermInfo& termInfo)\r\n{\r\n pVocWriter->writeInt(tid);\t\t\t\t\t\/\/\/write term id\r\n pVocWriter->writeInt(termInfo.docFreq_);\t\t\/\/\/write df\r\n pVocWriter->writeInt(termInfo.ctf_);\t\t\t\/\/\/write ctf\r\n pVocWriter->writeInt(termInfo.lastDocID_);\t\t\/\/\/write last doc id\r\n pVocWriter->writeInt(termInfo.skipLevel_);\t\t\/\/\/write skip level\r\n pVocWriter->writeLong(termInfo.skipPointer_);\t\/\/\/write skip list offset offset\r\n pVocWriter->writeLong(termInfo.docPointer_);\t\/\/\/write document posting offset\r\n pVocWriter->writeInt(termInfo.docPostingLen_);\t\/\/\/write document posting length (without skiplist)\r\n pVocWriter->writeLong(termInfo.positionPointer_);\t\/\/\/write position posting offset\r\n pVocWriter->writeInt(termInfo.positionPostingLen_);\/\/\/write position posting length\r\n}\r\n\r\nfileoffset_t FieldIndexer::write(OutputDescriptor* pWriterDesc)\r\n{\r\n vocFilePointer_ = pWriterDesc->getVocOutput()->getFilePointer();\r\n\r\n IndexOutput* pVocWriter = pWriterDesc->getVocOutput();\r\n\r\n termid_t tid;\r\n InMemoryPosting* pPosting;\r\n fileoffset_t vocOffset = pVocWriter->getFilePointer();\r\n TermInfo termInfo;\r\n\r\n if (pIndexer_->isRealTime())\r\n {\r\n izenelib::util::ScopedWriteLock<izenelib::util::ReadWriteLock> lock(rwLock_);\r\n for (InMemoryPostingMap::iterator iter = postingMap_.begin(); iter !=postingMap_.end(); ++iter)\r\n {\r\n pPosting = iter->second;\r\n pPosting->setDirty(true);\r\n if (!pPosting->hasNoChunk())\r\n {\r\n tid = iter->first;\r\n pPosting->write(pWriterDesc, termInfo);\t\t\/\/\/write posting data\r\n writeTermInfo(pVocWriter,tid,termInfo);\r\n pPosting->reset();\t\t\t\t\t\t\t\t\/\/\/clear posting data\r\n termInfo.reset();\r\n termCount_++;\r\n }\r\n \/\/delete pPosting;\r\n \/\/pPosting = NULL;\r\n }\r\n\r\n postingMap_.clear();\r\n\r\n delete alloc_;\r\n alloc_ = new boost::scoped_alloc(recycle_);\r\n }\r\n else\r\n {\r\n sorter_->sort();\r\n FILE* f = fopen(sorterFullPath_.c_str(),\"r\");\r\n fseek(f, 0, SEEK_SET);\r\n uint64_t count;\r\n fread(&count, sizeof(uint64_t), 1, f);\r\n\r\n pPosting = new InMemoryPosting(pMemCache_, skipInterval_, maxSkipLevel_);\r\n termid_t lastTerm = BAD_DOCID;\r\n try\r\n {\r\n for (uint64_t i = 0; i < count; ++i)\r\n {\r\n uint8_t len;\r\n fread(&len, sizeof(uint8_t), 1, f);\r\n uint32_t docId,offset;\r\n fread(&tid, sizeof(uint32_t), 1, f);\r\n fread(&docId, sizeof(uint32_t), 1, f);\r\n fread(&offset, sizeof(uint32_t), 1, f);\r\n\r\n if(tid != lastTerm && lastTerm != BAD_DOCID)\r\n {\r\n if (!pPosting->hasNoChunk())\r\n {\r\n pPosting->write(pWriterDesc, termInfo); \t\/\/\/write posting data\r\n writeTermInfo(pVocWriter, lastTerm, termInfo);\r\n pPosting->reset();\t\t\t\t\t\t\t\t\/\/\/clear posting data\r\n pMemCache_->flushMem();\r\n termInfo.reset();\r\n termCount_++;\r\n }\r\n }\r\n pPosting->add(docId, offset);\r\n lastTerm = tid;\r\n }\r\n }catch(std::exception& e)\r\n {\r\n cout<<e.what()<<endl;\r\n }\r\n\r\n if (!pPosting->hasNoChunk())\r\n {\r\n pPosting->write(pWriterDesc, termInfo);\t\/\/\/write posting data\r\n writeTermInfo(pVocWriter, lastTerm, termInfo);\r\n pPosting->reset(); \t\t\t\t\t\t\t\/\/\/clear posting data\r\n pMemCache_->flushMem();\r\n termInfo.reset();\r\n termCount_++;\r\n }\r\n\r\n fclose(f);\r\n sorter_->clear_files();\r\n delete sorter_;\r\n sorter_ = NULL;\r\n delete pPosting;\r\n }\r\n\r\n fileoffset_t vocDescOffset = pVocWriter->getFilePointer();\r\n int64_t vocLength = vocDescOffset - vocOffset;\r\n \/\/\/begin write vocabulary descriptor\r\n pVocWriter->writeLong(vocLength);\t\/\/\/<VocLength(Int64)>\r\n pVocWriter->writeLong(termCount_);\t\/\/\/<TermCount(Int64)>\r\n \/\/\/end write vocabulary descriptor\r\n\r\n return vocDescOffset;\r\n}\r\n\r\nTermReader* FieldIndexer::termReader()\r\n{\r\n izenelib::util::ScopedReadLock<izenelib::util::ReadWriteLock> lock(rwLock_);\r\n return new InMemoryTermReader(getField(),this);\r\n}\r\n\r\n}\r\n\r\nNS_IZENELIB_IR_END\r\n\r\n<commit_msg>make memory buffer size for izenesoft to be aligned with record length<commit_after>#include <ir\/index_manager\/index\/Indexer.h>\r\n#include <ir\/index_manager\/index\/FieldIndexer.h>\r\n#include <ir\/index_manager\/index\/TermReader.h>\r\n#include <ir\/index_manager\/index\/TermPositions.h>\r\n\r\n#include <boost\/filesystem.hpp>\r\n#include <boost\/filesystem\/path.hpp>\r\n\r\nusing namespace std;\r\n\r\nnamespace bfs = boost::filesystem;\r\n\r\nNS_IZENELIB_IR_BEGIN\r\n\r\nnamespace indexmanager\r\n{\r\n\r\nFieldIndexer::FieldIndexer(const char* field, MemCache* pCache, Indexer* pIndexer)\r\n :field_(field),pMemCache_(pCache),pIndexer_(pIndexer),vocFilePointer_(0),alloc_(0),sorter_(0),termCount_(0)\r\n{\r\n skipInterval_ = pIndexer_->getSkipInterval();\r\n maxSkipLevel_ = pIndexer_->getMaxSkipLevel();\r\n if (! pIndexer_->isRealTime())\r\n {\r\n std::string sorterName = field_+\".tmp\";\r\n bfs::path path(bfs::path(pIndexer->pConfigurationManager_->indexStrategy_.indexLocation_) \/bfs::path(sorterName));\r\n sorterFullPath_= path.string();\r\n sorter_=new izenelib::am::IzeneSort<uint32_t, uint8_t, true>(sorterFullPath_.c_str(), 130000000);\r\n }\r\n else\r\n alloc_ = new boost::scoped_alloc(recycle_);\r\n}\r\n\r\nFieldIndexer::~FieldIndexer()\r\n{\r\n \/*\r\n InMemoryPostingMap::iterator iter = postingMap_.begin()\r\n for(; iter !=postingMap_.end(); ++iter)\r\n {\r\n delete iter->second;\r\n }\r\n *\/\r\n if (alloc_) delete alloc_;\r\n pMemCache_ = NULL;\r\n if (sorter_) delete sorter_;\r\n}\r\n\r\nvoid convert(char* data, uint32_t termId, uint32_t docId, uint32_t offset)\r\n{\r\n char* pData = data;\r\n memcpy(pData, &(termId), sizeof(termId));\r\n pData += sizeof(termId);\r\n memcpy(pData, &(docId), sizeof(docId));\r\n pData += sizeof(docId);\r\n memcpy(pData, &(offset), sizeof(offset));\r\n pData += sizeof(offset);\r\n}\r\n\r\nvoid FieldIndexer::addField(docid_t docid, boost::shared_ptr<LAInput> laInput)\r\n{\r\n if (pIndexer_->isRealTime())\r\n {\r\n InMemoryPosting* curPosting;\r\n for (LAInput::iterator iter = laInput->begin(); iter != laInput->end(); ++iter)\r\n {\r\n InMemoryPostingMap::iterator postingIter = postingMap_.find(iter->termId_);\r\n if (postingIter == postingMap_.end())\r\n {\r\n \/\/curPosting = new InMemoryPosting(pMemCache_, skipInterval_, maxSkipLevel_);\r\n curPosting = BOOST_NEW(*alloc_, InMemoryPosting)(pMemCache_, skipInterval_, maxSkipLevel_);\r\n postingMap_[iter->termId_] = curPosting;\r\n }\r\n else\r\n curPosting = postingIter->second;\r\n curPosting->add(docid, iter->offset_);\r\n }\r\n }\r\n else\r\n {\r\n if (!sorter_)\r\n sorter_=new izenelib::am::IzeneSort<uint32_t, uint8_t, true>(sorterFullPath_.c_str(), 130000000);\r\n\r\n char data[12];\r\n for (LAInput::iterator iter = laInput->begin(); iter != laInput->end(); ++iter)\r\n {\r\n convert(data,iter->termId_,docid,iter->offset_);\r\n sorter_->add_data(12, data);\r\n }\r\n }\r\n}\r\n\r\nvoid FieldIndexer::addField(docid_t docid, boost::shared_ptr<ForwardIndex> forwardindex)\r\n{\r\n InMemoryPosting* curPosting;\r\n\r\n for (ForwardIndex::iterator iter = forwardindex->begin(); iter != forwardindex->end(); ++iter)\r\n {\r\n InMemoryPostingMap::iterator postingIter = postingMap_.find(iter->first);\r\n if (postingIter == postingMap_.end())\r\n {\r\n curPosting = BOOST_NEW(*alloc_, InMemoryPosting)(pMemCache_, skipInterval_, maxSkipLevel_);\r\n postingMap_[iter->first] = curPosting;\r\n }\r\n else\r\n curPosting = postingIter->second;\r\n\r\n ForwardIndexOffset::iterator\tendit = iter->second->end();\r\n for (ForwardIndexOffset::iterator it = iter->second->begin(); it != endit; ++it)\r\n curPosting->add(docid, *it);\r\n }\r\n}\r\n\r\nvoid FieldIndexer::reset()\r\n{\r\n InMemoryPosting* pPosting;\r\n for (InMemoryPostingMap::iterator iter = postingMap_.begin(); iter !=postingMap_.end(); ++iter)\r\n {\r\n pPosting = iter->second;\r\n if (!pPosting->hasNoChunk())\r\n {\r\n pPosting->reset();\t\t\/\/\/clear posting data\r\n }\r\n }\r\n postingMap_.clear();\r\n termCount_ = 0;\r\n}\r\n\r\nvoid writeTermInfo(IndexOutput* pVocWriter, termid_t tid, const TermInfo& termInfo)\r\n{\r\n pVocWriter->writeInt(tid);\t\t\t\t\t\/\/\/write term id\r\n pVocWriter->writeInt(termInfo.docFreq_);\t\t\/\/\/write df\r\n pVocWriter->writeInt(termInfo.ctf_);\t\t\t\/\/\/write ctf\r\n pVocWriter->writeInt(termInfo.lastDocID_);\t\t\/\/\/write last doc id\r\n pVocWriter->writeInt(termInfo.skipLevel_);\t\t\/\/\/write skip level\r\n pVocWriter->writeLong(termInfo.skipPointer_);\t\/\/\/write skip list offset offset\r\n pVocWriter->writeLong(termInfo.docPointer_);\t\/\/\/write document posting offset\r\n pVocWriter->writeInt(termInfo.docPostingLen_);\t\/\/\/write document posting length (without skiplist)\r\n pVocWriter->writeLong(termInfo.positionPointer_);\t\/\/\/write position posting offset\r\n pVocWriter->writeInt(termInfo.positionPostingLen_);\/\/\/write position posting length\r\n}\r\n\r\nfileoffset_t FieldIndexer::write(OutputDescriptor* pWriterDesc)\r\n{\r\n vocFilePointer_ = pWriterDesc->getVocOutput()->getFilePointer();\r\n\r\n IndexOutput* pVocWriter = pWriterDesc->getVocOutput();\r\n\r\n termid_t tid;\r\n InMemoryPosting* pPosting;\r\n fileoffset_t vocOffset = pVocWriter->getFilePointer();\r\n TermInfo termInfo;\r\n\r\n if (pIndexer_->isRealTime())\r\n {\r\n izenelib::util::ScopedWriteLock<izenelib::util::ReadWriteLock> lock(rwLock_);\r\n for (InMemoryPostingMap::iterator iter = postingMap_.begin(); iter !=postingMap_.end(); ++iter)\r\n {\r\n pPosting = iter->second;\r\n pPosting->setDirty(true);\r\n if (!pPosting->hasNoChunk())\r\n {\r\n tid = iter->first;\r\n pPosting->write(pWriterDesc, termInfo);\t\t\/\/\/write posting data\r\n writeTermInfo(pVocWriter,tid,termInfo);\r\n pPosting->reset();\t\t\t\t\t\t\t\t\/\/\/clear posting data\r\n termInfo.reset();\r\n termCount_++;\r\n }\r\n \/\/delete pPosting;\r\n \/\/pPosting = NULL;\r\n }\r\n\r\n postingMap_.clear();\r\n\r\n delete alloc_;\r\n alloc_ = new boost::scoped_alloc(recycle_);\r\n }\r\n else\r\n {\r\n sorter_->sort();\r\n FILE* f = fopen(sorterFullPath_.c_str(),\"r\");\r\n fseek(f, 0, SEEK_SET);\r\n uint64_t count;\r\n fread(&count, sizeof(uint64_t), 1, f);\r\n\r\n pPosting = new InMemoryPosting(pMemCache_, skipInterval_, maxSkipLevel_);\r\n termid_t lastTerm = BAD_DOCID;\r\n try\r\n {\r\n for (uint64_t i = 0; i < count; ++i)\r\n {\r\n uint8_t len;\r\n fread(&len, sizeof(uint8_t), 1, f);\r\n uint32_t docId,offset;\r\n fread(&tid, sizeof(uint32_t), 1, f);\r\n fread(&docId, sizeof(uint32_t), 1, f);\r\n fread(&offset, sizeof(uint32_t), 1, f);\r\n\r\n if(tid != lastTerm && lastTerm != BAD_DOCID)\r\n {\r\n if (!pPosting->hasNoChunk())\r\n {\r\n pPosting->write(pWriterDesc, termInfo); \t\/\/\/write posting data\r\n writeTermInfo(pVocWriter, lastTerm, termInfo);\r\n pPosting->reset();\t\t\t\t\t\t\t\t\/\/\/clear posting data\r\n pMemCache_->flushMem();\r\n termInfo.reset();\r\n termCount_++;\r\n }\r\n }\r\n pPosting->add(docId, offset);\r\n lastTerm = tid;\r\n }\r\n }catch(std::exception& e)\r\n {\r\n cout<<e.what()<<endl;\r\n }\r\n\r\n if (!pPosting->hasNoChunk())\r\n {\r\n pPosting->write(pWriterDesc, termInfo);\t\/\/\/write posting data\r\n writeTermInfo(pVocWriter, lastTerm, termInfo);\r\n pPosting->reset(); \t\t\t\t\t\t\t\/\/\/clear posting data\r\n pMemCache_->flushMem();\r\n termInfo.reset();\r\n termCount_++;\r\n }\r\n\r\n fclose(f);\r\n sorter_->clear_files();\r\n delete sorter_;\r\n sorter_ = NULL;\r\n delete pPosting;\r\n }\r\n\r\n fileoffset_t vocDescOffset = pVocWriter->getFilePointer();\r\n int64_t vocLength = vocDescOffset - vocOffset;\r\n \/\/\/begin write vocabulary descriptor\r\n pVocWriter->writeLong(vocLength);\t\/\/\/<VocLength(Int64)>\r\n pVocWriter->writeLong(termCount_);\t\/\/\/<TermCount(Int64)>\r\n \/\/\/end write vocabulary descriptor\r\n\r\n return vocDescOffset;\r\n}\r\n\r\nTermReader* FieldIndexer::termReader()\r\n{\r\n izenelib::util::ScopedReadLock<izenelib::util::ReadWriteLock> lock(rwLock_);\r\n return new InMemoryTermReader(getField(),this);\r\n}\r\n\r\n}\r\n\r\nNS_IZENELIB_IR_END\r\n\r\n<|endoftext|>"} {"text":"<commit_before>\/* \n * Copyright (C) 2006 Red Hat, Inc\n *\n * Sugar is free software; you can redistribute it and\/or modify it\n * under the terms of the GNU General Public License as published by\n * the Free Software Foundation; either version 2 of the License, or\n * (at your option) any later version.\n *\n * Sugar is distributed in the hope that it will be useful, but\n * WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU\n * General Public License for more details.\n *\n * You should have received a copy of the GNU General Public License\n * along with this program; if not, write to the Free Software\n * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307, USA.\n *\/\n\n#include \"gecko-browser.h\"\n\n#include <nsCOMPtr.h>\n#include <nsIPrefService.h>\n#include <nsServiceManagerUtils.h>\n\nenum {\n\tPROP_0,\n\tPROP_PROGRESS\n};\n\nvoid\ngecko_browser_startup(void)\n{\n\tnsCOMPtr<nsIPrefService> prefService;\n\n\tprefService = do_GetService(NS_PREFSERVICE_CONTRACTID);\n\tNS_ENSURE_TRUE(prefService, );\n\n\tnsCOMPtr<nsIPrefBranch> pref;\n\tprefService->GetBranch(\"\", getter_AddRefs(pref));\n\tNS_ENSURE_TRUE(pref, );\n\n\tpref->SetBoolPref (\"dom.disable_open_during_load\", TRUE);\n} \n\nG_DEFINE_TYPE(GeckoBrowser, gecko_browser, GTK_TYPE_MOZ_EMBED)\n\n\/\/static guint signals[N_SIGNALS];\n\nGeckoBrowser *\ngecko_browser_new(void)\n{\n\treturn GECKO_BROWSER(g_object_new(GECKO_TYPE_BROWSER, NULL));\n}\n\nstatic void\ngecko_browser_get_property(GObject *object,\n\t\t\t\t\t\t guint prop_id,\n\t\t\t\t\t\t GValue *value,\n\t\t\t\t\t\t GParamSpec *pspec)\n{\n\tGeckoBrowser *browser = GECKO_BROWSER(object);\n\n\tswitch (prop_id) {\n\t case PROP_PROGRESS:\n\t\t\tg_value_set_double(value, browser->progress);\n\t\tbreak;\n\n\t\tdefault:\n\t\t\tG_OBJECT_WARN_INVALID_PROPERTY_ID (object, prop_id, pspec);\n\t\tbreak;\n\t}\n}\n\n\nstatic void\ngecko_browser_class_init(GeckoBrowserClass *browser_class)\n{\n\tGObjectClass *gobject_class = G_OBJECT_CLASS(browser_class);\n\n\tgobject_class->get_property = gecko_browser_get_property;\n\n\tg_object_class_install_property (gobject_class, PROP_PROGRESS,\n g_param_spec_double (\"progress\",\n \"Progress\",\n \"Progress\",\n 0.0, 1.0, 0.0,\n G_PARAM_READABLE));\n}\n\nGeckoBrowser *\ngecko_browser_create_window(GeckoBrowser *browser)\n{\n\treturn GECKO_BROWSER_GET_CLASS(browser)->create_window(browser);\n}\n\nstatic void\nnew_window_cb(GtkMozEmbed *embed,\n\t\t\t GtkMozEmbed **newEmbed,\n guint chromemask)\n{\n\tGeckoBrowser *browser;\n\n\tbrowser = gecko_browser_create_window(GECKO_BROWSER(embed));\n\n\t*newEmbed = GTK_MOZ_EMBED(browser);\n}\n\nstatic void\ngecko_browser_set_progress(GeckoBrowser *browser, float progress)\n{\n\tg_return_if_fail(GECKO_IS_BROWSER(browser));\n\n\tbrowser->progress = progress;\n\tg_object_notify (G_OBJECT(browser), \"progress\");\n}\n\nstatic void\nnet_state_cb(GtkMozEmbed *embed, const char *aURI, gint state, guint status)\n{\n\tGeckoBrowser *browser = GECKO_BROWSER(embed);\n\n\tif (state & GTK_MOZ_EMBED_FLAG_IS_NETWORK) {\n\t\tif (state & GTK_MOZ_EMBED_FLAG_START) {\n\t\t\tbrowser->total_requests = 0;\n\t\t\tbrowser->current_requests = 0;\n\t\t}\n\t}\n\n\tif (state & GTK_MOZ_EMBED_FLAG_IS_REQUEST) {\n\t\tfloat progress;\n\n\t\tif (state & GTK_MOZ_EMBED_FLAG_START) {\n\t\t\tbrowser->total_requests++;\n\t\t}\n\t\telse if (state & GTK_MOZ_EMBED_FLAG_STOP)\n\t\t{\n\t\t\tbrowser->current_requests++;\n\t\t}\n\n\t\tprogress = float(browser->current_requests) \/\n\t\t\t\t float(browser->total_requests);\n\t\tgecko_browser_set_progress(browser, progress);\n\t}\n}\n\nstatic void\ngecko_browser_init(GeckoBrowser *browser)\n{\n\tbrowser->progress = 0.0;\n\n\tg_signal_connect(G_OBJECT(browser), \"new-window\",\n\t\t\t\t\t G_CALLBACK(new_window_cb), NULL);\n\tg_signal_connect(G_OBJECT(browser), \"net-state-all\",\n\t\t\t\t\t G_CALLBACK(net_state_cb), NULL);\n}\n<commit_msg>Avoid flickering of the progress bar.<commit_after>\/* \n * Copyright (C) 2006 Red Hat, Inc\n *\n * Sugar is free software; you can redistribute it and\/or modify it\n * under the terms of the GNU General Public License as published by\n * the Free Software Foundation; either version 2 of the License, or\n * (at your option) any later version.\n *\n * Sugar is distributed in the hope that it will be useful, but\n * WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU\n * General Public License for more details.\n *\n * You should have received a copy of the GNU General Public License\n * along with this program; if not, write to the Free Software\n * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307, USA.\n *\/\n\n#include \"gecko-browser.h\"\n\n#include <nsCOMPtr.h>\n#include <nsIPrefService.h>\n#include <nsServiceManagerUtils.h>\n\nenum {\n\tPROP_0,\n\tPROP_PROGRESS\n};\n\nvoid\ngecko_browser_startup(void)\n{\n\tnsCOMPtr<nsIPrefService> prefService;\n\n\tprefService = do_GetService(NS_PREFSERVICE_CONTRACTID);\n\tNS_ENSURE_TRUE(prefService, );\n\n\tnsCOMPtr<nsIPrefBranch> pref;\n\tprefService->GetBranch(\"\", getter_AddRefs(pref));\n\tNS_ENSURE_TRUE(pref, );\n\n\tpref->SetBoolPref (\"dom.disable_open_during_load\", TRUE);\n} \n\nG_DEFINE_TYPE(GeckoBrowser, gecko_browser, GTK_TYPE_MOZ_EMBED)\n\n\/\/static guint signals[N_SIGNALS];\n\nGeckoBrowser *\ngecko_browser_new(void)\n{\n\treturn GECKO_BROWSER(g_object_new(GECKO_TYPE_BROWSER, NULL));\n}\n\nstatic void\ngecko_browser_get_property(GObject *object,\n\t\t\t\t\t\t guint prop_id,\n\t\t\t\t\t\t GValue *value,\n\t\t\t\t\t\t GParamSpec *pspec)\n{\n\tGeckoBrowser *browser = GECKO_BROWSER(object);\n\n\tswitch (prop_id) {\n\t case PROP_PROGRESS:\n\t\t\tg_value_set_double(value, browser->progress);\n\t\tbreak;\n\n\t\tdefault:\n\t\t\tG_OBJECT_WARN_INVALID_PROPERTY_ID (object, prop_id, pspec);\n\t\tbreak;\n\t}\n}\n\n\nstatic void\ngecko_browser_class_init(GeckoBrowserClass *browser_class)\n{\n\tGObjectClass *gobject_class = G_OBJECT_CLASS(browser_class);\n\n\tgobject_class->get_property = gecko_browser_get_property;\n\n\tg_object_class_install_property (gobject_class, PROP_PROGRESS,\n g_param_spec_double (\"progress\",\n \"Progress\",\n \"Progress\",\n 0.0, 1.0, 0.0,\n G_PARAM_READABLE));\n}\n\nGeckoBrowser *\ngecko_browser_create_window(GeckoBrowser *browser)\n{\n\treturn GECKO_BROWSER_GET_CLASS(browser)->create_window(browser);\n}\n\nstatic void\nnew_window_cb(GtkMozEmbed *embed,\n\t\t\t GtkMozEmbed **newEmbed,\n guint chromemask)\n{\n\tGeckoBrowser *browser;\n\n\tbrowser = gecko_browser_create_window(GECKO_BROWSER(embed));\n\n\t*newEmbed = GTK_MOZ_EMBED(browser);\n}\n\nstatic void\ngecko_browser_set_progress(GeckoBrowser *browser, float progress)\n{\n\tg_return_if_fail(GECKO_IS_BROWSER(browser));\n\n\tbrowser->progress = progress;\n\tg_object_notify (G_OBJECT(browser), \"progress\");\n}\n\nstatic void\nnet_state_cb(GtkMozEmbed *embed, const char *aURI, gint state, guint status)\n{\n\tGeckoBrowser *browser = GECKO_BROWSER(embed);\n\n\tif (state & GTK_MOZ_EMBED_FLAG_IS_NETWORK) {\n\t\tif (state & GTK_MOZ_EMBED_FLAG_START) {\n\t\t\tbrowser->total_requests = 0;\n\t\t\tbrowser->current_requests = 0;\n\t\t\tbrowser->progress = 0.0;\n\t\t}\n\t}\n\n\tif (state & GTK_MOZ_EMBED_FLAG_IS_REQUEST) {\n\t\tfloat progress;\n\n\t\tif (state & GTK_MOZ_EMBED_FLAG_START) {\n\t\t\tbrowser->total_requests++;\n\t\t}\n\t\telse if (state & GTK_MOZ_EMBED_FLAG_STOP)\n\t\t{\n\t\t\tbrowser->current_requests++;\n\t\t}\n\n\t\tprogress = float(browser->current_requests) \/\n\t\t\t\t float(browser->total_requests);\n\t\tif (progress > browser->progress) {\n\t\t\tgecko_browser_set_progress(browser, progress);\n\t\t}\n\t}\n}\n\nstatic void\ngecko_browser_init(GeckoBrowser *browser)\n{\n\tbrowser->progress = 0.0;\n\n\tg_signal_connect(G_OBJECT(browser), \"new-window\",\n\t\t\t\t\t G_CALLBACK(new_window_cb), NULL);\n\tg_signal_connect(G_OBJECT(browser), \"net-state-all\",\n\t\t\t\t\t G_CALLBACK(net_state_cb), NULL);\n}\n<|endoftext|>"} {"text":"<commit_before>#include <boost\/test\/unit_test.hpp>\n\n#include <boost\/filesystem.hpp>\n#include <boost\/filesystem\/path.hpp>\n#include <boost\/random.hpp>\n#include <boost\/thread.hpp>\n#include <boost\/date_time\/posix_time\/posix_time.hpp>\n\n#include <iostream>\n#include <fstream>\n#include <map>\n\n#include <ir\/index_manager\/index\/Indexer.h>\n#include <ir\/index_manager\/index\/LAInput.h>\n#include <ir\/index_manager\/index\/IndexerDocument.h>\n#include <ir\/index_manager\/index\/IndexReader.h>\n#include <ir\/index_manager\/index\/AbsTermReader.h>\n\n#define LOG_DOC_OPERATION\n\/\/#define LOG_CHECK_OPERATION\n\/\/#define LOG_TERM_ID\n\nusing namespace std;\nusing namespace boost;\n\nusing namespace izenelib::ir::indexmanager;\n\nnamespace\n{\nconst char* INDEX_FILE_DIR = \".\/index\";\n\nconst unsigned int COLLECTION_ID = 1;\n};\n\nclass IndexerTest\n{\nprivate:\n std::map<std::string, unsigned int> propertyMap_;\n\n Indexer* indexer_;\n\n unsigned int newDocNum_; \/\/\/< the number of documents created when each time createDocument() is called\n boost::mt19937 randEngine_;\n boost::variate_generator<mt19937, uniform_int<> > docLenRand_;\n boost::variate_generator<mt19937, uniform_int<> > termIDRand_;\n boost::variate_generator<mt19937, uniform_int<> > docIDSkipRand_;\n boost::variate_generator<mt19937, uniform_int<> > docNumRand_;\n\n typedef map<docid_t, size_t> DocIdLenMapT;\n DocIdLenMapT mapDocIdLen_;\n\n \/**\n * as the max doc id in indexer is the max doc id ever indexed,\n * no matter whether that doc is deleted,\n * we have to maintain that max doc id here.\n *\/\n docid_t maxDocID_;\n\npublic:\n IndexerTest(unsigned int docNum, unsigned int docIDSkipMax = 1)\n : indexer_(0)\n ,newDocNum_(docNum)\n ,docLenRand_(randEngine_, uniform_int<>(1, 40*newDocNum_))\n ,termIDRand_(randEngine_, uniform_int<>(1, 400*newDocNum_))\n ,docIDSkipRand_(randEngine_, uniform_int<>(1, docIDSkipMax))\n ,docNumRand_(randEngine_, uniform_int<>(1, newDocNum_))\n ,maxDocID_(0)\n {}\n\n void setUp(bool isRemoveIndexFiles = true, const string& indexmode = \"default\") {\n if(isRemoveIndexFiles)\n removeIndexFiles();\n\n initIndexer(indexmode);\n }\n\n void tearDown() {\n delete indexer_;\n }\n\n bool isDocEmpty() const {\n return mapDocIdLen_.empty();\n }\n\n \/**\n * Get a randum number between [1, mapDocIdLen_.size()].\n * @return if mapDocIdLen_ is empty, it returns 0 instead.\n *\/\n int randDocNum() const {\n if(mapDocIdLen_.empty())\n return 0;\n\n boost::variate_generator<mt19937, uniform_int<> > numRand(randEngine_, uniform_int<>(1, mapDocIdLen_.size()));\n return numRand();\n }\n\n \/** Only create \\e newDocNum_ documents. *\/\n void createDocument(bool isRandom = false) {\n docid_t docID = maxDocID_;\n for(unsigned int i = 1; i <= (isRandom ? docNumRand_() : newDocNum_); i++)\n {\n docID += docIDSkipRand_();\n#ifdef LOG_DOC_OPERATION\n cout << \"create doc id: \" << docID << endl;\n#endif\n IndexerDocument document;\n prepareDocument(document, docID);\n BOOST_CHECK_EQUAL(indexer_->insertDocument(document), 1);\n }\n\n indexer_->flush();\n }\n\n \/** Update all exsting documents. *\/\n void updateDocument() {\n docid_t newDocID = maxDocID_;\n DocIdLenMapT oldMap;\n oldMap.swap(mapDocIdLen_);\n for(DocIdLenMapT::const_iterator it=oldMap.begin(); it!=oldMap.end(); ++it)\n {\n newDocID += docIDSkipRand_();\n#ifdef LOG_DOC_OPERATION\n cout << \"update doc id: \" << it->first << \" to new doc id: \" << newDocID << endl;\n#endif\n IndexerDocument document;\n document.setId(it->first);\n prepareDocument(document, newDocID);\n BOOST_CHECK_EQUAL(indexer_->updateDocument(document), 1);\n }\n\n indexer_->flush();\n }\n\n \/**\n * Remove random number of documents, and also remove documents exceed max doc id.\n *\/\n void removeDocument() {\n if(mapDocIdLen_.empty())\n return;\n\n const int removeNum = randDocNum(); \/\/ range [1, size]\n#ifdef LOG_DOC_OPERATION\n cout << \"start removing \" << removeNum << \" docs...\" << endl;\n#endif\n for(int i=0; i<removeNum; ++i)\n {\n const int removePos = randDocNum() - 1; \/\/ range [0, size-1]\n DocIdLenMapT::iterator it = mapDocIdLen_.begin();\n for(int j=0; j<removePos; ++j)\n ++it;\n\n#ifdef LOG_DOC_OPERATION\n cout << \"remove doc id: \" << it->first << endl;\n#endif\n indexer_->removeDocument(COLLECTION_ID, it->first);\n mapDocIdLen_.erase(it);\n }\n\n \/\/ remove doc id exceed the range\n docid_t overId = maxDocID_ + 1;\n#ifdef LOG_DOC_OPERATION\n cout << \"remove exceed doc id: \" << overId << endl;\n#endif\n indexer_->removeDocument(COLLECTION_ID, overId);\n\n indexer_->flush();\n }\n\n void checkDocLength() {\n IndexReader* pIndexReader = indexer_->getIndexReader();\n\n BOOST_CHECK_EQUAL(pIndexReader->numDocs(), mapDocIdLen_.size());\n BOOST_CHECK_EQUAL(pIndexReader->maxDoc(), maxDocID_);\n\n DocIdLenMapT::const_iterator mapIt = mapDocIdLen_.begin();\n DocIdLenMapT::const_iterator mapItEnd = mapDocIdLen_.end();\n\n for(; mapIt!=mapItEnd; ++mapIt)\n {\n#ifdef LOG_CHECK_OPERATION\n cout << \"check: \" << mapIt->first << endl;\n#endif\n BOOST_CHECK_EQUAL(pIndexReader->docLength(mapIt->first, indexer_->getPropertyIDByName(COLLECTION_ID, \"content\")), mapIt->second);\n }\n\n \/\/TermReader* pTermReader = pIndexReader->getTermReader(COLLECTION_ID);\n \/\/delete pTermReader;\n }\n\n \/**\n * Create barrels and check barrel status.\n * @param barrelNum the number of barrels to create\n *\/\n void checkBarrel(int barrelNum, bool isRealTime, bool isOptimize = false) {\n for(int i=0; i<barrelNum; ++i)\n createDocument(false); \/\/ create barrel i\n \/\/createDocument(isRealTime); \/\/ create barrel i\n\n if(isOptimize)\n indexer_->optimizeIndex();\n\n IndexReader* pIndexReader = indexer_->getIndexReader();\n BarrelsInfo* pBarrelsInfo = pIndexReader->getBarrelsInfo();\n\n BOOST_CHECK_EQUAL(pBarrelsInfo->getDocCount(), mapDocIdLen_.size());\n BOOST_CHECK_EQUAL(pBarrelsInfo->maxDocId(), maxDocID_);\n\n if(isOptimize)\n {\n \/\/ wait for merge finish\n boost::thread::sleep(boost::get_system_time() + boost::posix_time::milliseconds(1000));\n BOOST_CHECK_EQUAL(pBarrelsInfo->getBarrelCount(), 1);\n }\n else if(! isRealTime)\n {\n BOOST_CHECK_EQUAL(pBarrelsInfo->getBarrelCount(), barrelNum);\n\n for(int i=0; i<barrelNum; ++i)\n {\n BarrelInfo* pBarrelInfo = (*pBarrelsInfo)[i];\n BOOST_CHECK_EQUAL(pBarrelInfo->getDocCount(), newDocNum_);\n BOOST_CHECK_EQUAL(pBarrelInfo->getBaseDocID(), i*newDocNum_+1);\n BOOST_CHECK_EQUAL(pBarrelInfo->getMaxDocID(), (i+1)*newDocNum_);\n }\n }\n\n DVLOG(2) << \"<= t_IndexReader.cpp::checkBarrel()\";\n }\n\nprivate:\n void removeIndexFiles() {\n boost::filesystem::path indexPath(INDEX_FILE_DIR);\n boost::filesystem::remove_all(indexPath);\n }\n\n void initIndexer(const string& indexmode, bool btree = true, int skipinterval = 0, int skiplevel = 0) {\n if (btree)\n indexer_ = new Indexer();\n else\n indexer_ = new Indexer(MANAGER_PURE_INDEX);\n\n IndexManagerConfig indexManagerConfig;\n\n boost::filesystem::path path(INDEX_FILE_DIR);\n\n indexManagerConfig.indexStrategy_.indexLocation_ = path.string();\n indexManagerConfig.indexStrategy_.indexMode_ = indexmode;\n indexManagerConfig.indexStrategy_.memory_ = 30000000;\n indexManagerConfig.indexStrategy_.indexDocLength_ = true;\n indexManagerConfig.indexStrategy_.skipInterval_ = skipinterval;\n indexManagerConfig.indexStrategy_.maxSkipLevel_ = skiplevel;\n indexManagerConfig.mergeStrategy_.param_ = \"dbt\";\n indexManagerConfig.storeStrategy_.param_ = \"mmap\";\n std::map<std::string, unsigned int> collectionIdMapping;\n collectionIdMapping.insert(std::pair<std::string, unsigned int>(\"testcoll\", COLLECTION_ID));\n\n std::vector<std::string> propertyList(1, \"content\");\n if(btree)\n {\n std::string date(\"date\");\n propertyList.push_back(date);\n std::string url(\"provider\");\n propertyList.push_back(url);\n }\n std::sort(propertyList.begin(),propertyList.end());\n IndexerCollectionMeta indexCollectionMeta;\n indexCollectionMeta.setName(\"testcoll\");\n for (std::size_t i=0;i<propertyList.size();i++)\n {\n IndexerPropertyConfig indexerPropertyConfig(1+i, propertyList[i], true, true);\n propertyMap_[propertyList[i]] = 1+i;\n if(propertyList[i] != \"content\")\n {\n indexerPropertyConfig.setIsForward(false);\n indexerPropertyConfig.setIsFilter(true);\n }\n indexCollectionMeta.addPropertyConfig(indexerPropertyConfig);\n }\n indexManagerConfig.addCollectionMeta(indexCollectionMeta);\n\n indexer_->setIndexManagerConfig(indexManagerConfig, collectionIdMapping);\n }\n\n void prepareDocument(IndexerDocument& document, unsigned int docId, bool filter = true) {\n document.setDocId(docId, COLLECTION_ID);\n\n IndexerPropertyConfig propertyConfig(propertyMap_[\"content\"],\"content\",true,true);\n propertyConfig.setIsLAInput(true);\n\n boost::shared_ptr<LAInput> laInput(new LAInput);\n document.insertProperty(propertyConfig, laInput);\n\n const unsigned int docLen = docLenRand_();\n mapDocIdLen_[docId] = docLen;\n maxDocID_ = docId;\n for(unsigned int i = 0; i < docLen; ++i)\n {\n LAInputUnit unit;\n unit.termid_ = termIDRand_();\n#ifdef LOG_TERM_ID\n cout << \"term id: \" << unit.termid_ << endl;\n#endif\n unit.wordOffset_ = i;\n document.add_to_property(unit);\n }\n#ifdef LOG_TERM_ID\n cout << endl;\n#endif\n\n if(filter)\n {\n using namespace boost::posix_time;\n using namespace boost::gregorian;\n\n propertyConfig.setPropertyId(propertyMap_[\"date\"]);\n propertyConfig.setName(\"date\");\n propertyConfig.setIsForward(false);\n propertyConfig.setIsFilter(true);\n propertyConfig.setIsLAInput(false);\n\n struct tm atm;\n ptime now = second_clock::local_time();\n atm = to_tm(now);\n int64_t time = mktime(&atm);\n\n document.insertProperty(propertyConfig, time);\n }\n }\n};\n\nBOOST_AUTO_TEST_SUITE( t_IndexReader )\n\n\/\/BOOST_AUTO_TEST_CASE(index)\n\/\/{\n \/\/IndexerTest indexerTest(10);\n\n \/\/indexerTest.setUp();\n\n \/\/\/\/ create barrel 0\n \/\/indexerTest.createDocument();\n \/\/indexerTest.checkDocLength();\n\n \/\/\/\/ create barrel 1, 2, 3\n \/\/for(int i=0; i<3; ++i)\n \/\/{\n \/\/indexerTest.createDocument();\n \/\/indexerTest.checkDocLength();\n \/\/}\n \/\/indexerTest.tearDown();\n\n \/\/\/\/ new Indexer instance, create barrel 4, 5, 6\n \/\/indexerTest.setUp(false);\n \/\/indexerTest.checkDocLength();\n \/\/for(int i=0; i<3; ++i)\n \/\/{\n \/\/indexerTest.createDocument();\n \/\/indexerTest.checkDocLength();\n \/\/}\n \/\/indexerTest.tearDown();\n\/\/}\n\n\/\/BOOST_AUTO_TEST_CASE(update)\n\/\/{\n \/\/IndexerTest indexerTest(10);\n\n \/\/indexerTest.setUp();\n \/\/indexerTest.createDocument();\n\n \/\/for(int i=0; i<2; ++i)\n \/\/{\n \/\/indexerTest.updateDocument();\n \/\/indexerTest.checkDocLength();\n \/\/}\n \/\/indexerTest.tearDown();\n\/\/}\n\n\/\/BOOST_AUTO_TEST_CASE(remove)\n\/\/{\n \/\/IndexerTest indexerTest(10);\n\n \/\/indexerTest.setUp();\n \/\/indexerTest.createDocument();\n\n \/\/while(! indexerTest.isDocEmpty())\n \/\/{\n \/\/indexerTest.removeDocument();\n \/\/indexerTest.checkDocLength();\n \/\/}\n \/\/indexerTest.checkDocLength();\n\n \/\/indexerTest.tearDown();\n\/\/}\n\n\/\/BOOST_AUTO_TEST_CASE(barrelInfo_offline)\n\/\/{\n \/\/IndexerTest indexerTest(10);\n\n \/\/indexerTest.setUp();\n\n \/\/indexerTest.checkBarrel(10, false);\n \/\/indexerTest.tearDown();\n\/\/}\n\nBOOST_AUTO_TEST_CASE(barrelInfo_optimize)\n{\n IndexerTest indexerTest(10);\n\n indexerTest.setUp();\n\n indexerTest.checkBarrel(10, false, true);\n indexerTest.tearDown();\n}\n\n\/\/BOOST_AUTO_TEST_CASE(barrelInfo_realtime)\n\/\/{\n \/\/IndexerTest indexerTest(100);\n \/\/indexerTest.setUp(true, \"realtime\");\n \/\/indexerTest.checkBarrel(10, true);\n \/\/indexerTest.tearDown();\n\/\/}\n\nBOOST_AUTO_TEST_SUITE_END()\n\n<commit_msg>update t_IndexReader.<commit_after>#include <boost\/test\/unit_test.hpp>\n\n#include <boost\/filesystem.hpp>\n#include <boost\/filesystem\/path.hpp>\n#include <boost\/random.hpp>\n#include <boost\/thread.hpp>\n#include <boost\/date_time\/posix_time\/posix_time.hpp>\n\n#include <iostream>\n#include <fstream>\n#include <map>\n\n#include <ir\/index_manager\/index\/Indexer.h>\n#include <ir\/index_manager\/index\/LAInput.h>\n#include <ir\/index_manager\/index\/IndexerDocument.h>\n#include <ir\/index_manager\/index\/IndexReader.h>\n#include <ir\/index_manager\/index\/AbsTermReader.h>\n\n#define LOG_DOC_OPERATION\n\/\/#define LOG_CHECK_OPERATION\n\/\/#define LOG_TERM_ID\n\nusing namespace std;\nusing namespace boost;\n\nusing namespace izenelib::ir::indexmanager;\n\nnamespace\n{\nconst char* INDEX_FILE_DIR = \".\/index\";\n\nconst unsigned int COLLECTION_ID = 1;\n\nconst char* INDEX_MODE_REALTIME = \"realtime\";\n\nconst int TEST_DOC_NUM = 3000;\n\nconst int TEST_BARREL_NUM = 10;\n};\n\nclass IndexerTest\n{\nprivate:\n std::map<std::string, unsigned int> propertyMap_;\n\n Indexer* indexer_;\n\n unsigned int newDocNum_; \/\/\/< the max number of documents created in createDocument()\n bool isDocNumRand_; \/\/\/< true for doc number range [1, rand(newDocNum_)], false for range [1, newDocNum_]\n boost::mt19937 randEngine_;\n boost::variate_generator<mt19937, uniform_int<> > docLenRand_;\n boost::variate_generator<mt19937, uniform_int<> > termIDRand_;\n boost::variate_generator<mt19937, uniform_int<> > docIDSkipRand_;\n boost::variate_generator<mt19937, uniform_int<> > docNumRand_;\n\n typedef map<docid_t, size_t> DocIdLenMapT;\n DocIdLenMapT mapDocIdLen_;\n\n \/**\n * as the max doc id in indexer is the max doc id ever indexed,\n * no matter whether that doc is deleted,\n * we have to maintain that max doc id here.\n *\/\n docid_t maxDocID_;\n\npublic:\n IndexerTest(unsigned int docNum, bool isDocNumRand = false, unsigned int docIDSkipMax = 1)\n : indexer_(0)\n ,newDocNum_(docNum)\n ,isDocNumRand_(isDocNumRand)\n ,docLenRand_(randEngine_, uniform_int<>(1, 40*newDocNum_))\n ,termIDRand_(randEngine_, uniform_int<>(1, 400*newDocNum_))\n ,docIDSkipRand_(randEngine_, uniform_int<>(1, docIDSkipMax))\n ,docNumRand_(randEngine_, uniform_int<>(1, newDocNum_))\n ,maxDocID_(0)\n {}\n\n void setUp(bool isRemoveIndexFiles = true, const string& indexmode = \"default\") {\n if(isRemoveIndexFiles)\n removeIndexFiles();\n\n initIndexer(indexmode);\n }\n\n void tearDown() {\n delete indexer_;\n }\n\n bool isDocEmpty() const {\n return mapDocIdLen_.empty();\n }\n\n \/**\n * Get a randum number between [1, mapDocIdLen_.size()].\n * @return if mapDocIdLen_ is empty, it returns 0 instead.\n *\/\n int randDocNum() const {\n if(mapDocIdLen_.empty())\n return 0;\n\n boost::variate_generator<mt19937, uniform_int<> > numRand(randEngine_, uniform_int<>(1, mapDocIdLen_.size()));\n return numRand();\n }\n\n \/** Only create \\e newDocNum_ documents. *\/\n void createDocument() {\n DVLOG(2) << \"=> IndexerTest::createDocument()\";\n\n docid_t docID = maxDocID_;\n for(unsigned int i = 1; i <= (isDocNumRand_ ? docNumRand_() : newDocNum_); i++)\n {\n docID += docIDSkipRand_();\n#ifdef LOG_DOC_OPERATION\n cout << \"create doc id: \" << docID << endl;\n#endif\n IndexerDocument document;\n prepareDocument(document, docID);\n BOOST_CHECK_EQUAL(indexer_->insertDocument(document), 1);\n }\n\n indexer_->flush();\n DVLOG(2) << \"<= IndexerTest::createDocument()\";\n }\n\n \/** Update all exsting documents. *\/\n void updateDocument() {\n DVLOG(2) << \"=> IndexerTest::updateDocument()\";\n\n docid_t newDocID = maxDocID_;\n DocIdLenMapT oldMap;\n oldMap.swap(mapDocIdLen_);\n for(DocIdLenMapT::const_iterator it=oldMap.begin(); it!=oldMap.end(); ++it)\n {\n newDocID += docIDSkipRand_();\n#ifdef LOG_DOC_OPERATION\n cout << \"update doc id: \" << it->first << \" to new doc id: \" << newDocID << endl;\n#endif\n IndexerDocument document;\n document.setId(it->first);\n prepareDocument(document, newDocID);\n BOOST_CHECK_EQUAL(indexer_->updateDocument(document), 1);\n }\n\n indexer_->flush();\n DVLOG(2) << \"<= IndexerTest::updateDocument()\";\n }\n\n \/**\n * Remove random number of documents, and also remove documents exceed max doc id.\n *\/\n void removeDocument() {\n DVLOG(2) << \"=> IndexerTest::removeDocument()\";\n\n if(mapDocIdLen_.empty())\n return;\n\n const int removeNum = randDocNum(); \/\/ range [1, size]\n#ifdef LOG_DOC_OPERATION\n cout << \"start removing \" << removeNum << \" docs...\" << endl;\n#endif\n for(int i=0; i<removeNum; ++i)\n {\n const int removePos = randDocNum() - 1; \/\/ range [0, size-1]\n DocIdLenMapT::iterator it = mapDocIdLen_.begin();\n for(int j=0; j<removePos; ++j)\n ++it;\n\n#ifdef LOG_DOC_OPERATION\n cout << \"remove doc id: \" << it->first << endl;\n#endif\n indexer_->removeDocument(COLLECTION_ID, it->first);\n mapDocIdLen_.erase(it);\n }\n\n \/\/ remove doc id exceed the range\n docid_t overId = maxDocID_ + 1;\n#ifdef LOG_DOC_OPERATION\n cout << \"remove exceed doc id: \" << overId << endl;\n#endif\n indexer_->removeDocument(COLLECTION_ID, overId);\n\n indexer_->flush();\n DVLOG(2) << \"<= IndexerTest::removeDocument()\";\n }\n\n void checkDocLength() {\n DVLOG(2) << \"=> IndexerTest::checkDocLength()\";\n\n IndexReader* pIndexReader = indexer_->getIndexReader();\n\n BOOST_CHECK_EQUAL(pIndexReader->numDocs(), mapDocIdLen_.size());\n BOOST_CHECK_EQUAL(pIndexReader->maxDoc(), maxDocID_);\n\n DocIdLenMapT::const_iterator mapIt = mapDocIdLen_.begin();\n DocIdLenMapT::const_iterator mapItEnd = mapDocIdLen_.end();\n\n for(; mapIt!=mapItEnd; ++mapIt)\n {\n#ifdef LOG_CHECK_OPERATION\n cout << \"check: \" << mapIt->first << endl;\n#endif\n BOOST_CHECK_EQUAL(pIndexReader->docLength(mapIt->first, indexer_->getPropertyIDByName(COLLECTION_ID, \"content\")), mapIt->second);\n }\n\n \/\/TermReader* pTermReader = pIndexReader->getTermReader(COLLECTION_ID);\n \/\/delete pTermReader;\n\n DVLOG(2) << \"<= IndexerTest::checkDocLength()\";\n }\n\n \/**\n * Create barrels and check barrel status.\n * @param barrelNum the number of barrels to create\n *\/\n void checkBarrel(int barrelNum) {\n DVLOG(2) << \"=> IndexerTest::checkBarrel()\";\n\n for(int i=0; i<barrelNum; ++i)\n createDocument(); \/\/ create barrel i\n\n IndexReader* pIndexReader = indexer_->getIndexReader();\n BarrelsInfo* pBarrelsInfo = pIndexReader->getBarrelsInfo();\n\n BOOST_CHECK_EQUAL(pBarrelsInfo->maxDocId(), maxDocID_);\n\n if(indexer_->getIndexManagerConfig()->indexStrategy_.indexMode_ != INDEX_MODE_REALTIME)\n {\n BOOST_CHECK_EQUAL(pBarrelsInfo->getBarrelCount(), barrelNum);\n BOOST_CHECK_EQUAL(pBarrelsInfo->getDocCount(), mapDocIdLen_.size());\n\n for(int i=0; i<barrelNum; ++i)\n {\n BarrelInfo* pBarrelInfo = (*pBarrelsInfo)[i];\n BOOST_CHECK_EQUAL(pBarrelInfo->getDocCount(), newDocNum_);\n BOOST_CHECK_EQUAL(pBarrelInfo->getBaseDocID(), i*newDocNum_+1);\n BOOST_CHECK_EQUAL(pBarrelInfo->getMaxDocID(), (i+1)*newDocNum_);\n }\n }\n\n DVLOG(2) << \"<= IndexerTest::checkBarrel()\";\n }\n\n \/**\n * Create barrels, optimize barrels (merge them into one), and check barrel status.\n * @param barrelNum the number of barrels to create\n *\/\n void optimizeBarrel(int barrelNum) {\n DVLOG(2) << \"=> IndexerTest::optimizeBarrel()\";\n\n for(int i=0; i<barrelNum; ++i)\n createDocument(); \/\/ create barrel i\n\n indexer_->optimizeIndex();\n\n IndexReader* pIndexReader = indexer_->getIndexReader();\n BarrelsInfo* pBarrelsInfo = pIndexReader->getBarrelsInfo();\n\n BOOST_CHECK_EQUAL(pBarrelsInfo->maxDocId(), maxDocID_);\n BOOST_CHECK_EQUAL(pBarrelsInfo->getDocCount(), mapDocIdLen_.size());\n\n DVLOG(2) << \"<= IndexerTest::optimizeBarrel()\";\n }\n\n \/**\n * Check optimize barrels result.\n *\/\n void checkOptimize() {\n DVLOG(2) << \"=> IndexerTest::checkOptimize()\";\n\n IndexReader* pIndexReader = indexer_->getIndexReader();\n BarrelsInfo* pBarrelsInfo = pIndexReader->getBarrelsInfo();\n\n BOOST_CHECK_EQUAL(pBarrelsInfo->maxDocId(), maxDocID_);\n BOOST_CHECK_EQUAL(pBarrelsInfo->getBarrelCount(), 1);\n BOOST_CHECK_EQUAL(pBarrelsInfo->getDocCount(), mapDocIdLen_.size());\n\n DVLOG(2) << \"<= IndexerTest::checkOptimize()\";\n }\n\n \/**\n * Create barrels, optimize barrels (merge them into one), and check barrel status.\n * @param barrelNum the number of barrels to create\n *\/\n void createAfterOptimizeBarrel(int barrelNum) {\n DVLOG(2) << \"=> IndexerTest::createAfterOptimizeBarrel()\";\n\n for(int i=0; i<barrelNum; ++i)\n createDocument(); \/\/ create barrel i\n\n indexer_->optimizeIndex();\n\n for(int i=0; i<barrelNum; ++i)\n createDocument(); \/\/ create barrel i\n\n IndexReader* pIndexReader = indexer_->getIndexReader();\n BarrelsInfo* pBarrelsInfo = pIndexReader->getBarrelsInfo();\n\n BOOST_CHECK_EQUAL(pBarrelsInfo->maxDocId(), maxDocID_);\n BOOST_CHECK(pBarrelsInfo->getBarrelCount() >= 1 && pBarrelsInfo->getBarrelCount() <= 2*barrelNum);\n BOOST_CHECK_EQUAL(pBarrelsInfo->getDocCount(), mapDocIdLen_.size());\n\n DVLOG(2) << \"<= IndexerTest::createAfterOptimizeBarrel()\";\n }\n\nprivate:\n void removeIndexFiles() {\n boost::filesystem::path indexPath(INDEX_FILE_DIR);\n boost::filesystem::remove_all(indexPath);\n }\n\n void initIndexer(const string& indexmode, bool btree = true, int skipinterval = 0, int skiplevel = 0) {\n if (btree)\n indexer_ = new Indexer();\n else\n indexer_ = new Indexer(MANAGER_PURE_INDEX);\n\n IndexManagerConfig indexManagerConfig;\n\n boost::filesystem::path path(INDEX_FILE_DIR);\n\n indexManagerConfig.indexStrategy_.indexLocation_ = path.string();\n indexManagerConfig.indexStrategy_.indexMode_ = indexmode;\n indexManagerConfig.indexStrategy_.memory_ = 30000000;\n indexManagerConfig.indexStrategy_.indexDocLength_ = true;\n indexManagerConfig.indexStrategy_.skipInterval_ = skipinterval;\n indexManagerConfig.indexStrategy_.maxSkipLevel_ = skiplevel;\n indexManagerConfig.mergeStrategy_.param_ = \"dbt\";\n indexManagerConfig.storeStrategy_.param_ = \"mmap\";\n std::map<std::string, unsigned int> collectionIdMapping;\n collectionIdMapping.insert(std::pair<std::string, unsigned int>(\"testcoll\", COLLECTION_ID));\n\n std::vector<std::string> propertyList(1, \"content\");\n if(btree)\n {\n std::string date(\"date\");\n propertyList.push_back(date);\n std::string url(\"provider\");\n propertyList.push_back(url);\n }\n std::sort(propertyList.begin(),propertyList.end());\n IndexerCollectionMeta indexCollectionMeta;\n indexCollectionMeta.setName(\"testcoll\");\n for (std::size_t i=0;i<propertyList.size();i++)\n {\n IndexerPropertyConfig indexerPropertyConfig(1+i, propertyList[i], true, true);\n propertyMap_[propertyList[i]] = 1+i;\n if(propertyList[i] != \"content\")\n {\n indexerPropertyConfig.setIsForward(false);\n indexerPropertyConfig.setIsFilter(true);\n }\n indexCollectionMeta.addPropertyConfig(indexerPropertyConfig);\n }\n indexManagerConfig.addCollectionMeta(indexCollectionMeta);\n\n indexer_->setIndexManagerConfig(indexManagerConfig, collectionIdMapping);\n }\n\n void prepareDocument(IndexerDocument& document, unsigned int docId, bool filter = true) {\n document.setDocId(docId, COLLECTION_ID);\n\n IndexerPropertyConfig propertyConfig(propertyMap_[\"content\"],\"content\",true,true);\n propertyConfig.setIsLAInput(true);\n\n boost::shared_ptr<LAInput> laInput(new LAInput);\n document.insertProperty(propertyConfig, laInput);\n\n const unsigned int docLen = docLenRand_();\n mapDocIdLen_[docId] = docLen;\n maxDocID_ = docId;\n for(unsigned int i = 0; i < docLen; ++i)\n {\n LAInputUnit unit;\n unit.termid_ = termIDRand_();\n#ifdef LOG_TERM_ID\n cout << \"term id: \" << unit.termid_ << endl;\n#endif\n unit.wordOffset_ = i;\n document.add_to_property(unit);\n }\n#ifdef LOG_TERM_ID\n cout << endl;\n#endif\n\n if(filter)\n {\n using namespace boost::posix_time;\n using namespace boost::gregorian;\n\n propertyConfig.setPropertyId(propertyMap_[\"date\"]);\n propertyConfig.setName(\"date\");\n propertyConfig.setIsForward(false);\n propertyConfig.setIsFilter(true);\n propertyConfig.setIsLAInput(false);\n\n struct tm atm;\n ptime now = second_clock::local_time();\n atm = to_tm(now);\n int64_t time = mktime(&atm);\n\n document.insertProperty(propertyConfig, time);\n }\n }\n};\n\nBOOST_AUTO_TEST_SUITE( t_IndexReader )\n\nBOOST_AUTO_TEST_CASE(index)\n{\n IndexerTest indexerTest(TEST_DOC_NUM);\n\n indexerTest.setUp();\n\n \/\/ create barrel 0\n indexerTest.createDocument();\n indexerTest.checkDocLength();\n\n \/\/ create barrel 1, 2, 3\n for(int i=0; i<TEST_BARREL_NUM; ++i)\n {\n indexerTest.createDocument();\n indexerTest.checkDocLength();\n }\n indexerTest.tearDown();\n\n \/\/ new Indexer instance, create barrel 4, 5, 6\n indexerTest.setUp(false);\n indexerTest.checkDocLength();\n for(int i=0; i<TEST_BARREL_NUM; ++i)\n {\n indexerTest.createDocument();\n indexerTest.checkDocLength();\n }\n indexerTest.tearDown();\n}\n\nBOOST_AUTO_TEST_CASE(update)\n{\n IndexerTest indexerTest(TEST_DOC_NUM);\n\n indexerTest.setUp();\n indexerTest.createDocument();\n\n for(int i=0; i<TEST_BARREL_NUM; ++i)\n {\n indexerTest.updateDocument();\n indexerTest.checkDocLength();\n }\n indexerTest.tearDown();\n}\n\nBOOST_AUTO_TEST_CASE(remove)\n{\n IndexerTest indexerTest(TEST_DOC_NUM);\n\n indexerTest.setUp();\n indexerTest.createDocument();\n\n while(! indexerTest.isDocEmpty())\n {\n indexerTest.removeDocument();\n indexerTest.checkDocLength();\n }\n indexerTest.checkDocLength();\n\n indexerTest.tearDown();\n}\n\nBOOST_AUTO_TEST_CASE(barrelInfo_check)\n{\n {\n IndexerTest indexerTest(TEST_DOC_NUM);\n indexerTest.setUp();\n indexerTest.checkBarrel(TEST_BARREL_NUM);\n indexerTest.tearDown();\n }\n\n {\n IndexerTest indexerTest(TEST_DOC_NUM);\n indexerTest.setUp(true, INDEX_MODE_REALTIME);\n indexerTest.checkBarrel(TEST_BARREL_NUM);\n indexerTest.tearDown();\n }\n}\n\nBOOST_AUTO_TEST_CASE(barrelInfo_optimize)\n{\n {\n IndexerTest indexerTest(TEST_DOC_NUM);\n indexerTest.setUp();\n indexerTest.optimizeBarrel(TEST_BARREL_NUM);\n indexerTest.tearDown();\n\n indexerTest.setUp(false);\n indexerTest.checkOptimize();\n indexerTest.tearDown();\n }\n\n {\n IndexerTest indexerTest(TEST_DOC_NUM);\n indexerTest.setUp(true, INDEX_MODE_REALTIME);\n indexerTest.optimizeBarrel(TEST_BARREL_NUM);\n indexerTest.tearDown();\n\n indexerTest.setUp(false);\n indexerTest.checkOptimize();\n indexerTest.tearDown();\n }\n}\n\nBOOST_AUTO_TEST_CASE(barrelInfo_create_after_optimize)\n{\n {\n IndexerTest indexerTest(TEST_DOC_NUM);\n indexerTest.setUp();\n indexerTest.createAfterOptimizeBarrel(TEST_BARREL_NUM);\n indexerTest.tearDown();\n }\n\n {\n IndexerTest indexerTest(TEST_DOC_NUM);\n indexerTest.setUp(true, INDEX_MODE_REALTIME);\n indexerTest.createAfterOptimizeBarrel(TEST_BARREL_NUM);\n indexerTest.tearDown();\n }\n}\n\nBOOST_AUTO_TEST_SUITE_END()\n\n<|endoftext|>"} {"text":"<commit_before><commit_msg>fix DHT logging build error<commit_after><|endoftext|>"} {"text":"<commit_before>\/* Copyright 2013-present Facebook, Inc.\n * Licensed under the Apache License, Version 2.0 *\/\n\n#include \"watchman.h\"\n\nclass NameExpr : public QueryExpr {\n w_string name;\n w_ht_t *map;\n bool caseless;\n bool wholename;\n explicit NameExpr(w_ht_t* map, bool caseless, bool wholename)\n : map(map), caseless(caseless), wholename(wholename) {}\n\n ~NameExpr() {\n if (map) {\n w_ht_free(map);\n }\n }\n\n public:\n bool evaluate(struct w_query_ctx* ctx, const watchman_file* file) override {\n w_string_t* str;\n\n if (wholename) {\n str = w_query_ctx_get_wholename(ctx);\n } else {\n str = w_file_get_name(file);\n }\n\n if (map) {\n bool matched;\n w_ht_val_t val;\n\n if (caseless) {\n str = w_string_dup_lower(str);\n if (!str) {\n return false;\n }\n }\n\n matched = w_ht_lookup(map, w_ht_ptr_val(str), &val, false);\n\n if (caseless) {\n w_string_delref(str);\n }\n\n return matched;\n }\n\n if (caseless) {\n return w_string_equal_caseless(str, name);\n }\n return w_string_equal(str, name);\n }\n\n static std::unique_ptr<QueryExpr>\n parse(w_query* query, json_t* term, bool caseless) {\n const char *pattern = nullptr, *scope = \"basename\";\n const char* which = caseless ? \"iname\" : \"name\";\n json_t* name;\n w_ht_t* map = nullptr;\n\n if (!json_is_array(term)) {\n ignore_result(\n asprintf(&query->errmsg, \"Expected array for '%s' term\", which));\n return nullptr;\n }\n\n if (json_array_size(term) > 3) {\n ignore_result(asprintf(\n &query->errmsg, \"Invalid number of arguments for '%s' term\", which));\n return nullptr;\n }\n\n if (json_array_size(term) == 3) {\n json_t* jscope;\n\n jscope = json_array_get(term, 2);\n if (!json_is_string(jscope)) {\n ignore_result(asprintf(\n &query->errmsg, \"Argument 3 to '%s' must be a string\", which));\n return nullptr;\n }\n\n scope = json_string_value(jscope);\n\n if (strcmp(scope, \"basename\") && strcmp(scope, \"wholename\")) {\n ignore_result(asprintf(\n &query->errmsg,\n \"Invalid scope '%s' for %s expression\",\n scope,\n which));\n return nullptr;\n }\n }\n\n name = json_array_get(term, 1);\n\n if (json_is_array(name)) {\n uint32_t i;\n\n for (i = 0; i < json_array_size(name); i++) {\n if (!json_is_string(json_array_get(name, i))) {\n ignore_result(asprintf(\n &query->errmsg,\n \"Argument 2 to '%s' must be \"\n \"either a string or an \"\n \"array of string\",\n which));\n return nullptr;\n }\n }\n\n map = w_ht_new((uint32_t)json_array_size(name), &w_ht_string_funcs);\n for (i = 0; i < json_array_size(name); i++) {\n w_string_t* element;\n const char* ele;\n const json_t* jele = json_array_get(name, i);\n ele = json_string_value(jele);\n \/\/ We need to make a copy of the string since we do in-place separator\n \/\/ normalization on the paths.\n if (caseless) {\n element =\n w_string_new_lower_typed(ele, json_to_w_string(jele).type());\n } else {\n element = w_string_new_typed(ele, json_to_w_string(jele).type());\n }\n\n w_string_in_place_normalize_separators(&element, WATCHMAN_DIR_SEP);\n\n w_ht_set(map, w_ht_ptr_val(element), 1);\n w_string_delref(element);\n }\n\n } else if (json_is_string(name)) {\n pattern = json_string_value(name);\n } else {\n ignore_result(asprintf(\n &query->errmsg,\n \"Argument 2 to '%s' must be either a string or an array of string\",\n which));\n return nullptr;\n }\n\n auto data = new NameExpr(map, caseless, !strcmp(scope, \"wholename\"));\n\n if (pattern) {\n \/\/ We need to make a copy of the string since we do in-place separator\n \/\/ normalization on the paths.\n w_string pat(pattern, json_to_w_string(name).type());\n data->name = w_string_normalize_separators(pat, WATCHMAN_DIR_SEP);\n }\n\n return std::unique_ptr<QueryExpr>(data);\n }\n\n static std::unique_ptr<QueryExpr> parseName(w_query* query, json_t* term) {\n return parse(query, term, !query->case_sensitive);\n }\n static std::unique_ptr<QueryExpr> parseIName(w_query* query, json_t* term) {\n return parse(query, term, true);\n }\n};\n\nW_TERM_PARSER(\"name\", NameExpr::parseName)\nW_TERM_PARSER(\"iname\", NameExpr::parseIName)\n\n\/* vim:ts=2:sw=2:et:\n *\/\n<commit_msg>name term: w_ht_t -> unordered_set<commit_after>\/* Copyright 2013-present Facebook, Inc.\n * Licensed under the Apache License, Version 2.0 *\/\n\n#include \"watchman.h\"\n\nclass NameExpr : public QueryExpr {\n w_string name;\n std::unordered_set<w_string> set;\n bool caseless;\n bool wholename;\n explicit NameExpr(\n std::unordered_set<w_string>&& set,\n bool caseless,\n bool wholename)\n : set(std::move(set)), caseless(caseless), wholename(wholename) {}\n\n public:\n bool evaluate(struct w_query_ctx* ctx, const watchman_file* file) override {\n w_string_t* str;\n\n if (wholename) {\n str = w_query_ctx_get_wholename(ctx);\n } else {\n str = w_file_get_name(file);\n }\n\n if (!set.empty()) {\n bool matched;\n\n if (caseless) {\n str = w_string_dup_lower(str);\n if (!str) {\n return false;\n }\n }\n\n matched = set.find(str) != set.end();\n\n if (caseless) {\n w_string_delref(str);\n }\n\n return matched;\n }\n\n if (caseless) {\n return w_string_equal_caseless(str, name);\n }\n return w_string_equal(str, name);\n }\n\n static std::unique_ptr<QueryExpr>\n parse(w_query* query, json_t* term, bool caseless) {\n const char *pattern = nullptr, *scope = \"basename\";\n const char* which = caseless ? \"iname\" : \"name\";\n json_t* name;\n std::unordered_set<w_string> set;\n\n if (!json_is_array(term)) {\n ignore_result(\n asprintf(&query->errmsg, \"Expected array for '%s' term\", which));\n return nullptr;\n }\n\n if (json_array_size(term) > 3) {\n ignore_result(asprintf(\n &query->errmsg, \"Invalid number of arguments for '%s' term\", which));\n return nullptr;\n }\n\n if (json_array_size(term) == 3) {\n json_t* jscope;\n\n jscope = json_array_get(term, 2);\n if (!json_is_string(jscope)) {\n ignore_result(asprintf(\n &query->errmsg, \"Argument 3 to '%s' must be a string\", which));\n return nullptr;\n }\n\n scope = json_string_value(jscope);\n\n if (strcmp(scope, \"basename\") && strcmp(scope, \"wholename\")) {\n ignore_result(asprintf(\n &query->errmsg,\n \"Invalid scope '%s' for %s expression\",\n scope,\n which));\n return nullptr;\n }\n }\n\n name = json_array_get(term, 1);\n\n if (json_is_array(name)) {\n uint32_t i;\n\n for (i = 0; i < json_array_size(name); i++) {\n if (!json_is_string(json_array_get(name, i))) {\n ignore_result(asprintf(\n &query->errmsg,\n \"Argument 2 to '%s' must be \"\n \"either a string or an \"\n \"array of string\",\n which));\n return nullptr;\n }\n }\n\n set.reserve(json_array_size(name));\n for (i = 0; i < json_array_size(name); i++) {\n w_string_t* element;\n const char* ele;\n const json_t* jele = json_array_get(name, i);\n ele = json_string_value(jele);\n \/\/ We need to make a copy of the string since we do in-place separator\n \/\/ normalization on the paths.\n if (caseless) {\n element =\n w_string_new_lower_typed(ele, json_to_w_string(jele).type());\n } else {\n element = w_string_new_typed(ele, json_to_w_string(jele).type());\n }\n\n w_string_in_place_normalize_separators(&element, WATCHMAN_DIR_SEP);\n\n set.insert(element);\n w_string_delref(element);\n }\n\n } else if (json_is_string(name)) {\n pattern = json_string_value(name);\n } else {\n ignore_result(asprintf(\n &query->errmsg,\n \"Argument 2 to '%s' must be either a string or an array of string\",\n which));\n return nullptr;\n }\n\n auto data =\n new NameExpr(std::move(set), caseless, !strcmp(scope, \"wholename\"));\n\n if (pattern) {\n \/\/ We need to make a copy of the string since we do in-place separator\n \/\/ normalization on the paths.\n w_string pat(pattern, json_to_w_string(name).type());\n data->name = w_string_normalize_separators(pat, WATCHMAN_DIR_SEP);\n }\n\n return std::unique_ptr<QueryExpr>(data);\n }\n\n static std::unique_ptr<QueryExpr> parseName(w_query* query, json_t* term) {\n return parse(query, term, !query->case_sensitive);\n }\n static std::unique_ptr<QueryExpr> parseIName(w_query* query, json_t* term) {\n return parse(query, term, true);\n }\n};\n\nW_TERM_PARSER(\"name\", NameExpr::parseName)\nW_TERM_PARSER(\"iname\", NameExpr::parseIName)\n\n\/* vim:ts=2:sw=2:et:\n *\/\n<|endoftext|>"} {"text":"<commit_before>\/* ===========================================================================\n# This is the library for Hover. \n# \n# Hover is a development kit that lets you control your hardware projects in a whole new way. \n# Wave goodbye to physical buttons. Hover detects hand movements in the air for touch-less interaction. \n# It also features five touch-sensitive regions for even more options.\n# Hover uses I2C and 2 digital pins. It is compatible with Arduino, Raspberry Pi and more.\n#\n# Hover can be purchased here: http:\/\/www.justhover.com\n#\n# Written by Emran Mahbub and Jonathan Li for Gearseven Studios. \n# BSD license, all text above must be included in any redistribution\n# ===========================================================================\n#\n#\n# SUPPORT\n# For questions and comments, email us at support@gearseven.com\n# v1.0\n# ===========================================================================*\/\n\n#include \"Hover.h\"\n\nvoid Hover::begin(ts, rst) {\n\tWire.begin();\n\tpinMode(ts, INPUT); \/\/Used by TS line on MGC3130\n\tpinMode(rst, OUTPUT); \/\/Used by TS line on MGC3130\n\tdigitalWrite(rst, LOW);\n\tpinMode(rst, INPUT); \n\tdelay(3000);\n\tSerial.println(\"Hover is ready\");\n}\n\nvoid Hover::setRelease(int ts) {\n digitalWrite(ts, HIGH);\n pinMode(ts, INPUT);\n}\n\n\nboolean Hover::getStatus(int ts) {\n\tif (digitalRead(ts) == 0) {\n\t\tpinMode(ts, OUTPUT);\n\t\tdigitalWrite(ts, LOW);\n\t\treturn 0;\n\t}\t\n\treturn 1;\n}\n\nbyte Hover::getEvent(void) {\n\tbyte data;\n\tbyte event;\n\tint c = 0;\n WIRE.requestFrom((uint8_t)_i2caddr, (uint8_t)18); \/\/ request 20 bytes from slave device at 0x42\n while(WIRE.available()) \/\/ slave may send less than requested\n { \n\t\tdata = WIRE.read(); \/\/ receive a byte as character\n\t\tif (c == 10 && data > 1) {\n\t\t\tevent = (B00000001 << (data-1)) | B00100000;\n\t\t\treturn event;\n\t\t}\n\t\tif (c == 14 && data > B11111) {\n\t\t\tevent = ((data & B11100000) >> 5) | B01000000 ;\n\t\t\treturn event;\n\t\t}\n\t\tif (c == 15 && data > 0) {\n\t\t\tevent = (((data & B0011) << 3) | B01000000);\n\t\t\treturn event;\n\t\t}\n c++;\n }\n}\n\nString Hover::getEventString(byte eventByte) {\n\n\t\/\/Serial.println(\"inside string fcn\");\n\t\/\/return \"Test\";\n\t\/\/Serial.println(eventByte);\n if (eventByte == B00100010) {\n \/\/Serial.println(\"Right swipe\");\n\t\treturn \"Right Swipe\";\n } else if (eventByte == B00100100) {\n \/\/Serial.println(\"Left swipe\"); \n\t\treturn \"Left Swipe\";\n\n } else if (eventByte == B00101000) {\n \/\/Serial.println(\"Up swipe\"); \n\t\treturn \"Up Swipe\";\n\t\t\n } else if (eventByte == B00110000) {\n \/\/Serial.println(\"Down swipe\"); \n\t\treturn \"Down Swipe\";\n\t\t\n } else if (eventByte == B01000001) {\n \/\/Serial.println(\"Tap south\");\n\t\treturn \"Tap South\";\n\t\t\n } else if (eventByte == B01000010) {\n \/\/Serial.println(\"Tap West\");\n\t\treturn \"Tap West\";\n\t\t\n } else if (eventByte == B01010000) {\n \/\/Serial.println(\"Tap Center\");\n\t\treturn \"Tap Center\";\n\t\t\n } else if (eventByte == B01001000) {\n \/\/Serial.println(\"Tap East\"); \n\t\treturn \"Tap East\";\n\t\t\n } else if (eventByte == B01000100) {\n \/\/Serial.println(\"Tap NORTH\"); \n\t\treturn \"Tap North\";\n\t\t\n } \n\treturn \"\";\n}\n<commit_msg>Added i2caddr+ addr<commit_after>\/* ===========================================================================\n# This is the library for Hover. \n# \n# Hover is a development kit that lets you control your hardware projects in a whole new way. \n# Wave goodbye to physical buttons. Hover detects hand movements in the air for touch-less interaction. \n# It also features five touch-sensitive regions for even more options.\n# Hover uses I2C and 2 digital pins. It is compatible with Arduino, Raspberry Pi and more.\n#\n# Hover can be purchased here: http:\/\/www.justhover.com\n#\n# Written by Emran Mahbub and Jonathan Li for Gearseven Studios. \n# BSD license, all text above must be included in any redistribution\n# ===========================================================================\n#\n#\n# SUPPORT\n# For questions and comments, email us at support@gearseven.com\n# v1.0\n# ===========================================================================*\/\n\n#include \"Hover.h\"\n\nHover::Hover(uint8_t addr) {\n _i2caddr = addr;\n}\n\nvoid Hover::begin(ts, rst) {\n\tWire.begin();\n\tpinMode(ts, INPUT); \/\/Used by TS line on MGC3130\n\tpinMode(rst, OUTPUT); \/\/Used by TS line on MGC3130\n\tdigitalWrite(rst, LOW);\n\tpinMode(rst, INPUT); \n\tdelay(3000);\n\tSerial.println(\"Hover is ready\");\n}\n\nvoid Hover::setRelease(int ts) {\n digitalWrite(ts, HIGH);\n pinMode(ts, INPUT);\n}\n\n\nboolean Hover::getStatus(int ts) {\n\tif (digitalRead(ts) == 0) {\n\t\tpinMode(ts, OUTPUT);\n\t\tdigitalWrite(ts, LOW);\n\t\treturn 0;\n\t}\t\n\treturn 1;\n}\n\nbyte Hover::getEvent(void) {\n\tbyte data;\n\tbyte event;\n\tint c = 0;\n WIRE.requestFrom((uint8_t)_i2caddr, (uint8_t)18); \/\/ request 20 bytes from slave device at 0x42\n while(WIRE.available()) \/\/ slave may send less than requested\n { \n\t\tdata = WIRE.read(); \/\/ receive a byte as character\n\t\tif (c == 10 && data > 1) {\n\t\t\tevent = (B00000001 << (data-1)) | B00100000;\n\t\t\treturn event;\n\t\t}\n\t\tif (c == 14 && data > B11111) {\n\t\t\tevent = ((data & B11100000) >> 5) | B01000000 ;\n\t\t\treturn event;\n\t\t}\n\t\tif (c == 15 && data > 0) {\n\t\t\tevent = (((data & B0011) << 3) | B01000000);\n\t\t\treturn event;\n\t\t}\n c++;\n }\n}\n\nString Hover::getEventString(byte eventByte) {\n\n\t\/\/Serial.println(\"inside string fcn\");\n\t\/\/return \"Test\";\n\t\/\/Serial.println(eventByte);\n if (eventByte == B00100010) {\n \/\/Serial.println(\"Right swipe\");\n\t\treturn \"Right Swipe\";\n } else if (eventByte == B00100100) {\n \/\/Serial.println(\"Left swipe\"); \n\t\treturn \"Left Swipe\";\n\n } else if (eventByte == B00101000) {\n \/\/Serial.println(\"Up swipe\"); \n\t\treturn \"Up Swipe\";\n\t\t\n } else if (eventByte == B00110000) {\n \/\/Serial.println(\"Down swipe\"); \n\t\treturn \"Down Swipe\";\n\t\t\n } else if (eventByte == B01000001) {\n \/\/Serial.println(\"Tap south\");\n\t\treturn \"Tap South\";\n\t\t\n } else if (eventByte == B01000010) {\n \/\/Serial.println(\"Tap West\");\n\t\treturn \"Tap West\";\n\t\t\n } else if (eventByte == B01010000) {\n \/\/Serial.println(\"Tap Center\");\n\t\treturn \"Tap Center\";\n\t\t\n } else if (eventByte == B01001000) {\n \/\/Serial.println(\"Tap East\"); \n\t\treturn \"Tap East\";\n\t\t\n } else if (eventByte == B01000100) {\n \/\/Serial.println(\"Tap NORTH\"); \n\t\treturn \"Tap North\";\n\t\t\n } \n\treturn \"\";\n}\n<|endoftext|>"} {"text":"<commit_before>#pragma once\n\n#include <iomanip>\n\n#include \"common.hpp\"\n#include \"utils\/string.hpp\"\n\nLEMONBUDDY_NS\n\nunion rgba {\n struct {\n uint8_t r;\n uint8_t g;\n uint8_t b;\n uint8_t a;\n };\n uint32_t v;\n};\n\nclass color;\nstatic map<string, color> g_colorstore;\n\nclass color {\n public:\n explicit color(string hex) : m_hex(string_util::upper(hex)) {\n m_rgba.v = static_cast<uint32_t>(strtoul(&hex[1], nullptr, 16));\n \/\/ premultiply alpha\n m_rgba.r = m_rgba.r * m_rgba.a \/ 255;\n m_rgba.g = m_rgba.g * m_rgba.a \/ 255;\n m_rgba.b = m_rgba.b * m_rgba.a \/ 255;\n }\n\n explicit color(uint32_t v) {\n char buffer[7];\n snprintf(buffer, sizeof(buffer), \"%06x\", v);\n m_hex = \"#\" + string{buffer};\n m_rgba.v = v;\n }\n\n uint32_t value() const {\n return m_rgba.v;\n }\n\n string rgb() const {\n \/\/ clang-format off\n return string_util::from_stream(stringstream()\n << \"#\"\n << std::setw(6)\n << std::setfill('0')\n << std::hex\n << std::uppercase\n << (m_rgba.v & 0x00FFFFFF));\n \/\/ clang-format on\n }\n\n string hex() const {\n return m_hex;\n }\n\n static auto parse(string input, color fallback) {\n auto it = g_colorstore.find(input);\n if (it != g_colorstore.end()) {\n return it->second;\n }\n string hex{input};\n if (hex.substr(0, 1) != \"#\")\n hex = \"#\" + hex;\n if (hex.length() == 4)\n hex = {'#', hex[1], hex[1], hex[2], hex[2], hex[3], hex[3]};\n if (hex.length() == 7)\n hex = \"#FF\" + hex.substr(1);\n if (hex.length() != 9)\n return fallback;\n color result{hex};\n g_colorstore.emplace(input, result);\n return result;\n }\n\n static auto parse(string input) {\n static color none{0};\n return parse(input, none);\n }\n\n protected:\n rgba m_rgba;\n string m_hex;\n};\n\nstatic color g_colorblack{\"#ff000000\"};\nstatic color g_colorwhite{\"#ffffffff\"};\n\nLEMONBUDDY_NS_END\n<commit_msg>fix(ci): Forward decl. error<commit_after>#pragma once\n\n#include <iomanip>\n\n#include \"common.hpp\"\n#include \"utils\/string.hpp\"\n\nLEMONBUDDY_NS\n\nunion rgba {\n struct {\n uint8_t r;\n uint8_t g;\n uint8_t b;\n uint8_t a;\n };\n uint32_t v;\n};\n\nstatic map<string, class color> g_colorstore;\n\nclass color {\n public:\n explicit color(string hex) : m_hex(string_util::upper(hex)) {\n m_rgba.v = static_cast<uint32_t>(strtoul(&hex[1], nullptr, 16));\n \/\/ premultiply alpha\n m_rgba.r = m_rgba.r * m_rgba.a \/ 255;\n m_rgba.g = m_rgba.g * m_rgba.a \/ 255;\n m_rgba.b = m_rgba.b * m_rgba.a \/ 255;\n }\n\n explicit color(uint32_t v) {\n char buffer[7];\n snprintf(buffer, sizeof(buffer), \"%06x\", v);\n m_hex = \"#\" + string{buffer};\n m_rgba.v = v;\n }\n\n uint32_t value() const {\n return m_rgba.v;\n }\n\n string rgb() const {\n \/\/ clang-format off\n return string_util::from_stream(stringstream()\n << \"#\"\n << std::setw(6)\n << std::setfill('0')\n << std::hex\n << std::uppercase\n << (m_rgba.v & 0x00FFFFFF));\n \/\/ clang-format on\n }\n\n string hex() const {\n return m_hex;\n }\n\n static auto parse(string input, color fallback) {\n auto it = g_colorstore.find(input);\n if (it != g_colorstore.end()) {\n return it->second;\n }\n string hex{input};\n if (hex.substr(0, 1) != \"#\")\n hex = \"#\" + hex;\n if (hex.length() == 4)\n hex = {'#', hex[1], hex[1], hex[2], hex[2], hex[3], hex[3]};\n if (hex.length() == 7)\n hex = \"#FF\" + hex.substr(1);\n if (hex.length() != 9)\n return fallback;\n color result{hex};\n g_colorstore.emplace(input, result);\n return result;\n }\n\n static auto parse(string input) {\n static color none{0};\n return parse(input, none);\n }\n\n protected:\n rgba m_rgba;\n string m_hex;\n};\n\nstatic color g_colorblack{\"#ff000000\"};\nstatic color g_colorwhite{\"#ffffffff\"};\n\nLEMONBUDDY_NS_END\n<|endoftext|>"} {"text":"<commit_before>\/\/\n\/\/ Programmer: Craig Stuart Sapp <craig@ccrma.stanford.edu>\n\/\/ Creation Date: Fri Jan 29 18:58:32 PST 2021\n\/\/ Last Modified: Sun Jan 31 01:22:56 PST 2021\n\/\/ Filename: humxml.cpp\n\/\/ URL: https:\/\/github.com\/craigsapp\/humlib\/blob\/master\/cli\/humxml.cpp\n\/\/ Syntax: C++11\n\/\/ vim: ts=3 noexpandtab nowrap\n\/\/\n\/\/ Description: Reveal data structure of Humdrum file and internal parameters.\n\/\/ Optionally run various alysises of the data to calculate\n\/\/ content-based parameters.\n\/\/\n\n#include \"humlib.h\"\n\nusing namespace std;\nusing namespace hum;\n\nint main(int argc, char **argv) {\n\tOptions options;\n\toptions.define(\"A|all=b\", \"do all analyses\");\n\toptions.define(\"a|accidentals=b\", \"analyze visual accidental states\");\n\toptions.define(\"p|phrases=b\", \"analyze phrases\");\n\toptions.define(\"r|rest-positions=b\", \"analyze rest positions\");\n\toptions.define(\"s|slurs=b\", \"analyze slurs\");\n\toptions.define(\"t|ties=b\", \"analyze ties\");\n\toptions.define(\"x|text-repetitions=b\", \"analyze text repetitions\");\n\n\t\/\/ Processing not run automatically with -A option:\n\n\toptions.process(argc, argv);\n\n\tbool allQ = options.getBoolean(\"all\");\n\n\tHumdrumFile infile;\n\tif (options.getArgCount() == 0) {\n\t\tinfile.read(cin);\n\t} else {\n\t\tinfile.read(options.getArg(1));\n\t}\n\n\t\/\/ Do content analysis of the data (mostly **kern data):\n\tif (allQ || options.getBoolean(\"accidentals\")) {\n\t\t\/\/ This analysis calculates the visible state of\n\t\t\/\/ accidentals for **kern data notes for conversion\n\t\t\/\/ to graphical CMN music notation. **kern data\n\t\t\/\/ encodes the sounding accidentals. These may\n\t\t\/\/ be shown in notation or hidden due to the \n\t\t\/\/ key signature or previous notes in the measure,\n\t\t\/\/ or modified by !LO:N:acc parameters. An \"X\" after\n\t\t\/\/ an accidental will force it to be displayed, and\n\t\t\/\/ a \"y\" after an accidental will force it to\n\t\t\/\/ be hidden.\n\t\tinfile.analyzeKernAccidentals();\n\t}\n\tif (allQ || options.getBoolean(\"phrases\")) {\n\t\t\/\/ Link phrase endings to each other. Phrase start\n\t\t\/\/ is \"{\" and phrase end is \"}\". Phrase markings\n\t\t\/\/ are typically for analytic purposes, with slurs\n\t\t\/\/ usually used for phasing slurs. Phrases that cross\n\t\t\/\/ other phrases are prefixed with one or more \"&\".\n\t\tinfile.analyzeSlurs();\n\t}\n\tif (allQ || options.getBoolean(\"rest-positions\")) {\n\t\t\/\/ Specify the vertical position of rests on the staff.\n\t\tinfile.analyzeRestPositions();\n\t}\n\tif (allQ || options.getBoolean(\"slurs\")) {\n\t\t\/\/ Link slur endings to each other. Slur start is\n\t\t\/\/ \"(\" and slur end is \")\". Slurs that cross other\n\t\t\/\/ active slurs are prefixed with one or more \"&\".\n\t\tinfile.analyzeSlurs();\n\t}\n\tif (allQ || options.getBoolean(\"ties\")) {\n\t\t\/\/ Link tie endings to each other. Tie starts\n\t\t\/\/ are \"[\", tie continuations (a end and a start on the\n\t\t\/\/ same note are \"_\", and tie ends are \"]\". When the\n\t\t\/\/ tie character is doubled, then that is a discontinuous\n\t\t\/\/ tie, where the two tied notes are not melocially adjacent\n\t\t\/\/ (this can happen in music to simplify the notatation\n\t\t\/\/ of written out arpeggiations).\n\t\t\/\/ This analysis seems to not generate HumHash data, but\n\t\t\/\/ proably adjusted fixed variables for HumdrumTokens.\n\t\tinfile.analyzeKernTies();\n\t}\n\tif (allQ || options.getBoolean(\"text-repetitions\")) {\n\t\t\/\/ Something to do with **text text-repeat markers.\n\t\tinfile.analyzeTextRepetition();\n\t}\n\n\tinfile.printXml();\n}\n\n\n\n<commit_msg>Update humxml.cpp<commit_after>\/\/\n\/\/ Programmer: Craig Stuart Sapp <craig@ccrma.stanford.edu>\n\/\/ Creation Date: Fri Jan 29 18:58:32 PST 2021\n\/\/ Last Modified: Sun Jan 31 01:22:56 PST 2021\n\/\/ Filename: humxml.cpp\n\/\/ URL: https:\/\/github.com\/craigsapp\/humlib\/blob\/master\/cli\/humxml.cpp\n\/\/ Syntax: C++11\n\/\/ vim: ts=3 noexpandtab nowrap\n\/\/\n\/\/ Description: Reveal data structure of Humdrum file and internal parameters.\n\/\/ Optionally run various analyses of the data to calculate\n\/\/ content-based parameters.\n\/\/\n\n#include \"humlib.h\"\n\nusing namespace std;\nusing namespace hum;\n\nint main(int argc, char **argv) {\n\tOptions options;\n\toptions.define(\"A|all=b\", \"do all analyses\");\n\toptions.define(\"a|accidentals=b\", \"analyze visual accidental states\");\n\toptions.define(\"p|phrases=b\", \"analyze phrases\");\n\toptions.define(\"r|rest-positions=b\", \"analyze rest positions\");\n\toptions.define(\"s|slurs=b\", \"analyze slurs\");\n\toptions.define(\"t|ties=b\", \"analyze ties\");\n\toptions.define(\"x|text-repetitions=b\", \"analyze text repetitions\");\n\n\t\/\/ Processing not run automatically with -A option:\n\n\toptions.process(argc, argv);\n\n\tbool allQ = options.getBoolean(\"all\");\n\n\tHumdrumFile infile;\n\tif (options.getArgCount() == 0) {\n\t\tinfile.read(cin);\n\t} else {\n\t\tinfile.read(options.getArg(1));\n\t}\n\n\t\/\/ Do content analysis of the data (mostly **kern data):\n\tif (allQ || options.getBoolean(\"accidentals\")) {\n\t\t\/\/ This analysis calculates the visible state of\n\t\t\/\/ accidentals for **kern data notes for conversion\n\t\t\/\/ to graphical CMN music notation. **kern data\n\t\t\/\/ encodes the sounding accidentals. These may\n\t\t\/\/ be shown in notation or hidden due to the \n\t\t\/\/ key signature or previous notes in the measure,\n\t\t\/\/ or modified by !LO:N:acc parameters. An \"X\" after\n\t\t\/\/ an accidental will force it to be displayed, and\n\t\t\/\/ a \"y\" after an accidental will force it to\n\t\t\/\/ be hidden.\n\t\tinfile.analyzeKernAccidentals();\n\t}\n\tif (allQ || options.getBoolean(\"phrases\")) {\n\t\t\/\/ Link phrase endings to each other. Phrase start\n\t\t\/\/ is \"{\" and phrase end is \"}\". Phrase markings\n\t\t\/\/ are typically for analytic purposes, with slurs\n\t\t\/\/ usually used for phasing slurs. Phrases that cross\n\t\t\/\/ other phrases are prefixed with one or more \"&\".\n\t\tinfile.analyzeSlurs();\n\t}\n\tif (allQ || options.getBoolean(\"rest-positions\")) {\n\t\t\/\/ Specify the vertical position of rests on the staff.\n\t\tinfile.analyzeRestPositions();\n\t}\n\tif (allQ || options.getBoolean(\"slurs\")) {\n\t\t\/\/ Link slur endings to each other. Slur start is\n\t\t\/\/ \"(\" and slur end is \")\". Slurs that cross other\n\t\t\/\/ active slurs are prefixed with one or more \"&\".\n\t\tinfile.analyzeSlurs();\n\t}\n\tif (allQ || options.getBoolean(\"ties\")) {\n\t\t\/\/ Link tie endings to each other. Tie starts\n\t\t\/\/ are \"[\", tie continuations (a end and a start on the\n\t\t\/\/ same note are \"_\", and tie ends are \"]\". When the\n\t\t\/\/ tie character is doubled, then that is a discontinuous\n\t\t\/\/ tie, where the two tied notes are not melocially adjacent\n\t\t\/\/ (this can happen in music to simplify the notatation\n\t\t\/\/ of written out arpeggiations).\n\t\t\/\/ This analysis seems to not generate HumHash data, but\n\t\t\/\/ proably adjusted fixed variables for HumdrumTokens.\n\t\tinfile.analyzeKernTies();\n\t}\n\tif (allQ || options.getBoolean(\"text-repetitions\")) {\n\t\t\/\/ Something to do with **text text-repeat markers.\n\t\tinfile.analyzeTextRepetition();\n\t}\n\n\tinfile.printXml();\n}\n\n\n\n<|endoftext|>"} {"text":"<commit_before>\/\/ Copyright (c) 2021 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 THE\n\/\/ SOFTWARE.\n\n#include <cxx\/lexer.h>\n#include <fmt\/format.h>\n#include <utf8.h>\n\n#include <cassert>\n#include <cctype>\n#include <unordered_map>\n\n#include \"keywords-priv.h\"\n\nnamespace cxx {\n\ninline namespace {\n\nenum struct EncodingPrefix { kNone, kWide, kUtf8, kUtf16, kUtf32 };\n\nconst std::unordered_map<std::string_view, std::tuple<EncodingPrefix, bool>>\n kStringLiteralPrefixes{\n {\"R\", {EncodingPrefix::kNone, true}},\n {\"L\", {EncodingPrefix::kWide, false}},\n {\"u8\", {EncodingPrefix::kUtf8, false}},\n {\"u\", {EncodingPrefix::kUtf16, false}},\n {\"U\", {EncodingPrefix::kUtf32, false}},\n {\"LR\", {EncodingPrefix::kWide, true}},\n {\"u8R\", {EncodingPrefix::kUtf8, true}},\n {\"uR\", {EncodingPrefix::kUtf16, true}},\n {\"UR\", {EncodingPrefix::kUtf32, true}},\n };\n\nconst std::unordered_map<std::string_view, EncodingPrefix>\n kCharacterLiteralPrefixes{\n {\"L\", EncodingPrefix::kWide},\n {\"u8\", EncodingPrefix::kUtf8},\n {\"u\", EncodingPrefix::kUtf16},\n {\"U\", EncodingPrefix::kUtf32},\n };\n\ninline bool is_idcont(int ch) {\n return ch == '_' || std::isalnum((unsigned char)ch);\n}\n\ntemplate <typename It>\ninline uint32_t peekNext(It it, It end) {\n while (it + 1 < end && *it == '\\\\' && it[1] == '\\n') it += 2;\n return it < end ? utf8::peek_next(it, end) : 0;\n}\n\ntemplate <typename It>\ninline void readNext(It& it, It end) {\n while (it + 1 < end && *it == '\\\\' && it[1] == '\\n') it += 2;\n if (it < end) utf8::next(it, end);\n}\n\ntemplate <typename It>\ninline void advance(It& it, int n, It end) {\n if (n > 0) {\n while (it < end && n--) readNext(it, end);\n } else {\n throw std::runtime_error(\"offset not valid\");\n }\n}\n\n} \/\/ namespace\n\nLexer::Lexer(const std::string_view& source)\n : source_(source), pos_(cbegin(source_)), end_(cend(source_)) {\n currentChar_ = pos_ < end_ ? peekNext(pos_, end_) : 0;\n}\n\nvoid Lexer::consume() {\n readNext(pos_, end_);\n currentChar_ = pos_ < end_ ? peekNext(pos_, end_) : 0;\n}\n\nvoid Lexer::consume(int n) {\n advance(pos_, n, end_);\n currentChar_ = pos_ < end_ ? peekNext(pos_, end_) : 0;\n}\n\nuint32_t Lexer::LA(int n) const {\n auto it = pos_;\n advance(it, n, end_);\n return it < end_ ? peekNext(it, end_) : 0;\n}\n\nTokenKind Lexer::readToken() {\n const auto hasMoreChars = skipSpaces();\n\n tokenIsClean_ = true;\n tokenPos_ = pos_ - cbegin(source_);\n text_.clear();\n\n if (!hasMoreChars) return TokenKind::T_EOF_SYMBOL;\n\n const auto ch = LA();\n\n if (std::isdigit(ch)) {\n bool integer_literal = true;\n while (pos_ != end_) {\n const auto ch = LA();\n if (pos_ + 1 < end_ &&\n (ch == 'e' || ch == 'E' || ch == 'p' || ch == 'P') &&\n (LA(1) == '+' || LA(1) == '-')) {\n consume(2);\n integer_literal = false;\n } else if (pos_ + 1 < end_ && ch == '\\'' && is_idcont(LA(1))) {\n consume();\n } else if (is_idcont(ch)) {\n consume();\n } else if (ch == '.') {\n consume();\n integer_literal = false;\n } else {\n break;\n }\n }\n return integer_literal ? TokenKind::T_INTEGER_LITERAL\n : TokenKind::T_FLOATING_POINT_LITERAL;\n }\n\n EncodingPrefix encodingPrefix = EncodingPrefix::kNone;\n\n bool isRawStringLiteral = false;\n\n if (std::isalpha(ch) || ch == '_') {\n do {\n text_ += (char)LA();\n consume();\n } while (pos_ != end_ && is_idcont(LA()));\n\n bool isStringOrCharacterLiteral = false;\n\n if (pos_ != end_ && LA() == '\"') {\n auto it = kStringLiteralPrefixes.find(text_);\n if (it != kStringLiteralPrefixes.end()) {\n auto [enc, raw] = it->second;\n encodingPrefix = enc;\n isRawStringLiteral = raw;\n isStringOrCharacterLiteral = true;\n }\n } else if (pos_ != end_ && LA() == '\\'') {\n auto it = kCharacterLiteralPrefixes.find(text_);\n if (it != kCharacterLiteralPrefixes.end()) {\n encodingPrefix = it->second;\n isStringOrCharacterLiteral = true;\n }\n }\n\n if (!isStringOrCharacterLiteral) {\n tokenIsClean_ = text_.length() == tokenLength();\n\n return !preprocessing_ ? classify(text_.c_str(), int(text_.length()))\n : TokenKind::T_IDENTIFIER;\n }\n }\n\n if (LA() == '\"') {\n consume();\n\n std::string_view delimiter;\n const auto startDelimiter = pos_;\n auto endDelimiter = pos_;\n\n if (isRawStringLiteral) {\n for (; pos_ != end_; consume()) {\n const auto ch = LA();\n if (ch == '(' || ch == '\"' || ch == '\\\\' || ch == '\\n') break;\n }\n endDelimiter = pos_;\n delimiter = source_.substr(startDelimiter - cbegin(source_),\n endDelimiter - startDelimiter);\n }\n\n while (pos_ != end_) {\n if (LA() == '\"') {\n consume();\n\n if (!isRawStringLiteral) break;\n\n const auto S = startDelimiter - pos_;\n const auto N = endDelimiter - startDelimiter;\n\n if (LA(N - 2) == ')') {\n bool didMatch = true;\n for (int i = 0; i < N; ++i) {\n if (LA(S + i) != LA(N - i - 1)) {\n didMatch = false;\n break;\n }\n }\n if (didMatch) break;\n }\n } else if (pos_ + 1 < end_ && LA() == '\\\\') {\n consume(2);\n } else {\n consume();\n }\n }\n bool ud = false;\n if (std::isalpha(LA()) || LA() == '_') {\n ud = true;\n do {\n consume();\n } while (pos_ != end_ && is_idcont(LA()));\n }\n return !ud ? TokenKind::T_STRING_LITERAL\n : TokenKind::T_USER_DEFINED_STRING_LITERAL;\n }\n\n if (LA() == '\\'') {\n consume();\n while (pos_ != end_ && LA() != '\\'') {\n if (pos_ + 1 < end_ && LA() == '\\\\') {\n consume(2);\n } else {\n consume();\n }\n }\n if (LA() == '\\'') {\n consume();\n }\n\n return TokenKind::T_CHARACTER_LITERAL;\n }\n\n if (pos_ + 1 < end_ && LA() == '.' && std::isdigit(LA(1))) {\n consume();\n while (pos_ != end_) {\n const auto ch = LA();\n if (pos_ + 1 < end_ &&\n (ch == 'e' || ch == 'E' || ch == 'p' || ch == 'P') &&\n (LA(1) == '+' || LA(1) == '-')) {\n consume(2);\n } else if (pos_ + 1 < end_ && ch == '\\'' && is_idcont(LA(1))) {\n consume();\n } else if (is_idcont(ch)) {\n consume();\n } else {\n break;\n }\n }\n return TokenKind::T_FLOATING_POINT_LITERAL;\n }\n\n consume();\n\n switch (ch) {\n case '#':\n if (pos_ != end_ && LA() == '#') {\n consume();\n return TokenKind::T_HASH_HASH;\n }\n return TokenKind::T_HASH;\n\n case '=':\n if (pos_ != end_ && LA() == '=') {\n consume();\n return TokenKind::T_EQUAL_EQUAL;\n }\n return TokenKind::T_EQUAL;\n\n case ',':\n return TokenKind::T_COMMA;\n\n case '~':\n return TokenKind::T_TILDE;\n\n case '{':\n return TokenKind::T_LBRACE;\n\n case '}':\n return TokenKind::T_RBRACE;\n\n case '[':\n return TokenKind::T_LBRACKET;\n\n case ']':\n return TokenKind::T_RBRACKET;\n\n case '(':\n return TokenKind::T_LPAREN;\n\n case ')':\n return TokenKind::T_RPAREN;\n\n case ';':\n return TokenKind::T_SEMICOLON;\n\n case ':':\n if (pos_ != end_ && LA() == ':') {\n consume();\n return TokenKind::T_COLON_COLON;\n }\n return TokenKind::T_COLON;\n\n case '.':\n if (pos_ + 1 < end_ && LA() == '.' && LA(1) == '.') {\n consume(2);\n return TokenKind::T_DOT_DOT_DOT;\n } else if (pos_ != end_ && LA() == '*') {\n consume();\n return TokenKind::T_DOT_STAR;\n }\n return TokenKind::T_DOT;\n\n case '?':\n return TokenKind::T_QUESTION;\n\n case '*':\n if (pos_ != end_ && LA() == '=') {\n consume();\n return TokenKind::T_STAR_EQUAL;\n }\n return TokenKind::T_STAR;\n\n case '%':\n if (pos_ != end_ && LA() == '=') {\n consume();\n return TokenKind::T_PERCENT_EQUAL;\n }\n return TokenKind::T_PERCENT;\n\n case '^':\n if (pos_ != end_ && LA() == '=') {\n consume();\n return TokenKind::T_CARET_EQUAL;\n }\n return TokenKind::T_CARET;\n\n case '&':\n if (pos_ != end_ && LA() == '=') {\n consume();\n return TokenKind::T_AMP_EQUAL;\n } else if (pos_ != end_ && LA() == '&') {\n consume();\n return TokenKind::T_AMP_AMP;\n }\n return TokenKind::T_AMP;\n\n case '|':\n if (pos_ != end_ && LA() == '=') {\n consume();\n return TokenKind::T_BAR_EQUAL;\n } else if (pos_ != end_ && LA() == '|') {\n consume();\n return TokenKind::T_BAR_BAR;\n }\n return TokenKind::T_BAR;\n\n case '!':\n if (pos_ != end_ && LA() == '=') {\n consume();\n return TokenKind::T_EXCLAIM_EQUAL;\n }\n return TokenKind::T_EXCLAIM;\n\n case '+':\n if (pos_ != end_ && LA() == '+') {\n consume();\n return TokenKind::T_PLUS_PLUS;\n } else if (pos_ != end_ && LA() == '=') {\n consume();\n return TokenKind::T_PLUS_EQUAL;\n }\n return TokenKind::T_PLUS;\n\n case '-':\n if (pos_ != end_ && LA() == '-') {\n consume();\n return TokenKind::T_MINUS_MINUS;\n } else if (pos_ != end_ && LA() == '=') {\n consume();\n return TokenKind::T_MINUS_EQUAL;\n } else if (pos_ != end_ && LA() == '>') {\n consume();\n if (pos_ != end_ && LA() == '*') {\n consume();\n return TokenKind::T_MINUS_GREATER_STAR;\n } else {\n return TokenKind::T_MINUS_GREATER;\n }\n }\n return TokenKind::T_MINUS;\n\n case '<':\n if (pos_ != end_ && LA() == '=') {\n consume();\n if (pos_ != end_ && LA() == '>') {\n consume();\n return TokenKind::T_LESS_EQUAL_GREATER;\n }\n return TokenKind::T_LESS_EQUAL;\n } else if (pos_ != end_ && LA() == '<') {\n consume();\n if (pos_ != end_ && LA() == '=') {\n consume();\n return TokenKind::T_LESS_LESS_EQUAL;\n }\n return TokenKind::T_LESS_LESS;\n }\n return TokenKind::T_LESS;\n\n case '>':\n if (preprocessing_) {\n if (pos_ != end_ && LA() == '=') {\n consume();\n return TokenKind::T_GREATER_EQUAL;\n } else if (pos_ != end_ && LA() == '>') {\n consume();\n if (pos_ != end_ && LA() == '=') {\n consume();\n return TokenKind::T_GREATER_GREATER_EQUAL;\n }\n return TokenKind::T_GREATER_GREATER;\n }\n } else if (LA() == '>') {\n TokenKind k = TokenKind::T_GREATER_GREATER;\n\n if (LA(1) == '=') k = TokenKind::T_GREATER_GREATER_EQUAL;\n\n tokenValue_.tokenKindValue = k;\n } else if (LA() == '=') {\n tokenValue_.tokenKindValue = TokenKind::T_GREATER_EQUAL;\n }\n\n return TokenKind::T_GREATER;\n\n case '\/':\n if (pos_ != end_ && LA() == '=') {\n consume();\n return TokenKind::T_SLASH_EQUAL;\n }\n return TokenKind::T_SLASH;\n }\n\n return TokenKind::T_ERROR;\n} \/\/ namespace cxx\n\nbool Lexer::skipSpaces() {\n tokenLeadingSpace_ = leadingSpace_;\n tokenStartOfLine_ = startOfLine_;\n\n while (pos_ != end_) {\n const auto ch = LA();\n\n if (std::isspace(ch)) {\n if (ch == '\\n') {\n tokenStartOfLine_ = true;\n tokenLeadingSpace_ = false;\n } else {\n tokenLeadingSpace_ = true;\n }\n consume();\n } else if (pos_ + 1 < end_ && ch == '\/' && LA(1) == '\/') {\n consume(2);\n for (; pos_ != end_; consume()) {\n if (pos_ != end_ && LA() == '\\n') {\n break;\n }\n }\n } else if (pos_ + 1 < end_ && ch == '\/' && LA(1) == '*') {\n while (pos_ != end_) {\n if (pos_ + 1 < end_ && LA() == '*' && LA(1) == '\/') {\n consume(2);\n break;\n } else {\n consume();\n }\n }\n \/\/ unexpected eof\n } else {\n break;\n }\n }\n\n leadingSpace_ = false;\n startOfLine_ = false;\n\n return pos_ != end_;\n}\n\nTokenKind Lexer::classifyKeyword(const std::string_view& text) {\n return classify(text.data(), int(text.size()));\n}\n\n} \/\/ namespace cxx\n<commit_msg>Handle CRLF eols following merge-line tokens<commit_after>\/\/ Copyright (c) 2021 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 THE\n\/\/ SOFTWARE.\n\n#include <cxx\/lexer.h>\n#include <fmt\/format.h>\n#include <utf8.h>\n\n#include <cassert>\n#include <cctype>\n#include <unordered_map>\n\n#include \"keywords-priv.h\"\n\nnamespace cxx {\n\ninline namespace {\n\nenum struct EncodingPrefix { kNone, kWide, kUtf8, kUtf16, kUtf32 };\n\nconst std::unordered_map<std::string_view, std::tuple<EncodingPrefix, bool>>\n kStringLiteralPrefixes{\n {\"R\", {EncodingPrefix::kNone, true}},\n {\"L\", {EncodingPrefix::kWide, false}},\n {\"u8\", {EncodingPrefix::kUtf8, false}},\n {\"u\", {EncodingPrefix::kUtf16, false}},\n {\"U\", {EncodingPrefix::kUtf32, false}},\n {\"LR\", {EncodingPrefix::kWide, true}},\n {\"u8R\", {EncodingPrefix::kUtf8, true}},\n {\"uR\", {EncodingPrefix::kUtf16, true}},\n {\"UR\", {EncodingPrefix::kUtf32, true}},\n };\n\nconst std::unordered_map<std::string_view, EncodingPrefix>\n kCharacterLiteralPrefixes{\n {\"L\", EncodingPrefix::kWide},\n {\"u8\", EncodingPrefix::kUtf8},\n {\"u\", EncodingPrefix::kUtf16},\n {\"U\", EncodingPrefix::kUtf32},\n };\n\ninline bool is_idcont(int ch) {\n return ch == '_' || std::isalnum((unsigned char)ch);\n}\n\ntemplate <typename It>\ninline It skipSlash(It it, It end) {\n while (it < end && *it == '\\\\') {\n if (it + 1 < end && it[1] == '\\n')\n it += 2;\n else if (it + 2 < end && it[1] == '\\r' && it[2] == '\\n')\n it += 3;\n else\n break;\n }\n return it;\n}\n\ntemplate <typename It>\ninline uint32_t peekNext(It it, It end) {\n it = skipSlash(it, end);\n return it < end ? utf8::peek_next(it, end) : 0;\n}\n\ntemplate <typename It>\ninline void readNext(It& it, It end) {\n it = skipSlash(it, end);\n if (it < end) utf8::next(it, end);\n}\n\ntemplate <typename It>\ninline void advance(It& it, int n, It end) {\n if (n > 0) {\n while (it < end && n--) readNext(it, end);\n } else {\n throw std::runtime_error(\"offset not valid\");\n }\n}\n\n} \/\/ namespace\n\nLexer::Lexer(const std::string_view& source)\n : source_(source), pos_(cbegin(source_)), end_(cend(source_)) {\n currentChar_ = pos_ < end_ ? peekNext(pos_, end_) : 0;\n}\n\nvoid Lexer::consume() {\n readNext(pos_, end_);\n currentChar_ = pos_ < end_ ? peekNext(pos_, end_) : 0;\n}\n\nvoid Lexer::consume(int n) {\n advance(pos_, n, end_);\n currentChar_ = pos_ < end_ ? peekNext(pos_, end_) : 0;\n}\n\nuint32_t Lexer::LA(int n) const {\n auto it = pos_;\n advance(it, n, end_);\n return it < end_ ? peekNext(it, end_) : 0;\n}\n\nTokenKind Lexer::readToken() {\n const auto hasMoreChars = skipSpaces();\n\n tokenIsClean_ = true;\n tokenPos_ = pos_ - cbegin(source_);\n text_.clear();\n\n if (!hasMoreChars) return TokenKind::T_EOF_SYMBOL;\n\n const auto ch = LA();\n\n if (std::isdigit(ch)) {\n bool integer_literal = true;\n while (pos_ != end_) {\n const auto ch = LA();\n if (pos_ + 1 < end_ &&\n (ch == 'e' || ch == 'E' || ch == 'p' || ch == 'P') &&\n (LA(1) == '+' || LA(1) == '-')) {\n consume(2);\n integer_literal = false;\n } else if (pos_ + 1 < end_ && ch == '\\'' && is_idcont(LA(1))) {\n consume();\n } else if (is_idcont(ch)) {\n consume();\n } else if (ch == '.') {\n consume();\n integer_literal = false;\n } else {\n break;\n }\n }\n return integer_literal ? TokenKind::T_INTEGER_LITERAL\n : TokenKind::T_FLOATING_POINT_LITERAL;\n }\n\n EncodingPrefix encodingPrefix = EncodingPrefix::kNone;\n\n bool isRawStringLiteral = false;\n\n if (std::isalpha(ch) || ch == '_') {\n do {\n text_ += (char)LA();\n consume();\n } while (pos_ != end_ && is_idcont(LA()));\n\n bool isStringOrCharacterLiteral = false;\n\n if (pos_ != end_ && LA() == '\"') {\n auto it = kStringLiteralPrefixes.find(text_);\n if (it != kStringLiteralPrefixes.end()) {\n auto [enc, raw] = it->second;\n encodingPrefix = enc;\n isRawStringLiteral = raw;\n isStringOrCharacterLiteral = true;\n }\n } else if (pos_ != end_ && LA() == '\\'') {\n auto it = kCharacterLiteralPrefixes.find(text_);\n if (it != kCharacterLiteralPrefixes.end()) {\n encodingPrefix = it->second;\n isStringOrCharacterLiteral = true;\n }\n }\n\n if (!isStringOrCharacterLiteral) {\n tokenIsClean_ = text_.length() == tokenLength();\n\n return !preprocessing_ ? classify(text_.c_str(), int(text_.length()))\n : TokenKind::T_IDENTIFIER;\n }\n }\n\n if (LA() == '\"') {\n consume();\n\n std::string_view delimiter;\n const auto startDelimiter = pos_;\n auto endDelimiter = pos_;\n\n if (isRawStringLiteral) {\n for (; pos_ != end_; consume()) {\n const auto ch = LA();\n if (ch == '(' || ch == '\"' || ch == '\\\\' || ch == '\\n') break;\n }\n endDelimiter = pos_;\n delimiter = source_.substr(startDelimiter - cbegin(source_),\n endDelimiter - startDelimiter);\n }\n\n while (pos_ != end_) {\n if (LA() == '\"') {\n consume();\n\n if (!isRawStringLiteral) break;\n\n const auto S = startDelimiter - pos_;\n const auto N = endDelimiter - startDelimiter;\n\n if (LA(N - 2) == ')') {\n bool didMatch = true;\n for (int i = 0; i < N; ++i) {\n if (LA(S + i) != LA(N - i - 1)) {\n didMatch = false;\n break;\n }\n }\n if (didMatch) break;\n }\n } else if (pos_ + 1 < end_ && LA() == '\\\\') {\n consume(2);\n } else {\n consume();\n }\n }\n bool ud = false;\n if (std::isalpha(LA()) || LA() == '_') {\n ud = true;\n do {\n consume();\n } while (pos_ != end_ && is_idcont(LA()));\n }\n return !ud ? TokenKind::T_STRING_LITERAL\n : TokenKind::T_USER_DEFINED_STRING_LITERAL;\n }\n\n if (LA() == '\\'') {\n consume();\n while (pos_ != end_ && LA() != '\\'') {\n if (pos_ + 1 < end_ && LA() == '\\\\') {\n consume(2);\n } else {\n consume();\n }\n }\n if (LA() == '\\'') {\n consume();\n }\n\n return TokenKind::T_CHARACTER_LITERAL;\n }\n\n if (pos_ + 1 < end_ && LA() == '.' && std::isdigit(LA(1))) {\n consume();\n while (pos_ != end_) {\n const auto ch = LA();\n if (pos_ + 1 < end_ &&\n (ch == 'e' || ch == 'E' || ch == 'p' || ch == 'P') &&\n (LA(1) == '+' || LA(1) == '-')) {\n consume(2);\n } else if (pos_ + 1 < end_ && ch == '\\'' && is_idcont(LA(1))) {\n consume();\n } else if (is_idcont(ch)) {\n consume();\n } else {\n break;\n }\n }\n return TokenKind::T_FLOATING_POINT_LITERAL;\n }\n\n consume();\n\n switch (ch) {\n case '#':\n if (pos_ != end_ && LA() == '#') {\n consume();\n return TokenKind::T_HASH_HASH;\n }\n return TokenKind::T_HASH;\n\n case '=':\n if (pos_ != end_ && LA() == '=') {\n consume();\n return TokenKind::T_EQUAL_EQUAL;\n }\n return TokenKind::T_EQUAL;\n\n case ',':\n return TokenKind::T_COMMA;\n\n case '~':\n return TokenKind::T_TILDE;\n\n case '{':\n return TokenKind::T_LBRACE;\n\n case '}':\n return TokenKind::T_RBRACE;\n\n case '[':\n return TokenKind::T_LBRACKET;\n\n case ']':\n return TokenKind::T_RBRACKET;\n\n case '(':\n return TokenKind::T_LPAREN;\n\n case ')':\n return TokenKind::T_RPAREN;\n\n case ';':\n return TokenKind::T_SEMICOLON;\n\n case ':':\n if (pos_ != end_ && LA() == ':') {\n consume();\n return TokenKind::T_COLON_COLON;\n }\n return TokenKind::T_COLON;\n\n case '.':\n if (pos_ + 1 < end_ && LA() == '.' && LA(1) == '.') {\n consume(2);\n return TokenKind::T_DOT_DOT_DOT;\n } else if (pos_ != end_ && LA() == '*') {\n consume();\n return TokenKind::T_DOT_STAR;\n }\n return TokenKind::T_DOT;\n\n case '?':\n return TokenKind::T_QUESTION;\n\n case '*':\n if (pos_ != end_ && LA() == '=') {\n consume();\n return TokenKind::T_STAR_EQUAL;\n }\n return TokenKind::T_STAR;\n\n case '%':\n if (pos_ != end_ && LA() == '=') {\n consume();\n return TokenKind::T_PERCENT_EQUAL;\n }\n return TokenKind::T_PERCENT;\n\n case '^':\n if (pos_ != end_ && LA() == '=') {\n consume();\n return TokenKind::T_CARET_EQUAL;\n }\n return TokenKind::T_CARET;\n\n case '&':\n if (pos_ != end_ && LA() == '=') {\n consume();\n return TokenKind::T_AMP_EQUAL;\n } else if (pos_ != end_ && LA() == '&') {\n consume();\n return TokenKind::T_AMP_AMP;\n }\n return TokenKind::T_AMP;\n\n case '|':\n if (pos_ != end_ && LA() == '=') {\n consume();\n return TokenKind::T_BAR_EQUAL;\n } else if (pos_ != end_ && LA() == '|') {\n consume();\n return TokenKind::T_BAR_BAR;\n }\n return TokenKind::T_BAR;\n\n case '!':\n if (pos_ != end_ && LA() == '=') {\n consume();\n return TokenKind::T_EXCLAIM_EQUAL;\n }\n return TokenKind::T_EXCLAIM;\n\n case '+':\n if (pos_ != end_ && LA() == '+') {\n consume();\n return TokenKind::T_PLUS_PLUS;\n } else if (pos_ != end_ && LA() == '=') {\n consume();\n return TokenKind::T_PLUS_EQUAL;\n }\n return TokenKind::T_PLUS;\n\n case '-':\n if (pos_ != end_ && LA() == '-') {\n consume();\n return TokenKind::T_MINUS_MINUS;\n } else if (pos_ != end_ && LA() == '=') {\n consume();\n return TokenKind::T_MINUS_EQUAL;\n } else if (pos_ != end_ && LA() == '>') {\n consume();\n if (pos_ != end_ && LA() == '*') {\n consume();\n return TokenKind::T_MINUS_GREATER_STAR;\n } else {\n return TokenKind::T_MINUS_GREATER;\n }\n }\n return TokenKind::T_MINUS;\n\n case '<':\n if (pos_ != end_ && LA() == '=') {\n consume();\n if (pos_ != end_ && LA() == '>') {\n consume();\n return TokenKind::T_LESS_EQUAL_GREATER;\n }\n return TokenKind::T_LESS_EQUAL;\n } else if (pos_ != end_ && LA() == '<') {\n consume();\n if (pos_ != end_ && LA() == '=') {\n consume();\n return TokenKind::T_LESS_LESS_EQUAL;\n }\n return TokenKind::T_LESS_LESS;\n }\n return TokenKind::T_LESS;\n\n case '>':\n if (preprocessing_) {\n if (pos_ != end_ && LA() == '=') {\n consume();\n return TokenKind::T_GREATER_EQUAL;\n } else if (pos_ != end_ && LA() == '>') {\n consume();\n if (pos_ != end_ && LA() == '=') {\n consume();\n return TokenKind::T_GREATER_GREATER_EQUAL;\n }\n return TokenKind::T_GREATER_GREATER;\n }\n } else if (LA() == '>') {\n TokenKind k = TokenKind::T_GREATER_GREATER;\n\n if (LA(1) == '=') k = TokenKind::T_GREATER_GREATER_EQUAL;\n\n tokenValue_.tokenKindValue = k;\n } else if (LA() == '=') {\n tokenValue_.tokenKindValue = TokenKind::T_GREATER_EQUAL;\n }\n\n return TokenKind::T_GREATER;\n\n case '\/':\n if (pos_ != end_ && LA() == '=') {\n consume();\n return TokenKind::T_SLASH_EQUAL;\n }\n return TokenKind::T_SLASH;\n }\n\n return TokenKind::T_ERROR;\n} \/\/ namespace cxx\n\nbool Lexer::skipSpaces() {\n tokenLeadingSpace_ = leadingSpace_;\n tokenStartOfLine_ = startOfLine_;\n\n while (pos_ != end_) {\n const auto ch = LA();\n\n if (std::isspace(ch)) {\n if (ch == '\\n') {\n tokenStartOfLine_ = true;\n tokenLeadingSpace_ = false;\n } else {\n tokenLeadingSpace_ = true;\n }\n consume();\n } else if (pos_ + 1 < end_ && ch == '\/' && LA(1) == '\/') {\n consume(2);\n for (; pos_ != end_; consume()) {\n if (pos_ != end_ && LA() == '\\n') {\n break;\n }\n }\n } else if (pos_ + 1 < end_ && ch == '\/' && LA(1) == '*') {\n while (pos_ != end_) {\n if (pos_ + 1 < end_ && LA() == '*' && LA(1) == '\/') {\n consume(2);\n break;\n } else {\n consume();\n }\n }\n \/\/ unexpected eof\n } else {\n break;\n }\n }\n\n leadingSpace_ = false;\n startOfLine_ = false;\n\n return pos_ != end_;\n}\n\nTokenKind Lexer::classifyKeyword(const std::string_view& text) {\n return classify(text.data(), int(text.size()));\n}\n\n} \/\/ namespace cxx\n<|endoftext|>"} {"text":"<commit_before>\/**\r\n * @file\t\ticomponent.hpp\r\n * @brief\t\tComponent(Shared Library) interface\r\n * @author\t\tByunghun Hwang<bhhwang@nsynapse.com>\r\n * @date \t\t2015. 6. 21\r\n * @details\t\tComponent interface class\r\n *\/\r\n\r\n#ifndef _COSSB_ICOMPONENT_HPP_\r\n#define _COSSB_ICOMPONENT_HPP_\r\n\r\n#include <string>\r\n#include \"iprofile.hpp\"\r\n#include \"imessage.hpp\"\r\n\r\nusing namespace std;\r\n\r\nnamespace cossb {\r\n\r\nnamespace component {\r\n\tenum class status : unsigned int { IDLE=0, RUNNING, STOPPED };\r\n}\r\n\r\nnamespace interface {\r\n\r\n\/**\r\n* @brief\t\tcomponent interface class\r\n* @details\t\tbase component interface, lifecycle is (setup-run-stop)\r\n* @author\t\tByunghun Hwang<bhhwang@nsynapse.com>\r\n* @date\t\t2015. 6. 22\r\n*\/\r\nclass icomponent {\r\n\r\npublic:\r\n\t\/**\r\n\t * @brief\r\n\t *\/\r\n\tvirtual ~icomponent() {\r\n\t\tif(_profile)\r\n\t\t\tdelete _profile;\r\n\t}\r\n\r\n\t\/**\r\n\t * @brief\t\tinitialization\r\n\t * @details\t\tthis function will be called at first\r\n\t * @return\t\ttrue if it is success\r\n\t *\/\r\n\tvirtual bool setup() = 0;\r\n\r\n\t\/**\r\n\t * @brief\t\tprocess logic in here\r\n\t * @details\t\tif request message comes in, this function will be called\r\n\t *\/\r\n\tvirtual bool run() = 0;\r\n\r\n\t\/**\r\n\t * @brief\tstop interface\r\n\t *\/\r\n\tvirtual bool stop() = 0;\r\n\r\n\t\/**\r\n\t * @brief\tmessage request\r\n\t *\/\r\n\tvirtual void request(imessage* msg) = 0;\r\n\r\n\t\/**\r\n\t * @brief\r\n\t *\/\r\n\tconst char* get_name() const {\r\n\t\treturn _name.c_str();\r\n\t}\r\n\r\n\t\/**\r\n\t * @brief\r\n\t *\/\r\n\tiprofile* get_profile() const {\r\n\t\treturn _profile;\r\n\t}\r\n\r\n\t\/**\r\n\t * @brief\tgetting status\r\n\t *\/\r\n\tcomponent::status get_status() { return _status; }\r\n\r\n\t\/**\r\n\t * @brief\tset component profile\r\n\t *\/\r\n\tbool set_profile(iprofile* profile, const char* path)\r\n\t{\r\n\t\t_profile = profile;\r\n\t\treturn _profile->load(path);\r\n\t}\r\n\r\n\r\nprotected:\r\n\texplicit icomponent(const char* name)\r\n\t:_name(name), _profile(nullptr), _status(component::status::IDLE) {\r\n\r\n\t}\r\n\r\nprivate:\r\n\tstring _name;\r\n\tiprofile* _profile = nullptr;\r\n\r\nprotected:\r\n\tcomponent::status _status;\r\n\r\n};\r\n\r\n} \/* namespace interface *\/\r\n\r\n\r\ntypedef interface::icomponent*(*create_component)(void);\r\ntypedef void(*destroy_component)(void);\r\n\r\n} \/* namespace cossb *\/\r\n\r\n\r\n#endif \/* _COSSB_ICOMPONENT_HPP_ *\/\r\n<commit_msg>add comment<commit_after>\/**\r\n * @file\t\ticomponent.hpp\r\n * @brief\t\tComponent(Shared Library) interface\r\n * @author\t\tByunghun Hwang<bhhwang@nsynapse.com>\r\n * @date \t\t2015. 6. 21\r\n * @details\t\tComponent interface class\r\n *\/\r\n\r\n#ifndef _COSSB_ICOMPONENT_HPP_\r\n#define _COSSB_ICOMPONENT_HPP_\r\n\r\n#include <string>\r\n#include \"iprofile.hpp\"\r\n#include \"imessage.hpp\"\r\n\r\nusing namespace std;\r\n\r\nnamespace cossb {\r\n\r\nnamespace component {\r\n\tenum class status : unsigned int { IDLE=0, RUNNING, STOPPED };\r\n}\r\n\r\nnamespace interface {\r\n\r\n\/**\r\n* @brief\t\tcomponent interface class\r\n* @details\t\tbase component interface, lifecycle is (setup-run-stop)\r\n* @author\t\tByunghun Hwang<bhhwang@nsynapse.com>\r\n* @date\t\t2015. 6. 22\r\n*\/\r\nclass icomponent {\r\n\r\npublic:\r\n\t\/**\r\n\t * @brief\r\n\t *\/\r\n\tvirtual ~icomponent() {\r\n\t\tif(_profile)\r\n\t\t\tdelete _profile;\r\n\t}\r\n\r\n\t\/**\r\n\t * @brief\t\tinitialization\r\n\t * @details\tthis function will be called once when load component\r\n\t * @return\t\ttrue if it is success\r\n\t *\/\r\n\tvirtual bool setup() = 0;\r\n\r\n\t\/**\r\n\t * @brief\t\tstart signal comes in, this function will be called\r\n\t * @details\r\n\t *\/\r\n\tvirtual bool run() = 0;\r\n\r\n\t\/**\r\n\t * @brief\tstop interface\r\n\t * @brief\tstop signal comes in, this function will be called\r\n\t *\/\r\n\tvirtual bool stop() = 0;\r\n\r\n\t\/**\r\n\t * @brief\tmessage request\r\n\t * @details\tif request message comes in, this function will be called\r\n\t *\/\r\n\tvirtual void request(imessage* msg) = 0;\r\n\r\n\t\/**\r\n\t * @brief\r\n\t *\/\r\n\tconst char* get_name() const {\r\n\t\treturn _name.c_str();\r\n\t}\r\n\r\n\t\/**\r\n\t * @brief\r\n\t *\/\r\n\tiprofile* get_profile() const {\r\n\t\treturn _profile;\r\n\t}\r\n\r\n\t\/**\r\n\t * @brief\tgetting status\r\n\t *\/\r\n\tcomponent::status get_status() { return _status; }\r\n\r\n\t\/**\r\n\t * @brief\tset component profile\r\n\t *\/\r\n\tbool set_profile(iprofile* profile, const char* path)\r\n\t{\r\n\t\t_profile = profile;\r\n\t\treturn _profile->load(path);\r\n\t}\r\n\r\n\r\nprotected:\r\n\texplicit icomponent(const char* name)\r\n\t:_name(name), _profile(nullptr), _status(component::status::IDLE) {\r\n\r\n\t}\r\n\r\nprivate:\r\n\tstring _name;\r\n\tiprofile* _profile = nullptr;\r\n\r\nprotected:\r\n\tcomponent::status _status;\r\n\r\n};\r\n\r\n} \/* namespace interface *\/\r\n\r\n\r\ntypedef interface::icomponent*(*create_component)(void);\r\ntypedef void(*destroy_component)(void);\r\n\r\n} \/* namespace cossb *\/\r\n\r\n\r\n#endif \/* _COSSB_ICOMPONENT_HPP_ *\/\r\n<|endoftext|>"} {"text":"<commit_before>\/*\n\nCopyright (c) 2003, Arvid Norberg\nAll rights reserved.\n\nRedistribution and use in source and binary forms, with or without\nmodification, are permitted provided that the following conditions\nare met:\n\n * Redistributions of source code must retain the above copyright\n notice, this list of conditions and the following disclaimer.\n * Redistributions in binary form must reproduce the above copyright\n notice, this list of conditions and the following disclaimer in\n the documentation and\/or other materials provided with the distribution.\n * Neither the name of the author nor the names of its\n contributors may be used to endorse or promote products derived\n from this software without specific prior written permission.\n\nTHIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS \"AS IS\"\nAND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE\nIMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE\nARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE\nLIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR\nCONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF\nSUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS\nINTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN\nCONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)\nARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE\nPOSSIBILITY OF SUCH DAMAGE.\n\n*\/\n\n#ifndef TORRENT_PEER_INFO_HPP_INCLUDED\n#define TORRENT_PEER_INFO_HPP_INCLUDED\n\n#include <vector>\n#include \"libtorrent\/socket.hpp\"\n#include \"libtorrent\/peer_id.hpp\"\n\nnamespace libtorrent\n{\n\tstruct peer_info\n\t{\n\t\tenum\n\t\t{\n\t\t\tinteresting = 0x1,\n\t\t\tchoked = 0x2,\n\t\t\tremote_interested = 0x4,\n\t\t\tremote_choked = 0x8,\n\t\t\tsupports_extensions = 0x10,\n\t\t\tlocal_connection = 0x20\n\t\t};\n\t\tunsigned int flags;\n\t\taddress ip;\n\t\tfloat up_speed;\n\t\tfloat down_speed;\n\t\tunsigned int total_download;\n\t\tunsigned int total_upload;\n\t\tpeer_id id;\n\t\tstd::vector<bool> pieces;\n\t\tint upload_limit;\n\t\tint upload_ceiling;\n\n\t\tint load_balancing;\n\n\t\t\/\/ this is the number of requests\n\t\t\/\/ we have sent to this peer\n\t\t\/\/ that we haven't got a response\n\t\t\/\/ for yet\n\t\tint download_queue_length;\n\n\t\t\/\/ the currently downloading piece\n\t\t\/\/ if piece index is -1 all associated\n\t\t\/\/ members are just set to 0\n\t\tint downloading_piece_index;\n\t\tint downloading_block_index;\n\t\tint downloading_progress;\n\t\tint downloading_total;\n\t};\n\n}\n\n#endif \/\/ TORRENT_PEER_INFO_HPP_INCLUDED\n<commit_msg>*** empty log message ***<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#ifndef TORRENT_PEER_INFO_HPP_INCLUDED\n#define TORRENT_PEER_INFO_HPP_INCLUDED\n\n#include <vector>\n#include \"libtorrent\/socket.hpp\"\n#include \"libtorrent\/peer_id.hpp\"\n\nnamespace libtorrent\n{\n\tstruct peer_info\n\t{\n\t\tenum\n\t\t{\n\t\t\tinteresting = 0x1,\n\t\t\tchoked = 0x2,\n\t\t\tremote_interested = 0x4,\n\t\t\tremote_choked = 0x8,\n\t\t\tsupports_extensions = 0x10,\n\t\t\tlocal_connection = 0x20\n\t\t};\n\t\tunsigned int flags;\n\t\taddress ip;\n\t\tfloat up_speed;\n\t\tfloat down_speed;\n\t\tunsigned int total_download;\n\t\tunsigned int total_upload;\n\t\tpeer_id id;\n\t\tstd::vector<bool> pieces;\n\t\tint upload_limit; \/\/ from peer_connection\n\t\tint upload_ceiling; \/\/ from the global upload limiter\n\n\t\tint load_balancing;\n\n\t\t\/\/ this is the number of requests\n\t\t\/\/ we have sent to this peer\n\t\t\/\/ that we haven't got a response\n\t\t\/\/ for yet\n\t\tint download_queue_length;\n\n\t\t\/\/ the currently downloading piece\n\t\t\/\/ if piece index is -1 all associated\n\t\t\/\/ members are just set to 0\n\t\tint downloading_piece_index;\n\t\tint downloading_block_index;\n\t\tint downloading_progress;\n\t\tint downloading_total;\n\t};\n\n}\n\n#endif \/\/ TORRENT_PEER_INFO_HPP_INCLUDED\n<|endoftext|>"} {"text":"<commit_before>\/*\n * Copyright 2008, 2009 Google Inc.\n * Copyright 2007 Nintendo 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#include <sys\/stat.h>\n#include <sys\/types.h>\n#include <set>\n#include \"java.h\"\n\nnamespace\n{\n\nFILE* createFile(const std::string package, const Node* node)\n{\n std::string filename = package;\n\n size_t pos = 0;\n for (;;)\n {\n pos = filename.find('.', pos);\n if (pos == std::string::npos)\n {\n break;\n }\n filename[pos] = '\/';\n }\n\n filename += \"\/\" + node->getName() + \".java\";\n\n std::string dir;\n std::string path(filename);\n for (;;)\n {\n size_t slash = path.find(\"\/\");\n if (slash == std::string::npos)\n {\n break;\n }\n dir += path.substr(0, slash);\n path.erase(0, slash + 1);\n mkdir(dir.c_str(), 0777);\n dir += '\/';\n }\n\n printf(\"# %s in %s\\n\", node->getName().c_str(), filename.c_str());\n return fopen(filename.c_str(), \"w\");\n}\n\n} \/\/ namespace\n\nclass JavaInterface : public Java\n{\n \/\/ TODO: Move to Java\n void visitInterfaceElement(const Interface* interface, Node* element)\n {\n if (dynamic_cast<Interface*>(element))\n {\n \/\/ Do not process Constructor.\n return;\n }\n\n optionalStage = 0;\n do\n {\n optionalCount = 0;\n element->accept(this);\n ++optionalStage;\n } while (optionalStage <= optionalCount);\n }\n\npublic:\n JavaInterface(const char* source, FILE* file, const char* indent = \"es\") :\n Java(source, file, indent)\n {\n }\n\n virtual void at(const ExceptDcl* node)\n {\n writetab();\n if (node->getJavadoc().size())\n {\n write(\"%s\\n\", node->getJavadoc().c_str());\n writetab();\n }\n write(\"public class %s extends RuntimeException {\\n\", node->getName().c_str());\n \/\/ TODO(Shiki): Need a constructor.\n printChildren(node);\n writeln(\"}\");\n }\n\n virtual void at(const Interface* node)\n {\n assert(!(node->getAttr() & Interface::Supplemental) && !node->isLeaf());\n writetab();\n if (node->getJavadoc().size())\n {\n write(\"%s\\n\", node->getJavadoc().c_str());\n writetab();\n }\n\n std::string name = node->getQualifiedName();\n name = getInterfaceName(name);\n write(\"public interface %s\", name.substr(name.rfind(':') + 1).c_str());\n if (node->getExtends())\n {\n const char* separator = \" extends \";\n for (NodeList::iterator i = node->getExtends()->begin();\n i != node->getExtends()->end();\n ++i)\n {\n if ((*i)->getName() == Node::getBaseObjectName())\n {\n \/\/ Do not extend from 'Object'.\n continue;\n }\n write(separator);\n separator = \", \";\n (*i)->accept(this);\n }\n }\n write(\" {\\n\");\n\n for (NodeList::iterator i = node->begin(); i != node->end(); ++i)\n {\n visitInterfaceElement(node, *i);\n }\n\n \/\/ Expand mixins\n std::list<const Interface*> interfaceList;\n node->collectMixins(&interfaceList, node);\n for (std::list<const Interface*>::const_iterator i = interfaceList.begin();\n i != interfaceList.end();\n ++i)\n {\n if (*i == node)\n {\n continue;\n }\n writeln(\"\/\/ %s\", (*i)->getName().c_str());\n for (NodeList::iterator j = (*i)->begin(); j != (*i)->end(); ++j)\n {\n visitInterfaceElement(*i, *j);\n }\n }\n\n writeln(\"}\");\n }\n\n virtual void at(const BinaryExpr* node)\n {\n node->getLeft()->accept(this);\n write(\" %s \", node->getName().c_str());\n node->getRight()->accept(this);\n }\n\n virtual void at(const UnaryExpr* node)\n {\n write(\"%s\", node->getName().c_str());\n NodeList::iterator elem = node->begin();\n (*elem)->accept(this);\n }\n\n virtual void at(const GroupingExpression* node)\n {\n write(\"(\");\n NodeList::iterator elem = node->begin();\n (*elem)->accept(this);\n write(\")\");\n }\n\n virtual void at(const Literal* node)\n {\n write(\"%s\", node->getName().c_str());\n }\n\n virtual void at(const Member* node)\n {\n if (node->isTypedef(node->getParent()))\n {\n return;\n }\n\n writetab();\n write(\"public \");\n node->getSpec()->accept(this);\n write(\" %s;\\n\", node->getName().c_str());\n }\n\n virtual void at(const ArrayDcl* node)\n {\n assert(!node->isLeaf());\n if (node->isTypedef(node->getParent()))\n {\n return;\n }\n\n writetab();\n node->getSpec()->accept(this);\n write(\" %s\", node->getName().c_str());\n for (NodeList::iterator i = node->begin(); i != node->end(); ++i)\n {\n write(\"[\");\n (*i)->accept(this);\n write(\"]\");\n }\n if (node->isTypedef(node->getParent()))\n {\n write(\";\\n\");\n }\n }\n\n virtual void at(const ConstDcl* node)\n {\n writetab();\n if (node->getJavadoc().size())\n {\n write(\"%s\\n\", node->getJavadoc().c_str());\n writetab();\n }\n write(\"public static final \");\n node->getSpec()->accept(this);\n write(\" %s = \", node->getName().c_str());\n node->getExp()->accept(this);\n write(\";\\n\");\n }\n\n virtual void at(const Attribute* node)\n {\n writetab();\n if (node->getJavadoc().size())\n {\n write(\"%s\\n\", node->getJavadoc().c_str());\n writetab();\n }\n\n \/\/ getter\n Java::getter(node);\n write(\";\\n\");\n\n if (!node->isReadonly() || node->isPutForwards() || node->isReplaceable())\n {\n \/\/ setter\n writetab();\n Java::setter(node);\n write(\";\\n\");\n }\n }\n\n virtual void at(const OpDcl* node)\n {\n writetab();\n if (node->getJavadoc().size())\n {\n write(\"%s\\n\", node->getJavadoc().c_str());\n writetab();\n }\n Java::at(node);\n write(\";\\n\");\n }\n};\n\nclass JavaImport : public Visitor, public Formatter\n{\n std::string package;\n const Interface* current;\n bool printed;\n std::string prefixedName;\n std::set<std::string> importSet;\n\npublic:\n JavaImport(std::string package, FILE* file, const char* indent) :\n Formatter(file, indent),\n package(package),\n current(0)\n {\n }\n\n virtual void at(const Node* node)\n {\n visitChildren(node);\n }\n\n virtual void at(const ScopedName* node)\n {\n assert(current);\n\n if (node->isBaseObject())\n {\n return;\n }\n std::string name = node->getName();\n Node* resolved = resolve(current, name);\n if (resolved)\n {\n if (Module* module = dynamic_cast<Module*>(resolved->getParent()))\n {\n if (prefixedName != module->getPrefixedName())\n {\n importSet.insert(Java::getPackageName(module->getPrefixedName()) + \".\" + node->getIdentifier());\n }\n }\n }\n }\n\n virtual void at(const Interface* node)\n {\n if (current)\n {\n return;\n }\n current = node;\n if (Module* module = dynamic_cast<Module*>(node->getParent()))\n {\n prefixedName = module->getPrefixedName();\n }\n visitChildren(node->getExtends());\n visitChildren(node);\n \/\/ Expand mixins\n std::list<const Interface*> interfaceList;\n node->collectMixins(&interfaceList, node);\n for (std::list<const Interface*>::const_iterator i = interfaceList.begin();\n i != interfaceList.end();\n ++i)\n {\n if (*i == node)\n {\n continue;\n }\n visitChildren(*i);\n }\n }\n\n virtual void at(const Attribute* node)\n {\n node->getSpec()->accept(this);\n visitChildren(node->getGetRaises());\n if (!node->isReadonly() || node->isPutForwards() || node->isReplaceable())\n {\n visitChildren(node->getSetRaises());\n }\n }\n\n virtual void at(const OpDcl* node)\n {\n node->getSpec()->accept(this);\n visitChildren(node);\n visitChildren(node->getRaises());\n }\n\n virtual void at(const ParamDcl* node)\n {\n node->getSpec()->accept(this);\n }\n\n void print()\n {\n if (importSet.empty())\n {\n return;\n }\n for (std::set<std::string>::iterator i = importSet.begin();\n i != importSet.end();\n ++i)\n {\n write(\"import %s;\\n\", (*i).c_str());\n }\n write(\"\\n\");\n }\n};\n\nclass JavaVisitor : public Visitor\n{\n const char* source;\n const char* indent;\n\n std::string prefixedName;\n\npublic:\n JavaVisitor(const char* source, const char* indent = \"es\") :\n source(source),\n indent(indent)\n {\n }\n\n virtual void at(const Node* node)\n {\n if (1 < node->getRank())\n {\n return;\n }\n visitChildren(node);\n }\n\n virtual void at(const Module* node)\n {\n std::string enclosed = prefixedName;\n prefixedName = node->getPrefixedName();\n at(static_cast<const Node*>(node));\n prefixedName = enclosed;\n }\n\n virtual void at(const ExceptDcl* node)\n {\n if (1 < node->getRank() || node->isLeaf() || !node->isDefinedIn(source))\n {\n return;\n }\n\n FILE* file = createFile(Java::getPackageName(prefixedName), node);\n if (!file)\n {\n return;\n }\n\n fprintf(file, \"\/\/ Generated by esidl %s.\\n\\n\", VERSION);\n fprintf(file, \"package %s;\\n\\n\", Java::getPackageName(prefixedName).c_str());\n\n JavaInterface javaInterface(source, file, indent);\n javaInterface.at(node);\n\n fclose(file);\n }\n\n virtual void at(const Interface* node)\n {\n if (1 < node->getRank() || node->isLeaf() || !node->isDefinedIn(source) ||\n (node->getAttr() & Interface::Supplemental))\n {\n return;\n }\n\n FILE* file = createFile(Java::getPackageName(prefixedName), node);\n if (!file)\n {\n return;\n }\n\n fprintf(file, \"\/\/ Generated by esidl %s.\\n\\n\", VERSION);\n fprintf(file, \"package %s;\\n\\n\", Java::getPackageName(prefixedName).c_str());\n\n JavaImport import(Java::getPackageName(prefixedName), file, indent);\n import.at(node);\n import.print();\n\n JavaInterface javaInterface(source, file, indent);\n javaInterface.at(node);\n\n fclose(file);\n }\n};\n\nvoid printJava(const char* source, const char* indent)\n{\n JavaVisitor visitor(source, indent);\n getSpecification()->accept(&visitor);\n}\n<commit_msg>(at(const ScopedName* node)) : Fix to follow typedef name.<commit_after>\/*\n * Copyright 2008, 2009 Google Inc.\n * Copyright 2007 Nintendo 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#include <sys\/stat.h>\n#include <sys\/types.h>\n#include <set>\n#include \"java.h\"\n\nnamespace\n{\n\nFILE* createFile(const std::string package, const Node* node)\n{\n std::string filename = package;\n\n size_t pos = 0;\n for (;;)\n {\n pos = filename.find('.', pos);\n if (pos == std::string::npos)\n {\n break;\n }\n filename[pos] = '\/';\n }\n\n filename += \"\/\" + node->getName() + \".java\";\n\n std::string dir;\n std::string path(filename);\n for (;;)\n {\n size_t slash = path.find(\"\/\");\n if (slash == std::string::npos)\n {\n break;\n }\n dir += path.substr(0, slash);\n path.erase(0, slash + 1);\n mkdir(dir.c_str(), 0777);\n dir += '\/';\n }\n\n printf(\"# %s in %s\\n\", node->getName().c_str(), filename.c_str());\n return fopen(filename.c_str(), \"w\");\n}\n\n} \/\/ namespace\n\nclass JavaInterface : public Java\n{\n \/\/ TODO: Move to Java\n void visitInterfaceElement(const Interface* interface, Node* element)\n {\n if (dynamic_cast<Interface*>(element))\n {\n \/\/ Do not process Constructor.\n return;\n }\n\n optionalStage = 0;\n do\n {\n optionalCount = 0;\n element->accept(this);\n ++optionalStage;\n } while (optionalStage <= optionalCount);\n }\n\npublic:\n JavaInterface(const char* source, FILE* file, const char* indent = \"es\") :\n Java(source, file, indent)\n {\n }\n\n virtual void at(const ExceptDcl* node)\n {\n writetab();\n if (node->getJavadoc().size())\n {\n write(\"%s\\n\", node->getJavadoc().c_str());\n writetab();\n }\n write(\"public class %s extends RuntimeException {\\n\", node->getName().c_str());\n \/\/ TODO(Shiki): Need a constructor.\n printChildren(node);\n writeln(\"}\");\n }\n\n virtual void at(const Interface* node)\n {\n assert(!(node->getAttr() & Interface::Supplemental) && !node->isLeaf());\n writetab();\n if (node->getJavadoc().size())\n {\n write(\"%s\\n\", node->getJavadoc().c_str());\n writetab();\n }\n\n std::string name = node->getQualifiedName();\n name = getInterfaceName(name);\n write(\"public interface %s\", name.substr(name.rfind(':') + 1).c_str());\n if (node->getExtends())\n {\n const char* separator = \" extends \";\n for (NodeList::iterator i = node->getExtends()->begin();\n i != node->getExtends()->end();\n ++i)\n {\n if ((*i)->getName() == Node::getBaseObjectName())\n {\n \/\/ Do not extend from 'Object'.\n continue;\n }\n write(separator);\n separator = \", \";\n (*i)->accept(this);\n }\n }\n write(\" {\\n\");\n\n for (NodeList::iterator i = node->begin(); i != node->end(); ++i)\n {\n visitInterfaceElement(node, *i);\n }\n\n \/\/ Expand mixins\n std::list<const Interface*> interfaceList;\n node->collectMixins(&interfaceList, node);\n for (std::list<const Interface*>::const_iterator i = interfaceList.begin();\n i != interfaceList.end();\n ++i)\n {\n if (*i == node)\n {\n continue;\n }\n writeln(\"\/\/ %s\", (*i)->getName().c_str());\n for (NodeList::iterator j = (*i)->begin(); j != (*i)->end(); ++j)\n {\n visitInterfaceElement(*i, *j);\n }\n }\n\n writeln(\"}\");\n }\n\n virtual void at(const BinaryExpr* node)\n {\n node->getLeft()->accept(this);\n write(\" %s \", node->getName().c_str());\n node->getRight()->accept(this);\n }\n\n virtual void at(const UnaryExpr* node)\n {\n write(\"%s\", node->getName().c_str());\n NodeList::iterator elem = node->begin();\n (*elem)->accept(this);\n }\n\n virtual void at(const GroupingExpression* node)\n {\n write(\"(\");\n NodeList::iterator elem = node->begin();\n (*elem)->accept(this);\n write(\")\");\n }\n\n virtual void at(const Literal* node)\n {\n write(\"%s\", node->getName().c_str());\n }\n\n virtual void at(const Member* node)\n {\n if (node->isTypedef(node->getParent()))\n {\n return;\n }\n\n writetab();\n write(\"public \");\n node->getSpec()->accept(this);\n write(\" %s;\\n\", node->getName().c_str());\n }\n\n virtual void at(const ArrayDcl* node)\n {\n assert(!node->isLeaf());\n if (node->isTypedef(node->getParent()))\n {\n return;\n }\n\n writetab();\n node->getSpec()->accept(this);\n write(\" %s\", node->getName().c_str());\n for (NodeList::iterator i = node->begin(); i != node->end(); ++i)\n {\n write(\"[\");\n (*i)->accept(this);\n write(\"]\");\n }\n if (node->isTypedef(node->getParent()))\n {\n write(\";\\n\");\n }\n }\n\n virtual void at(const ConstDcl* node)\n {\n writetab();\n if (node->getJavadoc().size())\n {\n write(\"%s\\n\", node->getJavadoc().c_str());\n writetab();\n }\n write(\"public static final \");\n node->getSpec()->accept(this);\n write(\" %s = \", node->getName().c_str());\n node->getExp()->accept(this);\n write(\";\\n\");\n }\n\n virtual void at(const Attribute* node)\n {\n writetab();\n if (node->getJavadoc().size())\n {\n write(\"%s\\n\", node->getJavadoc().c_str());\n writetab();\n }\n\n \/\/ getter\n Java::getter(node);\n write(\";\\n\");\n\n if (!node->isReadonly() || node->isPutForwards() || node->isReplaceable())\n {\n \/\/ setter\n writetab();\n Java::setter(node);\n write(\";\\n\");\n }\n }\n\n virtual void at(const OpDcl* node)\n {\n writetab();\n if (node->getJavadoc().size())\n {\n write(\"%s\\n\", node->getJavadoc().c_str());\n writetab();\n }\n Java::at(node);\n write(\";\\n\");\n }\n};\n\nclass JavaImport : public Visitor, public Formatter\n{\n std::string package;\n const Interface* current;\n bool printed;\n std::string prefixedName;\n std::set<std::string> importSet;\n\npublic:\n JavaImport(std::string package, FILE* file, const char* indent) :\n Formatter(file, indent),\n package(package),\n current(0)\n {\n }\n\n virtual void at(const Node* node)\n {\n visitChildren(node);\n }\n\n virtual void at(const ScopedName* node)\n {\n assert(current);\n\n if (node->isBaseObject())\n {\n return;\n }\n std::string name = node->getName();\n Node* resolved = node->search(current);\n if (resolved)\n {\n if (Module* module = dynamic_cast<Module*>(resolved->getParent()))\n {\n if (prefixedName != module->getPrefixedName())\n {\n importSet.insert(Java::getPackageName(module->getPrefixedName()) + \".\" + node->getIdentifier());\n }\n }\n }\n }\n\n virtual void at(const Interface* node)\n {\n if (current)\n {\n return;\n }\n current = node;\n if (Module* module = dynamic_cast<Module*>(node->getParent()))\n {\n prefixedName = module->getPrefixedName();\n }\n visitChildren(node->getExtends());\n visitChildren(node);\n \/\/ Expand mixins\n std::list<const Interface*> interfaceList;\n node->collectMixins(&interfaceList, node);\n for (std::list<const Interface*>::const_iterator i = interfaceList.begin();\n i != interfaceList.end();\n ++i)\n {\n if (*i == node)\n {\n continue;\n }\n visitChildren(*i);\n }\n }\n\n virtual void at(const Attribute* node)\n {\n node->getSpec()->accept(this);\n visitChildren(node->getGetRaises());\n if (!node->isReadonly() || node->isPutForwards() || node->isReplaceable())\n {\n visitChildren(node->getSetRaises());\n }\n }\n\n virtual void at(const OpDcl* node)\n {\n node->getSpec()->accept(this);\n visitChildren(node);\n visitChildren(node->getRaises());\n }\n\n virtual void at(const ParamDcl* node)\n {\n node->getSpec()->accept(this);\n }\n\n void print()\n {\n if (importSet.empty())\n {\n return;\n }\n for (std::set<std::string>::iterator i = importSet.begin();\n i != importSet.end();\n ++i)\n {\n write(\"import %s;\\n\", (*i).c_str());\n }\n write(\"\\n\");\n }\n};\n\nclass JavaVisitor : public Visitor\n{\n const char* source;\n const char* indent;\n\n std::string prefixedName;\n\npublic:\n JavaVisitor(const char* source, const char* indent = \"es\") :\n source(source),\n indent(indent)\n {\n }\n\n virtual void at(const Node* node)\n {\n if (1 < node->getRank())\n {\n return;\n }\n visitChildren(node);\n }\n\n virtual void at(const Module* node)\n {\n std::string enclosed = prefixedName;\n prefixedName = node->getPrefixedName();\n at(static_cast<const Node*>(node));\n prefixedName = enclosed;\n }\n\n virtual void at(const ExceptDcl* node)\n {\n if (1 < node->getRank() || node->isLeaf() || !node->isDefinedIn(source))\n {\n return;\n }\n\n FILE* file = createFile(Java::getPackageName(prefixedName), node);\n if (!file)\n {\n return;\n }\n\n fprintf(file, \"\/\/ Generated by esidl %s.\\n\\n\", VERSION);\n fprintf(file, \"package %s;\\n\\n\", Java::getPackageName(prefixedName).c_str());\n\n JavaInterface javaInterface(source, file, indent);\n javaInterface.at(node);\n\n fclose(file);\n }\n\n virtual void at(const Interface* node)\n {\n if (1 < node->getRank() || node->isLeaf() || !node->isDefinedIn(source) ||\n (node->getAttr() & Interface::Supplemental))\n {\n return;\n }\n\n FILE* file = createFile(Java::getPackageName(prefixedName), node);\n if (!file)\n {\n return;\n }\n\n fprintf(file, \"\/\/ Generated by esidl %s.\\n\\n\", VERSION);\n fprintf(file, \"package %s;\\n\\n\", Java::getPackageName(prefixedName).c_str());\n\n JavaImport import(Java::getPackageName(prefixedName), file, indent);\n import.at(node);\n import.print();\n\n JavaInterface javaInterface(source, file, indent);\n javaInterface.at(node);\n\n fclose(file);\n }\n};\n\nvoid printJava(const char* source, const char* indent)\n{\n JavaVisitor visitor(source, indent);\n getSpecification()->accept(&visitor);\n}\n<|endoftext|>"} {"text":"<commit_before>#include \"dialog.h\"\n\nDialog::Dialog(QWidget *parent) :\n QDialog(parent)\n{\n init();\n}\n\nDialog::~Dialog()\n{\n\n}\n\nvoid Dialog::shuffle_animated(){\n \/\/lock button\n btnRandomize->setDown(true);\n disconnect(btnRandomize,SIGNAL(clicked()),this,SLOT(shuffle_animated()));\n\n for(int i=0;i<animation_time;++i){\n shuffle();\n dieTime=QTime::currentTime().addMSecs(per_frame_ms);\n while( QTime::currentTime() < dieTime )\n QCoreApplication::processEvents(QEventLoop::AllEvents, per_frame_ms);\n }\n\n \/\/enable button\n btnRandomize->setDown(false);\n connect(btnRandomize,SIGNAL(clicked()),this,SLOT(shuffle_animated()));\n}\n\nvoid Dialog::shuffle(){\n \/\/shuffle\n srand(QTime::currentTime().msec());\n std::random_shuffle(male.begin(),male.end());\n std::random_shuffle(female.begin(),female.end());\n\n int male_iterator=0,female_iterator=0;\n for(int i=0;i<male_count+female_count;++i){\n if(seating_rule[i]==MALE) seating[i]->setText(male[male_iterator++]);\n else seating[i]->setText(female[female_iterator++]);\n }\n}\n\nvoid Dialog::init(){\n this->setWindowTitle(\"QTempatDuduk v1.4\");\n this->resize(1000,500);\n\n btnChangePeople=new QPushButton(tr(\"&People...\"),this);\n btnChangeRule=new QPushButton(tr(\"&Rule...\"),this);\n btnUpdate=new QPushButton(tr(\"&Update!\"),this);\n btnRandomize=new QPushButton(tr(\"&Shuffle!\"),this);\n btnExit=new QPushButton(tr(\"E&xit\"),this);\n\n mainLayout=new QVBoxLayout(this);\n buttonLayout=new QHBoxLayout(this);\n seatLayout=new QGridLayout(this);\n\n \/\/default files\n db_people_filename=\".\/people.txt\";\n db_rule_filename=\".\/seating.txt\";\n\n init_data();\n init_seat();\n\n buttonLayout->addWidget(btnChangePeople);\n buttonLayout->addWidget(btnChangeRule);\n buttonLayout->addWidget(btnUpdate);\n buttonLayout->addStretch();\n buttonLayout->addWidget(btnRandomize);\n buttonLayout->addWidget(btnExit);\n\n connect(btnChangePeople,SIGNAL(clicked()),this,SLOT(change_people()));\n connect(btnChangeRule,SIGNAL(clicked()),this,SLOT(change_rule()));\n connect(btnUpdate,SIGNAL(clicked()),this,SLOT(update()));\n connect(btnExit,SIGNAL(clicked()),this,SLOT(accept()));\n connect(btnRandomize,SIGNAL(clicked()),this,SLOT(shuffle_animated()));\n\n\n mainLayout->addLayout(seatLayout);\n mainLayout->addLayout(buttonLayout);\n this->setLayout(mainLayout);\n}\n\nvoid Dialog::init_seat(){\n QBrush fontBrush(QColor(FONTCOLOR));\n fontBrush.setStyle(Qt::SolidPattern);\n\n QBrush seatBrush(QColor(SEATCOLOR));\n seatBrush.setStyle(Qt::SolidPattern);\n\n palette.setBrush(QPalette::Active, QPalette::WindowText, fontBrush);\n palette.setBrush(QPalette::Inactive, QPalette::WindowText, fontBrush);\n\n palette.setBrush(QPalette::Active, QPalette::Window, seatBrush);\n palette.setBrush(QPalette::Inactive, QPalette::Window, seatBrush);\n\n font.setPointSize(FONTSIZE);\n font.setBold(true);\n font.setFamily(FONTFAMILY);\n\n for(int i=0;i<rule_row;++i){\n for(int j=0;j<rule_column;++j){\n if(rule[i][j]=='.') seatLayout->addItem(new QSpacerItem(SPACERSIZE),i,j);\n else{\n init_seat_aux();\n seatLayout->addWidget(seat,i,j);\n seating.push_back(seat);\n seating_rule.push_back((rule[i][j]=='m'? MALE : FEMALE));\n }\n }\n }\n\n}\n\nvoid Dialog::init_seat_aux(){\n seat=new QLabel(\"-\",this);\n seat->setPalette(palette);\n seat->setFont(font);\n seat->setAutoFillBackground(true);\n seat->setAlignment(Qt::AlignCenter);\n seat->setMinimumSize(SEATMINIMUMSIZE);\n}\n\nvoid Dialog::init_data(){\n \/\/get data\n QString s;\n QFile db_people(db_people_filename),db_rule(db_rule_filename);\n if(!db_people.open(QIODevice::ReadOnly)) {\n QMessageBox::information(0, tr(\"Error\"), db_people.errorString());\n }\n if(!db_rule.open(QIODevice::ReadOnly)) {\n QMessageBox::information(0, tr(\"Error\"), db_rule.errorString());\n }\n\n QTextStream in_people(&db_people),in_rule(&db_rule);\n\n in_people>>male_count;\n in_people.readLine(); \/\/clearing\n for(int i=0;i<male_count;++i){\n s = in_people.readLine();\n if(s.size())male.push_back(s);\n }\n\n in_people>>female_count;\n in_people.readLine();\n for(int i=0;i<female_count;++i) {\n s = in_people.readLine();\n if(s.size())female.push_back(s);\n }\n db_people.close();\n\n in_rule>>rule_male>>rule_female;\n if(rule_male!=male_count || rule_female!=female_count)\n QMessageBox::information(0, tr(\"Error\"), tr(\"Mismatch number of person\"));\n\n in_rule>>rule_row>>rule_column;\n for(int i=0;i<rule_row;++i){\n in_rule>>s;\n rule.push_back(s);\n }\n db_rule.close();\n\n}\n\nvoid Dialog::change_people(){\n db_people_filename=\n QFileDialog::getOpenFileName(this,\n tr(\"Select file...\"),\n QDir::homePath(),\n tr(\"Text files (*.txt)\"));\n}\n\nvoid Dialog::change_rule(){\n db_rule_filename=\n QFileDialog::getOpenFileName(this,\n tr(\"Select file...\"),\n QDir::homePath(),\n tr(\"Text files (*.txt)\"));\n\n}\n\nvoid Dialog::update(){\n \/\/empty all\n male.clear();\n female.clear();\n seating_rule.clear();\n for(int i=0;i<rule_row;++i)\n for(int j=0;j<rule_column;++j)\n seatLayout->removeItem(seatLayout->itemAtPosition(i,j));\n for(int i=0;i<seating.size();++i)\n delete seating[i];\n seating.clear();\n rule.clear();\n\n \/\/redo\n init_data();\n init_seat();\n\n}\n<commit_msg>Fixed #2<commit_after>#include \"dialog.h\"\n\nDialog::Dialog(QWidget *parent) :\n QDialog(parent)\n{\n init();\n}\n\nDialog::~Dialog()\n{\n\n}\n\nvoid Dialog::shuffle_animated(){\n \/\/lock button\n btnRandomize->setDown(true);\n disconnect(btnRandomize,SIGNAL(clicked()),this,SLOT(shuffle_animated()));\n\n for(int i=0;i<animation_time;++i){\n shuffle();\n dieTime=QTime::currentTime().addMSecs(per_frame_ms);\n while( QTime::currentTime() < dieTime )\n QCoreApplication::processEvents(QEventLoop::AllEvents, per_frame_ms);\n }\n\n \/\/enable button\n btnRandomize->setDown(false);\n connect(btnRandomize,SIGNAL(clicked()),this,SLOT(shuffle_animated()));\n}\n\nvoid Dialog::shuffle(){\n \/\/shuffle\n srand(QTime::currentTime().msec());\n std::random_shuffle(male.begin(),male.end());\n std::random_shuffle(female.begin(),female.end());\n\n int male_iterator=0,female_iterator=0;\n for(int i=0;i<male_count+female_count;++i){\n if(seating_rule[i]==MALE) seating[i]->setText(male[male_iterator++]);\n else seating[i]->setText(female[female_iterator++]);\n }\n}\n\nvoid Dialog::init(){\n this->setWindowTitle(\"QTempatDuduk v1.4\");\n this->resize(1000,500);\n\n btnChangePeople=new QPushButton(tr(\"&People...\"),this);\n btnChangeRule=new QPushButton(tr(\"&Rule...\"),this);\n btnUpdate=new QPushButton(tr(\"&Update!\"),this);\n btnRandomize=new QPushButton(tr(\"&Shuffle!\"),this);\n btnExit=new QPushButton(tr(\"E&xit\"),this);\n\n mainLayout=new QVBoxLayout(this);\n buttonLayout=new QHBoxLayout(this);\n seatLayout=new QGridLayout(this);\n\n \/\/default files\n db_people_filename=\".\/people.txt\";\n db_rule_filename=\".\/seating.txt\";\n\n init_data();\n init_seat();\n\n buttonLayout->addWidget(btnChangePeople);\n buttonLayout->addWidget(btnChangeRule);\n buttonLayout->addWidget(btnUpdate);\n buttonLayout->addStretch();\n buttonLayout->addWidget(btnRandomize);\n buttonLayout->addWidget(btnExit);\n\n connect(btnChangePeople,SIGNAL(clicked()),this,SLOT(change_people()));\n connect(btnChangeRule,SIGNAL(clicked()),this,SLOT(change_rule()));\n connect(btnUpdate,SIGNAL(clicked()),this,SLOT(update()));\n connect(btnExit,SIGNAL(clicked()),this,SLOT(accept()));\n connect(btnRandomize,SIGNAL(clicked()),this,SLOT(shuffle_animated()));\n\n\n mainLayout->addLayout(seatLayout);\n mainLayout->addLayout(buttonLayout);\n this->setLayout(mainLayout);\n}\n\nvoid Dialog::init_seat(){\n QBrush fontBrush(QColor(FONTCOLOR));\n fontBrush.setStyle(Qt::SolidPattern);\n\n QBrush seatBrush(QColor(SEATCOLOR));\n seatBrush.setStyle(Qt::SolidPattern);\n\n palette.setBrush(QPalette::Active, QPalette::WindowText, fontBrush);\n palette.setBrush(QPalette::Inactive, QPalette::WindowText, fontBrush);\n\n palette.setBrush(QPalette::Active, QPalette::Window, seatBrush);\n palette.setBrush(QPalette::Inactive, QPalette::Window, seatBrush);\n\n font.setPointSize(FONTSIZE);\n font.setBold(true);\n font.setFamily(FONTFAMILY);\n\n for(int i=0;i<rule_row;++i){\n for(int j=0;j<rule_column;++j){\n if(rule[i][j]=='.') seatLayout->addItem(new QSpacerItem(SPACERSIZE),i,j);\n else{\n init_seat_aux();\n seatLayout->addWidget(seat,i,j);\n seating.push_back(seat);\n seating_rule.push_back((rule[i][j]=='m'? MALE : FEMALE));\n }\n }\n }\n\n}\n\nvoid Dialog::init_seat_aux(){\n seat=new QLabel(\"-\",this);\n seat->setPalette(palette);\n seat->setFont(font);\n seat->setAutoFillBackground(true);\n seat->setAlignment(Qt::AlignCenter);\n seat->setMinimumSize(SEATMINIMUMSIZE);\n}\n\nvoid Dialog::init_data(){\n \/\/get data\n QString s;\n QFile db_people(db_people_filename),db_rule(db_rule_filename);\n if(!db_people.open(QIODevice::ReadOnly)) {\n QMessageBox::information(0, tr(\"Error\"), db_people.errorString());\n }\n if(!db_rule.open(QIODevice::ReadOnly)) {\n QMessageBox::information(0, tr(\"Error\"), db_rule.errorString());\n }\n\n QTextStream in_people(&db_people),in_rule(&db_rule);\n\n in_people>>male_count;\n in_people.readLine(); \/\/clearing\n for(int i=0;i<male_count;++i){\n s = in_people.readLine();\n if(s.size())male.push_back(s);\n }\n\n in_people>>female_count;\n in_people.readLine();\n for(int i=0;i<female_count;++i) {\n s = in_people.readLine();\n if(s.size())female.push_back(s);\n }\n db_people.close();\n\n in_rule>>rule_male>>rule_female;\n if(rule_male!=male_count || rule_female!=female_count)\n QMessageBox::information(0, tr(\"Error\"), tr(\"Mismatch number of person\"));\n\n in_rule>>rule_row>>rule_column;\n for(int i=0;i<rule_row;++i){\n in_rule>>s;\n rule.push_back(s);\n }\n db_rule.close();\n\n}\n\nvoid Dialog::change_people(){\n db_people_filename=\n QFileDialog::getOpenFileName(this,\n tr(\"Select file...\"),\n QDir::homePath(),\n tr(\"Text files (*.txt)\"));\n if(!QFile(db_people_filename).exists()){\n QMessageBox::information(0, tr(\"Error\"), \"File not found\");\n db_people_filename=\".\/people.txt\";\n }\n}\n\nvoid Dialog::change_rule(){\n db_rule_filename=\n QFileDialog::getOpenFileName(this,\n tr(\"Select file...\"),\n QDir::homePath(),\n tr(\"Text files (*.txt)\"));\n if(!QFile(db_rule_filename).exists()){\n QMessageBox::information(0, tr(\"Error\"), \"File not found\");\n db_rule_filename=\".\/seating.txt\";\n }\n}\n\nvoid Dialog::update(){\n \/\/empty all\n male.clear();\n female.clear();\n seating_rule.clear();\n for(int i=0;i<rule_row;++i)\n for(int j=0;j<rule_column;++j)\n seatLayout->removeItem(seatLayout->itemAtPosition(i,j));\n for(int i=0;i<seating.size();++i)\n delete seating[i];\n seating.clear();\n rule.clear();\n\n \/\/redo\n init_data();\n init_seat();\n\n}\n<|endoftext|>"} {"text":"<commit_before>#include \"dbreader.h\"\n\n#define DEBUG if (0) qDebug() << __PRETTY_FUNCTION__\n\nDbReader::DbReader(QObject *parent)\n : QObject(parent), m_stop(false)\n{\n qRegisterMetaType<QList<QSqlRecord> >();\n qRegisterMetaType<QSqlDatabase>();\n qRegisterMetaType<QSqlQuery>();\n qRegisterMetaType<DbReader *>();\n qRegisterMetaType<void *>();\n}\n\nDbReader::~DbReader()\n{\n QSqlDatabase::removeDatabase(m_db.connectionName());\n}\n\nvoid DbReader::stop() \n{\n m_stop = true;\n}\n\nvoid DbReader::initialize(const QSqlDatabase &db)\n{\n m_db = QSqlDatabase::cloneDatabase(db, QUuid::createUuid().toString());\n if (!m_db.open())\n qFatal(\"Erorr opening database: %s\", qPrintable(m_db.lastError().text()));\n}\n\nvoid DbReader::execute(const QSqlQuery &q, void *userData)\n{\n QSqlQuery query(q);\n query.setForwardOnly(true);\n query.exec();\n\n QList<QSqlRecord> data = readRecords(query);\n DEBUG << \"Read \" << data.count() << \"records\";\n\n if (!m_stop)\n emit dataReady(this, data, userData);\n}\n\nQList<QSqlRecord> DbReader::readRecords(QSqlQuery &query)\n{\n QList<QSqlRecord> data;\n while (query.next() && !m_stop) {\n data.append(query.record());\n }\n return data;\n}\n\n<commit_msg>Print error when exec fails<commit_after>#include \"dbreader.h\"\n\n#define DEBUG if (0) qDebug() << __PRETTY_FUNCTION__\n\nDbReader::DbReader(QObject *parent)\n : QObject(parent), m_stop(false)\n{\n qRegisterMetaType<QList<QSqlRecord> >();\n qRegisterMetaType<QSqlDatabase>();\n qRegisterMetaType<QSqlQuery>();\n qRegisterMetaType<DbReader *>();\n qRegisterMetaType<void *>();\n}\n\nDbReader::~DbReader()\n{\n QSqlDatabase::removeDatabase(m_db.connectionName());\n}\n\nvoid DbReader::stop() \n{\n m_stop = true;\n}\n\nvoid DbReader::initialize(const QSqlDatabase &db)\n{\n m_db = QSqlDatabase::cloneDatabase(db, QUuid::createUuid().toString());\n if (!m_db.open())\n qFatal(\"Erorr opening database: %s\", qPrintable(m_db.lastError().text()));\n}\n\nvoid DbReader::execute(const QSqlQuery &q, void *userData)\n{\n QSqlQuery query(q);\n query.setForwardOnly(true);\n if (!query.exec())\n qFatal(\"Error executing query: %s\", qPrintable(query.lastQuery()));\n\n QList<QSqlRecord> data = readRecords(query);\n DEBUG << \"Read \" << data.count() << \"records\";\n\n if (!m_stop)\n emit dataReady(this, data, userData);\n}\n\nQList<QSqlRecord> DbReader::readRecords(QSqlQuery &query)\n{\n QList<QSqlRecord> data;\n while (query.next() && !m_stop) {\n data.append(query.record());\n }\n return data;\n}\n\n<|endoftext|>"} {"text":"<commit_before>\/** \\copyright\n * Copyright (c) 2014, Balazs Racz\n * All rights reserved.\n *\n * Redistribution and use in source and binary forms, with or without\n * modification, are permitted provided that the following conditions are met:\n *\n * - Redistributions of source code must retain the above copyright notice,\n * this list of conditions and the following disclaimer.\n *\n * - Redistributions in binary form must reproduce the above copyright notice,\n * this list of conditions and the following disclaimer in the documentation\n * and\/or other materials provided with the distribution.\n *\n * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS \"AS IS\"\n * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE\n * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE\n * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE\n * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR\n * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF\n * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS\n * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN\n * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)\n * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE\n * POSSIBILITY OF SUCH DAMAGE.\n *\n * \\file dcc\/Defs.hxx\n *\n * Definitions for DCC concepts.\n *\n * @author Balazs Racz\n * @date 27 Feb 2016\n *\/\n\n#ifndef _DCC_DEFS_HXX_\n#define _DCC_DEFS_HXX_\n\nnamespace dcc {\n\n\/\/\/ Which address type this legacy train node uses. These address types\n\/\/\/ translate to mutually independent packets on the track.\nenum class TrainAddressType\n{\n \/\/\/ DCC packets with short address (1..127)\n DCC_SHORT_ADDRESS = 1,\n \/\/\/ DCC packets with long address (128..~10000)\n DCC_LONG_ADDRESS,\n \/\/\/ Marklin-motorola packets. Addresses 1..80 are supported.\n MM,\n \/\/\/ Unsupported address type (e.g. a protocol we don't have an\n \/\/\/ implementation for).\n UNSUPPORTED = 255,\n \/\/\/ Unspecified address type (default \/ match any).\n UNSPECIFIED = 254,\n};\n\n} \/\/ namespace dcc\n\n#endif\n<commit_msg>Makes TrainAddressType fit into a uint8.<commit_after>\/** \\copyright\n * Copyright (c) 2014, Balazs Racz\n * All rights reserved.\n *\n * Redistribution and use in source and binary forms, with or without\n * modification, are permitted provided that the following conditions are met:\n *\n * - Redistributions of source code must retain the above copyright notice,\n * this list of conditions and the following disclaimer.\n *\n * - Redistributions in binary form must reproduce the above copyright notice,\n * this list of conditions and the following disclaimer in the documentation\n * and\/or other materials provided with the distribution.\n *\n * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS \"AS IS\"\n * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE\n * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE\n * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE\n * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR\n * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF\n * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS\n * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN\n * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)\n * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE\n * POSSIBILITY OF SUCH DAMAGE.\n *\n * \\file dcc\/Defs.hxx\n *\n * Definitions for DCC concepts.\n *\n * @author Balazs Racz\n * @date 27 Feb 2016\n *\/\n\n#ifndef _DCC_DEFS_HXX_\n#define _DCC_DEFS_HXX_\n\nnamespace dcc {\n\n\/\/\/ Which address type this legacy train node uses. These address types\n\/\/\/ translate to mutually independent packets on the track.\nenum class TrainAddressType : uint8_t\n{\n \/\/\/ DCC packets with short address (1..127)\n DCC_SHORT_ADDRESS = 1,\n \/\/\/ DCC packets with long address (128..~10000)\n DCC_LONG_ADDRESS,\n \/\/\/ Marklin-motorola packets. Addresses 1..80 are supported.\n MM,\n \/\/\/ Unsupported address type (e.g. a protocol we don't have an\n \/\/\/ implementation for).\n UNSUPPORTED = 255,\n \/\/\/ Unspecified address type (default \/ match any).\n UNSPECIFIED = 254,\n};\n\n} \/\/ namespace dcc\n\n#endif\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 \"SkFlags.h\"\n\nSkFlagInfo* SkFlags::gHead;\nSkString SkFlags::gUsage;\n\nvoid SkFlags::SetUsage(const char* usage) {\n gUsage.set(usage);\n}\n\n\/\/ Maximum line length for the help message.\n#define LINE_LENGTH 80\n\nstatic void print_help_for_flag(const SkFlagInfo* flag) {\n SkDebugf(\"\\t--%s\", flag->name().c_str());\n const SkString& shortName = flag->shortName();\n if (shortName.size() > 0) {\n SkDebugf(\" or -%s\", shortName.c_str());\n }\n SkDebugf(\":\\ttype: %s\", flag->typeAsString().c_str());\n if (flag->defaultValue().size() > 0) {\n SkDebugf(\"\\tdefault: %s\", flag->defaultValue().c_str());\n }\n SkDebugf(\"\\n\");\n const SkString& help = flag->help();\n size_t length = help.size();\n const char* currLine = help.c_str();\n const char* stop = currLine + length;\n while (currLine < stop) {\n if (strlen(currLine) < LINE_LENGTH) {\n \/\/ Only one line length's worth of text left.\n SkDebugf(\"\\t\\t%s\\n\", currLine);\n break;\n }\n int lineBreak = SkStrFind(currLine, \"\\n\");\n if (lineBreak < 0 || lineBreak > LINE_LENGTH) {\n \/\/ No line break within line length. Will need to insert one.\n \/\/ Find a space before the line break.\n int spaceIndex = LINE_LENGTH - 1;\n while (spaceIndex > 0 && currLine[spaceIndex] != ' ') {\n spaceIndex--;\n }\n int gap;\n if (0 == spaceIndex) {\n \/\/ No spaces on the entire line. Go ahead and break mid word.\n spaceIndex = LINE_LENGTH;\n gap = 0;\n } else {\n \/\/ Skip the space on the next line\n gap = 1;\n }\n SkDebugf(\"\\t\\t%.*s\\n\", spaceIndex, currLine);\n currLine += spaceIndex + gap;\n } else {\n \/\/ the line break is within the limit. Break there.\n lineBreak++;\n SkDebugf(\"\\t\\t%.*s\", lineBreak, currLine);\n currLine += lineBreak;\n }\n }\n SkDebugf(\"\\n\");\n}\n\nvoid SkFlags::ParseCommandLine(int argc, char** argv) {\n \/\/ Only allow calling this function once.\n static bool gOnce;\n if (gOnce) {\n SkDebugf(\"ParseCommandLine should only be called once at the beginning\"\n \" of main!\\n\");\n SkASSERT(false);\n return;\n }\n gOnce = true;\n\n bool helpPrinted = false;\n \/\/ Loop over argv, starting with 1, since the first is just the name of the program.\n for (int i = 1; i < argc; i++) {\n if (0 == strcmp(\"-h\", argv[i]) || 0 == strcmp(\"--h\", argv[i])\n || 0 == strcmp(\"-help\", argv[i]) || 0 == strcmp(\"--help\", argv[i])) {\n \/\/ Print help message.\n SkTDArray<const char*> helpFlags;\n for (int j = i + 1; j < argc; j++) {\n if (SkStrStartsWith(argv[j], '-')) {\n break;\n }\n helpFlags.append(1, &argv[j]);\n }\n if (0 == helpFlags.count()) {\n \/\/ Only print general help message if help for specific flags is not requested.\n SkDebugf(\"%s\\n%s\\n\", argv[0], gUsage.c_str());\n }\n SkDebugf(\"Flags:\\n\");\n SkFlagInfo* flag = SkFlags::gHead;\n while (flag != NULL) {\n \/\/ If no flags followed --help, print them all\n bool printFlag = 0 == helpFlags.count();\n if (!printFlag) {\n for (int k = 0; k < helpFlags.count(); k++) {\n if (flag->name().equals(helpFlags[k]) ||\n flag->shortName().equals(helpFlags[k])) {\n printFlag = true;\n helpFlags.remove(k);\n break;\n }\n }\n }\n if (printFlag) {\n print_help_for_flag(flag);\n }\n flag = flag->next();\n }\n if (helpFlags.count() > 0) {\n SkDebugf(\"Requested help for unrecognized flags:\\n\");\n for (int k = 0; k < helpFlags.count(); k++) {\n SkDebugf(\"\\t--%s\\n\", helpFlags[k]);\n }\n }\n helpPrinted = true;\n }\n if (!helpPrinted) {\n bool flagMatched = false;\n SkFlagInfo* flag = gHead;\n while (flag != NULL) {\n if (flag->match(argv[i])) {\n flagMatched = true;\n switch (flag->getFlagType()) {\n case SkFlagInfo::kBool_FlagType:\n \/\/ Handled by match, above\n break;\n case SkFlagInfo::kString_FlagType:\n flag->resetStrings();\n \/\/ Add all arguments until another flag is reached.\n while (i+1 < argc && !SkStrStartsWith(argv[i+1], '-')) {\n i++;\n flag->append(argv[i]);\n }\n break;\n case SkFlagInfo::kInt_FlagType:\n i++;\n flag->setInt(atoi(argv[i]));\n break;\n case SkFlagInfo::kDouble_FlagType:\n i++;\n flag->setDouble(atof(argv[i]));\n break;\n default:\n SkASSERT(!\"Invalid flag type\");\n }\n break;\n }\n flag = flag->next();\n }\n if (!flagMatched) {\n SkDebugf(\"skipping unknown flag %s\\n\", argv[i]);\n }\n }\n }\n \/\/ Since all of the flags have been set, release the memory used by each\n \/\/ flag. FLAGS_x can still be used after this.\n SkFlagInfo* flag = gHead;\n gHead = NULL;\n while (flag != NULL) {\n SkFlagInfo* next = flag->next();\n SkDELETE(flag);\n flag = next;\n }\n if (helpPrinted) {\n exit(0);\n }\n}\n<commit_msg>When SkFlags encounters an invalid flag, quit.<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 \"SkFlags.h\"\n\nSkFlagInfo* SkFlags::gHead;\nSkString SkFlags::gUsage;\n\nvoid SkFlags::SetUsage(const char* usage) {\n gUsage.set(usage);\n}\n\n\/\/ Maximum line length for the help message.\n#define LINE_LENGTH 80\n\nstatic void print_help_for_flag(const SkFlagInfo* flag) {\n SkDebugf(\"\\t--%s\", flag->name().c_str());\n const SkString& shortName = flag->shortName();\n if (shortName.size() > 0) {\n SkDebugf(\" or -%s\", shortName.c_str());\n }\n SkDebugf(\":\\ttype: %s\", flag->typeAsString().c_str());\n if (flag->defaultValue().size() > 0) {\n SkDebugf(\"\\tdefault: %s\", flag->defaultValue().c_str());\n }\n SkDebugf(\"\\n\");\n const SkString& help = flag->help();\n size_t length = help.size();\n const char* currLine = help.c_str();\n const char* stop = currLine + length;\n while (currLine < stop) {\n if (strlen(currLine) < LINE_LENGTH) {\n \/\/ Only one line length's worth of text left.\n SkDebugf(\"\\t\\t%s\\n\", currLine);\n break;\n }\n int lineBreak = SkStrFind(currLine, \"\\n\");\n if (lineBreak < 0 || lineBreak > LINE_LENGTH) {\n \/\/ No line break within line length. Will need to insert one.\n \/\/ Find a space before the line break.\n int spaceIndex = LINE_LENGTH - 1;\n while (spaceIndex > 0 && currLine[spaceIndex] != ' ') {\n spaceIndex--;\n }\n int gap;\n if (0 == spaceIndex) {\n \/\/ No spaces on the entire line. Go ahead and break mid word.\n spaceIndex = LINE_LENGTH;\n gap = 0;\n } else {\n \/\/ Skip the space on the next line\n gap = 1;\n }\n SkDebugf(\"\\t\\t%.*s\\n\", spaceIndex, currLine);\n currLine += spaceIndex + gap;\n } else {\n \/\/ the line break is within the limit. Break there.\n lineBreak++;\n SkDebugf(\"\\t\\t%.*s\", lineBreak, currLine);\n currLine += lineBreak;\n }\n }\n SkDebugf(\"\\n\");\n}\n\nvoid SkFlags::ParseCommandLine(int argc, char** argv) {\n \/\/ Only allow calling this function once.\n static bool gOnce;\n if (gOnce) {\n SkDebugf(\"ParseCommandLine should only be called once at the beginning\"\n \" of main!\\n\");\n SkASSERT(false);\n return;\n }\n gOnce = true;\n\n bool helpPrinted = false;\n \/\/ Loop over argv, starting with 1, since the first is just the name of the program.\n for (int i = 1; i < argc; i++) {\n if (0 == strcmp(\"-h\", argv[i]) || 0 == strcmp(\"--h\", argv[i])\n || 0 == strcmp(\"-help\", argv[i]) || 0 == strcmp(\"--help\", argv[i])) {\n \/\/ Print help message.\n SkTDArray<const char*> helpFlags;\n for (int j = i + 1; j < argc; j++) {\n if (SkStrStartsWith(argv[j], '-')) {\n break;\n }\n helpFlags.append(1, &argv[j]);\n }\n if (0 == helpFlags.count()) {\n \/\/ Only print general help message if help for specific flags is not requested.\n SkDebugf(\"%s\\n%s\\n\", argv[0], gUsage.c_str());\n }\n SkDebugf(\"Flags:\\n\");\n SkFlagInfo* flag = SkFlags::gHead;\n while (flag != NULL) {\n \/\/ If no flags followed --help, print them all\n bool printFlag = 0 == helpFlags.count();\n if (!printFlag) {\n for (int k = 0; k < helpFlags.count(); k++) {\n if (flag->name().equals(helpFlags[k]) ||\n flag->shortName().equals(helpFlags[k])) {\n printFlag = true;\n helpFlags.remove(k);\n break;\n }\n }\n }\n if (printFlag) {\n print_help_for_flag(flag);\n }\n flag = flag->next();\n }\n if (helpFlags.count() > 0) {\n SkDebugf(\"Requested help for unrecognized flags:\\n\");\n for (int k = 0; k < helpFlags.count(); k++) {\n SkDebugf(\"\\t--%s\\n\", helpFlags[k]);\n }\n }\n helpPrinted = true;\n }\n if (!helpPrinted) {\n bool flagMatched = false;\n SkFlagInfo* flag = gHead;\n while (flag != NULL) {\n if (flag->match(argv[i])) {\n flagMatched = true;\n switch (flag->getFlagType()) {\n case SkFlagInfo::kBool_FlagType:\n \/\/ Handled by match, above\n break;\n case SkFlagInfo::kString_FlagType:\n flag->resetStrings();\n \/\/ Add all arguments until another flag is reached.\n while (i+1 < argc && !SkStrStartsWith(argv[i+1], '-')) {\n i++;\n flag->append(argv[i]);\n }\n break;\n case SkFlagInfo::kInt_FlagType:\n i++;\n flag->setInt(atoi(argv[i]));\n break;\n case SkFlagInfo::kDouble_FlagType:\n i++;\n flag->setDouble(atof(argv[i]));\n break;\n default:\n SkASSERT(!\"Invalid flag type\");\n }\n break;\n }\n flag = flag->next();\n }\n if (!flagMatched) {\n SkDebugf(\"Got unknown flag \\\"%s\\\". Exiting.\\n\", argv[i]);\n exit(-1);\n }\n }\n }\n \/\/ Since all of the flags have been set, release the memory used by each\n \/\/ flag. FLAGS_x can still be used after this.\n SkFlagInfo* flag = gHead;\n gHead = NULL;\n while (flag != NULL) {\n SkFlagInfo* next = flag->next();\n SkDELETE(flag);\n flag = next;\n }\n if (helpPrinted) {\n exit(0);\n }\n}\n<|endoftext|>"} {"text":"<commit_before>#ifndef V_SMC_INTERNAL_COMMON_HPP\n#define V_SMC_INTERNAL_COMMON_HPP\n\n#ifndef __STDC_CONSTANT_MACROS\n#define __STDC_CONSTANT_MACROS\n#endif \/\/ __STDC_CONSTANT_MACROS\n\n#include <cassert>\n#include <cmath>\n#include <cstddef>\n#include <cstdlib>\n#include <utility>\n#include <map>\n#include <set>\n#include <deque>\n#include <vector>\n#include <iostream>\n#include <sstream>\n#include <string>\n#include <stdexcept>\n\n#ifdef __INTEL_COMPILER\n\/\/ #pragma warning(push)\n#pragma warning(disable:2196)\n#pragma warning(disable:2536)\n#endif \/\/ __INTEL_COMPILER\n\n#ifdef __clang__\n#pragma clang diagnostic push\n#pragma clang diagnostic ignored \"-Wall\"\n#pragma clang diagnostic ignored \"-Wunique-enum\"\n#endif \/\/ __clang__\n\n#include <Eigen\/Dense>\n\n#ifdef __INTEL_COMPILER\n\/\/ #pragma warning(pop)\n#endif \/\/ __INTEL_COMPILER\n\n#ifdef __clang__\n#pragma clang diagnostic pop\n#endif \/\/ __clang__\n\n#include <vSMC\/internal\/config.hpp>\n#include <vSMC\/internal\/version.hpp>\n#include <vSMC\/internal\/function.hpp>\n#include <vSMC\/internal\/type_traits.hpp>\n#include <vSMC\/rng\/random.hpp>\n\n#ifndef V_SMC_INDEX_TYPE\n#define V_SMC_INDEX_TYPE EIGEN_DEFAULT_DENSE_INDEX_TYPE\n#endif \/\/ V_SMC_INDEX_TYPE\n\nnamespace vSMC {\n\ntemplate <typename T> class Sampler;\ntemplate <typename T> class Particle;\ntemplate <typename T> class Monitor;\ntemplate <typename T> class Path;\n\ntemplate <typename T> class SingleParticle;\ntemplate <typename T> class ConstSingleParticle;\ntemplate <unsigned Dim, typename T> class StateBase;\n\ntemplate <typename T> class InitializeSeq;\ntemplate <typename T> class MoveSeq;\ntemplate <typename T, unsigned Dim> class MonitorSeq;\ntemplate <typename T> class PathSeq;\n\ntemplate <typename T> class InitializeTBB;\ntemplate <typename T> class MoveTBB;\ntemplate <typename T, unsigned Dim> class MonitorTBB;\ntemplate <typename T> class PathTBB;\n\ntemplate <unsigned Dim, typename T> class StateCL;\ntemplate <typename T> class InitializeCL;\ntemplate <typename T> class MoveCL;\ntemplate <typename T, unsigned Dim> class MonitorCL;\ntemplate <typename T> class PathCL;\n\nclass StateBaseTrait\n{\n public :\n\n virtual ~StateBaseTrait () {}\n};\n\n\nclass StateSeqTrait\n{\n public :\n\n virtual ~StateSeqTrait () {}\n};\n\nclass InitializeSeqTrait\n{\n public :\n\n virtual ~InitializeSeqTrait () {}\n};\n\nclass MoveSeqTrait\n{\n public :\n\n virtual ~MoveSeqTrait () {}\n};\n\nclass MonitorSeqTrait\n{\n public :\n\n virtual ~MonitorSeqTrait () {}\n};\n\nclass PathSeqTrait\n{\n public :\n\n virtual ~PathSeqTrait () {}\n};\n\nclass StateTBBTrait\n{\n public :\n\n virtual ~StateTBBTrait () {}\n\n virtual void pre_resampling () = 0;\n virtual void post_resampling () = 0;\n};\n\nclass InitializeTBBTrait\n{\n public :\n\n virtual ~InitializeTBBTrait () {}\n};\n\nclass MoveTBBTrait\n{\n public :\n\n virtual ~MoveTBBTrait () {}\n};\n\nclass MonitorTBBTrait\n{\n public :\n\n virtual ~MonitorTBBTrait () {}\n};\n\nclass PathTBBTrait\n{\n public :\n\n virtual ~PathTBBTrait () {}\n};\n\nclass StateCLTrait\n{\n public :\n\n virtual ~StateCLTrait () {}\n\n virtual void pre_resampling () = 0;\n virtual void post_resampling () = 0;\n};\n\nclass InitializeCLTrait\n{\n public :\n\n virtual ~InitializeCLTrait () {}\n};\n\nclass MoveCLTrait\n{\n public :\n\n virtual ~MoveCLTrait () {}\n};\n\nclass MonitorCLTrait\n{\n public :\n\n virtual ~MonitorCLTrait () {}\n};\n\nclass PathCLTrait\n{\n public :\n\n virtual ~PathCLTrait () {}\n};\n\n\/\/\/ \\brief Resample scheme\n\/\/\/ \\ingroup Core\nenum ResampleScheme {\n MULTINOMIAL, \/\/\/< Multinomial resampling\n RESIDUAL, \/\/\/< Reisudal resampling\n STRATIFIED, \/\/\/< Startified resampling\n SYSTEMATIC, \/\/\/< Systematic resampling\n RESIDUAL_STRATIFIED, \/\/\/< Stratified resampling on the residuals\n RESIDUAL_SYSTEMATIC \/\/\/< Systematic resampling on the residuals\n}; \/\/ enum ResamleScheme\n\n} \/\/ namespace vSMC\n\n#endif \/\/ V_SMC_INTERNAL_COMMON_HPP\n<commit_msg>cleanup<commit_after>#ifndef V_SMC_INTERNAL_COMMON_HPP\n#define V_SMC_INTERNAL_COMMON_HPP\n\n#ifndef __STDC_CONSTANT_MACROS\n#define __STDC_CONSTANT_MACROS\n#endif \/\/ __STDC_CONSTANT_MACROS\n\n#include <cassert>\n#include <cmath>\n#include <cstddef>\n#include <cstdlib>\n#include <utility>\n#include <map>\n#include <set>\n#include <deque>\n#include <vector>\n#include <iostream>\n#include <sstream>\n#include <string>\n#include <stdexcept>\n\n#ifdef __INTEL_COMPILER\n\/\/ #pragma warning(push)\n#pragma warning(disable:2196)\n#pragma warning(disable:2536)\n#endif \/\/ __INTEL_COMPILER\n\n#ifdef __clang__\n#pragma clang diagnostic push\n#pragma clang diagnostic ignored \"-Wall\"\n#pragma clang diagnostic ignored \"-Wunique-enum\"\n#endif \/\/ __clang__\n\n#include <Eigen\/Dense>\n\n#ifdef __INTEL_COMPILER\n\/\/ #pragma warning(pop)\n#endif \/\/ __INTEL_COMPILER\n\n#ifdef __clang__\n#pragma clang diagnostic pop\n#endif \/\/ __clang__\n\n#include <vSMC\/internal\/config.hpp>\n#include <vSMC\/internal\/version.hpp>\n#include <vSMC\/internal\/function.hpp>\n#include <vSMC\/internal\/type_traits.hpp>\n#include <vSMC\/rng\/random.hpp>\n\n#ifndef V_SMC_INDEX_TYPE\n#define V_SMC_INDEX_TYPE EIGEN_DEFAULT_DENSE_INDEX_TYPE\n#endif \/\/ V_SMC_INDEX_TYPE\n\nnamespace vSMC {\n\ntemplate <typename T> class Sampler;\ntemplate <typename T> class Particle;\ntemplate <typename T> class Monitor;\ntemplate <typename T> class Path;\n\ntemplate <typename T> class SingleParticle;\ntemplate <typename T> class ConstSingleParticle;\ntemplate <unsigned Dim, typename T> class StateBase;\n\ntemplate <typename T> class InitializeSeq;\ntemplate <typename T> class MoveSeq;\ntemplate <typename T, unsigned Dim> class MonitorSeq;\ntemplate <typename T> class PathSeq;\n\ntemplate <typename T> class InitializeTBB;\ntemplate <typename T> class MoveTBB;\ntemplate <typename T, unsigned Dim> class MonitorTBB;\ntemplate <typename T> class PathTBB;\n\ntemplate <unsigned Dim, typename T> class StateCL;\ntemplate <typename T> class InitializeCL;\ntemplate <typename T> class MoveCL;\ntemplate <typename T, unsigned Dim> class MonitorCL;\ntemplate <typename T> class PathCL;\n\nclass StateBaseTrait\n{\n public :\n\n virtual ~StateBaseTrait () {}\n};\n\nclass StateSeqTrait\n{\n public :\n\n virtual ~StateSeqTrait () {}\n};\n\nclass InitializeSeqTrait\n{\n public :\n\n virtual ~InitializeSeqTrait () {}\n};\n\nclass MoveSeqTrait\n{\n public :\n\n virtual ~MoveSeqTrait () {}\n};\n\nclass MonitorSeqTrait\n{\n public :\n\n virtual ~MonitorSeqTrait () {}\n};\n\nclass PathSeqTrait\n{\n public :\n\n virtual ~PathSeqTrait () {}\n};\n\nclass StateTBBTrait\n{\n public :\n\n virtual ~StateTBBTrait () {}\n\n virtual void pre_resampling () = 0;\n virtual void post_resampling () = 0;\n};\n\nclass InitializeTBBTrait\n{\n public :\n\n virtual ~InitializeTBBTrait () {}\n};\n\nclass MoveTBBTrait\n{\n public :\n\n virtual ~MoveTBBTrait () {}\n};\n\nclass MonitorTBBTrait\n{\n public :\n\n virtual ~MonitorTBBTrait () {}\n};\n\nclass PathTBBTrait\n{\n public :\n\n virtual ~PathTBBTrait () {}\n};\n\nclass StateCLTrait\n{\n public :\n\n virtual ~StateCLTrait () {}\n\n virtual void pre_resampling () = 0;\n virtual void post_resampling () = 0;\n};\n\nclass InitializeCLTrait\n{\n public :\n\n virtual ~InitializeCLTrait () {}\n};\n\nclass MoveCLTrait\n{\n public :\n\n virtual ~MoveCLTrait () {}\n};\n\nclass MonitorCLTrait\n{\n public :\n\n virtual ~MonitorCLTrait () {}\n};\n\nclass PathCLTrait\n{\n public :\n\n virtual ~PathCLTrait () {}\n};\n\n\/\/\/ \\brief Resample scheme\n\/\/\/ \\ingroup Core\nenum ResampleScheme {\n MULTINOMIAL, \/\/\/< Multinomial resampling\n RESIDUAL, \/\/\/< Reisudal resampling\n STRATIFIED, \/\/\/< Startified resampling\n SYSTEMATIC, \/\/\/< Systematic resampling\n RESIDUAL_STRATIFIED, \/\/\/< Stratified resampling on the residuals\n RESIDUAL_SYSTEMATIC \/\/\/< Systematic resampling on the residuals\n}; \/\/ enum ResamleScheme\n\n} \/\/ namespace vSMC\n\n#endif \/\/ V_SMC_INTERNAL_COMMON_HPP\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 \"eventql\/transport\/native\/server.h\"\n#include \"eventql\/transport\/native\/connection.h\"\n#include \"eventql\/util\/logging.h\"\n#include \"eventql\/server\/session.h\"\n\nnamespace eventql {\nnamespace native_transport {\n\nReturnCode performOperation_META_PERFORMOP(\n Database* database,\n NativeConnection* conn,\n const char* payload,\n size_t payload_size) {\n auto session = database->getSession();\n auto dbctx = session->getDatabaseContext();\n\n \/* check internal *\/\n if (!session->isInternal()) {\n return conn->sendErrorFrame(\"internal method called\");\n }\n\n return ReturnCode::success();\n}\n\n} \/\/ namespace native_transport\n} \/\/ namespace eventql\n\n<commit_msg>performOperation_META_PERFORMOP<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 \"eventql\/transport\/native\/server.h\"\n#include \"eventql\/transport\/native\/connection.h\"\n#include \"eventql\/transport\/native\/frames\/meta_performop.h\"\n#include \"eventql\/util\/logging.h\"\n#include \"eventql\/server\/session.h\"\n#include \"eventql\/db\/metadata_service.h\"\n\nnamespace eventql {\nnamespace native_transport {\n\nReturnCode performOperation_META_PERFORMOP(\n Database* database,\n NativeConnection* conn,\n const char* payload,\n size_t payload_size) {\n auto session = database->getSession();\n auto dbctx = session->getDatabaseContext();\n\n \/* check internal *\/\n if (!session->isInternal()) {\n return conn->sendErrorFrame(\"internal method called\");\n }\n\n \/* parse request *\/\n MetaPerformopFrame m_frame;\n {\n MemoryInputStream is(payload, payload_size);\n auto rc = m_frame.parseFrom(&is);\n if (!rc.isSuccess()) {\n return conn->sendErrorFrame(\"invalid frame\");\n }\n }\n\n MetadataOperation op;\n {\n auto is = StringInputStream::fromString(m_frame.getOperation());\n auto rc = op.decode(is.get());\n if (!rc.isSuccess()) {\n return conn->sendErrorFrame(\"invalid frame\");\n }\n }\n\n \/* execute operation *\/\n MetadataOperationResult result;\n auto rc = dbctx->metadata_service->performMetadataOperation(\n m_frame.getDatabase(),\n m_frame.getTable(),\n op,\n &result);\n\n \/* send response *\/\n if (rc.isSuccess()) {\n auto payload = *msg::encode(result);\n\n return conn->sendFrame(\n EVQL_OP_META_PERFORMOP_RESULT,\n EVQL_ENDOFREQUEST,\n payload.data(),\n payload.size());\n } else {\n return conn->sendErrorFrame(rc.message());\n }\n\n return ReturnCode::success();\n}\n\n} \/\/ namespace native_transport\n} \/\/ namespace eventql\n\n<|endoftext|>"} {"text":"<commit_before>#include \"entitysystem.h\"\n#include \"systems\/movementsystem.h\"\n#include \"systems\/updatesystem.h\"\n#include \"systems\/chatsystem.h\"\n#include \"systems\/inventorysystem.h\"\n#include \"systems\/partysystem.h\"\n#include \"systems\/mapsystem.h\"\n#include \"connection.h\"\n#include \"cmapclient.h\"\n\n#include <vector>\n#include <set>\n\nusing namespace RoseCommon;\nEntitySystem::EntitySystem() : systemManager_(*this) {\n systemManager_.add<Systems::MovementSystem>();\n systemManager_.add<Systems::UpdateSystem>();\n systemManager_.add<Systems::ChatSystem>();\n systemManager_.add<Systems::InventorySystem>();\n systemManager_.add<Systems::PartySystem>();\n systemManager_.add<Systems::MapSystem>();\n}\n\nEntityManager &EntitySystem::getEntityManager() {\n return entityManager_;\n}\n\nvoid EntitySystem::registerEntity(Entity entity) {\n if (!entity)\n return;\n auto basic = entity.component<BasicInfo>();\n if (!basic || basic->name_ == \"\" || !basic->id_)\n return;\n nameToEntity_[basic->name_] = entity;\n idToEntity_[basic->id_] = entity;\n}\n\nEntity EntitySystem::getEntity(const std::string &name) {\n return nameToEntity_[name];\n}\n\nEntity EntitySystem::getEntity(uint32_t charId) {\n return idToEntity_[charId];\n}\n\nvoid EntitySystem::update(double dt) {\n std::lock_guard<std::mutex> lock(access_);\n while (toDispatch_.size()) {\n auto tmp = std::move(toDispatch_.front());\n systemManager_.dispatch(tmp.first, *tmp.second);\n toDispatch_.pop();\n }\n systemManager_.update(dt);\n for (auto it : toDestroy_) {\n if (it) {\n saveCharacter(it.component<CharacterInfo>()->charId_, it);\n auto basic = it.component<BasicInfo>();\n nameToEntity_.erase(basic->name_);\n idToEntity_.erase(basic->id_);\n it.destroy();\n }\n }\n toDestroy_.clear();\n}\n\nvoid EntitySystem::destroy(Entity entity) {\n if (!entity)\n return;\n std::lock_guard<std::mutex> lock(access_);\n toDestroy_.push_back(entity);\n}\n\nEntity EntitySystem::create() {\n return entityManager_.create();\n}\n\nbool EntitySystem::isNearby(Entity a, Entity b) {\n return true; \/\/ FIXME : actually implement the sight calculation instead of the distance\n if (!a || !b)\n return false;\n auto posa = a.component<Position>();\n auto posb = b.component<Position>();\n if (!posa || !posb)\n return false; \/\/ FIXME : is it a bug if there is no position?\n if (posa->map_ != posb->map_)\n return false;\n double dist = (posa->x_ - posb->x_) * (posa->x_ - posb->x_) + (posa->y_ - posb->y_) * (posa->y_ - posb->y_);\n if (dist > NEARBY_DIST)\n return false;\n return true;\n}\n\nbool EntitySystem::dispatch(Entity entity, std::unique_ptr<RoseCommon::CRosePacket> packet) {\n if (!entity)\n return false;\n if (systemManager_.wouldDispatch(*packet)) {\n std::lock_guard<std::mutex> lock(access_);\n toDispatch_.emplace(std::make_pair(entity, std::move(packet)));\n return true;\n }\n return false;\n}\n\nEntity EntitySystem::loadCharacter(uint32_t charId, bool platinium, uint32_t id) {\n auto conn = Core::connectionPool.getConnection(Core::osirose);\n Core::CharacterTable characters;\n Core::InventoryTable inventoryTable;\n Core::SkillTable skillsTable;\n\n auto charRes = conn(sqlpp::select(sqlpp::count(characters.id), sqlpp::all_of(characters))\n .from(characters)\n .where(characters.id == charId));\n\n std::lock_guard<std::mutex> lock(access_);\n auto entity = create();\n if (static_cast<long>(charRes.front().count) != 1L) {\n entity.destroy();\n return Entity();\n }\n const auto &charRow = charRes.front();\n\n entity.assign<Position>(charRow);\n entity.assign<BasicInfo>(charRow, id);\n entity.assign<Stats>(charRow);\n entity.assign<AdvancedInfo>(charRow);\n entity.assign<CharacterGraphics>(charRow);\n entity.assign<CharacterInfo>(charRow, platinium, charId);\n\n \/\/ TODO : write the pat initialization code\n auto skills = entity.assign<Skills>();\n auto skillRes = conn(sqlpp::select(skillsTable.id, skillsTable.level)\n .from(skillsTable)\n .where(skillsTable.charId == charId));\n skills->loadFromResult(skillRes);\n\n \/\/ TODO : write the hotbar table and loading code\n entity.assign<Hotbar>();\n entity.assign<StatusEffects>();\n entity.assign<RidingItems>();\n entity.assign<BulletItems>();\n\n \/\/ TODO : write the inventory code\n auto inventory = entity.assign<Inventory>();\n\n auto invRes = conn(sqlpp::select(sqlpp::all_of(inventoryTable))\n .from(inventoryTable)\n .where(inventoryTable.charId == charId));\n inventory->loadFromResult(invRes);\n\n Systems::UpdateSystem::calculateSpeed(entity);\n\n entity.assign<Quests>();\n\n Core::WishTable wish;\n auto wishRes = conn(sqlpp::select(sqlpp::all_of(wish))\n .from(wish)\n .where(wish.charId == charId));\n auto wishlist = entity.assign<Wishlist>();\n wishlist->loadFromResult(wishRes);\n\n registerEntity(entity);\n return entity;\n}\n\nvoid EntitySystem::saveCharacter(uint32_t charId, Entity entity) {\n if (!entity)\n return;\n auto conn = Core::connectionPool.getConnection(Core::osirose);\n Core::CharacterTable characters;\n\n using sqlpp::parameter;\n\n auto update = sqlpp::dynamic_update(conn.get(), characters).dynamic_set().where(characters.id == charId);\n entity.component<Position>()->commitToUpdate<decltype(characters)>(update);\n entity.component<BasicInfo>()->commitToUpdate<decltype(characters)>(update);\n entity.component<Stats>()->commitToUpdate<decltype(characters)>(update);\n entity.component<AdvancedInfo>()->commitToUpdate<decltype(characters)>(update);\n \/\/entity.component<CharacterGraphics>()->commitToUpdate(update);\n entity.component<CharacterInfo>()->commitToUpdate<decltype(characters)>(update);\n \/\/entity.component<Hotbar>()->commitToUpdate(update);\n \/\/entity.component<StatusEffects>()->commitToUpdate(update);\n \/\/entity.component<RidingItems>()->commitToUpdate(update);\n \/\/entity.component<BulletItems>()->commitToUpdate(update);\n\n conn->run(update);\n\n \/\/entity.component<Skills>()->commitToUpdate(updateSkills);\n\n Core::InventoryTable inv;\n auto invRes = conn(sqlpp::select(sqlpp::all_of(inv))\n .from(inv)\n .where(inv.charId == charId));\n\n const auto& items = entity.component<Inventory>()->items_;\n\n std::vector<size_t> toDelete;\n std::vector<size_t> toUpdate;\n std::set<size_t> modified;\n std::vector<size_t> toInsert;\n\n for (const auto& row : invRes) {\n if (row.slot >= Inventory::maxItems)\n toDelete.emplace_back(row.slot); \/\/FIXME: that should never happen\n else if (!items[row.slot])\n toDelete.emplace_back(row.slot);\n else if (items[row.slot] != Item(row))\n toUpdate.emplace_back(row.slot);\n modified.insert(row.slot);\n }\n size_t i = 0;\n for (const auto& item : items) {\n if (item && modified.find(i) == modified.end())\n toInsert.emplace_back(i);\n ++i;\n }\n\n for (auto it : toDelete)\n conn(sqlpp::remove_from(inv).where(inv.charId == charId and inv.slot == it));\n for (auto it : toUpdate) {\n auto update = sqlpp::dynamic_update(conn.get(), inv).dynamic_set().where(inv.charId == charId and inv.slot == it);\n items[it].commitToUpdate<decltype(inv)>(update);\n conn->run(update);\n }\n for (auto it : toInsert) {\n auto insert = sqlpp::dynamic_insert_into(conn.get(), inv).dynamic_set();\n items[it].commitToInsert<decltype(inv)>(insert);\n insert.insert_list.add(inv.slot = it);\n insert.insert_list.add(inv.charId = charId);\n conn->run(insert);\n }\n}\n<commit_msg>Update entitysystem.cpp<commit_after>#include \"entitysystem.h\"\n#include \"systems\/movementsystem.h\"\n#include \"systems\/updatesystem.h\"\n#include \"systems\/chatsystem.h\"\n#include \"systems\/inventorysystem.h\"\n#include \"systems\/partysystem.h\"\n#include \"systems\/mapsystem.h\"\n#include \"systems\/luasystem.h\"\n#include \"connection.h\"\n#include \"cmapclient.h\"\n\n#include <vector>\n#include <set>\n\nusing namespace RoseCommon;\nEntitySystem::EntitySystem() : systemManager_(*this) {\n systemManager_.add<Systems::MovementSystem>();\n systemManager_.add<Systems::UpdateSystem>();\n systemManager_.add<Systems::ChatSystem>();\n systemManager_.add<Systems::InventorySystem>();\n systemManager_.add<Systems::PartySystem>();\n systemManager_.add<Systems::MapSystem>();\n systemManager_.add<Systems::LuaSystem>();\n}\n\nEntityManager &EntitySystem::getEntityManager() {\n return entityManager_;\n}\n\nvoid EntitySystem::registerEntity(Entity entity) {\n if (!entity)\n return;\n auto basic = entity.component<BasicInfo>();\n if (!basic || basic->name_ == \"\" || !basic->id_)\n return;\n nameToEntity_[basic->name_] = entity;\n idToEntity_[basic->id_] = entity;\n}\n\nEntity EntitySystem::getEntity(const std::string &name) {\n return nameToEntity_[name];\n}\n\nEntity EntitySystem::getEntity(uint32_t charId) {\n return idToEntity_[charId];\n}\n\nvoid EntitySystem::update(double dt) {\n std::lock_guard<std::mutex> lock(access_);\n while (toDispatch_.size()) {\n auto tmp = std::move(toDispatch_.front());\n systemManager_.dispatch(tmp.first, *tmp.second);\n toDispatch_.pop();\n }\n systemManager_.update(dt);\n for (auto it : toDestroy_) {\n if (it) {\n saveCharacter(it.component<CharacterInfo>()->charId_, it);\n auto basic = it.component<BasicInfo>();\n nameToEntity_.erase(basic->name_);\n idToEntity_.erase(basic->id_);\n systemManager_.get<Systems::LuaSystem>()->unregisterEntity(it);\n it.destroy();\n }\n }\n toDestroy_.clear();\n}\n\nvoid EntitySystem::destroy(Entity entity) {\n if (!entity)\n return;\n std::lock_guard<std::mutex> lock(access_);\n toDestroy_.push_back(entity);\n}\n\nEntity EntitySystem::create() {\n return entityManager_.create();\n}\n\nbool EntitySystem::isNearby(Entity a, Entity b) {\n return true; \/\/ FIXME : actually implement the sight calculation instead of the distance\n if (!a || !b)\n return false;\n auto posa = a.component<Position>();\n auto posb = b.component<Position>();\n if (!posa || !posb)\n return false; \/\/ FIXME : is it a bug if there is no position?\n if (posa->map_ != posb->map_)\n return false;\n double dist = (posa->x_ - posb->x_) * (posa->x_ - posb->x_) + (posa->y_ - posb->y_) * (posa->y_ - posb->y_);\n if (dist > NEARBY_DIST)\n return false;\n return true;\n}\n\nbool EntitySystem::dispatch(Entity entity, std::unique_ptr<RoseCommon::CRosePacket> packet) {\n if (!entity)\n return false;\n if (systemManager_.wouldDispatch(*packet)) {\n std::lock_guard<std::mutex> lock(access_);\n toDispatch_.emplace(std::make_pair(entity, std::move(packet)));\n return true;\n }\n return false;\n}\n\nEntity EntitySystem::loadCharacter(uint32_t charId, bool platinium, uint32_t id) {\n auto conn = Core::connectionPool.getConnection(Core::osirose);\n Core::CharacterTable characters;\n Core::InventoryTable inventoryTable;\n Core::SkillTable skillsTable;\n\n auto charRes = conn(sqlpp::select(sqlpp::count(characters.id), sqlpp::all_of(characters))\n .from(characters)\n .where(characters.id == charId));\n\n std::lock_guard<std::mutex> lock(access_);\n auto entity = create();\n if (static_cast<long>(charRes.front().count) != 1L) {\n entity.destroy();\n return Entity();\n }\n const auto &charRow = charRes.front();\n\n entity.assign<Position>(charRow);\n entity.assign<BasicInfo>(charRow, id);\n entity.assign<Stats>(charRow);\n entity.assign<AdvancedInfo>(charRow);\n entity.assign<CharacterGraphics>(charRow);\n entity.assign<CharacterInfo>(charRow, platinium, charId);\n\n \/\/ TODO : write the pat initialization code\n auto skills = entity.assign<Skills>();\n auto skillRes = conn(sqlpp::select(skillsTable.id, skillsTable.level)\n .from(skillsTable)\n .where(skillsTable.charId == charId));\n skills->loadFromResult(skillRes);\n\n \/\/ TODO : write the hotbar table and loading code\n entity.assign<Hotbar>();\n entity.assign<StatusEffects>();\n entity.assign<RidingItems>();\n entity.assign<BulletItems>();\n\n \/\/ TODO : write the inventory code\n auto inventory = entity.assign<Inventory>();\n\n auto invRes = conn(sqlpp::select(sqlpp::all_of(inventoryTable))\n .from(inventoryTable)\n .where(inventoryTable.charId == charId));\n inventory->loadFromResult(invRes);\n\n Systems::UpdateSystem::calculateSpeed(entity);\n\n entity.assign<Quests>();\n\n Core::WishTable wish;\n auto wishRes = conn(sqlpp::select(sqlpp::all_of(wish))\n .from(wish)\n .where(wish.charId == charId));\n auto wishlist = entity.assign<Wishlist>();\n wishlist->loadFromResult(wishRes);\n\n registerEntity(entity);\n return entity;\n}\n\nvoid EntitySystem::saveCharacter(uint32_t charId, Entity entity) {\n if (!entity)\n return;\n auto conn = Core::connectionPool.getConnection(Core::osirose);\n Core::CharacterTable characters;\n\n using sqlpp::parameter;\n\n auto update = sqlpp::dynamic_update(conn.get(), characters).dynamic_set().where(characters.id == charId);\n entity.component<Position>()->commitToUpdate<decltype(characters)>(update);\n entity.component<BasicInfo>()->commitToUpdate<decltype(characters)>(update);\n entity.component<Stats>()->commitToUpdate<decltype(characters)>(update);\n entity.component<AdvancedInfo>()->commitToUpdate<decltype(characters)>(update);\n \/\/entity.component<CharacterGraphics>()->commitToUpdate(update);\n entity.component<CharacterInfo>()->commitToUpdate<decltype(characters)>(update);\n \/\/entity.component<Hotbar>()->commitToUpdate(update);\n \/\/entity.component<StatusEffects>()->commitToUpdate(update);\n \/\/entity.component<RidingItems>()->commitToUpdate(update);\n \/\/entity.component<BulletItems>()->commitToUpdate(update);\n\n conn->run(update);\n\n \/\/entity.component<Skills>()->commitToUpdate(updateSkills);\n\n Core::InventoryTable inv;\n auto invRes = conn(sqlpp::select(sqlpp::all_of(inv))\n .from(inv)\n .where(inv.charId == charId));\n\n const auto& items = entity.component<Inventory>()->items_;\n\n std::vector<size_t> toDelete;\n std::vector<size_t> toUpdate;\n std::set<size_t> modified;\n std::vector<size_t> toInsert;\n\n for (const auto& row : invRes) {\n if (row.slot >= Inventory::maxItems)\n toDelete.emplace_back(row.slot); \/\/FIXME: that should never happen\n else if (!items[row.slot])\n toDelete.emplace_back(row.slot);\n else if (items[row.slot] != Item(row))\n toUpdate.emplace_back(row.slot);\n modified.insert(row.slot);\n }\n size_t i = 0;\n for (const auto& item : items) {\n if (item && modified.find(i) == modified.end())\n toInsert.emplace_back(i);\n ++i;\n }\n\n for (auto it : toDelete)\n conn(sqlpp::remove_from(inv).where(inv.charId == charId and inv.slot == it));\n for (auto it : toUpdate) {\n auto update = sqlpp::dynamic_update(conn.get(), inv).dynamic_set().where(inv.charId == charId and inv.slot == it);\n items[it].commitToUpdate<decltype(inv)>(update);\n conn->run(update);\n }\n for (auto it : toInsert) {\n auto insert = sqlpp::dynamic_insert_into(conn.get(), inv).dynamic_set();\n items[it].commitToInsert<decltype(inv)>(insert);\n insert.insert_list.add(inv.slot = it);\n insert.insert_list.add(inv.charId = charId);\n conn->run(insert);\n }\n}\n<|endoftext|>"} {"text":"<commit_before>\/*\n * Copyright (c) 2013,2016-2018 ARM Limited\n * All rights reserved.\n *\n * The license below extends only to copyright in the software and shall\n * not be construed as granting a license to any other intellectual\n * property including but not limited to intellectual property relating\n * to a hardware implementation of the functionality of the software\n * licensed hereunder. You may use the software subject to the license\n * terms below provided that you ensure that this notice is replicated\n * unmodified and in its entirety in all distributions of the software,\n * modified or unmodified, in source code or in binary form.\n *\n * Copyright (c) 2003-2005 The Regents of The University of Michigan\n * All rights reserved.\n *\n * Redistribution and use in source and binary forms, with or without\n * modification, are permitted provided that the following conditions are\n * met: redistributions of source code must retain the above copyright\n * notice, this list of conditions and the following disclaimer;\n * redistributions in binary form must reproduce the above copyright\n * notice, this list of conditions and the following disclaimer in the\n * documentation and\/or other materials provided with the distribution;\n * neither the name of the copyright holders nor the names of its\n * contributors may be used to endorse or promote products derived from\n * this software without specific prior written permission.\n *\n * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS\n * \"AS IS\" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT\n * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR\n * A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT\n * OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,\n * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT\n * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,\n * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY\n * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT\n * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE\n * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.\n *\n * Authors: Erik Hallnor\n * Nikos Nikoleris\n *\/\n\n\/**\n * @file\n * Definitions a fully associative LRU tagstore.\n *\/\n\n#include \"mem\/cache\/tags\/fa_lru.hh\"\n\n#include <cassert>\n#include <sstream>\n\n#include \"base\/intmath.hh\"\n#include \"base\/logging.hh\"\n\nFALRU::FALRU(const Params *p)\n : BaseTags(p),\n\n cacheTracking(p->min_tracked_cache_size, size, blkSize)\n{\n if (!isPowerOf2(blkSize))\n fatal(\"cache block size (in bytes) `%d' must be a power of two\",\n blkSize);\n if (!isPowerOf2(size))\n fatal(\"Cache Size must be power of 2 for now\");\n\n blks = new FALRUBlk[numBlocks];\n\n head = &(blks[0]);\n head->prev = nullptr;\n head->next = &(blks[1]);\n head->set = 0;\n head->way = 0;\n head->data = &dataBlks[0];\n\n for (unsigned i = 1; i < numBlocks - 1; i++) {\n blks[i].prev = &(blks[i-1]);\n blks[i].next = &(blks[i+1]);\n blks[i].set = 0;\n blks[i].way = i;\n\n \/\/ Associate a data chunk to the block\n blks[i].data = &dataBlks[blkSize*i];\n }\n\n tail = &(blks[numBlocks - 1]);\n tail->prev = &(blks[numBlocks - 2]);\n tail->next = nullptr;\n tail->set = 0;\n tail->way = numBlocks - 1;\n tail->data = &dataBlks[(numBlocks - 1) * blkSize];\n\n cacheTracking.init(head, tail);\n}\n\nFALRU::~FALRU()\n{\n delete[] blks;\n}\n\nvoid\nFALRU::regStats()\n{\n BaseTags::regStats();\n cacheTracking.regStats(name());\n}\n\nFALRUBlk *\nFALRU::hashLookup(Addr addr) const\n{\n tagIterator iter = tagHash.find(addr);\n if (iter != tagHash.end()) {\n return (*iter).second;\n }\n return nullptr;\n}\n\nvoid\nFALRU::invalidate(CacheBlk *blk)\n{\n BaseTags::invalidate(blk);\n\n \/\/ Move the block to the tail to make it the next victim\n moveToTail((FALRUBlk*)blk);\n\n \/\/ Erase block entry in the hash table\n tagHash.erase(blk->tag);\n}\n\nCacheBlk*\nFALRU::accessBlock(Addr addr, bool is_secure, Cycles &lat)\n{\n return accessBlock(addr, is_secure, lat, 0);\n}\n\nCacheBlk*\nFALRU::accessBlock(Addr addr, bool is_secure, Cycles &lat,\n CachesMask *in_caches_mask)\n{\n CachesMask mask = 0;\n Addr blkAddr = blkAlign(addr);\n FALRUBlk* blk = hashLookup(blkAddr);\n\n if (blk && blk->isValid()) {\n \/\/ If a cache hit\n lat = accessLatency;\n \/\/ Check if the block to be accessed is available. If not,\n \/\/ apply the accessLatency on top of block->whenReady.\n if (blk->whenReady > curTick() &&\n cache->ticksToCycles(blk->whenReady - curTick()) >\n accessLatency) {\n lat = cache->ticksToCycles(blk->whenReady - curTick()) +\n accessLatency;\n }\n assert(blk->tag == blkAddr);\n mask = blk->inCachesMask;\n moveToHead(blk);\n } else {\n \/\/ If a cache miss\n lat = lookupLatency;\n blk = nullptr;\n }\n if (in_caches_mask) {\n *in_caches_mask = mask;\n }\n\n cacheTracking.recordAccess(blk);\n\n return blk;\n}\n\n\nCacheBlk*\nFALRU::findBlock(Addr addr, bool is_secure) const\n{\n Addr blkAddr = blkAlign(addr);\n FALRUBlk* blk = hashLookup(blkAddr);\n\n if (blk && blk->isValid()) {\n assert(blk->tag == blkAddr);\n } else {\n blk = nullptr;\n }\n return blk;\n}\n\nCacheBlk*\nFALRU::findBlockBySetAndWay(int set, int way) const\n{\n assert(set == 0);\n return &blks[way];\n}\n\nCacheBlk*\nFALRU::findVictim(Addr addr)\n{\n return tail;\n}\n\nvoid\nFALRU::insertBlock(PacketPtr pkt, CacheBlk *blk)\n{\n FALRUBlk* falruBlk = static_cast<FALRUBlk*>(blk);\n\n \/\/ Make sure block is not present in the cache\n assert(falruBlk->inCachesMask == 0);\n\n \/\/ Do common block insertion functionality\n BaseTags::insertBlock(pkt, blk);\n\n \/\/ New block is the MRU\n moveToHead(falruBlk);\n\n \/\/ Insert new block in the hash table\n tagHash[falruBlk->tag] = falruBlk;\n}\n\nvoid\nFALRU::moveToHead(FALRUBlk *blk)\n{\n \/\/ If block is not already head, do the moving\n if (blk != head) {\n cacheTracking.moveBlockToHead(blk);\n \/\/ If block is tail, set previous block as new tail\n if (blk == tail){\n assert(blk->next == nullptr);\n tail = blk->prev;\n tail->next = nullptr;\n \/\/ Inform block's surrounding blocks that it has been moved\n } else {\n blk->prev->next = blk->next;\n blk->next->prev = blk->prev;\n }\n\n \/\/ Swap pointers\n blk->next = head;\n blk->prev = nullptr;\n head->prev = blk;\n head = blk;\n\n cacheTracking.check(head, tail);\n }\n}\n\nvoid\nFALRU::moveToTail(FALRUBlk *blk)\n{\n \/\/ If block is not already tail, do the moving\n if (blk != tail) {\n cacheTracking.moveBlockToTail(blk);\n \/\/ If block is head, set next block as new head\n if (blk == head){\n assert(blk->prev == nullptr);\n head = blk->next;\n head->prev = nullptr;\n \/\/ Inform block's surrounding blocks that it has been moved\n } else {\n blk->prev->next = blk->next;\n blk->next->prev = blk->prev;\n }\n\n \/\/ Swap pointers\n blk->prev = tail;\n blk->next = nullptr;\n tail->next = blk;\n tail = blk;\n\n cacheTracking.check(head, tail);\n }\n}\n\nFALRU *\nFALRUParams::create()\n{\n return new FALRU(this);\n}\n\nvoid\nFALRU::CacheTracking::check(FALRUBlk *head, FALRUBlk *tail)\n{\n#ifdef FALRU_DEBUG\n FALRUBlk* blk = head;\n unsigned curr_size = 0;\n unsigned tracked_cache_size = minTrackedSize;\n CachesMask in_caches_mask = inAllCachesMask;\n int j = 0;\n\n while (blk) {\n panic_if(blk->inCachesMask != in_caches_mask, \"Expected cache mask \"\n \"%x found %x\", blk->inCachesMask, in_caches_mask);\n\n curr_size += blkSize;\n if (curr_size == tracked_cache_size && blk != tail) {\n panic_if(boundaries[j] != blk, \"Unexpected boundary for the %d-th \"\n \"cache\", j);\n tracked_cache_size <<= 1;\n \/\/ from this point, blocks fit only in the larger caches\n in_caches_mask &= ~(1U << j);\n ++j;\n }\n blk = blk->next;\n }\n#endif \/\/ FALRU_DEBUG\n}\n\nvoid\nFALRU::CacheTracking::init(FALRUBlk *head, FALRUBlk *tail)\n{\n \/\/ early exit if we are not tracking any extra caches\n FALRUBlk* blk = numTrackedCaches ? head : nullptr;\n unsigned curr_size = 0;\n unsigned tracked_cache_size = minTrackedSize;\n CachesMask in_caches_mask = inAllCachesMask;\n int j = 0;\n\n while (blk) {\n blk->inCachesMask = in_caches_mask;\n\n curr_size += blkSize;\n if (curr_size == tracked_cache_size && blk != tail) {\n boundaries[j] = blk;\n\n tracked_cache_size <<= 1;\n \/\/ from this point, blocks fit only in the larger caches\n in_caches_mask &= ~(1U << j);\n ++j;\n }\n blk = blk->next;\n }\n}\n\n\nvoid\nFALRU::CacheTracking::moveBlockToHead(FALRUBlk *blk)\n{\n \/\/ Get the mask of all caches, in which the block didn't fit\n \/\/ before moving it to the head\n CachesMask update_caches_mask = inAllCachesMask ^ blk->inCachesMask;\n\n for (int i = 0; i < numTrackedCaches; i++) {\n CachesMask current_cache_mask = 1U << i;\n if (current_cache_mask & update_caches_mask) {\n \/\/ if the ith cache didn't fit the block (before it is moved to\n \/\/ the head), move the ith boundary 1 block closer to the\n \/\/ MRU\n boundaries[i]->inCachesMask &= ~current_cache_mask;\n boundaries[i] = boundaries[i]->prev;\n } else if (boundaries[i] == blk) {\n \/\/ Make sure the boundary doesn't point to the block\n \/\/ we are about to move\n boundaries[i] = blk->prev;\n }\n }\n\n \/\/ Make block reside in all caches\n blk->inCachesMask = inAllCachesMask;\n}\n\nvoid\nFALRU::CacheTracking::moveBlockToTail(FALRUBlk *blk)\n{\n CachesMask update_caches_mask = blk->inCachesMask;\n\n for (int i = 0; i < numTrackedCaches; i++) {\n CachesMask current_cache_mask = 1U << i;\n if (current_cache_mask & update_caches_mask) {\n \/\/ if the ith cache fitted the block (before it is moved to\n \/\/ the tail), move the ith boundary 1 block closer to the\n \/\/ LRU\n boundaries[i] = boundaries[i]->next;\n if (boundaries[i] == blk) {\n \/\/ Make sure the boundary doesn't point to the block\n \/\/ we are about to move\n boundaries[i] = blk->next;\n }\n boundaries[i]->inCachesMask |= current_cache_mask;\n }\n }\n\n \/\/ The block now fits only in the actual cache\n blk->inCachesMask = 0;\n}\n\nvoid\nFALRU::CacheTracking::recordAccess(FALRUBlk *blk)\n{\n for (int i = 0; i < numTrackedCaches; i++) {\n if (blk && ((1U << i) & blk->inCachesMask)) {\n hits[i]++;\n } else {\n misses[i]++;\n }\n }\n\n \/\/ Record stats for the actual cache too\n if (blk) {\n hits[numTrackedCaches]++;\n } else {\n misses[numTrackedCaches]++;\n }\n\n accesses++;\n}\n\nvoid\nprintSize(std::ostream &stream, size_t size)\n{\n static const char *SIZES[] = { \"B\", \"kB\", \"MB\", \"GB\", \"TB\", \"ZB\" };\n int div = 0;\n while (size >= 1024 && div < (sizeof SIZES \/ sizeof *SIZES)) {\n div++;\n size >>= 10;\n }\n stream << size << SIZES[div];\n}\n\nvoid\nFALRU::CacheTracking::regStats(std::string name)\n{\n hits\n .init(numTrackedCaches + 1)\n .name(name + \".falru_hits\")\n .desc(\"The number of hits in each cache size.\")\n ;\n misses\n .init(numTrackedCaches + 1)\n .name(name + \".falru_misses\")\n .desc(\"The number of misses in each cache size.\")\n ;\n accesses\n .name(name + \".falru_accesses\")\n .desc(\"The number of accesses to the FA LRU cache.\")\n ;\n\n for (unsigned i = 0; i < numTrackedCaches + 1; ++i) {\n std::stringstream size_str;\n printSize(size_str, minTrackedSize << i);\n hits.subname(i, size_str.str());\n hits.subdesc(i, \"Hits in a \" + size_str.str() + \" cache\");\n misses.subname(i, size_str.str());\n misses.subdesc(i, \"Misses in a \" + size_str.str() + \" cache\");\n }\n}\n<commit_msg>mem-cache: Use secure flag in FALRU's findBlock<commit_after>\/*\n * Copyright (c) 2013,2016-2018 ARM Limited\n * All rights reserved.\n *\n * The license below extends only to copyright in the software and shall\n * not be construed as granting a license to any other intellectual\n * property including but not limited to intellectual property relating\n * to a hardware implementation of the functionality of the software\n * licensed hereunder. You may use the software subject to the license\n * terms below provided that you ensure that this notice is replicated\n * unmodified and in its entirety in all distributions of the software,\n * modified or unmodified, in source code or in binary form.\n *\n * Copyright (c) 2003-2005 The Regents of The University of Michigan\n * All rights reserved.\n *\n * Redistribution and use in source and binary forms, with or without\n * modification, are permitted provided that the following conditions are\n * met: redistributions of source code must retain the above copyright\n * notice, this list of conditions and the following disclaimer;\n * redistributions in binary form must reproduce the above copyright\n * notice, this list of conditions and the following disclaimer in the\n * documentation and\/or other materials provided with the distribution;\n * neither the name of the copyright holders nor the names of its\n * contributors may be used to endorse or promote products derived from\n * this software without specific prior written permission.\n *\n * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS\n * \"AS IS\" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT\n * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR\n * A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT\n * OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,\n * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT\n * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,\n * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY\n * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT\n * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE\n * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.\n *\n * Authors: Erik Hallnor\n * Nikos Nikoleris\n *\/\n\n\/**\n * @file\n * Definitions a fully associative LRU tagstore.\n *\/\n\n#include \"mem\/cache\/tags\/fa_lru.hh\"\n\n#include <cassert>\n#include <sstream>\n\n#include \"base\/intmath.hh\"\n#include \"base\/logging.hh\"\n\nFALRU::FALRU(const Params *p)\n : BaseTags(p),\n\n cacheTracking(p->min_tracked_cache_size, size, blkSize)\n{\n if (!isPowerOf2(blkSize))\n fatal(\"cache block size (in bytes) `%d' must be a power of two\",\n blkSize);\n if (!isPowerOf2(size))\n fatal(\"Cache Size must be power of 2 for now\");\n\n blks = new FALRUBlk[numBlocks];\n\n head = &(blks[0]);\n head->prev = nullptr;\n head->next = &(blks[1]);\n head->set = 0;\n head->way = 0;\n head->data = &dataBlks[0];\n\n for (unsigned i = 1; i < numBlocks - 1; i++) {\n blks[i].prev = &(blks[i-1]);\n blks[i].next = &(blks[i+1]);\n blks[i].set = 0;\n blks[i].way = i;\n\n \/\/ Associate a data chunk to the block\n blks[i].data = &dataBlks[blkSize*i];\n }\n\n tail = &(blks[numBlocks - 1]);\n tail->prev = &(blks[numBlocks - 2]);\n tail->next = nullptr;\n tail->set = 0;\n tail->way = numBlocks - 1;\n tail->data = &dataBlks[(numBlocks - 1) * blkSize];\n\n cacheTracking.init(head, tail);\n}\n\nFALRU::~FALRU()\n{\n delete[] blks;\n}\n\nvoid\nFALRU::regStats()\n{\n BaseTags::regStats();\n cacheTracking.regStats(name());\n}\n\nFALRUBlk *\nFALRU::hashLookup(Addr addr) const\n{\n tagIterator iter = tagHash.find(addr);\n if (iter != tagHash.end()) {\n return (*iter).second;\n }\n return nullptr;\n}\n\nvoid\nFALRU::invalidate(CacheBlk *blk)\n{\n BaseTags::invalidate(blk);\n\n \/\/ Move the block to the tail to make it the next victim\n moveToTail((FALRUBlk*)blk);\n\n \/\/ Erase block entry in the hash table\n tagHash.erase(blk->tag);\n}\n\nCacheBlk*\nFALRU::accessBlock(Addr addr, bool is_secure, Cycles &lat)\n{\n return accessBlock(addr, is_secure, lat, 0);\n}\n\nCacheBlk*\nFALRU::accessBlock(Addr addr, bool is_secure, Cycles &lat,\n CachesMask *in_caches_mask)\n{\n CachesMask mask = 0;\n Addr blkAddr = blkAlign(addr);\n FALRUBlk* blk = hashLookup(blkAddr);\n\n if (blk && blk->isValid()) {\n \/\/ If a cache hit\n lat = accessLatency;\n \/\/ Check if the block to be accessed is available. If not,\n \/\/ apply the accessLatency on top of block->whenReady.\n if (blk->whenReady > curTick() &&\n cache->ticksToCycles(blk->whenReady - curTick()) >\n accessLatency) {\n lat = cache->ticksToCycles(blk->whenReady - curTick()) +\n accessLatency;\n }\n assert(blk->tag == blkAddr);\n mask = blk->inCachesMask;\n moveToHead(blk);\n } else {\n \/\/ If a cache miss\n lat = lookupLatency;\n blk = nullptr;\n }\n if (in_caches_mask) {\n *in_caches_mask = mask;\n }\n\n cacheTracking.recordAccess(blk);\n\n return blk;\n}\n\n\nCacheBlk*\nFALRU::findBlock(Addr addr, bool is_secure) const\n{\n Addr blkAddr = blkAlign(addr);\n FALRUBlk* blk = hashLookup(blkAddr);\n\n if (blk && blk->isValid()) {\n assert(blk->tag == blkAddr);\n assert(blk->isSecure() == is_secure);\n } else {\n blk = nullptr;\n }\n return blk;\n}\n\nCacheBlk*\nFALRU::findBlockBySetAndWay(int set, int way) const\n{\n assert(set == 0);\n return &blks[way];\n}\n\nCacheBlk*\nFALRU::findVictim(Addr addr)\n{\n return tail;\n}\n\nvoid\nFALRU::insertBlock(PacketPtr pkt, CacheBlk *blk)\n{\n FALRUBlk* falruBlk = static_cast<FALRUBlk*>(blk);\n\n \/\/ Make sure block is not present in the cache\n assert(falruBlk->inCachesMask == 0);\n\n \/\/ Do common block insertion functionality\n BaseTags::insertBlock(pkt, blk);\n\n \/\/ New block is the MRU\n moveToHead(falruBlk);\n\n \/\/ Insert new block in the hash table\n tagHash[falruBlk->tag] = falruBlk;\n}\n\nvoid\nFALRU::moveToHead(FALRUBlk *blk)\n{\n \/\/ If block is not already head, do the moving\n if (blk != head) {\n cacheTracking.moveBlockToHead(blk);\n \/\/ If block is tail, set previous block as new tail\n if (blk == tail){\n assert(blk->next == nullptr);\n tail = blk->prev;\n tail->next = nullptr;\n \/\/ Inform block's surrounding blocks that it has been moved\n } else {\n blk->prev->next = blk->next;\n blk->next->prev = blk->prev;\n }\n\n \/\/ Swap pointers\n blk->next = head;\n blk->prev = nullptr;\n head->prev = blk;\n head = blk;\n\n cacheTracking.check(head, tail);\n }\n}\n\nvoid\nFALRU::moveToTail(FALRUBlk *blk)\n{\n \/\/ If block is not already tail, do the moving\n if (blk != tail) {\n cacheTracking.moveBlockToTail(blk);\n \/\/ If block is head, set next block as new head\n if (blk == head){\n assert(blk->prev == nullptr);\n head = blk->next;\n head->prev = nullptr;\n \/\/ Inform block's surrounding blocks that it has been moved\n } else {\n blk->prev->next = blk->next;\n blk->next->prev = blk->prev;\n }\n\n \/\/ Swap pointers\n blk->prev = tail;\n blk->next = nullptr;\n tail->next = blk;\n tail = blk;\n\n cacheTracking.check(head, tail);\n }\n}\n\nFALRU *\nFALRUParams::create()\n{\n return new FALRU(this);\n}\n\nvoid\nFALRU::CacheTracking::check(FALRUBlk *head, FALRUBlk *tail)\n{\n#ifdef FALRU_DEBUG\n FALRUBlk* blk = head;\n unsigned curr_size = 0;\n unsigned tracked_cache_size = minTrackedSize;\n CachesMask in_caches_mask = inAllCachesMask;\n int j = 0;\n\n while (blk) {\n panic_if(blk->inCachesMask != in_caches_mask, \"Expected cache mask \"\n \"%x found %x\", blk->inCachesMask, in_caches_mask);\n\n curr_size += blkSize;\n if (curr_size == tracked_cache_size && blk != tail) {\n panic_if(boundaries[j] != blk, \"Unexpected boundary for the %d-th \"\n \"cache\", j);\n tracked_cache_size <<= 1;\n \/\/ from this point, blocks fit only in the larger caches\n in_caches_mask &= ~(1U << j);\n ++j;\n }\n blk = blk->next;\n }\n#endif \/\/ FALRU_DEBUG\n}\n\nvoid\nFALRU::CacheTracking::init(FALRUBlk *head, FALRUBlk *tail)\n{\n \/\/ early exit if we are not tracking any extra caches\n FALRUBlk* blk = numTrackedCaches ? head : nullptr;\n unsigned curr_size = 0;\n unsigned tracked_cache_size = minTrackedSize;\n CachesMask in_caches_mask = inAllCachesMask;\n int j = 0;\n\n while (blk) {\n blk->inCachesMask = in_caches_mask;\n\n curr_size += blkSize;\n if (curr_size == tracked_cache_size && blk != tail) {\n boundaries[j] = blk;\n\n tracked_cache_size <<= 1;\n \/\/ from this point, blocks fit only in the larger caches\n in_caches_mask &= ~(1U << j);\n ++j;\n }\n blk = blk->next;\n }\n}\n\n\nvoid\nFALRU::CacheTracking::moveBlockToHead(FALRUBlk *blk)\n{\n \/\/ Get the mask of all caches, in which the block didn't fit\n \/\/ before moving it to the head\n CachesMask update_caches_mask = inAllCachesMask ^ blk->inCachesMask;\n\n for (int i = 0; i < numTrackedCaches; i++) {\n CachesMask current_cache_mask = 1U << i;\n if (current_cache_mask & update_caches_mask) {\n \/\/ if the ith cache didn't fit the block (before it is moved to\n \/\/ the head), move the ith boundary 1 block closer to the\n \/\/ MRU\n boundaries[i]->inCachesMask &= ~current_cache_mask;\n boundaries[i] = boundaries[i]->prev;\n } else if (boundaries[i] == blk) {\n \/\/ Make sure the boundary doesn't point to the block\n \/\/ we are about to move\n boundaries[i] = blk->prev;\n }\n }\n\n \/\/ Make block reside in all caches\n blk->inCachesMask = inAllCachesMask;\n}\n\nvoid\nFALRU::CacheTracking::moveBlockToTail(FALRUBlk *blk)\n{\n CachesMask update_caches_mask = blk->inCachesMask;\n\n for (int i = 0; i < numTrackedCaches; i++) {\n CachesMask current_cache_mask = 1U << i;\n if (current_cache_mask & update_caches_mask) {\n \/\/ if the ith cache fitted the block (before it is moved to\n \/\/ the tail), move the ith boundary 1 block closer to the\n \/\/ LRU\n boundaries[i] = boundaries[i]->next;\n if (boundaries[i] == blk) {\n \/\/ Make sure the boundary doesn't point to the block\n \/\/ we are about to move\n boundaries[i] = blk->next;\n }\n boundaries[i]->inCachesMask |= current_cache_mask;\n }\n }\n\n \/\/ The block now fits only in the actual cache\n blk->inCachesMask = 0;\n}\n\nvoid\nFALRU::CacheTracking::recordAccess(FALRUBlk *blk)\n{\n for (int i = 0; i < numTrackedCaches; i++) {\n if (blk && ((1U << i) & blk->inCachesMask)) {\n hits[i]++;\n } else {\n misses[i]++;\n }\n }\n\n \/\/ Record stats for the actual cache too\n if (blk) {\n hits[numTrackedCaches]++;\n } else {\n misses[numTrackedCaches]++;\n }\n\n accesses++;\n}\n\nvoid\nprintSize(std::ostream &stream, size_t size)\n{\n static const char *SIZES[] = { \"B\", \"kB\", \"MB\", \"GB\", \"TB\", \"ZB\" };\n int div = 0;\n while (size >= 1024 && div < (sizeof SIZES \/ sizeof *SIZES)) {\n div++;\n size >>= 10;\n }\n stream << size << SIZES[div];\n}\n\nvoid\nFALRU::CacheTracking::regStats(std::string name)\n{\n hits\n .init(numTrackedCaches + 1)\n .name(name + \".falru_hits\")\n .desc(\"The number of hits in each cache size.\")\n ;\n misses\n .init(numTrackedCaches + 1)\n .name(name + \".falru_misses\")\n .desc(\"The number of misses in each cache size.\")\n ;\n accesses\n .name(name + \".falru_accesses\")\n .desc(\"The number of accesses to the FA LRU cache.\")\n ;\n\n for (unsigned i = 0; i < numTrackedCaches + 1; ++i) {\n std::stringstream size_str;\n printSize(size_str, minTrackedSize << i);\n hits.subname(i, size_str.str());\n hits.subdesc(i, \"Hits in a \" + size_str.str() + \" cache\");\n misses.subname(i, size_str.str());\n misses.subdesc(i, \"Misses in a \" + size_str.str() + \" cache\");\n }\n}\n<|endoftext|>"} {"text":"<commit_before>\/*\n * This file is part of the UnTech Editor Suite.\n * Copyright (c) 2016 - 2018, Marcus Rowe <undisbeliever@gmail.com>.\n * Distributed under The MIT License: https:\/\/opensource.org\/licenses\/MIT\n *\/\n\n#include \"multipleselectiontableview.h\"\n#include \"abstractaccessors.h\"\n#include \"accessor.h\"\n#include \"listaccessortablemanager.h\"\n#include \"gui-qt\/common\/properties\/propertydelegate.h\"\n#include \"gui-qt\/common\/properties\/propertytablemodel.h\"\n\n#include <QContextMenuEvent>\n#include <QCoreApplication>\n#include <QIcon>\n#include <QLocale>\n#include <QMenu>\n\nusing namespace UnTech;\nusing namespace UnTech::GuiQt::Accessor;\n\nMultipleSelectionTableView::MultipleSelectionTableView(QWidget* parent)\n : QTreeView(parent)\n , _actions(new MultiListActions(this))\n , _delegate(new PropertyDelegate(this))\n , _selectedContextMenu(new QMenu(this))\n , _noSelectionContextMenu(new QMenu(this))\n , _model(nullptr)\n , _accessors()\n{\n setItemDelegate(_delegate);\n\n setEditTriggers(EditTrigger::AllEditTriggers);\n\n setSelectionMode(SelectionMode::ExtendedSelection);\n setSelectionBehavior(SelectionBehavior::SelectRows);\n\n rebuildMenus();\n}\n\nvoid MultipleSelectionTableView::setPropertyManagers(const QList<ListAccessorTableManager*>& managers,\n const QStringList& columns)\n{\n if (auto* sm = selectionModel()) {\n sm->deleteLater();\n }\n if (_model) {\n _model->deleteLater();\n\n for (auto* m : _model->managers()) {\n m->disconnect(this);\n }\n }\n\n if (!managers.isEmpty()) {\n QList<GuiQt::PropertyTableManager*> pManagers;\n pManagers.reserve(managers.size());\n for (auto* m : managers) {\n pManagers.append(m);\n }\n _model = new PropertyTableModel(pManagers, columns, this);\n }\n else {\n _model = nullptr;\n }\n QTreeView::setModel(_model);\n\n _actions->setNAccessors(managers.size());\n\n onAccessorsChanged();\n\n rebuildMenus();\n\n if (_model) {\n connect(this->selectionModel(), &QItemSelectionModel::selectionChanged,\n this, &MultipleSelectionTableView::onViewSelectionChanged);\n }\n for (auto* manager : managers) {\n connect(manager, &ListAccessorTableManager::accessorChanged,\n this, &MultipleSelectionTableView::onAccessorsChanged);\n }\n}\n\nvoid MultipleSelectionTableView::onAccessorsChanged()\n{\n auto newAccessors = buildAccessorsList();\n\n if (_accessors.empty() && newAccessors.empty()) {\n return;\n }\n\n for (auto* a : _accessors) {\n a->disconnect(this);\n }\n _accessors = newAccessors;\n\n _actions->setAccessors(_accessors);\n onAccessorSelectedIndexesChanged();\n\n for (auto* a : newAccessors) {\n connect(a, &AbstractListMultipleSelectionAccessor::selectedIndexesChanged,\n this, &MultipleSelectionTableView::onAccessorSelectedIndexesChanged);\n }\n}\n\nQList<AbstractListMultipleSelectionAccessor*> MultipleSelectionTableView::buildAccessorsList()\n{\n QList<AbstractListMultipleSelectionAccessor*> ret;\n\n if (_model == nullptr) {\n return ret;\n }\n\n const auto& managers = _model->managers();\n ret.reserve(managers.size());\n\n for (auto* manager : managers) {\n auto* laManager = qobject_cast<ListAccessorTableManager*>(manager);\n auto* accessor = laManager ? laManager->accessor() : nullptr;\n auto* multiSelectionAccessor = qobject_cast<AbstractListMultipleSelectionAccessor*>(accessor);\n\n if (multiSelectionAccessor == nullptr) {\n ret.clear();\n break;\n }\n ret.append(multiSelectionAccessor);\n }\n\n return ret;\n}\n\nvoid MultipleSelectionTableView::onAccessorSelectedIndexesChanged()\n{\n QItemSelection sel;\n\n for (int aId = 0; aId < _accessors.size(); aId++) {\n if (auto* accessor = _accessors.at(aId)) {\n for (auto si : accessor->selectedIndexes()) {\n QModelIndex index = _model->toModelIndex(aId, si);\n if (index.isValid()) {\n sel.select(index, index);\n }\n }\n }\n }\n selectionModel()->select(\n sel, QItemSelectionModel::ClearAndSelect | QItemSelectionModel::Rows);\n\n \/\/ BUGFIX: Sometimes the view will not hightlight the new selection\n viewport()->update();\n}\n\nvoid MultipleSelectionTableView::onViewSelectionChanged()\n{\n const auto selectedRows = selectionModel()->selectedRows();\n\n for (int aId = 0; aId < _accessors.size(); aId++) {\n if (auto* accessor = _accessors.at(aId)) {\n std::vector<size_t> selected;\n selected.reserve(selectedRows.size());\n\n for (const auto& index : selectedRows) {\n auto mi = _model->toManagerIdAndIndex(index);\n if (mi.first == aId) {\n selected.push_back(mi.second);\n }\n }\n accessor->setSelectedIndexes(std::move(selected));\n }\n }\n}\n\nvoid MultipleSelectionTableView::setModel(QAbstractItemModel*)\n{\n qCritical(\"Must not call setModel in MultipleSelectionTableView.\");\n}\n\nvoid MultipleSelectionTableView::rebuildMenus()\n{\n _selectedContextMenu->clear();\n _noSelectionContextMenu->clear();\n\n _actions->populateMenu(_selectedContextMenu, true);\n _actions->populateMenuWithAddActions(_noSelectionContextMenu);\n}\n\nvoid MultipleSelectionTableView::contextMenuEvent(QContextMenuEvent* event)\n{\n if (_model == nullptr) {\n return;\n }\n\n if (_actions->remove->isEnabled()) {\n _selectedContextMenu->exec(event->globalPos());\n }\n else {\n _noSelectionContextMenu->exec(event->globalPos());\n }\n}\n<commit_msg>Change MultipleSelectionTableView settings to match ListAccessorTableView<commit_after>\/*\n * This file is part of the UnTech Editor Suite.\n * Copyright (c) 2016 - 2018, Marcus Rowe <undisbeliever@gmail.com>.\n * Distributed under The MIT License: https:\/\/opensource.org\/licenses\/MIT\n *\/\n\n#include \"multipleselectiontableview.h\"\n#include \"abstractaccessors.h\"\n#include \"accessor.h\"\n#include \"listaccessortablemanager.h\"\n#include \"gui-qt\/common\/properties\/propertydelegate.h\"\n#include \"gui-qt\/common\/properties\/propertytablemodel.h\"\n\n#include <QContextMenuEvent>\n#include <QCoreApplication>\n#include <QIcon>\n#include <QLocale>\n#include <QMenu>\n\nusing namespace UnTech;\nusing namespace UnTech::GuiQt::Accessor;\n\nMultipleSelectionTableView::MultipleSelectionTableView(QWidget* parent)\n : QTreeView(parent)\n , _actions(new MultiListActions(this))\n , _delegate(new PropertyDelegate(this))\n , _selectedContextMenu(new QMenu(this))\n , _noSelectionContextMenu(new QMenu(this))\n , _model(nullptr)\n , _accessors()\n{\n setItemDelegate(_delegate);\n\n setDragDropMode(QTreeView::InternalMove);\n\n setEditTriggers(EditTriggers(AllEditTriggers).setFlag(CurrentChanged, false));\n setAlternatingRowColors(true);\n\n setSelectionMode(SelectionMode::ExtendedSelection);\n setSelectionBehavior(SelectionBehavior::SelectRows);\n\n rebuildMenus();\n}\n\nvoid MultipleSelectionTableView::setPropertyManagers(const QList<ListAccessorTableManager*>& managers,\n const QStringList& columns)\n{\n if (auto* sm = selectionModel()) {\n sm->deleteLater();\n }\n if (_model) {\n _model->deleteLater();\n\n for (auto* m : _model->managers()) {\n m->disconnect(this);\n }\n }\n\n if (!managers.isEmpty()) {\n QList<GuiQt::PropertyTableManager*> pManagers;\n pManagers.reserve(managers.size());\n for (auto* m : managers) {\n pManagers.append(m);\n }\n _model = new PropertyTableModel(pManagers, columns, this);\n }\n else {\n _model = nullptr;\n }\n QTreeView::setModel(_model);\n\n _actions->setNAccessors(managers.size());\n\n onAccessorsChanged();\n\n rebuildMenus();\n\n if (_model) {\n connect(this->selectionModel(), &QItemSelectionModel::selectionChanged,\n this, &MultipleSelectionTableView::onViewSelectionChanged);\n }\n for (auto* manager : managers) {\n connect(manager, &ListAccessorTableManager::accessorChanged,\n this, &MultipleSelectionTableView::onAccessorsChanged);\n }\n}\n\nvoid MultipleSelectionTableView::onAccessorsChanged()\n{\n auto newAccessors = buildAccessorsList();\n\n if (_accessors.empty() && newAccessors.empty()) {\n return;\n }\n\n for (auto* a : _accessors) {\n a->disconnect(this);\n }\n _accessors = newAccessors;\n\n _actions->setAccessors(_accessors);\n onAccessorSelectedIndexesChanged();\n\n for (auto* a : newAccessors) {\n connect(a, &AbstractListMultipleSelectionAccessor::selectedIndexesChanged,\n this, &MultipleSelectionTableView::onAccessorSelectedIndexesChanged);\n }\n}\n\nQList<AbstractListMultipleSelectionAccessor*> MultipleSelectionTableView::buildAccessorsList()\n{\n QList<AbstractListMultipleSelectionAccessor*> ret;\n\n if (_model == nullptr) {\n return ret;\n }\n\n const auto& managers = _model->managers();\n ret.reserve(managers.size());\n\n for (auto* manager : managers) {\n auto* laManager = qobject_cast<ListAccessorTableManager*>(manager);\n auto* accessor = laManager ? laManager->accessor() : nullptr;\n auto* multiSelectionAccessor = qobject_cast<AbstractListMultipleSelectionAccessor*>(accessor);\n\n if (multiSelectionAccessor == nullptr) {\n ret.clear();\n break;\n }\n ret.append(multiSelectionAccessor);\n }\n\n return ret;\n}\n\nvoid MultipleSelectionTableView::onAccessorSelectedIndexesChanged()\n{\n QItemSelection sel;\n\n for (int aId = 0; aId < _accessors.size(); aId++) {\n if (auto* accessor = _accessors.at(aId)) {\n for (auto si : accessor->selectedIndexes()) {\n QModelIndex index = _model->toModelIndex(aId, si);\n if (index.isValid()) {\n sel.select(index, index);\n }\n }\n }\n }\n selectionModel()->select(\n sel, QItemSelectionModel::ClearAndSelect | QItemSelectionModel::Rows);\n\n \/\/ BUGFIX: Sometimes the view will not hightlight the new selection\n viewport()->update();\n}\n\nvoid MultipleSelectionTableView::onViewSelectionChanged()\n{\n const auto selectedRows = selectionModel()->selectedRows();\n\n for (int aId = 0; aId < _accessors.size(); aId++) {\n if (auto* accessor = _accessors.at(aId)) {\n std::vector<size_t> selected;\n selected.reserve(selectedRows.size());\n\n for (const auto& index : selectedRows) {\n auto mi = _model->toManagerIdAndIndex(index);\n if (mi.first == aId) {\n selected.push_back(mi.second);\n }\n }\n accessor->setSelectedIndexes(std::move(selected));\n }\n }\n}\n\nvoid MultipleSelectionTableView::setModel(QAbstractItemModel*)\n{\n qCritical(\"Must not call setModel in MultipleSelectionTableView.\");\n}\n\nvoid MultipleSelectionTableView::rebuildMenus()\n{\n _selectedContextMenu->clear();\n _noSelectionContextMenu->clear();\n\n _actions->populateMenu(_selectedContextMenu, true);\n _actions->populateMenuWithAddActions(_noSelectionContextMenu);\n}\n\nvoid MultipleSelectionTableView::contextMenuEvent(QContextMenuEvent* event)\n{\n if (_model == nullptr) {\n return;\n }\n\n if (_actions->remove->isEnabled()) {\n _selectedContextMenu->exec(event->globalPos());\n }\n else {\n _noSelectionContextMenu->exec(event->globalPos());\n }\n}\n<|endoftext|>"} {"text":"<commit_before>\/*\nCopyright (c) 2015-2017 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\/* HIT_START\n * BUILD: %t %s ..\/..\/test_common.cpp\n * RUN: %t\n * HIT_END\n *\/\n\n#include\"test_common.h\"\n\nstruct {\n float a;\n int b;\n void *c;\n} Struct ;\n\nint main(){\n int *iPtr;\n float *fPtr;\n struct Struct *sPtr;\n size_t sSetSize = 1024, sGetSize;\n hipMalloc(&iPtr, sSetSize);\n hipMalloc(&fPtr, sSetSize);\n hipMalloc(&sPtr, sSetSize);\n hipMemPtrGetInfo(iPtr, &sGetSize);\n assert(sGetSize == sSetSize);\n hipMemPtrGetInfo(fPtr, &sGetSize);\n assert(sGetSize == sSetSize);\n hipMemPtrGetInfo(sPtr, &sGetSize);\n assert(sGetSize == sSetSize);\n passed();\n}\n<commit_msg>Disable hipMemPtrGetInfo test on nvcc path<commit_after>\/*\nCopyright (c) 2015-2017 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\/* HIT_START\n * BUILD: %t %s ..\/..\/test_common.cpp EXCLUDE_HIP_PLATFORM nvcc\n * RUN: %t\n * HIT_END\n *\/\n\n#include\"test_common.h\"\n\nstruct {\n float a;\n int b;\n void *c;\n} Struct ;\n\nint main(){\n int *iPtr;\n float *fPtr;\n struct Struct *sPtr;\n size_t sSetSize = 1024, sGetSize;\n hipMalloc(&iPtr, sSetSize);\n hipMalloc(&fPtr, sSetSize);\n hipMalloc(&sPtr, sSetSize);\n hipMemPtrGetInfo(iPtr, &sGetSize);\n assert(sGetSize == sSetSize);\n hipMemPtrGetInfo(fPtr, &sGetSize);\n assert(sGetSize == sSetSize);\n hipMemPtrGetInfo(sPtr, &sGetSize);\n assert(sGetSize == sSetSize);\n passed();\n}\n<|endoftext|>"} {"text":"<commit_before>\/\/===- lli.cpp - LLVM Interpreter \/ Dynamic compiler ----------------------===\/\/\n\/\/\n\/\/ This utility provides a way to execute LLVM bytecode without static\n\/\/ compilation. This consists of a very simple and slow (but portable)\n\/\/ interpreter, along with capability for system specific dynamic compilers. At\n\/\/ runtime, the fastest (stable) execution engine is selected to run the\n\/\/ program. This means the JIT compiler for the current platform if it's\n\/\/ available.\n\/\/\n\/\/===----------------------------------------------------------------------===\/\/\n\n#include \"ExecutionEngine.h\"\n#include \"Support\/CommandLine.h\"\n#include \"llvm\/Bytecode\/Reader.h\"\n#include \"llvm\/Module.h\"\n#include \"llvm\/Target\/TargetMachineImpls.h\"\n\nnamespace {\n cl::opt<std::string>\n InputFile(cl::desc(\"<input bytecode>\"), cl::Positional, cl::init(\"-\"));\n\n cl::list<std::string>\n InputArgv(cl::ConsumeAfter, cl::desc(\"<program arguments>...\"));\n\n cl::opt<std::string>\n MainFunction (\"f\", cl::desc(\"Function to execute\"), cl::init(\"main\"),\n\t\tcl::value_desc(\"function name\"));\n\n cl::opt<bool> DebugMode(\"d\", cl::desc(\"Start program in debugger\"));\n\n cl::opt<bool> TraceMode(\"trace\", cl::desc(\"Enable Tracing\"));\n\n cl::opt<bool> ForceInterpreter(\"force-interpreter\",\n\t\t\t\t cl::desc(\"Force interpretation: disable JIT\"),\n\t\t\t\t cl::init(false));\n}\n\n\/\/===----------------------------------------------------------------------===\/\/\n\/\/ ExecutionEngine Class Implementation\n\/\/\n\nExecutionEngine::~ExecutionEngine() {\n delete &CurMod;\n}\n\n\/\/===----------------------------------------------------------------------===\/\/\n\/\/ main Driver function\n\/\/\nint main(int argc, char** argv, const char ** envp) {\n cl::ParseCommandLineOptions(argc, argv,\n\t\t\t \" llvm interpreter & dynamic compiler\\n\");\n\n \/\/ Load the bytecode...\n std::string ErrorMsg;\n Module *M = ParseBytecodeFile(InputFile, &ErrorMsg);\n if (M == 0) {\n std::cout << \"Error parsing '\" << InputFile << \"': \"\n << ErrorMsg << \"\\n\";\n exit(1);\n }\n\n#if 0\n \/\/ Link in the runtime library for LLI...\n std::string RuntimeLib = getCurrentExecutablePath();\n if (!RuntimeLib.empty()) RuntimeLib += \"\/\";\n RuntimeLib += \"RuntimeLib.bc\";\n\n if (Module *SupportLib = ParseBytecodeFile(RuntimeLib, &ErrorMsg)) {\n if (LinkModules(M, SupportLib, &ErrorMsg))\n std::cerr << \"Error Linking runtime library into current module: \"\n << ErrorMsg << \"\\n\";\n } else {\n std::cerr << \"Error loading runtime library '\"+RuntimeLib+\"': \"\n << ErrorMsg << \"\\n\";\n }\n#endif\n\n ExecutionEngine *EE = 0;\n\n \/\/ If there is nothing that is forcing us to use the interpreter, make a JIT.\n if (!ForceInterpreter && !DebugMode && !TraceMode)\n EE = ExecutionEngine::createJIT(M);\n\n \/\/ If we can't make a JIT, make an interpreter instead.\n if (EE == 0)\n EE = ExecutionEngine::createInterpreter(M, DebugMode, TraceMode);\n\n \/\/ Add the module name to the start of the argv vector...\n \/\/ But delete .bc first, since programs (and users) might not expect to\n \/\/ see it.\n const std::string ByteCodeFileSuffix (\".bc\");\n if (InputFile.rfind (ByteCodeFileSuffix) ==\n InputFile.length () - ByteCodeFileSuffix.length ()) {\n InputFile.erase (InputFile.length () - ByteCodeFileSuffix.length ());\n }\n InputArgv.insert(InputArgv.begin(), InputFile);\n\n \/\/ Run the main function!\n int ExitCode = EE->run(MainFunction, InputArgv, envp);\n\n \/\/ Now that we are done executing the program, shut down the execution engine\n delete EE;\n return ExitCode;\n}\n<commit_msg>Remove some long-dead code<commit_after>\/\/===- lli.cpp - LLVM Interpreter \/ Dynamic compiler ----------------------===\/\/\n\/\/\n\/\/ This utility provides a way to execute LLVM bytecode without static\n\/\/ compilation. This consists of a very simple and slow (but portable)\n\/\/ interpreter, along with capability for system specific dynamic compilers. At\n\/\/ runtime, the fastest (stable) execution engine is selected to run the\n\/\/ program. This means the JIT compiler for the current platform if it's\n\/\/ available.\n\/\/\n\/\/===----------------------------------------------------------------------===\/\/\n\n#include \"ExecutionEngine.h\"\n#include \"Support\/CommandLine.h\"\n#include \"llvm\/Bytecode\/Reader.h\"\n#include \"llvm\/Module.h\"\n#include \"llvm\/Target\/TargetMachineImpls.h\"\n\nnamespace {\n cl::opt<std::string>\n InputFile(cl::desc(\"<input bytecode>\"), cl::Positional, cl::init(\"-\"));\n\n cl::list<std::string>\n InputArgv(cl::ConsumeAfter, cl::desc(\"<program arguments>...\"));\n\n cl::opt<std::string>\n MainFunction (\"f\", cl::desc(\"Function to execute\"), cl::init(\"main\"),\n\t\tcl::value_desc(\"function name\"));\n\n cl::opt<bool> DebugMode(\"d\", cl::desc(\"Start program in debugger\"));\n\n cl::opt<bool> TraceMode(\"trace\", cl::desc(\"Enable Tracing\"));\n\n cl::opt<bool> ForceInterpreter(\"force-interpreter\",\n\t\t\t\t cl::desc(\"Force interpretation: disable JIT\"),\n\t\t\t\t cl::init(false));\n}\n\n\/\/===----------------------------------------------------------------------===\/\/\n\/\/ ExecutionEngine Class Implementation\n\/\/\n\nExecutionEngine::~ExecutionEngine() {\n delete &CurMod;\n}\n\n\/\/===----------------------------------------------------------------------===\/\/\n\/\/ main Driver function\n\/\/\nint main(int argc, char** argv, const char ** envp) {\n cl::ParseCommandLineOptions(argc, argv,\n\t\t\t \" llvm interpreter & dynamic compiler\\n\");\n\n \/\/ Load the bytecode...\n std::string ErrorMsg;\n Module *M = ParseBytecodeFile(InputFile, &ErrorMsg);\n if (M == 0) {\n std::cout << \"Error parsing '\" << InputFile << \"': \"\n << ErrorMsg << \"\\n\";\n exit(1);\n }\n\n ExecutionEngine *EE = 0;\n\n \/\/ If there is nothing that is forcing us to use the interpreter, make a JIT.\n if (!ForceInterpreter && !DebugMode && !TraceMode)\n EE = ExecutionEngine::createJIT(M);\n\n \/\/ If we can't make a JIT, make an interpreter instead.\n if (EE == 0)\n EE = ExecutionEngine::createInterpreter(M, DebugMode, TraceMode);\n\n \/\/ Add the module name to the start of the argv vector...\n \/\/ But delete .bc first, since programs (and users) might not expect to\n \/\/ see it.\n const std::string ByteCodeFileSuffix (\".bc\");\n if (InputFile.rfind (ByteCodeFileSuffix) ==\n InputFile.length () - ByteCodeFileSuffix.length ()) {\n InputFile.erase (InputFile.length () - ByteCodeFileSuffix.length ());\n }\n InputArgv.insert(InputArgv.begin(), InputFile);\n\n \/\/ Run the main function!\n int ExitCode = EE->run(MainFunction, InputArgv, envp);\n\n \/\/ Now that we are done executing the program, shut down the execution engine\n delete EE;\n return ExitCode;\n}\n<|endoftext|>"} {"text":"<commit_before>#include \"itkImage.h\"\n#include \"itkImageFileReader.h\"\n#include \"itkImageFileWriter.h\"\n#include \"itkCannyEdgeDetectionImageFilter.h\"\n#include \"itkRescaleIntensityImageFilter.h\"\n#include <itkNeighborhoodIterator.h>\n\n\n#include \"antsUtilities.h\"\n#include <algorithm>\n\n\n\n#include <iomanip>\n#include <iostream>\n#include <ostream>\n#include <sstream>\n\nnamespace ants\n{\ntemplate <unsigned int ImageDimension>\nint LesionFilling( int argc, char * argv[] )\n{\n typedef int LesionType;\n typedef itk::Image<LesionType, ImageDimension> LesionImageType;\n typedef itk::ImageFileReader<LesionImageType> LesionReaderType;\n\n typedef int T1Type;\n typedef itk::Image<LesionType, ImageDimension> T1ImageType;\n typedef itk::ImageFileReader<LesionImageType> T1ReaderType;\n \n typedef double RealPixelType; \/\/ Operations\n\n const int * ImageDimension = argv[1];\n const char * method = argv[2];\n const char * LesionMapFileName = argv[3];\n if (method == \"-neighbourVoxels\")\n {\n const char * T1FileName = argv[4]\n }\n else\n {\n const char * WMFileName = argv[4]\n const char * T1FileName = argv[5]\n }\n\n\n typename LesionReaderType::Pointer LesionReader = LesionReaderType::New();\n LesionReader->SetFileName( LesionMapFileName );\n LesionReader->Update();\n \n if (method == \"-neighbourVoxels\")\n {\n\n \/\/Neighbouring voxel\n \/\/filling lesions with the voxels surrounding them\n \/\/first finding the edges of lesions\n \n typedef itk::BinaryDilateImageFilter<\n InputImageType,\n OutputImageType,\n StructuringElementType > DilateFilterType;\n \n DilateFilterType::Pointer binaryDilate = DilateFilterType::New();\n \n binaryDilate->SetKernel( structuringElement );\n\n float variance = 1.0;\n float upperThreshold = 0.0;\n float lowerThreshold = 0.0;\n typedef itk::CastImageFilter< LesionImageType, RealImageType>\n CastToRealFilterType;\n typedef itk::CannyEdgeDetectionImageFilter<RealImageType, RealImageType> CannyFilter;\n\n CastToRealFilterType::Pointer toReal = CastToRealFilterType::New();\n toReal->SetInput( LesionReader->GetOutput() );\n CannyFilter::Pointer cannyFilter = CannyFilter::New();\n \n cannyFilter->SetInput( toReal->GetOutput() );\n \n cannyFilter->SetVariance( variance );\n cannyFilter->SetUpperThreshold( upperThreshold );\n cannyFilter->SetLowerThreshold( lowerThreshold );\n \n \/* LesionFilling d -neighbourVoxels binaryLeisonMap T1\n * LesionFilling d -mean binaryLesionMap AtroposWM T1\n * LesionFilling d -median binaryLesionmap AtroposWM T1\n * LesionFilling d -randomSample binaryLesionMap AtroposWM T1\n *\/\n<commit_msg>neighbourhood voxel detection with binary dilation filter<commit_after>#include <algorithm>\n#include <iomanip>\n#include <iostream>\n#include <ostream>\n#include <sstream>\n#include \"itkImage.h\"\n#include \"itkImageFileReader.h\"\n#include \"itkImageFileWriter.h\"\n#include \"itkSubtractImageFilter.h\"\n#include \"itkBinaryDilateImageFilter.h\"\n#include \"itkBinaryBallStructuringElement.h\"\n#include \"antsUtilities.h\"\n#include \"itkMaskImageFilter.h\"\n\nnamespace ants\n{\ntemplate <unsigned int ImageDimension>\nint LesionFilling( int argc, char * argv[] )\n{\n typedef int LesionType;\n typedef itk::Image<LesionType, ImageDimension> LesionImageType;\n typedef itk::ImageFileReader<LesionImageType> LesionReaderType;\n\n typedef int T1Type;\n typedef itk::Image<LesionType, ImageDimension> T1ImageType;\n typedef itk::ImageFileReader<LesionImageType> T1ReaderType;\n \n typedef double RealPixelType; \/\/ Operations\n\n const int * ImageDimension = argv[1];\n const char * method = argv[2];\n const char * LesionMapFileName = argv[3];\n if (method == \"-neighbourVoxels\")\n {\n const char * T1FileName = argv[4]\n }\n else\n {\n const char * WMFileName = argv[4]\n const char * T1FileName = argv[5]\n }\n\n\n typename LesionReaderType::Pointer LesionReader = LesionReaderType::New();\n LesionReader->SetFileName( LesionMapFileName );\n LesionReader->Update();\n \n if (method == \"-neighbourVoxels\")\n {\n typedef itk::BinaryBallStructuringElement<\n InputPixelType,\n Dimension > StructuringElementType;\n \/\/Neighbouring voxel\n \/\/filling lesions with the voxels surrounding them\n \/\/first finding the edges of lesions\n \/\/by subtracting dilated lesion map from lesion map itself\n typedef itk::BinaryDilateImageFilter<\n InputImageType,\n OutputImageType,\n StructuringElementType > DilateFilterType;\n DilateFilterType::Pointer binaryDilate = DilateFilterType::New();\n structuringElement.SetRadius( 1 ); \/\/ 3x3 structuring element\n structuringElement.CreateStructuringElement();\n binaryDilate->SetKernel( structuringElement );\n typedef itk::CastImageFilter< LesionImageType, RealImageType>\n CastToRealFilterType;\n CastToRealFilterType::Pointer toReal = CastToRealFilterType::New();\n toReal->SetInput( LesionReader->GetOutput() );\n binaryDilate->SetInput( toReal->GetOutput() );\n binaryDilate->SetDilateValue( 1 );\n \/\/ subtract dilated image form non-dilated one\n typedef itk::SubtractImageFilter <ImageType, ImageType >\n SubtractImageFilterType;\n SubtractImageFilterType::Pointer subtractFilter\n = SubtractImageFilterType::New ();\n \/\/output = image1 - image2\n subtractFilter->SetInput1(toReal->GetOutput() );\n subtractFilter->SetInput2(binaryDilate->GetOutput());\n subtractFilter->Update();\n \/\/multiply the outer lesion mask with T1 to get only the neighbouring voxels\n \n\n\n\n\n \/* LesionFilling d -neighbourVoxels binaryLeisonMap T1\n * LesionFilling d -mean binaryLesionMap AtroposWM T1\n * LesionFilling d -median binaryLesionmap AtroposWM T1\n * LesionFilling d -randomSample binaryLesionMap AtroposWM T1\n *\/\n<|endoftext|>"} {"text":"<commit_before>\/******************************************************************************\n * ____ _ _____ *\n * \/ ___| \/ \\ | ___| C++ *\n * | | \/ _ \\ | |_ Actor *\n * | |___ \/ ___ \\| _| Framework *\n * \\____\/_\/ \\_|_| *\n * *\n * Copyright 2011-2018 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#pragma once\n\n#include <string>\n#include <utility>\n#include <functional>\n\n#include \"caf\/fwd.hpp\"\n#include \"caf\/none.hpp\"\n#include \"caf\/group_module.hpp\"\n#include \"caf\/intrusive_ptr.hpp\"\n#include \"caf\/abstract_group.hpp\"\n\n#include \"caf\/detail\/comparable.hpp\"\n#include \"caf\/detail\/type_traits.hpp\"\n\nnamespace caf {\n\nstruct invalid_group_t {\n constexpr invalid_group_t() = default;\n};\n\n\/\/\/ Identifies an invalid {@link group}.\n\/\/\/ @relates group\nconstexpr invalid_group_t invalid_group = invalid_group_t{};\n\nclass group : detail::comparable<group>,\n detail::comparable<group, invalid_group_t> {\npublic:\n template <class, class, int>\n friend class actor_cast_access;\n\n using signatures = none_t;\n\n group() = default;\n\n group(group&&) = default;\n\n group(const group&) = default;\n\n group(const invalid_group_t&);\n\n group& operator=(group&&) = default;\n\n group& operator=(const group&) = default;\n\n group& operator=(const invalid_group_t&);\n\n group(abstract_group*);\n\n group(intrusive_ptr<abstract_group> gptr);\n\n inline explicit operator bool() const noexcept {\n return static_cast<bool>(ptr_);\n }\n\n inline bool operator!() const noexcept {\n return !ptr_;\n }\n\n static intptr_t compare(const abstract_group* lhs, const abstract_group* rhs);\n\n intptr_t compare(const group& other) const noexcept;\n\n inline intptr_t compare(const invalid_group_t&) const noexcept {\n return ptr_ ? 1 : 0;\n }\n\n template <class Inspector>\n friend typename Inspector::result_type inspect(Inspector& f, group& x) {\n std::string x_id;\n std::string x_mod;\n auto ptr = x.get();\n if (ptr) {\n x_id = ptr->identifier();\n x_mod = ptr->module().name();\n }\n return f(meta::type_name(\"group\"),\n meta::omittable_if_empty(), x_id,\n meta::omittable_if_empty(), x_mod);\n }\n\n friend error inspect(serializer&, group&);\n\n friend error inspect(deserializer&, group&);\n\n inline abstract_group* get() const noexcept {\n return ptr_.get();\n }\n\n \/\/\/ @cond PRIVATE\n\n template <class... Ts>\n void eq_impl(message_id mid, strong_actor_ptr sender,\n execution_unit* ctx, Ts&&... xs) const {\n CAF_ASSERT(!mid.is_request());\n if (ptr_)\n ptr_->enqueue(std::move(sender), mid,\n make_message(std::forward<Ts>(xs)...), ctx);\n }\n\n inline bool subscribe(strong_actor_ptr who) const {\n if (!ptr_)\n return false;\n return ptr_->subscribe(std::move(who));\n }\n\n inline void unsubscribe(const actor_control_block* who) const {\n if (ptr_)\n ptr_->unsubscribe(who);\n }\n\n \/\/\/ CAF's messaging primitives assume a non-null guarantee. A group\n \/\/\/ object indirects pointer-like access to a group to prevent UB.\n inline const group* operator->() const noexcept {\n return this;\n }\n\n \/\/\/ @endcond\n\nprivate:\n inline abstract_group* release() noexcept {\n return ptr_.release();\n }\n\n group(abstract_group*, bool);\n\n abstract_group_ptr ptr_;\n};\n\n\/\/\/ @relates group\nstd::string to_string(const group& x);\n\n} \/\/ namespace caf\n\nnamespace std {\ntemplate <>\nstruct hash<caf::group> {\n inline size_t operator()(const caf::group& x) const {\n \/\/ groups are singleton objects, the address is thus the best possible hash\n return !x ? 0 : reinterpret_cast<size_t>(x.get());\n }\n};\n} \/\/ namespace std\n\n<commit_msg>Remove unnecessary friend declaration<commit_after>\/******************************************************************************\n * ____ _ _____ *\n * \/ ___| \/ \\ | ___| C++ *\n * | | \/ _ \\ | |_ Actor *\n * | |___ \/ ___ \\| _| Framework *\n * \\____\/_\/ \\_|_| *\n * *\n * Copyright 2011-2018 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#pragma once\n\n#include <string>\n#include <utility>\n#include <functional>\n\n#include \"caf\/fwd.hpp\"\n#include \"caf\/none.hpp\"\n#include \"caf\/group_module.hpp\"\n#include \"caf\/intrusive_ptr.hpp\"\n#include \"caf\/abstract_group.hpp\"\n\n#include \"caf\/detail\/comparable.hpp\"\n#include \"caf\/detail\/type_traits.hpp\"\n\nnamespace caf {\n\nstruct invalid_group_t {\n constexpr invalid_group_t() = default;\n};\n\n\/\/\/ Identifies an invalid {@link group}.\n\/\/\/ @relates group\nconstexpr invalid_group_t invalid_group = invalid_group_t{};\n\nclass group : detail::comparable<group>,\n detail::comparable<group, invalid_group_t> {\npublic:\n using signatures = none_t;\n\n group() = default;\n\n group(group&&) = default;\n\n group(const group&) = default;\n\n group(const invalid_group_t&);\n\n group& operator=(group&&) = default;\n\n group& operator=(const group&) = default;\n\n group& operator=(const invalid_group_t&);\n\n group(abstract_group*);\n\n group(intrusive_ptr<abstract_group> gptr);\n\n inline explicit operator bool() const noexcept {\n return static_cast<bool>(ptr_);\n }\n\n inline bool operator!() const noexcept {\n return !ptr_;\n }\n\n static intptr_t compare(const abstract_group* lhs, const abstract_group* rhs);\n\n intptr_t compare(const group& other) const noexcept;\n\n inline intptr_t compare(const invalid_group_t&) const noexcept {\n return ptr_ ? 1 : 0;\n }\n\n template <class Inspector>\n friend typename Inspector::result_type inspect(Inspector& f, group& x) {\n std::string x_id;\n std::string x_mod;\n auto ptr = x.get();\n if (ptr) {\n x_id = ptr->identifier();\n x_mod = ptr->module().name();\n }\n return f(meta::type_name(\"group\"),\n meta::omittable_if_empty(), x_id,\n meta::omittable_if_empty(), x_mod);\n }\n\n friend error inspect(serializer&, group&);\n\n friend error inspect(deserializer&, group&);\n\n inline abstract_group* get() const noexcept {\n return ptr_.get();\n }\n\n \/\/\/ @cond PRIVATE\n\n template <class... Ts>\n void eq_impl(message_id mid, strong_actor_ptr sender,\n execution_unit* ctx, Ts&&... xs) const {\n CAF_ASSERT(!mid.is_request());\n if (ptr_)\n ptr_->enqueue(std::move(sender), mid,\n make_message(std::forward<Ts>(xs)...), ctx);\n }\n\n inline bool subscribe(strong_actor_ptr who) const {\n if (!ptr_)\n return false;\n return ptr_->subscribe(std::move(who));\n }\n\n inline void unsubscribe(const actor_control_block* who) const {\n if (ptr_)\n ptr_->unsubscribe(who);\n }\n\n \/\/\/ CAF's messaging primitives assume a non-null guarantee. A group\n \/\/\/ object indirects pointer-like access to a group to prevent UB.\n inline const group* operator->() const noexcept {\n return this;\n }\n\n \/\/\/ @endcond\n\nprivate:\n inline abstract_group* release() noexcept {\n return ptr_.release();\n }\n\n group(abstract_group*, bool);\n\n abstract_group_ptr ptr_;\n};\n\n\/\/\/ @relates group\nstd::string to_string(const group& x);\n\n} \/\/ namespace caf\n\nnamespace std {\ntemplate <>\nstruct hash<caf::group> {\n inline size_t operator()(const caf::group& x) const {\n \/\/ groups are singleton objects, the address is thus the best possible hash\n return !x ? 0 : reinterpret_cast<size_t>(x.get());\n }\n};\n} \/\/ namespace std\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_OPERATORS_INTERFACES_HH\n#define DUNE_GDT_OPERATORS_INTERFACES_HH\n\n#include <type_traits>\n\n#include <dune\/stuff\/common\/disable_warnings.hh>\n#include <dune\/common\/dynmatrix.hh>\n#include <dune\/common\/fvector.hh>\n#include <dune\/stuff\/common\/reenable_warnings.hh>\n\n#include <dune\/stuff\/common\/crtp.hh>\n#include <dune\/stuff\/functions\/interfaces.hh>\n#include <dune\/stuff\/la\/container\/interfaces.hh>\n#include <dune\/stuff\/la\/container\/pattern.hh>\n#include <dune\/stuff\/la\/solver.hh>\n#include <dune\/stuff\/common\/configuration.hh>\n\n#include <dune\/gdt\/spaces\/interface.hh>\n#include <dune\/gdt\/discretefunction\/default.hh>\n\n#include \"..\/products\/interfaces.hh\"\n\nnamespace Dune {\nnamespace GDT {\n\n\ntemplate <class Traits>\nclass OperatorInterface : public ProductInterface<Traits>\n{\n typedef ProductInterface<Traits> BaseType;\n\npublic:\n using typename BaseType::GridViewType;\n using typename BaseType::FieldType;\n\n template <class SourceType, class RangeType>\n void apply(const SourceType& source, RangeType& range) const\n {\n CHECK_CRTP(this->as_imp(*this).apply(source, range));\n return this->as_imp(*this).apply(source, range);\n }\n\n template <class S, class R>\n FieldType apply2(const Stuff::LA::VectorInterface<S, FieldType>& source,\n const Stuff::LA::VectorInterface<R, FieldType>& range) const\n {\n auto tmp = range.copy();\n apply(source.as_imp(source), tmp);\n return range.dot(tmp);\n } \/\/ ... apply2(...)\n\n template <class SS, class SV, class RS, class RV>\n FieldType apply2(const ConstDiscreteFunction<SS, SV>& source, const ConstDiscreteFunction<RS, RV>& range) const\n {\n auto tmp_vector = range.copy();\n DiscreteFunction<RS, RV> tmp_function(range.space(), tmp_vector);\n apply(source, tmp_function);\n return range.vector().dot(tmp_vector);\n }\n}; \/\/ class OperatorInterface\n\n\ntemplate <class Traits>\nclass LocalizableOperatorInterface : public Stuff::CRTPInterface<LocalizableOperatorInterface<Traits>, Traits>\n{\n typedef typename Traits::derived_type derived_type;\n typedef typename Traits::GridViewType GridViewType;\n typedef typename Traits::SourceType SourceType;\n typedef typename Traits::RangeType RangeType;\n typedef typename Traits::FieldType FieldType;\n\n typedef typename GridViewType::template Codim<0>::Entity EntityType;\n typedef typename GridViewType::ctype DomainFieldType;\n static const unsigned int dimDomain = GridViewType::dimension;\n\nprivate:\n static_assert(std::is_base_of<Stuff::IsLocalizableFunction, SourceType>::value,\n \"SourceType has to be derived from Stuff::IsLocalizableFunction!\");\n static_assert(std::is_base_of<DiscreteFunction<typename RangeType::SpaceType, typename RangeType::VectorType>,\n RangeType>::value,\n \"RangeType has to be derived from DiscreteFunction!\");\n static_assert(std::is_same<typename SourceType::EntityType, EntityType>::value,\n \"The EntityType of SourceType and GridViewType have to match!\");\n static_assert(std::is_same<typename RangeType::EntityType, EntityType>::value,\n \"The EntityType of RangeType and GridViewType have to match!\");\n static_assert(std::is_same<typename SourceType::DomainFieldType, DomainFieldType>::value,\n \"The DomainFieldType of SourceType and GridViewType have to match!\");\n static_assert(std::is_same<typename RangeType::DomainFieldType, DomainFieldType>::value,\n \"The DomainFieldType of RangeType and GridViewType have to match!\");\n static_assert(SourceType::dimDomain == dimDomain, \"The dimDomain of SourceType and GridViewType have to match!\");\n static_assert(RangeType::dimDomain == dimDomain, \"The dimDomain of RangeType and GridViewType have to match!\");\n\npublic:\n const GridViewType& grid_view() const\n {\n CHECK_CRTP(this->as_imp(*this).grid_view());\n return this->as_imp(*this).grid_view();\n }\n\n const SourceType& source() const\n {\n CHECK_CRTP(this->as_imp(*this).source());\n return this->as_imp(*this).source();\n }\n\n const RangeType& range() const\n {\n CHECK_CRTP(this->as_imp(*this).range());\n return this->as_imp(*this).range();\n }\n\n RangeType& range()\n {\n CHECK_CRTP(this->as_imp(*this).range());\n return this->as_imp(*this).range();\n }\n\n void apply()\n {\n CHECK_AND_CALL_CRTP(this->as_imp(*this).apply());\n }\n}; \/\/ class LocalizableOperatorInterface\n\n\ntemplate <class Traits>\nclass AssemblableOperatorInterface : public AssemblableProductInterface<Traits>\n{\n typedef AssemblableProductInterface<Traits> BaseType;\n\npublic:\n typedef typename BaseType::derived_type derived_type;\n\n using typename BaseType::GridViewType;\n using typename BaseType::FieldType;\n using typename BaseType::SourceSpaceType;\n using typename BaseType::RangeSpaceType;\n using typename BaseType::MatrixType;\n\n using typename BaseType::EntityType;\n using typename BaseType::DomainFieldType;\n using BaseType::dimDomain;\n using typename BaseType::PatternType;\n\n template <class S, class R>\n void apply(const Stuff::LA::VectorInterface<S, DomainFieldType>& source,\n Stuff::LA::VectorInterface<R, FieldType>& range)\n {\n CHECK_CRTP(this->as_imp(*this).apply(source.as_imp(source), range.as_imp(range)));\n return this->as_imp(*this).apply(source.as_imp(source), range.as_imp(range));\n }\n\n template <class S, class R>\n void apply(const ConstDiscreteFunction<SourceSpaceType, S>& source, ConstDiscreteFunction<RangeSpaceType, R>& range)\n {\n apply(source.vector(), range.vector());\n }\n\n static std::vector<std::string> invert_options()\n {\n return derived_type::invert_options();\n }\n\n static Stuff::Common::Configuration invert_options(const std::string& type)\n {\n return derived_type::invert_options(type);\n }\n\n template <class R, class S>\n void apply_inverse(const Stuff::LA::VectorInterface<R, FieldType>& range,\n const Stuff::LA::VectorInterface<S, FieldType>& source)\n {\n apply_inverse(range, source, invert_options()[0]);\n }\n\n template <class R, class S>\n void apply_inverse(const Stuff::LA::VectorInterface<R, FieldType>& range,\n Stuff::LA::VectorInterface<S, FieldType>& source, const std::string& opt)\n {\n apply_inverse(range, source, invert_options(opt));\n }\n\n template <class R, class S>\n void apply_inverse(const Stuff::LA::VectorInterface<R, FieldType>& range,\n Stuff::LA::VectorInterface<S, FieldType>& source, const Stuff::Common::Configuration& opts)\n {\n CHECK_CRTP(this->as_imp(*this).apply_inverse(range.as_imp(range), source.as_imp(source), opts));\n return this->as_imp(*this).apply_inverse(range.as_imp(range), source.as_imp(source), opts);\n }\n\n template <class R, class S>\n void apply_inverse(const ConstDiscreteFunction<SourceSpaceType, R>& range,\n ConstDiscreteFunction<RangeSpaceType, S>& source)\n {\n apply_inverse(range.vector(), source.vector());\n }\n\n template <class R, class S>\n void apply_inverse(const ConstDiscreteFunction<SourceSpaceType, R>& range,\n ConstDiscreteFunction<RangeSpaceType, S>& source, const std::string& opt)\n {\n apply_inverse(range.vector(), source.vector(), opt);\n }\n\n template <class R, class S>\n void apply_inverse(const ConstDiscreteFunction<SourceSpaceType, R>& range,\n ConstDiscreteFunction<RangeSpaceType, S>& source, const Stuff::Common::Configuration& opts)\n {\n apply_inverse(range.vector(), source.vector(), opts);\n }\n\n template <class R, class S, class P>\n FieldType apply2(const Stuff::LA::VectorInterface<R, FieldType>& range,\n const Stuff::LA::VectorInterface<S, FieldType>& source,\n const AssemblableProductInterface<P>& product)\n {\n auto tmp = range.copy();\n apply(source, tmp);\n return product.apply2(tmp, source);\n }\n\n template <class R, class S>\n FieldType apply2(const Stuff::LA::VectorInterface<R, FieldType>& range,\n const Stuff::LA::VectorInterface<S, FieldType>& source)\n {\n this->assemble();\n auto tmp = range.copy();\n this->matrix().mv(source.as_imp(), tmp);\n return range.dot(tmp);\n }\n\n template <class S, class R>\n FieldType apply2(const ConstDiscreteFunction<SourceSpaceType, S>& source,\n const ConstDiscreteFunction<RangeSpaceType, R>& range)\n {\n return apply2(range.vector(), source.vector());\n }\n}; \/\/ class AssemblableOperatorInterface\n\n\n} \/\/ namespace GDT\n} \/\/ namespace Dune\n\n#endif \/\/ DUNE_GDT_OPERATORS_INTERFACES_HH\n<commit_msg>[operators.interfaces] do not guard dune includes<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_OPERATORS_INTERFACES_HH\n#define DUNE_GDT_OPERATORS_INTERFACES_HH\n\n#include <type_traits>\n\n#include <dune\/common\/dynmatrix.hh>\n#include <dune\/common\/fvector.hh>\n\n#include <dune\/stuff\/common\/crtp.hh>\n#include <dune\/stuff\/functions\/interfaces.hh>\n#include <dune\/stuff\/la\/container\/interfaces.hh>\n#include <dune\/stuff\/la\/container\/pattern.hh>\n#include <dune\/stuff\/la\/solver.hh>\n#include <dune\/stuff\/common\/configuration.hh>\n\n#include <dune\/gdt\/spaces\/interface.hh>\n#include <dune\/gdt\/discretefunction\/default.hh>\n\n#include \"..\/products\/interfaces.hh\"\n\nnamespace Dune {\nnamespace GDT {\n\n\ntemplate <class Traits>\nclass OperatorInterface : public ProductInterface<Traits>\n{\n typedef ProductInterface<Traits> BaseType;\n\npublic:\n using typename BaseType::GridViewType;\n using typename BaseType::FieldType;\n\n template <class SourceType, class RangeType>\n void apply(const SourceType& source, RangeType& range) const\n {\n CHECK_CRTP(this->as_imp(*this).apply(source, range));\n return this->as_imp(*this).apply(source, range);\n }\n\n template <class S, class R>\n FieldType apply2(const Stuff::LA::VectorInterface<S, FieldType>& source,\n const Stuff::LA::VectorInterface<R, FieldType>& range) const\n {\n auto tmp = range.copy();\n apply(source.as_imp(source), tmp);\n return range.dot(tmp);\n } \/\/ ... apply2(...)\n\n template <class SS, class SV, class RS, class RV>\n FieldType apply2(const ConstDiscreteFunction<SS, SV>& source, const ConstDiscreteFunction<RS, RV>& range) const\n {\n auto tmp_vector = range.copy();\n DiscreteFunction<RS, RV> tmp_function(range.space(), tmp_vector);\n apply(source, tmp_function);\n return range.vector().dot(tmp_vector);\n }\n}; \/\/ class OperatorInterface\n\n\ntemplate <class Traits>\nclass LocalizableOperatorInterface : public Stuff::CRTPInterface<LocalizableOperatorInterface<Traits>, Traits>\n{\n typedef typename Traits::derived_type derived_type;\n typedef typename Traits::GridViewType GridViewType;\n typedef typename Traits::SourceType SourceType;\n typedef typename Traits::RangeType RangeType;\n typedef typename Traits::FieldType FieldType;\n\n typedef typename GridViewType::template Codim<0>::Entity EntityType;\n typedef typename GridViewType::ctype DomainFieldType;\n static const unsigned int dimDomain = GridViewType::dimension;\n\nprivate:\n static_assert(std::is_base_of<Stuff::IsLocalizableFunction, SourceType>::value,\n \"SourceType has to be derived from Stuff::IsLocalizableFunction!\");\n static_assert(std::is_base_of<DiscreteFunction<typename RangeType::SpaceType, typename RangeType::VectorType>,\n RangeType>::value,\n \"RangeType has to be derived from DiscreteFunction!\");\n static_assert(std::is_same<typename SourceType::EntityType, EntityType>::value,\n \"The EntityType of SourceType and GridViewType have to match!\");\n static_assert(std::is_same<typename RangeType::EntityType, EntityType>::value,\n \"The EntityType of RangeType and GridViewType have to match!\");\n static_assert(std::is_same<typename SourceType::DomainFieldType, DomainFieldType>::value,\n \"The DomainFieldType of SourceType and GridViewType have to match!\");\n static_assert(std::is_same<typename RangeType::DomainFieldType, DomainFieldType>::value,\n \"The DomainFieldType of RangeType and GridViewType have to match!\");\n static_assert(SourceType::dimDomain == dimDomain, \"The dimDomain of SourceType and GridViewType have to match!\");\n static_assert(RangeType::dimDomain == dimDomain, \"The dimDomain of RangeType and GridViewType have to match!\");\n\npublic:\n const GridViewType& grid_view() const\n {\n CHECK_CRTP(this->as_imp(*this).grid_view());\n return this->as_imp(*this).grid_view();\n }\n\n const SourceType& source() const\n {\n CHECK_CRTP(this->as_imp(*this).source());\n return this->as_imp(*this).source();\n }\n\n const RangeType& range() const\n {\n CHECK_CRTP(this->as_imp(*this).range());\n return this->as_imp(*this).range();\n }\n\n RangeType& range()\n {\n CHECK_CRTP(this->as_imp(*this).range());\n return this->as_imp(*this).range();\n }\n\n void apply()\n {\n CHECK_AND_CALL_CRTP(this->as_imp(*this).apply());\n }\n}; \/\/ class LocalizableOperatorInterface\n\n\ntemplate <class Traits>\nclass AssemblableOperatorInterface : public AssemblableProductInterface<Traits>\n{\n typedef AssemblableProductInterface<Traits> BaseType;\n\npublic:\n typedef typename BaseType::derived_type derived_type;\n\n using typename BaseType::GridViewType;\n using typename BaseType::FieldType;\n using typename BaseType::SourceSpaceType;\n using typename BaseType::RangeSpaceType;\n using typename BaseType::MatrixType;\n\n using typename BaseType::EntityType;\n using typename BaseType::DomainFieldType;\n using BaseType::dimDomain;\n using typename BaseType::PatternType;\n\n template <class S, class R>\n void apply(const Stuff::LA::VectorInterface<S, DomainFieldType>& source,\n Stuff::LA::VectorInterface<R, FieldType>& range)\n {\n CHECK_CRTP(this->as_imp(*this).apply(source.as_imp(source), range.as_imp(range)));\n return this->as_imp(*this).apply(source.as_imp(source), range.as_imp(range));\n }\n\n template <class S, class R>\n void apply(const ConstDiscreteFunction<SourceSpaceType, S>& source, ConstDiscreteFunction<RangeSpaceType, R>& range)\n {\n apply(source.vector(), range.vector());\n }\n\n static std::vector<std::string> invert_options()\n {\n return derived_type::invert_options();\n }\n\n static Stuff::Common::Configuration invert_options(const std::string& type)\n {\n return derived_type::invert_options(type);\n }\n\n template <class R, class S>\n void apply_inverse(const Stuff::LA::VectorInterface<R, FieldType>& range,\n const Stuff::LA::VectorInterface<S, FieldType>& source)\n {\n apply_inverse(range, source, invert_options()[0]);\n }\n\n template <class R, class S>\n void apply_inverse(const Stuff::LA::VectorInterface<R, FieldType>& range,\n Stuff::LA::VectorInterface<S, FieldType>& source, const std::string& opt)\n {\n apply_inverse(range, source, invert_options(opt));\n }\n\n template <class R, class S>\n void apply_inverse(const Stuff::LA::VectorInterface<R, FieldType>& range,\n Stuff::LA::VectorInterface<S, FieldType>& source, const Stuff::Common::Configuration& opts)\n {\n CHECK_CRTP(this->as_imp(*this).apply_inverse(range.as_imp(range), source.as_imp(source), opts));\n return this->as_imp(*this).apply_inverse(range.as_imp(range), source.as_imp(source), opts);\n }\n\n template <class R, class S>\n void apply_inverse(const ConstDiscreteFunction<SourceSpaceType, R>& range,\n ConstDiscreteFunction<RangeSpaceType, S>& source)\n {\n apply_inverse(range.vector(), source.vector());\n }\n\n template <class R, class S>\n void apply_inverse(const ConstDiscreteFunction<SourceSpaceType, R>& range,\n ConstDiscreteFunction<RangeSpaceType, S>& source, const std::string& opt)\n {\n apply_inverse(range.vector(), source.vector(), opt);\n }\n\n template <class R, class S>\n void apply_inverse(const ConstDiscreteFunction<SourceSpaceType, R>& range,\n ConstDiscreteFunction<RangeSpaceType, S>& source, const Stuff::Common::Configuration& opts)\n {\n apply_inverse(range.vector(), source.vector(), opts);\n }\n\n template <class R, class S, class P>\n FieldType apply2(const Stuff::LA::VectorInterface<R, FieldType>& range,\n const Stuff::LA::VectorInterface<S, FieldType>& source,\n const AssemblableProductInterface<P>& product)\n {\n auto tmp = range.copy();\n apply(source, tmp);\n return product.apply2(tmp, source);\n }\n\n template <class R, class S>\n FieldType apply2(const Stuff::LA::VectorInterface<R, FieldType>& range,\n const Stuff::LA::VectorInterface<S, FieldType>& source)\n {\n this->assemble();\n auto tmp = range.copy();\n this->matrix().mv(source.as_imp(), tmp);\n return range.dot(tmp);\n }\n\n template <class S, class R>\n FieldType apply2(const ConstDiscreteFunction<SourceSpaceType, S>& source,\n const ConstDiscreteFunction<RangeSpaceType, R>& range)\n {\n return apply2(range.vector(), source.vector());\n }\n}; \/\/ class AssemblableOperatorInterface\n\n\n} \/\/ namespace GDT\n} \/\/ namespace Dune\n\n#endif \/\/ DUNE_GDT_OPERATORS_INTERFACES_HH\n<|endoftext|>"} {"text":"<commit_before>\/\/ This file is part of the dune-stuff project:\n\/\/ https:\/\/users.dune-project.org\/projects\/dune-stuff\n\/\/ Copyright holders: Rene Milk, Felix Schindler\n\/\/ License: BSD 2-Clause License (http:\/\/opensource.org\/licenses\/BSD-2-Clause)\n\/\/\n\/\/ Contributors: Kirsten Weber\n\n#ifndef DUNE_STUFF_FUNCTIONS_CONSTANT_HH\n#define DUNE_STUFF_FUNCTIONS_CONSTANT_HH\n\n#include <memory>\n\n#include <dune\/stuff\/common\/configtree.hh>\n\n#include \"interfaces.hh\"\n\nnamespace Dune {\nnamespace Stuff {\nnamespace Functions {\n\n\ntemplate< class EntityImp, class DomainFieldImp, int domainDim, class RangeFieldImp, int rangeDim, int rangeDimCols = 1 >\nclass Constant\n : public GlobalFunctionInterface< EntityImp, DomainFieldImp, domainDim, RangeFieldImp, rangeDim, rangeDimCols>\n{\n\npublic:\n typedef GlobalFunctionInterface< EntityImp, DomainFieldImp, domainDim, RangeFieldImp, rangeDim, rangeDimCols > BaseType;\n typedef Constant < EntityImp, DomainFieldImp, domainDim, RangeFieldImp, rangeDim, rangeDimCols > ThisType;\n typedef typename BaseType::RangeType RangeType;\n typedef typename BaseType::DomainType DomainType;\n typedef typename BaseType::JacobianRangeType JacobianRangeType;\n\n using typename BaseType::LocalfunctionType;\n\n static std::string static_id()\n {\n return BaseType::static_id() + \".constant\";\n }\n\n static Common::ConfigTree default_config(const std::string sub_name = \"\")\n {\n Common::ConfigTree config;\n config[\"value\"] = \"1.0\";\n config[\"name\"] = static_id();\n if (sub_name.empty())\n return config;\n else {\n Common::ConfigTree tmp;\n tmp.add(config, sub_name);\n return tmp;\n }\n } \/\/ ... default_config(...)\n\n static std::unique_ptr< ThisType > create(const Common::ConfigTree config = default_config(), const std::string sub_name = static_id())\n {\n \/\/ get correct config\n const Common::ConfigTree cfg = config.has_sub(sub_name) ? config.sub(sub_name) : config;\n const Common::ConfigTree default_cfg = default_config();\n \/\/create\n return Common::make_unique< ThisType >(\n cfg.get(\"value\", default_cfg.get< RangeType >(\"value\")),\n cfg.get(\"name\", default_cfg.get< std::string >(\"name\")));\n } \/\/ ... create(...)\n\n explicit Constant(const RangeType& constant, const std::string name = static_id())\n : constant_(constant)\n , name_(name)\n {}\n\n explicit Constant(const RangeFieldImp& constant, const std::string name = static_id())\n : constant_(constant)\n , name_(name)\n {}\n\n Constant(const ThisType& other)\n : constant_(other.constant_)\n , name_(other.name_)\n {}\n\n virtual std::string type() const DS_OVERRIDE\n {\n return BaseType::static_id() + \".constant\";\n }\n\n virtual size_t order() const DS_OVERRIDE DS_FINAL\n {\n return 0;\n }\n\n virtual void evaluate(const DomainType& \/*x*\/, RangeType& ret) const DS_OVERRIDE DS_FINAL\n {\n ret = constant_;\n }\n\n virtual void jacobian(const DomainType& \/*x*\/, JacobianRangeType& ret) const DS_OVERRIDE DS_FINAL\n {\n ret *= 0.0;\n }\n\n virtual std::string name() const DS_OVERRIDE DS_FINAL\n {\n return name_;\n }\n\nprivate:\n const RangeType constant_;\n const std::string name_;\n};\n\n\n} \/\/ namespace Functions\n} \/\/ namespace Stuff\n} \/\/ namespace Dune\n\n#ifdef DUNE_STUFF_FUNCTIONS_TO_LIB\n# define DUNE_STUFF_FUNCTIONS_CONSTANT_LIST_DIMRANGE(etype, ddim) \\\n DUNE_STUFF_FUNCTIONS_CONSTANT_LIST_DIMRANGECOLS(etype, ddim, 1) \\\n DUNE_STUFF_FUNCTIONS_CONSTANT_LIST_DIMRANGECOLS(etype, ddim, 2) \\\n DUNE_STUFF_FUNCTIONS_CONSTANT_LIST_DIMRANGECOLS(etype, ddim, 3)\n\n# define DUNE_STUFF_FUNCTIONS_CONSTANT_LIST_DIMRANGECOLS(etype, ddim, rdim) \\\n DUNE_STUFF_FUNCTIONS_CONSTANT_LIST_DOMAINFIELDTYPES(etype, ddim, rdim, 1) \\\n DUNE_STUFF_FUNCTIONS_CONSTANT_LIST_DOMAINFIELDTYPES(etype, ddim, rdim, 2) \\\n DUNE_STUFF_FUNCTIONS_CONSTANT_LIST_DOMAINFIELDTYPES(etype, ddim, rdim, 3)\n\n# define DUNE_STUFF_FUNCTIONS_CONSTANT_LIST_DOMAINFIELDTYPES(etype, ddim, rdim, rcdim) \\\n DUNE_STUFF_FUNCTIONS_CONSTANT_LIST_RANGEFIELDTYPES(etype, double, ddim, rdim, rcdim)\n\n# define DUNE_STUFF_FUNCTIONS_CONSTANT_LIST_RANGEFIELDTYPES(etype, dftype, ddim, rdim, rcdim) \\\n DUNE_STUFF_FUNCTIONS_CONSTANT_LAST_EXPANSION(etype, dftype, ddim, double, rdim, rcdim) \\\n DUNE_STUFF_FUNCTIONS_CONSTANT_LAST_EXPANSION(etype, dftype, ddim, long double, rdim, rcdim)\n\n# define DUNE_STUFF_FUNCTIONS_CONSTANT_LAST_EXPANSION(etype, dftype, ddim, rftype, rdim, rcdim) \\\n extern template class Dune::Stuff::Functions::Constant< etype, dftype, ddim, rftype, rdim, rcdim >;\n\nDUNE_STUFF_FUNCTIONS_CONSTANT_LIST_DIMRANGE(DuneStuffFunctionsInterfacesFake1dEntityType, 1)\nDUNE_STUFF_FUNCTIONS_CONSTANT_LIST_DIMRANGE(DuneStuffFunctionsInterfacesFake2dEntityType, 2)\nDUNE_STUFF_FUNCTIONS_CONSTANT_LIST_DIMRANGE(DuneStuffFunctionsInterfacesFake3dEntityType, 3)\n\n# if HAVE_DUNE_GRID\n\nDUNE_STUFF_FUNCTIONS_CONSTANT_LIST_DIMRANGE(DuneStuffFunctionsInterfacesSGrid1dEntityType, 1)\nDUNE_STUFF_FUNCTIONS_CONSTANT_LIST_DIMRANGE(DuneStuffFunctionsInterfacesSGrid2dEntityType, 2)\nDUNE_STUFF_FUNCTIONS_CONSTANT_LIST_DIMRANGE(DuneStuffFunctionsInterfacesSGrid3dEntityType, 3)\n\nDUNE_STUFF_FUNCTIONS_CONSTANT_LIST_DIMRANGE(DuneStuffFunctionsInterfacesYaspGrid1dEntityType, 1)\nDUNE_STUFF_FUNCTIONS_CONSTANT_LIST_DIMRANGE(DuneStuffFunctionsInterfacesYaspGrid2dEntityType, 2)\nDUNE_STUFF_FUNCTIONS_CONSTANT_LIST_DIMRANGE(DuneStuffFunctionsInterfacesYaspGrid3dEntityType, 3)\n\n# if HAVE_ALUGRID_SERIAL_H || HAVE_ALUGRID_PARALLEL_H\n\nDUNE_STUFF_FUNCTIONS_CONSTANT_LIST_DIMRANGE(DuneStuffFunctionsInterfacesAluSimplexGrid2dEntityType, 2)\nDUNE_STUFF_FUNCTIONS_CONSTANT_LIST_DIMRANGE(DuneStuffFunctionsInterfacesAluSimplexGrid3dEntityType, 3)\nDUNE_STUFF_FUNCTIONS_CONSTANT_LIST_DIMRANGE(DuneStuffFunctionsInterfacesAluCubeGrid3dEntityType, 3)\n\n# endif \/\/ HAVE_ALUGRID_SERIAL_H || HAVE_ALUGRID_PARALLEL_H\n# endif \/\/ HAVE_DUNE_GRID\n\n# undef DUNE_STUFF_FUNCTIONS_CONSTANT_LAST_EXPANSION\n# undef DUNE_STUFF_FUNCTIONS_CONSTANT_LIST_RANGEFIELDTYPES\n# undef DUNE_STUFF_FUNCTIONS_CONSTANT_LIST_DOMAINFIELDTYPES\n# undef DUNE_STUFF_FUNCTIONS_CONSTANT_LIST_DIMRANGECOLS\n# undef DUNE_STUFF_FUNCTIONS_CONSTANT_LIST_DIMRANGE\n# endif \/\/ DUNE_STUFF_FUNCTIONS_TO_LIB\n\n#endif \/\/ DUNE_STUFF_FUNCTIONS_CONSTANT_HH\n<commit_msg>[functions.constant] implement default_config() for all dimensions<commit_after>\/\/ This file is part of the dune-stuff project:\n\/\/ https:\/\/users.dune-project.org\/projects\/dune-stuff\n\/\/ Copyright holders: Rene Milk, Felix Schindler\n\/\/ License: BSD 2-Clause License (http:\/\/opensource.org\/licenses\/BSD-2-Clause)\n\/\/\n\/\/ Contributors: Kirsten Weber\n\n#ifndef DUNE_STUFF_FUNCTIONS_CONSTANT_HH\n#define DUNE_STUFF_FUNCTIONS_CONSTANT_HH\n\n#include <memory>\n\n#include <dune\/stuff\/common\/configtree.hh>\n\n#include \"interfaces.hh\"\n\nnamespace Dune {\nnamespace Stuff {\nnamespace Functions {\n\n\ntemplate< class EntityImp, class DomainFieldImp, int domainDim, class RangeFieldImp, int rangeDim, int rangeDimCols = 1 >\nclass Constant\n : public GlobalFunctionInterface< EntityImp, DomainFieldImp, domainDim, RangeFieldImp, rangeDim, rangeDimCols>\n{\n typedef GlobalFunctionInterface< EntityImp, DomainFieldImp, domainDim, RangeFieldImp, rangeDim, rangeDimCols > BaseType;\n typedef Constant < EntityImp, DomainFieldImp, domainDim, RangeFieldImp, rangeDim, rangeDimCols > ThisType;\n\n template< class R, int r, int rC >\n struct Get{ static std::string value_str()\n {\n std::string str = \"[\";\n for (size_t rr = 0; rr < r; ++rr) {\n if (rr > 0)\n str += \"; \";\n str += \"[\";\n for (size_t cc = 0; cc < rC; ++cc) {\n if (cc > 0)\n str += \" \";\n if (cc == rr)\n str += \"1\";\n else\n str += \"0\";\n }\n str += \"]\";\n }\n str += \"]\";\n return str;\n } };\n\n template< class R, int rC >\n struct Get< R, 1, rC >{ static std::string value_str()\n {\n std::string str = \"[\";\n for (size_t cc = 0; cc < rC; ++cc) {\n if (cc > 0)\n str += \"; \";\n str += \"1\";\n }\n str += \"]\";\n return str;\n } };\n\n template< class R, int r >\n struct Get< R, r, 1 >{ static std::string value_str()\n {\n std::string str = \"[\";\n for (size_t rr = 0; rr < r; ++rr) {\n if (rr > 0)\n str += \" \";\n str += \"1\";\n }\n str += \"]\";\n return str;\n } };\n\n template< class R >\n struct Get< R, 1, 1 >{ static std::string value_str()\n {\n return \"1\";\n } };\n\npublic:\n typedef typename BaseType::DomainType DomainType;\n typedef typename BaseType::RangeType RangeFieldType;\n typedef typename BaseType::RangeType RangeType;\n typedef typename BaseType::JacobianRangeType JacobianRangeType;\n\n using typename BaseType::LocalfunctionType;\n\n static std::string static_id()\n {\n return BaseType::static_id() + \".constant\";\n }\n\n static Common::ConfigTree default_config(const std::string sub_name = \"\")\n {\n Common::ConfigTree config;\n config[\"value\"] = Get< RangeFieldImp, rangeDim, rangeDimCols >::value_str();\n config[\"name\"] = static_id();\n if (sub_name.empty())\n return config;\n else {\n Common::ConfigTree tmp;\n tmp.add(config, sub_name);\n return tmp;\n }\n } \/\/ ... default_config(...)\n\n static std::unique_ptr< ThisType > create(const Common::ConfigTree config = default_config(),\n const std::string sub_name = static_id())\n {\n \/\/ get correct config\n const Common::ConfigTree cfg = config.has_sub(sub_name) ? config.sub(sub_name) : config;\n const Common::ConfigTree default_cfg = default_config();\n \/\/create\n RangeType value;\n try {\n value = cfg.get(\"value\", default_cfg.get< RangeType >(\"value\"));\n } catch (Stuff::Exceptions::configuration_error) {\n value = RangeType(cfg.get(\"value\", RangeFieldType(1)));\n }\n return Common::make_unique< ThisType >(\n cfg.get(\"value\", default_cfg.get< RangeType >(\"value\")),\n cfg.get(\"name\", default_cfg.get< std::string >(\"name\")));\n } \/\/ ... create(...)\n\n explicit Constant(const RangeType& constant, const std::string name = static_id())\n : constant_(constant)\n , name_(name)\n {}\n\n explicit Constant(const RangeFieldImp& constant, const std::string name = static_id())\n : constant_(constant)\n , name_(name)\n {}\n\n Constant(const ThisType& other)\n : constant_(other.constant_)\n , name_(other.name_)\n {}\n\n virtual std::string type() const DS_OVERRIDE DS_FINAL\n {\n return BaseType::static_id() + \".constant\";\n }\n\n virtual size_t order() const DS_OVERRIDE DS_FINAL\n {\n return 0;\n }\n\n virtual void evaluate(const DomainType& \/*x*\/, RangeType& ret) const DS_OVERRIDE DS_FINAL\n {\n ret = constant_;\n }\n\n virtual void jacobian(const DomainType& \/*x*\/, JacobianRangeType& ret) const DS_OVERRIDE DS_FINAL\n {\n ret *= 0.0;\n }\n\n virtual std::string name() const DS_OVERRIDE DS_FINAL\n {\n return name_;\n }\n\nprivate:\n const RangeType constant_;\n const std::string name_;\n};\n\n\n} \/\/ namespace Functions\n} \/\/ namespace Stuff\n} \/\/ namespace Dune\n\n#ifdef DUNE_STUFF_FUNCTIONS_TO_LIB\n# define DUNE_STUFF_FUNCTIONS_CONSTANT_LIST_DIMRANGE(etype, ddim) \\\n DUNE_STUFF_FUNCTIONS_CONSTANT_LIST_DIMRANGECOLS(etype, ddim, 1) \\\n DUNE_STUFF_FUNCTIONS_CONSTANT_LIST_DIMRANGECOLS(etype, ddim, 2) \\\n DUNE_STUFF_FUNCTIONS_CONSTANT_LIST_DIMRANGECOLS(etype, ddim, 3)\n\n# define DUNE_STUFF_FUNCTIONS_CONSTANT_LIST_DIMRANGECOLS(etype, ddim, rdim) \\\n DUNE_STUFF_FUNCTIONS_CONSTANT_LIST_DOMAINFIELDTYPES(etype, ddim, rdim, 1) \\\n DUNE_STUFF_FUNCTIONS_CONSTANT_LIST_DOMAINFIELDTYPES(etype, ddim, rdim, 2) \\\n DUNE_STUFF_FUNCTIONS_CONSTANT_LIST_DOMAINFIELDTYPES(etype, ddim, rdim, 3)\n\n# define DUNE_STUFF_FUNCTIONS_CONSTANT_LIST_DOMAINFIELDTYPES(etype, ddim, rdim, rcdim) \\\n DUNE_STUFF_FUNCTIONS_CONSTANT_LIST_RANGEFIELDTYPES(etype, double, ddim, rdim, rcdim)\n\n# define DUNE_STUFF_FUNCTIONS_CONSTANT_LIST_RANGEFIELDTYPES(etype, dftype, ddim, rdim, rcdim) \\\n DUNE_STUFF_FUNCTIONS_CONSTANT_LAST_EXPANSION(etype, dftype, ddim, double, rdim, rcdim) \\\n DUNE_STUFF_FUNCTIONS_CONSTANT_LAST_EXPANSION(etype, dftype, ddim, long double, rdim, rcdim)\n\n# define DUNE_STUFF_FUNCTIONS_CONSTANT_LAST_EXPANSION(etype, dftype, ddim, rftype, rdim, rcdim) \\\n extern template class Dune::Stuff::Functions::Constant< etype, dftype, ddim, rftype, rdim, rcdim >;\n\nDUNE_STUFF_FUNCTIONS_CONSTANT_LIST_DIMRANGE(DuneStuffFunctionsInterfacesFake1dEntityType, 1)\nDUNE_STUFF_FUNCTIONS_CONSTANT_LIST_DIMRANGE(DuneStuffFunctionsInterfacesFake2dEntityType, 2)\nDUNE_STUFF_FUNCTIONS_CONSTANT_LIST_DIMRANGE(DuneStuffFunctionsInterfacesFake3dEntityType, 3)\n\n# if HAVE_DUNE_GRID\n\nDUNE_STUFF_FUNCTIONS_CONSTANT_LIST_DIMRANGE(DuneStuffFunctionsInterfacesSGrid1dEntityType, 1)\nDUNE_STUFF_FUNCTIONS_CONSTANT_LIST_DIMRANGE(DuneStuffFunctionsInterfacesSGrid2dEntityType, 2)\nDUNE_STUFF_FUNCTIONS_CONSTANT_LIST_DIMRANGE(DuneStuffFunctionsInterfacesSGrid3dEntityType, 3)\n\nDUNE_STUFF_FUNCTIONS_CONSTANT_LIST_DIMRANGE(DuneStuffFunctionsInterfacesYaspGrid1dEntityType, 1)\nDUNE_STUFF_FUNCTIONS_CONSTANT_LIST_DIMRANGE(DuneStuffFunctionsInterfacesYaspGrid2dEntityType, 2)\nDUNE_STUFF_FUNCTIONS_CONSTANT_LIST_DIMRANGE(DuneStuffFunctionsInterfacesYaspGrid3dEntityType, 3)\n\n# if HAVE_ALUGRID_SERIAL_H || HAVE_ALUGRID_PARALLEL_H\n\nDUNE_STUFF_FUNCTIONS_CONSTANT_LIST_DIMRANGE(DuneStuffFunctionsInterfacesAluSimplexGrid2dEntityType, 2)\nDUNE_STUFF_FUNCTIONS_CONSTANT_LIST_DIMRANGE(DuneStuffFunctionsInterfacesAluSimplexGrid3dEntityType, 3)\nDUNE_STUFF_FUNCTIONS_CONSTANT_LIST_DIMRANGE(DuneStuffFunctionsInterfacesAluCubeGrid3dEntityType, 3)\n\n# endif \/\/ HAVE_ALUGRID_SERIAL_H || HAVE_ALUGRID_PARALLEL_H\n# endif \/\/ HAVE_DUNE_GRID\n\n# undef DUNE_STUFF_FUNCTIONS_CONSTANT_LAST_EXPANSION\n# undef DUNE_STUFF_FUNCTIONS_CONSTANT_LIST_RANGEFIELDTYPES\n# undef DUNE_STUFF_FUNCTIONS_CONSTANT_LIST_DOMAINFIELDTYPES\n# undef DUNE_STUFF_FUNCTIONS_CONSTANT_LIST_DIMRANGECOLS\n# undef DUNE_STUFF_FUNCTIONS_CONSTANT_LIST_DIMRANGE\n# endif \/\/ DUNE_STUFF_FUNCTIONS_TO_LIB\n\n#endif \/\/ DUNE_STUFF_FUNCTIONS_CONSTANT_HH\n<|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#include \"main.hxx\"\n\n\/\/ dune-stuff\n#include <dune\/stuff\/common\/logging.hh>\n#include <dune\/stuff\/common\/logstreams.hh>\n\nnamespace DSC = Dune::Stuff::Common;\n\nvoid balh(std::ostream& out) {\n static int c = 0;\n out << \"balh \" << c << \"\\n\";\n c++;\n}\n\nvoid do_something_that_takes_long(std::ostream& out)\n{\n out << \" there should appear five dots, but not too fast:\" << std::flush;\n for (unsigned int i = 0; i < 5; ++i){\n busywait(666);\n out << \".\" << std::flush;\n }\n out << std::endl;\n} \/\/ void do_something_that_takes_long()\n\nTEST(LoggerTest, all) {\n DSC::Logger().create(DSC::LOG_CONSOLE | DSC::LOG_ERROR);\n DSC::Logger().error() << \"This should be in output\\n\";\n DSC::Logger().info() << \"This should NOT be in output\\n\";\n DSC::Logger().debug() << \"dito\\n\";\n DSC::Logger().flush();\n for (int i: {DSC::LOG_INFO, DSC::LOG_DEBUG, DSC::LOG_ERROR}) {\n const int id = DSC::Logger().addStream(DSC::LOG_CONSOLE | i);\n DSC::Logger().getStream(id) << \"Create a new stream with id: \" << id << std::endl;\n }\n DSC_LOG_ERROR.suspend();\n DSC_LOG_ERROR << \"not in output\\n\";\n balh(DSC_LOG_ERROR);\n DSC_LOG_ERROR.resume();\n DSC_LOG_ERROR << \"in output\\n\";\n balh(DSC_LOG_ERROR);\n\n \/\/this should do nothing whatsoever\n balh(DSC::dev_null);\n DSC::Logger().flush();\n\n \/\/ this is the desired result:\n DSC::LogStream& err = DSC::Logger().error();\n std::cout << \"begin std::cout test\" << std::endl;\n do_something_that_takes_long(std::cout);\n std::cout << \"end std::cout test\" << std::endl;\n std::cout << \"begin Logger().error() test\" << std::endl;\n do_something_that_takes_long(err);\n std::cout << \"end Logger().error() test\" << std::endl;\n}\n<commit_msg>[test.common_logger] added \"test\" for file logging.<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#include \"main.hxx\"\n\n\/\/ dune-stuff\n#include <dune\/stuff\/common\/logging.hh>\n#include <dune\/stuff\/common\/logstreams.hh>\n\nnamespace DSC = Dune::Stuff::Common;\n\nvoid balh(std::ostream& out) {\n static int c = 0;\n out << \"balh \" << c << \"\\n\";\n c++;\n}\n\nvoid do_something_that_takes_long(std::ostream& out)\n{\n out << \" there should appear five dots, but not too fast:\" << std::flush;\n for (unsigned int i = 0; i < 5; ++i){\n busywait(666);\n out << \".\" << std::flush;\n }\n out << std::endl;\n} \/\/ void do_something_that_takes_long()\n\nTEST(LoggerTest, all) {\n DSC::Logger().create(DSC::LOG_CONSOLE | DSC::LOG_ERROR);\n DSC::Logger().error() << \"This should be in output\\n\";\n DSC::Logger().info() << \"This should NOT be in output\\n\";\n DSC::Logger().debug() << \"dito\\n\";\n DSC::Logger().flush();\n for (int i: {DSC::LOG_INFO, DSC::LOG_DEBUG, DSC::LOG_ERROR}) {\n const int id = DSC::Logger().addStream(DSC::LOG_CONSOLE | i);\n DSC::Logger().getStream(id) << \"Create a new stream with id: \" << id << std::endl;\n }\n DSC_LOG_ERROR.suspend();\n DSC_LOG_ERROR << \"not in output\\n\";\n balh(DSC_LOG_ERROR);\n DSC_LOG_ERROR.resume();\n DSC_LOG_ERROR << \"in output\\n\";\n balh(DSC_LOG_ERROR);\n\n \/\/this should do nothing whatsoever\n balh(DSC::dev_null);\n DSC::Logger().flush();\n\n \/\/ this is the desired result:\n DSC::LogStream& err = DSC::Logger().error();\n std::cout << \"begin std::cout test\" << std::endl;\n do_something_that_takes_long(std::cout);\n std::cout << \"end std::cout test\" << std::endl;\n std::cout << \"begin Logger().error() test\" << std::endl;\n do_something_that_takes_long(err);\n std::cout << \"end Logger().error() test\" << std::endl;\n}\n\nTEST(LoggerTest, file) {\n DSC::Logger().create(DSC::LOG_INFO | DSC::LOG_CONSOLE | DSC::LOG_FILE, \"test_common_logger\", \"\", \"\");\n DSC::Logger().info() << \"This output should be in 'test_common_logger.log'\" << std::endl;\n}\n<|endoftext|>"} {"text":"<commit_before>#include \"client.h\"\n#include \"..\/utils\/exception.h\"\n#include \"..\/utils\/locker.h\"\n#include \"..\/utils\/logger.h\"\n#include \"async_connection.h\"\n#include \"net_common.h\"\n\n#include <json\/json.hpp>\n#define BOOST_ASIO_ENABLE_HANDLER_TRACKING\n#include <boost\/asio.hpp>\n#include <functional>\n#include <thread>\n\nusing namespace std::placeholders;\nusing namespace boost::asio;\n\nusing namespace dariadb;\nusing namespace dariadb::net;\n\ntypedef boost::shared_ptr<ip::tcp::socket> socket_ptr;\n\nclass Client::Private : public AsyncConnection {\npublic:\n Private(const Client::Param &p) : _params(p) {\n _query_num = 1;\n _state = ClientState::CONNECT;\n _pings_answers = 0;\n }\n\n ~Private() noexcept(false) {\n try {\n if (_state != ClientState::DISCONNECTED && _socket != nullptr) {\n this->disconnect();\n }\n if (_socket->is_open()) {\n boost::system::error_code err;\n _socket->cancel(err);\n if (err) {\n logger(\"client: #\", id(), \" on socket::cancel - \", err.message());\n }\n }\n _service.stop();\n _thread_handler.join();\n } catch (std::exception &ex) {\n THROW_EXCEPTION_SS(\"client: #\" << id() << ex.what());\n }\n }\n\n void connect() {\n logger_info(\"client: connecting to \", _params.host, ':', _params.port);\n\n _state = ClientState::CONNECT;\n _thread_handler = std::move(std::thread{&Client::Private::client_thread, this});\n\n while (this->_state != ClientState::WORK) {\n std::this_thread::sleep_for(std::chrono::milliseconds(300));\n }\n }\n\n void disconnect() {\n if (_socket->is_open()) {\n auto nd = std::make_shared<NetData>(DISCONNECT_PREFIX);\n queue_clear();\n this->send(nd);\n }\n while (this->_state != ClientState::DISCONNECTED) {\n logger(\"client: #\", id(), \" disconnect - wait server answer...\");\n std::this_thread::sleep_for(std::chrono::milliseconds(500));\n }\n }\n\n void client_thread() {\n ip::tcp::endpoint ep(ip::address::from_string(_params.host), _params.port);\n auto raw_sock_ptr = new ip::tcp::socket(_service);\n _socket = socket_ptr{raw_sock_ptr};\n _socket->async_connect(ep, std::bind(&Client::Private::connect_handler, this, _1));\n _service.run();\n }\n\n void onNetworkError(const boost::system::error_code &err) override {\n if (this->_state != ClientState::DISCONNECTED) {\n THROW_EXCEPTION_SS(\"client: #\" << id() << err.message());\n }\n }\n\n void onDataRecv(const NetData_ptr &d) override {\n if (this->_state == ClientState::WORK) {\n logger(\"client: #\", id(), \" dataRecv \", d->size, \" bytes.\");\n } else {\n logger(\"client: dataRecv \", d->size, \" bytes.\");\n }\n\n if (d->size >= OK_ANSWER.size() &&\n memcmp(d->data, OK_ANSWER.data(), OK_ANSWER.size()) == 0) {\n std::string msg((char *)d->data, (char *)(d->data + d->size));\n auto query_num = stoi(msg.substr(3, msg.size()));\n logger(\"client: #\", id(), \" query #\", query_num, \" accepted.\");\n if (this->_state != ClientState::WORK) {\n THROW_EXCEPTION_SS(\"(this->_state != ClientState::WORK)\" << this->_state);\n }\n return;\n }\n\n if (d->size == PING_QUERY.size() &&\n memcmp(d->data, PING_QUERY.data(), PING_QUERY.size()) == 0) {\n std::string msg((char *)d->data, (char *)(d->data + d->size));\n logger(\"client: #\", id(), \" ping.\");\n auto nd = std::make_shared<NetData>(PONG_ANSWER);\n this->send(nd);\n _pings_answers++;\n return;\n }\n\n if (d->size == DISCONNECT_ANSWER.size() &&\n memcmp(d->data, DISCONNECT_ANSWER.data(), DISCONNECT_ANSWER.size()) == 0) {\n std::string msg((char *)d->data, (char *)(d->data + d->size));\n logger(\"client: #\", id(), \" disconnection.\");\n try{\n _state = ClientState::DISCONNECTED;\n this->full_stop();\n this->_socket->close();\n }catch(...){}\n logger(\"client: #\", id(), \" disconnected.\");\n return;\n }\n\n \/\/ hello id\n if (d->size > HELLO_PREFIX.size() &&\n memcmp(HELLO_PREFIX.data(), d->data, HELLO_PREFIX.size()) == 0) {\n std::string msg((char *)d->data, (char *)(d->data + d->size));\n auto id = stoi(msg.substr(HELLO_PREFIX.size(), msg.size()));\n this->set_id(id);\n this->_state = ClientState::WORK;\n logger(\"client: #\", id, \" ready.\");\n }\n }\n\n void connect_handler(const boost::system::error_code &ec) {\n if (ec) {\n THROW_EXCEPTION_SS(\"dariadb::client: error on connect - \" << ec.message());\n }\n this->start(this->_socket);\n std::lock_guard<utils::Locker> lg(_locker);\n std::stringstream ss;\n ss << HELLO_PREFIX << ' ' << ip::host_name();\n\n auto hello_message = ss.str();\n logger(\"client: send hello \", hello_message.substr(0, hello_message.size() - 1));\n\n auto nd = std::make_shared<NetData>(hello_message);\n\n this->send(nd);\n }\n\n \/* void onRead(const boost::system::error_code &err, size_t read_bytes) {\n logger(\"client: onRead...\");\n if (err) {\n THROW_EXCEPTION_SS(\"client: \" << err.message());\n }\n\n std::istream iss(&this->buff);\n std::string msg;\n std::getline(iss, msg);\n logger(\"client: {\", msg, \"} readed_bytes: \", read_bytes);\n\n if (msg.size() > OK_ANSWER.size() && msg.substr(0, OK_ANSWER.size()) == OK_ANSWER) {\n auto query_num = stoi(msg.substr(3, msg.size()));\n logger(\"client: query #\", query_num, \" accepted.\");\n if (this->_state == ClientState::WORK) {\n auto query_str = msg.substr(OK_ANSWER.size()+1, msg.size());\n auto delim_pos = query_str.find_first_of(' ');\n\n auto count_str = query_str.substr(delim_pos, query_str.size());\n auto count = stoi(count_str);\n\n in_buffer_values.resize(count);\n\n delim_pos = query_str.find_first_of('{');\n query_str = query_str.substr(delim_pos, query_str.size());\n auto qjs = nlohmann::json::parse(query_str);\n auto result_array = qjs[\"result\"];\n size_t i = 0;\n for (auto meas_js : result_array) {\n Meas v;\n v.id= meas_js[\"id\"];\n v.flag = meas_js[\"flag\"];\n v.src=meas_js[\"src\"];\n v.value=meas_js[\"value\"];\n this->in_buffer_values[i++] = v;\n }\n this->_query_locker->unlock();\n } else {\n this->_state = ClientState::WORK;\n }\n }\n\n if (msg == DISCONNECT_ANSWER) {\n logger(\"client: disconnected.\");\n _state = ClientState::DISCONNECTED;\n this->_socket->close();\n return;\n }\n\n if (msg == PING_QUERY) {\n logger(\"client: ping.\");\n async_write(*_socket.get(), buffer(PONG_ANSWER + \"\\n\"),\n std::bind(&Client::Private::onPongSended, this, _1,\n _2));\n }\n\n logger_info(\"client: onRead - nextQuery\");\n readNext();\n }*\/\n\n \/* void onPongSended(const boost::system::error_code &err, size_t read_bytes) {\n if (err) {\n THROW_EXCEPTION_SS(\"client::onPongSended - \" << err.message());\n }\n _pings_answers++;\n logger(\"client: pong\");\n }*\/\n\n size_t pings_answers() const { return _pings_answers.load(); }\n ClientState state() const { return _state; }\n \/*\n void write(const Meas::MeasArray &ma) {\n std::lock_guard<utils::Locker> lg(this->_locker);\n logger(\"client: write \", ma.size());\n utils::Locker locker;\n locker.lock();\n std::stringstream ss;\n ss << WRITE_QUERY << ' ' << ma.size() << '\\n';\n std::string query = ss.str();\n async_write(*_socket.get(), buffer(query),\n std::bind(&Client::Private::onWriteQuerySended, this, &locker,\n ma.size(), ma, _1, _2));\n\n locker.lock();\n }\n\n void onWriteQuerySended(utils::Locker *locker, size_t to_send, Meas::MeasArray &ma,\n const boost::system::error_code\n &err, size_t read_bytes) {\n if (err) {\n THROW_EXCEPTION_SS(\"client::onWriteQuerySended - \" << err.message());\n }\n\n if (to_send != 0) {\n logger(\"client: write next part \", to_send, \" values.\");\n async_write(*_socket.get(), buffer(ma, to_send * sizeof(Meas)),\n std::bind(&Client::Private::onWriteQuerySended, this,\n locker,\n size_t(0), ma, _1, _2));\n } else {\n locker->unlock();\n }\n }\n\n Meas::MeasList read(const storage::QueryInterval &qi) {\n std::lock_guard<utils::Locker> lg(this->_locker);\n\n auto qid = this->_query_num.load();\n this->_query_num++;\n\n std::stringstream ss;\n ss << READ_INTERVAL_QUERY\n << ' '\n << qid\n << ' '\n << qi.to_string()\n << '\\n';\n std::string query = ss.str();\n\n utils::Locker q_locker;\n q_locker.lock();\n this->_query_locker = &q_locker;\n\n async_write(*_socket.get(), buffer(query),\n std::bind(&Client::Private::onReadQuerySended, this, _1, _2));\n\n q_locker.lock();\n Meas::MeasList result(in_buffer_values.begin(), in_buffer_values.end());\n in_buffer_values.clear();\n return result;\n }*\/\n\n \/\/ void onReadQuerySended(const boost::system::error_code &err, size_t read_bytes) {\n \/\/ if (err) {\n \/\/ THROW_EXCEPTION_SS(\"client::onReadQuerySended - \" << err.message());\n \/\/ }\n\n \/\/ logger_info(\"client: onReadQuerySended - nextQuery\");\n \/\/ \/*readNext();*\/\n \/\/}\n\n io_service _service;\n socket_ptr _socket;\n streambuf buff;\n\n Client::Param _params;\n utils::Locker _locker;\n utils::Locker *_query_locker; \/\/ lock current query.\n std::thread _thread_handler;\n ClientState _state;\n std::atomic_size_t _pings_answers;\n\n std::atomic_int _query_num;\n Meas::MeasArray in_buffer_values;\n};\n\nClient::Client(const Param &p) : _Impl(new Client::Private(p)) {}\n\nClient::~Client() {}\n\nint Client::id() const {\n return _Impl->id();\n}\n\nvoid Client::connect() {\n _Impl->connect();\n}\n\nvoid Client::disconnect() {\n _Impl->disconnect();\n}\n\nClientState Client::state() const {\n return _Impl->state();\n}\n\nsize_t Client::pings_answers() const {\n return _Impl->pings_answers();\n}\n\n\/\/ void Client::write(const Meas::MeasArray &ma) {\n\/\/ _Impl->write(ma);\n\/\/}\n\/\/\n\/\/ Meas::MeasList Client::read(const storage::QueryInterval &qi) {\n\/\/ return _Impl->read(qi);\n\/\/}\n<commit_msg>try...catch<commit_after>#include \"client.h\"\n#include \"..\/utils\/exception.h\"\n#include \"..\/utils\/locker.h\"\n#include \"..\/utils\/logger.h\"\n#include \"async_connection.h\"\n#include \"net_common.h\"\n\n#include <json\/json.hpp>\n#define BOOST_ASIO_ENABLE_HANDLER_TRACKING\n#include <boost\/asio.hpp>\n#include <functional>\n#include <thread>\n\nusing namespace std::placeholders;\nusing namespace boost::asio;\n\nusing namespace dariadb;\nusing namespace dariadb::net;\n\ntypedef boost::shared_ptr<ip::tcp::socket> socket_ptr;\n\nclass Client::Private : public AsyncConnection {\npublic:\n Private(const Client::Param &p) : _params(p) {\n _query_num = 1;\n _state = ClientState::CONNECT;\n _pings_answers = 0;\n }\n\n ~Private() noexcept(false) {\n try {\n if (_state != ClientState::DISCONNECTED && _socket != nullptr) {\n this->disconnect();\n }\n if (_socket->is_open()) {\n boost::system::error_code err;\n _socket->cancel(err);\n if (err) {\n logger(\"client: #\", id(), \" on socket::cancel - \", err.message());\n }\n }\n _service.stop();\n _thread_handler.join();\n } catch (std::exception &ex) {\n THROW_EXCEPTION_SS(\"client: #\" << id() << ex.what());\n }\n }\n\n void connect() {\n logger_info(\"client: connecting to \", _params.host, ':', _params.port);\n\n _state = ClientState::CONNECT;\n _thread_handler = std::move(std::thread{&Client::Private::client_thread, this});\n\n while (this->_state != ClientState::WORK) {\n std::this_thread::sleep_for(std::chrono::milliseconds(300));\n }\n }\n\n void disconnect() {\n if (_socket->is_open()) {\n auto nd = std::make_shared<NetData>(DISCONNECT_PREFIX);\n queue_clear();\n this->send(nd);\n }\n while (this->_state != ClientState::DISCONNECTED) {\n logger(\"client: #\", id(), \" disconnect - wait server answer...\");\n std::this_thread::sleep_for(std::chrono::milliseconds(500));\n }\n }\n\n void client_thread() {\n ip::tcp::endpoint ep(ip::address::from_string(_params.host), _params.port);\n auto raw_sock_ptr = new ip::tcp::socket(_service);\n _socket = socket_ptr{raw_sock_ptr};\n _socket->async_connect(ep, std::bind(&Client::Private::connect_handler, this, _1));\n _service.run();\n }\n\n void onNetworkError(const boost::system::error_code &err) override {\n if (this->_state != ClientState::DISCONNECTED) {\n THROW_EXCEPTION_SS(\"client: #\" << id() << err.message());\n }\n }\n\n void onDataRecv(const NetData_ptr &d) override {\n if (this->_state == ClientState::WORK) {\n logger(\"client: #\", id(), \" dataRecv \", d->size, \" bytes.\");\n } else {\n logger(\"client: dataRecv \", d->size, \" bytes.\");\n }\n\n if (d->size >= OK_ANSWER.size() &&\n memcmp(d->data, OK_ANSWER.data(), OK_ANSWER.size()) == 0) {\n std::string msg((char *)d->data, (char *)(d->data + d->size));\n auto query_num = stoi(msg.substr(3, msg.size()));\n logger(\"client: #\", id(), \" query #\", query_num, \" accepted.\");\n if (this->_state != ClientState::WORK) {\n THROW_EXCEPTION_SS(\"(this->_state != ClientState::WORK)\" << this->_state);\n }\n return;\n }\n\n if (d->size == PING_QUERY.size() &&\n memcmp(d->data, PING_QUERY.data(), PING_QUERY.size()) == 0) {\n std::string msg((char *)d->data, (char *)(d->data + d->size));\n logger(\"client: #\", id(), \" ping.\");\n auto nd = std::make_shared<NetData>(PONG_ANSWER);\n this->send(nd);\n _pings_answers++;\n return;\n }\n\n if (d->size == DISCONNECT_ANSWER.size() &&\n memcmp(d->data, DISCONNECT_ANSWER.data(), DISCONNECT_ANSWER.size()) ==\n 0) {\n std::string msg((char *)d->data, (char *)(d->data + d->size));\n logger(\"client: #\", id(), \" disconnection.\");\n try {\n _state = ClientState::DISCONNECTED;\n this->full_stop();\n this->_socket->close();\n } catch (...) {\n }\n logger(\"client: #\", id(), \" disconnected.\");\n return;\n }\n\n \/\/ hello id\n if (d->size > HELLO_PREFIX.size() &&\n memcmp(HELLO_PREFIX.data(), d->data, HELLO_PREFIX.size()) == 0) {\n std::string msg((char *)d->data, (char *)(d->data + d->size));\n auto id = stoi(msg.substr(HELLO_PREFIX.size(), msg.size()));\n this->set_id(id);\n this->_state = ClientState::WORK;\n logger(\"client: #\", id, \" ready.\");\n }\n }\n\n void connect_handler(const boost::system::error_code &ec) {\n if (ec) {\n THROW_EXCEPTION_SS(\"dariadb::client: error on connect - \" << ec.message());\n }\n this->start(this->_socket);\n std::lock_guard<utils::Locker> lg(_locker);\n std::stringstream ss;\n ss << HELLO_PREFIX << ' ' << ip::host_name();\n\n auto hello_message = ss.str();\n logger(\"client: send hello \", hello_message.substr(0, hello_message.size() - 1));\n\n auto nd = std::make_shared<NetData>(hello_message);\n\n this->send(nd);\n }\n\n \/* void onRead(const boost::system::error_code &err, size_t read_bytes) {\n logger(\"client: onRead...\");\n if (err) {\n THROW_EXCEPTION_SS(\"client: \" << err.message());\n }\n\n std::istream iss(&this->buff);\n std::string msg;\n std::getline(iss, msg);\n logger(\"client: {\", msg, \"} readed_bytes: \", read_bytes);\n\n if (msg.size() > OK_ANSWER.size() && msg.substr(0, OK_ANSWER.size()) == OK_ANSWER) {\n auto query_num = stoi(msg.substr(3, msg.size()));\n logger(\"client: query #\", query_num, \" accepted.\");\n if (this->_state == ClientState::WORK) {\n auto query_str = msg.substr(OK_ANSWER.size()+1, msg.size());\n auto delim_pos = query_str.find_first_of(' ');\n\n auto count_str = query_str.substr(delim_pos, query_str.size());\n auto count = stoi(count_str);\n\n in_buffer_values.resize(count);\n\n delim_pos = query_str.find_first_of('{');\n query_str = query_str.substr(delim_pos, query_str.size());\n auto qjs = nlohmann::json::parse(query_str);\n auto result_array = qjs[\"result\"];\n size_t i = 0;\n for (auto meas_js : result_array) {\n Meas v;\n v.id= meas_js[\"id\"];\n v.flag = meas_js[\"flag\"];\n v.src=meas_js[\"src\"];\n v.value=meas_js[\"value\"];\n this->in_buffer_values[i++] = v;\n }\n this->_query_locker->unlock();\n } else {\n this->_state = ClientState::WORK;\n }\n }\n\n if (msg == DISCONNECT_ANSWER) {\n logger(\"client: disconnected.\");\n _state = ClientState::DISCONNECTED;\n this->_socket->close();\n return;\n }\n\n if (msg == PING_QUERY) {\n logger(\"client: ping.\");\n async_write(*_socket.get(), buffer(PONG_ANSWER + \"\\n\"),\n std::bind(&Client::Private::onPongSended, this, _1,\n _2));\n }\n\n logger_info(\"client: onRead - nextQuery\");\n readNext();\n }*\/\n\n \/* void onPongSended(const boost::system::error_code &err, size_t read_bytes) {\n if (err) {\n THROW_EXCEPTION_SS(\"client::onPongSended - \" << err.message());\n }\n _pings_answers++;\n logger(\"client: pong\");\n }*\/\n\n size_t pings_answers() const { return _pings_answers.load(); }\n ClientState state() const { return _state; }\n \/*\n void write(const Meas::MeasArray &ma) {\n std::lock_guard<utils::Locker> lg(this->_locker);\n logger(\"client: write \", ma.size());\n utils::Locker locker;\n locker.lock();\n std::stringstream ss;\n ss << WRITE_QUERY << ' ' << ma.size() << '\\n';\n std::string query = ss.str();\n async_write(*_socket.get(), buffer(query),\n std::bind(&Client::Private::onWriteQuerySended, this, &locker,\n ma.size(), ma, _1, _2));\n\n locker.lock();\n }\n\n void onWriteQuerySended(utils::Locker *locker, size_t to_send, Meas::MeasArray &ma,\n const boost::system::error_code\n &err, size_t read_bytes) {\n if (err) {\n THROW_EXCEPTION_SS(\"client::onWriteQuerySended - \" << err.message());\n }\n\n if (to_send != 0) {\n logger(\"client: write next part \", to_send, \" values.\");\n async_write(*_socket.get(), buffer(ma, to_send * sizeof(Meas)),\n std::bind(&Client::Private::onWriteQuerySended, this,\n locker,\n size_t(0), ma, _1, _2));\n } else {\n locker->unlock();\n }\n }\n\n Meas::MeasList read(const storage::QueryInterval &qi) {\n std::lock_guard<utils::Locker> lg(this->_locker);\n\n auto qid = this->_query_num.load();\n this->_query_num++;\n\n std::stringstream ss;\n ss << READ_INTERVAL_QUERY\n << ' '\n << qid\n << ' '\n << qi.to_string()\n << '\\n';\n std::string query = ss.str();\n\n utils::Locker q_locker;\n q_locker.lock();\n this->_query_locker = &q_locker;\n\n async_write(*_socket.get(), buffer(query),\n std::bind(&Client::Private::onReadQuerySended, this, _1, _2));\n\n q_locker.lock();\n Meas::MeasList result(in_buffer_values.begin(), in_buffer_values.end());\n in_buffer_values.clear();\n return result;\n }*\/\n\n \/\/ void onReadQuerySended(const boost::system::error_code &err, size_t read_bytes) {\n \/\/ if (err) {\n \/\/ THROW_EXCEPTION_SS(\"client::onReadQuerySended - \" << err.message());\n \/\/ }\n\n \/\/ logger_info(\"client: onReadQuerySended - nextQuery\");\n \/\/ \/*readNext();*\/\n \/\/}\n\n io_service _service;\n socket_ptr _socket;\n streambuf buff;\n\n Client::Param _params;\n utils::Locker _locker;\n utils::Locker *_query_locker; \/\/ lock current query.\n std::thread _thread_handler;\n ClientState _state;\n std::atomic_size_t _pings_answers;\n\n std::atomic_int _query_num;\n Meas::MeasArray in_buffer_values;\n};\n\nClient::Client(const Param &p) : _Impl(new Client::Private(p)) {}\n\nClient::~Client() {}\n\nint Client::id() const {\n return _Impl->id();\n}\n\nvoid Client::connect() {\n _Impl->connect();\n}\n\nvoid Client::disconnect() {\n _Impl->disconnect();\n}\n\nClientState Client::state() const {\n return _Impl->state();\n}\n\nsize_t Client::pings_answers() const {\n return _Impl->pings_answers();\n}\n\n\/\/ void Client::write(const Meas::MeasArray &ma) {\n\/\/ _Impl->write(ma);\n\/\/}\n\/\/\n\/\/ Meas::MeasList Client::read(const storage::QueryInterval &qi) {\n\/\/ return _Impl->read(qi);\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 \"sandbox\/win\/src\/process_mitigations.h\"\n\n#include <algorithm>\n\n#include \"base\/win\/windows_version.h\"\n#include \"sandbox\/win\/src\/nt_internals.h\"\n#include \"sandbox\/win\/src\/sandbox_utils.h\"\n#include \"sandbox\/win\/src\/win_utils.h\"\n\nnamespace {\n\n\/\/ Functions for enabling policies.\ntypedef BOOL (WINAPI *SetProcessDEPPolicyFunction)(DWORD dwFlags);\n\ntypedef BOOL (WINAPI *SetProcessMitigationPolicyFunction)(\n PROCESS_MITIGATION_POLICY mitigation_policy,\n PVOID buffer,\n SIZE_T length);\n\ntypedef BOOL (WINAPI *SetDefaultDllDirectoriesFunction)(\n DWORD DirectoryFlags);\n\n} \/\/ namespace\n\nnamespace sandbox {\n\nbool ApplyProcessMitigationsToCurrentProcess(MitigationFlags flags) {\n if (!CanSetProcessMitigationsPostStartup(flags))\n return false;\n\n \/\/ We can't apply anything before Win XP, so just return cleanly.\n if (!IsXPSP2OrLater())\n return true;\n\n base::win::Version version = base::win::GetVersion();\n HMODULE module = ::GetModuleHandleA(\"kernel32.dll\");\n\n if (version >= base::win::VERSION_VISTA &&\n (flags & MITIGATION_DLL_SEARCH_ORDER)) {\n SetDefaultDllDirectoriesFunction set_default_dll_directories =\n reinterpret_cast<SetDefaultDllDirectoriesFunction>(\n ::GetProcAddress(module, \"SetDefaultDllDirectories\"));\n\n \/\/ Check for SetDefaultDllDirectories since it requires KB2533623.\n if (set_default_dll_directories) {\n if (!set_default_dll_directories(LOAD_LIBRARY_SEARCH_DEFAULT_DIRS) &&\n ERROR_ACCESS_DENIED != ::GetLastError()) {\n return false;\n }\n }\n }\n\n \/\/ Set the heap to terminate on corruption\n if (version >= base::win::VERSION_VISTA &&\n (flags & MITIGATION_HEAP_TERMINATE)) {\n if (!::HeapSetInformation(NULL, HeapEnableTerminationOnCorruption,\n NULL, 0) &&\n ERROR_ACCESS_DENIED != ::GetLastError()) {\n return false;\n }\n }\n\n#if !defined(_WIN64) \/\/ DEP is always enabled on 64-bit.\n if (flags & MITIGATION_DEP) {\n DWORD dep_flags = PROCESS_DEP_ENABLE;\n \/\/ DEP support is quirky on XP, so don't force a failure in that case.\n const bool return_on_fail = version >= base::win::VERSION_VISTA;\n\n if (flags & MITIGATION_DEP_NO_ATL_THUNK)\n dep_flags |= PROCESS_DEP_DISABLE_ATL_THUNK_EMULATION;\n\n SetProcessDEPPolicyFunction set_process_dep_policy =\n reinterpret_cast<SetProcessDEPPolicyFunction>(\n ::GetProcAddress(module, \"SetProcessDEPPolicy\"));\n if (set_process_dep_policy) {\n if (!set_process_dep_policy(dep_flags) &&\n ERROR_ACCESS_DENIED != ::GetLastError() && return_on_fail) {\n return false;\n }\n } else {\n \/\/ We're on XP sp2, so use the less standard approach.\n \/\/ For reference: http:\/\/www.uninformed.org\/?v=2&a=4\n const int MEM_EXECUTE_OPTION_ENABLE = 1;\n const int MEM_EXECUTE_OPTION_DISABLE = 2;\n const int MEM_EXECUTE_OPTION_ATL7_THUNK_EMULATION = 4;\n const int MEM_EXECUTE_OPTION_PERMANENT = 8;\n\n NtSetInformationProcessFunction set_information_process = NULL;\n ResolveNTFunctionPtr(\"NtSetInformationProcess\",\n &set_information_process);\n if (!set_information_process)\n return false;\n ULONG dep = MEM_EXECUTE_OPTION_DISABLE | MEM_EXECUTE_OPTION_PERMANENT;\n if (!(dep_flags & PROCESS_DEP_DISABLE_ATL_THUNK_EMULATION))\n dep |= MEM_EXECUTE_OPTION_ATL7_THUNK_EMULATION;\n if (!SUCCEEDED(set_information_process(GetCurrentProcess(),\n ProcessExecuteFlags,\n &dep, sizeof(dep))) &&\n ERROR_ACCESS_DENIED != ::GetLastError() && return_on_fail) {\n return false;\n }\n }\n }\n#endif\n\n \/\/ This is all we can do in Win7 and below.\n if (version < base::win::VERSION_WIN8)\n return true;\n\n SetProcessMitigationPolicyFunction set_process_mitigation_policy =\n reinterpret_cast<SetProcessMitigationPolicyFunction>(\n ::GetProcAddress(module, \"SetProcessMitigationPolicy\"));\n if (!set_process_mitigation_policy)\n return false;\n\n \/\/ Enable ASLR policies.\n if (flags & MITIGATION_RELOCATE_IMAGE) {\n PROCESS_MITIGATION_ASLR_POLICY policy = { 0 };\n policy.EnableForceRelocateImages = true;\n policy.DisallowStrippedImages = (flags &\n MITIGATION_RELOCATE_IMAGE_REQUIRED) ==\n MITIGATION_RELOCATE_IMAGE_REQUIRED;\n\n if (!set_process_mitigation_policy(ProcessASLRPolicy, &policy,\n sizeof(policy)) &&\n ERROR_ACCESS_DENIED != ::GetLastError()) {\n return false;\n }\n }\n\n \/\/ Enable strict handle policies.\n if (flags & MITIGATION_STRICT_HANDLE_CHECKS) {\n PROCESS_MITIGATION_STRICT_HANDLE_CHECK_POLICY policy = { 0 };\n policy.HandleExceptionsPermanentlyEnabled =\n policy.RaiseExceptionOnInvalidHandleReference = true;\n\n if (!set_process_mitigation_policy(ProcessStrictHandleCheckPolicy, &policy,\n sizeof(policy)) &&\n ERROR_ACCESS_DENIED != ::GetLastError()) {\n return false;\n }\n }\n\n \/\/ Enable system call policies.\n if (flags & MITIGATION_WIN32K_DISABLE) {\n PROCESS_MITIGATION_SYSTEM_CALL_DISABLE_POLICY policy = { 0 };\n policy.DisallowWin32kSystemCalls = true;\n\n if (!set_process_mitigation_policy(ProcessSystemCallDisablePolicy, &policy,\n sizeof(policy)) &&\n ERROR_ACCESS_DENIED != ::GetLastError()) {\n return false;\n }\n }\n\n \/\/ Enable system call policies.\n if (flags & MITIGATION_EXTENSION_DLL_DISABLE) {\n PROCESS_MITIGATION_EXTENSION_POINT_DISABLE_POLICY policy = { 0 };\n policy.DisableExtensionPoints = true;\n\n if (!set_process_mitigation_policy(ProcessExtensionPointDisablePolicy,\n &policy, sizeof(policy)) &&\n ERROR_ACCESS_DENIED != ::GetLastError()) {\n return false;\n }\n }\n\n return true;\n}\n\nvoid ConvertProcessMitigationsToPolicy(MitigationFlags flags,\n DWORD64* policy_flags, size_t* size) {\n base::win::Version version = base::win::GetVersion();\n\n *policy_flags = 0;\n#if defined(_WIN64)\n *size = sizeof(*policy_flags);\n#elif defined(_M_IX86)\n \/\/ A 64-bit flags attribute is illegal on 32-bit Win 7 and below.\n if (version < base::win::VERSION_WIN8)\n *size = sizeof(DWORD);\n else\n *size = sizeof(*policy_flags);\n#else\n#error This platform is not supported.\n#endif\n\n \/\/ Nothing for Win XP or Vista.\n if (version <= base::win::VERSION_VISTA)\n return;\n\n \/\/ DEP and SEHOP are not valid for 64-bit Windows\n#if !defined(_WIN64)\n if (flags & MITIGATION_DEP) {\n *policy_flags |= PROCESS_CREATION_MITIGATION_POLICY_DEP_ENABLE;\n if (!(flags & MITIGATION_DEP_NO_ATL_THUNK))\n *policy_flags |= PROCESS_CREATION_MITIGATION_POLICY_DEP_ATL_THUNK_ENABLE;\n }\n\n if (flags & MITIGATION_SEHOP)\n *policy_flags |= PROCESS_CREATION_MITIGATION_POLICY_SEHOP_ENABLE;\n#endif\n\n \/\/ Win 7\n if (version < base::win::VERSION_WIN8)\n return;\n\n if (flags & MITIGATION_RELOCATE_IMAGE) {\n *policy_flags |=\n PROCESS_CREATION_MITIGATION_POLICY_FORCE_RELOCATE_IMAGES_ALWAYS_ON;\n if (flags & MITIGATION_RELOCATE_IMAGE_REQUIRED) {\n *policy_flags |=\n PROCESS_CREATION_MITIGATION_POLICY_FORCE_RELOCATE_IMAGES_ALWAYS_ON_REQ_RELOCS;\n }\n }\n\n if (flags & MITIGATION_HEAP_TERMINATE) {\n *policy_flags |=\n PROCESS_CREATION_MITIGATION_POLICY_HEAP_TERMINATE_ALWAYS_ON;\n }\n\n if (flags & MITIGATION_BOTTOM_UP_ASLR) {\n *policy_flags |=\n PROCESS_CREATION_MITIGATION_POLICY_BOTTOM_UP_ASLR_ALWAYS_ON;\n }\n\n if (flags & MITIGATION_HIGH_ENTROPY_ASLR) {\n *policy_flags |=\n PROCESS_CREATION_MITIGATION_POLICY_HIGH_ENTROPY_ASLR_ALWAYS_ON;\n }\n\n if (flags & MITIGATION_STRICT_HANDLE_CHECKS) {\n *policy_flags |=\n PROCESS_CREATION_MITIGATION_POLICY_STRICT_HANDLE_CHECKS_ALWAYS_ON;\n }\n\n if (flags & MITIGATION_WIN32K_DISABLE) {\n *policy_flags |=\n PROCESS_CREATION_MITIGATION_POLICY_WIN32K_SYSTEM_CALL_DISABLE_ALWAYS_ON;\n }\n\n if (flags & MITIGATION_EXTENSION_DLL_DISABLE) {\n *policy_flags |=\n PROCESS_CREATION_MITIGATION_POLICY_EXTENSION_POINT_DISABLE_ALWAYS_ON;\n }\n}\n\nMitigationFlags FilterPostStartupProcessMitigations(MitigationFlags flags) {\n \/\/ Anything prior to XP SP2.\n if (!IsXPSP2OrLater())\n return 0;\n\n base::win::Version version = base::win::GetVersion();\n\n \/\/ Windows XP SP2+.\n if (version < base::win::VERSION_VISTA) {\n return flags & (MITIGATION_DEP |\n MITIGATION_DEP_NO_ATL_THUNK);\n\n \/\/ Windows Vista\n if (version < base::win::VERSION_WIN7) {\n return flags & (MITIGATION_DEP |\n MITIGATION_DEP_NO_ATL_THUNK |\n MITIGATION_BOTTOM_UP_ASLR |\n MITIGATION_DLL_SEARCH_ORDER |\n MITIGATION_HEAP_TERMINATE);\n }\n\n \/\/ Windows 7 and Vista.\n } else if (version < base::win::VERSION_WIN8) {\n return flags & (MITIGATION_BOTTOM_UP_ASLR |\n MITIGATION_DLL_SEARCH_ORDER |\n MITIGATION_HEAP_TERMINATE);\n }\n\n \/\/ Windows 8 and above.\n return flags & (MITIGATION_BOTTOM_UP_ASLR |\n MITIGATION_DLL_SEARCH_ORDER);\n}\n\nbool ApplyProcessMitigationsToSuspendedProcess(HANDLE process,\n MitigationFlags flags) {\n\/\/ This is a hack to fake a weak bottom-up ASLR on 32-bit Windows.\n#if !defined(_WIN64)\n if (flags & MITIGATION_BOTTOM_UP_ASLR) {\n unsigned int limit;\n rand_s(&limit);\n char* ptr = 0;\n const size_t kMask64k = 0xFFFF;\n \/\/ Random range (512k-16.5mb) in 64k steps.\n const char* end = ptr + ((((limit % 16384) + 512) * 1024) & ~kMask64k);\n while (ptr < end) {\n MEMORY_BASIC_INFORMATION memory_info;\n if (!::VirtualQueryEx(process, ptr, &memory_info, sizeof(memory_info)))\n break;\n size_t size = std::min((memory_info.RegionSize + kMask64k) & ~kMask64k,\n static_cast<SIZE_T>(end - ptr));\n if (ptr && memory_info.State == MEM_FREE)\n ::VirtualAllocEx(process, ptr, size, MEM_RESERVE, PAGE_NOACCESS);\n ptr += size;\n }\n }\n#endif\n\n return true;\n}\n\nbool CanSetProcessMitigationsPostStartup(MitigationFlags flags) {\n \/\/ All of these mitigations can be enabled after startup.\n return !(flags & ~(MITIGATION_HEAP_TERMINATE |\n MITIGATION_DEP |\n MITIGATION_DEP_NO_ATL_THUNK |\n MITIGATION_RELOCATE_IMAGE |\n MITIGATION_RELOCATE_IMAGE_REQUIRED |\n MITIGATION_BOTTOM_UP_ASLR |\n MITIGATION_STRICT_HANDLE_CHECKS |\n MITIGATION_WIN32K_DISABLE |\n MITIGATION_EXTENSION_DLL_DISABLE |\n MITIGATION_DLL_SEARCH_ORDER));\n}\n\nbool CanSetProcessMitigationsPreStartup(MitigationFlags flags) {\n \/\/ These mitigations cannot be enabled prior to startup.\n return !(flags & (MITIGATION_STRICT_HANDLE_CHECKS |\n MITIGATION_WIN32K_DISABLE |\n MITIGATION_DLL_SEARCH_ORDER));\n}\n\n} \/\/ namespace sandbox\n\n<commit_msg>Fix unreachable code in sandbox\/. Found with MSVC warning 4702.<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 \"sandbox\/win\/src\/process_mitigations.h\"\n\n#include <algorithm>\n\n#include \"base\/win\/windows_version.h\"\n#include \"sandbox\/win\/src\/nt_internals.h\"\n#include \"sandbox\/win\/src\/sandbox_utils.h\"\n#include \"sandbox\/win\/src\/win_utils.h\"\n\nnamespace {\n\n\/\/ Functions for enabling policies.\ntypedef BOOL (WINAPI *SetProcessDEPPolicyFunction)(DWORD dwFlags);\n\ntypedef BOOL (WINAPI *SetProcessMitigationPolicyFunction)(\n PROCESS_MITIGATION_POLICY mitigation_policy,\n PVOID buffer,\n SIZE_T length);\n\ntypedef BOOL (WINAPI *SetDefaultDllDirectoriesFunction)(\n DWORD DirectoryFlags);\n\n} \/\/ namespace\n\nnamespace sandbox {\n\nbool ApplyProcessMitigationsToCurrentProcess(MitigationFlags flags) {\n if (!CanSetProcessMitigationsPostStartup(flags))\n return false;\n\n \/\/ We can't apply anything before Win XP, so just return cleanly.\n if (!IsXPSP2OrLater())\n return true;\n\n base::win::Version version = base::win::GetVersion();\n HMODULE module = ::GetModuleHandleA(\"kernel32.dll\");\n\n if (version >= base::win::VERSION_VISTA &&\n (flags & MITIGATION_DLL_SEARCH_ORDER)) {\n SetDefaultDllDirectoriesFunction set_default_dll_directories =\n reinterpret_cast<SetDefaultDllDirectoriesFunction>(\n ::GetProcAddress(module, \"SetDefaultDllDirectories\"));\n\n \/\/ Check for SetDefaultDllDirectories since it requires KB2533623.\n if (set_default_dll_directories) {\n if (!set_default_dll_directories(LOAD_LIBRARY_SEARCH_DEFAULT_DIRS) &&\n ERROR_ACCESS_DENIED != ::GetLastError()) {\n return false;\n }\n }\n }\n\n \/\/ Set the heap to terminate on corruption\n if (version >= base::win::VERSION_VISTA &&\n (flags & MITIGATION_HEAP_TERMINATE)) {\n if (!::HeapSetInformation(NULL, HeapEnableTerminationOnCorruption,\n NULL, 0) &&\n ERROR_ACCESS_DENIED != ::GetLastError()) {\n return false;\n }\n }\n\n#if !defined(_WIN64) \/\/ DEP is always enabled on 64-bit.\n if (flags & MITIGATION_DEP) {\n DWORD dep_flags = PROCESS_DEP_ENABLE;\n \/\/ DEP support is quirky on XP, so don't force a failure in that case.\n const bool return_on_fail = version >= base::win::VERSION_VISTA;\n\n if (flags & MITIGATION_DEP_NO_ATL_THUNK)\n dep_flags |= PROCESS_DEP_DISABLE_ATL_THUNK_EMULATION;\n\n SetProcessDEPPolicyFunction set_process_dep_policy =\n reinterpret_cast<SetProcessDEPPolicyFunction>(\n ::GetProcAddress(module, \"SetProcessDEPPolicy\"));\n if (set_process_dep_policy) {\n if (!set_process_dep_policy(dep_flags) &&\n ERROR_ACCESS_DENIED != ::GetLastError() && return_on_fail) {\n return false;\n }\n } else {\n \/\/ We're on XP sp2, so use the less standard approach.\n \/\/ For reference: http:\/\/www.uninformed.org\/?v=2&a=4\n const int MEM_EXECUTE_OPTION_ENABLE = 1;\n const int MEM_EXECUTE_OPTION_DISABLE = 2;\n const int MEM_EXECUTE_OPTION_ATL7_THUNK_EMULATION = 4;\n const int MEM_EXECUTE_OPTION_PERMANENT = 8;\n\n NtSetInformationProcessFunction set_information_process = NULL;\n ResolveNTFunctionPtr(\"NtSetInformationProcess\",\n &set_information_process);\n if (!set_information_process)\n return false;\n ULONG dep = MEM_EXECUTE_OPTION_DISABLE | MEM_EXECUTE_OPTION_PERMANENT;\n if (!(dep_flags & PROCESS_DEP_DISABLE_ATL_THUNK_EMULATION))\n dep |= MEM_EXECUTE_OPTION_ATL7_THUNK_EMULATION;\n if (!SUCCEEDED(set_information_process(GetCurrentProcess(),\n ProcessExecuteFlags,\n &dep, sizeof(dep))) &&\n ERROR_ACCESS_DENIED != ::GetLastError() && return_on_fail) {\n return false;\n }\n }\n }\n#endif\n\n \/\/ This is all we can do in Win7 and below.\n if (version < base::win::VERSION_WIN8)\n return true;\n\n SetProcessMitigationPolicyFunction set_process_mitigation_policy =\n reinterpret_cast<SetProcessMitigationPolicyFunction>(\n ::GetProcAddress(module, \"SetProcessMitigationPolicy\"));\n if (!set_process_mitigation_policy)\n return false;\n\n \/\/ Enable ASLR policies.\n if (flags & MITIGATION_RELOCATE_IMAGE) {\n PROCESS_MITIGATION_ASLR_POLICY policy = { 0 };\n policy.EnableForceRelocateImages = true;\n policy.DisallowStrippedImages = (flags &\n MITIGATION_RELOCATE_IMAGE_REQUIRED) ==\n MITIGATION_RELOCATE_IMAGE_REQUIRED;\n\n if (!set_process_mitigation_policy(ProcessASLRPolicy, &policy,\n sizeof(policy)) &&\n ERROR_ACCESS_DENIED != ::GetLastError()) {\n return false;\n }\n }\n\n \/\/ Enable strict handle policies.\n if (flags & MITIGATION_STRICT_HANDLE_CHECKS) {\n PROCESS_MITIGATION_STRICT_HANDLE_CHECK_POLICY policy = { 0 };\n policy.HandleExceptionsPermanentlyEnabled =\n policy.RaiseExceptionOnInvalidHandleReference = true;\n\n if (!set_process_mitigation_policy(ProcessStrictHandleCheckPolicy, &policy,\n sizeof(policy)) &&\n ERROR_ACCESS_DENIED != ::GetLastError()) {\n return false;\n }\n }\n\n \/\/ Enable system call policies.\n if (flags & MITIGATION_WIN32K_DISABLE) {\n PROCESS_MITIGATION_SYSTEM_CALL_DISABLE_POLICY policy = { 0 };\n policy.DisallowWin32kSystemCalls = true;\n\n if (!set_process_mitigation_policy(ProcessSystemCallDisablePolicy, &policy,\n sizeof(policy)) &&\n ERROR_ACCESS_DENIED != ::GetLastError()) {\n return false;\n }\n }\n\n \/\/ Enable system call policies.\n if (flags & MITIGATION_EXTENSION_DLL_DISABLE) {\n PROCESS_MITIGATION_EXTENSION_POINT_DISABLE_POLICY policy = { 0 };\n policy.DisableExtensionPoints = true;\n\n if (!set_process_mitigation_policy(ProcessExtensionPointDisablePolicy,\n &policy, sizeof(policy)) &&\n ERROR_ACCESS_DENIED != ::GetLastError()) {\n return false;\n }\n }\n\n return true;\n}\n\nvoid ConvertProcessMitigationsToPolicy(MitigationFlags flags,\n DWORD64* policy_flags, size_t* size) {\n base::win::Version version = base::win::GetVersion();\n\n *policy_flags = 0;\n#if defined(_WIN64)\n *size = sizeof(*policy_flags);\n#elif defined(_M_IX86)\n \/\/ A 64-bit flags attribute is illegal on 32-bit Win 7 and below.\n if (version < base::win::VERSION_WIN8)\n *size = sizeof(DWORD);\n else\n *size = sizeof(*policy_flags);\n#else\n#error This platform is not supported.\n#endif\n\n \/\/ Nothing for Win XP or Vista.\n if (version <= base::win::VERSION_VISTA)\n return;\n\n \/\/ DEP and SEHOP are not valid for 64-bit Windows\n#if !defined(_WIN64)\n if (flags & MITIGATION_DEP) {\n *policy_flags |= PROCESS_CREATION_MITIGATION_POLICY_DEP_ENABLE;\n if (!(flags & MITIGATION_DEP_NO_ATL_THUNK))\n *policy_flags |= PROCESS_CREATION_MITIGATION_POLICY_DEP_ATL_THUNK_ENABLE;\n }\n\n if (flags & MITIGATION_SEHOP)\n *policy_flags |= PROCESS_CREATION_MITIGATION_POLICY_SEHOP_ENABLE;\n#endif\n\n \/\/ Win 7\n if (version < base::win::VERSION_WIN8)\n return;\n\n if (flags & MITIGATION_RELOCATE_IMAGE) {\n *policy_flags |=\n PROCESS_CREATION_MITIGATION_POLICY_FORCE_RELOCATE_IMAGES_ALWAYS_ON;\n if (flags & MITIGATION_RELOCATE_IMAGE_REQUIRED) {\n *policy_flags |=\n PROCESS_CREATION_MITIGATION_POLICY_FORCE_RELOCATE_IMAGES_ALWAYS_ON_REQ_RELOCS;\n }\n }\n\n if (flags & MITIGATION_HEAP_TERMINATE) {\n *policy_flags |=\n PROCESS_CREATION_MITIGATION_POLICY_HEAP_TERMINATE_ALWAYS_ON;\n }\n\n if (flags & MITIGATION_BOTTOM_UP_ASLR) {\n *policy_flags |=\n PROCESS_CREATION_MITIGATION_POLICY_BOTTOM_UP_ASLR_ALWAYS_ON;\n }\n\n if (flags & MITIGATION_HIGH_ENTROPY_ASLR) {\n *policy_flags |=\n PROCESS_CREATION_MITIGATION_POLICY_HIGH_ENTROPY_ASLR_ALWAYS_ON;\n }\n\n if (flags & MITIGATION_STRICT_HANDLE_CHECKS) {\n *policy_flags |=\n PROCESS_CREATION_MITIGATION_POLICY_STRICT_HANDLE_CHECKS_ALWAYS_ON;\n }\n\n if (flags & MITIGATION_WIN32K_DISABLE) {\n *policy_flags |=\n PROCESS_CREATION_MITIGATION_POLICY_WIN32K_SYSTEM_CALL_DISABLE_ALWAYS_ON;\n }\n\n if (flags & MITIGATION_EXTENSION_DLL_DISABLE) {\n *policy_flags |=\n PROCESS_CREATION_MITIGATION_POLICY_EXTENSION_POINT_DISABLE_ALWAYS_ON;\n }\n}\n\nMitigationFlags FilterPostStartupProcessMitigations(MitigationFlags flags) {\n \/\/ Anything prior to XP SP2.\n if (!IsXPSP2OrLater())\n return 0;\n\n base::win::Version version = base::win::GetVersion();\n\n \/\/ Windows XP SP2+.\n if (version < base::win::VERSION_VISTA) {\n return flags & (MITIGATION_DEP |\n MITIGATION_DEP_NO_ATL_THUNK);\n }\n\n \/\/ Windows Vista\n if (version < base::win::VERSION_WIN7) {\n return flags & (MITIGATION_DEP |\n MITIGATION_DEP_NO_ATL_THUNK |\n MITIGATION_BOTTOM_UP_ASLR |\n MITIGATION_DLL_SEARCH_ORDER |\n MITIGATION_HEAP_TERMINATE);\n }\n\n \/\/ Windows 7.\n if (version < base::win::VERSION_WIN8) {\n return flags & (MITIGATION_BOTTOM_UP_ASLR |\n MITIGATION_DLL_SEARCH_ORDER |\n MITIGATION_HEAP_TERMINATE);\n }\n\n \/\/ Windows 8 and above.\n return flags & (MITIGATION_BOTTOM_UP_ASLR |\n MITIGATION_DLL_SEARCH_ORDER);\n}\n\nbool ApplyProcessMitigationsToSuspendedProcess(HANDLE process,\n MitigationFlags flags) {\n\/\/ This is a hack to fake a weak bottom-up ASLR on 32-bit Windows.\n#if !defined(_WIN64)\n if (flags & MITIGATION_BOTTOM_UP_ASLR) {\n unsigned int limit;\n rand_s(&limit);\n char* ptr = 0;\n const size_t kMask64k = 0xFFFF;\n \/\/ Random range (512k-16.5mb) in 64k steps.\n const char* end = ptr + ((((limit % 16384) + 512) * 1024) & ~kMask64k);\n while (ptr < end) {\n MEMORY_BASIC_INFORMATION memory_info;\n if (!::VirtualQueryEx(process, ptr, &memory_info, sizeof(memory_info)))\n break;\n size_t size = std::min((memory_info.RegionSize + kMask64k) & ~kMask64k,\n static_cast<SIZE_T>(end - ptr));\n if (ptr && memory_info.State == MEM_FREE)\n ::VirtualAllocEx(process, ptr, size, MEM_RESERVE, PAGE_NOACCESS);\n ptr += size;\n }\n }\n#endif\n\n return true;\n}\n\nbool CanSetProcessMitigationsPostStartup(MitigationFlags flags) {\n \/\/ All of these mitigations can be enabled after startup.\n return !(flags & ~(MITIGATION_HEAP_TERMINATE |\n MITIGATION_DEP |\n MITIGATION_DEP_NO_ATL_THUNK |\n MITIGATION_RELOCATE_IMAGE |\n MITIGATION_RELOCATE_IMAGE_REQUIRED |\n MITIGATION_BOTTOM_UP_ASLR |\n MITIGATION_STRICT_HANDLE_CHECKS |\n MITIGATION_WIN32K_DISABLE |\n MITIGATION_EXTENSION_DLL_DISABLE |\n MITIGATION_DLL_SEARCH_ORDER));\n}\n\nbool CanSetProcessMitigationsPreStartup(MitigationFlags flags) {\n \/\/ These mitigations cannot be enabled prior to startup.\n return !(flags & (MITIGATION_STRICT_HANDLE_CHECKS |\n MITIGATION_WIN32K_DISABLE |\n MITIGATION_DLL_SEARCH_ORDER));\n}\n\n} \/\/ namespace sandbox\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\/\/ $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\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 mAttendees = i.attendees();\n mFloats = i.mFloats;\n mLastModified = i.mLastModified;\n mPilotId = i.mPilotId;\n mSyncStatus = i.mSyncStatus;\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><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\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 mAttendees = i.attendees();\n mFloats = i.mFloats;\n mLastModified = i.mLastModified;\n mPilotId = i.mPilotId;\n mSyncStatus = i.mSyncStatus;\n mObserver = i.mObserver;\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>#pragma once\n\n#include \"..\/expr.hpp\"\n\nnamespace wrd {\n\n \/*class blockExpr : public expr {\n WRD(CLASS(blockExpr, expr))\n\n public:\n };*\/\n}\n<commit_msg>wrd: feat: add blockExpr<commit_after>#pragma once\n\n#include \"..\/expr.hpp\"\n#include \"..\/..\/frame\/frameInteractable.hpp\"\n\nnamespace wrd {\n\n class blockExpr : public expr, public frameInteractable {\n WRD(CLASS(blockExpr, expr))\n friend class mgdFunc;\n\n public:\n blockExpr() {}\n blockExpr(std::initializer_list<const expr*> elems): _exprs(elems) {}\n template <typename... Es>\n blockExpr(const Es&... elems): _exprs(elems...) {}\n\n public:\n const tnarr<expr>& getExprs() const { return _exprs; }\n tnarr<expr>& getExprs() { return _exprs; }\n\n str run(const containable& args) override {\n \/\/ TODO:\n return str();\n }\n\n const wtype& getEvalType() const override {\n wcnt len = _exprs.len();\n if(len <= 0) return nulOf<wtype>();\n\n return _exprs[len-1].getEvalType();\n }\n\n protected:\n wbool _onInFrame(frame& fr, const ncontainer& args) override;\n wbool _onOutFrame(frame& fr, const ncontainer& args) override;\n\n private:\n tnarr<expr> _exprs;\n };\n}\n<|endoftext|>"} {"text":"<commit_before>#include \"vehicle.h\"\n#include \"game\/resources\/vehiclefactory.h\"\n#include <cfloat>\n#include <random>\n\nstd::default_random_engine rng;\n\nnamespace OpenApoc {\n\nVehicle::Vehicle(VehicleDefinition &def)\n\t: def(def)\n{\n\n}\n\nVehicle::~Vehicle()\n{\n\n}\n\nclass VehicleRandomWalk : public VehicleMission\n{\npublic:\n\tstd::uniform_int_distribution<int> distribution;\n\tVehicleRandomWalk(Vehicle &vehicle)\n\t\t: VehicleMission(vehicle), distribution(-1,1)\n\t\t\t{};\n\tvirtual Vec3<float> getNextDestination()\n\t{\n\t\tFlyingVehicle &v = dynamic_cast<FlyingVehicle&>(*this->vehicle.tileObject);\n\t\tTileMap &map = v.owningTile->map;\n\t\tVec3<int> nextPosition;\n\t\tint tries = 0;\n\t\tdo {\n\t\t\tnextPosition = {v.position.x, v.position.y, v.position.z};\n\t\t\tVec3<int> diff {distribution(rng), distribution(rng), distribution(rng)};\n\t\t\tnextPosition += diff;\n\t\t\t\/\/FIXME HACK - abort after some attempts (e.g. if we're completely trapped)\n\t\t\t\/\/and just phase through whatever obstruction is there\n\t\t\ttries++;\n\t\t\t\/\/Keep looping until we find an empty tile within the map\n\t\t} while (nextPosition.x >= map.size.x || nextPosition.x < 0 ||\n\t\t\tnextPosition.y >= map.size.y || nextPosition.y < 0 ||\n\t\t\tnextPosition.z >= map.size.z || nextPosition.z < 0\n\t\t\t\/\/FIXME: Proper routing\/obstruction handling\n\t\t\t\/\/(This below could cause an infinite loop if a vehicle gets 'trapped'\n\t\t\t|| (tries < 50 && !map.tiles[nextPosition.z][nextPosition.y][nextPosition.z].objects.empty()));\n\t\treturn Vec3<float>{nextPosition.x, nextPosition.y, nextPosition.z};\n\t}\n};\n\n\nclass FlyingVehicleMover : public VehicleMover\n{\npublic:\n\tVec3<float> goalPosition;\n\tfloat speed;\n\tFlyingVehicleMover(Vehicle &v)\n\t\t: VehicleMover(v)\n\t{\n\t\tstd::uniform_real_distribution<float> distribution(-0.02, 0.02);\n\t\tgoalPosition.x = -1.0f;\n\t\t\/\/Tweak the speed slightly, makes everything a little less synchronised\n\t\tspeed = 0.05 + distribution(rng);\n\t}\n\tvirtual void update(unsigned int ticks)\n\t{\n\t\tFlyingVehicle &v = dynamic_cast<FlyingVehicle&>(*this->vehicle.tileObject);\n\t\tif (goalPosition.x == -1.0f)\n\t\t\tgoalPosition = v.mission->getNextDestination();\n\t\tfloat distanceLeft = speed * ticks;\n\t\twhile (distanceLeft > 0)\n\t\t{\n\t\t\tVec3<float> vectorToGoal = goalPosition -\n\t\t\t\tv.position;\n\t\t\tfloat distanceToGoal = glm::length(vectorToGoal);\n\t\t\tif (distanceToGoal <= distanceLeft)\n\t\t\t{\n\t\t\t\tdistanceLeft -= distanceToGoal;\n\t\t\t\tv.position = goalPosition;\n\t\t\t\tgoalPosition = v.mission->getNextDestination();\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\tv.direction = vectorToGoal;\n\t\t\t\tv.position += distanceLeft * glm::normalize(vectorToGoal);\n\t\t\t\tdistanceLeft = -1;\n\t\t\t}\n\t\t}\n\t\tVec3<int> currentTile{v.position.x, v.position.y, v.position.z};\n\t\tif (currentTile != v.owningTile->position)\n\t\t{\n\t\t\tfor (auto o : v.owningTile->objects)\n\t\t\t{\n\t\t\t\tif (o.get() == &v)\n\t\t\t\t{\n\t\t\t\t\tauto &map = v.owningTile->map;\n\t\t\t\t\tv.owningTile->objects.remove(o);\n\t\t\t\t\tv.owningTile = &map.tiles[currentTile.z][currentTile.y][currentTile.x];\n\t\t\t\t\tv.owningTile->objects.push_back(o);\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\t\/\/FIXME: change owning tile?\n\t\t\/\/I've possibly backed myself into a corner here, how I can 'change' the owning tile\n\t\t\/\/when the update loop is current iterating over said list? Removing it causes the\n\t\t\/\/parent iterator to become invalid (crashing), and adding it to a new tile\n\t\t\/\/could cause it to be updated again when \/that\/ tile is processed.\n\t}\n};\n\nVehicleMission::VehicleMission(Vehicle &v)\n\t: vehicle(v)\n{\n\n}\n\nVehicleMission::~VehicleMission()\n{\n\n}\n\nVehicleMover::VehicleMover(Vehicle &v)\n: vehicle(v)\n{\n\n}\n\nVehicleMover::~VehicleMover()\n{\n\n}\nFlyingVehicle::FlyingVehicle(Vehicle &vehicle, Tile *owningTile)\n\t: TileObject(owningTile, Vec3<float>(owningTile->position), vehicle.def.size, true, true, std::shared_ptr<Image>(nullptr)), vehicle(vehicle), direction(0, 1, 0)\n{\n\tassert(!vehicle.tileObject);\n\tthis->mission.reset(new VehicleRandomWalk(vehicle));\n\tthis->mover.reset(new FlyingVehicleMover(vehicle));\n\n}\n\nFlyingVehicle::~FlyingVehicle()\n{\n\n}\n\nvoid\nFlyingVehicle::update(unsigned int ticks)\n{\n\tif (this->mover)\n\t\tmover->update(ticks);\n}\n\nconst std::vector<std::pair<Vec3<float>, Vehicle::Direction>> directions =\n{\n\t{{ 0, 1, 0}, Vehicle::Direction::N},\n\t{{ 1, 1, 0}, Vehicle::Direction::NE},\n\t{{ 1, 0, 0}, Vehicle::Direction::E},\n\t{{ 1,-1, 0}, Vehicle::Direction::SE},\n\t{{ 0,-1, 0}, Vehicle::Direction::S},\n\t{{-1,-1, 0}, Vehicle::Direction::SW},\n\t{{-1, 0, 0}, Vehicle::Direction::W},\n\t{{-1, 1, 0}, Vehicle::Direction::NW},\n};\n\nstatic Vehicle::Direction findClosestDirection(Vec3<float> v)\n{\n\tVehicle::Direction d = Vehicle::Direction::N;\n\t\/\/Reset Z (We don't care about ascending\/decending)\n\tv.z = 0;\n\tfloat a = FLT_MAX;\n\tfor (auto &p : directions)\n\t{\n\t\tfloat angle = fabs(glm::angle(glm::normalize(p.first), glm::normalize(v)));\n\t\tif (angle < a)\n\t\t{\n\t\t\ta = angle;\n\t\t\td = p.second;\n\t\t}\n\t}\n\treturn d;\n}\n\n\nImage&\nFlyingVehicle::getSprite()\n{\n\t\/\/TODO: Banking selection logic\n\tVehicle::Direction d = findClosestDirection(this->direction);\n\treturn *this->vehicle.def.sprites[Vehicle::Banking::Flat][d];\n}\n\nvoid\nFlyingVehicle::processCollision(TileObject &otherObject)\n{\n\t\/\/TODO: Vehicle collision\n}\n\n}; \/\/namespace OpenApoc\n<commit_msg>Fix vehicle direction spritest (N\/S was inverted)<commit_after>#include \"vehicle.h\"\n#include \"game\/resources\/vehiclefactory.h\"\n#include <cfloat>\n#include <random>\n\nstd::default_random_engine rng;\n\nnamespace OpenApoc {\n\nVehicle::Vehicle(VehicleDefinition &def)\n\t: def(def)\n{\n\n}\n\nVehicle::~Vehicle()\n{\n\n}\n\nclass VehicleRandomWalk : public VehicleMission\n{\npublic:\n\tstd::uniform_int_distribution<int> distribution;\n\tVehicleRandomWalk(Vehicle &vehicle)\n\t\t: VehicleMission(vehicle), distribution(-1,1)\n\t\t\t{};\n\tvirtual Vec3<float> getNextDestination()\n\t{\n\t\tFlyingVehicle &v = dynamic_cast<FlyingVehicle&>(*this->vehicle.tileObject);\n\t\tTileMap &map = v.owningTile->map;\n\t\tVec3<int> nextPosition;\n\t\tint tries = 0;\n\t\tdo {\n\t\t\tnextPosition = {v.position.x, v.position.y, v.position.z};\n\t\t\tVec3<int> diff {distribution(rng), distribution(rng), distribution(rng)};\n\t\t\tnextPosition += diff;\n\t\t\t\/\/FIXME HACK - abort after some attempts (e.g. if we're completely trapped)\n\t\t\t\/\/and just phase through whatever obstruction is there\n\t\t\ttries++;\n\t\t\t\/\/Keep looping until we find an empty tile within the map\n\t\t} while (nextPosition.x >= map.size.x || nextPosition.x < 0 ||\n\t\t\tnextPosition.y >= map.size.y || nextPosition.y < 0 ||\n\t\t\tnextPosition.z >= map.size.z || nextPosition.z < 0\n\t\t\t\/\/FIXME: Proper routing\/obstruction handling\n\t\t\t\/\/(This below could cause an infinite loop if a vehicle gets 'trapped'\n\t\t\t|| (tries < 50 && !map.tiles[nextPosition.z][nextPosition.y][nextPosition.z].objects.empty()));\n\t\treturn Vec3<float>{nextPosition.x, nextPosition.y, nextPosition.z};\n\t}\n};\n\n\nclass FlyingVehicleMover : public VehicleMover\n{\npublic:\n\tVec3<float> goalPosition;\n\tfloat speed;\n\tFlyingVehicleMover(Vehicle &v)\n\t\t: VehicleMover(v)\n\t{\n\t\tstd::uniform_real_distribution<float> distribution(-0.02, 0.02);\n\t\tgoalPosition.x = -1.0f;\n\t\t\/\/Tweak the speed slightly, makes everything a little less synchronised\n\t\tspeed = 0.05 + distribution(rng);\n\t}\n\tvirtual void update(unsigned int ticks)\n\t{\n\t\tFlyingVehicle &v = dynamic_cast<FlyingVehicle&>(*this->vehicle.tileObject);\n\t\tif (goalPosition.x == -1.0f)\n\t\t\tgoalPosition = v.mission->getNextDestination();\n\t\tfloat distanceLeft = speed * ticks;\n\t\twhile (distanceLeft > 0)\n\t\t{\n\t\t\tVec3<float> vectorToGoal = goalPosition -\n\t\t\t\tv.position;\n\t\t\tfloat distanceToGoal = glm::length(vectorToGoal);\n\t\t\tif (distanceToGoal <= distanceLeft)\n\t\t\t{\n\t\t\t\tdistanceLeft -= distanceToGoal;\n\t\t\t\tv.position = goalPosition;\n\t\t\t\tgoalPosition = v.mission->getNextDestination();\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\tv.direction = vectorToGoal;\n\t\t\t\tv.position += distanceLeft * glm::normalize(vectorToGoal);\n\t\t\t\tdistanceLeft = -1;\n\t\t\t}\n\t\t}\n\t\tVec3<int> currentTile{v.position.x, v.position.y, v.position.z};\n\t\tif (currentTile != v.owningTile->position)\n\t\t{\n\t\t\tfor (auto o : v.owningTile->objects)\n\t\t\t{\n\t\t\t\tif (o.get() == &v)\n\t\t\t\t{\n\t\t\t\t\tauto &map = v.owningTile->map;\n\t\t\t\t\tv.owningTile->objects.remove(o);\n\t\t\t\t\tv.owningTile = &map.tiles[currentTile.z][currentTile.y][currentTile.x];\n\t\t\t\t\tv.owningTile->objects.push_back(o);\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\t\/\/FIXME: change owning tile?\n\t\t\/\/I've possibly backed myself into a corner here, how I can 'change' the owning tile\n\t\t\/\/when the update loop is current iterating over said list? Removing it causes the\n\t\t\/\/parent iterator to become invalid (crashing), and adding it to a new tile\n\t\t\/\/could cause it to be updated again when \/that\/ tile is processed.\n\t}\n};\n\nVehicleMission::VehicleMission(Vehicle &v)\n\t: vehicle(v)\n{\n\n}\n\nVehicleMission::~VehicleMission()\n{\n\n}\n\nVehicleMover::VehicleMover(Vehicle &v)\n: vehicle(v)\n{\n\n}\n\nVehicleMover::~VehicleMover()\n{\n\n}\nFlyingVehicle::FlyingVehicle(Vehicle &vehicle, Tile *owningTile)\n\t: TileObject(owningTile, Vec3<float>(owningTile->position), vehicle.def.size, true, true, std::shared_ptr<Image>(nullptr)), vehicle(vehicle), direction(0, 1, 0)\n{\n\tassert(!vehicle.tileObject);\n\tthis->mission.reset(new VehicleRandomWalk(vehicle));\n\tthis->mover.reset(new FlyingVehicleMover(vehicle));\n\n}\n\nFlyingVehicle::~FlyingVehicle()\n{\n\n}\n\nvoid\nFlyingVehicle::update(unsigned int ticks)\n{\n\tif (this->mover)\n\t\tmover->update(ticks);\n}\n\nconst std::vector<std::pair<Vec3<float>, Vehicle::Direction>> directions =\n{\n\t{{ 0,-1, 0}, Vehicle::Direction::N},\n\t{{ 1,-1, 0}, Vehicle::Direction::NE},\n\t{{ 1, 0, 0}, Vehicle::Direction::E},\n\t{{ 1, 1, 0}, Vehicle::Direction::SE},\n\t{{ 0, 1, 0}, Vehicle::Direction::S},\n\t{{-1, 1, 0}, Vehicle::Direction::SW},\n\t{{-1, 0, 0}, Vehicle::Direction::W},\n\t{{-1,-1, 0}, Vehicle::Direction::NW},\n};\n\nstatic Vehicle::Direction findClosestDirection(Vec3<float> v)\n{\n\tVehicle::Direction d = Vehicle::Direction::N;\n\t\/\/Reset Z (We don't care about ascending\/decending)\n\tv.z = 0;\n\tfloat a = FLT_MAX;\n\tfor (auto &p : directions)\n\t{\n\t\tfloat angle = fabs(glm::angle(glm::normalize(p.first), glm::normalize(v)));\n\t\tif (angle < a)\n\t\t{\n\t\t\ta = angle;\n\t\t\td = p.second;\n\t\t}\n\t}\n\treturn d;\n}\n\n\nImage&\nFlyingVehicle::getSprite()\n{\n\t\/\/TODO: Banking selection logic\n\tVehicle::Direction d = findClosestDirection(this->direction);\n\treturn *this->vehicle.def.sprites[Vehicle::Banking::Flat][d];\n}\n\nvoid\nFlyingVehicle::processCollision(TileObject &otherObject)\n{\n\t\/\/TODO: Vehicle collision\n}\n\n}; \/\/namespace OpenApoc\n<|endoftext|>"} {"text":"<commit_before>\/*\n * Copyright (C) 2015 deipi.com LLC and contributors. 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\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 \"exception.h\"\n\n#include \"log.h\"\n\n#include <string.h>\n#include <execinfo.h>\n#include <cxxabi.h>\n#include <stdarg.h>\n\n#define BUFFER_SIZE 1024\n\n\nconst char* Error::init_traceback()\n{\n\tvoid* callstack[128];\n\n\t\/\/ retrieve current stack addresses\n\tint frames = backtrace(callstack, sizeof(callstack) \/ sizeof(void*));\n\n\ttraceback = \"Traceback:\";\n\n\tif (frames == 0) {\n\t\ttraceback += \"\\n <empty, possibly corrupt>\";\n\t\treturn traceback.c_str();\n\t}\n\n\t\/\/ resolve addresses into strings containing \"filename(function+address)\"\n\tchar** strs = backtrace_symbols(callstack, frames);\n\n\t\/\/ iterate over the returned symbol lines. skip the first, it is the\n\t\/\/ address of this function.\n\tfor (int i = 0; i < frames; i++) {\n\t\tint status = 0;\n\t\tconst char *sep = \"\\t ()+\";\n\t\tchar *mangled, *lasts;\n\t\tstd::string result;\n\t\tfor (mangled = strtok_r(strs[i], sep, &lasts); mangled; mangled = strtok_r(nullptr, sep, &lasts)) {\n\t\t\tchar* unmangled = abi::__cxa_demangle(mangled, NULL, 0, &status);\n\t\t\tif (!result.empty()) {\n\t\t\t\tresult += \" \";\n\t\t\t}\n\t\t\tif (status == 0) {\n\t\t\t\tresult += unmangled;\n\t\t\t} else {\n\t\t\t\tresult += mangled;\n\t\t\t}\n\t\t\tfree(unmangled);\n\t\t}\n\t\ttraceback += \"\\n \" + result;\n\t}\n\n\tfree(strs);\n\n\treturn traceback.c_str();\n}\n\nError::Error(const char *filename, int line, const char *format, ...)\n\t: std::runtime_error(\"\")\n{\n\tchar buffer[BUFFER_SIZE];\n\n\tva_list argptr;\n\tva_start(argptr, format);\n\tvsnprintf(buffer, BUFFER_SIZE, format, argptr);\n\tva_end(argptr);\n\tmsg.assign(buffer);\n\n\tsnprintf(buffer, BUFFER_SIZE, \"%s:%d\", filename, line);\n\tcontext.assign(std::string(buffer) + \": \" + msg);\n\n\tL_TRACEBACK(\"%s\\n\", init_traceback());\n}\n<commit_msg>Tweaks<commit_after>\/*\n * Copyright (C) 2015 deipi.com LLC and contributors. 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\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 \"exception.h\"\n\n#include \"log.h\"\n\n#include <string.h>\n#include <execinfo.h>\n#include <cxxabi.h>\n#include <stdarg.h>\n\n#define BUFFER_SIZE 1024\n\n\nconst char*\nError::init_traceback()\n{\n\tvoid* callstack[128];\n\n\t\/\/ retrieve current stack addresses\n\tint frames = backtrace(callstack, sizeof(callstack) \/ sizeof(void*));\n\n\ttraceback = \"Traceback:\";\n\n\tif (frames == 0) {\n\t\ttraceback += \"\\n <empty, possibly corrupt>\";\n\t\treturn traceback.c_str();\n\t}\n\n\t\/\/ resolve addresses into strings containing \"filename(function+address)\"\n\tchar** strs = backtrace_symbols(callstack, frames);\n\n\t\/\/ iterate over the returned symbol lines. skip the first, it is the\n\t\/\/ address of this function.\n\tfor (int i = 0; i < frames; ++i) {\n\t\tint status = 0;\n\t\tconst char *sep = \"\\t ()+\";\n\t\tchar *mangled, *lasts;\n\t\tstd::string result;\n\t\tfor (mangled = strtok_r(strs[i], sep, &lasts); mangled; mangled = strtok_r(nullptr, sep, &lasts)) {\n\t\t\tchar* unmangled = abi::__cxa_demangle(mangled, nullptr, 0, &status);\n\t\t\tif (!result.empty()) {\n\t\t\t\tresult += \" \";\n\t\t\t}\n\t\t\tif (status == 0) {\n\t\t\t\tresult += unmangled;\n\t\t\t} else {\n\t\t\t\tresult += mangled;\n\t\t\t}\n\t\t\tfree(unmangled);\n\t\t}\n\t\ttraceback += \"\\n \" + result;\n\t}\n\n\tfree(strs);\n\n\treturn traceback.c_str();\n}\n\n\nError::Error(const char *filename, int line, const char *format, ...)\n\t: std::runtime_error(\"\")\n{\n\tchar buffer[BUFFER_SIZE];\n\n\tva_list argptr;\n\tva_start(argptr, format);\n\tvsnprintf(buffer, BUFFER_SIZE, format, argptr);\n\tva_end(argptr);\n\tmsg.assign(buffer);\n\n\tsnprintf(buffer, BUFFER_SIZE, \"%s:%d\", filename, line);\n\tcontext.assign(std::string(buffer) + \": \" + msg);\n\n\tL_TRACEBACK(\"%s\\n\", init_traceback());\n}\n<|endoftext|>"} {"text":"<commit_before>\/\/@+leo-ver=5-thin\n\/\/@+node:gcross.20110520211700.1400: * @file error.cpp\n\/\/@@language cplusplus\n\n\/\/@+<< License >>\n\/\/@+node:gcross.20110520211700.1401: ** << License >>\n\/\/@+at\n\/\/ Copyright (c) 2011, Gregory Crosswhite\n\/\/ All rights reserved.\n\/\/ \n\/\/ Redistribution and use in source and binary forms, with or without modification, are permitted provided that the following conditions are met:\n\/\/ \n\/\/ * Redistributions of source code must retain the above copyright notice, this list of conditions and the following disclaimer.\n\/\/ * Redistributions in binary form must reproduce the above copyright notice, this list of conditions and the following disclaimer in the documentation and\/or other materials provided with the distribution.\n\/\/ \n\/\/ THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS \"AS IS\" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.\n\/\/@@c\n\/\/@-<< License >>\n\n\/\/@+<< Includes >>\n\/\/@+node:gcross.20110520211700.1402: ** << Includes >>\n#include \"error.hpp\"\n\n#include <boost\/foreach.hpp>\n#include <boost\/scoped_array.hpp>\n#include <iomanip>\n#include <sstream>\n\/\/@-<< Includes >>\n\nnamespace HDF {\n\n\/\/@+<< Usings >>\n\/\/@+node:gcross.20110520211700.1403: ** << Usings >>\nusing boost::scoped_array;\n\nusing std::endl;\nusing std::ostringstream;\nusing std::setw;\nusing std::string;\nusing std::vector;\n\/\/@-<< Usings >>\n\n\/\/@+others\n\/\/@+node:gcross.20110520211700.1407: ** Classes\n\/\/@+node:gcross.20110520211700.1409: *3* Error\nError::Error(string const& description) {\n H5Ewalk(H5E_DEFAULT,H5E_WALK_UPWARD,&ErrorStackFrame::constructAndPush,&error_stack);\n\n ostringstream buffer;\n buffer << \"Error occurred while \" << description << \":\\n\";\n\n unsigned int n;\n BOOST_FOREACH(ErrorStackFrame const& frame, error_stack) {\n buffer << \" \" << setw(3) << (++n) << \": \" << frame.source_filename << \" line \" << frame.source_line << \" in \" << frame.source_function << \"()\" << endl;\n buffer << \" \" << \" - class: \" << frame.class_name << endl;\n buffer << \" \" << \" - major: \" << frame.major_message << endl;\n buffer << \" \" << \" - minor: \" << frame.minor_message << endl;\n }\n\n message = buffer.str();\n}\n\nError::~Error() throw() {}\n\nH5E_auto_t Error::hdf_func = NULL;\nvoid* Error::hdf_client_data = NULL;\n\nvoid Error::disableHDFErrorReporting() {\n H5Eset_auto(H5E_DEFAULT,NULL,NULL);\n}\n\nvoid Error::enableHDFErrorReporting() {\n H5Eset_auto(H5E_DEFAULT,hdf_func,hdf_client_data);\n}\n\nError::AutomaticDisabler::AutomaticDisabler() {\n H5Eget_auto(H5E_DEFAULT,&hdf_func,&hdf_client_data);\n disableHDFErrorReporting();\n}\n\nError::AutomaticDisabler Error::automatic_disabler;\n\/\/@+node:gcross.20110520211700.1408: *3* ErrorStackFrame\nErrorStackFrame::ErrorStackFrame(H5E_error2_t const& error_descriptor)\n : source_filename(error_descriptor.file_name)\n , source_line(error_descriptor.line)\n , source_function(error_descriptor.func_name)\n{\n {\n size_t size = H5Eget_class_name(error_descriptor.cls_id,NULL,0);\n scoped_array<char> data(new char[size+1]);\n H5Eget_class_name(error_descriptor.cls_id,data.get(),size+1);\n class_name = data.get();\n }\n {\n size_t size = H5Eget_msg(error_descriptor.maj_num,NULL,NULL,0);\n scoped_array<char> data(new char[size+1]);\n H5Eget_msg(error_descriptor.maj_num,NULL,data.get(),size+1);\n major_message = data.get();\n }\n {\n size_t size = H5Eget_msg(error_descriptor.min_num,NULL,NULL,0);\n scoped_array<char> data(new char[size+1]);\n H5Eget_msg(error_descriptor.min_num,NULL,data.get(),size+1);\n minor_message = data.get();\n }\n}\n\nherr_t ErrorStackFrame::constructAndPush(unsigned int n, H5E_error2_t const *err_desc, vector<ErrorStackFrame>* stack) {\n stack->push_back(ErrorStackFrame(*err_desc));\n return 0;\n}\n\nherr_t ErrorStackFrame::constructAndPush(unsigned int n, H5E_error2_t const *err_desc, void* stack) {\n return constructAndPush(n,err_desc,static_cast<vector<ErrorStackFrame>*>(stack));\n}\n\/\/@+node:gcross.20110521115623.2762: *3* Exception\nException::Exception() {}\n\nException::Exception(string const& message) : message(message) { }\n\nconst char* Exception::what() const throw() { return message.c_str(); }\n\nException::~Exception() throw() { }\n\/\/@-others\n\n}\n\/\/@-leo\n<commit_msg>Fixed a bug where I forgot to initialize a counter to zero.<commit_after>\/\/@+leo-ver=5-thin\n\/\/@+node:gcross.20110520211700.1400: * @file error.cpp\n\/\/@@language cplusplus\n\n\/\/@+<< License >>\n\/\/@+node:gcross.20110520211700.1401: ** << License >>\n\/\/@+at\n\/\/ Copyright (c) 2011, Gregory Crosswhite\n\/\/ All rights reserved.\n\/\/ \n\/\/ Redistribution and use in source and binary forms, with or without modification, are permitted provided that the following conditions are met:\n\/\/ \n\/\/ * Redistributions of source code must retain the above copyright notice, this list of conditions and the following disclaimer.\n\/\/ * Redistributions in binary form must reproduce the above copyright notice, this list of conditions and the following disclaimer in the documentation and\/or other materials provided with the distribution.\n\/\/ \n\/\/ THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS \"AS IS\" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.\n\/\/@@c\n\/\/@-<< License >>\n\n\/\/@+<< Includes >>\n\/\/@+node:gcross.20110520211700.1402: ** << Includes >>\n#include \"error.hpp\"\n\n#include <boost\/foreach.hpp>\n#include <boost\/scoped_array.hpp>\n#include <iomanip>\n#include <sstream>\n\/\/@-<< Includes >>\n\nnamespace HDF {\n\n\/\/@+<< Usings >>\n\/\/@+node:gcross.20110520211700.1403: ** << Usings >>\nusing boost::scoped_array;\n\nusing std::endl;\nusing std::ostringstream;\nusing std::setw;\nusing std::string;\nusing std::vector;\n\/\/@-<< Usings >>\n\n\/\/@+others\n\/\/@+node:gcross.20110520211700.1407: ** Classes\n\/\/@+node:gcross.20110520211700.1409: *3* Error\nError::Error(string const& description) {\n H5Ewalk(H5E_DEFAULT,H5E_WALK_UPWARD,&ErrorStackFrame::constructAndPush,&error_stack);\n\n ostringstream buffer;\n buffer << \"Error occurred while \" << description << \":\\n\";\n\n unsigned int n = 0;\n BOOST_FOREACH(ErrorStackFrame const& frame, error_stack) {\n buffer << \" \" << setw(3) << (++n) << \": \" << frame.source_filename << \" line \" << frame.source_line << \" in \" << frame.source_function << \"()\" << endl;\n buffer << \" \" << \" - class: \" << frame.class_name << endl;\n buffer << \" \" << \" - major: \" << frame.major_message << endl;\n buffer << \" \" << \" - minor: \" << frame.minor_message << endl;\n }\n\n message = buffer.str();\n}\n\nError::~Error() throw() {}\n\nH5E_auto_t Error::hdf_func = NULL;\nvoid* Error::hdf_client_data = NULL;\n\nvoid Error::disableHDFErrorReporting() {\n H5Eset_auto(H5E_DEFAULT,NULL,NULL);\n}\n\nvoid Error::enableHDFErrorReporting() {\n H5Eset_auto(H5E_DEFAULT,hdf_func,hdf_client_data);\n}\n\nError::AutomaticDisabler::AutomaticDisabler() {\n H5Eget_auto(H5E_DEFAULT,&hdf_func,&hdf_client_data);\n disableHDFErrorReporting();\n}\n\nError::AutomaticDisabler Error::automatic_disabler;\n\/\/@+node:gcross.20110520211700.1408: *3* ErrorStackFrame\nErrorStackFrame::ErrorStackFrame(H5E_error2_t const& error_descriptor)\n : source_filename(error_descriptor.file_name)\n , source_line(error_descriptor.line)\n , source_function(error_descriptor.func_name)\n{\n {\n size_t size = H5Eget_class_name(error_descriptor.cls_id,NULL,0);\n scoped_array<char> data(new char[size+1]);\n H5Eget_class_name(error_descriptor.cls_id,data.get(),size+1);\n class_name = data.get();\n }\n {\n size_t size = H5Eget_msg(error_descriptor.maj_num,NULL,NULL,0);\n scoped_array<char> data(new char[size+1]);\n H5Eget_msg(error_descriptor.maj_num,NULL,data.get(),size+1);\n major_message = data.get();\n }\n {\n size_t size = H5Eget_msg(error_descriptor.min_num,NULL,NULL,0);\n scoped_array<char> data(new char[size+1]);\n H5Eget_msg(error_descriptor.min_num,NULL,data.get(),size+1);\n minor_message = data.get();\n }\n}\n\nherr_t ErrorStackFrame::constructAndPush(unsigned int n, H5E_error2_t const *err_desc, vector<ErrorStackFrame>* stack) {\n stack->push_back(ErrorStackFrame(*err_desc));\n return 0;\n}\n\nherr_t ErrorStackFrame::constructAndPush(unsigned int n, H5E_error2_t const *err_desc, void* stack) {\n return constructAndPush(n,err_desc,static_cast<vector<ErrorStackFrame>*>(stack));\n}\n\/\/@+node:gcross.20110521115623.2762: *3* Exception\nException::Exception() {}\n\nException::Exception(string const& message) : message(message) { }\n\nconst char* Exception::what() const throw() { return message.c_str(); }\n\nException::~Exception() throw() { }\n\/\/@-others\n\n}\n\/\/@-leo\n<|endoftext|>"} {"text":"<commit_before>\/*********************************************************************\n *\n * Copyright (C) 2007, Simon Kagstrom\n *\n * Filename: instruction.hh\n * Author: Simon Kagstrom <simon.kagstrom@gmail.com>\n * Description: Instruction class\n *\n * $Id:$\n *\n ********************************************************************\/\n#ifndef __INSTRUCTION_HH__\n#define __INSTRUCTION_HH__\n\n#include <mips.hh>\n#include <registerallocator.hh>\n#include <syscall.hh>\n#include <entity.hh>\n\nclass JavaClass;\nclass BasicBlock;\nclass Function;\n\nclass Instruction : public Entity\n{\npublic:\n Instruction(uint32_t address, int opcode,\n\t MIPS_register_t rs, MIPS_register_t rt, MIPS_register_t rd, int32_t extra);\n\n virtual ~Instruction();\n\n virtual bool isBranch()\n {\n return false;\n }\n\n virtual bool isReturnJump()\n {\n return false;\n }\n\n virtual bool isRegisterIndirectJump()\n {\n return false;\n }\n\n mips_opcode_t getOpcode()\n {\n return (mips_opcode_t)this->opcode;\n }\n\n bool isBranchTarget()\n {\n return this->branchTarget;\n }\n\n void setBranchTarget();\n\n virtual bool isNop()\n {\n return false;\n }\n\n virtual bool pass1() = 0;\n\n virtual bool pass2() = 0;\n\n virtual int getMaxStackHeight()\n {\n return 2;\n }\n\n virtual bool hasDelaySlot()\n {\n return this->isBranch();\n }\n\n int addToRegisterUsage(MIPS_register_t reg, int *p)\n {\n if (reg == 0)\n return 0;\n p[reg]++;\n\n return 1;\n }\n\n \/**\n * Fill in the register destinations\n *\n * @param p the destinations to fill in\n *\n * @return the number of destinations filled\n *\/\n virtual int fillDestinations(int *p) { return 0; };\n\n virtual int fillSources(int *p) { return 0; };\n\n void setDelayed(Instruction *delayed)\n {\n this->delayed = delayed;\n }\n\n Instruction *getDelayed()\n {\n return this->delayed;\n }\n\n void setPrefix(Instruction *prefix)\n {\n this->prefix = prefix;\n }\n\n Instruction *getPrefix()\n {\n return this->prefix;\n }\n\n MIPS_register_t getRs() { return this->rs; }\n\n MIPS_register_t getRt() { return this->rt; }\n\n MIPS_register_t getRd() { return this->rd; }\n\n int32_t getExtra() { return this->extra; }\n\n BasicBlock *parent;\nprotected:\n int opcode;\n MIPS_register_t rs, rt, rd;\n int32_t extra;\n Instruction *delayed;\n Instruction *prefix;\n\n bool branchTarget;\n};\n\nclass Nop : public Instruction\n{\npublic:\n Nop(uint32_t address) : Instruction(address, 0, R_ZERO, R_ZERO, R_ZERO, 0)\n {\n }\n\n virtual bool isNop()\n {\n return true;\n }\n\n bool pass1()\n {\n return true;\n }\n\n bool pass2()\n {\n return true;\n }\n\n int toString(char *dst, size_t n = 255)\n {\n return snprintf(dst, n, \" \");\n }\n};\n\nclass InstructionFactory\n{\npublic:\n static InstructionFactory *getInstance();\n\n Instruction *create(uint32_t address, uint32_t encoding);\n\n Instruction *createNop();\n\nprivate:\n static InstructionFactory *instance;\n};\n\nint instruction_to_string(Instruction *insn, char *buf, int buf_len);\n\n#endif \/* !__INSTRUCTION_HH__ *\/\n<commit_msg>Moved to entity.hh<commit_after>\/*********************************************************************\n *\n * Copyright (C) 2007, Simon Kagstrom\n *\n * Filename: instruction.hh\n * Author: Simon Kagstrom <simon.kagstrom@gmail.com>\n * Description: Instruction class\n *\n * $Id:$\n *\n ********************************************************************\/\n#ifndef __INSTRUCTION_HH__\n#define __INSTRUCTION_HH__\n\n#include <mips.hh>\n#include <registerallocator.hh>\n#include <syscall.hh>\n#include <entity.hh>\n\nclass JavaClass;\nclass BasicBlock;\nclass Function;\n\nclass Instruction : public Entity\n{\npublic:\n Instruction(uint32_t address, int opcode,\n\t MIPS_register_t rs, MIPS_register_t rt, MIPS_register_t rd, int32_t extra);\n\n virtual ~Instruction();\n\n virtual bool isBranch()\n {\n return false;\n }\n\n virtual bool isReturnJump()\n {\n return false;\n }\n\n virtual bool isRegisterIndirectJump()\n {\n return false;\n }\n\n mips_opcode_t getOpcode()\n {\n return (mips_opcode_t)this->opcode;\n }\n\n bool isBranchTarget()\n {\n return this->branchTarget;\n }\n\n void setBranchTarget();\n\n virtual bool isNop()\n {\n return false;\n }\n\n virtual bool pass1() = 0;\n\n virtual bool pass2() = 0;\n\n virtual int getMaxStackHeight()\n {\n return 2;\n }\n\n virtual bool hasDelaySlot()\n {\n return this->isBranch();\n }\n\n \/**\n * Fill in the register destinations\n *\n * @param p the destinations to fill in\n *\n * @return the number of destinations filled\n *\/\n virtual int fillDestinations(int *p) { return 0; };\n\n virtual int fillSources(int *p) { return 0; };\n\n void setDelayed(Instruction *delayed)\n {\n this->delayed = delayed;\n }\n\n Instruction *getDelayed()\n {\n return this->delayed;\n }\n\n void setPrefix(Instruction *prefix)\n {\n this->prefix = prefix;\n }\n\n Instruction *getPrefix()\n {\n return this->prefix;\n }\n\n MIPS_register_t getRs() { return this->rs; }\n\n MIPS_register_t getRt() { return this->rt; }\n\n MIPS_register_t getRd() { return this->rd; }\n\n int32_t getExtra() { return this->extra; }\n\n BasicBlock *parent;\nprotected:\n int opcode;\n MIPS_register_t rs, rt, rd;\n int32_t extra;\n Instruction *delayed;\n Instruction *prefix;\n\n bool branchTarget;\n};\n\nclass Nop : public Instruction\n{\npublic:\n Nop(uint32_t address) : Instruction(address, 0, R_ZERO, R_ZERO, R_ZERO, 0)\n {\n }\n\n virtual bool isNop()\n {\n return true;\n }\n\n bool pass1()\n {\n return true;\n }\n\n bool pass2()\n {\n return true;\n }\n\n int toString(char *dst, size_t n = 255)\n {\n return snprintf(dst, n, \" \");\n }\n};\n\nclass InstructionFactory\n{\npublic:\n static InstructionFactory *getInstance();\n\n Instruction *create(uint32_t address, uint32_t encoding);\n\n Instruction *createNop();\n\nprivate:\n static InstructionFactory *instance;\n};\n\nint instruction_to_string(Instruction *insn, char *buf, int buf_len);\n\n#endif \/* !__INSTRUCTION_HH__ *\/\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\/* $Id$ *\/\n\/** @file AliFMDPreprocessor.cxx\n @author Hans Hjersing Dalsgaard <canute@nbi.dk>\n @date Mon Mar 27 12:39:09 2006\n @brief Shuttle \"preprocessor\" for the FMD\n*\/\n\/\/___________________________________________________________________\n\/\/\n\/\/ The class processes data points from DCS (via Amanada), and DAQ DA\n\/\/ files (via FXS) to make calibration data for the FMD. \n\/\/\n\/\/ Data points: \n\/\/ * Nothing yet. \n\/\/\n\/\/ DAQ FXS file:\n\/\/ * pedestals - a (ASCII) Comma Separated Values files with the\n\/\/ fields \n\/\/ rcu\t DDL number \n\/\/ board FEC board number \n\/\/ chip ALTRO chip number on FEC\n\/\/ channel ALTRO channel number\n\/\/ strip VA1 strip number\n\/\/ sample Sample number\n\/\/ ped Mean of ADC spectra\n\/\/ noise Spread of ADC spectra\n\/\/ mu Mean of Gaussian fit to ADC spectra\n\/\/ sigma Variance of Gaussian fit to ADC spectra\n\/\/ chi2 Chi^2 per degrees of freedom of fit\n\/\/ * Gains - a (ASCII) Comma Separated Values files with the\n\/\/ fields \n\/\/ rcu\t DDL number \n\/\/ board FEC board number \n\/\/ chip ALTRO chip number on FEC\n\/\/ channel ALTRO channel number\n\/\/ strip VA1 strip number\n\/\/ gain Slope of gain\n\/\/ error Error on gain\n\/\/ chi2 Chi^2 per degrees of freedom of fit\n\/\/ \n\/\/ See also \n\/\/\n\/\/ http:\/\/aliceinfo.cern.ch\/Offline\/Activities\/Shuttle.html\n\/\/\n\/\/ Latest changes by Christian Holm Christensen\n\/\/\n\n\/\/ #include <iostream>\n\n#include <fstream>\n#include \"AliFMDPreprocessor.h\"\n#include \"AliFMDCalibPedestal.h\"\n#include \"AliFMDCalibGain.h\"\n#include \"AliFMDCalibStripRange.h\"\n#include \"AliFMDCalibSampleRate.h\"\n#include \"AliFMDParameters.h\"\n#include \"AliCDBMetaData.h\"\n#include \"AliCDBManager.h\"\n\/\/ #include \"AliDCSValue.h\"\n#include \"AliLog.h\"\n#include <TTimeStamp.h>\n\/\/ #include <TFile.h>\n#include <TObjString.h>\n#include <TString.h>\n#include <TNamed.h>\n\n\nClassImp(AliFMDPreprocessor)\n#if 0 \/\/ Do not remove - here to make Emacs happy\n;\n#endif \n\n\n\/\/____________________________________________________\nAliFMDPreprocessor::AliFMDPreprocessor(AliShuttleInterface* shuttle)\n : AliPreprocessor(\"FMD\", shuttle)\n{\n AddRunType(\"PHYSICS\");\n AddRunType(\"STANDALONE\");\n AddRunType(\"PEDESTAL\");\n AddRunType(\"GAIN\");\n}\n\n\n\/\/____________________________________________________\nBool_t AliFMDPreprocessor::GetAndCheckFileSources(TList*& list,\n\t\t\t\t\t\t Int_t system, \n\t\t\t\t\t\t const char* id) \n{\n \/\/ Convinience function \n \/\/ Parameters: \n \/\/ list On return, list of files. \n \/\/ system Alice system (DAQ, DCS, ...)\n \/\/ id File id\n \/\/ Return:\n \/\/ kTRUE on success. \n list = GetFileSources(system, id);\n if (!list) { \n TString sys;\n switch (system) { \n case kDAQ: sys = \"DAQ\"; break;\n case kDCS: sys = \"DCS\"; break;\n default: sys = \"unknown\"; break;\n }\n Log(Form(\"Failed to get file sources for %s\/%s\", sys.Data(), system));\n return kFALSE;\n }\n return kTRUE;\n}\n\n\/\/____________________________________________________\nAliCDBEntry* \nAliFMDPreprocessor::GetFromCDB(const char* second, const char* third)\n{\n return GetFromOCDB(second, third);\n}\n\n\n\/\/____________________________________________________\nUInt_t AliFMDPreprocessor::Process(TMap* \/* dcsAliasMap *\/)\n{\n \/\/ Main member function. \n \/\/ Parameters: \n \/\/ dcsAliassMap Map of DCS data point aliases.\n \/\/ Return \n \/\/ 0 on success, >0 otherwise \n Bool_t resultPed = kTRUE;\n Bool_t resultGain = kTRUE;\n Bool_t resultRange = kTRUE;\n Bool_t resultRate = kTRUE;\n Bool_t resultZero = kTRUE;\n\n \/\/ Do we need this ?\n \/\/ if(!dcsAliasMap) return 1;\n \/\/ \n \/\/ Invoking the cdb manager and the FMD parameters class\n \/\/ AliCDBManager* cdb = AliCDBManager::Instance();\n \/\/ cdb->SetDefaultStorage(\"local:\/\/$ALICE_ROOT\");\n \/\/ cdb->SetRun(0);\n AliFMDParameters* pars = AliFMDParameters::Instance();\n pars->Init(this, false, AliFMDParameters::kAltroMap);\n\n \/\/ This is if the SOR contains Fee parameters, and we run a DA to\n \/\/ extract these parameters. The same code could work if we get\n \/\/ the information from DCS via the FXS \n TList* files = 0;\n AliFMDCalibSampleRate* calibRate = 0;\n AliFMDCalibStripRange* calibRange = 0;\n AliFMDCalibZeroSuppression* calibZero = 0;\n \/\/ Disabled for now. \n#if 0\n if (GetAndCheckFileSources(files, kDAQ,\"info\"))\n GetInfoCalibration(files, calibRate, calibRange, calibZero);\n resultRate = (!calibRate ? kFALSE : kTRUE);\n resultRange = (!calibRange ? kFALSE : kTRUE);\n resultZero = (!calibZero ? kFALSE : kTRUE);\n#endif\n\n \/\/ Gt the run type \n TString runType(GetRunType()); \n\n \/\/Creating calibration objects\n AliFMDCalibPedestal* calibPed = 0;\n AliFMDCalibGain* calibGain = 0;\n if (runType.Contains(\"PEDESTAL\", TString::kIgnoreCase)) { \n if (GetAndCheckFileSources(files, kDAQ, \"pedestals\")) {\n if(files->GetSize())\n\tcalibPed = GetPedestalCalibration(files);\n }\n resultPed = (calibPed ? kTRUE : kFALSE);\n }\n if (runType.Contains(\"GAIN\", TString::kIgnoreCase)) {\n if (GetAndCheckFileSources(files, kDAQ, \"gains\")) {\n if(files->GetSize())\n\tcalibGain = GetGainCalibration(files);\n }\n resultGain = (calibGain ? kTRUE : kFALSE);\n }\n \n \/\/Storing Calibration objects \n AliCDBMetaData metaData;\n metaData.SetBeamPeriod(0);\n metaData.SetResponsible(\"Hans H. Dalsgaard\");\n metaData.SetComment(\"Preprocessor stores pedestals and gains for the FMD.\");\n \n if(calibPed) { \n resultPed = Store(\"Calib\",\"Pedestal\", calibPed, &metaData, 0, kTRUE);\n delete calibPed;\n }\n if(calibGain) { \n resultGain = Store(\"Calib\",\"PulseGain\", calibGain, &metaData, 0, kTRUE);\n delete calibGain;\n }\n if(calibRange) { \n resultRange = Store(\"Calib\",\"StripRange\", calibRange, &metaData, 0, kTRUE);\n delete calibRange;\n }\n if(calibRate) { \n resultRate = Store(\"Calib\",\"SampleRate\", calibRate, &metaData, 0, kTRUE);\n delete calibRate;\n }\n if(calibZero) { \n resultZero = Store(\"Calib\",\"ZeroSuppression\", calibZero,&metaData,0,kTRUE);\n delete calibZero;\n }\n\n#if 0\n \/\/ Disabled until we implement GetInfoCalibration properly\n Bool_t success = (resultPed && resultGain && resultRange && \n\t\t resultRate && resultZero);\n#endif\n Bool_t success = resultPed && resultGain;\n Log(Form(\"FMD preprocessor was %s\", (success ? \"successful\" : \"failed\")));\n return (success ? 0 : 1);\n}\n\n\/\/____________________________________________________________________\nBool_t\nAliFMDPreprocessor::GetInfoCalibration(TList* files, \n\t\t\t\t AliFMDCalibSampleRate*& s,\n\t\t\t\t AliFMDCalibStripRange*& r, \n\t\t\t\t AliFMDCalibZeroSuppression*& z)\n{\n \/\/ Get info calibrations. \n \/\/ Parameters:\n \/\/ files List of files. \n \/\/ s On return, newly allocated object \n \/\/ r On return, newly allocated object \n \/\/ z On return, newly allocated object \n \/\/ Return: \n \/\/ kTRUE on success\n if (!files) return kTRUE; \/\/ Should really be false\n if (files->GetEntries() <= 0) return kTRUE;\n \n s = new AliFMDCalibSampleRate();\n r = new AliFMDCalibStripRange();\n z = new AliFMDCalibZeroSuppression();\n \n \/\/ AliFMDParameters* pars = AliFMDParameters::Instance();\n TIter iter(files);\n TObjString* fileSource;\n\n while((fileSource = dynamic_cast<TObjString*>(iter.Next()))) {\n const Char_t* filename = GetFile(kDAQ, \"info\", fileSource->GetName());\n std::ifstream in(filename);\n if(!in) {\n Log(Form(\"File %s not found!\", filename));\n continue;\n }\n }\n return kTRUE;\n}\n\n \n\/\/____________________________________________________________________\nAliFMDCalibPedestal* \nAliFMDPreprocessor::GetPedestalCalibration(TList* pedFiles)\n{\n \/\/ Read DAQ DA produced CSV files of pedestals, and return a\n \/\/ calibration object. \n \/\/ Parameters:\n \/\/ pedFiles List of pedestal files \n \/\/ Return \n \/\/ A pointer to a newly allocated AliFMDCalibPedestal object, or\n \/\/ null in case of errors. \n if(!pedFiles) return 0;\n\n AliFMDCalibPedestal* calibPed = new AliFMDCalibPedestal();\n AliFMDParameters* pars = AliFMDParameters::Instance();\n TIter iter(pedFiles);\n TObjString* fileSource;\n \n while((fileSource = dynamic_cast<TObjString*>(iter.Next()))) {\n const Char_t* filename = GetFile(kDAQ, \"pedestals\", fileSource->GetName());\n std::ifstream in(filename);\n if(!in) {\n Log(Form(\"File %s not found!\", filename));\n continue;\n }\n\n \/\/ Get header (how long is it ?)\n TString header;\n header.ReadLine(in);\n header.ToLower();\n if(!header.Contains(\"pedestal\")) {\n Log(\"File header is not from pedestal!\");\n continue;\n }\n Log(\"File contains data from pedestals\");\n \n \/\/ Read columns line\n int lineno = 2;\n header.ReadLine(in);\n \n \/\/ Loop until EOF\n while(in.peek()!=EOF) {\n if(in.bad()) { \n\tLog(Form(\"Bad read at line %d in %s\", lineno, filename));\n\tbreak;\n }\n UInt_t ddl=2, board, chip, channel, strip, sample, tb;\n Float_t ped, noise, mu, sigma, chi2ndf;\n Char_t c[11];\n\t \n in >> ddl >> c[0] \n\t >> board >> c[1]\n\t >> chip >> c[2]\n\t >> channel >> c[3]\n\t >> strip >> c[4]\n\t >> sample >> c[5]\n\t >> tb >> c[6]\n\t >> ped >> c[7]\n\t >> noise >> c[8]\n\t >> mu >> c[9]\n\t >> sigma >> c[10]\n\t >> chi2ndf;\n lineno++;\n \n \/\/ Ignore trailing garbage \n if (strip > 127) continue;\n \n \/\/Setting DDL to comply with the FMD in DAQ\n UInt_t FmdDDLBase = 3072; \n ddl = ddl - FmdDDLBase;\n \/\/Setting the pedestals via the hardware address\n UShort_t det, sec, str;\n Char_t ring;\n \n pars->Hardware2Detector(ddl,board,chip,channel,det,ring,sec,str);\n strip += str;\n \n calibPed->Set(det,ring,sec,strip,ped,noise);\n \n }\n }\n return calibPed;\n}\t\n\n\/\/____________________________________________________________________\nAliFMDCalibGain* \nAliFMDPreprocessor::GetGainCalibration(TList* gainFiles)\n{\n \/\/ Read DAQ DA produced CSV files of pedestals, and return a\n \/\/ calibration object. \n \/\/ Parameters:\n \/\/ pedFiles List of pedestal files \n \/\/ Return \n \/\/ A pointer to a newly allocated AliFMDCalibPedestal object, or\n \/\/ null in case of errors. \n if(!gainFiles) return 0;\n \n AliFMDCalibGain* calibGain = new AliFMDCalibGain();\n AliFMDParameters* pars = AliFMDParameters::Instance();\n TIter iter(gainFiles);\n TObjString* fileSource;\n while((fileSource = dynamic_cast<TObjString *>(iter.Next()))) {\n const Char_t* filename = GetFile(kDAQ, \"gains\", fileSource->GetName());\n std::ifstream in(filename);\n if(!in) {\n Log(Form(\"File %s not found!\", filename));\n continue;\n }\n\n \/\/Get header (how long is it ?)\n TString header;\n header.ReadLine(in);\n header.ToLower();\n if(!header.Contains(\"gain\")) {\n Log(\"File header is not from gain!\");\n continue;\n }\n Log(\"File contains data from pulse gain\");\n\n \/\/ Read column headers\n header.ReadLine(in);\n\n int lineno = 2;\n \/\/ Read until EOF \n while(in.peek()!=EOF) {\n if(in.bad()) { \n\tLog(Form(\"Bad read at line %d in %s\", lineno, filename));\n\tbreak;\n }\n UInt_t ddl=2, board, chip, channel, strip;\n Float_t gain,error, chi2ndf;\n Char_t c[7];\n\t \n in >> ddl >> c[0] \n\t >> board >> c[1]\n\t >> chip >> c[2]\n\t >> channel >> c[3]\n\t >> strip >> c[4]\n\t >> gain >> c[5]\n\t >> error >> c[6]\n\t >> chi2ndf;\n lineno++;\n \/\/ Ignore trailing garbage\n if(strip > 127) continue;\n \n \/\/Setting DDL to comply with the FMD in DAQ\n UInt_t FmdDDLBase = 3072; \n ddl = ddl - FmdDDLBase;\n \/\/Setting the pedestals via the hardware address\n UShort_t det, sec, str;\n Char_t ring;\n pars->Hardware2Detector(ddl,board,chip,channel,det,ring,sec,str);\n\n strip += str;\n calibGain->Set(det,ring,sec,strip,gain);\n }\n }\n return calibGain;\n}\n\n\/\/____________________________________________________________________\n\/\/\n\/\/ EOF\n\/\/\n<commit_msg>New version to make use of automatic IDs from AliFMDPreprocessor<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\/* $Id$ *\/\n\/** @file AliFMDPreprocessor.cxx\n @author Hans Hjersing Dalsgaard <canute@nbi.dk>\n @date Mon Mar 27 12:39:09 2006\n @brief Shuttle \"preprocessor\" for the FMD\n*\/\n\/\/___________________________________________________________________\n\/\/\n\/\/ The class processes data points from DCS (via Amanada), and DAQ DA\n\/\/ files (via FXS) to make calibration data for the FMD. \n\/\/\n\/\/ Data points: \n\/\/ * Nothing yet. \n\/\/\n\/\/ DAQ FXS file:\n\/\/ * pedestals - a (ASCII) Comma Separated Values files with the\n\/\/ fields \n\/\/ rcu\t DDL number \n\/\/ board FEC board number \n\/\/ chip ALTRO chip number on FEC\n\/\/ channel ALTRO channel number\n\/\/ strip VA1 strip number\n\/\/ sample Sample number\n\/\/ ped Mean of ADC spectra\n\/\/ noise Spread of ADC spectra\n\/\/ mu Mean of Gaussian fit to ADC spectra\n\/\/ sigma Variance of Gaussian fit to ADC spectra\n\/\/ chi2 Chi^2 per degrees of freedom of fit\n\/\/ * Gains - a (ASCII) Comma Separated Values files with the\n\/\/ fields \n\/\/ rcu\t DDL number \n\/\/ board FEC board number \n\/\/ chip ALTRO chip number on FEC\n\/\/ channel ALTRO channel number\n\/\/ strip VA1 strip number\n\/\/ gain Slope of gain\n\/\/ error Error on gain\n\/\/ chi2 Chi^2 per degrees of freedom of fit\n\/\/ \n\/\/ See also \n\/\/\n\/\/ http:\/\/aliceinfo.cern.ch\/Offline\/Activities\/Shuttle.html\n\/\/\n\/\/ Latest changes by Christian Holm Christensen\n\/\/\n\n\/\/ #include <iostream>\n\n#include <fstream>\n#include \"AliFMDPreprocessor.h\"\n#include \"AliFMDCalibPedestal.h\"\n#include \"AliFMDCalibGain.h\"\n#include \"AliFMDCalibStripRange.h\"\n#include \"AliFMDCalibSampleRate.h\"\n#include \"AliFMDParameters.h\"\n#include \"AliCDBMetaData.h\"\n#include \"AliCDBManager.h\"\n\/\/ #include \"AliDCSValue.h\"\n#include \"AliLog.h\"\n#include <TTimeStamp.h>\n\/\/ #include <TFile.h>\n#include <TObjString.h>\n#include <TString.h>\n#include <TNamed.h>\n\n\nClassImp(AliFMDPreprocessor)\n#if 0 \/\/ Do not remove - here to make Emacs happy\n;\n#endif \n\n\n\/\/____________________________________________________\nAliFMDPreprocessor::AliFMDPreprocessor(AliShuttleInterface* shuttle)\n : AliPreprocessor(\"FMD\", shuttle)\n{\n AddRunType(\"PHYSICS\");\n AddRunType(\"STANDALONE\");\n AddRunType(\"PEDESTAL\");\n AddRunType(\"GAIN\");\n}\n\n\n\/\/____________________________________________________\nBool_t AliFMDPreprocessor::GetAndCheckFileSources(TList*& list,\n\t\t\t\t\t\t Int_t system, \n\t\t\t\t\t\t const char* id) \n{\n \/\/ Convinience function \n \/\/ Parameters: \n \/\/ list On return, list of files. \n \/\/ system Alice system (DAQ, DCS, ...)\n \/\/ id File id\n \/\/ Return:\n \/\/ kTRUE on success. \n list = GetFileSources(system, id);\n if (!list) { \n TString sys;\n switch (system) { \n case kDAQ: sys = \"DAQ\"; break;\n case kDCS: sys = \"DCS\"; break;\n default: sys = \"unknown\"; break;\n }\n Log(Form(\"Failed to get file sources for %s\/%s\", sys.Data(), system));\n return kFALSE;\n }\n return kTRUE;\n}\n\n\/\/____________________________________________________\nAliCDBEntry* \nAliFMDPreprocessor::GetFromCDB(const char* second, const char* third)\n{\n return GetFromOCDB(second, third);\n}\n\n\n\/\/____________________________________________________\nUInt_t AliFMDPreprocessor::Process(TMap* \/* dcsAliasMap *\/)\n{\n \/\/ Main member function. \n \/\/ Parameters: \n \/\/ dcsAliassMap Map of DCS data point aliases.\n \/\/ Return \n \/\/ 0 on success, >0 otherwise \n Bool_t resultPed = kTRUE;\n Bool_t resultGain = kTRUE;\n Bool_t resultRange = kTRUE;\n Bool_t resultRate = kTRUE;\n Bool_t resultZero = kTRUE;\n\n \/\/ Do we need this ?\n \/\/ if(!dcsAliasMap) return 1;\n \/\/ \n \/\/ Invoking the cdb manager and the FMD parameters class\n \/\/ AliCDBManager* cdb = AliCDBManager::Instance();\n \/\/ cdb->SetDefaultStorage(\"local:\/\/$ALICE_ROOT\");\n \/\/ cdb->SetRun(0);\n AliFMDParameters* pars = AliFMDParameters::Instance();\n pars->Init(this, false, AliFMDParameters::kAltroMap);\n\n \/\/ This is if the SOR contains Fee parameters, and we run a DA to\n \/\/ extract these parameters. The same code could work if we get\n \/\/ the information from DCS via the FXS \n TList* files = 0;\n AliFMDCalibSampleRate* calibRate = 0;\n AliFMDCalibStripRange* calibRange = 0;\n AliFMDCalibZeroSuppression* calibZero = 0;\n \/\/ Disabled for now. \n#if 0\n if (GetAndCheckFileSources(files, kDAQ,pars->GetConditionsShuttleID()))\n GetInfoCalibration(files, calibRate, calibRange, calibZero);\n resultRate = (!calibRate ? kFALSE : kTRUE);\n resultRange = (!calibRange ? kFALSE : kTRUE);\n resultZero = (!calibZero ? kFALSE : kTRUE);\n#endif\n\n \/\/ Gt the run type \n TString runType(GetRunType()); \n\n \/\/Creating calibration objects\n AliFMDCalibPedestal* calibPed = 0;\n AliFMDCalibGain* calibGain = 0;\n if (runType.Contains(\"PEDESTAL\", TString::kIgnoreCase)) { \n if (GetAndCheckFileSources(files, kDAQ, pars->GetPedestalShuttleID())) {\n if(files->GetSize())\n\tcalibPed = GetPedestalCalibration(files);\n }\n resultPed = (calibPed ? kTRUE : kFALSE);\n }\n if (runType.Contains(\"GAIN\", TString::kIgnoreCase)) {\n if (GetAndCheckFileSources(files, kDAQ, pars->GetGainShuttleID())) {\n if(files->GetSize())\n\tcalibGain = GetGainCalibration(files);\n }\n resultGain = (calibGain ? kTRUE : kFALSE);\n }\n \n \/\/Storing Calibration objects \n AliCDBMetaData metaData;\n metaData.SetBeamPeriod(0);\n metaData.SetResponsible(\"Hans H. Dalsgaard\");\n metaData.SetComment(\"Preprocessor stores pedestals and gains for the FMD.\");\n \n if(calibPed) { \n resultPed = Store(\"Calib\",\"Pedestal\", calibPed, &metaData, 0, kTRUE);\n delete calibPed;\n }\n if(calibGain) { \n resultGain = Store(\"Calib\",\"PulseGain\", calibGain, &metaData, 0, kTRUE);\n delete calibGain;\n }\n if(calibRange) { \n resultRange = Store(\"Calib\",\"StripRange\", calibRange, &metaData, 0, kTRUE);\n delete calibRange;\n }\n if(calibRate) { \n resultRate = Store(\"Calib\",\"SampleRate\", calibRate, &metaData, 0, kTRUE);\n delete calibRate;\n }\n if(calibZero) { \n resultZero = Store(\"Calib\",\"ZeroSuppression\", calibZero,&metaData,0,kTRUE);\n delete calibZero;\n }\n\n#if 0\n \/\/ Disabled until we implement GetInfoCalibration properly\n Bool_t success = (resultPed && resultGain && resultRange && \n\t\t resultRate && resultZero);\n#endif\n Bool_t success = resultPed && resultGain;\n Log(Form(\"FMD preprocessor was %s\", (success ? \"successful\" : \"failed\")));\n return (success ? 0 : 1);\n}\n\n\/\/____________________________________________________________________\nBool_t\nAliFMDPreprocessor::GetInfoCalibration(TList* files, \n\t\t\t\t AliFMDCalibSampleRate*& s,\n\t\t\t\t AliFMDCalibStripRange*& r, \n\t\t\t\t AliFMDCalibZeroSuppression*& z)\n{\n \/\/ Get info calibrations. \n \/\/ Parameters:\n \/\/ files List of files. \n \/\/ s On return, newly allocated object \n \/\/ r On return, newly allocated object \n \/\/ z On return, newly allocated object \n \/\/ Return: \n \/\/ kTRUE on success\n if (!files) return kTRUE; \/\/ Should really be false\n if (files->GetEntries() <= 0) return kTRUE;\n \n s = new AliFMDCalibSampleRate();\n r = new AliFMDCalibStripRange();\n z = new AliFMDCalibZeroSuppression();\n \n AliFMDParameters* pars = AliFMDParameters::Instance();\n TIter iter(files);\n TObjString* fileSource;\n\n while((fileSource = dynamic_cast<TObjString*>(iter.Next()))) {\n const Char_t* filename = GetFile(kDAQ, pars->GetConditionsShuttleID(), fileSource->GetName());\n std::ifstream in(filename);\n if(!in) {\n Log(Form(\"File %s not found!\", filename));\n continue;\n }\n }\n return kTRUE;\n}\n\n \n\/\/____________________________________________________________________\nAliFMDCalibPedestal* \nAliFMDPreprocessor::GetPedestalCalibration(TList* pedFiles)\n{\n \/\/ Read DAQ DA produced CSV files of pedestals, and return a\n \/\/ calibration object. \n \/\/ Parameters:\n \/\/ pedFiles List of pedestal files \n \/\/ Return \n \/\/ A pointer to a newly allocated AliFMDCalibPedestal object, or\n \/\/ null in case of errors. \n if(!pedFiles) return 0;\n\n AliFMDCalibPedestal* calibPed = new AliFMDCalibPedestal();\n AliFMDParameters* pars = AliFMDParameters::Instance();\n TIter iter(pedFiles);\n TObjString* fileSource;\n \n while((fileSource = dynamic_cast<TObjString*>(iter.Next()))) {\n const Char_t* filename = GetFile(kDAQ, pars->GetPedestalShuttleID(), fileSource->GetName());\n std::ifstream in(filename);\n if(!in) {\n Log(Form(\"File %s not found!\", filename));\n continue;\n }\n\n \/\/ Get header (how long is it ?)\n TString header;\n header.ReadLine(in);\n header.ToLower();\n if(!header.Contains(\"pedestal\")) {\n Log(\"File header is not from pedestal!\");\n continue;\n }\n Log(\"File contains data from pedestals\");\n \n \/\/ Read columns line\n int lineno = 2;\n header.ReadLine(in);\n \n \/\/ Loop until EOF\n while(in.peek()!=EOF) {\n if(in.bad()) { \n\tLog(Form(\"Bad read at line %d in %s\", lineno, filename));\n\tbreak;\n }\n UInt_t ddl=2, board, chip, channel, strip, sample, tb;\n Float_t ped, noise, mu, sigma, chi2ndf;\n Char_t c[11];\n\t \n in >> ddl >> c[0] \n\t >> board >> c[1]\n\t >> chip >> c[2]\n\t >> channel >> c[3]\n\t >> strip >> c[4]\n\t >> sample >> c[5]\n\t >> tb >> c[6]\n\t >> ped >> c[7]\n\t >> noise >> c[8]\n\t >> mu >> c[9]\n\t >> sigma >> c[10]\n\t >> chi2ndf;\n lineno++;\n \n \/\/ Ignore trailing garbage \n if (strip > 127) continue;\n \n \/\/Setting DDL to comply with the FMD in DAQ\n UInt_t FmdDDLBase = 3072; \n ddl = ddl - FmdDDLBase;\n \/\/Setting the pedestals via the hardware address\n UShort_t det, sec, str;\n Char_t ring;\n \n pars->Hardware2Detector(ddl,board,chip,channel,det,ring,sec,str);\n strip += str;\n \n calibPed->Set(det,ring,sec,strip,ped,noise);\n \n }\n }\n return calibPed;\n}\t\n\n\/\/____________________________________________________________________\nAliFMDCalibGain* \nAliFMDPreprocessor::GetGainCalibration(TList* gainFiles)\n{\n \/\/ Read DAQ DA produced CSV files of pedestals, and return a\n \/\/ calibration object. \n \/\/ Parameters:\n \/\/ pedFiles List of pedestal files \n \/\/ Return \n \/\/ A pointer to a newly allocated AliFMDCalibPedestal object, or\n \/\/ null in case of errors. \n if(!gainFiles) return 0;\n \n AliFMDCalibGain* calibGain = new AliFMDCalibGain();\n AliFMDParameters* pars = AliFMDParameters::Instance();\n TIter iter(gainFiles);\n TObjString* fileSource;\n while((fileSource = dynamic_cast<TObjString *>(iter.Next()))) {\n const Char_t* filename = GetFile(kDAQ, pars->GetGainShuttleID(), fileSource->GetName());\n std::ifstream in(filename);\n if(!in) {\n Log(Form(\"File %s not found!\", filename));\n continue;\n }\n\n \/\/Get header (how long is it ?)\n TString header;\n header.ReadLine(in);\n header.ToLower();\n if(!header.Contains(\"gain\")) {\n Log(\"File header is not from gain!\");\n continue;\n }\n Log(\"File contains data from pulse gain\");\n\n \/\/ Read column headers\n header.ReadLine(in);\n\n int lineno = 2;\n \/\/ Read until EOF \n while(in.peek()!=EOF) {\n if(in.bad()) { \n\tLog(Form(\"Bad read at line %d in %s\", lineno, filename));\n\tbreak;\n }\n UInt_t ddl=2, board, chip, channel, strip;\n Float_t gain,error, chi2ndf;\n Char_t c[7];\n\t \n in >> ddl >> c[0] \n\t >> board >> c[1]\n\t >> chip >> c[2]\n\t >> channel >> c[3]\n\t >> strip >> c[4]\n\t >> gain >> c[5]\n\t >> error >> c[6]\n\t >> chi2ndf;\n lineno++;\n \/\/ Ignore trailing garbage\n if(strip > 127) continue;\n \n \/\/Setting DDL to comply with the FMD in DAQ\n UInt_t FmdDDLBase = 3072; \n ddl = ddl - FmdDDLBase;\n \/\/Setting the pedestals via the hardware address\n UShort_t det, sec, str;\n Char_t ring;\n pars->Hardware2Detector(ddl,board,chip,channel,det,ring,sec,str);\n\n strip += str;\n calibGain->Set(det,ring,sec,strip,gain);\n }\n }\n return calibGain;\n}\n\n\/\/____________________________________________________________________\n\/\/\n\/\/ EOF\n\/\/\n<|endoftext|>"} {"text":"<commit_before><commit_msg>This is never defined.<commit_after><|endoftext|>"} {"text":"<commit_before>\/\/ Copyright (C) 2017 by Pedro Mendes, Virginia Tech Intellectual\n\/\/ Properties, Inc., University of Heidelberg, and University of\n\/\/ of Connecticut School of Medicine.\n\/\/ All rights reserved.\n\n\/\/ Copyright (C) 2010 - 2016 by Pedro Mendes, Virginia Tech Intellectual\n\/\/ Properties, Inc., University of Heidelberg, and The University\n\/\/ of Manchester.\n\/\/ All rights reserved.\n\n\/*\n * CAnnotation.cpp\n *\n * Created on: Aug 12, 2010\n * Author: shoops\n *\/\n\n#include <sstream>\n\n#include \"copasi.h\"\n\n#include \"CAnnotation.h\"\n\n#include \"MIRIAM\/CRDFUtilities.h\"\n#include \"utilities\/CCopasiMessage.h\"\n#include \"utilities\/CVersion.h\"\n#include \"report\/CKeyFactory.h\"\n#include \"model\/CModelValue.h\"\n#include \"model\/CReaction.h\"\n#include \"model\/CEvent.h\"\n#include \"model\/CModelParameterSet.h\"\n#include \"function\/CFunction.h\"\n#include \"utilities\/CUnitDefinition.h\"\n#include \"copasi\/core\/CRootContainer.h\"\n\n#include \"xml\/parser\/CXMLParser.h\"\n\n\/\/ static\nCAnnotation * CAnnotation::castObject(CDataObject * pObject)\n{\n CModelEntity * pEntity = NULL;\n CEvent * pEvent = NULL;\n CReaction * pReaction = NULL;\n CFunction * pFunction = NULL;\n CUnitDefinition * pUnitDefinition = NULL;\n CModelParameterSet * pParameterSet = NULL;\n\n if ((pEntity = dynamic_cast< CModelEntity * >(pObject)) != NULL)\n return static_cast< CAnnotation * >(pEntity);\n\n if ((pEvent = dynamic_cast< CEvent * >(pObject)) != NULL)\n return static_cast< CAnnotation * >(pEvent);\n\n if ((pReaction = dynamic_cast< CReaction * >(pObject)) != NULL)\n return static_cast< CAnnotation * >(pReaction);\n\n if ((pParameterSet = dynamic_cast< CModelParameterSet * >(pObject)) != NULL)\n return static_cast< CAnnotation * >(pParameterSet);\n\n if ((pFunction = dynamic_cast< CFunction * >(pObject)) != NULL)\n return static_cast< CAnnotation * >(pFunction);\n\n if ((pUnitDefinition = dynamic_cast< CUnitDefinition * >(pObject)) != NULL)\n return static_cast< CAnnotation * >(pUnitDefinition);\n\n return NULL;\n}\n\n\/\/ static\nconst CAnnotation * CAnnotation::castObject(const CDataObject * pObject)\n{\n const CModelEntity * pEntity = NULL;\n const CEvent * pEvent = NULL;\n const CReaction * pReaction = NULL;\n const CFunction * pFunction = NULL;\n const CUnitDefinition * pUnitDefinition = NULL;\n const CModelParameterSet * pParameterSet = NULL;\n\n if ((pEntity = dynamic_cast< const CModelEntity * >(pObject)) != NULL)\n return static_cast< const CAnnotation * >(pEntity);\n\n if ((pEvent = dynamic_cast< const CEvent * >(pObject)) != NULL)\n return static_cast< const CAnnotation * >(pEvent);\n\n if ((pReaction = dynamic_cast< const CReaction * >(pObject)) != NULL)\n return static_cast< const CAnnotation * >(pReaction);\n\n if ((pParameterSet = dynamic_cast< const CModelParameterSet * >(pObject)) != NULL)\n return static_cast< const CAnnotation * >(pParameterSet);\n\n if ((pFunction = dynamic_cast< const CFunction * >(pObject)) != NULL)\n return static_cast< const CAnnotation * >(pFunction);\n\n if ((pUnitDefinition = dynamic_cast< const CUnitDefinition * >(pObject)) != NULL)\n return static_cast< const CAnnotation * >(pUnitDefinition);\n\n return NULL;\n}\n\nCAnnotation::CAnnotation():\n mKey(\"\"),\n mNotes(),\n mMiriamAnnotation(),\n mXMLId(),\n mUnsupportedAnnotations()\n{}\n\nCAnnotation::CAnnotation(const CAnnotation & src):\n mKey(\"\"),\n mNotes(src.mNotes),\n mMiriamAnnotation(src.mMiriamAnnotation),\n mXMLId(src.mXMLId),\n mUnsupportedAnnotations(src.mUnsupportedAnnotations)\n{}\n\nCAnnotation::~CAnnotation()\n{\n CRootContainer::getKeyFactory()->remove(mKey);\n}\n\n\/\/ virtual\nconst std::string & CAnnotation::getKey() const\n{\n return mKey;\n}\n\nvoid CAnnotation::setMiriamAnnotation(const std::string & miriamAnnotation,\n const std::string & newId,\n const std::string & oldId)\n{\n mMiriamAnnotation = miriamAnnotation;\n mXMLId = newId;\n CRDFUtilities::fixLocalFileAboutReference(mMiriamAnnotation, newId, oldId);\n}\n\nconst std::string & CAnnotation::getMiriamAnnotation() const\n{return mMiriamAnnotation;}\n\nvoid CAnnotation::setNotes(const std::string & notes)\n{\n mNotes = notes;\n}\nconst std::string & CAnnotation::getNotes() const\n{\n return mNotes;\n}\n\nbool CAnnotation::operator == (const CAnnotation & rhs) const\n{\n if (mNotes != rhs.mNotes)\n return false;\n\n std::string Annotation = mMiriamAnnotation;\n CRDFUtilities::fixLocalFileAboutReference(Annotation, rhs.mXMLId, mXMLId);\n\n \/\/ We need to ignore white spaces when comparing.\n std::string::const_iterator it = Annotation.begin();\n std::string::const_iterator end = Annotation.end();\n std::string::const_iterator itRhs = rhs.mMiriamAnnotation.begin();\n std::string::const_iterator endRhs = rhs.mMiriamAnnotation.end();\n\n while (it != end && itRhs != endRhs)\n {\n if (*it == * itRhs)\n {\n ++it;\n ++itRhs;\n\n continue;\n }\n\n \/\/ Advance past white spaces\n while (it != end)\n {\n if (*it == '\\x20' || *it == '\\x09' || *it == '\\x0d' || *it == '\\x0a')\n {\n ++it;\n\n continue;\n }\n\n break;\n }\n\n \/\/ Advance past white spaces\n while (itRhs != endRhs)\n {\n if (*itRhs == '\\x20' || *itRhs == '\\x09' || *itRhs == '\\x0d' || *itRhs == '\\x0a')\n {\n ++itRhs;\n\n continue;\n }\n\n break;\n }\n\n if (it == end && itRhs == endRhs)\n {\n return true;\n }\n\n if (it == end || itRhs == endRhs)\n {\n return false;\n }\n\n if (*it != *itRhs)\n {\n return false;\n }\n\n ++it;\n ++itRhs;\n }\n\n return true;\n}\n\nCAnnotation::UnsupportedAnnotation & CAnnotation::getUnsupportedAnnotations()\n{\n return mUnsupportedAnnotations;\n}\n\nconst CAnnotation::UnsupportedAnnotation & CAnnotation::getUnsupportedAnnotations() const\n{\n return mUnsupportedAnnotations;\n}\n\nbool CAnnotation::addUnsupportedAnnotation(const std::string & name, const std::string & xml)\n{\n \/\/ The name must not be empty\n if (name == \"\")\n {\n CCopasiMessage(CCopasiMessage::ERROR, MCAnnotation + 7);\n return false;\n }\n\n \/\/ The name must be unique\n if (mUnsupportedAnnotations.find(name) != mUnsupportedAnnotations.end())\n {\n CCopasiMessage(CCopasiMessage::ERROR, MCAnnotation + 6, name.c_str());\n return false;\n }\n\n \/\/ We need to check whether we have valid XML.\n if (!isValidXML(xml))\n {\n CCopasiMessage(CCopasiMessage::ERROR, MCAnnotation + 5, name.c_str());\n return false;\n }\n\n mUnsupportedAnnotations[name] = xml;\n\n return true;\n}\n\nbool CAnnotation::replaceUnsupportedAnnotation(const std::string & name, const std::string & xml)\n{\n \/\/ We need to check whether we have valid XML.\n if (!isValidXML(xml))\n {\n CCopasiMessage(CCopasiMessage::ERROR, MCAnnotation + 5, name.c_str());\n return false;\n }\n\n \/\/ The annotation must exist\n if (mUnsupportedAnnotations.find(name) == mUnsupportedAnnotations.end())\n {\n CCopasiMessage(CCopasiMessage::ERROR, MCAnnotation + 8, name.c_str());\n return false;\n }\n\n mUnsupportedAnnotations[name] = xml;\n\n return true;\n}\n\nbool CAnnotation::removeUnsupportedAnnotation(const std::string & name)\n{\n UnsupportedAnnotation::iterator it = mUnsupportedAnnotations.find(name);\n\n if (it == mUnsupportedAnnotations.end())\n {\n return false;\n }\n\n mUnsupportedAnnotations.erase(it);\n\n return true;\n}\n\n\/\/ static\nbool CAnnotation::isValidXML(const std::string & xml)\n{\n std::istringstream XML;\n XML.str(xml);\n XML.imbue(std::locale::classic());\n XML.precision(std::numeric_limits<double>::digits10 + 2);\n\n bool done = false;\n\n CVersion Version;\n CXMLParser Parser(Version);\n\n size_t Size = CCopasiMessage::size();\n\n#define BUFFER_SIZE 0xfffe\n char * pBuffer = new char[BUFFER_SIZE + 1];\n\n while (!done)\n {\n XML.get(pBuffer, BUFFER_SIZE, 0);\n\n if (XML.eof()) done = true;\n\n if (XML.fail() && !done)\n {\n done = true;\n return false;\n }\n\n if (!Parser.parse(pBuffer, -1, done))\n {\n done = true;\n return false;\n }\n }\n\n delete [] pBuffer;\n#undef BUFFER_SIZE\n\n \/\/ Remove error messages created by setExpression as this may fail\n \/\/ due to incomplete model specification at this time.\n while (CCopasiMessage::size() > Size)\n CCopasiMessage::getLastMessage();\n\n return true;\n}\n<commit_msg>- issue 2573: import of multiple annotations of the same namespace supported and verified<commit_after>\/\/ Copyright (C) 2017 by Pedro Mendes, Virginia Tech Intellectual\n\/\/ Properties, Inc., University of Heidelberg, and University of\n\/\/ of Connecticut School of Medicine.\n\/\/ All rights reserved.\n\n\/\/ Copyright (C) 2010 - 2016 by Pedro Mendes, Virginia Tech Intellectual\n\/\/ Properties, Inc., University of Heidelberg, and The University\n\/\/ of Manchester.\n\/\/ All rights reserved.\n\n\/*\n * CAnnotation.cpp\n *\n * Created on: Aug 12, 2010\n * Author: shoops\n *\/\n\n#include <sstream>\n\n#include \"copasi.h\"\n\n#include \"CAnnotation.h\"\n\n#include \"MIRIAM\/CRDFUtilities.h\"\n#include \"utilities\/CCopasiMessage.h\"\n#include \"utilities\/CVersion.h\"\n#include \"report\/CKeyFactory.h\"\n#include \"model\/CModelValue.h\"\n#include \"model\/CReaction.h\"\n#include \"model\/CEvent.h\"\n#include \"model\/CModelParameterSet.h\"\n#include \"function\/CFunction.h\"\n#include \"utilities\/CUnitDefinition.h\"\n#include \"copasi\/core\/CRootContainer.h\"\n\n#include \"xml\/parser\/CXMLParser.h\"\n\n\/\/ static\nCAnnotation * CAnnotation::castObject(CDataObject * pObject)\n{\n CModelEntity * pEntity = NULL;\n CEvent * pEvent = NULL;\n CReaction * pReaction = NULL;\n CFunction * pFunction = NULL;\n CUnitDefinition * pUnitDefinition = NULL;\n CModelParameterSet * pParameterSet = NULL;\n\n if ((pEntity = dynamic_cast< CModelEntity * >(pObject)) != NULL)\n return static_cast< CAnnotation * >(pEntity);\n\n if ((pEvent = dynamic_cast< CEvent * >(pObject)) != NULL)\n return static_cast< CAnnotation * >(pEvent);\n\n if ((pReaction = dynamic_cast< CReaction * >(pObject)) != NULL)\n return static_cast< CAnnotation * >(pReaction);\n\n if ((pParameterSet = dynamic_cast< CModelParameterSet * >(pObject)) != NULL)\n return static_cast< CAnnotation * >(pParameterSet);\n\n if ((pFunction = dynamic_cast< CFunction * >(pObject)) != NULL)\n return static_cast< CAnnotation * >(pFunction);\n\n if ((pUnitDefinition = dynamic_cast< CUnitDefinition * >(pObject)) != NULL)\n return static_cast< CAnnotation * >(pUnitDefinition);\n\n return NULL;\n}\n\n\/\/ static\nconst CAnnotation * CAnnotation::castObject(const CDataObject * pObject)\n{\n const CModelEntity * pEntity = NULL;\n const CEvent * pEvent = NULL;\n const CReaction * pReaction = NULL;\n const CFunction * pFunction = NULL;\n const CUnitDefinition * pUnitDefinition = NULL;\n const CModelParameterSet * pParameterSet = NULL;\n\n if ((pEntity = dynamic_cast< const CModelEntity * >(pObject)) != NULL)\n return static_cast< const CAnnotation * >(pEntity);\n\n if ((pEvent = dynamic_cast< const CEvent * >(pObject)) != NULL)\n return static_cast< const CAnnotation * >(pEvent);\n\n if ((pReaction = dynamic_cast< const CReaction * >(pObject)) != NULL)\n return static_cast< const CAnnotation * >(pReaction);\n\n if ((pParameterSet = dynamic_cast< const CModelParameterSet * >(pObject)) != NULL)\n return static_cast< const CAnnotation * >(pParameterSet);\n\n if ((pFunction = dynamic_cast< const CFunction * >(pObject)) != NULL)\n return static_cast< const CAnnotation * >(pFunction);\n\n if ((pUnitDefinition = dynamic_cast< const CUnitDefinition * >(pObject)) != NULL)\n return static_cast< const CAnnotation * >(pUnitDefinition);\n\n return NULL;\n}\n\nCAnnotation::CAnnotation():\n mKey(\"\"),\n mNotes(),\n mMiriamAnnotation(),\n mXMLId(),\n mUnsupportedAnnotations()\n{}\n\nCAnnotation::CAnnotation(const CAnnotation & src):\n mKey(\"\"),\n mNotes(src.mNotes),\n mMiriamAnnotation(src.mMiriamAnnotation),\n mXMLId(src.mXMLId),\n mUnsupportedAnnotations(src.mUnsupportedAnnotations)\n{}\n\nCAnnotation::~CAnnotation()\n{\n CRootContainer::getKeyFactory()->remove(mKey);\n}\n\n\/\/ virtual\nconst std::string & CAnnotation::getKey() const\n{\n return mKey;\n}\n\nvoid CAnnotation::setMiriamAnnotation(const std::string & miriamAnnotation,\n const std::string & newId,\n const std::string & oldId)\n{\n mMiriamAnnotation = miriamAnnotation;\n mXMLId = newId;\n CRDFUtilities::fixLocalFileAboutReference(mMiriamAnnotation, newId, oldId);\n}\n\nconst std::string & CAnnotation::getMiriamAnnotation() const\n{return mMiriamAnnotation;}\n\nvoid CAnnotation::setNotes(const std::string & notes)\n{\n mNotes = notes;\n}\nconst std::string & CAnnotation::getNotes() const\n{\n return mNotes;\n}\n\nbool CAnnotation::operator == (const CAnnotation & rhs) const\n{\n if (mNotes != rhs.mNotes)\n return false;\n\n std::string Annotation = mMiriamAnnotation;\n CRDFUtilities::fixLocalFileAboutReference(Annotation, rhs.mXMLId, mXMLId);\n\n \/\/ We need to ignore white spaces when comparing.\n std::string::const_iterator it = Annotation.begin();\n std::string::const_iterator end = Annotation.end();\n std::string::const_iterator itRhs = rhs.mMiriamAnnotation.begin();\n std::string::const_iterator endRhs = rhs.mMiriamAnnotation.end();\n\n while (it != end && itRhs != endRhs)\n {\n if (*it == * itRhs)\n {\n ++it;\n ++itRhs;\n\n continue;\n }\n\n \/\/ Advance past white spaces\n while (it != end)\n {\n if (*it == '\\x20' || *it == '\\x09' || *it == '\\x0d' || *it == '\\x0a')\n {\n ++it;\n\n continue;\n }\n\n break;\n }\n\n \/\/ Advance past white spaces\n while (itRhs != endRhs)\n {\n if (*itRhs == '\\x20' || *itRhs == '\\x09' || *itRhs == '\\x0d' || *itRhs == '\\x0a')\n {\n ++itRhs;\n\n continue;\n }\n\n break;\n }\n\n if (it == end && itRhs == endRhs)\n {\n return true;\n }\n\n if (it == end || itRhs == endRhs)\n {\n return false;\n }\n\n if (*it != *itRhs)\n {\n return false;\n }\n\n ++it;\n ++itRhs;\n }\n\n return true;\n}\n\nCAnnotation::UnsupportedAnnotation & CAnnotation::getUnsupportedAnnotations()\n{\n return mUnsupportedAnnotations;\n}\n\nconst CAnnotation::UnsupportedAnnotation & CAnnotation::getUnsupportedAnnotations() const\n{\n return mUnsupportedAnnotations;\n}\n\nbool CAnnotation::addUnsupportedAnnotation(const std::string & name, const std::string & xml)\n{\n \/\/ The name must not be empty\n if (name == \"\")\n {\n CCopasiMessage(CCopasiMessage::ERROR, MCAnnotation + 7);\n return false;\n }\n\n \/\/ We need to check whether we have valid XML.\n if (!isValidXML(xml))\n {\n CCopasiMessage(CCopasiMessage::ERROR, MCAnnotation + 5, name.c_str());\n return false;\n }\n\n \/\/ if we already have an entry, we add it ... \n if (mUnsupportedAnnotations.find(name) != mUnsupportedAnnotations.end())\n {\n mUnsupportedAnnotations[name] += xml;\n }\n else\n {\n mUnsupportedAnnotations[name] = xml;\n }\n\n\n\n return true;\n}\n\nbool CAnnotation::replaceUnsupportedAnnotation(const std::string & name, const std::string & xml)\n{\n \/\/ We need to check whether we have valid XML.\n if (!isValidXML(xml))\n {\n CCopasiMessage(CCopasiMessage::ERROR, MCAnnotation + 5, name.c_str());\n return false;\n }\n\n \/\/ The annotation must exist\n if (mUnsupportedAnnotations.find(name) == mUnsupportedAnnotations.end())\n {\n CCopasiMessage(CCopasiMessage::ERROR, MCAnnotation + 8, name.c_str());\n return false;\n }\n\n mUnsupportedAnnotations[name] = xml;\n\n return true;\n}\n\nbool CAnnotation::removeUnsupportedAnnotation(const std::string & name)\n{\n UnsupportedAnnotation::iterator it = mUnsupportedAnnotations.find(name);\n\n if (it == mUnsupportedAnnotations.end())\n {\n return false;\n }\n\n mUnsupportedAnnotations.erase(it);\n\n return true;\n}\n\n\/\/ static\nbool CAnnotation::isValidXML(const std::string & xml)\n{\n std::istringstream XML;\n XML.str(xml);\n XML.imbue(std::locale::classic());\n XML.precision(std::numeric_limits<double>::digits10 + 2);\n\n bool done = false;\n\n CVersion Version;\n CXMLParser Parser(Version);\n\n size_t Size = CCopasiMessage::size();\n\n#define BUFFER_SIZE 0xfffe\n char * pBuffer = new char[BUFFER_SIZE + 1];\n\n while (!done)\n {\n XML.get(pBuffer, BUFFER_SIZE, 0);\n\n if (XML.eof()) done = true;\n\n if (XML.fail() && !done)\n {\n done = true;\n return false;\n }\n\n if (!Parser.parse(pBuffer, -1, done))\n {\n done = true;\n return false;\n }\n }\n\n delete [] pBuffer;\n#undef BUFFER_SIZE\n\n \/\/ Remove error messages created by setExpression as this may fail\n \/\/ due to incomplete model specification at this time.\n while (CCopasiMessage::size() > Size)\n CCopasiMessage::getLastMessage();\n\n return true;\n}\n<|endoftext|>"} {"text":"<commit_before>#include <QString>\n#include <QUrl>\n#include <QFileInfo>\n#include <QSqlQuery>\n#include <QSqlRecord>\n#include \"identity.h\"\n#include \"kernel.h\"\n#include \"ilwisdata.h\"\n#include \"resource.h\"\n#include \"catalogview.h\"\n#include \"catalogquery.h\"\n#include \"catalog.h\"\n#include \"ilwiscontext.h\"\n#include \"mastercatalog.h\"\n\nusing namespace Ilwis;\n\nCatalogView::CatalogView(QObject *parent) :\n QObject(parent)\n{\n}\n\nCatalogView::CatalogView(const QUrl &loc) : QObject(){\n addLocation(loc);\n QStringList parts = loc.toString().split(\"\/\");\n name(parts.back());\n _resource = Resource(\"ilwis:\/\/internalcatalog\/\" + name(), itCATALOGVIEW);\n QStringList lst;\n lst.append(loc.toString());\n _resource[\"locations\"] = lst;\n}\n\nCatalogView::CatalogView(const Resource &resource) : QObject(), Identity(resource.name(),resource.id(),resource.code()){\n filter(resource[\"filter\"].toString());\n QStringList lst = resource[\"locations\"].toStringList();\n for(auto url : lst){\n if ( url != sUNDEF)\n _locations.push_back(QUrl(url));\n }\n _resource = resource;\n}\n\nCatalogView::CatalogView(const CatalogView &cat) : QObject(),\n Identity(sUNDEF,i64UNDEF,cat.code(),cat.description()),\n _filter(cat._filter),\n _locations(cat._locations),\n _fixedItems(cat._fixedItems),\n _parent(cat._parent),\n _resource(cat.resource())\n {\n Identity::prepare(); \/\/ bit inconveniet but the id must be set. this overrules the name so we set it again\n name(cat.name());\n}\n\nvoid CatalogView::addLocation(const QUrl& loc){\n if ( std::find(_locations.begin(), _locations.end(), loc) == _locations.end()){\n _locations.push_back(loc);\n if ( name() != sUNDEF)\n return;\n\n QStringList parts = loc.toString().split(\"\/\");\n QString cid = parts.back();\n name(cid);\n }\n}\n\nstd::vector<Resource> CatalogView::items() const\n{\n if (!isValid())\n return std::vector<Resource>();\n\n std::vector<Resource> results;\n for(auto& item : _fixedItems){\n results.push_back(item.second);\n }\n QString filter = _filter;\n for(auto location : _locations) {\n std::vector<Resource> items;\n if ( location == QUrl(\"ilwis:\/\/system\")){\n if ( filter != \"\")\n filter += \" and \";\n filter += QString(\"type<>%1\").arg(QString::number(itGEODETICDATUM)); \/\/ datums are not visible in the catalogs\n }\n if ( location != MasterCatalog::MASTERCATALOG){\n items = mastercatalog()->select(location, filter);\n }else\n items = mastercatalog()->select(filter);\n\n std::copy(items.begin(), items.end(),std::back_inserter(results));\n }\n std::set<Resource> uniques(results.begin(), results.end());\n results.resize(uniques.size());\n std::copy(uniques.begin(), uniques.end(), results.begin());\n return results;\n\n}\n\nvoid CatalogView::addFixedItem(quint64 id)\n{\n Resource resource = mastercatalog()->id2Resource(id);\n if ( resource.isValid()){\n _fixedItems[id] = resource;\n }\n}\n\nvoid CatalogView::removeFixedItem(quint64 id)\n{\n auto iter = _fixedItems.find(id);\n if ( iter != _fixedItems.end())\n _fixedItems.erase(iter);\n}\n\nquint32 CatalogView::fixedItemCount() const\n{\n return _fixedItems.size();\n}\n\nQString CatalogView::filter() const\n{\n return _filter;\n}\n\nvoid CatalogView::filter(const QString &filter)\n{\n CatalogQuery query;\n _filter = query.transformQuery(filter);\n}\n\nResource CatalogView::resource() const\n{\n return _resource;\n}\n\nbool CatalogView::hasParent() const\n{\n if ( _locations.size() != 1)\n return false;\n return _locations[0].scheme() == \"file\";\n}\n\n\n\nbool CatalogView::prepare()\n{\n for(auto resource : _locations)\n if(!mastercatalog()->addContainer(resource))\n return false;\n\n Identity::prepare();\n\n\n\n return true;\n}\n\nCatalogView &CatalogView::operator=(const CatalogView &view)\n{\n Identity::prepare();\n name(view.name());\n setDescription(view.description());\n code(view.code());\n _filter = view._filter;\n _locations = view._locations;\n _resource = view._resource;\n _fixedItems = view._fixedItems;\n\n return *this;\n\n}\n\nQString CatalogView::type() const\n{\n return \"CatalogView\";\n}\n\n\nbool CatalogView::isValid() const\n{\n return _locations.size() > 0 || _fixedItems.size() > 0 ;\n}\n\nQUrl CatalogView::parentCatalogView() const\n{\n return _parent;\n}\n\nvoid CatalogView::setParentCatalogView(const QUrl &url)\n{\n _parent = url;\n}\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n<commit_msg>No longer forces a scan in prepare. The add container method from mastercatalog is basically the only one who is still doing that and that is only used at the places were a scan is wanted. Doing it here interferes with the multithreading as it cant be recognized if we should start a thread here , or not<commit_after>#include <QString>\n#include <QUrl>\n#include <QFileInfo>\n#include <QSqlQuery>\n#include <QSqlRecord>\n#include \"identity.h\"\n#include \"kernel.h\"\n#include \"ilwisdata.h\"\n#include \"resource.h\"\n#include \"catalogview.h\"\n#include \"catalogquery.h\"\n#include \"catalog.h\"\n#include \"ilwiscontext.h\"\n#include \"mastercatalog.h\"\n\nusing namespace Ilwis;\n\nCatalogView::CatalogView(QObject *parent) :\n QObject(parent)\n{\n}\n\nCatalogView::CatalogView(const QUrl &loc) : QObject(){\n addLocation(loc);\n QStringList parts = loc.toString().split(\"\/\");\n name(parts.back());\n _resource = Resource(\"ilwis:\/\/internalcatalog\/\" + name(), itCATALOGVIEW);\n QStringList lst;\n lst.append(loc.toString());\n _resource[\"locations\"] = lst;\n}\n\nCatalogView::CatalogView(const Resource &resource) : QObject(), Identity(resource.name(),resource.id(),resource.code()){\n filter(resource[\"filter\"].toString());\n QStringList lst = resource[\"locations\"].toStringList();\n for(auto url : lst){\n if ( url != sUNDEF)\n _locations.push_back(QUrl(url));\n }\n _resource = resource;\n}\n\nCatalogView::CatalogView(const CatalogView &cat) : QObject(),\n Identity(sUNDEF,i64UNDEF,cat.code(),cat.description()),\n _filter(cat._filter),\n _locations(cat._locations),\n _fixedItems(cat._fixedItems),\n _parent(cat._parent),\n _resource(cat.resource())\n {\n Identity::prepare(); \/\/ bit inconveniet but the id must be set. this overrules the name so we set it again\n name(cat.name());\n}\n\nvoid CatalogView::addLocation(const QUrl& loc){\n if ( std::find(_locations.begin(), _locations.end(), loc) == _locations.end()){\n _locations.push_back(loc);\n if ( name() != sUNDEF)\n return;\n\n QStringList parts = loc.toString().split(\"\/\");\n QString cid = parts.back();\n name(cid);\n }\n}\n\nstd::vector<Resource> CatalogView::items() const\n{\n if (!isValid())\n return std::vector<Resource>();\n\n std::vector<Resource> results;\n for(auto& item : _fixedItems){\n results.push_back(item.second);\n }\n QString filter = _filter;\n for(auto location : _locations) {\n std::vector<Resource> items;\n if ( location == QUrl(\"ilwis:\/\/system\")){\n if ( filter != \"\")\n filter += \" and \";\n filter += QString(\"type<>%1\").arg(QString::number(itGEODETICDATUM)); \/\/ datums are not visible in the catalogs\n }\n if ( location != MasterCatalog::MASTERCATALOG){\n items = mastercatalog()->select(location, filter);\n }else\n items = mastercatalog()->select(filter);\n\n std::copy(items.begin(), items.end(),std::back_inserter(results));\n }\n std::set<Resource> uniques(results.begin(), results.end());\n results.resize(uniques.size());\n std::copy(uniques.begin(), uniques.end(), results.begin());\n return results;\n\n}\n\nvoid CatalogView::addFixedItem(quint64 id)\n{\n Resource resource = mastercatalog()->id2Resource(id);\n if ( resource.isValid()){\n _fixedItems[id] = resource;\n }\n}\n\nvoid CatalogView::removeFixedItem(quint64 id)\n{\n auto iter = _fixedItems.find(id);\n if ( iter != _fixedItems.end())\n _fixedItems.erase(iter);\n}\n\nquint32 CatalogView::fixedItemCount() const\n{\n return _fixedItems.size();\n}\n\nQString CatalogView::filter() const\n{\n return _filter;\n}\n\nvoid CatalogView::filter(const QString &filter)\n{\n CatalogQuery query;\n _filter = query.transformQuery(filter);\n}\n\nResource CatalogView::resource() const\n{\n return _resource;\n}\n\nbool CatalogView::hasParent() const\n{\n if ( _locations.size() != 1)\n return false;\n return _locations[0].scheme() == \"file\";\n}\n\n\n\nbool CatalogView::prepare()\n{\n\/\/ for(auto resource : _locations)\n\/\/ if(!mastercatalog()->addContainer(resource))\n\/\/ return false;\n\n Identity::prepare();\n\n\n\n return true;\n}\n\nCatalogView &CatalogView::operator=(const CatalogView &view)\n{\n Identity::prepare();\n name(view.name());\n setDescription(view.description());\n code(view.code());\n _filter = view._filter;\n _locations = view._locations;\n _resource = view._resource;\n _fixedItems = view._fixedItems;\n\n return *this;\n\n}\n\nQString CatalogView::type() const\n{\n return \"CatalogView\";\n}\n\n\nbool CatalogView::isValid() const\n{\n return _locations.size() > 0 || _fixedItems.size() > 0 ;\n}\n\nQUrl CatalogView::parentCatalogView() const\n{\n return _parent;\n}\n\nvoid CatalogView::setParentCatalogView(const QUrl &url)\n{\n _parent = url;\n}\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n<|endoftext|>"} {"text":"<commit_before>#include \"gl_texture.h\"\n\n#include <cmath>\n#include <glad\/glad.h>\n#define STB_IMAGE_IMPLEMENTATION\n#include <stb_image.h>\n#define STB_RECT_PACK_IMPLEMENTATION\n#include <stb_rect_pack.h>\n\n#include <file_manager.h>\n#include <log.h>\n\n#include \"texture.h\"\n\nnamespace oak::graphics::GLTexture {\n\n\tstatic const GLenum formats[][3] = {\n\t\t{ GL_RGBA8, GL_RGBA, GL_UNSIGNED_BYTE },\n\t\t{ GL_RGB8, GL_RGB, GL_UNSIGNED_BYTE },\n\t\t{ GL_R8, GL_RED, GL_UNSIGNED_BYTE },\n\t\t{ GL_RGBA32F, GL_RGBA, GL_FLOAT }, \n\t\t{ GL_RGB32F, GL_RGB, GL_FLOAT },\n\t\t{ GL_R32F, GL_RED, GL_FLOAT },\n\t\t{ GL_DEPTH_COMPONENT32F, GL_DEPTH_COMPONENT, GL_FLOAT },\n\t\t{ GL_DEPTH_COMPONENT32, GL_DEPTH_COMPONENT, GL_UNSIGNED_INT },\n\t\t{ GL_DEPTH_COMPONENT24, GL_DEPTH_COMPONENT, GL_UNSIGNED_INT },\n\t\t{ GL_DEPTH_COMPONENT16, GL_DEPTH_COMPONENT, GL_UNSIGNED_INT }\n\t};\n\n\tstatic const int components[] = {\n\t\t4,\n\t\t3,\n\t\t1,\n\t\t4,\n\t\t3,\n\t\t1,\n\t\t1,\n\t\t1,\n\t\t1,\n\t\t1\n\t};\n\n\tstatic const GLenum types[] = {\n\t\tGL_TEXTURE_2D,\n\t\tGL_TEXTURE_3D,\n\t\tGL_TEXTURE_2D_ARRAY,\n\t\tGL_TEXTURE_CUBE_MAP\n\t};\n\n\tstatic const GLenum filter[] = {\n\t\tGL_NEAREST,\n\t\tGL_LINEAR,\n\t\tGL_LINEAR_MIPMAP_LINEAR,\n\t\tGL_NEAREST_MIPMAP_NEAREST,\n\t\tGL_LINEAR_MIPMAP_NEAREST,\n\t\tGL_NEAREST_MIPMAP_LINEAR\n\t};\n\n\tstatic const GLenum wrap[] = {\n\t\tGL_REPEAT,\n\t\tGL_CLAMP_TO_EDGE\n\t};\n\n\tvoid bind(const Texture& texture, int slot) {\n\t\tglActiveTexture(GL_TEXTURE0 + slot);\n\t\tglBindTexture(types[static_cast<int>(texture.info.type)], texture.id);\n\t}\n\n\tTexture create(const char *path, const TextureInfo& info) {\n\t\tint w, h, comp;\n\t\tstbi_uc *data = stbi_load(FileManager::inst().resolvePath(path).c_str(), &w, &h, &comp, components[static_cast<int>(info.format)]);\n\n\t\tif (data == nullptr) {\n\t\t\tlog_print_warn(\"failed to load texture: %s\", path);\n\t\t}\n\n\t\tTextureInfo ti = info;\n\t\tti.width = w;\n\t\tti.height = h;\n\n\t\tconst Texture& tex = create(ti, data);\n\n\t\tif (static_cast<int>(info.minFilter) >= static_cast<int>(TextureFilter::LINEAR_MIP_LINEAR)) {\n\t\t\tglGenerateMipmap(GL_TEXTURE_2D);\n\t\t}\n\n\t\tstbi_image_free(data);\n\n\t\treturn tex;\n\t}\n\n\tTexture create(const TextureInfo& info, void *data) {\n\n\t\tconst auto& format = formats[static_cast<int>(info.format)];\n\n\t\tGLenum type = types[static_cast<int>(info.type)];\n\t\tGLenum mag = filter[static_cast<int>(info.magFilter)];\n\t\tGLenum min = filter[static_cast<int>(info.minFilter)];\n\n\t\tGLenum xw = wrap[static_cast<int>(info.xWrap)];\n\t\tGLenum yw = wrap[static_cast<int>(info.yWrap)];\n\n\t\tGLuint tex;\n\n\t\tglGenTextures(1, &tex);\n\t\tglBindTexture(type, tex);\n\t\tif (data != nullptr) {\n\t\t\tglTexImage2D(type, 0, format[0], info.width, info.height, 0, format[1], format[2], data);\n\t\t} else {\n\t\t\tglTexStorage2D(type, info.mipLevels, format[0], info.width, info.height);\n\t\t}\n\t\t\n\t\tglTexParameteri(type, GL_TEXTURE_MAG_FILTER, mag);\n\t\tglTexParameteri(type, GL_TEXTURE_MIN_FILTER, min);\n\t\tglTexParameteri(type, GL_TEXTURE_WRAP_S, xw);\n\t\tglTexParameteri(type, GL_TEXTURE_WRAP_T, yw);\n\n\t\treturn { tex, info }; \n\t}\n\n\tTextureAtlas createAtlas(const oak::vector<const char*>& paths, const TextureInfo& info) {\n\t\tconst auto& format = formats[static_cast<int>(info.format)];\n\n\t\tGLenum type = types[static_cast<int>(info.type)];\n\t\tGLenum mag = filter[static_cast<int>(info.magFilter)];\n\t\tGLenum min = filter[static_cast<int>(info.minFilter)];\n\n\t\tGLenum xw = wrap[static_cast<int>(info.xWrap)];\n\t\tGLenum yw = wrap[static_cast<int>(info.yWrap)];\n\n\t\tint rcomp = components[static_cast<int>(info.format)];\n\n\t\tstruct ImageInfo {\n\t\t\tconst char *name;\n\t\t\tstbi_uc *data;\n\t\t\tint width, height, comp;\n\t\t};\n\n\t\toak::vector<ImageInfo> images;\n\n\t\t\/\/load textures\n\t\tfor (auto path : paths) {\n\t\t\tint w, h, c;\n\t\t\tstbi_uc *data = stbi_load(FileManager::inst().resolvePath(path).c_str(), &w, &h, &c, rcomp);\n\t\t\timages.push_back({ path, data, w, h, c});\n\t\t}\n\n\t\tTextureAtlas atlas;\n\t\tatlas.regions.resize(images.size());\n\n\t\t\/\/pack rects\n\t\toak::vector<stbrp_node> nodes;\n\t\tnodes.resize(info.width+1);\n\n\t\tstbrp_context c;\n\t\tstbrp_init_target(&c, info.width, info.height, nodes.data(), nodes.size());\n\n\t\toak::vector<stbrp_rect> rects;\n\t\trects.resize(images.size());\n\n\t\tfor (size_t i = 0; i < rects.size(); i++) {\n\t\t\tauto& rect = rects[i];\n\t\t\tconst auto& it = images[i];\n\t\t\trect.id = i;\n\t\t\trect.w = it.width;\n\t\t\trect.h = it.height;\n\t\t}\n\n\t\tstbrp_pack_rects(&c, rects.data(), rects.size());\n\n\t\t\/\/create texture and upload it to opengl\n\t\tTexture texture;\n\t\ttexture.info = info;\n\t\tglGenTextures(1, &texture.id);\n\t\tglBindTexture(type, texture.id);\n\t\tglTexStorage2D(type, 8, format[0], info.width, info.height);\n\n\t\tglTexParameteri(type, GL_TEXTURE_MAG_FILTER, mag);\n\t\tglTexParameteri(type, GL_TEXTURE_MIN_FILTER, min);\n\t\tglTexParameteri(type, GL_TEXTURE_WRAP_S, xw);\n\t\tglTexParameteri(type, GL_TEXTURE_WRAP_T, yw);\n\n\t\tfloat tx = 1.0f \/ info.width;\n\t\tfloat ty = 1.0f \/ info.height;\n\n\t\tif (static_cast<int>(info.minFilter) >= static_cast<int>(TextureFilter::LINEAR_MIP_LINEAR)) {\n\t\t\tGLuint tex;\n\t\t\tglGenTextures(1, &tex);\n\t\t\tglBindTexture(type, tex);\n\t\t\tfor (const auto& rect : rects) {\n\t\t\t\tconst auto& image = images[rect.id];\n\t\t\t\tauto& region = atlas.regions[rect.id];\n\t\t\t\tregion.first = oak::string{ image.name };\n\n\t\t\t\tregion.second.pos = { rect.x * tx, rect.y * ty };\n\t\t\t\tregion.second.extent = { rect.w * ty, rect.h * ty };\n\n\t\t\t\tglTexImage2D(type, 0, format[0], image.width, image.height, 0, format[1], format[2], image.data);\n\t\t\t\tglGenerateMipmap(type);\n\n\t\t\t\tint mipLevels = 1 + floor(log2(std::max(image.width, image.height)));\n\n\t\t\t\tfor (int i = 0; i < mipLevels && i < 8; i++) {\n\t\t\t\t\tglCopyImageSubData(tex, type, i, 0, 0, 0, texture.id, type, i, rect.x >> i, rect.y >> i, 0, image.width >> i, image.height >> i, 1);\n\t\t\t\t}\n\t\t\t}\n\t\t\tglDeleteTextures(1, &tex);\n\t\t} else {\n\t\t\tfor (const auto& rect : rects) {\n\t\t\t\tconst auto& image = images[rect.id];\n\t\t\t\tauto& region = atlas.regions[rect.id];\n\t\t\t\tregion.first = oak::string{ image.name };\n\n\t\t\t\tregion.second.pos = { rect.x * tx, rect.y * ty };\n\t\t\t\tregion.second.extent = { rect.w * ty, rect.h * ty };\n\n\t\t\t\tglTexSubImage2D(type, 0, rect.x, rect.y, rect.w, rect.h, format[1], format[2], image.data);\n\t\t\t}\n\t\t}\n\t\t\n\t\t\/\/free image data\n\t\tfor (auto& image : images) {\n\t\t\tstbi_image_free(image.data);\n\t\t}\n\n\t\tatlas.texture = texture;\n\n\t\treturn atlas;\n\t}\n\n\tTexture createCubemap(const oak::vector<const char*>& paths, const TextureInfo& info) {\n\t\tTexture texture;\n\n\t\tif (info.type != TextureType::CUBEMAP || paths.size() != 6) {\n\t\t\tlog_print_warn(\"cubemap not valid\");\n\t\t\treturn texture;\n\t\t}\n\t\ttexture.info = info;\n\n\t\tconst auto& format = formats[static_cast<int>(info.format)];\n\n\t\tGLenum type = types[static_cast<int>(info.type)];\n\t\tGLenum mag = filter[static_cast<int>(info.magFilter)];\n\t\tGLenum min = filter[static_cast<int>(info.minFilter)];\n\n\t\tGLenum xw = wrap[static_cast<int>(info.xWrap)];\n\t\tGLenum yw = wrap[static_cast<int>(info.yWrap)];\n\n\t\tint rcomp = components[static_cast<int>(info.format)];\n\n\t\tglGenTextures(1, &texture.id);\n\t\tglBindTexture(type, texture.id);\n\n\t\tint w, h, comp, i = 0;\n\t\tstbi_uc *data;\n\t\tfor (auto path : paths) {\n\t\t\tdata = stbi_load(FileManager::inst().resolvePath(path).c_str(), &w, &h, &comp, rcomp);\n\n\t\t\tif (data == nullptr) {\n\t\t\t\tlog_print_warn(\"failed to load texture: %s\", path);\n\t\t\t}\n\n\t\t\tglTexImage2D(GL_TEXTURE_CUBE_MAP_POSITIVE_X + i, 0, format[0], w, h, 0, format[1], format[2], data);\n\n\t\t\tstbi_image_free(data);\n\t\t\ti++;\n\t\t}\n\n\t\tglTexParameteri(type, GL_TEXTURE_MAG_FILTER, mag);\n\t\tglTexParameteri(type, GL_TEXTURE_MIN_FILTER, min);\n\t\tglTexParameteri(type, GL_TEXTURE_WRAP_S, xw);\n\t\tglTexParameteri(type, GL_TEXTURE_WRAP_T, yw);\n\t\tglTexParameteri(type, GL_TEXTURE_WRAP_R, yw);\n\n\t\tif (min >= static_cast<int>(TextureFilter::LINEAR_MIP_LINEAR)) {\n\t\t\tglGenerateMipmap(GL_TEXTURE_CUBE_MAP);\n\t\t}\n\n\t\tglBindTexture(type, 0);\n\n\t\ttexture.info.width = w;\n\t\ttexture.info.height = h;\n\n\t\treturn texture;\n\t}\n\n\tvoid destroy(Texture& texture) {\n\t\tif (texture.id) {\n\t\t\tglDeleteTextures(1, &texture.id);\n\t\t\ttexture.id = 0;\n\t\t}\n\t}\n\n}<commit_msg>fixed texture loading bug<commit_after>#include \"gl_texture.h\"\n\n#include <cmath>\n#include <glad\/glad.h>\n#define STB_IMAGE_IMPLEMENTATION\n#include <stb_image.h>\n#define STB_RECT_PACK_IMPLEMENTATION\n#include <stb_rect_pack.h>\n\n#include <file_manager.h>\n#include <log.h>\n\n#include \"texture.h\"\n\nnamespace oak::graphics::GLTexture {\n\n\tstatic const GLenum formats[][3] = {\n\t\t{ GL_RGBA8, GL_RGBA, GL_UNSIGNED_BYTE },\n\t\t{ GL_RGB8, GL_RGB, GL_UNSIGNED_BYTE },\n\t\t{ GL_R8, GL_RED, GL_UNSIGNED_BYTE },\n\t\t{ GL_RGBA32F, GL_RGBA, GL_FLOAT }, \n\t\t{ GL_RGB32F, GL_RGB, GL_FLOAT },\n\t\t{ GL_R32F, GL_RED, GL_FLOAT },\n\t\t{ GL_DEPTH_COMPONENT32F, GL_DEPTH_COMPONENT, GL_FLOAT },\n\t\t{ GL_DEPTH_COMPONENT32, GL_DEPTH_COMPONENT, GL_UNSIGNED_INT },\n\t\t{ GL_DEPTH_COMPONENT24, GL_DEPTH_COMPONENT, GL_UNSIGNED_INT },\n\t\t{ GL_DEPTH_COMPONENT16, GL_DEPTH_COMPONENT, GL_UNSIGNED_INT }\n\t};\n\n\tstatic const int components[] = {\n\t\t4,\n\t\t3,\n\t\t1,\n\t\t4,\n\t\t3,\n\t\t1,\n\t\t1,\n\t\t1,\n\t\t1,\n\t\t1\n\t};\n\n\tstatic const GLenum types[] = {\n\t\tGL_TEXTURE_2D,\n\t\tGL_TEXTURE_3D,\n\t\tGL_TEXTURE_2D_ARRAY,\n\t\tGL_TEXTURE_CUBE_MAP\n\t};\n\n\tstatic const GLenum filter[] = {\n\t\tGL_NEAREST,\n\t\tGL_LINEAR,\n\t\tGL_LINEAR_MIPMAP_LINEAR,\n\t\tGL_NEAREST_MIPMAP_NEAREST,\n\t\tGL_LINEAR_MIPMAP_NEAREST,\n\t\tGL_NEAREST_MIPMAP_LINEAR\n\t};\n\n\tstatic const GLenum wrap[] = {\n\t\tGL_REPEAT,\n\t\tGL_CLAMP_TO_EDGE\n\t};\n\n\tvoid bind(const Texture& texture, int slot) {\n\t\tglActiveTexture(GL_TEXTURE0 + slot);\n\t\tglBindTexture(types[static_cast<int>(texture.info.type)], texture.id);\n\t}\n\n\tTexture create(const char *path, const TextureInfo& info) {\n\t\tint w, h, comp;\n\t\tstbi_uc *data = stbi_load(FileManager::inst().resolvePath(path).c_str(), &w, &h, &comp, components[static_cast<int>(info.format)]);\n\n\t\tif (!data) {\n\t\t\tlog_print_warn(\"failed to load texture: %s\", path);\n\t\t}\n\n\t\tTextureInfo ti = info;\n\t\tti.width = w;\n\t\tti.height = h;\n\n\t\tconst Texture& tex = create(ti, data);\n\n\t\tif (static_cast<int>(info.minFilter) >= static_cast<int>(TextureFilter::LINEAR_MIP_LINEAR)) {\n\t\t\tglGenerateMipmap(GL_TEXTURE_2D);\n\t\t}\n\n\t\tif (data) {\n\t\t\tstbi_image_free(data);\n\t\t}\n\n\t\treturn tex;\n\t}\n\n\tTexture create(const TextureInfo& info, void *data) {\n\n\t\tconst auto& format = formats[static_cast<int>(info.format)];\n\n\t\tGLenum type = types[static_cast<int>(info.type)];\n\t\tGLenum mag = filter[static_cast<int>(info.magFilter)];\n\t\tGLenum min = filter[static_cast<int>(info.minFilter)];\n\n\t\tGLenum xw = wrap[static_cast<int>(info.xWrap)];\n\t\tGLenum yw = wrap[static_cast<int>(info.yWrap)];\n\n\t\tGLuint tex;\n\n\t\tglGenTextures(1, &tex);\n\t\tglBindTexture(type, tex);\n\t\tif (data != nullptr) {\n\t\t\tglTexImage2D(type, 0, format[0], info.width, info.height, 0, format[1], format[2], data);\n\t\t} else {\n\t\t\tglTexStorage2D(type, info.mipLevels, format[0], info.width, info.height);\n\t\t}\n\t\t\n\t\tglTexParameteri(type, GL_TEXTURE_MAG_FILTER, mag);\n\t\tglTexParameteri(type, GL_TEXTURE_MIN_FILTER, min);\n\t\tglTexParameteri(type, GL_TEXTURE_WRAP_S, xw);\n\t\tglTexParameteri(type, GL_TEXTURE_WRAP_T, yw);\n\n\t\treturn { tex, info }; \n\t}\n\n\tTextureAtlas createAtlas(const oak::vector<const char*>& paths, const TextureInfo& info) {\n\t\tconst auto& format = formats[static_cast<int>(info.format)];\n\n\t\tGLenum type = types[static_cast<int>(info.type)];\n\t\tGLenum mag = filter[static_cast<int>(info.magFilter)];\n\t\tGLenum min = filter[static_cast<int>(info.minFilter)];\n\n\t\tGLenum xw = wrap[static_cast<int>(info.xWrap)];\n\t\tGLenum yw = wrap[static_cast<int>(info.yWrap)];\n\n\t\tint rcomp = components[static_cast<int>(info.format)];\n\n\t\tstruct ImageInfo {\n\t\t\tconst char *name;\n\t\t\tstbi_uc *data;\n\t\t\tint width, height, comp;\n\t\t};\n\n\t\toak::vector<ImageInfo> images;\n\n\t\t\/\/load textures\n\t\tfor (auto path : paths) {\n\t\t\tint w, h, c;\n\t\t\tstbi_uc *data = stbi_load(FileManager::inst().resolvePath(path).c_str(), &w, &h, &c, rcomp);\n\t\t\tif (!data) {\n\t\t\t\tlog_print_warn(\"failed to load texture: %s\", path.c_str());\n\t\t\t}\n\t\t\timages.push_back({ path, data, w, h, c});\n\t\t}\n\n\t\tTextureAtlas atlas;\n\t\tatlas.regions.resize(images.size());\n\n\t\t\/\/pack rects\n\t\toak::vector<stbrp_node> nodes;\n\t\tnodes.resize(info.width+1);\n\n\t\tstbrp_context c;\n\t\tstbrp_init_target(&c, info.width, info.height, nodes.data(), nodes.size());\n\n\t\toak::vector<stbrp_rect> rects;\n\t\trects.resize(images.size());\n\n\t\tfor (size_t i = 0; i < rects.size(); i++) {\n\t\t\tauto& rect = rects[i];\n\t\t\tconst auto& it = images[i];\n\t\t\trect.id = i;\n\t\t\trect.w = it.width;\n\t\t\trect.h = it.height;\n\t\t}\n\n\t\tstbrp_pack_rects(&c, rects.data(), rects.size());\n\n\t\t\/\/create texture and upload it to opengl\n\t\tTexture texture;\n\t\ttexture.info = info;\n\t\tglGenTextures(1, &texture.id);\n\t\tglBindTexture(type, texture.id);\n\t\tglTexStorage2D(type, 8, format[0], info.width, info.height);\n\n\t\tglTexParameteri(type, GL_TEXTURE_MAG_FILTER, mag);\n\t\tglTexParameteri(type, GL_TEXTURE_MIN_FILTER, min);\n\t\tglTexParameteri(type, GL_TEXTURE_WRAP_S, xw);\n\t\tglTexParameteri(type, GL_TEXTURE_WRAP_T, yw);\n\n\t\tfloat tx = 1.0f \/ info.width;\n\t\tfloat ty = 1.0f \/ info.height;\n\n\t\tif (static_cast<int>(info.minFilter) >= static_cast<int>(TextureFilter::LINEAR_MIP_LINEAR)) {\n\t\t\tGLuint tex;\n\t\t\tglGenTextures(1, &tex);\n\t\t\tglBindTexture(type, tex);\n\t\t\tfor (const auto& rect : rects) {\n\t\t\t\tconst auto& image = images[rect.id];\n\t\t\t\tauto& region = atlas.regions[rect.id];\n\t\t\t\tregion.first = oak::string{ image.name };\n\n\t\t\t\tregion.second.pos = { rect.x * tx, rect.y * ty };\n\t\t\t\tregion.second.extent = { rect.w * ty, rect.h * ty };\n\n\t\t\t\tglTexImage2D(type, 0, format[0], image.width, image.height, 0, format[1], format[2], image.data);\n\t\t\t\tglGenerateMipmap(type);\n\n\t\t\t\tint mipLevels = 1 + floor(log2(std::max(image.width, image.height)));\n\n\t\t\t\tfor (int i = 0; i < mipLevels && i < 8; i++) {\n\t\t\t\t\tglCopyImageSubData(tex, type, i, 0, 0, 0, texture.id, type, i, rect.x >> i, rect.y >> i, 0, image.width >> i, image.height >> i, 1);\n\t\t\t\t}\n\t\t\t}\n\t\t\tglDeleteTextures(1, &tex);\n\t\t} else {\n\t\t\tfor (const auto& rect : rects) {\n\t\t\t\tconst auto& image = images[rect.id];\n\t\t\t\tauto& region = atlas.regions[rect.id];\n\t\t\t\tregion.first = oak::string{ image.name };\n\n\t\t\t\tregion.second.pos = { rect.x * tx, rect.y * ty };\n\t\t\t\tregion.second.extent = { rect.w * ty, rect.h * ty };\n\n\t\t\t\tglTexSubImage2D(type, 0, rect.x, rect.y, rect.w, rect.h, format[1], format[2], image.data);\n\t\t\t}\n\t\t}\n\t\t\n\t\t\/\/free image data\n\t\tfor (auto& image : images) {\n\t\t\tif (image.data) {\n\t\t\t\tstbi_image_free(image.data);\n\t\t\t}\n\t\t}\n\n\t\tatlas.texture = texture;\n\n\t\treturn atlas;\n\t}\n\n\tTexture createCubemap(const oak::vector<const char*>& paths, const TextureInfo& info) {\n\t\tTexture texture;\n\n\t\tif (info.type != TextureType::CUBEMAP || paths.size() != 6) {\n\t\t\tlog_print_warn(\"cubemap not valid\");\n\t\t\treturn texture;\n\t\t}\n\t\ttexture.info = info;\n\n\t\tconst auto& format = formats[static_cast<int>(info.format)];\n\n\t\tGLenum type = types[static_cast<int>(info.type)];\n\t\tGLenum mag = filter[static_cast<int>(info.magFilter)];\n\t\tGLenum min = filter[static_cast<int>(info.minFilter)];\n\n\t\tGLenum xw = wrap[static_cast<int>(info.xWrap)];\n\t\tGLenum yw = wrap[static_cast<int>(info.yWrap)];\n\n\t\tint rcomp = components[static_cast<int>(info.format)];\n\n\t\tglGenTextures(1, &texture.id);\n\t\tglBindTexture(type, texture.id);\n\n\t\tint w, h, comp, i = 0;\n\t\tstbi_uc *data;\n\t\tfor (auto path : paths) {\n\t\t\tdata = stbi_load(FileManager::inst().resolvePath(path).c_str(), &w, &h, &comp, rcomp);\n\n\t\t\tif (data == nullptr) {\n\t\t\t\tlog_print_warn(\"failed to load texture: %s\", path);\n\t\t\t}\n\n\t\t\tglTexImage2D(GL_TEXTURE_CUBE_MAP_POSITIVE_X + i, 0, format[0], w, h, 0, format[1], format[2], data);\n\n\t\t\tstbi_image_free(data);\n\t\t\ti++;\n\t\t}\n\n\t\tglTexParameteri(type, GL_TEXTURE_MAG_FILTER, mag);\n\t\tglTexParameteri(type, GL_TEXTURE_MIN_FILTER, min);\n\t\tglTexParameteri(type, GL_TEXTURE_WRAP_S, xw);\n\t\tglTexParameteri(type, GL_TEXTURE_WRAP_T, yw);\n\t\tglTexParameteri(type, GL_TEXTURE_WRAP_R, yw);\n\n\t\tif (min >= static_cast<int>(TextureFilter::LINEAR_MIP_LINEAR)) {\n\t\t\tglGenerateMipmap(GL_TEXTURE_CUBE_MAP);\n\t\t}\n\n\t\tglBindTexture(type, 0);\n\n\t\ttexture.info.width = w;\n\t\ttexture.info.height = h;\n\n\t\treturn texture;\n\t}\n\n\tvoid destroy(Texture& texture) {\n\t\tif (texture.id) {\n\t\t\tglDeleteTextures(1, &texture.id);\n\t\t\ttexture.id = 0;\n\t\t}\n\t}\n\n}\n<|endoftext|>"} {"text":"<commit_before>\/* Begin CVS Header\n $Source: \/Volumes\/Home\/Users\/shoops\/cvs\/copasi_dev\/semantic-test-suite\/copasi_wrapper.cpp,v $\n $Revision: 1.9 $\n $Name: $\n $Author: gauges $ \n $Date: 2006\/03\/13 14:19:47 $\n End CVS Header *\/\n\n#define COPASI_MAIN\n\n#include <iostream>\n#include <stdlib.h>\n\n#include \"copasi.h\"\n#include \"CopasiDataModel\/CCopasiDataModel.h\"\n#include \"report\/CCopasiContainer.h\"\n#include \"model\/CMetab.h\"\n#include \"report\/CCopasiObjectName.h\"\n#include \"utilities\/CCopasiVector.h\"\n#include \"model\/CModel.h\"\n#include \"utilities\/CCopasiException.h\"\n#include \"commandline\/COptionParser.h\"\n#include \"commandline\/COptions.h\"\n\n#include \"trajectory\/CTrajectoryTask.h\"\n#include \"trajectory\/CTrajectoryMethod.h\"\n#include \"trajectory\/CTrajectoryProblem.h\"\n#include \"report\/CReportDefinitionVector.h\"\n#include \"report\/CReportDefinition.h\"\n\nint main(int argc, char *argv[])\n{\n \/\/ Parse the commandline options\n \/\/ first argument is the SBML filename\n \/\/ second argument is the endtime\n \/\/ third argument is the step number\n \/\/ fourth argument is the filename where the results are to be written\n \/\/ fifth argument is the tmp directory (this is not needed)\n \/\/ the rest of the arguments are species names for the result\n try\n {\n \/\/ Parse the commandline options\n COptions::init(argc, argv);\n }\n\n catch (copasi::autoexcept &e)\n {}\n\n catch (copasi::option_error &e)\n {}\n if (argc < 5)\n {\n std::cout << \"Usage: semantic-test-suite SBMLFILENAME ENDTIME STEPNUMBER OUTFILENAME\" << std::endl;\n exit(1);\n }\n char* pSBMLFilename = argv[1];\n char* pEndTime = argv[2];\n char* pStepNumber = argv[3];\n char* pOutputFilename = argv[4];\n \/\/char* pTmpDirectory=argv[5];\n char** pSBMLSpeciesIds = new char * [argc - 6];\n unsigned int i, iMax = argc;\n CTrajectoryTask* pTrajectoryTask = NULL;\n\n double endTime = strtod(pEndTime, &pEndTime);\n double stepNumber = strtod(pStepNumber, &pStepNumber);\n if (endTime == 0.0)\n {\n std::cerr << \"Invalid endtime \" << pEndTime << std::endl;\n exit(1);\n }\n if (stepNumber == 0.0)\n {\n std::cerr << \"Invalid step number \" << pStepNumber << std::endl;\n exit(1);\n }\n\n for (i = 6; i < iMax;++i)\n {\n pSBMLSpeciesIds[i - 6] = argv[i];\n \/\/std::cout << \"Copying pointer to \" << argv[i] << \".\" << std::endl;\n }\n\n try\n {\n \/\/ Create the root container.\n CCopasiContainer::init();\n\n \/\/ Create the global data model.\n CCopasiDataModel::Global = new CCopasiDataModel;\n\n \/\/ Import the SBML File\n CCopasiDataModel::Global->importSBML(pSBMLFilename);\n\n \/\/CCopasiDataModel::Global->getModel()->forceCompile();\n\n \/\/ create a report with the correct filename and all the species against\n \/\/ time.\n CReportDefinitionVector* pReports = CCopasiDataModel::Global->getReportDefinitionList();\n CReportDefinition* pReport = pReports->createReportDefinition(\"Report\", \"Output for SBML testsuite run\");\n pReport->setTaskType(CCopasiTask::timeCourse);\n pReport->setIsTable(true);\n\n std::vector<CRegisteredObjectName>* pTable = pReport->getTableAddr();\n pTable->push_back(CCopasiObjectName(\"CN=Root,Model=\" + CCopasiDataModel::Global->getModel()->getObjectName() + \",Reference=Time\"));\n iMax = iMax - 6;\n const CCopasiVector<CMetab>& metabolites = CCopasiDataModel::Global->getModel()->getMetabolites();\n for (i = 0; i < iMax;++i)\n {\n unsigned int j, jMax = metabolites.size();\n for (j = 0; j < jMax;++j)\n {\n if (metabolites[j]->getSBMLId() == pSBMLSpeciesIds[i])\n {\n pTable->push_back(metabolites[j]->getObject(CCopasiObjectName(\"Reference=Concentration\"))->getCN());\n \/\/std::cout << \"adding metabolite \" << metabolites[j]->getObjectName() << \" to report.\" << std::endl;\n break;\n }\n }\n if (j == jMax)\n {\n std::cerr << \"Could not find a metabolite for the SBML id \" << pSBMLSpeciesIds[i] << std::endl;\n exit(1);\n }\n }\n\n \/\/ create a trajectory task\n pTrajectoryTask = new CTrajectoryTask();\n pTrajectoryTask->getProblem()->setModel(CCopasiDataModel::Global->getModel());\n\n pTrajectoryTask->setScheduled(true);\n\n pTrajectoryTask->getReport().setReportDefinition(pReport);\n pTrajectoryTask->getReport().setTarget(pOutputFilename);\n pTrajectoryTask->getReport().setAppend(false);\n\n CTrajectoryProblem* pProblem = dynamic_cast<CTrajectoryProblem*>(pTrajectoryTask->getProblem());\n\n pProblem->setStepNumber((const unsigned C_INT32)stepNumber);\n pProblem->setDuration((const C_FLOAT64)endTime);\n pProblem->setTimeSeriesRequested(true);\n \/\/pProblem->setInitialState(CCopasiDataModel::Global->getModel()->getInitialState());\n\n CCopasiVectorN< CCopasiTask > & TaskList = * CCopasiDataModel::Global->getTaskList();\n\n TaskList.remove(\"Time-Course\");\n TaskList.add(pTrajectoryTask, true);\n\n \/\/ save the file for control purposes\n std::string saveFilename = pSBMLFilename;\n saveFilename = saveFilename.substr(0, saveFilename.length() - 4) + \".cps\";\n CCopasiDataModel::Global->saveModel(saveFilename, true);\n\n \/\/ Run the trajectory task\n\n pTrajectoryTask->initialize(CCopasiTask::OUTPUT_COMPLETE, NULL);\n pTrajectoryTask->process(true);\n pTrajectoryTask->restore();\n\n \/\/ create another report that will write to the directory where the input file came from\n \/\/ this can be used for debugging\n \/\/ create a trajectory task\n pTrajectoryTask->getReport().setTarget(saveFilename + std::string(\".CSV\"));\n\n pTrajectoryTask->initialize(CCopasiTask::OUTPUT_COMPLETE, NULL);\n pTrajectoryTask->process(true);\n pTrajectoryTask->restore();\n }\n catch (CCopasiException Exception)\n {\n std::cerr << Exception.getMessage().getText() << std::endl;\n }\n\n pdelete(CCopasiDataModel::Global);\n pdelete(CCopasiContainer::Root);\n\n return 0;\n}\n<commit_msg>OK. This is the correct usage.<commit_after>\/* Begin CVS Header\n $Source: \/Volumes\/Home\/Users\/shoops\/cvs\/copasi_dev\/semantic-test-suite\/copasi_wrapper.cpp,v $\n $Revision: 1.10 $\n $Name: $\n $Author: gauges $ \n $Date: 2006\/03\/13 14:24:42 $\n End CVS Header *\/\n\n#define COPASI_MAIN\n\n#include <iostream>\n#include <stdlib.h>\n\n#include \"copasi.h\"\n#include \"CopasiDataModel\/CCopasiDataModel.h\"\n#include \"report\/CCopasiContainer.h\"\n#include \"model\/CMetab.h\"\n#include \"report\/CCopasiObjectName.h\"\n#include \"utilities\/CCopasiVector.h\"\n#include \"model\/CModel.h\"\n#include \"utilities\/CCopasiException.h\"\n#include \"commandline\/COptionParser.h\"\n#include \"commandline\/COptions.h\"\n\n#include \"trajectory\/CTrajectoryTask.h\"\n#include \"trajectory\/CTrajectoryMethod.h\"\n#include \"trajectory\/CTrajectoryProblem.h\"\n#include \"report\/CReportDefinitionVector.h\"\n#include \"report\/CReportDefinition.h\"\n\nint main(int argc, char *argv[])\n{\n \/\/ Parse the commandline options\n \/\/ first argument is the SBML filename\n \/\/ second argument is the endtime\n \/\/ third argument is the step number\n \/\/ fourth argument is the filename where the results are to be written\n \/\/ fifth argument is the tmp directory (this is not needed)\n \/\/ the rest of the arguments are species names for the result\n try\n {\n \/\/ Parse the commandline options\n COptions::init(argc, argv);\n }\n\n catch (copasi::autoexcept &e)\n {}\n\n catch (copasi::option_error &e)\n {}\n if (argc < 5)\n {\n std::cout << \"Usage: semantic-test-suite SBMLFILENAME ENDTIME STEPNUMBER OUTFILENAME TMPDIR SPECIESID1 SPECIESID2 ...\" << std::endl;\n exit(1);\n }\n char* pSBMLFilename = argv[1];\n char* pEndTime = argv[2];\n char* pStepNumber = argv[3];\n char* pOutputFilename = argv[4];\n \/\/char* pTmpDirectory=argv[5];\n char** pSBMLSpeciesIds = new char * [argc - 6];\n unsigned int i, iMax = argc;\n CTrajectoryTask* pTrajectoryTask = NULL;\n\n double endTime = strtod(pEndTime, &pEndTime);\n double stepNumber = strtod(pStepNumber, &pStepNumber);\n if (endTime == 0.0)\n {\n std::cerr << \"Invalid endtime \" << pEndTime << std::endl;\n exit(1);\n }\n if (stepNumber == 0.0)\n {\n std::cerr << \"Invalid step number \" << pStepNumber << std::endl;\n exit(1);\n }\n\n for (i = 6; i < iMax;++i)\n {\n pSBMLSpeciesIds[i - 6] = argv[i];\n \/\/std::cout << \"Copying pointer to \" << argv[i] << \".\" << std::endl;\n }\n\n try\n {\n \/\/ Create the root container.\n CCopasiContainer::init();\n\n \/\/ Create the global data model.\n CCopasiDataModel::Global = new CCopasiDataModel;\n\n \/\/ Import the SBML File\n CCopasiDataModel::Global->importSBML(pSBMLFilename);\n\n \/\/CCopasiDataModel::Global->getModel()->forceCompile();\n\n \/\/ create a report with the correct filename and all the species against\n \/\/ time.\n CReportDefinitionVector* pReports = CCopasiDataModel::Global->getReportDefinitionList();\n CReportDefinition* pReport = pReports->createReportDefinition(\"Report\", \"Output for SBML testsuite run\");\n pReport->setTaskType(CCopasiTask::timeCourse);\n pReport->setIsTable(true);\n\n std::vector<CRegisteredObjectName>* pTable = pReport->getTableAddr();\n pTable->push_back(CCopasiObjectName(\"CN=Root,Model=\" + CCopasiDataModel::Global->getModel()->getObjectName() + \",Reference=Time\"));\n iMax = iMax - 6;\n const CCopasiVector<CMetab>& metabolites = CCopasiDataModel::Global->getModel()->getMetabolites();\n for (i = 0; i < iMax;++i)\n {\n unsigned int j, jMax = metabolites.size();\n for (j = 0; j < jMax;++j)\n {\n if (metabolites[j]->getSBMLId() == pSBMLSpeciesIds[i])\n {\n pTable->push_back(metabolites[j]->getObject(CCopasiObjectName(\"Reference=Concentration\"))->getCN());\n \/\/std::cout << \"adding metabolite \" << metabolites[j]->getObjectName() << \" to report.\" << std::endl;\n break;\n }\n }\n if (j == jMax)\n {\n std::cerr << \"Could not find a metabolite for the SBML id \" << pSBMLSpeciesIds[i] << std::endl;\n exit(1);\n }\n }\n\n \/\/ create a trajectory task\n pTrajectoryTask = new CTrajectoryTask();\n pTrajectoryTask->getProblem()->setModel(CCopasiDataModel::Global->getModel());\n\n pTrajectoryTask->setScheduled(true);\n\n pTrajectoryTask->getReport().setReportDefinition(pReport);\n pTrajectoryTask->getReport().setTarget(pOutputFilename);\n pTrajectoryTask->getReport().setAppend(false);\n\n CTrajectoryProblem* pProblem = dynamic_cast<CTrajectoryProblem*>(pTrajectoryTask->getProblem());\n\n pProblem->setStepNumber((const unsigned C_INT32)stepNumber);\n pProblem->setDuration((const C_FLOAT64)endTime);\n pProblem->setTimeSeriesRequested(true);\n \/\/pProblem->setInitialState(CCopasiDataModel::Global->getModel()->getInitialState());\n\n CCopasiVectorN< CCopasiTask > & TaskList = * CCopasiDataModel::Global->getTaskList();\n\n TaskList.remove(\"Time-Course\");\n TaskList.add(pTrajectoryTask, true);\n\n \/\/ save the file for control purposes\n std::string saveFilename = pSBMLFilename;\n saveFilename = saveFilename.substr(0, saveFilename.length() - 4) + \".cps\";\n CCopasiDataModel::Global->saveModel(saveFilename, true);\n\n \/\/ Run the trajectory task\n\n pTrajectoryTask->initialize(CCopasiTask::OUTPUT_COMPLETE, NULL);\n pTrajectoryTask->process(true);\n pTrajectoryTask->restore();\n\n \/\/ create another report that will write to the directory where the input file came from\n \/\/ this can be used for debugging\n \/\/ create a trajectory task\n pTrajectoryTask->getReport().setTarget(saveFilename + std::string(\".CSV\"));\n\n pTrajectoryTask->initialize(CCopasiTask::OUTPUT_COMPLETE, NULL);\n pTrajectoryTask->process(true);\n pTrajectoryTask->restore();\n }\n catch (CCopasiException Exception)\n {\n std::cerr << Exception.getMessage().getText() << std::endl;\n }\n\n pdelete(CCopasiDataModel::Global);\n pdelete(CCopasiContainer::Root);\n\n return 0;\n}\n<|endoftext|>"} {"text":"<commit_before>\/* Begin CVS Header\n $Source: \/Volumes\/Home\/Users\/shoops\/cvs\/copasi_dev\/semantic-test-suite\/copasi_wrapper.cpp,v $\n $Revision: 1.1 $\n $Name: $\n $Author: gauges $ \n $Date: 2005\/07\/27 12:46:46 $\n End CVS Header *\/\n\n#define COPASI_MAIN\n\n#include <iostream>\n#include <stdlib.h>\n\n#include \"copasi.h\"\n#include \"CopasiDataModel\/CCopasiDataModel.h\"\n#include \"report\/CCopasiContainer.h\"\n#include \"model\/CMetab.h\"\n#include \"report\/CCopasiObjectName.h\"\n#include \"utilities\/CCopasiVector.h\"\n#include \"model\/CModel.h\"\n#include \"utilities\/CCopasiException.h\"\n#include \"commandline\/COptionParser.h\"\n#include \"commandline\/COptions.h\"\n\n#include \"trajectory\/CTrajectoryTask.h\"\n#include \"trajectory\/CTrajectoryMethod.h\"\n#include \"trajectory\/CTrajectoryProblem.h\"\n#include \"report\/CReportDefinitionVector.h\"\n#include \"report\/CReportDefinition.h\"\n\nint main(int argc, char *argv[])\n{\n \/\/ Parse the commandline options\n \/\/ first argument is the SBML filename\n \/\/ second argument is the endtime\n \/\/ third argument is the step number\n \/\/ fourth argument is the filename where the results are to be written\n \/\/ fifth argument is the tmp directory (this is not needed)\n \/\/ the rest of the arguments are species names for the result\n try\n {\n \/\/ Parse the commandline options\n COptions::init(argc, argv);\n }\n\n catch (copasi::autoexcept &e)\n {}\n\n catch (copasi::option_error &e)\n {\n }\n\n char* pSBMLFilename = argv[1];\n char* pEndTime = argv[2];\n char* pStepNumber = argv[3];\n char* pOutputFilename = argv[4];\n \/\/char* pTmpDirectory=argv[5];\n char** pSBMLSpeciesIds = new char * [argc - 6];\n unsigned int i, iMax = argc;\n CTrajectoryTask* pTrajectoryTask = NULL;\n\n double endTime = strtod(pEndTime, &pEndTime);\n double stepNumber = strtod(pStepNumber, &pStepNumber);\n if (endTime == 0.0)\n {\n std::cerr << \"Invalid endtime \" << pEndTime << std::endl;\n exit(1);\n }\n if (stepNumber == 0.0)\n {\n std::cerr << \"Invalid step number \" << pStepNumber << std::endl;\n exit(1);\n }\n\n for (i = 6; i < iMax;++i)\n {\n pSBMLSpeciesIds[i - 6] = argv[i];\n }\n\n try\n {\n \/\/ Create the root container.\n CCopasiContainer::init();\n\n \/\/ Create the global data model.\n CCopasiDataModel::Global = new CCopasiDataModel;\n\n \/\/ Import the SBML File\n CCopasiDataModel::Global->importSBML(pSBMLFilename);\n\n \/\/ create a report with the correct filename and all the species against\n \/\/ time.\n CReportDefinitionVector* pReports = CCopasiDataModel::Global->getReportDefinitionList();\n CReportDefinition* pReport = pReports->createReportDefinition(\"Report\", \"Output for SBML testsuite run\");\n pReport->setTaskType(CCopasiTask::timeCourse);\n pReport->setIsTable(true);\n\n std::vector<CRegisteredObjectName>* pTable = pReport->getTableAddr();\n pTable->push_back(CCopasiObjectName(\"CN=Root,Model=\" + CCopasiDataModel::Global->getModel()->getObjectName() + \",Reference=Time\"));\n iMax = iMax - 6;\n const CCopasiVector<CMetab>& metabolites = CCopasiDataModel::Global->getModel()->getMetabolites();\n for (i = 0; i < iMax;++i)\n {\n unsigned int j, jMax = metabolites.size();\n for (j = 0; j < jMax;++j)\n {\n if (metabolites[j]->getSBMLId() == pSBMLSpeciesIds[i])\n {\n pTable->push_back(metabolites[i]->getObject(CCopasiObjectName(\"Reference=Concentration\"))->getCN());\n break;\n }\n }\n if (j == jMax)\n {\n std::cerr << \"Could not find a metabolite for the SBML id \" << pSBMLSpeciesIds[i] << std::endl;\n exit(1);\n }\n }\n\n \/\/ create a trajectory task\n pTrajectoryTask = new CTrajectoryTask();\n pTrajectoryTask->getProblem()->setModel(CCopasiDataModel::Global->getModel());\n\n pTrajectoryTask->getReport().setReportDefinition(pReport);\n pTrajectoryTask->getReport().setTarget(pOutputFilename);\n pTrajectoryTask->getReport().setAppend(false);\n\n \/\/CTrajectoryMethod* pMethod=dynamic_cast<CTrajectoryMethod*>(pTrajectoryTask->getMethod());\n CTrajectoryProblem* pProblem = dynamic_cast<CTrajectoryProblem*>(pTrajectoryTask->getProblem());\n\n pProblem->setStepNumber((const unsigned C_INT32)stepNumber);\n pProblem->setEndTime((const C_FLOAT64)endTime);\n pProblem->setTimeSeriesRequested(true);\n\n CCopasiVectorN< CCopasiTask > & TaskList = * CCopasiDataModel::Global->getTaskList();\n\n TaskList.remove(\"Time-Course\");\n TaskList.add(pTrajectoryTask, true);\n\n \/\/ save the file for control purposes\n std::string saveFilename = pSBMLFilename;\n saveFilename = saveFilename.substr(0, saveFilename.length() - 4) + \".cps\";\n CCopasiDataModel::Global->saveModel(saveFilename, true);\n\n \/\/ Run the trajectory task\n\n pTrajectoryTask->initialize();\n pTrajectoryTask->process();\n pTrajectoryTask->restore();\n }\n catch (CCopasiException Exception)\n {\n std::cerr << Exception.getMessage().getText() << std::endl;\n }\n\n pdelete(CCopasiDataModel::Global);\n pdelete(CCopasiContainer::Root);\n\n return 0;\n}\n<commit_msg>Write the results twice to file. One is written to the directory of the specific test. This is nice for debugging.<commit_after>\/* Begin CVS Header\n $Source: \/Volumes\/Home\/Users\/shoops\/cvs\/copasi_dev\/semantic-test-suite\/copasi_wrapper.cpp,v $\n $Revision: 1.2 $\n $Name: $\n $Author: gauges $ \n $Date: 2005\/07\/27 13:14:07 $\n End CVS Header *\/\n\n#define COPASI_MAIN\n\n#include <iostream>\n#include <stdlib.h>\n\n#include \"copasi.h\"\n#include \"CopasiDataModel\/CCopasiDataModel.h\"\n#include \"report\/CCopasiContainer.h\"\n#include \"model\/CMetab.h\"\n#include \"report\/CCopasiObjectName.h\"\n#include \"utilities\/CCopasiVector.h\"\n#include \"model\/CModel.h\"\n#include \"utilities\/CCopasiException.h\"\n#include \"commandline\/COptionParser.h\"\n#include \"commandline\/COptions.h\"\n\n#include \"trajectory\/CTrajectoryTask.h\"\n#include \"trajectory\/CTrajectoryMethod.h\"\n#include \"trajectory\/CTrajectoryProblem.h\"\n#include \"report\/CReportDefinitionVector.h\"\n#include \"report\/CReportDefinition.h\"\n\nint main(int argc, char *argv[])\n{\n \/\/ Parse the commandline options\n \/\/ first argument is the SBML filename\n \/\/ second argument is the endtime\n \/\/ third argument is the step number\n \/\/ fourth argument is the filename where the results are to be written\n \/\/ fifth argument is the tmp directory (this is not needed)\n \/\/ the rest of the arguments are species names for the result\n try\n {\n \/\/ Parse the commandline options\n COptions::init(argc, argv);\n }\n\n catch (copasi::autoexcept &e)\n {}\n\n catch (copasi::option_error &e)\n {}\n\n char* pSBMLFilename = argv[1];\n char* pEndTime = argv[2];\n char* pStepNumber = argv[3];\n char* pOutputFilename = argv[4];\n \/\/char* pTmpDirectory=argv[5];\n char** pSBMLSpeciesIds = new char * [argc - 6];\n unsigned int i, iMax = argc;\n CTrajectoryTask* pTrajectoryTask = NULL;\n\n double endTime = strtod(pEndTime, &pEndTime);\n double stepNumber = strtod(pStepNumber, &pStepNumber);\n if (endTime == 0.0)\n {\n std::cerr << \"Invalid endtime \" << pEndTime << std::endl;\n exit(1);\n }\n if (stepNumber == 0.0)\n {\n std::cerr << \"Invalid step number \" << pStepNumber << std::endl;\n exit(1);\n }\n\n for (i = 6; i < iMax;++i)\n {\n pSBMLSpeciesIds[i - 6] = argv[i];\n }\n\n try\n {\n \/\/ Create the root container.\n CCopasiContainer::init();\n\n \/\/ Create the global data model.\n CCopasiDataModel::Global = new CCopasiDataModel;\n\n \/\/ Import the SBML File\n CCopasiDataModel::Global->importSBML(pSBMLFilename);\n\n \/\/ create a report with the correct filename and all the species against\n \/\/ time.\n CReportDefinitionVector* pReports = CCopasiDataModel::Global->getReportDefinitionList();\n CReportDefinition* pReport = pReports->createReportDefinition(\"Report\", \"Output for SBML testsuite run\");\n pReport->setTaskType(CCopasiTask::timeCourse);\n pReport->setIsTable(true);\n\n std::vector<CRegisteredObjectName>* pTable = pReport->getTableAddr();\n pTable->push_back(CCopasiObjectName(\"CN=Root,Model=\" + CCopasiDataModel::Global->getModel()->getObjectName() + \",Reference=Time\"));\n iMax = iMax - 6;\n const CCopasiVector<CMetab>& metabolites = CCopasiDataModel::Global->getModel()->getMetabolites();\n for (i = 0; i < iMax;++i)\n {\n unsigned int j, jMax = metabolites.size();\n for (j = 0; j < jMax;++j)\n {\n if (metabolites[j]->getSBMLId() == pSBMLSpeciesIds[i])\n {\n pTable->push_back(metabolites[i]->getObject(CCopasiObjectName(\"Reference=Concentration\"))->getCN());\n break;\n }\n }\n if (j == jMax)\n {\n std::cerr << \"Could not find a metabolite for the SBML id \" << pSBMLSpeciesIds[i] << std::endl;\n exit(1);\n }\n }\n\n \/\/ create a trajectory task\n pTrajectoryTask = new CTrajectoryTask();\n pTrajectoryTask->getProblem()->setModel(CCopasiDataModel::Global->getModel());\n\n pTrajectoryTask->getReport().setReportDefinition(pReport);\n pTrajectoryTask->getReport().setTarget(pOutputFilename);\n pTrajectoryTask->getReport().setAppend(false);\n\n CTrajectoryProblem* pProblem = dynamic_cast<CTrajectoryProblem*>(pTrajectoryTask->getProblem());\n\n pProblem->setStepNumber((const unsigned C_INT32)stepNumber);\n pProblem->setEndTime((const C_FLOAT64)endTime);\n pProblem->setTimeSeriesRequested(true);\n\n CCopasiVectorN< CCopasiTask > & TaskList = * CCopasiDataModel::Global->getTaskList();\n\n TaskList.remove(\"Time-Course\");\n TaskList.add(pTrajectoryTask, true);\n\n \/\/ save the file for control purposes\n std::string saveFilename = pSBMLFilename;\n saveFilename = saveFilename.substr(0, saveFilename.length() - 4) + \".cps\";\n CCopasiDataModel::Global->saveModel(saveFilename, true);\n\n \/\/ Run the trajectory task\n\n pTrajectoryTask->initialize();\n pTrajectoryTask->process();\n pTrajectoryTask->restore();\n\n \/\/ create another report that will write to the directory where the input file came from\n \/\/ this can be used for debugging\n \/\/ create a trajectory task\n pTrajectoryTask->getReport().setTarget(saveFilename + std::string(\".CSV\"));\n\n pTrajectoryTask->initialize();\n pTrajectoryTask->process();\n pTrajectoryTask->restore();\n }\n catch (CCopasiException Exception)\n {\n std::cerr << Exception.getMessage().getText() << std::endl;\n }\n\n pdelete(CCopasiDataModel::Global);\n pdelete(CCopasiContainer::Root);\n\n return 0;\n}\n<|endoftext|>"} {"text":"<commit_before>#include \"TEnum.h\"\n#include \"TInterpreter.h\"\n\n#include \"gtest\/gtest.h\"\n#include \"gmock\/gmock.h\"\n\nTEST(TEnum, UnderlyingType)\n{\n gInterpreter->Declare(R\"CODE(\nenum E0 { kE0One };\nenum E1 { kE1One = LONG_MAX };\nenum E2 { kE2One = ULONG_MAX };\nenum E3: char { kE3One };\n\nenum Eb: bool { kEbOne };\nenum Euc: unsigned char { kEucOne };\nenum Esc: signed char { kEscOne };\nenum Eus: unsigned short { kEusOne };\nenum Ess: signed short { kEssOne };\nenum Eui: unsigned int { kEuiOne };\nenum Esi: signed int { kEsiOne };\nenum Eul: unsigned long { kEulOne };\nenum Esl: signed long { kEslOne };\nenum Eull: unsigned long long { kEullOne };\nenum Esll: signed long long { kEsllOne };\n\nenum Ecl: short;\n\nenum class ECb: bool { kOne };\nenum class ECuc: unsigned char { kOne };\nenum class ECsc: signed char { kOne };\nenum class ECus: unsigned short { kOne };\nenum class ECss: signed short { kOne };\nenum class ECui: unsigned int { kOne };\nenum class ECsi: signed int { kOne };\nenum class ECul: unsigned long { kOne };\nenum class ECsl: signed long { kOne };\nenum class ECull: unsigned long long { kOne };\nenum class ECsll: signed long long { kOne };\n\nenum class ECcl: short;\n)CODE\"\n\t\t\t);\n\n EXPECT_EQ(TEnum::GetEnum(\"E0\")->GetUnderlyingType(), kUInt_t);\n EXPECT_EQ(TEnum::GetEnum(\"E1\")->GetUnderlyingType(), kULong_t);\n EXPECT_EQ(TEnum::GetEnum(\"E2\")->GetUnderlyingType(), kULong_t);\n EXPECT_EQ(TEnum::GetEnum(\"E3\")->GetUnderlyingType(), kChar_t);\n\n EXPECT_EQ(TEnum::GetEnum(\"Eb\")->GetUnderlyingType(), kBool_t);\n EXPECT_EQ(TEnum::GetEnum(\"Euc\")->GetUnderlyingType(), kUChar_t);\n EXPECT_EQ(TEnum::GetEnum(\"Esc\")->GetUnderlyingType(), kChar_t);\n EXPECT_EQ(TEnum::GetEnum(\"Eus\")->GetUnderlyingType(), kUShort_t);\n EXPECT_EQ(TEnum::GetEnum(\"Ess\")->GetUnderlyingType(), kShort_t);\n EXPECT_EQ(TEnum::GetEnum(\"Eui\")->GetUnderlyingType(), kUInt_t);\n EXPECT_EQ(TEnum::GetEnum(\"Esi\")->GetUnderlyingType(), kInt_t);\n EXPECT_EQ(TEnum::GetEnum(\"Eul\")->GetUnderlyingType(), kULong_t);\n EXPECT_EQ(TEnum::GetEnum(\"Esl\")->GetUnderlyingType(), kLong_t);\n EXPECT_EQ(TEnum::GetEnum(\"Eull\")->GetUnderlyingType(), kULong64_t);\n EXPECT_EQ(TEnum::GetEnum(\"Esll\")->GetUnderlyingType(), kLong64_t);\n EXPECT_EQ(TEnum::GetEnum(\"Ecl\")->GetUnderlyingType(), kShort_t);\n}\n\n\nTEST(TEnum, Scoped)\n{\n gInterpreter->Declare(R\"CODE(\nenum class EC { kOne };\nenum class EC1: long { kOne };\nenum ED { kEDOne };\n)CODE\"\n\t\t\t);\n EXPECT_EQ(TEnum::GetEnum(\"EC\")->Property() & kIsScopedEnum, kIsScopedEnum);\n EXPECT_EQ(TEnum::GetEnum(\"EC1\")->Property() & kIsScopedEnum, kIsScopedEnum);\n EXPECT_EQ(TEnum::GetEnum(\"ED\")->Property() & kIsScopedEnum, 0);\n}\n<commit_msg>[meta] Fix testTEnum on 32bit:<commit_after>#include \"TEnum.h\"\n#include \"TInterpreter.h\"\n\n#include \"gtest\/gtest.h\"\n#include \"gmock\/gmock.h\"\n\n#include <type_traits>\n\nTEST(TEnum, UnderlyingType)\n{\n gInterpreter->Declare(R\"CODE(\nenum E0 { kE0One };\nenum E1 { kE1One = LONG_MAX };\nenum E2 { kE2One = ULONG_MAX };\nenum E3: char { kE3One };\n\nenum Eb: bool { kEbOne };\nenum Euc: unsigned char { kEucOne };\nenum Esc: signed char { kEscOne };\nenum Eus: unsigned short { kEusOne };\nenum Ess: signed short { kEssOne };\nenum Eui: unsigned int { kEuiOne };\nenum Esi: signed int { kEsiOne };\nenum Eul: unsigned long { kEulOne };\nenum Esl: signed long { kEslOne };\nenum Eull: unsigned long long { kEullOne };\nenum Esll: signed long long { kEsllOne };\n\nenum Ecl: short;\n\nenum class ECb: bool { kOne };\nenum class ECuc: unsigned char { kOne };\nenum class ECsc: signed char { kOne };\nenum class ECus: unsigned short { kOne };\nenum class ECss: signed short { kOne };\nenum class ECui: unsigned int { kOne };\nenum class ECsi: signed int { kOne };\nenum class ECul: unsigned long { kOne };\nenum class ECsl: signed long { kOne };\nenum class ECull: unsigned long long { kOne };\nenum class ECsll: signed long long { kOne };\n\nenum class ECcl: short;\n)CODE\"\n\t\t\t);\n\n enum E0 { kE0One };\n enum E1 { kE1One = LONG_MAX };\n enum E2 { kE2One = ULONG_MAX };\n\n EXPECT_EQ(TEnum::GetEnum(\"E0\")->GetUnderlyingType(), TDataType::GetType(typeid(std::underlying_type<E0>::type)));\n EXPECT_EQ(TEnum::GetEnum(\"E1\")->GetUnderlyingType(), TDataType::GetType(typeid(std::underlying_type<E1>::type)));\n EXPECT_EQ(TEnum::GetEnum(\"E2\")->GetUnderlyingType(), TDataType::GetType(typeid(std::underlying_type<E2>::type)));\n EXPECT_EQ(TEnum::GetEnum(\"E3\")->GetUnderlyingType(), kChar_t);\n\n EXPECT_EQ(TEnum::GetEnum(\"Eb\")->GetUnderlyingType(), kBool_t);\n EXPECT_EQ(TEnum::GetEnum(\"Euc\")->GetUnderlyingType(), kUChar_t);\n EXPECT_EQ(TEnum::GetEnum(\"Esc\")->GetUnderlyingType(), kChar_t);\n EXPECT_EQ(TEnum::GetEnum(\"Eus\")->GetUnderlyingType(), kUShort_t);\n EXPECT_EQ(TEnum::GetEnum(\"Ess\")->GetUnderlyingType(), kShort_t);\n EXPECT_EQ(TEnum::GetEnum(\"Eui\")->GetUnderlyingType(), kUInt_t);\n EXPECT_EQ(TEnum::GetEnum(\"Esi\")->GetUnderlyingType(), kInt_t);\n EXPECT_EQ(TEnum::GetEnum(\"Eul\")->GetUnderlyingType(), kULong_t);\n EXPECT_EQ(TEnum::GetEnum(\"Esl\")->GetUnderlyingType(), kLong_t);\n EXPECT_EQ(TEnum::GetEnum(\"Eull\")->GetUnderlyingType(), kULong64_t);\n EXPECT_EQ(TEnum::GetEnum(\"Esll\")->GetUnderlyingType(), kLong64_t);\n EXPECT_EQ(TEnum::GetEnum(\"Ecl\")->GetUnderlyingType(), kShort_t);\n}\n\n\nTEST(TEnum, Scoped)\n{\n gInterpreter->Declare(R\"CODE(\nenum class EC { kOne };\nenum class EC1: long { kOne };\nenum ED { kEDOne };\n)CODE\"\n\t\t\t);\n EXPECT_EQ(TEnum::GetEnum(\"EC\")->Property() & kIsScopedEnum, kIsScopedEnum);\n EXPECT_EQ(TEnum::GetEnum(\"EC1\")->Property() & kIsScopedEnum, kIsScopedEnum);\n EXPECT_EQ(TEnum::GetEnum(\"ED\")->Property() & kIsScopedEnum, 0);\n}\n<|endoftext|>"} {"text":"<commit_before>\/*\n * Copyright 2017 Root404, Co\n * Alvaro Stagg [alvarostagg@openmailbox.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 \"Cipher.h\"\n\n#include <iostream>\n#include <algorithm>\n\n#include <cryptopp\/hex.h>\n#include <cryptopp\/sha.h>\n\nCipher::Cipher(const std::string& key)\n{\n CryptoPP::SHA256 hash;\n unsigned char digest[CryptoPP::SHA256::DIGESTSIZE];\n\n hash.CalculateDigest(digest, (unsigned char*)key.c_str(), key.length());\n\n CryptoPP::HexEncoder encoder;\n encoder.Attach(new CryptoPP::StringSink(password));\n encoder.Put(digest, sizeof(digest));\n encoder.MessageEnd();\n std::transform(password.begin(), password.end(), password.begin(), ::tolower);\n\n key_length = password.length() - 1;\n key_index = 0;\n}\n\nint Cipher::Process(std::string fileName)\n{\n std::string new_file_name = fileName;\n size_t file_name_iter = new_file_name.find(\".crypted\");\n\n if (file_name_iter == std::string::npos)\n new_file_name += \".crypted\";\n else\n new_file_name.replace(file_name_iter, 8, \"\");\n\n int ret = 0;\n\n std::ifstream file(fileName, std::fstream::in);\n if (!file.is_open())\n {\n std::cerr << \"[*] unable to open \\\"\" << fileName << \"\\\" file. Omiting.\" << std::endl;\n return -1;\n }\n else\n {\n \/* I don't know if this is the best way to get the size\n * of an opened file. But certainly it's better than\n * open the same file twice at time.\n *\/\n std::ifstream::pos_type file_size = file.tellg();\n file.seekg(0, std::ios::end);\n file_size += file.tellg();\n file.seekg(0, std::ios::beg);\n\n if (file_size <= 0)\n {\n std::cerr << \"[*] unable to get \\\"\" << fileName << \"\\\" file size. Omiting.\" << std::endl;\n ret = -1;\n }\n else\n {\n long int blocks = 0;\n while (true)\n {\n long int start = (BLOCK_SIZE * blocks);\n long int end = start + BLOCK_SIZE;\n\n if (end > file_size)\n end = file_size;\n\n block_chunks.push_back(block_chunk{start, end});\n blocks++;\n\n if (start > file_size)\n break;\n }\n\n std::ofstream encoded_file(new_file_name, std::fstream::out);\n if (!encoded_file.is_open())\n {\n std::cerr << \"[*] unable to create \\\"\" << new_file_name << \"\\\" file for writing. Omiting.\" << std::endl;\n ret = -1;\n }\n else\n {\n long int data_counter = 0;\n std::vector<unsigned char> file_data;\n\n for (unsigned int i = 0; i < blocks; i++)\n {\n std::cout << \"\\r\" << fileName << \": Encoding block \" << i << \" of \" << blocks - 1 << std::flush;\n while (file >> std::noskipws >> a)\n {\n k = password[key_index];\n r = a ^ k;\n\n file_data.push_back(r);\n data_counter++;\n\n if ((data_counter + block_chunks[i].start) >= block_chunks[i].end)\n {\n key_index = data_counter = 0;\n for (auto& _bytes : file_data)\n encoded_file << _bytes;\n\n file_data.clear();\n break;\n }\n\n if (key_index >= key_length)\n key_index = 0;\n else\n key_index++;\n }\n }\n\n std::cout << \". Done.\" << std::endl;\n\n encoded_file.close();\n file.close();\n }\n }\n }\n\n return ret;\n}\n\nCipher::~Cipher()\n{\n if (block_chunks.size() != 0)\n block_chunks.clear();\n}\n<commit_msg>Using correct types<commit_after>\/*\n * Copyright 2017 Root404, Co\n * Alvaro Stagg [alvarostagg@openmailbox.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 \"Cipher.h\"\n\n#include <iostream>\n#include <algorithm>\n\n#include <cryptopp\/hex.h>\n#include <cryptopp\/sha.h>\n\nCipher::Cipher(const std::string& key)\n{\n CryptoPP::SHA256 hash;\n unsigned char digest[CryptoPP::SHA256::DIGESTSIZE];\n\n hash.CalculateDigest(digest, (unsigned char*)key.c_str(), key.length());\n\n CryptoPP::HexEncoder encoder;\n encoder.Attach(new CryptoPP::StringSink(password));\n encoder.Put(digest, sizeof(digest));\n encoder.MessageEnd();\n std::transform(password.begin(), password.end(), password.begin(), ::tolower);\n\n key_length = password.length() - 1;\n key_index = 0;\n}\n\nint Cipher::Process(std::string fileName)\n{\n std::string new_file_name = fileName;\n std::string::size_type file_name_iter = new_file_name.find(\".crypted\");\n\n if (file_name_iter == std::string::npos)\n new_file_name += \".crypted\";\n else\n new_file_name.replace(file_name_iter, 8, \"\");\n\n int ret = 0;\n\n std::ifstream file(fileName, std::fstream::in);\n if (!file.is_open())\n {\n std::cerr << \"[*] unable to open \\\"\" << fileName << \"\\\" file. Omiting.\" << std::endl;\n return -1;\n }\n else\n {\n \/* I don't know if this is the best way to get the size\n * of an opened file. But certainly it's better than\n * open the same file twice at time.\n *\/\n std::ifstream::pos_type file_size = file.tellg();\n file.seekg(0, std::ios::end);\n file_size += file.tellg();\n file.seekg(0, std::ios::beg);\n\n if (file_size <= 0)\n {\n std::cerr << \"[*] unable to get \\\"\" << fileName << \"\\\" file size. Omiting.\" << std::endl;\n ret = -1;\n }\n else\n {\n long int blocks = 0;\n while (true)\n {\n long int start = (BLOCK_SIZE * blocks);\n long int end = start + BLOCK_SIZE;\n\n if (end > file_size)\n end = file_size;\n\n block_chunks.push_back(block_chunk{start, end});\n blocks++;\n\n if (start > file_size)\n break;\n }\n\n std::ofstream encoded_file(new_file_name, std::fstream::out);\n if (!encoded_file.is_open())\n {\n std::cerr << \"[*] unable to create \\\"\" << new_file_name << \"\\\" file for writing. Omiting.\" << std::endl;\n ret = -1;\n }\n else\n {\n long int data_counter = 0;\n std::vector<unsigned char> file_data;\n\n for (unsigned int i = 0; i < blocks; i++)\n {\n std::cout << \"\\r\" << fileName << \": Encoding block \" << i << \" of \" << blocks - 1 << std::flush;\n while (file >> std::noskipws >> a)\n {\n k = password[key_index];\n r = a ^ k;\n\n file_data.push_back(r);\n data_counter++;\n\n if ((data_counter + block_chunks[i].start) >= block_chunks[i].end)\n {\n key_index = data_counter = 0;\n for (auto& _bytes : file_data)\n encoded_file << _bytes;\n\n file_data.clear();\n break;\n }\n\n if (key_index >= key_length)\n key_index = 0;\n else\n key_index++;\n }\n }\n\n std::cout << \". Done.\" << std::endl;\n\n encoded_file.close();\n file.close();\n }\n }\n }\n\n return ret;\n}\n\nCipher::~Cipher()\n{\n if (block_chunks.size() != 0)\n block_chunks.clear();\n}\n<|endoftext|>"} {"text":"<commit_before><commit_msg>EQ_ANA_BNDY_0..26 ringId support<commit_after><|endoftext|>"} {"text":"<commit_before><commit_msg>fuchsia: Suspend process before manipulating it<commit_after><|endoftext|>"} {"text":"<commit_before>#include \"Drawer.h\"\n\n#include <FL\/fl_draw.H>\n\nDrawer::Drawer()\n{\n _iconImage = new Fl_PNG_Image(\"\/tmp\/nodes.png\");\n}\n\nDrawer::~Drawer()\n{\n delete _iconImage;\n}\n\nvoid Drawer::setColor(int red, int green, int blue) const\n{\n fl_color(red, green, blue);\n}\n\nvoid Drawer::setOrigin(const Point& origin)\n{\n _origin = origin;\n}\n\nvoid Drawer::drawLine(const Point& source, const Point& target) const\n{\n Point p1 = _origin + source;\n Point p2 = _origin + target;\n fl_line(p1.getX(), p1.getY(), p2.getX(), p2.getY());\n}\n\nvoid Drawer::drawEdge(const Point& source, const Point& target) const\n{\n \/\/ TODO: Determine the type of the curve!\n drawStepCurve(source, target);\n}\n\nvoid Drawer::drawStepCurve(const Point& source, const Point& target) const\n{\n double middleX = (source.getX() + target.getX()) \/ 2;\n Point sourceSidePoint(middleX, source.getY());\n Point targetSidePoint(middleX, target.getY());\n drawLine(source, sourceSidePoint);\n drawLine(sourceSidePoint, targetSidePoint);\n drawLine(targetSidePoint, target);\n}\n\nvoid Drawer::drawZigzagCurve(const Point& source, const Point& target) const\n{\n}\n\nvoid Drawer::drawShoeCurve(const Point& source, const Point& target) const\n{\n}\n\nvoid Drawer::drawRectangle(const Point& position, int width, int height) const\n{\n Point p = _origin + position;\n fl_rect(p.getX(), p.getY(), width, height);\n}\n\nvoid Drawer::fillRectangle(const Point& position, int width, int height) const\n{\n Point p = _origin + position;\n fl_rectf(p.getX(), p.getY(), width, height);\n}\n\nvoid Drawer::drawCircle(const Point& position, int radius) const\n{\n Point p = _origin + position;\n int diameter = 2 * radius;\n fl_arc(p.getX() - radius, p.getY() - radius, diameter, diameter, 0, 360); \n}\n\nvoid Drawer::drawIconImage(const Point& position) const\n{\n Point p = _origin + position;\n _iconImage->draw(p.getX(), p.getY());\n}\n\nvoid Drawer::drawIcon(int index, const Point& position) const\n{\n Point p = _origin + position;\n _iconImage->draw(p.getX(), p.getY(), 32, 32, index * 32, 0);\n}\n\nvoid Drawer::drawText(const std::string& text, const Point& position) const\n{\n Point p = _origin + position;\n fl_draw(text.c_str(), p.getX(), p.getY());\n}\n\n<commit_msg>Shoe-like edge drawing<commit_after>#include \"Drawer.h\"\n\n#include <FL\/fl_draw.H>\n\n#include <vector>\n\nDrawer::Drawer()\n{\n _iconImage = new Fl_PNG_Image(\"\/tmp\/nodes.png\");\n}\n\nDrawer::~Drawer()\n{\n delete _iconImage;\n}\n\nvoid Drawer::setColor(int red, int green, int blue) const\n{\n fl_color(red, green, blue);\n}\n\nvoid Drawer::setOrigin(const Point& origin)\n{\n _origin = origin;\n}\n\nvoid Drawer::drawLine(const Point& source, const Point& target) const\n{\n Point p1 = _origin + source;\n Point p2 = _origin + target;\n fl_line(p1.getX(), p1.getY(), p2.getX(), p2.getY());\n}\n\nvoid Drawer::drawEdge(const Point& source, const Point& target) const\n{\n \/\/ TODO: Determine the type of the curve!\n \/\/ drawStepCurve(source, target);\n drawShoeCurve(source, target);\n}\n\nvoid Drawer::drawStepCurve(const Point& source, const Point& target) const\n{\n int middleX = (source.getX() + target.getX()) \/ 2;\n Point sourceSidePoint(middleX, source.getY());\n Point targetSidePoint(middleX, target.getY());\n drawLine(source, sourceSidePoint);\n drawLine(sourceSidePoint, targetSidePoint);\n drawLine(targetSidePoint, target);\n}\n\nvoid Drawer::drawZigzagCurve(const Point& source, const Point& target) const\n{\n}\n\nvoid Drawer::drawShoeCurve(const Point& source, const Point& target) const\n{\n int sourceSideX = source.getX() + 32;\n int targetSideX = target.getX() - 32;\n int supportY = target.getY();\n if (source.getY() < target.getY()) {\n supportY += 32;\n }\n else {\n supportY -= 32;\n }\n std::vector<Point> points;\n points.push_back(source);\n points.push_back(Point(sourceSideX, source.getY()));\n points.push_back(Point(sourceSideX, supportY));\n points.push_back(Point(targetSideX, supportY));\n points.push_back(Point(targetSideX, target.getY()));\n points.push_back(target);\n for (unsigned int i = 0; i < points.size() - 1; ++i) {\n drawLine(points[i], points[i + 1]);\n }\n}\n\nvoid Drawer::drawRectangle(const Point& position, int width, int height) const\n{\n Point p = _origin + position;\n fl_rect(p.getX(), p.getY(), width, height);\n}\n\nvoid Drawer::fillRectangle(const Point& position, int width, int height) const\n{\n Point p = _origin + position;\n fl_rectf(p.getX(), p.getY(), width, height);\n}\n\nvoid Drawer::drawCircle(const Point& position, int radius) const\n{\n Point p = _origin + position;\n int diameter = 2 * radius;\n fl_arc(p.getX() - radius, p.getY() - radius, diameter, diameter, 0, 360); \n}\n\nvoid Drawer::drawIconImage(const Point& position) const\n{\n Point p = _origin + position;\n _iconImage->draw(p.getX(), p.getY());\n}\n\nvoid Drawer::drawIcon(int index, const Point& position) const\n{\n Point p = _origin + position;\n _iconImage->draw(p.getX(), p.getY(), 32, 32, index * 32, 0);\n}\n\nvoid Drawer::drawText(const std::string& text, const Point& position) const\n{\n Point p = _origin + position;\n fl_draw(text.c_str(), p.getX(), p.getY());\n}\n\n<|endoftext|>"} {"text":"<commit_before>\/**\n * \\file Geodesic.hpp\n * \\brief Header for GeographicLib::Geodesic class\n *\n * Copyright (c) Charles Karney (2008, 2009) <charles@karney.com>\n * and licensed under the LGPL. For more information, see\n * http:\/\/charles.karney.info\/geographic\/\n **********************************************************************\/\n\n#if !defined(GEODESIC_HPP)\n#define GEODESIC_HPP \"$Id$\"\n\n#if !defined(GEOD_TAU_ORD)\n\/**\n * The order of the series relating \\e s and \\e sigma when expanded in powers\n * of \\e u<sup>2<\/sup> = e'<sup>2<\/sup> cos<sup>2<\/sup> alpha<sub>0<\/sub>.\n **********************************************************************\/\n#define GEOD_TAU_ORD 6\n#endif\n\n#if !defined(GEOD_ETA_ORD)\n\/**\n * The order of the series relating \\e lambda and \\e eta when expanded in\n * powers of \\e f. Typically, this can be one less that GEOD_TAU_ORD because\n * the convergence of the series is more rapid when \\e f is used as the\n * expansion parameter (Rainsford 1955).\n **********************************************************************\/\n#define GEOD_ETA_ORD 5\n#endif\n\n#include <cmath>\n\nnamespace GeographicLib {\n\n class GeodesicLine;\n\n \/**\n * \\brief %Geodesic calculations\n *\n * The shortest path between two points on a spheroid at (\\e lat1, \\e lon1)\n * and (\\e lat2, \\e lon2) is called the geodesic. Its length is \\e s12 and\n * the geodesic from point 1 to point 2 has azimuths \\e azi1 and \\e azi2 at\n * the two end points. (The azimuth is the heading measured clockwise from\n * north. \\e azi2 is the \"forward\" azimuth, i.e., the heading that takes you\n * beyond point 2 not back to point 1.)\n *\n * Given \\e lat1, \\e lon1, \\e azi1, and \\e s12, we can determine \\e lat2, \\e\n * lon2, \\e azi2. This is the \\e direct geodesic problem. (If \\e s12 is\n * sufficiently large that the geodesic wraps more than halfway around the\n * earth, there will be another geodesic between the points with a smaller \\e\n * s12.)\n *\n * Given \\e lat1, \\e lon1, \\e lat2, and \\e lon2, we can determine \\e azi1, \\e\n * azi2, \\e s12. This is the \\e inverse geodesic problem. Usually, the\n * solution to the inverse problem is unique. In cases where there are\n * muliple solutions (all with the same \\e s12, of course), all the solutions\n * can be easily generated once a particular solution is provided.\n *\n * As an alternative to using distance to measure \\e s12, the class can also\n * use the arc length (in degrees) on the auxiliary sphere. This is a\n * mathematical construct used in solving the geodesic problems. However, an\n * arc length in excess of 180<sup>o<\/sup> indicates that the geodesic is not\n * a shortest path. In addition, the arc length between an equatorial\n * crossing and the next extremum of latitude for a geodesic is\n * 90<sup>o<\/sup>.\n *\n * The calculations are accurate to better than 12 nm. (See \\ref geoderrors\n * for details.)\n **********************************************************************\/\n\n class Geodesic {\n private:\n friend class GeodesicLine;\n static const int tauord = GEOD_TAU_ORD;\n static const int ntau = tauord;\n static const int nsig = tauord;\n static const int etaord = GEOD_TAU_ORD;\n \/\/ etaCoeff is multiplied by etaFactor which is O(f), so we reduce the\n \/\/ order to which etaCoeff is computed by 1.\n static const int neta = etaord > 0 ? etaord - 1 : 0;\n static const unsigned maxit = 50;\n\n static inline double sq(double x) throw() { return x * x; }\n#if defined(_MSC_VER)\n static inline double hypot(double x, double y) throw()\n { return _hypot(x, y); }\n static inline double cbrt(double x) throw() {\n double y = std::pow(std::abs(x), 1\/3.0);\n return x < 0 ? -y : y;\n }\n#else\n static inline double hypot(double x, double y) throw()\n { return ::hypot(x, y); }\n static inline double cbrt(double x) throw() { return ::cbrt(x); }\n#endif\n void InverseStart(double sbet1, double cbet1, double n1,\n\t\t double sbet2, double cbet2,\n\t\t double lam12, double slam12, double clam12,\n\t\t double& salp1, double& calp1, double c[]) const throw();\n double Lambda12(double sbet1, double cbet1, double sbet2, double cbet2,\n\t\t double salp1, double calp1,\n\t\t double& salp2, double& calp2,\n\t\t double& sig12,\n\t\t double& ssig1, double& csig1, double& ssig2, double& csig2,\n\t\t double& u2, bool diffp, double& dlam12, double c[])\n const throw();\n\n static const double eps2, tol0, tol1, tol2, xthresh;\n const double _a, _f, _f1, _e2, _ep2, _b;\n static double SinSeries(double sinx, double cosx, const double c[], int n)\n throw();\n static inline double AngNormalize(double x) throw() {\n \/\/ Place angle in [-180, 180). Assumes x is in [-540, 540).\n return x >= 180 ? x - 360 : x < -180 ? x + 360 : x;\n }\n static inline double AngRound(double x) throw() {\n \/\/ The makes the smallest gap in x = 1\/16 - nextafter(1\/16, 0) = 1\/2^57\n \/\/ for doubles = 0.7 pm on the earth if x is an angle in degrees. (This\n \/\/ is about 1000 times more resolution than we get with angles around 90\n \/\/ degrees.) We use this to avoid having to deal with near singular\n \/\/ cases when x is non-zero but tiny (e.g., 1.0e-200).\n const double z = 0.0625;\t\/\/ 1\/16\n double y = std::abs(x);\n \/\/ The compiler mustn't \"simplify\" z - (z - y) to y\n y = y < z ? z - (z - y) : y;\n return x < 0 ? -y : y;\n }\n static inline void SinCosNorm(double& sinx, double& cosx) throw() {\n double r = hypot(sinx, cosx);\n sinx \/= r;\n cosx \/= r;\n }\n\n \/\/ These are maxima generated functions to provide series approximations to\n \/\/ the integrals for the spheroidal geodesic.\n static double tauFactor(double u2) throw();\n static void tauCoeff(double u2, double t[]) throw();\n static void sigCoeff(double u2, double tp[]) throw();\n static double etaFactor(double f, double mu) throw();\n static void etaCoeff(double f, double mu, double h[]) throw();\n static double etaFactormu(double f, double mu) throw();\n static void etaCoeffmu(double f, double mu, double hp[]) throw();\n\n public:\n\n \/**\n * Constructor for a spheroid with equatorial radius \\e a (meters) and\n * reciprocal flattening \\e r. Setting \\e r = 0 implies \\e r = inf or\n * flattening = 0 (i.e., a sphere). Negative \\e r indicates a prolate\n * spheroid.\n **********************************************************************\/\n Geodesic(double a, double r) throw();\n\n \/**\n * Perform the direct geodesic calculation. Given a latitude, \\e lat1,\n * longitude, \\e lon1, and azimuth \\e azi1 (in degrees) for point 1 and a\n * range, \\e s12 (in meters) from point 1 to point 2, return the latitude,\n * \\e lat2, longitude, \\e lon2, and forward azimuth, \\e azi2 (in degrees)\n * for point 2. If \\e arcmode (default false) is set to true, \\e s12 is\n * interpreted as the arc length (in degrees) on the auxiliary sphere. An\n * arc length greater that 180 degrees results in a geodesic which is not a\n * shortest path. For a prolate spheroid, an additional condition is\n * necessary for a shortest path: the longitudinal extent must not exceed\n * of 180 degrees. Returned value is the arc length (in degrees).\n **********************************************************************\/\n double Direct(double lat1, double lon1, double azi1, double s12,\n\t\t double& lat2, double& lon2, double& azi2,\n\t\t bool arcmode = false) const throw();\n\n \/**\n * Perform the inverse geodesic calculation. Given a latitude, \\e lat1,\n * longitude, \\e lon1, for point 1 and a latitude, \\e lat2, longitude, \\e\n * lon2, for point 2 (all in degrees), return the geodesic distance, \\e s12\n * (in meters), and the forward azimuths, \\e azi1 and \\e azi2 (in degrees),\n * at points 1 and 2. Returned value is the arc length (in degrees) on the\n * auxiliary sphere. The routine uses an iterative method. If the method\n * fails to converge, the negative of the distances (\\e s12 and the\n * function value) and reverse of the azimuths are returned. This is not\n * expected to happen with spheroidal models of the earth. Please report\n * all cases where this occurs.\n **********************************************************************\/\n double Inverse(double lat1, double lon1, double lat2, double lon2,\n\t\t double& s12, double& azi1, double& azi2) const throw();\n\n \/**\n * Set up to do a series of ranges. This returns a GeodesicLine object\n * with point 1 given by latitude, \\e lat1, longitude, \\e lon1, and azimuth\n * \\e azi1 (in degrees). Calls to GeodesicLine::Position return the\n * position and azimuth for point 2 a specified distance away. Using\n * GeodesicLine::Position is approximately 2.1 faster than calling\n * Geodesic::Direct.\n **********************************************************************\/\n GeodesicLine Line(double lat1, double lon1, double azi1) const throw();\n\n \/**\n * A global instantiation of Geodesic with the parameters for the WGS84\n * ellipsoid.\n **********************************************************************\/\n const static Geodesic WGS84;\n };\n\n \/**\n * \\brief A geodesic line.\n *\n * GeodesicLine facilitates the determination of a series of points on a\n * single geodesic. Geodesic.Line returns a GeodesicLine object with the\n * geodesic defined by by \\e lat1, \\e lon1, and \\e azi1.\n * GeodesicLine.Position returns the \\e lat2, \\e lon2, and \\e azi2 given \\e\n * s12. An example of use of this class is:\n \\verbatim\n \/\/ Print positions on a geodesic going through latitude 30,\n \/\/ longitude 10 at azimuth 80. Points at intervals of 10km\n \/\/ in the range [-1000km, 1000km] are given.\n GeodesicLine line(Geodesic::WGS84.Line(30.0, 10.0, 80.0));\n double step = 10e3;\n for (int s = -100; s <= 100; ++s) {\n double lat2, lon2, azi2;\n double s12 = s * step;\n line.Position(s12, lat2, lon2, azi2);\n cout << s12 << \" \" << lat2 << \" \" << lon2 << \" \" << azi2 << \"\\n\";\n }\n \\endverbatim\n * The default copy constructor and assignment operators work with this\n * class, so that, for example, the previous example could start\n \\verbatim\n GeodesicLine line;\n line = Geodesic::WGS84.Line(30.0, 10.0, 80.0);\n ...\n \\endverbatim\n * Similarly, a vector can be used to hold GeodesicLine objects.\n *\n * The calculations are accurate to better than 12 nm. (See \\ref geoderrors\n * for details.)\n **********************************************************************\/\n\n class GeodesicLine {\n private:\n friend class Geodesic;\n static const int ntau = Geodesic::ntau;\n static const int nsig = Geodesic::nsig;\n static const int neta = Geodesic::neta;\n\n double _lat1, _lon1, _azi1;\n double _f1, _salp0, _calp0,\n _ssig1, _csig1, _stau1, _ctau1, _schi1, _cchi1,\n _sScale, _etaFactor, _dtau1, _dlam1;\n double _sigCoeff[ntau > nsig ? (ntau ? ntau : 1) : (nsig ? nsig : 1)],\n _etaCoeff[neta ? neta : 1];\n\n GeodesicLine(const Geodesic& g, double lat1, double lon1, double azi1)\n throw();\n void ArcPosition(double sig12, double ssig12, double csig12,\n\t\t double& lat2, double& lon2, double& azi2) const throw();\n public:\n\n \/**\n * A default constructor. If GeodesicLine::Position is called on the\n * resulting object, it returns immediately (without doing any\n * calculations). The object should be set with a call to Geodesic::Line.\n * Use Init() to test whether object is still in this uninitialized state.\n **********************************************************************\/\n GeodesicLine() throw() : _sScale(0) {};\n\n \/**\n * Return the latitude, \\e lat2, longitude, \\e lon2, and forward azimuth,\n * \\e azi2 (in degrees) of the point 2 which is a distance, \\e s12 (in\n * meters), from point 1. \\e s12 can be signed. If \\e arcmode (default\n * false) is set to true, \\e s12 is interpreted as the arc length (in\n * degrees) on the auxiliary sphere; this speeds up the calculation by a\n * factor of 1.6. Returned value is the arc length (in degrees).\n **********************************************************************\/\n double Position(double s12, double& lat2, double& lon2, double& azi2,\n\t\t bool arcmode = false)\n const throw();\n\n \/**\n * Has this object been initialize so that Position can be called?\n **********************************************************************\/\n bool Init() const throw() { return _sScale > 0; }\n\n \/**\n * Return the latitude of point 1 (in degrees).\n **********************************************************************\/\n double Latitude() const throw() { return _lat1; }\n\n \/**\n * Return the longitude of point 1 (in degrees).\n **********************************************************************\/\n double Longitude() const throw() { return _lon1; }\n\n \/**\n * Return the azimuth of the geodesic line as it passes through point 1.\n **********************************************************************\/\n double Azimuth() const throw() { return _azi1; }\n };\n\n} \/\/namespace GeographicLib\n#endif\n<commit_msg>Get ready for release<commit_after>\/**\n * \\file Geodesic.hpp\n * \\brief Header for GeographicLib::Geodesic class\n *\n * Copyright (c) Charles Karney (2008, 2009) <charles@karney.com>\n * and licensed under the LGPL. For more information, see\n * http:\/\/charles.karney.info\/geographic\/\n **********************************************************************\/\n\n#if !defined(GEODESIC_HPP)\n#define GEODESIC_HPP \"$Id$\"\n\n#if !defined(GEOD_TAU_ORD)\n\/**\n * The order of the series relating \\e s and \\e sigma when expanded in powers\n * of \\e u<sup>2<\/sup> = e'<sup>2<\/sup> cos<sup>2<\/sup> alpha<sub>0<\/sub>.\n **********************************************************************\/\n#define GEOD_TAU_ORD 6\n#endif\n\n#if !defined(GEOD_ETA_ORD)\n\/**\n * The order of the series relating \\e lambda and \\e eta when expanded in\n * powers of \\e f. Typically, this can be one less that GEOD_TAU_ORD because\n * the convergence of the series is more rapid when \\e f is used as the\n * expansion parameter (Rainsford 1955).\n **********************************************************************\/\n#define GEOD_ETA_ORD 5\n#endif\n\n#include <cmath>\n\nnamespace GeographicLib {\n\n class GeodesicLine;\n\n \/**\n * \\brief %Geodesic calculations\n *\n * The shortest path between two points on a spheroid at (\\e lat1, \\e lon1)\n * and (\\e lat2, \\e lon2) is called the geodesic. Its length is \\e s12 and\n * the geodesic from point 1 to point 2 has azimuths \\e azi1 and \\e azi2 at\n * the two end points. (The azimuth is the heading measured clockwise from\n * north. \\e azi2 is the \"forward\" azimuth, i.e., the heading that takes you\n * beyond point 2 not back to point 1.)\n *\n * Given \\e lat1, \\e lon1, \\e azi1, and \\e s12, we can determine \\e lat2, \\e\n * lon2, \\e azi2. This is the \\e direct geodesic problem. (If \\e s12 is\n * sufficiently large that the geodesic wraps more than halfway around the\n * earth, there will be another geodesic between the points with a smaller \\e\n * s12.)\n *\n * Given \\e lat1, \\e lon1, \\e lat2, and \\e lon2, we can determine \\e azi1, \\e\n * azi2, \\e s12. This is the \\e inverse geodesic problem. Usually, the\n * solution to the inverse problem is unique. In cases where there are\n * muliple solutions (all with the same \\e s12, of course), all the solutions\n * can be easily generated once a particular solution is provided.\n *\n * As an alternative to using distance to measure \\e s12, the class can also\n * use the arc length (in degrees) on the auxiliary sphere. This is a\n * mathematical construct used in solving the geodesic problems. However, an\n * arc length in excess of 180<sup>o<\/sup> indicates that the geodesic is not\n * a shortest path. In addition, the arc length between an equatorial\n * crossing and the next extremum of latitude for a geodesic is\n * 90<sup>o<\/sup>.\n *\n * The calculations are accurate to better than 15 nm. (See \\ref geoderrors\n * for details.)\n **********************************************************************\/\n\n class Geodesic {\n private:\n friend class GeodesicLine;\n static const int tauord = GEOD_TAU_ORD;\n static const int ntau = tauord;\n static const int nsig = tauord;\n static const int etaord = GEOD_TAU_ORD;\n \/\/ etaCoeff is multiplied by etaFactor which is O(f), so we reduce the\n \/\/ order to which etaCoeff is computed by 1.\n static const int neta = etaord > 0 ? etaord - 1 : 0;\n static const unsigned maxit = 50;\n\n static inline double sq(double x) throw() { return x * x; }\n#if defined(_MSC_VER)\n static inline double hypot(double x, double y) throw()\n { return _hypot(x, y); }\n static inline double cbrt(double x) throw() {\n double y = std::pow(std::abs(x), 1\/3.0);\n return x < 0 ? -y : y;\n }\n#else\n static inline double hypot(double x, double y) throw()\n { return ::hypot(x, y); }\n static inline double cbrt(double x) throw() { return ::cbrt(x); }\n#endif\n void InverseStart(double sbet1, double cbet1, double n1,\n\t\t double sbet2, double cbet2,\n\t\t double lam12, double slam12, double clam12,\n\t\t double& salp1, double& calp1, double c[]) const throw();\n double Lambda12(double sbet1, double cbet1, double sbet2, double cbet2,\n\t\t double salp1, double calp1,\n\t\t double& salp2, double& calp2,\n\t\t double& sig12,\n\t\t double& ssig1, double& csig1, double& ssig2, double& csig2,\n\t\t double& u2, bool diffp, double& dlam12, double c[])\n const throw();\n\n static const double eps2, tol0, tol1, tol2, xthresh;\n const double _a, _f, _f1, _e2, _ep2, _b;\n static double SinSeries(double sinx, double cosx, const double c[], int n)\n throw();\n static inline double AngNormalize(double x) throw() {\n \/\/ Place angle in [-180, 180). Assumes x is in [-540, 540).\n return x >= 180 ? x - 360 : x < -180 ? x + 360 : x;\n }\n static inline double AngRound(double x) throw() {\n \/\/ The makes the smallest gap in x = 1\/16 - nextafter(1\/16, 0) = 1\/2^57\n \/\/ for doubles = 0.7 pm on the earth if x is an angle in degrees. (This\n \/\/ is about 1000 times more resolution than we get with angles around 90\n \/\/ degrees.) We use this to avoid having to deal with near singular\n \/\/ cases when x is non-zero but tiny (e.g., 1.0e-200).\n const double z = 0.0625;\t\/\/ 1\/16\n double y = std::abs(x);\n \/\/ The compiler mustn't \"simplify\" z - (z - y) to y\n y = y < z ? z - (z - y) : y;\n return x < 0 ? -y : y;\n }\n static inline void SinCosNorm(double& sinx, double& cosx) throw() {\n double r = hypot(sinx, cosx);\n sinx \/= r;\n cosx \/= r;\n }\n\n \/\/ These are maxima generated functions to provide series approximations to\n \/\/ the integrals for the spheroidal geodesic.\n static double tauFactor(double u2) throw();\n static void tauCoeff(double u2, double t[]) throw();\n static void sigCoeff(double u2, double tp[]) throw();\n static double etaFactor(double f, double mu) throw();\n static void etaCoeff(double f, double mu, double h[]) throw();\n static double etaFactormu(double f, double mu) throw();\n static void etaCoeffmu(double f, double mu, double hp[]) throw();\n\n public:\n\n \/**\n * Constructor for a spheroid with equatorial radius \\e a (meters) and\n * reciprocal flattening \\e r. Setting \\e r = 0 implies \\e r = inf or\n * flattening = 0 (i.e., a sphere). Negative \\e r indicates a prolate\n * spheroid.\n **********************************************************************\/\n Geodesic(double a, double r) throw();\n\n \/**\n * Perform the direct geodesic calculation. Given a latitude, \\e lat1,\n * longitude, \\e lon1, and azimuth \\e azi1 (in degrees) for point 1 and a\n * range, \\e s12 (in meters) from point 1 to point 2, return the latitude,\n * \\e lat2, longitude, \\e lon2, and forward azimuth, \\e azi2 (in degrees)\n * for point 2. If \\e arcmode (default false) is set to true, \\e s12 is\n * interpreted as the arc length (in degrees) on the auxiliary sphere. An\n * arc length greater that 180 degrees results in a geodesic which is not a\n * shortest path. For a prolate spheroid, an additional condition is\n * necessary for a shortest path: the longitudinal extent must not exceed\n * of 180 degrees. Returned value is the arc length (in degrees).\n **********************************************************************\/\n double Direct(double lat1, double lon1, double azi1, double s12,\n\t\t double& lat2, double& lon2, double& azi2,\n\t\t bool arcmode = false) const throw();\n\n \/**\n * Perform the inverse geodesic calculation. Given a latitude, \\e lat1,\n * longitude, \\e lon1, for point 1 and a latitude, \\e lat2, longitude, \\e\n * lon2, for point 2 (all in degrees), return the geodesic distance, \\e s12\n * (in meters), and the forward azimuths, \\e azi1 and \\e azi2 (in degrees),\n * at points 1 and 2. Returned value is the arc length (in degrees) on the\n * auxiliary sphere. The routine uses an iterative method. If the method\n * fails to converge, the negative of the distances (\\e s12 and the\n * function value) and reverse of the azimuths are returned. This is not\n * expected to happen with spheroidal models of the earth. Please report\n * all cases where this occurs.\n **********************************************************************\/\n double Inverse(double lat1, double lon1, double lat2, double lon2,\n\t\t double& s12, double& azi1, double& azi2) const throw();\n\n \/**\n * Set up to do a series of ranges. This returns a GeodesicLine object\n * with point 1 given by latitude, \\e lat1, longitude, \\e lon1, and azimuth\n * \\e azi1 (in degrees). Calls to GeodesicLine::Position return the\n * position and azimuth for point 2 a specified distance away. Using\n * GeodesicLine::Position is approximately 2.1 faster than calling\n * Geodesic::Direct.\n **********************************************************************\/\n GeodesicLine Line(double lat1, double lon1, double azi1) const throw();\n\n \/**\n * A global instantiation of Geodesic with the parameters for the WGS84\n * ellipsoid.\n **********************************************************************\/\n const static Geodesic WGS84;\n };\n\n \/**\n * \\brief A geodesic line.\n *\n * GeodesicLine facilitates the determination of a series of points on a\n * single geodesic. Geodesic.Line returns a GeodesicLine object with the\n * geodesic defined by by \\e lat1, \\e lon1, and \\e azi1.\n * GeodesicLine.Position returns the \\e lat2, \\e lon2, and \\e azi2 given \\e\n * s12. An example of use of this class is:\n \\verbatim\n \/\/ Print positions on a geodesic going through latitude 30,\n \/\/ longitude 10 at azimuth 80. Points at intervals of 10km\n \/\/ in the range [-1000km, 1000km] are given.\n GeodesicLine line(Geodesic::WGS84.Line(30.0, 10.0, 80.0));\n double step = 10e3;\n for (int s = -100; s <= 100; ++s) {\n double lat2, lon2, azi2;\n double s12 = s * step;\n line.Position(s12, lat2, lon2, azi2);\n cout << s12 << \" \" << lat2 << \" \" << lon2 << \" \" << azi2 << \"\\n\";\n }\n \\endverbatim\n * The default copy constructor and assignment operators work with this\n * class, so that, for example, the previous example could start\n \\verbatim\n GeodesicLine line;\n line = Geodesic::WGS84.Line(30.0, 10.0, 80.0);\n ...\n \\endverbatim\n * Similarly, a vector can be used to hold GeodesicLine objects.\n *\n * The calculations are accurate to better than 12 nm. (See \\ref geoderrors\n * for details.)\n **********************************************************************\/\n\n class GeodesicLine {\n private:\n friend class Geodesic;\n static const int ntau = Geodesic::ntau;\n static const int nsig = Geodesic::nsig;\n static const int neta = Geodesic::neta;\n\n double _lat1, _lon1, _azi1;\n double _f1, _salp0, _calp0,\n _ssig1, _csig1, _stau1, _ctau1, _schi1, _cchi1,\n _sScale, _etaFactor, _dtau1, _dlam1;\n double _sigCoeff[ntau > nsig ? (ntau ? ntau : 1) : (nsig ? nsig : 1)],\n _etaCoeff[neta ? neta : 1];\n\n GeodesicLine(const Geodesic& g, double lat1, double lon1, double azi1)\n throw();\n void ArcPosition(double sig12, double ssig12, double csig12,\n\t\t double& lat2, double& lon2, double& azi2) const throw();\n public:\n\n \/**\n * A default constructor. If GeodesicLine::Position is called on the\n * resulting object, it returns immediately (without doing any\n * calculations). The object should be set with a call to Geodesic::Line.\n * Use Init() to test whether object is still in this uninitialized state.\n **********************************************************************\/\n GeodesicLine() throw() : _sScale(0) {};\n\n \/**\n * Return the latitude, \\e lat2, longitude, \\e lon2, and forward azimuth,\n * \\e azi2 (in degrees) of the point 2 which is a distance, \\e s12 (in\n * meters), from point 1. \\e s12 can be signed. If \\e arcmode (default\n * false) is set to true, \\e s12 is interpreted as the arc length (in\n * degrees) on the auxiliary sphere; this speeds up the calculation by a\n * factor of 1.6. Returned value is the arc length (in degrees).\n **********************************************************************\/\n double Position(double s12, double& lat2, double& lon2, double& azi2,\n\t\t bool arcmode = false)\n const throw();\n\n \/**\n * Has this object been initialize so that Position can be called?\n **********************************************************************\/\n bool Init() const throw() { return _sScale > 0; }\n\n \/**\n * Return the latitude of point 1 (in degrees).\n **********************************************************************\/\n double Latitude() const throw() { return _lat1; }\n\n \/**\n * Return the longitude of point 1 (in degrees).\n **********************************************************************\/\n double Longitude() const throw() { return _lon1; }\n\n \/**\n * Return the azimuth of the geodesic line as it passes through point 1.\n **********************************************************************\/\n double Azimuth() const throw() { return _azi1; }\n };\n\n} \/\/namespace GeographicLib\n#endif\n<|endoftext|>"} {"text":"<commit_before>\/*\r\nGpuRamDrive proxy for ImDisk Virtual Disk Driver.\r\n\r\nCopyright (C) 2016 Syahmi Azhar.\r\n\r\nPermission is hereby granted, free of charge, to any person\r\nobtaining a copy of this software and associated documentation\r\nfiles (the \"Software\"), to deal in the Software without\r\nrestriction, including without limitation the rights to use,\r\ncopy, modify, merge, publish, distribute, sublicense, and\/or\r\nsell copies of the Software, and to permit persons to whom the\r\nSoftware is furnished to do so, subject to the following\r\nconditions:\r\n\r\nThe above copyright notice and this permission notice shall be\r\nincluded in all copies or substantial portions of the Software.\r\n\r\nTHE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND,\r\nEXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES\r\nOF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND\r\nNONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT\r\nHOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY,\r\nWHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING\r\nFROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR\r\nOTHER DEALINGS IN THE SOFTWARE.\r\n*\/\r\n\r\n#include \"stdafx.h\"\r\n#include \"GpuRamDrive.h\"\r\n#include \"GpuRamGui.h\"\r\n\r\nconst wchar_t GPU_HELP_STRING[] = L\"Usage:\\n\"\r\n\" GpuRamDrive.exe --device CUDA --size 256 --mount j:\\n\"\r\n\"\\n\"\r\n\"Options:\\n\"\r\n\" --device <Device Name> Search string for GPU device\\n\"\r\n\" --size <Size in MB> Size to be allocated for ram drive\\n\"\r\n\" --mount <Drive letter> Mount drive\\n\"\r\n\" --format <Parameters> Format and pass parameters to Windows' format\\n\"\r\n\" --hide Hide GUI to tray\\n\"\r\n\" --help Show this help\\n\";\r\n\r\n\r\nint APIENTRY wWinMain(\r\n\t_In_ HINSTANCE hInstance,\r\n\t_In_opt_ HINSTANCE hPrevInstance,\r\n\t_In_ LPWSTR lpCmdLine,\r\n\t_In_ int nCmdShow)\r\n{\r\n\tGpuRamGui gui;\r\n\r\n\tLPWSTR *szArglist;\r\n\tint nArgs;\r\n\tszArglist = CommandLineToArgvW(GetCommandLineW(), &nArgs);\r\n\r\n\tLPWSTR GpuDevice = nullptr;\r\n\tsize_t GpuSize = 0;\r\n\tLPWSTR GpuDriveLetter = nullptr;\r\n\tLPWSTR GpuFormatParam = L\"\";\r\n\tbool GpuMount = false;\r\n\tbool HelpRequest = false;\r\n\r\n\tif (szArglist) {\r\n\t\tfor (int i = 0; i < nArgs; i++) {\r\n\t\t\tif (_wcsicmp(szArglist[i], L\"--device\") == 0 && i + 1 < nArgs)\r\n\t\t\t{\r\n\t\t\t\tGpuDevice = szArglist[i + 1];\r\n\t\t\t}\r\n\t\t\telse if (_wcsicmp(szArglist[i], L\"--size\") == 0 && i + 1 < nArgs)\r\n\t\t\t{\r\n\t\t\t\tGpuSize = _wtoi64(szArglist[i + 1]);\r\n\t\t\t}\r\n\t\t\telse if (_wcsicmp(szArglist[i], L\"--mount\") == 0 && i + 1 < nArgs)\r\n\t\t\t{\r\n\t\t\t\tGpuDriveLetter = szArglist[i + 1];\r\n\t\t\t}\r\n\t\t\telse if (_wcsicmp(szArglist[i], L\"--format\") == 0 && i + 1 < nArgs)\r\n\t\t\t{\r\n\t\t\t\tGpuFormatParam = szArglist[i + 1];\r\n\t\t\t}\r\n\t\t\telse if (_wcsicmp(szArglist[i], L\"--hide\") == 0)\r\n\t\t\t{\r\n\t\t\t\tnCmdShow = SW_HIDE;\r\n\t\t\t}\r\n\t\t\telse if (_wcsicmp(szArglist[i], L\"--help\") == 0 ||\r\n\t\t\t\t_wcsicmp(szArglist[i], L\"-h\") == 0 ||\r\n\t\t\t\t_wcsicmp(szArglist[i], L\"\/h\") == 0 ||\r\n\t\t\t\t_wcsicmp(szArglist[i], L\"\/?\") == 0)\r\n\t\t\t{\r\n\t\t\t\tHelpRequest = true;\r\n\t\t\t}\r\n\t\t}\r\n\r\n\t\tif (HelpRequest) {\r\n\t\t\tif (GetConsoleWindow() == NULL) {\r\n\t\t\t\tMessageBoxW(NULL, GPU_HELP_STRING, L\"GpuRamDrive help\", MB_OK);\r\n\t\t\t}\r\n\t\t\twprintf(GPU_HELP_STRING);\r\n\t\t\treturn 0;\r\n\t\t}\r\n\r\n\t\tGpuMount = GpuDevice && GpuSize && GpuDriveLetter;\r\n\t}\r\n\r\n\tif (!gui.Create(hInstance, L\"GPU Ram Drive\", nCmdShow)) {\r\n\t\treturn -1;\r\n\t}\r\n\r\n\tif (GpuMount) {\r\n\t\ttry\r\n\t\t{\r\n\t\t\tgui.Mount(GpuDevice, GpuSize, GpuDriveLetter, GpuFormatParam);\r\n\t\t}\r\n\t\tcatch (const std::exception& ex)\r\n\t\t{\r\n\t\t\tgui.RestoreWindow();\r\n\t\t\tif (GetConsoleWindow() == NULL) {\r\n\t\t\t\tMessageBoxA(NULL, ex.what(), \"GpuRamDrive error\", MB_OK);\r\n\t\t\t}\r\n\t\t\tfprintf(stderr, \"GpuRamDrive exception: %s\\n\", ex.what());\r\n\t\t}\r\n\t}\r\n\r\n\treturn gui.Loop();\r\n}<commit_msg>Show format example.<commit_after>\/*\r\nGpuRamDrive proxy for ImDisk Virtual Disk Driver.\r\n\r\nCopyright (C) 2016 Syahmi Azhar.\r\n\r\nPermission is hereby granted, free of charge, to any person\r\nobtaining a copy of this software and associated documentation\r\nfiles (the \"Software\"), to deal in the Software without\r\nrestriction, including without limitation the rights to use,\r\ncopy, modify, merge, publish, distribute, sublicense, and\/or\r\nsell copies of the Software, and to permit persons to whom the\r\nSoftware is furnished to do so, subject to the following\r\nconditions:\r\n\r\nThe above copyright notice and this permission notice shall be\r\nincluded in all copies or substantial portions of the Software.\r\n\r\nTHE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND,\r\nEXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES\r\nOF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND\r\nNONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT\r\nHOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY,\r\nWHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING\r\nFROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR\r\nOTHER DEALINGS IN THE SOFTWARE.\r\n*\/\r\n\r\n#include \"stdafx.h\"\r\n#include \"GpuRamDrive.h\"\r\n#include \"GpuRamGui.h\"\r\n\r\nconst wchar_t GPU_HELP_STRING[] = L\"Usage:\\n\"\r\n\" GpuRamDrive.exe --device CUDA --size 256 --mount j: --format \\\"\/fs:exfat \/q\\\"\\n\"\r\n\"\\n\"\r\n\"Options:\\n\"\r\n\" --device <Device Name> Search string for GPU device\\n\"\r\n\" --size <Size in MB> Size to be allocated for ram drive\\n\"\r\n\" --mount <Drive letter> Mount drive\\n\"\r\n\" --format <Parameters> Format and pass parameters to Windows' format\\n\"\r\n\" --hide Hide GUI to tray\\n\"\r\n\" --help Show this help\\n\";\r\n\r\n\r\nint APIENTRY wWinMain(\r\n\t_In_ HINSTANCE hInstance,\r\n\t_In_opt_ HINSTANCE hPrevInstance,\r\n\t_In_ LPWSTR lpCmdLine,\r\n\t_In_ int nCmdShow)\r\n{\r\n\tGpuRamGui gui;\r\n\r\n\tLPWSTR *szArglist;\r\n\tint nArgs;\r\n\tszArglist = CommandLineToArgvW(GetCommandLineW(), &nArgs);\r\n\r\n\tLPWSTR GpuDevice = nullptr;\r\n\tsize_t GpuSize = 0;\r\n\tLPWSTR GpuDriveLetter = nullptr;\r\n\tLPWSTR GpuFormatParam = L\"\";\r\n\tbool GpuMount = false;\r\n\tbool HelpRequest = false;\r\n\r\n\tif (szArglist) {\r\n\t\tfor (int i = 0; i < nArgs; i++) {\r\n\t\t\tif (_wcsicmp(szArglist[i], L\"--device\") == 0 && i + 1 < nArgs)\r\n\t\t\t{\r\n\t\t\t\tGpuDevice = szArglist[i + 1];\r\n\t\t\t}\r\n\t\t\telse if (_wcsicmp(szArglist[i], L\"--size\") == 0 && i + 1 < nArgs)\r\n\t\t\t{\r\n\t\t\t\tGpuSize = _wtoi64(szArglist[i + 1]);\r\n\t\t\t}\r\n\t\t\telse if (_wcsicmp(szArglist[i], L\"--mount\") == 0 && i + 1 < nArgs)\r\n\t\t\t{\r\n\t\t\t\tGpuDriveLetter = szArglist[i + 1];\r\n\t\t\t}\r\n\t\t\telse if (_wcsicmp(szArglist[i], L\"--format\") == 0 && i + 1 < nArgs)\r\n\t\t\t{\r\n\t\t\t\tGpuFormatParam = szArglist[i + 1];\r\n\t\t\t}\r\n\t\t\telse if (_wcsicmp(szArglist[i], L\"--hide\") == 0)\r\n\t\t\t{\r\n\t\t\t\tnCmdShow = SW_HIDE;\r\n\t\t\t}\r\n\t\t\telse if (_wcsicmp(szArglist[i], L\"--help\") == 0 ||\r\n\t\t\t\t_wcsicmp(szArglist[i], L\"-h\") == 0 ||\r\n\t\t\t\t_wcsicmp(szArglist[i], L\"\/h\") == 0 ||\r\n\t\t\t\t_wcsicmp(szArglist[i], L\"\/?\") == 0)\r\n\t\t\t{\r\n\t\t\t\tHelpRequest = true;\r\n\t\t\t}\r\n\t\t}\r\n\r\n\t\tif (HelpRequest) {\r\n\t\t\tif (GetConsoleWindow() == NULL) {\r\n\t\t\t\tMessageBoxW(NULL, GPU_HELP_STRING, L\"GpuRamDrive help\", MB_OK);\r\n\t\t\t}\r\n\t\t\twprintf(GPU_HELP_STRING);\r\n\t\t\treturn 0;\r\n\t\t}\r\n\r\n\t\tGpuMount = GpuDevice && GpuSize && GpuDriveLetter;\r\n\t}\r\n\r\n\tif (!gui.Create(hInstance, L\"GPU Ram Drive\", nCmdShow)) {\r\n\t\treturn -1;\r\n\t}\r\n\r\n\tif (GpuMount) {\r\n\t\ttry\r\n\t\t{\r\n\t\t\tgui.Mount(GpuDevice, GpuSize, GpuDriveLetter, GpuFormatParam);\r\n\t\t}\r\n\t\tcatch (const std::exception& ex)\r\n\t\t{\r\n\t\t\tgui.RestoreWindow();\r\n\t\t\tif (GetConsoleWindow() == NULL) {\r\n\t\t\t\tMessageBoxA(NULL, ex.what(), \"GpuRamDrive error\", MB_OK);\r\n\t\t\t}\r\n\t\t\tfprintf(stderr, \"GpuRamDrive exception: %s\\n\", ex.what());\r\n\t\t}\r\n\t}\r\n\r\n\treturn gui.Loop();\r\n}<|endoftext|>"} {"text":"<commit_before>\/* Program to log external IP-changes on NAT networks\n *\n * I have an ISP from Hell, and one problem I have noticed recently is that\n * my external IP address change a lot. To monitor this problem, I wrote this little\n * example program who checks the external IP every 5 minutes, and log changes.\n *\n * The program can be run in the background:\n *\n * logip >> \/var\/tmp\/ip.log 2>&1 &\n *\/\n\n\n#include <ctime>\n#include \"restc-cpp\/logging.h\"\n\n#include <boost\/log\/core.hpp>\n#include <boost\/log\/trivial.hpp>\n#include <boost\/log\/expressions.hpp>\n\n#include \"restc-cpp\/restc-cpp.h\"\n#include \"restc-cpp\/RequestBuilder.h\"\n#include \"restc-cpp\/SerializeJson.h\"\n\nusing namespace restc_cpp;\nusing namespace std;\n\n\/\/ Data structure returned from api.ipify.org\nstruct Data {\n string ip;\n};\n\nBOOST_FUSION_ADAPT_STRUCT(\n Data,\n (string, ip)\n)\n\nint main(int argc, char *argv[]) {\n\n namespace logging = boost::log;\n logging::core::get()->set_filter\n (\n logging::trivial::severity >= logging::trivial::info\n );\n\n const string url = \"https:\/\/api.ipify.org\";\n\n auto client = RestClient::Create();\n client->Process([&](Context& ctx) {\n\n string current_ip;\n Data data;\n char date[32] = {};\n\n while(true) {\n SerializeFromJson(data, RequestBuilder(ctx)\n .Get(url)\n .Argument(\"format\", \"json\")\n .Header(\"X-Client\", \"RESTC_CPP\")\n .Execute());\n\n if (current_ip != data.ip) {\n auto now = time(NULL);\n strftime(date, sizeof(date), \"%Y-%m-%d %H:%M\", localtime(&now));\n\n clog << date\n << ' '\n << data.ip\n << endl;\n current_ip = data.ip;\n }\n\n std::this_thread::sleep_for(std::chrono::minutes(5));\n }\n });\n\n\n return 0;\n}\n<commit_msg>Added error handling<commit_after>\/* Program to log external IP-changes on NAT networks\n *\n * I have an ISP from Hell, and one problem I have noticed recently is that\n * my external IP address change a lot. To monitor this problem, I wrote this little\n * example program who checks the external IP every 5 minutes, and log changes.\n *\n * The program can be run in the background:\n *\n * logip >> \/var\/tmp\/ip.log 2>&1 &\n *\/\n\n\n#include <ctime>\n#include \"restc-cpp\/logging.h\"\n\n#include <boost\/log\/core.hpp>\n#include <boost\/log\/trivial.hpp>\n#include <boost\/log\/expressions.hpp>\n\n#include \"restc-cpp\/restc-cpp.h\"\n#include \"restc-cpp\/RequestBuilder.h\"\n#include \"restc-cpp\/SerializeJson.h\"\n\nusing namespace restc_cpp;\nusing namespace std;\n\n\/\/ Data structure returned from api.ipify.org\nstruct Data {\n string ip;\n};\n\nBOOST_FUSION_ADAPT_STRUCT(\n Data,\n (string, ip)\n)\n\nstring now() {\n char date[32] = {};\n auto now = time(NULL);\n strftime(date, sizeof(date), \"%Y-%m-%d %H:%M\", localtime(&now));\n return date;\n}\n\nint main(int argc, char *argv[]) {\n\n namespace logging = boost::log;\n logging::core::get()->set_filter\n (\n logging::trivial::severity >= logging::trivial::info\n );\n\n const string url = \"https:\/\/api.ipify.org\";\n\n auto client = RestClient::Create();\n client->Process([&](Context& ctx) {\n\n string current_ip;\n Data data;\n\n while(true) {\n bool valid = false;\n try {\n SerializeFromJson(data, RequestBuilder(ctx)\n .Get(url)\n .Argument(\"format\", \"json\")\n .Header(\"X-Client\", \"RESTC_CPP\")\n .Execute());\n valid = true;\n } catch (const boost::exception& ex) {\n clog << now()\n << \"Caught boost exception: \"\n << boost::diagnostic_information(ex)\n << endl;\n } catch (const exception& ex) {\n clog << now()\n << \"Caught exception: \"\n << ex.what()\n << endl;\n }\n\n if (valid && (current_ip != data.ip)) {\n clog << now()\n << ' '\n << data.ip\n << endl;\n current_ip = data.ip;\n }\n\n std::this_thread::sleep_for(std::chrono::minutes(5));\n }\n });\n\n\n return 0;\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 \"image.h\"\n#include <Eigen\/Dense>\n#include <Eigen\/SVD>\n\n#define DEFAULT_SIZE 5\n\nusing namespace MR;\nusing namespace App;\n\n\nvoid usage ()\n{\n DESCRIPTION\n + \"denoise DWI data and estimate the noise level based on the optimal threshold for PCA.\";\n\n \n AUTHOR = \"Daan Christiaens (daan.christiaens@kuleuven.be) & Jelle Veraart (jelle.veraart@nyumc.org) & J-Donald Tournier (jdtournier.gmail.com)\";\n \n \n ARGUMENTS\n + Argument (\"dwi\", \"the input diffusion-weighted image.\").type_image_in ()\n\n + Argument (\"out\", \"the output denoised DWI image.\").type_image_out ();\n\n\n OPTIONS\n + Option (\"size\", \"set the window size of the denoising filter. (default = \" + str(DEFAULT_SIZE) + \")\")\n + Argument (\"window\").type_integer (0, 50)\n \n + Option (\"noise\", \"the output noise map.\")\n + Argument (\"level\").type_image_out();\n\n}\n\n\ntypedef float value_type;\n\n\ntemplate <class ImageType>\nclass DenoisingFunctor\n{\npublic:\n DenoisingFunctor (ImageType& dwi, int size)\n : extent(size\/2),\n m(dwi.size(3)),\n n(size*size*size),\n r((m<n) ? m : n),\n X(m,n), Xm(m),\n pos{0, 0, 0}\n { }\n \n void operator () (ImageType& dwi, ImageType& out)\n {\n \/\/ Load data in local window\n load_data(dwi);\n \/\/ Centre data\n Xm = X.rowwise().mean();\n X.colwise() -= Xm;\n \/\/ Compute SVD\n Eigen::JacobiSVD<Eigen::MatrixXf> svd (X, Eigen::ComputeThinU | Eigen::ComputeThinV);\n Eigen::VectorXf s = svd.singularValues();\n Eigen::VectorXf lam = s.array().square() \/ n;\n Eigen::VectorXf clam (r);\n float cs = 0.0;\n for (size_t i = r; i != 0; --i) {\n cs += lam[i-1];\n clam[i-1] = cs;\n }\n float sigsq1, sigsq2, gam;\n size_t p;\n for (p = 0; p < r; ++p) {\n gam = float(m-p) \/ float(n);\n \/\/ First estimation of sigma\n sigsq1 = clam[p] \/ (r-p) \/ ((gam<1.0) ? 1.0 : gam);\n \/\/ Second estimation of sigma\n sigsq2 = (lam[p] - lam[r]) \/ 4 \/ std::sqrt(gam);\n \/\/ sigsq2 > sigsq1 if signal\n if (sigsq2 < sigsq1)\n break;\n }\n s.tail(r-p).setZero();\n \/\/ Restore DWI data\n X = svd.matrixU() * s.asDiagonal() * svd.matrixV().adjoint();\n X.colwise() += Xm;\n \/\/ Store output\n assign_pos_of(dwi).to(out);\n out.row(3) = X.col(n\/2).template cast<value_type>();\n }\n \n void load_data (ImageType& dwi)\n {\n pos[0] = dwi.index(0); pos[1] = dwi.index(1); pos[2] = dwi.index(2);\n X.setZero();\n ssize_t k = 0;\n for (dwi.index(2) = pos[2]-extent; dwi.index(2) <= pos[2]+extent; ++dwi.index(2))\n for (dwi.index(1) = pos[1]-extent; dwi.index(1) <= pos[1]+extent; ++dwi.index(1))\n for (dwi.index(0) = pos[0]-extent; dwi.index(0) <= pos[0]+extent; ++dwi.index(0), ++k)\n if (! is_out_of_bounds(dwi))\n X.col(k) = dwi.row(3).template cast<float>();\n \/\/ reset image position\n dwi.index(0) = pos[0];\n dwi.index(1) = pos[1];\n dwi.index(2) = pos[2];\n }\n \nprivate:\n int extent;\n size_t m, n, r;\n Eigen::MatrixXf X;\n Eigen::VectorXf Xm;\n ssize_t pos[3];\n \n};\n\n\n\nvoid run ()\n{\n auto dwi_in = Image<value_type>::open (argument[0]).with_direct_io(3);\n\n auto header = Header (dwi_in);\n header.datatype() = DataType::Float32;\n auto dwi_out = Image<value_type>::create (argument[1], header);\n \n int extent = get_option_value(\"size\", DEFAULT_SIZE);\n \n DenoisingFunctor< Image<value_type> > func (dwi_in, extent);\n \n ThreadedLoop (\"running MP-PCA denoising\", dwi_in, 0, 3)\n .run (func, dwi_in, dwi_out);\n\n}\n\n\n<commit_msg>Export noise level to optional output image.<commit_after>\/*\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 \"image.h\"\n#include <Eigen\/Dense>\n#include <Eigen\/SVD>\n\n#define DEFAULT_SIZE 5\n\nusing namespace MR;\nusing namespace App;\n\n\nvoid usage ()\n{\n DESCRIPTION\n + \"denoise DWI data and estimate the noise level based on the optimal threshold for PCA.\";\n\n \n AUTHOR = \"Daan Christiaens (daan.christiaens@kuleuven.be) & Jelle Veraart (jelle.veraart@nyumc.org) & J-Donald Tournier (jdtournier.gmail.com)\";\n \n \n ARGUMENTS\n + Argument (\"dwi\", \"the input diffusion-weighted image.\").type_image_in ()\n\n + Argument (\"out\", \"the output denoised DWI image.\").type_image_out ();\n\n\n OPTIONS\n + Option (\"size\", \"set the window size of the denoising filter. (default = \" + str(DEFAULT_SIZE) + \")\")\n + Argument (\"window\").type_integer (0, 50)\n \n + Option (\"noise\", \"the output noise map.\")\n + Argument (\"level\").type_image_out();\n\n}\n\n\ntypedef float value_type;\n\n\ntemplate <class ImageType>\nclass DenoisingFunctor\n{\npublic:\n DenoisingFunctor (ImageType& dwi, int size)\n : extent(size\/2),\n m(dwi.size(3)),\n n(size*size*size),\n r((m<n) ? m : n),\n X(m,n), Xm(m),\n pos{0, 0, 0}\n { }\n \n void operator () (ImageType& dwi, ImageType& out)\n {\n \/\/ Load data in local window\n load_data(dwi);\n \/\/ Centre data\n Xm = X.rowwise().mean();\n X.colwise() -= Xm;\n \/\/ Compute SVD\n Eigen::JacobiSVD<Eigen::MatrixXf> svd (X, Eigen::ComputeThinU | Eigen::ComputeThinV);\n Eigen::VectorXf s = svd.singularValues();\n Eigen::VectorXf lam = s.array().square() \/ n;\n Eigen::VectorXf clam (r);\n float cs = 0.0;\n for (size_t i = r; i != 0; --i) {\n cs += lam[i-1];\n clam[i-1] = cs;\n }\n float sigsq1, sigsq2, gam;\n size_t p;\n for (p = 0; p < r; ++p) {\n gam = float(m-p) \/ float(n);\n \/\/ First estimation of sigma\n sigsq1 = clam[p] \/ (r-p) \/ ((gam<1.0) ? 1.0 : gam);\n \/\/ Second estimation of sigma\n sigsq2 = (lam[p] - lam[r]) \/ 4 \/ std::sqrt(gam);\n \/\/ sigsq2 > sigsq1 if signal\n if (sigsq2 < sigsq1)\n break;\n }\n s.tail(r-p).setZero();\n sigma = (p==r) ? NaN : std::sqrt(sigsq1);\n \/\/ Restore DWI data\n X = svd.matrixU() * s.asDiagonal() * svd.matrixV().adjoint();\n X.colwise() += Xm;\n \/\/ Store output\n assign_pos_of(dwi).to(out);\n out.row(3) = X.col(n\/2).template cast<value_type>();\n }\n \n void operator () (ImageType& dwi, ImageType& out, ImageType& noise)\n {\n operator ()(dwi, out);\n assign_pos_of(dwi).to(noise);\n noise.value() = sigma;\n }\n \n void load_data (ImageType& dwi)\n {\n pos[0] = dwi.index(0); pos[1] = dwi.index(1); pos[2] = dwi.index(2);\n X.setZero();\n ssize_t k = 0;\n for (dwi.index(2) = pos[2]-extent; dwi.index(2) <= pos[2]+extent; ++dwi.index(2))\n for (dwi.index(1) = pos[1]-extent; dwi.index(1) <= pos[1]+extent; ++dwi.index(1))\n for (dwi.index(0) = pos[0]-extent; dwi.index(0) <= pos[0]+extent; ++dwi.index(0), ++k)\n if (! is_out_of_bounds(dwi))\n X.col(k) = dwi.row(3).template cast<float>();\n \/\/ reset image position\n dwi.index(0) = pos[0];\n dwi.index(1) = pos[1];\n dwi.index(2) = pos[2];\n }\n \nprivate:\n int extent;\n size_t m, n, r;\n Eigen::MatrixXf X;\n Eigen::VectorXf Xm;\n ssize_t pos[3];\n float sigma;\n \n};\n\n\n\nvoid run ()\n{\n auto dwi_in = Image<value_type>::open (argument[0]).with_direct_io(3);\n\n auto header = Header (dwi_in);\n header.datatype() = DataType::Float32;\n auto dwi_out = Image<value_type>::create (argument[1], header);\n \n int extent = get_option_value(\"size\", DEFAULT_SIZE);\n \n DenoisingFunctor< Image<value_type> > func (dwi_in, extent);\n \n auto opt = get_options(\"noise\");\n if (opt.size())\n {\n header.set_ndim(3);\n auto noise = Image<value_type>::create (opt[0][0], header);\n ThreadedLoop (\"running MP-PCA denoising\", dwi_in, 0, 3)\n .run (func, dwi_in, dwi_out, noise);\n } \n else\n {\n ThreadedLoop (\"running MP-PCA denoising\", dwi_in, 0, 3)\n .run (func, dwi_in, dwi_out);\n }\n\n\n}\n\n\n<|endoftext|>"} {"text":"<commit_before>\/\/ Scintilla source code edit control\n\/** @file LexCPP.cxx\n ** Lexer for C++, C, Java, and Javascript.\n **\/\n\/\/ Copyright 1998-2001 by Neil Hodgson <neilh@scintilla.org>\n\/\/ The License.txt file describes the conditions under which this software may be distributed.\n\n#include <stdlib.h>\n#include <string.h>\n#include <ctype.h>\n#include <stdio.h>\n#include <stdarg.h>\n\n#include \"Platform.h\"\n\n#include \"PropSet.h\"\n#include \"Accessor.h\"\n#include \"StyleContext.h\"\n#include \"KeyWords.h\"\n#include \"Scintilla.h\"\n#include \"SciLexer.h\"\n\nstatic bool IsOKBeforeRE(const int ch) {\n\treturn (ch == '(') || (ch == '=') || (ch == ',');\n}\n\ninline bool IsAWordChar(const int ch) {\n\treturn (ch < 0x80) && (isalnum(ch) || ch == '.' || ch == '_');\n}\n\ninline bool IsAWordStart(const int ch) {\n\treturn (ch < 0x80) && (isalnum(ch) || ch == '_');\n}\n\ninline bool IsADoxygenChar(const int ch) {\n\treturn (islower(ch) || ch == '$' || ch == '@' ||\n\t\t ch == '\\\\' || ch == '&' || ch == '<' ||\n\t\t\tch == '>' || ch == '#' || ch == '{' ||\n\t\t\tch == '}' || ch == '[' || ch == ']');\n}\n\ninline bool IsStateComment(const int state) {\n\treturn ((state == SCE_C_COMMENT) ||\n\t\t (state == SCE_C_COMMENTLINE) ||\n\t\t (state == SCE_C_COMMENTDOC) ||\n\t\t (state == SCE_C_COMMENTDOCKEYWORD) ||\n\t\t (state == SCE_C_COMMENTDOCKEYWORDERROR));\n}\n\ninline bool IsStateString(const int state) {\n\treturn ((state == SCE_C_STRING) || (state == SCE_C_VERBATIM));\n}\n\nstatic void ColouriseCppDoc(unsigned int startPos, int length, int initStyle, WordList *keywordlists[],\n Accessor &styler) {\n\n\tWordList &keywords = *keywordlists[0];\n\tWordList &keywords2 = *keywordlists[1];\n\tWordList &keywords3 = *keywordlists[2];\n\n\tbool stylingWithinPreprocessor = styler.GetPropertyInt(\"styling.within.preprocessor\") != 0;\n\n\t\/\/ Do not leak onto next line\n\tif (initStyle == SCE_C_STRINGEOL)\n\t\tinitStyle = SCE_C_DEFAULT;\n\n\tint chPrevNonWhite = ' ';\n\tint visibleChars = 0;\n\tbool lastWordWasUUID = false;\n\n\tStyleContext sc(startPos, length, initStyle, styler);\n\n\tfor (; sc.More(); sc.Forward()) {\n\t\n\t\t\/\/ Handle line continuation generically.\n\t\tif (sc.ch == '\\\\') {\n\t\t\tif (sc.Match(\"\\\\\\n\")) {\n\t\t\t\tsc.Forward();\n\t\t\t\tsc.Forward();\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t\tif (sc.Match(\"\\\\\\r\\n\")) {\n\t\t\t\tsc.Forward();\n\t\t\t\tsc.Forward();\n\t\t\t\tsc.Forward();\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t}\n\n\t\t\/\/ Determine if the current state should terminate.\n\t\tif (sc.state == SCE_C_OPERATOR) {\n\t\t\tsc.SetState(SCE_C_DEFAULT);\n\t\t} else if (sc.state == SCE_C_NUMBER) {\n\t\t\tif (!IsAWordChar(sc.ch)) {\n\t\t\t\tsc.SetState(SCE_C_DEFAULT);\n\t\t\t}\n\t\t} else if (sc.state == SCE_C_IDENTIFIER) {\n\t\t\tif (!IsAWordChar(sc.ch) || (sc.ch == '.')) {\n\t\t\t\tchar s[100];\n\t\t\t\tsc.GetCurrent(s, sizeof(s));\n\t\t\t\tif (keywords.InList(s)) {\n\t\t\t\t\tlastWordWasUUID = strcmp(s, \"uuid\") == 0;\n\t\t\t\t\tsc.ChangeState(SCE_C_WORD);\n\t\t\t\t} else if (keywords2.InList(s)) {\n\t\t\t\t\tsc.ChangeState(SCE_C_WORD2);\n\t\t\t\t}\n\t\t\t\tsc.SetState(SCE_C_DEFAULT);\n\t\t\t}\n\t\t} else if (sc.state == SCE_C_PREPROCESSOR) {\n\t\t\tif (stylingWithinPreprocessor) {\n\t\t\t\tif (IsASpace(sc.ch)) {\n\t\t\t\t\tsc.SetState(SCE_C_DEFAULT);\n\t\t\t\t}\n\t\t\t} else {\n\t\t\t\tif (sc.atLineEnd) {\n\t\t\t\t\tsc.SetState(SCE_C_DEFAULT);\n\t\t\t\t}\n\t\t\t}\n\t\t} else if (sc.state == SCE_C_COMMENT) {\n\t\t\tif (sc.Match('*', '\/')) {\n\t\t\t\tsc.Forward();\n\t\t\t\tsc.ForwardSetState(SCE_C_DEFAULT);\n\t\t\t}\n\t\t} else if (sc.state == SCE_C_COMMENTDOC) {\n\t\t\tif (sc.Match('*', '\/')) {\n\t\t\t\tsc.Forward();\n\t\t\t\tsc.ForwardSetState(SCE_C_DEFAULT);\n\t\t\t} else if (sc.ch == '@' || sc.ch == '\\\\') {\n\t\t\t\tsc.SetState(SCE_C_COMMENTDOCKEYWORD);\n\t\t\t}\n\t\t} else if (sc.state == SCE_C_COMMENTLINE || sc.state == SCE_C_COMMENTLINEDOC) {\n\t\t\tif (sc.atLineEnd) {\n\t\t\t\tsc.SetState(SCE_C_DEFAULT);\n\t\t\t\tvisibleChars = 0;\n\t\t\t}\n\t\t} else if (sc.state == SCE_C_COMMENTDOCKEYWORD) {\n\t\t\tif (sc.Match('*', '\/')) {\n\t\t\t\tsc.ChangeState(SCE_C_COMMENTDOCKEYWORDERROR);\n\t\t\t\tsc.Forward();\n\t\t\t\tsc.ForwardSetState(SCE_C_DEFAULT);\n\t\t\t} else if (!IsADoxygenChar(sc.ch)) {\n\t\t\t\tchar s[100];\n\t\t\t\tsc.GetCurrent(s, sizeof(s));\n\t\t\t\tif (!isspace(sc.ch) || !keywords3.InList(s+1)) {\n\t\t\t\t\tsc.ChangeState(SCE_C_COMMENTDOCKEYWORDERROR);\n\t\t\t\t}\n\t\t\t\tsc.SetState(SCE_C_COMMENTDOC);\n\t\t\t}\n\t\t} else if (sc.state == SCE_C_STRING) {\n\t\t\tif (sc.ch == '\\\\') {\n\t\t\t\tif (sc.chNext == '\\\"' || sc.chNext == '\\'' || sc.chNext == '\\\\') {\n\t\t\t\t\tsc.Forward();\n\t\t\t\t}\n\t\t\t} else if (sc.ch == '\\\"') {\n\t\t\t\tsc.ForwardSetState(SCE_C_DEFAULT);\n\t\t\t} else if (sc.atLineEnd) {\n\t\t\t\tsc.ChangeState(SCE_C_STRINGEOL);\n\t\t\t\tsc.ForwardSetState(SCE_C_DEFAULT);\n\t\t\t\tvisibleChars = 0;\n\t\t\t}\n\t\t} else if (sc.state == SCE_C_CHARACTER) {\n\t\t\tif (sc.atLineEnd) {\n\t\t\t\tsc.ChangeState(SCE_C_STRINGEOL);\n\t\t\t\tsc.ForwardSetState(SCE_C_DEFAULT);\n\t\t\t\tvisibleChars = 0;\n\t\t\t} else if (sc.ch == '\\\\') {\n\t\t\t\tif (sc.chNext == '\\\"' || sc.chNext == '\\'' || sc.chNext == '\\\\') {\n\t\t\t\t\tsc.Forward();\n\t\t\t\t}\n\t\t\t} else if (sc.ch == '\\'') {\n\t\t\t\tsc.ForwardSetState(SCE_C_DEFAULT);\n\t\t\t}\n\t\t} else if (sc.state == SCE_C_REGEX) {\n\t\t\tif (sc.ch == '\\r' || sc.ch == '\\n' || sc.ch == '\/') {\n\t\t\t\tsc.ForwardSetState(SCE_C_DEFAULT);\n\t\t\t} else if (sc.ch == '\\\\') {\n\t\t\t\t\/\/ Gobble up the quoted character\n\t\t\t\tif (sc.chNext == '\\\\' || sc.chNext == '\/') {\n\t\t\t\t\tsc.Forward();\n\t\t\t\t}\n\t\t\t}\n\t\t} else if (sc.state == SCE_C_VERBATIM) {\n\t\t\tif (sc.ch == '\\\"') {\n\t\t\t\tif (sc.chNext == '\\\"') {\n\t\t\t\t\tsc.Forward();\n\t\t\t\t} else {\n\t\t\t\t\tsc.ForwardSetState(SCE_C_DEFAULT);\n\t\t\t\t}\n\t\t\t}\n\t\t} else if (sc.state == SCE_C_UUID) {\n\t\t\tif (sc.ch == '\\r' || sc.ch == '\\n' || sc.ch == ')') {\n\t\t\t\tsc.SetState(SCE_C_DEFAULT);\n\t\t\t}\n\t\t}\n\n\t\t\/\/ Determine if a new state should be entered.\n\t\tif (sc.state == SCE_C_DEFAULT) {\n\t\t\tif (sc.Match('@', '\\\"')) {\n\t\t\t\tsc.SetState(SCE_C_VERBATIM);\n\t\t\t\tsc.Forward();\n\t\t\t} else if (IsADigit(sc.ch) || (sc.ch == '.' && IsADigit(sc.chNext))) {\n\t\t\t\tif (lastWordWasUUID) {\n\t\t\t\t\tsc.SetState(SCE_C_UUID);\n\t\t\t\t\tlastWordWasUUID = false;\n\t\t\t\t} else {\n\t\t\t\t\tsc.SetState(SCE_C_NUMBER);\n\t\t\t\t}\n\t\t\t} else if (IsAWordStart(sc.ch) || (sc.ch == '@')) {\n\t\t\t\tif (lastWordWasUUID) {\n\t\t\t\t\tsc.SetState(SCE_C_UUID);\n\t\t\t\t\tlastWordWasUUID = false;\n\t\t\t\t} else {\n\t\t\t\t\tsc.SetState(SCE_C_IDENTIFIER);\n\t\t\t\t}\n\t\t\t} else if (sc.Match('\/', '*')) {\n\t\t\t\tif (sc.Match(\"\/**\") || sc.Match(\"\/*!\")) {\t\/\/ Support of Qt\/Doxygen doc. style\n\t\t\t\t\tsc.SetState(SCE_C_COMMENTDOC);\n\t\t\t\t} else {\n\t\t\t\t\tsc.SetState(SCE_C_COMMENT);\n\t\t\t\t}\n\t\t\t\tsc.Forward();\t\/\/ Eat the * so it isn't used for the end of the comment\n\t\t\t} else if (sc.Match('\/', '\/')) {\n\t\t\t\tif (sc.Match(\"\/\/\/\") || sc.Match(\"\/\/!\"))\t\/\/ Support of Qt\/Doxygen doc. style\n\t\t\t\t\tsc.SetState(SCE_C_COMMENTLINEDOC);\n\t\t\t\telse\n\t\t\t\t\tsc.SetState(SCE_C_COMMENTLINE);\n\t\t\t} else if (sc.ch == '\/' && IsOKBeforeRE(chPrevNonWhite)) {\n\t\t\t\tsc.SetState(SCE_C_REGEX);\n\t\t\t} else if (sc.ch == '\\\"') {\n\t\t\t\tsc.SetState(SCE_C_STRING);\n\t\t\t} else if (sc.ch == '\\'') {\n\t\t\t\tsc.SetState(SCE_C_CHARACTER);\n\t\t\t} else if (sc.ch == '#' && visibleChars == 0) {\n\t\t\t\t\/\/ Preprocessor commands are alone on their line\n\t\t\t\tsc.SetState(SCE_C_PREPROCESSOR);\n\t\t\t\t\/\/ Skip whitespace between # and preprocessor word\n\t\t\t\tdo {\n\t\t\t\t\tsc.Forward();\n\t\t\t\t} while ((sc.ch == ' ') && (sc.ch == '\\t') && sc.More());\n\t\t\t\tif (sc.atLineEnd) {\n\t\t\t\t\tsc.SetState(SCE_C_DEFAULT);\n\t\t\t\t}\n\t\t\t} else if (isoperator(static_cast<char>(sc.ch))) {\n\t\t\t\tsc.SetState(SCE_C_OPERATOR);\n\t\t\t}\n\t\t}\n\t\t\n\t\tif (sc.atLineEnd) {\n\t\t\t\/\/ Reset states to begining of colourise so no surprises \n\t\t\t\/\/ if different sets of lines lexed.\n\t\t\tchPrevNonWhite = ' ';\n\t\t\tvisibleChars = 0;\n\t\t\tlastWordWasUUID = false;\n\t\t}\n\t\tif (!IsASpace(sc.ch)) {\n\t\t\tchPrevNonWhite = sc.ch;\n\t\t\tvisibleChars++;\n\t\t}\n\t}\n\tsc.Complete();\n}\n\nstatic void FoldCppDoc(unsigned int startPos, int length, int initStyle, WordList *[],\n Accessor &styler) {\n\tbool foldComment = styler.GetPropertyInt(\"fold.comment\") != 0;\n\tbool foldCompact = styler.GetPropertyInt(\"fold.compact\", 1) != 0;\n\tunsigned int endPos = startPos + length;\n\tint visibleChars = 0;\n\tint lineCurrent = styler.GetLine(startPos);\n\tint levelPrev = styler.LevelAt(lineCurrent) & SC_FOLDLEVELNUMBERMASK;\n\tint levelCurrent = levelPrev;\n\tchar chNext = styler[startPos];\n\tint styleNext = styler.StyleAt(startPos);\n\tint style = initStyle;\n\tfor (unsigned int i = startPos; i < endPos; i++) {\n\t\tchar ch = chNext;\n\t\tchNext = styler.SafeGetCharAt(i + 1);\n\t\tint stylePrev = style;\n\t\tstyle = styleNext;\n\t\tstyleNext = styler.StyleAt(i + 1);\n\t\tbool atEOL = (ch == '\\r' && chNext != '\\n') || (ch == '\\n');\n\t\tif (foldComment &&\n\t\t\t(style == SCE_C_COMMENT || style == SCE_C_COMMENTDOC)) {\n\t\t\tif (style != stylePrev) {\n\t\t\t\tlevelCurrent++;\n\t\t\t} else if ((style != styleNext) && !atEOL) {\n\t\t\t\t\/\/ Comments don't end at end of line and the next character may be unstyled.\n\t\t\t\tlevelCurrent--;\n\t\t\t}\n\t\t}\n\t\tif (style == SCE_C_OPERATOR) {\n\t\t\tif (ch == '{') {\n\t\t\t\tlevelCurrent++;\n\t\t\t} else if (ch == '}') {\n\t\t\t\tlevelCurrent--;\n\t\t\t}\n\t\t}\n\t\tif (atEOL) {\n\t\t\tint lev = levelPrev;\n\t\t\tif (visibleChars == 0 && foldCompact)\n\t\t\t\tlev |= SC_FOLDLEVELWHITEFLAG;\n\t\t\tif ((levelCurrent > levelPrev) && (visibleChars > 0))\n\t\t\t\tlev |= SC_FOLDLEVELHEADERFLAG;\n\t\t\tif (lev != styler.LevelAt(lineCurrent)) {\n\t\t\t\tstyler.SetLevel(lineCurrent, lev);\n\t\t\t}\n\t\t\tlineCurrent++;\n\t\t\tlevelPrev = levelCurrent;\n\t\t\tvisibleChars = 0;\n\t\t}\n\t\tif (!isspacechar(ch))\n\t\t\tvisibleChars++;\n\t}\n\t\/\/ Fill in the real level of the next line, keeping the current flags as they will be filled in later\n\tint flagsNext = styler.LevelAt(lineCurrent) & ~SC_FOLDLEVELNUMBERMASK;\n\tstyler.SetLevel(lineCurrent, levelPrev | flagsNext);\n}\n\nLexerModule lmCPP(SCLEX_CPP, ColouriseCppDoc, \"cpp\", FoldCppDoc);\nLexerModule lmTCL(SCLEX_TCL, ColouriseCppDoc, \"tcl\", FoldCppDoc);\n<commit_msg>Fixed what looks like a gcc compiler bug returning true for ':' when function declared as inline rather than static inline.<commit_after>\/\/ Scintilla source code edit control\n\/** @file LexCPP.cxx\n ** Lexer for C++, C, Java, and Javascript.\n **\/\n\/\/ Copyright 1998-2001 by Neil Hodgson <neilh@scintilla.org>\n\/\/ The License.txt file describes the conditions under which this software may be distributed.\n\n#include <stdlib.h>\n#include <string.h>\n#include <ctype.h>\n#include <stdio.h>\n#include <stdarg.h>\n\n#include \"Platform.h\"\n\n#include \"PropSet.h\"\n#include \"Accessor.h\"\n#include \"StyleContext.h\"\n#include \"KeyWords.h\"\n#include \"Scintilla.h\"\n#include \"SciLexer.h\"\n\nstatic bool IsOKBeforeRE(const int ch) {\n\treturn (ch == '(') || (ch == '=') || (ch == ',');\n}\n\nstatic inline bool IsAWordChar(const int ch) {\n\treturn (ch < 0x80) && (isalnum(ch) || ch == '.' || ch == '_');\n}\n\ninline bool IsAWordStart(const int ch) {\n\treturn (ch < 0x80) && (isalnum(ch) || ch == '_');\n}\n\ninline bool IsADoxygenChar(const int ch) {\n\treturn (islower(ch) || ch == '$' || ch == '@' ||\n\t\t ch == '\\\\' || ch == '&' || ch == '<' ||\n\t\t\tch == '>' || ch == '#' || ch == '{' ||\n\t\t\tch == '}' || ch == '[' || ch == ']');\n}\n\ninline bool IsStateComment(const int state) {\n\treturn ((state == SCE_C_COMMENT) ||\n\t\t (state == SCE_C_COMMENTLINE) ||\n\t\t (state == SCE_C_COMMENTDOC) ||\n\t\t (state == SCE_C_COMMENTDOCKEYWORD) ||\n\t\t (state == SCE_C_COMMENTDOCKEYWORDERROR));\n}\n\ninline bool IsStateString(const int state) {\n\treturn ((state == SCE_C_STRING) || (state == SCE_C_VERBATIM));\n}\n\nstatic void ColouriseCppDoc(unsigned int startPos, int length, int initStyle, WordList *keywordlists[],\n Accessor &styler) {\n\n\tWordList &keywords = *keywordlists[0];\n\tWordList &keywords2 = *keywordlists[1];\n\tWordList &keywords3 = *keywordlists[2];\n\n\tbool stylingWithinPreprocessor = styler.GetPropertyInt(\"styling.within.preprocessor\") != 0;\n\n\t\/\/ Do not leak onto next line\n\tif (initStyle == SCE_C_STRINGEOL)\n\t\tinitStyle = SCE_C_DEFAULT;\n\n\tint chPrevNonWhite = ' ';\n\tint visibleChars = 0;\n\tbool lastWordWasUUID = false;\n\n\tStyleContext sc(startPos, length, initStyle, styler);\n\n\tfor (; sc.More(); sc.Forward()) {\n\t\n\t\t\/\/ Handle line continuation generically.\n\t\tif (sc.ch == '\\\\') {\n\t\t\tif (sc.Match(\"\\\\\\n\")) {\n\t\t\t\tsc.Forward();\n\t\t\t\tsc.Forward();\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t\tif (sc.Match(\"\\\\\\r\\n\")) {\n\t\t\t\tsc.Forward();\n\t\t\t\tsc.Forward();\n\t\t\t\tsc.Forward();\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t}\n\n\t\t\/\/ Determine if the current state should terminate.\n\t\tif (sc.state == SCE_C_OPERATOR) {\n\t\t\tsc.SetState(SCE_C_DEFAULT);\n\t\t} else if (sc.state == SCE_C_NUMBER) {\n\t\t\tif (!IsAWordChar(sc.ch)) {\n\t\t\t\tsc.SetState(SCE_C_DEFAULT);\n\t\t\t}\n\t\t} else if (sc.state == SCE_C_IDENTIFIER) {\n\t\t\tif (!IsAWordChar(sc.ch) || (sc.ch == '.')) {\n\t\t\t\tchar s[100];\n\t\t\t\tsc.GetCurrent(s, sizeof(s));\n\t\t\t\tif (keywords.InList(s)) {\n\t\t\t\t\tlastWordWasUUID = strcmp(s, \"uuid\") == 0;\n\t\t\t\t\tsc.ChangeState(SCE_C_WORD);\n\t\t\t\t} else if (keywords2.InList(s)) {\n\t\t\t\t\tsc.ChangeState(SCE_C_WORD2);\n\t\t\t\t}\n\t\t\t\tsc.SetState(SCE_C_DEFAULT);\n\t\t\t}\n\t\t} else if (sc.state == SCE_C_PREPROCESSOR) {\n\t\t\tif (stylingWithinPreprocessor) {\n\t\t\t\tif (IsASpace(sc.ch)) {\n\t\t\t\t\tsc.SetState(SCE_C_DEFAULT);\n\t\t\t\t}\n\t\t\t} else {\n\t\t\t\tif (sc.atLineEnd) {\n\t\t\t\t\tsc.SetState(SCE_C_DEFAULT);\n\t\t\t\t}\n\t\t\t}\n\t\t} else if (sc.state == SCE_C_COMMENT) {\n\t\t\tif (sc.Match('*', '\/')) {\n\t\t\t\tsc.Forward();\n\t\t\t\tsc.ForwardSetState(SCE_C_DEFAULT);\n\t\t\t}\n\t\t} else if (sc.state == SCE_C_COMMENTDOC) {\n\t\t\tif (sc.Match('*', '\/')) {\n\t\t\t\tsc.Forward();\n\t\t\t\tsc.ForwardSetState(SCE_C_DEFAULT);\n\t\t\t} else if (sc.ch == '@' || sc.ch == '\\\\') {\n\t\t\t\tsc.SetState(SCE_C_COMMENTDOCKEYWORD);\n\t\t\t}\n\t\t} else if (sc.state == SCE_C_COMMENTLINE || sc.state == SCE_C_COMMENTLINEDOC) {\n\t\t\tif (sc.atLineEnd) {\n\t\t\t\tsc.SetState(SCE_C_DEFAULT);\n\t\t\t\tvisibleChars = 0;\n\t\t\t}\n\t\t} else if (sc.state == SCE_C_COMMENTDOCKEYWORD) {\n\t\t\tif (sc.Match('*', '\/')) {\n\t\t\t\tsc.ChangeState(SCE_C_COMMENTDOCKEYWORDERROR);\n\t\t\t\tsc.Forward();\n\t\t\t\tsc.ForwardSetState(SCE_C_DEFAULT);\n\t\t\t} else if (!IsADoxygenChar(sc.ch)) {\n\t\t\t\tchar s[100];\n\t\t\t\tsc.GetCurrent(s, sizeof(s));\n\t\t\t\tif (!isspace(sc.ch) || !keywords3.InList(s+1)) {\n\t\t\t\t\tsc.ChangeState(SCE_C_COMMENTDOCKEYWORDERROR);\n\t\t\t\t}\n\t\t\t\tsc.SetState(SCE_C_COMMENTDOC);\n\t\t\t}\n\t\t} else if (sc.state == SCE_C_STRING) {\n\t\t\tif (sc.ch == '\\\\') {\n\t\t\t\tif (sc.chNext == '\\\"' || sc.chNext == '\\'' || sc.chNext == '\\\\') {\n\t\t\t\t\tsc.Forward();\n\t\t\t\t}\n\t\t\t} else if (sc.ch == '\\\"') {\n\t\t\t\tsc.ForwardSetState(SCE_C_DEFAULT);\n\t\t\t} else if (sc.atLineEnd) {\n\t\t\t\tsc.ChangeState(SCE_C_STRINGEOL);\n\t\t\t\tsc.ForwardSetState(SCE_C_DEFAULT);\n\t\t\t\tvisibleChars = 0;\n\t\t\t}\n\t\t} else if (sc.state == SCE_C_CHARACTER) {\n\t\t\tif (sc.atLineEnd) {\n\t\t\t\tsc.ChangeState(SCE_C_STRINGEOL);\n\t\t\t\tsc.ForwardSetState(SCE_C_DEFAULT);\n\t\t\t\tvisibleChars = 0;\n\t\t\t} else if (sc.ch == '\\\\') {\n\t\t\t\tif (sc.chNext == '\\\"' || sc.chNext == '\\'' || sc.chNext == '\\\\') {\n\t\t\t\t\tsc.Forward();\n\t\t\t\t}\n\t\t\t} else if (sc.ch == '\\'') {\n\t\t\t\tsc.ForwardSetState(SCE_C_DEFAULT);\n\t\t\t}\n\t\t} else if (sc.state == SCE_C_REGEX) {\n\t\t\tif (sc.ch == '\\r' || sc.ch == '\\n' || sc.ch == '\/') {\n\t\t\t\tsc.ForwardSetState(SCE_C_DEFAULT);\n\t\t\t} else if (sc.ch == '\\\\') {\n\t\t\t\t\/\/ Gobble up the quoted character\n\t\t\t\tif (sc.chNext == '\\\\' || sc.chNext == '\/') {\n\t\t\t\t\tsc.Forward();\n\t\t\t\t}\n\t\t\t}\n\t\t} else if (sc.state == SCE_C_VERBATIM) {\n\t\t\tif (sc.ch == '\\\"') {\n\t\t\t\tif (sc.chNext == '\\\"') {\n\t\t\t\t\tsc.Forward();\n\t\t\t\t} else {\n\t\t\t\t\tsc.ForwardSetState(SCE_C_DEFAULT);\n\t\t\t\t}\n\t\t\t}\n\t\t} else if (sc.state == SCE_C_UUID) {\n\t\t\tif (sc.ch == '\\r' || sc.ch == '\\n' || sc.ch == ')') {\n\t\t\t\tsc.SetState(SCE_C_DEFAULT);\n\t\t\t}\n\t\t}\n\n\t\t\/\/ Determine if a new state should be entered.\n\t\tif (sc.state == SCE_C_DEFAULT) {\n\t\t\tif (sc.Match('@', '\\\"')) {\n\t\t\t\tsc.SetState(SCE_C_VERBATIM);\n\t\t\t\tsc.Forward();\n\t\t\t} else if (IsADigit(sc.ch) || (sc.ch == '.' && IsADigit(sc.chNext))) {\n\t\t\t\tif (lastWordWasUUID) {\n\t\t\t\t\tsc.SetState(SCE_C_UUID);\n\t\t\t\t\tlastWordWasUUID = false;\n\t\t\t\t} else {\n\t\t\t\t\tsc.SetState(SCE_C_NUMBER);\n\t\t\t\t}\n\t\t\t} else if (IsAWordStart(sc.ch) || (sc.ch == '@')) {\n\t\t\t\tif (lastWordWasUUID) {\n\t\t\t\t\tsc.SetState(SCE_C_UUID);\n\t\t\t\t\tlastWordWasUUID = false;\n\t\t\t\t} else {\n\t\t\t\t\tsc.SetState(SCE_C_IDENTIFIER);\n\t\t\t\t}\n\t\t\t} else if (sc.Match('\/', '*')) {\n\t\t\t\tif (sc.Match(\"\/**\") || sc.Match(\"\/*!\")) {\t\/\/ Support of Qt\/Doxygen doc. style\n\t\t\t\t\tsc.SetState(SCE_C_COMMENTDOC);\n\t\t\t\t} else {\n\t\t\t\t\tsc.SetState(SCE_C_COMMENT);\n\t\t\t\t}\n\t\t\t\tsc.Forward();\t\/\/ Eat the * so it isn't used for the end of the comment\n\t\t\t} else if (sc.Match('\/', '\/')) {\n\t\t\t\tif (sc.Match(\"\/\/\/\") || sc.Match(\"\/\/!\"))\t\/\/ Support of Qt\/Doxygen doc. style\n\t\t\t\t\tsc.SetState(SCE_C_COMMENTLINEDOC);\n\t\t\t\telse\n\t\t\t\t\tsc.SetState(SCE_C_COMMENTLINE);\n\t\t\t} else if (sc.ch == '\/' && IsOKBeforeRE(chPrevNonWhite)) {\n\t\t\t\tsc.SetState(SCE_C_REGEX);\n\t\t\t} else if (sc.ch == '\\\"') {\n\t\t\t\tsc.SetState(SCE_C_STRING);\n\t\t\t} else if (sc.ch == '\\'') {\n\t\t\t\tsc.SetState(SCE_C_CHARACTER);\n\t\t\t} else if (sc.ch == '#' && visibleChars == 0) {\n\t\t\t\t\/\/ Preprocessor commands are alone on their line\n\t\t\t\tsc.SetState(SCE_C_PREPROCESSOR);\n\t\t\t\t\/\/ Skip whitespace between # and preprocessor word\n\t\t\t\tdo {\n\t\t\t\t\tsc.Forward();\n\t\t\t\t} while ((sc.ch == ' ') && (sc.ch == '\\t') && sc.More());\n\t\t\t\tif (sc.atLineEnd) {\n\t\t\t\t\tsc.SetState(SCE_C_DEFAULT);\n\t\t\t\t}\n\t\t\t} else if (isoperator(static_cast<char>(sc.ch))) {\n\t\t\t\tsc.SetState(SCE_C_OPERATOR);\n\t\t\t}\n\t\t}\n\t\t\n\t\tif (sc.atLineEnd) {\n\t\t\t\/\/ Reset states to begining of colourise so no surprises \n\t\t\t\/\/ if different sets of lines lexed.\n\t\t\tchPrevNonWhite = ' ';\n\t\t\tvisibleChars = 0;\n\t\t\tlastWordWasUUID = false;\n\t\t}\n\t\tif (!IsASpace(sc.ch)) {\n\t\t\tchPrevNonWhite = sc.ch;\n\t\t\tvisibleChars++;\n\t\t}\n\t}\n\tsc.Complete();\n}\n\nstatic void FoldCppDoc(unsigned int startPos, int length, int initStyle, WordList *[],\n Accessor &styler) {\n\tbool foldComment = styler.GetPropertyInt(\"fold.comment\") != 0;\n\tbool foldCompact = styler.GetPropertyInt(\"fold.compact\", 1) != 0;\n\tunsigned int endPos = startPos + length;\n\tint visibleChars = 0;\n\tint lineCurrent = styler.GetLine(startPos);\n\tint levelPrev = styler.LevelAt(lineCurrent) & SC_FOLDLEVELNUMBERMASK;\n\tint levelCurrent = levelPrev;\n\tchar chNext = styler[startPos];\n\tint styleNext = styler.StyleAt(startPos);\n\tint style = initStyle;\n\tfor (unsigned int i = startPos; i < endPos; i++) {\n\t\tchar ch = chNext;\n\t\tchNext = styler.SafeGetCharAt(i + 1);\n\t\tint stylePrev = style;\n\t\tstyle = styleNext;\n\t\tstyleNext = styler.StyleAt(i + 1);\n\t\tbool atEOL = (ch == '\\r' && chNext != '\\n') || (ch == '\\n');\n\t\tif (foldComment &&\n\t\t\t(style == SCE_C_COMMENT || style == SCE_C_COMMENTDOC)) {\n\t\t\tif (style != stylePrev) {\n\t\t\t\tlevelCurrent++;\n\t\t\t} else if ((style != styleNext) && !atEOL) {\n\t\t\t\t\/\/ Comments don't end at end of line and the next character may be unstyled.\n\t\t\t\tlevelCurrent--;\n\t\t\t}\n\t\t}\n\t\tif (style == SCE_C_OPERATOR) {\n\t\t\tif (ch == '{') {\n\t\t\t\tlevelCurrent++;\n\t\t\t} else if (ch == '}') {\n\t\t\t\tlevelCurrent--;\n\t\t\t}\n\t\t}\n\t\tif (atEOL) {\n\t\t\tint lev = levelPrev;\n\t\t\tif (visibleChars == 0 && foldCompact)\n\t\t\t\tlev |= SC_FOLDLEVELWHITEFLAG;\n\t\t\tif ((levelCurrent > levelPrev) && (visibleChars > 0))\n\t\t\t\tlev |= SC_FOLDLEVELHEADERFLAG;\n\t\t\tif (lev != styler.LevelAt(lineCurrent)) {\n\t\t\t\tstyler.SetLevel(lineCurrent, lev);\n\t\t\t}\n\t\t\tlineCurrent++;\n\t\t\tlevelPrev = levelCurrent;\n\t\t\tvisibleChars = 0;\n\t\t}\n\t\tif (!isspacechar(ch))\n\t\t\tvisibleChars++;\n\t}\n\t\/\/ Fill in the real level of the next line, keeping the current flags as they will be filled in later\n\tint flagsNext = styler.LevelAt(lineCurrent) & ~SC_FOLDLEVELNUMBERMASK;\n\tstyler.SetLevel(lineCurrent, levelPrev | flagsNext);\n}\n\nLexerModule lmCPP(SCLEX_CPP, ColouriseCppDoc, \"cpp\", FoldCppDoc);\nLexerModule lmTCL(SCLEX_TCL, ColouriseCppDoc, \"tcl\", FoldCppDoc);\n<|endoftext|>"} {"text":"<commit_before>\/*\n * Copyright (C) 1998-2001, The University of Queensland\n * Copyright (C) 2000-2001, Sun Microsystems, Inc\n * Copyright (C) 2002, Trent Waddington\n *\n * See the file \"LICENSE.TERMS\" for information on usage and\n * redistribution of this file, and for a DISCLAIMER OF ALL\n * WARRANTIES.\n *\n *\/\n\n\/***************************************************************************\/\/**\n * \\file rtl.cpp\n * \\brief Implementation of the classes that describe a low level RTL (\n * register transfer list)\n ******************************************************************************\/\n\n\/*\n * $Revision$ \/\/ 1.33.2.3\n *\n * 08 Apr 02 - Mike: Changes for boomerang\n * 13 May 02 - Mike: expList is no longer a pointer\n * 15 May 02 - Mike: Fixed a nasty bug in updateExp (when update with same\n * expression as existing)\n * 25 Jul 02 - Mike: RTL is now list of Statements\n *\/\n\n#include <cassert>\n#if defined(_MSC_VER) && _MSC_VER <= 1200\n#pragma warning(disable:4786)\n#endif\n\n#include <iomanip> \/\/ For setfill\n#include <sstream>\n#include <cstring>\n#include \"types.h\"\n#include \"statement.h\"\n#include \"exp.h\"\n#include \"type.h\"\n#include \"register.h\"\n#include \"cfg.h\"\n#include \"proc.h\" \/\/ For printing proc names\n#include \"rtl.h\"\n#include \"prog.h\"\n#include \"hllcode.h\"\n#include \"util.h\"\n#include \"boomerang.h\"\n#include \"visitor.h\"\n#include \"log.h\"\n\/\/ For some reason, MSVC 5.00 complains about use of undefined types a lot\n#if defined(_MSC_VER) && _MSC_VER <= 1100\n#include \"signature.h\" \/\/ For MSVC 5.00\n#endif\n\n\/******************************************************************************\n * RTL methods.\n * Class RTL represents low-level register transfer lists.\n *****************************************************************************\/\n\nRTL::RTL()\n : nativeAddr(ADDRESS::g(0L))\n{ }\n\n\/***************************************************************************\/\/**\n * \\brief Constructor.\n * \\param instNativeAddr - the native address of the instruction\n * \\param listStmt - ptr to existing list of Statement\n *\n ******************************************************************************\/\nRTL::RTL(ADDRESS instNativeAddr, const std::list<Statement*>* listStmt \/*= nullptr*\/)\n : nativeAddr(instNativeAddr) {\n if (listStmt)\n *(std::list<Statement*>*)this = *listStmt;\n}\n\n\/***************************************************************************\/\/**\n * \\brief Copy constructor. A deep clone is made of the given object\n * so that the lists of Exps do not share memory.\n * \\param other RTL to copy from\n ******************************************************************************\/\nRTL::RTL(const RTL& other) : nativeAddr(other.nativeAddr) {\n for (auto it = other.begin(); it != other.end(); it++) {\n push_back((*it)->clone());\n }\n}\n\n\/***************************************************************************\/\/**\n * \\brief Assignment copy (deep).\n * \\param other - RTL to copy\n * \\returns a reference to this object\n ******************************************************************************\/\nRTL& RTL::operator=(const RTL& other) {\n if (this != &other) {\n \/\/ Do a deep copy always\n clear();\n const_iterator it;\n for (it = other.begin(); it != other.end(); it++)\n push_back((*it)->clone());\n\n nativeAddr = other.nativeAddr;\n }\n return *this;\n}\n\n\/\/ Return a deep copy, including a deep copy of the list of Statements\n\/***************************************************************************\/\/**\n * \\brief Deep copy clone; deleting the clone will not affect this\n * RTL object\n * \\returns Pointer to a new RTL that is a clone of this one\n ******************************************************************************\/\nRTL* RTL::clone() const {\n std::list<Statement*> le;\n for (const_iterator it = begin(); it != end(); it++) {\n le.push_back((*it)->clone());\n }\n return new RTL(nativeAddr, &le);\n}\n\n\/***************************************************************************\/\/**\n * \\brief Make a copy of this RTLs list of Exp* to the given list\n * \\param dest Ref to empty list to copy to\n ******************************************************************************\/\nvoid RTL::deepCopyList(std::list<Statement*>& dest) const {\n for (Statement * it : *this) {\n dest.push_back(it->clone());\n }\n}\n\n\/***************************************************************************\/\/**\n * \\brief Append the given Statement at the end of this RTL\n * \\note Exception: Leaves any flag call at the end (so may push exp\n * to second last position, instead of last)\n * \\note stmt is NOT copied. This is different to how UQBT was!\n * \\param s pointer to Statement to append\n ******************************************************************************\/\nvoid RTL::appendStmt(Statement* s) {\n assert(s!=nullptr);\n if (not empty()) {\n if (back()->isFlagAssgn()) {\n iterator it = end();\n insert(--it, s);\n return;\n }\n }\n push_back(s);\n}\n\n\/***************************************************************************\/\/**\n * \\brief Append a given list of Statements to this RTL\n * \\note A copy of the Statements in le are appended\n * \\param rtl list of Statements to insert\n ******************************************************************************\/\nvoid RTL::appendListStmt(std::list<Statement*>& le) {\n for (Statement * it : le) {\n push_back(it->clone());\n }\n}\n\n\/***************************************************************************\/\/**\n * \\brief Prints this object to a stream in text form.\n * \\param os - stream to output to (often cout or cerr)\n ******************************************************************************\/\nvoid RTL::print(std::ostream& os \/*= cout*\/, bool html \/*=false*\/) const {\n\n if (html)\n os << \"<tr><td>\";\n \/\/ print out the instruction address of this RTL\n os << std::hex << std::setfill('0') << std::setw(8) << nativeAddr;\n os << std::dec << std::setfill(' '); \/\/ Ugh - why is this needed?\n if (html)\n os << \"<\/td>\";\n\n \/\/ Print the statements\n \/\/ First line has 8 extra chars as above\n bool bFirst = true;\n for (Statement * stmt : *this) {\n if (html) {\n if (!bFirst) os << \"<tr><td><\/td>\";\n os << \"<td width=\\\"50\\\" align=\\\"center\\\">\";\n } else {\n if (bFirst) os << \" \";\n else os << std::setw(9) << \" \";\n }\n if (stmt)\n stmt->print(os, html);\n \/\/ Note: we only put newlines where needed. So none at the end of\n \/\/ Statement::print; one here to separate from other statements\n if (html)\n os << \"<\/td><\/tr>\";\n os << \"\\n\";\n bFirst = false;\n }\n if (empty())\n os << std::endl; \/\/ New line for NOP\n}\n\nvoid RTL::dump() {\n print(std::cerr);\n}\n\nextern char debug_buffer[];\n\nchar* RTL::prints() const {\n std::ostringstream ost;\n print(ost);\n strncpy(debug_buffer, ost.str().c_str(), DEBUG_BUFSIZE-1);\n debug_buffer[DEBUG_BUFSIZE-1] = '\\0';\n return debug_buffer;\n}\n\n\/***************************************************************************\/\/**\n * \\brief Output operator for RTL*\n * Just makes it easier to use e.g. std::cerr << myRTLptr\n * \\param os output stream to send to\n * \\param r ptr to RTL to print to the stream\n * \\returns os (for concatenation)\n ******************************************************************************\/\nstd::ostream& operator<<(std::ostream& os, const RTL* r) {\n if (r == nullptr) {\n os << \"nullptr \";\n return os;\n }\n r->print(os);\n return os;\n}\n\n\/***************************************************************************\/\/**\n * \\brief Return true if this RTL affects the condition codes\n * \\note Assumes that if there is a flag call Exp, then it is the last\n * \\returns Boolean as above\n ******************************************************************************\/\nbool RTL::areFlagsAffected() {\n if (this->empty())\n return false;\n Statement *e = this->back();\n \/\/ If it is a flag call, then the CCs are affected\n return e->isFlagAssgn();\n}\n\nvoid RTL::simplify() {\n for (iterator it = this->begin(); it != this->end(); ) {\n Statement *s = *it;\n s->simplify();\n if (s->isBranch()) {\n Exp *cond = ((BranchStatement*)s)->getCondExpr();\n if (cond && cond->getOper() == opIntConst) {\n if (((Const*)cond)->getInt() == 0) {\n if (VERBOSE)\n LOG << \"removing branch with false condition at \" << getAddress() << \" \" << *it << \"\\n\";\n it = this->erase(it);\n continue;\n } else {\n if (VERBOSE)\n LOG << \"replacing branch with true condition with goto at \" << getAddress() << \" \" << *it <<\n \"\\n\";\n *it = new GotoStatement(((BranchStatement*)s)->getFixedDest());\n }\n }\n } else if (s->isAssign()) {\n Exp* guard = ((Assign*)s)->getGuard();\n if (guard && (guard->isFalse() || (guard->isIntConst() && ((Const*)guard)->getInt() == 0))) {\n \/\/ This assignment statement can be deleted\n if (VERBOSE)\n LOG << \"removing assignment with false guard at \" << getAddress() << \" \" << *it << \"\\n\";\n it = this->erase(it);\n continue;\n }\n }\n it++;\n }\n}\n\/\/ Is this RTL a compare instruction? If so, the passed register and compared value (a semantic string) are set.\n\nbool RTL::isCall() {\n if (this->empty())\n return false;\n Statement* last = this->back();\n return last->getKind() == STMT_CALL;\n}\n\n\/\/ Use this slow function when you can't be sure that the HL Statement is last\n\/\/ Get the \"special\" (High Level) Statement this RTL (else nullptr)\nStatement* RTL::getHlStmt() {\n reverse_iterator rit;\n for (rit = this->rbegin(); rit != this->rend(); rit++) {\n if ((*rit)->getKind() != STMT_ASSIGN)\n return *rit;\n }\n return nullptr;\n}\n\n\/\/int RTL::setConscripts(int n, bool bClear) {\n\/\/ StmtConscriptSetter ssc(n, bClear);\n\/\/ accept(&ssc);\n\/\/ return ssc.getLast();\n\/\/}\n<commit_msg>A small cleanup for rtl.cpp<commit_after>\/*\n * Copyright (C) 1998-2001, The University of Queensland\n * Copyright (C) 2000-2001, Sun Microsystems, Inc\n * Copyright (C) 2002, Trent Waddington\n *\n * See the file \"LICENSE.TERMS\" for information on usage and\n * redistribution of this file, and for a DISCLAIMER OF ALL\n * WARRANTIES.\n *\n *\/\n\n\/***************************************************************************\/\/**\n * \\file rtl.cpp\n * \\brief Implementation of the classes that describe a low level RTL (\n * register transfer list)\n ******************************************************************************\/\n\n\/*\n * $Revision$ \/\/ 1.33.2.3\n *\n * 08 Apr 02 - Mike: Changes for boomerang\n * 13 May 02 - Mike: expList is no longer a pointer\n * 15 May 02 - Mike: Fixed a nasty bug in updateExp (when update with same\n * expression as existing)\n * 25 Jul 02 - Mike: RTL is now list of Statements\n *\/\n\n#include <cassert>\n#if defined(_MSC_VER) && _MSC_VER <= 1200\n#pragma warning(disable:4786)\n#endif\n\n#include <iomanip> \/\/ For setfill\n#include <sstream>\n#include <cstring>\n#include \"types.h\"\n#include \"statement.h\"\n#include \"exp.h\"\n#include \"type.h\"\n#include \"register.h\"\n#include \"cfg.h\"\n#include \"proc.h\" \/\/ For printing proc names\n#include \"rtl.h\"\n#include \"prog.h\"\n#include \"hllcode.h\"\n#include \"util.h\"\n#include \"boomerang.h\"\n#include \"visitor.h\"\n#include \"log.h\"\n\/\/ For some reason, MSVC 5.00 complains about use of undefined types a lot\n#if defined(_MSC_VER) && _MSC_VER <= 1100\n#include \"signature.h\" \/\/ For MSVC 5.00\n#endif\n\n\/******************************************************************************\n * RTL methods.\n * Class RTL represents low-level register transfer lists.\n *****************************************************************************\/\n\nRTL::RTL()\n : nativeAddr(ADDRESS::g(0L))\n{ }\n\n\/***************************************************************************\/\/**\n * \\brief Constructor.\n * \\param instNativeAddr - the native address of the instruction\n * \\param listStmt - ptr to existing list of Statement\n *\n ******************************************************************************\/\nRTL::RTL(ADDRESS instNativeAddr, const std::list<Statement*>* listStmt \/*= nullptr*\/)\n : nativeAddr(instNativeAddr) {\n if (listStmt)\n *(std::list<Statement*>*)this = *listStmt;\n}\n\n\/***************************************************************************\/\/**\n * \\brief Copy constructor. A deep clone is made of the given object\n * so that the lists of Exps do not share memory.\n * \\param other RTL to copy from\n ******************************************************************************\/\nRTL::RTL(const RTL& other) : nativeAddr(other.nativeAddr) {\n for (auto it = other.begin(); it != other.end(); it++) {\n push_back((*it)->clone());\n }\n}\n\n\/***************************************************************************\/\/**\n * \\brief Assignment copy (deep).\n * \\param other - RTL to copy\n * \\returns a reference to this object\n ******************************************************************************\/\nRTL& RTL::operator=(const RTL& other) {\n if (this != &other) {\n \/\/ Do a deep copy always\n clear();\n const_iterator it;\n for (it = other.begin(); it != other.end(); it++)\n push_back((*it)->clone());\n\n nativeAddr = other.nativeAddr;\n }\n return *this;\n}\n\n\/\/ Return a deep copy, including a deep copy of the list of Statements\n\/***************************************************************************\/\/**\n * \\brief Deep copy clone; deleting the clone will not affect this\n * RTL object\n * \\returns Pointer to a new RTL that is a clone of this one\n ******************************************************************************\/\nRTL* RTL::clone() const {\n std::list<Statement*> le;\n for (const_iterator it = begin(); it != end(); it++) {\n le.push_back((*it)->clone());\n }\n return new RTL(nativeAddr, &le);\n}\n\n\/***************************************************************************\/\/**\n * \\brief Make a copy of this RTLs list of Exp* to the given list\n * \\param dest Ref to empty list to copy to\n ******************************************************************************\/\nvoid RTL::deepCopyList(std::list<Statement*>& dest) const {\n for (Statement * it : *this) {\n dest.push_back(it->clone());\n }\n}\n\n\/***************************************************************************\/\/**\n * \\brief Append the given Statement at the end of this RTL\n * \\note Exception: Leaves any flag call at the end (so may push exp\n * to second last position, instead of last)\n * \\note stmt is NOT copied. This is different to how UQBT was!\n * \\param s pointer to Statement to append\n ******************************************************************************\/\nvoid RTL::appendStmt(Statement* s) {\n assert(s!=nullptr);\n if (not empty()) {\n if (back()->isFlagAssgn()) {\n iterator it = end();\n insert(--it, s);\n return;\n }\n }\n push_back(s);\n}\n\n\/***************************************************************************\/\/**\n * \\brief Append a given list of Statements to this RTL\n * \\note A copy of the Statements in le are appended\n * \\param rtl list of Statements to insert\n ******************************************************************************\/\nvoid RTL::appendListStmt(std::list<Statement*>& le) {\n for (Statement * it : le) {\n push_back(it->clone());\n }\n}\n\n\/***************************************************************************\/\/**\n * \\brief Prints this object to a stream in text form.\n * \\param os - stream to output to (often cout or cerr)\n ******************************************************************************\/\nvoid RTL::print(std::ostream& os \/*= cout*\/, bool html \/*=false*\/) const {\n\n if (html)\n os << \"<tr><td>\";\n \/\/ print out the instruction address of this RTL\n os << std::hex << std::setfill('0') << std::setw(8) << nativeAddr;\n os << std::dec << std::setfill(' '); \/\/ Ugh - why is this needed?\n if (html)\n os << \"<\/td>\";\n\n \/\/ Print the statements\n \/\/ First line has 8 extra chars as above\n bool bFirst = true;\n for (Statement * stmt : *this) {\n if (html) {\n if (!bFirst) os << \"<tr><td><\/td>\";\n os << \"<td width=\\\"50\\\" align=\\\"center\\\">\";\n } else {\n if (bFirst) os << \" \";\n else os << std::setw(9) << \" \";\n }\n if (stmt)\n stmt->print(os, html);\n \/\/ Note: we only put newlines where needed. So none at the end of\n \/\/ Statement::print; one here to separate from other statements\n if (html)\n os << \"<\/td><\/tr>\";\n os << \"\\n\";\n bFirst = false;\n }\n if (empty())\n os << std::endl; \/\/ New line for NOP\n}\n\nvoid RTL::dump() {\n print(std::cerr);\n}\n\nextern char debug_buffer[];\n\nchar* RTL::prints() const {\n std::ostringstream ost;\n print(ost);\n strncpy(debug_buffer, ost.str().c_str(), DEBUG_BUFSIZE-1);\n debug_buffer[DEBUG_BUFSIZE-1] = '\\0';\n return debug_buffer;\n}\n\n\/***************************************************************************\/\/**\n * \\brief Output operator for RTL*\n * Just makes it easier to use e.g. std::cerr << myRTLptr\n * \\param os output stream to send to\n * \\param r ptr to RTL to print to the stream\n * \\returns os (for concatenation)\n ******************************************************************************\/\nstd::ostream& operator<<(std::ostream& os, const RTL* r) {\n if (r == nullptr) {\n os << \"nullptr \";\n return os;\n }\n r->print(os);\n return os;\n}\n\n\/***************************************************************************\/\/**\n * \\brief Return true if this RTL affects the condition codes\n * \\note Assumes that if there is a flag call Exp, then it is the last\n * \\returns Boolean as above\n ******************************************************************************\/\nbool RTL::areFlagsAffected() {\n if (this->empty())\n return false;\n Statement *e = this->back();\n \/\/ If it is a flag call, then the CCs are affected\n return e->isFlagAssgn();\n}\n\nvoid RTL::simplify() {\n for (iterator it = begin(); it != end(); ) {\n Statement *s = *it;\n s->simplify();\n if (s->isBranch()) {\n Exp *cond = ((BranchStatement*)s)->getCondExpr();\n if (cond && cond->getOper() == opIntConst) {\n if (((Const*)cond)->getInt() == 0) {\n LOG_VERBOSE(1) << \"removing branch with false condition at \" << getAddress() << \" \" << *it << \"\\n\";\n it = this->erase(it);\n continue;\n }\n LOG_VERBOSE(1) << \"replacing branch with true condition with goto at \" << getAddress() << \" \" << *it <<\n \"\\n\";\n *it = new GotoStatement(((BranchStatement*)s)->getFixedDest());\n }\n } else if (s->isAssign()) {\n Exp* guard = ((Assign*)s)->getGuard();\n if (guard && (guard->isFalse() || (guard->isIntConst() && ((Const*)guard)->getInt() == 0))) {\n \/\/ This assignment statement can be deleted\n LOG_VERBOSE(1) << \"removing assignment with false guard at \" << getAddress() << \" \" << *it << \"\\n\";\n it = erase(it);\n continue;\n }\n }\n it++;\n }\n}\n\/\/ Is this RTL a compare instruction? If so, the passed register and compared value (a semantic string) are set.\n\nbool RTL::isCall() {\n if (empty())\n return false;\n Statement* last = this->back();\n return last->getKind() == STMT_CALL;\n}\n\n\/\/ Use this slow function when you can't be sure that the HL Statement is last\n\/\/ Get the \"special\" (High Level) Statement this RTL (else nullptr)\nStatement* RTL::getHlStmt() {\n reverse_iterator rit;\n for (rit = this->rbegin(); rit != this->rend(); rit++) {\n if ((*rit)->getKind() != STMT_ASSIGN)\n return *rit;\n }\n return nullptr;\n}\n<|endoftext|>"} {"text":"<commit_before>\/\/ Scintilla source code edit control\n\/** @file LexLua.cxx\n ** Lexer for Lua language.\n **\n ** Written by Paul Winwood.\n ** Folder by Alexey Yutkin.\n **\/\n\n#include <stdlib.h>\n#include <string.h>\n#include <ctype.h>\n#include <stdarg.h>\n#include <stdio.h>\n#include <fcntl.h>\n\n#include \"Platform.h\"\n\n#include \"PropSet.h\"\n#include \"Accessor.h\"\n#include \"KeyWords.h\"\n#include \"Scintilla.h\"\n#include \"SciLexer.h\"\n\ninline bool isLuaOperator(char ch) {\n\tif (isalnum(ch))\n\t\treturn false;\n\t\/\/ '.' left out as it is used to make up numbers\n\tif (ch == '*' || ch == '\/' || ch == '-' || ch == '+' ||\n\t ch == '(' || ch == ')' || ch == '=' ||\n\t ch == '{' || ch == '}' || ch == '~' ||\n\t ch == '[' || ch == ']' || ch == ';' ||\n\t ch == '<' || ch == '>' || ch == ',' ||\n\t ch == '.' || ch == '^' || ch == '%' || ch == ':')\n\t\treturn true;\n\treturn false;\n}\n\nstatic void classifyWordLua(unsigned int start,\n unsigned int end,\n WordList\t&keywords,\n Accessor\t&styler) {\n\tchar s[100];\n\tbool wordIsNumber = isdigit(styler[start]) || (styler[start] == '.');\n\n\tfor (unsigned int i = 0; i < end - start + 1 && i < 30; i++) {\n\t\ts[i] = styler[start + i];\n\t\ts[i + 1] = '\\0';\n\t}\n\n\tchar chAttr = SCE_LUA_IDENTIFIER;\n\n\tif (wordIsNumber)\n\t\tchAttr = SCE_LUA_NUMBER;\n\telse {\n\t\tif (keywords.InList(s)) {\n\t\t\tchAttr = SCE_LUA_WORD;\n\t\t}\n\t}\n\tstyler.ColourTo(end, chAttr);\n}\n\nstatic void ColouriseLuaDoc(unsigned int startPos,\n int length,\n int initStyle,\n WordList *keywordlists[],\n Accessor &styler) {\n\n\tWordList &keywords = *keywordlists[0];\n\n\tstyler.StartAt(startPos);\n\tstyler.GetLine(startPos);\n\n\tint state = initStyle;\n\tchar chPrev = ' ';\n\tchar chNext = styler[startPos];\n\tunsigned int lengthDoc = startPos + length;\n\tbool firstChar = true;\n\tint literalString = 0;\n\n\tstyler.StartSegment(startPos);\n\tfor (unsigned int i = startPos; i <= lengthDoc; i++) {\n\t\tchar ch = chNext;\n\t\tchNext = styler.SafeGetCharAt(i + 1);\n\n\t\tif (styler.IsLeadByte(ch)) {\n\t\t\tchNext = styler.SafeGetCharAt(i + 2);\n\t\t\tchPrev = ' ';\n\t\t\ti += 1;\n\t\t\tcontinue;\n\t\t}\n\n\t\tif (state == SCE_LUA_STRINGEOL) {\n\t\t\tif (ch != '\\r' && ch != '\\n') {\n\t\t\t\tstyler.ColourTo(i - 1, state);\n\t\t\t\tstate = SCE_LUA_DEFAULT;\n\t\t\t}\n\t\t}\n\n\t\tif (state == SCE_LUA_LITERALSTRING && ch == '[' && chNext == '[') {\n\t\t\tliteralString++;\n\t\t} else if (state == SCE_LUA_DEFAULT) {\n\t\t\tif (ch == '-' && chNext == '-') {\n\t\t\t\tstyler.ColourTo(i - 1, state);\n\t\t\t\tstate = SCE_LUA_COMMENTLINE;\n\t\t\t} else if (ch == '[' && chNext == '[') {\n\t\t\t\tstate = SCE_LUA_LITERALSTRING;\n\t\t\t\tliteralString = 1;\n\t\t\t} else if (ch == '\\\"') {\n\t\t\t\tstyler.ColourTo(i - 1, state);\n\t\t\t\tstate = SCE_LUA_STRING;\n\t\t\t} else if (ch == '\\'') {\n\t\t\t\tstyler.ColourTo(i - 1, state);\n\t\t\t\tstate = SCE_LUA_CHARACTER;\n\t\t\t} else if (ch == '$' && firstChar) {\n\t\t\t\tstyler.ColourTo(i - 1, state);\n\t\t\t\tstate = SCE_LUA_PREPROCESSOR;\n\t\t\t} else if (ch == '#' && firstChar)\t\/\/ Should be only on the first line of the file! Cannot be tested here\n\t\t\t{\n\t\t\t\tstyler.ColourTo(i - 1, state);\n\t\t\t\tstate = SCE_LUA_COMMENTLINE;\n\t\t\t} else if (isLuaOperator(ch)) {\n\t\t\t\tstyler.ColourTo(i - 1, state);\n\t\t\t\tstyler.ColourTo(i, SCE_LUA_OPERATOR);\n\t\t\t} else if (iswordstart(ch)) {\n\t\t\t\tstyler.ColourTo(i - 1, state);\n\t\t\t\tstate = SCE_LUA_WORD;\n\t\t\t}\n\t\t} else if (state == SCE_LUA_WORD) {\n\t\t\tif (!iswordchar(ch)) {\n\t\t\t\tclassifyWordLua(styler.GetStartSegment(), i - 1, keywords, styler);\n\t\t\t\tstate = SCE_LUA_DEFAULT;\n\t\t\t\tif (ch == '[' && chNext == '[') {\n\t\t\t\t\tliteralString = 1;\n\t\t\t\t\tstate = SCE_LUA_LITERALSTRING;\n\t\t\t\t} else if (ch == '-' && chNext == '-') {\n\t\t\t\t\tstate = SCE_LUA_COMMENTLINE;\n\t\t\t\t} else if (ch == '\\\"') {\n\t\t\t\t\tstate = SCE_LUA_STRING;\n\t\t\t\t} else if (ch == '\\'') {\n\t\t\t\t\tstate = SCE_LUA_CHARACTER;\n\t\t\t\t} else if (ch == '$' && firstChar) {\n\t\t\t\t\tstate = SCE_LUA_PREPROCESSOR;\n\t\t\t\t} else if (isLuaOperator(ch)) {\n\t\t\t\t\tstyler.ColourTo(i, SCE_LUA_OPERATOR);\n\t\t\t\t}\n\t\t\t} else if (ch == '.' && chNext == '.') {\n\t\t\t\tclassifyWordLua(styler.GetStartSegment(), i - 1, keywords, styler);\n\t\t\t\tstyler.ColourTo(i, SCE_LUA_OPERATOR);\n\t\t\t\tstate = SCE_LUA_DEFAULT;\n\t\t\t}\n\t\t} else {\n\t\t\tif (state == SCE_LUA_LITERALSTRING) {\n\t\t\t\tif (ch == ']' && (chPrev == ']') && (--literalString == 0)) {\n\t\t\t\t\tstyler.ColourTo(i, state);\n\t\t\t\t\tstate = SCE_LUA_DEFAULT;\n\t\t\t\t}\n\t\t\t} else if (state == SCE_LUA_PREPROCESSOR) {\n\t\t\t\tif ((ch == '\\r' || ch == '\\n') && (chPrev != '\\\\')) {\n\t\t\t\t\tstyler.ColourTo(i - 1, state);\n\t\t\t\t\tstate = SCE_LUA_DEFAULT;\n\t\t\t\t}\n\t\t\t} else if (state == SCE_LUA_COMMENTLINE) {\n\t\t\t\tif (ch == '\\r' || ch == '\\n') {\n\t\t\t\t\tstyler.ColourTo(i - 1, state);\n\t\t\t\t\tstate = SCE_LUA_DEFAULT;\n\t\t\t\t}\n\t\t\t} else if (state == SCE_LUA_STRING) {\n\t\t\t\tif ((ch == '\\r' || ch == '\\n') && (chPrev != '\\\\')) {\n\t\t\t\t\tstyler.ColourTo(i - 1, state);\n\t\t\t\t\tstate = SCE_LUA_STRINGEOL;\n\t\t\t\t} else if (ch == '\\\\') {\n\t\t\t\t\tif (chNext == '\\\"' || chNext == '\\\\') {\n\t\t\t\t\t\ti++;\n\t\t\t\t\t\tch = chNext;\n\t\t\t\t\t\tchNext = styler.SafeGetCharAt(i + 1);\n\t\t\t\t\t}\n\t\t\t\t} else if (ch == '\\\"') {\n\t\t\t\t\tstyler.ColourTo(i, state);\n\t\t\t\t\tstate = SCE_LUA_DEFAULT;\n\t\t\t\t\ti++;\n\t\t\t\t\tch = chNext;\n\t\t\t\t\tchNext = styler.SafeGetCharAt(i + 1);\n\t\t\t\t}\n\t\t\t} else if (state == SCE_LUA_CHARACTER) {\n\t\t\t\tif ((ch == '\\r' || ch == '\\n') && (chPrev != '\\\\')) {\n\t\t\t\t\tstyler.ColourTo(i - 1, state);\n\t\t\t\t\tstate = SCE_LUA_STRINGEOL;\n\t\t\t\t} else if (ch == '\\\\') {\n\t\t\t\t\tif (chNext == '\\'' || chNext == '\\\\') {\n\t\t\t\t\t\ti++;\n\t\t\t\t\t\tch = chNext;\n\t\t\t\t\t\tchNext = styler.SafeGetCharAt(i + 1);\n\t\t\t\t\t}\n\t\t\t\t} else if (ch == '\\'') {\n\t\t\t\t\tstyler.ColourTo(i, state);\n\t\t\t\t\tstate = SCE_LUA_DEFAULT;\n\t\t\t\t\ti++;\n\t\t\t\t\tch = chNext;\n\t\t\t\t\tchNext = styler.SafeGetCharAt(i + 1);\n\t\t\t\t}\n\t\t\t}\n\n\t\t\tif (state == SCE_LUA_DEFAULT) {\n\t\t\t\tif (ch == '-' && chNext == '-') {\n\t\t\t\t\tstate = SCE_LUA_COMMENTLINE;\n\t\t\t\t} else if (ch == '\\\"') {\n\t\t\t\t\tstate = SCE_LUA_STRING;\n\t\t\t\t} else if (ch == '\\'') {\n\t\t\t\t\tstate = SCE_LUA_CHARACTER;\n\t\t\t\t} else if (ch == '$' && firstChar) {\n\t\t\t\t\tstate = SCE_LUA_PREPROCESSOR;\n\t\t\t\t} else if (iswordstart(ch)) {\n\t\t\t\t\tstate = SCE_LUA_WORD;\n\t\t\t\t} else if (isLuaOperator(ch)) {\n\t\t\t\t\tstyler.ColourTo(i, SCE_LUA_OPERATOR);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tchPrev = ch;\n\t\tfirstChar = (ch == '\\r' || ch == '\\n');\n\t}\n\tstyler.ColourTo(lengthDoc - 1, state);\n}\n\nstatic void FoldLuaDoc(unsigned int startPos, int length, int initStyle, WordList *[],\n Accessor &styler) {\n\tunsigned int lengthDoc = startPos + length;\n\tint visibleChars = 0;\n\tint lineCurrent = styler.GetLine(startPos);\n\tint levelPrev = styler.LevelAt(lineCurrent) & SC_FOLDLEVELNUMBERMASK;\n\tint levelCurrent = levelPrev;\n\tchar chNext = styler[startPos];\n\tint styleNext = styler.StyleAt(startPos);\n\tint style = initStyle;\n\tchar s[10];\n\tfor (unsigned int i = startPos; i < lengthDoc; i++) {\n\t\tchar ch = chNext;\n\t\tchNext = styler.SafeGetCharAt(i + 1);\n\t\tstyle = styleNext;\n\t\tstyleNext = styler.StyleAt(i + 1);\n\t\tbool atEOL = (ch == '\\r' && chNext != '\\n') || (ch == '\\n');\n\t\tif (style == SCE_LUA_WORD)\n\t\t\tif ( ch == 'e' || ch == 't' || ch == 'd' || ch == 'f') {\n\t\t\t\tfor (unsigned int j = 0; j < 8; j++) {\n\t\t\t\t\tif (!iswordchar(styler[i + j])) break;\n\t\t\t\t\ts[j] = styler[i + j];\n\t\t\t\t\ts[j + 1] = '\\0';\n\t\t\t\t}\n\n\t\t\t\tif ((strcmp(s, \"then\") == 0) || (strcmp(s, \"do\") == 0)\n\t\t\t\t || (strcmp(s, \"function\") == 0))\n\t\t\t\t\tlevelCurrent++;\n\t\t\t\tif (strcmp(s, \"end\") == 0) levelCurrent--;\n\t\t\t}\n\n\t\tif (atEOL) {\n\t\t\tint lev = levelPrev;\n\t\t\tif (visibleChars == 0)\n\t\t\t\tlev |= SC_FOLDLEVELWHITEFLAG;\n\t\t\tif ((levelCurrent > levelPrev) && (visibleChars > 0))\n\t\t\t\tlev |= SC_FOLDLEVELHEADERFLAG;\n\t\t\tif (lev != styler.LevelAt(lineCurrent)) {\n\t\t\t\tstyler.SetLevel(lineCurrent, lev);\n\t\t\t}\n\t\t\tlineCurrent++;\n\t\t\tlevelPrev = levelCurrent;\n\t\t\tvisibleChars = 0;\n\t\t}\n\t\tif (!isspacechar(ch))\n\t\t\tvisibleChars++;\n\t}\n\t\/\/ Fill in the real level of the next line, keeping the current flags as they will be filled in later\n\tint flagsNext = styler.LevelAt(lineCurrent) & ~SC_FOLDLEVELNUMBERMASK;\n\tstyler.SetLevel(lineCurrent, levelPrev | flagsNext);\n}\n\nLexerModule lmLua(SCLEX_LUA, ColouriseLuaDoc, \"lua\", FoldLuaDoc);\n<commit_msg>Simplified because of warnings.<commit_after>\/\/ Scintilla source code edit control\n\/** @file LexLua.cxx\n ** Lexer for Lua language.\n **\n ** Written by Paul Winwood.\n ** Folder by Alexey Yutkin.\n **\/\n\n#include <stdlib.h>\n#include <string.h>\n#include <ctype.h>\n#include <stdarg.h>\n#include <stdio.h>\n#include <fcntl.h>\n\n#include \"Platform.h\"\n\n#include \"PropSet.h\"\n#include \"Accessor.h\"\n#include \"KeyWords.h\"\n#include \"Scintilla.h\"\n#include \"SciLexer.h\"\n\ninline bool isLuaOperator(char ch) {\n\tif (isalnum(ch))\n\t\treturn false;\n\t\/\/ '.' left out as it is used to make up numbers\n\tif (ch == '*' || ch == '\/' || ch == '-' || ch == '+' ||\n\t ch == '(' || ch == ')' || ch == '=' ||\n\t ch == '{' || ch == '}' || ch == '~' ||\n\t ch == '[' || ch == ']' || ch == ';' ||\n\t ch == '<' || ch == '>' || ch == ',' ||\n\t ch == '.' || ch == '^' || ch == '%' || ch == ':')\n\t\treturn true;\n\treturn false;\n}\n\nstatic void classifyWordLua(unsigned int start,\n unsigned int end,\n WordList\t&keywords,\n Accessor\t&styler) {\n\tchar s[100];\n\tbool wordIsNumber = isdigit(styler[start]) || (styler[start] == '.');\n\n\tfor (unsigned int i = 0; i < end - start + 1 && i < 30; i++) {\n\t\ts[i] = styler[start + i];\n\t\ts[i + 1] = '\\0';\n\t}\n\n\tchar chAttr = SCE_LUA_IDENTIFIER;\n\n\tif (wordIsNumber)\n\t\tchAttr = SCE_LUA_NUMBER;\n\telse {\n\t\tif (keywords.InList(s)) {\n\t\t\tchAttr = SCE_LUA_WORD;\n\t\t}\n\t}\n\tstyler.ColourTo(end, chAttr);\n}\n\nstatic void ColouriseLuaDoc(unsigned int startPos,\n int length,\n int initStyle,\n WordList *keywordlists[],\n Accessor &styler) {\n\n\tWordList &keywords = *keywordlists[0];\n\n\tstyler.StartAt(startPos);\n\tstyler.GetLine(startPos);\n\n\tint state = initStyle;\n\tchar chPrev = ' ';\n\tchar chNext = styler[startPos];\n\tunsigned int lengthDoc = startPos + length;\n\tbool firstChar = true;\n\tint literalString = 0;\n\n\tstyler.StartSegment(startPos);\n\tfor (unsigned int i = startPos; i <= lengthDoc; i++) {\n\t\tchar ch = chNext;\n\t\tchNext = styler.SafeGetCharAt(i + 1);\n\n\t\tif (styler.IsLeadByte(ch)) {\n\t\t\tchNext = styler.SafeGetCharAt(i + 2);\n\t\t\tchPrev = ' ';\n\t\t\ti += 1;\n\t\t\tcontinue;\n\t\t}\n\n\t\tif (state == SCE_LUA_STRINGEOL) {\n\t\t\tif (ch != '\\r' && ch != '\\n') {\n\t\t\t\tstyler.ColourTo(i - 1, state);\n\t\t\t\tstate = SCE_LUA_DEFAULT;\n\t\t\t}\n\t\t}\n\n\t\tif (state == SCE_LUA_LITERALSTRING && ch == '[' && chNext == '[') {\n\t\t\tliteralString++;\n\t\t} else if (state == SCE_LUA_DEFAULT) {\n\t\t\tif (ch == '-' && chNext == '-') {\n\t\t\t\tstyler.ColourTo(i - 1, state);\n\t\t\t\tstate = SCE_LUA_COMMENTLINE;\n\t\t\t} else if (ch == '[' && chNext == '[') {\n\t\t\t\tstate = SCE_LUA_LITERALSTRING;\n\t\t\t\tliteralString = 1;\n\t\t\t} else if (ch == '\\\"') {\n\t\t\t\tstyler.ColourTo(i - 1, state);\n\t\t\t\tstate = SCE_LUA_STRING;\n\t\t\t} else if (ch == '\\'') {\n\t\t\t\tstyler.ColourTo(i - 1, state);\n\t\t\t\tstate = SCE_LUA_CHARACTER;\n\t\t\t} else if (ch == '$' && firstChar) {\n\t\t\t\tstyler.ColourTo(i - 1, state);\n\t\t\t\tstate = SCE_LUA_PREPROCESSOR;\n\t\t\t} else if (ch == '#' && firstChar)\t\/\/ Should be only on the first line of the file! Cannot be tested here\n\t\t\t{\n\t\t\t\tstyler.ColourTo(i - 1, state);\n\t\t\t\tstate = SCE_LUA_COMMENTLINE;\n\t\t\t} else if (isLuaOperator(ch)) {\n\t\t\t\tstyler.ColourTo(i - 1, state);\n\t\t\t\tstyler.ColourTo(i, SCE_LUA_OPERATOR);\n\t\t\t} else if (iswordstart(ch)) {\n\t\t\t\tstyler.ColourTo(i - 1, state);\n\t\t\t\tstate = SCE_LUA_WORD;\n\t\t\t}\n\t\t} else if (state == SCE_LUA_WORD) {\n\t\t\tif (!iswordchar(ch)) {\n\t\t\t\tclassifyWordLua(styler.GetStartSegment(), i - 1, keywords, styler);\n\t\t\t\tstate = SCE_LUA_DEFAULT;\n\t\t\t\tif (ch == '[' && chNext == '[') {\n\t\t\t\t\tliteralString = 1;\n\t\t\t\t\tstate = SCE_LUA_LITERALSTRING;\n\t\t\t\t} else if (ch == '-' && chNext == '-') {\n\t\t\t\t\tstate = SCE_LUA_COMMENTLINE;\n\t\t\t\t} else if (ch == '\\\"') {\n\t\t\t\t\tstate = SCE_LUA_STRING;\n\t\t\t\t} else if (ch == '\\'') {\n\t\t\t\t\tstate = SCE_LUA_CHARACTER;\n\t\t\t\t} else if (ch == '$' && firstChar) {\n\t\t\t\t\tstate = SCE_LUA_PREPROCESSOR;\n\t\t\t\t} else if (isLuaOperator(ch)) {\n\t\t\t\t\tstyler.ColourTo(i, SCE_LUA_OPERATOR);\n\t\t\t\t}\n\t\t\t} else if (ch == '.' && chNext == '.') {\n\t\t\t\tclassifyWordLua(styler.GetStartSegment(), i - 1, keywords, styler);\n\t\t\t\tstyler.ColourTo(i, SCE_LUA_OPERATOR);\n\t\t\t\tstate = SCE_LUA_DEFAULT;\n\t\t\t}\n\t\t} else {\n\t\t\tif (state == SCE_LUA_LITERALSTRING) {\n\t\t\t\tif (ch == ']' && (chPrev == ']') && (--literalString == 0)) {\n\t\t\t\t\tstyler.ColourTo(i, state);\n\t\t\t\t\tstate = SCE_LUA_DEFAULT;\n\t\t\t\t}\n\t\t\t} else if (state == SCE_LUA_PREPROCESSOR) {\n\t\t\t\tif ((ch == '\\r' || ch == '\\n') && (chPrev != '\\\\')) {\n\t\t\t\t\tstyler.ColourTo(i - 1, state);\n\t\t\t\t\tstate = SCE_LUA_DEFAULT;\n\t\t\t\t}\n\t\t\t} else if (state == SCE_LUA_COMMENTLINE) {\n\t\t\t\tif (ch == '\\r' || ch == '\\n') {\n\t\t\t\t\tstyler.ColourTo(i - 1, state);\n\t\t\t\t\tstate = SCE_LUA_DEFAULT;\n\t\t\t\t}\n\t\t\t} else if (state == SCE_LUA_STRING) {\n\t\t\t\tif ((ch == '\\r' || ch == '\\n') && (chPrev != '\\\\')) {\n\t\t\t\t\tstyler.ColourTo(i - 1, state);\n\t\t\t\t\tstate = SCE_LUA_STRINGEOL;\n\t\t\t\t} else if (ch == '\\\\') {\n\t\t\t\t\tif (chNext == '\\\"' || chNext == '\\\\') {\n\t\t\t\t\t\ti++;\n\t\t\t\t\t\tch = chNext;\n\t\t\t\t\t\tchNext = styler.SafeGetCharAt(i + 1);\n\t\t\t\t\t}\n\t\t\t\t} else if (ch == '\\\"') {\n\t\t\t\t\tstyler.ColourTo(i, state);\n\t\t\t\t\tstate = SCE_LUA_DEFAULT;\n\t\t\t\t\ti++;\n\t\t\t\t\tch = chNext;\n\t\t\t\t\tchNext = styler.SafeGetCharAt(i + 1);\n\t\t\t\t}\n\t\t\t} else if (state == SCE_LUA_CHARACTER) {\n\t\t\t\tif ((ch == '\\r' || ch == '\\n') && (chPrev != '\\\\')) {\n\t\t\t\t\tstyler.ColourTo(i - 1, state);\n\t\t\t\t\tstate = SCE_LUA_STRINGEOL;\n\t\t\t\t} else if (ch == '\\\\') {\n\t\t\t\t\tif (chNext == '\\'' || chNext == '\\\\') {\n\t\t\t\t\t\ti++;\n\t\t\t\t\t\tch = chNext;\n\t\t\t\t\t\tchNext = styler.SafeGetCharAt(i + 1);\n\t\t\t\t\t}\n\t\t\t\t} else if (ch == '\\'') {\n\t\t\t\t\tstyler.ColourTo(i, state);\n\t\t\t\t\tstate = SCE_LUA_DEFAULT;\n\t\t\t\t\ti++;\n\t\t\t\t\tch = chNext;\n\t\t\t\t\tchNext = styler.SafeGetCharAt(i + 1);\n\t\t\t\t}\n\t\t\t}\n\n\t\t\tif (state == SCE_LUA_DEFAULT) {\n\t\t\t\tif (ch == '-' && chNext == '-') {\n\t\t\t\t\tstate = SCE_LUA_COMMENTLINE;\n\t\t\t\t} else if (ch == '\\\"') {\n\t\t\t\t\tstate = SCE_LUA_STRING;\n\t\t\t\t} else if (ch == '\\'') {\n\t\t\t\t\tstate = SCE_LUA_CHARACTER;\n\t\t\t\t} else if (ch == '$' && firstChar) {\n\t\t\t\t\tstate = SCE_LUA_PREPROCESSOR;\n\t\t\t\t} else if (iswordstart(ch)) {\n\t\t\t\t\tstate = SCE_LUA_WORD;\n\t\t\t\t} else if (isLuaOperator(ch)) {\n\t\t\t\t\tstyler.ColourTo(i, SCE_LUA_OPERATOR);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tchPrev = ch;\n\t\tfirstChar = (ch == '\\r' || ch == '\\n');\n\t}\n\tstyler.ColourTo(lengthDoc - 1, state);\n}\n\nstatic void FoldLuaDoc(unsigned int startPos, int length, int \/* initStyle *\/, WordList *[],\n Accessor &styler) {\n\tunsigned int lengthDoc = startPos + length;\n\tint visibleChars = 0;\n\tint lineCurrent = styler.GetLine(startPos);\n\tint levelPrev = styler.LevelAt(lineCurrent) & SC_FOLDLEVELNUMBERMASK;\n\tint levelCurrent = levelPrev;\n\tchar chNext = styler[startPos];\n\tint styleNext = styler.StyleAt(startPos);\n\tchar s[10];\n\tfor (unsigned int i = startPos; i < lengthDoc; i++) {\n\t\tchar ch = chNext;\n\t\tchNext = styler.SafeGetCharAt(i + 1);\n\t\tint style = styleNext;\n\t\tstyleNext = styler.StyleAt(i + 1);\n\t\tbool atEOL = (ch == '\\r' && chNext != '\\n') || (ch == '\\n');\n\t\tif (style == SCE_LUA_WORD)\n\t\t\tif ( ch == 'e' || ch == 't' || ch == 'd' || ch == 'f') {\n\t\t\t\tfor (unsigned int j = 0; j < 8; j++) {\n\t\t\t\t\tif (!iswordchar(styler[i + j])) break;\n\t\t\t\t\ts[j] = styler[i + j];\n\t\t\t\t\ts[j + 1] = '\\0';\n\t\t\t\t}\n\n\t\t\t\tif ((strcmp(s, \"then\") == 0) || (strcmp(s, \"do\") == 0)\n\t\t\t\t || (strcmp(s, \"function\") == 0))\n\t\t\t\t\tlevelCurrent++;\n\t\t\t\tif (strcmp(s, \"end\") == 0) levelCurrent--;\n\t\t\t}\n\n\t\tif (atEOL) {\n\t\t\tint lev = levelPrev;\n\t\t\tif (visibleChars == 0)\n\t\t\t\tlev |= SC_FOLDLEVELWHITEFLAG;\n\t\t\tif ((levelCurrent > levelPrev) && (visibleChars > 0))\n\t\t\t\tlev |= SC_FOLDLEVELHEADERFLAG;\n\t\t\tif (lev != styler.LevelAt(lineCurrent)) {\n\t\t\t\tstyler.SetLevel(lineCurrent, lev);\n\t\t\t}\n\t\t\tlineCurrent++;\n\t\t\tlevelPrev = levelCurrent;\n\t\t\tvisibleChars = 0;\n\t\t}\n\t\tif (!isspacechar(ch))\n\t\t\tvisibleChars++;\n\t}\n\t\/\/ Fill in the real level of the next line, keeping the current flags as they will be filled in later\n\tint flagsNext = styler.LevelAt(lineCurrent) & ~SC_FOLDLEVELNUMBERMASK;\n\tstyler.SetLevel(lineCurrent, levelPrev | flagsNext);\n}\n\nLexerModule lmLua(SCLEX_LUA, ColouriseLuaDoc, \"lua\", FoldLuaDoc);\n<|endoftext|>"} {"text":"<commit_before>#include \"Method.hpp\"\n\n\nnamespace Ethereum{namespace ABI{\n\n\nstd::string Method::Encode(const char *name)\n{\n return Encode(name, strlen(name));\n}\n\nstd::string Method::Encode(const std::string &name)\n{\n return Encode(name.data(), name.size());\n}\n\nstd::string Method::Encode(const char *name, size_t size)\n{\n CryptoPP::SHA3_256 hash;\n byte digest[32];\n std::string result;\n result.reserve(10);\n result.resize(8);\n hash.CalculateDigest( digest, (const byte*) name, size);\n boost::algorithm::hex(digest, digest+4, result.begin());\n result.insert(0, \"0x\");\n return result;\n}\n\nstd::string Method::Encode(const std::string &name, const Arguments &args)\n{\n return Encode(name.data(), name.size(), args);\n}\n\n\nstd::string Method::Encode(const char *name, const Arguments &args)\n{\n return Encode(name, strlen(name), args);\n}\n\n\nstd::string Method::Encode(const char *name, size_t size, const Arguments &args)\n{\n return Encode(name, size) + args.toHex();\n}\n\n\n}}\n<commit_msg>using unsigned char<commit_after>#include \"Method.hpp\"\n\n\nnamespace Ethereum{namespace ABI{\n\n\nstd::string Method::Encode(const char *name)\n{\n return Encode(name, strlen(name));\n}\n\nstd::string Method::Encode(const std::string &name)\n{\n return Encode(name.data(), name.size());\n}\n\nstd::string Method::Encode(const char *name, size_t size)\n{\n CryptoPP::SHA3_256 hash;\n unsigned char digest[32];\n std::string result;\n result.reserve(10);\n result.resize(8);\n hash.CalculateDigest( digest, (const unsigned char*) name, size);\n boost::algorithm::hex(digest, digest+4, result.begin());\n result.insert(0, \"0x\");\n return result;\n}\n\nstd::string Method::Encode(const std::string &name, const Arguments &args)\n{\n return Encode(name.data(), name.size(), args);\n}\n\n\nstd::string Method::Encode(const char *name, const Arguments &args)\n{\n return Encode(name, strlen(name), args);\n}\n\n\nstd::string Method::Encode(const char *name, size_t size, const Arguments &args)\n{\n return Encode(name, size) + args.toHex();\n}\n\n\n}}\n<|endoftext|>"} {"text":"<commit_before>#include <Refal2.h>\n\nnamespace Refal2 {\n\n\/\/-----------------------------------------------------------------------------\n\nCProgram::CProgram( int numberOfModules ) :\n\tmodulesSize( numberOfModules ),\n\tmodules( new CRuntimeModule[modulesSize] )\n{\n\tassert( modulesSize > 0 );\n\tassert( modules != 0 );\n}\n\nCProgram::~CProgram()\n{\n\tdelete[] modules;\n}\n\nCRuntimeModule& CProgram::Module( TRuntimeModuleId moduleId )\n{\n\tassert( moduleId >= 0 && moduleId < modulesSize );\n\treturn modules[moduleId];\n}\n\n\/\/-----------------------------------------------------------------------------\n\nclass CGlobalFunctionData {\npublic:\n\tCGlobalFunctionData() :\n\t\tpreparatoryFunction( 0 ),\n\t\tembeddedFunction( 0 ),\n\t\truntimeModuleId( 0 )\n\t{\n\t}\n\n\tbool IsEmbeddedFunction() const\n\t{\n\t\treturn ( embeddedFunction != 0 );\n\t}\n\n\tbool IsPreparatoryFunction() const\n\t{\n\t\treturn ( preparatoryFunction != 0 );\n\t}\n\n\tbool IsDefined() const\n\t{\n\t\treturn ( IsEmbeddedFunction() || IsPreparatoryFunction() ); \n\t}\n\n\tvoid SetPreparatoryFunction(\n\t\tconst CPreparatoryFunction* const _preparatoryFunction,\n\t\tconst TRuntimeModuleId _runtimeModuleId )\n\t{\n\t\tassert( !IsDefined() );\n\t\tassert( _preparatoryFunction != 0 );\n\t\tpreparatoryFunction = _preparatoryFunction;\n\t\truntimeModuleId = _runtimeModuleId;\n\t}\n\n\tconst CPreparatoryFunction* PreparatoryFunction() const\n\t{\n\t\tassert( IsPreparatoryFunction() );\n\t\treturn preparatoryFunction;\n\t}\n\n\tconst TRuntimeModuleId RuntimeModuleId() const\n\t{\n\t\tassert( IsPreparatoryFunction() );\n\t\treturn runtimeModuleId;\n\t}\n\n\tvoid SetEmbeddedFunction( const TEmbeddedFunctionPtr _embeddedFunction )\n\t{\n\t\tassert( !IsDefined() );\n\t\tassert( _embeddedFunction != 0 );\n\t\tembeddedFunction = _embeddedFunction;\n\t}\n\n\tTEmbeddedFunctionPtr EmbeddedFunction() const\n\t{\n\t\tassert( IsEmbeddedFunction() );\n\t\treturn embeddedFunction;\n\t}\n\nprivate:\n\tconst CPreparatoryFunction* preparatoryFunction;\n\tTEmbeddedFunctionPtr embeddedFunction;\n\tTRuntimeModuleId runtimeModuleId;\n};\n\n\/\/-----------------------------------------------------------------------------\n\nclass CExternalFunctionData {\npublic:\n\tCExternalFunctionData( int _globalIndex,\n\t\t\tCPreparatoryFunction* _preparatoryFunction ) :\n\t\tglobalIndex( _globalIndex ),\n\t\tpreparatoryFunction( _preparatoryFunction )\n\t{\n\t\tassert( globalIndex >= 0 );\n\t\tassert( preparatoryFunction != 0 );\n\t}\n\n\tint GlobalIndex() const { return globalIndex; }\n\tCPreparatoryFunction* PreparatoryFunction() const\n\t\t{ return preparatoryFunction; }\n\nprivate:\n\tint globalIndex;\n\tCPreparatoryFunction* preparatoryFunction;\n};\n\n\/\/-----------------------------------------------------------------------------\n\nclass CPreparatoryRuntimeFunction : public CRuntimeFunction {\npublic:\n\tCPreparatoryRuntimeFunction( CPreparatoryFunction* const function,\n\t\tconst TRuntimeModuleId moduleId );\n\n\tCPreparatoryFunction* PreparatoryFunction() const { return function; }\n\tTRuntimeModuleId RuntimeModuleId() const { return moduleId; }\n\nprivate:\n\tCPreparatoryFunction* const function;\n\tconst TRuntimeModuleId moduleId;\n\n\tstatic TRuntimeFunctionType convertType(\n\t\tconst CPreparatoryFunction* const function );\n};\n\nCPreparatoryRuntimeFunction::CPreparatoryRuntimeFunction(\n\t\tCPreparatoryFunction* const _function,\n\t\tconst TRuntimeModuleId _moduleId ) :\n\tCRuntimeFunction( convertType( _function ) ),\n\tfunction( _function ),\n\tmoduleId( _moduleId )\n{\n}\n\nTRuntimeFunctionType CPreparatoryRuntimeFunction::convertType(\n\tconst CPreparatoryFunction* const function )\n{\n\tassert( function != 0 );\n\tswitch( function->GetType() ) {\n\t\tcase PFT_Ordinary:\n\t\t\treturn RFT_Ordinary;\n\t\tcase PFT_Empty:\n\t\t\treturn RFT_Empty;\n\t\tcase PFT_External:\n\t\t\treturn RFT_External;\n\t\tcase PFT_Declared:\n\t\tcase PFT_Defined:\n\t\tcase PFT_Compiled:\n\t\tcase PFT_Embedded:\n\t\tdefault:\n\t\t\tbreak;\n\t}\n\tassert( false );\n\treturn RFT_Empty;\n}\n\n\/\/-----------------------------------------------------------------------------\n\nclass CInternalProgramBuilder {\npublic:\n\tstatic CProgramPtr Build( CModuleDataVector& modules,\n\t\tCErrorsHelper& errors );\n\nprivate:\n\tCErrorsHelper& errors;\n\ttypedef std::vector<CExternalFunctionData> CExternals;\n\tCExternals externals;\n\tCDictionary<CGlobalFunctionData, std::string> globals;\n\tCProgramPtr program;\n\n\tCInternalProgramBuilder( CErrorsHelper& _errors, int numberOfModules ) :\n\t\terrors( _errors ),\n\t\tprogram( new CProgram( numberOfModules ) )\n\t{\n\t\tassert( static_cast<bool>( program ) );\n\t}\n\n\tvoid addFunction( CPreparatoryFunction* function,\n\t\tconst TRuntimeModuleId runtimeModuleId );\n\tvoid addFunctions( const CModuleData& module, CRuntimeModule& runtimeModule,\n\t\tconst TRuntimeModuleId runtimeModuleId );\n\tvoid collect( CModuleDataVector& modules );\n\tvoid check();\n\tvoid compile();\n\tvoid link();\n};\n\n\/\/-----------------------------------------------------------------------------\n\nCProgramPtr CInternalProgramBuilder::Build( CModuleDataVector& modules,\n\tCErrorsHelper& errors )\n{\n\tassert( !errors.HasErrors() );\n\tassert( !modules.empty() );\n\tCInternalProgramBuilder builder( errors, modules.size() );\n\tbuilder.collect( modules );\n\tif( errors.HasErrors() ) {\n\t\treturn nullptr;\n\t}\n\tbuilder.check();\n\tif( errors.HasErrors() ) {\n\t\treturn nullptr;\n\t}\n\tbuilder.compile();\n\tassert( !errors.HasErrors() );\n\tbuilder.link();\n\tassert( !errors.HasErrors() );\n\treturn CProgramPtr( builder.program.release() );\n}\n\nvoid CInternalProgramBuilder::addFunction( CPreparatoryFunction* function,\n\tconst TRuntimeModuleId runtimeModuleId )\n{\n\tconst bool isExternal = function->IsExternal();\n\tconst bool isGlobal = function->IsEntry();\n\tif( !( isExternal || isGlobal ) ) {\n\t\treturn;\n\t}\n\tint globalIndex = globals.AddKey( function->ExternalName() );\n\tif( isGlobal ) {\n\t\tassert( !isExternal );\n\t\tCGlobalFunctionData& global = globals.GetData( globalIndex );\n\t\tif( global.IsDefined() ) {\n\t\t\terrors.Error( \"already defined\" );\n\t\t} else {\n\t\t\tglobal.SetPreparatoryFunction( function, runtimeModuleId );\n\t\t}\n\t} else {\n\t\tassert( isExternal );\n\t\texternals.push_back( CExternalFunctionData( globalIndex, function ) );\n\t}\n}\nvoid CInternalProgramBuilder::addFunctions( const CModuleData& module,\n\tCRuntimeModule& runtimeModule, const TRuntimeModuleId runtimeModuleId )\n{\n\tconst CPreparatoryFunctions& functions = module.Functions;\n\tfor( int i = 0; i < functions.Size(); i++ ) {\n\t\tCPreparatoryFunction* function = functions.GetData( i ).get();\n\t\tCRuntimeFunctionPtr& runtimeFunction = runtimeModule.Functions.GetData(\n\t\t\truntimeModule.Functions.AddKey( function->Name() ) );\n\t\tassert( !static_cast<bool>( runtimeFunction ) );\n\t\truntimeFunction.reset( new CPreparatoryRuntimeFunction( function,\n\t\t\truntimeModuleId ) );\n\t\taddFunction( function, runtimeModuleId );\n\t}\n}\n\nvoid CInternalProgramBuilder::collect( CModuleDataVector& modules )\n{\n\tTRuntimeModuleId currentModuleId = 0;\n\tfor( CModuleDataVector::const_iterator module = modules.begin();\n\t\tmodule != modules.end(); ++module )\n\t{\n\t\taddFunctions( *( *module ), program->Module( currentModuleId ),\n\t\t\tcurrentModuleId );\n\t\tcurrentModuleId++;\n\t}\n\tmodules.clear();\n}\n\nvoid CInternalProgramBuilder::check()\n{\n\tfor( CExternals::const_iterator\tfunction = externals.begin();\n\t\tfunction != externals.end(); ++function )\n\t{\n\t\tconst int globalIndex = function->GlobalIndex();\n\t\tif( !globals.GetData( globalIndex ).IsDefined() ) {\n\t\t\terrors.Error( \"link error\" );\n\t\t}\n\t}\n}\n\nvoid CInternalProgramBuilder::compile()\n{\n\tCFunctionCompiler compiler;\n\tfor( int moduleId = 0; moduleId < program->NumberOfModules(); moduleId++ )\n\t{\n\t\tconst CRuntimeFunctions& functions =\n\t\t\tprogram->Module( moduleId ).Functions;\n\t\tfor( int i = 0; i < functions.Size(); i++ ) {\n\t\t\tconst CPreparatoryRuntimeFunction& function = static_cast<\n\t\t\t\tCPreparatoryRuntimeFunction&>( *functions.GetData( i ) );\n\t\t\tif( function.PreparatoryFunction()->IsOrdinary() ) {\n\t\t\t\tfunction.PreparatoryFunction()->Compile( compiler );\n\t\t\t}\n\t\t}\n\t}\n}\n\nvoid CInternalProgramBuilder::link()\n{\n\tfor( CExternals::iterator function = externals.begin();\n\t\tfunction != externals.end(); ++function )\n\t{\n\t\tfunction->PreparatoryFunction();\n\t\tconst int globalIndex = function->GlobalIndex();\n\t\tconst CGlobalFunctionData& global = globals.GetData( globalIndex );\n\t\tassert( global.IsDefined() );\n\t\tif( global.IsEmbeddedFunction() ) {\n\t\t\tfunction->PreparatoryFunction()->SetEmbedded(\n\t\t\t\tglobal.EmbeddedFunction() );\n\t\t} else {\n\t\t\tassert( !global.IsPreparatoryFunction() );\n\t\t\tfunction->PreparatoryFunction()->Link(\n\t\t\t\t*global.PreparatoryFunction() );\n\t\t}\n\t}\n\n\tfor( int moduleId = 0; moduleId < program->NumberOfModules(); moduleId++ )\n\t{\n\t\tconst CRuntimeFunctions& functions =\n\t\t\tprogram->Module( moduleId ).Functions;\n\t\tfor( int i = 0; i < functions.Size(); i++ ) {\n\t\t\tconst CPreparatoryRuntimeFunction& function = static_cast<\n\t\t\t\tCPreparatoryRuntimeFunction&>( *functions.GetData( i ) );\n\t\t\tconst CPreparatoryFunction* preparatoryFunction =\n\t\t\t\tfunction.PreparatoryFunction();\n\t\t\tCRuntimeFunctionPtr newRuntimeFunction;\n\t\t\tswitch( function.Type() ) {\n\t\t\t\tcase RFT_Empty:\n\t\t\t\t\tassert( preparatoryFunction->IsEmpty() );\n\t\t\t\t\tnewRuntimeFunction.reset( new CEmptyFunction );\n\t\t\t\t\tbreak;\n\t\t\t\tcase RFT_Embedded:\n\t\t\t\t\tassert( preparatoryFunction->IsEmbedded() );\n\t\t\t\t\tnewRuntimeFunction.reset( new CEmbeddedFunction(\n\t\t\t\t\t\tpreparatoryFunction->EmbeddedFunction() ) );\n\t\t\t\t\tbreak;\n\t\t\t\tcase RFT_External:\n\t\t\t\t\tassert( preparatoryFunction->IsEmpty()\n\t\t\t\t\t\t|| preparatoryFunction->IsEmbedded()\n\t\t\t\t\t\t|| preparatoryFunction->IsOrdinary() );\n\t\t\t\t\t\/\/ todo: ---\n\t\t\t\t\tnewRuntimeFunction.reset( new CExternalFunction( 0,\n\t\t\t\t\t\tfunction.RuntimeModuleId() ) );\n\t\t\t\t\tbreak;\n\t\t\t\tcase RFT_Ordinary:\n\t\t\t\t\tassert( preparatoryFunction->IsOrdinary() );\n\t\t\t\t\t\/\/ todo: ---\n\t\t\t\t\tnewRuntimeFunction.reset( new COrdinaryFunction( 0 ) );\n\t\t\t\t\tbreak;\n\t\t\t\tdefault:\n\t\t\t\t\tassert( false );\n\t\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t}\n}\n\n\/\/-----------------------------------------------------------------------------\n\nCProgramBuilder::CProgramBuilder( IErrorHandler* errorHandler ) :\n\tCFunctionBuilder( errorHandler )\n{\n\tReset();\n}\n\nvoid CProgramBuilder::Reset()\n{\n\tCFunctionBuilder::Reset();\n}\n\nvoid CProgramBuilder::AddModule( CModuleDataPtr& module )\n{\n\tmodules.push_back( CModuleDataPtr( module.release() ) );\n}\n\nvoid CProgramBuilder::BuildProgram()\n{\n\tCInternalProgramBuilder::Build( modules, *this );\n}\n\n\/\/-----------------------------------------------------------------------------\n\n} \/\/ end of namespace Refal2\n<commit_msg>add error messages<commit_after>#include <Refal2.h>\n\nnamespace Refal2 {\n\n\/\/-----------------------------------------------------------------------------\n\/\/ CProgram\n\nCProgram::CProgram( int numberOfModules ) :\n\tmodulesSize( numberOfModules ),\n\tmodules( new CRuntimeModule[modulesSize] )\n{\n\tassert( modulesSize > 0 );\n\tassert( modules != 0 );\n}\n\nCProgram::~CProgram()\n{\n\tdelete[] modules;\n}\n\nCRuntimeModule& CProgram::Module( TRuntimeModuleId moduleId )\n{\n\tassert( moduleId >= 0 && moduleId < modulesSize );\n\treturn modules[moduleId];\n}\n\n\/\/-----------------------------------------------------------------------------\n\/\/ Standart embedded functions\n\n\/\/-----------------------------------------------------------------------------\n\/\/ CGlobalFunctionData\n\nclass CGlobalFunctionData {\npublic:\n\tCGlobalFunctionData() :\n\t\tpreparatoryFunction( 0 ),\n\t\tembeddedFunction( 0 ),\n\t\truntimeModuleId( 0 )\n\t{\n\t}\n\n\tbool IsEmbeddedFunction() const\n\t{\n\t\treturn ( embeddedFunction != 0 );\n\t}\n\n\tbool IsPreparatoryFunction() const\n\t{\n\t\treturn ( preparatoryFunction != 0 );\n\t}\n\n\tbool IsDefined() const\n\t{\n\t\treturn ( IsEmbeddedFunction() || IsPreparatoryFunction() ); \n\t}\n\n\tvoid SetPreparatoryFunction(\n\t\tconst CPreparatoryFunction* const _preparatoryFunction,\n\t\tconst TRuntimeModuleId _runtimeModuleId )\n\t{\n\t\tassert( !IsDefined() );\n\t\tassert( _preparatoryFunction != 0 );\n\t\tpreparatoryFunction = _preparatoryFunction;\n\t\truntimeModuleId = _runtimeModuleId;\n\t}\n\n\tconst CPreparatoryFunction* PreparatoryFunction() const\n\t{\n\t\tassert( IsPreparatoryFunction() );\n\t\treturn preparatoryFunction;\n\t}\n\n\tconst TRuntimeModuleId RuntimeModuleId() const\n\t{\n\t\tassert( IsPreparatoryFunction() );\n\t\treturn runtimeModuleId;\n\t}\n\n\tvoid SetEmbeddedFunction( const TEmbeddedFunctionPtr _embeddedFunction )\n\t{\n\t\tassert( !IsDefined() );\n\t\tassert( _embeddedFunction != 0 );\n\t\tembeddedFunction = _embeddedFunction;\n\t}\n\n\tTEmbeddedFunctionPtr EmbeddedFunction() const\n\t{\n\t\tassert( IsEmbeddedFunction() );\n\t\treturn embeddedFunction;\n\t}\n\nprivate:\n\tconst CPreparatoryFunction* preparatoryFunction;\n\tTEmbeddedFunctionPtr embeddedFunction;\n\tTRuntimeModuleId runtimeModuleId;\n};\n\n\/\/-----------------------------------------------------------------------------\n\/\/ CExternalFunctionData\n\nclass CExternalFunctionData {\npublic:\n\tCExternalFunctionData( int _globalIndex,\n\t\t\tCPreparatoryFunction* _preparatoryFunction ) :\n\t\tglobalIndex( _globalIndex ),\n\t\tpreparatoryFunction( _preparatoryFunction )\n\t{\n\t\tassert( globalIndex >= 0 );\n\t\tassert( preparatoryFunction != 0 );\n\t}\n\n\tint GlobalIndex() const { return globalIndex; }\n\tCPreparatoryFunction* PreparatoryFunction() const\n\t\t{ return preparatoryFunction; }\n\nprivate:\n\tint globalIndex;\n\tCPreparatoryFunction* preparatoryFunction;\n};\n\n\/\/-----------------------------------------------------------------------------\n\/\/ CPreparatoryRuntimeFunction\n\nclass CPreparatoryRuntimeFunction : public CRuntimeFunction {\npublic:\n\tCPreparatoryRuntimeFunction( CPreparatoryFunction* const function,\n\t\tconst TRuntimeModuleId moduleId );\n\n\tCPreparatoryFunction* PreparatoryFunction() const { return function; }\n\tTRuntimeModuleId RuntimeModuleId() const { return moduleId; }\n\nprivate:\n\tCPreparatoryFunction* const function;\n\tconst TRuntimeModuleId moduleId;\n\n\tstatic TRuntimeFunctionType convertType(\n\t\tconst CPreparatoryFunction* const function );\n};\n\nCPreparatoryRuntimeFunction::CPreparatoryRuntimeFunction(\n\t\tCPreparatoryFunction* const _function,\n\t\tconst TRuntimeModuleId _moduleId ) :\n\tCRuntimeFunction( convertType( _function ) ),\n\tfunction( _function ),\n\tmoduleId( _moduleId )\n{\n}\n\nTRuntimeFunctionType CPreparatoryRuntimeFunction::convertType(\n\tconst CPreparatoryFunction* const function )\n{\n\tassert( function != 0 );\n\tswitch( function->GetType() ) {\n\t\tcase PFT_Ordinary:\n\t\t\treturn RFT_Ordinary;\n\t\tcase PFT_Empty:\n\t\t\treturn RFT_Empty;\n\t\tcase PFT_External:\n\t\t\treturn RFT_External;\n\t\tcase PFT_Declared:\n\t\tcase PFT_Defined:\n\t\tcase PFT_Compiled:\n\t\tcase PFT_Embedded:\n\t\tdefault:\n\t\t\tbreak;\n\t}\n\tassert( false );\n\treturn RFT_Empty;\n}\n\n\/\/-----------------------------------------------------------------------------\n\/\/ CInternalProgramBuilder\n\nclass CInternalProgramBuilder {\npublic:\n\tstatic CProgramPtr Build( CModuleDataVector& modules,\n\t\tCErrorsHelper& errors );\n\nprivate:\n\tCErrorsHelper& errors;\n\ttypedef std::vector<CExternalFunctionData> CExternals;\n\tCExternals externals;\n\tCDictionary<CGlobalFunctionData, std::string> globals;\n\tCProgramPtr program;\n\n\tCInternalProgramBuilder( CErrorsHelper& _errors, int numberOfModules ) :\n\t\terrors( _errors ),\n\t\tprogram( new CProgram( numberOfModules ) )\n\t{\n\t\tassert( static_cast<bool>( program ) );\n\t}\n\n\tvoid addFunction( CPreparatoryFunction* function,\n\t\tconst TRuntimeModuleId runtimeModuleId );\n\tvoid addFunctions( const CModuleData& module, CRuntimeModule& runtimeModule,\n\t\tconst TRuntimeModuleId runtimeModuleId );\n\tvoid collect( CModuleDataVector& modules );\n\tvoid check();\n\tvoid compile();\n\tvoid link();\n};\n\n\/\/-----------------------------------------------------------------------------\n\nCProgramPtr CInternalProgramBuilder::Build( CModuleDataVector& modules,\n\tCErrorsHelper& errors )\n{\n\tassert( !errors.HasErrors() );\n\tassert( !modules.empty() );\n\tCInternalProgramBuilder builder( errors, modules.size() );\n\tbuilder.collect( modules );\n\tif( errors.HasErrors() ) {\n\t\treturn nullptr;\n\t}\n\tbuilder.check();\n\tif( errors.HasErrors() ) {\n\t\treturn nullptr;\n\t}\n\tbuilder.compile();\n\tassert( !errors.HasErrors() );\n\tbuilder.link();\n\tassert( !errors.HasErrors() );\n\treturn CProgramPtr( builder.program.release() );\n}\n\nvoid CInternalProgramBuilder::addFunction( CPreparatoryFunction* function,\n\tconst TRuntimeModuleId runtimeModuleId )\n{\n\tconst bool isExternal = function->IsExternal();\n\tconst bool isGlobal = function->IsEntry();\n\tif( !( isExternal || isGlobal ) ) {\n\t\treturn;\n\t}\n\tint globalIndex = globals.AddKey( function->ExternalName() );\n\tif( isGlobal ) {\n\t\tassert( !isExternal );\n\t\tCGlobalFunctionData& global = globals.GetData( globalIndex );\n\t\tif( global.IsDefined() ) {\n\t\t\tstd::ostringstream stringStream;\n\t\t\tstringStream << \"function with external name `\"\n\t\t\t\t<< function->ExternalNameToken().word\n\t\t\t\t<< \"` already defined in program\";\n\t\t\terrors.Error( stringStream.str() );\n\t\t} else {\n\t\t\tglobal.SetPreparatoryFunction( function, runtimeModuleId );\n\t\t}\n\t} else {\n\t\tassert( isExternal );\n\t\texternals.push_back( CExternalFunctionData( globalIndex, function ) );\n\t}\n}\nvoid CInternalProgramBuilder::addFunctions( const CModuleData& module,\n\tCRuntimeModule& runtimeModule, const TRuntimeModuleId runtimeModuleId )\n{\n\tconst CPreparatoryFunctions& functions = module.Functions;\n\tfor( int i = 0; i < functions.Size(); i++ ) {\n\t\tCPreparatoryFunction* function = functions.GetData( i ).get();\n\t\tCRuntimeFunctionPtr& runtimeFunction = runtimeModule.Functions.GetData(\n\t\t\truntimeModule.Functions.AddKey( function->Name() ) );\n\t\tassert( !static_cast<bool>( runtimeFunction ) );\n\t\truntimeFunction.reset( new CPreparatoryRuntimeFunction( function,\n\t\t\truntimeModuleId ) );\n\t\taddFunction( function, runtimeModuleId );\n\t}\n}\n\nvoid CInternalProgramBuilder::collect( CModuleDataVector& modules )\n{\n\tTRuntimeModuleId currentModuleId = 0;\n\tfor( CModuleDataVector::const_iterator module = modules.begin();\n\t\tmodule != modules.end(); ++module )\n\t{\n\t\taddFunctions( *( *module ), program->Module( currentModuleId ),\n\t\t\tcurrentModuleId );\n\t\tcurrentModuleId++;\n\t}\n\tmodules.clear();\n}\n\nvoid CInternalProgramBuilder::check()\n{\n\tfor( CExternals::const_iterator\tfunction = externals.begin();\n\t\tfunction != externals.end(); ++function )\n\t{\n\t\tconst int globalIndex = function->GlobalIndex();\n\t\tif( !globals.GetData( globalIndex ).IsDefined() ) {\n\t\t\tstd::ostringstream stringStream;\n\t\t\tstringStream << \"function with external name `\"\n\t\t\t\t<< globals.GetKey( globalIndex )\n\t\t\t\t<< \"` was not defined in program\";\n\t\t\terrors.Error( stringStream.str() );\n\t\t}\n\t}\n}\n\nvoid CInternalProgramBuilder::compile()\n{\n\tCFunctionCompiler compiler;\n\tfor( int moduleId = 0; moduleId < program->NumberOfModules(); moduleId++ )\n\t{\n\t\tconst CRuntimeFunctions& functions =\n\t\t\tprogram->Module( moduleId ).Functions;\n\t\tfor( int i = 0; i < functions.Size(); i++ ) {\n\t\t\tconst CPreparatoryRuntimeFunction& function = static_cast<\n\t\t\t\tCPreparatoryRuntimeFunction&>( *functions.GetData( i ) );\n\t\t\tif( function.PreparatoryFunction()->IsOrdinary() ) {\n\t\t\t\tfunction.PreparatoryFunction()->Compile( compiler );\n\t\t\t}\n\t\t}\n\t}\n}\n\nvoid CInternalProgramBuilder::link()\n{\n\tfor( CExternals::iterator function = externals.begin();\n\t\tfunction != externals.end(); ++function )\n\t{\n\t\tfunction->PreparatoryFunction();\n\t\tconst int globalIndex = function->GlobalIndex();\n\t\tconst CGlobalFunctionData& global = globals.GetData( globalIndex );\n\t\tassert( global.IsDefined() );\n\t\tif( global.IsEmbeddedFunction() ) {\n\t\t\tfunction->PreparatoryFunction()->SetEmbedded(\n\t\t\t\tglobal.EmbeddedFunction() );\n\t\t} else {\n\t\t\tassert( !global.IsPreparatoryFunction() );\n\t\t\tfunction->PreparatoryFunction()->Link(\n\t\t\t\t*global.PreparatoryFunction() );\n\t\t}\n\t}\n\n\tfor( int moduleId = 0; moduleId < program->NumberOfModules(); moduleId++ )\n\t{\n\t\tconst CRuntimeFunctions& functions =\n\t\t\tprogram->Module( moduleId ).Functions;\n\t\tfor( int i = 0; i < functions.Size(); i++ ) {\n\t\t\tconst CPreparatoryRuntimeFunction& function = static_cast<\n\t\t\t\tCPreparatoryRuntimeFunction&>( *functions.GetData( i ) );\n\t\t\tconst CPreparatoryFunction* preparatoryFunction =\n\t\t\t\tfunction.PreparatoryFunction();\n\t\t\tCRuntimeFunctionPtr newRuntimeFunction;\n\t\t\tswitch( function.Type() ) {\n\t\t\t\tcase RFT_Empty:\n\t\t\t\t\tassert( preparatoryFunction->IsEmpty() );\n\t\t\t\t\tnewRuntimeFunction.reset( new CEmptyFunction );\n\t\t\t\t\tbreak;\n\t\t\t\tcase RFT_Embedded:\n\t\t\t\t\tassert( preparatoryFunction->IsEmbedded() );\n\t\t\t\t\tnewRuntimeFunction.reset( new CEmbeddedFunction(\n\t\t\t\t\t\tpreparatoryFunction->EmbeddedFunction() ) );\n\t\t\t\t\tbreak;\n\t\t\t\tcase RFT_External:\n\t\t\t\t\tassert( preparatoryFunction->IsEmpty()\n\t\t\t\t\t\t|| preparatoryFunction->IsEmbedded()\n\t\t\t\t\t\t|| preparatoryFunction->IsOrdinary() );\n\t\t\t\t\t\/\/ todo: ---\n\t\t\t\t\tnewRuntimeFunction.reset( new CExternalFunction( 0,\n\t\t\t\t\t\tfunction.RuntimeModuleId() ) );\n\t\t\t\t\tbreak;\n\t\t\t\tcase RFT_Ordinary:\n\t\t\t\t\tassert( preparatoryFunction->IsOrdinary() );\n\t\t\t\t\t\/\/ todo: ---\n\t\t\t\t\tnewRuntimeFunction.reset( new COrdinaryFunction( 0 ) );\n\t\t\t\t\tbreak;\n\t\t\t\tdefault:\n\t\t\t\t\tassert( false );\n\t\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t}\n}\n\n\/\/-----------------------------------------------------------------------------\n\/\/ CProgramBuilder\n\nCProgramBuilder::CProgramBuilder( IErrorHandler* errorHandler ) :\n\tCFunctionBuilder( errorHandler )\n{\n\tReset();\n}\n\nvoid CProgramBuilder::Reset()\n{\n\tCFunctionBuilder::Reset();\n}\n\nvoid CProgramBuilder::AddModule( CModuleDataPtr& module )\n{\n\tmodules.push_back( CModuleDataPtr( module.release() ) );\n}\n\nvoid CProgramBuilder::BuildProgram()\n{\n\tCInternalProgramBuilder::Build( modules, *this );\n}\n\n\/\/-----------------------------------------------------------------------------\n\n} \/\/ end of namespace Refal2\n<|endoftext|>"} {"text":"<commit_before>#include \"Paging.h\"\n#include \"utility.h\"\n#include \"globals.h\"\n\nconst uint HF_BEGIN = THREEGB;\n\n\nPageDirectoryEntry PDElower[1024];\nPageDirectoryEntry* PDE = (PageDirectoryEntry*)((uint)PDElower + HF_BEGIN);\nPageTable PT[1<<20];\nconst int MAX_INIT_PAGE = 2;\n\nvoid PageDirectoryEntry::setAddr(void* a) {\n setAddr((uint)a);\n}\n\nvoid PageDirectoryEntry::setAddr(uint a) {\n assert((a & ((1<<12)-1)) == 0);\n PTaddr = a >> 12;\n}\n\nvoid PageTable::setAddr(void* a) {\n setAddr((uint)a);\n}\n\nvoid PageTable::setAddr(uint a) {\n assert((a & ((1<<12)-1)) == 0);\n addr = a >> 12;\n}\n\nvoid* PageTable::getAddr() {\n return (void*)(addr << 12);\n}\n\nvoid setupBasicPaging() {\n for(int i = 0; i < 1024; ++i) {\n PDElower[i].present = false;\n PDElower[i].readWrite = true;\n PDElower[i].user = false;\n PDElower[i].writeThrough = true;\n PDElower[i].cacheDisable = false;\n PDElower[i].accessed = false;\n PDElower[i].zero = false;\n PDElower[i].isSizeMega = false;\n PDElower[i].nothing = 0;\n PDElower[i].PTaddr = 0;\n }\n \/\/Identity map the first 4Mb\n PDElower[0].present = true;\n PDElower[0].isSizeMega = true;\n PDElower[0].PTaddr = 0;\n\n \/\/For the higher half kernel\n for(int i = 0; i < MAX_INIT_PAGE; ++i) {\n PDElower[768+i].present = true;\n PDElower[768+i].isSizeMega = true;\n PDElower[768+i].PTaddr = i<<10;\n }\n}\n\nPaging::Paging() : _brk(HF_BEGIN + MAX_INIT_PAGE*4*1024*1024), _truebrk(_brk) {\n for(int i = MAX_INIT_PAGE; i < 256; ++i) {\n PDE[768+i].PTaddr = (((uint)&PT[1024*i])-HF_BEGIN) >> 12;\n }\n}\n\nstatic inline PageTable* getPT(uint addr) {\n return &PT[(addr-HF_BEGIN)>>12];\n}\n\nstatic inline PageDirectoryEntry* getPDE(uint addr) {\n return &PDE[addr >> 22];\n}\n\nstatic inline void invlpg(uint addr) {\n asm volatile(\"invlpg (%0)\" ::\"r\" (addr) : \"memory\");\n}\n\nint Paging::brk(void* paddr) {\n uint addr = (uint)paddr;\n if(addr > _truebrk) {\n while(addr > _truebrk) {\n if((_truebrk & ((1<<22)-1)) == 0) {\n for(int i = 0; i < 1024; ++i) {\n getPT(_truebrk)[i].present = false;\n }\n getPDE(_truebrk)->present = true;\n }\n getPT(_truebrk)->setAddr((uint)physmemalloc.alloc());\n getPT(_truebrk)->present = true;\n invlpg(_truebrk);\n _truebrk += 0x1000;\n }\n } else {\n while(_truebrk - 0x1000 >= addr) {\n _truebrk -= 0x1000;\n physmemalloc.free(getPT(_truebrk)->getAddr());\n getPT(_truebrk)->present = false;\n getPT(_truebrk)->setAddr(nullptr);\n if((_truebrk & ((1<<22)-1)) == 0) {\n getPDE(_truebrk)->present = false;\n getPDE(_truebrk)->setAddr(nullptr);\n }\n invlpg(_truebrk);\n }\n }\n _brk = addr;\n return 0;\n}\n\nvoid* Paging::sbrk(int inc) {\n void* res = (void*)_brk;\n brk(((char*)_brk) + inc);\n return res;\n}\n\nstatic MallocHeader* firstHeader;\n\nvoid initkmalloc() {\n MallocHeader* head = (MallocHeader*)paging.sbrk(4);\n head->size = 0;\n head->flags = 0;\n firstHeader = head;\n}\n\nstatic inline void* headerToPtr(MallocHeader* head) {\n return (void*)((char*)head + sizeof(MallocHeader));\n}\n\nstatic inline MallocHeader* ptrToHeader(void* ptr) {\n return (MallocHeader*)((char*)ptr - sizeof(MallocHeader));\n}\n\nstatic inline MallocHeader* nextHeader(MallocHeader* head) {\n return (MallocHeader*)((char*)head + head->getSize() + 4);\n}\n\nstatic inline uint align4(uint n) {\n return n + 4 - (n%4);\n}\n\nstatic const int ALLOCATED = 1;\n\nvoid* kmalloc(uint size) {\n MallocHeader* head = firstHeader;\n while(true) {\n if(head->size == 0) {\n uint trueSize = align4(size);\n assert(headerToPtr(head) == paging.sbrk(4+trueSize));\n head->setSize(trueSize);\n head->flags |= ALLOCATED;\n MallocHeader* nextHead = nextHeader(head);\n nextHead->size = 0;\n nextHead->flags = 0;\n return headerToPtr(head);\n }\n if((head->flags & ALLOCATED) == 0 && head->getSize() >= size) {\n head->flags |= ALLOCATED;\n return headerToPtr(head);\n }\n head = nextHeader(head);\n }\n}\n\nvoid kfree(void* ptr) {\n MallocHeader* head = ptrToHeader(ptr);\n assert((head->flags & ALLOCATED) != 0);\n head->flags &= ~ALLOCATED;\n}\n\n\n<commit_msg>Improve kmalloc<commit_after>#include \"Paging.h\"\n#include \"utility.h\"\n#include \"globals.h\"\n\nconst uint HF_BEGIN = THREEGB;\n\n\nPageDirectoryEntry PDElower[1024];\nPageDirectoryEntry* PDE = (PageDirectoryEntry*)((uint)PDElower + HF_BEGIN);\nPageTable PT[1<<20];\nconst int MAX_INIT_PAGE = 2;\n\nvoid PageDirectoryEntry::setAddr(void* a) {\n setAddr((uint)a);\n}\n\nvoid PageDirectoryEntry::setAddr(uint a) {\n assert((a & ((1<<12)-1)) == 0);\n PTaddr = a >> 12;\n}\n\nvoid PageTable::setAddr(void* a) {\n setAddr((uint)a);\n}\n\nvoid PageTable::setAddr(uint a) {\n assert((a & ((1<<12)-1)) == 0);\n addr = a >> 12;\n}\n\nvoid* PageTable::getAddr() {\n return (void*)(addr << 12);\n}\n\nvoid setupBasicPaging() {\n for(int i = 0; i < 1024; ++i) {\n PDElower[i].present = false;\n PDElower[i].readWrite = true;\n PDElower[i].user = false;\n PDElower[i].writeThrough = true;\n PDElower[i].cacheDisable = false;\n PDElower[i].accessed = false;\n PDElower[i].zero = false;\n PDElower[i].isSizeMega = false;\n PDElower[i].nothing = 0;\n PDElower[i].PTaddr = 0;\n }\n \/\/Identity map the first 4Mb\n PDElower[0].present = true;\n PDElower[0].isSizeMega = true;\n PDElower[0].PTaddr = 0;\n\n \/\/For the higher half kernel\n for(int i = 0; i < MAX_INIT_PAGE; ++i) {\n PDElower[768+i].present = true;\n PDElower[768+i].isSizeMega = true;\n PDElower[768+i].PTaddr = i<<10;\n }\n}\n\nPaging::Paging() : _brk(HF_BEGIN + MAX_INIT_PAGE*4*1024*1024), _truebrk(_brk) {\n for(int i = MAX_INIT_PAGE; i < 256; ++i) {\n PDE[768+i].PTaddr = (((uint)&PT[1024*i])-HF_BEGIN) >> 12;\n }\n}\n\nstatic inline PageTable* getPT(uint addr) {\n return &PT[(addr-HF_BEGIN)>>12];\n}\n\nstatic inline PageDirectoryEntry* getPDE(uint addr) {\n return &PDE[addr >> 22];\n}\n\nstatic inline void invlpg(uint addr) {\n asm volatile(\"invlpg (%0)\" ::\"r\" (addr) : \"memory\");\n}\n\nint Paging::brk(void* paddr) {\n uint addr = (uint)paddr;\n if(addr > _truebrk) {\n while(addr > _truebrk) {\n if((_truebrk & ((1<<22)-1)) == 0) {\n for(int i = 0; i < 1024; ++i) {\n getPT(_truebrk)[i].present = false;\n }\n getPDE(_truebrk)->present = true;\n }\n getPT(_truebrk)->setAddr((uint)physmemalloc.alloc());\n getPT(_truebrk)->present = true;\n invlpg(_truebrk);\n _truebrk += 0x1000;\n }\n } else {\n while(_truebrk - 0x1000 >= addr) {\n _truebrk -= 0x1000;\n physmemalloc.free(getPT(_truebrk)->getAddr());\n getPT(_truebrk)->present = false;\n getPT(_truebrk)->setAddr(nullptr);\n if((_truebrk & ((1<<22)-1)) == 0) {\n getPDE(_truebrk)->present = false;\n getPDE(_truebrk)->setAddr(nullptr);\n }\n invlpg(_truebrk);\n }\n }\n _brk = addr;\n return 0;\n}\n\nvoid* Paging::sbrk(int inc) {\n void* res = (void*)_brk;\n brk(((char*)_brk) + inc);\n return res;\n}\n\nstatic MallocHeader* firstHeader;\n\nstatic const int FREE = 1;\nstatic const int PREV_FREE = 2;\n\nvoid initkmalloc() {\n MallocHeader* head = (MallocHeader*)paging.sbrk(4);\n head->size = 0;\n head->flags = 0;\n firstHeader = head;\n}\n\nstatic inline void* headerToPtr(MallocHeader* head) {\n return (void*)((char*)head + sizeof(MallocHeader));\n}\n\nstatic inline MallocHeader* ptrToHeader(void* ptr) {\n return (MallocHeader*)((char*)ptr - sizeof(MallocHeader));\n}\n\nstatic inline MallocHeader* getPrevBoundaryTag(MallocHeader* head) {\n return (MallocHeader*)((char*)head - sizeof(MallocHeader));\n}\n\nstatic inline MallocHeader* getNextBoundaryTag(MallocHeader* head) {\n return (MallocHeader*)((char*)head + head->getSize());\n}\n\nstatic inline MallocHeader* nextHeader(MallocHeader* head) {\n return (MallocHeader*)((char*)head + head->getSize() + sizeof(MallocHeader));\n}\n\nstatic inline uint align4(uint n) {\n return n + 4 - (n%4);\n}\n\nvoid* kmalloc(uint size) {\n size = align4(size);\n MallocHeader* head = firstHeader;\n while(true) {\n \/\/if we are at the end of the linked list\n if(head->size == 0) {\n \/\/allocate enough space\n assert(headerToPtr(head) == paging.sbrk(4+size));\n \/\/setup header\n head->setSize(size);\n head->flags &= ~FREE;\n \/\/setup the next \"end of list\" header\n MallocHeader* nextHead = nextHeader(head);\n nextHead->size = 0;\n nextHead->flags = 0;\n \/\/return result\n return headerToPtr(head);\n \/\/we didn't do anything with boundary tags because there is nothing to do.\n \/\/(if the previous block is free, head->flags already contains PREV_FREE)\n }\n \/\/if there is a free block with enough space\n if((head->flags & FREE) != 0 && head->getSize() >= size) {\n \/\/change the flag\n head->flags &= ~FREE;\n \/\/if there is enough space to split this block in two\n if(head->getSize() - size >= 2*sizeof(MallocHeader)) {\n MallocHeader* oldNxtHead = nextHeader(head); \/\/only used in the assert\n uint oldSize = head->getSize();\n \/\/setup the current header\n head->setSize(size);\n MallocHeader* nxtHead = nextHeader(head);\n \/\/setup the header of the next block\n nxtHead->setSize(oldSize - size - sizeof(MallocHeader));\n nxtHead->flags = 0; \/\/it's free and its previous block is allocated\n assert(oldNxtHead == nextHeader(nxtHead));\n \/\/nxtHead is free: copy its boundary tag\n *getNextBoundaryTag(nxtHead) = *nxtHead;\n \/\/oldNxtHead->flags already contains PREV_FREE\n assert((oldNxtHead->flags & PREV_FREE) != 0);\n }\n \/\/remove the PREV_FREE flag of next block\n nextHeader(head)->flags &= ~PREV_FREE;\n return headerToPtr(head);\n }\n head = nextHeader(head);\n }\n}\n\nvoid kfree(void* ptr) {\n MallocHeader* head = ptrToHeader(ptr);\n \/\/free the block\n assert((head->flags & FREE) == 0);\n head->flags |= FREE;\n\n \/\/set the PREV_FREE flag on the next block\n nextHeader(head)->flags |= PREV_FREE;\n\n \/\/try to merge with the next block\n MallocHeader* nxtHead = nextHeader(head);\n if(nxtHead->size != 0 && (nxtHead->flags & FREE) != 0) {\n MallocHeader* oldNxtNxtHead = nextHeader(nxtHead); \/\/only used in the assert\n \/\/merge\n head->setSize(head->getSize() + nxtHead->getSize() + sizeof(MallocHeader));\n assert(oldNxtNxtHead == nextHeader(head));\n \/\/copy boundary tag\n *getNextBoundaryTag(head) = *head;\n }\n\n \/\/try to merge with the previous block\n if((head->flags & PREV_FREE) != 0) {\n MallocHeader* oldNxtHead = nextHeader(head); \/\/only used in the assert\n \/\/retrieve the previous header using the boundary tag\n MallocHeader* boundTag = getPrevBoundaryTag(head);\n MallocHeader* prevHead = (MallocHeader*)((char*)boundTag - boundTag->getSize());\n assert(nextHeader(prevHead) == head);\n \/\/merge\n prevHead->setSize(prevHead->getSize() + head->getSize() + sizeof(MallocHeader));\n assert(nextHeader(prevHead) == oldNxtHead);\n \/\/copy boundary tag\n *getNextBoundaryTag(prevHead) = *prevHead;\n }\n}\n\n\n<|endoftext|>"} {"text":"<commit_before>\/*****************************************************************************\n * Media Library\n *****************************************************************************\n * Copyright (C) 2015 Hugo Beauzée-Luyssen, Videolabs\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#include \"Parser.h\"\n\n#include <algorithm>\n\n#include \"IMedia.h\"\n\nParser::Parser(DBConnection dbConnection , IMediaLibraryCb* cb)\n : m_stopParser( false )\n , m_dbConnection( dbConnection )\n , m_callback( cb )\n , m_nbParsed( 0 )\n , m_nbToParse( 0 )\n , m_paused( false )\n{\n}\n\nParser::~Parser()\n{\n if ( m_thread.joinable() )\n {\n {\n std::lock_guard<std::mutex> lock( m_lock );\n if ( m_tasks.empty() == true )\n m_cond.notify_all();\n m_stopParser = true;\n }\n m_thread.join();\n }\n while ( m_tasks.empty() == false )\n {\n delete m_tasks.front();\n m_tasks.pop();\n }\n}\n\nvoid Parser::addService(std::unique_ptr<IMetadataService> service)\n{\n m_services.emplace_back( std::move( service ) );\n std::push_heap( m_services.begin(), m_services.end(), []( const ServicePtr& a, const ServicePtr& b )\n {\n \/\/ We want higher priority first\n return a->priority() < b->priority();\n });\n}\n\nvoid Parser::parse( std::shared_ptr<Media> file )\n{\n std::lock_guard<std::mutex> lock( m_lock );\n\n if ( m_services.size() == 0 )\n return;\n m_tasks.push( new Task( file, m_services, m_callback ) );\n updateStats( false, true );\n if ( m_paused == false )\n m_cond.notify_all();\n}\n\nvoid Parser::start()\n{\n \/\/ Ensure we don't start multiple times.\n assert( m_thread.joinable() == false );\n\n m_thread = std::thread{ &Parser::run, this };\n}\n\nvoid Parser::pause()\n{\n std::lock_guard<std::mutex> lock( m_lock );\n m_paused = true;\n}\n\nvoid Parser::resume()\n{\n std::lock_guard<std::mutex> lock( m_lock );\n m_paused = false;\n m_cond.notify_all();\n}\n\nvoid Parser::run()\n{\n LOG_INFO(\"Starting Parser thread\");\n restore();\n\n while ( m_stopParser == false )\n {\n Task* task = nullptr;\n {\n std::unique_lock<std::mutex> lock( m_lock );\n if ( m_tasks.empty() == true || m_paused == true )\n {\n m_cond.wait( lock, [this]() {\n return ( m_tasks.empty() == false && m_paused == false )\n || m_stopParser == true;\n });\n \/\/ We might have been woken up because the parser is being destroyed\n if ( m_stopParser == true )\n break;\n }\n \/\/ Otherwise it's safe to assume we have at least one element.\n task = m_tasks.front();\n m_tasks.pop();\n }\n try\n {\n (*task->it)->run( task->file, task );\n }\n catch (const std::exception& ex)\n {\n LOG_ERROR( \"Caught an exception during \", task->file->mrl(), \" parsing: \", ex.what() );\n done( task->file, IMetadataService::Status::Fatal, task );\n }\n }\n LOG_INFO(\"Exiting Parser thread\");\n}\n\nvoid Parser::restore()\n{\n if ( m_services.empty() == true )\n return;\n\n static const std::string req = \"SELECT * FROM \" + policy::MediaTable::Name\n + \" WHERE parsed = 0\";\n auto media = Media::fetchAll<Media>( m_dbConnection, req );\n\n std::lock_guard<std::mutex> lock( m_lock );\n for ( auto& m : media )\n {\n m_tasks.push( new Task( m, m_services, m_callback ) );\n }\n}\n\nvoid Parser::updateStats( bool newMediaParsed, bool newMediaQueued )\n{\n if ( m_callback == nullptr )\n return;\n\n if ( newMediaParsed == true )\n m_nbParsed++;\n else if ( newMediaQueued == true )\n m_nbToParse++;\n else\n assert(false);\n\n if ( m_nbParsed == m_nbToParse )\n {\n m_callback->onParsingStatsUpdated( m_nbParsed, m_nbToParse );\n m_nbParsed = 0;\n m_nbToParse = 0;\n return;\n }\n \/\/ Only send an update every X new elem\n const uint32_t NbElems = 3;\n if ( ( newMediaParsed == true && m_nbParsed % NbElems == 0 ) ||\n ( newMediaQueued == true && m_nbToParse % NbElems == 0 ) )\n {\n m_callback->onParsingStatsUpdated( m_nbParsed, m_nbToParse );\n }\n}\n\n\nParser::Task::Task(std::shared_ptr<Media> file, Parser::ServiceList& serviceList, IMediaLibraryCb* metadataCb )\n : file(file)\n , it( serviceList.begin() )\n , end( serviceList.end() )\n , cb( metadataCb )\n{\n}\n\n\nvoid Parser::done(std::shared_ptr<Media> file, IMetadataService::Status status, void* data )\n{\n Task *t = reinterpret_cast<Task*>( data );\n if ( status == IMetadataService::Status::TemporaryUnavailable ||\n status == IMetadataService::Status::Fatal )\n {\n updateStats( true, false );\n delete t;\n return;\n }\n else if ( status == IMetadataService::Status::Success )\n {\n if ( t->cb != nullptr )\n t->cb->onFileUpdated( file );\n }\n\n ++t->it;\n if (t->it == t->end)\n {\n updateStats( true, false );\n file->markParsed();\n delete t;\n return;\n }\n std::lock_guard<std::mutex> lock( m_lock );\n m_tasks.push( t );\n m_cond.notify_all();\n}\n<commit_msg>Parser: Add comment about objects lifetime<commit_after>\/*****************************************************************************\n * Media Library\n *****************************************************************************\n * Copyright (C) 2015 Hugo Beauzée-Luyssen, Videolabs\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#include \"Parser.h\"\n\n#include <algorithm>\n\n#include \"IMedia.h\"\n\nParser::Parser(DBConnection dbConnection , IMediaLibraryCb* cb)\n : m_stopParser( false )\n , m_dbConnection( dbConnection )\n , m_callback( cb )\n , m_nbParsed( 0 )\n , m_nbToParse( 0 )\n , m_paused( false )\n{\n}\n\nParser::~Parser()\n{\n if ( m_thread.joinable() )\n {\n {\n std::lock_guard<std::mutex> lock( m_lock );\n if ( m_tasks.empty() == true )\n m_cond.notify_all();\n m_stopParser = true;\n }\n m_thread.join();\n }\n while ( m_tasks.empty() == false )\n {\n delete m_tasks.front();\n m_tasks.pop();\n }\n}\n\nvoid Parser::addService(std::unique_ptr<IMetadataService> service)\n{\n m_services.emplace_back( std::move( service ) );\n std::push_heap( m_services.begin(), m_services.end(), []( const ServicePtr& a, const ServicePtr& b )\n {\n \/\/ We want higher priority first\n return a->priority() < b->priority();\n });\n}\n\nvoid Parser::parse( std::shared_ptr<Media> file )\n{\n std::lock_guard<std::mutex> lock( m_lock );\n\n if ( m_services.size() == 0 )\n return;\n m_tasks.push( new Task( file, m_services, m_callback ) );\n updateStats( false, true );\n if ( m_paused == false )\n m_cond.notify_all();\n}\n\nvoid Parser::start()\n{\n \/\/ Ensure we don't start multiple times.\n assert( m_thread.joinable() == false );\n\n m_thread = std::thread{ &Parser::run, this };\n}\n\nvoid Parser::pause()\n{\n std::lock_guard<std::mutex> lock( m_lock );\n m_paused = true;\n}\n\nvoid Parser::resume()\n{\n std::lock_guard<std::mutex> lock( m_lock );\n m_paused = false;\n m_cond.notify_all();\n}\n\nvoid Parser::run()\n{\n LOG_INFO(\"Starting Parser thread\");\n restore();\n\n while ( m_stopParser == false )\n {\n Task* task = nullptr;\n {\n std::unique_lock<std::mutex> lock( m_lock );\n if ( m_tasks.empty() == true || m_paused == true )\n {\n m_cond.wait( lock, [this]() {\n return ( m_tasks.empty() == false && m_paused == false )\n || m_stopParser == true;\n });\n \/\/ We might have been woken up because the parser is being destroyed\n if ( m_stopParser == true )\n break;\n }\n \/\/ Otherwise it's safe to assume we have at least one element.\n task = m_tasks.front();\n m_tasks.pop();\n }\n try\n {\n (*task->it)->run( task->file, task );\n \/\/ Consider the task invalid starting from this point. If it completed\n \/\/ it cleared itself afterward.\n }\n catch (const std::exception& ex)\n {\n LOG_ERROR( \"Caught an exception during \", task->file->mrl(), \" parsing: \", ex.what() );\n done( task->file, IMetadataService::Status::Fatal, task );\n }\n }\n LOG_INFO(\"Exiting Parser thread\");\n}\n\nvoid Parser::restore()\n{\n if ( m_services.empty() == true )\n return;\n\n static const std::string req = \"SELECT * FROM \" + policy::MediaTable::Name\n + \" WHERE parsed = 0\";\n auto media = Media::fetchAll<Media>( m_dbConnection, req );\n\n std::lock_guard<std::mutex> lock( m_lock );\n for ( auto& m : media )\n {\n m_tasks.push( new Task( m, m_services, m_callback ) );\n }\n}\n\nvoid Parser::updateStats( bool newMediaParsed, bool newMediaQueued )\n{\n if ( m_callback == nullptr )\n return;\n\n if ( newMediaParsed == true )\n m_nbParsed++;\n else if ( newMediaQueued == true )\n m_nbToParse++;\n else\n assert(false);\n\n if ( m_nbParsed == m_nbToParse )\n {\n m_callback->onParsingStatsUpdated( m_nbParsed, m_nbToParse );\n m_nbParsed = 0;\n m_nbToParse = 0;\n return;\n }\n \/\/ Only send an update every X new elem\n const uint32_t NbElems = 3;\n if ( ( newMediaParsed == true && m_nbParsed % NbElems == 0 ) ||\n ( newMediaQueued == true && m_nbToParse % NbElems == 0 ) )\n {\n m_callback->onParsingStatsUpdated( m_nbParsed, m_nbToParse );\n }\n}\n\n\nParser::Task::Task(std::shared_ptr<Media> file, Parser::ServiceList& serviceList, IMediaLibraryCb* metadataCb )\n : file(file)\n , it( serviceList.begin() )\n , end( serviceList.end() )\n , cb( metadataCb )\n{\n}\n\n\nvoid Parser::done(std::shared_ptr<Media> file, IMetadataService::Status status, void* data )\n{\n Task *t = reinterpret_cast<Task*>( data );\n if ( status == IMetadataService::Status::TemporaryUnavailable ||\n status == IMetadataService::Status::Fatal )\n {\n updateStats( true, false );\n delete t;\n return;\n }\n else if ( status == IMetadataService::Status::Success )\n {\n if ( t->cb != nullptr )\n t->cb->onFileUpdated( file );\n }\n\n ++t->it;\n if (t->it == t->end)\n {\n updateStats( true, false );\n file->markParsed();\n delete t;\n return;\n }\n std::lock_guard<std::mutex> lock( m_lock );\n m_tasks.push( t );\n m_cond.notify_all();\n}\n<|endoftext|>"} {"text":"<commit_before>\/*-----------------------------------------------------------------------------\n\n Copyright 2017 Hopsan Group\n\n Licensed under the Apache License, Version 2.0 (the \"License\");\n you may not use this file except in compliance with the License.\n You may obtain a copy of the License at\n\n http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n\n Unless required by applicable law or agreed to in writing, software\n distributed under the License is distributed on an \"AS IS\" BASIS,\n WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n See the License for the specific language governing permissions and\n limitations under the License.\n\n\n The full license is available in the file LICENSE.\n For details about the 'Hopsan Group' or information about Authors and\n Contributors see the HOPSANGROUP and AUTHORS files that are located in\n the Hopsan source code root directory.\n\n-----------------------------------------------------------------------------*\/\n\n\/\/!\n\/\/! @file HopsanCLI\/CliUtilities.cpp\n\/\/! @author peter.nordin@liu.se\n\/\/! @date 2014-12-09\n\/\/!\n\/\/! @brief Contains helpfunctions for CLI\n\/\/!\n\/\/$Id$\n\n#include \"CliUtilities.h\"\n\n#include <iostream>\n#include <sstream>\n#include <fstream>\n#include <cmath>\n\n#ifndef _WIN32\n#include <unistd.h>\n#include <limits.h>\n#else\n#include <windows.h>\n#endif\n\nusing namespace std;\n\n\/\/! @brief Prints a message with red color (resets color to defaul after)\n\/\/! @param[in] rError The error message\nvoid printErrorMessage(const std::string &rError, bool silent)\n{\n if(silent) return;\n\n setTerminalColor(Red);\n cout << \"Error: \" << rError << endl;\n setTerminalColor(Reset);\n}\n\n\/\/! @brief Prints a message with yellow color (resets color to defaul after)\n\/\/! @param[in] rWarning The warning message\nvoid printWarningMessage(const std::string &rWarning, bool silent)\n{\n if(silent) return;\n\n setTerminalColor(Yellow);\n cout << \"Warning: \" << rWarning << endl;\n setTerminalColor(Reset);\n}\n\n\/\/! @brief Prints a message with green color (resets color to defaul after)\n\/\/! @param[in] color The text color for the message\n\/\/! @param[in] rMessage The message\nvoid printColorMessage(const ColorsEnumT color, const std::string &rMessage, bool silent)\n{\n if(silent) return;\n\n setTerminalColor(color);\n cout << rMessage << endl;\n setTerminalColor(Reset);\n}\n\n\/\/! @brief Changes color on console output\n\/\/! @param color Color number (0-15)\n\/\/! @todo Need yellow color also\nvoid setTerminalColor(const ColorsEnumT color)\n{\n#ifdef _WIN32\n WORD c;\n switch (color)\n {\n case Red:\n c = FOREGROUND_INTENSITY | FOREGROUND_RED;\n break;\n case Green:\n c = FOREGROUND_INTENSITY | FOREGROUND_GREEN;\n break;\n case Yellow:\n c = FOREGROUND_INTENSITY | FOREGROUND_GREEN | FOREGROUND_RED;\n break;\n case Blue:\n c = FOREGROUND_INTENSITY | FOREGROUND_BLUE;\n break;\n case White:\n default:\n c = FOREGROUND_BLUE | FOREGROUND_GREEN | FOREGROUND_RED;\n }\n\n HANDLE hcon = GetStdHandle(STD_OUTPUT_HANDLE);\n SetConsoleTextAttribute(hcon,c);\n#else\n string c;\n switch (color)\n {\n case Red:\n c = \"\\e[0;91m\";\n break;\n case Green:\n c = \"\\e[0;92m\";\n break;\n case Yellow:\n c = \"\\e[0;93m\";\n break;\n case Blue:\n c = \"\\e[0;94m\";\n break;\n case White:\n default:\n c = \"\\e[0m\";\n }\n\n cout << c;\n#endif\n}\n\n\/\/! @brief Helpfunction that splits a filename into basename and extesion\nvoid splitFileName(const std::string fileName, std::string &rBaseName, std::string &rExt)\n{\n size_t pos = fileName.rfind('.');\n if (pos != std::string::npos)\n {\n rBaseName = fileName.substr(0, pos) ;\n rExt = fileName.substr(pos+1);\n }\n else\n {\n rExt = \"\";\n rBaseName = fileName;\n }\n}\n\n\/\/! @brief Convert the fullpath into a path relative to basepath, both paths must be relative the same directoryo (or absolute)\nstd::string relativePath(std::string basePath, std::string fullPath)\n{\n std::string result;\n\n if ( (basePath.size()>0) && basePath[basePath.size()-1] != '\/')\n {\n basePath.push_back('\/');\n }\n\n \/\/ First chew up the initial common part of the string\n size_t pe = basePath.find('\/');\n while (pe != std::string::npos)\n {\n \/\/cout << \"basePath: \" << basePath << endl;\n \/\/cout << \"fullPath: \" << fullPath << endl;\n string sub = basePath.substr(0, pe+1);\n\n size_t fe = fullPath.find(sub);\n if (fe == 0)\n {\n basePath.erase(0, pe+1);\n fullPath.erase(0, sub.size());\n pe = basePath.find('\/');\n }\n else\n {\n break;\n }\n }\n\n \/\/ Now determine the number of levels to \"go up\" based on remaning '\/' in basePath\n pe = basePath.find('\/');\n while (pe != std::string::npos)\n {\n result += \"..\/\";\n basePath.erase(0, pe+1);\n pe = basePath.find('\/');\n }\n \/\/ Append what is remaning of base path\n result += fullPath;\n\n \/\/cout << \"Result: \" << result << endl;\n\n return result;\n}\n\nvoid splitStringOnDelimiter(const std::string &rString, const char delim, std::vector<std::string> &rSplitVector)\n{\n rSplitVector.clear();\n string item;\n stringstream ss(rString);\n while(getline(ss, item, delim))\n {\n rSplitVector.push_back(item);\n }\n}\n\n\/\/! @brief Helpfunction that splits a full path into basepath and filename\n\/\/! @note Assumes that dir separator is forward slash \/\nvoid splitFilePath(const std::string fullPath, std::string &rBasePath, std::string &rFileName)\n{\n size_t pos = fullPath.rfind('\/');\n \/\/ If not found try a windows backslash instead\n if (pos == std::string::npos)\n {\n pos = fullPath.rfind('\\\\');\n }\n if (pos != std::string::npos)\n {\n rBasePath = fullPath.substr(0, pos+1) ;\n rFileName = fullPath.substr(pos+1);\n }\n else\n {\n rBasePath = \"\";\n rFileName = fullPath;\n }\n}\n\n\/\/! @brief Helper function that returns the number of availible cores\nsize_t getNumAvailibleCores()\n{\n size_t nCores = 1; \/\/ If non-Windows system, make sure there is at least one thread\n#ifdef _WIN32\n \/\/ Obtain number of processor cores from environment variable\n if(getenv(\"NUMBER_OF_PROCESSORS\") != 0)\n {\n string temp = getenv(\"NUMBER_OF_PROCESSORS\");\n nCores = atoi(temp.c_str());\n }\n#else\n nCores = max((long)1, sysconf(_SC_NPROCESSORS_ONLN));\n#endif\n return nCores;\n}\n\n\/\/! @brief Compares a vector with a reference vector\n\/\/! @param rVec Vector to compare\n\/\/! @param rRef Reference vector\n\/\/! @param tol (%) for acceptance\nbool compareVectors(const std::vector<double> &rVec, const std::vector<double> &rRef, const double tol)\n{\n if(rVec.size() != rRef.size())\n {\n printErrorMessage(\"compareVectors() Size mismatch!\");\n return false;\n }\n\n for(size_t i=0; i<rVec.size(); ++i)\n {\n if( (fabs(1-rVec[i]\/rRef[i]) > tol) && !(fabs(rVec[i])<1e-100) && !(fabs(rRef[i])<1e-10) )\n {\n \/\/cout << \"Test failed, Tol: \" << tol << \" comparing: \" << rVec.at(i) << \" with \" << rRef.at(i) << \" at index \" << i << endl;\n return false;\n }\n }\n return true;\n}\n\n\/\/! @brief Read the paths of external liubs from a text file\n\/\/! @param[in] filePath The file to read from\n\/\/! @param[out] rExtLibFileNames A vector with paths to the external libs to load\nvoid readExternalLibsFromTxtFile(const std::string filePath, std::vector<std::string> &rExtLibFileNames)\n{\n rExtLibFileNames.clear();\n std::string line;\n std::ifstream file;\n file.open(filePath.c_str());\n if ( file.is_open() )\n {\n while ( file.good() )\n {\n getline(file, line);\n if (*line.begin() != '#')\n {\n rExtLibFileNames.push_back(line);\n }\n }\n file.close();\n }\n else\n {\n printErrorMessage(string(\"Could not open externalLibsToLoadFile: \") + filePath );\n }\n}\n\n\n\/\/! @brief Return the path to the current executable (HopsanCLI most likely)\n\/\/! @returns The path or empty string if path can not be found\nstring getCurrentExecPath()\n{\n#ifdef _WIN32\n char result[ MAX_PATH ];\n size_t count = GetModuleFileNameA( NULL, result, MAX_PATH );\n#else\n char result[ PATH_MAX ];\n ssize_t count = readlink( \"\/proc\/self\/exe\", result, PATH_MAX );\n#endif\n\n if (count > 0)\n {\n string base, file;\n splitFilePath(string(result, count), base, file);\n cout << \"base, file: \" << base << \" \" << file << endl;\n return base;\n }\n\n return \"\";\n}\n<commit_msg>Remove left-over debug message<commit_after>\/*-----------------------------------------------------------------------------\n\n Copyright 2017 Hopsan Group\n\n Licensed under the Apache License, Version 2.0 (the \"License\");\n you may not use this file except in compliance with the License.\n You may obtain a copy of the License at\n\n http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n\n Unless required by applicable law or agreed to in writing, software\n distributed under the License is distributed on an \"AS IS\" BASIS,\n WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n See the License for the specific language governing permissions and\n limitations under the License.\n\n\n The full license is available in the file LICENSE.\n For details about the 'Hopsan Group' or information about Authors and\n Contributors see the HOPSANGROUP and AUTHORS files that are located in\n the Hopsan source code root directory.\n\n-----------------------------------------------------------------------------*\/\n\n\/\/!\n\/\/! @file HopsanCLI\/CliUtilities.cpp\n\/\/! @author peter.nordin@liu.se\n\/\/! @date 2014-12-09\n\/\/!\n\/\/! @brief Contains helpfunctions for CLI\n\/\/!\n\/\/$Id$\n\n#include \"CliUtilities.h\"\n\n#include <iostream>\n#include <sstream>\n#include <fstream>\n#include <cmath>\n\n#ifndef _WIN32\n#include <unistd.h>\n#include <limits.h>\n#else\n#include <windows.h>\n#endif\n\nusing namespace std;\n\n\/\/! @brief Prints a message with red color (resets color to defaul after)\n\/\/! @param[in] rError The error message\nvoid printErrorMessage(const std::string &rError, bool silent)\n{\n if(silent) return;\n\n setTerminalColor(Red);\n cout << \"Error: \" << rError << endl;\n setTerminalColor(Reset);\n}\n\n\/\/! @brief Prints a message with yellow color (resets color to defaul after)\n\/\/! @param[in] rWarning The warning message\nvoid printWarningMessage(const std::string &rWarning, bool silent)\n{\n if(silent) return;\n\n setTerminalColor(Yellow);\n cout << \"Warning: \" << rWarning << endl;\n setTerminalColor(Reset);\n}\n\n\/\/! @brief Prints a message with green color (resets color to defaul after)\n\/\/! @param[in] color The text color for the message\n\/\/! @param[in] rMessage The message\nvoid printColorMessage(const ColorsEnumT color, const std::string &rMessage, bool silent)\n{\n if(silent) return;\n\n setTerminalColor(color);\n cout << rMessage << endl;\n setTerminalColor(Reset);\n}\n\n\/\/! @brief Changes color on console output\n\/\/! @param color Color number (0-15)\n\/\/! @todo Need yellow color also\nvoid setTerminalColor(const ColorsEnumT color)\n{\n#ifdef _WIN32\n WORD c;\n switch (color)\n {\n case Red:\n c = FOREGROUND_INTENSITY | FOREGROUND_RED;\n break;\n case Green:\n c = FOREGROUND_INTENSITY | FOREGROUND_GREEN;\n break;\n case Yellow:\n c = FOREGROUND_INTENSITY | FOREGROUND_GREEN | FOREGROUND_RED;\n break;\n case Blue:\n c = FOREGROUND_INTENSITY | FOREGROUND_BLUE;\n break;\n case White:\n default:\n c = FOREGROUND_BLUE | FOREGROUND_GREEN | FOREGROUND_RED;\n }\n\n HANDLE hcon = GetStdHandle(STD_OUTPUT_HANDLE);\n SetConsoleTextAttribute(hcon,c);\n#else\n string c;\n switch (color)\n {\n case Red:\n c = \"\\e[0;91m\";\n break;\n case Green:\n c = \"\\e[0;92m\";\n break;\n case Yellow:\n c = \"\\e[0;93m\";\n break;\n case Blue:\n c = \"\\e[0;94m\";\n break;\n case White:\n default:\n c = \"\\e[0m\";\n }\n\n cout << c;\n#endif\n}\n\n\/\/! @brief Helpfunction that splits a filename into basename and extesion\nvoid splitFileName(const std::string fileName, std::string &rBaseName, std::string &rExt)\n{\n size_t pos = fileName.rfind('.');\n if (pos != std::string::npos)\n {\n rBaseName = fileName.substr(0, pos) ;\n rExt = fileName.substr(pos+1);\n }\n else\n {\n rExt = \"\";\n rBaseName = fileName;\n }\n}\n\n\/\/! @brief Convert the fullpath into a path relative to basepath, both paths must be relative the same directoryo (or absolute)\nstd::string relativePath(std::string basePath, std::string fullPath)\n{\n std::string result;\n\n if ( (basePath.size()>0) && basePath[basePath.size()-1] != '\/')\n {\n basePath.push_back('\/');\n }\n\n \/\/ First chew up the initial common part of the string\n size_t pe = basePath.find('\/');\n while (pe != std::string::npos)\n {\n \/\/cout << \"basePath: \" << basePath << endl;\n \/\/cout << \"fullPath: \" << fullPath << endl;\n string sub = basePath.substr(0, pe+1);\n\n size_t fe = fullPath.find(sub);\n if (fe == 0)\n {\n basePath.erase(0, pe+1);\n fullPath.erase(0, sub.size());\n pe = basePath.find('\/');\n }\n else\n {\n break;\n }\n }\n\n \/\/ Now determine the number of levels to \"go up\" based on remaning '\/' in basePath\n pe = basePath.find('\/');\n while (pe != std::string::npos)\n {\n result += \"..\/\";\n basePath.erase(0, pe+1);\n pe = basePath.find('\/');\n }\n \/\/ Append what is remaning of base path\n result += fullPath;\n\n \/\/cout << \"Result: \" << result << endl;\n\n return result;\n}\n\nvoid splitStringOnDelimiter(const std::string &rString, const char delim, std::vector<std::string> &rSplitVector)\n{\n rSplitVector.clear();\n string item;\n stringstream ss(rString);\n while(getline(ss, item, delim))\n {\n rSplitVector.push_back(item);\n }\n}\n\n\/\/! @brief Helpfunction that splits a full path into basepath and filename\n\/\/! @note Assumes that dir separator is forward slash \/\nvoid splitFilePath(const std::string fullPath, std::string &rBasePath, std::string &rFileName)\n{\n size_t pos = fullPath.rfind('\/');\n \/\/ If not found try a windows backslash instead\n if (pos == std::string::npos)\n {\n pos = fullPath.rfind('\\\\');\n }\n if (pos != std::string::npos)\n {\n rBasePath = fullPath.substr(0, pos+1) ;\n rFileName = fullPath.substr(pos+1);\n }\n else\n {\n rBasePath = \"\";\n rFileName = fullPath;\n }\n}\n\n\/\/! @brief Helper function that returns the number of availible cores\nsize_t getNumAvailibleCores()\n{\n size_t nCores = 1; \/\/ If non-Windows system, make sure there is at least one thread\n#ifdef _WIN32\n \/\/ Obtain number of processor cores from environment variable\n if(getenv(\"NUMBER_OF_PROCESSORS\") != 0)\n {\n string temp = getenv(\"NUMBER_OF_PROCESSORS\");\n nCores = atoi(temp.c_str());\n }\n#else\n nCores = max((long)1, sysconf(_SC_NPROCESSORS_ONLN));\n#endif\n return nCores;\n}\n\n\/\/! @brief Compares a vector with a reference vector\n\/\/! @param rVec Vector to compare\n\/\/! @param rRef Reference vector\n\/\/! @param tol (%) for acceptance\nbool compareVectors(const std::vector<double> &rVec, const std::vector<double> &rRef, const double tol)\n{\n if(rVec.size() != rRef.size())\n {\n printErrorMessage(\"compareVectors() Size mismatch!\");\n return false;\n }\n\n for(size_t i=0; i<rVec.size(); ++i)\n {\n if( (fabs(1-rVec[i]\/rRef[i]) > tol) && !(fabs(rVec[i])<1e-100) && !(fabs(rRef[i])<1e-10) )\n {\n \/\/cout << \"Test failed, Tol: \" << tol << \" comparing: \" << rVec.at(i) << \" with \" << rRef.at(i) << \" at index \" << i << endl;\n return false;\n }\n }\n return true;\n}\n\n\/\/! @brief Read the paths of external liubs from a text file\n\/\/! @param[in] filePath The file to read from\n\/\/! @param[out] rExtLibFileNames A vector with paths to the external libs to load\nvoid readExternalLibsFromTxtFile(const std::string filePath, std::vector<std::string> &rExtLibFileNames)\n{\n rExtLibFileNames.clear();\n std::string line;\n std::ifstream file;\n file.open(filePath.c_str());\n if ( file.is_open() )\n {\n while ( file.good() )\n {\n getline(file, line);\n if (*line.begin() != '#')\n {\n rExtLibFileNames.push_back(line);\n }\n }\n file.close();\n }\n else\n {\n printErrorMessage(string(\"Could not open externalLibsToLoadFile: \") + filePath );\n }\n}\n\n\n\/\/! @brief Return the path to the current executable (HopsanCLI most likely)\n\/\/! @returns The path or empty string if path can not be found\nstring getCurrentExecPath()\n{\n#ifdef _WIN32\n char result[ MAX_PATH ];\n size_t count = GetModuleFileNameA( NULL, result, MAX_PATH );\n#else\n char result[ PATH_MAX ];\n ssize_t count = readlink( \"\/proc\/self\/exe\", result, PATH_MAX );\n#endif\n\n if (count > 0)\n {\n string base, file;\n splitFilePath(string(result, count), base, file);\n \/\/cout << \"base, file: \" << base << \" \" << file << endl;\n return base;\n }\n\n return \"\";\n}\n<|endoftext|>"} {"text":"<commit_before>\/* Copyright 2021 The TensorFlow Authors. All Rights Reserved.\n\nLicensed under the Apache License, Version 2.0 (the \"License\");\nyou may not use this file except in compliance with the License.\nYou may obtain a copy of the License at\n\n http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n\nUnless required by applicable law or agreed to in writing, software\ndistributed under the License is distributed on an \"AS IS\" BASIS,\nWITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\nSee the License for the specific language governing permissions and\nlimitations under the License.\n==============================================================================*\/\n\n#include \"tensorflow\/compiler\/xla\/client\/lib\/approx_topk.h\"\n\n#include <string>\n\n#include \"absl\/numeric\/bits.h\"\n#include \"absl\/strings\/str_format.h\"\n#include \"tensorflow\/compiler\/xla\/client\/xla_builder.h\"\n#include \"tensorflow\/compiler\/xla\/client\/xla_computation.h\"\n#include \"tensorflow\/compiler\/xla\/shape.h\"\n#include \"tensorflow\/compiler\/xla\/shape_util.h\"\n#include \"tensorflow\/compiler\/xla\/util.h\"\n#include \"tensorflow\/compiler\/xla\/xla_data.pb.h\"\n\n\/\/ Used by rank 2+ operands\nconst uint64_t kTpuLaneTiling = 128;\n\/\/ Used by rank 1 operands.\nconst uint64_t kTpuChunkTiling = 1024;\n\nnamespace xla {\n\n\/\/ Converts a comparator to a combiner computation that can be fed to reduce or\n\/\/ partial reduce ops.\nXlaComputation BuildReductionComputation(\n XlaBuilder* builder, absl::Span<const PrimitiveType> op_types,\n const XlaComputation& comparator) {\n auto num_operands = op_types.size();\n std::vector<XlaOp> lhs_params;\n std::vector<XlaOp> rhs_params;\n int64_t param_number = 0;\n lhs_params.reserve(num_operands);\n rhs_params.reserve(num_operands);\n auto reduction_builder = builder->CreateSubBuilder(\"ReductionFn\");\n for (const auto& op_type : op_types) {\n lhs_params.push_back(Parameter(reduction_builder.get(), param_number,\n ShapeUtil::MakeScalarShape(op_type),\n absl::StrFormat(\"lhs.%d\", param_number)));\n param_number++;\n }\n for (const auto& op_type : op_types) {\n rhs_params.push_back(Parameter(reduction_builder.get(), param_number,\n ShapeUtil::MakeScalarShape(op_type),\n absl::StrFormat(\"rhs.%d\", param_number)));\n param_number++;\n }\n\n std::vector<XlaOp> comparator_args;\n comparator_args.reserve(num_operands * 2);\n for (int i = 0; i < num_operands; ++i) {\n comparator_args.push_back(lhs_params[i]);\n comparator_args.push_back(rhs_params[i]);\n }\n auto pred = Call(reduction_builder.get(), comparator, comparator_args);\n std::vector<XlaOp> results;\n results.reserve(num_operands);\n for (int i = 0; i < num_operands; ++i) {\n results.push_back(Select(pred, lhs_params[i], rhs_params[i]));\n }\n Tuple(reduction_builder.get(), results);\n return reduction_builder->BuildAndNoteError();\n}\n\nXlaOp SortAndSliceBuilder(XlaBuilder* builder, absl::Span<const XlaOp> operands,\n int64_t top_k, int64_t reduction_dim,\n const XlaComputation& comparator) {\n auto operands_shapes = builder->GetOperandShapes(operands).ValueOrDie();\n int64_t rank = operands_shapes[0].rank();\n int64_t num_operands = operands.size();\n\n auto sorted_results = Sort(operands, comparator, reduction_dim);\n std::vector<int64_t> slice_start_indices(rank, 0);\n std::vector<int64_t> slice_limit_indices;\n std::vector<int64_t> slice_strides(rank, 1);\n slice_limit_indices.insert(slice_limit_indices.begin(),\n operands_shapes[0].dimensions().begin(),\n operands_shapes[0].dimensions().end());\n\n std::vector<XlaOp> sliced_results;\n sliced_results.reserve(num_operands);\n for (int i = 0; i < num_operands; ++i) {\n sliced_results.push_back(Slice(GetTupleElement(sorted_results, i),\n slice_start_indices, slice_limit_indices,\n slice_strides));\n }\n return Tuple(builder, sliced_results);\n}\n\nXlaOp ApproxTopK(XlaBuilder* builder, absl::Span<const XlaOp> operands,\n absl::Span<const XlaOp> init_values, int64_t top_k,\n int64_t reduction_dim, const XlaComputation& comparator,\n float recall_target, bool aggregate_to_topk) {\n \/\/ Validates shapes and ranks\n if (operands.size() != init_values.size()) {\n return builder->ReportError(\n InvalidArgument(\"operands and init_values size mismatch: %d vs %d\",\n operands.size(), init_values.size()));\n }\n auto num_operands = operands.size();\n auto operands_shapes = builder->GetOperandShapes(operands).ValueOrDie();\n auto init_values_shapes = builder->GetOperandShapes(init_values).ValueOrDie();\n std::vector<PrimitiveType> op_types;\n for (int i = 0; i < num_operands; ++i) {\n const auto& op_shape = operands_shapes[i];\n const auto& init_shape = init_values_shapes[i];\n if (op_shape.rank() == 0) {\n return builder->ReportError(\n InvalidArgument(\"ApproxTopK operands must have rank 1+.\"));\n }\n if (!ShapeUtil::CompatibleIgnoringElementType(operands_shapes[0],\n op_shape)) {\n return builder->ReportError(InvalidArgument(\n \"operands shape mismatch: %s vs %s\", operands_shapes[0].DebugString(),\n op_shape.DebugString()));\n }\n if (op_shape.element_type() != init_shape.element_type()) {\n return builder->ReportError(\n InvalidArgument(\"operands type mismatch: %s vs %s\",\n op_shape.DebugString(), init_shape.DebugString()));\n }\n\n op_types.push_back(op_shape.element_type());\n }\n int64_t rank = operands_shapes[0].rank();\n if (reduction_dim < 0 || reduction_dim >= rank) {\n return builder->ReportError(\n InvalidArgument(\"reduction_dim should range in [0,%d)\", rank));\n }\n\n auto reduction_computation =\n BuildReductionComputation(builder, op_types, comparator);\n\n \/\/ Fallback to variadic reduce when top_k == 1.\n \/\/ TODO(fchern): Approx-topk followed by variadic reduce might run faster\n \/\/ than running variadic reduce directly.\n if (top_k == 1) {\n return Reduce(builder, operands, init_values, reduction_computation,\n {reduction_dim});\n }\n\n uint64_t tpu_tiling = rank == 1 ? kTpuChunkTiling : kTpuLaneTiling;\n uint64_t n = operands_shapes[0].dimensions(reduction_dim);\n \/\/ ApproxTopK can only reduce elements larger than the tiling.\n if (n <= tpu_tiling) {\n if (aggregate_to_topk) {\n return SortAndSliceBuilder(builder, operands, top_k, reduction_dim,\n comparator);\n }\n return Tuple(builder, operands);\n }\n\n \/\/ Given number of data points N, K for top-k elements, and W for the size of\n \/\/ the reduce window, let M = Ceil(N \/ W) be the number of windows. The\n \/\/ expected number of top-k elements that doesn't collide in windows is\n \/\/\n \/\/ K * ((M - 1) \/ M)^{K - 1}\n \/\/\n \/\/ The recall of is the expected number of top-k elements divided by K\n \/\/\n \/\/ recall = ((M - 1) \/ M)^{K - 1}\n \/\/ = (1 - 1\/M)^{K - 1}\n \/\/ = (1 - 1\/M)^{-M * (K - 1)\/(-M)}\n \/\/ ~= EXP((1 - K) \/ M) for large M\n \/\/\n \/\/ => M = (1 - K)\/LOG(recall)\n if (recall_target <= 0. || recall_target > 1.0) {\n return builder->ReportError(\n InvalidArgument(\"recall_target should range in (0,1]\"));\n }\n uint64_t m = std::min(\n std::max(static_cast<uint64_t>((1.0 - top_k) \/ std::log(recall_target)),\n tpu_tiling),\n n);\n uint32_t log2_reduction = absl::bit_width(n \/ m) - 1; \/\/ floor(n \/ m)\n if (log2_reduction == 0) {\n if (aggregate_to_topk) {\n return SortAndSliceBuilder(builder, operands, top_k, reduction_dim,\n comparator);\n }\n return Tuple(builder, operands);\n }\n\n std::vector<XlaOp> partial_reduce_args;\n for (const auto& op : operands) {\n partial_reduce_args.push_back(op);\n }\n for (const auto& op : init_values) {\n partial_reduce_args.push_back(op);\n }\n int64_t output_reduction_size =\n CeilOfRatio<int64_t>(CeilOfRatio(n, tpu_tiling), (1 << log2_reduction)) *\n tpu_tiling;\n std::vector<Shape> approx_output_shapes;\n for (auto op_shape : operands_shapes) {\n op_shape.mutable_dimensions()[reduction_dim] = output_reduction_size;\n approx_output_shapes.push_back(op_shape);\n }\n auto approx_output_shape = ShapeUtil::MakeTupleShape(approx_output_shapes);\n \/\/ PartialReduce option in JSON form\n std::string partial_reduce_option =\n absl::StrFormat(\"{\\\"log2_reduction\\\": %d, \\\"reduction_dim\\\": %d}\",\n log2_reduction, reduction_dim);\n\n auto approx_topk = CustomCallWithComputation(\n builder, \"PartialReduce\", partial_reduce_args, reduction_computation,\n approx_output_shape, partial_reduce_option);\n\n if (aggregate_to_topk) {\n std::vector<XlaOp> approx_topk_results;\n approx_topk_results.reserve(num_operands);\n for (int i = 0; i < num_operands; ++i) {\n approx_topk_results.push_back(GetTupleElement(approx_topk, i));\n }\n return SortAndSliceBuilder(builder, approx_topk_results, top_k,\n reduction_dim, comparator);\n }\n return approx_topk;\n}\n\n} \/\/ namespace xla\n<commit_msg>[XLA:TPU] Update ApproxTopK to use native comparator.<commit_after>\/* Copyright 2021 The TensorFlow Authors. All Rights Reserved.\n\nLicensed under the Apache License, Version 2.0 (the \"License\");\nyou may not use this file except in compliance with the License.\nYou may obtain a copy of the License at\n\n http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n\nUnless required by applicable law or agreed to in writing, software\ndistributed under the License is distributed on an \"AS IS\" BASIS,\nWITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\nSee the License for the specific language governing permissions and\nlimitations under the License.\n==============================================================================*\/\n\n#include \"tensorflow\/compiler\/xla\/client\/lib\/approx_topk.h\"\n\n#include <string>\n\n#include \"absl\/numeric\/bits.h\"\n#include \"absl\/strings\/str_format.h\"\n#include \"tensorflow\/compiler\/xla\/client\/xla_builder.h\"\n#include \"tensorflow\/compiler\/xla\/client\/xla_computation.h\"\n#include \"tensorflow\/compiler\/xla\/shape.h\"\n#include \"tensorflow\/compiler\/xla\/shape_util.h\"\n#include \"tensorflow\/compiler\/xla\/util.h\"\n#include \"tensorflow\/compiler\/xla\/xla_data.pb.h\"\n\n\/\/ Used by rank 2+ operands\nconst uint64_t kTpuLaneTiling = 128;\n\/\/ Used by rank 1 operands.\nconst uint64_t kTpuChunkTiling = 1024;\n\nnamespace xla {\n\n\/\/ Converts a comparator to a combiner computation that can be fed to reduce or\n\/\/ partial reduce ops.\nXlaComputation BuildReductionComputation(\n XlaBuilder* builder, absl::Span<const PrimitiveType> op_types,\n const XlaComputation& comparator) {\n auto num_operands = op_types.size();\n std::vector<XlaOp> lhs_params;\n std::vector<XlaOp> rhs_params;\n int64_t param_number = 0;\n lhs_params.reserve(num_operands);\n rhs_params.reserve(num_operands);\n auto reduction_builder = builder->CreateSubBuilder(\"ReductionFn\");\n for (const auto& op_type : op_types) {\n lhs_params.push_back(Parameter(reduction_builder.get(), param_number,\n ShapeUtil::MakeScalarShape(op_type),\n absl::StrFormat(\"lhs.%d\", param_number)));\n param_number++;\n }\n for (const auto& op_type : op_types) {\n rhs_params.push_back(Parameter(reduction_builder.get(), param_number,\n ShapeUtil::MakeScalarShape(op_type),\n absl::StrFormat(\"rhs.%d\", param_number)));\n param_number++;\n }\n\n std::vector<XlaOp> comparator_args;\n comparator_args.reserve(num_operands * 2);\n for (int i = 0; i < num_operands; ++i) {\n comparator_args.push_back(lhs_params[i]);\n comparator_args.push_back(rhs_params[i]);\n }\n auto pred = Call(reduction_builder.get(), comparator, comparator_args);\n std::vector<XlaOp> results;\n results.reserve(num_operands);\n for (int i = 0; i < num_operands; ++i) {\n results.push_back(Select(pred, lhs_params[i], rhs_params[i]));\n }\n Tuple(reduction_builder.get(), results);\n return reduction_builder->BuildAndNoteError();\n}\n\nXlaOp SortAndSliceBuilder(XlaBuilder* builder, absl::Span<const XlaOp> operands,\n int64_t top_k, int64_t reduction_dim,\n const XlaComputation& comparator) {\n auto operands_shapes = builder->GetOperandShapes(operands).ValueOrDie();\n int64_t rank = operands_shapes[0].rank();\n int64_t num_operands = operands.size();\n\n auto sorted_results = Sort(operands, comparator, reduction_dim);\n std::vector<int64_t> slice_start_indices(rank, 0);\n std::vector<int64_t> slice_limit_indices;\n std::vector<int64_t> slice_strides(rank, 1);\n slice_limit_indices.insert(slice_limit_indices.begin(),\n operands_shapes[0].dimensions().begin(),\n operands_shapes[0].dimensions().end());\n\n std::vector<XlaOp> sliced_results;\n sliced_results.reserve(num_operands);\n for (int i = 0; i < num_operands; ++i) {\n sliced_results.push_back(Slice(GetTupleElement(sorted_results, i),\n slice_start_indices, slice_limit_indices,\n slice_strides));\n }\n return Tuple(builder, sliced_results);\n}\n\nXlaOp ApproxTopK(XlaBuilder* builder, absl::Span<const XlaOp> operands,\n absl::Span<const XlaOp> init_values, int64_t top_k,\n int64_t reduction_dim, const XlaComputation& comparator,\n float recall_target, bool aggregate_to_topk) {\n \/\/ Validates shapes and ranks\n if (operands.size() != init_values.size()) {\n return builder->ReportError(\n InvalidArgument(\"operands and init_values size mismatch: %d vs %d\",\n operands.size(), init_values.size()));\n }\n auto num_operands = operands.size();\n auto operands_shapes = builder->GetOperandShapes(operands).ValueOrDie();\n auto init_values_shapes = builder->GetOperandShapes(init_values).ValueOrDie();\n std::vector<PrimitiveType> op_types;\n for (int i = 0; i < num_operands; ++i) {\n const auto& op_shape = operands_shapes[i];\n const auto& init_shape = init_values_shapes[i];\n if (op_shape.rank() == 0) {\n return builder->ReportError(\n InvalidArgument(\"ApproxTopK operands must have rank 1+.\"));\n }\n if (!ShapeUtil::CompatibleIgnoringElementType(operands_shapes[0],\n op_shape)) {\n return builder->ReportError(InvalidArgument(\n \"operands shape mismatch: %s vs %s\", operands_shapes[0].DebugString(),\n op_shape.DebugString()));\n }\n if (op_shape.element_type() != init_shape.element_type()) {\n return builder->ReportError(\n InvalidArgument(\"operands type mismatch: %s vs %s\",\n op_shape.DebugString(), init_shape.DebugString()));\n }\n\n op_types.push_back(op_shape.element_type());\n }\n int64_t rank = operands_shapes[0].rank();\n if (reduction_dim < 0 || reduction_dim >= rank) {\n return builder->ReportError(\n InvalidArgument(\"reduction_dim should range in [0,%d)\", rank));\n }\n\n auto reduction_computation =\n BuildReductionComputation(builder, op_types, comparator);\n\n \/\/ Fallback to variadic reduce when top_k == 1.\n \/\/ TODO(fchern): Approx-topk followed by variadic reduce might run faster\n \/\/ than running variadic reduce directly.\n if (top_k == 1) {\n return Reduce(builder, operands, init_values, reduction_computation,\n {reduction_dim});\n }\n\n uint64_t tpu_tiling = rank == 1 ? kTpuChunkTiling : kTpuLaneTiling;\n uint64_t n = operands_shapes[0].dimensions(reduction_dim);\n \/\/ ApproxTopK can only reduce elements larger than the tiling.\n if (n <= tpu_tiling) {\n if (aggregate_to_topk) {\n return SortAndSliceBuilder(builder, operands, top_k, reduction_dim,\n comparator);\n }\n return Tuple(builder, operands);\n }\n\n \/\/ Given number of data points N, K for top-k elements, and W for the size of\n \/\/ the reduce window, let M = Ceil(N \/ W) be the number of windows. The\n \/\/ expected number of top-k elements that doesn't collide in windows is\n \/\/\n \/\/ K * ((M - 1) \/ M)^{K - 1}\n \/\/\n \/\/ The recall of is the expected number of top-k elements divided by K\n \/\/\n \/\/ recall = ((M - 1) \/ M)^{K - 1}\n \/\/ = (1 - 1\/M)^{K - 1}\n \/\/ = (1 - 1\/M)^{-M * (K - 1)\/(-M)}\n \/\/ ~= EXP((1 - K) \/ M) for large M\n \/\/\n \/\/ => M = (1 - K)\/LOG(recall)\n if (recall_target <= 0. || recall_target > 1.0) {\n return builder->ReportError(\n InvalidArgument(\"recall_target should range in (0,1]\"));\n }\n uint64_t m = std::min(\n std::max(static_cast<uint64_t>((1.0 - top_k) \/ std::log(recall_target)),\n tpu_tiling),\n n);\n uint32_t log2_reduction = absl::bit_width(n \/ m) - 1; \/\/ floor(n \/ m)\n if (log2_reduction == 0) {\n if (aggregate_to_topk) {\n return SortAndSliceBuilder(builder, operands, top_k, reduction_dim,\n comparator);\n }\n return Tuple(builder, operands);\n }\n\n std::vector<XlaOp> partial_reduce_args;\n for (const auto& op : operands) {\n partial_reduce_args.push_back(op);\n }\n for (const auto& op : init_values) {\n partial_reduce_args.push_back(op);\n }\n int64_t output_reduction_size =\n CeilOfRatio<int64_t>(CeilOfRatio(n, tpu_tiling), (1 << log2_reduction)) *\n tpu_tiling;\n std::vector<Shape> approx_output_shapes;\n for (auto op_shape : operands_shapes) {\n op_shape.mutable_dimensions()[reduction_dim] = output_reduction_size;\n approx_output_shapes.push_back(op_shape);\n }\n auto approx_output_shape = ShapeUtil::MakeTupleShape(approx_output_shapes);\n \/\/ PartialReduce option in JSON form\n std::string partial_reduce_option = absl::StrFormat(\n \"{\\\"log2_reduction\\\": %d, \\\"reduction_dim\\\": %d, \\\"to_apply_type\\\": \"\n \"\\\"comparator\\\"}\",\n log2_reduction, reduction_dim);\n\n auto approx_topk = CustomCallWithComputation(\n builder, \"PartialReduce\", partial_reduce_args, comparator,\n approx_output_shape, partial_reduce_option);\n\n if (aggregate_to_topk) {\n std::vector<XlaOp> approx_topk_results;\n approx_topk_results.reserve(num_operands);\n for (int i = 0; i < num_operands; ++i) {\n approx_topk_results.push_back(GetTupleElement(approx_topk, i));\n }\n return SortAndSliceBuilder(builder, approx_topk_results, top_k,\n reduction_dim, comparator);\n }\n return approx_topk;\n}\n\n} \/\/ namespace xla\n<|endoftext|>"} {"text":"<commit_before>\/\/ REQUIRES: x86-registered-target,x86-64-registered-target\n\/\/ RUN: %clang_cc1 -triple x86_64-apple-darwin -std=c++11 -S %s -o %t-64.s\n\/\/ RUN: FileCheck -check-prefix CHECK-LP64 --input-file=%t-64.s %s\n\/\/ RUN: %clang_cc1 -triple i386-apple-darwin -std=c++11 -S %s -o %t-32.s\n\/\/ RUN: FileCheck -check-prefix CHECK-LP32 --input-file=%t-32.s %s\n\nstruct A { A(const A&, int i1 = 1); };\n\nstruct B : A { };\n\nA f(const B &b) {\n return b;\n}\n\n\/\/ CHECK-LP64: callq __ZN1AC1ERKS_i\n\n\/\/ CHECK-LP32: calll L__ZN1AC1ERKS_i\n\n\n<commit_msg>Check IR instead of assembly in this test.<commit_after>\/\/ RUN: %clang_cc1 -triple x86_64-apple-darwin -std=c++11 -emit-llvm %s -o - | \\\n\/\/ RUN: FileCheck %s\n\/\/ RUN: %clang_cc1 -triple i386-apple-darwin -std=c++11 -emit-llvm %s -o - | \\\n\/\/ RUN: FileCheck %s\n\nstruct A { A(const A&, int i1 = 1); };\n\nstruct B : A { };\n\nA f(const B &b) {\n return b;\n}\n\n\/\/ CHECK: call void @_ZN1AC1ERKS_i\n<|endoftext|>"} {"text":"<commit_before>\/*=========================================================================\n\n Program: Visualization Toolkit\n Module: RibbonF.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 \"vtkMath.hh\"\n#include \"RibbonF.hh\"\n#include \"FPoints.hh\"\n#include \"FNormals.hh\"\n#include \"PolyLine.hh\"\n\n\/\/ Description:\n\/\/ Construct ribbon so that width is 0.1, no normal rotation, the width does \n\/\/ not vary with scalar values, and the width factor is 2.0.\nvtkRibbonFilter::vtkRibbonFilter()\n{\n this->Width = 0.5;\n this->Angle = 0.0;\n this->VaryWidth = 0;\n this->WidthFactor = 2.0;\n}\n\nvoid vtkRibbonFilter::Execute()\n{\n int i, j, k;\n vtkPoints *inPts;\n vtkNormals *inNormals;\n vtkPointData *pd;\n vtkCellArray *inLines;\n int numNewPts;\n vtkFloatPoints *newPts;\n vtkFloatNormals *newNormals;\n vtkCellArray *newStrips;\n int npts, *pts;\n float p[3], pNext[3];\n float *n;\n float s[3], sNext[3], sPrev[3], w[3];\n double BevelAngle;\n vtkMath math;\n float theta;\n int deleteNormals=0, ptId;\n vtkPolyData *input=(vtkPolyData *)this->Input;\n vtkScalars *inScalars=NULL;\n float sFactor=1.0, range[2];\n int ptOffset=0;\n\/\/\n\/\/ Initialize\n\/\/\n vtkDebugMacro(<<\"Creating ribbon\");\n this->Initialize();\n\n if ( !(inPts=input->GetPoints()) || \n (numNewPts=inPts->GetNumberOfPoints()*2) < 1 ||\n !(inLines = input->GetLines()) || inLines->GetNumberOfCells() < 1 )\n {\n vtkErrorMacro(<< \": No input data!\\n\");\n return;\n }\n\n \/\/ copy scalars, vectors, tcoords. Normals may be computed here.\n pd = input->GetPointData();\n this->PointData.CopyNormalsOff();\n this->PointData.CopyAllocate(pd,numNewPts);\n\n if ( !(inNormals=pd->GetNormals()) )\n {\n vtkPolyLine lineNormalGenerator;\n deleteNormals = 1;\n inNormals = new vtkFloatNormals(numNewPts);\n if ( !lineNormalGenerator.GenerateSlidingNormals(inPts,inLines,(vtkFloatNormals*)inNormals) )\n {\n vtkErrorMacro(<< \"No normals for line!\\n\");\n inNormals->Delete();\n return;\n }\n }\n\/\/\n\/\/ If varying width, get appropriate info.\n\/\/\n if ( this->VaryWidth && (inScalars=pd->GetScalars()) )\n {\n inScalars->GetRange(range);\n }\n\n newPts = new vtkFloatPoints(numNewPts);\n newNormals = new vtkFloatNormals(numNewPts);\n newStrips = new vtkCellArray;\n newStrips->Allocate(newStrips->EstimateSize(1,numNewPts));\n\/\/\n\/\/ Create pairs of points along the line that are later connected into a \n\/\/ triangle strip.\n\/\/\n theta = this->Angle * math.DegreesToRadians();\n for (inLines->InitTraversal(); inLines->GetNextCell(npts,pts); )\n {\n\/\/\n\/\/ Use \"averaged\" segment to create beveled effect. Watch out for first and \n\/\/ last points.\n\/\/\n for (j=0; j < npts; j++)\n {\n\n if ( j == 0 ) \/\/first point\n {\n inPts->GetPoint(pts[0],p);\n inPts->GetPoint(pts[1],pNext);\n for (i=0; i<3; i++) \n {\n sNext[i] = pNext[i] - p[i];\n sPrev[i] = sNext[i];\n }\n }\n\n else if ( j == (npts-1) ) \/\/last point\n {\n for (i=0; i<3; i++) \n {\n sPrev[i] = sNext[i];\n p[i] = pNext[i];\n }\n }\n\n else\n {\n for (i=0; i<3; i++) p[i] = pNext[i];\n inPts->GetPoint(pts[j+1],pNext);\n for (i=0; i<3; i++)\n {\n sPrev[i] = sNext[i];\n sNext[i] = pNext[i] - p[i];\n }\n }\n\n n = inNormals->GetNormal(pts[j]);\n\n if ( math.Normalize(sNext) == 0.0 )\n {\n vtkErrorMacro(<<\"Coincident points!\");\n return;\n }\n\n for (i=0; i<3; i++) s[i] = (sPrev[i] + sNext[i]) \/ 2.0; \/\/average vector\n math.Normalize(s);\n \n if ( (BevelAngle = math.Dot(sNext,sPrev)) > 1.0 ) BevelAngle = 1.0;\n if ( BevelAngle < -1.0 ) BevelAngle = -1.0;\n BevelAngle = acos((double)BevelAngle) \/ 2.0; \/\/(0->90 degrees)\n if ( (BevelAngle = cos(BevelAngle)) == 0.0 ) BevelAngle = 1.0;\n\n BevelAngle = this->Width \/ BevelAngle;\n\n math.Cross(s,n,w);\n if ( math.Normalize(w) == 0.0)\n {\n vtkErrorMacro(<<\"Bad normal!\");\n return;\n }\n \n if ( inScalars )\n sFactor = 1.0 + ((this->WidthFactor - 1.0) * \n (inScalars->GetScalar(j) - range[0]) \/ (range[1]-range[0]));\n\n for (i=0; i<3; i++) s[i] = p[i] + w[i] * BevelAngle * sFactor;\n ptId = newPts->InsertNextPoint(s);\n newNormals->InsertNormal(ptId,n);\n this->PointData.CopyData(pd,pts[j],ptId);\n\n for (i=0; i<3; i++) s[i] = p[i] - w[i] * BevelAngle * sFactor;\n ptId = newPts->InsertNextPoint(s);\n newNormals->InsertNormal(ptId,n);\n this->PointData.CopyData(pd,pts[j],ptId);\n }\n\/\/\n\/\/ Generate the strip topology\n\/\/\n newStrips->InsertNextCell(npts*2);\n for (i=0; i < npts; i++) \n {\n newStrips->InsertCellPoint(ptOffset+2*i);\n newStrips->InsertCellPoint(ptOffset+2*i+1);\n }\n \n ptOffset += npts*2;\n } \/\/for this line\n\/\/\n\/\/ Update ourselves\n\/\/\n if ( deleteNormals ) inNormals->Delete();\n\n this->SetPoints(newPts);\n newPts->Delete();\n\n this->SetStrips(newStrips);\n newStrips->Delete();\n\n this->PointData.SetNormals(newNormals);\n newNormals->Delete();\n\n this->Squeeze();\n}\n\nvoid vtkRibbonFilter::PrintSelf(ostream& os, vtkIndent indent)\n{\n vtkPolyToPolyFilter::PrintSelf(os,indent);\n\n os << indent << \"Width: \" << this->Width << \"\\n\";\n os << indent << \"Angle: \" << this->Angle << \"\\n\";\n os << indent << \"VaryWidth: \" << (this->VaryWidth ? \"On\\n\" : \"Off\\n\");\n os << indent << \"Width Factor: \" << this->WidthFactor << \"\\n\";\n}\n\n<commit_msg>removed unused variable<commit_after>\/*=========================================================================\n\n Program: Visualization Toolkit\n Module: RibbonF.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 \"vtkMath.hh\"\n#include \"RibbonF.hh\"\n#include \"FPoints.hh\"\n#include \"FNormals.hh\"\n#include \"PolyLine.hh\"\n\n\/\/ Description:\n\/\/ Construct ribbon so that width is 0.1, no normal rotation, the width does \n\/\/ not vary with scalar values, and the width factor is 2.0.\nvtkRibbonFilter::vtkRibbonFilter()\n{\n this->Width = 0.5;\n this->Angle = 0.0;\n this->VaryWidth = 0;\n this->WidthFactor = 2.0;\n}\n\nvoid vtkRibbonFilter::Execute()\n{\n int i, j;\n vtkPoints *inPts;\n vtkNormals *inNormals;\n vtkPointData *pd;\n vtkCellArray *inLines;\n int numNewPts;\n vtkFloatPoints *newPts;\n vtkFloatNormals *newNormals;\n vtkCellArray *newStrips;\n int npts, *pts;\n float p[3], pNext[3];\n float *n;\n float s[3], sNext[3], sPrev[3], w[3];\n double BevelAngle;\n vtkMath math;\n float theta;\n int deleteNormals=0, ptId;\n vtkPolyData *input=(vtkPolyData *)this->Input;\n vtkScalars *inScalars=NULL;\n float sFactor=1.0, range[2];\n int ptOffset=0;\n\/\/\n\/\/ Initialize\n\/\/\n vtkDebugMacro(<<\"Creating ribbon\");\n this->Initialize();\n\n if ( !(inPts=input->GetPoints()) || \n (numNewPts=inPts->GetNumberOfPoints()*2) < 1 ||\n !(inLines = input->GetLines()) || inLines->GetNumberOfCells() < 1 )\n {\n vtkErrorMacro(<< \": No input data!\\n\");\n return;\n }\n\n \/\/ copy scalars, vectors, tcoords. Normals may be computed here.\n pd = input->GetPointData();\n this->PointData.CopyNormalsOff();\n this->PointData.CopyAllocate(pd,numNewPts);\n\n if ( !(inNormals=pd->GetNormals()) )\n {\n vtkPolyLine lineNormalGenerator;\n deleteNormals = 1;\n inNormals = new vtkFloatNormals(numNewPts);\n if ( !lineNormalGenerator.GenerateSlidingNormals(inPts,inLines,(vtkFloatNormals*)inNormals) )\n {\n vtkErrorMacro(<< \"No normals for line!\\n\");\n inNormals->Delete();\n return;\n }\n }\n\/\/\n\/\/ If varying width, get appropriate info.\n\/\/\n if ( this->VaryWidth && (inScalars=pd->GetScalars()) )\n {\n inScalars->GetRange(range);\n }\n\n newPts = new vtkFloatPoints(numNewPts);\n newNormals = new vtkFloatNormals(numNewPts);\n newStrips = new vtkCellArray;\n newStrips->Allocate(newStrips->EstimateSize(1,numNewPts));\n\/\/\n\/\/ Create pairs of points along the line that are later connected into a \n\/\/ triangle strip.\n\/\/\n theta = this->Angle * math.DegreesToRadians();\n for (inLines->InitTraversal(); inLines->GetNextCell(npts,pts); )\n {\n\/\/\n\/\/ Use \"averaged\" segment to create beveled effect. Watch out for first and \n\/\/ last points.\n\/\/\n for (j=0; j < npts; j++)\n {\n\n if ( j == 0 ) \/\/first point\n {\n inPts->GetPoint(pts[0],p);\n inPts->GetPoint(pts[1],pNext);\n for (i=0; i<3; i++) \n {\n sNext[i] = pNext[i] - p[i];\n sPrev[i] = sNext[i];\n }\n }\n\n else if ( j == (npts-1) ) \/\/last point\n {\n for (i=0; i<3; i++) \n {\n sPrev[i] = sNext[i];\n p[i] = pNext[i];\n }\n }\n\n else\n {\n for (i=0; i<3; i++) p[i] = pNext[i];\n inPts->GetPoint(pts[j+1],pNext);\n for (i=0; i<3; i++)\n {\n sPrev[i] = sNext[i];\n sNext[i] = pNext[i] - p[i];\n }\n }\n\n n = inNormals->GetNormal(pts[j]);\n\n if ( math.Normalize(sNext) == 0.0 )\n {\n vtkErrorMacro(<<\"Coincident points!\");\n return;\n }\n\n for (i=0; i<3; i++) s[i] = (sPrev[i] + sNext[i]) \/ 2.0; \/\/average vector\n math.Normalize(s);\n \n if ( (BevelAngle = math.Dot(sNext,sPrev)) > 1.0 ) BevelAngle = 1.0;\n if ( BevelAngle < -1.0 ) BevelAngle = -1.0;\n BevelAngle = acos((double)BevelAngle) \/ 2.0; \/\/(0->90 degrees)\n if ( (BevelAngle = cos(BevelAngle)) == 0.0 ) BevelAngle = 1.0;\n\n BevelAngle = this->Width \/ BevelAngle;\n\n math.Cross(s,n,w);\n if ( math.Normalize(w) == 0.0)\n {\n vtkErrorMacro(<<\"Bad normal!\");\n return;\n }\n \n if ( inScalars )\n sFactor = 1.0 + ((this->WidthFactor - 1.0) * \n (inScalars->GetScalar(j) - range[0]) \/ (range[1]-range[0]));\n\n for (i=0; i<3; i++) s[i] = p[i] + w[i] * BevelAngle * sFactor;\n ptId = newPts->InsertNextPoint(s);\n newNormals->InsertNormal(ptId,n);\n this->PointData.CopyData(pd,pts[j],ptId);\n\n for (i=0; i<3; i++) s[i] = p[i] - w[i] * BevelAngle * sFactor;\n ptId = newPts->InsertNextPoint(s);\n newNormals->InsertNormal(ptId,n);\n this->PointData.CopyData(pd,pts[j],ptId);\n }\n\/\/\n\/\/ Generate the strip topology\n\/\/\n newStrips->InsertNextCell(npts*2);\n for (i=0; i < npts; i++) \n {\n newStrips->InsertCellPoint(ptOffset+2*i);\n newStrips->InsertCellPoint(ptOffset+2*i+1);\n }\n \n ptOffset += npts*2;\n } \/\/for this line\n\/\/\n\/\/ Update ourselves\n\/\/\n if ( deleteNormals ) inNormals->Delete();\n\n this->SetPoints(newPts);\n newPts->Delete();\n\n this->SetStrips(newStrips);\n newStrips->Delete();\n\n this->PointData.SetNormals(newNormals);\n newNormals->Delete();\n\n this->Squeeze();\n}\n\nvoid vtkRibbonFilter::PrintSelf(ostream& os, vtkIndent indent)\n{\n vtkPolyToPolyFilter::PrintSelf(os,indent);\n\n os << indent << \"Width: \" << this->Width << \"\\n\";\n os << indent << \"Angle: \" << this->Angle << \"\\n\";\n os << indent << \"VaryWidth: \" << (this->VaryWidth ? \"On\\n\" : \"Off\\n\");\n os << indent << \"Width Factor: \" << this->WidthFactor << \"\\n\";\n}\n\n<|endoftext|>"} {"text":"<commit_before>AliAnalysisTaskElectronEfficiencyV2* AddTask_rbailhac_ElectronEfficiencyV2_PbPb(Bool_t getFromAlien = kFALSE,\n\t\t\t\t\t\t\t\t\t\tTString cFileName =\"Config_rbailhac_ElectronEfficiencyV2_PbPb.C\",\n\t\t\t\t\t\t\t\t\t\tUInt_t trigger = AliVEvent::kINT7,\n\t\t\t\t\t\t\t\t\t\tBool_t rejpileup = kTRUE,\n\t\t\t\t\t\t\t\t\t\tconst Int_t CenMin = 0,\n\t\t\t\t\t\t\t\t\t\tconst Int_t CenMax = 10,\n\t\t\t\t\t\t\t\t\t\tconst Float_t PtMin = 0.2,\n\t\t\t\t\t\t\t\t\t\tconst Float_t PtMax = 10.0,\n\t\t\t\t\t\t\t\t\t\tconst Float_t EtaMin = -0.8,\n\t\t\t\t\t\t\t\t\t\tconst Float_t EtaMax = +0.8,\n\t\t\t\t\t\t\t\t\t\tconst Bool_t UsePtVec = kTRUE,\n\t\t\t\t\t\t\t\t\t\tconst Bool_t DoULSLS = kTRUE,\n\t\t\t\t\t\t\t\t\t\tconst TString generators = \"pizero_0;eta_1;etaprime_2;rho_3;omega_4;phi_5;jpsi_6;Pythia CC_0;Pythia BB_0;Pythia B_0;\",\n\t\t\t\t\t\t\t\t\t\tconst Bool_t isLHC19f2 = kTRUE,\n\t\t\t\t\t\t\t\t\t\tconst std::string resolutionFilename =\"\",\n\t\t\t\t\t\t\t\t\t\tconst std::string cocktailFilename =\"\",\n\t\t\t\t\t\t\t\t\t\tconst std::string centralityFilename =\"\",\n\t\t\t\t\t\t\t\t\t\tconst TString outname = \"LMEE.root\")\n{\n\n \/\/get the current analysis manager\n AliAnalysisManager *mgr = AliAnalysisManager::GetAnalysisManager();\n if (!mgr) {\n Error(\"AddTask_rbailhac_test\", \"No analysis manager found.\");\n return 0;\n }\n \n \/\/Base Directory for GRID \/ LEGO Train\n TString configBasePath= \"$ALICE_PHYSICS\/PWGDQ\/dielectron\/macrosLMEE\/\";\n if(getFromAlien && (!gSystem->Exec(Form(\"alien_cp alien:\/\/\/alice\/cern.ch\/user\/r\/rbailhac\/PWGDQ\/dielectron\/macrosLMEE\/%s .\",cFileName.Data()))) ){\n configBasePath=Form(\"%s\/\",gSystem->pwd());\n }\n\n TString configFilePath(configBasePath+cFileName);\n\n std::cout << \"Configpath: \" << configFilePath << std::endl;\n\n if (!gROOT->GetListOfGlobalFunctions()->FindObject(\"Config_rbailhac_ElectronEfficiencyV2_PbPb\")) {\n printf(\"Load macro now\\n\");\n gROOT->LoadMacro(configFilePath.Data());\n }\n\n \/\/ trigger\n TString triggername = \"NULL\";\n if(trigger == (UInt_t)AliVEvent::kINT7) triggername = \"kINT7\";\n else if(trigger == (UInt_t)AliVEvent::kCentral) triggername = \"kCentral\";\n else if(trigger == (UInt_t)AliVEvent::kSemiCentral) triggername = \"kSemiCentral\";\n else if(trigger == (UInt_t)(AliVEvent::kINT7 | AliVEvent::kCentral | AliVEvent::kSemiCentral)) triggername = \"kCombinedCentralityTriggers\";\n else if(trigger == (UInt_t)(AliVEvent::kINT7 | AliVEvent::kCentral)) triggername = \"kCombinedCentral\";\n else if(trigger == (UInt_t)(AliVEvent::kINT7 | AliVEvent::kSemiCentral)) triggername = \"kCombinedSemiCentral\";\n\n \/\/ generators\n TString suffixgen = \"\";\n if(generators.Contains(\"Pythia CC\") && (generators.Contains(\"Pythia BB\") || generators.Contains(\"Pythia B\"))) suffixgen = \"_CC_BB\";\n else if(generators.Contains(\"Pythia CC\")) suffixgen = \"_CC\";\n else if(generators.Contains(\"Pythia BB\") || generators.Contains(\"Pythia B\")) suffixgen = \"_BB\";\n else if(generators.Contains(\"pizero_0\")) suffixgen = \"_LF\";\n else suffixgen = \"\";\n \n \/\/create task and add it to the manager (MB)\n TString appendix;\n appendix += TString::Format(\"Cen%d_%d_%s_%s\",CenMin,CenMax,triggername.Data(),suffixgen.Data());\n printf(\"appendix %s\\n\", appendix.Data());\n\n \/\/##########################################################\n \/\/############################################################\n \/\/ Creating an instance of the task\n AliAnalysisTaskElectronEfficiencyV2* task = new AliAnalysisTaskElectronEfficiencyV2(Form(\"TaskElectronEfficiencyV2_%s\",appendix.Data()));\n gROOT->GetListOfSpecials()->Add(task);\/\/this is only for ProcessLine(AddMCSignal);\n\n \n \/\/ #########################################################\n \/\/ #########################################################\n \/\/ Set TOF correction\n \/\/ if(tofcor){\n \/\/ SetEtaCorrectionTOFRMS(task, AliDielectronVarManager::kP, AliDielectronVarManager::kEta);\n \/\/ SetEtaCorrectionTOFMean(task, AliDielectronVarManager::kP, AliDielectronVarManager::kEta); \n \/\/}\n\n \/\/ #########################################################\n \/\/ #########################################################\n \/\/ Event selection. Is the same for all the different cutsettings\n task->SetEnablePhysicsSelection(kTRUE);\/\/always ON in Run2 analyses for both data and MC.\n task->SetTriggerMask(trigger);\n task->SetEventFilter((reinterpret_cast<AliDielectronEventCuts*>(gROOT->ProcessLine(Form(\"GetEventCuts(%f,%f,%d,\\\"%s\\\")\",(Float_t)CenMin,(Float_t)CenMax,rejpileup,\"V0M\")))));\n\n \n \/\/ #########################################################\n \/\/ #########################################################\n \/\/ Set minimum and maximum values of generated tracks. Only used to save computing power.\n \/\/ Do not set here your analysis pt-cuts\n task->SetMinPtGen(0.1);\n task->SetMaxPtGen(1e+10);\n task->SetMinEtaGen(-1.5);\n task->SetMaxEtaGen(+1.5);\n\n\n \/\/ #########################################################\n \/\/ #########################################################\n \/\/ Set minimum and maximum values for pairing\n task->SetKinematicCuts(PtMin, PtMax, EtaMin, EtaMax);\n\n\n \/\/ #########################################################\n \/\/ #########################################################\n \/\/ Set Binning single variables\n if (UsePtVector == true) {\n std::vector<double> ptBinsVec;\n const Int_t nBinsPt = (Int_t)gROOT->ProcessLine(\"GetnBinsPt()\");\n for (unsigned int i = 0; i < nBinsPt+1; ++i){\n ptBinsVec.push_back(reinterpret_cast<Double_t>(gROOT->ProcessLine(Form(\"GetptBins(%d)\",i))));\n }\n task->SetPtBins(ptBinsVec);\n }\n else task->SetPtBinsLinear (0, 10, 100);\n task->SetEtaBinsLinear (-1.,1.,20); \/\/ 40 before\n task->SetPhiBinsLinear (0, TMath::TwoPi(), 36); \/\/ 90 before\n task->SetThetaBinsLinear(0, TMath::TwoPi(), 60);\n\n \/\/ pair variables\n const Int_t Nmee = 150;\n Double_t mee[Nmee] = {};\n for(Int_t i=0 ;i<110 ;i++) mee[i] = 0.01 * (i- 0) + 0.0;\/\/from 0 to 1.1 GeV\/c2, every 0.01 GeV\/c2\n for(Int_t i=110;i<Nmee;i++) mee[i] = 0.1 * (i-110) + 1.1;\/\/from 1.1 to 5 GeV\/c2, evety 0.1 GeV\/c2\n std::vector<double> v_mee(mee,std::end(mee));\n \n const Int_t NpTee = 121;\n Double_t pTee[NpTee] = {};\n for(Int_t i=0 ;i<10 ;i++) pTee[i] = 0.01 * (i- 0) + 0.0;\/\/from 0 to 0.09 GeV\/c, every 0.01 GeV\/c\n for(Int_t i=10 ;i<110 ;i++) pTee[i] = 0.1 * (i- 10) + 0.1;\/\/from 0.1 to 10 GeV\/c, evety 0.1 GeV\/c\n for(Int_t i=110;i<NpTee;i++) pTee[i] = 1.0 * (i-110) + 10.0;\/\/from 10 to 20 GeV\/c, evety 1.0 GeV\/c\n std::vector<double> v_pTee(pTee,std::end(pTee));\n task->SetMassBins(v_mee);\n task->SetPairPtBins(v_pTee);\n \/\/task->SetPhiVBinsLinear(0, TMath::Pi(), 100);\n \/\/task->SetFillPhiV(kTRUE);\n\n \n \/\/ #########################################################\n \/\/ #########################################################\n \/\/task->SetSmearGenerated(kFALSE); \/\/ cross check smearing the MC at single level and filling resolution maps\n \/\/ Resolution File, If resoFilename = \"\" no correction is applied\n task->SetResolutionFile(resolutionFilename);\n task->SetResolutionFileFromAlien(\"\/alice\/cern.ch\/user\/r\/rbailhac\/supportFiles\/\" + resolutionFilename);\n task->SetResolutionDeltaPtBinsLinear (-10., 2., (Int_t)gROOT->ProcessLine(\"GetNbinsDeltaMom()\"));\n task->SetResolutionRelPtBinsLinear (0., 2., (Int_t)gROOT->ProcessLine(\"GetNbinsRelMom()\"));\n task->SetResolutionEtaBinsLinear (-0.4, 0.4, (Int_t)gROOT->ProcessLine(\"GetNbinsDeltaEta()\"));\n task->SetResolutionPhiBinsLinear (-0.4, 0.4, (Int_t)gROOT->ProcessLine(\"GetNbinsDeltaPhi()\"));\n task->SetResolutionThetaBinsLinear(-0.4, 0.4, (Int_t)gROOT->ProcessLine(\"GetNbinsDeltaTheta()\"));\n\n \/\/###########################################################\n \/\/############################################################\n \/\/ Set MCSignal and Cutsetting to fill the support histograms\n task->SetSupportHistoMCSignalAndCutsetting(0,0);\/\/fill support histograms for first MCsignal and first cutsetting\n\n \/\/ #########################################################\n \/\/ #########################################################\n \/\/ Set centrality correction. If resoFilename = \"\" no correction is applied\n task->SetCentralityFile(centralityFilename);\n\n \/\/ #########################################################\n \/\/ #########################################################\n \/\/ Pairing related config\n task->SetDoPairing(kTRUE);\n task->SetULSandLS(DoULSLS);\n\n \/\/#####################################################\n \/\/######################################################\n \/\/ Generators\n cout<<\"Efficiency based on MC generators: \" << generators <<endl;\n TString generatorsPair=generators;\n task->SetGeneratorMCSignalName(generatorsPair);\n task->SetGeneratorULSSignalName(generators);\n task->SetLHC19f2MC(isLHC19f2);\n\n \/\/###############################################\n \/\/##############################################\n task->SetCocktailWeighting(cocktailFilename);\n task->SetCocktailWeightingFromAlien(\"\/alice\/cern.ch\/user\/r\/rbailhac\/supportFiles\/\" + cocktailFilename);\n \n \/\/ #########################################################\n \/\/ #########################################################\n \/\/ Add MCSignals. Can be set to see differences of:\n \/\/ e.g. secondaries and primaries. or primaries from charm and resonances\n gROOT->ProcessLine(Form(\"AddSingleLegMCSignal(%s)\",task->GetName()));\/\/not task itself, task name\n gROOT->ProcessLine(Form(\"AddPairMCSignal(%s)\" ,task->GetName()));\/\/not task itself, task name\n\n\n \/\/ #########################################################\n \/\/ #########################################################\n \/\/ Adding cutsettings\n \/\/ Cuts\n \/\/ Number of cuts\n const Int_t nDie = (Int_t)gROOT->ProcessLine(\"GetN()\");\n \/\/add dielectron analysis with different cuts to the task\n for (Int_t i=0; i<nDie; ++i){ \/\/nDie defined in config file\n AliAnalysisFilter *filter = reinterpret_cast<AliAnalysisFilter*>(gROOT->ProcessLine(Form(\"Config_rbailhac_ElectronEfficiencyV2_PbPb(%d)\",i)));\n task->AddTrackCuts(filter);\n }\n \n\n \/\/########################################\n \/\/########################################\n TString outlistname = Form(\"efficiency_%s\",appendix.Data());\n const TString fileName = outname;\n mgr->AddTask(task);\n mgr->ConnectInput(task, 0, mgr->GetCommonInputContainer());\n mgr->ConnectOutput(task, 1, mgr->CreateContainer(outlistname, TList::Class(), AliAnalysisManager::kOutputContainer, Form(\"%s\",fileName.Data()));\n\n\n return task;\n}\n<commit_msg>Update macro<commit_after>AliAnalysisTaskElectronEfficiencyV2* AddTask_rbailhac_ElectronEfficiencyV2_PbPb(Bool_t getFromAlien = kFALSE,\n\t\t\t\t\t\t\t\t\t\tTString cFileName =\"Config_rbailhac_ElectronEfficiencyV2_PbPb.C\",\n\t\t\t\t\t\t\t\t\t\tUInt_t trigger = AliVEvent::kINT7,\n\t\t\t\t\t\t\t\t\t\tBool_t rejpileup = kTRUE,\n\t\t\t\t\t\t\t\t\t\tconst Int_t CenMin = 0,\n\t\t\t\t\t\t\t\t\t\tconst Int_t CenMax = 10,\n\t\t\t\t\t\t\t\t\t\tconst Float_t PtMin = 0.2,\n\t\t\t\t\t\t\t\t\t\tconst Float_t PtMax = 10.0,\n\t\t\t\t\t\t\t\t\t\tconst Float_t EtaMin = -0.8,\n\t\t\t\t\t\t\t\t\t\tconst Float_t EtaMax = +0.8,\n\t\t\t\t\t\t\t\t\t\tconst Bool_t UsePtVec = kTRUE,\n\t\t\t\t\t\t\t\t\t\tconst Bool_t DoULSLS = kTRUE,\n\t\t\t\t\t\t\t\t\t\tconst TString generators = \"pizero_0;eta_1;etaprime_2;rho_3;omega_4;phi_5;jpsi_6;Pythia CC_0;Pythia BB_0;Pythia B_0;\",\n\t\t\t\t\t\t\t\t\t\tconst std::string resolutionFilename =\"\",\n\t\t\t\t\t\t\t\t\t\tconst std::string cocktailFilename =\"\",\n\t\t\t\t\t\t\t\t\t\tconst std::string centralityFilename =\"\",\n\t\t\t\t\t\t\t\t\t\tconst TString outname = \"LMEE.root\")\n{\n\n \/\/get the current analysis manager\n AliAnalysisManager *mgr = AliAnalysisManager::GetAnalysisManager();\n if (!mgr) {\n Error(\"AddTask_rbailhac_test\", \"No analysis manager found.\");\n return 0;\n }\n \n \/\/Base Directory for GRID \/ LEGO Train\n TString configBasePath= \"$ALICE_PHYSICS\/PWGDQ\/dielectron\/macrosLMEE\/\";\n if(getFromAlien && (!gSystem->Exec(Form(\"alien_cp alien:\/\/\/alice\/cern.ch\/user\/r\/rbailhac\/PWGDQ\/dielectron\/macrosLMEE\/%s .\",cFileName.Data()))) ){\n configBasePath=Form(\"%s\/\",gSystem->pwd());\n }\n\n TString configFilePath(configBasePath+cFileName);\n\n std::cout << \"Configpath: \" << configFilePath << std::endl;\n\n if (!gROOT->GetListOfGlobalFunctions()->FindObject(\"Config_rbailhac_ElectronEfficiencyV2_PbPb\")) {\n printf(\"Load macro now\\n\");\n gROOT->LoadMacro(configFilePath.Data());\n }\n\n \/\/ trigger\n TString triggername = \"NULL\";\n if(trigger == (UInt_t)AliVEvent::kINT7) triggername = \"kINT7\";\n else if(trigger == (UInt_t)AliVEvent::kCentral) triggername = \"kCentral\";\n else if(trigger == (UInt_t)AliVEvent::kSemiCentral) triggername = \"kSemiCentral\";\n else if(trigger == (UInt_t)(AliVEvent::kINT7 | AliVEvent::kCentral | AliVEvent::kSemiCentral)) triggername = \"kCombinedCentralityTriggers\";\n else if(trigger == (UInt_t)(AliVEvent::kINT7 | AliVEvent::kCentral)) triggername = \"kCombinedCentral\";\n else if(trigger == (UInt_t)(AliVEvent::kINT7 | AliVEvent::kSemiCentral)) triggername = \"kCombinedSemiCentral\";\n\n \/\/ generators\n TString suffixgen = \"\";\n if(generators.Contains(\"Pythia CC\") && (generators.Contains(\"Pythia BB\") || generators.Contains(\"Pythia B\"))) suffixgen = \"_CC_BB\";\n else if(generators.Contains(\"Pythia CC\")) suffixgen = \"_CC\";\n else if(generators.Contains(\"Pythia BB\") || generators.Contains(\"Pythia B\")) suffixgen = \"_BB\";\n else if(generators.Contains(\"pizero_0\")) suffixgen = \"_LF\";\n else suffixgen = \"\";\n\n \/\/ generator index\n TString suffixgenID = \"\";\n std::vector<UInt_t> genID;\n const Int_t ngenID = (Int_t)gROOT->ProcessLine(\"GetGenID()\");\n if(ngenID > 0) {\n for (unsigned int i = 0; i < ngenID+1; ++i){\n genID.push_back(reinterpret_cast<UInt_t>(gROOT->ProcessLine(Form(\"GetGenID(%d)\",i))));\n suffixgenID += reinterpret_cast<UInt_t>(gROOT->ProcessLine(Form(\"GetGenID(%d)\",i)));\n }\n }\n \n \/\/create task and add it to the manager (MB)\n TString appendix;\n appendix += TString::Format(\"Cen%d_%d_%s_%s_%s\",CenMin,CenMax,triggername.Data(),suffixgen.Data(),suffixgenID.Data());\n printf(\"appendix %s\\n\", appendix.Data());\n\n \/\/##########################################################\n \/\/############################################################\n \/\/ Creating an instance of the task\n AliAnalysisTaskElectronEfficiencyV2* task = new AliAnalysisTaskElectronEfficiencyV2(Form(\"TaskElectronEfficiencyV2_%s\",appendix.Data()));\n gROOT->GetListOfSpecials()->Add(task);\/\/this is only for ProcessLine(AddMCSignal);\n\n \n \/\/ #########################################################\n \/\/ #########################################################\n \/\/ Set TOF correction\n \/\/ if(tofcor){\n \/\/ SetEtaCorrectionTOFRMS(task, AliDielectronVarManager::kP, AliDielectronVarManager::kEta);\n \/\/ SetEtaCorrectionTOFMean(task, AliDielectronVarManager::kP, AliDielectronVarManager::kEta); \n \/\/}\n\n \/\/ #########################################################\n \/\/ #########################################################\n \/\/ Event selection. Is the same for all the different cutsettings\n task->SetEnablePhysicsSelection(kTRUE);\/\/always ON in Run2 analyses for both data and MC.\n task->SetTriggerMask(trigger);\n task->SetEventFilter((reinterpret_cast<AliDielectronEventCuts*>(gROOT->ProcessLine(Form(\"GetEventCuts(%f,%f,%d,\\\"%s\\\")\",(Float_t)CenMin,(Float_t)CenMax,rejpileup,\"V0M\")))));\n\n \n \/\/ #########################################################\n \/\/ #########################################################\n \/\/ Set minimum and maximum values of generated tracks. Only used to save computing power.\n \/\/ Do not set here your analysis pt-cuts\n task->SetMinPtGen(0.1);\n task->SetMaxPtGen(1e+10);\n task->SetMinEtaGen(-1.5);\n task->SetMaxEtaGen(+1.5);\n\n\n \/\/ #########################################################\n \/\/ #########################################################\n \/\/ Set minimum and maximum values for pairing\n task->SetKinematicCuts(PtMin, PtMax, EtaMin, EtaMax);\n\n\n \/\/ #########################################################\n \/\/ #########################################################\n \/\/ Set Binning single variables\n if (UsePtVector == true) {\n std::vector<double> ptBinsVec;\n const Int_t nBinsPt = (Int_t)gROOT->ProcessLine(\"GetnBinsPt()\");\n for (unsigned int i = 0; i < nBinsPt+1; ++i){\n ptBinsVec.push_back(reinterpret_cast<Double_t>(gROOT->ProcessLine(Form(\"GetptBins(%d)\",i))));\n }\n task->SetPtBins(ptBinsVec);\n }\n else task->SetPtBinsLinear (0, 10, 100);\n task->SetEtaBinsLinear (-1.,1.,20); \/\/ 40 before\n task->SetPhiBinsLinear (0, TMath::TwoPi(), 36); \/\/ 90 before\n task->SetThetaBinsLinear(0, TMath::TwoPi(), 60);\n\n \/\/ pair variables\n const Int_t Nmee = 150;\n Double_t mee[Nmee] = {};\n for(Int_t i=0 ;i<110 ;i++) mee[i] = 0.01 * (i- 0) + 0.0;\/\/from 0 to 1.1 GeV\/c2, every 0.01 GeV\/c2\n for(Int_t i=110;i<Nmee;i++) mee[i] = 0.1 * (i-110) + 1.1;\/\/from 1.1 to 5 GeV\/c2, evety 0.1 GeV\/c2\n std::vector<double> v_mee(mee,std::end(mee));\n \n const Int_t NpTee = 121;\n Double_t pTee[NpTee] = {};\n for(Int_t i=0 ;i<10 ;i++) pTee[i] = 0.01 * (i- 0) + 0.0;\/\/from 0 to 0.09 GeV\/c, every 0.01 GeV\/c\n for(Int_t i=10 ;i<110 ;i++) pTee[i] = 0.1 * (i- 10) + 0.1;\/\/from 0.1 to 10 GeV\/c, evety 0.1 GeV\/c\n for(Int_t i=110;i<NpTee;i++) pTee[i] = 1.0 * (i-110) + 10.0;\/\/from 10 to 20 GeV\/c, evety 1.0 GeV\/c\n std::vector<double> v_pTee(pTee,std::end(pTee));\n task->SetMassBins(v_mee);\n task->SetPairPtBins(v_pTee);\n \/\/task->SetPhiVBinsLinear(0, TMath::Pi(), 100);\n \/\/task->SetFillPhiV(kTRUE);\n\n \n \/\/ #########################################################\n \/\/ #########################################################\n \/\/task->SetSmearGenerated(kFALSE); \/\/ cross check smearing the MC at single level and filling resolution maps\n \/\/ Resolution File, If resoFilename = \"\" no correction is applied\n task->SetResolutionFile(resolutionFilename);\n task->SetResolutionFileFromAlien(\"\/alice\/cern.ch\/user\/r\/rbailhac\/supportFiles\/\" + resolutionFilename);\n task->SetResolutionDeltaPtBinsLinear (-10., 2., (Int_t)gROOT->ProcessLine(\"GetNbinsDeltaMom()\"));\n task->SetResolutionRelPtBinsLinear (0., 2., (Int_t)gROOT->ProcessLine(\"GetNbinsRelMom()\"));\n task->SetResolutionEtaBinsLinear (-0.4, 0.4, (Int_t)gROOT->ProcessLine(\"GetNbinsDeltaEta()\"));\n task->SetResolutionPhiBinsLinear (-0.4, 0.4, (Int_t)gROOT->ProcessLine(\"GetNbinsDeltaPhi()\"));\n task->SetResolutionThetaBinsLinear(-0.4, 0.4, (Int_t)gROOT->ProcessLine(\"GetNbinsDeltaTheta()\"));\n\n \/\/###########################################################\n \/\/############################################################\n \/\/ Set MCSignal and Cutsetting to fill the support histograms\n task->SetSupportHistoMCSignalAndCutsetting(0,0);\/\/fill support histograms for first MCsignal and first cutsetting\n\n \/\/ #########################################################\n \/\/ #########################################################\n \/\/ Set centrality correction. If resoFilename = \"\" no correction is applied\n task->SetCentralityFile(centralityFilename);\n\n \/\/ #########################################################\n \/\/ #########################################################\n \/\/ Pairing related config\n task->SetDoPairing(kTRUE);\n task->SetULSandLS(DoULSLS);\n\n \/\/#####################################################\n \/\/######################################################\n \/\/ Generators\n cout<<\"Efficiency based on MC generators: \" << generators <<endl;\n TString generatorsPair=generators;\n task->SetGeneratorMCSignalName(generatorsPair);\n task->SetGeneratorULSSignalName(generators);\n\n\n \/\/#################################################\n \/\/#################################################\n \/\/ generator ID to select pile-up or not\n if(ngenID > 0) {\n task->SetGeneratorMCSignalIndex(genID);\n task->SetGeneratorULSSignalIndex(genID);\n task->SetCheckGenID(kTRUE);\n }\n \n \/\/###############################################\n \/\/##############################################\n task->SetCocktailWeighting(cocktailFilename);\n task->SetCocktailWeightingFromAlien(\"\/alice\/cern.ch\/user\/r\/rbailhac\/supportFiles\/\" + cocktailFilename);\n \n \/\/ #########################################################\n \/\/ #########################################################\n \/\/ Add MCSignals. Can be set to see differences of:\n \/\/ e.g. secondaries and primaries. or primaries from charm and resonances\n gROOT->ProcessLine(Form(\"AddSingleLegMCSignal(%s)\",task->GetName()));\/\/not task itself, task name\n gROOT->ProcessLine(Form(\"AddPairMCSignal(%s)\" ,task->GetName()));\/\/not task itself, task name\n\n\n \/\/ #########################################################\n \/\/ #########################################################\n \/\/ Adding cutsettings\n \/\/ Cuts\n \/\/ Number of cuts\n const Int_t nDie = (Int_t)gROOT->ProcessLine(\"GetN()\");\n \/\/add dielectron analysis with different cuts to the task\n for (Int_t i=0; i<nDie; ++i){ \/\/nDie defined in config file\n AliAnalysisFilter *filter = reinterpret_cast<AliAnalysisFilter*>(gROOT->ProcessLine(Form(\"Config_rbailhac_ElectronEfficiencyV2_PbPb(%d)\",i)));\n task->AddTrackCuts(filter);\n }\n \n\n \/\/########################################\n \/\/########################################\n TString outlistname = Form(\"efficiency_%s\",appendix.Data());\n const TString fileName = outname;\n mgr->AddTask(task);\n mgr->ConnectInput(task, 0, mgr->GetCommonInputContainer());\n mgr->ConnectOutput(task, 1, mgr->CreateContainer(outlistname, TList::Class(), AliAnalysisManager::kOutputContainer, Form(\"%s\",fileName.Data()));\n\n\n return task;\n}\n<|endoftext|>"} {"text":"<commit_before>#include \"Screen.hpp\"\n\n#include <sstream>\n#include <fstream>\n#include <cmath>\n\n\n\nScreen::Screen(const string& name, double width, double height, unsigned int dots_per_meter) :\n\tDevice(name, width, height, 0),\n\tm_dots_per_meter(dots_per_meter),\n\tm_pixel(ceil(dots_per_meter*dots_per_meter*width*height)),\n\tm_missed(0)\n{ }\n\n\n\nScreen::~Screen()\n{ }\n\n\n\nstring\nScreen::toString(unsigned int indent) const\n{\n\tstring indention = \"\";\n\tfor( unsigned int i=0; i<indent; i++ ){\n\t\tindention = indention + \"\\t\";\n\t}\n\t\n\tstringstream ss;\n\tss << indention << toLine() << \" (\"\n\t << \"width = \" << m_width << \" m, \"\n\t << \"height = \" << m_height << \" m, \"\n\t << \"dots_per_meter = \" << m_dots_per_meter << \", \"\n\t << \"missed = \" << m_missed \n\t << \") {\\n\";\n\t\n\tunsigned int cells_hor = m_dots_per_meter * m_width;\n\tunsigned int cells_ver = m_dots_per_meter * m_height;\n\t\n\tfor( unsigned int y=0; y<cells_ver; y++ ){\n\t\tss << indention << \"\\t\";\n\t\tfor( unsigned int x=0; x<cells_hor; x++ ){\n\t\t\tss << m_pixel[cells_hor * y + x] << \" \";\t\t\n\t\t}\n\t\tss << \"\\n\";\n\t}\n\tss << indention << \"}\";\t \n\treturn ss.str();\n}\n\t\n\n\nstring\nScreen::toLine(void) const\n{\n\treturn m_name==\"\"?\"Screen\":m_name;\n}\n\t\n\n\nostream&\noperator<<(ostream& os, const Screen& screen)\n{\n\treturn os << screen.toLine();\n}\n\n\n\nvoid\nScreen::transport(Ion& ion)\n{\n\tfillHistogram(ion.x(),ion.y());\n\tif( m_next != NULL ){\n\t\tm_next->transport(ion);\n\t}\n}\n\n\n\t\nvoid\nScreen::reset(void)\n{ \n\tfill(m_pixel.begin(), m_pixel.end(), 0);\n\tm_missed = 0;\n}\n\n\n\nvoid\nScreen::exportHistogram(const string& filename) const\n{\n\tofstream outfile;\n\toutfile.open(filename, ios::out | ios::trunc );\n\t\n\tunsigned int cells_hor = m_dots_per_meter * m_width;\n\tunsigned int x = 0;\n\tunsigned int y = 0;\n\toutfile << cells_hor << \"\\n\";\n\tfor( auto it = m_pixel.begin(); it<m_pixel.end(); it++ ){\n\t\toutfile << x << \",\" << y << \",\" << *it << \"\\n\";\n\t\tx++;\n\t\tif( x == cells_hor ){ \n\t\t\tx = 0;\n\t\t\ty++;\n\t\t} \n\t}\t\n\t\n\toutfile.close();\t\t\n}\n\n\n\nvoid \nScreen::exportHistogram(void) const\n{\n\texportHistogram(m_name + \".dat\");\n}\n\n\n\n\/\/ @TODO optimize\nvoid\nScreen::fillHistogram(double x, double y)\n{\n\tdouble half_width = 0.5*m_width;\n\tdouble half_height = 0.5*m_height;\n\tunsigned int dots_hor = m_dots_per_meter * m_width;\n\tunsigned int dots_ver = m_dots_per_meter * m_height;\n\t\t\n\tif ( x < half_width and\n\t\t x > -half_width and\n\t\t y < half_height and\n\t\t y > -half_height){\n\t\t\n\t\tdouble x_ = floor((x*m_dots_per_meter) + 0.5*dots_hor);\n\t\tdouble y_ = floor((y*m_dots_per_meter) + 0.5*dots_ver);\t\t\t\n\t\tunsigned int pos = dots_hor * y_ + x_;\n\t\t\n\t\tm_pixel[pos] += 1;\n\t} else {\n\t\tm_missed += 1;\n\t}\n}\n\n\n\n<commit_msg>histogram is now filled correctly<commit_after>#include \"Screen.hpp\"\n\n#include <sstream>\n#include <fstream>\n#include <cmath>\n\n\n\nScreen::Screen(const string& name, double width, double height, unsigned int dots_per_meter) :\n\tDevice(name, width, height, 0),\n\tm_dots_per_meter(dots_per_meter),\n\tm_pixel(ceil(dots_per_meter*dots_per_meter*width*height)),\n\tm_missed(0)\n{ }\n\n\n\nScreen::~Screen()\n{ }\n\n\n\nstring\nScreen::toString(unsigned int indent) const\n{\n\tstring indention = \"\";\n\tfor( unsigned int i=0; i<indent; i++ ){\n\t\tindention = indention + \"\\t\";\n\t}\n\t\n\tstringstream ss;\n\tss << indention << toLine() << \" (\"\n\t << \"width = \" << m_width << \" m, \"\n\t << \"height = \" << m_height << \" m, \"\n\t << \"dots_per_meter = \" << m_dots_per_meter << \", \"\n\t << \"missed = \" << m_missed \n\t << \") {\\n\";\n\t\n\tunsigned int cells_hor = m_dots_per_meter * m_width;\n\tunsigned int cells_ver = m_dots_per_meter * m_height;\n\t\n\tfor( unsigned int y=0; y<cells_ver; y++ ){\n\t\tss << indention << \"\\t\";\n\t\tfor( unsigned int x=0; x<cells_hor; x++ ){\n\t\t\tss << m_pixel[cells_hor * y + x] << \" \";\t\t\n\t\t}\n\t\tss << \"\\n\";\n\t}\n\tss << indention << \"}\";\t \n\treturn ss.str();\n}\n\t\n\n\nstring\nScreen::toLine(void) const\n{\n\treturn m_name==\"\"?\"Screen\":m_name;\n}\n\t\n\n\nostream&\noperator<<(ostream& os, const Screen& screen)\n{\n\treturn os << screen.toLine();\n}\n\n\n\nvoid\nScreen::transport(Ion& ion)\n{\n\tfillHistogram(ion.x(),ion.y());\n\tif( m_next != NULL ){\n\t\tm_next->transport(ion);\n\t}\n}\n\n\n\t\nvoid\nScreen::reset(void)\n{ \n\tfill(m_pixel.begin(), m_pixel.end(), 0);\n\tm_missed = 0;\n}\n\n\n\nvoid\nScreen::exportHistogram(const string& filename) const\n{\n\tofstream outfile;\n\toutfile.open(filename, ios::out | ios::trunc );\n\t\n\tunsigned int dots_hor = m_dots_per_meter * m_width;\n\tunsigned int dots_ver = m_dots_per_meter * m_height;\n\tunsigned int x = 0;\n\tunsigned int y = 0;\n\t\n\toutfile << dots_hor << \"\\n\";\n\toutfile << dots_ver << \"\\n\";\t\n\t\n\tfor( auto it = m_pixel.begin(); it<m_pixel.end(); it++ ){\n\t\toutfile << x << \",\" << y << \",\" << *it << \"\\n\";\n\t\tx++;\n\t\tif( x == dots_hor ){ \n\t\t\tx = 0;\n\t\t\ty++;\n\t\t} \n\t}\t\n\t\n\toutfile.close();\t\t\n}\n\n\n\nvoid \nScreen::exportHistogram(void) const\n{\n\texportHistogram(m_name + \".dat\");\n}\n\n\n\nvoid\nScreen::fillHistogram(double x, double y)\n{\n\tdouble half_width = 0.5 * m_width;\n\tdouble half_height = 0.5 * m_height;\n\tunsigned int dots_hor = m_dots_per_meter * m_width;\n\tunsigned int dots_ver = m_dots_per_meter * m_height;\n\t\t\n\tif ( x < half_width and\n\t\t x > -half_width and\n\t\t y < half_height and\n\t\t y > -half_height){\n\t\t\n\t\tdouble x_ = round((x * m_dots_per_meter) + 0.5 * dots_hor);\n\t\tdouble y_ = round((y * m_dots_per_meter) + 0.5 * dots_ver);\t\t\n\t\t\t\n\t\tunsigned int pos = dots_hor * y_ + x_;\n\t\t\n\t\tm_pixel[pos] += 1;\n\t} else {\n\t\tm_missed += 1;\n\t}\n}\n\n\n\n<|endoftext|>"} {"text":"<commit_before>#include <boost\/timer.hpp>\n\n#include <iostream>\n#include <fstream>\n\n#include \"search\/BucketPriorityQueue.hpp\"\n#include \"search\/Constants.hpp\"\n#include \"search\/astar\/AStar.hpp\"\n#include \"search\/hastar\/HAStar.hpp\"\n#include \"search\/switchback\/Switchback.hpp\"\n#include \"tiles\/Tiles.hpp\"\n#include \"tiles\/MacroTiles.hpp\"\n\nusing namespace std;\nusing namespace boost;\n\n\ntypedef AStar<TilesInstance15, TilesNode15> TilesAStar;\ntypedef HAStar<TilesInstance15, TilesNode15> TilesHAStar;\ntypedef Switchback<TilesInstance15, TilesNode15> TilesSwitchback;\n\ntypedef AStar<MacroTilesInstance15, TilesNode15> MacroTilesAStar;\ntypedef HAStar<MacroTilesInstance15, TilesNode15> MacroTilesHAStar;\ntypedef Switchback<MacroTilesInstance15, TilesNode15> MacroTilesSwitchback;\n\n\nvoid print_build_info(ostream &o)\n{\n o << \"tiles state hash caching is \"\n#ifdef CACHE_TILES_HASH_VALUE\n << \"enabled\" << endl;\n#else\n << \"disabled\" << endl;\n#endif\n\n o << \"tiles state blank index caching is \"\n#ifdef CACHE_TILES_BLANK_INDEX\n << \"enabled\" << endl;\n#else\n << \"disabled\" << endl;\n#endif\n\n o << \"node f-value caching is \"\n#ifdef CACHE_NODE_F_VALUE\n << \"enabled\" << endl;\n#else\n << \"disabled\" << endl;\n#endif\n\n o << \"Hierarchical A*'s H* caching is \"\n#ifdef HIERARCHICAL_A_STAR_CACHE_H_STAR\n << \"enabled\" << endl;\n#else\n << \"disabled\" << endl;\n#endif\n\n o << \"Hierarchical A*'s P-g caching is \"\n#ifdef HIERARCHICAL_A_STAR_CACHE_P_MINUS_G\n << \"enabled\" << endl;\n#else\n << \"disabled\" << endl;\n#endif\n\n o << \"Hierarchical A*'s optimal path caching is \"\n#ifdef HIERARCHICAL_A_STAR_CACHE_OPTIMAL_PATHS\n << \"enabled\" << endl;\n#else\n << \"disabled\" << endl;\n#endif\n\n o << \"NDEBUG is \"\n#ifdef NDEBUG\n << \"enabled\" << endl;\n#else\n << \"disabled\" << endl;\n#endif\n\n o << \"OUTPUT_SEARCH_PROGRESS is \"\n#ifdef OUTPUT_SEARCH_PROGRESS\n << \"enabled\" << endl;\n#else\n << \"disabled\" << endl;\n#endif\n\n o << \"INITIAL_CLOSED_SET_SIZE is \" << INITIAL_CLOSED_SET_SIZE << endl;\n} \n\n\nvoid print_size_info(ostream &o)\n{\n o << \"sizeof(unsigned) is \" << sizeof(unsigned) << endl\n << \"sizeof(Tile) is \" << sizeof(Tile) << endl\n << \"sizeof(TileIndex) is \" << sizeof(TileIndex) << endl\n << \"sizeof(TileArray) is \" << sizeof(TileArray) << endl\n << \"sizeof(TileCost) is \" << sizeof(TileCost) << endl\n << \"sizeof(TilesState15) is \" << sizeof(TilesState15) << endl\n << \"sizeof(TilesNode15) is \" << sizeof(TilesNode15) << endl\n << \"sizeof(size_t) is \" << sizeof(size_t) << endl\n << \"sizeof(BucketPriorityQueue<TilesNode15>::ItemPointer) is \"\n << sizeof(BucketPriorityQueue<TilesNode15>::ItemPointer) << endl;\n}\n\n\nvoid print_usage(ostream &o, const char *prog_name)\n{\n o << \"usage: \" << prog_name << \" DOMAIN ALGORITHM [FILE]\" << endl\n << \"where\" << endl\n << \" DOMAIN is one of {tiles, macro_tiles}\" << endl\n << \" ALGORITHM is one of {astar, hastar, switchback, hidastar}\" << endl\n << \" FILE is the optional instance file to read from\" << endl\n << endl\n << \"If no file is specified, the instance is read from stdin.\" << endl;\n\n o << endl << endl;\n\n o << \"Build Information:\" << endl;\n print_build_info(o);\n o << endl;\n print_size_info(o);\n o << endl;\n}\n\n\nTilesInstance15 * get_tiles_instance(int argc, char *argv[])\n{\n TilesInstance15 *instance;\n if (argc == 4) {\n ifstream infile(argv[3]);\n instance = readTilesInstance15(infile);\n }\n else {\n instance = readTilesInstance15(cin);\n }\n\n if (instance == NULL) {\n cerr << \"error reading instance!\" << endl;\n exit(1);\n }\n\n return instance;\n}\n\n\nMacroTilesInstance15 * get_macro_tiles_instance(int argc, char *argv[])\n{\n return new MacroTilesInstance15(get_tiles_instance(argc, argv));\n}\n\n\ntemplate <class Searcher>\nvoid search(Searcher &searcher)\n{\n cout << \"######## Search Results ########\" << endl;\n\n timer search_timer;\n searcher.search();\n\n const TilesNode15 *goal = searcher.get_goal();\n if (goal == NULL) {\n cout << \"no solution found!\" << endl;\n }\n else {\n cout << \"found a solution:\" << endl;\n cout << *goal << endl;\n assert(goal->num_nodes_to_start() == goal->get_g() + 1u);\n }\n\n const double seconds_elapsed = search_timer.elapsed();\n const unsigned exp_per_second = searcher.get_num_expanded() \/ seconds_elapsed;\n const unsigned gen_per_second = searcher.get_num_expanded() \/ seconds_elapsed;\n\n cout << searcher.get_num_expanded() << \" expanded (\"\n << exp_per_second << \"\/s)\" << endl\n << searcher.get_num_generated() << \" generated (\"\n << gen_per_second << \"\/s)\" << endl\n << search_timer.elapsed() << \"s\" << endl;\n}\n\n\nint main(int argc, char * argv[])\n{\n if (argc < 3 || argc > 4) {\n print_usage(cerr, argv[0]);\n return 1;\n }\n\n const string domain_string(argv[1]);\n const string alg_string(argv[2]);\n\n const bool is_tiles = domain_string == \"tiles\";\n const bool is_macro_tiles = domain_string == \"macro_tiles\";\n\n const bool is_astar = alg_string == \"astar\";\n const bool is_hastar = alg_string == \"hastar\";\n const bool is_hidastar = alg_string == \"hidastar\";\n const bool is_switchback = alg_string == \"switchback\";\n \n if (is_tiles && is_astar) {\n TilesInstance15 *instance = get_tiles_instance(argc, argv);\n cout << \"######## The Instance ########\" << endl;\n cout << *instance << endl << endl;\n TilesAStar &astar = *new TilesAStar(*instance);\n search(astar);\n }\n else if (is_tiles && is_hastar) {\n TilesInstance15 *instance = get_tiles_instance(argc, argv);\n TilesHAStar &hastar = *new TilesHAStar(*instance);\n cout << \"######## The Instance ########\" << endl;\n cout << *instance << endl << endl;\n search(hastar);\n }\n else if (is_tiles && is_hidastar) {\n cerr << \"HIDA* unimplemented\" << endl;\n exit(1);\n }\n else if (is_tiles && is_switchback) {\n TilesInstance15 *instance = get_tiles_instance(argc, argv);\n TilesSwitchback &switchback = *new TilesSwitchback(*instance);\n cout << \"######## The Instance ########\" << endl;\n cout << *instance << endl << endl;\n search(switchback);\n }\n else if (is_macro_tiles && is_astar) {\n MacroTilesInstance15 *instance = get_macro_tiles_instance(argc, argv);\n MacroTilesAStar &astar = *new MacroTilesAStar(*instance);\n cout << \"######## The Instance ########\" << endl;\n cout << *instance << endl << endl;\n search(astar);\n }\n else if (is_macro_tiles && is_hastar) {\n MacroTilesInstance15 *instance = get_macro_tiles_instance(argc, argv);\n MacroTilesHAStar &hastar = *new MacroTilesHAStar(*instance);\n cout << \"######## The Instance ########\" << endl;\n cout << *instance << endl << endl;\n search(hastar);\n }\n else if (is_macro_tiles && is_hidastar) {\n cerr << \"HIDA* unimplemented\" << endl;\n }\n else if (is_macro_tiles && is_switchback) {\n MacroTilesInstance15 *instance = get_macro_tiles_instance(argc, argv);\n MacroTilesSwitchback &switchback = *new MacroTilesSwitchback(*instance);\n cout << \"######## The Instance ########\" << endl;\n cout << *instance << endl << endl;\n search(switchback);\n }\n else if (!is_tiles && !is_macro_tiles) {\n cerr << \"error: invalid domain specified\" << endl;\n print_usage(cerr, argv[0]);\n return 1;\n }\n else if (!is_astar && !is_hastar && !is_hidastar && !is_switchback) {\n cerr << \"error: invalid algorithm specified\" << endl;\n print_usage(cerr, argv[0]);\n return 1;\n }\n\n return 0;\n}\n<commit_msg>Bugfix in generation rate reporting.<commit_after>#include <boost\/timer.hpp>\n\n#include <iostream>\n#include <fstream>\n\n#include \"search\/BucketPriorityQueue.hpp\"\n#include \"search\/Constants.hpp\"\n#include \"search\/astar\/AStar.hpp\"\n#include \"search\/hastar\/HAStar.hpp\"\n#include \"search\/switchback\/Switchback.hpp\"\n#include \"tiles\/Tiles.hpp\"\n#include \"tiles\/MacroTiles.hpp\"\n\nusing namespace std;\nusing namespace boost;\n\n\ntypedef AStar<TilesInstance15, TilesNode15> TilesAStar;\ntypedef HAStar<TilesInstance15, TilesNode15> TilesHAStar;\ntypedef Switchback<TilesInstance15, TilesNode15> TilesSwitchback;\n\ntypedef AStar<MacroTilesInstance15, TilesNode15> MacroTilesAStar;\ntypedef HAStar<MacroTilesInstance15, TilesNode15> MacroTilesHAStar;\ntypedef Switchback<MacroTilesInstance15, TilesNode15> MacroTilesSwitchback;\n\n\nvoid print_build_info(ostream &o)\n{\n o << \"tiles state hash caching is \"\n#ifdef CACHE_TILES_HASH_VALUE\n << \"enabled\" << endl;\n#else\n << \"disabled\" << endl;\n#endif\n\n o << \"tiles state blank index caching is \"\n#ifdef CACHE_TILES_BLANK_INDEX\n << \"enabled\" << endl;\n#else\n << \"disabled\" << endl;\n#endif\n\n o << \"node f-value caching is \"\n#ifdef CACHE_NODE_F_VALUE\n << \"enabled\" << endl;\n#else\n << \"disabled\" << endl;\n#endif\n\n o << \"Hierarchical A*'s H* caching is \"\n#ifdef HIERARCHICAL_A_STAR_CACHE_H_STAR\n << \"enabled\" << endl;\n#else\n << \"disabled\" << endl;\n#endif\n\n o << \"Hierarchical A*'s P-g caching is \"\n#ifdef HIERARCHICAL_A_STAR_CACHE_P_MINUS_G\n << \"enabled\" << endl;\n#else\n << \"disabled\" << endl;\n#endif\n\n o << \"Hierarchical A*'s optimal path caching is \"\n#ifdef HIERARCHICAL_A_STAR_CACHE_OPTIMAL_PATHS\n << \"enabled\" << endl;\n#else\n << \"disabled\" << endl;\n#endif\n\n o << \"NDEBUG is \"\n#ifdef NDEBUG\n << \"enabled\" << endl;\n#else\n << \"disabled\" << endl;\n#endif\n\n o << \"OUTPUT_SEARCH_PROGRESS is \"\n#ifdef OUTPUT_SEARCH_PROGRESS\n << \"enabled\" << endl;\n#else\n << \"disabled\" << endl;\n#endif\n\n o << \"INITIAL_CLOSED_SET_SIZE is \" << INITIAL_CLOSED_SET_SIZE << endl;\n} \n\n\nvoid print_size_info(ostream &o)\n{\n o << \"sizeof(unsigned) is \" << sizeof(unsigned) << endl\n << \"sizeof(Tile) is \" << sizeof(Tile) << endl\n << \"sizeof(TileIndex) is \" << sizeof(TileIndex) << endl\n << \"sizeof(TileArray) is \" << sizeof(TileArray) << endl\n << \"sizeof(TileCost) is \" << sizeof(TileCost) << endl\n << \"sizeof(TilesState15) is \" << sizeof(TilesState15) << endl\n << \"sizeof(TilesNode15) is \" << sizeof(TilesNode15) << endl\n << \"sizeof(size_t) is \" << sizeof(size_t) << endl\n << \"sizeof(BucketPriorityQueue<TilesNode15>::ItemPointer) is \"\n << sizeof(BucketPriorityQueue<TilesNode15>::ItemPointer) << endl;\n}\n\n\nvoid print_usage(ostream &o, const char *prog_name)\n{\n o << \"usage: \" << prog_name << \" DOMAIN ALGORITHM [FILE]\" << endl\n << \"where\" << endl\n << \" DOMAIN is one of {tiles, macro_tiles}\" << endl\n << \" ALGORITHM is one of {astar, hastar, switchback, hidastar}\" << endl\n << \" FILE is the optional instance file to read from\" << endl\n << endl\n << \"If no file is specified, the instance is read from stdin.\" << endl;\n\n o << endl << endl;\n\n o << \"Build Information:\" << endl;\n print_build_info(o);\n o << endl;\n print_size_info(o);\n o << endl;\n}\n\n\nTilesInstance15 * get_tiles_instance(int argc, char *argv[])\n{\n TilesInstance15 *instance;\n if (argc == 4) {\n ifstream infile(argv[3]);\n instance = readTilesInstance15(infile);\n }\n else {\n instance = readTilesInstance15(cin);\n }\n\n if (instance == NULL) {\n cerr << \"error reading instance!\" << endl;\n exit(1);\n }\n\n return instance;\n}\n\n\nMacroTilesInstance15 * get_macro_tiles_instance(int argc, char *argv[])\n{\n return new MacroTilesInstance15(get_tiles_instance(argc, argv));\n}\n\n\ntemplate <class Searcher>\nvoid search(Searcher &searcher)\n{\n cout << \"######## Search Results ########\" << endl;\n\n timer search_timer;\n searcher.search();\n\n const TilesNode15 *goal = searcher.get_goal();\n if (goal == NULL) {\n cout << \"no solution found!\" << endl;\n }\n else {\n cout << \"found a solution:\" << endl;\n cout << *goal << endl;\n assert(goal->num_nodes_to_start() == goal->get_g() + 1u);\n }\n\n const double seconds_elapsed = search_timer.elapsed();\n const unsigned exp_per_second = searcher.get_num_expanded() \/ seconds_elapsed;\n const unsigned gen_per_second = searcher.get_num_generated() \/ seconds_elapsed;\n\n cout << searcher.get_num_expanded() << \" expanded (\"\n << exp_per_second << \"\/s)\" << endl\n << searcher.get_num_generated() << \" generated (\"\n << gen_per_second << \"\/s)\" << endl\n << search_timer.elapsed() << \"s\" << endl;\n}\n\n\nint main(int argc, char * argv[])\n{\n if (argc < 3 || argc > 4) {\n print_usage(cerr, argv[0]);\n return 1;\n }\n\n const string domain_string(argv[1]);\n const string alg_string(argv[2]);\n\n const bool is_tiles = domain_string == \"tiles\";\n const bool is_macro_tiles = domain_string == \"macro_tiles\";\n\n const bool is_astar = alg_string == \"astar\";\n const bool is_hastar = alg_string == \"hastar\";\n const bool is_hidastar = alg_string == \"hidastar\";\n const bool is_switchback = alg_string == \"switchback\";\n \n if (is_tiles && is_astar) {\n TilesInstance15 *instance = get_tiles_instance(argc, argv);\n cout << \"######## The Instance ########\" << endl;\n cout << *instance << endl << endl;\n TilesAStar &astar = *new TilesAStar(*instance);\n search(astar);\n }\n else if (is_tiles && is_hastar) {\n TilesInstance15 *instance = get_tiles_instance(argc, argv);\n TilesHAStar &hastar = *new TilesHAStar(*instance);\n cout << \"######## The Instance ########\" << endl;\n cout << *instance << endl << endl;\n search(hastar);\n }\n else if (is_tiles && is_hidastar) {\n cerr << \"HIDA* unimplemented\" << endl;\n exit(1);\n }\n else if (is_tiles && is_switchback) {\n TilesInstance15 *instance = get_tiles_instance(argc, argv);\n TilesSwitchback &switchback = *new TilesSwitchback(*instance);\n cout << \"######## The Instance ########\" << endl;\n cout << *instance << endl << endl;\n search(switchback);\n }\n else if (is_macro_tiles && is_astar) {\n MacroTilesInstance15 *instance = get_macro_tiles_instance(argc, argv);\n MacroTilesAStar &astar = *new MacroTilesAStar(*instance);\n cout << \"######## The Instance ########\" << endl;\n cout << *instance << endl << endl;\n search(astar);\n }\n else if (is_macro_tiles && is_hastar) {\n MacroTilesInstance15 *instance = get_macro_tiles_instance(argc, argv);\n MacroTilesHAStar &hastar = *new MacroTilesHAStar(*instance);\n cout << \"######## The Instance ########\" << endl;\n cout << *instance << endl << endl;\n search(hastar);\n }\n else if (is_macro_tiles && is_hidastar) {\n cerr << \"HIDA* unimplemented\" << endl;\n }\n else if (is_macro_tiles && is_switchback) {\n MacroTilesInstance15 *instance = get_macro_tiles_instance(argc, argv);\n MacroTilesSwitchback &switchback = *new MacroTilesSwitchback(*instance);\n cout << \"######## The Instance ########\" << endl;\n cout << *instance << endl << endl;\n search(switchback);\n }\n else if (!is_tiles && !is_macro_tiles) {\n cerr << \"error: invalid domain specified\" << endl;\n print_usage(cerr, argv[0]);\n return 1;\n }\n else if (!is_astar && !is_hastar && !is_hidastar && !is_switchback) {\n cerr << \"error: invalid algorithm specified\" << endl;\n print_usage(cerr, argv[0]);\n return 1;\n }\n\n return 0;\n}\n<|endoftext|>"} {"text":"<commit_before>\/\/\/\n\/\/\/ @file Status.cpp\n\/\/\/ @brief The Status class is used to print the status (in percent)\n\/\/\/ of the formulas related to special leaves. It is used by\n\/\/\/ the D, S2_easy and S2_hard formulas.\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#include <Status.hpp>\n#include <primecount-internal.hpp>\n#include <imath.hpp>\n#include <int128_t.hpp>\n#include <print.hpp>\n\n#include <iostream>\n#include <algorithm>\n#include <iomanip>\n#include <sstream>\n#include <string>\n\n#if defined(_OPENMP)\n #include <omp.h>\n#endif\n\nusing namespace std;\nusing namespace primecount;\n\nnamespace {\n\n\/\/\/ Since the distribution of the special leaves is highly skewed\n\/\/\/ we cannot simply calculate the percentage of the current\n\/\/\/ computation using the standard linear formula. Hence we use\n\/\/\/ a polynomial formula that grows faster when the value is\n\/\/\/ small and slower towards the end (100%).\n\/\/\/ Curve fitting tool: https:\/\/planetcalc.com\/8735\/\n\/\/\/\ntemplate <typename T>\ndouble skewed_percent(T x, T y)\n{\n double p1 = get_percent(x, y);\n double p2 = p1 * p1;\n double p3 = p1 * p2;\n double p4 = p2 * p2;\n\n double c1 = 3.70559815037356886459;\n double c2 = 0.07330455122609925077;\n double c3 = 0.00067895345810494585;\n double c4 = 0.00000216467760881310;\n\n double percent = -c4*p4 + c3*p3 - c2*p2 + c1*p1;\n percent = in_between(0, percent, 100);\n return percent;\n}\n\n} \/\/ namespace\n\nnamespace primecount {\n\nStatus::Status(maxint_t x)\n{\n precision_ = get_status_precision(x);\n int q = ipow(10, precision_);\n epsilon_ = 1.0 \/ q;\n}\n\nbool Status::isPrint(double time)\n{\n double old = time_;\n return old == 0 ||\n (time - old) >= is_print_;\n}\n\nvoid Status::print(double percent)\n{\n double old = percent_;\n\n if ((percent - old) >= epsilon_)\n {\n percent_ = percent;\n ostringstream status;\n status << \"\\rStatus: \" << fixed << setprecision(precision_) << percent << \"%\";\n cout << status.str() << flush;\n }\n}\n\n\/\/\/ This method is used by S2_hard() and D().\n\/\/\/ This method does not use a lock to synchronize threads\n\/\/\/ as it is only used inside of a critical section inside\n\/\/\/ LoadBalancer.cpp and hence it can never be accessed\n\/\/\/ simultaneously from multiple threads.\n\/\/\/\ndouble Status::getPercent(int64_t low, int64_t limit, maxint_t sum, maxint_t sum_approx)\n{\n double p1 = skewed_percent(low, limit);\n double p2 = skewed_percent(sum, sum_approx);\n\n \/\/ When p1 is larger then p2 it is\n \/\/ always much more accurate.\n if (p1 > p2)\n return p1;\n\n \/\/ p2 is a very rough estimation, hence\n \/\/ we want to decrease its contribution\n \/\/ to the final percent value.\n double percent = (p1 * 6 + p2 * 4) \/ 10;\n\n return percent;\n}\n\n\/\/\/ This method is used by S2_hard() and D().\n\/\/\/ This method does not use a lock to synchronize threads\n\/\/\/ as it is only used inside of a critical section inside\n\/\/\/ LoadBalancer.cpp and hence it can never be accessed\n\/\/\/ simultaneously from multiple threads.\n\/\/\/\nvoid Status::print(int64_t low, int64_t limit, maxint_t sum, maxint_t sum_approx)\n{\n \/\/ check --status option used\n if (!is_print())\n return;\n\n double time = get_time();\n\n if (isPrint(time))\n {\n time_ = time;\n double percent = getPercent(low, limit, sum, sum_approx);\n print(percent);\n }\n}\n\n\/\/\/ Used by S2_easy\nvoid Status::print(int64_t b, int64_t max_b)\n{\n \/\/ check --status option used\n if (!is_print())\n return;\n\n#if defined(_OPENMP)\n \/\/ In order to prevent data races only one thread at a time\n \/\/ can enter this code section. In order to make sure that\n \/\/ our code scales well up to a very large number of CPU\n \/\/ cores, we don't want to use any thread synchronization!\n \/\/ In order to achieve this only one of the threads (the\n \/\/ main thread) is allowed to print the status, while all\n \/\/ other threads do nothing.\n if (omp_get_thread_num() != 0)\n return;\n#endif\n\n double time = get_time();\n\n if (isPrint(time))\n {\n time_ = time;\n double percent = skewed_percent(b, max_b);\n print(percent);\n }\n}\n\n} \/\/ namespace\n<commit_msg>Improve status accuracy<commit_after>\/\/\/\n\/\/\/ @file Status.cpp\n\/\/\/ @brief The Status class is used to print the status (in percent)\n\/\/\/ of the formulas related to special leaves. It is used by\n\/\/\/ the D, S2_easy and S2_hard formulas.\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#include <Status.hpp>\n#include <primecount-internal.hpp>\n#include <imath.hpp>\n#include <int128_t.hpp>\n#include <print.hpp>\n\n#include <iostream>\n#include <algorithm>\n#include <iomanip>\n#include <sstream>\n#include <string>\n\n#if defined(_OPENMP)\n #include <omp.h>\n#endif\n\nusing namespace std;\nusing namespace primecount;\n\nnamespace {\n\n\/\/\/ Since the distribution of the special leaves is highly skewed\n\/\/\/ we cannot simply calculate the percentage of the current\n\/\/\/ computation using the standard linear formula. Hence we use\n\/\/\/ a polynomial formula that grows faster when the value is\n\/\/\/ small and slower towards the end (100%).\n\/\/\/ Curve fitting tool: https:\/\/planetcalc.com\/8735\/\n\/\/\/\ntemplate <typename T>\ndouble skewed_percent(T x, T y)\n{\n double p1 = get_percent(x, y);\n double p2 = p1 * p1;\n double p3 = p1 * p2;\n double p4 = p2 * p2;\n\n double c1 = 3.70559815037356886459;\n double c2 = 0.07330455122609925077;\n double c3 = 0.00067895345810494585;\n double c4 = 0.00000216467760881310;\n\n double percent = -c4*p4 + c3*p3 - c2*p2 + c1*p1;\n percent = in_between(0, percent, 100);\n return percent;\n}\n\n} \/\/ namespace\n\nnamespace primecount {\n\nStatus::Status(maxint_t x)\n{\n precision_ = get_status_precision(x);\n int q = ipow(10, precision_);\n epsilon_ = 1.0 \/ q;\n}\n\nbool Status::isPrint(double time)\n{\n double old = time_;\n return old == 0 ||\n (time - old) >= is_print_;\n}\n\nvoid Status::print(double percent)\n{\n double old = percent_;\n\n if ((percent - old) >= epsilon_)\n {\n percent_ = percent;\n ostringstream status;\n status << \"\\rStatus: \" << fixed << setprecision(precision_) << percent << \"%\";\n cout << status.str() << flush;\n }\n}\n\n\/\/\/ This method is used by S2_hard() and D().\n\/\/\/ This method does not use a lock to synchronize threads\n\/\/\/ as it is only used inside of a critical section inside\n\/\/\/ LoadBalancer.cpp and hence it can never be accessed\n\/\/\/ simultaneously from multiple threads.\n\/\/\/\ndouble Status::getPercent(int64_t low, int64_t limit, maxint_t sum, maxint_t sum_approx)\n{\n double p1 = skewed_percent(sum, sum_approx);\n double p2 = skewed_percent(low, limit);\n\n \/\/ When p2 is larger then p1 it is\n \/\/ always much more accurate.\n if (p2 > p1)\n return p2;\n\n \/\/ Below 20% p1 is better\n \/\/ Above 70% p2 is better\n double c1 = 150 \/ max(p1, 1.0);\n c1 = in_between(10, c1, 4);\n double c2 = 10 - c1;\n double percent = (c1*p1 + c2*p2) \/ 10;\n\n return percent;\n}\n\n\/\/\/ This method is used by S2_hard() and D().\n\/\/\/ This method does not use a lock to synchronize threads\n\/\/\/ as it is only used inside of a critical section inside\n\/\/\/ LoadBalancer.cpp and hence it can never be accessed\n\/\/\/ simultaneously from multiple threads.\n\/\/\/\nvoid Status::print(int64_t low, int64_t limit, maxint_t sum, maxint_t sum_approx)\n{\n \/\/ check --status option used\n if (!is_print())\n return;\n\n double time = get_time();\n\n if (isPrint(time))\n {\n time_ = time;\n double percent = getPercent(low, limit, sum, sum_approx);\n print(percent);\n }\n}\n\n\/\/\/ Used by S2_easy\nvoid Status::print(int64_t b, int64_t max_b)\n{\n \/\/ check --status option used\n if (!is_print())\n return;\n\n#if defined(_OPENMP)\n \/\/ In order to prevent data races only one thread at a time\n \/\/ can enter this code section. In order to make sure that\n \/\/ our code scales well up to a very large number of CPU\n \/\/ cores, we don't want to use any thread synchronization!\n \/\/ In order to achieve this only one of the threads (the\n \/\/ main thread) is allowed to print the status, while all\n \/\/ other threads do nothing.\n if (omp_get_thread_num() != 0)\n return;\n#endif\n\n double time = get_time();\n\n if (isPrint(time))\n {\n time_ = time;\n double percent = skewed_percent(b, max_b);\n print(percent);\n }\n}\n\n} \/\/ namespace\n<|endoftext|>"} {"text":"<commit_before>\/*-\n * Copyright (c) 2012, Achilleas Margaritis\n * Copyright (c) 2014, David T. Chisnall\n * All rights 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#include <cassert>\n#include <cstdlib>\n#include \"ast.hh\"\n\n\nnamespace {\n\/**\n * The current AST container. When constructing an object, this is set and\n * then the constructors for the fields run, accessing it to detect their\n * parents.\n *\/\n\/\/ FIXME: Should be thread_local, but that doesn't seem to work on OS X for\n\/\/ some reason (__thread does)\n__thread pegmatite::ASTContainer *current = 0;\n\/**\n * The current parser delegate. When constructing an object, this is set and\n * then the constructors for the fields run, accessing it to detect their\n * parents.\n *\/\n__thread pegmatite::ASTParserDelegate *currentParserDelegate;\n}\n\nnamespace pegmatite {\n\n\nstd::string demangle(std::string mangled)\n{\n\tint err;\n\tsize_t s;\n\tchar *buffer = static_cast<char*>(malloc(mangled.length()));\n\n\tchar *demangled = abi::__cxa_demangle(mangled.c_str(), buffer, &s, &err);\n\tstd::string result = demangled ? demangled : mangled;\n\n\tfree(demangled ? demangled : buffer);\n\n\treturn result;\n}\n\n\n\/**\n * Out-of-line virtual destructor forces vtable to be emitted in this\n * translation unit only.\n *\/\nASTNode::~ASTNode()\n{\n}\n\n\n\/** sets the container under construction to be this.\n *\/\nASTContainer::ASTContainer()\n{\n\tcurrent = this;\n}\n\n\n\/** Asks all members to construct themselves from the stack.\n\tThe members are asked to construct themselves in reverse order.\n\tfrom a node stack.\n\t@param st stack.\n *\/\nvoid ASTContainer::construct(const InputRange &r, ASTStack &st)\n{\n\tfor(auto it = members.rbegin(); it != members.rend(); ++it)\n\t{\n\t\tASTMember *member = *it;\n\t\tmember->construct(r, st);\n\t}\n\t\/\/ We don't need the members vector anymore, so clean up the storage it\n\t\/\/ uses.\n\tASTMember_vector().swap(members);\n}\n\nASTMember::ASTMember()\n{\n\tassert(current && \"ASTMember must be contained within an ASTContainer\");\n\tcontainer_node = current;\n\tcurrent->members.push_back(this);\n}\nASTMember::~ASTMember() {}\n\nASTParserDelegate::ASTParserDelegate()\n{\n\tcurrentParserDelegate = this;\n}\n\nvoid ASTParserDelegate::set_parse_proc(const Rule &r, parse_proc p)\n{\n\thandlers[std::addressof(r)] = p;\n}\nvoid ASTParserDelegate::bind_parse_proc(const Rule &r, parse_proc p)\n{\n\tcurrentParserDelegate->set_parse_proc(r, p);\n}\nparse_proc ASTParserDelegate::get_parse_proc(const Rule &r) const\n{\n\tauto it = handlers.find(std::addressof(r));\n\tif (it == handlers.end()) return 0;\n\treturn it->second;\n}\n\n\/** parses the given input.\n\t@param input input.\n\t@param g root rule of grammar.\n\t@param ws whitespace rule.\n\t@param err callback for reporting errors.\n\t@param d user data, passed to the parse procedures.\n\t@return pointer to AST node created, or null if there was an Error.\n\t\tThe return object must be deleted by the caller.\n *\/\nstd::unique_ptr<ASTNode> parse(Input &input, const Rule &g, const Rule &ws,\n ErrorReporter err, const ParserDelegate &d)\n{\n\tASTStack st;\n\tif (!parse(input, g, ws, err, d, &st)) return 0;\n\tif (st.size() > 1)\n\t{\n\t\tint i = 0;\n\t\tfor (auto &I : st)\n\t\t{\n\t\t\tauto *val = I.second.get();\n\t\t\tfprintf(stderr, \"[%d] %s\\n\", i++, typeid(*val).name());\n\t\t}\n\t}\n\tassert(st.size() == 1);\n\treturn std::move(st[0].second);\n}\n\n} \/\/namespace pegmatite\n<commit_msg>Don't pass uninitialized size to __cxa_demangle().<commit_after>\/*-\n * Copyright (c) 2012, Achilleas Margaritis\n * Copyright (c) 2014, David T. Chisnall\n * All rights 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#include <cassert>\n#include <cstdlib>\n#include \"ast.hh\"\n\n\nnamespace {\n\/**\n * The current AST container. When constructing an object, this is set and\n * then the constructors for the fields run, accessing it to detect their\n * parents.\n *\/\n\/\/ FIXME: Should be thread_local, but that doesn't seem to work on OS X for\n\/\/ some reason (__thread does)\n__thread pegmatite::ASTContainer *current = 0;\n\/**\n * The current parser delegate. When constructing an object, this is set and\n * then the constructors for the fields run, accessing it to detect their\n * parents.\n *\/\n__thread pegmatite::ASTParserDelegate *currentParserDelegate;\n}\n\nnamespace pegmatite {\n\n\nstd::string demangle(std::string mangled)\n{\n\tint err;\n\tsize_t s = 0;\n\tchar *buffer = static_cast<char*>(malloc(mangled.length() + 1));\n\n\tchar *demangled = abi::__cxa_demangle(mangled.c_str(), buffer, &s, &err);\n\tstd::string result = demangled ? demangled : mangled;\n\n\tfree(demangled ? demangled : buffer);\n\n\treturn result;\n}\n\n\n\/**\n * Out-of-line virtual destructor forces vtable to be emitted in this\n * translation unit only.\n *\/\nASTNode::~ASTNode()\n{\n}\n\n\n\/** sets the container under construction to be this.\n *\/\nASTContainer::ASTContainer()\n{\n\tcurrent = this;\n}\n\n\n\/** Asks all members to construct themselves from the stack.\n\tThe members are asked to construct themselves in reverse order.\n\tfrom a node stack.\n\t@param st stack.\n *\/\nvoid ASTContainer::construct(const InputRange &r, ASTStack &st)\n{\n\tfor(auto it = members.rbegin(); it != members.rend(); ++it)\n\t{\n\t\tASTMember *member = *it;\n\t\tmember->construct(r, st);\n\t}\n\t\/\/ We don't need the members vector anymore, so clean up the storage it\n\t\/\/ uses.\n\tASTMember_vector().swap(members);\n}\n\nASTMember::ASTMember()\n{\n\tassert(current && \"ASTMember must be contained within an ASTContainer\");\n\tcontainer_node = current;\n\tcurrent->members.push_back(this);\n}\nASTMember::~ASTMember() {}\n\nASTParserDelegate::ASTParserDelegate()\n{\n\tcurrentParserDelegate = this;\n}\n\nvoid ASTParserDelegate::set_parse_proc(const Rule &r, parse_proc p)\n{\n\thandlers[std::addressof(r)] = p;\n}\nvoid ASTParserDelegate::bind_parse_proc(const Rule &r, parse_proc p)\n{\n\tcurrentParserDelegate->set_parse_proc(r, p);\n}\nparse_proc ASTParserDelegate::get_parse_proc(const Rule &r) const\n{\n\tauto it = handlers.find(std::addressof(r));\n\tif (it == handlers.end()) return 0;\n\treturn it->second;\n}\n\n\/** parses the given input.\n\t@param input input.\n\t@param g root rule of grammar.\n\t@param ws whitespace rule.\n\t@param err callback for reporting errors.\n\t@param d user data, passed to the parse procedures.\n\t@return pointer to AST node created, or null if there was an Error.\n\t\tThe return object must be deleted by the caller.\n *\/\nstd::unique_ptr<ASTNode> parse(Input &input, const Rule &g, const Rule &ws,\n ErrorReporter err, const ParserDelegate &d)\n{\n\tASTStack st;\n\tif (!parse(input, g, ws, err, d, &st)) return 0;\n\tif (st.size() > 1)\n\t{\n\t\tint i = 0;\n\t\tfor (auto &I : st)\n\t\t{\n\t\t\tauto *val = I.second.get();\n\t\t\tfprintf(stderr, \"[%d] %s\\n\", i++, typeid(*val).name());\n\t\t}\n\t}\n\tassert(st.size() == 1);\n\treturn std::move(st[0].second);\n}\n\n} \/\/namespace pegmatite\n<|endoftext|>"} {"text":"<commit_before>\/* GG is a GUI for SDL and OpenGL.\n Copyright (C) 2003 T. Zachary Laine\n\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., 59 Temple Place, Suite 330, Boston, MA\n 02111-1307 USA\n\n If you do not wish to comply with the terms of the LGPL please\n contact the author as other terms are available for a fee.\n \n Zach Laine\n whatwasthataddress@hotmail.com *\/\n\n\/* $Id: Edit.cpp 528 2006-03-04 02:56:33Z tzlaine $ *\/\n\n#include <GG\/TabWnd.h>\n\n#ifndef _GG_DrawUtil_h_\n#include <GG\/DrawUtil.h>\n#endif\n\n#ifndef _GG_Layout_h_\n#include <GG\/Layout.h>\n#endif\n\n#ifndef _GG_StyleFactory_h_\n#include <GG\/StyleFactory.h>\n#endif\n\n\nusing namespace GG;\n\nnamespace {\n int TabHeightFromFont(const boost::shared_ptr<Font>& font)\n { return font->Lineskip() + 10; }\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ GG::TabWnd\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ static(s)\nconst int TabWnd::NO_WND = RadioButtonGroup::NO_BUTTON;\n\nTabWnd::TabWnd() :\n m_tab_bar(0),\n m_current_wnd(0)\n{}\n\nTabWnd::~TabWnd()\n{\n for (unsigned int i = 0; i < m_wnds.size(); ++i) {\n delete m_wnds[i].first;\n }\n}\n\nTabWnd::TabWnd(int x, int y, int w, int h, const boost::shared_ptr<Font>& font, Clr color, Clr text_color\/* = CLR_BLACK*\/,\n TabBarStyle style\/* = TAB_BAR_ATTACHED*\/, Uint32 flags\/* = CLICKABLE | DRAGABLE*\/) :\n Wnd(x, y, w, h, flags),\n m_tab_bar(GetStyleFactory()->NewTabBar(0, 0, w, font, color, text_color, style, CLICKABLE)),\n m_current_wnd(0)\n{\n Layout* layout = new Layout(0, 0, w, h, 2, 1);\n layout->SetRowStretch(1, 1.0);\n layout->Add(m_tab_bar, 0, 0);\n SetLayout(layout);\n Connect(m_tab_bar->TabChangedSignal, &TabWnd::TabChanged, this);\n}\n\nPt TabWnd::MinUsableSize() const\n{\n Pt retval = m_tab_bar->MinUsableSize();\n retval.y *= 2;\n return retval;\n}\n\nint TabWnd::CurrentWnd() const\n{ return m_tab_bar->CurrentTab(); }\n\nvoid TabWnd::Render()\n{}\n\nvoid TabWnd::AddWnd(Wnd* wnd, const std::string& name)\n{ InsertWnd(m_wnds.size(), wnd, name); }\n\nvoid TabWnd::InsertWnd(int index, Wnd* wnd, const std::string& name)\n{\n m_wnds.insert(m_wnds.begin() + index, std::make_pair(wnd, name));\n m_tab_bar->InsertTab(index, name);\n GetLayout()->SetMinimumRowHeight(0, m_tab_bar->MinUsableSize().y + 2 * 5);\n}\n\nWnd* TabWnd::RemoveWnd(const std::string& name)\n{\n Wnd* retval = 0;\n int index = NO_WND;\n for (unsigned int i = 0; i < m_wnds.size(); ++i) {\n if (m_wnds[i].second == name) {\n index = i;\n break;\n }\n }\n if (index != NO_WND) {\n retval = m_wnds[index].first;\n m_wnds.erase(m_wnds.begin() + index);\n m_tab_bar->RemoveTab(name);\n GetLayout()->SetMinimumRowHeight(0, m_tab_bar->MinUsableSize().y + 2 * 5);\n }\n return retval;\n}\n\nvoid TabWnd::SetCurrentWnd(int index)\n{ m_tab_bar->SetCurrentTab(index); }\n\nconst TabBar* TabWnd::GetTabBar() const\n{ return m_tab_bar; }\n\nconst std::vector<std::pair<Wnd*, std::string> >& TabWnd::Wnds() const\n{ return m_wnds; }\n\nvoid TabWnd::TabChanged(int index)\n{\n assert(0 <= index && index < static_cast<int>(m_wnds.size()));\n Wnd* old_current_wnd = m_current_wnd;\n m_current_wnd = m_wnds[index].first;\n if (m_current_wnd != old_current_wnd) {\n Layout* layout = GetLayout();\n layout->Remove(old_current_wnd);\n layout->Add(m_current_wnd, 1, 0);\n }\n WndChangedSignal(index);\n}\n\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ GG::TabBar\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ static(s)\nconst int TabBar::NO_TAB = TabWnd::NO_WND;\nconst int TabBar::BUTTON_WIDTH = 10;\n\nTabBar::TabBar() :\n Control(),\n m_tabs(0),\n m_left_button(0),\n m_right_button(0),\n m_left_right_button_layout(0),\n m_text_color(CLR_BLACK),\n m_style(TAB_BAR_ATTACHED),\n m_first_tab_shown(0)\n{}\n\nTabBar::TabBar(int x, int y, int w, const boost::shared_ptr<Font>& font, Clr color, Clr text_color\/* = CLR_BLACK*\/,\n TabBarStyle style\/* = TAB_BAR_ATTACHED*\/, Uint32 flags\/* = CLICKABLE*\/) :\n Control(x, y, w, TabHeightFromFont(font), flags),\n m_tabs(0),\n m_font(font),\n m_left_button(0),\n m_right_button(0),\n m_left_right_button_layout(new Layout(0, 0, w, TabHeightFromFont(font), 1, 3)),\n m_text_color(text_color),\n m_style(style),\n m_first_tab_shown(0)\n{\n SetColor(color);\n\n EnableChildClipping(true);\n\n boost::shared_ptr<StyleFactory> style_factory = GetStyleFactory();\n\n m_tabs = style_factory->NewRadioButtonGroup(0, 0, w, TabHeightFromFont(font), HORIZONTAL);\n m_tabs->ExpandButtons(true);\n m_tabs->ExpandButtonsProportionally(true);\n\n m_left_right_button_layout->SetColumnStretch(0, 1);\n m_left_right_button_layout->SetColumnStretch(1, 0);\n m_left_right_button_layout->SetColumnStretch(2, 0);\n\n m_left_button = style_factory->NewTabBarLeftButton(0, 0, BUTTON_WIDTH, Height(), \"-\", m_font, Color(), m_text_color);\n m_right_button = style_factory->NewTabBarRightButton(0, 0, BUTTON_WIDTH, Height(), \"+\", m_font, Color(), m_text_color);\n m_left_right_button_layout->SetMinimumColumnWidth(1, m_left_button->Width());\n m_left_right_button_layout->SetMinimumColumnWidth(2, m_right_button->Width());\n m_left_right_button_layout->Add(m_left_button, 0, 1);\n m_left_right_button_layout->Add(m_right_button, 0, 2);\n m_left_right_button_layout->Hide();\n\n AttachChild(m_tabs);\n AttachChild(m_left_right_button_layout);\n\n Connect(m_tabs->ButtonChangedSignal, &TabBar::TabChanged, this);\n Connect(m_left_button->ClickedSignal, &TabBar::LeftClicked, this);\n Connect(m_right_button->ClickedSignal, &TabBar::RightClicked, this);\n}\n\nPt TabBar::MinUsableSize() const\n{\n int y = 0;\n for (unsigned int i = 0; i < m_tab_buttons.size(); ++i) {\n int button_min_y = m_tab_buttons[i]->MinUsableSize().y;\n if (y < button_min_y)\n y = button_min_y;\n }\n return Pt(4 * BUTTON_WIDTH, y);\n}\n\nint TabBar::CurrentTab() const\n{ return m_tabs->CheckedButton(); }\n\nvoid TabBar::SizeMove(const Pt& ul, const Pt& lr)\n{\n m_tabs->Resize(Pt(m_tabs->Size().x, lr.y - ul.y));\n m_left_right_button_layout->SizeMove(Pt(0, 0), lr - ul);\n Control::SizeMove(ul, lr);\n}\n\nvoid TabBar::Render()\n{}\n\nvoid TabBar::AddTab(const std::string& name)\n{ InsertTab(m_tab_buttons.size(), name); }\n\nvoid TabBar::InsertTab(int index, const std::string& name)\n{\n assert(0 <= index && index <= static_cast<int>(m_tab_buttons.size()));\n boost::shared_ptr<StyleFactory> style_factory = GetStyleFactory();\n StateButton* button = style_factory->NewTabBarTab(0, 0, 1, 1, name,\n m_font, TF_CENTER, Color(),\n m_text_color, CLR_ZERO,\n m_style == TAB_BAR_ATTACHED ?\n SBSTYLE_3D_TOP_ATTACHED_TAB :\n SBSTYLE_3D_TOP_DETACHED_TAB);\n button->InstallEventFilter(this);\n m_tab_buttons.insert(m_tab_buttons.begin() + index, button);\n m_tabs->InsertButton(index, m_tab_buttons[index]);\n if (Width() < m_tabs->Width()) {\n m_left_right_button_layout->Show();\n m_left_button->Disable(m_first_tab_shown == 0);\n m_right_button->Disable(m_first_tab_shown == static_cast<int>(m_tab_buttons.size()) - 1);\n }\n if (m_tabs->CheckedButton() == RadioButtonGroup::NO_BUTTON)\n m_tabs->SetCheck(0);\n}\n\nvoid TabBar::RemoveTab(const std::string& name)\n{\n int index = NO_TAB;\n for (unsigned int i = 0; i < m_tab_buttons.size(); ++i) {\n if (m_tab_buttons[i]->WindowText() == name) {\n index = i;\n break;\n }\n }\n assert(0 <= index && index < static_cast<int>(m_tab_buttons.size()));\n\n m_tab_buttons[index]->RemoveEventFilter(this);\n m_tabs->RemoveButton(m_tab_buttons[index]);\n delete m_tab_buttons[index];\n m_tab_buttons.erase(m_tab_buttons.begin() + index);\n if (m_tabs->Width() <= Width())\n m_left_right_button_layout->Hide();\n if (m_tabs->CheckedButton() == RadioButtonGroup::NO_BUTTON && !m_tab_buttons.empty())\n m_tabs->SetCheck(0);\n}\n\nvoid TabBar::SetCurrentTab(int index)\n{ m_tabs->SetCheck(index); }\n\nconst Button* TabBar::LeftButton() const\n{ return m_left_button; }\n\nconst Button* TabBar::RightButton() const\n{ return m_right_button; }\n\nvoid TabBar::DistinguishCurrentTab(const std::vector<StateButton*>& tab_buttons)\n{ m_tabs->RaiseCheckedButton(); }\n\nvoid TabBar::TabChanged(int index)\n{\n if (index != RadioButtonGroup::NO_BUTTON) {\n BringTabIntoView(index);\n DistinguishCurrentTab(m_tab_buttons);\n TabChangedSignal(index);\n }\n}\n\nvoid TabBar::LeftClicked()\n{\n assert(0 < m_first_tab_shown);\n m_tabs->OffsetMove(Pt(m_tab_buttons[m_first_tab_shown]->UpperLeft().x - m_tab_buttons[m_first_tab_shown - 1]->UpperLeft().x, 0));\n --m_first_tab_shown;\n m_left_button->Disable(m_first_tab_shown == 0);\n m_right_button->Disable(false);\n}\n\nvoid TabBar::RightClicked()\n{\n assert(m_first_tab_shown < static_cast<int>(m_tab_buttons.size()) - 1);\n m_tabs->OffsetMove(Pt(m_tab_buttons[m_first_tab_shown]->UpperLeft().x - m_tab_buttons[m_first_tab_shown + 1]->UpperLeft().x, 0));\n ++m_first_tab_shown;\n m_right_button->Disable(m_first_tab_shown == static_cast<int>(m_tab_buttons.size()) - 1);\n m_left_button->Disable(false);\n}\n\nvoid TabBar::BringTabIntoView(int index)\n{\n while (m_tab_buttons[index]->UpperLeft().x < UpperLeft().x) {\n LeftClicked();\n }\n if (m_tab_buttons[index]->Width() < Width()) {\n int right_side = m_left_right_button_layout->Visible() ?\n m_left_button->UpperLeft().x :\n LowerRight().x;\n while (right_side < m_tab_buttons[index]->LowerRight().x && index != m_first_tab_shown) {\n RightClicked();\n }\n } else {\n m_tabs->OffsetMove(Pt(m_tab_buttons[m_first_tab_shown]->UpperLeft().x - m_tab_buttons[index]->UpperLeft().x, 0));\n m_right_button->Disable(m_first_tab_shown == static_cast<int>(m_tab_buttons.size()) - 1);\n m_left_button->Disable(false);\n }\n}\n\nbool TabBar::EventFilter(Wnd* w, const Event& event)\n{\n if (event.Type() == Event::LButtonDown ||\n event.Type() == Event::RButtonDown)\n MoveChildUp(m_left_right_button_layout);\n return false;\n}\n<commit_msg>Modified the right-button-disable behavior of TabBar. Now, the tabs can be scrolled right only until the last one is in view, instead of until the last one is in the leftmost position.<commit_after>\/* GG is a GUI for SDL and OpenGL.\n Copyright (C) 2003 T. Zachary Laine\n\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., 59 Temple Place, Suite 330, Boston, MA\n 02111-1307 USA\n\n If you do not wish to comply with the terms of the LGPL please\n contact the author as other terms are available for a fee.\n \n Zach Laine\n whatwasthataddress@hotmail.com *\/\n\n\/* $Id: Edit.cpp 528 2006-03-04 02:56:33Z tzlaine $ *\/\n\n#include <GG\/TabWnd.h>\n\n#ifndef _GG_DrawUtil_h_\n#include <GG\/DrawUtil.h>\n#endif\n\n#ifndef _GG_Layout_h_\n#include <GG\/Layout.h>\n#endif\n\n#ifndef _GG_StyleFactory_h_\n#include <GG\/StyleFactory.h>\n#endif\n\n\nusing namespace GG;\n\nnamespace {\n int TabHeightFromFont(const boost::shared_ptr<Font>& font)\n { return font->Lineskip() + 10; }\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ GG::TabWnd\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ static(s)\nconst int TabWnd::NO_WND = RadioButtonGroup::NO_BUTTON;\n\nTabWnd::TabWnd() :\n m_tab_bar(0),\n m_current_wnd(0)\n{}\n\nTabWnd::~TabWnd()\n{\n for (unsigned int i = 0; i < m_wnds.size(); ++i) {\n delete m_wnds[i].first;\n }\n}\n\nTabWnd::TabWnd(int x, int y, int w, int h, const boost::shared_ptr<Font>& font, Clr color, Clr text_color\/* = CLR_BLACK*\/,\n TabBarStyle style\/* = TAB_BAR_ATTACHED*\/, Uint32 flags\/* = CLICKABLE | DRAGABLE*\/) :\n Wnd(x, y, w, h, flags),\n m_tab_bar(GetStyleFactory()->NewTabBar(0, 0, w, font, color, text_color, style, CLICKABLE)),\n m_current_wnd(0)\n{\n Layout* layout = new Layout(0, 0, w, h, 2, 1);\n layout->SetRowStretch(1, 1.0);\n layout->Add(m_tab_bar, 0, 0);\n SetLayout(layout);\n Connect(m_tab_bar->TabChangedSignal, &TabWnd::TabChanged, this);\n}\n\nPt TabWnd::MinUsableSize() const\n{\n Pt retval = m_tab_bar->MinUsableSize();\n retval.y *= 2;\n return retval;\n}\n\nint TabWnd::CurrentWnd() const\n{ return m_tab_bar->CurrentTab(); }\n\nvoid TabWnd::Render()\n{}\n\nvoid TabWnd::AddWnd(Wnd* wnd, const std::string& name)\n{ InsertWnd(m_wnds.size(), wnd, name); }\n\nvoid TabWnd::InsertWnd(int index, Wnd* wnd, const std::string& name)\n{\n m_wnds.insert(m_wnds.begin() + index, std::make_pair(wnd, name));\n m_tab_bar->InsertTab(index, name);\n GetLayout()->SetMinimumRowHeight(0, m_tab_bar->MinUsableSize().y + 2 * 5);\n}\n\nWnd* TabWnd::RemoveWnd(const std::string& name)\n{\n Wnd* retval = 0;\n int index = NO_WND;\n for (unsigned int i = 0; i < m_wnds.size(); ++i) {\n if (m_wnds[i].second == name) {\n index = i;\n break;\n }\n }\n if (index != NO_WND) {\n retval = m_wnds[index].first;\n m_wnds.erase(m_wnds.begin() + index);\n m_tab_bar->RemoveTab(name);\n GetLayout()->SetMinimumRowHeight(0, m_tab_bar->MinUsableSize().y + 2 * 5);\n }\n return retval;\n}\n\nvoid TabWnd::SetCurrentWnd(int index)\n{ m_tab_bar->SetCurrentTab(index); }\n\nconst TabBar* TabWnd::GetTabBar() const\n{ return m_tab_bar; }\n\nconst std::vector<std::pair<Wnd*, std::string> >& TabWnd::Wnds() const\n{ return m_wnds; }\n\nvoid TabWnd::TabChanged(int index)\n{\n assert(0 <= index && index < static_cast<int>(m_wnds.size()));\n Wnd* old_current_wnd = m_current_wnd;\n m_current_wnd = m_wnds[index].first;\n if (m_current_wnd != old_current_wnd) {\n Layout* layout = GetLayout();\n layout->Remove(old_current_wnd);\n layout->Add(m_current_wnd, 1, 0);\n }\n WndChangedSignal(index);\n}\n\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ GG::TabBar\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ static(s)\nconst int TabBar::NO_TAB = TabWnd::NO_WND;\nconst int TabBar::BUTTON_WIDTH = 10;\n\nTabBar::TabBar() :\n Control(),\n m_tabs(0),\n m_left_button(0),\n m_right_button(0),\n m_left_right_button_layout(0),\n m_text_color(CLR_BLACK),\n m_style(TAB_BAR_ATTACHED),\n m_first_tab_shown(0)\n{}\n\nTabBar::TabBar(int x, int y, int w, const boost::shared_ptr<Font>& font, Clr color, Clr text_color\/* = CLR_BLACK*\/,\n TabBarStyle style\/* = TAB_BAR_ATTACHED*\/, Uint32 flags\/* = CLICKABLE*\/) :\n Control(x, y, w, TabHeightFromFont(font), flags),\n m_tabs(0),\n m_font(font),\n m_left_button(0),\n m_right_button(0),\n m_left_right_button_layout(new Layout(0, 0, w, TabHeightFromFont(font), 1, 3)),\n m_text_color(text_color),\n m_style(style),\n m_first_tab_shown(0)\n{\n SetColor(color);\n\n EnableChildClipping(true);\n\n boost::shared_ptr<StyleFactory> style_factory = GetStyleFactory();\n\n m_tabs = style_factory->NewRadioButtonGroup(0, 0, w, TabHeightFromFont(font), HORIZONTAL);\n m_tabs->ExpandButtons(true);\n m_tabs->ExpandButtonsProportionally(true);\n\n m_left_right_button_layout->SetColumnStretch(0, 1);\n m_left_right_button_layout->SetColumnStretch(1, 0);\n m_left_right_button_layout->SetColumnStretch(2, 0);\n\n m_left_button = style_factory->NewTabBarLeftButton(0, 0, BUTTON_WIDTH, Height(), \"-\", m_font, Color(), m_text_color);\n m_right_button = style_factory->NewTabBarRightButton(0, 0, BUTTON_WIDTH, Height(), \"+\", m_font, Color(), m_text_color);\n m_left_right_button_layout->SetMinimumColumnWidth(1, m_left_button->Width());\n m_left_right_button_layout->SetMinimumColumnWidth(2, m_right_button->Width());\n m_left_right_button_layout->Add(m_left_button, 0, 1);\n m_left_right_button_layout->Add(m_right_button, 0, 2);\n m_left_right_button_layout->Hide();\n\n AttachChild(m_tabs);\n AttachChild(m_left_right_button_layout);\n\n Connect(m_tabs->ButtonChangedSignal, &TabBar::TabChanged, this);\n Connect(m_left_button->ClickedSignal, &TabBar::LeftClicked, this);\n Connect(m_right_button->ClickedSignal, &TabBar::RightClicked, this);\n}\n\nPt TabBar::MinUsableSize() const\n{\n int y = 0;\n for (unsigned int i = 0; i < m_tab_buttons.size(); ++i) {\n int button_min_y = m_tab_buttons[i]->MinUsableSize().y;\n if (y < button_min_y)\n y = button_min_y;\n }\n return Pt(4 * BUTTON_WIDTH, y);\n}\n\nint TabBar::CurrentTab() const\n{ return m_tabs->CheckedButton(); }\n\nvoid TabBar::SizeMove(const Pt& ul, const Pt& lr)\n{\n m_tabs->Resize(Pt(m_tabs->Size().x, lr.y - ul.y));\n m_left_right_button_layout->SizeMove(Pt(0, 0), lr - ul);\n Control::SizeMove(ul, lr);\n}\n\nvoid TabBar::Render()\n{}\n\nvoid TabBar::AddTab(const std::string& name)\n{ InsertTab(m_tab_buttons.size(), name); }\n\nvoid TabBar::InsertTab(int index, const std::string& name)\n{\n assert(0 <= index && index <= static_cast<int>(m_tab_buttons.size()));\n boost::shared_ptr<StyleFactory> style_factory = GetStyleFactory();\n StateButton* button = style_factory->NewTabBarTab(0, 0, 1, 1, name,\n m_font, TF_CENTER, Color(),\n m_text_color, CLR_ZERO,\n m_style == TAB_BAR_ATTACHED ?\n SBSTYLE_3D_TOP_ATTACHED_TAB :\n SBSTYLE_3D_TOP_DETACHED_TAB);\n button->InstallEventFilter(this);\n m_tab_buttons.insert(m_tab_buttons.begin() + index, button);\n m_tabs->InsertButton(index, m_tab_buttons[index]);\n if (Width() < m_tabs->Width()) {\n m_left_right_button_layout->Show();\n m_left_button->Disable(m_first_tab_shown == 0);\n int right_side = m_left_right_button_layout->Visible() ?\n m_left_button->UpperLeft().x :\n LowerRight().x;\n m_right_button->Disable(m_tab_buttons.back()->LowerRight().x <= right_side);\n }\n if (m_tabs->CheckedButton() == RadioButtonGroup::NO_BUTTON)\n m_tabs->SetCheck(0);\n}\n\nvoid TabBar::RemoveTab(const std::string& name)\n{\n int index = NO_TAB;\n for (unsigned int i = 0; i < m_tab_buttons.size(); ++i) {\n if (m_tab_buttons[i]->WindowText() == name) {\n index = i;\n break;\n }\n }\n assert(0 <= index && index < static_cast<int>(m_tab_buttons.size()));\n\n m_tab_buttons[index]->RemoveEventFilter(this);\n m_tabs->RemoveButton(m_tab_buttons[index]);\n delete m_tab_buttons[index];\n m_tab_buttons.erase(m_tab_buttons.begin() + index);\n if (m_tabs->Width() <= Width())\n m_left_right_button_layout->Hide();\n if (m_tabs->CheckedButton() == RadioButtonGroup::NO_BUTTON && !m_tab_buttons.empty())\n m_tabs->SetCheck(0);\n}\n\nvoid TabBar::SetCurrentTab(int index)\n{ m_tabs->SetCheck(index); }\n\nconst Button* TabBar::LeftButton() const\n{ return m_left_button; }\n\nconst Button* TabBar::RightButton() const\n{ return m_right_button; }\n\nvoid TabBar::DistinguishCurrentTab(const std::vector<StateButton*>& tab_buttons)\n{ m_tabs->RaiseCheckedButton(); }\n\nvoid TabBar::TabChanged(int index)\n{\n if (index != RadioButtonGroup::NO_BUTTON) {\n BringTabIntoView(index);\n DistinguishCurrentTab(m_tab_buttons);\n TabChangedSignal(index);\n }\n}\n\nvoid TabBar::LeftClicked()\n{\n assert(0 < m_first_tab_shown);\n m_tabs->OffsetMove(Pt(m_tab_buttons[m_first_tab_shown]->UpperLeft().x - m_tab_buttons[m_first_tab_shown - 1]->UpperLeft().x, 0));\n --m_first_tab_shown;\n m_left_button->Disable(m_first_tab_shown == 0);\n m_right_button->Disable(false);\n}\n\nvoid TabBar::RightClicked()\n{\n assert(m_first_tab_shown < static_cast<int>(m_tab_buttons.size()) - 1);\n m_tabs->OffsetMove(Pt(m_tab_buttons[m_first_tab_shown]->UpperLeft().x - m_tab_buttons[m_first_tab_shown + 1]->UpperLeft().x, 0));\n ++m_first_tab_shown;\n int right_side = m_left_right_button_layout->Visible() ?\n m_left_button->UpperLeft().x :\n LowerRight().x;\n m_right_button->Disable(m_tab_buttons.back()->LowerRight().x <= right_side);\n m_left_button->Disable(false);\n}\n\nvoid TabBar::BringTabIntoView(int index)\n{\n while (m_tab_buttons[index]->UpperLeft().x < UpperLeft().x) {\n LeftClicked();\n }\n int right_side = m_left_right_button_layout->Visible() ?\n m_left_button->UpperLeft().x :\n LowerRight().x;\n if (m_tab_buttons[index]->Width() < Width()) {\n while (right_side < m_tab_buttons[index]->LowerRight().x && index != m_first_tab_shown) {\n RightClicked();\n }\n } else {\n m_tabs->OffsetMove(Pt(m_tab_buttons[m_first_tab_shown]->UpperLeft().x - m_tab_buttons[index]->UpperLeft().x, 0));\n m_right_button->Disable(m_tab_buttons.back()->LowerRight().x <= right_side);\n m_left_button->Disable(false);\n }\n}\n\nbool TabBar::EventFilter(Wnd* w, const Event& event)\n{\n if (event.Type() == Event::LButtonDown ||\n event.Type() == Event::RButtonDown)\n MoveChildUp(m_left_right_button_layout);\n return false;\n}\n<|endoftext|>"} {"text":"<commit_before>\n#include \"Wrenly.h\"\n#include \"File.h\"\n#include <cstdlib> \/\/ for malloc\n#include <cstring> \/\/ for strcmp\n#include <iostream>\n#include <cstdio>\n\nnamespace {\n \n std::unordered_map< std::size_t, WrenForeignMethodFn >* boundForeignMethods{ nullptr };\n std::unordered_map< std::size_t, WrenForeignClassMethods >* boundForeignClasses{ nullptr };\n \n \/*\n * This function is going to use a global pointer to a bound method tree.\n * \n * When the correspodning wren vm executes a module, it has to bind its instances\n * of the bound method\/class tree to the global variable.\n * \n * There is no way to avoid this static\/global function\n * *\/\n WrenForeignMethodFn ForeignMethodProvider( WrenVM* vm,\n const char* module,\n const char* className,\n bool isStatic,\n const char* signature ) {\n if ( !boundForeignMethods ) {\n return NULL;\n }\n auto it = boundForeignMethods->find( wrenly::detail::HashMethodSignature( module, className, isStatic, signature ) );\n if ( it == boundForeignMethods->end() ) {\n return NULL;\n }\n \n return it->second;\n }\n \n WrenForeignClassMethods ForeignClassProvider( WrenVM* vm, const char* m, const char* c ) {\n if ( !boundForeignClasses ) {\n return WrenForeignClassMethods{ nullptr, nullptr };\n }\n auto it = boundForeignClasses->find( wrenly::detail::HashClassSignature( m, c ) );\n if ( it == boundForeignClasses->end() ) {\n return WrenForeignClassMethods{ nullptr, nullptr };\n }\n \n return it->second;\n }\n \n char* LoadModuleFnWrapper( WrenVM* vm, const char* mod ) {\n return wrenly::Wren::loadModuleFn( mod );\n }\n \n void WriteFnWrapper( WrenVM* vm, const char* text ) {\n wrenly::Wren::writeFn( vm, text );\n }\n}\n\nnamespace wrenly {\n\nMethod::Method( WrenVM* vm, WrenValue* method )\n: vm_( vm ),\n method_( method ),\n refCount_( nullptr ) {\n refCount_ = new unsigned;\n *refCount_ = 1u;\n}\n\nMethod::Method( const Method& other )\n: vm_( other.vm_ ),\n method_( other.method_ ),\n refCount_( other.refCount_ ) {\n retain_();\n}\n\nMethod::Method( Method&& other )\n: vm_( other.vm_ ),\n method_( other.method_ ),\n refCount_( other.refCount_ ) {\n other.vm_ = nullptr;\n other.method_ = nullptr;\n other.refCount_ = nullptr;\n}\n\nMethod::~Method() {\n release_();\n}\n\nMethod& Method::operator=( Method rhs ) {\n release_();\n vm_ = rhs.vm_;\n method_ = rhs.method_;\n refCount_ = rhs.refCount_;\n retain_();\n return *this;\n}\n\nvoid Method::retain_() {\n *refCount_ += 1u;\n}\n\nvoid Method::release_() {\n if ( refCount_ ) {\n *refCount_ -= 1u;\n if ( *refCount_ == 0u ) {\n wrenReleaseValue( vm_, method_ );\n delete refCount_;\n refCount_ = nullptr;\n }\n }\n}\n\nModuleContext::ModuleContext( std::string module, Wren* wren )\n: wren_( wren ),\n module_( module )\n {}\n \nClassContext ModuleContext::beginClass( std::string c ) {\n return ClassContext( c, wren_, this );\n}\n\nvoid ModuleContext::endModule() {}\n\n \nClassContext::ClassContext( std::string c, Wren* wren, ModuleContext* mod )\n: wren_( wren ),\n module_( mod ),\n class_( c )\n {}\n \nModuleContext& ClassContext::endClass() {\n return *module_;\n}\n\n\/*\n * Returns the source as a heap-allocated string.\n * Uses malloc, because our reallocateFn is set to default:\n * it uses malloc, realloc and free.\n * *\/\nLoadModuleFn Wren::loadModuleFn = []( const char* mod ) -> char* {\n std::string path( mod );\n path += \".wren\";\n std::string source;\n try {\n source = wrenly::FileToString( path );\n } catch( const std::exception& e ) {\n return NULL;\n }\n char* buffer = (char*) malloc( source.size() );\n memcpy( buffer, source.c_str(), source.size() );\n return buffer;\n};\n\nWriteFn Wren::writeFn = []( WrenVM* vm, const char* text ) -> void {\n printf( text );\n};\n\nWren::Wren()\n: vm_( nullptr ),\n foreignMethods_() {\n \n WrenConfiguration configuration{};\n wrenInitConfiguration( &configuration );\n configuration.bindForeignMethodFn = ForeignMethodProvider;\n configuration.loadModuleFn = LoadModuleFnWrapper;\n configuration.bindForeignClassFn = ForeignClassProvider;\n configuration.writeFn = WriteFnWrapper;\n vm_ = wrenNewVM( &configuration );\n}\n\nWren::Wren( Wren&& other )\n: vm_( other.vm_ ),\n foreignMethods_( std::move( other.foreignMethods_ ) ),\n foreignClasses_( std::move( other.foreignClasses_ ) ){\n other.vm_ = nullptr;\n}\n\nWren& Wren::operator=( Wren&& rhs ) {\n vm_ = rhs.vm_;\n foreignMethods_ = std::move( rhs.foreignMethods_ );\n foreignClasses_ = std::move( rhs.foreignClasses_ );\n rhs.vm_ = nullptr;\n return *this;\n}\n\nWren::~Wren() {\n wrenFreeVM( vm_ );\n}\n\nWrenVM* Wren::vm() {\n return vm_;\n}\n\nvoid Wren::executeModule( const std::string& mod ) {\n \/\/ set global variables for the C-callbacks\n boundForeignMethods = &foreignMethods_;\n boundForeignClasses = &foreignClasses_;\n \n std::string file = mod;\n file += \".wren\";\n auto source = FileToString( file );\n auto res = wrenInterpret( vm_, file.c_str(), source.c_str() );\n \n if ( res == WrenInterpretResult::WREN_RESULT_COMPILE_ERROR ) {\n std::cerr << \"WREN_RESULT_COMPILE_ERROR in module \" << mod << std::endl;\n }\n \n if ( res == WrenInterpretResult::WREN_RESULT_RUNTIME_ERROR ) {\n std::cerr << \"WREN_RESULT_RUNTIME_ERROR in module \" << mod << std::endl;\n }\n \n boundForeignMethods = nullptr;\n boundForeignClasses = nullptr;\n}\n\nvoid Wren::executeString( const std::string& code ) {\n \/\/ set global variables for the C-callbacks\n boundForeignMethods = &foreignMethods_;\n boundForeignClasses = &foreignClasses_;\n \n auto res = wrenInterpret( vm_, \"string\", code.c_str() );\n \n if ( res == WrenInterpretResult::WREN_RESULT_COMPILE_ERROR ) {\n std::cerr << \"WREN_RESULT_COMPILE_ERROR in string: \" << code << std::endl;\n }\n \n if ( res == WrenInterpretResult::WREN_RESULT_RUNTIME_ERROR ) {\n std::cerr << \"WREN_RESULT_RUNTIME_ERROR in string: \" << code << std::endl;\n }\n \n boundForeignMethods = nullptr;\n boundForeignClasses = nullptr;\n}\n\nvoid Wren::collectGarbage() {\n wrenCollectGarbage( vm_ );\n}\n\nModuleContext Wren::beginModule( std::string mod ) {\n return ModuleContext( mod, this );\n}\n\nMethod Wren::method( \n const std::string& mod,\n const std::string& var,\n const std::string& sig\n) {\n return Method( vm_, wrenGetMethod( vm_, mod.c_str(), var.c_str(), sig.c_str() ) );\n}\n\nvoid Wren::registerFunction_(\n const std::string& mod,\n const std::string& cName,\n bool isStatic,\n const std::string& sig,\n WrenForeignMethodFn function\n) {\n std::size_t hash = detail::HashMethodSignature( mod.c_str(), cName.c_str(), isStatic, sig.c_str() );\n foreignMethods_.insert( std::make_pair( hash, function ) );\n}\n\nvoid Wren::registerClass_(\n const std::string& m,\n const std::string& c,\n WrenForeignClassMethods methods\n) {\n std::size_t hash = detail::HashClassSignature( m.c_str(), c.c_str() );\n foreignClasses_.insert( std::make_pair( hash, methods ) );\n}\n\n} \/\/ wrenly\n<commit_msg>fix warning in the printFn closure<commit_after>\n#include \"Wrenly.h\"\n#include \"File.h\"\n#include <cstdlib> \/\/ for malloc\n#include <cstring> \/\/ for strcmp\n#include <iostream>\n#include <cstdio>\n\nnamespace {\n \n std::unordered_map< std::size_t, WrenForeignMethodFn >* boundForeignMethods{ nullptr };\n std::unordered_map< std::size_t, WrenForeignClassMethods >* boundForeignClasses{ nullptr };\n \n \/*\n * This function is going to use a global pointer to a bound method tree.\n * \n * When the correspodning wren vm executes a module, it has to bind its instances\n * of the bound method\/class tree to the global variable.\n * \n * There is no way to avoid this static\/global function\n * *\/\n WrenForeignMethodFn ForeignMethodProvider( WrenVM* vm,\n const char* module,\n const char* className,\n bool isStatic,\n const char* signature ) {\n if ( !boundForeignMethods ) {\n return NULL;\n }\n auto it = boundForeignMethods->find( wrenly::detail::HashMethodSignature( module, className, isStatic, signature ) );\n if ( it == boundForeignMethods->end() ) {\n return NULL;\n }\n \n return it->second;\n }\n \n WrenForeignClassMethods ForeignClassProvider( WrenVM* vm, const char* m, const char* c ) {\n if ( !boundForeignClasses ) {\n return WrenForeignClassMethods{ nullptr, nullptr };\n }\n auto it = boundForeignClasses->find( wrenly::detail::HashClassSignature( m, c ) );\n if ( it == boundForeignClasses->end() ) {\n return WrenForeignClassMethods{ nullptr, nullptr };\n }\n \n return it->second;\n }\n \n char* LoadModuleFnWrapper( WrenVM* vm, const char* mod ) {\n return wrenly::Wren::loadModuleFn( mod );\n }\n \n void WriteFnWrapper( WrenVM* vm, const char* text ) {\n wrenly::Wren::writeFn( vm, text );\n }\n}\n\nnamespace wrenly {\n\nMethod::Method( WrenVM* vm, WrenValue* method )\n: vm_( vm ),\n method_( method ),\n refCount_( nullptr ) {\n refCount_ = new unsigned;\n *refCount_ = 1u;\n}\n\nMethod::Method( const Method& other )\n: vm_( other.vm_ ),\n method_( other.method_ ),\n refCount_( other.refCount_ ) {\n retain_();\n}\n\nMethod::Method( Method&& other )\n: vm_( other.vm_ ),\n method_( other.method_ ),\n refCount_( other.refCount_ ) {\n other.vm_ = nullptr;\n other.method_ = nullptr;\n other.refCount_ = nullptr;\n}\n\nMethod::~Method() {\n release_();\n}\n\nMethod& Method::operator=( Method rhs ) {\n release_();\n vm_ = rhs.vm_;\n method_ = rhs.method_;\n refCount_ = rhs.refCount_;\n retain_();\n return *this;\n}\n\nvoid Method::retain_() {\n *refCount_ += 1u;\n}\n\nvoid Method::release_() {\n if ( refCount_ ) {\n *refCount_ -= 1u;\n if ( *refCount_ == 0u ) {\n wrenReleaseValue( vm_, method_ );\n delete refCount_;\n refCount_ = nullptr;\n }\n }\n}\n\nModuleContext::ModuleContext( std::string module, Wren* wren )\n: wren_( wren ),\n module_( module )\n {}\n \nClassContext ModuleContext::beginClass( std::string c ) {\n return ClassContext( c, wren_, this );\n}\n\nvoid ModuleContext::endModule() {}\n\n \nClassContext::ClassContext( std::string c, Wren* wren, ModuleContext* mod )\n: wren_( wren ),\n module_( mod ),\n class_( c )\n {}\n \nModuleContext& ClassContext::endClass() {\n return *module_;\n}\n\n\/*\n * Returns the source as a heap-allocated string.\n * Uses malloc, because our reallocateFn is set to default:\n * it uses malloc, realloc and free.\n * *\/\nLoadModuleFn Wren::loadModuleFn = []( const char* mod ) -> char* {\n std::string path( mod );\n path += \".wren\";\n std::string source;\n try {\n source = wrenly::FileToString( path );\n } catch( const std::exception& e ) {\n return NULL;\n }\n char* buffer = (char*) malloc( source.size() );\n memcpy( buffer, source.c_str(), source.size() );\n return buffer;\n};\n\nWriteFn Wren::writeFn = []( WrenVM* vm, const char* text ) -> void {\n printf( \"%s\", text );\n};\n\nWren::Wren()\n: vm_( nullptr ),\n foreignMethods_() {\n \n WrenConfiguration configuration{};\n wrenInitConfiguration( &configuration );\n configuration.bindForeignMethodFn = ForeignMethodProvider;\n configuration.loadModuleFn = LoadModuleFnWrapper;\n configuration.bindForeignClassFn = ForeignClassProvider;\n configuration.writeFn = WriteFnWrapper;\n vm_ = wrenNewVM( &configuration );\n}\n\nWren::Wren( Wren&& other )\n: vm_( other.vm_ ),\n foreignMethods_( std::move( other.foreignMethods_ ) ),\n foreignClasses_( std::move( other.foreignClasses_ ) ){\n other.vm_ = nullptr;\n}\n\nWren& Wren::operator=( Wren&& rhs ) {\n vm_ = rhs.vm_;\n foreignMethods_ = std::move( rhs.foreignMethods_ );\n foreignClasses_ = std::move( rhs.foreignClasses_ );\n rhs.vm_ = nullptr;\n return *this;\n}\n\nWren::~Wren() {\n wrenFreeVM( vm_ );\n}\n\nWrenVM* Wren::vm() {\n return vm_;\n}\n\nvoid Wren::executeModule( const std::string& mod ) {\n \/\/ set global variables for the C-callbacks\n boundForeignMethods = &foreignMethods_;\n boundForeignClasses = &foreignClasses_;\n \n std::string file = mod;\n file += \".wren\";\n auto source = FileToString( file );\n auto res = wrenInterpret( vm_, file.c_str(), source.c_str() );\n \n if ( res == WrenInterpretResult::WREN_RESULT_COMPILE_ERROR ) {\n std::cerr << \"WREN_RESULT_COMPILE_ERROR in module \" << mod << std::endl;\n }\n \n if ( res == WrenInterpretResult::WREN_RESULT_RUNTIME_ERROR ) {\n std::cerr << \"WREN_RESULT_RUNTIME_ERROR in module \" << mod << std::endl;\n }\n \n boundForeignMethods = nullptr;\n boundForeignClasses = nullptr;\n}\n\nvoid Wren::executeString( const std::string& code ) {\n \/\/ set global variables for the C-callbacks\n boundForeignMethods = &foreignMethods_;\n boundForeignClasses = &foreignClasses_;\n \n auto res = wrenInterpret( vm_, \"string\", code.c_str() );\n \n if ( res == WrenInterpretResult::WREN_RESULT_COMPILE_ERROR ) {\n std::cerr << \"WREN_RESULT_COMPILE_ERROR in string: \" << code << std::endl;\n }\n \n if ( res == WrenInterpretResult::WREN_RESULT_RUNTIME_ERROR ) {\n std::cerr << \"WREN_RESULT_RUNTIME_ERROR in string: \" << code << std::endl;\n }\n \n boundForeignMethods = nullptr;\n boundForeignClasses = nullptr;\n}\n\nvoid Wren::collectGarbage() {\n wrenCollectGarbage( vm_ );\n}\n\nModuleContext Wren::beginModule( std::string mod ) {\n return ModuleContext( mod, this );\n}\n\nMethod Wren::method( \n const std::string& mod,\n const std::string& var,\n const std::string& sig\n) {\n return Method( vm_, wrenGetMethod( vm_, mod.c_str(), var.c_str(), sig.c_str() ) );\n}\n\nvoid Wren::registerFunction_(\n const std::string& mod,\n const std::string& cName,\n bool isStatic,\n const std::string& sig,\n WrenForeignMethodFn function\n) {\n std::size_t hash = detail::HashMethodSignature( mod.c_str(), cName.c_str(), isStatic, sig.c_str() );\n foreignMethods_.insert( std::make_pair( hash, function ) );\n}\n\nvoid Wren::registerClass_(\n const std::string& m,\n const std::string& c,\n WrenForeignClassMethods methods\n) {\n std::size_t hash = detail::HashClassSignature( m.c_str(), c.c_str() );\n foreignClasses_.insert( std::make_pair( hash, methods ) );\n}\n\n} \/\/ wrenly\n<|endoftext|>"} {"text":"<commit_before>#ifdef HAVE_CONFIG_H\n#include <config.h>\n#endif\n\n#include <asio.hpp>\n\n#include <map>\n#include <vector>\n\n#include \"common.hxx\"\n#include \"realm.hxx\"\n#include \"advert.hxx\"\n\nusing namespace std;\n\nstatic realmed<map<asio::ip::udp::endpoint, Advert*> > adverts;\n\nAdvert::Advert(const Realm* r, const asio::ip::udp::endpoint& ep)\n: realm(r), endpoint(ep)\n{\n adverts[r][ep] = this;\n}\n\nAdvert::Advert(const Advert& that)\n: realm(that.realm), endpoint(that.endpoint)\n{\n adverts[realm][endpoint] = this;\n}\n\nAdvert::~Advert() {\n map<asio::ip::udp::endpoint,Advert*>::iterator it =\n adverts[realm].find(endpoint);\n if (it != adverts[realm].end() && it->second == this)\n adverts[realm].erase(it);\n}\n\nvoid Advert::setData(const byte* dat, unsigned len) {\n data.assign(dat, dat+len);\n}\n\nAdvert::iterator::iterator(const Realm* r)\n: realm(r), beginning(true)\n{ }\n\n\nAdvert::iterator::iterator(const iterator& that)\n: realm(that.realm), prev(that.prev), beginning(that.beginning)\n{ }\n\nAdvert::iterator& Advert::iterator::operator=(const iterator& that) {\n realm = that.realm;\n prev = that.prev;\n beginning = that.beginning;\n return *this;\n}\n\nbool Advert::iterator::next(asio::ip::udp::endpoint& ep, vector<byte>& dst) {\n map<asio::ip::udp::endpoint,Advert*>::const_iterator it =\n beginning? adverts[realm].begin() : adverts[realm].lower_bound(prev);\n \/\/Move past the key (we got this last time)\n if (beginning && it != adverts[realm].end())\n ++it;\n beginning = false;\n\n \/\/Move past any empty ones\n while (it != adverts[realm].end() && it->second->data.empty())\n ++it;\n\n if (it != adverts[realm].end()) {\n ep = it->second->endpoint;\n dst.insert(dst.end(), it->second->data.begin(), it->second->data.end());\n prev = ep;\n return true;\n } else {\n return false;\n }\n}\n\nvoid Advert::iterator::reset() {\n beginning = true;\n}\n<commit_msg>Fix Advert::iterator::next().<commit_after>#ifdef HAVE_CONFIG_H\n#include <config.h>\n#endif\n\n#include <asio.hpp>\n\n#include <map>\n#include <vector>\n\n#include \"common.hxx\"\n#include \"realm.hxx\"\n#include \"advert.hxx\"\n\nusing namespace std;\n\nstatic realmed<map<asio::ip::udp::endpoint, Advert*> > adverts;\n\nAdvert::Advert(const Realm* r, const asio::ip::udp::endpoint& ep)\n: realm(r), endpoint(ep)\n{\n adverts[r][ep] = this;\n}\n\nAdvert::Advert(const Advert& that)\n: realm(that.realm), endpoint(that.endpoint)\n{\n adverts[realm][endpoint] = this;\n}\n\nAdvert::~Advert() {\n map<asio::ip::udp::endpoint,Advert*>::iterator it =\n adverts[realm].find(endpoint);\n if (it != adverts[realm].end() && it->second == this)\n adverts[realm].erase(it);\n}\n\nvoid Advert::setData(const byte* dat, unsigned len) {\n data.assign(dat, dat+len);\n}\n\nAdvert::iterator::iterator(const Realm* r)\n: realm(r), beginning(true)\n{ }\n\n\nAdvert::iterator::iterator(const iterator& that)\n: realm(that.realm), prev(that.prev), beginning(that.beginning)\n{ }\n\nAdvert::iterator& Advert::iterator::operator=(const iterator& that) {\n realm = that.realm;\n prev = that.prev;\n beginning = that.beginning;\n return *this;\n}\n\nbool Advert::iterator::next(asio::ip::udp::endpoint& ep, vector<byte>& dst) {\n map<asio::ip::udp::endpoint,Advert*>::const_iterator it =\n beginning? adverts[realm].begin() : adverts[realm].lower_bound(prev);\n \/\/Move past the key (we got this last time)\n if (!beginning && it != adverts[realm].end())\n ++it;\n beginning = false;\n\n \/\/Move past any empty ones\n while (it != adverts[realm].end() && it->second->data.empty())\n ++it;\n\n if (it != adverts[realm].end()) {\n ep = it->second->endpoint;\n dst.insert(dst.end(), it->second->data.begin(), it->second->data.end());\n prev = ep;\n return true;\n } else {\n return false;\n }\n}\n\nvoid Advert::iterator::reset() {\n beginning = true;\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#ifdef TORRENT_DEBUG\n\n#ifdef __APPLE__\n#include <AvailabilityMacros.h>\n#endif\n\n#ifdef __GNUC__\n\n#include <cxxabi.h>\n#include <string>\n#include <cstring>\n#include <stdlib.h>\n\nstd::string demangle(char const* name)\n{\n\/\/ in case this string comes\n\t\/\/ this is needed on linux\n\tchar const* start = strchr(name, '(');\n\tif (start != 0)\n\t{\n\t\t++start;\n\t}\n\telse\n\t{\n\t\t\/\/ this is needed on macos x\n\t\tstart = strstr(name, \"0x\");\n\t\tif (start != 0)\n\t\t{\n\t\t\tstart = strchr(start, ' ');\n\t\t\tif (start != 0) ++start;\n\t\t\telse start = name;\n\t\t}\n\t\telse start = name;\n\t}\n\n\tchar const* end = strchr(start, '+');\n\tif (end) while (*(end-1) == ' ') --end;\n\n\tstd::string in;\n\tif (end == 0) in.assign(start);\n\telse in.assign(start, end);\n\n\tsize_t len;\n\tint status;\n\tchar* unmangled = ::abi::__cxa_demangle(in.c_str(), 0, &len, &status);\n\tif (unmangled == 0) return in;\n\tstd::string ret(unmangled);\n\tfree(unmangled);\n\treturn ret;\n}\n\n#endif\n\n#include <stdlib.h>\n#include <stdio.h>\n#include <signal.h>\n#include \"libtorrent\/version.hpp\"\n\n\/\/ execinfo.h is available in the MacOS X 10.5 SDK.\n#if (defined __linux__ || (defined __APPLE__ && MAC_OS_X_VERSION_MIN_REQUIRED >= 1050))\n#include <execinfo.h>\n\nvoid print_backtrace(char const* label)\n{\n\tvoid* stack[50];\n\tint size = backtrace(stack, 50);\n\tchar** symbols = backtrace_symbols(stack, size);\n\n\tfprintf(stderr, \"%s\\n\", label);\n\tfor (int i = 1; i < size; ++i)\n\t{\n\t\tfprintf(stderr, \"%d: %s\\n\", i, demangle(symbols[i]).c_str());\n\t}\n\n\tfree(symbols);\n}\n#else\n\nvoid print_backtrace(char const* label) {}\n\n#endif\n\nvoid assert_fail(char const* expr, int line, char const* file, char const* function)\n{\n\n\tfprintf(stderr, \"assertion failed. Please file a bugreport at \"\n\t\t\"http:\/\/code.rasterbar.com\/libtorrent\/newticket\\n\"\n\t\t\"Please include the following information:\\n\\n\"\n\t\t\"version: \" LIBTORRENT_VERSION \"\\n\"\n\t\t\"%s\"\n\t\t\"file: '%s'\\n\"\n\t\t\"line: %d\\n\"\n\t\t\"function: %s\\n\"\n\t\t\"expression: %s\\n\", LIBTORRENT_REVISION, file, line, function, expr);\n\n\tprint_backtrace(\"stack:\");\n\n \t\/\/ send SIGINT to the current process\n \t\/\/ to break into the debugger\n \traise(SIGINT);\n \tabort();\n}\n\n#else\n\nvoid assert_fail(char const* expr, int line, char const* file, char const* function) {}\n\n#endif\n\n<commit_msg>fixed missing new line in assert message<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#ifdef TORRENT_DEBUG\n\n#ifdef __APPLE__\n#include <AvailabilityMacros.h>\n#endif\n\n#ifdef __GNUC__\n\n#include <cxxabi.h>\n#include <string>\n#include <cstring>\n#include <stdlib.h>\n\nstd::string demangle(char const* name)\n{\n\/\/ in case this string comes\n\t\/\/ this is needed on linux\n\tchar const* start = strchr(name, '(');\n\tif (start != 0)\n\t{\n\t\t++start;\n\t}\n\telse\n\t{\n\t\t\/\/ this is needed on macos x\n\t\tstart = strstr(name, \"0x\");\n\t\tif (start != 0)\n\t\t{\n\t\t\tstart = strchr(start, ' ');\n\t\t\tif (start != 0) ++start;\n\t\t\telse start = name;\n\t\t}\n\t\telse start = name;\n\t}\n\n\tchar const* end = strchr(start, '+');\n\tif (end) while (*(end-1) == ' ') --end;\n\n\tstd::string in;\n\tif (end == 0) in.assign(start);\n\telse in.assign(start, end);\n\n\tsize_t len;\n\tint status;\n\tchar* unmangled = ::abi::__cxa_demangle(in.c_str(), 0, &len, &status);\n\tif (unmangled == 0) return in;\n\tstd::string ret(unmangled);\n\tfree(unmangled);\n\treturn ret;\n}\n\n#endif\n\n#include <stdlib.h>\n#include <stdio.h>\n#include <signal.h>\n#include \"libtorrent\/version.hpp\"\n\n\/\/ execinfo.h is available in the MacOS X 10.5 SDK.\n#if (defined __linux__ || (defined __APPLE__ && MAC_OS_X_VERSION_MIN_REQUIRED >= 1050))\n#include <execinfo.h>\n\nvoid print_backtrace(char const* label)\n{\n\tvoid* stack[50];\n\tint size = backtrace(stack, 50);\n\tchar** symbols = backtrace_symbols(stack, size);\n\n\tfprintf(stderr, \"%s\\n\", label);\n\tfor (int i = 1; i < size; ++i)\n\t{\n\t\tfprintf(stderr, \"%d: %s\\n\", i, demangle(symbols[i]).c_str());\n\t}\n\n\tfree(symbols);\n}\n#else\n\nvoid print_backtrace(char const* label) {}\n\n#endif\n\nvoid assert_fail(char const* expr, int line, char const* file, char const* function)\n{\n\n\tfprintf(stderr, \"assertion failed. Please file a bugreport at \"\n\t\t\"http:\/\/code.rasterbar.com\/libtorrent\/newticket\\n\"\n\t\t\"Please include the following information:\\n\\n\"\n\t\t\"version: \" LIBTORRENT_VERSION \"\\n\"\n\t\t\"%s\\n\"\n\t\t\"file: '%s'\\n\"\n\t\t\"line: %d\\n\"\n\t\t\"function: %s\\n\"\n\t\t\"expression: %s\\n\", LIBTORRENT_REVISION, file, line, function, expr);\n\n\tprint_backtrace(\"stack:\");\n\n \t\/\/ send SIGINT to the current process\n \t\/\/ to break into the debugger\n \traise(SIGINT);\n \tabort();\n}\n\n#else\n\nvoid assert_fail(char const* expr, int line, char const* file, char const* function) {}\n\n#endif\n\n<|endoftext|>"} {"text":"<commit_before>\/\/ Copyright (c) 2009-2010 Satoshi Nakamoto\n\/\/ Copyright (c) 2009-2017 The Bitcoin Core developers\n\/\/ Distributed under the MIT software license, see the accompanying\n\/\/ file COPYING or http:\/\/www.opensource.org\/licenses\/mit-license.php.\n\n#include <banman.h>\n\n#include <netaddress.h>\n#include <ui_interface.h>\n#include <util\/system.h>\n#include <util\/time.h>\n\n\nBanMan::BanMan(fs::path ban_file, CClientUIInterface* client_interface, int64_t default_ban_time)\n : m_client_interface(client_interface), m_ban_db(std::move(ban_file)), m_default_ban_time(default_ban_time)\n{\n if (m_client_interface) m_client_interface->InitMessage(_(\"Loading banlist...\"));\n\n int64_t nStart = GetTimeMillis();\n m_is_dirty = false;\n banmap_t banmap;\n if (m_ban_db.Read(banmap)) {\n SetBanned(banmap); \/\/ thread save setter\n SetBannedSetDirty(false); \/\/ no need to write down, just read data\n SweepBanned(); \/\/ sweep out unused entries\n\n LogPrint(BCLog::NET, \"Loaded %d banned node ips\/subnets from banlist.dat %dms\\n\",\n banmap.size(), GetTimeMillis() - nStart);\n } else {\n LogPrintf(\"Invalid or missing banlist.dat; recreating\\n\");\n SetBannedSetDirty(true); \/\/ force write\n DumpBanlist();\n }\n}\n\nBanMan::~BanMan()\n{\n DumpBanlist();\n}\n\nvoid BanMan::DumpBanlist()\n{\n SweepBanned(); \/\/ clean unused entries (if bantime has expired)\n\n if (!BannedSetIsDirty()) return;\n\n int64_t nStart = GetTimeMillis();\n\n banmap_t banmap;\n GetBanned(banmap);\n if (m_ban_db.Write(banmap)) {\n SetBannedSetDirty(false);\n }\n\n LogPrint(BCLog::NET, \"Flushed %d banned node ips\/subnets to banlist.dat %dms\\n\",\n banmap.size(), GetTimeMillis() - nStart);\n}\n\nvoid BanMan::ClearBanned()\n{\n {\n LOCK(m_cs_banned);\n m_banned.clear();\n m_is_dirty = true;\n }\n DumpBanlist(); \/\/store banlist to disk\n if (m_client_interface) m_client_interface->BannedListChanged();\n}\n\nbool BanMan::IsBanned(CNetAddr netAddr)\n{\n LOCK(m_cs_banned);\n for (const auto& it : m_banned) {\n CSubNet subNet = it.first;\n CBanEntry banEntry = it.second;\n\n if (subNet.Match(netAddr) && GetTime() < banEntry.nBanUntil) {\n return true;\n }\n }\n return false;\n}\n\nbool BanMan::IsBanned(CSubNet subNet)\n{\n LOCK(m_cs_banned);\n banmap_t::iterator i = m_banned.find(subNet);\n if (i != m_banned.end()) {\n CBanEntry banEntry = (*i).second;\n if (GetTime() < banEntry.nBanUntil) {\n return true;\n }\n }\n return false;\n}\n\nvoid BanMan::Ban(const CNetAddr& netAddr, const BanReason& banReason, int64_t bantimeoffset, bool sinceUnixEpoch)\n{\n CSubNet subNet(netAddr);\n Ban(subNet, banReason, bantimeoffset, sinceUnixEpoch);\n}\n\nvoid BanMan::Ban(const CSubNet& subNet, const BanReason& banReason, int64_t bantimeoffset, bool sinceUnixEpoch)\n{\n CBanEntry banEntry(GetTime());\n banEntry.banReason = banReason;\n if (bantimeoffset <= 0) {\n bantimeoffset = m_default_ban_time;\n sinceUnixEpoch = false;\n }\n banEntry.nBanUntil = (sinceUnixEpoch ? 0 : GetTime()) + bantimeoffset;\n\n {\n LOCK(m_cs_banned);\n if (m_banned[subNet].nBanUntil < banEntry.nBanUntil) {\n m_banned[subNet] = banEntry;\n m_is_dirty = true;\n } else\n return;\n }\n if (m_client_interface) m_client_interface->BannedListChanged();\n\n \/\/store banlist to disk immediately if user requested ban\n if (banReason == BanReasonManuallyAdded) DumpBanlist();\n}\n\nbool BanMan::Unban(const CNetAddr& netAddr)\n{\n CSubNet subNet(netAddr);\n return Unban(subNet);\n}\n\nbool BanMan::Unban(const CSubNet& subNet)\n{\n {\n LOCK(m_cs_banned);\n if (m_banned.erase(subNet) == 0) return false;\n m_is_dirty = true;\n }\n if (m_client_interface) m_client_interface->BannedListChanged();\n DumpBanlist(); \/\/store banlist to disk immediately\n return true;\n}\n\nvoid BanMan::GetBanned(banmap_t& banMap)\n{\n LOCK(m_cs_banned);\n \/\/ Sweep the banlist so expired bans are not returned\n SweepBanned();\n banMap = m_banned; \/\/create a thread safe copy\n}\n\nvoid BanMan::SetBanned(const banmap_t& banMap)\n{\n LOCK(m_cs_banned);\n m_banned = banMap;\n m_is_dirty = true;\n}\n\nvoid BanMan::SweepBanned()\n{\n int64_t now = GetTime();\n bool notifyUI = false;\n {\n LOCK(m_cs_banned);\n banmap_t::iterator it = m_banned.begin();\n while (it != m_banned.end()) {\n CSubNet subNet = (*it).first;\n CBanEntry banEntry = (*it).second;\n if (now > banEntry.nBanUntil) {\n m_banned.erase(it++);\n m_is_dirty = true;\n notifyUI = true;\n LogPrint(BCLog::NET, \"%s: Removed banned node ip\/subnet from banlist.dat: %s\\n\", __func__, subNet.ToString());\n } else\n ++it;\n }\n }\n \/\/ update UI\n if (notifyUI && m_client_interface) {\n m_client_interface->BannedListChanged();\n }\n}\n\nbool BanMan::BannedSetIsDirty()\n{\n LOCK(m_cs_banned);\n return m_is_dirty;\n}\n\nvoid BanMan::SetBannedSetDirty(bool dirty)\n{\n LOCK(m_cs_banned); \/\/reuse m_banned lock for the m_is_dirty flag\n m_is_dirty = dirty;\n}\n<commit_msg>Bitcoin: 1ffa4ce27d4ea6c1067d8984455df97994c7713e (banman: reformulate nBanUtil calculation).<commit_after>\/\/ Copyright (c) 2009-2010 Satoshi Nakamoto\n\/\/ Copyright (c) 2009-2017 The Bitcoin Core developers\n\/\/ Distributed under the MIT software license, see the accompanying\n\/\/ file COPYING or http:\/\/www.opensource.org\/licenses\/mit-license.php.\n\n#include <banman.h>\n\n#include <netaddress.h>\n#include <ui_interface.h>\n#include <util\/system.h>\n#include <util\/time.h>\n\n\nBanMan::BanMan(fs::path ban_file, CClientUIInterface* client_interface, int64_t default_ban_time)\n : m_client_interface(client_interface), m_ban_db(std::move(ban_file)), m_default_ban_time(default_ban_time)\n{\n if (m_client_interface) m_client_interface->InitMessage(_(\"Loading banlist...\"));\n\n int64_t nStart = GetTimeMillis();\n m_is_dirty = false;\n banmap_t banmap;\n if (m_ban_db.Read(banmap)) {\n SetBanned(banmap); \/\/ thread save setter\n SetBannedSetDirty(false); \/\/ no need to write down, just read data\n SweepBanned(); \/\/ sweep out unused entries\n\n LogPrint(BCLog::NET, \"Loaded %d banned node ips\/subnets from banlist.dat %dms\\n\",\n banmap.size(), GetTimeMillis() - nStart);\n } else {\n LogPrintf(\"Invalid or missing banlist.dat; recreating\\n\");\n SetBannedSetDirty(true); \/\/ force write\n DumpBanlist();\n }\n}\n\nBanMan::~BanMan()\n{\n DumpBanlist();\n}\n\nvoid BanMan::DumpBanlist()\n{\n SweepBanned(); \/\/ clean unused entries (if bantime has expired)\n\n if (!BannedSetIsDirty()) return;\n\n int64_t nStart = GetTimeMillis();\n\n banmap_t banmap;\n GetBanned(banmap);\n if (m_ban_db.Write(banmap)) {\n SetBannedSetDirty(false);\n }\n\n LogPrint(BCLog::NET, \"Flushed %d banned node ips\/subnets to banlist.dat %dms\\n\",\n banmap.size(), GetTimeMillis() - nStart);\n}\n\nvoid BanMan::ClearBanned()\n{\n {\n LOCK(m_cs_banned);\n m_banned.clear();\n m_is_dirty = true;\n }\n DumpBanlist(); \/\/store banlist to disk\n if (m_client_interface) m_client_interface->BannedListChanged();\n}\n\nbool BanMan::IsBanned(CNetAddr netAddr)\n{\n LOCK(m_cs_banned);\n for (const auto& it : m_banned) {\n CSubNet subNet = it.first;\n CBanEntry banEntry = it.second;\n\n if (subNet.Match(netAddr) && GetTime() < banEntry.nBanUntil) {\n return true;\n }\n }\n return false;\n}\n\nbool BanMan::IsBanned(CSubNet subNet)\n{\n LOCK(m_cs_banned);\n banmap_t::iterator i = m_banned.find(subNet);\n if (i != m_banned.end()) {\n CBanEntry banEntry = (*i).second;\n if (GetTime() < banEntry.nBanUntil) {\n return true;\n }\n }\n return false;\n}\n\nvoid BanMan::Ban(const CNetAddr& netAddr, const BanReason& banReason, int64_t bantimeoffset, bool sinceUnixEpoch)\n{\n CSubNet subNet(netAddr);\n Ban(subNet, banReason, bantimeoffset, sinceUnixEpoch);\n}\n\nvoid BanMan::Ban(const CSubNet& subNet, const BanReason& banReason, int64_t bantimeoffset, bool sinceUnixEpoch)\n{\n CBanEntry banEntry(GetTime());\n banEntry.banReason = banReason;\n\n int64_t normalized_bantimeoffset = bantimeoffset;\n bool normalized_sinceUnixEpoch = sinceUnixEpoch;\n if (bantimeoffset <= 0) {\n normalized_bantimeoffset = m_default_ban_time;\n normalized_sinceUnixEpoch = false;\n }\n banEntry.nBanUntil = (normalized_sinceUnixEpoch ? 0 : GetTime()) + normalized_bantimeoffset;\n\n {\n LOCK(m_cs_banned);\n if (m_banned[subNet].nBanUntil < banEntry.nBanUntil) {\n m_banned[subNet] = banEntry;\n m_is_dirty = true;\n } else\n return;\n }\n if (m_client_interface) m_client_interface->BannedListChanged();\n\n \/\/store banlist to disk immediately if user requested ban\n if (banReason == BanReasonManuallyAdded) DumpBanlist();\n}\n\nbool BanMan::Unban(const CNetAddr& netAddr)\n{\n CSubNet subNet(netAddr);\n return Unban(subNet);\n}\n\nbool BanMan::Unban(const CSubNet& subNet)\n{\n {\n LOCK(m_cs_banned);\n if (m_banned.erase(subNet) == 0) return false;\n m_is_dirty = true;\n }\n if (m_client_interface) m_client_interface->BannedListChanged();\n DumpBanlist(); \/\/store banlist to disk immediately\n return true;\n}\n\nvoid BanMan::GetBanned(banmap_t& banMap)\n{\n LOCK(m_cs_banned);\n \/\/ Sweep the banlist so expired bans are not returned\n SweepBanned();\n banMap = m_banned; \/\/create a thread safe copy\n}\n\nvoid BanMan::SetBanned(const banmap_t& banMap)\n{\n LOCK(m_cs_banned);\n m_banned = banMap;\n m_is_dirty = true;\n}\n\nvoid BanMan::SweepBanned()\n{\n int64_t now = GetTime();\n bool notifyUI = false;\n {\n LOCK(m_cs_banned);\n banmap_t::iterator it = m_banned.begin();\n while (it != m_banned.end()) {\n CSubNet subNet = (*it).first;\n CBanEntry banEntry = (*it).second;\n if (now > banEntry.nBanUntil) {\n m_banned.erase(it++);\n m_is_dirty = true;\n notifyUI = true;\n LogPrint(BCLog::NET, \"%s: Removed banned node ip\/subnet from banlist.dat: %s\\n\", __func__, subNet.ToString());\n } else\n ++it;\n }\n }\n \/\/ update UI\n if (notifyUI && m_client_interface) {\n m_client_interface->BannedListChanged();\n }\n}\n\nbool BanMan::BannedSetIsDirty()\n{\n LOCK(m_cs_banned);\n return m_is_dirty;\n}\n\nvoid BanMan::SetBannedSetDirty(bool dirty)\n{\n LOCK(m_cs_banned); \/\/reuse m_banned lock for the m_is_dirty flag\n m_is_dirty = dirty;\n}\n<|endoftext|>"} {"text":"<commit_before>\/*******************************************************************************\n* Copyright 2016 ROBOTIS 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\/* Authors: Taehoon Lim (Darby) *\/\n\n#include <ros\/ros.h>\n#include <sensor_msgs\/BatteryState.h>\n#include <sensor_msgs\/Imu.h>\n#include <sensor_msgs\/MagneticField.h>\n#include <sensor_msgs\/LaserScan.h>\n#include <diagnostic_msgs\/DiagnosticArray.h>\n#include <turtlebot3_msgs\/SensorState.h>\n#include <turtlebot3_msgs\/VersionInfo.h>\n\n#define SOFTWARE_VERSION \"1.0.0\"\n#define FIRMWARE_VERSION \"1.2.0\"\n#define HARDWARE_VERSION \"1.0.0\"\n\nros::Publisher tb3_diagnostics_pub;\ndiagnostic_msgs::DiagnosticArray tb3_diagnostics;\n\ndiagnostic_msgs::DiagnosticStatus imu_state;\ndiagnostic_msgs::DiagnosticStatus motor_state;\ndiagnostic_msgs::DiagnosticStatus LDS_state;\ndiagnostic_msgs::DiagnosticStatus battery_state;\ndiagnostic_msgs::DiagnosticStatus button_state;\n\nvoid setDiagnosisMsg(diagnostic_msgs::DiagnosticStatus *diag, uint8_t level, std::string name, std::string message, std::string hardware_id)\n{\n diag->level = level;\n diag->name = name;\n diag->message = message;\n diag->hardware_id = hardware_id;\n}\n\nvoid setIMUDiagnosis(uint8_t level, std::string message)\n{\n setDiagnosisMsg(&imu_state, level, \"IMU Sensor\", message, \"MPU9250\");\n}\n\nvoid setMotorDiagnosis(uint8_t level, std::string message)\n{\n setDiagnosisMsg(&motor_state, level, \"Actuator\", message, \"DYNAMIXEL X\");\n}\n\nvoid setBatteryDiagnosis(uint8_t level, std::string message)\n{\n setDiagnosisMsg(&battery_state, level, \"Power System\", message, \"Battery\");\n}\n\nvoid setLDSDiagnosis(uint8_t level, std::string message)\n{\n setDiagnosisMsg(&LDS_state, level, \"Lidar Sensor\", message, \"HLS-LFCD-LDS\");\n}\n\nvoid setButtonDiagnosis(uint8_t level, std::string message)\n{\n setDiagnosisMsg(&button_state, level, \"Analog Button\", message, \"OpenCR Button\");\n}\n\nvoid imuMsgCallback(const sensor_msgs::Imu::ConstPtr &msg)\n{\n setIMUDiagnosis(diagnostic_msgs::DiagnosticStatus::OK, \"Good Condition\");\n}\n\nvoid LDSMsgCallback(const sensor_msgs::LaserScan::ConstPtr &msg)\n{\n setLDSDiagnosis(diagnostic_msgs::DiagnosticStatus::OK, \"Good Condition\");\n}\n\nvoid sensorStateMsgCallback(const turtlebot3_msgs::SensorState::ConstPtr &msg)\n{\n if (msg->battery > 11.0)\n setBatteryDiagnosis(diagnostic_msgs::DiagnosticStatus::OK, \"Good Condition\");\n else\n setBatteryDiagnosis(diagnostic_msgs::DiagnosticStatus::WARN, \"Charge!!! Charge!!!\");\n\n if (msg->button == turtlebot3_msgs::SensorState::BUTTON0)\n setButtonDiagnosis(diagnostic_msgs::DiagnosticStatus::OK, \"BUTTON 0 IS PUSHED\");\n else if (msg->button == turtlebot3_msgs::SensorState::BUTTON1)\n setButtonDiagnosis(diagnostic_msgs::DiagnosticStatus::OK, \"BUTTON 1 IS PUSHED\");\n else\n setButtonDiagnosis(diagnostic_msgs::DiagnosticStatus::OK, \"Pushed Nothing\");\n\n if (msg->torque == true)\n setMotorDiagnosis(diagnostic_msgs::DiagnosticStatus::OK, \"Torque ON\");\n else\n setMotorDiagnosis(diagnostic_msgs::DiagnosticStatus::WARN, \"Torque OFF\");\n}\n\nvoid versionMsgCallback(const turtlebot3_msgs::VersionInfo::ConstPtr &msg)\n{\n static bool check_version = false;\n\n if (check_version == false)\n {\n if (std::string(msg->software) != std::string(SOFTWARE_VERSION))\n ROS_WARN(\"Check turtlebot3 repository and Update your software!!\");\n\n if (std::string(msg->hardware) != std::string(HARDWARE_VERSION))\n ROS_WARN(\"Check turtlebot3 wiki page and Update your hardware!!\");\n\n if (std::string(msg->firmware) != std::string(FIRMWARE_VERSION))\n ROS_WARN(\"Check OpenCR update and change your firmware!!\");\n\n check_version = true;\n }\n}\n\nvoid msgPub()\n{\n tb3_diagnostics.header.stamp = ros::Time::now();\n\n tb3_diagnostics.status.clear();\n tb3_diagnostics.status.push_back(imu_state);\n tb3_diagnostics.status.push_back(motor_state);\n tb3_diagnostics.status.push_back(LDS_state);\n tb3_diagnostics.status.push_back(battery_state);\n tb3_diagnostics.status.push_back(button_state);\n\n tb3_diagnostics_pub.publish(tb3_diagnostics);\n}\n\nint main(int argc, char **argv)\n{\n ros::init(argc, argv, \"turtlebot3_diagnostic\");\n ros::NodeHandle nh;\n\n tb3_diagnostics_pub = nh.advertise<diagnostic_msgs::DiagnosticArray>(\"diagnostics\", 10);\n\n ros::Subscriber imu = nh.subscribe(\"imu\", 10, imuMsgCallback);\n ros::Subscriber lds = nh.subscribe(\"scan\", 10, LDSMsgCallback);\n ros::Subscriber tb3_sensor = nh.subscribe(\"sensor_state\", 10, sensorStateMsgCallback);\n ros::Subscriber version = nh.subscribe(\"version_info\", 10, versionMsgCallback);\n\n ros::Rate loop_rate(1);\n\n while (ros::ok())\n {\n msgPub();\n ros::spinOnce();\n loop_rate.sleep();\n }\n\n return 0;\n}\n<commit_msg>update firmware version from 1.2.0 to 1.2.1<commit_after>\/*******************************************************************************\n* Copyright 2016 ROBOTIS 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\/* Authors: Taehoon Lim (Darby) *\/\n\n#include <ros\/ros.h>\n#include <sensor_msgs\/BatteryState.h>\n#include <sensor_msgs\/Imu.h>\n#include <sensor_msgs\/MagneticField.h>\n#include <sensor_msgs\/LaserScan.h>\n#include <diagnostic_msgs\/DiagnosticArray.h>\n#include <turtlebot3_msgs\/SensorState.h>\n#include <turtlebot3_msgs\/VersionInfo.h>\n\n#define SOFTWARE_VERSION \"1.0.0\"\n#define FIRMWARE_VERSION \"1.2.1\"\n#define HARDWARE_VERSION \"1.0.0\"\n\nros::Publisher tb3_diagnostics_pub;\ndiagnostic_msgs::DiagnosticArray tb3_diagnostics;\n\ndiagnostic_msgs::DiagnosticStatus imu_state;\ndiagnostic_msgs::DiagnosticStatus motor_state;\ndiagnostic_msgs::DiagnosticStatus LDS_state;\ndiagnostic_msgs::DiagnosticStatus battery_state;\ndiagnostic_msgs::DiagnosticStatus button_state;\n\nvoid setDiagnosisMsg(diagnostic_msgs::DiagnosticStatus *diag, uint8_t level, std::string name, std::string message, std::string hardware_id)\n{\n diag->level = level;\n diag->name = name;\n diag->message = message;\n diag->hardware_id = hardware_id;\n}\n\nvoid setIMUDiagnosis(uint8_t level, std::string message)\n{\n setDiagnosisMsg(&imu_state, level, \"IMU Sensor\", message, \"MPU9250\");\n}\n\nvoid setMotorDiagnosis(uint8_t level, std::string message)\n{\n setDiagnosisMsg(&motor_state, level, \"Actuator\", message, \"DYNAMIXEL X\");\n}\n\nvoid setBatteryDiagnosis(uint8_t level, std::string message)\n{\n setDiagnosisMsg(&battery_state, level, \"Power System\", message, \"Battery\");\n}\n\nvoid setLDSDiagnosis(uint8_t level, std::string message)\n{\n setDiagnosisMsg(&LDS_state, level, \"Lidar Sensor\", message, \"HLS-LFCD-LDS\");\n}\n\nvoid setButtonDiagnosis(uint8_t level, std::string message)\n{\n setDiagnosisMsg(&button_state, level, \"Analog Button\", message, \"OpenCR Button\");\n}\n\nvoid imuMsgCallback(const sensor_msgs::Imu::ConstPtr &msg)\n{\n setIMUDiagnosis(diagnostic_msgs::DiagnosticStatus::OK, \"Good Condition\");\n}\n\nvoid LDSMsgCallback(const sensor_msgs::LaserScan::ConstPtr &msg)\n{\n setLDSDiagnosis(diagnostic_msgs::DiagnosticStatus::OK, \"Good Condition\");\n}\n\nvoid sensorStateMsgCallback(const turtlebot3_msgs::SensorState::ConstPtr &msg)\n{\n if (msg->battery > 11.0)\n setBatteryDiagnosis(diagnostic_msgs::DiagnosticStatus::OK, \"Good Condition\");\n else\n setBatteryDiagnosis(diagnostic_msgs::DiagnosticStatus::WARN, \"Charge!!! Charge!!!\");\n\n if (msg->button == turtlebot3_msgs::SensorState::BUTTON0)\n setButtonDiagnosis(diagnostic_msgs::DiagnosticStatus::OK, \"BUTTON 0 IS PUSHED\");\n else if (msg->button == turtlebot3_msgs::SensorState::BUTTON1)\n setButtonDiagnosis(diagnostic_msgs::DiagnosticStatus::OK, \"BUTTON 1 IS PUSHED\");\n else\n setButtonDiagnosis(diagnostic_msgs::DiagnosticStatus::OK, \"Pushed Nothing\");\n\n if (msg->torque == true)\n setMotorDiagnosis(diagnostic_msgs::DiagnosticStatus::OK, \"Torque ON\");\n else\n setMotorDiagnosis(diagnostic_msgs::DiagnosticStatus::WARN, \"Torque OFF\");\n}\n\nvoid versionMsgCallback(const turtlebot3_msgs::VersionInfo::ConstPtr &msg)\n{\n static bool check_version = false;\n\n if (check_version == false)\n {\n if (std::string(msg->software) != std::string(SOFTWARE_VERSION))\n ROS_WARN(\"Check turtlebot3 repository and Update your software!!\");\n\n if (std::string(msg->hardware) != std::string(HARDWARE_VERSION))\n ROS_WARN(\"Check turtlebot3 wiki page and Update your hardware!!\");\n\n if (std::string(msg->firmware) != std::string(FIRMWARE_VERSION))\n ROS_WARN(\"Check OpenCR update and change your firmware!!\");\n\n check_version = true;\n }\n}\n\nvoid msgPub()\n{\n tb3_diagnostics.header.stamp = ros::Time::now();\n\n tb3_diagnostics.status.clear();\n tb3_diagnostics.status.push_back(imu_state);\n tb3_diagnostics.status.push_back(motor_state);\n tb3_diagnostics.status.push_back(LDS_state);\n tb3_diagnostics.status.push_back(battery_state);\n tb3_diagnostics.status.push_back(button_state);\n\n tb3_diagnostics_pub.publish(tb3_diagnostics);\n}\n\nint main(int argc, char **argv)\n{\n ros::init(argc, argv, \"turtlebot3_diagnostic\");\n ros::NodeHandle nh;\n\n tb3_diagnostics_pub = nh.advertise<diagnostic_msgs::DiagnosticArray>(\"diagnostics\", 10);\n\n ros::Subscriber imu = nh.subscribe(\"imu\", 10, imuMsgCallback);\n ros::Subscriber lds = nh.subscribe(\"scan\", 10, LDSMsgCallback);\n ros::Subscriber tb3_sensor = nh.subscribe(\"sensor_state\", 10, sensorStateMsgCallback);\n ros::Subscriber version = nh.subscribe(\"version_info\", 10, versionMsgCallback);\n\n ros::Rate loop_rate(1);\n\n while (ros::ok())\n {\n msgPub();\n ros::spinOnce();\n loop_rate.sleep();\n }\n\n return 0;\n}\n<|endoftext|>"} {"text":"<commit_before>#include \"extend.hpp\"\n#include \"context.hpp\"\n#include \"contextualize.hpp\"\n#include \"to_string.hpp\"\n#include \"backtrace.hpp\"\n#include <iostream>\n\nnamespace Sass {\n\n Extend::Extend(Context& ctx, multimap<Compound_Selector, Complex_Selector*>& extensions, Subset_Map<string, pair<Complex_Selector*, Compound_Selector*> >& ssm, Backtrace* bt)\n : ctx(ctx), extensions(extensions), subset_map(ssm), backtrace(bt)\n { }\n\n void Extend::operator()(Block* b)\n {\n for (size_t i = 0, L = b->length(); i < L; ++i) {\n (*b)[i]->perform(this);\n }\n }\n\n void Extend::operator()(Ruleset* r)\n {\n Selector_List* sg = static_cast<Selector_List*>(r->selector());\n Selector_List* ng = 0;\n bool extended = false;\n if (sg->has_placeholder()) {\n \/\/ To_String to_string;\n Compound_Selector* placeholder = new (ctx.mem) Compound_Selector(sg->path(), sg->line(), 1);\n *placeholder << sg->find_placeholder();\n \/\/ cerr << \"placeholder: \" << placeholder->perform(&to_string) << endl;\n \/\/ if the placeholder needs to be subbed\n if (extensions.count(*placeholder)) {\n \/\/ cerr << \"need to sub \" << placeholder->perform(&to_string) << \" \" << extensions.count(*placeholder) << \" times\" << endl;\n \/\/ perform each substitution and append it to the selector group of the ruleset\n ng = new (ctx.mem) Selector_List(sg->path(), sg->line(), extensions.count(*placeholder));\n for (multimap<Compound_Selector, Complex_Selector*>::iterator extender = extensions.lower_bound(*placeholder), E = extensions.upper_bound(*placeholder);\n extender != E;\n ++extender) {\n \/\/ cerr << \"performing a substitution: \" << placeholder->perform(&to_string) << \" -> \" << extender->second->perform(&to_string) << endl;\n Contextualize sub_plc(ctx, 0, 0, backtrace, placeholder, extender->second);\n Selector_List* subbed = static_cast<Selector_List*>(sg->perform(&sub_plc));\n \/\/ if (subbed) cerr << \"subbed: \" << subbed->perform(&to_string) << endl;\n *ng += subbed;\n extended = true;\n }\n ng->has_placeholder(false);\n }\n \/\/ otherwise prevent it from rendering\n else {\n \/\/ r->selector(0);\n }\n }\n else {\n To_String to_string;\n ng = new (ctx.mem) Selector_List(sg->path(), sg->line(), sg->length());\n \/\/ for each selector in the group\n for (size_t i = 0, L = sg->length(); i < L; ++i) {\n Complex_Selector* sel = (*sg)[i];\n *ng << sel;\n \/\/ if it's supposed to be extended\n Compound_Selector* sel_base = sel->base();\n if (sel_base && extensions.count(*sel_base)) {\n \/\/ extend it wrt each of its extenders\n for (multimap<Compound_Selector, Complex_Selector*>::iterator extender = extensions.lower_bound(*sel_base), E = extensions.upper_bound(*sel_base);\n extender != E;\n ++extender) {\n *ng += generate_extension(sel, extender->second);\n extended = true;\n }\n }\n }\n }\n if (extended) r->selector(ng);\n\n \/\/ let's try the new stuff here; eventually it should replace the preceding\n set<Compound_Selector> seen;\n Selector_List* new_list = new (ctx.mem) Selector_List(sg->path(), sg->line());\n for (size_t i = 0, L = sg->length(); i < L; ++i)\n {\n *new_list += extend_complex((*sg)[i], seen);\n }\n\n r->block()->perform(this);\n }\n\n void Extend::operator()(Media_Block* m)\n {\n m->block()->perform(this);\n }\n\n void Extend::operator()(At_Rule* a)\n {\n if (a->block()) a->block()->perform(this);\n }\n\n Selector_List* Extend::generate_extension(Complex_Selector* extendee, Complex_Selector* extender)\n {\n To_String to_string;\n Selector_List* new_group = new (ctx.mem) Selector_List(extendee->path(), extendee->line());\n Complex_Selector* extendee_context = extendee->context(ctx);\n Complex_Selector* extender_context = extender->context(ctx);\n if (extendee_context && extender_context) {\n Complex_Selector* base = new (ctx.mem) Complex_Selector(new_group->path(), new_group->line(), Complex_Selector::ANCESTOR_OF, extender->base(), 0);\n extendee_context->innermost()->tail(extender);\n *new_group << extendee_context;\n \/\/ make another one so we don't erroneously share tails\n extendee_context = extendee->context(ctx);\n extendee_context->innermost()->tail(base);\n extender_context->innermost()->tail(extendee_context);\n *new_group << extender_context;\n }\n else if (extendee_context) {\n extendee_context->innermost()->tail(extender);\n *new_group << extendee_context;\n }\n else if (extender_context) {\n *new_group << extender;\n }\n else {\n *new_group << extender;\n }\n return new_group;\n }\n\n Selector_List* Extend::extend_complex(Complex_Selector* sel, set<Compound_Selector>& seen)\n {\n To_String to_string;\n cerr << \"EXTENDING COMPLEX: \" << sel->perform(&to_string) << endl;\n Selector_List* choices = new (ctx.mem) Selector_List(sel->path(), sel->line());\n Selector_List* extended;\n\n Compound_Selector* h = sel->head();\n Complex_Selector* t = sel->tail();\n if (h && !h->is_empty_reference())\n {\n Selector_List* extended = extend_compound(h, seen);\n \/\/ TODO: check extended for something or other\n *choices += extended;\n }\n while(t)\n {\n h = t->head();\n t = t->tail();\n if (h && !h->is_empty_reference())\n {\n Selector_List* extended = extend_compound(h, seen);\n \/\/ TODO: check extended for something or other\n *choices += extended;\n }\n }\n\n return choices;\n }\n\n Selector_List* Extend::extend_compound(Compound_Selector* sel, set<Compound_Selector>& seen)\n {\n To_String to_string;\n cerr << \"EXTENDING COMPOUND: \" << sel->perform(&to_string) << endl;\n return new (ctx.mem) Selector_List(sel->path(), sel->line());\n }\n\n}<commit_msg>tweaking the log output<commit_after>#include \"extend.hpp\"\n#include \"context.hpp\"\n#include \"contextualize.hpp\"\n#include \"to_string.hpp\"\n#include \"backtrace.hpp\"\n#include <iostream>\n\nnamespace Sass {\n\n Extend::Extend(Context& ctx, multimap<Compound_Selector, Complex_Selector*>& extensions, Subset_Map<string, pair<Complex_Selector*, Compound_Selector*> >& ssm, Backtrace* bt)\n : ctx(ctx), extensions(extensions), subset_map(ssm), backtrace(bt)\n { }\n\n void Extend::operator()(Block* b)\n {\n for (size_t i = 0, L = b->length(); i < L; ++i) {\n (*b)[i]->perform(this);\n }\n }\n\n void Extend::operator()(Ruleset* r)\n {\n Selector_List* sg = static_cast<Selector_List*>(r->selector());\n Selector_List* ng = 0;\n bool extended = false;\n if (sg->has_placeholder()) {\n \/\/ To_String to_string;\n Compound_Selector* placeholder = new (ctx.mem) Compound_Selector(sg->path(), sg->line(), 1);\n *placeholder << sg->find_placeholder();\n \/\/ cerr << \"placeholder: \" << placeholder->perform(&to_string) << endl;\n \/\/ if the placeholder needs to be subbed\n if (extensions.count(*placeholder)) {\n \/\/ cerr << \"need to sub \" << placeholder->perform(&to_string) << \" \" << extensions.count(*placeholder) << \" times\" << endl;\n \/\/ perform each substitution and append it to the selector group of the ruleset\n ng = new (ctx.mem) Selector_List(sg->path(), sg->line(), extensions.count(*placeholder));\n for (multimap<Compound_Selector, Complex_Selector*>::iterator extender = extensions.lower_bound(*placeholder), E = extensions.upper_bound(*placeholder);\n extender != E;\n ++extender) {\n \/\/ cerr << \"performing a substitution: \" << placeholder->perform(&to_string) << \" -> \" << extender->second->perform(&to_string) << endl;\n Contextualize sub_plc(ctx, 0, 0, backtrace, placeholder, extender->second);\n Selector_List* subbed = static_cast<Selector_List*>(sg->perform(&sub_plc));\n \/\/ if (subbed) cerr << \"subbed: \" << subbed->perform(&to_string) << endl;\n *ng += subbed;\n extended = true;\n }\n ng->has_placeholder(false);\n }\n \/\/ otherwise prevent it from rendering\n else {\n \/\/ r->selector(0);\n }\n }\n else {\n To_String to_string;\n ng = new (ctx.mem) Selector_List(sg->path(), sg->line(), sg->length());\n \/\/ for each selector in the group\n for (size_t i = 0, L = sg->length(); i < L; ++i) {\n Complex_Selector* sel = (*sg)[i];\n *ng << sel;\n \/\/ if it's supposed to be extended\n Compound_Selector* sel_base = sel->base();\n if (sel_base && extensions.count(*sel_base)) {\n \/\/ extend it wrt each of its extenders\n for (multimap<Compound_Selector, Complex_Selector*>::iterator extender = extensions.lower_bound(*sel_base), E = extensions.upper_bound(*sel_base);\n extender != E;\n ++extender) {\n *ng += generate_extension(sel, extender->second);\n extended = true;\n }\n }\n }\n }\n if (extended) r->selector(ng);\n\n \/\/ let's try the new stuff here; eventually it should replace the preceding\n set<Compound_Selector> seen;\n Selector_List* new_list = new (ctx.mem) Selector_List(sg->path(), sg->line());\n for (size_t i = 0, L = sg->length(); i < L; ++i)\n {\n *new_list += extend_complex((*sg)[i], seen);\n }\n\n r->block()->perform(this);\n }\n\n void Extend::operator()(Media_Block* m)\n {\n m->block()->perform(this);\n }\n\n void Extend::operator()(At_Rule* a)\n {\n if (a->block()) a->block()->perform(this);\n }\n\n Selector_List* Extend::generate_extension(Complex_Selector* extendee, Complex_Selector* extender)\n {\n To_String to_string;\n Selector_List* new_group = new (ctx.mem) Selector_List(extendee->path(), extendee->line());\n Complex_Selector* extendee_context = extendee->context(ctx);\n Complex_Selector* extender_context = extender->context(ctx);\n if (extendee_context && extender_context) {\n Complex_Selector* base = new (ctx.mem) Complex_Selector(new_group->path(), new_group->line(), Complex_Selector::ANCESTOR_OF, extender->base(), 0);\n extendee_context->innermost()->tail(extender);\n *new_group << extendee_context;\n \/\/ make another one so we don't erroneously share tails\n extendee_context = extendee->context(ctx);\n extendee_context->innermost()->tail(base);\n extender_context->innermost()->tail(extendee_context);\n *new_group << extender_context;\n }\n else if (extendee_context) {\n extendee_context->innermost()->tail(extender);\n *new_group << extendee_context;\n }\n else if (extender_context) {\n *new_group << extender;\n }\n else {\n *new_group << extender;\n }\n return new_group;\n }\n\n Selector_List* Extend::extend_complex(Complex_Selector* sel, set<Compound_Selector>& seen)\n {\n To_String to_string;\n cerr << \"EXTENDING COMPLEX: \" << sel->perform(&to_string) << endl;\n Selector_List* choices = new (ctx.mem) Selector_List(sel->path(), sel->line());\n\n Compound_Selector* h = sel->head();\n Complex_Selector* t = sel->tail();\n if (h && !h->is_empty_reference())\n {\n Selector_List* extended = extend_compound(h, seen);\n \/\/ TODO: check extended for something or other\n *choices += extended;\n }\n while(t)\n {\n h = t->head();\n t = t->tail();\n if (h && !h->is_empty_reference())\n {\n Selector_List* extended = extend_compound(h, seen);\n \/\/ TODO: check extended for something or other\n *choices += extended;\n }\n }\n\n return choices;\n }\n\n Selector_List* Extend::extend_compound(Compound_Selector* sel, set<Compound_Selector>& seen)\n {\n To_String to_string;\n Selector_List* results = new (ctx.mem) Selector_List(sel->path(), sel->line());\n\n vector<pair<Complex_Selector*, Compound_Selector*> > entries = subset_map.get_v(sel->to_str_vec());\n\n for (size_t i = 0, S = entries.size(); i < S; ++i)\n {\n cerr << \"COMPOUND: \" << sel->perform(&to_string) << \" KEYS TO \" << entries[i].first->perform(&to_string) << \" AND \" << entries[i].second->perform(&to_string) << endl;\n }\n\n return results;\n }\n\n}<|endoftext|>"} {"text":"<commit_before>#include <limits>\n#include <iostream>\n#include <iomanip>\n#include <unistd.h>\n#include <algorithm>\n\n#include \"libpstack\/util.h\"\n#include \"libpstack\/elf.h\"\n#ifdef WITH_ZLIB\n#include \"libpstack\/inflatereader.h\"\n#endif\n#ifdef WITH_LZMA\n#include \"libpstack\/lzmareader.h\"\n#endif\n\nusing std::string;\nusing std::make_shared;\nusing std::shared_ptr;\n\nstd::ostream *debug = &std::clog;\nint verbose = 0;\nstatic uint32_t elf_hash(string);\nbool noDebugLibs;\n\nGlobalDebugDirectories globalDebugDirectories;\nGlobalDebugDirectories::GlobalDebugDirectories()\n{\n add(\"\/usr\/lib\/debug\");\n add(\"\/usr\/lib\/debug\/usr\"); \/\/ Add as a hack for when linker loads from \/lib, but package has \/usr\/lib\n}\n\nvoid\nGlobalDebugDirectories::add(const std::string &str)\n{\n dirs.push_back(str);\n}\n\nElfNoteIter\nElfNotes::begin() const\n{\n return ElfNoteIter(object, true);\n}\n\nElfNoteIter\nElfNotes::end() const\n{\n return ElfNoteIter(object, false);\n}\n\nstd::string\nElfNoteDesc::name() const\n{\n return io->readString(sizeof note);\n}\n\nstd::shared_ptr<const Reader>\nElfNoteDesc::data() const\n{\n return std::make_shared<OffsetReader>(io, sizeof note + roundup2(note.n_namesz, 4), note.n_descsz);\n}\n\nsize_t\nElfNoteDesc::size() const\n{\n return note.n_descsz;\n}\n\nElfObject::ElfObject(ImageCache &cache, shared_ptr<const Reader> io_)\n : notes(this)\n , imageCache(cache)\n{\n debugLoaded = false;\n io = io_;\n int i;\n size_t off;\n io->readObj(0, &elfHeader);\n\n \/* Validate the ELF header *\/\n if (!IS_ELF(elfHeader) || elfHeader.e_ident[EI_VERSION] != EV_CURRENT)\n throw Exception() << *io << \": content is not an ELF image\";\n\n for (off = elfHeader.e_phoff, i = 0; i < elfHeader.e_phnum; i++) {\n Elf_Phdr hdr;\n io->readObj(off, &hdr);\n programHeaders[hdr.p_type].push_back(hdr);\n off += elfHeader.e_phentsize;\n }\n\n sectionHeaders.resize(elfHeader.e_shnum);\n for (off = elfHeader.e_shoff, i = 0; i < elfHeader.e_shnum; i++) {\n sectionHeaders[i].open(io, off);\n off += elfHeader.e_shentsize;\n }\n\n if (elfHeader.e_shstrndx != SHN_UNDEF) {\n auto &sshdr = sectionHeaders[elfHeader.e_shstrndx];\n for (auto &h : sectionHeaders) {\n auto name = sshdr.io->readString(h.shdr.sh_name);\n namedSection[name] = &h;\n \/\/ .gnu_debugdata is a separate LZMA-compressed ELF image with just\n \/\/ a symbol table.\n if (name == \".gnu_debugdata\")\n#ifdef WITH_LZMA\n debugData = std::make_shared<ElfObject>(imageCache,\n std::make_shared<const LzmaReader>(h.io));\n#else\n std::clog << \"warning: no compiled support for LZMA - \"\n \"can't decode debug data in \" << *io << \"\\n\";\n#endif\n }\n auto &tab = getSection(\".hash\", SHT_HASH);\n auto &syms = getSection(tab.shdr.sh_link);\n auto &strings = getSection(syms.shdr.sh_link);\n if (tab && syms && strings)\n hash.reset(new ElfSymHash(tab.io, syms.io, strings.io));\n } else {\n hash = 0;\n }\n}\n\nconst Elf_Phdr *\nElfObject::getSegmentForAddress(Elf_Off a) const\n{\n for (const auto &hdr : getSegments(PT_LOAD))\n if (hdr.p_vaddr <= a && hdr.p_vaddr + hdr.p_memsz > a)\n return &hdr;\n return 0;\n}\n\nconst ElfObject::ProgramHeaders &\nElfObject::getSegments(Elf_Word type) const\n{\n auto it = programHeaders.find(type);\n if (it == programHeaders.end()) {\n static const ProgramHeaders empty;\n return empty;\n }\n return it->second;\n}\n\nElf_Addr\nElfObject::getBase() const\n{\n auto base = std::numeric_limits<Elf_Off>::max();\n auto &segments = getSegments(PT_LOAD);\n for (auto &seg : segments)\n if (Elf_Off(seg.p_vaddr) <= base)\n base = Elf_Off(seg.p_vaddr);\n return base;\n}\n\nstd::string\nElfObject::getInterpreter() const\n{\n for (auto &seg : getSegments(PT_INTERP))\n return io->readString(seg.p_offset);\n return \"\";\n}\n\nstd::pair<const Elf_Sym, const string>\nSymbolIterator::operator *()\n{\n Elf_Sym sym;\n sec->symbols->readObj(off, &sym);\n string name = sec->strings->readString(sym.st_name);\n return std::make_pair(sym, name);\n}\n\n\/*\n * Find the symbol that represents a particular address.\n *\/\nbool\nElfObject::findSymbolByAddress(Elf_Addr addr, int type, Elf_Sym &sym, string &name)\n{\n \/* Try to find symbols in these sections *\/\n for (auto secname : { \".symtab\", \".dynsym\" }) {\n const auto &symSection = getSection(secname, SHT_NULL);\n if (symSection.shdr.sh_type == SHT_NOBITS)\n continue;\n SymbolSection syms(symSection.io, getSection(symSection.shdr.sh_link).io);\n for (auto syminfo : syms) {\n auto &candidate = syminfo.first;\n if (candidate.st_shndx >= sectionHeaders.size())\n continue;\n if (type != STT_NOTYPE && ELF_ST_TYPE(candidate.st_info) != type)\n continue;\n if (candidate.st_value > addr)\n continue;\n if (candidate.st_size + candidate.st_value <= addr)\n continue;\n auto &sec = sectionHeaders[candidate.st_shndx];\n if (!(sec.shdr.sh_flags & SHF_ALLOC))\n continue;\n sym = candidate;\n name = syminfo.second;\n return true;\n }\n }\n if (debugData)\n return debugData->findSymbolByAddress(addr, type, sym, name);\n return false;;\n}\n\nconst ElfSection &\nElfObject::getSection(const std::string &name, Elf_Word type) const\n{\n auto s = namedSection.find(name);\n if (s == namedSection.end() || (s->second->shdr.sh_type != type && type != SHT_NULL))\n return sectionHeaders[0];\n return *s->second;\n}\n\nconst ElfSection &\nElfObject::getSection(Elf_Word idx) const\n{\n return sectionHeaders[idx];\n}\n\nSymbolSection\nElfObject::getSymbols(const std::string &tableName)\n{\n ElfObject *elf = debugData ? debugData.get() : this;\n auto &table = elf->getSection(tableName, SHT_NULL);\n auto &strings = elf->getSection(table.shdr.sh_link);\n return SymbolSection(table.io, strings.io);\n}\n\nbool\nSymbolSection::linearSearch(const string &name, Elf_Sym &sym)\n{\n for (const auto &info : *this) {\n if (name == info.second) {\n sym = info.first;\n return true;\n }\n }\n return false;\n}\n\nElfSymHash::ElfSymHash(std::shared_ptr<const Reader> hash_,\n std::shared_ptr<const Reader> syms_, std::shared_ptr<const Reader> strings_)\n : hash(hash_)\n , syms(syms_)\n , strings(strings_)\n{\n \/\/ read the hash table into local memory.\n size_t words = hash->size() \/ sizeof (Elf_Word);\n data.resize(words);\n hash->readObj(0, &data[0], words);\n nbucket = data[0];\n nchain = data[1];\n buckets = &data[0] + 2;\n chains = buckets + nbucket;\n}\n\nbool\nElfSymHash::findSymbol(Elf_Sym &sym, const string &name)\n{\n uint32_t bucket = elf_hash(name) % nbucket;\n for (Elf_Word i = buckets[bucket]; i != STN_UNDEF; i = chains[i]) {\n Elf_Sym candidate;\n syms->readObj(i * sizeof candidate, &candidate);\n string candidateName = strings->readString(candidate.st_name);\n if (candidateName == name) {\n sym = candidate;\n return true;\n }\n }\n return false;\n}\n\n\/*\n * Locate a named symbol in an ELF image.\n *\/\nbool\nElfObject::findSymbolByName(const string &name, Elf_Sym &sym)\n{\n if (debugData)\n return debugData->findSymbolByName(name, sym);\n\n if (hash && hash->findSymbol(sym, name))\n return true;\n\n for (const char *sec : { \".dynsym\", \".symtab\" }) {\n SymbolSection sect = getSymbols(sec);\n if (sect.linearSearch(name, sym))\n return true;\n }\n return false;\n}\n\nElfObject::~ElfObject()\n{\n}\n\nstd::shared_ptr<ElfObject>\nElfObject::getDebug(std::shared_ptr<ElfObject> &in)\n{\n if (noDebugLibs)\n return in;\n\n if (!in->debugLoaded) {\n in->debugLoaded = true;\n auto &hdr = in->getSection(\".gnu_debuglink\", SHT_PROGBITS);\n auto link = hdr.io->readString(0);\n auto dir = dirname(stringify(*in->io));\n in->debugObject = in->imageCache.getDebugImage(dir + \"\/\" + link);\n\n if (!in->debugObject) {\n for (auto note : in->notes) {\n if (note.name() == \"GNU\" && note.type() == GNU_BUILD_ID) {\n std::ostringstream dir;\n dir << \".build-id\/\";\n size_t i;\n auto io = note.data();\n std::vector<unsigned char> data(io->size());\n io->readObj(0, &data[0], io->size());\n dir << std::hex << std::setw(2) << std::setfill('0') << int(data[0]);\n dir << \"\/\";\n for (i = 1; i < note.size(); ++i)\n dir << std::setw(2) << int(data[i]);\n dir << \".debug\";\n in->debugObject = in->imageCache.getDebugImage(dir.str());\n break;\n }\n }\n }\n if (in->debugObject && verbose >= 2)\n *debug << \"found debug object \" << *in->debugObject->io << \" for \" << *in->io << \"\\n\";\n }\n return in->debugObject ? in->debugObject : in;\n}\n\n\/*\n * Culled from System V Application Binary Interface\n *\/\nstatic uint32_t\nelf_hash(string name)\n{\n uint32_t h = 0, g;\n for (auto c : name) {\n h = (h << 4) + c;\n if ((g = h & 0xf0000000) != 0)\n h ^= g >> 24;\n h &= ~g;\n }\n return (h);\n}\n\n\nvoid\nElfSection::open(const std::shared_ptr<const Reader> &image, off_t off)\n{\n image->readObj(off, &shdr);\n auto rawIo = std::make_shared<OffsetReader>(image, shdr.sh_offset, shdr.sh_size);\n if ((shdr.sh_flags & SHF_COMPRESSED) == 0) {\n io = rawIo;\n } else {\n\n#ifdef WITH_ZLIB\n Elf_Chdr chdr;\n rawIo->readObj(0, &chdr);\n io = std::make_shared<InflateReader>(chdr.ch_size,\n std::make_shared<OffsetReader>(rawIo,\n sizeof chdr, shdr.sh_size - sizeof chdr));\n#else\n static bool warned = false;\n if (!warned) {\n warned = true;\n std::clog <<\"warning: no support configured for compressed debug info in \" << *image << std::endl;\n }\n io = std::make_shared<NullReader>();\n#endif\n }\n}\n\nstd::shared_ptr<ElfObject>\nImageCache::getImageForName(const std::string &name) {\n bool found;\n auto res = getImageIfLoaded(name, found);\n if (found)\n return res;\n auto &item = cache[name];\n item = std::make_shared<ElfObject>(*this, loadFile(name));\n return item;\n}\n\nImageCache::ImageCache() : elfHits(0), elfLookups(0) {}\nImageCache::~ImageCache() {\n if (verbose >= 2) {\n *debug << \"ELF image cache: lookups: \" << elfLookups << \", hits=\" << elfHits << std::endl;\n for (auto &items : cache) {\n if (items.second)\n *debug << \"\\t\" << *items.second->io << std::endl;\n else\n *debug << \"\\t\" << \"NEGATIVE: \" << items.first << std::endl;\n }\n }\n}\n\nstd::shared_ptr<ElfObject>\nImageCache::getImageIfLoaded(const std::string &name, bool &found)\n{\n elfLookups++;\n auto it = cache.find(name);\n if (it != cache.end()) {\n elfHits++;\n found = true;\n return it->second;\n }\n found = false;\n return std::shared_ptr<ElfObject>();\n}\n\nstd::shared_ptr<ElfObject>\nImageCache::getDebugImage(const std::string &name) {\n \/\/ XXX: verify checksum.\n for (auto dir : globalDebugDirectories.dirs) {\n bool found;\n auto img = getImageIfLoaded(dir + \"\/\" + name, found);\n if (found)\n return img;\n }\n for (auto dir : globalDebugDirectories.dirs) {\n try {\n return getImageForName(dir + \"\/\" + name);\n }\n catch (const std::exception &ex) {\n continue;\n }\n }\n return std::shared_ptr<ElfObject>();\n}\n<commit_msg>only warn about lzma being missing once.<commit_after>#include <limits>\n#include <iostream>\n#include <iomanip>\n#include <unistd.h>\n#include <algorithm>\n\n#include \"libpstack\/util.h\"\n#include \"libpstack\/elf.h\"\n#ifdef WITH_ZLIB\n#include \"libpstack\/inflatereader.h\"\n#endif\n#ifdef WITH_LZMA\n#include \"libpstack\/lzmareader.h\"\n#endif\n\nusing std::string;\nusing std::make_shared;\nusing std::shared_ptr;\n\nstd::ostream *debug = &std::clog;\nint verbose = 0;\nstatic uint32_t elf_hash(string);\nbool noDebugLibs;\n\nGlobalDebugDirectories globalDebugDirectories;\nGlobalDebugDirectories::GlobalDebugDirectories()\n{\n add(\"\/usr\/lib\/debug\");\n add(\"\/usr\/lib\/debug\/usr\"); \/\/ Add as a hack for when linker loads from \/lib, but package has \/usr\/lib\n}\n\nvoid\nGlobalDebugDirectories::add(const std::string &str)\n{\n dirs.push_back(str);\n}\n\nElfNoteIter\nElfNotes::begin() const\n{\n return ElfNoteIter(object, true);\n}\n\nElfNoteIter\nElfNotes::end() const\n{\n return ElfNoteIter(object, false);\n}\n\nstd::string\nElfNoteDesc::name() const\n{\n return io->readString(sizeof note);\n}\n\nstd::shared_ptr<const Reader>\nElfNoteDesc::data() const\n{\n return std::make_shared<OffsetReader>(io, sizeof note + roundup2(note.n_namesz, 4), note.n_descsz);\n}\n\nsize_t\nElfNoteDesc::size() const\n{\n return note.n_descsz;\n}\n\nElfObject::ElfObject(ImageCache &cache, shared_ptr<const Reader> io_)\n : notes(this)\n , imageCache(cache)\n{\n debugLoaded = false;\n io = io_;\n int i;\n size_t off;\n io->readObj(0, &elfHeader);\n\n \/* Validate the ELF header *\/\n if (!IS_ELF(elfHeader) || elfHeader.e_ident[EI_VERSION] != EV_CURRENT)\n throw Exception() << *io << \": content is not an ELF image\";\n\n for (off = elfHeader.e_phoff, i = 0; i < elfHeader.e_phnum; i++) {\n Elf_Phdr hdr;\n io->readObj(off, &hdr);\n programHeaders[hdr.p_type].push_back(hdr);\n off += elfHeader.e_phentsize;\n }\n\n sectionHeaders.resize(elfHeader.e_shnum);\n for (off = elfHeader.e_shoff, i = 0; i < elfHeader.e_shnum; i++) {\n sectionHeaders[i].open(io, off);\n off += elfHeader.e_shentsize;\n }\n\n if (elfHeader.e_shstrndx != SHN_UNDEF) {\n auto &sshdr = sectionHeaders[elfHeader.e_shstrndx];\n for (auto &h : sectionHeaders) {\n auto name = sshdr.io->readString(h.shdr.sh_name);\n namedSection[name] = &h;\n \/\/ .gnu_debugdata is a separate LZMA-compressed ELF image with just\n \/\/ a symbol table.\n if (name == \".gnu_debugdata\") {\n#ifdef WITH_LZMA\n debugData = std::make_shared<ElfObject>(imageCache,\n std::make_shared<const LzmaReader>(h.io));\n#else\n static bool warned = false;\n if (!warned) {\n std::clog << \"warning: no compiled support for LZMA - \"\n \"can't decode debug data in \" << *io << \"\\n\";\n warned = true;\n }\n#endif\n }\n }\n auto &tab = getSection(\".hash\", SHT_HASH);\n auto &syms = getSection(tab.shdr.sh_link);\n auto &strings = getSection(syms.shdr.sh_link);\n if (tab && syms && strings)\n hash.reset(new ElfSymHash(tab.io, syms.io, strings.io));\n } else {\n hash = 0;\n }\n}\n\nconst Elf_Phdr *\nElfObject::getSegmentForAddress(Elf_Off a) const\n{\n for (const auto &hdr : getSegments(PT_LOAD))\n if (hdr.p_vaddr <= a && hdr.p_vaddr + hdr.p_memsz > a)\n return &hdr;\n return 0;\n}\n\nconst ElfObject::ProgramHeaders &\nElfObject::getSegments(Elf_Word type) const\n{\n auto it = programHeaders.find(type);\n if (it == programHeaders.end()) {\n static const ProgramHeaders empty;\n return empty;\n }\n return it->second;\n}\n\nElf_Addr\nElfObject::getBase() const\n{\n auto base = std::numeric_limits<Elf_Off>::max();\n auto &segments = getSegments(PT_LOAD);\n for (auto &seg : segments)\n if (Elf_Off(seg.p_vaddr) <= base)\n base = Elf_Off(seg.p_vaddr);\n return base;\n}\n\nstd::string\nElfObject::getInterpreter() const\n{\n for (auto &seg : getSegments(PT_INTERP))\n return io->readString(seg.p_offset);\n return \"\";\n}\n\nstd::pair<const Elf_Sym, const string>\nSymbolIterator::operator *()\n{\n Elf_Sym sym;\n sec->symbols->readObj(off, &sym);\n string name = sec->strings->readString(sym.st_name);\n return std::make_pair(sym, name);\n}\n\n\/*\n * Find the symbol that represents a particular address.\n *\/\nbool\nElfObject::findSymbolByAddress(Elf_Addr addr, int type, Elf_Sym &sym, string &name)\n{\n \/* Try to find symbols in these sections *\/\n for (auto secname : { \".symtab\", \".dynsym\" }) {\n const auto &symSection = getSection(secname, SHT_NULL);\n if (symSection.shdr.sh_type == SHT_NOBITS)\n continue;\n SymbolSection syms(symSection.io, getSection(symSection.shdr.sh_link).io);\n for (auto syminfo : syms) {\n auto &candidate = syminfo.first;\n if (candidate.st_shndx >= sectionHeaders.size())\n continue;\n if (type != STT_NOTYPE && ELF_ST_TYPE(candidate.st_info) != type)\n continue;\n if (candidate.st_value > addr)\n continue;\n if (candidate.st_size + candidate.st_value <= addr)\n continue;\n auto &sec = sectionHeaders[candidate.st_shndx];\n if (!(sec.shdr.sh_flags & SHF_ALLOC))\n continue;\n sym = candidate;\n name = syminfo.second;\n return true;\n }\n }\n if (debugData)\n return debugData->findSymbolByAddress(addr, type, sym, name);\n return false;;\n}\n\nconst ElfSection &\nElfObject::getSection(const std::string &name, Elf_Word type) const\n{\n auto s = namedSection.find(name);\n if (s == namedSection.end() || (s->second->shdr.sh_type != type && type != SHT_NULL))\n return sectionHeaders[0];\n return *s->second;\n}\n\nconst ElfSection &\nElfObject::getSection(Elf_Word idx) const\n{\n return sectionHeaders[idx];\n}\n\nSymbolSection\nElfObject::getSymbols(const std::string &tableName)\n{\n ElfObject *elf = debugData ? debugData.get() : this;\n auto &table = elf->getSection(tableName, SHT_NULL);\n auto &strings = elf->getSection(table.shdr.sh_link);\n return SymbolSection(table.io, strings.io);\n}\n\nbool\nSymbolSection::linearSearch(const string &name, Elf_Sym &sym)\n{\n for (const auto &info : *this) {\n if (name == info.second) {\n sym = info.first;\n return true;\n }\n }\n return false;\n}\n\nElfSymHash::ElfSymHash(std::shared_ptr<const Reader> hash_,\n std::shared_ptr<const Reader> syms_, std::shared_ptr<const Reader> strings_)\n : hash(hash_)\n , syms(syms_)\n , strings(strings_)\n{\n \/\/ read the hash table into local memory.\n size_t words = hash->size() \/ sizeof (Elf_Word);\n data.resize(words);\n hash->readObj(0, &data[0], words);\n nbucket = data[0];\n nchain = data[1];\n buckets = &data[0] + 2;\n chains = buckets + nbucket;\n}\n\nbool\nElfSymHash::findSymbol(Elf_Sym &sym, const string &name)\n{\n uint32_t bucket = elf_hash(name) % nbucket;\n for (Elf_Word i = buckets[bucket]; i != STN_UNDEF; i = chains[i]) {\n Elf_Sym candidate;\n syms->readObj(i * sizeof candidate, &candidate);\n string candidateName = strings->readString(candidate.st_name);\n if (candidateName == name) {\n sym = candidate;\n return true;\n }\n }\n return false;\n}\n\n\/*\n * Locate a named symbol in an ELF image.\n *\/\nbool\nElfObject::findSymbolByName(const string &name, Elf_Sym &sym)\n{\n if (debugData)\n return debugData->findSymbolByName(name, sym);\n\n if (hash && hash->findSymbol(sym, name))\n return true;\n\n for (const char *sec : { \".dynsym\", \".symtab\" }) {\n SymbolSection sect = getSymbols(sec);\n if (sect.linearSearch(name, sym))\n return true;\n }\n return false;\n}\n\nElfObject::~ElfObject()\n{\n}\n\nstd::shared_ptr<ElfObject>\nElfObject::getDebug(std::shared_ptr<ElfObject> &in)\n{\n if (noDebugLibs)\n return in;\n\n if (!in->debugLoaded) {\n in->debugLoaded = true;\n auto &hdr = in->getSection(\".gnu_debuglink\", SHT_PROGBITS);\n auto link = hdr.io->readString(0);\n auto dir = dirname(stringify(*in->io));\n in->debugObject = in->imageCache.getDebugImage(dir + \"\/\" + link);\n\n if (!in->debugObject) {\n for (auto note : in->notes) {\n if (note.name() == \"GNU\" && note.type() == GNU_BUILD_ID) {\n std::ostringstream dir;\n dir << \".build-id\/\";\n size_t i;\n auto io = note.data();\n std::vector<unsigned char> data(io->size());\n io->readObj(0, &data[0], io->size());\n dir << std::hex << std::setw(2) << std::setfill('0') << int(data[0]);\n dir << \"\/\";\n for (i = 1; i < note.size(); ++i)\n dir << std::setw(2) << int(data[i]);\n dir << \".debug\";\n in->debugObject = in->imageCache.getDebugImage(dir.str());\n break;\n }\n }\n }\n if (in->debugObject && verbose >= 2)\n *debug << \"found debug object \" << *in->debugObject->io << \" for \" << *in->io << \"\\n\";\n }\n return in->debugObject ? in->debugObject : in;\n}\n\n\/*\n * Culled from System V Application Binary Interface\n *\/\nstatic uint32_t\nelf_hash(string name)\n{\n uint32_t h = 0, g;\n for (auto c : name) {\n h = (h << 4) + c;\n if ((g = h & 0xf0000000) != 0)\n h ^= g >> 24;\n h &= ~g;\n }\n return (h);\n}\n\n\nvoid\nElfSection::open(const std::shared_ptr<const Reader> &image, off_t off)\n{\n image->readObj(off, &shdr);\n auto rawIo = std::make_shared<OffsetReader>(image, shdr.sh_offset, shdr.sh_size);\n if ((shdr.sh_flags & SHF_COMPRESSED) == 0) {\n io = rawIo;\n } else {\n\n#ifdef WITH_ZLIB\n Elf_Chdr chdr;\n rawIo->readObj(0, &chdr);\n io = std::make_shared<InflateReader>(chdr.ch_size,\n std::make_shared<OffsetReader>(rawIo,\n sizeof chdr, shdr.sh_size - sizeof chdr));\n#else\n static bool warned = false;\n if (!warned) {\n warned = true;\n std::clog <<\"warning: no support configured for compressed debug info in \" << *image << std::endl;\n }\n io = std::make_shared<NullReader>();\n#endif\n }\n}\n\nstd::shared_ptr<ElfObject>\nImageCache::getImageForName(const std::string &name) {\n bool found;\n auto res = getImageIfLoaded(name, found);\n if (found)\n return res;\n auto &item = cache[name];\n item = std::make_shared<ElfObject>(*this, loadFile(name));\n return item;\n}\n\nImageCache::ImageCache() : elfHits(0), elfLookups(0) {}\nImageCache::~ImageCache() {\n if (verbose >= 2) {\n *debug << \"ELF image cache: lookups: \" << elfLookups << \", hits=\" << elfHits << std::endl;\n for (auto &items : cache) {\n if (items.second)\n *debug << \"\\t\" << *items.second->io << std::endl;\n else\n *debug << \"\\t\" << \"NEGATIVE: \" << items.first << std::endl;\n }\n }\n}\n\nstd::shared_ptr<ElfObject>\nImageCache::getImageIfLoaded(const std::string &name, bool &found)\n{\n elfLookups++;\n auto it = cache.find(name);\n if (it != cache.end()) {\n elfHits++;\n found = true;\n return it->second;\n }\n found = false;\n return std::shared_ptr<ElfObject>();\n}\n\nstd::shared_ptr<ElfObject>\nImageCache::getDebugImage(const std::string &name) {\n \/\/ XXX: verify checksum.\n for (auto dir : globalDebugDirectories.dirs) {\n bool found;\n auto img = getImageIfLoaded(dir + \"\/\" + name, found);\n if (found)\n return img;\n }\n for (auto dir : globalDebugDirectories.dirs) {\n try {\n return getImageForName(dir + \"\/\" + name);\n }\n catch (const std::exception &ex) {\n continue;\n }\n }\n return std::shared_ptr<ElfObject>();\n}\n<|endoftext|>"} {"text":"<commit_before>#include <iostream>\n#include <fstream>\n#include <stack>\n#include <cmath>\n#include <time.h>\nusing namespace std;\n\n\n\nvoid goToSemi(ifstream &myfile, int &i){ \/\/ stream goes to the next semicolon with it already extracted\n int where=myfile.get();\n while(where!=59){\n if(where==10){\n i++;\n }\n where=myfile.get();\n }\n}\n\n\n\nvoid goToNextLine(ifstream &myfile){ \/\/stream goes to the next line\n int where = myfile.get();\n while(where!=10){ \/\/ until the next line 10= int '\\n'\n where=myfile.get();\n }\n}\n\n\n\n\nint goToLoc(ifstream &myfile){ \/\/ stream goes to the next number with it already extracted and gives back its value\n \/\/ if there is no number before the next semicolon it returns 0 (and semicolon is extractet) \n int where = myfile.get();\n int where2=where;\n while ((where<48 || where > 57)&&where!=59){\n \n where = myfile.get();\n }\n if(where==59){\n where=48;\n }\n return where-48;\n}\n\n\n\n\nvoid addNumber(ifstream &myfile, long double &w, long int n, int &i){ \/\/extracts the next number and calculates the actual geometric mean given the location \n \n long double v=0.0;\n int where = myfile.get();\n int count = 0;\n int point =0;\n stack<int> number;\n \n while (where<48 || where > 57){\n if(where==10){\n i++;\n }\n where = myfile.get();\n }\n \n while ((where>=48&&where<=57)||where==46){\n \n if(where==46){\n point=count;\n }\n else{\n count++;\n number.push(where-48);\n }\n where=myfile.get();\n }\n myfile.unget();\n \n \n for(int j=count; j>0; j--){\n v=v+(number.top())*(pow(10,(point-j)));\n number.pop();\n }\n if(w==0){\n w=v;\n }\n else{\n long double exponent=(1+(log(1\/w))\/(log(v)))\/(n+1);\n w=w*pow(v,exponent);\n }\n \n\n \n}\n\n\n\n\n\nvoid mean(long double * means){\n \n ifstream myfile;\n myfile.open(\"ex1.dat\");\n \n \/\/cout<<myfile.eof()<<endl;\n int i=1;\n int where=myfile.get();\n int loc;\n long int loc1=0;\n long int loc2=0;\n \n while(where!=-1){\n\n if(where==35){ \/\/ ignore lines with #\n \n where=myfile.get();\n \n while(where!=10 && where!=-1){ \/\/ goes to next line\n where=myfile.get();\n }\n i++;\n where=myfile.get();\n }\n \n \n else{\n \n goToSemi(myfile,i);\n loc=goToLoc(myfile);\n goToSemi(myfile,i);\n \n \n if(loc==1){\n addNumber(myfile,means[0],loc1, i); \n loc1++;\n }\n else if(loc==2){\n addNumber(myfile,means[1],loc2, i);\n loc2++;\n }\n \n else{\n\n }\n\n goToNextLine(myfile);\n where=myfile.peek();\n i++;\n\n }\n \n \n }\n \n cout<< \"File: ex1.dat with :\"<< i << \" lines\"<< endl;\n cout<<\" Valid Values Loc1:\"<< loc1<< \" With GeoMean: \"<<means[0]<<endl;\n cout<<\" Valid Values Loc1:\"<< loc2<< \" With GeoMean: \"<<means[1]<<endl;\n \n}\n\n\n\n\n\n\n\nint main(){\n clock_t tStart = clock();\n ifstream myfile;\n myfile.open(\"ex1.dat\");\n\n\n \n long double means[2]={0.0,0.0};\n mean(means);\n \n cout<<\"Time needed: \";\n cout<<(double)(clock()-tStart)\/CLOCKS_PER_SEC<<\" seconds\"<<endl;\n}<commit_msg>Delete ex1.cc<commit_after><|endoftext|>"} {"text":"<commit_before>\/* Copyright (c) 2019 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\/cvm_op.h\"\n#include <memory>\n#include \"paddle\/fluid\/operators\/math\/math_function.h\"\n\nnamespace paddle {\nnamespace operators {\n\nusing Tensor = framework::Tensor;\n\nclass CVMOp : 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(\"CVM\"), \"Input(CVM) 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 cvm_dims = ctx->GetInputDim(\"CVM\");\n PADDLE_ENFORCE_EQ(x_dims.size(), 2UL, \"Input(X)'s rank should be 2.\");\n PADDLE_ENFORCE_EQ(cvm_dims.size(), 2UL, \"Input(CVM)'s rank should be 2.\");\n PADDLE_ENFORCE_EQ(cvm_dims[1], 2UL,\n \"The 2nd dimension of \"\n \"Input(CVM) should be 2.\");\n\n if (ctx->Attrs().Get<bool>(\"use_cvm\")) {\n ctx->SetOutputDim(\"Y\", {x_dims[0], x_dims[1]});\n } else {\n ctx->SetOutputDim(\"Y\", {x_dims[0], x_dims[1] - 2});\n }\n ctx->ShareLoD(\"X\", \/*->*\/ \"Y\");\n }\n\n protected:\n \/\/ Explicitly set that the data type of computation kernel of\n \/\/ cvm\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 platform::CPUPlace());\n }\n};\n\nclass CVMGradientOp : 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(\"CVM\"), \"Input(CVM) 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 cvm_dims = ctx->GetInputDim(\"CVM\");\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(cvm_dims.size(), 2, \"Input(CVM)'s rank should be 2.\");\n\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\n PADDLE_ENFORCE_EQ(cvm_dims[1], 2,\n \"When Attr(soft_label) == false, the 2nd dimension of \"\n \"Input(CVM) should be 2.\");\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 \/\/ cvm\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 platform::CPUPlace());\n }\n};\n\nclass CVMOpMaker : public framework::OpProtoAndCheckerMaker {\n public:\n void Make() override {\n AddInput(\"X\",\n \"(LodTensor, default LodTensor<float>), a 2-D tensor with shape \"\n \"[N x D],\"\n \" where N is the batch size and D is the emebdding dim. \");\n AddInput(\"CVM\",\n \"(Tensor), a 2-D Tensor with shape [N x 2], where N is the batch \"\n \"size, 2 is show and click.\");\n AddOutput(\"Y\",\n \"(LodTensor, default LodTensor<float>), a 2-D tensor with shape \"\n \"[N x K].\");\n AddAttr<bool>(\"use_cvm\", \"bool, use cvm or not\").SetDefault(true);\n AddComment(R\"DOC(\nCVM Operator.\n\n We assume that input X is a embedding vector with cvm_feature(show and click), which shape is [N * D] (D is 2(cvm_feature) + embedding dim, N is batch_size)\n if use_cvm is True, we will log(cvm_feature), and output shape is [N * D].\n if use_cvm is False, we will remove cvm_feature from input, and output shape is [N * (D - 2)].\n\n)DOC\");\n }\n};\n\nclass CVMGradOpDescMaker : public framework::SingleGradOpDescMaker {\n public:\n using framework::SingleGradOpDescMaker::SingleGradOpDescMaker;\n\n protected:\n std::unique_ptr<framework::OpDesc> Apply() const override {\n std::unique_ptr<framework::OpDesc> op(new framework::OpDesc());\n op->SetType(\"cvm_grad\");\n op->SetInput(\"CVM\", Input(\"CVM\"));\n op->SetInput(framework::GradVarName(\"Y\"), OutputGrad(\"Y\"));\n op->SetOutput(framework::GradVarName(\"X\"), InputGrad(\"X\"));\n op->SetAttrMap(Attrs());\n return op;\n }\n};\n\n} \/\/ namespace operators\n} \/\/ namespace paddle\n\nnamespace ops = paddle::operators;\nREGISTER_OPERATOR(cvm, ops::CVMOp, ops::CVMOpMaker, ops::CVMGradOpDescMaker);\n\nREGISTER_OPERATOR(cvm_grad, ops::CVMGradientOp);\n\nREGISTER_OP_CPU_KERNEL(cvm, ops::CVMOpKernel<float>, ops::CVMOpKernel<double>);\n\nREGISTER_OP_CPU_KERNEL(cvm_grad, ops::CVMGradOpKernel<float>,\n ops::CVMGradOpKernel<double>);\n<commit_msg>add X to grad test=develop<commit_after>\/* Copyright (c) 2019 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\/cvm_op.h\"\n#include <memory>\n#include \"paddle\/fluid\/operators\/math\/math_function.h\"\n\nnamespace paddle {\nnamespace operators {\n\nusing Tensor = framework::Tensor;\n\nclass CVMOp : 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(\"CVM\"), \"Input(CVM) 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 cvm_dims = ctx->GetInputDim(\"CVM\");\n PADDLE_ENFORCE_EQ(x_dims.size(), 2UL, \"Input(X)'s rank should be 2.\");\n PADDLE_ENFORCE_EQ(cvm_dims.size(), 2UL, \"Input(CVM)'s rank should be 2.\");\n PADDLE_ENFORCE_EQ(cvm_dims[1], 2UL,\n \"The 2nd dimension of \"\n \"Input(CVM) should be 2.\");\n\n if (ctx->Attrs().Get<bool>(\"use_cvm\")) {\n ctx->SetOutputDim(\"Y\", {x_dims[0], x_dims[1]});\n } else {\n ctx->SetOutputDim(\"Y\", {x_dims[0], x_dims[1] - 2});\n }\n ctx->ShareLoD(\"X\", \/*->*\/ \"Y\");\n }\n\n protected:\n \/\/ Explicitly set that the data type of computation kernel of\n \/\/ cvm\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 platform::CPUPlace());\n }\n};\n\nclass CVMGradientOp : 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(\"CVM\"), \"Input(CVM) 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 cvm_dims = ctx->GetInputDim(\"CVM\");\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(cvm_dims.size(), 2, \"Input(CVM)'s rank should be 2.\");\n\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\n PADDLE_ENFORCE_EQ(cvm_dims[1], 2,\n \"When Attr(soft_label) == false, the 2nd dimension of \"\n \"Input(CVM) should be 2.\");\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 \/\/ cvm\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 platform::CPUPlace());\n }\n};\n\nclass CVMOpMaker : public framework::OpProtoAndCheckerMaker {\n public:\n void Make() override {\n AddInput(\"X\",\n \"(LodTensor, default LodTensor<float>), a 2-D tensor with shape \"\n \"[N x D],\"\n \" where N is the batch size and D is the emebdding dim. \");\n AddInput(\"CVM\",\n \"(Tensor), a 2-D Tensor with shape [N x 2], where N is the batch \"\n \"size, 2 is show and click.\");\n AddOutput(\"Y\",\n \"(LodTensor, default LodTensor<float>), a 2-D tensor with shape \"\n \"[N x K].\");\n AddAttr<bool>(\"use_cvm\", \"bool, use cvm or not\").SetDefault(true);\n AddComment(R\"DOC(\nCVM Operator.\n\n We assume that input X is a embedding vector with cvm_feature(show and click), which shape is [N * D] (D is 2(cvm_feature) + embedding dim, N is batch_size)\n if use_cvm is True, we will log(cvm_feature), and output shape is [N * D].\n if use_cvm is False, we will remove cvm_feature from input, and output shape is [N * (D - 2)].\n\n)DOC\");\n }\n};\n\nclass CVMGradOpDescMaker : public framework::SingleGradOpDescMaker {\n public:\n using framework::SingleGradOpDescMaker::SingleGradOpDescMaker;\n\n protected:\n std::unique_ptr<framework::OpDesc> Apply() const override {\n std::unique_ptr<framework::OpDesc> op(new framework::OpDesc());\n op->SetType(\"cvm_grad\");\n op->SetInput(\"X\", Input(\"X\"));\n op->SetInput(\"CVM\", Input(\"CVM\"));\n op->SetInput(framework::GradVarName(\"Y\"), OutputGrad(\"Y\"));\n op->SetOutput(framework::GradVarName(\"X\"), InputGrad(\"X\"));\n op->SetAttrMap(Attrs());\n return op;\n }\n};\n\n} \/\/ namespace operators\n} \/\/ namespace paddle\n\nnamespace ops = paddle::operators;\nREGISTER_OPERATOR(cvm, ops::CVMOp, ops::CVMOpMaker, ops::CVMGradOpDescMaker);\n\nREGISTER_OPERATOR(cvm_grad, ops::CVMGradientOp);\n\nREGISTER_OP_CPU_KERNEL(cvm, ops::CVMOpKernel<float>, ops::CVMOpKernel<double>);\n\nREGISTER_OP_CPU_KERNEL(cvm_grad, ops::CVMGradOpKernel<float>,\n ops::CVMGradOpKernel<double>);\n<|endoftext|>"} {"text":"<commit_before>\/*\n**\n* BEGIN_COPYRIGHT\n*\n* load_tools is a plugin for SciDB. Copyright (C) 2008-2014 SciDB, Inc.\n*\n* load_tools is free software: you can redistribute it and\/or modify\n* it under the terms of the AFFERO GNU General Public License as published by\n* the Free Software Foundation.\n*\n* load_tools is distributed \"AS-IS\" AND WITHOUT ANY WARRANTY OF ANY KIND,\n* INCLUDING ANY IMPLIED WARRANTY OF MERCHANTABILITY,\n* NON-INFRINGEMENT, OR FITNESS FOR A PARTICULAR PURPOSE. See\n* the AFFERO GNU General Public License for the complete license terms.\n*\n* You should have received a copy of the AFFERO GNU General Public License\n* along with load_tools. If not, see <http:\/\/www.gnu.org\/licenses\/agpl-3.0.html>\n*\n* END_COPYRIGHT\n*\/\n\n#include <stdio.h>\n#include <string.h>\n#include <time.h>\n#include <errno.h>\n#include <vector>\n\n#include <boost\/lexical_cast.hpp>\n#include <boost\/assign.hpp>\n#include <boost\/algorithm\/string.hpp>\n\n#include \"query\/FunctionLibrary.h\"\n#include \"query\/FunctionDescription.h\"\n#include \"system\/ErrorsLibrary.h\"\n\nusing namespace std;\nusing namespace boost;\nusing namespace boost::assign;\nusing namespace scidb;\n\n\/**\n * DCAST: cast with default, does not throw an error. Tries to cast input to the appropriate type. If the cast fails,\n * returns the supplied default.\n *\/\ntemplate <typename T>\nstatic void dcast(const Value** args, Value *res, void*)\n{\n if(args[0]->isNull())\n {\n res->setNull(args[0]->getMissingReason());\n return;\n }\n const char* s = args[0]->getString();\n try\n {\n T result = lexical_cast<T>(s);\n res->set<T>(result);\n }\n catch(...)\n {\n Value const* def = args[1];\n if(def->isNull())\n {\n res->setNull( def->getMissingReason());\n }\n else\n {\n res->set<T>(def->get<T>());\n }\n }\n}\n\nstatic scidb::UserDefinedFunction dcast_double (scidb::FunctionDescription(\"dcast\", list_of(\"string\")(\"double\"), \"double\", &dcast<double> ));\nstatic scidb::UserDefinedFunction dcast_float (scidb::FunctionDescription(\"dcast\", list_of(\"string\")(\"float\"), \"float\", &dcast<float> ));\nstatic scidb::UserDefinedFunction dcast_bool (scidb::FunctionDescription(\"dcast\", list_of(\"string\")(\"bool\"), \"bool\", &dcast<bool> ));\nstatic scidb::UserDefinedFunction dcast_int64 (scidb::FunctionDescription(\"dcast\", list_of(\"string\")(\"int64\"), \"int64\" , &dcast<int64_t>));\nstatic scidb::UserDefinedFunction dcast_int32 (scidb::FunctionDescription(\"dcast\", list_of(\"string\")(\"int32\"), \"int32\", &dcast<int32_t> ));\nstatic scidb::UserDefinedFunction dcast_int16 (scidb::FunctionDescription(\"dcast\", list_of(\"string\")(\"int16\"), \"int16\", &dcast<int16_t> ));\nstatic scidb::UserDefinedFunction dcast_int8 (scidb::FunctionDescription(\"dcast\", list_of(\"string\")(\"int8\"), \"int8\", &dcast<int8_t> ));\nstatic scidb::UserDefinedFunction dcast_uint64 (scidb::FunctionDescription(\"dcast\", list_of(\"string\")(\"uint64\"), \"uint64\", &dcast<uint64_t> ));\nstatic scidb::UserDefinedFunction dcast_uint32 (scidb::FunctionDescription(\"dcast\", list_of(\"string\")(\"uint32\"), \"uint32\", &dcast<uint32_t> ));\nstatic scidb::UserDefinedFunction dcast_uint16 (scidb::FunctionDescription(\"dcast\", list_of(\"string\")(\"uint16\"), \"uint16\", &dcast<uint16_t> ));\nstatic scidb::UserDefinedFunction dcast_uint8 (scidb::FunctionDescription(\"dcast\", list_of(\"string\")(\"uint8\"), \"uint8\", &dcast<uint8_t> ));\n\n\/\/ XXX How to add datetime conversion here? The naive approach:\n\/\/static scidb::UserDefinedFunction dcast_datetimetz (scidb::FunctionDescription(\"dcast\", list_of(\"string\")(\"datetimetz\"), \"datetimetz\", &dcast<datetimetz> ));\n\/\/ doesn't work!\n\n\/**\n * first argument: the string to trim\n * second argument: a set of characters to trim, represented as another string {S}\n * returns: the first argument with all occurrences of any of the characters in S removed from the beginning or end of the string\n *\/\nstatic void trim (const Value** args, Value *res, void*)\n{\n if(args[0]->isNull())\n {\n res->setNull(args[0]->getMissingReason());\n return;\n }\n const char* input = args[0]->getString();\n size_t inputLen = args[0]->size();\n const char* chars = args[1]->getString();\n size_t charsLen = args[1]->size();\n if (charsLen == 0 || (charsLen ==1 && chars[0]==0))\n {\n res->setSize(inputLen);\n memcpy(res->data(), input, inputLen);\n return;\n }\n const char* start = input;\n for(size_t i=0; i<inputLen; ++i)\n {\n char ch = input[i];\n if(ch==0)\n {\n break;\n }\n bool match = false;\n for(size_t j=0; j<charsLen; ++j)\n {\n if(ch == chars[j])\n {\n match =true;\n break;\n }\n }\n if(!match)\n {\n break;\n }\n ++start;\n }\n const char* end = input + inputLen - 1;\n for(ssize_t i = inputLen-1; i>=0; --i)\n {\n char ch = input[i];\n if(ch==0)\n {\n continue;\n }\n bool match = false;\n for(size_t j=0; j<charsLen; ++j)\n {\n if(ch == chars[j])\n {\n match =true;\n break;\n }\n }\n if(!match)\n {\n break;\n }\n --end;\n }\n if (inputLen == 0 || (inputLen ==1 && input[0]==0) || start >= end)\n {\n res->setSize(1);\n ((char *) res->data())[0]=0;\n return;\n }\n size_t size = end - start + 1;\n res->setSize(size);\n memcpy(res->data(), start, (end-start));\n ((char*)res->data())[size-1]=0;\n}\n\nstatic scidb::UserDefinedFunction trim_str (scidb::FunctionDescription(\"trim\", list_of(\"string\")(\"string\"), \"string\", &trim ));\n\n\nstatic void int_to_char (const Value** args, Value *res, void*)\n{\n if(args[0]->isNull())\n {\n res->setNull(args[0]->getMissingReason());\n return;\n }\n uint8_t input = args[0]->getUint8();\n res->setChar(input);\n}\n\nstatic scidb::UserDefinedFunction int_to_c (scidb::FunctionDescription(\"int_to_char\", list_of(\"uint8\"), \"char\", &int_to_char ));\nstatic scidb::UserDefinedFunction c_to_int (scidb::FunctionDescription(\"char_to_int\", list_of(\"char\"), \"uint8\", &int_to_char ));\n\nstatic void codify (const Value** args, Value *res, void*)\n{\n if(args[0]->isNull())\n {\n res->setNull(args[0]->getMissingReason());\n return;\n }\n const char* input = args[0]->getString();\n size_t inputLen = args[0]->size();\n ostringstream out;\n for (size_t i=0; i< inputLen; ++i)\n {\n char c = input[i];\n int32_t res = c;\n out<<res<<\"|\";\n }\n res->setString(out.str().c_str());\n}\n\nstatic scidb::UserDefinedFunction asciify_str (scidb::FunctionDescription(\"codify\", list_of(\"string\"), \"string\", &codify ));\n\nsize_t match_length(\n const char* pattern, \n size_t patternLength,\n const char* str,\n size_t strLength, \n int strOffset) { \n\n size_t i = 0;\n for(; i < patternLength && strOffset + i < strLength && pattern[i] == str[strOffset + i]; i++) \n {}\n\n return i;\n}\n\nint find_next(const char* str, size_t strLen, int offset, char nextChar) { \n size_t i = 0;\n for(i = offset; i < strLen; i++) { \n if(str[i] == nextChar) { return i; }\n }\n\n return i;\n}\n\nint find_first_pattern_match(\n const char* pattern,\n size_t patternLength,\n const char* str, \n size_t strLength) { \n\n for(size_t i = 0; i < strLength; i++) {\n if(match_length(pattern, patternLength, str, strLength, i) == patternLength &&\n i + patternLength < strLength &&\n str[i+patternLength] == '=') {\n return i;\n }\n }\n\n return -1;\n}\n\nstatic void keyed_value( const Value** args, Value *res, void* ) {\n \n for(int i = 0; i < 2; i++) { \n if(args[i]->isNull()) { \n res->setNull(args[i]->getMissingReason());\n return;\n }\n }\n\n const char* infoField = args[0]->getString();\n size_t infoLen = args[0]->size();\n const char* keyName = args[1]->getString();\n size_t keyLen = args[1]->size();\n\n int kstart = find_first_pattern_match(keyName, keyLen-1, infoField, infoLen-1);\n\n if(keyLen == 0 || (keyLen == 1 && keyName[0]==0) || kstart == -1) {\n *res = *(args[2]);\n return;\n }\n\n int vstart = kstart + keyLen;\n int vend = find_next(infoField, infoLen-1, vstart, ';');\n\n size_t size = vend - vstart + 1;\n res->setSize(size);\n memcpy(res->data(), &infoField[vstart], (vend-vstart));\n ((char*)res->data())[size-1]=0;\n}\nstatic scidb::UserDefinedFunction key_value_extract( scidb::FunctionDescription(\"keyed_value\", list_of(\"string\")(\"string\")(\"string\"), \"string\", &keyed_value));\n\n\/\/in some rare cases, on older versions, string values are not null-terminated; we aim to be nice\nstring get_null_terminated_string(char const* input, size_t const size)\n{\n if(size == 0)\n {\n return string(\"\");\n }\n else if (input[size-1] != 0)\n {\n return string(input, size);\n }\n else\n {\n return string(input);\n }\n}\n\n\/**\n * Loosely based on https:\/\/github.com\/slottad\/scidb-genotypes\/\n * Thanks to Douglas Slotta.\n * We find we are repeating some of the work and it might make sense to merge in more of that functionality\n *\/\nvoid num_csv(const scidb::Value** args, scidb::Value* res, void*)\n{\n if (args[0]->isNull())\n {\n res->setNull(args[0]->getMissingReason());\n return;\n }\n string cell = get_null_terminated_string(args[0]->getString(), args[0]->size());\n uint32_t count = 0;\n if (!cell.empty())\n {\n count = 1 + std::count(cell.begin(), cell.end(), ',');\n }\n res->setUint32(count);\n}\nstatic scidb::UserDefinedFunction ncsv( scidb::FunctionDescription(\"num_csv\", list_of(\"string\"), \"uint32\", &num_csv));\n\nvoid nth_csv(const scidb::Value** args, scidb::Value* res, void*)\n{\n if (args[0]->isNull())\n {\n res->setNull(args[0]->getMissingReason());\n return;\n }\n if (args[1]->isNull())\n {\n res->setNull(0);\n return;\n }\n uint32_t n = args[1]->getUint32();\n string cell = get_null_terminated_string(args[0]->getString(), args[0]->size());\n vector<string> values;\n split(values, cell, is_from_range(',', ','));\n if (values.size() <= n)\n {\n res->setNull(0);\n return;\n }\n res->setString(values[n]);\n}\n\nstatic scidb::UserDefinedFunction ntcsv( scidb::FunctionDescription(\"nth_csv\", list_of(\"string\")(\"uint32\"), \"string\", &nth_csv));\n\n\/**\n * arg0: FORMAT FIELD\n * arg1: sample FIELD\n * arg2: attribute name\n *\/\nstatic void extract_format_field( const Value **args, Value* res, void*) {\n for(int i = 0; i < 3; i++) { \n if(args[i]->isNull()) { \n res->setNull(args[i]->getMissingReason());\n return;\n }\n }\n\n const char* formatField = args[0]->getString();\n size_t formatLen = args[0]->size();\n const char* sampleField = args[1]->getString();\n size_t sampleLen = args[1]->size();\n const char* attrName = args[2]->getString();\n size_t attrLen = args[2]->size();\n\n size_t index = 0;\n size_t j = 0, k = 0;\n bool match = false;\n for(; j < formatLen && !match; j += k) { \n if(formatField[j] == ':') { index++; j++; }\n match = true;\n for(k = 0; j+k < formatLen && formatField[j+k] != ':'; k++) { \n if(k >= attrLen || formatField[j+k] != attrName[k]) { match = false; }\n }\n }\n\n if(!match) { \n res->setNull(0);\n return;\n }\n\n size_t start = 0;\n size_t indexi = 0;\n for(; start < sampleLen && indexi < index; start++) { \n if(sampleField[start] == ':') { \n indexi += 1;\n }\n }\n \n size_t end = start+1;\n for(; end < sampleLen && sampleField[end] != ':'; end += 1) \n {}\n\n size_t size = end - start + 1;\n res->setSize(size);\n memcpy(res->data(), &sampleField[start], (end-start));\n ((char*)res->data())[size-1]=0;\n}\n\nstatic scidb::UserDefinedFunction format_extract(scidb::FunctionDescription(\"format_extract\", list_of(\"string\")(\"string\")(\"string\"), \"string\", &extract_format_field));\n<commit_msg>Add maxlen_csv function<commit_after>\/*\n**\n* BEGIN_COPYRIGHT\n*\n* load_tools is a plugin for SciDB. Copyright (C) 2008-2014 SciDB, Inc.\n*\n* load_tools is free software: you can redistribute it and\/or modify\n* it under the terms of the AFFERO GNU General Public License as published by\n* the Free Software Foundation.\n*\n* load_tools is distributed \"AS-IS\" AND WITHOUT ANY WARRANTY OF ANY KIND,\n* INCLUDING ANY IMPLIED WARRANTY OF MERCHANTABILITY,\n* NON-INFRINGEMENT, OR FITNESS FOR A PARTICULAR PURPOSE. See\n* the AFFERO GNU General Public License for the complete license terms.\n*\n* You should have received a copy of the AFFERO GNU General Public License\n* along with load_tools. If not, see <http:\/\/www.gnu.org\/licenses\/agpl-3.0.html>\n*\n* END_COPYRIGHT\n*\/\n\n#include <stdio.h>\n#include <string.h>\n#include <time.h>\n#include <errno.h>\n#include <vector>\n\n#include <boost\/lexical_cast.hpp>\n#include <boost\/assign.hpp>\n#include <boost\/algorithm\/string.hpp>\n\n#include \"query\/FunctionLibrary.h\"\n#include \"query\/FunctionDescription.h\"\n#include \"system\/ErrorsLibrary.h\"\n\nusing namespace std;\nusing namespace boost;\nusing namespace boost::assign;\nusing namespace scidb;\n\n\/**\n * DCAST: cast with default, does not throw an error. Tries to cast input to the appropriate type. If the cast fails,\n * returns the supplied default.\n *\/\ntemplate <typename T>\nstatic void dcast(const Value** args, Value *res, void*)\n{\n if(args[0]->isNull())\n {\n res->setNull(args[0]->getMissingReason());\n return;\n }\n const char* s = args[0]->getString();\n try\n {\n T result = lexical_cast<T>(s);\n res->set<T>(result);\n }\n catch(...)\n {\n Value const* def = args[1];\n if(def->isNull())\n {\n res->setNull( def->getMissingReason());\n }\n else\n {\n res->set<T>(def->get<T>());\n }\n }\n}\n\nstatic scidb::UserDefinedFunction dcast_double (scidb::FunctionDescription(\"dcast\", list_of(\"string\")(\"double\"), \"double\", &dcast<double> ));\nstatic scidb::UserDefinedFunction dcast_float (scidb::FunctionDescription(\"dcast\", list_of(\"string\")(\"float\"), \"float\", &dcast<float> ));\nstatic scidb::UserDefinedFunction dcast_bool (scidb::FunctionDescription(\"dcast\", list_of(\"string\")(\"bool\"), \"bool\", &dcast<bool> ));\nstatic scidb::UserDefinedFunction dcast_int64 (scidb::FunctionDescription(\"dcast\", list_of(\"string\")(\"int64\"), \"int64\" , &dcast<int64_t>));\nstatic scidb::UserDefinedFunction dcast_int32 (scidb::FunctionDescription(\"dcast\", list_of(\"string\")(\"int32\"), \"int32\", &dcast<int32_t> ));\nstatic scidb::UserDefinedFunction dcast_int16 (scidb::FunctionDescription(\"dcast\", list_of(\"string\")(\"int16\"), \"int16\", &dcast<int16_t> ));\nstatic scidb::UserDefinedFunction dcast_int8 (scidb::FunctionDescription(\"dcast\", list_of(\"string\")(\"int8\"), \"int8\", &dcast<int8_t> ));\nstatic scidb::UserDefinedFunction dcast_uint64 (scidb::FunctionDescription(\"dcast\", list_of(\"string\")(\"uint64\"), \"uint64\", &dcast<uint64_t> ));\nstatic scidb::UserDefinedFunction dcast_uint32 (scidb::FunctionDescription(\"dcast\", list_of(\"string\")(\"uint32\"), \"uint32\", &dcast<uint32_t> ));\nstatic scidb::UserDefinedFunction dcast_uint16 (scidb::FunctionDescription(\"dcast\", list_of(\"string\")(\"uint16\"), \"uint16\", &dcast<uint16_t> ));\nstatic scidb::UserDefinedFunction dcast_uint8 (scidb::FunctionDescription(\"dcast\", list_of(\"string\")(\"uint8\"), \"uint8\", &dcast<uint8_t> ));\n\n\/\/ XXX How to add datetime conversion here? The naive approach:\n\/\/static scidb::UserDefinedFunction dcast_datetimetz (scidb::FunctionDescription(\"dcast\", list_of(\"string\")(\"datetimetz\"), \"datetimetz\", &dcast<datetimetz> ));\n\/\/ doesn't work!\n\n\/**\n * first argument: the string to trim\n * second argument: a set of characters to trim, represented as another string {S}\n * returns: the first argument with all occurrences of any of the characters in S removed from the beginning or end of the string\n *\/\nstatic void trim (const Value** args, Value *res, void*)\n{\n if(args[0]->isNull())\n {\n res->setNull(args[0]->getMissingReason());\n return;\n }\n const char* input = args[0]->getString();\n size_t inputLen = args[0]->size();\n const char* chars = args[1]->getString();\n size_t charsLen = args[1]->size();\n if (charsLen == 0 || (charsLen ==1 && chars[0]==0))\n {\n res->setSize(inputLen);\n memcpy(res->data(), input, inputLen);\n return;\n }\n const char* start = input;\n for(size_t i=0; i<inputLen; ++i)\n {\n char ch = input[i];\n if(ch==0)\n {\n break;\n }\n bool match = false;\n for(size_t j=0; j<charsLen; ++j)\n {\n if(ch == chars[j])\n {\n match =true;\n break;\n }\n }\n if(!match)\n {\n break;\n }\n ++start;\n }\n const char* end = input + inputLen - 1;\n for(ssize_t i = inputLen-1; i>=0; --i)\n {\n char ch = input[i];\n if(ch==0)\n {\n continue;\n }\n bool match = false;\n for(size_t j=0; j<charsLen; ++j)\n {\n if(ch == chars[j])\n {\n match =true;\n break;\n }\n }\n if(!match)\n {\n break;\n }\n --end;\n }\n if (inputLen == 0 || (inputLen ==1 && input[0]==0) || start >= end)\n {\n res->setSize(1);\n ((char *) res->data())[0]=0;\n return;\n }\n size_t size = end - start + 1;\n res->setSize(size);\n memcpy(res->data(), start, (end-start));\n ((char*)res->data())[size-1]=0;\n}\n\nstatic scidb::UserDefinedFunction trim_str (scidb::FunctionDescription(\"trim\", list_of(\"string\")(\"string\"), \"string\", &trim ));\n\n\nstatic void int_to_char (const Value** args, Value *res, void*)\n{\n if(args[0]->isNull())\n {\n res->setNull(args[0]->getMissingReason());\n return;\n }\n uint8_t input = args[0]->getUint8();\n res->setChar(input);\n}\n\nstatic scidb::UserDefinedFunction int_to_c (scidb::FunctionDescription(\"int_to_char\", list_of(\"uint8\"), \"char\", &int_to_char ));\nstatic scidb::UserDefinedFunction c_to_int (scidb::FunctionDescription(\"char_to_int\", list_of(\"char\"), \"uint8\", &int_to_char ));\n\nstatic void codify (const Value** args, Value *res, void*)\n{\n if(args[0]->isNull())\n {\n res->setNull(args[0]->getMissingReason());\n return;\n }\n const char* input = args[0]->getString();\n size_t inputLen = args[0]->size();\n ostringstream out;\n for (size_t i=0; i< inputLen; ++i)\n {\n char c = input[i];\n int32_t res = c;\n out<<res<<\"|\";\n }\n res->setString(out.str().c_str());\n}\n\nstatic scidb::UserDefinedFunction asciify_str (scidb::FunctionDescription(\"codify\", list_of(\"string\"), \"string\", &codify ));\n\nsize_t match_length(\n const char* pattern, \n size_t patternLength,\n const char* str,\n size_t strLength, \n int strOffset) { \n\n size_t i = 0;\n for(; i < patternLength && strOffset + i < strLength && pattern[i] == str[strOffset + i]; i++) \n {}\n\n return i;\n}\n\nint find_next(const char* str, size_t strLen, int offset, char nextChar) { \n size_t i = 0;\n for(i = offset; i < strLen; i++) { \n if(str[i] == nextChar) { return i; }\n }\n\n return i;\n}\n\nint find_first_pattern_match(\n const char* pattern,\n size_t patternLength,\n const char* str, \n size_t strLength) { \n\n for(size_t i = 0; i < strLength; i++) {\n if(match_length(pattern, patternLength, str, strLength, i) == patternLength &&\n i + patternLength < strLength &&\n str[i+patternLength] == '=') {\n return i;\n }\n }\n\n return -1;\n}\n\nstatic void keyed_value( const Value** args, Value *res, void* ) {\n \n for(int i = 0; i < 2; i++) { \n if(args[i]->isNull()) { \n res->setNull(args[i]->getMissingReason());\n return;\n }\n }\n\n const char* infoField = args[0]->getString();\n size_t infoLen = args[0]->size();\n const char* keyName = args[1]->getString();\n size_t keyLen = args[1]->size();\n\n int kstart = find_first_pattern_match(keyName, keyLen-1, infoField, infoLen-1);\n\n if(keyLen == 0 || (keyLen == 1 && keyName[0]==0) || kstart == -1) {\n *res = *(args[2]);\n return;\n }\n\n int vstart = kstart + keyLen;\n int vend = find_next(infoField, infoLen-1, vstart, ';');\n\n size_t size = vend - vstart + 1;\n res->setSize(size);\n memcpy(res->data(), &infoField[vstart], (vend-vstart));\n ((char*)res->data())[size-1]=0;\n}\nstatic scidb::UserDefinedFunction key_value_extract( scidb::FunctionDescription(\"keyed_value\", list_of(\"string\")(\"string\")(\"string\"), \"string\", &keyed_value));\n\n\/\/in some rare cases, on older versions, string values are not null-terminated; we aim to be nice\nstring get_null_terminated_string(char const* input, size_t const size)\n{\n if(size == 0)\n {\n return string(\"\");\n }\n else if (input[size-1] != 0)\n {\n return string(input, size);\n }\n else\n {\n return string(input);\n }\n}\n\n\/**\n * Loosely based on https:\/\/github.com\/slottad\/scidb-genotypes\/\n * Thanks to Douglas Slotta.\n * We find we are repeating some of the work and it might make sense to merge in more of that functionality\n *\/\nvoid num_csv(const scidb::Value** args, scidb::Value* res, void*)\n{\n if (args[0]->isNull())\n {\n res->setNull(args[0]->getMissingReason());\n return;\n }\n string cell = get_null_terminated_string(args[0]->getString(), args[0]->size());\n uint32_t count = 0;\n if (!cell.empty())\n {\n count = 1 + std::count(cell.begin(), cell.end(), ',');\n }\n res->setUint32(count);\n}\nstatic scidb::UserDefinedFunction ncsv( scidb::FunctionDescription(\"num_csv\", list_of(\"string\"), \"uint32\", &num_csv));\n\nvoid nth_csv(const scidb::Value** args, scidb::Value* res, void*)\n{\n if (args[0]->isNull())\n {\n res->setNull(args[0]->getMissingReason());\n return;\n }\n if (args[1]->isNull())\n {\n res->setNull(0);\n return;\n }\n uint32_t n = args[1]->getUint32();\n string cell = get_null_terminated_string(args[0]->getString(), args[0]->size());\n vector<string> values;\n split(values, cell, is_from_range(',', ','));\n if (values.size() <= n)\n {\n res->setNull(0);\n return;\n }\n res->setString(values[n]);\n}\n\nstatic scidb::UserDefinedFunction ntcsv( scidb::FunctionDescription(\"nth_csv\", list_of(\"string\")(\"uint32\"), \"string\", &nth_csv));\n\nvoid maxlen_csv(const scidb::Value** args, scidb::Value* res, void*)\n{\n if (args[0]->isNull())\n {\n res->setNull(args[0]->getMissingReason());\n return;\n }\n string cell = get_null_terminated_string(args[0]->getString(), args[0]->size());\n vector<string> values;\n split(values, cell, is_from_range(',', ','));\n uint32_t maxSize =0;\n for(size_t i=0, n=values.size(); i<n; ++i)\n {\n if(values[i].size()> maxSize)\n maxSize=values[i].size();\n }\n res->setUint32(maxSize);\n}\n\nstatic scidb::UserDefinedFunction mlcsv( scidb::FunctionDescription(\"maxlen_csv\", list_of(\"string\"), \"uint32\", &maxlen_csv));\n\n\n\/**\n * arg0: FORMAT FIELD\n * arg1: sample FIELD\n * arg2: attribute name\n *\/\nstatic void extract_format_field( const Value **args, Value* res, void*) {\n for(int i = 0; i < 3; i++) { \n if(args[i]->isNull()) { \n res->setNull(args[i]->getMissingReason());\n return;\n }\n }\n\n const char* formatField = args[0]->getString();\n size_t formatLen = args[0]->size();\n const char* sampleField = args[1]->getString();\n size_t sampleLen = args[1]->size();\n const char* attrName = args[2]->getString();\n size_t attrLen = args[2]->size();\n\n size_t index = 0;\n size_t j = 0, k = 0;\n bool match = false;\n for(; j < formatLen && !match; j += k) { \n if(formatField[j] == ':') { index++; j++; }\n match = true;\n for(k = 0; j+k < formatLen && formatField[j+k] != ':'; k++) { \n if(k >= attrLen || formatField[j+k] != attrName[k]) { match = false; }\n }\n }\n\n if(!match) { \n res->setNull(0);\n return;\n }\n\n size_t start = 0;\n size_t indexi = 0;\n for(; start < sampleLen && indexi < index; start++) { \n if(sampleField[start] == ':') { \n indexi += 1;\n }\n }\n \n size_t end = start+1;\n for(; end < sampleLen && sampleField[end] != ':'; end += 1) \n {}\n\n size_t size = end - start + 1;\n res->setSize(size);\n memcpy(res->data(), &sampleField[start], (end-start));\n ((char*)res->data())[size-1]=0;\n}\n\nstatic scidb::UserDefinedFunction format_extract(scidb::FunctionDescription(\"format_extract\", list_of(\"string\")(\"string\")(\"string\"), \"string\", &extract_format_field));\n<|endoftext|>"} {"text":"<commit_before>#include \"global.h\"\n#include \"GVHistory.h\"\n#include \"Singletons.h\"\n\n#include \"ui_InboxWidget.h\"\n\nGVHistory::GVHistory (QObject *parent)\n: QObject (parent)\n, mutex (QMutex::Recursive)\n, bLoggedIn (false)\n, modelInbox (NULL)\n{\n \/\/ Initially, all are to be selected\n strSelectedMessages = \"all\";\n}\/\/GVHistory::GVHistory\n\nGVHistory::~GVHistory(void)\n{\n deinitModel ();\n}\/\/GVHistory::~GVHistory\n\nvoid\nGVHistory::deinitModel ()\n{\n if (NULL != modelInbox) {\n delete modelInbox;\n modelInbox = NULL;\n }\n}\/\/GVHistory::deinitModel\n\nvoid\nGVHistory::initModel (QDeclarativeView *pMainWindow)\n{\n deinitModel ();\n\n CacheDatabase &dbMain = Singletons::getRef().getDBMain ();\n modelInbox = dbMain.newInboxModel ();\n\n QDeclarativeContext *ctx = pMainWindow->rootContext();\n ctx->setContextProperty (\"inboxModel\", modelInbox);\n prepView ();\n}\/\/GVHistory::initModel\n\nvoid\nGVHistory::prepView ()\n{\n CacheDatabase &dbMain = Singletons::getRef().getDBMain ();\n\n emit status (\"Re-selecting inbox entries. This will take some time\", 0);\n dbMain.refreshInboxModel (modelInbox, strSelectedMessages);\n\n while (modelInbox->canFetchMore ()) {\n modelInbox->fetchMore ();\n }\n emit status (\"Inbox entries selected.\");\n}\/\/GVHistory::prepView\n\nvoid\nGVHistory::refreshHistory ()\n{\n QMutexLocker locker(&mutex);\n if (!bLoggedIn)\n {\n return;\n }\n\n CacheDatabase &dbMain = Singletons::getRef().getDBMain ();\n QDateTime dtUpdate;\n dbMain.getLastInboxUpdate (dtUpdate);\n\n GVAccess &webPage = Singletons::getRef().getGVAccess ();\n QVariantList l;\n l += \"all\";\n l += \"1\";\n l += \"10\";\n l += dtUpdate;\n QObject::connect (\n &webPage, SIGNAL (oneHistoryEvent (const GVHistoryEvent &)),\n this , SLOT (oneHistoryEvent (const GVHistoryEvent &)));\n emit status (\"Retrieving Inbox...\", 0);\n if (!webPage.enqueueWork (GVAW_getInbox, l, this,\n SLOT (getHistoryDone (bool, const QVariantList &))))\n {\n getHistoryDone (false, l);\n }\n}\/\/GVHistory::refreshHistory\n\nvoid\nGVHistory::refreshFullInbox ()\n{\n CacheDatabase &dbMain = Singletons::getRef().getDBMain ();\n dbMain.setLastInboxUpdate (QDateTime::fromString (\"2000-01-01\",\n \"yyyy-MM-dd\"));\n refreshHistory ();\n}\/\/GVHistory::refreshFullInbox\n\nvoid\nGVHistory::oneHistoryEvent (const GVHistoryEvent &hevent)\n{\n QString strType = modelInbox->type_to_string (hevent.Type);\n if (0 == strType.size ())\n {\n return;\n }\n\n CacheDatabase &dbMain = Singletons::getRef().getDBMain ();\n dbMain.insertHistory (hevent);\n}\/\/GVHistory::oneHistoryEvent\n\nvoid\nGVHistory::getHistoryDone (bool, const QVariantList &)\n{\n emit status (\"Inbox retrieved. Sorting...\", 0);\n\n GVAccess &webPage = Singletons::getRef().getGVAccess ();\n QObject::disconnect (\n &webPage, SIGNAL (oneHistoryEvent (const GVHistoryEvent &)),\n this , SLOT (oneHistoryEvent (const GVHistoryEvent &)));\n\n prepView ();\n\n CacheDatabase &dbMain = Singletons::getRef().getDBMain ();\n QDateTime dtUpdate;\n if (dbMain.getLatestInboxEntry (dtUpdate))\n {\n qDebug () << QString (\"Latest inbox entry is : %1\")\n .arg (dtUpdate.toString ());\n dbMain.setLastInboxUpdate (dtUpdate);\n }\n\n emit status (\"Inbox ready\");\n}\/\/GVHistory::getHistoryDone\n\nvoid\nGVHistory::onInboxSelected (const QString &strSelection)\n{\n QMutexLocker locker(&mutex);\n if (!bLoggedIn)\n {\n return;\n }\n\n strSelectedMessages = strSelection.toLower ();\n refreshHistory ();\n}\/\/GVHistory::onInboxSelected\n\nvoid\nGVHistory::loginSuccess ()\n{\n QMutexLocker locker(&mutex);\n bLoggedIn = true;\n}\/\/GVHistory::loginSuccess\n\nvoid\nGVHistory::loggedOut ()\n{\n QMutexLocker locker(&mutex);\n bLoggedIn = false;\n}\/\/GVHistory::loggedOut\n<commit_msg>compile error<commit_after>#include \"global.h\"\n#include \"GVHistory.h\"\n#include \"Singletons.h\"\n\nGVHistory::GVHistory (QObject *parent)\n: QObject (parent)\n, mutex (QMutex::Recursive)\n, bLoggedIn (false)\n, modelInbox (NULL)\n{\n \/\/ Initially, all are to be selected\n strSelectedMessages = \"all\";\n}\/\/GVHistory::GVHistory\n\nGVHistory::~GVHistory(void)\n{\n deinitModel ();\n}\/\/GVHistory::~GVHistory\n\nvoid\nGVHistory::deinitModel ()\n{\n if (NULL != modelInbox) {\n delete modelInbox;\n modelInbox = NULL;\n }\n}\/\/GVHistory::deinitModel\n\nvoid\nGVHistory::initModel (QDeclarativeView *pMainWindow)\n{\n deinitModel ();\n\n CacheDatabase &dbMain = Singletons::getRef().getDBMain ();\n modelInbox = dbMain.newInboxModel ();\n\n QDeclarativeContext *ctx = pMainWindow->rootContext();\n ctx->setContextProperty (\"inboxModel\", modelInbox);\n prepView ();\n}\/\/GVHistory::initModel\n\nvoid\nGVHistory::prepView ()\n{\n CacheDatabase &dbMain = Singletons::getRef().getDBMain ();\n\n emit status (\"Re-selecting inbox entries. This will take some time\", 0);\n dbMain.refreshInboxModel (modelInbox, strSelectedMessages);\n\n while (modelInbox->canFetchMore ()) {\n modelInbox->fetchMore ();\n }\n emit status (\"Inbox entries selected.\");\n}\/\/GVHistory::prepView\n\nvoid\nGVHistory::refreshHistory ()\n{\n QMutexLocker locker(&mutex);\n if (!bLoggedIn)\n {\n return;\n }\n\n CacheDatabase &dbMain = Singletons::getRef().getDBMain ();\n QDateTime dtUpdate;\n dbMain.getLastInboxUpdate (dtUpdate);\n\n GVAccess &webPage = Singletons::getRef().getGVAccess ();\n QVariantList l;\n l += \"all\";\n l += \"1\";\n l += \"10\";\n l += dtUpdate;\n QObject::connect (\n &webPage, SIGNAL (oneHistoryEvent (const GVHistoryEvent &)),\n this , SLOT (oneHistoryEvent (const GVHistoryEvent &)));\n emit status (\"Retrieving Inbox...\", 0);\n if (!webPage.enqueueWork (GVAW_getInbox, l, this,\n SLOT (getHistoryDone (bool, const QVariantList &))))\n {\n getHistoryDone (false, l);\n }\n}\/\/GVHistory::refreshHistory\n\nvoid\nGVHistory::refreshFullInbox ()\n{\n CacheDatabase &dbMain = Singletons::getRef().getDBMain ();\n dbMain.setLastInboxUpdate (QDateTime::fromString (\"2000-01-01\",\n \"yyyy-MM-dd\"));\n refreshHistory ();\n}\/\/GVHistory::refreshFullInbox\n\nvoid\nGVHistory::oneHistoryEvent (const GVHistoryEvent &hevent)\n{\n QString strType = modelInbox->type_to_string (hevent.Type);\n if (0 == strType.size ())\n {\n return;\n }\n\n CacheDatabase &dbMain = Singletons::getRef().getDBMain ();\n dbMain.insertHistory (hevent);\n}\/\/GVHistory::oneHistoryEvent\n\nvoid\nGVHistory::getHistoryDone (bool, const QVariantList &)\n{\n emit status (\"Inbox retrieved. Sorting...\", 0);\n\n GVAccess &webPage = Singletons::getRef().getGVAccess ();\n QObject::disconnect (\n &webPage, SIGNAL (oneHistoryEvent (const GVHistoryEvent &)),\n this , SLOT (oneHistoryEvent (const GVHistoryEvent &)));\n\n prepView ();\n\n CacheDatabase &dbMain = Singletons::getRef().getDBMain ();\n QDateTime dtUpdate;\n if (dbMain.getLatestInboxEntry (dtUpdate))\n {\n qDebug () << QString (\"Latest inbox entry is : %1\")\n .arg (dtUpdate.toString ());\n dbMain.setLastInboxUpdate (dtUpdate);\n }\n\n emit status (\"Inbox ready\");\n}\/\/GVHistory::getHistoryDone\n\nvoid\nGVHistory::onInboxSelected (const QString &strSelection)\n{\n QMutexLocker locker(&mutex);\n if (!bLoggedIn)\n {\n return;\n }\n\n strSelectedMessages = strSelection.toLower ();\n refreshHistory ();\n}\/\/GVHistory::onInboxSelected\n\nvoid\nGVHistory::loginSuccess ()\n{\n QMutexLocker locker(&mutex);\n bLoggedIn = true;\n}\/\/GVHistory::loginSuccess\n\nvoid\nGVHistory::loggedOut ()\n{\n QMutexLocker locker(&mutex);\n bLoggedIn = false;\n}\/\/GVHistory::loggedOut\n<|endoftext|>"} {"text":"<commit_before>#include \"Generator.h\"\n\nnamespace {\n\n\/\/ Return true iff the name is valid for Generators or Params.\n\/\/ (NOTE: gcc didn't add proper std::regex support until v4.9;\n\/\/ we don't yet require this, hence the hand-rolled replacement.)\n\nbool is_alpha(char c) { return (c >= 'A' && c <= 'Z') || (c >= 'a' && c <= 'z'); }\n\n\/\/ Note that this includes '_'\nbool is_alnum(char c) { return is_alpha(c) || (c == '_') || (c >= '0' && c <= '9'); }\n\n\/\/ Basically, a valid C identifier, except:\n\/\/\n\/\/ -- initial _ is forbidden (rather than merely \"reserved\")\n\/\/ -- two underscores in a row is also forbidden\nbool is_valid_name(const std::string& n) {\n if (n.empty()) return false;\n if (!is_alpha(n[0])) return false;\n for (size_t i = 1; i < n.size(); ++i) {\n if (!is_alnum(n[i])) return false;\n if (n[i] == '_' && n[i-1] == '_') return false;\n }\n return true;\n}\n\n} \/\/ namespace\n\nnamespace Halide {\nnamespace Internal {\n\nconst std::map<std::string, Halide::Type> &get_halide_type_enum_map() {\n static const std::map<std::string, Halide::Type> halide_type_enum_map{\n {\"int8\", Halide::Int(8)},\n {\"int16\", Halide::Int(16)},\n {\"int32\", Halide::Int(32)},\n {\"uint8\", Halide::UInt(8)},\n {\"uint16\", Halide::UInt(16)},\n {\"uint32\", Halide::UInt(32)},\n {\"float32\", Halide::Float(32)},\n {\"float64\", Halide::Float(64)}\n };\n return halide_type_enum_map;\n}\n\nint generate_filter_main(int argc, char **argv, std::ostream &cerr) {\n const char kUsage[] = \"gengen [-g GENERATOR_NAME] [-f FUNCTION_NAME] [-o OUTPUT_DIR] [-e EMIT_OPTIONS] \"\n \"target=target-string [generator_arg=value [...]]\\n\\n\"\n \" -e A comma separated list of optional files to emit. Accepted values are \"\n \"[assembly, bitcode, stmt, html]\\n\";\n\n std::map<std::string, std::string> flags_info = { { \"-f\", \"\" }, { \"-g\", \"\" }, { \"-o\", \"\" }, { \"-e\", \"\" } };\n std::map<std::string, std::string> generator_args;\n\n for (int i = 1; i < argc; ++i) {\n if (argv[i][0] != '-') {\n std::vector<std::string> v = split_string(argv[i], \"=\");\n if (v.size() != 2 || v[0].empty() || v[1].empty()) {\n cerr << kUsage;\n return 1;\n }\n generator_args[v[0]] = v[1];\n continue;\n }\n auto it = flags_info.find(argv[i]);\n if (it != flags_info.end()) {\n if (i + 1 >= argc) {\n cerr << kUsage;\n return 1;\n }\n it->second = argv[i + 1];\n ++i;\n continue;\n }\n cerr << \"Unknown flag: \" << argv[i] << \"\\n\";\n cerr << kUsage;\n return 1;\n }\n\n std::vector<std::string> generator_names = GeneratorRegistry::enumerate();\n if (generator_names.size() == 0) {\n cerr << \"No generators have been registered\\n\";\n cerr << kUsage;\n return 1;\n }\n\n std::string generator_name = flags_info[\"-g\"];\n if (generator_name.empty()) {\n \/\/ If -g isn't specified, but there's only one generator registered, just use that one.\n if (generator_names.size() != 1) {\n cerr << \"-g must be specified if multiple generators are registered:\\n\";\n for (auto name : generator_names) {\n cerr << \" \" << name << \"\\n\";\n }\n cerr << kUsage;\n return 1;\n }\n generator_name = generator_names[0];\n }\n std::string function_name = flags_info[\"-f\"];\n if (function_name.empty()) {\n \/\/ If -f isn't specified, assume function name = generator name.\n function_name = generator_name;\n }\n std::string output_dir = flags_info[\"-o\"];\n if (output_dir.empty()) {\n cerr << \"-o must always be specified.\\n\";\n cerr << kUsage;\n return 1;\n }\n if (generator_args.find(\"target\") == generator_args.end()) {\n cerr << \"Target missing\\n\";\n cerr << kUsage;\n return 1;\n }\n GeneratorBase::EmitOptions emit_options;\n std::vector<std::string> emit_flags = split_string(flags_info[\"-e\"], \",\");\n for (const std::string &opt : emit_flags) {\n if (opt == \"assembly\") {\n emit_options.emit_assembly = true;\n } else if (opt == \"bitcode\") {\n emit_options.emit_bitcode = true;\n } else if (opt == \"stmt\") {\n emit_options.emit_stmt = true;\n } else if (opt == \"html\") {\n emit_options.emit_stmt_html = true;\n } else if (!opt.empty()) {\n cerr << \"Unrecognized emit option: \" << opt\n << \" not one of [assembly, bitcode, stmt, html], ignoring.\\n\";\n }\n }\n\n std::unique_ptr<GeneratorBase> gen = GeneratorRegistry::create(generator_name, generator_args);\n if (gen == nullptr) {\n cerr << \"Unknown generator: \" << generator_name << \"\\n\";\n cerr << kUsage;\n return 1;\n }\n gen->emit_filter(output_dir, function_name, function_name, emit_options);\n return 0;\n}\n\nGeneratorParamBase::GeneratorParamBase(const std::string &name) : name(name) {\n ObjectInstanceRegistry::register_instance(this, 0, ObjectInstanceRegistry::GeneratorParam,\n this, nullptr);\n}\n\nGeneratorParamBase::GeneratorParamBase(const GeneratorParamBase &that) : name(that.name) {\n ObjectInstanceRegistry::register_instance(this, 0, ObjectInstanceRegistry::GeneratorParam,\n this, nullptr);\n}\n\nGeneratorParamBase::~GeneratorParamBase() { ObjectInstanceRegistry::unregister_instance(this); }\n\n\/* static *\/\nGeneratorRegistry &GeneratorRegistry::get_registry() {\n static GeneratorRegistry *registry = new GeneratorRegistry;\n return *registry;\n}\n\n\/* static *\/\nvoid GeneratorRegistry::register_factory(const std::string &name,\n std::unique_ptr<GeneratorFactory> factory) {\n user_assert(is_valid_name(name)) << \"Invalid Generator name: \" << name;\n GeneratorRegistry ®istry = get_registry();\n std::lock_guard<std::mutex> lock(registry.mutex);\n internal_assert(registry.factories.find(name) == registry.factories.end())\n << \"Duplicate Generator name: \" << name;\n registry.factories[name] = std::move(factory);\n}\n\n\/* static *\/\nvoid GeneratorRegistry::unregister_factory(const std::string &name) {\n GeneratorRegistry ®istry = get_registry();\n std::lock_guard<std::mutex> lock(registry.mutex);\n internal_assert(registry.factories.find(name) != registry.factories.end())\n << \"Generator not found: \" << name;\n registry.factories.erase(name);\n}\n\n\/* static *\/\nstd::unique_ptr<GeneratorBase> GeneratorRegistry::create(const std::string &name,\n const GeneratorParamValues ¶ms) {\n GeneratorRegistry ®istry = get_registry();\n std::lock_guard<std::mutex> lock(registry.mutex);\n auto it = registry.factories.find(name);\n user_assert(it != registry.factories.end()) << \"Generator not found: \" << name;\n return it->second->create(params);\n}\n\n\/* static *\/\nstd::vector<std::string> GeneratorRegistry::enumerate() {\n GeneratorRegistry ®istry = get_registry();\n std::lock_guard<std::mutex> lock(registry.mutex);\n std::vector<std::string> result;\n for (const auto& i : registry.factories) {\n result.push_back(i.first);\n }\n return result;\n}\n\nGeneratorBase::GeneratorBase(size_t size, const void *introspection_helper) : size(size), params_built(false) {\n ObjectInstanceRegistry::register_instance(this, size, ObjectInstanceRegistry::Generator, this, introspection_helper);\n}\n\nGeneratorBase::~GeneratorBase() { ObjectInstanceRegistry::unregister_instance(this); }\n\nvoid GeneratorBase::build_params() {\n if (!params_built) {\n std::vector<void *> vf = ObjectInstanceRegistry::instances_in_range(\n this, size, ObjectInstanceRegistry::FilterParam);\n for (size_t i = 0; i < vf.size(); ++i) {\n Parameter *param = static_cast<Parameter *>(vf[i]);\n internal_assert(param != nullptr);\n user_assert(param->is_explicit_name()) << \"Params in Generators must have explicit names: \" << param->name();\n user_assert(is_valid_name(param->name())) << \"Invalid Param name: \" << param->name();\n user_assert(filter_params.find(param->name()) == filter_params.end())\n << \"Duplicate Param name: \" << param->name();\n Expr def, min, max;\n if (!param->is_buffer()) {\n def = param->get_scalar_expr();\n min = param->get_min_value();\n max = param->get_max_value();\n }\n filter_params[param->name()] = param;\n filter_arguments.push_back(Argument(param->name(),\n param->is_buffer() ? Argument::InputBuffer : Argument::InputScalar,\n param->type(), param->dimensions(), def, min, max));\n }\n\n std::vector<void *> vg = ObjectInstanceRegistry::instances_in_range(\n this, size, ObjectInstanceRegistry::GeneratorParam);\n for (size_t i = 0; i < vg.size(); ++i) {\n GeneratorParamBase *param = static_cast<GeneratorParamBase *>(vg[i]);\n internal_assert(param != nullptr);\n user_assert(is_valid_name(param->name)) << \"Invalid GeneratorParam name: \" << param->name;\n user_assert(generator_params.find(param->name) == generator_params.end())\n << \"Duplicate GeneratorParam name: \" << param->name;\n generator_params[param->name] = param;\n }\n params_built = true;\n }\n}\n\nstd::vector<Internal::Parameter> GeneratorBase::get_filter_parameters() {\n build_params();\n std::vector<Internal::Parameter> result;\n for (size_t i = 0; i < filter_arguments.size(); ++i) {\n result.push_back(*filter_params[filter_arguments[i].name]);\n }\n return result;\n}\n\nGeneratorParamValues GeneratorBase::get_generator_param_values() {\n build_params();\n GeneratorParamValues results;\n for (auto key_value : generator_params) {\n GeneratorParamBase *param = key_value.second;\n results[param->name] = param->to_string();\n }\n return results;\n}\n\nvoid GeneratorBase::set_generator_param_values(const GeneratorParamValues ¶ms) {\n build_params();\n for (auto key_value : params) {\n const std::string &key = key_value.first;\n const std::string &value = key_value.second;\n auto param = generator_params.find(key);\n user_assert(param != generator_params.end())\n << \"Generator has no GeneratorParam named: \" << key;\n param->second->from_string(value);\n }\n}\n\nvoid GeneratorBase::emit_filter(const std::string &output_dir,\n const std::string &function_name,\n const std::string &file_base_name,\n const EmitOptions &options) {\n build_params();\n\n Func func = build();\n\n std::vector<Halide::Argument> inputs = get_filter_arguments();\n std::string base_path = output_dir + \"\/\" + (file_base_name.empty() ? function_name : file_base_name);\n if (options.emit_o || options.emit_assembly || options.emit_bitcode) {\n Outputs output_files;\n if (options.emit_o) {\n output_files.object_name = base_path + \".o\";\n }\n if (options.emit_assembly) {\n output_files.assembly_name = base_path + \".s\";\n }\n if (options.emit_bitcode) {\n output_files.bitcode_name = base_path + \".bc\";\n }\n func.compile_to(output_files, inputs, function_name, target);\n }\n if (options.emit_h) {\n func.compile_to_header(base_path + \".h\", inputs, function_name, target);\n }\n if (options.emit_cpp) {\n func.compile_to_c(base_path + \".cpp\", inputs, function_name, target);\n }\n if (options.emit_stmt) {\n func.compile_to_lowered_stmt(base_path + \".stmt\", inputs, Halide::Text, target);\n }\n if (options.emit_stmt_html) {\n func.compile_to_lowered_stmt(base_path + \".html\", inputs, Halide::HTML, target);\n }\n}\n\nFunc GeneratorBase::call_extern(std::initializer_list<ExternFuncArgument> function_arguments,\n std::string function_name){\n Func f = build();\n Func f_extern;\n if (function_name.empty()) {\n function_name = generator_name();\n user_assert(!function_name.empty()) << \"call_extern: generator_name is empty\";\n }\n f_extern.define_extern(function_name, function_arguments, f.output_types(), f.dimensions());\n return f_extern;\n}\n\nFunc GeneratorBase::call_extern_by_name(const std::string &generator_name,\n std::initializer_list<ExternFuncArgument> function_arguments,\n const std::string &function_name,\n const GeneratorParamValues &generator_params) {\n std::unique_ptr<GeneratorBase> extern_gen = GeneratorRegistry::create(generator_name, generator_params);\n user_assert(extern_gen != nullptr) << \"Unknown generator: \" << generator_name << \"\\n\";\n \/\/ Note that the Generator's target is not set; at present, this shouldn't matter for\n \/\/ define_extern() functions, since none of the linkage should vary by Target.\n return extern_gen->call_extern(function_arguments, function_name);\n}\n\n} \/\/ namespace Internal\n} \/\/ namespace Halide\n<commit_msg>Generator::emit_filter: special-case PNaCl output files<commit_after>#include \"Generator.h\"\n\nnamespace {\n\n\/\/ Return true iff the name is valid for Generators or Params.\n\/\/ (NOTE: gcc didn't add proper std::regex support until v4.9;\n\/\/ we don't yet require this, hence the hand-rolled replacement.)\n\nbool is_alpha(char c) { return (c >= 'A' && c <= 'Z') || (c >= 'a' && c <= 'z'); }\n\n\/\/ Note that this includes '_'\nbool is_alnum(char c) { return is_alpha(c) || (c == '_') || (c >= '0' && c <= '9'); }\n\n\/\/ Basically, a valid C identifier, except:\n\/\/\n\/\/ -- initial _ is forbidden (rather than merely \"reserved\")\n\/\/ -- two underscores in a row is also forbidden\nbool is_valid_name(const std::string& n) {\n if (n.empty()) return false;\n if (!is_alpha(n[0])) return false;\n for (size_t i = 1; i < n.size(); ++i) {\n if (!is_alnum(n[i])) return false;\n if (n[i] == '_' && n[i-1] == '_') return false;\n }\n return true;\n}\n\n} \/\/ namespace\n\nnamespace Halide {\nnamespace Internal {\n\nconst std::map<std::string, Halide::Type> &get_halide_type_enum_map() {\n static const std::map<std::string, Halide::Type> halide_type_enum_map{\n {\"int8\", Halide::Int(8)},\n {\"int16\", Halide::Int(16)},\n {\"int32\", Halide::Int(32)},\n {\"uint8\", Halide::UInt(8)},\n {\"uint16\", Halide::UInt(16)},\n {\"uint32\", Halide::UInt(32)},\n {\"float32\", Halide::Float(32)},\n {\"float64\", Halide::Float(64)}\n };\n return halide_type_enum_map;\n}\n\nint generate_filter_main(int argc, char **argv, std::ostream &cerr) {\n const char kUsage[] = \"gengen [-g GENERATOR_NAME] [-f FUNCTION_NAME] [-o OUTPUT_DIR] [-e EMIT_OPTIONS] \"\n \"target=target-string [generator_arg=value [...]]\\n\\n\"\n \" -e A comma separated list of optional files to emit. Accepted values are \"\n \"[assembly, bitcode, stmt, html]\\n\";\n\n std::map<std::string, std::string> flags_info = { { \"-f\", \"\" }, { \"-g\", \"\" }, { \"-o\", \"\" }, { \"-e\", \"\" } };\n std::map<std::string, std::string> generator_args;\n\n for (int i = 1; i < argc; ++i) {\n if (argv[i][0] != '-') {\n std::vector<std::string> v = split_string(argv[i], \"=\");\n if (v.size() != 2 || v[0].empty() || v[1].empty()) {\n cerr << kUsage;\n return 1;\n }\n generator_args[v[0]] = v[1];\n continue;\n }\n auto it = flags_info.find(argv[i]);\n if (it != flags_info.end()) {\n if (i + 1 >= argc) {\n cerr << kUsage;\n return 1;\n }\n it->second = argv[i + 1];\n ++i;\n continue;\n }\n cerr << \"Unknown flag: \" << argv[i] << \"\\n\";\n cerr << kUsage;\n return 1;\n }\n\n std::vector<std::string> generator_names = GeneratorRegistry::enumerate();\n if (generator_names.size() == 0) {\n cerr << \"No generators have been registered\\n\";\n cerr << kUsage;\n return 1;\n }\n\n std::string generator_name = flags_info[\"-g\"];\n if (generator_name.empty()) {\n \/\/ If -g isn't specified, but there's only one generator registered, just use that one.\n if (generator_names.size() != 1) {\n cerr << \"-g must be specified if multiple generators are registered:\\n\";\n for (auto name : generator_names) {\n cerr << \" \" << name << \"\\n\";\n }\n cerr << kUsage;\n return 1;\n }\n generator_name = generator_names[0];\n }\n std::string function_name = flags_info[\"-f\"];\n if (function_name.empty()) {\n \/\/ If -f isn't specified, assume function name = generator name.\n function_name = generator_name;\n }\n std::string output_dir = flags_info[\"-o\"];\n if (output_dir.empty()) {\n cerr << \"-o must always be specified.\\n\";\n cerr << kUsage;\n return 1;\n }\n if (generator_args.find(\"target\") == generator_args.end()) {\n cerr << \"Target missing\\n\";\n cerr << kUsage;\n return 1;\n }\n GeneratorBase::EmitOptions emit_options;\n std::vector<std::string> emit_flags = split_string(flags_info[\"-e\"], \",\");\n for (const std::string &opt : emit_flags) {\n if (opt == \"assembly\") {\n emit_options.emit_assembly = true;\n } else if (opt == \"bitcode\") {\n emit_options.emit_bitcode = true;\n } else if (opt == \"stmt\") {\n emit_options.emit_stmt = true;\n } else if (opt == \"html\") {\n emit_options.emit_stmt_html = true;\n } else if (!opt.empty()) {\n cerr << \"Unrecognized emit option: \" << opt\n << \" not one of [assembly, bitcode, stmt, html], ignoring.\\n\";\n }\n }\n\n std::unique_ptr<GeneratorBase> gen = GeneratorRegistry::create(generator_name, generator_args);\n if (gen == nullptr) {\n cerr << \"Unknown generator: \" << generator_name << \"\\n\";\n cerr << kUsage;\n return 1;\n }\n gen->emit_filter(output_dir, function_name, function_name, emit_options);\n return 0;\n}\n\nGeneratorParamBase::GeneratorParamBase(const std::string &name) : name(name) {\n ObjectInstanceRegistry::register_instance(this, 0, ObjectInstanceRegistry::GeneratorParam,\n this, nullptr);\n}\n\nGeneratorParamBase::GeneratorParamBase(const GeneratorParamBase &that) : name(that.name) {\n ObjectInstanceRegistry::register_instance(this, 0, ObjectInstanceRegistry::GeneratorParam,\n this, nullptr);\n}\n\nGeneratorParamBase::~GeneratorParamBase() { ObjectInstanceRegistry::unregister_instance(this); }\n\n\/* static *\/\nGeneratorRegistry &GeneratorRegistry::get_registry() {\n static GeneratorRegistry *registry = new GeneratorRegistry;\n return *registry;\n}\n\n\/* static *\/\nvoid GeneratorRegistry::register_factory(const std::string &name,\n std::unique_ptr<GeneratorFactory> factory) {\n user_assert(is_valid_name(name)) << \"Invalid Generator name: \" << name;\n GeneratorRegistry ®istry = get_registry();\n std::lock_guard<std::mutex> lock(registry.mutex);\n internal_assert(registry.factories.find(name) == registry.factories.end())\n << \"Duplicate Generator name: \" << name;\n registry.factories[name] = std::move(factory);\n}\n\n\/* static *\/\nvoid GeneratorRegistry::unregister_factory(const std::string &name) {\n GeneratorRegistry ®istry = get_registry();\n std::lock_guard<std::mutex> lock(registry.mutex);\n internal_assert(registry.factories.find(name) != registry.factories.end())\n << \"Generator not found: \" << name;\n registry.factories.erase(name);\n}\n\n\/* static *\/\nstd::unique_ptr<GeneratorBase> GeneratorRegistry::create(const std::string &name,\n const GeneratorParamValues ¶ms) {\n GeneratorRegistry ®istry = get_registry();\n std::lock_guard<std::mutex> lock(registry.mutex);\n auto it = registry.factories.find(name);\n user_assert(it != registry.factories.end()) << \"Generator not found: \" << name;\n return it->second->create(params);\n}\n\n\/* static *\/\nstd::vector<std::string> GeneratorRegistry::enumerate() {\n GeneratorRegistry ®istry = get_registry();\n std::lock_guard<std::mutex> lock(registry.mutex);\n std::vector<std::string> result;\n for (const auto& i : registry.factories) {\n result.push_back(i.first);\n }\n return result;\n}\n\nGeneratorBase::GeneratorBase(size_t size, const void *introspection_helper) : size(size), params_built(false) {\n ObjectInstanceRegistry::register_instance(this, size, ObjectInstanceRegistry::Generator, this, introspection_helper);\n}\n\nGeneratorBase::~GeneratorBase() { ObjectInstanceRegistry::unregister_instance(this); }\n\nvoid GeneratorBase::build_params() {\n if (!params_built) {\n std::vector<void *> vf = ObjectInstanceRegistry::instances_in_range(\n this, size, ObjectInstanceRegistry::FilterParam);\n for (size_t i = 0; i < vf.size(); ++i) {\n Parameter *param = static_cast<Parameter *>(vf[i]);\n internal_assert(param != nullptr);\n user_assert(param->is_explicit_name()) << \"Params in Generators must have explicit names: \" << param->name();\n user_assert(is_valid_name(param->name())) << \"Invalid Param name: \" << param->name();\n user_assert(filter_params.find(param->name()) == filter_params.end())\n << \"Duplicate Param name: \" << param->name();\n Expr def, min, max;\n if (!param->is_buffer()) {\n def = param->get_scalar_expr();\n min = param->get_min_value();\n max = param->get_max_value();\n }\n filter_params[param->name()] = param;\n filter_arguments.push_back(Argument(param->name(),\n param->is_buffer() ? Argument::InputBuffer : Argument::InputScalar,\n param->type(), param->dimensions(), def, min, max));\n }\n\n std::vector<void *> vg = ObjectInstanceRegistry::instances_in_range(\n this, size, ObjectInstanceRegistry::GeneratorParam);\n for (size_t i = 0; i < vg.size(); ++i) {\n GeneratorParamBase *param = static_cast<GeneratorParamBase *>(vg[i]);\n internal_assert(param != nullptr);\n user_assert(is_valid_name(param->name)) << \"Invalid GeneratorParam name: \" << param->name;\n user_assert(generator_params.find(param->name) == generator_params.end())\n << \"Duplicate GeneratorParam name: \" << param->name;\n generator_params[param->name] = param;\n }\n params_built = true;\n }\n}\n\nstd::vector<Internal::Parameter> GeneratorBase::get_filter_parameters() {\n build_params();\n std::vector<Internal::Parameter> result;\n for (size_t i = 0; i < filter_arguments.size(); ++i) {\n result.push_back(*filter_params[filter_arguments[i].name]);\n }\n return result;\n}\n\nGeneratorParamValues GeneratorBase::get_generator_param_values() {\n build_params();\n GeneratorParamValues results;\n for (auto key_value : generator_params) {\n GeneratorParamBase *param = key_value.second;\n results[param->name] = param->to_string();\n }\n return results;\n}\n\nvoid GeneratorBase::set_generator_param_values(const GeneratorParamValues ¶ms) {\n build_params();\n for (auto key_value : params) {\n const std::string &key = key_value.first;\n const std::string &value = key_value.second;\n auto param = generator_params.find(key);\n user_assert(param != generator_params.end())\n << \"Generator has no GeneratorParam named: \" << key;\n param->second->from_string(value);\n }\n}\n\nvoid GeneratorBase::emit_filter(const std::string &output_dir,\n const std::string &function_name,\n const std::string &file_base_name,\n const EmitOptions &options) {\n build_params();\n\n Func func = build();\n\n std::vector<Halide::Argument> inputs = get_filter_arguments();\n std::string base_path = output_dir + \"\/\" + (file_base_name.empty() ? function_name : file_base_name);\n if (options.emit_o || options.emit_assembly || options.emit_bitcode) {\n Outputs output_files;\n if (options.emit_o) {\n \/\/ If the target arch is pnacl, then the output \"object\" file is\n \/\/ actually a pnacl bitcode file.\n if (Target(target).arch == Target::PNaCl) {\n output_files.object_name = base_path + \".bc\";\n } else {\n \/\/ Otherwise it is an ordinary object file\n output_files.object_name = base_path + \".o\";\n }\n }\n if (options.emit_assembly) {\n output_files.assembly_name = base_path + \".s\";\n }\n if (options.emit_bitcode) {\n \/\/ In this case, bitcode refers to the LLVM IR generated by Halide\n \/\/ and passed to LLVM, for both the pnacl and ordinary archs\n output_files.bitcode_name = base_path + \".bc\";\n }\n func.compile_to(output_files, inputs, function_name, target);\n }\n if (options.emit_h) {\n func.compile_to_header(base_path + \".h\", inputs, function_name, target);\n }\n if (options.emit_cpp) {\n func.compile_to_c(base_path + \".cpp\", inputs, function_name, target);\n }\n if (options.emit_stmt) {\n func.compile_to_lowered_stmt(base_path + \".stmt\", inputs, Halide::Text, target);\n }\n if (options.emit_stmt_html) {\n func.compile_to_lowered_stmt(base_path + \".html\", inputs, Halide::HTML, target);\n }\n}\n\nFunc GeneratorBase::call_extern(std::initializer_list<ExternFuncArgument> function_arguments,\n std::string function_name){\n Func f = build();\n Func f_extern;\n if (function_name.empty()) {\n function_name = generator_name();\n user_assert(!function_name.empty()) << \"call_extern: generator_name is empty\";\n }\n f_extern.define_extern(function_name, function_arguments, f.output_types(), f.dimensions());\n return f_extern;\n}\n\nFunc GeneratorBase::call_extern_by_name(const std::string &generator_name,\n std::initializer_list<ExternFuncArgument> function_arguments,\n const std::string &function_name,\n const GeneratorParamValues &generator_params) {\n std::unique_ptr<GeneratorBase> extern_gen = GeneratorRegistry::create(generator_name, generator_params);\n user_assert(extern_gen != nullptr) << \"Unknown generator: \" << generator_name << \"\\n\";\n \/\/ Note that the Generator's target is not set; at present, this shouldn't matter for\n \/\/ define_extern() functions, since none of the linkage should vary by Target.\n return extern_gen->call_extern(function_arguments, function_name);\n}\n\n} \/\/ namespace Internal\n} \/\/ namespace Halide\n<|endoftext|>"} {"text":"<commit_before>\/\/ Scintilla source code edit control\n\/** @file LexEiffel.cxx\n ** Lexer for Eiffel.\n **\/\n\/\/ Copyright 1998-2001 by Neil Hodgson <neilh@scintilla.org>\n\/\/ The License.txt file describes the conditions under which this software may be distributed.\n\n#include <stdlib.h>\n#include <string.h>\n#include <ctype.h>\n#include <stdarg.h>\n#include <stdio.h>\n#include <fcntl.h>\n\n#include \"Platform.h\"\n\n#include \"PropSet.h\"\n#include \"Accessor.h\"\n#include \"StyleContext.h\"\n#include \"KeyWords.h\"\n#include \"Scintilla.h\"\n#include \"SciLexer.h\"\n\nstatic inline bool isEiffelOperator(unsigned int ch) {\n\t\/\/ '.' left out as it is used to make up numbers\n\treturn ch == '*' || ch == '\/' || ch == '\\\\' || ch == '-' || ch == '+' ||\n\t ch == '(' || ch == ')' || ch == '=' ||\n\t ch == '{' || ch == '}' || ch == '~' ||\n\t ch == '[' || ch == ']' || ch == ';' ||\n\t ch == '<' || ch == '>' || ch == ',' ||\n\t ch == '.' || ch == '^' || ch == '%' || ch == ':' ||\n\t\tch == '!' || ch == '@' || ch == '?';\n}\n\nstatic inline bool IsAWordChar(unsigned int ch) {\n\treturn (ch < 0x80) && (isalnum(ch) || ch == '.' || ch == '_');\n}\n\nstatic inline bool IsAWordStart(unsigned int ch) {\n\treturn (ch < 0x80) && (isalnum(ch) || ch == '_');\n}\n\nstatic void ColouriseEiffelDoc(unsigned int startPos,\n int length,\n int initStyle,\n WordList *keywordlists[],\n Accessor &styler) {\n\n\tWordList &keywords = *keywordlists[0];\n\n\tStyleContext sc(startPos, length, initStyle, styler);\n\n\tfor (; sc.More(); sc.Forward()) {\n\n\t\tif (sc.state == SCE_EIFFEL_STRINGEOL) {\n\t\t\tif (sc.ch != '\\r' && sc.ch != '\\n') {\n\t\t\t\tsc.SetState(SCE_EIFFEL_DEFAULT);\n\t\t\t}\n\t\t} else if (sc.state == SCE_EIFFEL_OPERATOR) {\n\t\t\tsc.SetState(SCE_EIFFEL_DEFAULT);\n\t\t} else if (sc.state == SCE_EIFFEL_WORD) {\n\t\t\tif (!IsAWordChar(sc.ch)) {\n\t\t\t\tchar s[100];\n\t\t\t\tsc.GetCurrentLowered(s, sizeof(s));\n\t\t\t\tif (!keywords.InList(s)) {\n\t\t\t\t\tsc.ChangeState(SCE_EIFFEL_IDENTIFIER);\n\t\t\t\t}\n\t\t\t\tsc.SetState(SCE_EIFFEL_DEFAULT);\n\t\t\t}\n\t\t} else if (sc.state == SCE_EIFFEL_NUMBER) {\n\t\t\tif (!IsAWordChar(sc.ch)) {\n\t\t\t\tsc.SetState(SCE_EIFFEL_DEFAULT);\n\t\t\t}\n\t\t} else if (sc.state == SCE_EIFFEL_COMMENTLINE) {\n\t\t\tif (sc.ch == '\\r' || sc.ch == '\\n') {\n\t\t\t\tsc.SetState(SCE_EIFFEL_DEFAULT);\n\t\t\t}\n\t\t} else if (sc.state == SCE_EIFFEL_STRING) {\n\t\t\tif (sc.ch == '%') {\n\t\t\t\tsc.Forward();\n\t\t\t} else if (sc.ch == '\\\"') {\n\t\t\t\tsc.Forward();\n\t\t\t\tsc.SetState(SCE_EIFFEL_DEFAULT);\n\t\t\t}\n\t\t} else if (sc.state == SCE_EIFFEL_CHARACTER) {\n\t\t\tif (sc.ch == '\\r' || sc.ch == '\\n') {\n\t\t\t\tsc.SetState(SCE_EIFFEL_STRINGEOL);\n\t\t\t} else if (sc.ch == '%') {\n\t\t\t\tsc.Forward();\n\t\t\t} else if (sc.ch == '\\'') {\n\t\t\t\tsc.Forward();\n\t\t\t\tsc.SetState(SCE_EIFFEL_DEFAULT);\n\t\t\t}\n\t\t}\n\n\t\tif (sc.state == SCE_EIFFEL_DEFAULT) {\n\t\t\tif (sc.ch == '-' && sc.chNext == '-') {\n\t\t\t\tsc.SetState(SCE_EIFFEL_COMMENTLINE);\n\t\t\t} else if (sc.ch == '\\\"') {\n\t\t\t\tsc.SetState(SCE_EIFFEL_STRING);\n\t\t\t} else if (sc.ch == '\\'') {\n\t\t\t\tsc.SetState(SCE_EIFFEL_CHARACTER);\n\t\t\t} else if (IsADigit(sc.ch) || (sc.ch == '.')) {\n\t\t\t\tsc.SetState(SCE_EIFFEL_NUMBER);\n\t\t\t} else if (IsAWordStart(sc.ch)) {\n\t\t\t\tsc.SetState(SCE_EIFFEL_WORD);\n\t\t\t} else if (isEiffelOperator(sc.ch)) {\n\t\t\t\tsc.SetState(SCE_EIFFEL_OPERATOR);\n\t\t\t}\n\t\t}\n\t}\n\tsc.Complete();\n}\n\nstatic bool IsEiffelComment(Accessor &styler, int pos, int len) {\n\treturn len>1 && styler[pos]=='-' && styler[pos+1]=='-';\n}\n\nstatic void FoldEiffelDocIndent(unsigned int startPos, int length, int,\n\t\t\t\t\t\t WordList *[], Accessor &styler) {\n\tint lengthDoc = startPos + length;\n\n\t\/\/ Backtrack to previous line in case need to fix its fold status\n\tint lineCurrent = styler.GetLine(startPos);\n\tif (startPos > 0) {\n\t\tif (lineCurrent > 0) {\n\t\t\tlineCurrent--;\n\t\t\tstartPos = styler.LineStart(lineCurrent);\n\t\t}\n\t}\n\tint spaceFlags = 0;\n\tint indentCurrent = styler.IndentAmount(lineCurrent, &spaceFlags, IsEiffelComment);\n\tchar chNext = styler[startPos];\n\tfor (int i = startPos; i < lengthDoc; i++) {\n\t\tchar ch = chNext;\n\t\tchNext = styler.SafeGetCharAt(i + 1);\n\n\t\tif ((ch == '\\r' && chNext != '\\n') || (ch == '\\n') || (i == lengthDoc)) {\n\t\t\tint lev = indentCurrent;\n\t\t\tint indentNext = styler.IndentAmount(lineCurrent + 1, &spaceFlags, IsEiffelComment);\n\t\t\tif (!(indentCurrent & SC_FOLDLEVELWHITEFLAG)) {\n\t\t\t\t\/\/ Only non whitespace lines can be headers\n\t\t\t\tif ((indentCurrent & SC_FOLDLEVELNUMBERMASK) < (indentNext & SC_FOLDLEVELNUMBERMASK)) {\n\t\t\t\t\tlev |= SC_FOLDLEVELHEADERFLAG;\n\t\t\t\t} else if (indentNext & SC_FOLDLEVELWHITEFLAG) {\n\t\t\t\t\t\/\/ Line after is blank so check the next - maybe should continue further?\n\t\t\t\t\tint spaceFlags2 = 0;\n\t\t\t\t\tint indentNext2 = styler.IndentAmount(lineCurrent + 2, &spaceFlags2, IsEiffelComment);\n\t\t\t\t\tif ((indentCurrent & SC_FOLDLEVELNUMBERMASK) < (indentNext2 & SC_FOLDLEVELNUMBERMASK)) {\n\t\t\t\t\t\tlev |= SC_FOLDLEVELHEADERFLAG;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t\tindentCurrent = indentNext;\n\t\t\tstyler.SetLevel(lineCurrent, lev);\n\t\t\tlineCurrent++;\n\t\t}\n\t}\n}\n\nstatic void FoldEiffelDocKeyWords(unsigned int startPos, int length, int \/* initStyle *\/, WordList *[],\n Accessor &styler) {\n\tunsigned int lengthDoc = startPos + length;\n\tint visibleChars = 0;\n\tint lineCurrent = styler.GetLine(startPos);\n\tint levelPrev = styler.LevelAt(lineCurrent) & SC_FOLDLEVELNUMBERMASK;\n\tint levelCurrent = levelPrev;\n\tchar chNext = styler[startPos];\n\tint stylePrev = 0;\n\tint styleNext = styler.StyleAt(startPos);\n\t\/\/ lastDeferred should be determined by looking back to last keyword in case\n\t\/\/ the \"deferred\" is on a line before \"class\"\n\tbool lastDeferred = false;\n\tfor (unsigned int i = startPos; i < lengthDoc; i++) {\n\t\tchar ch = chNext;\n\t\tchNext = styler.SafeGetCharAt(i + 1);\n\t\tint style = styleNext;\n\t\tstyleNext = styler.StyleAt(i + 1);\n\t\tbool atEOL = (ch == '\\r' && chNext != '\\n') || (ch == '\\n');\n\t\tif ((stylePrev != SCE_EIFFEL_WORD) && (style == SCE_EIFFEL_WORD)) {\n\t\t\tchar s[20];\n\t\t\tunsigned int j = 0;\n\t\t\twhile ((j < (sizeof(s) - 1)) && (iswordchar(styler[i + j]))) {\n\t\t\t\ts[j] = styler[i + j];\n\t\t\t\tj++;\n\t\t\t}\n\t\t\ts[j] = '\\0';\n\n\t\t\tif (\n\t\t\t\t(strcmp(s, \"check\") == 0) ||\n\t\t\t\t(strcmp(s, \"debug\") == 0) ||\n\t\t\t\t(strcmp(s, \"deferred\") == 0) ||\n\t\t\t\t(strcmp(s, \"do\") == 0) ||\n\t\t\t\t(strcmp(s, \"from\") == 0) ||\n\t\t\t\t(strcmp(s, \"if\") == 0) ||\n\t\t\t\t(strcmp(s, \"inspect\") == 0) ||\n\t\t\t\t(strcmp(s, \"once\") == 0)\n\t\t\t)\n\t\t\t\tlevelCurrent++;\n\t\t\tif (!lastDeferred && (strcmp(s, \"class\") == 0))\n\t\t\t\tlevelCurrent++;\n\t\t\tif (strcmp(s, \"end\") == 0)\n\t\t\t\tlevelCurrent--;\n\t\t\tlastDeferred = strcmp(s, \"deferred\") == 0;\n\t\t}\n\n\t\tif (atEOL) {\n\t\t\tint lev = levelPrev;\n\t\t\tif (visibleChars == 0)\n\t\t\t\tlev |= SC_FOLDLEVELWHITEFLAG;\n\t\t\tif ((levelCurrent > levelPrev) && (visibleChars > 0))\n\t\t\t\tlev |= SC_FOLDLEVELHEADERFLAG;\n\t\t\tif (lev != styler.LevelAt(lineCurrent)) {\n\t\t\t\tstyler.SetLevel(lineCurrent, lev);\n\t\t\t}\n\t\t\tlineCurrent++;\n\t\t\tlevelPrev = levelCurrent;\n\t\t\tvisibleChars = 0;\n\t\t}\n\t\tif (!isspacechar(ch))\n\t\t\tvisibleChars++;\n\t\tstylePrev = style;\n\t}\n\t\/\/ Fill in the real level of the next line, keeping the current flags as they will be filled in later\n\tint flagsNext = styler.LevelAt(lineCurrent) & ~SC_FOLDLEVELNUMBERMASK;\n\tstyler.SetLevel(lineCurrent, levelPrev | flagsNext);\n}\n\nstatic const char * const eiffelWordListDesc[] = {\n\t\"Keywords\",\n\t0\n};\n\nLexerModule lmEiffel(SCLEX_EIFFEL, ColouriseEiffelDoc, \"eiffel\", FoldEiffelDocIndent, eiffelWordListDesc);\nLexerModule lmEiffelkw(SCLEX_EIFFELKW, ColouriseEiffelDoc, \"eiffelkw\", FoldEiffelDocKeyWords, eiffelWordListDesc);\n<commit_msg>Patch from Regis Vaquette to allow compilation for Windows CE.<commit_after>\/\/ Scintilla source code edit control\n\/** @file LexEiffel.cxx\n ** Lexer for Eiffel.\n **\/\n\/\/ Copyright 1998-2001 by Neil Hodgson <neilh@scintilla.org>\n\/\/ The License.txt file describes the conditions under which this software may be distributed.\n\n#include <stdlib.h>\n#include <string.h>\n#include <ctype.h>\n#include <stdarg.h>\n#include <stdio.h>\n\n#include \"Platform.h\"\n\n#include \"PropSet.h\"\n#include \"Accessor.h\"\n#include \"StyleContext.h\"\n#include \"KeyWords.h\"\n#include \"Scintilla.h\"\n#include \"SciLexer.h\"\n\nstatic inline bool isEiffelOperator(unsigned int ch) {\n\t\/\/ '.' left out as it is used to make up numbers\n\treturn ch == '*' || ch == '\/' || ch == '\\\\' || ch == '-' || ch == '+' ||\n\t ch == '(' || ch == ')' || ch == '=' ||\n\t ch == '{' || ch == '}' || ch == '~' ||\n\t ch == '[' || ch == ']' || ch == ';' ||\n\t ch == '<' || ch == '>' || ch == ',' ||\n\t ch == '.' || ch == '^' || ch == '%' || ch == ':' ||\n\t\tch == '!' || ch == '@' || ch == '?';\n}\n\nstatic inline bool IsAWordChar(unsigned int ch) {\n\treturn (ch < 0x80) && (isalnum(ch) || ch == '.' || ch == '_');\n}\n\nstatic inline bool IsAWordStart(unsigned int ch) {\n\treturn (ch < 0x80) && (isalnum(ch) || ch == '_');\n}\n\nstatic void ColouriseEiffelDoc(unsigned int startPos,\n int length,\n int initStyle,\n WordList *keywordlists[],\n Accessor &styler) {\n\n\tWordList &keywords = *keywordlists[0];\n\n\tStyleContext sc(startPos, length, initStyle, styler);\n\n\tfor (; sc.More(); sc.Forward()) {\n\n\t\tif (sc.state == SCE_EIFFEL_STRINGEOL) {\n\t\t\tif (sc.ch != '\\r' && sc.ch != '\\n') {\n\t\t\t\tsc.SetState(SCE_EIFFEL_DEFAULT);\n\t\t\t}\n\t\t} else if (sc.state == SCE_EIFFEL_OPERATOR) {\n\t\t\tsc.SetState(SCE_EIFFEL_DEFAULT);\n\t\t} else if (sc.state == SCE_EIFFEL_WORD) {\n\t\t\tif (!IsAWordChar(sc.ch)) {\n\t\t\t\tchar s[100];\n\t\t\t\tsc.GetCurrentLowered(s, sizeof(s));\n\t\t\t\tif (!keywords.InList(s)) {\n\t\t\t\t\tsc.ChangeState(SCE_EIFFEL_IDENTIFIER);\n\t\t\t\t}\n\t\t\t\tsc.SetState(SCE_EIFFEL_DEFAULT);\n\t\t\t}\n\t\t} else if (sc.state == SCE_EIFFEL_NUMBER) {\n\t\t\tif (!IsAWordChar(sc.ch)) {\n\t\t\t\tsc.SetState(SCE_EIFFEL_DEFAULT);\n\t\t\t}\n\t\t} else if (sc.state == SCE_EIFFEL_COMMENTLINE) {\n\t\t\tif (sc.ch == '\\r' || sc.ch == '\\n') {\n\t\t\t\tsc.SetState(SCE_EIFFEL_DEFAULT);\n\t\t\t}\n\t\t} else if (sc.state == SCE_EIFFEL_STRING) {\n\t\t\tif (sc.ch == '%') {\n\t\t\t\tsc.Forward();\n\t\t\t} else if (sc.ch == '\\\"') {\n\t\t\t\tsc.Forward();\n\t\t\t\tsc.SetState(SCE_EIFFEL_DEFAULT);\n\t\t\t}\n\t\t} else if (sc.state == SCE_EIFFEL_CHARACTER) {\n\t\t\tif (sc.ch == '\\r' || sc.ch == '\\n') {\n\t\t\t\tsc.SetState(SCE_EIFFEL_STRINGEOL);\n\t\t\t} else if (sc.ch == '%') {\n\t\t\t\tsc.Forward();\n\t\t\t} else if (sc.ch == '\\'') {\n\t\t\t\tsc.Forward();\n\t\t\t\tsc.SetState(SCE_EIFFEL_DEFAULT);\n\t\t\t}\n\t\t}\n\n\t\tif (sc.state == SCE_EIFFEL_DEFAULT) {\n\t\t\tif (sc.ch == '-' && sc.chNext == '-') {\n\t\t\t\tsc.SetState(SCE_EIFFEL_COMMENTLINE);\n\t\t\t} else if (sc.ch == '\\\"') {\n\t\t\t\tsc.SetState(SCE_EIFFEL_STRING);\n\t\t\t} else if (sc.ch == '\\'') {\n\t\t\t\tsc.SetState(SCE_EIFFEL_CHARACTER);\n\t\t\t} else if (IsADigit(sc.ch) || (sc.ch == '.')) {\n\t\t\t\tsc.SetState(SCE_EIFFEL_NUMBER);\n\t\t\t} else if (IsAWordStart(sc.ch)) {\n\t\t\t\tsc.SetState(SCE_EIFFEL_WORD);\n\t\t\t} else if (isEiffelOperator(sc.ch)) {\n\t\t\t\tsc.SetState(SCE_EIFFEL_OPERATOR);\n\t\t\t}\n\t\t}\n\t}\n\tsc.Complete();\n}\n\nstatic bool IsEiffelComment(Accessor &styler, int pos, int len) {\n\treturn len>1 && styler[pos]=='-' && styler[pos+1]=='-';\n}\n\nstatic void FoldEiffelDocIndent(unsigned int startPos, int length, int,\n\t\t\t\t\t\t WordList *[], Accessor &styler) {\n\tint lengthDoc = startPos + length;\n\n\t\/\/ Backtrack to previous line in case need to fix its fold status\n\tint lineCurrent = styler.GetLine(startPos);\n\tif (startPos > 0) {\n\t\tif (lineCurrent > 0) {\n\t\t\tlineCurrent--;\n\t\t\tstartPos = styler.LineStart(lineCurrent);\n\t\t}\n\t}\n\tint spaceFlags = 0;\n\tint indentCurrent = styler.IndentAmount(lineCurrent, &spaceFlags, IsEiffelComment);\n\tchar chNext = styler[startPos];\n\tfor (int i = startPos; i < lengthDoc; i++) {\n\t\tchar ch = chNext;\n\t\tchNext = styler.SafeGetCharAt(i + 1);\n\n\t\tif ((ch == '\\r' && chNext != '\\n') || (ch == '\\n') || (i == lengthDoc)) {\n\t\t\tint lev = indentCurrent;\n\t\t\tint indentNext = styler.IndentAmount(lineCurrent + 1, &spaceFlags, IsEiffelComment);\n\t\t\tif (!(indentCurrent & SC_FOLDLEVELWHITEFLAG)) {\n\t\t\t\t\/\/ Only non whitespace lines can be headers\n\t\t\t\tif ((indentCurrent & SC_FOLDLEVELNUMBERMASK) < (indentNext & SC_FOLDLEVELNUMBERMASK)) {\n\t\t\t\t\tlev |= SC_FOLDLEVELHEADERFLAG;\n\t\t\t\t} else if (indentNext & SC_FOLDLEVELWHITEFLAG) {\n\t\t\t\t\t\/\/ Line after is blank so check the next - maybe should continue further?\n\t\t\t\t\tint spaceFlags2 = 0;\n\t\t\t\t\tint indentNext2 = styler.IndentAmount(lineCurrent + 2, &spaceFlags2, IsEiffelComment);\n\t\t\t\t\tif ((indentCurrent & SC_FOLDLEVELNUMBERMASK) < (indentNext2 & SC_FOLDLEVELNUMBERMASK)) {\n\t\t\t\t\t\tlev |= SC_FOLDLEVELHEADERFLAG;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t\tindentCurrent = indentNext;\n\t\t\tstyler.SetLevel(lineCurrent, lev);\n\t\t\tlineCurrent++;\n\t\t}\n\t}\n}\n\nstatic void FoldEiffelDocKeyWords(unsigned int startPos, int length, int \/* initStyle *\/, WordList *[],\n Accessor &styler) {\n\tunsigned int lengthDoc = startPos + length;\n\tint visibleChars = 0;\n\tint lineCurrent = styler.GetLine(startPos);\n\tint levelPrev = styler.LevelAt(lineCurrent) & SC_FOLDLEVELNUMBERMASK;\n\tint levelCurrent = levelPrev;\n\tchar chNext = styler[startPos];\n\tint stylePrev = 0;\n\tint styleNext = styler.StyleAt(startPos);\n\t\/\/ lastDeferred should be determined by looking back to last keyword in case\n\t\/\/ the \"deferred\" is on a line before \"class\"\n\tbool lastDeferred = false;\n\tfor (unsigned int i = startPos; i < lengthDoc; i++) {\n\t\tchar ch = chNext;\n\t\tchNext = styler.SafeGetCharAt(i + 1);\n\t\tint style = styleNext;\n\t\tstyleNext = styler.StyleAt(i + 1);\n\t\tbool atEOL = (ch == '\\r' && chNext != '\\n') || (ch == '\\n');\n\t\tif ((stylePrev != SCE_EIFFEL_WORD) && (style == SCE_EIFFEL_WORD)) {\n\t\t\tchar s[20];\n\t\t\tunsigned int j = 0;\n\t\t\twhile ((j < (sizeof(s) - 1)) && (iswordchar(styler[i + j]))) {\n\t\t\t\ts[j] = styler[i + j];\n\t\t\t\tj++;\n\t\t\t}\n\t\t\ts[j] = '\\0';\n\n\t\t\tif (\n\t\t\t\t(strcmp(s, \"check\") == 0) ||\n\t\t\t\t(strcmp(s, \"debug\") == 0) ||\n\t\t\t\t(strcmp(s, \"deferred\") == 0) ||\n\t\t\t\t(strcmp(s, \"do\") == 0) ||\n\t\t\t\t(strcmp(s, \"from\") == 0) ||\n\t\t\t\t(strcmp(s, \"if\") == 0) ||\n\t\t\t\t(strcmp(s, \"inspect\") == 0) ||\n\t\t\t\t(strcmp(s, \"once\") == 0)\n\t\t\t)\n\t\t\t\tlevelCurrent++;\n\t\t\tif (!lastDeferred && (strcmp(s, \"class\") == 0))\n\t\t\t\tlevelCurrent++;\n\t\t\tif (strcmp(s, \"end\") == 0)\n\t\t\t\tlevelCurrent--;\n\t\t\tlastDeferred = strcmp(s, \"deferred\") == 0;\n\t\t}\n\n\t\tif (atEOL) {\n\t\t\tint lev = levelPrev;\n\t\t\tif (visibleChars == 0)\n\t\t\t\tlev |= SC_FOLDLEVELWHITEFLAG;\n\t\t\tif ((levelCurrent > levelPrev) && (visibleChars > 0))\n\t\t\t\tlev |= SC_FOLDLEVELHEADERFLAG;\n\t\t\tif (lev != styler.LevelAt(lineCurrent)) {\n\t\t\t\tstyler.SetLevel(lineCurrent, lev);\n\t\t\t}\n\t\t\tlineCurrent++;\n\t\t\tlevelPrev = levelCurrent;\n\t\t\tvisibleChars = 0;\n\t\t}\n\t\tif (!isspacechar(ch))\n\t\t\tvisibleChars++;\n\t\tstylePrev = style;\n\t}\n\t\/\/ Fill in the real level of the next line, keeping the current flags as they will be filled in later\n\tint flagsNext = styler.LevelAt(lineCurrent) & ~SC_FOLDLEVELNUMBERMASK;\n\tstyler.SetLevel(lineCurrent, levelPrev | flagsNext);\n}\n\nstatic const char * const eiffelWordListDesc[] = {\n\t\"Keywords\",\n\t0\n};\n\nLexerModule lmEiffel(SCLEX_EIFFEL, ColouriseEiffelDoc, \"eiffel\", FoldEiffelDocIndent, eiffelWordListDesc);\nLexerModule lmEiffelkw(SCLEX_EIFFELKW, ColouriseEiffelDoc, \"eiffelkw\", FoldEiffelDocKeyWords, eiffelWordListDesc);\n<|endoftext|>"} {"text":"<commit_before>#include \"MenuState.h\"\n#include \"Game.h\"\n#include \"InputHandler.h\"\n#include \"PlayState.h\"\n#include <iostream>\n\nMenuState::MenuState(const int nbButtons) : m_nbButtons(nbButtons) {}\n\nvoid MenuState::update() {\n\tInputHandler* handlerInstance = InputHandler::Instance();\n\tif (handlerInstance->joysticksInitialised()) {\n\t\tint yAxisValue = handlerInstance->stickYValue(0, LEFT_STICK);\n\t\t\/\/ The stick must be brought back to neutral position to choose another\n\t\t\/\/ menu element, otherwise, it moves too fast.\n\t\tif (m_menuBeingChanged && yAxisValue == 0) {\n\t\t\tm_menuBeingChanged = false;\n\t\t}\n\t\telse if (!m_menuBeingChanged && yAxisValue != 0) {\n\t\t\t\/\/ deactivate the current menu element, change the current active\n\t\t\t\/\/ index, activate the new current menu element\n\t\t\tm_buttons[m_activeButtonIndex]->setActive(false);\n\t\t\tif (yAxisValue < 0) {\n\t\t\t\tm_activeButtonIndex = (m_nbButtons + m_activeButtonIndex - 1) % m_nbButtons;\n\t\t\t}\n\t\t\telse if (yAxisValue > 0) {\n\t\t\t\tm_activeButtonIndex = (m_activeButtonIndex + 1) % m_nbButtons;\n\t\t\t}\n\t\t\tm_buttons[m_activeButtonIndex]->setActive(true);\n\t\t\tm_menuBeingChanged = true;\n\t\t}\n\n\t\tif (InputHandler::Instance()->getButtonState(0, 0)) {\n\t\t\tm_buttons[m_activeButtonIndex]->executeAction();\n\t\t}\n\t}\n}\n\nvoid MenuState::render() {\n\tfor (std::vector<GameObject*>::size_type i = 0; i != m_renderableObjects.size(); i++) {\n\t\tm_renderableObjects[i]->render(Game::Instance()->getRenderer());\n\t}\n}\n\nbool MenuState::onEnter() {\n\tfor (int i = 0; i < m_nbButtons; ++i) {\n\t\tm_buttons.push_back(createButton(i));\n\t\tm_gameObjects.push_back(m_buttons[i]);\n\t\tm_renderableObjects.push_back(m_buttons[i]);\n\t}\n\treturn true;\n}\n\nbool MenuState::onExit() {\n\tstd::cout << \"exiting MenuState\\n\";\n\treturn true;\n}\n<commit_msg>memory freed when a menu state is closed<commit_after>#include \"MenuState.h\"\n#include \"Game.h\"\n#include \"InputHandler.h\"\n#include \"PlayState.h\"\n#include <iostream>\n\nMenuState::MenuState(const int nbButtons) : m_nbButtons(nbButtons) {}\n\nvoid MenuState::update() {\n\tInputHandler* handlerInstance = InputHandler::Instance();\n\tif (handlerInstance->joysticksInitialised()) {\n\t\tint yAxisValue = handlerInstance->stickYValue(0, LEFT_STICK);\n\t\t\/\/ The stick must be brought back to neutral position to choose another\n\t\t\/\/ menu element, otherwise, it moves too fast.\n\t\tif (m_menuBeingChanged && yAxisValue == 0) {\n\t\t\tm_menuBeingChanged = false;\n\t\t}\n\t\telse if (!m_menuBeingChanged && yAxisValue != 0) {\n\t\t\t\/\/ deactivate the current menu element, change the current active\n\t\t\t\/\/ index, activate the new current menu element\n\t\t\tm_buttons[m_activeButtonIndex]->setActive(false);\n\t\t\tif (yAxisValue < 0) {\n\t\t\t\tm_activeButtonIndex = (m_nbButtons + m_activeButtonIndex - 1) % m_nbButtons;\n\t\t\t}\n\t\t\telse if (yAxisValue > 0) {\n\t\t\t\tm_activeButtonIndex = (m_activeButtonIndex + 1) % m_nbButtons;\n\t\t\t}\n\t\t\tm_buttons[m_activeButtonIndex]->setActive(true);\n\t\t\tm_menuBeingChanged = true;\n\t\t}\n\n\t\tif (InputHandler::Instance()->getButtonState(0, 0)) {\n\t\t\tm_buttons[m_activeButtonIndex]->executeAction();\n\t\t}\n\t}\n}\n\nvoid MenuState::render() {\n\tfor (std::vector<GameObject*>::size_type i = 0; i != m_renderableObjects.size(); i++) {\n\t\tm_renderableObjects[i]->render(Game::Instance()->getRenderer());\n\t}\n}\n\nbool MenuState::onEnter() {\n\tfor (int i = 0; i < m_nbButtons; ++i) {\n\t\tm_buttons.push_back(createButton(i));\n\t\tm_gameObjects.push_back(m_buttons[i]);\n\t\tm_renderableObjects.push_back(m_buttons[i]);\n\t}\n\treturn true;\n}\n\nbool MenuState::onExit() {\n\tfor (int i = 0; i < m_nbButtons; ++i) {\n\t\tdelete m_buttons[i];\n\t\tm_buttons[i] = NULL;\n\t\tm_gameObjects[i] = NULL;\n\t\tm_renderableObjects[i] = NULL;\n\t}\n\treturn true;\n}\n<|endoftext|>"} {"text":"<commit_before>#include \"MulModule.h\"\n\nMulModule::MulModule(ModularSynth& synth)\n\t:SynthModule(synth, moduleId, 3, 1, 0)\n{\n}\n\n\nvoid MulModule::cycle()\n{\n\tsetOutput(0, getInput(0) * getInput(1));\n}\n\n\n\nconst char * MulModule::getInputName(int input) const \n{\n\tstatic const char *names[] = {\"A\", \"B\", \"C\"};\n\treturn names[input];\n}\n\n\nconst char * MulModule::getOutputName(int output) const \n{\n\treturn \"Output\";\n}\n\n\nconst char * MulModule::getName() const\n{\n\treturn \"Mul\";\n}\n\nSynthModule * MulModule::createModule(ModularSynth& synth)\n{\n\treturn new MulModule(synth);\n}\n<commit_msg>Reduced number of Mul inputs<commit_after>#include \"MulModule.h\"\n\nMulModule::MulModule(ModularSynth& synth)\n\t:SynthModule(synth, moduleId, 2, 1, 0)\n{\n}\n\n\nvoid MulModule::cycle()\n{\n\tsetOutput(0, getInput(0) * getInput(1));\n}\n\n\n\nconst char * MulModule::getInputName(int input) const \n{\n\tstatic const char *names[] = {\"A\", \"B\", \"C\"};\n\treturn names[input];\n}\n\n\nconst char * MulModule::getOutputName(int output) const \n{\n\treturn \"Output\";\n}\n\n\nconst char * MulModule::getName() const\n{\n\treturn \"Mul\";\n}\n\nSynthModule * MulModule::createModule(ModularSynth& synth)\n{\n\treturn new MulModule(synth);\n}\n<|endoftext|>"} {"text":"<commit_before>#include <algorithm>\n#include <map>\n#include <string>\n#include <limits>\n\n#include \"Profiling.h\"\n#include \"IRMutator.h\"\n#include \"IROperator.h\"\n\nnamespace Halide {\nnamespace Internal {\n\nusing std::map;\nusing std::string;\nusing std::vector;\n\nclass InjectProfiling : public IRMutator {\npublic:\n map<string, int> indices; \/\/ maps from func name -> index in buffer.\n\n InjectProfiling() {\n indices[\"overhead\"] = 0;\n }\n\nprivate:\n using IRMutator::visit;\n\n void visit(const ProducerConsumer *op) {\n int idx;\n map<string, int>::iterator iter = indices.find(op->name);\n if (iter == indices.end()) {\n idx = (int)indices.size();\n indices[op->name] = idx;\n } else {\n idx = iter->second;\n }\n\n Stmt produce = mutate(op->produce);\n Stmt update = op->update.defined() ? mutate(op->update) : Stmt();\n Stmt consume = mutate(op->consume);\n\n Expr profiler_token = Variable::make(Int(32), \"profiler_token\");\n Expr profiler_state = Variable::make(Handle(), \"profiler_state\");\n\n \/\/ This call gets inlined and becomes a single store instruction.\n Expr set_task = Call::make(Int(32), \"halide_profiler_set_current_func\",\n {profiler_state, profiler_token, idx}, Call::Extern);\n\n produce = Block::make(Evaluate::make(set_task), produce);\n\n stmt = ProducerConsumer::make(op->name, produce, update, consume);\n }\n};\n\nStmt inject_profiling(Stmt s, string pipeline_name) {\n InjectProfiling profiling;\n s = profiling.mutate(s);\n\n int num_funcs = (int)(profiling.indices.size());\n\n Expr func_names_buf = Load::make(Handle(), \"profiling_func_names\", 0, Buffer(), Parameter());\n func_names_buf = Call::make(Handle(), Call::address_of, {func_names_buf}, Call::Intrinsic);\n\n Expr start_profiler = Call::make(Int(32), \"halide_profiler_pipeline_start\",\n {pipeline_name, num_funcs, func_names_buf}, Call::Extern);\n\n Expr get_state = Call::make(Handle(), \"halide_profiler_get_state\", {}, Call::Extern);\n\n Expr profiler_token = Variable::make(Int(32), \"profiler_token\");\n\n Expr stop_profiler = Call::make(Int(32), Call::register_destructor,\n {Expr(\"halide_profiler_pipeline_end\"), get_state}, Call::Intrinsic);\n\n\n s = LetStmt::make(\"profiler_state\", get_state, s);\n \/\/ If there was a problem starting the profiler, it will call an\n \/\/ appropriate halide error function and then return the\n \/\/ (negative) error code as the token.\n s = Block::make(AssertStmt::make(profiler_token >= 0, profiler_token), s);\n s = LetStmt::make(\"profiler_token\", start_profiler, s);\n\n for (std::pair<string, int> p : profiling.indices) {\n s = Block::make(Store::make(\"profiling_func_names\", p.first, p.second), s);\n }\n\n s = Allocate::make(\"profiling_func_names\", Handle(), {num_funcs}, const_true(), s);\n s = Block::make(Evaluate::make(stop_profiler), s);\n\n return s;\n}\n\n}\n}\n<commit_msg>Don't instrument GPU loops<commit_after>#include <algorithm>\n#include <map>\n#include <string>\n#include <limits>\n\n#include \"Profiling.h\"\n#include \"IRMutator.h\"\n#include \"IROperator.h\"\n\nnamespace Halide {\nnamespace Internal {\n\nusing std::map;\nusing std::string;\nusing std::vector;\n\nclass InjectProfiling : public IRMutator {\npublic:\n map<string, int> indices; \/\/ maps from func name -> index in buffer.\n\n InjectProfiling() {\n indices[\"overhead\"] = 0;\n }\n\nprivate:\n using IRMutator::visit;\n\n void visit(const ProducerConsumer *op) {\n int idx;\n map<string, int>::iterator iter = indices.find(op->name);\n if (iter == indices.end()) {\n idx = (int)indices.size();\n indices[op->name] = idx;\n } else {\n idx = iter->second;\n }\n\n Stmt produce = mutate(op->produce);\n Stmt update = op->update.defined() ? mutate(op->update) : Stmt();\n Stmt consume = mutate(op->consume);\n\n Expr profiler_token = Variable::make(Int(32), \"profiler_token\");\n Expr profiler_state = Variable::make(Handle(), \"profiler_state\");\n\n \/\/ This call gets inlined and becomes a single store instruction.\n Expr set_task = Call::make(Int(32), \"halide_profiler_set_current_func\",\n {profiler_state, profiler_token, idx}, Call::Extern);\n\n produce = Block::make(Evaluate::make(set_task), produce);\n\n stmt = ProducerConsumer::make(op->name, produce, update, consume);\n }\n\n void visit(const For *op) {\n \/\/ We profile by storing a token to global memory, so don't enter GPU loops\n if (op->device_api == DeviceAPI::Parent ||\n op->device_api == DeviceAPI::Host) {\n IRMutator::visit(op);\n } else {\n stmt = op;\n }\n }\n};\n\nStmt inject_profiling(Stmt s, string pipeline_name) {\n InjectProfiling profiling;\n s = profiling.mutate(s);\n\n int num_funcs = (int)(profiling.indices.size());\n\n Expr func_names_buf = Load::make(Handle(), \"profiling_func_names\", 0, Buffer(), Parameter());\n func_names_buf = Call::make(Handle(), Call::address_of, {func_names_buf}, Call::Intrinsic);\n\n Expr start_profiler = Call::make(Int(32), \"halide_profiler_pipeline_start\",\n {pipeline_name, num_funcs, func_names_buf}, Call::Extern);\n\n Expr get_state = Call::make(Handle(), \"halide_profiler_get_state\", {}, Call::Extern);\n\n Expr profiler_token = Variable::make(Int(32), \"profiler_token\");\n\n Expr stop_profiler = Call::make(Int(32), Call::register_destructor,\n {Expr(\"halide_profiler_pipeline_end\"), get_state}, Call::Intrinsic);\n\n\n s = LetStmt::make(\"profiler_state\", get_state, s);\n \/\/ If there was a problem starting the profiler, it will call an\n \/\/ appropriate halide error function and then return the\n \/\/ (negative) error code as the token.\n s = Block::make(AssertStmt::make(profiler_token >= 0, profiler_token), s);\n s = LetStmt::make(\"profiler_token\", start_profiler, s);\n\n for (std::pair<string, int> p : profiling.indices) {\n s = Block::make(Store::make(\"profiling_func_names\", p.first, p.second), s);\n }\n\n s = Allocate::make(\"profiling_func_names\", Handle(), {num_funcs}, const_true(), s);\n s = Block::make(Evaluate::make(stop_profiler), s);\n\n return s;\n}\n\n}\n}\n<|endoftext|>"} {"text":"<commit_before>#include \"QuickSort.hpp\"\n\nconst std::string QuickSort::kTableKey = \"quick\";\nconst std::string QuickSort::kPrettyName = \"Quick Sort\";\n\nQuickSort::QuickSort() {\n\n}\n\nQuickSort::~QuickSort() {\n\n}\n\n\nvoid QuickSort::Sort(DataType * data_in, const threadCount num_threads ) {\n DataType * dst = new DataType(data_in->size(),0);\n QSort(data_in, 0, data_in->size() - 1); \n free(dst);\n}\n\nvoid QuickSort::QSort(DataType * data_in, size_t left, size_t right) {\n size_t i = left, j = right;\n size_t tmp;\n size_t pivot_point = (left + right)\/2;\n size_t pivot = data_in->at(pivot_point);\n\n \/* partition *\/\n while (i <= j) {\n while (data_in->at(i) < pivot)\n i++;\n while (data_in->at(j) > pivot)\n j--;\n if (i <= j) {\n tmp = data_in->at(i);\n data_in->at(i) = data_in->at(j);\n data_in->at(j) = tmp;\n i++;\n j--;\n }\n }\n \/* recursion *\/\n if (left < j)\n QSort(data_in, left, j);\n if (i < right)\n QSort(data_in, i, right);\n}\n\n<commit_msg>Adding update to index access.<commit_after>#include \"QuickSort.hpp\"\n\nconst std::string QuickSort::kTableKey = \"quick\";\nconst std::string QuickSort::kPrettyName = \"Quick Sort\";\n\nQuickSort::QuickSort() {\n\n}\n\nQuickSort::~QuickSort() {\n\n}\n\n\nvoid QuickSort::Sort(DataType * data_in, const threadCount num_threads ) {\n DataType * dst = new DataType(data_in->size(),0);\n QSort(data_in, 0, data_in->size() - 1); \n free(dst);\n}\n\nvoid QuickSort::QSort(DataType * data_in, size_t left, size_t right) {\n size_t i = left, j = right;\n size_t tmp;\n size_t pivot_point = (left + right)\/2;\n size_t pivot = data_in->at(pivot_point);\n\n \/* partition *\/\n while (i <= j) {\n while (data_in->at(i) < pivot)\n i++;\n while (data_in->at(j) > pivot)\n j--;\n if (i <= j) {\n tmp = data_in->at(i);\n (*data_in)[i] = data_in->at(j);\n (*data_in)[j] = tmp;\n i++;\n j--;\n }\n }\n \/* recursion *\/\n if (left < j)\n QSort(data_in, left, j);\n if (i < right)\n QSort(data_in, i, right);\n}\n\n<|endoftext|>"} {"text":"<commit_before>#include <fstream>\n#include <string>\n\n#include <chdl\/chdl.h>\n#include <chdl\/cassign.h>\n\n#include \"config.h\"\n#include \"interfaces.h\"\n#include \"harpinst.h\"\n\nusing namespace std;\nusing namespace chdl;\n\n\/\/ The full Processor\nvoid Harmonica2();\n\n\/\/ The pipeline stages\nvoid Sched(sched_fetch_t &out, splitter_sched_t &in);\nvoid Fetch(fetch_pred_t &out, sched_fetch_t &in, string romFile);\nvoid PredRegs(pred_reg_t &out, fetch_pred_t &in, splitter_pred_t &wb);\nvoid GpRegs(reg_func_t &out, pred_reg_t &in, splitter_reg_t &wb);\nvoid Execute(splitter_sched_t&, splitter_pred_t&, splitter_reg_t&, reg_func_t&);\n\n\/\/ Implementations\nvoid Harmonica2(string romFile) {\n HIERARCHY_ENTER();\n\n \/\/ Assemble the pipeline\n sched_fetch_t sf;\n fetch_pred_t fp;\n pred_reg_t pr;\n reg_func_t rx;\n splitter_sched_t xs;\n splitter_pred_t xp;\n splitter_reg_t xr;\n\n Sched(sf, xs);\n Fetch(fp, sf, romFile);\n PredRegs(pr, fp, xp);\n GpRegs(rx, pr, xr);\n Execute(xs, xp, xr, rx);\n\n TAP(sf); TAP(fp); TAP(pr); TAP(rx); TAP(xs); TAP(xp); TAP(xr);\n\n HIERARCHY_EXIT();\n}\n\nint main(int argc, char **argv) {\n \/\/ Instantiate the processor\n string romFile(argc == 1 ? \"rom.hex\" : argv[1]);\n Harmonica2(romFile);\n\n \/\/ Optimize and simulate\/dump netlist\n if (cycdet()) return 1;\n optimize();\n\n \/\/ Do a critical path report\n ofstream cp_report(\"h2.crit\");\n critpath_report(cp_report);\n\n if (FPGA) {\n \/\/ Emit verilog\n ofstream vl(\"h2.v\");\n print_verilog(\"h2\", vl);\n }\n\n if (NETLIST) {\n \/\/ Emit netlist\n ofstream nl(\"h2.nand\");\n print_netlist(nl);\n }\n \n if (SIMULATE) {\n \/\/ Run a simulation\n string vcdFile(argc < 2 ? \"h2.vcd\" : argv[2]);\n ofstream vcd(vcdFile);\n run(vcd, 10000);\n }\n\n return 0;\n}\n<commit_msg>Added a couple of counters.<commit_after>#include <fstream>\n#include <string>\n\n#include <chdl\/chdl.h>\n#include <chdl\/cassign.h>\n#include <chdl\/counter.h>\n\n#include \"config.h\"\n#include \"interfaces.h\"\n#include \"harpinst.h\"\n\nusing namespace std;\nusing namespace chdl;\n\n\/\/ The full Processor\nvoid Harmonica2();\n\n\/\/ The pipeline stages\nvoid Sched(sched_fetch_t &out, splitter_sched_t &in);\nvoid Fetch(fetch_pred_t &out, sched_fetch_t &in, string romFile);\nvoid PredRegs(pred_reg_t &out, fetch_pred_t &in, splitter_pred_t &wb);\nvoid GpRegs(reg_func_t &out, pred_reg_t &in, splitter_reg_t &wb);\nvoid Execute(splitter_sched_t&, splitter_pred_t&, splitter_reg_t&, reg_func_t&);\n\n\/\/ Implementations\nvoid Harmonica2(string romFile) {\n HIERARCHY_ENTER();\n\n \/\/ Assemble the pipeline\n sched_fetch_t sf;\n fetch_pred_t fp;\n pred_reg_t pr;\n reg_func_t rx;\n splitter_sched_t xs;\n splitter_pred_t xp;\n splitter_reg_t xr;\n\n Sched(sf, xs);\n Fetch(fp, sf, romFile);\n PredRegs(pr, fp, xp);\n GpRegs(rx, pr, xr);\n Execute(xs, xp, xr, rx);\n\n TAP(sf); TAP(fp); TAP(pr); TAP(rx); TAP(xs); TAP(xp); TAP(xr);\n\n Counter(\"cycles\", Lit(1));\n Counter(\"insts\", _(xs, \"ready\") && _(xs, \"valid\"));\n\n HIERARCHY_EXIT();\n}\n\nint main(int argc, char **argv) {\n \/\/ Instantiate the processor\n string romFile(argc == 1 ? \"rom.hex\" : argv[1]);\n Harmonica2(romFile);\n\n \/\/ Optimize and simulate\/dump netlist\n if (cycdet()) return 1;\n optimize();\n\n \/\/ Do a critical path report\n ofstream cp_report(\"h2.crit\");\n critpath_report(cp_report);\n\n if (FPGA) {\n \/\/ Emit verilog\n ofstream vl(\"h2.v\");\n print_verilog(\"h2\", vl);\n }\n\n if (NETLIST) {\n \/\/ Emit netlist\n ofstream nl(\"h2.nand\");\n print_netlist(nl);\n }\n \n if (SIMULATE) {\n \/\/ Run a simulation\n string vcdFile(argc < 2 ? \"h2.vcd\" : argv[2]);\n ofstream vcd(vcdFile);\n run(vcd, 10000);\n }\n\n return 0;\n}\n<|endoftext|>"} {"text":"<commit_before>\/*\n * Copyright (C) 2014 Cloudius Systems, Ltd.\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#ifndef LOG_HH_\n#define LOG_HH_\n\n#include \"core\/sstring.hh\"\n#include <unordered_map>\n#include <exception>\n#include <iosfwd>\n#include <atomic>\n#include <mutex>\n#include <boost\/lexical_cast.hpp>\n\nnamespace logging {\n\nenum class log_level {\n error,\n warn,\n info,\n debug,\n trace,\n};\n\n}\n\n\/\/ Must exist logging namespace, or ADL gets confused in logger::stringer\nstd::ostream& operator<<(std::ostream& out, logging::log_level level);\nstd::istream& operator>>(std::istream& in, logging::log_level& level);\n\n\/\/ Boost doesn't auto-deduce the existence of the streaming operators for some reason\n\nnamespace boost {\n\ntemplate <>\nlogging::log_level lexical_cast(const std::string& source);\n\n}\n\nnamespace logging {\n\nclass logger;\nclass registry;\n\nclass logger {\n sstring _name;\n std::atomic<log_level> _level = { log_level::warn };\n static std::atomic<bool> _stdout;\n static std::atomic<bool> _syslog;\nprivate:\n struct stringer {\n \/\/ no need for virtual dtor, since not dynamically destroyed\n virtual void append(std::ostream& os) = 0;\n };\n template <typename Arg>\n struct stringer_for final : stringer {\n explicit stringer_for(const Arg& arg) : arg(arg) {}\n const Arg& arg;\n virtual void append(std::ostream& os) override {\n os << arg;\n }\n };\n template <typename... Args>\n void do_log(log_level level, const char* fmt, Args&&... args);\n template <typename Arg, typename... Args>\n void do_log_step(log_level level, const char* fmt, stringer** s, size_t n, size_t idx, Arg&& arg, Args&&... args);\n void do_log_step(log_level level, const char* fmt, stringer** s, size_t n, size_t idx);\n void really_do_log(log_level level, const char* fmt, stringer** stringers, size_t n);\npublic:\n explicit logger(sstring name);\n logger(logger&& x);\n ~logger();\n bool is_enabled(log_level level) const {\n return level <= _level.load(std::memory_order_relaxed);\n }\n template <typename... Args>\n void log(log_level level, const char* fmt, Args&&... args) {\n if (is_enabled(level)) {\n do_log(level, fmt, std::forward<Args>(args)...);\n }\n }\n template <typename... Args>\n void error(const char* fmt, Args&&... args) {\n log(log_level::error, fmt, std::forward<Args>(args)...);\n }\n template <typename... Args>\n void warn(const char* fmt, Args&&... args) {\n log(log_level::warn, fmt, std::forward<Args>(args)...);\n }\n template <typename... Args>\n void info(const char* fmt, Args&&... args) {\n log(log_level::info, fmt, std::forward<Args>(args)...);\n }\n template <typename... Args>\n void debug(const char* fmt, Args&&... args) {\n log(log_level::debug, fmt, std::forward<Args>(args)...);\n }\n template <typename... Args>\n void trace(const char* fmt, Args&&... args) {\n log(log_level::trace, fmt, std::forward<Args>(args)...);\n }\n const sstring& name() const {\n return _name;\n }\n log_level level() const {\n return _level.load(std::memory_order_relaxed);\n }\n void set_level(log_level level) {\n _level.store(level, std::memory_order_relaxed);\n }\n static void set_stdout_enabled(bool enabled);\n static void set_syslog_enabled(bool enabled);\n};\n\nclass registry {\n mutable std::mutex _mutex;\n std::unordered_map<sstring, logger*> _loggers;\npublic:\n void set_all_loggers_level(log_level level);\n log_level get_logger_level(sstring name) const;\n void set_logger_level(sstring name, log_level level);\n std::vector<sstring> get_all_logger_names();\n void register_logger(logger* l);\n void unregister_logger(logger* l);\n void moved(logger* from, logger* to);\n};\n\nsstring pretty_type_name(const std::type_info&);\n\nsstring level_name(log_level level);\n\nregistry& logger_registry();\n\ntemplate <typename T>\nclass logger_for : public logger {\npublic:\n logger_for() : logger(pretty_type_name(typeid(T))) {}\n};\n\ninline\nvoid\nlogger::do_log_step(log_level level, const char* fmt, stringer** s, size_t n, size_t idx) {\n really_do_log(level, fmt, s, n);\n}\n\ntemplate <typename Arg, typename... Args>\ninline\nvoid\nlogger::do_log_step(log_level level, const char* fmt, stringer** s, size_t n, size_t idx, Arg&& arg, Args&&... args) {\n stringer_for<Arg> sarg{arg};\n s[idx] = &sarg;\n do_log_step(level, fmt, s, n, idx + 1, std::forward<Args>(args)...);\n}\n\n\ntemplate <typename... Args>\nvoid\nlogger::do_log(log_level level, const char* fmt, Args&&... args) {\n stringer* s[sizeof...(Args)];\n do_log_step(level, fmt, s, sizeof...(Args), 0, std::forward<Args>(args)...);\n}\n\n}\n\n\/\/ Pretty-printer for exceptions to be logged, e.g., std::current_exception().\nnamespace std {\nstd::ostream& operator<<(std::ostream&, const std::exception_ptr&);\n}\n\n#endif \/* LOG_HH_ *\/\n<commit_msg>log: Change default level from warn to info<commit_after>\/*\n * Copyright (C) 2014 Cloudius Systems, Ltd.\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#ifndef LOG_HH_\n#define LOG_HH_\n\n#include \"core\/sstring.hh\"\n#include <unordered_map>\n#include <exception>\n#include <iosfwd>\n#include <atomic>\n#include <mutex>\n#include <boost\/lexical_cast.hpp>\n\nnamespace logging {\n\nenum class log_level {\n error,\n warn,\n info,\n debug,\n trace,\n};\n\n}\n\n\/\/ Must exist logging namespace, or ADL gets confused in logger::stringer\nstd::ostream& operator<<(std::ostream& out, logging::log_level level);\nstd::istream& operator>>(std::istream& in, logging::log_level& level);\n\n\/\/ Boost doesn't auto-deduce the existence of the streaming operators for some reason\n\nnamespace boost {\n\ntemplate <>\nlogging::log_level lexical_cast(const std::string& source);\n\n}\n\nnamespace logging {\n\nclass logger;\nclass registry;\n\nclass logger {\n sstring _name;\n std::atomic<log_level> _level = { log_level::info };\n static std::atomic<bool> _stdout;\n static std::atomic<bool> _syslog;\nprivate:\n struct stringer {\n \/\/ no need for virtual dtor, since not dynamically destroyed\n virtual void append(std::ostream& os) = 0;\n };\n template <typename Arg>\n struct stringer_for final : stringer {\n explicit stringer_for(const Arg& arg) : arg(arg) {}\n const Arg& arg;\n virtual void append(std::ostream& os) override {\n os << arg;\n }\n };\n template <typename... Args>\n void do_log(log_level level, const char* fmt, Args&&... args);\n template <typename Arg, typename... Args>\n void do_log_step(log_level level, const char* fmt, stringer** s, size_t n, size_t idx, Arg&& arg, Args&&... args);\n void do_log_step(log_level level, const char* fmt, stringer** s, size_t n, size_t idx);\n void really_do_log(log_level level, const char* fmt, stringer** stringers, size_t n);\npublic:\n explicit logger(sstring name);\n logger(logger&& x);\n ~logger();\n bool is_enabled(log_level level) const {\n return level <= _level.load(std::memory_order_relaxed);\n }\n template <typename... Args>\n void log(log_level level, const char* fmt, Args&&... args) {\n if (is_enabled(level)) {\n do_log(level, fmt, std::forward<Args>(args)...);\n }\n }\n template <typename... Args>\n void error(const char* fmt, Args&&... args) {\n log(log_level::error, fmt, std::forward<Args>(args)...);\n }\n template <typename... Args>\n void warn(const char* fmt, Args&&... args) {\n log(log_level::warn, fmt, std::forward<Args>(args)...);\n }\n template <typename... Args>\n void info(const char* fmt, Args&&... args) {\n log(log_level::info, fmt, std::forward<Args>(args)...);\n }\n template <typename... Args>\n void debug(const char* fmt, Args&&... args) {\n log(log_level::debug, fmt, std::forward<Args>(args)...);\n }\n template <typename... Args>\n void trace(const char* fmt, Args&&... args) {\n log(log_level::trace, fmt, std::forward<Args>(args)...);\n }\n const sstring& name() const {\n return _name;\n }\n log_level level() const {\n return _level.load(std::memory_order_relaxed);\n }\n void set_level(log_level level) {\n _level.store(level, std::memory_order_relaxed);\n }\n static void set_stdout_enabled(bool enabled);\n static void set_syslog_enabled(bool enabled);\n};\n\nclass registry {\n mutable std::mutex _mutex;\n std::unordered_map<sstring, logger*> _loggers;\npublic:\n void set_all_loggers_level(log_level level);\n log_level get_logger_level(sstring name) const;\n void set_logger_level(sstring name, log_level level);\n std::vector<sstring> get_all_logger_names();\n void register_logger(logger* l);\n void unregister_logger(logger* l);\n void moved(logger* from, logger* to);\n};\n\nsstring pretty_type_name(const std::type_info&);\n\nsstring level_name(log_level level);\n\nregistry& logger_registry();\n\ntemplate <typename T>\nclass logger_for : public logger {\npublic:\n logger_for() : logger(pretty_type_name(typeid(T))) {}\n};\n\ninline\nvoid\nlogger::do_log_step(log_level level, const char* fmt, stringer** s, size_t n, size_t idx) {\n really_do_log(level, fmt, s, n);\n}\n\ntemplate <typename Arg, typename... Args>\ninline\nvoid\nlogger::do_log_step(log_level level, const char* fmt, stringer** s, size_t n, size_t idx, Arg&& arg, Args&&... args) {\n stringer_for<Arg> sarg{arg};\n s[idx] = &sarg;\n do_log_step(level, fmt, s, n, idx + 1, std::forward<Args>(args)...);\n}\n\n\ntemplate <typename... Args>\nvoid\nlogger::do_log(log_level level, const char* fmt, Args&&... args) {\n stringer* s[sizeof...(Args)];\n do_log_step(level, fmt, s, sizeof...(Args), 0, std::forward<Args>(args)...);\n}\n\n}\n\n\/\/ Pretty-printer for exceptions to be logged, e.g., std::current_exception().\nnamespace std {\nstd::ostream& operator<<(std::ostream&, const std::exception_ptr&);\n}\n\n#endif \/* LOG_HH_ *\/\n<|endoftext|>"} {"text":"<commit_before>\/*****************************************************************************\n * open.cpp : Panels for the open dialogs\n ****************************************************************************\n * Copyright (C) 2006 the VideoLAN team\n * $Id$\n *\n * Authors: Clément Stenac <zorglub@videolan.org>\n * 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\n * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston MA 02110-1301, USA.\n *****************************************************************************\/\n\n\n#include \"qt4.hpp\"\n#include \"components\/open.hpp\"\n#include \"dialogs_provider.hpp\"\n#include \"util\/customwidgets.hpp\"\n\n#include <QFileDialog>\n#include <QDialogButtonBox>\n#include <QLineEdit>\n\n\/**************************************************************************\n * File open\n **************************************************************************\/\nFileOpenPanel::FileOpenPanel( QWidget *_parent, intf_thread_t *_p_intf ) :\n OpenPanel( _parent, _p_intf )\n{\n \/* Classic UI Setup *\/\n ui.setupUi( this );\n\n \/* Use a QFileDialog and customize it because we don't want to\n rewrite it all. Be careful to your eyes cause there are a few hacks.\n Be very careful and test correctly when you modify this. *\/\n\n \/* Set Filters for file selection *\/\n QString fileTypes = \"\";\n ADD_FILTER_MEDIA( fileTypes );\n ADD_FILTER_VIDEO( fileTypes );\n ADD_FILTER_AUDIO( fileTypes );\n ADD_FILTER_PLAYLIST( fileTypes );\n ADD_FILTER_ALL( fileTypes );\n fileTypes.replace(QString(\";*\"), QString(\" *\"));\n\n \/\/ Make this QFileDialog a child of tempWidget from the ui.\n dialogBox = new QFileDialog( ui.tempWidget, NULL,\n qfu( p_intf->p_libvlc->psz_homedir ), fileTypes );\n dialogBox->setFileMode( QFileDialog::ExistingFiles );\n \/* We don't want to see a grip in the middle of the window, do we? *\/\n dialogBox->setSizeGripEnabled( false );\n dialogBox->setToolTip( qtr( \"Select one or multiple files, or a folder\" ));\n\n \/\/ Add it to the layout\n ui.gridLayout->addWidget( dialogBox, 0, 0, 1, 3 );\n\n \/\/ But hide the two OK\/Cancel buttons. Enable them for debug.\n#ifndef WIN32\n findChild<QDialogButtonBox*>()->hide();\n#endif\n\n \/* Ugly hacks to get the good Widget *\/\n \/\/This lineEdit is the normal line in the fileDialog.\n lineFileEdit = findChildren<QLineEdit*>()[3];\n lineFileEdit->hide();\n\n \/* Make a list of QLabel inside the QFileDialog to access the good ones *\/\n QList<QLabel *> listLabel = findChildren<QLabel*>();\n\n \/* Hide the FileNames one. Enable it for debug *\/\n listLabel[4]->hide();\n \/* Change the text that was uncool in the usual box *\/\n listLabel[5]->setText( qtr( \"Filter:\" ) );\n\n \/* Hacks Continued Catch the close event *\/\n dialogBox->installEventFilter( this );\n\n \/\/ Hide the subtitles control by default.\n ui.subFrame->hide();\n\n \/* Build the subs size combo box *\/\n module_config_t *p_item =\n config_FindConfig( VLC_OBJECT(p_intf), \"freetype-rel-fontsize\" );\n if( p_item )\n {\n for( int i_index = 0; i_index < p_item->i_list; i_index++ )\n {\n ui.sizeSubComboBox->addItem(\n qfu( p_item->ppsz_list_text[i_index] ),\n QVariant( p_item->pi_list[i_index] ) );\n if( p_item->value.i == p_item->pi_list[i_index] )\n {\n ui.sizeSubComboBox->setCurrentIndex( i_index );\n }\n }\n }\n\n \/* Build the subs align combo box *\/\n p_item = config_FindConfig( VLC_OBJECT(p_intf), \"subsdec-align\" );\n if( p_item )\n {\n for( int i_index = 0; i_index < p_item->i_list; i_index++ )\n {\n ui.alignSubComboBox->addItem(\n qfu( p_item->ppsz_list_text[i_index] ),\n QVariant( p_item->pi_list[i_index] ) );\n if( p_item->value.i == p_item->pi_list[i_index] )\n {\n ui.alignSubComboBox->setCurrentIndex( i_index );\n }\n }\n }\n\n BUTTONACT( ui.subBrowseButton, browseFileSub() );\n BUTTONACT( ui.subCheckBox, toggleSubtitleFrame());\n\n CONNECT( ui.fileInput, editTextChanged(QString ), this, updateMRL());\n CONNECT( ui.subInput, editTextChanged(QString ), this, updateMRL());\n CONNECT( ui.alignSubComboBox, currentIndexChanged(int), this, updateMRL());\n CONNECT( ui.sizeSubComboBox, currentIndexChanged(int), this, updateMRL());\n CONNECT( lineFileEdit, textChanged( QString ), this, browseFile());\n}\n\nFileOpenPanel::~FileOpenPanel()\n{}\n\nQStringList FileOpenPanel::browse(QString help)\n{\n return THEDP->showSimpleOpen( help );\n}\n\nvoid FileOpenPanel::browseFile()\n{\n QString fileString = \"\";\n foreach( QString file, dialogBox->selectedFiles() ) {\n fileString += \"\\\"\" + file + \"\\\" \";\n }\n ui.fileInput->setEditText( fileString );\n updateMRL();\n}\n\nvoid FileOpenPanel::browseFileSub()\n{\n \/\/ FIXME Handle selection of more than one subtitles file\n QStringList files = THEDP->showSimpleOpen( qtr(\"Open subtitles file\"),\n EXT_FILTER_SUBTITLE,\n dialogBox->directory().absolutePath() );\n ui.subInput->setEditText( files.join(\" \") );\n updateMRL();\n}\n\nvoid FileOpenPanel::updateMRL()\n{\n QString mrl = ui.fileInput->currentText();\n\n if( ui.subCheckBox->isChecked() ) {\n mrl.append( \" :sub-file=\" + ui.subInput->currentText() );\n int align = ui.alignSubComboBox->itemData( ui.alignSubComboBox->currentIndex() ).toInt();\n mrl.append( \" :subsdec-align=\" + QString().setNum( align ) );\n int size = ui.sizeSubComboBox->itemData( ui.sizeSubComboBox->currentIndex() ).toInt();\n mrl.append( \" :sub-rel-fontsize=\" + QString().setNum( size ) );\n }\n emit mrlUpdated( mrl );\n emit methodChanged( \"file-caching\" );\n}\n\n\n\/* Function called by Open Dialog when clicke on Play\/Enqueue *\/\nvoid FileOpenPanel::accept()\n{\n ui.fileInput->addItem(ui.fileInput->currentText());\n if ( ui.fileInput->count() > 8 ) ui.fileInput->removeItem(0);\n}\n\n\n\/* Function called by Open Dialog when clicked on cancel *\/\nvoid FileOpenPanel::clear()\n{\n ui.fileInput->setEditText( \"\" );\n ui.subInput->setEditText( \"\" );\n}\n\nbool FileOpenPanel::eventFilter(QObject *object, QEvent *event)\n{\n if ( ( object == dialogBox ) && ( event->type() == QEvent::Hide ) )\n {\n event->ignore();\n return true;\n }\n \/\/ standard event processing\n else\n return QObject::eventFilter(object, event);\n}\n\nvoid FileOpenPanel::toggleSubtitleFrame()\n{\n if (ui.subFrame->isVisible())\n {\n ui.subFrame->hide();\n\/\/ setMinimumHeight(1);\n resize( sizeHint());\n }\n else\n {\n ui.subFrame->show();\n }\n\n \/* Update the MRL *\/\n updateMRL();\n}\n\n\/**************************************************************************\n * Disk open\n **************************************************************************\/\nDiskOpenPanel::DiskOpenPanel( QWidget *_parent, intf_thread_t *_p_intf ) :\n OpenPanel( _parent, _p_intf )\n{\n ui.setupUi( this );\n\n CONNECT( ui.deviceCombo, editTextChanged(QString ), this, updateMRL());\n BUTTONACT( ui.dvdRadioButton, updateMRL());\n BUTTONACT( ui.vcdRadioButton, updateMRL());\n BUTTONACT( ui.audioCDRadioButton, updateMRL());\n\n CONNECT( ui.titleSpin, valueChanged(int), this, updateMRL());\n CONNECT( ui.chapterSpin, valueChanged(int), this, updateMRL());\n}\n\nDiskOpenPanel::~DiskOpenPanel()\n{}\n\nvoid DiskOpenPanel::clear()\n{\n ui.titleSpin->setValue(0);\n ui.chapterSpin->setValue(0);\n}\n\nvoid DiskOpenPanel::updateMRL()\n{\n QString mrl = \"\";\n \/* DVD *\/\n if( ui.dvdRadioButton->isChecked() ) {\n mrl = \"dvd:\/\/\" + ui.deviceCombo->currentText();\n emit methodChanged( \"dvdnav-caching\" );\n\n if ( ui.titleSpin->value() > 0 ) {\n mrl += QString(\"@%1\").arg(ui.titleSpin->value());\n if ( ui.chapterSpin->value() > 0 ) {\n mrl+= QString(\":%1\").arg(ui.chapterSpin->value());\n }\n }\n\n \/* VCD *\/\n } else if (ui.vcdRadioButton->isChecked() ) {\n mrl = \"vcd:\/\/\" + ui.deviceCombo->currentText();\n emit methodChanged( \"vcd-caching\" );\n\n if( ui.titleSpin->value() > 0 ) {\n mrl += QString(\"@%1\").arg(ui.titleSpin->value());\n }\n\n \/* CDDA *\/\n } else {\n mrl = \"cdda:\/\/\" + ui.deviceCombo->currentText();\n }\n\n emit mrlUpdated(mrl);\n}\n\n\n\n\/**************************************************************************\n * Net open\n **************************************************************************\/\nNetOpenPanel::NetOpenPanel( QWidget *_parent, intf_thread_t *_p_intf ) :\n OpenPanel( _parent, _p_intf )\n{\n ui.setupUi( this );\n\n CONNECT( ui.protocolCombo, currentIndexChanged(int),\n this, updateProtocol(int) );\n CONNECT( ui.portSpin, valueChanged(int), this, updateMRL());\n CONNECT( ui.addressText, textChanged(QString), this, updateAddress());\n CONNECT( ui.timeShift, clicked(), this, updateMRL());\n CONNECT( ui.ipv6, clicked(), this, updateMRL());\n\n ui.protocolCombo->addItem(\"HTTP\", QVariant(\"http\"));\n ui.protocolCombo->addItem(\"FTP\", QVariant(\"ftp\"));\n ui.protocolCombo->addItem(\"MMS\", QVariant(\"mms\"));\n ui.protocolCombo->addItem(\"RTSP\", QVariant(\"rtsp\"));\n ui.protocolCombo->addItem(\"UDP\/RTP (unicast)\", QVariant(\"udp\"));\n ui.protocolCombo->addItem(\"UDP\/RTP (multicast)\", QVariant(\"udp\"));\n}\n\nNetOpenPanel::~NetOpenPanel()\n{}\n\nvoid NetOpenPanel::clear()\n{}\n\nvoid NetOpenPanel::updateProtocol(int idx) {\n QString addr = ui.addressText->text();\n QString proto = ui.protocolCombo->itemData(idx).toString();\n\n ui.timeShift->setEnabled( idx >= 4);\n ui.ipv6->setEnabled( idx == 4 );\n ui.addressText->setEnabled( idx != 4 );\n ui.portSpin->setEnabled( idx >= 4 );\n\n \/* If we already have a protocol in the address, replace it *\/\n if( addr.contains( \":\/\/\")) {\n msg_Err( p_intf, \"replace\");\n addr.replace(QRegExp(\"^.*:\/\/\"), proto + \":\/\/\");\n ui.addressText->setText(addr);\n }\n\n updateMRL();\n}\n\nvoid NetOpenPanel::updateAddress() {\n updateMRL();\n}\n\nvoid NetOpenPanel::updateMRL() {\n QString mrl = \"\";\n QString addr = ui.addressText->text();\n int proto = ui.protocolCombo->currentIndex();\n\n if( addr.contains( \":\/\/\") && proto != 4 ) {\n mrl = addr;\n } else {\n switch(proto) {\n case 0:\n mrl = \"http:\/\/\" + addr;\n emit methodChanged(\"http-caching\");\n break;\n case 2:\n mrl = \"mms:\/\/\" + addr;\n emit methodChanged(\"mms-caching\");\n break;\n case 1:\n mrl = \"ftp:\/\/\" + addr;\n emit methodChanged(\"ftp-caching\");\n break;\n case 3: \/* RTSP *\/\n mrl = \"rtsp:\/\/\" + addr;\n emit methodChanged(\"rtsp-caching\");\n break;\n case 4:\n mrl = \"udp:\/\/@\";\n if( ui.ipv6->isEnabled() && ui.ipv6->isChecked() ) {\n mrl += \"[::]\";\n }\n mrl += QString(\":%1\").arg(ui.portSpin->value());\n emit methodChanged(\"udp-caching\");\n break;\n case 5: \/* UDP multicast *\/\n mrl = \"udp:\/\/@\";\n \/* Add [] to IPv6 *\/\n if ( addr.contains(':') && !addr.contains('[') ) {\n mrl += \"[\" + addr + \"]\";\n } else mrl += addr;\n mrl += QString(\":%1\").arg(ui.portSpin->value());\n emit methodChanged(\"udp-caching\");\n }\n }\n if( ui.timeShift->isEnabled() && ui.timeShift->isChecked() ) {\n mrl += \" :access-filter=timeshift\";\n }\n emit mrlUpdated(mrl);\n}\n\n\/**************************************************************************\n * Capture open\n **************************************************************************\/\nCaptureOpenPanel::CaptureOpenPanel( QWidget *_parent, intf_thread_t *_p_intf ) :\n OpenPanel( _parent, _p_intf )\n{\n ui.setupUi( this );\n}\n\nCaptureOpenPanel::~CaptureOpenPanel()\n{}\n\nvoid CaptureOpenPanel::clear()\n{}\n\nvoid CaptureOpenPanel::updateMRL()\n{\n QString mrl = \"\";\n emit mrlUpdated(mrl);\n}\n<commit_msg>* use freetype-rel-fontsize instead of sub-rel-fontsize<commit_after>\/*****************************************************************************\n * open.cpp : Panels for the open dialogs\n ****************************************************************************\n * Copyright (C) 2006 the VideoLAN team\n * $Id$\n *\n * Authors: Clément Stenac <zorglub@videolan.org>\n * 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\n * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston MA 02110-1301, USA.\n *****************************************************************************\/\n\n\n#include \"qt4.hpp\"\n#include \"components\/open.hpp\"\n#include \"dialogs_provider.hpp\"\n#include \"util\/customwidgets.hpp\"\n\n#include <QFileDialog>\n#include <QDialogButtonBox>\n#include <QLineEdit>\n\n\/**************************************************************************\n * File open\n **************************************************************************\/\nFileOpenPanel::FileOpenPanel( QWidget *_parent, intf_thread_t *_p_intf ) :\n OpenPanel( _parent, _p_intf )\n{\n \/* Classic UI Setup *\/\n ui.setupUi( this );\n\n \/* Use a QFileDialog and customize it because we don't want to\n rewrite it all. Be careful to your eyes cause there are a few hacks.\n Be very careful and test correctly when you modify this. *\/\n\n \/* Set Filters for file selection *\/\n QString fileTypes = \"\";\n ADD_FILTER_MEDIA( fileTypes );\n ADD_FILTER_VIDEO( fileTypes );\n ADD_FILTER_AUDIO( fileTypes );\n ADD_FILTER_PLAYLIST( fileTypes );\n ADD_FILTER_ALL( fileTypes );\n fileTypes.replace(QString(\";*\"), QString(\" *\"));\n\n \/\/ Make this QFileDialog a child of tempWidget from the ui.\n dialogBox = new QFileDialog( ui.tempWidget, NULL,\n qfu( p_intf->p_libvlc->psz_homedir ), fileTypes );\n dialogBox->setFileMode( QFileDialog::ExistingFiles );\n \/* We don't want to see a grip in the middle of the window, do we? *\/\n dialogBox->setSizeGripEnabled( false );\n dialogBox->setToolTip( qtr( \"Select one or multiple files, or a folder\" ));\n\n \/\/ Add it to the layout\n ui.gridLayout->addWidget( dialogBox, 0, 0, 1, 3 );\n\n \/\/ But hide the two OK\/Cancel buttons. Enable them for debug.\n#ifndef WIN32\n findChild<QDialogButtonBox*>()->hide();\n#endif\n\n \/* Ugly hacks to get the good Widget *\/\n \/\/This lineEdit is the normal line in the fileDialog.\n lineFileEdit = findChildren<QLineEdit*>()[3];\n lineFileEdit->hide();\n\n \/* Make a list of QLabel inside the QFileDialog to access the good ones *\/\n QList<QLabel *> listLabel = findChildren<QLabel*>();\n\n \/* Hide the FileNames one. Enable it for debug *\/\n listLabel[4]->hide();\n \/* Change the text that was uncool in the usual box *\/\n listLabel[5]->setText( qtr( \"Filter:\" ) );\n\n \/* Hacks Continued Catch the close event *\/\n dialogBox->installEventFilter( this );\n\n \/\/ Hide the subtitles control by default.\n ui.subFrame->hide();\n\n \/* Build the subs size combo box *\/\n module_config_t *p_item =\n config_FindConfig( VLC_OBJECT(p_intf), \"freetype-rel-fontsize\" );\n if( p_item )\n {\n for( int i_index = 0; i_index < p_item->i_list; i_index++ )\n {\n ui.sizeSubComboBox->addItem(\n qfu( p_item->ppsz_list_text[i_index] ),\n QVariant( p_item->pi_list[i_index] ) );\n if( p_item->value.i == p_item->pi_list[i_index] )\n {\n ui.sizeSubComboBox->setCurrentIndex( i_index );\n }\n }\n }\n\n \/* Build the subs align combo box *\/\n p_item = config_FindConfig( VLC_OBJECT(p_intf), \"subsdec-align\" );\n if( p_item )\n {\n for( int i_index = 0; i_index < p_item->i_list; i_index++ )\n {\n ui.alignSubComboBox->addItem(\n qfu( p_item->ppsz_list_text[i_index] ),\n QVariant( p_item->pi_list[i_index] ) );\n if( p_item->value.i == p_item->pi_list[i_index] )\n {\n ui.alignSubComboBox->setCurrentIndex( i_index );\n }\n }\n }\n\n BUTTONACT( ui.subBrowseButton, browseFileSub() );\n BUTTONACT( ui.subCheckBox, toggleSubtitleFrame());\n\n CONNECT( ui.fileInput, editTextChanged(QString ), this, updateMRL());\n CONNECT( ui.subInput, editTextChanged(QString ), this, updateMRL());\n CONNECT( ui.alignSubComboBox, currentIndexChanged(int), this, updateMRL());\n CONNECT( ui.sizeSubComboBox, currentIndexChanged(int), this, updateMRL());\n CONNECT( lineFileEdit, textChanged( QString ), this, browseFile());\n}\n\nFileOpenPanel::~FileOpenPanel()\n{}\n\nQStringList FileOpenPanel::browse(QString help)\n{\n return THEDP->showSimpleOpen( help );\n}\n\nvoid FileOpenPanel::browseFile()\n{\n QString fileString = \"\";\n foreach( QString file, dialogBox->selectedFiles() ) {\n fileString += \"\\\"\" + file + \"\\\" \";\n }\n ui.fileInput->setEditText( fileString );\n updateMRL();\n}\n\nvoid FileOpenPanel::browseFileSub()\n{\n \/\/ FIXME Handle selection of more than one subtitles file\n QStringList files = THEDP->showSimpleOpen( qtr(\"Open subtitles file\"),\n EXT_FILTER_SUBTITLE,\n dialogBox->directory().absolutePath() );\n ui.subInput->setEditText( files.join(\" \") );\n updateMRL();\n}\n\nvoid FileOpenPanel::updateMRL()\n{\n QString mrl = ui.fileInput->currentText();\n\n if( ui.subCheckBox->isChecked() ) {\n mrl.append( \" :sub-file=\" + ui.subInput->currentText() );\n int align = ui.alignSubComboBox->itemData( ui.alignSubComboBox->currentIndex() ).toInt();\n mrl.append( \" :subsdec-align=\" + QString().setNum( align ) );\n int size = ui.sizeSubComboBox->itemData( ui.sizeSubComboBox->currentIndex() ).toInt();\n mrl.append( \" :freetype-rel-fontsize=\" + QString().setNum( size ) );\n }\n emit mrlUpdated( mrl );\n emit methodChanged( \"file-caching\" );\n}\n\n\n\/* Function called by Open Dialog when clicke on Play\/Enqueue *\/\nvoid FileOpenPanel::accept()\n{\n ui.fileInput->addItem(ui.fileInput->currentText());\n if ( ui.fileInput->count() > 8 ) ui.fileInput->removeItem(0);\n}\n\n\n\/* Function called by Open Dialog when clicked on cancel *\/\nvoid FileOpenPanel::clear()\n{\n ui.fileInput->setEditText( \"\" );\n ui.subInput->setEditText( \"\" );\n}\n\nbool FileOpenPanel::eventFilter(QObject *object, QEvent *event)\n{\n if ( ( object == dialogBox ) && ( event->type() == QEvent::Hide ) )\n {\n event->ignore();\n return true;\n }\n \/\/ standard event processing\n else\n return QObject::eventFilter(object, event);\n}\n\nvoid FileOpenPanel::toggleSubtitleFrame()\n{\n if (ui.subFrame->isVisible())\n {\n ui.subFrame->hide();\n\/\/ setMinimumHeight(1);\n resize( sizeHint());\n }\n else\n {\n ui.subFrame->show();\n }\n\n \/* Update the MRL *\/\n updateMRL();\n}\n\n\/**************************************************************************\n * Disk open\n **************************************************************************\/\nDiskOpenPanel::DiskOpenPanel( QWidget *_parent, intf_thread_t *_p_intf ) :\n OpenPanel( _parent, _p_intf )\n{\n ui.setupUi( this );\n\n CONNECT( ui.deviceCombo, editTextChanged(QString ), this, updateMRL());\n BUTTONACT( ui.dvdRadioButton, updateMRL());\n BUTTONACT( ui.vcdRadioButton, updateMRL());\n BUTTONACT( ui.audioCDRadioButton, updateMRL());\n\n CONNECT( ui.titleSpin, valueChanged(int), this, updateMRL());\n CONNECT( ui.chapterSpin, valueChanged(int), this, updateMRL());\n}\n\nDiskOpenPanel::~DiskOpenPanel()\n{}\n\nvoid DiskOpenPanel::clear()\n{\n ui.titleSpin->setValue(0);\n ui.chapterSpin->setValue(0);\n}\n\nvoid DiskOpenPanel::updateMRL()\n{\n QString mrl = \"\";\n \/* DVD *\/\n if( ui.dvdRadioButton->isChecked() ) {\n mrl = \"dvd:\/\/\" + ui.deviceCombo->currentText();\n emit methodChanged( \"dvdnav-caching\" );\n\n if ( ui.titleSpin->value() > 0 ) {\n mrl += QString(\"@%1\").arg(ui.titleSpin->value());\n if ( ui.chapterSpin->value() > 0 ) {\n mrl+= QString(\":%1\").arg(ui.chapterSpin->value());\n }\n }\n\n \/* VCD *\/\n } else if (ui.vcdRadioButton->isChecked() ) {\n mrl = \"vcd:\/\/\" + ui.deviceCombo->currentText();\n emit methodChanged( \"vcd-caching\" );\n\n if( ui.titleSpin->value() > 0 ) {\n mrl += QString(\"@%1\").arg(ui.titleSpin->value());\n }\n\n \/* CDDA *\/\n } else {\n mrl = \"cdda:\/\/\" + ui.deviceCombo->currentText();\n }\n\n emit mrlUpdated(mrl);\n}\n\n\n\n\/**************************************************************************\n * Net open\n **************************************************************************\/\nNetOpenPanel::NetOpenPanel( QWidget *_parent, intf_thread_t *_p_intf ) :\n OpenPanel( _parent, _p_intf )\n{\n ui.setupUi( this );\n\n CONNECT( ui.protocolCombo, currentIndexChanged(int),\n this, updateProtocol(int) );\n CONNECT( ui.portSpin, valueChanged(int), this, updateMRL());\n CONNECT( ui.addressText, textChanged(QString), this, updateAddress());\n CONNECT( ui.timeShift, clicked(), this, updateMRL());\n CONNECT( ui.ipv6, clicked(), this, updateMRL());\n\n ui.protocolCombo->addItem(\"HTTP\", QVariant(\"http\"));\n ui.protocolCombo->addItem(\"FTP\", QVariant(\"ftp\"));\n ui.protocolCombo->addItem(\"MMS\", QVariant(\"mms\"));\n ui.protocolCombo->addItem(\"RTSP\", QVariant(\"rtsp\"));\n ui.protocolCombo->addItem(\"UDP\/RTP (unicast)\", QVariant(\"udp\"));\n ui.protocolCombo->addItem(\"UDP\/RTP (multicast)\", QVariant(\"udp\"));\n}\n\nNetOpenPanel::~NetOpenPanel()\n{}\n\nvoid NetOpenPanel::clear()\n{}\n\nvoid NetOpenPanel::updateProtocol(int idx) {\n QString addr = ui.addressText->text();\n QString proto = ui.protocolCombo->itemData(idx).toString();\n\n ui.timeShift->setEnabled( idx >= 4);\n ui.ipv6->setEnabled( idx == 4 );\n ui.addressText->setEnabled( idx != 4 );\n ui.portSpin->setEnabled( idx >= 4 );\n\n \/* If we already have a protocol in the address, replace it *\/\n if( addr.contains( \":\/\/\")) {\n msg_Err( p_intf, \"replace\");\n addr.replace(QRegExp(\"^.*:\/\/\"), proto + \":\/\/\");\n ui.addressText->setText(addr);\n }\n\n updateMRL();\n}\n\nvoid NetOpenPanel::updateAddress() {\n updateMRL();\n}\n\nvoid NetOpenPanel::updateMRL() {\n QString mrl = \"\";\n QString addr = ui.addressText->text();\n int proto = ui.protocolCombo->currentIndex();\n\n if( addr.contains( \":\/\/\") && proto != 4 ) {\n mrl = addr;\n } else {\n switch(proto) {\n case 0:\n mrl = \"http:\/\/\" + addr;\n emit methodChanged(\"http-caching\");\n break;\n case 2:\n mrl = \"mms:\/\/\" + addr;\n emit methodChanged(\"mms-caching\");\n break;\n case 1:\n mrl = \"ftp:\/\/\" + addr;\n emit methodChanged(\"ftp-caching\");\n break;\n case 3: \/* RTSP *\/\n mrl = \"rtsp:\/\/\" + addr;\n emit methodChanged(\"rtsp-caching\");\n break;\n case 4:\n mrl = \"udp:\/\/@\";\n if( ui.ipv6->isEnabled() && ui.ipv6->isChecked() ) {\n mrl += \"[::]\";\n }\n mrl += QString(\":%1\").arg(ui.portSpin->value());\n emit methodChanged(\"udp-caching\");\n break;\n case 5: \/* UDP multicast *\/\n mrl = \"udp:\/\/@\";\n \/* Add [] to IPv6 *\/\n if ( addr.contains(':') && !addr.contains('[') ) {\n mrl += \"[\" + addr + \"]\";\n } else mrl += addr;\n mrl += QString(\":%1\").arg(ui.portSpin->value());\n emit methodChanged(\"udp-caching\");\n }\n }\n if( ui.timeShift->isEnabled() && ui.timeShift->isChecked() ) {\n mrl += \" :access-filter=timeshift\";\n }\n emit mrlUpdated(mrl);\n}\n\n\/**************************************************************************\n * Capture open\n **************************************************************************\/\nCaptureOpenPanel::CaptureOpenPanel( QWidget *_parent, intf_thread_t *_p_intf ) :\n OpenPanel( _parent, _p_intf )\n{\n ui.setupUi( this );\n}\n\nCaptureOpenPanel::~CaptureOpenPanel()\n{}\n\nvoid CaptureOpenPanel::clear()\n{}\n\nvoid CaptureOpenPanel::updateMRL()\n{\n QString mrl = \"\";\n emit mrlUpdated(mrl);\n}\n<|endoftext|>"} {"text":"<commit_before>\/*****************************************************************************\n * open.cpp : Panels for the open dialogs\n ****************************************************************************\n * Copyright (C) 2006 the VideoLAN team\n * $Id$\n *\n * Authors: Clément Stenac <zorglub@videolan.org>\n * 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\n * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston MA 02110-1301, USA.\n *****************************************************************************\/\n\n\n#include \"qt4.hpp\"\n#include \"components\/open.hpp\"\n#include \"dialogs\/open.hpp\"\n#include \"dialogs_provider.hpp\"\n#include \"util\/customwidgets.hpp\"\n\n#include <QFileDialog>\n#include <QDialogButtonBox>\n#include <QLineEdit>\n\n\/**************************************************************************\n * File open\n **************************************************************************\/\nFileOpenPanel::FileOpenPanel( QWidget *_parent, intf_thread_t *_p_intf ) :\n OpenPanel( _parent, _p_intf )\n{\n \/* Classic UI Setup *\/\n ui.setupUi( this );\n\n \/* Use a QFileDialog and customize it because we don't want to\n rewrite it all. Be careful to your eyes cause there are a few hacks.\n Be very careful and test correctly when you modify this. *\/\n\n \/* Set Filters for file selection *\/\n QString fileTypes = \"\";\n ADD_FILTER_MEDIA( fileTypes );\n ADD_FILTER_VIDEO( fileTypes );\n ADD_FILTER_AUDIO( fileTypes );\n ADD_FILTER_PLAYLIST( fileTypes );\n ADD_FILTER_ALL( fileTypes );\n fileTypes.replace(QString(\";*\"), QString(\" *\"));\n\n \/\/ Make this QFileDialog a child of tempWidget from the ui.\n dialogBox = new FileOpenBox( ui.tempWidget, NULL,\n qfu( p_intf->p_libvlc->psz_homedir ), fileTypes );\n dialogBox->setFileMode( QFileDialog::ExistingFiles );\n \/* We don't want to see a grip in the middle of the window, do we? *\/\n dialogBox->setSizeGripEnabled( false );\n dialogBox->setToolTip( qtr( \"Select one or multiple files, or a folder\" ));\n\n \/\/ Add it to the layout\n ui.gridLayout->addWidget( dialogBox, 0, 0, 1, 3 );\n\n \/\/ But hide the two OK\/Cancel buttons. Enable them for debug.\n#ifndef WIN32\n findChild<QDialogButtonBox*>()->hide();\n#endif\n\n \/* Ugly hacks to get the good Widget *\/\n \/\/This lineEdit is the normal line in the fileDialog.\n lineFileEdit = findChildren<QLineEdit*>()[3];\n lineFileEdit->hide();\n\n \/* Make a list of QLabel inside the QFileDialog to access the good ones *\/\n QList<QLabel *> listLabel = findChildren<QLabel*>();\n\n \/* Hide the FileNames one. Enable it for debug *\/\n listLabel[4]->hide();\n \/* Change the text that was uncool in the usual box *\/\n listLabel[5]->setText( qtr( \"Filter:\" ) );\n\n \/\/ Hide the subtitles control by default.\n ui.subFrame->hide();\n\n \/* Build the subs size combo box *\/\n module_config_t *p_item =\n config_FindConfig( VLC_OBJECT(p_intf), \"freetype-rel-fontsize\" );\n if( p_item )\n {\n for( int i_index = 0; i_index < p_item->i_list; i_index++ )\n {\n ui.sizeSubComboBox->addItem(\n qfu( p_item->ppsz_list_text[i_index] ),\n QVariant( p_item->pi_list[i_index] ) );\n if( p_item->value.i == p_item->pi_list[i_index] )\n {\n ui.sizeSubComboBox->setCurrentIndex( i_index );\n }\n }\n }\n\n \/* Build the subs align combo box *\/\n p_item = config_FindConfig( VLC_OBJECT(p_intf), \"subsdec-align\" );\n if( p_item )\n {\n for( int i_index = 0; i_index < p_item->i_list; i_index++ )\n {\n ui.alignSubComboBox->addItem(\n qfu( p_item->ppsz_list_text[i_index] ),\n QVariant( p_item->pi_list[i_index] ) );\n if( p_item->value.i == p_item->pi_list[i_index] )\n {\n ui.alignSubComboBox->setCurrentIndex( i_index );\n }\n }\n }\n\n BUTTONACT( ui.subBrowseButton, browseFileSub() );\n BUTTONACT( ui.subCheckBox, toggleSubtitleFrame());\n\n CONNECT( ui.fileInput, editTextChanged(QString ), this, updateMRL());\n CONNECT( ui.subInput, editTextChanged(QString ), this, updateMRL());\n CONNECT( ui.alignSubComboBox, currentIndexChanged(int), this, updateMRL());\n CONNECT( ui.sizeSubComboBox, currentIndexChanged(int), this, updateMRL());\n CONNECT( lineFileEdit, textChanged( QString ), this, browseFile());\n}\n\nFileOpenPanel::~FileOpenPanel()\n{}\n\nQStringList FileOpenPanel::browse(QString help)\n{\n return THEDP->showSimpleOpen( help );\n}\n\nvoid FileOpenPanel::browseFile()\n{\n QString fileString = \"\";\n foreach( QString file, dialogBox->selectedFiles() ) {\n fileString += \"\\\"\" + file + \"\\\" \";\n }\n ui.fileInput->setEditText( fileString );\n updateMRL();\n}\n\nvoid FileOpenPanel::browseFileSub()\n{\n \/\/ FIXME Handle selection of more than one subtitles file\n QStringList files = THEDP->showSimpleOpen( qtr(\"Open subtitles file\"),\n EXT_FILTER_SUBTITLE,\n dialogBox->directory().absolutePath() );\n if( files.isEmpty() ) return;\n ui.subInput->setEditText( files.join(\" \") );\n updateMRL();\n}\n\nvoid FileOpenPanel::updateMRL()\n{\n QString mrl = ui.fileInput->currentText();\n\n if( ui.subCheckBox->isChecked() ) {\n mrl.append( \" :sub-file=\" + ui.subInput->currentText() );\n int align = ui.alignSubComboBox->itemData( ui.alignSubComboBox->currentIndex() ).toInt();\n mrl.append( \" :subsdec-align=\" + QString().setNum( align ) );\n int size = ui.sizeSubComboBox->itemData( ui.sizeSubComboBox->currentIndex() ).toInt();\n mrl.append( \" :freetype-rel-fontsize=\" + QString().setNum( size ) );\n }\n emit mrlUpdated( mrl );\n emit methodChanged( \"file-caching\" );\n}\n\n\n\/* Function called by Open Dialog when clicke on Play\/Enqueue *\/\nvoid FileOpenPanel::accept()\n{\n ui.fileInput->addItem(ui.fileInput->currentText());\n if ( ui.fileInput->count() > 8 ) ui.fileInput->removeItem(0);\n}\n\nvoid FileOpenBox::accept()\n{\n OpenDialog::getInstance( NULL, NULL )->play();\n}\n\n\/* Function called by Open Dialog when clicked on cancel *\/\nvoid FileOpenPanel::clear()\n{\n ui.fileInput->setEditText( \"\" );\n ui.subInput->setEditText( \"\" );\n}\n\nvoid FileOpenPanel::toggleSubtitleFrame()\n{\n if (ui.subFrame->isVisible())\n {\n ui.subFrame->hide();\n\/\/ setMinimumHeight(1);\n resize( sizeHint());\n }\n else\n {\n ui.subFrame->show();\n }\n\n \/* Update the MRL *\/\n updateMRL();\n}\n\n\/**************************************************************************\n * Disk open\n **************************************************************************\/\nDiskOpenPanel::DiskOpenPanel( QWidget *_parent, intf_thread_t *_p_intf ) :\n OpenPanel( _parent, _p_intf )\n{\n ui.setupUi( this );\n\n CONNECT( ui.deviceCombo, editTextChanged(QString ), this, updateMRL());\n BUTTONACT( ui.dvdRadioButton, updateMRL());\n BUTTONACT( ui.vcdRadioButton, updateMRL());\n BUTTONACT( ui.audioCDRadioButton, updateMRL());\n\n CONNECT( ui.titleSpin, valueChanged(int), this, updateMRL());\n CONNECT( ui.chapterSpin, valueChanged(int), this, updateMRL());\n}\n\nDiskOpenPanel::~DiskOpenPanel()\n{}\n\nvoid DiskOpenPanel::clear()\n{\n ui.titleSpin->setValue(0);\n ui.chapterSpin->setValue(0);\n}\n\nvoid DiskOpenPanel::updateMRL()\n{\n QString mrl = \"\";\n \/* DVD *\/\n if( ui.dvdRadioButton->isChecked() ) {\n mrl = \"dvd:\/\/\" + ui.deviceCombo->currentText();\n emit methodChanged( \"dvdnav-caching\" );\n\n if ( ui.titleSpin->value() > 0 ) {\n mrl += QString(\"@%1\").arg(ui.titleSpin->value());\n if ( ui.chapterSpin->value() > 0 ) {\n mrl+= QString(\":%1\").arg(ui.chapterSpin->value());\n }\n }\n\n \/* VCD *\/\n } else if (ui.vcdRadioButton->isChecked() ) {\n mrl = \"vcd:\/\/\" + ui.deviceCombo->currentText();\n emit methodChanged( \"vcd-caching\" );\n\n if( ui.titleSpin->value() > 0 ) {\n mrl += QString(\"@%1\").arg(ui.titleSpin->value());\n }\n\n \/* CDDA *\/\n } else {\n mrl = \"cdda:\/\/\" + ui.deviceCombo->currentText();\n }\n\n emit mrlUpdated(mrl);\n}\n\n\n\n\/**************************************************************************\n * Net open\n **************************************************************************\/\nNetOpenPanel::NetOpenPanel( QWidget *_parent, intf_thread_t *_p_intf ) :\n OpenPanel( _parent, _p_intf )\n{\n ui.setupUi( this );\n\n CONNECT( ui.protocolCombo, currentIndexChanged(int),\n this, updateProtocol(int) );\n CONNECT( ui.portSpin, valueChanged(int), this, updateMRL());\n CONNECT( ui.addressText, textChanged(QString), this, updateAddress());\n CONNECT( ui.timeShift, clicked(), this, updateMRL());\n CONNECT( ui.ipv6, clicked(), this, updateMRL());\n\n ui.protocolCombo->addItem(\"HTTP\", QVariant(\"http\"));\n ui.protocolCombo->addItem(\"FTP\", QVariant(\"ftp\"));\n ui.protocolCombo->addItem(\"MMS\", QVariant(\"mms\"));\n ui.protocolCombo->addItem(\"RTSP\", QVariant(\"rtsp\"));\n ui.protocolCombo->addItem(\"UDP\/RTP (unicast)\", QVariant(\"udp\"));\n ui.protocolCombo->addItem(\"UDP\/RTP (multicast)\", QVariant(\"udp\"));\n}\n\nNetOpenPanel::~NetOpenPanel()\n{}\n\nvoid NetOpenPanel::clear()\n{}\n\nvoid NetOpenPanel::updateProtocol(int idx) {\n QString addr = ui.addressText->text();\n QString proto = ui.protocolCombo->itemData(idx).toString();\n\n ui.timeShift->setEnabled( idx >= 4);\n ui.ipv6->setEnabled( idx == 4 );\n ui.addressText->setEnabled( idx != 4 );\n ui.portSpin->setEnabled( idx >= 4 );\n\n \/* If we already have a protocol in the address, replace it *\/\n if( addr.contains( \":\/\/\")) {\n msg_Err( p_intf, \"replace\");\n addr.replace(QRegExp(\"^.*:\/\/\"), proto + \":\/\/\");\n ui.addressText->setText(addr);\n }\n\n updateMRL();\n}\n\nvoid NetOpenPanel::updateAddress() {\n updateMRL();\n}\n\nvoid NetOpenPanel::updateMRL() {\n QString mrl = \"\";\n QString addr = ui.addressText->text();\n int proto = ui.protocolCombo->currentIndex();\n\n if( addr.contains( \":\/\/\") && proto != 4 ) {\n mrl = addr;\n } else {\n switch(proto) {\n case 0:\n mrl = \"http:\/\/\" + addr;\n emit methodChanged(\"http-caching\");\n break;\n case 2:\n mrl = \"mms:\/\/\" + addr;\n emit methodChanged(\"mms-caching\");\n break;\n case 1:\n mrl = \"ftp:\/\/\" + addr;\n emit methodChanged(\"ftp-caching\");\n break;\n case 3: \/* RTSP *\/\n mrl = \"rtsp:\/\/\" + addr;\n emit methodChanged(\"rtsp-caching\");\n break;\n case 4:\n mrl = \"udp:\/\/@\";\n if( ui.ipv6->isEnabled() && ui.ipv6->isChecked() ) {\n mrl += \"[::]\";\n }\n mrl += QString(\":%1\").arg(ui.portSpin->value());\n emit methodChanged(\"udp-caching\");\n break;\n case 5: \/* UDP multicast *\/\n mrl = \"udp:\/\/@\";\n \/* Add [] to IPv6 *\/\n if ( addr.contains(':') && !addr.contains('[') ) {\n mrl += \"[\" + addr + \"]\";\n } else mrl += addr;\n mrl += QString(\":%1\").arg(ui.portSpin->value());\n emit methodChanged(\"udp-caching\");\n }\n }\n if( ui.timeShift->isEnabled() && ui.timeShift->isChecked() ) {\n mrl += \" :access-filter=timeshift\";\n }\n emit mrlUpdated(mrl);\n}\n\n\/**************************************************************************\n * Capture open\n **************************************************************************\/\nCaptureOpenPanel::CaptureOpenPanel( QWidget *_parent, intf_thread_t *_p_intf ) :\n OpenPanel( _parent, _p_intf )\n{\n ui.setupUi( this );\n}\n\nCaptureOpenPanel::~CaptureOpenPanel()\n{}\n\nvoid CaptureOpenPanel::clear()\n{}\n\nvoid CaptureOpenPanel::updateMRL()\n{\n QString mrl = \"\";\n emit mrlUpdated(mrl);\n}\n<commit_msg>qt4 - small and unimportant cosmetic change.<commit_after>\/*****************************************************************************\n * open.cpp : Panels for the open dialogs\n ****************************************************************************\n * Copyright (C) 2006 the VideoLAN team\n * $Id$\n *\n * Authors: Clément Stenac <zorglub@videolan.org>\n * 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\n * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston MA 02110-1301, USA.\n *****************************************************************************\/\n\n\n#include \"qt4.hpp\"\n#include \"components\/open.hpp\"\n#include \"dialogs\/open.hpp\"\n#include \"dialogs_provider.hpp\"\n#include \"util\/customwidgets.hpp\"\n\n#include <QFileDialog>\n#include <QDialogButtonBox>\n#include <QLineEdit>\n\n\/**************************************************************************\n * File open\n **************************************************************************\/\nFileOpenPanel::FileOpenPanel( QWidget *_parent, intf_thread_t *_p_intf ) :\n OpenPanel( _parent, _p_intf )\n{\n \/* Classic UI Setup *\/\n ui.setupUi( this );\n\n \/* Use a QFileDialog and customize it because we don't want to\n rewrite it all. Be careful to your eyes cause there are a few hacks.\n Be very careful and test correctly when you modify this. *\/\n\n \/* Set Filters for file selection *\/\n QString fileTypes = \"\";\n ADD_FILTER_MEDIA( fileTypes );\n ADD_FILTER_VIDEO( fileTypes );\n ADD_FILTER_AUDIO( fileTypes );\n ADD_FILTER_PLAYLIST( fileTypes );\n ADD_FILTER_ALL( fileTypes );\n fileTypes.replace(QString(\";*\"), QString(\" *\"));\n\n \/\/ Make this QFileDialog a child of tempWidget from the ui.\n dialogBox = new FileOpenBox( ui.tempWidget, NULL,\n qfu( p_intf->p_libvlc->psz_homedir ), fileTypes );\n dialogBox->setFileMode( QFileDialog::ExistingFiles );\n dialogBox->setAcceptMode( QFileDialog::AcceptOpen );\n\n \/* We don't want to see a grip in the middle of the window, do we? *\/\n dialogBox->setSizeGripEnabled( false );\n dialogBox->setToolTip( qtr( \"Select one or multiple files, or a folder\" ));\n\n \/\/ Add it to the layout\n ui.gridLayout->addWidget( dialogBox, 0, 0, 1, 3 );\n\n \/\/ But hide the two OK\/Cancel buttons. Enable them for debug.\n#ifndef WIN32\n findChild<QDialogButtonBox*>()->hide();\n#endif\n\n \/* Ugly hacks to get the good Widget *\/\n \/\/This lineEdit is the normal line in the fileDialog.\n lineFileEdit = findChildren<QLineEdit*>()[3];\n lineFileEdit->hide();\n\n \/* Make a list of QLabel inside the QFileDialog to access the good ones *\/\n QList<QLabel *> listLabel = findChildren<QLabel*>();\n\n \/* Hide the FileNames one. Enable it for debug *\/\n listLabel[4]->hide();\n \/* Change the text that was uncool in the usual box *\/\n listLabel[5]->setText( qtr( \"Filter:\" ) );\n\n \/\/ Hide the subtitles control by default.\n ui.subFrame->hide();\n\n \/* Build the subs size combo box *\/\n module_config_t *p_item =\n config_FindConfig( VLC_OBJECT(p_intf), \"freetype-rel-fontsize\" );\n if( p_item )\n {\n for( int i_index = 0; i_index < p_item->i_list; i_index++ )\n {\n ui.sizeSubComboBox->addItem(\n qfu( p_item->ppsz_list_text[i_index] ),\n QVariant( p_item->pi_list[i_index] ) );\n if( p_item->value.i == p_item->pi_list[i_index] )\n {\n ui.sizeSubComboBox->setCurrentIndex( i_index );\n }\n }\n }\n\n \/* Build the subs align combo box *\/\n p_item = config_FindConfig( VLC_OBJECT(p_intf), \"subsdec-align\" );\n if( p_item )\n {\n for( int i_index = 0; i_index < p_item->i_list; i_index++ )\n {\n ui.alignSubComboBox->addItem(\n qfu( p_item->ppsz_list_text[i_index] ),\n QVariant( p_item->pi_list[i_index] ) );\n if( p_item->value.i == p_item->pi_list[i_index] )\n {\n ui.alignSubComboBox->setCurrentIndex( i_index );\n }\n }\n }\n\n BUTTONACT( ui.subBrowseButton, browseFileSub() );\n BUTTONACT( ui.subCheckBox, toggleSubtitleFrame());\n\n CONNECT( ui.fileInput, editTextChanged(QString ), this, updateMRL());\n CONNECT( ui.subInput, editTextChanged(QString ), this, updateMRL());\n CONNECT( ui.alignSubComboBox, currentIndexChanged(int), this, updateMRL());\n CONNECT( ui.sizeSubComboBox, currentIndexChanged(int), this, updateMRL());\n CONNECT( lineFileEdit, textChanged( QString ), this, browseFile());\n}\n\nFileOpenPanel::~FileOpenPanel()\n{}\n\nQStringList FileOpenPanel::browse(QString help)\n{\n return THEDP->showSimpleOpen( help );\n}\n\nvoid FileOpenPanel::browseFile()\n{\n QString fileString = \"\";\n foreach( QString file, dialogBox->selectedFiles() ) {\n fileString += \"\\\"\" + file + \"\\\" \";\n }\n ui.fileInput->setEditText( fileString );\n updateMRL();\n}\n\nvoid FileOpenPanel::browseFileSub()\n{\n \/\/ FIXME Handle selection of more than one subtitles file\n QStringList files = THEDP->showSimpleOpen( qtr(\"Open subtitles file\"),\n EXT_FILTER_SUBTITLE,\n dialogBox->directory().absolutePath() );\n if( files.isEmpty() ) return;\n ui.subInput->setEditText( files.join(\" \") );\n updateMRL();\n}\n\nvoid FileOpenPanel::updateMRL()\n{\n QString mrl = ui.fileInput->currentText();\n\n if( ui.subCheckBox->isChecked() ) {\n mrl.append( \" :sub-file=\" + ui.subInput->currentText() );\n int align = ui.alignSubComboBox->itemData( ui.alignSubComboBox->currentIndex() ).toInt();\n mrl.append( \" :subsdec-align=\" + QString().setNum( align ) );\n int size = ui.sizeSubComboBox->itemData( ui.sizeSubComboBox->currentIndex() ).toInt();\n mrl.append( \" :freetype-rel-fontsize=\" + QString().setNum( size ) );\n }\n emit mrlUpdated( mrl );\n emit methodChanged( \"file-caching\" );\n}\n\n\n\/* Function called by Open Dialog when clicke on Play\/Enqueue *\/\nvoid FileOpenPanel::accept()\n{\n ui.fileInput->addItem(ui.fileInput->currentText());\n if ( ui.fileInput->count() > 8 ) ui.fileInput->removeItem(0);\n}\n\nvoid FileOpenBox::accept()\n{\n OpenDialog::getInstance( NULL, NULL )->play();\n}\n\n\/* Function called by Open Dialog when clicked on cancel *\/\nvoid FileOpenPanel::clear()\n{\n ui.fileInput->setEditText( \"\" );\n ui.subInput->setEditText( \"\" );\n}\n\nvoid FileOpenPanel::toggleSubtitleFrame()\n{\n if (ui.subFrame->isVisible())\n {\n ui.subFrame->hide();\n\/\/ setMinimumHeight(1);\n resize( sizeHint());\n }\n else\n {\n ui.subFrame->show();\n }\n\n \/* Update the MRL *\/\n updateMRL();\n}\n\n\/**************************************************************************\n * Disk open\n **************************************************************************\/\nDiskOpenPanel::DiskOpenPanel( QWidget *_parent, intf_thread_t *_p_intf ) :\n OpenPanel( _parent, _p_intf )\n{\n ui.setupUi( this );\n\n CONNECT( ui.deviceCombo, editTextChanged(QString ), this, updateMRL());\n BUTTONACT( ui.dvdRadioButton, updateMRL());\n BUTTONACT( ui.vcdRadioButton, updateMRL());\n BUTTONACT( ui.audioCDRadioButton, updateMRL());\n\n CONNECT( ui.titleSpin, valueChanged(int), this, updateMRL());\n CONNECT( ui.chapterSpin, valueChanged(int), this, updateMRL());\n}\n\nDiskOpenPanel::~DiskOpenPanel()\n{}\n\nvoid DiskOpenPanel::clear()\n{\n ui.titleSpin->setValue(0);\n ui.chapterSpin->setValue(0);\n}\n\nvoid DiskOpenPanel::updateMRL()\n{\n QString mrl = \"\";\n \/* DVD *\/\n if( ui.dvdRadioButton->isChecked() ) {\n mrl = \"dvd:\/\/\" + ui.deviceCombo->currentText();\n emit methodChanged( \"dvdnav-caching\" );\n\n if ( ui.titleSpin->value() > 0 ) {\n mrl += QString(\"@%1\").arg(ui.titleSpin->value());\n if ( ui.chapterSpin->value() > 0 ) {\n mrl+= QString(\":%1\").arg(ui.chapterSpin->value());\n }\n }\n\n \/* VCD *\/\n } else if (ui.vcdRadioButton->isChecked() ) {\n mrl = \"vcd:\/\/\" + ui.deviceCombo->currentText();\n emit methodChanged( \"vcd-caching\" );\n\n if( ui.titleSpin->value() > 0 ) {\n mrl += QString(\"@%1\").arg(ui.titleSpin->value());\n }\n\n \/* CDDA *\/\n } else {\n mrl = \"cdda:\/\/\" + ui.deviceCombo->currentText();\n }\n\n emit mrlUpdated(mrl);\n}\n\n\n\n\/**************************************************************************\n * Net open\n **************************************************************************\/\nNetOpenPanel::NetOpenPanel( QWidget *_parent, intf_thread_t *_p_intf ) :\n OpenPanel( _parent, _p_intf )\n{\n ui.setupUi( this );\n\n CONNECT( ui.protocolCombo, currentIndexChanged(int),\n this, updateProtocol(int) );\n CONNECT( ui.portSpin, valueChanged(int), this, updateMRL());\n CONNECT( ui.addressText, textChanged(QString), this, updateAddress());\n CONNECT( ui.timeShift, clicked(), this, updateMRL());\n CONNECT( ui.ipv6, clicked(), this, updateMRL());\n\n ui.protocolCombo->addItem(\"HTTP\", QVariant(\"http\"));\n ui.protocolCombo->addItem(\"FTP\", QVariant(\"ftp\"));\n ui.protocolCombo->addItem(\"MMS\", QVariant(\"mms\"));\n ui.protocolCombo->addItem(\"RTSP\", QVariant(\"rtsp\"));\n ui.protocolCombo->addItem(\"UDP\/RTP (unicast)\", QVariant(\"udp\"));\n ui.protocolCombo->addItem(\"UDP\/RTP (multicast)\", QVariant(\"udp\"));\n}\n\nNetOpenPanel::~NetOpenPanel()\n{}\n\nvoid NetOpenPanel::clear()\n{}\n\nvoid NetOpenPanel::updateProtocol(int idx) {\n QString addr = ui.addressText->text();\n QString proto = ui.protocolCombo->itemData(idx).toString();\n\n ui.timeShift->setEnabled( idx >= 4);\n ui.ipv6->setEnabled( idx == 4 );\n ui.addressText->setEnabled( idx != 4 );\n ui.portSpin->setEnabled( idx >= 4 );\n\n \/* If we already have a protocol in the address, replace it *\/\n if( addr.contains( \":\/\/\")) {\n msg_Err( p_intf, \"replace\");\n addr.replace(QRegExp(\"^.*:\/\/\"), proto + \":\/\/\");\n ui.addressText->setText(addr);\n }\n\n updateMRL();\n}\n\nvoid NetOpenPanel::updateAddress() {\n updateMRL();\n}\n\nvoid NetOpenPanel::updateMRL() {\n QString mrl = \"\";\n QString addr = ui.addressText->text();\n int proto = ui.protocolCombo->currentIndex();\n\n if( addr.contains( \":\/\/\") && proto != 4 ) {\n mrl = addr;\n } else {\n switch(proto) {\n case 0:\n mrl = \"http:\/\/\" + addr;\n emit methodChanged(\"http-caching\");\n break;\n case 2:\n mrl = \"mms:\/\/\" + addr;\n emit methodChanged(\"mms-caching\");\n break;\n case 1:\n mrl = \"ftp:\/\/\" + addr;\n emit methodChanged(\"ftp-caching\");\n break;\n case 3: \/* RTSP *\/\n mrl = \"rtsp:\/\/\" + addr;\n emit methodChanged(\"rtsp-caching\");\n break;\n case 4:\n mrl = \"udp:\/\/@\";\n if( ui.ipv6->isEnabled() && ui.ipv6->isChecked() ) {\n mrl += \"[::]\";\n }\n mrl += QString(\":%1\").arg(ui.portSpin->value());\n emit methodChanged(\"udp-caching\");\n break;\n case 5: \/* UDP multicast *\/\n mrl = \"udp:\/\/@\";\n \/* Add [] to IPv6 *\/\n if ( addr.contains(':') && !addr.contains('[') ) {\n mrl += \"[\" + addr + \"]\";\n } else mrl += addr;\n mrl += QString(\":%1\").arg(ui.portSpin->value());\n emit methodChanged(\"udp-caching\");\n }\n }\n if( ui.timeShift->isEnabled() && ui.timeShift->isChecked() ) {\n mrl += \" :access-filter=timeshift\";\n }\n emit mrlUpdated(mrl);\n}\n\n\/**************************************************************************\n * Capture open\n **************************************************************************\/\nCaptureOpenPanel::CaptureOpenPanel( QWidget *_parent, intf_thread_t *_p_intf ) :\n OpenPanel( _parent, _p_intf )\n{\n ui.setupUi( this );\n}\n\nCaptureOpenPanel::~CaptureOpenPanel()\n{}\n\nvoid CaptureOpenPanel::clear()\n{}\n\nvoid CaptureOpenPanel::updateMRL()\n{\n QString mrl = \"\";\n emit mrlUpdated(mrl);\n}\n<|endoftext|>"} {"text":"<commit_before>\/*\n * SPDX-FileCopyrightText: 2017-2017 CSSlayer <wengxt@gmail.com>\n *\n * SPDX-License-Identifier: LGPL-2.1-or-later\n *\n *\/\n#include \"punctuation.h\"\n#include \"notifications_public.h\"\n#include <boost\/iostreams\/device\/file_descriptor.hpp>\n#include <boost\/iostreams\/stream_buffer.hpp>\n#include <fcitx-config\/iniparser.h>\n#include <fcitx-utils\/charutils.h>\n#include <fcitx-utils\/log.h>\n#include <fcitx-utils\/standardpath.h>\n#include <fcitx-utils\/utf8.h>\n#include <fcitx\/inputcontext.h>\n#include <fcitx\/inputcontextmanager.h>\n#include <fcitx\/inputmethodentry.h>\n#include <fcitx\/inputmethodmanager.h>\n#include <fcitx\/statusarea.h>\n#include <fcitx\/userinterfacemanager.h>\n#include <fcntl.h>\n#include <string_view>\n#include <unordered_set>\n\nusing namespace fcitx;\n\nnamespace {\nstatic const std::string emptyString;\nstatic const std::pair<std::string, std::string> emptyStringPair;\n} \/\/ namespace\n\nbool dontConvertWhenEn(uint32_t c) { return c == '.' || c == ','; }\n\nclass PunctuationState : public InputContextProperty {\npublic:\n std::unordered_map<uint32_t, std::string> lastPuncStack_;\n char lastIsEngOrDigit_ = 0;\n uint32_t notConverted_ = 0;\n bool mayRebuildStateFromSurroundingText_ = false;\n\n std::unordered_map<uint32_t, std::string> lastPuncStackBackup_;\n uint32_t notConvertedBackup_ = 0;\n};\n\nPunctuationProfile::PunctuationProfile(std::istream &in) {\n std::string strBuf;\n while (std::getline(in, strBuf)) {\n auto pair = stringutils::trimInplace(strBuf);\n std::string::size_type start = pair.first, end = pair.second;\n if (start == end) {\n continue;\n }\n std::string text(strBuf.begin() + start, strBuf.begin() + end);\n auto tokens = stringutils::split(strBuf, FCITX_WHITESPACE);\n if (tokens.size() != 2 && tokens.size() != 3) {\n continue;\n }\n\n if (!std::any_of(\n tokens.begin(), tokens.end(),\n [](const std::string &s) { return utf8::validate(s); })) {\n continue;\n }\n \/\/ we don't make # as comment here, # would be consider as a valid char\n if (utf8::lengthValidated(tokens[0]) != 1) {\n continue;\n }\n auto c = utf8::getChar(tokens[0]);\n decltype(puncMap_)::mapped_type p;\n p.first = tokens[1];\n if (tokens.size() > 2) {\n p.second = tokens[2];\n }\n puncMap_.emplace(c, std::move(p));\n }\n}\n\nconst std::pair<std::string, std::string> &\nPunctuationProfile::getPunctuation(uint32_t unicode) const {\n auto iter = puncMap_.find(unicode);\n if (iter == puncMap_.end()) {\n return emptyStringPair;\n }\n return iter->second;\n}\n\nPunctuation::Punctuation(Instance *instance)\n : instance_(instance),\n factory_([](InputContext &) { return new PunctuationState; }) {\n reloadConfig();\n if (!instance_) {\n return;\n }\n instance_->inputContextManager().registerProperty(\"punctuationState\",\n &factory_);\n instance_->userInterfaceManager().registerAction(\"punctuation\",\n &toggleAction_);\n\n commitConn_ = instance_->connect<Instance::CommitFilter>(\n [this](InputContext *ic, const std::string &sentence) {\n auto state = ic->propertyFor(&factory_);\n \/\/ Though sentence is utf8, we only check ascii.\n if (sentence.size() && (charutils::isupper(sentence.back()) ||\n charutils::islower(sentence.back()) ||\n charutils::isdigit(sentence.back()))) {\n state->lastIsEngOrDigit_ = sentence.back();\n } else {\n state->lastIsEngOrDigit_ = '\\0';\n }\n });\n keyEventConn_ = instance_->connect<Instance::KeyEventResult>(\n [this](const KeyEvent &event) {\n auto state = event.inputContext()->propertyFor(&factory_);\n if (event.isRelease()) {\n return;\n }\n if (!event.accepted()) {\n if (event.key().isUAZ() || event.key().isLAZ() ||\n event.key().isDigit()) {\n state->lastIsEngOrDigit_ =\n Key::keySymToUnicode(event.key().sym());\n } else {\n state->lastIsEngOrDigit_ = '\\0';\n }\n }\n });\n eventWatchers_.emplace_back(instance_->watchEvent(\n EventType::InputContextKeyEvent, EventWatcherPhase::PostInputMethod,\n [this](Event &event) {\n auto &keyEvent = static_cast<KeyEvent &>(event);\n if (keyEvent.isRelease()) {\n return;\n }\n if (inWhiteList(keyEvent.inputContext()) &&\n keyEvent.key().checkKeyList(config_.hotkey.value())) {\n setEnabled(!enabled(), keyEvent.inputContext());\n if (notifications()) {\n notifications()->call<INotifications::showTip>(\n \"fcitx-punc-toggle\", \"fcitx\",\n enabled() ? \"fcitx-punc-active\" : \"fcitx-punc-inactive\",\n _(\"Punctuation\"),\n enabled() ? _(\"Full width punctuation is enabled.\")\n : _(\"Full width punctuation is disabled.\"),\n -1);\n }\n return keyEvent.filterAndAccept();\n }\n }));\n eventWatchers_.emplace_back(instance_->watchEvent(\n EventType::InputContextFocusIn, EventWatcherPhase::PostInputMethod,\n [this](Event &event) {\n auto &icEvent = static_cast<InputContextEvent &>(event);\n auto ic = icEvent.inputContext();\n auto state = ic->propertyFor(&factory_);\n if (ic->capabilityFlags().test(CapabilityFlag::SurroundingText)) {\n state->mayRebuildStateFromSurroundingText_ = true;\n }\n }));\n eventWatchers_.emplace_back(instance_->watchEvent(\n EventType::InputContextReset, EventWatcherPhase::PostInputMethod,\n [this](Event &event) {\n auto &icEvent = static_cast<InputContextEvent &>(event);\n auto ic = icEvent.inputContext();\n auto state = ic->propertyFor(&factory_);\n state->lastIsEngOrDigit_ = 0;\n \/\/ Backup the state.\n state->notConvertedBackup_ = state->notConverted_;\n state->notConverted_ = 0;\n \/\/ Backup the state.\n state->lastPuncStackBackup_ = state->lastPuncStack_;\n state->lastPuncStack_.clear();\n if (ic->capabilityFlags().test(CapabilityFlag::SurroundingText)) {\n state->mayRebuildStateFromSurroundingText_ = true;\n }\n }));\n eventWatchers_.emplace_back(instance_->watchEvent(\n EventType::InputContextSurroundingTextUpdated,\n EventWatcherPhase::PostInputMethod, [this](Event &event) {\n auto &icEvent = static_cast<InputContextEvent &>(event);\n auto ic = icEvent.inputContext();\n auto state = ic->propertyFor(&factory_);\n \/\/ Enable to rebuild punctuation state from surrounding text.\n if (state->mayRebuildStateFromSurroundingText_) {\n state->mayRebuildStateFromSurroundingText_ = false;\n } else {\n state->notConvertedBackup_ = 0;\n state->lastPuncStackBackup_.clear();\n return;\n }\n if (!ic->capabilityFlags().test(CapabilityFlag::SurroundingText) ||\n !ic->surroundingText().isValid()) {\n return;\n }\n \/\/ We need text before the cursor.\n auto &text = ic->surroundingText().text();\n auto cursor = ic->surroundingText().cursor();\n auto length = utf8::lengthValidated(text);\n if (length == utf8::INVALID_LENGTH) {\n return;\n }\n if (cursor <= 0 && cursor > length) {\n return;\n }\n uint32_t lastCharBeforeCursor;\n auto start = utf8::nextNChar(text.begin(), cursor - 1);\n auto end =\n utf8::getNextChar(start, text.end(), &lastCharBeforeCursor);\n if (lastCharBeforeCursor == utf8::INVALID_CHAR ||\n lastCharBeforeCursor == utf8::NOT_ENOUGH_SPACE) {\n return;\n }\n \/\/ Need to make sure we have ascii.\n if (std::distance(start, end) == 1 &&\n (charutils::isupper(lastCharBeforeCursor) ||\n charutils::islower(lastCharBeforeCursor) ||\n charutils::isdigit(lastCharBeforeCursor))) {\n state->lastIsEngOrDigit_ = lastCharBeforeCursor;\n }\n \/\/ Restore the not converted state if we still after the same chr.\n if (lastCharBeforeCursor == state->notConvertedBackup_ &&\n state->notConverted_ == 0) {\n state->notConverted_ = state->notConvertedBackup_;\n }\n state->notConvertedBackup_ = 0;\n \/\/ Scan through the surrounding text\n if (!state->lastPuncStackBackup_.empty() &&\n state->lastPuncStack_.empty()) {\n auto range =\n utf8::MakeUTF8CharRange(MakeIterRange(text.begin(), end));\n for (auto iter = std::begin(range); iter != std::end(range);\n iter++) {\n auto charRange = iter.charRange();\n std::string_view chr(\n &*charRange.first,\n std::distance(charRange.first, charRange.second));\n auto puncIter = std::find_if(\n state->lastPuncStackBackup_.begin(),\n state->lastPuncStackBackup_.end(),\n [chr](auto &p) { return p.second == chr; });\n if (puncIter != state->lastPuncStackBackup_.end()) {\n state->lastPuncStack_.insert(*puncIter);\n }\n }\n }\n state->lastPuncStackBackup_.clear();\n }));\n}\n\nPunctuation::~Punctuation() {}\n\nvoid Punctuation::reloadConfig() {\n readAsIni(config_, \"conf\/punctuation.conf\");\n\n auto files = StandardPath::global().multiOpen(StandardPath::Type::PkgData,\n \"punctuation\", O_RDONLY,\n filter::Prefix(\"punc.mb.\"));\n auto iter = profiles_.begin();\n while (iter != profiles_.end()) {\n if (!files.count(\"punc.mb.\" + iter->first)) {\n iter = profiles_.erase(iter);\n } else {\n iter++;\n }\n }\n\n for (const auto &file : files) {\n if (file.first.size() <= 8) {\n continue;\n }\n auto lang = file.first.substr(8);\n\n try {\n boost::iostreams::stream_buffer<\n boost::iostreams::file_descriptor_source>\n buffer(file.second.fd(),\n boost::iostreams::file_descriptor_flags::\n never_close_handle);\n std::istream in(&buffer);\n PunctuationProfile newProfile(in);\n profiles_[lang] = std::move(newProfile);\n } catch (const std::exception &e) {\n FCITX_LOG(Warn)\n << \"Error when load profile \" << file.first << \": \" << e.what();\n }\n }\n}\n\nbool Punctuation::inWhiteList(fcitx::InputContext *inputContext) const {\n return toggleAction_.isParent(&inputContext->statusArea());\n}\n\nconst std::string &Punctuation::pushPunctuation(const std::string &language,\n InputContext *ic,\n uint32_t unicode) {\n if (!enabled()) {\n return emptyString;\n }\n auto state = ic->propertyFor(&factory_);\n if (state->lastIsEngOrDigit_ && dontConvertWhenEn(unicode)) {\n state->notConverted_ = unicode;\n return emptyString;\n } else {\n auto iter = profiles_.find(language);\n if (iter == profiles_.end()) {\n return emptyString;\n }\n auto &result = getPunctuation(language, unicode);\n state->notConverted_ = 0;\n if (result.second.empty()) {\n return result.first;\n } else {\n auto iter = state->lastPuncStack_.find(unicode);\n if (iter != state->lastPuncStack_.end()) {\n state->lastPuncStack_.erase(iter);\n return result.second;\n } else {\n state->lastPuncStack_.emplace(unicode, result.first);\n return result.first;\n }\n }\n }\n}\n\nconst std::string &Punctuation::cancelLast(const std::string &language,\n InputContext *ic) {\n if (!enabled()) {\n return emptyString;\n }\n auto state = ic->propertyFor(&factory_);\n if (dontConvertWhenEn(state->notConverted_)) {\n auto &result = getPunctuation(language, state->notConverted_);\n state->notConverted_ = 0;\n return result.first;\n }\n return emptyString;\n}\n\nconst std::pair<std::string, std::string> &\nPunctuation::getPunctuation(const std::string &language, uint32_t unicode) {\n if (!*config_.enabled) {\n return emptyStringPair;\n }\n\n auto iter = profiles_.find(language);\n if (iter == profiles_.end()) {\n return emptyStringPair;\n }\n\n return iter->second.getPunctuation(unicode);\n}\n\nFCITX_ADDON_FACTORY(PunctuationFactory);\n<commit_msg>Fix punc auto eng<commit_after>\/*\n * SPDX-FileCopyrightText: 2017-2017 CSSlayer <wengxt@gmail.com>\n *\n * SPDX-License-Identifier: LGPL-2.1-or-later\n *\n *\/\n#include \"punctuation.h\"\n#include \"notifications_public.h\"\n#include <boost\/iostreams\/device\/file_descriptor.hpp>\n#include <boost\/iostreams\/stream_buffer.hpp>\n#include <fcitx-config\/iniparser.h>\n#include <fcitx-utils\/charutils.h>\n#include <fcitx-utils\/log.h>\n#include <fcitx-utils\/standardpath.h>\n#include <fcitx-utils\/utf8.h>\n#include <fcitx\/inputcontext.h>\n#include <fcitx\/inputcontextmanager.h>\n#include <fcitx\/inputmethodentry.h>\n#include <fcitx\/inputmethodmanager.h>\n#include <fcitx\/statusarea.h>\n#include <fcitx\/userinterfacemanager.h>\n#include <fcntl.h>\n#include <string_view>\n#include <unordered_set>\n\nusing namespace fcitx;\n\nnamespace {\nstatic const std::string emptyString;\nstatic const std::pair<std::string, std::string> emptyStringPair;\n} \/\/ namespace\n\nbool dontConvertWhenEn(uint32_t c) { return c == '.' || c == ','; }\n\nclass PunctuationState : public InputContextProperty {\npublic:\n std::unordered_map<uint32_t, std::string> lastPuncStack_;\n char lastIsEngOrDigit_ = 0;\n uint32_t notConverted_ = 0;\n bool mayRebuildStateFromSurroundingText_ = false;\n\n std::unordered_map<uint32_t, std::string> lastPuncStackBackup_;\n uint32_t notConvertedBackup_ = 0;\n};\n\nPunctuationProfile::PunctuationProfile(std::istream &in) {\n std::string strBuf;\n while (std::getline(in, strBuf)) {\n auto pair = stringutils::trimInplace(strBuf);\n std::string::size_type start = pair.first, end = pair.second;\n if (start == end) {\n continue;\n }\n std::string text(strBuf.begin() + start, strBuf.begin() + end);\n auto tokens = stringutils::split(strBuf, FCITX_WHITESPACE);\n if (tokens.size() != 2 && tokens.size() != 3) {\n continue;\n }\n\n if (!std::any_of(\n tokens.begin(), tokens.end(),\n [](const std::string &s) { return utf8::validate(s); })) {\n continue;\n }\n \/\/ we don't make # as comment here, # would be consider as a valid char\n if (utf8::lengthValidated(tokens[0]) != 1) {\n continue;\n }\n auto c = utf8::getChar(tokens[0]);\n decltype(puncMap_)::mapped_type p;\n p.first = tokens[1];\n if (tokens.size() > 2) {\n p.second = tokens[2];\n }\n puncMap_.emplace(c, std::move(p));\n }\n}\n\nconst std::pair<std::string, std::string> &\nPunctuationProfile::getPunctuation(uint32_t unicode) const {\n auto iter = puncMap_.find(unicode);\n if (iter == puncMap_.end()) {\n return emptyStringPair;\n }\n return iter->second;\n}\n\nPunctuation::Punctuation(Instance *instance)\n : instance_(instance),\n factory_([](InputContext &) { return new PunctuationState; }) {\n reloadConfig();\n if (!instance_) {\n return;\n }\n instance_->inputContextManager().registerProperty(\"punctuationState\",\n &factory_);\n instance_->userInterfaceManager().registerAction(\"punctuation\",\n &toggleAction_);\n\n commitConn_ = instance_->connect<Instance::CommitFilter>(\n [this](InputContext *ic, const std::string &sentence) {\n auto state = ic->propertyFor(&factory_);\n \/\/ Though sentence is utf8, we only check ascii.\n if (sentence.size() && (charutils::isupper(sentence.back()) ||\n charutils::islower(sentence.back()) ||\n charutils::isdigit(sentence.back()))) {\n state->lastIsEngOrDigit_ = sentence.back();\n } else {\n state->lastIsEngOrDigit_ = '\\0';\n }\n });\n auto processKeyEvent = [this](const KeyEventBase &event) {\n auto &keyEvent = static_cast<const ForwardKeyEvent &>(event);\n auto state = keyEvent.inputContext()->propertyFor(&factory_);\n if (keyEvent.isRelease()) {\n return;\n }\n if (!event.accepted()) {\n if (keyEvent.key().isUAZ() || keyEvent.key().isLAZ() ||\n keyEvent.key().isDigit()) {\n state->lastIsEngOrDigit_ =\n Key::keySymToUnicode(keyEvent.key().sym());\n } else {\n state->lastIsEngOrDigit_ = '\\0';\n }\n }\n };\n keyEventConn_ =\n instance_->connect<Instance::KeyEventResult>(processKeyEvent);\n eventWatchers_.emplace_back(instance_->watchEvent(\n EventType::InputContextForwardKey, EventWatcherPhase::PostInputMethod,\n [processKeyEvent](Event &event) {\n auto &keyEvent = static_cast<ForwardKeyEvent &>(event);\n processKeyEvent(keyEvent);\n }));\n eventWatchers_.emplace_back(instance_->watchEvent(\n EventType::InputContextKeyEvent, EventWatcherPhase::PostInputMethod,\n [this](Event &event) {\n auto &keyEvent = static_cast<KeyEvent &>(event);\n if (keyEvent.isRelease()) {\n return;\n }\n if (inWhiteList(keyEvent.inputContext()) &&\n keyEvent.key().checkKeyList(config_.hotkey.value())) {\n setEnabled(!enabled(), keyEvent.inputContext());\n if (notifications()) {\n notifications()->call<INotifications::showTip>(\n \"fcitx-punc-toggle\", \"fcitx\",\n enabled() ? \"fcitx-punc-active\" : \"fcitx-punc-inactive\",\n _(\"Punctuation\"),\n enabled() ? _(\"Full width punctuation is enabled.\")\n : _(\"Full width punctuation is disabled.\"),\n -1);\n }\n return keyEvent.filterAndAccept();\n }\n }));\n eventWatchers_.emplace_back(instance_->watchEvent(\n EventType::InputContextFocusIn, EventWatcherPhase::PostInputMethod,\n [this](Event &event) {\n auto &icEvent = static_cast<InputContextEvent &>(event);\n auto ic = icEvent.inputContext();\n auto state = ic->propertyFor(&factory_);\n if (ic->capabilityFlags().test(CapabilityFlag::SurroundingText)) {\n state->mayRebuildStateFromSurroundingText_ = true;\n }\n }));\n eventWatchers_.emplace_back(instance_->watchEvent(\n EventType::InputContextReset, EventWatcherPhase::PostInputMethod,\n [this](Event &event) {\n auto &icEvent = static_cast<InputContextEvent &>(event);\n auto ic = icEvent.inputContext();\n auto state = ic->propertyFor(&factory_);\n state->lastIsEngOrDigit_ = 0;\n \/\/ Backup the state.\n state->notConvertedBackup_ = state->notConverted_;\n state->notConverted_ = 0;\n \/\/ Backup the state.\n state->lastPuncStackBackup_ = state->lastPuncStack_;\n state->lastPuncStack_.clear();\n if (ic->capabilityFlags().test(CapabilityFlag::SurroundingText)) {\n state->mayRebuildStateFromSurroundingText_ = true;\n }\n }));\n eventWatchers_.emplace_back(instance_->watchEvent(\n EventType::InputContextSurroundingTextUpdated,\n EventWatcherPhase::PostInputMethod, [this](Event &event) {\n auto &icEvent = static_cast<InputContextEvent &>(event);\n auto ic = icEvent.inputContext();\n auto state = ic->propertyFor(&factory_);\n \/\/ Enable to rebuild punctuation state from surrounding text.\n if (state->mayRebuildStateFromSurroundingText_) {\n state->mayRebuildStateFromSurroundingText_ = false;\n } else {\n state->notConvertedBackup_ = 0;\n state->lastPuncStackBackup_.clear();\n return;\n }\n if (!ic->capabilityFlags().test(CapabilityFlag::SurroundingText) ||\n !ic->surroundingText().isValid()) {\n return;\n }\n \/\/ We need text before the cursor.\n auto &text = ic->surroundingText().text();\n auto cursor = ic->surroundingText().cursor();\n auto length = utf8::lengthValidated(text);\n if (length == utf8::INVALID_LENGTH) {\n return;\n }\n if (cursor <= 0 && cursor > length) {\n return;\n }\n uint32_t lastCharBeforeCursor;\n auto start = utf8::nextNChar(text.begin(), cursor - 1);\n auto end =\n utf8::getNextChar(start, text.end(), &lastCharBeforeCursor);\n if (lastCharBeforeCursor == utf8::INVALID_CHAR ||\n lastCharBeforeCursor == utf8::NOT_ENOUGH_SPACE) {\n return;\n }\n \/\/ Need to make sure we have ascii.\n if (std::distance(start, end) == 1 &&\n (charutils::isupper(lastCharBeforeCursor) ||\n charutils::islower(lastCharBeforeCursor) ||\n charutils::isdigit(lastCharBeforeCursor))) {\n state->lastIsEngOrDigit_ = lastCharBeforeCursor;\n }\n \/\/ Restore the not converted state if we still after the same chr.\n if (lastCharBeforeCursor == state->notConvertedBackup_ &&\n state->notConverted_ == 0) {\n state->notConverted_ = state->notConvertedBackup_;\n }\n state->notConvertedBackup_ = 0;\n \/\/ Scan through the surrounding text\n if (!state->lastPuncStackBackup_.empty() &&\n state->lastPuncStack_.empty()) {\n auto range =\n utf8::MakeUTF8CharRange(MakeIterRange(text.begin(), end));\n for (auto iter = std::begin(range); iter != std::end(range);\n iter++) {\n auto charRange = iter.charRange();\n std::string_view chr(\n &*charRange.first,\n std::distance(charRange.first, charRange.second));\n auto puncIter = std::find_if(\n state->lastPuncStackBackup_.begin(),\n state->lastPuncStackBackup_.end(),\n [chr](auto &p) { return p.second == chr; });\n if (puncIter != state->lastPuncStackBackup_.end()) {\n state->lastPuncStack_.insert(*puncIter);\n }\n }\n }\n state->lastPuncStackBackup_.clear();\n }));\n}\n\nPunctuation::~Punctuation() {}\n\nvoid Punctuation::reloadConfig() {\n readAsIni(config_, \"conf\/punctuation.conf\");\n\n auto files = StandardPath::global().multiOpen(StandardPath::Type::PkgData,\n \"punctuation\", O_RDONLY,\n filter::Prefix(\"punc.mb.\"));\n auto iter = profiles_.begin();\n while (iter != profiles_.end()) {\n if (!files.count(\"punc.mb.\" + iter->first)) {\n iter = profiles_.erase(iter);\n } else {\n iter++;\n }\n }\n\n for (const auto &file : files) {\n if (file.first.size() <= 8) {\n continue;\n }\n auto lang = file.first.substr(8);\n\n try {\n boost::iostreams::stream_buffer<\n boost::iostreams::file_descriptor_source>\n buffer(file.second.fd(),\n boost::iostreams::file_descriptor_flags::\n never_close_handle);\n std::istream in(&buffer);\n PunctuationProfile newProfile(in);\n profiles_[lang] = std::move(newProfile);\n } catch (const std::exception &e) {\n FCITX_LOG(Warn)\n << \"Error when load profile \" << file.first << \": \" << e.what();\n }\n }\n}\n\nbool Punctuation::inWhiteList(fcitx::InputContext *inputContext) const {\n return toggleAction_.isParent(&inputContext->statusArea());\n}\n\nconst std::string &Punctuation::pushPunctuation(const std::string &language,\n InputContext *ic,\n uint32_t unicode) {\n if (!enabled()) {\n return emptyString;\n }\n auto state = ic->propertyFor(&factory_);\n if (state->lastIsEngOrDigit_ && dontConvertWhenEn(unicode)) {\n state->notConverted_ = unicode;\n return emptyString;\n } else {\n auto iter = profiles_.find(language);\n if (iter == profiles_.end()) {\n return emptyString;\n }\n auto &result = getPunctuation(language, unicode);\n state->notConverted_ = 0;\n if (result.second.empty()) {\n return result.first;\n } else {\n auto iter = state->lastPuncStack_.find(unicode);\n if (iter != state->lastPuncStack_.end()) {\n state->lastPuncStack_.erase(iter);\n return result.second;\n } else {\n state->lastPuncStack_.emplace(unicode, result.first);\n return result.first;\n }\n }\n }\n}\n\nconst std::string &Punctuation::cancelLast(const std::string &language,\n InputContext *ic) {\n if (!enabled()) {\n return emptyString;\n }\n auto state = ic->propertyFor(&factory_);\n if (dontConvertWhenEn(state->notConverted_)) {\n auto &result = getPunctuation(language, state->notConverted_);\n state->notConverted_ = 0;\n return result.first;\n }\n return emptyString;\n}\n\nconst std::pair<std::string, std::string> &\nPunctuation::getPunctuation(const std::string &language, uint32_t unicode) {\n if (!*config_.enabled) {\n return emptyStringPair;\n }\n\n auto iter = profiles_.find(language);\n if (iter == profiles_.end()) {\n return emptyStringPair;\n }\n\n return iter->second.getPunctuation(unicode);\n}\n\nFCITX_ADDON_FACTORY(PunctuationFactory);\n<|endoftext|>"} {"text":"<commit_before>\/*\n\nCopyright (c) 2003, Magnus Jonsson & 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\/file.hpp\"\n#include \"libtorrent\/utf8.hpp\"\n\n#include <sstream>\n#include <windows.h>\n\nnamespace\n{\n\t\/\/ must be used to not leak memory in case something would throw\n\tclass auto_localfree\n\t{\n\tpublic:\n\t\tauto_localfree(HLOCAL memory)\n\t\t\t: m_memory(memory)\n\t\t{\n\t\t}\n\t\t~auto_localfree()\n\t\t{\n\t\t\tif (m_memory)\n\t\t\t\tLocalFree(m_memory);\n\t\t}\n\tprivate:\n\t\tHLOCAL m_memory;\n\t};\n\n\n\tstd::wstring safe_convert(std::string const& s)\n\t{\n\t\ttry\n\t\t{\n\t\t\treturn libtorrent::utf8_wchar(s);\n\t\t}\n\t\tcatch (std::exception)\n\t\t{\n\t\t\tstd::wstring ret;\n\t\t\tfor (const char* i = &*s.begin(); i < &*s.end(); ++i)\n\t\t\t{\n\t\t\t\twchar_t c;\n\t\t\t\tc = '.';\n\t\t\t\tstd::mbtowc(&c, i, 1);\n\t\t\t\tret += c;\n\t\t\t}\n\t\t\treturn ret;\n\t\t}\n\t}\n\n\t\n\tstd::string utf8_native(std::string const& s)\n\t{\n\t\ttry\n\t\t{\n\t\t\tstd::wstring ws;\n\t\t\tlibtorrent::utf8_wchar(s, ws);\n\t\t\tstd::size_t size = wcstombs(0, ws.c_str(), 0);\n\t\t\tif (size == std::size_t(-1)) return s;\n\t\t\tstd::string ret;\n\t\t\tret.resize(size);\n\t\t\tsize = wcstombs(&ret[0], ws.c_str(), size + 1);\n\t\t\tret.resize(size-1);\n\t\t\treturn ret;\n\t\t}\n\t\tcatch(std::exception)\n\t\t{\n\t\t\treturn s;\n\t\t}\n\t}\n\t\n\tvoid throw_exception(const char* thrower)\n\t{\n\t\tDWORD err = GetLastError();\n\n#ifdef UNICODE\n\t\twchar_t *wbuffer = 0;\n\t\tFormatMessage(\n\t\t\tFORMAT_MESSAGE_FROM_SYSTEM\n\t\t\t|FORMAT_MESSAGE_ALLOCATE_BUFFER\n\t\t\t, 0, err, 0, (LPWSTR)&wbuffer, 0, 0);\n\t\tauto_localfree auto_free(wbuffer);\n\t\tstd::string tmp_utf8;\n\t\tlibtorrent::wchar_utf8(wbuffer, tmp_utf8);\n\t\tchar const* buffer = tmp_utf8.c_str();\n#else\n\t\tchar* buffer = 0;\n\t\tFormatMessage(\n\t\t\tFORMAT_MESSAGE_FROM_SYSTEM\n\t\t\t|FORMAT_MESSAGE_ALLOCATE_BUFFER\n\t\t\t, 0, err, 0, (LPSTR)&buffer, 0, 0);\n\t\tauto_localfree auto_free(buffer);\n#endif\n\n\t\tstd::stringstream s;\n\t\ts << (thrower ? thrower : \"NULL\") << \": \" << (buffer ? buffer : \"NULL\");\n\n\t\tthrow libtorrent::file_error(s.str());\n\t}\n}\n\nnamespace libtorrent\n{\n\n\tstruct file::impl : boost::noncopyable\n\t{\n\t\tenum open_flags\n\t\t{\n\t\t\tread_flag = 1,\n\t\t\twrite_flag = 2\n\t\t};\n\n\t\tenum seek_mode\n\t\t{\n\t\t\tseek_begin = FILE_BEGIN,\n\t\t\tseek_from_here = FILE_CURRENT,\n\t\t\tseek_end = FILE_END\n\t\t};\n\n\t\timpl()\n\t\t{\n\t\t\tm_file_handle = INVALID_HANDLE_VALUE;\n\t\t}\n\n\t\tvoid open(const char *file_name, open_flags flags)\n\t\t{\n\t\t\tassert(file_name);\n\t\t\tassert(flags & (read_flag | write_flag));\n\n\t\t\tDWORD access_mask = 0;\n\t\t\tif (flags & read_flag)\n\t\t\t\taccess_mask |= GENERIC_READ;\n\t\t\tif (flags & write_flag)\n\t\t\t\taccess_mask |= GENERIC_WRITE;\n\n\t\t\tassert(access_mask & (GENERIC_READ | GENERIC_WRITE));\n\n\t\t#ifdef UNICODE\n\t\t\tstd::wstring wfile_name(safe_convert(file_name));\n\t\t\tHANDLE new_handle = CreateFile(\n\t\t\t\t(LPCWSTR)wfile_name.c_str()\n\t\t\t\t, access_mask\n\t\t\t\t, FILE_SHARE_READ\n\t\t\t\t, 0\n\t\t\t\t, (flags & write_flag)?OPEN_ALWAYS:OPEN_EXISTING\n\t\t\t\t, FILE_ATTRIBUTE_NORMAL\n\t\t\t\t, 0);\n\t\t#else\n\t\t\tHANDLE new_handle = CreateFile(\n\t\t\t\tutf8_native(file_name).c_str()\n\t\t\t\t, access_mask\n\t\t\t\t, FILE_SHARE_READ\n\t\t\t\t, 0\n\t\t\t\t, (flags & write_flag)?OPEN_ALWAYS:OPEN_EXISTING\n\t\t\t\t, FILE_ATTRIBUTE_NORMAL\n\t\t\t\t, 0);\n\t\t#endif\n\n\t\t\tif (new_handle == INVALID_HANDLE_VALUE)\n\t\t\t{\n\t\t\t\tstd::stringstream s;\n\t\t\t\tthrow_exception(file_name);\n\t\t\t}\n\t\t\t\/\/ will only close old file if the open succeeded\n\t\t\tclose();\n\t\t\tm_file_handle = new_handle;\n\t\t}\n\n\t\tvoid close()\n\t\t{\n\t\t\tif (m_file_handle != INVALID_HANDLE_VALUE)\n\t\t\t{\n\t\t\t\tCloseHandle(m_file_handle);\n\t\t\t\tm_file_handle = INVALID_HANDLE_VALUE;\n\t\t\t}\n\t\t}\n\n\t\t~impl()\n\t\t{\n\t\t\tclose();\n\t\t}\n\n\t\tsize_type write(const char* buffer, size_type num_bytes)\n\t\t{\n\t\t\tassert(buffer);\n\t\t\tassert(num_bytes > 0);\n\t\t\tassert((DWORD)num_bytes == num_bytes);\n\t\t\tDWORD bytes_written = 0;\n\t\t\tif (num_bytes != 0)\n\t\t\t{\n\t\t\t\tif (FALSE == WriteFile(\n\t\t\t\t\tm_file_handle\n\t\t\t\t\t, buffer\n\t\t\t\t\t, (DWORD)num_bytes\n\t\t\t\t\t, &bytes_written\n\t\t\t\t\t, 0))\n\t\t\t\t{\n\t\t\t\t\tthrow_exception(\"file::write\");\n\t\t\t\t}\n\t\t\t}\n\t\t\treturn bytes_written;\n\t\t}\n\t\t\n\t\tsize_type read(char* buffer, size_type num_bytes)\n\t\t{\n\t\t\tassert(buffer);\n\t\t\tassert(num_bytes > 0);\n\t\t\tassert((DWORD)num_bytes == num_bytes);\n\n\t\t\tDWORD bytes_read = 0;\n\t\t\tif (num_bytes != 0)\n\t\t\t{\n\t\t\t\tif (FALSE == ReadFile(\n\t\t\t\t\tm_file_handle\n\t\t\t\t\t, buffer\n\t\t\t\t\t, (DWORD)num_bytes\n\t\t\t\t\t, &bytes_read\n\t\t\t\t\t, 0))\n\t\t\t\t{\n\t\t\t\t\tthrow_exception(\"file::read\");\n\t\t\t\t}\n\t\t\t}\n\t\t\treturn bytes_read;\n\t\t}\n\n\t\tvoid seek(size_type pos, seek_mode from_where)\n\t\t{\n\t\t\tassert(pos >= 0 || from_where != seek_begin);\n\t\t\tassert(pos <= 0 || from_where != seek_end);\n\t\t\tLARGE_INTEGER offs;\n\t\t\toffs.QuadPart = pos;\n\t\t\tif (FALSE == SetFilePointerEx(\n\t\t\t\tm_file_handle\n\t\t\t\t, offs\n\t\t\t\t, &offs\n\t\t\t\t, from_where))\n\t\t\t{\n\t\t\t\tthrow_exception(\"file::seek\");\n\t\t\t}\n\t\t}\n\t\t\n\t\tsize_type tell()\n\t\t{\n\t\t\tLARGE_INTEGER offs;\n\t\t\toffs.QuadPart = 0;\n\n\t\t\t\/\/ is there any other way to get offset?\n\t\t\tif (FALSE == SetFilePointerEx(\n\t\t\t\tm_file_handle\n\t\t\t\t, offs\n\t\t\t\t, &offs\n\t\t\t\t, FILE_CURRENT))\n\t\t\t{\n\t\t\t\tthrow_exception(\"file::tell\");\n\t\t\t}\n\n\t\t\tsize_type pos=offs.QuadPart;\n\t\t\tassert(pos>=0);\n\t\t\treturn pos;\n\t\t}\n\/*\n\t\tsize_type size()\n\t\t{\n\t\t\tLARGE_INTEGER s;\n\t\t\tif (FALSE == GetFileSizeEx(m_file_handle, &s))\n\t\t\t{\n\t\t\t\tthrow_exception(\"file::size\");\n\t\t\t}\n\t\t\t\n\t\t\tsize_type size = s.QuadPart;\n\t\t\tassert(size >= 0);\n\t\t\treturn size;\n\t\t}\n*\/\n\tprivate:\n\n\t\tHANDLE m_file_handle;\n\n\t};\n}\n\nnamespace libtorrent\n{\n\n\tconst file::seek_mode file::begin(file::impl::seek_begin);\n\tconst file::seek_mode file::end(file::impl::seek_end);\n\n\tconst file::open_mode file::in(file::impl::read_flag);\n\tconst file::open_mode file::out(file::impl::write_flag);\n\n\tfile::file()\n\t\t: m_impl(new libtorrent::file::impl())\n\t{\n\t}\n\tfile::file(boost::filesystem::path const& p, open_mode m)\n\t\t: m_impl(new libtorrent::file::impl())\n\t{\n\t\topen(p,m);\n\t}\n\n\tfile::~file()\n\t{\n\t}\n\n\tvoid file::open(boost::filesystem::path const& p, open_mode m)\n\t{\n\t\tassert(p.is_complete());\n\t\tm_impl->open(p.native_file_string().c_str(), impl::open_flags(m.m_mask));\n\t}\n\n\tvoid file::close()\n\t{\n\t\tm_impl->close();\n\t}\n\n\tsize_type file::write(const char* buffer, size_type num_bytes)\n\t{\n\t\treturn m_impl->write(buffer, num_bytes);\n\t}\n\n\tsize_type file::read(char* buffer, size_type num_bytes)\n\t{\n\t\treturn m_impl->read(buffer, num_bytes);\n\t}\n\n\tvoid file::seek(size_type pos, seek_mode m)\n\t{\n\t\tm_impl->seek(pos,impl::seek_mode(m.m_val));\n\t}\n\t\n\tsize_type file::tell()\n\t{\n\t\treturn m_impl->tell();\n\t}\n}\n<commit_msg>*** empty log message ***<commit_after>\/*\n\nCopyright (c) 2003, Magnus Jonsson & 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\/file.hpp\"\n#include \"libtorrent\/utf8.hpp\"\n\n#include <sstream>\n#include <windows.h>\n\nnamespace\n{\n\t\/\/ must be used to not leak memory in case something would throw\n\tclass auto_localfree\n\t{\n\tpublic:\n\t\tauto_localfree(HLOCAL memory)\n\t\t\t: m_memory(memory)\n\t\t{\n\t\t}\n\t\t~auto_localfree()\n\t\t{\n\t\t\tif (m_memory)\n\t\t\t\tLocalFree(m_memory);\n\t\t}\n\tprivate:\n\t\tHLOCAL m_memory;\n\t};\n\n\n\tstd::wstring safe_convert(std::string const& s)\n\t{\n\t\ttry\n\t\t{\n\t\t\treturn libtorrent::utf8_wchar(s);\n\t\t}\n\t\tcatch (std::exception)\n\t\t{\n\t\t\tstd::wstring ret;\n\t\t\tfor (const char* i = &*s.begin(); i < &*s.end(); ++i)\n\t\t\t{\n\t\t\t\twchar_t c;\n\t\t\t\tc = '.';\n\t\t\t\tstd::mbtowc(&c, i, 1);\n\t\t\t\tret += c;\n\t\t\t}\n\t\t\treturn ret;\n\t\t}\n\t}\n\n\t\n\tstd::string utf8_native(std::string const& s)\n\t{\n\t\ttry\n\t\t{\n\t\t\tstd::wstring ws;\n\t\t\tlibtorrent::utf8_wchar(s, ws);\n\t\t\tstd::size_t size = wcstombs(0, ws.c_str(), 0);\n\t\t\tif (size == std::size_t(-1)) return s;\n\t\t\tstd::string ret;\n\t\t\tret.resize(size);\n\t\t\tsize = wcstombs(&ret[0], ws.c_str(), size + 1);\n\t\t\tret.resize(size);\n\t\t\treturn ret;\n\t\t}\n\t\tcatch(std::exception)\n\t\t{\n\t\t\treturn s;\n\t\t}\n\t}\n\t\n\tvoid throw_exception(const char* thrower)\n\t{\n\t\tDWORD err = GetLastError();\n\n#ifdef UNICODE\n\t\twchar_t *wbuffer = 0;\n\t\tFormatMessage(\n\t\t\tFORMAT_MESSAGE_FROM_SYSTEM\n\t\t\t|FORMAT_MESSAGE_ALLOCATE_BUFFER\n\t\t\t, 0, err, 0, (LPWSTR)&wbuffer, 0, 0);\n\t\tauto_localfree auto_free(wbuffer);\n\t\tstd::string tmp_utf8;\n\t\tlibtorrent::wchar_utf8(wbuffer, tmp_utf8);\n\t\tchar const* buffer = tmp_utf8.c_str();\n#else\n\t\tchar* buffer = 0;\n\t\tFormatMessage(\n\t\t\tFORMAT_MESSAGE_FROM_SYSTEM\n\t\t\t|FORMAT_MESSAGE_ALLOCATE_BUFFER\n\t\t\t, 0, err, 0, (LPSTR)&buffer, 0, 0);\n\t\tauto_localfree auto_free(buffer);\n#endif\n\n\t\tstd::stringstream s;\n\t\ts << (thrower ? thrower : \"NULL\") << \": \" << (buffer ? buffer : \"NULL\");\n\n\t\tthrow libtorrent::file_error(s.str());\n\t}\n}\n\nnamespace libtorrent\n{\n\n\tstruct file::impl : boost::noncopyable\n\t{\n\t\tenum open_flags\n\t\t{\n\t\t\tread_flag = 1,\n\t\t\twrite_flag = 2\n\t\t};\n\n\t\tenum seek_mode\n\t\t{\n\t\t\tseek_begin = FILE_BEGIN,\n\t\t\tseek_from_here = FILE_CURRENT,\n\t\t\tseek_end = FILE_END\n\t\t};\n\n\t\timpl()\n\t\t{\n\t\t\tm_file_handle = INVALID_HANDLE_VALUE;\n\t\t}\n\n\t\tvoid open(const char *file_name, open_flags flags)\n\t\t{\n\t\t\tassert(file_name);\n\t\t\tassert(flags & (read_flag | write_flag));\n\n\t\t\tDWORD access_mask = 0;\n\t\t\tif (flags & read_flag)\n\t\t\t\taccess_mask |= GENERIC_READ;\n\t\t\tif (flags & write_flag)\n\t\t\t\taccess_mask |= GENERIC_WRITE;\n\n\t\t\tassert(access_mask & (GENERIC_READ | GENERIC_WRITE));\n\n\t\t#ifdef UNICODE\n\t\t\tstd::wstring wfile_name(safe_convert(file_name));\n\t\t\tHANDLE new_handle = CreateFile(\n\t\t\t\t(LPCWSTR)wfile_name.c_str()\n\t\t\t\t, access_mask\n\t\t\t\t, FILE_SHARE_READ\n\t\t\t\t, 0\n\t\t\t\t, (flags & write_flag)?OPEN_ALWAYS:OPEN_EXISTING\n\t\t\t\t, FILE_ATTRIBUTE_NORMAL\n\t\t\t\t, 0);\n\t\t#else\n\t\t\tHANDLE new_handle = CreateFile(\n\t\t\t\tutf8_native(file_name).c_str()\n\t\t\t\t, access_mask\n\t\t\t\t, FILE_SHARE_READ\n\t\t\t\t, 0\n\t\t\t\t, (flags & write_flag)?OPEN_ALWAYS:OPEN_EXISTING\n\t\t\t\t, FILE_ATTRIBUTE_NORMAL\n\t\t\t\t, 0);\n\t\t#endif\n\n\t\t\tif (new_handle == INVALID_HANDLE_VALUE)\n\t\t\t{\n\t\t\t\tstd::stringstream s;\n\t\t\t\tthrow_exception(file_name);\n\t\t\t}\n\t\t\t\/\/ will only close old file if the open succeeded\n\t\t\tclose();\n\t\t\tm_file_handle = new_handle;\n\t\t}\n\n\t\tvoid close()\n\t\t{\n\t\t\tif (m_file_handle != INVALID_HANDLE_VALUE)\n\t\t\t{\n\t\t\t\tCloseHandle(m_file_handle);\n\t\t\t\tm_file_handle = INVALID_HANDLE_VALUE;\n\t\t\t}\n\t\t}\n\n\t\t~impl()\n\t\t{\n\t\t\tclose();\n\t\t}\n\n\t\tsize_type write(const char* buffer, size_type num_bytes)\n\t\t{\n\t\t\tassert(buffer);\n\t\t\tassert(num_bytes > 0);\n\t\t\tassert((DWORD)num_bytes == num_bytes);\n\t\t\tDWORD bytes_written = 0;\n\t\t\tif (num_bytes != 0)\n\t\t\t{\n\t\t\t\tif (FALSE == WriteFile(\n\t\t\t\t\tm_file_handle\n\t\t\t\t\t, buffer\n\t\t\t\t\t, (DWORD)num_bytes\n\t\t\t\t\t, &bytes_written\n\t\t\t\t\t, 0))\n\t\t\t\t{\n\t\t\t\t\tthrow_exception(\"file::write\");\n\t\t\t\t}\n\t\t\t}\n\t\t\treturn bytes_written;\n\t\t}\n\t\t\n\t\tsize_type read(char* buffer, size_type num_bytes)\n\t\t{\n\t\t\tassert(buffer);\n\t\t\tassert(num_bytes > 0);\n\t\t\tassert((DWORD)num_bytes == num_bytes);\n\n\t\t\tDWORD bytes_read = 0;\n\t\t\tif (num_bytes != 0)\n\t\t\t{\n\t\t\t\tif (FALSE == ReadFile(\n\t\t\t\t\tm_file_handle\n\t\t\t\t\t, buffer\n\t\t\t\t\t, (DWORD)num_bytes\n\t\t\t\t\t, &bytes_read\n\t\t\t\t\t, 0))\n\t\t\t\t{\n\t\t\t\t\tthrow_exception(\"file::read\");\n\t\t\t\t}\n\t\t\t}\n\t\t\treturn bytes_read;\n\t\t}\n\n\t\tvoid seek(size_type pos, seek_mode from_where)\n\t\t{\n\t\t\tassert(pos >= 0 || from_where != seek_begin);\n\t\t\tassert(pos <= 0 || from_where != seek_end);\n\t\t\tLARGE_INTEGER offs;\n\t\t\toffs.QuadPart = pos;\n\t\t\tif (FALSE == SetFilePointerEx(\n\t\t\t\tm_file_handle\n\t\t\t\t, offs\n\t\t\t\t, &offs\n\t\t\t\t, from_where))\n\t\t\t{\n\t\t\t\tthrow_exception(\"file::seek\");\n\t\t\t}\n\t\t}\n\t\t\n\t\tsize_type tell()\n\t\t{\n\t\t\tLARGE_INTEGER offs;\n\t\t\toffs.QuadPart = 0;\n\n\t\t\t\/\/ is there any other way to get offset?\n\t\t\tif (FALSE == SetFilePointerEx(\n\t\t\t\tm_file_handle\n\t\t\t\t, offs\n\t\t\t\t, &offs\n\t\t\t\t, FILE_CURRENT))\n\t\t\t{\n\t\t\t\tthrow_exception(\"file::tell\");\n\t\t\t}\n\n\t\t\tsize_type pos=offs.QuadPart;\n\t\t\tassert(pos>=0);\n\t\t\treturn pos;\n\t\t}\n\/*\n\t\tsize_type size()\n\t\t{\n\t\t\tLARGE_INTEGER s;\n\t\t\tif (FALSE == GetFileSizeEx(m_file_handle, &s))\n\t\t\t{\n\t\t\t\tthrow_exception(\"file::size\");\n\t\t\t}\n\t\t\t\n\t\t\tsize_type size = s.QuadPart;\n\t\t\tassert(size >= 0);\n\t\t\treturn size;\n\t\t}\n*\/\n\tprivate:\n\n\t\tHANDLE m_file_handle;\n\n\t};\n}\n\nnamespace libtorrent\n{\n\n\tconst file::seek_mode file::begin(file::impl::seek_begin);\n\tconst file::seek_mode file::end(file::impl::seek_end);\n\n\tconst file::open_mode file::in(file::impl::read_flag);\n\tconst file::open_mode file::out(file::impl::write_flag);\n\n\tfile::file()\n\t\t: m_impl(new libtorrent::file::impl())\n\t{\n\t}\n\tfile::file(boost::filesystem::path const& p, open_mode m)\n\t\t: m_impl(new libtorrent::file::impl())\n\t{\n\t\topen(p,m);\n\t}\n\n\tfile::~file()\n\t{\n\t}\n\n\tvoid file::open(boost::filesystem::path const& p, open_mode m)\n\t{\n\t\tassert(p.is_complete());\n\t\tm_impl->open(p.native_file_string().c_str(), impl::open_flags(m.m_mask));\n\t}\n\n\tvoid file::close()\n\t{\n\t\tm_impl->close();\n\t}\n\n\tsize_type file::write(const char* buffer, size_type num_bytes)\n\t{\n\t\treturn m_impl->write(buffer, num_bytes);\n\t}\n\n\tsize_type file::read(char* buffer, size_type num_bytes)\n\t{\n\t\treturn m_impl->read(buffer, num_bytes);\n\t}\n\n\tvoid file::seek(size_type pos, seek_mode m)\n\t{\n\t\tm_impl->seek(pos,impl::seek_mode(m.m_val));\n\t}\n\t\n\tsize_type file::tell()\n\t{\n\t\treturn m_impl->tell();\n\t}\n}\n<|endoftext|>"} {"text":"<commit_before>#include \"textStyle.h\"\n\n#include \"text\/fontContext.h\"\n#include \"tile\/tile.h\"\n#include \"gl\/shaderProgram.h\"\n#include \"gl\/vboMesh.h\"\n#include \"view\/view.h\"\n#include \"labels\/textLabel.h\"\n#include \"glm\/gtc\/type_ptr.hpp\"\n#include \"tangram.h\"\n\nnamespace Tangram {\n\nconst static std::string key_name(\"name\");\nconst static std::string uppercase(\"uppercase\");\nconst static std::string lowercase(\"lowercase\");\nconst static std::string capitalize(\"capitalize\");\n\nTextStyle::TextStyle(std::string _name, bool _sdf, bool _sdfMultisampling, Blending _blendMode, GLenum _drawMode) :\n Style(_name, _blendMode, _drawMode), m_sdf(_sdf), m_sdfMultisampling(_sdfMultisampling) {\n}\n\nTextStyle::~TextStyle() {\n}\n\nvoid TextStyle::constructVertexLayout() {\n m_vertexLayout = std::shared_ptr<VertexLayout>(new VertexLayout({\n {\"a_position\", 2, GL_FLOAT, false, 0},\n {\"a_uv\", 2, GL_FLOAT, false, 0},\n {\"a_color\", 4, GL_UNSIGNED_BYTE, true, 0},\n {\"a_screenPosition\", 2, GL_FLOAT, false, 0},\n {\"a_alpha\", 1, GL_FLOAT, false, 0},\n {\"a_rotation\", 1, GL_FLOAT, false, 0},\n }));\n}\n\nvoid TextStyle::constructShaderProgram() {\n std::string frag = m_sdf ? \"sdf.fs\" : \"text.fs\";\n\n std::string vertShaderSrcStr = stringFromResource(\"point.vs\");\n std::string fragShaderSrcStr = stringFromResource(frag.c_str());\n\n m_shaderProgram->setSourceStrings(fragShaderSrcStr, vertShaderSrcStr);\n\n std::string defines;\n\n if (m_sdf && m_sdfMultisampling) {\n defines += \"#define TANGRAM_SDF_MULTISAMPLING\\n\";\n }\n\n m_shaderProgram->addSourceBlock(\"defines\", defines);\n}\n\nParameters TextStyle::parseRule(const DrawRule& _rule) const {\n Parameters p;\n\n std::string fontFamily, fontWeight, fontStyle, transform;\n glm::vec2 offset;\n\n _rule.get(StyleParamKey::font_family, fontFamily);\n _rule.get(StyleParamKey::font_weight, fontWeight);\n _rule.get(StyleParamKey::font_style, fontStyle);\n _rule.get(StyleParamKey::font_size, p.fontSize);\n _rule.get(StyleParamKey::font_fill, p.fill);\n _rule.get(StyleParamKey::offset, p.offset);\n if (_rule.get(StyleParamKey::font_stroke, p.strokeColor)) {\n _rule.get(StyleParamKey::font_stroke_color, p.strokeColor);\n }\n _rule.get(StyleParamKey::font_stroke_width, p.strokeWidth);\n _rule.get(StyleParamKey::transform, transform);\n _rule.get(StyleParamKey::visible, p.visible);\n _rule.get(StyleParamKey::priority, p.priority);\n _rule.get(StyleParamKey::text_source, p.textSource.second);\n p.textSource.first = _rule.isJSFunction(StyleParamKey::text_source);\n\n if (transform == capitalize) {\n p.transform = TextTransform::capitalize;\n } else if (transform == lowercase) {\n p.transform = TextTransform::lowercase;\n } else if (transform == uppercase) {\n p.transform = TextTransform::uppercase;\n }\n\n p.fontKey = fontFamily + \"_\" + fontWeight + \"_\" + fontStyle;\n\n \/* Global operations done for fontsize and sdfblur *\/\n float emSize = p.fontSize \/ 16.f;\n p.fontSize *= m_pixelScale;\n p.blurSpread = m_sdf ? emSize * 5.0f : 0.0f;\n\n return p;\n}\n\nLabel::Options TextStyle::optionsFromTextParams(const Parameters& _params) const {\n Label::Options options;\n options.color = _params.fill;\n options.priority = _params.priority;\n options.offset = _params.offset;\n return options;\n}\n\nconst std::string& TextStyle::applyTextSource(const Parameters& _parameters, const Properties& _props) const {\n if (!_parameters.textSource.second.empty()) {\n if (_parameters.textSource.first) {\n return _parameters.textSource.second;\n } else {\n return _props.getString(_parameters.textSource.second);\n }\n }\n return _props.getString(key_name);\n}\n\nvoid TextStyle::buildPoint(const Point& _point, const DrawRule& _rule, const Properties& _props, VboMesh& _mesh, Tile& _tile) const {\n auto& buffer = static_cast<TextBuffer&>(_mesh);\n\n Parameters params = parseRule(_rule);\n\n if (!params.visible) {\n return;\n }\n\n const std::string text = applyTextSource(params, _props);\n\n if (text.length() == 0) { return; }\n\n buffer.addLabel(text, { glm::vec2(_point), glm::vec2(_point) }, Label::Type::point, params, optionsFromTextParams(params));\n}\n\nvoid TextStyle::buildLine(const Line& _line, const DrawRule& _rule, const Properties& _props, VboMesh& _mesh, Tile& _tile) const {\n auto& buffer = static_cast<TextBuffer&>(_mesh);\n\n\tParameters params = parseRule(_rule);\n\n if (!params.visible) {\n return;\n }\n\n const std::string text = applyTextSource(params, _props);\n\n if (text.length() == 0) { return; }\n\n int lineLength = _line.size();\n int skipOffset = floor(lineLength \/ 2);\n float minLength = 0.15; \/\/ default, probably need some more thoughts\n\n\n for (size_t i = 0; i < _line.size() - 1; i += skipOffset) {\n glm::vec2 p1 = glm::vec2(_line[i]);\n glm::vec2 p2 = glm::vec2(_line[i + 1]);\n\n glm::vec2 p1p2 = p2 - p1;\n float length = glm::length(p1p2);\n\n if (length < minLength) {\n continue;\n }\n\n buffer.addLabel(text, { p1, p2 }, Label::Type::line, params, optionsFromTextParams(params));\n }\n\n}\n\nvoid TextStyle::buildPolygon(const Polygon& _polygon, const DrawRule& _rule, const Properties& _props, VboMesh& _mesh, Tile& _tile) const {\n auto& buffer = static_cast<TextBuffer&>(_mesh);\n\n\tParameters params = parseRule(_rule);\n\n if (!params.visible) {\n return;\n }\n\n const std::string text = applyTextSource(params, _props);\n\n if (text.length() == 0) { return; }\n\n glm::vec2 centroid;\n int n = 0;\n\n for (auto& l : _polygon) {\n for (auto& p : l) {\n centroid.x += p.x;\n centroid.y += p.y;\n n++;\n }\n }\n if (n == 0) { return; }\n\n centroid \/= n;\n\n buffer.addLabel(text, { centroid, centroid }, Label::Type::point, params, optionsFromTextParams(params));\n}\n\nvoid TextStyle::onBeginDrawFrame(const View& _view, const Scene& _scene) {\n bool contextLost = Style::glContextLost();\n\n FontContext::GetInstance()->bindAtlas(0);\n\n if (contextLost) {\n m_shaderProgram->setUniformi(\"u_tex\", 0);\n }\n\n if (m_dirtyViewport || contextLost) {\n m_shaderProgram->setUniformf(\"u_resolution\", _view.getWidth(), _view.getHeight());\n m_shaderProgram->setUniformMatrix4f(\"u_proj\", glm::value_ptr(_view.getOrthoViewportMatrix()));\n m_dirtyViewport = false;\n }\n \n Style::onBeginDrawFrame(_view, _scene);\n\n}\n\n}\n<commit_msg>Reduce string copies<commit_after>#include \"textStyle.h\"\n\n#include \"text\/fontContext.h\"\n#include \"tile\/tile.h\"\n#include \"gl\/shaderProgram.h\"\n#include \"gl\/vboMesh.h\"\n#include \"view\/view.h\"\n#include \"labels\/textLabel.h\"\n#include \"glm\/gtc\/type_ptr.hpp\"\n#include \"tangram.h\"\n\nnamespace Tangram {\n\nconst static std::string key_name(\"name\");\nconst static std::string uppercase(\"uppercase\");\nconst static std::string lowercase(\"lowercase\");\nconst static std::string capitalize(\"capitalize\");\n\nTextStyle::TextStyle(std::string _name, bool _sdf, bool _sdfMultisampling, Blending _blendMode, GLenum _drawMode) :\n Style(_name, _blendMode, _drawMode), m_sdf(_sdf), m_sdfMultisampling(_sdfMultisampling) {\n}\n\nTextStyle::~TextStyle() {\n}\n\nvoid TextStyle::constructVertexLayout() {\n m_vertexLayout = std::shared_ptr<VertexLayout>(new VertexLayout({\n {\"a_position\", 2, GL_FLOAT, false, 0},\n {\"a_uv\", 2, GL_FLOAT, false, 0},\n {\"a_color\", 4, GL_UNSIGNED_BYTE, true, 0},\n {\"a_screenPosition\", 2, GL_FLOAT, false, 0},\n {\"a_alpha\", 1, GL_FLOAT, false, 0},\n {\"a_rotation\", 1, GL_FLOAT, false, 0},\n }));\n}\n\nvoid TextStyle::constructShaderProgram() {\n std::string frag = m_sdf ? \"sdf.fs\" : \"text.fs\";\n\n std::string vertShaderSrcStr = stringFromResource(\"point.vs\");\n std::string fragShaderSrcStr = stringFromResource(frag.c_str());\n\n m_shaderProgram->setSourceStrings(fragShaderSrcStr, vertShaderSrcStr);\n\n std::string defines;\n\n if (m_sdf && m_sdfMultisampling) {\n defines += \"#define TANGRAM_SDF_MULTISAMPLING\\n\";\n }\n\n m_shaderProgram->addSourceBlock(\"defines\", defines);\n}\n\nParameters TextStyle::parseRule(const DrawRule& _rule) const {\n Parameters p;\n\n std::string fontFamily, fontWeight, fontStyle, transform;\n glm::vec2 offset;\n\n _rule.get(StyleParamKey::font_family, fontFamily);\n _rule.get(StyleParamKey::font_weight, fontWeight);\n _rule.get(StyleParamKey::font_style, fontStyle);\n _rule.get(StyleParamKey::font_size, p.fontSize);\n _rule.get(StyleParamKey::font_fill, p.fill);\n _rule.get(StyleParamKey::offset, p.offset);\n if (_rule.get(StyleParamKey::font_stroke, p.strokeColor)) {\n _rule.get(StyleParamKey::font_stroke_color, p.strokeColor);\n }\n _rule.get(StyleParamKey::font_stroke_width, p.strokeWidth);\n _rule.get(StyleParamKey::transform, transform);\n _rule.get(StyleParamKey::visible, p.visible);\n _rule.get(StyleParamKey::priority, p.priority);\n _rule.get(StyleParamKey::text_source, p.textSource.second);\n p.textSource.first = _rule.isJSFunction(StyleParamKey::text_source);\n\n if (transform == capitalize) {\n p.transform = TextTransform::capitalize;\n } else if (transform == lowercase) {\n p.transform = TextTransform::lowercase;\n } else if (transform == uppercase) {\n p.transform = TextTransform::uppercase;\n }\n\n p.fontKey = fontFamily + \"_\" + fontWeight + \"_\" + fontStyle;\n\n \/* Global operations done for fontsize and sdfblur *\/\n float emSize = p.fontSize \/ 16.f;\n p.fontSize *= m_pixelScale;\n p.blurSpread = m_sdf ? emSize * 5.0f : 0.0f;\n\n return p;\n}\n\nLabel::Options TextStyle::optionsFromTextParams(const Parameters& _params) const {\n Label::Options options;\n options.color = _params.fill;\n options.priority = _params.priority;\n options.offset = _params.offset;\n return options;\n}\n\nconst std::string& TextStyle::applyTextSource(const Parameters& _parameters, const Properties& _props) const {\n if (!_parameters.textSource.second.empty()) {\n if (_parameters.textSource.first) {\n return _parameters.textSource.second;\n } else {\n return _props.getString(_parameters.textSource.second);\n }\n }\n return _props.getString(key_name);\n}\n\nvoid TextStyle::buildPoint(const Point& _point, const DrawRule& _rule, const Properties& _props, VboMesh& _mesh, Tile& _tile) const {\n auto& buffer = static_cast<TextBuffer&>(_mesh);\n\n Parameters params = parseRule(_rule);\n\n if (!params.visible) {\n return;\n }\n\n const std::string& text = applyTextSource(params, _props);\n\n if (text.length() == 0) { return; }\n\n buffer.addLabel(text, { glm::vec2(_point), glm::vec2(_point) }, Label::Type::point, params, optionsFromTextParams(params));\n}\n\nvoid TextStyle::buildLine(const Line& _line, const DrawRule& _rule, const Properties& _props, VboMesh& _mesh, Tile& _tile) const {\n auto& buffer = static_cast<TextBuffer&>(_mesh);\n\n\tParameters params = parseRule(_rule);\n\n if (!params.visible) {\n return;\n }\n\n const std::string& text = applyTextSource(params, _props);\n\n if (text.length() == 0) { return; }\n\n int lineLength = _line.size();\n int skipOffset = floor(lineLength \/ 2);\n float minLength = 0.15; \/\/ default, probably need some more thoughts\n\n\n for (size_t i = 0; i < _line.size() - 1; i += skipOffset) {\n glm::vec2 p1 = glm::vec2(_line[i]);\n glm::vec2 p2 = glm::vec2(_line[i + 1]);\n\n glm::vec2 p1p2 = p2 - p1;\n float length = glm::length(p1p2);\n\n if (length < minLength) {\n continue;\n }\n\n buffer.addLabel(text, { p1, p2 }, Label::Type::line, params, optionsFromTextParams(params));\n }\n\n}\n\nvoid TextStyle::buildPolygon(const Polygon& _polygon, const DrawRule& _rule, const Properties& _props, VboMesh& _mesh, Tile& _tile) const {\n auto& buffer = static_cast<TextBuffer&>(_mesh);\n\n\tParameters params = parseRule(_rule);\n\n if (!params.visible) {\n return;\n }\n\n const std::string& text = applyTextSource(params, _props);\n\n if (text.length() == 0) { return; }\n\n glm::vec2 centroid;\n int n = 0;\n\n for (auto& l : _polygon) {\n for (auto& p : l) {\n centroid.x += p.x;\n centroid.y += p.y;\n n++;\n }\n }\n if (n == 0) { return; }\n\n centroid \/= n;\n\n buffer.addLabel(text, { centroid, centroid }, Label::Type::point, params, optionsFromTextParams(params));\n}\n\nvoid TextStyle::onBeginDrawFrame(const View& _view, const Scene& _scene) {\n bool contextLost = Style::glContextLost();\n\n FontContext::GetInstance()->bindAtlas(0);\n\n if (contextLost) {\n m_shaderProgram->setUniformi(\"u_tex\", 0);\n }\n\n if (m_dirtyViewport || contextLost) {\n m_shaderProgram->setUniformf(\"u_resolution\", _view.getWidth(), _view.getHeight());\n m_shaderProgram->setUniformMatrix4f(\"u_proj\", glm::value_ptr(_view.getOrthoViewportMatrix()));\n m_dirtyViewport = false;\n }\n \n Style::onBeginDrawFrame(_view, _scene);\n\n}\n\n}\n<|endoftext|>"} {"text":"<commit_before>\/\/ Copyright (c) 2013-2015 Pierre MOULON.\n\n\/\/ This Source Code Form is subject to the terms of the Mozilla Public\n\/\/ License, v. 2.0. If a copy of the MPL was not distributed with this\n\/\/ file, You can obtain one at http:\/\/mozilla.org\/MPL\/2.0\/.\n\n#ifndef EXIF_IO_EASYEXIF_HPP\n#define EXIF_IO_EASYEXIF_HPP\n\n#include \"openMVG\/exif\/exif_IO.hpp\"\n#include \"third_party\/easyexif\/exif.h\"\n\n#include <fstream>\n#include <sstream>\n#include <vector>\n\nnamespace openMVG {\nnamespace exif {\n\nclass Exif_IO_EasyExif : public Exif_IO\n{\n public:\n Exif_IO_EasyExif(): bHaveExifInfo_(false)\n {\n }\n\n Exif_IO_EasyExif( const std::string & sFileName ): bHaveExifInfo_(false)\n {\n open(sFileName);\n }\n\n bool open( const std::string & sFileName )\n {\n \/\/ Read the file into a buffer\n FILE *fp = fopen(sFileName.c_str(), \"rb\");\n if (!fp) {\n return false;\n }\n fseek(fp, 0, SEEK_END);\n unsigned long fsize = ftell(fp);\n rewind(fp);\n std::vector<unsigned char> buf(fsize);\n if (fread(&buf[0], 1, fsize, fp) != fsize) {\n return false;\n }\n fclose(fp);\n\n \/\/ Parse EXIF\n int code = exifInfo_.parseFrom(&buf[0], fsize);\n if (code)\n bHaveExifInfo_ = false;\n else\n bHaveExifInfo_ = true;\n\n return bHaveExifInfo_;\n }\n\n size_t getWidth() const\n {\n return exifInfo_.ImageWidth;\n }\n\n size_t getHeight() const\n {\n return exifInfo_.ImageHeight;\n }\n\n float getFocal() const\n {\n return static_cast<float>(exifInfo_.FocalLength);\n }\n\n std::string getBrand() const\n {\n std::string sbrand = exifInfo_.Make;\n if (!sbrand.empty())\n {\n \/\/ remove leading and trailing spaces\n sbrand.erase(0, sbrand.find_first_not_of(' '));\n sbrand.erase(sbrand.find_last_not_of(' '));\n }\n return sbrand;\n }\n\n std::string getModel() const\n {\n std::string smodel = exifInfo_.Model;\n if (!smodel.empty())\n {\n \/\/ remove leading and trailing spaces\n smodel.erase(0, smodel.find_first_not_of(' '));\n smodel.erase(smodel.find_last_not_of(' '));\n }\n return smodel;\n }\n\n std::string getImageUniqueID() const\n {\n return exifInfo_.ImageUniqueID;\n }\n\n std::string getSerialNumber() const\n {\n return exifInfo_.SerialNumber;\n }\n\n std::string getLensModel() const\n {\n return exifInfo_.LensModel;\n }\n\n std::string getLensSerialNumber() const\n {\n return exifInfo_.LensSerialNumber;\n }\n\n \/\/ File change date and time\n std::string getDateTime() const\n {\n return exifInfo_.DateTime;\n }\n\n \/\/ Original file date and time (may not exist)\n std::string getDateTimeOriginal() const\n {\n return exifInfo_.SubSecTimeOriginal;\n }\n\n \/\/ Digitization date and time (may not exist)\n std::string getDateTimeDigitized() const\n {\n return exifInfo_.SubSecTimeOriginal;\n }\n\n \/\/ Sub-second time that original picture was taken\n std::string getSubSecTimeOriginal() const\n {\n return exifInfo_.SubSecTimeOriginal;\n }\n\n \/**Verify if the file has metadata*\/\n bool doesHaveExifInfo() const\n {\n return bHaveExifInfo_;\n }\n\n \/** Print all data*\/\n std::string allExifData() const\n {\n std::ostringstream os;\n os\n << \"Camera make : \" << exifInfo_.Make << \"\\n\"\n << \"Camera model : \" << exifInfo_.Model << \"\\n\"\n << \"Lens Model : \" << exifInfo_.LensModel << \"\\n\"\n << \"Software : \" << exifInfo_.Software << \"\\n\"\n << \"Bits per sample : \" << exifInfo_.BitsPerSample << \"\\n\"\n << \"Image width : \" << exifInfo_.ImageWidth << \"\\n\"\n << \"Image height : \" << exifInfo_.ImageHeight << \"\\n\"\n << \"Image description : \" << exifInfo_.ImageDescription << \"\\n\"\n << \"Image orientation : \" << exifInfo_.Orientation << \"\\n\"\n << \"Image copyright : \" << exifInfo_.Copyright << \"\\n\"\n << \"Image date\/time : \" << exifInfo_.DateTime << \"\\n\"\n << \"Original date\/time : \" << exifInfo_.DateTimeOriginal << \"\\n\"\n << \"Digitize date\/time : \" << exifInfo_.DateTimeDigitized << \"\\n\"\n << \"Subsecond time : \" << exifInfo_.SubSecTimeOriginal << \"\\n\"\n << \"Exposure time : 1\/\" << (unsigned) (1.0\/exifInfo_.ExposureTime) << \"\\n\"\n << \"F-stop : \" << exifInfo_.FNumber << \"\\n\"\n << \"ISO speed : \" << exifInfo_.ISOSpeedRatings << \"\\n\"\n << \"Subject distance : \" << exifInfo_.SubjectDistance << \"\\n\"\n << \"Exposure bias : EV\" << exifInfo_.ExposureBiasValue << \"\\n\"\n << \"Flash used? : \" << exifInfo_.Flash << \"\\n\"\n << \"Metering mode : \" << exifInfo_.MeteringMode << \"\\n\"\n << \"Lens focal length : mm\\n\" << exifInfo_.FocalLength << \"\\n\"\n << \"35mm focal length : mm\\n\" << exifInfo_.FocalLengthIn35mm << \"\\n\"\n << \"GPS Latitude : deg ( deg, min, sec )\\n\" << \"(\"\n << exifInfo_.GeoLocation.Latitude << \", \"\n << exifInfo_.GeoLocation.LatComponents.degrees << \", \"\n << exifInfo_.GeoLocation.LatComponents.minutes << \", \"\n << exifInfo_.GeoLocation.LatComponents.seconds << \", \"\n << exifInfo_.GeoLocation.LatComponents.direction << \")\" << \"\\n\"\n << \"GPS Longitude : deg ( deg, min, sec )\\n\" << \"(\"\n << exifInfo_.GeoLocation.Longitude << \", \"\n << exifInfo_.GeoLocation.LonComponents.degrees << \", \"\n << exifInfo_.GeoLocation.LonComponents.minutes << \", \"\n << exifInfo_.GeoLocation.LonComponents.seconds << \", \"\n << exifInfo_.GeoLocation.LonComponents.direction << \")\" << \"\\n\"\n << \"GPS Altitude : m\" << exifInfo_.GeoLocation.Altitude << \"\\n\"\n << \"Image Unique ID : \" << exifInfo_.ImageUniqueID << \"\\n\"\n << \"Serial Number : \" << exifInfo_.SerialNumber << \"\\n\"\n << \"Lens Serial Number : \" << exifInfo_.LensSerialNumber << \"\\n\";\n return os.str();\n }\n\n private:\n EXIFInfo exifInfo_;\n bool bHaveExifInfo_;\n};\n\n} \/\/ namespace exif\n} \/\/ namespace openMVG\n\n#endif \/\/EXIF_IO_EASYEXIF_HPP\n<commit_msg>Exif: trim spaces<commit_after>\/\/ Copyright (c) 2013-2015 Pierre MOULON.\n\n\/\/ This Source Code Form is subject to the terms of the Mozilla Public\n\/\/ License, v. 2.0. If a copy of the MPL was not distributed with this\n\/\/ file, You can obtain one at http:\/\/mozilla.org\/MPL\/2.0\/.\n\n#ifndef EXIF_IO_EASYEXIF_HPP\n#define EXIF_IO_EASYEXIF_HPP\n\n#include \"openMVG\/exif\/exif_IO.hpp\"\n#include \"third_party\/easyexif\/exif.h\"\n\n#include <fstream>\n#include <sstream>\n#include <vector>\n\nnamespace openMVG {\nnamespace exif {\n\n\/\/\/ Remove all leading and trailing spaces from the input. The result is a trimmed copy of the input\ninline std::string trim_copy(const std::string& s)\n{\n if(s.empty())\n return s;\n \n std::string res(s);\n \/\/ remove leading and trailing spaces\n res.erase(0, res.find_first_not_of(' '));\n res.erase(res.find_last_not_of(' '));\n return res;\n}\n\nclass Exif_IO_EasyExif : public Exif_IO\n{\n public:\n Exif_IO_EasyExif(): bHaveExifInfo_(false)\n {\n }\n\n Exif_IO_EasyExif( const std::string & sFileName ): bHaveExifInfo_(false)\n {\n open(sFileName);\n }\n\n bool open( const std::string & sFileName )\n {\n \/\/ Read the file into a buffer\n FILE *fp = fopen(sFileName.c_str(), \"rb\");\n if (!fp) {\n return false;\n }\n fseek(fp, 0, SEEK_END);\n unsigned long fsize = ftell(fp);\n rewind(fp);\n std::vector<unsigned char> buf(fsize);\n if (fread(&buf[0], 1, fsize, fp) != fsize) {\n return false;\n }\n fclose(fp);\n\n \/\/ Parse EXIF\n int code = exifInfo_.parseFrom(&buf[0], fsize);\n if (code)\n bHaveExifInfo_ = false;\n else\n bHaveExifInfo_ = true;\n\n return bHaveExifInfo_;\n }\n\n size_t getWidth() const\n {\n return exifInfo_.ImageWidth;\n }\n\n size_t getHeight() const\n {\n return exifInfo_.ImageHeight;\n }\n\n float getFocal() const\n {\n return static_cast<float>(exifInfo_.FocalLength);\n }\n\n std::string getBrand() const\n {\n return trim_copy(exifInfo_.Make);\n }\n\n std::string getModel() const\n {\n return trim_copy(exifInfo_.Model);\n }\n\n std::string getImageUniqueID() const\n {\n return trim_copy(exifInfo_.ImageUniqueID);\n }\n\n std::string getSerialNumber() const\n {\n return trim_copy(exifInfo_.SerialNumber);\n }\n\n std::string getLensModel() const\n {\n return trim_copy(exifInfo_.LensModel);\n }\n\n std::string getLensSerialNumber() const\n {\n return trim_copy(exifInfo_.LensSerialNumber);\n }\n\n \/\/ File change date and time\n std::string getDateTime() const\n {\n return trim_copy(exifInfo_.DateTime);\n }\n\n \/\/ Original file date and time (may not exist)\n std::string getDateTimeOriginal() const\n {\n return trim_copy(exifInfo_.DateTimeOriginal);\n }\n\n \/\/ Digitization date and time (may not exist)\n std::string getDateTimeDigitized() const\n {\n return trim_copy(exifInfo_.DateTimeDigitized);\n }\n\n \/\/ Sub-second time that original picture was taken\n std::string getSubSecTimeOriginal() const\n {\n return trim_copy(exifInfo_.SubSecTimeOriginal);\n }\n\n \/**Verify if the file has metadata*\/\n bool doesHaveExifInfo() const\n {\n return bHaveExifInfo_;\n }\n\n \/** Print all data*\/\n std::string allExifData() const\n {\n std::ostringstream os;\n os\n << \"Camera make : \" << exifInfo_.Make << \"\\n\"\n << \"Camera model : \" << exifInfo_.Model << \"\\n\"\n << \"Lens Model : \" << exifInfo_.LensModel << \"\\n\"\n << \"Software : \" << exifInfo_.Software << \"\\n\"\n << \"Bits per sample : \" << exifInfo_.BitsPerSample << \"\\n\"\n << \"Image width : \" << exifInfo_.ImageWidth << \"\\n\"\n << \"Image height : \" << exifInfo_.ImageHeight << \"\\n\"\n << \"Image description : \" << exifInfo_.ImageDescription << \"\\n\"\n << \"Image orientation : \" << exifInfo_.Orientation << \"\\n\"\n << \"Image copyright : \" << exifInfo_.Copyright << \"\\n\"\n << \"Image date\/time : \" << exifInfo_.DateTime << \"\\n\"\n << \"Original date\/time : \" << exifInfo_.DateTimeOriginal << \"\\n\"\n << \"Digitize date\/time : \" << exifInfo_.DateTimeDigitized << \"\\n\"\n << \"Subsecond time : \" << exifInfo_.SubSecTimeOriginal << \"\\n\"\n << \"Exposure time : 1\/\" << (unsigned) (1.0\/exifInfo_.ExposureTime) << \"\\n\"\n << \"F-stop : \" << exifInfo_.FNumber << \"\\n\"\n << \"ISO speed : \" << exifInfo_.ISOSpeedRatings << \"\\n\"\n << \"Subject distance : \" << exifInfo_.SubjectDistance << \"\\n\"\n << \"Exposure bias : EV\" << exifInfo_.ExposureBiasValue << \"\\n\"\n << \"Flash used? : \" << exifInfo_.Flash << \"\\n\"\n << \"Metering mode : \" << exifInfo_.MeteringMode << \"\\n\"\n << \"Lens focal length : mm\\n\" << exifInfo_.FocalLength << \"\\n\"\n << \"35mm focal length : mm\\n\" << exifInfo_.FocalLengthIn35mm << \"\\n\"\n << \"GPS Latitude : deg ( deg, min, sec )\\n\" << \"(\"\n << exifInfo_.GeoLocation.Latitude << \", \"\n << exifInfo_.GeoLocation.LatComponents.degrees << \", \"\n << exifInfo_.GeoLocation.LatComponents.minutes << \", \"\n << exifInfo_.GeoLocation.LatComponents.seconds << \", \"\n << exifInfo_.GeoLocation.LatComponents.direction << \")\" << \"\\n\"\n << \"GPS Longitude : deg ( deg, min, sec )\\n\" << \"(\"\n << exifInfo_.GeoLocation.Longitude << \", \"\n << exifInfo_.GeoLocation.LonComponents.degrees << \", \"\n << exifInfo_.GeoLocation.LonComponents.minutes << \", \"\n << exifInfo_.GeoLocation.LonComponents.seconds << \", \"\n << exifInfo_.GeoLocation.LonComponents.direction << \")\" << \"\\n\"\n << \"GPS Altitude : m\" << exifInfo_.GeoLocation.Altitude << \"\\n\"\n << \"Image Unique ID : \" << exifInfo_.ImageUniqueID << \"\\n\"\n << \"Serial Number : \" << exifInfo_.SerialNumber << \"\\n\"\n << \"Lens Serial Number : \" << exifInfo_.LensSerialNumber << \"\\n\";\n return os.str();\n }\n\n private:\n EXIFInfo exifInfo_;\n bool bHaveExifInfo_;\n};\n\n} \/\/ namespace exif\n} \/\/ namespace openMVG\n\n#endif \/\/EXIF_IO_EASYEXIF_HPP\n<|endoftext|>"} {"text":"<commit_before>\/**\n * @file Cosa\/UML\/Clock.hh\n * @version 1.0\n *\n * @section License\n * Copyright (C) 2015, Mikael Patel\n *\n * This library is free software; you can redistribute it and\/or\n * modify it under the terms of the GNU Lesser General Public\n * License as published by the Free Software Foundation; either\n * version 2.1 of the License, or (at your option) any later version.\n * \n * This library is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU\n * Lesser General Public License for more details.\n * \n * This file is part of the Arduino Che Cosa project.\n *\/\n\n#ifndef COSA_UML_CLOCK_HH\n#define COSA_UML_CLOCK_HH\n\n#include \"Cosa\/UML\/TimedCapsule.hh\"\n#include \"Cosa\/UML\/Connector.hh\"\n#include \"Cosa\/UML\/Controller.hh\"\n#include \"Cosa\/Periodic.hh\"\n#include \"Cosa\/Time.hh\"\n\nnamespace UML {\n\n\/**\n * Clock Capsule class. The clock signal is defined as a Connector\n * type; Tick. The behavior of this class is simple incrementing the\n * tick value and thereby scheduling the capsules that are listening\n * to the tick.\n *\n * @section Diagram\n * \n * +--------+\n * | Clock |---[Tick]--->\n * +--------+\n * [ms]\n *\/\nclass Clock : public TimedCapsule {\npublic:\n \/**\n * Type of clock tick connector.\n *\/\n typedef Connector<clock_t> Tick;\n\n \/**\n * Construct Clock with given tick connector and period in\n * milli-seconds. \n * @param[in] tick connector.\n * @param[in] ms period.\n *\/\n Clock(Tick& tick, uint16_t ms) : \n TimedCapsule(ms), \n m_tick(tick) \n {}\n\n \/**\n * @override Capsule\n * Increment clock tick and schedule all capsules that listen for\n * clock update.\n *\/\n virtual void behavior() \n {\n m_tick = m_tick + 1;\n }\n\nprotected:\n Tick& m_tick;\n};\n\n};\n#endif\n<commit_msg>Cleanup include section.<commit_after>\/**\n * @file Cosa\/UML\/Clock.hh\n * @version 1.0\n *\n * @section License\n * Copyright (C) 2015, Mikael Patel\n *\n * This library is free software; you can redistribute it and\/or\n * modify it under the terms of the GNU Lesser General Public\n * License as published by the Free Software Foundation; either\n * version 2.1 of the License, or (at your option) any later version.\n * \n * This library is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU\n * Lesser General Public License for more details.\n * \n * This file is part of the Arduino Che Cosa project.\n *\/\n\n#ifndef COSA_UML_CLOCK_HH\n#define COSA_UML_CLOCK_HH\n\n#include \"Cosa\/UML\/TimedCapsule.hh\"\n#include \"Cosa\/UML\/Connector.hh\"\n#include \"Cosa\/Time.hh\"\n\nnamespace UML {\n\n\/**\n * Clock Capsule class. The clock signal is defined as a Connector\n * type; Tick. The behavior of this class is simple incrementing the\n * tick value and thereby scheduling the capsules that are listening\n * to the tick.\n *\n * @section Diagram\n * \n * +--------+\n * | Clock |---[Tick]--->\n * +--------+\n * [ms]\n *\/\nclass Clock : public TimedCapsule {\npublic:\n \/**\n * Type of clock tick connector.\n *\/\n typedef Connector<clock_t> Tick;\n\n \/**\n * Construct Clock with given tick connector and period in\n * milli-seconds. \n * @param[in] tick connector.\n * @param[in] ms period.\n *\/\n Clock(Tick& tick, uint16_t ms) : \n TimedCapsule(ms), \n m_tick(tick) \n {}\n\n \/**\n * @override Capsule\n * Increment clock tick and schedule all capsules that listen for\n * clock update.\n *\/\n virtual void behavior() \n {\n m_tick = m_tick + 1;\n }\n\nprotected:\n Tick& m_tick;\n};\n\n};\n#endif\n<|endoftext|>"} {"text":"<commit_before>#include \"mantella_bits\/optimisationAlgorithm\/hookeJeevesAlgorithm.hpp\"\n\n\/\/ Mantella\n#include \"mantella_bits\/assert.hpp\"\n#include \"mantella_bits\/optimisationProblem.hpp\"\n\nnamespace mant {\n HookeJeevesAlgorithm::HookeJeevesAlgorithm()\n : OptimisationAlgorithm(),\n stepSize_(0) {\n setNextParametersFunction(\n [this](\n const arma::uword numberOfDimensions_,\n const arma::Mat<double>& parameters_,\n const arma::Row<double>& objectiveValues_,\n const arma::Row<double>& differences_) {\n if (arma::all(differences_ >= 0)) {\n stepSize_ \/= stepSizeDecrease_;\n }\n\n arma::Mat<double> nextParameters(numberOfDimensions_, 2 * numberOfDimensions_);\n for (arma::uword n = 0; n < numberOfDimensions_; ++n) {\n arma::Col<double> nextParameterCandidate = bestParameter_;\n \n nextParameterCandidate(n) += stepSize_;\n nextParameters.col(2 * n) = nextParameterCandidate;\n \n nextParameterCandidate(n) -= 2 * stepSize_;\n nextParameters.col(2 * n + 1) = nextParameterCandidate;\n }\n \n return nextParameters;\n },\n \"Hooke-Jeeves algorithm\");\n\n setInitialStepSize(1.0);\n setStepSizeDecrease(0.5);\n }\n\n void HookeJeevesAlgorithm::initialise(\n const arma::uword numberOfDimensions,\n const arma::Mat<double>& initialParameters) {\n stepSize_ = initialStepSize_;\n }\n\n void HookeJeevesAlgorithm::optimise(\n OptimisationProblem& optimisationProblem) {\n optimise(optimisationProblem, arma::randu<arma::Col<double>>(optimisationProblem.numberOfDimensions_));\n }\n\n void HookeJeevesAlgorithm::setInitialStepSize(\n const double initialStepSize) {\n verify(initialStepSize > 0, \"HookeJeevesAlgorithm.setInitialStepSize: The initial step size must be strict greater than 0.\");\n\n initialStepSize_ = initialStepSize;\n }\n\n double HookeJeevesAlgorithm::getInitialStepSize() const {\n return initialStepSize_;\n }\n\n void HookeJeevesAlgorithm::setStepSizeDecrease(\n const double stepSizeDecrease) {\n verify(stepSizeDecrease > 0 && stepSizeDecrease < 1, \"HookeJeevesAlgorithm.setStepSizeDecrease: The step size decrease must be within the interval (0, 1).\");\n\n stepSizeDecrease_ = stepSizeDecrease;\n }\n\n double HookeJeevesAlgorithm::getStepSizeDecrease() const {\n return stepSizeDecrease_;\n }\n}\n<commit_msg>hotfix: Fixing the step size decrease in the Hooke-Jeeves algorithm<commit_after>#include \"mantella_bits\/optimisationAlgorithm\/hookeJeevesAlgorithm.hpp\"\n\n\/\/ Mantella\n#include \"mantella_bits\/assert.hpp\"\n#include \"mantella_bits\/optimisationProblem.hpp\"\n\nnamespace mant {\n HookeJeevesAlgorithm::HookeJeevesAlgorithm()\n : OptimisationAlgorithm(),\n stepSize_(0) {\n setNextParametersFunction(\n [this](\n const arma::uword numberOfDimensions_,\n const arma::Mat<double>& parameters_,\n const arma::Row<double>& objectiveValues_,\n const arma::Row<double>& differences_) {\n if (arma::all(differences_ >= 0)) {\n stepSize_ *= stepSizeDecrease_;\n }\n\n arma::Mat<double> nextParameters(numberOfDimensions_, 2 * numberOfDimensions_);\n for (arma::uword n = 0; n < numberOfDimensions_; ++n) {\n arma::Col<double> nextParameterCandidate = bestParameter_;\n \n nextParameterCandidate(n) += stepSize_;\n nextParameters.col(2 * n) = nextParameterCandidate;\n \n nextParameterCandidate(n) -= 2 * stepSize_;\n nextParameters.col(2 * n + 1) = nextParameterCandidate;\n }\n \n return nextParameters;\n },\n \"Hooke-Jeeves algorithm\");\n\n setInitialStepSize(1.0);\n setStepSizeDecrease(0.5);\n }\n\n void HookeJeevesAlgorithm::initialise(\n const arma::uword numberOfDimensions,\n const arma::Mat<double>& initialParameters) {\n stepSize_ = initialStepSize_;\n }\n\n void HookeJeevesAlgorithm::optimise(\n OptimisationProblem& optimisationProblem) {\n optimise(optimisationProblem, arma::randu<arma::Col<double>>(optimisationProblem.numberOfDimensions_));\n }\n\n void HookeJeevesAlgorithm::setInitialStepSize(\n const double initialStepSize) {\n verify(initialStepSize > 0, \"HookeJeevesAlgorithm.setInitialStepSize: The initial step size must be strict greater than 0.\");\n\n initialStepSize_ = initialStepSize;\n }\n\n double HookeJeevesAlgorithm::getInitialStepSize() const {\n return initialStepSize_;\n }\n\n void HookeJeevesAlgorithm::setStepSizeDecrease(\n const double stepSizeDecrease) {\n verify(stepSizeDecrease > 0 && stepSizeDecrease < 1, \"HookeJeevesAlgorithm.setStepSizeDecrease: The step size decrease must be within the interval (0, 1).\");\n\n stepSizeDecrease_ = stepSizeDecrease;\n }\n\n double HookeJeevesAlgorithm::getStepSizeDecrease() const {\n return stepSizeDecrease_;\n }\n}\n<|endoftext|>"} {"text":"<commit_before>#include <unistd.h>\n#include <time.h>\n#include <string.h>\n#include <iostream>\n\n#include \"rcu.h\"\n#include \"macros.h\"\n#include \"util.h\"\n#include \"thread.h\"\n#include \"counter.h\"\n#include \"lockguard.h\"\n\nusing namespace std;\nusing namespace util;\n\n\/\/ avoid some corner cases in the beginning\nvolatile rcu::epoch_t rcu::global_epoch = 1;\nvolatile rcu::epoch_t rcu::cleaning_epoch = 0;\nrcu::delete_queue rcu::global_queues[2];\n\nvolatile bool rcu::gc_thread_started = false;\npthread_t rcu::gc_thread_p;\n\nmap<pthread_t, rcu::sync *> rcu::sync_map;\n\n__thread rcu::sync *rcu::tl_sync = NULL;\n__thread unsigned int rcu::tl_crit_section_depth = 0;\n\nstatic event_counter evt_rcu_deletes(\"rcu_deletes\");\nstatic event_counter evt_rcu_frees(\"rcu_frees\");\nstatic event_counter evt_rcu_local_reaps(\"rcu_local_reaps\");\n\nstatic event_avg_counter evt_avg_gc_reaper_queue_len(\"avg_gc_reaper_queue_len\");\nstatic event_avg_counter evt_avg_rcu_delete_queue_len(\"avg_rcu_delete_queue_len\");\nstatic event_avg_counter evt_avg_rcu_local_delete_queue_len(\"avg_rcu_local_delete_queue_len\");\n\nspinlock &\nrcu::rcu_mutex()\n{\n static spinlock s_lock;\n return s_lock;\n}\n\nrcu::sync *\nrcu::register_sync(pthread_t p)\n{\n lock_guard<spinlock> l(rcu_mutex());\n map<pthread_t, sync *>::iterator it = sync_map.find(p);\n ALWAYS_ASSERT(it == sync_map.end());\n return (sync_map[p] = new sync(global_epoch));\n}\n\nrcu::sync *\nrcu::unregister_sync(pthread_t p)\n{\n lock_guard<spinlock> l(rcu_mutex());\n map<pthread_t, sync *>::iterator it = sync_map.find(p);\n if (it == sync_map.end())\n return NULL;\n sync * const s = it->second;\n\n const epoch_t my_cleaning_epoch = cleaning_epoch;\n const epoch_t local_epoch = s->local_epoch;\n const epoch_t local_cleaning_epoch = s->local_epoch - 1;\n\n#ifdef CHECK_INVARIANTS\n const epoch_t my_global_epoch = global_epoch;\n INVARIANT(my_global_epoch == local_epoch ||\n my_global_epoch == (local_epoch + 1));\n INVARIANT(my_global_epoch == (my_cleaning_epoch + 1) ||\n my_global_epoch == (my_cleaning_epoch + 2));\n INVARIANT(my_cleaning_epoch != local_epoch);\n#endif\n\n INVARIANT(local_cleaning_epoch == my_cleaning_epoch); \/\/ b\/c we are out of RCU loop\n INVARIANT(EnableThreadLocalCleanup ||\n global_queues[local_cleaning_epoch % 2].empty());\n if (EnableThreadLocalCleanup) {\n global_queues[local_cleaning_epoch % 2].insert(\n global_queues[local_cleaning_epoch % 2].end(),\n s->local_queues[local_cleaning_epoch % 2].begin(),\n s->local_queues[local_cleaning_epoch % 2].end());\n }\n global_queues[local_epoch % 2].insert(\n global_queues[local_epoch % 2].end(),\n s->local_queues[local_epoch % 2].begin(),\n s->local_queues[local_epoch % 2].end());\n s->local_queues[0].clear();\n s->local_queues[1].clear();\n sync_map.erase(it);\n\n INVARIANT(cleaning_epoch == my_cleaning_epoch); \/\/ shouldn't change b\/c we hold rcu_mutex()\n return s;\n}\n\nvoid\nrcu::enable()\n{\n if (likely(gc_thread_started))\n return;\n {\n lock_guard<spinlock> l(rcu_mutex());\n if (gc_thread_started)\n return;\n gc_thread_started = true;\n }\n \/\/ start gc thread as daemon thread\n pthread_attr_t attr;\n ALWAYS_ASSERT(pthread_attr_init(&attr) == 0);\n ALWAYS_ASSERT(pthread_attr_setdetachstate(&attr, PTHREAD_CREATE_DETACHED) == 0);\n ALWAYS_ASSERT(pthread_create(&gc_thread_p, &attr, gc_thread_loop, NULL) == 0);\n ALWAYS_ASSERT(pthread_attr_destroy(&attr) == 0);\n}\n\nvoid\nrcu::region_begin()\n{\n if (unlikely(!tl_sync)) {\n INVARIANT(!tl_crit_section_depth);\n enable();\n tl_sync = register_sync(pthread_self());\n }\n INVARIANT(tl_sync);\n INVARIANT(gc_thread_started);\n if (!tl_crit_section_depth++) {\n tl_sync->local_critical_mutex.lock();\n tl_sync->local_epoch = global_epoch;\n }\n}\n\nvoid\nrcu::free_with_fn(void *p, deleter_t fn)\n{\n INVARIANT(tl_sync);\n INVARIANT(tl_crit_section_depth);\n INVARIANT(gc_thread_started);\n tl_sync->local_queues[tl_sync->local_epoch % 2].push_back(delete_entry(p, fn));\n ++evt_rcu_frees;\n}\n\nvoid\nrcu::region_end()\n{\n INVARIANT(tl_sync);\n INVARIANT(tl_crit_section_depth);\n INVARIANT(gc_thread_started);\n if (!--tl_crit_section_depth) {\n const epoch_t my_global_epoch = global_epoch;\n INVARIANT(tl_sync->local_epoch == my_global_epoch ||\n tl_sync->local_epoch == (my_global_epoch - 1));\n if (EnableThreadLocalCleanup) {\n const epoch_t local_cleaning_epoch = tl_sync->local_epoch - 1;\n const epoch_t global_cleaning_epoch = cleaning_epoch;\n if (!(local_cleaning_epoch == global_cleaning_epoch ||\n local_cleaning_epoch == global_cleaning_epoch + 1)) {\n cerr << \"my_global_epoch : \" << my_global_epoch << endl;\n cerr << \"local_cleaning_epoch : \" << local_cleaning_epoch << endl;\n cerr << \"global_cleaning_epoch: \" << global_cleaning_epoch << endl;\n cerr << \"cur_global_epoch : \" << global_epoch << endl;\n INVARIANT(false);\n }\n INVARIANT(tl_sync->scratch_queue.empty());\n if (local_cleaning_epoch == global_cleaning_epoch &&\n !tl_sync->local_queues[local_cleaning_epoch % 2].empty()) {\n \/\/ reap locally, outside the critical section\n swap(tl_sync->local_queues[local_cleaning_epoch % 2],\n tl_sync->scratch_queue);\n ++evt_rcu_local_reaps;\n }\n }\n tl_sync->local_critical_mutex.unlock();\n delete_queue &q = tl_sync->scratch_queue;\n if (EnableThreadLocalCleanup && !q.empty()) {\n for (rcu::delete_queue::iterator it = q.begin(); it != q.end(); ++it) {\n try {\n it->second(it->first);\n } catch (...) {\n cerr << \"rcu::region_end: uncaught exception in free routine\" << endl;\n }\n }\n evt_rcu_deletes += q.size();\n evt_avg_rcu_local_delete_queue_len.offer(q.size());\n q.clear();\n }\n }\n}\n\nbool\nrcu::in_rcu_region()\n{\n return tl_crit_section_depth;\n}\n\n\nstatic const uint64_t rcu_epoch_us = 50 * 1000; \/* 50 ms *\/\nstatic const uint64_t rcu_epoch_ns = rcu_epoch_us * 1000;\n\nclass gc_reaper_thread : public ndb_thread {\npublic:\n gc_reaper_thread()\n : ndb_thread(true, \"rcu-reaper\")\n {\n queue.reserve(32000);\n }\n virtual void\n run()\n {\n struct timespec t;\n NDB_MEMSET(&t, 0, sizeof(t));\n t.tv_nsec = rcu_epoch_ns;\n rcu::delete_queue stack_queue;\n stack_queue.reserve(rcu::SyncDeleteQueueBufSize);\n for (;;) {\n \/\/ see if any elems to process\n {\n lock_guard<spinlock> l(lock);\n stack_queue.swap(queue);\n }\n evt_avg_gc_reaper_queue_len.offer(stack_queue.size());\n if (stack_queue.empty())\n nanosleep(&t, NULL);\n for (rcu::delete_queue::iterator it = stack_queue.begin();\n it != stack_queue.end(); ++it) {\n try {\n it->second(it->first);\n } catch (...) {\n cerr << \"rcu-reaper: uncaught exception in free routine\" << endl;\n }\n }\n evt_rcu_deletes += stack_queue.size();\n stack_queue.clear();\n }\n }\n\n void\n reap_and_clear(rcu::delete_queue &local_queue)\n {\n lock_guard<spinlock> l0(lock);\n if (queue.empty()) {\n queue.swap(local_queue);\n } else {\n queue.insert(\n queue.end(),\n local_queue.begin(),\n local_queue.end());\n local_queue.clear();\n }\n INVARIANT(local_queue.empty());\n }\n\n spinlock lock;\n rcu::delete_queue queue;\n};\n\n\n\nvoid *\nrcu::gc_thread_loop(void *p)\n{\n \/\/ runs as daemon thread\n struct timespec t;\n NDB_MEMSET(&t, 0, sizeof(t));\n timer loop_timer;\n static gc_reaper_thread reaper_loops[NGCReapers];\n for (unsigned int i = 0; i < NGCReapers; i++)\n reaper_loops[i].start();\n unsigned int rr = 0;\n for (;;) {\n\n const uint64_t last_loop_usec = loop_timer.lap();\n const uint64_t delay_time_usec = rcu_epoch_us;\n if (last_loop_usec < delay_time_usec) {\n t.tv_nsec = (delay_time_usec - last_loop_usec) * 1000;\n nanosleep(&t, NULL);\n }\n\n \/\/ increment global epoch\n INVARIANT(cleaning_epoch + 1 == global_epoch);\n COMPILER_MEMORY_FENCE;\n const epoch_t new_cleaning_epoch = global_epoch++;\n INVARIANT(cleaning_epoch + 1 == new_cleaning_epoch);\n __sync_synchronize();\n\n \/\/ now wait for each thread to finish any outstanding critical sections\n \/\/ from the previous epoch, and advance it forward to the global epoch\n {\n lock_guard<spinlock> l(rcu_mutex()); \/\/ prevents new threads from joining\n\n \/\/ force all threads to advance to new epoch\n for (map<pthread_t, sync *>::iterator it = sync_map.begin();\n it != sync_map.end(); ++it) {\n sync * const s = it->second;\n const epoch_t local_epoch = s->local_epoch;\n if (local_epoch != global_epoch) {\n INVARIANT(local_epoch == new_cleaning_epoch);\n lock_guard<spinlock> l0(s->local_critical_mutex);\n if (s->local_epoch == global_epoch)\n \/\/ has moved on, so we cannot safely reap\n \/\/ like we do below\n continue;\n INVARIANT(s->local_epoch == new_cleaning_epoch);\n if (EnableThreadLocalCleanup) {\n \/\/ if we haven't completely finished thread-local\n \/\/ cleanup, then we move the pointers into the\n \/\/ gc reapers\n delete_queue &local_queue = s->local_queues[global_epoch % 2];\n if (!local_queue.empty())\n reaper_loops[rr++ % NGCReapers].reap_and_clear(local_queue);\n }\n INVARIANT(s->local_queues[global_epoch % 2].empty());\n s->local_epoch = global_epoch;\n }\n }\n\n COMPILER_MEMORY_FENCE;\n cleaning_epoch = new_cleaning_epoch;\n __sync_synchronize();\n\n if (!EnableThreadLocalCleanup) {\n \/\/ claim deleted pointers\n for (map<pthread_t, sync *>::iterator it = sync_map.begin();\n it != sync_map.end(); ++it) {\n sync * const s = it->second;\n INVARIANT(s->local_epoch == global_epoch);\n\n \/\/ so we can now claim its deleted pointers from global_epoch - 1\n delete_queue &local_queue = s->local_queues[cleaning_epoch % 2];\n evt_avg_rcu_delete_queue_len.offer(local_queue.size());\n reaper_loops[rr++ % NGCReapers].reap_and_clear(local_queue);\n INVARIANT(local_queue.empty());\n }\n }\n\n \/\/ pull the ones from the global queue\n if (EnableThreadLocalCleanup) {\n delete_queue &q = global_queues[global_epoch % 2];\n if (!q.empty())\n reaper_loops[rr++ % NGCReapers].reap_and_clear(q);\n }\n INVARIANT(global_queues[global_epoch % 2].empty());\n delete_queue &global_queue = global_queues[cleaning_epoch % 2];\n reaper_loops[rr++ % NGCReapers].reap_and_clear(global_queue);\n }\n }\n return NULL;\n}\n\nstatic void rcu_completion_callback(ndb_thread *t)\n{\n rcu::sync *s = rcu::unregister_sync(t->pthread_id());\n if (s)\n delete s;\n}\nNDB_THREAD_REGISTER_COMPLETION_CALLBACK(rcu_completion_callback)\n<commit_msg>rcu: more assertions<commit_after>#include <unistd.h>\n#include <time.h>\n#include <string.h>\n#include <iostream>\n\n#include \"rcu.h\"\n#include \"macros.h\"\n#include \"util.h\"\n#include \"thread.h\"\n#include \"counter.h\"\n#include \"lockguard.h\"\n\nusing namespace std;\nusing namespace util;\n\n\/\/ avoid some corner cases in the beginning\nvolatile rcu::epoch_t rcu::global_epoch = 1;\nvolatile rcu::epoch_t rcu::cleaning_epoch = 0;\nrcu::delete_queue rcu::global_queues[2];\n\nvolatile bool rcu::gc_thread_started = false;\npthread_t rcu::gc_thread_p;\n\nmap<pthread_t, rcu::sync *> rcu::sync_map;\n\n__thread rcu::sync *rcu::tl_sync = NULL;\n__thread unsigned int rcu::tl_crit_section_depth = 0;\n\nstatic event_counter evt_rcu_deletes(\"rcu_deletes\");\nstatic event_counter evt_rcu_frees(\"rcu_frees\");\nstatic event_counter evt_rcu_local_reaps(\"rcu_local_reaps\");\n\nstatic event_avg_counter evt_avg_gc_reaper_queue_len(\"avg_gc_reaper_queue_len\");\nstatic event_avg_counter evt_avg_rcu_delete_queue_len(\"avg_rcu_delete_queue_len\");\nstatic event_avg_counter evt_avg_rcu_local_delete_queue_len(\"avg_rcu_local_delete_queue_len\");\n\nspinlock &\nrcu::rcu_mutex()\n{\n static spinlock s_lock;\n return s_lock;\n}\n\nrcu::sync *\nrcu::register_sync(pthread_t p)\n{\n lock_guard<spinlock> l(rcu_mutex());\n map<pthread_t, sync *>::iterator it = sync_map.find(p);\n ALWAYS_ASSERT(it == sync_map.end());\n return (sync_map[p] = new sync(global_epoch));\n}\n\nrcu::sync *\nrcu::unregister_sync(pthread_t p)\n{\n lock_guard<spinlock> l(rcu_mutex());\n map<pthread_t, sync *>::iterator it = sync_map.find(p);\n if (it == sync_map.end())\n return NULL;\n sync * const s = it->second;\n\n const epoch_t my_cleaning_epoch = cleaning_epoch;\n const epoch_t local_epoch = s->local_epoch;\n const epoch_t local_cleaning_epoch = s->local_epoch - 1;\n\n#ifdef CHECK_INVARIANTS\n const epoch_t my_global_epoch = global_epoch;\n INVARIANT(my_global_epoch == local_epoch ||\n my_global_epoch == (local_epoch + 1));\n INVARIANT(my_global_epoch == (my_cleaning_epoch + 1) ||\n my_global_epoch == (my_cleaning_epoch + 2));\n INVARIANT(my_cleaning_epoch != local_epoch);\n if (local_cleaning_epoch != my_cleaning_epoch) {\n cerr << \"my_cleaning_epoch: \" << my_cleaning_epoch << endl;\n cerr << \"local_epoch: \" << local_epoch << endl;\n cerr << \"local_cleaning_epoch: \" << local_cleaning_epoch << endl;\n cerr << \"my_global_epoch: \" << my_global_epoch << endl;\n }\n#endif\n\n INVARIANT(cleaning_epoch == my_cleaning_epoch);\n INVARIANT(EnableThreadLocalCleanup ||\n global_queues[local_cleaning_epoch % 2].empty());\n if (EnableThreadLocalCleanup) {\n global_queues[local_cleaning_epoch % 2].insert(\n global_queues[local_cleaning_epoch % 2].end(),\n s->local_queues[local_cleaning_epoch % 2].begin(),\n s->local_queues[local_cleaning_epoch % 2].end());\n }\n global_queues[local_epoch % 2].insert(\n global_queues[local_epoch % 2].end(),\n s->local_queues[local_epoch % 2].begin(),\n s->local_queues[local_epoch % 2].end());\n s->local_queues[0].clear();\n s->local_queues[1].clear();\n sync_map.erase(it);\n\n INVARIANT(cleaning_epoch == my_cleaning_epoch); \/\/ shouldn't change b\/c we hold rcu_mutex()\n return s;\n}\n\nvoid\nrcu::enable()\n{\n if (likely(gc_thread_started))\n return;\n {\n lock_guard<spinlock> l(rcu_mutex());\n if (gc_thread_started)\n return;\n gc_thread_started = true;\n }\n \/\/ start gc thread as daemon thread\n pthread_attr_t attr;\n ALWAYS_ASSERT(pthread_attr_init(&attr) == 0);\n ALWAYS_ASSERT(pthread_attr_setdetachstate(&attr, PTHREAD_CREATE_DETACHED) == 0);\n ALWAYS_ASSERT(pthread_create(&gc_thread_p, &attr, gc_thread_loop, NULL) == 0);\n ALWAYS_ASSERT(pthread_attr_destroy(&attr) == 0);\n}\n\nvoid\nrcu::region_begin()\n{\n if (unlikely(!tl_sync)) {\n INVARIANT(!tl_crit_section_depth);\n enable();\n tl_sync = register_sync(pthread_self());\n }\n INVARIANT(tl_sync);\n INVARIANT(gc_thread_started);\n if (!tl_crit_section_depth++) {\n tl_sync->local_critical_mutex.lock();\n tl_sync->local_epoch = global_epoch;\n INVARIANT(tl_sync->local_epoch != cleaning_epoch);\n }\n}\n\nvoid\nrcu::free_with_fn(void *p, deleter_t fn)\n{\n INVARIANT(tl_sync);\n INVARIANT(tl_crit_section_depth);\n INVARIANT(gc_thread_started);\n tl_sync->local_queues[tl_sync->local_epoch % 2].push_back(delete_entry(p, fn));\n ++evt_rcu_frees;\n#ifdef CHECK_INVARIANTS\n const epoch_t my_global_epoch = global_epoch;\n const epoch_t global_cleaning_epoch = cleaning_epoch;\n const epoch_t local_cleaning_epoch = tl_sync->local_epoch - 1;\n if (!(local_cleaning_epoch == global_cleaning_epoch ||\n local_cleaning_epoch == (global_cleaning_epoch + 1))) {\n cerr << \"my_global_epoch : \" << my_global_epoch << endl;\n cerr << \"local_cleaning_epoch : \" << local_cleaning_epoch << endl;\n cerr << \"global_cleaning_epoch: \" << global_cleaning_epoch << endl;\n cerr << \"cur_global_epoch : \" << global_epoch << endl;\n INVARIANT(false);\n }\n#endif\n}\n\nvoid\nrcu::region_end()\n{\n INVARIANT(tl_sync);\n INVARIANT(tl_crit_section_depth);\n INVARIANT(gc_thread_started);\n if (!--tl_crit_section_depth) {\n const epoch_t my_global_epoch = global_epoch;\n INVARIANT(tl_sync->local_epoch == my_global_epoch ||\n tl_sync->local_epoch == (my_global_epoch - 1));\n if (EnableThreadLocalCleanup) {\n const epoch_t local_cleaning_epoch = tl_sync->local_epoch - 1;\n const epoch_t global_cleaning_epoch = cleaning_epoch;\n#ifdef CHECK_INVARIANTS\n INVARIANT(tl_sync->local_epoch != global_cleaning_epoch);\n if (!(local_cleaning_epoch == global_cleaning_epoch ||\n local_cleaning_epoch == (global_cleaning_epoch + 1))) {\n cerr << \"my_global_epoch : \" << my_global_epoch << endl;\n cerr << \"local_cleaning_epoch : \" << local_cleaning_epoch << endl;\n cerr << \"global_cleaning_epoch: \" << global_cleaning_epoch << endl;\n cerr << \"cur_global_epoch : \" << global_epoch << endl;\n INVARIANT(false);\n }\n#endif\n INVARIANT(tl_sync->scratch_queue.empty());\n if (local_cleaning_epoch == global_cleaning_epoch &&\n !tl_sync->local_queues[local_cleaning_epoch % 2].empty()) {\n \/\/ reap locally, outside the critical section\n swap(tl_sync->local_queues[local_cleaning_epoch % 2],\n tl_sync->scratch_queue);\n ++evt_rcu_local_reaps;\n }\n }\n tl_sync->local_critical_mutex.unlock();\n delete_queue &q = tl_sync->scratch_queue;\n if (EnableThreadLocalCleanup && !q.empty()) {\n for (rcu::delete_queue::iterator it = q.begin(); it != q.end(); ++it) {\n try {\n it->second(it->first);\n } catch (...) {\n cerr << \"rcu::region_end: uncaught exception in free routine\" << endl;\n }\n }\n evt_rcu_deletes += q.size();\n evt_avg_rcu_local_delete_queue_len.offer(q.size());\n q.clear();\n }\n }\n}\n\nbool\nrcu::in_rcu_region()\n{\n return tl_crit_section_depth;\n}\n\n\nstatic const uint64_t rcu_epoch_us = 50 * 1000; \/* 50 ms *\/\nstatic const uint64_t rcu_epoch_ns = rcu_epoch_us * 1000;\n\nclass gc_reaper_thread : public ndb_thread {\npublic:\n gc_reaper_thread()\n : ndb_thread(true, \"rcu-reaper\")\n {\n queue.reserve(32000);\n }\n virtual void\n run()\n {\n struct timespec t;\n NDB_MEMSET(&t, 0, sizeof(t));\n t.tv_nsec = rcu_epoch_ns;\n rcu::delete_queue stack_queue;\n stack_queue.reserve(rcu::SyncDeleteQueueBufSize);\n for (;;) {\n \/\/ see if any elems to process\n {\n lock_guard<spinlock> l(lock);\n stack_queue.swap(queue);\n }\n evt_avg_gc_reaper_queue_len.offer(stack_queue.size());\n if (stack_queue.empty())\n nanosleep(&t, NULL);\n for (rcu::delete_queue::iterator it = stack_queue.begin();\n it != stack_queue.end(); ++it) {\n try {\n it->second(it->first);\n } catch (...) {\n cerr << \"rcu-reaper: uncaught exception in free routine\" << endl;\n }\n }\n evt_rcu_deletes += stack_queue.size();\n stack_queue.clear();\n }\n }\n\n void\n reap_and_clear(rcu::delete_queue &local_queue)\n {\n lock_guard<spinlock> l0(lock);\n if (queue.empty()) {\n queue.swap(local_queue);\n } else {\n queue.insert(\n queue.end(),\n local_queue.begin(),\n local_queue.end());\n local_queue.clear();\n }\n INVARIANT(local_queue.empty());\n }\n\n spinlock lock;\n rcu::delete_queue queue;\n};\n\n\n\nvoid *\nrcu::gc_thread_loop(void *p)\n{\n \/\/ runs as daemon thread\n struct timespec t;\n NDB_MEMSET(&t, 0, sizeof(t));\n timer loop_timer;\n static gc_reaper_thread reaper_loops[NGCReapers];\n for (unsigned int i = 0; i < NGCReapers; i++)\n reaper_loops[i].start();\n unsigned int rr = 0;\n for (;;) {\n\n const uint64_t last_loop_usec = loop_timer.lap();\n const uint64_t delay_time_usec = rcu_epoch_us;\n if (last_loop_usec < delay_time_usec) {\n t.tv_nsec = (delay_time_usec - last_loop_usec) * 1000;\n nanosleep(&t, NULL);\n }\n\n \/\/ increment global epoch\n INVARIANT(cleaning_epoch + 1 == global_epoch);\n COMPILER_MEMORY_FENCE;\n const epoch_t new_cleaning_epoch = global_epoch++;\n INVARIANT(cleaning_epoch + 1 == new_cleaning_epoch);\n __sync_synchronize();\n\n \/\/ now wait for each thread to finish any outstanding critical sections\n \/\/ from the previous epoch, and advance it forward to the global epoch\n {\n lock_guard<spinlock> l(rcu_mutex()); \/\/ prevents new threads from joining\n\n \/\/ force all threads to advance to new epoch\n for (map<pthread_t, sync *>::iterator it = sync_map.begin();\n it != sync_map.end(); ++it) {\n sync * const s = it->second;\n const epoch_t local_epoch = s->local_epoch;\n if (local_epoch != global_epoch) {\n INVARIANT(local_epoch == new_cleaning_epoch);\n lock_guard<spinlock> l0(s->local_critical_mutex);\n if (s->local_epoch == global_epoch)\n \/\/ has moved on, so we cannot safely reap\n \/\/ like we do below\n continue;\n INVARIANT(s->local_epoch == new_cleaning_epoch);\n if (EnableThreadLocalCleanup) {\n \/\/ if we haven't completely finished thread-local\n \/\/ cleanup, then we move the pointers into the\n \/\/ gc reapers\n delete_queue &local_queue = s->local_queues[global_epoch % 2];\n if (!local_queue.empty())\n reaper_loops[rr++ % NGCReapers].reap_and_clear(local_queue);\n }\n INVARIANT(s->local_queues[global_epoch % 2].empty());\n s->local_epoch = global_epoch;\n }\n }\n\n COMPILER_MEMORY_FENCE;\n cleaning_epoch = new_cleaning_epoch;\n __sync_synchronize();\n\n if (!EnableThreadLocalCleanup) {\n \/\/ claim deleted pointers\n for (map<pthread_t, sync *>::iterator it = sync_map.begin();\n it != sync_map.end(); ++it) {\n sync * const s = it->second;\n INVARIANT(s->local_epoch == global_epoch);\n\n \/\/ so we can now claim its deleted pointers from global_epoch - 1\n delete_queue &local_queue = s->local_queues[cleaning_epoch % 2];\n evt_avg_rcu_delete_queue_len.offer(local_queue.size());\n reaper_loops[rr++ % NGCReapers].reap_and_clear(local_queue);\n INVARIANT(local_queue.empty());\n }\n }\n\n \/\/ pull the ones from the global queue\n if (EnableThreadLocalCleanup) {\n delete_queue &q = global_queues[global_epoch % 2];\n if (!q.empty())\n reaper_loops[rr++ % NGCReapers].reap_and_clear(q);\n }\n INVARIANT(global_queues[global_epoch % 2].empty());\n delete_queue &global_queue = global_queues[cleaning_epoch % 2];\n reaper_loops[rr++ % NGCReapers].reap_and_clear(global_queue);\n }\n }\n return NULL;\n}\n\nstatic void rcu_completion_callback(ndb_thread *t)\n{\n rcu::sync *s = rcu::unregister_sync(t->pthread_id());\n if (s)\n delete s;\n}\nNDB_THREAD_REGISTER_COMPLETION_CALLBACK(rcu_completion_callback)\n<|endoftext|>"} {"text":"<commit_before>\/*\n * BTreeTest.cpp\n *\n * Created on: Dec 30, 2013\n * Author: airekans\n *\/\n\n#include \"BTree.h\"\n#include <gtest\/gtest.h>\n#include <memory>\n\nusing snippet::algo::BTree;\n\nTEST(BTree, TestCtor)\n{\n BTree btree(9);\n\n ASSERT_EQ(static_cast<unsigned>(0), btree.GetSize());\n}\n\nTEST(BTree, TestInsert)\n{\n BTree btree(9);\n\n btree.Insert(1, \"a\");\n\n ASSERT_TRUE(btree.Find(1, NULL, NULL));\n ASSERT_EQ(static_cast<unsigned>(1), btree.GetSize());\n\n btree.Insert(2, \"b\");\n btree.Dump();\n\n ASSERT_TRUE(btree.Find(1, NULL, NULL));\n ASSERT_TRUE(btree.Find(2, NULL, NULL));\n ASSERT_EQ(static_cast<unsigned>(2), btree.GetSize());\n}\n\nclass BTreeValueTest : public ::testing::TestWithParam<int>\n{};\n\nTEST_P(BTreeValueTest, TestInsertWithLeave)\n{\n const int times = GetParam();\n BTree btree(5);\n\n for (int i = 0; i < times; ++i)\n {\n btree.Insert(i, \"a\");\n }\n\n ASSERT_EQ(static_cast<unsigned>(times), btree.GetSize());\n for (int i = 0; i < times; ++i)\n {\n EXPECT_TRUE(btree.Find(i, NULL, NULL)) << \"i: \" << i;\n }\n}\n\nINSTANTIATE_TEST_CASE_P(TestBTreeInsert,\n BTreeValueTest,\n ::testing::Range(3, 21));\n\nTEST(BTree, TestFind)\n{\n BTree btree(9);\n\n btree.Insert(1, \"a\");\n btree.Insert(2, \"b\");\n\n ASSERT_TRUE(btree.Find(1, NULL, NULL));\n ASSERT_TRUE(btree.Find(2, NULL, NULL));\n ASSERT_FALSE(btree.Find(3, NULL, NULL));\n}\n<commit_msg>Add random test for insert.<commit_after>\/*\n * BTreeTest.cpp\n *\n * Created on: Dec 30, 2013\n * Author: airekans\n *\/\n\n#include \"BTree.h\"\n#include <gtest\/gtest.h>\n#include <memory>\n#include <ctime>\n#include <cstdlib>\n#include <algorithm>\n#include <vector>\n#include <string>\n#include <sstream>\n\nusing snippet::algo::BTree;\n\nTEST(BTree, TestCtor)\n{\n BTree btree(9);\n\n ASSERT_EQ(static_cast<unsigned>(0), btree.GetSize());\n}\n\nTEST(BTree, TestInsert)\n{\n BTree btree(9);\n\n btree.Insert(1, \"a\");\n\n ASSERT_TRUE(btree.Find(1, NULL, NULL));\n ASSERT_EQ(static_cast<unsigned>(1), btree.GetSize());\n\n btree.Insert(2, \"b\");\n btree.Dump();\n\n ASSERT_TRUE(btree.Find(1, NULL, NULL));\n ASSERT_TRUE(btree.Find(2, NULL, NULL));\n ASSERT_EQ(static_cast<unsigned>(2), btree.GetSize());\n}\n\nclass BTreeValueTest : public ::testing::TestWithParam<int>\n{\npublic:\n static void SetUpTestCase()\n {\n srand(unsigned(time(NULL)));\n }\n};\n\nTEST_P(BTreeValueTest, TestInsertWithLeave)\n{\n const int times = GetParam();\n BTree btree(5);\n\n for (int i = 0; i < times; ++i)\n {\n btree.Insert(i, \"a\");\n }\n\n ASSERT_EQ(static_cast<unsigned>(times), btree.GetSize());\n for (int i = 0; i < times; ++i)\n {\n EXPECT_TRUE(btree.Find(i, NULL, NULL)) << \"i: \" << i;\n }\n}\n\nTEST_P(BTreeValueTest, TestInsertWithReverseOrder)\n{\n const int times = GetParam();\n BTree btree(5);\n\n for (int i = times; i > 0; --i)\n {\n btree.Insert(i, \"a\");\n }\n\n ASSERT_EQ(static_cast<unsigned>(times), btree.GetSize());\n for (int i = times; i > 0; --i)\n {\n EXPECT_TRUE(btree.Find(i, NULL, NULL)) << \"i: \" << i;\n }\n}\n\nnamespace {\n template<typename T>\n std::string VectorToString(const std::vector<T>& v)\n {\n if (v.empty())\n {\n return \"\";\n }\n\n std::ostringstream oss;\n for (unsigned i = 0; i < v.size() - 1; ++i)\n {\n oss << v[i] << ' ';\n }\n oss << v.back();\n return oss.str();\n }\n}\n\nTEST_P(BTreeValueTest, TestInsertWithRandomOrder)\n{\n const int times = GetParam();\n BTree btree(5);\n\n \/\/ generate a vector<int> with size times\n std::vector<int> numbers;\n for (int i = 0; i < times; ++i)\n {\n numbers.push_back(i);\n }\n std::random_shuffle(numbers.begin(), numbers.end());\n\n for (int i = 0; i < times; ++i)\n {\n btree.Insert(numbers[i], \"a\");\n }\n\n ASSERT_EQ(static_cast<unsigned>(times), btree.GetSize())\n << VectorToString(numbers);\n for (int i = 0; i < times; ++i)\n {\n EXPECT_TRUE(btree.Find(i, NULL, NULL)) << \"i: \" << i;\n }\n}\n\nINSTANTIATE_TEST_CASE_P(TestBTreeInsert,\n BTreeValueTest,\n ::testing::Range(3, 21));\n\nTEST(BTree, TestFind)\n{\n BTree btree(9);\n\n btree.Insert(1, \"a\");\n btree.Insert(2, \"b\");\n\n ASSERT_TRUE(btree.Find(1, NULL, NULL));\n ASSERT_TRUE(btree.Find(2, NULL, NULL));\n ASSERT_FALSE(btree.Find(3, NULL, NULL));\n}\n<|endoftext|>"} {"text":"<commit_before>\/** \\file convert_rss_db_tables.cc\n * \\brief Transfers data from ub_tools.rss_aggregator to vufind.tuefind_rss_items.\n * \\author Dr. Johannes Ruscheinski\n *\/\n\n\/*\n Copyright (C) 2021 Library of the University of Tübingen\n\n This program is free software: you can redistribute it and\/or modify\n it under the terms of the GNU Affero General Public License as\n published by the Free Software Foundation, either version 3 of the\n License, or (at your option) any later version.\n\n This program is distributed in the hope that it will be useful,\n but WITHOUT ANY WARRANTY; without even the implied warranty of\n MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the\n GNU Affero General Public License for more details.\n\n You should have received a copy of the GNU Affero General Public License\n along with this program. If not, see <http:\/\/www.gnu.org\/licenses\/>.\n*\/\n\n#include <set>\n#include <unordered_map>\n#include <cstdlib>\n#include \"DbConnection.h\"\n#include \"DbResultSet.h\"\n#include \"DbRow.h\"\n#include \"StlHelpers.h\"\n#include \"StringUtil.h\"\n#include \"util.h\"\n#include \"VuFind.h\"\n\n\nnamespace {\n\n\nstruct FeedInfo {\n std::string id_;\n std::set<std::string> subsystem_types_;\npublic:\n FeedInfo() = default;\n FeedInfo(const FeedInfo &rhs) = default;\n FeedInfo(const std::string &id, const std::set<std::string> &subsystem_types)\n : id_(id), subsystem_types_(subsystem_types) { }\n inline bool isCompatibleWith(const std::string &subsystem_type) const\n { return subsystem_types_.find(subsystem_type) != subsystem_types_.cend(); }\n};\n\n\nbool GetRSSFeedsID(DbConnection * vufind_connection, const std::string &feed_url, FeedInfo * const feed_info) {\n static std::unordered_map<std::string, FeedInfo> urls_to_feed_infos_map;\n const auto url_and_feed_info(urls_to_feed_infos_map.find(feed_url));\n if (url_and_feed_info != urls_to_feed_infos_map.end()) {\n *feed_info = url_and_feed_info->second;\n return true;\n }\n\n vufind_connection->queryOrDie(\"SELECT id,subsystem_types FROM tuefind_rss_feeds WHERE feed_url=\"\n + vufind_connection->escapeAndQuoteString(feed_url));\n auto result_set(vufind_connection->getLastResultSet());\n if (result_set.empty()) {\n static std::unordered_set<std::string> known_missing;\n if (known_missing.find(feed_url) == known_missing.end()) {\n LOG_WARNING(\"found no tuefind_rss_feeds.id for \\\"\" + feed_url + \"\\\"!\");\n known_missing.emplace(feed_url);\n }\n return false;\n }\n\n const auto row(result_set.getNextRow());\n std::vector<std::string> subsystem_types;\n StringUtil::Split(row[\"subsystem_types\"], ',', &subsystem_types);\n *feed_info = FeedInfo(row[\"id\"], StlHelpers::VectorToSet(subsystem_types));\n urls_to_feed_infos_map[feed_url] = *feed_info;\n return true;\n}\n\n\nvoid CopyItem(DbConnection * const db_writer, const std::string &feed_id, const std::string &item_id,\n const std::string &item_url, const std::string &item_title, const std::string &item_description,\n const std::string &pub_date, const std::string &insertion_time)\n{\n db_writer->queryOrDie(\"INSERT INTO tuefind_rss_items SET rss_feeds_id=\" + feed_id + \",item_id='\" + item_id\n + \"',item_url=\" + db_writer->escapeAndQuoteString(item_url) + \",item_title=\"\n + db_writer->escapeAndQuoteString(item_title) + \",item_description=\"\n + db_writer->escapeAndQuoteString(item_description) + \",pub_date='\"\n + pub_date + \"',insertion_time='\" + insertion_time + \"'\");\n}\n\n\n} \/\/ unnamed namespace\n\n\nint Main(int \/*argc*\/, char *\/*argv*\/[]) {\n auto db_reader((DbConnection()));\n auto db_writer(VuFind::GetDbConnection());\n\n db_reader.queryOrDie(\"SELECT * FROM rss_aggregator\");\n auto result_set(db_reader.getLastResultSet());\n DbTransaction transaction(db_writer.get());\n while (const auto row = result_set.getNextRow()) {\n FeedInfo feed_info;\n if (not GetRSSFeedsID(db_writer.get(), row[\"feed_url\"], &feed_info)) {\n transaction.rollback();\n LOG_WARNING(\"Undid partial conversion w\/ a ROLLBACK!\");\n return EXIT_FAILURE;\n }\n\n if (unlikely(not feed_info.isCompatibleWith(row[\"flavour\"])))\n LOG_ERROR(\"Item w\/ item_id \\\"\" + row[\"item_id\"] + \" has a flavour \\\"\" + row[\"flavour\"] +\n \"\\\" which is incompatible with the subsystem_types \\\"\"\n + StlHelpers::ContainerToString(feed_info.subsystem_types_.cbegin(),\n feed_info.subsystem_types_.cend(), \",\"));\n CopyItem(db_writer.get(), feed_info.id_, row[\"item_id\"], row[\"item_url\"], row[\"item_title\"],\n row[\"item_description\"], row[\"pub_date\"], row[\"insertion_time\"]);\n }\n transaction.commit();\n db_reader.queryOrDie(\"DROP TABLE IF EXISTS ub_tools.rss_aggregator\");\n\n return EXIT_SUCCESS;\n}\n<commit_msg>convert_rss_db_tables.cc: Only migrate tables if VuFind is installed, else just drop rss_aggregator table.<commit_after>\/** \\file convert_rss_db_tables.cc\n * \\brief Transfers data from ub_tools.rss_aggregator to vufind.tuefind_rss_items.\n * \\author Dr. Johannes Ruscheinski\n *\/\n\n\/*\n Copyright (C) 2021 Library of the University of Tübingen\n\n This program is free software: you can redistribute it and\/or modify\n it under the terms of the GNU Affero General Public License as\n published by the Free Software Foundation, either version 3 of the\n License, or (at your option) any later version.\n\n This program is distributed in the hope that it will be useful,\n but WITHOUT ANY WARRANTY; without even the implied warranty of\n MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the\n GNU Affero General Public License for more details.\n\n You should have received a copy of the GNU Affero General Public License\n along with this program. If not, see <http:\/\/www.gnu.org\/licenses\/>.\n*\/\n\n#include <set>\n#include <unordered_map>\n#include <cstdlib>\n#include \"DbConnection.h\"\n#include \"DbResultSet.h\"\n#include \"DbRow.h\"\n#include \"StlHelpers.h\"\n#include \"StringUtil.h\"\n#include \"util.h\"\n#include \"VuFind.h\"\n\n\nnamespace {\n\n\nstruct FeedInfo {\n std::string id_;\n std::set<std::string> subsystem_types_;\npublic:\n FeedInfo() = default;\n FeedInfo(const FeedInfo &rhs) = default;\n FeedInfo(const std::string &id, const std::set<std::string> &subsystem_types)\n : id_(id), subsystem_types_(subsystem_types) { }\n inline bool isCompatibleWith(const std::string &subsystem_type) const\n { return subsystem_types_.find(subsystem_type) != subsystem_types_.cend(); }\n};\n\n\nbool GetRSSFeedsID(DbConnection * vufind_connection, const std::string &feed_url, FeedInfo * const feed_info) {\n static std::unordered_map<std::string, FeedInfo> urls_to_feed_infos_map;\n const auto url_and_feed_info(urls_to_feed_infos_map.find(feed_url));\n if (url_and_feed_info != urls_to_feed_infos_map.end()) {\n *feed_info = url_and_feed_info->second;\n return true;\n }\n\n vufind_connection->queryOrDie(\"SELECT id,subsystem_types FROM tuefind_rss_feeds WHERE feed_url=\"\n + vufind_connection->escapeAndQuoteString(feed_url));\n auto result_set(vufind_connection->getLastResultSet());\n if (result_set.empty()) {\n static std::unordered_set<std::string> known_missing;\n if (known_missing.find(feed_url) == known_missing.end()) {\n LOG_WARNING(\"found no tuefind_rss_feeds.id for \\\"\" + feed_url + \"\\\"!\");\n known_missing.emplace(feed_url);\n }\n return false;\n }\n\n const auto row(result_set.getNextRow());\n std::vector<std::string> subsystem_types;\n StringUtil::Split(row[\"subsystem_types\"], ',', &subsystem_types);\n *feed_info = FeedInfo(row[\"id\"], StlHelpers::VectorToSet(subsystem_types));\n urls_to_feed_infos_map[feed_url] = *feed_info;\n return true;\n}\n\n\nvoid CopyItem(DbConnection * const db_writer, const std::string &feed_id, const std::string &item_id,\n const std::string &item_url, const std::string &item_title, const std::string &item_description,\n const std::string &pub_date, const std::string &insertion_time)\n{\n db_writer->queryOrDie(\"INSERT INTO tuefind_rss_items SET rss_feeds_id=\" + feed_id + \",item_id='\" + item_id\n + \"',item_url=\" + db_writer->escapeAndQuoteString(item_url) + \",item_title=\"\n + db_writer->escapeAndQuoteString(item_title) + \",item_description=\"\n + db_writer->escapeAndQuoteString(item_description) + \",pub_date='\"\n + pub_date + \"',insertion_time='\" + insertion_time + \"'\");\n}\n\n\n} \/\/ unnamed namespace\n\n\nint Main(int \/*argc*\/, char *\/*argv*\/[]) {\n auto db_reader((DbConnection()));\n\n if (not VuFind::GetTueFindFlavour().empty()) {\n auto db_writer(VuFind::GetDbConnection());\n db_reader.queryOrDie(\"SELECT * FROM rss_aggregator\");\n auto result_set(db_reader.getLastResultSet());\n DbTransaction transaction(db_writer.get());\n while (const auto row = result_set.getNextRow()) {\n FeedInfo feed_info;\n if (not GetRSSFeedsID(db_writer.get(), row[\"feed_url\"], &feed_info)) {\n transaction.rollback();\n LOG_WARNING(\"Undid partial conversion w\/ a ROLLBACK!\");\n return EXIT_FAILURE;\n }\n\n if (unlikely(not feed_info.isCompatibleWith(row[\"flavour\"])))\n LOG_ERROR(\"Item w\/ item_id \\\"\" + row[\"item_id\"] + \" has a flavour \\\"\" + row[\"flavour\"] +\n \"\\\" which is incompatible with the subsystem_types \\\"\"\n + StlHelpers::ContainerToString(feed_info.subsystem_types_.cbegin(),\n feed_info.subsystem_types_.cend(), \",\"));\n CopyItem(db_writer.get(), feed_info.id_, row[\"item_id\"], row[\"item_url\"], row[\"item_title\"],\n row[\"item_description\"], row[\"pub_date\"], row[\"insertion_time\"]);\n }\n transaction.commit();\n }\n db_reader.queryOrDie(\"DROP TABLE IF EXISTS ub_tools.rss_aggregator\");\n\n return EXIT_SUCCESS;\n}\n<|endoftext|>"} {"text":"<commit_before>\/* -*- c-basic-offset: 2 -*- *\/\n\/*\n Copyright(C) 2015-2017 Kouhei Sutou <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 as published by the Free Software Foundation; either\n version 2.1 of the License, or (at your option) any later version.\n\n This library is distributed in the hope that it will be useful,\n but WITHOUT ANY WARRANTY; without even the implied warranty of\n MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU\n Lesser General Public License for more details.\n\n You should have received 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 \"mrn_context_pool.hpp\"\n#include \"mrn_lock.hpp\"\n\n#include <time.h>\n\nnamespace mrn {\n \/\/ for debug\n#define MRN_CLASS_NAME \"mrn::ContextPool::Impl\"\n\n class ContextPool::Impl {\n public:\n Impl(mysql_mutex_t *mutex,\n long *n_pooling_contexts)\n : mutex_(mutex),\n n_pooling_contexts_(n_pooling_contexts),\n pool_(NULL),\n last_pull_time_(0) {\n }\n\n ~Impl(void) {\n clear();\n }\n\n grn_ctx *pull(void) {\n MRN_DBUG_ENTER_METHOD();\n grn_ctx *ctx = NULL;\n\n {\n time_t now;\n time(&now);\n\n mrn::Lock lock(mutex_);\n if (pool_) {\n ctx = static_cast<grn_ctx *>(pool_->data);\n list_pop(pool_);\n if ((now - last_pull_time_) >= CLEAR_THREATHOLD_IN_SECONDS) {\n clear_without_lock();\n }\n }\n last_pull_time_ = now;\n }\n\n if (!ctx) {\n mrn::Lock lock(mutex_);\n ctx = grn_ctx_open(0);\n ++(*n_pooling_contexts_);\n }\n\n DBUG_RETURN(ctx);\n }\n\n void release(grn_ctx *ctx) {\n MRN_DBUG_ENTER_METHOD();\n\n {\n mrn::Lock lock(mutex_);\n pool_ = list_cons(ctx, pool_);\n grn_ctx_use(ctx, NULL);\n }\n\n DBUG_VOID_RETURN;\n }\n\n void clear(void) {\n MRN_DBUG_ENTER_METHOD();\n\n {\n mrn::Lock lock(mutex_);\n clear_without_lock();\n }\n\n DBUG_VOID_RETURN;\n }\n\n private:\n static const unsigned int CLEAR_THREATHOLD_IN_SECONDS = 60 * 5;\n\n mysql_mutex_t *mutex_;\n long *n_pooling_contexts_;\n LIST *pool_;\n time_t last_pull_time_;\n\n void clear_without_lock(void) {\n MRN_DBUG_ENTER_METHOD();\n while (pool_) {\n grn_ctx *ctx = static_cast<grn_ctx *>(pool_->data);\n grn_ctx_close(ctx);\n list_pop(pool_);\n --(*n_pooling_contexts_);\n }\n DBUG_VOID_RETURN;\n }\n };\n\n\/\/ For debug\n#undef MRN_CLASS_NAME\n#define MRN_CLASS_NAME \"mrn::ContextPool\"\n\n ContextPool::ContextPool(mysql_mutex_t *mutex,\n long *n_pooling_contexts)\n : impl_(new Impl(mutex, n_pooling_contexts)) {\n }\n\n ContextPool::~ContextPool(void) {\n delete impl_;\n }\n\n grn_ctx *ContextPool::pull(void) {\n MRN_DBUG_ENTER_METHOD();\n grn_ctx *ctx = impl_->pull();\n DBUG_RETURN(ctx);\n }\n\n void ContextPool::release(grn_ctx *ctx) {\n MRN_DBUG_ENTER_METHOD();\n impl_->release(ctx);\n DBUG_VOID_RETURN;\n }\n\n void ContextPool::clear(void) {\n MRN_DBUG_ENTER_METHOD();\n impl_->clear();\n DBUG_VOID_RETURN;\n }\n}\n<commit_msg>mysql8.0: use std::vector instead of LIST<commit_after>\/* -*- c-basic-offset: 2 -*- *\/\n\/*\n Copyright(C) 2015-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 as published by the Free Software Foundation; either\n version 2.1 of the License, or (at your option) any later version.\n\n This library is distributed in the hope that it will be useful,\n but WITHOUT ANY WARRANTY; without even the implied warranty of\n MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU\n Lesser General Public License for more details.\n\n You should have received 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 \"mrn_context_pool.hpp\"\n#include \"mrn_lock.hpp\"\n\n#include <time.h>\n#include <vector>\n\nnamespace mrn {\n \/\/ for debug\n#define MRN_CLASS_NAME \"mrn::ContextPool::Impl\"\n\n class ContextPool::Impl {\n public:\n Impl(mysql_mutex_t *mutex,\n long *n_pooling_contexts)\n : mutex_(mutex),\n n_pooling_contexts_(n_pooling_contexts),\n pool_(),\n last_pull_time_(0) {\n }\n\n ~Impl(void) {\n clear();\n }\n\n grn_ctx *pull(void) {\n MRN_DBUG_ENTER_METHOD();\n grn_ctx *ctx = NULL;\n\n {\n time_t now;\n time(&now);\n\n mrn::Lock lock(mutex_);\n if (!pool_.empty()) {\n ctx = pool_[pool_.size() - 1];\n pool_.pop_back();\n if ((now - last_pull_time_) >= CLEAR_THREATHOLD_IN_SECONDS) {\n clear_without_lock();\n }\n }\n last_pull_time_ = now;\n }\n\n if (!ctx) {\n mrn::Lock lock(mutex_);\n ctx = grn_ctx_open(0);\n ++(*n_pooling_contexts_);\n }\n\n DBUG_RETURN(ctx);\n }\n\n void release(grn_ctx *ctx) {\n MRN_DBUG_ENTER_METHOD();\n\n {\n mrn::Lock lock(mutex_);\n pool_.push_back(ctx);\n grn_ctx_use(ctx, NULL);\n }\n\n DBUG_VOID_RETURN;\n }\n\n void clear(void) {\n MRN_DBUG_ENTER_METHOD();\n\n {\n mrn::Lock lock(mutex_);\n clear_without_lock();\n }\n\n DBUG_VOID_RETURN;\n }\n\n private:\n static const unsigned int CLEAR_THREATHOLD_IN_SECONDS = 60 * 5;\n\n mysql_mutex_t *mutex_;\n long *n_pooling_contexts_;\n std::vector<grn_ctx *> pool_;\n time_t last_pull_time_;\n\n void clear_without_lock(void) {\n MRN_DBUG_ENTER_METHOD();\n for (grn_ctx *ctx : pool_) {\n grn_ctx_close(ctx);\n --(*n_pooling_contexts_);\n }\n pool_.clear();\n DBUG_VOID_RETURN;\n }\n };\n\n\/\/ For debug\n#undef MRN_CLASS_NAME\n#define MRN_CLASS_NAME \"mrn::ContextPool\"\n\n ContextPool::ContextPool(mysql_mutex_t *mutex,\n long *n_pooling_contexts)\n : impl_(new Impl(mutex, n_pooling_contexts)) {\n }\n\n ContextPool::~ContextPool(void) {\n delete impl_;\n }\n\n grn_ctx *ContextPool::pull(void) {\n MRN_DBUG_ENTER_METHOD();\n grn_ctx *ctx = impl_->pull();\n DBUG_RETURN(ctx);\n }\n\n void ContextPool::release(grn_ctx *ctx) {\n MRN_DBUG_ENTER_METHOD();\n impl_->release(ctx);\n DBUG_VOID_RETURN;\n }\n\n void ContextPool::clear(void) {\n MRN_DBUG_ENTER_METHOD();\n impl_->clear();\n DBUG_VOID_RETURN;\n }\n}\n<|endoftext|>"} {"text":"<commit_before>\/*\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 *\/\n\n#include \"options.hpp\"\n\n#include <proton\/connection.hpp>\n#include <proton\/connection_options.hpp>\n#include <proton\/container.hpp>\n#include <proton\/message.hpp>\n#include <proton\/message_id.hpp>\n#include <proton\/messaging_handler.hpp>\n#include <proton\/tracker.hpp>\n#include <proton\/types.hpp>\n\n#include <iostream>\n#include <map>\n\n#include \"fake_cpp11.hpp\"\n\nclass simple_send : public proton::messaging_handler {\n private:\n std::string url;\n std::string user;\n std::string password;\n proton::sender sender;\n int sent;\n int confirmed;\n int total;\n\n public:\n simple_send(const std::string &s, const std::string &u, const std::string &p, int c) :\n url(s), user(u), password(p), sent(0), confirmed(0), total(c) {}\n\n void on_container_start(proton::container &c) OVERRIDE {\n proton::connection_options co;\n if (!user.empty()) co.user(user);\n if (!password.empty()) co.password(password);\n sender = c.open_sender(url, co);\n }\n\n void on_sendable(proton::sender &s) OVERRIDE {\n while (s.credit() && sent < total) {\n proton::message msg;\n std::map<std::string, int> m;\n m[\"sequence\"] = sent + 1;\n\n msg.id(sent + 1);\n msg.body(m);\n\n s.send(msg);\n sent++;\n }\n }\n\n void on_tracker_accept(proton::tracker &t) OVERRIDE {\n confirmed++;\n\n if (confirmed == total) {\n std::cout << \"all messages confirmed\" << std::endl;\n t.connection().close();\n }\n }\n\n void on_transport_close(proton::transport &) OVERRIDE {\n sent = confirmed;\n }\n};\n\nint main(int argc, char **argv) {\n std::string address(\"127.0.0.1:5672\/examples\");\n std::string user;\n std::string password;\n int message_count = 100;\n example::options opts(argc, argv);\n\n opts.add_value(address, 'a', \"address\", \"connect and send to URL\", \"URL\");\n opts.add_value(message_count, 'm', \"messages\", \"send COUNT messages\", \"COUNT\");\n opts.add_value(user, 'u', \"user\", \"authenticate as USER\", \"USER\");\n opts.add_value(password, 'p', \"password\", \"authenticate with PASSWORD\", \"PASSWORD\");\n\n try {\n opts.parse();\n\n simple_send send(address, user, password, message_count);\n proton::container(send).run();\n\n return 0;\n } catch (const example::bad_option& e) {\n std::cout << opts << std::endl << e.what() << std::endl;\n } catch (const std::exception& e) {\n std::cerr << e.what() << std::endl;\n }\n\n return 1;\n}\n<commit_msg>PROTON-1959: [cpp] Update simple_send example to re-send on reconnect<commit_after>\/*\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 *\/\n\n#include \"options.hpp\"\n\n#include <proton\/connection.hpp>\n#include <proton\/connection_options.hpp>\n#include <proton\/container.hpp>\n#include <proton\/message.hpp>\n#include <proton\/message_id.hpp>\n#include <proton\/messaging_handler.hpp>\n#include <proton\/tracker.hpp>\n#include <proton\/types.hpp>\n\n#include <iostream>\n#include <map>\n\n#include \"fake_cpp11.hpp\"\n\nclass simple_send : public proton::messaging_handler {\n private:\n std::string url;\n std::string user;\n std::string password;\n proton::sender sender;\n int sent;\n int confirmed;\n int total;\n\n public:\n simple_send(const std::string &s, const std::string &u, const std::string &p, int c) :\n url(s), user(u), password(p), sent(0), confirmed(0), total(c) {}\n\n void on_container_start(proton::container &c) OVERRIDE {\n proton::connection_options co;\n if (!user.empty()) co.user(user);\n if (!password.empty()) co.password(password);\n sender = c.open_sender(url, co);\n }\n\n void on_connection_open(proton::connection& c) OVERRIDE {\n if (c.reconnected()) {\n sent = confirmed; \/\/ Re-send unconfirmed messages after a reconnect\n }\n }\n\n void on_sendable(proton::sender &s) OVERRIDE {\n while (s.credit() && sent < total) {\n proton::message msg;\n std::map<std::string, int> m;\n m[\"sequence\"] = sent + 1;\n\n msg.id(sent + 1);\n msg.body(m);\n\n s.send(msg);\n sent++;\n }\n }\n\n void on_tracker_accept(proton::tracker &t) OVERRIDE {\n confirmed++;\n\n if (confirmed == total) {\n std::cout << \"all messages confirmed\" << std::endl;\n t.connection().close();\n }\n }\n\n void on_transport_close(proton::transport &) OVERRIDE {\n sent = confirmed;\n }\n};\n\nint main(int argc, char **argv) {\n std::string address(\"127.0.0.1:5672\/examples\");\n std::string user;\n std::string password;\n int message_count = 100;\n example::options opts(argc, argv);\n\n opts.add_value(address, 'a', \"address\", \"connect and send to URL\", \"URL\");\n opts.add_value(message_count, 'm', \"messages\", \"send COUNT messages\", \"COUNT\");\n opts.add_value(user, 'u', \"user\", \"authenticate as USER\", \"USER\");\n opts.add_value(password, 'p', \"password\", \"authenticate with PASSWORD\", \"PASSWORD\");\n\n try {\n opts.parse();\n\n simple_send send(address, user, password, message_count);\n proton::container(send).run();\n\n return 0;\n } catch (const example::bad_option& e) {\n std::cout << opts << std::endl << e.what() << std::endl;\n } catch (const std::exception& e) {\n std::cerr << e.what() << std::endl;\n }\n\n return 1;\n}\n<|endoftext|>"} {"text":"<commit_before>\/\/ Copyright 2014 Hazy Research (http:\/\/i.stanford.edu\/hazy)\n\/\/\n\/\/ Licensed under the Apache License, Version 2.0 (the \"License\");\n\/\/ you may not use this file except in compliance with the License.\n\/\/ You may obtain a copy of the License at\n\/\/\n\/\/ http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n\/\/\n\/\/ Unless required by applicable law or agreed to in writing, software\n\/\/ distributed under the License is distributed on an \"AS IS\" BASIS,\n\/\/ WITHOUT WARRANTIES OR CONDITIONS OF ANY 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 _CYC_SPARSE_SGD_H\n#define _CYC_SPARSE_SGD_H\n\n#include \"dimmwitted.h\"\n\n\/**\n * \\brief This file shows how to specify the same\n * synthetic model as in app\/cyc_dense_sgd.h\n * but store the data as sparse matrix instead\n * of dense matrix.\n *\n * See app\/cyc_dense_sgd.h for more detailed \n * comments.\n *\/\nclass CYCModelExample_Sparse{\npublic:\n double * const p;\n int n;\n \n CYCModelExample_Sparse(int _n):\n n(_n), p(new double[_n]){}\n\n CYCModelExample_Sparse( const CYCModelExample_Sparse& other ) :\n n(other.n), p(new double[other.n]){\n for(int i=0;i<n;i++){\n p[i] = other.p[i];\n }\n }\n\n};\n\nvoid f_lr_modelavg(CYCModelExample_Sparse** const p_models, int nreplicas, int ireplica){\n CYCModelExample_Sparse * p_model = p_models[ireplica];\n double sum = 0.0;\n for(int i=0;i<p_model->n;i++){\n sum = 0.0;\n for(int j=0;j<nreplicas;j++){\n sum += p_models[j]->p[i];\n }\n (p_model->p)[i] = sum\/nreplicas;\n }\n}\n\n\ndouble f_lr_loss_sparse(const SparseVector<double>* const ex, CYCModelExample_Sparse* const p_model){\n\n \/*\n double * model = p_model->p;\n double label = ex->p[ex->n-1];\n double dot = 0.0;\n for(int i=0;i<ex->n-1;i++){\n dot += ex->p[i] * model[ex->idxs[i]];\n }\n return - label * dot + log(exp(dot) + 1.0);\n *\/\n return 0.0;\n}\n\n\ndouble f_lr_grad_sparse(const SparseVector<double>* const ex, CYCModelExample_Sparse* const p_model){\n\n \/*\n double * model = p_model->p;\n double label = ex->p[ex->n-1];\n\n double dot = 0.0;\n for(int i=0;i<ex->n-1;i++){\n dot += ex->p[i] * model[ex->idxs[i]];\n }\n\n const double d = exp(-dot);\n const double Z = 0.0001 * (-label + 1.0\/(1.0+d));\n\n for(int i=0;i<ex->n-1;i++){\n model[ex->idxs[i]] -= ex->p[i] * Z;\n }\n *\/\n return 1.0;\n}\n\ntemplate<ModelReplType MODELREPL, DataReplType DATAREPL>\ndouble test_cyc_sparse_sgd(){\n\n\/\/ numa_run_on_node(numa_node);\n\/\/ numa_set_localalloc();\n\n int NNUMA_NODE = numa_max_node() + 1;\n\n \/\/ First, create a synthetic data set. \n \/\/ Given nexp examples and nfeat features,\n \/\/ this data set contains nexp rows, and\n \/\/ nfeat + 1 columns, where the last column\n \/\/ is the label that we want to train on.\n \/\/ \n long nexp = 100; \/\/ number of rows\n long nfeat = 10; \/\/ number of features\n long nbatches = 10; \/\/ number of batches\n long nepoch = 10;\n\n long nexp_per_batch = (int)ceil((double)nexp \/ (double)nbatches);\n long * batch_nexp = new long[nbatches];\n\n double ** examples_all = new double*[nbatches];\n long ** cols_all = new long*[nbatches];\n long ** rows_all = new long*[nbatches];\n\n std::vector<long> randperm;\n for (int i=0; i<nfeat; i++){\n randperm.push_back(i);\n }\n\n for (long ibatch = 0; ibatch < nbatches; ibatch++){\n \/\/ Randomly shuffle the features to be assigned to each core in this batch\n std::random_shuffle(randperm.begin(), randperm.end());\n\n \/\/ examples in this batch [batchBegIndex, batchEndIndex)\n long batchBegIndex = ibatch * nexp_per_batch;\n long batchEndIndex = batchBegIndex + nexp_per_batch;\n if (batchEndIndex >= nexp){\n batchEndIndex = nexp - 1;\n }\n batch_nexp[ibatch] = batchEndIndex - batchBegIndex;\n \/\/ Number of examples in the batch needs to be a multiple of number of NUMA nodes\n \/\/ We'll pad with noops to ensure this later\n double ndata_per_node_double = (double)(batch_nexp[ibatch]) \/ (double)NNUMA_NODE;\n long batchNumExamples = ceil(ndata_per_node_double) * NNUMA_NODE;\n double * examples = new double [batchNumExamples * (nfeat+1)]; \/\/ pointers to each row\n long * rows = new long[batchNumExamples];\n long * cols = new long[batchNumExamples * (nfeat+1)];\n examples_all[ibatch] = examples;\n rows_all[ibatch] = rows;\n cols_all[ibatch] = cols;\n\n long exampleIndex = 0;\n for(long inuma=0;inuma < NNUMA_NODE; inuma ++){\n numa_run_on_node(inuma);\n numa_set_localalloc();\n\n \/\/ double nodeBegIndex_double = (double) inuma * ndata_per_node_double;\n double nodeEndIndex_double = (double)(inuma+1) * ndata_per_node_double;\n\n long ct = 0;\n\n long nodeExampleIndex = 0;\n for (; (double)exampleIndex < nodeEndIndex_double; exampleIndex++){\n rows[exampleIndex] = ct;\n for(int j=0;j<nfeat;j++){\n examples[ct] = drand48();\n cols[ct] = j;\n ct++;\n }\n examples[ct] = drand48() > 0.8 ? 0 : 1.0; \/\/ randomly generate labels \n cols[ct] = nfeat;\n ct++;\n\n nodeExampleIndex ++;\n }\n for (; nodeExampleIndex < ceil(ndata_per_node_double); exampleIndex++){\n rows[exampleIndex] = ct;\n for(int j=0;j<nfeat;j++){\n examples[ct] = drand48();\n cols[ct] = j;\n ct++;\n }\n examples[ct] = -1; \/\/ indicate noop\n cols[ct] = nfeat;\n ct++;\n\n nodeExampleIndex++;\n }\n\n }\n }\n\n \/\/ Sanity check of examples assignments\n if (true){\n for (long ibatch = 0; ibatch < nbatches; ibatch++){\n for (long iexample = 0; iexample < batch_nexp[ibatch]; iexample++){\n std::cout << \"Batch \" << ibatch << \", example \" << iexample << std::endl << \"\\t\\t\";\n for (long ifeat = 0; ifeat < nfeat+1; ifeat++){\n std::cout << cols_all[ibatch][rows_all[ibatch][iexample] + ifeat] << \":\" << examples_all[ibatch][rows_all[ibatch][iexample] + ifeat] << \"\\t\";\n }\n std::cout << std::endl;\n }\n }\n }\n\n\n CYCModelExample_Sparse model(nfeat);\n for(int i=0;i<model.n;i++){\n model.p[i] = 0.0;\n }\n\n \/\/ Create DW engines\n SparseDimmWitted<double, CYCModelExample_Sparse, MODELREPL, DATAREPL, DW_ACCESS_ROW> ** dwEngines = new SparseDimmWitted<double, CYCModelExample_Sparse, MODELREPL, DATAREPL, DW_ACCESS_ROW>*[nbatches];\n unsigned int * f_handle_grads = new unsigned int[nbatches];\n unsigned int * f_handle_losss = new unsigned int[nbatches];\n\n for (long ibatch = 0; ibatch < nbatches; ibatch++){\n \/\/ Thrid, create a DenseDimmWitted object because the synthetic data set\n \/\/ we created is dense. This object has multiple templates,\n \/\/ - double: the type of the data (type of elements in ``examples'')\n \/\/ - CYCModelExample: the type of the model\n \/\/ - MODELREPL: Model replication strategy\n \/\/ - DATAREPL: Data replication strategy\n \/\/ - DW_ROW: Access method\n \/\/\n SparseDimmWitted<double, CYCModelExample_Sparse, MODELREPL, DATAREPL, DW_ACCESS_ROW> *\n dw = new SparseDimmWitted<double, CYCModelExample_Sparse, MODELREPL, DATAREPL, DW_ACCESS_ROW> (examples_all[ibatch], rows_all[ibatch], cols_all[ibatch], batch_nexp[ibatch], nfeat+1, batch_nexp[ibatch]*(nfeat+1), &model);\n unsigned int f_handle_grad = dw->register_row(f_lr_grad_sparse);\n unsigned int f_handle_loss = dw->register_row(f_lr_loss_sparse);\n dw->register_model_avg(f_handle_grad, f_lr_modelavg);\n dw->register_model_avg(f_handle_loss, f_lr_modelavg);\n dwEngines[ibatch] = dw;\n f_handle_grads[ibatch] = f_handle_grad;\n f_handle_losss[ibatch] = f_handle_loss;\n\n std::cout << f_handle_grads[ibatch] << std::endl;\n std::cout << f_handle_losss[ibatch] << std::endl;\n\n std::cout << \"~~~~~~~~~\" << std::endl;\n dw->exec(f_handle_loss);\n std::cout << \"~~~~~~~~~\" << std::endl;\n }\n\n\n double l2sum = 0.0;\n for (long iepoch = 0; iepoch < nepoch; iepoch++){\n \/\/ std::cout << \"Running epoch \" << iepoch << \"\\n\";\n double loss = 0.0;\n for (long ibatch = 0; ibatch < nbatches; ibatch++){\n std::cout << \"epoch \" << iepoch << \",\\tbatch \" << ibatch << \"\\n\";\n SparseDimmWitted<double, CYCModelExample_Sparse, MODELREPL, DATAREPL, DW_ACCESS_ROW> * dw = dwEngines[ibatch];\n \/\/ dw->exec(f_handle_grads[ibatch]);\n loss = dw->exec(f_handle_losss[ibatch]);\n std::cout << \"\\tloss = \" << loss << std::endl;\n for (long ifeat = 0; ifeat < nfeat; ifeat++){\n std::cout << model.p[ifeat] << \", \";\n }\n std::cout << std::endl;\n }\n loss \/= nexp;\n\n l2sum = 0.0;\n for (int i = 0; i<nfeat; i ++){\n l2sum += model.p[i] * model.p[i];\n }\n\n std::cout.precision(8);\n std::cout << l2sum << \" loss=\" << loss << std::endl;\n }\n\n\n \/\/ Return the sum of the model. This value should be \n \/\/ around 1.3-1.4 for this example.\n \/\/\n return l2sum;\n\n}\n\n\/**\n * \\brief This is one example of running SGD for logistic regression\n * in DimmWitted. You can find more examples in test\/cyc_dense.cc\n * and test\/cyc_sparse.cc, and the documented code in \n * app\/cyc_dense_sgd.h\n *\/\n\/\/int main(int argc, char** argv){\n\/\/ double rs = test_cyc_sparse_sgd<DW_MODELREPL_PERCORE, DW_DATAREPL_SHARDING>();\n\/\/ std::cout << \"SUM OF MODEL (Should be ~1.3-1.4): \" << rs << std::endl;\n\/\/ return 0;\n\/\/}\n\n#endif\n\n<commit_msg>Cyclades patch<commit_after><|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#pragma once\n\n#include \"hash_map_insert.hpp\"\n#include \"hashtable.hpp\"\n#include \"select.h\"\n\nnamespace vespalib {\n\ntemplate <typename K, typename V, typename H, typename EQ, typename M>\nhash_map<K, V, H, EQ, M>::hash_map(size_t reserveSize) :\n _ht(reserveSize)\n{ }\n\ntemplate <typename K, typename V, typename H, typename EQ, typename M>\nhash_map<K, V, H, EQ, M>::hash_map(size_t reserveSize, H hasher, EQ equality) :\n _ht(reserveSize, hasher, equality)\n{ }\n\ntemplate <typename K, typename V, typename H, typename EQ, typename M>\nhash_map<K, V, H, EQ, M>::hash_map(std::initializer_list<value_type> input)\n : _ht(0)\n{\n insert(input.begin(), input.end());\n}\n\ntemplate <typename K, typename V, typename H, typename EQ, typename M>\nhash_map<K, V, H, EQ, M>::~hash_map() noexcept = default;\n\ntemplate <typename K, typename V, typename H, typename EQ, typename M>\nvoid\nhash_map<K, V, H, EQ, M>::erase(const K & key) {\n return _ht.erase(key);\n}\n\ntemplate <typename K, typename V, typename H, typename EQ, typename M>\nvoid\nhash_map<K, V, H, EQ, M>::clear() {\n _ht.clear();\n}\n\ntemplate <typename K, typename V, typename H, typename EQ, typename M>\nvoid\nhash_map<K, V, H, EQ, M>::resize(size_t newSize) {\n _ht.resize(newSize);\n}\n\ntemplate <typename K, typename V, typename H, typename EQ, typename M>\nvoid\nhash_map<K, V, H, EQ, M>::swap(hash_map & rhs) {\n _ht.swap(rhs._ht);\n}\n\ntemplate <typename K, typename V, typename H, typename EQ, typename M>\nsize_t\nhash_map<K, V, H, EQ, M>::getMemoryConsumption() const {\n return _ht.getMemoryConsumption();\n}\n\ntemplate <typename K, typename V, typename H, typename EQ, typename M>\nsize_t\nhash_map<K, V, H, EQ, M>::getMemoryUsed() const\n{\n return _ht.getMemoryUsed();\n}\n\n}\n\n\n#define VESPALIB_HASH_MAP_INSTANTIATE_H_E_M(K, V, H, E, M) \\\n template class vespalib::hash_map<K, V, H, E, M>; \\\n template class vespalib::hashtable<K, std::pair<K,V>, H, E, vespalib::Select1st<std::pair<K,V>>, M>; \\\n template vespalib::hashtable<K, std::pair<K,V>, H, E, vespalib::Select1st<std::pair<K,V>>, M>::insert_result \\\n vespalib::hashtable<K, std::pair<K,V>, H, E, vespalib::Select1st<std::pair<K,V>>, M>::insert(std::pair<K,V> &&); \\\n template vespalib::hashtable<K, std::pair<K,V>, H, E, vespalib::Select1st<std::pair<K,V>>, M>::insert_result \\\n vespalib::hashtable<K, std::pair<K,V>, H, E, vespalib::Select1st<std::pair<K,V>>, M>::insertInternal(std::pair<K,V> &&); \\\n\n#define VESPALIB_HASH_MAP_INSTANTIATE_H_E(K, V, H, E) \\\n template class vespalib::Array<vespalib::hash_node<std::pair<K,V>>>; \\\n VESPALIB_HASH_MAP_INSTANTIATE_H_E_M(K, V, H, E, vespalib::hashtable_base::prime_modulator) \\\n VESPALIB_HASH_MAP_INSTANTIATE_H_E_M(K, V, H, E, vespalib::hashtable_base::and_modulator)\n\n#define VESPALIB_HASH_MAP_INSTANTIATE_H(K, V, H) VESPALIB_HASH_MAP_INSTANTIATE_H_E(K, V, H, std::equal_to<>)\n\n#define VESPALIB_HASH_MAP_INSTANTIATE(K, V) VESPALIB_HASH_MAP_INSTANTIATE_H(K, V, vespalib::hash<K>)\n\n<commit_msg>Remove continuation token on last line in macro.<commit_after>\/\/ Copyright 2017 Yahoo Holdings. Licensed under the terms of the Apache 2.0 license. See LICENSE in the project root.\n#pragma once\n\n#include \"hash_map_insert.hpp\"\n#include \"hashtable.hpp\"\n#include \"select.h\"\n\nnamespace vespalib {\n\ntemplate <typename K, typename V, typename H, typename EQ, typename M>\nhash_map<K, V, H, EQ, M>::hash_map(size_t reserveSize) :\n _ht(reserveSize)\n{ }\n\ntemplate <typename K, typename V, typename H, typename EQ, typename M>\nhash_map<K, V, H, EQ, M>::hash_map(size_t reserveSize, H hasher, EQ equality) :\n _ht(reserveSize, hasher, equality)\n{ }\n\ntemplate <typename K, typename V, typename H, typename EQ, typename M>\nhash_map<K, V, H, EQ, M>::hash_map(std::initializer_list<value_type> input)\n : _ht(0)\n{\n insert(input.begin(), input.end());\n}\n\ntemplate <typename K, typename V, typename H, typename EQ, typename M>\nhash_map<K, V, H, EQ, M>::~hash_map() noexcept = default;\n\ntemplate <typename K, typename V, typename H, typename EQ, typename M>\nvoid\nhash_map<K, V, H, EQ, M>::erase(const K & key) {\n return _ht.erase(key);\n}\n\ntemplate <typename K, typename V, typename H, typename EQ, typename M>\nvoid\nhash_map<K, V, H, EQ, M>::clear() {\n _ht.clear();\n}\n\ntemplate <typename K, typename V, typename H, typename EQ, typename M>\nvoid\nhash_map<K, V, H, EQ, M>::resize(size_t newSize) {\n _ht.resize(newSize);\n}\n\ntemplate <typename K, typename V, typename H, typename EQ, typename M>\nvoid\nhash_map<K, V, H, EQ, M>::swap(hash_map & rhs) {\n _ht.swap(rhs._ht);\n}\n\ntemplate <typename K, typename V, typename H, typename EQ, typename M>\nsize_t\nhash_map<K, V, H, EQ, M>::getMemoryConsumption() const {\n return _ht.getMemoryConsumption();\n}\n\ntemplate <typename K, typename V, typename H, typename EQ, typename M>\nsize_t\nhash_map<K, V, H, EQ, M>::getMemoryUsed() const\n{\n return _ht.getMemoryUsed();\n}\n\n}\n\n\n#define VESPALIB_HASH_MAP_INSTANTIATE_H_E_M(K, V, H, E, M) \\\n template class vespalib::hash_map<K, V, H, E, M>; \\\n template class vespalib::hashtable<K, std::pair<K,V>, H, E, vespalib::Select1st<std::pair<K,V>>, M>; \\\n template vespalib::hashtable<K, std::pair<K,V>, H, E, vespalib::Select1st<std::pair<K,V>>, M>::insert_result \\\n vespalib::hashtable<K, std::pair<K,V>, H, E, vespalib::Select1st<std::pair<K,V>>, M>::insert(std::pair<K,V> &&); \\\n template vespalib::hashtable<K, std::pair<K,V>, H, E, vespalib::Select1st<std::pair<K,V>>, M>::insert_result \\\n vespalib::hashtable<K, std::pair<K,V>, H, E, vespalib::Select1st<std::pair<K,V>>, M>::insertInternal(std::pair<K,V> &&);\n\n#define VESPALIB_HASH_MAP_INSTANTIATE_H_E(K, V, H, E) \\\n template class vespalib::Array<vespalib::hash_node<std::pair<K,V>>>; \\\n VESPALIB_HASH_MAP_INSTANTIATE_H_E_M(K, V, H, E, vespalib::hashtable_base::prime_modulator) \\\n VESPALIB_HASH_MAP_INSTANTIATE_H_E_M(K, V, H, E, vespalib::hashtable_base::and_modulator)\n\n#define VESPALIB_HASH_MAP_INSTANTIATE_H(K, V, H) VESPALIB_HASH_MAP_INSTANTIATE_H_E(K, V, H, std::equal_to<>)\n\n#define VESPALIB_HASH_MAP_INSTANTIATE(K, V) VESPALIB_HASH_MAP_INSTANTIATE_H(K, V, vespalib::hash<K>)\n\n<|endoftext|>"} {"text":"<commit_before>\n# include \"PDForces_Dipole.hpp\"\n\n\n\n\/\/ -------------------------------------------------------------------------\n\/\/ Constructor...\n\/\/ -------------------------------------------------------------------------\n\nDipole::Dipole(const GetPot& p, vector<double>& rin, vector<double>& vin,\n vector<double>& fin, vector<double>& radin) :\n r(rin), v(vin), f(fin), rad(radin)\n{\n rcut = p(\"PDApp\/inter_particle_forces\/rcut\",4.0);\n rcut2 = rcut*rcut;\n eps = p(\"PDApp\/inter_particle_forces\/eps\",1.0);\n n = p(\"PDApp\/inter_particle_forces\/n\",-13.0);\n Ex = p(\"PDApp\/inter_particle_forces\/Ex\",0.0);\n Ey = p(\"PDApp\/inter_particle_forces\/Ey\",0.0);\n Ez = p(\"PDApp\/inter_particle_forces\/Ez\",1.0);\n box[0] = p(\"Domain\/nx\",5);\n box[1] = p(\"Domain\/ny\",5);\n box[2] = p(\"Domain\/nz\",5);\n box[0] *= p(\"Domain\/dx\",1.0);\n box[1] *= p(\"Domain\/dy\",1.0);\n box[2] *= p(\"Domain\/dz\",1.0);\n Emag = sqrt(Ex*Ex + Ey*Ey + Ez*Ez);\n edir[0] = Ex\/Emag;\n edir[1] = Ey\/Emag;\n edir[2] = Ez\/Emag;\n}\n\n\n\n\/\/ -------------------------------------------------------------------------\n\/\/ Destructor...\n\/\/ -------------------------------------------------------------------------\n\nDipole::~Dipole()\n{\n}\n\n\n\n\/\/ -------------------------------------------------------------------------\n\/\/ Function to calculate fij:\n\/\/ -------------------------------------------------------------------------\n\nvoid Dipole::fijFunc(int i, int j)\n{\n \/\/compute the squared particle distance:\n rij2 = 0.0;\n for (int k=0; k<3; k++) \n {\n rij[k] = r[i*3+k] - r[j*3+k];\n rij[k] -= round(rij[k]\/box[k])*box[k]; \/\/ <-- pbc's\n rij2 += rij[k]*rij[k];\n }\n \/\/ if inside the cutoff radius then calculate ij pair interaction\n if (rij2 <= rcut2)\n {\n rijMag = sqrt(rij2);\n\n \/\/ add soft repulsive force\n radComp = 0.0;\n avgRad = (rad[i] + rad[j])\/2.0;\n radComp = (n-1.0)*eps*pow(2.0*avgRad\/rijMag),n);\n\n if (abs(Ex)>0 || abs(Ey)>0 || abs(Ez)>0)\n {\n \/\/ add dipole-dipole interaction\n thetaComp = 0.0;\n EdotRij = rij[0]*Ex+rij[1]*Ey+rij[2]*Ez;\n theta = acos(EdotRij\/(rijMag*Emag));\n ScaleFactor = pow(avgRad,6.0)*pow(Emag,2.0)\/pow(rijMag,4.0);\n radComp -= ScaleFactor*(3*pow(cos(theta),2.0)-1.0);\n thetaComp = -ScaleFactor*sin(2.0*theta);\n\n \/\/ calculate theta hat direction\n cross(edir,rij,normal);\n cross(normal,rij,thetaHat);\n thetaMag = sqrt(pow(thetaHat[0],2.0)+pow(thetaHat[1],2.0)+pow(thetaHat[2],2.0));\n for (int k=0;k<3;k++) {\n if (thetaMag > 0.00001)\n {\n thetaHat[k]*=1\/thetaMag;\n }\n else\n {\n thetaHat[k]*=0.0;\n }\n }\n\n \/\/ put all force components together\n for (int k=0;k<3;k++) \n {\n f[3*i+k] += radComp*rij[k]\/rijMag + thetaComp*thetaHat[k];\n f[3*j+k] -= radComp*rij[k]\/rijMag + thetaComp*thetaHat[k];\n }\n }\n else\n {\n for (int k=0;k<3;k++) \n {\n f[3*i+k] += radComp*rij[k]\/rijMag;\n f[3*j+k] -= radComp*rij[k]\/rijMag;\n }\n }\n }\n}\n\n\nvoid Dipole::cross(double (&a)[3], double(&b)[3],double (&crs)[3])\n{\n crs[0] = a[1]*b[2]-b[1]*a[2];\n crs[1] = a[2]*b[0]-b[2]*a[0];\n crs[2] = a[0]*b[1]-b[0]*a[1];\n}\n<commit_msg>fix dipole force syntax error.<commit_after>\n# include \"PDForces_Dipole.hpp\"\n\n\n\n\/\/ -------------------------------------------------------------------------\n\/\/ Constructor...\n\/\/ -------------------------------------------------------------------------\n\nDipole::Dipole(const GetPot& p, vector<double>& rin, vector<double>& vin,\n vector<double>& fin, vector<double>& radin) :\n r(rin), v(vin), f(fin), rad(radin)\n{\n rcut = p(\"PDApp\/inter_particle_forces\/rcut\",4.0);\n rcut2 = rcut*rcut;\n eps = p(\"PDApp\/inter_particle_forces\/eps\",1.0);\n n = p(\"PDApp\/inter_particle_forces\/n\",-13.0);\n Ex = p(\"PDApp\/inter_particle_forces\/Ex\",0.0);\n Ey = p(\"PDApp\/inter_particle_forces\/Ey\",0.0);\n Ez = p(\"PDApp\/inter_particle_forces\/Ez\",1.0);\n box[0] = p(\"Domain\/nx\",5);\n box[1] = p(\"Domain\/ny\",5);\n box[2] = p(\"Domain\/nz\",5);\n box[0] *= p(\"Domain\/dx\",1.0);\n box[1] *= p(\"Domain\/dy\",1.0);\n box[2] *= p(\"Domain\/dz\",1.0);\n Emag = sqrt(Ex*Ex + Ey*Ey + Ez*Ez);\n edir[0] = Ex\/Emag;\n edir[1] = Ey\/Emag;\n edir[2] = Ez\/Emag;\n}\n\n\n\n\/\/ -------------------------------------------------------------------------\n\/\/ Destructor...\n\/\/ -------------------------------------------------------------------------\n\nDipole::~Dipole()\n{\n}\n\n\n\n\/\/ -------------------------------------------------------------------------\n\/\/ Function to calculate fij:\n\/\/ -------------------------------------------------------------------------\n\nvoid Dipole::fijFunc(int i, int j)\n{\n \/\/compute the squared particle distance:\n rij2 = 0.0;\n for (int k=0; k<3; k++) \n {\n rij[k] = r[i*3+k] - r[j*3+k];\n rij[k] -= round(rij[k]\/box[k])*box[k]; \/\/ <-- pbc's\n rij2 += rij[k]*rij[k];\n }\n \/\/ if inside the cutoff radius then calculate ij pair interaction\n if (rij2 <= rcut2)\n {\n rijMag = sqrt(rij2);\n\n \/\/ add soft repulsive force\n radComp = 0.0;\n avgRad = (rad[i] + rad[j])\/2.0;\n radComp = (n-1.0)*eps*pow(2.0*avgRad\/rijMag,n);\n\n if (abs(Ex)>0 || abs(Ey)>0 || abs(Ez)>0)\n {\n \/\/ add dipole-dipole interaction\n thetaComp = 0.0;\n EdotRij = rij[0]*Ex+rij[1]*Ey+rij[2]*Ez;\n theta = acos(EdotRij\/(rijMag*Emag));\n ScaleFactor = pow(avgRad,6.0)*pow(Emag,2.0)\/pow(rijMag,4.0);\n radComp -= ScaleFactor*(3*pow(cos(theta),2.0)-1.0);\n thetaComp = -ScaleFactor*sin(2.0*theta);\n\n \/\/ calculate theta hat direction\n cross(edir,rij,normal);\n cross(normal,rij,thetaHat);\n thetaMag = sqrt(pow(thetaHat[0],2.0)+pow(thetaHat[1],2.0)+pow(thetaHat[2],2.0));\n for (int k=0;k<3;k++) {\n if (thetaMag > 0.00001)\n {\n thetaHat[k]*=1\/thetaMag;\n }\n else\n {\n thetaHat[k]*=0.0;\n }\n }\n\n \/\/ put all force components together\n for (int k=0;k<3;k++) \n {\n f[3*i+k] += radComp*rij[k]\/rijMag + thetaComp*thetaHat[k];\n f[3*j+k] -= radComp*rij[k]\/rijMag + thetaComp*thetaHat[k];\n }\n }\n else\n {\n for (int k=0;k<3;k++) \n {\n f[3*i+k] += radComp*rij[k]\/rijMag;\n f[3*j+k] -= radComp*rij[k]\/rijMag;\n }\n }\n }\n}\n\n\nvoid Dipole::cross(double (&a)[3], double(&b)[3],double (&crs)[3])\n{\n crs[0] = a[1]*b[2]-b[1]*a[2];\n crs[1] = a[2]*b[0]-b[2]*a[0];\n crs[2] = a[0]*b[1]-b[0]*a[1];\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 \"cmakevalidator.h\"\n\n#include <QProcess>\n#include <QFileInfo>\n#include <QTextDocument>\n\nusing namespace CMakeProjectManager::Internal;\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ CMakeValidator\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nCMakeValidator::CMakeValidator()\n : m_state(Invalid), m_process(0), m_hasCodeBlocksMsvcGenerator(false), m_hasCodeBlocksNinjaGenerator(false)\n{\n\n}\n\nCMakeValidator::~CMakeValidator()\n{\n cancel();\n}\n\nvoid CMakeValidator::cancel()\n{\n if (m_process) {\n disconnect(m_process, SIGNAL(finished(int)));\n m_process->waitForFinished();\n delete m_process;\n m_process = 0;\n }\n}\n\nvoid CMakeValidator::setCMakeExecutable(const QString &executable)\n{\n cancel();\n m_process = new QProcess();\n connect(m_process, SIGNAL(finished(int)),\n this, SLOT(finished(int)));\n\n m_executable = executable;\n QFileInfo fi(m_executable);\n if (fi.exists() && fi.isExecutable()) {\n \/\/ Run it to find out more\n m_state = CMakeValidator::RunningBasic;\n if (!startProcess(QStringList(QLatin1String(\"--help\"))))\n m_state = CMakeValidator::Invalid;\n } else {\n m_state = CMakeValidator::Invalid;\n }\n}\n\nvoid CMakeValidator::finished(int exitCode)\n{\n if (exitCode) {\n m_state = CMakeValidator::Invalid;\n return;\n }\n if (m_state == CMakeValidator::RunningBasic) {\n QByteArray response = m_process->readAll();\n QRegExp versionRegexp(QLatin1String(\"^cmake version ([\\\\d\\\\.]*)\"));\n versionRegexp.indexIn(QString::fromLocal8Bit(response));\n\n m_hasCodeBlocksMsvcGenerator = response.contains(\"CodeBlocks - NMake Makefiles\");\n m_hasCodeBlocksNinjaGenerator = response.contains(\"CodeBlocks - Ninja\");\n m_version = versionRegexp.cap(1);\n if (versionRegexp.capturedTexts().size() > 3)\n m_version += QLatin1Char('.') + versionRegexp.cap(3);\n\n if (m_version.isEmpty()) {\n m_state = CMakeValidator::Invalid;\n } else {\n m_state = CMakeValidator::RunningFunctionList;\n if (!startProcess(QStringList(QLatin1String(\"--help-command-list\"))))\n finished(0); \/\/ should never happen, just continue\n }\n } else if (m_state == CMakeValidator::RunningFunctionList) {\n parseFunctionOutput(m_process->readAll());\n m_state = CMakeValidator::RunningFunctionDetails;\n if (!startProcess(QStringList(QLatin1String(\"--help-commands\"))))\n finished(0); \/\/ should never happen, just continue\n } else if (m_state == CMakeValidator::RunningFunctionDetails) {\n parseFunctionDetailsOutput(m_process->readAll());\n m_state = CMakeValidator::RunningPropertyList;\n if (!startProcess(QStringList(QLatin1String(\"--help-property-list\"))))\n finished(0); \/\/ should never happen, just continue\n } else if (m_state == CMakeValidator::RunningPropertyList) {\n parseVariableOutput(m_process->readAll());\n m_state = CMakeValidator::RunningVariableList;\n if (!startProcess(QStringList(QLatin1String(\"--help-variable-list\"))))\n finished(0); \/\/ should never happen, just continue\n } else if (m_state == CMakeValidator::RunningVariableList) {\n parseVariableOutput(m_process->readAll());\n parseDone();\n m_state = CMakeValidator::RunningDone;\n }\n}\n\nbool CMakeValidator::isValid() const\n{\n if (m_state == CMakeValidator::Invalid)\n return false;\n if (m_state == CMakeValidator::RunningBasic)\n m_process->waitForFinished();\n return (m_state != CMakeValidator::Invalid);\n}\n\nbool CMakeValidator::startProcess(const QStringList &args)\n{\n m_process->start(m_executable, args);\n return m_process->waitForStarted(2000);\n}\n\nQString CMakeValidator::cmakeExecutable() const\n{\n return m_executable;\n}\n\nbool CMakeValidator::hasCodeBlocksMsvcGenerator() const\n{\n if (!isValid())\n return false;\n return m_hasCodeBlocksMsvcGenerator;\n}\n\nbool CMakeValidator::hasCodeBlocksNinjaGenerator() const\n{\n if (!isValid())\n return false;\n return m_hasCodeBlocksNinjaGenerator;\n}\n\nTextEditor::Keywords CMakeValidator::keywords()\n{\n while (m_state != RunningDone && m_state != CMakeValidator::Invalid) {\n m_process->waitForFinished();\n }\n\n if (m_state == CMakeValidator::Invalid)\n return TextEditor::Keywords(QStringList(), QStringList(), QMap<QString, QStringList>());\n\n return TextEditor::Keywords(m_variables, m_functions, m_functionArgs);\n}\n\nstatic void extractKeywords(const QByteArray &input, QStringList *destination)\n{\n if (!destination)\n return;\n\n QString keyword;\n int ignoreZone = 0;\n for (int i = 0; i < input.count(); ++i) {\n const QChar chr = QLatin1Char(input.at(i));\n if (chr == QLatin1Char('{'))\n ++ignoreZone;\n if (chr == QLatin1Char('}'))\n --ignoreZone;\n if (ignoreZone == 0) {\n if ((chr.isLetterOrNumber() && chr.isUpper())\n || chr == QLatin1Char('_')) {\n keyword += chr;\n } else {\n if (!keyword.isEmpty()) {\n if (keyword.size() > 1)\n *destination << keyword;\n keyword.clear();\n }\n }\n }\n }\n if (keyword.size() > 1)\n *destination << keyword;\n}\n\nvoid CMakeValidator::parseFunctionOutput(const QByteArray &output)\n{\n QList<QByteArray> cmakeFunctionsList = output.split('\\n');\n m_functions.clear();\n if (!cmakeFunctionsList.isEmpty()) {\n cmakeFunctionsList.removeFirst(); \/\/remove version string\n foreach (const QByteArray &function, cmakeFunctionsList)\n m_functions << QString::fromLocal8Bit(function.trimmed());\n }\n}\n\nQString CMakeValidator::formatFunctionDetails(const QString &command, const QString &args)\n{\n return QString::fromLatin1(\"<table><tr><td><b>%1<\/b><\/td><td>%2<\/td><\/tr>\")\n .arg(Qt::escape(command)).arg(Qt::escape(args));\n}\n\nvoid CMakeValidator::parseFunctionDetailsOutput(const QByteArray &output)\n{\n QStringList cmakeFunctionsList = m_functions;\n QList<QByteArray> cmakeCommandsHelp = output.split('\\n');\n for (int i = 0; i < cmakeCommandsHelp.count(); ++i) {\n QByteArray lineTrimmed = cmakeCommandsHelp.at(i).trimmed();\n if (cmakeFunctionsList.first().toLatin1() == lineTrimmed) {\n QStringList commandSyntaxes;\n QString currentCommandSyntax;\n QString currentCommand = cmakeFunctionsList.takeFirst();\n ++i;\n for (; i < cmakeCommandsHelp.count(); ++i) {\n lineTrimmed = cmakeCommandsHelp.at(i).trimmed();\n\n if (cmakeFunctionsList.first().toLatin1() == lineTrimmed) {\n \/\/start of next function in output\n if (!currentCommandSyntax.isEmpty())\n commandSyntaxes << currentCommandSyntax.append(QLatin1String(\"<\/table>\"));\n --i;\n break;\n }\n if (lineTrimmed.startsWith(currentCommand.toLatin1() + \"(\")) {\n if (!currentCommandSyntax.isEmpty())\n commandSyntaxes << currentCommandSyntax.append(QLatin1String(\"<\/table>\"));\n\n QByteArray argLine = lineTrimmed.mid(currentCommand.length());\n extractKeywords(argLine, &m_variables);\n currentCommandSyntax = formatFunctionDetails(currentCommand, QString::fromUtf8(argLine));\n } else {\n if (!currentCommandSyntax.isEmpty()) {\n if (lineTrimmed.isEmpty()) {\n commandSyntaxes << currentCommandSyntax.append(QLatin1String(\"<\/table>\"));\n currentCommandSyntax.clear();\n } else {\n extractKeywords(lineTrimmed, &m_variables);\n currentCommandSyntax += QString::fromLatin1(\"<tr><td> <\/td><td>%1<\/td><\/tr>\")\n .arg(Qt::escape(QString::fromLocal8Bit(lineTrimmed)));\n }\n }\n }\n }\n m_functionArgs[currentCommand] = commandSyntaxes;\n }\n }\n m_functions = m_functionArgs.keys();\n}\n\nvoid CMakeValidator::parseVariableOutput(const QByteArray &output)\n{\n QList<QByteArray> variableList = output.split('\\n');\n if (!variableList.isEmpty()) {\n variableList.removeFirst(); \/\/remove version string\n foreach (const QByteArray &variable, variableList) {\n if (variable.contains(\"_<CONFIG>\")) {\n m_variables << QString::fromLocal8Bit(variable).replace(QLatin1String(\"_<CONFIG>\"), QLatin1String(\"_DEBUG\"));\n m_variables << QString::fromLocal8Bit(variable).replace(QLatin1String(\"_<CONFIG>\"), QLatin1String(\"_RELEASE\"));\n m_variables << QString::fromLocal8Bit(variable).replace(QLatin1String(\"_<CONFIG>\"), QLatin1String(\"_MINSIZEREL\"));\n m_variables << QString::fromLocal8Bit(variable).replace(QLatin1String(\"_<CONFIG>\"), QLatin1String(\"_RELWITHDEBINFO\"));\n } else if (variable.contains(\"_<LANG>\")) {\n m_variables << QString::fromLocal8Bit(variable).replace(QLatin1String(\"_<LANG>\"), QLatin1String(\"_C\"));\n m_variables << QString::fromLocal8Bit(variable).replace(QLatin1String(\"_<LANG>\"), QLatin1String(\"_CXX\"));\n } else if (!variable.contains(\"_<\") && !variable.contains('[')) {\n m_variables << QString::fromLocal8Bit(variable);\n }\n }\n }\n}\n\nvoid CMakeValidator::parseDone()\n{\n m_variables.sort();\n m_variables.removeDuplicates();\n}\n<commit_msg>CMakeValidator: Make code more robust<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 \"cmakevalidator.h\"\n\n#include <QProcess>\n#include <QFileInfo>\n#include <QTextDocument>\n\nusing namespace CMakeProjectManager::Internal;\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ CMakeValidator\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nCMakeValidator::CMakeValidator()\n : m_state(Invalid), m_process(0), m_hasCodeBlocksMsvcGenerator(false), m_hasCodeBlocksNinjaGenerator(false)\n{\n\n}\n\nCMakeValidator::~CMakeValidator()\n{\n cancel();\n}\n\nvoid CMakeValidator::cancel()\n{\n if (m_process) {\n disconnect(m_process, SIGNAL(finished(int)));\n m_process->waitForFinished();\n delete m_process;\n m_process = 0;\n }\n}\n\nvoid CMakeValidator::setCMakeExecutable(const QString &executable)\n{\n cancel();\n m_process = new QProcess();\n connect(m_process, SIGNAL(finished(int)),\n this, SLOT(finished(int)));\n\n m_executable = executable;\n QFileInfo fi(m_executable);\n if (fi.exists() && fi.isExecutable()) {\n \/\/ Run it to find out more\n m_state = CMakeValidator::RunningBasic;\n if (!startProcess(QStringList(QLatin1String(\"--help\"))))\n m_state = CMakeValidator::Invalid;\n } else {\n m_state = CMakeValidator::Invalid;\n }\n}\n\nvoid CMakeValidator::finished(int exitCode)\n{\n if (exitCode) {\n m_state = CMakeValidator::Invalid;\n return;\n }\n if (m_state == CMakeValidator::RunningBasic) {\n QByteArray response = m_process->readAll();\n QRegExp versionRegexp(QLatin1String(\"^cmake version ([\\\\d\\\\.]*)\"));\n versionRegexp.indexIn(QString::fromLocal8Bit(response));\n\n m_hasCodeBlocksMsvcGenerator = response.contains(\"CodeBlocks - NMake Makefiles\");\n m_hasCodeBlocksNinjaGenerator = response.contains(\"CodeBlocks - Ninja\");\n m_version = versionRegexp.cap(1);\n if (versionRegexp.capturedTexts().size() > 3)\n m_version += QLatin1Char('.') + versionRegexp.cap(3);\n\n if (m_version.isEmpty()) {\n m_state = CMakeValidator::Invalid;\n } else {\n m_state = CMakeValidator::RunningFunctionList;\n if (!startProcess(QStringList(QLatin1String(\"--help-command-list\"))))\n finished(0); \/\/ should never happen, just continue\n }\n } else if (m_state == CMakeValidator::RunningFunctionList) {\n parseFunctionOutput(m_process->readAll());\n m_state = CMakeValidator::RunningFunctionDetails;\n if (!startProcess(QStringList(QLatin1String(\"--help-commands\"))))\n finished(0); \/\/ should never happen, just continue\n } else if (m_state == CMakeValidator::RunningFunctionDetails) {\n parseFunctionDetailsOutput(m_process->readAll());\n m_state = CMakeValidator::RunningPropertyList;\n if (!startProcess(QStringList(QLatin1String(\"--help-property-list\"))))\n finished(0); \/\/ should never happen, just continue\n } else if (m_state == CMakeValidator::RunningPropertyList) {\n parseVariableOutput(m_process->readAll());\n m_state = CMakeValidator::RunningVariableList;\n if (!startProcess(QStringList(QLatin1String(\"--help-variable-list\"))))\n finished(0); \/\/ should never happen, just continue\n } else if (m_state == CMakeValidator::RunningVariableList) {\n parseVariableOutput(m_process->readAll());\n parseDone();\n m_state = CMakeValidator::RunningDone;\n }\n}\n\nbool CMakeValidator::isValid() const\n{\n if (m_state == CMakeValidator::Invalid)\n return false;\n if (m_state == CMakeValidator::RunningBasic)\n m_process->waitForFinished();\n return (m_state != CMakeValidator::Invalid);\n}\n\nbool CMakeValidator::startProcess(const QStringList &args)\n{\n m_process->start(m_executable, args);\n return m_process->waitForStarted(2000);\n}\n\nQString CMakeValidator::cmakeExecutable() const\n{\n return m_executable;\n}\n\nbool CMakeValidator::hasCodeBlocksMsvcGenerator() const\n{\n if (!isValid())\n return false;\n return m_hasCodeBlocksMsvcGenerator;\n}\n\nbool CMakeValidator::hasCodeBlocksNinjaGenerator() const\n{\n if (!isValid())\n return false;\n return m_hasCodeBlocksNinjaGenerator;\n}\n\nTextEditor::Keywords CMakeValidator::keywords()\n{\n while (m_state != RunningDone && m_state != CMakeValidator::Invalid) {\n m_process->waitForFinished();\n }\n\n if (m_state == CMakeValidator::Invalid)\n return TextEditor::Keywords(QStringList(), QStringList(), QMap<QString, QStringList>());\n\n return TextEditor::Keywords(m_variables, m_functions, m_functionArgs);\n}\n\nstatic void extractKeywords(const QByteArray &input, QStringList *destination)\n{\n if (!destination)\n return;\n\n QString keyword;\n int ignoreZone = 0;\n for (int i = 0; i < input.count(); ++i) {\n const QChar chr = QLatin1Char(input.at(i));\n if (chr == QLatin1Char('{'))\n ++ignoreZone;\n if (chr == QLatin1Char('}'))\n --ignoreZone;\n if (ignoreZone == 0) {\n if ((chr.isLetterOrNumber() && chr.isUpper())\n || chr == QLatin1Char('_')) {\n keyword += chr;\n } else {\n if (!keyword.isEmpty()) {\n if (keyword.size() > 1)\n *destination << keyword;\n keyword.clear();\n }\n }\n }\n }\n if (keyword.size() > 1)\n *destination << keyword;\n}\n\nvoid CMakeValidator::parseFunctionOutput(const QByteArray &output)\n{\n QList<QByteArray> cmakeFunctionsList = output.split('\\n');\n m_functions.clear();\n if (!cmakeFunctionsList.isEmpty()) {\n cmakeFunctionsList.removeFirst(); \/\/remove version string\n foreach (const QByteArray &function, cmakeFunctionsList)\n m_functions << QString::fromLocal8Bit(function.trimmed());\n }\n}\n\nQString CMakeValidator::formatFunctionDetails(const QString &command, const QString &args)\n{\n return QString::fromLatin1(\"<table><tr><td><b>%1<\/b><\/td><td>%2<\/td><\/tr>\")\n .arg(Qt::escape(command)).arg(Qt::escape(args));\n}\n\nvoid CMakeValidator::parseFunctionDetailsOutput(const QByteArray &output)\n{\n QStringList cmakeFunctionsList = m_functions;\n QList<QByteArray> cmakeCommandsHelp = output.split('\\n');\n for (int i = 0; i < cmakeCommandsHelp.count(); ++i) {\n QByteArray lineTrimmed = cmakeCommandsHelp.at(i).trimmed();\n if (cmakeFunctionsList.isEmpty())\n break;\n if (cmakeFunctionsList.first().toLatin1() == lineTrimmed) {\n QStringList commandSyntaxes;\n QString currentCommandSyntax;\n QString currentCommand = cmakeFunctionsList.takeFirst();\n ++i;\n for (; i < cmakeCommandsHelp.count(); ++i) {\n lineTrimmed = cmakeCommandsHelp.at(i).trimmed();\n\n if (!cmakeFunctionsList.isEmpty() && cmakeFunctionsList.first().toLatin1() == lineTrimmed) {\n \/\/start of next function in output\n if (!currentCommandSyntax.isEmpty())\n commandSyntaxes << currentCommandSyntax.append(QLatin1String(\"<\/table>\"));\n --i;\n break;\n }\n if (lineTrimmed.startsWith(currentCommand.toLatin1() + \"(\")) {\n if (!currentCommandSyntax.isEmpty())\n commandSyntaxes << currentCommandSyntax.append(QLatin1String(\"<\/table>\"));\n\n QByteArray argLine = lineTrimmed.mid(currentCommand.length());\n extractKeywords(argLine, &m_variables);\n currentCommandSyntax = formatFunctionDetails(currentCommand, QString::fromUtf8(argLine));\n } else {\n if (!currentCommandSyntax.isEmpty()) {\n if (lineTrimmed.isEmpty()) {\n commandSyntaxes << currentCommandSyntax.append(QLatin1String(\"<\/table>\"));\n currentCommandSyntax.clear();\n } else {\n extractKeywords(lineTrimmed, &m_variables);\n currentCommandSyntax += QString::fromLatin1(\"<tr><td> <\/td><td>%1<\/td><\/tr>\")\n .arg(Qt::escape(QString::fromLocal8Bit(lineTrimmed)));\n }\n }\n }\n }\n m_functionArgs[currentCommand] = commandSyntaxes;\n }\n }\n m_functions = m_functionArgs.keys();\n}\n\nvoid CMakeValidator::parseVariableOutput(const QByteArray &output)\n{\n QList<QByteArray> variableList = output.split('\\n');\n if (!variableList.isEmpty()) {\n variableList.removeFirst(); \/\/remove version string\n foreach (const QByteArray &variable, variableList) {\n if (variable.contains(\"_<CONFIG>\")) {\n m_variables << QString::fromLocal8Bit(variable).replace(QLatin1String(\"_<CONFIG>\"), QLatin1String(\"_DEBUG\"));\n m_variables << QString::fromLocal8Bit(variable).replace(QLatin1String(\"_<CONFIG>\"), QLatin1String(\"_RELEASE\"));\n m_variables << QString::fromLocal8Bit(variable).replace(QLatin1String(\"_<CONFIG>\"), QLatin1String(\"_MINSIZEREL\"));\n m_variables << QString::fromLocal8Bit(variable).replace(QLatin1String(\"_<CONFIG>\"), QLatin1String(\"_RELWITHDEBINFO\"));\n } else if (variable.contains(\"_<LANG>\")) {\n m_variables << QString::fromLocal8Bit(variable).replace(QLatin1String(\"_<LANG>\"), QLatin1String(\"_C\"));\n m_variables << QString::fromLocal8Bit(variable).replace(QLatin1String(\"_<LANG>\"), QLatin1String(\"_CXX\"));\n } else if (!variable.contains(\"_<\") && !variable.contains('[')) {\n m_variables << QString::fromLocal8Bit(variable);\n }\n }\n }\n}\n\nvoid CMakeValidator::parseDone()\n{\n m_variables.sort();\n m_variables.removeDuplicates();\n}\n<|endoftext|>"} {"text":"<commit_before>#include \"fileio.h\"\n\n\n\n\/\/ traverse directory and call Callback() for each file\n#ifdef _WIN32\nvoid TraverseDirectory(const wchar_t Dir[], int Callback(const wchar_t file_path[]))\n{\n WIN32_FIND_DATA FindFileData;\n wchar_t DirSpec[MAX_PATH];\n \/\/DWORD dwError; \n lstrcpy(DirSpec, Dir);\n lstrcat(DirSpec, L\"\\\\*\");\n\n HANDLE hFind = FindFirstFile(DirSpec, &FindFileData);\n\n if (hFind == INVALID_HANDLE_VALUE)\n {\n FindClose(hFind);\n return;\n }\n\n while (FindNextFile(hFind, &FindFileData) != 0)\n {\n if (FindFileData.cFileName[0] == '.')\n {\n if (FindFileData.cFileName[1] == 0 || \/\/ \".\"\n lstrcmp(FindFileData.cFileName + 1, L\".\") == 0) \/\/ \"..\"\n {\n continue;\n }\n }\n\n wchar_t DirAdd[MAX_PATH];\n lstrcpy(DirAdd, Dir);\n lstrcat(DirAdd, L\"\\\\\");\n lstrcat(DirAdd, FindFileData.cFileName);\n\n if (FindFileData.dwFileAttributes & FILE_ATTRIBUTE_DIRECTORY)\n {\n \/\/ directory\n TraverseDirectory(DirAdd, Callback);\n }\n else\n {\n \/\/ file\n Callback(DirAdd);\n }\n }\n\n FindClose(hFind);\n}\n#else\nvoid TraverseDirectory(const char Dir[], int Callback(const char file_path[], const struct stat *sb, int typeflag))\n{\n if (ftw(Dir, Callback, 16))\n {\n perror(\"ftw\");\n }\n}\n#endif \/\/ _WIN32\n\n\n#ifdef _WIN32\nbool IsDirectory(const wchar_t path[])\n{\n DWORD fa = GetFileAttributes(path);\n if (fa == INVALID_FILE_ATTRIBUTES)\n {\n return false;\n }\n return (fa & FILE_ATTRIBUTE_DIRECTORY) != 0;\n}\n#else\nbool IsDirectory(const char path[])\n{\n struct stat sb;\n if (!stat(path, &sb))\n {\n return (sb.st_mode & S_IFDIR) != 0;\n }\n return false;\n}\n#endif \/\/ _WIN32\n\n\n#ifdef _WIN32\nFile::File(const wchar_t *filepath)\n{\n fp = nullptr;\n hFile = CreateFile(filepath, GENERIC_READ | GENERIC_WRITE, FILE_SHARE_READ, NULL, OPEN_EXISTING, FILE_ATTRIBUTE_NORMAL | FILE_FLAG_SEQUENTIAL_SCAN | FILE_FLAG_WRITE_THROUGH, NULL);\n if (hFile == INVALID_HANDLE_VALUE)\n {\n PrintErrorMessage(\"Open file error!\");\n size = 0;\n return;\n }\n size = GetFileSize(hFile, NULL);\n hMap = CreateFileMapping(hFile, NULL, PAGE_READWRITE, 0, 0, NULL);\n if (hMap == INVALID_HANDLE_VALUE)\n {\n PrintErrorMessage(\"Map file error!\");\n return;\n }\n fp = MapViewOfFile(hMap, FILE_MAP_ALL_ACCESS, 0, 0, 0);\n}\n\n\nvoid File::UnMapFile(size_t new_size)\n{\n if (new_size < size)\n {\n if (!FlushViewOfFile(fp, 0))\n {\n PrintErrorMessage(\"Write file error!\");\n return;\n }\n }\n UnmapViewOfFile(fp);\n CloseHandle(hMap);\n if (new_size)\n {\n SetFilePointer(hFile, new_size, NULL, FILE_BEGIN);\n SetEndOfFile(hFile);\n }\n CloseHandle(hFile);\n}\nvoid File::PrintErrorMessage(const char *msg)\n{\n char *error_msg = NULL;\n FormatMessageA(FORMAT_MESSAGE_FROM_SYSTEM | FORMAT_MESSAGE_ALLOCATE_BUFFER, NULL, GetLastError(), 0, (char *)&error_msg, 0, NULL);\n std::cerr << msg << std::endl;\n if (error_msg)\n {\n std::cerr << error_msg << std::endl;\n LocalFree(error_msg);\n }\n}\n#else\nFile::File(const char *filepath)\n{\n fp = nullptr;\n fd = open(filepath, O_RDWR);\n\n if(fd == -1)\n {\n perror(\"Open file error\");\n return;\n }\n\n struct stat sb;\n if (fstat(fd, &sb) == -1)\n {\n perror(\"fstat\");\n return;\n }\n size = sb.st_size;\n\n \/\/ map the file into memory\n fp = mmap(nullptr, size, PROT_READ | PROT_WRITE, MAP_SHARED, fd, 0);\n if (fp == MAP_FAILED)\n {\n perror(\"Map file error\");\n fp = nullptr;\n }\n}\n\n\nvoid File::UnMapFile(size_t new_size)\n{\n if (munmap(fp, size) == -1)\n {\n perror(\"munmap\");\n }\n if (new_size)\n {\n if (ftruncate(fd, new_size) == -1)\n {\n perror(\"ftruncate\");\n }\n }\n\n close(fd);\n}\n\n\n#endif \/\/ _WIN32<commit_msg>Win: more check on return value<commit_after>#include \"fileio.h\"\n\n\n\n\/\/ traverse directory and call Callback() for each file\n#ifdef _WIN32\nvoid TraverseDirectory(const wchar_t Dir[], int Callback(const wchar_t file_path[]))\n{\n WIN32_FIND_DATA FindFileData;\n wchar_t DirSpec[MAX_PATH];\n \/\/DWORD dwError; \n lstrcpy(DirSpec, Dir);\n lstrcat(DirSpec, L\"\\\\*\");\n\n HANDLE hFind = FindFirstFile(DirSpec, &FindFileData);\n\n if (hFind == INVALID_HANDLE_VALUE)\n {\n FindClose(hFind);\n return;\n }\n\n while (FindNextFile(hFind, &FindFileData) != 0)\n {\n if (FindFileData.cFileName[0] == '.')\n {\n if (FindFileData.cFileName[1] == 0 || \/\/ \".\"\n lstrcmp(FindFileData.cFileName + 1, L\".\") == 0) \/\/ \"..\"\n {\n continue;\n }\n }\n\n wchar_t DirAdd[MAX_PATH];\n lstrcpy(DirAdd, Dir);\n lstrcat(DirAdd, L\"\\\\\");\n lstrcat(DirAdd, FindFileData.cFileName);\n\n if (FindFileData.dwFileAttributes & FILE_ATTRIBUTE_DIRECTORY)\n {\n \/\/ directory\n TraverseDirectory(DirAdd, Callback);\n }\n else\n {\n \/\/ file\n Callback(DirAdd);\n }\n }\n\n FindClose(hFind);\n}\n#else\nvoid TraverseDirectory(const char Dir[], int Callback(const char file_path[], const struct stat *sb, int typeflag))\n{\n if (ftw(Dir, Callback, 16))\n {\n perror(\"ftw\");\n }\n}\n#endif \/\/ _WIN32\n\n\n#ifdef _WIN32\nbool IsDirectory(const wchar_t path[])\n{\n DWORD fa = GetFileAttributes(path);\n if (fa == INVALID_FILE_ATTRIBUTES)\n {\n return false;\n }\n return (fa & FILE_ATTRIBUTE_DIRECTORY) != 0;\n}\n#else\nbool IsDirectory(const char path[])\n{\n struct stat sb;\n if (!stat(path, &sb))\n {\n return (sb.st_mode & S_IFDIR) != 0;\n }\n return false;\n}\n#endif \/\/ _WIN32\n\n\n#ifdef _WIN32\nFile::File(const wchar_t *filepath)\n{\n fp = nullptr;\n hFile = CreateFile(filepath, GENERIC_READ | GENERIC_WRITE, FILE_SHARE_READ, NULL, OPEN_EXISTING, FILE_ATTRIBUTE_NORMAL | FILE_FLAG_SEQUENTIAL_SCAN | FILE_FLAG_WRITE_THROUGH, NULL);\n if (hFile == INVALID_HANDLE_VALUE)\n {\n PrintErrorMessage(\"Open file error!\");\n size = 0;\n return;\n }\n size = GetFileSize(hFile, NULL);\n hMap = CreateFileMapping(hFile, NULL, PAGE_READWRITE, 0, 0, NULL);\n if (hMap == INVALID_HANDLE_VALUE)\n {\n PrintErrorMessage(\"Map file error!\");\n return;\n }\n fp = MapViewOfFile(hMap, FILE_MAP_ALL_ACCESS, 0, 0, 0);\n}\n\n\nvoid File::UnMapFile(size_t new_size)\n{\n if (new_size < size)\n {\n if (!FlushViewOfFile(fp, 0))\n {\n PrintErrorMessage(\"Write file error!\");\n }\n }\n if (!UnmapViewOfFile(fp))\n {\n PrintErrorMessage(\"UnmapViewOfFile error!\");\n }\n CloseHandle(hMap);\n if (new_size)\n {\n SetFilePointer(hFile, new_size, NULL, FILE_BEGIN);\n if (!SetEndOfFile(hFile))\n {\n PrintErrorMessage(\"SetEndOfFile error!\");\n }\n }\n CloseHandle(hFile);\n}\nvoid File::PrintErrorMessage(const char *msg)\n{\n char *error_msg = NULL;\n FormatMessageA(FORMAT_MESSAGE_FROM_SYSTEM | FORMAT_MESSAGE_ALLOCATE_BUFFER, NULL, GetLastError(), 0, (char *)&error_msg, 0, NULL);\n std::cerr << msg << std::endl;\n if (error_msg)\n {\n std::cerr << error_msg << std::endl;\n LocalFree(error_msg);\n }\n}\n#else\nFile::File(const char *filepath)\n{\n fp = nullptr;\n fd = open(filepath, O_RDWR);\n\n if(fd == -1)\n {\n perror(\"Open file error\");\n return;\n }\n\n struct stat sb;\n if (fstat(fd, &sb) == -1)\n {\n perror(\"fstat\");\n return;\n }\n size = sb.st_size;\n\n \/\/ map the file into memory\n fp = mmap(nullptr, size, PROT_READ | PROT_WRITE, MAP_SHARED, fd, 0);\n if (fp == MAP_FAILED)\n {\n perror(\"Map file error\");\n fp = nullptr;\n }\n}\n\n\nvoid File::UnMapFile(size_t new_size)\n{\n if (munmap(fp, size) == -1)\n {\n perror(\"munmap\");\n }\n if (new_size)\n {\n if (ftruncate(fd, new_size) == -1)\n {\n perror(\"ftruncate\");\n }\n }\n\n close(fd);\n}\n\n\n#endif \/\/ _WIN32<|endoftext|>"} {"text":"<commit_before>\/** \\file FullTextCache.cc\n * \\brief Implementation of functions relating to our full-text cache.\n * \\author Dr. Johannes Ruscheinski (johannes.ruscheinski@uni-tuebingen.de)\n *\n * \\copyright 2017-2019 Universitätsbibliothek Tübingen. All rights reserved.\n *\n * This program is free software: you can redistribute it and\/or modify\n * it under the terms of the GNU Affero General Public License as\n * published by the Free Software Foundation, either version 3 of the\n * License, or (at your option) any later version.\n *\n * This program is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the\n * GNU Affero General Public License for more details.\n *\n * You should have received a copy of the GNU Affero General Public License\n * along with this program. If not, see <http:\/\/www.gnu.org\/licenses\/>.\n *\/\n#include \"FullTextCache.h\"\n#include <algorithm>\n#include <tuple>\n#include <ctime>\n#include \"Compiler.h\"\n#include \"DbRow.h\"\n#include \"Random.h\"\n#include \"StringUtil.h\"\n#include \"TimeUtil.h\"\n#include \"UrlUtil.h\"\n#include \"util.h\"\n#include \"VuFind.h\"\n\n\nconstexpr unsigned MIN_CACHE_EXPIRE_TIME_ON_ERROR(42300 * 60); \/\/ About 1 month in seconds.\nconstexpr unsigned MAX_CACHE_EXPIRE_TIME_ON_ERROR(42300 * 60 * 2); \/\/ About 2 months in seconds.\n\n\nbool FullTextCache::getDomainFromUrl(const std::string &url, std::string * const domain) const {\n std::string scheme, username_password, authority, port, path, params, query, fragment, relative_url;\n const bool result(UrlUtil::ParseUrl(url, &scheme, &username_password, &authority, &port, &path, ¶ms, &query,\n &fragment, &relative_url));\n if (result)\n *domain = authority;\n\n return result;\n}\n\n\nbool FullTextCache::entryExpired(const std::string &id, std::vector<std::string> urls) {\n Entry entry;\n if (not getEntry(id, &entry))\n return true;\n const time_t now(std::time(nullptr));\n if (entry.expiration_ == TimeUtil::BAD_TIME_T or now < entry.expiration_) {\n std::vector<std::string> existing_urls(FullTextCache::getEntryUrlsAsStrings(id));\n\n std::sort(existing_urls.begin(), existing_urls.end());\n std::sort(urls.begin(), urls.end());\n if (urls == existing_urls)\n return false;\n }\n\n return full_text_cache_urls_.deleteDocument(id);\n}\n\n\nvoid FullTextCache::expireEntries() {\n full_text_cache_urls_.deleteRange(\"expiration\", Elasticsearch::RO_LTE, \"now\");\n}\n\n\nbool FullTextCache::getEntry(const std::string &id, Entry * const entry) const {\n const auto results(full_text_cache_.simpleSelect({ \"expiration\" }, \"id\", id));\n if (results.empty())\n return false;\n\n entry->id_ = id;\n if (results.front().find(\"expiration\") == results.front().cend())\n entry->expiration_ = TimeUtil::BAD_TIME_T;\n else\n entry->expiration_ = TimeUtil::Iso8601StringToTimeT(results.front().find(\"expiration\")->second);\n return true;\n}\n\n\ninline std::string GetValueOrEmptyString(const std::map<std::string, std::string> &map, const std::string &key) {\n const auto pair(map.find(key));\n return pair == map.cend() ? \"\" : pair->second;\n}\n\n\nstd::vector<FullTextCache::EntryUrl> FullTextCache::getEntryUrls(const std::string &id) const {\n const auto results(full_text_cache_urls_.simpleSelect({ \"url\", \"domain\", \"error_message\" }, \"id\", id));\n\n std::vector<EntryUrl> entry_urls;\n entry_urls.reserve(results.size());\n for (const auto &map : results) {\n EntryUrl entry_url;\n entry_url.id_ = id;\n entry_url.url_ = GetValueOrEmptyString(map, \"url\");\n entry_url.domain_ = GetValueOrEmptyString(map, \"domain\");\n entry_url.error_message_ = GetValueOrEmptyString(map, \"error_message\");\n entry_urls.emplace_back(entry_url);\n }\n return entry_urls;\n}\n\n\nstd::vector<std::string> FullTextCache::getEntryUrlsAsStrings(const std::string &id) const {\n const auto results(full_text_cache_urls_.simpleSelect({ \"url\" }, \"id\", id));\n\n std::vector<std::string> urls;\n for (const auto &map : results) {\n\n const auto url(GetValueOrEmptyString(map, \"url\"));\n if (not url.empty())\n urls.emplace_back(url);\n }\n return urls;\n}\n\n\nunsigned FullTextCache::getErrorCount() const {\n return full_text_cache_urls_.count({ { \"error_message\", \"*\" } });\n}\n\n\nbool FullTextCache::getFullText(const std::string &id, std::string * const full_text) const {\n const auto results(full_text_cache_.simpleSelect({ \"full_text\" }, \"id\", id));\n\n if (results.empty())\n return false;\n\n *full_text = GetValueOrEmptyString(results.front(), \"full_text\");\n return true;\n}\n\n\nconst std::string US(\"\\x1F\"); \/\/ ASCII unit separator\n\n\nstd::vector<FullTextCache::EntryGroup> FullTextCache::getEntryGroupsByDomainAndErrorMessage() const {\n const auto results(full_text_cache_urls_.simpleSelect({ \"url\", \"domain\", \"error_message\", \"id\" }));\n\n std::unordered_map<std::string, std::tuple<std::string, std::string, unsigned>> domains_and_errors_to_ids_and_urls_and_counts_map;\n for (const auto &map : results) {\n const auto url_pair(map.find(\"url\"));\n const auto domain_pair(map.find(\"domain\"));\n const auto error_message_pair(map.find(\"error_message\"));\n if (url_pair == map.cend() or domain_pair == map.cend() or error_message_pair == map.cend())\n continue;\n\n const auto id_pair(map.find(\"id\"));\n const auto key(domain_pair->second + US + error_message_pair->second);\n auto id_and_url_and_count(domains_and_errors_to_ids_and_urls_and_counts_map.find(key));\n if (id_and_url_and_count != domains_and_errors_to_ids_and_urls_and_counts_map.end())\n ++std::get<2>(id_and_url_and_count->second);\n else\n domains_and_errors_to_ids_and_urls_and_counts_map[key] = std::make_tuple(id_pair->second, url_pair->second, 1);\n }\n\n std::vector<EntryGroup> groups;\n groups.reserve(domains_and_errors_to_ids_and_urls_and_counts_map.size());\n for (const auto &domain_and_error_to_id_and_url_and_count : domains_and_errors_to_ids_and_urls_and_counts_map) {\n std::vector<std::string> parts;\n if (unlikely(StringUtil::Split(domain_and_error_to_id_and_url_and_count.first, US, &parts) != 2))\n LOG_ERROR(\"This should never happen (\" + std::to_string(parts.size()) + \"): \"\n + StringUtil::CStyleEscape(domain_and_error_to_id_and_url_and_count.first));\n\n groups.emplace_back(EntryGroup(std::get<2>(domain_and_error_to_id_and_url_and_count.second),\n parts[0], parts[1],\n std::get<0>(domain_and_error_to_id_and_url_and_count.second),\n std::get<1>(domain_and_error_to_id_and_url_and_count.second)));\n }\n\n std::sort(groups.begin(), groups.end(), [](const EntryGroup &eg1, const EntryGroup &eg2){ return eg1.count_ > eg2.count_;});\n return groups;\n}\n\n\nstd::vector<FullTextCache::EntryUrl> FullTextCache::getJoinedEntriesByDomainAndErrorMessage(const std::string &domain_,\n const std::string &error_message_) const\n{\n const auto results(full_text_cache_urls_.simpleSelect({ \"url\", \"domain\", \"error_message\", \"id\" },\n { { \"domain\", domain_ }, { \"error_message\", error_message_ } }));\n\n std::vector<EntryUrl> entries;\n for (const auto &map : results) {\n const std::string url(GetValueOrEmptyString(map, \"url\"));\n const std::string domain(GetValueOrEmptyString(map, \"domain\"));\n const std::string error_message(GetValueOrEmptyString(map, \"error_message\"));\n const std::string id(GetValueOrEmptyString(map, \"id\"));\n\n entries.emplace_back(EntryUrl(id, url, domain, error_message));\n }\n\n return entries;\n}\n\n\nFullTextCache::EntryUrl FullTextCache::getJoinedEntryByDomainAndErrorMessage(const std::string &domain_, const std::string &error_message_)\n const\n{\n const auto results(full_text_cache_urls_.simpleSelect({ \"url\", \"domain\", \"error_message\", \"id\" },\n { { \"domain\", domain_ }, { \"error_message\", error_message_ } },\n \/* max_count = *\/1));\n if (unlikely(results.size() != 1))\n LOG_ERROR(\"failed to get one entry!\");\n\n const std::string url(GetValueOrEmptyString(results.front(), \"url\"));\n const std::string domain(GetValueOrEmptyString(results.front(), \"domain\"));\n const std::string error_message(GetValueOrEmptyString(results.front(), \"error_message\"));\n const std::string id(GetValueOrEmptyString(results.front(), \"id\"));\n\n return EntryUrl(id, url, domain, error_message);\n}\n\n\nunsigned FullTextCache::getSize() const {\n return full_text_cache_.size();\n}\n\n\nvoid FullTextCache::insertEntry(const std::string &id, const std::string &full_text, const std::vector<EntryUrl> &entry_urls) {\n const time_t now(std::time(nullptr));\n Random::Rand rand(now);\n time_t expiration(TimeUtil::BAD_TIME_T);\n for (const auto &entry_url : entry_urls) {\n if (full_text.empty() and entry_url.error_message_.empty())\n LOG_ERROR(\"you must provide either data to be cached or a non-empty error message! (id \" + id + \")\");\n\n if (not entry_url.error_message_.empty())\n expiration = now + MIN_CACHE_EXPIRE_TIME_ON_ERROR + rand(MAX_CACHE_EXPIRE_TIME_ON_ERROR - MIN_CACHE_EXPIRE_TIME_ON_ERROR);\n }\n\n std::string expiration_string;\n if (expiration == TimeUtil::BAD_TIME_T) {\n full_text_cache_.simpleInsert({ { \"id\", id }, { \"full_text\", full_text } });\n }\n else {\n expiration_string = TimeUtil::TimeTToString(expiration, TimeUtil::ISO_8601_FORMAT);\n full_text_cache_.simpleInsert({ { \"id\", id }, { \"expiration\", expiration_string }, { \"full_text\", full_text } });\n }\n\n for (const auto &entry_url : entry_urls) {\n if (entry_url.error_message_.empty())\n full_text_cache_urls_.simpleInsert({ { \"id\", id }, { \"url\", entry_url.url_ }, { \"domain\", entry_url.domain_ } });\n else\n full_text_cache_urls_.simpleInsert({ { \"id\", id }, { \"url\", entry_url.url_ }, { \"domain\", entry_url.domain_ },\n { \"error_message\", entry_url.error_message_ } });\n }\n}\n<commit_msg>FullTextCache::getJoinedEntriesByDomainAndErrorMessage => fixed sort order<commit_after>\/** \\file FullTextCache.cc\n * \\brief Implementation of functions relating to our full-text cache.\n * \\author Dr. Johannes Ruscheinski (johannes.ruscheinski@uni-tuebingen.de)\n *\n * \\copyright 2017-2019 Universitätsbibliothek Tübingen. All rights reserved.\n *\n * This program is free software: you can redistribute it and\/or modify\n * it under the terms of the GNU Affero General Public License as\n * published by the Free Software Foundation, either version 3 of the\n * License, or (at your option) any later version.\n *\n * This program is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the\n * GNU Affero General Public License for more details.\n *\n * You should have received a copy of the GNU Affero General Public License\n * along with this program. If not, see <http:\/\/www.gnu.org\/licenses\/>.\n *\/\n#include \"FullTextCache.h\"\n#include <algorithm>\n#include <tuple>\n#include <ctime>\n#include \"Compiler.h\"\n#include \"DbRow.h\"\n#include \"Random.h\"\n#include \"StringUtil.h\"\n#include \"TimeUtil.h\"\n#include \"UrlUtil.h\"\n#include \"util.h\"\n#include \"VuFind.h\"\n\n\nconstexpr unsigned MIN_CACHE_EXPIRE_TIME_ON_ERROR(42300 * 60); \/\/ About 1 month in seconds.\nconstexpr unsigned MAX_CACHE_EXPIRE_TIME_ON_ERROR(42300 * 60 * 2); \/\/ About 2 months in seconds.\n\n\nbool FullTextCache::getDomainFromUrl(const std::string &url, std::string * const domain) const {\n std::string scheme, username_password, authority, port, path, params, query, fragment, relative_url;\n const bool result(UrlUtil::ParseUrl(url, &scheme, &username_password, &authority, &port, &path, ¶ms, &query,\n &fragment, &relative_url));\n if (result)\n *domain = authority;\n\n return result;\n}\n\n\nbool FullTextCache::entryExpired(const std::string &id, std::vector<std::string> urls) {\n Entry entry;\n if (not getEntry(id, &entry))\n return true;\n const time_t now(std::time(nullptr));\n if (entry.expiration_ == TimeUtil::BAD_TIME_T or now < entry.expiration_) {\n std::vector<std::string> existing_urls(FullTextCache::getEntryUrlsAsStrings(id));\n\n std::sort(existing_urls.begin(), existing_urls.end());\n std::sort(urls.begin(), urls.end());\n if (urls == existing_urls)\n return false;\n }\n\n return full_text_cache_urls_.deleteDocument(id);\n}\n\n\nvoid FullTextCache::expireEntries() {\n full_text_cache_urls_.deleteRange(\"expiration\", Elasticsearch::RO_LTE, \"now\");\n}\n\n\nbool FullTextCache::getEntry(const std::string &id, Entry * const entry) const {\n const auto results(full_text_cache_.simpleSelect({ \"expiration\" }, \"id\", id));\n if (results.empty())\n return false;\n\n entry->id_ = id;\n if (results.front().find(\"expiration\") == results.front().cend())\n entry->expiration_ = TimeUtil::BAD_TIME_T;\n else\n entry->expiration_ = TimeUtil::Iso8601StringToTimeT(results.front().find(\"expiration\")->second);\n return true;\n}\n\n\ninline std::string GetValueOrEmptyString(const std::map<std::string, std::string> &map, const std::string &key) {\n const auto pair(map.find(key));\n return pair == map.cend() ? \"\" : pair->second;\n}\n\n\nstd::vector<FullTextCache::EntryUrl> FullTextCache::getEntryUrls(const std::string &id) const {\n const auto results(full_text_cache_urls_.simpleSelect({ \"url\", \"domain\", \"error_message\" }, \"id\", id));\n\n std::vector<EntryUrl> entry_urls;\n entry_urls.reserve(results.size());\n for (const auto &map : results) {\n EntryUrl entry_url;\n entry_url.id_ = id;\n entry_url.url_ = GetValueOrEmptyString(map, \"url\");\n entry_url.domain_ = GetValueOrEmptyString(map, \"domain\");\n entry_url.error_message_ = GetValueOrEmptyString(map, \"error_message\");\n entry_urls.emplace_back(entry_url);\n }\n return entry_urls;\n}\n\n\nstd::vector<std::string> FullTextCache::getEntryUrlsAsStrings(const std::string &id) const {\n const auto results(full_text_cache_urls_.simpleSelect({ \"url\" }, \"id\", id));\n\n std::vector<std::string> urls;\n for (const auto &map : results) {\n\n const auto url(GetValueOrEmptyString(map, \"url\"));\n if (not url.empty())\n urls.emplace_back(url);\n }\n return urls;\n}\n\n\nunsigned FullTextCache::getErrorCount() const {\n return full_text_cache_urls_.count({ { \"error_message\", \"*\" } });\n}\n\n\nbool FullTextCache::getFullText(const std::string &id, std::string * const full_text) const {\n const auto results(full_text_cache_.simpleSelect({ \"full_text\" }, \"id\", id));\n\n if (results.empty())\n return false;\n\n *full_text = GetValueOrEmptyString(results.front(), \"full_text\");\n return true;\n}\n\n\nconst std::string US(\"\\x1F\"); \/\/ ASCII unit separator\n\n\nstd::vector<FullTextCache::EntryGroup> FullTextCache::getEntryGroupsByDomainAndErrorMessage() const {\n const auto results(full_text_cache_urls_.simpleSelect({ \"url\", \"domain\", \"error_message\", \"id\" }));\n\n std::unordered_map<std::string, std::tuple<std::string, std::string, unsigned>> domains_and_errors_to_ids_and_urls_and_counts_map;\n for (const auto &map : results) {\n const auto url_pair(map.find(\"url\"));\n const auto domain_pair(map.find(\"domain\"));\n const auto error_message_pair(map.find(\"error_message\"));\n if (url_pair == map.cend() or domain_pair == map.cend() or error_message_pair == map.cend())\n continue;\n\n const auto id_pair(map.find(\"id\"));\n const auto key(domain_pair->second + US + error_message_pair->second);\n auto id_and_url_and_count(domains_and_errors_to_ids_and_urls_and_counts_map.find(key));\n if (id_and_url_and_count != domains_and_errors_to_ids_and_urls_and_counts_map.end())\n ++std::get<2>(id_and_url_and_count->second);\n else\n domains_and_errors_to_ids_and_urls_and_counts_map[key] = std::make_tuple(id_pair->second, url_pair->second, 1);\n }\n\n std::vector<EntryGroup> groups;\n groups.reserve(domains_and_errors_to_ids_and_urls_and_counts_map.size());\n for (const auto &domain_and_error_to_id_and_url_and_count : domains_and_errors_to_ids_and_urls_and_counts_map) {\n std::vector<std::string> parts;\n if (unlikely(StringUtil::Split(domain_and_error_to_id_and_url_and_count.first, US, &parts) != 2))\n LOG_ERROR(\"This should never happen (\" + std::to_string(parts.size()) + \"): \"\n + StringUtil::CStyleEscape(domain_and_error_to_id_and_url_and_count.first));\n\n groups.emplace_back(EntryGroup(std::get<2>(domain_and_error_to_id_and_url_and_count.second),\n parts[0], parts[1],\n std::get<0>(domain_and_error_to_id_and_url_and_count.second),\n std::get<1>(domain_and_error_to_id_and_url_and_count.second)));\n }\n\n std::sort(groups.begin(), groups.end(), [](const EntryGroup &eg1, const EntryGroup &eg2){ return eg1.count_ > eg2.count_;});\n return groups;\n}\n\n\nstd::vector<FullTextCache::EntryUrl> FullTextCache::getJoinedEntriesByDomainAndErrorMessage(const std::string &domain_,\n const std::string &error_message_) const\n{\n const auto results(full_text_cache_urls_.simpleSelect({ \"url\", \"domain\", \"error_message\", \"id\" },\n { { \"domain\", domain_ }, { \"error_message\", error_message_ } }));\n\n std::vector<EntryUrl> entries;\n for (const auto &map : results) {\n const std::string url(GetValueOrEmptyString(map, \"url\"));\n const std::string domain(GetValueOrEmptyString(map, \"domain\"));\n const std::string error_message(GetValueOrEmptyString(map, \"error_message\"));\n const std::string id(GetValueOrEmptyString(map, \"id\"));\n\n entries.emplace_back(EntryUrl(id, url, domain, error_message));\n }\n\n std::sort(entries.begin(), entries.end(), [](const EntryUrl &eu1, const EntryUrl &eu2){ return eu1.id_ < eu2.id_; });\n return entries;\n}\n\n\nFullTextCache::EntryUrl FullTextCache::getJoinedEntryByDomainAndErrorMessage(const std::string &domain_, const std::string &error_message_)\n const\n{\n const auto results(full_text_cache_urls_.simpleSelect({ \"url\", \"domain\", \"error_message\", \"id\" },\n { { \"domain\", domain_ }, { \"error_message\", error_message_ } },\n \/* max_count = *\/1));\n if (unlikely(results.size() != 1))\n LOG_ERROR(\"failed to get one entry!\");\n\n const std::string url(GetValueOrEmptyString(results.front(), \"url\"));\n const std::string domain(GetValueOrEmptyString(results.front(), \"domain\"));\n const std::string error_message(GetValueOrEmptyString(results.front(), \"error_message\"));\n const std::string id(GetValueOrEmptyString(results.front(), \"id\"));\n\n return EntryUrl(id, url, domain, error_message);\n}\n\n\nunsigned FullTextCache::getSize() const {\n return full_text_cache_.size();\n}\n\n\nvoid FullTextCache::insertEntry(const std::string &id, const std::string &full_text, const std::vector<EntryUrl> &entry_urls) {\n const time_t now(std::time(nullptr));\n Random::Rand rand(now);\n time_t expiration(TimeUtil::BAD_TIME_T);\n for (const auto &entry_url : entry_urls) {\n if (full_text.empty() and entry_url.error_message_.empty())\n LOG_ERROR(\"you must provide either data to be cached or a non-empty error message! (id \" + id + \")\");\n\n if (not entry_url.error_message_.empty())\n expiration = now + MIN_CACHE_EXPIRE_TIME_ON_ERROR + rand(MAX_CACHE_EXPIRE_TIME_ON_ERROR - MIN_CACHE_EXPIRE_TIME_ON_ERROR);\n }\n\n std::string expiration_string;\n if (expiration == TimeUtil::BAD_TIME_T) {\n full_text_cache_.simpleInsert({ { \"id\", id }, { \"full_text\", full_text } });\n }\n else {\n expiration_string = TimeUtil::TimeTToString(expiration, TimeUtil::ISO_8601_FORMAT);\n full_text_cache_.simpleInsert({ { \"id\", id }, { \"expiration\", expiration_string }, { \"full_text\", full_text } });\n }\n\n for (const auto &entry_url : entry_urls) {\n if (entry_url.error_message_.empty())\n full_text_cache_urls_.simpleInsert({ { \"id\", id }, { \"url\", entry_url.url_ }, { \"domain\", entry_url.domain_ } });\n else\n full_text_cache_urls_.simpleInsert({ { \"id\", id }, { \"url\", entry_url.url_ }, { \"domain\", entry_url.domain_ },\n { \"error_message\", entry_url.error_message_ } });\n }\n}\n<|endoftext|>"} {"text":"<commit_before>#include <cassert>\n#include \"ch_frb_io_internals.hpp\"\n\nusing namespace std;\nusing namespace ch_frb_io;\n\n\ninline bool array_contains(const int *arr, int len, int x)\n{\n for (int i = 0; i < len; i++)\n\tif (arr[i] == x)\n\t return true;\n return false;\n}\n\n\ninline double intval(int beam_id, int ifreq, int it)\n{\n return 0.823*beam_id + 1.319*ifreq + 0.2139*it;\n}\n\n\n\/\/ weights are between 0.2 and 1\ninline double wtval(int beam_id, int ifreq, int it)\n{\n return 0.6 + 0.4 * sin(1.328*beam_id + 2.382*ifreq + 0.883*it);\n}\n\n\n\/\/ -------------------------------------------------------------------------------------------------\n\n\nstruct unit_test_instance {\n static constexpr int maxbeams = 8;\n\n int nbeams = 0;\n int nupfreq = 0;\n int nfreq_coarse_per_packet = 0;\n int nt_per_packet = 0;\n int nt_per_chunk = 0;\n int nt_tot = 0;\n int fpga_counts_per_sample = 0;\n uint64_t initial_fpga_count = 0;\n float wt_cutoff = 0.0;\n\n vector<int> recv_beam_ids;\n vector<int> send_beam_ids;\n vector<int> send_freq_ids;\n int send_stride;\n\n \/\/ not protected by lock\n pthread_t consumer_threads[maxbeams]; \n shared_ptr<ch_frb_io::intensity_network_stream> istream;\n\n pthread_mutex_t lock;\n\n unit_test_instance(std::mt19937 &rng);\n ~unit_test_instance();\n};\n\n\nunit_test_instance::unit_test_instance(std::mt19937 &rng)\n{\n const int nfreq_coarse = ch_frb_io::constants::nfreq_coarse;\n\n this->nbeams = randint(rng, 1, maxbeams+1);\n this->nupfreq = randint(rng, 1, 17);\n this->nfreq_coarse_per_packet = 1 << randint(rng,0,5);\n \n \/\/ nt_max = max possible nt_per_packet (before max packet size is exceeded)\n int header_nbytes = 24 + 2*nbeams + 2*nfreq_coarse_per_packet + 8*nbeams*nfreq_coarse_per_packet;\n int nbytes_per_nt = nbeams * nfreq_coarse_per_packet * nupfreq;\n int nt_max = (ch_frb_io::constants::max_output_udp_packet_size - header_nbytes) \/ nbytes_per_nt;\n\n assert(nt_max >= 3);\n this->nt_per_packet = randint(rng, nt_max\/2+1, nt_max+1);\n\n \/\/ FIXME increase nt_tot\n this->nt_per_chunk = nt_per_packet * randint(rng,1,5);\n this->nt_tot = nt_per_chunk * randint(rng,1,5);\n\n this->fpga_counts_per_sample = randint(rng, 1, 1025);\n this->initial_fpga_count = fpga_counts_per_sample * randint(rng, 0, 4097);\n this->wt_cutoff = uniform_rand(rng, 0.3, 0.7);\n\n \/\/ Clunky way of generating random beam_ids\n this->recv_beam_ids.resize(nbeams);\n for (int i = 0; i < nbeams; i++) {\n\tdo {\n\t recv_beam_ids[i] = randint(rng, 0, ch_frb_io::constants::max_allowed_beam_id);\n\t} while (array_contains(&recv_beam_ids[0], i, recv_beam_ids[i]));\n }\n\n \/\/ To slightly strengthen the test, we permute the receiver beams relative to sender\n this->send_beam_ids = recv_beam_ids;\n std::shuffle(send_beam_ids.begin(), send_beam_ids.end(), rng);\n\n \/\/ Randomly permute frequencies, just to strengthen the test\n this->send_freq_ids.resize(nfreq_coarse);\n for (int i = 0; i < nfreq_coarse; i++)\n\tsend_freq_ids[i] = i;\n std::shuffle(send_freq_ids.begin(), send_freq_ids.end(), rng);\n\n this->send_stride = randint(rng, nt_per_chunk, 2*nt_per_chunk+1);\n\n \/\/ Will be needed shortly for synchronization\n xpthread_mutex_init(&this->lock);\n}\n\n\nunit_test_instance::~unit_test_instance()\n{\n pthread_mutex_destroy(&lock);\n}\n\n\n\/\/ -------------------------------------------------------------------------------------------------\n\n\nstruct consumer_thread_context {\n shared_ptr<ch_frb_io::intensity_beam_assembler> assembler;\n shared_ptr<unit_test_instance> tp;\n\n pthread_mutex_t lock;\n pthread_cond_t cond_running;\n bool is_running = false;\n\n consumer_thread_context(const shared_ptr<ch_frb_io::intensity_beam_assembler> &assembler_, const shared_ptr<unit_test_instance> &tp_)\n\t: assembler(assembler_), tp(tp_)\n {\n\txpthread_mutex_init(&lock);\n\txpthread_cond_init(&cond_running);\n }\n};\n\n\nstatic void *consumer_thread_main(void *opaque_arg)\n{\n consumer_thread_context *context = reinterpret_cast<consumer_thread_context *> (opaque_arg);\n shared_ptr<ch_frb_io::intensity_beam_assembler> assembler = context->assembler;\n shared_ptr<unit_test_instance> tp = context->tp;\n\n pthread_mutex_lock(&context->lock);\n context->is_running = true;\n pthread_cond_broadcast(&context->cond_running);\n pthread_mutex_unlock(&context->lock);\n\n \/\/ actual logic of the consumer thread goes here\n cerr << \"consumer_thread: artificially exiting\\n\";\n return NULL;\n}\n\n\nstatic void spawn_consumer_thread(const shared_ptr<ch_frb_io::intensity_beam_assembler> &assembler, const shared_ptr<unit_test_instance> &tp, int ibeam)\n{\n consumer_thread_context context(assembler, tp);\n\n int err = pthread_create(&tp->consumer_threads[ibeam], NULL, consumer_thread_main, &context);\n if (err)\n\tthrow runtime_error(string(\"pthread_create() failed to create consumer thread: \") + strerror(errno));\n\n pthread_mutex_lock(&context.lock);\n while (!context.is_running)\n\tpthread_cond_wait(&context.cond_running, &context.lock);\n pthread_mutex_unlock(&context.lock);\n}\n\n\nstatic void spawn_all_receive_threads(const shared_ptr<unit_test_instance> &tp)\n{\n vector<shared_ptr<ch_frb_io::intensity_beam_assembler> > assemblers;\n\n for (int ibeam = 0; ibeam < tp->nbeams; ibeam++) {\n\tauto assembler = ch_frb_io::intensity_beam_assembler::make(tp->recv_beam_ids[ibeam]);\n\tspawn_consumer_thread(assembler, tp, ibeam);\n\tassemblers.push_back(assembler);\n }\n\n tp->istream = intensity_network_stream::make(assemblers, ch_frb_io::constants::default_udp_port);\n}\n\n\n\/\/ -------------------------------------------------------------------------------------------------\n\n\nstatic void send_data(const shared_ptr<unit_test_instance> &tp)\n{\n const int nbeams = tp->nbeams;\n const int nupfreq = tp->nupfreq;\n const int nfreq_coarse = ch_frb_io::constants::nfreq_coarse;\n const int nt_chunk = tp->nt_per_chunk;\n const int nchunks = tp->nt_tot \/ tp->nt_per_chunk;\n const int stride = tp->send_stride;\n const int s2 = nupfreq * stride;\n const int s3 = nfreq_coarse * s2;\n\n string dstname = \"127.0.0.1:\" + to_string(ch_frb_io::constants::default_udp_port);\n\n \/\/ spawns network thread\n auto ostream = intensity_network_ostream::make(dstname, tp->send_beam_ids, tp->send_freq_ids, tp->nupfreq,\n\t\t\t\t\t\t tp->nt_per_chunk, tp->nfreq_coarse_per_packet, \n\t\t\t\t\t\t tp->nt_per_packet, tp->fpga_counts_per_sample,\n\t\t\t\t\t\t tp->wt_cutoff, 0.0);\n\n vector<float> intensity(nbeams * s3, 0.0);\n vector<float> weights(nbeams * s3, 0.0);\n\n for (int ichunk = 0; ichunk < nchunks; ichunk++) {\n\tint it0 = ichunk * nt_chunk; \/\/ start of chunk\n\n\tfor (int ibeam = 0; ibeam < nbeams; ibeam++) {\n\t int beam_id = tp->send_beam_ids[ibeam];\n\n\t for (int ifreq_coarse = 0; ifreq_coarse < nfreq_coarse; ifreq_coarse++) {\n\t\tint coarse_freq_id = tp->send_freq_ids[ifreq_coarse];\n\n\t\tfor (int iupfreq = 0; iupfreq < nupfreq; iupfreq++) {\n\t\t int ifreq_logical = coarse_freq_id * nupfreq + iupfreq;\n\t\t \n\t\t int row_start = ibeam*s3 + ifreq_coarse*s2 + iupfreq*stride;\n\t\t float *i_row = &intensity[row_start];\n\t\t float *w_row = &weights[row_start];\n\n\t\t for (int it = 0; it < nt_chunk; it++) {\n\t\t\ti_row[it] = intval(beam_id, ifreq_logical, it+it0);\n\t\t\tw_row[it] = wtval(beam_id, ifreq_logical, it+it0);\n\t\t }\n\t\t}\n\t }\n\t}\n\n\tuint64_t fpga_count = tp->initial_fpga_count + ichunk * nt_chunk * tp->fpga_counts_per_sample;\n\tostream->send_chunk(&intensity[0], &weights[0], stride, fpga_count, true);\n }\n\n \/\/ joins network thread\n ostream->end_stream(true);\n}\n\n\n\/\/ -------------------------------------------------------------------------------------------------\n\n\nint main(int argc, char **argv)\n{\n std::random_device rd;\n std::mt19937 rng(rd());\n\n for (int iouter = 0; iouter < 100; iouter++) {\n\tauto tp = make_shared<unit_test_instance> (rng);\n\tspawn_all_receive_threads(tp);\n\n\ttp->istream->start_stream();\n\tsend_data(tp);\t\n\ttp->istream->end_stream(true); \/\/ join_threads=true\n\n\tfor (int ibeam = 0; ibeam < tp->nbeams; ibeam++) {\n\t int err = pthread_join(tp->consumer_threads[ibeam], NULL);\n\t if (err)\n\t\tthrow runtime_error(\"pthread_join() failed\");\n\t}\n }\n\n return 0;\n}\n<commit_msg>unit_test_instance::show()<commit_after>#include <cassert>\n#include \"ch_frb_io_internals.hpp\"\n\nusing namespace std;\nusing namespace ch_frb_io;\n\n\ninline bool array_contains(const int *arr, int len, int x)\n{\n for (int i = 0; i < len; i++)\n\tif (arr[i] == x)\n\t return true;\n return false;\n}\n\n\ninline double intval(int beam_id, int ifreq, int it)\n{\n return 0.823*beam_id + 1.319*ifreq + 0.2139*it;\n}\n\n\n\/\/ weights are between 0.2 and 1\ninline double wtval(int beam_id, int ifreq, int it)\n{\n return 0.6 + 0.4 * sin(1.328*beam_id + 2.382*ifreq + 0.883*it);\n}\n\n\n\/\/ -------------------------------------------------------------------------------------------------\n\n\nstruct unit_test_instance {\n static constexpr int maxbeams = 8;\n\n int nbeams = 0;\n int nupfreq = 0;\n int nfreq_coarse_per_packet = 0;\n int nt_per_packet = 0;\n int nt_per_chunk = 0;\n int nt_tot = 0;\n int fpga_counts_per_sample = 0;\n uint64_t initial_fpga_count = 0;\n float wt_cutoff = 0.0;\n\n vector<int> recv_beam_ids;\n vector<int> send_beam_ids;\n vector<int> send_freq_ids;\n int send_stride;\n\n \/\/ not protected by lock\n pthread_t consumer_threads[maxbeams]; \n shared_ptr<ch_frb_io::intensity_network_stream> istream;\n\n pthread_mutex_t lock;\n\n unit_test_instance(std::mt19937 &rng);\n ~unit_test_instance();\n\n void show() const;\n};\n\n\nunit_test_instance::unit_test_instance(std::mt19937 &rng)\n{\n const int nfreq_coarse = ch_frb_io::constants::nfreq_coarse;\n\n this->nbeams = randint(rng, 1, maxbeams+1);\n this->nupfreq = randint(rng, 1, 17);\n this->nfreq_coarse_per_packet = 1 << randint(rng,0,5);\n \n \/\/ nt_max = max possible nt_per_packet (before max packet size is exceeded)\n int header_nbytes = 24 + 2*nbeams + 2*nfreq_coarse_per_packet + 8*nbeams*nfreq_coarse_per_packet;\n int nbytes_per_nt = nbeams * nfreq_coarse_per_packet * nupfreq;\n int nt_max = (ch_frb_io::constants::max_output_udp_packet_size - header_nbytes) \/ nbytes_per_nt;\n\n assert(nt_max >= 3);\n this->nt_per_packet = randint(rng, nt_max\/2+1, nt_max+1);\n\n \/\/ FIXME increase nt_tot\n this->nt_per_chunk = nt_per_packet * randint(rng,1,5);\n this->nt_tot = nt_per_chunk * randint(rng,1,5);\n\n this->fpga_counts_per_sample = randint(rng, 1, 1025);\n this->initial_fpga_count = fpga_counts_per_sample * randint(rng, 0, 4097);\n this->wt_cutoff = uniform_rand(rng, 0.3, 0.7);\n\n \/\/ Clunky way of generating random beam_ids\n this->recv_beam_ids.resize(nbeams);\n for (int i = 0; i < nbeams; i++) {\n\tdo {\n\t recv_beam_ids[i] = randint(rng, 0, ch_frb_io::constants::max_allowed_beam_id);\n\t} while (array_contains(&recv_beam_ids[0], i, recv_beam_ids[i]));\n }\n\n \/\/ To slightly strengthen the test, we permute the receiver beams relative to sender\n this->send_beam_ids = recv_beam_ids;\n std::shuffle(send_beam_ids.begin(), send_beam_ids.end(), rng);\n\n \/\/ Randomly permute frequencies, just to strengthen the test\n this->send_freq_ids.resize(nfreq_coarse);\n for (int i = 0; i < nfreq_coarse; i++)\n\tsend_freq_ids[i] = i;\n std::shuffle(send_freq_ids.begin(), send_freq_ids.end(), rng);\n\n this->send_stride = randint(rng, nt_per_chunk, 2*nt_per_chunk+1);\n\n \/\/ Will be needed shortly for synchronization\n xpthread_mutex_init(&this->lock);\n}\n\n\nunit_test_instance::~unit_test_instance()\n{\n pthread_mutex_destroy(&lock);\n}\n\n\nvoid unit_test_instance::show() const\n{\n cout << \"nbeams=\" << nbeams << endl\n\t << \"nupfreq=\" << nupfreq << endl\n\t << \"nfreq_coarse_per_packet=\" << nfreq_coarse_per_packet << endl\n\t << \"nt_per_packet=\" << nt_per_packet << endl\n\t << \"nt_per_chunk=\" << nt_per_chunk << endl\n\t << \"nt_tot=\" << nt_tot << endl;\n}\n\n\n\/\/ -------------------------------------------------------------------------------------------------\n\n\nstruct consumer_thread_context {\n shared_ptr<ch_frb_io::intensity_beam_assembler> assembler;\n shared_ptr<unit_test_instance> tp;\n\n pthread_mutex_t lock;\n pthread_cond_t cond_running;\n bool is_running = false;\n\n consumer_thread_context(const shared_ptr<ch_frb_io::intensity_beam_assembler> &assembler_, const shared_ptr<unit_test_instance> &tp_)\n\t: assembler(assembler_), tp(tp_)\n {\n\txpthread_mutex_init(&lock);\n\txpthread_cond_init(&cond_running);\n }\n};\n\n\nstatic void *consumer_thread_main(void *opaque_arg)\n{\n consumer_thread_context *context = reinterpret_cast<consumer_thread_context *> (opaque_arg);\n shared_ptr<ch_frb_io::intensity_beam_assembler> assembler = context->assembler;\n shared_ptr<unit_test_instance> tp = context->tp;\n\n pthread_mutex_lock(&context->lock);\n context->is_running = true;\n pthread_cond_broadcast(&context->cond_running);\n pthread_mutex_unlock(&context->lock);\n\n \/\/ actual logic of the consumer thread goes here\n cerr << \"consumer_thread: artificially exiting\\n\";\n return NULL;\n}\n\n\nstatic void spawn_consumer_thread(const shared_ptr<ch_frb_io::intensity_beam_assembler> &assembler, const shared_ptr<unit_test_instance> &tp, int ibeam)\n{\n consumer_thread_context context(assembler, tp);\n\n int err = pthread_create(&tp->consumer_threads[ibeam], NULL, consumer_thread_main, &context);\n if (err)\n\tthrow runtime_error(string(\"pthread_create() failed to create consumer thread: \") + strerror(errno));\n\n pthread_mutex_lock(&context.lock);\n while (!context.is_running)\n\tpthread_cond_wait(&context.cond_running, &context.lock);\n pthread_mutex_unlock(&context.lock);\n}\n\n\nstatic void spawn_all_receive_threads(const shared_ptr<unit_test_instance> &tp)\n{\n vector<shared_ptr<ch_frb_io::intensity_beam_assembler> > assemblers;\n\n for (int ibeam = 0; ibeam < tp->nbeams; ibeam++) {\n\tauto assembler = ch_frb_io::intensity_beam_assembler::make(tp->recv_beam_ids[ibeam]);\n\tspawn_consumer_thread(assembler, tp, ibeam);\n\tassemblers.push_back(assembler);\n }\n\n tp->istream = intensity_network_stream::make(assemblers, ch_frb_io::constants::default_udp_port);\n}\n\n\n\/\/ -------------------------------------------------------------------------------------------------\n\n\nstatic void send_data(const shared_ptr<unit_test_instance> &tp)\n{\n const int nbeams = tp->nbeams;\n const int nupfreq = tp->nupfreq;\n const int nfreq_coarse = ch_frb_io::constants::nfreq_coarse;\n const int nt_chunk = tp->nt_per_chunk;\n const int nchunks = tp->nt_tot \/ tp->nt_per_chunk;\n const int stride = tp->send_stride;\n const int s2 = nupfreq * stride;\n const int s3 = nfreq_coarse * s2;\n\n string dstname = \"127.0.0.1:\" + to_string(ch_frb_io::constants::default_udp_port);\n\n \/\/ spawns network thread\n auto ostream = intensity_network_ostream::make(dstname, tp->send_beam_ids, tp->send_freq_ids, tp->nupfreq,\n\t\t\t\t\t\t tp->nt_per_chunk, tp->nfreq_coarse_per_packet, \n\t\t\t\t\t\t tp->nt_per_packet, tp->fpga_counts_per_sample,\n\t\t\t\t\t\t tp->wt_cutoff, 0.0);\n\n vector<float> intensity(nbeams * s3, 0.0);\n vector<float> weights(nbeams * s3, 0.0);\n\n for (int ichunk = 0; ichunk < nchunks; ichunk++) {\n\tint it0 = ichunk * nt_chunk; \/\/ start of chunk\n\n\tfor (int ibeam = 0; ibeam < nbeams; ibeam++) {\n\t int beam_id = tp->send_beam_ids[ibeam];\n\n\t for (int ifreq_coarse = 0; ifreq_coarse < nfreq_coarse; ifreq_coarse++) {\n\t\tint coarse_freq_id = tp->send_freq_ids[ifreq_coarse];\n\n\t\tfor (int iupfreq = 0; iupfreq < nupfreq; iupfreq++) {\n\t\t int ifreq_logical = coarse_freq_id * nupfreq + iupfreq;\n\t\t \n\t\t int row_start = ibeam*s3 + ifreq_coarse*s2 + iupfreq*stride;\n\t\t float *i_row = &intensity[row_start];\n\t\t float *w_row = &weights[row_start];\n\n\t\t for (int it = 0; it < nt_chunk; it++) {\n\t\t\ti_row[it] = intval(beam_id, ifreq_logical, it+it0);\n\t\t\tw_row[it] = wtval(beam_id, ifreq_logical, it+it0);\n\t\t }\n\t\t}\n\t }\n\t}\n\n\tuint64_t fpga_count = tp->initial_fpga_count + ichunk * nt_chunk * tp->fpga_counts_per_sample;\n\tostream->send_chunk(&intensity[0], &weights[0], stride, fpga_count, true);\n }\n\n \/\/ joins network thread\n ostream->end_stream(true);\n}\n\n\n\/\/ -------------------------------------------------------------------------------------------------\n\n\nint main(int argc, char **argv)\n{\n std::random_device rd;\n std::mt19937 rng(rd());\n\n for (int iouter = 0; iouter < 100; iouter++) {\n\tauto tp = make_shared<unit_test_instance> (rng);\n\ttp->show();\n\n\tspawn_all_receive_threads(tp);\n\ttp->istream->start_stream();\n\n\tsend_data(tp);\t\n\ttp->istream->end_stream(true); \/\/ join_threads=true\n\n\tfor (int ibeam = 0; ibeam < tp->nbeams; ibeam++) {\n\t int err = pthread_join(tp->consumer_threads[ibeam], NULL);\n\t if (err)\n\t\tthrow runtime_error(\"pthread_join() failed\");\n\t}\n }\n\n return 0;\n}\n<|endoftext|>"} {"text":"<commit_before>\/\/------------------------------------------------------------------------\r\n\/\/ csved_command.cpp\r\n\/\/\r\n\/\/ Base class for CSVED commands\r\n\/\/\r\n\/\/ Copyright (C) 2008 Neil Butterworth\r\n\/\/------------------------------------------------------------------------\r\n\r\n\r\n#include \"a_str.h\"\r\n#include \"a_csv.h\"\r\n#include \"csved_command.h\"\r\n#include \"csved_except.h\"\r\n#include \"csved_strings.h\"\r\n\r\nusing std::string;\r\nusing std::vector;\r\n\r\nnamespace CSVED {\r\n\r\n\/\/----------------------------------------------------------------------------\r\n\/\/ This is the help for the generic flags\r\n\/\/----------------------------------------------------------------------------\r\n\r\nconst char * const GEN_SEED = \" -seed n\\tseed to be used by random() function\\n\";\r\nconst char * const GEN_SEP = \" -sep s\\tspecify CSV field separator character\\n\";\r\nconst char * const GEN_RSEP = \" -rsep s\\tas for -sep but retain separator on output\\n\";\r\nconst char * const GEN_OSEP = \" -osep s\\tspecifies output separator\\n\";\r\nconst char * const GEN_IBL = \" -ibl\\t\\tignore blank input lines\\n\";\r\nconst char * const GEN_IFN = \" -ifn\\t\\tignore field name record\\n\";\r\nconst char * const GEN_SMQ = \" -smq\\t\\tuse smart quotes on output\\n\";\r\nconst char * const GEN_SQF = \" -sqf fields\\tspecify fields that must be quoted\\n\";\r\nconst char * const GEN_OFL\t= \" -o file\\twrite output to file \"\r\n\t\t\t\t\t\t\t\t\t\"rather than standard output\\n\";\r\n\r\nconst char * const GEN_SKIP = \" -skip t\\tif test t is true, do not process or output record\\n\";\r\nconst char * const GEN_PASS = \" -pass t\\tif test t is true, output CSV record as is\\n\";\r\n\r\n\r\n\r\n\/\/------------------------------------------------------------------------\r\n\/\/ Construct from command name, short description and list of flags\r\n\/\/ that can be used with this command.\r\n\/\/---------------------------------------------------------------------------\r\n\r\nCommand :: Command( const string & name,\r\n\t\t\t\t\t\tconst string & desc)\r\n\t: mName( name ), mDesc( desc ) {\r\n}\r\n\r\nCommand :: Command( const string & name,\r\n\t\t\t\t\t\tconst string & desc,\r\n\t\t\t\t\t\tconst string & help )\r\n\t: mName( name ), mDesc( desc ), mHelp( help ){\r\n}\r\n\r\n\/\/---------------------------------------------------------------------------\r\n\/\/ Do-nothing dtor\r\n\/\/---------------------------------------------------------------------------\r\n\r\nCommand :: ~Command() {\r\n\t\/\/ nothing\r\n}\r\n\r\n\/\/---------------------------------------------------------------------------\r\n\/\/ accessors\r\n\/\/---------------------------------------------------------------------------\r\n\r\nstring Command :: Name() const {\r\n\treturn mName;\r\n}\r\n\r\nstring Command :: Desc() const {\r\n\treturn mDesc;\r\n}\r\n\r\n\r\nvoid Command :: AddHelp( const string & help ) {\r\n\tmHelp = help;\r\n}\r\n\r\n\/\/----------------------------------------------------------------------------\r\n\/\/ Expressions to test whether an input row should be skipped or passed\r\n\/\/ through as is.\r\n\/\/----------------------------------------------------------------------------\r\n\r\nvoid Command :: GetSkipOptions( const ALib::CommandLine & cl ) {\r\n\r\n\tmSkipExpr = ALib::Expression();\r\n\tmPassExpr = ALib::Expression();\r\n\r\n\tif ( cl.HasFlag( FLAG_SKIP ) ) {\r\n\t\tstring expr = cl.GetValue( FLAG_SKIP );\r\n\t\tmSkipExpr.Compile( expr );\r\n\t}\r\n\tif ( cl.HasFlag( FLAG_PASS ) ) {\r\n\t\tstring expr = cl.GetValue( FLAG_PASS );\r\n\t\tmPassExpr.Compile( expr );\r\n\t}\r\n}\r\n\r\nstatic void SetPosParams( ALib::Expression & e, const CSVRow & r ) {\r\n\te.ClearPosParams();\r\n\tfor( unsigned int i = 0; i < r.size(); i++ ) {\r\n\t\te.AddPosParam( r[i] );\r\n\t}\r\n}\r\n\r\nstatic bool EvalSkipPass( ALib::Expression & e, const CSVRow & r ) {\r\n\tif ( e.IsCompiled() ) {\r\n\t\tSetPosParams( e, r );\r\n\t\tstring ev = e.Evaluate();\r\n\t\treturn ev == \"0\" ? false : true;\r\n\t}\r\n\telse {\r\n\t\treturn false;\r\n\t}\r\n}\r\n\r\nbool Command :: Skip( const CSVRow & r ) {\r\n\treturn EvalSkipPass( mSkipExpr, r );\r\n}\r\n\r\nbool Command :: Pass( const CSVRow & r ) {\r\n\treturn EvalSkipPass( mPassExpr, r );\r\n}\r\n\r\n\/\/----------------------------------------------------------------------------\r\n\/\/ Process help text. May contain a terminal section preceded by a # char\r\n\/\/ containing names of the generic flags applicable to this command. The\r\n\/\/ name \"ALL\" means the command can support all generic flags.\r\n\/\/\r\n\/\/ ToDo: This is a mess and needs rethinking. But it does \"work\".\r\n\/\/----------------------------------------------------------------------------\r\n\r\nconst char GFL_DELIM = '#';\r\n\r\nstring Command :: Help() const {\r\n\r\n\tif ( mHelp == \"\" ) {\t\/\/ no help written yet\r\n\t\treturn \"\";\r\n\t}\r\n\r\n\tvector <string> tmp;\r\n\tALib::Split( mHelp, GFL_DELIM, tmp );\r\n\tif ( tmp.size() > 1 ) {\r\n\t\ttmp[0] += \"\\n\";\r\n\t\tif ( tmp[1] == \"ALL\" ) {\r\n\t\t\ttmp[1] =\"IBL,IFN,SMQ,OFL,SEP\";\r\n\t\t}\r\n\t\tif ( tmp[1].find( \"IBL\" ) != string::npos ) {\r\n\t\t\ttmp[0] += GEN_IBL;\r\n\t\t}\r\n\t\tif ( tmp[1].find( \"SEP\" ) != string::npos ) {\r\n\t\t\t\/\/ if you can specify a CSV separator you can specify & retain\r\n\t\t\ttmp[0] += GEN_SEP;\r\n\t\t\ttmp[0] += GEN_RSEP;\r\n\t\t\ttmp[0] += GEN_OSEP;\r\n\t\t}\r\n\t\tif ( tmp[1].find( \"IFN\" ) != string::npos ) {\r\n\t\t\ttmp[0] += GEN_IFN;\r\n\t\t}\r\n\t\tif ( tmp[1].find( \"SMQ\" ) != string::npos ) {\r\n\t\t\t\/\/ if you can specify smart quotes, you can specify a quote list\r\n\t\t\ttmp[0] += GEN_SMQ;\r\n\t\t\ttmp[0] += GEN_SQF;\r\n\t\t}\r\n\t\tif ( tmp[1].find( \"OFL\" ) != string::npos ) {\r\n\t\t\ttmp[0] += GEN_OFL;\r\n\t\t}\r\n\t\tif ( tmp[1].find( \"SKIP\" ) != string::npos ) {\r\n\t\t\ttmp[0] += GEN_SKIP;\r\n\t\t}\r\n\t\tif ( tmp[1].find( \"PASS\" ) != string::npos ) {\r\n\t\t\ttmp[0] += GEN_PASS;\r\n\t\t}\r\n\t}\r\n\treturn tmp[0];\r\n}\r\n\r\n\/\/---------------------------------------------------------------------------\r\n\/\/ Give my flags to the command line & then get it to check them\r\n\/\/---------------------------------------------------------------------------\r\n\r\n\r\nvoid Command :: CheckFlags( ALib::CommandLine & cmd ) {\r\n\r\n\tfor ( unsigned int i = 0; i < mFlags.size(); i++ ) {\r\n\t\tcmd.AddFlag( mFlags[i] );\r\n\t}\r\n\r\n\t\/\/ all commands can have output flag and can ignore blank lines\r\n\t\/\/ also now can have smart quotes and ignore col header\r\n\tcmd.AddFlag( ALib::CommandLineFlag( FLAG_OUT, false, 1 ) );\r\n\tcmd.AddFlag( ALib::CommandLineFlag( FLAG_IGNBL, false, 0 ) );\r\n\tcmd.AddFlag( ALib::CommandLineFlag( FLAG_SMARTQ, false, 0 ) );\r\n\tcmd.AddFlag( ALib::CommandLineFlag( FLAG_ICNAMES, false, 0 ) );\r\n\tcmd.AddFlag( ALib::CommandLineFlag( FLAG_CSVSEP, false, 1 ) );\r\n\tcmd.AddFlag( ALib::CommandLineFlag( FLAG_CSVSEPR, false, 1 ) );\r\n\tcmd.AddFlag( ALib::CommandLineFlag( FLAG_OUTSEP, false, 1 ) );\r\n\tcmd.AddFlag( ALib::CommandLineFlag( FLAG_QLIST, false, 1 ) );\r\n\tcmd.AddFlag( ALib::CommandLineFlag( FLAG_RFSEED, false, 1 ) );\r\n\r\n\tvector <string> tmp;\r\n\tALib::Split( mHelp, GFL_DELIM, tmp );\r\n\tif ( tmp.size() > 1 && tmp[1].find( \"SKIP\" ) != string::npos ) {\r\n\t\tcmd.AddFlag( ALib::CommandLineFlag( FLAG_SKIP, false, 1 ) );\r\n\t\tcmd.AddFlag( ALib::CommandLineFlag( FLAG_PASS, false, 1 ) );\r\n\t}\r\n\r\n\tcmd.CheckFlags( 2 );\t\t\/\/ don't check the command name\r\n\r\n}\r\n\r\n\/\/----------------------------------------------------------------------------\r\n\/\/ Provide count of flags excluding the generic ones\r\n\/\/----------------------------------------------------------------------------\r\n\r\nint Command :: CountNonGeneric( const ALib::CommandLine & cmd ) const {\r\n\r\n\tint n = 0;\r\n\r\n\tfor ( int i = 0; i < cmd.Argc(); i++ ) {\r\n\t\tif ( ALib::StrFirst( cmd.Argv(i) ) == '-' ) {\r\n\t\t\tstring arg = cmd.Argv( i );\r\n\t\t\tif ( arg != FLAG_OUT\r\n\t\t\t\t&& arg != FLAG_IGNBL\r\n\t\t\t\t&& arg != FLAG_SMARTQ\r\n\t\t\t\t&& arg != FLAG_CSVSEP\r\n\t\t\t\t&& arg != FLAG_OUTSEP\r\n\t\t\t\t&& arg != FLAG_PASS\r\n\t\t\t\t&& arg != FLAG_ICNAMES ) {\r\n\t\t\t\t\tn++;\r\n\t\t\t}\r\n\t\t}\r\n\t}\r\n\r\n\treturn n;\r\n}\r\n\r\n\/\/---------------------------------------------------------------------------\r\n\/\/ Add flag to allowed flags for a command\r\n\/\/---------------------------------------------------------------------------\r\n\r\nvoid Command :: AddFlag( const ALib::CommandLineFlag & f ) {\r\n\tmFlags.push_back( f );\r\n}\r\n\r\n\/\/------------------------------------------------------------------------\r\n\r\n}\t\/\/ end namespace\r\n\r\n\/\/ end\r\n<commit_msg>fixed problem with built-in help<commit_after>\/\/------------------------------------------------------------------------\r\n\/\/ csved_command.cpp\r\n\/\/\r\n\/\/ Base class for CSVED commands\r\n\/\/\r\n\/\/ Copyright (C) 2008 Neil Butterworth\r\n\/\/------------------------------------------------------------------------\r\n\r\n\r\n#include \"a_str.h\"\r\n#include \"a_csv.h\"\r\n#include \"csved_command.h\"\r\n#include \"csved_except.h\"\r\n#include \"csved_strings.h\"\r\n\r\nusing std::string;\r\nusing std::vector;\r\n\r\nnamespace CSVED {\r\n\r\n\/\/----------------------------------------------------------------------------\r\n\/\/ This is the help for the generic flags\r\n\/\/----------------------------------------------------------------------------\r\n\r\nconst char * const GEN_SEED = \" -seed n\\tseed to be used by random() function\\n\";\r\nconst char * const GEN_SEP = \" -sep s\\tspecify CSV field separator character\\n\";\r\nconst char * const GEN_RSEP = \" -rsep s\\tas for -sep but retain separator on output\\n\";\r\nconst char * const GEN_OSEP = \" -osep s\\tspecifies output separator\\n\";\r\nconst char * const GEN_IBL = \" -ibl\\t\\tignore blank input lines\\n\";\r\nconst char * const GEN_IFN = \" -ifn\\t\\tignore field name record\\n\";\r\nconst char * const GEN_SMQ = \" -smq\\t\\tuse smart quotes on output\\n\";\r\nconst char * const GEN_SQF = \" -sqf fields\\tspecify fields that must be quoted\\n\";\r\nconst char * const GEN_OFL\t= \" -o file\\twrite output to file \"\r\n\t\t\t\t\t\t\t\t\t\"rather than standard output\\n\";\r\n\r\nconst char * const GEN_SKIP = \" -skip t\\tif test t is true, do not process or output record\\n\";\r\nconst char * const GEN_PASS = \" -pass t\\tif test t is true, output CSV record as is\\n\";\r\n\r\n\r\n\r\n\/\/------------------------------------------------------------------------\r\n\/\/ Construct from command name, short description and list of flags\r\n\/\/ that can be used with this command.\r\n\/\/---------------------------------------------------------------------------\r\n\r\nCommand :: Command( const string & name,\r\n\t\t\t\t\t\tconst string & desc)\r\n\t: mName( name ), mDesc( desc ) {\r\n}\r\n\r\nCommand :: Command( const string & name,\r\n\t\t\t\t\t\tconst string & desc,\r\n\t\t\t\t\t\tconst string & help )\r\n\t: mName( name ), mDesc( desc ), mHelp( help ){\r\n}\r\n\r\n\/\/---------------------------------------------------------------------------\r\n\/\/ Do-nothing dtor\r\n\/\/---------------------------------------------------------------------------\r\n\r\nCommand :: ~Command() {\r\n\t\/\/ nothing\r\n}\r\n\r\n\/\/---------------------------------------------------------------------------\r\n\/\/ accessors\r\n\/\/---------------------------------------------------------------------------\r\n\r\nstring Command :: Name() const {\r\n\treturn mName;\r\n}\r\n\r\nstring Command :: Desc() const {\r\n\treturn mDesc;\r\n}\r\n\r\n\r\nvoid Command :: AddHelp( const string & help ) {\r\n\tmHelp = help;\r\n}\r\n\r\n\/\/----------------------------------------------------------------------------\r\n\/\/ Expressions to test whether an input row should be skipped or passed\r\n\/\/ through as is.\r\n\/\/----------------------------------------------------------------------------\r\n\r\nvoid Command :: GetSkipOptions( const ALib::CommandLine & cl ) {\r\n\r\n\tmSkipExpr = ALib::Expression();\r\n\tmPassExpr = ALib::Expression();\r\n\r\n\tif ( cl.HasFlag( FLAG_SKIP ) ) {\r\n\t\tstring expr = cl.GetValue( FLAG_SKIP );\r\n\t\tmSkipExpr.Compile( expr );\r\n\t}\r\n\tif ( cl.HasFlag( FLAG_PASS ) ) {\r\n\t\tstring expr = cl.GetValue( FLAG_PASS );\r\n\t\tmPassExpr.Compile( expr );\r\n\t}\r\n}\r\n\r\nstatic void SetPosParams( ALib::Expression & e, const CSVRow & r ) {\r\n\te.ClearPosParams();\r\n\tfor( unsigned int i = 0; i < r.size(); i++ ) {\r\n\t\te.AddPosParam( r[i] );\r\n\t}\r\n}\r\n\r\nstatic bool EvalSkipPass( ALib::Expression & e, const CSVRow & r ) {\r\n\tif ( e.IsCompiled() ) {\r\n\t\tSetPosParams( e, r );\r\n\t\tstring ev = e.Evaluate();\r\n\t\treturn ev == \"0\" ? false : true;\r\n\t}\r\n\telse {\r\n\t\treturn false;\r\n\t}\r\n}\r\n\r\nbool Command :: Skip( const CSVRow & r ) {\r\n\treturn EvalSkipPass( mSkipExpr, r );\r\n}\r\n\r\nbool Command :: Pass( const CSVRow & r ) {\r\n\treturn EvalSkipPass( mPassExpr, r );\r\n}\r\n\r\n\/\/----------------------------------------------------------------------------\r\n\/\/ Process help text. May contain a terminal section preceded by a # char\r\n\/\/ containing names of the generic flags applicable to this command. The\r\n\/\/ name \"ALL\" means the command can support all generic flags.\r\n\/\/\r\n\/\/ ToDo: This is a mess and needs rethinking. But it does \"work\".\r\n\/\/----------------------------------------------------------------------------\r\n\r\nconst char GFL_DELIM = '#';\r\n\r\nstring Command :: Help() const {\r\n\r\n\tif ( mHelp == \"\" ) {\t\/\/ no help written yet\r\n\t\treturn \"\";\r\n\t}\r\n\r\n\tvector <string> tmp;\r\n\tALib::Split( mHelp, GFL_DELIM, tmp );\r\n\tif ( tmp.size() > 1 ) {\r\n\t\ttmp[0] += \"\\n\";\r\n\t\tif ( tmp[1].find( \"ALL\" ) != string::npos ) {\r\n\t\t\ttmp[1] +=\"IBL,IFN,SMQ,OFL,SEP\";\r\n\t\t}\r\n\t\tif ( tmp[1].find( \"IBL\" ) != string::npos ) {\r\n\t\t\ttmp[0] += GEN_IBL;\r\n\t\t}\r\n\t\tif ( tmp[1].find( \"SEP\" ) != string::npos ) {\r\n\t\t\t\/\/ if you can specify a CSV separator you can specify & retain\r\n\t\t\ttmp[0] += GEN_SEP;\r\n\t\t\ttmp[0] += GEN_RSEP;\r\n\t\t\ttmp[0] += GEN_OSEP;\r\n\t\t}\r\n\t\tif ( tmp[1].find( \"IFN\" ) != string::npos ) {\r\n\t\t\ttmp[0] += GEN_IFN;\r\n\t\t}\r\n\t\tif ( tmp[1].find( \"SMQ\" ) != string::npos ) {\r\n\t\t\t\/\/ if you can specify smart quotes, you can specify a quote list\r\n\t\t\ttmp[0] += GEN_SMQ;\r\n\t\t\ttmp[0] += GEN_SQF;\r\n\t\t}\r\n\t\tif ( tmp[1].find( \"OFL\" ) != string::npos ) {\r\n\t\t\ttmp[0] += GEN_OFL;\r\n\t\t}\r\n\t\tif ( tmp[1].find( \"SKIP\" ) != string::npos ) {\r\n\t\t\ttmp[0] += GEN_SKIP;\r\n\t\t}\r\n\t\tif ( tmp[1].find( \"PASS\" ) != string::npos ) {\r\n\t\t\ttmp[0] += GEN_PASS;\r\n\t\t}\r\n\t}\r\n\treturn tmp[0];\r\n}\r\n\r\n\/\/---------------------------------------------------------------------------\r\n\/\/ Give my flags to the command line & then get it to check them\r\n\/\/---------------------------------------------------------------------------\r\n\r\n\r\nvoid Command :: CheckFlags( ALib::CommandLine & cmd ) {\r\n\r\n\tfor ( unsigned int i = 0; i < mFlags.size(); i++ ) {\r\n\t\tcmd.AddFlag( mFlags[i] );\r\n\t}\r\n\r\n\t\/\/ all commands can have output flag and can ignore blank lines\r\n\t\/\/ also now can have smart quotes and ignore col header\r\n\tcmd.AddFlag( ALib::CommandLineFlag( FLAG_OUT, false, 1 ) );\r\n\tcmd.AddFlag( ALib::CommandLineFlag( FLAG_IGNBL, false, 0 ) );\r\n\tcmd.AddFlag( ALib::CommandLineFlag( FLAG_SMARTQ, false, 0 ) );\r\n\tcmd.AddFlag( ALib::CommandLineFlag( FLAG_ICNAMES, false, 0 ) );\r\n\tcmd.AddFlag( ALib::CommandLineFlag( FLAG_CSVSEP, false, 1 ) );\r\n\tcmd.AddFlag( ALib::CommandLineFlag( FLAG_CSVSEPR, false, 1 ) );\r\n\tcmd.AddFlag( ALib::CommandLineFlag( FLAG_OUTSEP, false, 1 ) );\r\n\tcmd.AddFlag( ALib::CommandLineFlag( FLAG_QLIST, false, 1 ) );\r\n\tcmd.AddFlag( ALib::CommandLineFlag( FLAG_RFSEED, false, 1 ) );\r\n\r\n\tvector <string> tmp;\r\n\tALib::Split( mHelp, GFL_DELIM, tmp );\r\n\tif ( tmp.size() > 1 && tmp[1].find( \"SKIP\" ) != string::npos ) {\r\n\t\tcmd.AddFlag( ALib::CommandLineFlag( FLAG_SKIP, false, 1 ) );\r\n\t\tcmd.AddFlag( ALib::CommandLineFlag( FLAG_PASS, false, 1 ) );\r\n\t}\r\n\r\n\tcmd.CheckFlags( 2 );\t\t\/\/ don't check the command name\r\n\r\n}\r\n\r\n\/\/----------------------------------------------------------------------------\r\n\/\/ Provide count of flags excluding the generic ones\r\n\/\/----------------------------------------------------------------------------\r\n\r\nint Command :: CountNonGeneric( const ALib::CommandLine & cmd ) const {\r\n\r\n\tint n = 0;\r\n\r\n\tfor ( int i = 0; i < cmd.Argc(); i++ ) {\r\n\t\tif ( ALib::StrFirst( cmd.Argv(i) ) == '-' ) {\r\n\t\t\tstring arg = cmd.Argv( i );\r\n\t\t\tif ( arg != FLAG_OUT\r\n\t\t\t\t&& arg != FLAG_IGNBL\r\n\t\t\t\t&& arg != FLAG_SMARTQ\r\n\t\t\t\t&& arg != FLAG_CSVSEP\r\n\t\t\t\t&& arg != FLAG_OUTSEP\r\n\t\t\t\t&& arg != FLAG_PASS\r\n\t\t\t\t&& arg != FLAG_ICNAMES ) {\r\n\t\t\t\t\tn++;\r\n\t\t\t}\r\n\t\t}\r\n\t}\r\n\r\n\treturn n;\r\n}\r\n\r\n\/\/---------------------------------------------------------------------------\r\n\/\/ Add flag to allowed flags for a command\r\n\/\/---------------------------------------------------------------------------\r\n\r\nvoid Command :: AddFlag( const ALib::CommandLineFlag & f ) {\r\n\tmFlags.push_back( f );\r\n}\r\n\r\n\/\/------------------------------------------------------------------------\r\n\r\n}\t\/\/ end namespace\r\n\r\n\/\/ end\r\n<|endoftext|>"} {"text":"<commit_before>#include \"era.hpp\"\n#include <unistd.h> \/\/ getcwd\n#include <sys\/stat.h>\n\nnamespace era01 {\n\nFile::File() {\n sFQName.assign(home(\"default_era.log\"));\n}\n\nFile::File(string fname) {\n if (this->pdir.find(\"\\\\\") == -1) {\n if (this->pdir.find(\"\/\") == -1) {\n fname = home(fname);\n }\n }\n sFQName.assign(fname);\n}\n\nFile::File(const File& file) {\n this->sFQName = string(file.sFQName);\n this->type = file.type;\n}\n\nFile::~File() {\n close();\n}\n\nconst char* File::name() {\n return this->sFQName.c_str();\n}\n\nFileType File::mode() {\n return this->type;\n}\n\nvoid File::assign(const File& file) {\n close();\n sFQName.assign(file.sFQName);\n pdir.assign(file.pdir);\n type = file.type;\n}\n\nstring File::home(string node) {\n const char* cwd = getcwd(NULL, 0);\n stringstream srm;\n srm << cwd;\n if (this->pdir.find(\"\\\\\") != -1) {\n srm << \"\\\\\";\n } else {\n srm << \"\/\";\n }\n srm << node << ends;\n delete cwd; \/\/ stop a leak\n return srm.str();\n}\n\nistream& File::openRead(FileType at) {\n close();\n pIOStream = new fstream;\n\n if (at == AT_BINARY)\n pIOStream->open(sFQName.c_str(), ios::in | ios::binary);\n else\n pIOStream->open(sFQName.c_str(), ios::in);\n return *pIOStream;\n}\n\nostream& File::openWrite(FileType at) {\n close();\n remove(); \/\/ For the benefit of Microsoft's legacy.\n pIOStream = new fstream;\n\n if (at == AT_BINARY)\n pIOStream->open(sFQName.c_str(), ios::out | ios::binary);\n else\n pIOStream->open(sFQName.c_str(), ios::out);\n return *pIOStream;\n}\n\nostream& File::openAppend(FileType at) {\n close();\n delete pIOStream;\n pIOStream = NULL;\n pIOStream = new fstream;\n\n if (at == AT_BINARY)\n pIOStream->open(sFQName.c_str(), ios::out | ios::app | ios::binary);\n else\n pIOStream->open(sFQName.c_str(), ios::out | ios::app);\n return *pIOStream;\n}\n\niostream& File::openReadWrite(FileType at) {\n close();\n delete pIOStream;\n pIOStream = NULL;\n pIOStream = new fstream;\n\n if (at == AT_BINARY)\n pIOStream->open(sFQName.c_str(), ios::in | ios::out | ios::binary);\n else\n pIOStream->open(sFQName.c_str(), ios::in | ios::out);\n return *pIOStream;\n}\n\nvoid File::close(void) {\n if (pIOStream != NULL)\n pIOStream->close();\n pIOStream = NULL;\n}\n\nbool File::remove(void) {\n close();\n if (sFQName.size() == 0)\n return true;\n if (::remove(sFQName.c_str()))\n return false;\n return true;\n}\n\nbool File::exists() {\n struct stat info;\n if (::stat(sFQName.c_str(), &info) != 0)\n return false;\n return true;\n}\n\n} \/\/ namespace\n<commit_msg>Modernized<commit_after>#include \"era.hpp\"\n#include <unistd.h> \/\/ getcwd\n#include <sys\/stat.h>\n\nnamespace era01 {\n\nFile::File() {\n sFQName.assign(home(\"default_era.log\"));\n}\n\nFile::File(string fname) {\n if (this->pdir.find(\"\\\\\") == -1) {\n if (this->pdir.find(\"\/\") == -1) {\n fname = home(fname);\n }\n }\n sFQName.assign(fname);\n}\n\nFile::File(const File& file) {\n this->sFQName = string(file.sFQName);\n this->type = file.type;\n}\n\nFile::~File() {\n close();\n}\n\nconst char* File::name() {\n return this->sFQName.c_str();\n}\n\nFileType File::mode() {\n return this->type;\n}\n\nvoid File::assign(const File& file) {\n close();\n sFQName.assign(file.sFQName);\n pdir.assign(file.pdir);\n type = file.type;\n}\n\nstring File::home(string node) {\n const char* cwd = getcwd(nullptr, 0);\n stringstream srm;\n srm << cwd;\n if (this->pdir.find(\"\\\\\") != -1) {\n srm << \"\\\\\";\n } else {\n srm << \"\/\";\n }\n srm << node << ends;\n delete cwd; \/\/ stop a leak\n return srm.str();\n}\n\nistream& File::openRead(FileType at) {\n close();\n pIOStream = new fstream;\n\n if (at == AT_BINARY)\n pIOStream->open(sFQName.c_str(), ios::in | ios::binary);\n else\n pIOStream->open(sFQName.c_str(), ios::in);\n return *pIOStream;\n}\n\nostream& File::openWrite(FileType at) {\n close();\n remove(); \/\/ For the benefit of Microsoft's legacy.\n pIOStream = new fstream;\n\n if (at == AT_BINARY)\n pIOStream->open(sFQName.c_str(), ios::out | ios::binary);\n else\n pIOStream->open(sFQName.c_str(), ios::out);\n return *pIOStream;\n}\n\nostream& File::openAppend(FileType at) {\n close();\n delete pIOStream;\n pIOStream = nullptr;\n pIOStream = new fstream;\n\n if (at == AT_BINARY)\n pIOStream->open(sFQName.c_str(), ios::out | ios::app | ios::binary);\n else\n pIOStream->open(sFQName.c_str(), ios::out | ios::app);\n return *pIOStream;\n}\n\niostream& File::openReadWrite(FileType at) {\n close();\n delete pIOStream;\n pIOStream = nullptr;\n pIOStream = new fstream;\n\n if (at == AT_BINARY)\n pIOStream->open(sFQName.c_str(), ios::in | ios::out | ios::binary);\n else\n pIOStream->open(sFQName.c_str(), ios::in | ios::out);\n return *pIOStream;\n}\n\nvoid File::close(void) {\n if (pIOStream != nullptr)\n pIOStream->close();\n pIOStream = nullptr;\n}\n\nbool File::remove(void) {\n close();\n if (sFQName.size() == 0)\n return true;\n if (::remove(sFQName.c_str()))\n return false;\n return true;\n}\n\nbool File::exists() {\n struct stat info;\n if (::stat(sFQName.c_str(), &info) != 0)\n return false;\n return true;\n}\n\n} \/\/ namespace\n<|endoftext|>"} {"text":"<commit_before>\/*\n *\n * Copyright (C) 2009, Joacim Jacobsson ( j dot jacobsson at gmail dot com )\n * All rights reserved.\n *\n * See LICENSE file for details\n *\n *\/\n\n#include \"BehaviorTreeNode.h\"\n#include \"..\/NodeToNodeArrow.h\"\n#include <btree\/btree.h>\n\n#include <QtGui\/QtGui>\n#include <QtSvg\/QSvgRenderer>\n\nconst char* const g_NodeResourcePaths[_E_MAX_GRIST_TYPES_] = {\n\t\":\/nodes\/unknown.svg\",\n\t\":\/nodes\/sequence.svg\",\n\t\":\/nodes\/selector.svg\",\n\t\":\/nodes\/parallel.svg\",\n\t\":\/nodes\/dyn_selector.svg\",\n\t\":\/nodes\/decorator.svg\",\n\t\":\/nodes\/action.svg\"\n};\n\nBehaviorTreeNode::BehaviorTreeNode( Node* n, BehaviorTreeNode* parent )\n\t: QGraphicsSvgItem( g_NodeResourcePaths[n->m_Grist.m_Type] )\n\t, m_Node( n )\n\t, m_MouseState( E_MS_NONE )\n\t, m_DraggingArrow( 0x0 )\n{\n\tsetFlag( QGraphicsItem::ItemIsMovable, true );\n\tsetFlag( QGraphicsItem::ItemIsSelectable, true );\n\tsetFlag( QGraphicsItem::ItemStacksBehindParent, false );\n\n\tif( parent )\n\t\tsetParentItem( parent );\n\tsetZValue( 0.0 );\n}\n\nvoid BehaviorTreeNode::removeArrow(NodeToNodeArrow *arrow)\n{\n\tint index = m_Arrows.indexOf(arrow);\n\n\tif (index != -1)\n\t\tm_Arrows.removeAt(index);\n}\n\nvoid BehaviorTreeNode::removeArrows()\n{\n\tforeach( NodeToNodeArrow *arrow, m_Arrows )\n\t{\n\t\tarrow->startItem()->removeArrow(arrow);\n\t\tarrow->endItem()->removeArrow(arrow);\n\t\tscene()->removeItem(arrow);\n\t\tdelete arrow;\n\t}\n}\n\nvoid BehaviorTreeNode::addArrow(NodeToNodeArrow *arrow)\n{\n\tm_Arrows.append(arrow);\n}\n\nNodeToNodeArrow* BehaviorTreeNode::findArrowTo( BehaviorTreeNode* other )\n{\n\tforeach( NodeToNodeArrow *arrow, m_Arrows )\n\t{\n\t\tif( arrow->startItem() == this && arrow->endItem() == other )\n\t\t\treturn arrow;\n\t\tif( arrow->startItem() == other && arrow->endItem() == this )\n\t\t\treturn arrow;\n\t}\n\treturn 0x0;\n}\n\nQVariant BehaviorTreeNode::itemChange( GraphicsItemChange change, const QVariant &value )\n{\n\tswitch( change )\n\t{\n\tcase ItemSelectedChange:\n\t\tupdate();\n\t\tbreak;\n\tcase ItemPositionChange:\n\t\tbreak;\n\t}\n\treturn QGraphicsSvgItem::itemChange( change, value );\n}\n\nvoid BehaviorTreeNode::mousePressEvent( QGraphicsSceneMouseEvent* event )\n{\n\tif( event->button() == Qt::LeftButton )\n\t{\n\t\tm_MouseState = E_MS_LB_DOWN;\n\t\tm_StartPos = event->screenPos();\n\t}\n\tQGraphicsSvgItem::mousePressEvent( event );\n}\n\nvoid BehaviorTreeNode::mouseReleaseEvent( QGraphicsSceneMouseEvent* event )\n{\n\tif( event->button() == Qt::LeftButton )\n\t{\n\t\tif( m_MouseState == E_MS_DRAGGING )\n\t\t\tdraggingEnded();\n\n\t\tm_MouseState = E_MS_NONE;\n\t\tsetZValue( 0.0 );\n\t}\n\tQGraphicsSvgItem::mouseReleaseEvent( event );\n}\n\nvoid BehaviorTreeNode::mouseMoveEvent( QGraphicsSceneMouseEvent* event )\n{\n\tif( m_MouseState == E_MS_LB_DOWN )\n\t{\n\t\tif( m_StartPos != event->screenPos() )\n\t\t{\n\n\t\t\tm_MouseState = E_MS_DRAGGING;\n\t\t\tsetZValue( 1.0 );\n\t\t}\n\t}\n\tQGraphicsSvgItem::mouseMoveEvent( event );\n}\n\nvoid BehaviorTreeNode::draggingStarted()\n{\n\tif( parentItem() )\n\t{\n\t\tBehaviorTreeNode* p = (BehaviorTreeNode*)parentItem();\n\t\tm_DraggingArrow = findArrowTo( p );\n\t\tp->removeArrow( m_DraggingArrow );\n\t\tm_DraggingArrow->setDashed( true );\n\t\tm_DraggingArrow->setStartAndEnd( this, p );\n\n\t\tQPointF position( scenePos() );\n\t\tsetParentItem( 0x0 );\n\t\tsetPos( position );\n\t}\n\telse\n\t{\n\t\tm_DraggingArrow = new NodeToNodeArrow( this, 0x0, scene() );\n\t\tm_DraggingArrow->setDashed( true );\n\t\taddArrow( m_DraggingArrow );\n\t}\n\n\tsetupRelinkage();\n}\n\nvoid BehaviorTreeNode::draggingEnded()\n{\n\tif( m_Relinkage.m_Parent )\n\t{\n\t\tBehaviorTreeNode* p = (BehaviorTreeNode*)m_Relinkage.m_Parent->m_UserData;\n\t\tsetPos( p->mapFromScene( scenePos() ) );\n\t\tsetParentItem( p );\n\n\t\tp->addArrow( m_DraggingArrow );\n\t\tm_DraggingArrow->setStartAndEnd( p, this );\n\t\tm_DraggingArrow->setDashed( false );\n\t\tm_DraggingArrow = 0x0;\n\t}\n\telse\n\t{\n\t\tremoveArrow( m_DraggingArrow );\n\t\tdelete m_DraggingArrow;\n\t\tm_DraggingArrow = 0x0;\n\t}\n\n\texecuteRelinkage();\n\n\temit nodeDragged();\n}\n\nvoid BehaviorTreeNode::setupRelinkage()\n{\n\tm_Relinkage.m_Parent = m_Node->m_Pare;\n\tif( m_Node->m_Prev )\n\t{\n\t\tm_Relinkage.m_Sibling\t\t= m_Node->m_Prev;\n\t\tm_Relinkage.m_BeforeSibling\t= false;\n\t}\n\telse if( m_Node->m_Next )\n\t{\n\t\tm_Relinkage.m_Sibling\t\t= m_Node->m_Next;\n\t\tm_Relinkage.m_BeforeSibling\t= true;\n\t}\n\telse\n\t{\n\t\tm_Relinkage.m_Sibling\t\t= 0x0;\n\t\tm_Relinkage.m_BeforeSibling = false;\n\t}\n\tUnlinkNodeFromParentAndSiblings( m_Node );\n}\n\nvoid BehaviorTreeNode::executeRelinkage()\n{\n\tif( m_Relinkage.m_Parent )\n\t\tm_Node->m_Pare = m_Relinkage.m_Parent;\n\n\tif( m_Relinkage.m_Sibling )\n\t{\n\t\tif( m_Relinkage.m_BeforeSibling )\n\t\t{\n\t\t\tif( m_Relinkage.m_Sibling->m_Prev )\n\t\t\t\tm_Relinkage.m_Sibling->m_Prev->m_Next = m_Node;\n\t\t\telse\n\t\t\t\tSetFirstChild( m_Node->m_Pare, m_Node );\n\n\t\t\tm_Node->m_Prev = m_Relinkage.m_Sibling->m_Prev;\n\n\t\t\tm_Relinkage.m_Sibling->m_Prev = m_Node;\n\t\t\tm_Node->m_Next = m_Relinkage.m_Sibling;\n\t\t}\n\t\telse\n\t\t{\n\t\t\tif( m_Relinkage.m_Sibling->m_Next )\n\t\t\t\tm_Relinkage.m_Sibling->m_Next->m_Prev = m_Node;\n\t\t\tm_Node->m_Next = m_Relinkage.m_Sibling->m_Next;\n\t\t\tm_Relinkage.m_Sibling->m_Next = m_Node;\n\t\t\tm_Node->m_Prev = m_Relinkage.m_Sibling;\n\t\t}\n\t}\n\telse\n\t{\n\t\tm_Node->m_Next = 0x0;\n\t\tm_Node->m_Prev = 0x0;\n\t}\n}\n<commit_msg>Fixed crash. And a bugg. yay.<commit_after>\/*\n *\n * Copyright (C) 2009, Joacim Jacobsson ( j dot jacobsson at gmail dot com )\n * All rights reserved.\n *\n * See LICENSE file for details\n *\n *\/\n\n#include \"BehaviorTreeNode.h\"\n#include \"..\/NodeToNodeArrow.h\"\n#include <btree\/btree.h>\n\n#include <QtGui\/QtGui>\n#include <QtSvg\/QSvgRenderer>\n\nconst char* const g_NodeResourcePaths[_E_MAX_GRIST_TYPES_] = {\n\t\":\/nodes\/unknown.svg\",\n\t\":\/nodes\/sequence.svg\",\n\t\":\/nodes\/selector.svg\",\n\t\":\/nodes\/parallel.svg\",\n\t\":\/nodes\/dyn_selector.svg\",\n\t\":\/nodes\/decorator.svg\",\n\t\":\/nodes\/action.svg\"\n};\n\nBehaviorTreeNode::BehaviorTreeNode( Node* n, BehaviorTreeNode* parent )\n\t: QGraphicsSvgItem( g_NodeResourcePaths[n->m_Grist.m_Type] )\n\t, m_Node( n )\n\t, m_MouseState( E_MS_NONE )\n\t, m_DraggingArrow( 0x0 )\n{\n\tsetFlag( QGraphicsItem::ItemIsMovable, true );\n\tsetFlag( QGraphicsItem::ItemIsSelectable, true );\n\tsetFlag( QGraphicsItem::ItemStacksBehindParent, false );\n\n\tif( parent )\n\t\tsetParentItem( parent );\n\tsetZValue( 0.0 );\n}\n\nvoid BehaviorTreeNode::removeArrow(NodeToNodeArrow *arrow)\n{\n\tint index = m_Arrows.indexOf(arrow);\n\n\tif (index != -1)\n\t\tm_Arrows.removeAt(index);\n}\n\nvoid BehaviorTreeNode::removeArrows()\n{\n\tforeach( NodeToNodeArrow *arrow, m_Arrows )\n\t{\n\t\tarrow->startItem()->removeArrow(arrow);\n\t\tarrow->endItem()->removeArrow(arrow);\n\t\tscene()->removeItem(arrow);\n\t\tdelete arrow;\n\t}\n}\n\nvoid BehaviorTreeNode::addArrow(NodeToNodeArrow *arrow)\n{\n\tm_Arrows.append(arrow);\n}\n\nNodeToNodeArrow* BehaviorTreeNode::findArrowTo( BehaviorTreeNode* other )\n{\n\tforeach( NodeToNodeArrow *arrow, m_Arrows )\n\t{\n\t\tif( arrow->startItem() == this && arrow->endItem() == other )\n\t\t\treturn arrow;\n\t\tif( arrow->startItem() == other && arrow->endItem() == this )\n\t\t\treturn arrow;\n\t}\n\treturn 0x0;\n}\n\nQVariant BehaviorTreeNode::itemChange( GraphicsItemChange change, const QVariant &value )\n{\n\tswitch( change )\n\t{\n\tcase ItemSelectedChange:\n\t\tupdate();\n\t\tbreak;\n\tcase ItemPositionChange:\n\t\tbreak;\n\t}\n\treturn QGraphicsSvgItem::itemChange( change, value );\n}\n\nvoid BehaviorTreeNode::mousePressEvent( QGraphicsSceneMouseEvent* event )\n{\n\tif( event->button() == Qt::LeftButton )\n\t{\n\t\tm_MouseState = E_MS_LB_DOWN;\n\t\tm_StartPos = event->screenPos();\n\t}\n\tQGraphicsSvgItem::mousePressEvent( event );\n}\n\nvoid BehaviorTreeNode::mouseReleaseEvent( QGraphicsSceneMouseEvent* event )\n{\n\tif( event->button() == Qt::LeftButton )\n\t{\n\t\tif( m_MouseState == E_MS_DRAGGING )\n\t\t\tdraggingEnded();\n\n\t\tm_MouseState = E_MS_NONE;\n\t}\n\tQGraphicsSvgItem::mouseReleaseEvent( event );\n}\n\nvoid BehaviorTreeNode::mouseMoveEvent( QGraphicsSceneMouseEvent* event )\n{\n\tif( m_MouseState == E_MS_LB_DOWN )\n\t{\n\t\tif( m_StartPos != event->screenPos() )\n\t\t{\n\t\t\tdraggingStarted();\n\t\t\tm_MouseState = E_MS_DRAGGING;\n\t\t}\n\t}\n\tQGraphicsSvgItem::mouseMoveEvent( event );\n}\n\nvoid BehaviorTreeNode::draggingStarted()\n{\n\tif( parentItem() )\n\t{\n\t\tBehaviorTreeNode* p = (BehaviorTreeNode*)parentItem();\n\t\tm_DraggingArrow = findArrowTo( p );\n\t\tp->removeArrow( m_DraggingArrow );\n\t\tm_DraggingArrow->setDashed( true );\n\t\tm_DraggingArrow->setStartAndEnd( this, p );\n\n\t\tQPointF position( scenePos() );\n\t\tsetParentItem( 0x0 );\n\t\tsetPos( position );\n\t}\n\telse\n\t{\n\t\tm_DraggingArrow = new NodeToNodeArrow( this, 0x0, scene() );\n\t\tm_DraggingArrow->setDashed( true );\n\t\taddArrow( m_DraggingArrow );\n\t}\n\n\tsetupRelinkage();\n\n\tsetZValue( 1.0 );\n}\n\nvoid BehaviorTreeNode::draggingEnded()\n{\n\tif( m_Relinkage.m_Parent )\n\t{\n\t\tBehaviorTreeNode* p = (BehaviorTreeNode*)m_Relinkage.m_Parent->m_UserData;\n\t\tsetPos( p->mapFromScene( scenePos() ) );\n\t\tsetParentItem( p );\n\n\t\tp->addArrow( m_DraggingArrow );\n\t\tm_DraggingArrow->setStartAndEnd( p, this );\n\t\tm_DraggingArrow->setDashed( false );\n\t\tm_DraggingArrow = 0x0;\n\t}\n\telse\n\t{\n\t\tremoveArrow( m_DraggingArrow );\n\t\tdelete m_DraggingArrow;\n\t\tm_DraggingArrow = 0x0;\n\t}\n\n\texecuteRelinkage();\n\n\tsetZValue( 0.0 );\n\n\temit nodeDragged();\n}\n\nvoid BehaviorTreeNode::setupRelinkage()\n{\n\tm_Relinkage.m_Parent = m_Node->m_Pare;\n\tif( m_Node->m_Prev )\n\t{\n\t\tm_Relinkage.m_Sibling\t\t= m_Node->m_Prev;\n\t\tm_Relinkage.m_BeforeSibling\t= false;\n\t}\n\telse if( m_Node->m_Next )\n\t{\n\t\tm_Relinkage.m_Sibling\t\t= m_Node->m_Next;\n\t\tm_Relinkage.m_BeforeSibling\t= true;\n\t}\n\telse\n\t{\n\t\tm_Relinkage.m_Sibling\t\t= 0x0;\n\t\tm_Relinkage.m_BeforeSibling = false;\n\t}\n\tUnlinkNodeFromParentAndSiblings( m_Node );\n}\n\nvoid BehaviorTreeNode::executeRelinkage()\n{\n\tif( m_Relinkage.m_Parent )\n\t\tm_Node->m_Pare = m_Relinkage.m_Parent;\n\n\tif( m_Relinkage.m_Sibling )\n\t{\n\t\tif( m_Relinkage.m_BeforeSibling )\n\t\t{\n\t\t\tif( m_Relinkage.m_Sibling->m_Prev )\n\t\t\t\tm_Relinkage.m_Sibling->m_Prev->m_Next = m_Node;\n\t\t\telse\n\t\t\t\tSetFirstChild( m_Node->m_Pare, m_Node );\n\n\t\t\tm_Node->m_Prev = m_Relinkage.m_Sibling->m_Prev;\n\n\t\t\tm_Relinkage.m_Sibling->m_Prev = m_Node;\n\t\t\tm_Node->m_Next = m_Relinkage.m_Sibling;\n\t\t}\n\t\telse\n\t\t{\n\t\t\tif( m_Relinkage.m_Sibling->m_Next )\n\t\t\t\tm_Relinkage.m_Sibling->m_Next->m_Prev = m_Node;\n\t\t\tm_Node->m_Next = m_Relinkage.m_Sibling->m_Next;\n\t\t\tm_Relinkage.m_Sibling->m_Next = m_Node;\n\t\t\tm_Node->m_Prev = m_Relinkage.m_Sibling;\n\t\t}\n\t}\n\telse\n\t{\n\t\tm_Node->m_Next = 0x0;\n\t\tm_Node->m_Prev = 0x0;\n\t\tSetFirstChild( m_Node->m_Pare, m_Node );\n\t}\n}\n<|endoftext|>"} {"text":"<commit_before>\/********************************************************\r\n * Ville Hyvönen & Teemu Pitkänen *\r\n * HIIT \/ University of Helsinki *\r\n * ville.o.hyvonen<at>helsinki.fi *\r\n * teemu.pitkanen<at>cs.helsinki.fi *\r\n * 2016 *\r\n ********************************************************\/\r\n\r\n#include \"armadillo\"\r\n#include <cstdlib>\r\n#include <queue>\r\n#include \"Mrpt.h\"\r\n\r\nusing namespace arma;\r\n\r\n\/**\r\n * The constructor of the index. The inputs are the data for which the index \r\n * will be built and additional parameters that affect the accuracy of the NN\r\n * approximation. Concisely, larger n_trees_ or n_0_ values improve accuracy but\r\n * slow down the queries. A general rule for the right balance is not known. The\r\n * constructor does not actually build the trees, but that is done by a separate\r\n * function 'grow' that has to be called before queries can be made. \r\n * @param X_ - The data to be indexed. Samples as columns, features as rows.\r\n * @param n_trees_ - The number of trees to be used in the index.\r\n * @param n_0_ - The maximum leaf size to be used in the index.\r\n * @param id_ - A name used for filenames when saving.\r\n *\/\r\nMrpt::Mrpt(const fmat& X_, int n_trees_, int n_0_, std::string id_) : X(X_), n_trees(n_trees_), n_0(n_0_), id(id_){\r\n n_samples = X.n_cols; \r\n dim = X.n_rows;\r\n depth = ceil(log2(n_samples \/ n_0));\r\n n_pool = n_trees * depth;\r\n n_array = pow(2, depth + 1);\r\n split_points = fmat();\r\n random_matrix = fmat();\r\n}\r\n\r\n\/**\r\n * The function whose call starts the actual index construction. Initializes \r\n * arrays to store the tree structures and computes all the projections needed\r\n * later. Then repeatedly calls method grow_subtree that builds a single \r\n * RP-tree.\r\n *\/\r\nvoid Mrpt::grow() {\r\n split_points = zeros<fmat>(n_array, n_trees);\r\n uvec indices = linspace<uvec>(0, n_samples - 1, n_samples);\r\n\r\n \/\/ generate the random matrix and project the data set onto it\r\n random_matrix = conv_to<fmat>::from(randn(n_pool, dim));\r\n projected_data = random_matrix * X;\r\n \r\n \/\/ Grow the trees\r\n for (int n_tree = 0; n_tree < n_trees; n_tree++) { \r\n first_idx = n_tree * depth;\r\n std::vector<uvec> t = grow_subtree(indices, 0, 0, n_tree); \r\n tree_leaves.push_back(t);\r\n }\r\n}\r\n\r\n\/**\r\n * Builds a single random projection tree. The tree is constructed by recursively\r\n * projecting the data on a random vector and splitting into two by the median.\r\n * @param indices - The indices left in this branch\r\n * @param tree_level - The level in tree where the recursion is at\r\n * @param i - The index within the tree where we are at\r\n * @param n_tree - The index of the tree within the index\r\n * @return The leaves as a vector of arma::uvecs\r\n *\/\r\nstd::vector<uvec> Mrpt::grow_subtree(const uvec &indices, int tree_level, int i, uword n_tree) {\r\n int n = indices.size();\r\n int idx_left = 2 * i + 1;\r\n int idx_right = idx_left + 1;\r\n\r\n if (tree_level == depth) {\r\n std::vector<uvec> v;\r\n v.push_back(indices);\r\n return v;\r\n }\r\n\r\n uvec level = {first_idx + tree_level};\r\n frowvec projection = projected_data(level, indices);\r\n uvec ordered = sort_index(projection);\r\n\r\n int split_point = n % 2 ? n \/ 2 : n \/ 2 - 1; \/\/ median split\r\n int idx_split_point = ordered(split_point);\r\n int idx_split_point2 = ordered(split_point + 1);\r\n\r\n split_points(i, n_tree) = n % 2 ? projection(idx_split_point) : (projection(idx_split_point) + projection(idx_split_point2)) \/ 2;\r\n uvec left_indices = ordered.subvec(0, split_point);\r\n uvec right_indices = ordered.subvec(split_point + 1, n - 1);\r\n\r\n std::vector<uvec> v = grow_subtree(indices.elem(left_indices), tree_level + 1, idx_left, n_tree);\r\n std::vector<uvec> w = grow_subtree(indices.elem(right_indices), tree_level + 1, idx_right, n_tree);\r\n v.insert( v.end(), w.begin(), w.end() );\r\n return v;\r\n}\r\n\r\n\/**\r\n * This function finds the k approximate nearest neighbors of the query object \r\n * q. The accuracy of the query depends on both the parameters used for index \r\n * construction and additional parameters given to this function. This \r\n * function implements two tricks to improve performance. The voting trick \r\n * interprets each index object in leaves returned by tree traversals as votes,\r\n * and only performs the final linear search with the 'elect' most voted \r\n * objects. The priority queue trick keeps track of nodes where the split value\r\n * was close to the projection so that we can split the tree traversal to both\r\n * subtrees if we want.\r\n * @param q - The query object whose neighbors the function finds.\r\n * @param k - The number of neighbors the user wants the function to return\r\n * @param elect - The number of most voted objects elected to linear search\r\n * @param branches - The number of extra branches explored in priority queue trick\r\n * @return The indices of the k approximate nearest neighbors in the original\r\n * data set for which the index was built.\r\n *\/\r\nuvec Mrpt::query(const fvec& q, int k, int elect, int branches) {\r\n \r\n fvec projected_query = random_matrix * q;\r\n uvec votes = zeros<uvec>(n_samples);\r\n std::priority_queue<Gap, std::vector<Gap>, std::greater<Gap>> pq;\r\n \r\n \/*\r\n * The following loops over all trees, and routes the query to exactly one \r\n * leaf in each.\r\n *\/\r\n int j = 0; \/\/ Used to find the correct projection value, increases through all trees\r\n for (int n_tree = 0; n_tree < n_trees; n_tree++) {\r\n const fvec& tree = split_points.unsafe_col(n_tree);\r\n\r\n double split_point = tree[0];\r\n int idx_left, idx_right;\r\n int idx_tree = 0;\r\n\r\n while (split_point) {\r\n idx_left = 2 * idx_tree + 1;\r\n idx_right = idx_left + 1;\r\n if (projected_query(j) <= split_point) {\r\n idx_tree = idx_left;\r\n pq.push(Gap(n_tree, idx_right, j+1, split_point-projected_query(j)));\r\n } else {\r\n idx_tree = idx_right;\r\n pq.push(Gap(n_tree, idx_left, j+1, projected_query(j)-split_point));\r\n }\r\n j++;\r\n split_point = tree[idx_tree];\r\n }\r\n const uvec& idx_one_tree = tree_leaves[n_tree][idx_tree - pow(2, depth) + 1];\r\n for (int i = 0; i < idx_one_tree.size(); i++){\r\n votes[idx_one_tree[i]]++;\r\n }\r\n }\r\n \r\n \/*\r\n * The following loop routes the query to extra leaves in the same trees \r\n * handled already once above. The extra branches are popped from the \r\n * priority queue and routed down the tree just as new root-to-leaf queries.\r\n *\/\r\n for (int b = 0; b < branches; b++){\r\n if (pq.empty()) break;\r\n Gap gap = pq.top();\r\n pq.pop();\r\n \r\n const fvec& tree = split_points.unsafe_col(gap.tree);\r\n int idx_tree = gap.node;\r\n int idx_left, idx_right;\r\n j = gap.level;\r\n double split_point = tree[idx_tree];\r\n\r\n while (split_point) {\r\n idx_left = 2 * idx_tree + 1;\r\n idx_right = idx_left + 1;\r\n if (projected_query(j) <= split_point) {\r\n idx_tree = idx_left;\r\n pq.push(Gap(gap.tree, idx_right, j+1, split_point-projected_query(j)));\r\n } else {\r\n idx_tree = idx_right;\r\n pq.push(Gap(gap.tree, idx_left, j+1, projected_query(j)-split_point));\r\n }\r\n j++;\r\n split_point = tree[idx_tree];\r\n }\r\n\r\n const uvec& idx_one_tree = tree_leaves[gap.tree][idx_tree - pow(2, depth) + 1];\r\n for (int idx : idx_one_tree){\r\n votes[idx]++;\r\n } \r\n } \r\n \r\n \/\/ Compute the actual NNs within the 'elect' objects with most votes\r\n uvec elected = sort_index(votes, \"descend\");\r\n elected.resize(elect);\r\n return exact_knn(X, q, k, elected);\r\n}\r\n\r\n\/**\r\n * This function implements the barebones MRPT algorithm and finds the k \r\n * approximate nearest neighbors of the query object q using multiple random \r\n * projection trees. The accuracy of the query depends on the parameters used \r\n * for index construction. Separated from the function above for optimal performance.\r\n * @param q - The query object whose neighbors the function finds.\r\n * @param k - The number of neighbors the user wants the function to return\r\n * @return The indices of the k approximate nearest neighbors in the original\r\n * data set for which the index was built.\r\n *\/\r\nuvec Mrpt::query(const fvec& q, int k) {\r\n fvec projected_query = random_matrix * q;\r\n std::vector<int> idx_canditates(n_trees * n_0);\r\n int j = 0;\r\n\r\n\r\n for (int n_tree = 0; n_tree < n_trees; n_tree++) {\r\n const fvec& tree = split_points.unsafe_col(n_tree);\r\n\r\n double split_point = tree[0];\r\n int idx_left, idx_right;\r\n int idx_tree = 0;\r\n\r\n while (split_point) {\r\n idx_left = 2 * idx_tree + 1;\r\n idx_right = idx_left + 1;\r\n idx_tree = projected_query(j++) <= split_point ? idx_left : idx_right;\r\n split_point = tree[idx_tree];\r\n }\r\n \r\n const uvec& idx_one_tree = tree_leaves[n_tree][idx_tree - pow(2, depth) + 1];\r\n idx_canditates.insert(idx_canditates.begin(), idx_one_tree.begin(), idx_one_tree.end());\r\n }\r\n\r\n std::sort(idx_canditates.begin(), idx_canditates.end());\r\n auto last = std::unique(idx_canditates.begin(), idx_canditates.end());\r\n idx_canditates.erase(last, idx_canditates.end());\r\n\r\n return exact_knn(X, q, k, conv_to<uvec>::from(idx_canditates));\r\n}\r\n\r\n\r\n\/**\r\n * find k nearest neighbors from data for the query point\r\n * @param X - data matrix, row = data point, col = dimension\r\n * @param q - query point as a row matrix\r\n * @param k - number of neighbors searched for\r\n * @param indices - indices of the points in the original matrix where search is made\r\n * @return - indices of nearest neighbors in data matrix X as a column vector\r\n *\/\r\nuvec exact_knn(const fmat& D, const fvec& q, uword k, uvec indices) {\r\n int n_cols = indices.size();\r\n fvec distances = fvec(n_cols);\r\n for (int i = 0; i < n_cols; i++)\r\n distances[i] = sum(pow((D.col(indices(i)) - q), 2));\r\n\r\n if(k == 1) {\r\n uvec ret(1);\r\n distances.min(ret[0]);\r\n return ret;\r\n }\r\n\r\n uvec sorted_indices = indices(sort_index(distances));\r\n return sorted_indices.size() > k ? sorted_indices.head(k): sorted_indices;\r\n}<commit_msg>Fixed leaf-size 1 bug<commit_after>\/********************************************************\r\n * Ville Hyvönen & Teemu Pitkänen *\r\n * HIIT \/ University of Helsinki *\r\n * ville.o.hyvonen<at>helsinki.fi *\r\n * teemu.pitkanen<at>cs.helsinki.fi *\r\n * 2016 *\r\n ********************************************************\/\r\n\r\n#include \"armadillo\"\r\n#include <cstdlib>\r\n#include <queue>\r\n#include \"Mrpt.h\"\r\n\r\nusing namespace arma;\r\n\r\n\/**\r\n * The constructor of the index. The inputs are the data for which the index \r\n * will be built and additional parameters that affect the accuracy of the NN\r\n * approximation. Concisely, larger n_trees_ or n_0_ values improve accuracy but\r\n * slow down the queries. A general rule for the right balance is not known. The\r\n * constructor does not actually build the trees, but that is done by a separate\r\n * function 'grow' that has to be called before queries can be made. \r\n * @param X_ - The data to be indexed. Samples as columns, features as rows.\r\n * @param n_trees_ - The number of trees to be used in the index.\r\n * @param n_0_ - The maximum leaf size to be used in the index.\r\n * @param id_ - A name used for filenames when saving.\r\n *\/\r\nMrpt::Mrpt(const fmat& X_, int n_trees_, int n_0_, std::string id_) : X(X_), n_trees(n_trees_), n_0(n_0_), id(id_){\r\n n_samples = X.n_cols; \r\n dim = X.n_rows;\r\n if (n_0 == 1) \/\/ n_0==1 => leaves have sizes 1 or 2 (b\/c 0.5 is impossible)\r\n depth = floor(log2(n_samples));\r\n else\r\n depth = ceil(log2(n_samples \/ n_0));\r\n n_pool = n_trees * depth;\r\n n_array = pow(2, depth + 1);\r\n split_points = fmat();\r\n random_matrix = fmat();\r\n}\r\n\r\n\/**\r\n * The function whose call starts the actual index construction. Initializes \r\n * arrays to store the tree structures and computes all the projections needed\r\n * later. Then repeatedly calls method grow_subtree that builds a single \r\n * RP-tree.\r\n *\/\r\nvoid Mrpt::grow() {\r\n split_points = zeros<fmat>(n_array, n_trees);\r\n uvec indices = linspace<uvec>(0, n_samples - 1, n_samples);\r\n\r\n \/\/ generate the random matrix and project the data set onto it\r\n random_matrix = conv_to<fmat>::from(randn(n_pool, dim));\r\n projected_data = random_matrix * X;\r\n \r\n \/\/ Grow the trees\r\n for (int n_tree = 0; n_tree < n_trees; n_tree++) { \r\n first_idx = n_tree * depth;\r\n std::vector<uvec> t = grow_subtree(indices, 0, 0, n_tree); \r\n tree_leaves.push_back(t);\r\n }\r\n}\r\n\r\n\/**\r\n * Builds a single random projection tree. The tree is constructed by recursively\r\n * projecting the data on a random vector and splitting into two by the median.\r\n * @param indices - The indices left in this branch\r\n * @param tree_level - The level in tree where the recursion is at\r\n * @param i - The index within the tree where we are at\r\n * @param n_tree - The index of the tree within the index\r\n * @return The leaves as a vector of arma::uvecs\r\n *\/\r\nstd::vector<uvec> Mrpt::grow_subtree(const uvec &indices, int tree_level, int i, uword n_tree) {\r\n int n = indices.size();\r\n int idx_left = 2 * i + 1;\r\n int idx_right = idx_left + 1;\r\n\r\n if (tree_level == depth) {\r\n std::vector<uvec> v;\r\n v.push_back(indices);\r\n return v;\r\n }\r\n\r\n uvec level = {first_idx + tree_level};\r\n frowvec projection = projected_data(level, indices);\r\n uvec ordered = sort_index(projection);\r\n\r\n int split_point = n % 2 ? n \/ 2 : n \/ 2 - 1; \/\/ median split\r\n int idx_split_point = ordered(split_point);\r\n int idx_split_point2 = ordered(split_point + 1);\r\n\r\n split_points(i, n_tree) = n % 2 ? projection(idx_split_point) : (projection(idx_split_point) + projection(idx_split_point2)) \/ 2;\r\n uvec left_indices = ordered.subvec(0, split_point);\r\n uvec right_indices = ordered.subvec(split_point + 1, n - 1);\r\n\r\n std::vector<uvec> v = grow_subtree(indices.elem(left_indices), tree_level + 1, idx_left, n_tree);\r\n std::vector<uvec> w = grow_subtree(indices.elem(right_indices), tree_level + 1, idx_right, n_tree);\r\n v.insert( v.end(), w.begin(), w.end() );\r\n return v;\r\n}\r\n\r\n\/**\r\n * This function finds the k approximate nearest neighbors of the query object \r\n * q. The accuracy of the query depends on both the parameters used for index \r\n * construction and additional parameters given to this function. This \r\n * function implements two tricks to improve performance. The voting trick \r\n * interprets each index object in leaves returned by tree traversals as votes,\r\n * and only performs the final linear search with the 'elect' most voted \r\n * objects. The priority queue trick keeps track of nodes where the split value\r\n * was close to the projection so that we can split the tree traversal to both\r\n * subtrees if we want.\r\n * @param q - The query object whose neighbors the function finds.\r\n * @param k - The number of neighbors the user wants the function to return\r\n * @param elect - The number of most voted objects elected to linear search\r\n * @param branches - The number of extra branches explored in priority queue trick\r\n * @return The indices of the k approximate nearest neighbors in the original\r\n * data set for which the index was built.\r\n *\/\r\nuvec Mrpt::query(const fvec& q, int k, int elect, int branches) {\r\n \r\n fvec projected_query = random_matrix * q;\r\n uvec votes = zeros<uvec>(n_samples);\r\n std::priority_queue<Gap, std::vector<Gap>, std::greater<Gap>> pq;\r\n \r\n \/*\r\n * The following loops over all trees, and routes the query to exactly one \r\n * leaf in each.\r\n *\/\r\n int j = 0; \/\/ Used to find the correct projection value, increases through all trees\r\n for (int n_tree = 0; n_tree < n_trees; n_tree++) {\r\n const fvec& tree = split_points.unsafe_col(n_tree);\r\n\r\n double split_point = tree[0];\r\n int idx_left, idx_right;\r\n int idx_tree = 0;\r\n\r\n while (split_point) {\r\n idx_left = 2 * idx_tree + 1;\r\n idx_right = idx_left + 1;\r\n if (projected_query(j) <= split_point) {\r\n idx_tree = idx_left;\r\n pq.push(Gap(n_tree, idx_right, j+1, split_point-projected_query(j)));\r\n } else {\r\n idx_tree = idx_right;\r\n pq.push(Gap(n_tree, idx_left, j+1, projected_query(j)-split_point));\r\n }\r\n j++;\r\n split_point = tree[idx_tree];\r\n }\r\n const uvec& idx_one_tree = tree_leaves[n_tree][idx_tree - pow(2, depth) + 1];\r\n for (int i = 0; i < idx_one_tree.size(); i++){\r\n votes[idx_one_tree[i]]++;\r\n }\r\n }\r\n \r\n \/*\r\n * The following loop routes the query to extra leaves in the same trees \r\n * handled already once above. The extra branches are popped from the \r\n * priority queue and routed down the tree just as new root-to-leaf queries.\r\n *\/\r\n for (int b = 0; b < branches; b++){\r\n if (pq.empty()) break;\r\n Gap gap = pq.top();\r\n pq.pop();\r\n \r\n const fvec& tree = split_points.unsafe_col(gap.tree);\r\n int idx_tree = gap.node;\r\n int idx_left, idx_right;\r\n j = gap.level;\r\n double split_point = tree[idx_tree];\r\n\r\n while (split_point) {\r\n idx_left = 2 * idx_tree + 1;\r\n idx_right = idx_left + 1;\r\n if (projected_query(j) <= split_point) {\r\n idx_tree = idx_left;\r\n pq.push(Gap(gap.tree, idx_right, j+1, split_point-projected_query(j)));\r\n } else {\r\n idx_tree = idx_right;\r\n pq.push(Gap(gap.tree, idx_left, j+1, projected_query(j)-split_point));\r\n }\r\n j++;\r\n split_point = tree[idx_tree];\r\n }\r\n\r\n const uvec& idx_one_tree = tree_leaves[gap.tree][idx_tree - pow(2, depth) + 1];\r\n for (int idx : idx_one_tree)\r\n votes[idx]++;\r\n } \r\n \r\n \/\/ Compute the actual NNs within the 'elect' objects with most votes\r\n uvec elected = sort_index(votes, \"descend\");\r\n elected.resize(elect);\r\n return exact_knn(X, q, k, elected);\r\n}\r\n\r\n\/**\r\n * This function implements the barebones MRPT algorithm and finds the k \r\n * approximate nearest neighbors of the query object q using multiple random \r\n * projection trees. The accuracy of the query depends on the parameters used \r\n * for index construction. Separated from the function above for optimal performance.\r\n * @param q - The query object whose neighbors the function finds.\r\n * @param k - The number of neighbors the user wants the function to return\r\n * @return The indices of the k approximate nearest neighbors in the original\r\n * data set for which the index was built.\r\n *\/\r\nuvec Mrpt::query(const fvec& q, int k) {\r\n fvec projected_query = random_matrix * q;\r\n std::vector<int> idx_canditates(n_trees * n_0);\r\n int j = 0;\r\n\r\n\r\n for (int n_tree = 0; n_tree < n_trees; n_tree++) {\r\n const fvec& tree = split_points.unsafe_col(n_tree);\r\n\r\n double split_point = tree[0];\r\n int idx_left, idx_right;\r\n int idx_tree = 0;\r\n\r\n while (split_point) {\r\n idx_left = 2 * idx_tree + 1;\r\n idx_right = idx_left + 1;\r\n idx_tree = projected_query(j++) <= split_point ? idx_left : idx_right;\r\n split_point = tree[idx_tree];\r\n }\r\n \r\n const uvec& idx_one_tree = tree_leaves[n_tree][idx_tree - pow(2, depth) + 1];\r\n idx_canditates.insert(idx_canditates.begin(), idx_one_tree.begin(), idx_one_tree.end());\r\n }\r\n\r\n std::sort(idx_canditates.begin(), idx_canditates.end());\r\n auto last = std::unique(idx_canditates.begin(), idx_canditates.end());\r\n idx_canditates.erase(last, idx_canditates.end());\r\n\r\n return exact_knn(X, q, k, conv_to<uvec>::from(idx_canditates));\r\n}\r\n\r\n\r\n\/**\r\n * find k nearest neighbors from data for the query point\r\n * @param X - data matrix, row = data point, col = dimension\r\n * @param q - query point as a row matrix\r\n * @param k - number of neighbors searched for\r\n * @param indices - indices of the points in the original matrix where search is made\r\n * @return - indices of nearest neighbors in data matrix X as a column vector\r\n *\/\r\nuvec exact_knn(const fmat& D, const fvec& q, uword k, uvec indices) {\r\n int n_cols = indices.size();\r\n fvec distances = fvec(n_cols);\r\n for (int i = 0; i < n_cols; i++)\r\n distances[i] = sum(pow((D.col(indices(i)) - q), 2));\r\n\r\n if(k == 1) {\r\n uvec ret(1);\r\n distances.min(ret[0]);\r\n return ret;\r\n }\r\n\r\n uvec sorted_indices = indices(sort_index(distances));\r\n return sorted_indices.size() > k ? sorted_indices.head(k): sorted_indices;\r\n}<|endoftext|>"} {"text":"<commit_before>#include \"bochs.h\"\n#ifdef WIN32\n\/\/ windows.h included in bochs.h\n#else\n\/\/# error \"extdb.cc only supported in win32 environment\"\n#endif\n\nTRegs regs;\n\nchar debug_loaded = 0;\n\nvoid (*call_debugger)(TRegs *,Bit8u *, Bit32u);\n\n\nvoid bx_external_debugger(BX_CPU_C *cpu)\n{\n \/\/printf(\"Calling debugger state=%d\\n\",regs.debug_state);\n switch (regs.debug_state) {\n case debug_run:\n return;\n case debug_count:\n if (--regs.debug_counter) return;\n regs.debug_state = debug_step;\n break;\n case debug_skip:\n if (cpu->dword.eip != regs.debug_eip ||\n cpu->sregs[1].selector.value != regs.debug_cs) return;\n regs.debug_state = debug_step;\n break;\n }\n\n#if BX_SUPPORT_X86_64\n regs.rax = cpu->gen_reg[0].rrx;\n regs.rcx = cpu->gen_reg[1].rrx;\n regs.rdx = cpu->gen_reg[2].rrx;\n regs.rbx = cpu->gen_reg[3].rrx;\n regs.rsp = cpu->gen_reg[4].rrx;\n regs.rbp = cpu->gen_reg[5].rrx;\n regs.rsi = cpu->gen_reg[6].rrx;\n regs.rdi = cpu->gen_reg[7].rrx;\n regs.r8 = cpu->gen_reg[8].rrx;\n regs.r9 = cpu->gen_reg[9].rrx;\n regs.r10 = cpu->gen_reg[10].rrx;\n regs.r11 = cpu->gen_reg[11].rrx;\n regs.r12 = cpu->gen_reg[12].rrx;\n regs.r13 = cpu->gen_reg[13].rrx;\n regs.r14 = cpu->gen_reg[14].rrx;\n regs.r15 = cpu->gen_reg[15].rrx;\n regs.rip = cpu->rip;\n#else\n regs.rax = cpu->gen_reg[0].dword.erx;\n regs.rcx = cpu->gen_reg[1].dword.erx;\n regs.rdx = cpu->gen_reg[2].dword.erx;\n regs.rbx = cpu->gen_reg[3].dword.erx;\n regs.rsp = cpu->gen_reg[4].dword.erx;\n regs.rbp = cpu->gen_reg[5].dword.erx;\n regs.rsi = cpu->gen_reg[6].dword.erx;\n regs.rdi = cpu->gen_reg[7].dword.erx;\n regs.r8 = 0;\n regs.r9 = 0;\n regs.r10 = 0;\n regs.r11 = 0;\n regs.r12 = 0;\n regs.r13 = 0;\n regs.r14 = 0;\n regs.r15 = 0;\n regs.rip = cpu->dword.eip;\n#endif\n regs.rflags = cpu->read_eflags();\n regs.es = cpu->sregs[0].selector.value;\n regs.cs = cpu->sregs[1].selector.value;\n regs.ss = cpu->sregs[2].selector.value;\n regs.ds = cpu->sregs[3].selector.value;\n regs.fs = cpu->sregs[4].selector.value;\n regs.gs = cpu->sregs[5].selector.value;\n regs.gdt.base = cpu->gdtr.base;\n regs.gdt.limit = cpu->gdtr.limit;\n regs.idt.base = cpu->idtr.base;\n regs.idt.limit = cpu->idtr.limit;\n regs.ldt = cpu->ldtr.selector.value;\n regs.cr0 = cpu->cr0.val32;\n regs.cr1 = cpu->cr1;\n regs.cr2 = cpu->cr2;\n regs.cr3 = cpu->cr3;\n regs.cr4 = cpu->cr4.getRegister();\n \/\/regs.cr5 = cpu->cr5;\n \/\/regs.cr6 = cpu->cr6;\n \/\/regs.cr7 = cpu->cr7;\n regs.fsbase = cpu->sregs[BX_SEG_REG_FS].cache.u.segment.base;\n regs.gsbase = cpu->sregs[BX_SEG_REG_GS].cache.u.segment.base;\n#if BX_SUPPORT_X86_64\n regs.efer = (BX_CPU_THIS_PTR msr.sce << 0)\n | (BX_CPU_THIS_PTR msr.lme << 8)\n | (BX_CPU_THIS_PTR msr.lma << 10);\n#else\n regs.efer = 0;\n#endif\n\n if (debug_loaded == 0) {\n HINSTANCE hdbg;\n\n debug_loaded = 1;\n hdbg = LoadLibrary(\"debug.dll\");\n call_debugger = (void (*)(TRegs *,Bit8u *, Bit32u)) GetProcAddress(hdbg,\"call_debugger\");\n\n if (call_debugger != NULL) debug_loaded = 2;\n }\n if (debug_loaded == 2) {\n DEV_vga_refresh();\n call_debugger(®s,cpu->mem->vector,cpu->mem->len);\n }\n}\n<commit_msg>fix for BX_CPU_LEVEL < 4<commit_after>#include \"bochs.h\"\n#ifdef WIN32\n\/\/ windows.h included in bochs.h\n#else\n\/\/# error \"extdb.cc only supported in win32 environment\"\n#endif\n\nTRegs regs;\n\nchar debug_loaded = 0;\n\nvoid (*call_debugger)(TRegs *,Bit8u *, Bit32u);\n\n\nvoid bx_external_debugger(BX_CPU_C *cpu)\n{\n \/\/printf(\"Calling debugger state=%d\\n\",regs.debug_state);\n switch (regs.debug_state) {\n case debug_run:\n return;\n case debug_count:\n if (--regs.debug_counter) return;\n regs.debug_state = debug_step;\n break;\n case debug_skip:\n if (cpu->dword.eip != regs.debug_eip ||\n cpu->sregs[1].selector.value != regs.debug_cs) return;\n regs.debug_state = debug_step;\n break;\n }\n\n#if BX_SUPPORT_X86_64\n regs.rax = cpu->gen_reg[0].rrx;\n regs.rcx = cpu->gen_reg[1].rrx;\n regs.rdx = cpu->gen_reg[2].rrx;\n regs.rbx = cpu->gen_reg[3].rrx;\n regs.rsp = cpu->gen_reg[4].rrx;\n regs.rbp = cpu->gen_reg[5].rrx;\n regs.rsi = cpu->gen_reg[6].rrx;\n regs.rdi = cpu->gen_reg[7].rrx;\n regs.r8 = cpu->gen_reg[8].rrx;\n regs.r9 = cpu->gen_reg[9].rrx;\n regs.r10 = cpu->gen_reg[10].rrx;\n regs.r11 = cpu->gen_reg[11].rrx;\n regs.r12 = cpu->gen_reg[12].rrx;\n regs.r13 = cpu->gen_reg[13].rrx;\n regs.r14 = cpu->gen_reg[14].rrx;\n regs.r15 = cpu->gen_reg[15].rrx;\n regs.rip = cpu->rip;\n#else\n regs.rax = cpu->gen_reg[0].dword.erx;\n regs.rcx = cpu->gen_reg[1].dword.erx;\n regs.rdx = cpu->gen_reg[2].dword.erx;\n regs.rbx = cpu->gen_reg[3].dword.erx;\n regs.rsp = cpu->gen_reg[4].dword.erx;\n regs.rbp = cpu->gen_reg[5].dword.erx;\n regs.rsi = cpu->gen_reg[6].dword.erx;\n regs.rdi = cpu->gen_reg[7].dword.erx;\n regs.r8 = 0;\n regs.r9 = 0;\n regs.r10 = 0;\n regs.r11 = 0;\n regs.r12 = 0;\n regs.r13 = 0;\n regs.r14 = 0;\n regs.r15 = 0;\n regs.rip = cpu->dword.eip;\n#endif\n regs.rflags = cpu->read_eflags();\n regs.es = cpu->sregs[0].selector.value;\n regs.cs = cpu->sregs[1].selector.value;\n regs.ss = cpu->sregs[2].selector.value;\n regs.ds = cpu->sregs[3].selector.value;\n regs.fs = cpu->sregs[4].selector.value;\n regs.gs = cpu->sregs[5].selector.value;\n regs.gdt.base = cpu->gdtr.base;\n regs.gdt.limit = cpu->gdtr.limit;\n regs.idt.base = cpu->idtr.base;\n regs.idt.limit = cpu->idtr.limit;\n regs.ldt = cpu->ldtr.selector.value;\n regs.cr0 = cpu->cr0.val32;\n regs.cr1 = cpu->cr1;\n regs.cr2 = cpu->cr2;\n regs.cr3 = cpu->cr3;\n#if BX_CPU_LEVEL >= 4\n regs.cr4 = cpu->cr4.getRegister();\n#endif\n \/\/regs.cr5 = cpu->cr5;\n \/\/regs.cr6 = cpu->cr6;\n \/\/regs.cr7 = cpu->cr7;\n regs.fsbase = cpu->sregs[BX_SEG_REG_FS].cache.u.segment.base;\n regs.gsbase = cpu->sregs[BX_SEG_REG_GS].cache.u.segment.base;\n#if BX_SUPPORT_X86_64\n regs.efer = (BX_CPU_THIS_PTR msr.sce << 0)\n | (BX_CPU_THIS_PTR msr.lme << 8)\n | (BX_CPU_THIS_PTR msr.lma << 10);\n#else\n regs.efer = 0;\n#endif\n\n if (debug_loaded == 0) {\n HINSTANCE hdbg;\n\n debug_loaded = 1;\n hdbg = LoadLibrary(\"debug.dll\");\n call_debugger = (void (*)(TRegs *,Bit8u *, Bit32u)) GetProcAddress(hdbg,\"call_debugger\");\n\n if (call_debugger != NULL) debug_loaded = 2;\n }\n if (debug_loaded == 2) {\n DEV_vga_refresh();\n call_debugger(®s,cpu->mem->vector,cpu->mem->len);\n }\n}\n<|endoftext|>"} {"text":"<commit_before>\/**\n * Non-metric Space Library\n *\n * Authors: Bilegsaikhan Naidan (https:\/\/github.com\/bileg), Leonid Boytsov (http:\/\/boytsov.info).\n * With contributions from Lawrence Cayton (http:\/\/lcayton.com\/) and others.\n *\n * For the complete list of contributors and further details see:\n * https:\/\/github.com\/searchivarius\/NonMetricSpaceLib \n * \n * Copyright (c) 2014\n *\n * This code is released under the\n * Apache License Version 2.0 http:\/\/www.apache.org\/licenses\/.\n *\n *\/\n#include <algorithm>\n#include <iostream>\n#include <fstream>\n#include <sstream>\n#include <string>\n#include <cmath>\n\n#include \"space.h\"\n#include \"rangequery.h\"\n#include \"knnquery.h\"\n#include \"searchoracle.h\"\n#include \"method\/vptree.h\"\n#include \"method\/vptree_utils.h\"\n#include \"methodfactory.h\"\n\n#define MIN_PIVOT_SELECT_DATA_QTY 10\n#define MAX_PIVOT_SELECT_ATTEMPTS 5\n\nnamespace similarity {\n\nusing std::string;\nusing std::stringstream;\nusing std::endl;\nusing std::cout;\nusing std::cerr;\n \ntemplate <typename dist_t, typename SearchOracle>\nVPTree<dist_t, SearchOracle>::VPTree(\n bool PrintProgress,\n Space<dist_t>& space,\n const ObjectVector& data,\n bool use_random_center) : \n space_(space),\n data_(data),\n PrintProgress_(PrintProgress),\n use_random_center_(use_random_center),\n max_pivot_select_attempts_(MAX_PIVOT_SELECT_ATTEMPTS),\n oracle_(space, data, PrintProgress),\n QueryTimeParams_(oracle_.GetQueryTimeParamNames()) { \n QueryTimeParams_.push_back(\"maxLeavesToVisit\");\n }\n\ntemplate <typename dist_t, typename SearchOracle>\nvoid VPTree<dist_t, SearchOracle>::CreateIndex(const AnyParams& IndexParams) {\n AnyParamManager pmgr(IndexParams);\n\n pmgr.GetParamOptional(\"bucketSize\", BucketSize_, 50);\n pmgr.GetParamOptional(\"chunkBucket\", ChunkBucket_, true);\n pmgr.GetParamOptional(\"selectPivotAttempts\", max_pivot_select_attempts_, MAX_PIVOT_SELECT_ATTEMPTS);\n\n CHECK_MSG(max_pivot_select_attempts_ >= 1, \"selectPivotAttempts should be >=1\");\n\n LOG(LIB_INFO) << \"bucketSize = \" << BucketSize_;\n LOG(LIB_INFO) << \"chunkBucket = \" << ChunkBucket_;\n LOG(LIB_INFO) << \"selectPivotAttempts = \" << max_pivot_select_attempts_;\n\n \/\/ Call this function *ONLY AFTER* the bucket size is obtained!\n oracle_.SetIndexTimeParams(pmgr);\n oracle_.LogParams();\n\n pmgr.CheckUnused();\n\n this->ResetQueryTimeParams(); \/\/ reset query-time parameters\n\n unique_ptr<ProgressDisplay> progress_bar(PrintProgress_ ? \n new ProgressDisplay(data_.size(), cerr):\n NULL);\n\n root_.reset(new VPNode(0,\n progress_bar.get(), \n oracle_, \n space_, data_,\n max_pivot_select_attempts_,\n BucketSize_, ChunkBucket_,\n use_random_center_ \/* use random center *\/));\n\n if (progress_bar) { \/\/ make it 100%\n (*progress_bar) += (progress_bar->expected_count() - progress_bar->count());\n }\n}\n\ntemplate <typename dist_t,typename SearchOracle>\nVPTree<dist_t, SearchOracle>::~VPTree() {\n}\n\ntemplate <typename dist_t,typename SearchOracle>\nconst std::string VPTree<dist_t, SearchOracle>::StrDesc() const {\n return \"vptree: \" + SearchOracle::GetName();\n}\n\ntemplate <typename dist_t, typename SearchOracle>\nvoid VPTree<dist_t, SearchOracle>::Search(RangeQuery<dist_t>* query, IdType) const {\n int mx = MaxLeavesToVisit_;\n root_->GenericSearch(query, mx);\n}\n\ntemplate <typename dist_t, typename SearchOracle>\nvoid VPTree<dist_t, SearchOracle>::Search(KNNQuery<dist_t>* query, IdType) const {\n int mx = MaxLeavesToVisit_;\n root_->GenericSearch(query, mx);\n}\n\ntemplate <typename dist_t, typename SearchOracle>\nvoid VPTree<dist_t, SearchOracle>::VPNode::CreateBucket(bool ChunkBucket, \n const ObjectVector& data, \n ProgressDisplay* progress_bar) {\n if (ChunkBucket) {\n CreateCacheOptimizedBucket(data, CacheOptimizedBucket_, bucket_);\n } else {\n bucket_ = new ObjectVector(data);\n }\n if (progress_bar) (*progress_bar) += data.size();\n}\n\ntemplate <typename dist_t, typename SearchOracle>\nVPTree<dist_t, SearchOracle>::VPNode::VPNode(\n unsigned level,\n ProgressDisplay* progress_bar,\n const SearchOracle& oracle,\n const Space<dist_t>& space, const ObjectVector& data,\n size_t max_pivot_select_attempts,\n size_t BucketSize, bool ChunkBucket,\n bool use_random_center)\n : oracle_(oracle),\n pivot_(NULL), mediandist_(0),\n left_child_(NULL), right_child_(NULL),\n bucket_(NULL), CacheOptimizedBucket_(NULL)\n{\n CHECK(!data.empty());\n\n if (!data.empty() && data.size() <= BucketSize) {\n CreateBucket(ChunkBucket, data, progress_bar);\n return;\n }\n\n\n if (data.size() >= 2) {\n unsigned bestDP = 0;\n float largestSIGMA = 0;\n DistObjectPairVector<dist_t> dpARR[max_pivot_select_attempts];\n\n \/\/ To compute StdDev we need at least 2 points not counting the pivot\n size_t maxAtt = data.size() >= max(3, MIN_PIVOT_SELECT_DATA_QTY) ? max_pivot_select_attempts : 1;\n\n vector<double> dists(data.size());\n for (size_t att = 0; att < maxAtt; ++att) {\n dpARR[att].reserve(data.size());\n const size_t currPivotIndex = SelectVantagePoint(data, use_random_center);\n const Object* pCurrPivot = data[currPivotIndex];\n for (size_t i = 0; i < data.size(); ++i) {\n if (i == currPivotIndex) {\n continue;\n }\n \/\/ Distance can be asymmetric, the pivot is always on the left side!\n dist_t d = space.IndexTimeDistance(pCurrPivot, data[i]);\n dists[i] = d;\n dpARR[att].emplace_back(d, data[i]);\n }\n\n double sigma = StdDev(&dists[0], dists.size());\n if (att == 0 || sigma > largestSIGMA) {\n \/\/LOG(LIB_INFO) << \" ### \" << largestSIGMA << \" -> \" << sigma << \" att=\" << att << \" data.size()=\" << data.size();\n largestSIGMA = sigma;\n bestDP = att;\n pivot_ = pCurrPivot;\n std::sort(dpARR[att].begin(), dpARR[att].end(), DistObjectPairAscComparator<dist_t>());\n }\n }\n\n\n DistObjectPairVector<dist_t>& dp = dpARR[bestDP];\n DistObjectPair<dist_t> medianDistObj = GetMedian(dp);\n mediandist_ = medianDistObj.first; \n\n ObjectVector left;\n ObjectVector right;\n\n for (auto it = dp.begin(); it != dp.end(); ++it) {\n const Object* v = it->second;\n\n \/* \n * Note that here we compare a pair (distance, pointer)\n * If distances are equal, pointers are compared.\n * Thus, we would get a balanced split, even if the median\n * occurs many times in the array dp[].\n *\/\n if (*it < medianDistObj) {\n left.push_back(v);\n } else {\n right.push_back(v);\n }\n }\n\n \/*\n * Sometimes, e.g.., for integer-valued distances,\n * mediandist_ will be non-discriminative. In this case\n * it is more efficient to put everything into a single bucket.\n *\/\n size_t LeastSize = dp.size() \/ BalanceConst;\n\n if (left.size() < LeastSize || right.size() < LeastSize) {\n CreateBucket(ChunkBucket, data, progress_bar);\n return;\n }\n\n if (!left.empty()) {\n left_child_ = new VPNode(level + 1, progress_bar, oracle_, space, left, max_pivot_select_attempts, BucketSize, ChunkBucket, use_random_center);\n }\n\n if (!right.empty()) {\n right_child_ = new VPNode(level + 1, progress_bar, oracle_, space, right, max_pivot_select_attempts, BucketSize, ChunkBucket, use_random_center);\n }\n } else {\n CHECK_MSG(data.size() == 1, \"Bug: expect the subset to contain exactly one element!\");\n pivot_ = data[0];\n }\n}\n\ntemplate <typename dist_t, typename SearchOracle>\nVPTree<dist_t, SearchOracle>::VPNode::~VPNode() {\n delete left_child_;\n delete right_child_;\n ClearBucket(CacheOptimizedBucket_, bucket_);\n}\n\ntemplate <typename dist_t, typename SearchOracle>\ntemplate <typename QueryType>\nvoid VPTree<dist_t, SearchOracle>::VPNode::GenericSearch(QueryType* query,\n int& MaxLeavesToVisit) const {\n if (MaxLeavesToVisit <= 0) return; \/\/ early termination\n if (bucket_) {\n --MaxLeavesToVisit;\n\n for (unsigned i = 0; i < bucket_->size(); ++i) {\n const Object* Obj = (*bucket_)[i];\n dist_t distQC = query->DistanceObjLeft(Obj);\n query->CheckAndAddToResult(distQC, Obj);\n }\n return;\n }\n\n \/\/ Distance can be asymmetric, the pivot is always the left argument (see the function that creates the node)!\n dist_t distQC = query->DistanceObjLeft(pivot_);\n query->CheckAndAddToResult(distQC, pivot_);\n\n if (distQC < mediandist_) { \/\/ the query is inside\n \/\/ then first check inside\n if (left_child_ != NULL && oracle_.Classify(distQC, query->Radius(), mediandist_) != kVisitRight)\n left_child_->GenericSearch(query, MaxLeavesToVisit);\n\n \/* \n * After potentially visiting the left child, we need to reclassify the node,\n * because the query radius might have decreased.\n *\/\n\n\n \/\/ after that outside\n if (right_child_ != NULL && oracle_.Classify(distQC, query->Radius(), mediandist_) != kVisitLeft)\n right_child_->GenericSearch(query, MaxLeavesToVisit);\n } else { \/\/ the query is outside\n \/\/ then first check outside\n if (right_child_ != NULL && oracle_.Classify(distQC, query->Radius(), mediandist_) != kVisitLeft)\n right_child_->GenericSearch(query, MaxLeavesToVisit);\n\n \/* \n * After potentially visiting the left child, we need to reclassify the node,\n * because the query radius might have decreased.\n *\/\n\n \/\/ after that inside\n if (left_child_ != NULL && oracle_.Classify(distQC, query->Radius(), mediandist_) != kVisitRight)\n left_child_->GenericSearch(query, MaxLeavesToVisit);\n }\n}\n\ntemplate class VPTree<float, PolynomialPruner<float> >;\ntemplate class VPTree<double, PolynomialPruner<double> >;\ntemplate class VPTree<int, PolynomialPruner<int> >;\n\n} \/\/ namespace similarity\n\n<commit_msg>Fix windows build<commit_after>\/**\n * Non-metric Space Library\n *\n * Authors: Bilegsaikhan Naidan (https:\/\/github.com\/bileg), Leonid Boytsov (http:\/\/boytsov.info).\n * With contributions from Lawrence Cayton (http:\/\/lcayton.com\/) and others.\n *\n * For the complete list of contributors and further details see:\n * https:\/\/github.com\/searchivarius\/NonMetricSpaceLib \n * \n * Copyright (c) 2014\n *\n * This code is released under the\n * Apache License Version 2.0 http:\/\/www.apache.org\/licenses\/.\n *\n *\/\n#include <algorithm>\n#include <iostream>\n#include <fstream>\n#include <sstream>\n#include <string>\n#include <cmath>\n\n#include \"space.h\"\n#include \"rangequery.h\"\n#include \"knnquery.h\"\n#include \"searchoracle.h\"\n#include \"method\/vptree.h\"\n#include \"method\/vptree_utils.h\"\n#include \"methodfactory.h\"\n\n#define MIN_PIVOT_SELECT_DATA_QTY 10\n#define MAX_PIVOT_SELECT_ATTEMPTS 5\n\nnamespace similarity {\n\nusing std::string;\nusing std::stringstream;\nusing std::endl;\nusing std::cout;\nusing std::cerr;\n \ntemplate <typename dist_t, typename SearchOracle>\nVPTree<dist_t, SearchOracle>::VPTree(\n bool PrintProgress,\n Space<dist_t>& space,\n const ObjectVector& data,\n bool use_random_center) : \n space_(space),\n data_(data),\n PrintProgress_(PrintProgress),\n use_random_center_(use_random_center),\n max_pivot_select_attempts_(MAX_PIVOT_SELECT_ATTEMPTS),\n oracle_(space, data, PrintProgress),\n QueryTimeParams_(oracle_.GetQueryTimeParamNames()) { \n QueryTimeParams_.push_back(\"maxLeavesToVisit\");\n }\n\ntemplate <typename dist_t, typename SearchOracle>\nvoid VPTree<dist_t, SearchOracle>::CreateIndex(const AnyParams& IndexParams) {\n AnyParamManager pmgr(IndexParams);\n\n pmgr.GetParamOptional(\"bucketSize\", BucketSize_, 50);\n pmgr.GetParamOptional(\"chunkBucket\", ChunkBucket_, true);\n pmgr.GetParamOptional(\"selectPivotAttempts\", max_pivot_select_attempts_, MAX_PIVOT_SELECT_ATTEMPTS);\n\n CHECK_MSG(max_pivot_select_attempts_ >= 1, \"selectPivotAttempts should be >=1\");\n\n LOG(LIB_INFO) << \"bucketSize = \" << BucketSize_;\n LOG(LIB_INFO) << \"chunkBucket = \" << ChunkBucket_;\n LOG(LIB_INFO) << \"selectPivotAttempts = \" << max_pivot_select_attempts_;\n\n \/\/ Call this function *ONLY AFTER* the bucket size is obtained!\n oracle_.SetIndexTimeParams(pmgr);\n oracle_.LogParams();\n\n pmgr.CheckUnused();\n\n this->ResetQueryTimeParams(); \/\/ reset query-time parameters\n\n unique_ptr<ProgressDisplay> progress_bar(PrintProgress_ ? \n new ProgressDisplay(data_.size(), cerr):\n NULL);\n\n root_.reset(new VPNode(0,\n progress_bar.get(), \n oracle_, \n space_, data_,\n max_pivot_select_attempts_,\n BucketSize_, ChunkBucket_,\n use_random_center_ \/* use random center *\/));\n\n if (progress_bar) { \/\/ make it 100%\n (*progress_bar) += (progress_bar->expected_count() - progress_bar->count());\n }\n}\n\ntemplate <typename dist_t,typename SearchOracle>\nVPTree<dist_t, SearchOracle>::~VPTree() {\n}\n\ntemplate <typename dist_t,typename SearchOracle>\nconst std::string VPTree<dist_t, SearchOracle>::StrDesc() const {\n return \"vptree: \" + SearchOracle::GetName();\n}\n\ntemplate <typename dist_t, typename SearchOracle>\nvoid VPTree<dist_t, SearchOracle>::Search(RangeQuery<dist_t>* query, IdType) const {\n int mx = MaxLeavesToVisit_;\n root_->GenericSearch(query, mx);\n}\n\ntemplate <typename dist_t, typename SearchOracle>\nvoid VPTree<dist_t, SearchOracle>::Search(KNNQuery<dist_t>* query, IdType) const {\n int mx = MaxLeavesToVisit_;\n root_->GenericSearch(query, mx);\n}\n\ntemplate <typename dist_t, typename SearchOracle>\nvoid VPTree<dist_t, SearchOracle>::VPNode::CreateBucket(bool ChunkBucket, \n const ObjectVector& data, \n ProgressDisplay* progress_bar) {\n if (ChunkBucket) {\n CreateCacheOptimizedBucket(data, CacheOptimizedBucket_, bucket_);\n } else {\n bucket_ = new ObjectVector(data);\n }\n if (progress_bar) (*progress_bar) += data.size();\n}\n\ntemplate <typename dist_t, typename SearchOracle>\nVPTree<dist_t, SearchOracle>::VPNode::VPNode(\n unsigned level,\n ProgressDisplay* progress_bar,\n const SearchOracle& oracle,\n const Space<dist_t>& space, const ObjectVector& data,\n size_t max_pivot_select_attempts,\n size_t BucketSize, bool ChunkBucket,\n bool use_random_center)\n : oracle_(oracle),\n pivot_(NULL), mediandist_(0),\n left_child_(NULL), right_child_(NULL),\n bucket_(NULL), CacheOptimizedBucket_(NULL)\n{\n CHECK(!data.empty());\n\n if (!data.empty() && data.size() <= BucketSize) {\n CreateBucket(ChunkBucket, data, progress_bar);\n return;\n }\n\n\n if (data.size() >= 2) {\n unsigned bestDP = 0;\n float largestSIGMA = 0;\n vector<DistObjectPairVector<dist_t>> dpARR(max_pivot_select_attempts);\n\n \/\/ To compute StdDev we need at least 2 points not counting the pivot\n size_t maxAtt = data.size() >= max(3, MIN_PIVOT_SELECT_DATA_QTY) ? max_pivot_select_attempts : 1;\n\n vector<double> dists(data.size());\n for (size_t att = 0; att < maxAtt; ++att) {\n dpARR[att].reserve(data.size());\n const size_t currPivotIndex = SelectVantagePoint(data, use_random_center);\n const Object* pCurrPivot = data[currPivotIndex];\n for (size_t i = 0; i < data.size(); ++i) {\n if (i == currPivotIndex) {\n continue;\n }\n \/\/ Distance can be asymmetric, the pivot is always on the left side!\n dist_t d = space.IndexTimeDistance(pCurrPivot, data[i]);\n dists[i] = d;\n dpARR[att].emplace_back(d, data[i]);\n }\n\n double sigma = StdDev(&dists[0], dists.size());\n if (att == 0 || sigma > largestSIGMA) {\n \/\/LOG(LIB_INFO) << \" ### \" << largestSIGMA << \" -> \" << sigma << \" att=\" << att << \" data.size()=\" << data.size();\n largestSIGMA = sigma;\n bestDP = att;\n pivot_ = pCurrPivot;\n std::sort(dpARR[att].begin(), dpARR[att].end(), DistObjectPairAscComparator<dist_t>());\n }\n }\n\n\n DistObjectPairVector<dist_t>& dp = dpARR[bestDP];\n DistObjectPair<dist_t> medianDistObj = GetMedian(dp);\n mediandist_ = medianDistObj.first; \n\n ObjectVector left;\n ObjectVector right;\n\n for (auto it = dp.begin(); it != dp.end(); ++it) {\n const Object* v = it->second;\n\n \/* \n * Note that here we compare a pair (distance, pointer)\n * If distances are equal, pointers are compared.\n * Thus, we would get a balanced split, even if the median\n * occurs many times in the array dp[].\n *\/\n if (*it < medianDistObj) {\n left.push_back(v);\n } else {\n right.push_back(v);\n }\n }\n\n \/*\n * Sometimes, e.g.., for integer-valued distances,\n * mediandist_ will be non-discriminative. In this case\n * it is more efficient to put everything into a single bucket.\n *\/\n size_t LeastSize = dp.size() \/ BalanceConst;\n\n if (left.size() < LeastSize || right.size() < LeastSize) {\n CreateBucket(ChunkBucket, data, progress_bar);\n return;\n }\n\n if (!left.empty()) {\n left_child_ = new VPNode(level + 1, progress_bar, oracle_, space, left, max_pivot_select_attempts, BucketSize, ChunkBucket, use_random_center);\n }\n\n if (!right.empty()) {\n right_child_ = new VPNode(level + 1, progress_bar, oracle_, space, right, max_pivot_select_attempts, BucketSize, ChunkBucket, use_random_center);\n }\n } else {\n CHECK_MSG(data.size() == 1, \"Bug: expect the subset to contain exactly one element!\");\n pivot_ = data[0];\n }\n}\n\ntemplate <typename dist_t, typename SearchOracle>\nVPTree<dist_t, SearchOracle>::VPNode::~VPNode() {\n delete left_child_;\n delete right_child_;\n ClearBucket(CacheOptimizedBucket_, bucket_);\n}\n\ntemplate <typename dist_t, typename SearchOracle>\ntemplate <typename QueryType>\nvoid VPTree<dist_t, SearchOracle>::VPNode::GenericSearch(QueryType* query,\n int& MaxLeavesToVisit) const {\n if (MaxLeavesToVisit <= 0) return; \/\/ early termination\n if (bucket_) {\n --MaxLeavesToVisit;\n\n for (unsigned i = 0; i < bucket_->size(); ++i) {\n const Object* Obj = (*bucket_)[i];\n dist_t distQC = query->DistanceObjLeft(Obj);\n query->CheckAndAddToResult(distQC, Obj);\n }\n return;\n }\n\n \/\/ Distance can be asymmetric, the pivot is always the left argument (see the function that creates the node)!\n dist_t distQC = query->DistanceObjLeft(pivot_);\n query->CheckAndAddToResult(distQC, pivot_);\n\n if (distQC < mediandist_) { \/\/ the query is inside\n \/\/ then first check inside\n if (left_child_ != NULL && oracle_.Classify(distQC, query->Radius(), mediandist_) != kVisitRight)\n left_child_->GenericSearch(query, MaxLeavesToVisit);\n\n \/* \n * After potentially visiting the left child, we need to reclassify the node,\n * because the query radius might have decreased.\n *\/\n\n\n \/\/ after that outside\n if (right_child_ != NULL && oracle_.Classify(distQC, query->Radius(), mediandist_) != kVisitLeft)\n right_child_->GenericSearch(query, MaxLeavesToVisit);\n } else { \/\/ the query is outside\n \/\/ then first check outside\n if (right_child_ != NULL && oracle_.Classify(distQC, query->Radius(), mediandist_) != kVisitLeft)\n right_child_->GenericSearch(query, MaxLeavesToVisit);\n\n \/* \n * After potentially visiting the left child, we need to reclassify the node,\n * because the query radius might have decreased.\n *\/\n\n \/\/ after that inside\n if (left_child_ != NULL && oracle_.Classify(distQC, query->Radius(), mediandist_) != kVisitRight)\n left_child_->GenericSearch(query, MaxLeavesToVisit);\n }\n}\n\ntemplate class VPTree<float, PolynomialPruner<float> >;\ntemplate class VPTree<double, PolynomialPruner<double> >;\ntemplate class VPTree<int, PolynomialPruner<int> >;\n\n} \/\/ namespace similarity\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 \"skia\/ext\/bitmap_platform_device_mac.h\"\n\n#include <time.h>\n\n#include \"SkMatrix.h\"\n#include \"SkRegion.h\"\n#include \"SkTypes.h\"\n#include \"SkUtils.h\"\n\n#include \"skia\/ext\/skia_utils_mac.h\"\n\nnamespace skia {\n\nnamespace {\n\n\/\/ Constrains position and size to fit within available_size. If |size| is -1,\n\/\/ all the |available_size| is used. Returns false if the position is out of\n\/\/ |available_size|.\nbool Constrain(int available_size, int* position, int *size) {\n if (*size < -2)\n return false;\n\n if (*position < 0) {\n if (*size != -1)\n *size += *position;\n *position = 0;\n }\n if (*size == 0 || *position >= available_size)\n return false;\n\n if (*size > 0) {\n int overflow = (*position + *size) - available_size;\n if (overflow > 0) {\n *size -= overflow;\n }\n } else {\n \/\/ Fill up available size.\n *size = available_size - *position;\n }\n return true;\n}\n\n} \/\/ namespace\n\nclass BitmapPlatformDeviceMac::BitmapPlatformDeviceMacData : public SkRefCnt {\n public:\n explicit BitmapPlatformDeviceMacData(CGContextRef bitmap);\n\n \/\/ Create\/destroy CoreGraphics context for our bitmap data.\n CGContextRef GetBitmapContext() {\n LoadConfig();\n return bitmap_context_;\n }\n\n void ReleaseBitmapContext() {\n SkASSERT(bitmap_context_);\n CGContextRelease(bitmap_context_);\n bitmap_context_ = NULL;\n }\n\n \/\/ Sets the transform and clip operations. This will not update the CGContext,\n \/\/ but will mark the config as dirty. The next call of LoadConfig will\n \/\/ pick up these changes.\n void SetMatrixClip(const SkMatrix& transform, const SkRegion& region);\n\n \/\/ Loads the current transform and clip into the DC. Can be called even when\n \/\/ |bitmap_context_| is NULL (will be a NOP).\n void LoadConfig();\n\n \/\/ Lazily-created graphics context used to draw into the bitmap.\n CGContextRef bitmap_context_;\n\n \/\/ True when there is a transform or clip that has not been set to the\n \/\/ CGContext. The CGContext is retrieved for every text operation, and the\n \/\/ transform and clip do not change as much. We can save time by not loading\n \/\/ the clip and transform for every one.\n bool config_dirty_;\n\n \/\/ Translation assigned to the CGContext: we need to keep track of this\n \/\/ separately so it can be updated even if the CGContext isn't created yet.\n SkMatrix transform_;\n\n \/\/ The current clipping\n SkRegion clip_region_;\n\n private:\n friend class base::RefCounted<BitmapPlatformDeviceMacData>;\n ~BitmapPlatformDeviceMacData() {\n if (bitmap_context_)\n CGContextRelease(bitmap_context_);\n }\n\n \/\/ Disallow copy & assign.\n BitmapPlatformDeviceMacData(const BitmapPlatformDeviceMacData&);\n BitmapPlatformDeviceMacData& operator=(const BitmapPlatformDeviceMacData&);\n};\n\nBitmapPlatformDeviceMac::\\\n BitmapPlatformDeviceMacData::BitmapPlatformDeviceMacData(\n CGContextRef bitmap)\n : bitmap_context_(bitmap),\n config_dirty_(true) { \/\/ Want to load the config next time.\n SkASSERT(bitmap_context_);\n \/\/ Initialize the clip region to the entire bitmap.\n\n SkIRect rect;\n rect.set(0, 0,\n CGBitmapContextGetWidth(bitmap_context_),\n CGBitmapContextGetHeight(bitmap_context_));\n clip_region_ = SkRegion(rect);\n transform_.reset();\n CGContextRetain(bitmap_context_);\n}\n\nvoid BitmapPlatformDeviceMac::BitmapPlatformDeviceMacData::SetMatrixClip(\n const SkMatrix& transform,\n const SkRegion& region) {\n transform_ = transform;\n clip_region_ = region;\n config_dirty_ = true;\n}\n\nvoid BitmapPlatformDeviceMac::BitmapPlatformDeviceMacData::LoadConfig() {\n if (!config_dirty_ || !bitmap_context_)\n return; \/\/ Nothing to do.\n config_dirty_ = false;\n\n \/\/ Transform.\n SkMatrix t(transform_);\n LoadTransformToCGContext(bitmap_context_, t);\n t.setTranslateX(-t.getTranslateX());\n t.setTranslateY(-t.getTranslateY());\n LoadClippingRegionToCGContext(bitmap_context_, clip_region_, t);\n}\n\n\n\/\/ We use this static factory function instead of the regular constructor so\n\/\/ that we can create the pixel data before calling the constructor. This is\n\/\/ required so that we can call the base class' constructor with the pixel\n\/\/ data.\nBitmapPlatformDeviceMac* BitmapPlatformDeviceMac::Create(CGContextRef context,\n int width,\n int height,\n bool is_opaque) {\n void* data = malloc(height * width * 4);\n if (!data) return NULL;\n\n SkBitmap bitmap;\n bitmap.setConfig(SkBitmap::kARGB_8888_Config, width, height);\n bitmap.setPixels(data);\n\n \/\/ Note: The Windows implementation clears the Bitmap later on.\n \/\/ This bears mentioning since removal of this line makes the\n \/\/ unit tests only fail periodically (or when MallocPreScribble is set).\n bitmap.eraseARGB(0, 0, 0, 0);\n\n bitmap.setIsOpaque(is_opaque);\n\n if (is_opaque) {\n#ifndef NDEBUG\n \/\/ To aid in finding bugs, we set the background color to something\n \/\/ obviously wrong so it will be noticable when it is not cleared\n bitmap.eraseARGB(255, 0, 255, 128); \/\/ bright bluish green\n#endif\n }\n\n if (!context) {\n CGColorSpaceRef color_space =\n CGColorSpaceCreateWithName(kCGColorSpaceGenericRGB);\n \/\/ allocate a bitmap context with 4 components per pixel (BGRA). Apple\n \/\/ recommends these flags for improved CG performance.\n context =\n CGBitmapContextCreate(data, width, height, 8, width*4,\n color_space,\n kCGImageAlphaPremultipliedFirst |\n kCGBitmapByteOrder32Host);\n\n \/\/ Change the coordinate system to match WebCore's\n CGContextTranslateCTM(context, 0, height);\n CGContextScaleCTM(context, 1.0, -1.0);\n CGColorSpaceRelease(color_space);\n }\n\n \/\/ The device object will take ownership of the graphics context.\n return new BitmapPlatformDeviceMac(\n new BitmapPlatformDeviceMacData(context), bitmap);\n}\n\n\/\/ The device will own the bitmap, which corresponds to also owning the pixel\n\/\/ data. Therefore, we do not transfer ownership to the SkDevice's bitmap.\nBitmapPlatformDeviceMac::BitmapPlatformDeviceMac(\n BitmapPlatformDeviceMacData* data, const SkBitmap& bitmap)\n : PlatformDeviceMac(bitmap),\n data_(data) {\n}\n\n\/\/ The copy constructor just adds another reference to the underlying data.\n\/\/ We use a const cast since the default Skia definitions don't define the\n\/\/ proper constedness that we expect (accessBitmap should really be const).\nBitmapPlatformDeviceMac::BitmapPlatformDeviceMac(\n const BitmapPlatformDeviceMac& other)\n : PlatformDeviceMac(\n const_cast<BitmapPlatformDeviceMac&>(other).accessBitmap(true)),\n data_(other.data_) {\n data_->ref();\n}\n\nBitmapPlatformDeviceMac::~BitmapPlatformDeviceMac() {\n data_->unref();\n}\n\nBitmapPlatformDeviceMac& BitmapPlatformDeviceMac::operator=(\n const BitmapPlatformDeviceMac& other) {\n data_ = other.data_;\n data_->ref();\n return *this;\n}\n\nCGContextRef BitmapPlatformDeviceMac::GetBitmapContext() {\n return data_->GetBitmapContext();\n}\n\nvoid BitmapPlatformDeviceMac::setMatrixClip(const SkMatrix& transform, \n const SkRegion& region) {\n data_->SetMatrixClip(transform, region);\n}\n\nvoid BitmapPlatformDeviceMac::DrawToContext(CGContextRef context, int x, int y,\n const CGRect* src_rect) {\n bool created_dc = false;\n if (!data_->bitmap_context_) {\n created_dc = true;\n GetBitmapContext();\n }\n\n \/\/ this should not make a copy of the bits, since we're not doing\n \/\/ anything to trigger copy on write\n CGImageRef image = CGBitmapContextCreateImage(data_->bitmap_context_);\n CGRect bounds;\n if (src_rect) {\n bounds = *src_rect;\n bounds.origin.x = x;\n bounds.origin.y = y;\n CGImageRef sub_image = CGImageCreateWithImageInRect(image, *src_rect);\n CGContextDrawImage(context, bounds, sub_image);\n CGImageRelease(sub_image);\n } else {\n bounds.origin.x = 0;\n bounds.origin.y = 0;\n bounds.size.width = width();\n bounds.size.height = height();\n CGContextDrawImage(context, bounds, image);\n }\n CGImageRelease(image);\n\n if (created_dc)\n data_->ReleaseBitmapContext();\n}\n\n\/\/ Returns the color value at the specified location.\nSkColor BitmapPlatformDeviceMac::getColorAt(int x, int y) {\n const SkBitmap& bitmap = accessBitmap(true);\n SkAutoLockPixels lock(bitmap);\n uint32_t* data = bitmap.getAddr32(0, 0);\n return static_cast<SkColor>(data[x + y * width()]);\n}\n\nvoid BitmapPlatformDeviceMac::onAccessBitmap(SkBitmap*) {\n \/\/ Not needed in CoreGraphics\n}\n\nvoid BitmapPlatformDeviceMac::processPixels(int x, int y,\n int width, int height,\n adjustAlpha adjustor) {\n const SkBitmap& bitmap = accessBitmap(true);\n SkMatrix& matrix = data_->transform_;\n int bitmap_start_x = SkScalarRound(matrix.getTranslateX()) + x;\n int bitmap_start_y = SkScalarRound(matrix.getTranslateY()) + y;\n\n SkAutoLockPixels lock(bitmap);\n if (Constrain(bitmap.width(), &bitmap_start_x, &width) &&\n Constrain(bitmap.height(), &bitmap_start_y, &height)) {\n uint32_t* data = bitmap.getAddr32(0, 0);\n size_t row_words = bitmap.rowBytes() \/ 4;\n for (int i = 0; i < height; i++) {\n size_t offset = (i + bitmap_start_y) * row_words + bitmap_start_x;\n for (int j = 0; j < width; j++) {\n adjustor(data + offset + j);\n }\n }\n }\n}\n\n} \/\/ namespace skia\n\n<commit_msg>Fix memory leak of \"screen size bitmap\" (e.g. 1.5M if 750x548) that happened on *every page view* on OSX.<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 \"skia\/ext\/bitmap_platform_device_mac.h\"\n\n#include <time.h>\n\n#include \"SkMatrix.h\"\n#include \"SkRegion.h\"\n#include \"SkTypes.h\"\n#include \"SkUtils.h\"\n\n#include \"skia\/ext\/skia_utils_mac.h\"\n\nnamespace skia {\n\nnamespace {\n\n\/\/ Constrains position and size to fit within available_size. If |size| is -1,\n\/\/ all the |available_size| is used. Returns false if the position is out of\n\/\/ |available_size|.\nbool Constrain(int available_size, int* position, int *size) {\n if (*size < -2)\n return false;\n\n if (*position < 0) {\n if (*size != -1)\n *size += *position;\n *position = 0;\n }\n if (*size == 0 || *position >= available_size)\n return false;\n\n if (*size > 0) {\n int overflow = (*position + *size) - available_size;\n if (overflow > 0) {\n *size -= overflow;\n }\n } else {\n \/\/ Fill up available size.\n *size = available_size - *position;\n }\n return true;\n}\n\n} \/\/ namespace\n\nclass BitmapPlatformDeviceMac::BitmapPlatformDeviceMacData : public SkRefCnt {\n public:\n explicit BitmapPlatformDeviceMacData(CGContextRef bitmap);\n\n \/\/ Create\/destroy CoreGraphics context for our bitmap data.\n CGContextRef GetBitmapContext() {\n LoadConfig();\n return bitmap_context_;\n }\n\n void ReleaseBitmapContext() {\n SkASSERT(bitmap_context_);\n CGContextRelease(bitmap_context_);\n bitmap_context_ = NULL;\n }\n\n \/\/ Sets the transform and clip operations. This will not update the CGContext,\n \/\/ but will mark the config as dirty. The next call of LoadConfig will\n \/\/ pick up these changes.\n void SetMatrixClip(const SkMatrix& transform, const SkRegion& region);\n\n \/\/ Loads the current transform and clip into the DC. Can be called even when\n \/\/ |bitmap_context_| is NULL (will be a NOP).\n void LoadConfig();\n\n \/\/ Lazily-created graphics context used to draw into the bitmap.\n CGContextRef bitmap_context_;\n\n \/\/ True when there is a transform or clip that has not been set to the\n \/\/ CGContext. The CGContext is retrieved for every text operation, and the\n \/\/ transform and clip do not change as much. We can save time by not loading\n \/\/ the clip and transform for every one.\n bool config_dirty_;\n\n \/\/ Translation assigned to the CGContext: we need to keep track of this\n \/\/ separately so it can be updated even if the CGContext isn't created yet.\n SkMatrix transform_;\n\n \/\/ The current clipping\n SkRegion clip_region_;\n\n private:\n friend class base::RefCounted<BitmapPlatformDeviceMacData>;\n ~BitmapPlatformDeviceMacData() {\n if (bitmap_context_)\n CGContextRelease(bitmap_context_);\n }\n\n \/\/ Disallow copy & assign.\n BitmapPlatformDeviceMacData(const BitmapPlatformDeviceMacData&);\n BitmapPlatformDeviceMacData& operator=(const BitmapPlatformDeviceMacData&);\n};\n\nBitmapPlatformDeviceMac::\\\n BitmapPlatformDeviceMacData::BitmapPlatformDeviceMacData(\n CGContextRef bitmap)\n : bitmap_context_(bitmap),\n config_dirty_(true) { \/\/ Want to load the config next time.\n SkASSERT(bitmap_context_);\n \/\/ Initialize the clip region to the entire bitmap.\n\n SkIRect rect;\n rect.set(0, 0,\n CGBitmapContextGetWidth(bitmap_context_),\n CGBitmapContextGetHeight(bitmap_context_));\n clip_region_ = SkRegion(rect);\n transform_.reset();\n CGContextRetain(bitmap_context_);\n}\n\nvoid BitmapPlatformDeviceMac::BitmapPlatformDeviceMacData::SetMatrixClip(\n const SkMatrix& transform,\n const SkRegion& region) {\n transform_ = transform;\n clip_region_ = region;\n config_dirty_ = true;\n}\n\nvoid BitmapPlatformDeviceMac::BitmapPlatformDeviceMacData::LoadConfig() {\n if (!config_dirty_ || !bitmap_context_)\n return; \/\/ Nothing to do.\n config_dirty_ = false;\n\n \/\/ Transform.\n SkMatrix t(transform_);\n LoadTransformToCGContext(bitmap_context_, t);\n t.setTranslateX(-t.getTranslateX());\n t.setTranslateY(-t.getTranslateY());\n LoadClippingRegionToCGContext(bitmap_context_, clip_region_, t);\n}\n\n\n\/\/ We use this static factory function instead of the regular constructor so\n\/\/ that we can create the pixel data before calling the constructor. This is\n\/\/ required so that we can call the base class' constructor with the pixel\n\/\/ data.\nBitmapPlatformDeviceMac* BitmapPlatformDeviceMac::Create(CGContextRef context,\n int width,\n int height,\n bool is_opaque) {\n SkBitmap bitmap;\n bitmap.setConfig(SkBitmap::kARGB_8888_Config, width, height);\n if (bitmap.allocPixels() != true)\n return NULL;\n void* data = bitmap.getPixels();\n\n \/\/ Note: The Windows implementation clears the Bitmap later on.\n \/\/ This bears mentioning since removal of this line makes the\n \/\/ unit tests only fail periodically (or when MallocPreScribble is set).\n bitmap.eraseARGB(0, 0, 0, 0);\n\n bitmap.setIsOpaque(is_opaque);\n\n if (is_opaque) {\n#ifndef NDEBUG\n \/\/ To aid in finding bugs, we set the background color to something\n \/\/ obviously wrong so it will be noticable when it is not cleared\n bitmap.eraseARGB(255, 0, 255, 128); \/\/ bright bluish green\n#endif\n }\n\n if (!context) {\n CGColorSpaceRef color_space =\n CGColorSpaceCreateWithName(kCGColorSpaceGenericRGB);\n \/\/ allocate a bitmap context with 4 components per pixel (BGRA). Apple\n \/\/ recommends these flags for improved CG performance.\n context =\n CGBitmapContextCreate(data, width, height, 8, width*4,\n color_space,\n kCGImageAlphaPremultipliedFirst |\n kCGBitmapByteOrder32Host);\n\n \/\/ Change the coordinate system to match WebCore's\n CGContextTranslateCTM(context, 0, height);\n CGContextScaleCTM(context, 1.0, -1.0);\n CGColorSpaceRelease(color_space);\n }\n\n \/\/ The device object will take ownership of the graphics context.\n return new BitmapPlatformDeviceMac(\n new BitmapPlatformDeviceMacData(context), bitmap);\n}\n\n\/\/ The device will own the bitmap, which corresponds to also owning the pixel\n\/\/ data. Therefore, we do not transfer ownership to the SkDevice's bitmap.\nBitmapPlatformDeviceMac::BitmapPlatformDeviceMac(\n BitmapPlatformDeviceMacData* data, const SkBitmap& bitmap)\n : PlatformDeviceMac(bitmap),\n data_(data) {\n}\n\n\/\/ The copy constructor just adds another reference to the underlying data.\n\/\/ We use a const cast since the default Skia definitions don't define the\n\/\/ proper constedness that we expect (accessBitmap should really be const).\nBitmapPlatformDeviceMac::BitmapPlatformDeviceMac(\n const BitmapPlatformDeviceMac& other)\n : PlatformDeviceMac(\n const_cast<BitmapPlatformDeviceMac&>(other).accessBitmap(true)),\n data_(other.data_) {\n data_->ref();\n}\n\nBitmapPlatformDeviceMac::~BitmapPlatformDeviceMac() {\n data_->unref();\n}\n\nBitmapPlatformDeviceMac& BitmapPlatformDeviceMac::operator=(\n const BitmapPlatformDeviceMac& other) {\n data_ = other.data_;\n data_->ref();\n return *this;\n}\n\nCGContextRef BitmapPlatformDeviceMac::GetBitmapContext() {\n return data_->GetBitmapContext();\n}\n\nvoid BitmapPlatformDeviceMac::setMatrixClip(const SkMatrix& transform,\n const SkRegion& region) {\n data_->SetMatrixClip(transform, region);\n}\n\nvoid BitmapPlatformDeviceMac::DrawToContext(CGContextRef context, int x, int y,\n const CGRect* src_rect) {\n bool created_dc = false;\n if (!data_->bitmap_context_) {\n created_dc = true;\n GetBitmapContext();\n }\n\n \/\/ this should not make a copy of the bits, since we're not doing\n \/\/ anything to trigger copy on write\n CGImageRef image = CGBitmapContextCreateImage(data_->bitmap_context_);\n CGRect bounds;\n if (src_rect) {\n bounds = *src_rect;\n bounds.origin.x = x;\n bounds.origin.y = y;\n CGImageRef sub_image = CGImageCreateWithImageInRect(image, *src_rect);\n CGContextDrawImage(context, bounds, sub_image);\n CGImageRelease(sub_image);\n } else {\n bounds.origin.x = 0;\n bounds.origin.y = 0;\n bounds.size.width = width();\n bounds.size.height = height();\n CGContextDrawImage(context, bounds, image);\n }\n CGImageRelease(image);\n\n if (created_dc)\n data_->ReleaseBitmapContext();\n}\n\n\/\/ Returns the color value at the specified location.\nSkColor BitmapPlatformDeviceMac::getColorAt(int x, int y) {\n const SkBitmap& bitmap = accessBitmap(true);\n SkAutoLockPixels lock(bitmap);\n uint32_t* data = bitmap.getAddr32(0, 0);\n return static_cast<SkColor>(data[x + y * width()]);\n}\n\nvoid BitmapPlatformDeviceMac::onAccessBitmap(SkBitmap*) {\n \/\/ Not needed in CoreGraphics\n}\n\nvoid BitmapPlatformDeviceMac::processPixels(int x, int y,\n int width, int height,\n adjustAlpha adjustor) {\n const SkBitmap& bitmap = accessBitmap(true);\n SkMatrix& matrix = data_->transform_;\n int bitmap_start_x = SkScalarRound(matrix.getTranslateX()) + x;\n int bitmap_start_y = SkScalarRound(matrix.getTranslateY()) + y;\n\n SkAutoLockPixels lock(bitmap);\n if (Constrain(bitmap.width(), &bitmap_start_x, &width) &&\n Constrain(bitmap.height(), &bitmap_start_y, &height)) {\n uint32_t* data = bitmap.getAddr32(0, 0);\n size_t row_words = bitmap.rowBytes() \/ 4;\n for (int i = 0; i < height; i++) {\n size_t offset = (i + bitmap_start_y) * row_words + bitmap_start_x;\n for (int j = 0; j < width; j++) {\n adjustor(data + offset + j);\n }\n }\n }\n}\n\n} \/\/ namespace skia\n\n<|endoftext|>"} {"text":"<commit_before>\/***************************************************************************\n * Copyright (c) 2018 Torsten Sadowski <tsadowski[at]gmx.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#include <FCConfig.h>\n#include \"SpaceballEvent.h\"\n\n#include <QMainWindow>\n\n#include \"GuiNativeEventLinuxX11.h\"\n\n#include \"GuiApplicationNativeEventAware.h\"\n#include <Base\/Console.h>\n\n#include <QX11Info>\n#include <spnav.h>\n\n#if QT_VERSION >= 0x050000\n #include \"GuiRawInputEventFilter.h\"\n #undef Bool\n #undef CursorShape\n #undef Expose\n #undef KeyPress\n #undef KeyRelease\n #undef FocusIn\n #undef FocusOut\n #undef FontChange\n #undef None\n #undef Status\n #undef Unsorted\n #undef False\n #undef True\n #undef Complex\n#endif \/\/ #if QT_VERSION >= 0x050000\n\nGui::GuiNativeEvent::GuiNativeEvent(Gui::GUIApplicationNativeEventAware *app)\n: GuiAbstractNativeEvent(app)\n{\n}\n\nGui::GuiNativeEvent::~GuiNativeEvent()\n{\n if (spnav_close())\n Base::Console().Log(\"Couldn't disconnect from spacenav daemon\\n\");\n else\n Base::Console().Log(\"Disconnected from spacenav daemon\\n\");\n}\n\nvoid Gui::GuiNativeEvent::initSpaceball(QMainWindow *window)\n{\n if (spnav_x11_open(QX11Info::display(), window->winId()) == -1) {\n Base::Console().Log(\"Couldn't connect to spacenav daemon\\n\");\n } else {\n Base::Console().Log(\"Connected to spacenav daemon\\n\");\n\t\tmainApp->setSpaceballPresent(true);\n\n #if QT_VERSION >= 0x050000\n mainApp->installNativeEventFilter(new Gui::RawInputEventFilter(&xcbEventFilter));\n #endif \/\/ #if QT_VERSION >= 0x050000\n }\n}\n\n#if QT_VERSION >= 0x050000\n\nbool Gui::GuiNativeEvent::xcbEventFilter(void *xcb_void, long* result)\n{\n Q_UNUSED(result);\n auto inst(dynamic_cast<Gui::GUIApplicationNativeEventAware *>(QApplication::instance()));\n if (!inst)\n return false;\n\n spnav_event navEvent;\n \n\tconst xcb_client_message_event_t* xcb_ev = static_cast<const xcb_client_message_event_t*>(xcb_void);\n \/\/ Qt4 used XEvents in native event filters, but Qt5 changed to XCB. The\n \/\/ SpaceNavigator API only works with XEvent, so we need to construct a\n \/\/ temporary XEvent with just enough information for spnav_x11_event()\n if ((xcb_ev->response_type & 0x7F) == XCB_CLIENT_MESSAGE) {\n XClientMessageEvent xev;\n\n xev.type = ClientMessage;\n xev.message_type = xcb_ev->type;\n memcpy(xev.data.b, xcb_ev->data.data8, sizeof(xev.data.b));\n xev.serial = 0; \/\/ These are just to squash warnings...\n xev.send_event = 0;\n xev.display = 0;\n xev.window = 0;\n xev.format = 0;\n\n if (!spnav_x11_event(reinterpret_cast<XEvent *>(&xev), &navEvent)) {\n return false;\n }\n } else {\n return false;\n }\n \/\/ navEvent is now initialised\n\n switch (navEvent.type) {\n case SPNAV_EVENT_MOTION:\n {\n motionDataArray[0] = -navEvent.motion.x;\n motionDataArray[1] = -navEvent.motion.z;\n motionDataArray[2] = -navEvent.motion.y;\n motionDataArray[3] = -navEvent.motion.rx;\n motionDataArray[4] = -navEvent.motion.rz;\n motionDataArray[5] = -navEvent.motion.ry;\n\n inst->postMotionEvent(motionDataArray);\n return true;\n }\n\n case SPNAV_EVENT_BUTTON:\n {\n auto buttonEvent(new Spaceball::ButtonEvent());\n buttonEvent->setButtonNumber(navEvent.button.bnum);\n if (navEvent.button.press) {\n buttonEvent->setButtonStatus(Spaceball::BUTTON_PRESSED);\n } else {\n buttonEvent->setButtonStatus(Spaceball::BUTTON_RELEASED);\n }\n inst->postButtonEvent(navEvent.button.bnum, navEvent.button.press);\n return true;\n }\n default:\n Base::Console().Log(\"Unknown spaceball event\\n\");\n return true;\n } \/\/ end switch (navEvent.type) {\n}\n\n#else \/\/ if QT_VERSION >= 0x050000\n\nbool Gui::GuiNativeEvent::x11EventFilter(XEvent *event)\n{\n \/*\n First we check if we have a motion flush event:\n - If there are unprocessed motion events we are in a flooding situation.\n In that case we wait with generating a Spaceball event.\n - A motion event counter of 0 indicates that FreeCAD is ready to process\n the event. A Spaceball event, using the saved motion data, is posted.\n *\/\n static Display* display = QX11Info::display();\n static Atom motion_flush_event = XInternAtom(display, \"FCMotionFlushEvent\", false);\n static int nMotionEvents = 0;\n\n if (event->type == ClientMessage)\n {\n Atom message_type = event->xclient.message_type;\n \n if (message_type == motion_flush_event)\n {\n nMotionEvents--;\n if (nMotionEvents == 0)\n { \n mainApp->postMotionEvent(motionDataArray);\n }\n \n return true;\n } \/\/ XEvent: motion_flush_event\n } \/\/ XEvent: ClientMessage\n\n \/*\n From here on we deal with spacenav events only:\n - motion: The event data is saved and a self addressed flush event\n is sent through the window system (XEvent). \n In the case of an event flooding, the motion data is added up.\n - button: A Spaceball event is posted (QInputEvent).\n *\/\n spnav_event navEvent;\n if (!spnav_x11_event(event, &navEvent))\n return false;\n\n if (navEvent.type == SPNAV_EVENT_MOTION)\n {\n \/*\n If the motion data of the preceding event has not been processed\n through posting an Spaceball event (flooding situation), \n the motion data provided by the incoming event is added to the saved data. \n *\/\n \tint dx, dy, dz, drx, dry, drz;\n\n if (nMotionEvents == 0)\n {\n dx = 0;\n dy = 0;\n dz = 0;\n drx = 0;\n dry = 0;\n drz = 0;\n }\n else\n {\n dx = motionDataArray[0];\n dy = motionDataArray[1];\n dz = motionDataArray[2];\n drx = motionDataArray[3];\n dry = motionDataArray[4];\n drz = motionDataArray[5];\n }\n \n motionDataArray[0] = -navEvent.motion.x;\n motionDataArray[1] = -navEvent.motion.z;\n motionDataArray[2] = -navEvent.motion.y;\n motionDataArray[3] = -navEvent.motion.rx;\n motionDataArray[4] = -navEvent.motion.rz;\n motionDataArray[5] = -navEvent.motion.ry;\n \n motionDataArray[0] += dx;\n motionDataArray[1] += dy;\n motionDataArray[2] += dz;\n motionDataArray[3] += drx;\n motionDataArray[4] += dry;\n motionDataArray[5] += drz;\n \n \/*\n Send a self addressed flush event through the window system. This will\n trigger a Spaceball event if FreeCAD is ready to do so.\n *\/\n nMotionEvents++;\n XClientMessageEvent flushEvent;\n \n flushEvent.display = display;\n flushEvent.window = event->xclient.window;\n flushEvent.type = ClientMessage;\n flushEvent.format = 8; \n flushEvent.message_type = motion_flush_event;\n \n XSendEvent (display, flushEvent.window, False, 0, (XEvent*)&flushEvent); \/\/ siehe spnavd, False, 0\n \n return true;\n }\n\n if (navEvent.type == SPNAV_EVENT_BUTTON)\n {\n mainApp->postButtonEvent(navEvent.button.bnum, navEvent.button.press);\n return true;\n }\n\n Base::Console().Log(\"Unknown spaceball event\\n\");\n return true;\n}\n#endif \/\/ if\/else QT_VERSION >= 0x050000\n\n#include \"3Dconnexion\/moc_GuiNativeEventLinuxX11.cpp\"\n<commit_msg>fixes 0003913: libspnav crash on linux wayland during startup<commit_after>\/***************************************************************************\n * Copyright (c) 2018 Torsten Sadowski <tsadowski[at]gmx.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#include <FCConfig.h>\n#include \"SpaceballEvent.h\"\n\n#include <QMainWindow>\n\n#include \"GuiNativeEventLinuxX11.h\"\n\n#include \"GuiApplicationNativeEventAware.h\"\n#include <Base\/Console.h>\n\n#include <QX11Info>\n#include <spnav.h>\n\n#if QT_VERSION >= 0x050000\n #include \"GuiRawInputEventFilter.h\"\n #undef Bool\n #undef CursorShape\n #undef Expose\n #undef KeyPress\n #undef KeyRelease\n #undef FocusIn\n #undef FocusOut\n #undef FontChange\n #undef None\n #undef Status\n #undef Unsorted\n #undef False\n #undef True\n #undef Complex\n#endif \/\/ #if QT_VERSION >= 0x050000\n\nGui::GuiNativeEvent::GuiNativeEvent(Gui::GUIApplicationNativeEventAware *app)\n: GuiAbstractNativeEvent(app)\n{\n}\n\nGui::GuiNativeEvent::~GuiNativeEvent()\n{\n if (spnav_close())\n Base::Console().Log(\"Couldn't disconnect from spacenav daemon\\n\");\n else\n Base::Console().Log(\"Disconnected from spacenav daemon\\n\");\n}\n\nvoid Gui::GuiNativeEvent::initSpaceball(QMainWindow *window)\n{\n#if QT_VERSION >= 0x050200\n if (!QX11Info::isPlatformX11()) {\n Base::Console().Log(\"Application is not running on X11\\n\");\n return;\n }\n#endif\n if (spnav_x11_open(QX11Info::display(), window->winId()) == -1) {\n Base::Console().Log(\"Couldn't connect to spacenav daemon\\n\");\n } else {\n Base::Console().Log(\"Connected to spacenav daemon\\n\");\n mainApp->setSpaceballPresent(true);\n\n#if QT_VERSION >= 0x050000\n mainApp->installNativeEventFilter(new Gui::RawInputEventFilter(&xcbEventFilter));\n#endif \/\/ #if QT_VERSION >= 0x050000\n }\n}\n\n#if QT_VERSION >= 0x050000\n\nbool Gui::GuiNativeEvent::xcbEventFilter(void *xcb_void, long* result)\n{\n Q_UNUSED(result);\n auto inst(dynamic_cast<Gui::GUIApplicationNativeEventAware *>(QApplication::instance()));\n if (!inst)\n return false;\n\n spnav_event navEvent;\n \n\tconst xcb_client_message_event_t* xcb_ev = static_cast<const xcb_client_message_event_t*>(xcb_void);\n \/\/ Qt4 used XEvents in native event filters, but Qt5 changed to XCB. The\n \/\/ SpaceNavigator API only works with XEvent, so we need to construct a\n \/\/ temporary XEvent with just enough information for spnav_x11_event()\n if ((xcb_ev->response_type & 0x7F) == XCB_CLIENT_MESSAGE) {\n XClientMessageEvent xev;\n\n xev.type = ClientMessage;\n xev.message_type = xcb_ev->type;\n memcpy(xev.data.b, xcb_ev->data.data8, sizeof(xev.data.b));\n xev.serial = 0; \/\/ These are just to squash warnings...\n xev.send_event = 0;\n xev.display = 0;\n xev.window = 0;\n xev.format = 0;\n\n if (!spnav_x11_event(reinterpret_cast<XEvent *>(&xev), &navEvent)) {\n return false;\n }\n } else {\n return false;\n }\n \/\/ navEvent is now initialised\n\n switch (navEvent.type) {\n case SPNAV_EVENT_MOTION:\n {\n motionDataArray[0] = -navEvent.motion.x;\n motionDataArray[1] = -navEvent.motion.z;\n motionDataArray[2] = -navEvent.motion.y;\n motionDataArray[3] = -navEvent.motion.rx;\n motionDataArray[4] = -navEvent.motion.rz;\n motionDataArray[5] = -navEvent.motion.ry;\n\n inst->postMotionEvent(motionDataArray);\n return true;\n }\n\n case SPNAV_EVENT_BUTTON:\n {\n auto buttonEvent(new Spaceball::ButtonEvent());\n buttonEvent->setButtonNumber(navEvent.button.bnum);\n if (navEvent.button.press) {\n buttonEvent->setButtonStatus(Spaceball::BUTTON_PRESSED);\n } else {\n buttonEvent->setButtonStatus(Spaceball::BUTTON_RELEASED);\n }\n inst->postButtonEvent(navEvent.button.bnum, navEvent.button.press);\n return true;\n }\n default:\n Base::Console().Log(\"Unknown spaceball event\\n\");\n return true;\n } \/\/ end switch (navEvent.type) {\n}\n\n#else \/\/ if QT_VERSION >= 0x050000\n\nbool Gui::GuiNativeEvent::x11EventFilter(XEvent *event)\n{\n \/*\n First we check if we have a motion flush event:\n - If there are unprocessed motion events we are in a flooding situation.\n In that case we wait with generating a Spaceball event.\n - A motion event counter of 0 indicates that FreeCAD is ready to process\n the event. A Spaceball event, using the saved motion data, is posted.\n *\/\n static Display* display = QX11Info::display();\n static Atom motion_flush_event = XInternAtom(display, \"FCMotionFlushEvent\", false);\n static int nMotionEvents = 0;\n\n if (event->type == ClientMessage)\n {\n Atom message_type = event->xclient.message_type;\n \n if (message_type == motion_flush_event)\n {\n nMotionEvents--;\n if (nMotionEvents == 0)\n { \n mainApp->postMotionEvent(motionDataArray);\n }\n \n return true;\n } \/\/ XEvent: motion_flush_event\n } \/\/ XEvent: ClientMessage\n\n \/*\n From here on we deal with spacenav events only:\n - motion: The event data is saved and a self addressed flush event\n is sent through the window system (XEvent). \n In the case of an event flooding, the motion data is added up.\n - button: A Spaceball event is posted (QInputEvent).\n *\/\n spnav_event navEvent;\n if (!spnav_x11_event(event, &navEvent))\n return false;\n\n if (navEvent.type == SPNAV_EVENT_MOTION)\n {\n \/*\n If the motion data of the preceding event has not been processed\n through posting an Spaceball event (flooding situation), \n the motion data provided by the incoming event is added to the saved data. \n *\/\n \tint dx, dy, dz, drx, dry, drz;\n\n if (nMotionEvents == 0)\n {\n dx = 0;\n dy = 0;\n dz = 0;\n drx = 0;\n dry = 0;\n drz = 0;\n }\n else\n {\n dx = motionDataArray[0];\n dy = motionDataArray[1];\n dz = motionDataArray[2];\n drx = motionDataArray[3];\n dry = motionDataArray[4];\n drz = motionDataArray[5];\n }\n \n motionDataArray[0] = -navEvent.motion.x;\n motionDataArray[1] = -navEvent.motion.z;\n motionDataArray[2] = -navEvent.motion.y;\n motionDataArray[3] = -navEvent.motion.rx;\n motionDataArray[4] = -navEvent.motion.rz;\n motionDataArray[5] = -navEvent.motion.ry;\n \n motionDataArray[0] += dx;\n motionDataArray[1] += dy;\n motionDataArray[2] += dz;\n motionDataArray[3] += drx;\n motionDataArray[4] += dry;\n motionDataArray[5] += drz;\n \n \/*\n Send a self addressed flush event through the window system. This will\n trigger a Spaceball event if FreeCAD is ready to do so.\n *\/\n nMotionEvents++;\n XClientMessageEvent flushEvent;\n \n flushEvent.display = display;\n flushEvent.window = event->xclient.window;\n flushEvent.type = ClientMessage;\n flushEvent.format = 8; \n flushEvent.message_type = motion_flush_event;\n \n XSendEvent (display, flushEvent.window, False, 0, (XEvent*)&flushEvent); \/\/ siehe spnavd, False, 0\n \n return true;\n }\n\n if (navEvent.type == SPNAV_EVENT_BUTTON)\n {\n mainApp->postButtonEvent(navEvent.button.bnum, navEvent.button.press);\n return true;\n }\n\n Base::Console().Log(\"Unknown spaceball event\\n\");\n return true;\n}\n#endif \/\/ if\/else QT_VERSION >= 0x050000\n\n#include \"3Dconnexion\/moc_GuiNativeEventLinuxX11.cpp\"\n<|endoftext|>"} {"text":"<commit_before>\/*!\n * This file is part of CameraPlus.\n *\n * Copyright (C) 2012-2013 Mohammed Sameer <msameer@foolab.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 \"qtcamanalysisbin.h\"\n#include <QStringList>\n#include <QDebug>\n#include <QHash>\n\n#define FACTORY_NAME(x) gst_plugin_feature_get_name(GST_PLUGIN_FEATURE(gst_element_get_factory(x)))\n\nstatic QtCamAnalysisBinPrivate *qt_cam_analysis_bin_create(const QStringList& factories,\n\t\t\t\t\t\t\t const char *name);\nstatic QtCamAnalysisBinPrivate *qt_cam_analysis_bin_create(GstElement *child,\n\t\t\t\t\t\t\t const char *name);\n\nclass QtCamAnalysisBinPrivate {\npublic:\n QtCamAnalysisBinPrivate() :\n bin(0),\n probe(0),\n queuePad(0) {\n\n }\n\n static gboolean block_buffers(GstPad *pad, GstMiniObject *o) {\n Q_UNUSED(pad);\n Q_UNUSED(o);\n\n \/\/ Drop data\n return FALSE;\n }\n\n GstElement *bin;\n gulong probe;\n GstPad *queuePad;\n QMultiHash<QString, GstElement *> elements;\n};\n\nQtCamAnalysisBin::QtCamAnalysisBin(QtCamAnalysisBinPrivate *d) :\n d_ptr(d) {\n gst_object_ref(d_ptr->bin);\n}\n\nQtCamAnalysisBin::~QtCamAnalysisBin() {\n d_ptr->elements.clear();\n\n setBlocked(false);\n gst_object_unref(GST_OBJECT(d_ptr->queuePad));\n gst_object_unref(d_ptr->bin);\n delete d_ptr; d_ptr = 0;\n}\n\nvoid QtCamAnalysisBin::setBlocked(bool blocked) {\n if (blocked == isBlocked()) {\n return;\n }\n\n if (blocked) {\n d_ptr->probe = gst_pad_add_buffer_probe(d_ptr->queuePad,\n\t\t\t\t\t G_CALLBACK(QtCamAnalysisBinPrivate::block_buffers),\n\t\t\t\t\t d_ptr);\n }\n else {\n gst_pad_remove_data_probe(d_ptr->queuePad, d_ptr->probe);\n d_ptr->probe = 0;\n }\n}\n\nbool QtCamAnalysisBin::isBlocked() const {\n return d_ptr->probe != 0;\n}\n\nGstElement *QtCamAnalysisBin::bin() {\n return d_ptr->bin;\n}\n\nQtCamAnalysisBin *QtCamAnalysisBin::create(const QStringList& factories, const char *name) {\n QList<GstElement *> elements;\n if (factories.isEmpty()) {\n return 0;\n }\n\n QtCamAnalysisBinPrivate *d = qt_cam_analysis_bin_create(factories, name);\n if (!d) {\n return 0;\n }\n\n return new QtCamAnalysisBin(d);\n}\n\nQtCamAnalysisBinPrivate *qt_cam_analysis_bin_create(const QStringList& factories,\n\t\t\t\t\t\t const char *name) {\n\n if (factories.isEmpty()) {\n return 0;\n }\n\n GstElement *bin = 0;\n QHash<QString, GstElement *> elements;\n QList<GstElement *> added;\n\n bin = gst_bin_new(\"analysis-bin-bin\");\n\n foreach (const QString& factory, factories) {\n GstElement *element = gst_element_factory_make(factory.toUtf8().constData(), NULL);\n if (!element) {\n qWarning() << \"Failed to create element\" << factory;\n continue;\n }\n\n if (!gst_bin_add(GST_BIN(bin), element)) {\n qWarning() << \"Failed to add element\" << factory << \"to bin\";\n gst_object_unref(element);\n }\n\n elements.insert(factory, element);\n added << element;\n }\n\n if (added.size() > 1) {\n for (int x = 1; x < added.count(); x++) {\n GstElement *elem = added[x];\n GstElement *prev = added[x - 1];\n\n if (!gst_element_link(prev, elem)) {\n\tqWarning() << \"Failed to link\" << FACTORY_NAME(prev) << \"and\" << FACTORY_NAME(elem);\n }\n }\n }\n\n GstPad *pad = gst_element_get_static_pad(added.first(), \"sink\");\n gst_element_add_pad(bin, gst_ghost_pad_new(\"sink\", pad));\n gst_object_unref(GST_OBJECT(pad));\n\n pad = gst_element_get_static_pad(added.last(), \"src\");\n gst_element_add_pad(bin, gst_ghost_pad_new(\"src\", pad));\n gst_object_unref(GST_OBJECT(pad));\n\n QtCamAnalysisBinPrivate *d = qt_cam_analysis_bin_create(bin, name);\n if (!d) {\n return 0;\n }\n\n d->elements = elements;\n\n return d;\n}\n\n\/*\n * -- identity -- ghost pad\n * tee -\n * -- queue -- copy -- filters -- fakesink\n *\/\nQtCamAnalysisBinPrivate *qt_cam_analysis_bin_create(GstElement *child, const char *name) {\n GstPad *pad = 0;\n GstPad *queuePad = 0;\n QtCamAnalysisBinPrivate *d = 0;\n\n GstElement *bin = gst_bin_new(name);\n\n GstElement *tee = gst_element_factory_make(\"tee\", \"analysis-bin-tee\");\n GstElement *queue = gst_element_factory_make(\"queue\", \"analysis-bin-queue\");\n GstElement *fakesink = gst_element_factory_make(\"fakesink\", \"analysis-bin-fakesink\");\n GstElement *copy = gst_element_factory_make(\"copy\", \"analysis-bin-copy\");\n GstElement *identity = gst_element_factory_make(\"identity\", \"analysis-bin-identity\");\n\n if (!bin || !tee || !queue || !fakesink || !copy || !identity) {\n qWarning() << \"Failed to create some elements\";\n goto free_and_out;\n }\n\n gst_bin_add_many(GST_BIN(bin), tee, queue, copy, fakesink, child, identity, NULL);\n\n g_object_set(tee, \"silent\", TRUE, NULL);\n g_object_set(queue, \"silent\", TRUE, \"leaky\", 2, \"max-size-buffers\", 1, NULL);\n g_object_set(fakesink, \"silent\", TRUE, \"sync\", FALSE, \"async\", FALSE, NULL);\n g_object_set(identity, \"silent\", TRUE, \"signal-handoffs\", FALSE, NULL);\n\n gst_element_link(tee, identity);\n gst_element_link(tee, queue);\n gst_element_link(queue, copy);\n gst_element_link(copy, child);\n gst_element_link(child, fakesink);\n\n pad = gst_element_get_static_pad(tee, \"sink\");\n gst_element_add_pad(bin, gst_ghost_pad_new(\"sink\", pad));\n gst_object_unref(GST_OBJECT(pad));\n\n pad = gst_element_get_static_pad(identity, \"src\");\n gst_element_add_pad(bin, gst_ghost_pad_new(\"src\", pad));\n gst_object_unref(GST_OBJECT(pad));\n\n pad = gst_element_get_static_pad(tee, \"src0\");\n g_object_set(tee, \"alloc-pad\", pad, NULL);\n gst_object_unref(GST_OBJECT(pad));\n\n queuePad = gst_element_get_static_pad(queue, \"src\");\n\n d = new QtCamAnalysisBinPrivate;\n d->queuePad = queuePad;\n d->bin = bin;\n return d;\n\n free_and_out:\n if (bin) {\n gst_object_unref(bin);\n }\n else {\n gst_object_unref(child);\n }\n\n if (tee) {\n gst_object_unref(tee);\n }\n\n if (queue) {\n gst_object_unref(queue);\n }\n\n if (copy) {\n gst_object_unref(copy);\n }\n\n if (identity) {\n gst_object_unref(identity);\n }\n\n if (fakesink) {\n gst_object_unref(fakesink);\n }\n\n return 0;\n}\n\nQList<GstElement *> QtCamAnalysisBin::lookup(const QString& factory) {\n if (d_ptr->elements.contains(factory)) {\n return d_ptr->elements.values(factory);\n }\n\n return QList<GstElement *>();\n}\n<commit_msg>Return NULL if we cannot create any elements<commit_after>\/*!\n * This file is part of CameraPlus.\n *\n * Copyright (C) 2012-2013 Mohammed Sameer <msameer@foolab.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 \"qtcamanalysisbin.h\"\n#include <QStringList>\n#include <QDebug>\n#include <QHash>\n\n#define FACTORY_NAME(x) gst_plugin_feature_get_name(GST_PLUGIN_FEATURE(gst_element_get_factory(x)))\n\nstatic QtCamAnalysisBinPrivate *qt_cam_analysis_bin_create(const QStringList& factories,\n\t\t\t\t\t\t\t const char *name);\nstatic QtCamAnalysisBinPrivate *qt_cam_analysis_bin_create(GstElement *child,\n\t\t\t\t\t\t\t const char *name);\n\nclass QtCamAnalysisBinPrivate {\npublic:\n QtCamAnalysisBinPrivate() :\n bin(0),\n probe(0),\n queuePad(0) {\n\n }\n\n static gboolean block_buffers(GstPad *pad, GstMiniObject *o) {\n Q_UNUSED(pad);\n Q_UNUSED(o);\n\n \/\/ Drop data\n return FALSE;\n }\n\n GstElement *bin;\n gulong probe;\n GstPad *queuePad;\n QMultiHash<QString, GstElement *> elements;\n};\n\nQtCamAnalysisBin::QtCamAnalysisBin(QtCamAnalysisBinPrivate *d) :\n d_ptr(d) {\n gst_object_ref(d_ptr->bin);\n}\n\nQtCamAnalysisBin::~QtCamAnalysisBin() {\n d_ptr->elements.clear();\n\n setBlocked(false);\n gst_object_unref(GST_OBJECT(d_ptr->queuePad));\n gst_object_unref(d_ptr->bin);\n delete d_ptr; d_ptr = 0;\n}\n\nvoid QtCamAnalysisBin::setBlocked(bool blocked) {\n if (blocked == isBlocked()) {\n return;\n }\n\n if (blocked) {\n d_ptr->probe = gst_pad_add_buffer_probe(d_ptr->queuePad,\n\t\t\t\t\t G_CALLBACK(QtCamAnalysisBinPrivate::block_buffers),\n\t\t\t\t\t d_ptr);\n }\n else {\n gst_pad_remove_data_probe(d_ptr->queuePad, d_ptr->probe);\n d_ptr->probe = 0;\n }\n}\n\nbool QtCamAnalysisBin::isBlocked() const {\n return d_ptr->probe != 0;\n}\n\nGstElement *QtCamAnalysisBin::bin() {\n return d_ptr->bin;\n}\n\nQtCamAnalysisBin *QtCamAnalysisBin::create(const QStringList& factories, const char *name) {\n QList<GstElement *> elements;\n if (factories.isEmpty()) {\n return 0;\n }\n\n QtCamAnalysisBinPrivate *d = qt_cam_analysis_bin_create(factories, name);\n if (!d) {\n return 0;\n }\n\n return new QtCamAnalysisBin(d);\n}\n\nQtCamAnalysisBinPrivate *qt_cam_analysis_bin_create(const QStringList& factories,\n\t\t\t\t\t\t const char *name) {\n\n if (factories.isEmpty()) {\n return 0;\n }\n\n GstElement *bin = 0;\n QHash<QString, GstElement *> elements;\n QList<GstElement *> added;\n\n bin = gst_bin_new(\"analysis-bin-bin\");\n\n foreach (const QString& factory, factories) {\n GstElement *element = gst_element_factory_make(factory.toUtf8().constData(), NULL);\n if (!element) {\n qWarning() << \"Failed to create element\" << factory;\n continue;\n }\n\n if (!gst_bin_add(GST_BIN(bin), element)) {\n qWarning() << \"Failed to add element\" << factory << \"to bin\";\n gst_object_unref(element);\n }\n\n elements.insert(factory, element);\n added << element;\n }\n\n if (added.isEmpty()) {\n gst_object_unref (bin);\n\n return 0;\n }\n\n if (added.size() > 1) {\n for (int x = 1; x < added.count(); x++) {\n GstElement *elem = added[x];\n GstElement *prev = added[x - 1];\n\n if (!gst_element_link(prev, elem)) {\n\tqWarning() << \"Failed to link\" << FACTORY_NAME(prev) << \"and\" << FACTORY_NAME(elem);\n }\n }\n }\n\n GstPad *pad = gst_element_get_static_pad(added.first(), \"sink\");\n gst_element_add_pad(bin, gst_ghost_pad_new(\"sink\", pad));\n gst_object_unref(GST_OBJECT(pad));\n\n pad = gst_element_get_static_pad(added.last(), \"src\");\n gst_element_add_pad(bin, gst_ghost_pad_new(\"src\", pad));\n gst_object_unref(GST_OBJECT(pad));\n\n QtCamAnalysisBinPrivate *d = qt_cam_analysis_bin_create(bin, name);\n if (!d) {\n return 0;\n }\n\n d->elements = elements;\n\n return d;\n}\n\n\/*\n * -- identity -- ghost pad\n * tee -\n * -- queue -- copy -- filters -- fakesink\n *\/\nQtCamAnalysisBinPrivate *qt_cam_analysis_bin_create(GstElement *child, const char *name) {\n GstPad *pad = 0;\n GstPad *queuePad = 0;\n QtCamAnalysisBinPrivate *d = 0;\n\n GstElement *bin = gst_bin_new(name);\n\n GstElement *tee = gst_element_factory_make(\"tee\", \"analysis-bin-tee\");\n GstElement *queue = gst_element_factory_make(\"queue\", \"analysis-bin-queue\");\n GstElement *fakesink = gst_element_factory_make(\"fakesink\", \"analysis-bin-fakesink\");\n GstElement *copy = gst_element_factory_make(\"copy\", \"analysis-bin-copy\");\n GstElement *identity = gst_element_factory_make(\"identity\", \"analysis-bin-identity\");\n\n if (!bin || !tee || !queue || !fakesink || !copy || !identity) {\n qWarning() << \"Failed to create some elements\";\n goto free_and_out;\n }\n\n gst_bin_add_many(GST_BIN(bin), tee, queue, copy, fakesink, child, identity, NULL);\n\n g_object_set(tee, \"silent\", TRUE, NULL);\n g_object_set(queue, \"silent\", TRUE, \"leaky\", 2, \"max-size-buffers\", 1, NULL);\n g_object_set(fakesink, \"silent\", TRUE, \"sync\", FALSE, \"async\", FALSE, NULL);\n g_object_set(identity, \"silent\", TRUE, \"signal-handoffs\", FALSE, NULL);\n\n gst_element_link(tee, identity);\n gst_element_link(tee, queue);\n gst_element_link(queue, copy);\n gst_element_link(copy, child);\n gst_element_link(child, fakesink);\n\n pad = gst_element_get_static_pad(tee, \"sink\");\n gst_element_add_pad(bin, gst_ghost_pad_new(\"sink\", pad));\n gst_object_unref(GST_OBJECT(pad));\n\n pad = gst_element_get_static_pad(identity, \"src\");\n gst_element_add_pad(bin, gst_ghost_pad_new(\"src\", pad));\n gst_object_unref(GST_OBJECT(pad));\n\n pad = gst_element_get_static_pad(tee, \"src0\");\n g_object_set(tee, \"alloc-pad\", pad, NULL);\n gst_object_unref(GST_OBJECT(pad));\n\n queuePad = gst_element_get_static_pad(queue, \"src\");\n\n d = new QtCamAnalysisBinPrivate;\n d->queuePad = queuePad;\n d->bin = bin;\n return d;\n\n free_and_out:\n if (bin) {\n gst_object_unref(bin);\n }\n else {\n gst_object_unref(child);\n }\n\n if (tee) {\n gst_object_unref(tee);\n }\n\n if (queue) {\n gst_object_unref(queue);\n }\n\n if (copy) {\n gst_object_unref(copy);\n }\n\n if (identity) {\n gst_object_unref(identity);\n }\n\n if (fakesink) {\n gst_object_unref(fakesink);\n }\n\n return 0;\n}\n\nQList<GstElement *> QtCamAnalysisBin::lookup(const QString& factory) {\n if (d_ptr->elements.contains(factory)) {\n return d_ptr->elements.values(factory);\n }\n\n return QList<GstElement *>();\n}\n<|endoftext|>"} {"text":"<commit_before>#include \"graphics.h\"\n#include \"compiler.h\"\n#include \"memory.h\"\n#include \"resources.h\"\n#include \"glinit.h\"\n#include \"vector.h\"\n#include \"print.h\"\n\n#include <cstddef>\n#include <cstdint>\n\n#define OBJECT_UNIFORM_BINDING_INDEX 0\n\nnamespace\n{\n#if PRINT_ENABLED\n#define PRINT_INFO_LOG(a, b, c) print_info_log (a, b, c)\n inline void print_info_log (GLuint object,\n PFNGLGETSHADERIVPROC glGet__iv,\n PFNGLGETSHADERINFOLOGPROC glGet__InfoLog)\n {\n if (PRINT_ENABLED) {\n GLint log_length;\n glGet__iv (object, GL_INFO_LOG_LENGTH, & log_length);\n char * log = (char *) allocate_internal (log_length + 1);\n if (log) {\n glGet__InfoLog (object, log_length, NULL, log);\n log [log_length] = '\\0';\n if (log [0]) print (log);\n deallocate (log);\n }\n }\n }\n#else\n#define PRINT_INFO_LOG(a, b, c)\n#endif\n\n GLuint make_shader (GLenum type, int resource_id)\n {\n const char * text;\n GLint size;\n get_resource_data (resource_id, text, size);\n\n GLint id = glCreateShader (type);\n glShaderSource (id, 1, & text, & size);\n glCompileShader (id);\n GLint status = 0;\n glGetShaderiv (id, GL_COMPILE_STATUS, & status);\n#if PRINT_ENABLED\n switch (resource_id) {\n case IDR_VERTEX_SHADER: std::cout << \"Vertex \"; break;\n case IDR_FRAGMENT_SHADER: std::cout << \"Fragment \"; break;\n case IDR_GEOMETRY_SHADER: std::cout << \"Geometry \"; break;\n default: ;\n }\n std::cout << \"Shader compilation \" << (status ? \"succeeded.\" : \"failed.\") << std::endl;\n PRINT_INFO_LOG (id, glGetShaderiv, glGetShaderInfoLog);\n#endif\n return status ? id : 0;\n }\n}\n\nstatic const int attribute_id_x = 0;\n\nunsigned make_vao (unsigned N, const float (* vertices) [4], const unsigned (* indices) [6])\n{\n unsigned vao_id;\n glGenVertexArrays (1, & vao_id);\n glBindVertexArray (vao_id);\n GLuint buffer_ids [2];\n glGenBuffers (2, buffer_ids);\n glBindBuffer (GL_ARRAY_BUFFER, buffer_ids [0]);\n glBindBuffer (GL_ELEMENT_ARRAY_BUFFER, buffer_ids [1]);\n glBufferData (GL_ARRAY_BUFFER, (N + 2) * 4 * sizeof (float), vertices, GL_STATIC_DRAW);\n glBufferData (GL_ELEMENT_ARRAY_BUFFER, 6 * N * sizeof (unsigned), indices, GL_STATIC_DRAW);\n glVertexAttribPointer (attribute_id_x, 4, GL_FLOAT, GL_FALSE, 0, 0);\n glEnableVertexAttribArray (attribute_id_x);\n return vao_id;\n}\n\nnamespace\n{\n \/\/ Align x upwards to given alignment (which must be a power of 2). Store the result in y.\n template <typename Dest, typename Source>\n inline void align_up (Dest & y, Source x, std::intptr_t alignment)\n {\n y = (Dest) ((((std::intptr_t) (x)) + (alignment - 1)) & - alignment);\n }\n}\n\nuniform_buffer_t::~uniform_buffer_t ()\n{\n \/\/glDeleteBuffers (1, & m_id);\n deallocate (m_memory);\n}\n\nbool uniform_buffer_t::initialize ()\n{\n GLint max_size, align;\n glGetIntegerv (GL_MAX_UNIFORM_BLOCK_SIZE, & max_size);\n glGetIntegerv (GL_UNIFORM_BUFFER_OFFSET_ALIGNMENT, & align);\n \/\/ Align client-side buffer to at least 64 bytes, to avoid straddling cache lines.\n align = align > 64 ? align : 64;\n m_size = max_size;\n m_memory = allocate_internal (m_size + align);\n if (! m_memory) return false;\n align_up (m_begin, m_memory, align);\n align_up (m_stride, sizeof (object_data_t), align);\n glGenBuffers (1, & m_id);\n return true;\n}\n\nvoid uniform_buffer_t::bind ()\n{\n glBindBuffer (GL_UNIFORM_BUFFER, m_id);\n}\n\nvoid uniform_buffer_t::update ()\n{\n \/\/ Create a buffer, orphaning any previous buffer.\n glBufferData (GL_UNIFORM_BUFFER, m_size, nullptr, GL_DYNAMIC_DRAW);\n \/\/ Upload the buffer data.\n glBufferSubData (GL_UNIFORM_BUFFER, 0, m_size, m_begin);\n}\n\nbool initialize_graphics (program_t & program)\n{\n glEnable (GL_DEPTH_CLAMP);\n glEnable (GL_CULL_FACE);\n glEnable (GL_BLEND);\n glBlendFunc (GL_SRC_ALPHA, GL_ONE_MINUS_SRC_ALPHA);\n return program.initialize ();\n}\n\nvoid program_t::set_view (const float (& view) [4],\n float width, float height,\n const float (& colours) [4] [4],\n float fog_near, float fog_far,\n float line_width_extra, float line_sharpness)\n{\n glViewport (0, 0, width, height);\n\n const float (& ambient) [4] = colours [0];\n const float (& background) [4] = colours [1];\n const float (& line_colour) [4] = colours [2];\n const float (& specular) [4] = colours [3];\n\n glClearColor (background [0], background [1], background [2], 0.0f);\n\n float z1 = view [0]; \/\/ z coord of screen (front of tank) (a negative number)\n float z2 = view [1]; \/\/ z coord of back of tank (a negative number) (|z2| > |z1|)\n float x1 = view [2]; \/\/ x coord of right edge of screen (and of front-right edge of tank)\n float y1 = view [3]; \/\/ y coord of top edge of screen (and of front-top edge of tank)\n float zd = z1 - z2; \/\/ tank depth\n\n \/\/ Fog is linear in z-distance.\n float fogn = 1.0f - fog_near;\n float fogf = 1.0f - fog_far;\n float fogd = fogn - fogf;\n float fog1 = fogd \/ zd;\n float fog0 = fogf - fog1 * z2;\n\n float line0 = -0.5f * line_width_extra * line_sharpness;\n float line1 = line_sharpness;\n\n \/\/ Data blocks in layout std140.\n\n struct fragment_data_t\n {\n GLfloat l [4] [4]; \/\/ vec3 [4], light positions\n GLfloat a [4]; \/\/ vec3, ambient reflection (rgb)\n GLfloat b [4]; \/\/ vec3, background (rgb)\n GLfloat c [4]; \/\/ vec4, line colour (rgba)\n GLfloat r [4]; \/\/ vec4, xyz: specular reflection (rgb); w: exponent\n GLfloat f [4]; \/\/ vec4, coefficients for line width and fog\n };\n\n struct geometry_data_t\n {\n GLfloat p [4] [4]; \/\/ mat4, projection matrix\n GLfloat q [4]; \/\/ vec3, pixel scale of normalized device coordinates\n };\n\n ALIGNED16 fragment_data_t fragment_data = {\n {\n { -0.6f * x1, -0.2f * y1, z1 + y1, 0.0f, },\n { -0.2f * x1, +0.6f * y1, z1 + x1, 0.0f, },\n { +0.2f * x1, -0.6f * y1, z1 + y1, 0.0f, },\n { +0.6f * x1, +0.2f * y1, z1 + x1, 0.0f, },\n },\n { 0, 0, 0, 0, },\n { 0, 0, 0, 0, },\n { 0, 0, 0, 0, },\n { 0, 0, 0, 0, },\n { line0, line1, fog0, fog1, }\n };\n\n store4f (fragment_data.a, load4f (ambient));\n store4f (fragment_data.b, load4f (background));\n store4f (fragment_data.c, load4f (line_colour));\n store4f (fragment_data.r, load4f (specular));\n\n ALIGNED16 geometry_data_t geometry_data = {\n {\n { -z1\/x1, 0, 0, 0, },\n { 0, -z1\/y1, 0, 0, },\n { 0, 0, -(z1+z2)\/zd, -1, },\n { 0, 0, 2*z1*z2\/zd, 0, },\n },\n { width \/ 2.0f, height \/ 2.0f, 0, 0, },\n };\n\n \/\/ Descriptions of the data blocks.\n\n struct block_descriptor_t\n {\n const char * name;\n GLvoid * data;\n GLsizeiptr size;\n };\n\n block_descriptor_t blocks [] = {\n { \"F\", & fragment_data, sizeof fragment_data, },\n { \"G\", & geometry_data, sizeof geometry_data, },\n };\n GLuint block_count = sizeof blocks \/ sizeof blocks [0];\n\n \/\/ Create a uniform buffer big enough for all the data blocks.\n\n GLuint max_block_size = 0;\n for (std::size_t n = 0; n != block_count; ++ n)\n if (max_block_size < blocks [n].size)\n max_block_size = blocks [n].size;\n\n GLint align;\n glGetIntegerv (GL_UNIFORM_BUFFER_OFFSET_ALIGNMENT, & align);\n\n GLuint buffer_size, buffer_stride;\n align_up (buffer_stride, max_block_size, align);\n buffer_size = block_count * buffer_stride;\n\n GLuint buf_id;\n glGenBuffers (1, & buf_id);\n glBindBuffer (GL_UNIFORM_BUFFER, buf_id);\n glBufferData (GL_UNIFORM_BUFFER, buffer_size, nullptr, GL_STATIC_DRAW);\n\n \/\/ Copy each data block to a buffer range and bind the range to the named shader uniform block.\n\n for (std::size_t n = 0; n != block_count; ++ n) {\n glBufferSubData (GL_UNIFORM_BUFFER, n * buffer_stride, blocks [n].size, blocks [n].data);\n GLuint block_index = glGetUniformBlockIndex (id, blocks [n].name);\n GLuint binding_index = n + 1;\n glUniformBlockBinding (id, block_index, binding_index);\n glBindBufferRange (GL_UNIFORM_BUFFER, binding_index, buf_id, n * buffer_stride, blocks [n].size);\n }\n\n uniform_buffer.bind ();\n}\n\nbool program_t::initialize ()\n{\n if (! uniform_buffer.initialize ()) return false;\n\n GLint status = 0;\n GLuint vshader_id = make_shader (GL_VERTEX_SHADER, IDR_VERTEX_SHADER);\n GLuint gshader_id = make_shader (GL_GEOMETRY_SHADER, IDR_GEOMETRY_SHADER);\n GLuint fshader_id = make_shader (GL_FRAGMENT_SHADER, IDR_FRAGMENT_SHADER);\n if (vshader_id && gshader_id && fshader_id) {\n id = glCreateProgram ();\n if (id) {\n glAttachShader (id, vshader_id);\n glAttachShader (id, gshader_id);\n glAttachShader (id, fshader_id);\n glBindAttribLocation (id, attribute_id_x, \"x\");\n glLinkProgram (id);\n glGetProgramiv (id, GL_LINK_STATUS, & status);\n#if PRINT_ENABLED\n std::cout << \"Shader program linking \" << (status ? \"succeeded.\" : \"failed.\") << std::endl;\n PRINT_INFO_LOG (id, glGetProgramiv, glGetProgramInfoLog);\n#endif\n glDetachShader (id, fshader_id);\n glDetachShader (id, gshader_id);\n glDetachShader (id, vshader_id);\n }\n }\n if (fshader_id) glDeleteShader (fshader_id);\n if (gshader_id) glDeleteShader (gshader_id);\n if (vshader_id) glDeleteShader (vshader_id);\n\n if (! status) {\n \/\/if (id) glDeleteProgram (id);\n return false;\n }\n\n \/\/ Binding for Uniform block \"H\".\n GLuint object_uniform_block_index = glGetUniformBlockIndex (id, \"H\");\n glUniformBlockBinding (id, object_uniform_block_index, OBJECT_UNIFORM_BINDING_INDEX);\n glUseProgram (id);\n\n return true;\n}\n\nvoid clear ()\n{\n glClear (GL_COLOR_BUFFER_BIT);\n}\n\nvoid paint (unsigned N,\n unsigned vao_id,\n GLuint uniform_buffer_id,\n std::ptrdiff_t uniform_buffer_offset)\n{\n const unsigned block_size = sizeof (object_data_t);\n glBindVertexArray (vao_id);\n glBindBufferRange (GL_UNIFORM_BUFFER, OBJECT_UNIFORM_BINDING_INDEX, uniform_buffer_id, uniform_buffer_offset, block_size);\n glCullFace (GL_FRONT);\n glDrawElements (GL_TRIANGLES_ADJACENCY, N * 6, GL_UNSIGNED_INT, nullptr);\n glCullFace (GL_BACK);\n glDrawElements (GL_TRIANGLES_ADJACENCY, N * 6, GL_UNSIGNED_INT, nullptr);\n}\n<commit_msg>graphics.cpp: use signed intger type to avoid a \"comparing signed and unsigned\" warning.<commit_after>#include \"graphics.h\"\n#include \"compiler.h\"\n#include \"memory.h\"\n#include \"resources.h\"\n#include \"glinit.h\"\n#include \"vector.h\"\n#include \"print.h\"\n\n#include <cstddef>\n#include <cstdint>\n\n#define OBJECT_UNIFORM_BINDING_INDEX 0\n\nnamespace\n{\n#if PRINT_ENABLED\n#define PRINT_INFO_LOG(a, b, c) print_info_log (a, b, c)\n inline void print_info_log (GLuint object,\n PFNGLGETSHADERIVPROC glGet__iv,\n PFNGLGETSHADERINFOLOGPROC glGet__InfoLog)\n {\n if (PRINT_ENABLED) {\n GLint log_length;\n glGet__iv (object, GL_INFO_LOG_LENGTH, & log_length);\n char * log = (char *) allocate_internal (log_length + 1);\n if (log) {\n glGet__InfoLog (object, log_length, NULL, log);\n log [log_length] = '\\0';\n if (log [0]) print (log);\n deallocate (log);\n }\n }\n }\n#else\n#define PRINT_INFO_LOG(a, b, c)\n#endif\n\n GLuint make_shader (GLenum type, int resource_id)\n {\n const char * text;\n GLint size;\n get_resource_data (resource_id, text, size);\n\n GLint id = glCreateShader (type);\n glShaderSource (id, 1, & text, & size);\n glCompileShader (id);\n GLint status = 0;\n glGetShaderiv (id, GL_COMPILE_STATUS, & status);\n#if PRINT_ENABLED\n switch (resource_id) {\n case IDR_VERTEX_SHADER: std::cout << \"Vertex \"; break;\n case IDR_FRAGMENT_SHADER: std::cout << \"Fragment \"; break;\n case IDR_GEOMETRY_SHADER: std::cout << \"Geometry \"; break;\n default: ;\n }\n std::cout << \"Shader compilation \" << (status ? \"succeeded.\" : \"failed.\") << std::endl;\n PRINT_INFO_LOG (id, glGetShaderiv, glGetShaderInfoLog);\n#endif\n return status ? id : 0;\n }\n}\n\nstatic const int attribute_id_x = 0;\n\nunsigned make_vao (unsigned N, const float (* vertices) [4], const unsigned (* indices) [6])\n{\n unsigned vao_id;\n glGenVertexArrays (1, & vao_id);\n glBindVertexArray (vao_id);\n GLuint buffer_ids [2];\n glGenBuffers (2, buffer_ids);\n glBindBuffer (GL_ARRAY_BUFFER, buffer_ids [0]);\n glBindBuffer (GL_ELEMENT_ARRAY_BUFFER, buffer_ids [1]);\n glBufferData (GL_ARRAY_BUFFER, (N + 2) * 4 * sizeof (float), vertices, GL_STATIC_DRAW);\n glBufferData (GL_ELEMENT_ARRAY_BUFFER, 6 * N * sizeof (unsigned), indices, GL_STATIC_DRAW);\n glVertexAttribPointer (attribute_id_x, 4, GL_FLOAT, GL_FALSE, 0, 0);\n glEnableVertexAttribArray (attribute_id_x);\n return vao_id;\n}\n\nnamespace\n{\n \/\/ Align x upwards to given alignment (which must be a power of 2). Store the result in y.\n template <typename Dest, typename Source>\n inline void align_up (Dest & y, Source x, std::intptr_t alignment)\n {\n y = (Dest) ((((std::intptr_t) (x)) + (alignment - 1)) & - alignment);\n }\n}\n\nuniform_buffer_t::~uniform_buffer_t ()\n{\n \/\/glDeleteBuffers (1, & m_id);\n deallocate (m_memory);\n}\n\nbool uniform_buffer_t::initialize ()\n{\n GLint max_size, align;\n glGetIntegerv (GL_MAX_UNIFORM_BLOCK_SIZE, & max_size);\n glGetIntegerv (GL_UNIFORM_BUFFER_OFFSET_ALIGNMENT, & align);\n \/\/ Align client-side buffer to at least 64 bytes, to avoid straddling cache lines.\n align = align > 64 ? align : 64;\n m_size = max_size;\n m_memory = allocate_internal (m_size + align);\n if (! m_memory) return false;\n align_up (m_begin, m_memory, align);\n align_up (m_stride, sizeof (object_data_t), align);\n glGenBuffers (1, & m_id);\n return true;\n}\n\nvoid uniform_buffer_t::bind ()\n{\n glBindBuffer (GL_UNIFORM_BUFFER, m_id);\n}\n\nvoid uniform_buffer_t::update ()\n{\n \/\/ Create a buffer, orphaning any previous buffer.\n glBufferData (GL_UNIFORM_BUFFER, m_size, nullptr, GL_DYNAMIC_DRAW);\n \/\/ Upload the buffer data.\n glBufferSubData (GL_UNIFORM_BUFFER, 0, m_size, m_begin);\n}\n\nbool initialize_graphics (program_t & program)\n{\n glEnable (GL_DEPTH_CLAMP);\n glEnable (GL_CULL_FACE);\n glEnable (GL_BLEND);\n glBlendFunc (GL_SRC_ALPHA, GL_ONE_MINUS_SRC_ALPHA);\n return program.initialize ();\n}\n\nvoid program_t::set_view (const float (& view) [4],\n float width, float height,\n const float (& colours) [4] [4],\n float fog_near, float fog_far,\n float line_width_extra, float line_sharpness)\n{\n glViewport (0, 0, width, height);\n\n const float (& ambient) [4] = colours [0];\n const float (& background) [4] = colours [1];\n const float (& line_colour) [4] = colours [2];\n const float (& specular) [4] = colours [3];\n\n glClearColor (background [0], background [1], background [2], 0.0f);\n\n float z1 = view [0]; \/\/ z coord of screen (front of tank) (a negative number)\n float z2 = view [1]; \/\/ z coord of back of tank (a negative number) (|z2| > |z1|)\n float x1 = view [2]; \/\/ x coord of right edge of screen (and of front-right edge of tank)\n float y1 = view [3]; \/\/ y coord of top edge of screen (and of front-top edge of tank)\n float zd = z1 - z2; \/\/ tank depth\n\n \/\/ Fog is linear in z-distance.\n float fogn = 1.0f - fog_near;\n float fogf = 1.0f - fog_far;\n float fogd = fogn - fogf;\n float fog1 = fogd \/ zd;\n float fog0 = fogf - fog1 * z2;\n\n float line0 = -0.5f * line_width_extra * line_sharpness;\n float line1 = line_sharpness;\n\n \/\/ Data blocks in layout std140.\n\n struct fragment_data_t\n {\n GLfloat l [4] [4]; \/\/ vec3 [4], light positions\n GLfloat a [4]; \/\/ vec3, ambient reflection (rgb)\n GLfloat b [4]; \/\/ vec3, background (rgb)\n GLfloat c [4]; \/\/ vec4, line colour (rgba)\n GLfloat r [4]; \/\/ vec4, xyz: specular reflection (rgb); w: exponent\n GLfloat f [4]; \/\/ vec4, coefficients for line width and fog\n };\n\n struct geometry_data_t\n {\n GLfloat p [4] [4]; \/\/ mat4, projection matrix\n GLfloat q [4]; \/\/ vec3, pixel scale of normalized device coordinates\n };\n\n ALIGNED16 fragment_data_t fragment_data = {\n {\n { -0.6f * x1, -0.2f * y1, z1 + y1, 0.0f, },\n { -0.2f * x1, +0.6f * y1, z1 + x1, 0.0f, },\n { +0.2f * x1, -0.6f * y1, z1 + y1, 0.0f, },\n { +0.6f * x1, +0.2f * y1, z1 + x1, 0.0f, },\n },\n { 0, 0, 0, 0, },\n { 0, 0, 0, 0, },\n { 0, 0, 0, 0, },\n { 0, 0, 0, 0, },\n { line0, line1, fog0, fog1, }\n };\n\n store4f (fragment_data.a, load4f (ambient));\n store4f (fragment_data.b, load4f (background));\n store4f (fragment_data.c, load4f (line_colour));\n store4f (fragment_data.r, load4f (specular));\n\n ALIGNED16 geometry_data_t geometry_data = {\n {\n { -z1\/x1, 0, 0, 0, },\n { 0, -z1\/y1, 0, 0, },\n { 0, 0, -(z1+z2)\/zd, -1, },\n { 0, 0, 2*z1*z2\/zd, 0, },\n },\n { width \/ 2.0f, height \/ 2.0f, 0, 0, },\n };\n\n \/\/ Descriptions of the data blocks.\n\n struct block_descriptor_t\n {\n const char * name;\n GLvoid * data;\n GLsizeiptr size;\n };\n\n block_descriptor_t blocks [] = {\n { \"F\", & fragment_data, sizeof fragment_data, },\n { \"G\", & geometry_data, sizeof geometry_data, },\n };\n GLuint block_count = sizeof blocks \/ sizeof blocks [0];\n\n \/\/ Create a uniform buffer big enough for all the data blocks.\n\n GLsizeiptr max_block_size = 0;\n for (std::size_t n = 0; n != block_count; ++ n)\n if (max_block_size < blocks [n].size)\n max_block_size = blocks [n].size;\n\n GLint align;\n glGetIntegerv (GL_UNIFORM_BUFFER_OFFSET_ALIGNMENT, & align);\n\n GLuint buffer_size, buffer_stride;\n align_up (buffer_stride, max_block_size, align);\n buffer_size = block_count * buffer_stride;\n\n GLuint buf_id;\n glGenBuffers (1, & buf_id);\n glBindBuffer (GL_UNIFORM_BUFFER, buf_id);\n glBufferData (GL_UNIFORM_BUFFER, buffer_size, nullptr, GL_STATIC_DRAW);\n\n \/\/ Copy each data block to a buffer range and bind the range to the named shader uniform block.\n\n for (std::size_t n = 0; n != block_count; ++ n) {\n glBufferSubData (GL_UNIFORM_BUFFER, n * buffer_stride, blocks [n].size, blocks [n].data);\n GLuint block_index = glGetUniformBlockIndex (id, blocks [n].name);\n GLuint binding_index = n + 1;\n glUniformBlockBinding (id, block_index, binding_index);\n glBindBufferRange (GL_UNIFORM_BUFFER, binding_index, buf_id, n * buffer_stride, blocks [n].size);\n }\n\n uniform_buffer.bind ();\n}\n\nbool program_t::initialize ()\n{\n if (! uniform_buffer.initialize ()) return false;\n\n GLint status = 0;\n GLuint vshader_id = make_shader (GL_VERTEX_SHADER, IDR_VERTEX_SHADER);\n GLuint gshader_id = make_shader (GL_GEOMETRY_SHADER, IDR_GEOMETRY_SHADER);\n GLuint fshader_id = make_shader (GL_FRAGMENT_SHADER, IDR_FRAGMENT_SHADER);\n if (vshader_id && gshader_id && fshader_id) {\n id = glCreateProgram ();\n if (id) {\n glAttachShader (id, vshader_id);\n glAttachShader (id, gshader_id);\n glAttachShader (id, fshader_id);\n glBindAttribLocation (id, attribute_id_x, \"x\");\n glLinkProgram (id);\n glGetProgramiv (id, GL_LINK_STATUS, & status);\n#if PRINT_ENABLED\n std::cout << \"Shader program linking \" << (status ? \"succeeded.\" : \"failed.\") << std::endl;\n PRINT_INFO_LOG (id, glGetProgramiv, glGetProgramInfoLog);\n#endif\n glDetachShader (id, fshader_id);\n glDetachShader (id, gshader_id);\n glDetachShader (id, vshader_id);\n }\n }\n if (fshader_id) glDeleteShader (fshader_id);\n if (gshader_id) glDeleteShader (gshader_id);\n if (vshader_id) glDeleteShader (vshader_id);\n\n if (! status) {\n \/\/if (id) glDeleteProgram (id);\n return false;\n }\n\n \/\/ Binding for Uniform block \"H\".\n GLuint object_uniform_block_index = glGetUniformBlockIndex (id, \"H\");\n glUniformBlockBinding (id, object_uniform_block_index, OBJECT_UNIFORM_BINDING_INDEX);\n glUseProgram (id);\n\n return true;\n}\n\nvoid clear ()\n{\n glClear (GL_COLOR_BUFFER_BIT);\n}\n\nvoid paint (unsigned N,\n unsigned vao_id,\n GLuint uniform_buffer_id,\n std::ptrdiff_t uniform_buffer_offset)\n{\n const unsigned block_size = sizeof (object_data_t);\n glBindVertexArray (vao_id);\n glBindBufferRange (GL_UNIFORM_BUFFER, OBJECT_UNIFORM_BINDING_INDEX, uniform_buffer_id, uniform_buffer_offset, block_size);\n glCullFace (GL_FRONT);\n glDrawElements (GL_TRIANGLES_ADJACENCY, N * 6, GL_UNSIGNED_INT, nullptr);\n glCullFace (GL_BACK);\n glDrawElements (GL_TRIANGLES_ADJACENCY, N * 6, GL_UNSIGNED_INT, nullptr);\n}\n<|endoftext|>"} {"text":"<commit_before>\/\/ Copyright (c) 2014 Joseph D Poirier\n\/\/ Distributable under the terms of The New BSD License\n\/\/ that can be found in the LICENSE file.\n\n#ifdef _WIN32 \/* this is set for 64 bit as well *\/\n# define WIN32_LEAN_AND_MEAN\n# include <windows.h>\n#endif\n\n#ifdef _APPLE_\n#include <OpenGl\/gl.h>\n#else\n#include <GL\/gl.h>\n#endif\n\n#include <math.h>\n#include <stdio.h>\n#include <stdint.h>\n#include <stdlib.h>\n#include <string.h>\n\n#include \"XPLMDefs.h\"\n#include \"XPLMPlugin.h\"\n#include \"XPLMProcessing.h\"\n#include \"XPLMDataAccess.h\"\n#include \"XPLMUtilities.h\"\n#include \"XPLMDisplay.h\"\n#include \"XPLMGraphics.h\"\n\n#include \"defs.h\"\n#include \"commviewer.h\"\n\nstatic int CommandHandler(XPLMCommandRef inCommand,\n XPLMCommandPhase inPhase,\n void* inRefcon);\n\nstatic void DrawWindowCallback(XPLMWindowID inWindowID,\n void* inRefcon);\n\nstatic void HandleKeyCallback(XPLMWindowID inWindowID,\n char inKey,\n XPLMKeyFlags inFlags,\n char inVirtualKey,\n void* inRefcon,\n int losingFocus);\n\nstatic int HandleMouseCallback(XPLMWindowID inWindowID,\n int x,\n int y,\n XPLMMouseStatus inMouse,\n void* inRefcon);\n\nstatic void HotKeyCallback(void* inRefcon);\n\nstatic XPLMWindowID gWindow = NULL;\nstatic bool gPluginEnabled = false;\nstatic int gPlaneLoaded = 0;\nstatic const float FL_CB_INTERVAL = -1.0;\nstatic bool gPTT_On = false;\nstatic XPLMHotKeyID gHotKey = NULL;\n\n#define WINDOW_WIDTH (200)\n#define WINDOW_HEIGHT (40)\nstatic int gWinPosX;\nstatic int gWinPosY;\nstatic int gLastMouseX;\nstatic int gLastMouseY;\n\n\/\/ general & misc\nenum {\n PLUGIN_PLANE_ID = 0,\n CMD_CONTACT_ATC,\n};\n\n\/\/ Command Refs\n#define sCONTACT_ATC \"sim\/operation\/contact_atc\"\n\nXPLMDataRef avionics_power_on_dataref;\nXPLMDataRef audio_selection_com1_dataref;\nXPLMDataRef audio_selection_com2_dataref;\n\n#ifdef TOGGLE_TEST_FEATURE\nXPLMDataRef window_ice_dataref;\n\nXPLMDataRef artificial_stability_on_dataref;\nXPLMDataRef artificial_stability_pitch_on_dataref;\nXPLMDataRef artificial_stability_roll_on_dataref;\n#endif\n\nXPLMDataRef panel_visible_win_t_dataref;\n\n\/*\n *\n *\n *\/\nPLUGIN_API int XPluginStart(char* outName, char* outSig, char* outDesc) {\n\n LPRINTF(\"CommView Plugin: XPluginStart\\n\");\n strcpy(outName, \"CommViewer\");\n strcpy(outSig , \"jdp.comm.view\");\n strcpy(outDesc, \"CommView Plugin.\");\n\n \/\/ sim\/cockpit\/switches\/audio_panel_out\n\n \/\/ sim\/cockpit2\/radios\/actuators\/audio_com_selection\n \/\/ sim\/cockpit2\/radios\/actuators\/audio_selection_com1 int y boolean is com1 selected for listening\n \/\/ sim\/cockpit2\/radios\/actuators\/audio_selection_com2 int y boolean is com2 selected for listening\n \/\/ sim\/cockpit2\/radios\/actuators\/com1_power int y boolean Com radio 1 off or on, 0 or 1.\n \/\/ sim\/cockpit2\/radios\/actuators\/com2_power int y boolean Com radio 2 off or on, 0 or 1.\n\n \/\/avionics_power_on_dataref = XPLMFindDataRef(\"sim\/cockpit2\/switches\/avionics_power_on\");\n \/\/LPRINTF(\"CommView Plugin: data\/command refs initialized\\n\");\n\n audio_selection_com1_dataref = XPLMFindDataRef(\"sim\/cockpit2\/radios\/actuators\/audio_selection_com1\");\n audio_selection_com2_dataref = XPLMFindDataRef(\"sim\/cockpit2\/radios\/actuators\/audio_selection_com2\");\n\n#ifdef TOGGLE_TEST_FEATURE\n artificial_stability_on_dataref = XPLMFindDataRef(\"sim\/cockpit2\/switches\/artificial_stability_on\");\n artificial_stability_pitch_on_dataref = XPLMFindDataRef(\"sim\/cockpit2\/switches\/artificial_stability_pitch_on\");\n artificial_stability_roll_on_dataref = XPLMFindDataRef(\"sim\/cockpit2\/switches\/artificial_stability_roll_on\");\n XPLMSetDatai(artificial_stability_on_dataref, 1);\n XPLMSetDatai(artificial_stability_pitch_on_dataref, 1);\n XPLMSetDatai(artificial_stability_roll_on_dataref, 1);\n#endif\n\n XPLMCommandRef cmd_ref;\n cmd_ref = XPLMCreateCommand(sCONTACT_ATC, \"Contact ATC\");\n XPLMRegisterCommandHandler(cmd_ref, CommandHandler, CMD_HNDLR_EPILOG, (void*)CMD_CONTACT_ATC);\n\n \/\/ XPLMRegisterFlightLoopCallback(FlightLoopCallback, FL_CB_INTERVAL, NULL);\n panel_visible_win_t_dataref = XPLMFindDataRef(\"sim\/graphics\/view\/panel_visible_win_t\");\n\n int top = (int)XPLMGetDataf(panel_visible_win_t_dataref);\n gWinPosX = 0;\n gWinPosY = top - 200;\n gWindow = XPLMCreateWindow(gWinPosX, \/\/ left\n gWinPosY, \/\/ top\n gWinPosX+WINDOW_WIDTH, \/\/ right\n gWinPosY-WINDOW_HEIGHT, \/\/ bottom\n true, \/\/ is visible\n DrawWindowCallback,\n HandleKeyCallback,\n HandleMouseCallback,\n NULL); \/\/ Refcon\n\n#ifdef TOGGLE_TEST_FEATURE\n \/\/gHotKey = XPLMRegisterHotKey(XPLM_VK_F3,\n \/\/ xplm_DownFlag,\n \/\/ \"Toggle Window Ice\",\n \/\/ HotKeyCallback,\n \/\/ NULL);\n#endif\n\n LPRINTF(\"CommView Plugin: startup completed\\n\");\n\n return PROCESSED_EVENT;\n}\n\n#ifdef TOGGLE_TEST_FEATURE\n\/*\n *\n *\n *\/\nvoid HotKeyCallback(void* inRefcon) {\n static bool isSaved = false;\n\n if (isSaved) {\n isSaved = false;\n } else {\n isSaved = true;\n }\n}\n#endif\n\n\/*\n *\n *\n *\/\nfloat FlightLoopCallback(float inElapsedSinceLastCall,\n float inElapsedTimeSinceLastFlightLoop,\n int inCounter,\n void* inRefcon) {\n\n\/\/ if ((gFlCbCnt % PANEL_CHECK_INTERVAL) == 0) {\n\/\/ }\n\n if (!gPluginEnabled) {\n\n }\n\n return 1.0;\n}\n\n\/*\n *\n *\n *\/\nint CommandHandler(XPLMCommandRef inCommand,\n XPLMCommandPhase inPhase,\n void* inRefcon) {\n\n\/\/ if ((gFlCbCnt % PANEL_CHECK_INTERVAL) == 0) {\n\/\/ }\n\/\/ if (!gPluginEnabled) {\n\/\/ return IGNORED_EVENT;\n\/\/ }\n\n switch (reinterpret_cast<uint32_t>(inRefcon)) {\n case CMD_CONTACT_ATC:\n switch (inPhase) {\n case xplm_CommandBegin:\n case xplm_CommandContinue:\n gPTT_On = true;\n break;\n case xplm_CommandEnd:\n gPTT_On = false;\n break;\n default:\n break;\n }\n break;\n default:\n break;\n }\n\n return IGNORED_EVENT;\n}\n\n\/*\n *\n *\/\nPLUGIN_API void XPluginStop(void) {\n\n gPluginEnabled = false;\n \/\/XPLMUnregisterFlightLoopCallback(FlightLoopCallback, NULL);\n LPRINTF(\"CommView Plugin: XPluginStop\\n\");\n}\n\n\/*\n *\n *\/\nPLUGIN_API void XPluginDisable(void) {\n\n gPluginEnabled = false;\n LPRINTF(\"CommView Plugin: XPluginDisable\\n\");\n}\n\n\/*\n *\n *\/\nPLUGIN_API int XPluginEnable(void) {\n\n gPluginEnabled = true;\n LPRINTF(\"CommView Plugin: XPluginEnable\\n\");\n\n return PROCESSED_EVENT;\n}\n\n\/*\n *\n *\/\nPLUGIN_API void XPluginReceiveMessage(XPLMPluginID inFrom,\n long inMsg,\n void* inParam) {\n\n if (inFrom == XPLM_PLUGIN_XPLANE) {\n int inparam = reinterpret_cast<int>(inParam);\n switch (inMsg) {\n case XPLM_MSG_PLANE_LOADED:\n if (inparam != PLUGIN_PLANE_ID || gPlaneLoaded) { break; }\n LPRINTF(\"CommView Plugin: XPluginReceiveMessage XPLM_MSG_PLANE_LOADED\\n\");\n break;\n case XPLM_MSG_AIRPORT_LOADED:\n LPRINTF(\"CommView Plugin: XPluginReceiveMessage XPLM_MSG_AIRPORT_LOADED\\n\");\n break;\n case XPLM_MSG_SCENERY_LOADED:\n LPRINTF(\"CommView Plugin: XPluginReceiveMessage XPLM_MSG_SCENERY_LOADED\\n\");\n break;\n case XPLM_MSG_AIRPLANE_COUNT_CHANGED:\n LPRINTF(\"CommView Plugin: XPluginReceiveMessage XPLM_MSG_AIRPLANE_COUNT_CHANGED\\n\");\n break;\n \/\/ XXX: system state and procedure, what's difference between an unloaded and crashed plane?\n case XPLM_MSG_PLANE_CRASHED:\n if ((int)inParam != PLUGIN_PLANE_ID) { break; }\n LPRINTF(\"CommView Plugin: XPluginReceiveMessage XPLM_MSG_PLANE_CRASHED\\n\");\n break;\n case XPLM_MSG_PLANE_UNLOADED:\n if ((int)inParam != PLUGIN_PLANE_ID) { break; }\n LPRINTF(\"CommView Plugin: XPluginReceiveMessage XPLM_MSG_PLANE_UNLOADED\\n\");\n break;\n default: \/\/ unknown\n break;\n } \/\/ switch (inMsg)\n } \/\/ if (inFrom == XPLM_PLUGIN_XPLANE)\n}\n\n\/*\n *\n *\n *\/\nvoid DrawWindowCallback(XPLMWindowID inWindowID, void* inRefcon) {\n\n int left;\n int top;\n int right;\n int bottom;\n static char str[100];\n static float color[] = {1.0, 1.0, 1.0}; \/\/ RGB White\n\n \/\/int top = (int)XPLMGetDataf(panel_visible_win_t_dataref);\n \/\/XPLMDrawTranslucentDarkBox(0, top-200, 300, top-200-50);\n\n \/\/ location of the window and draw the window\n XPLMGetWindowGeometry(inWindowID, &left, &top, &right, &bottom);\n XPLMDrawTranslucentDarkBox(left, top, right, bottom);\n\n \/\/ put the text into the window, NULL indicates no word wrap\n#if 1\n sprintf(str,\"%s\\t\\t\\tCOM1: %d\\t\\t\\tCOM2: %d\",\n (char*)(gPTT_On ? \"PTT: ON\" : \"PTT: OFF\"),\n XPLMGetDatai(audio_selection_com1_dataref),\n XPLMGetDatai(audio_selection_com2_dataref));\n\n XPLMDrawString(color, left+5, top-20, str, NULL, xplmFont_Basic);\n#else\n XPLMDrawString(color,\n left+5,\n top,\n (char*)(gCounter ? \"PTT: ON\" : \"PTT: OFF\"),\n NULL,\n xplmFont_Basic);\n#endif\n \/\/glDisable(GL_TEXTURE_2D);\n \/\/glColor3f(0.7, 0.7, 0.7);\n \/\/glBegin(GL_LINES);\n \/\/ glVertex2i(right-1, top-1);\n \/\/ glVertex2i(right-7, top-7);\n \/\/ glVertex2i(right-7, top-1);\n \/\/ glVertex2i(right-1, top-7);\n \/\/glEnd();\n \/\/glEnable(GL_TEXTURE_2D);\n}\n\n\/*\n *\n *\n *\/\nvoid HandleKeyCallback(XPLMWindowID inWindowID,\n char inKey,\n XPLMKeyFlags inFlags,\n char inVirtualKey,\n void* inRefcon,\n int losingFocus) {\n\n \/\/ nothing to do here\n}\n\n\/*\n *\n *\n *\/\n #define COMS_UNCHANGED (0)\n #define COM1_CHANGED (1)\n #define COM2_CHANGED (2)\nint HandleMouseCallback(XPLMWindowID inWindowID,\n int x,\n int y,\n XPLMMouseStatus inMouse,\n void* inRefcon) {\n\n static int com_changed = COMS_UNCHANGED;\n static int MouseDownX;\n static int MouseDownY;\n\n switch (inMouse) {\n case xplm_MouseDown:\n \/\/ if ((x >= gWinPosX+WINDOW_WIDTH-8) &&\n \/\/ (x <= gWinPosX+WINDOW_WIDTH) &&\n \/\/ (y <= gWinPosY) && (y >= gWinPosY-8)) {\n \/\/ windowCloseRequest = 1;\n \/\/ } else {\n MouseDownX = gLastMouseX = x;\n MouseDownY = gLastMouseY = y;\n \/\/ }\n break;\n case xplm_MouseDrag:\n \/\/ this event fires while xplm_MouseDown\n \/\/ and whether the window is being dragged or not\n gWinPosX += (x - gLastMouseX);\n gWinPosY += (y - gLastMouseY);\n XPLMSetWindowGeometry(gWindow,\n gWinPosX,\n gWinPosY,\n gWinPosX+WINDOW_WIDTH,\n gWinPosY-WINDOW_HEIGHT);\n gLastMouseX = x;\n gLastMouseY = y;\n break;\n case xplm_MouseUp:\n if (MouseDownX == x && MouseDownY == y) {\n int com1 = XPLMGetDatai(audio_selection_com1_dataref);\n int com2 = XPLMGetDatai(audio_selection_com2_dataref);\n\n if (com1 && com2 && com_changed) {\n switch (com_changed) {\n case COM1_CHANGED:\n XPLMSetDatai(audio_selection_com1_dataref, 0);\n break;\n case COM2_CHANGED:\n XPLMSetDatai(audio_selection_com2_dataref, 0);\n break;\n default:\n break;\n }\n com_changed = COMS_UNCHANGED;\n } else if (!com1 && com2) {\n com_changed = COM1_CHANGED;\n XPLMSetDatai(audio_selection_com1_dataref, 1);\n } else if (com1 && !com2) {\n com_changed = COM2_CHANGED;\n XPLMSetDatai(audio_selection_com2_dataref, 1);\n }\n }\n break;\n } \/\/ switch (inMouse)\n\n return PROCESSED_EVENT;\n}\n<commit_msg>sync plugin name to strings, remove magic numbers<commit_after>\/\/ Copyright (c) 2014 Joseph D Poirier\n\/\/ Distributable under the terms of The New BSD License\n\/\/ that can be found in the LICENSE file.\n\n#ifdef _WIN32 \/* this is set for 64 bit as well *\/\n# define WIN32_LEAN_AND_MEAN\n# include <windows.h>\n#endif\n\n#ifdef _APPLE_\n#include <OpenGl\/gl.h>\n#else\n#include <GL\/gl.h>\n#endif\n\n#include <math.h>\n#include <stdio.h>\n#include <stdint.h>\n#include <stdlib.h>\n#include <string.h>\n\n#include \"XPLMDefs.h\"\n#include \"XPLMPlugin.h\"\n#include \"XPLMProcessing.h\"\n#include \"XPLMDataAccess.h\"\n#include \"XPLMUtilities.h\"\n#include \"XPLMDisplay.h\"\n#include \"XPLMGraphics.h\"\n\n#include \"defs.h\"\n#include \"commviewer.h\"\n\nstatic int CommandHandler(XPLMCommandRef inCommand,\n XPLMCommandPhase inPhase,\n void* inRefcon);\n\nstatic void DrawWindowCallback(XPLMWindowID inWindowID,\n void* inRefcon);\n\nstatic void HandleKeyCallback(XPLMWindowID inWindowID,\n char inKey,\n XPLMKeyFlags inFlags,\n char inVirtualKey,\n void* inRefcon,\n int losingFocus);\n\nstatic int HandleMouseCallback(XPLMWindowID inWindowID,\n int x,\n int y,\n XPLMMouseStatus inMouse,\n void* inRefcon);\n\nstatic void HotKeyCallback(void* inRefcon);\n\nstatic XPLMWindowID gWindow = NULL;\nstatic bool gPluginEnabled = false;\nstatic int gPlaneLoaded = 0;\nstatic const float FL_CB_INTERVAL = -1.0;\nstatic bool gPTT_On = false;\nstatic XPLMHotKeyID gHotKey = NULL;\n\n#define WINDOW_WIDTH (200)\n#define WINDOW_HEIGHT (40)\nstatic int gWinPosX;\nstatic int gWinPosY;\nstatic int gLastMouseX;\nstatic int gLastMouseY;\n\n\/\/ general & misc\nenum {\n PLUGIN_PLANE_ID = 0,\n CMD_CONTACT_ATC,\n};\n\n\/\/ Command Refs\n#define sCONTACT_ATC \"sim\/operation\/contact_atc\"\n\nXPLMDataRef avionics_power_on_dataref;\nXPLMDataRef audio_selection_com1_dataref;\nXPLMDataRef audio_selection_com2_dataref;\n\n#ifdef TOGGLE_TEST_FEATURE\nXPLMDataRef window_ice_dataref;\n\nXPLMDataRef artificial_stability_on_dataref;\nXPLMDataRef artificial_stability_pitch_on_dataref;\nXPLMDataRef artificial_stability_roll_on_dataref;\n#endif\n\nXPLMDataRef panel_visible_win_t_dataref;\n\n\/*\n *\n *\n *\/\nPLUGIN_API int XPluginStart(char* outName, char* outSig, char* outDesc) {\n\n LPRINTF(\"CommView Plugin: XPluginStart\\n\");\n strcpy(outName, \"CommViewer\");\n strcpy(outSig , \"jdp.comm.viewer\");\n strcpy(outDesc, \"CommViewer Plugin.\");\n\n \/\/ sim\/cockpit\/switches\/audio_panel_out\n\n \/\/ sim\/cockpit2\/radios\/actuators\/audio_com_selection\n \/\/ sim\/cockpit2\/radios\/actuators\/audio_selection_com1 int y boolean is com1 selected for listening\n \/\/ sim\/cockpit2\/radios\/actuators\/audio_selection_com2 int y boolean is com2 selected for listening\n \/\/ sim\/cockpit2\/radios\/actuators\/com1_power int y boolean Com radio 1 off or on, 0 or 1.\n \/\/ sim\/cockpit2\/radios\/actuators\/com2_power int y boolean Com radio 2 off or on, 0 or 1.\n\n \/\/avionics_power_on_dataref = XPLMFindDataRef(\"sim\/cockpit2\/switches\/avionics_power_on\");\n \/\/LPRINTF(\"CommView Plugin: data\/command refs initialized\\n\");\n\n audio_selection_com1_dataref = XPLMFindDataRef(\"sim\/cockpit2\/radios\/actuators\/audio_selection_com1\");\n audio_selection_com2_dataref = XPLMFindDataRef(\"sim\/cockpit2\/radios\/actuators\/audio_selection_com2\");\n\n#ifdef TOGGLE_TEST_FEATURE\n artificial_stability_on_dataref = XPLMFindDataRef(\"sim\/cockpit2\/switches\/artificial_stability_on\");\n artificial_stability_pitch_on_dataref = XPLMFindDataRef(\"sim\/cockpit2\/switches\/artificial_stability_pitch_on\");\n artificial_stability_roll_on_dataref = XPLMFindDataRef(\"sim\/cockpit2\/switches\/artificial_stability_roll_on\");\n XPLMSetDatai(artificial_stability_on_dataref, 1);\n XPLMSetDatai(artificial_stability_pitch_on_dataref, 1);\n XPLMSetDatai(artificial_stability_roll_on_dataref, 1);\n#endif\n\n XPLMCommandRef cmd_ref;\n cmd_ref = XPLMCreateCommand(sCONTACT_ATC, \"Contact ATC\");\n XPLMRegisterCommandHandler(cmd_ref,\n CommandHandler,\n CMD_HNDLR_EPILOG,\n (void*)CMD_CONTACT_ATC);\n\n \/\/ XPLMRegisterFlightLoopCallback(FlightLoopCallback, FL_CB_INTERVAL, NULL);\n panel_visible_win_t_dataref = XPLMFindDataRef(\"sim\/graphics\/view\/panel_visible_win_t\");\n\n int top = (int)XPLMGetDataf(panel_visible_win_t_dataref);\n gWinPosX = 0;\n gWinPosY = top - 200;\n gWindow = XPLMCreateWindow(gWinPosX, \/\/ left\n gWinPosY, \/\/ top\n gWinPosX+WINDOW_WIDTH, \/\/ right\n gWinPosY-WINDOW_HEIGHT, \/\/ bottom\n true, \/\/ is visible\n DrawWindowCallback,\n HandleKeyCallback,\n HandleMouseCallback,\n NULL); \/\/ Refcon\n\n#ifdef TOGGLE_TEST_FEATURE\n \/\/gHotKey = XPLMRegisterHotKey(XPLM_VK_F3,\n \/\/ xplm_DownFlag,\n \/\/ \"Toggle Window Ice\",\n \/\/ HotKeyCallback,\n \/\/ NULL);\n#endif\n\n LPRINTF(\"CommView Plugin: startup completed\\n\");\n\n return PROCESSED_EVENT;\n}\n\n#ifdef TOGGLE_TEST_FEATURE\n\/*\n *\n *\n *\/\nvoid HotKeyCallback(void* inRefcon) {\n static bool isSaved = false;\n\n if (isSaved) {\n isSaved = false;\n } else {\n isSaved = true;\n }\n}\n#endif\n\n\/*\n *\n *\n *\/\nfloat FlightLoopCallback(float inElapsedSinceLastCall,\n float inElapsedTimeSinceLastFlightLoop,\n int inCounter,\n void* inRefcon) {\n\n\/\/ if ((gFlCbCnt % PANEL_CHECK_INTERVAL) == 0) {\n\/\/ }\n\n if (!gPluginEnabled) {\n\n }\n\n return 1.0;\n}\n\n\/*\n *\n *\n *\/\nint CommandHandler(XPLMCommandRef inCommand,\n XPLMCommandPhase inPhase,\n void* inRefcon) {\n\n\/\/ if ((gFlCbCnt % PANEL_CHECK_INTERVAL) == 0) {\n\/\/ }\n\/\/ if (!gPluginEnabled) {\n\/\/ return IGNORED_EVENT;\n\/\/ }\n\n switch (reinterpret_cast<uint32_t>(inRefcon)) {\n case CMD_CONTACT_ATC:\n switch (inPhase) {\n case xplm_CommandBegin:\n case xplm_CommandContinue:\n gPTT_On = true;\n break;\n case xplm_CommandEnd:\n gPTT_On = false;\n break;\n default:\n break;\n }\n break;\n default:\n break;\n }\n\n return IGNORED_EVENT;\n}\n\n\/*\n *\n *\/\nPLUGIN_API void XPluginStop(void) {\n\n gPluginEnabled = false;\n \/\/XPLMUnregisterFlightLoopCallback(FlightLoopCallback, NULL);\n LPRINTF(\"CommView Plugin: XPluginStop\\n\");\n}\n\n\/*\n *\n *\/\nPLUGIN_API void XPluginDisable(void) {\n\n gPluginEnabled = false;\n LPRINTF(\"CommView Plugin: XPluginDisable\\n\");\n}\n\n\/*\n *\n *\/\nPLUGIN_API int XPluginEnable(void) {\n\n gPluginEnabled = true;\n LPRINTF(\"CommView Plugin: XPluginEnable\\n\");\n\n return PROCESSED_EVENT;\n}\n\n\/*\n *\n *\/\nPLUGIN_API void XPluginReceiveMessage(XPLMPluginID inFrom,\n long inMsg,\n void* inParam) {\n\n if (inFrom == XPLM_PLUGIN_XPLANE) {\n int inparam = reinterpret_cast<int>(inParam);\n switch (inMsg) {\n case XPLM_MSG_PLANE_LOADED:\n if (inparam != PLUGIN_PLANE_ID || gPlaneLoaded) { break; }\n LPRINTF(\"CommView Plugin: XPluginReceiveMessage XPLM_MSG_PLANE_LOADED\\n\");\n break;\n case XPLM_MSG_AIRPORT_LOADED:\n LPRINTF(\"CommView Plugin: XPluginReceiveMessage XPLM_MSG_AIRPORT_LOADED\\n\");\n break;\n case XPLM_MSG_SCENERY_LOADED:\n LPRINTF(\"CommView Plugin: XPluginReceiveMessage XPLM_MSG_SCENERY_LOADED\\n\");\n break;\n case XPLM_MSG_AIRPLANE_COUNT_CHANGED:\n LPRINTF(\"CommView Plugin: XPluginReceiveMessage XPLM_MSG_AIRPLANE_COUNT_CHANGED\\n\");\n break;\n \/\/ XXX: system state and procedure, what's difference between an unloaded and crashed plane?\n case XPLM_MSG_PLANE_CRASHED:\n if ((int)inParam != PLUGIN_PLANE_ID) { break; }\n LPRINTF(\"CommView Plugin: XPluginReceiveMessage XPLM_MSG_PLANE_CRASHED\\n\");\n break;\n case XPLM_MSG_PLANE_UNLOADED:\n if ((int)inParam != PLUGIN_PLANE_ID) { break; }\n LPRINTF(\"CommView Plugin: XPluginReceiveMessage XPLM_MSG_PLANE_UNLOADED\\n\");\n break;\n default: \/\/ unknown\n break;\n } \/\/ switch (inMsg)\n } \/\/ if (inFrom == XPLM_PLUGIN_XPLANE)\n}\n\n\/*\n *\n *\n *\/\nvoid DrawWindowCallback(XPLMWindowID inWindowID, void* inRefcon) {\n\n int left;\n int top;\n int right;\n int bottom;\n static char str[100];\n static float color[] = {1.0, 1.0, 1.0}; \/\/ RGB White\n\n \/\/int top = (int)XPLMGetDataf(panel_visible_win_t_dataref);\n \/\/XPLMDrawTranslucentDarkBox(0, top-200, 300, top-200-50);\n\n \/\/ location of the window and draw the window\n XPLMGetWindowGeometry(inWindowID, &left, &top, &right, &bottom);\n XPLMDrawTranslucentDarkBox(left, top, right, bottom);\n\n \/\/ text to window, NULL indicates no word wrap\n sprintf(str,\"%s\\t\\t\\tCOM1: %d\\t\\t\\tCOM2: %d\",\n (char*)(gPTT_On ? \"PTT: ON\" : \"PTT: OFF\"),\n XPLMGetDatai(audio_selection_com1_dataref),\n XPLMGetDatai(audio_selection_com2_dataref));\n XPLMDrawString(color, left+5, top-20, str, NULL, xplmFont_Basic);\n\n \/\/glDisable(GL_TEXTURE_2D);\n \/\/glColor3f(0.7, 0.7, 0.7);\n \/\/glBegin(GL_LINES);\n \/\/ glVertex2i(right-1, top-1);\n \/\/ glVertex2i(right-7, top-7);\n \/\/ glVertex2i(right-7, top-1);\n \/\/ glVertex2i(right-1, top-7);\n \/\/glEnd();\n \/\/glEnable(GL_TEXTURE_2D);\n}\n\n\/*\n *\n *\n *\/\nvoid HandleKeyCallback(XPLMWindowID inWindowID,\n char inKey,\n XPLMKeyFlags inFlags,\n char inVirtualKey,\n void* inRefcon,\n int losingFocus) {\n\n \/\/ nothing to do here\n}\n\n\/*\n *\n *\n *\/\n #define COMS_UNCHANGED (0)\n #define COM1_CHANGED (1)\n #define COM2_CHANGED (2)\n #define COMM_UNSELECTED (0)\n #define COMM_SELECTED (1)\nint HandleMouseCallback(XPLMWindowID inWindowID,\n int x,\n int y,\n XPLMMouseStatus inMouse,\n void* inRefcon) {\n\n static int com_changed = COMS_UNCHANGED;\n static int MouseDownX;\n static int MouseDownY;\n\n switch (inMouse) {\n case xplm_MouseDown:\n \/\/ if ((x >= gWinPosX+WINDOW_WIDTH-8) &&\n \/\/ (x <= gWinPosX+WINDOW_WIDTH) &&\n \/\/ (y <= gWinPosY) && (y >= gWinPosY-8)) {\n \/\/ windowCloseRequest = 1;\n \/\/ } else {\n MouseDownX = gLastMouseX = x;\n MouseDownY = gLastMouseY = y;\n \/\/ }\n break;\n case xplm_MouseDrag:\n \/\/ this event fires while xplm_MouseDown\n \/\/ and whether the window is being dragged or not\n gWinPosX += (x - gLastMouseX);\n gWinPosY += (y - gLastMouseY);\n XPLMSetWindowGeometry(gWindow,\n gWinPosX,\n gWinPosY,\n gWinPosX+WINDOW_WIDTH,\n gWinPosY-WINDOW_HEIGHT);\n gLastMouseX = x;\n gLastMouseY = y;\n break;\n case xplm_MouseUp:\n if (MouseDownX == x && MouseDownY == y) {\n int com1 = XPLMGetDatai(audio_selection_com1_dataref);\n int com2 = XPLMGetDatai(audio_selection_com2_dataref);\n\n if (com1 && com2 && com_changed) {\n switch (com_changed) {\n case COM1_CHANGED:\n XPLMSetDatai(audio_selection_com1_dataref, COMM_UNSELECTED);\n break;\n case COM2_CHANGED:\n XPLMSetDatai(audio_selection_com2_dataref, COMM_UNSELECTED);\n break;\n default:\n break;\n }\n com_changed = COMS_UNCHANGED;\n } else if (!com1 && com2) {\n com_changed = COM1_CHANGED;\n XPLMSetDatai(audio_selection_com1_dataref, COMM_SELECTED);\n } else if (com1 && !com2) {\n com_changed = COM2_CHANGED;\n XPLMSetDatai(audio_selection_com2_dataref, COMM_SELECTED);\n }\n }\n break;\n } \/\/ switch (inMouse)\n\n return PROCESSED_EVENT;\n}\n<|endoftext|>"} {"text":"<commit_before>\/\/ Copyright (c) 2012 The Chromium Authors. All rights reserved.\n\/\/ Use of this source code is governed by a BSD-style license that can be\n\/\/ found in the LICENSE file.\n\n#include \"ash\/wm\/gestures\/shelf_gesture_handler.h\"\n\n#include \"ash\/root_window_controller.h\"\n#include \"ash\/shelf_types.h\"\n#include \"ash\/shell.h\"\n#include \"ash\/shell_delegate.h\"\n#include \"ash\/system\/status_area_widget.h\"\n#include \"ash\/wm\/gestures\/tray_gesture_handler.h\"\n#include \"ash\/wm\/shelf_layout_manager.h\"\n#include \"ash\/wm\/window_util.h\"\n#include \"ui\/aura\/window.h\"\n#include \"ui\/compositor\/layer.h\"\n#include \"ui\/compositor\/scoped_layer_animation_settings.h\"\n#include \"ui\/gfx\/transform.h\"\n#include \"ui\/views\/widget\/widget.h\"\n\nnamespace {\n\n\/\/ A ShelfResetHandler auto-hides the shelf as soon as the user interacts with\n\/\/ any non-shelf part of the system. The ShelfResetHandler manages its own\n\/\/ lifetime.\nclass ShelfResetHandler : public ui::EventHandler,\n public ash::internal::ShelfLayoutManager::Observer {\n public:\n explicit ShelfResetHandler(ash::internal::ShelfLayoutManager* shelf)\n : shelf_(shelf) {\n shelf_->AddObserver(this);\n ash::Shell::GetInstance()->AddPreTargetHandler(this);\n }\n\n private:\n virtual ~ShelfResetHandler() {\n ash::Shell::GetInstance()->RemovePreTargetHandler(this);\n shelf_->RemoveObserver(this);\n }\n\n void ResetShelfState() {\n shelf_->SetAutoHideBehavior(ash::SHELF_AUTO_HIDE_BEHAVIOR_ALWAYS);\n delete this;\n }\n\n void DecideShelfVisibility(const gfx::Point& location) {\n \/\/ For the rest of the mouse events, ignore if the event happens inside the\n \/\/ shelf.\n views::Widget* widget = shelf_->launcher_widget();\n if (widget &&\n widget->GetWindowBoundsInScreen().Contains(location)) {\n return;\n }\n\n widget = shelf_->status_area_widget();\n if (widget &&\n widget->GetWindowBoundsInScreen().Contains(location)) {\n return;\n }\n\n ResetShelfState();\n }\n\n \/\/ Overridden from ui::EventHandler:\n virtual void OnKeyEvent(ui::KeyEvent* event) OVERRIDE {\n ResetShelfState();\n }\n\n virtual void OnMouseEvent(ui::MouseEvent* event) OVERRIDE {\n \/\/ Ignore all mouse move events.\n if (event->type() == ui::ET_MOUSE_PRESSED ||\n event->type() == ui::ET_MOUSE_RELEASED) {\n DecideShelfVisibility(event->root_location());\n }\n }\n\n virtual void OnTouchEvent(ui::TouchEvent* event) OVERRIDE {\n DecideShelfVisibility(event->root_location());\n }\n\n virtual void OnGestureEvent(ui::GestureEvent* event) OVERRIDE {\n DecideShelfVisibility(event->root_location());\n }\n\n \/\/ Overridden from ash::internal::ShelfLayoutManager::Observer:\n virtual void WillDeleteShelf() OVERRIDE {\n delete this;\n }\n\n ash::internal::ShelfLayoutManager* shelf_;\n\n DISALLOW_COPY_AND_ASSIGN(ShelfResetHandler);\n};\n\n} \/\/ namespace\n\nnamespace ash {\nnamespace internal {\n\nShelfGestureHandler::ShelfGestureHandler()\n : drag_in_progress_(false) {\n}\n\nShelfGestureHandler::~ShelfGestureHandler() {\n}\n\nbool ShelfGestureHandler::ProcessGestureEvent(const ui::GestureEvent& event) {\n Shell* shell = Shell::GetInstance();\n if (!shell->delegate()->IsUserLoggedIn() ||\n shell->delegate()->IsScreenLocked()) {\n \/\/ The gestures are disabled in the lock\/login screen.\n return false;\n }\n\n \/\/ The gesture are disabled for fullscreen windows.\n aura::Window* active = wm::GetActiveWindow();\n if (active && wm::IsWindowFullscreen(active))\n return false;\n\n \/\/ TODO(oshima): Find the root window controller from event's location.\n ShelfLayoutManager* shelf = Shell::GetPrimaryRootWindowController()->shelf();\n if (event.type() == ui::ET_GESTURE_SCROLL_BEGIN) {\n drag_in_progress_ = true;\n shelf->StartGestureDrag(event);\n return true;\n }\n\n if (!drag_in_progress_)\n return false;\n\n if (event.type() == ui::ET_GESTURE_SCROLL_UPDATE) {\n if (tray_handler_.get()) {\n if (!tray_handler_->UpdateGestureDrag(event))\n tray_handler_.reset();\n } else if (shelf->UpdateGestureDrag(event) ==\n ShelfLayoutManager::DRAG_TRAY) {\n tray_handler_.reset(new TrayGestureHandler());\n }\n\n return true;\n }\n\n drag_in_progress_ = false;\n\n if (event.type() == ui::ET_GESTURE_SCROLL_END ||\n event.type() == ui::ET_SCROLL_FLING_START) {\n if (tray_handler_.get()) {\n tray_handler_->CompleteGestureDrag(event);\n tray_handler_.reset();\n }\n\n ShelfVisibilityState old_state = shelf->visibility_state();\n shelf->CompleteGestureDrag(event);\n ShelfVisibilityState new_state = shelf->visibility_state();\n if (new_state != old_state && new_state == SHELF_VISIBLE)\n new ShelfResetHandler(shelf);\n return true;\n }\n\n \/\/ Unexpected event. Reset the state and let the event fall through.\n shelf->CancelGestureDrag();\n return false;\n}\n\n} \/\/ namespace internal\n} \/\/ namespace ash\n<commit_msg>ash: Fix hiding the shelf after a gesture-drag to reveal it.<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\/gestures\/shelf_gesture_handler.h\"\n\n#include \"ash\/root_window_controller.h\"\n#include \"ash\/shelf_types.h\"\n#include \"ash\/shell.h\"\n#include \"ash\/shell_delegate.h\"\n#include \"ash\/system\/status_area_widget.h\"\n#include \"ash\/wm\/gestures\/tray_gesture_handler.h\"\n#include \"ash\/wm\/shelf_layout_manager.h\"\n#include \"ash\/wm\/window_util.h\"\n#include \"ui\/aura\/window.h\"\n#include \"ui\/compositor\/layer.h\"\n#include \"ui\/compositor\/scoped_layer_animation_settings.h\"\n#include \"ui\/gfx\/transform.h\"\n#include \"ui\/views\/widget\/widget.h\"\n\nnamespace {\n\n\/\/ A ShelfResetHandler auto-hides the shelf as soon as the user interacts with\n\/\/ any non-shelf part of the system. The ShelfResetHandler manages its own\n\/\/ lifetime.\nclass ShelfResetHandler : public ui::EventHandler,\n public ash::internal::ShelfLayoutManager::Observer {\n public:\n explicit ShelfResetHandler(ash::internal::ShelfLayoutManager* shelf)\n : shelf_(shelf) {\n shelf_->AddObserver(this);\n ash::Shell::GetInstance()->AddPreTargetHandler(this);\n }\n\n private:\n virtual ~ShelfResetHandler() {\n ash::Shell::GetInstance()->RemovePreTargetHandler(this);\n shelf_->RemoveObserver(this);\n }\n\n void ResetShelfState() {\n shelf_->SetAutoHideBehavior(ash::SHELF_AUTO_HIDE_BEHAVIOR_ALWAYS);\n delete this;\n }\n\n bool ShelfIsEventTarget(const ui::Event& event) {\n aura::Window* target = static_cast<aura::Window*>(event.target());\n views::Widget* widget = shelf_->launcher_widget();\n if (widget && widget->GetNativeWindow() == target)\n return true;\n widget = shelf_->status_area_widget();\n if (widget && widget->GetNativeWindow() == target)\n return true;\n return false;\n }\n\n void DecideShelfVisibility(const gfx::Point& location) {\n \/\/ For the rest of the mouse events, ignore if the event happens inside the\n \/\/ shelf.\n views::Widget* widget = shelf_->launcher_widget();\n if (widget &&\n widget->GetWindowBoundsInScreen().Contains(location)) {\n return;\n }\n\n widget = shelf_->status_area_widget();\n if (widget &&\n widget->GetWindowBoundsInScreen().Contains(location)) {\n return;\n }\n\n ResetShelfState();\n }\n\n \/\/ Overridden from ui::EventHandler:\n virtual void OnKeyEvent(ui::KeyEvent* event) OVERRIDE {\n if (!ShelfIsEventTarget(*event))\n ResetShelfState();\n }\n\n virtual void OnMouseEvent(ui::MouseEvent* event) OVERRIDE {\n \/\/ Ignore all mouse move events.\n if (event->type() == ui::ET_MOUSE_PRESSED ||\n event->type() == ui::ET_MOUSE_RELEASED) {\n DecideShelfVisibility(event->root_location());\n }\n }\n\n virtual void OnTouchEvent(ui::TouchEvent* event) OVERRIDE {\n if (!ShelfIsEventTarget(*event))\n DecideShelfVisibility(event->root_location());\n }\n\n virtual void OnGestureEvent(ui::GestureEvent* event) OVERRIDE {\n if (!ShelfIsEventTarget(*event))\n DecideShelfVisibility(event->root_location());\n }\n\n \/\/ Overridden from ash::internal::ShelfLayoutManager::Observer:\n virtual void WillDeleteShelf() OVERRIDE {\n delete this;\n }\n\n ash::internal::ShelfLayoutManager* shelf_;\n\n DISALLOW_COPY_AND_ASSIGN(ShelfResetHandler);\n};\n\n} \/\/ namespace\n\nnamespace ash {\nnamespace internal {\n\nShelfGestureHandler::ShelfGestureHandler()\n : drag_in_progress_(false) {\n}\n\nShelfGestureHandler::~ShelfGestureHandler() {\n}\n\nbool ShelfGestureHandler::ProcessGestureEvent(const ui::GestureEvent& event) {\n Shell* shell = Shell::GetInstance();\n if (!shell->delegate()->IsUserLoggedIn() ||\n shell->delegate()->IsScreenLocked()) {\n \/\/ The gestures are disabled in the lock\/login screen.\n return false;\n }\n\n \/\/ The gesture are disabled for fullscreen windows.\n aura::Window* active = wm::GetActiveWindow();\n if (active && wm::IsWindowFullscreen(active))\n return false;\n\n \/\/ TODO(oshima): Find the root window controller from event's location.\n ShelfLayoutManager* shelf = Shell::GetPrimaryRootWindowController()->shelf();\n if (event.type() == ui::ET_GESTURE_SCROLL_BEGIN) {\n drag_in_progress_ = true;\n shelf->StartGestureDrag(event);\n return true;\n }\n\n if (!drag_in_progress_)\n return false;\n\n if (event.type() == ui::ET_GESTURE_SCROLL_UPDATE) {\n if (tray_handler_.get()) {\n if (!tray_handler_->UpdateGestureDrag(event))\n tray_handler_.reset();\n } else if (shelf->UpdateGestureDrag(event) ==\n ShelfLayoutManager::DRAG_TRAY) {\n tray_handler_.reset(new TrayGestureHandler());\n }\n\n return true;\n }\n\n drag_in_progress_ = false;\n\n if (event.type() == ui::ET_GESTURE_SCROLL_END ||\n event.type() == ui::ET_SCROLL_FLING_START) {\n if (tray_handler_.get()) {\n tray_handler_->CompleteGestureDrag(event);\n tray_handler_.reset();\n }\n\n ShelfVisibilityState old_state = shelf->visibility_state();\n shelf->CompleteGestureDrag(event);\n ShelfVisibilityState new_state = shelf->visibility_state();\n if (new_state != old_state && new_state == SHELF_VISIBLE)\n new ShelfResetHandler(shelf);\n return true;\n }\n\n \/\/ Unexpected event. Reset the state and let the event fall through.\n shelf->CancelGestureDrag();\n return false;\n}\n\n} \/\/ namespace internal\n} \/\/ namespace ash\n<|endoftext|>"} {"text":"<commit_before>\/*\n lib\/src\/CurlReceiver.hpp\n\nCopyright (c) 2015, Elecard Multimedia School\nAll rights reserved.\n\nRedistribution and use in source and binary forms, with or without\nmodification, are permitted provided that the following conditions are met:\n\n* Redistributions of source code must retain the above copyright notice, this\n list of conditions and the following disclaimer.\n\n* Redistributions in binary form must reproduce the above copyright notice,\n this list of conditions and the following disclaimer in the documentation\n and\/or other materials provided with the distribution.\n\nTHIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS \"AS IS\" \nAND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE\nIMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE\nDISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE\nFOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL\nDAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR\nSERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER\nCAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,\nOR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE\nOF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.\n *\/\n\n\/******************************************************************\n* INCLUDE FILES *\n*******************************************************************\/\n#include \"CurlReceiver.hpp\"\n\n\/******************************************************************\n* STATIC DATA *\n*******************************************************************\/\nstatic IHTTPReceiver *l_inst = nullptr; \/\/TODO: move this somewhere\n\n\/******************************************************************\n* EXPORTED TYPEDEFS [for headers only] *\n*******************************************************************\/\nIHTTPReceiver *IHTTPReceiver::Instance(void)\n{\n\tif(l_inst == nullptr) {\n\t\t\/\/only curl support now\n\t\tl_inst = new CurlReceiver();\n\t}\n\treturn l_inst;\n}\n\nbool IHTTPReceiver::SetInstance(IHTTPReceiver *inst)\n{\n\tif(l_inst == nullptr) {\n\t\tdelete l_inst;\n\t}\n\tl_inst = inst;\n}\n\nCurlReceiver::CurlReceiver()\n{\n\tm_curl = NULL;\n\tm_callback = NULL;\n}\n\nCurlReceiver::~CurlReceiver()\n{\n\tRelease();\n}\n\nbool CurlReceiver::Init()\n{\n\tbool initialized = false;\n\tm_curl = curl_easy_init();\n\t\n\tif (m_curl)\n\t\tinitialized = true;\n\n\treturn initialized;\n}\n\nbool CurlReceiver::Release()\n{\n\tcurl_easy_cleanup(m_curl);\n\treturn true;\n}\n\nbool CurlReceiver::Get(std::string url, IHTTPCallback *callback)\n{\t\n\tbool res = false;\n\tm_callback = callback;\n\tif (m_curl){\n\t\tFILE *file;\n\t\tCURLcode performed;\n\t\n\t\tchar out_file_name[FILENAME_MAX] = \"DownloadFile.mpd\";\n\t\tfile = fopen(out_file_name, \"wb\");\n\t\tcurl_easy_setopt(m_curl, CURLOPT_URL, &url);\n\t\tcurl_easy_setopt(m_curl, CURLOPT_WRITEFUNCTION, NULL); \/\/TODO: add callback function. \n\t\t\t\t\t\t\t\t\/\/ It should return number of bytes; \n\t\t\t\t\t\t\t\t\/\/ Now it uses function by default;\n\t\tcurl_easy_setopt(m_curl, CURLOPT_WRITEDATA, file);\n\t\t\n\t\tif (curl_easy_perform(m_curl) == 0) {\n\t\t\tres = true;\n\t\t}\n\t\tfclose(file);\n\t}\n\n\treturn res;\n}\n\n<commit_msg>[*] fixed Get method<commit_after>\/*\n lib\/src\/CurlReceiver.hpp\n\nCopyright (c) 2015, Elecard Multimedia School\nAll rights reserved.\n\nRedistribution and use in source and binary forms, with or without\nmodification, are permitted provided that the following conditions are met:\n\n* Redistributions of source code must retain the above copyright notice, this\n list of conditions and the following disclaimer.\n\n* Redistributions in binary form must reproduce the above copyright notice,\n this list of conditions and the following disclaimer in the documentation\n and\/or other materials provided with the distribution.\n\nTHIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS \"AS IS\" \nAND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE\nIMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE\nDISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE\nFOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL\nDAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR\nSERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER\nCAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,\nOR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE\nOF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.\n *\/\n\n\/******************************************************************\n* INCLUDE FILES *\n*******************************************************************\/\n#include \"CurlReceiver.hpp\"\n\n\/******************************************************************\n* STATIC DATA *\n*******************************************************************\/\nstatic IHTTPReceiver *l_inst = nullptr; \/\/TODO: move this somewhere\n\n\/******************************************************************\n* EXPORTED TYPEDEFS [for headers only] *\n*******************************************************************\/\nIHTTPReceiver *IHTTPReceiver::Instance(void)\n{\n\tif(l_inst == nullptr) {\n\t\t\/\/only curl support now\n\t\tl_inst = new CurlReceiver();\n\t}\n\treturn l_inst;\n}\n\nbool IHTTPReceiver::SetInstance(IHTTPReceiver *inst)\n{\n\tif(l_inst == nullptr) {\n\t\tdelete l_inst;\n\t}\n\tl_inst = inst;\n}\n\nCurlReceiver::CurlReceiver()\n{\n\tm_curl = NULL;\n\tm_callback = NULL;\n}\n\nCurlReceiver::~CurlReceiver()\n{\n\tRelease();\n}\n\nbool CurlReceiver::Init()\n{\n\tbool initialized = false;\n\tm_curl = curl_easy_init();\n\t\n\tif (m_curl)\n\t\tinitialized = true;\n\n\treturn initialized;\n}\n\nbool CurlReceiver::Release()\n{\n\tcurl_easy_cleanup(m_curl);\n\treturn true;\n}\n\nbool CurlReceiver::Get(std::string url, IHTTPCallback *callback)\n{\t\n\tbool res = false;\n\tm_callback = callback;\n\tif (m_curl){\n\t\tFILE *file;\n\t\tCURLcode performed;\n\t\t\n\t\tchar* m_url = new char[url.size() + 1];\n\t\tstd::copy(url.begin(), url.end(), m_url);\n\t\tm_url[url.size()] = '\\0';\t\n\t\t\n\t\tchar out_file_name[FILENAME_MAX] = \"DownloadFile.mpd\";\n\t\tfile = fopen(out_file_name, \"wb\");\n\t\tcurl_easy_setopt(m_curl, CURLOPT_URL, m_url);\n\t\tcurl_easy_setopt(m_curl, CURLOPT_WRITEFUNCTION, NULL); \/\/TODO: add callback function. \n\t\t\t\t\t\t\t\t\/\/ It should return number of bytes; \n\t\t\t\t\t\t\t\t\/\/ Now it uses function by default;\n\t\tcurl_easy_setopt(m_curl, CURLOPT_WRITEDATA, file);\n\t\t\n\t\tif (curl_easy_perform(m_curl) == 0) {\n\t\t\tres = true;\n\t\t}\n\t\tdelete[] m_url;\n\t\tfclose(file);\n\t}\n\n\treturn res;\n}\n\n<|endoftext|>"} {"text":"<commit_before>#include <cstdio>\n\nusing namespace std;\n\nint main() {\n int c, n, i, sum;\n\n scanf(\"%d\", &c);\n \n while (c--) {\n sum = 0;\n scanf(\"%d\", &n);\n\n for (i = 0; i < n; i++) {\n if (i % 2 == 0) sum++;\n else sum--;\n }\n \n printf(\"%d\\n\", sum);\n }\n return 0;\n}\n<commit_msg>Refatora 1866.<commit_after>#include <cstdio>\n\nusing namespace std;\n\nint main() {\n int c, n;\n\n scanf(\"%d\", &c);\n \n while (c--) {\n scanf(\"%d\", &n);\n\n if (n % 2 == 0) puts(\"0\");\n else puts(\"1\");\n }\n return 0;\n}\n<|endoftext|>"} {"text":"<commit_before>\/*\n * Distributed under the OSI-approved Apache License, Version 2.0. See\n * accompanying file Copyright.txt for details.\n *\n * BP3Writer.cpp\n *\n * Created on: Dec 19, 2016\n * Author: William F Godoy godoywf@ornl.gov\n *\/\n\n#include \"BP3Writer.h\"\n#include \"BP3Writer.tcc\"\n\n#include \"adios2\/common\/ADIOSMacros.h\"\n#include \"adios2\/core\/IO.h\"\n#include \"adios2\/helper\/adiosFunctions.h\" \/\/CheckIndexRange\n#include \"adios2\/toolkit\/profiling\/taustubs\/tautimer.hpp\"\n#include \"adios2\/toolkit\/transport\/file\/FileFStream.h\"\n\nnamespace adios2\n{\nnamespace core\n{\nnamespace engine\n{\n\nBP3Writer::BP3Writer(IO &io, const std::string &name, const Mode mode,\n helper::Comm comm)\n: Engine(\"BP3\", io, name, mode, std::move(comm)), m_BP3Serializer(m_Comm),\n m_FileDataManager(m_Comm), m_FileMetadataManager(m_Comm)\n{\n TAU_SCOPED_TIMER(\"BP3Writer::Open\");\n m_IO.m_ReadStreaming = false;\n m_EndMessage = \" in call to IO Open BPFileWriter \" + m_Name + \"\\n\";\n Init();\n}\n\nStepStatus BP3Writer::BeginStep(StepMode mode, const float timeoutSeconds)\n{\n TAU_SCOPED_TIMER(\"BP3Writer::BeginStep\");\n m_BP3Serializer.m_DeferredVariables.clear();\n m_BP3Serializer.m_DeferredVariablesDataSize = 0;\n m_IO.m_ReadStreaming = false;\n return StepStatus::OK;\n}\n\nsize_t BP3Writer::CurrentStep() const\n{\n return m_BP3Serializer.m_MetadataSet.CurrentStep;\n}\n\nvoid BP3Writer::PerformPuts()\n{\n TAU_SCOPED_TIMER(\"BP3Writer::PerformPuts\");\n if (m_BP3Serializer.m_DeferredVariables.empty())\n {\n return;\n }\n\n m_BP3Serializer.ResizeBuffer(m_BP3Serializer.m_DeferredVariablesDataSize,\n \"in call to PerformPuts\");\n\n for (const std::string &variableName : m_BP3Serializer.m_DeferredVariables)\n {\n const DataType type = m_IO.InquireVariableType(variableName);\n if (type == DataType::Compound)\n {\n \/\/ not supported\n }\n#define declare_template_instantiation(T) \\\n else if (type == helper::GetDataType<T>()) \\\n { \\\n Variable<T> &variable = FindVariable<T>( \\\n variableName, \"in call to PerformPuts, EndStep or Close\"); \\\n PerformPutCommon(variable); \\\n }\n\n ADIOS2_FOREACH_PRIMITIVE_STDTYPE_1ARG(declare_template_instantiation)\n#undef declare_template_instantiation\n }\n m_BP3Serializer.m_DeferredVariables.clear();\n m_BP3Serializer.m_DeferredVariablesDataSize = 0;\n}\n\nvoid BP3Writer::EndStep()\n{\n TAU_SCOPED_TIMER(\"BP3Writer::EndStep\");\n if (m_BP3Serializer.m_DeferredVariables.size() > 0)\n {\n PerformPuts();\n }\n\n \/\/ true: advances step\n m_BP3Serializer.SerializeData(m_IO, true);\n\n const size_t currentStep = CurrentStep();\n const size_t flushStepsCount = m_BP3Serializer.m_Parameters.FlushStepsCount;\n\n if (currentStep % flushStepsCount == 0)\n {\n Flush();\n }\n}\n\nvoid BP3Writer::Flush(const int transportIndex)\n{\n TAU_SCOPED_TIMER(\"BP3Writer::Flush\");\n DoFlush(false, transportIndex);\n m_BP3Serializer.ResetBuffer(m_BP3Serializer.m_Data);\n\n if (m_BP3Serializer.m_Parameters.CollectiveMetadata)\n {\n WriteCollectiveMetadataFile();\n }\n}\n\n\/\/ PRIVATE\nvoid BP3Writer::Init()\n{\n InitParameters();\n InitTransports();\n InitBPBuffer();\n}\n\n#define declare_type(T) \\\n void BP3Writer::DoPut(Variable<T> &variable, \\\n typename Variable<T>::Span &span, \\\n const size_t bufferID, const T &value) \\\n { \\\n TAU_SCOPED_TIMER(\"BP3Writer::Put\"); \\\n PutCommon(variable, span, bufferID, value); \\\n }\n\nADIOS2_FOREACH_PRIMITIVE_STDTYPE_1ARG(declare_type)\n#undef declare_type\n\n#define declare_type(T) \\\n void BP3Writer::DoPutSync(Variable<T> &variable, const T *data) \\\n { \\\n TAU_SCOPED_TIMER(\"BP3Writer::Put\"); \\\n PutSyncCommon(variable, variable.SetBlockInfo(data, CurrentStep())); \\\n variable.m_BlocksInfo.pop_back(); \\\n } \\\n void BP3Writer::DoPutDeferred(Variable<T> &variable, const T *data) \\\n { \\\n TAU_SCOPED_TIMER(\"BP3Writer::Put\"); \\\n PutDeferredCommon(variable, data); \\\n }\n\nADIOS2_FOREACH_STDTYPE_1ARG(declare_type)\n#undef declare_type\n\nvoid BP3Writer::InitParameters()\n{\n m_BP3Serializer.Init(m_IO.m_Parameters, \"in call to BP3::Open for writing\");\n}\n\nvoid BP3Writer::InitTransports()\n{\n \/\/ TODO need to add support for aggregators here later\n if (m_IO.m_TransportsParameters.empty())\n {\n Params defaultTransportParameters;\n defaultTransportParameters[\"transport\"] = \"File\";\n m_IO.m_TransportsParameters.push_back(defaultTransportParameters);\n }\n\n \/\/ only consumers will interact with transport managers\n std::vector<std::string> bpSubStreamNames;\n\n if (m_BP3Serializer.m_Aggregator.m_IsConsumer)\n {\n \/\/ Names passed to IO AddTransport option with key \"Name\"\n const std::vector<std::string> transportsNames =\n m_FileDataManager.GetFilesBaseNames(m_Name,\n m_IO.m_TransportsParameters);\n\n \/\/ \/path\/name.bp.dir\/name.bp.rank\n bpSubStreamNames = m_BP3Serializer.GetBPSubStreamNames(transportsNames);\n }\n\n m_BP3Serializer.m_Profiler.Start(\"mkdir\");\n m_FileDataManager.MkDirsBarrier(bpSubStreamNames,\n m_IO.m_TransportsParameters,\n m_BP3Serializer.m_Parameters.NodeLocal);\n m_BP3Serializer.m_Profiler.Stop(\"mkdir\");\n\n if (m_BP3Serializer.m_Aggregator.m_IsConsumer)\n {\n if (m_BP3Serializer.m_Parameters.AsyncTasks)\n {\n for (size_t i = 0; i < m_IO.m_TransportsParameters.size(); ++i)\n {\n m_IO.m_TransportsParameters[i][\"asynctasks\"] = \"true\";\n }\n }\n m_FileDataManager.OpenFiles(bpSubStreamNames, m_OpenMode,\n m_IO.m_TransportsParameters,\n m_BP3Serializer.m_Profiler.m_IsActive);\n }\n}\n\nvoid BP3Writer::InitBPBuffer()\n{\n if (m_OpenMode == Mode::Append)\n {\n throw std::invalid_argument(\n \"ADIOS2: Mode::Append is only available BP4; it is not implemented for BP3 files.\");\n \/\/ TODO: Get last pg timestep and update timestep counter in\n }\n else\n {\n m_BP3Serializer.PutProcessGroupIndex(\n m_IO.m_Name, m_IO.m_HostLanguage,\n m_FileDataManager.GetTransportsTypes());\n }\n}\n\nvoid BP3Writer::DoFlush(const bool isFinal, const int transportIndex)\n{\n if (m_BP3Serializer.m_Aggregator.m_IsActive)\n {\n AggregateWriteData(isFinal, transportIndex);\n }\n else\n {\n WriteData(isFinal, transportIndex);\n }\n}\n\nvoid BP3Writer::DoClose(const int transportIndex)\n{\n TAU_SCOPED_TIMER(\"BP3Writer::Close\");\n if (m_BP3Serializer.m_DeferredVariables.size() > 0)\n {\n PerformPuts();\n }\n\n DoFlush(true, transportIndex);\n\n if (m_BP3Serializer.m_Aggregator.m_IsConsumer)\n {\n m_FileDataManager.CloseFiles(transportIndex);\n }\n\n if (m_BP3Serializer.m_Parameters.CollectiveMetadata &&\n m_FileDataManager.AllTransportsClosed())\n {\n WriteCollectiveMetadataFile(true);\n }\n\n if (m_BP3Serializer.m_Profiler.m_IsActive &&\n m_FileDataManager.AllTransportsClosed())\n {\n WriteProfilingJSONFile();\n }\n\n m_BP3Serializer.DeleteBuffers();\n}\n\nvoid BP3Writer::WriteProfilingJSONFile()\n{\n TAU_SCOPED_TIMER(\"BP3Writer::WriteProfilingJSONFile\");\n auto transportTypes = m_FileDataManager.GetTransportsTypes();\n\n \/\/ find first File type output, where we can write the profile\n int fileTransportIdx = -1;\n for (size_t i = 0; i < transportTypes.size(); ++i)\n {\n if (transportTypes[i].compare(0, 4, \"File\") == 0)\n {\n fileTransportIdx = static_cast<int>(i);\n }\n }\n\n auto transportProfilers = m_FileDataManager.GetTransportsProfilers();\n\n auto transportTypesMD = m_FileMetadataManager.GetTransportsTypes();\n auto transportProfilersMD = m_FileMetadataManager.GetTransportsProfilers();\n\n transportTypes.insert(transportTypes.end(), transportTypesMD.begin(),\n transportTypesMD.end());\n\n transportProfilers.insert(transportProfilers.end(),\n transportProfilersMD.begin(),\n transportProfilersMD.end());\n\n const std::string lineJSON(m_BP3Serializer.GetRankProfilingJSON(\n transportTypes, transportProfilers) +\n \",\\n\");\n\n const std::vector<char> profilingJSON(\n m_BP3Serializer.AggregateProfilingJSON(lineJSON));\n\n if (m_BP3Serializer.m_RankMPI == 0)\n {\n transport::FileFStream profilingJSONStream(m_Comm);\n std::string profileFileName;\n if (fileTransportIdx > -1)\n {\n \/\/ write profile to <filename.bp>.dir\/profiling.json\n auto bpBaseNames = m_BP3Serializer.GetBPBaseNames({m_Name});\n profileFileName = bpBaseNames[fileTransportIdx] + \"\/profiling.json\";\n }\n else\n {\n \/\/ write profile to <filename.bp>_profiling.json\n auto transportsNames = m_FileMetadataManager.GetFilesBaseNames(\n m_Name, m_IO.m_TransportsParameters);\n\n auto bpMetadataFileNames =\n m_BP3Serializer.GetBPMetadataFileNames(transportsNames);\n profileFileName = bpMetadataFileNames[0] + \"_profiling.json\";\n }\n profilingJSONStream.Open(profileFileName, Mode::Write);\n profilingJSONStream.Write(profilingJSON.data(), profilingJSON.size());\n profilingJSONStream.Close();\n }\n}\n\nvoid BP3Writer::WriteCollectiveMetadataFile(const bool isFinal)\n{\n TAU_SCOPED_TIMER(\"BP3Writer::WriteCollectiveMetadataFile\");\n m_BP3Serializer.AggregateCollectiveMetadata(\n m_Comm, m_BP3Serializer.m_Metadata, true);\n\n if (m_BP3Serializer.m_RankMPI == 0)\n {\n \/\/ first init metadata files\n const std::vector<std::string> transportsNames =\n m_FileMetadataManager.GetFilesBaseNames(\n m_Name, m_IO.m_TransportsParameters);\n\n const std::vector<std::string> bpMetadataFileNames =\n m_BP3Serializer.GetBPMetadataFileNames(transportsNames);\n\n m_FileMetadataManager.OpenFiles(bpMetadataFileNames, m_OpenMode,\n m_IO.m_TransportsParameters,\n m_BP3Serializer.m_Profiler.m_IsActive);\n\n m_FileMetadataManager.WriteFiles(\n m_BP3Serializer.m_Metadata.m_Buffer.data(),\n m_BP3Serializer.m_Metadata.m_Position);\n m_FileMetadataManager.CloseFiles();\n\n if (!isFinal)\n {\n m_BP3Serializer.ResetBuffer(m_BP3Serializer.m_Metadata, true);\n m_FileMetadataManager.m_Transports.clear();\n }\n }\n}\n\nvoid BP3Writer::WriteData(const bool isFinal, const int transportIndex)\n{\n TAU_SCOPED_TIMER(\"BP3Writer::WriteData\");\n size_t dataSize = m_BP3Serializer.m_Data.m_Position;\n\n if (isFinal)\n {\n m_BP3Serializer.CloseData(m_IO);\n dataSize = m_BP3Serializer.m_Data.m_Position;\n }\n else\n {\n m_BP3Serializer.CloseStream(m_IO);\n }\n\n m_FileDataManager.WriteFiles(m_BP3Serializer.m_Data.m_Buffer.data(),\n dataSize, transportIndex);\n\n m_FileDataManager.FlushFiles(transportIndex);\n}\n\nvoid BP3Writer::AggregateWriteData(const bool isFinal, const int transportIndex)\n{\n TAU_SCOPED_TIMER(\"BP3Writer::AggregateWriteData\");\n m_BP3Serializer.CloseStream(m_IO, false);\n\n \/\/ async?\n for (int r = 0; r < m_BP3Serializer.m_Aggregator.m_Size; ++r)\n {\n aggregator::MPIAggregator::ExchangeRequests dataRequests =\n m_BP3Serializer.m_Aggregator.IExchange(m_BP3Serializer.m_Data, r);\n\n aggregator::MPIAggregator::ExchangeAbsolutePositionRequests\n absolutePositionRequests =\n m_BP3Serializer.m_Aggregator.IExchangeAbsolutePosition(\n m_BP3Serializer.m_Data, r);\n\n if (m_BP3Serializer.m_Aggregator.m_IsConsumer)\n {\n const format::Buffer &bufferSTL =\n m_BP3Serializer.m_Aggregator.GetConsumerBuffer(\n m_BP3Serializer.m_Data);\n\n m_FileDataManager.WriteFiles(bufferSTL.Data(), bufferSTL.m_Position,\n transportIndex);\n\n m_FileDataManager.FlushFiles(transportIndex);\n }\n\n m_BP3Serializer.m_Aggregator.WaitAbsolutePosition(\n absolutePositionRequests, r);\n\n m_BP3Serializer.m_Aggregator.Wait(dataRequests, r);\n m_BP3Serializer.m_Aggregator.SwapBuffers(r);\n }\n\n m_BP3Serializer.UpdateOffsetsInMetadata();\n\n if (isFinal) \/\/ Write metadata footer\n {\n format::BufferSTL &bufferSTL = m_BP3Serializer.m_Data;\n m_BP3Serializer.ResetBuffer(bufferSTL, false, false);\n\n m_BP3Serializer.AggregateCollectiveMetadata(\n m_BP3Serializer.m_Aggregator.m_Comm, bufferSTL, false);\n\n if (m_BP3Serializer.m_Aggregator.m_IsConsumer)\n {\n m_FileDataManager.WriteFiles(bufferSTL.m_Buffer.data(),\n bufferSTL.m_Position, transportIndex);\n\n m_FileDataManager.FlushFiles(transportIndex);\n }\n\n m_BP3Serializer.m_Aggregator.Close();\n }\n\n m_BP3Serializer.m_Aggregator.ResetBuffers();\n}\n\n#define declare_type(T, L) \\\n T *BP3Writer::DoBufferData_##L(const size_t payloadPosition, \\\n const size_t bufferID) noexcept \\\n { \\\n return BufferDataCommon<T>(payloadPosition, bufferID); \\\n }\n\nADIOS2_FOREACH_PRIMITVE_STDTYPE_2ARGS(declare_type)\n#undef declare_type\n\nsize_t BP3Writer::DebugGetDataBufferSize() const\n{\n return m_BP3Serializer.DebugGetDataBufferSize();\n}\n} \/\/ end namespace engine\n} \/\/ end namespace core\n} \/\/ end namespace adios2\n<commit_msg>Apply clang-format.<commit_after>\/*\n * Distributed under the OSI-approved Apache License, Version 2.0. See\n * accompanying file Copyright.txt for details.\n *\n * BP3Writer.cpp\n *\n * Created on: Dec 19, 2016\n * Author: William F Godoy godoywf@ornl.gov\n *\/\n\n#include \"BP3Writer.h\"\n#include \"BP3Writer.tcc\"\n\n#include \"adios2\/common\/ADIOSMacros.h\"\n#include \"adios2\/core\/IO.h\"\n#include \"adios2\/helper\/adiosFunctions.h\" \/\/CheckIndexRange\n#include \"adios2\/toolkit\/profiling\/taustubs\/tautimer.hpp\"\n#include \"adios2\/toolkit\/transport\/file\/FileFStream.h\"\n\nnamespace adios2\n{\nnamespace core\n{\nnamespace engine\n{\n\nBP3Writer::BP3Writer(IO &io, const std::string &name, const Mode mode,\n helper::Comm comm)\n: Engine(\"BP3\", io, name, mode, std::move(comm)), m_BP3Serializer(m_Comm),\n m_FileDataManager(m_Comm), m_FileMetadataManager(m_Comm)\n{\n TAU_SCOPED_TIMER(\"BP3Writer::Open\");\n m_IO.m_ReadStreaming = false;\n m_EndMessage = \" in call to IO Open BPFileWriter \" + m_Name + \"\\n\";\n Init();\n}\n\nStepStatus BP3Writer::BeginStep(StepMode mode, const float timeoutSeconds)\n{\n TAU_SCOPED_TIMER(\"BP3Writer::BeginStep\");\n m_BP3Serializer.m_DeferredVariables.clear();\n m_BP3Serializer.m_DeferredVariablesDataSize = 0;\n m_IO.m_ReadStreaming = false;\n return StepStatus::OK;\n}\n\nsize_t BP3Writer::CurrentStep() const\n{\n return m_BP3Serializer.m_MetadataSet.CurrentStep;\n}\n\nvoid BP3Writer::PerformPuts()\n{\n TAU_SCOPED_TIMER(\"BP3Writer::PerformPuts\");\n if (m_BP3Serializer.m_DeferredVariables.empty())\n {\n return;\n }\n\n m_BP3Serializer.ResizeBuffer(m_BP3Serializer.m_DeferredVariablesDataSize,\n \"in call to PerformPuts\");\n\n for (const std::string &variableName : m_BP3Serializer.m_DeferredVariables)\n {\n const DataType type = m_IO.InquireVariableType(variableName);\n if (type == DataType::Compound)\n {\n \/\/ not supported\n }\n#define declare_template_instantiation(T) \\\n else if (type == helper::GetDataType<T>()) \\\n { \\\n Variable<T> &variable = FindVariable<T>( \\\n variableName, \"in call to PerformPuts, EndStep or Close\"); \\\n PerformPutCommon(variable); \\\n }\n\n ADIOS2_FOREACH_PRIMITIVE_STDTYPE_1ARG(declare_template_instantiation)\n#undef declare_template_instantiation\n }\n m_BP3Serializer.m_DeferredVariables.clear();\n m_BP3Serializer.m_DeferredVariablesDataSize = 0;\n}\n\nvoid BP3Writer::EndStep()\n{\n TAU_SCOPED_TIMER(\"BP3Writer::EndStep\");\n if (m_BP3Serializer.m_DeferredVariables.size() > 0)\n {\n PerformPuts();\n }\n\n \/\/ true: advances step\n m_BP3Serializer.SerializeData(m_IO, true);\n\n const size_t currentStep = CurrentStep();\n const size_t flushStepsCount = m_BP3Serializer.m_Parameters.FlushStepsCount;\n\n if (currentStep % flushStepsCount == 0)\n {\n Flush();\n }\n}\n\nvoid BP3Writer::Flush(const int transportIndex)\n{\n TAU_SCOPED_TIMER(\"BP3Writer::Flush\");\n DoFlush(false, transportIndex);\n m_BP3Serializer.ResetBuffer(m_BP3Serializer.m_Data);\n\n if (m_BP3Serializer.m_Parameters.CollectiveMetadata)\n {\n WriteCollectiveMetadataFile();\n }\n}\n\n\/\/ PRIVATE\nvoid BP3Writer::Init()\n{\n InitParameters();\n InitTransports();\n InitBPBuffer();\n}\n\n#define declare_type(T) \\\n void BP3Writer::DoPut(Variable<T> &variable, \\\n typename Variable<T>::Span &span, \\\n const size_t bufferID, const T &value) \\\n { \\\n TAU_SCOPED_TIMER(\"BP3Writer::Put\"); \\\n PutCommon(variable, span, bufferID, value); \\\n }\n\nADIOS2_FOREACH_PRIMITIVE_STDTYPE_1ARG(declare_type)\n#undef declare_type\n\n#define declare_type(T) \\\n void BP3Writer::DoPutSync(Variable<T> &variable, const T *data) \\\n { \\\n TAU_SCOPED_TIMER(\"BP3Writer::Put\"); \\\n PutSyncCommon(variable, variable.SetBlockInfo(data, CurrentStep())); \\\n variable.m_BlocksInfo.pop_back(); \\\n } \\\n void BP3Writer::DoPutDeferred(Variable<T> &variable, const T *data) \\\n { \\\n TAU_SCOPED_TIMER(\"BP3Writer::Put\"); \\\n PutDeferredCommon(variable, data); \\\n }\n\nADIOS2_FOREACH_STDTYPE_1ARG(declare_type)\n#undef declare_type\n\nvoid BP3Writer::InitParameters()\n{\n m_BP3Serializer.Init(m_IO.m_Parameters, \"in call to BP3::Open for writing\");\n}\n\nvoid BP3Writer::InitTransports()\n{\n \/\/ TODO need to add support for aggregators here later\n if (m_IO.m_TransportsParameters.empty())\n {\n Params defaultTransportParameters;\n defaultTransportParameters[\"transport\"] = \"File\";\n m_IO.m_TransportsParameters.push_back(defaultTransportParameters);\n }\n\n \/\/ only consumers will interact with transport managers\n std::vector<std::string> bpSubStreamNames;\n\n if (m_BP3Serializer.m_Aggregator.m_IsConsumer)\n {\n \/\/ Names passed to IO AddTransport option with key \"Name\"\n const std::vector<std::string> transportsNames =\n m_FileDataManager.GetFilesBaseNames(m_Name,\n m_IO.m_TransportsParameters);\n\n \/\/ \/path\/name.bp.dir\/name.bp.rank\n bpSubStreamNames = m_BP3Serializer.GetBPSubStreamNames(transportsNames);\n }\n\n m_BP3Serializer.m_Profiler.Start(\"mkdir\");\n m_FileDataManager.MkDirsBarrier(bpSubStreamNames,\n m_IO.m_TransportsParameters,\n m_BP3Serializer.m_Parameters.NodeLocal);\n m_BP3Serializer.m_Profiler.Stop(\"mkdir\");\n\n if (m_BP3Serializer.m_Aggregator.m_IsConsumer)\n {\n if (m_BP3Serializer.m_Parameters.AsyncTasks)\n {\n for (size_t i = 0; i < m_IO.m_TransportsParameters.size(); ++i)\n {\n m_IO.m_TransportsParameters[i][\"asynctasks\"] = \"true\";\n }\n }\n m_FileDataManager.OpenFiles(bpSubStreamNames, m_OpenMode,\n m_IO.m_TransportsParameters,\n m_BP3Serializer.m_Profiler.m_IsActive);\n }\n}\n\nvoid BP3Writer::InitBPBuffer()\n{\n if (m_OpenMode == Mode::Append)\n {\n throw std::invalid_argument(\n \"ADIOS2: Mode::Append is only available BP4; it is not implemented \"\n \"for BP3 files.\");\n \/\/ TODO: Get last pg timestep and update timestep counter in\n }\n else\n {\n m_BP3Serializer.PutProcessGroupIndex(\n m_IO.m_Name, m_IO.m_HostLanguage,\n m_FileDataManager.GetTransportsTypes());\n }\n}\n\nvoid BP3Writer::DoFlush(const bool isFinal, const int transportIndex)\n{\n if (m_BP3Serializer.m_Aggregator.m_IsActive)\n {\n AggregateWriteData(isFinal, transportIndex);\n }\n else\n {\n WriteData(isFinal, transportIndex);\n }\n}\n\nvoid BP3Writer::DoClose(const int transportIndex)\n{\n TAU_SCOPED_TIMER(\"BP3Writer::Close\");\n if (m_BP3Serializer.m_DeferredVariables.size() > 0)\n {\n PerformPuts();\n }\n\n DoFlush(true, transportIndex);\n\n if (m_BP3Serializer.m_Aggregator.m_IsConsumer)\n {\n m_FileDataManager.CloseFiles(transportIndex);\n }\n\n if (m_BP3Serializer.m_Parameters.CollectiveMetadata &&\n m_FileDataManager.AllTransportsClosed())\n {\n WriteCollectiveMetadataFile(true);\n }\n\n if (m_BP3Serializer.m_Profiler.m_IsActive &&\n m_FileDataManager.AllTransportsClosed())\n {\n WriteProfilingJSONFile();\n }\n\n m_BP3Serializer.DeleteBuffers();\n}\n\nvoid BP3Writer::WriteProfilingJSONFile()\n{\n TAU_SCOPED_TIMER(\"BP3Writer::WriteProfilingJSONFile\");\n auto transportTypes = m_FileDataManager.GetTransportsTypes();\n\n \/\/ find first File type output, where we can write the profile\n int fileTransportIdx = -1;\n for (size_t i = 0; i < transportTypes.size(); ++i)\n {\n if (transportTypes[i].compare(0, 4, \"File\") == 0)\n {\n fileTransportIdx = static_cast<int>(i);\n }\n }\n\n auto transportProfilers = m_FileDataManager.GetTransportsProfilers();\n\n auto transportTypesMD = m_FileMetadataManager.GetTransportsTypes();\n auto transportProfilersMD = m_FileMetadataManager.GetTransportsProfilers();\n\n transportTypes.insert(transportTypes.end(), transportTypesMD.begin(),\n transportTypesMD.end());\n\n transportProfilers.insert(transportProfilers.end(),\n transportProfilersMD.begin(),\n transportProfilersMD.end());\n\n const std::string lineJSON(m_BP3Serializer.GetRankProfilingJSON(\n transportTypes, transportProfilers) +\n \",\\n\");\n\n const std::vector<char> profilingJSON(\n m_BP3Serializer.AggregateProfilingJSON(lineJSON));\n\n if (m_BP3Serializer.m_RankMPI == 0)\n {\n transport::FileFStream profilingJSONStream(m_Comm);\n std::string profileFileName;\n if (fileTransportIdx > -1)\n {\n \/\/ write profile to <filename.bp>.dir\/profiling.json\n auto bpBaseNames = m_BP3Serializer.GetBPBaseNames({m_Name});\n profileFileName = bpBaseNames[fileTransportIdx] + \"\/profiling.json\";\n }\n else\n {\n \/\/ write profile to <filename.bp>_profiling.json\n auto transportsNames = m_FileMetadataManager.GetFilesBaseNames(\n m_Name, m_IO.m_TransportsParameters);\n\n auto bpMetadataFileNames =\n m_BP3Serializer.GetBPMetadataFileNames(transportsNames);\n profileFileName = bpMetadataFileNames[0] + \"_profiling.json\";\n }\n profilingJSONStream.Open(profileFileName, Mode::Write);\n profilingJSONStream.Write(profilingJSON.data(), profilingJSON.size());\n profilingJSONStream.Close();\n }\n}\n\nvoid BP3Writer::WriteCollectiveMetadataFile(const bool isFinal)\n{\n TAU_SCOPED_TIMER(\"BP3Writer::WriteCollectiveMetadataFile\");\n m_BP3Serializer.AggregateCollectiveMetadata(\n m_Comm, m_BP3Serializer.m_Metadata, true);\n\n if (m_BP3Serializer.m_RankMPI == 0)\n {\n \/\/ first init metadata files\n const std::vector<std::string> transportsNames =\n m_FileMetadataManager.GetFilesBaseNames(\n m_Name, m_IO.m_TransportsParameters);\n\n const std::vector<std::string> bpMetadataFileNames =\n m_BP3Serializer.GetBPMetadataFileNames(transportsNames);\n\n m_FileMetadataManager.OpenFiles(bpMetadataFileNames, m_OpenMode,\n m_IO.m_TransportsParameters,\n m_BP3Serializer.m_Profiler.m_IsActive);\n\n m_FileMetadataManager.WriteFiles(\n m_BP3Serializer.m_Metadata.m_Buffer.data(),\n m_BP3Serializer.m_Metadata.m_Position);\n m_FileMetadataManager.CloseFiles();\n\n if (!isFinal)\n {\n m_BP3Serializer.ResetBuffer(m_BP3Serializer.m_Metadata, true);\n m_FileMetadataManager.m_Transports.clear();\n }\n }\n}\n\nvoid BP3Writer::WriteData(const bool isFinal, const int transportIndex)\n{\n TAU_SCOPED_TIMER(\"BP3Writer::WriteData\");\n size_t dataSize = m_BP3Serializer.m_Data.m_Position;\n\n if (isFinal)\n {\n m_BP3Serializer.CloseData(m_IO);\n dataSize = m_BP3Serializer.m_Data.m_Position;\n }\n else\n {\n m_BP3Serializer.CloseStream(m_IO);\n }\n\n m_FileDataManager.WriteFiles(m_BP3Serializer.m_Data.m_Buffer.data(),\n dataSize, transportIndex);\n\n m_FileDataManager.FlushFiles(transportIndex);\n}\n\nvoid BP3Writer::AggregateWriteData(const bool isFinal, const int transportIndex)\n{\n TAU_SCOPED_TIMER(\"BP3Writer::AggregateWriteData\");\n m_BP3Serializer.CloseStream(m_IO, false);\n\n \/\/ async?\n for (int r = 0; r < m_BP3Serializer.m_Aggregator.m_Size; ++r)\n {\n aggregator::MPIAggregator::ExchangeRequests dataRequests =\n m_BP3Serializer.m_Aggregator.IExchange(m_BP3Serializer.m_Data, r);\n\n aggregator::MPIAggregator::ExchangeAbsolutePositionRequests\n absolutePositionRequests =\n m_BP3Serializer.m_Aggregator.IExchangeAbsolutePosition(\n m_BP3Serializer.m_Data, r);\n\n if (m_BP3Serializer.m_Aggregator.m_IsConsumer)\n {\n const format::Buffer &bufferSTL =\n m_BP3Serializer.m_Aggregator.GetConsumerBuffer(\n m_BP3Serializer.m_Data);\n\n m_FileDataManager.WriteFiles(bufferSTL.Data(), bufferSTL.m_Position,\n transportIndex);\n\n m_FileDataManager.FlushFiles(transportIndex);\n }\n\n m_BP3Serializer.m_Aggregator.WaitAbsolutePosition(\n absolutePositionRequests, r);\n\n m_BP3Serializer.m_Aggregator.Wait(dataRequests, r);\n m_BP3Serializer.m_Aggregator.SwapBuffers(r);\n }\n\n m_BP3Serializer.UpdateOffsetsInMetadata();\n\n if (isFinal) \/\/ Write metadata footer\n {\n format::BufferSTL &bufferSTL = m_BP3Serializer.m_Data;\n m_BP3Serializer.ResetBuffer(bufferSTL, false, false);\n\n m_BP3Serializer.AggregateCollectiveMetadata(\n m_BP3Serializer.m_Aggregator.m_Comm, bufferSTL, false);\n\n if (m_BP3Serializer.m_Aggregator.m_IsConsumer)\n {\n m_FileDataManager.WriteFiles(bufferSTL.m_Buffer.data(),\n bufferSTL.m_Position, transportIndex);\n\n m_FileDataManager.FlushFiles(transportIndex);\n }\n\n m_BP3Serializer.m_Aggregator.Close();\n }\n\n m_BP3Serializer.m_Aggregator.ResetBuffers();\n}\n\n#define declare_type(T, L) \\\n T *BP3Writer::DoBufferData_##L(const size_t payloadPosition, \\\n const size_t bufferID) noexcept \\\n { \\\n return BufferDataCommon<T>(payloadPosition, bufferID); \\\n }\n\nADIOS2_FOREACH_PRIMITVE_STDTYPE_2ARGS(declare_type)\n#undef declare_type\n\nsize_t BP3Writer::DebugGetDataBufferSize() const\n{\n return m_BP3Serializer.DebugGetDataBufferSize();\n}\n} \/\/ end namespace engine\n} \/\/ end namespace core\n} \/\/ end namespace adios2\n<|endoftext|>"} {"text":"<commit_before>\/*! @file wavelet_filter_bank.cc\n * @brief Wavelet filter bank tree (mid level).\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\/primitives\/wavelet_filter_bank.h\"\n#include <cassert>\n#include <string.h>\n#include <algorithm>\n#include <list>\n#include <memory>\n#include <string>\n#pragma GCC diagnostic push\n#pragma GCC diagnostic ignored \"-Wold-style-cast\"\n#include <boost\/regex.hpp> \/\/ NOLINT(build\/include_order)\n#pragma GCC diagnostic pop\n#include <simd\/wavelet.h>\n\nnamespace SoundFeatureExtraction {\nnamespace Primitives {\n\nconst std::unordered_map<std::string, WaveletType>\n WaveletFilterBank::kWaveletTypeStrMap = {\n { \"daub\", WAVELET_TYPE_DAUBECHIES },\n { \"coif\", WAVELET_TYPE_COIFLET },\n { \"sym\", WAVELET_TYPE_SYMLET }\n};\n\nWaveletFilterBank::WaveletFilterBank(WaveletType type, int order,\n const std::vector<int>& treeDescription)\n : type_(type),\n order_(order),\n tree_(treeDescription) {\n\n ValidateDescription(treeDescription);\n}\n\nWaveletFilterBank::WaveletFilterBank(WaveletType type, int order,\n std::vector<int>&& treeDescription)\n : type_(type),\n order_(order),\n tree_(treeDescription) {\n ValidateDescription(treeDescription);\n}\n\nvoid WaveletFilterBank::ValidateOrder(WaveletType type,\n int order) {\n if (!wavelet_validate_order(type, order)) {\n throw WaveletTreeInvalidOrderException(type, order);\n }\n}\n\nstd::string WaveletFilterBank::WaveletTypeToString(WaveletType type) noexcept {\n for (auto wtstrp : kWaveletTypeStrMap) {\n if (wtstrp.second == type) {\n return wtstrp.first;\n }\n }\n return \"\";\n}\n\nWaveletType WaveletFilterBank::ParseWaveletType(const std::string& value) {\n auto it = kWaveletTypeStrMap.find(value);\n if (it == kWaveletTypeStrMap.end()) {\n throw WaveletTreeWaveletTypeParseException(value);\n }\n return it->second;\n}\n\nvoid WaveletFilterBank::ValidateDescription(\n const std::vector<int>& treeDescription) {\n if (treeDescription.size() < 2) {\n throw WaveletTreeInvalidDescriptionException(treeDescription);\n }\n std::list<int> tree(treeDescription.begin(), treeDescription.end());\n while (!tree.empty()) {\n \/\/ Reduce the tree using a simple grammar:\n \/\/ (n) (n) -> (n - 1)\n bool reduced = false;\n for (auto it = tree.begin(); it != tree.end(); it++) {\n auto next = it;\n next++;\n if (next != tree.end() && *it == *next) {\n if (*it == 1 && tree.size() == 2) {\n tree.erase(it, tree.end());\n } else {\n *it = *it - 1;\n tree.erase(next);\n }\n reduced = true;\n break;\n }\n }\n if (!reduced) {\n throw WaveletTreeInvalidDescriptionException(treeDescription);\n }\n }\n}\n\nstd::vector<int> WaveletFilterBank::ParseDescription(const std::string& str) {\n static const boost::regex allRegex(\"^\\\\s*(\\\\d+\\\\s*(\\\\s|$))+\");\n static const boost::regex intRegex(\"(\\\\d+\\\\s*(\\\\s|$))\");\n static const boost::sregex_token_iterator empty;\n\n boost::smatch match;\n if (!boost::regex_match(str, match, allRegex)) {\n throw WaveletTreeDescriptionParseException(str);\n }\n boost::sregex_token_iterator intIterator(\n str.begin(), str.end(), intRegex, 1);\n\n std::vector<int> res;\n while (intIterator != empty) {\n std::string intstr = *intIterator++;\n int val;\n try {\n val = std::stoi(intstr);\n }\n catch(const std::invalid_argument& e) {\n throw WaveletTreeDescriptionParseException(str);\n }\n res.push_back(val);\n }\n if (res.empty()) {\n throw WaveletTreeDescriptionParseException(str);\n }\n ValidateDescription(res);\n return res;\n}\n\nstd::string WaveletFilterBank::DescriptionToString(\n const std::vector<int>& treeDescription) noexcept {\n std::string str;\n for (int i : treeDescription) {\n str += std::to_string(i) + \" \";\n }\n if (str != \"\") {\n str.resize(str.size() - 1);\n }\n return str;\n}\n\nvoid WaveletFilterBank::ValidateLength(\n const std::vector<int>& tree, size_t length) {\n int max = *std::max_element(tree.begin(), tree.end());\n \/\/ length \/ 2^max >= 1\n if (length == 0 || length % (1 << max) != 0) {\n throw WaveletTreeInvalidSourceLengthException(tree, length);\n }\n}\n\nvoid WaveletFilterBank::Apply(const float* source, size_t length,\n float *result) noexcept {\n assert(source && result);\n ValidateLength(tree_, length);\n\n \/\/ Support zero-copy\n auto lsrc =\n#ifndef __AVX__\n (source == result)? result :\n#endif\n wavelet_prepare_array(order_, source, length);\n ApplyInternal(lsrc, length, result);\n#ifndef __AVX__\n if (source != result) {\n#endif\n free(lsrc);\n#ifndef __AVX__\n }\n#endif\n}\n\nvoid WaveletFilterBank::ApplyInternal(float* source, size_t length,\n float *result) noexcept {\n assert(source && result);\n ValidateLength(tree_, length);\n\n std::vector<int> tree(tree_);\n std::reverse(tree.begin(), tree.end());\n std::vector<int> workingTree;\n workingTree.reserve(tree.size());\n\n auto ldesthi = std::unique_ptr<float, void(*)(void*)>(\n wavelet_allocate_destination(order_, length), free);\n auto ldestlo = std::unique_ptr<float, void(*)(void*)>(\n wavelet_allocate_destination(order_, length), free);\n wavelet_apply(type_, order_, source, length,\n ldesthi.get(), ldestlo.get());\n float *desthihi, *desthilo, *destlohi, *destlolo;\n wavelet_recycle_source(order_, source, length,\n &desthihi, &desthilo,\n &destlohi, &destlolo);\n workingTree.push_back(1);\n workingTree.push_back(1);\n\n while (!tree.empty()) {\n RecursivelyIterate(type_, order_, length \/ 2, &tree, &workingTree,\n ldesthi.get(), desthihi, desthilo, &result);\n RecursivelyIterate(type_, order_, length \/ 2, &tree, &workingTree,\n ldestlo.get(), destlohi, destlolo, &result);\n }\n}\n\nvoid WaveletFilterBank::RecursivelyIterate(\n WaveletType type, int order, size_t length,\n std::vector<int> *tree, std::vector<int>* workingTree, float* source,\n float* desthi, float* destlo, float** result) noexcept {\n if (tree->back() != workingTree->back()) {\n wavelet_apply(type, order, source, length, desthi, destlo);\n float *desthihi, *desthilo, *destlohi, *destlolo;\n wavelet_recycle_source(order, source, length,\n &desthihi, &desthilo,\n &destlohi, &destlolo);\n int next = workingTree->back() + 1;\n workingTree->pop_back();\n workingTree->push_back(next);\n workingTree->push_back(next);\n RecursivelyIterate(type, order, length \/ 2, tree, workingTree,\n desthi, desthihi, desthilo, result);\n RecursivelyIterate(type, order, length \/ 2, tree, workingTree,\n destlo, destlohi, destlolo, result);\n } else {\n memcpy(*result, source, length * sizeof(source[0]));\n *result += length;\n tree->pop_back();\n workingTree->pop_back();\n }\n}\n\n} \/\/ namespace Primitives\n} \/\/ namespace SoundFeatureExtraction\n<commit_msg>Updated WaveletFilterBank to set signal extension type<commit_after>\/*! @file wavelet_filter_bank.cc\n * @brief Wavelet filter bank tree (mid level).\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\/primitives\/wavelet_filter_bank.h\"\n#include <cassert>\n#include <string.h>\n#include <algorithm>\n#include <list>\n#include <memory>\n#include <string>\n#pragma GCC diagnostic push\n#pragma GCC diagnostic ignored \"-Wold-style-cast\"\n#include <boost\/regex.hpp> \/\/ NOLINT(build\/include_order)\n#pragma GCC diagnostic pop\n#include <simd\/wavelet.h>\n\nnamespace SoundFeatureExtraction {\nnamespace Primitives {\n\nconst std::unordered_map<std::string, WaveletType>\n WaveletFilterBank::kWaveletTypeStrMap = {\n { \"daub\", WAVELET_TYPE_DAUBECHIES },\n { \"coif\", WAVELET_TYPE_COIFLET },\n { \"sym\", WAVELET_TYPE_SYMLET }\n};\n\nWaveletFilterBank::WaveletFilterBank(WaveletType type, int order,\n const std::vector<int>& treeDescription)\n : type_(type),\n order_(order),\n tree_(treeDescription) {\n\n ValidateDescription(treeDescription);\n}\n\nWaveletFilterBank::WaveletFilterBank(WaveletType type, int order,\n std::vector<int>&& treeDescription)\n : type_(type),\n order_(order),\n tree_(treeDescription) {\n ValidateDescription(treeDescription);\n}\n\nvoid WaveletFilterBank::ValidateOrder(WaveletType type,\n int order) {\n if (!wavelet_validate_order(type, order)) {\n throw WaveletTreeInvalidOrderException(type, order);\n }\n}\n\nstd::string WaveletFilterBank::WaveletTypeToString(WaveletType type) noexcept {\n for (auto wtstrp : kWaveletTypeStrMap) {\n if (wtstrp.second == type) {\n return wtstrp.first;\n }\n }\n return \"\";\n}\n\nWaveletType WaveletFilterBank::ParseWaveletType(const std::string& value) {\n auto it = kWaveletTypeStrMap.find(value);\n if (it == kWaveletTypeStrMap.end()) {\n throw WaveletTreeWaveletTypeParseException(value);\n }\n return it->second;\n}\n\nvoid WaveletFilterBank::ValidateDescription(\n const std::vector<int>& treeDescription) {\n if (treeDescription.size() < 2) {\n throw WaveletTreeInvalidDescriptionException(treeDescription);\n }\n std::list<int> tree(treeDescription.begin(), treeDescription.end());\n while (!tree.empty()) {\n \/\/ Reduce the tree using a simple grammar:\n \/\/ (n) (n) -> (n - 1)\n bool reduced = false;\n for (auto it = tree.begin(); it != tree.end(); it++) {\n auto next = it;\n next++;\n if (next != tree.end() && *it == *next) {\n if (*it == 1 && tree.size() == 2) {\n tree.erase(it, tree.end());\n } else {\n *it = *it - 1;\n tree.erase(next);\n }\n reduced = true;\n break;\n }\n }\n if (!reduced) {\n throw WaveletTreeInvalidDescriptionException(treeDescription);\n }\n }\n}\n\nstd::vector<int> WaveletFilterBank::ParseDescription(const std::string& str) {\n static const boost::regex allRegex(\"^\\\\s*(\\\\d+\\\\s*(\\\\s|$))+\");\n static const boost::regex intRegex(\"(\\\\d+\\\\s*(\\\\s|$))\");\n static const boost::sregex_token_iterator empty;\n\n boost::smatch match;\n if (!boost::regex_match(str, match, allRegex)) {\n throw WaveletTreeDescriptionParseException(str);\n }\n boost::sregex_token_iterator intIterator(\n str.begin(), str.end(), intRegex, 1);\n\n std::vector<int> res;\n while (intIterator != empty) {\n std::string intstr = *intIterator++;\n int val;\n try {\n val = std::stoi(intstr);\n }\n catch(const std::invalid_argument& e) {\n throw WaveletTreeDescriptionParseException(str);\n }\n res.push_back(val);\n }\n if (res.empty()) {\n throw WaveletTreeDescriptionParseException(str);\n }\n ValidateDescription(res);\n return res;\n}\n\nstd::string WaveletFilterBank::DescriptionToString(\n const std::vector<int>& treeDescription) noexcept {\n std::string str;\n for (int i : treeDescription) {\n str += std::to_string(i) + \" \";\n }\n if (str != \"\") {\n str.resize(str.size() - 1);\n }\n return str;\n}\n\nvoid WaveletFilterBank::ValidateLength(\n const std::vector<int>& tree, size_t length) {\n int max = *std::max_element(tree.begin(), tree.end());\n \/\/ length \/ 2^max >= 1\n if (length == 0 || length % (1 << max) != 0) {\n throw WaveletTreeInvalidSourceLengthException(tree, length);\n }\n}\n\nvoid WaveletFilterBank::Apply(const float* source, size_t length,\n float *result) noexcept {\n assert(source && result);\n ValidateLength(tree_, length);\n\n \/\/ Support zero-copy\n auto lsrc =\n#ifndef __AVX__\n (source == result)? result :\n#endif\n wavelet_prepare_array(order_, source, length);\n ApplyInternal(lsrc, length, result);\n#ifndef __AVX__\n if (source != result) {\n#endif\n free(lsrc);\n#ifndef __AVX__\n }\n#endif\n}\n\nvoid WaveletFilterBank::ApplyInternal(float* source, size_t length,\n float *result) noexcept {\n assert(source && result);\n ValidateLength(tree_, length);\n\n std::vector<int> tree(tree_);\n std::reverse(tree.begin(), tree.end());\n std::vector<int> workingTree;\n workingTree.reserve(tree.size());\n\n auto ldesthi = std::unique_ptr<float, void(*)(void*)>(\n wavelet_allocate_destination(order_, length), free);\n auto ldestlo = std::unique_ptr<float, void(*)(void*)>(\n wavelet_allocate_destination(order_, length), free);\n wavelet_apply(type_, order_, EXTENSION_TYPE_PERIODIC, source, length,\n ldesthi.get(), ldestlo.get());\n float *desthihi, *desthilo, *destlohi, *destlolo;\n wavelet_recycle_source(order_, source, length,\n &desthihi, &desthilo,\n &destlohi, &destlolo);\n workingTree.push_back(1);\n workingTree.push_back(1);\n\n while (!tree.empty()) {\n RecursivelyIterate(type_, order_, length \/ 2, &tree, &workingTree,\n ldesthi.get(), desthihi, desthilo, &result);\n RecursivelyIterate(type_, order_, length \/ 2, &tree, &workingTree,\n ldestlo.get(), destlohi, destlolo, &result);\n }\n}\n\nvoid WaveletFilterBank::RecursivelyIterate(\n WaveletType type, int order, size_t length,\n std::vector<int> *tree, std::vector<int>* workingTree, float* source,\n float* desthi, float* destlo, float** result) noexcept {\n if (tree->back() != workingTree->back()) {\n wavelet_apply(type, order, EXTENSION_TYPE_PERIODIC, source, length, desthi, destlo);\n float *desthihi, *desthilo, *destlohi, *destlolo;\n wavelet_recycle_source(order, source, length,\n &desthihi, &desthilo,\n &destlohi, &destlolo);\n int next = workingTree->back() + 1;\n workingTree->pop_back();\n workingTree->push_back(next);\n workingTree->push_back(next);\n RecursivelyIterate(type, order, length \/ 2, tree, workingTree,\n desthi, desthihi, desthilo, result);\n RecursivelyIterate(type, order, length \/ 2, tree, workingTree,\n destlo, destlohi, destlolo, result);\n } else {\n memcpy(*result, source, length * sizeof(source[0]));\n *result += length;\n tree->pop_back();\n workingTree->pop_back();\n }\n}\n\n} \/\/ namespace Primitives\n} \/\/ namespace SoundFeatureExtraction\n<|endoftext|>"} {"text":"<commit_before>#include <Poco\/JSON\/Parser.h>\n#include <Poco\/JSON\/Object.h>\n#include <Poco\/Logger.h>\n#include <Poco\/Net\/NetException.h>\n#include <Poco\/Net\/HTMLForm.h>\n#include <Poco\/Net\/HTTPRequest.h>\n#include <Poco\/Net\/HTTPSClientSession.h>\n#include <Poco\/URI.h>\n\n#include \"di\/Injectable.h\"\n#include \"ssl\/SSLClient.h\"\n#include \"provider\/FacebookAuthProvider.h\"\n#include \"util\/JsonUtil.h\"\n#include \"util\/Sanitize.h\"\n\nBEEEON_OBJECT_BEGIN(BeeeOn, FacebookAuthProvider)\nBEEEON_OBJECT_CASTABLE(AuthProvider)\nBEEEON_OBJECT_CASTABLE(OAuth2AuthProvider)\nBEEEON_OBJECT_REF(\"sslConfig\", &FacebookAuthProvider::setSSLConfig)\nBEEEON_OBJECT_TEXT(\"clientId\", &FacebookAuthProvider::setClientId)\nBEEEON_OBJECT_TEXT(\"clientSecret\", &FacebookAuthProvider::setClientSecret)\nBEEEON_OBJECT_TEXT(\"redirectUri\", &FacebookAuthProvider::setRedirectURI)\nBEEEON_OBJECT_TEXT(\"id\", &FacebookAuthProvider::setID)\nBEEEON_OBJECT_END(BeeeOn, FacebookAuthProvider)\n\nusing namespace BeeeOn;\nusing namespace Poco;\nusing namespace Poco::JSON;\nusing namespace Poco::Net;\nusing namespace std;\n\nbool FacebookAuthProvider::verifyAuthCode(\n\t\tconst AuthCodeCredentials &credentials,\n\t\tAuthResult &info)\n{\n\tstring accessToken;\n\n\ttry {\n\t\taccessToken = requestAccessToken(credentials.authCode());\n\t} catch (const Exception &e) {\n\t\tlogger().log(e, __FILE__, __LINE__);\n\t\treturn false;\n\t}\n\n\treturn processAccessToken(accessToken, info);\n}\n\nbool FacebookAuthProvider::verifyAuthCode(\n\t\tconst AccessTokenCredentials &credentials,\n\t\tAuthResult &info)\n{\n\treturn processAccessToken(credentials.accessToken(), info);\n}\n\nstring FacebookAuthProvider::requestAccessToken(const string &authCode) const\n{\n\tHTMLForm form;\n\tform.setEncoding(HTMLForm::ENCODING_URL);\n\tform.set(\"client_id\", m_clientId);\n\tform.set(\"redirect_uri\", m_redirectURI);\n\tform.set(\"client_secret\", m_clientSecret);\n\tform.set(\"code\", authCode);\n\n\tURI host(m_requestTokenUrl);\n\tstring response = makeRequest(HTTPRequest::HTTP_POST, host, form);\n\tObject::Ptr data = JsonUtil::parse(response);\n\n\tif (data->has(\"error\")) {\n\t\tstring message = data->getObject(\"error\")->getValue<string>(\"message\");\n\t\tthrow NotAuthenticatedException(message);\n\t}\n\n\tstring accessToken = data->optValue<string>(\"access_token\", \"\");\n\tstring type = data->optValue<string>(\"token_type\", \"\");\n\tunsigned int expires = data->optValue<unsigned int>(\"expires_in\", 0);\n\n\tif (accessToken.empty())\n\t\tthrow NotAuthenticatedException(\"missing access_token\");\n\tif (type != \"bearer\")\n\t\tthrow NotAuthenticatedException(\"incompatible token type: \" + type);\n\tif (expires == 0)\n\t\tthrow NotAuthenticatedException(\"token has expired\");\n\n\treturn accessToken;\n}\n\nbool FacebookAuthProvider::processAccessToken(const string &accessToken, AuthResult &info) const\n{\n\tstring userData;\n\n\ttry {\n\t\tverifyAccessToken(accessToken);\n\t\tuserData = fetchUserData(accessToken);\n\t} catch (const Exception &e) {\n\t\tlogger().log(e, __FILE__, __LINE__);\n\t\treturn false;\n\t}\n\n\treturn parseIdentity(userData, accessToken, info);\n}\n\nvoid FacebookAuthProvider::verifyAccessToken(const string& accessToken) const\n{\n\tHTMLForm form;\n\tform.setEncoding(HTMLForm::ENCODING_URL);\n\tform.set(\"input_token\", accessToken);\n\tform.set(\"access_token\", m_clientId + \"|\" + m_clientSecret);\n\n\tURI host(m_inspectTokenUrl);\n\tstring response = makeRequest(HTTPRequest::HTTP_GET, host, form);\n\tObject::Ptr data = JsonUtil::parse(response)->getObject(\"data\");\n\n\tif (data->has(\"error\")) {\n\t\tstring message = data->getObject(\"error\")->getValue<string>(\"message\");\n\t\tthrow NotAuthenticatedException(message);\n\t}\n\n\tstring appId = data->getValue<string>(\"app_id\");\n\n\tif (appId != m_clientId)\n\t\tthrow NotAuthenticatedException(\"Unexpected app_id: \" + appId);\n\n}\n\nstring FacebookAuthProvider::fetchUserData(const string &accessToken) const\n{\n\tHTMLForm form;\n\tform.setEncoding(HTMLForm::ENCODING_URL);\n\tform.set(\"access_token\", accessToken);\n\tform.set(\"fields\", \"name,picture,email,first_name,last_name,locale\");\n\n\tURI host(m_userInfoUrl);\n\tstring response = makeRequest(HTTPRequest::HTTP_POST, host, form);\n\tObject::Ptr data = JsonUtil::parse(response);\n\n\tif (data->has(\"error\"))\t{\n\t\tstring message = data->getObject(\"error\")->getValue<string>(\"message\");\n\t\tthrow NotAuthenticatedException(message);\n\t}\n\n\treturn response;\n}\n\nbool FacebookAuthProvider::parseIdentity(const string &userInfo, const string &accessToken, AuthResult &result) const\n{\n\tObject::Ptr info = JsonUtil::parse(userInfo);\n\n\tif (info->has(\"id\"))\n\t\tresult.setProviderID(info->getValue<string>(\"id\"));\n\n\tif (info->has(\"email\"))\n\t\tresult.setEmail(Sanitize::email(info->getValue<string>(\"email\")));\n\n\tif (info->has(\"first_name\"))\n\t\tresult.setFirstName(Sanitize::common(info->getValue<string>(\"first_name\")));\n\n\tif (info->has(\"last_name\"))\n\t\tresult.setLastName(Sanitize::common(info->getValue<string>(\"last_name\")));\n\n\tif (info->has(\"locale\"))\n\t\tresult.setLocale(info->getValue<string>(\"locale\"));\n\n\tif (info->has(\"picture\")) {\n\t\tObject::Ptr pictData = info->getObject(\"picture\");\n\t\tif (pictData->has(\"data\")) {\n\t\t\tObject::Ptr picture = pictData->getObject(\"data\");\n\t\t\tif (picture->has(\"url\"))\n\t\t\t\tresult.setPicture(Sanitize::uri(picture->getValue<string>(\"url\")));\n\t\t}\n\t}\n\n\tresult.setAccessToken(accessToken);\n\n\tif (result.email().empty())\n\t\tthrow NotAuthenticatedException(\"missing email\");\n\n\tif (result.providerID().empty())\n\t\tthrow NotAuthenticatedException(\"missing user_id\");\n\n\treturn true;\n\n}\n<commit_msg>FacebookAuthProvider: sanitize locale<commit_after>#include <Poco\/JSON\/Parser.h>\n#include <Poco\/JSON\/Object.h>\n#include <Poco\/Logger.h>\n#include <Poco\/Net\/NetException.h>\n#include <Poco\/Net\/HTMLForm.h>\n#include <Poco\/Net\/HTTPRequest.h>\n#include <Poco\/Net\/HTTPSClientSession.h>\n#include <Poco\/URI.h>\n\n#include \"di\/Injectable.h\"\n#include \"ssl\/SSLClient.h\"\n#include \"provider\/FacebookAuthProvider.h\"\n#include \"util\/JsonUtil.h\"\n#include \"util\/Sanitize.h\"\n\nBEEEON_OBJECT_BEGIN(BeeeOn, FacebookAuthProvider)\nBEEEON_OBJECT_CASTABLE(AuthProvider)\nBEEEON_OBJECT_CASTABLE(OAuth2AuthProvider)\nBEEEON_OBJECT_REF(\"sslConfig\", &FacebookAuthProvider::setSSLConfig)\nBEEEON_OBJECT_TEXT(\"clientId\", &FacebookAuthProvider::setClientId)\nBEEEON_OBJECT_TEXT(\"clientSecret\", &FacebookAuthProvider::setClientSecret)\nBEEEON_OBJECT_TEXT(\"redirectUri\", &FacebookAuthProvider::setRedirectURI)\nBEEEON_OBJECT_TEXT(\"id\", &FacebookAuthProvider::setID)\nBEEEON_OBJECT_END(BeeeOn, FacebookAuthProvider)\n\nusing namespace BeeeOn;\nusing namespace Poco;\nusing namespace Poco::JSON;\nusing namespace Poco::Net;\nusing namespace std;\n\nbool FacebookAuthProvider::verifyAuthCode(\n\t\tconst AuthCodeCredentials &credentials,\n\t\tAuthResult &info)\n{\n\tstring accessToken;\n\n\ttry {\n\t\taccessToken = requestAccessToken(credentials.authCode());\n\t} catch (const Exception &e) {\n\t\tlogger().log(e, __FILE__, __LINE__);\n\t\treturn false;\n\t}\n\n\treturn processAccessToken(accessToken, info);\n}\n\nbool FacebookAuthProvider::verifyAuthCode(\n\t\tconst AccessTokenCredentials &credentials,\n\t\tAuthResult &info)\n{\n\treturn processAccessToken(credentials.accessToken(), info);\n}\n\nstring FacebookAuthProvider::requestAccessToken(const string &authCode) const\n{\n\tHTMLForm form;\n\tform.setEncoding(HTMLForm::ENCODING_URL);\n\tform.set(\"client_id\", m_clientId);\n\tform.set(\"redirect_uri\", m_redirectURI);\n\tform.set(\"client_secret\", m_clientSecret);\n\tform.set(\"code\", authCode);\n\n\tURI host(m_requestTokenUrl);\n\tstring response = makeRequest(HTTPRequest::HTTP_POST, host, form);\n\tObject::Ptr data = JsonUtil::parse(response);\n\n\tif (data->has(\"error\")) {\n\t\tstring message = data->getObject(\"error\")->getValue<string>(\"message\");\n\t\tthrow NotAuthenticatedException(message);\n\t}\n\n\tstring accessToken = data->optValue<string>(\"access_token\", \"\");\n\tstring type = data->optValue<string>(\"token_type\", \"\");\n\tunsigned int expires = data->optValue<unsigned int>(\"expires_in\", 0);\n\n\tif (accessToken.empty())\n\t\tthrow NotAuthenticatedException(\"missing access_token\");\n\tif (type != \"bearer\")\n\t\tthrow NotAuthenticatedException(\"incompatible token type: \" + type);\n\tif (expires == 0)\n\t\tthrow NotAuthenticatedException(\"token has expired\");\n\n\treturn accessToken;\n}\n\nbool FacebookAuthProvider::processAccessToken(const string &accessToken, AuthResult &info) const\n{\n\tstring userData;\n\n\ttry {\n\t\tverifyAccessToken(accessToken);\n\t\tuserData = fetchUserData(accessToken);\n\t} catch (const Exception &e) {\n\t\tlogger().log(e, __FILE__, __LINE__);\n\t\treturn false;\n\t}\n\n\treturn parseIdentity(userData, accessToken, info);\n}\n\nvoid FacebookAuthProvider::verifyAccessToken(const string& accessToken) const\n{\n\tHTMLForm form;\n\tform.setEncoding(HTMLForm::ENCODING_URL);\n\tform.set(\"input_token\", accessToken);\n\tform.set(\"access_token\", m_clientId + \"|\" + m_clientSecret);\n\n\tURI host(m_inspectTokenUrl);\n\tstring response = makeRequest(HTTPRequest::HTTP_GET, host, form);\n\tObject::Ptr data = JsonUtil::parse(response)->getObject(\"data\");\n\n\tif (data->has(\"error\")) {\n\t\tstring message = data->getObject(\"error\")->getValue<string>(\"message\");\n\t\tthrow NotAuthenticatedException(message);\n\t}\n\n\tstring appId = data->getValue<string>(\"app_id\");\n\n\tif (appId != m_clientId)\n\t\tthrow NotAuthenticatedException(\"Unexpected app_id: \" + appId);\n\n}\n\nstring FacebookAuthProvider::fetchUserData(const string &accessToken) const\n{\n\tHTMLForm form;\n\tform.setEncoding(HTMLForm::ENCODING_URL);\n\tform.set(\"access_token\", accessToken);\n\tform.set(\"fields\", \"name,picture,email,first_name,last_name,locale\");\n\n\tURI host(m_userInfoUrl);\n\tstring response = makeRequest(HTTPRequest::HTTP_POST, host, form);\n\tObject::Ptr data = JsonUtil::parse(response);\n\n\tif (data->has(\"error\"))\t{\n\t\tstring message = data->getObject(\"error\")->getValue<string>(\"message\");\n\t\tthrow NotAuthenticatedException(message);\n\t}\n\n\treturn response;\n}\n\nbool FacebookAuthProvider::parseIdentity(const string &userInfo, const string &accessToken, AuthResult &result) const\n{\n\tObject::Ptr info = JsonUtil::parse(userInfo);\n\n\tif (info->has(\"id\"))\n\t\tresult.setProviderID(info->getValue<string>(\"id\"));\n\n\tif (info->has(\"email\"))\n\t\tresult.setEmail(Sanitize::email(info->getValue<string>(\"email\")));\n\n\tif (info->has(\"first_name\"))\n\t\tresult.setFirstName(Sanitize::common(info->getValue<string>(\"first_name\")));\n\n\tif (info->has(\"last_name\"))\n\t\tresult.setLastName(Sanitize::common(info->getValue<string>(\"last_name\")));\n\n\tif (info->has(\"locale\"))\n\t\tresult.setLocale(Sanitize::locale(info->getValue<string>(\"locale\")));\n\n\tif (info->has(\"picture\")) {\n\t\tObject::Ptr pictData = info->getObject(\"picture\");\n\t\tif (pictData->has(\"data\")) {\n\t\t\tObject::Ptr picture = pictData->getObject(\"data\");\n\t\t\tif (picture->has(\"url\"))\n\t\t\t\tresult.setPicture(Sanitize::uri(picture->getValue<string>(\"url\")));\n\t\t}\n\t}\n\n\tresult.setAccessToken(accessToken);\n\n\tif (result.email().empty())\n\t\tthrow NotAuthenticatedException(\"missing email\");\n\n\tif (result.providerID().empty())\n\t\tthrow NotAuthenticatedException(\"missing user_id\");\n\n\treturn true;\n\n}\n<|endoftext|>"} {"text":"<commit_before>#include <algorithm>\n#include <cassert>\n#include <cmath>\n\n#include \"hlstrafe.hpp\"\n#include \"util.hpp\"\n\nnamespace HLStrafe\n{\n\tdouble MaxAccelTheta(const PlayerData& player, const MovementVars& vars, PositionType postype, double wishspeed)\n\t{\n\t\tassert(postype != PositionType::WATER);\n\n\t\tbool onground = (postype == PositionType::GROUND);\n\t\tdouble accel = onground ? vars.Accelerate : vars.Airaccelerate;\n\t\tdouble accelspeed = accel * wishspeed * vars.EntFriction * vars.Frametime;\n\t\tif (accelspeed <= 0.0)\n\t\t\treturn M_PI;\n\n\t\tdouble wishspeed_capped = onground ? wishspeed : 30;\n\t\tdouble tmp = wishspeed_capped - accelspeed;\n\t\tif (tmp <= 0.0)\n\t\t\treturn M_PI \/ 2;\n\n\t\tdouble speed = Length<float, 2>(player.Velocity);\n\t\tif (tmp < speed)\n\t\t\treturn std::acos(tmp \/ speed);\n\n\t\treturn 0.0;\n\t}\n\n\tdouble MaxAngleTheta(const PlayerData& player, const MovementVars& vars, PositionType postype, double wishspeed)\n\t{\n\t\tassert(postype != PositionType::WATER);\n\n\t\tbool onground = (postype == PositionType::GROUND);\n\t\tdouble wishspeed_capped = onground ? wishspeed : 30;\n\t\tdouble speed = Length<float, 2>(player.Velocity);\n\t\tdouble accel = onground ? vars.Accelerate : vars.Airaccelerate;\n\t\tdouble accelspeed = accel * wishspeed * vars.EntFriction * vars.Frametime;\n\t\tif (accelspeed <= 0.0) {\n\t\t\taccelspeed *= -1;\n\t\t\tif (accelspeed >= speed) {\n\t\t\t\tif (wishspeed_capped >= speed)\n\t\t\t\t\treturn 0.0;\n\t\t\t\telse\n\t\t\t\t\treturn std::acos(wishspeed_capped \/ speed); \/\/ The actual angle needs to be _less_ than this.\n\t\t\t} else {\n\t\t\t\tif (wishspeed_capped >= speed)\n\t\t\t\t\treturn std::acos(accelspeed \/ speed);\n\t\t\t\telse\n\t\t\t\t\treturn std::acos(std::max(accelspeed, wishspeed_capped) \/ speed); \/\/ The actual angle needs to be _less_ than this if wishspeed_capped >= accelspeed.\n\t\t\t}\n\t\t} else {\n\t\t\tdouble tmp = wishspeed_capped - accelspeed;\n\t\t}\n\t}\n\n\tvoid VectorFME(PlayerData& player, const MovementVars& vars, PositionType postype, const double a[2], double wishspeed)\n\t{\n\t\tassert(postype != PositionType::WATER);\n\n\t\tbool onground = (postype == PositionType::GROUND);\n\t\tdouble wishspeed_capped = onground ? wishspeed : 30;\n\t\tdouble tmp = wishspeed_capped - DotProduct<float, double, 2>(player.Velocity, a);\n\t\tif (tmp <= 0.0)\n\t\t\treturn;\n\n\t\tdouble accel = onground ? vars.Accelerate : vars.Airaccelerate;\n\t\tdouble accelspeed = accel * wishspeed * vars.EntFriction * vars.Frametime;\n\t\tif (accelspeed <= tmp)\n\t\t\ttmp = accelspeed;\n\n\t\tplayer.Velocity[0] += a[0] * tmp;\n\t\tplayer.Velocity[1] += a[1] * tmp;\n\t}\n}\n<commit_msg>MaxAngleTheta, probably can be simplified.<commit_after>#include <algorithm>\n#include <cassert>\n#include <cmath>\n\n#include \"hlstrafe.hpp\"\n#include \"util.hpp\"\n\nnamespace HLStrafe\n{\n\tdouble MaxAccelTheta(const PlayerData& player, const MovementVars& vars, PositionType postype, double wishspeed)\n\t{\n\t\tassert(postype != PositionType::WATER);\n\n\t\tbool onground = (postype == PositionType::GROUND);\n\t\tdouble accel = onground ? vars.Accelerate : vars.Airaccelerate;\n\t\tdouble accelspeed = accel * wishspeed * vars.EntFriction * vars.Frametime;\n\t\tif (accelspeed <= 0.0)\n\t\t\treturn M_PI;\n\n\t\tdouble wishspeed_capped = onground ? wishspeed : 30;\n\t\tdouble tmp = wishspeed_capped - accelspeed;\n\t\tif (tmp <= 0.0)\n\t\t\treturn M_PI \/ 2;\n\n\t\tdouble speed = Length<float, 2>(player.Velocity);\n\t\tif (tmp < speed)\n\t\t\treturn std::acos(tmp \/ speed);\n\n\t\treturn 0.0;\n\t}\n\n\tdouble MaxAngleTheta(const PlayerData& player, const MovementVars& vars, PositionType postype, double wishspeed)\n\t{\n\t\tassert(postype != PositionType::WATER);\n\n\t\tbool onground = (postype == PositionType::GROUND);\n\t\tdouble speed = Length<float, 2>(player.Velocity);\n\t\tdouble accel = onground ? vars.Accelerate : vars.Airaccelerate;\n\t\tdouble accelspeed = accel * wishspeed * vars.EntFriction * vars.Frametime;\n\t\tif (accelspeed <= 0.0) {\n\t\t\tdouble wishspeed_capped = onground ? wishspeed : 30;\n\t\t\taccelspeed *= -1;\n\t\t\tif (accelspeed >= speed) {\n\t\t\t\taccelspeed = 0;\n\t\t\t}\n\t\t\tif (wishspeed_capped >= speed)\n\t\t\t\treturn std::acos(accelspeed \/ speed);\n\t\t\telse\n\t\t\t\treturn std::acos(std::max(accelspeed, wishspeed_capped) \/ speed); \/\/ The actual angle needs to be _less_ than this if wishspeed_capped >= accelspeed.\n\t\t} else {\n\t\t\tif (accelspeed >= speed) {\n\t\t\t\treturn M_PI;\n\t\t\t} else {\n\t\t\t\treturn std::acos(-1 * accelspeed \/ speed);\n\t\t\t}\n\t\t}\n\t}\n\n\tvoid VectorFME(PlayerData& player, const MovementVars& vars, PositionType postype, const double a[2], double wishspeed)\n\t{\n\t\tassert(postype != PositionType::WATER);\n\n\t\tbool onground = (postype == PositionType::GROUND);\n\t\tdouble wishspeed_capped = onground ? wishspeed : 30;\n\t\tdouble tmp = wishspeed_capped - DotProduct<float, double, 2>(player.Velocity, a);\n\t\tif (tmp <= 0.0)\n\t\t\treturn;\n\n\t\tdouble accel = onground ? vars.Accelerate : vars.Airaccelerate;\n\t\tdouble accelspeed = accel * wishspeed * vars.EntFriction * vars.Frametime;\n\t\tif (accelspeed <= tmp)\n\t\t\ttmp = accelspeed;\n\n\t\tplayer.Velocity[0] += a[0] * tmp;\n\t\tplayer.Velocity[1] += a[1] * tmp;\n\t}\n}\n<|endoftext|>"} {"text":"<commit_before>\/*****************************************************************************\n * *\n * Copyright (c) 2016 Boris Pek <tehnick-8@yandex.ru> *\n * *\n * Permission is hereby granted, free of charge, to any person obtaining *\n * a copy of this software and associated documentation files (the *\n * \"Software\"), to deal in the Software without restriction, including *\n * without limitation the rights to use, copy, modify, merge, publish, *\n * distribute, sublicense, and\/or sell copies of the Software, and to *\n * permit persons to whom the Software is furnished to do so, subject to *\n * the following conditions: *\n * *\n * The above copyright notice and this permission notice shall be included *\n * in all copies or substantial portions of the Software. *\n * *\n * THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, *\n * EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF *\n * MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. *\n * IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY *\n * CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, *\n * TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE *\n * SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE. *\n * *\n *****************************************************************************\/\n\n#include <QStringList>\n\n#include \"applicationsettings.h\"\n#include \"resourcemanager.h\"\n#include \"sessionsmanager.h\"\n#include \"localization.h\"\n#include \"htmlpage.h\"\n\nstruct HtmlPage::HtmlPagePrivate\n{\n bool admin = false;\n bool autorized = false;\n\n QByteArray page;\n QByteArray head;\n QByteArray body;\n QByteArray title;\n QByteArray content;\n QByteArray redirect;\n QByteArray prefix;\n\n CommonSettings commonSettings;\n UserSettings userSettings;\n Localization localization;\n};\n\nHtmlPage::HtmlPage(const Request &request) :\n d(new HtmlPagePrivate)\n{\n d->prefix = ApplicationSettings::instance().prefixString().toUtf8();\n d->redirect = request.scriptName().toUtf8();\n\n if (request.get(\"ajax\").isEmpty()) {\n const ResourceManager res;\n setPage(res.read(\"\/html\/page-template.html\"));\n setTitle(\"%basic_title%\");\n setHead(res.read(\"\/html\/head-template.html\"));\n setBody(res.read(\"\/html\/body-template.html\"));\n setContent(res.read(\"\/html\/404-template.html\"));\n }\n\n checkAutorization(request);\n\n if (request.get(\"ajax\").isEmpty()) {\n d->localization.setFileName(d->commonSettings.l10nFile());\n d->localization.readSettings();\n\n setContentType(\"text\/html\");\n update();\n }\n}\n\nHtmlPage::~HtmlPage()\n{\n delete d;\n}\n\nvoid HtmlPage::setHead(const QByteArray &head)\n{\n d->head = head;\n}\n\nvoid HtmlPage::setBody(const QByteArray &body)\n{\n d->body = body;\n}\n\nvoid HtmlPage::setTitle(const QByteArray &title)\n{\n d->title = title;\n}\n\nvoid HtmlPage::setContent(const QByteArray &content)\n{\n d->content = content;\n}\n\nvoid HtmlPage::addToHead(const QByteArray &head)\n{\n setHead(d->head + \"\\n\" + head);\n}\n\nvoid HtmlPage::addToBody(const QByteArray &body)\n{\n setBody(d->body + \"\\n\" + body);\n}\n\nvoid HtmlPage::addToTitle(const QByteArray &title)\n{\n setTitle(d->title + title);\n}\n\nvoid HtmlPage::addToContent(const QByteArray &content)\n{\n setContent(d->content + \"\\n\" + content);\n}\n\nbool HtmlPage::isAutorizedUser() const\n{\n return d->autorized;\n}\n\nbool HtmlPage::isAdmin() const\n{\n return d->admin;\n}\n\nvoid HtmlPage::setPage(const QByteArray &page)\n{\n d->page = page;\n}\n\nvoid HtmlPage::checkAutorization(const Request &request)\n{\n QByteArray out;\n out += \" <script>\\n\";\n\n SessionsManager sm(request);\n if (sm.isAutorized()) {\n d->autorized = true;\n d->userSettings.setFileName(\"users\/\" + sm.get(\"user_name\") + \".json\");\n d->userSettings.readSettings();\n }\n else if (d->userSettings.isValidAutorizationRequest(request)) {\n d->autorized = true;\n sm.setFileName(d->userSettings.get(\"user_id\") + \".json\");\n if (sm.beginNewSession(d->userSettings.get(\"user_name\"))) {\n const bool httpsOnly = d->commonSettings.getBool(\"https_only\");\n setCookie(\"user_id\", d->userSettings.get(\"user_id\"),\n \"\", \"\/\", \"\", httpsOnly, httpsOnly);\n setCookie(\"session_id\", sm.get(\"session_id\"),\n \"\", \"\/\", \"\", httpsOnly, httpsOnly);\n }\n }\n else {\n if (request.isPost()) {\n if (!request.post().isEmpty()) {\n if (!request.post(\"user_name\").isEmpty() &&\n !request.post(\"password\").isEmpty()) {\n out += \" show_auth_error();\\n\";\n }\n }\n }\n }\n if (d->autorized) {\n out += \" authorized_user();\\n\";\n d->admin = d->userSettings.getBool(\"admin\");\n if (!d->admin) {\n out += \" not_admin();\\n\";\n }\n if (d->userSettings.get(\"user_email\").isEmpty()) {\n out += \" email_is_unknown();\\n\";\n }\n }\n else {\n out += \" unauthorized_user();\\n\";\n }\n\n out += \" <\/script>\";\n addToBody(out);\n}\n\nvoid HtmlPage::forceAuthorization()\n{\n if (!d->autorized) {\n addToBody(\" <script>begin_authorization()<\/script>\");\n }\n}\n\nvoid HtmlPage::forbidAccess()\n{\n const ResourceManager res;\n setContent(res.read(\"\/html\/403-template.html\"));\n}\n\nvoid HtmlPage::update()\n{\n QByteArray out = d->page;\n\n out.replace(\"%head%\", d->head);\n out.replace(\"%body%\", d->body);\n out.replace(\"%title%\", d->title);\n out.replace(\"%content%\", d->content);\n out.replace(\"%page_style%\", d->userSettings.get(\"page_style\").toUtf8());\n out.replace(\"%user_email%\", d->userSettings.get(\"user_email\").toUtf8());\n out.replace(\"%gravatar_icon_url%\", d->userSettings.gravatarIconUrl());\n if (!d->autorized) {\n const ResourceManager res;\n out.replace(\"%auth_form%\", res.read(\"\/html\/auth-template.html\"));\n }\n else {\n out.replace(\"%auth_form%\", \"\");\n }\n const QStringList names = {\n d->userSettings.get(\"desirable_user_name\"),\n d->userSettings.get(\"full_user_name\"),\n d->userSettings.get(\"user_name\")\n };\n for (const QString &name : names) {\n if (!name.isEmpty()) {\n out.replace(\"%user_name%\", name.toUtf8());\n }\n }\n for (const auto &key : d->localization.keys()) {\n out.replace(\"%\" + key.toUtf8() + \"%\",\n d->localization.get(key).toUtf8());\n }\n out.replace(\"%redirect%\", d->redirect);\n out.replace(\"%prefix%\", d->prefix);\n\n setData(out);\n}\n\nCommonSettings& HtmlPage::commonSettings()\n{\n return d->commonSettings;\n}\n\nUserSettings &HtmlPage::userSettings()\n{\n return d->userSettings;\n}\n\nQString HtmlPage::get(const QString &key) const\n{\n return d->commonSettings.get(key);\n}\n\nbool HtmlPage::getBool(const QString &key) const\n{\n return d->commonSettings.getBool(key);\n}\n\n<commit_msg>HtmlPage: cookies should be sent in ajax requests<commit_after>\/*****************************************************************************\n * *\n * Copyright (c) 2016 Boris Pek <tehnick-8@yandex.ru> *\n * *\n * Permission is hereby granted, free of charge, to any person obtaining *\n * a copy of this software and associated documentation files (the *\n * \"Software\"), to deal in the Software without restriction, including *\n * without limitation the rights to use, copy, modify, merge, publish, *\n * distribute, sublicense, and\/or sell copies of the Software, and to *\n * permit persons to whom the Software is furnished to do so, subject to *\n * the following conditions: *\n * *\n * The above copyright notice and this permission notice shall be included *\n * in all copies or substantial portions of the Software. *\n * *\n * THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, *\n * EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF *\n * MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. *\n * IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY *\n * CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, *\n * TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE *\n * SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE. *\n * *\n *****************************************************************************\/\n\n#include <QStringList>\n\n#include \"applicationsettings.h\"\n#include \"resourcemanager.h\"\n#include \"sessionsmanager.h\"\n#include \"localization.h\"\n#include \"htmlpage.h\"\n\nstruct HtmlPage::HtmlPagePrivate\n{\n bool admin = false;\n bool autorized = false;\n\n QByteArray page;\n QByteArray head;\n QByteArray body;\n QByteArray title;\n QByteArray content;\n QByteArray redirect;\n QByteArray prefix;\n\n CommonSettings commonSettings;\n UserSettings userSettings;\n Localization localization;\n};\n\nHtmlPage::HtmlPage(const Request &request) :\n d(new HtmlPagePrivate)\n{\n d->prefix = ApplicationSettings::instance().prefixString().toUtf8();\n d->redirect = request.scriptName().toUtf8();\n\n if (request.get(\"ajax\").isEmpty()) {\n const ResourceManager res;\n setPage(res.read(\"\/html\/page-template.html\"));\n setTitle(\"%basic_title%\");\n setHead(res.read(\"\/html\/head-template.html\"));\n setBody(res.read(\"\/html\/body-template.html\"));\n setContent(res.read(\"\/html\/404-template.html\"));\n }\n\n checkAutorization(request);\n\n if (request.get(\"ajax\").isEmpty()) {\n d->localization.setFileName(d->commonSettings.l10nFile());\n d->localization.readSettings();\n\n setContentType(\"text\/html\");\n update();\n }\n}\n\nHtmlPage::~HtmlPage()\n{\n delete d;\n}\n\nvoid HtmlPage::setHead(const QByteArray &head)\n{\n d->head = head;\n}\n\nvoid HtmlPage::setBody(const QByteArray &body)\n{\n d->body = body;\n}\n\nvoid HtmlPage::setTitle(const QByteArray &title)\n{\n d->title = title;\n}\n\nvoid HtmlPage::setContent(const QByteArray &content)\n{\n d->content = content;\n}\n\nvoid HtmlPage::addToHead(const QByteArray &head)\n{\n setHead(d->head + \"\\n\" + head);\n}\n\nvoid HtmlPage::addToBody(const QByteArray &body)\n{\n setBody(d->body + \"\\n\" + body);\n}\n\nvoid HtmlPage::addToTitle(const QByteArray &title)\n{\n setTitle(d->title + title);\n}\n\nvoid HtmlPage::addToContent(const QByteArray &content)\n{\n setContent(d->content + \"\\n\" + content);\n}\n\nbool HtmlPage::isAutorizedUser() const\n{\n return d->autorized;\n}\n\nbool HtmlPage::isAdmin() const\n{\n return d->admin;\n}\n\nvoid HtmlPage::setPage(const QByteArray &page)\n{\n d->page = page;\n}\n\nvoid HtmlPage::checkAutorization(const Request &request)\n{\n QByteArray out;\n out += \" <script>\\n\";\n\n SessionsManager sm(request);\n if (sm.isAutorized()) {\n d->autorized = true;\n d->userSettings.setFileName(\"users\/\" + sm.get(\"user_name\") + \".json\");\n d->userSettings.readSettings();\n }\n else if (d->userSettings.isValidAutorizationRequest(request)) {\n d->autorized = true;\n sm.setFileName(d->userSettings.get(\"user_id\") + \".json\");\n if (sm.beginNewSession(d->userSettings.get(\"user_name\"))) {\n const bool httpsOnly = d->commonSettings.getBool(\"https_only\");\n setCookie(\"user_id\", d->userSettings.get(\"user_id\"),\n \"\", \"\/\", \"\", httpsOnly, false);\n setCookie(\"session_id\", sm.get(\"session_id\"),\n \"\", \"\/\", \"\", httpsOnly, false);\n }\n }\n else {\n if (request.isPost()) {\n if (!request.post().isEmpty()) {\n if (!request.post(\"user_name\").isEmpty() &&\n !request.post(\"password\").isEmpty()) {\n out += \" show_auth_error();\\n\";\n }\n }\n }\n }\n if (d->autorized) {\n out += \" authorized_user();\\n\";\n d->admin = d->userSettings.getBool(\"admin\");\n if (!d->admin) {\n out += \" not_admin();\\n\";\n }\n if (d->userSettings.get(\"user_email\").isEmpty()) {\n out += \" email_is_unknown();\\n\";\n }\n }\n else {\n out += \" unauthorized_user();\\n\";\n }\n\n out += \" <\/script>\";\n addToBody(out);\n}\n\nvoid HtmlPage::forceAuthorization()\n{\n if (!d->autorized) {\n addToBody(\" <script>begin_authorization()<\/script>\");\n }\n}\n\nvoid HtmlPage::forbidAccess()\n{\n const ResourceManager res;\n setContent(res.read(\"\/html\/403-template.html\"));\n}\n\nvoid HtmlPage::update()\n{\n QByteArray out = d->page;\n\n out.replace(\"%head%\", d->head);\n out.replace(\"%body%\", d->body);\n out.replace(\"%title%\", d->title);\n out.replace(\"%content%\", d->content);\n out.replace(\"%page_style%\", d->userSettings.get(\"page_style\").toUtf8());\n out.replace(\"%user_email%\", d->userSettings.get(\"user_email\").toUtf8());\n out.replace(\"%gravatar_icon_url%\", d->userSettings.gravatarIconUrl());\n if (!d->autorized) {\n const ResourceManager res;\n out.replace(\"%auth_form%\", res.read(\"\/html\/auth-template.html\"));\n }\n else {\n out.replace(\"%auth_form%\", \"\");\n }\n const QStringList names = {\n d->userSettings.get(\"desirable_user_name\"),\n d->userSettings.get(\"full_user_name\"),\n d->userSettings.get(\"user_name\")\n };\n for (const QString &name : names) {\n if (!name.isEmpty()) {\n out.replace(\"%user_name%\", name.toUtf8());\n }\n }\n for (const auto &key : d->localization.keys()) {\n out.replace(\"%\" + key.toUtf8() + \"%\",\n d->localization.get(key).toUtf8());\n }\n out.replace(\"%redirect%\", d->redirect);\n out.replace(\"%prefix%\", d->prefix);\n\n setData(out);\n}\n\nCommonSettings& HtmlPage::commonSettings()\n{\n return d->commonSettings;\n}\n\nUserSettings &HtmlPage::userSettings()\n{\n return d->userSettings;\n}\n\nQString HtmlPage::get(const QString &key) const\n{\n return d->commonSettings.get(key);\n}\n\nbool HtmlPage::getBool(const QString &key) const\n{\n return d->commonSettings.getBool(key);\n}\n\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\/browser\/ui\/certificate_trust.h\"\n\n#include <wincrypt.h>\n#include <windows.h>\n\n#include \"base\/callback.h\"\n#include \"net\/cert\/cert_database.h\"\n\nnamespace certificate_trust {\n\nvoid ShowCertificateTrust(atom::NativeWindow* parent_window,\n const scoped_refptr<net::X509Certificate>& cert,\n const std::string& message,\n const ShowTrustCallback& callback) {\n \/\/ opening the Trusted Root Certificate store for the current user\n auto hCertStore = CertOpenStore(\n CERT_STORE_PROV_SYSTEM,\n 0,\n NULL,\n CERT_SYSTEM_STORE_CURRENT_USER,\n \/\/ installing into Trusted Root Certificate Authorities, not Personal\n L\"Root\");\n\n if (hCertStore == NULL) {\n callback.Run();\n return;\n }\n\n auto pCertContext = cert->CreateOSCertChainForCert();\n\n \/\/ This is a blocking call which displays a prompt to the user to confirm\n \/\/ they trust this certificate\n auto result = CertAddCertificateContextToStore(\n hCertStore,\n pCertContext,\n CERT_STORE_ADD_REPLACE_EXISTING,\n NULL);\n\n if (result) {\n auto cert_db = net::CertDatabase::GetInstance();\n \/\/ Force Chromium to reload the certificate since it might be trusted\n \/\/ now.\n cert_db->NotifyObserversCertDBChanged(cert.get());\n }\n\n CertCloseStore(hCertStore, CERT_CLOSE_STORE_FORCE_FLAG);\n\n CertFreeCertificateContext(pCertContext);\n\n callback.Run();\n}\n\n} \/\/ namespace certificate_trust\n<commit_msg>actually validate the chain before adding<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\/browser\/ui\/certificate_trust.h\"\n\n#include <wincrypt.h>\n#include <windows.h>\n\n#include \"base\/callback.h\"\n#include \"net\/cert\/cert_database.h\"\n\nnamespace certificate_trust {\n\nBOOL AddCertificateAndRefresh(\n const HCERTSTORE certStore,\n const PCCERT_CONTEXT certContext,\n const scoped_refptr<net::X509Certificate>& cert) {\n auto result = CertAddCertificateContextToStore(\n certStore,\n certContext,\n CERT_STORE_ADD_REPLACE_EXISTING,\n NULL);\n\n if (result) {\n auto cert_db = net::CertDatabase::GetInstance();\n \/\/ Force Chromium to reload the certificate since it might be trusted\n \/\/ now.\n cert_db->NotifyObserversCertDBChanged(cert.get());\n }\n\n return result;\n}\n\n\n\/\/ Add the provided certificate to the Trusted Root\n\/\/ Certificate Authorities store for the current user.\n\/\/\n\/\/ This requires prompting the user to confirm they\n\/\/ trust the certificate.\nBOOL AddToTrustedRootStore(const PCCERT_CONTEXT certContext,\n const scoped_refptr<net::X509Certificate>& cert) {\n auto rootCertStore = CertOpenStore(\n CERT_STORE_PROV_SYSTEM,\n 0,\n NULL,\n CERT_SYSTEM_STORE_CURRENT_USER,\n L\"Root\");\n\n if (rootCertStore == NULL) {\n \/\/ could not resolve the certificate store, giving up\n return false;\n }\n\n auto result = AddCertificateAndRefresh(rootCertStore, certContext, cert);\n\n CertCloseStore(rootCertStore, CERT_CLOSE_STORE_FORCE_FLAG);\n\n return result;\n}\n\n\/\/ Add the provided certificate to the Personal\n\/\/ certificate store for the current user.\nBOOL AddToPersonalStore(const PCCERT_CONTEXT certContext,\n const scoped_refptr<net::X509Certificate>& cert) {\n auto userCertStore = CertOpenStore(\n CERT_STORE_PROV_SYSTEM,\n 0,\n NULL,\n CERT_SYSTEM_STORE_CURRENT_USER,\n L\"My\");\n\n if (userCertStore == NULL) {\n \/\/ could not resolve the certificate store, giving up\n return false;\n }\n\n auto result = AddCertificateAndRefresh(userCertStore, certContext, cert);\n\n CertCloseStore(userCertStore, CERT_CLOSE_STORE_FORCE_FLAG);\n\n return result;\n}\n\nCERT_CHAIN_PARA GetCertificateChainParameters() {\n CERT_ENHKEY_USAGE enhkeyUsage;\n enhkeyUsage.cUsageIdentifier = 0;\n enhkeyUsage.rgpszUsageIdentifier = NULL;\n\n CERT_USAGE_MATCH CertUsage;\n \/\/ ensure the rules are applied to the entire chain\n CertUsage.dwType = USAGE_MATCH_TYPE_AND;\n CertUsage.Usage = enhkeyUsage;\n\n CERT_CHAIN_PARA params = { sizeof(CERT_CHAIN_PARA) };\n params.RequestedUsage = CertUsage;\n\n return params;\n}\n\nvoid ShowCertificateTrust(atom::NativeWindow* parent_window,\n const scoped_refptr<net::X509Certificate>& cert,\n const std::string& message,\n const ShowTrustCallback& callback) {\n PCCERT_CHAIN_CONTEXT chainContext;\n\n auto pCertContext = cert->CreateOSCertChainForCert();\n\n auto params = GetCertificateChainParameters();\n\n if (CertGetCertificateChain(NULL,\n pCertContext,\n NULL,\n NULL,\n ¶ms,\n NULL,\n NULL,\n &chainContext)) {\n switch (chainContext->TrustStatus.dwErrorStatus) {\n case CERT_TRUST_NO_ERROR:\n AddToPersonalStore(pCertContext, cert);\n break;\n\n case CERT_TRUST_IS_UNTRUSTED_ROOT:\n case CERT_TRUST_IS_SELF_SIGNED:\n AddToTrustedRootStore(pCertContext, cert);\n break;\n\n default:\n \/\/ we can't handle other scenarios, giving up\n break;\n }\n\n CertFreeCertificateChain(chainContext);\n }\n\n CertFreeCertificateContext(pCertContext);\n\n callback.Run();\n}\n\n} \/\/ namespace certificate_trust\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 <QCoreApplication>\n#include <QTextCodec>\n#include <MLocale>\n#include <unicode\/uversion.h>\n\n#include \"pt_mcalendar.h\"\n\nvoid Pt_MCalendar::initTestCase()\n{\n static int argc = 0;\n static char *argv[1] = { (char *) \"\" };\n qap = new QCoreApplication(argc, argv);\n QTextCodec::setCodecForCStrings(QTextCodec::codecForName(\"UTF-8\"));\n QProcess process;\n process.start(\"sh -c \\\"dpkg -s libicu44 | grep Version | perl -pe 's\/^Version:[[:space:]]*([^[[:space:]]+)$\/$1\/g'\\\"\");\n if (!process.waitForFinished()) {\n qDebug() << \"cannot run process to check libicu44 package version , exiting ...\";\n exit(1);\n }\n icuPackageVersion = process.readAllStandardOutput();\n icuPackageVersion.replace(\"\\n\", \"\");\n qDebug() << \"libicu44 package version is:\" << icuPackageVersion;\n}\n\nvoid Pt_MCalendar::cleanupTestCase()\n{\n delete qap;\n}\n\nvoid Pt_MCalendar::init()\n{\n}\n\nvoid Pt_MCalendar::cleanup()\n{\n}\n\nvoid Pt_MCalendar::benchmarkFormatDateTimePosixFormatString_U_QDateTime()\n{\n QString language(\"en_US\"); \/\/ will be overridden\n QString lcMessages(\"en_US\"); \/\/ should not matter\n QString lcTime(\"ar_SA\"); \/\/ this overrides language\n QString lcNumeric(\"ar_SA\"); \/\/ does matter, overrides localized numbers in dates\n MLocale locale(language);\n locale.setCategoryLocale(MLocale::MLcMessages, lcMessages);\n locale.setCategoryLocale(MLocale::MLcTime, lcTime);\n locale.setCategoryLocale(MLocale::MLcNumeric, lcNumeric);\n locale.setCalendarType(MLocale::GregorianCalendar);\n MCalendar mcal(locale);\n int year = 2008;\n int month = 7;\n int day = 21;\n int hour = 14;\n int minute = 31;\n int second = 3;\n mcal.setDate(year, month, day);\n mcal.setTime(hour, minute, second);\n QDate date(year, month, day);\n QTime time(hour, minute, second);\n QDateTime datetime(date, time, Qt::LocalTime);\n QLocale qlocale(language);\n QString format(\"%U\");\n QString result(\"٢٩\");\n QCOMPARE(locale.formatDateTime(mcal, format), result);\n QCOMPARE(locale.formatDateTime(datetime, format), result);\n\n QBENCHMARK {\n locale.formatDateTime(datetime, format);\n }\n}\n\nvoid Pt_MCalendar::benchmarkFormatDateTimePosixFormatString_U_MCalendar()\n{\n QString language(\"en_US\"); \/\/ will be overridden\n QString lcMessages(\"en_US\"); \/\/ should not matter\n QString lcTime(\"ar_SA\"); \/\/ this overrides language\n QString lcNumeric(\"ar_SA\"); \/\/ does matter, overrides localized numbers in dates\n MLocale locale(language);\n locale.setCategoryLocale(MLocale::MLcMessages, lcMessages);\n locale.setCategoryLocale(MLocale::MLcTime, lcTime);\n locale.setCategoryLocale(MLocale::MLcNumeric, lcNumeric);\n locale.setCalendarType(MLocale::GregorianCalendar);\n MCalendar mcal(locale);\n int year = 2008;\n int month = 7;\n int day = 21;\n int hour = 14;\n int minute = 31;\n int second = 3;\n mcal.setDate(year, month, day);\n mcal.setTime(hour, minute, second);\n QDate date(year, month, day);\n QTime time(hour, minute, second);\n QDateTime datetime(date, time, Qt::LocalTime);\n QLocale qlocale(language);\n QString format(\"%U\");\n QString result(\"٢٩\");\n QCOMPARE(locale.formatDateTime(mcal, format), result);\n QCOMPARE(locale.formatDateTime(datetime, format), result);\n\n QBENCHMARK {\n locale.formatDateTime(mcal, format);\n }\n}\n\nvoid Pt_MCalendar::benchmarkFormatDateTimePosixFormatString_V_MCalendar()\n{\n QString language(\"en_US\"); \/\/ will be overridden\n QString lcMessages(\"en_US\"); \/\/ should not matter\n QString lcTime(\"ar_SA\"); \/\/ this overrides language\n QString lcNumeric(\"ar_SA\"); \/\/ does matter, overrides localized numbers in dates\n MLocale locale(language);\n locale.setCategoryLocale(MLocale::MLcMessages, lcMessages);\n locale.setCategoryLocale(MLocale::MLcTime, lcTime);\n locale.setCategoryLocale(MLocale::MLcNumeric, lcNumeric);\n locale.setCalendarType(MLocale::GregorianCalendar);\n MCalendar mcal(locale);\n int year = 2008;\n int month = 7;\n int day = 21;\n int hour = 14;\n int minute = 31;\n int second = 3;\n mcal.setDate(year, month, day);\n mcal.setTime(hour, minute, second);\n QDate date(year, month, day);\n QTime time(hour, minute, second);\n QDateTime datetime(date, time, Qt::LocalTime);\n QLocale qlocale(language);\n QString format(\"%V\");\n QString result(\"٣٠\");\n QCOMPARE(locale.formatDateTime(mcal, format), result);\n QCOMPARE(locale.formatDateTime(datetime, format), result);\n\n QBENCHMARK {\n locale.formatDateTime(mcal, format);\n }\n}\n\nvoid Pt_MCalendar::benchmarkFormatDateTimePosixFormatString_r_MCalendar()\n{\n QString language(\"en_US\"); \/\/ will be overridden\n QString lcMessages(\"en_US\"); \/\/ should not matter\n QString lcTime(\"ar_SA\"); \/\/ this overrides language\n QString lcNumeric(\"ar_SA\"); \/\/ does matter, overrides localized numbers in dates\n MLocale locale(language);\n locale.setCategoryLocale(MLocale::MLcMessages, lcMessages);\n locale.setCategoryLocale(MLocale::MLcTime, lcTime);\n locale.setCategoryLocale(MLocale::MLcNumeric, lcNumeric);\n locale.setCalendarType(MLocale::GregorianCalendar);\n MCalendar mcal(locale);\n int year = 2008;\n int month = 7;\n int day = 21;\n int hour = 14;\n int minute = 31;\n int second = 3;\n mcal.setDate(year, month, day);\n mcal.setTime(hour, minute, second);\n QDate date(year, month, day);\n QTime time(hour, minute, second);\n QDateTime datetime(date, time, Qt::LocalTime);\n QLocale qlocale(language);\n QString format(\"%r\");\n QString result(\"٢:٣١ م\");\n QCOMPARE(locale.formatDateTime(mcal, format), result);\n QCOMPARE(locale.formatDateTime(datetime, format), result);\n\n QBENCHMARK {\n locale.formatDateTime(mcal, format);\n }\n}\n\nvoid Pt_MCalendar::benchmarkFormatDateTimePosixFormatString_R_MCalendar()\n{\n QString language(\"en_US\"); \/\/ will be overridden\n QString lcMessages(\"en_US\"); \/\/ should not matter\n QString lcTime(\"ar_SA\"); \/\/ this overrides language\n QString lcNumeric(\"ar_SA\"); \/\/ does matter, overrides localized numbers in dates\n MLocale locale(language);\n locale.setCategoryLocale(MLocale::MLcMessages, lcMessages);\n locale.setCategoryLocale(MLocale::MLcTime, lcTime);\n locale.setCategoryLocale(MLocale::MLcNumeric, lcNumeric);\n locale.setCalendarType(MLocale::GregorianCalendar);\n MCalendar mcal(locale);\n int year = 2008;\n int month = 7;\n int day = 21;\n int hour = 14;\n int minute = 31;\n int second = 3;\n mcal.setDate(year, month, day);\n mcal.setTime(hour, minute, second);\n QDate date(year, month, day);\n QTime time(hour, minute, second);\n QDateTime datetime(date, time, Qt::LocalTime);\n QLocale qlocale(language);\n QString format(\"%R\");\n QString result(\"١٤:٣١\");\n QCOMPARE(locale.formatDateTime(mcal, format), result);\n QCOMPARE(locale.formatDateTime(datetime, format), result);\n\n QBENCHMARK {\n locale.formatDateTime(mcal, format);\n }\n}\n\nvoid Pt_MCalendar::benchmarkFormatDateTimePosixFormatString_t_MCalendar()\n{\n QString language(\"en_US\"); \/\/ will be overridden\n QString lcMessages(\"en_US\"); \/\/ should not matter\n QString lcTime(\"ar_SA\"); \/\/ this overrides language\n QString lcNumeric(\"ar_SA\"); \/\/ does matter, overrides localized numbers in dates\n MLocale locale(language);\n locale.setCategoryLocale(MLocale::MLcMessages, lcMessages);\n locale.setCategoryLocale(MLocale::MLcTime, lcTime);\n locale.setCategoryLocale(MLocale::MLcNumeric, lcNumeric);\n locale.setCalendarType(MLocale::GregorianCalendar);\n MCalendar mcal(locale);\n int year = 2008;\n int month = 7;\n int day = 21;\n int hour = 14;\n int minute = 31;\n int second = 3;\n mcal.setDate(year, month, day);\n mcal.setTime(hour, minute, second);\n QDate date(year, month, day);\n QTime time(hour, minute, second);\n QDateTime datetime(date, time, Qt::LocalTime);\n QLocale qlocale(language);\n QString format(\"%t\");\n QString result(\"\\t\");\n QCOMPARE(locale.formatDateTime(mcal, format), result);\n QCOMPARE(locale.formatDateTime(datetime, format), result);\n\n QBENCHMARK {\n locale.formatDateTime(mcal, format);\n }\n}\n\nvoid Pt_MCalendar::benchmarkIcuFormatString()\n{\n QString language(\"en_US\"); \/\/ will be overridden\n QString lcMessages(\"en_US\"); \/\/ should not matter\n QString lcTime(\"fi_FI\"); \/\/ this overrides language\n QString lcNumeric(\"en_US\"); \/\/ should not matter, no localized numbers involved\n MLocale locale(language);\n locale.setCategoryLocale(MLocale::MLcMessages, lcMessages);\n locale.setCategoryLocale(MLocale::MLcTime, lcTime);\n locale.setCategoryLocale(MLocale::MLcNumeric, lcNumeric);\n locale.setCalendarType(MLocale::IslamicCalendar); \/\/ should not matter\n QCOMPARE(locale.icuFormatString(\n MLocale::DateFull,\n MLocale::TimeFull,\n MLocale::GregorianCalendar),\n QString(\"cccc d. MMMM y H:mm:ss zzzz\"));\n\n QBENCHMARK {\n locale.icuFormatString(\n MLocale::DateFull,\n MLocale::TimeFull,\n MLocale::GregorianCalendar);\n }\n}\n\nvoid Pt_MCalendar::benchmarkFormatDateTime()\n{\n QString language(\"en_US\"); \/\/ will be overridden\n QString lcMessages(\"en_US\"); \/\/ should not matter\n QString lcTime(\"fi_FI\"); \/\/ this overrides language\n QString lcNumeric(\"en_US\"); \/\/ should not matter, no localized numbers involved\n MLocale locale(language);\n locale.setCategoryLocale(MLocale::MLcMessages, lcMessages);\n locale.setCategoryLocale(MLocale::MLcTime, lcTime);\n locale.setCategoryLocale(MLocale::MLcNumeric, lcNumeric);\n MCalendar::setSystemTimeZone(\"Europe\/Helsinki\");\n MCalendar calendar;\n calendar.setDateTime(QDateTime(QDate(2010, 7, 13),\n QTime(14, 51, 07, 0),\n Qt::LocalTime));\n\n QCOMPARE(locale.formatDateTime(\n calendar, MLocale::DateFull, MLocale::TimeFull),\n QString(\"tiistai 13. heinäkuuta 2010 14:51:07 Itä-Euroopan kesäaika\"));\n\n QBENCHMARK {\n locale.formatDateTime(\n calendar, MLocale::DateFull, MLocale::TimeFull);\n }\n}\n\nvoid Pt_MCalendar::benchmarkFormatDateTimeICU()\n{\n QString language(\"en_US\"); \/\/ will be overridden\n QString lcMessages(\"en_US\"); \/\/ should not matter\n QString lcTime(\"fi_FI\"); \/\/ this overrides language\n QString lcNumeric(\"en_US\"); \/\/ should not matter\n QString formatString(\"cccc d. MMMM y H:mm:ss zzzz\");\n QString formattedResult(\"tiistai 13. heinäkuuta 2010 14:51:07 Itä-Euroopan kesäaika\");\n MLocale locale(language);\n locale.setCategoryLocale(MLocale::MLcMessages, lcMessages);\n locale.setCategoryLocale(MLocale::MLcTime, lcTime);\n locale.setCategoryLocale(MLocale::MLcNumeric, lcNumeric);\n MCalendar::setSystemTimeZone(\"Europe\/Helsinki\");\n MCalendar calendar;\n calendar.setDateTime(QDateTime(QDate(2010, 7, 13),\n QTime(14, 51, 07, 0),\n Qt::LocalTime));\n\n QCOMPARE(locale.formatDateTimeICU(calendar, formatString), formattedResult);\n\n QBENCHMARK {\n locale.formatDateTimeICU(calendar, formatString);\n }\n}\n\nQTEST_APPLESS_MAIN(Pt_MCalendar);\n\n<commit_msg>Changes: fix Pt_MCalendar<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 <QCoreApplication>\n#include <QTextCodec>\n#include <MLocale>\n#include <unicode\/uversion.h>\n\n#include \"pt_mcalendar.h\"\n\nvoid Pt_MCalendar::initTestCase()\n{\n static int argc = 0;\n static char *argv[1] = { (char *) \"\" };\n qap = new QCoreApplication(argc, argv);\n QTextCodec::setCodecForCStrings(QTextCodec::codecForName(\"UTF-8\"));\n QProcess process;\n process.start(\"sh -c \\\"dpkg -s libicu44 | grep Version | perl -pe 's\/^Version:[[:space:]]*([^[[:space:]]+)$\/$1\/g'\\\"\");\n if (!process.waitForFinished()) {\n qDebug() << \"cannot run process to check libicu44 package version , exiting ...\";\n exit(1);\n }\n icuPackageVersion = process.readAllStandardOutput();\n icuPackageVersion.replace(\"\\n\", \"\");\n qDebug() << \"libicu44 package version is:\" << icuPackageVersion;\n}\n\nvoid Pt_MCalendar::cleanupTestCase()\n{\n delete qap;\n}\n\nvoid Pt_MCalendar::init()\n{\n}\n\nvoid Pt_MCalendar::cleanup()\n{\n}\n\nvoid Pt_MCalendar::benchmarkFormatDateTimePosixFormatString_U_QDateTime()\n{\n QString language(\"en_US\"); \/\/ will be overridden\n QString lcMessages(\"en_US\"); \/\/ should not matter\n QString lcTime(\"ar_SA\"); \/\/ this overrides language\n QString lcNumeric(\"ar_SA\"); \/\/ does matter, overrides localized numbers in dates\n MLocale locale(language);\n locale.setCategoryLocale(MLocale::MLcMessages, lcMessages);\n locale.setCategoryLocale(MLocale::MLcTime, lcTime);\n locale.setCategoryLocale(MLocale::MLcNumeric, lcNumeric);\n locale.setCalendarType(MLocale::GregorianCalendar);\n MCalendar mcal(locale);\n int year = 2008;\n int month = 7;\n int day = 21;\n int hour = 14;\n int minute = 31;\n int second = 3;\n mcal.setDate(year, month, day);\n mcal.setTime(hour, minute, second);\n QDate date(year, month, day);\n QTime time(hour, minute, second);\n QDateTime datetime(date, time, Qt::LocalTime);\n QLocale qlocale(language);\n QString format(\"%U\");\n QString result(\"٢٩\");\n QCOMPARE(locale.formatDateTime(mcal, format), result);\n QCOMPARE(locale.formatDateTime(datetime, format), result);\n\n QBENCHMARK {\n locale.formatDateTime(datetime, format);\n }\n}\n\nvoid Pt_MCalendar::benchmarkFormatDateTimePosixFormatString_U_MCalendar()\n{\n QString language(\"en_US\"); \/\/ will be overridden\n QString lcMessages(\"en_US\"); \/\/ should not matter\n QString lcTime(\"ar_SA\"); \/\/ this overrides language\n QString lcNumeric(\"ar_SA\"); \/\/ does matter, overrides localized numbers in dates\n MLocale locale(language);\n locale.setCategoryLocale(MLocale::MLcMessages, lcMessages);\n locale.setCategoryLocale(MLocale::MLcTime, lcTime);\n locale.setCategoryLocale(MLocale::MLcNumeric, lcNumeric);\n locale.setCalendarType(MLocale::GregorianCalendar);\n MCalendar mcal(locale);\n int year = 2008;\n int month = 7;\n int day = 21;\n int hour = 14;\n int minute = 31;\n int second = 3;\n mcal.setDate(year, month, day);\n mcal.setTime(hour, minute, second);\n QDate date(year, month, day);\n QTime time(hour, minute, second);\n QDateTime datetime(date, time, Qt::LocalTime);\n QLocale qlocale(language);\n QString format(\"%U\");\n QString result(\"٢٩\");\n QCOMPARE(locale.formatDateTime(mcal, format), result);\n QCOMPARE(locale.formatDateTime(datetime, format), result);\n\n QBENCHMARK {\n locale.formatDateTime(mcal, format);\n }\n}\n\nvoid Pt_MCalendar::benchmarkFormatDateTimePosixFormatString_V_MCalendar()\n{\n QString language(\"en_US\"); \/\/ will be overridden\n QString lcMessages(\"en_US\"); \/\/ should not matter\n QString lcTime(\"ar_SA\"); \/\/ this overrides language\n QString lcNumeric(\"ar_SA\"); \/\/ does matter, overrides localized numbers in dates\n MLocale locale(language);\n locale.setCategoryLocale(MLocale::MLcMessages, lcMessages);\n locale.setCategoryLocale(MLocale::MLcTime, lcTime);\n locale.setCategoryLocale(MLocale::MLcNumeric, lcNumeric);\n locale.setCalendarType(MLocale::GregorianCalendar);\n MCalendar mcal(locale);\n int year = 2008;\n int month = 7;\n int day = 21;\n int hour = 14;\n int minute = 31;\n int second = 3;\n mcal.setDate(year, month, day);\n mcal.setTime(hour, minute, second);\n QDate date(year, month, day);\n QTime time(hour, minute, second);\n QDateTime datetime(date, time, Qt::LocalTime);\n QLocale qlocale(language);\n QString format(\"%V\");\n QString result(\"٣٠\");\n QCOMPARE(locale.formatDateTime(mcal, format), result);\n QCOMPARE(locale.formatDateTime(datetime, format), result);\n\n QBENCHMARK {\n locale.formatDateTime(mcal, format);\n }\n}\n\nvoid Pt_MCalendar::benchmarkFormatDateTimePosixFormatString_r_MCalendar()\n{\n QString language(\"en_US\"); \/\/ will be overridden\n QString lcMessages(\"en_US\"); \/\/ should not matter\n QString lcTime(\"ar_SA@mix-time-and-language=no\"); \/\/ this overrides language\n QString lcNumeric(\"ar_SA\"); \/\/ does matter, overrides localized numbers in dates\n MLocale locale(language);\n locale.setCategoryLocale(MLocale::MLcMessages, lcMessages);\n locale.setCategoryLocale(MLocale::MLcTime, lcTime);\n locale.setCategoryLocale(MLocale::MLcNumeric, lcNumeric);\n locale.setCalendarType(MLocale::GregorianCalendar);\n MCalendar mcal(locale);\n int year = 2008;\n int month = 7;\n int day = 21;\n int hour = 14;\n int minute = 31;\n int second = 3;\n mcal.setDate(year, month, day);\n mcal.setTime(hour, minute, second);\n QDate date(year, month, day);\n QTime time(hour, minute, second);\n QDateTime datetime(date, time, Qt::LocalTime);\n QLocale qlocale(language);\n QString format(\"%r\");\n QString result(\"٢:٣١ م\");\n QCOMPARE(locale.formatDateTime(mcal, format), result);\n QCOMPARE(locale.formatDateTime(datetime, format), result);\n\n QBENCHMARK {\n locale.formatDateTime(mcal, format);\n }\n}\n\nvoid Pt_MCalendar::benchmarkFormatDateTimePosixFormatString_R_MCalendar()\n{\n QString language(\"en_US\"); \/\/ will be overridden\n QString lcMessages(\"en_US\"); \/\/ should not matter\n QString lcTime(\"ar_SA\"); \/\/ this overrides language\n QString lcNumeric(\"ar_SA\"); \/\/ does matter, overrides localized numbers in dates\n MLocale locale(language);\n locale.setCategoryLocale(MLocale::MLcMessages, lcMessages);\n locale.setCategoryLocale(MLocale::MLcTime, lcTime);\n locale.setCategoryLocale(MLocale::MLcNumeric, lcNumeric);\n locale.setCalendarType(MLocale::GregorianCalendar);\n MCalendar mcal(locale);\n int year = 2008;\n int month = 7;\n int day = 21;\n int hour = 14;\n int minute = 31;\n int second = 3;\n mcal.setDate(year, month, day);\n mcal.setTime(hour, minute, second);\n QDate date(year, month, day);\n QTime time(hour, minute, second);\n QDateTime datetime(date, time, Qt::LocalTime);\n QLocale qlocale(language);\n QString format(\"%R\");\n QString result(\"١٤:٣١\");\n QCOMPARE(locale.formatDateTime(mcal, format), result);\n QCOMPARE(locale.formatDateTime(datetime, format), result);\n\n QBENCHMARK {\n locale.formatDateTime(mcal, format);\n }\n}\n\nvoid Pt_MCalendar::benchmarkFormatDateTimePosixFormatString_t_MCalendar()\n{\n QString language(\"en_US\"); \/\/ will be overridden\n QString lcMessages(\"en_US\"); \/\/ should not matter\n QString lcTime(\"ar_SA\"); \/\/ this overrides language\n QString lcNumeric(\"ar_SA\"); \/\/ does matter, overrides localized numbers in dates\n MLocale locale(language);\n locale.setCategoryLocale(MLocale::MLcMessages, lcMessages);\n locale.setCategoryLocale(MLocale::MLcTime, lcTime);\n locale.setCategoryLocale(MLocale::MLcNumeric, lcNumeric);\n locale.setCalendarType(MLocale::GregorianCalendar);\n MCalendar mcal(locale);\n int year = 2008;\n int month = 7;\n int day = 21;\n int hour = 14;\n int minute = 31;\n int second = 3;\n mcal.setDate(year, month, day);\n mcal.setTime(hour, minute, second);\n QDate date(year, month, day);\n QTime time(hour, minute, second);\n QDateTime datetime(date, time, Qt::LocalTime);\n QLocale qlocale(language);\n QString format(\"%t\");\n QString result(\"\\t\");\n QCOMPARE(locale.formatDateTime(mcal, format), result);\n QCOMPARE(locale.formatDateTime(datetime, format), result);\n\n QBENCHMARK {\n locale.formatDateTime(mcal, format);\n }\n}\n\nvoid Pt_MCalendar::benchmarkIcuFormatString()\n{\n QString language(\"en_US\"); \/\/ will be overridden\n QString lcMessages(\"en_US\"); \/\/ should not matter\n QString lcTime(\"fi_FI\"); \/\/ this overrides language\n QString lcNumeric(\"en_US\"); \/\/ should not matter, no localized numbers involved\n MLocale locale(language);\n locale.setCategoryLocale(MLocale::MLcMessages, lcMessages);\n locale.setCategoryLocale(MLocale::MLcTime, lcTime);\n locale.setCategoryLocale(MLocale::MLcNumeric, lcNumeric);\n locale.setCalendarType(MLocale::IslamicCalendar); \/\/ should not matter\n QCOMPARE(locale.icuFormatString(\n MLocale::DateFull,\n MLocale::TimeFull,\n MLocale::GregorianCalendar),\n QString(\"cccc d. MMMM y H:mm:ss zzzz\"));\n\n QBENCHMARK {\n locale.icuFormatString(\n MLocale::DateFull,\n MLocale::TimeFull,\n MLocale::GregorianCalendar);\n }\n}\n\nvoid Pt_MCalendar::benchmarkFormatDateTime()\n{\n QString language(\"en_US\"); \/\/ will be overridden\n QString lcMessages(\"en_US\"); \/\/ should not matter\n QString lcTime(\"fi_FI@mix-time-and-language=no\"); \/\/ this overrides language\n QString lcNumeric(\"en_US\"); \/\/ should not matter, no localized numbers involved\n MLocale locale(language);\n locale.setCategoryLocale(MLocale::MLcMessages, lcMessages);\n locale.setCategoryLocale(MLocale::MLcTime, lcTime);\n locale.setCategoryLocale(MLocale::MLcNumeric, lcNumeric);\n MCalendar::setSystemTimeZone(\"Europe\/Helsinki\");\n MCalendar calendar;\n calendar.setDateTime(QDateTime(QDate(2010, 7, 13),\n QTime(14, 51, 07, 0),\n Qt::LocalTime));\n\n QCOMPARE(locale.formatDateTime(\n calendar, MLocale::DateFull, MLocale::TimeFull),\n QString(\"tiistai 13. heinäkuuta 2010 14:51:07 Itä-Euroopan kesäaika\"));\n\n QBENCHMARK {\n locale.formatDateTime(\n calendar, MLocale::DateFull, MLocale::TimeFull);\n }\n}\n\nvoid Pt_MCalendar::benchmarkFormatDateTimeICU()\n{\n QString language(\"en_US\"); \/\/ will be overridden\n QString lcMessages(\"en_US\"); \/\/ should not matter\n QString lcTime(\"fi_FI@mix-time-and-language=no\"); \/\/ this overrides language\n QString lcNumeric(\"en_US\"); \/\/ should not matter\n QString formatString(\"cccc d. MMMM y H:mm:ss zzzz\");\n QString formattedResult(\"tiistai 13. heinäkuuta 2010 14:51:07 Itä-Euroopan kesäaika\");\n MLocale locale(language);\n locale.setCategoryLocale(MLocale::MLcMessages, lcMessages);\n locale.setCategoryLocale(MLocale::MLcTime, lcTime);\n locale.setCategoryLocale(MLocale::MLcNumeric, lcNumeric);\n MCalendar::setSystemTimeZone(\"Europe\/Helsinki\");\n MCalendar calendar;\n calendar.setDateTime(QDateTime(QDate(2010, 7, 13),\n QTime(14, 51, 07, 0),\n Qt::LocalTime));\n\n QCOMPARE(locale.formatDateTimeICU(calendar, formatString), formattedResult);\n\n QBENCHMARK {\n locale.formatDateTimeICU(calendar, formatString);\n }\n}\n\nQTEST_APPLESS_MAIN(Pt_MCalendar);\n\n<|endoftext|>"} {"text":"<commit_before>#include <string>\n#include <vector>\n#include <iostream>\n#include <fstream>\n#include <iomanip>\n#include <cstdlib>\n#include <chrono>\n#include <sstream>\n#include <cmath>\n#include <cstdio>\n#include <sys\/stat.h>\n#include <sys\/ipc.h>\n#include <sys\/shm.h>\n#include <sys\/msg.h>\n#include <unistd.h>\n\n#include \"entity.h\"\n#include \"character.h\"\n#include \"monster.h\"\n#include \"spell.h\"\n#include \"item.h\"\n#include \"tile.h\"\n#include \"timetable.h\"\n#include \"mailbox.h\"\n#include \"map.h\"\n\nusing namespace std;\n\nconst int StartingX = 8;\nconst int StartingY = 8;\n\n\/\/Structure for HTTP form data\nstruct FormInfo{\n\tstring Key;\n\tstring Value;\n};\n\nvector<Enemy> SpawnedEnemies; \/\/ []\nvector<Character> Players;\n\n\/\/Vector to hold Key \/ Value pairs after processing\nvector<FormInfo> FormData;\n\nvoid getFormData(string Env);\nstring GetValueFromKey(string FindKey);\nint GetPlayerByBox(string BoxNumber);\nstring GetNewCharInfo(Character& Character);\n\nint main(){\n\t\/\/Setup Game state\n\tTimeTable TimeTable;\n\tMailbox Mailbox;\n\tMap Map;\n\tbool Done = false;\n\tstring Message;\n\tstring Action;\n\tstring Temp;\n\tint User;\n\tstring Box;\n\t\n\t\/\/Load maps\n\tMap.LoadMap(\"map.csv\");\n\t\n\t\/\/Load definitions\n\tcout << \"Beginning main loop\\n\" << flush;\n\tcout << \"Mailbox: \" << Mailbox.SetupSuccessful() << \"\\n\" << flush;\n\t\/\/Main Loop\n\twhile (!Done){\n\t\tFormData.clear();\n\t\tAction = \"\";\n\t\t\n\t\t\/\/Check Time table. Perform function for all expired times\n\t\t\n\t\t\/\/Check and Process Messages\n\t\tMessage = Mailbox.GetNextMessage();\n\t\tgetFormData(Message);\n\t\tAction = GetValueFromKey(\"Action\");\n\t\tBox = GetValueFromKey(\"Box\");\n\t\tif (Box.length() > 0) User = GetPlayerByBox(Box);\n\t\t\t\n\t\tif (Action == \"EnterGame\"){\n\t\t\tCharacter NewChar(GetValueFromKey(\"u\"), GetValueFromKey(\"c\"), stoi(GetValueFromKey(\"b\")));\n\t\t\tMailbox.OpenUserBox(NewChar.Box);\n\t\t\tNewChar.X = StartingX;\n\t\t\tNewChar.Y = StartingY;\n\/\/ \t\t\tTemp = \"&Op=MyPosition&X=\" + to_string(StartingX) + \"&Y=\" + to_string(StartingY);\n\/\/ \t\t\tMailbox.SendMessageToBox(Temp, NewChar.Box);\n\t\t\tMailbox.SendMessageToBox(\"&Op=Con&Message=\" + NewChar.Name + \" has entered the game.\", NewChar.Box);\n\t\t\tTemp = GetNewCharInfo(NewChar);\n\t\t\tMailbox.BroadcastMessage(GetNewCharInfo(NewChar));\n\t\t\tMailbox.SendMessageToBox(GetNewCharInfo(NewChar), NewChar.Box);\n\t\t\tfor (int i = 0; i < Players.size(); i++){\n\t\t\t\tMailbox.SendMessageToBox(GetNewCharInfo(Players[i]), NewChar.Box);\n\t\t\t}\n\t\t\tPlayers.push_back(NewChar);\n\t\t}\n\t\t\n\t\tif (Action == \"RepeatMessage\"){\n\t\t\t\/\/This convoluted mess tests the message passing among objects (It's obv super redundant.)\n\t\t\tstring TestString = \"&Op=Alert&Message=\" + GetValueFromKey(\"Message\") + \" Repeated back at ya.\";\n\t\t\tint TestBox = Players[GetPlayerByBox(GetValueFromKey(\"b\"))].Box;\n\t\t\tcout << \"Test:\" << TestString << \"\\n\";\n\t\t\tMailbox.SendMessageToBox(TestString , TestBox );\n\t\t\t\n\t\t}\n\t\t\n\t\tif (Action == \"LeaveGame\"){\n\t\t\t\/\/Done = true;\n\t\t\tMailbox.CloseUserBox(stoi(GetValueFromKey(\"b\")));\n\t\t}\n\t\t\n\t\tif (Action == \"GetPlot\"){\n\t\t\tint X = stoi(GetValueFromKey(\"X\"));\n\t\t\tint Y = stoi(GetValueFromKey(\"Y\"));\n\t\t\tTemp = \"&Op=MapPlot&X=\" + GetValueFromKey(\"X\") + \"&Y=\" + GetValueFromKey(\"Y\") + \"&Plot=\" + Map.GetPlot(X,Y);\n\t\t\tMailbox.SendMessageToBox(Temp, Players[User].Box);\n\t\t}\n\t\t\n\t\tif (Action == \"Move\"){\n\t\t\tint Who = GetPlayerByBox(GetValueFromKey(\"b\"));\n\t\t\tint X = stoi(GetValueFromKey(\"XMove\"));\n\t\t\tint Y = stoi(GetValueFromKey(\"YMove\"));\n\t\t\tcout << \"Move\";\n\t\t\t\/\/if (Map.Passable(Players[Who].X + X, Players[Who].Y + Y)){\n\t\t\t\tstring Temp = \"&Op=PlayerMove&b=\" + GetValueFromKey(\"b\") + \"&X=\" + GetValueFromKey(\"XMove\") + \"&Y=\" + GetValueFromKey(\"YMove\");\n\t\t\t\tMailbox.BroadcastMessage(Temp);\n\t\t\t\t\/\/Mailbox.SendMessageToBox(Temp, Players[Who].Box);\n\t\t\t\/\/}\n\t\t}\t\n\t\t\n\t\tif (Action == \"CastSpell\"){\n\t\t}\t\n\t\t\n\t\tif (Action == \"EquipItem\"){\n\t\t}\t\t\n\t\t\n\t\tif (Action == \"UseItem\"){\n\t\t}\t\t\n\n\t\tif (Action == \"Attack\"){\n\t\t}\n\t\t\/\/Game in progress action\n\n\t\t\/\/Perform a character action\n\n\t\t\/\/Perform an inventory action\n\n\t\t\/\/Perform a world action\n\n\t\t\/\/Perform targetting action\n\t\n\n\t\tif (Action != \"\"){\n\t\t\tcout << \"Number of Open Boxes:\" << Mailbox.BoxCount() << \"\\n\";\n\t\t\tcout << \"Number of Messages:\" << Mailbox.MessageCount() << \"\\n\";\n\t\t}\n\t}\n}\n\nstring GetNewCharInfo(Character& Character){\n\tstring RetVal;\n\tRetVal += \"&Op=UpdateChar&b=\" + to_string(Character.Box);\n\tRetVal += \"&cInt=\" + to_string(Character.GetStat(Intelligence, false));\n\tRetVal += \"&cStrt=\" + to_string(Character.GetStat(Strength, false));\n\tRetVal += \"&cAgi=\" + to_string(Character.GetStat(Agility, false));\n\tRetVal += \"&cCon=\" + to_string(Character.GetStat(Constitution, false));\n\tRetVal += \"&cSpd=\" + to_string(Character.GetStat(Speed, false));\n\tRetVal += \"&cCha=\" + to_string(Character.GetStat(Charisma, false));\n\tRetVal += \"&cEnd=\" + to_string(Character.GetStat(Endurance, false));\n\tRetVal += \"&cHea=\" + to_string(Character.GetStat(Health, false));\n\tRetVal += \"&cMan=\" + to_string(Character.GetStat(Mana, false));\n\tRetVal += \"&cAtt=\" + to_string(Character.GetStat(Attack, false));\n\tRetVal += \"&cDef=\" + to_string(Character.GetStat(Defense, false));\n\tRetVal += \"&cACD=\" + to_string(Character.GetStat(ActionCoolDown, false));\n\tRetVal += \"&cMCD=\" + to_string(Character.GetStat(MagicCoolDown, false));\n\t\n\tRetVal += \"&mInt=\" + to_string(Character.GetStat(Intelligence, true));\n\tRetVal += \"&mStrt=\" + to_string(Character.GetStat(Strength, true));\n\tRetVal += \"&mAgi=\" + to_string(Character.GetStat(Agility, true));\n\tRetVal += \"&mCon=\" + to_string(Character.GetStat(Constitution, true));\n\tRetVal += \"&mSpd=\" + to_string(Character.GetStat(Speed, true));\n\tRetVal += \"&mCha=\" + to_string(Character.GetStat(Charisma, true));\n\tRetVal += \"&mEnd=\" + to_string(Character.GetStat(Endurance, true));\n\tRetVal += \"&mHea=\" + to_string(Character.GetStat(Health, true));\n\tRetVal += \"&mMan=\" + to_string(Character.GetStat(Mana, true));\n\tRetVal += \"&mAtt=\" + to_string(Character.GetStat(Attack, true));\n\tRetVal += \"&mDef=\" + to_string(Character.GetStat(Defense, true));\n\tRetVal += \"&mACD=\" + to_string(Character.GetStat(ActionCoolDown, true));\n\tRetVal += \"&mMCD=\" + to_string(Character.GetStat(MagicCoolDown, true));\n\t\n\tRetVal += \"&Level=\" + Character.GetLevel();\n\tRetVal += \"&Exp=\" + Character.GetExp();\n\tRetVal += \"&Gold=\" + Character.GetGold();\n\tRetVal += \"&X=\" + Character.X;\n\tRetVal += \"&Y=\" + Character.Y;\n\tRetVal += \"&Name=\" + Character.Name;\n\tRetVal += \"&Race=\" + Character.Race;\n\tRetVal += \"&Class=\" + Character.Class;\n\tRetVal += \"&Sex=\" + Character.Sex;\n\t\n\treturn RetVal;\n}\n\n\nint GetPlayerByBox(string BoxNumber){\n\tint FindBox = stoi(BoxNumber);\n\tfor (int i = 0; i < Players.size(); i++){\n\t\tif (Players[i].Box == FindBox) return i;\n\t}\n\treturn -1;\n}\n\nstring GetValueFromKey(string FindKey){\n\tfor (int i = 0; i < FormData.size(); i++){\n\t\tif (!FormData[i].Key.compare(FindKey)){ return FormData[i].Value; }\n\t}\t\n\treturn \"\";\n}\n\nvoid getFormData(string Env){\n\tint EnvLen = Env.size();\t\n\tint Start = 1;\n\tint Mid = 0;\n\tFormInfo NewData;\n\n\t\/\/Split Key-Value pairs and place in the FormData structure.\n\tfor (int i = 1; i < EnvLen; i++){\n\tif (Env[i] == '='){Mid = i + 1;}\n\t\tif (Env[i] == '&' || i == EnvLen - 1){\n\t\t\tif (i == EnvLen - 1) i++; \/\/Get last character\n\t\t\tNewData.Key = Env.substr(Start,Mid-Start-1);\n\t\t\tNewData.Value = Env.substr(Mid, i - Mid);\n\t\t\tFormData.push_back(NewData);\n\t\t\tStart = i + 1;\n\t\t}\n\t}\n}\n\n<commit_msg>Work in progress<commit_after>#include <string>\n#include <vector>\n#include <iostream>\n#include <fstream>\n#include <iomanip>\n#include <cstdlib>\n#include <chrono>\n#include <sstream>\n#include <cmath>\n#include <cstdio>\n#include <sys\/stat.h>\n#include <sys\/ipc.h>\n#include <sys\/shm.h>\n#include <sys\/msg.h>\n#include <unistd.h>\n\n#include \"entity.h\"\n#include \"character.h\"\n#include \"monster.h\"\n#include \"spell.h\"\n#include \"item.h\"\n#include \"tile.h\"\n#include \"timetable.h\"\n#include \"mailbox.h\"\n#include \"map.h\"\n\nusing namespace std;\n\nconst int StartingX = 8;\nconst int StartingY = 8;\n\n\/\/Structure for HTTP form data\nstruct FormInfo{\n\tstring Key;\n\tstring Value;\n};\n\nvector<Enemy> SpawnedEnemies; \/\/ []\nvector<Character> Players;\n\n\/\/Vector to hold Key \/ Value pairs after processing\nvector<FormInfo> FormData;\n\nvoid getFormData(string Env);\nstring GetValueFromKey(string FindKey);\nint GetPlayerByBox(string BoxNumber);\nstring GetNewCharInfo(Character& Character);\n\nint main(){\n\t\/\/Setup Game state\n\tTimeTable TimeTable;\n\tMailbox Mailbox;\n\tMap Map;\n\tvector<Item> Items;\n\tvector<Spell> Spells;\n\tbool Done = false;\n\tstring Message;\n\tstring Action;\n\tstring Temp;\n\tint User;\n\tstring Box;\n\t\n\t\/\/Load maps\n\tMap.LoadMap(\"map.csv\");\n\t\n\t\/\/Load definitions\n\tcout << \"Beginning main loop\\n\" << flush;\n\tcout << \"Mailbox: \" << Mailbox.SetupSuccessful() << \"\\n\" << flush;\n\t\/\/Main Loop\n\twhile (!Done){\n\t\tFormData.clear();\n\t\tAction = \"\";\n\t\t\n\t\t\/\/Check Time table. Perform function for all expired times\n\t\tTimeTable.SelectNextItem();\n\t\tTimeTable.Pop();\n\t\t\n\t\t\/\/Check and Process Messages\n\t\tMessage = Mailbox.GetNextMessage();\n\t\tgetFormData(Message);\n\t\tAction = GetValueFromKey(\"Action\");\n\t\tBox = GetValueFromKey(\"Box\");\n\t\tif (Box.length() > 0) User = GetPlayerByBox(Box);\n\t\t\t\n\t\tif (Action == \"EnterGame\"){\n\t\t\tCharacter NewChar(GetValueFromKey(\"u\"), GetValueFromKey(\"c\"), stoi(GetValueFromKey(\"b\")));\n\t\t\tMailbox.OpenUserBox(NewChar.Box);\n\t\t\tNewChar.X = StartingX;\n\t\t\tNewChar.Y = StartingY;\n\/\/ \t\t\tTemp = \"&Op=MyPosition&X=\" + to_string(StartingX) + \"&Y=\" + to_string(StartingY);\n\/\/ \t\t\tMailbox.SendMessageToBox(Temp, NewChar.Box);\n\t\t\tMailbox.SendMessageToBox(\"&Op=Con&Message=\" + NewChar.Name + \" has entered the game.\", NewChar.Box);\n\t\t\tTemp = GetNewCharInfo(NewChar);\n\t\t\tMailbox.BroadcastMessage(GetNewCharInfo(NewChar));\n\t\t\tMailbox.SendMessageToBox(GetNewCharInfo(NewChar), NewChar.Box);\n\t\t\tfor (int i = 0; i < Players.size(); i++){\n\t\t\t\tMailbox.SendMessageToBox(GetNewCharInfo(Players[i]), NewChar.Box);\n\t\t\t}\n\t\t\tPlayers.push_back(NewChar);\n\t\t}\n\t\t\n\t\tif (Action == \"RepeatMessage\"){\n\t\t\t\/\/This convoluted mess tests the message passing among objects (It's obv super redundant.)\n\t\t\tstring TestString = \"&Op=Alert&Message=\" + GetValueFromKey(\"Message\") + \" Repeated back at ya.\";\n\t\t\tint TestBox = Players[GetPlayerByBox(GetValueFromKey(\"b\"))].Box;\n\t\t\tcout << \"Test:\" << TestString << \"\\n\";\n\t\t\tMailbox.SendMessageToBox(TestString , TestBox );\n\t\t\t\n\t\t}\n\t\t\n\t\tif (Action == \"LeaveGame\"){\n\t\t\t\/\/Done = true;\n\t\t\tMailbox.CloseUserBox(stoi(GetValueFromKey(\"b\")));\n\t\t}\n\t\t\n\t\tif (Action == \"GetPlot\"){\n\t\t\tint X = stoi(GetValueFromKey(\"X\"));\n\t\t\tint Y = stoi(GetValueFromKey(\"Y\"));\n\t\t\tTemp = \"&Op=MapPlot&X=\" + GetValueFromKey(\"X\") + \"&Y=\" + GetValueFromKey(\"Y\") + \"&Plot=\" + Map.GetPlot(X,Y);\n\t\t\tMailbox.SendMessageToBox(Temp, Players[User].Box);\n\t\t}\n\t\t\n\t\tif (Action == \"Move\"){\n\t\t\tint Who = GetPlayerByBox(GetValueFromKey(\"b\"));\n\t\t\tint X = stoi(GetValueFromKey(\"XMove\"));\n\t\t\tint Y = stoi(GetValueFromKey(\"YMove\"));\n\t\t\tcout << \"Move\";\n\t\t\tif (Map.Passable(Players[Who].X + X, Players[Who].Y + Y)){\n\t\t\t\tstring Temp = \"&Op=PlayerMove&b=\" + GetValueFromKey(\"b\") + \"&X=\" + GetValueFromKey(\"XMove\") + \"&Y=\" + GetValueFromKey(\"YMove\");\n\t\t\t\tMailbox.BroadcastMessage(Temp);\n\t\t\t\tMailbox.SendMessageToBox(Temp, Players[Who].Box);\n\t\t\t}\n\t\t}\t\n\t\t\n\t\tif (Action == \"CastSpell\"){\n\t\t\tif (GetValueFromKey(\"enemyID\") != \"Not Found\"){\n\t\t\t\tSpells[stoi(GetValueFromKey(\"SpellID\"))].cast_spell(Players[stoi(GetPlayerByBox(\"b\"))], SpawnedEnemies[stoi(GetValueFromKey(\"enemyID\"))]);\n\t\t\t} else {\n\t\t\t\t\n\t\t\t\tSpells[stoi(GetValueFromKey(\"SpellID\"))].cast_spell(Players[stoi(GetPlayerByBox(\"b\"))], Players[stoi(GetPlayerByBox(GetValueFromKey(\"targetB\"))]);\n\t\t\t}\n\t\t}\t\n\t\t\n\t\tif (Action == \"EquipItem\"){\n\t\t\tPlayers[GetPlayerByBox(GetValueFromKey(\"b\"))].EquipItem(stoi(GetValueFromKey(\"ItemID\")));\n\t\t}\t\t\n\t\t\n\t\tif (Action == \"UseItem\"){\n\t\t\tItems[stoi(GetValueFromKey(\"ItemID\"))].Use(Players[stoi(GetValueFromKey(\"b\"))], Players[stoi(GetValueFromKey(\"targetB\"))];\n\t\t}\t\t\n\n\t\tif (Action == \"Attack\"){\n\t\t\tPlayers[stoi(GetValueFromKey(\"b\"))].Damage(SpawnedEnemies[stoi(GetValueFromKey(\"enemyID\"))]);\n\t\t}\n\n\t\tif (Action != \"\"){\n\t\t\tcout << \"Number of Open Boxes:\" << Mailbox.BoxCount() << \"\\n\";\n\t\t\tcout << \"Number of Messages:\" << Mailbox.MessageCount() << \"\\n\";\n\t\t}\n\t\t\n\t}\n}\n\nstring GetNewCharInfo(Character& Character){\n\tstring RetVal;\n\tRetVal += \"&Op=UpdateChar&b=\" + to_string(Character.Box);\n\tRetVal += \"&cInt=\" + to_string(Character.GetStat(Intelligence, false));\n\tRetVal += \"&cStrt=\" + to_string(Character.GetStat(Strength, false));\n\tRetVal += \"&cAgi=\" + to_string(Character.GetStat(Agility, false));\n\tRetVal += \"&cCon=\" + to_string(Character.GetStat(Constitution, false));\n\tRetVal += \"&cSpd=\" + to_string(Character.GetStat(Speed, false));\n\tRetVal += \"&cCha=\" + to_string(Character.GetStat(Charisma, false));\n\tRetVal += \"&cEnd=\" + to_string(Character.GetStat(Endurance, false));\n\tRetVal += \"&cHea=\" + to_string(Character.GetStat(Health, false));\n\tRetVal += \"&cMan=\" + to_string(Character.GetStat(Mana, false));\n\tRetVal += \"&cAtt=\" + to_string(Character.GetStat(Attack, false));\n\tRetVal += \"&cDef=\" + to_string(Character.GetStat(Defense, false));\n\tRetVal += \"&cACD=\" + to_string(Character.GetStat(ActionCoolDown, false));\n\tRetVal += \"&cMCD=\" + to_string(Character.GetStat(MagicCoolDown, false));\n\t\n\tRetVal += \"&mInt=\" + to_string(Character.GetStat(Intelligence, true));\n\tRetVal += \"&mStrt=\" + to_string(Character.GetStat(Strength, true));\n\tRetVal += \"&mAgi=\" + to_string(Character.GetStat(Agility, true));\n\tRetVal += \"&mCon=\" + to_string(Character.GetStat(Constitution, true));\n\tRetVal += \"&mSpd=\" + to_string(Character.GetStat(Speed, true));\n\tRetVal += \"&mCha=\" + to_string(Character.GetStat(Charisma, true));\n\tRetVal += \"&mEnd=\" + to_string(Character.GetStat(Endurance, true));\n\tRetVal += \"&mHea=\" + to_string(Character.GetStat(Health, true));\n\tRetVal += \"&mMan=\" + to_string(Character.GetStat(Mana, true));\n\tRetVal += \"&mAtt=\" + to_string(Character.GetStat(Attack, true));\n\tRetVal += \"&mDef=\" + to_string(Character.GetStat(Defense, true));\n\tRetVal += \"&mACD=\" + to_string(Character.GetStat(ActionCoolDown, true));\n\tRetVal += \"&mMCD=\" + to_string(Character.GetStat(MagicCoolDown, true));\n\t\n\tRetVal += \"&Level=\" + Character.GetLevel();\n\tRetVal += \"&Exp=\" + Character.GetExp();\n\tRetVal += \"&Gold=\" + Character.GetGold();\n\tRetVal += \"&X=\" + Character.X;\n\tRetVal += \"&Y=\" + Character.Y;\n\tRetVal += \"&Name=\" + Character.Name;\n\tRetVal += \"&Race=\" + Character.Race;\n\tRetVal += \"&Class=\" + Character.Class;\n\tRetVal += \"&Sex=\" + Character.Sex;\n\t\n\treturn RetVal;\n}\n\n\nint GetPlayerByBox(string BoxNumber){\n\tint FindBox = stoi(BoxNumber);\n\tfor (int i = 0; i < Players.size(); i++){\n\t\tif (Players[i].Box == FindBox) return i;\n\t}\n\treturn -1;\n}\n\nstring GetValueFromKey(string FindKey){\n\tfor (int i = 0; i < FormData.size(); i++){\n\t\tif (!FormData[i].Key.compare(FindKey)){ return FormData[i].Value; }\n\t}\t\n\treturn \"\";\n}\n\nvoid getFormData(string Env){\n\tint EnvLen = Env.size();\t\n\tint Start = 1;\n\tint Mid = 0;\n\tFormInfo NewData;\n\n\t\/\/Split Key-Value pairs and place in the FormData structure.\n\tfor (int i = 1; i < EnvLen; i++){\n\tif (Env[i] == '='){Mid = i + 1;}\n\t\tif (Env[i] == '&' || i == EnvLen - 1){\n\t\t\tif (i == EnvLen - 1) i++; \/\/Get last character\n\t\t\tNewData.Key = Env.substr(Start,Mid-Start-1);\n\t\t\tNewData.Value = Env.substr(Mid, i - Mid);\n\t\t\tFormData.push_back(NewData);\n\t\t\tStart = i + 1;\n\t\t}\n\t}\n}\n\n<|endoftext|>"} {"text":"<commit_before>\/*\n * Copyright (c) 2007-2008 Digital Bazaar, Inc. All rights reserved.\n *\/\n#include \"db\/sql\/mysql\/MySqlRow.h\"\n#include \"db\/sql\/mysql\/MySqlStatement.h\"\n#include \"db\/sql\/mysql\/MySqlConnection.h\"\n\nusing namespace std;\nusing namespace db::rt;\nusing namespace db::sql;\nusing namespace db::sql::mysql;\n\nMySqlRow::MySqlRow(MySqlStatement* s) : Row(s)\n{\n mFields = NULL;\n mFieldCount = 0;\n mBindings = NULL;\n}\n\nMySqlRow::~MySqlRow()\n{\n}\n\nMYSQL_STMT* MySqlRow::getStatementHandle()\n{\n return ((MySqlStatement*)mStatement)->mHandle;\n}\n\nlong long MySqlRow::getColumnIndex(const char* name)\n{\n \/\/ use 64-bit signed int to cover all values + error (negative 1)\n long long rval = -1;\n \n for(unsigned int i = 0; i < mFieldCount; i++)\n {\n if(strcmp(name, mFields[i].name) == 0)\n {\n rval = i;\n break;\n }\n }\n \n if(rval == -1)\n {\n \/\/ set exception\n int length = 100 + strlen(name);\n char msg[length];\n snprintf(msg, length,\n \"Could not get column value, invalid column name!, name='%s'\", name);\n ExceptionRef e = new SqlException(msg);\n Exception::setLast(e, false); \n }\n \n return rval;\n}\n\nvoid MySqlRow::setFields(\n MYSQL_FIELD* fields, unsigned int count, MYSQL_BIND* bindings)\n{\n mFields = fields;\n mFieldCount = count;\n mBindings = bindings;\n}\n\nbool MySqlRow::getType(unsigned int column, int& type)\n{\n bool rval = false;\n \n if(column >= mFieldCount)\n {\n char temp[100];\n snprintf(temp, 100,\n \"Could not get column type, invalid column index!,index=%i\", column);\n ExceptionRef e = new SqlException(temp);\n Exception::setLast(e, false);\n }\n else\n {\n type = mFields[column].type;\n rval = true;\n }\n \n return rval;\n}\n\nbool MySqlRow::getInt32(unsigned int column, int& i)\n{\n mBindings[column].buffer_type = MYSQL_TYPE_LONG;\n mBindings[column].buffer = (char*)&i;\n mBindings[column].buffer_length = 4;\n mBindings[column].length = &mBindings[column].buffer_length;\n mysql_stmt_fetch_column(getStatementHandle(), &mBindings[column], column, 0);\n \n \/\/ FIXME: check exceptions, etc\n return true;\n}\n\nbool MySqlRow::getUInt32(unsigned int column, unsigned int& i)\n{\n mBindings[column].buffer_type = MYSQL_TYPE_LONG;\n mBindings[column].buffer = (char*)&i;\n mBindings[column].buffer_length = 4;\n mBindings[column].length = &mBindings[column].buffer_length;\n mysql_stmt_fetch_column(getStatementHandle(), &mBindings[column], column, 0);\n \n \/\/ FIXME: check exceptions, etc\n return true;\n}\n\nbool MySqlRow::getInt64(unsigned int column, long long& i)\n{\n mBindings[column].buffer_type = MYSQL_TYPE_LONGLONG;\n mBindings[column].buffer = (char*)&i;\n mBindings[column].buffer_length = 8;\n mBindings[column].length = &mBindings[column].buffer_length;\n mysql_stmt_fetch_column(getStatementHandle(), &mBindings[column], column, 0);\n \n \/\/ FIXME: check exceptions, etc\n return true;\n}\n\nbool MySqlRow::getUInt64(unsigned int column, unsigned long long& i)\n{\n mBindings[column].buffer_type = MYSQL_TYPE_LONGLONG;\n mBindings[column].buffer = (char*)&i;\n mBindings[column].buffer_length = 8;\n mBindings[column].length = &mBindings[column].buffer_length;\n mysql_stmt_fetch_column(getStatementHandle(), &mBindings[column], column, 0);\n \n \/\/ FIXME: check exceptions, etc\n return true;\n}\n\nbool MySqlRow::getText(unsigned int column, string& str)\n{\n mBindings[column].buffer_type = MYSQL_TYPE_BLOB;\n char temp[mBindings[column].buffer_length + 1];\n mBindings[column].buffer = temp;\n mBindings[column].length = &mBindings[column].buffer_length;\n mysql_stmt_fetch_column(getStatementHandle(), &mBindings[column], column, 0);\n \n memset(temp + mBindings[column].buffer_length, 0, 1);\n str.assign(temp);\n \n \/\/ FIXME: check exceptions, etc\n return true;\n}\n\nbool MySqlRow::getType(const char* column, int& type)\n{\n bool rval = false;\n \n \/\/ get column index for name\n long long index = getColumnIndex(column);\n if(index != -1)\n {\n rval = getType(index, type);\n }\n \n return rval;\n}\n\nbool MySqlRow::getInt32(const char* column, int& i)\n{\n bool rval = false;\n \n \/\/ get column index for name\n long long index = getColumnIndex(column);\n if(index != -1)\n {\n rval = getInt32(index, i);\n }\n \n return rval;\n}\n\nbool MySqlRow::getUInt32(const char* column, unsigned int& i)\n{\n bool rval = false;\n \n \/\/ get column index for name\n long long index = getColumnIndex(column);\n if(index != -1)\n {\n rval = getUInt32(index, i);\n }\n \n return rval;\n}\n\nbool MySqlRow::getInt64(const char* column, long long& i)\n{\n bool rval = false;\n \n \/\/ get column index for name\n long long index = getColumnIndex(column);\n if(index != -1)\n {\n rval = getInt64(index, i);\n }\n \n return rval;\n}\n\nbool MySqlRow::getUInt64(const char* column, unsigned long long& i)\n{\n bool rval = false;\n \n \/\/ get column index for name\n long long index = getColumnIndex(column);\n if(index != -1)\n {\n rval = getUInt64(index, i);\n }\n \n return rval;\n}\n\nbool MySqlRow::getText(const char* column, std::string& str)\n{\n bool rval = false;\n \n \/\/ get column index for name\n long long index = getColumnIndex(column);\n if(index != -1)\n {\n rval = getText(index, str);\n }\n \n return rval;\n}\n<commit_msg>Dave added code to handle null text data.<commit_after>\/*\n * Copyright (c) 2007-2008 Digital Bazaar, Inc. All rights reserved.\n *\/\n#include \"db\/sql\/mysql\/MySqlRow.h\"\n#include \"db\/sql\/mysql\/MySqlStatement.h\"\n#include \"db\/sql\/mysql\/MySqlConnection.h\"\n\nusing namespace std;\nusing namespace db::rt;\nusing namespace db::sql;\nusing namespace db::sql::mysql;\n\nMySqlRow::MySqlRow(MySqlStatement* s) : Row(s)\n{\n mFields = NULL;\n mFieldCount = 0;\n mBindings = NULL;\n}\n\nMySqlRow::~MySqlRow()\n{\n}\n\nMYSQL_STMT* MySqlRow::getStatementHandle()\n{\n return ((MySqlStatement*)mStatement)->mHandle;\n}\n\nlong long MySqlRow::getColumnIndex(const char* name)\n{\n \/\/ use 64-bit signed int to cover all values + error (negative 1)\n long long rval = -1;\n \n for(unsigned int i = 0; i < mFieldCount; i++)\n {\n if(strcmp(name, mFields[i].name) == 0)\n {\n rval = i;\n break;\n }\n }\n \n if(rval == -1)\n {\n \/\/ set exception\n int length = 100 + strlen(name);\n char msg[length];\n snprintf(msg, length,\n \"Could not get column value, invalid column name!, name='%s'\", name);\n ExceptionRef e = new SqlException(msg);\n Exception::setLast(e, false); \n }\n \n return rval;\n}\n\nvoid MySqlRow::setFields(\n MYSQL_FIELD* fields, unsigned int count, MYSQL_BIND* bindings)\n{\n mFields = fields;\n mFieldCount = count;\n mBindings = bindings;\n}\n\nbool MySqlRow::getType(unsigned int column, int& type)\n{\n bool rval = false;\n \n if(column >= mFieldCount)\n {\n char temp[100];\n snprintf(temp, 100,\n \"Could not get column type, invalid column index!,index=%i\", column);\n ExceptionRef e = new SqlException(temp);\n Exception::setLast(e, false);\n }\n else\n {\n type = mFields[column].type;\n rval = true;\n }\n \n return rval;\n}\n\nbool MySqlRow::getInt32(unsigned int column, int& i)\n{\n mBindings[column].buffer_type = MYSQL_TYPE_LONG;\n mBindings[column].buffer = (char*)&i;\n mBindings[column].buffer_length = 4;\n mBindings[column].length = &mBindings[column].buffer_length;\n mysql_stmt_fetch_column(getStatementHandle(), &mBindings[column], column, 0);\n \n \/\/ FIXME: check exceptions, etc\n return true;\n}\n\nbool MySqlRow::getUInt32(unsigned int column, unsigned int& i)\n{\n mBindings[column].buffer_type = MYSQL_TYPE_LONG;\n mBindings[column].buffer = (char*)&i;\n mBindings[column].buffer_length = 4;\n mBindings[column].length = &mBindings[column].buffer_length;\n mysql_stmt_fetch_column(getStatementHandle(), &mBindings[column], column, 0);\n \n \/\/ FIXME: check exceptions, etc\n return true;\n}\n\nbool MySqlRow::getInt64(unsigned int column, long long& i)\n{\n mBindings[column].buffer_type = MYSQL_TYPE_LONGLONG;\n mBindings[column].buffer = (char*)&i;\n mBindings[column].buffer_length = 8;\n mBindings[column].length = &mBindings[column].buffer_length;\n mysql_stmt_fetch_column(getStatementHandle(), &mBindings[column], column, 0);\n \n \/\/ FIXME: check exceptions, etc\n return true;\n}\n\nbool MySqlRow::getUInt64(unsigned int column, unsigned long long& i)\n{\n mBindings[column].buffer_type = MYSQL_TYPE_LONGLONG;\n mBindings[column].buffer = (char*)&i;\n mBindings[column].buffer_length = 8;\n mBindings[column].length = &mBindings[column].buffer_length;\n mysql_stmt_fetch_column(getStatementHandle(), &mBindings[column], column, 0);\n \n \/\/ FIXME: check exceptions, etc\n return true;\n}\n\nbool MySqlRow::getText(unsigned int column, string& str)\n{\n my_bool isNull;\n mBindings[column].buffer_type = MYSQL_TYPE_BLOB;\n char temp[mBindings[column].buffer_length + 1];\n mBindings[column].buffer = temp;\n mBindings[column].length = &mBindings[column].buffer_length;\n mBindings[column].is_null = &isNull;\n mysql_stmt_fetch_column(getStatementHandle(), &mBindings[column], column, 0);\n \n if(isNull)\n {\n str.erase();\n }\n else\n {\n temp[mBindings[column].buffer_length] = 0;\n str.assign(temp);\n }\n \n \/\/ FIXME: check exceptions, etc\n return true;\n}\n\nbool MySqlRow::getType(const char* column, int& type)\n{\n bool rval = false;\n \n \/\/ get column index for name\n long long index = getColumnIndex(column);\n if(index != -1)\n {\n rval = getType(index, type);\n }\n \n return rval;\n}\n\nbool MySqlRow::getInt32(const char* column, int& i)\n{\n bool rval = false;\n \n \/\/ get column index for name\n long long index = getColumnIndex(column);\n if(index != -1)\n {\n rval = getInt32(index, i);\n }\n \n return rval;\n}\n\nbool MySqlRow::getUInt32(const char* column, unsigned int& i)\n{\n bool rval = false;\n \n \/\/ get column index for name\n long long index = getColumnIndex(column);\n if(index != -1)\n {\n rval = getUInt32(index, i);\n }\n \n return rval;\n}\n\nbool MySqlRow::getInt64(const char* column, long long& i)\n{\n bool rval = false;\n \n \/\/ get column index for name\n long long index = getColumnIndex(column);\n if(index != -1)\n {\n rval = getInt64(index, i);\n }\n \n return rval;\n}\n\nbool MySqlRow::getUInt64(const char* column, unsigned long long& i)\n{\n bool rval = false;\n \n \/\/ get column index for name\n long long index = getColumnIndex(column);\n if(index != -1)\n {\n rval = getUInt64(index, i);\n }\n \n return rval;\n}\n\nbool MySqlRow::getText(const char* column, std::string& str)\n{\n bool rval = false;\n \n \/\/ get column index for name\n long long index = getColumnIndex(column);\n if(index != -1)\n {\n rval = getText(index, str);\n }\n \n return rval;\n}\n<|endoftext|>"} {"text":"<commit_before>\/\/Created by Daniel May\n\n#ifndef GRAPHICSNODE_H\n#define GRAPHICSNODE_H\n\n#include <Graphics.hpp>\n#include <vector>\n\nusing namespace std;\nusing namespace sf;\n\nclass renderList\n{\n\t\/\/Member variables\n\tprivate:\n\n\t\/\/A reference to the window where everything will be drawn\n\tRenderWindow &window;\n\n\t\/\/Vector to store all objects to be drawn\n\tvector<Drawable*> list;\n\t\n\n\tpublic:\n\t\n\t\/\/Declare member functions and constructor\/destructor\n\t\n\trenderList(sf::RenderWindow& win);\n\t~renderList();\n\n\t\n\tvoid addObject(Drawable& drawable);\n\tvoid addList(vector<Drawable*> drawableList);\n\t\n\tvoid removeObject(Drawable& drawable);\n\tvoid removeList(vector<Drawable*> drawableList);\n\n\tvoid removeAll();\n\t\n\tvoid render(Color background);\n\n};\n\n#endif\n<commit_msg>Delete renderList.hpp<commit_after><|endoftext|>"} {"text":"<commit_before>\/\/ Copyright (c) 2009 The Chromium Authors. All rights reserved.\n\/\/ Use of this source code is governed by a BSD-style license that can be\n\/\/ found in the LICENSE file.\n\n#include \"chrome\/browser\/views\/extensions\/extension_popup.h\"\n\n#include \"chrome\/browser\/browser.h\"\n#include \"chrome\/browser\/browser_list.h\"\n#include \"chrome\/browser\/browser_window.h\"\n#include \"chrome\/browser\/debugger\/devtools_manager.h\"\n#include \"chrome\/browser\/debugger\/devtools_toggle_action.h\"\n#include \"chrome\/browser\/extensions\/extension_host.h\"\n#include \"chrome\/browser\/extensions\/extension_process_manager.h\"\n#include \"chrome\/browser\/profile.h\"\n#include \"chrome\/browser\/renderer_host\/render_widget_host_view.h\"\n#include \"chrome\/browser\/renderer_host\/render_view_host.h\"\n#include \"chrome\/browser\/views\/frame\/browser_view.h\"\n#include \"chrome\/common\/extensions\/extension.h\"\n#include \"chrome\/common\/notification_details.h\"\n#include \"chrome\/common\/notification_source.h\"\n#include \"chrome\/common\/notification_type.h\"\n#include \"third_party\/skia\/include\/core\/SkColor.h\"\n#include \"views\/widget\/root_view.h\"\n#include \"views\/window\/window.h\"\n\n#if defined(OS_LINUX)\n#include \"views\/widget\/widget_gtk.h\"\n#endif\n\n#if defined(OS_CHROMEOS)\n#include \"chrome\/browser\/chromeos\/wm_ipc.h\"\n#include \"cros\/chromeos_wm_ipc_enums.h\"\n#endif\n\nusing views::Widget;\n\n\/\/ The minimum\/maximum dimensions of the popup.\n\/\/ The minimum is just a little larger than the size of the button itself.\n\/\/ The maximum is an arbitrary number that should be smaller than most screens.\nconst int ExtensionPopup::kMinWidth = 25;\nconst int ExtensionPopup::kMinHeight = 25;\nconst int ExtensionPopup::kMaxWidth = 800;\nconst int ExtensionPopup::kMaxHeight = 600;\n\nnamespace {\n\n\/\/ The width, in pixels, of the black-border on a popup.\nconst int kPopupBorderWidth = 1;\n\nconst int kPopupBubbleCornerRadius = BubbleBorder::GetCornerRadius() \/ 2;\n\n} \/\/ namespace\n\nExtensionPopup::ExtensionPopup(ExtensionHost* host,\n views::Widget* frame,\n const gfx::Rect& relative_to,\n BubbleBorder::ArrowLocation arrow_location,\n bool activate_on_show,\n bool inspect_with_devtools,\n PopupChrome chrome,\n Observer* observer)\n : BrowserBubble(host->view(),\n frame,\n gfx::Point(),\n RECTANGLE_CHROME == chrome), \/\/ If no bubble chrome is to\n \/\/ be displayed, then enable a\n \/\/ drop-shadow on the bubble\n \/\/ widget.\n relative_to_(relative_to),\n extension_host_(host),\n activate_on_show_(activate_on_show),\n inspect_with_devtools_(inspect_with_devtools),\n close_on_lost_focus_(true),\n closing_(false),\n border_widget_(NULL),\n border_(NULL),\n border_view_(NULL),\n popup_chrome_(chrome),\n observer_(observer),\n anchor_position_(arrow_location),\n instance_lifetime_(new InternalRefCounter()){\n AddRef(); \/\/ Balanced in Close();\n set_delegate(this);\n host->view()->SetContainer(this);\n\n \/\/ We wait to show the popup until the contained host finishes loading.\n registrar_.Add(this,\n NotificationType::EXTENSION_HOST_DID_STOP_LOADING,\n Source<Profile>(host->profile()));\n\n \/\/ Listen for the containing view calling window.close();\n registrar_.Add(this, NotificationType::EXTENSION_HOST_VIEW_SHOULD_CLOSE,\n Source<Profile>(host->profile()));\n\n \/\/ TODO(erikkay) Some of this border code is derived from InfoBubble.\n \/\/ We should see if we can unify these classes.\n\n \/\/ Keep relative_to_ in frame-relative coordinates to aid in drag\n \/\/ positioning.\n gfx::Point origin = relative_to_.origin();\n views::View::ConvertPointToView(NULL, frame_->GetRootView(), &origin);\n relative_to_.set_origin(origin);\n\n \/\/ The bubble chrome requires a separate window, so construct it here.\n if (BUBBLE_CHROME == popup_chrome_) {\n gfx::NativeView native_window = frame->GetNativeView();\n#if defined(OS_LINUX)\n border_widget_ = new views::WidgetGtk(views::WidgetGtk::TYPE_WINDOW);\n static_cast<views::WidgetGtk*>(border_widget_)->MakeTransparent();\n static_cast<views::WidgetGtk*>(border_widget_)->make_transient_to_parent();\n#else\n border_widget_ = Widget::CreatePopupWidget(Widget::Transparent,\n Widget::NotAcceptEvents,\n Widget::DeleteOnDestroy,\n Widget::MirrorOriginInRTL);\n#endif\n border_widget_->Init(native_window, bounds());\n#if defined(OS_CHROMEOS)\n chromeos::WmIpc::instance()->SetWindowType(\n border_widget_->GetNativeView(),\n chromeos::WM_IPC_WINDOW_CHROME_INFO_BUBBLE,\n NULL);\n#endif\n border_ = new BubbleBorder(arrow_location);\n border_view_ = new views::View;\n border_view_->set_background(new BubbleBackground(border_));\n\n border_view_->set_border(border_);\n border_widget_->SetContentsView(border_view_);\n \/\/ Ensure that the popup contents are always displayed ontop of the border\n \/\/ widget.\n border_widget_->MoveAbove(popup_);\n } else {\n \/\/ Otherwise simply set a black-border on the view containing the popup\n \/\/ extension view.\n views::Border* border = views::Border::CreateSolidBorder(kPopupBorderWidth,\n SK_ColorBLACK);\n view()->set_border(border);\n }\n}\n\nExtensionPopup::~ExtensionPopup() {\n \/\/ The widget is set to delete on destroy, so no leak here.\n if (border_widget_)\n border_widget_->Close();\n}\n\nvoid ExtensionPopup::SetArrowPosition(\n BubbleBorder::ArrowLocation arrow_location) {\n DCHECK_NE(BubbleBorder::NONE, arrow_location) <<\n \"Extension popups must be positioned relative to an arrow.\";\n\n anchor_position_ = arrow_location;\n if (border_)\n border_->set_arrow_location(anchor_position_);\n}\n\nvoid ExtensionPopup::Hide() {\n BrowserBubble::Hide();\n if (border_widget_)\n border_widget_->Hide();\n}\n\nvoid ExtensionPopup::Show(bool activate) {\n if (visible())\n return;\n\n#if defined(OS_WIN)\n if (frame_->GetWindow())\n frame_->GetWindow()->DisableInactiveRendering();\n#endif\n\n ResizeToView();\n\n \/\/ Show the border first, then the popup overlaid on top.\n if (border_widget_)\n border_widget_->Show();\n BrowserBubble::Show(activate);\n}\n\nvoid ExtensionPopup::ResizeToView() {\n if (observer_)\n observer_->ExtensionPopupResized(this);\n\n gfx::Rect rect = GetOuterBounds();\n\n gfx::Point origin = rect.origin();\n views::View::ConvertPointToView(NULL, frame_->GetRootView(), &origin);\n\n if (border_widget_) {\n \/\/ Set the bubble-chrome widget according to the outer bounds of the entire\n \/\/ popup.\n border_widget_->SetBounds(rect);\n\n \/\/ Now calculate the inner bounds. This is a bit more convoluted than\n \/\/ it should be because BrowserBubble coordinates are in Browser coordinates\n \/\/ while |rect| is in screen coordinates.\n gfx::Insets border_insets;\n border_->GetInsets(&border_insets);\n\n origin.set_x(origin.x() + border_insets.left() + kPopupBubbleCornerRadius);\n origin.set_y(origin.y() + border_insets.top() + kPopupBubbleCornerRadius);\n\n gfx::Size new_size = view()->size();\n SetBounds(origin.x(), origin.y(), new_size.width(), new_size.height());\n } else {\n SetBounds(origin.x(), origin.y(), rect.width(), rect.height());\n }\n}\n\nvoid ExtensionPopup::BubbleBrowserWindowMoved(BrowserBubble* bubble) {\n ResizeToView();\n}\n\nvoid ExtensionPopup::BubbleBrowserWindowClosing(BrowserBubble* bubble) {\n if (!closing_)\n Close();\n}\n\nvoid ExtensionPopup::BubbleGotFocus(BrowserBubble* bubble) {\n \/\/ Forward the focus to the renderer.\n host()->render_view_host()->view()->Focus();\n}\n\nvoid ExtensionPopup::BubbleLostFocus(BrowserBubble* bubble,\n bool lost_focus_to_child) {\n if (closing_ || \/\/ We are already closing.\n inspect_with_devtools_ || \/\/ The popup is being inspected.\n !close_on_lost_focus_ || \/\/ Our client is handling focus listening.\n lost_focus_to_child) \/\/ A child of this view got focus.\n return;\n\n \/\/ When we do close on BubbleLostFocus, we do it in the next event loop\n \/\/ because a subsequent event in this loop may also want to close this popup\n \/\/ and if so, we want to allow that. Example: Clicking the same browser\n \/\/ action button that opened the popup. If we closed immediately, the\n \/\/ browser action container would fail to discover that the same button\n \/\/ was pressed.\n MessageLoop::current()->PostTask(FROM_HERE, NewRunnableMethod(this,\n &ExtensionPopup::Close));\n}\n\n\nvoid ExtensionPopup::Observe(NotificationType type,\n const NotificationSource& source,\n const NotificationDetails& details) {\n switch (type.value) {\n case NotificationType::EXTENSION_HOST_DID_STOP_LOADING:\n \/\/ Once we receive did stop loading, the content will be complete and\n \/\/ the width will have been computed. Now it's safe to show.\n if (extension_host_.get() == Details<ExtensionHost>(details).ptr()) {\n Show(activate_on_show_);\n\n if (inspect_with_devtools_) {\n \/\/ Listen for the the devtools window closing.\n registrar_.Add(this, NotificationType::DEVTOOLS_WINDOW_CLOSING,\n Source<Profile>(extension_host_->profile()));\n DevToolsManager::GetInstance()->ToggleDevToolsWindow(\n extension_host_->render_view_host(),\n DEVTOOLS_TOGGLE_ACTION_SHOW_CONSOLE);\n }\n }\n break;\n case NotificationType::EXTENSION_HOST_VIEW_SHOULD_CLOSE:\n \/\/ If we aren't the host of the popup, then disregard the notification.\n if (Details<ExtensionHost>(host()) != details)\n return;\n Close();\n\n break;\n case NotificationType::DEVTOOLS_WINDOW_CLOSING:\n \/\/ Make sure its the devtools window that inspecting our popup.\n if (Details<RenderViewHost>(extension_host_->render_view_host()) !=\n details)\n return;\n\n \/\/ If the devtools window is closing, we post a task to ourselves to\n \/\/ close the popup. This gives the devtools window a chance to finish\n \/\/ detaching from the inspected RenderViewHost.\n MessageLoop::current()->PostTask(FROM_HERE, NewRunnableMethod(this,\n &ExtensionPopup::Close));\n\n break;\n default:\n NOTREACHED() << L\"Received unexpected notification\";\n }\n}\n\nvoid ExtensionPopup::OnExtensionPreferredSizeChanged(ExtensionView* view) {\n \/\/ Constrain the size to popup min\/max.\n gfx::Size sz = view->GetPreferredSize();\n view->SetBounds(view->x(), view->y(),\n std::max(kMinWidth, std::min(kMaxWidth, sz.width())),\n std::max(kMinHeight, std::min(kMaxHeight, sz.height())));\n\n \/\/ If popup_chrome_ == RECTANGLE_CHROME, the border is drawn in the client\n \/\/ area of the ExtensionView, rather than in a window which sits behind it.\n \/\/ In this case, the actual size of the view must be enlarged so that the\n \/\/ web contents portion of the view gets its full PreferredSize area.\n if (view->border()) {\n gfx::Insets border_insets;\n view->border()->GetInsets(&border_insets);\n\n gfx::Rect bounds(view->bounds());\n gfx::Size size(bounds.size());\n size.Enlarge(border_insets.width(), border_insets.height());\n view->SetBounds(bounds.x(), bounds.y(), size.width(), size.height());\n }\n\n ResizeToView();\n}\n\ngfx::Rect ExtensionPopup::GetOuterBounds() const {\n gfx::Rect relative_rect = relative_to_;\n gfx::Point origin = relative_rect.origin();\n views::View::ConvertPointToScreen(frame_->GetRootView(), &origin);\n relative_rect.set_origin(origin);\n\n gfx::Size contents_size = view()->size();\n\n \/\/ If the popup has a bubble-chrome, then let the BubbleBorder compute\n \/\/ the bounds.\n if (BUBBLE_CHROME == popup_chrome_) {\n \/\/ The rounded corners cut off more of the view than the border insets\n \/\/ claim. Since we can't clip the ExtensionView's corners, we need to\n \/\/ increase the inset by half the corner radius as well as lying about the\n \/\/ size of the contents size to compensate.\n contents_size.Enlarge(2 * kPopupBubbleCornerRadius,\n 2 * kPopupBubbleCornerRadius);\n return border_->GetBounds(relative_rect, contents_size);\n }\n\n \/\/ Position the bounds according to the location of the |anchor_position_|.\n int y;\n if (BubbleBorder::is_arrow_on_top(anchor_position_))\n y = relative_rect.bottom();\n else\n y = relative_rect.y() - contents_size.height();\n\n int x;\n if (BubbleBorder::is_arrow_on_left(anchor_position_))\n x = relative_rect.x();\n else\n \/\/ Note that if the arrow is on the right, that the x position of the popup\n \/\/ is assigned so that the rightmost edge of the popup is aligned with the\n \/\/ rightmost edge of the relative region.\n x = relative_rect.right() - contents_size.width();\n\n return gfx::Rect(x, y, contents_size.width(), contents_size.height());\n}\n\n\/\/ static\nExtensionPopup* ExtensionPopup::Show(\n const GURL& url,\n Browser* browser,\n Profile* profile,\n gfx::NativeWindow frame_window,\n const gfx::Rect& relative_to,\n BubbleBorder::ArrowLocation arrow_location,\n bool activate_on_show,\n bool inspect_with_devtools,\n PopupChrome chrome,\n Observer* observer) {\n DCHECK(profile);\n DCHECK(frame_window);\n ExtensionProcessManager* manager = profile->GetExtensionProcessManager();\n DCHECK(manager);\n if (!manager)\n return NULL;\n\n \/\/ If no Browser instance was given, attempt to look up one matching the given\n \/\/ profile.\n if (!browser)\n browser = BrowserList::FindBrowserWithProfile(profile);\n\n Widget* frame_widget = Widget::GetWidgetFromNativeWindow(frame_window);\n DCHECK(frame_widget);\n if (!frame_widget)\n return NULL;\n\n ExtensionHost* host = manager->CreatePopup(url, browser);\n if (observer)\n observer->ExtensionHostCreated(host);\n\n ExtensionPopup* popup = new ExtensionPopup(host, frame_widget, relative_to,\n arrow_location, activate_on_show,\n inspect_with_devtools, chrome,\n observer);\n\n \/\/ If the host had somehow finished loading, then we'd miss the notification\n \/\/ and not show. This seems to happen in single-process mode.\n if (host->did_stop_loading())\n popup->Show(activate_on_show);\n\n return popup;\n}\n\nvoid ExtensionPopup::Close() {\n if (closing_)\n return;\n closing_ = true;\n DetachFromBrowser();\n\n if (observer_)\n observer_->ExtensionPopupIsClosing(this);\n\n Release(); \/\/ Balanced in ctor.\n}\n\nvoid ExtensionPopup::Release() {\n bool final_release = instance_lifetime_->HasOneRef();\n instance_lifetime_->Release();\n if (final_release) {\n DCHECK(closing_) << \"ExtensionPopup to be destroyed before being closed.\";\n ExtensionPopup::Observer* observer = observer_;\n delete this;\n\n if (observer)\n observer->ExtensionPopupClosed(this);\n }\n}\n<commit_msg>Explain in a comment what was explained in the review, so that people who look at the code don't cringe.<commit_after>\/\/ Copyright (c) 2009 The Chromium Authors. All rights reserved.\n\/\/ Use of this source code is governed by a BSD-style license that can be\n\/\/ found in the LICENSE file.\n\n#include \"chrome\/browser\/views\/extensions\/extension_popup.h\"\n\n#include \"chrome\/browser\/browser.h\"\n#include \"chrome\/browser\/browser_list.h\"\n#include \"chrome\/browser\/browser_window.h\"\n#include \"chrome\/browser\/debugger\/devtools_manager.h\"\n#include \"chrome\/browser\/debugger\/devtools_toggle_action.h\"\n#include \"chrome\/browser\/extensions\/extension_host.h\"\n#include \"chrome\/browser\/extensions\/extension_process_manager.h\"\n#include \"chrome\/browser\/profile.h\"\n#include \"chrome\/browser\/renderer_host\/render_widget_host_view.h\"\n#include \"chrome\/browser\/renderer_host\/render_view_host.h\"\n#include \"chrome\/browser\/views\/frame\/browser_view.h\"\n#include \"chrome\/common\/extensions\/extension.h\"\n#include \"chrome\/common\/notification_details.h\"\n#include \"chrome\/common\/notification_source.h\"\n#include \"chrome\/common\/notification_type.h\"\n#include \"third_party\/skia\/include\/core\/SkColor.h\"\n#include \"views\/widget\/root_view.h\"\n#include \"views\/window\/window.h\"\n\n#if defined(OS_LINUX)\n#include \"views\/widget\/widget_gtk.h\"\n#endif\n\n#if defined(OS_CHROMEOS)\n#include \"chrome\/browser\/chromeos\/wm_ipc.h\"\n#include \"cros\/chromeos_wm_ipc_enums.h\"\n#endif\n\nusing views::Widget;\n\n\/\/ The minimum\/maximum dimensions of the popup.\n\/\/ The minimum is just a little larger than the size of the button itself.\n\/\/ The maximum is an arbitrary number that should be smaller than most screens.\nconst int ExtensionPopup::kMinWidth = 25;\nconst int ExtensionPopup::kMinHeight = 25;\nconst int ExtensionPopup::kMaxWidth = 800;\nconst int ExtensionPopup::kMaxHeight = 600;\n\nnamespace {\n\n\/\/ The width, in pixels, of the black-border on a popup.\nconst int kPopupBorderWidth = 1;\n\nconst int kPopupBubbleCornerRadius = BubbleBorder::GetCornerRadius() \/ 2;\n\n} \/\/ namespace\n\nExtensionPopup::ExtensionPopup(ExtensionHost* host,\n views::Widget* frame,\n const gfx::Rect& relative_to,\n BubbleBorder::ArrowLocation arrow_location,\n bool activate_on_show,\n bool inspect_with_devtools,\n PopupChrome chrome,\n Observer* observer)\n : BrowserBubble(host->view(),\n frame,\n gfx::Point(),\n RECTANGLE_CHROME == chrome), \/\/ If no bubble chrome is to\n \/\/ be displayed, then enable a\n \/\/ drop-shadow on the bubble\n \/\/ widget.\n relative_to_(relative_to),\n extension_host_(host),\n activate_on_show_(activate_on_show),\n inspect_with_devtools_(inspect_with_devtools),\n close_on_lost_focus_(true),\n closing_(false),\n border_widget_(NULL),\n border_(NULL),\n border_view_(NULL),\n popup_chrome_(chrome),\n observer_(observer),\n anchor_position_(arrow_location),\n instance_lifetime_(new InternalRefCounter()){\n AddRef(); \/\/ Balanced in Close();\n set_delegate(this);\n host->view()->SetContainer(this);\n\n \/\/ We wait to show the popup until the contained host finishes loading.\n registrar_.Add(this,\n NotificationType::EXTENSION_HOST_DID_STOP_LOADING,\n Source<Profile>(host->profile()));\n\n \/\/ Listen for the containing view calling window.close();\n registrar_.Add(this, NotificationType::EXTENSION_HOST_VIEW_SHOULD_CLOSE,\n Source<Profile>(host->profile()));\n\n \/\/ TODO(erikkay) Some of this border code is derived from InfoBubble.\n \/\/ We should see if we can unify these classes.\n\n \/\/ Keep relative_to_ in frame-relative coordinates to aid in drag\n \/\/ positioning.\n gfx::Point origin = relative_to_.origin();\n views::View::ConvertPointToView(NULL, frame_->GetRootView(), &origin);\n relative_to_.set_origin(origin);\n\n \/\/ The bubble chrome requires a separate window, so construct it here.\n if (BUBBLE_CHROME == popup_chrome_) {\n gfx::NativeView native_window = frame->GetNativeView();\n#if defined(OS_LINUX)\n border_widget_ = new views::WidgetGtk(views::WidgetGtk::TYPE_WINDOW);\n static_cast<views::WidgetGtk*>(border_widget_)->MakeTransparent();\n static_cast<views::WidgetGtk*>(border_widget_)->make_transient_to_parent();\n#else\n border_widget_ = Widget::CreatePopupWidget(Widget::Transparent,\n Widget::NotAcceptEvents,\n Widget::DeleteOnDestroy,\n Widget::MirrorOriginInRTL);\n#endif\n border_widget_->Init(native_window, bounds());\n#if defined(OS_CHROMEOS)\n chromeos::WmIpc::instance()->SetWindowType(\n border_widget_->GetNativeView(),\n chromeos::WM_IPC_WINDOW_CHROME_INFO_BUBBLE,\n NULL);\n#endif\n border_ = new BubbleBorder(arrow_location);\n border_view_ = new views::View;\n border_view_->set_background(new BubbleBackground(border_));\n\n border_view_->set_border(border_);\n border_widget_->SetContentsView(border_view_);\n \/\/ Ensure that the popup contents are always displayed ontop of the border\n \/\/ widget.\n border_widget_->MoveAbove(popup_);\n } else {\n \/\/ Otherwise simply set a black-border on the view containing the popup\n \/\/ extension view.\n views::Border* border = views::Border::CreateSolidBorder(kPopupBorderWidth,\n SK_ColorBLACK);\n view()->set_border(border);\n }\n}\n\nExtensionPopup::~ExtensionPopup() {\n \/\/ The widget is set to delete on destroy, so no leak here.\n if (border_widget_)\n border_widget_->Close();\n}\n\nvoid ExtensionPopup::SetArrowPosition(\n BubbleBorder::ArrowLocation arrow_location) {\n DCHECK_NE(BubbleBorder::NONE, arrow_location) <<\n \"Extension popups must be positioned relative to an arrow.\";\n\n anchor_position_ = arrow_location;\n if (border_)\n border_->set_arrow_location(anchor_position_);\n}\n\nvoid ExtensionPopup::Hide() {\n BrowserBubble::Hide();\n if (border_widget_)\n border_widget_->Hide();\n}\n\nvoid ExtensionPopup::Show(bool activate) {\n if (visible())\n return;\n\n#if defined(OS_WIN)\n if (frame_->GetWindow())\n frame_->GetWindow()->DisableInactiveRendering();\n#endif\n\n ResizeToView();\n\n \/\/ Show the border first, then the popup overlaid on top.\n if (border_widget_)\n border_widget_->Show();\n BrowserBubble::Show(activate);\n}\n\nvoid ExtensionPopup::ResizeToView() {\n if (observer_)\n observer_->ExtensionPopupResized(this);\n\n gfx::Rect rect = GetOuterBounds();\n\n gfx::Point origin = rect.origin();\n views::View::ConvertPointToView(NULL, frame_->GetRootView(), &origin);\n\n if (border_widget_) {\n \/\/ Set the bubble-chrome widget according to the outer bounds of the entire\n \/\/ popup.\n border_widget_->SetBounds(rect);\n\n \/\/ Now calculate the inner bounds. This is a bit more convoluted than\n \/\/ it should be because BrowserBubble coordinates are in Browser coordinates\n \/\/ while |rect| is in screen coordinates.\n gfx::Insets border_insets;\n border_->GetInsets(&border_insets);\n\n origin.set_x(origin.x() + border_insets.left() + kPopupBubbleCornerRadius);\n origin.set_y(origin.y() + border_insets.top() + kPopupBubbleCornerRadius);\n\n gfx::Size new_size = view()->size();\n SetBounds(origin.x(), origin.y(), new_size.width(), new_size.height());\n } else {\n SetBounds(origin.x(), origin.y(), rect.width(), rect.height());\n }\n}\n\nvoid ExtensionPopup::BubbleBrowserWindowMoved(BrowserBubble* bubble) {\n ResizeToView();\n}\n\nvoid ExtensionPopup::BubbleBrowserWindowClosing(BrowserBubble* bubble) {\n if (!closing_)\n Close();\n}\n\nvoid ExtensionPopup::BubbleGotFocus(BrowserBubble* bubble) {\n \/\/ Forward the focus to the renderer.\n host()->render_view_host()->view()->Focus();\n}\n\nvoid ExtensionPopup::BubbleLostFocus(BrowserBubble* bubble,\n bool lost_focus_to_child) {\n if (closing_ || \/\/ We are already closing.\n inspect_with_devtools_ || \/\/ The popup is being inspected.\n !close_on_lost_focus_ || \/\/ Our client is handling focus listening.\n lost_focus_to_child) \/\/ A child of this view got focus.\n return;\n\n \/\/ When we do close on BubbleLostFocus, we do it in the next event loop\n \/\/ because a subsequent event in this loop may also want to close this popup\n \/\/ and if so, we want to allow that. Example: Clicking the same browser\n \/\/ action button that opened the popup. If we closed immediately, the\n \/\/ browser action container would fail to discover that the same button\n \/\/ was pressed.\n MessageLoop::current()->PostTask(FROM_HERE, NewRunnableMethod(this,\n &ExtensionPopup::Close));\n}\n\n\nvoid ExtensionPopup::Observe(NotificationType type,\n const NotificationSource& source,\n const NotificationDetails& details) {\n switch (type.value) {\n case NotificationType::EXTENSION_HOST_DID_STOP_LOADING:\n \/\/ Once we receive did stop loading, the content will be complete and\n \/\/ the width will have been computed. Now it's safe to show.\n if (extension_host_.get() == Details<ExtensionHost>(details).ptr()) {\n Show(activate_on_show_);\n\n if (inspect_with_devtools_) {\n \/\/ Listen for the the devtools window closing.\n registrar_.Add(this, NotificationType::DEVTOOLS_WINDOW_CLOSING,\n Source<Profile>(extension_host_->profile()));\n DevToolsManager::GetInstance()->ToggleDevToolsWindow(\n extension_host_->render_view_host(),\n DEVTOOLS_TOGGLE_ACTION_SHOW_CONSOLE);\n }\n }\n break;\n case NotificationType::EXTENSION_HOST_VIEW_SHOULD_CLOSE:\n \/\/ If we aren't the host of the popup, then disregard the notification.\n if (Details<ExtensionHost>(host()) != details)\n return;\n Close();\n\n break;\n case NotificationType::DEVTOOLS_WINDOW_CLOSING:\n \/\/ Make sure its the devtools window that inspecting our popup.\n if (Details<RenderViewHost>(extension_host_->render_view_host()) !=\n details)\n return;\n\n \/\/ If the devtools window is closing, we post a task to ourselves to\n \/\/ close the popup. This gives the devtools window a chance to finish\n \/\/ detaching from the inspected RenderViewHost.\n MessageLoop::current()->PostTask(FROM_HERE, NewRunnableMethod(this,\n &ExtensionPopup::Close));\n\n break;\n default:\n NOTREACHED() << L\"Received unexpected notification\";\n }\n}\n\nvoid ExtensionPopup::OnExtensionPreferredSizeChanged(ExtensionView* view) {\n \/\/ Constrain the size to popup min\/max.\n gfx::Size sz = view->GetPreferredSize();\n view->SetBounds(view->x(), view->y(),\n std::max(kMinWidth, std::min(kMaxWidth, sz.width())),\n std::max(kMinHeight, std::min(kMaxHeight, sz.height())));\n\n \/\/ If popup_chrome_ == RECTANGLE_CHROME, the border is drawn in the client\n \/\/ area of the ExtensionView, rather than in a window which sits behind it.\n \/\/ In this case, the actual size of the view must be enlarged so that the\n \/\/ web contents portion of the view gets its full PreferredSize area.\n if (view->border()) {\n gfx::Insets border_insets;\n view->border()->GetInsets(&border_insets);\n\n gfx::Rect bounds(view->bounds());\n gfx::Size size(bounds.size());\n size.Enlarge(border_insets.width(), border_insets.height());\n view->SetBounds(bounds.x(), bounds.y(), size.width(), size.height());\n }\n\n ResizeToView();\n}\n\ngfx::Rect ExtensionPopup::GetOuterBounds() const {\n gfx::Rect relative_rect = relative_to_;\n gfx::Point origin = relative_rect.origin();\n views::View::ConvertPointToScreen(frame_->GetRootView(), &origin);\n relative_rect.set_origin(origin);\n\n gfx::Size contents_size = view()->size();\n\n \/\/ If the popup has a bubble-chrome, then let the BubbleBorder compute\n \/\/ the bounds.\n if (BUBBLE_CHROME == popup_chrome_) {\n \/\/ The rounded corners cut off more of the view than the border insets\n \/\/ claim. Since we can't clip the ExtensionView's corners, we need to\n \/\/ increase the inset by half the corner radius as well as lying about the\n \/\/ size of the contents size to compensate.\n contents_size.Enlarge(2 * kPopupBubbleCornerRadius,\n 2 * kPopupBubbleCornerRadius);\n return border_->GetBounds(relative_rect, contents_size);\n }\n\n \/\/ Position the bounds according to the location of the |anchor_position_|.\n int y;\n if (BubbleBorder::is_arrow_on_top(anchor_position_))\n y = relative_rect.bottom();\n else\n y = relative_rect.y() - contents_size.height();\n\n int x;\n if (BubbleBorder::is_arrow_on_left(anchor_position_))\n x = relative_rect.x();\n else\n \/\/ Note that if the arrow is on the right, that the x position of the popup\n \/\/ is assigned so that the rightmost edge of the popup is aligned with the\n \/\/ rightmost edge of the relative region.\n x = relative_rect.right() - contents_size.width();\n\n return gfx::Rect(x, y, contents_size.width(), contents_size.height());\n}\n\n\/\/ static\nExtensionPopup* ExtensionPopup::Show(\n const GURL& url,\n Browser* browser,\n Profile* profile,\n gfx::NativeWindow frame_window,\n const gfx::Rect& relative_to,\n BubbleBorder::ArrowLocation arrow_location,\n bool activate_on_show,\n bool inspect_with_devtools,\n PopupChrome chrome,\n Observer* observer) {\n DCHECK(profile);\n DCHECK(frame_window);\n ExtensionProcessManager* manager = profile->GetExtensionProcessManager();\n DCHECK(manager);\n if (!manager)\n return NULL;\n\n \/\/ If no Browser instance was given, attempt to look up one matching the given\n \/\/ profile.\n if (!browser)\n browser = BrowserList::FindBrowserWithProfile(profile);\n\n Widget* frame_widget = Widget::GetWidgetFromNativeWindow(frame_window);\n DCHECK(frame_widget);\n if (!frame_widget)\n return NULL;\n\n ExtensionHost* host = manager->CreatePopup(url, browser);\n if (observer)\n observer->ExtensionHostCreated(host);\n\n ExtensionPopup* popup = new ExtensionPopup(host, frame_widget, relative_to,\n arrow_location, activate_on_show,\n inspect_with_devtools, chrome,\n observer);\n\n \/\/ If the host had somehow finished loading, then we'd miss the notification\n \/\/ and not show. This seems to happen in single-process mode.\n if (host->did_stop_loading())\n popup->Show(activate_on_show);\n\n return popup;\n}\n\nvoid ExtensionPopup::Close() {\n if (closing_)\n return;\n closing_ = true;\n DetachFromBrowser();\n\n if (observer_)\n observer_->ExtensionPopupIsClosing(this);\n\n Release(); \/\/ Balanced in ctor.\n}\n\nvoid ExtensionPopup::Release() {\n bool final_release = instance_lifetime_->HasOneRef();\n instance_lifetime_->Release();\n if (final_release) {\n DCHECK(closing_) << \"ExtensionPopup to be destroyed before being closed.\";\n ExtensionPopup::Observer* observer = observer_;\n delete this;\n\n \/\/ |this| is passed only as a 'cookie'. The observer API explicitly takes a\n \/\/ void* argument to emphasize this.\n if (observer)\n observer->ExtensionPopupClosed(this);\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 src\/service\/sockets\/SocketManager.cpp\n * @author Lukasz Wojciechowski <l.wojciechow@partner.samsung.com>\n * @author Adam Malinowski <a.malinowsk2@partner.samsung.com>\n * @version 1.0\n * @brief This file implements socket layer manager for cynara\n *\/\n\n#include <errno.h>\n#include <fcntl.h>\n#include <memory>\n#include <signal.h>\n#include <sys\/select.h>\n#include <sys\/signalfd.h>\n#include <sys\/socket.h>\n#include <sys\/stat.h>\n#include <sys\/types.h>\n#include <sys\/un.h>\n#include <unistd.h>\n\n#include <systemd\/sd-daemon.h>\n\n#include <log\/log.h>\n#include <common.h>\n#include <config\/PathConfig.h>\n#include <exceptions\/DescriptorNotExistsException.h>\n#include <exceptions\/InitException.h>\n#include <exceptions\/UnexpectedErrorException.h>\n\n#include <logic\/Logic.h>\n#include <main\/Cynara.h>\n#include <protocol\/ProtocolAdmin.h>\n#include <protocol\/ProtocolAgent.h>\n#include <protocol\/ProtocolClient.h>\n#include <protocol\/ProtocolSignal.h>\n#include <request\/pointers.h>\n#include <request\/RequestContext.h>\n#include <stdexcept>\n\n#include \"SocketManager.h\"\n\nnamespace Cynara {\n\nSocketManager::SocketManager() : m_working(false), m_maxDesc(-1) {\n FD_ZERO(&m_readSet);\n FD_ZERO(&m_writeSet);\n}\n\nSocketManager::~SocketManager() {\n}\n\nvoid SocketManager::run(void) {\n init();\n mainLoop();\n}\n\nvoid SocketManager::init(void) {\n LOGI(\"SocketManger init start\");\n const mode_t clientSocketUMask(0);\n const mode_t adminSocketUMask(0077);\n const mode_t agentSocketUMask(0);\n\n createDomainSocket(std::make_shared<ProtocolClient>(), PathConfig::SocketPath::client,\n clientSocketUMask, true);\n createDomainSocket(std::make_shared<ProtocolAdmin>(), PathConfig::SocketPath::admin,\n adminSocketUMask, false);\n createDomainSocket(std::make_shared<ProtocolAgent>(), PathConfig::SocketPath::agent,\n agentSocketUMask, false);\n createSignalSocket(std::make_shared<ProtocolSignal>());\n LOGI(\"SocketManger init done\");\n}\n\nvoid SocketManager::mainLoop(void) {\n LOGI(\"SocketManger mainLoop start\");\n m_working = true;\n while (m_working) {\n fd_set readSet = m_readSet;\n fd_set writeSet = m_writeSet;\n\n int ret = select(m_maxDesc + 1, &readSet, &writeSet, nullptr, nullptr);\n\n if (ret < 0) {\n switch (errno) {\n case EINTR:\n continue;\n default:\n int err = errno;\n throw UnexpectedErrorException(err, strerror(err));\n }\n } else if (ret > 0) {\n for (int i = 0; i < m_maxDesc + 1 && ret; ++i) {\n if (FD_ISSET(i, &readSet)) {\n readyForRead(i);\n --ret;\n }\n if (FD_ISSET(i, &writeSet)) {\n readyForWrite(i);\n --ret;\n }\n if (m_fds[i].isUsed() && m_fds[i].hasDataToWrite())\n addWriteSocket(i);\n }\n }\n }\n LOGI(\"SocketManger mainLoop done\");\n}\n\nvoid SocketManager::mainLoopStop(void) {\n m_working = false;\n}\n\nvoid SocketManager::readyForRead(int fd) {\n LOGD(\"SocketManger readyForRead on fd [%d] start\", fd);\n auto &desc = m_fds[fd];\n if (desc.isListen()) {\n readyForAccept(fd);\n return;\n }\n\n RawBuffer readBuffer(DEFAULT_BUFFER_SIZE);\n ssize_t size = read(fd, readBuffer.data(), DEFAULT_BUFFER_SIZE);\n\n if (size > 0) {\n LOGD(\"read [%zd] bytes\", size);\n readBuffer.resize(size);\n if (handleRead(fd, readBuffer)) {\n LOGD(\"SocketManger readyForRead on fd [%d] successfully done\", fd);\n return;\n }\n LOGI(\"interpreting buffer read from [%d] failed\", fd);\n } else if (size < 0) {\n int err = errno;\n switch (err) {\n case EAGAIN:\n#if EWOULDBLOCK != EAGAIN\n case EWOULDBLOCK:\n#endif\n case EINTR:\n return;\n default:\n LOGW(\"While reading from [%d] socket, error [%d]:<%s>\",\n fd, err, strerror(err));\n }\n } else {\n LOGN(\"Socket [%d] closed on other end\", fd);\n }\n closeSocket(fd);\n LOGD(\"SocketManger readyForRead on fd [%d] done\", fd);\n}\n\nvoid SocketManager::readyForWrite(int fd) {\n LOGD(\"SocketManger readyForWrite on fd [%d] start\", fd);\n auto &desc = m_fds[fd];\n auto &buffer = desc.prepareWriteBuffer();\n size_t size = buffer.size();\n ssize_t result = write(fd, buffer.data(), size);\n if (result == -1) {\n int err = errno;\n switch (err) {\n case EAGAIN:\n case EINTR:\n \/\/ select will trigger write once again, nothing to do\n break;\n case EPIPE:\n default:\n LOGD(\"Error during write to fd [%d]:<%s> \", fd, strerror(err));\n closeSocket(fd);\n break;\n }\n return; \/\/ We do not want to propagate error to next layer\n }\n\n LOGD(\"written [%zd] bytes\", result);\n buffer.erase(buffer.begin(), buffer.begin() + result);\n\n if (buffer.empty())\n removeWriteSocket(fd);\n LOGD(\"SocketManger readyForWrite on fd [%d] done\", fd);\n}\n\nvoid SocketManager::readyForAccept(int fd) {\n LOGD(\"SocketManger readyForAccept on fd [%d] start\", fd);\n struct sockaddr_un clientAddr;\n unsigned int clientLen = sizeof(clientAddr);\n int clientFd = accept4(fd, (struct sockaddr*) &clientAddr, &clientLen, SOCK_NONBLOCK);\n if (clientFd == -1) {\n int err = errno;\n LOGW(\"Error in accept on socket [%d]: <%s>\", fd, strerror(err));\n return;\n }\n LOGD(\"Accept on sock [%d]. New client socket opened [%d]\", fd, clientFd);\n\n auto &desc = createDescriptor(clientFd, m_fds[fd].isClient());\n desc.setListen(false);\n desc.setProtocol(m_fds[fd].protocol()->clone());\n addReadSocket(clientFd);\n LOGD(\"SocketManger readyForAccept on fd [%d] done\", fd);\n}\n\nvoid SocketManager::closeSocket(int fd) {\n LOGD(\"SocketManger closeSocket fd [%d] start\", fd);\n Descriptor &desc = m_fds[fd];\n requestTaker()->contextClosed(std::make_shared<RequestContext>(nullptr,\n desc.writeQueue()));\n removeReadSocket(fd);\n removeWriteSocket(fd);\n desc.clear();\n close(fd);\n LOGD(\"SocketManger closeSocket fd [%d] done\", fd);\n}\n\nbool SocketManager::handleRead(int fd, const RawBuffer &readbuffer) {\n LOGD(\"SocketManger handleRead on fd [%d] start\", fd);\n auto &desc = m_fds[fd];\n desc.pushReadBuffer(readbuffer);\n\n try {\n while(true) {\n \/\/try extract request from binary data received on socket\n auto req = desc.extractRequest();\n if (!req) \/\/ not enough data to build request yet\n break;\n LOGD(\"request extracted\");\n\n \/\/build context\n auto context = std::make_shared<RequestContext>(desc.responseTaker(),\n desc.writeQueue());\n \/\/pass request to request taker\n req->execute(req, requestTaker(), context);\n }\n } catch (const Exception &ex) {\n LOGE(\"Error handling request <%s>. Closing socket\", ex.what());\n return false;\n }\n LOGD(\"SocketManger handleRead on fd [%d] done\", fd);\n return true;\n}\n\nvoid SocketManager::createDomainSocket(ProtocolPtr protocol, const std::string &path, mode_t mask,\n bool client) {\n int fd = getSocketFromSystemD(path);\n if (fd == -1)\n fd = createDomainSocketHelp(path, mask);\n\n auto &desc = createDescriptor(fd, client);\n desc.setListen(true);\n desc.setProtocol(protocol);\n addReadSocket(fd);\n\n LOGD(\"Domain socket: [%d] added.\", fd);\n}\n\nint SocketManager::createDomainSocketHelp(const std::string &path, mode_t mask) {\n int fd;\n\n if ((fd = socket(AF_UNIX, SOCK_STREAM, 0)) == -1) {\n int err = errno;\n LOGE(\"Error during UNIX socket creation: <%s>\", strerror(err));\n throw InitException();\n }\n\n int flags;\n if ((flags = fcntl(fd, F_GETFL, 0)) == -1)\n flags = 0;\n if (fcntl(fd, F_SETFL, flags | O_NONBLOCK) == -1) {\n int err = errno;\n close(fd);\n LOGE(\"Error setting \\\"O_NONBLOCK\\\" on descriptor [%d] with fcntl: <%s>\",\n fd, strerror(err));\n throw InitException();\n }\n\n sockaddr_un serverAddress;\n memset(&serverAddress, 0, sizeof(serverAddress));\n serverAddress.sun_family = AF_UNIX;\n if (path.length() > sizeof(serverAddress.sun_path)) {\n LOGE(\"Path for unix domain socket <%s> is [%zu] bytes long, while it should be maximum \"\n \"[%zu] bytes long\", path.c_str(), path.length(), sizeof(serverAddress));\n throw InitException();\n }\n strcpy(serverAddress.sun_path, path.c_str());\n unlink(serverAddress.sun_path);\n\n mode_t originalUmask;\n originalUmask = umask(mask);\n\n if (bind(fd, (struct sockaddr*)&serverAddress, sizeof(serverAddress)) == -1) {\n int err = errno;\n close(fd);\n LOGE(\"Error in bind socket descriptor [%d] to path <%s>: <%s>\",\n fd, path.c_str(), strerror(err));\n throw InitException();\n }\n\n umask(originalUmask);\n\n if (listen(fd, 5) == -1) {\n int err = errno;\n close(fd);\n LOGE(\"Error setting listen on file descriptor [%d], path <%s>: <%s>\",\n fd, path.c_str(), strerror(err));\n throw InitException();\n }\n\n return fd;\n}\n\nint SocketManager::getSocketFromSystemD(const std::string &path) {\n int n = sd_listen_fds(0);\n LOGI(\"sd_listen_fds returns: [%d]\", n);\n if (n < 0) {\n LOGE(\"Error in sd_listend_fds\");\n throw InitException();\n }\n\n for (int fd = SD_LISTEN_FDS_START; fd < SD_LISTEN_FDS_START + n; ++fd) {\n if (sd_is_socket_unix(fd, SOCK_STREAM, 1, path.c_str(), 0) > 0) {\n LOGI(\"Useable socket <%s> was passed by SystemD under descriptor [%d]\",\n path.c_str(), fd);\n return fd;\n }\n }\n LOGI(\"No useable sockets were passed by systemd.\");\n return -1;\n}\n\nvoid SocketManager::createSignalSocket(ProtocolPtr protocol) {\n sigset_t mask;\n\n \/\/ Maybe someone will find useful some kind of registering signals with callbacks\n \/\/ but for now I'm making it as simple as possible.\n sigemptyset(&mask);\n sigaddset(&mask, SIGTERM); \/\/ systemd terminates service sending this signal\n\n if (sigprocmask(SIG_BLOCK, &mask, NULL) == -1) {\n LOGE(\"sigprocmask failed: <%s>\", strerror(errno));\n return;\n }\n\n int fd = signalfd(-1, &mask, SFD_NONBLOCK);\n if (fd < 0) {\n LOGE(\"Creating signal file descriptor failed: <%s>\", strerror(errno));\n return;\n }\n\n auto &desc = createDescriptor(fd, false);\n desc.setListen(false);\n desc.setProtocol(protocol);\n addReadSocket(fd);\n\n LOGD(\"Signal socket: [%d] added.\", fd);\n}\n\nDescriptor &SocketManager::createDescriptor(int fd, bool client) {\n if (fd > m_maxDesc) {\n m_maxDesc = fd;\n if (fd >= static_cast<int>(m_fds.size()))\n m_fds.resize(fd + 20);\n }\n auto &desc = m_fds[fd];\n desc.setUsed(true);\n desc.setClient(client);\n return desc;\n}\n\nvoid SocketManager::addReadSocket(int fd) {\n FD_SET(fd, &m_readSet);\n}\n\nvoid SocketManager::removeReadSocket(int fd) {\n FD_CLR(fd, &m_readSet);\n}\n\nvoid SocketManager::addWriteSocket(int fd) {\n FD_SET(fd, &m_writeSet);\n}\n\nvoid SocketManager::removeWriteSocket(int fd) {\n FD_CLR(fd, &m_writeSet);\n}\n\nRequestTakerPtr SocketManager::requestTaker(void) {\n return std::static_pointer_cast<RequestTaker>(m_logic);\n}\n\nvoid SocketManager::disconnectAllClients(void) {\n for(int i = 0; i <= m_maxDesc; ++i) {\n auto &desc = m_fds[i];\n if(desc.isUsed() && desc.isClient() && !desc.isListen())\n closeSocket(i);\n }\n}\n\n} \/\/ namespace Cynara\n<commit_msg>Set all needed socket descriptors to write state<commit_after>\/*\n * Copyright (c) 2014 Samsung Electronics Co., Ltd All Rights Reserved\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n *\/\n\/**\n * @file src\/service\/sockets\/SocketManager.cpp\n * @author Lukasz Wojciechowski <l.wojciechow@partner.samsung.com>\n * @author Adam Malinowski <a.malinowsk2@partner.samsung.com>\n * @version 1.0\n * @brief This file implements socket layer manager for cynara\n *\/\n\n#include <errno.h>\n#include <fcntl.h>\n#include <memory>\n#include <signal.h>\n#include <sys\/select.h>\n#include <sys\/signalfd.h>\n#include <sys\/socket.h>\n#include <sys\/stat.h>\n#include <sys\/types.h>\n#include <sys\/un.h>\n#include <unistd.h>\n\n#include <systemd\/sd-daemon.h>\n\n#include <log\/log.h>\n#include <common.h>\n#include <config\/PathConfig.h>\n#include <exceptions\/DescriptorNotExistsException.h>\n#include <exceptions\/InitException.h>\n#include <exceptions\/UnexpectedErrorException.h>\n\n#include <logic\/Logic.h>\n#include <main\/Cynara.h>\n#include <protocol\/ProtocolAdmin.h>\n#include <protocol\/ProtocolAgent.h>\n#include <protocol\/ProtocolClient.h>\n#include <protocol\/ProtocolSignal.h>\n#include <request\/pointers.h>\n#include <request\/RequestContext.h>\n#include <stdexcept>\n\n#include \"SocketManager.h\"\n\nnamespace Cynara {\n\nSocketManager::SocketManager() : m_working(false), m_maxDesc(-1) {\n FD_ZERO(&m_readSet);\n FD_ZERO(&m_writeSet);\n}\n\nSocketManager::~SocketManager() {\n}\n\nvoid SocketManager::run(void) {\n init();\n mainLoop();\n}\n\nvoid SocketManager::init(void) {\n LOGI(\"SocketManger init start\");\n const mode_t clientSocketUMask(0);\n const mode_t adminSocketUMask(0077);\n const mode_t agentSocketUMask(0);\n\n createDomainSocket(std::make_shared<ProtocolClient>(), PathConfig::SocketPath::client,\n clientSocketUMask, true);\n createDomainSocket(std::make_shared<ProtocolAdmin>(), PathConfig::SocketPath::admin,\n adminSocketUMask, false);\n createDomainSocket(std::make_shared<ProtocolAgent>(), PathConfig::SocketPath::agent,\n agentSocketUMask, false);\n createSignalSocket(std::make_shared<ProtocolSignal>());\n LOGI(\"SocketManger init done\");\n}\n\nvoid SocketManager::mainLoop(void) {\n LOGI(\"SocketManger mainLoop start\");\n m_working = true;\n while (m_working) {\n fd_set readSet = m_readSet;\n fd_set writeSet = m_writeSet;\n\n int ret = select(m_maxDesc + 1, &readSet, &writeSet, nullptr, nullptr);\n\n if (ret < 0) {\n switch (errno) {\n case EINTR:\n continue;\n default:\n int err = errno;\n throw UnexpectedErrorException(err, strerror(err));\n }\n } else if (ret > 0) {\n for (int i = 0; i < m_maxDesc + 1 && ret; ++i) {\n if (FD_ISSET(i, &readSet)) {\n readyForRead(i);\n --ret;\n }\n if (FD_ISSET(i, &writeSet)) {\n readyForWrite(i);\n --ret;\n }\n }\n\n for (int i = 0; i < m_maxDesc + 1; ++i) {\n if (m_fds[i].isUsed() && m_fds[i].hasDataToWrite())\n addWriteSocket(i);\n }\n }\n }\n LOGI(\"SocketManger mainLoop done\");\n}\n\nvoid SocketManager::mainLoopStop(void) {\n m_working = false;\n}\n\nvoid SocketManager::readyForRead(int fd) {\n LOGD(\"SocketManger readyForRead on fd [%d] start\", fd);\n auto &desc = m_fds[fd];\n if (desc.isListen()) {\n readyForAccept(fd);\n return;\n }\n\n RawBuffer readBuffer(DEFAULT_BUFFER_SIZE);\n ssize_t size = read(fd, readBuffer.data(), DEFAULT_BUFFER_SIZE);\n\n if (size > 0) {\n LOGD(\"read [%zd] bytes\", size);\n readBuffer.resize(size);\n if (handleRead(fd, readBuffer)) {\n LOGD(\"SocketManger readyForRead on fd [%d] successfully done\", fd);\n return;\n }\n LOGI(\"interpreting buffer read from [%d] failed\", fd);\n } else if (size < 0) {\n int err = errno;\n switch (err) {\n case EAGAIN:\n#if EWOULDBLOCK != EAGAIN\n case EWOULDBLOCK:\n#endif\n case EINTR:\n return;\n default:\n LOGW(\"While reading from [%d] socket, error [%d]:<%s>\",\n fd, err, strerror(err));\n }\n } else {\n LOGN(\"Socket [%d] closed on other end\", fd);\n }\n closeSocket(fd);\n LOGD(\"SocketManger readyForRead on fd [%d] done\", fd);\n}\n\nvoid SocketManager::readyForWrite(int fd) {\n LOGD(\"SocketManger readyForWrite on fd [%d] start\", fd);\n auto &desc = m_fds[fd];\n auto &buffer = desc.prepareWriteBuffer();\n size_t size = buffer.size();\n ssize_t result = write(fd, buffer.data(), size);\n if (result == -1) {\n int err = errno;\n switch (err) {\n case EAGAIN:\n case EINTR:\n \/\/ select will trigger write once again, nothing to do\n break;\n case EPIPE:\n default:\n LOGD(\"Error during write to fd [%d]:<%s> \", fd, strerror(err));\n closeSocket(fd);\n break;\n }\n return; \/\/ We do not want to propagate error to next layer\n }\n\n LOGD(\"written [%zd] bytes\", result);\n buffer.erase(buffer.begin(), buffer.begin() + result);\n\n if (buffer.empty())\n removeWriteSocket(fd);\n LOGD(\"SocketManger readyForWrite on fd [%d] done\", fd);\n}\n\nvoid SocketManager::readyForAccept(int fd) {\n LOGD(\"SocketManger readyForAccept on fd [%d] start\", fd);\n struct sockaddr_un clientAddr;\n unsigned int clientLen = sizeof(clientAddr);\n int clientFd = accept4(fd, (struct sockaddr*) &clientAddr, &clientLen, SOCK_NONBLOCK);\n if (clientFd == -1) {\n int err = errno;\n LOGW(\"Error in accept on socket [%d]: <%s>\", fd, strerror(err));\n return;\n }\n LOGD(\"Accept on sock [%d]. New client socket opened [%d]\", fd, clientFd);\n\n auto &desc = createDescriptor(clientFd, m_fds[fd].isClient());\n desc.setListen(false);\n desc.setProtocol(m_fds[fd].protocol()->clone());\n addReadSocket(clientFd);\n LOGD(\"SocketManger readyForAccept on fd [%d] done\", fd);\n}\n\nvoid SocketManager::closeSocket(int fd) {\n LOGD(\"SocketManger closeSocket fd [%d] start\", fd);\n Descriptor &desc = m_fds[fd];\n requestTaker()->contextClosed(std::make_shared<RequestContext>(nullptr,\n desc.writeQueue()));\n removeReadSocket(fd);\n removeWriteSocket(fd);\n desc.clear();\n close(fd);\n LOGD(\"SocketManger closeSocket fd [%d] done\", fd);\n}\n\nbool SocketManager::handleRead(int fd, const RawBuffer &readbuffer) {\n LOGD(\"SocketManger handleRead on fd [%d] start\", fd);\n auto &desc = m_fds[fd];\n desc.pushReadBuffer(readbuffer);\n\n try {\n while(true) {\n \/\/try extract request from binary data received on socket\n auto req = desc.extractRequest();\n if (!req) \/\/ not enough data to build request yet\n break;\n LOGD(\"request extracted\");\n\n \/\/build context\n auto context = std::make_shared<RequestContext>(desc.responseTaker(),\n desc.writeQueue());\n \/\/pass request to request taker\n req->execute(req, requestTaker(), context);\n }\n } catch (const Exception &ex) {\n LOGE(\"Error handling request <%s>. Closing socket\", ex.what());\n return false;\n }\n LOGD(\"SocketManger handleRead on fd [%d] done\", fd);\n return true;\n}\n\nvoid SocketManager::createDomainSocket(ProtocolPtr protocol, const std::string &path, mode_t mask,\n bool client) {\n int fd = getSocketFromSystemD(path);\n if (fd == -1)\n fd = createDomainSocketHelp(path, mask);\n\n auto &desc = createDescriptor(fd, client);\n desc.setListen(true);\n desc.setProtocol(protocol);\n addReadSocket(fd);\n\n LOGD(\"Domain socket: [%d] added.\", fd);\n}\n\nint SocketManager::createDomainSocketHelp(const std::string &path, mode_t mask) {\n int fd;\n\n if ((fd = socket(AF_UNIX, SOCK_STREAM, 0)) == -1) {\n int err = errno;\n LOGE(\"Error during UNIX socket creation: <%s>\", strerror(err));\n throw InitException();\n }\n\n int flags;\n if ((flags = fcntl(fd, F_GETFL, 0)) == -1)\n flags = 0;\n if (fcntl(fd, F_SETFL, flags | O_NONBLOCK) == -1) {\n int err = errno;\n close(fd);\n LOGE(\"Error setting \\\"O_NONBLOCK\\\" on descriptor [%d] with fcntl: <%s>\",\n fd, strerror(err));\n throw InitException();\n }\n\n sockaddr_un serverAddress;\n memset(&serverAddress, 0, sizeof(serverAddress));\n serverAddress.sun_family = AF_UNIX;\n if (path.length() > sizeof(serverAddress.sun_path)) {\n LOGE(\"Path for unix domain socket <%s> is [%zu] bytes long, while it should be maximum \"\n \"[%zu] bytes long\", path.c_str(), path.length(), sizeof(serverAddress));\n throw InitException();\n }\n strcpy(serverAddress.sun_path, path.c_str());\n unlink(serverAddress.sun_path);\n\n mode_t originalUmask;\n originalUmask = umask(mask);\n\n if (bind(fd, (struct sockaddr*)&serverAddress, sizeof(serverAddress)) == -1) {\n int err = errno;\n close(fd);\n LOGE(\"Error in bind socket descriptor [%d] to path <%s>: <%s>\",\n fd, path.c_str(), strerror(err));\n throw InitException();\n }\n\n umask(originalUmask);\n\n if (listen(fd, 5) == -1) {\n int err = errno;\n close(fd);\n LOGE(\"Error setting listen on file descriptor [%d], path <%s>: <%s>\",\n fd, path.c_str(), strerror(err));\n throw InitException();\n }\n\n return fd;\n}\n\nint SocketManager::getSocketFromSystemD(const std::string &path) {\n int n = sd_listen_fds(0);\n LOGI(\"sd_listen_fds returns: [%d]\", n);\n if (n < 0) {\n LOGE(\"Error in sd_listend_fds\");\n throw InitException();\n }\n\n for (int fd = SD_LISTEN_FDS_START; fd < SD_LISTEN_FDS_START + n; ++fd) {\n if (sd_is_socket_unix(fd, SOCK_STREAM, 1, path.c_str(), 0) > 0) {\n LOGI(\"Useable socket <%s> was passed by SystemD under descriptor [%d]\",\n path.c_str(), fd);\n return fd;\n }\n }\n LOGI(\"No useable sockets were passed by systemd.\");\n return -1;\n}\n\nvoid SocketManager::createSignalSocket(ProtocolPtr protocol) {\n sigset_t mask;\n\n \/\/ Maybe someone will find useful some kind of registering signals with callbacks\n \/\/ but for now I'm making it as simple as possible.\n sigemptyset(&mask);\n sigaddset(&mask, SIGTERM); \/\/ systemd terminates service sending this signal\n\n if (sigprocmask(SIG_BLOCK, &mask, NULL) == -1) {\n LOGE(\"sigprocmask failed: <%s>\", strerror(errno));\n return;\n }\n\n int fd = signalfd(-1, &mask, SFD_NONBLOCK);\n if (fd < 0) {\n LOGE(\"Creating signal file descriptor failed: <%s>\", strerror(errno));\n return;\n }\n\n auto &desc = createDescriptor(fd, false);\n desc.setListen(false);\n desc.setProtocol(protocol);\n addReadSocket(fd);\n\n LOGD(\"Signal socket: [%d] added.\", fd);\n}\n\nDescriptor &SocketManager::createDescriptor(int fd, bool client) {\n if (fd > m_maxDesc) {\n m_maxDesc = fd;\n if (fd >= static_cast<int>(m_fds.size()))\n m_fds.resize(fd + 20);\n }\n auto &desc = m_fds[fd];\n desc.setUsed(true);\n desc.setClient(client);\n return desc;\n}\n\nvoid SocketManager::addReadSocket(int fd) {\n FD_SET(fd, &m_readSet);\n}\n\nvoid SocketManager::removeReadSocket(int fd) {\n FD_CLR(fd, &m_readSet);\n}\n\nvoid SocketManager::addWriteSocket(int fd) {\n FD_SET(fd, &m_writeSet);\n}\n\nvoid SocketManager::removeWriteSocket(int fd) {\n FD_CLR(fd, &m_writeSet);\n}\n\nRequestTakerPtr SocketManager::requestTaker(void) {\n return std::static_pointer_cast<RequestTaker>(m_logic);\n}\n\nvoid SocketManager::disconnectAllClients(void) {\n for(int i = 0; i <= m_maxDesc; ++i) {\n auto &desc = m_fds[i];\n if(desc.isUsed() && desc.isClient() && !desc.isListen())\n closeSocket(i);\n }\n}\n\n} \/\/ namespace Cynara\n<|endoftext|>"} {"text":"<commit_before>\/*=============================================================================\n\n Library: CppMicroServices\n\n Copyright (c) German Cancer Research Center,\n Division of Medical and Biological Informatics\n\n Licensed under the Apache License, Version 2.0 (the \"License\");\n you may not use this file except in compliance with the License.\n You may obtain a copy of the License at\n\n http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n\n Unless required by applicable law or agreed to in writing, software\n distributed under the License is distributed on an \"AS IS\" BASIS,\n WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n See the License for the specific language governing permissions and\n limitations under the License.\n\n=============================================================================*\/\n\n#include <usConfig.h>\n#ifdef US_ENABLE_SERVICE_FACTORY_SUPPORT\n#include US_BASECLASS_HEADER\n#endif\n\n#include \"usServiceRegistration.h\"\n#include \"usServiceRegistrationPrivate.h\"\n#include \"usServiceListenerEntry_p.h\"\n#include \"usServiceRegistry_p.h\"\n#include \"usServiceFactory.h\"\n\n#include \"usModulePrivate.h\"\n#include \"usCoreModuleContext_p.h\"\n\n#include <stdexcept>\n\nUS_BEGIN_NAMESPACE\n\ntypedef ServiceRegistrationPrivate::MutexLocker MutexLocker;\n\nServiceRegistration::ServiceRegistration()\n : d(0)\n{\n\n}\n\nServiceRegistration::ServiceRegistration(const ServiceRegistration& reg)\n : d(reg.d)\n{\n if (d) d->ref.Ref();\n}\n\nServiceRegistration::ServiceRegistration(ServiceRegistrationPrivate* registrationPrivate)\n : d(registrationPrivate)\n{\n if (d) d->ref.Ref();\n}\n\nServiceRegistration::ServiceRegistration(ModulePrivate* module, US_BASECLASS_NAME* service,\n const ServiceProperties& props)\n : d(new ServiceRegistrationPrivate(module, service, props))\n{\n\n}\n\nServiceRegistration::operator bool() const\n{\n return d != 0;\n}\n\nServiceRegistration& ServiceRegistration::operator=(int null)\n{\n if (null == 0)\n {\n if (d && !d->ref.Deref())\n {\n delete d;\n }\n d = 0;\n }\n return *this;\n}\n\nServiceRegistration::~ServiceRegistration()\n{\n if (d && !d->ref.Deref())\n delete d;\n}\n\nServiceReference ServiceRegistration::GetReference() const\n{\n if (!d) throw std::logic_error(\"ServiceRegistration object invalid\");\n if (!d->available) throw std::logic_error(\"Service is unregistered\");\n\n return d->reference;\n}\n\nvoid ServiceRegistration::SetProperties(const ServiceProperties& props)\n{\n if (!d) throw std::logic_error(\"ServiceRegistration object invalid\");\n\n MutexLocker lock(d->eventLock);\n\n ServiceListeners::ServiceListenerEntries before;\n \/\/ TBD, optimize the locking of services\n {\n \/\/MutexLocker lock2(d->module->coreCtx->globalFwLock);\n MutexLocker lock3(d->propsLock);\n\n if (d->available)\n {\n \/\/ NYI! Optimize the MODIFIED_ENDMATCH code\n int old_rank = 0;\n Any any = d->properties[ServiceConstants::SERVICE_RANKING()];\n if (any.Type() == typeid(int)) old_rank = any_cast<int>(any);\n\n d->module->coreCtx->listeners.GetMatchingServiceListeners(d->reference, before, false);\n const std::list<std::string>& classes = ref_any_cast<std::list<std::string> >(d->properties[ServiceConstants::OBJECTCLASS()]);\n long int sid = any_cast<long int>(d->properties[ServiceConstants::SERVICE_ID()]);\n d->properties = ServiceRegistry::CreateServiceProperties(props, classes, sid);\n\n int new_rank = 0;\n any = d->properties[ServiceConstants::SERVICE_RANKING()];\n if (any.Type() == typeid(int)) new_rank = any_cast<int>(any);\n\n if (old_rank != new_rank)\n {\n d->module->coreCtx->services.UpdateServiceRegistrationOrder(*this, classes);\n }\n }\n else\n {\n throw std::logic_error(\"Service is unregistered\");\n }\n }\n ServiceListeners::ServiceListenerEntries matchingListeners;\n d->module->coreCtx->listeners.GetMatchingServiceListeners(d->reference, matchingListeners);\n d->module->coreCtx->listeners.ServiceChanged(matchingListeners,\n ServiceEvent(ServiceEvent::MODIFIED, d->reference),\n before);\n\n d->module->coreCtx->listeners.ServiceChanged(before,\n ServiceEvent(ServiceEvent::MODIFIED_ENDMATCH, d->reference));\n}\n\nvoid ServiceRegistration::Unregister()\n{\n if (!d) throw std::logic_error(\"ServiceRegistration object invalid\");\n\n if (d->unregistering) return; \/\/ Silently ignore redundant unregistration.\n {\n MutexLocker lock(d->eventLock);\n if (d->unregistering) return;\n d->unregistering = true;\n\n if (d->available)\n {\n if (d->module)\n {\n d->module->coreCtx->services.RemoveServiceRegistration(*this);\n }\n }\n else\n {\n throw std::logic_error(\"Service is unregistered\");\n }\n }\n\n if (d->module)\n {\n ServiceListeners::ServiceListenerEntries listeners;\n d->module->coreCtx->listeners.GetMatchingServiceListeners(d->reference, listeners);\n d->module->coreCtx->listeners.ServiceChanged(\n listeners,\n ServiceEvent(ServiceEvent::UNREGISTERING, d->reference));\n }\n\n {\n MutexLocker lock(d->eventLock);\n {\n MutexLocker lock2(d->propsLock);\n d->available = false;\n #ifdef US_ENABLE_SERVICE_FACTORY_SUPPORT\n if (d->module)\n {\n ServiceRegistrationPrivate::ModuleToServicesMap::const_iterator end = d->serviceInstances.end();\n for (ServiceRegistrationPrivate::ModuleToServicesMap::const_iterator i = d->serviceInstances.begin();\n i != end; ++i)\n {\n US_BASECLASS_NAME* obj = i->second;\n try\n {\n \/\/ NYI, don't call inside lock\n dynamic_cast<ServiceFactory*>(d->service)->UngetService(i->first,\n *this,\n obj);\n }\n catch (const std::exception& \/*ue*\/)\n {\n US_WARN << \"ServiceFactory UngetService implementation threw an exception\";\n }\n }\n }\n #endif\n d->module = 0;\n d->dependents.clear();\n d->service = 0;\n d->serviceInstances.clear();\n d->reference = 0;\n d->unregistering = false;\n }\n }\n}\n\nbool ServiceRegistration::operator<(const ServiceRegistration& o) const\n{\n if (!d) return true;\n return d->reference <(o.d->reference);\n}\n\nbool ServiceRegistration::operator==(const ServiceRegistration& registration) const\n{\n return d == registration.d;\n}\n\nServiceRegistration& ServiceRegistration::operator=(const ServiceRegistration& registration)\n{\n ServiceRegistrationPrivate* curr_d = d;\n d = registration.d;\n if (d) d->ref.Ref();\n\n if (curr_d && !curr_d->ref.Deref())\n delete curr_d;\n\n return *this;\n}\n\nUS_END_NAMESPACE\n<commit_msg>Copy the classes list, since we need it after the original is destroyed.<commit_after>\/*=============================================================================\n\n Library: CppMicroServices\n\n Copyright (c) German Cancer Research Center,\n Division of Medical and Biological Informatics\n\n Licensed under the Apache License, Version 2.0 (the \"License\");\n you may not use this file except in compliance with the License.\n You may obtain a copy of the License at\n\n http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n\n Unless required by applicable law or agreed to in writing, software\n distributed under the License is distributed on an \"AS IS\" BASIS,\n WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n See the License for the specific language governing permissions and\n limitations under the License.\n\n=============================================================================*\/\n\n#include <usConfig.h>\n#ifdef US_ENABLE_SERVICE_FACTORY_SUPPORT\n#include US_BASECLASS_HEADER\n#endif\n\n#include \"usServiceRegistration.h\"\n#include \"usServiceRegistrationPrivate.h\"\n#include \"usServiceListenerEntry_p.h\"\n#include \"usServiceRegistry_p.h\"\n#include \"usServiceFactory.h\"\n\n#include \"usModulePrivate.h\"\n#include \"usCoreModuleContext_p.h\"\n\n#include <stdexcept>\n\nUS_BEGIN_NAMESPACE\n\ntypedef ServiceRegistrationPrivate::MutexLocker MutexLocker;\n\nServiceRegistration::ServiceRegistration()\n : d(0)\n{\n\n}\n\nServiceRegistration::ServiceRegistration(const ServiceRegistration& reg)\n : d(reg.d)\n{\n if (d) d->ref.Ref();\n}\n\nServiceRegistration::ServiceRegistration(ServiceRegistrationPrivate* registrationPrivate)\n : d(registrationPrivate)\n{\n if (d) d->ref.Ref();\n}\n\nServiceRegistration::ServiceRegistration(ModulePrivate* module, US_BASECLASS_NAME* service,\n const ServiceProperties& props)\n : d(new ServiceRegistrationPrivate(module, service, props))\n{\n\n}\n\nServiceRegistration::operator bool() const\n{\n return d != 0;\n}\n\nServiceRegistration& ServiceRegistration::operator=(int null)\n{\n if (null == 0)\n {\n if (d && !d->ref.Deref())\n {\n delete d;\n }\n d = 0;\n }\n return *this;\n}\n\nServiceRegistration::~ServiceRegistration()\n{\n if (d && !d->ref.Deref())\n delete d;\n}\n\nServiceReference ServiceRegistration::GetReference() const\n{\n if (!d) throw std::logic_error(\"ServiceRegistration object invalid\");\n if (!d->available) throw std::logic_error(\"Service is unregistered\");\n\n return d->reference;\n}\n\nvoid ServiceRegistration::SetProperties(const ServiceProperties& props)\n{\n if (!d) throw std::logic_error(\"ServiceRegistration object invalid\");\n\n MutexLocker lock(d->eventLock);\n\n ServiceListeners::ServiceListenerEntries before;\n \/\/ TBD, optimize the locking of services\n {\n \/\/MutexLocker lock2(d->module->coreCtx->globalFwLock);\n MutexLocker lock3(d->propsLock);\n\n if (d->available)\n {\n \/\/ NYI! Optimize the MODIFIED_ENDMATCH code\n int old_rank = 0;\n Any any = d->properties[ServiceConstants::SERVICE_RANKING()];\n if (any.Type() == typeid(int)) old_rank = any_cast<int>(any);\n\n d->module->coreCtx->listeners.GetMatchingServiceListeners(d->reference, before, false);\n const std::list<std::string> classes = ref_any_cast<std::list<std::string> >(d->properties[ServiceConstants::OBJECTCLASS()]);\n long int sid = any_cast<long int>(d->properties[ServiceConstants::SERVICE_ID()]);\n d->properties = ServiceRegistry::CreateServiceProperties(props, classes, sid);\n\n int new_rank = 0;\n any = d->properties[ServiceConstants::SERVICE_RANKING()];\n if (any.Type() == typeid(int)) new_rank = any_cast<int>(any);\n\n if (old_rank != new_rank)\n {\n d->module->coreCtx->services.UpdateServiceRegistrationOrder(*this, classes);\n }\n }\n else\n {\n throw std::logic_error(\"Service is unregistered\");\n }\n }\n ServiceListeners::ServiceListenerEntries matchingListeners;\n d->module->coreCtx->listeners.GetMatchingServiceListeners(d->reference, matchingListeners);\n d->module->coreCtx->listeners.ServiceChanged(matchingListeners,\n ServiceEvent(ServiceEvent::MODIFIED, d->reference),\n before);\n\n d->module->coreCtx->listeners.ServiceChanged(before,\n ServiceEvent(ServiceEvent::MODIFIED_ENDMATCH, d->reference));\n}\n\nvoid ServiceRegistration::Unregister()\n{\n if (!d) throw std::logic_error(\"ServiceRegistration object invalid\");\n\n if (d->unregistering) return; \/\/ Silently ignore redundant unregistration.\n {\n MutexLocker lock(d->eventLock);\n if (d->unregistering) return;\n d->unregistering = true;\n\n if (d->available)\n {\n if (d->module)\n {\n d->module->coreCtx->services.RemoveServiceRegistration(*this);\n }\n }\n else\n {\n throw std::logic_error(\"Service is unregistered\");\n }\n }\n\n if (d->module)\n {\n ServiceListeners::ServiceListenerEntries listeners;\n d->module->coreCtx->listeners.GetMatchingServiceListeners(d->reference, listeners);\n d->module->coreCtx->listeners.ServiceChanged(\n listeners,\n ServiceEvent(ServiceEvent::UNREGISTERING, d->reference));\n }\n\n {\n MutexLocker lock(d->eventLock);\n {\n MutexLocker lock2(d->propsLock);\n d->available = false;\n #ifdef US_ENABLE_SERVICE_FACTORY_SUPPORT\n if (d->module)\n {\n ServiceRegistrationPrivate::ModuleToServicesMap::const_iterator end = d->serviceInstances.end();\n for (ServiceRegistrationPrivate::ModuleToServicesMap::const_iterator i = d->serviceInstances.begin();\n i != end; ++i)\n {\n US_BASECLASS_NAME* obj = i->second;\n try\n {\n \/\/ NYI, don't call inside lock\n dynamic_cast<ServiceFactory*>(d->service)->UngetService(i->first,\n *this,\n obj);\n }\n catch (const std::exception& \/*ue*\/)\n {\n US_WARN << \"ServiceFactory UngetService implementation threw an exception\";\n }\n }\n }\n #endif\n d->module = 0;\n d->dependents.clear();\n d->service = 0;\n d->serviceInstances.clear();\n d->reference = 0;\n d->unregistering = false;\n }\n }\n}\n\nbool ServiceRegistration::operator<(const ServiceRegistration& o) const\n{\n if (!d) return true;\n return d->reference <(o.d->reference);\n}\n\nbool ServiceRegistration::operator==(const ServiceRegistration& registration) const\n{\n return d == registration.d;\n}\n\nServiceRegistration& ServiceRegistration::operator=(const ServiceRegistration& registration)\n{\n ServiceRegistrationPrivate* curr_d = d;\n d = registration.d;\n if (d) d->ref.Ref();\n\n if (curr_d && !curr_d->ref.Deref())\n delete curr_d;\n\n return *this;\n}\n\nUS_END_NAMESPACE\n<|endoftext|>"} {"text":"<commit_before>\/*\n * PuckManager.cpp\n *\n * Created on: 09.06.2017\n * Author: aca592\n *\/\n\n#include \"PuckManager.h\"\n\n#include \"logger.h\"\n#include \"logScope.h\"\n\nPuckManager::PuckManager(int chid)\n\t: puckList()\n\t, nextPuckID(0)\n\t, chid(chid)\n{}\n\nPuckManager::~PuckManager() {\n\treset();\n}\n\nvoid PuckManager::reset() {\n\tstd::list<PuckContext*>::iterator it = puckList.begin();\n\twhile(it != puckList.end()) {\n\t\tLOG_DEBUG <<\"[Puck\" + std::to_string((*it)->getPuckID()) + \"] was deleted \\n\";\n\t\tdelete *it;\t\t\t\t\t\/\/ delete the puck from memory\n\t\tit = puckList.erase(it);\t\/\/ delete the puck from list\n\t}\n}\n\nPuckManager::ManagerReturn PuckManager::newPuck(PuckSignal::PuckType type) {\n\tLOG_SCOPE;\n\tManagerReturn ret;\n\tret.errorFlag = false;\n\tret.actorFlag = true;\n\tret.speedSignal = PuckSignal::PuckSpeed::SLOW;\n\tret.actorSignal = ActorSignal::ACCEPTED_PUCK;\n\tpuckList.push_back(new PuckContext(chid, type, nextPuckID++));\n\treturn ret;\n}\n\nvoid PuckManager::addPuck(PuckContext *puck) {\n\tLOG_SCOPE;\n\tpuck->setPuckID(nextPuckID++);\n\tpuckList.push_back(puck);\n\tLOG_DEBUG << \"[PuckManager] Size of puckList\" << puckList.size() << endl;\n}\n\nPuckSignal::PuckSpeed PuckManager::getCurrentSpeed() {\n\tPuckSignal::PuckSpeed speed = PuckSignal::PuckSpeed::SLIDE_STOP;\n\tstd::list<PuckContext*>::iterator it = puckList.begin();\n\twhile (it != puckList.end()) {\n\t\tif ((*it)->getCurrentSpeed() > speed) {\n\t\t\t\/\/ Check for speed prio\n\t\t\tspeed = (*it)->getCurrentSpeed();\n\t\t}\n\t\tit++;\n\t}\n\n\tif(puckList.empty()) {\n\t\tspeed = PuckSignal::PuckSpeed::STOP;\n\t}\n\treturn speed;\n}\n\nvoid PuckManager::handlePuckTimer(const PuckSignal::Signal& signal, ManagerReturn& prioReturnVal) {\n\tLOG_DEBUG << \"[PuckManager] Handle Puck Timer \\n\";\n\tstd::list<PuckContext*>::iterator it = puckList.begin();\n\twhile (it != puckList.end()) {\n\t\t\/\/ check for puckID\n\t\tuint16_t currentPuckID = (*it)->getPuckID();\n\t\tif (currentPuckID == signal.timerSignal.TimerInfo.puckID) {\n\t\t\t\/\/ pass the timer signal\n\t\t\tPuckSignal::Return returnVal = (*it)->process(signal);\n\t\t\t\/\/ check return value\n\t\t\tif (returnVal.puckReturn == PuckSignal::PuckReturn::SLIDE_FULL) {\n\t\t\t\tLOG_DEBUG << \"[PuckManager] Puck returned Slide full \\n\";\n\t\t\t\tsetErrorOnBothSlidesAreFull(prioReturnVal);\n\t\t\t\tsort.process(returnVal.puckReturn);\n\t\t\t\tprioReturnVal.actorFlag = true;\n\t\t\t\tprioReturnVal.actorSignal = ActorSignal::SEND_SLIDE_FULL;\n\t\t\t} else if (returnVal.puckReturn != PuckSignal::PuckReturn::ACCEPT\n\t\t\t\t\t&& returnVal.puckReturn != PuckSignal::PuckReturn::ERROR) {\n\t\t\t\t\/\/ puck should be triggered on accept or error -> unexpected otherwise\n\t\t\t\tprioReturnVal.errorFlag = true;\n\t\t\t\tprioReturnVal.errorSignal = ErrorSignal::UNEXPECTED_SIGNAL;\n\t\t\t} else if (returnVal.puckReturn == PuckSignal::PuckReturn::ERROR) {\n\t\t\t\tprioReturnVal.errorFlag = true;\n\t\t\t\tprioReturnVal.errorSignal = ErrorSignal::PUCK_LOST; \/\/Late Timer expiered\n\t\t\t}\n\t\t}\n\t\tit++;\n\t}\n}\n\nvoid PuckManager::handlePuckSignal(const PuckSignal::Signal &signal, int32_t &acceptCounter, int32_t &warningCounter, ManagerReturn &prioReturnVal) {\n\tLOG_DEBUG << \"[PuckManager] Handle Puck Signal \\n\";\n\t\/\/ check the signal for every puck in the list\n\tif(puckList.empty()) {\n\t\tprioReturnVal.speedSignal = PuckSignal::PuckSpeed::STOP;\n\t\tprioReturnVal.errorFlag = true;\n\t\tprioReturnVal.errorSignal = ErrorSignal::UNEXPECTED_SIGNAL;\n\t}\n\n\tstd::list<PuckContext*>::iterator it = puckList.begin();\n\twhile (it != puckList.end()) {\n\t\tPuckSignal::Return returnVal = (*it)->process(signal);\n\n\t\tswitch (returnVal.puckReturn) {\n\t\tcase PuckSignal::PuckReturn::ACCEPT:\n\t\t\tacceptCounter++;\n\t\t\tbreak;\n\t\tcase PuckSignal::PuckReturn::DELETE:\n\t\t\tacceptCounter++;\n\t\t\tLOG_DEBUG << \"[Puck\" + std::to_string((*it)->getPuckID()) + \"] was deleted \\n\";\n\t\t\tdelete *it;\t\t\t\t\t\/\/ delete the puck from memory\n\t\t\tit = puckList.erase(it);\t\/\/ delete the puck from list\n\t\t\tbreak;\n\t\tcase PuckSignal::PuckReturn::SEND:\n\t\t\tacceptCounter++;\n\t\t\tprioReturnVal.puckType = new PuckSignal::PuckType((*it)->getType());\n\t\t\tprioReturnVal.actorFlag = true;\n\t\t\tprioReturnVal.actorSignal = ActorSignal::SEND_PUCK;\n\t\t\tbreak;\n\t\tcase PuckSignal::PuckReturn::RECEIVED:\n\t\t\tacceptCounter++;\n\t\t\tprioReturnVal.actorFlag = true;\n\t\t\tprioReturnVal.actorSignal = ActorSignal::RECEIVED_PUCK;\n\t\t\tbreak;\n\t\tcase PuckSignal::PuckReturn::EVALUATE:\n\t\t\tacceptCounter++;\n\t\t\tif (!sort.process((*it)->getType())) {\n\t\t\t\tprioReturnVal.actorFlag = true;\n\t\t\t\tprioReturnVal.actorSignal = ActorSignal::OPEN_SWITCH;\n\t\t\t}\n\t\t\tbreak;\n\t\tcase PuckSignal::PuckReturn::START_HEIGHT:\n\t\t\tacceptCounter++;\n\t\t\tprioReturnVal.actorFlag = true;\n\t\t\tprioReturnVal.actorSignal = ActorSignal::START_MEASUREMENT;\n\t\t\tbreak;\n\t\tcase PuckSignal::PuckReturn::STOP_HEIGHT:\n\t\t\tacceptCounter++;\n\t\t\tprioReturnVal.actorFlag = true;\n\t\t\tprioReturnVal.actorSignal = ActorSignal::STOP_MEASUREMENT;\n\t\t\tbreak;\n\n\t\tcase PuckSignal::PuckReturn::SLIDE_EMPTY:\n\t\t\tacceptCounter++;\n\n\t\t\tsort.process(returnVal.puckReturn);\n\t\t\tprioReturnVal.actorFlag = true;\n\t\t\tprioReturnVal.actorSignal = ActorSignal::SEND_SLIDE_EMPTY;\n\t\t\tLOG_DEBUG << \"[Puck\" + std::to_string((*it)->getPuckID()) + \"] was deleted \\n\";\n\t\t\tdelete *it;\t\t\t\t\t\/\/ delete the puck from memory\n\t\t\tit = puckList.erase(it);\t\/\/ delete the puck from list\n\t\t\tbreak;\n\t\t\t\/\/\n\t\tcase PuckSignal::PuckReturn::WARNING:\n\t\t\twarningCounter++;\n\t\t\tbreak;\n\t\tcase PuckSignal::PuckReturn::DENY:\n\t\t\tbreak;\n\t\tcase PuckSignal::PuckReturn::ERROR:\n\t\t\tprioReturnVal.errorFlag = true;\n\t\t\tprioReturnVal.errorSignal = ErrorSignal::PUCK_LOST;\n\t\t\tbreak;\n\t\tdefault:\n\t\t\tprioReturnVal.errorFlag = true;\n\t\t\tprioReturnVal.errorSignal = ErrorSignal::UNEXPECTED_SIGNAL;\n\t\t\tLOG_DEBUG << \"[PuckManager] Returning with Default UNEXPECTED_SIGNAL\";\n\t\t\t\/\/return prioReturnVal;\n\t\t}\n\n\t\tif (returnVal.puckReturn != PuckSignal::PuckReturn::DELETE || returnVal.puckReturn != PuckSignal::PuckReturn::SLIDE_EMPTY) { \/\/if a puck was deleted, you should not increment the iteratpr\n\t\t\t++it;\n\t\t}\n\t}\n\n\tprioReturnVal.speedSignal = getCurrentSpeed();\n\n\t\/* No one Accepted the signal, so it is likely to be unexpected*\/\n\tif(acceptCounter == 0) {\n\t\tprioReturnVal.errorFlag = true;\n\t\tprioReturnVal.errorSignal = ErrorSignal::NOT_ACCEPTED;\n\t}\n}\n\nbool PuckManager::passToPuckSort(const PuckSignal::Signal& signal, ManagerReturn& prioReturnVal) {\n\tLOG_DEBUG << \"[PuckManager] Pass to Pucksort \\n\";\n\tif ( signal.signalType == PuckSignal::SignalType::SERIAL_SIGNAL\n\t\t && (signal.serialSignal == Serial_n::ser_proto_msg::SLIDE_FULL_SER\n\t\t || signal.serialSignal == Serial_n::ser_proto_msg::SLIDE_EMTPY_SER)){\n\n\t\tsetErrorOnBothSlidesAreFull(prioReturnVal);\n\t\tsort.process(signal.serialSignal);\n\t\tLOG_DEBUG << \"[PuckManager] Returning with with Slide management only \\n\";\n\t\treturn true;\n\t} else {\n\t\treturn false;\n\t}\n}\n\nbool PuckManager::checkErrorMetal(const PuckSignal::Signal& signal) {\n\t\/\/ metal detect hot fix\n\treturn (signal.signalType == PuckSignal::SignalType::INTERRUPT_SIGNAL\n\t\t\t&& signal.interruptSignal\n\t\t\t== interrupts::interruptSignals::METAL_DETECT);\n}\n\nvoid PuckManager::setErrorOnBothSlidesAreFull(ManagerReturn &prioReturnVal) {\n\tbool conditionIsMet = sort.areBothSlidesFull();\n\tLOG_DEBUG << \"[PuckManager] areBothSlidesFull: \" << int(conditionIsMet) << endl;\n\tif (conditionIsMet) {\n\t\t\tprioReturnVal.errorFlag = true;\n\t\t\tprioReturnVal.errorSignal = ErrorSignal::BOTH_SLIDES_FULL;\n\t}\n}\n\nbool PuckManager::checkSerialError(const PuckSignal::Signal& signal) {\n\t\/* Accept serial RESUME and STOP signals *\/\n\treturn (signal.signalType == PuckSignal::SignalType::SERIAL_SIGNAL\n\t\t\t&& (signal.serialSignal == Serial_n::ser_proto_msg::STOP_SER\n\t\t\t|| signal.serialSignal == Serial_n::ser_proto_msg::RESUME_SER));\n}\n\nPuckManager::ManagerReturn PuckManager::process(PuckSignal::Signal signal) {\n\tLOG_SCOPE;\n\n\tManagerReturn prioReturnVal; \/\/ the prioritized return value\n\tprioReturnVal.speedSignal = PuckSignal::PuckSpeed::FAST;\n\tprioReturnVal.actorFlag = false;\n\tprioReturnVal.errorFlag = false;\n\tprioReturnVal.puckType = nullptr;\n\n\tint32_t acceptCounter = 0; \/\/ count all accepted signals\n\tint32_t warningCounter = 0; \/\/ count all warnings\n\n\tif(passToPuckSort(signal, prioReturnVal)){ \/\/Only pucksort is intrested in signal\n\t\t\tprioReturnVal.speedSignal = getCurrentSpeed(); \/\/Always set speed\n\t\t\tLOG_DEBUG << \"[PuckManager] Returning with pass to puck sort only \\n\";\n\t\t\treturn prioReturnVal;\n\t}\n\n\tprioReturnVal.speedSignal = getCurrentSpeed(); \/\/Always set speed\n\n\n#if !machine \/\/ machine0\n\t\/\/ check for first interrupt signal - puck must be created\n\tif(\tsignal.signalType == PuckSignal::SignalType::INTERRUPT_SIGNAL &&\n\t\tsignal.interruptSignal == interrupts::interruptSignals::INLET_IN) {\n\n\t\taddPuck(new PuckContext(chid));\n\t\tprioReturnVal.speedSignal = getCurrentSpeed(); \/\/Always set speed\n\n\n\t\treturn prioReturnVal;\n\t}\n\n\t\/\/ signal can be passed for speed prio -> every puck should return deny\n#endif\n\n\t\/\/ Pass the timer signal to the given puckID\n\tif(signal.signalType == PuckSignal::SignalType::TIMER_SIGNAL) {\n\t\thandlePuckTimer(signal, prioReturnVal);\n\t\tprioReturnVal.speedSignal = getCurrentSpeed(); \/\/Always set speed\n\t\tLOG_DEBUG << \"[PuckManager] Returning with with timer management only \\n\";\n\t\treturn prioReturnVal;\n\t} else {\n\t\t\/\/ check the signal for every puck in the list\n\t\thandlePuckSignal(signal, acceptCounter, warningCounter, prioReturnVal);\n\t}\n\n\t\/* Signal was unexpected for the pucks, might be expected somewhere else *\/\n\tif(prioReturnVal.errorFlag && prioReturnVal.errorSignal == ErrorSignal::NOT_ACCEPTED){\n\t\tif(checkErrorMetal(signal)){\n\t\t\tLOG_DEBUG << \"[PuckManager] Error was from Metall \\n\";\n\t\t\tprioReturnVal.errorFlag = false;\n\t\t} else if(checkSerialError(signal)){\n\t\t\tLOG_DEBUG << \"[PuckManager] Error was from Serial \\n\";\n\t\t\tprioReturnVal.errorFlag = false;\n\t\t} else {\n\t\t\tLOG_DEBUG << \"[PuckManager] Transform NOT_ACCEPTED to UNEXPECTED_SIGNAL \\n\";\n\t\t\tprioReturnVal.errorSignal = ErrorSignal::UNEXPECTED_SIGNAL;\n\t\t}\n\t}\n\n\t\/*if(!prioReturnVal.errorFlag) {\n\t\tif(acceptCounter > 1 || acceptCounter < 0) {\n\t\t\tLOG_DEBUG << \"[PuckManager] Returning with MULTIPLE_ACCEPT\";\n\t\t\tprioReturnVal.errorFlag = true;\n\t\t\tprioReturnVal.errorSignal = ErrorSignal::MULTIPLE_ACCEPT;\n\t\t\treturn prioReturnVal;\n\t\t}\n\t}*\/\n\n\tif(puckList.empty()) {\n\t\tprioReturnVal.speedSignal = PuckSignal::PuckSpeed::STOP;\n\t}\n\n\tprioReturnVal.speedSignal = getCurrentSpeed(); \/\/Always set speed\n\n\tLOG_DEBUG << \"Puck Manager returns: Speed \" << prioReturnVal.speedSignal << \" Actor Flag \" << prioReturnVal.actorFlag\n\t\t\t << \" Actor Signal \" << prioReturnVal.actorSignal << \" Error Flag \" << prioReturnVal.errorFlag\n\t\t\t << \" Error Signal \" << prioReturnVal.errorSignal << \" \\n\";\n\n\t\/\/ everything OK\n\treturn prioReturnVal;\n}\n<commit_msg>snap<commit_after>\/*\n * PuckManager.cpp\n *\n * Created on: 09.06.2017\n * Author: aca592\n *\/\n\n#include \"PuckManager.h\"\n\n#include \"logger.h\"\n#include \"logScope.h\"\n\nPuckManager::PuckManager(int chid)\n\t: puckList()\n\t, nextPuckID(0)\n\t, chid(chid)\n{}\n\nPuckManager::~PuckManager() {\n\treset();\n}\n\nvoid PuckManager::reset() {\n\tstd::list<PuckContext*>::iterator it = puckList.begin();\n\twhile(it != puckList.end()) {\n\t\tLOG_DEBUG <<\"[Puck\" + std::to_string((*it)->getPuckID()) + \"] was deleted \\n\";\n\t\tdelete *it;\t\t\t\t\t\/\/ delete the puck from memory\n\t\tit = puckList.erase(it);\t\/\/ delete the puck from list\n\t}\n}\n\nPuckManager::ManagerReturn PuckManager::newPuck(PuckSignal::PuckType type) {\n\tLOG_SCOPE;\n\tManagerReturn ret;\n\tret.errorFlag = false;\n\tret.actorFlag = true;\n\tret.speedSignal = PuckSignal::PuckSpeed::SLOW;\n\tret.actorSignal = ActorSignal::ACCEPTED_PUCK;\n\tpuckList.push_back(new PuckContext(chid, type, nextPuckID++));\n\treturn ret;\n}\n\nvoid PuckManager::addPuck(PuckContext *puck) {\n\tLOG_SCOPE;\n\tpuck->setPuckID(nextPuckID++);\n\tpuckList.push_back(puck);\n\tLOG_DEBUG << \"[PuckManager] Size of puckList\" << puckList.size() << endl;\n}\n\nPuckSignal::PuckSpeed PuckManager::getCurrentSpeed() {\n\tPuckSignal::PuckSpeed speed = PuckSignal::PuckSpeed::SLIDE_STOP;\n\tstd::list<PuckContext*>::iterator it = puckList.begin();\n\twhile (it != puckList.end()) {\n\t\tif ((*it)->getCurrentSpeed() > speed) {\n\t\t\t\/\/ Check for speed prio\n\t\t\tspeed = (*it)->getCurrentSpeed();\n\t\t}\n\t\tit++;\n\t}\n\n\tif(puckList.empty()) {\n\t\tspeed = PuckSignal::PuckSpeed::STOP;\n\t}\n\treturn speed;\n}\n\nvoid PuckManager::handlePuckTimer(const PuckSignal::Signal& signal, ManagerReturn& prioReturnVal) {\n\tLOG_DEBUG << \"[PuckManager] Handle Puck Timer \\n\";\n\tstd::list<PuckContext*>::iterator it = puckList.begin();\n\twhile (it != puckList.end()) {\n\t\t\/\/ check for puckID\n\t\tuint16_t currentPuckID = (*it)->getPuckID();\n\t\tif (currentPuckID == signal.timerSignal.TimerInfo.puckID) {\n\t\t\t\/\/ pass the timer signal\n\t\t\tPuckSignal::Return returnVal = (*it)->process(signal);\n\t\t\t\/\/ check return value\n\t\t\tif (returnVal.puckReturn == PuckSignal::PuckReturn::SLIDE_FULL) {\n\t\t\t\tLOG_DEBUG << \"[PuckManager] Puck returned Slide full \\n\";\n\t\t\t\tsetErrorOnBothSlidesAreFull(prioReturnVal);\n\t\t\t\tsort.process(returnVal.puckReturn);\n\t\t\t\tprioReturnVal.actorFlag = true;\n\t\t\t\tprioReturnVal.actorSignal = ActorSignal::SEND_SLIDE_FULL;\n\t\t\t} else if (returnVal.puckReturn != PuckSignal::PuckReturn::ACCEPT\n\t\t\t\t\t&& returnVal.puckReturn != PuckSignal::PuckReturn::ERROR) {\n\t\t\t\t\/\/ puck should be triggered on accept or error -> unexpected otherwise\n\t\t\t\tprioReturnVal.errorFlag = true;\n\t\t\t\tprioReturnVal.errorSignal = ErrorSignal::UNEXPECTED_SIGNAL;\n\t\t\t} else if (returnVal.puckReturn == PuckSignal::PuckReturn::ERROR) {\n\t\t\t\tprioReturnVal.errorFlag = true;\n\t\t\t\tprioReturnVal.errorSignal = ErrorSignal::PUCK_LOST; \/\/Late Timer expiered\n\t\t\t}\n\t\t}\n\t\tit++;\n\t}\n}\n\nvoid PuckManager::handlePuckSignal(const PuckSignal::Signal &signal, int32_t &acceptCounter, int32_t &warningCounter, ManagerReturn &prioReturnVal) {\n\tLOG_DEBUG << \"[PuckManager] Handle Puck Signal \\n\";\n\t\/\/ check the signal for every puck in the list\n\tif(puckList.empty()) {\n\t\tprioReturnVal.speedSignal = PuckSignal::PuckSpeed::STOP;\n\t\tprioReturnVal.errorFlag = true;\n\t\tprioReturnVal.errorSignal = ErrorSignal::UNEXPECTED_SIGNAL;\n\t}\n\n\tstd::list<PuckContext*>::iterator it = puckList.begin();\n\twhile (it != puckList.end()) {\n\t\tPuckSignal::Return returnVal = (*it)->process(signal);\n\n\t\tswitch (returnVal.puckReturn) {\n\t\tcase PuckSignal::PuckReturn::ACCEPT:\n\t\t\tacceptCounter++;\n\t\t\tbreak;\n\t\tcase PuckSignal::PuckReturn::DELETE:\n\t\t\tacceptCounter++;\n\t\t\tLOG_DEBUG << \"[Puck\" + std::to_string((*it)->getPuckID()) + \"] was deleted \\n\";\n\t\t\tdelete *it;\t\t\t\t\t\/\/ delete the puck from memory\n\t\t\tit = puckList.erase(it);\t\/\/ delete the puck from list\n\t\t\tbreak;\n\t\tcase PuckSignal::PuckReturn::SEND:\n\t\t\tacceptCounter++;\n\t\t\tprioReturnVal.puckType = new PuckSignal::PuckType((*it)->getType());\n\t\t\tprioReturnVal.actorFlag = true;\n\t\t\tprioReturnVal.actorSignal = ActorSignal::SEND_PUCK;\n\t\t\tbreak;\n\t\tcase PuckSignal::PuckReturn::RECEIVED:\n\t\t\tacceptCounter++;\n\t\t\tprioReturnVal.actorFlag = true;\n\t\t\tprioReturnVal.actorSignal = ActorSignal::RECEIVED_PUCK;\n\t\t\tbreak;\n\t\tcase PuckSignal::PuckReturn::EVALUATE:\n\t\t\tacceptCounter++;\n\t\t\tif (!sort.process((*it)->getType())) {\n\t\t\t\tprioReturnVal.actorFlag = true;\n\t\t\t\tprioReturnVal.actorSignal = ActorSignal::OPEN_SWITCH;\n\t\t\t}\n\t\t\tbreak;\n\t\tcase PuckSignal::PuckReturn::START_HEIGHT:\n\t\t\tacceptCounter++;\n\t\t\tprioReturnVal.actorFlag = true;\n\t\t\tprioReturnVal.actorSignal = ActorSignal::START_MEASUREMENT;\n\t\t\tbreak;\n\t\tcase PuckSignal::PuckReturn::STOP_HEIGHT:\n\t\t\tacceptCounter++;\n\t\t\tprioReturnVal.actorFlag = true;\n\t\t\tprioReturnVal.actorSignal = ActorSignal::STOP_MEASUREMENT;\n\t\t\tbreak;\n\n\t\tcase PuckSignal::PuckReturn::SLIDE_EMPTY:\n\t\t\tacceptCounter++;\n\n\t\t\tsort.process(returnVal.puckReturn);\n\t\t\tprioReturnVal.actorFlag = true;\n\t\t\tprioReturnVal.actorSignal = ActorSignal::SEND_SLIDE_EMPTY;\n\t\t\tLOG_DEBUG << \"[Puck\" + std::to_string((*it)->getPuckID()) + \"] was deleted \\n\";\n\t\t\tdelete *it;\t\t\t\t\t\/\/ delete the puck from memory\n\t\t\tit = puckList.erase(it);\t\/\/ delete the puck from list\n\t\t\tbreak;\n\t\t\t\/\/\n\t\tcase PuckSignal::PuckReturn::WARNING:\n\t\t\twarningCounter++;\n\t\t\tbreak;\n\t\tcase PuckSignal::PuckReturn::DENY:\n\t\t\tbreak;\n\t\tcase PuckSignal::PuckReturn::ERROR:\n\t\t\tprioReturnVal.errorFlag = true;\n\t\t\tprioReturnVal.errorSignal = ErrorSignal::PUCK_LOST;\n\t\t\tbreak;\n\t\tdefault:\n\t\t\tprioReturnVal.errorFlag = true;\n\t\t\tprioReturnVal.errorSignal = ErrorSignal::UNEXPECTED_SIGNAL;\n\t\t\tLOG_DEBUG << \"[PuckManager] Returning with Default UNEXPECTED_SIGNAL\";\n\t\t\t\/\/return prioReturnVal;\n\t\t}\n\n\t\tif (returnVal.puckReturn != PuckSignal::PuckReturn::DELETE || returnVal.puckReturn != PuckSignal::PuckReturn::SLIDE_EMPTY) { \/\/if a puck was deleted, you should not increment the iteratpr\n\t\t\t++it;\n\t\t}\n\t}\n\n\tprioReturnVal.speedSignal = getCurrentSpeed();\n\n\t\/* No one Accepted the signal, so it is likely to be unexpected*\/\n\tif(acceptCounter == 0) {\n\t\tprioReturnVal.errorFlag = true;\n\t\tprioReturnVal.errorSignal = ErrorSignal::NOT_ACCEPTED;\n\t}\n}\n\nbool PuckManager::passToPuckSort(const PuckSignal::Signal& signal, ManagerReturn& prioReturnVal) {\n\tLOG_DEBUG << \"[PuckManager] Pass to Pucksort \\n\";\n\tif ( signal.signalType == PuckSignal::SignalType::SERIAL_SIGNAL\n\t\t && (signal.serialSignal == Serial_n::ser_proto_msg::SLIDE_FULL_SER\n\t\t || signal.serialSignal == Serial_n::ser_proto_msg::SLIDE_EMTPY_SER)){\n\n\t\tsetErrorOnBothSlidesAreFull(prioReturnVal);\n\t\tsort.process(signal.serialSignal);\n\t\tLOG_DEBUG << \"[PuckManager] Returning with with Slide management only \\n\";\n\t\treturn true;\n\t} else {\n\t\treturn false;\n\t}\n}\n\nbool PuckManager::checkErrorMetal(const PuckSignal::Signal& signal) {\n\t\/\/ metal detect hot fix\n\treturn (signal.signalType == PuckSignal::SignalType::INTERRUPT_SIGNAL\n\t\t\t&& signal.interruptSignal\n\t\t\t== interrupts::interruptSignals::METAL_DETECT);\n}\n\nvoid PuckManager::setErrorOnBothSlidesAreFull(ManagerReturn &prioReturnVal) {\n\tbool conditionIsMet = sort.areBothSlidesFull();\n\tLOG_DEBUG << \"[PuckManager] areBothSlidesFull: \" << int(conditionIsMet) << endl;\n\tif (conditionIsMet) {\n\t\t\tprioReturnVal.errorFlag = true;\n\t\t\tprioReturnVal.errorSignal = ErrorSignal::BOTH_SLIDES_FULL;\n\t}\n}\n\nbool PuckManager::checkSerialError(const PuckSignal::Signal& signal) {\n\t\/* Accept serial RESUME and STOP signals *\/\n\treturn (signal.signalType == PuckSignal::SignalType::SERIAL_SIGNAL\n\t\t\t&& (signal.serialSignal == Serial_n::ser_proto_msg::STOP_SER\n\t\t\t|| signal.serialSignal == Serial_n::ser_proto_msg::RESUME_SER));\n}\n\nPuckManager::ManagerReturn PuckManager::process(PuckSignal::Signal signal) {\n\tLOG_SCOPE;\n\n\tManagerReturn prioReturnVal; \/\/ the prioritized return value\n\tprioReturnVal.speedSignal = PuckSignal::PuckSpeed::FAST;\n\tprioReturnVal.actorFlag = false;\n\tprioReturnVal.errorFlag = false;\n\tprioReturnVal.puckType = nullptr;\n\n\tint32_t acceptCounter = 0; \/\/ count all accepted signals\n\tint32_t warningCounter = 0; \/\/ count all warnings\n\n\tif(passToPuckSort(signal, prioReturnVal)){ \/\/Only pucksort is intrested in signal\n\t\t\tprioReturnVal.speedSignal = getCurrentSpeed(); \/\/Always set speed\n\t\t\tLOG_DEBUG << \"[PuckManager] Returning with pass to puck sort only \\n\";\n\t\t\treturn prioReturnVal;\n\t}\n\n\tprioReturnVal.speedSignal = getCurrentSpeed(); \/\/Always set speed\n\n\n#if !machine \/\/ machine0\n\t\/\/ check for first interrupt signal - puck must be created\n\tif(\tsignal.signalType == PuckSignal::SignalType::INTERRUPT_SIGNAL &&\n\t\tsignal.interruptSignal == interrupts::interruptSignals::INLET_IN) {\n\n\t\taddPuck(new PuckContext(chid));\n\t\tprioReturnVal.speedSignal = getCurrentSpeed(); \/\/Always set speed\n\n\n\t\treturn prioReturnVal;\n\t}\n\n\t\/\/ signal can be passed for speed prio -> every puck should return deny\n#endif\n\n\t\/\/ Pass the timer signal to the given puckID\n\tif(signal.signalType == PuckSignal::SignalType::TIMER_SIGNAL) {\n\t\thandlePuckTimer(signal, prioReturnVal);\n\t\tprioReturnVal.speedSignal = getCurrentSpeed(); \/\/Always set speed\n\t\tLOG_DEBUG << \"[PuckManager] Returning with with timer management only \\n\";\n\t\treturn prioReturnVal;\n\t} else {\n\t\t\/\/ check the signal for every puck in the list\n\t\thandlePuckSignal(signal, acceptCounter, warningCounter, prioReturnVal);\n\t}\n\n\t\/* Signal was unexpected for the pucks, might be expected somewhere else *\/\n\tif(prioReturnVal.errorFlag && prioReturnVal.errorSignal == ErrorSignal::NOT_ACCEPTED){\n\t\tif(checkErrorMetal(signal)){\n\t\t\tLOG_DEBUG << \"[PuckManager] Error was from Metall \\n\";\n\t\t\tprioReturnVal.errorFlag = false;\n\t\t} else if(checkSerialError(signal)){\n\t\t\tLOG_DEBUG << \"[PuckManager] Error was from Serial \\n\";\n\t\t\tprioReturnVal.errorFlag = false;\n\t\t} else {\n\t\t\tLOG_DEBUG << \"[PuckManager] Transform NOT_ACCEPTED to UNEXPECTED_SIGNAL \\n\";\n\t\t\tprioReturnVal.errorSignal = ErrorSignal::UNEXPECTED_SIGNAL;\n\t\t}\n\t}\n\n\t\/*if(!prioReturnVal.errorFlag) {\n\t\tif(acceptCounter > 1 || acceptCounter < 0) {\n\t\t\tLOG_DEBUG << \"[PuckManager] Returning with MULTIPLE_ACCEPT\";\n\t\t\tprioReturnVal.errorFlag = true;\n\t\t\tprioReturnVal.errorSignal = ErrorSignal::MULTIPLE_ACCEPT;\n\t\t\treturn prioReturnVal;\n\t\t}\n\t}*\/\n\n\tsetErrorOnBothSlidesAreFull(prioReturnVal);\n\n\tif(puckList.empty()) {\n\t\tprioReturnVal.speedSignal = PuckSignal::PuckSpeed::STOP;\n\t}\n\n\tprioReturnVal.speedSignal = getCurrentSpeed(); \/\/Always set speed\n\n\tLOG_DEBUG << \"Puck Manager returns: Speed \" << prioReturnVal.speedSignal << \" Actor Flag \" << prioReturnVal.actorFlag\n\t\t\t << \" Actor Signal \" << prioReturnVal.actorSignal << \" Error Flag \" << prioReturnVal.errorFlag\n\t\t\t << \" Error Signal \" << prioReturnVal.errorSignal << \" \\n\";\n\n\t\/\/ everything OK\n\treturn prioReturnVal;\n}\n<|endoftext|>"} {"text":"<commit_before>\/*\n * Copyright 2015 - 2018 gtalent2@gmail.com\n *\n * This Source Code Form is subject to the terms of the Mozilla Public\n * License, v. 2.0. If a copy of the MPL was not distributed with this\n * file, You can obtain one at http:\/\/mozilla.org\/MPL\/2.0\/.\n *\/\n\n#pragma once\n\n#include \"types.hpp\"\n\n#ifdef DEBUG\n#define OxError(x) x ? reinterpret_cast<uint64_t>(__FILE__) | _errorTags(__LINE__, x) : 0\n#else\n#define OxError(x) x\n#endif\n\nnamespace ox {\n\nusing Error = uint64_t;\n\nconstexpr Error errCode(Error err) {\n\treturn (err >> 58) & onMask<Error>(5);\n}\n\nstruct ErrorInfo {\n\tconst char *file = nullptr;\n\tint line = -1;\n\tError errCode = 0;\n\n\tErrorInfo() = default;\n\n\tErrorInfo(Error err) {\n\t\tthis->file = reinterpret_cast<const char*>(err & onMask<Error>(48));\n\t\tthis->line = static_cast<int>((err >> 48) & onMask<Error>(11));\n\t\tthis->errCode = ox::errCode(err);\n\t}\n};\n\nstatic constexpr Error _errorTags(Error line, Error errCode) {\n\tline &= onMask<Error>(11);\n\tline <<= 48;\n\terrCode &= onMask<Error>(5);\n\terrCode <<= 59;\n\treturn errCode | line;\n}\n\ntemplate<typename T>\nstruct ValErr {\n\tT value;\n\tError error;\n\n\tinline constexpr ValErr() = default;\n\n\tinline constexpr ValErr(T value, Error error = 0): value(value), error(error) {\n\t}\n\n\tinline constexpr operator const T&() const {\n\t\treturn value;\n\t}\n\n\tinline constexpr operator T&() {\n\t\treturn value;\n\t}\n\n\tinline constexpr bool ok() const {\n\t\treturn error == 0;\n\t}\n\n};\n\n}\n\n<commit_msg>[ox\/std] Add oxReturnError<commit_after>\/*\n * Copyright 2015 - 2018 gtalent2@gmail.com\n *\n * This Source Code Form is subject to the terms of the Mozilla Public\n * License, v. 2.0. If a copy of the MPL was not distributed with this\n * file, You can obtain one at http:\/\/mozilla.org\/MPL\/2.0\/.\n *\/\n\n#pragma once\n\n#include \"types.hpp\"\n\n#ifdef DEBUG\n#define OxError(x) x ? reinterpret_cast<uint64_t>(__FILE__) | _errorTags(__LINE__, x) : 0\n#else\n#define OxError(x) x\n#endif\n\n#define oxReturnError(x) if (const auto err = x) return OxError(err)\n\nnamespace ox {\n\nusing Error = uint64_t;\n\nconstexpr Error errCode(Error err) {\n\treturn (err >> 58) & onMask<Error>(5);\n}\n\nstruct ErrorInfo {\n\tconst char *file = nullptr;\n\tint line = -1;\n\tError errCode = 0;\n\n\tErrorInfo() = default;\n\n\tErrorInfo(Error err) {\n\t\tthis->file = reinterpret_cast<const char*>(err & onMask<Error>(48));\n\t\tthis->line = static_cast<int>((err >> 48) & onMask<Error>(11));\n\t\tthis->errCode = ox::errCode(err);\n\t}\n};\n\nstatic constexpr Error _errorTags(Error line, Error errCode) {\n\tline &= onMask<Error>(11);\n\tline <<= 48;\n\terrCode &= onMask<Error>(5);\n\terrCode <<= 59;\n\treturn errCode | line;\n}\n\ntemplate<typename T>\nstruct ValErr {\n\tT value;\n\tError error;\n\n\tinline constexpr ValErr() = default;\n\n\tinline constexpr ValErr(T value, Error error = 0): value(value), error(error) {\n\t}\n\n\tinline constexpr operator const T&() const {\n\t\treturn value;\n\t}\n\n\tinline constexpr operator T&() {\n\t\treturn value;\n\t}\n\n\tinline constexpr bool ok() const {\n\t\treturn error == 0;\n\t}\n\n};\n\n}\n\n<|endoftext|>"} {"text":"<commit_before><commit_msg>Move the change workign directory before loading external loads, allowing the files to be found<commit_after><|endoftext|>"} {"text":"<commit_before>\/*\n * Copyright 2011 Google Inc.\n *\n * Use of this source code is governed by a BSD-style license that can be\n * found in the LICENSE file.\n *\/\n\n#include \"gm\/gm.h\"\n#include \"include\/core\/SkCanvas.h\"\n#include \"include\/core\/SkClipOp.h\"\n#include \"include\/core\/SkColor.h\"\n#include \"include\/core\/SkFont.h\"\n#include \"include\/core\/SkFontTypes.h\"\n#include \"include\/core\/SkPaint.h\"\n#include \"include\/core\/SkPath.h\"\n#include \"include\/core\/SkRect.h\"\n#include \"include\/core\/SkScalar.h\"\n#include \"include\/core\/SkSize.h\"\n#include \"include\/core\/SkString.h\"\n#include \"include\/core\/SkTypeface.h\"\n#include \"include\/core\/SkTypes.h\"\n#include \"src\/core\/SkClipOpPriv.h\"\n#include \"tools\/Resources.h\"\n#include \"tools\/ToolUtils.h\"\n\n#include <string.h>\n\nnamespace skiagm {\n\nconstexpr SkColor gPathColor = SK_ColorBLACK;\nconstexpr SkColor gClipAColor = SK_ColorBLUE;\nconstexpr SkColor gClipBColor = SK_ColorRED;\n\nclass ComplexClipGM : public GM {\npublic:\n ComplexClipGM(bool aaclip, bool saveLayer, bool invertDraw)\n : fDoAAClip(aaclip)\n , fDoSaveLayer(saveLayer)\n , fInvertDraw(invertDraw) {\n this->setBGColor(0xFFDEDFDE);\n }\n\nprotected:\n SkString onShortName() override {\n SkString str;\n str.printf(\"complexclip_%s%s%s\",\n fDoAAClip ? \"aa\" : \"bw\",\n fDoSaveLayer ? \"_layer\" : \"\",\n fInvertDraw ? \"_invert\" : \"\");\n return str;\n }\n\n SkISize onISize() override { return SkISize::Make(970, 780); }\n\n void onDraw(SkCanvas* canvas) override {\n SkPath path;\n path.moveTo(0, 50)\n .quadTo(0, 0, 50, 0)\n .lineTo(175, 0)\n .quadTo(200, 0, 200, 25)\n .lineTo(200, 150)\n .quadTo(200, 200, 150, 200)\n .lineTo(0, 200)\n .close()\n .moveTo(50, 50)\n .lineTo(150, 50)\n .lineTo(150, 125)\n .quadTo(150, 150, 125, 150)\n .lineTo(50, 150)\n .close();\n if (fInvertDraw) {\n path.setFillType(SkPathFillType::kInverseEvenOdd);\n } else {\n path.setFillType(SkPathFillType::kEvenOdd);\n }\n SkPaint pathPaint;\n pathPaint.setAntiAlias(true);\n pathPaint.setColor(gPathColor);\n\n SkPath clipA;\n clipA.addPoly({{10, 20}, {165, 22}, {70, 105}, {165, 177}, {-5, 180}}, false).close();\n\n SkPath clipB;\n clipB.addPoly({{40, 10}, {190, 15}, {195, 190}, {40, 185}, {155, 100}}, false).close();\n\n SkFont font(ToolUtils::create_portable_typeface(), 20);\n\n constexpr struct {\n SkClipOp fOp;\n const char* fName;\n } gOps[] = { \/\/extra spaces in names for measureText\n {kIntersect_SkClipOp, \"Isect \"},\n {kDifference_SkClipOp, \"Diff \" },\n {kUnion_SkClipOp, \"Union \"},\n {kXOR_SkClipOp, \"Xor \" },\n {kReverseDifference_SkClipOp, \"RDiff \"}\n };\n\n canvas->translate(20, 20);\n canvas->scale(3 * SK_Scalar1 \/ 4, 3 * SK_Scalar1 \/ 4);\n\n if (fDoSaveLayer) {\n \/\/ We want the layer to appear symmetric relative to actual\n \/\/ device boundaries so we need to \"undo\" the effect of the\n \/\/ scale and translate\n SkRect bounds = SkRect::MakeLTRB(\n 4.0f\/3.0f * -20,\n 4.0f\/3.0f * -20,\n 4.0f\/3.0f * (this->getISize().fWidth - 20),\n 4.0f\/3.0f * (this->getISize().fHeight - 20));\n\n bounds.inset(100, 100);\n SkPaint boundPaint;\n boundPaint.setColor(SK_ColorRED);\n boundPaint.setStyle(SkPaint::kStroke_Style);\n canvas->drawRect(bounds, boundPaint);\n canvas->clipRect(bounds);\n canvas->saveLayer(&bounds, nullptr);\n }\n\n for (int invBits = 0; invBits < 4; ++invBits) {\n canvas->save();\n for (size_t op = 0; op < SK_ARRAY_COUNT(gOps); ++op) {\n this->drawHairlines(canvas, path, clipA, clipB);\n\n bool doInvA = SkToBool(invBits & 1);\n bool doInvB = SkToBool(invBits & 2);\n canvas->save();\n \/\/ set clip\n clipA.setFillType(doInvA ? SkPathFillType::kInverseEvenOdd :\n SkPathFillType::kEvenOdd);\n clipB.setFillType(doInvB ? SkPathFillType::kInverseEvenOdd :\n SkPathFillType::kEvenOdd);\n canvas->clipPath(clipA, fDoAAClip);\n canvas->clipPath(clipB, gOps[op].fOp, fDoAAClip);\n\n \/\/ In the inverse case we need to prevent the draw from covering the whole\n \/\/ canvas.\n if (fInvertDraw) {\n SkRect rectClip = clipA.getBounds();\n rectClip.join(path.getBounds());\n rectClip.join(path.getBounds());\n rectClip.outset(5, 5);\n canvas->clipRect(rectClip);\n }\n\n \/\/ draw path clipped\n canvas->drawPath(path, pathPaint);\n canvas->restore();\n\n\n SkPaint paint;\n SkScalar txtX = 45;\n paint.setColor(gClipAColor);\n const char* aTxt = doInvA ? \"InvA \" : \"A \";\n canvas->drawSimpleText(aTxt, strlen(aTxt), SkTextEncoding::kUTF8, txtX, 220, font, paint);\n txtX += font.measureText(aTxt, strlen(aTxt), SkTextEncoding::kUTF8);\n paint.setColor(SK_ColorBLACK);\n canvas->drawSimpleText(gOps[op].fName, strlen(gOps[op].fName), SkTextEncoding::kUTF8, txtX, 220,\n font, paint);\n txtX += font.measureText(gOps[op].fName, strlen(gOps[op].fName), SkTextEncoding::kUTF8);\n paint.setColor(gClipBColor);\n const char* bTxt = doInvB ? \"InvB \" : \"B \";\n canvas->drawSimpleText(bTxt, strlen(bTxt), SkTextEncoding::kUTF8, txtX, 220, font, paint);\n\n canvas->translate(250,0);\n }\n canvas->restore();\n canvas->translate(0, 250);\n }\n\n if (fDoSaveLayer) {\n canvas->restore();\n }\n }\nprivate:\n void drawHairlines(SkCanvas* canvas, const SkPath& path,\n const SkPath& clipA, const SkPath& clipB) {\n SkPaint paint;\n paint.setAntiAlias(true);\n paint.setStyle(SkPaint::kStroke_Style);\n const SkAlpha fade = 0x33;\n\n \/\/ draw path in hairline\n paint.setColor(gPathColor); paint.setAlpha(fade);\n canvas->drawPath(path, paint);\n\n \/\/ draw clips in hair line\n paint.setColor(gClipAColor); paint.setAlpha(fade);\n canvas->drawPath(clipA, paint);\n paint.setColor(gClipBColor); paint.setAlpha(fade);\n canvas->drawPath(clipB, paint);\n }\n\n bool fDoAAClip;\n bool fDoSaveLayer;\n bool fInvertDraw;\n\n typedef GM INHERITED;\n};\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nDEF_GM(return new ComplexClipGM(false, false, false);)\nDEF_GM(return new ComplexClipGM(false, false, true);)\nDEF_GM(return new ComplexClipGM(false, true, false);)\nDEF_GM(return new ComplexClipGM(false, true, true);)\nDEF_GM(return new ComplexClipGM(true, false, false);)\nDEF_GM(return new ComplexClipGM(true, false, true);)\nDEF_GM(return new ComplexClipGM(true, true, false);)\nDEF_GM(return new ComplexClipGM(true, true, true);)\n}\n\nDEF_SIMPLE_GM(clip_shader, canvas, 840, 650) {\n auto img = GetResourceAsImage(\"images\/yellow_rose.png\");\n auto sh = img->makeShader();\n\n SkRect r = SkRect::MakeIWH(img->width(), img->height());\n SkPaint p;\n\n canvas->translate(10, 10);\n canvas->drawImage(img, 0, 0, nullptr);\n\n canvas->save();\n canvas->translate(img->width() + 10, 0);\n canvas->clipShader(sh, SkClipOp::kIntersect);\n p.setColor(SK_ColorRED);\n canvas->drawRect(r, p);\n canvas->restore();\n\n canvas->save();\n canvas->translate(0, img->height() + 10);\n canvas->clipShader(sh, SkClipOp::kDifference);\n p.setColor(SK_ColorGREEN);\n canvas->drawRect(r, p);\n canvas->restore();\n\n canvas->save();\n canvas->translate(img->width() + 10, img->height() + 10);\n canvas->clipShader(sh, SkClipOp::kIntersect);\n canvas->save();\n SkMatrix lm = SkMatrix::MakeScale(1.0f \/ 5);\n canvas->clipShader(img->makeShader(SkTileMode::kRepeat, SkTileMode::kRepeat, &lm));\n canvas->drawImage(img, 0, 0, nullptr);\n\n canvas->restore();\n canvas->restore();\n}\n<commit_msg>add gm for clipShader in a layer<commit_after>\/*\n * Copyright 2011 Google Inc.\n *\n * Use of this source code is governed by a BSD-style license that can be\n * found in the LICENSE file.\n *\/\n\n#include \"gm\/gm.h\"\n#include \"include\/core\/SkCanvas.h\"\n#include \"include\/core\/SkClipOp.h\"\n#include \"include\/core\/SkColor.h\"\n#include \"include\/core\/SkFont.h\"\n#include \"include\/core\/SkFontTypes.h\"\n#include \"include\/core\/SkPaint.h\"\n#include \"include\/core\/SkPath.h\"\n#include \"include\/core\/SkRect.h\"\n#include \"include\/core\/SkScalar.h\"\n#include \"include\/core\/SkSize.h\"\n#include \"include\/core\/SkString.h\"\n#include \"include\/core\/SkTypeface.h\"\n#include \"include\/core\/SkTypes.h\"\n#include \"src\/core\/SkClipOpPriv.h\"\n#include \"tools\/Resources.h\"\n#include \"tools\/ToolUtils.h\"\n\n#include <string.h>\n\nnamespace skiagm {\n\nconstexpr SkColor gPathColor = SK_ColorBLACK;\nconstexpr SkColor gClipAColor = SK_ColorBLUE;\nconstexpr SkColor gClipBColor = SK_ColorRED;\n\nclass ComplexClipGM : public GM {\npublic:\n ComplexClipGM(bool aaclip, bool saveLayer, bool invertDraw)\n : fDoAAClip(aaclip)\n , fDoSaveLayer(saveLayer)\n , fInvertDraw(invertDraw) {\n this->setBGColor(0xFFDEDFDE);\n }\n\nprotected:\n SkString onShortName() override {\n SkString str;\n str.printf(\"complexclip_%s%s%s\",\n fDoAAClip ? \"aa\" : \"bw\",\n fDoSaveLayer ? \"_layer\" : \"\",\n fInvertDraw ? \"_invert\" : \"\");\n return str;\n }\n\n SkISize onISize() override { return SkISize::Make(970, 780); }\n\n void onDraw(SkCanvas* canvas) override {\n SkPath path;\n path.moveTo(0, 50)\n .quadTo(0, 0, 50, 0)\n .lineTo(175, 0)\n .quadTo(200, 0, 200, 25)\n .lineTo(200, 150)\n .quadTo(200, 200, 150, 200)\n .lineTo(0, 200)\n .close()\n .moveTo(50, 50)\n .lineTo(150, 50)\n .lineTo(150, 125)\n .quadTo(150, 150, 125, 150)\n .lineTo(50, 150)\n .close();\n if (fInvertDraw) {\n path.setFillType(SkPathFillType::kInverseEvenOdd);\n } else {\n path.setFillType(SkPathFillType::kEvenOdd);\n }\n SkPaint pathPaint;\n pathPaint.setAntiAlias(true);\n pathPaint.setColor(gPathColor);\n\n SkPath clipA;\n clipA.addPoly({{10, 20}, {165, 22}, {70, 105}, {165, 177}, {-5, 180}}, false).close();\n\n SkPath clipB;\n clipB.addPoly({{40, 10}, {190, 15}, {195, 190}, {40, 185}, {155, 100}}, false).close();\n\n SkFont font(ToolUtils::create_portable_typeface(), 20);\n\n constexpr struct {\n SkClipOp fOp;\n const char* fName;\n } gOps[] = { \/\/extra spaces in names for measureText\n {kIntersect_SkClipOp, \"Isect \"},\n {kDifference_SkClipOp, \"Diff \" },\n {kUnion_SkClipOp, \"Union \"},\n {kXOR_SkClipOp, \"Xor \" },\n {kReverseDifference_SkClipOp, \"RDiff \"}\n };\n\n canvas->translate(20, 20);\n canvas->scale(3 * SK_Scalar1 \/ 4, 3 * SK_Scalar1 \/ 4);\n\n if (fDoSaveLayer) {\n \/\/ We want the layer to appear symmetric relative to actual\n \/\/ device boundaries so we need to \"undo\" the effect of the\n \/\/ scale and translate\n SkRect bounds = SkRect::MakeLTRB(\n 4.0f\/3.0f * -20,\n 4.0f\/3.0f * -20,\n 4.0f\/3.0f * (this->getISize().fWidth - 20),\n 4.0f\/3.0f * (this->getISize().fHeight - 20));\n\n bounds.inset(100, 100);\n SkPaint boundPaint;\n boundPaint.setColor(SK_ColorRED);\n boundPaint.setStyle(SkPaint::kStroke_Style);\n canvas->drawRect(bounds, boundPaint);\n canvas->clipRect(bounds);\n canvas->saveLayer(&bounds, nullptr);\n }\n\n for (int invBits = 0; invBits < 4; ++invBits) {\n canvas->save();\n for (size_t op = 0; op < SK_ARRAY_COUNT(gOps); ++op) {\n this->drawHairlines(canvas, path, clipA, clipB);\n\n bool doInvA = SkToBool(invBits & 1);\n bool doInvB = SkToBool(invBits & 2);\n canvas->save();\n \/\/ set clip\n clipA.setFillType(doInvA ? SkPathFillType::kInverseEvenOdd :\n SkPathFillType::kEvenOdd);\n clipB.setFillType(doInvB ? SkPathFillType::kInverseEvenOdd :\n SkPathFillType::kEvenOdd);\n canvas->clipPath(clipA, fDoAAClip);\n canvas->clipPath(clipB, gOps[op].fOp, fDoAAClip);\n\n \/\/ In the inverse case we need to prevent the draw from covering the whole\n \/\/ canvas.\n if (fInvertDraw) {\n SkRect rectClip = clipA.getBounds();\n rectClip.join(path.getBounds());\n rectClip.join(path.getBounds());\n rectClip.outset(5, 5);\n canvas->clipRect(rectClip);\n }\n\n \/\/ draw path clipped\n canvas->drawPath(path, pathPaint);\n canvas->restore();\n\n\n SkPaint paint;\n SkScalar txtX = 45;\n paint.setColor(gClipAColor);\n const char* aTxt = doInvA ? \"InvA \" : \"A \";\n canvas->drawSimpleText(aTxt, strlen(aTxt), SkTextEncoding::kUTF8, txtX, 220, font, paint);\n txtX += font.measureText(aTxt, strlen(aTxt), SkTextEncoding::kUTF8);\n paint.setColor(SK_ColorBLACK);\n canvas->drawSimpleText(gOps[op].fName, strlen(gOps[op].fName), SkTextEncoding::kUTF8, txtX, 220,\n font, paint);\n txtX += font.measureText(gOps[op].fName, strlen(gOps[op].fName), SkTextEncoding::kUTF8);\n paint.setColor(gClipBColor);\n const char* bTxt = doInvB ? \"InvB \" : \"B \";\n canvas->drawSimpleText(bTxt, strlen(bTxt), SkTextEncoding::kUTF8, txtX, 220, font, paint);\n\n canvas->translate(250,0);\n }\n canvas->restore();\n canvas->translate(0, 250);\n }\n\n if (fDoSaveLayer) {\n canvas->restore();\n }\n }\nprivate:\n void drawHairlines(SkCanvas* canvas, const SkPath& path,\n const SkPath& clipA, const SkPath& clipB) {\n SkPaint paint;\n paint.setAntiAlias(true);\n paint.setStyle(SkPaint::kStroke_Style);\n const SkAlpha fade = 0x33;\n\n \/\/ draw path in hairline\n paint.setColor(gPathColor); paint.setAlpha(fade);\n canvas->drawPath(path, paint);\n\n \/\/ draw clips in hair line\n paint.setColor(gClipAColor); paint.setAlpha(fade);\n canvas->drawPath(clipA, paint);\n paint.setColor(gClipBColor); paint.setAlpha(fade);\n canvas->drawPath(clipB, paint);\n }\n\n bool fDoAAClip;\n bool fDoSaveLayer;\n bool fInvertDraw;\n\n typedef GM INHERITED;\n};\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nDEF_GM(return new ComplexClipGM(false, false, false);)\nDEF_GM(return new ComplexClipGM(false, false, true);)\nDEF_GM(return new ComplexClipGM(false, true, false);)\nDEF_GM(return new ComplexClipGM(false, true, true);)\nDEF_GM(return new ComplexClipGM(true, false, false);)\nDEF_GM(return new ComplexClipGM(true, false, true);)\nDEF_GM(return new ComplexClipGM(true, true, false);)\nDEF_GM(return new ComplexClipGM(true, true, true);)\n}\n\nDEF_SIMPLE_GM(clip_shader, canvas, 840, 650) {\n auto img = GetResourceAsImage(\"images\/yellow_rose.png\");\n auto sh = img->makeShader();\n\n SkRect r = SkRect::MakeIWH(img->width(), img->height());\n SkPaint p;\n\n canvas->translate(10, 10);\n canvas->drawImage(img, 0, 0, nullptr);\n\n canvas->save();\n canvas->translate(img->width() + 10, 0);\n canvas->clipShader(sh, SkClipOp::kIntersect);\n p.setColor(SK_ColorRED);\n canvas->drawRect(r, p);\n canvas->restore();\n\n canvas->save();\n canvas->translate(0, img->height() + 10);\n canvas->clipShader(sh, SkClipOp::kDifference);\n p.setColor(SK_ColorGREEN);\n canvas->drawRect(r, p);\n canvas->restore();\n\n canvas->save();\n canvas->translate(img->width() + 10, img->height() + 10);\n canvas->clipShader(sh, SkClipOp::kIntersect);\n canvas->save();\n SkMatrix lm = SkMatrix::MakeScale(1.0f \/ 5);\n canvas->clipShader(img->makeShader(SkTileMode::kRepeat, SkTileMode::kRepeat, &lm));\n canvas->drawImage(img, 0, 0, nullptr);\n\n canvas->restore();\n canvas->restore();\n}\n\nDEF_SIMPLE_GM(clip_shader_layer, canvas, 430, 320) {\n auto img = GetResourceAsImage(\"images\/yellow_rose.png\");\n auto sh = img->makeShader();\n\n SkRect r = SkRect::MakeIWH(img->width(), img->height());\n\n canvas->translate(10, 10);\n \/\/ now add the cool clip\n canvas->clipRect(r);\n canvas->clipShader(sh);\n \/\/ now draw a layer with the same image, and watch it get restored w\/ the clip\n canvas->saveLayer(&r, nullptr);\n canvas->drawColor(0xFFFF0000);\n canvas->restore();\n}\n<|endoftext|>"} {"text":"<commit_before>\/*\n ePaper.cpp\n 2013 Copyright (c) Seeed Technology Inc. All right reserved.\n\n Modified by Loovee\n www.seeedstudio.com\n 2013-7-2\n\n This library is free software; you can redistribute it and\/or\n modify it under the terms of the GNU Lesser General Public\n License as published by the Free Software Foundation; either\n version 2.1 of the License, or (at your option) any later version.\n\n This library is distributed in the hope that it will be useful,\n but WITHOUT ANY WARRANTY; without even the implied warranty of\n MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU\n Lesser General Public License for more details.\n\n You should have received 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#include <SPI.h>\n#include \"GT20L16_drive.h\"\n#include \"ePaper.h\"\n\n\nstatic void spi_on()\n{\n SPI.begin();\n \/\/SPI.setClockDivider(SPI_CLOCK_DIV2);\n \/\/SPI_put(0x00);\n \/\/SPI_put(0x00);\n}\n\n\/*********************************************************************************************************\n* \\brief According to EPD size and temperature to get stage_time\n* \\note Refer to COG document Section 5.3 for more details\n*\n* \\param EPD_type_index The defined EPD size\n**********************************************************************************************************\/\nvoid ePaper::begin(EPD_size sz)\n{\n size = sz;\n direction = DIRNORMAL;\n\n DISP_LEN = 200;\n DISP_WIDTH = 96;\n \n EPD.begin(size);\n init_io();\n}\n\n\n\/*********************************************************************************************************\n** Function name: start\n** Descriptions: start\n*********************************************************************************************************\/\nvoid ePaper::start()\n{\n EPD.start();\n}\n\n\/*********************************************************************************************************\n** Function name: end\n** Descriptions: end\n*********************************************************************************************************\/\nvoid ePaper::end()\n{\n EPD.end();\n}\n\n\/*********************************************************************************************************\n** Function name: init_io\n** Descriptions: init IO\n*********************************************************************************************************\/\nvoid ePaper::init_io()\n{\n \/\/ init IO\n pinMode(Pin_BUSY, INPUT);\n pinMode(Pin_RESET, OUTPUT);\n pinMode(Pin_PANEL_ON, OUTPUT);\n pinMode(Pin_DISCHARGE, OUTPUT);\n pinMode(Pin_BORDER, OUTPUT);\n pinMode(Pin_EPD_CS, OUTPUT);\n pinMode(Pin_SD_CS, OUTPUT);\n \n pinMode(9, OUTPUT);\n digitalWrite(9, HIGH);\n\n digitalWrite(Pin_RESET, LOW);\n digitalWrite(Pin_PANEL_ON, LOW);\n digitalWrite(Pin_DISCHARGE, LOW);\n digitalWrite(Pin_BORDER, LOW);\n digitalWrite(Pin_EPD_CS, HIGH);\n digitalWrite(Pin_SD_CS, HIGH);\n \n \/\/ init SPI\n SPI.begin();\n SPI.setBitOrder(MSBFIRST);\n SPI.setDataMode(SPI_MODE0);\n \/\/SPI.setClockDivider(SPI_CLOCK_DIV2);\n}\n\n\n\/*********************************************************************************************************\n** Function name: drawUnicode\n** Descriptions: draw a unicode\n*********************************************************************************************************\/\nint ePaper::drawUnicode(unsigned int uniCode, int x, int y)\n{\n \n \/\/ if(((x+16)>= DISP_LEN) || ((y+16) >= DISP_WIDTH) || x<0 || y<0) return 0;\n \n\n int dtaLen = GT20L16.getMatrixUnicode(uniCode, tMatrix);\n\n\n int pX = 0;\n int pY = 0;\n int color = 0;\n \/\/spi_on();\n for(int k = 0; k<2; k++)\n {\n for(int i=0; i<8; i++)\n {\n for(int j=0; j<(dtaLen\/2); j++)\n {\n\n if(tMatrix[j+(dtaLen\/2)*k] & (0x01<<(7-i)))\n { \n color = 1;\n }\n else\n {\n color = 0;\n }\n \n pX = x + j;\n pY = y + k*8+i;\n \n \n drawPixel(pX, pY, color);\n }\n }\n }\n\n return dtaLen\/2; \/\/ x +\n}\n\nint ePaper::drawUnicode(unsigned char *matrix, int x, int y)\n{\n \n \/\/ if(((x+16)>= DISP_LEN) || ((y+16) >= DISP_WIDTH) || x<0 || y<0) return 0;\n \n\n int dtaLen = 32;\n int pX = 0;\n int pY = 0;\n int color = 0;\n \/\/spi_on();\n for(int k = 0; k<2; k++)\n {\n for(int i=0; i<8; i++)\n {\n for(int j=0; j<(dtaLen\/2); j++)\n {\n\n if(matrix[j+(dtaLen\/2)*k] & (0x01<<(7-i)))\n { \n color = 1;\n }\n else\n {\n color = 0;\n }\n \n pX = x + j;\n pY = y + k*8+i;\n \n drawPixel(pX, pY, color);\n }\n }\n }\n\n return dtaLen\/2; \/\/ x +\n}\n\n\/*********************************************************************************************************\n** Function name: drawUnicodeString\n** Descriptions: draw string\n*********************************************************************************************************\/\nint ePaper::drawUnicodeString(unsigned int *uniCode, int len, int x, int y)\n{\n int xPlus = 0;\n int xSum = 0;\n \n for(int i=0; i<len; i++)\n {\n xPlus = drawUnicode(uniCode[i], x, y);\n x += xPlus;\n xSum += xPlus;\n }\n return xSum;\n}\n\n\/*********************************************************************************************************\n** Function name: drawChar\n** Descriptions: draw char\n*********************************************************************************************************\/\nint ePaper::drawChar(char c, int x, int y)\n{\n return drawUnicode(c, x, y);\n}\n\n\/*********************************************************************************************************\n** Function name: drawString\n** Descriptions: draw string\n*********************************************************************************************************\/\nint ePaper::drawString(char *string, int poX, int poY)\n{\n int sumX = 0;\n\n while(*string)\n {\n \n int xPlus = drawChar(*string, poX, poY);\n sumX += xPlus;\n *string++;\n \n if(poX < 200)\n {\n poX += xPlus; \/* Move cursor right *\/\n }\n }\n \n return sumX;\n}\n\n\/*********************************************************************************************************\n** Function name: drawNumber\n** Descriptions: drawNumber\n*********************************************************************************************************\/\nint ePaper::drawNumber(long long_num,int poX, int poY)\n{\n char tmp[10];\n sprintf(tmp, \"%d\", long_num);\n return drawString(tmp, poX, poY);\n\n}\n\n\/*********************************************************************************************************\n** Function name: drawFloat\n** Descriptions: drawFloat\n*********************************************************************************************************\/\nint ePaper::drawFloat(float floatNumber, int decimal, int poX, int poY)\n{\n unsigned long temp=0;\n float decy=0.0;\n float rounding = 0.5;\n unsigned char f=0;\n \n float eep = 0.000001;\n \n int sumX = 0;\n int xPlus = 0;\n \n if(floatNumber-0.0 < eep) \/\/ floatNumber < 0\n {\n xPlus = drawChar('-',poX, poY);\n floatNumber = -floatNumber;\n\n poX += xPlus; \n sumX += xPlus;\n }\n \n for (unsigned char i=0; i<decimal; ++i)\n {\n rounding \/= 10.0;\n }\n \n floatNumber += rounding;\n\n temp = (long)floatNumber;\n \n \n xPlus = drawNumber(temp,poX, poY);\n\n poX += xPlus; \n sumX += xPlus;\n\n if(decimal>0)\n {\n xPlus = drawChar('.',poX, poY);\n poX += xPlus; \/* Move cursor right *\/\n sumX += xPlus;\n }\n else\n {\n return sumX;\n }\n \n decy = floatNumber - temp;\n for(unsigned char i=0; i<decimal; i++) \n {\n decy *= 10; \/* for the next decimal *\/\n temp = decy; \/* get the decimal *\/\n xPlus = drawNumber(temp,poX, poY);\n \n poX += xPlus; \/* Move cursor right *\/\n sumX += xPlus;\n decy -= temp;\n }\n return sumX;\n}\n\n\/*********************************************************************************************************\n** Function name: drawLine\n** Descriptions: drawLine\n*********************************************************************************************************\/\nvoid ePaper::drawLine(int x0, int y0, int x1, int y1)\n{\n\n init_io();\n \n int x = x1-x0;\n int y = y1-y0;\n int dx = abs(x), sx = x0<x1 ? 1 : -1;\n int dy = -abs(y), sy = y0<y1 ? 1 : -1;\n int err = dx+dy, e2; \n for (;;)\n { \n drawPixel(x0,y0,1);\n e2 = 2*err;\n if (e2 >= dy) \n { \n if (x0 == x1) break;\n err += dy; x0 += sx;\n }\n if (e2 <= dx) \n { \n if (y0 == y1) break;\n err += dx; y0 += sy;\n }\n }\n}\n\n\n\/*********************************************************************************************************\n** Function name: clear_sd\n** Descriptions: clear sd card\n*********************************************************************************************************\/\nvoid ePaper::clear_sd()\n{\n \n init_io();\n \n for(int i=0; i<DISP_WIDTH; i++)\n {\n for(int j=0; j<DISP_LEN; j++)\n {\n drawPixel(j, i, 0);\n \n }\n }\n}\n\n\/*********************************************************************************************************\n** Function name: drawCircle\n** Descriptions: drawCircle\n*********************************************************************************************************\/\nvoid ePaper::drawCircle(int poX, int poY, int r)\n{\n\n init_io();\n int x = -r, y = 0, err = 2-2*r, e2;\n do {\n drawPixel(poX-x, poY+y, 1);\n drawPixel(poX+x, poY+y, 1);\n drawPixel(poX+x, poY-y, 1);\n drawPixel(poX-x, poY-y, 1);\n e2 = err;\n if (e2 <= y) {\n err += ++y*2+1;\n if (-x == y && e2 <= x) e2 = 0;\n }\n if (e2 > x) err += ++x*2+1;\n } while (x <= 0);\n}\n\n\/*********************************************************************************************************\n** Function name: drawHorizontalLine\n** Descriptions: drawHorizontalLine\n*********************************************************************************************************\/\nvoid ePaper::drawHorizontalLine( int poX, int poY, int len)\n{\n drawLine(poX, poY, poX+len, poY);\n}\n\n\/*********************************************************************************************************\n** Function name: drawVerticalLine\n** Descriptions: drawVerticalLine\n*********************************************************************************************************\/\nvoid ePaper::drawVerticalLine( int poX, int poY, int len)\n{\n drawLine(poX, poY, poX, poY+len);\n}\n\n\/*********************************************************************************************************\n** Function name: drawRectangle\n** Descriptions: drawRectangle\n*********************************************************************************************************\/\nvoid ePaper::drawRectangle(int poX, int poY, int len, int width)\n{\n drawHorizontalLine(poX, poY, len);\n drawHorizontalLine(poX, poY+width, len);\n drawVerticalLine(poX, poY, width);\n drawVerticalLine(poX + len, poY, width);\n}\n\n\/*********************************************************************************************************\n** Function name: fillCircle\n** Descriptions: fillCircle\n*********************************************************************************************************\/\nvoid ePaper::fillCircle(int poX, int poY, int r)\n{\n int x = -r, y = 0, err = 2-2*r, e2;\n \n do {\n\n drawVerticalLine(poX-x, poY-y, 2*y);\n drawVerticalLine(poX+x, poY-y, 2*y);\n\n e2 = err;\n if (e2 <= y) {\n err += ++y*2+1;\n if (-x == y && e2 <= x) e2 = 0;\n }\n if (e2 > x) err += ++x*2+1;\n } while (x <= 0);\n\n}\n\n\/*********************************************************************************************************\n** Function name: drawTraingle\n** Descriptions: drawTraingle\n*********************************************************************************************************\/\nvoid ePaper::drawTraingle( int poX1, int poY1, int poX2, int poY2, int poX3, int poY3)\n{\n drawLine(poX1, poY1, poX2, poY2);\n drawLine(poX1, poY1, poX3, poY3);\n drawLine(poX2, poY2, poX3, poY3);\n}\n\n\/*********************************************************************************************************\n** Function name: drawTraingle\n** Descriptions: drawTraingle\n*********************************************************************************************************\/\nvoid ePaper::fillRectangle(int poX, int poY, int len, int width)\n{\n for(int i=0; i<width; i++)\n {\n drawHorizontalLine(poX, poY+i, len);\n }\n}\n\n\/*********************************************************************************************************\n** Function name: display\n** Descriptions: you should use this function once after finish drawing\n*********************************************************************************************************\/\nunsigned char ePaper::display()\n{\n start();\n#if defined(__AVR_ATmega32U4__) || defined(__AVR_ATmega328P__)\n EPD.image_sd();\n#elif defined(__AVR_ATmega1280__) || defined(__AVR_ATmega2560__)\n EPD.image_sram(eSD.sram_image);\n#endif\n end();\n}\n\nePaper EPAPER;\n\/*********************************************************************************************************\n END FILE\n*********************************************************************************************************\/\n<commit_msg>Removed useless comments and dead code<commit_after>\/*\n ePaper.cpp\n 2013 Copyright (c) Seeed Technology Inc. All right reserved.\n\n Modified by Loovee\n www.seeedstudio.com\n 2013-7-2\n\n This library is free software; you can redistribute it and\/or\n modify it under the terms of the GNU Lesser General Public\n License as published by the Free Software Foundation; either\n version 2.1 of the License, or (at your option) any later version.\n\n This library is distributed in the hope that it will be useful,\n but WITHOUT ANY WARRANTY; without even the implied warranty of\n MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU\n Lesser General Public License for more details.\n\n You should have received 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#include <SPI.h>\n#include \"GT20L16_drive.h\"\n#include \"ePaper.h\"\n\n\nstatic void spi_on(){\n SPI.begin();\n}\n\nvoid ePaper::begin(EPD_size sz){\n size = sz;\n direction = DIRNORMAL;\n\n DISP_LEN = 200;\n DISP_WIDTH = 96;\n \n EPD.begin(size);\n init_io();\n}\n\nvoid ePaper::start(){\n EPD.start();\n}\n\nvoid ePaper::end(){\n EPD.end();\n}\n\nvoid ePaper::init_io(){\n pinMode(Pin_BUSY, INPUT);\n pinMode(Pin_RESET, OUTPUT);\n pinMode(Pin_PANEL_ON, OUTPUT);\n pinMode(Pin_DISCHARGE, OUTPUT);\n pinMode(Pin_BORDER, OUTPUT);\n pinMode(Pin_EPD_CS, OUTPUT);\n pinMode(Pin_SD_CS, OUTPUT);\n \n pinMode(9, OUTPUT);\n digitalWrite(9, HIGH);\n\n digitalWrite(Pin_RESET, LOW);\n digitalWrite(Pin_PANEL_ON, LOW);\n digitalWrite(Pin_DISCHARGE, LOW);\n digitalWrite(Pin_BORDER, LOW);\n digitalWrite(Pin_EPD_CS, HIGH);\n digitalWrite(Pin_SD_CS, HIGH);\n \n SPI.begin();\n SPI.setBitOrder(MSBFIRST);\n SPI.setDataMode(SPI_MODE0);\n}\n\n\nint ePaper::drawUnicode(unsigned int uniCode, int x, int y) {\n \n\n int dtaLen = GT20L16.getMatrixUnicode(uniCode, tMatrix);\n\n\n int pX = 0;\n int pY = 0;\n int color = 0;\n\n for(int k = 0; k<2; k++)\n {\n for(int i=0; i<8; i++)\n {\n for(int j=0; j<(dtaLen\/2); j++)\n {\n\n if(tMatrix[j+(dtaLen\/2)*k] & (0x01<<(7-i)))\n { \n color = 1;\n }\n else\n {\n color = 0;\n }\n \n pX = x + j;\n pY = y + k*8+i;\n \n \n drawPixel(pX, pY, color);\n }\n }\n }\n\n return dtaLen\/2; \/\/ x +\n}\n\nint ePaper::drawUnicode(unsigned char *matrix, int x, int y)\n{\n\n int dtaLen = 32;\n int pX = 0;\n int pY = 0;\n int color = 0;\n \/\/spi_on();\n for(int k = 0; k<2; k++)\n {\n for(int i=0; i<8; i++)\n {\n for(int j=0; j<(dtaLen\/2); j++)\n {\n\n if(matrix[j+(dtaLen\/2)*k] & (0x01<<(7-i)))\n { \n color = 1;\n }\n else\n {\n color = 0;\n }\n \n pX = x + j;\n pY = y + k*8+i;\n \n drawPixel(pX, pY, color);\n }\n }\n }\n\n return dtaLen\/2; \/\/ x +\n}\n\n\nint ePaper::drawUnicodeString(unsigned int *uniCode, int len, int x, int y)\n{\n int xPlus = 0;\n int xSum = 0;\n \n for(int i=0; i<len; i++)\n {\n xPlus = drawUnicode(uniCode[i], x, y);\n x += xPlus;\n xSum += xPlus;\n }\n return xSum;\n}\n\n\nint ePaper::drawChar(char c, int x, int y)\n{\n return drawUnicode(c, x, y);\n}\n\n\nint ePaper::drawString(char *string, int poX, int poY)\n{\n int sumX = 0;\n\n while(*string)\n {\n \n int xPlus = drawChar(*string, poX, poY);\n sumX += xPlus;\n *string++;\n \n if(poX < 200)\n {\n poX += xPlus; \/* Move cursor right *\/\n }\n }\n \n return sumX;\n}\n\n\nint ePaper::drawNumber(long long_num,int poX, int poY)\n{\n char tmp[10];\n sprintf(tmp, \"%d\", long_num);\n return drawString(tmp, poX, poY);\n\n}\n\n\nint ePaper::drawFloat(float floatNumber, int decimal, int poX, int poY)\n{\n unsigned long temp=0;\n float decy=0.0;\n float rounding = 0.5;\n unsigned char f=0;\n \n float eep = 0.000001;\n \n int sumX = 0;\n int xPlus = 0;\n \n if(floatNumber-0.0 < eep) \/\/ floatNumber < 0\n {\n xPlus = drawChar('-',poX, poY);\n floatNumber = -floatNumber;\n\n poX += xPlus; \n sumX += xPlus;\n }\n \n for (unsigned char i=0; i<decimal; ++i)\n {\n rounding \/= 10.0;\n }\n \n floatNumber += rounding;\n\n temp = (long)floatNumber;\n \n \n xPlus = drawNumber(temp,poX, poY);\n\n poX += xPlus; \n sumX += xPlus;\n\n if(decimal>0)\n {\n xPlus = drawChar('.',poX, poY);\n poX += xPlus; \/* Move cursor right *\/\n sumX += xPlus;\n }\n else\n {\n return sumX;\n }\n \n decy = floatNumber - temp;\n for(unsigned char i=0; i<decimal; i++) \n {\n decy *= 10; \/* for the next decimal *\/\n temp = decy; \/* get the decimal *\/\n xPlus = drawNumber(temp,poX, poY);\n \n poX += xPlus; \/* Move cursor right *\/\n sumX += xPlus;\n decy -= temp;\n }\n return sumX;\n}\n\n\nvoid ePaper::drawLine(int x0, int y0, int x1, int y1)\n{\n\n init_io();\n \n int x = x1-x0;\n int y = y1-y0;\n int dx = abs(x), sx = x0<x1 ? 1 : -1;\n int dy = -abs(y), sy = y0<y1 ? 1 : -1;\n int err = dx+dy, e2; \n for (;;)\n { \n drawPixel(x0,y0,1);\n e2 = 2*err;\n if (e2 >= dy) \n { \n if (x0 == x1) break;\n err += dy; x0 += sx;\n }\n if (e2 <= dx) \n { \n if (y0 == y1) break;\n err += dx; y0 += sy;\n }\n }\n}\n\n\nvoid ePaper::clear_sd()\n{\n \n init_io();\n \n for(int i=0; i<DISP_WIDTH; i++)\n {\n for(int j=0; j<DISP_LEN; j++)\n {\n drawPixel(j, i, 0);\n \n }\n }\n}\n\n\nvoid ePaper::drawCircle(int poX, int poY, int r)\n{\n\n init_io();\n int x = -r, y = 0, err = 2-2*r, e2;\n do {\n drawPixel(poX-x, poY+y, 1);\n drawPixel(poX+x, poY+y, 1);\n drawPixel(poX+x, poY-y, 1);\n drawPixel(poX-x, poY-y, 1);\n e2 = err;\n if (e2 <= y) {\n err += ++y*2+1;\n if (-x == y && e2 <= x) e2 = 0;\n }\n if (e2 > x) err += ++x*2+1;\n } while (x <= 0);\n}\n\n\nvoid ePaper::drawHorizontalLine( int poX, int poY, int len)\n{\n drawLine(poX, poY, poX+len, poY);\n}\n\n\nvoid ePaper::drawVerticalLine( int poX, int poY, int len)\n{\n drawLine(poX, poY, poX, poY+len);\n}\n\n\nvoid ePaper::drawRectangle(int poX, int poY, int len, int width)\n{\n drawHorizontalLine(poX, poY, len);\n drawHorizontalLine(poX, poY+width, len);\n drawVerticalLine(poX, poY, width);\n drawVerticalLine(poX + len, poY, width);\n}\n\n\nvoid ePaper::fillCircle(int poX, int poY, int r)\n{\n int x = -r, y = 0, err = 2-2*r, e2;\n \n do {\n\n drawVerticalLine(poX-x, poY-y, 2*y);\n drawVerticalLine(poX+x, poY-y, 2*y);\n\n e2 = err;\n if (e2 <= y) {\n err += ++y*2+1;\n if (-x == y && e2 <= x) e2 = 0;\n }\n if (e2 > x) err += ++x*2+1;\n } while (x <= 0);\n\n}\n\n\nvoid ePaper::drawTraingle( int poX1, int poY1, int poX2, int poY2, int poX3, int poY3)\n{\n drawLine(poX1, poY1, poX2, poY2);\n drawLine(poX1, poY1, poX3, poY3);\n drawLine(poX2, poY2, poX3, poY3);\n}\n\n\nvoid ePaper::fillRectangle(int poX, int poY, int len, int width)\n{\n for(int i=0; i<width; i++)\n {\n drawHorizontalLine(poX, poY+i, len);\n }\n}\n\n\nunsigned char ePaper::display()\n{\n start();\n#if defined(__AVR_ATmega32U4__) || defined(__AVR_ATmega328P__)\n EPD.image_sd();\n#elif defined(__AVR_ATmega1280__) || defined(__AVR_ATmega2560__)\n EPD.image_sram(eSD.sram_image);\n#endif\n end();\n}\n\nePaper EPAPER;\n<|endoftext|>"} {"text":"<commit_before><commit_msg>Oilpan: ASan build fix after r198184<commit_after><|endoftext|>"} {"text":"<commit_before><commit_msg>computeCI(): Constify read-only variable<commit_after><|endoftext|>"} {"text":"<commit_before>\/\/===- lib\/Driver\/WinLinkInputGraph.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 \"lld\/Driver\/WinLinkInputGraph.h\"\n\nnamespace lld {\n\n\/\/\/ \\brief Parse the input file to lld::File.\nerror_code PECOFFFileNode::parse(const LinkingContext &ctx,\n raw_ostream &diagnostics) {\n ErrorOr<StringRef> filePath = getPath(ctx);\n if (!filePath) {\n diagnostics << \"File not found: \" << _path << \"\\n\";\n return error_code(filePath);\n }\n\n if (error_code ec = getBuffer(*filePath)) {\n diagnostics << \"Cannot open file: \" << *filePath << \"\\n\";\n return ec;\n }\n\n if (ctx.logInputFiles())\n diagnostics << *filePath << \"\\n\";\n\n if (filePath->endswith(\".objtxt\"))\n return ctx.getYAMLReader().parseFile(_buffer, _files);\n\n llvm::sys::fs::file_magic FileType =\n llvm::sys::fs::identify_magic(_buffer->getBuffer());\n std::unique_ptr<File> f;\n\n switch (FileType) {\n case llvm::sys::fs::file_magic::archive: {\n \/\/ Archive File\n error_code ec;\n f.reset(new FileArchive(ctx, std::move(_buffer), ec, false));\n _files.push_back(std::move(f));\n return ec;\n }\n case llvm::sys::fs::file_magic::coff_object:\n default:\n return _ctx.getDefaultReader().parseFile(_buffer, _files);\n }\n}\n\nErrorOr<File &> PECOFFFileNode::getNextFile() {\n if (_nextFileIndex == _files.size())\n return make_error_code(InputGraphError::no_more_files);\n return *_files[_nextFileIndex++];\n}\n\nErrorOr<StringRef> PECOFFFileNode::getPath(const LinkingContext &) const {\n if (_path.endswith_lower(\".lib\"))\n return _ctx.searchLibraryFile(_path);\n if (llvm::sys::path::extension(_path).empty())\n return _ctx.allocate(_path.str() + \".obj\");\n return _path;\n}\n\nErrorOr<StringRef> PECOFFLibraryNode::getPath(const LinkingContext &) const {\n if (_path.endswith_lower(\".lib\"))\n return _ctx.searchLibraryFile(_path);\n return _ctx.searchLibraryFile(_ctx.allocate(_path.str() + \".lib\"));\n}\n\n} \/\/ end anonymous namespace\n<commit_msg>Simplify a switch statement.<commit_after>\/\/===- lib\/Driver\/WinLinkInputGraph.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 \"lld\/Driver\/WinLinkInputGraph.h\"\n\nusing llvm::sys::fs::file_magic;\nusing llvm::sys::fs::identify_magic;\n\nnamespace lld {\n\n\/\/\/ \\brief Parse the input file to lld::File.\nerror_code PECOFFFileNode::parse(const LinkingContext &ctx,\n raw_ostream &diagnostics) {\n ErrorOr<StringRef> filePath = getPath(ctx);\n if (!filePath) {\n diagnostics << \"File not found: \" << _path << \"\\n\";\n return error_code(filePath);\n }\n\n if (error_code ec = getBuffer(*filePath)) {\n diagnostics << \"Cannot open file: \" << *filePath << \"\\n\";\n return ec;\n }\n\n if (ctx.logInputFiles())\n diagnostics << *filePath << \"\\n\";\n\n if (filePath->endswith(\".objtxt\"))\n return ctx.getYAMLReader().parseFile(_buffer, _files);\n if (identify_magic(_buffer->getBuffer()) == file_magic::archive) {\n \/\/ Archive File\n error_code ec;\n _files.push_back(std::unique_ptr<File>(\n new FileArchive(ctx, std::move(_buffer), ec, false)));\n return ec;\n }\n return _ctx.getDefaultReader().parseFile(_buffer, _files);\n}\n\nErrorOr<File &> PECOFFFileNode::getNextFile() {\n if (_nextFileIndex == _files.size())\n return make_error_code(InputGraphError::no_more_files);\n return *_files[_nextFileIndex++];\n}\n\nErrorOr<StringRef> PECOFFFileNode::getPath(const LinkingContext &) const {\n if (_path.endswith_lower(\".lib\"))\n return _ctx.searchLibraryFile(_path);\n if (llvm::sys::path::extension(_path).empty())\n return _ctx.allocate(_path.str() + \".obj\");\n return _path;\n}\n\nErrorOr<StringRef> PECOFFLibraryNode::getPath(const LinkingContext &) const {\n if (_path.endswith_lower(\".lib\"))\n return _ctx.searchLibraryFile(_path);\n return _ctx.searchLibraryFile(_ctx.allocate(_path.str() + \".lib\"));\n}\n\n} \/\/ end anonymous namespace\n<|endoftext|>"} {"text":"<commit_before>\/\/===--- FrontendActions.cpp ----------------------------------------------===\/\/\n\/\/\n\/\/ The LLVM Compiler Infrastructure\n\/\/\n\/\/ This file is distributed under the University of Illinois Open Source\n\/\/ License. See LICENSE.TXT for details.\n\/\/\n\/\/===----------------------------------------------------------------------===\/\/\n\n#include \"clang\/Frontend\/FrontendActions.h\"\n#include \"clang\/AST\/ASTConsumer.h\"\n#include \"clang\/Lex\/Preprocessor.h\"\n#include \"clang\/Parse\/Parser.h\"\n#include \"clang\/Basic\/FileManager.h\"\n#include \"clang\/Frontend\/AnalysisConsumer.h\"\n#include \"clang\/Frontend\/ASTConsumers.h\"\n#include \"clang\/Frontend\/ASTUnit.h\"\n#include \"clang\/Frontend\/CompilerInstance.h\"\n#include \"clang\/Frontend\/FixItRewriter.h\"\n#include \"clang\/Frontend\/FrontendDiagnostic.h\"\n#include \"clang\/Frontend\/Utils.h\"\n#include \"llvm\/Support\/raw_ostream.h\"\nusing namespace clang;\n\n\/\/===----------------------------------------------------------------------===\/\/\n\/\/ AST Consumer Actions\n\/\/===----------------------------------------------------------------------===\/\/\n\nASTConsumer *AnalysisAction::CreateASTConsumer(CompilerInstance &CI,\n llvm::StringRef InFile) {\n return CreateAnalysisConsumer(CI.getPreprocessor(),\n CI.getFrontendOpts().OutputFile,\n CI.getAnalyzerOpts());\n}\n\nASTConsumer *ASTPrintAction::CreateASTConsumer(CompilerInstance &CI,\n llvm::StringRef InFile) {\n if (llvm::raw_ostream *OS = CI.createDefaultOutputFile(false, InFile))\n return CreateASTPrinter(OS);\n return 0;\n}\n\nASTConsumer *ASTPrintXMLAction::CreateASTConsumer(CompilerInstance &CI,\n llvm::StringRef InFile) {\n if (llvm::raw_ostream *OS = CI.createDefaultOutputFile(false, InFile, \"xml\"))\n return CreateASTPrinterXML(OS);\n return 0;\n}\n\nASTConsumer *ASTDumpAction::CreateASTConsumer(CompilerInstance &CI,\n llvm::StringRef InFile) {\n return CreateASTDumper();\n}\n\nASTConsumer *ASTViewAction::CreateASTConsumer(CompilerInstance &CI,\n llvm::StringRef InFile) {\n return CreateASTViewer();\n}\n\nASTConsumer *DeclContextPrintAction::CreateASTConsumer(CompilerInstance &CI,\n llvm::StringRef InFile) {\n return CreateDeclContextPrinter();\n}\n\nASTConsumer *DumpRecordAction::CreateASTConsumer(CompilerInstance &CI,\n llvm::StringRef InFile) {\n return CreateRecordLayoutDumper();\n}\n\nASTConsumer *GeneratePCHAction::CreateASTConsumer(CompilerInstance &CI,\n llvm::StringRef InFile) {\n const std::string &Sysroot = CI.getHeaderSearchOpts().Sysroot;\n if (CI.getFrontendOpts().RelocatablePCH &&\n Sysroot.empty()) {\n CI.getDiagnostics().Report(diag::err_relocatable_without_without_isysroot);\n return 0;\n }\n\n llvm::raw_ostream *OS = CI.createDefaultOutputFile(true, InFile);\n if (!OS)\n return 0;\n\n if (CI.getFrontendOpts().RelocatablePCH)\n return CreatePCHGenerator(CI.getPreprocessor(), OS, Sysroot.c_str());\n\n return CreatePCHGenerator(CI.getPreprocessor(), OS);\n}\n\nASTConsumer *HTMLPrintAction::CreateASTConsumer(CompilerInstance &CI,\n llvm::StringRef InFile) {\n if (llvm::raw_ostream *OS = CI.createDefaultOutputFile(false, InFile))\n return CreateHTMLPrinter(OS, CI.getPreprocessor());\n return 0;\n}\n\nASTConsumer *InheritanceViewAction::CreateASTConsumer(CompilerInstance &CI,\n llvm::StringRef InFile) {\n return CreateInheritanceViewer(CI.getFrontendOpts().ViewClassInheritance);\n}\n\nFixItAction::FixItAction() {}\nFixItAction::~FixItAction() {}\n\nASTConsumer *FixItAction::CreateASTConsumer(CompilerInstance &CI,\n llvm::StringRef InFile) {\n return new ASTConsumer();\n}\n\n\/\/\/ AddFixItLocations - Add any individual user specified \"fix-it\" locations,\n\/\/\/ and return true on success.\nstatic bool AddFixItLocations(CompilerInstance &CI,\n FixItRewriter &FixItRewrite) {\n const std::vector<ParsedSourceLocation> &Locs =\n CI.getFrontendOpts().FixItLocations;\n for (unsigned i = 0, e = Locs.size(); i != e; ++i) {\n const FileEntry *File = CI.getFileManager().getFile(Locs[i].FileName);\n if (!File) {\n CI.getDiagnostics().Report(diag::err_fe_unable_to_find_fixit_file)\n << Locs[i].FileName;\n return false;\n }\n\n RequestedSourceLocation Requested;\n Requested.File = File;\n Requested.Line = Locs[i].Line;\n Requested.Column = Locs[i].Column;\n FixItRewrite.addFixItLocation(Requested);\n }\n\n return true;\n}\n\nbool FixItAction::BeginSourceFileAction(CompilerInstance &CI,\n llvm::StringRef Filename) {\n Rewriter.reset(new FixItRewriter(CI.getDiagnostics(), CI.getSourceManager(),\n CI.getLangOpts()));\n if (!AddFixItLocations(CI, *Rewriter))\n return false;\n\n return true;\n}\n\nvoid FixItAction::EndSourceFileAction() {\n const FrontendOptions &FEOpts = getCompilerInstance().getFrontendOpts();\n Rewriter->WriteFixedFile(getCurrentFile(), FEOpts.OutputFile);\n}\n\nASTConsumer *RewriteObjCAction::CreateASTConsumer(CompilerInstance &CI,\n llvm::StringRef InFile) {\n if (llvm::raw_ostream *OS = CI.createDefaultOutputFile(false, InFile, \"cpp\"))\n return CreateObjCRewriter(InFile, OS,\n CI.getDiagnostics(), CI.getLangOpts(),\n CI.getDiagnosticOpts().NoRewriteMacros);\n return 0;\n}\n\nASTConsumer *SyntaxOnlyAction::CreateASTConsumer(CompilerInstance &CI,\n llvm::StringRef InFile) {\n return new ASTConsumer();\n}\n\nCodeGenAction::CodeGenAction(unsigned _Act) : Act(_Act) {}\n\nASTConsumer *CodeGenAction::CreateASTConsumer(CompilerInstance &CI,\n llvm::StringRef InFile) {\n BackendAction BA = static_cast<BackendAction>(Act);\n llvm::OwningPtr<llvm::raw_ostream> OS;\n switch (BA) {\n case Backend_EmitAssembly:\n OS.reset(CI.createDefaultOutputFile(false, InFile, \"s\"));\n break;\n case Backend_EmitLL:\n OS.reset(CI.createDefaultOutputFile(false, InFile, \"ll\"));\n break;\n case Backend_EmitBC:\n OS.reset(CI.createDefaultOutputFile(true, InFile, \"bc\"));\n break;\n case Backend_EmitNothing:\n break;\n }\n if (BA != Backend_EmitNothing && !OS)\n return 0;\n\n return CreateBackendConsumer(BA, CI.getDiagnostics(), CI.getLangOpts(),\n CI.getCodeGenOpts(), CI.getTargetOpts(),\n CI.getFrontendOpts().ShowTimers, InFile,\n OS.take(), CI.getLLVMContext());\n}\n\nEmitAssemblyAction::EmitAssemblyAction()\n : CodeGenAction(Backend_EmitAssembly) {}\n\nEmitBCAction::EmitBCAction() : CodeGenAction(Backend_EmitBC) {}\n\nEmitLLVMAction::EmitLLVMAction() : CodeGenAction(Backend_EmitLL) {}\n\nEmitLLVMOnlyAction::EmitLLVMOnlyAction() : CodeGenAction(Backend_EmitNothing) {}\n\n\/\/===----------------------------------------------------------------------===\/\/\n\/\/ Preprocessor Actions\n\/\/===----------------------------------------------------------------------===\/\/\n\nvoid DumpRawTokensAction::ExecuteAction() {\n Preprocessor &PP = getCompilerInstance().getPreprocessor();\n SourceManager &SM = PP.getSourceManager();\n\n \/\/ Start lexing the specified input file.\n const llvm::MemoryBuffer *FromFile = SM.getBuffer(SM.getMainFileID());\n Lexer RawLex(SM.getMainFileID(), FromFile, SM, PP.getLangOptions());\n RawLex.SetKeepWhitespaceMode(true);\n\n Token RawTok;\n RawLex.LexFromRawLexer(RawTok);\n while (RawTok.isNot(tok::eof)) {\n PP.DumpToken(RawTok, true);\n llvm::errs() << \"\\n\";\n RawLex.LexFromRawLexer(RawTok);\n }\n}\n\nvoid DumpTokensAction::ExecuteAction() {\n Preprocessor &PP = getCompilerInstance().getPreprocessor();\n \/\/ Start preprocessing the specified input file.\n Token Tok;\n PP.EnterMainSourceFile();\n do {\n PP.Lex(Tok);\n PP.DumpToken(Tok, true);\n llvm::errs() << \"\\n\";\n } while (Tok.isNot(tok::eof));\n}\n\nvoid GeneratePTHAction::ExecuteAction() {\n CompilerInstance &CI = getCompilerInstance();\n if (CI.getFrontendOpts().OutputFile.empty() ||\n CI.getFrontendOpts().OutputFile == \"-\") {\n \/\/ FIXME: Don't fail this way.\n \/\/ FIXME: Verify that we can actually seek in the given file.\n llvm::llvm_report_error(\"PTH requires a seekable file for output!\");\n }\n llvm::raw_fd_ostream *OS =\n CI.createDefaultOutputFile(true, getCurrentFile());\n if (!OS) return;\n\n CacheTokens(CI.getPreprocessor(), OS);\n}\n\nvoid ParseOnlyAction::ExecuteAction() {\n Preprocessor &PP = getCompilerInstance().getPreprocessor();\n llvm::OwningPtr<Action> PA(new MinimalAction(PP));\n\n Parser P(PP, *PA);\n PP.EnterMainSourceFile();\n P.ParseTranslationUnit();\n}\n\nvoid PreprocessOnlyAction::ExecuteAction() {\n Preprocessor &PP = getCompilerInstance().getPreprocessor();\n\n Token Tok;\n \/\/ Start parsing the specified input file.\n PP.EnterMainSourceFile();\n do {\n PP.Lex(Tok);\n } while (Tok.isNot(tok::eof));\n}\n\nvoid PrintParseAction::ExecuteAction() {\n CompilerInstance &CI = getCompilerInstance();\n Preprocessor &PP = getCompilerInstance().getPreprocessor();\n llvm::raw_ostream *OS = CI.createDefaultOutputFile(false, getCurrentFile());\n if (!OS) return;\n\n llvm::OwningPtr<Action> PA(CreatePrintParserActionsAction(PP, OS));\n\n Parser P(PP, *PA);\n PP.EnterMainSourceFile();\n P.ParseTranslationUnit();\n}\n\nvoid PrintPreprocessedAction::ExecuteAction() {\n CompilerInstance &CI = getCompilerInstance();\n llvm::raw_ostream *OS = CI.createDefaultOutputFile(false, getCurrentFile());\n if (!OS) return;\n\n DoPrintPreprocessedInput(CI.getPreprocessor(), OS,\n CI.getPreprocessorOutputOpts());\n}\n\nvoid RewriteMacrosAction::ExecuteAction() {\n CompilerInstance &CI = getCompilerInstance();\n llvm::raw_ostream *OS = CI.createDefaultOutputFile(true, getCurrentFile());\n if (!OS) return;\n\n RewriteMacrosInInput(CI.getPreprocessor(), OS);\n}\n\nvoid RewriteTestAction::ExecuteAction() {\n CompilerInstance &CI = getCompilerInstance();\n llvm::raw_ostream *OS = CI.createDefaultOutputFile(false, getCurrentFile());\n if (!OS) return;\n\n DoRewriteTest(CI.getPreprocessor(), OS);\n}\n<commit_msg>Fix <rdar:\/\/problem\/7490212> clang rewriter: return of the mixed line endings, which is related to <rdar:\/\/problem\/6596843> clang ObjC rewriter: Line endings still mixed in rewrite output<commit_after>\/\/===--- FrontendActions.cpp ----------------------------------------------===\/\/\n\/\/\n\/\/ The LLVM Compiler Infrastructure\n\/\/\n\/\/ This file is distributed under the University of Illinois Open Source\n\/\/ License. See LICENSE.TXT for details.\n\/\/\n\/\/===----------------------------------------------------------------------===\/\/\n\n#include \"clang\/Frontend\/FrontendActions.h\"\n#include \"clang\/AST\/ASTConsumer.h\"\n#include \"clang\/Lex\/Preprocessor.h\"\n#include \"clang\/Parse\/Parser.h\"\n#include \"clang\/Basic\/FileManager.h\"\n#include \"clang\/Frontend\/AnalysisConsumer.h\"\n#include \"clang\/Frontend\/ASTConsumers.h\"\n#include \"clang\/Frontend\/ASTUnit.h\"\n#include \"clang\/Frontend\/CompilerInstance.h\"\n#include \"clang\/Frontend\/FixItRewriter.h\"\n#include \"clang\/Frontend\/FrontendDiagnostic.h\"\n#include \"clang\/Frontend\/Utils.h\"\n#include \"llvm\/Support\/raw_ostream.h\"\nusing namespace clang;\n\n\/\/===----------------------------------------------------------------------===\/\/\n\/\/ AST Consumer Actions\n\/\/===----------------------------------------------------------------------===\/\/\n\nASTConsumer *AnalysisAction::CreateASTConsumer(CompilerInstance &CI,\n llvm::StringRef InFile) {\n return CreateAnalysisConsumer(CI.getPreprocessor(),\n CI.getFrontendOpts().OutputFile,\n CI.getAnalyzerOpts());\n}\n\nASTConsumer *ASTPrintAction::CreateASTConsumer(CompilerInstance &CI,\n llvm::StringRef InFile) {\n if (llvm::raw_ostream *OS = CI.createDefaultOutputFile(false, InFile))\n return CreateASTPrinter(OS);\n return 0;\n}\n\nASTConsumer *ASTPrintXMLAction::CreateASTConsumer(CompilerInstance &CI,\n llvm::StringRef InFile) {\n if (llvm::raw_ostream *OS = CI.createDefaultOutputFile(false, InFile, \"xml\"))\n return CreateASTPrinterXML(OS);\n return 0;\n}\n\nASTConsumer *ASTDumpAction::CreateASTConsumer(CompilerInstance &CI,\n llvm::StringRef InFile) {\n return CreateASTDumper();\n}\n\nASTConsumer *ASTViewAction::CreateASTConsumer(CompilerInstance &CI,\n llvm::StringRef InFile) {\n return CreateASTViewer();\n}\n\nASTConsumer *DeclContextPrintAction::CreateASTConsumer(CompilerInstance &CI,\n llvm::StringRef InFile) {\n return CreateDeclContextPrinter();\n}\n\nASTConsumer *DumpRecordAction::CreateASTConsumer(CompilerInstance &CI,\n llvm::StringRef InFile) {\n return CreateRecordLayoutDumper();\n}\n\nASTConsumer *GeneratePCHAction::CreateASTConsumer(CompilerInstance &CI,\n llvm::StringRef InFile) {\n const std::string &Sysroot = CI.getHeaderSearchOpts().Sysroot;\n if (CI.getFrontendOpts().RelocatablePCH &&\n Sysroot.empty()) {\n CI.getDiagnostics().Report(diag::err_relocatable_without_without_isysroot);\n return 0;\n }\n\n llvm::raw_ostream *OS = CI.createDefaultOutputFile(true, InFile);\n if (!OS)\n return 0;\n\n if (CI.getFrontendOpts().RelocatablePCH)\n return CreatePCHGenerator(CI.getPreprocessor(), OS, Sysroot.c_str());\n\n return CreatePCHGenerator(CI.getPreprocessor(), OS);\n}\n\nASTConsumer *HTMLPrintAction::CreateASTConsumer(CompilerInstance &CI,\n llvm::StringRef InFile) {\n if (llvm::raw_ostream *OS = CI.createDefaultOutputFile(false, InFile))\n return CreateHTMLPrinter(OS, CI.getPreprocessor());\n return 0;\n}\n\nASTConsumer *InheritanceViewAction::CreateASTConsumer(CompilerInstance &CI,\n llvm::StringRef InFile) {\n return CreateInheritanceViewer(CI.getFrontendOpts().ViewClassInheritance);\n}\n\nFixItAction::FixItAction() {}\nFixItAction::~FixItAction() {}\n\nASTConsumer *FixItAction::CreateASTConsumer(CompilerInstance &CI,\n llvm::StringRef InFile) {\n return new ASTConsumer();\n}\n\n\/\/\/ AddFixItLocations - Add any individual user specified \"fix-it\" locations,\n\/\/\/ and return true on success.\nstatic bool AddFixItLocations(CompilerInstance &CI,\n FixItRewriter &FixItRewrite) {\n const std::vector<ParsedSourceLocation> &Locs =\n CI.getFrontendOpts().FixItLocations;\n for (unsigned i = 0, e = Locs.size(); i != e; ++i) {\n const FileEntry *File = CI.getFileManager().getFile(Locs[i].FileName);\n if (!File) {\n CI.getDiagnostics().Report(diag::err_fe_unable_to_find_fixit_file)\n << Locs[i].FileName;\n return false;\n }\n\n RequestedSourceLocation Requested;\n Requested.File = File;\n Requested.Line = Locs[i].Line;\n Requested.Column = Locs[i].Column;\n FixItRewrite.addFixItLocation(Requested);\n }\n\n return true;\n}\n\nbool FixItAction::BeginSourceFileAction(CompilerInstance &CI,\n llvm::StringRef Filename) {\n Rewriter.reset(new FixItRewriter(CI.getDiagnostics(), CI.getSourceManager(),\n CI.getLangOpts()));\n if (!AddFixItLocations(CI, *Rewriter))\n return false;\n\n return true;\n}\n\nvoid FixItAction::EndSourceFileAction() {\n const FrontendOptions &FEOpts = getCompilerInstance().getFrontendOpts();\n Rewriter->WriteFixedFile(getCurrentFile(), FEOpts.OutputFile);\n}\n\nASTConsumer *RewriteObjCAction::CreateASTConsumer(CompilerInstance &CI,\n llvm::StringRef InFile) {\n if (llvm::raw_ostream *OS = CI.createDefaultOutputFile(false, InFile, \"cpp\"))\n return CreateObjCRewriter(InFile, OS,\n CI.getDiagnostics(), CI.getLangOpts(),\n CI.getDiagnosticOpts().NoRewriteMacros);\n return 0;\n}\n\nASTConsumer *SyntaxOnlyAction::CreateASTConsumer(CompilerInstance &CI,\n llvm::StringRef InFile) {\n return new ASTConsumer();\n}\n\nCodeGenAction::CodeGenAction(unsigned _Act) : Act(_Act) {}\n\nASTConsumer *CodeGenAction::CreateASTConsumer(CompilerInstance &CI,\n llvm::StringRef InFile) {\n BackendAction BA = static_cast<BackendAction>(Act);\n llvm::OwningPtr<llvm::raw_ostream> OS;\n switch (BA) {\n case Backend_EmitAssembly:\n OS.reset(CI.createDefaultOutputFile(false, InFile, \"s\"));\n break;\n case Backend_EmitLL:\n OS.reset(CI.createDefaultOutputFile(false, InFile, \"ll\"));\n break;\n case Backend_EmitBC:\n OS.reset(CI.createDefaultOutputFile(true, InFile, \"bc\"));\n break;\n case Backend_EmitNothing:\n break;\n }\n if (BA != Backend_EmitNothing && !OS)\n return 0;\n\n return CreateBackendConsumer(BA, CI.getDiagnostics(), CI.getLangOpts(),\n CI.getCodeGenOpts(), CI.getTargetOpts(),\n CI.getFrontendOpts().ShowTimers, InFile,\n OS.take(), CI.getLLVMContext());\n}\n\nEmitAssemblyAction::EmitAssemblyAction()\n : CodeGenAction(Backend_EmitAssembly) {}\n\nEmitBCAction::EmitBCAction() : CodeGenAction(Backend_EmitBC) {}\n\nEmitLLVMAction::EmitLLVMAction() : CodeGenAction(Backend_EmitLL) {}\n\nEmitLLVMOnlyAction::EmitLLVMOnlyAction() : CodeGenAction(Backend_EmitNothing) {}\n\n\/\/===----------------------------------------------------------------------===\/\/\n\/\/ Preprocessor Actions\n\/\/===----------------------------------------------------------------------===\/\/\n\nvoid DumpRawTokensAction::ExecuteAction() {\n Preprocessor &PP = getCompilerInstance().getPreprocessor();\n SourceManager &SM = PP.getSourceManager();\n\n \/\/ Start lexing the specified input file.\n const llvm::MemoryBuffer *FromFile = SM.getBuffer(SM.getMainFileID());\n Lexer RawLex(SM.getMainFileID(), FromFile, SM, PP.getLangOptions());\n RawLex.SetKeepWhitespaceMode(true);\n\n Token RawTok;\n RawLex.LexFromRawLexer(RawTok);\n while (RawTok.isNot(tok::eof)) {\n PP.DumpToken(RawTok, true);\n llvm::errs() << \"\\n\";\n RawLex.LexFromRawLexer(RawTok);\n }\n}\n\nvoid DumpTokensAction::ExecuteAction() {\n Preprocessor &PP = getCompilerInstance().getPreprocessor();\n \/\/ Start preprocessing the specified input file.\n Token Tok;\n PP.EnterMainSourceFile();\n do {\n PP.Lex(Tok);\n PP.DumpToken(Tok, true);\n llvm::errs() << \"\\n\";\n } while (Tok.isNot(tok::eof));\n}\n\nvoid GeneratePTHAction::ExecuteAction() {\n CompilerInstance &CI = getCompilerInstance();\n if (CI.getFrontendOpts().OutputFile.empty() ||\n CI.getFrontendOpts().OutputFile == \"-\") {\n \/\/ FIXME: Don't fail this way.\n \/\/ FIXME: Verify that we can actually seek in the given file.\n llvm::llvm_report_error(\"PTH requires a seekable file for output!\");\n }\n llvm::raw_fd_ostream *OS =\n CI.createDefaultOutputFile(true, getCurrentFile());\n if (!OS) return;\n\n CacheTokens(CI.getPreprocessor(), OS);\n}\n\nvoid ParseOnlyAction::ExecuteAction() {\n Preprocessor &PP = getCompilerInstance().getPreprocessor();\n llvm::OwningPtr<Action> PA(new MinimalAction(PP));\n\n Parser P(PP, *PA);\n PP.EnterMainSourceFile();\n P.ParseTranslationUnit();\n}\n\nvoid PreprocessOnlyAction::ExecuteAction() {\n Preprocessor &PP = getCompilerInstance().getPreprocessor();\n\n Token Tok;\n \/\/ Start parsing the specified input file.\n PP.EnterMainSourceFile();\n do {\n PP.Lex(Tok);\n } while (Tok.isNot(tok::eof));\n}\n\nvoid PrintParseAction::ExecuteAction() {\n CompilerInstance &CI = getCompilerInstance();\n Preprocessor &PP = getCompilerInstance().getPreprocessor();\n llvm::raw_ostream *OS = CI.createDefaultOutputFile(false, getCurrentFile());\n if (!OS) return;\n\n llvm::OwningPtr<Action> PA(CreatePrintParserActionsAction(PP, OS));\n\n Parser P(PP, *PA);\n PP.EnterMainSourceFile();\n P.ParseTranslationUnit();\n}\n\nvoid PrintPreprocessedAction::ExecuteAction() {\n CompilerInstance &CI = getCompilerInstance();\n \/\/ Output file needs to be set to 'Binary', to avoid converting Unix style\n \/\/ line feeds (<LF>) to Microsoft style line feeds (<CR><LF>).\n llvm::raw_ostream *OS = CI.createDefaultOutputFile(true, getCurrentFile());\n if (!OS) return;\n\n DoPrintPreprocessedInput(CI.getPreprocessor(), OS,\n CI.getPreprocessorOutputOpts());\n}\n\nvoid RewriteMacrosAction::ExecuteAction() {\n CompilerInstance &CI = getCompilerInstance();\n llvm::raw_ostream *OS = CI.createDefaultOutputFile(true, getCurrentFile());\n if (!OS) return;\n\n RewriteMacrosInInput(CI.getPreprocessor(), OS);\n}\n\nvoid RewriteTestAction::ExecuteAction() {\n CompilerInstance &CI = getCompilerInstance();\n llvm::raw_ostream *OS = CI.createDefaultOutputFile(false, getCurrentFile());\n if (!OS) return;\n\n DoRewriteTest(CI.getPreprocessor(), OS);\n}\n<|endoftext|>"} {"text":"<commit_before>\/\/------------------------------------------------------------------------------\n\/\/ CLING - the C++ LLVM-based InterpreterG :)\n\/\/ version: $Id$\n\/\/ author: Vassil Vassilev <vasil.georgiev.vasilev@cern.ch>\n\/\/------------------------------------------------------------------------------\n\n#include \"cling\/Interpreter\/ValuePrinter.h\"\n\n#include \"cling\/Interpreter\/CValuePrinter.h\"\n#include \"cling\/Interpreter\/ValuePrinterInfo.h\"\n#include \"cling\/Interpreter\/StoredValueRef.h\"\n#include \"cling\/Interpreter\/Value.h\"\n\n#include \"clang\/AST\/ASTContext.h\"\n#include \"clang\/AST\/Decl.h\"\n#include \"clang\/AST\/DeclCXX.h\"\n#include \"clang\/AST\/Expr.h\"\n#include \"clang\/AST\/Type.h\"\n\n#include \"llvm\/Support\/raw_ostream.h\"\n\n#include <string>\n\n\/\/ Implements the CValuePrinter interface.\nextern \"C\" void cling_PrintValue(void* \/*clang::Expr**\/ E,\n void* \/*clang::ASTContext**\/ C,\n const void* value) {\n clang::Expr* Exp = (clang::Expr*)E;\n clang::ASTContext* Context = (clang::ASTContext*)C;\n cling::ValuePrinterInfo VPI(Exp, Context);\n cling::printValuePublic(llvm::outs(), value, value, VPI);\n\n cling::flushOStream(llvm::outs());\n}\n\n\nstatic void StreamChar(llvm::raw_ostream& o, const char v,\n const char* Sep = \"\\n\") {\n o << '\"' << v << \"\\\"\" << Sep;\n}\n\nstatic void StreamCharPtr(llvm::raw_ostream& o, const char* const v,\n const char* Sep = \"\\n\") {\n o << '\"';\n const char* p = v;\n for (;*p && p - v < 128; ++p) {\n o << *p;\n }\n if (*p) o << \"\\\"...\" << Sep;\n else o << \"\\\"\" << Sep;\n}\n\nstatic void StreamRef(llvm::raw_ostream& o, const void* v,\n const char* Sep = \"\\n\") {\n o <<\"&\" << v << Sep;\n}\n\nstatic void StreamPtr(llvm::raw_ostream& o, const void* v,\n const char* Sep = \"\\n\") {\n o << v << Sep;\n}\n\nstatic void StreamValue(llvm::raw_ostream& o, const void* const p,\n const cling::ValuePrinterInfo& VPI,\n clang::QualType Ty,\n const char* Sep = \"\\n\");\n\nstatic void StreamArr(llvm::raw_ostream& o, const void* p,\n const cling::ValuePrinterInfo& VPI,\n clang::QualType Ty,\n const char* Sep = \"\\n\") {\n const clang::ASTContext& C = *VPI.getASTContext();\n const clang::ArrayType* ArrTy = Ty->getAsArrayTypeUnsafe();\n clang::QualType ElementTy = ArrTy->getElementType();\n if (ElementTy->isCharType())\n StreamCharPtr(o, (const char*)p);\n else if (Ty->isConstantArrayType()) {\n \/\/ Stream a constant array by streaming up to 5 elements.\n const clang::ConstantArrayType* CArrTy\n = C.getAsConstantArrayType(Ty);\n const llvm::APInt& APSize = CArrTy->getSize();\n size_t ElBytes = C.getTypeSize(ElementTy) \/ C.getCharWidth();\n size_t Size = (size_t)APSize.getZExtValue();\n o << \"{ \";\n for (size_t i = 0; i < Size; ++i) {\n StreamValue(o, ((char*)p) + i * ElBytes, VPI, ElementTy, \" \");\n if (i + 1 < Size) {\n if (i == 4) {\n o << \"...\";\n break;\n }\n else o << \", \";\n }\n }\n o << \" }\" << Sep;\n } else\n StreamPtr(o, p, Sep);\n}\n\nstatic void StreamObj(llvm::raw_ostream& o, const void* v,\n const cling::ValuePrinterInfo& VPI,\n clang::QualType QTy,\n const char* Sep = \"\\n\") {\n const clang::Type* Ty = QTy.getTypePtr();\n if (clang::CXXRecordDecl* CXXRD = Ty->getAsCXXRecordDecl()) {\n const cling::Value* value = 0;\n if (CXXRD->getQualifiedNameAsString().compare(\"cling::StoredValueRef\") == 0){\n const cling::StoredValueRef* VR = (const cling::StoredValueRef*)v;\n if (VR->isValid()) {\n value = &VR->get();\n } else {\n o << \"<<<invalid>>> \";\n }\n } else if (CXXRD->getQualifiedNameAsString().compare(\"cling::Value\") == 0) {\n value = (const cling::Value*)v;\n }\n if (value) {\n if (value->isValid()) {\n o << \"boxes [\";\n const clang::ASTContext& C = *VPI.getASTContext();\n o <<\n \"(\" <<\n value->type.getAsString(C.getPrintingPolicy()) <<\n \") \";\n clang::QualType valType = value->type.getDesugaredType(C);\n if (valType->isFloatingType())\n o << value->value.DoubleVal;\n else if (valType->isIntegerType())\n o << value->value.IntVal.getSExtValue();\n else if (valType->isBooleanType())\n o << value->value.IntVal.getBoolValue();\n else\n StreamValue(o, value->value.PointerVal, VPI, valType, \"\");\n o << \"]\" << Sep;\n\n return;\n } else\n o << \"<<<invalid>>> \";\n }\n } \/\/ if CXXRecordDecl\n\n \/\/ TODO: Print the object members.\n o << \"@\" << v << Sep;\n}\n\nstatic void StreamValue(llvm::raw_ostream& o, const void* const p,\n const cling::ValuePrinterInfo& VPI,\n clang::QualType Ty,\n const char* Sep \/*= \"\\n\"*\/) {\n const clang::ASTContext& C = *VPI.getASTContext();\n Ty = Ty.getDesugaredType(C);\n if (const clang::BuiltinType *BT\n = llvm::dyn_cast<clang::BuiltinType>(Ty.getCanonicalType())) {\n switch (BT->getKind()) {\n case clang::BuiltinType::Bool:\n if (*(const bool*)p) o << \"true\" << Sep;\n else o << \"false\" << Sep; break;\n case clang::BuiltinType::Char_U:\n case clang::BuiltinType::UChar:\n case clang::BuiltinType::Char_S:\n case clang::BuiltinType::SChar: StreamChar(o, *(const char*)p); break;\n case clang::BuiltinType::Short: o << *(const short*)p << Sep; break;\n case clang::BuiltinType::UShort:\n o << *(const unsigned short*)p << Sep;\n break;\n case clang::BuiltinType::Int: o << *(const int*)p << Sep; break;\n case clang::BuiltinType::UInt:\n o << *(const unsigned int*)p << Sep;\n break;\n case clang::BuiltinType::Long: o << *(const long*)p << Sep; break;\n case clang::BuiltinType::ULong:\n o << *(const unsigned long*)p << Sep;\n break;\n case clang::BuiltinType::LongLong:\n o << *(const long long*)p << Sep;\n break;\n case clang::BuiltinType::ULongLong:\n o << *(const unsigned long long*)p << Sep;\n break;\n case clang::BuiltinType::Float: o << *(const float*)p << Sep; break;\n case clang::BuiltinType::Double: o << *(const double*)p << Sep; break;\n default:\n StreamObj(o, p, VPI, Ty, Sep);\n }\n }\n else if (Ty.getAsString().compare(\"class std::basic_string<char>\") == 0) {\n StreamObj(o, p, VPI, Ty, Sep);\n o <<\"c_str: \";\n StreamCharPtr(o, ((const char*) (*(const std::string*)p).c_str()), Sep);\n }\n else if (Ty->isEnumeralType()) {\n StreamObj(o, p, VPI, Ty, Sep);\n clang::EnumDecl* ED = Ty->getAs<clang::EnumType>()->getDecl();\n uint64_t value = *(const uint64_t*)p;\n bool IsFirst = true;\n llvm::APSInt ValAsAPSInt = C.MakeIntValue(value, Ty);\n for (clang::EnumDecl::enumerator_iterator I = ED->enumerator_begin(),\n E = ED->enumerator_end(); I != E; ++I) {\n if (I->getInitVal() == ValAsAPSInt) {\n if (!IsFirst) {\n o << \" ? \";\n }\n o << \"(\" << I->getQualifiedNameAsString() << \")\";\n IsFirst = false;\n }\n }\n o << \" : (int) \" << ValAsAPSInt.toString(\/*Radix = *\/10) << Sep;\n }\n else if (Ty->isReferenceType())\n StreamRef(o, p, Sep);\n else if (Ty->isPointerType()) {\n clang::QualType PointeeTy = Ty->getPointeeType();\n if (PointeeTy->isCharType())\n StreamCharPtr(o, (const char*)p, Sep);\n else\n StreamPtr(o, p, Sep);\n }\n else if (Ty->isArrayType())\n StreamArr(o, p, VPI, Ty, Sep);\n else\n StreamObj(o, p, VPI, Ty, Sep);\n}\n\nnamespace cling {\n void printValuePublicDefault(llvm::raw_ostream& o, const void* const p,\n const ValuePrinterInfo& VPI) {\n const clang::Expr* E = VPI.getExpr();\n o << \"(\";\n o << E->getType().getAsString();\n o << \") \";\n StreamValue(o, p, VPI, VPI.getExpr()->getType());\n }\n\n void flushOStream(llvm::raw_ostream& o) {\n o.flush();\n }\n\n} \/\/ end namespace cling\n<commit_msg>Const correctness.<commit_after>\/\/------------------------------------------------------------------------------\n\/\/ CLING - the C++ LLVM-based InterpreterG :)\n\/\/ version: $Id$\n\/\/ author: Vassil Vassilev <vasil.georgiev.vasilev@cern.ch>\n\/\/------------------------------------------------------------------------------\n\n#include \"cling\/Interpreter\/ValuePrinter.h\"\n\n#include \"cling\/Interpreter\/CValuePrinter.h\"\n#include \"cling\/Interpreter\/ValuePrinterInfo.h\"\n#include \"cling\/Interpreter\/StoredValueRef.h\"\n#include \"cling\/Interpreter\/Value.h\"\n\n#include \"clang\/AST\/ASTContext.h\"\n#include \"clang\/AST\/Decl.h\"\n#include \"clang\/AST\/DeclCXX.h\"\n#include \"clang\/AST\/Expr.h\"\n#include \"clang\/AST\/Type.h\"\n\n#include \"llvm\/Support\/raw_ostream.h\"\n\n#include <string>\n\n\/\/ Implements the CValuePrinter interface.\nextern \"C\" void cling_PrintValue(void* \/*clang::Expr**\/ E,\n void* \/*clang::ASTContext**\/ C,\n const void* value) {\n clang::Expr* Exp = (clang::Expr*)E;\n clang::ASTContext* Context = (clang::ASTContext*)C;\n cling::ValuePrinterInfo VPI(Exp, Context);\n cling::printValuePublic(llvm::outs(), value, value, VPI);\n\n cling::flushOStream(llvm::outs());\n}\n\n\nstatic void StreamChar(llvm::raw_ostream& o, const char v,\n const char* Sep = \"\\n\") {\n o << '\"' << v << \"\\\"\" << Sep;\n}\n\nstatic void StreamCharPtr(llvm::raw_ostream& o, const char* const v,\n const char* Sep = \"\\n\") {\n o << '\"';\n const char* p = v;\n for (;*p && p - v < 128; ++p) {\n o << *p;\n }\n if (*p) o << \"\\\"...\" << Sep;\n else o << \"\\\"\" << Sep;\n}\n\nstatic void StreamRef(llvm::raw_ostream& o, const void* v,\n const char* Sep = \"\\n\") {\n o <<\"&\" << v << Sep;\n}\n\nstatic void StreamPtr(llvm::raw_ostream& o, const void* v,\n const char* Sep = \"\\n\") {\n o << v << Sep;\n}\n\nstatic void StreamValue(llvm::raw_ostream& o, const void* const p,\n const cling::ValuePrinterInfo& VPI,\n clang::QualType Ty,\n const char* Sep = \"\\n\");\n\nstatic void StreamArr(llvm::raw_ostream& o, const void* p,\n const cling::ValuePrinterInfo& VPI,\n clang::QualType Ty,\n const char* Sep = \"\\n\") {\n const clang::ASTContext& C = *VPI.getASTContext();\n const clang::ArrayType* ArrTy = Ty->getAsArrayTypeUnsafe();\n clang::QualType ElementTy = ArrTy->getElementType();\n if (ElementTy->isCharType())\n StreamCharPtr(o, (const char*)p);\n else if (Ty->isConstantArrayType()) {\n \/\/ Stream a constant array by streaming up to 5 elements.\n const clang::ConstantArrayType* CArrTy\n = C.getAsConstantArrayType(Ty);\n const llvm::APInt& APSize = CArrTy->getSize();\n size_t ElBytes = C.getTypeSize(ElementTy) \/ C.getCharWidth();\n size_t Size = (size_t)APSize.getZExtValue();\n o << \"{ \";\n for (size_t i = 0; i < Size; ++i) {\n StreamValue(o, ((const char*)p) + i * ElBytes, VPI, ElementTy, \" \");\n if (i + 1 < Size) {\n if (i == 4) {\n o << \"...\";\n break;\n }\n else o << \", \";\n }\n }\n o << \" }\" << Sep;\n } else\n StreamPtr(o, p, Sep);\n}\n\nstatic void StreamObj(llvm::raw_ostream& o, const void* v,\n const cling::ValuePrinterInfo& VPI,\n clang::QualType QTy,\n const char* Sep = \"\\n\") {\n const clang::Type* Ty = QTy.getTypePtr();\n if (clang::CXXRecordDecl* CXXRD = Ty->getAsCXXRecordDecl()) {\n const cling::Value* value = 0;\n if (CXXRD->getQualifiedNameAsString().compare(\"cling::StoredValueRef\") == 0){\n const cling::StoredValueRef* VR = (const cling::StoredValueRef*)v;\n if (VR->isValid()) {\n value = &VR->get();\n } else {\n o << \"<<<invalid>>> \";\n }\n } else if (CXXRD->getQualifiedNameAsString().compare(\"cling::Value\") == 0) {\n value = (const cling::Value*)v;\n }\n if (value) {\n if (value->isValid()) {\n o << \"boxes [\";\n const clang::ASTContext& C = *VPI.getASTContext();\n o <<\n \"(\" <<\n value->type.getAsString(C.getPrintingPolicy()) <<\n \") \";\n clang::QualType valType = value->type.getDesugaredType(C);\n if (valType->isFloatingType())\n o << value->value.DoubleVal;\n else if (valType->isIntegerType())\n o << value->value.IntVal.getSExtValue();\n else if (valType->isBooleanType())\n o << value->value.IntVal.getBoolValue();\n else\n StreamValue(o, value->value.PointerVal, VPI, valType, \"\");\n o << \"]\" << Sep;\n\n return;\n } else\n o << \"<<<invalid>>> \";\n }\n } \/\/ if CXXRecordDecl\n\n \/\/ TODO: Print the object members.\n o << \"@\" << v << Sep;\n}\n\nstatic void StreamValue(llvm::raw_ostream& o, const void* const p,\n const cling::ValuePrinterInfo& VPI,\n clang::QualType Ty,\n const char* Sep \/*= \"\\n\"*\/) {\n const clang::ASTContext& C = *VPI.getASTContext();\n Ty = Ty.getDesugaredType(C);\n if (const clang::BuiltinType *BT\n = llvm::dyn_cast<clang::BuiltinType>(Ty.getCanonicalType())) {\n switch (BT->getKind()) {\n case clang::BuiltinType::Bool:\n if (*(const bool*)p) o << \"true\" << Sep;\n else o << \"false\" << Sep; break;\n case clang::BuiltinType::Char_U:\n case clang::BuiltinType::UChar:\n case clang::BuiltinType::Char_S:\n case clang::BuiltinType::SChar: StreamChar(o, *(const char*)p); break;\n case clang::BuiltinType::Short: o << *(const short*)p << Sep; break;\n case clang::BuiltinType::UShort:\n o << *(const unsigned short*)p << Sep;\n break;\n case clang::BuiltinType::Int: o << *(const int*)p << Sep; break;\n case clang::BuiltinType::UInt:\n o << *(const unsigned int*)p << Sep;\n break;\n case clang::BuiltinType::Long: o << *(const long*)p << Sep; break;\n case clang::BuiltinType::ULong:\n o << *(const unsigned long*)p << Sep;\n break;\n case clang::BuiltinType::LongLong:\n o << *(const long long*)p << Sep;\n break;\n case clang::BuiltinType::ULongLong:\n o << *(const unsigned long long*)p << Sep;\n break;\n case clang::BuiltinType::Float: o << *(const float*)p << Sep; break;\n case clang::BuiltinType::Double: o << *(const double*)p << Sep; break;\n default:\n StreamObj(o, p, VPI, Ty, Sep);\n }\n }\n else if (Ty.getAsString().compare(\"class std::basic_string<char>\") == 0) {\n StreamObj(o, p, VPI, Ty, Sep);\n o <<\"c_str: \";\n StreamCharPtr(o, ((const char*) (*(const std::string*)p).c_str()), Sep);\n }\n else if (Ty->isEnumeralType()) {\n StreamObj(o, p, VPI, Ty, Sep);\n clang::EnumDecl* ED = Ty->getAs<clang::EnumType>()->getDecl();\n uint64_t value = *(const uint64_t*)p;\n bool IsFirst = true;\n llvm::APSInt ValAsAPSInt = C.MakeIntValue(value, Ty);\n for (clang::EnumDecl::enumerator_iterator I = ED->enumerator_begin(),\n E = ED->enumerator_end(); I != E; ++I) {\n if (I->getInitVal() == ValAsAPSInt) {\n if (!IsFirst) {\n o << \" ? \";\n }\n o << \"(\" << I->getQualifiedNameAsString() << \")\";\n IsFirst = false;\n }\n }\n o << \" : (int) \" << ValAsAPSInt.toString(\/*Radix = *\/10) << Sep;\n }\n else if (Ty->isReferenceType())\n StreamRef(o, p, Sep);\n else if (Ty->isPointerType()) {\n clang::QualType PointeeTy = Ty->getPointeeType();\n if (PointeeTy->isCharType())\n StreamCharPtr(o, (const char*)p, Sep);\n else\n StreamPtr(o, p, Sep);\n }\n else if (Ty->isArrayType())\n StreamArr(o, p, VPI, Ty, Sep);\n else\n StreamObj(o, p, VPI, Ty, Sep);\n}\n\nnamespace cling {\n void printValuePublicDefault(llvm::raw_ostream& o, const void* const p,\n const ValuePrinterInfo& VPI) {\n const clang::Expr* E = VPI.getExpr();\n o << \"(\";\n o << E->getType().getAsString();\n o << \") \";\n StreamValue(o, p, VPI, VPI.getExpr()->getType());\n }\n\n void flushOStream(llvm::raw_ostream& o) {\n o.flush();\n }\n\n} \/\/ end namespace cling\n<|endoftext|>"} {"text":"<commit_before>\n#include \"BasicBlock.h\"\n\n#include <llvm\/IR\/Function.h>\n#include <llvm\/IR\/Instructions.h>\n\n#include \"Type.h\"\n\nnamespace dev\n{\nnamespace eth\n{\nnamespace jit\n{\n\nconst char* BasicBlock::NamePrefix = \"Instr.\";\n\nBasicBlock::BasicBlock(ProgramCounter _beginInstIdx, ProgramCounter _endInstIdx, llvm::Function* _mainFunc) :\n\tm_beginInstIdx(_beginInstIdx),\n\tm_endInstIdx(_endInstIdx),\n\tm_llvmBB(llvm::BasicBlock::Create(_mainFunc->getContext(), {NamePrefix, std::to_string(_beginInstIdx)}, _mainFunc)),\n\tm_stack(m_llvmBB)\n{}\n\nBasicBlock::BasicBlock(std::string _name, llvm::Function* _mainFunc) :\n\tm_beginInstIdx(0),\n\tm_endInstIdx(0),\n\tm_llvmBB(llvm::BasicBlock::Create(_mainFunc->getContext(), _name, _mainFunc)),\n\tm_stack(m_llvmBB)\n{}\n\n\nvoid BasicBlock::Stack::push(llvm::Value* _value)\n{\n\tm_backend.push_back(_value);\n}\n\nllvm::Value* BasicBlock::Stack::pop()\n{\n\tauto top = get(0);\n\tm_backend.pop_back();\n\treturn top;\n}\n\nllvm::Value* BasicBlock::Stack::get(size_t _index)\n{\t\n\tif (_index >= m_backend.size())\n\t{\n\t\t\/\/ Create PHI node for missing values\n\t\tauto nMissingVals = _index - m_backend.size() + 1;\n\t\tm_backend.insert(m_backend.begin(), nMissingVals, nullptr);\n\t\tfor (decltype(nMissingVals) i = 0; i < nMissingVals; ++i)\n\t\t{\n\t\t\tm_backend[i] = m_llvmBB->empty() ?\n\t\t\t\tllvm::PHINode::Create(Type::i256, 0, {}, m_llvmBB) :\n\t\t\t\tllvm::PHINode::Create(Type::i256, 0, {}, m_llvmBB->getFirstNonPHI());\n\t\t}\n\t}\n\n\treturn *(m_backend.rbegin() + _index);\n}\n\nvoid BasicBlock::Stack::dup(size_t _index)\n{\n\tm_backend.push_back(get(_index));\n}\n\nvoid BasicBlock::Stack::swap(size_t _index)\n{\n\tassert(_index != 0);\n\tget(_index); \/\/ Create PHI nodes\n\tstd::swap(*m_backend.rbegin(), *(m_backend.rbegin() + _index));\n}\n\n}\n}\n}\n\n<commit_msg>Check if pushed item is a word<commit_after>\n#include \"BasicBlock.h\"\n\n#include <llvm\/IR\/Function.h>\n#include <llvm\/IR\/Instructions.h>\n\n#include \"Type.h\"\n\nnamespace dev\n{\nnamespace eth\n{\nnamespace jit\n{\n\nconst char* BasicBlock::NamePrefix = \"Instr.\";\n\nBasicBlock::BasicBlock(ProgramCounter _beginInstIdx, ProgramCounter _endInstIdx, llvm::Function* _mainFunc) :\n\tm_beginInstIdx(_beginInstIdx),\n\tm_endInstIdx(_endInstIdx),\n\tm_llvmBB(llvm::BasicBlock::Create(_mainFunc->getContext(), {NamePrefix, std::to_string(_beginInstIdx)}, _mainFunc)),\n\tm_stack(m_llvmBB)\n{}\n\nBasicBlock::BasicBlock(std::string _name, llvm::Function* _mainFunc) :\n\tm_beginInstIdx(0),\n\tm_endInstIdx(0),\n\tm_llvmBB(llvm::BasicBlock::Create(_mainFunc->getContext(), _name, _mainFunc)),\n\tm_stack(m_llvmBB)\n{}\n\n\nvoid BasicBlock::Stack::push(llvm::Value* _value)\n{\n\tassert(_value->getType() == Type::i256);\n\tm_backend.push_back(_value);\n}\n\nllvm::Value* BasicBlock::Stack::pop()\n{\n\tauto top = get(0);\n\tm_backend.pop_back();\n\treturn top;\n}\n\nllvm::Value* BasicBlock::Stack::get(size_t _index)\n{\t\n\tif (_index >= m_backend.size())\n\t{\n\t\t\/\/ Create PHI node for missing values\n\t\tauto nMissingVals = _index - m_backend.size() + 1;\n\t\tm_backend.insert(m_backend.begin(), nMissingVals, nullptr);\n\t\tfor (decltype(nMissingVals) i = 0; i < nMissingVals; ++i)\n\t\t{\n\t\t\tm_backend[i] = m_llvmBB->empty() ?\n\t\t\t\tllvm::PHINode::Create(Type::i256, 0, {}, m_llvmBB) :\n\t\t\t\tllvm::PHINode::Create(Type::i256, 0, {}, m_llvmBB->getFirstNonPHI());\n\t\t}\n\t}\n\n\treturn *(m_backend.rbegin() + _index);\n}\n\nvoid BasicBlock::Stack::dup(size_t _index)\n{\n\tm_backend.push_back(get(_index));\n}\n\nvoid BasicBlock::Stack::swap(size_t _index)\n{\n\tassert(_index != 0);\n\tget(_index); \/\/ Create PHI nodes\n\tstd::swap(*m_backend.rbegin(), *(m_backend.rbegin() + _index));\n}\n\n}\n}\n}\n\n<|endoftext|>"} {"text":"<commit_before>\n#include \"BasicBlock.h\"\n\n#include <iostream>\n\n#include <llvm\/IR\/CFG.h>\n#include <llvm\/IR\/Function.h>\n#include <llvm\/IR\/Instructions.h>\n#include <llvm\/IR\/IRBuilder.h>\n#include <llvm\/Support\/raw_os_ostream.h>\n\n#include \"Type.h\"\n\nnamespace dev\n{\nnamespace eth\n{\nnamespace jit\n{\n\nconst char* BasicBlock::NamePrefix = \"Instr.\";\n\nBasicBlock::BasicBlock(bytes::const_iterator _begin, bytes::const_iterator _end, llvm::Function* _mainFunc, llvm::IRBuilder<>& _builder, bool isJumpDest) :\n\tm_begin(_begin),\n\tm_end(_end),\n\t\/\/ TODO: Add begin index to name\n\tm_llvmBB(llvm::BasicBlock::Create(_mainFunc->getContext(), NamePrefix, _mainFunc)),\n\tm_stack(*this),\n\tm_builder(_builder),\n\tm_isJumpDest(isJumpDest)\n{}\n\nBasicBlock::BasicBlock(std::string _name, llvm::Function* _mainFunc, llvm::IRBuilder<>& _builder, bool isJumpDest) :\n\tm_llvmBB(llvm::BasicBlock::Create(_mainFunc->getContext(), _name, _mainFunc)),\n\tm_stack(*this),\n\tm_builder(_builder),\n\tm_isJumpDest(isJumpDest)\n{}\n\nBasicBlock::LocalStack::LocalStack(BasicBlock& _owner) :\n\tm_bblock(_owner)\n{}\n\nvoid BasicBlock::LocalStack::push(llvm::Value* _value)\n{\n\tm_bblock.m_currentStack.push_back(_value);\n\tm_bblock.m_tosOffset += 1;\n}\n\nllvm::Value* BasicBlock::LocalStack::pop()\n{\n\tauto result = get(0);\n\n\tif (m_bblock.m_currentStack.size() > 0)\n\t\tm_bblock.m_currentStack.pop_back();\n\n\tm_bblock.m_tosOffset -= 1;\n\treturn result;\n}\n\n\/**\n * Pushes a copy of _index-th element (tos is 0-th elem).\n *\/\nvoid BasicBlock::LocalStack::dup(size_t _index)\n{\n\tauto val = get(_index);\n\tpush(val);\n}\n\n\/**\n * Swaps tos with _index-th element (tos is 0-th elem).\n * _index must be > 0.\n *\/\nvoid BasicBlock::LocalStack::swap(size_t _index)\n{\n\tassert(_index > 0);\n\tauto val = get(_index);\n\tauto tos = get(0);\n\tset(_index, tos);\n\tset(0, val);\n}\n\nstd::vector<llvm::Value*>::iterator BasicBlock::LocalStack::getItemIterator(size_t _index)\n{\n\tauto& currentStack = m_bblock.m_currentStack;\n\tif (_index < currentStack.size())\n\t\treturn currentStack.end() - _index - 1;\n\n\t\/\/ Need to map more elements from the EVM stack\n\tauto nNewItems = 1 + _index - currentStack.size();\n\tcurrentStack.insert(currentStack.begin(), nNewItems, nullptr);\n\n\treturn currentStack.end() - _index - 1;\n}\n\nllvm::Value* BasicBlock::LocalStack::get(size_t _index)\n{\n\tauto& initialStack = m_bblock.m_initialStack;\n\tauto itemIter = getItemIterator(_index);\n\n\tif (*itemIter == nullptr)\n\t{\n\t\t\/\/ Need to fetch a new item from the EVM stack\n\t\tassert(static_cast<int>(_index) >= m_bblock.m_tosOffset);\n\t\tsize_t initialIdx = _index - m_bblock.m_tosOffset;\n\t\tif (initialIdx >= initialStack.size())\n\t\t{\n\t\t\tauto nNewItems = 1 + initialIdx - initialStack.size();\n\t\t\tinitialStack.insert(initialStack.end(), nNewItems, nullptr);\n\t\t}\n\n\t\tassert(initialStack[initialIdx] == nullptr);\n\t\t\/\/ Create a dummy value.\n\t\tstd::string name = \"get_\" + std::to_string(_index);\n\t\tinitialStack[initialIdx] = m_bblock.m_builder.CreatePHI(Type::Word, 0, std::move(name));\n\t\t*itemIter = initialStack[initialIdx];\n\t}\n\n\treturn *itemIter;\n}\n\nvoid BasicBlock::LocalStack::set(size_t _index, llvm::Value* _word)\n{\n\tauto itemIter = getItemIterator(_index);\n\t*itemIter = _word;\n}\n\n\n\n\n\nvoid BasicBlock::synchronizeLocalStack(Stack& _evmStack)\n{\n\tauto blockTerminator = m_llvmBB->getTerminator();\n\tassert(blockTerminator != nullptr);\n\tm_builder.SetInsertPoint(blockTerminator);\n\n\tauto currIter = m_currentStack.begin();\n\tauto endIter = m_currentStack.end();\n\n\t\/\/ Update (emit set()) changed values\n\tfor (int idx = m_currentStack.size() - 1 - m_tosOffset;\n\t\t currIter < endIter && idx >= 0;\n\t\t ++currIter, --idx)\n\t{\n\t\tassert(static_cast<size_t>(idx) < m_initialStack.size());\n\t\tif (*currIter != m_initialStack[idx]) \/\/ value needs update\n\t\t\t_evmStack.set(static_cast<size_t>(idx), *currIter);\n\t}\n\n\tif (m_tosOffset < 0)\n\t{\n\t\t\/\/ Pop values\n\t\t_evmStack.pop(static_cast<size_t>(-m_tosOffset));\n\t}\n\n\t\/\/ Push new values\n\tfor (; currIter < endIter; ++currIter)\n\t{\n\t\tassert(*currIter != nullptr);\n\t\t_evmStack.push(*currIter);\n\t}\n\n\t\/\/ Emit get() for all (used) values from the initial stack\n\tfor (size_t idx = 0; idx < m_initialStack.size(); ++idx)\n\t{\n\t\tauto val = m_initialStack[idx];\n\t\tif (val == nullptr)\n\t\t\tcontinue;\n\n\t\tassert(llvm::isa<llvm::PHINode>(val));\n\t\tllvm::PHINode* phi = llvm::cast<llvm::PHINode>(val);\n\t\tif (! phi->use_empty())\n\t\t{\n\t\t\t\/\/ Insert call to get() just before the PHI node and replace\n\t\t\t\/\/ the uses of PHI with the uses of this new instruction.\n\t\t\tm_builder.SetInsertPoint(phi);\n\t\t\tauto newVal = _evmStack.get(idx);\n\t\t\tphi->replaceAllUsesWith(newVal);\n\t\t}\n\t\tphi->eraseFromParent();\n\t}\n\n\t\/\/ Reset the stack\n\tm_initialStack.erase(m_initialStack.begin(), m_initialStack.end());\n\tm_currentStack.erase(m_currentStack.begin(), m_currentStack.end());\n\tm_tosOffset = 0;\n}\n\nvoid BasicBlock::linkLocalStacks(std::vector<BasicBlock*> basicBlocks, llvm::IRBuilder<>& _builder)\n{\n\tstruct BBInfo\n\t{\n\t\tBasicBlock& bblock;\n\t\tstd::vector<BBInfo*> predecessors;\n\t\tsize_t inputItems;\n\t\tsize_t outputItems;\n\t\tstd::vector<llvm::PHINode*> phisToRewrite;\n\n\t\tBBInfo(BasicBlock& _bblock) :\n\t\t\tbblock(_bblock),\n\t\t\tpredecessors(),\n\t\t\tinputItems(0),\n\t\t\toutputItems(0)\n\t\t{\n\t\t\tauto& initialStack = bblock.m_initialStack;\n\t\t\tfor (auto it = initialStack.begin();\n\t\t\t\t it != initialStack.end() && *it != nullptr;\n\t\t\t\t ++it, ++inputItems);\n\n\t\t\t\/\/if (bblock.localStack().m_tosOffset > 0)\n\t\t\t\/\/\toutputItems = bblock.localStack().m_tosOffset;\n\t\t\tauto& exitStack = bblock.m_currentStack;\n\t\t\tfor (auto it = exitStack.rbegin();\n\t\t\t\t it != exitStack.rend() && *it != nullptr;\n\t\t\t\t ++it, ++outputItems);\n\t\t}\n\t};\n\n\tstd::map<llvm::BasicBlock*, BBInfo> cfg;\n\n\t\/\/ Create nodes in cfg\n\tfor (auto bb : basicBlocks)\n\t\tcfg.emplace(bb->llvm(), *bb);\n\n\t\/\/ Create edges in cfg: for each bb info fill the list\n\t\/\/ of predecessor infos.\n\tfor (auto& pair : cfg)\n\t{\n\t\tauto bb = pair.first;\n\t\tauto& info = pair.second;\n\n\t\tfor (auto predIt = llvm::pred_begin(bb); predIt != llvm::pred_end(bb); ++predIt)\n\t\t{\n\t\t\tauto predInfoEntry = cfg.find(*predIt);\n\t\t\tif (predInfoEntry != cfg.end())\n\t\t\t\tinfo.predecessors.push_back(&predInfoEntry->second);\n\t\t}\n\t}\n\n\t\/\/ Iteratively compute inputs and outputs of each block, until reaching fixpoint.\n\tbool valuesChanged = true;\n\twhile (valuesChanged)\n\t{\n\t\tif (getenv(\"EVMCC_DEBUG_BLOCKS\"))\n\t\t{\n\t\t\tfor (auto& pair : cfg)\n\t\t\t\tstd::cerr << pair.second.bblock.llvm()->getName().str()\n\t\t\t\t\t\t << \": in \" << pair.second.inputItems\n\t\t\t\t\t\t << \", out \" << pair.second.outputItems\n\t\t\t\t\t\t << \"\\n\";\n\t\t}\n\n\t\tvaluesChanged = false;\n\t\tfor (auto& pair : cfg)\n\t\t{\n\t\t\tauto& info = pair.second;\n\n\t\t\tif (info.predecessors.empty())\n\t\t\t\tinfo.inputItems = 0; \/\/ no consequences for other blocks, so leave valuesChanged false\n\n\t\t\tfor (auto predInfo : info.predecessors)\n\t\t\t{\n\t\t\t\tif (predInfo->outputItems < info.inputItems)\n\t\t\t\t{\n\t\t\t\t\tinfo.inputItems = predInfo->outputItems;\n\t\t\t\t\tvaluesChanged = true;\n\t\t\t\t}\n\t\t\t\telse if (predInfo->outputItems > info.inputItems)\n\t\t\t\t{\n\t\t\t\t\tpredInfo->outputItems = info.inputItems;\n\t\t\t\t\tvaluesChanged = true;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\n\t\/\/ Propagate values between blocks.\n\tfor (auto& entry : cfg)\n\t{\n\t\tauto& info = entry.second;\n\t\tauto& bblock = info.bblock;\n\n\t\tllvm::BasicBlock::iterator fstNonPhi(bblock.llvm()->getFirstNonPHI());\n\t\tauto phiIter = bblock.m_initialStack.begin();\n\t\tfor (size_t index = 0; index < info.inputItems; ++index, ++phiIter)\n\t\t{\n\t\t\tassert(llvm::isa<llvm::PHINode>(*phiIter));\n\t\t\tauto phi = llvm::cast<llvm::PHINode>(*phiIter);\n\n\t\t\tfor (auto predIt : info.predecessors)\n\t\t\t{\n\t\t\t\tauto& predExitStack = predIt->bblock.m_currentStack;\n\t\t\t\tauto value = *(predExitStack.end() - 1 - index);\n\t\t\t\tphi->addIncoming(value, predIt->bblock.llvm());\n\t\t\t}\n\n\t\t\t\/\/ Move phi to the front\n\t\t\tif (llvm::BasicBlock::iterator(phi) != bblock.llvm()->begin())\n\t\t\t{\n\t\t\t\tphi->removeFromParent();\n\t\t\t\t_builder.SetInsertPoint(bblock.llvm(), bblock.llvm()->begin());\n\t\t\t\t_builder.Insert(phi);\n\t\t\t}\n\t\t}\n\n\t\t\/\/ The items pulled directly from predecessors block must be removed\n\t\t\/\/ from the list of items that has to be popped from the initial stack.\n\t\tauto& initialStack = bblock.m_initialStack;\n\t\tinitialStack.erase(initialStack.begin(), initialStack.begin() + info.inputItems);\n\t\t\/\/ Initial stack shrinks, so the size difference grows:\n\t\tbblock.m_tosOffset += info.inputItems;\n\t}\n\n\t\/\/ We must account for the items that were pushed directly to successor\n\t\/\/ blocks and thus should not be on the list of items to be pushed onto\n\t\/\/ to EVM stack\n\tfor (auto& entry : cfg)\n\t{\n\t\tauto& info = entry.second;\n\t\tauto& bblock = info.bblock;\n\n\t\tauto& exitStack = bblock.m_currentStack;\n\t\texitStack.erase(exitStack.end() - info.outputItems, exitStack.end());\n\t\tbblock.m_tosOffset -= info.outputItems;\n\t}\n}\n\nvoid BasicBlock::dump()\n{\n\tdump(std::cerr, false);\n}\n\nvoid BasicBlock::dump(std::ostream& _out, bool _dotOutput)\n{\n\tllvm::raw_os_ostream out(_out);\n\n\tout << (_dotOutput ? \"\" : \"Initial stack:\\n\");\n\tfor (auto val : m_initialStack)\n\t{\n\t\tif (val == nullptr)\n\t\t\tout << \" ?\";\n\t\telse if (llvm::isa<llvm::Instruction>(val))\n\t\t\tout << *val;\n\t\telse\n\t\t\tout << \" \" << *val;\n\n\t\tout << (_dotOutput ? \"\\\\l\" : \"\\n\");\n\t}\n\n\tout << (_dotOutput ? \"| \" : \"Instructions:\\n\");\n\tfor (auto ins = m_llvmBB->begin(); ins != m_llvmBB->end(); ++ins)\n\t\tout << *ins << (_dotOutput ? \"\\\\l\" : \"\\n\");\n\n\tif (! _dotOutput)\n\t\tout << \"Current stack (offset = \" << m_tosOffset << \"):\\n\";\n\telse\n\t\tout << \"|\";\n\n\tfor (auto val = m_currentStack.rbegin(); val != m_currentStack.rend(); ++val)\n\t{\n\t\tif (*val == nullptr)\n\t\t\tout << \" ?\";\n\t\telse if (llvm::isa<llvm::Instruction>(*val))\n\t\t\tout << **val;\n\t\telse\n\t\t\tout << \" \" << **val;\n\t\tout << (_dotOutput ? \"\\\\l\" : \"\\n\");\n\t}\n\n\tif (! _dotOutput)\n\t\tout << \" ...\\n----------------------------------------\\n\";\n}\n\n\n\n\n}\n}\n}\n\n<commit_msg>Allways generate stack_get() call to detect stack underflow cases<commit_after>\n#include \"BasicBlock.h\"\n\n#include <iostream>\n\n#include <llvm\/IR\/CFG.h>\n#include <llvm\/IR\/Function.h>\n#include <llvm\/IR\/Instructions.h>\n#include <llvm\/IR\/IRBuilder.h>\n#include <llvm\/Support\/raw_os_ostream.h>\n\n#include \"Type.h\"\n\nnamespace dev\n{\nnamespace eth\n{\nnamespace jit\n{\n\nconst char* BasicBlock::NamePrefix = \"Instr.\";\n\nBasicBlock::BasicBlock(bytes::const_iterator _begin, bytes::const_iterator _end, llvm::Function* _mainFunc, llvm::IRBuilder<>& _builder, bool isJumpDest) :\n\tm_begin(_begin),\n\tm_end(_end),\n\t\/\/ TODO: Add begin index to name\n\tm_llvmBB(llvm::BasicBlock::Create(_mainFunc->getContext(), NamePrefix, _mainFunc)),\n\tm_stack(*this),\n\tm_builder(_builder),\n\tm_isJumpDest(isJumpDest)\n{}\n\nBasicBlock::BasicBlock(std::string _name, llvm::Function* _mainFunc, llvm::IRBuilder<>& _builder, bool isJumpDest) :\n\tm_llvmBB(llvm::BasicBlock::Create(_mainFunc->getContext(), _name, _mainFunc)),\n\tm_stack(*this),\n\tm_builder(_builder),\n\tm_isJumpDest(isJumpDest)\n{}\n\nBasicBlock::LocalStack::LocalStack(BasicBlock& _owner) :\n\tm_bblock(_owner)\n{}\n\nvoid BasicBlock::LocalStack::push(llvm::Value* _value)\n{\n\tm_bblock.m_currentStack.push_back(_value);\n\tm_bblock.m_tosOffset += 1;\n}\n\nllvm::Value* BasicBlock::LocalStack::pop()\n{\n\tauto result = get(0);\n\n\tif (m_bblock.m_currentStack.size() > 0)\n\t\tm_bblock.m_currentStack.pop_back();\n\n\tm_bblock.m_tosOffset -= 1;\n\treturn result;\n}\n\n\/**\n * Pushes a copy of _index-th element (tos is 0-th elem).\n *\/\nvoid BasicBlock::LocalStack::dup(size_t _index)\n{\n\tauto val = get(_index);\n\tpush(val);\n}\n\n\/**\n * Swaps tos with _index-th element (tos is 0-th elem).\n * _index must be > 0.\n *\/\nvoid BasicBlock::LocalStack::swap(size_t _index)\n{\n\tassert(_index > 0);\n\tauto val = get(_index);\n\tauto tos = get(0);\n\tset(_index, tos);\n\tset(0, val);\n}\n\nstd::vector<llvm::Value*>::iterator BasicBlock::LocalStack::getItemIterator(size_t _index)\n{\n\tauto& currentStack = m_bblock.m_currentStack;\n\tif (_index < currentStack.size())\n\t\treturn currentStack.end() - _index - 1;\n\n\t\/\/ Need to map more elements from the EVM stack\n\tauto nNewItems = 1 + _index - currentStack.size();\n\tcurrentStack.insert(currentStack.begin(), nNewItems, nullptr);\n\n\treturn currentStack.end() - _index - 1;\n}\n\nllvm::Value* BasicBlock::LocalStack::get(size_t _index)\n{\n\tauto& initialStack = m_bblock.m_initialStack;\n\tauto itemIter = getItemIterator(_index);\n\n\tif (*itemIter == nullptr)\n\t{\n\t\t\/\/ Need to fetch a new item from the EVM stack\n\t\tassert(static_cast<int>(_index) >= m_bblock.m_tosOffset);\n\t\tsize_t initialIdx = _index - m_bblock.m_tosOffset;\n\t\tif (initialIdx >= initialStack.size())\n\t\t{\n\t\t\tauto nNewItems = 1 + initialIdx - initialStack.size();\n\t\t\tinitialStack.insert(initialStack.end(), nNewItems, nullptr);\n\t\t}\n\n\t\tassert(initialStack[initialIdx] == nullptr);\n\t\t\/\/ Create a dummy value.\n\t\tstd::string name = \"get_\" + std::to_string(_index);\n\t\tinitialStack[initialIdx] = m_bblock.m_builder.CreatePHI(Type::Word, 0, std::move(name));\n\t\t*itemIter = initialStack[initialIdx];\n\t}\n\n\treturn *itemIter;\n}\n\nvoid BasicBlock::LocalStack::set(size_t _index, llvm::Value* _word)\n{\n\tauto itemIter = getItemIterator(_index);\n\t*itemIter = _word;\n}\n\n\n\n\n\nvoid BasicBlock::synchronizeLocalStack(Stack& _evmStack)\n{\n\tauto blockTerminator = m_llvmBB->getTerminator();\n\tassert(blockTerminator != nullptr);\n\tm_builder.SetInsertPoint(blockTerminator);\n\n\tauto currIter = m_currentStack.begin();\n\tauto endIter = m_currentStack.end();\n\n\t\/\/ Update (emit set()) changed values\n\tfor (int idx = m_currentStack.size() - 1 - m_tosOffset;\n\t\t currIter < endIter && idx >= 0;\n\t\t ++currIter, --idx)\n\t{\n\t\tassert(static_cast<size_t>(idx) < m_initialStack.size());\n\t\tif (*currIter != m_initialStack[idx]) \/\/ value needs update\n\t\t\t_evmStack.set(static_cast<size_t>(idx), *currIter);\n\t}\n\n\tif (m_tosOffset < 0)\n\t{\n\t\t\/\/ Pop values\n\t\t_evmStack.pop(static_cast<size_t>(-m_tosOffset));\n\t}\n\n\t\/\/ Push new values\n\tfor (; currIter < endIter; ++currIter)\n\t{\n\t\tassert(*currIter != nullptr);\n\t\t_evmStack.push(*currIter);\n\t}\n\n\t\/\/ Emit get() for all (used) values from the initial stack\n\tfor (size_t idx = 0; idx < m_initialStack.size(); ++idx)\n\t{\n\t\tauto val = m_initialStack[idx];\n\t\tif (val == nullptr)\n\t\t\tcontinue;\n\n\t\tllvm::PHINode* phi = llvm::cast<llvm::PHINode>(val);\n\t\t\/\/ Insert call to get() just before the PHI node and replace\n\t\t\/\/ the uses of PHI with the uses of this new instruction.\n\t\tm_builder.SetInsertPoint(phi);\n\t\tauto newVal = _evmStack.get(idx); \/\/ OPT: Value may be never user but we need to check stack heigth\n\t\t \/\/ It is probably a good idea to keep heigth as a local variable accesible by LLVM directly\n\t\tphi->replaceAllUsesWith(newVal);\n\t\tphi->eraseFromParent();\n\t}\n\n\t\/\/ Reset the stack\n\tm_initialStack.erase(m_initialStack.begin(), m_initialStack.end());\n\tm_currentStack.erase(m_currentStack.begin(), m_currentStack.end());\n\tm_tosOffset = 0;\n}\n\nvoid BasicBlock::linkLocalStacks(std::vector<BasicBlock*> basicBlocks, llvm::IRBuilder<>& _builder)\n{\n\tstruct BBInfo\n\t{\n\t\tBasicBlock& bblock;\n\t\tstd::vector<BBInfo*> predecessors;\n\t\tsize_t inputItems;\n\t\tsize_t outputItems;\n\t\tstd::vector<llvm::PHINode*> phisToRewrite;\n\n\t\tBBInfo(BasicBlock& _bblock) :\n\t\t\tbblock(_bblock),\n\t\t\tpredecessors(),\n\t\t\tinputItems(0),\n\t\t\toutputItems(0)\n\t\t{\n\t\t\tauto& initialStack = bblock.m_initialStack;\n\t\t\tfor (auto it = initialStack.begin();\n\t\t\t\t it != initialStack.end() && *it != nullptr;\n\t\t\t\t ++it, ++inputItems);\n\n\t\t\t\/\/if (bblock.localStack().m_tosOffset > 0)\n\t\t\t\/\/\toutputItems = bblock.localStack().m_tosOffset;\n\t\t\tauto& exitStack = bblock.m_currentStack;\n\t\t\tfor (auto it = exitStack.rbegin();\n\t\t\t\t it != exitStack.rend() && *it != nullptr;\n\t\t\t\t ++it, ++outputItems);\n\t\t}\n\t};\n\n\tstd::map<llvm::BasicBlock*, BBInfo> cfg;\n\n\t\/\/ Create nodes in cfg\n\tfor (auto bb : basicBlocks)\n\t\tcfg.emplace(bb->llvm(), *bb);\n\n\t\/\/ Create edges in cfg: for each bb info fill the list\n\t\/\/ of predecessor infos.\n\tfor (auto& pair : cfg)\n\t{\n\t\tauto bb = pair.first;\n\t\tauto& info = pair.second;\n\n\t\tfor (auto predIt = llvm::pred_begin(bb); predIt != llvm::pred_end(bb); ++predIt)\n\t\t{\n\t\t\tauto predInfoEntry = cfg.find(*predIt);\n\t\t\tif (predInfoEntry != cfg.end())\n\t\t\t\tinfo.predecessors.push_back(&predInfoEntry->second);\n\t\t}\n\t}\n\n\t\/\/ Iteratively compute inputs and outputs of each block, until reaching fixpoint.\n\tbool valuesChanged = true;\n\twhile (valuesChanged)\n\t{\n\t\tif (getenv(\"EVMCC_DEBUG_BLOCKS\"))\n\t\t{\n\t\t\tfor (auto& pair : cfg)\n\t\t\t\tstd::cerr << pair.second.bblock.llvm()->getName().str()\n\t\t\t\t\t\t << \": in \" << pair.second.inputItems\n\t\t\t\t\t\t << \", out \" << pair.second.outputItems\n\t\t\t\t\t\t << \"\\n\";\n\t\t}\n\n\t\tvaluesChanged = false;\n\t\tfor (auto& pair : cfg)\n\t\t{\n\t\t\tauto& info = pair.second;\n\n\t\t\tif (info.predecessors.empty())\n\t\t\t\tinfo.inputItems = 0; \/\/ no consequences for other blocks, so leave valuesChanged false\n\n\t\t\tfor (auto predInfo : info.predecessors)\n\t\t\t{\n\t\t\t\tif (predInfo->outputItems < info.inputItems)\n\t\t\t\t{\n\t\t\t\t\tinfo.inputItems = predInfo->outputItems;\n\t\t\t\t\tvaluesChanged = true;\n\t\t\t\t}\n\t\t\t\telse if (predInfo->outputItems > info.inputItems)\n\t\t\t\t{\n\t\t\t\t\tpredInfo->outputItems = info.inputItems;\n\t\t\t\t\tvaluesChanged = true;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\n\t\/\/ Propagate values between blocks.\n\tfor (auto& entry : cfg)\n\t{\n\t\tauto& info = entry.second;\n\t\tauto& bblock = info.bblock;\n\n\t\tllvm::BasicBlock::iterator fstNonPhi(bblock.llvm()->getFirstNonPHI());\n\t\tauto phiIter = bblock.m_initialStack.begin();\n\t\tfor (size_t index = 0; index < info.inputItems; ++index, ++phiIter)\n\t\t{\n\t\t\tassert(llvm::isa<llvm::PHINode>(*phiIter));\n\t\t\tauto phi = llvm::cast<llvm::PHINode>(*phiIter);\n\n\t\t\tfor (auto predIt : info.predecessors)\n\t\t\t{\n\t\t\t\tauto& predExitStack = predIt->bblock.m_currentStack;\n\t\t\t\tauto value = *(predExitStack.end() - 1 - index);\n\t\t\t\tphi->addIncoming(value, predIt->bblock.llvm());\n\t\t\t}\n\n\t\t\t\/\/ Move phi to the front\n\t\t\tif (llvm::BasicBlock::iterator(phi) != bblock.llvm()->begin())\n\t\t\t{\n\t\t\t\tphi->removeFromParent();\n\t\t\t\t_builder.SetInsertPoint(bblock.llvm(), bblock.llvm()->begin());\n\t\t\t\t_builder.Insert(phi);\n\t\t\t}\n\t\t}\n\n\t\t\/\/ The items pulled directly from predecessors block must be removed\n\t\t\/\/ from the list of items that has to be popped from the initial stack.\n\t\tauto& initialStack = bblock.m_initialStack;\n\t\tinitialStack.erase(initialStack.begin(), initialStack.begin() + info.inputItems);\n\t\t\/\/ Initial stack shrinks, so the size difference grows:\n\t\tbblock.m_tosOffset += info.inputItems;\n\t}\n\n\t\/\/ We must account for the items that were pushed directly to successor\n\t\/\/ blocks and thus should not be on the list of items to be pushed onto\n\t\/\/ to EVM stack\n\tfor (auto& entry : cfg)\n\t{\n\t\tauto& info = entry.second;\n\t\tauto& bblock = info.bblock;\n\n\t\tauto& exitStack = bblock.m_currentStack;\n\t\texitStack.erase(exitStack.end() - info.outputItems, exitStack.end());\n\t\tbblock.m_tosOffset -= info.outputItems;\n\t}\n}\n\nvoid BasicBlock::dump()\n{\n\tdump(std::cerr, false);\n}\n\nvoid BasicBlock::dump(std::ostream& _out, bool _dotOutput)\n{\n\tllvm::raw_os_ostream out(_out);\n\n\tout << (_dotOutput ? \"\" : \"Initial stack:\\n\");\n\tfor (auto val : m_initialStack)\n\t{\n\t\tif (val == nullptr)\n\t\t\tout << \" ?\";\n\t\telse if (llvm::isa<llvm::Instruction>(val))\n\t\t\tout << *val;\n\t\telse\n\t\t\tout << \" \" << *val;\n\n\t\tout << (_dotOutput ? \"\\\\l\" : \"\\n\");\n\t}\n\n\tout << (_dotOutput ? \"| \" : \"Instructions:\\n\");\n\tfor (auto ins = m_llvmBB->begin(); ins != m_llvmBB->end(); ++ins)\n\t\tout << *ins << (_dotOutput ? \"\\\\l\" : \"\\n\");\n\n\tif (! _dotOutput)\n\t\tout << \"Current stack (offset = \" << m_tosOffset << \"):\\n\";\n\telse\n\t\tout << \"|\";\n\n\tfor (auto val = m_currentStack.rbegin(); val != m_currentStack.rend(); ++val)\n\t{\n\t\tif (*val == nullptr)\n\t\t\tout << \" ?\";\n\t\telse if (llvm::isa<llvm::Instruction>(*val))\n\t\t\tout << **val;\n\t\telse\n\t\t\tout << \" \" << **val;\n\t\tout << (_dotOutput ? \"\\\\l\" : \"\\n\");\n\t}\n\n\tif (! _dotOutput)\n\t\tout << \" ...\\n----------------------------------------\\n\";\n}\n\n\n\n\n}\n}\n}\n\n<|endoftext|>"} {"text":"<commit_before>\/*\n * endian.hpp\n * Some functions for handling endian.\n *\n * written by janus_wel<janus.wel.3@gmail.com>\n * This source code is NOT MY COPYRIGHTED WORK, and has NO WARRANTY.\n *\n * Refer - a source of an idea:\n * http:\/\/www.kijineko.co.jp\/tech\/cpptempls\/endian\n * *\/\n\n#ifndef ENDIAN_H\n#define ENDIAN_H\n\n#include <algorithm>\n#include \"cast.hpp\"\n\nnamespace util {\n namespace endian {\n inline bool is_le() {\n \/\/ in a 32-bit machine, the representation of 1 is:\n \/\/\n \/\/ little endian: 01 00 00 00\n \/\/ big endian: 00 00 00 01\n \/\/\n \/\/ therefore the machine is little endian\n \/\/ if the first byte is 1 (actually 01).\n int t = 1;\n return *(util::cast::pointer_cast<char*>(&t)) == 1;\n }\n inline bool is_be() { return !is_le(); }\n\n \/\/ this is destructive but fast\n template<typename T> void fast_reverse(T& value) {\n char volatile* first = util::cast::pointer_cast<char volatile*>(&value);\n char volatile* last = first + sizeof(T);\n std::reverse(first, last);\n }\n\n \/\/ this is slow but nondestructive\n template<typename T> T reverse(const T& value) {\n T temp = value;\n char volatile* first = util::cast::pointer_cast<char volatile*>(&temp);\n char volatile* last = first + sizeof(T);\n std::reverse(first, last);\n return temp;\n }\n }\n}\n\n#endif \/\/ ENDIAN_H\n\n<commit_msg>Change the names of functions and refactoring<commit_after>\/*\n * endian.hpp\n * Some functions for handling endian.\n *\n * written by janus_wel<janus.wel.3@gmail.com>\n * This source code is NOT MY COPYRIGHTED WORK, and has NO WARRANTY.\n *\n * Refer - a source of an idea:\n * http:\/\/www.kijineko.co.jp\/tech\/cpptempls\/endian\n * *\/\n\n#ifndef ENDIAN_H\n#define ENDIAN_H\n\n#include <algorithm>\n#include \"cast.hpp\"\n\nnamespace util {\n namespace endian {\n \/*\n * In a 32-bit machine, the representation of 1 in type int is:\n *\n * little endian: 01 00 00 00\n * big endian: 00 00 00 01\n *\n * therefore the machine is little endian if the first byte is 1\n * (actually it's 0x01).\n * *\/\n inline bool is_little() {\n int t = 1;\n return *(util::cast::pointer_cast<char*>(&t)) == 1;\n }\n inline bool is_big() { return !is_little(); }\n\n \/\/ this is slow but nondestructive\n template<typename T> T reverse(T value) {\n char volatile* first = util::cast::pointer_cast<char volatile*>(&value);\n char volatile* last = first + sizeof(T);\n std::reverse(first, last);\n return value;\n }\n\n \/\/ this is destructive but fast\n template<typename T> void fast_reverse(T& value) {\n char volatile* first = util::cast::pointer_cast<char volatile*>(&value);\n char volatile* last = first + sizeof(T);\n std::reverse(first, last);\n }\n }\n}\n\n#endif \/\/ ENDIAN_H\n\n<|endoftext|>"} {"text":"<commit_before>\/* vim:expandtab:shiftwidth=2:tabstop=2:smarttab:\n * \n * Gearmand client and server library.\n *\n * Copyright (C) 2011-2012 Data Differential, http:\/\/datadifferential.com\/\n * Copyright (C) 2008 Brian Aker, Eric Day\n * All rights 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 * @file\n * @brief Gearman State Definitions\n *\/\n\n#include <config.h>\n#include <libgearman-server\/common.h>\n#include <libgearman-server\/timer.h>\n\n#include <algorithm>\n#include <cerrno>\n#include <cstring>\n#include <ctime>\n\nstatic pthread_key_t logging_key;\nstatic pthread_once_t intitialize_log_once= PTHREAD_ONCE_INIT;\n\nstatic void delete_log(void *ptr)\n{\n if (ptr)\n {\n free(ptr);\n }\n}\n\nstatic void create_log(void)\n{\n (void) pthread_key_create(&logging_key, delete_log);\n}\n\nvoid gearmand_initialize_thread_logging(const char *identity)\n{\n (void) pthread_once(&intitialize_log_once, create_log);\n\n if (pthread_getspecific(logging_key) == NULL)\n {\n const char *key_to_use= strdup(identity);\n (void) pthread_setspecific(logging_key, key_to_use);\n }\n}\n\n#ifndef __INTEL_COMPILER\n#pragma GCC diagnostic ignored \"-Wold-style-cast\"\n#pragma GCC diagnostic ignored \"-Wformat-nonliteral\"\n#endif\n\n\/**\n * Log a message.\n *\n * @param[in] gearman Structure previously initialized with gearman_create() or\n * gearman_clone().\n * @param[in] verbose Logging level of the message.\n * @param[in] format Format and variable argument list of message.\n * @param[in] args Variable argument list that has been initialized.\n *\/\n\nstatic void gearmand_log(const char *position, const char *func \/* func *\/, \n gearmand_verbose_t verbose,\n const gearmand_error_t error_arg,\n const char *format, va_list args)\n{\n struct timeval current_epoch;\n\n if (Gearmand() and Gearmand()->verbose < GEARMAND_VERBOSE_DEBUG)\n {\n current_epoch= libgearman::server::Epoch::current();\n current_epoch.tv_usec= 0;\n }\n else\n {\n (void)gettimeofday(¤t_epoch, NULL);\n }\n\n struct tm current_tm;\n if (current_epoch.tv_sec == 0)\n {\n (void)gettimeofday(¤t_epoch, NULL);\n }\n\n if ((gmtime_r(¤t_epoch.tv_sec, ¤t_tm) == NULL))\n {\n memset(¤t_epoch, 0, sizeof(current_epoch));\n }\n\n (void) pthread_once(&intitialize_log_once, create_log);\n\n const char *identity= (const char *)pthread_getspecific(logging_key);\n\n if (identity == NULL)\n {\n identity= \"[ main ]\";\n }\n\n char log_buffer[GEARMAN_MAX_ERROR_SIZE*2] = { 0 };\n if (Gearmand() && Gearmand()->log_fn)\n {\n char *log_buffer_ptr= log_buffer;\n size_t remaining_size= sizeof(log_buffer);\n\n {\n int length= snprintf(log_buffer, sizeof(log_buffer), \"%04d-%02d-%02d %02d:%02d:%02d.%06d %s \",\n int(1900 + current_tm.tm_year), current_tm.tm_mon, current_tm.tm_mday, current_tm.tm_hour,\n current_tm.tm_min, current_tm.tm_sec, int(current_epoch.tv_usec),\n identity);\n \/\/ We just return whatever we have if this occurs\n if (length <= 0 or (size_t)length >= sizeof(log_buffer))\n {\n remaining_size= 0;\n }\n else\n {\n remaining_size-= size_t(length);\n log_buffer_ptr+= length;\n }\n }\n\n if (remaining_size)\n {\n int length= vsnprintf(log_buffer_ptr, remaining_size, format, args);\n if (length <= 0 or size_t(length) >= remaining_size)\n { \n remaining_size= 0;\n }\n else\n {\n remaining_size-= size_t(length);\n log_buffer_ptr+= length;\n }\n }\n\n if (remaining_size and error_arg != GEARMAN_SUCCESS)\n {\n int length= snprintf(log_buffer_ptr, remaining_size, \" %s(%s)\", func, gearmand_strerror(error_arg));\n if (length <= 0 or size_t(length) >= remaining_size)\n {\n remaining_size= 0;\n }\n else\n {\n remaining_size-= size_t(length);\n log_buffer_ptr+= length;\n }\n }\n\n if (remaining_size and position and verbose != GEARMAND_VERBOSE_INFO)\n {\n int length= snprintf(log_buffer_ptr, remaining_size, \" -> %s\", position);\n if (length <= 0 or size_t(length) >= remaining_size)\n {\n remaining_size= 0;\n }\n }\n\n \/\/ Make sure this is null terminated\n log_buffer[sizeof(log_buffer) -1]= 0;\n }\n\n if (Gearmand() and Gearmand()->log_fn)\n {\n Gearmand()->log_fn(log_buffer, verbose, (void *)Gearmand()->log_context);\n }\n else\n {\n fprintf(stderr, \"%s -> %s\",\n log_buffer, gearmand_verbose_name(verbose));\n vfprintf(stderr, format, args);\n fprintf(stderr, \"\\n\");\n }\n}\n\n\nvoid gearmand_log_fatal(const char *position, const char *func, const char *format, ...)\n{\n va_list args;\n\n if (not Gearmand() || Gearmand()->verbose >= GEARMAND_VERBOSE_FATAL)\n {\n va_start(args, format);\n gearmand_log(position, func, GEARMAND_VERBOSE_FATAL, GEARMAN_SUCCESS, format, args);\n va_end(args);\n }\n}\n\nvoid gearmand_log_fatal_perror(const char *position, const char *function, const char *message)\n{\n if (not Gearmand() || Gearmand()->verbose >= GEARMAND_VERBOSE_FATAL)\n {\n const char *errmsg_ptr;\n char errmsg[GEARMAN_MAX_ERROR_SIZE]; \n errmsg[0]= 0; \n\n#ifdef STRERROR_R_CHAR_P\n errmsg_ptr= strerror_r(errno, errmsg, sizeof(errmsg));\n#else\n strerror_r(errno, errmsg, sizeof(errmsg));\n errmsg_ptr= errmsg;\n#endif\n\n gearmand_log_fatal(position, function, \"%s(%s)\", message, errmsg_ptr);\n }\n}\n\ngearmand_error_t gearmand_log_error(const char *position, const char *function, const char *format, ...)\n{\n va_list args;\n\n if (not Gearmand() or Gearmand()->verbose >= GEARMAND_VERBOSE_ERROR)\n {\n va_start(args, format);\n gearmand_log(position, function, GEARMAND_VERBOSE_ERROR, GEARMAN_SUCCESS, format, args);\n va_end(args);\n }\n\n return GEARMAN_UNKNOWN_OPTION;\n}\n\nvoid gearmand_log_warning(const char *position, const char *function, const char *format, ...)\n{\n va_list args;\n\n if (not Gearmand() || Gearmand()->verbose >= GEARMAND_VERBOSE_WARN)\n {\n va_start(args, format);\n gearmand_log(position, function, GEARMAND_VERBOSE_WARN, GEARMAN_SUCCESS, format, args);\n va_end(args);\n }\n}\n\n\/\/ LOG_NOTICE is only used for reporting job status.\nvoid gearmand_log_notice(const char *position, const char *function, const char *format, ...)\n{\n va_list args;\n\n if (not Gearmand() || Gearmand()->verbose >= GEARMAND_VERBOSE_NOTICE)\n {\n va_start(args, format);\n gearmand_log(position, function, GEARMAND_VERBOSE_NOTICE, GEARMAN_SUCCESS, format, args);\n va_end(args);\n }\n}\n\nvoid gearmand_log_info(const char *position, const char *function, const char *format, ...)\n{\n va_list args;\n\n if (not Gearmand() || Gearmand()->verbose >= GEARMAND_VERBOSE_INFO)\n {\n va_start(args, format);\n gearmand_log(position, function, GEARMAND_VERBOSE_INFO, GEARMAN_SUCCESS, format, args);\n va_end(args);\n }\n}\n\nvoid gearmand_log_debug(const char *position, const char *function, const char *format, ...)\n{\n va_list args;\n\n if (not Gearmand() || Gearmand()->verbose >= GEARMAND_VERBOSE_DEBUG)\n {\n va_start(args, format);\n gearmand_log(position, function, GEARMAND_VERBOSE_DEBUG, GEARMAN_SUCCESS, format, args);\n va_end(args);\n }\n}\n\ngearmand_error_t gearmand_log_perror(const char *position, const char *function, const char *message)\n{\n if (not Gearmand() or (Gearmand()->verbose >= GEARMAND_VERBOSE_ERROR))\n {\n const char *errmsg_ptr;\n char errmsg[GEARMAN_MAX_ERROR_SIZE]; \n errmsg[0]= 0; \n\n#ifdef STRERROR_R_CHAR_P\n errmsg_ptr= strerror_r(errno, errmsg, sizeof(errmsg));\n#else\n strerror_r(errno, errmsg, sizeof(errmsg));\n errmsg_ptr= errmsg;\n#endif\n gearmand_log_error(position, function, \"%s(%s)\", message, errmsg_ptr);\n }\n\n return GEARMAN_ERRNO;\n}\n\ngearmand_error_t gearmand_log_gerror(const char *position, const char *function, const gearmand_error_t rc, const char *format, ...)\n{\n if (gearmand_failed(rc) and rc != GEARMAN_IO_WAIT)\n {\n va_list args;\n\n if (Gearmand() == NULL or Gearmand()->verbose >= GEARMAND_VERBOSE_ERROR)\n {\n va_start(args, format);\n gearmand_log(position, function, GEARMAND_VERBOSE_ERROR, rc, format, args);\n va_end(args);\n }\n }\n else if (rc == GEARMAN_IO_WAIT)\n { }\n\n return rc;\n}\n\ngearmand_error_t gearmand_log_gerror_warn(const char *position, const char *function, const gearmand_error_t rc, const char *format, ...)\n{\n if (gearmand_failed(rc) and rc != GEARMAN_IO_WAIT)\n {\n va_list args;\n\n if (Gearmand() == NULL or Gearmand()->verbose >= GEARMAND_VERBOSE_WARN)\n {\n va_start(args, format);\n gearmand_log(position, function, GEARMAND_VERBOSE_WARN, rc, format, args);\n va_end(args);\n }\n }\n else if (rc == GEARMAN_IO_WAIT)\n { }\n\n return rc;\n}\n\ngearmand_error_t gearmand_log_gai_error(const char *position, const char *function, const int rc, const char *message)\n{\n if (rc == EAI_SYSTEM)\n {\n return gearmand_log_perror(position, function, message);\n }\n\n gearmand_log_error(position, function, \"%s getaddrinfo(%s)\", message, gai_strerror(rc));\n\n return GEARMAN_GETADDRINFO;\n}\n\ngearmand_error_t gearmand_log_memory_error(const char *position, const char *function, const char *allocator, const char *object_type, size_t count, size_t size)\n{\n if (count > 1)\n {\n gearmand_log_error(position, function, \"%s(%s, count: %lu size: %lu)\", allocator, object_type, static_cast<unsigned long>(count), static_cast<unsigned long>(size));\n }\n else\n {\n gearmand_log_error(position, function, \"%s(%s, size: %lu)\", allocator, object_type, static_cast<unsigned long>(count), static_cast<unsigned long>(size));\n }\n\n return GEARMAN_MEMORY_ALLOCATION_FAILURE;\n}\n<commit_msg>Fix month for date in log.<commit_after>\/* vim:expandtab:shiftwidth=2:tabstop=2:smarttab:\n * \n * Gearmand client and server library.\n *\n * Copyright (C) 2011-2012 Data Differential, http:\/\/datadifferential.com\/\n * Copyright (C) 2008 Brian Aker, Eric Day\n * All rights 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 * @file\n * @brief Gearman State Definitions\n *\/\n\n#include <config.h>\n#include <libgearman-server\/common.h>\n#include <libgearman-server\/timer.h>\n\n#include <algorithm>\n#include <cerrno>\n#include <cstring>\n#include <ctime>\n\nstatic pthread_key_t logging_key;\nstatic pthread_once_t intitialize_log_once= PTHREAD_ONCE_INIT;\n\nstatic void delete_log(void *ptr)\n{\n if (ptr)\n {\n free(ptr);\n }\n}\n\nstatic void create_log(void)\n{\n (void) pthread_key_create(&logging_key, delete_log);\n}\n\nvoid gearmand_initialize_thread_logging(const char *identity)\n{\n (void) pthread_once(&intitialize_log_once, create_log);\n\n if (pthread_getspecific(logging_key) == NULL)\n {\n const char *key_to_use= strdup(identity);\n (void) pthread_setspecific(logging_key, key_to_use);\n }\n}\n\n#ifndef __INTEL_COMPILER\n#pragma GCC diagnostic ignored \"-Wold-style-cast\"\n#pragma GCC diagnostic ignored \"-Wformat-nonliteral\"\n#endif\n\n\/**\n * Log a message.\n *\n * @param[in] gearman Structure previously initialized with gearman_create() or\n * gearman_clone().\n * @param[in] verbose Logging level of the message.\n * @param[in] format Format and variable argument list of message.\n * @param[in] args Variable argument list that has been initialized.\n *\/\n\nstatic void gearmand_log(const char *position, const char *func \/* func *\/, \n gearmand_verbose_t verbose,\n const gearmand_error_t error_arg,\n const char *format, va_list args)\n{\n struct timeval current_epoch;\n\n if (Gearmand() and Gearmand()->verbose < GEARMAND_VERBOSE_DEBUG)\n {\n current_epoch= libgearman::server::Epoch::current();\n current_epoch.tv_usec= 0;\n }\n else\n {\n (void)gettimeofday(¤t_epoch, NULL);\n }\n\n struct tm current_tm;\n if (current_epoch.tv_sec == 0)\n {\n (void)gettimeofday(¤t_epoch, NULL);\n }\n\n if ((gmtime_r(¤t_epoch.tv_sec, ¤t_tm) == NULL))\n {\n memset(¤t_epoch, 0, sizeof(current_epoch));\n }\n\n (void) pthread_once(&intitialize_log_once, create_log);\n\n const char *identity= (const char *)pthread_getspecific(logging_key);\n\n if (identity == NULL)\n {\n identity= \"[ main ]\";\n }\n\n char log_buffer[GEARMAN_MAX_ERROR_SIZE*2] = { 0 };\n if (Gearmand() && Gearmand()->log_fn)\n {\n char *log_buffer_ptr= log_buffer;\n size_t remaining_size= sizeof(log_buffer);\n\n {\n int length= snprintf(log_buffer, sizeof(log_buffer), \"%04d-%02d-%02d %02d:%02d:%02d.%06d %s \",\n int(1900 +current_tm.tm_year), current_tm.tm_mon +1, current_tm.tm_mday, current_tm.tm_hour,\n current_tm.tm_min, current_tm.tm_sec, int(current_epoch.tv_usec),\n identity);\n \/\/ We just return whatever we have if this occurs\n if (length <= 0 or (size_t)length >= sizeof(log_buffer))\n {\n remaining_size= 0;\n }\n else\n {\n remaining_size-= size_t(length);\n log_buffer_ptr+= length;\n }\n }\n\n if (remaining_size)\n {\n int length= vsnprintf(log_buffer_ptr, remaining_size, format, args);\n if (length <= 0 or size_t(length) >= remaining_size)\n { \n remaining_size= 0;\n }\n else\n {\n remaining_size-= size_t(length);\n log_buffer_ptr+= length;\n }\n }\n\n if (remaining_size and error_arg != GEARMAN_SUCCESS)\n {\n int length= snprintf(log_buffer_ptr, remaining_size, \" %s(%s)\", func, gearmand_strerror(error_arg));\n if (length <= 0 or size_t(length) >= remaining_size)\n {\n remaining_size= 0;\n }\n else\n {\n remaining_size-= size_t(length);\n log_buffer_ptr+= length;\n }\n }\n\n if (remaining_size and position and verbose != GEARMAND_VERBOSE_INFO)\n {\n int length= snprintf(log_buffer_ptr, remaining_size, \" -> %s\", position);\n if (length <= 0 or size_t(length) >= remaining_size)\n {\n remaining_size= 0;\n }\n }\n\n \/\/ Make sure this is null terminated\n log_buffer[sizeof(log_buffer) -1]= 0;\n }\n\n if (Gearmand() and Gearmand()->log_fn)\n {\n Gearmand()->log_fn(log_buffer, verbose, (void *)Gearmand()->log_context);\n }\n else\n {\n fprintf(stderr, \"%s -> %s\",\n log_buffer, gearmand_verbose_name(verbose));\n vfprintf(stderr, format, args);\n fprintf(stderr, \"\\n\");\n }\n}\n\n\nvoid gearmand_log_fatal(const char *position, const char *func, const char *format, ...)\n{\n va_list args;\n\n if (not Gearmand() || Gearmand()->verbose >= GEARMAND_VERBOSE_FATAL)\n {\n va_start(args, format);\n gearmand_log(position, func, GEARMAND_VERBOSE_FATAL, GEARMAN_SUCCESS, format, args);\n va_end(args);\n }\n}\n\nvoid gearmand_log_fatal_perror(const char *position, const char *function, const char *message)\n{\n if (not Gearmand() || Gearmand()->verbose >= GEARMAND_VERBOSE_FATAL)\n {\n const char *errmsg_ptr;\n char errmsg[GEARMAN_MAX_ERROR_SIZE]; \n errmsg[0]= 0; \n\n#ifdef STRERROR_R_CHAR_P\n errmsg_ptr= strerror_r(errno, errmsg, sizeof(errmsg));\n#else\n strerror_r(errno, errmsg, sizeof(errmsg));\n errmsg_ptr= errmsg;\n#endif\n\n gearmand_log_fatal(position, function, \"%s(%s)\", message, errmsg_ptr);\n }\n}\n\ngearmand_error_t gearmand_log_error(const char *position, const char *function, const char *format, ...)\n{\n va_list args;\n\n if (not Gearmand() or Gearmand()->verbose >= GEARMAND_VERBOSE_ERROR)\n {\n va_start(args, format);\n gearmand_log(position, function, GEARMAND_VERBOSE_ERROR, GEARMAN_SUCCESS, format, args);\n va_end(args);\n }\n\n return GEARMAN_UNKNOWN_OPTION;\n}\n\nvoid gearmand_log_warning(const char *position, const char *function, const char *format, ...)\n{\n va_list args;\n\n if (not Gearmand() || Gearmand()->verbose >= GEARMAND_VERBOSE_WARN)\n {\n va_start(args, format);\n gearmand_log(position, function, GEARMAND_VERBOSE_WARN, GEARMAN_SUCCESS, format, args);\n va_end(args);\n }\n}\n\n\/\/ LOG_NOTICE is only used for reporting job status.\nvoid gearmand_log_notice(const char *position, const char *function, const char *format, ...)\n{\n va_list args;\n\n if (not Gearmand() || Gearmand()->verbose >= GEARMAND_VERBOSE_NOTICE)\n {\n va_start(args, format);\n gearmand_log(position, function, GEARMAND_VERBOSE_NOTICE, GEARMAN_SUCCESS, format, args);\n va_end(args);\n }\n}\n\nvoid gearmand_log_info(const char *position, const char *function, const char *format, ...)\n{\n va_list args;\n\n if (not Gearmand() || Gearmand()->verbose >= GEARMAND_VERBOSE_INFO)\n {\n va_start(args, format);\n gearmand_log(position, function, GEARMAND_VERBOSE_INFO, GEARMAN_SUCCESS, format, args);\n va_end(args);\n }\n}\n\nvoid gearmand_log_debug(const char *position, const char *function, const char *format, ...)\n{\n va_list args;\n\n if (not Gearmand() || Gearmand()->verbose >= GEARMAND_VERBOSE_DEBUG)\n {\n va_start(args, format);\n gearmand_log(position, function, GEARMAND_VERBOSE_DEBUG, GEARMAN_SUCCESS, format, args);\n va_end(args);\n }\n}\n\ngearmand_error_t gearmand_log_perror(const char *position, const char *function, const char *message)\n{\n if (not Gearmand() or (Gearmand()->verbose >= GEARMAND_VERBOSE_ERROR))\n {\n const char *errmsg_ptr;\n char errmsg[GEARMAN_MAX_ERROR_SIZE]; \n errmsg[0]= 0; \n\n#ifdef STRERROR_R_CHAR_P\n errmsg_ptr= strerror_r(errno, errmsg, sizeof(errmsg));\n#else\n strerror_r(errno, errmsg, sizeof(errmsg));\n errmsg_ptr= errmsg;\n#endif\n gearmand_log_error(position, function, \"%s(%s)\", message, errmsg_ptr);\n }\n\n return GEARMAN_ERRNO;\n}\n\ngearmand_error_t gearmand_log_gerror(const char *position, const char *function, const gearmand_error_t rc, const char *format, ...)\n{\n if (gearmand_failed(rc) and rc != GEARMAN_IO_WAIT)\n {\n va_list args;\n\n if (Gearmand() == NULL or Gearmand()->verbose >= GEARMAND_VERBOSE_ERROR)\n {\n va_start(args, format);\n gearmand_log(position, function, GEARMAND_VERBOSE_ERROR, rc, format, args);\n va_end(args);\n }\n }\n else if (rc == GEARMAN_IO_WAIT)\n { }\n\n return rc;\n}\n\ngearmand_error_t gearmand_log_gerror_warn(const char *position, const char *function, const gearmand_error_t rc, const char *format, ...)\n{\n if (gearmand_failed(rc) and rc != GEARMAN_IO_WAIT)\n {\n va_list args;\n\n if (Gearmand() == NULL or Gearmand()->verbose >= GEARMAND_VERBOSE_WARN)\n {\n va_start(args, format);\n gearmand_log(position, function, GEARMAND_VERBOSE_WARN, rc, format, args);\n va_end(args);\n }\n }\n else if (rc == GEARMAN_IO_WAIT)\n { }\n\n return rc;\n}\n\ngearmand_error_t gearmand_log_gai_error(const char *position, const char *function, const int rc, const char *message)\n{\n if (rc == EAI_SYSTEM)\n {\n return gearmand_log_perror(position, function, message);\n }\n\n gearmand_log_error(position, function, \"%s getaddrinfo(%s)\", message, gai_strerror(rc));\n\n return GEARMAN_GETADDRINFO;\n}\n\ngearmand_error_t gearmand_log_memory_error(const char *position, const char *function, const char *allocator, const char *object_type, size_t count, size_t size)\n{\n if (count > 1)\n {\n gearmand_log_error(position, function, \"%s(%s, count: %lu size: %lu)\", allocator, object_type, static_cast<unsigned long>(count), static_cast<unsigned long>(size));\n }\n else\n {\n gearmand_log_error(position, function, \"%s(%s, size: %lu)\", allocator, object_type, static_cast<unsigned long>(count), static_cast<unsigned long>(size));\n }\n\n return GEARMAN_MEMORY_ALLOCATION_FAILURE;\n}\n<|endoftext|>"} {"text":"<commit_before><commit_msg>In system level install case go back to copying files instead of moving them.<commit_after><|endoftext|>"} {"text":"<commit_before>#ifndef CLUSTERING_ADMINISTRATION_PARSER_MAKER_TCC_\n#define CLUSTERING_ADMINISTRATION_PARSER_MAKER_TCC_\n\n#include \"clustering\/administration\/parser_maker.hpp\"\n\ntemplate<class protocol_t, class parser_t>\nparser_maker_t<protocol_t, parser_t>::parser_maker_t(mailbox_manager_t *_mailbox_manager,\n boost::shared_ptr<semilattice_read_view_t<namespaces_semilattice_metadata_t<protocol_t> > > _namespaces_semilattice_metadata,\n#ifndef NDEBUG\n boost::shared_ptr<semilattice_read_view_t<machine_semilattice_metadata_t> > _machine_semilattice_metadata,\n#endif\n namespace_repo_t<protocol_t> *_repo,\n perfmon_collection_repo_t *_perfmon_collection_repo)\n : mailbox_manager(_mailbox_manager),\n namespaces_semilattice_metadata(_namespaces_semilattice_metadata),\n#ifndef NDEBUG\n machine_semilattice_metadata(_machine_semilattice_metadata),\n#endif\n repo(_repo),\n namespaces_subscription(boost::bind(&parser_maker_t::on_change, this), namespaces_semilattice_metadata),\n#ifndef NDEBUG\n machine_subscription(boost::bind(&parser_maker_t::on_change, this), machine_semilattice_metadata),\n#endif\n perfmon_collection_repo(_perfmon_collection_repo)\n{\n on_change();\n}\n\ntemplate<class protocol_t>\nint get_port(const namespace_semilattice_metadata_t<protocol_t> &ns\n#ifndef NDEBUG\n , const machine_semilattice_metadata_t &us\n#endif\n ) {\n#ifndef NDEBUG\n if (ns.port.get() == 0)\n return 0;\n\n return ns.port.get() + us.port_offset.get();\n#else\n return ns.port.get();\n#endif\n}\n\ntemplate<class protocol_t, class parser_t>\nvoid parser_maker_t<protocol_t, parser_t>::on_change() {\n ASSERT_NO_CORO_WAITING;\n\n namespaces_semilattice_metadata_t<protocol_t> snapshot = namespaces_semilattice_metadata->get();\n#ifndef NDEBUG\n machine_semilattice_metadata_t machine_metadata_snapshot = machine_semilattice_metadata->get();\n#endif\n\n for (typename namespaces_semilattice_metadata_t<protocol_t>::namespace_map_t::iterator it = snapshot.namespaces.begin();\n it != snapshot.namespaces.end();\n it++) {\n typename boost::ptr_map<namespace_id_t, ns_record_t>::iterator h_it = namespaces_being_handled.find(it->first);\n\n \/* Destroy parsers as necessary, by pulsing the `stopper` cond on the\n `ns_record_t` so that the `serve_queries()` coroutine will stop *\/\n if (h_it != namespaces_being_handled.end() && (\n it->second.is_deleted() ||\n it->second.get().port.in_conflict() ||\n h_it->second->port != get_port(it->second.get()\n#ifndef NDEBUG\n , machine_metadata_snapshot\n#endif\n ))) {\n if (!h_it->second->stopper.is_pulsed()) {\n h_it->second->stopper.pulse();\n }\n }\n\n \/* Create parsers as necessary by spawning instances of\n `serve_queries()` *\/\n if (h_it == namespaces_being_handled.end() && !it->second.is_deleted() && !it->second.get().port.in_conflict()) {\n vclock_t<std::string> v_ns_name = it->second.get().name;\n std::string ns_name(v_ns_name.in_conflict() ? \"<in conflict>\" : v_ns_name.get());\n\n int port = get_port(it->second.get()\n#ifndef NDEBUG\n , machine_metadata_snapshot\n#endif\n );\n namespace_id_t tmp = it->first;\n namespaces_being_handled.insert(tmp, new ns_record_t(port));\n coro_t::spawn_sometime(boost::bind(\n &parser_maker_t::serve_queries, this,\n ns_name, it->first, port, auto_drainer_t::lock_t(&drainer)\n ));\n }\n }\n}\n\ntemplate<class protocol_t, class parser_t>\nvoid parser_maker_t<protocol_t, parser_t>::serve_queries(std::string ns_name, namespace_id_t ns, int port, auto_drainer_t::lock_t keepalive) {\n try {\n printf(\"Starting to serve queries for the namespace '%s' %s on port %d...\\n\", ns_name.c_str(), uuid_to_str(ns).c_str(), port);\n wait_any_t interruptor(&namespaces_being_handled.find(ns)->second->stopper, keepalive.get_drain_signal());\n typename namespace_repo_t<protocol_t>::access_t access(repo, ns, &interruptor);\n parser_t parser(port, access.get_namespace_if(), perfmon_collection_repo->get_perfmon_collection_for_namespace(ns));\n interruptor.wait_lazily_unordered();\n } catch (interrupted_exc_t) {\n \/* pass *\/\n }\n\n namespaces_being_handled.erase(ns);\n\n if (!keepalive.get_drain_signal()->is_pulsed()) {\n \/* If we were stopped due to a port change, make sure that a new\n instance of `serve_queries()` gets started with the correct port *\/\n on_change();\n }\n}\n\n#endif \/* CLUSTERING_ADMINISTRATION_PARSER_MAKER_TCC_ *\/\n<commit_msg>Print a message when stopping to serve the queries for a namespace<commit_after>#ifndef CLUSTERING_ADMINISTRATION_PARSER_MAKER_TCC_\n#define CLUSTERING_ADMINISTRATION_PARSER_MAKER_TCC_\n\n#include \"clustering\/administration\/parser_maker.hpp\"\n\ntemplate<class protocol_t, class parser_t>\nparser_maker_t<protocol_t, parser_t>::parser_maker_t(mailbox_manager_t *_mailbox_manager,\n boost::shared_ptr<semilattice_read_view_t<namespaces_semilattice_metadata_t<protocol_t> > > _namespaces_semilattice_metadata,\n#ifndef NDEBUG\n boost::shared_ptr<semilattice_read_view_t<machine_semilattice_metadata_t> > _machine_semilattice_metadata,\n#endif\n namespace_repo_t<protocol_t> *_repo,\n perfmon_collection_repo_t *_perfmon_collection_repo)\n : mailbox_manager(_mailbox_manager),\n namespaces_semilattice_metadata(_namespaces_semilattice_metadata),\n#ifndef NDEBUG\n machine_semilattice_metadata(_machine_semilattice_metadata),\n#endif\n repo(_repo),\n namespaces_subscription(boost::bind(&parser_maker_t::on_change, this), namespaces_semilattice_metadata),\n#ifndef NDEBUG\n machine_subscription(boost::bind(&parser_maker_t::on_change, this), machine_semilattice_metadata),\n#endif\n perfmon_collection_repo(_perfmon_collection_repo)\n{\n on_change();\n}\n\ntemplate<class protocol_t>\nint get_port(const namespace_semilattice_metadata_t<protocol_t> &ns\n DEBUG_ONLY(, const machine_semilattice_metadata_t &us)\n ) {\n#ifndef NDEBUG\n if (ns.port.get() == 0)\n return 0;\n\n return ns.port.get() + us.port_offset.get();\n#else\n return ns.port.get();\n#endif\n}\n\nstatic const char * ns_name_in_conflict = \"<in conflict>\";\n\ntemplate<class protocol_t, class parser_t>\nvoid parser_maker_t<protocol_t, parser_t>::on_change() {\n ASSERT_NO_CORO_WAITING;\n\n namespaces_semilattice_metadata_t<protocol_t> snapshot = namespaces_semilattice_metadata->get();\n#ifndef NDEBUG\n machine_semilattice_metadata_t machine_metadata_snapshot = machine_semilattice_metadata->get();\n#endif\n\n for (typename namespaces_semilattice_metadata_t<protocol_t>::namespace_map_t::iterator it = snapshot.namespaces.begin();\n it != snapshot.namespaces.end();\n it++) {\n typename boost::ptr_map<namespace_id_t, ns_record_t>::iterator handled_ns = namespaces_being_handled.find(it->first);\n\n \/* Destroy parsers as necessary, by pulsing the `stopper` cond on the\n `ns_record_t` so that the `serve_queries()` coroutine will stop *\/\n if (handled_ns != namespaces_being_handled.end() && (\n it->second.is_deleted() ||\n it->second.get().port.in_conflict() ||\n handled_ns->second->port != get_port(it->second.get()\n DEBUG_ONLY(, machine_metadata_snapshot)\n )\n )) {\n\n vclock_t<std::string> v_ns_name = it->second.get().name;\n std::string ns_name(v_ns_name.in_conflict() ? ns_name_in_conflict : v_ns_name.get());\n\n printf(\"Stopping serving queries for the namespace '%s' %s on port %d...\\n\", ns_name.c_str(), uuid_to_str(it->first).c_str(), handled_ns->second->port);\n\n if (!handled_ns->second->stopper.is_pulsed()) {\n handled_ns->second->stopper.pulse();\n }\n }\n\n \/* Create parsers as necessary by spawning instances of\n `serve_queries()` *\/\n if (handled_ns == namespaces_being_handled.end() && !it->second.is_deleted() && !it->second.get().port.in_conflict()) {\n vclock_t<std::string> v_ns_name = it->second.get().name;\n std::string ns_name(v_ns_name.in_conflict() ? ns_name_in_conflict : v_ns_name.get());\n\n int port = get_port(it->second.get()\n DEBUG_ONLY(, machine_metadata_snapshot)\n );\n namespace_id_t tmp = it->first;\n namespaces_being_handled.insert(tmp, new ns_record_t(port));\n coro_t::spawn_sometime(boost::bind(\n &parser_maker_t::serve_queries, this,\n ns_name, it->first, port, auto_drainer_t::lock_t(&drainer)\n ));\n }\n }\n}\n\ntemplate<class protocol_t, class parser_t>\nvoid parser_maker_t<protocol_t, parser_t>::serve_queries(std::string ns_name, namespace_id_t ns, int port, auto_drainer_t::lock_t keepalive) {\n try {\n printf(\"Starting to serve queries for the namespace '%s' %s on port %d...\\n\", ns_name.c_str(), uuid_to_str(ns).c_str(), port);\n wait_any_t interruptor(&namespaces_being_handled.find(ns)->second->stopper, keepalive.get_drain_signal());\n typename namespace_repo_t<protocol_t>::access_t access(repo, ns, &interruptor);\n parser_t parser(port, access.get_namespace_if(), perfmon_collection_repo->get_perfmon_collection_for_namespace(ns));\n interruptor.wait_lazily_unordered();\n } catch (interrupted_exc_t) {\n \/* pass *\/\n }\n\n namespaces_being_handled.erase(ns);\n\n if (!keepalive.get_drain_signal()->is_pulsed()) {\n \/* If we were stopped due to a port change, make sure that a new\n instance of `serve_queries()` gets started with the correct port *\/\n on_change();\n }\n}\n\n#endif \/* CLUSTERING_ADMINISTRATION_PARSER_MAKER_TCC_ *\/\n<|endoftext|>"} {"text":"<commit_before>#include <cstdio>\n#include <fstream>\n#include <unistd.h>\n\n#include <kms++\/kms++.h>\n#include <kms++util\/kms++util.h>\n\nusing namespace std;\nusing namespace kms;\n\nstatic void read_frame(ifstream& is, DumbFramebuffer* fb, Crtc* crtc, Plane* plane)\n{\n\tfor (unsigned i = 0; i < fb->num_planes(); ++i)\n\t\tis.read((char*)fb->map(i), fb->size(i));\n\n\tunsigned w = min(crtc->width(), fb->width());\n\tunsigned h = min(crtc->height(), fb->height());\n\n\tint r = crtc->set_plane(plane, *fb,\n\t\t\t\t0, 0, w, h,\n\t\t\t\t0, 0, fb->width(), fb->height());\n\n\tASSERT(r == 0);\n}\n\nstatic const char* usage_str =\n\t\t\"Usage: kmsview [-t <ms>] <file> <width> <height> <fourcc>\\n\\n\"\n\t\t\"Options:\\n\"\n\t\t\" -t, --time Milliseconds to sleep between frames\\n\"\n\t\t;\n\nstatic void usage()\n{\n\tputs(usage_str);\n}\n\nint main(int argc, char** argv)\n{\n\tuint32_t time = 0;\n\tstring dev_path = \"\/dev\/dri\/card0\";\n\n\tOptionSet optionset = {\n\t\tOption(\"|device=\", [&dev_path](string s)\n\t\t{\n\t\t\tdev_path = s;\n\t\t}),\n\t\tOption(\"t|time=\", [&time](const string& str)\n\t\t{\n\t\t\ttime = stoul(str);\n\t\t}),\n\t\tOption(\"h|help\", []()\n\t\t{\n\t\t\tusage();\n\t\t\texit(-1);\n\t\t}),\n\t};\n\n\toptionset.parse(argc, argv);\n\n\tvector<string> params = optionset.params();\n\n\tif (params.size() != 4) {\n\t\tusage();\n\t\texit(-1);\n\t}\n\n\tstring filename = params[0];\n\tuint32_t w = stoi(params[1]);\n\tuint32_t h = stoi(params[2]);\n\tstring modestr = params[3];\n\n\tauto pixfmt = FourCCToPixelFormat(modestr);\n\n\tifstream is(filename, ifstream::binary);\n\n\tis.seekg(0, std::ios::end);\n\tunsigned fsize = is.tellg();\n\tis.seekg(0);\n\n\n\tCard card(dev_path);\n\n\tauto conn = card.get_first_connected_connector();\n\tauto crtc = conn->get_current_crtc();\n\n\tauto fb = new DumbFramebuffer(card, w, h, pixfmt);\n\n\tPlane* plane = 0;\n\n\tfor (Plane* p : crtc->get_possible_planes()) {\n\t\tif (p->plane_type() != PlaneType::Overlay)\n\t\t\tcontinue;\n\n\t\tif (!p->supports_format(pixfmt))\n\t\t\tcontinue;\n\n\t\tplane = p;\n\t\tbreak;\n\t}\n\n\tFAIL_IF(!plane, \"available plane not found\");\n\n\n\tunsigned frame_size = 0;\n\tfor (unsigned i = 0; i < fb->num_planes(); ++i)\n\t\tframe_size += fb->size(i);\n\n\tunsigned num_frames = fsize \/ frame_size;\n\tprintf(\"file size %u, frame size %u, frames %u\\n\", fsize, frame_size, num_frames);\n\n\tfor (unsigned i = 0; i < num_frames; ++i) {\n\t\tprintf(\"frame %d\", i); fflush(stdout);\n\t\tread_frame(is, fb, crtc, plane);\n\t\tif (!time) {\n\t\t\tgetchar();\n\t\t} else {\n\t\t\tusleep(time * 1000);\n\t\t\tprintf(\"\\n\");\n\t\t}\n\t}\n\n\tis.close();\n\n\tif (time) {\n\t\tprintf(\"press enter to exit\\n\");\n\t\tgetchar();\n\t}\n\n\tdelete fb;\n}\n<commit_msg>kmsview: use resman<commit_after>#include <cstdio>\n#include <fstream>\n#include <unistd.h>\n\n#include <kms++\/kms++.h>\n#include <kms++util\/kms++util.h>\n\nusing namespace std;\nusing namespace kms;\n\nstatic void read_frame(ifstream& is, DumbFramebuffer* fb, Crtc* crtc, Plane* plane)\n{\n\tfor (unsigned i = 0; i < fb->num_planes(); ++i)\n\t\tis.read((char*)fb->map(i), fb->size(i));\n\n\tunsigned w = min(crtc->width(), fb->width());\n\tunsigned h = min(crtc->height(), fb->height());\n\n\tint r = crtc->set_plane(plane, *fb,\n\t\t\t\t0, 0, w, h,\n\t\t\t\t0, 0, fb->width(), fb->height());\n\n\tASSERT(r == 0);\n}\n\nstatic const char* usage_str =\n\t\t\"Usage: kmsview [-t <ms>] <file> <width> <height> <fourcc>\\n\\n\"\n\t\t\"Options:\\n\"\n\t\t\" -t, --time Milliseconds to sleep between frames\\n\"\n\t\t;\n\nstatic void usage()\n{\n\tputs(usage_str);\n}\n\nint main(int argc, char** argv)\n{\n\tuint32_t time = 0;\n\tstring dev_path = \"\/dev\/dri\/card0\";\n\n\tOptionSet optionset = {\n\t\tOption(\"|device=\", [&dev_path](string s)\n\t\t{\n\t\t\tdev_path = s;\n\t\t}),\n\t\tOption(\"t|time=\", [&time](const string& str)\n\t\t{\n\t\t\ttime = stoul(str);\n\t\t}),\n\t\tOption(\"h|help\", []()\n\t\t{\n\t\t\tusage();\n\t\t\texit(-1);\n\t\t}),\n\t};\n\n\toptionset.parse(argc, argv);\n\n\tvector<string> params = optionset.params();\n\n\tif (params.size() != 4) {\n\t\tusage();\n\t\texit(-1);\n\t}\n\n\tstring filename = params[0];\n\tuint32_t w = stoi(params[1]);\n\tuint32_t h = stoi(params[2]);\n\tstring modestr = params[3];\n\n\tauto pixfmt = FourCCToPixelFormat(modestr);\n\n\tifstream is(filename, ifstream::binary);\n\n\tis.seekg(0, std::ios::end);\n\tunsigned fsize = is.tellg();\n\tis.seekg(0);\n\n\n\tCard card(dev_path);\n\tResourceManager res(card);\n\n\tauto conn = res.reserve_connector();\n\tauto crtc = res.reserve_crtc(conn);\n\tauto plane = res.reserve_overlay_plane(crtc, pixfmt);\n\tFAIL_IF(!plane, \"available plane not found\");\n\n\tauto fb = new DumbFramebuffer(card, w, h, pixfmt);\n\n\tunsigned frame_size = 0;\n\tfor (unsigned i = 0; i < fb->num_planes(); ++i)\n\t\tframe_size += fb->size(i);\n\n\tunsigned num_frames = fsize \/ frame_size;\n\tprintf(\"file size %u, frame size %u, frames %u\\n\", fsize, frame_size, num_frames);\n\n\tfor (unsigned i = 0; i < num_frames; ++i) {\n\t\tprintf(\"frame %d\", i); fflush(stdout);\n\t\tread_frame(is, fb, crtc, plane);\n\t\tif (!time) {\n\t\t\tgetchar();\n\t\t} else {\n\t\t\tusleep(time * 1000);\n\t\t\tprintf(\"\\n\");\n\t\t}\n\t}\n\n\tis.close();\n\n\tif (time) {\n\t\tprintf(\"press enter to exit\\n\");\n\t\tgetchar();\n\t}\n\n\tdelete fb;\n}\n<|endoftext|>"} {"text":"<commit_before>\/\/===- PrettyStackTrace.cpp - Pretty Crash Handling -----------------------===\/\/\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 some helpful functions for dealing with the possibility of\n\/\/ Unix signals occurring while your program is running.\n\/\/\n\/\/===----------------------------------------------------------------------===\/\/\n\n#include \"llvm\/Support\/PrettyStackTrace.h\"\n#include \"llvm-c\/Core.h\"\n#include \"llvm\/ADT\/SmallString.h\"\n#include \"llvm\/Config\/config.h\" \/\/ Get autoconf configuration settings\n#include \"llvm\/Support\/Signals.h\"\n#include \"llvm\/Support\/Watchdog.h\"\n#include \"llvm\/Support\/raw_ostream.h\"\n\n#ifdef HAVE_CRASHREPORTERCLIENT_H\n#include <CrashReporterClient.h>\n#endif\n\nusing namespace llvm;\n\n\/\/ We need a thread local pointer to manage the stack of our stack trace\n\/\/ objects, but we *really* cannot tolerate destructors running and do not want\n\/\/ to pay any overhead of synchronizing. As a consequence, we use a raw\n\/\/ thread-local variable. Some day, we should be able to use a limited subset\n\/\/ of C++11's thread_local, but compilers aren't up for it today.\n\/\/ FIXME: This should be moved to a Compiler.h abstraction.\n#ifdef _MSC_VER \/\/ MSVC supports this with a __declspec.\nstatic __declspec(thread) const PrettyStackTraceEntry\n *PrettyStackTraceHead = nullptr;\n#else \/\/ Clang, GCC, and all compatible compilers tend to use __thread.\nstatic __thread const PrettyStackTraceEntry *PrettyStackTraceHead = nullptr;\n#endif\n\nstatic unsigned PrintStack(const PrettyStackTraceEntry *Entry, raw_ostream &OS){\n unsigned NextID = 0;\n if (Entry->getNextEntry())\n NextID = PrintStack(Entry->getNextEntry(), OS);\n OS << NextID << \".\\t\";\n {\n sys::Watchdog W(5);\n Entry->print(OS);\n }\n \n return NextID+1;\n}\n\n\/\/\/ PrintCurStackTrace - Print the current stack trace to the specified stream.\nstatic void PrintCurStackTrace(raw_ostream &OS) {\n \/\/ Don't print an empty trace.\n if (!PrettyStackTraceHead) return;\n \n \/\/ If there are pretty stack frames registered, walk and emit them.\n OS << \"Stack dump:\\n\";\n \n PrintStack(PrettyStackTraceHead, OS);\n OS.flush();\n}\n\n\/\/ Integrate with crash reporter libraries.\n#if defined (__APPLE__) && HAVE_CRASHREPORTERCLIENT_H\n\/\/ If any clients of llvm try to link to libCrashReporterClient.a themselves,\n\/\/ only one crash info struct will be used.\nextern \"C\" {\nCRASH_REPORTER_CLIENT_HIDDEN \nstruct crashreporter_annotations_t gCRAnnotations \n __attribute__((section(\"__DATA,\" CRASHREPORTER_ANNOTATIONS_SECTION))) \n = { CRASHREPORTER_ANNOTATIONS_VERSION, 0, 0, 0, 0, 0, 0 };\n}\n#elif defined (__APPLE__) && HAVE_CRASHREPORTER_INFO\nstatic const char *__crashreporter_info__ = 0;\nasm(\".desc ___crashreporter_info__, 0x10\");\n#endif\n\n\n\/\/\/ CrashHandler - This callback is run if a fatal signal is delivered to the\n\/\/\/ process, it prints the pretty stack trace.\nstatic void CrashHandler(void *) {\n#ifndef __APPLE__\n \/\/ On non-apple systems, just emit the crash stack trace to stderr.\n PrintCurStackTrace(errs());\n#else\n \/\/ Otherwise, emit to a smallvector of chars, send *that* to stderr, but also\n \/\/ put it into __crashreporter_info__.\n SmallString<2048> TmpStr;\n {\n raw_svector_ostream Stream(TmpStr);\n PrintCurStackTrace(Stream);\n }\n \n if (!TmpStr.empty()) {\n#ifdef HAVE_CRASHREPORTERCLIENT_H\n \/\/ Cast to void to avoid warning.\n (void)CRSetCrashLogMessage(std::string(TmpStr.str()).c_str());\n#elif HAVE_CRASHREPORTER_INFO \n __crashreporter_info__ = strdup(std::string(TmpStr.str()).c_str());\n#endif\n errs() << TmpStr.str();\n }\n \n#endif\n}\n\nPrettyStackTraceEntry::PrettyStackTraceEntry() {\n \/\/ Link ourselves.\n NextEntry = PrettyStackTraceHead;\n PrettyStackTraceHead = this;\n}\n\nPrettyStackTraceEntry::~PrettyStackTraceEntry() {\n assert(PrettyStackTraceHead == this &&\n \"Pretty stack trace entry destruction is out of order\");\n PrettyStackTraceHead = getNextEntry();\n}\n\nvoid PrettyStackTraceString::print(raw_ostream &OS) const {\n OS << Str << \"\\n\";\n}\n\nvoid PrettyStackTraceProgram::print(raw_ostream &OS) const {\n OS << \"Program arguments: \";\n \/\/ Print the argument list.\n for (unsigned i = 0, e = ArgC; i != e; ++i)\n OS << ArgV[i] << ' ';\n OS << '\\n';\n}\n\nstatic bool RegisterCrashPrinter() {\n sys::AddSignalHandler(CrashHandler, nullptr);\n return false;\n}\n\nvoid llvm::EnablePrettyStackTrace() {\n \/\/ The first time this is called, we register the crash printer.\n static bool HandlerRegistered = RegisterCrashPrinter();\n (void)HandlerRegistered;\n}\n\nvoid LLVMEnablePrettyStackTrace() {\n EnablePrettyStackTrace();\n}\n<commit_msg>[LPM] Try to work around a bug with local-dynamic TLS on PowerPC 64.<commit_after>\/\/===- PrettyStackTrace.cpp - Pretty Crash Handling -----------------------===\/\/\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 some helpful functions for dealing with the possibility of\n\/\/ Unix signals occurring while your program is running.\n\/\/\n\/\/===----------------------------------------------------------------------===\/\/\n\n#include \"llvm\/Support\/PrettyStackTrace.h\"\n#include \"llvm-c\/Core.h\"\n#include \"llvm\/ADT\/SmallString.h\"\n#include \"llvm\/Config\/config.h\" \/\/ Get autoconf configuration settings\n#include \"llvm\/Support\/Signals.h\"\n#include \"llvm\/Support\/Watchdog.h\"\n#include \"llvm\/Support\/raw_ostream.h\"\n\n#ifdef HAVE_CRASHREPORTERCLIENT_H\n#include <CrashReporterClient.h>\n#endif\n\nusing namespace llvm;\n\n\/\/ We need a thread local pointer to manage the stack of our stack trace\n\/\/ objects, but we *really* cannot tolerate destructors running and do not want\n\/\/ to pay any overhead of synchronizing. As a consequence, we use a raw\n\/\/ thread-local variable. Some day, we should be able to use a limited subset\n\/\/ of C++11's thread_local, but compilers aren't up for it today.\n\/\/ FIXME: This should be moved to a Compiler.h abstraction.\n#ifdef _MSC_VER\n\/\/ MSVC supports this with a __declspec.\n#define LLVM_THREAD_LOCAL __declspec(thread)\n#else\n\/\/ Clang, GCC, and all compatible compilers tend to use __thread. But we need\n\/\/ to work aronud a bug in the combination of Clang's compilation of\n\/\/ local-dynamic TLS and the ppc64 linker relocations which we do by forcing to\n\/\/ general-dynamic.\n\/\/ FIXME: Make this conditional on the Clang version once this is fixed in\n\/\/ top-of-tree.\n#if defined(__clang__) && defined(__powerpc64__)\n#define LLVM_THREAD_LOCAL __thread __attribute__((tls_model(\"general-dynamic\")))\n#else\n#define LLVM_THREAD_LOCAL __thread\n#endif\n#endif\n\nstatic LLVM_THREAD_LOCAL const PrettyStackTraceEntry *PrettyStackTraceHead =\n nullptr;\n\nstatic unsigned PrintStack(const PrettyStackTraceEntry *Entry, raw_ostream &OS){\n unsigned NextID = 0;\n if (Entry->getNextEntry())\n NextID = PrintStack(Entry->getNextEntry(), OS);\n OS << NextID << \".\\t\";\n {\n sys::Watchdog W(5);\n Entry->print(OS);\n }\n \n return NextID+1;\n}\n\n\/\/\/ PrintCurStackTrace - Print the current stack trace to the specified stream.\nstatic void PrintCurStackTrace(raw_ostream &OS) {\n \/\/ Don't print an empty trace.\n if (!PrettyStackTraceHead) return;\n \n \/\/ If there are pretty stack frames registered, walk and emit them.\n OS << \"Stack dump:\\n\";\n \n PrintStack(PrettyStackTraceHead, OS);\n OS.flush();\n}\n\n\/\/ Integrate with crash reporter libraries.\n#if defined (__APPLE__) && HAVE_CRASHREPORTERCLIENT_H\n\/\/ If any clients of llvm try to link to libCrashReporterClient.a themselves,\n\/\/ only one crash info struct will be used.\nextern \"C\" {\nCRASH_REPORTER_CLIENT_HIDDEN \nstruct crashreporter_annotations_t gCRAnnotations \n __attribute__((section(\"__DATA,\" CRASHREPORTER_ANNOTATIONS_SECTION))) \n = { CRASHREPORTER_ANNOTATIONS_VERSION, 0, 0, 0, 0, 0, 0 };\n}\n#elif defined (__APPLE__) && HAVE_CRASHREPORTER_INFO\nstatic const char *__crashreporter_info__ = 0;\nasm(\".desc ___crashreporter_info__, 0x10\");\n#endif\n\n\n\/\/\/ CrashHandler - This callback is run if a fatal signal is delivered to the\n\/\/\/ process, it prints the pretty stack trace.\nstatic void CrashHandler(void *) {\n#ifndef __APPLE__\n \/\/ On non-apple systems, just emit the crash stack trace to stderr.\n PrintCurStackTrace(errs());\n#else\n \/\/ Otherwise, emit to a smallvector of chars, send *that* to stderr, but also\n \/\/ put it into __crashreporter_info__.\n SmallString<2048> TmpStr;\n {\n raw_svector_ostream Stream(TmpStr);\n PrintCurStackTrace(Stream);\n }\n \n if (!TmpStr.empty()) {\n#ifdef HAVE_CRASHREPORTERCLIENT_H\n \/\/ Cast to void to avoid warning.\n (void)CRSetCrashLogMessage(std::string(TmpStr.str()).c_str());\n#elif HAVE_CRASHREPORTER_INFO \n __crashreporter_info__ = strdup(std::string(TmpStr.str()).c_str());\n#endif\n errs() << TmpStr.str();\n }\n \n#endif\n}\n\nPrettyStackTraceEntry::PrettyStackTraceEntry() {\n \/\/ Link ourselves.\n NextEntry = PrettyStackTraceHead;\n PrettyStackTraceHead = this;\n}\n\nPrettyStackTraceEntry::~PrettyStackTraceEntry() {\n assert(PrettyStackTraceHead == this &&\n \"Pretty stack trace entry destruction is out of order\");\n PrettyStackTraceHead = getNextEntry();\n}\n\nvoid PrettyStackTraceString::print(raw_ostream &OS) const {\n OS << Str << \"\\n\";\n}\n\nvoid PrettyStackTraceProgram::print(raw_ostream &OS) const {\n OS << \"Program arguments: \";\n \/\/ Print the argument list.\n for (unsigned i = 0, e = ArgC; i != e; ++i)\n OS << ArgV[i] << ' ';\n OS << '\\n';\n}\n\nstatic bool RegisterCrashPrinter() {\n sys::AddSignalHandler(CrashHandler, nullptr);\n return false;\n}\n\nvoid llvm::EnablePrettyStackTrace() {\n \/\/ The first time this is called, we register the crash printer.\n static bool HandlerRegistered = RegisterCrashPrinter();\n (void)HandlerRegistered;\n}\n\nvoid LLVMEnablePrettyStackTrace() {\n EnablePrettyStackTrace();\n}\n<|endoftext|>"} {"text":"<commit_before>\/\/===---- X86FixupSetCC.cpp - optimize usage of LEA instructions ----------===\/\/\n\/\/\n\/\/ Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.\n\/\/ See https:\/\/llvm.org\/LICENSE.txt for license information.\n\/\/ SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception\n\/\/\n\/\/===----------------------------------------------------------------------===\/\/\n\/\/\n\/\/ This file defines a pass that fixes zero-extension of setcc patterns.\n\/\/ X86 setcc instructions are modeled to have no input arguments, and a single\n\/\/ GR8 output argument. This is consistent with other similar instructions\n\/\/ (e.g. movb), but means it is impossible to directly generate a setcc into\n\/\/ the lower GR8 of a specified GR32.\n\/\/ This means that ISel must select (zext (setcc)) into something like\n\/\/ seta %al; movzbl %al, %eax.\n\/\/ Unfortunately, this can cause a stall due to the partial register write\n\/\/ performed by the setcc. Instead, we can use:\n\/\/ xor %eax, %eax; seta %al\n\/\/ This both avoids the stall, and encodes shorter.\n\/\/===----------------------------------------------------------------------===\/\/\n\n#include \"X86.h\"\n#include \"X86InstrInfo.h\"\n#include \"X86Subtarget.h\"\n#include \"llvm\/ADT\/Statistic.h\"\n#include \"llvm\/CodeGen\/MachineFunctionPass.h\"\n#include \"llvm\/CodeGen\/MachineInstrBuilder.h\"\n#include \"llvm\/CodeGen\/MachineRegisterInfo.h\"\n\nusing namespace llvm;\n\n#define DEBUG_TYPE \"x86-fixup-setcc\"\n\nSTATISTIC(NumSubstZexts, \"Number of setcc + zext pairs substituted\");\n\nnamespace {\nclass X86FixupSetCCPass : public MachineFunctionPass {\npublic:\n X86FixupSetCCPass() : MachineFunctionPass(ID) {}\n\n StringRef getPassName() const override { return \"X86 Fixup SetCC\"; }\n\n bool runOnMachineFunction(MachineFunction &MF) override;\n\nprivate:\n \/\/ Find the preceding instruction that imp-defs eflags.\n MachineInstr *findFlagsImpDef(MachineBasicBlock *MBB,\n MachineBasicBlock::reverse_iterator MI);\n\n \/\/ Return true if MI imp-uses eflags.\n bool impUsesFlags(MachineInstr *MI);\n\n \/\/ Return true if this is the opcode of a SetCC instruction with a register\n \/\/ output.\n bool isSetCCr(unsigned Opode);\n\n MachineRegisterInfo *MRI;\n const X86InstrInfo *TII;\n\n enum { SearchBound = 16 };\n\n static char ID;\n};\n\nchar X86FixupSetCCPass::ID = 0;\n}\n\nFunctionPass *llvm::createX86FixupSetCC() { return new X86FixupSetCCPass(); }\n\nbool X86FixupSetCCPass::isSetCCr(unsigned Opcode) {\n switch (Opcode) {\n default:\n return false;\n case X86::SETOr:\n case X86::SETNOr:\n case X86::SETBr:\n case X86::SETAEr:\n case X86::SETEr:\n case X86::SETNEr:\n case X86::SETBEr:\n case X86::SETAr:\n case X86::SETSr:\n case X86::SETNSr:\n case X86::SETPr:\n case X86::SETNPr:\n case X86::SETLr:\n case X86::SETGEr:\n case X86::SETLEr:\n case X86::SETGr:\n return true;\n }\n}\n\n\/\/ We expect the instruction *immediately* before the setcc to imp-def\n\/\/ EFLAGS (because of scheduling glue). To make this less brittle w.r.t\n\/\/ scheduling, look backwards until we hit the beginning of the\n\/\/ basic-block, or a small bound (to avoid quadratic behavior).\nMachineInstr *\nX86FixupSetCCPass::findFlagsImpDef(MachineBasicBlock *MBB,\n MachineBasicBlock::reverse_iterator MI) {\n \/\/ FIXME: Should this be instr_rend(), and MI be reverse_instr_iterator?\n auto MBBStart = MBB->rend();\n for (int i = 0; (i < SearchBound) && (MI != MBBStart); ++i, ++MI)\n for (auto &Op : MI->implicit_operands())\n if ((Op.getReg() == X86::EFLAGS) && (Op.isDef()))\n return &*MI;\n\n return nullptr;\n}\n\nbool X86FixupSetCCPass::impUsesFlags(MachineInstr *MI) {\n for (auto &Op : MI->implicit_operands())\n if ((Op.getReg() == X86::EFLAGS) && (Op.isUse()))\n return true;\n\n return false;\n}\n\nbool X86FixupSetCCPass::runOnMachineFunction(MachineFunction &MF) {\n bool Changed = false;\n MRI = &MF.getRegInfo();\n TII = MF.getSubtarget<X86Subtarget>().getInstrInfo();\n\n SmallVector<MachineInstr*, 4> ToErase;\n\n for (auto &MBB : MF) {\n for (auto &MI : MBB) {\n \/\/ Find a setcc that is used by a zext.\n \/\/ This doesn't have to be the only use, the transformation is safe\n \/\/ regardless.\n if (!isSetCCr(MI.getOpcode()))\n continue;\n\n MachineInstr *ZExt = nullptr;\n for (auto &Use : MRI->use_instructions(MI.getOperand(0).getReg()))\n if (Use.getOpcode() == X86::MOVZX32rr8)\n ZExt = &Use;\n\n if (!ZExt)\n continue;\n\n \/\/ Find the preceding instruction that imp-defs eflags.\n MachineInstr *FlagsDefMI = findFlagsImpDef(\n MI.getParent(), MachineBasicBlock::reverse_iterator(&MI));\n if (!FlagsDefMI)\n continue;\n\n \/\/ We'd like to put something that clobbers eflags directly before\n \/\/ FlagsDefMI. This can't hurt anything after FlagsDefMI, because\n \/\/ it, itself, by definition, clobbers eflags. But it may happen that\n \/\/ FlagsDefMI also *uses* eflags, in which case the transformation is\n \/\/ invalid.\n if (impUsesFlags(FlagsDefMI))\n continue;\n\n ++NumSubstZexts;\n Changed = true;\n\n \/\/ On 32-bit, we need to be careful to force an ABCD register.\n const TargetRegisterClass *RC = MF.getSubtarget<X86Subtarget>().is64Bit()\n ? &X86::GR32RegClass\n : &X86::GR32_ABCDRegClass;\n unsigned ZeroReg = MRI->createVirtualRegister(RC);\n unsigned InsertReg = MRI->createVirtualRegister(RC);\n\n \/\/ Initialize a register with 0. This must go before the eflags def\n BuildMI(MBB, FlagsDefMI, MI.getDebugLoc(), TII->get(X86::MOV32r0),\n ZeroReg);\n\n \/\/ X86 setcc only takes an output GR8, so fake a GR32 input by inserting\n \/\/ the setcc result into the low byte of the zeroed register.\n BuildMI(*ZExt->getParent(), ZExt, ZExt->getDebugLoc(),\n TII->get(X86::INSERT_SUBREG), InsertReg)\n .addReg(ZeroReg)\n .addReg(MI.getOperand(0).getReg())\n .addImm(X86::sub_8bit);\n MRI->replaceRegWith(ZExt->getOperand(0).getReg(), InsertReg);\n ToErase.push_back(ZExt);\n }\n }\n\n for (auto &I : ToErase)\n I->eraseFromParent();\n\n return Changed;\n}\n<commit_msg>[X86] Add missing isReg() guards in FixupSetCCs pass.<commit_after>\/\/===---- X86FixupSetCC.cpp - optimize usage of LEA instructions ----------===\/\/\n\/\/\n\/\/ Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.\n\/\/ See https:\/\/llvm.org\/LICENSE.txt for license information.\n\/\/ SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception\n\/\/\n\/\/===----------------------------------------------------------------------===\/\/\n\/\/\n\/\/ This file defines a pass that fixes zero-extension of setcc patterns.\n\/\/ X86 setcc instructions are modeled to have no input arguments, and a single\n\/\/ GR8 output argument. This is consistent with other similar instructions\n\/\/ (e.g. movb), but means it is impossible to directly generate a setcc into\n\/\/ the lower GR8 of a specified GR32.\n\/\/ This means that ISel must select (zext (setcc)) into something like\n\/\/ seta %al; movzbl %al, %eax.\n\/\/ Unfortunately, this can cause a stall due to the partial register write\n\/\/ performed by the setcc. Instead, we can use:\n\/\/ xor %eax, %eax; seta %al\n\/\/ This both avoids the stall, and encodes shorter.\n\/\/===----------------------------------------------------------------------===\/\/\n\n#include \"X86.h\"\n#include \"X86InstrInfo.h\"\n#include \"X86Subtarget.h\"\n#include \"llvm\/ADT\/Statistic.h\"\n#include \"llvm\/CodeGen\/MachineFunctionPass.h\"\n#include \"llvm\/CodeGen\/MachineInstrBuilder.h\"\n#include \"llvm\/CodeGen\/MachineRegisterInfo.h\"\n\nusing namespace llvm;\n\n#define DEBUG_TYPE \"x86-fixup-setcc\"\n\nSTATISTIC(NumSubstZexts, \"Number of setcc + zext pairs substituted\");\n\nnamespace {\nclass X86FixupSetCCPass : public MachineFunctionPass {\npublic:\n X86FixupSetCCPass() : MachineFunctionPass(ID) {}\n\n StringRef getPassName() const override { return \"X86 Fixup SetCC\"; }\n\n bool runOnMachineFunction(MachineFunction &MF) override;\n\nprivate:\n \/\/ Find the preceding instruction that imp-defs eflags.\n MachineInstr *findFlagsImpDef(MachineBasicBlock *MBB,\n MachineBasicBlock::reverse_iterator MI);\n\n \/\/ Return true if MI imp-uses eflags.\n bool impUsesFlags(MachineInstr *MI);\n\n \/\/ Return true if this is the opcode of a SetCC instruction with a register\n \/\/ output.\n bool isSetCCr(unsigned Opode);\n\n MachineRegisterInfo *MRI;\n const X86InstrInfo *TII;\n\n enum { SearchBound = 16 };\n\n static char ID;\n};\n\nchar X86FixupSetCCPass::ID = 0;\n}\n\nFunctionPass *llvm::createX86FixupSetCC() { return new X86FixupSetCCPass(); }\n\nbool X86FixupSetCCPass::isSetCCr(unsigned Opcode) {\n switch (Opcode) {\n default:\n return false;\n case X86::SETOr:\n case X86::SETNOr:\n case X86::SETBr:\n case X86::SETAEr:\n case X86::SETEr:\n case X86::SETNEr:\n case X86::SETBEr:\n case X86::SETAr:\n case X86::SETSr:\n case X86::SETNSr:\n case X86::SETPr:\n case X86::SETNPr:\n case X86::SETLr:\n case X86::SETGEr:\n case X86::SETLEr:\n case X86::SETGr:\n return true;\n }\n}\n\n\/\/ We expect the instruction *immediately* before the setcc to imp-def\n\/\/ EFLAGS (because of scheduling glue). To make this less brittle w.r.t\n\/\/ scheduling, look backwards until we hit the beginning of the\n\/\/ basic-block, or a small bound (to avoid quadratic behavior).\nMachineInstr *\nX86FixupSetCCPass::findFlagsImpDef(MachineBasicBlock *MBB,\n MachineBasicBlock::reverse_iterator MI) {\n \/\/ FIXME: Should this be instr_rend(), and MI be reverse_instr_iterator?\n auto MBBStart = MBB->rend();\n for (int i = 0; (i < SearchBound) && (MI != MBBStart); ++i, ++MI)\n for (auto &Op : MI->implicit_operands())\n if (Op.isReg() && (Op.getReg() == X86::EFLAGS) && Op.isDef())\n return &*MI;\n\n return nullptr;\n}\n\nbool X86FixupSetCCPass::impUsesFlags(MachineInstr *MI) {\n for (auto &Op : MI->implicit_operands())\n if (Op.isReg() && (Op.getReg() == X86::EFLAGS) && Op.isUse())\n return true;\n\n return false;\n}\n\nbool X86FixupSetCCPass::runOnMachineFunction(MachineFunction &MF) {\n bool Changed = false;\n MRI = &MF.getRegInfo();\n TII = MF.getSubtarget<X86Subtarget>().getInstrInfo();\n\n SmallVector<MachineInstr*, 4> ToErase;\n\n for (auto &MBB : MF) {\n for (auto &MI : MBB) {\n \/\/ Find a setcc that is used by a zext.\n \/\/ This doesn't have to be the only use, the transformation is safe\n \/\/ regardless.\n if (!isSetCCr(MI.getOpcode()))\n continue;\n\n MachineInstr *ZExt = nullptr;\n for (auto &Use : MRI->use_instructions(MI.getOperand(0).getReg()))\n if (Use.getOpcode() == X86::MOVZX32rr8)\n ZExt = &Use;\n\n if (!ZExt)\n continue;\n\n \/\/ Find the preceding instruction that imp-defs eflags.\n MachineInstr *FlagsDefMI = findFlagsImpDef(\n MI.getParent(), MachineBasicBlock::reverse_iterator(&MI));\n if (!FlagsDefMI)\n continue;\n\n \/\/ We'd like to put something that clobbers eflags directly before\n \/\/ FlagsDefMI. This can't hurt anything after FlagsDefMI, because\n \/\/ it, itself, by definition, clobbers eflags. But it may happen that\n \/\/ FlagsDefMI also *uses* eflags, in which case the transformation is\n \/\/ invalid.\n if (impUsesFlags(FlagsDefMI))\n continue;\n\n ++NumSubstZexts;\n Changed = true;\n\n \/\/ On 32-bit, we need to be careful to force an ABCD register.\n const TargetRegisterClass *RC = MF.getSubtarget<X86Subtarget>().is64Bit()\n ? &X86::GR32RegClass\n : &X86::GR32_ABCDRegClass;\n unsigned ZeroReg = MRI->createVirtualRegister(RC);\n unsigned InsertReg = MRI->createVirtualRegister(RC);\n\n \/\/ Initialize a register with 0. This must go before the eflags def\n BuildMI(MBB, FlagsDefMI, MI.getDebugLoc(), TII->get(X86::MOV32r0),\n ZeroReg);\n\n \/\/ X86 setcc only takes an output GR8, so fake a GR32 input by inserting\n \/\/ the setcc result into the low byte of the zeroed register.\n BuildMI(*ZExt->getParent(), ZExt, ZExt->getDebugLoc(),\n TII->get(X86::INSERT_SUBREG), InsertReg)\n .addReg(ZeroReg)\n .addReg(MI.getOperand(0).getReg())\n .addImm(X86::sub_8bit);\n MRI->replaceRegWith(ZExt->getOperand(0).getReg(), InsertReg);\n ToErase.push_back(ZExt);\n }\n }\n\n for (auto &I : ToErase)\n I->eraseFromParent();\n\n return Changed;\n}\n<|endoftext|>"} {"text":"<commit_before><commit_msg>statement aligned as second statement in if body but not in a statement block<commit_after><|endoftext|>"} {"text":"<commit_before>\/\/ ===============================================================\n\/\/ Computer Graphics Homework Solutions\n\/\/ Copyright (C) 2017 by George Wolberg\n\/\/\n\/\/ HW2b.cpp - HW2b class\n\/\/\n\/\/ Written by: George Wolberg, 2017\n\/\/ ===============================================================\n\n#include \"HW2b.h\"\n\n\/\/ shader ID\nenum {HW2B};\n\n\/\/ uniform ID\nenum {\n\tMV,\n\tPROJ,\n\tTHETA,\n\tSUBDIV,\n\tTWIST\n};\n\n\n\/\/ ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~\n\/\/ HW2b::HW2b:\n\/\/\n\/\/ HW2b constructor.\n\/\/\nHW2b::HW2b(const QGLFormat &glf, QWidget *parent) : HW(glf, parent)\n{\n\t\/\/ init vars\n\tm_theta = 0.0f;\n\tm_subdivisions = 4;\n\tm_twist = true;\n\tm_modelview .setToIdentity();\n\tm_projection.setToIdentity();\n}\n\n\n\n\/\/ ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~\n\/\/ HW2b::initializeGL:\n\/\/\n\/\/ Initialization routine before display loop.\n\/\/ Gets called once before the first time resizeGL() or paintGL() is called.\n\/\/\nvoid\nHW2b::initializeGL()\n{\n\t\/\/ initialize GL function resolution for current context\n\tinitializeGLFunctions();\n\n\t\/\/ init vertex and fragment shaders\n\tinitShaders();\n\n\t\/\/ initialize vertex buffer and write positions to vertex shader\n\tinitVertexBuffer();\n\n\t\/\/ init state variables\n\tglClearColor(0.0, 0.0, 0.0, 0.0);\t\/\/ set background color\n\tglColor3f (1.0, 1.0, 0.0);\t\t\/\/ set foreground color\n}\n\n\n\n\/\/ ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~\n\/\/ HW2b::resizeGL:\n\/\/\n\/\/ Resize event handler.\n\/\/ The input parameters are the window width (w) and height (h).\n\/\/\nvoid\nHW2b::resizeGL(int w, int h)\n{\n\t\/\/ PUT YOUR CODE HERE\n}\n\n\n\n\/\/ ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~\n\/\/ HW2b::paintGL:\n\/\/\n\/\/ Update GL scene.\n\/\/\nvoid\nHW2b::paintGL()\n{\n\t\/\/ PUT YOUR CODE HERE\n}\n\n\n\n\/\/ ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~\n\/\/ HW2b::controlPanel:\n\/\/\n\/\/ Create control panel groupbox.\n\/\/\nQGroupBox*\nHW2b::controlPanel()\n{\n\t\/\/ init group box\n\tQGroupBox *groupBox = new QGroupBox(\"Homework 2b\");\n\tgroupBox->setStyleSheet(GroupBoxStyle);\n\n\t\/\/ create labels\n\tQLabel *label[2];\n\tlabel[0] = new QLabel(\"Theta\");\n\tlabel[1] = new QLabel(\"Subdivide\");\n\n\t\/\/ create sliders\n\tm_sliderTheta = new QSlider(Qt::Horizontal);\n\tm_sliderSubdiv = new QSlider(Qt::Horizontal);\n\n\t\/\/ init sliders\n\tm_sliderTheta->setRange(0, 360);\n\tm_sliderTheta->setValue(0);\n\tm_sliderSubdiv->setRange(0, 6);\n\tm_sliderSubdiv->setValue(m_subdivisions);\n\n\t\/\/ create spinBoxes\n\tm_spinBoxTheta = new QSpinBox;\n\tm_spinBoxTheta->setRange(0, 360);\n\tm_spinBoxTheta->setValue(0);\n\tm_spinBoxSubdiv = new QSpinBox;\n\tm_spinBoxSubdiv->setRange(0, 6);\n\tm_spinBoxSubdiv->setValue(m_subdivisions);\n\n\t\/\/ init checkbox\n\tm_checkBoxTwist = new QCheckBox(\"Twist\");\n\tm_checkBoxTwist->setChecked(m_twist);\n\n\t\/\/ layout for assembling widgets\n\tQGridLayout *layout = new QGridLayout;\n\tlayout->addWidget(label[0],\t 0, 0);\n\tlayout->addWidget(m_sliderTheta, 0, 1);\n\tlayout->addWidget(m_spinBoxTheta, 0, 2);\n\tlayout->addWidget(label[1],\t 1, 0);\n\tlayout->addWidget(m_sliderSubdiv, 1, 1);\n\tlayout->addWidget(m_spinBoxSubdiv, 1, 2);\n\tlayout->addWidget(m_checkBoxTwist, 2, 0);\n\n\t\/\/ assign layout to group box\n\tgroupBox->setLayout(layout);\n\n\t\/\/ init signal\/slot connections\n\tconnect(m_sliderTheta, SIGNAL(valueChanged(int)), this, SLOT(changeTheta (int)));\n\tconnect(m_sliderSubdiv, SIGNAL(valueChanged(int)), this, SLOT(changeSubdiv(int)));\n\tconnect(m_spinBoxTheta, SIGNAL(valueChanged(int)), this, SLOT(changeTheta (int)));\n\tconnect(m_spinBoxSubdiv, SIGNAL(valueChanged(int)), this, SLOT(changeSubdiv(int)));\n\tconnect(m_checkBoxTwist, SIGNAL(stateChanged(int)), this, SLOT(changeTwist (int)));\n\n\treturn(groupBox);\n}\n\n\n\n\/\/ ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~\n\/\/ HW2b::reset:\n\/\/\n\/\/ Reset parameters.\n\/\/\nvoid\nHW2b::reset()\n{\n\t\/\/ reset parameters\n\tm_theta\t\t= 0.0f;\n\tm_subdivisions\t= 4;\n\tm_twist\t\t= true;\n\n\t\/\/ reset sliders and spinboxes\n\tm_sliderTheta->blockSignals(true);\n\tm_sliderTheta->setValue(0.0f);\n\tm_sliderTheta->blockSignals(false);\n\n\tm_spinBoxTheta->blockSignals(true);\n\tm_spinBoxTheta->setValue(0.0f);\n\tm_spinBoxTheta->blockSignals(false);\n\tm_sliderSubdiv->blockSignals(true);\n\tm_sliderSubdiv->setValue(m_subdivisions);\n\tm_sliderSubdiv->blockSignals(false);\n\n\tm_spinBoxSubdiv->blockSignals(true);\n\tm_spinBoxSubdiv->setValue(m_subdivisions);\n\tm_spinBoxSubdiv->blockSignals(false);\n\n\t\/\/ reset twist checkbox\n\tm_checkBoxTwist->setChecked(m_twist);\n\n\t\/\/ recompute geometry\n\tinitVertexBuffer();\n\n\t\/\/ reset 4x4 modelview matrix\n\tm_modelview.setToIdentity();\n\n\t\/\/ draw\n\tupdateGL();\n}\n\n\n\n\/\/ ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~\n\/\/ HW2b::initShaders:\n\/\/\n\/\/ Initialize vertex and fragment shaders.\n\/\/\nvoid\nHW2b::initShaders()\n{\n\n\t\/\/ init uniforms hash table based on uniform variable names and location IDs\n\tUniformMap uniforms;\n\tuniforms[\"u_Modelview\" ] = MV;\n\tuniforms[\"u_Projection\"] = PROJ;\n\tuniforms[\"u_Theta\" ] = THETA;\n\tuniforms[\"u_Twist\" ] = TWIST;\n\n\t\/\/ compile shader, bind attribute vars, link shader, and initialize uniform var table\n\tinitShader(HW2B, QString(\":\/hw2\/vshader2b.glsl\"), QString(\":\/hw2\/fshader2b.glsl\"), uniforms);\n}\n\n\n\n\/\/ ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~\n\/\/ HW2b::initVertexBuffer:\n\/\/\n\/\/ Initialize vertex buffer.\n\/\/\nvoid\nHW2b::initVertexBuffer()\n{\n\t\/\/ set flag for creating buffers (1st time only)\n\tstatic bool flag = 1;\n\n\t\/\/ verify that we have valid vertex\/color buffers\n\tstatic GLuint vertexBuffer = -1;\n\tstatic GLuint colorBuffer = -1;\n\tif(flag) { \/\/ create vertex and color buffers\n\t\tglGenBuffers(1, &vertexBuffer);\n\t\tglGenBuffers(1, &colorBuffer );\n\t\tflag = 0; \/\/ reset flag\n\t}\n\n\t\/\/ init geometry data\n\tconst vec2 vertices[] = {\n\t\tvec2( 0.0f, 0.75f ),\n\t\tvec2( 0.65f, -0.375f),\n\t\tvec2(-0.65f, -0.375f)\n\t};\n\n\t\/\/ recursively subdivide triangle into triangular facets;\n\t\/\/ store vertex positions and colors in m_points and m_colors, respectively\n\tdivideTriangle(vertices[0], vertices[1], vertices[2], m_subdivisions);\n\tm_numPoints = (int) m_points.size();\t\t\/\/ save number of vertices\n\n\t\/\/ bind vertex buffer to the GPU and copy the vertices from CPU to GPU\n\tglBindBuffer(GL_ARRAY_BUFFER, vertexBuffer);\n\tglBufferData(GL_ARRAY_BUFFER, m_numPoints*sizeof(vec2), &m_points[0], GL_STATIC_DRAW);\n\n\t\/\/ bind color buffer to the GPU and copy the colors from CPU to GPU\n\tglBindBuffer(GL_ARRAY_BUFFER, colorBuffer);\n\tglBufferData(GL_ARRAY_BUFFER, m_numPoints*sizeof(vec3), &m_colors[0], GL_STATIC_DRAW);\n\n\t\/\/ clear vertex and color vectors because they have already been copied into GPU\n\tm_points.clear();\n\tm_colors.clear();\n}\n\n\n\n\/\/ ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~\n\/\/ HW2b::divideTriangle:\n\/\/\n\/\/ Recursive subdivision of triangle (a,b,c). Recurse count times.\n\/\/\nvoid\nHW2b::divideTriangle(vec2 a, vec2 b, vec2 c, int count)\n{\n\t\/\/ PUT YOUR CODE HERE\n}\n\n\n\n\/\/ ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~\n\/\/ HW2b::triangle:\n\/\/\n\/\/ Push positions and colors of the three triangle vertices.\n\/\/\nvoid\nHW2b::triangle(vec2 v1, vec2 v2, vec2 v3)\n{\n\t\/\/ init geometry\n\tm_points.push_back(v1);\n\tm_points.push_back(v2);\n\tm_points.push_back(v3);\n\n\t\/\/ init color\n\tfloat r = (float) rand() \/ RAND_MAX;\n\tfloat g = (float) rand() \/ RAND_MAX;\n\tfloat b = (float) rand() \/ RAND_MAX;\n\tm_colors.push_back(vec3(r, g, b));\n\tm_colors.push_back(vec3(r, g, b));\n\tm_colors.push_back(vec3(r, g, b));\n}\n\n\n\n\/\/ ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~\n\/\/ HW2b::changeTheta:\n\/\/\n\/\/ Slot function to change rotation angle.\n\/\/\nvoid\nHW2b::changeTheta(int angle)\n{\n\t\/\/ update slider and spinbox\n\tm_sliderTheta->blockSignals(true);\n\tm_sliderTheta->setValue(angle);\n\tm_sliderTheta->blockSignals(false);\n\n\tm_spinBoxTheta->blockSignals(true);\n\tm_spinBoxTheta->setValue(angle);\n\tm_spinBoxTheta->blockSignals(false);\n\n\t\/\/ init vars\n\tm_theta = angle * (M_PI \/ 180.);\t\/\/ convert angle to radians\n\n\t\/\/ update model's rotation matrix\n\tm_modelview.setToIdentity();\n\tm_modelview.rotate(angle, QVector3D(0.0f, 0.0f, 1.0f));\n\n\t\/\/ draw\n\tupdateGL();\n}\n\n\n\n\/\/ ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~\n\/\/ HW2b::changeSubdiv:\n\/\/\n\/\/ Slot function to change number of recursive subdivisions.\n\/\/\nvoid\nHW2b::changeSubdiv(int subdivisions)\n{\n\t\/\/ update slider and spinbox\n\tm_sliderSubdiv->blockSignals(true);\n\tm_sliderSubdiv->setValue(subdivisions);\n\tm_sliderSubdiv->blockSignals(false);\n\n\tm_spinBoxSubdiv->blockSignals(true);\n\tm_spinBoxSubdiv->setValue(subdivisions);\n\tm_spinBoxSubdiv->blockSignals(false);\n\n\t\/\/ init vars\n\tm_subdivisions = subdivisions;\n\n\t\/\/ compute new vertices and colors\n\tinitVertexBuffer();\n\n\t\/\/ draw\n\tupdateGL();\n}\n\n\n\n\/\/ ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~\n\/\/ HW2b::changeTwist:\n\/\/\n\/\/ Slot function to turn on\/off m_twist;\n\/\/\nvoid\nHW2b::changeTwist(int twist)\n{\n\t\/\/ init vars\n\tm_twist = twist;\n\n\t\/\/ draw\n\tupdateGL();\n}\n<commit_msg>Begin HW2B.<commit_after>\/\/ ===============================================================\n\/\/ Computer Graphics Homework Solutions\n\/\/ Copyright (C) 2017 by George Wolberg\n\/\/\n\/\/ HW2b.cpp - HW2b class\n\/\/\n\/\/ Written by: George Wolberg, 2017\n\/\/ ===============================================================\n\n#include \"HW2b.h\"\n\n\/\/ shader ID\nenum {HW2B};\n\n\/\/ uniform ID\nenum {\n\tMV,\n\tPROJ,\n\tTHETA,\n\tSUBDIV,\n\tTWIST\n};\n\n\n\/\/ ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~\n\/\/ HW2b::HW2b:\n\/\/\n\/\/ HW2b constructor.\n\/\/\nHW2b::HW2b(const QGLFormat &glf, QWidget *parent) : HW(glf, parent)\n{\n\t\/\/ init vars\n\tm_theta = 0.0f;\n\tm_subdivisions = 4;\n\tm_twist = true;\n\tm_modelview .setToIdentity();\n\tm_projection.setToIdentity();\n}\n\n\n\n\/\/ ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~\n\/\/ HW2b::initializeGL:\n\/\/\n\/\/ Initialization routine before display loop.\n\/\/ Gets called once before the first time resizeGL() or paintGL() is called.\n\/\/\nvoid\nHW2b::initializeGL()\n{\n\t\/\/ initialize GL function resolution for current context\n\tinitializeGLFunctions();\n\n\t\/\/ init vertex and fragment shaders\n\tinitShaders();\n\n\t\/\/ initialize vertex buffer and write positions to vertex shader\n\tinitVertexBuffer();\n\n\t\/\/ init state variables\n\tglClearColor(0.0, 0.0, 0.0, 0.0);\t\/\/ set background color\n\tglColor3f (1.0, 1.0, 0.0);\t\t\/\/ set foreground color\n}\n\n\n\n\/\/ ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~\n\/\/ HW2b::resizeGL:\n\/\/\n\/\/ Resize event handler.\n\/\/ The input parameters are the window width (w) and height (h).\n\/\/\nvoid\nHW2b::resizeGL(int w, int h)\n{\n\t\/\/ PUT YOUR CODE HERE\n\tm_winW = w;\n\tm_winH = h;\n\n\t\/\/ compute aspect ratio\n\tfloat ar = (float) w \/ h;\n\n\t\/\/ set xmax, ymax;\n\tfloat xmax, ymax;\n\tif(ar > 1.0) {\t\t\/\/ wide screen\n\t\txmax = ar;\n\t\tymax = 1.;\n\t} else {\t\t\/\/ tall screen\n\t\txmax = 1.;\n\t\tymax = 1 \/ ar;\n\t}\n\n\t\/\/ set viewport to occupy full canvas\n\tglViewport(0, 0, w, h);\n\n\t\/\/ init viewing coordinates for orthographic projection\n\tglLoadIdentity();\n\tglOrtho(-xmax, xmax, -ymax, ymax, -1.0, 1.0);\n}\n\n\n\n\/\/ ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~\n\/\/ HW2b::paintGL:\n\/\/\n\/\/ Update GL scene.\n\/\/\nvoid\nHW2b::paintGL()\n{\n\t\/\/ PUT YOUR CODE HERE\n\tglClear(GL_COLOR_BUFFER_BIT);\n\n\tglDrawArrays(GL_TRIANGLES, 0, 3);\n\n\t\/\/ for(uint i=0, j=0; i<m_colors.size(); ++i) {\n\t\/\/ \tglColor3f(m_colors[i][0], m_colors[i][1], m_colors[i][2]);\n\n\t\/\/ \tglBegin(GL_TRIANGLES);\n\t\/\/ \t\tglVertex2f(m_points[j][0], m_points[j][1]); j++;\n\t\/\/ \t\tglVertex2f(m_points[j][0], m_points[j][1]); j++;\n\t\/\/ \t\tglVertex2f(m_points[j][0], m_points[j][1]); j++;\n\t\/\/ \tglEnd();\n\t\/\/ }\n}\n\n\n\n\/\/ ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~\n\/\/ HW2b::controlPanel:\n\/\/\n\/\/ Create control panel groupbox.\n\/\/\nQGroupBox*\nHW2b::controlPanel()\n{\n\t\/\/ init group box\n\tQGroupBox *groupBox = new QGroupBox(\"Homework 2b\");\n\tgroupBox->setStyleSheet(GroupBoxStyle);\n\n\t\/\/ create labels\n\tQLabel *label[2];\n\tlabel[0] = new QLabel(\"Theta\");\n\tlabel[1] = new QLabel(\"Subdivide\");\n\n\t\/\/ create sliders\n\tm_sliderTheta = new QSlider(Qt::Horizontal);\n\tm_sliderSubdiv = new QSlider(Qt::Horizontal);\n\n\t\/\/ init sliders\n\tm_sliderTheta->setRange(0, 360);\n\tm_sliderTheta->setValue(0);\n\tm_sliderSubdiv->setRange(0, 6);\n\tm_sliderSubdiv->setValue(m_subdivisions);\n\n\t\/\/ create spinBoxes\n\tm_spinBoxTheta = new QSpinBox;\n\tm_spinBoxTheta->setRange(0, 360);\n\tm_spinBoxTheta->setValue(0);\n\tm_spinBoxSubdiv = new QSpinBox;\n\tm_spinBoxSubdiv->setRange(0, 6);\n\tm_spinBoxSubdiv->setValue(m_subdivisions);\n\n\t\/\/ init checkbox\n\tm_checkBoxTwist = new QCheckBox(\"Twist\");\n\tm_checkBoxTwist->setChecked(m_twist);\n\n\t\/\/ layout for assembling widgets\n\tQGridLayout *layout = new QGridLayout;\n\tlayout->addWidget(label[0],\t 0, 0);\n\tlayout->addWidget(m_sliderTheta, 0, 1);\n\tlayout->addWidget(m_spinBoxTheta, 0, 2);\n\tlayout->addWidget(label[1],\t 1, 0);\n\tlayout->addWidget(m_sliderSubdiv, 1, 1);\n\tlayout->addWidget(m_spinBoxSubdiv, 1, 2);\n\tlayout->addWidget(m_checkBoxTwist, 2, 0);\n\n\t\/\/ assign layout to group box\n\tgroupBox->setLayout(layout);\n\n\t\/\/ init signal\/slot connections\n\tconnect(m_sliderTheta, SIGNAL(valueChanged(int)), this, SLOT(changeTheta (int)));\n\tconnect(m_sliderSubdiv, SIGNAL(valueChanged(int)), this, SLOT(changeSubdiv(int)));\n\tconnect(m_spinBoxTheta, SIGNAL(valueChanged(int)), this, SLOT(changeTheta (int)));\n\tconnect(m_spinBoxSubdiv, SIGNAL(valueChanged(int)), this, SLOT(changeSubdiv(int)));\n\tconnect(m_checkBoxTwist, SIGNAL(stateChanged(int)), this, SLOT(changeTwist (int)));\n\n\treturn(groupBox);\n}\n\n\n\n\/\/ ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~\n\/\/ HW2b::reset:\n\/\/\n\/\/ Reset parameters.\n\/\/\nvoid\nHW2b::reset()\n{\n\t\/\/ reset parameters\n\tm_theta\t\t= 0.0f;\n\tm_subdivisions\t= 4;\n\tm_twist\t\t= true;\n\n\t\/\/ reset sliders and spinboxes\n\tm_sliderTheta->blockSignals(true);\n\tm_sliderTheta->setValue(0.0f);\n\tm_sliderTheta->blockSignals(false);\n\n\tm_spinBoxTheta->blockSignals(true);\n\tm_spinBoxTheta->setValue(0.0f);\n\tm_spinBoxTheta->blockSignals(false);\n\tm_sliderSubdiv->blockSignals(true);\n\tm_sliderSubdiv->setValue(m_subdivisions);\n\tm_sliderSubdiv->blockSignals(false);\n\n\tm_spinBoxSubdiv->blockSignals(true);\n\tm_spinBoxSubdiv->setValue(m_subdivisions);\n\tm_spinBoxSubdiv->blockSignals(false);\n\n\t\/\/ reset twist checkbox\n\tm_checkBoxTwist->setChecked(m_twist);\n\n\t\/\/ recompute geometry\n\tinitVertexBuffer();\n\n\t\/\/ reset 4x4 modelview matrix\n\tm_modelview.setToIdentity();\n\n\t\/\/ draw\n\tupdateGL();\n}\n\n\n\n\/\/ ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~\n\/\/ HW2b::initShaders:\n\/\/\n\/\/ Initialize vertex and fragment shaders.\n\/\/\nvoid\nHW2b::initShaders()\n{\n\n\t\/\/ init uniforms hash table based on uniform variable names and location IDs\n\tUniformMap uniforms;\n\tuniforms[\"u_Modelview\" ] = MV;\n\tuniforms[\"u_Projection\"] = PROJ;\n\tuniforms[\"u_Theta\" ] = THETA;\n\tuniforms[\"u_Twist\" ] = TWIST;\n\n\t\/\/ compile shader, bind attribute vars, link shader, and initialize uniform var table\n\tinitShader(HW2B, QString(\":\/hw2\/vshader2b.glsl\"), QString(\":\/hw2\/fshader2b.glsl\"), uniforms);\n}\n\n\n\n\/\/ ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~\n\/\/ HW2b::initVertexBuffer:\n\/\/\n\/\/ Initialize vertex buffer.\n\/\/\nvoid\nHW2b::initVertexBuffer()\n{\n\t\/\/ set flag for creating buffers (1st time only)\n\tstatic bool flag = 1;\n\n\t\/\/ verify that we have valid vertex\/color buffers\n\tstatic GLuint vertexBuffer = -1;\n\tstatic GLuint colorBuffer = -1;\n\tif(flag) { \/\/ create vertex and color buffers\n\t\tglGenBuffers(1, &vertexBuffer);\n\t\tglGenBuffers(1, &colorBuffer );\n\t\tflag = 0; \/\/ reset flag\n\t}\n\n\t\/\/ init geometry data\n\tconst vec2 vertices[] = {\n\t\tvec2( 0.0f, 0.75f ),\n\t\tvec2( 0.65f, -0.375f),\n\t\tvec2(-0.65f, -0.375f)\n\t};\n\n\t\/\/ recursively subdivide triangle into triangular facets;\n\t\/\/ store vertex positions and colors in m_points and m_colors, respectively\n\tdivideTriangle(vertices[0], vertices[1], vertices[2], m_subdivisions);\n\tm_numPoints = (int) m_points.size();\t\t\/\/ save number of vertices\n\n\t\/\/ bind vertex buffer to the GPU and copy the vertices from CPU to GPU\n\tglBindBuffer(GL_ARRAY_BUFFER, vertexBuffer);\n\tglBufferData(GL_ARRAY_BUFFER, m_numPoints*sizeof(vec2), &m_points[0], GL_STATIC_DRAW);\n\n\t\/\/ bind color buffer to the GPU and copy the colors from CPU to GPU\n\tglBindBuffer(GL_ARRAY_BUFFER, colorBuffer);\n\tglBufferData(GL_ARRAY_BUFFER, m_numPoints*sizeof(vec3), &m_colors[0], GL_STATIC_DRAW);\n\n\t\/\/ clear vertex and color vectors because they have already been copied into GPU\n\tm_points.clear();\n\tm_colors.clear();\n}\n\n\n\n\/\/ ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~\n\/\/ HW2b::divideTriangle:\n\/\/\n\/\/ Recursive subdivision of triangle (a,b,c). Recurse count times.\n\/\/\nvoid\nHW2b::divideTriangle(vec2 a, vec2 b, vec2 c, int count)\n{\n\t\/\/ PUT YOUR CODE HERE\n\tif(count > 0) {\n\t\tvec2 ab = vec2((a[0] + b[0]) \/ 2.0, (a[1]+b[1]) \/ 2.0);\n\t\tvec2 ac = vec2((a[0] + c[0]) \/ 2.0, (a[1]+c[1]) \/ 2.0);\n\t\tvec2 bc = vec2((b[0] + c[0]) \/ 2.0, (b[1]+c[1]) \/ 2.0);\n\t\tdivideTriangle( a, ab, ac, count - 1);\n\t\tdivideTriangle( b, bc, ab, count - 1);\n\t\tdivideTriangle( c, ac, bc, count - 1);\n\t\tdivideTriangle(ab, ac, bc, count - 1);\n\t} else triangle(a, b, c);\n}\n\n\n\n\/\/ ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~\n\/\/ HW2b::triangle:\n\/\/\n\/\/ Push positions and colors of the three triangle vertices.\n\/\/\nvoid\nHW2b::triangle(vec2 v1, vec2 v2, vec2 v3)\n{\n\t\/\/ init geometry\n\tm_points.push_back(v1);\n\tm_points.push_back(v2);\n\tm_points.push_back(v3);\n\n\t\/\/ init color\n\tfloat r = (float) rand() \/ RAND_MAX;\n\tfloat g = (float) rand() \/ RAND_MAX;\n\tfloat b = (float) rand() \/ RAND_MAX;\n\tm_colors.push_back(vec3(r, g, b));\n\tm_colors.push_back(vec3(r, g, b));\n\tm_colors.push_back(vec3(r, g, b));\n}\n\n\n\n\/\/ ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~\n\/\/ HW2b::changeTheta:\n\/\/\n\/\/ Slot function to change rotation angle.\n\/\/\nvoid\nHW2b::changeTheta(int angle)\n{\n\t\/\/ update slider and spinbox\n\tm_sliderTheta->blockSignals(true);\n\tm_sliderTheta->setValue(angle);\n\tm_sliderTheta->blockSignals(false);\n\n\tm_spinBoxTheta->blockSignals(true);\n\tm_spinBoxTheta->setValue(angle);\n\tm_spinBoxTheta->blockSignals(false);\n\n\t\/\/ init vars\n\tm_theta = angle * (M_PI \/ 180.);\t\/\/ convert angle to radians\n\n\t\/\/ update model's rotation matrix\n\tm_modelview.setToIdentity();\n\tm_modelview.rotate(angle, QVector3D(0.0f, 0.0f, 1.0f));\n\n\t\/\/ draw\n\tupdateGL();\n}\n\n\n\n\/\/ ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~\n\/\/ HW2b::changeSubdiv:\n\/\/\n\/\/ Slot function to change number of recursive subdivisions.\n\/\/\nvoid\nHW2b::changeSubdiv(int subdivisions)\n{\n\t\/\/ update slider and spinbox\n\tm_sliderSubdiv->blockSignals(true);\n\tm_sliderSubdiv->setValue(subdivisions);\n\tm_sliderSubdiv->blockSignals(false);\n\n\tm_spinBoxSubdiv->blockSignals(true);\n\tm_spinBoxSubdiv->setValue(subdivisions);\n\tm_spinBoxSubdiv->blockSignals(false);\n\n\t\/\/ init vars\n\tm_subdivisions = subdivisions;\n\n\t\/\/ compute new vertices and colors\n\tinitVertexBuffer();\n\n\t\/\/ draw\n\tupdateGL();\n}\n\n\n\n\/\/ ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~\n\/\/ HW2b::changeTwist:\n\/\/\n\/\/ Slot function to turn on\/off m_twist;\n\/\/\nvoid\nHW2b::changeTwist(int twist)\n{\n\t\/\/ init vars\n\tm_twist = twist;\n\n\t\/\/ draw\n\tupdateGL();\n}\n<|endoftext|>"} {"text":"<commit_before>\/\/ C++ source file - (C) 2003 Robert Osfield, released under the OSGPL.\n\/\/\n\/\/ Simple example of use of Producer::RenderSurface to create an OpenGL\n\/\/ graphics window, and OSG for rendering.\n\n#include <osg\/Timer>\n#include <osg\/GraphicsContext>\n#include <osg\/GraphicsThread>\n\n#include <osgUtil\/UpdateVisitor>\n#include <osgUtil\/CullVisitor>\n#include <osgUtil\/SceneView>\n#include <osgUtil\/GLObjectsVisitor>\n\n#include <osgDB\/ReadFile>\n\n#include <map>\n#include <list>\n#include <iostream>\n\n\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\n\/\/\n\/\/ **************** THIS IS AN EXPERIMENTAL IMPLEMENTATION ***************\n\/\/ ************************** PLEASE DO NOT COPY ************************\n\/\/\n\/\/\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n\n\/\/ Compile operation, that compile OpenGL objects.\nstruct CompileOperation : public osg::GraphicsThread::Operation\n{\n CompileOperation(osg::Node* scene):\n osg::GraphicsThread::Operation(\"Compile\",false),\n _scene(scene)\n {\n }\n \n virtual void operator () (osg::GraphicsContext* context)\n {\n std::cout<<\"Compile\"<<std::endl;\n \n osgUtil::GLObjectsVisitor compileVisitor;\n compileVisitor.setState(context->getState());\n\n \/\/ do the compile traversal\n _scene->accept(compileVisitor);\n }\n \n osg::ref_ptr<osg::Node> _scene;\n};\n\n\/\/ Cull operation, that does a cull on the scene graph.\nstruct CullOperation : public osg::GraphicsThread::Operation\n{\n CullOperation(osg::CameraNode* camera, osgUtil::SceneView* sceneView):\n osg::GraphicsThread::Operation(\"Cull\",true),\n _camera(camera),\n _sceneView(sceneView)\n {\n }\n \n virtual void operator () (osg::GraphicsContext* context)\n {\n _sceneView->setState(context->getState());\n _sceneView->setProjectionMatrix(_camera->getProjectionMatrix());\n _sceneView->setViewMatrix(_camera->getViewMatrix());\n _sceneView->setViewport(_camera->getViewport());\n \n _sceneView->cull();\n }\n \n osg::ref_ptr<osg::CameraNode> _camera;\n osg::ref_ptr<osgUtil::SceneView> _sceneView;\n};\n\n\/\/ Draw operation, that does a draw on the scene graph.\nstruct DrawOperation : public osg::GraphicsThread::Operation\n{\n DrawOperation(osgUtil::SceneView* sceneView):\n osg::GraphicsThread::Operation(\"Draw\",true),\n _sceneView(sceneView)\n {\n }\n \n virtual void operator () (osg::GraphicsContext*)\n {\n _sceneView->draw();\n }\n \n osg::ref_ptr<osgUtil::SceneView> _sceneView;\n};\n\n\n\/\/ main does the following steps to create a multi-thread, multiple camera\/graphics context view of a scene graph.\n\/\/\n\/\/ 1) load the scene graph\n\/\/\n\/\/ 2) create a list of camera, each with their own graphis context, with a graphics thread for each context.\n\/\/\n\/\/ 3) set up the graphic threads so that the do an initial compile OpenGL objects operation, this is done once, and then this compile op is disgarded\n\/\/\n\/\/ 4) set up the graphics thread so that it has all the graphics ops required for the main loop, these ops are:\n\/\/ 4.a) frame begin barrair, syncronizes all the waiting graphic threads so they don't run while update is occuring\n\/\/ 4.b) frame operation - the cull and draw for each camera\n\/\/ 4.c) frame end barrier, releases the update thread once all graphic threads have dispatched all their OpenGL commands\n\/\/ 4.d) pre swap barrier, barrier which ensures that all graphics threads have sent their data down to the gfx card.\n\/\/ 4.e) swap buffers, do the swap buffers on all the graphics contexts.\n\/\/\n\/\/ 5. The main loop:\n\/\/ 5.a) update\n\/\/ 5.b) join the frame begin barrrier, releasing all the graphics threads to do their stuff\n\/\/ 5.c) block on the frame end barrier, waiting till all the graphics threads have done their cull\/draws.\n\/\/ 5.d) check to see if any of the windows has been closed. \n\/\/\nint main( int argc, char **argv )\n{\n if (argc<2) \n {\n std::cout << argv[0] <<\": requires filename argument.\" << std::endl;\n return 1;\n }\n\n \/\/ load the scene.\n osg::ref_ptr<osg::Node> loadedModel = osgDB::readNodeFile(argv[1]);\n if (!loadedModel) \n {\n std::cout << argv[0] <<\": No data loaded.\" << std::endl;\n return 1;\n }\n\n \n \/\/ set up the frame stamp for current frame to record the current time and frame number so that animtion code can advance correctly\n osg::ref_ptr<osg::FrameStamp> frameStamp = new osg::FrameStamp;\n\n unsigned int frameNum = 0;\n\n osgUtil::UpdateVisitor updateVisitor;\n updateVisitor.setFrameStamp(frameStamp.get());\n\n\n unsigned int numberCameras = 3;\n unsigned int xpos = 0;\n unsigned int ypos = 400;\n unsigned int width = 400;\n unsigned int height = 400;\n \n typedef std::list< osg::ref_ptr<osg::CameraNode> > CameraList;\n typedef std::set< osg::GraphicsContext* > GraphicsContextSet;\n\n CameraList cameraList;\n GraphicsContextSet graphicsContextSet;\n\n \/\/ create the cameras, graphic contexts and graphic threads.\n bool shareContexts = false;\n osg::GraphicsContext* previousContext = 0;\n for(unsigned int i=0; i< numberCameras; ++i)\n {\n osg::ref_ptr<osg::CameraNode> camera = new osg::CameraNode;\n camera->addChild(loadedModel.get());\n\n osg::ref_ptr<osg::GraphicsContext::Traits> traits = new osg::GraphicsContext::Traits;\n traits->_windowName = \"osgcamera\";\n traits->_x = xpos;\n traits->_y = ypos;\n traits->_width = width;\n traits->_height = height;\n traits->_windowDecoration = true;\n traits->_doubleBuffer = true;\n traits->_sharedContext = shareContexts ? previousContext : 0;\n \n xpos += width;\n\n osg::ref_ptr<osg::GraphicsContext> gfxc = osg::GraphicsContext::createGraphicsContext(traits.get());\n\n if (!gfxc)\n {\n std::cout<<\"Unable to create window.\"<<std::endl;\n return 1;\n }\n\n camera->setGraphicsContext(gfxc.get());\n\n \/\/ initialize the view to look at the center of the scene graph\n const osg::BoundingSphere& bs = loadedModel->getBound();\n osg::Matrix viewMatrix;\n viewMatrix.makeLookAt(bs.center()-osg::Vec3(0.0,2.0f*bs.radius(),0.0),bs.center(),osg::Vec3(0.0f,0.0f,1.0f));\n\n camera->setViewport(0,0,traits->_width,traits->_height);\n camera->setProjectionMatrixAsPerspective(50.0f,1.4f,1.0f,10000.0f);\n camera->setViewMatrix(viewMatrix);\n\n \/\/ graphics thread will realize the window.\n gfxc->createGraphicsThread();\n\n cameraList.push_back(camera);\n\n previousContext = gfxc.get();\n }\n\n\n \/\/ build the list of unique graphics contexts.\n CameraList::iterator citr;\n for(citr = cameraList.begin();\n citr != cameraList.end();\n ++citr)\n {\n graphicsContextSet.insert(const_cast<osg::GraphicsContext*>((*citr)->getGraphicsContext()));\n }\n\n\n std::cout<<\"Number of cameras = \"<<cameraList.size()<<std::endl;\n std::cout<<\"Number of graphics contexts = \"<<graphicsContextSet.size()<<std::endl;\n\n\n \/\/ first the compile of the GL Objects, do it syncronously.\n GraphicsContextSet::iterator gitr;\n osg::ref_ptr<CompileOperation> compileOp = new CompileOperation(loadedModel.get());\n for(gitr = graphicsContextSet.begin();\n gitr != graphicsContextSet.end();\n ++gitr)\n {\n osg::GraphicsContext* context = *gitr;\n context->getGraphicsThread()->add(compileOp.get(), false);\n }\n\n\n \/\/ second the begin frame barrier to all graphics threads\n osg::ref_ptr<osg::BarrierOperation> frameBeginBarrierOp = new osg::BarrierOperation(graphicsContextSet.size()+1, osg::BarrierOperation::NO_OPERATION);\n for(gitr = graphicsContextSet.begin();\n gitr != graphicsContextSet.end();\n ++gitr)\n {\n osg::GraphicsContext* context = *gitr;\n context->getGraphicsThread()->add(frameBeginBarrierOp.get(), false);\n }\n\n osg::ref_ptr<osg::BarrierOperation> glFinishBarrierOp = new osg::BarrierOperation(graphicsContextSet.size(), osg::BarrierOperation::GL_FINISH);\n\n \/\/ we can put a finish in to gate rendering throughput, so that each new frame starts with a clean sheet.\n \/\/ you should only enable one of these, doFinishBeforeNewDraw will allow for the better parallism of the two finish approaches\n bool doFinishBeforeNewDraw = true;\n bool doFinishAfterSwap = false;\n\n \/\/ third add the frame for each camera.\n for(citr = cameraList.begin();\n citr != cameraList.end();\n ++citr)\n {\n osg::CameraNode* camera = citr->get();\n \n \/\/ create a scene view to do the cull and draw\n osgUtil::SceneView* sceneView = new osgUtil::SceneView;\n sceneView->setDefaults();\n sceneView->setFrameStamp(frameStamp.get());\n \n if (camera->getNumChildren()>=1)\n {\n sceneView->setSceneData(camera->getChild(0));\n }\n\n \/\/ cull traversal operation\n camera->getGraphicsContext()->getGraphicsThread()->add( new CullOperation(camera, sceneView), false); \n\n \/\/ optionally add glFinish barrier to ensure that all OpenGL commands are completed before we start dispatching a new frame\n if (doFinishBeforeNewDraw) camera->getGraphicsContext()->getGraphicsThread()->add( glFinishBarrierOp.get(), false); \n\n \/\/ draw traversal operation.\n camera->getGraphicsContext()->getGraphicsThread()->add( new DrawOperation(sceneView), false); \n }\n\n \/\/ fourth add the frame end barrier, the pre swap barrier and finally the swap buffers to each graphics thread.\n \/\/ The frame end barrier tells the main thead that the draw dispatch\/read phase of the scene graph is complete.\n \/\/ The pre swap barrier is an optional extra, which does a flush before joining the barrier, using this all graphics threads\n \/\/ are held back until they have all dispatched their fifo to the graphics hardware. \n \/\/ The swapOp just issues a swap buffers for each of the graphics contexts.\n osg::ref_ptr<osg::BarrierOperation> frameEndBarrierOp = new osg::BarrierOperation(graphicsContextSet.size()+1, osg::BarrierOperation::NO_OPERATION);\n osg::ref_ptr<osg::BarrierOperation> preSwapBarrierOp = new osg::BarrierOperation(graphicsContextSet.size(), osg::BarrierOperation::GL_FLUSH);\n osg::ref_ptr<osg::SwapBuffersOperation> swapOp = new osg::SwapBuffersOperation();\n for(gitr = graphicsContextSet.begin();\n gitr != graphicsContextSet.end();\n ++gitr)\n {\n osg::GraphicsContext* context = *gitr;\n\n context->getGraphicsThread()->add(frameEndBarrierOp.get(), false);\n context->getGraphicsThread()->add(preSwapBarrierOp.get(), false);\n context->getGraphicsThread()->add(swapOp.get(), false);\n \n \/\/ optionally add finish barrier to ensure that we don't do any other graphics work till the current OpenGL commands are complete.\n if (doFinishAfterSwap) context->getGraphicsThread()->add(glFinishBarrierOp.get(), false);\n }\n\n\n \/\/ record the timer tick at the start of rendering. \n osg::Timer_t start_tick = osg::Timer::instance()->tick();\n osg::Timer_t previous_tick = start_tick;\n \n bool done = false; \n\n \/\/ main loop - update scene graph, dispatch frame, wait for frame done.\n while( !done )\n {\n\n osg::Timer_t current_tick = osg::Timer::instance()->tick();\n\n frameStamp->setReferenceTime(osg::Timer::instance()->delta_s(start_tick,current_tick));\n frameStamp->setFrameNumber(frameNum++);\n \n std::cout<<\"Frame rate \"<<1.0\/osg::Timer::instance()->delta_s(previous_tick,current_tick)<<std::endl;\n previous_tick = current_tick;\n\n\n \/\/ do the update traversal.\n loadedModel->accept(updateVisitor);\n\n \/\/ dispatch the frame.\n frameBeginBarrierOp->block();\n \n \/\/ wait till the frame is done.\n frameEndBarrierOp->block();\n\n \/\/ check if any of the windows are closed\n for(gitr = graphicsContextSet.begin();\n gitr != graphicsContextSet.end();\n ++gitr)\n {\n osg::GraphicsContext* context = *gitr;\n if (!context->isRealized()) done = true;\n }\n\n }\n return 0;\n}\n<commit_msg>Disable the glFinishBarrierOp usage as glFinish was spin locking the CPU :-|<commit_after>\/\/ C++ source file - (C) 2003 Robert Osfield, released under the OSGPL.\n\/\/\n\/\/ Simple example of use of Producer::RenderSurface to create an OpenGL\n\/\/ graphics window, and OSG for rendering.\n\n#include <osg\/Timer>\n#include <osg\/GraphicsContext>\n#include <osg\/GraphicsThread>\n\n#include <osgUtil\/UpdateVisitor>\n#include <osgUtil\/CullVisitor>\n#include <osgUtil\/SceneView>\n#include <osgUtil\/GLObjectsVisitor>\n\n#include <osgDB\/ReadFile>\n\n#include <map>\n#include <list>\n#include <iostream>\n\n\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\n\/\/\n\/\/ **************** THIS IS AN EXPERIMENTAL IMPLEMENTATION ***************\n\/\/ ************************** PLEASE DO NOT COPY ************************\n\/\/\n\/\/\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n\n\/\/ Compile operation, that compile OpenGL objects.\nstruct CompileOperation : public osg::GraphicsThread::Operation\n{\n CompileOperation(osg::Node* scene):\n osg::GraphicsThread::Operation(\"Compile\",false),\n _scene(scene)\n {\n }\n \n virtual void operator () (osg::GraphicsContext* context)\n {\n std::cout<<\"Compile\"<<std::endl;\n \n osgUtil::GLObjectsVisitor compileVisitor;\n compileVisitor.setState(context->getState());\n\n \/\/ do the compile traversal\n _scene->accept(compileVisitor);\n }\n \n osg::ref_ptr<osg::Node> _scene;\n};\n\n\/\/ Cull operation, that does a cull on the scene graph.\nstruct CullOperation : public osg::GraphicsThread::Operation\n{\n CullOperation(osg::CameraNode* camera, osgUtil::SceneView* sceneView):\n osg::GraphicsThread::Operation(\"Cull\",true),\n _camera(camera),\n _sceneView(sceneView)\n {\n }\n \n virtual void operator () (osg::GraphicsContext* context)\n {\n _sceneView->setState(context->getState());\n _sceneView->setProjectionMatrix(_camera->getProjectionMatrix());\n _sceneView->setViewMatrix(_camera->getViewMatrix());\n _sceneView->setViewport(_camera->getViewport());\n \n _sceneView->cull();\n }\n \n osg::ref_ptr<osg::CameraNode> _camera;\n osg::ref_ptr<osgUtil::SceneView> _sceneView;\n};\n\n\/\/ Draw operation, that does a draw on the scene graph.\nstruct DrawOperation : public osg::GraphicsThread::Operation\n{\n DrawOperation(osgUtil::SceneView* sceneView):\n osg::GraphicsThread::Operation(\"Draw\",true),\n _sceneView(sceneView)\n {\n }\n \n virtual void operator () (osg::GraphicsContext*)\n {\n _sceneView->draw();\n }\n \n osg::ref_ptr<osgUtil::SceneView> _sceneView;\n};\n\n\n\/\/ main does the following steps to create a multi-thread, multiple camera\/graphics context view of a scene graph.\n\/\/\n\/\/ 1) load the scene graph\n\/\/\n\/\/ 2) create a list of camera, each with their own graphis context, with a graphics thread for each context.\n\/\/\n\/\/ 3) set up the graphic threads so that the do an initial compile OpenGL objects operation, this is done once, and then this compile op is disgarded\n\/\/\n\/\/ 4) set up the graphics thread so that it has all the graphics ops required for the main loop, these ops are:\n\/\/ 4.a) frame begin barrair, syncronizes all the waiting graphic threads so they don't run while update is occuring\n\/\/ 4.b) frame operation - the cull and draw for each camera\n\/\/ 4.c) frame end barrier, releases the update thread once all graphic threads have dispatched all their OpenGL commands\n\/\/ 4.d) pre swap barrier, barrier which ensures that all graphics threads have sent their data down to the gfx card.\n\/\/ 4.e) swap buffers, do the swap buffers on all the graphics contexts.\n\/\/\n\/\/ 5. The main loop:\n\/\/ 5.a) update\n\/\/ 5.b) join the frame begin barrrier, releasing all the graphics threads to do their stuff\n\/\/ 5.c) block on the frame end barrier, waiting till all the graphics threads have done their cull\/draws.\n\/\/ 5.d) check to see if any of the windows has been closed. \n\/\/\nint main( int argc, char **argv )\n{\n if (argc<2) \n {\n std::cout << argv[0] <<\": requires filename argument.\" << std::endl;\n return 1;\n }\n\n \/\/ load the scene.\n osg::ref_ptr<osg::Node> loadedModel = osgDB::readNodeFile(argv[1]);\n if (!loadedModel) \n {\n std::cout << argv[0] <<\": No data loaded.\" << std::endl;\n return 1;\n }\n\n \n \/\/ set up the frame stamp for current frame to record the current time and frame number so that animtion code can advance correctly\n osg::ref_ptr<osg::FrameStamp> frameStamp = new osg::FrameStamp;\n\n unsigned int frameNum = 0;\n\n osgUtil::UpdateVisitor updateVisitor;\n updateVisitor.setFrameStamp(frameStamp.get());\n\n\n unsigned int numberCameras = 1;\n unsigned int xpos = 0;\n unsigned int ypos = 400;\n unsigned int width = 400;\n unsigned int height = 400;\n \n typedef std::list< osg::ref_ptr<osg::CameraNode> > CameraList;\n typedef std::set< osg::GraphicsContext* > GraphicsContextSet;\n\n CameraList cameraList;\n GraphicsContextSet graphicsContextSet;\n\n \/\/ create the cameras, graphic contexts and graphic threads.\n bool shareContexts = false;\n osg::GraphicsContext* previousContext = 0;\n for(unsigned int i=0; i< numberCameras; ++i)\n {\n osg::ref_ptr<osg::CameraNode> camera = new osg::CameraNode;\n camera->addChild(loadedModel.get());\n\n osg::ref_ptr<osg::GraphicsContext::Traits> traits = new osg::GraphicsContext::Traits;\n traits->_windowName = \"osgcamera\";\n traits->_x = xpos;\n traits->_y = ypos;\n traits->_width = width;\n traits->_height = height;\n traits->_windowDecoration = true;\n traits->_doubleBuffer = true;\n traits->_sharedContext = shareContexts ? previousContext : 0;\n \n xpos += width;\n\n osg::ref_ptr<osg::GraphicsContext> gfxc = osg::GraphicsContext::createGraphicsContext(traits.get());\n\n if (!gfxc)\n {\n std::cout<<\"Unable to create window.\"<<std::endl;\n return 1;\n }\n\n camera->setGraphicsContext(gfxc.get());\n\n \/\/ initialize the view to look at the center of the scene graph\n const osg::BoundingSphere& bs = loadedModel->getBound();\n osg::Matrix viewMatrix;\n viewMatrix.makeLookAt(bs.center()-osg::Vec3(0.0,2.0f*bs.radius(),0.0),bs.center(),osg::Vec3(0.0f,0.0f,1.0f));\n\n camera->setViewport(0,0,traits->_width,traits->_height);\n camera->setProjectionMatrixAsPerspective(50.0f,1.4f,1.0f,10000.0f);\n camera->setViewMatrix(viewMatrix);\n\n \/\/ graphics thread will realize the window.\n gfxc->createGraphicsThread();\n\n cameraList.push_back(camera);\n\n previousContext = gfxc.get();\n }\n\n\n \/\/ build the list of unique graphics contexts.\n CameraList::iterator citr;\n for(citr = cameraList.begin();\n citr != cameraList.end();\n ++citr)\n {\n graphicsContextSet.insert(const_cast<osg::GraphicsContext*>((*citr)->getGraphicsContext()));\n }\n\n\n std::cout<<\"Number of cameras = \"<<cameraList.size()<<std::endl;\n std::cout<<\"Number of graphics contexts = \"<<graphicsContextSet.size()<<std::endl;\n\n\n \/\/ first the compile of the GL Objects, do it syncronously.\n GraphicsContextSet::iterator gitr;\n osg::ref_ptr<CompileOperation> compileOp = new CompileOperation(loadedModel.get());\n for(gitr = graphicsContextSet.begin();\n gitr != graphicsContextSet.end();\n ++gitr)\n {\n osg::GraphicsContext* context = *gitr;\n context->getGraphicsThread()->add(compileOp.get(), false);\n }\n\n\n \/\/ second the begin frame barrier to all graphics threads\n osg::ref_ptr<osg::BarrierOperation> frameBeginBarrierOp = new osg::BarrierOperation(graphicsContextSet.size()+1, osg::BarrierOperation::NO_OPERATION);\n for(gitr = graphicsContextSet.begin();\n gitr != graphicsContextSet.end();\n ++gitr)\n {\n osg::GraphicsContext* context = *gitr;\n context->getGraphicsThread()->add(frameBeginBarrierOp.get(), false);\n }\n\n osg::ref_ptr<osg::BarrierOperation> glFinishBarrierOp = new osg::BarrierOperation(graphicsContextSet.size(), osg::BarrierOperation::GL_FINISH);\n\n \/\/ we can put a finish in to gate rendering throughput, so that each new frame starts with a clean sheet.\n \/\/ you should only enable one of these, doFinishBeforeNewDraw will allow for the better parallism of the two finish approaches\n \/\/ note, both are disabled right now, as glFinish is spin locking the CPU, not something that we want...\n bool doFinishBeforeNewDraw = false;\n bool doFinishAfterSwap = false;\n\n \/\/ third add the frame for each camera.\n for(citr = cameraList.begin();\n citr != cameraList.end();\n ++citr)\n {\n osg::CameraNode* camera = citr->get();\n \n \/\/ create a scene view to do the cull and draw\n osgUtil::SceneView* sceneView = new osgUtil::SceneView;\n sceneView->setDefaults();\n sceneView->setFrameStamp(frameStamp.get());\n \n if (camera->getNumChildren()>=1)\n {\n sceneView->setSceneData(camera->getChild(0));\n }\n\n \/\/ cull traversal operation\n camera->getGraphicsContext()->getGraphicsThread()->add( new CullOperation(camera, sceneView), false); \n\n \/\/ optionally add glFinish barrier to ensure that all OpenGL commands are completed before we start dispatching a new frame\n if (doFinishBeforeNewDraw) camera->getGraphicsContext()->getGraphicsThread()->add( glFinishBarrierOp.get(), false); \n\n \/\/ draw traversal operation.\n camera->getGraphicsContext()->getGraphicsThread()->add( new DrawOperation(sceneView), false); \n }\n\n \/\/ fourth add the frame end barrier, the pre swap barrier and finally the swap buffers to each graphics thread.\n \/\/ The frame end barrier tells the main thead that the draw dispatch\/read phase of the scene graph is complete.\n \/\/ The pre swap barrier is an optional extra, which does a flush before joining the barrier, using this all graphics threads\n \/\/ are held back until they have all dispatched their fifo to the graphics hardware. \n \/\/ The swapOp just issues a swap buffers for each of the graphics contexts.\n osg::ref_ptr<osg::BarrierOperation> frameEndBarrierOp = new osg::BarrierOperation(graphicsContextSet.size()+1, osg::BarrierOperation::NO_OPERATION);\n osg::ref_ptr<osg::BarrierOperation> preSwapBarrierOp = new osg::BarrierOperation(graphicsContextSet.size(), osg::BarrierOperation::GL_FLUSH);\n osg::ref_ptr<osg::SwapBuffersOperation> swapOp = new osg::SwapBuffersOperation();\n for(gitr = graphicsContextSet.begin();\n gitr != graphicsContextSet.end();\n ++gitr)\n {\n osg::GraphicsContext* context = *gitr;\n\n context->getGraphicsThread()->add(frameEndBarrierOp.get(), false);\n \/\/ context->getGraphicsThread()->add(preSwapBarrierOp.get(), false);\n context->getGraphicsThread()->add(swapOp.get(), false);\n \n \/\/ optionally add finish barrier to ensure that we don't do any other graphics work till the current OpenGL commands are complete.\n if (doFinishAfterSwap) context->getGraphicsThread()->add(glFinishBarrierOp.get(), false);\n }\n\n\n \/\/ record the timer tick at the start of rendering. \n osg::Timer_t start_tick = osg::Timer::instance()->tick();\n osg::Timer_t previous_tick = start_tick;\n \n bool done = false; \n\n \/\/ main loop - update scene graph, dispatch frame, wait for frame done.\n while( !done )\n {\n\n osg::Timer_t current_tick = osg::Timer::instance()->tick();\n\n frameStamp->setReferenceTime(osg::Timer::instance()->delta_s(start_tick,current_tick));\n frameStamp->setFrameNumber(frameNum++);\n \n \/\/std::cout<<\"Frame rate \"<<1.0\/osg::Timer::instance()->delta_s(previous_tick,current_tick)<<std::endl;\n previous_tick = current_tick;\n\n\n \/\/ do the update traversal.\n loadedModel->accept(updateVisitor);\n\n \/\/ dispatch the frame.\n frameBeginBarrierOp->block();\n \n \/\/ wait till the frame is done.\n frameEndBarrierOp->block();\n\n \/\/ check if any of the windows are closed\n for(gitr = graphicsContextSet.begin();\n gitr != graphicsContextSet.end();\n ++gitr)\n {\n osg::GraphicsContext* context = *gitr;\n if (!context->isRealized()) done = true;\n }\n\n }\n return 0;\n}\n<|endoftext|>"} {"text":"<commit_before>\/\/===-- GlobalDCE.cpp - DCE unreachable internal functions ----------------===\/\/\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 transform is designed to eliminate unreachable internal globals from the\n\/\/ program. It uses an aggressive algorithm, searching out globals that are\n\/\/ known to be alive. After it finds all of the globals which are needed, it\n\/\/ deletes whatever is left over. This allows it to delete recursive chunks of\n\/\/ the program which are unreachable.\n\/\/\n\/\/===----------------------------------------------------------------------===\/\/\n\n#define DEBUG_TYPE \"globaldce\"\n#include \"llvm\/Transforms\/IPO.h\"\n#include \"llvm\/Constants.h\"\n#include \"llvm\/Module.h\"\n#include \"llvm\/Pass.h\"\n#include \"llvm\/ADT\/Statistic.h\"\n#include \"llvm\/Support\/Compiler.h\"\n#include <set>\nusing namespace llvm;\n\nSTATISTIC(NumAliases , \"Number of global aliases removed\");\nSTATISTIC(NumFunctions, \"Number of functions removed\");\nSTATISTIC(NumVariables, \"Number of global variables removed\");\n\nnamespace {\n struct VISIBILITY_HIDDEN GlobalDCE : public ModulePass {\n static char ID; \/\/ Pass identification, replacement for typeid\n GlobalDCE() : ModulePass(&ID) {}\n\n \/\/ run - Do the GlobalDCE pass on the specified module, optionally updating\n \/\/ the specified callgraph to reflect the changes.\n \/\/\n bool runOnModule(Module &M);\n\n private:\n std::set<GlobalValue*> AliveGlobals;\n\n \/\/\/ GlobalIsNeeded - mark the specific global value as needed, and\n \/\/\/ recursively mark anything that it uses as also needed.\n void GlobalIsNeeded(GlobalValue *GV);\n void MarkUsedGlobalsAsNeeded(Constant *C);\n\n bool RemoveUnusedGlobalValue(GlobalValue &GV);\n };\n}\n\nchar GlobalDCE::ID = 0;\nstatic RegisterPass<GlobalDCE> X(\"globaldce\", \"Dead Global Elimination\");\n\nModulePass *llvm::createGlobalDCEPass() { return new GlobalDCE(); }\n\nbool GlobalDCE::runOnModule(Module &M) {\n bool Changed = false;\n \n \/\/ Loop over the module, adding globals which are obviously necessary.\n for (Module::iterator I = M.begin(), E = M.end(); I != E; ++I) {\n Changed |= RemoveUnusedGlobalValue(*I);\n \/\/ Functions with external linkage are needed if they have a body\n if (!I->hasLocalLinkage() && !I->hasLinkOnceLinkage() &&\n !I->isDeclaration() && !I->hasAvailableExternallyLinkage())\n GlobalIsNeeded(I);\n }\n\n for (Module::global_iterator I = M.global_begin(), E = M.global_end();\n I != E; ++I) {\n Changed |= RemoveUnusedGlobalValue(*I);\n \/\/ Externally visible & appending globals are needed, if they have an\n \/\/ initializer.\n if (!I->hasLocalLinkage() && !I->hasLinkOnceLinkage() &&\n !I->isDeclaration() && !I->hasAvailableExternallyLinkage())\n GlobalIsNeeded(I);\n }\n\n for (Module::alias_iterator I = M.alias_begin(), E = M.alias_end();\n I != E; ++I) {\n Changed |= RemoveUnusedGlobalValue(*I);\n \/\/ Externally visible aliases are needed.\n if (!I->hasLocalLinkage() && !I->hasLinkOnceLinkage())\n GlobalIsNeeded(I);\n }\n\n \/\/ Now that all globals which are needed are in the AliveGlobals set, we loop\n \/\/ through the program, deleting those which are not alive.\n \/\/\n\n \/\/ The first pass is to drop initializers of global variables which are dead.\n std::vector<GlobalVariable*> DeadGlobalVars; \/\/ Keep track of dead globals\n for (Module::global_iterator I = M.global_begin(), E = M.global_end(); I != E; ++I)\n if (!AliveGlobals.count(I)) {\n DeadGlobalVars.push_back(I); \/\/ Keep track of dead globals\n I->setInitializer(0);\n }\n\n \/\/ The second pass drops the bodies of functions which are dead...\n std::vector<Function*> DeadFunctions;\n for (Module::iterator I = M.begin(), E = M.end(); I != E; ++I)\n if (!AliveGlobals.count(I)) {\n DeadFunctions.push_back(I); \/\/ Keep track of dead globals\n if (!I->isDeclaration())\n I->deleteBody();\n }\n\n \/\/ The third pass drops targets of aliases which are dead...\n std::vector<GlobalAlias*> DeadAliases;\n for (Module::alias_iterator I = M.alias_begin(), E = M.alias_end(); I != E;\n ++I)\n if (!AliveGlobals.count(I)) {\n DeadAliases.push_back(I);\n I->setAliasee(0);\n }\n\n if (!DeadFunctions.empty()) {\n \/\/ Now that all interferences have been dropped, delete the actual objects\n \/\/ themselves.\n for (unsigned i = 0, e = DeadFunctions.size(); i != e; ++i) {\n RemoveUnusedGlobalValue(*DeadFunctions[i]);\n M.getFunctionList().erase(DeadFunctions[i]);\n }\n NumFunctions += DeadFunctions.size();\n Changed = true;\n }\n\n if (!DeadGlobalVars.empty()) {\n for (unsigned i = 0, e = DeadGlobalVars.size(); i != e; ++i) {\n RemoveUnusedGlobalValue(*DeadGlobalVars[i]);\n M.getGlobalList().erase(DeadGlobalVars[i]);\n }\n NumVariables += DeadGlobalVars.size();\n Changed = true;\n }\n\n \/\/ Now delete any dead aliases.\n if (!DeadAliases.empty()) {\n for (unsigned i = 0, e = DeadAliases.size(); i != e; ++i) {\n RemoveUnusedGlobalValue(*DeadAliases[i]);\n M.getAliasList().erase(DeadAliases[i]);\n }\n NumAliases += DeadAliases.size();\n Changed = true;\n }\n\n \/\/ Make sure that all memory is released\n AliveGlobals.clear();\n\n \/\/ Remove dead metadata.\n Changed |= M.getContext().RemoveDeadMetadata();\n return Changed;\n}\n\n\/\/\/ GlobalIsNeeded - the specific global value as needed, and\n\/\/\/ recursively mark anything that it uses as also needed.\nvoid GlobalDCE::GlobalIsNeeded(GlobalValue *G) {\n std::set<GlobalValue*>::iterator I = AliveGlobals.find(G);\n\n \/\/ If the global is already in the set, no need to reprocess it.\n if (I != AliveGlobals.end()) return;\n\n \/\/ Otherwise insert it now, so we do not infinitely recurse\n AliveGlobals.insert(I, G);\n\n if (GlobalVariable *GV = dyn_cast<GlobalVariable>(G)) {\n \/\/ If this is a global variable, we must make sure to add any global values\n \/\/ referenced by the initializer to the alive set.\n if (GV->hasInitializer())\n MarkUsedGlobalsAsNeeded(GV->getInitializer());\n } else if (GlobalAlias *GA = dyn_cast<GlobalAlias>(G)) {\n \/\/ The target of a global alias is needed.\n MarkUsedGlobalsAsNeeded(GA->getAliasee());\n } else {\n \/\/ Otherwise this must be a function object. We have to scan the body of\n \/\/ the function looking for constants and global values which are used as\n \/\/ operands. Any operands of these types must be processed to ensure that\n \/\/ any globals used will be marked as needed.\n Function *F = cast<Function>(G);\n \/\/ For all basic blocks...\n for (Function::iterator BB = F->begin(), E = F->end(); BB != E; ++BB)\n \/\/ For all instructions...\n for (BasicBlock::iterator I = BB->begin(), E = BB->end(); I != E; ++I)\n \/\/ For all operands...\n for (User::op_iterator U = I->op_begin(), E = I->op_end(); U != E; ++U)\n if (GlobalValue *GV = dyn_cast<GlobalValue>(*U))\n GlobalIsNeeded(GV);\n else if (Constant *C = dyn_cast<Constant>(*U))\n MarkUsedGlobalsAsNeeded(C);\n }\n}\n\nvoid GlobalDCE::MarkUsedGlobalsAsNeeded(Constant *C) {\n if (GlobalValue *GV = dyn_cast<GlobalValue>(C))\n GlobalIsNeeded(GV);\n else {\n \/\/ Loop over all of the operands of the constant, adding any globals they\n \/\/ use to the list of needed globals.\n for (User::op_iterator I = C->op_begin(), E = C->op_end(); I != E; ++I)\n MarkUsedGlobalsAsNeeded(cast<Constant>(*I));\n }\n}\n\n\/\/ RemoveUnusedGlobalValue - Loop over all of the uses of the specified\n\/\/ GlobalValue, looking for the constant pointer ref that may be pointing to it.\n\/\/ If found, check to see if the constant pointer ref is safe to destroy, and if\n\/\/ so, nuke it. This will reduce the reference count on the global value, which\n\/\/ might make it deader.\n\/\/\nbool GlobalDCE::RemoveUnusedGlobalValue(GlobalValue &GV) {\n if (GV.use_empty()) return false;\n GV.removeDeadConstantUsers();\n return GV.use_empty();\n}\n<commit_msg>Do not remove dead metadata for now.<commit_after>\/\/===-- GlobalDCE.cpp - DCE unreachable internal functions ----------------===\/\/\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 transform is designed to eliminate unreachable internal globals from the\n\/\/ program. It uses an aggressive algorithm, searching out globals that are\n\/\/ known to be alive. After it finds all of the globals which are needed, it\n\/\/ deletes whatever is left over. This allows it to delete recursive chunks of\n\/\/ the program which are unreachable.\n\/\/\n\/\/===----------------------------------------------------------------------===\/\/\n\n#define DEBUG_TYPE \"globaldce\"\n#include \"llvm\/Transforms\/IPO.h\"\n#include \"llvm\/Constants.h\"\n#include \"llvm\/Module.h\"\n#include \"llvm\/Pass.h\"\n#include \"llvm\/ADT\/Statistic.h\"\n#include \"llvm\/Support\/Compiler.h\"\n#include <set>\nusing namespace llvm;\n\nSTATISTIC(NumAliases , \"Number of global aliases removed\");\nSTATISTIC(NumFunctions, \"Number of functions removed\");\nSTATISTIC(NumVariables, \"Number of global variables removed\");\n\nnamespace {\n struct VISIBILITY_HIDDEN GlobalDCE : public ModulePass {\n static char ID; \/\/ Pass identification, replacement for typeid\n GlobalDCE() : ModulePass(&ID) {}\n\n \/\/ run - Do the GlobalDCE pass on the specified module, optionally updating\n \/\/ the specified callgraph to reflect the changes.\n \/\/\n bool runOnModule(Module &M);\n\n private:\n std::set<GlobalValue*> AliveGlobals;\n\n \/\/\/ GlobalIsNeeded - mark the specific global value as needed, and\n \/\/\/ recursively mark anything that it uses as also needed.\n void GlobalIsNeeded(GlobalValue *GV);\n void MarkUsedGlobalsAsNeeded(Constant *C);\n\n bool RemoveUnusedGlobalValue(GlobalValue &GV);\n };\n}\n\nchar GlobalDCE::ID = 0;\nstatic RegisterPass<GlobalDCE> X(\"globaldce\", \"Dead Global Elimination\");\n\nModulePass *llvm::createGlobalDCEPass() { return new GlobalDCE(); }\n\nbool GlobalDCE::runOnModule(Module &M) {\n bool Changed = false;\n \n \/\/ Loop over the module, adding globals which are obviously necessary.\n for (Module::iterator I = M.begin(), E = M.end(); I != E; ++I) {\n Changed |= RemoveUnusedGlobalValue(*I);\n \/\/ Functions with external linkage are needed if they have a body\n if (!I->hasLocalLinkage() && !I->hasLinkOnceLinkage() &&\n !I->isDeclaration() && !I->hasAvailableExternallyLinkage())\n GlobalIsNeeded(I);\n }\n\n for (Module::global_iterator I = M.global_begin(), E = M.global_end();\n I != E; ++I) {\n Changed |= RemoveUnusedGlobalValue(*I);\n \/\/ Externally visible & appending globals are needed, if they have an\n \/\/ initializer.\n if (!I->hasLocalLinkage() && !I->hasLinkOnceLinkage() &&\n !I->isDeclaration() && !I->hasAvailableExternallyLinkage())\n GlobalIsNeeded(I);\n }\n\n for (Module::alias_iterator I = M.alias_begin(), E = M.alias_end();\n I != E; ++I) {\n Changed |= RemoveUnusedGlobalValue(*I);\n \/\/ Externally visible aliases are needed.\n if (!I->hasLocalLinkage() && !I->hasLinkOnceLinkage())\n GlobalIsNeeded(I);\n }\n\n \/\/ Now that all globals which are needed are in the AliveGlobals set, we loop\n \/\/ through the program, deleting those which are not alive.\n \/\/\n\n \/\/ The first pass is to drop initializers of global variables which are dead.\n std::vector<GlobalVariable*> DeadGlobalVars; \/\/ Keep track of dead globals\n for (Module::global_iterator I = M.global_begin(), E = M.global_end(); I != E; ++I)\n if (!AliveGlobals.count(I)) {\n DeadGlobalVars.push_back(I); \/\/ Keep track of dead globals\n I->setInitializer(0);\n }\n\n \/\/ The second pass drops the bodies of functions which are dead...\n std::vector<Function*> DeadFunctions;\n for (Module::iterator I = M.begin(), E = M.end(); I != E; ++I)\n if (!AliveGlobals.count(I)) {\n DeadFunctions.push_back(I); \/\/ Keep track of dead globals\n if (!I->isDeclaration())\n I->deleteBody();\n }\n\n \/\/ The third pass drops targets of aliases which are dead...\n std::vector<GlobalAlias*> DeadAliases;\n for (Module::alias_iterator I = M.alias_begin(), E = M.alias_end(); I != E;\n ++I)\n if (!AliveGlobals.count(I)) {\n DeadAliases.push_back(I);\n I->setAliasee(0);\n }\n\n if (!DeadFunctions.empty()) {\n \/\/ Now that all interferences have been dropped, delete the actual objects\n \/\/ themselves.\n for (unsigned i = 0, e = DeadFunctions.size(); i != e; ++i) {\n RemoveUnusedGlobalValue(*DeadFunctions[i]);\n M.getFunctionList().erase(DeadFunctions[i]);\n }\n NumFunctions += DeadFunctions.size();\n Changed = true;\n }\n\n if (!DeadGlobalVars.empty()) {\n for (unsigned i = 0, e = DeadGlobalVars.size(); i != e; ++i) {\n RemoveUnusedGlobalValue(*DeadGlobalVars[i]);\n M.getGlobalList().erase(DeadGlobalVars[i]);\n }\n NumVariables += DeadGlobalVars.size();\n Changed = true;\n }\n\n \/\/ Now delete any dead aliases.\n if (!DeadAliases.empty()) {\n for (unsigned i = 0, e = DeadAliases.size(); i != e; ++i) {\n RemoveUnusedGlobalValue(*DeadAliases[i]);\n M.getAliasList().erase(DeadAliases[i]);\n }\n NumAliases += DeadAliases.size();\n Changed = true;\n }\n\n \/\/ Make sure that all memory is released\n AliveGlobals.clear();\n\n \/\/ Remove dead metadata.\n \/\/ FIXME - Enable this.\n \/\/ Changed |= M.getContext().RemoveDeadMetadata();\n return Changed;\n}\n\n\/\/\/ GlobalIsNeeded - the specific global value as needed, and\n\/\/\/ recursively mark anything that it uses as also needed.\nvoid GlobalDCE::GlobalIsNeeded(GlobalValue *G) {\n std::set<GlobalValue*>::iterator I = AliveGlobals.find(G);\n\n \/\/ If the global is already in the set, no need to reprocess it.\n if (I != AliveGlobals.end()) return;\n\n \/\/ Otherwise insert it now, so we do not infinitely recurse\n AliveGlobals.insert(I, G);\n\n if (GlobalVariable *GV = dyn_cast<GlobalVariable>(G)) {\n \/\/ If this is a global variable, we must make sure to add any global values\n \/\/ referenced by the initializer to the alive set.\n if (GV->hasInitializer())\n MarkUsedGlobalsAsNeeded(GV->getInitializer());\n } else if (GlobalAlias *GA = dyn_cast<GlobalAlias>(G)) {\n \/\/ The target of a global alias is needed.\n MarkUsedGlobalsAsNeeded(GA->getAliasee());\n } else {\n \/\/ Otherwise this must be a function object. We have to scan the body of\n \/\/ the function looking for constants and global values which are used as\n \/\/ operands. Any operands of these types must be processed to ensure that\n \/\/ any globals used will be marked as needed.\n Function *F = cast<Function>(G);\n \/\/ For all basic blocks...\n for (Function::iterator BB = F->begin(), E = F->end(); BB != E; ++BB)\n \/\/ For all instructions...\n for (BasicBlock::iterator I = BB->begin(), E = BB->end(); I != E; ++I)\n \/\/ For all operands...\n for (User::op_iterator U = I->op_begin(), E = I->op_end(); U != E; ++U)\n if (GlobalValue *GV = dyn_cast<GlobalValue>(*U))\n GlobalIsNeeded(GV);\n else if (Constant *C = dyn_cast<Constant>(*U))\n MarkUsedGlobalsAsNeeded(C);\n }\n}\n\nvoid GlobalDCE::MarkUsedGlobalsAsNeeded(Constant *C) {\n if (GlobalValue *GV = dyn_cast<GlobalValue>(C))\n GlobalIsNeeded(GV);\n else {\n \/\/ Loop over all of the operands of the constant, adding any globals they\n \/\/ use to the list of needed globals.\n for (User::op_iterator I = C->op_begin(), E = C->op_end(); I != E; ++I)\n MarkUsedGlobalsAsNeeded(cast<Constant>(*I));\n }\n}\n\n\/\/ RemoveUnusedGlobalValue - Loop over all of the uses of the specified\n\/\/ GlobalValue, looking for the constant pointer ref that may be pointing to it.\n\/\/ If found, check to see if the constant pointer ref is safe to destroy, and if\n\/\/ so, nuke it. This will reduce the reference count on the global value, which\n\/\/ might make it deader.\n\/\/\nbool GlobalDCE::RemoveUnusedGlobalValue(GlobalValue &GV) {\n if (GV.use_empty()) return false;\n GV.removeDeadConstantUsers();\n return GV.use_empty();\n}\n<|endoftext|>"} {"text":"<commit_before>#include <stan\/io\/mcmc_writer.hpp>\n#include <test\/test-models\/no-main\/io_example.cpp>\n\n#include <vector>\n#include <boost\/random\/additive_combine.hpp>\n\n#include <stan\/mcmc\/sample.hpp>\n#include <stan\/mcmc\/hmc\/nuts\/diag_e_nuts.hpp>\n\n#include <sstream>\n#include <string>\n\n#include <gtest\/gtest.h>\n\n\nTEST(StanIoMcmcWriter, write_sample_names) {\n \n \/\/ Model\n std::fstream data_stream(\"\", std::fstream::in);\n stan::io::dump data_var_context(data_stream);\n data_stream.close();\n \n io_example_model_namespace::io_example_model model(data_var_context, &std::cout);\n \n \/\/ Sample\n Eigen::VectorXd real(2);\n real(0) = 1.43;\n real(1) = 2.71;\n \n double log_prob = 3.14;\n double accept_stat = 0.84;\n \n stan::mcmc::sample sample(real, log_prob, accept_stat);\n \n \/\/ Sampler\n typedef boost::ecuyer1988 rng_t;\n rng_t base_rng(0);\n \n stan::mcmc::adapt_diag_e_nuts<io_example_model_namespace::io_example_model, rng_t> sampler(model, base_rng, 0);\n sampler.seed(real);\n \n \/\/ Writer\n std::stringstream sample_stream;\n std::stringstream diagnostic_stream;\n\n stan::common::recorder::csv sample_recorder(&sample_stream, \"# \");\n stan::common::recorder::csv diagnostic_recorder(&diagnostic_stream, \"# \");\n\n stan::io::mcmc_writer<io_example_model_namespace::io_example_model,\n stan::common::recorder::csv,\n stan::common::recorder::csv> \n writer(sample_recorder, diagnostic_recorder);\n \n writer.write_sample_names(sample, &sampler, model);\n \n std::string line;\n std::getline(sample_stream, line);\n \n EXPECT_EQ(\"lp__,accept_stat__,stepsize__,treedepth__,n_leapfrog__,n_divergent__,mu1,mu2\", line);\n \n}\n\nTEST(StanIoMcmcWriter, write_sample_params) {\n \n \/\/ Model\n std::fstream data_stream(\"\", std::fstream::in);\n stan::io::dump data_var_context(data_stream);\n data_stream.close();\n \n io_example_model_namespace::io_example_model model(data_var_context, &std::cout);\n \n \/\/ Sample\n Eigen::VectorXd real(2);\n real(0) = 1.43;\n real(1) = 2.71;\n \n double log_prob = 3.14;\n double accept_stat = 0.84;\n \n stan::mcmc::sample sample(real, log_prob, accept_stat);\n \n \/\/ Sampler\n typedef boost::ecuyer1988 rng_t;\n rng_t base_rng(0);\n \n stan::mcmc::adapt_diag_e_nuts<io_example_model_namespace::io_example_model, rng_t> sampler(model, base_rng, 0);\n sampler.seed(real);\n \n \/\/ Writer\n std::stringstream sample_stream;\n std::stringstream diagnostic_stream;\n\n stan::common::recorder::csv sample_recorder(&sample_stream, \"# \");\n stan::common::recorder::csv diagnostic_recorder(&diagnostic_stream, \"# \");\n \n stan::io::mcmc_writer<io_example_model_namespace::io_example_model,\n stan::common::recorder::csv,\n stan::common::recorder::csv> writer(sample_recorder, diagnostic_recorder);\n \n writer.write_sample_params<rng_t>(base_rng, sample, sampler, model);\n \n std::string line;\n std::getline(sample_stream, line);\n \n std::stringstream expected_stream;\n expected_stream << log_prob << \",\";\n expected_stream << accept_stat << \",\";\n expected_stream << sampler.get_current_stepsize() << \",\";\n expected_stream << 0 << \",\";\n expected_stream << 0 << \",\";\n expected_stream << 0 << \",\";\n expected_stream << real(0) << \",\";\n expected_stream << real(1);\n \n std::string expected_line;\n std::getline(expected_stream, expected_line);\n \n EXPECT_EQ(expected_line, line);\n \n}\n\nTEST(StanIoMcmcWriter, write_adapt_finish) {\n \n \/\/ Model\n std::fstream data_stream(\"\", std::fstream::in);\n stan::io::dump data_var_context(data_stream);\n data_stream.close();\n \n io_example_model_namespace::io_example_model model(data_var_context, &std::cout);\n \n \/\/ Sample\n Eigen::VectorXd real(2);\n real(0) = 1.43;\n real(1) = 2.71;\n \n double log_prob = 3.14;\n double accept_stat = 0.84;\n \n stan::mcmc::sample sample(real, log_prob, accept_stat);\n \n \/\/ Sampler\n typedef boost::ecuyer1988 rng_t;\n rng_t base_rng(0);\n \n stan::mcmc::adapt_diag_e_nuts<io_example_model_namespace::io_example_model, rng_t> sampler(model, base_rng, 0);\n sampler.seed(real);\n \n \/\/ Writer\n std::stringstream sample_stream;\n std::stringstream diagnostic_stream;\n \n stan::common::recorder::csv sample_recorder(&sample_stream, \"# \");\n stan::common::recorder::csv diagnostic_recorder(&diagnostic_stream, \"# \");\n\n stan::io::mcmc_writer<io_example_model_namespace::io_example_model,\n stan::common::recorder::csv,\n stan::common::recorder::csv> \n writer(sample_recorder, diagnostic_recorder);\n \n writer.write_adapt_finish(&sampler);\n \n std::stringstream expected_stream;\n expected_stream << \"# Adaptation terminated\" << std::endl;\n expected_stream << \"# Step size = \" << sampler.get_current_stepsize() << std::endl;\n expected_stream << \"# Diagonal elements of inverse mass matrix:\" << std::endl;\n expected_stream << \"# \" << sampler.z().mInv(0) << \", \" << sampler.z().mInv(1) << std::endl;\n \n std::string line;\n std::string expected_line;\n \n \/\/ Line 1\n std::getline(expected_stream, expected_line);\n \n std::getline(sample_stream, line);\n EXPECT_EQ(expected_line, line);\n \n std::getline(diagnostic_stream, line);\n EXPECT_EQ(expected_line, line);\n \n \/\/ Line 2\n std::getline(expected_stream, expected_line);\n \n std::getline(sample_stream, line);\n EXPECT_EQ(expected_line, line);\n \n std::getline(diagnostic_stream, line);\n EXPECT_EQ(expected_line, line);\n \n \/\/ Line 3\n std::getline(expected_stream, expected_line);\n \n std::getline(sample_stream, line);\n EXPECT_EQ(expected_line, line);\n \n std::getline(diagnostic_stream, line);\n EXPECT_EQ(expected_line, line);\n \n \/\/ Line 4\n std::getline(expected_stream, expected_line);\n \n std::getline(sample_stream, line);\n EXPECT_EQ(expected_line, line);\n \n std::getline(diagnostic_stream, line);\n EXPECT_EQ(expected_line, line);\n \n}\n\nTEST(StanIoMcmcWriter, write_diagnostic_names) {\n \n \/\/ Model\n std::fstream data_stream(\"\", std::fstream::in);\n stan::io::dump data_var_context(data_stream);\n data_stream.close();\n \n io_example_model_namespace::io_example_model model(data_var_context, &std::cout);\n \n \/\/ Sample\n Eigen::VectorXd real(2);\n real(0) = 1.43;\n real(1) = 2.71;\n \n double log_prob = 3.14;\n double accept_stat = 0.84;\n \n stan::mcmc::sample sample(real, log_prob, accept_stat);\n \n \/\/ Sampler\n typedef boost::ecuyer1988 rng_t;\n rng_t base_rng(0);\n \n stan::mcmc::adapt_diag_e_nuts<io_example_model_namespace::io_example_model, rng_t> sampler(model, base_rng, 0);\n sampler.seed(real);\n \n \/\/ Writer\n std::stringstream sample_stream;\n std::stringstream diagnostic_stream;\n \n stan::common::recorder::csv sample_recorder(&sample_stream, \"# \");\n stan::common::recorder::csv diagnostic_recorder(&diagnostic_stream, \"# \");\n\n stan::io::mcmc_writer<io_example_model_namespace::io_example_model,\n stan::common::recorder::csv,\n stan::common::recorder::csv> \n writer(sample_recorder, diagnostic_recorder);\n \n writer.write_diagnostic_names(sample, &sampler, model);\n \n std::string line;\n std::getline(diagnostic_stream, line);\n \n \/\/ FIXME: make this work, too\n EXPECT_EQ(\"lp__,accept_stat__,stepsize__,treedepth__,n_leapfrog__,n_divergent__,mu1,mu2,p_mu1,p_mu2,g_mu1,g_mu2\", line);\n \n}\n\nTEST(StanIoMcmcWriter, write_diagnostic_params) {\n \n \/\/ Model\n std::fstream data_stream(\"\", std::fstream::in);\n stan::io::dump data_var_context(data_stream);\n data_stream.close();\n \n io_example_model_namespace::io_example_model model(data_var_context, &std::cout);\n \n \/\/ Sample\n Eigen::VectorXd real(2);\n real(0) = 1.43;\n real(1) = 2.71;\n \n double log_prob = 3.14;\n double accept_stat = 0.84;\n \n stan::mcmc::sample sample(real, log_prob, accept_stat);\n \n \/\/ Sampler\n typedef boost::ecuyer1988 rng_t;\n rng_t base_rng(0);\n \n stan::mcmc::adapt_diag_e_nuts<io_example_model_namespace::io_example_model, rng_t> sampler(model, base_rng, 0);\n sampler.seed(real);\n sampler.z().p(0) = 0;\n sampler.z().p(1) = 0;\n sampler.z().g(0) = 0;\n sampler.z().g(1) = 0;\n \n \/\/ Writer\n std::stringstream sample_stream;\n std::stringstream diagnostic_stream;\n \n stan::common::recorder::csv sample_recorder(&sample_stream, \"# \");\n stan::common::recorder::csv diagnostic_recorder(&diagnostic_stream, \"# \");\n\n stan::io::mcmc_writer<io_example_model_namespace::io_example_model,\n stan::common::recorder::csv,\n stan::common::recorder::csv> \n writer(sample_recorder, diagnostic_recorder);\n \n writer.write_diagnostic_params(sample, &sampler);\n \n std::string line;\n std::getline(diagnostic_stream, line);\n \n std::stringstream expected_stream;\n expected_stream << log_prob << \",\";\n expected_stream << accept_stat << \",\";\n expected_stream << sampler.get_current_stepsize() << \",\";\n expected_stream << 0 << \",\";\n expected_stream << 0 << \",\";\n expected_stream << 0 << \",\";\n expected_stream << real(0) << \",\";\n expected_stream << real(1) << \",\";\n expected_stream << 0 << \",\";\n expected_stream << 0 << \",\";\n expected_stream << 0 << \",\";\n expected_stream << 0;\n \n std::string expected_line;\n std::getline(expected_stream, expected_line);\n \n EXPECT_EQ(expected_line, line);\n \n}\n\nTEST(StanIoMcmcWriter, write_timing) {\n \n \/\/ Model\n std::fstream data_stream(\"\", std::fstream::in);\n stan::io::dump data_var_context(data_stream);\n data_stream.close();\n \n io_example_model_namespace::io_example_model model(data_var_context, &std::cout);\n \n \/\/ Sample\n Eigen::VectorXd real(2);\n real(0) = 1.43;\n real(1) = 2.71;\n \n double log_prob = 3.14;\n double accept_stat = 0.84;\n \n stan::mcmc::sample sample(real, log_prob, accept_stat);\n \n \/\/ Sampler\n typedef boost::ecuyer1988 rng_t;\n rng_t base_rng(0);\n \n stan::mcmc::adapt_diag_e_nuts<io_example_model_namespace::io_example_model, rng_t> sampler(model, base_rng, 0);\n sampler.seed(real);\n \n \/\/ Writer\n std::stringstream sample_stream;\n std::stringstream diagnostic_stream;\n \n stan::common::recorder::csv sample_recorder(&sample_stream, \"# \");\n stan::common::recorder::csv diagnostic_recorder(&diagnostic_stream, \"# \");\n\n stan::io::mcmc_writer<io_example_model_namespace::io_example_model,\n stan::common::recorder::csv,\n stan::common::recorder::csv> \n writer(sample_recorder, diagnostic_recorder);\n \n double warm = 0.193933;\n double sampling = 0.483830;\n\n writer.write_timing(warm, sampling, sample_recorder);\n\n std::stringstream expected_stream;\n expected_stream << std::endl;\n expected_stream << \"# Elapsed Time: \" << warm << \" seconds (Warm-up)\" << std::endl;\n expected_stream << \"# \" << sampling << \" seconds (Sampling)\" << std::endl;\n expected_stream << \"# \" << warm + sampling << \" seconds (Total)\" << std::endl;\n expected_stream << std::endl;\n \n std::string line;\n std::string expected_line;\n\n \/\/ Line 1\n std::getline(expected_stream, expected_line);\n \n std::getline(sample_stream, line);\n EXPECT_EQ(expected_line, line);\n \n std::getline(diagnostic_stream, line);\n EXPECT_EQ(expected_line, line);\n \n \/\/ Line 2\n std::getline(expected_stream, expected_line);\n \n std::getline(sample_stream, line);\n EXPECT_EQ(expected_line, line);\n \n std::getline(diagnostic_stream, line);\n EXPECT_EQ(expected_line, line);\n \n \/\/ Line 3\n std::getline(expected_stream, expected_line);\n \n std::getline(sample_stream, line);\n EXPECT_EQ(expected_line, line);\n \n std::getline(diagnostic_stream, line);\n EXPECT_EQ(expected_line, line);\n \n \/\/ Line 4\n std::getline(expected_stream, expected_line);\n \n std::getline(sample_stream, line);\n EXPECT_EQ(expected_line, line);\n \n std::getline(diagnostic_stream, line);\n EXPECT_EQ(expected_line, line);\n \n \/\/ Line 5\n std::getline(expected_stream, expected_line);\n \n std::getline(sample_stream, line);\n EXPECT_EQ(expected_line, line);\n \n std::getline(diagnostic_stream, line);\n EXPECT_EQ(expected_line, line);\n \n}\n<commit_msg>fixed src\/test\/unit<commit_after>#include <stan\/io\/mcmc_writer.hpp>\n#include <test\/test-models\/no-main\/io_example.cpp>\n\n#include <vector>\n#include <boost\/random\/additive_combine.hpp>\n\n#include <stan\/mcmc\/sample.hpp>\n#include <stan\/mcmc\/hmc\/nuts\/diag_e_nuts.hpp>\n\n#include <sstream>\n#include <string>\n\n#include <gtest\/gtest.h>\n\n\nTEST(StanIoMcmcWriter, write_sample_names) {\n \n \/\/ Model\n std::fstream data_stream(\"\", std::fstream::in);\n stan::io::dump data_var_context(data_stream);\n data_stream.close();\n \n io_example_model_namespace::io_example_model model(data_var_context, &std::cout);\n \n \/\/ Sample\n Eigen::VectorXd real(2);\n real(0) = 1.43;\n real(1) = 2.71;\n \n double log_prob = 3.14;\n double accept_stat = 0.84;\n \n stan::mcmc::sample sample(real, log_prob, accept_stat);\n \n \/\/ Sampler\n typedef boost::ecuyer1988 rng_t;\n rng_t base_rng(0);\n \n stan::mcmc::adapt_diag_e_nuts<io_example_model_namespace::io_example_model, rng_t> sampler(model, base_rng, 0);\n sampler.seed(real);\n \n \/\/ Writer\n std::stringstream sample_stream;\n std::stringstream diagnostic_stream;\n std::stringstream message_stream;\n\n stan::common::recorder::csv sample_recorder(&sample_stream, \"# \");\n stan::common::recorder::csv diagnostic_recorder(&diagnostic_stream, \"# \");\n stan::common::recorder::messages message_recorder(&message_stream, \"# \");\n\n stan::io::mcmc_writer<io_example_model_namespace::io_example_model,\n stan::common::recorder::csv,\n stan::common::recorder::csv,\n stan::common::recorder::messages> \n writer(sample_recorder, diagnostic_recorder, message_recorder);\n \n writer.write_sample_names(sample, &sampler, model);\n \n std::string line;\n std::getline(sample_stream, line);\n \n EXPECT_EQ(\"lp__,accept_stat__,stepsize__,treedepth__,n_leapfrog__,n_divergent__,mu1,mu2\", line);\n EXPECT_EQ(\"\", message_stream.str());\n}\n\nTEST(StanIoMcmcWriter, write_sample_params) {\n \n \/\/ Model\n std::fstream data_stream(\"\", std::fstream::in);\n stan::io::dump data_var_context(data_stream);\n data_stream.close();\n \n io_example_model_namespace::io_example_model model(data_var_context, &std::cout);\n \n \/\/ Sample\n Eigen::VectorXd real(2);\n real(0) = 1.43;\n real(1) = 2.71;\n \n double log_prob = 3.14;\n double accept_stat = 0.84;\n \n stan::mcmc::sample sample(real, log_prob, accept_stat);\n \n \/\/ Sampler\n typedef boost::ecuyer1988 rng_t;\n rng_t base_rng(0);\n \n stan::mcmc::adapt_diag_e_nuts<io_example_model_namespace::io_example_model, rng_t> sampler(model, base_rng, 0);\n sampler.seed(real);\n \n \/\/ Writer\n std::stringstream sample_stream;\n std::stringstream diagnostic_stream;\n std::stringstream message_stream;\n\n stan::common::recorder::csv sample_recorder(&sample_stream, \"# \");\n stan::common::recorder::csv diagnostic_recorder(&diagnostic_stream, \"# \");\n stan::common::recorder::messages message_recorder(&message_stream, \"# \");\n\n stan::io::mcmc_writer<io_example_model_namespace::io_example_model,\n stan::common::recorder::csv,\n stan::common::recorder::csv,\n stan::common::recorder::messages> \n writer(sample_recorder, diagnostic_recorder, message_recorder);\n \n writer.write_sample_params<rng_t>(base_rng, sample, sampler, model);\n \n std::string line;\n std::getline(sample_stream, line);\n \n std::stringstream expected_stream;\n expected_stream << log_prob << \",\";\n expected_stream << accept_stat << \",\";\n expected_stream << sampler.get_current_stepsize() << \",\";\n expected_stream << 0 << \",\";\n expected_stream << 0 << \",\";\n expected_stream << 0 << \",\";\n expected_stream << real(0) << \",\";\n expected_stream << real(1);\n \n std::string expected_line;\n std::getline(expected_stream, expected_line);\n \n EXPECT_EQ(expected_line, line);\n EXPECT_EQ(\"\", message_stream.str());\n}\n\nTEST(StanIoMcmcWriter, write_adapt_finish) {\n \n \/\/ Model\n std::fstream data_stream(\"\", std::fstream::in);\n stan::io::dump data_var_context(data_stream);\n data_stream.close();\n \n io_example_model_namespace::io_example_model model(data_var_context, &std::cout);\n \n \/\/ Sample\n Eigen::VectorXd real(2);\n real(0) = 1.43;\n real(1) = 2.71;\n \n double log_prob = 3.14;\n double accept_stat = 0.84;\n \n stan::mcmc::sample sample(real, log_prob, accept_stat);\n \n \/\/ Sampler\n typedef boost::ecuyer1988 rng_t;\n rng_t base_rng(0);\n \n stan::mcmc::adapt_diag_e_nuts<io_example_model_namespace::io_example_model, rng_t> sampler(model, base_rng, 0);\n sampler.seed(real);\n \n \/\/ Writer\n std::stringstream sample_stream;\n std::stringstream diagnostic_stream;\n std::stringstream message_stream;\n \n stan::common::recorder::csv sample_recorder(&sample_stream, \"# \");\n stan::common::recorder::csv diagnostic_recorder(&diagnostic_stream, \"# \");\n stan::common::recorder::messages message_recorder(&message_stream, \"# \");\n\n stan::io::mcmc_writer<io_example_model_namespace::io_example_model,\n stan::common::recorder::csv,\n stan::common::recorder::csv,\n stan::common::recorder::messages> \n writer(sample_recorder, diagnostic_recorder, message_recorder);\n \n writer.write_adapt_finish(&sampler);\n \n std::stringstream expected_stream;\n expected_stream << \"# Adaptation terminated\" << std::endl;\n expected_stream << \"# Step size = \" << sampler.get_current_stepsize() << std::endl;\n expected_stream << \"# Diagonal elements of inverse mass matrix:\" << std::endl;\n expected_stream << \"# \" << sampler.z().mInv(0) << \", \" << sampler.z().mInv(1) << std::endl;\n \n std::string line;\n std::string expected_line;\n \n \/\/ Line 1\n std::getline(expected_stream, expected_line);\n \n std::getline(sample_stream, line);\n EXPECT_EQ(expected_line, line);\n \n std::getline(diagnostic_stream, line);\n EXPECT_EQ(expected_line, line);\n \n \/\/ Line 2\n std::getline(expected_stream, expected_line);\n \n std::getline(sample_stream, line);\n EXPECT_EQ(expected_line, line);\n \n std::getline(diagnostic_stream, line);\n EXPECT_EQ(expected_line, line);\n \n \/\/ Line 3\n std::getline(expected_stream, expected_line);\n \n std::getline(sample_stream, line);\n EXPECT_EQ(expected_line, line);\n \n std::getline(diagnostic_stream, line);\n EXPECT_EQ(expected_line, line);\n \n \/\/ Line 4\n std::getline(expected_stream, expected_line);\n \n std::getline(sample_stream, line);\n EXPECT_EQ(expected_line, line);\n \n std::getline(diagnostic_stream, line);\n EXPECT_EQ(expected_line, line);\n \n EXPECT_EQ(\"\", message_stream.str());\n}\n\nTEST(StanIoMcmcWriter, write_diagnostic_names) {\n \n \/\/ Model\n std::fstream data_stream(\"\", std::fstream::in);\n stan::io::dump data_var_context(data_stream);\n data_stream.close();\n \n io_example_model_namespace::io_example_model model(data_var_context, &std::cout);\n \n \/\/ Sample\n Eigen::VectorXd real(2);\n real(0) = 1.43;\n real(1) = 2.71;\n \n double log_prob = 3.14;\n double accept_stat = 0.84;\n \n stan::mcmc::sample sample(real, log_prob, accept_stat);\n \n \/\/ Sampler\n typedef boost::ecuyer1988 rng_t;\n rng_t base_rng(0);\n \n stan::mcmc::adapt_diag_e_nuts<io_example_model_namespace::io_example_model, rng_t> sampler(model, base_rng, 0);\n sampler.seed(real);\n \n \/\/ Writer\n std::stringstream sample_stream;\n std::stringstream diagnostic_stream;\n std::stringstream message_stream;\n \n stan::common::recorder::csv sample_recorder(&sample_stream, \"# \");\n stan::common::recorder::csv diagnostic_recorder(&diagnostic_stream, \"# \");\n stan::common::recorder::messages message_recorder(&message_stream, \"# \");\n\n stan::io::mcmc_writer<io_example_model_namespace::io_example_model,\n stan::common::recorder::csv,\n stan::common::recorder::csv,\n stan::common::recorder::messages> \n writer(sample_recorder, diagnostic_recorder, message_recorder);\n \n writer.write_diagnostic_names(sample, &sampler, model);\n \n std::string line;\n std::getline(diagnostic_stream, line);\n \n \/\/ FIXME: make this work, too\n EXPECT_EQ(\"lp__,accept_stat__,stepsize__,treedepth__,n_leapfrog__,n_divergent__,mu1,mu2,p_mu1,p_mu2,g_mu1,g_mu2\", line);\n \n EXPECT_EQ(\"\", message_stream.str());\n}\n\nTEST(StanIoMcmcWriter, write_diagnostic_params) {\n \n \/\/ Model\n std::fstream data_stream(\"\", std::fstream::in);\n stan::io::dump data_var_context(data_stream);\n data_stream.close();\n \n io_example_model_namespace::io_example_model model(data_var_context, &std::cout);\n \n \/\/ Sample\n Eigen::VectorXd real(2);\n real(0) = 1.43;\n real(1) = 2.71;\n \n double log_prob = 3.14;\n double accept_stat = 0.84;\n \n stan::mcmc::sample sample(real, log_prob, accept_stat);\n \n \/\/ Sampler\n typedef boost::ecuyer1988 rng_t;\n rng_t base_rng(0);\n \n stan::mcmc::adapt_diag_e_nuts<io_example_model_namespace::io_example_model, rng_t> sampler(model, base_rng, 0);\n sampler.seed(real);\n sampler.z().p(0) = 0;\n sampler.z().p(1) = 0;\n sampler.z().g(0) = 0;\n sampler.z().g(1) = 0;\n \n \/\/ Writer\n std::stringstream sample_stream;\n std::stringstream diagnostic_stream;\n std::stringstream message_stream;\n \n stan::common::recorder::csv sample_recorder(&sample_stream, \"# \");\n stan::common::recorder::csv diagnostic_recorder(&diagnostic_stream, \"# \");\n stan::common::recorder::messages message_recorder(&message_stream, \"# \");\n\n stan::io::mcmc_writer<io_example_model_namespace::io_example_model,\n stan::common::recorder::csv,\n stan::common::recorder::csv,\n stan::common::recorder::messages> \n writer(sample_recorder, diagnostic_recorder, message_recorder);\n \n writer.write_diagnostic_params(sample, &sampler);\n \n std::string line;\n std::getline(diagnostic_stream, line);\n \n std::stringstream expected_stream;\n expected_stream << log_prob << \",\";\n expected_stream << accept_stat << \",\";\n expected_stream << sampler.get_current_stepsize() << \",\";\n expected_stream << 0 << \",\";\n expected_stream << 0 << \",\";\n expected_stream << 0 << \",\";\n expected_stream << real(0) << \",\";\n expected_stream << real(1) << \",\";\n expected_stream << 0 << \",\";\n expected_stream << 0 << \",\";\n expected_stream << 0 << \",\";\n expected_stream << 0;\n \n std::string expected_line;\n std::getline(expected_stream, expected_line);\n \n EXPECT_EQ(expected_line, line);\n \n}\n\nTEST(StanIoMcmcWriter, write_timing) {\n \n \/\/ Model\n std::fstream data_stream(\"\", std::fstream::in);\n stan::io::dump data_var_context(data_stream);\n data_stream.close();\n \n io_example_model_namespace::io_example_model model(data_var_context, &std::cout);\n \n \/\/ Sample\n Eigen::VectorXd real(2);\n real(0) = 1.43;\n real(1) = 2.71;\n \n double log_prob = 3.14;\n double accept_stat = 0.84;\n \n stan::mcmc::sample sample(real, log_prob, accept_stat);\n \n \/\/ Sampler\n typedef boost::ecuyer1988 rng_t;\n rng_t base_rng(0);\n \n stan::mcmc::adapt_diag_e_nuts<io_example_model_namespace::io_example_model, rng_t> sampler(model, base_rng, 0);\n sampler.seed(real);\n \n \/\/ Writer\n std::stringstream sample_stream;\n std::stringstream diagnostic_stream;\n std::stringstream message_stream;\n \n stan::common::recorder::csv sample_recorder(&sample_stream, \"# \");\n stan::common::recorder::csv diagnostic_recorder(&diagnostic_stream, \"# \");\n stan::common::recorder::messages message_recorder(&message_stream, \"# \");\n\n stan::io::mcmc_writer<io_example_model_namespace::io_example_model,\n stan::common::recorder::csv,\n stan::common::recorder::csv,\n stan::common::recorder::messages> \n writer(sample_recorder, diagnostic_recorder, message_recorder);\n \n double warm = 0.193933;\n double sampling = 0.483830;\n\n writer.write_timing(warm, sampling, sample_recorder);\n\n std::stringstream expected_stream;\n expected_stream << std::endl;\n expected_stream << \"# Elapsed Time: \" << warm << \" seconds (Warm-up)\" << std::endl;\n expected_stream << \"# \" << sampling << \" seconds (Sampling)\" << std::endl;\n expected_stream << \"# \" << warm + sampling << \" seconds (Total)\" << std::endl;\n expected_stream << std::endl;\n \n std::string line;\n std::string expected_line;\n\n \/\/ Line 1\n std::getline(expected_stream, expected_line);\n \n std::getline(sample_stream, line);\n EXPECT_EQ(expected_line, line);\n \n std::getline(diagnostic_stream, line);\n EXPECT_EQ(expected_line, line);\n \n \/\/ Line 2\n std::getline(expected_stream, expected_line);\n \n std::getline(sample_stream, line);\n EXPECT_EQ(expected_line, line);\n \n std::getline(diagnostic_stream, line);\n EXPECT_EQ(expected_line, line);\n \n \/\/ Line 3\n std::getline(expected_stream, expected_line);\n \n std::getline(sample_stream, line);\n EXPECT_EQ(expected_line, line);\n \n std::getline(diagnostic_stream, line);\n EXPECT_EQ(expected_line, line);\n \n \/\/ Line 4\n std::getline(expected_stream, expected_line);\n \n std::getline(sample_stream, line);\n EXPECT_EQ(expected_line, line);\n \n std::getline(diagnostic_stream, line);\n EXPECT_EQ(expected_line, line);\n \n \/\/ Line 5\n std::getline(expected_stream, expected_line);\n \n std::getline(sample_stream, line);\n EXPECT_EQ(expected_line, line);\n \n std::getline(diagnostic_stream, line);\n EXPECT_EQ(expected_line, line);\n \n EXPECT_EQ(\"\", message_stream.str());\n}\n<|endoftext|>"} {"text":"<commit_before>#include <pwn\/engine\/loop.h>\n#include <pwn\/engine\/game.h>\n#include <pwn\/engine\/startup.h>\n\n#include <pwn\/render\/world3.h>\n#include <pwn\/render\/world3widget.h>\n#include <pwn\/math\/operations.h>\n#include <pwn\/render\/actordef.h>\n#include <pwn\/render\/actor.h>\n#include <pwn\/mesh\/mesh.h>\n#include <pwn\/mesh\/builder.h>\n#include <pwn\/mesh\/predefinedmaterials.h>\n#include <pwn\/engine\/democamera.h>\n#include <pwn\/engine\/vfstexturepool2.h>\n#include <pwn\/io\/io.h>\n#include <pwn\/render\/worldwithcameraboundobject3.h>\n#include <pwn\/render\/fse\/Pipeline.h>\n#include <pwn\/render\/light.h>\n#include <pwn\/engine\/democontrols.h>\n\n#include <pwn\/render\/shaderpool.h>\n\nusing namespace pwn;\nusing namespace pwn::engine;\nusing namespace pwn::render;\nusing namespace pwn::math;\nusing namespace pwn::mesh;\n\nboost::shared_ptr<ActorDef> CreateCube(real size, const string& texture, TexturePool2* tpool, real alpha, bool out)\n{\n\tconst real halfsize = size\/2;\n\n\tBuilder b = CreateBox(materials::White(), halfsize*2, halfsize*2, halfsize*2, out);;\n\tb.materials[0].setTexture_Diffuse(texture);\n\tb.materials[0].diffuse.alpha(alpha);\n\tMove(&b, vec3(-halfsize, -halfsize, -halfsize));\n\treturn Compile(b.asMesh(), tpool);\n}\n\nboost::shared_ptr<ActorDef> LoadMesh(const string& file, TexturePool2* tpool)\n{\n\tMesh mesh;\n\tpwn::io::Read(&mesh, file);\n\treturn Compile(mesh, tpool);\n}\n\nclass EasyLoop : public Loop\n{\nprivate:\n\tboost::shared_ptr<Actor> object;\n\treal pos;\n\n\tCamera cam;\n\tVfsTexturePool2 tpool;\n\tfse::PipelinePtr pipe;\n\tpwn::render::ShaderPool tempShaderPool;\n\n\tbool followcam;\n\tboost::shared_ptr<World3Widget > wid;\n\tDemoControls ctrl;\npublic:\n\n\tEasyLoop(Game* game)\n\t\t: Loop(game)\n\t\t, pos(0)\n\t\t, cam(point3(4,4,4), qIdentity(), 45, 0.1f, 1000)\n\t\t, followcam(false)\n\t{\n\t\tWorld3::Ptr world( new WorldWithCameraBoundObject3(Actor::Create(Origo3(), qIdentity(), CreateCube(10, \"_stars-texture.jpg\", &tpool, 1, false) ),\n\t\t\tWorld3::Create()) );\n\t\tworld->light_setAmbient( math::Rgba(1.0f) );\n\n\t\tobject = Actor::Create(point3(0,0,15), qIdentity(), CreateCube(1, \"crate01a.jpg\", &tpool, 1, true));\n\t\tobject->debug = true;\n\t\tworld->actor_add(object);\n\n\t\twid.reset(new World3Widget( Dock::Fill(), world ) );\n\t\tcam.pipeline = fse::Pipeline::Create(\"fse\/normal.xml\", &tempShaderPool);\n\t\tdisplay.widget_add( wid );\n\t}\n\n\tvoid onKey(Key::Code key, bool isDown)\n\t{\n\t\tif( key == Key::Escape && isDown )\n\t\t{\n\t\t\tstop();\n\t\t}\n\t\tif( key == Key::Return && isDown )\n\t\t{\n\t\t\tfollowcam = !followcam;\n\t\t}\n\t\telse\n\t\t{\n\t\t\tctrl.onKey(key, isDown);\n\t\t}\n\t}\n\n\tvoid onUpdate(real delta)\n\t{\n\t\tctrl.update(&object->position, &object->rotation, delta, 10.0f, 10.0f);\n\t\tif( followcam )\n\t\t{\n\t\t\tcam.lookAt(object->position);\n\t\t}\n\t}\n\n\tvoid onRender()\n\t{\n\t\twid->updateCamera(cam);\n\t\tdefaultRender();\n\t}\n\n\tvoid onMouse(const math::vec2 movement)\n\t{\n\t\tctrl.onMouse(movement);\n\t}\n};\n\nint main(int, char** argv)\n{\n\t{\n\t\tGame game;\n\t\tInstallDefaultSystems(&game,\n\t\t\tStartup(argv[0], \"entsoft\", \"pwn-demo-basic-camera\", \"pwn demo: basic camera\")\n\t\t\t);\n\t\tEasyLoop(&game).loop();\n\t}\n}\n<commit_msg>added lookat for object, but something still isnt right<commit_after>#include <pwn\/engine\/loop.h>\n#include <pwn\/engine\/game.h>\n#include <pwn\/engine\/startup.h>\n\n#include <pwn\/render\/world3.h>\n#include <pwn\/render\/world3widget.h>\n#include <pwn\/math\/operations.h>\n#include <pwn\/render\/actordef.h>\n#include <pwn\/render\/actor.h>\n#include <pwn\/mesh\/mesh.h>\n#include <pwn\/mesh\/builder.h>\n#include <pwn\/mesh\/predefinedmaterials.h>\n#include <pwn\/engine\/democamera.h>\n#include <pwn\/engine\/vfstexturepool2.h>\n#include <pwn\/io\/io.h>\n#include <pwn\/render\/worldwithcameraboundobject3.h>\n#include <pwn\/render\/fse\/Pipeline.h>\n#include <pwn\/render\/light.h>\n#include <pwn\/engine\/demomovement.h>\n\n#include <pwn\/render\/shaderpool.h>\n\nusing namespace pwn;\nusing namespace pwn::engine;\nusing namespace pwn::render;\nusing namespace pwn::math;\nusing namespace pwn::mesh;\n\nboost::shared_ptr<ActorDef> CreateCube(real size, const string& texture, TexturePool2* tpool, real alpha, bool out)\n{\n\tconst real halfsize = size\/2;\n\n\tBuilder b = CreateBox(materials::White(), halfsize*2, halfsize*2, halfsize*2, out);;\n\tb.materials[0].setTexture_Diffuse(texture);\n\tb.materials[0].diffuse.alpha(alpha);\n\tMove(&b, vec3(-halfsize, -halfsize, -halfsize));\n\treturn Compile(b.asMesh(), tpool);\n}\n\nboost::shared_ptr<ActorDef> LoadMesh(const string& file, TexturePool2* tpool)\n{\n\tMesh mesh;\n\tpwn::io::Read(&mesh, file);\n\treturn Compile(mesh, tpool);\n}\n\nclass EasyLoop : public Loop\n{\nprivate:\n\tboost::shared_ptr<Actor> object;\n\treal pos;\n\n\tCamera cam;\n\tVfsTexturePool2 tpool;\n\tfse::PipelinePtr pipe;\n\tpwn::render::ShaderPool tempShaderPool;\n\n\tboost::shared_ptr<World3Widget > wid;\n\tDemoMovement ctrl;\npublic:\n\n\tEasyLoop(Game* game)\n\t\t: Loop(game)\n\t\t, pos(0)\n\t\t, cam(point3(0,0,0), qIdentity(), 45, 0.1f, 1000)\n\t{\n\t\tWorld3::Ptr world( new WorldWithCameraBoundObject3(Actor::Create(Origo3(), qIdentity(), CreateCube(10, \"_stars-texture.jpg\", &tpool, 1, false) ),\n\t\t\tWorld3::Create()) );\n\t\tworld->light_setAmbient( math::Rgba(1.0f) );\n\n\t\tobject = Actor::Create(point3(0,0,15), qIdentity(), CreateCube(1, \"crate01a.jpg\", &tpool, 1, true));\n\t\tobject->debug = true;\n\t\tworld->actor_add(object);\n\n\t\twid.reset(new World3Widget( Dock::Fill(), world ) );\n\t\tcam.pipeline = fse::Pipeline::Create(\"fse\/normal.xml\", &tempShaderPool);\n\t\tdisplay.widget_add( wid );\n\n\t\tctrl.localUp = true;\n\t}\n\n\tvoid onKey(Key::Code key, bool isDown)\n\t{\n\t\tif( key == Key::Escape && isDown )\n\t\t{\n\t\t\tstop();\n\t\t}\n\t\telse\n\t\t{\n\t\t\tctrl.onKey(key, isDown);\n\t\t}\n\t}\n\n\tvoid onUpdate(real delta)\n\t{\n\t\tctrl.update(&object->position, object->rotation, delta, 10.0f);\n\t\tobject->rotation = qLookAt(object->position.vec, cam.position.vec, Up());\n\t\tcam.lookAt(object->position);\n\t}\n\n\tvoid onRender()\n\t{\n\t\twid->updateCamera(cam);\n\t\tdefaultRender();\n\t}\n\n\tvoid onMouse(const math::vec2 movement)\n\t{\n\t}\n};\n\nint main(int, char** argv)\n{\n\t{\n\t\tGame game;\n\t\tInstallDefaultSystems(&game,\n\t\t\tStartup(argv[0], \"entsoft\", \"pwn-demo-basic-camera\", \"pwn demo: basic camera\")\n\t\t\t);\n\t\tEasyLoop(&game).loop();\n\t}\n}\n<|endoftext|>"} {"text":"<commit_before>\/\/ Copyright (c) 2012 Plenluno All rights reserved.\n\n#include \"Libj\/js_array.h\"\n#include \"libj\/detail\/js_array.h\"\n\nnamespace libj {\n\nJsArray::Ptr JsArray::create() {\n return Ptr(new detail::JsArray<JsArray>());\n}\n\nJsArray::Ptr JsArray::create(ArrayList::CPtr list) {\n if (!list) return null();\n\n JsArray::Ptr ary(JsArray::create());\n ary->addAll(list);\n return ary;\n}\n\n} \/\/ namespace libj\n<commit_msg>fix typo<commit_after>\/\/ Copyright (c) 2012 Plenluno All rights reserved.\n\n#include \"libj\/js_array.h\"\n#include \"libj\/detail\/js_array.h\"\n\nnamespace libj {\n\nJsArray::Ptr JsArray::create() {\n return Ptr(new detail::JsArray<JsArray>());\n}\n\nJsArray::Ptr JsArray::create(ArrayList::CPtr list) {\n if (!list) return null();\n\n JsArray::Ptr ary(JsArray::create());\n ary->addAll(list);\n return ary;\n}\n\n} \/\/ namespace libj\n<|endoftext|>"} {"text":"<commit_before><commit_msg>remove log<commit_after><|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:\/\/qt.nokia.com\/contact.\n** $QT_END_LICENSE$\n**\n****************************************************************************\/\n\n\n#include <QtTest\/QtTest>\n\n#include <QtCore\/QCoreApplication>\n#include <QtCore\/QSocketNotifier>\n#include <QtNetwork\/QTcpServer>\n#include <QtNetwork\/QTcpSocket>\n#include <private\/qnativesocketengine_p.h>\n\nclass tst_QSocketNotifier : public QObject\n{\n Q_OBJECT\npublic:\n tst_QSocketNotifier();\n ~tst_QSocketNotifier();\n\nprivate slots:\n void unexpectedDisconnection();\n void mixingWithTimers();\n};\n\ntst_QSocketNotifier::tst_QSocketNotifier()\n{ }\n\ntst_QSocketNotifier::~tst_QSocketNotifier()\n{\n}\n\nclass UnexpectedDisconnectTester : public QObject\n{\n Q_OBJECT\n int sequence;\n\npublic:\n QNativeSocketEngine *readEnd1, *readEnd2;\n\n UnexpectedDisconnectTester(QNativeSocketEngine *s1, QNativeSocketEngine *s2)\n : readEnd1(s1), readEnd2(s2), sequence(0)\n {\n QSocketNotifier *notifier1 =\n new QSocketNotifier(readEnd1->socketDescriptor(), QSocketNotifier::Read, this);\n connect(notifier1, SIGNAL(activated(int)), SLOT(handleActivated()));\n QSocketNotifier *notifier2 =\n new QSocketNotifier(readEnd2->socketDescriptor(), QSocketNotifier::Read, this);\n connect(notifier2, SIGNAL(activated(int)), SLOT(handleActivated()));\n }\n\n const int getSequence() {\n return sequence;\n }\n\n void incSequence() {\n ++sequence;\n }\n\npublic slots:\n void handleActivated()\n {\n char data1[1], data2[1];\n incSequence();\n if (getSequence() == 1) {\n \/\/ read from both ends\n (void) readEnd1->read(data1, sizeof(data1));\n (void) readEnd2->read(data2, sizeof(data2));\n emit finished();\n } else if (getSequence() == 2) {\n QCOMPARE(readEnd2->read(data2, sizeof(data2)), qint64(-2));\n QVERIFY(readEnd2->isValid());\n }\n }\n\nsignals:\n void finished();\n};\n\nvoid tst_QSocketNotifier::unexpectedDisconnection()\n{\n \/*\n Given two sockets and two QSocketNotifiers registered on each\n their socket. If both sockets receive data, and the first slot\n invoked by one of the socket notifiers empties both sockets, the\n other notifier will also emit activated(). This results in\n unexpected disconnection in QAbstractSocket.\n\n The use case is that somebody calls one of the\n waitFor... functions in a QSocketNotifier activated slot, and\n the waitFor... functions do local selects that can empty both\n stdin and stderr while waiting for fex bytes to be written.\n *\/\n\n QTcpServer server;\n QVERIFY(server.listen(QHostAddress::LocalHost, 0));\n\n QNativeSocketEngine readEnd1;\n readEnd1.initialize(QAbstractSocket::TcpSocket);\n bool b = readEnd1.connectToHost(server.serverAddress(), server.serverPort());\n QVERIFY(readEnd1.waitForWrite());\n\/\/ while (!b && readEnd1.state() != QAbstractSocket::ConnectedState)\n\/\/ b = readEnd1.connectToHost(server.serverAddress(), server.serverPort());\n QVERIFY(readEnd1.state() == QAbstractSocket::ConnectedState);\n QVERIFY(server.waitForNewConnection());\n QTcpSocket *writeEnd1 = server.nextPendingConnection();\n QVERIFY(writeEnd1 != 0);\n\n QNativeSocketEngine readEnd2;\n readEnd2.initialize(QAbstractSocket::TcpSocket);\n b = readEnd2.connectToHost(server.serverAddress(), server.serverPort());\n QVERIFY(readEnd2.waitForWrite());\n\/\/ while (!b)\n\/\/ b = readEnd2.connectToHost(server.serverAddress(), server.serverPort());\n QVERIFY(readEnd2.state() == QAbstractSocket::ConnectedState);\n QVERIFY(server.waitForNewConnection());\n QTcpSocket *writeEnd2 = server.nextPendingConnection();\n QVERIFY(writeEnd2 != 0);\n\n writeEnd1->write(\"1\", 1);\n writeEnd2->write(\"2\", 1);\n\n writeEnd1->waitForBytesWritten();\n writeEnd2->waitForBytesWritten();\n\n writeEnd1->flush();\n writeEnd2->flush();\n\n UnexpectedDisconnectTester tester(&readEnd1, &readEnd2);\n\n do {\n \/\/ we have to wait until sequence value changes\n \/\/ as any event can make us jump out processing\n QCoreApplication::processEvents(QEventLoop::WaitForMoreEvents);\n } while(tester.getSequence() <= 0);\n\n QVERIFY(readEnd1.state() == QAbstractSocket::ConnectedState);\n QVERIFY(readEnd2.state() == QAbstractSocket::ConnectedState);\n#if defined(Q_OS_WIN)\n qWarning(\"### Windows returns 1 activation, Unix returns 2.\");\n QCOMPARE(tester.getSequence(), 1);\n#else\n QCOMPARE(tester.getSequence(), 2);\n#endif\n\n readEnd1.close();\n readEnd2.close();\n writeEnd1->close();\n writeEnd2->close();\n server.close();\n}\n\nclass MixingWithTimersHelper : public QObject\n{\n Q_OBJECT\n\npublic:\n MixingWithTimersHelper(QTimer *timer, QTcpServer *server);\n\n bool timerActivated;\n bool socketActivated;\n\nprivate slots:\n void timerFired();\n void socketFired();\n};\n\nMixingWithTimersHelper::MixingWithTimersHelper(QTimer *timer, QTcpServer *server)\n{\n timerActivated = false;\n socketActivated = false;\n\n connect(timer, SIGNAL(timeout()), SLOT(timerFired()));\n connect(server, SIGNAL(newConnection()), SLOT(socketFired()));\n}\n\nvoid MixingWithTimersHelper::timerFired()\n{\n timerActivated = true;\n}\n\nvoid MixingWithTimersHelper::socketFired()\n{\n socketActivated = true;\n}\n\nvoid tst_QSocketNotifier::mixingWithTimers()\n{\n QTimer timer;\n timer.setInterval(0);\n timer.start();\n\n QTcpServer server;\n QVERIFY(server.listen(QHostAddress::LocalHost, 0));\n\n MixingWithTimersHelper helper(&timer, &server);\n\n QCoreApplication::processEvents();\n\n QCOMPARE(helper.timerActivated, true);\n QCOMPARE(helper.socketActivated, false);\n\n helper.timerActivated = false;\n helper.socketActivated = false;\n\n QTcpSocket socket;\n socket.connectToHost(server.serverAddress(), server.serverPort());\n\n QCoreApplication::processEvents();\n\n QCOMPARE(helper.timerActivated, true);\n QCOMPARE(helper.socketActivated, true);\n}\n\nQTEST_MAIN(tst_QSocketNotifier)\n#include <tst_qsocketnotifier.moc>\n<commit_msg>We feel that test case should be changed, as we cant expect that order of the event hansling will be same on all platforms.<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:\/\/qt.nokia.com\/contact.\n** $QT_END_LICENSE$\n**\n****************************************************************************\/\n\n\n#include <QtTest\/QtTest>\n\n#include <QtCore\/QCoreApplication>\n#include <QtCore\/QSocketNotifier>\n#include <QtNetwork\/QTcpServer>\n#include <QtNetwork\/QTcpSocket>\n#include <private\/qnativesocketengine_p.h>\n\nclass tst_QSocketNotifier : public QObject\n{\n Q_OBJECT\npublic:\n tst_QSocketNotifier();\n ~tst_QSocketNotifier();\n\nprivate slots:\n void unexpectedDisconnection();\n void mixingWithTimers();\n};\n\ntst_QSocketNotifier::tst_QSocketNotifier()\n{ }\n\ntst_QSocketNotifier::~tst_QSocketNotifier()\n{\n}\n\nclass UnexpectedDisconnectTester : public QObject\n{\n Q_OBJECT\npublic:\n QNativeSocketEngine *readEnd1, *readEnd2;\n int sequence;\n\n UnexpectedDisconnectTester(QNativeSocketEngine *s1, QNativeSocketEngine *s2)\n : readEnd1(s1), readEnd2(s2), sequence(0)\n {\n QSocketNotifier *notifier1 =\n new QSocketNotifier(readEnd1->socketDescriptor(), QSocketNotifier::Read, this);\n connect(notifier1, SIGNAL(activated(int)), SLOT(handleActivated()));\n QSocketNotifier *notifier2 =\n new QSocketNotifier(readEnd2->socketDescriptor(), QSocketNotifier::Read, this);\n connect(notifier2, SIGNAL(activated(int)), SLOT(handleActivated()));\n }\n\npublic slots:\n void handleActivated()\n {\n char data1[1], data2[1];\n ++sequence;\n if (sequence == 1) {\n \/\/ read from both ends\n (void) readEnd1->read(data1, sizeof(data1));\n (void) readEnd2->read(data2, sizeof(data2));\n emit finished();\n } else if (sequence == 2) {\n \/\/ we should never get here\n QCOMPARE(readEnd2->read(data2, sizeof(data2)), qint64(-2));\n QVERIFY(readEnd2->isValid());\n }\n }\n\nsignals:\n void finished();\n};\n\nvoid tst_QSocketNotifier::unexpectedDisconnection()\n{\n \/*\n Given two sockets and two QSocketNotifiers registered on each\n their socket. If both sockets receive data, and the first slot\n invoked by one of the socket notifiers empties both sockets, the\n other notifier will also emit activated(). This results in\n unexpected disconnection in QAbstractSocket.\n\n The use case is that somebody calls one of the\n waitFor... functions in a QSocketNotifier activated slot, and\n the waitFor... functions do local selects that can empty both\n stdin and stderr while waiting for fex bytes to be written.\n *\/\n\n QTcpServer server;\n QVERIFY(server.listen(QHostAddress::LocalHost, 0));\n\n QNativeSocketEngine readEnd1;\n readEnd1.initialize(QAbstractSocket::TcpSocket);\n bool b = readEnd1.connectToHost(server.serverAddress(), server.serverPort());\n QVERIFY(readEnd1.waitForWrite());\n\/\/ while (!b && readEnd1.state() != QAbstractSocket::ConnectedState)\n\/\/ b = readEnd1.connectToHost(server.serverAddress(), server.serverPort());\n QVERIFY(readEnd1.state() == QAbstractSocket::ConnectedState);\n QVERIFY(server.waitForNewConnection());\n QTcpSocket *writeEnd1 = server.nextPendingConnection();\n QVERIFY(writeEnd1 != 0);\n\n QNativeSocketEngine readEnd2;\n readEnd2.initialize(QAbstractSocket::TcpSocket);\n b = readEnd2.connectToHost(server.serverAddress(), server.serverPort());\n QVERIFY(readEnd2.waitForWrite());\n\/\/ while (!b)\n\/\/ b = readEnd2.connectToHost(server.serverAddress(), server.serverPort());\n QVERIFY(readEnd2.state() == QAbstractSocket::ConnectedState);\n QVERIFY(server.waitForNewConnection());\n QTcpSocket *writeEnd2 = server.nextPendingConnection();\n QVERIFY(writeEnd2 != 0);\n\n writeEnd1->write(\"1\", 1);\n writeEnd2->write(\"2\", 1);\n\n writeEnd1->waitForBytesWritten();\n writeEnd2->waitForBytesWritten();\n\n writeEnd1->flush();\n writeEnd2->flush();\n\n UnexpectedDisconnectTester tester(&readEnd1, &readEnd2);\n\n do {\n \/\/ we have to wait until sequence value changes\n \/\/ as any event can make us jump out processing\n QCoreApplication::processEvents(QEventLoop::WaitForMoreEvents);\n } while(tester.sequence <= 0);\n\n QVERIFY(readEnd1.state() == QAbstractSocket::ConnectedState);\n QVERIFY(readEnd2.state() == QAbstractSocket::ConnectedState);\n\n QCOMPARE(tester.sequence, 2);\n\n readEnd1.close();\n readEnd2.close();\n writeEnd1->close();\n writeEnd2->close();\n server.close();\n}\n\nclass MixingWithTimersHelper : public QObject\n{\n Q_OBJECT\n\npublic:\n MixingWithTimersHelper(QTimer *timer, QTcpServer *server);\n\n bool timerActivated;\n bool socketActivated;\n\nprivate slots:\n void timerFired();\n void socketFired();\n};\n\nMixingWithTimersHelper::MixingWithTimersHelper(QTimer *timer, QTcpServer *server)\n{\n timerActivated = false;\n socketActivated = false;\n\n connect(timer, SIGNAL(timeout()), SLOT(timerFired()));\n connect(server, SIGNAL(newConnection()), SLOT(socketFired()));\n}\n\nvoid MixingWithTimersHelper::timerFired()\n{\n timerActivated = true;\n}\n\nvoid MixingWithTimersHelper::socketFired()\n{\n socketActivated = true;\n}\n\nvoid tst_QSocketNotifier::mixingWithTimers()\n{\n QTimer timer;\n timer.setInterval(0);\n timer.start();\n\n QTcpServer server;\n QVERIFY(server.listen(QHostAddress::LocalHost, 0));\n\n MixingWithTimersHelper helper(&timer, &server);\n\n QCoreApplication::processEvents();\n\n QCOMPARE(helper.timerActivated, true);\n QCOMPARE(helper.socketActivated, false);\n\n helper.timerActivated = false;\n helper.socketActivated = false;\n\n QTcpSocket socket;\n socket.connectToHost(server.serverAddress(), server.serverPort());\n\n QCoreApplication::processEvents();\n\n QCOMPARE(helper.timerActivated, true);\n QCOMPARE(helper.socketActivated, true);\n}\n\nQTEST_MAIN(tst_QSocketNotifier)\n#include <tst_qsocketnotifier.moc>\n<|endoftext|>"} {"text":"<commit_before>\/*\n * Copyright (C) 2010-2011 Dmitry Marakasov\n *\n * This file is part of glosm.\n *\n * glosm is free software: you can redistribute it and\/or modify\n * it under the terms of the GNU General Public License as published by\n * the Free Software Foundation, either version 3 of the License, or\n * (at your option) any later version.\n *\n * glosm is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the\n * GNU General Public License for more details.\n *\n * You should have received a copy of the GNU General Public License\n * along with glosm. If not, see <http:\/\/www.gnu.org\/licenses\/>.\n *\/\n\n#include \"GlosmViewer.hh\"\n\n#include <glosm\/util\/gl.h>\n\n#include <SDL\/SDL.h>\n#include <SDL\/SDL_keysym.h>\n#if defined(WITH_GLES)\n#\tinclude <SDL_gles.h>\n#else\n#\tinclude <SDL\/SDL_opengl.h>\n#endif\n\n#include <cstdio>\n\nclass GlosmViewerImpl : public GlosmViewer {\nprotected:\n\tbool ignoremouse_;\n\npublic:\n\tGlosmViewerImpl() : ignoremouse_(true) {\n\t}\n\n\tvirtual void MouseMove(int x, int y) {\n\t\tif (!ignoremouse_)\n\t\t\tGlosmViewer::MouseMove(x, y);\n\t}\n\nprotected:\n\tvirtual void WarpCursor(int x, int y) {\n\t\tignoremouse_ = true;\n\t\tSDL_WarpMouse(x, y);\n\t\tignoremouse_ = false;\n\t}\n\n\tvirtual void Flip() {\n#if defined(WITH_GLES)\n\t\tSDL_GLES_SwapBuffers();\n#else\n\t\tSDL_GL_SwapBuffers();\n#endif\n\t}\n\n\tvirtual void ShowCursor(bool show) {\n#if defined(WITH_TOUCHPAD)\n\t\tSDL_ShowCursor(SDL_DISABLE);\n#else\n\t\tSDL_ShowCursor(show ? SDL_ENABLE : SDL_DISABLE);\n#endif\n\t}\n};\n\n#if defined(WITH_GLES)\nSDL_GLES_Context* gles_context = 0;\n#endif\n\nGlosmViewerImpl app;\n\nvoid Reshape(int w, int h) {\n#if !defined(WITH_GLES)\n\tif (SDL_SetVideoMode(w, h, 0, SDL_OPENGL | SDL_RESIZABLE | SDL_HWSURFACE) == NULL)\n\t\tthrow Exception() << \"SDL_SetVideoMode failed: \" << (const char*)SDL_GetError();\n#endif\n\n\tapp.Resize(w, h);\n}\n\nvoid KeyDown(SDLKey key) {\n\tif (key < 0x100)\n\t\tapp.KeyDown(key);\n\telse\n\t\tswitch(key) {\n\t\tcase SDLK_UP: app.KeyDown(GlosmViewer::KEY_UP); break;\n\t\tcase SDLK_DOWN: app.KeyDown(GlosmViewer::KEY_DOWN); break;\n\t\tcase SDLK_LEFT: app.KeyDown(GlosmViewer::KEY_LEFT); break;\n\t\tcase SDLK_RIGHT: app.KeyDown(GlosmViewer::KEY_RIGHT); break;\n\t\tcase SDLK_KP_PLUS: app.KeyDown('+'); break;\n\t\tcase SDLK_KP_MINUS: app.KeyDown('-'); break;\n\t\tcase SDLK_LSHIFT: case SDLK_RSHIFT: app.KeyDown(GlosmViewer::KEY_SHIFT); break;\n\t\tcase SDLK_LCTRL: case SDLK_RCTRL: app.KeyDown(GlosmViewer::KEY_CTRL); break;\n\t\tdefault: break;\n\t\t}\n}\n\nvoid KeyUp(SDLKey key) {\n\tif (key < 0x100)\n\t\tapp.KeyUp(key);\n\telse\n\t\tswitch(key) {\n\t\tcase SDLK_UP: app.KeyUp(GlosmViewer::KEY_UP); break;\n\t\tcase SDLK_DOWN: app.KeyUp(GlosmViewer::KEY_DOWN); break;\n\t\tcase SDLK_LEFT: app.KeyUp(GlosmViewer::KEY_LEFT); break;\n\t\tcase SDLK_RIGHT: app.KeyUp(GlosmViewer::KEY_RIGHT); break;\n\t\tcase SDLK_KP_PLUS: app.KeyUp('+'); break;\n\t\tcase SDLK_KP_MINUS: app.KeyUp('-'); break;\n\t\tcase SDLK_LSHIFT: case SDLK_RSHIFT: app.KeyUp(GlosmViewer::KEY_SHIFT); break;\n\t\tcase SDLK_LCTRL: case SDLK_RCTRL: app.KeyUp(GlosmViewer::KEY_CTRL); break;\n\t\tdefault: break;\n\t\t}\n}\n\nvoid Cleanup() {\n#if defined(WITH_GLES)\n\tif (gles_context)\n\t\tSDL_GLES_DeleteContext(gles_context);\n#endif\n\tSDL_Quit();\n}\n\nint GetEvents() {\n\tSDL_Event event;\n\n\twhile (SDL_PollEvent(&event)) {\n\t\tint ret = 1;\n\t\tswitch(event.type) {\n\t\tcase SDL_QUIT:\n\t\t\treturn 0;\n\t\tcase SDL_KEYDOWN:\n\t\t\tKeyDown(event.key.keysym.sym);\n\t\t\tbreak;\n\t\tcase SDL_KEYUP:\n\t\t\tKeyUp(event.key.keysym.sym);\n\t\t\tbreak;\n\t\tcase SDL_MOUSEMOTION:\n\t\t\tapp.MouseMove(event.motion.x, event.motion.y);\n\t\t\tbreak;\n\t\tcase SDL_MOUSEBUTTONDOWN:\n\t\tcase SDL_MOUSEBUTTONUP:\n\t\t\t{\n\t\t\t\tint b = GlosmViewer::BUTTON_LEFT;\n\t\t\t\tswitch (event.button.button) {\n\t\t\t\tcase SDL_BUTTON_LEFT: b = GlosmViewer::BUTTON_LEFT; break;\n\t\t\t\tcase SDL_BUTTON_RIGHT: b = GlosmViewer::BUTTON_RIGHT; break;\n\t\t\t\tcase SDL_BUTTON_MIDDLE: b = GlosmViewer::BUTTON_MIDDLE; break;\n\t\t\t\t}\n\t\t\t\tapp.MouseButton(b, event.button.state == SDL_PRESSED, event.button.x, event.button.y);\n\t\t\t}\n\t\t\tbreak;\n\t\tcase SDL_VIDEORESIZE:\n\t\t\tReshape(event.resize.w, event.resize.h);\n\t\t\tbreak;\n\t\tdefault:\n\t\t\tbreak;\n\t\t}\n\n\t\tif (ret == 0)\n\t\t\treturn 0;\n\t}\n\n\treturn 1;\n}\n\nint real_main(int argc, char** argv) {\n\tapp.Init(argc, argv);\n\n\t\/* glut init *\/\n\tif (SDL_Init(SDL_INIT_VIDEO) != 0)\n\t\tthrow Exception() << \"Couldn't initialize SDL: \" << (const char*)SDL_GetError();\n\n\tatexit(Cleanup);\n\n#if !defined(WITH_GLES)\n\tSDL_GL_SetAttribute(SDL_GL_DOUBLEBUFFER, 1);\n\n\ttry {\n\t\tSDL_GL_SetAttribute(SDL_GL_MULTISAMPLEBUFFERS, 1);\n\t\tSDL_GL_SetAttribute(SDL_GL_MULTISAMPLESAMPLES, 4);\n\t\tReshape(800, 600);\n\t} catch (Exception& e) {\n\t\tfprintf(stderr, \"warning: %s, retrying without multisampling\\n\", e.what());\n\t\tSDL_GL_SetAttribute(SDL_GL_MULTISAMPLEBUFFERS, 0);\n\t\tSDL_GL_SetAttribute(SDL_GL_MULTISAMPLESAMPLES, 0);\n\t\tReshape(800, 600);\n\t}\n#else\n\t\/* Using fixed resolution for N900\n\t * it should be detected on the fly instead *\/\n\tSDL_SetVideoMode(800, 480, 0, SDL_SWSURFACE | SDL_FULLSCREEN);\n\n\tSDL_GLES_Init(SDL_GLES_VERSION_1_1);\n\n\tSDL_GLES_SetAttribute(SDL_GLES_DEPTH_SIZE, 24);\n\n\tgles_context = SDL_GLES_CreateContext();\n\n\tSDL_GLES_MakeCurrent(gles_context);\n\n\tReshape(800, 480);\n#endif\n\n\tSDL_EnableKeyRepeat(0, 0);\n\n\tapp.InitGL();\n\n\t\/* main loop *\/\n\twhile (GetEvents())\n\t\tapp.Render();\n\n\treturn 0;\n}\n\nint main(int argc, char** argv) {\n\ttry {\n\t\treturn real_main(argc, argv);\n\t} catch (std::exception &e) {\n\t\tfprintf(stderr, \"Exception: %s\\n\", e.what());\n\t} catch (...) {\n\t\tfprintf(stderr, \"Unknown exception\\n\");\n\t}\n\n\treturn 1;\n}\n<commit_msg>Keep SDL's glext out of way<commit_after>\/*\n * Copyright (C) 2010-2011 Dmitry Marakasov\n *\n * This file is part of glosm.\n *\n * glosm is free software: you can redistribute it and\/or modify\n * it under the terms of the GNU General Public License as published by\n * the Free Software Foundation, either version 3 of the License, or\n * (at your option) any later version.\n *\n * glosm is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the\n * GNU General Public License for more details.\n *\n * You should have received a copy of the GNU General Public License\n * along with glosm. If not, see <http:\/\/www.gnu.org\/licenses\/>.\n *\/\n\n#include \"GlosmViewer.hh\"\n\n#include <glosm\/util\/gl.h>\n\n#include <SDL\/SDL.h>\n#include <SDL\/SDL_keysym.h>\n#if defined(WITH_GLES)\n#\tinclude <SDL_gles.h>\n#else\n#\tdefine NO_SDL_GLEXT\n#\tinclude <SDL\/SDL_opengl.h>\n#endif\n\n#include <cstdio>\n\nclass GlosmViewerImpl : public GlosmViewer {\nprotected:\n\tbool ignoremouse_;\n\npublic:\n\tGlosmViewerImpl() : ignoremouse_(true) {\n\t}\n\n\tvirtual void MouseMove(int x, int y) {\n\t\tif (!ignoremouse_)\n\t\t\tGlosmViewer::MouseMove(x, y);\n\t}\n\nprotected:\n\tvirtual void WarpCursor(int x, int y) {\n\t\tignoremouse_ = true;\n\t\tSDL_WarpMouse(x, y);\n\t\tignoremouse_ = false;\n\t}\n\n\tvirtual void Flip() {\n#if defined(WITH_GLES)\n\t\tSDL_GLES_SwapBuffers();\n#else\n\t\tSDL_GL_SwapBuffers();\n#endif\n\t}\n\n\tvirtual void ShowCursor(bool show) {\n#if defined(WITH_TOUCHPAD)\n\t\tSDL_ShowCursor(SDL_DISABLE);\n#else\n\t\tSDL_ShowCursor(show ? SDL_ENABLE : SDL_DISABLE);\n#endif\n\t}\n};\n\n#if defined(WITH_GLES)\nSDL_GLES_Context* gles_context = 0;\n#endif\n\nGlosmViewerImpl app;\n\nvoid Reshape(int w, int h) {\n#if !defined(WITH_GLES)\n\tif (SDL_SetVideoMode(w, h, 0, SDL_OPENGL | SDL_RESIZABLE | SDL_HWSURFACE) == NULL)\n\t\tthrow Exception() << \"SDL_SetVideoMode failed: \" << (const char*)SDL_GetError();\n#endif\n\n\tapp.Resize(w, h);\n}\n\nvoid KeyDown(SDLKey key) {\n\tif (key < 0x100)\n\t\tapp.KeyDown(key);\n\telse\n\t\tswitch(key) {\n\t\tcase SDLK_UP: app.KeyDown(GlosmViewer::KEY_UP); break;\n\t\tcase SDLK_DOWN: app.KeyDown(GlosmViewer::KEY_DOWN); break;\n\t\tcase SDLK_LEFT: app.KeyDown(GlosmViewer::KEY_LEFT); break;\n\t\tcase SDLK_RIGHT: app.KeyDown(GlosmViewer::KEY_RIGHT); break;\n\t\tcase SDLK_KP_PLUS: app.KeyDown('+'); break;\n\t\tcase SDLK_KP_MINUS: app.KeyDown('-'); break;\n\t\tcase SDLK_LSHIFT: case SDLK_RSHIFT: app.KeyDown(GlosmViewer::KEY_SHIFT); break;\n\t\tcase SDLK_LCTRL: case SDLK_RCTRL: app.KeyDown(GlosmViewer::KEY_CTRL); break;\n\t\tdefault: break;\n\t\t}\n}\n\nvoid KeyUp(SDLKey key) {\n\tif (key < 0x100)\n\t\tapp.KeyUp(key);\n\telse\n\t\tswitch(key) {\n\t\tcase SDLK_UP: app.KeyUp(GlosmViewer::KEY_UP); break;\n\t\tcase SDLK_DOWN: app.KeyUp(GlosmViewer::KEY_DOWN); break;\n\t\tcase SDLK_LEFT: app.KeyUp(GlosmViewer::KEY_LEFT); break;\n\t\tcase SDLK_RIGHT: app.KeyUp(GlosmViewer::KEY_RIGHT); break;\n\t\tcase SDLK_KP_PLUS: app.KeyUp('+'); break;\n\t\tcase SDLK_KP_MINUS: app.KeyUp('-'); break;\n\t\tcase SDLK_LSHIFT: case SDLK_RSHIFT: app.KeyUp(GlosmViewer::KEY_SHIFT); break;\n\t\tcase SDLK_LCTRL: case SDLK_RCTRL: app.KeyUp(GlosmViewer::KEY_CTRL); break;\n\t\tdefault: break;\n\t\t}\n}\n\nvoid Cleanup() {\n#if defined(WITH_GLES)\n\tif (gles_context)\n\t\tSDL_GLES_DeleteContext(gles_context);\n#endif\n\tSDL_Quit();\n}\n\nint GetEvents() {\n\tSDL_Event event;\n\n\twhile (SDL_PollEvent(&event)) {\n\t\tint ret = 1;\n\t\tswitch(event.type) {\n\t\tcase SDL_QUIT:\n\t\t\treturn 0;\n\t\tcase SDL_KEYDOWN:\n\t\t\tKeyDown(event.key.keysym.sym);\n\t\t\tbreak;\n\t\tcase SDL_KEYUP:\n\t\t\tKeyUp(event.key.keysym.sym);\n\t\t\tbreak;\n\t\tcase SDL_MOUSEMOTION:\n\t\t\tapp.MouseMove(event.motion.x, event.motion.y);\n\t\t\tbreak;\n\t\tcase SDL_MOUSEBUTTONDOWN:\n\t\tcase SDL_MOUSEBUTTONUP:\n\t\t\t{\n\t\t\t\tint b = GlosmViewer::BUTTON_LEFT;\n\t\t\t\tswitch (event.button.button) {\n\t\t\t\tcase SDL_BUTTON_LEFT: b = GlosmViewer::BUTTON_LEFT; break;\n\t\t\t\tcase SDL_BUTTON_RIGHT: b = GlosmViewer::BUTTON_RIGHT; break;\n\t\t\t\tcase SDL_BUTTON_MIDDLE: b = GlosmViewer::BUTTON_MIDDLE; break;\n\t\t\t\t}\n\t\t\t\tapp.MouseButton(b, event.button.state == SDL_PRESSED, event.button.x, event.button.y);\n\t\t\t}\n\t\t\tbreak;\n\t\tcase SDL_VIDEORESIZE:\n\t\t\tReshape(event.resize.w, event.resize.h);\n\t\t\tbreak;\n\t\tdefault:\n\t\t\tbreak;\n\t\t}\n\n\t\tif (ret == 0)\n\t\t\treturn 0;\n\t}\n\n\treturn 1;\n}\n\nint real_main(int argc, char** argv) {\n\tapp.Init(argc, argv);\n\n\t\/* glut init *\/\n\tif (SDL_Init(SDL_INIT_VIDEO) != 0)\n\t\tthrow Exception() << \"Couldn't initialize SDL: \" << (const char*)SDL_GetError();\n\n\tatexit(Cleanup);\n\n#if !defined(WITH_GLES)\n\tSDL_GL_SetAttribute(SDL_GL_DOUBLEBUFFER, 1);\n\n\ttry {\n\t\tSDL_GL_SetAttribute(SDL_GL_MULTISAMPLEBUFFERS, 1);\n\t\tSDL_GL_SetAttribute(SDL_GL_MULTISAMPLESAMPLES, 4);\n\t\tReshape(800, 600);\n\t} catch (Exception& e) {\n\t\tfprintf(stderr, \"warning: %s, retrying without multisampling\\n\", e.what());\n\t\tSDL_GL_SetAttribute(SDL_GL_MULTISAMPLEBUFFERS, 0);\n\t\tSDL_GL_SetAttribute(SDL_GL_MULTISAMPLESAMPLES, 0);\n\t\tReshape(800, 600);\n\t}\n#else\n\t\/* Using fixed resolution for N900\n\t * it should be detected on the fly instead *\/\n\tSDL_SetVideoMode(800, 480, 0, SDL_SWSURFACE | SDL_FULLSCREEN);\n\n\tSDL_GLES_Init(SDL_GLES_VERSION_1_1);\n\n\tSDL_GLES_SetAttribute(SDL_GLES_DEPTH_SIZE, 24);\n\n\tgles_context = SDL_GLES_CreateContext();\n\n\tSDL_GLES_MakeCurrent(gles_context);\n\n\tReshape(800, 480);\n#endif\n\n\tSDL_EnableKeyRepeat(0, 0);\n\n\tapp.InitGL();\n\n\t\/* main loop *\/\n\twhile (GetEvents())\n\t\tapp.Render();\n\n\treturn 0;\n}\n\nint main(int argc, char** argv) {\n\ttry {\n\t\treturn real_main(argc, argv);\n\t} catch (std::exception &e) {\n\t\tfprintf(stderr, \"Exception: %s\\n\", e.what());\n\t} catch (...) {\n\t\tfprintf(stderr, \"Unknown exception\\n\");\n\t}\n\n\treturn 1;\n}\n<|endoftext|>"} {"text":"<commit_before>\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ File: svutil.cpp\n\/\/ Description: ScrollView Utilities\n\/\/ Author: Joern Wanke\n\/\/ Created: Thu Nov 29 2007\n\/\/\n\/\/ (C) Copyright 2007, 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\/\/ SVUtil contains the SVSync and SVNetwork classes, which are used for\n\/\/ thread\/process creation & synchronization and network connection.\n\n#include <stdio.h>\n#ifdef _WIN32\nstruct addrinfo {\n struct sockaddr* ai_addr;\n int ai_addrlen;\n int ai_family;\n int ai_socktype;\n int ai_protocol;\n};\n#else\n#include <arpa\/inet.h>\n#include <netinet\/in.h>\n#include <pthread.h>\n#include <semaphore.h>\n#include <signal.h>\n#include <stdlib.h>\n#include <string.h>\n#include <netdb.h>\n#include <sys\/socket.h>\n#ifdef __linux__\n#include <sys\/prctl.h>\n#endif\n#include <unistd.h>\n#endif\n\n#include <cstdlib>\n#include <cstring>\n#include <iostream>\n#include <string>\n\n\/\/ Include automatically generated configuration file if running autoconf.\n#ifdef HAVE_CONFIG_H\n#include \"config_auto.h\"\n#endif\n\n#ifndef GRAPHICS_DISABLED\n\n#include \"svutil.h\"\n\nconst int kBufferSize = 65536;\nconst int kMaxMsgSize = 4096;\n\n\/\/ Signals a thread to exit.\nvoid SVSync::ExitThread() {\n#ifdef _WIN32\n \/\/ ExitThread(0);\n#else\n pthread_exit(0);\n#endif\n}\n\n\/\/ Starts a new process.\nvoid SVSync::StartProcess(const char* executable, const char* args) {\n std::string proc;\n proc.append(executable);\n proc.append(\" \");\n proc.append(args);\n std::cout << \"Starting \" << proc << std::endl;\n#ifdef _WIN32\n STARTUPINFO start_info;\n PROCESS_INFORMATION proc_info;\n GetStartupInfo(&start_info);\n if (!CreateProcess(NULL, const_cast<char*>(proc.c_str()), NULL, NULL, FALSE,\n CREATE_NO_WINDOW | DETACHED_PROCESS, NULL, NULL,\n &start_info, &proc_info))\n return;\n#else\n int pid = fork();\n if (pid != 0) { \/\/ The father process returns\n } else {\n#ifdef __linux__\n \/\/ Make sure the java process terminates on exit, since its\n \/\/ broken socket detection seems to be useless.\n prctl(PR_SET_PDEATHSIG, 2, 0, 0, 0);\n#endif\n char* mutable_args = strdup(args);\n int argc = 1;\n for (int i = 0; mutable_args[i]; ++i) {\n if (mutable_args[i] == ' ') {\n ++argc;\n }\n }\n char** argv = new char*[argc + 2];\n argv[0] = strdup(executable);\n argv[1] = mutable_args;\n argc = 2;\n bool inquote = false;\n for (int i = 0; mutable_args[i]; ++i) {\n if (!inquote && mutable_args[i] == ' ') {\n mutable_args[i] = '\\0';\n argv[argc++] = mutable_args + i + 1;\n } else if (mutable_args[i] == '\"') {\n inquote = !inquote;\n mutable_args[i] = ' ';\n }\n }\n argv[argc] = NULL;\n execvp(executable, argv);\n }\n#endif\n}\n\nSVSemaphore::SVSemaphore() {\n#ifdef _WIN32\n semaphore_ = CreateSemaphore(0, 0, 10, 0);\n#elif defined(__APPLE__)\n char name[50];\n snprintf(name, sizeof(name), \"%ld\", random());\n sem_unlink(name);\n semaphore_ = sem_open(name, O_CREAT , S_IWUSR, 0);\n if (semaphore_ == SEM_FAILED) {\n perror(\"sem_open\");\n }\n#else\n sem_init(&semaphore_, 0, 0);\n#endif\n}\n\nvoid SVSemaphore::Signal() {\n#ifdef _WIN32\n ReleaseSemaphore(semaphore_, 1, NULL);\n#elif defined(__APPLE__)\n sem_post(semaphore_);\n#else\n sem_post(&semaphore_);\n#endif\n}\n\nvoid SVSemaphore::Wait() {\n#ifdef _WIN32\n WaitForSingleObject(semaphore_, INFINITE);\n#elif defined(__APPLE__)\n sem_wait(semaphore_);\n#else\n sem_wait(&semaphore_);\n#endif\n}\n\nSVMutex::SVMutex() {\n#ifdef _WIN32\n mutex_ = CreateMutex(0, FALSE, 0);\n#else\n pthread_mutex_init(&mutex_, NULL);\n#endif\n}\n\nvoid SVMutex::Lock() {\n#ifdef _WIN32\n WaitForSingleObject(mutex_, INFINITE);\n#else\n pthread_mutex_lock(&mutex_);\n#endif\n}\n\nvoid SVMutex::Unlock() {\n#ifdef _WIN32\n ReleaseMutex(mutex_);\n#else\n pthread_mutex_unlock(&mutex_);\n#endif\n}\n\n\/\/ Create new thread.\n\nvoid SVSync::StartThread(void *(*func)(void*), void* arg) {\n#ifdef _WIN32\n LPTHREAD_START_ROUTINE f = (LPTHREAD_START_ROUTINE) func;\n DWORD threadid;\n HANDLE newthread = CreateThread(\n NULL, \/\/ default security attributes\n 0, \/\/ use default stack size\n f, \/\/ thread function\n arg, \/\/ argument to thread function\n 0, \/\/ use default creation flags\n &threadid); \/\/ returns the thread identifier\n#else\n pthread_t helper;\n pthread_create(&helper, NULL, func, arg);\n#endif\n}\n\n\/\/ Place a message in the message buffer (and flush it).\nvoid SVNetwork::Send(const char* msg) {\n mutex_send_->Lock();\n msg_buffer_out_.append(msg);\n mutex_send_->Unlock();\n}\n\n\/\/ Send the whole buffer.\nvoid SVNetwork::Flush() {\n mutex_send_->Lock();\n while (msg_buffer_out_.size() > 0) {\n int i = send(stream_, msg_buffer_out_.c_str(), msg_buffer_out_.length(), 0);\n msg_buffer_out_.erase(0, i);\n }\n mutex_send_->Unlock();\n}\n\n\/\/ Receive a message from the server.\n\/\/ This will always return one line of char* (denoted by \\n).\nchar* SVNetwork::Receive() {\n char* result = NULL;\n#if defined(_WIN32) || defined(__CYGWIN__)\n if (has_content) { result = strtok (NULL, \"\\n\"); }\n#else\n if (buffer_ptr_ != NULL) { result = strtok_r(NULL, \"\\n\", &buffer_ptr_); }\n#endif\n\n \/\/ This means there is something left in the buffer and we return it.\n if (result != NULL) { return result;\n \/\/ Otherwise, we read from the stream_.\n } else {\n buffer_ptr_ = NULL;\n has_content = false;\n\n \/\/ The timeout length is not really important since we are looping anyway\n \/\/ until a new message is delivered.\n struct timeval tv;\n tv.tv_sec = 10;\n tv.tv_usec = 0;\n\n \/\/ Set the flags to return when the stream_ is ready to be read.\n fd_set readfds;\n FD_ZERO(&readfds);\n FD_SET(stream_, &readfds);\n\n int i = select(stream_+1, &readfds, NULL, NULL, &tv);\n\n \/\/ The stream_ died.\n if (i == 0) { return NULL; }\n\n \/\/ Read the message buffer.\n i = recv(stream_, msg_buffer_in_, kMaxMsgSize, 0);\n\n \/\/ Server quit (0) or error (-1).\n if (i <= 0) { return NULL; }\n msg_buffer_in_[i] = '\\0';\n has_content = true;\n#ifdef _WIN32\n return strtok(msg_buffer_in_, \"\\n\");\n#else\n \/\/ Setup a new string tokenizer.\n return strtok_r(msg_buffer_in_, \"\\n\", &buffer_ptr_);\n#endif\n }\n}\n\n\/\/ Close the connection to the server.\nvoid SVNetwork::Close() {\n#ifdef _WIN32\n closesocket(stream_);\n#else\n close(stream_);\n#endif\n}\n\n\n\/\/ The program to invoke to start ScrollView\nstatic const char* ScrollViewProg() {\n#ifdef _WIN32\n const char* prog = \"java -Xms512m -Xmx1024m\";\n#else\n const char* prog = \"sh\";\n#endif\n return prog;\n}\n\n\n\/\/ The arguments to the program to invoke to start ScrollView\nstatic std::string ScrollViewCommand(std::string scrollview_path) {\n \/\/ The following ugly ifdef is to enable the output of the java runtime\n \/\/ to be sent down a black hole on non-windows to ignore all the\n \/\/ exceptions in piccolo. Ideally piccolo would be debugged to make\n \/\/ this unnecessary.\n \/\/ Also the path has to be separated by ; on windows and : otherwise.\n#ifdef _WIN32\n const char* cmd_template = \"-Djava.library.path=%s -jar %s\/ScrollView.jar\";\n\n#else\n const char* cmd_template = \"-c \\\"trap 'kill %%1' 0 1 2 ; java \"\n \"-Xms1024m -Xmx2048m -jar %s\/ScrollView.jar\"\n \" & wait\\\"\";\n#endif\n int cmdlen = strlen(cmd_template) + 4*strlen(scrollview_path.c_str()) + 1;\n char* cmd = new char[cmdlen];\n const char* sv_path = scrollview_path.c_str();\n snprintf(cmd, cmdlen, cmd_template, sv_path, sv_path, sv_path, sv_path);\n std::string command(cmd);\n delete [] cmd;\n return command;\n}\n\n\n\/\/ Platform-independent freeaddrinfo()\nstatic void FreeAddrInfo(struct addrinfo* addr_info) {\n #if defined(__linux__)\n freeaddrinfo(addr_info);\n #else\n delete addr_info->ai_addr;\n delete addr_info;\n #endif\n}\n\n\n\/\/ Non-linux version of getaddrinfo()\n#if !defined(__linux__)\nstatic int GetAddrInfoNonLinux(const char* hostname, int port,\n struct addrinfo** addr_info) {\n\/\/ Get the host data depending on the OS.\n struct sockaddr_in* address;\n *addr_info = new struct addrinfo;\n memset(*addr_info, 0, sizeof(struct addrinfo));\n address = new struct sockaddr_in;\n memset(address, 0, sizeof(struct sockaddr_in));\n\n (*addr_info)->ai_addr = (struct sockaddr*) address;\n (*addr_info)->ai_addrlen = sizeof(struct sockaddr);\n (*addr_info)->ai_family = AF_INET;\n (*addr_info)->ai_socktype = SOCK_STREAM;\n\n struct hostent *name;\n#ifdef _WIN32\n WSADATA wsaData;\n WSAStartup(MAKEWORD(1, 1), &wsaData);\n name = gethostbyname(hostname);\n#else\n name = gethostbyname(hostname);\n#endif\n\n if (name == NULL) {\n FreeAddrInfo(*addr_info);\n *addr_info = NULL;\n return -1;\n }\n\n \/\/ Fill in the appropriate variables to be able to connect to the server.\n address->sin_family = name->h_addrtype;\n memcpy((char *) &address->sin_addr.s_addr,\n name->h_addr_list[0], name->h_length);\n address->sin_port = htons(port);\n return 0;\n}\n#endif\n\n\n\/\/ Platform independent version of getaddrinfo()\n\/\/ Given a hostname:port, produce an addrinfo struct\nstatic int GetAddrInfo(const char* hostname, int port,\n struct addrinfo** address) {\n#if defined(__linux__)\n char port_str[40];\n snprintf(port_str, 40, \"%ld\", port);\n return getaddrinfo(hostname, port_str, NULL, address);\n#else\n return GetAddrInfoNonLinux(hostname, port, address);\n#endif\n}\n\n\n\/\/ Set up a connection to a ScrollView on hostname:port.\nSVNetwork::SVNetwork(const char* hostname, int port) {\n mutex_send_ = new SVMutex();\n msg_buffer_in_ = new char[kMaxMsgSize + 1];\n msg_buffer_in_[0] = '\\0';\n\n has_content = false;\n buffer_ptr_ = NULL;\n\n struct addrinfo *addr_info = NULL;\n\n if (GetAddrInfo(hostname, port, &addr_info) != 0) {\n std::cerr << \"Error resolving name for ScrollView host \"\n << std::string(hostname) << \":\" << port << std::endl;\n }\n\n stream_ = socket(addr_info->ai_family, addr_info->ai_socktype,\n addr_info->ai_protocol);\n\n \/\/ If server is not there, we will start a new server as local child process.\n if (connect(stream_, addr_info->ai_addr, addr_info->ai_addrlen) < 0) {\n const char* scrollview_path = getenv(\"SCROLLVIEW_PATH\");\n if (scrollview_path == NULL) {\n#ifdef SCROLLVIEW_PATH\n#define _STR(a) #a\n#define _XSTR(a) _STR(a)\n scrollview_path = _XSTR(SCROLLVIEW_PATH);\n#undef _XSTR\n#undef _STR\n#else\n scrollview_path = \".\";\n#endif\n }\n const char *prog = ScrollViewProg();\n std::string command = ScrollViewCommand(scrollview_path);\n SVSync::StartProcess(prog, command.c_str());\n\n \/\/ Wait for server to show up.\n \/\/ Note: There is no exception handling in case the server never turns up.\n\n stream_ = socket(addr_info->ai_family, addr_info->ai_socktype,\n addr_info->ai_protocol);\n\n while (connect(stream_, addr_info->ai_addr,\n addr_info->ai_addrlen) < 0) {\n std::cout << \"ScrollView: Waiting for server...\\n\";\n#ifdef _WIN32\n Sleep(1000);\n#else\n sleep(1);\n#endif\n\n stream_ = socket(addr_info->ai_family, addr_info->ai_socktype,\n addr_info->ai_protocol);\n }\n }\n FreeAddrInfo(addr_info);\n}\n\nSVNetwork::~SVNetwork() {\n delete[] msg_buffer_in_;\n delete mutex_send_;\n}\n\n#endif \/\/ GRAPHICS_DISABLED\n<commit_msg>viewer\/svutils.cpp: Include <sys\/select.h> for FD_SET, ...<commit_after>\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ File: svutil.cpp\n\/\/ Description: ScrollView Utilities\n\/\/ Author: Joern Wanke\n\/\/ Created: Thu Nov 29 2007\n\/\/\n\/\/ (C) Copyright 2007, 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\/\/ SVUtil contains the SVSync and SVNetwork classes, which are used for\n\/\/ thread\/process creation & synchronization and network connection.\n\n#include <stdio.h>\n#ifdef _WIN32\nstruct addrinfo {\n struct sockaddr* ai_addr;\n int ai_addrlen;\n int ai_family;\n int ai_socktype;\n int ai_protocol;\n};\n#else\n#include <arpa\/inet.h>\n#include <netinet\/in.h>\n#include <pthread.h>\n#include <semaphore.h>\n#include <signal.h>\n#include <stdlib.h>\n#include <string.h>\n#include <netdb.h>\n#include <sys\/select.h>\n#include <sys\/socket.h>\n#ifdef __linux__\n#include <sys\/prctl.h>\n#endif\n#include <unistd.h>\n#endif\n\n#include <cstdlib>\n#include <cstring>\n#include <iostream>\n#include <string>\n\n\/\/ Include automatically generated configuration file if running autoconf.\n#ifdef HAVE_CONFIG_H\n#include \"config_auto.h\"\n#endif\n\n#ifndef GRAPHICS_DISABLED\n\n#include \"svutil.h\"\n\nconst int kBufferSize = 65536;\nconst int kMaxMsgSize = 4096;\n\n\/\/ Signals a thread to exit.\nvoid SVSync::ExitThread() {\n#ifdef _WIN32\n \/\/ ExitThread(0);\n#else\n pthread_exit(0);\n#endif\n}\n\n\/\/ Starts a new process.\nvoid SVSync::StartProcess(const char* executable, const char* args) {\n std::string proc;\n proc.append(executable);\n proc.append(\" \");\n proc.append(args);\n std::cout << \"Starting \" << proc << std::endl;\n#ifdef _WIN32\n STARTUPINFO start_info;\n PROCESS_INFORMATION proc_info;\n GetStartupInfo(&start_info);\n if (!CreateProcess(NULL, const_cast<char*>(proc.c_str()), NULL, NULL, FALSE,\n CREATE_NO_WINDOW | DETACHED_PROCESS, NULL, NULL,\n &start_info, &proc_info))\n return;\n#else\n int pid = fork();\n if (pid != 0) { \/\/ The father process returns\n } else {\n#ifdef __linux__\n \/\/ Make sure the java process terminates on exit, since its\n \/\/ broken socket detection seems to be useless.\n prctl(PR_SET_PDEATHSIG, 2, 0, 0, 0);\n#endif\n char* mutable_args = strdup(args);\n int argc = 1;\n for (int i = 0; mutable_args[i]; ++i) {\n if (mutable_args[i] == ' ') {\n ++argc;\n }\n }\n char** argv = new char*[argc + 2];\n argv[0] = strdup(executable);\n argv[1] = mutable_args;\n argc = 2;\n bool inquote = false;\n for (int i = 0; mutable_args[i]; ++i) {\n if (!inquote && mutable_args[i] == ' ') {\n mutable_args[i] = '\\0';\n argv[argc++] = mutable_args + i + 1;\n } else if (mutable_args[i] == '\"') {\n inquote = !inquote;\n mutable_args[i] = ' ';\n }\n }\n argv[argc] = NULL;\n execvp(executable, argv);\n }\n#endif\n}\n\nSVSemaphore::SVSemaphore() {\n#ifdef _WIN32\n semaphore_ = CreateSemaphore(0, 0, 10, 0);\n#elif defined(__APPLE__)\n char name[50];\n snprintf(name, sizeof(name), \"%ld\", random());\n sem_unlink(name);\n semaphore_ = sem_open(name, O_CREAT , S_IWUSR, 0);\n if (semaphore_ == SEM_FAILED) {\n perror(\"sem_open\");\n }\n#else\n sem_init(&semaphore_, 0, 0);\n#endif\n}\n\nvoid SVSemaphore::Signal() {\n#ifdef _WIN32\n ReleaseSemaphore(semaphore_, 1, NULL);\n#elif defined(__APPLE__)\n sem_post(semaphore_);\n#else\n sem_post(&semaphore_);\n#endif\n}\n\nvoid SVSemaphore::Wait() {\n#ifdef _WIN32\n WaitForSingleObject(semaphore_, INFINITE);\n#elif defined(__APPLE__)\n sem_wait(semaphore_);\n#else\n sem_wait(&semaphore_);\n#endif\n}\n\nSVMutex::SVMutex() {\n#ifdef _WIN32\n mutex_ = CreateMutex(0, FALSE, 0);\n#else\n pthread_mutex_init(&mutex_, NULL);\n#endif\n}\n\nvoid SVMutex::Lock() {\n#ifdef _WIN32\n WaitForSingleObject(mutex_, INFINITE);\n#else\n pthread_mutex_lock(&mutex_);\n#endif\n}\n\nvoid SVMutex::Unlock() {\n#ifdef _WIN32\n ReleaseMutex(mutex_);\n#else\n pthread_mutex_unlock(&mutex_);\n#endif\n}\n\n\/\/ Create new thread.\n\nvoid SVSync::StartThread(void *(*func)(void*), void* arg) {\n#ifdef _WIN32\n LPTHREAD_START_ROUTINE f = (LPTHREAD_START_ROUTINE) func;\n DWORD threadid;\n HANDLE newthread = CreateThread(\n NULL, \/\/ default security attributes\n 0, \/\/ use default stack size\n f, \/\/ thread function\n arg, \/\/ argument to thread function\n 0, \/\/ use default creation flags\n &threadid); \/\/ returns the thread identifier\n#else\n pthread_t helper;\n pthread_create(&helper, NULL, func, arg);\n#endif\n}\n\n\/\/ Place a message in the message buffer (and flush it).\nvoid SVNetwork::Send(const char* msg) {\n mutex_send_->Lock();\n msg_buffer_out_.append(msg);\n mutex_send_->Unlock();\n}\n\n\/\/ Send the whole buffer.\nvoid SVNetwork::Flush() {\n mutex_send_->Lock();\n while (msg_buffer_out_.size() > 0) {\n int i = send(stream_, msg_buffer_out_.c_str(), msg_buffer_out_.length(), 0);\n msg_buffer_out_.erase(0, i);\n }\n mutex_send_->Unlock();\n}\n\n\/\/ Receive a message from the server.\n\/\/ This will always return one line of char* (denoted by \\n).\nchar* SVNetwork::Receive() {\n char* result = NULL;\n#if defined(_WIN32) || defined(__CYGWIN__)\n if (has_content) { result = strtok (NULL, \"\\n\"); }\n#else\n if (buffer_ptr_ != NULL) { result = strtok_r(NULL, \"\\n\", &buffer_ptr_); }\n#endif\n\n \/\/ This means there is something left in the buffer and we return it.\n if (result != NULL) { return result;\n \/\/ Otherwise, we read from the stream_.\n } else {\n buffer_ptr_ = NULL;\n has_content = false;\n\n \/\/ The timeout length is not really important since we are looping anyway\n \/\/ until a new message is delivered.\n struct timeval tv;\n tv.tv_sec = 10;\n tv.tv_usec = 0;\n\n \/\/ Set the flags to return when the stream_ is ready to be read.\n fd_set readfds;\n FD_ZERO(&readfds);\n FD_SET(stream_, &readfds);\n\n int i = select(stream_+1, &readfds, NULL, NULL, &tv);\n\n \/\/ The stream_ died.\n if (i == 0) { return NULL; }\n\n \/\/ Read the message buffer.\n i = recv(stream_, msg_buffer_in_, kMaxMsgSize, 0);\n\n \/\/ Server quit (0) or error (-1).\n if (i <= 0) { return NULL; }\n msg_buffer_in_[i] = '\\0';\n has_content = true;\n#ifdef _WIN32\n return strtok(msg_buffer_in_, \"\\n\");\n#else\n \/\/ Setup a new string tokenizer.\n return strtok_r(msg_buffer_in_, \"\\n\", &buffer_ptr_);\n#endif\n }\n}\n\n\/\/ Close the connection to the server.\nvoid SVNetwork::Close() {\n#ifdef _WIN32\n closesocket(stream_);\n#else\n close(stream_);\n#endif\n}\n\n\n\/\/ The program to invoke to start ScrollView\nstatic const char* ScrollViewProg() {\n#ifdef _WIN32\n const char* prog = \"java -Xms512m -Xmx1024m\";\n#else\n const char* prog = \"sh\";\n#endif\n return prog;\n}\n\n\n\/\/ The arguments to the program to invoke to start ScrollView\nstatic std::string ScrollViewCommand(std::string scrollview_path) {\n \/\/ The following ugly ifdef is to enable the output of the java runtime\n \/\/ to be sent down a black hole on non-windows to ignore all the\n \/\/ exceptions in piccolo. Ideally piccolo would be debugged to make\n \/\/ this unnecessary.\n \/\/ Also the path has to be separated by ; on windows and : otherwise.\n#ifdef _WIN32\n const char* cmd_template = \"-Djava.library.path=%s -jar %s\/ScrollView.jar\";\n\n#else\n const char* cmd_template = \"-c \\\"trap 'kill %%1' 0 1 2 ; java \"\n \"-Xms1024m -Xmx2048m -jar %s\/ScrollView.jar\"\n \" & wait\\\"\";\n#endif\n int cmdlen = strlen(cmd_template) + 4*strlen(scrollview_path.c_str()) + 1;\n char* cmd = new char[cmdlen];\n const char* sv_path = scrollview_path.c_str();\n snprintf(cmd, cmdlen, cmd_template, sv_path, sv_path, sv_path, sv_path);\n std::string command(cmd);\n delete [] cmd;\n return command;\n}\n\n\n\/\/ Platform-independent freeaddrinfo()\nstatic void FreeAddrInfo(struct addrinfo* addr_info) {\n #if defined(__linux__)\n freeaddrinfo(addr_info);\n #else\n delete addr_info->ai_addr;\n delete addr_info;\n #endif\n}\n\n\n\/\/ Non-linux version of getaddrinfo()\n#if !defined(__linux__)\nstatic int GetAddrInfoNonLinux(const char* hostname, int port,\n struct addrinfo** addr_info) {\n\/\/ Get the host data depending on the OS.\n struct sockaddr_in* address;\n *addr_info = new struct addrinfo;\n memset(*addr_info, 0, sizeof(struct addrinfo));\n address = new struct sockaddr_in;\n memset(address, 0, sizeof(struct sockaddr_in));\n\n (*addr_info)->ai_addr = (struct sockaddr*) address;\n (*addr_info)->ai_addrlen = sizeof(struct sockaddr);\n (*addr_info)->ai_family = AF_INET;\n (*addr_info)->ai_socktype = SOCK_STREAM;\n\n struct hostent *name;\n#ifdef _WIN32\n WSADATA wsaData;\n WSAStartup(MAKEWORD(1, 1), &wsaData);\n name = gethostbyname(hostname);\n#else\n name = gethostbyname(hostname);\n#endif\n\n if (name == NULL) {\n FreeAddrInfo(*addr_info);\n *addr_info = NULL;\n return -1;\n }\n\n \/\/ Fill in the appropriate variables to be able to connect to the server.\n address->sin_family = name->h_addrtype;\n memcpy((char *) &address->sin_addr.s_addr,\n name->h_addr_list[0], name->h_length);\n address->sin_port = htons(port);\n return 0;\n}\n#endif\n\n\n\/\/ Platform independent version of getaddrinfo()\n\/\/ Given a hostname:port, produce an addrinfo struct\nstatic int GetAddrInfo(const char* hostname, int port,\n struct addrinfo** address) {\n#if defined(__linux__)\n char port_str[40];\n snprintf(port_str, 40, \"%ld\", port);\n return getaddrinfo(hostname, port_str, NULL, address);\n#else\n return GetAddrInfoNonLinux(hostname, port, address);\n#endif\n}\n\n\n\/\/ Set up a connection to a ScrollView on hostname:port.\nSVNetwork::SVNetwork(const char* hostname, int port) {\n mutex_send_ = new SVMutex();\n msg_buffer_in_ = new char[kMaxMsgSize + 1];\n msg_buffer_in_[0] = '\\0';\n\n has_content = false;\n buffer_ptr_ = NULL;\n\n struct addrinfo *addr_info = NULL;\n\n if (GetAddrInfo(hostname, port, &addr_info) != 0) {\n std::cerr << \"Error resolving name for ScrollView host \"\n << std::string(hostname) << \":\" << port << std::endl;\n }\n\n stream_ = socket(addr_info->ai_family, addr_info->ai_socktype,\n addr_info->ai_protocol);\n\n \/\/ If server is not there, we will start a new server as local child process.\n if (connect(stream_, addr_info->ai_addr, addr_info->ai_addrlen) < 0) {\n const char* scrollview_path = getenv(\"SCROLLVIEW_PATH\");\n if (scrollview_path == NULL) {\n#ifdef SCROLLVIEW_PATH\n#define _STR(a) #a\n#define _XSTR(a) _STR(a)\n scrollview_path = _XSTR(SCROLLVIEW_PATH);\n#undef _XSTR\n#undef _STR\n#else\n scrollview_path = \".\";\n#endif\n }\n const char *prog = ScrollViewProg();\n std::string command = ScrollViewCommand(scrollview_path);\n SVSync::StartProcess(prog, command.c_str());\n\n \/\/ Wait for server to show up.\n \/\/ Note: There is no exception handling in case the server never turns up.\n\n stream_ = socket(addr_info->ai_family, addr_info->ai_socktype,\n addr_info->ai_protocol);\n\n while (connect(stream_, addr_info->ai_addr,\n addr_info->ai_addrlen) < 0) {\n std::cout << \"ScrollView: Waiting for server...\\n\";\n#ifdef _WIN32\n Sleep(1000);\n#else\n sleep(1);\n#endif\n\n stream_ = socket(addr_info->ai_family, addr_info->ai_socktype,\n addr_info->ai_protocol);\n }\n }\n FreeAddrInfo(addr_info);\n}\n\nSVNetwork::~SVNetwork() {\n delete[] msg_buffer_in_;\n delete mutex_send_;\n}\n\n#endif \/\/ GRAPHICS_DISABLED\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\tstd::vector<double>& record_joint\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 record_joint = 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\tstd::vector<double> record_joint_1;\n\tstd::vector<double> record_joint_2;\n\tstd::vector<double> record_joint_3;\n\n double joint_value = 0;\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, record_joint_1);\n\tfor(int i = 0; i<record_joint_1.size(); i++){\n\t\tjoint_value = record_joint_1[i]*180\/M_PI;\n\t\tprintf(\"Joint %d: degree: %lf, rad: %lf\\n\", i+1, joint_value, record_joint_1[i]);\n\t}\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>implement get_current_joint_values in 'main'<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\tstd::vector<double>& record_joint\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 record_joint = 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\tstd::vector<double> record_joint_1;\n\tstd::vector<double> record_joint_2;\n\tstd::vector<double> record_joint_3;\n\n double joint_value = 0;\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, record_joint_1);\n\n printf(\"*****************************************************************\");\n\tfor(int i = 0; i<record_joint_1.size(); i++){\n\t\tjoint_value = record_joint_1[i]*180\/M_PI;\n\t\tprintf(\"Joint %d: degree: %lf, rad: %lf\\n\", i+1, joint_value, record_joint_1[i]);\n\t}\n printf(\"******************************************************************\");<\/record_joint_1>\n \/\/try_move_to_named_target(group, my_plan, \"ready\", 100);\n sleep(3);\n\/*\n try_move_to_joint_target(group, my_plan, record_joint_1, 100);\n sleep(3);\n try_move_to_joint_target(group, my_plan, joint_target_1, 100);\n sleep(3);\n try_move_to_joint_target(group, my_plan, joint_target_2, 100);\n sleep(3);\n*\/\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>\/\/ $Id: mesh_refinement_smoothing.C,v 1.11 2005-05-18 18:07:36 roystgnr Exp $\n\n\/\/ The libMesh Finite Element Library.\n\/\/ Copyright (C) 2002-2005 Benjamin S. Kirk, John W. Peterson\n \n\/\/ This library is free software; you can redistribute it and\/or\n\/\/ modify it under the terms of the GNU Lesser General Public\n\/\/ License as published by the Free Software Foundation; either\n\/\/ version 2.1 of the License, or (at your option) any later version.\n \n\/\/ This library is distributed in the hope that it will be useful,\n\/\/ but WITHOUT ANY WARRANTY; without even the implied warranty of\n\/\/ MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU\n\/\/ Lesser General Public License for more details.\n \n\/\/ You should have received a copy of the GNU Lesser General Public\n\/\/ License along with this library; if not, write to the Free Software\n\/\/ Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA\n\n\n\n\/\/ 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#include \"mesh_refinement.h\"\n#include \"mesh_base.h\"\n#include \"elem.h\"\n\n\n\n\/\/-----------------------------------------------------------------\n\/\/ Mesh refinement methods\nbool MeshRefinement::limit_level_mismatch_at_node (const unsigned int max_mismatch)\n{\n bool flags_changed = false;\n\n\n \/\/ Vector holding the maximum element level that touches a node.\n std::vector<unsigned char> max_level_at_node (_mesh.n_nodes(), 0);\n\n\n \/\/ Loop over all the active elements & fill the vector\n {\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\tconst Elem* elem = *elem_it;\t\n\tconst unsigned char elem_level =\n\t elem->level() + ((elem->refinement_flag() == Elem::REFINE) ? 1 : 0);\n\n\t\/\/ Set the max_level at each node\n\tfor (unsigned int n=0; n<elem->n_nodes(); n++)\n\t {\n\t const unsigned int node_number = elem->node(n);\n\n\t assert (node_number < max_level_at_node.size());\n\t \n\t max_level_at_node[node_number] =\n\t std::max (max_level_at_node[node_number], elem_level);\n\t }\n } \n }\n\n\n \/\/ Now loop over the active elements and flag the elements\n \/\/ who violate the requested level mismatch\n {\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\tElem* elem = *elem_it;\t\n\tconst unsigned int elem_level = elem->level();\n\t\n\t\/\/ Skip the element if it is already flagged\n\tif (elem->refinement_flag() == Elem::REFINE)\n\t continue;\n\n\t\/\/ Loop over the nodes, check for possible mismatch\n\tfor (unsigned int n=0; n<elem->n_nodes(); n++)\n\t {\n\t const unsigned int node_number = elem->node(n);\n\n\t \/\/ Flag the element for refinement if it violates\n\t \/\/ the requested level mismatch\n\t if ( (elem_level + max_mismatch) < max_level_at_node[node_number])\n\t {\n\t\telem->set_refinement_flag (Elem::REFINE);\n\t\tflags_changed = true;\n\t }\n\t }\n } \n }\n \n return flags_changed;\n}\n\n\n\n\nbool MeshRefinement::eliminate_unrefined_patches ()\n{\n bool flags_changed = false;\n\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 my_level = elem->level();\n bool flag_me = true;\n\n\n \/\/ Skip the element if it is already flagged for refinement\n if (elem->refinement_flag() == Elem::REFINE)\n\tcontinue;\n \n \/\/ Test the parent if that is already flagged for coarsening\n if (elem->refinement_flag() == Elem::COARSEN)\n {\n assert(elem->parent());\n \/\/ FIXME: this is reasonable, but why don't we have a non-const\n \/\/ Elem::parent() to begin with?\n\t elem = const_cast<Elem *>(elem->parent());\n if (elem->refinement_flag() != Elem::COARSEN_INACTIVE)\n continue;\n }\n\n \/\/ Check all the element neighbors\n for (unsigned int n=0; n<elem->n_neighbors(); n++)\n\t\/\/ Quit if the element is on the boundary, or\n\t\/\/ if the neighbor is active and will not be refined;\n\t\/\/ then we do not need to refine ourselves.\n\tif (elem->neighbor(n) == NULL ||\n\t ((elem->neighbor(n)->level() <= my_level) &&\n\t (elem->neighbor(n)->active()) &&\n\t (elem->neighbor(n)->refinement_flag() != Elem::REFINE))\n || (elem->neighbor(n)->refinement_flag() ==\n Elem::COARSEN_INACTIVE))\n {\n\t flag_me = false;\n break;\n }\n\n if (flag_me)\n\t{\n\t \/\/ Parents that would create islands should no longer\n \/\/ coarsen\n if (elem->refinement_flag() == Elem::COARSEN_INACTIVE)\n {\n for (unsigned int c=0; c<elem->n_children(); c++)\n {\n assert(elem->child(c)->refinement_flag() ==\n Elem::COARSEN);\n elem->child(c)->set_refinement_flag(Elem::DO_NOTHING);\n }\n elem->set_refinement_flag(Elem::INACTIVE);\n }\n else\n\t elem->set_refinement_flag(Elem::REFINE);\n\t flags_changed = true;\n\t} \n }\n\n return flags_changed;\n}\n\n\n#endif\n<commit_msg>Fix false positives in detection of unrefined islands.<commit_after>\/\/ $Id: mesh_refinement_smoothing.C,v 1.12 2006-04-17 21:18:09 roystgnr Exp $\n\n\/\/ The libMesh Finite Element Library.\n\/\/ Copyright (C) 2002-2005 Benjamin S. Kirk, John W. Peterson\n \n\/\/ This library is free software; you can redistribute it and\/or\n\/\/ modify it under the terms of the GNU Lesser General Public\n\/\/ License as published by the Free Software Foundation; either\n\/\/ version 2.1 of the License, or (at your option) any later version.\n \n\/\/ This library is distributed in the hope that it will be useful,\n\/\/ but WITHOUT ANY WARRANTY; without even the implied warranty of\n\/\/ MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU\n\/\/ Lesser General Public License for more details.\n \n\/\/ You should have received a copy of the GNU Lesser General Public\n\/\/ License along with this library; if not, write to the Free Software\n\/\/ Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA\n\n\n\n\/\/ 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#include \"mesh_refinement.h\"\n#include \"mesh_base.h\"\n#include \"elem.h\"\n\n\n\n\/\/-----------------------------------------------------------------\n\/\/ Mesh refinement methods\nbool MeshRefinement::limit_level_mismatch_at_node (const unsigned int max_mismatch)\n{\n bool flags_changed = false;\n\n\n \/\/ Vector holding the maximum element level that touches a node.\n std::vector<unsigned char> max_level_at_node (_mesh.n_nodes(), 0);\n\n\n \/\/ Loop over all the active elements & fill the vector\n {\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\tconst Elem* elem = *elem_it;\t\n\tconst unsigned char elem_level =\n\t elem->level() + ((elem->refinement_flag() == Elem::REFINE) ? 1 : 0);\n\n\t\/\/ Set the max_level at each node\n\tfor (unsigned int n=0; n<elem->n_nodes(); n++)\n\t {\n\t const unsigned int node_number = elem->node(n);\n\n\t assert (node_number < max_level_at_node.size());\n\t \n\t max_level_at_node[node_number] =\n\t std::max (max_level_at_node[node_number], elem_level);\n\t }\n } \n }\n\n\n \/\/ Now loop over the active elements and flag the elements\n \/\/ who violate the requested level mismatch\n {\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\tElem* elem = *elem_it;\t\n\tconst unsigned int elem_level = elem->level();\n\t\n\t\/\/ Skip the element if it is already flagged\n\tif (elem->refinement_flag() == Elem::REFINE)\n\t continue;\n\n\t\/\/ Loop over the nodes, check for possible mismatch\n\tfor (unsigned int n=0; n<elem->n_nodes(); n++)\n\t {\n\t const unsigned int node_number = elem->node(n);\n\n\t \/\/ Flag the element for refinement if it violates\n\t \/\/ the requested level mismatch\n\t if ( (elem_level + max_mismatch) < max_level_at_node[node_number])\n\t {\n\t\telem->set_refinement_flag (Elem::REFINE);\n\t\tflags_changed = true;\n\t }\n\t }\n } \n }\n \n return flags_changed;\n}\n\n\n\n\nbool MeshRefinement::eliminate_unrefined_patches ()\n{\n bool flags_changed = false;\n\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 my_level = elem->level();\n bool flag_me = true;\n\n\n \/\/ Skip the element if it is already flagged for refinement\n if (elem->refinement_flag() == Elem::REFINE)\n\tcontinue;\n \n \/\/ Test the parent if that is already flagged for coarsening\n if (elem->refinement_flag() == Elem::COARSEN)\n {\n assert(elem->parent());\n \/\/ FIXME: this is reasonable, but why don't we have a non-const\n \/\/ Elem::parent() to begin with?\n\t elem = const_cast<Elem *>(elem->parent());\n if (elem->refinement_flag() != Elem::COARSEN_INACTIVE)\n continue;\n }\n\n \/\/ Check all the element neighbors\n for (unsigned int n=0; n<elem->n_neighbors(); n++)\n\t\/\/ Quit if the element is on the boundary, or\n\t\/\/ if the neighbor is active and will not be refined;\n\t\/\/ then we do not need to refine ourselves.\n\tif (elem->neighbor(n) == NULL ||\n\t (elem->neighbor(n)->level() < my_level) ||\n\t ((elem->neighbor(n)->active()) &&\n\t (elem->neighbor(n)->refinement_flag() != Elem::REFINE))\n || (elem->neighbor(n)->refinement_flag() ==\n Elem::COARSEN_INACTIVE))\n {\n\t flag_me = false;\n break;\n }\n\n if (flag_me)\n\t{\n\t \/\/ Parents that would create islands should no longer\n \/\/ coarsen\n if (elem->refinement_flag() == Elem::COARSEN_INACTIVE)\n {\n for (unsigned int c=0; c<elem->n_children(); c++)\n {\n assert(elem->child(c)->refinement_flag() ==\n Elem::COARSEN);\n elem->child(c)->set_refinement_flag(Elem::DO_NOTHING);\n }\n elem->set_refinement_flag(Elem::INACTIVE);\n }\n else\n\t elem->set_refinement_flag(Elem::REFINE);\n\t flags_changed = true;\n\t} \n }\n\n return flags_changed;\n}\n\n\n#endif\n<|endoftext|>"} {"text":"<commit_before>\/\/ Copyright 2004-present Facebook. All Rights Reserved.\n\n#include \"osquery\/tables\/system\/processes.h\"\n\n#include <algorithm>\n#include <map>\n#include <vector>\n#include <string>\n\n#include <libproc.h>\n#include <stdlib.h>\n\n#include <boost\/filesystem\/operations.hpp>\n#include <boost\/filesystem\/path.hpp>\n#include <boost\/lexical_cast.hpp>\n\n#include <glog\/logging.h>\n\n#include \"osquery\/core.h\"\n\nusing namespace osquery::core;\nusing namespace osquery::db;\n\nnamespace osquery { namespace tables {\n\nQueryData genProcesses() {\n QueryData results;\n std::vector<int> processed;\n std::map<int, int> parent_pid;\n\n \/\/ find how how many pids there are so that we can create an appropriately\n \/\/ sized data structure to store them\n int num_pids = proc_listpids(PROC_ALL_PIDS, 0, NULL, 0);\n if (num_pids <= 0) {\n LOG(ERROR) << \"An error occured retrieving the process list\";\n return {};\n }\n\n \/\/ arbitrarily create a list with 2x capacity in case more processes have\n \/\/ been loaded since the last proc_listpids was executed\n pid_t pids[num_pids * 2];\n memset(pids, 0, sizeof(pids));\n int s = proc_listpids(PROC_ALL_PIDS, 0, pids, sizeof(pids));\n if (s <= 0) {\n LOG(ERROR) << \"An error occured retrieving the process list\";\n return {};\n }\n\n for (const auto& pid : pids) {\n pid_t children[num_pids * 2];\n memset(children, 0, sizeof(children));\n proc_listchildpids(pid, children, sizeof(children));\n for (const auto& child : children) {\n parent_pid[child] = pid;\n }\n }\n\n for (const auto& pid : pids) {\n \/\/ if the pid is negative or 0, it doesn't represent a real process so\n \/\/ continue the iterations so that we don't add it to the results set\n if (pid <= 0) {\n continue;\n }\n\n \/\/ ensure that we process a pid once and only once\n if (std::find(processed.begin(), processed.end(), pid) != processed.end()) {\n continue;\n }\n processed.push_back(pid);\n\n \/\/ gather column data\n Row r;\n\n const auto parent_it = parent_pid.find(pid);\n if (parent_it != parent_pid.end()) {\n r[\"parent\"] = boost::lexical_cast<std::string>(parent_it->second);\n } else {\n r[\"parent\"] = \"-1\";\n }\n\n \/\/ process id\n r[\"pid\"] = boost::lexical_cast<std::string>(pid);\n\n \/\/ process name\n char name[1024];\n memset(name, 0, 1024);\n proc_name(pid, name, sizeof(name));\n r[\"name\"] = std::string(name);\n\n \/\/ if the path of the executable that started the process is available\n \/\/ and the path exists on disk, set on_disk to true. if the path is not\n \/\/ available, set on_disk to true. if, and only if, the path of the\n \/\/ executable is available and the file does not exist on disk, set on_disk\n \/\/ to false.\n char path[PROC_PIDPATHINFO_MAXSIZE];\n memset(path, 0, sizeof(path));\n proc_pidpath(pid, path, sizeof(path));\n r[\"path\"] = std::string(path);\n if (strlen(path) > 0) {\n if (!boost::filesystem::exists(r[\"path\"])) {\n r[\"on_disk\"] = \"0\";\n } else {\n r[\"on_disk\"] = \"1\";\n }\n } else {\n r[\"on_disk\"] = \"1\";\n }\n\n \/\/ systems usage and time information\n struct rusage_info_v2 rusage_info_data;\n int rusage_status = proc_pid_rusage(\n pid, RUSAGE_INFO_V2, (rusage_info_t*)&rusage_info_data);\n \/\/ proc_pid_rusage returns -1 if it was unable to gather information\n if (rusage_status == 0) {\n \/\/ size information\n r[\"wired_size\"] = boost::lexical_cast<std::string>(\n rusage_info_data.ri_wired_size);\n r[\"resident_size\"] = boost::lexical_cast<std::string>(\n rusage_info_data.ri_resident_size);\n r[\"phys_footprint\"] = boost::lexical_cast<std::string>(\n rusage_info_data.ri_phys_footprint);\n\n \/\/ time information\n r[\"user_time\"] = boost::lexical_cast<std::string>(\n rusage_info_data.ri_user_time);\n r[\"system_time\"] = boost::lexical_cast<std::string>(\n rusage_info_data.ri_system_time);\n r[\"start_time\"] = boost::lexical_cast<std::string>(\n rusage_info_data.ri_proc_start_abstime);\n }\n\n \/\/ save the results\n results.push_back(r);\n }\n\n return results;\n}\n\n}}\n<commit_msg>unordered_map and better logic around on_disk<commit_after>\/\/ Copyright 2004-present Facebook. All Rights Reserved.\n\n#include \"osquery\/tables\/system\/processes.h\"\n\n#include <algorithm>\n#include <map>\n#include <vector>\n#include <string>\n\n#include <libproc.h>\n#include <stdlib.h>\n\n#include <boost\/filesystem\/operations.hpp>\n#include <boost\/filesystem\/path.hpp>\n#include <boost\/lexical_cast.hpp>\n\n#include <glog\/logging.h>\n\n#include \"osquery\/core.h\"\n\nusing namespace osquery::core;\nusing namespace osquery::db;\n\nnamespace osquery { namespace tables {\n\nQueryData genProcesses() {\n QueryData results;\n std::vector<int> processed;\n std::unordered_map<int, int> parent_pid;\n\n \/\/ find how how many pids there are so that we can create an appropriately\n \/\/ sized data structure to store them\n int num_pids = proc_listpids(PROC_ALL_PIDS, 0, NULL, 0);\n if (num_pids <= 0) {\n LOG(ERROR) << \"An error occured retrieving the process list\";\n return {};\n }\n\n \/\/ arbitrarily create a list with 2x capacity in case more processes have\n \/\/ been loaded since the last proc_listpids was executed\n pid_t pids[num_pids * 2];\n memset(pids, 0, sizeof(pids));\n int s = proc_listpids(PROC_ALL_PIDS, 0, pids, sizeof(pids));\n if (s <= 0) {\n LOG(ERROR) << \"An error occured retrieving the process list\";\n return {};\n }\n\n for (const auto& pid : pids) {\n pid_t children[num_pids * 2];\n memset(children, 0, sizeof(children));\n proc_listchildpids(pid, children, sizeof(children));\n for (const auto& child : children) {\n parent_pid[child] = pid;\n }\n }\n\n for (const auto& pid : pids) {\n \/\/ if the pid is negative or 0, it doesn't represent a real process so\n \/\/ continue the iterations so that we don't add it to the results set\n if (pid <= 0) {\n continue;\n }\n\n \/\/ ensure that we process a pid once and only once\n if (std::find(processed.begin(), processed.end(), pid) != processed.end()) {\n continue;\n }\n processed.push_back(pid);\n\n \/\/ gather column data\n Row r;\n\n const auto parent_it = parent_pid.find(pid);\n if (parent_it != parent_pid.end()) {\n r[\"parent\"] = boost::lexical_cast<std::string>(parent_it->second);\n } else {\n r[\"parent\"] = \"-1\";\n }\n\n \/\/ process id\n r[\"pid\"] = boost::lexical_cast<std::string>(pid);\n\n \/\/ process name\n char name[1024];\n memset(name, 0, 1024);\n proc_name(pid, name, sizeof(name));\n r[\"name\"] = std::string(name);\n\n \/\/ if the path of the executable that started the process is available and\n \/\/ the path exists on disk, set on_disk to 1. if the path is not\n \/\/ available, set on_disk to -1. if, and only if, the path of the\n \/\/ executable is available and the file does not exist on disk, set on_disk\n \/\/ to 0.\n char path[PROC_PIDPATHINFO_MAXSIZE];\n memset(path, 0, sizeof(path));\n proc_pidpath(pid, path, sizeof(path));\n r[\"path\"] = std::string(path);\n if (strlen(path) > 0) {\n if (!boost::filesystem::exists(r[\"path\"])) {\n r[\"on_disk\"] = \"0\";\n } else {\n r[\"on_disk\"] = \"1\";\n }\n } else {\n r[\"on_disk\"] = \"-1\";\n }\n\n \/\/ systems usage and time information\n struct rusage_info_v2 rusage_info_data;\n int rusage_status = proc_pid_rusage(\n pid, RUSAGE_INFO_V2, (rusage_info_t*)&rusage_info_data);\n \/\/ proc_pid_rusage returns -1 if it was unable to gather information\n if (rusage_status == 0) {\n \/\/ size information\n r[\"wired_size\"] = boost::lexical_cast<std::string>(\n rusage_info_data.ri_wired_size);\n r[\"resident_size\"] = boost::lexical_cast<std::string>(\n rusage_info_data.ri_resident_size);\n r[\"phys_footprint\"] = boost::lexical_cast<std::string>(\n rusage_info_data.ri_phys_footprint);\n\n \/\/ time information\n r[\"user_time\"] = boost::lexical_cast<std::string>(\n rusage_info_data.ri_user_time);\n r[\"system_time\"] = boost::lexical_cast<std::string>(\n rusage_info_data.ri_system_time);\n r[\"start_time\"] = boost::lexical_cast<std::string>(\n rusage_info_data.ri_proc_start_abstime);\n }\n\n \/\/ save the results\n results.push_back(r);\n }\n\n return results;\n}\n\n}}\n<|endoftext|>"} {"text":"<commit_before>#include \"stdafx.h\"\n#include \"sceneGraph.h\"\n\n#include \"CommonLog.h\"\n\n#include <maya\/MItDag.h>\n#include <maya\/MFnDagNode.h>\n\nstatic MString __PythonBool[] = { MString(\"False\"), MString(\"True\") };\nstatic inline const MString &PythonBool(bool b)\n{\n\treturn __PythonBool[b?1:0];\n}\n\nstatic void __file_and_time_control_kill(const MString &var)\n{\n\tMGlobal::executePythonCommand(var + \" = None\\n\");\t\/\/ deallocate this variable in Python!\n}\n\nAlembicFileAndTimeControl::~AlembicFileAndTimeControl(void)\n{\n\t__file_and_time_control_kill(var);\n}\n\nAlembicFileAndTimeControlPtr AlembicFileAndTimeControl::createControl(const IJobStringParser& jobParams)\n{\n\tstatic unsigned int numberOfControlCreated = 0;\n\tstatic const MString format(\"^1s = ExoAlembic._import.IJobInfo(r\\\"^2s\\\", ^3s, ^4s, ^5s)\\n\");\n\n\tESS_PROFILE_SCOPE(\"AlembicFileAndTimeControl::createControl\");\n\tMString var(\"__alembic_file_and_time_control_tuple_\");\n\tvar += (++numberOfControlCreated);\n\n\tMString cmd;\n\tcmd.format(format, var, jobParams.filename.c_str(), PythonBool(jobParams.importNormals), PythonBool(jobParams.importUVs), PythonBool(jobParams.importFacesets));\n\tMStatus status = MGlobal::executePythonCommand(cmd);\n\tif (status != MS::kSuccess)\n\t{\n\t\t__file_and_time_control_kill(var);\n\t\treturn AlembicFileAndTimeControlPtr();\n\t}\n\treturn AlembicFileAndTimeControlPtr(new AlembicFileAndTimeControl(var));\n}\n\nbool SceneNodeMaya::replaceSimilarData(const char *functionName, SceneNodeAlembicPtr fileNode)\n{\n\tstatic const MString format(\"ExoAlembic._attach.attach^1s(r\\\"^2s\\\", r\\\"^3s\\\", ^4s, ^5s)\");\n\n\tESS_PROFILE_SCOPE(\"SceneNodeMaya::replaceSimilarData\");\n\tMString cmd;\n\tcmd.format(format, functionName, fileNode->name.c_str(), fileNode->dccIdentifier.c_str(), fileAndTime->variable(), PythonBool(fileNode->pObjCache->isConstant));\n\tMGlobal::executePythonCommand(cmd);\n\tfileNode->setAttached(true);\n\treturn true;\n}\n\nbool SceneNodeMaya::replaceData(SceneNodeAlembicPtr fileNode, const IJobStringParser& jobParams, SceneNodeAlembicPtr& nextFileNode)\n{\n\tESS_PROFILE_SCOPE(\"SceneNodeMaya::replaceData\");\n\tnextFileNode = fileNode;\n\tswitch(nextFileNode->type)\n\t{\n\tcase ETRANSFORM:\n\tcase ITRANSFORM:\n\t\treturn replaceSimilarData(\"Xform\", fileNode);\n\tcase CAMERA:\n\t\treturn replaceSimilarData(\"Camera\", fileNode);\n\tcase POLYMESH:\n\tcase SUBD:\n\t\treturn replaceSimilarData(\"PolyMesh\", fileNode);\n\tcase CURVES:\n\tcase HAIR:\n\t\treturn replaceSimilarData(\"Curves\", fileNode);\n\tcase PARTICLES:\n\t\treturn replaceSimilarData(\"Points\", fileNode);\n\t\/\/case SURFACE:\t\/\/ handle as default for now\n\t\t\/\/break;\n\t\/\/case LIGHT:\t\/\/ handle as default for now\n\t\t\/\/break;\n\tdefault:\n\t\tbreak;\n\t}\n\treturn false;\n}\n\nbool SceneNodeMaya::executeAddChild(const MString &cmd, SceneNodeAppPtr& newAppNode)\n{\n\tMString result;\n\tMGlobal::executePythonCommand(cmd, result);\n\tif (result.length() == 0)\n\t\treturn false;\n\telse if (result.asChar()[0] == '?')\n\t{\n#ifdef _DEBUG\n\t\tMGlobal::displayError(result);\n\t\tMGlobal::displayError(cmd);\n#endif\n\t\treturn false;\n\t}\n\n\tnewAppNode->dccIdentifier = result.asChar();\n\tnewAppNode->name = newAppNode->dccIdentifier;\n\treturn true;\n}\n\nbool SceneNodeMaya::addSimilarChild(const char *functionName, SceneNodeAlembicPtr fileNode, SceneNodeAppPtr& newAppNode)\n{\n\tstatic const MString format(\"ExoAlembic._import.import^1s(r\\\"^2s\\\", r\\\"^3s\\\", ^4s, r\\\"^5s\\\", ^6s)\");\n\n\tESS_PROFILE_SCOPE(\"SceneNodeMaya::addSimilarChild\");\n\tMString cmd;\n\tcmd.format(format, functionName, fileNode->name.c_str(), fileNode->dccIdentifier.c_str(), fileAndTime->variable(), dccIdentifier.c_str(), PythonBool(fileNode->pObjCache->isConstant));\n\treturn executeAddChild(cmd, newAppNode);\n}\n\nbool SceneNodeMaya::addXformChild(SceneNodeAlembicPtr fileNode, SceneNodeAppPtr& newAppNode)\n{\n\tstatic const MString format(\"ExoAlembic._import.importXform(r\\\"^1s\\\", r\\\"^2s\\\", ^3s, ^4s, ^5s)\");\n\n\tESS_PROFILE_SCOPE(\"SceneNodeMaya::addXformChild\");\n\tMString parent;\n\tswitch(type)\n\t{\n\tcase ETRANSFORM:\n\tcase ITRANSFORM:\n\t\tparent.format(\"\\\"^1s\\\"\", dccIdentifier.c_str());\n\t\tbreak;\n\tdefault:\n\t\tparent = \"None\";\n\t\tbreak;\n\t}\n\n\tMString cmd;\n\tcmd.format(format, fileNode->name.c_str(), fileNode->dccIdentifier.c_str(), fileAndTime->variable(), parent, PythonBool(fileNode->pObjCache->isConstant));\n\treturn executeAddChild(cmd, newAppNode);\n}\n\nbool SceneNodeMaya::addPolyMeshChild(SceneNodeAlembicPtr fileNode, SceneNodeAppPtr& newAppNode)\n{\n\tstatic const MString format(\"ExoAlembic._import.importPolyMesh(r\\\"^1s\\\", r\\\"^2s\\\", ^3s, \\\"^4s\\\", ^5s, ^6s)\");\n\n\tESS_PROFILE_SCOPE(\"SceneNodeMaya::addPolyMeshChild\");\n\tMString cmd;\n\tcmd.format(format,\tfileNode->name.c_str(),\tfileNode->dccIdentifier.c_str(),\t\t\t\tfileAndTime->variable(),\n\t\t\t\t\t\tdccIdentifier.c_str(),\tPythonBool(fileNode->pObjCache->isConstant),\tPythonBool(fileNode->pObjCache->isMeshTopoDynamic));\n\treturn executeAddChild(cmd, newAppNode);\n}\n\nbool SceneNodeMaya::addCurveChild(SceneNodeAlembicPtr fileNode, SceneNodeAppPtr& newAppNode)\n{\n\tstatic const MString format(\"ExoAlembic._import.importCurves(r\\\"^1s\\\", r\\\"^2s\\\", ^3s, r\\\"^4s\\\", ^5s, ^6s)\");\n\n\tMString strNb;\n\t{\n\t\tAbcG::ICurvesSchema::Sample sample;\n\t\tAbcG::ICurves obj(fileNode->getObject(), Abc::kWrapExisting);\n\t\tobj.getSchema().get(sample, 0);\n\n\t\tstrNb += (unsigned int)sample.getCurvesNumVertices()->size();\n\t}\n\n\tMString cmd;\n\tcmd.format(format, fileNode->name.c_str(), fileNode->dccIdentifier.c_str(), fileAndTime->variable(), dccIdentifier.c_str(), PythonBool(fileNode->pObjCache->isConstant), strNb);\n\treturn executeAddChild(cmd, newAppNode);\n}\n\nbool SceneNodeMaya::addChild(SceneNodeAlembicPtr fileNode, const IJobStringParser& jobParams, SceneNodeAppPtr& newAppNode)\n{\n\tESS_PROFILE_SCOPE(\"SceneNodeMaya::addChild\");\n\tnewAppNode.reset(new SceneNodeMaya(fileAndTime));\n\tswitch(newAppNode->type = fileNode->type)\n\t{\n\tcase ETRANSFORM:\n\tcase ITRANSFORM:\n\t\treturn addXformChild(fileNode, newAppNode);\n\tcase CAMERA:\n\t\treturn addSimilarChild(\"Camera\", fileNode, newAppNode);\n\tcase POLYMESH:\n\tcase SUBD:\n\t\treturn addPolyMeshChild(fileNode, newAppNode);\n\tcase CURVES:\n\tcase HAIR:\n\t\treturn addCurveChild(fileNode, newAppNode);\n\tcase PARTICLES:\n\t\treturn addSimilarChild(\"Points\", fileNode, newAppNode);\n\t\/\/case SURFACE:\t\/\/ handle as default for now\n\t\t\/\/break;\n\t\/\/case LIGHT:\t\/\/ handle as default for now\n\t\t\/\/break;\n\tdefault:\n\t\tbreak;\n\t}\n\treturn false;\n}\n\nvoid SceneNodeMaya::print(void)\n{\n\tESS_LOG_WARNING(\"Maya Scene Node: \" << dccIdentifier);\n}\n\nstatic bool visitChild(const MObject &mObj, SceneNodeAppPtr &parent, const AlembicFileAndTimeControlPtr &alembicFileAndTimeControl, const SearchReplace::ReplacePtr &replacer)\n{\n\t\/\/ check if it's a valid type of node first!\n\tSceneNodeAppPtr exoChild(new SceneNodeMaya(alembicFileAndTimeControl));\n\tswitch(mObj.apiType())\n\t{\n\tcase MFn::kCamera:\n\t\texoChild->type = SceneNode::CAMERA;\n\t\tbreak;\n\tcase MFn::kMesh:\n\t\texoChild->type = SceneNode::POLYMESH;\n\t\tbreak;\n\tcase MFn::kSubdiv:\n\t\texoChild->type = SceneNode::SUBD;\n\t\tbreak;\n\tcase MFn::kNurbsCurve:\n\t\texoChild->type = SceneNode::CURVES;\n\t\tbreak;\n\tcase MFn::kParticle:\n\t\texoChild->type = SceneNode::PARTICLES;\n\t\tbreak;\n\tcase MFn::kPfxHair:\n\t\texoChild->type = SceneNode::HAIR;\n\t\tbreak;\n\tcase MFn::kTransform:\n\tdefault:\n\t\texoChild->type = SceneNode::ETRANSFORM;\n\t\tbreak;\n\t}\n\n\tparent->children.push_back(exoChild);\n\texoChild->parent = parent.get();\n\n\tMFnDagNode dagNode(mObj);\n\texoChild->dccIdentifier = dagNode.fullPathName().asChar();\n\texoChild->name = replacer->replace(dagNode.partialPathName().asChar());\n\tfor (unsigned int i = 0; i < dagNode.childCount(); ++i)\n\t\tvisitChild(dagNode.child(i), exoChild, alembicFileAndTimeControl, replacer);\n\treturn true;\n}\n\nSceneNodeAppPtr buildMayaSceneGraph(const MDagPath &dagPath, const SearchReplace::ReplacePtr &replacer, const AlembicFileAndTimeControlPtr alembicFileAndTimeControl)\n{\n\tESS_PROFILE_SCOPE(\"buildMayaSceneGraph\");\n\tSceneNodeAppPtr exoRoot(new SceneNodeMaya(alembicFileAndTimeControl));\n\texoRoot->type = SceneNode::SCENE_ROOT;\n\texoRoot->dccIdentifier = dagPath.fullPathName().asChar();\n\texoRoot->name = dagPath.partialPathName().asChar();\n\tfor (unsigned int i = 0; i < dagPath.childCount(); ++i)\n\t\tvisitChild(dagPath.child(i), exoRoot, alembicFileAndTimeControl, replacer);\n\treturn exoRoot;\n}\n\n<commit_msg>fixed #271 no more problem with the unnamed transform node. But the hair still don't export properly.<commit_after>#include \"stdafx.h\"\n#include \"sceneGraph.h\"\n\n#include \"CommonLog.h\"\n\n#include <maya\/MItDag.h>\n#include <maya\/MFnDagNode.h>\n\nstatic MString __PythonBool[] = { MString(\"False\"), MString(\"True\") };\nstatic inline const MString &PythonBool(bool b)\n{\n\treturn __PythonBool[b?1:0];\n}\n\nstatic void __file_and_time_control_kill(const MString &var)\n{\n\tMGlobal::executePythonCommand(var + \" = None\\n\");\t\/\/ deallocate this variable in Python!\n}\n\nAlembicFileAndTimeControl::~AlembicFileAndTimeControl(void)\n{\n\t__file_and_time_control_kill(var);\n}\n\nAlembicFileAndTimeControlPtr AlembicFileAndTimeControl::createControl(const IJobStringParser& jobParams)\n{\n\tstatic unsigned int numberOfControlCreated = 0;\n\tstatic const MString format(\"^1s = ExoAlembic._import.IJobInfo(r\\\"^2s\\\", ^3s, ^4s, ^5s)\\n\");\n\n\tESS_PROFILE_SCOPE(\"AlembicFileAndTimeControl::createControl\");\n\tMString var(\"__alembic_file_and_time_control_tuple_\");\n\tvar += (++numberOfControlCreated);\n\n\tMString cmd;\n\tcmd.format(format, var, jobParams.filename.c_str(), PythonBool(jobParams.importNormals), PythonBool(jobParams.importUVs), PythonBool(jobParams.importFacesets));\n\tMStatus status = MGlobal::executePythonCommand(cmd);\n\tif (status != MS::kSuccess)\n\t{\n\t\t__file_and_time_control_kill(var);\n\t\treturn AlembicFileAndTimeControlPtr();\n\t}\n\treturn AlembicFileAndTimeControlPtr(new AlembicFileAndTimeControl(var));\n}\n\nbool SceneNodeMaya::replaceSimilarData(const char *functionName, SceneNodeAlembicPtr fileNode)\n{\n\tstatic const MString format(\"ExoAlembic._attach.attach^1s(r\\\"^2s\\\", r\\\"^3s\\\", ^4s, ^5s)\");\n\n\tESS_PROFILE_SCOPE(\"SceneNodeMaya::replaceSimilarData\");\n\tMString cmd;\n\tcmd.format(format, functionName, fileNode->name.c_str(), fileNode->dccIdentifier.c_str(), fileAndTime->variable(), PythonBool(fileNode->pObjCache->isConstant));\n\tMGlobal::executePythonCommand(cmd);\n\tfileNode->setAttached(true);\n\treturn true;\n}\n\nbool SceneNodeMaya::replaceData(SceneNodeAlembicPtr fileNode, const IJobStringParser& jobParams, SceneNodeAlembicPtr& nextFileNode)\n{\n\tESS_PROFILE_SCOPE(\"SceneNodeMaya::replaceData\");\n\tnextFileNode = fileNode;\n\tswitch(nextFileNode->type)\n\t{\n\tcase ETRANSFORM:\n\tcase ITRANSFORM:\n\t\treturn replaceSimilarData(\"Xform\", fileNode);\n\tcase CAMERA:\n\t\treturn replaceSimilarData(\"Camera\", fileNode);\n\tcase POLYMESH:\n\tcase SUBD:\n\t\treturn replaceSimilarData(\"PolyMesh\", fileNode);\n\tcase CURVES:\n\tcase HAIR:\n\t\treturn replaceSimilarData(\"Curves\", fileNode);\n\tcase PARTICLES:\n\t\treturn replaceSimilarData(\"Points\", fileNode);\n\t\/\/case SURFACE:\t\/\/ handle as default for now\n\t\t\/\/break;\n\t\/\/case LIGHT:\t\/\/ handle as default for now\n\t\t\/\/break;\n\tdefault:\n\t\tbreak;\n\t}\n\treturn false;\n}\n\nbool SceneNodeMaya::executeAddChild(const MString &cmd, SceneNodeAppPtr& newAppNode)\n{\n\tMString result;\n\tMGlobal::executePythonCommand(cmd, result);\n\tif (result.length() == 0)\n\t\treturn false;\n\telse if (result.asChar()[0] == '?')\n\t{\n#ifdef _DEBUG\n\t\tMGlobal::displayError(result);\n\t\tMGlobal::displayError(cmd);\n#endif\n\t\treturn false;\n\t}\n\n\tnewAppNode->dccIdentifier = result.asChar();\n\tnewAppNode->name = newAppNode->dccIdentifier;\n\treturn true;\n}\n\nbool SceneNodeMaya::addSimilarChild(const char *functionName, SceneNodeAlembicPtr fileNode, SceneNodeAppPtr& newAppNode)\n{\n\tstatic const MString format(\"ExoAlembic._import.import^1s(r\\\"^2s\\\", r\\\"^3s\\\", ^4s, r\\\"^5s\\\", ^6s)\");\n\n\tESS_PROFILE_SCOPE(\"SceneNodeMaya::addSimilarChild\");\n\tMString cmd;\n\tcmd.format(format, functionName, fileNode->name.c_str(), fileNode->dccIdentifier.c_str(), fileAndTime->variable(), dccIdentifier.c_str(), PythonBool(fileNode->pObjCache->isConstant));\n\treturn executeAddChild(cmd, newAppNode);\n}\n\nbool SceneNodeMaya::addXformChild(SceneNodeAlembicPtr fileNode, SceneNodeAppPtr& newAppNode)\n{\n\tstatic const MString format(\"ExoAlembic._import.importXform(r\\\"^1s\\\", r\\\"^2s\\\", ^3s, ^4s, ^5s)\");\n\n\tESS_PROFILE_SCOPE(\"SceneNodeMaya::addXformChild\");\n\tMString parent;\n\tswitch(type)\n\t{\n\tcase ETRANSFORM:\n\tcase ITRANSFORM:\n\t\tparent.format(\"\\\"^1s\\\"\", dccIdentifier.c_str());\n\t\tbreak;\n\tdefault:\n\t\tparent = \"None\";\n\t\tbreak;\n\t}\n\n\tMString cmd;\n\tcmd.format(format, fileNode->name.c_str(), fileNode->dccIdentifier.c_str(), fileAndTime->variable(), parent, PythonBool(fileNode->pObjCache->isConstant));\n\treturn executeAddChild(cmd, newAppNode);\n}\n\nbool SceneNodeMaya::addPolyMeshChild(SceneNodeAlembicPtr fileNode, SceneNodeAppPtr& newAppNode)\n{\n\tstatic const MString format(\"ExoAlembic._import.importPolyMesh(r\\\"^1s\\\", r\\\"^2s\\\", ^3s, \\\"^4s\\\", ^5s, ^6s)\");\n\n\tESS_PROFILE_SCOPE(\"SceneNodeMaya::addPolyMeshChild\");\n\tMString cmd;\n\tcmd.format(format,\tfileNode->name.c_str(),\tfileNode->dccIdentifier.c_str(),\t\t\t\tfileAndTime->variable(),\n\t\t\t\t\t\tdccIdentifier.c_str(),\tPythonBool(fileNode->pObjCache->isConstant),\tPythonBool(fileNode->pObjCache->isMeshTopoDynamic));\n\treturn executeAddChild(cmd, newAppNode);\n}\n\nbool SceneNodeMaya::addCurveChild(SceneNodeAlembicPtr fileNode, SceneNodeAppPtr& newAppNode)\n{\n\tstatic const MString format(\"ExoAlembic._import.importCurves(r\\\"^1s\\\", r\\\"^2s\\\", ^3s, r\\\"^4s\\\", ^5s, ^6s)\");\n\n\tMString strNb;\n\t{\n\t\tAbcG::ICurvesSchema::Sample sample;\n\t\tAbcG::ICurves obj(fileNode->getObject(), Abc::kWrapExisting);\n\t\tobj.getSchema().get(sample, 0);\n\n\t\tstrNb += (unsigned int)sample.getCurvesNumVertices()->size();\n\t}\n\n\tMString cmd;\n\tcmd.format(format, fileNode->name.c_str(), fileNode->dccIdentifier.c_str(), fileAndTime->variable(), dccIdentifier.c_str(), PythonBool(fileNode->pObjCache->isConstant), strNb);\n\treturn executeAddChild(cmd, newAppNode);\n}\n\nbool SceneNodeMaya::addChild(SceneNodeAlembicPtr fileNode, const IJobStringParser& jobParams, SceneNodeAppPtr& newAppNode)\n{\n\tESS_PROFILE_SCOPE(\"SceneNodeMaya::addChild\");\n\tnewAppNode.reset(new SceneNodeMaya(fileAndTime));\n\tswitch(newAppNode->type = fileNode->type)\n\t{\n\tcase ETRANSFORM:\n\tcase ITRANSFORM:\n\t\treturn addXformChild(fileNode, newAppNode);\n\tcase CAMERA:\n\t\treturn addSimilarChild(\"Camera\", fileNode, newAppNode);\n\tcase POLYMESH:\n\tcase SUBD:\n\t\treturn addPolyMeshChild(fileNode, newAppNode);\n\tcase CURVES:\n\tcase HAIR:\n\t\treturn addCurveChild(fileNode, newAppNode);\n\tcase PARTICLES:\n\t\treturn addSimilarChild(\"Points\", fileNode, newAppNode);\n\t\/\/case SURFACE:\t\/\/ handle as default for now\n\t\t\/\/break;\n\t\/\/case LIGHT:\t\/\/ handle as default for now\n\t\t\/\/break;\n\tdefault:\n\t\tbreak;\n\t}\n\treturn false;\n}\n\nvoid SceneNodeMaya::print(void)\n{\n\tESS_LOG_WARNING(\"Maya Scene Node: \" << dccIdentifier);\n}\n\nstatic bool visitChild(const MObject &mObj, SceneNodeAppPtr &parent, const AlembicFileAndTimeControlPtr &alembicFileAndTimeControl, const SearchReplace::ReplacePtr &replacer)\n{\n\t\/\/ check if it's a valid type of node first!\n\tSceneNodeAppPtr exoChild(new SceneNodeMaya(alembicFileAndTimeControl));\n\tswitch(mObj.apiType())\n\t{\n\tcase MFn::kCamera:\n\t\texoChild->type = SceneNode::CAMERA;\n\t\tbreak;\n\tcase MFn::kMesh:\n\t\texoChild->type = SceneNode::POLYMESH;\n\t\tbreak;\n\tcase MFn::kSubdiv:\n\t\texoChild->type = SceneNode::SUBD;\n\t\tbreak;\n\tcase MFn::kNurbsCurve:\n\t\texoChild->type = SceneNode::CURVES;\n\t\tbreak;\n\tcase MFn::kParticle:\n\t\texoChild->type = SceneNode::PARTICLES;\n\t\tbreak;\n\tcase MFn::kPfxHair:\n\t\texoChild->type = SceneNode::HAIR;\n\t\tbreak;\n\tcase MFn::kTransform:\n\tdefault:\n\t\texoChild->type = SceneNode::ETRANSFORM;\n\t\tbreak;\n\t}\n\n\tMFnDagNode dagNode(mObj);\n\tconst std::string dccId = dagNode.fullPathName().asChar();\n\tif (dccId.length() == 0)\n\t\treturn true;\n\n\tparent->children.push_back(exoChild);\n\texoChild->parent = parent.get();\n\n\texoChild->dccIdentifier = dccId;\n\texoChild->name = replacer->replace(dagNode.partialPathName().asChar());\n\tfor (unsigned int i = 0; i < dagNode.childCount(); ++i)\n\t\tvisitChild(dagNode.child(i), exoChild, alembicFileAndTimeControl, replacer);\n\treturn true;\n}\n\nSceneNodeAppPtr buildMayaSceneGraph(const MDagPath &dagPath, const SearchReplace::ReplacePtr &replacer, const AlembicFileAndTimeControlPtr alembicFileAndTimeControl)\n{\n\tESS_PROFILE_SCOPE(\"buildMayaSceneGraph\");\n\tSceneNodeAppPtr exoRoot(new SceneNodeMaya(alembicFileAndTimeControl));\n\texoRoot->type = SceneNode::SCENE_ROOT;\n\texoRoot->dccIdentifier = dagPath.fullPathName().asChar();\n\texoRoot->name = dagPath.partialPathName().asChar();\n\tfor (unsigned int i = 0; i < dagPath.childCount(); ++i)\n\t\tvisitChild(dagPath.child(i), exoRoot, alembicFileAndTimeControl, replacer);\n\treturn exoRoot;\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 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\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 \/\/ Cross-section data for fake two-group, with one material (id = 0)\n std::array<double, 4> sigma_s_values{0.25, 0.25, 0.25, 0.5}; \/\/ (i*j + 1)\/4\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 cross_sections_ptr = std::make_shared<data::CrossSections>(mock_material);\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, 15};\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\n auto init_token = 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, init_token, it, 0, 0);\n\n EXPECT_TRUE(CompareMatrices(expected_matrix, test_matrix));\n}\n\nTEST_F(FormulationCFEMDiffusionTest, FillCellCollisionTermTest) {\n dealii::FullMatrix<double> test_matrix(2,2);\n dealii::DoFHandler<2>::active_cell_iterator it;\n\n std::array<double, 4> expected_values{4.5, 9.0,\n 9.0, 20.25};\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\n auto init_token = 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.FillCellCollisionTerm(test_matrix, init_token, it, 0, 0);\n\n EXPECT_TRUE(CompareMatrices(expected_matrix, test_matrix));\n}\n\n} \/\/ namespace<commit_msg>added test for FillBoundaryTerm<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 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\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 \/\/ Cross-section data for fake two-group, with one material (id = 0)\n std::array<double, 4> sigma_s_values{0.25, 0.25, 0.25, 0.5}; \/\/ (i*j + 1)\/4\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 cross_sections_ptr = std::make_shared<data::CrossSections>(mock_material);\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, 15};\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\n auto init_token = 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, init_token, it, 0, 0);\n\n EXPECT_TRUE(CompareMatrices(expected_matrix, test_matrix));\n}\n\nTEST_F(FormulationCFEMDiffusionTest, FillCellCollisionTermTest) {\n dealii::FullMatrix<double> test_matrix(2,2);\n dealii::DoFHandler<2>::active_cell_iterator it;\n\n std::array<double, 4> expected_values{4.5, 9.0,\n 9.0, 20.25};\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\n auto init_token = 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.FillCellCollisionTerm(test_matrix, init_token, it, 0, 0);\n\n EXPECT_TRUE(CompareMatrices(expected_matrix, test_matrix));\n}\n\nTEST_F(FormulationCFEMDiffusionTest, FillBoundaryTermTestReflective) {\n dealii::FullMatrix<double> test_matrix(2,2);\n dealii::FullMatrix<double> expected_matrix(2,2);\n dealii::DoFHandler<2>::active_cell_iterator cell;\n auto boundary = formulation::scalar::CFEM_Diffusion<2>::BoundaryType::kReflective;\n\n formulation::scalar::CFEM_Diffusion<2> test_diffusion(fe_mock_ptr,\n cross_sections_ptr);\n\n test_diffusion.FillBoundaryTerm(test_matrix, cell, 0, 0, boundary);\n\n EXPECT_TRUE(CompareMatrices(expected_matrix, test_matrix));\n}\n\nTEST_F(FormulationCFEMDiffusionTest, FillBoundaryTermTestVacuum) {\n dealii::FullMatrix<double> test_matrix(2,2);\n dealii::DoFHandler<2>::active_cell_iterator cell;\n auto boundary = formulation::scalar::CFEM_Diffusion<2>::BoundaryType::kVacuum;\n\n std::array<double, 4> expected_values{3, 6,\n 6, 13.5};\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\n EXPECT_CALL(*fe_mock_ptr, SetFace(cell, 0))\n .Times(1);\n EXPECT_CALL(*fe_mock_ptr, Jacobian(_))\n .Times(2)\n .WillRepeatedly(DoDefault());\n\n test_diffusion.FillBoundaryTerm(test_matrix, cell, 0, 0, boundary);\n\n EXPECT_TRUE(CompareMatrices(expected_matrix, test_matrix));\n\n}\n\n} \/\/ namespace<|endoftext|>"} {"text":"<commit_before>\/**************************************************************************\n *\n * Copyright 2009-2011 VMware, Inc.\n * All Rights Reserved.\n *\n * Permission is hereby granted, free of charge, to any person obtaining a\n * copy of this software and associated documentation files (the\n * \"Software\"), to deal in the Software without restriction, including\n * without limitation the rights to use, copy, modify, merge, publish,\n * distribute, sub license, 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 (including the\n * next paragraph) shall be included in all copies or substantial portions\n * 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 NON-INFRINGEMENT.\n * IN NO EVENT SHALL VMWARE AND\/OR ITS SUPPLIERS BE LIABLE FOR\n * ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT,\n * TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE\n * SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.\n *\n **************************************************************************\/\n\n#include <stddef.h>\n\n#include <llvm-c\/Core.h>\n#include <llvm\/Target\/TargetMachine.h>\n#include <llvm\/Target\/TargetInstrInfo.h>\n#include <llvm\/Support\/raw_ostream.h>\n#include <llvm\/Support\/MemoryObject.h>\n\n#if HAVE_LLVM >= 0x0300\n#include <llvm\/Support\/TargetRegistry.h>\n#include <llvm\/Support\/TargetSelect.h>\n#else \/* HAVE_LLVM < 0x0300 *\/\n#include <llvm\/Target\/TargetRegistry.h>\n#include <llvm\/Target\/TargetSelect.h>\n#endif \/* HAVE_LLVM < 0x0300 *\/\n\n#if HAVE_LLVM >= 0x0209\n#include <llvm\/Support\/Host.h>\n#else \/* HAVE_LLVM < 0x0209 *\/\n#include <llvm\/System\/Host.h>\n#endif \/* HAVE_LLVM < 0x0209 *\/\n\n#if HAVE_LLVM >= 0x0207\n#include <llvm\/MC\/MCDisassembler.h>\n#include <llvm\/MC\/MCAsmInfo.h>\n#include <llvm\/MC\/MCInst.h>\n#include <llvm\/MC\/MCInstPrinter.h>\n#endif \/* HAVE_LLVM >= 0x0207 *\/\n\n#include \"util\/u_math.h\"\n#include \"util\/u_debug.h\"\n\n#include \"lp_bld_debug.h\"\n\n\n\n\/**\n * Check alignment.\n *\n * It is important that this check is not implemented as a macro or inlined\n * function, as the compiler assumptions in respect to alignment of global\n * and stack variables would often make the check a no op, defeating the\n * whole purpose of the exercise.\n *\/\nextern \"C\" boolean\nlp_check_alignment(const void *ptr, unsigned alignment)\n{\n assert(util_is_power_of_two(alignment));\n return ((uintptr_t)ptr & (alignment - 1)) == 0;\n}\n\n\nclass raw_debug_ostream :\n public llvm::raw_ostream\n{\n uint64_t pos;\n\n void write_impl(const char *Ptr, size_t Size);\n uint64_t current_pos() { return pos; }\n uint64_t current_pos() const { return pos; }\n\n#if HAVE_LLVM >= 0x207\n uint64_t preferred_buffer_size() { return 512; }\n#else\n size_t preferred_buffer_size() { return 512; }\n#endif\n};\n\n\nvoid\nraw_debug_ostream::write_impl(const char *Ptr, size_t Size)\n{\n if (Size > 0) {\n char *lastPtr = (char *)&Ptr[Size];\n char last = *lastPtr;\n *lastPtr = 0;\n _debug_printf(\"%*s\", Size, Ptr);\n *lastPtr = last;\n pos += Size;\n }\n}\n\n\n\/**\n * Same as LLVMDumpValue, but through our debugging channels.\n *\/\nextern \"C\" void\nlp_debug_dump_value(LLVMValueRef value)\n{\n#if (defined(PIPE_OS_WINDOWS) && !defined(PIPE_CC_MSVC)) || defined(PIPE_OS_EMBDDED)\n raw_debug_ostream os;\n llvm::unwrap(value)->print(os);\n os.flush();\n#else\n LLVMDumpValue(value);\n#endif\n}\n\n\n#if HAVE_LLVM >= 0x0207\n\/*\n * MemoryObject wrapper around a buffer of memory, to be used by MC\n * disassembler.\n *\/\nclass BufferMemoryObject:\n public llvm::MemoryObject\n{\nprivate:\n const uint8_t *Bytes;\n uint64_t Length;\npublic:\n BufferMemoryObject(const uint8_t *bytes, uint64_t length) :\n Bytes(bytes), Length(length)\n {\n }\n\n uint64_t getBase() const\n {\n return 0;\n }\n\n uint64_t getExtent() const\n {\n return Length;\n }\n\n int readByte(uint64_t addr, uint8_t *byte) const\n {\n if (addr > getExtent())\n return -1;\n *byte = Bytes[addr];\n return 0;\n }\n};\n#endif \/* HAVE_LLVM >= 0x0207 *\/\n\n\n\/*\n * Disassemble a function, using the LLVM MC disassembler.\n *\n * See also:\n * - http:\/\/blog.llvm.org\/2010\/01\/x86-disassembler.html\n * - http:\/\/blog.llvm.org\/2010\/04\/intro-to-llvm-mc-project.html\n *\/\nextern \"C\" void\nlp_disassemble(const void* func)\n{\n#if HAVE_LLVM >= 0x0207\n using namespace llvm;\n\n const uint8_t *bytes = (const uint8_t *)func;\n\n \/*\n * Limit disassembly to this extent\n *\/\n const uint64_t extent = 0x10000;\n\n uint64_t max_pc = 0;\n\n \/*\n * Initialize all used objects.\n *\/\n\n#if HAVE_LLVM >= 0x0301\n std::string Triple = sys::getDefaultTargetTriple();\n#else\n std::string Triple = sys::getHostTriple();\n#endif\n\n std::string Error;\n const Target *T = TargetRegistry::lookupTarget(Triple, Error);\n\n#if HAVE_LLVM >= 0x0208\n InitializeNativeTargetAsmPrinter();\n#elif defined(PIPE_ARCH_X86) || defined(PIPE_ARCH_X86_64)\n LLVMInitializeX86AsmPrinter();\n#elif defined(PIPE_ARCH_ARM)\n LLVMInitializeARMAsmPrinter();\n#elif defined(PIPE_ARCH_PPC)\n LLVMInitializePowerPCAsmPrinter();\n#endif\n\n#if defined(PIPE_ARCH_X86) || defined(PIPE_ARCH_X86_64)\n LLVMInitializeX86Disassembler();\n#elif defined(PIPE_ARCH_ARM)\n LLVMInitializeARMDisassembler();\n#endif\n\n#if HAVE_LLVM >= 0x0300\n OwningPtr<const MCAsmInfo> AsmInfo(T->createMCAsmInfo(Triple));\n#else\n OwningPtr<const MCAsmInfo> AsmInfo(T->createAsmInfo(Triple));\n#endif\n\n if (!AsmInfo) {\n debug_printf(\"error: no assembly info for target %s\\n\", Triple.c_str());\n return;\n }\n\n#if HAVE_LLVM >= 0x0300\n const MCSubtargetInfo *STI = T->createMCSubtargetInfo(Triple, sys::getHostCPUName(), \"\");\n OwningPtr<const MCDisassembler> DisAsm(T->createMCDisassembler(*STI));\n#else \n OwningPtr<const MCDisassembler> DisAsm(T->createMCDisassembler());\n#endif \n if (!DisAsm) {\n debug_printf(\"error: no disassembler for target %s\\n\", Triple.c_str());\n return;\n }\n\n raw_debug_ostream Out;\n\n#if HAVE_LLVM >= 0x0300\n unsigned int AsmPrinterVariant = AsmInfo->getAssemblerDialect();\n#else\n int AsmPrinterVariant = AsmInfo->getAssemblerDialect();\n#endif\n\n#if HAVE_LLVM >= 0x0301\n OwningPtr<const MCRegisterInfo> MRI(T->createMCRegInfo(Triple));\n if (!MRI) {\n debug_printf(\"error: no register info for target %s\\n\", Triple.c_str());\n return;\n }\n#endif\n\n#if HAVE_LLVM >= 0x0301\n OwningPtr<MCInstPrinter> Printer(\n T->createMCInstPrinter(AsmPrinterVariant, *AsmInfo, *MRI, *STI));\n#elif HAVE_LLVM == 0x0300\n OwningPtr<MCInstPrinter> Printer(\n T->createMCInstPrinter(AsmPrinterVariant, *AsmInfo, *STI));\n#elif HAVE_LLVM >= 0x0208\n OwningPtr<MCInstPrinter> Printer(\n T->createMCInstPrinter(AsmPrinterVariant, *AsmInfo));\n#else\n OwningPtr<MCInstPrinter> Printer(\n T->createMCInstPrinter(AsmPrinterVariant, *AsmInfo, Out));\n#endif\n if (!Printer) {\n debug_printf(\"error: no instruction printer for target %s\\n\", Triple.c_str());\n return;\n }\n\n#if HAVE_LLVM >= 0x0301\n TargetOptions options;\n#if defined(DEBUG)\n options.JITEmitDebugInfo = true;\n#endif\n#if defined(PIPE_ARCH_X86)\n options.StackAlignmentOverride = 4;\n#endif\n#if defined(DEBUG) || defined(PROFILE)\n options.NoFramePointerElim = true;\n#endif\n TargetMachine *TM = T->createTargetMachine(Triple, sys::getHostCPUName(), \"\", options);\n#elif HAVE_LLVM == 0x0300\n TargetMachine *TM = T->createTargetMachine(Triple, sys::getHostCPUName(), \"\");\n#else\n TargetMachine *TM = T->createTargetMachine(Triple, \"\");\n#endif\n\n const TargetInstrInfo *TII = TM->getInstrInfo();\n\n \/*\n * Wrap the data in a MemoryObject\n *\/\n BufferMemoryObject memoryObject((const uint8_t *)bytes, extent);\n\n uint64_t pc;\n pc = 0;\n while (true) {\n MCInst Inst;\n uint64_t Size;\n\n \/*\n * Print address. We use addresses relative to the start of the function,\n * so that between runs.\n *\/\n\n debug_printf(\"%6lu:\\t\", (unsigned long)pc);\n\n if (!DisAsm->getInstruction(Inst, Size, memoryObject,\n pc,\n#if HAVE_LLVM >= 0x0300\n\t\t\t\t nulls(), nulls())) {\n#else\n\t\t\t\t nulls())) {\n#endif\n debug_printf(\"invalid\\n\");\n pc += 1;\n }\n\n \/*\n * Output the bytes in hexidecimal format.\n *\/\n\n if (0) {\n unsigned i;\n for (i = 0; i < Size; ++i) {\n debug_printf(\"%02x \", ((const uint8_t*)bytes)[pc + i]);\n }\n for (; i < 16; ++i) {\n debug_printf(\" \");\n }\n }\n\n \/*\n * Print the instruction.\n *\/\n\n#if HAVE_LLVM >= 0x0300\n Printer->printInst(&Inst, Out, \"\");\n#elif HAVE_LLVM >= 0x208\n Printer->printInst(&Inst, Out);\n#else\n Printer->printInst(&Inst);\n#endif\n Out.flush();\n\n \/*\n * Advance.\n *\/\n\n pc += Size;\n\n#if HAVE_LLVM >= 0x0300\n const MCInstrDesc &TID = TII->get(Inst.getOpcode());\n#else\n const TargetInstrDesc &TID = TII->get(Inst.getOpcode());\n#endif\n\n \/*\n * Keep track of forward jumps to a nearby address.\n *\/\n\n if (TID.isBranch()) {\n for (unsigned i = 0; i < Inst.getNumOperands(); ++i) {\n const MCOperand &operand = Inst.getOperand(i);\n if (operand.isImm()) {\n uint64_t jump;\n\n \/*\n * FIXME: Handle both relative and absolute addresses correctly.\n * EDInstInfo actually has this info, but operandTypes and\n * operandFlags enums are not exposed in the public interface.\n *\/\n\n if (1) {\n \/*\n * PC relative addr.\n *\/\n\n jump = pc + operand.getImm();\n } else {\n \/*\n * Absolute addr.\n *\/\n\n jump = (uint64_t)operand.getImm();\n }\n\n \/*\n * Output the address relative to the function start, given\n * that MC will print the addresses relative the current pc.\n *\/\n debug_printf(\"\\t\\t; %lu\", (unsigned long)jump);\n\n \/*\n * Ignore far jumps given it could be actually a tail return to\n * a random address.\n *\/\n\n if (jump > max_pc &&\n jump < extent) {\n max_pc = jump;\n }\n }\n }\n }\n\n debug_printf(\"\\n\");\n\n \/*\n * Stop disassembling on return statements, if there is no record of a\n * jump to a successive address.\n *\/\n\n if (TID.isReturn()) {\n if (pc > max_pc) {\n break;\n }\n }\n }\n\n \/*\n * Print GDB command, useful to verify output.\n *\/\n\n if (0) {\n debug_printf(\"disassemble %p %p\\n\", bytes, bytes + pc);\n }\n\n debug_printf(\"\\n\");\n#else \/* HAVE_LLVM < 0x0207 *\/\n (void)func;\n#endif \/* HAVE_LLVM < 0x0207 *\/\n}\n\n<commit_msg>gallivm: Use InitializeNativeTargetDisassembler().<commit_after>\/**************************************************************************\n *\n * Copyright 2009-2011 VMware, Inc.\n * All Rights Reserved.\n *\n * Permission is hereby granted, free of charge, to any person obtaining a\n * copy of this software and associated documentation files (the\n * \"Software\"), to deal in the Software without restriction, including\n * without limitation the rights to use, copy, modify, merge, publish,\n * distribute, sub license, 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 (including the\n * next paragraph) shall be included in all copies or substantial portions\n * 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 NON-INFRINGEMENT.\n * IN NO EVENT SHALL VMWARE AND\/OR ITS SUPPLIERS BE LIABLE FOR\n * ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT,\n * TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE\n * SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.\n *\n **************************************************************************\/\n\n#include <stddef.h>\n\n#include <llvm-c\/Core.h>\n#include <llvm\/Target\/TargetMachine.h>\n#include <llvm\/Target\/TargetInstrInfo.h>\n#include <llvm\/Support\/raw_ostream.h>\n#include <llvm\/Support\/MemoryObject.h>\n\n#if HAVE_LLVM >= 0x0300\n#include <llvm\/Support\/TargetRegistry.h>\n#include <llvm\/Support\/TargetSelect.h>\n#else \/* HAVE_LLVM < 0x0300 *\/\n#include <llvm\/Target\/TargetRegistry.h>\n#include <llvm\/Target\/TargetSelect.h>\n#endif \/* HAVE_LLVM < 0x0300 *\/\n\n#if HAVE_LLVM >= 0x0209\n#include <llvm\/Support\/Host.h>\n#else \/* HAVE_LLVM < 0x0209 *\/\n#include <llvm\/System\/Host.h>\n#endif \/* HAVE_LLVM < 0x0209 *\/\n\n#if HAVE_LLVM >= 0x0207\n#include <llvm\/MC\/MCDisassembler.h>\n#include <llvm\/MC\/MCAsmInfo.h>\n#include <llvm\/MC\/MCInst.h>\n#include <llvm\/MC\/MCInstPrinter.h>\n#endif \/* HAVE_LLVM >= 0x0207 *\/\n\n#include \"util\/u_math.h\"\n#include \"util\/u_debug.h\"\n\n#include \"lp_bld_debug.h\"\n\n\n\n\/**\n * Check alignment.\n *\n * It is important that this check is not implemented as a macro or inlined\n * function, as the compiler assumptions in respect to alignment of global\n * and stack variables would often make the check a no op, defeating the\n * whole purpose of the exercise.\n *\/\nextern \"C\" boolean\nlp_check_alignment(const void *ptr, unsigned alignment)\n{\n assert(util_is_power_of_two(alignment));\n return ((uintptr_t)ptr & (alignment - 1)) == 0;\n}\n\n\nclass raw_debug_ostream :\n public llvm::raw_ostream\n{\n uint64_t pos;\n\n void write_impl(const char *Ptr, size_t Size);\n uint64_t current_pos() { return pos; }\n uint64_t current_pos() const { return pos; }\n\n#if HAVE_LLVM >= 0x207\n uint64_t preferred_buffer_size() { return 512; }\n#else\n size_t preferred_buffer_size() { return 512; }\n#endif\n};\n\n\nvoid\nraw_debug_ostream::write_impl(const char *Ptr, size_t Size)\n{\n if (Size > 0) {\n char *lastPtr = (char *)&Ptr[Size];\n char last = *lastPtr;\n *lastPtr = 0;\n _debug_printf(\"%*s\", Size, Ptr);\n *lastPtr = last;\n pos += Size;\n }\n}\n\n\n\/**\n * Same as LLVMDumpValue, but through our debugging channels.\n *\/\nextern \"C\" void\nlp_debug_dump_value(LLVMValueRef value)\n{\n#if (defined(PIPE_OS_WINDOWS) && !defined(PIPE_CC_MSVC)) || defined(PIPE_OS_EMBDDED)\n raw_debug_ostream os;\n llvm::unwrap(value)->print(os);\n os.flush();\n#else\n LLVMDumpValue(value);\n#endif\n}\n\n\n#if HAVE_LLVM >= 0x0207\n\/*\n * MemoryObject wrapper around a buffer of memory, to be used by MC\n * disassembler.\n *\/\nclass BufferMemoryObject:\n public llvm::MemoryObject\n{\nprivate:\n const uint8_t *Bytes;\n uint64_t Length;\npublic:\n BufferMemoryObject(const uint8_t *bytes, uint64_t length) :\n Bytes(bytes), Length(length)\n {\n }\n\n uint64_t getBase() const\n {\n return 0;\n }\n\n uint64_t getExtent() const\n {\n return Length;\n }\n\n int readByte(uint64_t addr, uint8_t *byte) const\n {\n if (addr > getExtent())\n return -1;\n *byte = Bytes[addr];\n return 0;\n }\n};\n#endif \/* HAVE_LLVM >= 0x0207 *\/\n\n\n\/*\n * Disassemble a function, using the LLVM MC disassembler.\n *\n * See also:\n * - http:\/\/blog.llvm.org\/2010\/01\/x86-disassembler.html\n * - http:\/\/blog.llvm.org\/2010\/04\/intro-to-llvm-mc-project.html\n *\/\nextern \"C\" void\nlp_disassemble(const void* func)\n{\n#if HAVE_LLVM >= 0x0207\n using namespace llvm;\n\n const uint8_t *bytes = (const uint8_t *)func;\n\n \/*\n * Limit disassembly to this extent\n *\/\n const uint64_t extent = 0x10000;\n\n uint64_t max_pc = 0;\n\n \/*\n * Initialize all used objects.\n *\/\n\n#if HAVE_LLVM >= 0x0301\n std::string Triple = sys::getDefaultTargetTriple();\n#else\n std::string Triple = sys::getHostTriple();\n#endif\n\n std::string Error;\n const Target *T = TargetRegistry::lookupTarget(Triple, Error);\n\n#if HAVE_LLVM >= 0x0208\n InitializeNativeTargetAsmPrinter();\n#elif defined(PIPE_ARCH_X86) || defined(PIPE_ARCH_X86_64)\n LLVMInitializeX86AsmPrinter();\n#elif defined(PIPE_ARCH_ARM)\n LLVMInitializeARMAsmPrinter();\n#elif defined(PIPE_ARCH_PPC)\n LLVMInitializePowerPCAsmPrinter();\n#endif\n\n#if HAVE_LLVM >= 0x0301\n InitializeNativeTargetDisassembler();\n#elif defined(PIPE_ARCH_X86) || defined(PIPE_ARCH_X86_64)\n LLVMInitializeX86Disassembler();\n#elif defined(PIPE_ARCH_ARM)\n LLVMInitializeARMDisassembler();\n#endif\n\n#if HAVE_LLVM >= 0x0300\n OwningPtr<const MCAsmInfo> AsmInfo(T->createMCAsmInfo(Triple));\n#else\n OwningPtr<const MCAsmInfo> AsmInfo(T->createAsmInfo(Triple));\n#endif\n\n if (!AsmInfo) {\n debug_printf(\"error: no assembly info for target %s\\n\", Triple.c_str());\n return;\n }\n\n#if HAVE_LLVM >= 0x0300\n const MCSubtargetInfo *STI = T->createMCSubtargetInfo(Triple, sys::getHostCPUName(), \"\");\n OwningPtr<const MCDisassembler> DisAsm(T->createMCDisassembler(*STI));\n#else \n OwningPtr<const MCDisassembler> DisAsm(T->createMCDisassembler());\n#endif \n if (!DisAsm) {\n debug_printf(\"error: no disassembler for target %s\\n\", Triple.c_str());\n return;\n }\n\n raw_debug_ostream Out;\n\n#if HAVE_LLVM >= 0x0300\n unsigned int AsmPrinterVariant = AsmInfo->getAssemblerDialect();\n#else\n int AsmPrinterVariant = AsmInfo->getAssemblerDialect();\n#endif\n\n#if HAVE_LLVM >= 0x0301\n OwningPtr<const MCRegisterInfo> MRI(T->createMCRegInfo(Triple));\n if (!MRI) {\n debug_printf(\"error: no register info for target %s\\n\", Triple.c_str());\n return;\n }\n#endif\n\n#if HAVE_LLVM >= 0x0301\n OwningPtr<MCInstPrinter> Printer(\n T->createMCInstPrinter(AsmPrinterVariant, *AsmInfo, *MRI, *STI));\n#elif HAVE_LLVM == 0x0300\n OwningPtr<MCInstPrinter> Printer(\n T->createMCInstPrinter(AsmPrinterVariant, *AsmInfo, *STI));\n#elif HAVE_LLVM >= 0x0208\n OwningPtr<MCInstPrinter> Printer(\n T->createMCInstPrinter(AsmPrinterVariant, *AsmInfo));\n#else\n OwningPtr<MCInstPrinter> Printer(\n T->createMCInstPrinter(AsmPrinterVariant, *AsmInfo, Out));\n#endif\n if (!Printer) {\n debug_printf(\"error: no instruction printer for target %s\\n\", Triple.c_str());\n return;\n }\n\n#if HAVE_LLVM >= 0x0301\n TargetOptions options;\n#if defined(DEBUG)\n options.JITEmitDebugInfo = true;\n#endif\n#if defined(PIPE_ARCH_X86)\n options.StackAlignmentOverride = 4;\n#endif\n#if defined(DEBUG) || defined(PROFILE)\n options.NoFramePointerElim = true;\n#endif\n TargetMachine *TM = T->createTargetMachine(Triple, sys::getHostCPUName(), \"\", options);\n#elif HAVE_LLVM == 0x0300\n TargetMachine *TM = T->createTargetMachine(Triple, sys::getHostCPUName(), \"\");\n#else\n TargetMachine *TM = T->createTargetMachine(Triple, \"\");\n#endif\n\n const TargetInstrInfo *TII = TM->getInstrInfo();\n\n \/*\n * Wrap the data in a MemoryObject\n *\/\n BufferMemoryObject memoryObject((const uint8_t *)bytes, extent);\n\n uint64_t pc;\n pc = 0;\n while (true) {\n MCInst Inst;\n uint64_t Size;\n\n \/*\n * Print address. We use addresses relative to the start of the function,\n * so that between runs.\n *\/\n\n debug_printf(\"%6lu:\\t\", (unsigned long)pc);\n\n if (!DisAsm->getInstruction(Inst, Size, memoryObject,\n pc,\n#if HAVE_LLVM >= 0x0300\n\t\t\t\t nulls(), nulls())) {\n#else\n\t\t\t\t nulls())) {\n#endif\n debug_printf(\"invalid\\n\");\n pc += 1;\n }\n\n \/*\n * Output the bytes in hexidecimal format.\n *\/\n\n if (0) {\n unsigned i;\n for (i = 0; i < Size; ++i) {\n debug_printf(\"%02x \", ((const uint8_t*)bytes)[pc + i]);\n }\n for (; i < 16; ++i) {\n debug_printf(\" \");\n }\n }\n\n \/*\n * Print the instruction.\n *\/\n\n#if HAVE_LLVM >= 0x0300\n Printer->printInst(&Inst, Out, \"\");\n#elif HAVE_LLVM >= 0x208\n Printer->printInst(&Inst, Out);\n#else\n Printer->printInst(&Inst);\n#endif\n Out.flush();\n\n \/*\n * Advance.\n *\/\n\n pc += Size;\n\n#if HAVE_LLVM >= 0x0300\n const MCInstrDesc &TID = TII->get(Inst.getOpcode());\n#else\n const TargetInstrDesc &TID = TII->get(Inst.getOpcode());\n#endif\n\n \/*\n * Keep track of forward jumps to a nearby address.\n *\/\n\n if (TID.isBranch()) {\n for (unsigned i = 0; i < Inst.getNumOperands(); ++i) {\n const MCOperand &operand = Inst.getOperand(i);\n if (operand.isImm()) {\n uint64_t jump;\n\n \/*\n * FIXME: Handle both relative and absolute addresses correctly.\n * EDInstInfo actually has this info, but operandTypes and\n * operandFlags enums are not exposed in the public interface.\n *\/\n\n if (1) {\n \/*\n * PC relative addr.\n *\/\n\n jump = pc + operand.getImm();\n } else {\n \/*\n * Absolute addr.\n *\/\n\n jump = (uint64_t)operand.getImm();\n }\n\n \/*\n * Output the address relative to the function start, given\n * that MC will print the addresses relative the current pc.\n *\/\n debug_printf(\"\\t\\t; %lu\", (unsigned long)jump);\n\n \/*\n * Ignore far jumps given it could be actually a tail return to\n * a random address.\n *\/\n\n if (jump > max_pc &&\n jump < extent) {\n max_pc = jump;\n }\n }\n }\n }\n\n debug_printf(\"\\n\");\n\n \/*\n * Stop disassembling on return statements, if there is no record of a\n * jump to a successive address.\n *\/\n\n if (TID.isReturn()) {\n if (pc > max_pc) {\n break;\n }\n }\n }\n\n \/*\n * Print GDB command, useful to verify output.\n *\/\n\n if (0) {\n debug_printf(\"disassemble %p %p\\n\", bytes, bytes + pc);\n }\n\n debug_printf(\"\\n\");\n#else \/* HAVE_LLVM < 0x0207 *\/\n (void)func;\n#endif \/* HAVE_LLVM < 0x0207 *\/\n}\n\n<|endoftext|>"} {"text":"<commit_before>\/*************************************************************************\n *\n * $RCSfile: interceptedinteraction.hxx,v $\n *\n * $Revision: 1.3 $\n *\n * last change: $Author: vg $ $Date: 2005-02-16 15:45: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 _UCBHELPER_INTERCEPTEDINTERACTION_HXX_\n#define _UCBHELPER_INTERCEPTEDINTERACTION_HXX_\n\n\/\/_______________________________________________\n\/\/ includes\n\n#include <vector>\n\n#ifndef __COM_SUN_STAR_TASK_XINTERACTIONHANDLER_HPP__\n#include <com\/sun\/star\/task\/XInteractionHandler.hpp>\n#endif\n\n#ifndef __COM_SUN_STAR_TASK_XINTERACTIONREQUEST_HPP__\n#include <com\/sun\/star\/task\/XInteractionRequest.hpp>\n#endif\n\n#ifndef _CPPUHELPER_IMPLBASE1_HXX_\n#include <cppuhelper\/implbase1.hxx>\n#endif\n#ifndef INCLUDED_UCBHELPERDLLAPI_H\n#include \"ucbhelper\/ucbhelperdllapi.h\"\n#endif\n\n\/\/_______________________________________________\n\/\/ namespace\n\nnamespace ucbhelper{\n\n\/\/_______________________________________________\n\/\/ definitions\n\n\/** @short it wraps any other interaction handler and intercept\n its handle() requests.\n\n @descr This class can be used as:\n - instance if special interactions must be supressed\n only\n - or as base class if interactions must be modified.\n *\/\nclass UCBHELPER_DLLPUBLIC InterceptedInteraction : public ::cppu::WeakImplHelper1< ::com::sun::star::task::XInteractionHandler >\n{\n \/\/-------------------------------------------\n \/\/ types\n public:\n\n struct InterceptedRequest\n {\n \/\/-----------------------------------\n \/** @short marks an Handle as invalid.\n *\/\n static const sal_Int32 INVALID_HANDLE = -1;\n\n \/\/-----------------------------------\n \/** @short contains the interaction request, which should be intercepted. *\/\n ::com::sun::star::uno::Any Request;\n\n \/\/-----------------------------------\n \/** @short specify the fix continuation, which must be selected, if the\n interaction could be intercepted successfully.\n *\/\n ::com::sun::star::uno::Type Continuation;\n\n \/\/-----------------------------------\n \/** @short specify, if both interactions must have the same type\n or can be derived from.\n\n @descr Interaction base on exceptions - and exceptions are real types.\n So they can be checked in its type. These parameter \"MatchExact\"\n influence the type-check in the following way:\n TRUE => the exception will be intercepted only\n if it supports exactly the same type ...\n or\n FALSE => derived exceptions will be intercepted too.\n\n @attention This parameter does not influence the check of the continuation\n type! The continuation must be matched exactly everytimes ...\n *\/\n sal_Bool MatchExact;\n\n \/\/-----------------------------------\n \/** @short its an unique identifier, which must be managed by the outside code.\n\n @descr If there is a derived class, which overwrites the InterceptedInteraction::intercepted()\n method, it will be called with a reference to an InterceptedRequest struct.\n Then it can use the handle to react without checking the request type again.\n *\/\n sal_Int32 Handle;\n\n \/\/-----------------------------------\n \/** @short default ctor.\n\n @descr Such constructed object cant be used realy.\n Might it will crash if its used!\n Dont forget to initialize all(!) members ...\n *\/\n InterceptedRequest()\n {\n MatchExact = sal_False;\n Handle = INVALID_HANDLE;\n }\n\n \/\/-----------------------------------\n \/** @short initialize this instance.\n\n @param nHandle\n used to identify every intercepted request\n\n @param aRequest\n must contain an exception object, which can be checked\n in its uno-type against the later handled interaction.\n\n @param aContinuation\n must contain a continuation object, which is used\n in its uno-type to locate the same continuation\n inside the list of possible ones.\n\n @param bMatchExact\n influence the type check of the interception request.\n Its not used to check the continuation!\n *\/\n InterceptedRequest( sal_Int32 nHandle ,\n const ::com::sun::star::uno::Any& aRequest ,\n const ::com::sun::star::uno::Type& aContinuation,\n sal_Bool bMatchExact )\n {\n Handle = nHandle;\n Request = aRequest;\n Continuation = aContinuation;\n MatchExact = bMatchExact;\n }\n };\n\n \/\/---------------------------------------\n \/** @short represent the different states, which can occure\n as result of an interception.\n\n @see impl_interceptRequest()\n *\/\n enum EInterceptionState\n {\n \/** none of the specified interceptions match the incoming request *\/\n E_NOT_INTERCEPTED,\n \/** the request could be intercepted - but the specified continuation could not be located.\n Thats normaly an error of the programmer. May be the interaction request does not use\n the right set of continuations ... or the interception list contains the wrong continuation. *\/\n E_NO_CONTINUATION_FOUND,\n \/** the request could be intercepted and the specified continuation could be selected successfully. *\/\n E_INTERCEPTED\n };\n\n \/\/-------------------------------------------\n \/\/ member\n protected:\n\n \/\/---------------------------------------\n \/** @short reference to the intercepted interaction handler.\n\n @descr NULL is allowed for this member!\n All interaction will be aborted then ...\n expecting th handle() was overwritten by\n a derived class.\n *\/\n ::com::sun::star::uno::Reference< ::com::sun::star::task::XInteractionHandler > m_xInterceptedHandler;\n\n \/\/---------------------------------------\n \/** @short these list contains the requests, which should be intercepted.\n *\/\n ::std::vector< InterceptedRequest > m_lInterceptions;\n\n \/\/-------------------------------------------\n \/\/ native interface\n public:\n\n \/\/---------------------------------------\n \/** @short initialize a new instance with default values.\n *\/\n InterceptedInteraction();\n\n \/\/---------------------------------------\n \/** @short initialize a new instance with real values.\n\n @param xInterceptedHandler\n the outside interaction handler, which should\n be intercepted here.\n\n @param lInterceptions\n the list of intercepted requests.\n *\/\n InterceptedInteraction(const ::com::sun::star::uno::Reference< ::com::sun::star::task::XInteractionHandler >& xInterceptedHandler,\n const ::std::vector< InterceptedRequest >& lInterceptions );\n\n \/\/---------------------------------------\n \/** @short initialize a new instance with the interaction handler,\n which should be intercepted.\n\n @attention If such interaction handler isnt set here,\n all incoming requests will be aborted ...\n if the right continuation is available!\n\n @param xInterceptedHandler\n the outside interaction handler, which should\n be intercepted here.\n *\/\n void setInterceptedHandler(const ::com::sun::star::uno::Reference< ::com::sun::star::task::XInteractionHandler >& xInterceptedHandler);\n\n \/\/---------------------------------------\n \/** @short set a new list of intercepted interactions.\n\n @attention If the interface method handle() will be overwritten by\n a derived class, the functionality behind these static list\n cant be used.\n\n @param lInterceptions\n the list of intercepted requests.\n *\/\n void setInterceptions(const ::std::vector< InterceptedRequest >& lInterceptions);\n\n \/\/---------------------------------------\n \/** @short extract a requested continuation from te list of available ones.\n\n @param lContinuations\n the list of available continuations.\n\n @param aType\n is used to locate the right continuation,\n by checking its interface type.\n\n @return A valid reference to the continuation, if it could be located ...\n or an empty reference otherwhise.\n *\/\n static ::com::sun::star::uno::Reference< ::com::sun::star::task::XInteractionContinuation > extractContinuation(\n const ::com::sun::star::uno::Sequence< ::com::sun::star::uno::Reference< ::com::sun::star::task::XInteractionContinuation > >& lContinuations,\n const ::com::sun::star::uno::Type& aType );\n\n \/\/-------------------------------------------\n \/\/ useable for derived classes\n protected:\n\n \/\/---------------------------------------\n \/** @short can be overwritten by a derived class to handle interceptions\n outside.\n\n @descr This base implementation checks, if the request could be intercepted\n successfully. Then this method intercepted() is called.\n The default implementation returns \"NOT_INTERCEPTED\" everytimes.\n So the method impl_interceptRequest() uses the right continuation automaticly.\n\n If this method was overwritten and something different \"NO_INTERCEPTED\"\n is returned, the method impl_interceptRequest() will return immediatly with\n the result, which is returned by this intercepted() method.\n Then the continuations must be selected inside the intercepted() call!\n\n @param rRequest\n it points to the intercepted request (means the item of the\n set interception list). e.g. its \"Handle\" member can be used\n to identify it and react very easy, without the need to check the\n type of the exception ...\n\n @param xOrgRequest\n points to the original interaction, which was intercepted.\n It provides access to the exception and the list of possible\n continuations.\n\n @return The result of this operation.\n Note: If E_NOT_INTERCEPTED is returned the default handling of the base class\n will be used automaticly for this request!\n *\/\n virtual EInterceptionState intercepted(const InterceptedRequest& rRequest ,\n const ::com::sun::star::uno::Reference< ::com::sun::star::task::XInteractionRequest >& xOrgRequest);\n\n \/\/-------------------------------------------\n \/\/ uno interface\n public:\n\n \/\/---------------------------------------\n \/** @short implements the default handling of this class ....\n or can be overwritten by any derived class.\n\n @descr If no further class is derived from this one\n -> the default implementation is used. Then the\n internal list of requests is used to handle different\n interactions automaticly.\n (see impl_interceptRequest())\n\n If this method was overwritten by a derived implementation\n -> the new implementation has to do everything by itself.\n Of course it can access all members\/helpers and work with it.\n But the default implementation isnt used automaticly then.\n\n @param xRequest\n the interaction request, which should be intercepted.\n *\/\n virtual void SAL_CALL handle(const ::com::sun::star::uno::Reference< ::com::sun::star::task::XInteractionRequest >& xRequest)\n throw(::com::sun::star::uno::RuntimeException);\n\n \/\/-------------------------------------------\n \/\/ helper\n private:\n\n \/\/---------------------------------------\n \/** @short implements the default handling:\n - intercept or forward to internal handler.\n *\/\n UCBHELPER_DLLPRIVATE void impl_handleDefault(const ::com::sun::star::uno::Reference< ::com::sun::star::task::XInteractionRequest >& xRequest);\n\n \/\/---------------------------------------\n \/** @short implements the interception of requests.\n\n @descr The incoming request will be analyzed, if it match\n any request of the m_lIntercepions list.\n If an interception could be found, its continuation will be\n searched and selected.\n\n The method return the state of that operation.\n But it doesnt call the intercepted and here set\n interaction handler. That has to be done in the outside method.\n\n @param xRequest\n the interaction request, which should be intercepted.\n\n @return A identifier, which inidicates if the request was intercepted,\n the continuation was found and selected ... or not.\n *\/\n UCBHELPER_DLLPRIVATE EInterceptionState impl_interceptRequest(const ::com::sun::star::uno::Reference< ::com::sun::star::task::XInteractionRequest >& xRequest);\n};\n\n} \/\/ namespace ucbhelper\n\n#endif \/\/ _UCBHELPER_INTERCEPTEDINTERACTION_HXX_\n<commit_msg>INTEGRATION: CWS ooo19126 (1.3.14); FILE MERGED 2005\/09\/05 13:13:45 rt 1.3.14.1: #i54170# Change license header: remove SISSL<commit_after>\/*************************************************************************\n *\n * OpenOffice.org - a multi-platform office productivity suite\n *\n * $RCSfile: interceptedinteraction.hxx,v $\n *\n * $Revision: 1.4 $\n *\n * last change: $Author: rt $ $Date: 2005-09-09 16:28:57 $\n *\n * The Contents of this file are made available subject to\n * the terms of GNU Lesser General Public License Version 2.1.\n *\n *\n * GNU Lesser General Public License Version 2.1\n * =============================================\n * Copyright 2005 by Sun Microsystems, Inc.\n * 901 San Antonio Road, Palo Alto, CA 94303, USA\n *\n * This library is free software; you can redistribute it and\/or\n * modify it under the terms of the GNU Lesser General Public\n * License version 2.1, as published by the Free Software Foundation.\n *\n * This library is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU\n * Lesser General Public License for more details.\n *\n * You should have received a copy of the GNU Lesser General Public\n * License along with this library; if not, write to the Free Software\n * Foundation, Inc., 59 Temple Place, Suite 330, Boston,\n * MA 02111-1307 USA\n *\n ************************************************************************\/\n\n#ifndef _UCBHELPER_INTERCEPTEDINTERACTION_HXX_\n#define _UCBHELPER_INTERCEPTEDINTERACTION_HXX_\n\n\/\/_______________________________________________\n\/\/ includes\n\n#include <vector>\n\n#ifndef __COM_SUN_STAR_TASK_XINTERACTIONHANDLER_HPP__\n#include <com\/sun\/star\/task\/XInteractionHandler.hpp>\n#endif\n\n#ifndef __COM_SUN_STAR_TASK_XINTERACTIONREQUEST_HPP__\n#include <com\/sun\/star\/task\/XInteractionRequest.hpp>\n#endif\n\n#ifndef _CPPUHELPER_IMPLBASE1_HXX_\n#include <cppuhelper\/implbase1.hxx>\n#endif\n#ifndef INCLUDED_UCBHELPERDLLAPI_H\n#include \"ucbhelper\/ucbhelperdllapi.h\"\n#endif\n\n\/\/_______________________________________________\n\/\/ namespace\n\nnamespace ucbhelper{\n\n\/\/_______________________________________________\n\/\/ definitions\n\n\/** @short it wraps any other interaction handler and intercept\n its handle() requests.\n\n @descr This class can be used as:\n - instance if special interactions must be supressed\n only\n - or as base class if interactions must be modified.\n *\/\nclass UCBHELPER_DLLPUBLIC InterceptedInteraction : public ::cppu::WeakImplHelper1< ::com::sun::star::task::XInteractionHandler >\n{\n \/\/-------------------------------------------\n \/\/ types\n public:\n\n struct InterceptedRequest\n {\n \/\/-----------------------------------\n \/** @short marks an Handle as invalid.\n *\/\n static const sal_Int32 INVALID_HANDLE = -1;\n\n \/\/-----------------------------------\n \/** @short contains the interaction request, which should be intercepted. *\/\n ::com::sun::star::uno::Any Request;\n\n \/\/-----------------------------------\n \/** @short specify the fix continuation, which must be selected, if the\n interaction could be intercepted successfully.\n *\/\n ::com::sun::star::uno::Type Continuation;\n\n \/\/-----------------------------------\n \/** @short specify, if both interactions must have the same type\n or can be derived from.\n\n @descr Interaction base on exceptions - and exceptions are real types.\n So they can be checked in its type. These parameter \"MatchExact\"\n influence the type-check in the following way:\n TRUE => the exception will be intercepted only\n if it supports exactly the same type ...\n or\n FALSE => derived exceptions will be intercepted too.\n\n @attention This parameter does not influence the check of the continuation\n type! The continuation must be matched exactly everytimes ...\n *\/\n sal_Bool MatchExact;\n\n \/\/-----------------------------------\n \/** @short its an unique identifier, which must be managed by the outside code.\n\n @descr If there is a derived class, which overwrites the InterceptedInteraction::intercepted()\n method, it will be called with a reference to an InterceptedRequest struct.\n Then it can use the handle to react without checking the request type again.\n *\/\n sal_Int32 Handle;\n\n \/\/-----------------------------------\n \/** @short default ctor.\n\n @descr Such constructed object cant be used realy.\n Might it will crash if its used!\n Dont forget to initialize all(!) members ...\n *\/\n InterceptedRequest()\n {\n MatchExact = sal_False;\n Handle = INVALID_HANDLE;\n }\n\n \/\/-----------------------------------\n \/** @short initialize this instance.\n\n @param nHandle\n used to identify every intercepted request\n\n @param aRequest\n must contain an exception object, which can be checked\n in its uno-type against the later handled interaction.\n\n @param aContinuation\n must contain a continuation object, which is used\n in its uno-type to locate the same continuation\n inside the list of possible ones.\n\n @param bMatchExact\n influence the type check of the interception request.\n Its not used to check the continuation!\n *\/\n InterceptedRequest( sal_Int32 nHandle ,\n const ::com::sun::star::uno::Any& aRequest ,\n const ::com::sun::star::uno::Type& aContinuation,\n sal_Bool bMatchExact )\n {\n Handle = nHandle;\n Request = aRequest;\n Continuation = aContinuation;\n MatchExact = bMatchExact;\n }\n };\n\n \/\/---------------------------------------\n \/** @short represent the different states, which can occure\n as result of an interception.\n\n @see impl_interceptRequest()\n *\/\n enum EInterceptionState\n {\n \/** none of the specified interceptions match the incoming request *\/\n E_NOT_INTERCEPTED,\n \/** the request could be intercepted - but the specified continuation could not be located.\n Thats normaly an error of the programmer. May be the interaction request does not use\n the right set of continuations ... or the interception list contains the wrong continuation. *\/\n E_NO_CONTINUATION_FOUND,\n \/** the request could be intercepted and the specified continuation could be selected successfully. *\/\n E_INTERCEPTED\n };\n\n \/\/-------------------------------------------\n \/\/ member\n protected:\n\n \/\/---------------------------------------\n \/** @short reference to the intercepted interaction handler.\n\n @descr NULL is allowed for this member!\n All interaction will be aborted then ...\n expecting th handle() was overwritten by\n a derived class.\n *\/\n ::com::sun::star::uno::Reference< ::com::sun::star::task::XInteractionHandler > m_xInterceptedHandler;\n\n \/\/---------------------------------------\n \/** @short these list contains the requests, which should be intercepted.\n *\/\n ::std::vector< InterceptedRequest > m_lInterceptions;\n\n \/\/-------------------------------------------\n \/\/ native interface\n public:\n\n \/\/---------------------------------------\n \/** @short initialize a new instance with default values.\n *\/\n InterceptedInteraction();\n\n \/\/---------------------------------------\n \/** @short initialize a new instance with real values.\n\n @param xInterceptedHandler\n the outside interaction handler, which should\n be intercepted here.\n\n @param lInterceptions\n the list of intercepted requests.\n *\/\n InterceptedInteraction(const ::com::sun::star::uno::Reference< ::com::sun::star::task::XInteractionHandler >& xInterceptedHandler,\n const ::std::vector< InterceptedRequest >& lInterceptions );\n\n \/\/---------------------------------------\n \/** @short initialize a new instance with the interaction handler,\n which should be intercepted.\n\n @attention If such interaction handler isnt set here,\n all incoming requests will be aborted ...\n if the right continuation is available!\n\n @param xInterceptedHandler\n the outside interaction handler, which should\n be intercepted here.\n *\/\n void setInterceptedHandler(const ::com::sun::star::uno::Reference< ::com::sun::star::task::XInteractionHandler >& xInterceptedHandler);\n\n \/\/---------------------------------------\n \/** @short set a new list of intercepted interactions.\n\n @attention If the interface method handle() will be overwritten by\n a derived class, the functionality behind these static list\n cant be used.\n\n @param lInterceptions\n the list of intercepted requests.\n *\/\n void setInterceptions(const ::std::vector< InterceptedRequest >& lInterceptions);\n\n \/\/---------------------------------------\n \/** @short extract a requested continuation from te list of available ones.\n\n @param lContinuations\n the list of available continuations.\n\n @param aType\n is used to locate the right continuation,\n by checking its interface type.\n\n @return A valid reference to the continuation, if it could be located ...\n or an empty reference otherwhise.\n *\/\n static ::com::sun::star::uno::Reference< ::com::sun::star::task::XInteractionContinuation > extractContinuation(\n const ::com::sun::star::uno::Sequence< ::com::sun::star::uno::Reference< ::com::sun::star::task::XInteractionContinuation > >& lContinuations,\n const ::com::sun::star::uno::Type& aType );\n\n \/\/-------------------------------------------\n \/\/ useable for derived classes\n protected:\n\n \/\/---------------------------------------\n \/** @short can be overwritten by a derived class to handle interceptions\n outside.\n\n @descr This base implementation checks, if the request could be intercepted\n successfully. Then this method intercepted() is called.\n The default implementation returns \"NOT_INTERCEPTED\" everytimes.\n So the method impl_interceptRequest() uses the right continuation automaticly.\n\n If this method was overwritten and something different \"NO_INTERCEPTED\"\n is returned, the method impl_interceptRequest() will return immediatly with\n the result, which is returned by this intercepted() method.\n Then the continuations must be selected inside the intercepted() call!\n\n @param rRequest\n it points to the intercepted request (means the item of the\n set interception list). e.g. its \"Handle\" member can be used\n to identify it and react very easy, without the need to check the\n type of the exception ...\n\n @param xOrgRequest\n points to the original interaction, which was intercepted.\n It provides access to the exception and the list of possible\n continuations.\n\n @return The result of this operation.\n Note: If E_NOT_INTERCEPTED is returned the default handling of the base class\n will be used automaticly for this request!\n *\/\n virtual EInterceptionState intercepted(const InterceptedRequest& rRequest ,\n const ::com::sun::star::uno::Reference< ::com::sun::star::task::XInteractionRequest >& xOrgRequest);\n\n \/\/-------------------------------------------\n \/\/ uno interface\n public:\n\n \/\/---------------------------------------\n \/** @short implements the default handling of this class ....\n or can be overwritten by any derived class.\n\n @descr If no further class is derived from this one\n -> the default implementation is used. Then the\n internal list of requests is used to handle different\n interactions automaticly.\n (see impl_interceptRequest())\n\n If this method was overwritten by a derived implementation\n -> the new implementation has to do everything by itself.\n Of course it can access all members\/helpers and work with it.\n But the default implementation isnt used automaticly then.\n\n @param xRequest\n the interaction request, which should be intercepted.\n *\/\n virtual void SAL_CALL handle(const ::com::sun::star::uno::Reference< ::com::sun::star::task::XInteractionRequest >& xRequest)\n throw(::com::sun::star::uno::RuntimeException);\n\n \/\/-------------------------------------------\n \/\/ helper\n private:\n\n \/\/---------------------------------------\n \/** @short implements the default handling:\n - intercept or forward to internal handler.\n *\/\n UCBHELPER_DLLPRIVATE void impl_handleDefault(const ::com::sun::star::uno::Reference< ::com::sun::star::task::XInteractionRequest >& xRequest);\n\n \/\/---------------------------------------\n \/** @short implements the interception of requests.\n\n @descr The incoming request will be analyzed, if it match\n any request of the m_lIntercepions list.\n If an interception could be found, its continuation will be\n searched and selected.\n\n The method return the state of that operation.\n But it doesnt call the intercepted and here set\n interaction handler. That has to be done in the outside method.\n\n @param xRequest\n the interaction request, which should be intercepted.\n\n @return A identifier, which inidicates if the request was intercepted,\n the continuation was found and selected ... or not.\n *\/\n UCBHELPER_DLLPRIVATE EInterceptionState impl_interceptRequest(const ::com::sun::star::uno::Reference< ::com::sun::star::task::XInteractionRequest >& xRequest);\n};\n\n} \/\/ namespace ucbhelper\n\n#endif \/\/ _UCBHELPER_INTERCEPTEDINTERACTION_HXX_\n<|endoftext|>"} {"text":"<commit_before>#define THRUST_DEBUG 1\n\n#include \"lcp\/ChLcpVariablesGeneric.h\"\n#include \"lcp\/ChLcpVariablesBody.h\"\n#include \"lcp\/ChLcpConstraintTwoGeneric.h\"\n#include \"lcp\/ChLcpSystemDescriptor.h\"\n#include \"lcp\/ChLcpIterativeSOR.h\"\n#include \"lcp\/ChLcpIterativePMINRES.h\"\n#include \"lcp\/ChLcpIterativeBB.h\"\n#include \"lcp\/ChLcpSimplexSolver.h\"\n#include \"core\/ChLinearAlgebra.h\"\n#include \"physics\/ChSystemOpenMP.h\"\n#include \"assets\/ChSphereShape.h\"\n#include \"physics\/ChApidll.h\"\n#include \"physics\/ChSystem.h\"\n#include \"lcp\/ChLcpIterativeMINRES.h\"\n#include \"core\/ChRealtimeStep.h\"\n#include \"lcp\/ChLcpIterativeSOR.h\"\n#include \"lcp\/ChLcpIterativeJacobi.h\"\n#include \"collision\/ChCModelBullet.h\"\n#include \"collision\/ChCCollisionSystemBullet.h\"\n#include \"physics\/ChContactContainer.h\"\n\/\/ #include \"unit_OPENGL\/ChOpenGL.h\"\n#include \"unit_POSTPROCESS\/ChMitsubaRender.h\"\n\n#include \"unit_GPU\/ChSystemGPU.h\"\n\n\n\/\/ Remember to use the namespace 'chrono' because all classes \n\/\/ of Chrono::Engine belong to this namespace and its children...\n\nusing namespace chrono;\nusing namespace postprocess;\n\/\/#define CHBODYSHAREDPTR ChSharedBodyPtr\n\/\/#define CHBODY ChBody\n\/\/#define CHCOLLISIONSYS ChCollisionSystemBullet\n\/\/#define CHLCPDESC ChLcpSystemDescriptor\n\/\/#define CHCONTACTCONT ChContactContainer\n\/\/#define CHSOLVER ChLcpIterativeJacobi\n\/\/#define CHMODEL ChModelBullet\n\/\/#define CHSYS ChSystem\n#define CHBODYSHAREDPTR ChSharedBodyGPUPtr\n#define CHBODY ChBodyGPU\n#define CHCOLLISIONSYS ChCollisionSystemGPU\n#define CHLCPDESC ChLcpSystemDescriptorGPU\n#define CHCONTACTCONT ChContactContainerGPUsimple\n#define CHSOLVER ChLcpIterativeJacobi\n#define CHMODEL ChModelGPU\n#define CHSYS ChSystemGPU\nuint num_objects=0;\nvoid dump_matricies(ChLcpSystemDescriptor& mdescriptor) {\n\tchrono::ChSparseMatrix mdM;\n\tchrono::ChSparseMatrix mdCq;\n\tchrono::ChSparseMatrix mdE;\n\tchrono::ChMatrixDynamic<double> mdf;\n\tchrono::ChMatrixDynamic<double> mdb;\n\tchrono::ChMatrixDynamic<double> mdfric;\n\tmdescriptor.ConvertToMatrixForm(&mdCq, &mdM, &mdE, &mdf, &mdb, &mdfric);\n\tchrono::ChStreamOutAsciiFile file_M(\"dump_M.dat\");\n\tmdM.StreamOUTsparseMatlabFormat(file_M);\n\tchrono::ChStreamOutAsciiFile file_Cq(\"dump_Cq.dat\");\n\tmdCq.StreamOUTsparseMatlabFormat(file_Cq);\n\tchrono::ChStreamOutAsciiFile file_E(\"dump_E.dat\");\n\tmdE.StreamOUTsparseMatlabFormat(file_E);\n\tchrono::ChStreamOutAsciiFile file_f(\"dump_f.dat\");\n\tmdf.StreamOUTdenseMatlabFormat(file_f);\n\tchrono::ChStreamOutAsciiFile file_b(\"dump_b.dat\");\n\tmdb.StreamOUTdenseMatlabFormat(file_b);\n\tchrono::ChStreamOutAsciiFile file_fric(\"dump_fric.dat\");\n\tmdfric.StreamOUTdenseMatlabFormat(file_fric);\n}\ntemplate<class T>\nvoid RunTimeStep(T* mSys, const int frame){\n\tVector lpos(0, 0, 0);\n\tChQuaternion<> quat(1, 0, 0, 0);\n\tCHBODYSHAREDPTR sphere;\n\t\n if(frame%10==0){\n for (int i = 0; i < 10; i++) {\n\t\tsphere = CHBODYSHAREDPTR(new CHBODY);\n Vector pos=Vector((rand() % 10000 \/ 1000.0 - 5), (10), (rand() % 10000 \/ 1000.0 - 5));\n\t\tInitObject(sphere, 1.0, pos*.5 , quat, 1, 1, 0, true, false, 32, 17+num_objects);\n\t\tAddCollisionGeometry(sphere, SPHERE, Vector(.3, .3, .3), lpos, quat);\n\t\tFinalizeObject(sphere, (CHSYS*) mSys);\n\t\tnum_objects++;\n\t}\n }\n \n}\n\n\n\n\nint main(int argc, char* argv[]) {\n\tfeenableexcept(FE_DIVBYZERO | FE_INVALID | FE_OVERFLOW);\n\tomp_set_num_threads(6);\n CHSYS* mSys = new CHSYS();\n\tCHLCPDESC *mdescriptor = new CHLCPDESC();\n\tCHCONTACTCONT *mcontactcontainer = new CHCONTACTCONT();\n\tCHCOLLISIONSYS *mcollisionengine = new CHCOLLISIONSYS();\n\t\/\/ChLcpIterativeJacobi *msolver = new ChLcpIterativeJacobi();\n\t\/\/ChLcpIterativeSOR *msolver = new ChLcpIterativeSOR();\n\t\/\/ChLcpIterativeMINRES *msolver = new ChLcpIterativeMINRES();\n\t\/\/ChLcpIterativePMINRES *msolver = new ChLcpIterativePMINRES();\n\t\/\/ChLcpIterativeBB *msolver = new ChLcpIterativeBB();\n\n\tmSys->ChangeLcpSystemDescriptor(mdescriptor);\n\tmSys->ChangeContactContainer(mcontactcontainer);\n\t\/\/mSys->ChangeLcpSolverSpeed(msolver);\n\tmSys->ChangeCollisionSystem(mcollisionengine);\n\n\tmSys->SetIntegrationType(ChSystem::INT_ANITESCU);\n\tmSys->Set_G_acc(Vector(0, -9.80665, 0));\n\n\tVector lpos(0, 0, 0);\n\tChQuaternion<> quat(1, 0, 0, 0);\n\/\/\tChSharedBodyPtr sphere;\n\/\/\tfor (int i = 0; i < 1000; i++) {\n\/\/\t\tsphere = ChSharedBodyPtr(new ChBody);\n\/\/\t\tInitObject(sphere, 1.0, Vector((rand() % 10000 \/ 1000.0 - 5), (rand() % 10000 \/ 1000.0 - 5), (rand() % 10000 \/ 1000.0 - 5)), quat, 1, 1, 0, true, false, 32, 17 + i);\n\/\/\t\tAddCollisionGeometry(sphere, SPHERE, Vector(.3, .3, .3), lpos, quat);\n\/\/\t\tFinalizeObject(sphere, mSys);\n\/\/\t}\n\n\tfloat mWallMu = 1, container_width = 7.0, container_thickness = .5, container_height = 7.0, wscale = 1;\n\tCHBODYSHAREDPTR L = CHBODYSHAREDPTR(new CHBODY);\n\tCHBODYSHAREDPTR R = CHBODYSHAREDPTR(new CHBODY);\n\tCHBODYSHAREDPTR F = CHBODYSHAREDPTR(new CHBODY);\n\tCHBODYSHAREDPTR B = CHBODYSHAREDPTR(new CHBODY);\n\tCHBODYSHAREDPTR BTM = CHBODYSHAREDPTR(new CHBODY);\n\n\tInitObject(L, 100000, Vector(-container_width + container_thickness, 0, 0), quat, mWallMu, mWallMu, 0, true, true, -20, -20);\n\tInitObject(R, 100000, Vector(container_width - container_thickness, 0, 0), quat, mWallMu, mWallMu, 0, true, true, -20, -20);\n\tInitObject(F, 100000, Vector(0, 0, -container_width + container_thickness), quat, mWallMu, mWallMu, 0, true, true, -20, -20);\n\tInitObject(B, 100000, Vector(0, 0, container_width - container_thickness), quat, mWallMu, mWallMu, 0, true, true, -20, -20);\n\tInitObject(BTM, 100000, Vector(0, -container_height + container_thickness, 0), quat, mWallMu, mWallMu, 0, true, true, -20, -20);\n\n\tAddCollisionGeometry(L, BOX, Vector(container_thickness, container_height, container_width), lpos, quat);\n\tAddCollisionGeometry(R, BOX, Vector(container_thickness, container_height, container_width), lpos, quat);\n\tAddCollisionGeometry(F, BOX, Vector(container_width * wscale, container_height, container_thickness), lpos, quat);\n\tAddCollisionGeometry(B, BOX, Vector(container_width * wscale, container_height, container_thickness), lpos, quat);\n\tAddCollisionGeometry(BTM, BOX, Vector(container_width * wscale, container_thickness , container_width), lpos, quat);\n\n\tFinalizeObject(L, mSys);\n\tFinalizeObject(R, mSys);\n\tFinalizeObject(F, mSys);\n\tFinalizeObject(B, mSys);\n\tFinalizeObject(BTM, mSys);\n\n\tmSys->SetStep(0.01);\n\/\/ \tChOpenGLManager * window_manager = new ChOpenGLManager();\n\/\/ \tChOpenGL openGLView(window_manager, mSys, 800, 600, 0, 0, \"Test_Solvers\");\n\/\/ openGLView.SetCustomCallback(RunTimeStep);\n\/\/ \topenGLView.StartSpinning(window_manager);\n\/\/ \twindow_manager->CallGlutMainLoop();\n\/\/\n\/\/\t\/\/msolver->Solve(*mdescriptor,true);\n\/\/\t\/\/dump_matricies(*mdescriptor);\n\/\/\t\/\/ChLcpIterativePMINRES msolver_krylov(20, false, 0.00001);\n\/\/\t\/\/msolver_krylov.Solve(mdescriptor);\n\/\/ \n\/\/ ChMitsubaRender output(mSys);\n\/\/ \n\/\/\toutput.SetIntegrator(\"photonmapper\");\n\/\/\toutput.SetIntegratorOption(\"integer\", \"maxDepth\", \"32\");\n\/\/\toutput.SetFilm(\"ldrfilm\");\n\/\/\toutput.SetFilmOption(\"integer\", \"height\", \"1200\");\n\/\/\toutput.SetFilmOption(\"integer\", \"width\", \"1920\");\n\/\/ \n\/\/\toutput.camera_target = ChVector<>(0, 0, 0);\n\/\/\toutput.camera_origin = ChVector<>(0, 0, -10);\n\/\/\toutput.camera_up = ChVector<>(0, 1, 0);\n\/\/ \n\/\/\toutput.SetDataFolder(\"data\");\n\/\/\toutput.ExportScript(\"test.xml\");\n\/\/ output.SetRenderFolder(\"render\");\n\/\/ output.ExportDriver(\"driver.sh\");\n \n int counter=0;\n \n while(counter<1000){\n RunTimeStep(mSys, counter);\n mSys->DoStepDynamics(.01);\n \n stringstream ss;\n\t\tss << \"data\/\" << counter << \".xml\";\n\t\t\/\/output.ExportData(ss.str());\n \n cout<<counter<<endl;\n counter++;\n \n }\n \n\n\treturn 0;\n}\n\n<commit_msg>Made stability changes to code<commit_after>#define THRUST_DEBUG 1\n\n#include \"lcp\/ChLcpVariablesGeneric.h\"\n#include \"lcp\/ChLcpVariablesBody.h\"\n#include \"lcp\/ChLcpConstraintTwoGeneric.h\"\n#include \"lcp\/ChLcpSystemDescriptor.h\"\n#include \"lcp\/ChLcpIterativeSOR.h\"\n#include \"lcp\/ChLcpIterativePMINRES.h\"\n#include \"lcp\/ChLcpIterativeBB.h\"\n#include \"lcp\/ChLcpSimplexSolver.h\"\n#include \"core\/ChLinearAlgebra.h\"\n#include \"physics\/ChSystemOpenMP.h\"\n#include \"assets\/ChSphereShape.h\"\n#include \"physics\/ChApidll.h\"\n#include \"physics\/ChSystem.h\"\n#include \"lcp\/ChLcpIterativeMINRES.h\"\n#include \"core\/ChRealtimeStep.h\"\n#include \"lcp\/ChLcpIterativeSOR.h\"\n#include \"lcp\/ChLcpIterativeJacobi.h\"\n#include \"collision\/ChCModelBullet.h\"\n#include \"collision\/ChCCollisionSystemBullet.h\"\n#include \"physics\/ChContactContainer.h\"\n\/\/ #include \"unit_OPENGL\/ChOpenGL.h\"\n#include \"unit_POSTPROCESS\/ChMitsubaRender.h\"\n\n#include \"unit_GPU\/ChSystemGPU.h\"\n\n\n\/\/ Remember to use the namespace 'chrono' because all classes \n\/\/ of Chrono::Engine belong to this namespace and its children...\n\nusing namespace chrono;\nusing namespace postprocess;\n\/\/#define CHBODYSHAREDPTR ChSharedBodyPtr\n\/\/#define CHBODY ChBody\n\/\/#define CHCOLLISIONSYS ChCollisionSystemBullet\n\/\/#define CHLCPDESC ChLcpSystemDescriptor\n\/\/#define CHCONTACTCONT ChContactContainer\n\/\/#define CHSOLVER ChLcpIterativeJacobi\n\/\/#define CHMODEL ChModelBullet\n\/\/#define CHSYS ChSystem\n#define CHBODYSHAREDPTR ChSharedBodyGPUPtr\n#define CHBODY ChBodyGPU\n#define CHCOLLISIONSYS ChCollisionSystemGPU\n#define CHLCPDESC ChLcpSystemDescriptorGPU\n#define CHCONTACTCONT ChContactContainerGPUsimple\n#define CHSOLVER ChLcpIterativeJacobi\n#define CHMODEL ChModelGPU\n#define CHSYS ChSystemGPU\nuint num_objects=0;\nvoid dump_matricies(ChLcpSystemDescriptor& mdescriptor) {\n\tchrono::ChSparseMatrix mdM;\n\tchrono::ChSparseMatrix mdCq;\n\tchrono::ChSparseMatrix mdE;\n\tchrono::ChMatrixDynamic<double> mdf;\n\tchrono::ChMatrixDynamic<double> mdb;\n\tchrono::ChMatrixDynamic<double> mdfric;\n\tmdescriptor.ConvertToMatrixForm(&mdCq, &mdM, &mdE, &mdf, &mdb, &mdfric);\n\tchrono::ChStreamOutAsciiFile file_M(\"dump_M.dat\");\n\tmdM.StreamOUTsparseMatlabFormat(file_M);\n\tchrono::ChStreamOutAsciiFile file_Cq(\"dump_Cq.dat\");\n\tmdCq.StreamOUTsparseMatlabFormat(file_Cq);\n\tchrono::ChStreamOutAsciiFile file_E(\"dump_E.dat\");\n\tmdE.StreamOUTsparseMatlabFormat(file_E);\n\tchrono::ChStreamOutAsciiFile file_f(\"dump_f.dat\");\n\tmdf.StreamOUTdenseMatlabFormat(file_f);\n\tchrono::ChStreamOutAsciiFile file_b(\"dump_b.dat\");\n\tmdb.StreamOUTdenseMatlabFormat(file_b);\n\tchrono::ChStreamOutAsciiFile file_fric(\"dump_fric.dat\");\n\tmdfric.StreamOUTdenseMatlabFormat(file_fric);\n}\ntemplate<class T>\nvoid RunTimeStep(T* mSys, const int frame){\n\tVector lpos(0, 0, 0);\n\tChQuaternion<> quat(1, 0, 0, 0);\n\tCHBODYSHAREDPTR sphere;\n\t\n if(frame%10==0){\n for (int i = 0; i < 10; i++) {\n\t\tsphere = CHBODYSHAREDPTR(new CHBODY);\n Vector pos=Vector((rand() % 10000 \/ 1000.0 - 5), (10), (rand() % 10000 \/ 1000.0 - 5));\n\t\tInitObject(sphere, 1.0, pos*.5 , quat, 1, 1, 0, true, false, 32, 17+num_objects);\n\t\tAddCollisionGeometry(sphere, SPHERE, Vector(.3, .3, .3), lpos, quat);\n\t\tFinalizeObject(sphere, (CHSYS*) mSys);\n\t\tnum_objects++;\n\t}\n }\n \n}\n\n\n\n\nint main(int argc, char* argv[]) {\n\tfeenableexcept(FE_DIVBYZERO | FE_INVALID | FE_OVERFLOW);\n\tomp_set_num_threads(6);\n CHSYS* mSys = new CHSYS();\n\tCHLCPDESC *mdescriptor = new CHLCPDESC();\n\tCHCONTACTCONT *mcontactcontainer = new CHCONTACTCONT();\n\tCHCOLLISIONSYS *mcollisionengine = new CHCOLLISIONSYS();\n\t\/\/ChLcpIterativeJacobi *msolver = new ChLcpIterativeJacobi();\n\t\/\/ChLcpIterativeSOR *msolver = new ChLcpIterativeSOR();\n\t\/\/ChLcpIterativeMINRES *msolver = new ChLcpIterativeMINRES();\n\t\/\/ChLcpIterativePMINRES *msolver = new ChLcpIterativePMINRES();\n\t\/\/ChLcpIterativeBB *msolver = new ChLcpIterativeBB();\n\n\tmSys->ChangeLcpSystemDescriptor(mdescriptor);\n\tmSys->ChangeContactContainer(mcontactcontainer);\n\t\/\/mSys->ChangeLcpSolverSpeed(msolver);\n\tmSys->ChangeCollisionSystem(mcollisionengine);\n\n\tmSys->SetIntegrationType(ChSystem::INT_ANITESCU);\n\tmSys->Set_G_acc(Vector(0, -9.80665, 0));\n\n\tVector lpos(0, 0, 0);\n\tChQuaternion<> quat(1, 0, 0, 0);\n\/\/\tChSharedBodyPtr sphere;\n\/\/\tfor (int i = 0; i < 1000; i++) {\n\/\/\t\tsphere = ChSharedBodyPtr(new ChBody);\n\/\/\t\tInitObject(sphere, 1.0, Vector((rand() % 10000 \/ 1000.0 - 5), (rand() % 10000 \/ 1000.0 - 5), (rand() % 10000 \/ 1000.0 - 5)), quat, 1, 1, 0, true, false, 32, 17 + i);\n\/\/\t\tAddCollisionGeometry(sphere, SPHERE, Vector(.3, .3, .3), lpos, quat);\n\/\/\t\tFinalizeObject(sphere, mSys);\n\/\/\t}\n\n\tfloat mWallMu = 1, container_width = 7.0, container_thickness = .5, container_height = 7.0, wscale = 1;\n\tCHBODYSHAREDPTR L = CHBODYSHAREDPTR(new CHBODY);\n\tCHBODYSHAREDPTR R = CHBODYSHAREDPTR(new CHBODY);\n\tCHBODYSHAREDPTR F = CHBODYSHAREDPTR(new CHBODY);\n\tCHBODYSHAREDPTR B = CHBODYSHAREDPTR(new CHBODY);\n\tCHBODYSHAREDPTR BTM = CHBODYSHAREDPTR(new CHBODY);\n\n\tInitObject(L, 100000, Vector(-container_width + container_thickness, 0, 0), quat, mWallMu, mWallMu, 0, true, true, -20, -20);\n\tInitObject(R, 100000, Vector(container_width - container_thickness, 0, 0), quat, mWallMu, mWallMu, 0, true, true, -20, -20);\n\tInitObject(F, 100000, Vector(0, 0, -container_width + container_thickness), quat, mWallMu, mWallMu, 0, true, true, -20, -20);\n\tInitObject(B, 100000, Vector(0, 0, container_width - container_thickness), quat, mWallMu, mWallMu, 0, true, true, -20, -20);\n\tInitObject(BTM, 100000, Vector(0, -container_height + container_thickness, 0), quat, mWallMu, mWallMu, 0, true, true, -20, -20);\n\n\tAddCollisionGeometry(L, BOX, Vector(container_thickness, container_height, container_width), lpos, quat);\n\tAddCollisionGeometry(R, BOX, Vector(container_thickness, container_height, container_width), lpos, quat);\n\tAddCollisionGeometry(F, BOX, Vector(container_width * wscale, container_height, container_thickness), lpos, quat);\n\tAddCollisionGeometry(B, BOX, Vector(container_width * wscale, container_height, container_thickness), lpos, quat);\n\tAddCollisionGeometry(BTM, BOX, Vector(container_width * wscale, container_thickness , container_width), lpos, quat);\n\n\tFinalizeObject(L, mSys);\n\tFinalizeObject(R, mSys);\n\tFinalizeObject(F, mSys);\n\tFinalizeObject(B, mSys);\n\tFinalizeObject(BTM, mSys);\n\n\tmSys->SetStep(0.01);\n\/\/ \/\/\tChOpenGLManager * window_manager = new ChOpenGLManager();\n\/\/ \/\/\tChOpenGL openGLView(window_manager, mSys, 800, 600, 0, 0, \"Test_Solvers\");\n\/\/ \/\/ openGLView.SetCustomCallback(RunTimeStep);\n\/\/ \/\/\topenGLView.StartSpinning(window_manager);\n\/\/ \/\/\twindow_manager->CallGlutMainLoop();\n\/\/\n\/\/\t\/\/msolver->Solve(*mdescriptor,true);\n\/\/\t\/\/dump_matricies(*mdescriptor);\n\/\/\t\/\/ChLcpIterativePMINRES msolver_krylov(20, false, 0.00001);\n\/\/\t\/\/msolver_krylov.Solve(mdescriptor);\n\/\/ \n\/\/ ChMitsubaRender output(mSys);\n\/\/ \n\/\/\toutput.SetIntegrator(\"photonmapper\");\n\/\/\toutput.SetIntegratorOption(\"integer\", \"maxDepth\", \"32\");\n\/\/\toutput.SetFilm(\"ldrfilm\");\n\/\/\toutput.SetFilmOption(\"integer\", \"height\", \"1200\");\n\/\/\toutput.SetFilmOption(\"integer\", \"width\", \"1920\");\n\/\/ \n\/\/\toutput.camera_target = ChVector<>(0, 0, 0);\n\/\/\toutput.camera_origin = ChVector<>(0, 0, -10);\n\/\/\toutput.camera_up = ChVector<>(0, 1, 0);\n\/\/ \n\/\/\toutput.SetDataFolder(\"data\");\n\/\/\toutput.ExportScript(\"test.xml\");\n\/\/ output.SetRenderFolder(\"render\");\n\/\/ output.ExportDriver(\"driver.sh\");\n \n int counter=0;\n \n while(counter<1000){\n RunTimeStep(mSys, counter);\n mSys->DoStepDynamics(.01);\n \n stringstream ss;\n\t\tss << \"data\/\" << counter << \".xml\";\n\t\t\/\/output.ExportData(ss.str());\n \n cout<<counter<<endl;\n counter++;\n \n }\n \n\n\treturn 0;\n}\n\n<|endoftext|>"} {"text":"<commit_before>\n#include <togo\/core\/error\/assert.hpp>\n#include <togo\/core\/utility\/utility.hpp>\n#include <togo\/core\/log\/log.hpp>\n#include <togo\/core\/collection\/array.hpp>\n#include <togo\/core\/string\/string.hpp>\n#include <togo\/core\/io\/memory_stream.hpp>\n\n#include <quanta\/core\/object\/object.hpp>\n\n#include <togo\/support\/test.hpp>\n\n#include <cmath>\n\nusing namespace quanta;\n\n#define TSN(d) {true, d, {}},\n#define TSE(d, e) {true, d, e},\n#define TF(d) {false, d, {}},\n\nstruct Test {\n\tbool success;\n\tStringRef data;\n\tStringRef expected_output;\n} const tests[]{\n\/\/ whitespace\n\tTSN(\"\")\n\tTSN(\" \")\n\tTSN(\"\\n\")\n\tTSN(\" \\t\\n\")\n\n\/\/ comments\n\tTF(\"\/\")\n\tTF(\"\/*\")\n\tTSN(\"\/\/\")\n\tTSN(\"\/**\/\")\n\tTSN(\"\/*\\nblah\\n*\/\")\n\n\/\/ constants\n\tTSE(\"null\", \"null\")\n\tTSE(\"false\", \"false\")\n\tTSE(\"true\", \"true\")\n\n\/\/ identifiers\n\tTSE(\"a\", \"a\")\n\tTSE(\"á\", \"á\")\n\tTSE(\".á\", \".á\")\n\tTSE(\"_\", \"_\")\n\tTSE(\"a\\nb\", \"a\\nb\")\n\n\/\/ markers\n\tTSE(\"~\", \"~\")\n\tTSE(\"~x\", \"~x\")\n\tTSE(\"~~x\", \"~~x\")\n\tTSE(\"~~~x\", \"~~~x\")\n\n\tTSE(\"^\", \"^\")\n\tTSE(\"^x\", \"^x\")\n\tTSE(\"^^x\", \"^^x\")\n\tTSE(\"^^^x\", \"^^^x\")\n\n\tTSE(\"G~~x\", \"G~~x\")\n\tTSE(\" G~x\", \"G~x\")\n\tTSE(\"G~^x\", \"G~^x\")\n\n\tTSE(\"?\", \"?\")\n\tTSE(\"?~x\", \"?~x\")\n\tTSE(\" ?x\", \"?x\")\n\tTSE(\"?^x\", \"?^x\")\n\n\/\/ source\n\tTSE(\"x$0\", \"x\")\n\tTSE(\"x$0$0\", \"x\")\n\tTSE(\"x$0$1\", \"x\")\n\tTSE(\"x$0$?\", \"x\")\n\n\tTSE(\"x$1\", \"x$1\")\n\tTSE(\"x$1$0\", \"x$1\")\n\tTSE(\"x$1$?\", \"x$1$?\")\n\tTSE(\"x$1$2\", \"x$1$2\")\n\n\tTSE(\"x$?1\", \"x$?1\")\n\tTSE(\"x$?1$0\", \"x$?1\")\n\tTSE(\"x$?1$?\", \"x$?1$?\")\n\tTSE(\"x$?1$2\", \"x$?1$2\")\n\n\tTSE(\"x$?$?\", \"x$?$?\")\n\n\/\/ numerics\n\tTSE(\" 1\", \"1\")\n\tTSE(\"+1\", \"1\")\n\tTSE(\"-1\", \"-1\")\n\n\t\/\/ . is actually a valid identifier lead here, so this is not true\n\t\/\/ TSE(\" .1\", \"0.1\")\n\tTSE(\"+.1\", \"0.1\")\n\tTSE(\"-.1\", \"-0.1\")\n\n\tTSE(\" 1.1\", \"1.1\")\n\tTSE(\"+1.1\", \"1.1\")\n\tTSE(\"-1.1\", \"-1.1\")\n\n\tTSE(\" 1.1e1\", \"11\")\n\tTSE(\"+1.1e1\", \"11\")\n\tTSE(\"-1.1e1\", \"-11\")\n\n\tTSE(\" 1.1e+1\", \"11\")\n\tTSE(\"+1.1e+1\", \"11\")\n\tTSE(\"-1.1e+1\", \"-11\")\n\n\tTSE(\" 1.1e-1\", \"0.11\")\n\tTSE(\"+1.1e-1\", \"0.11\")\n\tTSE(\"-1.1e-1\", \"-0.11\")\n\n\/\/ units\n\tTSE(\"1a\", \"1a\")\n\tTSE(\"1µg\", \"1µg\")\n\n\/\/ strings\n\tTSE(\"\\\"\\\"\", \"\\\"\\\"\")\n\tTSE(\"\\\"a\\\"\", \"a\")\n\tTSE(\"``````\", \"\\\"\\\"\")\n\tTSE(\"```a```\", \"a\")\n\n\tTSE(\"\\\"\\\\t\\\"\", \"\\\"\\t\\\"\")\n\tTSE(\"\\\"\\\\n\\\"\", \"```\\n```\")\n\n\/\/ names\n\tTF(\"=\")\n\tTF(\"a=\")\n\tTF(\"=,\")\n\tTF(\"=;\")\n\tTF(\"=\\n\")\n\tTSE(\"a=1\", \"a = 1\")\n\tTSE(\"a=b\", \"a = b\")\n\tTSE(\"a = 1\", \"a = 1\")\n\tTSE(\"a = b\", \"a = b\")\n\n\tTSE(\"a=\\\"\\\"\", \"a = \\\"\\\"\")\n\tTSE(\"a=\\\"ab\\\"\", \"a = ab\")\n\tTSE(\"a=\\\"a b\\\"\", \"a = \\\"a b\\\"\")\n\tTF(\"a=\\\"\\n\")\n\n\tTSE(\"a=```ab```\", \"a = ab\")\n\tTSE(\"a=```a b```\", \"a = \\\"a b\\\"\")\n\tTSE(\"a=```a\\nb```\", \"a = ```a\\nb```\")\n\n\/\/ tags\n\tTF(\":\")\n\tTF(\"::\")\n\tTF(\":,\")\n\tTF(\":;\")\n\tTF(\":\\n\")\n\tTF(\":\\\"a\\\"\")\n\tTF(\":```a```\")\n\tTF(\":1\")\n\tTSE(\":x\", \":x\")\n\tTF(\":x:\")\n\tTF(\":x=\")\n\tTF(\"x=:\")\n\tTSE(\"x:y\", \"x:y\")\n\tTSE(\":x:y\", \":x:y\")\n\n\tTSE(\":?x\", \":?x\")\n\tTSE(\":G~x\", \":G~x\")\n\n\tTSE(\":~x\", \":~x\")\n\tTSE(\":~~x\", \":~~x\")\n\tTSE(\":~~~x\", \":~~~x\")\n\n\tTSE(\":^x\", \":^x\")\n\tTSE(\":^^x\", \":^^x\")\n\tTSE(\":^^^x\", \":^^^x\")\n\n\tTSE(\":?~x\", \":?~x\")\n\tTSE(\":?~~x\", \":?~~x\")\n\tTSE(\":?~~~x\", \":?~~~x\")\n\n\tTSE(\":?^x\", \":?^x\")\n\tTSE(\":?^^x\", \":?^^x\")\n\tTSE(\":?^^^x\", \":?^^^x\")\n\n\tTSE(\":G~~x\", \":G~~x\")\n\tTSE(\":G~~~x\", \":G~~~x\")\n\tTSE(\":G~~~~x\", \":G~~~~x\")\n\n\tTSE(\":G~^x\", \":G~^x\")\n\tTSE(\":G~^^x\", \":G~^^x\")\n\tTSE(\":G~^^^x\", \":G~^^^x\")\n\n\tTF(\":x(\")\n\tTSE(\":x()\", \":x\")\n\tTSE(\":x( )\", \":x\")\n\tTSE(\":x(\\t)\", \":x\")\n\tTSE(\":x(\\n)\", \":x\")\n\tTSE(\":x(1)\", \":x(1)\")\n\tTSE(\":x(y)\", \":x(y)\")\n\tTSE(\":x(y,z)\", \":x(y, z)\")\n\tTSE(\":x(y;z)\", \":x(y, z)\")\n\tTSE(\":x(y\\nz)\", \":x(y, z)\")\n\n\/\/ scopes\n\tTF(\"{\")\n\tTF(\"(\")\n\tTF(\"[\")\n\tTSE(\"{}\", \"null\")\n\tTSE(\"{{}}\", \"{\\n\\tnull\\n}\")\n\tTSE(\"x{}\", \"x\")\n\tTSE(\"x[]\", \"x\")\n\tTSE(\"x[1]\", \"x[1]\")\n\tTSE(\"x[y]\", \"x[y]\")\n};\n\nvoid check(Test const& test) {\n\tTOGO_LOGF(\n\t\t\"reading (%3u): <%.*s>\\n\",\n\t\ttest.data.size, test.data.size, test.data.data\n\t);\n\tObject root;\n\tMemoryReader in_stream{test.data};\n\tObjectParserInfo pinfo;\n\tif (object::read_text(root, in_stream, pinfo)) {\n\t\tMemoryStream out_stream{memory::default_allocator(), test.expected_output.size + 1};\n\t\tTOGO_ASSERTE(object::write_text(root, out_stream));\n\t\tStringRef output{\n\t\t\treinterpret_cast<char*>(array::begin(out_stream.data())),\n\t\t\tstatic_cast<unsigned>(out_stream.size())\n\t\t};\n\t\t\/\/ Remove trailing newline\n\t\tif (output.size > 0) {\n\t\t\t--output.size;\n\t\t}\n\t\tTOGO_LOGF(\n\t\t\t\"rewritten (%3u): <%.*s>\\n\",\n\t\t\toutput.size, output.size, output.data\n\t\t);\n\t\tTOGO_ASSERT(test.success, \"read succeeded when it should have failed\");\n\t\tTOGO_ASSERT(\n\t\t\tstring::compare_equal(test.expected_output, output),\n\t\t\t\"output does not match\"\n\t\t);\n\t} else {\n\t\tTOGO_LOGF(\n\t\t\t\"failed to read%s: [%2u,%2u]: %s\\n\",\n\t\t\ttest.success ? \" (UNEXPECTED)\" : \"\",\n\t\t\tpinfo.line,\n\t\t\tpinfo.column,\n\t\t\tpinfo.message\n\t\t);\n\t\tTOGO_ASSERT(!test.success, \"read failed when it should have succeeded\");\n\t}\n\tTOGO_LOG(\"\\n\");\n}\n\nsigned main() {\n\tmemory_init();\n\n\tfor (auto& test : tests) {\n\t\tcheck(test);\n\t}\n\treturn 0;\n}\n<commit_msg>lib\/core\/test\/object\/io_text: added tests for nested comment blocks; tidy.<commit_after>\n#include <togo\/core\/error\/assert.hpp>\n#include <togo\/core\/utility\/utility.hpp>\n#include <togo\/core\/log\/log.hpp>\n#include <togo\/core\/collection\/array.hpp>\n#include <togo\/core\/string\/string.hpp>\n#include <togo\/core\/io\/memory_stream.hpp>\n\n#include <quanta\/core\/object\/object.hpp>\n\n#include <togo\/support\/test.hpp>\n\n#include <cmath>\n\nusing namespace quanta;\n\n#define TSN(d) {true, d, {}},\n#define TSE(d, e) {true, d, e},\n#define TF(d) {false, d, {}},\n\nstruct Test {\n\tbool success;\n\tStringRef data;\n\tStringRef expected_output;\n} const tests[]{\n\/\/ whitespace\n\tTSN(\"\")\n\tTSN(\" \")\n\tTSN(\"\\n\")\n\tTSN(\" \\t\\n\")\n\n\/\/ comments\n\tTF(\"\\\\\")\n\tTF(\"\\\\*\")\n\tTSN(\"\\\\\\\\\")\n\tTSN(\"\\\\**\\\\\")\n\tTSN(\"\\\\*\\nblah\\n*\\\\\")\n\n\t\/\/ nested\n\tTF(\"\\\\* \\\\* *\\\\\")\n\tTSN(\"\\\\* \\\\**\\\\ *\\\\\")\n\n\/\/ constants\n\tTSE(\"null\", \"null\")\n\tTSE(\"false\", \"false\")\n\tTSE(\"true\", \"true\")\n\n\/\/ identifiers\n\tTSE(\"a\", \"a\")\n\tTSE(\"á\", \"á\")\n\tTSE(\".á\", \".á\")\n\tTSE(\"_\", \"_\")\n\tTSE(\"a\\nb\", \"a\\nb\")\n\n\/\/ markers\n\tTSE(\"~\", \"~\")\n\tTSE(\"~x\", \"~x\")\n\tTSE(\"~~x\", \"~~x\")\n\tTSE(\"~~~x\", \"~~~x\")\n\n\tTSE(\"^\", \"^\")\n\tTSE(\"^x\", \"^x\")\n\tTSE(\"^^x\", \"^^x\")\n\tTSE(\"^^^x\", \"^^^x\")\n\n\tTSE(\"G~~x\", \"G~~x\")\n\tTSE(\" G~x\", \"G~x\")\n\tTSE(\"G~^x\", \"G~^x\")\n\n\tTSE(\"?\", \"?\")\n\tTSE(\"?~x\", \"?~x\")\n\tTSE(\" ?x\", \"?x\")\n\tTSE(\"?^x\", \"?^x\")\n\n\/\/ source\n\tTSE(\"x$0\", \"x\")\n\tTSE(\"x$0$0\", \"x\")\n\tTSE(\"x$0$1\", \"x\")\n\tTSE(\"x$0$?\", \"x\")\n\n\tTSE(\"x$1\", \"x$1\")\n\tTSE(\"x$1$0\", \"x$1\")\n\tTSE(\"x$1$?\", \"x$1$?\")\n\tTSE(\"x$1$2\", \"x$1$2\")\n\n\tTSE(\"x$?1\", \"x$?1\")\n\tTSE(\"x$?1$0\", \"x$?1\")\n\tTSE(\"x$?1$?\", \"x$?1$?\")\n\tTSE(\"x$?1$2\", \"x$?1$2\")\n\n\tTSE(\"x$?$?\", \"x$?$?\")\n\n\/\/ integer & decimal\n\tTSE(\" 1\", \"1\")\n\tTSE(\"+1\", \"1\")\n\tTSE(\"-1\", \"-1\")\n\n\tTSE(\"+.1\", \"0.1\")\n\tTSE(\"-.1\", \"-0.1\")\n\n\tTSE(\" 1.1\", \"1.1\")\n\tTSE(\"+1.1\", \"1.1\")\n\tTSE(\"-1.1\", \"-1.1\")\n\n\tTSE(\" 1.1e1\", \"11\")\n\tTSE(\"+1.1e1\", \"11\")\n\tTSE(\"-1.1e1\", \"-11\")\n\n\tTSE(\" 1.1e+1\", \"11\")\n\tTSE(\"+1.1e+1\", \"11\")\n\tTSE(\"-1.1e+1\", \"-11\")\n\n\tTSE(\" 1.1e-1\", \"0.11\")\n\tTSE(\"+1.1e-1\", \"0.11\")\n\tTSE(\"-1.1e-1\", \"-0.11\")\n\n\/\/ units\n\tTSE(\"1a\", \"1a\")\n\tTSE(\"1µg\", \"1µg\")\n\n\/\/ strings\n\tTSE(\"\\\"\\\"\", \"\\\"\\\"\")\n\tTSE(\"\\\"a\\\"\", \"a\")\n\tTSE(\"``````\", \"\\\"\\\"\")\n\tTSE(\"```a```\", \"a\")\n\n\tTSE(\"\\\"\\\\t\\\"\", \"\\\"\\t\\\"\")\n\tTSE(\"\\\"\\\\n\\\"\", \"```\\n```\")\n\n\/\/ names\n\tTF(\"=\")\n\tTF(\"a=\")\n\tTF(\"=,\")\n\tTF(\"=;\")\n\tTF(\"=\\n\")\n\tTSE(\"a=1\", \"a = 1\")\n\tTSE(\"a=b\", \"a = b\")\n\tTSE(\"a = 1\", \"a = 1\")\n\tTSE(\"a = b\", \"a = b\")\n\n\tTSE(\"a=\\\"\\\"\", \"a = \\\"\\\"\")\n\tTSE(\"a=\\\"ab\\\"\", \"a = ab\")\n\tTSE(\"a=\\\"a b\\\"\", \"a = \\\"a b\\\"\")\n\tTF(\"a=\\\"\\n\")\n\n\tTSE(\"a=```ab```\", \"a = ab\")\n\tTSE(\"a=```a b```\", \"a = \\\"a b\\\"\")\n\tTSE(\"a=```a\\nb```\", \"a = ```a\\nb```\")\n\n\/\/ tags\n\tTF(\":\")\n\tTF(\"::\")\n\tTF(\":,\")\n\tTF(\":;\")\n\tTF(\":\\n\")\n\tTF(\":\\\"a\\\"\")\n\tTF(\":```a```\")\n\tTF(\":1\")\n\tTSE(\":x\", \":x\")\n\tTF(\":x:\")\n\tTF(\":x=\")\n\tTF(\"x=:\")\n\tTSE(\"x:y\", \"x:y\")\n\tTSE(\":x:y\", \":x:y\")\n\n\tTSE(\":?x\", \":?x\")\n\tTSE(\":G~x\", \":G~x\")\n\n\tTSE(\":~x\", \":~x\")\n\tTSE(\":~~x\", \":~~x\")\n\tTSE(\":~~~x\", \":~~~x\")\n\n\tTSE(\":^x\", \":^x\")\n\tTSE(\":^^x\", \":^^x\")\n\tTSE(\":^^^x\", \":^^^x\")\n\n\tTSE(\":?~x\", \":?~x\")\n\tTSE(\":?~~x\", \":?~~x\")\n\tTSE(\":?~~~x\", \":?~~~x\")\n\n\tTSE(\":?^x\", \":?^x\")\n\tTSE(\":?^^x\", \":?^^x\")\n\tTSE(\":?^^^x\", \":?^^^x\")\n\n\tTSE(\":G~~x\", \":G~~x\")\n\tTSE(\":G~~~x\", \":G~~~x\")\n\tTSE(\":G~~~~x\", \":G~~~~x\")\n\n\tTSE(\":G~^x\", \":G~^x\")\n\tTSE(\":G~^^x\", \":G~^^x\")\n\tTSE(\":G~^^^x\", \":G~^^^x\")\n\n\tTF(\":x(\")\n\tTSE(\":x()\", \":x\")\n\tTSE(\":x( )\", \":x\")\n\tTSE(\":x(\\t)\", \":x\")\n\tTSE(\":x(\\n)\", \":x\")\n\tTSE(\":x(1)\", \":x(1)\")\n\tTSE(\":x(y)\", \":x(y)\")\n\tTSE(\":x(y,z)\", \":x(y, z)\")\n\tTSE(\":x(y;z)\", \":x(y, z)\")\n\tTSE(\":x(y\\nz)\", \":x(y, z)\")\n\n\/\/ scopes\n\tTF(\"{\")\n\tTF(\"(\")\n\tTF(\"[\")\n\tTSE(\"{}\", \"null\")\n\tTSE(\"{{}}\", \"{\\n\\tnull\\n}\")\n\tTSE(\"x{}\", \"x\")\n\tTSE(\"x[]\", \"x\")\n\tTSE(\"x[1]\", \"x[1]\")\n\tTSE(\"x[y]\", \"x[y]\")\n};\n\nvoid check(Test const& test) {\n\tTOGO_LOGF(\n\t\t\"reading (%3u): <%.*s>\\n\",\n\t\ttest.data.size, test.data.size, test.data.data\n\t);\n\tObject root;\n\tMemoryReader in_stream{test.data};\n\tObjectParserInfo pinfo;\n\tif (object::read_text(root, in_stream, pinfo)) {\n\t\tMemoryStream out_stream{memory::default_allocator(), test.expected_output.size + 1};\n\t\tTOGO_ASSERTE(object::write_text(root, out_stream));\n\t\tStringRef output{\n\t\t\treinterpret_cast<char*>(array::begin(out_stream.data())),\n\t\t\tstatic_cast<unsigned>(out_stream.size())\n\t\t};\n\t\t\/\/ Remove trailing newline\n\t\tif (output.size > 0) {\n\t\t\t--output.size;\n\t\t}\n\t\tTOGO_LOGF(\n\t\t\t\"rewritten (%3u): <%.*s>\\n\",\n\t\t\toutput.size, output.size, output.data\n\t\t);\n\t\tTOGO_ASSERT(test.success, \"read succeeded when it should have failed\");\n\t\tTOGO_ASSERT(\n\t\t\tstring::compare_equal(test.expected_output, output),\n\t\t\t\"output does not match\"\n\t\t);\n\t} else {\n\t\tTOGO_LOGF(\n\t\t\t\"failed to read%s: [%2u,%2u]: %s\\n\",\n\t\t\ttest.success ? \" (UNEXPECTED)\" : \"\",\n\t\t\tpinfo.line,\n\t\t\tpinfo.column,\n\t\t\tpinfo.message\n\t\t);\n\t\tTOGO_ASSERT(!test.success, \"read failed when it should have succeeded\");\n\t}\n\tTOGO_LOG(\"\\n\");\n}\n\nsigned main() {\n\tmemory_init();\n\n\tfor (auto& test : tests) {\n\t\tcheck(test);\n\t}\n\treturn 0;\n}\n<|endoftext|>"} {"text":"<commit_before>\/* Copyright (c) 2010-2012, Revori Contributors\n\n Permission to use, copy, modify, and\/or distribute this software\n for any purpose with or without fee is hereby granted, provided\n that the above copyright notice and this permission notice appear\n in all copies. *\/\n\n#include <stdlib.h>\n#include <stdio.h>\n#include <sys\/types.h>\n#include <sys\/socket.h>\n#include <netdb.h>\n#include <unistd.h>\n\n#include <readline\/readline.h>\n#include <readline\/history.h>\n\nnamespace {\n\nenum Request {\n Execute,\n Complete\n};\n\nenum Response {\n RowSet,\n NewDatabase,\n CopySuccess,\n Success,\n Error\n};\n\nenum RowSetFlag {\n InsertedRow,\n DeletedRow,\n End,\n Item\n};\n\nclass Buffer {\n public:\n Buffer(int capacity):\n array(static_cast<char*>(malloc(capacity))),\n capacity(capacity),\n position(0),\n limit(0)\n { }\n\n ~Buffer() {\n if (array) free(array);\n }\n\n char* array;\n int capacity;\n int position;\n int limit;\n};\n\nclass Context {\n public:\n Context():\n buffer(8 * 1024),\n databaseName(0),\n socket(-1),\n completionCount(-1),\n trouble(false),\n exit(false),\n copying(false)\n { }\n\n ~Context() {\n if (databaseName) {\n free(databaseName);\n }\n }\n\n Buffer buffer;\n char* databaseName;\n int socket;\n int completionCount;\n bool trouble;\n bool exit;\n bool copying;\n};\n\nContext* globalContext = 0;\n\nint\nmin(int a, int b)\n{\n return a > b ? b : a;\n}\n\nint\nconnect(const char* host, int port)\n{\n addrinfo hints;\n memset(&hints, 0, sizeof(addrinfo));\n hints.ai_family = AF_INET;\n hints.ai_socktype = SOCK_STREAM;\n\n addrinfo* result;\n int r = getaddrinfo(host, 0, &hints, &result);\n if (r != 0) {\n fprintf(stderr, \"unable to resolve host %s: %s\\n\", host, gai_strerror(r));\n return -1;\n }\n\n sockaddr_in address;\n memset(&address, 0, sizeof(sockaddr_in));\n address.sin_family = AF_INET;\n address.sin_port = htons(port);\n address.sin_addr = reinterpret_cast<sockaddr_in*>(result->ai_addr)->sin_addr;\n\n freeaddrinfo(result);\n\n int socket = ::socket(AF_INET, SOCK_STREAM, IPPROTO_TCP);\n if (socket < 0) {\n perror(\"unable to open socket\");\n return -1;\n }\n\n r = connect(socket, reinterpret_cast<sockaddr*>(&address),\n sizeof(sockaddr_in));\n if (r != 0) {\n perror(\"unable to connect\");\n return -1;\n }\n\n return socket;\n}\n\nbool\nflush(Context* context)\n{\n int r = write\n (context->socket, context->buffer.array, context->buffer.position);\n if (r != context->buffer.position) {\n perror(\"\\nunable to write\");\n context->trouble = true;\n return false;\n }\n context->buffer.position = 0;\n return true;\n}\n\nint\nwriteBytes(Context* context, const char* src, int count)\n{\n int total = 0;\n while (total < count) {\n if (context->buffer.limit == context->buffer.position) {\n if (not flush(context)) {\n return -1;\n }\n }\n\n int c = min\n (count - total, context->buffer.limit - context->buffer.position);\n memcpy(context->buffer.array + context->buffer.position, src + total, c);\n context->buffer.position += c;\n total += c;\n }\n return total;\n}\n\nbool\nwriteByte(Context* context, int v)\n{\n char src[] = { static_cast<char>(v) };\n return writeBytes(context, src, 1) == 1;\n}\n\nbool\nwriteInteger(Context* context, int v)\n{\n char src[] = { static_cast<char>((v >> 24) & 0xFF),\n static_cast<char>((v >> 16) & 0xFF),\n static_cast<char>((v >> 8) & 0xFF),\n static_cast<char>((v ) & 0xFF) };\n return writeBytes(context, src, 4) == 4;\n}\n\nbool\nwriteString(Context* context, const char* s, int length)\n{\n if (writeInteger(context, length)) {\n return writeBytes(context, s, length) == length;\n } else {\n return false;\n }\n}\n\nint\nreadBytes(Context* context, char* dst, int count)\n{\n int total = 0;\n while (total < count) {\n if (context->buffer.limit == context->buffer.position) {\n context->buffer.position = 0;\n int r = read\n (context->socket, context->buffer.array, context->buffer.capacity);\n if (r == 0) {\n fprintf(stderr, \"\\nunexpected end of stream from server\\n\");\n context->trouble = true;\n context->buffer.limit = 0;\n return -1;\n } else if (r < 0) {\n perror(\"\\nunable to read\");\n context->trouble = true;\n context->buffer.limit = 0;\n return -1;\n }\n context->buffer.limit = r;\n }\n\n int c = min\n (count - total, context->buffer.limit - context->buffer.position);\n memcpy(dst + total, context->buffer.array + context->buffer.position, c);\n context->buffer.position += c;\n total += c;\n }\n return total;\n}\n\nint\nreadByte(Context* context)\n{\n char dst[1];\n int r = readBytes(context, dst, 1);\n return r < 1 ? -1 : dst[0];\n}\n\nint\nreadInteger(Context* context)\n{\n char dst[4];\n int r = readBytes(context, dst, 4);\n return r < 4 ? -1 : (((dst[0] & 0xFF) << 24) |\n ((dst[1] & 0xFF) << 16) |\n ((dst[2] & 0xFF) << 8) |\n ((dst[3] & 0xFF) ));\n}\n\nchar*\nreadString(Context* context)\n{\n int length = readInteger(context);\n if (length < 0) {\n return 0;\n }\n\n char* string = static_cast<char*>(malloc(length + 1));\n if (string == 0) {\n fprintf(stderr, \"\\nunable to allocate memory\\n\");\n context->trouble = true;\n return 0;\n }\n\n int count = readBytes(context, string, length);\n if (count != length) {\n free(string);\n return 0;\n }\n\n string[length] = 0;\n\n return string;\n}\n\nint\nstartCompletion(Context* context, const char* text)\n{\n context->buffer.position = 0;\n context->buffer.limit = context->buffer.capacity;\n\n if (not writeByte(context, Complete)) {\n return -1;\n }\n\n if (not writeString(context, text, strlen(text))) {\n return -1;\n }\n\n if (not flush(context)) {\n return -1;\n }\n\n context->buffer.limit = 0;\n\n int result = readByte(context);\n switch (result) {\n case -1:\n break;\n\n case Success: {\n return readInteger(context);\n } break;\n\n case Error: {\n char* message = readString(context);\n if (message == 0) {\n return -1;\n }\n \n free(message);\n } break;\n\n default:\n fprintf(stderr, \"\\nunexpected result from server: %d\\n\", result);\n context->trouble = true;\n break;\n }\n\n return -1;\n}\n\nchar*\ncompletionGenerator(const char*, int state)\n{\n Context* context = globalContext;\n\n if (context->trouble) {\n return 0;\n }\n\n if (state == 0) {\n context->completionCount = startCompletion(context, rl_line_buffer);\n }\n \n if (context->completionCount <= 0) {\n return 0;\n } else {\n -- context->completionCount;\n\n return readString(context);\n }\n}\n\nchar*\nremoveEdgeWhitespace(char* s)\n{\n while (isspace(*s)) ++s;\n\n if (*s == 0) return s;\n\n char* p = s;\n char* lastNonSpace = p;\n while (*p) {\n if (not isspace(*p)) {\n lastNonSpace = p;\n }\n ++ p;\n }\n\n lastNonSpace[1] = 0;\n\n return s;\n}\n\nvoid\nexecute(Context* context, const char* command)\n{\n if (strcmp(command, \"exit\") == 0\n || strcmp(command, \"quit\") == 0)\n {\n context->exit = true;\n return;\n }\n\n if (context->trouble) {\n return;\n }\n\n if (not context->copying) {\n context->buffer.position = 0;\n context->buffer.limit = context->buffer.capacity;\n }\n\n if (not writeByte(context, Execute)) {\n return;\n }\n\n if (not writeString(context, command, strlen(command))) {\n return;\n }\n\n if (context->copying && strcmp(command, \"\\\\.\") == 0) {\n if (not flush(context)) {\n return;\n }\n context->copying = false;\n }\n\n if (context->copying) {\n return;\n }\n\n if (not flush(context)) {\n return;\n }\n\n context->buffer.limit = 0;\n\n int result = readByte(context);\n switch (result) {\n case -1:\n break;\n\n case NewDatabase: {\n if (context->databaseName) {\n free(context->databaseName);\n }\n\n context->databaseName = readString(context);\n if (context->databaseName == 0) {\n return;\n }\n\n char* message = readString(context);\n if (message == 0) {\n return;\n }\n\n fprintf(stdout, \"%s\\n\", message);\n \n free(message);\n } break;\n\n case CopySuccess: {\n char* message = readString(context);\n if (message == 0) {\n return;\n }\n\n fprintf(stdout, \"%s\\n\", message);\n \n free(message);\n\n context->buffer.position = 0;\n context->buffer.limit = context->buffer.capacity;\n\n context->copying = true;\n } break;\n\n case Success: {\n char* message = readString(context);\n if (message == 0) {\n return;\n }\n\n fprintf(stdout, \"%s\\n\", message);\n \n free(message);\n } break;\n\n case RowSet: {\n bool done = false;\n bool sawRow = false;\n while (not done) {\n int flag = readByte(context);\n switch (flag) {\n case -1:\n return;\n\n case InsertedRow:\n sawRow = true;\n fprintf(stdout, \"\\n inserted:\");\n break;\n\n case DeletedRow:\n sawRow = true;\n fprintf(stdout, \"\\n deleted:\");\n break;\n\n case Item: {\n char* item = readString(context);\n if (item == 0) {\n return;\n }\n \n fprintf(stdout, \" %s\", item);\n\n free(item);\n } break;\n\n case End:\n if (not sawRow) {\n fprintf(stdout, \"\\n no matching rows found\");\n }\n done = true;\n fprintf(stdout, \"\\n\");\n break;\n\n default:\n fprintf(stderr, \"\\nunexpected flag from server: %d\\n\", flag);\n context->trouble = true;\n return;\n }\n }\n } break;\n\n case Error: {\n char* message = readString(context);\n if (message == 0) {\n return;\n }\n\n fprintf(stderr, \"error: %s\\n\", message);\n \n free(message);\n } break;\n\n default:\n fprintf(stderr, \"\\nunexpected result from server: %d\\n\", result);\n context->trouble = true;\n break;\n }\n}\n\nvoid\nusage(const char* name)\n{\n fprintf(stderr, \"usage: %s [--batch] <hostname> <port> [<database>]\\n\",\n name); \n}\n\n} \/\/ namespace\n\nint\nmain(int argumentCount, const char** arguments)\n{\n bool interactive = true;\n const char* hostname = 0;\n int port = -1;\n const char* database = 0;\n for (int i = 1; i < argumentCount; ++i) {\n if (strcmp(\"--batch\", arguments[i]) == 0) {\n interactive = false;\n } else if (hostname == 0) {\n hostname = arguments[i];\n } else if (port == -1) {\n port = atoi(arguments[i]);\n } else if (database == 0) {\n database = arguments[i];\n } else {\n usage(arguments[0]);\n return -1;\n }\n }\n\n if (hostname == 0 or port == -1) {\n usage(arguments[0]);\n return -1;\n }\n\n Context context;\n globalContext = &context;\n\n if (context.buffer.array == 0) {\n fprintf(stderr, \"\\nunable to allocate memory\\n\");\n return -1;\n }\n\n context.socket = connect(hostname, port);\n if (context.socket < 0) {\n return -1;\n }\n\n if (database) {\n const int BufferSize = 256;\n char buffer[BufferSize];\n snprintf(buffer, BufferSize, \"use database %s\", database);\n execute(&context, buffer);\n\n if (context.trouble) {\n return -1;\n }\n }\n\n if (interactive) {\n fprintf(stdout, \"\\nWelcome to the DBMS SQL client interface. \"\n \"Type \\\"help\\\" to get started.\\n\");\n\n rl_readline_name = \"DBMSClient\";\n\n rl_completion_entry_function = completionGenerator;\n\n while (not (context.trouble or context.exit)) {\n char* line;\n if (context.databaseName) {\n int length = strlen(context.databaseName) + 4;\n char* prompt = static_cast<char*>(malloc(length));\n if (prompt == 0) {\n fprintf(stderr, \"\\nunable to allocate memory\\n\");\n return -1;\n }\n\n snprintf(prompt, length, \"%s > \", context.databaseName);\n line = readline(prompt);\n free(prompt);\n } else {\n line = readline(\"> \");\n }\n\n if (line == 0) {\n fprintf(stdout, \"\\n\");\n break;\n }\n\n if (context.copying) {\n execute(&context, line);\n } else {\n char* s = removeEdgeWhitespace(line);\n if (*s) {\n add_history(s);\n\n execute(&context, s);\n fprintf(stdout, \"\\n\");\n }\n }\n\n free(line);\n }\n } else {\n const int BufferSize = 8096;\n char buffer[BufferSize];\n int i = 0;\n\n while (true) {\n int c = fgetc(stdin);\n switch (c) {\n case EOF:\n return 0;\n\n case '\\n':\n buffer[i] = 0;\n execute(&context, buffer);\n i = 0;\n break;\n\n default:\n if (i < BufferSize - 1) {\n buffer[i++] = c;\n } else {\n fprintf(stderr, \"buffer overflow\\n\");\n return -1;\n }\n break;\n }\n }\n }\n\n close(context.socket);\n\n return context.trouble ? -1 : 0;\n}\n<commit_msg>rename DBMS -> Revori in client<commit_after>\/* Copyright (c) 2010-2012, Revori Contributors\n\n Permission to use, copy, modify, and\/or distribute this software\n for any purpose with or without fee is hereby granted, provided\n that the above copyright notice and this permission notice appear\n in all copies. *\/\n\n#include <stdlib.h>\n#include <stdio.h>\n#include <sys\/types.h>\n#include <sys\/socket.h>\n#include <netdb.h>\n#include <unistd.h>\n\n#include <readline\/readline.h>\n#include <readline\/history.h>\n\nnamespace {\n\nenum Request {\n Execute,\n Complete\n};\n\nenum Response {\n RowSet,\n NewDatabase,\n CopySuccess,\n Success,\n Error\n};\n\nenum RowSetFlag {\n InsertedRow,\n DeletedRow,\n End,\n Item\n};\n\nclass Buffer {\n public:\n Buffer(int capacity):\n array(static_cast<char*>(malloc(capacity))),\n capacity(capacity),\n position(0),\n limit(0)\n { }\n\n ~Buffer() {\n if (array) free(array);\n }\n\n char* array;\n int capacity;\n int position;\n int limit;\n};\n\nclass Context {\n public:\n Context():\n buffer(8 * 1024),\n databaseName(0),\n socket(-1),\n completionCount(-1),\n trouble(false),\n exit(false),\n copying(false)\n { }\n\n ~Context() {\n if (databaseName) {\n free(databaseName);\n }\n }\n\n Buffer buffer;\n char* databaseName;\n int socket;\n int completionCount;\n bool trouble;\n bool exit;\n bool copying;\n};\n\nContext* globalContext = 0;\n\nint\nmin(int a, int b)\n{\n return a > b ? b : a;\n}\n\nint\nconnect(const char* host, int port)\n{\n addrinfo hints;\n memset(&hints, 0, sizeof(addrinfo));\n hints.ai_family = AF_INET;\n hints.ai_socktype = SOCK_STREAM;\n\n addrinfo* result;\n int r = getaddrinfo(host, 0, &hints, &result);\n if (r != 0) {\n fprintf(stderr, \"unable to resolve host %s: %s\\n\", host, gai_strerror(r));\n return -1;\n }\n\n sockaddr_in address;\n memset(&address, 0, sizeof(sockaddr_in));\n address.sin_family = AF_INET;\n address.sin_port = htons(port);\n address.sin_addr = reinterpret_cast<sockaddr_in*>(result->ai_addr)->sin_addr;\n\n freeaddrinfo(result);\n\n int socket = ::socket(AF_INET, SOCK_STREAM, IPPROTO_TCP);\n if (socket < 0) {\n perror(\"unable to open socket\");\n return -1;\n }\n\n r = connect(socket, reinterpret_cast<sockaddr*>(&address),\n sizeof(sockaddr_in));\n if (r != 0) {\n perror(\"unable to connect\");\n return -1;\n }\n\n return socket;\n}\n\nbool\nflush(Context* context)\n{\n int r = write\n (context->socket, context->buffer.array, context->buffer.position);\n if (r != context->buffer.position) {\n perror(\"\\nunable to write\");\n context->trouble = true;\n return false;\n }\n context->buffer.position = 0;\n return true;\n}\n\nint\nwriteBytes(Context* context, const char* src, int count)\n{\n int total = 0;\n while (total < count) {\n if (context->buffer.limit == context->buffer.position) {\n if (not flush(context)) {\n return -1;\n }\n }\n\n int c = min\n (count - total, context->buffer.limit - context->buffer.position);\n memcpy(context->buffer.array + context->buffer.position, src + total, c);\n context->buffer.position += c;\n total += c;\n }\n return total;\n}\n\nbool\nwriteByte(Context* context, int v)\n{\n char src[] = { static_cast<char>(v) };\n return writeBytes(context, src, 1) == 1;\n}\n\nbool\nwriteInteger(Context* context, int v)\n{\n char src[] = { static_cast<char>((v >> 24) & 0xFF),\n static_cast<char>((v >> 16) & 0xFF),\n static_cast<char>((v >> 8) & 0xFF),\n static_cast<char>((v ) & 0xFF) };\n return writeBytes(context, src, 4) == 4;\n}\n\nbool\nwriteString(Context* context, const char* s, int length)\n{\n if (writeInteger(context, length)) {\n return writeBytes(context, s, length) == length;\n } else {\n return false;\n }\n}\n\nint\nreadBytes(Context* context, char* dst, int count)\n{\n int total = 0;\n while (total < count) {\n if (context->buffer.limit == context->buffer.position) {\n context->buffer.position = 0;\n int r = read\n (context->socket, context->buffer.array, context->buffer.capacity);\n if (r == 0) {\n fprintf(stderr, \"\\nunexpected end of stream from server\\n\");\n context->trouble = true;\n context->buffer.limit = 0;\n return -1;\n } else if (r < 0) {\n perror(\"\\nunable to read\");\n context->trouble = true;\n context->buffer.limit = 0;\n return -1;\n }\n context->buffer.limit = r;\n }\n\n int c = min\n (count - total, context->buffer.limit - context->buffer.position);\n memcpy(dst + total, context->buffer.array + context->buffer.position, c);\n context->buffer.position += c;\n total += c;\n }\n return total;\n}\n\nint\nreadByte(Context* context)\n{\n char dst[1];\n int r = readBytes(context, dst, 1);\n return r < 1 ? -1 : dst[0];\n}\n\nint\nreadInteger(Context* context)\n{\n char dst[4];\n int r = readBytes(context, dst, 4);\n return r < 4 ? -1 : (((dst[0] & 0xFF) << 24) |\n ((dst[1] & 0xFF) << 16) |\n ((dst[2] & 0xFF) << 8) |\n ((dst[3] & 0xFF) ));\n}\n\nchar*\nreadString(Context* context)\n{\n int length = readInteger(context);\n if (length < 0) {\n return 0;\n }\n\n char* string = static_cast<char*>(malloc(length + 1));\n if (string == 0) {\n fprintf(stderr, \"\\nunable to allocate memory\\n\");\n context->trouble = true;\n return 0;\n }\n\n int count = readBytes(context, string, length);\n if (count != length) {\n free(string);\n return 0;\n }\n\n string[length] = 0;\n\n return string;\n}\n\nint\nstartCompletion(Context* context, const char* text)\n{\n context->buffer.position = 0;\n context->buffer.limit = context->buffer.capacity;\n\n if (not writeByte(context, Complete)) {\n return -1;\n }\n\n if (not writeString(context, text, strlen(text))) {\n return -1;\n }\n\n if (not flush(context)) {\n return -1;\n }\n\n context->buffer.limit = 0;\n\n int result = readByte(context);\n switch (result) {\n case -1:\n break;\n\n case Success: {\n return readInteger(context);\n } break;\n\n case Error: {\n char* message = readString(context);\n if (message == 0) {\n return -1;\n }\n \n free(message);\n } break;\n\n default:\n fprintf(stderr, \"\\nunexpected result from server: %d\\n\", result);\n context->trouble = true;\n break;\n }\n\n return -1;\n}\n\nchar*\ncompletionGenerator(const char*, int state)\n{\n Context* context = globalContext;\n\n if (context->trouble) {\n return 0;\n }\n\n if (state == 0) {\n context->completionCount = startCompletion(context, rl_line_buffer);\n }\n \n if (context->completionCount <= 0) {\n return 0;\n } else {\n -- context->completionCount;\n\n return readString(context);\n }\n}\n\nchar*\nremoveEdgeWhitespace(char* s)\n{\n while (isspace(*s)) ++s;\n\n if (*s == 0) return s;\n\n char* p = s;\n char* lastNonSpace = p;\n while (*p) {\n if (not isspace(*p)) {\n lastNonSpace = p;\n }\n ++ p;\n }\n\n lastNonSpace[1] = 0;\n\n return s;\n}\n\nvoid\nexecute(Context* context, const char* command)\n{\n if (strcmp(command, \"exit\") == 0\n || strcmp(command, \"quit\") == 0)\n {\n context->exit = true;\n return;\n }\n\n if (context->trouble) {\n return;\n }\n\n if (not context->copying) {\n context->buffer.position = 0;\n context->buffer.limit = context->buffer.capacity;\n }\n\n if (not writeByte(context, Execute)) {\n return;\n }\n\n if (not writeString(context, command, strlen(command))) {\n return;\n }\n\n if (context->copying && strcmp(command, \"\\\\.\") == 0) {\n if (not flush(context)) {\n return;\n }\n context->copying = false;\n }\n\n if (context->copying) {\n return;\n }\n\n if (not flush(context)) {\n return;\n }\n\n context->buffer.limit = 0;\n\n int result = readByte(context);\n switch (result) {\n case -1:\n break;\n\n case NewDatabase: {\n if (context->databaseName) {\n free(context->databaseName);\n }\n\n context->databaseName = readString(context);\n if (context->databaseName == 0) {\n return;\n }\n\n char* message = readString(context);\n if (message == 0) {\n return;\n }\n\n fprintf(stdout, \"%s\\n\", message);\n \n free(message);\n } break;\n\n case CopySuccess: {\n char* message = readString(context);\n if (message == 0) {\n return;\n }\n\n fprintf(stdout, \"%s\\n\", message);\n \n free(message);\n\n context->buffer.position = 0;\n context->buffer.limit = context->buffer.capacity;\n\n context->copying = true;\n } break;\n\n case Success: {\n char* message = readString(context);\n if (message == 0) {\n return;\n }\n\n fprintf(stdout, \"%s\\n\", message);\n \n free(message);\n } break;\n\n case RowSet: {\n bool done = false;\n bool sawRow = false;\n while (not done) {\n int flag = readByte(context);\n switch (flag) {\n case -1:\n return;\n\n case InsertedRow:\n sawRow = true;\n fprintf(stdout, \"\\n inserted:\");\n break;\n\n case DeletedRow:\n sawRow = true;\n fprintf(stdout, \"\\n deleted:\");\n break;\n\n case Item: {\n char* item = readString(context);\n if (item == 0) {\n return;\n }\n \n fprintf(stdout, \" %s\", item);\n\n free(item);\n } break;\n\n case End:\n if (not sawRow) {\n fprintf(stdout, \"\\n no matching rows found\");\n }\n done = true;\n fprintf(stdout, \"\\n\");\n break;\n\n default:\n fprintf(stderr, \"\\nunexpected flag from server: %d\\n\", flag);\n context->trouble = true;\n return;\n }\n }\n } break;\n\n case Error: {\n char* message = readString(context);\n if (message == 0) {\n return;\n }\n\n fprintf(stderr, \"error: %s\\n\", message);\n \n free(message);\n } break;\n\n default:\n fprintf(stderr, \"\\nunexpected result from server: %d\\n\", result);\n context->trouble = true;\n break;\n }\n}\n\nvoid\nusage(const char* name)\n{\n fprintf(stderr, \"usage: %s [--batch] <hostname> <port> [<database>]\\n\",\n name); \n}\n\n} \/\/ namespace\n\nint\nmain(int argumentCount, const char** arguments)\n{\n bool interactive = true;\n const char* hostname = 0;\n int port = -1;\n const char* database = 0;\n for (int i = 1; i < argumentCount; ++i) {\n if (strcmp(\"--batch\", arguments[i]) == 0) {\n interactive = false;\n } else if (hostname == 0) {\n hostname = arguments[i];\n } else if (port == -1) {\n port = atoi(arguments[i]);\n } else if (database == 0) {\n database = arguments[i];\n } else {\n usage(arguments[0]);\n return -1;\n }\n }\n\n if (hostname == 0 or port == -1) {\n usage(arguments[0]);\n return -1;\n }\n\n Context context;\n globalContext = &context;\n\n if (context.buffer.array == 0) {\n fprintf(stderr, \"\\nunable to allocate memory\\n\");\n return -1;\n }\n\n context.socket = connect(hostname, port);\n if (context.socket < 0) {\n return -1;\n }\n\n if (database) {\n const int BufferSize = 256;\n char buffer[BufferSize];\n snprintf(buffer, BufferSize, \"use database %s\", database);\n execute(&context, buffer);\n\n if (context.trouble) {\n return -1;\n }\n }\n\n if (interactive) {\n fprintf(stdout, \"\\nWelcome to the Revori SQL client interface. \"\n \"Type \\\"help\\\" to get started.\\n\");\n\n rl_readline_name = \"RevoriClient\";\n\n rl_completion_entry_function = completionGenerator;\n\n while (not (context.trouble or context.exit)) {\n char* line;\n if (context.databaseName) {\n int length = strlen(context.databaseName) + 4;\n char* prompt = static_cast<char*>(malloc(length));\n if (prompt == 0) {\n fprintf(stderr, \"\\nunable to allocate memory\\n\");\n return -1;\n }\n\n snprintf(prompt, length, \"%s > \", context.databaseName);\n line = readline(prompt);\n free(prompt);\n } else {\n line = readline(\"> \");\n }\n\n if (line == 0) {\n fprintf(stdout, \"\\n\");\n break;\n }\n\n if (context.copying) {\n execute(&context, line);\n } else {\n char* s = removeEdgeWhitespace(line);\n if (*s) {\n add_history(s);\n\n execute(&context, s);\n fprintf(stdout, \"\\n\");\n }\n }\n\n free(line);\n }\n } else {\n const int BufferSize = 8096;\n char buffer[BufferSize];\n int i = 0;\n\n while (true) {\n int c = fgetc(stdin);\n switch (c) {\n case EOF:\n return 0;\n\n case '\\n':\n buffer[i] = 0;\n execute(&context, buffer);\n i = 0;\n break;\n\n default:\n if (i < BufferSize - 1) {\n buffer[i++] = c;\n } else {\n fprintf(stderr, \"buffer overflow\\n\");\n return -1;\n }\n break;\n }\n }\n }\n\n close(context.socket);\n\n return context.trouble ? -1 : 0;\n}\n<|endoftext|>"} {"text":"<commit_before>#include <utils.h>\n#include \"command.h\"\n#include \"..\/CommandHandler.h\"\n#include \"..\/OptionParser.h\"\n\n\/* full name of the command *\/\nCMDNAME(\"xp\");\n\/* description of the command *\/\nCMDDESCR(\"query experience information\");\n\/* command usage synopsis *\/\nCMDUSAGE(\"$xp [-i] NUM\");\n\n#define MAX_XP 0xBEBC200\n\nstatic std::string xptolvl(int x);\nstatic std::string lvltoxp(int x);\n\n\/* xp: query experience information *\/\nstd::string CommandHandler::xp(struct cmdinfo *c)\n{\n\tbool inv;\n\tint x;\n\tstd::string lvl;\n\n\tint opt;\n\tOptionParser op(c->fullCmd, \"i\");\n\tstatic struct OptionParser::option long_opts[] = {\n\t\t{ \"help\", NO_ARG, 'h' },\n\t\t{ \"inverse\", NO_ARG, 'i' },\n\t\t{ 0, 0, 0 }\n\t};\n\n\tinv = false;\n\twhile ((opt = op.getopt_long(long_opts)) != EOF) {\n\t\tswitch (opt) {\n\t\tcase 'h':\n\t\t\treturn HELPMSG(CMDNAME, CMDUSAGE, CMDDESCR);\n\t\tcase 'i':\n\t\t\tinv = true;\n\t\t\tbreak;\n\t\tcase '?':\n\t\t\treturn std::string(op.opterr());\n\t\tdefault:\n\t\t\treturn \"\";\n\t\t}\n\t}\n\n\tif (op.optind() == c->fullCmd.length()\n\t\t\t|| (lvl = c->fullCmd.substr(op.optind())).find(' ')\n\t\t\t!= std::string::npos)\n\t\treturn USAGEMSG(CMDNAME, CMDUSAGE);\n\n\ttry {\n\t\tif ((x = std::stoi(lvl)) < 0)\n\t\t\treturn CMDNAME + \": number cannot be negative\";\n\t} catch (std::invalid_argument) {\n\t\t\treturn CMDNAME + \": invalid number -- '\" + lvl + \"'\";\n\t} catch (std::out_of_range) {\n\t\t\treturn CMDNAME + \": number too large\";\n\t}\n\n\n\tif (inv) {\n\t\tif (x > MAX_XP)\n\t\t\treturn CMDNAME + \": xp cannot exceed 200m\";\n\t\treturn \"[XP] \" + utils::formatInteger(std::to_string(x))\n\t\t\t+ \" xp: level \" + xptolvl(x);\n\t}\n\n\tif (x < 1 || x > 126)\n\t\treturn CMDNAME + \": level must be between 1-126\";\n\treturn \"[XP] level \" + std::to_string(x) + \": \" + lvltoxp(x) + \" xp\";\n}\n\n\/* xptolvl: calculate the level at x xp *\/\nstatic std::string xptolvl(int x)\n{\n\tint n;\n\n\tn = 1;\n\tx *= 4;\n\tx += 1;\n\twhile (x >= 0) {\n\t\tx -= floor(n + 300 * pow(2, n \/ 7.0));\n\t\t++n;\n\t}\n\n\treturn std::to_string(n - 1);\n}\n\n\/* lvltoxp: return xp required for level x *\/\nstatic std::string lvltoxp(int x)\n{\n\tint n, res;\n\n\tres = 0;\n\tfor (n = 1; n < x; ++n)\n\t\tres += floor(n + 300 * pow(2, n \/ 7.0));\n\tres = floor(0.25 * res);\n\n\treturn utils::formatInteger(std::to_string(res));\n}\n<commit_msg>Fix indentation<commit_after>#include <utils.h>\n#include \"command.h\"\n#include \"..\/CommandHandler.h\"\n#include \"..\/OptionParser.h\"\n\n\/* full name of the command *\/\nCMDNAME(\"xp\");\n\/* description of the command *\/\nCMDDESCR(\"query experience information\");\n\/* command usage synopsis *\/\nCMDUSAGE(\"$xp [-i] NUM\");\n\n#define MAX_XP 0xBEBC200\n\nstatic std::string xptolvl(int x);\nstatic std::string lvltoxp(int x);\n\n\/* xp: query experience information *\/\nstd::string CommandHandler::xp(struct cmdinfo *c)\n{\n\tbool inv;\n\tint x;\n\tstd::string lvl;\n\n\tint opt;\n\tOptionParser op(c->fullCmd, \"i\");\n\tstatic struct OptionParser::option long_opts[] = {\n\t\t{ \"help\", NO_ARG, 'h' },\n\t\t{ \"inverse\", NO_ARG, 'i' },\n\t\t{ 0, 0, 0 }\n\t};\n\n\tinv = false;\n\twhile ((opt = op.getopt_long(long_opts)) != EOF) {\n\t\tswitch (opt) {\n\t\tcase 'h':\n\t\t\treturn HELPMSG(CMDNAME, CMDUSAGE, CMDDESCR);\n\t\tcase 'i':\n\t\t\tinv = true;\n\t\t\tbreak;\n\t\tcase '?':\n\t\t\treturn std::string(op.opterr());\n\t\tdefault:\n\t\t\treturn \"\";\n\t\t}\n\t}\n\n\tif (op.optind() == c->fullCmd.length()\n\t\t\t|| (lvl = c->fullCmd.substr(op.optind())).find(' ')\n\t\t\t!= std::string::npos)\n\t\treturn USAGEMSG(CMDNAME, CMDUSAGE);\n\n\ttry {\n\t\tif ((x = std::stoi(lvl)) < 0)\n\t\t\treturn CMDNAME + \": number cannot be negative\";\n\t} catch (std::invalid_argument) {\n\t\treturn CMDNAME + \": invalid number -- '\" + lvl + \"'\";\n\t} catch (std::out_of_range) {\n\t\treturn CMDNAME + \": number too large\";\n\t}\n\n\n\tif (inv) {\n\t\tif (x > MAX_XP)\n\t\t\treturn CMDNAME + \": xp cannot exceed 200m\";\n\t\treturn \"[XP] \" + utils::formatInteger(std::to_string(x))\n\t\t\t+ \" xp: level \" + xptolvl(x);\n\t}\n\n\tif (x < 1 || x > 126)\n\t\treturn CMDNAME + \": level must be between 1-126\";\n\treturn \"[XP] level \" + std::to_string(x) + \": \" + lvltoxp(x) + \" xp\";\n}\n\n\/* xptolvl: calculate the level at x xp *\/\nstatic std::string xptolvl(int x)\n{\n\tint n;\n\n\tn = 1;\n\tx *= 4;\n\tx += 1;\n\twhile (x >= 0) {\n\t\tx -= floor(n + 300 * pow(2, n \/ 7.0));\n\t\t++n;\n\t}\n\n\treturn std::to_string(n - 1);\n}\n\n\/* lvltoxp: return xp required for level x *\/\nstatic std::string lvltoxp(int x)\n{\n\tint n, res;\n\n\tres = 0;\n\tfor (n = 1; n < x; ++n)\n\t\tres += floor(n + 300 * pow(2, n \/ 7.0));\n\tres = floor(0.25 * res);\n\n\treturn utils::formatInteger(std::to_string(res));\n}\n<|endoftext|>"} {"text":"<commit_before>\/*\n * Copyright (c) 2005, Peter Sommerlad and IFS Institute for Software at HSR Rapperswil, Switzerland\n * All rights reserved.\n *\n * This library\/application is free software; you can redistribute and\/or modify it under the terms of\n * the license that is included with this library\/application in the file license.txt.\n *\/\n\n\/\/--- interface include --------------------------------------------------------\n#include \"RequestProcessor.h\"\n\n\/\/--- standard modules used ----------------------------------------------------\n#include \"Socket.h\"\n#include \"StringStream.h\"\n#include \"Registry.h\"\n#include \"Server.h\"\n#include \"ServerUtils.h\"\n#include \"SystemLog.h\"\n#include \"Dbg.h\"\n\/\/ #include \"System.h\"\n\n\/\/--- c-library modules used ---------------------------------------------------\n\n\/\/--- RequestProcessor ----------------------------------------------------------\nRegCacheImpl(RequestProcessor);\t\/\/ FindRequestProcessor()\nRegisterRequestProcessor(RequestProcessor);\n\nRequestProcessor::RequestProcessor(const char *processorName)\n\t: RegisterableObject(processorName)\n\t, fServer(0), fErrors()\n{\n\tStartTrace(RequestProcessor.RequestProcessor);\n}\n\nvoid RequestProcessor::Init(Server *server)\n{\n\tStartTrace(RequestProcessor.Init);\n\tfServer = server;\n}\n\nvoid RequestProcessor::ProcessRequest(Context &ctx)\n{\n\tStartTrace(RequestProcessor.ProcessRequest);\n\tctx.SetServer(fServer);\n\tSocket *socket = ctx.GetSocket();\n\tiostream *Ios = 0;\n\n\tif ( socket != (Socket *) NULL ) {\n\t\tROAnything timeout;\n\t\tfServer->Lookup(\"SocketReadTimeout\", timeout);\n\t\tsocket->SetTimeout(timeout.AsLong(10 * 1000L));\n\t\tTraceAny(socket->ClientInfo(), \"socket client info\");\n\t\tIos = socket->GetStream();\n\t}\n\n\tif ( Ios && socket->IsReadyForReading() ) {\n\t\t\/\/ disable nagle algorithm\n\t\tsocket->SetNoDelay();\n\t\tDoReadInput(*Ios, ctx);\n\n\t\tKeepConnectionAlive(ctx);\n\n\t\tif ( !(*Ios) ) {\n\t\t\treturn;\n\t\t}\n\n\t\tif (socket->IsReadyForWriting()) {\n\t\t\t\/\/ process this arguments and\n\t\t\t\/\/ write the output to the reply\n\t\t\tDoProcessRequest(*Ios, ctx);\n\t\t\t\/\/FIXME: BufferReply mechanism possible\n\t\t}\n\t} else {\n\t\tString logMsg(\"No valid stream from socket: \");\n\t\tlogMsg << ((socket) ? socket->GetFd() : -1L);\n\t\tif ( socket ) {\n\t\t\tlogMsg << \" (\" << socket->ClientInfo()[\"REMOTE_ADDR\"].AsString() << ':' << socket->ClientInfo()[\"REMOTE_PORT\"].AsString() << ')';\n\t\t}\n\t\tSystemLog::Warning(logMsg);\n\t}\n}\n\nRequestProcessor *RequestProcessor::GetCurrentRequestProcessor(Context &ctx)\n{\n\tString requestProcessor(ctx.Lookup(\"RequestProcessor\", \"RequestProcessor\"));\n\treturn RequestProcessor::FindRequestProcessor(requestProcessor);\n}\n\nvoid RequestProcessor::ForceConnectionClose(Context &ctx)\n{\n\tctx.GetTmpStore()[\"Keep-Alive\"] = 0L;\n}\n\nbool RequestProcessor::KeepConnectionAlive(Context &ctx)\n{\n\tbool retVal = false;\n\tStatTrace(RequestProcessor.KeepConnectionAlive, \"PersistentConnections:\" << (ctx.Lookup(\"PersistentConnections\").AsBool(false) ? \"true\" : \"false\"), Storage::Current());\n\tif ( ctx.Lookup(\"PersistentConnections\").AsBool(false) ) {\n\t\t\/\/ first check if we already know the result\n\t\tROAnything lookupAny;\n\t\tif (ctx.Lookup(\"Keep-Alive\", lookupAny) && !lookupAny.IsNull() ) {\n\t\t\tretVal = lookupAny.AsBool();\n\t\t} else {\n\t\t\t\/\/ let the current RequestProcessor decide\n\t\t\tretVal = GetCurrentRequestProcessor(ctx)->DoKeepConnectionAlive(ctx);\n\t\t\tctx.GetTmpStore()[\"Keep-Alive\"] = retVal;\n\t\t}\n\t}\n\tStatTrace(RequestProcessor.KeepConnectionAlive, \"Keep-Alive:\" << (retVal ? \"true\" : \"false\"), Storage::Current());\n\treturn retVal;\n}\n\nbool RequestProcessor::DoKeepConnectionAlive(Context &ctx)\n{\n\t\/\/ default is to close connection after request\n\treturn false;\n}\n\nvoid RequestProcessor::RenderProtocolStatus(ostream &os, Context &ctx)\n{\n\tStartTrace(RequestProcessor.RenderProtocolStatus);\n\tGetCurrentRequestProcessor(ctx)->DoRenderProtocolStatus(os, ctx);\n}\n\nvoid RequestProcessor::Error(ostream &reply, const String &msg, Context &ctx)\n{\n\tStartTrace(RequestProcessor.Error);\n\tGetCurrentRequestProcessor(ctx)->DoError(reply, msg, ctx);\n}\n\nvoid RequestProcessor::DoReadInput(iostream &Ios, Context &ctx)\n{\n\t\/\/ default implementation just\n\t\/\/ import the anything from the\n\t\/\/ socket stream\n\n\tAnything args;\n\targs.Import(Ios);\n\tStatTraceAny(RequestProcessor.DoReadInput, args, \"request arguments\", Storage::Current());\n\tctx.PushRequest(args);\n}\n\nvoid RequestProcessor::DoProcessRequest(ostream &reply, Context &ctx)\n{\n\tStartTrace(RequestProcessor.DoProcessRequest);\n\tfServer->ProcessRequest(reply, ctx);\n}\n\nvoid RequestProcessor::DoWriteOutput(iostream &Ios, ostream &reply, Context &ctx)\n{\n\tStartTrace(RequestProcessor.DoWriteOutput);\n\t\/\/ dump the reply object onto the\n\t\/\/ socket stream\n\t\/\/reply.PrintOn(Ios);\n\t\/\/ flush it in case not everything is\n\t\/\/ already dumped onto the socket\n\tIos.flush();\n}\n\nvoid RequestProcessor::DoRenderProtocolStatus(ostream &os, Context &ctx)\n{\n\t\/\/ unknown protocol -> no status\n}\n\nvoid RequestProcessor::DoError(ostream &reply, const String &msg, Context &ctx)\n{\n\t\/\/ unknown protocol -> no error msg\n}\n<commit_msg>improved output message in case the stream is not good anymore<commit_after>\/*\n * Copyright (c) 2005, Peter Sommerlad and IFS Institute for Software at HSR Rapperswil, Switzerland\n * All rights reserved.\n *\n * This library\/application is free software; you can redistribute and\/or modify it under the terms of\n * the license that is included with this library\/application in the file license.txt.\n *\/\n\n\/\/--- interface include --------------------------------------------------------\n#include \"RequestProcessor.h\"\n\n\/\/--- standard modules used ----------------------------------------------------\n#include \"Socket.h\"\n#include \"StringStream.h\"\n#include \"Registry.h\"\n#include \"Server.h\"\n#include \"ServerUtils.h\"\n#include \"SystemLog.h\"\n#include \"Dbg.h\"\n\/\/ #include \"System.h\"\n\n\/\/--- c-library modules used ---------------------------------------------------\n\n\/\/--- RequestProcessor ----------------------------------------------------------\nRegCacheImpl(RequestProcessor);\t\/\/ FindRequestProcessor()\nRegisterRequestProcessor(RequestProcessor);\n\nRequestProcessor::RequestProcessor(const char *processorName)\n\t: RegisterableObject(processorName)\n\t, fServer(0), fErrors()\n{\n\tStartTrace(RequestProcessor.RequestProcessor);\n}\n\nvoid RequestProcessor::Init(Server *server)\n{\n\tStartTrace(RequestProcessor.Init);\n\tfServer = server;\n}\n\nvoid RequestProcessor::ProcessRequest(Context &ctx)\n{\n\tStartTrace(RequestProcessor.ProcessRequest);\n\tctx.SetServer(fServer);\n\tSocket *socket = ctx.GetSocket();\n\tiostream *Ios = 0;\n\n\tif ( socket != (Socket *) NULL ) {\n\t\tROAnything timeout;\n\t\tfServer->Lookup(\"SocketReadTimeout\", timeout);\n\t\tsocket->SetTimeout(timeout.AsLong(10 * 1000L));\n\t\tTraceAny(socket->ClientInfo(), \"socket client info\");\n\t\tIos = socket->GetStream();\n\t}\n\n\tif ( Ios && socket->IsReadyForReading() ) {\n\t\t\/\/ disable nagle algorithm\n\t\tsocket->SetNoDelay();\n\t\tDoReadInput(*Ios, ctx);\n\n\t\tKeepConnectionAlive(ctx);\n\n\t\tif ( !(*Ios) ) {\n\t\t\treturn;\n\t\t}\n\n\t\tif (socket->IsReadyForWriting()) {\n\t\t\t\/\/ process this arguments and\n\t\t\t\/\/ write the output to the reply\n\t\t\tDoProcessRequest(*Ios, ctx);\n\t\t\t\/\/FIXME: BufferReply mechanism possible\n\t\t}\n\t} else {\n\t\tString logMsg(\"No valid stream from socket\");\n\t\tSystemLog::eLogLevel level(SystemLog::eWARNING);\n\t\tif ( socket ) {\n\t\t\tlogMsg << \", fd:\" << ((socket) ? socket->GetFd() : -1L);\n\t\t\tlogMsg << \", from \" << socket->ClientInfo()[\"REMOTE_ADDR\"].AsString() << ':' << socket->ClientInfo()[\"REMOTE_PORT\"].AsString();\n\t\t\tif ( socket->HadTimeout() ) {\n\t\t\t\tlogMsg << \", had timeout (\" << socket->GetTimeout() << \"ms)\";\n\t\t\t\tlevel = SystemLog::eINFO;\n\t\t\t}\n\t\t}\n\t\tSystemLog::Log(level, logMsg);\n\t}\n}\n\nRequestProcessor *RequestProcessor::GetCurrentRequestProcessor(Context &ctx)\n{\n\tString requestProcessor(ctx.Lookup(\"RequestProcessor\", \"RequestProcessor\"));\n\treturn RequestProcessor::FindRequestProcessor(requestProcessor);\n}\n\nvoid RequestProcessor::ForceConnectionClose(Context &ctx)\n{\n\tctx.GetTmpStore()[\"Keep-Alive\"] = 0L;\n}\n\nbool RequestProcessor::KeepConnectionAlive(Context &ctx)\n{\n\tbool retVal = false;\n\tStatTrace(RequestProcessor.KeepConnectionAlive, \"PersistentConnections:\" << (ctx.Lookup(\"PersistentConnections\").AsBool(false) ? \"true\" : \"false\"), Storage::Current());\n\tif ( ctx.Lookup(\"PersistentConnections\").AsBool(false) ) {\n\t\t\/\/ first check if we already know the result\n\t\tROAnything lookupAny;\n\t\tif (ctx.Lookup(\"Keep-Alive\", lookupAny) && !lookupAny.IsNull() ) {\n\t\t\tretVal = lookupAny.AsBool();\n\t\t} else {\n\t\t\t\/\/ let the current RequestProcessor decide\n\t\t\tretVal = GetCurrentRequestProcessor(ctx)->DoKeepConnectionAlive(ctx);\n\t\t\tctx.GetTmpStore()[\"Keep-Alive\"] = retVal;\n\t\t}\n\t}\n\tStatTrace(RequestProcessor.KeepConnectionAlive, \"Keep-Alive:\" << (retVal ? \"true\" : \"false\"), Storage::Current());\n\treturn retVal;\n}\n\nbool RequestProcessor::DoKeepConnectionAlive(Context &ctx)\n{\n\t\/\/ default is to close connection after request\n\treturn false;\n}\n\nvoid RequestProcessor::RenderProtocolStatus(ostream &os, Context &ctx)\n{\n\tStartTrace(RequestProcessor.RenderProtocolStatus);\n\tGetCurrentRequestProcessor(ctx)->DoRenderProtocolStatus(os, ctx);\n}\n\nvoid RequestProcessor::Error(ostream &reply, const String &msg, Context &ctx)\n{\n\tStartTrace(RequestProcessor.Error);\n\tGetCurrentRequestProcessor(ctx)->DoError(reply, msg, ctx);\n}\n\nvoid RequestProcessor::DoReadInput(iostream &Ios, Context &ctx)\n{\n\t\/\/ default implementation just\n\t\/\/ import the anything from the\n\t\/\/ socket stream\n\n\tAnything args;\n\targs.Import(Ios);\n\tStatTraceAny(RequestProcessor.DoReadInput, args, \"request arguments\", Storage::Current());\n\tctx.PushRequest(args);\n}\n\nvoid RequestProcessor::DoProcessRequest(ostream &reply, Context &ctx)\n{\n\tStartTrace(RequestProcessor.DoProcessRequest);\n\tfServer->ProcessRequest(reply, ctx);\n}\n\nvoid RequestProcessor::DoWriteOutput(iostream &Ios, ostream &reply, Context &ctx)\n{\n\tStartTrace(RequestProcessor.DoWriteOutput);\n\t\/\/ dump the reply object onto the\n\t\/\/ socket stream\n\t\/\/reply.PrintOn(Ios);\n\t\/\/ flush it in case not everything is\n\t\/\/ already dumped onto the socket\n\tIos.flush();\n}\n\nvoid RequestProcessor::DoRenderProtocolStatus(ostream &os, Context &ctx)\n{\n\t\/\/ unknown protocol -> no status\n}\n\nvoid RequestProcessor::DoError(ostream &reply, const String &msg, Context &ctx)\n{\n\t\/\/ unknown protocol -> no error msg\n}\n<|endoftext|>"} {"text":"<commit_before>\/*\n * Copyright (c) 2018, NVIDIA CORPORATION.\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n *\/\n\/** ---------------------------------------------------------------------------*\n * @brief Operations on GDF columns\n *\n * @file column.cpp\n * ---------------------------------------------------------------------------**\/\n\n#include <gdf\/gdf.h>\n#include <gdf\/utils.h>\n#include <gdf\/errorutils.h>\n#include <cuda_runtime_api.h>\n\n\/\/ forward decl -- see validops.cu\ngdf_error gdf_mask_concat(gdf_valid_type *output_mask,\n gdf_size_type output_column_length, \n gdf_valid_type *masks_to_concat[], \n gdf_size_type *column_lengths, \n gdf_size_type num_columns);\n\n\/** ---------------------------------------------------------------------------*\n * @brief Concatenates multiple gdf_columns into a single, contiguous column,\n * including the validity bitmasks.\n * \n * Note that input columns with nullptr validity masks are treated as if all\n * elements are valid.\n *\n * @param[out] output_column A column whose buffers are already allocated that\n * will contain the concatenation of the input columns data and\n * validity bitmasks\n * @Param[in] columns_to_concat[] The columns to concatenate\n * @Param[in] num_columns The number of columns to concatenate\n * \n * @return gdf_error GDF_SUCCESS upon completion; GDF_DATASET_EMPTY if any data\n * pointer is NULL, GDF_COLUMN_SIZE_MISMATCH if the output column size\n * != the total size of the input columns; GDF_DTYPE_MISMATCH if the\n * input columns have different datatypes.\n * ---------------------------------------------------------------------------**\/\ngdf_error gdf_column_concat(gdf_column *output_column, gdf_column *columns_to_concat[], int num_columns)\n{\n \n if (nullptr == columns_to_concat){\n return GDF_DATASET_EMPTY;\n }\n\n if ((nullptr == columns_to_concat[0])\n || (nullptr == output_column)){\n return GDF_DATASET_EMPTY;\n }\n\n const gdf_dtype column_type = columns_to_concat[0]->dtype;\n\n if (column_type != output_column->dtype){\n return GDF_DTYPE_MISMATCH;\n }\n\n gdf_size_type total_size = 0;\n bool at_least_one_mask_present = false;\n\n \/\/ Ensure all the columns are properly allocated\n \/\/ and have matching types\n for (int i = 0; i < num_columns; ++i) {\n gdf_column* current_column = columns_to_concat[i];\n if (nullptr == current_column) {\n return GDF_DATASET_EMPTY;\n }\n if ((current_column->size > 0) && (nullptr == current_column->data))\n {\n return GDF_DATASET_EMPTY;\n }\n if (column_type != current_column->dtype) {\n return GDF_DTYPE_MISMATCH;\n }\n\n total_size += current_column->size;\n at_least_one_mask_present |= (nullptr != columns_to_concat[i]->valid);\n }\n\n \/\/ sum of the sizes of the input columns must equal output column size\n if (output_column->size != total_size) {\n return GDF_COLUMN_SIZE_MISMATCH;\n }\n\n \/\/ TODO optimizations if needed\n \/\/ 1. Either \n \/\/ a) use cudaMemcpyAsync to copy the data and overlap copies with gdf_mask_concat\n \/\/ (this will require getting rid of the allocations below because they will\n \/\/ implicitly sync the device), or\n \/\/ b) use a kernel to copy the data from all columns in one go. This will likely not\n \/\/ overlap with the gdf_mask_concat\n \/\/ 2. Detect a zero total null count and skip gdf_mask_concat -- use cudaMemsetAsync\n\n int8_t* target = (int8_t*)(output_column->data);\n output_column->null_count = 0;\n int column_byte_width = 0;\n gdf_error result = get_column_byte_width(output_column, &column_byte_width);\n if (GDF_SUCCESS != result) return result; \n\n \/\/ copy data\n for (int i = 0; i < num_columns; ++i) { \n gdf_size_type bytes = column_byte_width * columns_to_concat[i]->size;\n CUDA_TRY( cudaMemcpy(target, columns_to_concat[i]->data, bytes, cudaMemcpyDeviceToDevice) );\n target += bytes;\n\n output_column->null_count += columns_to_concat[i]->null_count;\n }\n \n if (at_least_one_mask_present) {\n gdf_valid_type** masks;\n gdf_size_type* column_lengths;\n CUDA_TRY( cudaMallocManaged((void**)&masks, sizeof(gdf_valid_type*)*num_columns) );\n CUDA_TRY( cudaMallocManaged((void**)&column_lengths, sizeof(gdf_size_type)*num_columns) );\n\n for (int i = 0; i < num_columns; ++i) { \n masks[i] = columns_to_concat[i]->valid;\n column_lengths[i] = columns_to_concat[i]->size;\n }\n \n result = gdf_mask_concat(output_column->valid, \n output_column->size, \n masks, \n column_lengths, \n num_columns);\n\n CUDA_TRY( cudaFree(masks) );\n CUDA_TRY( cudaFree(column_lengths) );\n\n return result;\n }\n else if (nullptr != output_column->valid) {\n \/\/ no masks, so just fill output valid mask with all 1 bits\n \/\/ TODO: async\n CUDA_TRY( cudaMemset(output_column->valid, \n 0xff, \n gdf_get_num_chars_bitmask(total_size) * sizeof(gdf_valid_type)) );\n }\n \n return GDF_SUCCESS;\n}\n\n\/** ---------------------------------------------------------------------------*\n * @brief Return the size of the gdf_column data type.\n *\n * @return gdf_size_type Size of the gdf_column data type.\n *b ---------------------------------------------------------------------------**\/\ngdf_size_type gdf_column_sizeof() {\n\treturn sizeof(gdf_column);\n}\n\n\/** ---------------------------------------------------------------------------*\n * @brief Create a GDF column given data and validity bitmask pointers, size, and\n * datatype\n *\n * @param[out] column The output column.\n * @param[in] data Pointer to data.\n * @param[in] valid Pointer to validity bitmask for the data.\n * @param[in] size Number of rows in the column.\n * @param[in] dtype Data type of the column.\n * @return gdf_error Returns GDF_SUCCESS upon successful creation.\n * ---------------------------------------------------------------------------**\/\ngdf_error gdf_column_view(gdf_column *column,\n void *data,\n gdf_valid_type *valid,\n\t\t gdf_size_type size,\n gdf_dtype dtype)\n{\n\tcolumn->data = data;\n\tcolumn->valid = valid;\n\tcolumn->size = size;\n\tcolumn->dtype = dtype;\n\tcolumn->null_count = 0;\n\treturn GDF_SUCCESS;\n}\n\n\/** ---------------------------------------------------------------------------*\n * @brief Create a GDF column given data and validity bitmask pointers, size, and\n * datatype, and count of null (non-valid) elements\n *\n * @param[out] column The output column.\n * @param[in] data Pointer to data.\n * @param[in] valid Pointer to validity bitmask for the data.\n * @param[in] size Number of rows in the column.\n * @param[in] dtype Data type of the column.\n * @param[in] null_count The number of non-valid elements in the validity bitmask\n * @return gdf_error Returns GDF_SUCCESS upon successful creation.\n * ---------------------------------------------------------------------------**\/\ngdf_error gdf_column_view_augmented(gdf_column *column,\n void *data,\n gdf_valid_type *valid,\n\t\t gdf_size_type size,\n gdf_dtype dtype,\n gdf_size_type null_count)\n{\n\tcolumn->data = data;\n\tcolumn->valid = valid;\n\tcolumn->size = size;\n\tcolumn->dtype = dtype;\n\tcolumn->null_count = null_count;\n\treturn GDF_SUCCESS;\n}\n\n\/** ---------------------------------------------------------------------------*\n * @brief Free the CUDA device memory of a gdf_column\n *\n * @param[inout] column Data and validity bitmask pointers of this column will be freed\n * @return gdf_error GDF_SUCCESS or GDF_ERROR if there is an error freeing the data\n * ---------------------------------------------------------------------------**\/\ngdf_error gdf_column_free(gdf_column *column) \n{\n CUDA_TRY( cudaFree(column->data) );\n CUDA_TRY( cudaFree(column->valid) );\n return GDF_SUCCESS;\n}\n\n\/** ---------------------------------------------------------------------------*\n * @brief Get the byte width of a column\n *\n * @param[in] col The input column\n * @param[out] width The data type size of col\n * @return gdf_error GDF_SUCCESS, or GDF_UNSUPPORTED_DTYPE if col has an invalid\n * datatype\n * ---------------------------------------------------------------------------**\/\ngdf_error get_column_byte_width(gdf_column * col, \n int * width)\n{\n\tswitch(col->dtype) {\n\n\tcase GDF_INT8 :\n\t\t*width = 1;\n\t\tbreak;\n\tcase GDF_INT16 :\n\t\t*width = 2;\n\t\tbreak;\n\tcase GDF_INT32 :\n\t\t*width = 4;\n\t\tbreak;\n\tcase GDF_INT64 :\n\t\t*width = 8;\n\t\tbreak;\n\tcase GDF_FLOAT32 :\n\t\t*width = 4;\n\t\tbreak;\n\tcase GDF_FLOAT64 :\n\t\t*width = 8;\n\t\tbreak;\n\tcase GDF_DATE32 :\n\t\t*width = 4;\n\t\tbreak;\n\tcase GDF_DATE64 :\n\t\t*width = 8;\n\t\tbreak;\n\tcase GDF_TIMESTAMP :\n\t\t*width = 8;\n\t\tbreak;\n\tdefault :\n\t\t*width = -1;\n\t\treturn GDF_UNSUPPORTED_DTYPE;\n\t}\n\n\treturn GDF_SUCCESS;\n}\n<commit_msg>Removed errant `b` in a comment.<commit_after>\/*\n * Copyright (c) 2018, NVIDIA CORPORATION.\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n *\/\n\/** ---------------------------------------------------------------------------*\n * @brief Operations on GDF columns\n *\n * @file column.cpp\n * ---------------------------------------------------------------------------**\/\n\n#include <gdf\/gdf.h>\n#include <gdf\/utils.h>\n#include <gdf\/errorutils.h>\n#include <cuda_runtime_api.h>\n\n\/\/ forward decl -- see validops.cu\ngdf_error gdf_mask_concat(gdf_valid_type *output_mask,\n gdf_size_type output_column_length, \n gdf_valid_type *masks_to_concat[], \n gdf_size_type *column_lengths, \n gdf_size_type num_columns);\n\n\/** ---------------------------------------------------------------------------*\n * @brief Concatenates multiple gdf_columns into a single, contiguous column,\n * including the validity bitmasks.\n * \n * Note that input columns with nullptr validity masks are treated as if all\n * elements are valid.\n *\n * @param[out] output_column A column whose buffers are already allocated that\n * will contain the concatenation of the input columns data and\n * validity bitmasks\n * @Param[in] columns_to_concat[] The columns to concatenate\n * @Param[in] num_columns The number of columns to concatenate\n * \n * @return gdf_error GDF_SUCCESS upon completion; GDF_DATASET_EMPTY if any data\n * pointer is NULL, GDF_COLUMN_SIZE_MISMATCH if the output column size\n * != the total size of the input columns; GDF_DTYPE_MISMATCH if the\n * input columns have different datatypes.\n * ---------------------------------------------------------------------------**\/\ngdf_error gdf_column_concat(gdf_column *output_column, gdf_column *columns_to_concat[], int num_columns)\n{\n \n if (nullptr == columns_to_concat){\n return GDF_DATASET_EMPTY;\n }\n\n if ((nullptr == columns_to_concat[0])\n || (nullptr == output_column)){\n return GDF_DATASET_EMPTY;\n }\n\n const gdf_dtype column_type = columns_to_concat[0]->dtype;\n\n if (column_type != output_column->dtype){\n return GDF_DTYPE_MISMATCH;\n }\n\n gdf_size_type total_size = 0;\n bool at_least_one_mask_present = false;\n\n \/\/ Ensure all the columns are properly allocated\n \/\/ and have matching types\n for (int i = 0; i < num_columns; ++i) {\n gdf_column* current_column = columns_to_concat[i];\n if (nullptr == current_column) {\n return GDF_DATASET_EMPTY;\n }\n if ((current_column->size > 0) && (nullptr == current_column->data))\n {\n return GDF_DATASET_EMPTY;\n }\n if (column_type != current_column->dtype) {\n return GDF_DTYPE_MISMATCH;\n }\n\n total_size += current_column->size;\n at_least_one_mask_present |= (nullptr != columns_to_concat[i]->valid);\n }\n\n \/\/ sum of the sizes of the input columns must equal output column size\n if (output_column->size != total_size) {\n return GDF_COLUMN_SIZE_MISMATCH;\n }\n\n \/\/ TODO optimizations if needed\n \/\/ 1. Either \n \/\/ a) use cudaMemcpyAsync to copy the data and overlap copies with gdf_mask_concat\n \/\/ (this will require getting rid of the allocations below because they will\n \/\/ implicitly sync the device), or\n \/\/ b) use a kernel to copy the data from all columns in one go. This will likely not\n \/\/ overlap with the gdf_mask_concat\n \/\/ 2. Detect a zero total null count and skip gdf_mask_concat -- use cudaMemsetAsync\n\n int8_t* target = (int8_t*)(output_column->data);\n output_column->null_count = 0;\n int column_byte_width = 0;\n gdf_error result = get_column_byte_width(output_column, &column_byte_width);\n if (GDF_SUCCESS != result) return result; \n\n \/\/ copy data\n for (int i = 0; i < num_columns; ++i) { \n gdf_size_type bytes = column_byte_width * columns_to_concat[i]->size;\n CUDA_TRY( cudaMemcpy(target, columns_to_concat[i]->data, bytes, cudaMemcpyDeviceToDevice) );\n target += bytes;\n\n output_column->null_count += columns_to_concat[i]->null_count;\n }\n \n if (at_least_one_mask_present) {\n gdf_valid_type** masks;\n gdf_size_type* column_lengths;\n CUDA_TRY( cudaMallocManaged((void**)&masks, sizeof(gdf_valid_type*)*num_columns) );\n CUDA_TRY( cudaMallocManaged((void**)&column_lengths, sizeof(gdf_size_type)*num_columns) );\n\n for (int i = 0; i < num_columns; ++i) { \n masks[i] = columns_to_concat[i]->valid;\n column_lengths[i] = columns_to_concat[i]->size;\n }\n \n result = gdf_mask_concat(output_column->valid, \n output_column->size, \n masks, \n column_lengths, \n num_columns);\n\n CUDA_TRY( cudaFree(masks) );\n CUDA_TRY( cudaFree(column_lengths) );\n\n return result;\n }\n else if (nullptr != output_column->valid) {\n \/\/ no masks, so just fill output valid mask with all 1 bits\n \/\/ TODO: async\n CUDA_TRY( cudaMemset(output_column->valid, \n 0xff, \n gdf_get_num_chars_bitmask(total_size) * sizeof(gdf_valid_type)) );\n }\n \n return GDF_SUCCESS;\n}\n\n\/** ---------------------------------------------------------------------------*\n * @brief Return the size of the gdf_column data type.\n *\n * @return gdf_size_type Size of the gdf_column data type.\n * ---------------------------------------------------------------------------**\/\ngdf_size_type gdf_column_sizeof() {\n\treturn sizeof(gdf_column);\n}\n\n\/** ---------------------------------------------------------------------------*\n * @brief Create a GDF column given data and validity bitmask pointers, size, and\n * datatype\n *\n * @param[out] column The output column.\n * @param[in] data Pointer to data.\n * @param[in] valid Pointer to validity bitmask for the data.\n * @param[in] size Number of rows in the column.\n * @param[in] dtype Data type of the column.\n * @return gdf_error Returns GDF_SUCCESS upon successful creation.\n * ---------------------------------------------------------------------------**\/\ngdf_error gdf_column_view(gdf_column *column,\n void *data,\n gdf_valid_type *valid,\n\t\t gdf_size_type size,\n gdf_dtype dtype)\n{\n\tcolumn->data = data;\n\tcolumn->valid = valid;\n\tcolumn->size = size;\n\tcolumn->dtype = dtype;\n\tcolumn->null_count = 0;\n\treturn GDF_SUCCESS;\n}\n\n\/** ---------------------------------------------------------------------------*\n * @brief Create a GDF column given data and validity bitmask pointers, size, and\n * datatype, and count of null (non-valid) elements\n *\n * @param[out] column The output column.\n * @param[in] data Pointer to data.\n * @param[in] valid Pointer to validity bitmask for the data.\n * @param[in] size Number of rows in the column.\n * @param[in] dtype Data type of the column.\n * @param[in] null_count The number of non-valid elements in the validity bitmask\n * @return gdf_error Returns GDF_SUCCESS upon successful creation.\n * ---------------------------------------------------------------------------**\/\ngdf_error gdf_column_view_augmented(gdf_column *column,\n void *data,\n gdf_valid_type *valid,\n\t\t gdf_size_type size,\n gdf_dtype dtype,\n gdf_size_type null_count)\n{\n\tcolumn->data = data;\n\tcolumn->valid = valid;\n\tcolumn->size = size;\n\tcolumn->dtype = dtype;\n\tcolumn->null_count = null_count;\n\treturn GDF_SUCCESS;\n}\n\n\/** ---------------------------------------------------------------------------*\n * @brief Free the CUDA device memory of a gdf_column\n *\n * @param[inout] column Data and validity bitmask pointers of this column will be freed\n * @return gdf_error GDF_SUCCESS or GDF_ERROR if there is an error freeing the data\n * ---------------------------------------------------------------------------**\/\ngdf_error gdf_column_free(gdf_column *column) \n{\n CUDA_TRY( cudaFree(column->data) );\n CUDA_TRY( cudaFree(column->valid) );\n return GDF_SUCCESS;\n}\n\n\/** ---------------------------------------------------------------------------*\n * @brief Get the byte width of a column\n *\n * @param[in] col The input column\n * @param[out] width The data type size of col\n * @return gdf_error GDF_SUCCESS, or GDF_UNSUPPORTED_DTYPE if col has an invalid\n * datatype\n * ---------------------------------------------------------------------------**\/\ngdf_error get_column_byte_width(gdf_column * col, \n int * width)\n{\n\tswitch(col->dtype) {\n\n\tcase GDF_INT8 :\n\t\t*width = 1;\n\t\tbreak;\n\tcase GDF_INT16 :\n\t\t*width = 2;\n\t\tbreak;\n\tcase GDF_INT32 :\n\t\t*width = 4;\n\t\tbreak;\n\tcase GDF_INT64 :\n\t\t*width = 8;\n\t\tbreak;\n\tcase GDF_FLOAT32 :\n\t\t*width = 4;\n\t\tbreak;\n\tcase GDF_FLOAT64 :\n\t\t*width = 8;\n\t\tbreak;\n\tcase GDF_DATE32 :\n\t\t*width = 4;\n\t\tbreak;\n\tcase GDF_DATE64 :\n\t\t*width = 8;\n\t\tbreak;\n\tcase GDF_TIMESTAMP :\n\t\t*width = 8;\n\t\tbreak;\n\tdefault :\n\t\t*width = -1;\n\t\treturn GDF_UNSUPPORTED_DTYPE;\n\t}\n\n\treturn GDF_SUCCESS;\n}\n<|endoftext|>"} {"text":"<commit_before>#define MAXV 2000\nint d[MAXV], p[MAXV], pot[MAXV];\nstruct cmp {\n bool operator ()(int i, int j) {\n return d[i] == d[j] ? i < j : d[i] < d[j];\n }\n};\nstruct flow_network {\n struct edge {\n int v, cap, cost, nxt;\n edge(int _v, int _cap, int _cost, int _nxt)\n : v(_v), cap(_cap), cost(_cost), nxt(_nxt) { }\n };\n int n, ecnt, *head;\n vector<edge> e, e_store;\n flow_network(int _n, int m = -1) : n(_n), ecnt(0) {\n e.reserve(2 * (m == -1 ? n : m));\n memset(head = new int[n], -1, n << 2);\n }\n void destroy() { delete[] head; }\n void reset() { e = e_store; }\n void add_edge(int u, int v, int cost, int uv, int vu=0) {\n e.push_back(edge(v, uv, cost, head[u])); head[u] = ecnt++;\n e.push_back(edge(u, vu, -cost, head[v])); head[v] = ecnt++;\n }\n ii min_cost_max_flow(int s, int t, bool res = true) {\n if (s == t) return ii(0, 0);\n e_store = e;\n memset(pot, 0, n << 2);\n int f = 0, c = 0, v;\n while (true) {\n memset(d, -1, n << 2);\n memset(p, -1, n << 2);\n set<int, cmp> q;\n q.insert(s); d[s] = 0;\n while (!q.empty()) {\n int u = *q.begin();\n q.erase(q.begin());\n for (int i = head[u]; i != -1; i = e[i].nxt) {\n if (e[i].cap == 0) continue;\n int cd = d[u] + e[i].cost + pot[u] - pot[v = e[i].v];\n if (d[v] == -1 || cd < d[v]) {\n if (q.find(v) != q.end()) q.erase(q.find(v));\n d[v] = cd; p[v] = i;\n q.insert(v);\n }\n }\n }\n if (p[t] == -1) break;\n int x = INF, at = p[t];\n while (at != -1) x = min(x, e[at].cap), at = p[e[at^1].v];\n at = p[t], f += x;\n while (at != -1)\n e[at].cap -= x, e[at^1].cap += x, at = p[e[at^1].v];\n c += x * (d[t] + pot[t] - pot[s]);\n rep(i,0,n) if (p[i] != -1) pot[i] += d[i];\n }\n if (res) reset();\n return ii(f, c);\n }\n};\n<commit_msg>Simplify min-cost max flow<commit_after>#define MAXV 2000\nint d[MAXV], p[MAXV], pot[MAXV];\nstruct cmp {\n bool operator ()(int i, int j) {\n return d[i] == d[j] ? i < j : d[i] < d[j];\n }\n};\nstruct flow_network {\n struct edge {\n int v, cap, cost, nxt;\n edge(int _v, int _cap, int _cost, int _nxt)\n : v(_v), cap(_cap), cost(_cost), nxt(_nxt) { }\n };\n int n, ecnt, *head;\n vector<edge> e, e_store;\n flow_network(int _n, int m = -1) : n(_n), ecnt(0) {\n e.reserve(2 * (m == -1 ? n : m));\n memset(head = new int[n], -1, n << 2);\n }\n void destroy() { delete[] head; }\n void reset() { e = e_store; }\n void add_edge(int u, int v, int cost, int uv, int vu=0) {\n e.push_back(edge(v, uv, cost, head[u])); head[u] = ecnt++;\n e.push_back(edge(u, vu, -cost, head[v])); head[v] = ecnt++;\n }\n ii min_cost_max_flow(int s, int t, bool res = true) {\n if (s == t) return ii(0, 0);\n e_store = e;\n memset(pot, 0, n << 2);\n int f = 0, c = 0, v;\n while (true) {\n memset(d, -1, n << 2);\n memset(p, -1, n << 2);\n set<int, cmp> q;\n d[s] = 0; q.insert(s);\n while (!q.empty()) {\n int u = *q.begin();\n q.erase(q.begin());\n for (int i = head[u]; i != -1; i = e[i].nxt) {\n if (e[i].cap == 0) continue;\n int cd = d[u] + e[i].cost + pot[u] - pot[v = e[i].v];\n if (d[v] == -1 || cd < d[v]) {\n q.erase(v);\n d[v] = cd; p[v] = i;\n q.insert(v);\n }\n }\n }\n if (p[t] == -1) break;\n int x = INF, at = p[t];\n while (at != -1) x = min(x, e[at].cap), at = p[e[at^1].v];\n at = p[t], f += x;\n while (at != -1)\n e[at].cap -= x, e[at^1].cap += x, at = p[e[at^1].v];\n c += x * (d[t] + pot[t] - pot[s]);\n rep(i,0,n) if (p[i] != -1) pot[i] += d[i];\n }\n if (res) reset();\n return ii(f, c);\n }\n};\n<|endoftext|>"} {"text":"<commit_before>#include <application.h>\n#include \"math.h\"\n\n#include \"color.h\"\n\n\/\/ Convert a color from RGB representation to HSV representation.\nvoid Color::Rgb::toHsv(Color::Hsv& hsv)\n{\n uint8_t r = this->r;\n uint8_t g = this->g;\n uint8_t b = this->b;\n \n\tuint8_t min = min(r, min(g, b));\n uint8_t max = max(r, max(g, b));\n\tuint8_t delta = max - min;\n\n hsv.v = max;\n\n if (max == 0)\n {\n hsv.h = 0;\n hsv.s = 0;\n return;\n }\n\n if (max == r)\n hsv.h = ((g - b) \/ delta) * (Color::Hsv::H_MAX \/ 6);\n else if (max == g)\n hsv.h = ((b - r) \/ delta + 2) * (Color::Hsv::H_MAX \/ 6);\n else\n hsv.h = ((r - g) \/ delta + 4) * (Color::Hsv::H_MAX \/ 6);\n\t\n\thsv.s = delta * Color::Hsv::S_MAX \/ max;\n}\n\nColor::Hsv Color::Rgb::toHsv()\n{\n\tColor::Hsv hsv;\n\tthis->toHsv(hsv);\n\treturn hsv;\n}\n\n\/\/ Convert a color from HSV representation to RGB representation.\nvoid Color::Hsv::toRgb(Color::Rgb& rgb)\n{\n\tfloat h = this->h \/ (Color::Hsv::H_MAX \/ 6.0);\n\tfloat s = this->s \/ Color::Hsv::S_MAX;\n\tfloat v = this->v;\n\n\tuint16_t i = int(h);\n\tfloat f = h - i;\n\tuint8_t p = (uint8_t)(v * (1 - s));\n\tuint8_t q = (uint8_t)(v * (1 - s * f));\n\tuint8_t t = (uint8_t)(v * (1 - s * (1 - f)));\n\t\n\tswitch (i % 6)\n\t{\n\tcase 0: rgb.r = v; rgb.g = t; rgb.b = p; break;\n\tcase 1: rgb.r = q; rgb.g = v; rgb.b = p; break;\n\tcase 2: rgb.r = p; rgb.g = v; rgb.b = t; break;\n\tcase 3: rgb.r = p; rgb.g = q; rgb.b = v; break;\n\tcase 4: rgb.r = t; rgb.g = p; rgb.b = v; break;\n\tcase 5: rgb.r = v; rgb.g = p; rgb.b = q; break;\n\t}\n}\n\nColor::Rgb Color::Hsv::toRgb()\n{\n\tColor::Rgb rgb;\n\tthis->toRgb(rgb);\n\treturn rgb;\n}\n<commit_msg>Fixed floating point bugs.<commit_after>#include <application.h>\n#include \"math.h\"\n\n#include \"color.h\"\n\n\/\/ Convert a color from RGB representation to HSV representation.\nvoid Color::Rgb::toHsv(Color::Hsv& hsv)\n{\n uint8_t r = this->r;\n uint8_t g = this->g;\n uint8_t b = this->b;\n \n\tuint8_t min = min(r, min(g, b));\n uint8_t max = max(r, max(g, b));\n\tfloat delta = max - min;\n\n hsv.v = max;\n\n if (max == 0)\n {\n hsv.h = 0;\n hsv.s = 0;\n return;\n }\n\n if (max == r)\n hsv.h = ((g - b) \/ delta) * (Color::Hsv::H_MAX \/ 6.0);\n else if (max == g)\n hsv.h = ((b - r) \/ delta + 2) * (Color::Hsv::H_MAX \/ 6.0);\n else\n hsv.h = ((r - g) \/ delta + 4) * (Color::Hsv::H_MAX \/ 6.0);\n\t\n\thsv.s = delta * Color::Hsv::S_MAX \/ max;\n}\n\nColor::Hsv Color::Rgb::toHsv()\n{\n\tColor::Hsv hsv;\n\tthis->toHsv(hsv);\n\treturn hsv;\n}\n\n\/\/ Convert a color from HSV representation to RGB representation.\nvoid Color::Hsv::toRgb(Color::Rgb& rgb)\n{\n\tfloat h = this->h \/ (Color::Hsv::H_MAX \/ 6.0);\n\tfloat s = this->s \/ (float)Color::Hsv::S_MAX;\n\tfloat v = this->v;\n\n\tuint16_t i = int(h);\n\tfloat f = h - i;\n\tuint8_t p = (uint8_t)(v * (1 - s));\n\tuint8_t q = (uint8_t)(v * (1 - s * f));\n\tuint8_t t = (uint8_t)(v * (1 - s * (1 - f)));\n\t\n\tswitch (i % 6)\n\t{\n\tcase 0: rgb.r = v; rgb.g = t; rgb.b = p; break;\n\tcase 1: rgb.r = q; rgb.g = v; rgb.b = p; break;\n\tcase 2: rgb.r = p; rgb.g = v; rgb.b = t; break;\n\tcase 3: rgb.r = p; rgb.g = q; rgb.b = v; break;\n\tcase 4: rgb.r = t; rgb.g = p; rgb.b = v; break;\n\tcase 5: rgb.r = v; rgb.g = p; rgb.b = q; break;\n\t}\n}\n\nColor::Rgb Color::Hsv::toRgb()\n{\n\tColor::Rgb rgb;\n\tthis->toRgb(rgb);\n\treturn rgb;\n}\n<|endoftext|>"} {"text":"<commit_before>#ifndef __MODEL_HPP_INCLUDED\n#define __MODEL_HPP_INCLUDED\n\n#include \"entity.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 GLM\n#ifndef __GLM_GLM_HPP_INCLUDED\n#define __GLM_GLM_HPP_INCLUDED\n#include <glm\/glm.hpp> \/\/ glm\n#endif\n\n\/\/ Include standard headers\n#include <queue> \/\/ std::queue\n#include <stdint.h> \/\/ uint32_t etc.\n#include <string> \/\/ std::string\n#include <vector> \/\/ std::vector\n\nnamespace ontology\n{\n class Material;\n class Object;\n\n class Model: public ontology::Entity\n {\n public:\n \/\/ constructor.\n Model();\n\n \/\/ destructor.\n ~Model();\n\n \/\/ this method sets a object pointer.\n void set_object_pointer(uint32_t childID, ontology::Object* child_pointer);\n\n \/\/ this method gets a object ID and removes it from the `free_objectID_queue` if it was popped from the queue.\n uint32_t get_objectID();\n\n std::string color_channel; \/\/ color channel in use: `\"red\"`, `\"green\"`, `\"blue\"`, `\"mean\"` or `\"all\"`.\n glm::vec3 light_position; \/\/ light position.\n\n uint32_t childID; \/\/ species ID\/text3D ID\/glyph ID, set by corresponding `bind_to_parent()`.\n GLuint lightID; \/\/ light ID, returned by `glGetUniformLocation(programID, \"LightPosition_worldspace\");`.\n\n std::vector<ontology::Object*> object_pointer_vector;\n std::queue<uint32_t> free_objectID_queue;\n\n std::string triangulation_type;\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<uint32_t> 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}\n\n#endif\n<commit_msg>All member variables of `class Model` are now `private`.<commit_after>#ifndef __MODEL_HPP_INCLUDED\n#define __MODEL_HPP_INCLUDED\n\n#include \"entity.hpp\"\n#include \"species_or_glyph.hpp\"\n#include \"code\/ylikuutio\/hierarchy\/hierarchy_templates.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 GLM\n#ifndef __GLM_GLM_HPP_INCLUDED\n#define __GLM_GLM_HPP_INCLUDED\n#include <glm\/glm.hpp> \/\/ glm\n#endif\n\n\/\/ Include standard headers\n#include <queue> \/\/ std::queue\n#include <stdint.h> \/\/ uint32_t etc.\n#include <string> \/\/ std::string\n#include <vector> \/\/ std::vector\n\nnamespace space_partition\n{\n class Chunk;\n}\n\nnamespace ontology\n{\n class Shader;\n class Material;\n class Species;\n class Object;\n\n class Model: public ontology::Entity\n {\n public:\n \/\/ constructor.\n Model();\n\n \/\/ destructor.\n ~Model();\n\n \/\/ this method sets a object pointer.\n void set_object_pointer(uint32_t childID, ontology::Object* child_pointer);\n\n \/\/ this method gets a object ID and removes it from the `free_objectID_queue` if it was popped from the queue.\n uint32_t get_objectID();\n\n friend class Glyph;\n friend class Species;\n friend class Object;\n friend class space_partition::Chunk;\n template<class T1>\n friend void hierarchy::bind_child_to_parent(T1 child_pointer, std::vector<T1>& child_pointer_vector, std::queue<uint32_t>& free_childID_queue);\n template<class T1, class T2>\n friend void hierarchy::bind_child_to_new_parent(T1 child_pointer, T2 new_parent_pointer, std::vector<T1>& old_child_pointer_vector, std::queue<uint32_t>& old_free_childID_queue);\n template<class T1>\n friend void render_species_or_glyph(T1 species_or_glyph_pointer);\n template<class T1>\n friend void render_this_object(ontology::Object* object_pointer, ontology::Shader* shader_pointer);\n friend GLfloat get_ground_level(ontology::Species* terrain_species, glm::vec3 position);\n\n private:\n std::string color_channel; \/\/ color channel in use: `\"red\"`, `\"green\"`, `\"blue\"`, `\"mean\"` or `\"all\"`.\n glm::vec3 light_position; \/\/ light position.\n\n uint32_t childID; \/\/ species ID\/text3D ID\/glyph ID, set by corresponding `bind_to_parent()`.\n GLuint lightID; \/\/ light ID, returned by `glGetUniformLocation(programID, \"LightPosition_worldspace\");`.\n\n std::vector<ontology::Object*> object_pointer_vector;\n std::queue<uint32_t> free_objectID_queue;\n\n std::string triangulation_type;\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<uint32_t> 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}\n\n#endif\n<|endoftext|>"} {"text":"<commit_before>\n\/*\n Filename:\n common.cpp\n Author:\n Vincent Heins \/ TheMysteriousVincent\n Description:\n This class holds static functions for common things, like converting an string to an int, e.g...\n*\/\n\n#include \"common.h\"\n\n\/*\n Publicity: public\n Return type: void\n Name\/Type: strReplace()\n Description: replaces each char in *oldChar with *New\n*\/\nvoid A3URLCommon::StrReplace(std::string *s, const char *oldArr, const char *New)\n{\n std::string chars(oldArr);\n for (const char &c : chars)\n {\n \/\/TODO: create for loop for comparison -> less loops.\n size_t found = s->find(c);\n while (found != std::string::npos)\n {\n if (strcmp(New, \"\") == 0)\n {\n s->erase(found, 1);\n }\n else\n {\n s->replace(found, 1, New);\n }\n\n found = s->find(c);\n }\n }\n}\n\n\/*\n Publicity: public\n Return type: int\n Name\/Type: strToInt()\n Description: converts a std::string to int !safely!\n*\/\nint A3URLCommon::StrToInt(std::string s)\n{\n int i;\n try\n {\n A3URLCommon::StrReplace(&s, \"\\\"'abcdefghijklmnopqrstuvzxyzABCDEFGHIJKLMNOPQRSTUVWXYZöäüÖÄÜ-_*~+#`´?\\\\ß}{[]()\/&%\", \"\");\n i = std::stoi(s);\n }\n catch (const std::invalid_argument &e)\n {\n i = 0;\n }\n catch (const std::out_of_range &e)\n {\n i = 0;\n }\n\n return i;\n};\n\n\/\/A3URLCommon::StrUnquote unquotes a given string pointer\nvoid A3URLCommon::StrUnqoute(std::string *s)\n{\n if (s->size() > 0)\n {\n if (s->compare(s->size() - 1, 1, \"\\\"\") == 0)\n s->erase(s->size() - 1);\n\n if (s->compare(0, 1, \"\\\"\") == 0)\n s->erase(0, 1);\n }\n};\n\n\/\/A3URLCommon::MergeStringMaps merges two given std::map<std::string, std::string> maps\nstd::map<std::string, std::string> A3URLCommon::MergeStringMaps(std::map<std::string, std::string> m1, std::map<std::string, std::string> m2)\n{\n \/\/m2 -> overwrites -> m1\n for (std::map<std::string, std::string>::iterator it = m2.begin(); it != m2.end(); ++it)\n m1[it->first] = it->second;\n \n return m1;\n};\n\n\/\/A3URLCommon::ToArray is the init function for the json array to ArmA 3 array convertion\nstd::string A3URLCommon::ToArray(std::string jTxt)\n{\n Json::Value root;\n std::stringstream(jTxt) >> root;\n std::stringstream res;\n\n if (root.empty() || root.isNull())\n {\n res << \"[]\";\n }\n else if (root.isArray())\n {\n res << A3URLCommon::toArray_array(root);\n }\n else if (root.isObject())\n {\n res << A3URLCommon::toArray_object(root);\n }\n\n return res.str();\n};\n\n\/\/A3URLCommon::toArray_array formats only JSON arrays to an ArmA 3 array\nstd::string A3URLCommon::toArray_array(const Json::Value &root)\n{\n std::stringstream res;\n\n res << \"[\\\"array\\\",[\";\n if (root.size() > 0)\n {\n for (Json::Value::const_iterator it = root.begin(); it != root.end(); it++)\n {\n if (it != root.begin())\n res << \",\";\n \n if (it->isBool())\n {\n res << Json::valueToString(it->asBool());\n }\n else if (it->isInt())\n {\n res << Json::valueToString(it->asInt());\n }\n else if (it->isInt64())\n {\n res << Json::valueToString(it->asInt64());\n }\n else if (it->isUInt())\n {\n res << Json::valueToString(it->asUInt());\n }\n else if (it->isUInt64())\n {\n res << Json::valueToString(it->asUInt64());\n }\n else if (it->isDouble())\n {\n res << Json::valueToString(it->asDouble());\n }\n else if (it->isString())\n {\n res << Json::valueToQuotedString(it->asString().c_str());\n }\n else if (it->isObject())\n {\n res << A3URLCommon::toArray_object(*it);\n }\n else if (it->isArray())\n {\n res << A3URLCommon::toArray_array(*it);\n }\n else\n {\n res << \"nil\";\n }\n }\n }\n res << \"]]\";\n\n return res.str();\n};\n\n\/\/A3URLCommon::toArray_object formats a JSON object to an ArmA 3 array\nstd::string A3URLCommon::toArray_object(const Json::Value &root)\n{\n std::stringstream res;\n\n res << \"[\\\"object\\\",[\";\n if (root.size() > 0)\n {\n for (Json::Value::const_iterator it = root.begin(); it != root.end(); it++)\n {\n if (it != root.begin())\n res << \",\";\n \n res << \"[\" << Json::valueToQuotedString(it.key().asString().c_str()) << \",\";\n\n if (it->isBool())\n {\n res << Json::valueToString(it->asBool());\n }\n else if (it->isInt())\n {\n res << Json::valueToString(it->asInt());\n }\n else if (it->isInt64())\n {\n res << Json::valueToString(it->asInt64());\n }\n else if (it->isUInt())\n {\n res << Json::valueToString(it->asUInt());\n }\n else if (it->isUInt64())\n {\n res << Json::valueToString(it->asUInt64());\n }\n else if (it->isDouble())\n {\n res << Json::valueToString(it->asDouble());\n }\n else if (it->isString())\n {\n res << Json::valueToQuotedString(it->asString().c_str());\n }\n else if (it->isObject())\n {\n res << A3URLCommon::toArray_object(*it);\n }\n else if (it->isArray())\n {\n res << A3URLCommon::toArray_array(*it);\n }\n else\n {\n res << \"nil\";\n }\n\n res << \"]\";\n }\n }\n\n res << \"]]\";\n\n return res.str();\n};\n<commit_msg>update unquoting arguments<commit_after>\n\/*\n Filename:\n common.cpp\n Author:\n Vincent Heins \/ TheMysteriousVincent\n Description:\n This class holds static functions for common things, like converting an string to an int, e.g...\n*\/\n\n#include \"common.h\"\n\n\/*\n Publicity: public\n Return type: void\n Name\/Type: strReplace()\n Description: replaces each char in *oldChar with *New\n*\/\nvoid A3URLCommon::StrReplace(std::string *s, const char *oldArr, const char *New)\n{\n std::string chars(oldArr);\n for (const char &c : chars)\n {\n \/\/TODO: create for loop for comparison -> less loops.\n size_t found = s->find(c);\n while (found != std::string::npos)\n {\n if (strcmp(New, \"\") == 0)\n {\n s->erase(found, 1);\n }\n else\n {\n s->replace(found, 1, New);\n }\n\n found = s->find(c);\n }\n }\n}\n\n\/*\n Publicity: public\n Return type: int\n Name\/Type: strToInt()\n Description: converts a std::string to int !safely!\n*\/\nint A3URLCommon::StrToInt(std::string s)\n{\n int i;\n try\n {\n A3URLCommon::StrReplace(&s, \"\\\"'abcdefghijklmnopqrstuvzxyzABCDEFGHIJKLMNOPQRSTUVWXYZöäüÖÄÜ-_*~+#`´?\\\\ß}{[]()\/&%\", \"\");\n i = std::stoi(s);\n }\n catch (const std::invalid_argument &e)\n {\n i = 0;\n }\n catch (const std::out_of_range &e)\n {\n i = 0;\n }\n\n return i;\n};\n\n\/\/A3URLCommon::StrUnquote unquotes a given string pointer\nvoid A3URLCommon::StrUnqoute(std::string *s)\n{\n if (s->size() > 0)\n {\n if (s->front() == '\"')\n s->erase(0, 1);\n if (s->back() == '\"')\n s->erase(s->size() - 1);\n \n \/\/unquote '\"\"' quotes to '\"'\n bool lastQuoted = false;\n for (std::string::iterator it = s->begin(); it != s->end(); it++)\n {\n if (*it == '\"')\n {\n if (!lastQuoted)\n {\n lastQuoted = true;\n }\n else\n {\n s->erase(it);\n it--;\n lastQuoted = false;\n }\n }\n else\n {\n lastQuoted = false;\n }\n }\n }\n};\n\n\/\/A3URLCommon::MergeStringMaps merges two given std::map<std::string, std::string> maps\nstd::map<std::string, std::string> A3URLCommon::MergeStringMaps(std::map<std::string, std::string> m1, std::map<std::string, std::string> m2)\n{\n \/\/m2 -> overwrites -> m1\n for (std::map<std::string, std::string>::iterator it = m2.begin(); it != m2.end(); ++it)\n m1[it->first] = it->second;\n \n return m1;\n};\n\n\/\/A3URLCommon::ToArray is the init function for the json array to ArmA 3 array convertion\nstd::string A3URLCommon::ToArray(std::string jTxt)\n{\n Json::Value root;\n std::stringstream(jTxt) >> root;\n std::stringstream res;\n\n if (root.empty() || root.isNull())\n {\n res << \"[]\";\n }\n else if (root.isArray())\n {\n res << A3URLCommon::toArray_array(root);\n }\n else if (root.isObject())\n {\n res << A3URLCommon::toArray_object(root);\n }\n\n return res.str();\n};\n\n\/\/A3URLCommon::toArray_array formats only JSON arrays to an ArmA 3 array\nstd::string A3URLCommon::toArray_array(const Json::Value &root)\n{\n std::stringstream res;\n\n res << \"[\\\"array\\\",[\";\n if (root.size() > 0)\n {\n for (Json::Value::const_iterator it = root.begin(); it != root.end(); it++)\n {\n if (it != root.begin())\n res << \",\";\n \n if (it->isBool())\n {\n res << Json::valueToString(it->asBool());\n }\n else if (it->isInt())\n {\n res << Json::valueToString(it->asInt());\n }\n else if (it->isInt64())\n {\n res << Json::valueToString(it->asInt64());\n }\n else if (it->isUInt())\n {\n res << Json::valueToString(it->asUInt());\n }\n else if (it->isUInt64())\n {\n res << Json::valueToString(it->asUInt64());\n }\n else if (it->isDouble())\n {\n res << Json::valueToString(it->asDouble());\n }\n else if (it->isString())\n {\n res << Json::valueToQuotedString(it->asString().c_str());\n }\n else if (it->isObject())\n {\n res << A3URLCommon::toArray_object(*it);\n }\n else if (it->isArray())\n {\n res << A3URLCommon::toArray_array(*it);\n }\n else\n {\n res << \"nil\";\n }\n }\n }\n res << \"]]\";\n\n return res.str();\n};\n\n\/\/A3URLCommon::toArray_object formats a JSON object to an ArmA 3 array\nstd::string A3URLCommon::toArray_object(const Json::Value &root)\n{\n std::stringstream res;\n\n res << \"[\\\"object\\\",[\";\n if (root.size() > 0)\n {\n for (Json::Value::const_iterator it = root.begin(); it != root.end(); it++)\n {\n if (it != root.begin())\n res << \",\";\n \n res << \"[\" << Json::valueToQuotedString(it.key().asString().c_str()) << \",\";\n\n if (it->isBool())\n {\n res << Json::valueToString(it->asBool());\n }\n else if (it->isInt())\n {\n res << Json::valueToString(it->asInt());\n }\n else if (it->isInt64())\n {\n res << Json::valueToString(it->asInt64());\n }\n else if (it->isUInt())\n {\n res << Json::valueToString(it->asUInt());\n }\n else if (it->isUInt64())\n {\n res << Json::valueToString(it->asUInt64());\n }\n else if (it->isDouble())\n {\n res << Json::valueToString(it->asDouble());\n }\n else if (it->isString())\n {\n res << Json::valueToQuotedString(it->asString().c_str());\n }\n else if (it->isObject())\n {\n res << A3URLCommon::toArray_object(*it);\n }\n else if (it->isArray())\n {\n res << A3URLCommon::toArray_array(*it);\n }\n else\n {\n res << \"nil\";\n }\n\n res << \"]\";\n }\n }\n\n res << \"]]\";\n\n return res.str();\n};\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#ifndef WEBSOCKET_CONSTANTS_HPP\n#define WEBSOCKET_CONSTANTS_HPP\n\n#ifndef __STDC_LIMIT_MACROS\n #define __STDC_LIMIT_MACROS\n#endif\n#include <stdint.h>\n\n#include <string>\n#include <vector>\n\n#include <boost\/shared_ptr.hpp>\n\n\/\/ Defaults\nnamespace websocketpp {\n\ttypedef std::vector<unsigned char> binary_string;\n\ttypedef boost::shared_ptr<binary_string> binary_string_ptr;\n\t\n\ttypedef std::string utf8_string;\n\ttypedef boost::shared_ptr<utf8_string> utf8_string_ptr;\n\t\n\tconst uint64_t DEFAULT_MAX_MESSAGE_SIZE = 0xFFFFFF; \/\/ ~16MB\n\t\n\tconst uint16_t DEFAULT_PORT = 80;\n\tconst uint16_t DEFAULT_SECURE_PORT = 443;\n\t\n\tinline uint16_t default_port(bool secure) {\n\t\treturn (secure ? DEFAULT_SECURE_PORT : DEFAULT_PORT);\n\t}\t\n\t\n\tnamespace session {\n\t\tnamespace state {\n\t\t\tenum value {\n\t\t\t\tCONNECTING = 0,\n\t\t\t\tOPEN = 1,\n\t\t\t\tCLOSING = 2,\n\t\t\t\tCLOSED = 3\n\t\t\t};\n\t\t}\n\t}\n\t\n\tnamespace close {\n\tnamespace status {\n\t\tenum value {\n\t\t\tINVALID_END = 999,\n\t\t\tNORMAL = 1000,\n\t\t\tGOING_AWAY = 1001,\n\t\t\tPROTOCOL_ERROR = 1002,\n\t\t\tUNSUPPORTED_DATA = 1003,\n\t\t\tRSV_ADHOC_1 = 1004,\n\t\t\tNO_STATUS = 1005,\n\t\t\tABNORMAL_CLOSE = 1006,\n\t\t\tINVALID_PAYLOAD = 1007,\n\t\t\tPOLICY_VIOLATION = 1008,\n\t\t\tMESSAGE_TOO_BIG = 1009,\n\t\t\tEXTENSION_REQUIRE = 1010,\n\t\t\tINTERNAL_ENDPOINT_ERROR = 1011,\n\t\t\tRSV_START = 1012,\n\t\t\tRSV_END = 2999,\n\t\t\tINVALID_START = 5000\n\t\t};\n\t\t\n\t\tinline bool reserved(value s) {\n\t\t\treturn ((s >= RSV_START && s <= RSV_END) || \n\t\t\t\t\ts == RSV_ADHOC_1);\n\t\t}\n\t\t\n\t\tinline bool invalid(value s) {\n\t\t\treturn ((s <= INVALID_END || s >= INVALID_START) || \n\t\t\t\t\ts == NO_STATUS || \n\t\t\t\t\ts == ABNORMAL_CLOSE);\n\t\t}\n\t\t\n\t\t\/\/ TODO functions for application ranges?\n\t} \/\/ namespace status\n\t} \/\/ namespace close\n\t\n namespace frame {\n \/\/ Opcodes are 4 bits\n \/\/ See spec section 5.2\n namespace opcode {\n enum value {\n CONTINUATION = 0x0,\n TEXT = 0x1,\n BINARY = 0x2,\n RSV3 = 0x3,\n RSV4 = 0x4,\n RSV5 = 0x5,\n RSV6 = 0x6,\n RSV7 = 0x7,\n CLOSE = 0x8,\n PING = 0x9,\n PONG = 0xA,\n CONTROL_RSVB = 0xB,\n CONTROL_RSVC = 0xC,\n CONTROL_RSVD = 0xD,\n CONTROL_RSVE = 0xE,\n CONTROL_RSVF = 0xF,\n };\n \n inline bool reserved(value v) {\n return (v >= RSV3 && v <= RSV7) || \n (v >= CONTROL_RSVB && v <= CONTROL_RSVF);\n }\n \n inline bool invalid(value v) {\n return (v > 0xF || v < 0);\n }\n \n inline bool is_control(value v) {\n return v >= 0x8;\n }\n }\n \n namespace limits {\n static const uint8_t PAYLOAD_SIZE_BASIC = 125;\n static const uint16_t PAYLOAD_SIZE_EXTENDED = 0xFFFF; \/\/ 2^16, 65535\n static const uint64_t PAYLOAD_SIZE_JUMBO = 0x7FFFFFFFFFFFFFFF;\/\/2^63\n }\n } \/\/ namespace frame\n}\n\n#endif \/\/ WEBSOCKET_CONSTANTS_HPP\n<commit_msg>adds a generic exception class for application errors<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#ifndef WEBSOCKET_CONSTANTS_HPP\n#define WEBSOCKET_CONSTANTS_HPP\n\n#ifndef __STDC_LIMIT_MACROS\n #define __STDC_LIMIT_MACROS\n#endif\n#include <stdint.h>\n\n#include <exception>\n#include <string>\n#include <vector>\n\n#include <boost\/shared_ptr.hpp>\n\n\/\/ Defaults\nnamespace websocketpp {\n\ttypedef std::vector<unsigned char> binary_string;\n\ttypedef boost::shared_ptr<binary_string> binary_string_ptr;\n\t\n\ttypedef std::string utf8_string;\n\ttypedef boost::shared_ptr<utf8_string> utf8_string_ptr;\n\t\n\tconst uint64_t DEFAULT_MAX_MESSAGE_SIZE = 0xFFFFFF; \/\/ ~16MB\n\t\n\tconst uint16_t DEFAULT_PORT = 80;\n\tconst uint16_t DEFAULT_SECURE_PORT = 443;\n\t\n\tinline uint16_t default_port(bool secure) {\n\t\treturn (secure ? DEFAULT_SECURE_PORT : DEFAULT_PORT);\n\t}\t\n\t\n\tnamespace session {\n\t\tnamespace state {\n\t\t\tenum value {\n\t\t\t\tCONNECTING = 0,\n\t\t\t\tOPEN = 1,\n\t\t\t\tCLOSING = 2,\n\t\t\t\tCLOSED = 3\n\t\t\t};\n\t\t}\n\t}\n\t\n\tnamespace close {\n\tnamespace status {\n\t\tenum value {\n\t\t\tINVALID_END = 999,\n\t\t\tNORMAL = 1000,\n\t\t\tGOING_AWAY = 1001,\n\t\t\tPROTOCOL_ERROR = 1002,\n\t\t\tUNSUPPORTED_DATA = 1003,\n\t\t\tRSV_ADHOC_1 = 1004,\n\t\t\tNO_STATUS = 1005,\n\t\t\tABNORMAL_CLOSE = 1006,\n\t\t\tINVALID_PAYLOAD = 1007,\n\t\t\tPOLICY_VIOLATION = 1008,\n\t\t\tMESSAGE_TOO_BIG = 1009,\n\t\t\tEXTENSION_REQUIRE = 1010,\n\t\t\tINTERNAL_ENDPOINT_ERROR = 1011,\n\t\t\tRSV_START = 1012,\n\t\t\tRSV_END = 2999,\n\t\t\tINVALID_START = 5000\n\t\t};\n\t\t\n\t\tinline bool reserved(value s) {\n\t\t\treturn ((s >= RSV_START && s <= RSV_END) || \n\t\t\t\t\ts == RSV_ADHOC_1);\n\t\t}\n\t\t\n\t\tinline bool invalid(value s) {\n\t\t\treturn ((s <= INVALID_END || s >= INVALID_START) || \n\t\t\t\t\ts == NO_STATUS || \n\t\t\t\t\ts == ABNORMAL_CLOSE);\n\t\t}\n\t\t\n\t\t\/\/ TODO functions for application ranges?\n\t} \/\/ namespace status\n\t} \/\/ namespace close\n\t\n namespace frame {\n \/\/ Opcodes are 4 bits\n \/\/ See spec section 5.2\n namespace opcode {\n enum value {\n CONTINUATION = 0x0,\n TEXT = 0x1,\n BINARY = 0x2,\n RSV3 = 0x3,\n RSV4 = 0x4,\n RSV5 = 0x5,\n RSV6 = 0x6,\n RSV7 = 0x7,\n CLOSE = 0x8,\n PING = 0x9,\n PONG = 0xA,\n CONTROL_RSVB = 0xB,\n CONTROL_RSVC = 0xC,\n CONTROL_RSVD = 0xD,\n CONTROL_RSVE = 0xE,\n CONTROL_RSVF = 0xF,\n };\n \n inline bool reserved(value v) {\n return (v >= RSV3 && v <= RSV7) || \n (v >= CONTROL_RSVB && v <= CONTROL_RSVF);\n }\n \n inline bool invalid(value v) {\n return (v > 0xF || v < 0);\n }\n \n inline bool is_control(value v) {\n return v >= 0x8;\n }\n }\n \n namespace limits {\n static const uint8_t PAYLOAD_SIZE_BASIC = 125;\n static const uint16_t PAYLOAD_SIZE_EXTENDED = 0xFFFF; \/\/ 2^16, 65535\n static const uint64_t PAYLOAD_SIZE_JUMBO = 0x7FFFFFFFFFFFFFFF;\/\/2^63\n }\n } \/\/ namespace frame\n \n \/\/ exception class for errors that should be propogated back to the user.\n namespace error {\n enum value {\n GENERIC = 0,\n \/\/ send attempted when endpoint write queue was full\n SEND_QUEUE_FULL = 1,\n PAYLOAD_VIOLATION = 2\n };\n }\n \n class exception : public std::exception {\n public:\t\n exception(const std::string& msg,\n error::value code = error::GENERIC) \n : m_msg(msg),m_code(code) {}\n ~exception() throw() {}\n \n virtual const char* what() const throw() {\n return m_msg.c_str();\n }\n \n error::value code() const throw() {\n return m_code;\n }\n \n std::string m_msg;\n error::value m_code;\n };\n}\n\n#endif \/\/ WEBSOCKET_CONSTANTS_HPP\n<|endoftext|>"} {"text":"<commit_before>#include \"config.h\"\n\nConfig* Config::getHandle() {\n\tstatic Config instance;\n\treturn &instance;\n}\n\nvoid Config::setMainConfigFile(const std::string& configFileName) {\n\tif (confname.empty())\n\t\tconfname = configFileName;\n}\n\nvoid Config::readConfig() {\n\tconfig = readConfig(confname, std::ifstream(confname));\n\tfor (auto callback : notifyList)\n\t\tcallback();\n}\n\nenum ConfigState { CONFIG_BLOCK, CONFIG_KEY, CONFIG_VALUE, CONFIG_VALUE_NEXT, CONFIG_VALUE_VAR, CONFIG_VALUE_STR, CONFIG_VALUE_STR_ESCAPED };\n\/\/ This enum is simply an implementation detail for the configuration parser; hence it is placed here instead of the header file.\n\nstd::unordered_multimap<std::string, std::unordered_map<std::string, std::string>> Config::readConfig(const std::string& filename, std::istream&& configData) {\n\tConfigState state = CONFIG_BLOCK;\n\tunsigned int lineNum = 1;\n\tLogManager* logger = LogManager::getHandle();\n\tstd::string blockName, key, value, valueVar;\n\tstd::unordered_map<std::string, std::string> blockValues;\n\tstd::unordered_multimap<std::string, std::unordered_map<std::string, std::string>> localConfig;\n\twhile (configData.good()) {\n\t\tchar nextChar = configData.get();\n\t\tif (nextChar == std::istream::traits_type::eof())\n\t\t\tbreak;\n\t\tif (nextChar == '\\n')\n\t\t\tlineNum++;\n\t\tif (state == CONFIG_BLOCK) {\n\t\t\tif (nextChar == '{') {\n\t\t\t\tif (blockName.empty())\n\t\t\t\t\tthrow ConfigError (filename, lineNum, \"A block without a name was opened.\");\n\t\t\t\tstate = CONFIG_KEY;\n\t\t\t} else if (nextChar == '}')\n\t\t\t\tthrow ConfigError (filename, lineNum, \"A closing brace could not be mached to an open block.\");\n\t\t\telse if (nextChar == '#') {\n\t\t\t\twhile (configData.good() && configData.get() != '\\n') {}\n\t\t\t\tlineNum++;\n\t\t\t} else if (nextChar != ' ' && nextChar != '\\t' && nextChar != '\\r' && nextChar != '\\n')\n\t\t\t\tblockName += nextChar;\n\t\t} else if (state == CONFIG_KEY) {\n\t\t\tif (nextChar == '#') {\n\t\t\t\twhile (configData.good() && configData.get() != '\\n') {}\n\t\t\t\tlineNum++;\n\t\t\t} else if (nextChar == '{')\n\t\t\t\tthrow ConfigError (filename, lineNum, \"A block was opened inside another block.\");\n\t\t\telse if (nextChar == '}') {\n\t\t\t\tif (blockValues.empty())\n\t\t\t\t\tthrow ConfigError (filename, lineNum, \"An empty block was defined. What was the point of that?\");\n\t\t\t\tif (!key.empty() || !value.empty())\n\t\t\t\t\tthrow ConfigError (filename, lineNum, \"A key-value pair was unfinished when the block was terminated.\");\n\t\t\t\tlocalConfig.insert(std::pair<std::string, std::unordered_map<std::string, std::string>> (blockName, blockValues));\n\t\t\t\tblockName.clear();\n\t\t\t\tblockValues.clear();\n\t\t\t\tlogger->log(LOG_ALL, \"config\", \"Block \" + blockName + \" read.\");\n\t\t\t\tstate = CONFIG_BLOCK;\n\t\t\t} else if (nextChar == ';')\n\t\t\t\tthrow ConfigError (filename, lineNum, \"A key was specified without a value.\");\n\t\t\telse if (nextChar == '=')\n\t\t\t\tstate = CONFIG_VALUE_NEXT;\n\t\t\telse if (nextChar != ' ' && nextChar != '\\t' && nextChar != '\\r' && nextChar != '\\n')\n\t\t\t\tkey += nextChar;\n\t\t} else if (state == CONFIG_VALUE) {\n\t\t\tif (nextChar == '#') {\n\t\t\t\twhile (configData.good() && configData.get() != '\\n') {}\n\t\t\t\tlineNum++;\n\t\t\t} else if (nextChar == ';') {\n\t\t\t\tblockValues.insert(std::pair<std::string, std::string> (key, value));\n\t\t\t\tkey.clear();\n\t\t\t\tvalue.clear();\n\t\t\t\tstate = CONFIG_KEY;\n\t\t\t} else if (nextChar == '+')\n\t\t\t\tstate = CONFIG_VALUE_NEXT;\n\t\t\telse\n\t\t\t\tthrow ConfigError (filename, lineNum, \"An unexpected character was encountered; expected ';' or '+' (perhaps you forgot to end or properly concatenate your value?).\");\n\t\t} else if (state == CONFIG_VALUE_NEXT) {\n\t\t\tif (nextChar == '#') {\n\t\t\t\twhile (configData.good() && configData.get() != '\\n') {}\n\t\t\t\tlineNum++;\n\t\t\t} else if (nextChar == '\"')\n\t\t\t\tstate = CONFIG_VALUE_STR;\n\t\t\telse if (nextChar != ' ' && nextChar != '\\t' && nextChar != '\\r' && nextChar != '\\n') {\n\t\t\t\tvalueVar += nextChar;\n\t\t\t\tstate = CONFIG_VALUE_VAR;\n\t\t\t}\n\t\t} else if (state == CONFIG_VALUE_VAR) {\n\t\t\tif (nextChar == '\"')\n\t\t\t\tthrow ConfigError (filename, lineNum, \"A string value was specified in the middle of a variable (perhaps you forgot to properly concatenate with '+'?).\");\n\t\t\telse if (nextChar == '{')\n\t\t\t\tthrow ConfigError (filename, lineNum, \"A block was opened inside another block.\");\n\t\t\telse if (nextChar == '}')\n\t\t\t\tthrow ConfigError (filename, lineNum, \"A key-value pair was unfinished when the block was terminated.\");\n\t\t\telse if (nextChar == ' ' || nextChar == '\\t' || nextChar == '\\r' || nextChar == '\\n' || nextChar == '+' || nextChar == ';') {\n\t\t\t\tauto keyIter = blockValues.find(valueVar);\n\t\t\t\tif (keyIter == blockValues.end())\n\t\t\t\t\tthrow ConfigError (filename, lineNum, \"The variable \" + valueVar + \" was specified, but did not match a variable already specified in the block.\");\n\t\t\t\tvalue += keyIter->second;\n\t\t\t\tvalueVar.clear();\n\t\t\t\tif (nextChar == ';') {\n\t\t\t\t\tstate = CONFIG_KEY;\n\t\t\t\t\tblockValues.insert(std::pair<std::string, std::string> (key, value));\n\t\t\t\t\tkey.clear();\n\t\t\t\t\tvalue.clear();\n\t\t\t\t} else if (nextChar == '+')\n\t\t\t\t\tstate = CONFIG_VALUE_NEXT;\n\t\t\t\telse\n\t\t\t\t\tstate = CONFIG_VALUE;\n\t\t\t} else\n\t\t\t\tvalueVar += nextChar;\n\t\t} else if (state == CONFIG_VALUE_STR) {\n\t\t\tif (nextChar == '\\\\')\n\t\t\t\tstate = CONFIG_VALUE_STR_ESCAPED;\n\t\t\telse if (nextChar == '\"')\n\t\t\t\tstate = CONFIG_VALUE;\n\t\t\telse\n\t\t\t\tvalue += nextChar;\n\t\t} else if (state == CONFIG_VALUE_STR_ESCAPED) {\n\t\t\tif (nextChar == '\\\\')\n\t\t\t\tvalue += '\\\\';\n\t\t\telse if (nextChar == 'n')\n\t\t\t\tvalue += '\\n';\n\t\t\telse if (nextChar == 't')\n\t\t\t\tvalue += '\\t';\n\t\t\telse if (nextChar == 'r')\n\t\t\t\tvalue += '\\r';\n\t\t\telse\n\t\t\t\tvalue += nextChar;\n\t\t\tstate = CONFIG_VALUE_STR;\n\t\t}\n\t}\n\tif (!blockValues.empty())\n\t\tthrow ConfigError (filename, lineNum, \"A block remained unterminated at the end of the file.\");\n\tstd::list<std::unordered_multimap<std::string, std::unordered_map<std::string, std::string>>> includedConfigs;\n\tfor (auto block : localConfig) {\n\t\tif (block.first == \"include\") {\n\t\t\tauto inclfIter = block.second.find(\"file\");\n\t\t\tif (inclfIter != block.second.end()) {\n\t\t\t\tstd::string name = inclfIter->second;\n\t\t\t\tlogger->log(LOG_ALL, \"config\", \"Reading included file \" + inclfIter->second);\n\t\t\t\tincludedConfigs.push_back(readConfig(inclfIter->second, std::ifstream(name)));\n\t\t\t} else {\n\t\t\t\tauto incleIter = block.second.find(\"executable\");\n\t\t\t\tif (incleIter != block.second.end()) {\n\t\t\t\t\tstd::string cmd = incleIter->second;\n\t\t\t\t\tlogger->log(LOG_ALL, \"config\", \"Getting configuration data from `\" + incleIter->second + \"`\");\n\t\t\t\t\tFILE* pipe = popen(cmd.c_str(), \"r\");\n\t\t\t\t\tif (!pipe)\n\t\t\t\t\t\tthrow ConfigError (cmd, 0, \"Could not open pipe to read output.\");\n\t\t\t\t\tchar buffer[256];\n\t\t\t\t\tstd::stringstream output;\n\t\t\t\t\twhile (!feof(pipe)) {\n\t\t\t\t\t\tif (fgets(buffer, 256, pipe) != NULL)\n\t\t\t\t\t\t\toutput << buffer;\n\t\t\t\t\t}\n\t\t\t\t\tpclose(pipe);\n\t\t\t\t\tincludedConfigs.push_back(readConfig(cmd, output));\n\t\t\t\t} else\n\t\t\t\t\tthrow ConfigError (filename, lineNum, \"An include block was present that contained neither a file nor an executable.\");\n\t\t\t}\n\t\t}\n\t}\n\tfor (auto includes : includedConfigs) {\n\t\tfor (auto conf : includes) {\n\t\t\tfor (auto block : conf)\n\t\t\t\tlocalConfig.insert(std::pair<std::string, std::unordered_map<std::string, std::string>> (block));\n\t\t}\n\t}\n\treturn localConfig;\n}\n\nvoid Config::addRehashNotify(std::function<void()> notifyCallback) {\n\tnotifyList.push_back(notifyCallback);\n}\n\nsize_t Config::blockCount(const std::string& block) const {\n\treturn config.count(block);\n}\n\nstd::list<std::unordered_map<std::string, std::string>> Config::getBlock(const std::string& block) const {\n\tstd::list<std::unordered_map<std::string, std::string>> blockList;\n\tstd::unordered_multimap<std::string, std::unordered_map<std::string, std::string>>::const_iterator startIter, endIter;\n\tstd::tie(startIter, endIter) = config.equal_range(block);\n\tfor (; startIter != endIter; ++startIter)\n\t\tblockList.push_back(startIter->second);\n\treturn blockList;\n}\n\nstd::unordered_map<std::string, std::string> Config::getSingleBlock(const std::string& block, const std::unordered_map<std::string, std::string>& conditions) const {\n\tstd::unordered_multimap<std::string, std::unordered_map<std::string, std::string>>::const_iterator startIter, endIter;\n\tstd::tie(startIter, endIter) = config.equal_range(block);\n\tfor (; startIter != endIter; ++startIter) {\n\t\tfor (auto check : conditions) {\n\t\t\tauto blockIter = startIter->second.find(check.first);\n\t\t\tif (blockIter == startIter->second.end())\n\t\t\t\tcontinue;\n\t\t\tif (check.second == blockIter->second)\n\t\t\t\treturn startIter->second;\n\t\t}\n\t}\n\treturn std::unordered_map<std::string, std::string> ();\n}\n\nstd::string Config::getValue(const std::string& block, const std::string& key) const {\n\tauto blockIter = config.find(block);\n\tif (blockIter == config.end())\n\t\treturn \"\";\n\tauto dataIter = blockIter->second.find(key);\n\tif (dataIter == blockIter->second.end())\n\t\treturn \"\";\n\treturn dataIter->second;\n}\n\nbool Config::getBoolValue(const std::string& block, const std::string& key) const {\n\tconst std::string& value = getValue(block, key);\n\tstd::string lowerValue;\n\tstd::transform(value.begin(), value.end(), std::back_inserter(lowerValue), ::tolower);\n\tif (lowerValue == \"yes\" || lowerValue == \"on\" || lowerValue == \"true\")\n\t\treturn true;\n\treturn false;\n}\n\nstd::list<std::string> Config::getAllValues(const std::string& block, const std::string& key) const {\n\tstd::list<std::string> valueList;\n\tstd::unordered_multimap<std::string, std::unordered_map<std::string, std::string>>::const_iterator startIter, endIter;\n\tstd::tie(startIter, endIter) = config.equal_range(block);\n\tfor (; startIter != endIter; ++startIter) {\n\t\tauto dataIter = startIter->second.find(key);\n\t\tif (dataIter == startIter->second.end())\n\t\t\tvalueList.push_back(\"\");\n\t\telse\n\t\t\tvalueList.push_back(dataIter->second);\n\t}\n\treturn valueList;\n}\n\nstd::list<bool> Config::getAllBoolValues(const std::string& block, const std::string& key) const {\n\tstd::list<bool> valueList;\n\tstd::unordered_multimap<std::string, std::unordered_map<std::string, std::string>>::const_iterator startIter, endIter;\n\tstd::tie(startIter, endIter) = config.equal_range(block);\n\tfor (std::string lowerValue; startIter != endIter; ++startIter) {\n\t\tauto dataIter = startIter->second.find(key);\n\t\tif (dataIter == startIter->second.end())\n\t\t\tvalueList.push_back(false);\n\t\telse {\n\t\t\tlowerValue.clear();\n\t\t\tstd::transform(dataIter->second.begin(), dataIter->second.end(), std::back_inserter(lowerValue), ::tolower);\n\t\t\tif (lowerValue == \"yes\" || lowerValue == \"on\" || lowerValue == \"true\")\n\t\t\t\tvalueList.push_back(true);\n\t\t\telse\n\t\t\t\tvalueList.push_back(false);\n\t\t}\n\t}\n\treturn valueList;\n}\n\nstatic bool Config::makeBool(const std::string& value) {\n\tstd::string lowerValue;\n\tstd::transform(value.begin(), value.end(), std::back_inserter(lowerValue), ::tolower);\n\tif (lowerValue == \"yes\" || lowerValue == \"on\" || lowerValue == \"true\")\n\t\treturn true;\n\treturn false;\n}\n\nConfig::Config() {}\n\nConfigError::ConfigError(const std::string& filename, unsigned int lineNum, const std::string& description) {\n\tstd::ostringstream descStr;\n\tdescStr << \"An error occurred reading the configuration from '\" << filename << \"' on line \" << lineNum << \": \" << description;\n\tdesc = descStr.str();\n}<commit_msg>Manually expand the resulting pair<commit_after>#include \"config.h\"\n\nConfig* Config::getHandle() {\n\tstatic Config instance;\n\treturn &instance;\n}\n\nvoid Config::setMainConfigFile(const std::string& configFileName) {\n\tif (confname.empty())\n\t\tconfname = configFileName;\n}\n\nvoid Config::readConfig() {\n\tconfig = readConfig(confname, std::ifstream(confname));\n\tfor (auto callback : notifyList)\n\t\tcallback();\n}\n\nenum ConfigState { CONFIG_BLOCK, CONFIG_KEY, CONFIG_VALUE, CONFIG_VALUE_NEXT, CONFIG_VALUE_VAR, CONFIG_VALUE_STR, CONFIG_VALUE_STR_ESCAPED };\n\/\/ This enum is simply an implementation detail for the configuration parser; hence it is placed here instead of the header file.\n\nstd::unordered_multimap<std::string, std::unordered_map<std::string, std::string>> Config::readConfig(const std::string& filename, std::istream&& configData) {\n\tConfigState state = CONFIG_BLOCK;\n\tunsigned int lineNum = 1;\n\tLogManager* logger = LogManager::getHandle();\n\tstd::string blockName, key, value, valueVar;\n\tstd::unordered_map<std::string, std::string> blockValues;\n\tstd::unordered_multimap<std::string, std::unordered_map<std::string, std::string>> localConfig;\n\twhile (configData.good()) {\n\t\tchar nextChar = configData.get();\n\t\tif (nextChar == std::istream::traits_type::eof())\n\t\t\tbreak;\n\t\tif (nextChar == '\\n')\n\t\t\tlineNum++;\n\t\tif (state == CONFIG_BLOCK) {\n\t\t\tif (nextChar == '{') {\n\t\t\t\tif (blockName.empty())\n\t\t\t\t\tthrow ConfigError (filename, lineNum, \"A block without a name was opened.\");\n\t\t\t\tstate = CONFIG_KEY;\n\t\t\t} else if (nextChar == '}')\n\t\t\t\tthrow ConfigError (filename, lineNum, \"A closing brace could not be mached to an open block.\");\n\t\t\telse if (nextChar == '#') {\n\t\t\t\twhile (configData.good() && configData.get() != '\\n') {}\n\t\t\t\tlineNum++;\n\t\t\t} else if (nextChar != ' ' && nextChar != '\\t' && nextChar != '\\r' && nextChar != '\\n')\n\t\t\t\tblockName += nextChar;\n\t\t} else if (state == CONFIG_KEY) {\n\t\t\tif (nextChar == '#') {\n\t\t\t\twhile (configData.good() && configData.get() != '\\n') {}\n\t\t\t\tlineNum++;\n\t\t\t} else if (nextChar == '{')\n\t\t\t\tthrow ConfigError (filename, lineNum, \"A block was opened inside another block.\");\n\t\t\telse if (nextChar == '}') {\n\t\t\t\tif (blockValues.empty())\n\t\t\t\t\tthrow ConfigError (filename, lineNum, \"An empty block was defined. What was the point of that?\");\n\t\t\t\tif (!key.empty() || !value.empty())\n\t\t\t\t\tthrow ConfigError (filename, lineNum, \"A key-value pair was unfinished when the block was terminated.\");\n\t\t\t\tlocalConfig.insert(std::pair<std::string, std::unordered_map<std::string, std::string>> (blockName, blockValues));\n\t\t\t\tblockName.clear();\n\t\t\t\tblockValues.clear();\n\t\t\t\tlogger->log(LOG_ALL, \"config\", \"Block \" + blockName + \" read.\");\n\t\t\t\tstate = CONFIG_BLOCK;\n\t\t\t} else if (nextChar == ';')\n\t\t\t\tthrow ConfigError (filename, lineNum, \"A key was specified without a value.\");\n\t\t\telse if (nextChar == '=')\n\t\t\t\tstate = CONFIG_VALUE_NEXT;\n\t\t\telse if (nextChar != ' ' && nextChar != '\\t' && nextChar != '\\r' && nextChar != '\\n')\n\t\t\t\tkey += nextChar;\n\t\t} else if (state == CONFIG_VALUE) {\n\t\t\tif (nextChar == '#') {\n\t\t\t\twhile (configData.good() && configData.get() != '\\n') {}\n\t\t\t\tlineNum++;\n\t\t\t} else if (nextChar == ';') {\n\t\t\t\tblockValues.insert(std::pair<std::string, std::string> (key, value));\n\t\t\t\tkey.clear();\n\t\t\t\tvalue.clear();\n\t\t\t\tstate = CONFIG_KEY;\n\t\t\t} else if (nextChar == '+')\n\t\t\t\tstate = CONFIG_VALUE_NEXT;\n\t\t\telse\n\t\t\t\tthrow ConfigError (filename, lineNum, \"An unexpected character was encountered; expected ';' or '+' (perhaps you forgot to end or properly concatenate your value?).\");\n\t\t} else if (state == CONFIG_VALUE_NEXT) {\n\t\t\tif (nextChar == '#') {\n\t\t\t\twhile (configData.good() && configData.get() != '\\n') {}\n\t\t\t\tlineNum++;\n\t\t\t} else if (nextChar == '\"')\n\t\t\t\tstate = CONFIG_VALUE_STR;\n\t\t\telse if (nextChar != ' ' && nextChar != '\\t' && nextChar != '\\r' && nextChar != '\\n') {\n\t\t\t\tvalueVar += nextChar;\n\t\t\t\tstate = CONFIG_VALUE_VAR;\n\t\t\t}\n\t\t} else if (state == CONFIG_VALUE_VAR) {\n\t\t\tif (nextChar == '\"')\n\t\t\t\tthrow ConfigError (filename, lineNum, \"A string value was specified in the middle of a variable (perhaps you forgot to properly concatenate with '+'?).\");\n\t\t\telse if (nextChar == '{')\n\t\t\t\tthrow ConfigError (filename, lineNum, \"A block was opened inside another block.\");\n\t\t\telse if (nextChar == '}')\n\t\t\t\tthrow ConfigError (filename, lineNum, \"A key-value pair was unfinished when the block was terminated.\");\n\t\t\telse if (nextChar == ' ' || nextChar == '\\t' || nextChar == '\\r' || nextChar == '\\n' || nextChar == '+' || nextChar == ';') {\n\t\t\t\tauto keyIter = blockValues.find(valueVar);\n\t\t\t\tif (keyIter == blockValues.end())\n\t\t\t\t\tthrow ConfigError (filename, lineNum, \"The variable \" + valueVar + \" was specified, but did not match a variable already specified in the block.\");\n\t\t\t\tvalue += keyIter->second;\n\t\t\t\tvalueVar.clear();\n\t\t\t\tif (nextChar == ';') {\n\t\t\t\t\tstate = CONFIG_KEY;\n\t\t\t\t\tblockValues.insert(std::pair<std::string, std::string> (key, value));\n\t\t\t\t\tkey.clear();\n\t\t\t\t\tvalue.clear();\n\t\t\t\t} else if (nextChar == '+')\n\t\t\t\t\tstate = CONFIG_VALUE_NEXT;\n\t\t\t\telse\n\t\t\t\t\tstate = CONFIG_VALUE;\n\t\t\t} else\n\t\t\t\tvalueVar += nextChar;\n\t\t} else if (state == CONFIG_VALUE_STR) {\n\t\t\tif (nextChar == '\\\\')\n\t\t\t\tstate = CONFIG_VALUE_STR_ESCAPED;\n\t\t\telse if (nextChar == '\"')\n\t\t\t\tstate = CONFIG_VALUE;\n\t\t\telse\n\t\t\t\tvalue += nextChar;\n\t\t} else if (state == CONFIG_VALUE_STR_ESCAPED) {\n\t\t\tif (nextChar == '\\\\')\n\t\t\t\tvalue += '\\\\';\n\t\t\telse if (nextChar == 'n')\n\t\t\t\tvalue += '\\n';\n\t\t\telse if (nextChar == 't')\n\t\t\t\tvalue += '\\t';\n\t\t\telse if (nextChar == 'r')\n\t\t\t\tvalue += '\\r';\n\t\t\telse\n\t\t\t\tvalue += nextChar;\n\t\t\tstate = CONFIG_VALUE_STR;\n\t\t}\n\t}\n\tif (!blockValues.empty())\n\t\tthrow ConfigError (filename, lineNum, \"A block remained unterminated at the end of the file.\");\n\tstd::list<std::unordered_multimap<std::string, std::unordered_map<std::string, std::string>>> includedConfigs;\n\tfor (auto block : localConfig) {\n\t\tif (block.first == \"include\") {\n\t\t\tauto inclfIter = block.second.find(\"file\");\n\t\t\tif (inclfIter != block.second.end()) {\n\t\t\t\tstd::string name = inclfIter->second;\n\t\t\t\tlogger->log(LOG_ALL, \"config\", \"Reading included file \" + inclfIter->second);\n\t\t\t\tincludedConfigs.push_back(readConfig(inclfIter->second, std::ifstream(name)));\n\t\t\t} else {\n\t\t\t\tauto incleIter = block.second.find(\"executable\");\n\t\t\t\tif (incleIter != block.second.end()) {\n\t\t\t\t\tstd::string cmd = incleIter->second;\n\t\t\t\t\tlogger->log(LOG_ALL, \"config\", \"Getting configuration data from `\" + incleIter->second + \"`\");\n\t\t\t\t\tFILE* pipe = popen(cmd.c_str(), \"r\");\n\t\t\t\t\tif (!pipe)\n\t\t\t\t\t\tthrow ConfigError (cmd, 0, \"Could not open pipe to read output.\");\n\t\t\t\t\tchar buffer[256];\n\t\t\t\t\tstd::stringstream output;\n\t\t\t\t\twhile (!feof(pipe)) {\n\t\t\t\t\t\tif (fgets(buffer, 256, pipe) != NULL)\n\t\t\t\t\t\t\toutput << buffer;\n\t\t\t\t\t}\n\t\t\t\t\tpclose(pipe);\n\t\t\t\t\tincludedConfigs.push_back(readConfig(cmd, output));\n\t\t\t\t} else\n\t\t\t\t\tthrow ConfigError (filename, lineNum, \"An include block was present that contained neither a file nor an executable.\");\n\t\t\t}\n\t\t}\n\t}\n\tfor (auto includes : includedConfigs) {\n\t\tfor (auto conf : includes) {\n\t\t\tfor (auto block : conf)\n\t\t\t\tlocalConfig.insert(std::pair<std::string, std::unordered_map<std::string, std::string>> (block.first, block.second));\n\t\t}\n\t}\n\treturn localConfig;\n}\n\nvoid Config::addRehashNotify(std::function<void()> notifyCallback) {\n\tnotifyList.push_back(notifyCallback);\n}\n\nsize_t Config::blockCount(const std::string& block) const {\n\treturn config.count(block);\n}\n\nstd::list<std::unordered_map<std::string, std::string>> Config::getBlock(const std::string& block) const {\n\tstd::list<std::unordered_map<std::string, std::string>> blockList;\n\tstd::unordered_multimap<std::string, std::unordered_map<std::string, std::string>>::const_iterator startIter, endIter;\n\tstd::tie(startIter, endIter) = config.equal_range(block);\n\tfor (; startIter != endIter; ++startIter)\n\t\tblockList.push_back(startIter->second);\n\treturn blockList;\n}\n\nstd::unordered_map<std::string, std::string> Config::getSingleBlock(const std::string& block, const std::unordered_map<std::string, std::string>& conditions) const {\n\tstd::unordered_multimap<std::string, std::unordered_map<std::string, std::string>>::const_iterator startIter, endIter;\n\tstd::tie(startIter, endIter) = config.equal_range(block);\n\tfor (; startIter != endIter; ++startIter) {\n\t\tfor (auto check : conditions) {\n\t\t\tauto blockIter = startIter->second.find(check.first);\n\t\t\tif (blockIter == startIter->second.end())\n\t\t\t\tcontinue;\n\t\t\tif (check.second == blockIter->second)\n\t\t\t\treturn startIter->second;\n\t\t}\n\t}\n\treturn std::unordered_map<std::string, std::string> ();\n}\n\nstd::string Config::getValue(const std::string& block, const std::string& key) const {\n\tauto blockIter = config.find(block);\n\tif (blockIter == config.end())\n\t\treturn \"\";\n\tauto dataIter = blockIter->second.find(key);\n\tif (dataIter == blockIter->second.end())\n\t\treturn \"\";\n\treturn dataIter->second;\n}\n\nbool Config::getBoolValue(const std::string& block, const std::string& key) const {\n\tconst std::string& value = getValue(block, key);\n\tstd::string lowerValue;\n\tstd::transform(value.begin(), value.end(), std::back_inserter(lowerValue), ::tolower);\n\tif (lowerValue == \"yes\" || lowerValue == \"on\" || lowerValue == \"true\")\n\t\treturn true;\n\treturn false;\n}\n\nstd::list<std::string> Config::getAllValues(const std::string& block, const std::string& key) const {\n\tstd::list<std::string> valueList;\n\tstd::unordered_multimap<std::string, std::unordered_map<std::string, std::string>>::const_iterator startIter, endIter;\n\tstd::tie(startIter, endIter) = config.equal_range(block);\n\tfor (; startIter != endIter; ++startIter) {\n\t\tauto dataIter = startIter->second.find(key);\n\t\tif (dataIter == startIter->second.end())\n\t\t\tvalueList.push_back(\"\");\n\t\telse\n\t\t\tvalueList.push_back(dataIter->second);\n\t}\n\treturn valueList;\n}\n\nstd::list<bool> Config::getAllBoolValues(const std::string& block, const std::string& key) const {\n\tstd::list<bool> valueList;\n\tstd::unordered_multimap<std::string, std::unordered_map<std::string, std::string>>::const_iterator startIter, endIter;\n\tstd::tie(startIter, endIter) = config.equal_range(block);\n\tfor (std::string lowerValue; startIter != endIter; ++startIter) {\n\t\tauto dataIter = startIter->second.find(key);\n\t\tif (dataIter == startIter->second.end())\n\t\t\tvalueList.push_back(false);\n\t\telse {\n\t\t\tlowerValue.clear();\n\t\t\tstd::transform(dataIter->second.begin(), dataIter->second.end(), std::back_inserter(lowerValue), ::tolower);\n\t\t\tif (lowerValue == \"yes\" || lowerValue == \"on\" || lowerValue == \"true\")\n\t\t\t\tvalueList.push_back(true);\n\t\t\telse\n\t\t\t\tvalueList.push_back(false);\n\t\t}\n\t}\n\treturn valueList;\n}\n\nstatic bool Config::makeBool(const std::string& value) {\n\tstd::string lowerValue;\n\tstd::transform(value.begin(), value.end(), std::back_inserter(lowerValue), ::tolower);\n\tif (lowerValue == \"yes\" || lowerValue == \"on\" || lowerValue == \"true\")\n\t\treturn true;\n\treturn false;\n}\n\nConfig::Config() {}\n\nConfigError::ConfigError(const std::string& filename, unsigned int lineNum, const std::string& description) {\n\tstd::ostringstream descStr;\n\tdescStr << \"An error occurred reading the configuration from '\" << filename << \"' on line \" << lineNum << \": \" << description;\n\tdesc = descStr.str();\n}<|endoftext|>"} {"text":"<commit_before>#include <wx\/fileconf.h>\n\n#include \"config.h\"\n\nConfig appConfig;\n\nConfig::Config() {\n}\n\nConfig::~Config() {\n}\n\n\/\/ FIXME - i hate to use this\n\/\/ This is a macro that will allocate and deallocate the wxConfig, since\n\/\/ our app crashes if we let it live too long (for some reason). This\n\/\/ is a temporary hack, which should be fixed ASAP.\n#define CFG_OP(cfg,op) \\\n\twxFileConfig* cfg = new wxFileConfig(_T(\"bzlauncher\")); \\\n\t{ op } while(0); \\\n\tdelete cfg; \\\n\tcfg = NULL;\n\nwxString Config::getBZFlagCommand(const wxString& proto) const {\n\t\/\/ first try bzflag\/proto (eg bzflag\/bzfs0026)\n\t\/\/ then try bzflag\/default\n\twxString key = wxString::Format(_T(\"bzflag\/%s\"), proto.Lower().c_str());\n\twxString cmd;\n\n\tCFG_OP(cfg,\n\t\tif(! cfg->Read(key, &cmd)) {\n\t\t\tif(! cfg->Read(_T(\"bzflag\/default\"), &cmd)) {\n\t\t\t\treturn _T(\"\");\n\t\t\t}\n\t\t}\n\t);\n\n\treturn cmd;\n}\n\n\nvoid Config::setBZFlagCommand(const wxString& cmd, const wxString& proto) {\n\tCFG_OP(cfg, cfg->Write(wxString::Format(_T(\"bzflag\/%s\"), proto.c_str()), cmd););\n}\n\nint Config::getSortMode() const {\n\tint mode;\n\tCFG_OP(cfg, mode = cfg->Read(_T(\"window\/sortmode\"), -4); );\n\treturn mode;\n}\n\nvoid Config::setSortMode(int s) {\n\tCFG_OP(cfg, cfg->Write(_T(\"window\/sortmode\"), s); );\n}\n\nwxRect Config::getWindowDimensions() const {\n\twxRect wanted; \n\n\tCFG_OP(cfg,\n\t\twanted.x = cfg->Read(_T(\"window\/x\"), 10);\n\t\twanted.y = cfg->Read(_T(\"window\/y\"), 10);\n\t\twanted.width = cfg->Read(_T(\"window\/w\"), 600);\n\t\twanted.height = cfg->Read(_T(\"window\/h\"), 600);\n\t);\n\treturn wanted;\n}\n\nvoid Config::setWindowDimensions(wxRect r) {\n\tCFG_OP(cfg,\n\t\tcfg->Write(_T(\"window\/x\"), r.x);\n\t\tcfg->Write(_T(\"window\/y\"), r.y);\n\t\tcfg->Write(_T(\"window\/h\"), r.height);\n\t\tcfg->Write(_T(\"window\/w\"), r.width);\n\t);\n}\n\nwxString Config::getColumnName(ColType t) const {\n\tstatic const wxString names [] = {\n\t\t_T(\"server\"),\n\t\t_T(\"name\"),\n\t\t_T(\"type\"),\n\t\t_T(\"players\"),\n\t\t_T(\"ping\"),\n\t\t_T(\"favorite\")\n\t};\n\n\treturn names[t];\n}\n\nwxString Config::getColumnKey(ColType type) const {\n\twxString key;\n\tkey += _T(\"window\/col_\");\n\tkey += this->getColumnName(type);\n\tkey += _T(\"_width\");\n\treturn key;\n}\n\nint Config::getColumnDefaultWidth(ColType t) const {\n\tconst int widths[] = {\n\t\t157,\n\t\t300,\n\t\t47,\n\t\t30,\n\t\t46,\n\t\t46\n\t};\n\n\treturn widths[t];\n}\n\nint Config::getColumnWidth(ColType type) const {\n\tint w;\n\twxString key = this->getColumnKey(type);\n\tCFG_OP(cfg,\n\t\tw = cfg->Read(key, this->getColumnDefaultWidth(type));\n\t);\n\treturn w;\n}\n\nvoid Config::setColumnWidth(ColType type, int w) {\n\twxString key = this->getColumnKey(type);\n\tCFG_OP(cfg, cfg->Write(key,w););\n}\n\nwxArrayString Config::getFavorites() const {\n\twxString str;\n\twxArrayString list;\n\tint count = 0;\n\n\tCFG_OP(cfg,\n\t\twhile(cfg->Read(wxString::Format(_T(\"favorites\/%d\"), count), &str)) {\n\t\t\tlist.Add(str);\n\t\t\tcount++;\n\t\t}\n\t);\n\n\treturn list;\n}\n\nvoid Config::setFavorites(const wxArrayString& list) {\n\tCFG_OP(cfg,\n\t\tfor(unsigned int i = 0; i < list.GetCount(); i++) \n\t\t\tcfg->Write(wxString::Format(_T(\"favorites\/%d\"), i), list.Item(i));\n\t);\n}\n\nwxString Config::getListServerURL(int n) const {\n\tint count = 0;\n\twxString str;\n\tCFG_OP(cfg,\n\t\twhile(cfg->Read(wxString::Format(_T(\"listserver\/%d\"), count), &str)) {\n\t\t\tif(count == n) return str;\n\t\t\tcount++;\n\t\t}\n\t);\n\n\tif(count == 0 && n == 1) \n\t\treturn _T(\"http:\/\/my.bzflag.org\/db?action=LIST\");\n\telse\n\t\treturn _T(\"http:\/\/bzstats.strayer.de\/stuff\/listserver.php?protocol=NEW\");\n}\n<commit_msg>Changed the URL for strayers listserver<commit_after>#include <wx\/fileconf.h>\n\n#include \"config.h\"\n\nConfig appConfig;\n\nConfig::Config() {\n}\n\nConfig::~Config() {\n}\n\n\/\/ FIXME - i hate to use this\n\/\/ This is a macro that will allocate and deallocate the wxConfig, since\n\/\/ our app crashes if we let it live too long (for some reason). This\n\/\/ is a temporary hack, which should be fixed ASAP.\n#define CFG_OP(cfg,op) \\\n\twxFileConfig* cfg = new wxFileConfig(_T(\"bzlauncher\")); \\\n\t{ op } while(0); \\\n\tdelete cfg; \\\n\tcfg = NULL;\n\nwxString Config::getBZFlagCommand(const wxString& proto) const {\n\t\/\/ first try bzflag\/proto (eg bzflag\/bzfs0026)\n\t\/\/ then try bzflag\/default\n\twxString key = wxString::Format(_T(\"bzflag\/%s\"), proto.Lower().c_str());\n\twxString cmd;\n\n\tCFG_OP(cfg,\n\t\tif(! cfg->Read(key, &cmd)) {\n\t\t\tif(! cfg->Read(_T(\"bzflag\/default\"), &cmd)) {\n\t\t\t\treturn _T(\"\");\n\t\t\t}\n\t\t}\n\t);\n\n\treturn cmd;\n}\n\n\nvoid Config::setBZFlagCommand(const wxString& cmd, const wxString& proto) {\n\tCFG_OP(cfg, cfg->Write(wxString::Format(_T(\"bzflag\/%s\"), proto.c_str()), cmd););\n}\n\nint Config::getSortMode() const {\n\tint mode;\n\tCFG_OP(cfg, mode = cfg->Read(_T(\"window\/sortmode\"), -4); );\n\treturn mode;\n}\n\nvoid Config::setSortMode(int s) {\n\tCFG_OP(cfg, cfg->Write(_T(\"window\/sortmode\"), s); );\n}\n\nwxRect Config::getWindowDimensions() const {\n\twxRect wanted; \n\n\tCFG_OP(cfg,\n\t\twanted.x = cfg->Read(_T(\"window\/x\"), 10);\n\t\twanted.y = cfg->Read(_T(\"window\/y\"), 10);\n\t\twanted.width = cfg->Read(_T(\"window\/w\"), 600);\n\t\twanted.height = cfg->Read(_T(\"window\/h\"), 600);\n\t);\n\treturn wanted;\n}\n\nvoid Config::setWindowDimensions(wxRect r) {\n\tCFG_OP(cfg,\n\t\tcfg->Write(_T(\"window\/x\"), r.x);\n\t\tcfg->Write(_T(\"window\/y\"), r.y);\n\t\tcfg->Write(_T(\"window\/h\"), r.height);\n\t\tcfg->Write(_T(\"window\/w\"), r.width);\n\t);\n}\n\nwxString Config::getColumnName(ColType t) const {\n\tstatic const wxString names [] = {\n\t\t_T(\"server\"),\n\t\t_T(\"name\"),\n\t\t_T(\"type\"),\n\t\t_T(\"players\"),\n\t\t_T(\"ping\"),\n\t\t_T(\"favorite\")\n\t};\n\n\treturn names[t];\n}\n\nwxString Config::getColumnKey(ColType type) const {\n\twxString key;\n\tkey += _T(\"window\/col_\");\n\tkey += this->getColumnName(type);\n\tkey += _T(\"_width\");\n\treturn key;\n}\n\nint Config::getColumnDefaultWidth(ColType t) const {\n\tconst int widths[] = {\n\t\t157,\n\t\t300,\n\t\t47,\n\t\t30,\n\t\t46,\n\t\t46\n\t};\n\n\treturn widths[t];\n}\n\nint Config::getColumnWidth(ColType type) const {\n\tint w;\n\twxString key = this->getColumnKey(type);\n\tCFG_OP(cfg,\n\t\tw = cfg->Read(key, this->getColumnDefaultWidth(type));\n\t);\n\treturn w;\n}\n\nvoid Config::setColumnWidth(ColType type, int w) {\n\twxString key = this->getColumnKey(type);\n\tCFG_OP(cfg, cfg->Write(key,w););\n}\n\nwxArrayString Config::getFavorites() const {\n\twxString str;\n\twxArrayString list;\n\tint count = 0;\n\n\tCFG_OP(cfg,\n\t\twhile(cfg->Read(wxString::Format(_T(\"favorites\/%d\"), count), &str)) {\n\t\t\tlist.Add(str);\n\t\t\tcount++;\n\t\t}\n\t);\n\n\treturn list;\n}\n\nvoid Config::setFavorites(const wxArrayString& list) {\n\tCFG_OP(cfg,\n\t\tfor(unsigned int i = 0; i < list.GetCount(); i++) \n\t\t\tcfg->Write(wxString::Format(_T(\"favorites\/%d\"), i), list.Item(i));\n\t);\n}\n\nwxString Config::getListServerURL(int n) const {\n\tint count = 0;\n\twxString str;\n\tCFG_OP(cfg,\n\t\twhile(cfg->Read(wxString::Format(_T(\"listserver\/%d\"), count), &str)) {\n\t\t\tif(count == n) return str;\n\t\t\tcount++;\n\t\t}\n\t);\n\n\tif(count == 0 && n == 1) \n\t\treturn _T(\"http:\/\/my.bzflag.org\/db?action=LIST\");\n\telse\n\t\treturn _T(\"http:\/\/bzstats.strayer.de\/stuff\/listserver.php\");\n}\n<|endoftext|>"} {"text":"<commit_before>#include \"context.hh\"\n\n#include \"alias_registry.hh\"\n#include \"client.hh\"\n#include \"user_interface.hh\"\n#include \"register_manager.hh\"\n#include \"window.hh\"\n\nnamespace Kakoune\n{\n\nContext::~Context() = default;\n\nContext::Context(InputHandler& input_handler, SelectionList selections,\n Flags flags, String name)\n : m_input_handler{&input_handler},\n m_selections{std::move(selections)},\n m_flags(flags),\n m_name(std::move(name))\n{}\n\nContext::Context(EmptyContextFlag) {}\n\nBuffer& Context::buffer() const\n{\n if (not has_buffer())\n throw runtime_error(\"no buffer in context\");\n return const_cast<Buffer&>((*m_selections).buffer());\n}\n\nWindow& Context::window() const\n{\n if (not has_window())\n throw runtime_error(\"no window in context\");\n return *m_window;\n}\n\nInputHandler& Context::input_handler() const\n{\n if (not has_input_handler())\n throw runtime_error(\"no input handler in context\");\n return *m_input_handler;\n}\n\nClient& Context::client() const\n{\n if (not has_client())\n throw runtime_error(\"no client in context\");\n return *m_client;\n}\n\nUserInterface& Context::ui() const\n{\n if (not has_ui())\n throw runtime_error(\"no user interface in context\");\n return client().ui();\n}\n\nScope& Context::scope() const\n{\n if (has_window())\n return window();\n if (has_buffer())\n return buffer();\n return GlobalScope::instance();\n}\n\nvoid Context::set_client(Client& client)\n{\n kak_assert(not has_client());\n m_client.reset(&client);\n}\n\nvoid Context::set_window(Window& window)\n{\n kak_assert(&window.buffer() == &buffer());\n m_window.reset(&window);\n}\n\nvoid Context::print_status(DisplayLine status) const\n{\n if (has_client())\n client().print_status(std::move(status));\n}\n\nvoid Context::push_jump()\n{\n const SelectionList& jump = selections();\n if (m_current_jump != m_jump_list.end())\n {\n auto begin = m_current_jump;\n if (&buffer() != &begin->buffer() or *begin != jump)\n ++begin;\n m_jump_list.erase(begin, m_jump_list.end());\n }\n m_jump_list.erase(std::remove(begin(m_jump_list), end(m_jump_list), jump),\n end(m_jump_list));\n m_jump_list.push_back(jump);\n m_current_jump = m_jump_list.end();\n}\n\nvoid Context::drop_jump()\n{\n if (not m_jump_list.empty())\n m_jump_list.pop_back();\n m_current_jump = m_jump_list.end();\n}\n\nconst SelectionList& Context::jump_forward()\n{\n if (m_current_jump != m_jump_list.end() and\n m_current_jump + 1 != m_jump_list.end())\n {\n SelectionList& res = *++m_current_jump;\n res.update();\n return res;\n }\n throw runtime_error(\"no next jump\");\n}\n\nconst SelectionList& Context::jump_backward()\n{\n if (m_current_jump != m_jump_list.end() and\n *m_current_jump != selections())\n {\n push_jump();\n SelectionList& res = *--m_current_jump;\n res.update();\n return res;\n }\n if (m_current_jump != m_jump_list.begin())\n {\n if (m_current_jump == m_jump_list.end())\n {\n push_jump();\n --m_current_jump;\n if (m_current_jump == m_jump_list.begin())\n throw runtime_error(\"no previous jump\");\n }\n SelectionList& res = *--m_current_jump;\n res.update();\n return res;\n }\n throw runtime_error(\"no previous jump\");\n}\n\nvoid Context::forget_jumps_to_buffer(Buffer& buffer)\n{\n for (auto it = m_jump_list.begin(); it != m_jump_list.end();)\n {\n if (&it->buffer() == &buffer)\n {\n if (it < m_current_jump)\n --m_current_jump;\n else if (it == m_current_jump)\n m_current_jump = m_jump_list.end()-1;\n\n it = m_jump_list.erase(it);\n }\n else\n ++it;\n }\n}\n\nvoid Context::change_buffer(Buffer& buffer)\n{\n if (&buffer == &this->buffer())\n return;\n\n if (m_edition_level > 0)\n this->buffer().commit_undo_group();\n\n m_window.reset();\n if (has_client())\n client().change_buffer(buffer);\n else\n m_selections = SelectionList{buffer, Selection{}};\n if (has_input_handler())\n input_handler().reset_normal_mode();\n}\n\nSelectionList& Context::selections()\n{\n if (not m_selections)\n throw runtime_error(\"no selections in context\");\n (*m_selections).update();\n return *m_selections;\n}\n\nSelectionList& Context::selections_write_only()\n{\n if (not m_selections)\n throw runtime_error(\"no selections in context\");\n return *m_selections;\n}\n\nconst SelectionList& Context::selections() const\n{\n return const_cast<Context&>(*this).selections();\n}\n\nVector<String> Context::selections_content() const\n{\n auto& buf = buffer();\n Vector<String> contents;\n for (auto& sel : selections())\n contents.push_back(buf.string(sel.min(), buf.char_next(sel.max())));\n return contents;\n}\n\nvoid Context::begin_edition()\n{\n if (m_edition_level >= 0)\n ++m_edition_level;\n}\n\nvoid Context::end_edition()\n{\n if (m_edition_level < 0)\n return;\n\n kak_assert(m_edition_level != 0);\n if (m_edition_level == 1)\n buffer().commit_undo_group();\n\n --m_edition_level;\n}\n\nStringView Context::main_sel_register_value(StringView reg) const\n{\n auto strings = RegisterManager::instance()[reg].values(*this);\n size_t index = m_selections ? (*m_selections).main_index() : 0;\n if (strings.size() <= index)\n index = strings.size() - 1;\n return strings[index];\n}\n\n}\n<commit_msg>Tweak Context::push_jump implementation, simplify code<commit_after>#include \"context.hh\"\n\n#include \"alias_registry.hh\"\n#include \"client.hh\"\n#include \"user_interface.hh\"\n#include \"register_manager.hh\"\n#include \"window.hh\"\n\nnamespace Kakoune\n{\n\nContext::~Context() = default;\n\nContext::Context(InputHandler& input_handler, SelectionList selections,\n Flags flags, String name)\n : m_input_handler{&input_handler},\n m_selections{std::move(selections)},\n m_flags(flags),\n m_name(std::move(name))\n{}\n\nContext::Context(EmptyContextFlag) {}\n\nBuffer& Context::buffer() const\n{\n if (not has_buffer())\n throw runtime_error(\"no buffer in context\");\n return const_cast<Buffer&>((*m_selections).buffer());\n}\n\nWindow& Context::window() const\n{\n if (not has_window())\n throw runtime_error(\"no window in context\");\n return *m_window;\n}\n\nInputHandler& Context::input_handler() const\n{\n if (not has_input_handler())\n throw runtime_error(\"no input handler in context\");\n return *m_input_handler;\n}\n\nClient& Context::client() const\n{\n if (not has_client())\n throw runtime_error(\"no client in context\");\n return *m_client;\n}\n\nUserInterface& Context::ui() const\n{\n if (not has_ui())\n throw runtime_error(\"no user interface in context\");\n return client().ui();\n}\n\nScope& Context::scope() const\n{\n if (has_window())\n return window();\n if (has_buffer())\n return buffer();\n return GlobalScope::instance();\n}\n\nvoid Context::set_client(Client& client)\n{\n kak_assert(not has_client());\n m_client.reset(&client);\n}\n\nvoid Context::set_window(Window& window)\n{\n kak_assert(&window.buffer() == &buffer());\n m_window.reset(&window);\n}\n\nvoid Context::print_status(DisplayLine status) const\n{\n if (has_client())\n client().print_status(std::move(status));\n}\n\nvoid Context::push_jump()\n{\n const SelectionList& jump = selections();\n if (m_current_jump != m_jump_list.end())\n m_jump_list.erase(m_current_jump+1, m_jump_list.end());\n m_jump_list.erase(std::remove(begin(m_jump_list), end(m_jump_list), jump),\n end(m_jump_list));\n m_jump_list.push_back(jump);\n m_current_jump = m_jump_list.end();\n}\n\nvoid Context::drop_jump()\n{\n if (not m_jump_list.empty())\n m_jump_list.pop_back();\n m_current_jump = m_jump_list.end();\n}\n\nconst SelectionList& Context::jump_forward()\n{\n if (m_current_jump != m_jump_list.end() and\n m_current_jump + 1 != m_jump_list.end())\n {\n SelectionList& res = *++m_current_jump;\n res.update();\n return res;\n }\n throw runtime_error(\"no next jump\");\n}\n\nconst SelectionList& Context::jump_backward()\n{\n if (m_current_jump != m_jump_list.end() and\n *m_current_jump != selections())\n {\n push_jump();\n SelectionList& res = *--m_current_jump;\n res.update();\n return res;\n }\n if (m_current_jump != m_jump_list.begin())\n {\n if (m_current_jump == m_jump_list.end())\n {\n push_jump();\n --m_current_jump;\n if (m_current_jump == m_jump_list.begin())\n throw runtime_error(\"no previous jump\");\n }\n SelectionList& res = *--m_current_jump;\n res.update();\n return res;\n }\n throw runtime_error(\"no previous jump\");\n}\n\nvoid Context::forget_jumps_to_buffer(Buffer& buffer)\n{\n for (auto it = m_jump_list.begin(); it != m_jump_list.end();)\n {\n if (&it->buffer() == &buffer)\n {\n if (it < m_current_jump)\n --m_current_jump;\n else if (it == m_current_jump)\n m_current_jump = m_jump_list.end()-1;\n\n it = m_jump_list.erase(it);\n }\n else\n ++it;\n }\n}\n\nvoid Context::change_buffer(Buffer& buffer)\n{\n if (&buffer == &this->buffer())\n return;\n\n if (m_edition_level > 0)\n this->buffer().commit_undo_group();\n\n m_window.reset();\n if (has_client())\n client().change_buffer(buffer);\n else\n m_selections = SelectionList{buffer, Selection{}};\n if (has_input_handler())\n input_handler().reset_normal_mode();\n}\n\nSelectionList& Context::selections()\n{\n if (not m_selections)\n throw runtime_error(\"no selections in context\");\n (*m_selections).update();\n return *m_selections;\n}\n\nSelectionList& Context::selections_write_only()\n{\n if (not m_selections)\n throw runtime_error(\"no selections in context\");\n return *m_selections;\n}\n\nconst SelectionList& Context::selections() const\n{\n return const_cast<Context&>(*this).selections();\n}\n\nVector<String> Context::selections_content() const\n{\n auto& buf = buffer();\n Vector<String> contents;\n for (auto& sel : selections())\n contents.push_back(buf.string(sel.min(), buf.char_next(sel.max())));\n return contents;\n}\n\nvoid Context::begin_edition()\n{\n if (m_edition_level >= 0)\n ++m_edition_level;\n}\n\nvoid Context::end_edition()\n{\n if (m_edition_level < 0)\n return;\n\n kak_assert(m_edition_level != 0);\n if (m_edition_level == 1)\n buffer().commit_undo_group();\n\n --m_edition_level;\n}\n\nStringView Context::main_sel_register_value(StringView reg) const\n{\n auto strings = RegisterManager::instance()[reg].values(*this);\n size_t index = m_selections ? (*m_selections).main_index() : 0;\n if (strings.size() <= index)\n index = strings.size() - 1;\n return strings[index];\n}\n\n}\n<|endoftext|>"} {"text":"<commit_before>#ifndef context_hh_INCLUDED\n#define context_hh_INCLUDED\n\n#include \"window.hh\"\n\nnamespace Kakoune\n{\n\nclass Buffer;\n\nstruct Context\n{\n Context()\n : m_window(nullptr), m_buffer(nullptr) {}\n Context(Window& window)\n : m_window(&window), m_buffer(&window.buffer()) {}\n Context(Buffer& buffer)\n : m_window(nullptr), m_buffer(&buffer) {}\n\n Buffer& buffer() const\n {\n if (not m_buffer)\n throw runtime_error(\"no buffer in context\");\n return *m_buffer;\n }\n bool has_buffer() const { return m_buffer; }\n\n Window& window() const\n {\n if (not m_window)\n throw runtime_error(\"no window in context\");\n return *m_window;\n }\n bool has_window() const { return m_window; }\n\n OptionManager& option_manager() const\n {\n if (m_window)\n return m_window->option_manager();\n if (m_buffer)\n return m_buffer->option_manager();\n return GlobalOptionManager::instance();\n }\n\n int numeric_param() const { return m_numeric_param; }\n void numeric_param(int param) { m_numeric_param = param; }\n\n\npublic:\n safe_ptr<Window> m_window;\n safe_ptr<Buffer> m_buffer;\n\n int m_numeric_param = 0;\n};\n\n}\n#endif \/\/ context_hh_INCLUDED\n<commit_msg>Context: store an editor instead of a window<commit_after>#ifndef context_hh_INCLUDED\n#define context_hh_INCLUDED\n\n#include \"window.hh\"\n\nnamespace Kakoune\n{\n\nclass Buffer;\n\nstruct Context\n{\n Context() {}\n Context(Editor& editor)\n : m_editor(&editor), m_buffer(&editor.buffer()) {}\n Context(Buffer& buffer)\n : m_buffer(&buffer) {}\n\n Buffer& buffer() const\n {\n if (not has_buffer())\n throw runtime_error(\"no buffer in context\");\n return *m_buffer;\n }\n bool has_buffer() const { return m_buffer; }\n\n Editor& editor() const\n {\n if (not has_editor())\n throw runtime_error(\"no editor in context\");\n return *m_editor.get();\n }\n bool has_editor() const { return m_editor; }\n\n Window& window() const\n {\n if (not has_window())\n throw runtime_error(\"no window in context\");\n return *dynamic_cast<Window*>(m_editor.get());\n }\n bool has_window() const { return m_editor and dynamic_cast<Window*>(m_editor.get()); }\n\n OptionManager& option_manager() const\n {\n if (has_window())\n return window().option_manager();\n if (has_buffer())\n return buffer().option_manager();\n return GlobalOptionManager::instance();\n }\n\n int numeric_param() const { return m_numeric_param; }\n void numeric_param(int param) { m_numeric_param = param; }\n\n\npublic:\n safe_ptr<Editor> m_editor;\n safe_ptr<Buffer> m_buffer;\n\n int m_numeric_param = 0;\n};\n\n}\n#endif \/\/ context_hh_INCLUDED\n<|endoftext|>"} {"text":"<commit_before>#ifndef STAN_MATH_PRIM_ARR_ERR_IS_ORDERED_HPP\n#define STAN_MATH_PRIM_ARR_ERR_IS_ORDERED_HPP\n\n#include <vector>\n#include <string>\n\nnamespace stan {\nnamespace math {\n\n\/**\n * Return <code>true<\/code> if the vector is sorted into strictly\n * increasing order.s\n * @tparam T_y Type of scalar, requires class method <code>.size()<\/code>\n * @param y <code>std::vector<\/code> to test\n * @return <code>true<\/code> if vector is sorted in ascending order\n *\/\ntemplate <typename T_y>\ninline bool is_ordered(const std::vector<T_y>& y) {\n for (size_t n = 1; n < y.size(); ++n) {\n if (!(y[n] > y[n - 1]))\n return false;\n }\n return true;\n}\n\n} \/\/ namespace math\n} \/\/ namespace stan\n#endif\n<commit_msg>Update is_ordered.hpp<commit_after>#ifndef STAN_MATH_PRIM_ARR_ERR_IS_ORDERED_HPP\n#define STAN_MATH_PRIM_ARR_ERR_IS_ORDERED_HPP\n\n#include <vector>\n#include <string>\n\nnamespace stan {\nnamespace math {\n\n\/**\n * Return <code>true<\/code> if the vector is sorted into strictly\n * increasing order.\n * @tparam T_y Type of scalar, requires class method <code>.size()<\/code>\n * @param y <code>std::vector<\/code> to test\n * @return <code>true<\/code> if vector is sorted in ascending order\n *\/\ntemplate <typename T_y>\ninline bool is_ordered(const std::vector<T_y>& y) {\n for (size_t n = 1; n < y.size(); ++n) {\n if (!(y[n] > y[n - 1]))\n return false;\n }\n return true;\n}\n\n} \/\/ namespace math\n} \/\/ namespace stan\n#endif\n<|endoftext|>"} {"text":"<commit_before>\/**\n * Extension.cpp\n *\n * Starting point for the REACT-PHP-CPP extension. In this file all\n * classes and methods that are defined by the extension are\n * registered to PHP\n *\n * @copyright 2014 Copernica BV\n *\/\n\n\/**\n * Dependencies\n *\/\n#include \"loop.h\"\n#include \"timeoutwatcher.h\"\n#include \"intervalwatcher.h\"\n#include \"readwatcher.h\"\n#include \"writewatcher.h\"\n#include \"synchronizewatcher.h\"\n#include \"connection.h\"\n#include \"statement.h\"\n#include \"parameter.h\"\n#include \"localparameter.h\"\n#include \"result.h\"\n\n\/\/ Symbols are exported according to the \"C\" language\nextern \"C\" \n{\n \/\/ export the \"get_module\" function that will be called by the Zend engine\n PHPCPP_EXPORT void *get_module()\n {\n \/\/ create extension\n static Php::Extension extension(\"REACT-PHP-CPP\",\"0.1\");\n \n \/\/ create a namespace\n Php::Namespace async(\"Async\");\n \n \/\/ the loop class\n Php::Class<ReactPhp::Loop> loop(\"Loop\");\n loop.method(\"now\", &ReactPhp::Loop::now);\n loop.method(\"run\", &ReactPhp::Loop::run);\n loop.method(\"step\", &ReactPhp::Loop::step);\n loop.method(\"stop\", &ReactPhp::Loop::stop);\n loop.method(\"resume\", &ReactPhp::Loop::resume);\n loop.method(\"suspend\", &ReactPhp::Loop::suspend);\n loop.method(\"onTimeout\", &ReactPhp::Loop::onTimeout);\n loop.method(\"onInterval\", &ReactPhp::Loop::onInterval);\n loop.method(\"onReadable\", &ReactPhp::Loop::onReadable);\n loop.method(\"onWritable\", &ReactPhp::Loop::onWritable);\n loop.method(\"onSynchronize\", &ReactPhp::Loop::onSynchronize);\n\n \/\/ the timer watcher class\n Php::Class<ReactPhp::TimeoutWatcher> timeoutWatcher(\"TimeoutWatcher\");\n timeoutWatcher.method(\"__construct\", &ReactPhp::TimeoutWatcher::__construct);\n timeoutWatcher.method(\"start\", &ReactPhp::TimeoutWatcher::start);\n timeoutWatcher.method(\"cancel\", &ReactPhp::TimeoutWatcher::cancel);\n timeoutWatcher.method(\"set\", &ReactPhp::TimeoutWatcher::set);\n \n\t\/\/ the read watcher class\n\tPhp::Class<ReactPhp::ReadWatcher> readWatcher(\"ReadWatcher\");\n\treadWatcher.method(\"__construct\", &ReactPhp::ReadWatcher::__construct);\n\treadWatcher.method(\"cancel\", &ReactPhp::ReadWatcher::cancel);\n\treadWatcher.method(\"resume\", &ReactPhp::ReadWatcher::resume);\n\t\t\n\t\/\/ the write watcher class\n\tPhp::Class<ReactPhp::WriteWatcher> writeWatcher(\"WriteWatcher\");\n\twriteWatcher.method(\"__construct\", &ReactPhp::WriteWatcher::__construct);\n\twriteWatcher.method(\"cancel\", &ReactPhp::WriteWatcher::cancel);\n\twriteWatcher.method(\"resume\", &ReactPhp::WriteWatcher::resume);\n\t\t\n\t\/\/ the interval watcher class\n\tPhp::Class<ReactPhp::IntervalWatcher> intervalWatcher(\"IntervalWatcher\");\n\tintervalWatcher.method(\"__construct\", &ReactPhp::IntervalWatcher::__construct);\n\tintervalWatcher.method(\"start\", &ReactPhp::IntervalWatcher::start);\n intervalWatcher.method(\"cancel\", &ReactPhp::IntervalWatcher::cancel);\n intervalWatcher.method(\"set\", &ReactPhp::IntervalWatcher::set);\n \n\t\/\/ the synchronize watcher class\n\tPhp::Class<ReactPhp::SynchronizeWatcher> synchronizeWatcher(\"SynchronizeWatcher\");\n\tsynchronizeWatcher.method(\"__construct\", &ReactPhp::SynchronizeWatcher::__construct);\n\tsynchronizeWatcher.method(\"synchronize\", &ReactPhp::SynchronizeWatcher::synchronize);\n\tsynchronizeWatcher.method(\"cancel\", &ReactPhp::SynchronizeWatcher::cancel);\n\t\t\n\t\/\/ the connection class\n\tPhp::Class<ReactPhp::Connection> connection(\"Connection\");\n\tconnection.method(\"__construct\", &ReactPhp::Connection::__construct);\n\tconnection.method(\"query\", &ReactPhp::Connection::query);\n\t\t\n\t\/\/ the statement class\n\tPhp::Class<ReactPhp::Statement> statement(\"Statement\");\n\tstatement.method(\"__construct\", &ReactPhp::Statement::__construct);\n\tstatement.method(\"execute\", &ReactPhp::Statement::execute);\n\tstatement.method(\"executeQuery\", &ReactPhp::Statement::executeQuery);\n\t\t\n\t\/\/ the parameter class\n\tPhp::Class<ReactPhp::Parameter> parameter(\"Parameter\");\n\tparameter.method(\"__construct\", &ReactPhp::Parameter::__construct);\n\t\t\n\t\/\/ the local parameter class\n\tPhp::Class<ReactPhp::LocalParameter> localParameter(\"Parameter\");\n\tlocalParameter.method(\"__construct\", &ReactPhp::LocalParameter::__construct);\n\t\t\n\t\/\/ the result class\n\tPhp::Class<ReactPhp::Result> result(\"Result\");\n\tresult.method(\"valid\", &ReactPhp::Result::valid);\n\tresult.method(\"size\", &ReactPhp::Result::size);\n\tresult.method(\"begin\", &ReactPhp::Result::begin);\n\tresult.method(\"end\", &ReactPhp::Result::end);\n\tresult.method(\"fetchRow\", &ReactPhp::Result::fetchRow);\n\t\t\n\t\/\/ the result row class\n\tPhp::Class<ReactPhp::ResultRow> resultRow(\"ResultRow\");\n\t\t\n\t\/\/ the result field class\n\tPhp::Class<ReactPhp::ResultField> resultField(\"ResultField\");\n\t\t\n \/\/ add all classes to the namespace\n async.add(loop);\n async.add(timeoutWatcher);\n async.add(readWatcher);\n async.add(writeWatcher);\n async.add(intervalWatcher);\n async.add(synchronizeWatcher);\n async.add(connection);\n async.add(statement);\n async.add(parameter);\n async.add(result);\n async.add(localParameter);\n async.add(resultRow);\n async.add(resultField);\n \n\t\/\/ add the namespace to the extension\n extension.add(async);\n \n \/\/ return the extension module\n return extension.module();\n }\n}\n<commit_msg>Updated extension.cpp<commit_after>\/**\n *\tExtension.cpp\n *\n *\tStarting point for the event loop extension. In this file all\n *\tclasses and methods that are defined by the extension are\n *\tregistered to PHP\n *\n * \t@copyright 2014 Copernica BV\n *\/\n\n\/**\n * Dependencies\n *\/\n#include \"loop.h\"\n#include \"timeoutwatcher.h\"\n#include \"intervalwatcher.h\"\n#include \"readwatcher.h\"\n#include \"writewatcher.h\"\n#include \"synchronizewatcher.h\"\n#include \"signalwatcher.h\"\n#include \"statuswatcher.h\"\n#include \"resolver.h\"\n#include \"connection.h\"\n#include \"statement.h\"\n#include \"parameter.h\"\n#include \"localparameter.h\"\n#include \"result.h\"\n#include \"resolverresult.h\"\n\n\/\/ Symbols are exported according to the \"C\" language\nextern \"C\" \n{\n \/\/ export the \"get_module\" function that will be called by the Zend engine\n PHPCPP_EXPORT void *get_module()\n {\n \/\/ create extension\n static Php::Extension extension(\"REACT-PHP-CPP\",\"0.1\");\n \n \/\/ create a namespace\n Php::Namespace async(\"Async\");\n \n \/\/ the loop class\n Php::Class<ReactPhp::Loop> loop(\"Loop\");\n loop.method(\"now\", &ReactPhp::Loop::now);\n loop.method(\"run\", &ReactPhp::Loop::run);\n loop.method(\"step\", &ReactPhp::Loop::step);\n loop.method(\"stop\", &ReactPhp::Loop::stop);\n loop.method(\"resume\", &ReactPhp::Loop::resume);\n loop.method(\"suspend\", &ReactPhp::Loop::suspend);\n loop.method(\"onTimeout\", &ReactPhp::Loop::onTimeout);\n loop.method(\"onInterval\", &ReactPhp::Loop::onInterval);\n loop.method(\"onReadable\", &ReactPhp::Loop::onReadable);\n loop.method(\"onWritable\", &ReactPhp::Loop::onWritable);\n loop.method(\"onSynchronize\", &ReactPhp::Loop::onSynchronize);\n loop.method(\"onSignal\", &ReactPhp::Loop::onSignal);\n loop.method(\"onStatusChange\", &ReactPhp::Loop::onStatusChange);\n\n \/\/ the timer watcher class\n Php::Class<ReactPhp::TimeoutWatcher> timeoutWatcher(\"TimeoutWatcher\");\n timeoutWatcher.method(\"__construct\", &ReactPhp::TimeoutWatcher::__construct);\n timeoutWatcher.method(\"start\", &ReactPhp::TimeoutWatcher::start);\n timeoutWatcher.method(\"cancel\", &ReactPhp::TimeoutWatcher::cancel);\n timeoutWatcher.method(\"set\", &ReactPhp::TimeoutWatcher::set);\n \n\t\t\/\/ the read watcher class\n\t\tPhp::Class<ReactPhp::ReadWatcher> readWatcher(\"ReadWatcher\");\n\t\treadWatcher.method(\"__construct\", &ReactPhp::ReadWatcher::__construct);\n\t\treadWatcher.method(\"cancel\", &ReactPhp::ReadWatcher::cancel);\n\t\treadWatcher.method(\"resume\", &ReactPhp::ReadWatcher::resume);\n\t\t\n\t\t\/\/ the write watcher class\n\t\tPhp::Class<ReactPhp::WriteWatcher> writeWatcher(\"WriteWatcher\");\n\t\twriteWatcher.method(\"__construct\", &ReactPhp::WriteWatcher::__construct);\n\t\twriteWatcher.method(\"cancel\", &ReactPhp::WriteWatcher::cancel);\n\t\twriteWatcher.method(\"resume\", &ReactPhp::WriteWatcher::resume);\n\t\t\n\t\t\/\/ the interval watcher class\n\t\tPhp::Class<ReactPhp::IntervalWatcher> intervalWatcher(\"IntervalWatcher\");\n\t\tintervalWatcher.method(\"__construct\", &ReactPhp::IntervalWatcher::__construct);\n\t\tintervalWatcher.method(\"start\", &ReactPhp::IntervalWatcher::start);\n intervalWatcher.method(\"cancel\", &ReactPhp::IntervalWatcher::cancel);\n intervalWatcher.method(\"set\", &ReactPhp::IntervalWatcher::set);\n \n\t\t\/\/ the synchronize watcher class\n\t\tPhp::Class<ReactPhp::SynchronizeWatcher> synchronizeWatcher(\"SynchronizeWatcher\");\n\t\tsynchronizeWatcher.method(\"__construct\", &ReactPhp::SynchronizeWatcher::__construct);\n\t\tsynchronizeWatcher.method(\"synchronize\", &ReactPhp::SynchronizeWatcher::synchronize);\n\t\tsynchronizeWatcher.method(\"cancel\", &ReactPhp::SynchronizeWatcher::cancel);\n\t\t\n\t\t\/\/ the signal watcher class\n\t\tPhp::Class<ReactPhp::SignalWatcher> signalWatcher(\"SignalWatcher\");\n signalWatcher.method(\"__construct\", &ReactPhp::SignalWatcher::__construct);\n signalWatcher.method(\"start\", &ReactPhp::SignalWatcher::start);\n signalWatcher.method(\"cancel\", &ReactPhp::SignalWatcher::cancel);\n \n \/\/ the staus watcher class\n Php::Class<ReactPhp::StatusWatcher> statusWatcher(\"StatusWatcher\");\n statusWatcher.method(\"__construct\", &ReactPhp::StatusWatcher::__construct);\n statusWatcher.method(\"start\", &ReactPhp::StatusWatcher::start);\n statusWatcher.method(\"cancel\", &ReactPhp::StatusWatcher::cancel);\n \n \/\/ the resolver class\n Php::Class<ReactPhp::Resolver> resolver(\"Resolver\");\n resolver.method(\"__construct\", &ReactPhp::Resolver::__construct);\n resolver.method(\"ip\", &ReactPhp::Resolver::ip);\n resolver.method(\"mx\", &ReactPhp::Resolver::mx);\n \n\t\t\/\/ the connection class\n\t\tPhp::Class<ReactPhp::Connection> connection(\"Connection\");\n\t\tconnection.method(\"__construct\", &ReactPhp::Connection::__construct);\n\t\tconnection.method(\"query\", &ReactPhp::Connection::query);\n\t\t\n\t\t\/\/ the statement class\n\t\tPhp::Class<ReactPhp::Statement> statement(\"Statement\");\n\t\tstatement.method(\"__construct\", &ReactPhp::Statement::__construct);\n\t\tstatement.method(\"execute\", &ReactPhp::Statement::execute);\n\t\tstatement.method(\"executeQuery\", &ReactPhp::Statement::executeQuery);\n\t\t\n\t\t\/\/ the parameter class\n\t\tPhp::Class<ReactPhp::Parameter> parameter(\"Parameter\");\n\t\tparameter.method(\"__construct\", &ReactPhp::Parameter::__construct);\n\t\t\n\t\t\/\/ the local parameter class\n\t\tPhp::Class<ReactPhp::LocalParameter> localParameter(\"Parameter\");\n\t\tlocalParameter.method(\"__construct\", &ReactPhp::LocalParameter::__construct);\n\t\t\n\t\t\/\/ the result class\n\t\tPhp::Class<ReactPhp::Result> result(\"Result\");\n\t\tresult.method(\"valid\", &ReactPhp::Result::valid);\n\t\tresult.method(\"size\", &ReactPhp::Result::size);\n\t\tresult.method(\"begin\", &ReactPhp::Result::begin);\n\t\tresult.method(\"end\", &ReactPhp::Result::end);\n\t\tresult.method(\"fetchRow\", &ReactPhp::Result::fetchRow);\n\t\t\n\t\t\/\/ the result row class\n\t\tPhp::Class<ReactPhp::ResultRow> resultRow(\"ResultRow\");\n\t\t\n\t\t\/\/ the result field class\n\t\tPhp::Class<ReactPhp::ResultField> resultField(\"ResultField\");\n\t\t\n\t\t\/\/ the resolver result class\n\t\tPhp::Class<ReactPhp::ResolverResult> resolverResult(\"ResolverResult\");\n\t\t\n \/\/ add all classes to the namespace\n async.add(loop);\n async.add(timeoutWatcher);\n async.add(readWatcher);\n async.add(writeWatcher);\n async.add(intervalWatcher);\n async.add(synchronizeWatcher);\n async.add(signalWatcher);\n async.add(statusWatcher);\n async.add(resolver);\n async.add(connection);\n async.add(statement);\n async.add(parameter);\n async.add(result);\n async.add(localParameter);\n async.add(resultRow);\n async.add(resultField);\n async.add(resolverResult);\n \n\t\t\/\/ add the namespace to the extension\n extension.add(async);\n \n \/\/ return the extension module\n return extension.module();\n }\n}\n\n\n<|endoftext|>"} {"text":"<commit_before>#include \"device.h\"\n\n#ifndef QT_NO_DBUS\n#include \"systemhelperdbus.h\"\n#endif\n\nDevice::Device(const QString &p, DeviceType t, const QString &l, const QString &u, QObject *parent) :\n QObject(parent)\n , m_path(p)\n , m_type(t)\n , m_label(l)\n , m_uuid(u)\n{\n#ifndef QT_NO_DBUS\n m_helper = qobject_cast<SystemHelperDBus*>(parent);\n#endif\n emit changed();\n}\n\nvoid Device::mount()\n{\n qDebug() << \"Device::mount()\";\n#ifndef QT_NO_DBUS\n m_helper->mount(m_path);\n#endif\n}\n\nvoid Device::unmount()\n{\n#ifndef QT_NO_DBUS\n m_helper->unmount(m_path);\n#endif\n}\n\nvoid Device::eject()\n{\n#ifndef QT_NO_DBUS\n m_helper->eject(m_path);\n#endif\n}\n<commit_msg>remove debug message<commit_after>#include \"device.h\"\n\n#ifndef QT_NO_DBUS\n#include \"systemhelperdbus.h\"\n#endif\n\nDevice::Device(const QString &p, DeviceType t, const QString &l, const QString &u, QObject *parent) :\n QObject(parent)\n , m_path(p)\n , m_type(t)\n , m_label(l)\n , m_uuid(u)\n{\n#ifndef QT_NO_DBUS\n m_helper = qobject_cast<SystemHelperDBus*>(parent);\n#endif\n emit changed();\n}\n\nvoid Device::mount()\n{\n#ifndef QT_NO_DBUS\n m_helper->mount(m_path);\n#endif\n}\n\nvoid Device::unmount()\n{\n#ifndef QT_NO_DBUS\n m_helper->unmount(m_path);\n#endif\n}\n\nvoid Device::eject()\n{\n#ifndef QT_NO_DBUS\n m_helper->eject(m_path);\n#endif\n}\n<|endoftext|>"} {"text":"<commit_before>#include \"device.h\"\n#include \"sysex\/commands.h\"\n#include \"sysex\/deviceinfo.h\"\n#include \"sysex\/getcommands.h\"\n#include \"sysex\/infos.h\"\n#include \"sysex\/midi.h\"\n\n#include <array>\n#include <cstring>\n#include <iostream>\n#include <sstream>\n#include <unistd.h>\n\nDevice::Device(int inPortNumber, int outPortNumber, long serialNumber,\n int productId) {\n this->inPortNumber = inPortNumber;\n this->outPortNumber = outPortNumber;\n this->serialNumber = new MIDISysexValue(serialNumber, 5);\n this->productId = new MIDISysexValue(productId, 2);\n setupMidi();\n}\n\n#ifdef __MIO_SIMULATE__\n\nDevice::Device(int inPortNumber, int outPortNumber, long serialNumber,\n int productId, std::string modelName, std::string deviceName) {\n this->inPortNumber = inPortNumber;\n this->outPortNumber = outPortNumber;\n this->serialNumber = new MIDISysexValue(serialNumber, 5);\n this->productId = new MIDISysexValue(productId, 2);\n this->modelName = modelName;\n this->deviceName = deviceName;\n this->deviceIsSimulated = true;\n}\n\nCommands *Device::simulateCommands() {\n BYTE_VECTOR *message = new BYTE_VECTOR({0xF0});\n message->insert(message->end(), getFullHeader()->begin(),\n getFullHeader()->end());\n message->push_back(0x00);\n message->push_back(0x01);\n message->push_back(0x00);\n message->push_back(SysExMessage::RET_COMMAND_LIST);\n message->push_back(0x00);\n message->push_back(0x06);\n message->insert(message->end(), {0x05, 0x07, 0x08, 0x09, 0x0b, 0x0c});\n commands = new Commands(SysExMessage::RET_COMMAND_LIST, message, this);\n commands->parseAnswerData();\n return commands;\n}\n\n#endif \/\/__MIO_SIMULATE__\n\nDevice::~Device() {\n if (midiin) {\n if (midiin->isPortOpen())\n midiin->closePort();\n delete midiin;\n }\n if (midiout) {\n if (midiout->isPortOpen())\n midiout->closePort();\n delete midiout;\n }\n}\n\nBYTE_VECTOR *Device::getManufacturerHeader() {\n if (Device::manufacturerHeader == 0) {\n manufacturerHeader = new BYTE_VECTOR();\n manufacturerHeader->push_back(MANUFACTURER_SYSEX_ID[0]);\n manufacturerHeader->push_back(MANUFACTURER_SYSEX_ID[1]);\n manufacturerHeader->push_back(MANUFACTURER_SYSEX_ID[2]);\n }\n return manufacturerHeader;\n}\n\nBYTE_VECTOR *Device::getDeviceHeader() {\n if (deviceHeader == 0) {\n deviceHeader = new BYTE_VECTOR();\n deviceHeader->reserve(productId->getByteValue()->size() +\n serialNumber->getByteValue()->size());\n deviceHeader->insert(deviceHeader->end(),\n productId->getByteValue()->begin(),\n productId->getByteValue()->end());\n deviceHeader->insert(deviceHeader->end(),\n serialNumber->getByteValue()->begin(),\n serialNumber->getByteValue()->end());\n }\n return deviceHeader;\n}\n\nBYTE_VECTOR *Device::getFullHeader() {\n if (fullHeader == 0) {\n fullHeader = new BYTE_VECTOR();\n fullHeader->reserve(Device::getManufacturerHeader()->size() +\n getDeviceHeader()->size() + 1);\n fullHeader->insert(fullHeader->end(),\n Device::getManufacturerHeader()->begin(),\n Device::getManufacturerHeader()->end());\n fullHeader->push_back(Device::MESSAGE_CLASS);\n fullHeader->insert(fullHeader->end(), getDeviceHeader()->begin(),\n getDeviceHeader()->end());\n }\n return fullHeader;\n}\n\nvoid Device::setupMidi() {\n std::stringstream name;\n name << \"MioConfig In \" << serialNumber->getLongValue();\n midiin = MIDI::createMidiIn(name.str());\n midiin->openPort(inPortNumber);\n name << \"MioConfig Out \" << serialNumber->getLongValue();\n midiout = MIDI::createMidiOut(name.str());\n midiout->openPort(outPortNumber);\n}\n\nvoid Device::sentSysex(BYTE_VECTOR *data) {\n usleep(sysexWaitTime);\n midiout->sendMessage(data);\n}\n\nBYTE_VECTOR *Device::retrieveSysex() {\n usleep(sysexWaitTime);\n BYTE_VECTOR *data = new BYTE_VECTOR();\n midiin->getMessage(data);\n if (checkSysex(data))\n return data;\n return 0;\n}\n\nbool Device::checkSysex(BYTE_VECTOR *data) {\n BYTE_VECTOR *dataHeader =\n new BYTE_VECTOR(data->begin() + 1, data->begin() + 12);\n BYTE_VECTOR *localHeader = getFullHeader();\n return MIDI::compareByteVector(dataHeader, localHeader);\n}\n\nvoid Device::queryDeviceInfo() {\n GetCommands *c = new GetCommands(this);\n c->setDebug(true);\n#ifdef __MIO_SIMULATE__\n commands = simulateCommands();\n#else\n commands = (Commands *)c->query();\n#endif\n if (commands == 0) {\n std::cerr << \"can not query supported commands\";\n return;\n }\n\n#if __MIO_SIMULATE__\n if (!deviceIsSimulated) {\n#endif \/\/__MIO_SIMULATE\n if (commands->isCommandSupported(SysExMessage::GET_INFO_LIST)) {\n Infos *i = new Infos(this);\n i->execute();\n Infos *ia = (Infos *)i->getAnswer();\n }\n\n DeviceInfo *di = new DeviceInfo(this);\n di->execute();\n DeviceInfo *dia = (DeviceInfo *)di->getAnswer();\n deviceName = dia->getDataAsString();\n\n di->setInfoItem(DeviceInfo::ACESSORY_NAME);\n di->execute();\n dia = (DeviceInfo *)di->getAnswer();\n modelName = dia->getDataAsString();\n\n di->setInfoItem(DeviceInfo::SERIAL_NUMBER);\n di->execute();\n dia = (DeviceInfo *)di->getAnswer();\n serialNumberString = dia->getDataAsString();\n#ifdef __MIO_SIMULATE__\n }\n#endif \/\/__MIO_SIMULATE__\n}\n\nBYTE_VECTOR *Device::nextTransactionId() {\n if (transactionId > 16000)\n transactionId = 0;\n BYTE_VECTOR *v = MIDI::byteSplit(++transactionId, 2);\n return v;\n}\n\nBYTE_VECTOR *Device::manufacturerHeader = 0;\n<commit_msg>added more commands to simulated \"Commands\" class<commit_after>#include \"device.h\"\n#include \"sysex\/commands.h\"\n#include \"sysex\/deviceinfo.h\"\n#include \"sysex\/getcommands.h\"\n#include \"sysex\/infos.h\"\n#include \"sysex\/midi.h\"\n\n#include <array>\n#include <cstring>\n#include <iostream>\n#include <sstream>\n#include <unistd.h>\n\nDevice::Device(int inPortNumber, int outPortNumber, long serialNumber,\n int productId) {\n this->inPortNumber = inPortNumber;\n this->outPortNumber = outPortNumber;\n this->serialNumber = new MIDISysexValue(serialNumber, 5);\n this->productId = new MIDISysexValue(productId, 2);\n setupMidi();\n}\n\n#ifdef __MIO_SIMULATE__\n\nDevice::Device(int inPortNumber, int outPortNumber, long serialNumber,\n int productId, std::string modelName, std::string deviceName) {\n this->inPortNumber = inPortNumber;\n this->outPortNumber = outPortNumber;\n this->serialNumber = new MIDISysexValue(serialNumber, 5);\n this->productId = new MIDISysexValue(productId, 2);\n this->modelName = modelName;\n this->deviceName = deviceName;\n this->deviceIsSimulated = true;\n}\n\nCommands *Device::simulateCommands() {\n BYTE_VECTOR *message = new BYTE_VECTOR({0xF0});\n message->insert(message->end(), getFullHeader()->begin(),\n getFullHeader()->end());\n message->push_back(0x00);\n message->push_back(0x01);\n message->push_back(0x00);\n message->push_back(SysExMessage::RET_COMMAND_LIST);\n message->push_back(0x00);\n\tBYTE_VECTOR *allowedCommands = new BYTE_VECTOR();\n\tallowedCommands->insert(\n\t\t\tallowedCommands->end(),\n\t\t\t{SysExMessage::GET_INFO_LIST, SysExMessage::GET_DEVICE_INFO,\n\t\t\t SysExMessage::RET_SET_DEVICE_INFO, SysExMessage::GET_RESET_LIST,\n\t\t\t SysExMessage::GET_SAVE_RESTORE_LIST,\n\t\t\t SysExMessage::GET_ETHERNET_PORT_INFO});\n\tmessage->push_back(allowedCommands->size());\n\tmessage->insert(message->end(), allowedCommands->begin(),\n\t\t\t\t\t\t\t\t\tallowedCommands->end());\n\tCommands *commands =\n\t\t\tnew Commands(SysExMessage::RET_COMMAND_LIST, message, this);\n commands->parseAnswerData();\n return commands;\n}\n\n#endif \/\/__MIO_SIMULATE__\n\nDevice::~Device() {\n if (midiin) {\n if (midiin->isPortOpen())\n midiin->closePort();\n delete midiin;\n }\n if (midiout) {\n if (midiout->isPortOpen())\n midiout->closePort();\n delete midiout;\n }\n}\n\nBYTE_VECTOR *Device::getManufacturerHeader() {\n if (Device::manufacturerHeader == 0) {\n manufacturerHeader = new BYTE_VECTOR();\n manufacturerHeader->push_back(MANUFACTURER_SYSEX_ID[0]);\n manufacturerHeader->push_back(MANUFACTURER_SYSEX_ID[1]);\n manufacturerHeader->push_back(MANUFACTURER_SYSEX_ID[2]);\n }\n return manufacturerHeader;\n}\n\nBYTE_VECTOR *Device::getDeviceHeader() {\n if (deviceHeader == 0) {\n deviceHeader = new BYTE_VECTOR();\n deviceHeader->reserve(productId->getByteValue()->size() +\n serialNumber->getByteValue()->size());\n deviceHeader->insert(deviceHeader->end(),\n productId->getByteValue()->begin(),\n productId->getByteValue()->end());\n deviceHeader->insert(deviceHeader->end(),\n serialNumber->getByteValue()->begin(),\n serialNumber->getByteValue()->end());\n }\n return deviceHeader;\n}\n\nBYTE_VECTOR *Device::getFullHeader() {\n if (fullHeader == 0) {\n fullHeader = new BYTE_VECTOR();\n fullHeader->reserve(Device::getManufacturerHeader()->size() +\n getDeviceHeader()->size() + 1);\n fullHeader->insert(fullHeader->end(),\n Device::getManufacturerHeader()->begin(),\n Device::getManufacturerHeader()->end());\n fullHeader->push_back(Device::MESSAGE_CLASS);\n fullHeader->insert(fullHeader->end(), getDeviceHeader()->begin(),\n getDeviceHeader()->end());\n }\n return fullHeader;\n}\n\nvoid Device::setupMidi() {\n std::stringstream name;\n name << \"MioConfig In \" << serialNumber->getLongValue();\n midiin = MIDI::createMidiIn(name.str());\n midiin->openPort(inPortNumber);\n name << \"MioConfig Out \" << serialNumber->getLongValue();\n midiout = MIDI::createMidiOut(name.str());\n midiout->openPort(outPortNumber);\n}\n\nvoid Device::sentSysex(BYTE_VECTOR *data) {\n usleep(sysexWaitTime);\n midiout->sendMessage(data);\n}\n\nBYTE_VECTOR *Device::retrieveSysex() {\n usleep(sysexWaitTime);\n BYTE_VECTOR *data = new BYTE_VECTOR();\n midiin->getMessage(data);\n if (checkSysex(data))\n return data;\n return 0;\n}\n\nbool Device::checkSysex(BYTE_VECTOR *data) {\n BYTE_VECTOR *dataHeader =\n new BYTE_VECTOR(data->begin() + 1, data->begin() + 12);\n BYTE_VECTOR *localHeader = getFullHeader();\n return MIDI::compareByteVector(dataHeader, localHeader);\n}\n\nvoid Device::queryDeviceInfo() {\n GetCommands *c = new GetCommands(this);\n c->setDebug(true);\n#ifdef __MIO_SIMULATE__\n commands = simulateCommands();\n#else\n commands = (Commands *)c->query();\n#endif\n if (commands == 0) {\n std::cerr << \"can not query supported commands\";\n return;\n }\n\n#if __MIO_SIMULATE__\n if (!deviceIsSimulated) {\n#endif \/\/__MIO_SIMULATE\n if (commands->isCommandSupported(SysExMessage::GET_INFO_LIST)) {\n Infos *i = new Infos(this);\n i->execute();\n Infos *ia = (Infos *)i->getAnswer();\n }\n\n DeviceInfo *di = new DeviceInfo(this);\n di->execute();\n DeviceInfo *dia = (DeviceInfo *)di->getAnswer();\n deviceName = dia->getDataAsString();\n\n di->setInfoItem(DeviceInfo::ACESSORY_NAME);\n di->execute();\n dia = (DeviceInfo *)di->getAnswer();\n modelName = dia->getDataAsString();\n\n di->setInfoItem(DeviceInfo::SERIAL_NUMBER);\n di->execute();\n dia = (DeviceInfo *)di->getAnswer();\n serialNumberString = dia->getDataAsString();\n#ifdef __MIO_SIMULATE__\n }\n#endif \/\/__MIO_SIMULATE__\n}\n\nBYTE_VECTOR *Device::nextTransactionId() {\n if (transactionId > 16000)\n transactionId = 0;\n BYTE_VECTOR *v = MIDI::byteSplit(++transactionId, 2);\n return v;\n}\n\nBYTE_VECTOR *Device::manufacturerHeader = 0;\n<|endoftext|>"} {"text":"<commit_before>#include \"cylvionpp\/field.h\"\n\n#include <algorithm>\n#include <array>\n\n#include \"cylvionpp\/card.h\"\n#include \"cylvionpp\/stack.h\"\n\nnamespace cylvionpp {\nnamespace core {\n\nnamespace {\n\nclass FieldImpl: public Field {\npublic:\n bool Empty() const override;\n\n const std::unique_ptr<Card> & Peek(size_t row, size_t col) const override;\n bool Put(size_t row, size_t col, std::unique_ptr<Card> &&) override;\n bool Move(size_t row, size_t col, size_t to_row, size_t toCol) override;\n std::unique_ptr<Card> Remove(size_t row, size_t col) override;\n\n const Stack & GetRavageStack(size_t row) const override;\n Stack & GetRavageStack(size_t row) override;\n\nprivate:\n using Row = std::array<std::unique_ptr<Card>, 5>;\n static bool RowEmpty(const Row &);\n\n std::array<Row, 4> c;\n};\n\nbool\nFieldImpl::RowEmpty(const FieldImpl::Row & row)\n{\n return std::none_of(row.begin(), row.end(), [](const std::unique_ptr<Card> & card){ return card.get(); });\n}\n\nbool\nFieldImpl::Empty() const\n{\n return std::all_of(c.begin(), c.end(), FieldImpl::RowEmpty);\n}\n\nconst std::unique_ptr<Card> &\nFieldImpl::Peek(size_t row, size_t col) const\n{\n return c[row][col];\n}\n\nbool\nFieldImpl::Put(size_t row, size_t col, std::unique_ptr<Card> && card)\n{\n if (c[row][col].get()) {\n return false;\n }\n c[row][col] = std::move(card);\n return true;\n}\n\nbool\nFieldImpl::Move(size_t row, size_t col, size_t toRow, size_t toCol)\n{\n if (!c[row][col].get() || c[toRow][toCol].get()) {\n return false;\n }\n c[toRow][toCol] = std::move(c[row][col]);\n return true;\n}\n\nstd::unique_ptr<Card>\nFieldImpl::Remove(size_t row, size_t col)\n{\n if (!c[row][col]) {\n throw std::logic_error(\"Remove null card.\");\n }\n return std::move(c[row][col]);\n}\n\n} \/\/ namespace\n\nField::~Field()\n{\/* Empty. *\/}\n\nstd::unique_ptr<Field>\nField::New()\n{\n return std::make_unique<FieldImpl>();\n}\n\n} \/\/ namespace core\n} \/\/ namespace cylvionpp\n<commit_msg>Full impl of Stack<commit_after>#include \"cylvionpp\/field.h\"\n\n#include <algorithm>\n#include <array>\n\n#include \"cylvionpp\/card.h\"\n#include \"cylvionpp\/stack.h\"\n\nnamespace cylvionpp {\nnamespace core {\n\nnamespace {\n\nclass FieldImpl: public Field {\npublic:\n FieldImpl();\n\n bool Empty() const override;\n\n const std::unique_ptr<Card> & Peek(size_t row, size_t col) const override;\n bool Put(size_t row, size_t col, std::unique_ptr<Card> &&) override;\n bool Move(size_t row, size_t col, size_t to_row, size_t toCol) override;\n std::unique_ptr<Card> Remove(size_t row, size_t col) override;\n\n const Stack & GetRavageStack(size_t row) const override;\n Stack & GetRavageStack(size_t row) override;\n\nprivate:\n using Row = std::array<std::unique_ptr<Card>, 5>;\n static bool RowEmpty(const Row &);\n\n std::array<Row, 4> c;\n std::array<std::unique_ptr<Stack>, 4> s;\n};\n\nFieldImpl::FieldImpl():\n c(),\n s()\n{\n for (auto && stack: s) {\n stack = Stack::New();\n }\n}\n\nbool\nFieldImpl::RowEmpty(const FieldImpl::Row & row)\n{\n return std::none_of(row.begin(), row.end(), [](const std::unique_ptr<Card> & card){ return card.get(); });\n}\n\nbool\nFieldImpl::Empty() const\n{\n return std::all_of(c.begin(), c.end(), FieldImpl::RowEmpty);\n}\n\nconst std::unique_ptr<Card> &\nFieldImpl::Peek(size_t row, size_t col) const\n{\n return c[row][col];\n}\n\nbool\nFieldImpl::Put(size_t row, size_t col, std::unique_ptr<Card> && card)\n{\n if (c[row][col].get()) {\n return false;\n }\n c[row][col] = std::move(card);\n return true;\n}\n\nbool\nFieldImpl::Move(size_t row, size_t col, size_t toRow, size_t toCol)\n{\n if (!c[row][col].get() || c[toRow][toCol].get()) {\n return false;\n }\n c[toRow][toCol] = std::move(c[row][col]);\n return true;\n}\n\nstd::unique_ptr<Card>\nFieldImpl::Remove(size_t row, size_t col)\n{\n if (!c[row][col]) {\n throw std::logic_error(\"Remove null card.\");\n }\n return std::move(c[row][col]);\n}\n\nconst Stack &\nFieldImpl::GetRavageStack(size_t row) const\n{\n return *s[row];\n}\n\n\nStack &\nFieldImpl::GetRavageStack(size_t row)\n{\n return const_cast<Stack &>(static_cast<const FieldImpl *>(this)->GetRavageStack(row));\n}\n\n} \/\/ namespace\n\nField::~Field()\n{\/* Empty. *\/}\n\nstd::unique_ptr<Field>\nField::New()\n{\n return std::make_unique<FieldImpl>();\n}\n\n} \/\/ namespace core\n} \/\/ namespace cylvionpp\n<|endoftext|>"} {"text":"<commit_before>\/*\n * Copyright 2013 Facebook, Inc.\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n *\/\n\n#include \"folly\/FileUtil.h\"\n\n#include <cerrno>\n#ifdef __APPLE__\n#include <fcntl.h>\n#endif\n\n#include \"folly\/detail\/FileUtilDetail.h\"\n\nnamespace folly {\n\nusing namespace fileutil_detail;\n\nint openNoInt(const char* name, int flags, mode_t mode) {\n return wrapNoInt(open, name, flags, mode);\n}\n\nint closeNoInt(int fd) {\n int r = close(fd);\n \/\/ Ignore EINTR. On Linux, close() may only return EINTR after the file\n \/\/ descriptor has been closed, so you must not retry close() on EINTR --\n \/\/ in the best case, you'll get EBADF, and in the worst case, you'll end up\n \/\/ closing a different file (one opened from another thread).\n \/\/\n \/\/ Interestingly enough, the Single Unix Specification says that the state\n \/\/ of the file descriptor is unspecified if close returns EINTR. In that\n \/\/ case, the safe thing to do is also not to retry close() -- leaking a file\n \/\/ descriptor is probably better than closing the wrong file.\n if (r == -1 && errno == EINTR) {\n r = 0;\n }\n return r;\n}\n\nint fsyncNoInt(int fd) {\n return wrapNoInt(fsync, fd);\n}\n\nint fdatasyncNoInt(int fd) {\n#ifndef __APPLE__\n return wrapNoInt(fdatasync, fd);\n#else\n return wrapNoInt(fcntl, fd, F_FULLFSYNC);\n#endif\n}\n\nint ftruncateNoInt(int fd, off_t len) {\n return wrapNoInt(ftruncate, fd, len);\n}\n\nint truncateNoInt(const char* path, off_t len) {\n return wrapNoInt(truncate, path, len);\n}\n\nssize_t readNoInt(int fd, void* buf, size_t count) {\n return wrapNoInt(read, fd, buf, count);\n}\n\nssize_t preadNoInt(int fd, void* buf, size_t count, off_t offset) {\n return wrapNoInt(pread, fd, buf, count, offset);\n}\n\nssize_t readvNoInt(int fd, const iovec* iov, int count) {\n return wrapNoInt(writev, fd, iov, count);\n}\n\nssize_t writeNoInt(int fd, const void* buf, size_t count) {\n return wrapNoInt(write, fd, buf, count);\n}\n\nssize_t pwriteNoInt(int fd, const void* buf, size_t count, off_t offset) {\n return wrapNoInt(pwrite, fd, buf, count, offset);\n}\n\nssize_t writevNoInt(int fd, const iovec* iov, int count) {\n return wrapNoInt(writev, fd, iov, count);\n}\n\nssize_t readFull(int fd, void* buf, size_t count) {\n return wrapFull(read, fd, buf, count);\n}\n\nssize_t preadFull(int fd, void* buf, size_t count, off_t offset) {\n return wrapFull(pread, fd, buf, count, offset);\n}\n\nssize_t writeFull(int fd, const void* buf, size_t count) {\n return wrapFull(write, fd, const_cast<void*>(buf), count);\n}\n\nssize_t pwriteFull(int fd, const void* buf, size_t count, off_t offset) {\n return wrapFull(pwrite, fd, const_cast<void*>(buf), count, offset);\n}\n\nssize_t readvFull(int fd, iovec* iov, int count) {\n return wrapvFull(readv, fd, iov, count);\n}\n\n#ifdef FOLLY_HAVE_PREADV\nssize_t preadvFull(int fd, iovec* iov, int count, off_t offset) {\n return wrapvFull(preadv, fd, iov, count, offset);\n}\n#endif\n\nssize_t writevFull(int fd, iovec* iov, int count) {\n return wrapvFull(writev, fd, iov, count);\n}\n\n#ifdef FOLLY_HAVE_PWRITEV\nssize_t pwritevFull(int fd, iovec* iov, int count, off_t offset) {\n return wrapvFull(pwritev, fd, iov, count, offset);\n}\n#endif\n\n} \/\/ namespaces\n\n<commit_msg>fix folly compilation on FreeBSD<commit_after>\/*\n * Copyright 2013 Facebook, Inc.\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n *\/\n\n#include \"folly\/FileUtil.h\"\n\n#include <cerrno>\n#ifdef __APPLE__\n#include <fcntl.h>\n#endif\n\n#include \"folly\/detail\/FileUtilDetail.h\"\n\nnamespace folly {\n\nusing namespace fileutil_detail;\n\nint openNoInt(const char* name, int flags, mode_t mode) {\n return wrapNoInt(open, name, flags, mode);\n}\n\nint closeNoInt(int fd) {\n int r = close(fd);\n \/\/ Ignore EINTR. On Linux, close() may only return EINTR after the file\n \/\/ descriptor has been closed, so you must not retry close() on EINTR --\n \/\/ in the best case, you'll get EBADF, and in the worst case, you'll end up\n \/\/ closing a different file (one opened from another thread).\n \/\/\n \/\/ Interestingly enough, the Single Unix Specification says that the state\n \/\/ of the file descriptor is unspecified if close returns EINTR. In that\n \/\/ case, the safe thing to do is also not to retry close() -- leaking a file\n \/\/ descriptor is probably better than closing the wrong file.\n if (r == -1 && errno == EINTR) {\n r = 0;\n }\n return r;\n}\n\nint fsyncNoInt(int fd) {\n return wrapNoInt(fsync, fd);\n}\n\nint fdatasyncNoInt(int fd) {\n#if defined(__APPLE__)\n return wrapNoInt(fcntl, fd, F_FULLFSYNC);\n#elif defined(__FreeBSD__)\n return wrapNoInt(fsync, fd);\n#else\n return wrapNoInt(fdatasync, fd);\n#endif\n}\n\nint ftruncateNoInt(int fd, off_t len) {\n return wrapNoInt(ftruncate, fd, len);\n}\n\nint truncateNoInt(const char* path, off_t len) {\n return wrapNoInt(truncate, path, len);\n}\n\nssize_t readNoInt(int fd, void* buf, size_t count) {\n return wrapNoInt(read, fd, buf, count);\n}\n\nssize_t preadNoInt(int fd, void* buf, size_t count, off_t offset) {\n return wrapNoInt(pread, fd, buf, count, offset);\n}\n\nssize_t readvNoInt(int fd, const iovec* iov, int count) {\n return wrapNoInt(writev, fd, iov, count);\n}\n\nssize_t writeNoInt(int fd, const void* buf, size_t count) {\n return wrapNoInt(write, fd, buf, count);\n}\n\nssize_t pwriteNoInt(int fd, const void* buf, size_t count, off_t offset) {\n return wrapNoInt(pwrite, fd, buf, count, offset);\n}\n\nssize_t writevNoInt(int fd, const iovec* iov, int count) {\n return wrapNoInt(writev, fd, iov, count);\n}\n\nssize_t readFull(int fd, void* buf, size_t count) {\n return wrapFull(read, fd, buf, count);\n}\n\nssize_t preadFull(int fd, void* buf, size_t count, off_t offset) {\n return wrapFull(pread, fd, buf, count, offset);\n}\n\nssize_t writeFull(int fd, const void* buf, size_t count) {\n return wrapFull(write, fd, const_cast<void*>(buf), count);\n}\n\nssize_t pwriteFull(int fd, const void* buf, size_t count, off_t offset) {\n return wrapFull(pwrite, fd, const_cast<void*>(buf), count, offset);\n}\n\nssize_t readvFull(int fd, iovec* iov, int count) {\n return wrapvFull(readv, fd, iov, count);\n}\n\n#ifdef FOLLY_HAVE_PREADV\nssize_t preadvFull(int fd, iovec* iov, int count, off_t offset) {\n return wrapvFull(preadv, fd, iov, count, offset);\n}\n#endif\n\nssize_t writevFull(int fd, iovec* iov, int count) {\n return wrapvFull(writev, fd, iov, count);\n}\n\n#ifdef FOLLY_HAVE_PWRITEV\nssize_t pwritevFull(int fd, iovec* iov, int count, off_t offset) {\n return wrapvFull(pwritev, fd, iov, count, offset);\n}\n#endif\n\n} \/\/ namespaces\n\n<|endoftext|>"} {"text":"<commit_before>#include \"stdafx.h\"\n#include \"Storage.h\"\n\n\nStorage::Storage()\n{\n}\n\n\nFoneOSString Storage::GetBasePath()\n{\n char * prefPath;\n#ifdef SIMULATOR_BUILD\n prefPath = SDL_GetPrefPath(\"Flippers\", \"foneOS\");\n#else\n prefPath = \"\/fone\/\";\n#endif\n\tFoneOSString prefPathStr;\n\n\tprefPathStr = Utils::CharArrayToFoneOSString(prefPath);\n\n\treturn prefPathStr;\n}\n\n\nFoneOSString Storage::GetFullPath(FoneOSString baseStr)\n{\n\treturn Storage::GetBasePath() + baseStr;\n}\n\n\nbool Storage::FileExists(FoneOSString fileName)\n{\n\tstd::ifstream test(Storage::GetFullPath(fileName));\n\tbool resp = test.good();\n\ttest.close();\n\treturn resp;\n}\n\n\nbool Storage::RemoveFile(FoneOSString fileName)\n{\n\t\/\/ \"Why isn't this called DeleteFile?\"\n\t\/\/ \"Because then Windows' macros would change it to DeleteFileW.\"\n\tif (!Storage::FileExists(fileName))\n\t{\n\t\treturn false;\n\t}\n\treturn remove(Utils::FoneOSStringToCharArray(Storage::GetFullPath(fileName))) == 0;\n}\n\n\nFoneOSString Storage::ReadAllText(FoneOSString fileName)\n{\n\tFoneOSIFileStream file;\n\tfile.open(Storage::GetFullPath(fileName));\n\tif (file.good())\n\t{\n\t\tFoneOSString retVal;\n\t\tFoneOSString chunk;\n\t\tbool firstTime = true;\n\t\twhile (!file.eof())\n\t\t{\n\t\t\tif (firstTime)\n\t\t\t{\n\t\t\t\tfirstTime = false;\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\tretVal += STR(\" \");\n\t\t\t}\n\t\t\tfile >> chunk;\n\t\t\tretVal += chunk;\n\t\t}\n\n\t\tfile.close();\n\n\t\treturn retVal;\n\t}\n\telse\n\t{\n\t\treturn STR(\"\");\n\t}\n}\n<commit_msg>Change pref path organization name<commit_after>#include \"stdafx.h\"\n#include \"Storage.h\"\n\n\nStorage::Storage()\n{\n}\n\n\nFoneOSString Storage::GetBasePath()\n{\n char * prefPath;\n#ifdef SIMULATOR_BUILD\n prefPath = SDL_GetPrefPath(\"foneOS\", \"foneOS\");\n#else\n prefPath = \"\/fone\/\";\n#endif\n\tFoneOSString prefPathStr;\n\n\tprefPathStr = Utils::CharArrayToFoneOSString(prefPath);\n\n\treturn prefPathStr;\n}\n\n\nFoneOSString Storage::GetFullPath(FoneOSString baseStr)\n{\n\treturn Storage::GetBasePath() + baseStr;\n}\n\n\nbool Storage::FileExists(FoneOSString fileName)\n{\n\tstd::ifstream test(Storage::GetFullPath(fileName));\n\tbool resp = test.good();\n\ttest.close();\n\treturn resp;\n}\n\n\nbool Storage::RemoveFile(FoneOSString fileName)\n{\n\t\/\/ \"Why isn't this called DeleteFile?\"\n\t\/\/ \"Because then Windows' macros would change it to DeleteFileW.\"\n\tif (!Storage::FileExists(fileName))\n\t{\n\t\treturn false;\n\t}\n\treturn remove(Utils::FoneOSStringToCharArray(Storage::GetFullPath(fileName))) == 0;\n}\n\n\nFoneOSString Storage::ReadAllText(FoneOSString fileName)\n{\n\tFoneOSIFileStream file;\n\tfile.open(Storage::GetFullPath(fileName));\n\tif (file.good())\n\t{\n\t\tFoneOSString retVal;\n\t\tFoneOSString chunk;\n\t\tbool firstTime = true;\n\t\twhile (!file.eof())\n\t\t{\n\t\t\tif (firstTime)\n\t\t\t{\n\t\t\t\tfirstTime = false;\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\tretVal += STR(\" \");\n\t\t\t}\n\t\t\tfile >> chunk;\n\t\t\tretVal += chunk;\n\t\t}\n\n\t\tfile.close();\n\n\t\treturn retVal;\n\t}\n\telse\n\t{\n\t\treturn STR(\"\");\n\t}\n}\n<|endoftext|>"} {"text":"<commit_before>#include \"football_field.h\"\n#include <QDebug>\n\n#define keycontrast(KEY) (10 - (KEY))\n#define red_win(X, Y) ((Y) == -26 && (X) <= 2 && (X) >= -2)\n#define blue_win(X, Y) ((Y) == 26 && (X) <= 2 && (X) >= -2)\n\n\/\/ Конструктор\nFootballField::FootballField()\n{\n \/\/ Зануляем массив.\n for(int i = 0; i < FIELD_WIDTH \/ PX_SCALE + 1; i++){\n for(int j = 0; j < FIELD_HEIGHT \/ PX_SCALE + 1; j++){\n points[i][j] = NULL;\n }\n }\n\n \/\/ Стартовая точка.\n FLD_POINT(0, 0) = new FPoint(0, 0);\n\n \/\/ Создаём ворота.\n FLD_POINT(-3, -25) = new FPoint(-3, -25, true);\n FLD_POINT( 3, -25) = new FPoint( 3, -25, true);\n FLD_POINT(-3, 25) = new FPoint(-3, 25, true);\n FLD_POINT( 3, 25) = new FPoint( 3, 25, true);\n\n \/\/ Создаём коробку (окружающие поле стены).\n for(int y = -26; y <= 26; y++){\n FLD_POINT(-20, y) = new FPoint(-20, y, true);\n FLD_POINT( 20, y) = new FPoint(20, y, true);\n if((y > -20 && y < -2) || (y > 2 && y < 20)){\n FLD_POINT(y, 26) = new FPoint(y, 26, true);\n FLD_POINT(y, -26) = new FPoint(y, -26, true);\n }\n }\n\n \/\/ Мячик изначально в позиции 0:0\n current_player = 1; \/\/ 1 (blue) -1 (red)\n}\n\n\/\/ Деструктор\nFootballField::~FootballField(){\n \/\/\n for(int i = 0; i < FIELD_WIDTH \/ PX_SCALE + 1; i++){\n for(int j = 0; j < FIELD_HEIGHT \/ PX_SCALE + 1; j++){\n delete points[i][j];\n }\n }\n}\n\nbool FootballField::try_step(int key){\n if (gameover)\n return false;\n\n if (penalty_mode){\n return try_penalty(key);\n }\n\n if (can_step(KEYS[key][0], KEYS[key][1])){\n signed char x = ball.x + KEYS[key][0],\n y = ball.y + KEYS[key][1];\n if(red_win(x, y)){\n winner = -1;\n qDebug() << \"red player winner!\\n\";\n gameover = true;\n show_ball = false;\n }\n if(blue_win(x, y)){\n winner = 1;\n qDebug() << \"blue player winner!\\n\";\n gameover = true;\n show_ball = false;\n }\n if(gameover){\n steps.push_back(key * current_player);\n return true;\n }\n steps.push_back(key * current_player);\n FLD_POINT(x, y) = new FPoint(x, y);\n FLD_POINT(x, y)->push(FLD_POINT(ball.x, ball.y));\n FLD_POINT(ball.x, ball.y)->push(FLD_POINT(x, y));\n ball.step(KEYS[key][0], KEYS[key][1]);\n if(penalty_kick()){\n qDebug() << \"PENALTY\";\n }\n else if(current_step == 3){\n current_player *= -1;\n current_step = 1;\n }\n else\n ++current_step;\n\n return true;\n }\n return false;\n}\n\nbool FootballField::try_penalty(int key){\n signed char x = ball.x + KEYS[key][0],\n y = ball.y + KEYS[key][1];\n \/\/ Validates\n for(int i = 0; i < 6; i++){\n if (FLD_POINT(x, y) != NULL && FLD_POINT(x, y)->is_wall)\n return false;\n if(red_win(x, y)){\n winner = -1;\n qDebug() << \"red player winner!\\n\";\n gameover = true;\n show_ball = false;\n }\n if(blue_win(x, y)){\n winner = 1;\n qDebug() << \"blue player winner!\\n\";\n gameover = true;\n show_ball = false;\n }\n if(gameover){\n for(; i >= 0; i--)\n steps.push_back(key * current_player);\n return true;\n }\n x += KEYS[key][0];\n y += KEYS[key][1];\n }\n\n \/\/ return to first point\n x = ball.x + KEYS[key][0];\n y = ball.y + KEYS[key][1];\n \/\/ Real ball moves\n for(int i = 0; i < 6; i++){\n steps.push_back(key * current_player);\n if(FLD_POINT(x, y) == NULL)\n FLD_POINT(x, y) = new FPoint(x, y);\n FLD_POINT(x, y)->push(FLD_POINT(ball.x, ball.y));\n FLD_POINT(ball.x, ball.y)->push(FLD_POINT(x, y));\n ball.step(KEYS[key][0], KEYS[key][1]);\n x += KEYS[key][0];\n y += KEYS[key][1];\n }\n\n if(penalty_kick()){\n qDebug() << \"one more PENALTY\";\n }\n else if (current_step == 3) {\n current_player *= -1;\n current_step = 1;\n }\n else\n ++current_step;\n return true;\n}\n\nbool FootballField::can_step_from(signed char x, signed char y, int bx, int by){\n const int old_x = ball.x,\n old_y = ball.y;\n ball.x = bx;\n ball.y = by;\n bool result = can_step(x, y);\n ball.x = old_x;\n ball.y = old_y;\n return result;\n}\n\nbool FootballField::can_step(signed char x, signed char y){\n int new_x = ball.x + x,\n new_y = ball.y + y;\n if (FLD_POINT(new_x, new_y) != NULL && FLD_POINT(new_x, new_y)->is_wall)\n return false;\n return (FLD_POINT(new_x, new_y) == NULL) && (!(abs(x) == 1 && abs(y) == 1) || diagstep(x, y));\n}\n\nbool FootballField::diagstep(signed char x, signed char y){\n \/\/ Находим пересекаемую диагональ\n if (x == 1 && y == 1)\n return can_diagstep(ball.x, ball.y + 1, ball.x + 1, ball.y);\n else if (x == 1 && y == -1)\n return can_diagstep(ball.x + 1, ball.y, ball.x, ball.y - 1);\n else if (x == -1 && y == -1)\n return can_diagstep(ball.x, ball.y - 1, ball.x - 1, ball.y);\n else if (x == -1 && y == 1)\n return can_diagstep(ball.x - 1, ball.y, ball.x, ball.y + 1);\n return false;\n}\n\nbool FootballField::can_diagstep(signed char bx, signed char by, signed char ex, signed char ey){\n if (FLD_POINT(bx, by) == NULL || FLD_POINT(ex, ey) == NULL || \/\/ Если хоть одна из точек пустая\n FLD_POINT(bx, by)->is_wall || FLD_POINT(ex, ey)->is_wall) \/\/ или является стеной\n return true;\n return !(FLD_POINT(bx, by)->include(ex, ey));\n}\n\nbool FootballField::penalty_kick(){\n if(current_step == 3){\n penalty_mode = !can_move_3x();\n }\n else {\n penalty_mode = !can_move_1x();\n if(penalty_mode){\n \/\/ You has clamped yourself!!!\n current_player *= -1;\n current_step = 3;\n }\n }\n return penalty_mode;\n}\n\nint FootballField::only_one_way(){\n int has_one = 0;\n for(int i = 1; i <= 9; i++){\n if(i == 5) continue;\n if(can_step(KEYS[i][0], KEYS[i][1])){\n if(has_one) return 0;\n has_one = i;\n }\n }\n return has_one;\n}\n\nbool FootballField::can_move_1x(){\n for(int i = 1; i <= 9; i++){\n if(i == 5) continue;\n if(can_step(KEYS[i][0], KEYS[i][1])) return true;\n }\n return false;\n}\n\nbool FootballField::can_move_3x(){\n for(int i = 1; i <= 9; i++){\n if(i == 5) continue;\n for(int j = 1; j <= 9; j++){\n if(j == 5 || j == keycontrast(i)) continue;\n for(int k = 1; k <= 9; k++){\n if(k == 5 || k == keycontrast(j)) continue;\n\n if(!can_step(KEYS[i][0], KEYS[i][1])) continue;\n\n ball.step(KEYS[i][0], KEYS[i][1]);\n if(!can_step(KEYS[j][0], KEYS[j][1])){\n ball.step(KEYS[keycontrast(i)][0], KEYS[keycontrast(i)][1]);\n continue;\n }\n\n ball.step(KEYS[j][0], KEYS[j][1]);\n bool result = can_step(KEYS[k][0], KEYS[k][1]);\n ball.step(KEYS[keycontrast(j)][0], KEYS[keycontrast(j)][1]);\n ball.step(KEYS[keycontrast(i)][0], KEYS[keycontrast(i)][1]);\n if(result) return true;\n }\n }\n }\n return false;\n}\n<commit_msg>Small refactor<commit_after>#include \"football_field.h\"\n#include <QDebug>\n\n#define keycontrast(KEY) (10 - (KEY))\n#define red_win(X, Y) ((Y) == -26 && (X) <= 2 && (X) >= -2)\n#define blue_win(X, Y) ((Y) == 26 && (X) <= 2 && (X) >= -2)\n\n\/\/ Конструктор\nFootballField::FootballField()\n{\n \/\/ Зануляем массив.\n for(int i = 0; i < FIELD_WIDTH \/ PX_SCALE + 1; i++){\n for(int j = 0; j < FIELD_HEIGHT \/ PX_SCALE + 1; j++){\n points[i][j] = NULL;\n }\n }\n\n \/\/ Стартовая точка.\n FLD_POINT(0, 0) = new FPoint(0, 0);\n\n \/\/ Создаём ворота.\n FLD_POINT(-3, -25) = new FPoint(-3, -25, true);\n FLD_POINT( 3, -25) = new FPoint( 3, -25, true);\n FLD_POINT(-3, 25) = new FPoint(-3, 25, true);\n FLD_POINT( 3, 25) = new FPoint( 3, 25, true);\n\n \/\/ Создаём коробку (окружающие поле стены).\n for(int y = -26; y <= 26; y++){\n FLD_POINT(-20, y) = new FPoint(-20, y, true);\n FLD_POINT( 20, y) = new FPoint(20, y, true);\n if((y > -20 && y < -2) || (y > 2 && y < 20)){\n FLD_POINT(y, 26) = new FPoint(y, 26, true);\n FLD_POINT(y, -26) = new FPoint(y, -26, true);\n }\n }\n\n \/\/ Мячик изначально в позиции 0:0\n current_player = 1; \/\/ 1 (blue) -1 (red)\n}\n\n\/\/ Деструктор\nFootballField::~FootballField(){\n \/\/\n for(int i = 0; i < FIELD_WIDTH \/ PX_SCALE + 1; i++){\n for(int j = 0; j < FIELD_HEIGHT \/ PX_SCALE + 1; j++){\n delete points[i][j];\n }\n }\n}\n\nbool FootballField::try_step(int key){\n if (gameover)\n return false;\n\n if (penalty_mode){\n return try_penalty(key);\n }\n\n if (can_step(KEYS[key][0], KEYS[key][1])){\n signed char x = ball.x + KEYS[key][0],\n y = ball.y + KEYS[key][1];\n if(red_win(x, y)){\n winner = -1;\n qDebug() << \"red player winner!\\n\";\n gameover = true;\n show_ball = false;\n }\n if(blue_win(x, y)){\n winner = 1;\n qDebug() << \"blue player winner!\\n\";\n gameover = true;\n show_ball = false;\n }\n if(gameover){\n steps.push_back(key * current_player);\n return true;\n }\n steps.push_back(key * current_player);\n FLD_POINT(x, y) = new FPoint(x, y);\n FLD_POINT(x, y)->push(FLD_POINT(ball.x, ball.y));\n FLD_POINT(ball.x, ball.y)->push(FLD_POINT(x, y));\n ball.step(KEYS[key][0], KEYS[key][1]);\n if(penalty_kick()){\n qDebug() << \"PENALTY\";\n }\n else if(current_step == 3){\n current_player *= -1;\n current_step = 1;\n }\n else\n ++current_step;\n\n return true;\n }\n return false;\n}\n\nbool FootballField::try_penalty(int key){\n signed char x = ball.x + KEYS[key][0],\n y = ball.y + KEYS[key][1];\n \/\/ Validates\n for(int i = 0; i < 6; i++){\n if (FLD_POINT(x, y) != NULL && FLD_POINT(x, y)->is_wall)\n return false;\n if(red_win(x, y)){\n winner = -1;\n qDebug() << \"red player winner!\\n\";\n gameover = true;\n }\n if(blue_win(x, y)){\n winner = 1;\n qDebug() << \"blue player winner!\\n\";\n gameover = true;\n }\n if(gameover){\n show_ball = false;\n for(; i >= 0; i--)\n steps.push_back(key * current_player);\n return true;\n }\n x += KEYS[key][0];\n y += KEYS[key][1];\n }\n\n \/\/ return to first point\n x = ball.x + KEYS[key][0];\n y = ball.y + KEYS[key][1];\n \/\/ Real ball moves\n for(int i = 0; i < 6; i++){\n steps.push_back(key * current_player);\n if(FLD_POINT(x, y) == NULL)\n FLD_POINT(x, y) = new FPoint(x, y);\n FLD_POINT(x, y)->push(FLD_POINT(ball.x, ball.y));\n FLD_POINT(ball.x, ball.y)->push(FLD_POINT(x, y));\n ball.step(KEYS[key][0], KEYS[key][1]);\n x += KEYS[key][0];\n y += KEYS[key][1];\n }\n\n if(penalty_kick()){\n qDebug() << \"one more PENALTY\";\n }\n else if (current_step == 3) {\n current_player *= -1;\n current_step = 1;\n }\n else\n ++current_step;\n return true;\n}\n\nbool FootballField::can_step_from(signed char x, signed char y, int bx, int by){\n const int old_x = ball.x,\n old_y = ball.y;\n ball.x = bx;\n ball.y = by;\n bool result = can_step(x, y);\n ball.x = old_x;\n ball.y = old_y;\n return result;\n}\n\nbool FootballField::can_step(signed char x, signed char y){\n int new_x = ball.x + x,\n new_y = ball.y + y;\n if (FLD_POINT(new_x, new_y) != NULL && FLD_POINT(new_x, new_y)->is_wall)\n return false;\n return (FLD_POINT(new_x, new_y) == NULL) && (!(abs(x) == 1 && abs(y) == 1) || diagstep(x, y));\n}\n\nbool FootballField::diagstep(signed char x, signed char y){\n \/\/ Находим пересекаемую диагональ\n if (x == 1 && y == 1)\n return can_diagstep(ball.x, ball.y + 1, ball.x + 1, ball.y);\n else if (x == 1 && y == -1)\n return can_diagstep(ball.x + 1, ball.y, ball.x, ball.y - 1);\n else if (x == -1 && y == -1)\n return can_diagstep(ball.x, ball.y - 1, ball.x - 1, ball.y);\n else if (x == -1 && y == 1)\n return can_diagstep(ball.x - 1, ball.y, ball.x, ball.y + 1);\n return false;\n}\n\nbool FootballField::can_diagstep(signed char bx, signed char by, signed char ex, signed char ey){\n if (FLD_POINT(bx, by) == NULL || FLD_POINT(ex, ey) == NULL || \/\/ Если хоть одна из точек пустая\n FLD_POINT(bx, by)->is_wall || FLD_POINT(ex, ey)->is_wall) \/\/ или является стеной\n return true;\n return !(FLD_POINT(bx, by)->include(ex, ey));\n}\n\nbool FootballField::penalty_kick(){\n if(current_step == 3){\n penalty_mode = !can_move_3x();\n }\n else {\n penalty_mode = !can_move_1x();\n if(penalty_mode){\n \/\/ You has clamped yourself!!!\n current_player *= -1;\n current_step = 3;\n }\n }\n return penalty_mode;\n}\n\nint FootballField::only_one_way(){\n int has_one = 0;\n for(int i = 1; i <= 9; i++){\n if(i == 5) continue;\n if(can_step(KEYS[i][0], KEYS[i][1])){\n if(has_one) return 0;\n has_one = i;\n }\n }\n return has_one;\n}\n\nbool FootballField::can_move_1x(){\n for(int i = 1; i <= 9; i++){\n if(i == 5) continue;\n if(can_step(KEYS[i][0], KEYS[i][1])) return true;\n }\n return false;\n}\n\nbool FootballField::can_move_3x(){\n for(int i = 1; i <= 9; i++){\n if(i == 5) continue;\n for(int j = 1; j <= 9; j++){\n if(j == 5 || j == keycontrast(i)) continue;\n for(int k = 1; k <= 9; k++){\n if(k == 5 || k == keycontrast(j)) continue;\n\n if(!can_step(KEYS[i][0], KEYS[i][1])) continue;\n\n ball.step(KEYS[i][0], KEYS[i][1]);\n if(!can_step(KEYS[j][0], KEYS[j][1])){\n ball.step(KEYS[keycontrast(i)][0], KEYS[keycontrast(i)][1]);\n continue;\n }\n\n ball.step(KEYS[j][0], KEYS[j][1]);\n bool result = can_step(KEYS[k][0], KEYS[k][1]);\n ball.step(KEYS[keycontrast(j)][0], KEYS[keycontrast(j)][1]);\n ball.step(KEYS[keycontrast(i)][0], KEYS[keycontrast(i)][1]);\n if(result) return true;\n }\n }\n }\n return false;\n}\n<|endoftext|>"} {"text":"<commit_before>\/*************************************************************************\n *\n * OpenOffice.org - a multi-platform office productivity suite\n *\n * $RCSfile: javaoptions.cxx,v $\n *\n * $Revision: 1.5 $\n *\n * last change: $Author: rt $ $Date: 2005-09-08 14:41: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 GCC\n#pragma hdrstop\n#endif\n\n#ifndef _SVTOOLS_JAVAPTIONS_HXX\n#include <javaoptions.hxx>\n#endif\n#ifndef _COM_SUN_STAR_UNO_ANY_H_\n#include <com\/sun\/star\/uno\/Any.h>\n#endif\n#ifndef _COM_SUN_STAR_UNO_SEQUENCE_HXX_\n#include <com\/sun\/star\/uno\/Sequence.hxx>\n#endif\n\nusing namespace ::com::sun::star::uno;\nusing namespace ::rtl;\n\n#define C2U(cChar) OUString::createFromAscii(cChar)\n#define CFG_READONLY_DEFAULT sal_False\n\/* -----------------------------10.04.01 12:39--------------------------------\n\n ---------------------------------------------------------------------------*\/\nclass SvtExecAppletsItem_Impl : public utl::ConfigItem\n{\n sal_Bool bExecute;\n sal_Bool bRO;\npublic:\n SvtExecAppletsItem_Impl();\n\n virtual void Commit();\n\n sal_Bool IsExecuteApplets() const {return bExecute;}\n void SetExecuteApplets(sal_Bool bSet);\n sal_Bool IsReadOnly() const {return bRO;}\n};\n\/* -----------------------------10.02.2003 07:46------------------------------\n\n ---------------------------------------------------------------------------*\/\nvoid SvtExecAppletsItem_Impl::SetExecuteApplets(sal_Bool bSet)\n{\n OSL_ENSURE(!bRO, \"SvtExecAppletsItem_Impl::SetExecuteApplets()\\nYou tried to write on a readonly value!\\n\");\n if (!bRO)\n {\n bExecute = bSet;\n SetModified();\n }\n}\n\/* -----------------------------18.05.01 14:44--------------------------------\n\n ---------------------------------------------------------------------------*\/\nSvtExecAppletsItem_Impl::SvtExecAppletsItem_Impl() :\n utl::ConfigItem(C2U(\"Office.Common\/Java\/Applet\")),\n bRO (CFG_READONLY_DEFAULT ),\n bExecute (sal_False )\n{\n Sequence< OUString > aNames(1);\n aNames.getArray()[0] = C2U(\"Enable\");\n Sequence< Any > aValues = GetProperties(aNames);\n Sequence< sal_Bool > aROStates = GetReadOnlyStates(aNames);\n const Any* pValues = aValues.getConstArray();\n const sal_Bool* pROStates = aROStates.getConstArray();\n if(aValues.getLength() && aROStates.getLength() && pValues[0].hasValue())\n {\n bExecute = *(sal_Bool*)pValues[0].getValue();\n bRO = pROStates[0];\n }\n}\nvoid SvtExecAppletsItem_Impl::Commit()\n{\n if (bRO)\n return;\n\n Sequence< OUString > aNames(1);\n aNames.getArray()[0] = C2U(\"Enable\");\n Sequence< Any > aValues(1);\n aValues.getArray()[0].setValue(&bExecute, ::getBooleanCppuType());\n PutProperties(aNames, aValues);\n}\n\n\nstruct SvtJavaOptions_Impl\n{\n SvtExecAppletsItem_Impl aExecItem;\n Sequence<OUString> aPropertyNames;\n sal_Bool bEnabled;\n sal_Bool bSecurity;\n sal_Int32 nNetAccess;\n rtl::OUString sUserClassPath;\n\n sal_Bool bROEnabled;\n sal_Bool bROSecurity;\n sal_Bool bRONetAccess;\n sal_Bool bROUserClassPath;\n\n SvtJavaOptions_Impl() :\n aPropertyNames(4),\n bEnabled (sal_False),\n bSecurity (sal_False),\n nNetAccess (0),\n bROEnabled (CFG_READONLY_DEFAULT),\n bROSecurity (CFG_READONLY_DEFAULT),\n bRONetAccess (CFG_READONLY_DEFAULT),\n bROUserClassPath (CFG_READONLY_DEFAULT)\n {\n OUString* pNames = aPropertyNames.getArray();\n pNames[0] = C2U(\"Enable\");\n pNames[1] = C2U(\"Security\");\n pNames[2] = C2U(\"NetAccess\");\n pNames[3] = C2U(\"UserClassPath\");\n }\n};\n\/* -----------------------------18.05.01 13:28--------------------------------\n\n ---------------------------------------------------------------------------*\/\nSvtJavaOptions::SvtJavaOptions() :\n utl::ConfigItem(C2U(\"Office.Java\/VirtualMachine\")),\n pImpl(new SvtJavaOptions_Impl)\n{\n Sequence< Any > aValues = GetProperties(pImpl->aPropertyNames);\n Sequence< sal_Bool > aROStates = GetReadOnlyStates(pImpl->aPropertyNames);\n const Any* pValues = aValues.getConstArray();\n const sal_Bool* pROStates = aROStates.getConstArray();\n if ( aValues.getLength() == pImpl->aPropertyNames.getLength() && aROStates.getLength() == pImpl->aPropertyNames.getLength() )\n {\n for ( int nProp = 0; nProp < pImpl->aPropertyNames.getLength(); nProp++ )\n {\n if( pValues[nProp].hasValue() )\n {\n switch ( nProp )\n {\n case 0: pImpl->bEnabled = *(sal_Bool*)pValues[nProp].getValue(); break;\n case 1: pImpl->bSecurity = *(sal_Bool*)pValues[nProp].getValue();break;\n case 2: pValues[nProp] >>= pImpl->nNetAccess; break;\n case 3: pValues[nProp] >>= pImpl->sUserClassPath; break;\n }\n }\n }\n pImpl->bROEnabled = pROStates[0];\n pImpl->bROSecurity = pROStates[1];\n pImpl->bRONetAccess = pROStates[2];\n pImpl->bROUserClassPath = pROStates[3];\n }\n}\n\/* -----------------------------18.05.01 13:28--------------------------------\n\n ---------------------------------------------------------------------------*\/\nSvtJavaOptions::~SvtJavaOptions()\n{\n delete pImpl;\n}\n\/*-- 18.05.01 13:28:35---------------------------------------------------\n\n -----------------------------------------------------------------------*\/\nvoid SvtJavaOptions::Commit()\n{\n pImpl->aExecItem.Commit();\n\n sal_Int32 nOrgCount = pImpl->aPropertyNames.getLength();\n Sequence< OUString > aNames(nOrgCount);\n Sequence< Any > aValues(nOrgCount);\n sal_Int32 nRealCount = 0;\n\n const Type& rType = ::getBooleanCppuType();\n for(int nProp = 0; nProp < nOrgCount; nProp++)\n {\n switch(nProp)\n {\n case 0:\n {\n if (!pImpl->bROEnabled)\n {\n aValues[nRealCount].setValue(&pImpl->bEnabled, rType);\n aNames[nRealCount] = pImpl->aPropertyNames[nProp];\n ++nRealCount;\n }\n }\n break;\n case 1:\n {\n if (!pImpl->bROSecurity)\n {\n aValues[nRealCount].setValue(&pImpl->bSecurity, rType);\n aNames[nRealCount] = pImpl->aPropertyNames[nProp];\n ++nRealCount;\n }\n }\n break;\n case 2:\n {\n if (!pImpl->bRONetAccess)\n {\n aValues[nRealCount] <<= pImpl->nNetAccess;\n aNames[nRealCount] = pImpl->aPropertyNames[nProp];\n ++nRealCount;\n }\n }\n break;\n case 3:\n {\n if (!pImpl->bROUserClassPath)\n {\n aValues[nRealCount] <<= pImpl->sUserClassPath;\n aNames[nRealCount] = pImpl->aPropertyNames[nProp];\n ++nRealCount;\n }\n }\n break;\n }\n }\n aValues.realloc(nRealCount);\n aNames.realloc(nRealCount);\n PutProperties(aNames,aValues);\n}\n\/*-- 18.05.01 13:28:35---------------------------------------------------\n\n -----------------------------------------------------------------------*\/\nsal_Bool SvtJavaOptions::IsEnabled() const\n{\n return pImpl->bEnabled;\n}\n\/*-- 18.05.01 13:28:35---------------------------------------------------\n\n -----------------------------------------------------------------------*\/\nsal_Bool SvtJavaOptions::IsSecurity()const\n{\n return pImpl->bSecurity;\n}\n\/*-- 18.05.01 13:28:35---------------------------------------------------\n\n -----------------------------------------------------------------------*\/\nsal_Int32 SvtJavaOptions::GetNetAccess() const\n{\n return pImpl->nNetAccess;\n}\n\/*-- 18.05.01 13:28:36---------------------------------------------------\n\n -----------------------------------------------------------------------*\/\nrtl::OUString& SvtJavaOptions::GetUserClassPath()const\n{\n return pImpl->sUserClassPath;\n}\n\/*-- 18.05.01 13:28:37---------------------------------------------------\n\n -----------------------------------------------------------------------*\/\nvoid SvtJavaOptions::SetEnabled(sal_Bool bSet)\n{\n OSL_ENSURE(!pImpl->bROEnabled, \"SvtJavaOptions::SetEnabled()\\nYou tried to write on a readonly value!\\n\");\n if(!pImpl->bROEnabled && pImpl->bEnabled != bSet)\n {\n pImpl->bEnabled = bSet;\n SetModified();\n }\n}\n\/*-- 18.05.01 13:28:38---------------------------------------------------\n\n -----------------------------------------------------------------------*\/\nvoid SvtJavaOptions::SetSecurity(sal_Bool bSet)\n{\n OSL_ENSURE(!pImpl->bROSecurity, \"SvtJavaOptions::SetSecurity()\\nYou tried to write on a readonly value!\\n\");\n if(!pImpl->bROSecurity && pImpl->bSecurity != bSet)\n {\n pImpl->bSecurity = bSet;\n SetModified();\n }\n}\n\/*-- 18.05.01 13:28:38---------------------------------------------------\n\n -----------------------------------------------------------------------*\/\nvoid SvtJavaOptions::SetNetAccess(sal_Int32 nSet)\n{\n OSL_ENSURE(!pImpl->bRONetAccess, \"SvtJavaOptions::SetNetAccess()\\nYou tried to write on a readonly value!\\n\");\n if(!pImpl->bRONetAccess && pImpl->nNetAccess != nSet)\n {\n pImpl->nNetAccess = nSet;\n SetModified();\n }\n}\n\/*-- 18.05.01 13:28:38---------------------------------------------------\n\n -----------------------------------------------------------------------*\/\nvoid SvtJavaOptions::SetUserClassPath(const rtl::OUString& rSet)\n{\n OSL_ENSURE(!pImpl->bROUserClassPath, \"SvtJavaOptions::SetUserClassPath()\\nYou tried to write on a readonly value!\\n\");\n if(!pImpl->bROUserClassPath && pImpl->sUserClassPath != rSet)\n {\n pImpl->sUserClassPath = rSet;\n SetModified();\n }\n}\n\n\/*-- 18.05.01 14:34:32---------------------------------------------------\n\n -----------------------------------------------------------------------*\/\nsal_Bool SvtJavaOptions::IsExecuteApplets() const\n{\n return pImpl->aExecItem.IsExecuteApplets();\n}\n\/*-- 18.05.01 14:34:32---------------------------------------------------\n\n -----------------------------------------------------------------------*\/\nvoid SvtJavaOptions::SetExecuteApplets(sal_Bool bSet)\n{\n if(!pImpl->aExecItem.IsReadOnly() && pImpl->aExecItem.IsExecuteApplets() != bSet)\n {\n pImpl->aExecItem.SetExecuteApplets(bSet);\n SetModified();\n }\n}\n\/*--10.02.2003 08:40---------------------------------------------------\n\n-----------------------------------------------------------------------*\/\nsal_Bool SvtJavaOptions::IsReadOnly( EOption eOption ) const\n{\n sal_Bool bRO = sal_True;\n switch(eOption)\n {\n case E_ENABLED :\n bRO = pImpl->bROEnabled;\n break;\n case E_SECURITY :\n bRO = pImpl->bROSecurity;\n break;\n case E_NETACCESS :\n bRO = pImpl->bRONetAccess;\n break;\n case E_USERCLASSPATH :\n bRO = pImpl->bROUserClassPath;\n break;\n case E_EXECUTEAPPLETS :\n bRO = pImpl->aExecItem.IsReadOnly();\n break;\n }\n return bRO;\n}\n<commit_msg>INTEGRATION: CWS perform06 (1.5.60); FILE MERGED 2005\/10\/25 08:04:04 as 1.5.60.1: #i56589# hold config items alive till office die<commit_after>\/*************************************************************************\n *\n * OpenOffice.org - a multi-platform office productivity suite\n *\n * $RCSfile: javaoptions.cxx,v $\n *\n * $Revision: 1.6 $\n *\n * last change: $Author: rt $ $Date: 2005-11-11 08:51: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 GCC\n#pragma hdrstop\n#endif\n\n#ifndef _SVTOOLS_JAVAPTIONS_HXX\n#include <javaoptions.hxx>\n#endif\n#ifndef _COM_SUN_STAR_UNO_ANY_H_\n#include <com\/sun\/star\/uno\/Any.h>\n#endif\n#ifndef _COM_SUN_STAR_UNO_SEQUENCE_HXX_\n#include <com\/sun\/star\/uno\/Sequence.hxx>\n#endif\n#include <rtl\/logfile.hxx>\n\n\nusing namespace ::com::sun::star::uno;\nusing namespace ::rtl;\n\n#define C2U(cChar) OUString::createFromAscii(cChar)\n#define CFG_READONLY_DEFAULT sal_False\n\/* -----------------------------10.04.01 12:39--------------------------------\n\n ---------------------------------------------------------------------------*\/\nclass SvtExecAppletsItem_Impl : public utl::ConfigItem\n{\n sal_Bool bExecute;\n sal_Bool bRO;\npublic:\n SvtExecAppletsItem_Impl();\n\n virtual void Commit();\n\n sal_Bool IsExecuteApplets() const {return bExecute;}\n void SetExecuteApplets(sal_Bool bSet);\n sal_Bool IsReadOnly() const {return bRO;}\n};\n\/* -----------------------------10.02.2003 07:46------------------------------\n\n ---------------------------------------------------------------------------*\/\nvoid SvtExecAppletsItem_Impl::SetExecuteApplets(sal_Bool bSet)\n{\n OSL_ENSURE(!bRO, \"SvtExecAppletsItem_Impl::SetExecuteApplets()\\nYou tried to write on a readonly value!\\n\");\n if (!bRO)\n {\n bExecute = bSet;\n SetModified();\n }\n}\n\/* -----------------------------18.05.01 14:44--------------------------------\n\n ---------------------------------------------------------------------------*\/\nSvtExecAppletsItem_Impl::SvtExecAppletsItem_Impl() :\n utl::ConfigItem(C2U(\"Office.Common\/Java\/Applet\")),\n bRO (CFG_READONLY_DEFAULT ),\n bExecute (sal_False )\n{\n RTL_LOGFILE_CONTEXT(aLog, \"svtools (???) SvtExecAppletsItem_Impl::SvtExecAppletsItem_Impl()\");\n\n Sequence< OUString > aNames(1);\n aNames.getArray()[0] = C2U(\"Enable\");\n Sequence< Any > aValues = GetProperties(aNames);\n Sequence< sal_Bool > aROStates = GetReadOnlyStates(aNames);\n const Any* pValues = aValues.getConstArray();\n const sal_Bool* pROStates = aROStates.getConstArray();\n if(aValues.getLength() && aROStates.getLength() && pValues[0].hasValue())\n {\n bExecute = *(sal_Bool*)pValues[0].getValue();\n bRO = pROStates[0];\n }\n}\nvoid SvtExecAppletsItem_Impl::Commit()\n{\n if (bRO)\n return;\n\n Sequence< OUString > aNames(1);\n aNames.getArray()[0] = C2U(\"Enable\");\n Sequence< Any > aValues(1);\n aValues.getArray()[0].setValue(&bExecute, ::getBooleanCppuType());\n PutProperties(aNames, aValues);\n}\n\n\nstruct SvtJavaOptions_Impl\n{\n SvtExecAppletsItem_Impl aExecItem;\n Sequence<OUString> aPropertyNames;\n sal_Bool bEnabled;\n sal_Bool bSecurity;\n sal_Int32 nNetAccess;\n rtl::OUString sUserClassPath;\n\n sal_Bool bROEnabled;\n sal_Bool bROSecurity;\n sal_Bool bRONetAccess;\n sal_Bool bROUserClassPath;\n\n SvtJavaOptions_Impl() :\n aPropertyNames(4),\n bEnabled (sal_False),\n bSecurity (sal_False),\n nNetAccess (0),\n bROEnabled (CFG_READONLY_DEFAULT),\n bROSecurity (CFG_READONLY_DEFAULT),\n bRONetAccess (CFG_READONLY_DEFAULT),\n bROUserClassPath (CFG_READONLY_DEFAULT)\n {\n OUString* pNames = aPropertyNames.getArray();\n pNames[0] = C2U(\"Enable\");\n pNames[1] = C2U(\"Security\");\n pNames[2] = C2U(\"NetAccess\");\n pNames[3] = C2U(\"UserClassPath\");\n }\n};\n\/* -----------------------------18.05.01 13:28--------------------------------\n\n ---------------------------------------------------------------------------*\/\nSvtJavaOptions::SvtJavaOptions() :\n utl::ConfigItem(C2U(\"Office.Java\/VirtualMachine\")),\n pImpl(new SvtJavaOptions_Impl)\n{\n RTL_LOGFILE_CONTEXT(aLog, \"svtools (???) SvtJavaOptions::SvtJavaOptions()\");\n\n Sequence< Any > aValues = GetProperties(pImpl->aPropertyNames);\n Sequence< sal_Bool > aROStates = GetReadOnlyStates(pImpl->aPropertyNames);\n const Any* pValues = aValues.getConstArray();\n const sal_Bool* pROStates = aROStates.getConstArray();\n if ( aValues.getLength() == pImpl->aPropertyNames.getLength() && aROStates.getLength() == pImpl->aPropertyNames.getLength() )\n {\n for ( int nProp = 0; nProp < pImpl->aPropertyNames.getLength(); nProp++ )\n {\n if( pValues[nProp].hasValue() )\n {\n switch ( nProp )\n {\n case 0: pImpl->bEnabled = *(sal_Bool*)pValues[nProp].getValue(); break;\n case 1: pImpl->bSecurity = *(sal_Bool*)pValues[nProp].getValue();break;\n case 2: pValues[nProp] >>= pImpl->nNetAccess; break;\n case 3: pValues[nProp] >>= pImpl->sUserClassPath; break;\n }\n }\n }\n pImpl->bROEnabled = pROStates[0];\n pImpl->bROSecurity = pROStates[1];\n pImpl->bRONetAccess = pROStates[2];\n pImpl->bROUserClassPath = pROStates[3];\n }\n}\n\/* -----------------------------18.05.01 13:28--------------------------------\n\n ---------------------------------------------------------------------------*\/\nSvtJavaOptions::~SvtJavaOptions()\n{\n delete pImpl;\n}\n\/*-- 18.05.01 13:28:35---------------------------------------------------\n\n -----------------------------------------------------------------------*\/\nvoid SvtJavaOptions::Commit()\n{\n pImpl->aExecItem.Commit();\n\n sal_Int32 nOrgCount = pImpl->aPropertyNames.getLength();\n Sequence< OUString > aNames(nOrgCount);\n Sequence< Any > aValues(nOrgCount);\n sal_Int32 nRealCount = 0;\n\n const Type& rType = ::getBooleanCppuType();\n for(int nProp = 0; nProp < nOrgCount; nProp++)\n {\n switch(nProp)\n {\n case 0:\n {\n if (!pImpl->bROEnabled)\n {\n aValues[nRealCount].setValue(&pImpl->bEnabled, rType);\n aNames[nRealCount] = pImpl->aPropertyNames[nProp];\n ++nRealCount;\n }\n }\n break;\n case 1:\n {\n if (!pImpl->bROSecurity)\n {\n aValues[nRealCount].setValue(&pImpl->bSecurity, rType);\n aNames[nRealCount] = pImpl->aPropertyNames[nProp];\n ++nRealCount;\n }\n }\n break;\n case 2:\n {\n if (!pImpl->bRONetAccess)\n {\n aValues[nRealCount] <<= pImpl->nNetAccess;\n aNames[nRealCount] = pImpl->aPropertyNames[nProp];\n ++nRealCount;\n }\n }\n break;\n case 3:\n {\n if (!pImpl->bROUserClassPath)\n {\n aValues[nRealCount] <<= pImpl->sUserClassPath;\n aNames[nRealCount] = pImpl->aPropertyNames[nProp];\n ++nRealCount;\n }\n }\n break;\n }\n }\n aValues.realloc(nRealCount);\n aNames.realloc(nRealCount);\n PutProperties(aNames,aValues);\n}\n\/*-- 18.05.01 13:28:35---------------------------------------------------\n\n -----------------------------------------------------------------------*\/\nsal_Bool SvtJavaOptions::IsEnabled() const\n{\n return pImpl->bEnabled;\n}\n\/*-- 18.05.01 13:28:35---------------------------------------------------\n\n -----------------------------------------------------------------------*\/\nsal_Bool SvtJavaOptions::IsSecurity()const\n{\n return pImpl->bSecurity;\n}\n\/*-- 18.05.01 13:28:35---------------------------------------------------\n\n -----------------------------------------------------------------------*\/\nsal_Int32 SvtJavaOptions::GetNetAccess() const\n{\n return pImpl->nNetAccess;\n}\n\/*-- 18.05.01 13:28:36---------------------------------------------------\n\n -----------------------------------------------------------------------*\/\nrtl::OUString& SvtJavaOptions::GetUserClassPath()const\n{\n return pImpl->sUserClassPath;\n}\n\/*-- 18.05.01 13:28:37---------------------------------------------------\n\n -----------------------------------------------------------------------*\/\nvoid SvtJavaOptions::SetEnabled(sal_Bool bSet)\n{\n OSL_ENSURE(!pImpl->bROEnabled, \"SvtJavaOptions::SetEnabled()\\nYou tried to write on a readonly value!\\n\");\n if(!pImpl->bROEnabled && pImpl->bEnabled != bSet)\n {\n pImpl->bEnabled = bSet;\n SetModified();\n }\n}\n\/*-- 18.05.01 13:28:38---------------------------------------------------\n\n -----------------------------------------------------------------------*\/\nvoid SvtJavaOptions::SetSecurity(sal_Bool bSet)\n{\n OSL_ENSURE(!pImpl->bROSecurity, \"SvtJavaOptions::SetSecurity()\\nYou tried to write on a readonly value!\\n\");\n if(!pImpl->bROSecurity && pImpl->bSecurity != bSet)\n {\n pImpl->bSecurity = bSet;\n SetModified();\n }\n}\n\/*-- 18.05.01 13:28:38---------------------------------------------------\n\n -----------------------------------------------------------------------*\/\nvoid SvtJavaOptions::SetNetAccess(sal_Int32 nSet)\n{\n OSL_ENSURE(!pImpl->bRONetAccess, \"SvtJavaOptions::SetNetAccess()\\nYou tried to write on a readonly value!\\n\");\n if(!pImpl->bRONetAccess && pImpl->nNetAccess != nSet)\n {\n pImpl->nNetAccess = nSet;\n SetModified();\n }\n}\n\/*-- 18.05.01 13:28:38---------------------------------------------------\n\n -----------------------------------------------------------------------*\/\nvoid SvtJavaOptions::SetUserClassPath(const rtl::OUString& rSet)\n{\n OSL_ENSURE(!pImpl->bROUserClassPath, \"SvtJavaOptions::SetUserClassPath()\\nYou tried to write on a readonly value!\\n\");\n if(!pImpl->bROUserClassPath && pImpl->sUserClassPath != rSet)\n {\n pImpl->sUserClassPath = rSet;\n SetModified();\n }\n}\n\n\/*-- 18.05.01 14:34:32---------------------------------------------------\n\n -----------------------------------------------------------------------*\/\nsal_Bool SvtJavaOptions::IsExecuteApplets() const\n{\n return pImpl->aExecItem.IsExecuteApplets();\n}\n\/*-- 18.05.01 14:34:32---------------------------------------------------\n\n -----------------------------------------------------------------------*\/\nvoid SvtJavaOptions::SetExecuteApplets(sal_Bool bSet)\n{\n if(!pImpl->aExecItem.IsReadOnly() && pImpl->aExecItem.IsExecuteApplets() != bSet)\n {\n pImpl->aExecItem.SetExecuteApplets(bSet);\n SetModified();\n }\n}\n\/*--10.02.2003 08:40---------------------------------------------------\n\n-----------------------------------------------------------------------*\/\nsal_Bool SvtJavaOptions::IsReadOnly( EOption eOption ) const\n{\n sal_Bool bRO = sal_True;\n switch(eOption)\n {\n case E_ENABLED :\n bRO = pImpl->bROEnabled;\n break;\n case E_SECURITY :\n bRO = pImpl->bROSecurity;\n break;\n case E_NETACCESS :\n bRO = pImpl->bRONetAccess;\n break;\n case E_USERCLASSPATH :\n bRO = pImpl->bROUserClassPath;\n break;\n case E_EXECUTEAPPLETS :\n bRO = pImpl->aExecItem.IsReadOnly();\n break;\n }\n return bRO;\n}\n<|endoftext|>"} {"text":"<commit_before>\/*************************************************************************\n *\n * OpenOffice.org - a multi-platform office productivity suite\n *\n * $RCSfile: tooltiplbox.cxx,v $\n *\n * $Revision: 1.4 $\n *\n * last change: $Author: obo $ $Date: 2006-09-17 14:35: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\/\/ MARKER(update_precomp.py): autogen include statement, do not remove\n#include \"precompiled_svtools.hxx\"\n\n#ifndef SVTOOLS_TOOLTIPLBOX_HXX\n#include \"tooltiplbox.hxx\"\n#endif\n\n#ifndef _SV_HELP_HXX\n#include <vcl\/help.hxx>\n#endif\n\n\/\/ ============================================================================\n\nnamespace svtools {\n\n\/\/ ----------------------------------------------------------------------------\n\nvoid lcl_ToolTipLBox_ShowToolTip( ListBox& rListBox, const HelpEvent& rHEvt )\n{\n \/\/ only show tooltip if helpmode is BALLOON or QUICK\n if ( !( rHEvt.GetMode() & HELPMODE_BALLOON ) && !( rHEvt.GetMode() & HELPMODE_QUICK ) )\n {\n \/\/ else call base class method\n rListBox.ListBox::RequestHelp( rHEvt );\n return ;\n }\n\n \/\/ find the list box entry the mouse points to\n Point aMousePos( rListBox.ScreenToOutputPixel( rHEvt.GetMousePosPixel() ) );\n\n sal_uInt16 nTop = rListBox.GetTopEntry();\n sal_uInt16 nBottom = nTop + rListBox.GetDisplayLineCount();\n\n sal_uInt16 nPos;\n for( nPos = nTop; nPos < nBottom; ++nPos )\n {\n Rectangle aItemRect( rListBox.GetBoundingRectangle( nPos ) );\n if( (aItemRect.Top() <= aMousePos.Y()) && (aMousePos.Y() <= aItemRect.Bottom()) )\n break;\n }\n\n \/\/ show text content of the entry, if it does not fit\n if( nPos < nBottom )\n {\n String aHelpText( rListBox.GetEntry( nPos ) );\n if( rListBox.GetTextWidth( aHelpText ) > rListBox.GetOutputSizePixel().Width() )\n {\n Point aLBoxPos( rListBox.OutputToScreenPixel( Point( 0, 0 ) ) );\n Size aLBoxSize( rListBox.GetSizePixel() );\n Rectangle aLBoxRect( aLBoxPos, aLBoxSize );\n\n if( rHEvt.GetMode() == HELPMODE_BALLOON )\n Help::ShowBalloon( &rListBox, aLBoxRect.Center(), aLBoxRect, aHelpText );\n else\n Help::ShowQuickHelp( &rListBox, aLBoxRect, aHelpText );\n }\n }\n}\n\n\/\/ ----------------------------------------------------------------------------\n\nToolTipListBox::ToolTipListBox( Window* pParent, WinBits nStyle ) :\n ListBox( pParent, nStyle )\n{\n}\n\nToolTipListBox::ToolTipListBox( Window* pParent, const ResId& rResId ) :\n ListBox( pParent, rResId )\n{\n}\n\nvoid ToolTipListBox::RequestHelp( const HelpEvent& rHEvt )\n{\n lcl_ToolTipLBox_ShowToolTip( *this, rHEvt );\n}\n\n\/\/ ----------------------------------------------------------------------------\n\nToolTipMultiListBox::ToolTipMultiListBox( Window* pParent, WinBits nStyle ) :\n MultiListBox( pParent, nStyle )\n{\n}\n\nToolTipMultiListBox::ToolTipMultiListBox( Window* pParent, const ResId& rResId ) :\n MultiListBox( pParent, rResId )\n{\n}\n\nvoid ToolTipMultiListBox::RequestHelp( const HelpEvent& rHEvt )\n{\n lcl_ToolTipLBox_ShowToolTip( *this, rHEvt );\n}\n\n\/\/ ----------------------------------------------------------------------------\n\n} \/\/ namespace svtools\n\n\/\/ ============================================================================\n\n<commit_msg>INTEGRATION: CWS changefileheader (1.4.450); FILE MERGED 2008\/04\/01 15:44:55 thb 1.4.450.3: #i85898# Stripping all external header guards 2008\/04\/01 12:43:27 thb 1.4.450.2: #i85898# Stripping all external header guards 2008\/03\/31 13:01:35 rt 1.4.450.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: tooltiplbox.cxx,v $\n * $Revision: 1.5 $\n *\n * This file is part of OpenOffice.org.\n *\n * OpenOffice.org is free software: you can redistribute it and\/or modify\n * it under the terms of the GNU Lesser General Public License version 3\n * only, as published by the Free Software Foundation.\n *\n * OpenOffice.org is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the\n * GNU Lesser General Public License version 3 for more details\n * (a copy is included in the LICENSE file that accompanied this code).\n *\n * You should have received a copy of the GNU Lesser General Public License\n * version 3 along with OpenOffice.org. If not, see\n * <http:\/\/www.openoffice.org\/license.html>\n * for a copy of the LGPLv3 License.\n *\n ************************************************************************\/\n\n\/\/ MARKER(update_precomp.py): autogen include statement, do not remove\n#include \"precompiled_svtools.hxx\"\n#include \"tooltiplbox.hxx\"\n#include <vcl\/help.hxx>\n\n\/\/ ============================================================================\n\nnamespace svtools {\n\n\/\/ ----------------------------------------------------------------------------\n\nvoid lcl_ToolTipLBox_ShowToolTip( ListBox& rListBox, const HelpEvent& rHEvt )\n{\n \/\/ only show tooltip if helpmode is BALLOON or QUICK\n if ( !( rHEvt.GetMode() & HELPMODE_BALLOON ) && !( rHEvt.GetMode() & HELPMODE_QUICK ) )\n {\n \/\/ else call base class method\n rListBox.ListBox::RequestHelp( rHEvt );\n return ;\n }\n\n \/\/ find the list box entry the mouse points to\n Point aMousePos( rListBox.ScreenToOutputPixel( rHEvt.GetMousePosPixel() ) );\n\n sal_uInt16 nTop = rListBox.GetTopEntry();\n sal_uInt16 nBottom = nTop + rListBox.GetDisplayLineCount();\n\n sal_uInt16 nPos;\n for( nPos = nTop; nPos < nBottom; ++nPos )\n {\n Rectangle aItemRect( rListBox.GetBoundingRectangle( nPos ) );\n if( (aItemRect.Top() <= aMousePos.Y()) && (aMousePos.Y() <= aItemRect.Bottom()) )\n break;\n }\n\n \/\/ show text content of the entry, if it does not fit\n if( nPos < nBottom )\n {\n String aHelpText( rListBox.GetEntry( nPos ) );\n if( rListBox.GetTextWidth( aHelpText ) > rListBox.GetOutputSizePixel().Width() )\n {\n Point aLBoxPos( rListBox.OutputToScreenPixel( Point( 0, 0 ) ) );\n Size aLBoxSize( rListBox.GetSizePixel() );\n Rectangle aLBoxRect( aLBoxPos, aLBoxSize );\n\n if( rHEvt.GetMode() == HELPMODE_BALLOON )\n Help::ShowBalloon( &rListBox, aLBoxRect.Center(), aLBoxRect, aHelpText );\n else\n Help::ShowQuickHelp( &rListBox, aLBoxRect, aHelpText );\n }\n }\n}\n\n\/\/ ----------------------------------------------------------------------------\n\nToolTipListBox::ToolTipListBox( Window* pParent, WinBits nStyle ) :\n ListBox( pParent, nStyle )\n{\n}\n\nToolTipListBox::ToolTipListBox( Window* pParent, const ResId& rResId ) :\n ListBox( pParent, rResId )\n{\n}\n\nvoid ToolTipListBox::RequestHelp( const HelpEvent& rHEvt )\n{\n lcl_ToolTipLBox_ShowToolTip( *this, rHEvt );\n}\n\n\/\/ ----------------------------------------------------------------------------\n\nToolTipMultiListBox::ToolTipMultiListBox( Window* pParent, WinBits nStyle ) :\n MultiListBox( pParent, nStyle )\n{\n}\n\nToolTipMultiListBox::ToolTipMultiListBox( Window* pParent, const ResId& rResId ) :\n MultiListBox( pParent, rResId )\n{\n}\n\nvoid ToolTipMultiListBox::RequestHelp( const HelpEvent& rHEvt )\n{\n lcl_ToolTipLBox_ShowToolTip( *this, rHEvt );\n}\n\n\/\/ ----------------------------------------------------------------------------\n\n} \/\/ namespace svtools\n\n\/\/ ============================================================================\n\n<|endoftext|>"} {"text":"<commit_before>\/*************************************************************************\n *\n * OpenOffice.org - a multi-platform office productivity suite\n *\n * $RCSfile: databaselocationinput.hxx,v $\n *\n * $Revision: 1.2 $\n *\n * last change: $Author: kz $ $Date: 2008-03-06 17:11: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 SVX_DATABASELOCATIONINPUT_HXX\n#define SVX_DATABASELOCATIONINPUT_HXX\n\n#include \"svx\/svxdllapi.h\"\n\n\/** === begin UNO includes === **\/\n\/** === end UNO includes === **\/\n\nclass PushButton;\nclass String;\nnamespace svt { class OFileURLControl; }\nnamespace comphelper { class ComponentContext; }\n\n#include <memory>\n\n\/\/........................................................................\nnamespace svx\n{\n\/\/........................................................................\n\n \/\/====================================================================\n \/\/= DatabaseLocationInputController\n \/\/====================================================================\n class DatabaseLocationInputController_Impl;\n \/** helper class to control controls needed to input a database location\n\n If you allow, in your dialog, to save a database document, then you usually\n have a OFileURLControl for inputting the actual location, and a push button\n to browse for a location.\n\n This helper class controls such two UI elements.\n *\/\n class SVX_DLLPUBLIC DatabaseLocationInputController\n {\n public:\n DatabaseLocationInputController(\n const ::comphelper::ComponentContext& _rContext,\n ::svt::OFileURLControl& _rLocationInput,\n PushButton& _rBrowseButton\n );\n ~DatabaseLocationInputController();\n\n \/** sets the given URL at the input control, after translating it into a system path\n *\/\n void setURL( const String& _rURL );\n\n \/** returns the current database location, in form of an URL (not a system path)\n *\/\n String getURL() const;\n\n \/** prepares committing the database location entered in the input field\n\n Effectively, this method checks whether the file in the location already\n exists, and if so, it asks the user whether to overwrite it.\n\n If the method is called multiple times, this check only happens when the location\n changed since the last call.\n *\/\n bool prepareCommit();\n\n private:\n ::std::auto_ptr< DatabaseLocationInputController_Impl >\n m_pImpl;\n };\n\n\/\/........................................................................\n} \/\/ namespace svx\n\/\/........................................................................\n\n#endif \/\/ SVX_DATABASELOCATIONINPUT_HXX\n<commit_msg>INTEGRATION: CWS changefileheader (1.2.50); FILE MERGED 2008\/03\/31 14:18:10 rt 1.2.50.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: databaselocationinput.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 SVX_DATABASELOCATIONINPUT_HXX\n#define SVX_DATABASELOCATIONINPUT_HXX\n\n#include \"svx\/svxdllapi.h\"\n\n\/** === begin UNO includes === **\/\n\/** === end UNO includes === **\/\n\nclass PushButton;\nclass String;\nnamespace svt { class OFileURLControl; }\nnamespace comphelper { class ComponentContext; }\n\n#include <memory>\n\n\/\/........................................................................\nnamespace svx\n{\n\/\/........................................................................\n\n \/\/====================================================================\n \/\/= DatabaseLocationInputController\n \/\/====================================================================\n class DatabaseLocationInputController_Impl;\n \/** helper class to control controls needed to input a database location\n\n If you allow, in your dialog, to save a database document, then you usually\n have a OFileURLControl for inputting the actual location, and a push button\n to browse for a location.\n\n This helper class controls such two UI elements.\n *\/\n class SVX_DLLPUBLIC DatabaseLocationInputController\n {\n public:\n DatabaseLocationInputController(\n const ::comphelper::ComponentContext& _rContext,\n ::svt::OFileURLControl& _rLocationInput,\n PushButton& _rBrowseButton\n );\n ~DatabaseLocationInputController();\n\n \/** sets the given URL at the input control, after translating it into a system path\n *\/\n void setURL( const String& _rURL );\n\n \/** returns the current database location, in form of an URL (not a system path)\n *\/\n String getURL() const;\n\n \/** prepares committing the database location entered in the input field\n\n Effectively, this method checks whether the file in the location already\n exists, and if so, it asks the user whether to overwrite it.\n\n If the method is called multiple times, this check only happens when the location\n changed since the last call.\n *\/\n bool prepareCommit();\n\n private:\n ::std::auto_ptr< DatabaseLocationInputController_Impl >\n m_pImpl;\n };\n\n\/\/........................................................................\n} \/\/ namespace svx\n\/\/........................................................................\n\n#endif \/\/ SVX_DATABASELOCATIONINPUT_HXX\n<|endoftext|>"} {"text":"<commit_before>#include \"taichi\/analysis\/mesh_bls_analyzer.h\"\n\n#include \"taichi\/system\/profiler.h\"\n#include \"taichi\/ir\/analysis.h\"\n\nnamespace taichi {\nnamespace lang {\n\nMeshBLSAnalyzer::MeshBLSAnalyzer(OffloadedStmt *for_stmt,\n MeshBLSCaches *caches,\n bool auto_mesh_local,\n const CompileConfig &config)\n : for_stmt_(for_stmt),\n caches_(caches),\n auto_mesh_local_(auto_mesh_local),\n config_(config) {\n TI_AUTO_PROF;\n allow_undefined_visitor = true;\n invoke_default_visitor = false;\n}\n\nvoid MeshBLSAnalyzer::record_access(Stmt *stmt, AccessFlag flag) {\n if (!analysis_ok_) {\n return;\n }\n if (!stmt->is<GlobalPtrStmt>())\n return; \/\/ local alloca\n auto ptr = stmt->as<GlobalPtrStmt>();\n if (ptr->indices.size() != std::size_t(1) ||\n !ptr->indices[0]->is<MeshIndexConversionStmt>())\n return;\n auto conv = ptr->indices[0]->as<MeshIndexConversionStmt>();\n auto element_type = conv->idx_type;\n auto conv_type = conv->conv_type;\n auto idx = conv->idx;\n if (conv_type == mesh::ConvType::g2r)\n return;\n for (int l = 0; l < stmt->width(); l++) {\n auto snode = ptr->snodes[l];\n if (!caches_->has(snode)) {\n if (auto_mesh_local_ &&\n (flag == AccessFlag::accumulate ||\n (flag == AccessFlag::read && config_.arch == Arch::cuda)) &&\n (!idx->is<LoopIndexStmt>() ||\n !idx->as<LoopIndexStmt>()->is_mesh_index())) {\n caches_->insert(snode);\n } else {\n continue;\n }\n }\n\n if (!caches_->access(snode, element_type, conv_type, flag,\n idx->as<MeshRelationAccessStmt>()->neighbor_idx)) {\n analysis_ok_ = false;\n break;\n }\n }\n}\n\nvoid MeshBLSAnalyzer::visit(GlobalLoadStmt *stmt) {\n TI_ASSERT(stmt->width() == 1); \/\/ TODO: support vectorization\n record_access(stmt->src, AccessFlag::read);\n}\n\nvoid MeshBLSAnalyzer::visit(GlobalStoreStmt *stmt) {\n TI_ASSERT(stmt->width() == 1); \/\/ TODO: support vectorization\n record_access(stmt->dest, AccessFlag::write);\n}\n\nvoid MeshBLSAnalyzer::visit(AtomicOpStmt *stmt) {\n if (stmt->op_type == AtomicOpType::add) {\n record_access(stmt->dest, AccessFlag::accumulate);\n }\n}\n\nvoid MeshBLSAnalyzer::visit(Stmt *stmt) {\n TI_ASSERT(!stmt->is_container_statement());\n}\n\nbool MeshBLSAnalyzer::run() {\n const auto &block = for_stmt_->body;\n\n for (int i = 0; i < (int)block->statements.size(); i++) {\n block->statements[i]->accept(this);\n }\n\n return analysis_ok_;\n}\n\nnamespace irpass {\nnamespace analysis {\n\nstd::unique_ptr<MeshBLSCaches> initialize_mesh_local_attribute(\n OffloadedStmt *offload,\n bool auto_mesh_local,\n const CompileConfig &config) {\n TI_AUTO_PROF\n TI_ASSERT(offload->task_type == OffloadedTaskType::mesh_for);\n std::unique_ptr<MeshBLSCaches> caches;\n caches = std::make_unique<MeshBLSCaches>();\n for (auto snode : offload->mem_access_opt.get_snodes_with_flag(\n SNodeAccessFlag::mesh_local)) {\n caches->insert(snode);\n }\n\n MeshBLSAnalyzer bls_analyzer(offload, caches.get(), auto_mesh_local, config);\n bool analysis_ok = bls_analyzer.run();\n if (!analysis_ok) {\n TI_ERROR(\"Mesh BLS analysis failed !\");\n }\n return caches;\n}\n\n} \/\/ namespace analysis\n} \/\/ namespace irpass\n\n} \/\/ namespace lang\n} \/\/ namespace taichi\n<commit_msg>[lang] Quick fix for mesh_local analyzer (#4529)<commit_after>#include \"taichi\/analysis\/mesh_bls_analyzer.h\"\n\n#include \"taichi\/system\/profiler.h\"\n#include \"taichi\/ir\/analysis.h\"\n\nnamespace taichi {\nnamespace lang {\n\nMeshBLSAnalyzer::MeshBLSAnalyzer(OffloadedStmt *for_stmt,\n MeshBLSCaches *caches,\n bool auto_mesh_local,\n const CompileConfig &config)\n : for_stmt_(for_stmt),\n caches_(caches),\n auto_mesh_local_(auto_mesh_local),\n config_(config) {\n TI_AUTO_PROF;\n allow_undefined_visitor = true;\n invoke_default_visitor = false;\n}\n\nvoid MeshBLSAnalyzer::record_access(Stmt *stmt, AccessFlag flag) {\n if (!analysis_ok_) {\n return;\n }\n if (!stmt->is<GlobalPtrStmt>())\n return; \/\/ local alloca\n auto ptr = stmt->as<GlobalPtrStmt>();\n if (ptr->indices.size() != std::size_t(1) ||\n !ptr->indices[0]->is<MeshIndexConversionStmt>())\n return;\n auto conv = ptr->indices[0]->as<MeshIndexConversionStmt>();\n auto element_type = conv->idx_type;\n auto conv_type = conv->conv_type;\n auto idx = conv->idx;\n if (conv_type == mesh::ConvType::g2r)\n return;\n for (int l = 0; l < stmt->width(); l++) {\n auto snode = ptr->snodes[l];\n if (!caches_->has(snode)) {\n if (auto_mesh_local_ &&\n (flag == AccessFlag::accumulate ||\n (flag == AccessFlag::read && config_.arch == Arch::cuda)) &&\n (!idx->is<LoopIndexStmt>() ||\n !idx->as<LoopIndexStmt>()->is_mesh_index())) {\n caches_->insert(snode);\n } else {\n continue;\n }\n }\n if (idx->is<MeshRelationAccessStmt>()) {\n if (!caches_->access(snode, element_type, conv_type, flag,\n idx->as<MeshRelationAccessStmt>()->neighbor_idx)) {\n analysis_ok_ = false;\n break;\n }\n } else {\n \/\/ No optimization for front-end attribute access\n }\n }\n}\n\nvoid MeshBLSAnalyzer::visit(GlobalLoadStmt *stmt) {\n TI_ASSERT(stmt->width() == 1); \/\/ TODO: support vectorization\n record_access(stmt->src, AccessFlag::read);\n}\n\nvoid MeshBLSAnalyzer::visit(GlobalStoreStmt *stmt) {\n TI_ASSERT(stmt->width() == 1); \/\/ TODO: support vectorization\n record_access(stmt->dest, AccessFlag::write);\n}\n\nvoid MeshBLSAnalyzer::visit(AtomicOpStmt *stmt) {\n if (stmt->op_type == AtomicOpType::add) {\n record_access(stmt->dest, AccessFlag::accumulate);\n }\n}\n\nvoid MeshBLSAnalyzer::visit(Stmt *stmt) {\n TI_ASSERT(!stmt->is_container_statement());\n}\n\nbool MeshBLSAnalyzer::run() {\n const auto &block = for_stmt_->body;\n\n for (int i = 0; i < (int)block->statements.size(); i++) {\n block->statements[i]->accept(this);\n }\n\n return analysis_ok_;\n}\n\nnamespace irpass {\nnamespace analysis {\n\nstd::unique_ptr<MeshBLSCaches> initialize_mesh_local_attribute(\n OffloadedStmt *offload,\n bool auto_mesh_local,\n const CompileConfig &config) {\n TI_AUTO_PROF\n TI_ASSERT(offload->task_type == OffloadedTaskType::mesh_for);\n std::unique_ptr<MeshBLSCaches> caches;\n caches = std::make_unique<MeshBLSCaches>();\n for (auto snode : offload->mem_access_opt.get_snodes_with_flag(\n SNodeAccessFlag::mesh_local)) {\n caches->insert(snode);\n }\n\n MeshBLSAnalyzer bls_analyzer(offload, caches.get(), auto_mesh_local, config);\n bool analysis_ok = bls_analyzer.run();\n if (!analysis_ok) {\n TI_ERROR(\"Mesh BLS analysis failed !\");\n }\n return caches;\n}\n\n} \/\/ namespace analysis\n} \/\/ namespace irpass\n\n} \/\/ namespace lang\n} \/\/ namespace taichi\n<|endoftext|>"} {"text":"<commit_before>#include <vector>\n#include <thread>\n#include <atomic>\n#include \"scene.h\"\n#include \"samplers\/sampler.h\"\n#include \"render\/render_target.h\"\n#include \"render\/camera.h\"\n#include \"geometry\/geometry.h\"\n#include \"linalg\/ray.h\"\n#include \"linalg\/transform.h\"\n#include \"driver.h\"\n\nWorker::Worker(Scene &scene, BlockQueue &queue)\n\t: scene(scene), queue(queue), status(STATUS::NOT_STARTED)\n{}\nWorker::Worker(Worker &&w) : scene(w.scene), queue(w.queue),\n\tthread(std::move(w.thread)), status(w.status.load(std::memory_order_acquire))\n{}\nvoid Worker::render(){\n\tstatus.store(STATUS::WORKING, std::memory_order_release);\n\tNode &root = scene.get_root();\n\tRenderTarget &target = scene.get_render_target();\n\tCamera &camera = scene.get_camera();\n\t\/\/Counter so we can check if we've been canceled, check after 32 pixels\n\tint check_cancel = 0;\n\twhile (true){\n\t\tSampler sampler = queue.get_block();\n\t\tif (!sampler.has_samples()){\n\t\t\tbreak;\n\t\t}\n\t\twhile (sampler.has_samples()){\n\t\t\tstd::array<float, 2> s = sampler.get_sample();\n\t\t\tRay ray = camera.generate_ray(s[0], s[1]);\n\t\t\tHitInfo hitinfo;\n\t\t\tif (intersect_nodes(root, ray, hitinfo)){\n\t\t\t\tColorf color;\n\t\t\t\tconst Material *mat = hitinfo.node->get_material();\n\t\t\t\tif (mat){\n\t\t\t\t\tcolor = mat->shade(ray, hitinfo, scene.get_light_cache());\n\t\t\t\t}\n\t\t\t\telse {\n\t\t\t\t\tcolor = Colorf{0.4, 0.4, 0.4};\n\t\t\t\t}\n\t\t\t\tcolor.normalize();\n\t\t\t\ttarget.write_pixel(s[0], s[1], color);\n\t\t\t\ttarget.write_depth(s[0], s[1], ray.max_t);\n\t\t\t}\n\t\t\t++check_cancel;\n\t\t\tif (check_cancel >= 32){\n\t\t\t\tcheck_cancel = 0;\n\t\t\t\tint canceled = STATUS::CANCELED;\n\t\t\t\tif (status.compare_exchange_strong(canceled, STATUS::DONE, std::memory_order_acq_rel)){\n\t\t\t\t\treturn;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\tstatus.store(STATUS::DONE, std::memory_order_release);\n}\nbool Worker::intersect_nodes(Node &node, Ray &ray, HitInfo &hitinfo){\n\tbool hit = false;\n\t\/\/Transform the ray into this nodes space\n\tRay node_space = ray;\n\tauto &inv_transform = node.get_inv_transform();\n\tinv_transform(ray, node_space);\n\t\/\/Test this node then its children\n\tif (node.get_geometry()){\n\t\thit = node.get_geometry()->intersect(node_space, hitinfo);\n\t\tif (hit){\n\t\t\thitinfo.node = &node;\n\t\t}\n\t}\n\tfor (auto &c : node.get_children()){\n\t\thit = intersect_nodes(*c, node_space, hitinfo) || hit;\n\t}\n\tif (hit){\n\t\tauto &transform = node.get_transform();\n\t\ttransform(hitinfo.point, hitinfo.point);\n\t\ttransform(hitinfo.normal, hitinfo.normal);\n\t\tray.max_t = node_space.max_t;\n\t}\n\treturn hit;\n}\nDriver::Driver(Scene &scene, int nworkers, int blocks) : scene(scene),\n\tqueue(Sampler{0, scene.get_render_target().get_width(),\n\t\t0, scene.get_render_target().get_height()}, blocks)\n{\n\tfor (int i = 0; i < nworkers; ++i){\n\t\tworkers.emplace_back(Worker{scene, queue});\n\t}\n}\nDriver::~Driver(){\n\t\/\/Tell all the threads to cancel\n\tcancel();\n}\nvoid Driver::render(){\n\t\/\/Run through and launch each thread\n\tfor (auto &w : workers){\n\t\tw.thread = std::thread(&Worker::render, std::ref(w));\n\t}\n}\nbool Driver::done(){\n\t\/\/Check which workers have finished and join them, if all are done\n\t\/\/report that we're done\n\tbool all_done = true;\n\tfor (auto &w : workers){\n\t\tint status = w.status.load(std::memory_order_acquire);\n\t\tif (status == STATUS::DONE){\n\t\t\tw.thread.join();\n\t\t\tw.status.store(STATUS::JOINED, std::memory_order_release);\n\t\t}\n\t\telse if (status != STATUS::JOINED){\n\t\t\tall_done = false;\n\t\t}\n\t}\n\treturn all_done;\n}\nvoid Driver::cancel(){\n\t\/\/Inform all the threads they should quit\n\tfor (auto &w : workers){\n\t\tint status = STATUS::WORKING;\n\t\tif (w.status.compare_exchange_strong(status, STATUS::CANCELED, std::memory_order_acq_rel)){\n\t\t\tw.thread.join();\n\t\t\tw.status.store(STATUS::JOINED, std::memory_order_release);\n\t\t}\n\t\telse if (status == STATUS::DONE){\n\t\t\tw.thread.join();\n\t\t\tw.status.store(STATUS::JOINED, std::memory_order_release);\n\t\t}\n\t}\n}\nconst Scene& Driver::get_scene() const {\n\treturn scene;\n}\n\n\n<commit_msg>Comment clarification<commit_after>#include <vector>\n#include <thread>\n#include <atomic>\n#include \"scene.h\"\n#include \"samplers\/sampler.h\"\n#include \"render\/render_target.h\"\n#include \"render\/camera.h\"\n#include \"geometry\/geometry.h\"\n#include \"linalg\/ray.h\"\n#include \"linalg\/transform.h\"\n#include \"driver.h\"\n\nWorker::Worker(Scene &scene, BlockQueue &queue)\n\t: scene(scene), queue(queue), status(STATUS::NOT_STARTED)\n{}\nWorker::Worker(Worker &&w) : scene(w.scene), queue(w.queue),\n\tthread(std::move(w.thread)), status(w.status.load(std::memory_order_acquire))\n{}\nvoid Worker::render(){\n\tstatus.store(STATUS::WORKING, std::memory_order_release);\n\tNode &root = scene.get_root();\n\tRenderTarget &target = scene.get_render_target();\n\tCamera &camera = scene.get_camera();\n\t\/\/Counter so we can check if we've been canceled, check after every 32 pixels rendered\n\tint check_cancel = 0;\n\twhile (true){\n\t\tSampler sampler = queue.get_block();\n\t\tif (!sampler.has_samples()){\n\t\t\tbreak;\n\t\t}\n\t\twhile (sampler.has_samples()){\n\t\t\tstd::array<float, 2> s = sampler.get_sample();\n\t\t\tRay ray = camera.generate_ray(s[0], s[1]);\n\t\t\tHitInfo hitinfo;\n\t\t\tif (intersect_nodes(root, ray, hitinfo)){\n\t\t\t\tColorf color;\n\t\t\t\tconst Material *mat = hitinfo.node->get_material();\n\t\t\t\tif (mat){\n\t\t\t\t\tcolor = mat->shade(ray, hitinfo, scene.get_light_cache());\n\t\t\t\t}\n\t\t\t\telse {\n\t\t\t\t\tcolor = Colorf{0.4, 0.4, 0.4};\n\t\t\t\t}\n\t\t\t\tcolor.normalize();\n\t\t\t\ttarget.write_pixel(s[0], s[1], color);\n\t\t\t\ttarget.write_depth(s[0], s[1], ray.max_t);\n\t\t\t}\n\t\t\t++check_cancel;\n\t\t\tif (check_cancel >= 32){\n\t\t\t\tcheck_cancel = 0;\n\t\t\t\tint canceled = STATUS::CANCELED;\n\t\t\t\tif (status.compare_exchange_strong(canceled, STATUS::DONE, std::memory_order_acq_rel)){\n\t\t\t\t\treturn;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\tstatus.store(STATUS::DONE, std::memory_order_release);\n}\nbool Worker::intersect_nodes(Node &node, Ray &ray, HitInfo &hitinfo){\n\tbool hit = false;\n\t\/\/Transform the ray into this nodes space\n\tRay node_space = ray;\n\tauto &inv_transform = node.get_inv_transform();\n\tinv_transform(ray, node_space);\n\t\/\/Test this node then its children\n\tif (node.get_geometry()){\n\t\thit = node.get_geometry()->intersect(node_space, hitinfo);\n\t\tif (hit){\n\t\t\thitinfo.node = &node;\n\t\t}\n\t}\n\tfor (auto &c : node.get_children()){\n\t\thit = intersect_nodes(*c, node_space, hitinfo) || hit;\n\t}\n\tif (hit){\n\t\tauto &transform = node.get_transform();\n\t\ttransform(hitinfo.point, hitinfo.point);\n\t\ttransform(hitinfo.normal, hitinfo.normal);\n\t\tray.max_t = node_space.max_t;\n\t}\n\treturn hit;\n}\nDriver::Driver(Scene &scene, int nworkers, int blocks) : scene(scene),\n\tqueue(Sampler{0, scene.get_render_target().get_width(),\n\t\t0, scene.get_render_target().get_height()}, blocks)\n{\n\tfor (int i = 0; i < nworkers; ++i){\n\t\tworkers.emplace_back(Worker{scene, queue});\n\t}\n}\nDriver::~Driver(){\n\t\/\/Tell all the threads to cancel\n\tcancel();\n}\nvoid Driver::render(){\n\t\/\/Run through and launch each thread\n\tfor (auto &w : workers){\n\t\tw.thread = std::thread(&Worker::render, std::ref(w));\n\t}\n}\nbool Driver::done(){\n\t\/\/Check which workers have finished and join them, if all are done\n\t\/\/report that we're done\n\tbool all_done = true;\n\tfor (auto &w : workers){\n\t\tint status = w.status.load(std::memory_order_acquire);\n\t\tif (status == STATUS::DONE){\n\t\t\tw.thread.join();\n\t\t\tw.status.store(STATUS::JOINED, std::memory_order_release);\n\t\t}\n\t\telse if (status != STATUS::JOINED){\n\t\t\tall_done = false;\n\t\t}\n\t}\n\treturn all_done;\n}\nvoid Driver::cancel(){\n\t\/\/Inform all the threads they should quit\n\tfor (auto &w : workers){\n\t\tint status = STATUS::WORKING;\n\t\tif (w.status.compare_exchange_strong(status, STATUS::CANCELED, std::memory_order_acq_rel)){\n\t\t\tw.thread.join();\n\t\t\tw.status.store(STATUS::JOINED, std::memory_order_release);\n\t\t}\n\t\telse if (status == STATUS::DONE){\n\t\t\tw.thread.join();\n\t\t\tw.status.store(STATUS::JOINED, std::memory_order_release);\n\t\t}\n\t}\n}\nconst Scene& Driver::get_scene() const {\n\treturn scene;\n}\n\n\n<|endoftext|>"} {"text":"<commit_before>#include <v8.h>\n#include <node.h>\n#include <cstring>\n#include <stdlib.h>\n#include <dbus\/dbus.h>\n\n#include \"encoder.h\"\n\nnamespace Encoder {\n\n\tusing namespace node;\n\tusing namespace v8;\n\tusing namespace std;\n\n\tconst char *GetSignatureFromV8Type(Handle<Value>& value)\n\t{\n\t\tif (value->IsTrue() || value->IsFalse() || value->IsBoolean() ) {\n\t\t\treturn const_cast<char*>(DBUS_TYPE_BOOLEAN_AS_STRING);\n\t\t} else if (value->IsInt32()) {\n\t\t\treturn const_cast<char*>(DBUS_TYPE_INT32_AS_STRING);\n\t\t} else if (value->IsUint32()) {\n\t\t\treturn const_cast<char*>(DBUS_TYPE_UINT32_AS_STRING);\n\t\t} else if (value->IsNumber()) {\n\t\t\treturn const_cast<char*>(DBUS_TYPE_DOUBLE_AS_STRING);\n\t\t} else if (value->IsString()) {\n\t\t\treturn const_cast<char*>(DBUS_TYPE_STRING_AS_STRING);\n\t\t} else if (value->IsArray()) {\n\t\t\treturn const_cast<char*>(DBUS_TYPE_ARRAY_AS_STRING DBUS_TYPE_VARIANT_AS_STRING);\n\t\t} else if (value->IsObject()) {\n\t\t\treturn const_cast<char*>(DBUS_TYPE_ARRAY_AS_STRING\n\t\t\t\tDBUS_DICT_ENTRY_BEGIN_CHAR_AS_STRING\n\t\t\t\tDBUS_TYPE_STRING_AS_STRING DBUS_TYPE_VARIANT_AS_STRING\n\t\t\t\tDBUS_DICT_ENTRY_END_CHAR_AS_STRING);\n\t\t} else {\n\t\t\treturn NULL;\n\t\t}\n\t}\n\n\tbool EncodeObject(Handle<Value> value, DBusMessageIter *iter, const char *signature)\n\t{\n\t\tHandleScope scope;\n\t\tDBusSignatureIter siter;\n\t\tint type;\n\n\t\t\/\/ Get type of current value\n\t\tdbus_signature_iter_init(&siter, signature);\n\t\ttype = dbus_signature_iter_get_current_type(&siter);\n\n\t\tswitch(type) {\n\t\tcase DBUS_TYPE_BOOLEAN:\n\t\t{\n\t\t\tdbus_bool_t data = value->BooleanValue();\n\n\t\t\tif (!dbus_message_iter_append_basic(iter, type, &data)) {\n\t\t\t\tprintf(\"Failed to encode boolean value\\n\");\n\t\t\t\treturn false;\n\t\t\t}\n\n\t\t\tbreak;\n\t\t}\n\n\t\tcase DBUS_TYPE_INT16:\n\t\tcase DBUS_TYPE_INT32:\n\t\tcase DBUS_TYPE_INT64:\n\t\tcase DBUS_TYPE_UINT16:\n\t\tcase DBUS_TYPE_UINT32:\n\t\tcase DBUS_TYPE_UINT64:\n\t\tcase DBUS_TYPE_BYTE:\n\t\t{\n\t\t\tdbus_uint64_t data = value->IntegerValue();\n\n\t\t\tif (!dbus_message_iter_append_basic(iter, type, &data)) {\n\t\t\t\tprintf(\"Failed to encode numeric value\\n\");\n\t\t\t\treturn false;\n\t\t\t}\n\n\t\t\tbreak;\n\t\t}\n\n\t\tcase DBUS_TYPE_STRING:\n\t\tcase DBUS_TYPE_OBJECT_PATH:\n\t\tcase DBUS_TYPE_SIGNATURE:\n\t\t{\n\t\t\tString::Utf8Value data_val(value->ToString());\n\t\t\tchar *data = strdup(*data_val);\n\n\t\t\tif (!dbus_message_iter_append_basic(iter, type, &data)) {\n\t\t\t\tdbus_free(data);\n\t\t\t\tprintf(\"Failed to encode string value\\n\");\n\t\t\t\treturn false;\n\t\t\t}\n\n\t\t\tdbus_free(data);\n\n\t\t\tbreak;\n\t\t}\n\n\t\tcase DBUS_TYPE_DOUBLE:\n\t\t{\n\t\t\tdouble data = value->NumberValue();\n\n\t\t\tif (!dbus_message_iter_append_basic(iter, type, &data)) {\n\t\t\t\tprintf(\"Failed to encode double value\\n\");\n\t\t\t\treturn false;\n\t\t\t}\n\n\t\t\tbreak;\n\t\t}\n\n\t\tcase DBUS_TYPE_ARRAY:\n\t\t{\n\t\t\tif (!value->IsObject()) {\n\t\t\t\tprintf(\"Failed to encode dictionary\\n\");\n\t\t\t\treturn false;\n\t\t\t}\n\n\t\t\tDBusMessageIter subIter;\n\t\t\tDBusSignatureIter arraySiter;\n\t\t\tchar *array_sig = NULL;\n\n\t\t\t\/\/ Getting signature of array object\n\t\t\tdbus_signature_iter_recurse(&siter, &arraySiter);\n\t\t\tarray_sig = dbus_signature_iter_get_signature(&arraySiter);\n\n\t\t\t\/\/ Open array container to process elements in there\n\t\t\tif (!dbus_message_iter_open_container(iter, DBUS_TYPE_ARRAY, array_sig, &subIter)) {\n\t\t\t\tdbus_free(array_sig);\n\t\t\t\tprintf(\"Can't open container for Array type\\n\");\n\t\t\t\treturn false; \n\t\t\t}\n\n\t\t\t\/\/ It's a dictionary\n\t\t\tif (dbus_signature_iter_get_element_type(&siter) == DBUS_TYPE_DICT_ENTRY) {\n\n\t\t\t\tdbus_free(array_sig);\n\n\t\t\t\tHandle<Object> value_object = value->ToObject();\n\t\t\t\tDBusSignatureIter dictSubSiter;\n\n\t\t\t\t\/\/ Getting sub-signature object\n\t\t\t\tdbus_signature_iter_recurse(&arraySiter, &dictSubSiter);\n\t\t\t\tdbus_signature_iter_next(&dictSubSiter);\n\t\t\t\tchar *sig = dbus_signature_iter_get_signature(&dictSubSiter);\n\n\t\t\t\t\/\/ process each elements\n\t\t\t\tHandle<Array> prop_names = value_object->GetPropertyNames();\n\t\t\t\tunsigned int len = prop_names->Length();\n\n\t\t\t\tbool failed = false;\n\t\t\t\tfor (unsigned int i = 0; i < len; ++i) {\n\t\t\t\t\tDBusMessageIter dict_iter;\n\n\t\t\t\t\t\/\/ Open dict entry container\n\t\t\t\t\tif (!dbus_message_iter_open_container(&subIter, DBUS_TYPE_DICT_ENTRY, NULL, &dict_iter)) {\n\t\t\t\t\t\tprintf(\"Can't open container for DICT-ENTRY\\n\");\n\t\t\t\t\t\tfailed = true;\n\t\t\t\t\t\tbreak;\n\t\t\t\t\t}\n\n\t\t\t\t\t\/\/ Getting the key and value\n\t\t\t\t\tHandle<Value> prop_key = prop_names->Get(i);\n\t\t\t\t\tHandle<Value> prop_value = value_object->Get(prop_key);\n\n\t\t\t\t\t\/\/ Append the key\n\t\t\t\t\tchar *prop_key_str = strdup(*String::Utf8Value(prop_key->ToString()));\n\t\t\t\t\tdbus_message_iter_append_basic(&dict_iter, DBUS_TYPE_STRING, &prop_key_str);\n\t\t\t\t\tdbus_free(prop_key_str);\n\n\t\t\t\t\t\/\/ Append the value\n\t\t\t\t\tif (!EncodeObject(prop_value, &dict_iter, sig)) {\n\t\t\t\t\t\tdbus_message_iter_close_container(&subIter, &dict_iter); \n\t\t\t\t\t\tprintf(\"Failed to encode element of dictionary\\n\");\n\t\t\t\t\t\tfailed = true;\n\t\t\t\t\t\tbreak;\n\t\t\t\t\t}\n\n\t\t\t\t\tdbus_message_iter_close_container(&subIter, &dict_iter); \n\t\t\t\t}\n\n\t\t\t\tdbus_free(sig);\n\t\t\t\tdbus_message_iter_close_container(iter, &subIter);\n\n\t\t\t\tif (failed) \n\t\t\t\t\treturn false;\n\n\t\t\t\tbreak;\n\t\t\t}\n\n\t\t\tif (!value->IsArray()) {\n\t\t\t\tprintf(\"Failed to encode array object\\n\");\n\t\t\t\treturn false;\n\t\t\t}\n\n\t\t\t\/\/ process each elements\n\t\t\tHandle<Array> arrayData = Handle<Array>::Cast(value);\n\t\t\tfor (unsigned int i = 0; i < arrayData->Length(); ++i) {\n\t\t\t\tLocal<Value> arrayItem = arrayData->Get(i);\n\t\t\t\tif (!EncodeObject(arrayItem, &subIter, array_sig))\n\t\t\t\t\tbreak;\n\t\t\t}\n\n\t\t\tdbus_message_iter_close_container(iter, &subIter);\n\t\t\tdbus_free(array_sig);\n\n\t\t\tbreak;\n\t\t}\n\n\t\tcase DBUS_TYPE_VARIANT:\n\t\t{\n\t\t\tDBusMessageIter subIter;\n\n\t\t\tconst char *var_sig = GetSignatureFromV8Type(value);\n\n\t\t\tif (!dbus_message_iter_open_container(iter, DBUS_TYPE_VARIANT, var_sig, &subIter)) {\n\t\t\t\tprintf(\"Can't open contianer for VARIANT type\\n\");\n\t\t\t\treturn false;\n\t\t\t}\n\n\t\t\tif (!EncodeObject(value, &subIter, var_sig)) { \n\t\t\t\tdbus_message_iter_close_container(iter, &subIter);\n\t\t\t\treturn false;\n\t\t\t}\n\n\t\t\tdbus_message_iter_close_container(iter, &subIter);\n\n\t\t\tbreak;\n\t\t}\n\t\tcase DBUS_TYPE_STRUCT:\n\t\t{\n\t\t\tDBusMessageIter subIter;\n\t\t\tDBusSignatureIter structSiter;\n\t\t\t\n\t\t\t\/\/ Open array container to process elements in there\n\t\t\tif (!dbus_message_iter_open_container(iter, DBUS_TYPE_STRUCT, NULL, &subIter)) {\n\t\t\t\tprintf(\"Can't open container for Struct type\\n\");\n\t\t\t\treturn false; \n\t\t\t}\n\n\t\t\tHandle<Object> value_object = value->ToObject();\n\n\t\t\t\/\/ Getting sub-signature object\n\t\t\tdbus_signature_iter_recurse(&siter, &structSiter);\n\n\t\t\t\/\/ process each elements\n\t\t\tHandle<Array> prop_names = value_object->GetPropertyNames();\n\t\t\tunsigned int len = prop_names->Length();\n\n\t\t\tfor (unsigned int i = 0; i < len; ++i) {\n\n\t\t\t\tchar *sig = dbus_signature_iter_get_signature(&structSiter);\n\n\t\t\t\tHandle<Value> prop_key = prop_names->Get(i);\n\n\t\t\t\tif (!EncodeObject(value_object->Get(prop_key), &subIter, sig)) {\n\t\t\t\t\tdbus_free(sig);\n\t\t\t\t\tprintf(\"Failed to encode element of dictionary\\n\");\n\t\t\t\t\treturn false;\n\t\t\t\t}\n\n\t\t\t\tdbus_free(sig);\n\n\t\t\t\tif (!dbus_signature_iter_next(&structSiter))\n\t\t\t\t\tbreak;\n\t\t\t}\n\n\t\t\tdbus_message_iter_close_container(iter, &subIter); \n\n\t\t\tbreak;\n\t\t}\n\n\t\t}\n\n\t\treturn true;\n\t}\n\n}\n\n<commit_msg>some fixes<commit_after>#include <v8.h>\n#include <node.h>\n#include <cstring>\n#include <stdlib.h>\n#include <dbus\/dbus.h>\n\n#include \"encoder.h\"\n\nnamespace Encoder {\n\n\tusing namespace node;\n\tusing namespace v8;\n\tusing namespace std;\n\n\tconst char *GetSignatureFromV8Type(Handle<Value>& value)\n\t{\n\t\tif (value->IsTrue() || value->IsFalse() || value->IsBoolean() ) {\n\t\t\treturn const_cast<char*>(DBUS_TYPE_BOOLEAN_AS_STRING);\n\t\t} else if (value->IsInt32()) {\n\t\t\treturn const_cast<char*>(DBUS_TYPE_INT32_AS_STRING);\n\t\t} else if (value->IsUint32()) {\n\t\t\treturn const_cast<char*>(DBUS_TYPE_UINT32_AS_STRING);\n\t\t} else if (value->IsNumber()) {\n\t\t\treturn const_cast<char*>(DBUS_TYPE_DOUBLE_AS_STRING);\n\t\t} else if (value->IsString()) {\n\t\t\treturn const_cast<char*>(DBUS_TYPE_STRING_AS_STRING);\n\t\t} else if (value->IsArray()) {\n\t\t\treturn const_cast<char*>(DBUS_TYPE_ARRAY_AS_STRING DBUS_TYPE_VARIANT_AS_STRING);\n\t\t} else if (value->IsObject()) {\n\t\t\treturn const_cast<char*>(DBUS_TYPE_ARRAY_AS_STRING\n\t\t\t\tDBUS_DICT_ENTRY_BEGIN_CHAR_AS_STRING\n\t\t\t\tDBUS_TYPE_STRING_AS_STRING DBUS_TYPE_VARIANT_AS_STRING\n\t\t\t\tDBUS_DICT_ENTRY_END_CHAR_AS_STRING);\n\t\t} else {\n\t\t\treturn NULL;\n\t\t}\n\t}\n\n\tbool EncodeObject(Handle<Value> value, DBusMessageIter *iter, const char *signature)\n\t{\n\t\tHandleScope scope;\n\t\tDBusSignatureIter siter;\n\t\tint type;\n\n\t\t\/\/ Get type of current value\n\t\tdbus_signature_iter_init(&siter, signature);\n\t\ttype = dbus_signature_iter_get_current_type(&siter);\n\n\t\tswitch(type) {\n\t\tcase DBUS_TYPE_BOOLEAN:\n\t\t{\n\t\t\tdbus_bool_t data = value->BooleanValue();\n\n\t\t\tif (!dbus_message_iter_append_basic(iter, type, &data)) {\n\t\t\t\tprintf(\"Failed to encode boolean value\\n\");\n\t\t\t\treturn false;\n\t\t\t}\n\n\t\t\tbreak;\n\t\t}\n\n\t\tcase DBUS_TYPE_INT16:\n\t\tcase DBUS_TYPE_INT32:\n\t\tcase DBUS_TYPE_INT64:\n\t\tcase DBUS_TYPE_UINT16:\n\t\tcase DBUS_TYPE_UINT32:\n\t\tcase DBUS_TYPE_UINT64:\n\t\tcase DBUS_TYPE_BYTE:\n\t\t{\n\t\t\tdbus_uint64_t data = value->IntegerValue();\n\n\t\t\tif (!dbus_message_iter_append_basic(iter, type, &data)) {\n\t\t\t\tprintf(\"Failed to encode numeric value\\n\");\n\t\t\t\treturn false;\n\t\t\t}\n\n\t\t\tbreak;\n\t\t}\n\n\t\tcase DBUS_TYPE_STRING:\n\t\tcase DBUS_TYPE_OBJECT_PATH:\n\t\tcase DBUS_TYPE_SIGNATURE:\n\t\t{\n\t\t\tchar *data = strdup(*String::Utf8Value(value->ToString()));\n\n\t\t\tif (!dbus_message_iter_append_basic(iter, type, &data)) {\n\t\t\t\tdbus_free(data);\n\t\t\t\tprintf(\"Failed to encode string value\\n\");\n\t\t\t\treturn false;\n\t\t\t}\n\n\t\t\tdbus_free(data);\n\n\t\t\tbreak;\n\t\t}\n\n\t\tcase DBUS_TYPE_DOUBLE:\n\t\t{\n\t\t\tdouble data = value->NumberValue();\n\n\t\t\tif (!dbus_message_iter_append_basic(iter, type, &data)) {\n\t\t\t\tprintf(\"Failed to encode double value\\n\");\n\t\t\t\treturn false;\n\t\t\t}\n\n\t\t\tbreak;\n\t\t}\n\n\t\tcase DBUS_TYPE_ARRAY:\n\t\t{\n\t\t\tif (!value->IsObject()) {\n\t\t\t\tprintf(\"Failed to encode dictionary\\n\");\n\t\t\t\treturn false;\n\t\t\t}\n\n\t\t\tDBusMessageIter subIter;\n\t\t\tDBusSignatureIter arraySiter;\n\t\t\tchar *array_sig = NULL;\n\n\t\t\t\/\/ Getting signature of array object\n\t\t\tdbus_signature_iter_recurse(&siter, &arraySiter);\n\t\t\tarray_sig = dbus_signature_iter_get_signature(&arraySiter);\n\n\t\t\t\/\/ Open array container to process elements in there\n\t\t\tif (!dbus_message_iter_open_container(iter, DBUS_TYPE_ARRAY, array_sig, &subIter)) {\n\t\t\t\tdbus_free(array_sig);\n\t\t\t\tprintf(\"Can't open container for Array type\\n\");\n\t\t\t\treturn false; \n\t\t\t}\n\n\t\t\t\/\/ It's a dictionary\n\t\t\tif (dbus_signature_iter_get_element_type(&siter) == DBUS_TYPE_DICT_ENTRY) {\n\n\t\t\t\tdbus_free(array_sig);\n\n\t\t\t\tHandle<Object> value_object = value->ToObject();\n\t\t\t\tDBusSignatureIter dictSubSiter;\n\n\t\t\t\t\/\/ Getting sub-signature object\n\t\t\t\tdbus_signature_iter_recurse(&arraySiter, &dictSubSiter);\n\t\t\t\tdbus_signature_iter_next(&dictSubSiter);\n\t\t\t\tchar *sig = dbus_signature_iter_get_signature(&dictSubSiter);\n\n\t\t\t\t\/\/ process each elements\n\t\t\t\tHandle<Array> prop_names = value_object->GetPropertyNames();\n\t\t\t\tunsigned int len = prop_names->Length();\n\n\t\t\t\tbool failed = false;\n\t\t\t\tfor (unsigned int i = 0; i < len; ++i) {\n\t\t\t\t\tDBusMessageIter dict_iter;\n\n\t\t\t\t\t\/\/ Open dict entry container\n\t\t\t\t\tif (!dbus_message_iter_open_container(&subIter, DBUS_TYPE_DICT_ENTRY, NULL, &dict_iter)) {\n\t\t\t\t\t\tprintf(\"Can't open container for DICT-ENTRY\\n\");\n\t\t\t\t\t\tfailed = true;\n\t\t\t\t\t\tbreak;\n\t\t\t\t\t}\n\n\t\t\t\t\t\/\/ Getting the key and value\n\t\t\t\t\tHandle<Value> prop_key = prop_names->Get(i);\n\t\t\t\t\tHandle<Value> prop_value = value_object->Get(prop_key);\n\n\t\t\t\t\t\/\/ Append the key\n\t\t\t\t\tchar *prop_key_str = strdup(*String::Utf8Value(prop_key->ToString()));\n\t\t\t\t\tdbus_message_iter_append_basic(&dict_iter, DBUS_TYPE_STRING, &prop_key_str);\n\t\t\t\t\tdbus_free(prop_key_str);\n\n\t\t\t\t\t\/\/ Append the value\n\t\t\t\t\tif (!EncodeObject(prop_value, &dict_iter, sig)) {\n\t\t\t\t\t\tdbus_message_iter_close_container(&subIter, &dict_iter); \n\t\t\t\t\t\tprintf(\"Failed to encode element of dictionary\\n\");\n\t\t\t\t\t\tfailed = true;\n\t\t\t\t\t\tbreak;\n\t\t\t\t\t}\n\n\t\t\t\t\tdbus_message_iter_close_container(&subIter, &dict_iter); \n\t\t\t\t}\n\n\t\t\t\tdbus_free(sig);\n\t\t\t\tdbus_message_iter_close_container(iter, &subIter);\n\n\t\t\t\tif (failed) \n\t\t\t\t\treturn false;\n\n\t\t\t\tbreak;\n\t\t\t}\n\n\t\t\tif (!value->IsArray()) {\n\t\t\t\tprintf(\"Failed to encode array object\\n\");\n\t\t\t\treturn false;\n\t\t\t}\n\n\t\t\t\/\/ process each elements\n\t\t\tHandle<Array> arrayData = Handle<Array>::Cast(value);\n\t\t\tfor (unsigned int i = 0; i < arrayData->Length(); ++i) {\n\t\t\t\tLocal<Value> arrayItem = arrayData->Get(i);\n\t\t\t\tif (!EncodeObject(arrayItem, &subIter, array_sig))\n\t\t\t\t\tbreak;\n\t\t\t}\n\n\t\t\tdbus_message_iter_close_container(iter, &subIter);\n\t\t\tdbus_free(array_sig);\n\n\t\t\tbreak;\n\t\t}\n\n\t\tcase DBUS_TYPE_VARIANT:\n\t\t{\n\t\t\tDBusMessageIter subIter;\n\n\t\t\tconst char *var_sig = GetSignatureFromV8Type(value);\n\n\t\t\tif (!dbus_message_iter_open_container(iter, DBUS_TYPE_VARIANT, var_sig, &subIter)) {\n\t\t\t\tprintf(\"Can't open contianer for VARIANT type\\n\");\n\t\t\t\treturn false;\n\t\t\t}\n\n\t\t\tif (!EncodeObject(value, &subIter, var_sig)) { \n\t\t\t\tdbus_message_iter_close_container(iter, &subIter);\n\t\t\t\treturn false;\n\t\t\t}\n\n\t\t\tdbus_message_iter_close_container(iter, &subIter);\n\n\t\t\tbreak;\n\t\t}\n\t\tcase DBUS_TYPE_STRUCT:\n\t\t{\n\t\t\tDBusMessageIter subIter;\n\t\t\tDBusSignatureIter structSiter;\n\t\t\t\n\t\t\t\/\/ Open array container to process elements in there\n\t\t\tif (!dbus_message_iter_open_container(iter, DBUS_TYPE_STRUCT, NULL, &subIter)) {\n\t\t\t\tprintf(\"Can't open container for Struct type\\n\");\n\t\t\t\treturn false; \n\t\t\t}\n\n\t\t\tHandle<Object> value_object = value->ToObject();\n\n\t\t\t\/\/ Getting sub-signature object\n\t\t\tdbus_signature_iter_recurse(&siter, &structSiter);\n\n\t\t\t\/\/ process each elements\n\t\t\tHandle<Array> prop_names = value_object->GetPropertyNames();\n\t\t\tunsigned int len = prop_names->Length();\n\n\t\t\tfor (unsigned int i = 0; i < len; ++i) {\n\n\t\t\t\tchar *sig = dbus_signature_iter_get_signature(&structSiter);\n\n\t\t\t\tHandle<Value> prop_key = prop_names->Get(i);\n\n\t\t\t\tif (!EncodeObject(value_object->Get(prop_key), &subIter, sig)) {\n\t\t\t\t\tdbus_free(sig);\n\t\t\t\t\tprintf(\"Failed to encode element of dictionary\\n\");\n\t\t\t\t\treturn false;\n\t\t\t\t}\n\n\t\t\t\tdbus_free(sig);\n\n\t\t\t\tif (!dbus_signature_iter_next(&structSiter))\n\t\t\t\t\tbreak;\n\t\t\t}\n\n\t\t\tdbus_message_iter_close_container(iter, &subIter); \n\n\t\t\tbreak;\n\t\t}\n\n\t\t}\n\n\t\treturn true;\n\t}\n\n}\n\n<|endoftext|>"} {"text":"<commit_before>#include \"engine.h\"\n\n#include <iostream>\n\nnamespace wake\n{\n static void error_callback(int err, const char* description)\n {\n std::cout << \"GLFW error: \" << description << std::endl;\n }\n\n Engine& Engine::get()\n {\n static Engine instance;\n return instance;\n }\n\n bool Engine::startup()\n {\n glfwSetErrorCallback(&error_callback);\n if (!glfwInit())\n {\n std::cout << \"Unable to initialize GLFW.\" << std::endl;\n return false;\n }\n\n glfwWindowHint(GLFW_CONTEXT_VERSION_MAJOR, 3);\n glfwWindowHint(GLFW_CONTEXT_VERSION_MINOR, 2);\n glfwWindowHint(GLFW_OPENGL_PROFILE, GLFW_OPENGL_CORE_PROFILE);\n glfwWindowHint(GLFW_OPENGL_FORWARD_COMPAT, GL_TRUE);\n\n glfwWindowHint(GLFW_RESIZABLE, GL_FALSE);\n\n window = glfwCreateWindow(800, 600, \"Wake\", nullptr, nullptr);\n if (window == nullptr)\n {\n std::cout << \"Unable to create window.\" << std::endl;\n glfwTerminate();\n\n return false;\n }\n\n glfwMakeContextCurrent(window);\n\t\tglfwSwapInterval(1);\n\n if (glewInit() != GLEW_OK)\n {\n std::cout << \"Unable to initialize GLEW.\" << std::endl;\n glfwTerminate();\n\n return false;\n }\n\n return true;\n }\n\n bool Engine::shutdown()\n {\n glfwTerminate();\n window = nullptr;\n\n return true;\n }\n\n\tbool Engine::run()\n\t{\n if (running)\n {\n std::cout << \"Cannot run() while already running!\" << std::endl;\n return false;\n }\n\n\t\tif (!window)\n\t\t{\n\t\t\tstd::cout << \"Cannot run engine with uninitialized window (did startup succeed?)\" << std::endl;\n\t\t\treturn false;\n\t\t}\n\n running = true;\n\n double lastTime = glfwGetTime();\n\n\t\twhile (running && !glfwWindowShouldClose(window))\n\t\t{\n double frameTime = glfwGetTime() - lastTime;\n lastTime = glfwGetTime();\n\n\t\t\tTickEvent.call(frameTime);\n\n\t\t\tglfwSwapBuffers(window);\n\t\t\tglfwPollEvents();\n\t\t}\n\n running = false;\n\n QuitEvent.call();\n\n\t\treturn true;\n\t}\n\n bool Engine::isRunning() const\n {\n return running;\n }\n\n void Engine::stop()\n {\n running = false;\n }\n\n double Engine::getTime() const\n {\n return glfwGetTime();\n }\n\n\tEngine::Engine()\n {\n\n }\n\n Engine::Engine(const Engine& other)\n {\n\n }\n\n Engine& Engine::operator=(const Engine& other)\n {\n return *this;\n }\n\n Engine::~Engine()\n {\n\n }\n}<commit_msg>use opengl 3.3 minimum<commit_after>#include \"engine.h\"\n\n#include <iostream>\n\nnamespace wake\n{\n static void error_callback(int err, const char* description)\n {\n std::cout << \"GLFW error: \" << description << std::endl;\n }\n\n Engine& Engine::get()\n {\n static Engine instance;\n return instance;\n }\n\n bool Engine::startup()\n {\n glfwSetErrorCallback(&error_callback);\n if (!glfwInit())\n {\n std::cout << \"Unable to initialize GLFW.\" << std::endl;\n return false;\n }\n\n glfwWindowHint(GLFW_CONTEXT_VERSION_MAJOR, 3);\n glfwWindowHint(GLFW_CONTEXT_VERSION_MINOR, 3);\n glfwWindowHint(GLFW_OPENGL_PROFILE, GLFW_OPENGL_CORE_PROFILE);\n glfwWindowHint(GLFW_OPENGL_FORWARD_COMPAT, GL_TRUE);\n\n glfwWindowHint(GLFW_RESIZABLE, GL_FALSE);\n\n window = glfwCreateWindow(800, 600, \"Wake\", nullptr, nullptr);\n if (window == nullptr)\n {\n std::cout << \"Unable to create window.\" << std::endl;\n glfwTerminate();\n\n return false;\n }\n\n glfwMakeContextCurrent(window);\n\t\tglfwSwapInterval(1);\n\n if (glewInit() != GLEW_OK)\n {\n std::cout << \"Unable to initialize GLEW.\" << std::endl;\n glfwTerminate();\n\n return false;\n }\n\n return true;\n }\n\n bool Engine::shutdown()\n {\n glfwTerminate();\n window = nullptr;\n\n return true;\n }\n\n\tbool Engine::run()\n\t{\n if (running)\n {\n std::cout << \"Cannot run() while already running!\" << std::endl;\n return false;\n }\n\n\t\tif (!window)\n\t\t{\n\t\t\tstd::cout << \"Cannot run engine with uninitialized window (did startup succeed?)\" << std::endl;\n\t\t\treturn false;\n\t\t}\n\n running = true;\n\n double lastTime = glfwGetTime();\n\n\t\twhile (running && !glfwWindowShouldClose(window))\n\t\t{\n double frameTime = glfwGetTime() - lastTime;\n lastTime = glfwGetTime();\n\n\t\t\tTickEvent.call(frameTime);\n\n\t\t\tglfwSwapBuffers(window);\n\t\t\tglfwPollEvents();\n\t\t}\n\n running = false;\n\n QuitEvent.call();\n\n\t\treturn true;\n\t}\n\n bool Engine::isRunning() const\n {\n return running;\n }\n\n void Engine::stop()\n {\n running = false;\n }\n\n double Engine::getTime() const\n {\n return glfwGetTime();\n }\n\n\tEngine::Engine()\n {\n\n }\n\n Engine::Engine(const Engine& other)\n {\n\n }\n\n Engine& Engine::operator=(const Engine& other)\n {\n return *this;\n }\n\n Engine::~Engine()\n {\n\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\/\/ stl\n#include <iostream>\n\/\/ boost\n#include <boost\/optional.hpp>\n#include <boost\/algorithm\/string.hpp>\n#include <boost\/lexical_cast.hpp>\n#include <boost\/tokenizer.hpp>\n#include <boost\/property_tree\/ptree.hpp>\n#include <boost\/property_tree\/xml_parser.hpp>\n\/\/ mapnik\n#include <mapnik\/color.hpp>\n#include <mapnik\/color_factory.hpp>\n#include <mapnik\/filter_factory.hpp>\n#include <mapnik\/layer.hpp>\n#include <mapnik\/datasource_cache.hpp>\n\n#include <mapnik\/load_map.hpp>\n\nusing boost::lexical_cast;\nusing boost::bad_lexical_cast;\nusing boost::tokenizer;\n\nnamespace mapnik \n{\n void load_map(Map & map, std::string const& filename)\n {\n using boost::property_tree::ptree;\n ptree pt;\n \n read_xml(filename,pt);\n \n boost::optional<std::string> bgcolor = \n pt.get_optional<std::string>(\"Map.<xmlattr>.bgcolor\");\n if ( bgcolor)\n {\n Color bg = color_factory::from_string(bgcolor->c_str());\n map.setBackground(bg);\n }\n \n ptree::const_iterator itr = pt.get_child(\"Map\").begin();\n ptree::const_iterator end = pt.get_child(\"Map\").end();\n for (; itr != end; ++itr)\n {\n ptree::value_type const& v = *itr;\n \n if (v.first == \"Style\")\n {\n std::string name = v.second.get<std::string>(\"<xmlattr>.name\");\n feature_type_style style;\n \n ptree::const_iterator ruleIter = v.second.begin();\n ptree::const_iterator endRule = v.second.end();\n \n for (; ruleIter!=endRule; ++ruleIter) \n {\n ptree::value_type const& rule_tag = *ruleIter;\n if (rule_tag.first == \"Rule\")\n {\n std::string name = \n rule_tag.second.get<std::string>(\"<xmlattr>.name\",\"\");\n std::string title = \n rule_tag.second.get<std::string>(\"<xmlattr>.title\",\"\");\n rule_type rule(name,title);\n\n boost::optional<std::string> filter_expr = \n rule_tag.second.get_optional<std::string>(\"Filter\");\n \n if (filter_expr)\n {\n rule.set_filter(create_filter(*filter_expr));\n }\n \n boost::optional<double> min_scale = \n rule_tag.second.get_optional<double>(\"MinScaleDenominator\");\n if (min_scale)\n {\n rule.set_min_scale(*min_scale);\n }\n \n boost::optional<double> max_scale = \n rule_tag.second.get_optional<double>(\"MaxScaleDenominator\");\n if (max_scale) \n {\n rule.set_max_scale(*max_scale); \n } \n \n ptree::const_iterator symIter = rule_tag.second.begin();\n ptree::const_iterator endSym = rule_tag.second.end();\n \n for( ;symIter != endSym; ++symIter)\n {\n ptree::value_type const& sym = *symIter;\n \n if ( sym.first == \"PointSymbolizer\")\n {\n std::cout << sym.first << \"\\n\";\n } \n else if ( sym.first == \"LineSymbolizer\")\n {\n stroke strk;\n ptree::const_iterator cssIter = sym.second.begin();\n ptree::const_iterator endCss = sym.second.end();\n \n for(; cssIter != endCss; ++cssIter)\n {\n ptree::value_type const& css = * cssIter;\n std::string css_name = \n css.second.get<std::string>(\"<xmlattr>.name\");\n std::string data = css.second.data();\n if (css_name == \"stroke\")\n {\n Color c = color_factory::from_string(css.second.data().c_str());\n strk.set_color(c);\n }\n else if (css_name == \"stroke-width\")\n {\n try \n {\n float width = lexical_cast<float>(data);\n strk.set_width(width);\n }\n catch (bad_lexical_cast & ex)\n {\n std::clog << ex.what() << \"\\n\";\n }\n }\n else if (css_name == \"stroke-opacity\")\n {\n try \n {\n float opacity = lexical_cast<float>(data);\n strk.set_opacity(opacity);\n }\n catch (bad_lexical_cast & ex)\n {\n std::clog << ex.what() << \"\\n\";\n }\n }\n else if (css_name == \"stroke-linejoin\")\n {\n if (\"miter\" == data)\n {\n strk.set_line_join(mapnik::MITER_JOIN);\n }\n else if (\"round\" == data)\n {\n strk.set_line_join(mapnik::ROUND_JOIN);\n }\n else if (\"bevel\" == data)\n {\n strk.set_line_join(mapnik::BEVEL_JOIN);\n }\n }\n else if (css_name == \"stroke-linecap\")\n {\n if (\"round\" == data)\n {\n strk.set_line_cap(mapnik::ROUND_CAP);\n }\n else if (\"butt\" == data)\n {\n strk.set_line_cap(mapnik::BUTT_CAP);\n }\n else if (\"square\" == data)\n {\n strk.set_line_cap(mapnik::SQUARE_CAP);\n }\n }\n else if (css_name == \"stroke-dasharray\")\n {\n tokenizer<> tok (data);\n std::vector<float> dash_array;\n for (tokenizer<>::iterator itr = tok.begin(); itr != tok.end(); ++itr)\n {\n try \n {\n float f = boost::lexical_cast<float>(*itr);\n dash_array.push_back(f);\n }\n catch ( boost::bad_lexical_cast & ex)\n {\n std::clog << ex.what() << \"\\n\";\n }\n }\n if (dash_array.size())\n {\n size_t size = dash_array.size();\n if ( size % 2) \n { \n for (size_t i=0; i < size ;++i)\n {\n dash_array.push_back(dash_array[i]);\n }\n }\n std::vector<float>::const_iterator pos = dash_array.begin();\n while (pos != dash_array.end())\n {\n strk.add_dash(*pos,*(pos + 1));\n pos +=2;\n }\n }\n }\n }\n rule.append(line_symbolizer(strk));\n } \n else if ( sym.first == \"PolygonSymbolizer\")\n {\n polygon_symbolizer poly_sym;\n \n ptree::const_iterator cssIter = sym.second.begin();\n ptree::const_iterator endCss = sym.second.end();\n \n for(; cssIter != endCss; ++cssIter)\n {\n ptree::value_type const& css = * cssIter;\n \n std::string css_name = \n css.second.get<std::string>(\"<xmlattr>.name\");\n std::string data = css.second.data();\n if (css_name == \"fill\")\n {\n Color c = color_factory::from_string(css.second.data().c_str());\n poly_sym.set_fill(c);\n }\n else if (css_name == \"fill-opacity\")\n {\n try \n {\n float opacity = lexical_cast<float>(data);\n poly_sym.set_opacity(opacity);\n }\n catch (bad_lexical_cast & ex)\n {\n std::clog << ex.what() << \"\\n\";\n }\n }\n }\n rule.append(poly_sym);\n }\n else if ( sym.first == \"TextSymbolizer\")\n {\n std::cout << sym.first << \"\\n\";\n } \n else if ( sym.first == \"RasterSymbolizer\")\n {\n rule.append(raster_symbolizer());\n } \n } \n \n style.add_rule(rule);\n }\n }\n \n map.insert_style(name, style);\n \n }\n else if (v.first == \"Layer\")\n {\n \n std::string name = v.second.get<std::string>(\"<xmlattr>.name\",\"\");\n Layer lyr(name);\n \n boost::optional<std::string> status = \n v.second.get<std::string>(\"<xmlattr>.status\");\n \n if (status && *status == \"off\")\n {\n lyr.setActive(false);\n }\n \n \n ptree::const_iterator itr2 = v.second.begin();\n ptree::const_iterator end2 = v.second.end();\n \n for(; itr2 != end2; ++itr2)\n {\n ptree::value_type const& child = *itr2;\n \n if (child.first == \"StyleName\")\n {\n lyr.add_style(child.second.data());\n }\n else if (child.first == \"Datasource\")\n {\n parameters params;\n ptree::const_iterator paramIter = child.second.begin();\n ptree::const_iterator endParam = child.second.end();\n for (; paramIter != endParam; ++paramIter)\n {\n ptree::value_type const& param_tag=*paramIter;\n \n if (param_tag.first == \"Parameter\")\n {\n std::string name = param_tag.second.get<std::string>(\"<xmlattr>.name\");\n std::string value = param_tag.second.data();\n std::clog << \"name = \" << name << \" value = \" << value << \"\\n\";\n params[name] = value; \n }\n }\n \/\/now we're ready to create datasource \n boost::shared_ptr<datasource> ds = datasource_cache::instance()->create(params);\n lyr.set_datasource(ds);\n }\n }\n map.addLayer(lyr);\n }\n }\n } \n}\n<commit_msg>added <ElseFilter\/> tag support in map loader.<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\/\/ stl\n#include <iostream>\n\/\/ boost\n#include <boost\/optional.hpp>\n#include <boost\/algorithm\/string.hpp>\n#include <boost\/lexical_cast.hpp>\n#include <boost\/tokenizer.hpp>\n#include <boost\/property_tree\/ptree.hpp>\n#include <boost\/property_tree\/xml_parser.hpp>\n\/\/ mapnik\n#include <mapnik\/color.hpp>\n#include <mapnik\/color_factory.hpp>\n#include <mapnik\/filter_factory.hpp>\n#include <mapnik\/layer.hpp>\n#include <mapnik\/datasource_cache.hpp>\n\n#include <mapnik\/load_map.hpp>\n\nusing boost::lexical_cast;\nusing boost::bad_lexical_cast;\nusing boost::tokenizer;\n\nnamespace mapnik \n{\n void load_map(Map & map, std::string const& filename)\n {\n using boost::property_tree::ptree;\n ptree pt;\n \n read_xml(filename,pt);\n \n boost::optional<std::string> bgcolor = \n pt.get_optional<std::string>(\"Map.<xmlattr>.bgcolor\");\n if ( bgcolor)\n {\n Color bg = color_factory::from_string(bgcolor->c_str());\n map.setBackground(bg);\n }\n \n ptree::const_iterator itr = pt.get_child(\"Map\").begin();\n ptree::const_iterator end = pt.get_child(\"Map\").end();\n for (; itr != end; ++itr)\n {\n ptree::value_type const& v = *itr;\n \n if (v.first == \"Style\")\n {\n std::string name = v.second.get<std::string>(\"<xmlattr>.name\");\n feature_type_style style;\n \n ptree::const_iterator ruleIter = v.second.begin();\n ptree::const_iterator endRule = v.second.end();\n \n for (; ruleIter!=endRule; ++ruleIter) \n {\n ptree::value_type const& rule_tag = *ruleIter;\n if (rule_tag.first == \"Rule\")\n {\n std::string name = \n rule_tag.second.get<std::string>(\"<xmlattr>.name\",\"\");\n std::string title = \n rule_tag.second.get<std::string>(\"<xmlattr>.title\",\"\");\n rule_type rule(name,title);\n\n boost::optional<std::string> filter_expr = \n rule_tag.second.get_optional<std::string>(\"Filter\");\n \n if (filter_expr)\n {\n rule.set_filter(create_filter(*filter_expr));\n }\n boost::optional<std::string> else_filter = \n rule_tag.second.get_optional<std::string>(\"ElseFilter\");\n if (else_filter)\n {\n rule.set_else(true);\n }\n \n boost::optional<double> min_scale = \n rule_tag.second.get_optional<double>(\"MinScaleDenominator\");\n if (min_scale)\n {\n rule.set_min_scale(*min_scale);\n }\n \n boost::optional<double> max_scale = \n rule_tag.second.get_optional<double>(\"MaxScaleDenominator\");\n if (max_scale) \n {\n rule.set_max_scale(*max_scale); \n } \n \n ptree::const_iterator symIter = rule_tag.second.begin();\n ptree::const_iterator endSym = rule_tag.second.end();\n \n for( ;symIter != endSym; ++symIter)\n {\n ptree::value_type const& sym = *symIter;\n \n if ( sym.first == \"PointSymbolizer\")\n {\n std::cout << sym.first << \"\\n\";\n } \n else if ( sym.first == \"LineSymbolizer\")\n {\n stroke strk;\n ptree::const_iterator cssIter = sym.second.begin();\n ptree::const_iterator endCss = sym.second.end();\n \n for(; cssIter != endCss; ++cssIter)\n {\n ptree::value_type const& css = * cssIter;\n std::string css_name = \n css.second.get<std::string>(\"<xmlattr>.name\");\n std::string data = css.second.data();\n if (css_name == \"stroke\")\n {\n Color c = color_factory::from_string(css.second.data().c_str());\n strk.set_color(c);\n }\n else if (css_name == \"stroke-width\")\n {\n try \n {\n float width = lexical_cast<float>(data);\n strk.set_width(width);\n }\n catch (bad_lexical_cast & ex)\n {\n std::clog << ex.what() << \"\\n\";\n }\n }\n else if (css_name == \"stroke-opacity\")\n {\n try \n {\n float opacity = lexical_cast<float>(data);\n strk.set_opacity(opacity);\n }\n catch (bad_lexical_cast & ex)\n {\n std::clog << ex.what() << \"\\n\";\n }\n }\n else if (css_name == \"stroke-linejoin\")\n {\n if (\"miter\" == data)\n {\n strk.set_line_join(mapnik::MITER_JOIN);\n }\n else if (\"round\" == data)\n {\n strk.set_line_join(mapnik::ROUND_JOIN);\n }\n else if (\"bevel\" == data)\n {\n strk.set_line_join(mapnik::BEVEL_JOIN);\n }\n }\n else if (css_name == \"stroke-linecap\")\n {\n if (\"round\" == data)\n {\n strk.set_line_cap(mapnik::ROUND_CAP);\n }\n else if (\"butt\" == data)\n {\n strk.set_line_cap(mapnik::BUTT_CAP);\n }\n else if (\"square\" == data)\n {\n strk.set_line_cap(mapnik::SQUARE_CAP);\n }\n }\n else if (css_name == \"stroke-dasharray\")\n {\n tokenizer<> tok (data);\n std::vector<float> dash_array;\n for (tokenizer<>::iterator itr = tok.begin(); itr != tok.end(); ++itr)\n {\n try \n {\n float f = boost::lexical_cast<float>(*itr);\n dash_array.push_back(f);\n }\n catch ( boost::bad_lexical_cast & ex)\n {\n std::clog << ex.what() << \"\\n\";\n }\n }\n if (dash_array.size())\n {\n size_t size = dash_array.size();\n if ( size % 2) \n { \n for (size_t i=0; i < size ;++i)\n {\n dash_array.push_back(dash_array[i]);\n }\n }\n std::vector<float>::const_iterator pos = dash_array.begin();\n while (pos != dash_array.end())\n {\n strk.add_dash(*pos,*(pos + 1));\n pos +=2;\n }\n }\n }\n }\n rule.append(line_symbolizer(strk));\n } \n else if ( sym.first == \"PolygonSymbolizer\")\n {\n polygon_symbolizer poly_sym;\n \n ptree::const_iterator cssIter = sym.second.begin();\n ptree::const_iterator endCss = sym.second.end();\n \n for(; cssIter != endCss; ++cssIter)\n {\n ptree::value_type const& css = * cssIter;\n \n std::string css_name = \n css.second.get<std::string>(\"<xmlattr>.name\");\n std::string data = css.second.data();\n if (css_name == \"fill\")\n {\n Color c = color_factory::from_string(css.second.data().c_str());\n poly_sym.set_fill(c);\n }\n else if (css_name == \"fill-opacity\")\n {\n try \n {\n float opacity = lexical_cast<float>(data);\n poly_sym.set_opacity(opacity);\n }\n catch (bad_lexical_cast & ex)\n {\n std::clog << ex.what() << \"\\n\";\n }\n }\n }\n rule.append(poly_sym);\n }\n else if ( sym.first == \"TextSymbolizer\")\n {\n std::cout << sym.first << \"\\n\";\n } \n else if ( sym.first == \"RasterSymbolizer\")\n {\n rule.append(raster_symbolizer());\n } \n } \n \n style.add_rule(rule);\n }\n }\n \n map.insert_style(name, style);\n \n }\n else if (v.first == \"Layer\")\n {\n \n std::string name = v.second.get<std::string>(\"<xmlattr>.name\",\"\");\n Layer lyr(name);\n \n boost::optional<std::string> status = \n v.second.get<std::string>(\"<xmlattr>.status\");\n \n if (status && *status == \"off\")\n {\n lyr.setActive(false);\n }\n \n \n ptree::const_iterator itr2 = v.second.begin();\n ptree::const_iterator end2 = v.second.end();\n \n for(; itr2 != end2; ++itr2)\n {\n ptree::value_type const& child = *itr2;\n \n if (child.first == \"StyleName\")\n {\n lyr.add_style(child.second.data());\n }\n else if (child.first == \"Datasource\")\n {\n parameters params;\n ptree::const_iterator paramIter = child.second.begin();\n ptree::const_iterator endParam = child.second.end();\n for (; paramIter != endParam; ++paramIter)\n {\n ptree::value_type const& param_tag=*paramIter;\n \n if (param_tag.first == \"Parameter\")\n {\n std::string name = param_tag.second.get<std::string>(\"<xmlattr>.name\");\n std::string value = param_tag.second.data();\n std::clog << \"name = \" << name << \" value = \" << value << \"\\n\";\n params[name] = value; \n }\n }\n \/\/now we're ready to create datasource \n boost::shared_ptr<datasource> ds = datasource_cache::instance()->create(params);\n lyr.set_datasource(ds);\n }\n }\n map.addLayer(lyr);\n }\n }\n } \n}\n<|endoftext|>"} {"text":"<commit_before>#include \"engine.h\"\r\n#include \"random.h\"\r\n#include \"gameEntity.h\"\r\n#include \"Updatable.h\"\r\n#include \"collisionable.h\"\r\n\r\n#ifdef DEBUG\r\n#include <typeinfo>\nint DEBUG_PobjCount;\r\nPObject* DEBUG_PobjListStart;\r\n#endif\r\n\n#ifdef ENABLE_CRASH_LOGGER\n#ifdef __WIN32__\n\/\/Exception handler for mingw, from https:\/\/github.com\/jrfonseca\/drmingw\n#include <exchndl.h>\n#endif\/\/__WIN32__\n#endif\/\/ENABLE_CRASH_LOGGER\n\r\nEngine* engine;\r\n\r\nEngine::Engine()\r\n{\r\n engine = this;\n#ifdef ENABLE_CRASH_LOGGER\n#ifdef __WIN32__\n ExcHndlInit();\n#endif\/\/__WIN32__\n#endif\/\/ENABLE_CRASH_LOGGER\r\n initRandom();\r\n windowManager = nullptr;\n CollisionManager::initialize();\n InputHandler::initialize();\r\n gameSpeed = 1.0;\n running = true;\n elapsedTime = 0.0;\n \n soundManager = new SoundManager();\r\n}\r\nEngine::~Engine()\r\n{\n if (windowManager)\n windowManager->close();\n delete soundManager;\n soundManager = nullptr;\r\n}\r\n\r\nvoid Engine::registerObject(string name, P<PObject> obj)\r\n{\r\n objectMap[name] = obj;\r\n}\r\n\r\nP<PObject> Engine::getObject(string name)\r\n{\r\n if (!objectMap[name])\r\n return NULL;\r\n return objectMap[name];\r\n}\r\n\r\nvoid Engine::runMainLoop()\r\n{\r\n windowManager = dynamic_cast<WindowManager*>(*getObject(\"windowManager\"));\n if (!windowManager)\n {\n sf::Clock frameTimeClock;\n while(running)\n {\n float delta = frameTimeClock.getElapsedTime().asSeconds();\r\n frameTimeClock.restart();\r\n if (delta > 0.5)\r\n delta = 0.5;\r\n if (delta < 0.001)\r\n delta = 0.001;\r\n delta *= gameSpeed;\r\n\n entityList.update();\r\n foreach(Updatable, u, updatableList)\n u->update(delta);\r\n elapsedTime += delta;\r\n CollisionManager::handleCollisions(delta);\n ScriptObject::clearDestroyedObjects();\n soundManager->updateTick();\n \n sf::sleep(sf::seconds(1.0\/60.0 - delta));\n \/\/if (elapsedTime > 2.0)\n \/\/ break;\n }\n }else{\n sf::Clock frameTimeClock;\n#ifdef DEBUG\r\n sf::Clock debugOutputClock;\r\n#endif\n while(running && windowManager->window.isOpen())\n {\n InputHandler::preEventsUpdate();\n \/\/ Handle events\n sf::Event event;\n while (windowManager->window.pollEvent(event))\n {\n handleEvent(event);\n }\n InputHandler::postEventsUpdate();\r\n\r\n#ifdef DEBUG\r\n if (sf::Keyboard::isKeyPressed(sf::Keyboard::Escape) && windowManager->hasFocus())\r\n running = false;\n\n if (debugOutputClock.getElapsedTime().asSeconds() > 1.0)\r\n {\n printf(\"Object count: %4d %4d %4d\\n\", DEBUG_PobjCount, updatableList.size(), entityList.size());\r\n debugOutputClock.restart();\r\n }\r\n#endif\n\r\n float delta = frameTimeClock.restart().asSeconds();\r\n if (delta > 0.5)\r\n delta = 0.5;\r\n if (delta < 0.001)\r\n delta = 0.001;\r\n delta *= gameSpeed;\r\n#ifdef DEBUG\r\n if (sf::Keyboard::isKeyPressed(sf::Keyboard::Tab))\r\n delta \/= 5.0;\r\n if (sf::Keyboard::isKeyPressed(sf::Keyboard::Tilde))\r\n delta *= 5.0;\r\n#endif\n EngineTiming engine_timing;\n \n sf::Clock engine_timing_clock;\n entityList.update();\r\n foreach(Updatable, u, updatableList)\n u->update(delta);\r\n elapsedTime += delta;\n engine_timing.update = engine_timing_clock.restart().asSeconds();\r\n CollisionManager::handleCollisions(delta);\n engine_timing.collision = engine_timing_clock.restart().asSeconds();\n ScriptObject::clearDestroyedObjects();\n soundManager->updateTick();\n\n \/\/ Clear the window\r\n windowManager->render();\n engine_timing.render = engine_timing_clock.restart().asSeconds();\n engine_timing.server_update = 0.0f;\n if (game_server)\n engine_timing.server_update = game_server->getUpdateTime();\n \n last_engine_timing = engine_timing;\n }\n soundManager->stopMusic();\n }\n}\n\nvoid Engine::handleEvent(sf::Event& event)\n{\n \/\/ Window closed: exit\n if ((event.type == sf::Event::Closed))\n running = false;\n if (event.type == sf::Event::GainedFocus)\n windowManager->windowHasFocus = true;\r\n if (event.type == sf::Event::LostFocus)\n windowManager->windowHasFocus = false;\r\n#ifdef DEBUG\r\n if ((event.type == sf::Event::KeyPressed) && (event.key.code == sf::Keyboard::L))\r\n {\r\n int n = 0;\r\n printf(\"---------------------\\n\");\r\n for(PObject* obj = DEBUG_PobjListStart; obj; obj = obj->DEBUG_PobjListNext)\r\n printf(\"%c%4d: %4d: %s\\n\", obj->isDestroyed() ? '>' : ' ', n++, obj->getRefCount(), typeid(*obj).name());\r\n printf(\"---------------------\\n\");\r\n }\n#endif\n InputHandler::handleEvent(event);\r\n if (event.type == sf::Event::Resized)\n windowManager->setupView();\n#ifdef __ANDROID__\n \/\/Focus lost and focus gained events are used when the application window is created and destroyed.\n if (event.type == sf::Event::LostFocus)\n running = false;\n \n \/\/The MouseEntered and MouseLeft events are received when the activity needs to pause or resume.\n if (event.type == sf::Event::MouseLeft)\n {\n \/\/Pause is when a small popup is on top of the window. So keep running.\n while(windowManager->window.isOpen() && windowManager->window.waitEvent(event))\n {\n if (event.type != sf::Event::MouseLeft)\n handleEvent(event);\n if (event.type == sf::Event::MouseEntered)\n break;\n }\n }\n#endif\/\/__ANDROID__\n}\r\n\r\nvoid Engine::setGameSpeed(float speed)\r\n{\r\n gameSpeed = speed;\r\n}\n\nfloat Engine::getGameSpeed()\n{\n return gameSpeed;\n}\r\n\r\nfloat Engine::getElapsedTime()\r\n{\r\n return elapsedTime;\r\n}\n\nEngine::EngineTiming Engine::getEngineTiming()\n{\n return last_engine_timing;\n}\r\n\nvoid Engine::shutdown()\n{\n running = false;\n}\n<commit_msg>Enable floating point exceptions.<commit_after>#include \"engine.h\"\n#include \"random.h\"\n#include \"gameEntity.h\"\n#include \"Updatable.h\"\n#include \"collisionable.h\"\n\n#ifdef __linux__\n#include <fenv.h>\n#endif\n#ifdef __WIN32__\n#include <float.h>\n#endif\n\n#ifdef DEBUG\n#include <typeinfo>\nint DEBUG_PobjCount;\nPObject* DEBUG_PobjListStart;\n#endif\n\n#ifdef ENABLE_CRASH_LOGGER\n#ifdef __WIN32__\n\/\/Exception handler for mingw, from https:\/\/github.com\/jrfonseca\/drmingw\n#include <exchndl.h>\n#endif\/\/__WIN32__\n#endif\/\/ENABLE_CRASH_LOGGER\n\nEngine* engine;\n\nEngine::Engine()\n{\n engine = this;\n#ifdef ENABLE_CRASH_LOGGER\n#ifdef __WIN32__\n ExcHndlInit();\n#endif\/\/__WIN32__\n#endif\/\/ENABLE_CRASH_LOGGER\n#ifdef __linux__\n feenableexcept(FE_DIVBYZERO | FE_INVALID);\n#endif\n#ifdef __WIN32__\n unsigned int current_word = 0;\n _controlfp_s(¤t_word, _EM_INVALID | _EM_ZERODIVIDE, _MCW_EM);\n#endif\n initRandom();\n windowManager = nullptr;\n CollisionManager::initialize();\n InputHandler::initialize();\n gameSpeed = 1.0;\n running = true;\n elapsedTime = 0.0;\n \n soundManager = new SoundManager();\n}\nEngine::~Engine()\n{\n if (windowManager)\n windowManager->close();\n delete soundManager;\n soundManager = nullptr;\n}\n\nvoid Engine::registerObject(string name, P<PObject> obj)\n{\n objectMap[name] = obj;\n}\n\nP<PObject> Engine::getObject(string name)\n{\n if (!objectMap[name])\n return NULL;\n return objectMap[name];\n}\n\nvoid Engine::runMainLoop()\n{\n windowManager = dynamic_cast<WindowManager*>(*getObject(\"windowManager\"));\n if (!windowManager)\n {\n sf::Clock frameTimeClock;\n while(running)\n {\n float delta = frameTimeClock.getElapsedTime().asSeconds();\n frameTimeClock.restart();\n if (delta > 0.5)\n delta = 0.5;\n if (delta < 0.001)\n delta = 0.001;\n delta *= gameSpeed;\n\n entityList.update();\n foreach(Updatable, u, updatableList)\n u->update(delta);\n elapsedTime += delta;\n CollisionManager::handleCollisions(delta);\n ScriptObject::clearDestroyedObjects();\n soundManager->updateTick();\n \n sf::sleep(sf::seconds(1.0\/60.0 - delta));\n \/\/if (elapsedTime > 2.0)\n \/\/ break;\n }\n }else{\n sf::Clock frameTimeClock;\n#ifdef DEBUG\n sf::Clock debugOutputClock;\n#endif\n while(running && windowManager->window.isOpen())\n {\n InputHandler::preEventsUpdate();\n \/\/ Handle events\n sf::Event event;\n while (windowManager->window.pollEvent(event))\n {\n handleEvent(event);\n }\n InputHandler::postEventsUpdate();\n\n#ifdef DEBUG\n if (sf::Keyboard::isKeyPressed(sf::Keyboard::Escape) && windowManager->hasFocus())\n running = false;\n\n if (debugOutputClock.getElapsedTime().asSeconds() > 1.0)\n {\n printf(\"Object count: %4d %4d %4d\\n\", DEBUG_PobjCount, updatableList.size(), entityList.size());\n debugOutputClock.restart();\n }\n#endif\n\n float delta = frameTimeClock.restart().asSeconds();\n if (delta > 0.5)\n delta = 0.5;\n if (delta < 0.001)\n delta = 0.001;\n delta *= gameSpeed;\n#ifdef DEBUG\n if (sf::Keyboard::isKeyPressed(sf::Keyboard::Tab))\n delta \/= 5.0;\n if (sf::Keyboard::isKeyPressed(sf::Keyboard::Tilde))\n delta *= 5.0;\n#endif\n EngineTiming engine_timing;\n \n sf::Clock engine_timing_clock;\n entityList.update();\n foreach(Updatable, u, updatableList)\n u->update(delta);\n elapsedTime += delta;\n engine_timing.update = engine_timing_clock.restart().asSeconds();\n CollisionManager::handleCollisions(delta);\n engine_timing.collision = engine_timing_clock.restart().asSeconds();\n ScriptObject::clearDestroyedObjects();\n soundManager->updateTick();\n\n \/\/ Clear the window\n windowManager->render();\n engine_timing.render = engine_timing_clock.restart().asSeconds();\n engine_timing.server_update = 0.0f;\n if (game_server)\n engine_timing.server_update = game_server->getUpdateTime();\n \n last_engine_timing = engine_timing;\n }\n soundManager->stopMusic();\n }\n}\n\nvoid Engine::handleEvent(sf::Event& event)\n{\n \/\/ Window closed: exit\n if ((event.type == sf::Event::Closed))\n running = false;\n if (event.type == sf::Event::GainedFocus)\n windowManager->windowHasFocus = true;\n if (event.type == sf::Event::LostFocus)\n windowManager->windowHasFocus = false;\n#ifdef DEBUG\n if ((event.type == sf::Event::KeyPressed) && (event.key.code == sf::Keyboard::L))\n {\n int n = 0;\n printf(\"---------------------\\n\");\n for(PObject* obj = DEBUG_PobjListStart; obj; obj = obj->DEBUG_PobjListNext)\n printf(\"%c%4d: %4d: %s\\n\", obj->isDestroyed() ? '>' : ' ', n++, obj->getRefCount(), typeid(*obj).name());\n printf(\"---------------------\\n\");\n }\n#endif\n InputHandler::handleEvent(event);\n if (event.type == sf::Event::Resized)\n windowManager->setupView();\n#ifdef __ANDROID__\n \/\/Focus lost and focus gained events are used when the application window is created and destroyed.\n if (event.type == sf::Event::LostFocus)\n running = false;\n \n \/\/The MouseEntered and MouseLeft events are received when the activity needs to pause or resume.\n if (event.type == sf::Event::MouseLeft)\n {\n \/\/Pause is when a small popup is on top of the window. So keep running.\n while(windowManager->window.isOpen() && windowManager->window.waitEvent(event))\n {\n if (event.type != sf::Event::MouseLeft)\n handleEvent(event);\n if (event.type == sf::Event::MouseEntered)\n break;\n }\n }\n#endif\/\/__ANDROID__\n}\n\nvoid Engine::setGameSpeed(float speed)\n{\n gameSpeed = speed;\n}\n\nfloat Engine::getGameSpeed()\n{\n return gameSpeed;\n}\n\nfloat Engine::getElapsedTime()\n{\n return elapsedTime;\n}\n\nEngine::EngineTiming Engine::getEngineTiming()\n{\n return last_engine_timing;\n}\n\nvoid Engine::shutdown()\n{\n running = false;\n}\n<|endoftext|>"} {"text":"<commit_before>\/*\n * Copyright (C) 2015 Luke San Antonio\n * All rights reserved.\n *\/\n#include <fstream>\n#include <sstream>\n#include <cstdlib>\n#include <vector>\n#include <thread>\n#include <chrono>\n\n#include \"common\/log.h\"\n\n#include \"gfx\/gl\/driver.h\"\n#include \"gfx\/camera.h\"\n#include \"gfx\/mesh_chunk.h\"\n#include \"gfx\/support\/load_wavefront.h\"\n#include \"gfx\/support\/mesh_conversion.h\"\n#include \"gfx\/support\/generate_aabb.h\"\n#include \"gfx\/support\/write_data_to_mesh.h\"\n#include \"gfx\/support\/texture_load.h\"\n#include \"gfx\/support\/format.h\"\n#include \"gfx\/support\/allocate.h\"\n#include \"gfx\/support\/json.h\"\n\n#include \"collisionlib\/triangle_conversion.h\"\n#include \"collisionlib\/triangle.h\"\n\n#include \"common\/json.h\"\n\n#include \"fps\/camera_controller.h\"\n\n#include \"glad\/glad.h\"\n#include \"glfw3.h\"\n\n#define GLM_FORCE_RADIANS\n#include \"glm\/glm.hpp\"\n#include \"glm\/gtc\/matrix_transform.hpp\"\n\n#include \"uv.h\"\n\n#define CATCH_CONFIG_RUNNER\n#include \"catch\/catch.hpp\"\n\n#define PI 3.141592653589793238463\n\nint main(int argc, char** argv)\n{\n using namespace game;\n\n set_log_level(Log_Severity::Debug);\n\n uv_chdir(\"assets\/\");\n\n \/\/ Initialize logger.\n Scoped_Log_Init log_init_raii_lock{};\n\n \/\/ Init glfw.\n if(!glfwInit())\n return EXIT_FAILURE;\n\n auto window = glfwCreateWindow(1000, 1000, \"Hello World\", NULL, NULL);\n if(!window)\n {\n glfwTerminate();\n return EXIT_FAILURE;\n }\n\n \/\/ Init context + load gl functions.\n glfwMakeContextCurrent(window);\n gladLoadGLLoader((GLADloadproc) glfwGetProcAddress);\n\n \/\/ Log glfw version.\n log_i(\"Initialized GLFW %\", glfwGetVersionString());\n\n int maj = glfwGetWindowAttrib(window, GLFW_CONTEXT_VERSION_MAJOR);\n int min = glfwGetWindowAttrib(window, GLFW_CONTEXT_VERSION_MINOR);\n int rev = glfwGetWindowAttrib(window, GLFW_CONTEXT_REVISION);\n\n \/\/ Log GL profile.\n log_i(\"OpenGL core profile %.%.%\", maj, min, rev);\n\n \/\/ Hide the mouse and capture it\n glfwSetInputMode(window, GLFW_CURSOR, GLFW_CURSOR_DISABLED);\n\n auto scene = load_json(\"scene\/fps.json\");\n\n auto player_position = vec3_from_js(scene[\"player_pos\"]);\n\n {\n \/\/ Make an OpenGL driver.\n gfx::gl::Driver driver{Vec<int>{1000, 1000}};\n\n auto shader = driver.make_shader_repr();\n shader->load_vertex_part(\"shader\/basic\/v\");\n shader->load_fragment_part(\"shader\/basic\/f\");\n\n \/\/ We need to get rid of dependency on these in the future.\n shader->set_diffuse_name(\"dif\");\n shader->set_projection_name(\"proj\");\n shader->set_view_name(\"view\");\n shader->set_model_name(\"model\");\n shader->set_sampler_name(\"tex\");\n\n driver.use_shader(*shader);\n\n shader->set_sampler(0);\n\n \/\/ Get all our textures\n auto brick = driver.make_texture_repr();\n load_png(\"tex\/cracked_soil.png\", *brick);\n auto grass = driver.make_texture_repr();\n load_png(\"tex\/grass.png\", *grass);\n\n auto terrain_tex = driver.make_texture_repr();\n load_png(\"tex\/topdown_terrain.png\", *terrain_tex);\n\n \/\/ Make an fps camera.\n auto cam = gfx::make_fps_camera();\n cam.fp.pos = player_position;\n\n auto cam_controller = fps::Camera_Controller{};\n cam_controller.camera(cam);\n\n cam_controller.set_pitch_limit(PI \/ 2);\n\n \/\/ TODO put the house on the scene at a fixed location.\n Maybe_Owned<Mesh> terrain = driver.make_mesh_repr();\n auto terrain_data =\n gfx::to_indexed_mesh_data(gfx::load_wavefront(\"obj\/fps_terrain.obj\"));\n\n gfx::allocate_standard_mesh_buffers(terrain_data.vertices.size(),\n terrain_data.elements.size(),\n *terrain, Usage_Hint::Draw,\n Upload_Hint::Static);\n auto ter_chunk = gfx::write_data_to_mesh(terrain_data, std::move(terrain));\n gfx::format_standard_mesh_buffers(*terrain);\n\n auto triangles = triangles_from_mesh_data(terrain_data);\n\n auto terrain_model = glm::mat4(1.0f);\n\n int fps = 0;\n int time = glfwGetTime();\n\n \/\/ Set up some pre-rendering state.\n driver.clear_color_value(Color{0x55, 0x66, 0x77});\n driver.clear_depth_value(1.0);\n\n glEnable(GL_DEPTH_TEST);\n glDepthFunc(GL_LEQUAL);\n\n double prev_x, prev_y;\n glfwPollEvents();\n glfwGetCursorPos(window, &prev_x, &prev_y);\n\n shader->set_diffuse(colors::white);\n driver.bind_texture(*terrain_tex, 0);\n shader->set_model(terrain_model);\n\n while(!glfwWindowShouldClose(window))\n {\n ++fps;\n\n glfwPollEvents();\n\n if(glfwGetKey(window, GLFW_KEY_ESCAPE) == GLFW_PRESS)\n {\n glfwSetWindowShouldClose(window, true);\n }\n\n glm::vec4 delta_movement;\n if(glfwGetKey(window, GLFW_KEY_W) == GLFW_PRESS)\n {\n delta_movement.z -= 1.0f;\n }\n if(glfwGetKey(window, GLFW_KEY_A) == GLFW_PRESS)\n {\n delta_movement.x -= 1.0f;\n }\n if(glfwGetKey(window, GLFW_KEY_S) == GLFW_PRESS)\n {\n delta_movement.z += 1.0f;\n }\n if(glfwGetKey(window, GLFW_KEY_D) == GLFW_PRESS)\n {\n delta_movement.x += 1.0f;\n }\n\n delta_movement *= .005;\n\n delta_movement = delta_movement *\n glm::rotate(glm::mat4(1.0f), cam.fp.yaw, glm::vec3(0.0f, 1.0f, 0.0f));\n\n double x, y;\n glfwGetCursorPos(window, &x, &y);\n cam_controller.apply_delta_pitch(y \/ 250.0 - prev_y \/ 250.0);\n cam_controller.apply_delta_yaw(x \/ 250.0 - prev_x \/ 250.0);\n prev_x = x, prev_y = y;\n\n cam.fp.pos.x += delta_movement.x;\n cam.fp.pos.z += delta_movement.z;\n\n \/\/ Find the height at cam.fp.pos.\n for(auto const& triangle : triangles)\n {\n if(is_contained(triangle, cam.fp.pos))\n {\n auto bary = to_barycentric_coord(triangle, cam.fp.pos);\n \/\/ The order goes u v w, w is the one we found from the others, so\n \/\/ it is the first point on the triangle. u is towards 2 and v is\n \/\/ towards 1.\n cam.fp.pos.y = triangle.positions[2].y * bary.x +\n triangle.positions[1].y * bary.y +\n triangle.positions[0].y * bary.z + 0.5f;\n }\n }\n\n use_camera(driver, cam);\n\n \/\/ Clear the screen\n driver.clear();\n\n gfx::render_chunk(ter_chunk);\n\n glfwSwapBuffers(window);\n\n if(int(glfwGetTime()) != time)\n {\n time = glfwGetTime();\n log_d(\"fps: %\", fps);\n fps = 0;\n }\n }\n }\n glfwTerminate();\n return 0;\n}\n<commit_msg>We now have a walking vs running key.<commit_after>\/*\n * Copyright (C) 2015 Luke San Antonio\n * All rights reserved.\n *\/\n#include <fstream>\n#include <sstream>\n#include <cstdlib>\n#include <vector>\n#include <thread>\n#include <chrono>\n\n#include \"common\/log.h\"\n\n#include \"gfx\/gl\/driver.h\"\n#include \"gfx\/camera.h\"\n#include \"gfx\/mesh_chunk.h\"\n#include \"gfx\/support\/load_wavefront.h\"\n#include \"gfx\/support\/mesh_conversion.h\"\n#include \"gfx\/support\/generate_aabb.h\"\n#include \"gfx\/support\/write_data_to_mesh.h\"\n#include \"gfx\/support\/texture_load.h\"\n#include \"gfx\/support\/format.h\"\n#include \"gfx\/support\/allocate.h\"\n#include \"gfx\/support\/json.h\"\n\n#include \"collisionlib\/triangle_conversion.h\"\n#include \"collisionlib\/triangle.h\"\n\n#include \"common\/json.h\"\n\n#include \"fps\/camera_controller.h\"\n\n#include \"glad\/glad.h\"\n#include \"glfw3.h\"\n\n#define GLM_FORCE_RADIANS\n#include \"glm\/glm.hpp\"\n#include \"glm\/gtc\/matrix_transform.hpp\"\n\n#include \"uv.h\"\n\n#define CATCH_CONFIG_RUNNER\n#include \"catch\/catch.hpp\"\n\n#define PI 3.141592653589793238463\n\nint main(int argc, char** argv)\n{\n using namespace game;\n\n set_log_level(Log_Severity::Debug);\n\n uv_chdir(\"assets\/\");\n\n \/\/ Initialize logger.\n Scoped_Log_Init log_init_raii_lock{};\n\n \/\/ Init glfw.\n if(!glfwInit())\n return EXIT_FAILURE;\n\n auto window = glfwCreateWindow(1000, 1000, \"Hello World\", NULL, NULL);\n if(!window)\n {\n glfwTerminate();\n return EXIT_FAILURE;\n }\n\n \/\/ Init context + load gl functions.\n glfwMakeContextCurrent(window);\n gladLoadGLLoader((GLADloadproc) glfwGetProcAddress);\n\n \/\/ Log glfw version.\n log_i(\"Initialized GLFW %\", glfwGetVersionString());\n\n int maj = glfwGetWindowAttrib(window, GLFW_CONTEXT_VERSION_MAJOR);\n int min = glfwGetWindowAttrib(window, GLFW_CONTEXT_VERSION_MINOR);\n int rev = glfwGetWindowAttrib(window, GLFW_CONTEXT_REVISION);\n\n \/\/ Log GL profile.\n log_i(\"OpenGL core profile %.%.%\", maj, min, rev);\n\n \/\/ Hide the mouse and capture it\n glfwSetInputMode(window, GLFW_CURSOR, GLFW_CURSOR_DISABLED);\n\n auto scene = load_json(\"scene\/fps.json\");\n\n auto player_position = vec3_from_js(scene[\"player_pos\"]);\n\n {\n \/\/ Make an OpenGL driver.\n gfx::gl::Driver driver{Vec<int>{1000, 1000}};\n\n auto shader = driver.make_shader_repr();\n shader->load_vertex_part(\"shader\/basic\/v\");\n shader->load_fragment_part(\"shader\/basic\/f\");\n\n \/\/ We need to get rid of dependency on these in the future.\n shader->set_diffuse_name(\"dif\");\n shader->set_projection_name(\"proj\");\n shader->set_view_name(\"view\");\n shader->set_model_name(\"model\");\n shader->set_sampler_name(\"tex\");\n\n driver.use_shader(*shader);\n\n shader->set_sampler(0);\n\n \/\/ Get all our textures\n auto brick = driver.make_texture_repr();\n load_png(\"tex\/cracked_soil.png\", *brick);\n auto grass = driver.make_texture_repr();\n load_png(\"tex\/grass.png\", *grass);\n\n auto terrain_tex = driver.make_texture_repr();\n load_png(\"tex\/topdown_terrain.png\", *terrain_tex);\n\n \/\/ Make an fps camera.\n auto cam = gfx::make_fps_camera();\n cam.fp.pos = player_position;\n\n auto cam_controller = fps::Camera_Controller{};\n cam_controller.camera(cam);\n\n cam_controller.set_pitch_limit(PI \/ 2);\n\n \/\/ TODO put the house on the scene at a fixed location.\n Maybe_Owned<Mesh> terrain = driver.make_mesh_repr();\n auto terrain_data =\n gfx::to_indexed_mesh_data(gfx::load_wavefront(\"obj\/fps_terrain.obj\"));\n\n gfx::allocate_standard_mesh_buffers(terrain_data.vertices.size(),\n terrain_data.elements.size(),\n *terrain, Usage_Hint::Draw,\n Upload_Hint::Static);\n auto ter_chunk = gfx::write_data_to_mesh(terrain_data, std::move(terrain));\n gfx::format_standard_mesh_buffers(*terrain);\n\n auto triangles = triangles_from_mesh_data(terrain_data);\n\n auto terrain_model = glm::mat4(1.0f);\n\n int fps = 0;\n int time = glfwGetTime();\n\n \/\/ Set up some pre-rendering state.\n driver.clear_color_value(Color{0x55, 0x66, 0x77});\n driver.clear_depth_value(1.0);\n\n glEnable(GL_DEPTH_TEST);\n glDepthFunc(GL_LEQUAL);\n\n double prev_x, prev_y;\n glfwPollEvents();\n glfwGetCursorPos(window, &prev_x, &prev_y);\n\n shader->set_diffuse(colors::white);\n driver.bind_texture(*terrain_tex, 0);\n shader->set_model(terrain_model);\n\n while(!glfwWindowShouldClose(window))\n {\n ++fps;\n\n glfwPollEvents();\n\n if(glfwGetKey(window, GLFW_KEY_ESCAPE) == GLFW_PRESS)\n {\n glfwSetWindowShouldClose(window, true);\n }\n\n glm::vec4 delta_movement;\n if(glfwGetKey(window, GLFW_KEY_W) == GLFW_PRESS)\n {\n delta_movement.z -= 1.0f;\n }\n if(glfwGetKey(window, GLFW_KEY_A) == GLFW_PRESS)\n {\n delta_movement.x -= 1.0f;\n }\n if(glfwGetKey(window, GLFW_KEY_S) == GLFW_PRESS)\n {\n delta_movement.z += 1.0f;\n }\n if(glfwGetKey(window, GLFW_KEY_D) == GLFW_PRESS)\n {\n delta_movement.x += 1.0f;\n }\n\n \/\/ Temporary replacement for shift, I just didn't feel like looking it up\n if(glfwGetKey(window, GLFW_KEY_C) == GLFW_PRESS)\n {\n delta_movement *= .0005;\n }\n else\n {\n delta_movement *= .005;\n }\n\n delta_movement = delta_movement *\n glm::rotate(glm::mat4(1.0f), cam.fp.yaw, glm::vec3(0.0f, 1.0f, 0.0f));\n\n double x, y;\n glfwGetCursorPos(window, &x, &y);\n cam_controller.apply_delta_pitch(y \/ 250.0 - prev_y \/ 250.0);\n cam_controller.apply_delta_yaw(x \/ 250.0 - prev_x \/ 250.0);\n prev_x = x, prev_y = y;\n\n cam.fp.pos.x += delta_movement.x;\n cam.fp.pos.z += delta_movement.z;\n\n \/\/ Find the height at cam.fp.pos.\n for(auto const& triangle : triangles)\n {\n if(is_contained(triangle, cam.fp.pos))\n {\n auto bary = to_barycentric_coord(triangle, cam.fp.pos);\n \/\/ The order goes u v w, w is the one we found from the others, so\n \/\/ it is the first point on the triangle. u is towards 2 and v is\n \/\/ towards 1.\n cam.fp.pos.y = triangle.positions[2].y * bary.x +\n triangle.positions[1].y * bary.y +\n triangle.positions[0].y * bary.z + 0.5f;\n }\n }\n\n use_camera(driver, cam);\n\n \/\/ Clear the screen\n driver.clear();\n\n gfx::render_chunk(ter_chunk);\n\n glfwSwapBuffers(window);\n\n if(int(glfwGetTime()) != time)\n {\n time = glfwGetTime();\n log_d(\"fps: %\", fps);\n fps = 0;\n }\n }\n }\n glfwTerminate();\n return 0;\n}\n<|endoftext|>"} {"text":"<commit_before>\/*\n * FDOmenu - Menu code generator for icewm\n * Copyright (C) 2015 Eduard Bloch\n *\n * Inspired by icewm-menu-gnome2 and Freedesktop.org specifications\n * Using pure glib\/gio code and a built-in menu structure instead\n * the XML based external definition (as suggested by FD.o specs)\n *\n * Release under terms of the GNU Library General Public License\n * (version 2.0)\n *\n * 2015\/02\/05: Eduard Bloch <edi@gmx.de>\n * - initial version\n *\/\n\n#include \"config.h\"\n#include \"base.h\"\n#include \"sysdep.h\"\n#include \"intl.h\"\n\nconst char *g_argv0;\n\n#include <glib.h>\n#include <glib\/gprintf.h>\n#include <glib\/gstdio.h>\n#include <gio\/gdesktopappinfo.h>\n\ntypedef GList* pglist;\n\ntemplate<class T>\nstruct auto_gfree\n{\n\tT *m_p;\n\tauto_gfree() : m_p(NULL) {};\n\tauto_gfree(T *xp) : m_p(xp) {};\n\t~auto_gfree() { g_free(m_p); }\n};\nstruct auto_gunref\n{\n\tGObject *m_p;\n\tauto_gunref(GObject *xp): m_p(xp) {};\n\t~auto_gunref() { g_object_unref(m_p); }\n};\n\nbool find_in_zArray(const char * const *arrToScan, const char *keyword)\n{\n\tfor(const gchar * const * p=arrToScan;*p;++p)\n\t\tif(!strcmp(keyword, *p))\n\t\t\treturn true;\n\treturn false;\n}\n\n\/\/ for optional bits that are not consuming much and\n\/\/ it's OK to leak them, OS will clean up soon enough\n\/\/#define FREEASAP\n#ifdef FREEASAP\n#define opt_g_free(x) g_free(x);\n#else\n#define opt_g_free(x)\n#endif\n\npglist msettings=0, mscreensavers=0, maccessories=0, mdevelopment=0, meducation=0,\n\t\tmgames=0, mgraphics=0, mmultimedia=0, mnetwork=0, moffice=0, msystem=0,\n\t\tmother=0, mwine=0, meditors=0;\n\n\/\/#warning needing a dupe filter for filename, maybe use GHashTable for that\n\nvoid proc_dir(const char *path, unsigned depth=0)\n{\n\tGDir *pdir = g_dir_open (path, 0, NULL);\n\tif(!pdir)\n\t\treturn;\n\tstruct tdircloser {\n\t\tGDir *m_p;\n\t\ttdircloser(GDir *p) : m_p(p) {};\n\t\t~tdircloser() { g_dir_close(m_p);}\n\t} dircloser(pdir);\n\n\tconst gchar *szFilename(NULL);\n\twhile(NULL != (szFilename = g_dir_read_name (pdir)))\n\t{\n\t\tif(!szFilename)\n\t\t\tcontinue;\n\t\tgchar *szFullName = g_strjoin(\"\/\", path, szFilename, NULL);\n\t\tauto_gfree<gchar> xxfree(szFullName);\n\t\tstatic GStatBuf buf;\n\t\tif(g_stat(szFullName, &buf))\n\t\t\treturn;\n\t\tif(S_ISDIR(buf.st_mode))\n\t\t{\n\t\t\tstatic ino_t reclog[6];\n\t\t\tfor(unsigned i=0; i<depth; ++i)\n\t\t\t{\n\t\t\t\tif(reclog[i] == buf.st_ino)\n\t\t\t\t\tgoto dir_visited_before;\n\t\t\t}\n\t\t\tif(depth<ACOUNT(reclog))\n\t\t\t{\n\t\t\t\treclog[++depth] = buf.st_ino;\n\t\t\t\tproc_dir(szFullName, depth);\n\t\t\t\t--depth;\n\t\t\t}\n\t\t\tdir_visited_before:;\n\t\t}\n\n\t\tif(!S_ISREG(buf.st_mode))\n\t\t\tcontinue;\n\n\t\tGDesktopAppInfo *pInfo = g_desktop_app_info_new_from_filename (szFullName);\n\t\tif(!pInfo)\n\t\t\tcontinue;\n\t\tauto_gunref ___pinfo_releaser((GObject*)pInfo);\n\n\t\tif(!g_app_info_should_show((GAppInfo*) pInfo))\n\t\t\tcontinue;\n\n\t\tconst char *cmdraw = g_app_info_get_commandline ((GAppInfo*) pInfo);\n\t\tif(!cmdraw || !*cmdraw)\n\t\t\tcontinue;\n\n\t\t\/\/ let's whitespace all special fields that we don't support\n\t\tgchar * cmd = g_strdup(cmdraw);\n\t\tauto_gfree<gchar> cmdfree(cmd);\n\t\tbool bDelChars=false;\n\t\tfor(gchar *p=cmd; *p; ++p)\n\t\t{\n\t\t\tif('%' == *p)\n\t\t\t\tbDelChars=true;\n\t\t\tif(bDelChars)\n\t\t\t\t*p = ' ';\n\t\t\tif(bDelChars && !isprint((unsigned)*p))\n\t\t\t\tbDelChars=false;\n\t\t}\n\n\t\tconst char *pName=g_app_info_get_name( (GAppInfo*) pInfo);\n\t\tif(!pName)\n\t\t\tcontinue;\n\t\tconst char *pCats=g_desktop_app_info_get_categories(pInfo);\n\t\tif(!pCats)\n\t\t\tpCats=\"Other\";\n\t\tif(0 == strncmp(pCats, \"X-\", 2))\n\t\t\tcontinue;\n\n\t\tconst char *sicon = \"-\";\n\t\tGIcon *pIcon=g_app_info_get_icon( (GAppInfo*) pInfo);\n\t\tauto_gfree<char> iconstringrelease;\n\t\tif (pIcon)\n\t\t{\n\t\t\tchar *s = g_icon_to_string(pIcon);\n\t\t\ticonstringrelease.m_p=s;\n\t\t\tsicon=s;\n\t\t}\n\n\t\tgchar *menuLine;\n\n\t\tif(g_desktop_app_info_get_boolean (pInfo,\n \"Terminal\") || strchr(cmdraw, '%'))\n\t\t{\n\t\t\tmenuLine = g_strdup_printf(\n\t\t\t\t\t\"prog \\\"%s\\\" %s %s \\\"%s\\\"\\n\",\n\t\t\t\t\tpName, sicon, g_argv0, szFullName);\n\t\t}\n\t\telse\n\t\t\tmenuLine = g_strdup_printf(\n\t\t\t\t\"prog \\\"%s\\\" %s %s\\n\",\n\t\t\t\tpName, sicon, cmd);\n\n\t\t\/\/ Pigeonholing roughly by guessed menu structure\n#define add2menu(x) { x=g_list_append(x, menuLine); }\n\t\tgchar **ppCats = g_strsplit(pCats, \";\", -1);\n\t\tif (find_in_zArray(ppCats, \"Screensaver\"))\n\t\t\tadd2menu(mscreensavers)\n\t\telse if (find_in_zArray(ppCats, \"Settings\"))\n\t\t\tadd2menu(msettings)\n\t\telse if (find_in_zArray(ppCats, \"Accessories\"))\n\t\t\tadd2menu(maccessories)\n\t\telse if (find_in_zArray(ppCats, \"Development\"))\n\t\t\tadd2menu(mdevelopment)\n\t\telse if (find_in_zArray(ppCats, \"Education\"))\n\t\t\tadd2menu(meducation)\n\t\telse if (find_in_zArray(ppCats, \"Game\"))\n\t\t\tadd2menu(mgames)\n\t\telse if (find_in_zArray(ppCats, \"Graphics\"))\n\t\t\tadd2menu(mgraphics)\n\t\telse if (find_in_zArray(ppCats, \"AudioVideo\") || find_in_zArray(ppCats, \"Audio\")\n\t\t\t\t|| find_in_zArray(ppCats, \"Video\"))\n\t\t{\n\t\t\tadd2menu(mmultimedia)\n\t\t}\n\t\telse if (find_in_zArray(ppCats, \"Network\"))\n\t\t\tadd2menu(mnetwork)\n\t\telse if (find_in_zArray(ppCats, \"Office\"))\n\t\t\tadd2menu(moffice)\n\t\telse if (find_in_zArray(ppCats, \"System\") || find_in_zArray(ppCats, \"Emulator\"))\n\t\t\tadd2menu(msystem)\n\t\telse if (strstr(pCats, \"Editor\"))\n\t\t\t\t\tadd2menu(meditors)\n\t\telse\n\t\t{\n\t\t\tconst char *pwmclass = g_desktop_app_info_get_startup_wm_class(pInfo);\n\t\t\tif ((pwmclass && strstr(pwmclass, \"Wine\")) || strstr(cmd, \" wine \"))\n\t\t\t\tadd2menu(mwine)\n\t\t\telse\n\t\t\t\tadd2menu(mother)\n\t\t}\n\t\tg_strfreev(ppCats);\n\t}\n}\n\nstruct tMenuHead {\n\t\tchar *title;\n\t\tpglist pEntries;\n\t\ttMenuHead(char *xt, pglist p) : title(xt), pEntries(p) {};\n\t};\ngint menu_name_compare(gconstpointer a, gconstpointer b)\n{\n\ttMenuHead *pa=(tMenuHead*)a;\n\ttMenuHead *pb=(tMenuHead*)b;\n\treturn g_utf8_collate(pa->title, pb->title);\n}\n\nvoid print_submenu(gpointer vlp)\n{\n\ttMenuHead *l=static_cast<tMenuHead*>(vlp);\n\tif(!l->pEntries)\n\t\treturn;\n\tl->pEntries=g_list_sort(l->pEntries, (GCompareFunc)g_utf8_collate);\n\tprintf(\"menu \\\"%s\\\" folder {\\n\", l->title);\n\tfor (pglist m = l->pEntries; m != NULL; m = m->next)\n\t{\n\t\tprintf(\"%s\", (const char*) m->data);\n\t\tg_free(m->data);\n\t}\n\tprintf(\"}\\n\");\n}\n\nvoid dump_menu()\n{\n\tpglist xmenu = 0;\n#define\taddmenu(name, store) \\\n\t\txmenu = g_list_insert_sorted(xmenu, new tMenuHead(name, store),\\\n\t\t\t\t(GCompareFunc)menu_name_compare);\n\taddmenu(_(\"Settings\"), msettings);\n\taddmenu(_(\"Screensavers\"), mscreensavers);\n\taddmenu(_(\"Accessories\"), maccessories);\n\taddmenu(_(\"Development\"), mdevelopment);\n\taddmenu(_(\"Education\"), meducation);\n\taddmenu(_(\"Games\"), mgames);\n\taddmenu(_(\"Graphics\"), mgraphics);\n\taddmenu(_(\"Multimedia\"), mmultimedia);\n\taddmenu(_(\"Network\"), mnetwork);\n\taddmenu(_(\"Office\"), moffice);\n\taddmenu(_(\"System\"), msystem);\n\taddmenu(_(\"WINE\"), mwine);\n\taddmenu(_(\"Editors\"), meditors);\n\n\tfor (pglist l = xmenu; l != NULL; l = l->next)\n\t\tprint_submenu(l->data);\n\tputs(\"separator\");\n\ttMenuHead hmo(_(\"Other\"), mother);\n\tprint_submenu(&hmo);\n\n}\n\nbool launch(const char *dfile)\n{\n\tGDesktopAppInfo *pInfo = g_desktop_app_info_new_from_filename (dfile);\n\tif(!pInfo)\n\t\treturn false;\n\treturn g_app_info_launch ((GAppInfo *)pInfo,\n NULL, NULL, NULL);\n}\n\nint main(int argc, char **argv)\n{\n\tg_argv0=argv[0];\n\n\tsetlocale (LC_ALL, \"\");\n\n#ifdef ENABLE_NLS\n bindtextdomain(PACKAGE, LOCDIR);\n textdomain(PACKAGE);\n#endif\n\n\tconst char * usershare=getenv(\"XDG_DATA_HOME\"),\n\t\t\t*sysshare=getenv(\"XDG_DATA_DIRS\");\n\n\tif(!usershare || !*usershare)\n\t\tusershare=g_strjoin(NULL, getenv(\"HOME\"), \"\/.local\/share\", NULL);\n\n\tif(!sysshare || !*sysshare)\n\t\tsysshare=\"\/usr\/local\/share:\/usr\/share\";\n\n\tif(argc>1)\n\t{\n\t\tif(strstr(argv[1], \".desktop\") && launch(argv[1]))\n\t\t\treturn EXIT_SUCCESS;\n\n\t\tg_fprintf(stderr, \"This program doesn't use command line options. It only listens to\\n\"\n\t\t\t\"environment variables defined by XDG Base Directory Specification.\\n\"\n\t\t\t\"XDG_DATA_HOME=%s\\n\"\n\t\t\t\t\"XDG_DATA_DIRS=%s\\n\"\n\t\t\t,usershare, sysshare);\n\t\treturn EXIT_FAILURE;\n\t}\n\n\tproc_dir(usershare);\n\tgchar **ppDirs = g_strsplit (sysshare, \":\", -1);\n\tfor(const gchar * const * p=ppDirs;*p;++p)\n\t{\n\t\tgchar *pmdir=g_strjoin(0, *p, \"\/applications\", NULL);\n\t\tproc_dir(pmdir);\n\t\topt_g_free(pmdir);\n\t}\n#ifdef FREEASAP\n\tg_strfreev(ppDirs);\n#endif\n\n\tdump_menu();\n\n\treturn EXIT_SUCCESS;\n}\n<commit_msg>Bring in more structure, use GTree to sort and remove dupes<commit_after>\/*\n * FDOmenu - Menu code generator for icewm\n * Copyright (C) 2015 Eduard Bloch\n *\n * Inspired by icewm-menu-gnome2 and Freedesktop.org specifications\n * Using pure glib\/gio code and a built-in menu structure instead\n * the XML based external definition (as suggested by FD.o specs)\n *\n * Release under terms of the GNU Library General Public License\n * (version 2.0)\n *\n * 2015\/02\/05: Eduard Bloch <edi@gmx.de>\n * - initial version\n *\/\n\n#include \"config.h\"\n#include \"base.h\"\n#include \"sysdep.h\"\n#include \"intl.h\"\n\nconst char *g_argv0;\n\n#include <glib.h>\n#include <glib\/gprintf.h>\n#include <glib\/gstdio.h>\n#include <gio\/gdesktopappinfo.h>\n\ntypedef GTree* tMenuContainer;\n\ntemplate<class T>\nstruct auto_gfree\n{\n\tT *m_p;\n\tauto_gfree() : m_p(NULL) {};\n\tauto_gfree(T *xp) : m_p(xp) {};\n\t~auto_gfree() { g_free(m_p); }\n};\nstruct auto_gunref\n{\n\tGObject *m_p;\n\tauto_gunref(GObject *xp): m_p(xp) {};\n\t~auto_gunref() { g_object_unref(m_p); }\n};\n\nbool find_in_zArray(const char * const *arrToScan, const char *keyword)\n{\n\tfor(const gchar * const * p=arrToScan;*p;++p)\n\t\tif(!strcmp(keyword, *p))\n\t\t\treturn true;\n\treturn false;\n}\n\n\/\/ for optional bits that are not consuming much and\n\/\/ it's OK to leak them, OS will clean up soon enough\n\/\/#define FREEASAP\n#ifdef FREEASAP\n#define opt_g_free(x) g_free(x);\n#else\n#define opt_g_free(x)\n#endif\n\ntMenuContainer msettings=0, mscreensavers=0, maccessories=0, mdevelopment=0, meducation=0,\n\t\tmgames=0, mgraphics=0, mmultimedia=0, mnetwork=0, moffice=0, msystem=0,\n\t\tmother=0, mwine=0, meditors=0;\n\nstruct tListMeta\n{\n\tconst char *title;\n\ttMenuContainer* store;\n};\ntListMeta menuinfo[] =\n{\n{ \"Settings\", &msettings },\n{ \"Screensavers\", &mscreensavers },\n{ \"Accessories\", &maccessories },\n{ \"Development\", &mdevelopment },\n{ \"Education\", &meducation },\n{ \"Games\", &mgames },\n{ \"Graphics\", &mgraphics },\n{ \"Multimedia\", &mmultimedia },\n{ \"Network\", &mnetwork },\n{ \"Office\", &moffice },\n{ \"System\", &msystem },\n{ \"WINE\", &mwine },\n{ \"Editors\", &meditors },\n{ \"Other\", &mother } };\n\n\/\/#warning needing a dupe filter for filename, maybe use GHashTable for that\n\nvoid proc_dir(const char *path, unsigned depth=0)\n{\n\tGDir *pdir = g_dir_open (path, 0, NULL);\n\tif(!pdir)\n\t\treturn;\n\tstruct tdircloser {\n\t\tGDir *m_p;\n\t\ttdircloser(GDir *p) : m_p(p) {};\n\t\t~tdircloser() { g_dir_close(m_p);}\n\t} dircloser(pdir);\n\n\tconst gchar *szFilename(NULL);\n\twhile(NULL != (szFilename = g_dir_read_name (pdir)))\n\t{\n\t\tif(!szFilename)\n\t\t\tcontinue;\n\t\tgchar *szFullName = g_strjoin(\"\/\", path, szFilename, NULL);\n\t\tauto_gfree<gchar> xxfree(szFullName);\n\t\tstatic GStatBuf buf;\n\t\tif(g_stat(szFullName, &buf))\n\t\t\treturn;\n\t\tif(S_ISDIR(buf.st_mode))\n\t\t{\n\t\t\tstatic ino_t reclog[6];\n\t\t\tfor(unsigned i=0; i<depth; ++i)\n\t\t\t{\n\t\t\t\tif(reclog[i] == buf.st_ino)\n\t\t\t\t\tgoto dir_visited_before;\n\t\t\t}\n\t\t\tif(depth<ACOUNT(reclog))\n\t\t\t{\n\t\t\t\treclog[++depth] = buf.st_ino;\n\t\t\t\tproc_dir(szFullName, depth);\n\t\t\t\t--depth;\n\t\t\t}\n\t\t\tdir_visited_before:;\n\t\t}\n\n\t\tif(!S_ISREG(buf.st_mode))\n\t\t\tcontinue;\n\n\t\tGDesktopAppInfo *pInfo = g_desktop_app_info_new_from_filename (szFullName);\n\t\tif(!pInfo)\n\t\t\tcontinue;\n\t\tauto_gunref ___pinfo_releaser((GObject*)pInfo);\n\n\t\tif(!g_app_info_should_show((GAppInfo*) pInfo))\n\t\t\tcontinue;\n\n\t\tconst char *cmdraw = g_app_info_get_commandline ((GAppInfo*) pInfo);\n\t\tif(!cmdraw || !*cmdraw)\n\t\t\tcontinue;\n\n\t\t\/\/ let's whitespace all special fields that we don't support\n\t\tgchar * cmd = g_strdup(cmdraw);\n\t\tauto_gfree<gchar> cmdfree(cmd);\n\t\tbool bDelChars=false;\n\t\tfor(gchar *p=cmd; *p; ++p)\n\t\t{\n\t\t\tif('%' == *p)\n\t\t\t\tbDelChars=true;\n\t\t\tif(bDelChars)\n\t\t\t\t*p = ' ';\n\t\t\tif(bDelChars && !isprint((unsigned)*p))\n\t\t\t\tbDelChars=false;\n\t\t}\n\n\t\tconst char *pName=g_app_info_get_name( (GAppInfo*) pInfo);\n\t\tif(!pName)\n\t\t\tcontinue;\n\t\tconst char *pCats=g_desktop_app_info_get_categories(pInfo);\n\t\tif(!pCats)\n\t\t\tpCats=\"Other\";\n\t\tif(0 == strncmp(pCats, \"X-\", 2))\n\t\t\tcontinue;\n\n\t\tconst char *sicon = \"-\";\n\t\tGIcon *pIcon=g_app_info_get_icon( (GAppInfo*) pInfo);\n\t\tauto_gfree<char> iconstringrelease;\n\t\tif (pIcon)\n\t\t{\n\t\t\tchar *s = g_icon_to_string(pIcon);\n\t\t\ticonstringrelease.m_p=s;\n\t\t\tsicon=s;\n\t\t}\n\n\t\tgchar *menuLine;\n\n\t\tif(g_desktop_app_info_get_boolean (pInfo,\n \"Terminal\") || strchr(cmdraw, '%'))\n\t\t{\n\t\t\tmenuLine = g_strdup_printf(\n\t\t\t\t\t\"%s %s \\\"%s\\\"\",\n\t\t\t\t\tsicon, g_argv0, szFullName);\n\t\t}\n\t\telse\n\t\t\tmenuLine = g_strjoin(\" \", sicon, cmd, NULL);\n\n\t\t\/\/ Pigeonholing roughly by guessed menu structure\n#define add2menu(x) { g_tree_replace(x, g_strdup(pName), menuLine); }\n\t\tgchar **ppCats = g_strsplit(pCats, \";\", -1);\n\t\tif (find_in_zArray(ppCats, \"Screensaver\"))\n\t\t\tadd2menu(mscreensavers)\n\t\telse if (find_in_zArray(ppCats, \"Settings\"))\n\t\t\tadd2menu(msettings)\n\t\telse if (find_in_zArray(ppCats, \"Accessories\"))\n\t\t\tadd2menu(maccessories)\n\t\telse if (find_in_zArray(ppCats, \"Development\"))\n\t\t\tadd2menu(mdevelopment)\n\t\telse if (find_in_zArray(ppCats, \"Education\"))\n\t\t\tadd2menu(meducation)\n\t\telse if (find_in_zArray(ppCats, \"Game\"))\n\t\t\tadd2menu(mgames)\n\t\telse if (find_in_zArray(ppCats, \"Graphics\"))\n\t\t\tadd2menu(mgraphics)\n\t\telse if (find_in_zArray(ppCats, \"AudioVideo\") || find_in_zArray(ppCats, \"Audio\")\n\t\t\t\t|| find_in_zArray(ppCats, \"Video\"))\n\t\t{\n\t\t\tadd2menu(mmultimedia)\n\t\t}\n\t\telse if (find_in_zArray(ppCats, \"Network\"))\n\t\t\tadd2menu(mnetwork)\n\t\telse if (find_in_zArray(ppCats, \"Office\"))\n\t\t\tadd2menu(moffice)\n\t\telse if (find_in_zArray(ppCats, \"System\") || find_in_zArray(ppCats, \"Emulator\"))\n\t\t\tadd2menu(msystem)\n\t\telse if (strstr(pCats, \"Editor\"))\n\t\t\tadd2menu(meditors)\n\t\telse\n\t\t{\n\t\t\tconst char *pwmclass = g_desktop_app_info_get_startup_wm_class(pInfo);\n\t\t\tif ((pwmclass && strstr(pwmclass, \"Wine\")) || strstr(cmd, \" wine \"))\n\t\t\t\tadd2menu(mwine)\n\t\t\telse\n\t\t\t\tadd2menu(mother)\n\t\t}\n\t\tg_strfreev(ppCats);\n\t}\n}\n\nstatic gboolean printKey(const char *key, const char *value, void*)\n{\n\tprintf(\"prog \\\"%s\\\" %s\\n\", key, value);\n\treturn FALSE;\n}\n\nvoid print_submenu(const char *title, tMenuContainer data)\n{\n\tif(!data || !g_tree_nnodes(data))\n\t\treturn;\n\tprintf(\"menu \\\"%s\\\" folder {\\n\"\n\t\t\t\/\/\"# %u entries\\n\"\n\t\t\t, title\n\t\t\t\/\/, g_tree_nnodes(data)\n\t\t\t);\n\tg_tree_foreach(data, (GTraverseFunc) printKey, NULL);\n\tputs(\"}\");\n}\n\nvoid dump_menu()\n{\n for(tListMeta *p=menuinfo; p < menuinfo+ACOUNT(menuinfo)-1; ++p)\n \tprint_submenu(p->title, * p->store);\n\tputs(\"separator\");\n\tprint_submenu(menuinfo[ACOUNT(menuinfo)-1].title, * menuinfo[ACOUNT(menuinfo)-1].store);\n}\n\nbool launch(const char *dfile, const char **argv, int argc)\n{\n\tGDesktopAppInfo *pInfo = g_desktop_app_info_new_from_filename (dfile);\n\tif(!pInfo)\n\t\treturn false;\n#if 0 \/\/ g_file_get_uri crashes, no idea why, even enforcing file prefix doesn't help\n\tif(argc>0)\n\t{\n\t\tGList* parms=NULL;\n\t\tfor(int i=0; i<argc; ++i)\n\t\t\tparms=g_list_append(parms,\n\t\t\t\t\tg_strdup_printf(\"%s%s\", strstr(argv[i], \":\/\/\") ? \"\" : \"file:\/\/\",\n\t\t\t\t\t\t\targv[i]));\n\t\treturn g_app_info_launch ((GAppInfo *)pInfo,\n\t\t parms, NULL, NULL);\n\t}\n\telse\n#else\n\t(void) argv;\n\t(void) argc;\n#endif\n\treturn g_app_info_launch ((GAppInfo *)pInfo,\n NULL, NULL, NULL);\n}\nstatic int\ncmpstringp(const void *p1, const void *p2)\n{\n return g_utf8_collate(* (char * const *) p1, * (char * const *) p2);\n}\n\nstatic void init()\n{\n\tsetlocale (LC_ALL, \"\");\n\n#ifdef ENABLE_NLS\n bindtextdomain(PACKAGE, LOCDIR);\n textdomain(PACKAGE);\n#endif\n\n for(tListMeta *p=menuinfo; p < menuinfo+ACOUNT(menuinfo); ++p)\n {\n \tp->title = gettext(p->title);\n \t*(p->store) = g_tree_new((GCompareFunc) g_utf8_collate);\n }\n\n qsort(menuinfo, ACOUNT(menuinfo)-1, sizeof(menuinfo[0]), cmpstringp);\n}\n\nint main(int argc, const char **argv)\n{\n\tg_argv0=argv[0];\n\n\tinit();\n\n\tconst char * usershare=getenv(\"XDG_DATA_HOME\"),\n\t\t\t*sysshare=getenv(\"XDG_DATA_DIRS\");\n\n\tif(!usershare || !*usershare)\n\t\tusershare=g_strjoin(NULL, getenv(\"HOME\"), \"\/.local\/share\", NULL);\n\n\tif(!sysshare || !*sysshare)\n\t\tsysshare=\"\/usr\/local\/share:\/usr\/share\";\n\n\tif(argc>1)\n\t{\n\t\tif(strstr(argv[1], \".desktop\") && launch(argv[1], argv+2, argc-2))\n\t\t\treturn EXIT_SUCCESS;\n\n\t\tg_fprintf(stderr, \"This program doesn't use command line options. It only listens to\\n\"\n\t\t\t\"environment variables defined by XDG Base Directory Specification.\\n\"\n\t\t\t\"XDG_DATA_HOME=%s\\n\"\n\t\t\t\t\"XDG_DATA_DIRS=%s\\n\"\n\t\t\t,usershare, sysshare);\n\t\treturn EXIT_FAILURE;\n\t}\n\tgchar **ppDirs = g_strsplit (sysshare, \":\", -1);\n#ifdef FREEASAP\n\tg_strfreev(ppDirs);\n#endif\n\tfor (const gchar * const * p = ppDirs; *p; ++p)\n\t{\n\t\tgchar *pmdir = g_strjoin(0, *p, \"\/applications\", NULL);\n\t\tproc_dir(pmdir);\n\t\topt_g_free(pmdir);\n\t}\n\t\/\/ user's stuff might replace the system links\n\tproc_dir(usershare);\n\n\tdump_menu();\n\n\treturn EXIT_SUCCESS;\n}\n<|endoftext|>"} {"text":"<commit_before><commit_msg>Reenable BWSI key on login screen<commit_after><|endoftext|>"} {"text":"<commit_before><commit_msg>Fixed compilation error under Visual Studio 2012<commit_after><|endoftext|>"} {"text":"<commit_before><commit_msg>Bugfix: removed duplicate `#include` lines.<commit_after><|endoftext|>"} {"text":"<commit_before>\/*************************************************************************\n *\n * $RCSfile: app.hxx,v $\n *\n * $Revision: 1.1.1.1 $\n *\n * last change: $Author: hr $ $Date: 2000-09-18 16:48:27 $\n *\n * The Contents of this file are made available subject to the terms of\n * either of the following licenses\n *\n * - GNU Lesser General Public License Version 2.1\n * - Sun Industry Standards Source License Version 1.1\n *\n * Sun Microsystems Inc., October, 2000\n *\n * GNU Lesser General Public License Version 2.1\n * =============================================\n * Copyright 2000 by Sun Microsystems, Inc.\n * 901 San Antonio Road, Palo Alto, CA 94303, USA\n *\n * This library is free software; you can redistribute it and\/or\n * modify it under the terms of the GNU Lesser General Public\n * License version 2.1, as published by the Free Software Foundation.\n *\n * This library is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU\n * Lesser General Public License for more details.\n *\n * You should have received a copy of the GNU Lesser General Public\n * License along with this library; if not, write to the Free Software\n * Foundation, Inc., 59 Temple Place, Suite 330, Boston,\n * MA 02111-1307 USA\n *\n *\n * Sun Industry Standards Source License Version 1.1\n * =================================================\n * The contents of this file are subject to the Sun Industry Standards\n * Source License Version 1.1 (the \"License\"); You may not use this file\n * except in compliance with the License. You may obtain a copy of the\n * License at http:\/\/www.openoffice.org\/license.html.\n *\n * Software provided under this License is provided on an \"AS IS\" basis,\n * WITHOUT WARRANTY OF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING,\n * WITHOUT LIMITATION, WARRANTIES THAT THE SOFTWARE IS FREE OF DEFECTS,\n * MERCHANTABLE, FIT FOR A PARTICULAR PURPOSE, OR NON-INFRINGING.\n * See the License for the specific provisions governing your rights and\n * obligations concerning the Software.\n *\n * The Initial Developer of the Original Code is: Sun Microsystems, Inc.\n *\n * Copyright: 2000 by Sun Microsystems, Inc.\n *\n * All Rights Reserved.\n *\n * Contributor(s): _______________________________________\n *\n *\n ************************************************************************\/\n#define _SD_DLL \/\/ fuer SD_MOD()\n#include \"sdmod.hxx\"\n\n<commit_msg>INTEGRATION: CWS ooo19126 (1.1.1.1.930); FILE MERGED 2005\/09\/05 13:19:51 rt 1.1.1.1.930.1: #i54170# Change license header: remove SISSL<commit_after>\/*************************************************************************\n *\n * OpenOffice.org - a multi-platform office productivity suite\n *\n * $RCSfile: app.hxx,v $\n *\n * $Revision: 1.2 $\n *\n * last change: $Author: rt $ $Date: 2005-09-09 02:53: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#define _SD_DLL \/\/ fuer SD_MOD()\n#include \"sdmod.hxx\"\n\n<|endoftext|>"} {"text":"<commit_before>\/*\n * SWE_Plane_TS_ln_erk.cpp\n *\n * Created on: 29 May 2017\n * Author: Martin Schreiber <SchreiberX@gmail.com>\n *\n * Changelog:\n *\n * \t2017-07-13: Updated and validated by P. Peixoto.\n * \t2017-05-29: Based on source swe_plane.cpp\n *\t\t\t\t\twhich was also written by Pedro Peixoto\n *\/\n\n#include \"..\/swe_plane\/SWE_Plane_TS_ln_erk.hpp\"\n\n\n\/*\n * Main routine for method to be used in case of finite differences\n *\n * - A-Grid with spectral or FD spatial discretizations\n * - C-Grid with energy conserving FD scheme for spatial discretizations\n *\n *\/\nvoid SWE_Plane_TS_ln_erk::euler_timestep_update(\n\t\tconst PlaneData &i_h,\t\/\/\/< prognostic variables (perturbed part of height)\n\t\tconst PlaneData &i_u,\t\/\/\/< prognostic variables\n\t\tconst PlaneData &i_v,\t\/\/\/< prognostic variables\n\n\t\tPlaneData &o_h_t,\t\/\/\/< time updates\n\t\tPlaneData &o_u_t,\t\/\/\/< time updates\n\t\tPlaneData &o_v_t,\t\/\/\/< time updates\n\n\t\tdouble i_simulation_timestamp\n)\n{\n\t\/\/ A-grid method\n\tif (!simVars.disc.space_grid_use_c_staggering)\n\t{\n\t\t\/*\n\t\t * non-conservative (advective) formulation:\n\t\t *\n\t\t *\th_t = -(u*h)_x - (v*h)_y\n\t\t *\tu_t = -g * h_x - u * u_x - v * u_y + f*v\n\t\t *\tv_t = -g * h_y - u * v_x - v * v_y - f*u\n\t\t *\/\n\n\t\tPlaneData total_h = i_h + simVars.sim.h0;\n\n\t\to_u_t = -simVars.sim.gravitation*op.diff_c_x(total_h) - i_u*op.diff_c_x(i_u) - i_v*op.diff_c_y(i_u);\n\t\to_v_t = -simVars.sim.gravitation*op.diff_c_y(total_h) - i_u*op.diff_c_x(i_v) - i_v*op.diff_c_y(i_v);\n\n\t\to_u_t += simVars.sim.plane_rotating_f0*i_v;\n\t\to_v_t -= simVars.sim.plane_rotating_f0*i_u;\n\n\t\t\/\/ standard update\n\t\t\/*\n\t\t * P UPDATE\n\t\t *\/\n\t\tif (!use_only_linear_divergence){ \/\/full nonlinear divergence\n\t\t\t\/\/ standard update\n\t\t\t\/\/o_h_t = -op.diff_f_x(U) - op.diff_f_y(V);\n\t\t\to_h_t = -op.diff_c_x(i_u*total_h) - op.diff_c_y(i_v*total_h);\n\t\t}\n\t\telse \/\/ use linear divergence\n\t\t{\n\t\t\t\/\/o_h_t = -op.diff_f_x(simVars.sim.h0*i_u) - op.diff_f_y(simVars.sim.h0*i_v);\n\t\t\to_h_t = -i_u*op.diff_c_x(total_h) - i_v*op.diff_c_y(total_h) + \/\/nonlinear adv\n\t\t\t\t\t-op.diff_c_x(i_u*simVars.sim.h0) - op.diff_c_y(i_v*simVars.sim.h0); \/\/linear div\n\t\t}\n\n\t}\n\telse \/\/ simVars.disc.use_staggering = true\n\t{\n\t\t\/\/ STAGGERED GRID\n\n\t\tPlaneData U(i_h.planeDataConfig); \/\/ U flux\n\t\tPlaneData V(i_h.planeDataConfig); \/\/ V flux\n\t\tPlaneData H(i_h.planeDataConfig); \/\/Bernoulli potential\n\t\tPlaneData total_h = i_h + simVars.sim.h0;\n\n\t\t\/*\n\t\t * Sadourny energy conserving scheme\n\t\t *\n\t\t * Note, that this grid does not follow the formulation\n\t\t * in the paper of Robert Sadourny, but looks as follows:\n\t\t *\n\t\t * ^\n\t\t * |\n\t\t * ______v0,1_____\n\t\t * | |\n\t\t * |\t\t\t |\n\t\t * | |\n\t\t * u0,0 |-> H\/P0,0 |u1,0 ->\n\t\t *(0,0.5)|\t\t\t |\n\t\t * | ^ |\n\t\t * q0,0|______|______|\n\t\t * (0,0) v0,0\n\t\t * (0.5,0)\n\t\t *\n\t\t * V_t + q N x (P V) + grad( g P + 1\/2 V*V) = 0\n\t\t * P_t + div(P V) = 0\n\t\t *\/\n\t\t\/*\n\t\t * U and V updates\n\t\t *\/\n\n\n\t\tU = op.avg_b_x(total_h)*i_u;\n\t\tV = op.avg_b_y(total_h)*i_v;\n\n\n\t\tH = simVars.sim.gravitation*total_h + 0.5*(op.avg_f_x(i_u*i_u) + op.avg_f_y(i_v*i_v));\n\n\n\n\t\t\/\/ Potential vorticity\n\t\tPlaneData total_h_pv = total_h;\n\t\ttotal_h_pv = op.avg_b_x(op.avg_b_y(total_h));\n\n\t\tif (total_h_pv.reduce_min() < 0.00000001)\n\t\t{\n\t\t\tstd::cerr << \"Test case not adequate for vector invariant formulation. Null or negative water height\" << std::endl;\n\t\t\tstd::cerr << \"Min h_pv : \" << total_h_pv.reduce_min() << std::endl;\n\t\t\tstd::cerr << \"Min h_total: \" << total_h.reduce_min() << std::endl;\n\t\t\tstd::cerr << \"Min h_pert : \" << i_h.reduce_min() << std::endl;\n\t\t\tFatalError(\"SWE_Plane_TS_ln_erk: Methods unstable or inadequate for vector invariant swe\");;\n\t\t}\n\n\t\tPlaneData q = (op.diff_b_x(i_v) - op.diff_b_y(i_u) + simVars.sim.plane_rotating_f0) \/ total_h_pv;\n\n\t\t\/\/ u, v tendencies\n\t\t\/\/ Energy conserving scheme\n\t\to_u_t = op.avg_f_y(q*op.avg_b_x(V)) - op.diff_b_x(H);\n\t\to_v_t = -op.avg_f_x(q*op.avg_b_y(U)) - op.diff_b_y(H);\n\n\n\t\t\/*\n\t\t * P UPDATE\n\t\t *\/\n\t\tif (!use_only_linear_divergence){ \/\/full nonlinear divergence\n\t\t\t\/\/ standard update\n\t\t\to_h_t = -op.diff_f_x(U) - op.diff_f_y(V);\n\t\t}\n\t\telse \/\/ use linear divergence\n\t\t{\n\t\t\to_h_t = -i_u*op.diff_f_x(total_h) - i_v*op.diff_f_y(total_h) + \/\/nonlinear adv\n\t\t\t\t\t-op.diff_f_x(i_u*simVars.sim.h0) - op.diff_f_y(i_v*simVars.sim.h0); \/\/linear div\n\t\t\t\/\/o_h_t = -op.diff_f_x(simVars.sim.h0*i_u) - op.diff_f_y(simVars.sim.h0*i_v);\n\t\t}\n\t}\n}\n\n\n\nvoid SWE_Plane_TS_ln_erk::run_timestep(\n\t\tPlaneData &io_h,\t\/\/\/< prognostic variables\n\t\tPlaneData &io_u,\t\/\/\/< prognostic variables\n\t\tPlaneData &io_v,\t\/\/\/< prognostic variables\n\n\t\tdouble i_dt,\t\t\/\/\/< if this value is not equal to 0, use this time step size instead of computing one\n\t\tdouble i_simulation_timestamp\n)\n{\n\tif (i_dt <= 0)\n\t\tFatalError(\"SWE_Plane_TS_ln_erk: Only constant time step size allowed\");\n\n\t\/\/ standard time stepping\n\ttimestepping_rk.run_timestep(\n\t\t\tthis,\n\t\t\t&SWE_Plane_TS_ln_erk::euler_timestep_update,\t\/\/\/< pointer to function to compute euler time step updates\n\t\t\tio_h, io_u, io_v,\n\t\t\ti_dt,\n\t\t\ttimestepping_order,\n\t\t\ti_simulation_timestamp\n\t\t);\n}\n\n\n\n\/*\n * Setup\n *\/\nvoid SWE_Plane_TS_ln_erk::setup(\n\t\tint i_order,\t\/\/\/< order of RK time stepping method\n\t\tbool i_use_only_linear_divergence\n)\n{\n\ttimestepping_order = i_order;\n\tuse_only_linear_divergence = i_use_only_linear_divergence;\n}\n\n\nSWE_Plane_TS_ln_erk::SWE_Plane_TS_ln_erk(\n\t\tSimulationVariables &i_simVars,\n\t\tPlaneOperators &i_op\n)\t:\n\t\tsimVars(i_simVars),\n\t\top(i_op)\n{\n\tsetup(simVars.disc.timestepping_order, false);\n}\n\n\n\nSWE_Plane_TS_ln_erk::~SWE_Plane_TS_ln_erk()\n{\n}\n\n<commit_msg>removed fatalerror which is caught at a better place<commit_after>\/*\n * SWE_Plane_TS_ln_erk.cpp\n *\n * Created on: 29 May 2017\n * Author: Martin Schreiber <SchreiberX@gmail.com>\n *\n * Changelog:\n *\n * \t2017-07-13: Updated and validated by P. Peixoto.\n * \t2017-05-29: Based on source swe_plane.cpp\n *\t\t\t\t\twhich was also written by Pedro Peixoto\n *\/\n\n#include \"..\/swe_plane\/SWE_Plane_TS_ln_erk.hpp\"\n\n\n\/*\n * Main routine for method to be used in case of finite differences\n *\n * - A-Grid with spectral or FD spatial discretizations\n * - C-Grid with energy conserving FD scheme for spatial discretizations\n *\n *\/\nvoid SWE_Plane_TS_ln_erk::euler_timestep_update(\n\t\tconst PlaneData &i_h,\t\/\/\/< prognostic variables (perturbed part of height)\n\t\tconst PlaneData &i_u,\t\/\/\/< prognostic variables\n\t\tconst PlaneData &i_v,\t\/\/\/< prognostic variables\n\n\t\tPlaneData &o_h_t,\t\/\/\/< time updates\n\t\tPlaneData &o_u_t,\t\/\/\/< time updates\n\t\tPlaneData &o_v_t,\t\/\/\/< time updates\n\n\t\tdouble i_simulation_timestamp\n)\n{\n\t\/\/ A-grid method\n\tif (!simVars.disc.space_grid_use_c_staggering)\n\t{\n\t\t\/*\n\t\t * non-conservative (advective) formulation:\n\t\t *\n\t\t *\th_t = -(u*h)_x - (v*h)_y\n\t\t *\tu_t = -g * h_x - u * u_x - v * u_y + f*v\n\t\t *\tv_t = -g * h_y - u * v_x - v * v_y - f*u\n\t\t *\/\n\n\t\tPlaneData total_h = i_h + simVars.sim.h0;\n\n\t\to_u_t = -simVars.sim.gravitation*op.diff_c_x(total_h) - i_u*op.diff_c_x(i_u) - i_v*op.diff_c_y(i_u);\n\t\to_v_t = -simVars.sim.gravitation*op.diff_c_y(total_h) - i_u*op.diff_c_x(i_v) - i_v*op.diff_c_y(i_v);\n\n\t\to_u_t += simVars.sim.plane_rotating_f0*i_v;\n\t\to_v_t -= simVars.sim.plane_rotating_f0*i_u;\n\n\t\t\/\/ standard update\n\t\t\/*\n\t\t * P UPDATE\n\t\t *\/\n\t\tif (!use_only_linear_divergence){ \/\/full nonlinear divergence\n\t\t\t\/\/ standard update\n\t\t\t\/\/o_h_t = -op.diff_f_x(U) - op.diff_f_y(V);\n\t\t\to_h_t = -op.diff_c_x(i_u*total_h) - op.diff_c_y(i_v*total_h);\n\t\t}\n\t\telse \/\/ use linear divergence\n\t\t{\n\t\t\t\/\/o_h_t = -op.diff_f_x(simVars.sim.h0*i_u) - op.diff_f_y(simVars.sim.h0*i_v);\n\t\t\to_h_t = -i_u*op.diff_c_x(total_h) - i_v*op.diff_c_y(total_h) + \/\/nonlinear adv\n\t\t\t\t\t-op.diff_c_x(i_u*simVars.sim.h0) - op.diff_c_y(i_v*simVars.sim.h0); \/\/linear div\n\t\t}\n\n\t}\n\telse \/\/ simVars.disc.use_staggering = true\n\t{\n\t\t\/\/ STAGGERED GRID\n\n\t\tPlaneData U(i_h.planeDataConfig); \/\/ U flux\n\t\tPlaneData V(i_h.planeDataConfig); \/\/ V flux\n\t\tPlaneData H(i_h.planeDataConfig); \/\/Bernoulli potential\n\t\tPlaneData total_h = i_h + simVars.sim.h0;\n\n\t\t\/*\n\t\t * Sadourny energy conserving scheme\n\t\t *\n\t\t * Note, that this grid does not follow the formulation\n\t\t * in the paper of Robert Sadourny, but looks as follows:\n\t\t *\n\t\t * ^\n\t\t * |\n\t\t * ______v0,1_____\n\t\t * | |\n\t\t * |\t\t\t |\n\t\t * | |\n\t\t * u0,0 |-> H\/P0,0 |u1,0 ->\n\t\t *(0,0.5)|\t\t\t |\n\t\t * | ^ |\n\t\t * q0,0|______|______|\n\t\t * (0,0) v0,0\n\t\t * (0.5,0)\n\t\t *\n\t\t * V_t + q N x (P V) + grad( g P + 1\/2 V*V) = 0\n\t\t * P_t + div(P V) = 0\n\t\t *\/\n\t\t\/*\n\t\t * U and V updates\n\t\t *\/\n\n\n\t\tU = op.avg_b_x(total_h)*i_u;\n\t\tV = op.avg_b_y(total_h)*i_v;\n\n\n\t\tH = simVars.sim.gravitation*total_h + 0.5*(op.avg_f_x(i_u*i_u) + op.avg_f_y(i_v*i_v));\n\n\n\n\t\t\/\/ Potential vorticity\n\t\tPlaneData total_h_pv = total_h;\n\t\ttotal_h_pv = op.avg_b_x(op.avg_b_y(total_h));\n\n#if 0\n\t\tif (total_h_pv.reduce_min() < 0.00000001)\n\t\t{\n\t\t\tstd::cerr << \"Test case not adequate for vector invariant formulation. Null or negative water height\" << std::endl;\n\t\t\tstd::cerr << \"Min h_pv : \" << total_h_pv.reduce_min() << std::endl;\n\t\t\tstd::cerr << \"Min h_total: \" << total_h.reduce_min() << std::endl;\n\t\t\tstd::cerr << \"Min h_pert : \" << i_h.reduce_min() << std::endl;\n\t\t\tFatalError(\"SWE_Plane_TS_ln_erk: Methods unstable or inadequate for vector invariant swe\");;\n\t\t}\n#endif\n\n\t\tPlaneData q = (op.diff_b_x(i_v) - op.diff_b_y(i_u) + simVars.sim.plane_rotating_f0) \/ total_h_pv;\n\n\t\t\/\/ u, v tendencies\n\t\t\/\/ Energy conserving scheme\n\t\to_u_t = op.avg_f_y(q*op.avg_b_x(V)) - op.diff_b_x(H);\n\t\to_v_t = -op.avg_f_x(q*op.avg_b_y(U)) - op.diff_b_y(H);\n\n\n\t\t\/*\n\t\t * P UPDATE\n\t\t *\/\n\t\tif (!use_only_linear_divergence){ \/\/full nonlinear divergence\n\t\t\t\/\/ standard update\n\t\t\to_h_t = -op.diff_f_x(U) - op.diff_f_y(V);\n\t\t}\n\t\telse \/\/ use linear divergence\n\t\t{\n\t\t\to_h_t = -i_u*op.diff_f_x(total_h) - i_v*op.diff_f_y(total_h) + \/\/nonlinear adv\n\t\t\t\t\t-op.diff_f_x(i_u*simVars.sim.h0) - op.diff_f_y(i_v*simVars.sim.h0); \/\/linear div\n\t\t\t\/\/o_h_t = -op.diff_f_x(simVars.sim.h0*i_u) - op.diff_f_y(simVars.sim.h0*i_v);\n\t\t}\n\t}\n}\n\n\n\nvoid SWE_Plane_TS_ln_erk::run_timestep(\n\t\tPlaneData &io_h,\t\/\/\/< prognostic variables\n\t\tPlaneData &io_u,\t\/\/\/< prognostic variables\n\t\tPlaneData &io_v,\t\/\/\/< prognostic variables\n\n\t\tdouble i_dt,\t\t\/\/\/< if this value is not equal to 0, use this time step size instead of computing one\n\t\tdouble i_simulation_timestamp\n)\n{\n\tif (i_dt <= 0)\n\t\tFatalError(\"SWE_Plane_TS_ln_erk: Only constant time step size allowed\");\n\n\t\/\/ standard time stepping\n\ttimestepping_rk.run_timestep(\n\t\t\tthis,\n\t\t\t&SWE_Plane_TS_ln_erk::euler_timestep_update,\t\/\/\/< pointer to function to compute euler time step updates\n\t\t\tio_h, io_u, io_v,\n\t\t\ti_dt,\n\t\t\ttimestepping_order,\n\t\t\ti_simulation_timestamp\n\t\t);\n}\n\n\n\n\/*\n * Setup\n *\/\nvoid SWE_Plane_TS_ln_erk::setup(\n\t\tint i_order,\t\/\/\/< order of RK time stepping method\n\t\tbool i_use_only_linear_divergence\n)\n{\n\ttimestepping_order = i_order;\n\tuse_only_linear_divergence = i_use_only_linear_divergence;\n}\n\n\nSWE_Plane_TS_ln_erk::SWE_Plane_TS_ln_erk(\n\t\tSimulationVariables &i_simVars,\n\t\tPlaneOperators &i_op\n)\t:\n\t\tsimVars(i_simVars),\n\t\top(i_op)\n{\n\tsetup(simVars.disc.timestepping_order, false);\n}\n\n\n\nSWE_Plane_TS_ln_erk::~SWE_Plane_TS_ln_erk()\n{\n}\n\n<|endoftext|>"} {"text":"<commit_before>\/*\n* AscEmu Framework based on Arcemu MMORPG Server\n* Copyright (C) 2014-2016 AscEmu Team <http:\/\/www.ascemu.org>\n* Copyright (C) 2009-2012 ArcEmu Team <http:\/\/www.arcemu.org>\n* Copyright (C) 2008-2009 Sun++ Team <http:\/\/www.sunplusplus.info>\n*\n* This program is free software: you can redistribute it and\/or modify\n* it under the terms of the GNU General Public License as published by\n* the Free Software Foundation, either version 3 of the License, or\n* any later version.\n*\n* This program is distributed in the hope that it will be useful,\n* but WITHOUT ANY WARRANTY; without even the implied warranty of\n* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the\n* GNU General Public License for more details.\n*\n* You should have received a copy of the GNU General Public License\n* along with this program. If not, see <http:\/\/www.gnu.org\/licenses\/>.\n*\/\n\n#include \"Setup.h\"\n\nclass GossipScourgeGryphon : public GossipScript\n{\n public:\n void GossipHello(Object* pObject, Player* plr)\n {\n if (plr->HasQuest(12670) || plr->HasFinishedQuest(12670))\n {\n if (TaxiPath* path = sTaxiMgr.GetTaxiPath(pObject->GetEntry() == 29488 ? 1053 : 1054))\n plr->TaxiStart(path, 26308, 0);\n }\n }\n};\n\n#define CN_INITIATE_1 29519\n#define CN_INITIATE_2 29565\n#define CN_INITIATE_3 29567\n#define CN_INITIATE_4 29520\n\nclass AcherusSoulPrison : GameObjectAIScript\n{\n public:\n AcherusSoulPrison(GameObject* goinstance) : GameObjectAIScript(goinstance) {}\n static GameObjectAIScript* Create(GameObject* GO)\n {\n return new AcherusSoulPrison(GO);\n }\n\n void OnActivate(Player* pPlayer)\n {\n QuestLogEntry* en = pPlayer->GetQuestLogForEntry(12848);\n if(!en)\n return;\n\n float SSX = pPlayer->GetPositionX();\n float SSY = pPlayer->GetPositionY();\n float SSZ = pPlayer->GetPositionZ();\n\n Creature* pCreature = pPlayer->GetMapMgr()->GetInterface()->GetCreatureNearestCoords(SSX, SSY, SSZ);\n\n if(!pCreature || !pCreature->isAlive())\n return;\n\n if(pCreature->GetEntry() == CN_INITIATE_1 || pCreature->GetEntry() == CN_INITIATE_2 || pCreature->GetEntry() == CN_INITIATE_3 || pCreature->GetEntry() == CN_INITIATE_4)\n {\n pPlayer->SendChatMessage(CHAT_MSG_SAY, LANG_UNIVERSAL, \"I give you the key to your salvation\");\n pCreature->SetUInt64Value(UNIT_FIELD_FLAGS, 0);\n pCreature->GetAIInterface()->setNextTarget(pPlayer);\n pCreature->GetAIInterface()->AttackReaction(pPlayer, 1, 0);\n pCreature->SendChatMessage(CHAT_MSG_MONSTER_SAY, LANG_UNIVERSAL, \"You have committed a big mistake, demon\");\n\n if(en->GetMobCount(0) != 0)\n return;\n\n en->SetMobCount(0, 1);\n en->SendUpdateAddKill(0);\n en->UpdatePlayerFields();\n }\n\n }\n};\n\nclass QuestInServiceOfLichKing : public QuestScript\n{\n public:\n void OnQuestStart(Player* mTarget, QuestLogEntry* \/*qLogEntry*\/)\n {\n \/\/ Play first sound\n mTarget->PlaySound(14734);\n\n \/\/ Play second sound after 22.5 seconds\n sEventMgr.AddEvent(mTarget, &Player::PlaySound, (uint32)14735, EVENT_UNK, 22500, 1, EVENT_FLAG_DO_NOT_EXECUTE_IN_WORLD_CONTEXT);\n\n \/\/ Play third sound after 48.5 seconds\n sEventMgr.AddEvent(mTarget, &Player::PlaySound, (uint32)14736, EVENT_UNK, 48500, 1, EVENT_FLAG_DO_NOT_EXECUTE_IN_WORLD_CONTEXT);\n }\n};\n\n\/\/ QuestID for Praparation for the Battle\nenum QUEST_12842_ENUM\n{\n QUEST_PREPARATION = 12842,\n\n SPELL_RUNE_I = 53341, \/\/ Spell Rune of Cinderglacier\n SPELL_RUNE_II = 53343, \/\/ Spell Rune of Razorice\n SPELL_PREPERATION_FOR_BATTLE_CREDIT = 54586\n};\n\nbool PreparationForBattleEffect(uint32 effectIndex, Spell* pSpell)\n{\n Player* pCaster = pSpell->p_caster;\n if (pCaster == nullptr)\n return false;\n\n \/\/ Apply spell if caster has quest and still heven't completed it yet\n if (pCaster->HasQuest(QUEST_PREPARATION) && !pCaster->HasFinishedQuest(QUEST_PREPARATION))\n pCaster->CastSpell(pCaster, SPELL_PREPERATION_FOR_BATTLE_CREDIT, true);\n\n return true;\n}\n\nvoid SetupDeathKnight(ScriptMgr* mgr)\n{\n mgr->register_gossip_script(29488, new GossipScourgeGryphon);\n mgr->register_gossip_script(29501, new GossipScourgeGryphon);\n\n mgr->register_dummy_spell(SPELL_RUNE_I, &PreparationForBattleEffect);\n mgr->register_dummy_spell(SPELL_RUNE_II, &PreparationForBattleEffect);\n mgr->register_quest_script(12593, new QuestInServiceOfLichKing);\n\n \/\/ These gobs had already a script by Type (in gameobject_names Type = 1 = Button).\n mgr->register_gameobject_script(191588, &AcherusSoulPrison::Create);\n mgr->register_gameobject_script(191577, &AcherusSoulPrison::Create);\n mgr->register_gameobject_script(191580, &AcherusSoulPrison::Create);\n mgr->register_gameobject_script(191581, &AcherusSoulPrison::Create);\n mgr->register_gameobject_script(191582, &AcherusSoulPrison::Create);\n mgr->register_gameobject_script(191583, &AcherusSoulPrison::Create);\n mgr->register_gameobject_script(191584, &AcherusSoulPrison::Create);\n mgr->register_gameobject_script(191585, &AcherusSoulPrison::Create);\n mgr->register_gameobject_script(191586, &AcherusSoulPrison::Create);\n mgr->register_gameobject_script(191587, &AcherusSoulPrison::Create);\n mgr->register_gameobject_script(191589, &AcherusSoulPrison::Create);\n mgr->register_gameobject_script(191590, &AcherusSoulPrison::Create);\n\n}\n<commit_msg>Style changes for Quest_DeathKnight.cpp<commit_after>\/*\n* AscEmu Framework based on Arcemu MMORPG Server\n* Copyright (C) 2014-2016 AscEmu Team <http:\/\/www.ascemu.org>\n* Copyright (C) 2009-2012 ArcEmu Team <http:\/\/www.arcemu.org>\n* Copyright (C) 2008-2009 Sun++ Team <http:\/\/www.sunplusplus.info>\n*\n* This program is free software: you can redistribute it and\/or modify\n* it under the terms of the GNU General Public License as published by\n* the Free Software Foundation, either version 3 of the License, or\n* any later version.\n*\n* This program is distributed in the hope that it will be useful,\n* but WITHOUT ANY WARRANTY; without even the implied warranty of\n* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the\n* GNU General Public License for more details.\n*\n* You should have received a copy of the GNU General Public License\n* along with this program. If not, see <http:\/\/www.gnu.org\/licenses\/>.\n*\/\n\n#include \"Setup.h\"\n\nclass GossipScourgeGryphon : public GossipScript\n{\n public:\n\n void GossipHello(Object* pObject, Player* plr)\n {\n if (plr->HasQuest(12670) || plr->HasFinishedQuest(12670))\n {\n if (TaxiPath* path = sTaxiMgr.GetTaxiPath(pObject->GetEntry() == 29488 ? 1053 : 1054))\n plr->TaxiStart(path, 26308, 0);\n }\n }\n};\n\n#define CN_INITIATE_1 29519\n#define CN_INITIATE_2 29565\n#define CN_INITIATE_3 29567\n#define CN_INITIATE_4 29520\n\nclass AcherusSoulPrison : GameObjectAIScript\n{\n public:\n\n AcherusSoulPrison(GameObject* goinstance) : GameObjectAIScript(goinstance) {}\n static GameObjectAIScript* Create(GameObject* GO)\n {\n return new AcherusSoulPrison(GO);\n }\n\n void OnActivate(Player* pPlayer)\n {\n QuestLogEntry* en = pPlayer->GetQuestLogForEntry(12848);\n if (!en)\n return;\n\n float SSX = pPlayer->GetPositionX();\n float SSY = pPlayer->GetPositionY();\n float SSZ = pPlayer->GetPositionZ();\n\n Creature* pCreature = pPlayer->GetMapMgr()->GetInterface()->GetCreatureNearestCoords(SSX, SSY, SSZ);\n\n if (!pCreature || !pCreature->isAlive())\n return;\n\n if (pCreature->GetEntry() == CN_INITIATE_1 || pCreature->GetEntry() == CN_INITIATE_2 || pCreature->GetEntry() == CN_INITIATE_3 || pCreature->GetEntry() == CN_INITIATE_4)\n {\n pPlayer->SendChatMessage(CHAT_MSG_SAY, LANG_UNIVERSAL, \"I give you the key to your salvation\");\n pCreature->SetUInt64Value(UNIT_FIELD_FLAGS, 0);\n pCreature->GetAIInterface()->setNextTarget(pPlayer);\n pCreature->GetAIInterface()->AttackReaction(pPlayer, 1, 0);\n pCreature->SendChatMessage(CHAT_MSG_MONSTER_SAY, LANG_UNIVERSAL, \"You have committed a big mistake, demon\");\n\n if (en->GetMobCount(0) != 0)\n return;\n\n en->SetMobCount(0, 1);\n en->SendUpdateAddKill(0);\n en->UpdatePlayerFields();\n }\n\n }\n};\n\nclass QuestInServiceOfLichKing : public QuestScript\n{\n public:\n\n void OnQuestStart(Player* mTarget, QuestLogEntry* \/*qLogEntry*\/)\n {\n \/\/ Play first sound\n mTarget->PlaySound(14734);\n\n \/\/ Play second sound after 22.5 seconds\n sEventMgr.AddEvent(mTarget, &Player::PlaySound, (uint32)14735, EVENT_UNK, 22500, 1, EVENT_FLAG_DO_NOT_EXECUTE_IN_WORLD_CONTEXT);\n\n \/\/ Play third sound after 48.5 seconds\n sEventMgr.AddEvent(mTarget, &Player::PlaySound, (uint32)14736, EVENT_UNK, 48500, 1, EVENT_FLAG_DO_NOT_EXECUTE_IN_WORLD_CONTEXT);\n }\n};\n\n\/\/ QuestID for Praparation for the Battle\nenum QUEST_12842_ENUM\n{\n QUEST_PREPARATION = 12842,\n\n SPELL_RUNE_I = 53341, \/\/ Spell Rune of Cinderglacier\n SPELL_RUNE_II = 53343, \/\/ Spell Rune of Razorice\n SPELL_PREPERATION_FOR_BATTLE_CREDIT = 54586\n};\n\nbool PreparationForBattleEffect(uint32 effectIndex, Spell* pSpell)\n{\n Player* pCaster = pSpell->p_caster;\n if (pCaster == nullptr)\n return false;\n\n \/\/ Apply spell if caster has quest and still heven't completed it yet\n if (pCaster->HasQuest(QUEST_PREPARATION) && !pCaster->HasFinishedQuest(QUEST_PREPARATION))\n pCaster->CastSpell(pCaster, SPELL_PREPERATION_FOR_BATTLE_CREDIT, true);\n\n return true;\n}\n\nvoid SetupDeathKnight(ScriptMgr* mgr)\n{\n mgr->register_gossip_script(29488, new GossipScourgeGryphon);\n mgr->register_gossip_script(29501, new GossipScourgeGryphon);\n\n mgr->register_dummy_spell(SPELL_RUNE_I, &PreparationForBattleEffect);\n mgr->register_dummy_spell(SPELL_RUNE_II, &PreparationForBattleEffect);\n mgr->register_quest_script(12593, new QuestInServiceOfLichKing);\n\n mgr->register_gameobject_script(191588, &AcherusSoulPrison::Create);\n mgr->register_gameobject_script(191577, &AcherusSoulPrison::Create);\n mgr->register_gameobject_script(191580, &AcherusSoulPrison::Create);\n mgr->register_gameobject_script(191581, &AcherusSoulPrison::Create);\n mgr->register_gameobject_script(191582, &AcherusSoulPrison::Create);\n mgr->register_gameobject_script(191583, &AcherusSoulPrison::Create);\n mgr->register_gameobject_script(191584, &AcherusSoulPrison::Create);\n mgr->register_gameobject_script(191585, &AcherusSoulPrison::Create);\n mgr->register_gameobject_script(191586, &AcherusSoulPrison::Create);\n mgr->register_gameobject_script(191587, &AcherusSoulPrison::Create);\n mgr->register_gameobject_script(191589, &AcherusSoulPrison::Create);\n mgr->register_gameobject_script(191590, &AcherusSoulPrison::Create);\n}\n<|endoftext|>"} {"text":"<commit_before>\/\/ Copyright 2013-2015, Durachenko Aleksey V. <durachenko.aleksey@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#include \"qsesppselectionplot.h\"\n#include <QPainter>\n#include \"qseselection.h\"\n\n\nQseSppSelectionPlot::QseSppSelectionPlot(QObject *parent)\n : QseAbstractSppPlot(parent)\n{\n m_brush = Qt::blue;\n m_opacity = 0.5;\n m_selection = 0;\n}\n\nvoid QseSppSelectionPlot::setBrush(const QBrush &brush)\n{\n if (m_brush != brush)\n {\n m_brush = brush;\n setUpdateOnce(true);\n }\n}\n\nvoid QseSppSelectionPlot::setOpacity(qreal opacity)\n{\n if (m_opacity != opacity)\n {\n m_opacity = opacity;\n setUpdateOnce(true);\n }\n}\n\nvoid QseSppSelectionPlot::setSelection(QseSelection *selection)\n{\n if (m_selection)\n disconnect(m_selection, 0, this, 0);\n\n m_selection = selection;\n if (m_selection)\n {\n connect(m_selection, SIGNAL(selectionChanged()),\n this, SLOT(setUpdateOnce()));\n connect(m_selection, SIGNAL(destroyed(QObject*)),\n this, SLOT(selection_destroyed(QObject*)));\n }\n\n setUpdateOnce(true);\n}\n\nbool QseSppSelectionPlot::hasChanges(const QRect &rect,\n const QseSppGeometry &geometry)\n{\n return (isUpdateOnce() || rect != lastRect() || geometry != lastGeometry());\n}\n\nbool QseSppSelectionPlot::isVisible(const QRect &rect,\n const QseSppGeometry &geometry)\n{\n if (m_selection == 0)\n return false;\n\n if (m_selection->isNull())\n return false;\n\n \/\/ TODO: fix algorithm, because it can cause the overflow\n int sl = QseSppGeometry::calcOffset(geometry,\n m_selection->selectedRange().first());\n int sr = QseSppGeometry::calcOffset(geometry,\n m_selection->selectedRange().last());\n\n if ((sl < 0 && sr < 0) || (sl >= rect.width() && sr >= rect.width()))\n return false;\n\n return true;\n}\n\nvoid QseSppSelectionPlot::draw(QPainter *painter, const QRect &rect,\n const QseSppGeometry &geometry)\n{\n if (isVisible(rect, geometry))\n {\n \/\/ TODO: fix algorithm, because it can cause the overflow\n int sl = QseSppGeometry::calcOffset(geometry,\n m_selection->selectedRange().first());\n int sr = QseSppGeometry::calcOffset(geometry,\n m_selection->selectedRange().last());\n\n if (sl < 0)\n sl = 0;\n if (sr >= rect.width())\n sr = rect.width()-1;\n\n painter->save();\n painter->setOpacity(m_opacity);\n painter->fillRect(sl, 0, sr-sl+1, rect.height(), m_brush);\n painter->restore();\n }\n\n QseAbstractSppPlot::draw(painter, rect, geometry);\n}\n\nvoid QseSppSelectionPlot::selection_destroyed(QObject *obj)\n{\n if (obj == m_selection)\n m_selection = 0;\n}\n<commit_msg>fix integer overflow possibility<commit_after>\/\/ Copyright 2013-2015, Durachenko Aleksey V. <durachenko.aleksey@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#include \"qsesppselectionplot.h\"\n#include <QPainter>\n#include \"qseselection.h\"\n\n\nQseSppSelectionPlot::QseSppSelectionPlot(QObject *parent)\n : QseAbstractSppPlot(parent)\n{\n m_brush = Qt::blue;\n m_opacity = 0.5;\n m_selection = 0;\n}\n\nvoid QseSppSelectionPlot::setBrush(const QBrush &brush)\n{\n if (m_brush != brush)\n {\n m_brush = brush;\n setUpdateOnce(true);\n }\n}\n\nvoid QseSppSelectionPlot::setOpacity(qreal opacity)\n{\n if (m_opacity != opacity)\n {\n m_opacity = opacity;\n setUpdateOnce(true);\n }\n}\n\nvoid QseSppSelectionPlot::setSelection(QseSelection *selection)\n{\n if (m_selection)\n disconnect(m_selection, 0, this, 0);\n\n m_selection = selection;\n if (m_selection)\n {\n connect(m_selection, SIGNAL(selectionChanged()),\n this, SLOT(setUpdateOnce()));\n connect(m_selection, SIGNAL(destroyed(QObject*)),\n this, SLOT(selection_destroyed(QObject*)));\n }\n\n setUpdateOnce(true);\n}\n\nbool QseSppSelectionPlot::hasChanges(const QRect &rect,\n const QseSppGeometry &geometry)\n{\n return (isUpdateOnce() || rect != lastRect() || geometry != lastGeometry());\n}\n\nbool QseSppSelectionPlot::isVisible(const QRect &rect,\n const QseSppGeometry &geometry)\n{\n if (m_selection == 0)\n return false;\n\n if (m_selection->isNull())\n return false;\n\n const qint64 firstVisibleSample = geometry.x();\n const qint64 lastVisibleSample = firstVisibleSample\n + QseSppGeometry::samplesFromWidth(geometry, rect.width());\n\n if (m_selection->selectedRange().first() >= lastVisibleSample)\n return false;\n\n if (m_selection->selectedRange().last() <= firstVisibleSample)\n return false;\n\n return true;\n}\n\nvoid QseSppSelectionPlot::draw(QPainter *painter, const QRect &rect,\n const QseSppGeometry &geometry)\n{\n if (isVisible(rect, geometry))\n {\n const qint64 firstVisibleSample = geometry.x();\n const qint64 lastVisibleSample =\n QseSppGeometry::calcSampleIndex(geometry, rect.width());\n\n int sl = 0;\n if (m_selection->selectedRange().first() > firstVisibleSample)\n sl = QseSppGeometry::calcOffset(geometry,\n m_selection->selectedRange().first());\n\n int sr = rect.width()-1;\n if (m_selection->selectedRange().last() <= lastVisibleSample)\n sr = QseSppGeometry::calcOffset(geometry,\n m_selection->selectedRange().last());\n\n painter->save();\n painter->setOpacity(m_opacity);\n painter->fillRect(sl, 0, sr-sl+1, rect.height(), m_brush);\n painter->restore();\n }\n\n QseAbstractSppPlot::draw(painter, rect, geometry);\n}\n\nvoid QseSppSelectionPlot::selection_destroyed(QObject *obj)\n{\n if (obj == m_selection)\n m_selection = 0;\n}\n<|endoftext|>"} {"text":"<commit_before>\r\n#include <iostream>\r\n#include <memory>\r\n#include <SDL.h>\r\n#include <images.h>\r\n#include <SOIL.h>\r\n#include <res_path.h>\r\n\r\nnamespace venk\r\n{\r\n\r\n std::shared_ptr<Image> image_load(const std::string& fileName)\r\n {\r\n\t\tauto image_deleter = [](Image *i) {\r\n\t\t\tif (i) {\r\n\t\t\t\tSOIL_free_image_data(i->pixels);\r\n\t\t\t\tdelete i;\r\n\t\t\t}\r\n\t\t};\r\n\t\tstd::shared_ptr<Image> img(new Image, image_deleter);\r\n\t\tSDL_RWops *rwops = SDL_RWFromFile(fileName.c_str(), \"rb\");\r\n\t\tif (rwops != nullptr) {\r\n\t\t\tSint64 size = SDL_RWsize(rwops);\r\n\t\t\tif (size != -1L) {\r\n\t\t\t\tvoid *buf = SDL_malloc(size);\r\n\t\t\t\tsize_t read = SDL_RWread(rwops, buf, 1, size);\r\n\t\t\t\tif (read == size) {\r\n\t\t\t\t\timg->pixels = SOIL_load_image_from_memory((const unsigned char*)buf, size, &img->width, &img->height, &img->channels, SOIL_LOAD_AUTO);\r\n\t\t\t\t\tif (img->pixels != nullptr) {\r\n\t\t\t\t\t\tSDL_RWclose(rwops);\r\n\t\t\t\t\t\treturn img;\r\n\t\t\t\t\t} else {\r\n\t\t\t\t\t\tstd::cerr << \"Creating \" << fileName << \" failed\" << std::endl;\r\n\t\t\t\t\t}\r\n\t\t\t\t} else {\r\n\t\t\t\t\tstd::cerr << \"Reading \" << fileName << \" failed\" << std::endl;\r\n\t\t\t\t}\r\n\t\t\t\tSDL_free(buf);\r\n\t\t\t} else {\r\n\t\t\t\tstd::cerr << \"Probing \" << fileName << \" failed\" << std::endl;\r\n\t\t\t}\r\n\t\t} else {\r\n\t\t\tstd::cerr << \"Opening \" << fileName << \" failed\" << std::endl;\r\n\t\t}\r\n\t\tSDL_RWclose(rwops);\r\n\t\treturn nullptr;\r\n }\r\n\r\n std::shared_ptr<SDL_Surface> surface_from_image(std::shared_ptr<Image> img)\r\n {\r\n\r\n#if SDL_BYTEORDER == SDL_BIG_ENDIAN\r\n\t\tUint32 rmask = 0xff000000;\r\n\t\tUint32 gmask = 0x00ff0000;\r\n\t\tUint32 bmask = 0x0000ff00;\r\n\t\tUint32 amask = 0x000000ff;\r\n#else\r\n\t\tUint32 rmask = 0x000000ff;\r\n\t\tUint32 gmask = 0x0000ff00;\r\n\t\tUint32 bmask = 0x00ff0000;\r\n\t\tUint32 amask = 0xff000000;\r\n#endif\r\n\r\n\t\tauto surface_deleter = [](SDL_Surface* s) {\r\n\t\t\tif(s) SDL_FreeSurface(s);\r\n\t\t};\r\n\t\tstd::shared_ptr<SDL_Surface> result(SDL_CreateRGBSurfaceFrom(img->pixels, img->width, img->height, img->channels * 8, img->width * img->channels, rmask, gmask, bmask, amask ),\r\n\t\t\t\t\t\t\t\t\t\t\tsurface_deleter);\r\n\t\tSDL_SetSurfaceBlendMode(result.get(), SDL_BLENDMODE_NONE);\r\n\t\treturn result;\r\n }\r\n\r\n}\r\n<commit_msg>Begining of font wrapper class.<commit_after>\r\n#include <iostream>\r\n#include <memory>\r\n#include <SDL.h>\r\n#include <SOIL.h>\r\n#include <images.h>\r\n#include <res_path.h>\r\n\r\nnamespace venk\r\n{\r\n\r\n std::shared_ptr<Image> image_load(const std::string& fileName)\r\n {\r\n\t\tauto image_deleter = [](Image *i) {\r\n\t\t\tif (i) {\r\n\t\t\t\tSOIL_free_image_data(i->pixels);\r\n\t\t\t\tdelete i;\r\n\t\t\t}\r\n\t\t};\r\n\t\tstd::shared_ptr<Image> img(new Image, image_deleter);\r\n\t\tSDL_RWops *rwops = SDL_RWFromFile(fileName.c_str(), \"rb\");\r\n\t\tif (rwops != nullptr) {\r\n\t\t\tSint64 size = SDL_RWsize(rwops);\r\n\t\t\tif (size != -1L) {\r\n\t\t\t\tvoid *buf = SDL_malloc(size);\r\n\t\t\t\tsize_t read = SDL_RWread(rwops, buf, 1, size);\r\n\t\t\t\tif (read == size) {\r\n\t\t\t\t\timg->pixels = SOIL_load_image_from_memory((const unsigned char*)buf, size, &img->width, &img->height, &img->channels, SOIL_LOAD_AUTO);\r\n\t\t\t\t\tif (img->pixels != nullptr) {\r\n\t\t\t\t\t\tSDL_RWclose(rwops);\r\n\t\t\t\t\t\treturn img;\r\n\t\t\t\t\t} else {\r\n\t\t\t\t\t\tstd::cerr << \"Creating \" << fileName << \" failed\" << std::endl;\r\n\t\t\t\t\t}\r\n\t\t\t\t} else {\r\n\t\t\t\t\tstd::cerr << \"Reading \" << fileName << \" failed\" << std::endl;\r\n\t\t\t\t}\r\n\t\t\t\tSDL_free(buf);\r\n\t\t\t} else {\r\n\t\t\t\tstd::cerr << \"Probing \" << fileName << \" failed\" << std::endl;\r\n\t\t\t}\r\n\t\t} else {\r\n\t\t\tstd::cerr << \"Opening \" << fileName << \" failed\" << std::endl;\r\n\t\t}\r\n\t\tSDL_RWclose(rwops);\r\n\t\treturn nullptr;\r\n }\r\n\r\n std::shared_ptr<SDL_Surface> surface_from_image(std::shared_ptr<Image> img)\r\n {\r\n\r\n#if SDL_BYTEORDER == SDL_BIG_ENDIAN\r\n\t\tUint32 rmask = 0xff000000;\r\n\t\tUint32 gmask = 0x00ff0000;\r\n\t\tUint32 bmask = 0x0000ff00;\r\n\t\tUint32 amask = 0x000000ff;\r\n#else\r\n\t\tUint32 rmask = 0x000000ff;\r\n\t\tUint32 gmask = 0x0000ff00;\r\n\t\tUint32 bmask = 0x00ff0000;\r\n\t\tUint32 amask = 0xff000000;\r\n#endif\r\n\r\n\t\tauto surface_deleter = [](SDL_Surface* s) {\r\n\t\t\tif(s) SDL_FreeSurface(s);\r\n\t\t};\r\n\t\tstd::shared_ptr<SDL_Surface> result(SDL_CreateRGBSurfaceFrom(img->pixels, img->width, img->height, img->channels * 8, img->width * img->channels, rmask, gmask, bmask, amask ),\r\n\t\t\t\t\t\t\t\t\t\t\tsurface_deleter);\r\n\t\tSDL_SetSurfaceBlendMode(result.get(), SDL_BLENDMODE_NONE);\r\n\t\treturn result;\r\n }\r\n\r\n}\r\n<|endoftext|>"} {"text":"<commit_before>\/*************************************************************************\n *\n * OpenOffice.org - a multi-platform office productivity suite\n *\n * $RCSfile: groupproperties.hxx,v $\n *\n * $Revision: 1.5 $\n *\n * last change: $Author: ihi $ $Date: 2006-11-14 13:11: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#ifndef _SDR_PROPERTIES_GROUPPROPERTIES_HXX\n#define _SDR_PROPERTIES_GROUPPROPERTIES_HXX\n\n#ifndef _SDR_PROPERTIES_DEFAULTPROPERTIES_HXX\n#include <svx\/sdr\/properties\/defaultproperties.hxx>\n#endif\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nnamespace sdr\n{\n namespace properties\n {\n class GroupProperties : public DefaultProperties\n {\n protected:\n \/\/ create a new itemset\n virtual SfxItemSet& CreateObjectSpecificItemSet(SfxItemPool& rPool);\n\n \/\/ test changeability for a single item\n virtual sal_Bool AllowItemChange(const sal_uInt16 nWhich, const SfxPoolItem* pNewItem = 0) const;\n\n \/\/ Do the ItemChange, may do special handling\n virtual void ItemChange(const sal_uInt16 nWhich, const SfxPoolItem* pNewItem = 0);\n\n \/\/ Called after ItemChange() is done for all items.\n virtual void PostItemChange(const sal_uInt16 nWhich);\n\n \/\/ react on ItemSet changes\n virtual void ItemSetChanged(const SfxItemSet& rSet);\n\n public:\n \/\/ basic constructor\n GroupProperties(SdrObject& rObj);\n\n \/\/ copy constructor\n GroupProperties(const GroupProperties& rProps, SdrObject& rObj);\n\n \/\/ destructor\n virtual ~GroupProperties();\n\n \/\/ Clone() operator, normally just calls the local copy constructor\n virtual BaseProperties& Clone(SdrObject& rObj) const;\n\n \/\/ get itemset\n virtual const SfxItemSet& GetObjectItemSet() const;\n\n \/\/ get merged ItemSet. Normally, this maps directly to GetObjectItemSet(), but may\n \/\/ be overloaded e.g for group objects to return a merged ItemSet of the object.\n \/\/ When using this method the returned ItemSet may contain items in the state\n \/\/ SFX_ITEM_DONTCARE which means there were several such items with different\n \/\/ values.\n virtual const SfxItemSet& GetMergedItemSet() const;\n\n \/\/ Set merged ItemSet. Normally, this maps to SetObjectItemSet().\n virtual void SetMergedItemSet(const SfxItemSet& rSet, sal_Bool bClearAllItems = sal_False);\n\n \/\/ set single item\n virtual void SetObjectItem(const SfxPoolItem& rItem);\n\n \/\/ set single item direct, do not do any notifies or things like that\n virtual void SetObjectItemDirect(const SfxPoolItem& rItem);\n\n \/\/ clear single item\n virtual void ClearObjectItem(const sal_uInt16 nWhich = 0);\n\n \/\/ clear single item direct, do not do any notifies or things like that.\n \/\/ Also supports complete deleteion of items when default parameter 0 is used.\n virtual void ClearObjectItemDirect(const sal_uInt16 nWhich = 0);\n\n \/\/ Set a single item, iterate over hierarchies if necessary.\n virtual void SetMergedItem(const SfxPoolItem& rItem);\n\n \/\/ Clear a single item, iterate over hierarchies if necessary.\n virtual void ClearMergedItem(const sal_uInt16 nWhich = 0);\n\n \/\/ set complete item set\n virtual void SetObjectItemSet(const SfxItemSet& rSet);\n\n \/\/ set a new StyleSheet\n virtual void SetStyleSheet(SfxStyleSheet* pNewStyleSheet, sal_Bool bDontRemoveHardAttr);\n\n \/\/ get the local StyleSheet\n virtual SfxStyleSheet* GetStyleSheet() const;\n\n \/\/ force default attributes for a specific object type, called from\n \/\/ DefaultProperties::GetObjectItemSet() if a new ItemSet is created\n virtual void ForceDefaultAttributes();\n\n \/\/ Move properties to a new ItemPool.\n virtual void MoveToItemPool(SfxItemPool* pSrcPool, SfxItemPool* pDestPool, SdrModel* pNewModel = 0L);\n\n \/\/ force all attributes which come from styles to hard attributes\n \/\/ to be able to live without the style.\n virtual void ForceStyleToHardAttributes(sal_Bool bPseudoSheetsOnly = sal_False);\n };\n } \/\/ end of namespace properties\n} \/\/ end of namespace sdr\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n#endif \/\/_SDR_PROPERTIES_GROUPPROPERTIES_HXX\n\n\/\/ eof\n<commit_msg>INTEGRATION: CWS aw036 (1.4.594); FILE MERGED 2006\/10\/26 15:57:01 aw 1.4.594.1: #i61284#: BurnInStyleSheetAttributes for text corrected; #i70852#: Set\/GetLayer cleanup and implementation for FmFormObj<commit_after>\/*************************************************************************\n *\n * OpenOffice.org - a multi-platform office productivity suite\n *\n * $RCSfile: groupproperties.hxx,v $\n *\n * $Revision: 1.6 $\n *\n * last change: $Author: vg $ $Date: 2006-11-21 16:43:17 $\n *\n * The Contents of this file are made available subject to\n * the terms of GNU Lesser General Public License Version 2.1.\n *\n *\n * GNU Lesser General Public License Version 2.1\n * =============================================\n * Copyright 2005 by Sun Microsystems, Inc.\n * 901 San Antonio Road, Palo Alto, CA 94303, USA\n *\n * This library is free software; you can redistribute it and\/or\n * modify it under the terms of the GNU Lesser General Public\n * License version 2.1, as published by the Free Software Foundation.\n *\n * This library is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU\n * Lesser General Public License for more details.\n *\n * You should have received a copy of the GNU Lesser General Public\n * License along with this library; if not, write to the Free Software\n * Foundation, Inc., 59 Temple Place, Suite 330, Boston,\n * MA 02111-1307 USA\n *\n ************************************************************************\/\n\n#ifndef _SDR_PROPERTIES_GROUPPROPERTIES_HXX\n#define _SDR_PROPERTIES_GROUPPROPERTIES_HXX\n\n#ifndef _SDR_PROPERTIES_DEFAULTPROPERTIES_HXX\n#include <svx\/sdr\/properties\/defaultproperties.hxx>\n#endif\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nnamespace sdr\n{\n namespace properties\n {\n class GroupProperties : public DefaultProperties\n {\n protected:\n \/\/ create a new itemset\n virtual SfxItemSet& CreateObjectSpecificItemSet(SfxItemPool& rPool);\n\n \/\/ test changeability for a single item\n virtual sal_Bool AllowItemChange(const sal_uInt16 nWhich, const SfxPoolItem* pNewItem = 0) const;\n\n \/\/ Do the ItemChange, may do special handling\n virtual void ItemChange(const sal_uInt16 nWhich, const SfxPoolItem* pNewItem = 0);\n\n \/\/ Called after ItemChange() is done for all items.\n virtual void PostItemChange(const sal_uInt16 nWhich);\n\n \/\/ react on ItemSet changes\n virtual void ItemSetChanged(const SfxItemSet& rSet);\n\n public:\n \/\/ basic constructor\n GroupProperties(SdrObject& rObj);\n\n \/\/ copy constructor\n GroupProperties(const GroupProperties& rProps, SdrObject& rObj);\n\n \/\/ destructor\n virtual ~GroupProperties();\n\n \/\/ Clone() operator, normally just calls the local copy constructor\n virtual BaseProperties& Clone(SdrObject& rObj) const;\n\n \/\/ get itemset\n virtual const SfxItemSet& GetObjectItemSet() const;\n\n \/\/ get merged ItemSet. Normally, this maps directly to GetObjectItemSet(), but may\n \/\/ be overloaded e.g for group objects to return a merged ItemSet of the object.\n \/\/ When using this method the returned ItemSet may contain items in the state\n \/\/ SFX_ITEM_DONTCARE which means there were several such items with different\n \/\/ values.\n virtual const SfxItemSet& GetMergedItemSet() const;\n\n \/\/ Set merged ItemSet. Normally, this maps to SetObjectItemSet().\n virtual void SetMergedItemSet(const SfxItemSet& rSet, sal_Bool bClearAllItems = sal_False);\n\n \/\/ set single item\n virtual void SetObjectItem(const SfxPoolItem& rItem);\n\n \/\/ set single item direct, do not do any notifies or things like that\n virtual void SetObjectItemDirect(const SfxPoolItem& rItem);\n\n \/\/ clear single item\n virtual void ClearObjectItem(const sal_uInt16 nWhich = 0);\n\n \/\/ clear single item direct, do not do any notifies or things like that.\n \/\/ Also supports complete deleteion of items when default parameter 0 is used.\n virtual void ClearObjectItemDirect(const sal_uInt16 nWhich = 0);\n\n \/\/ Set a single item, iterate over hierarchies if necessary.\n virtual void SetMergedItem(const SfxPoolItem& rItem);\n\n \/\/ Clear a single item, iterate over hierarchies if necessary.\n virtual void ClearMergedItem(const sal_uInt16 nWhich = 0);\n\n \/\/ set complete item set\n virtual void SetObjectItemSet(const SfxItemSet& rSet);\n\n \/\/ set a new StyleSheet\n virtual void SetStyleSheet(SfxStyleSheet* pNewStyleSheet, sal_Bool bDontRemoveHardAttr);\n\n \/\/ get the local StyleSheet\n virtual SfxStyleSheet* GetStyleSheet() const;\n\n \/\/ force default attributes for a specific object type, called from\n \/\/ DefaultProperties::GetObjectItemSet() if a new ItemSet is created\n virtual void ForceDefaultAttributes();\n\n \/\/ Move properties to a new ItemPool.\n virtual void MoveToItemPool(SfxItemPool* pSrcPool, SfxItemPool* pDestPool, SdrModel* pNewModel = 0L);\n\n \/\/ force all attributes which come from styles to hard attributes\n \/\/ to be able to live without the style.\n virtual void ForceStyleToHardAttributes();\n };\n } \/\/ end of namespace properties\n} \/\/ end of namespace sdr\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n#endif \/\/_SDR_PROPERTIES_GROUPPROPERTIES_HXX\n\n\/\/ eof\n<|endoftext|>"} {"text":"<commit_before>\/*\n * Copyright (C) 2016 Nagisa Sekiguchi\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n *\/\n\n#include <cstring>\n#include <fstream>\n\n#include \"misc\/size.hpp\"\n#include \"logger.h\"\n\nnamespace fuzzyrat {\n\nstatic const char *levelStrTable[] = {\n#define GEN_STR(E) #E,\n EACH_LOG_LEVEL(GEN_STR)\n#undef GEN_STR\n};\n\nstatic LogLevel parseLevel(const char *str, LogLevel defaultLevel) {\n if(str != nullptr) {\n unsigned int index = 0;\n for(; index < ydsh::arraySize(levelStrTable); index++) {\n if(strcasecmp(str, levelStrTable[index]) == 0) {\n return static_cast<LogLevel>(index);\n }\n }\n }\n return defaultLevel;\n}\n\nstd::ostream &operator<<(std::ostream &stream, LogLevel level) {\n return stream << \"[\" << levelStrTable[static_cast<unsigned int>(level)] << \"]\";\n}\n\n\/\/ ####################\n\/\/ ## Logger ##\n\/\/ ####################\n\nLogger::Logger() : stream_(nullptr), level_(LogLevel::info) {\n \/\/ init appender\n const char *appender = getenv(\"FRAT_APPENDER\");\n if(appender != nullptr) {\n std::ostream *os = new std::ofstream(appender);\n if(!(*os)) {\n delete os;\n os = nullptr;\n }\n this->stream_ = os;\n }\n if(this->stream_ == nullptr) {\n this->stream_ = &std::cerr;\n }\n\n \/\/ log level\n this->level_ = parseLevel(getenv(\"FRAT_LEVEL\"), LogLevel::info);\n}\n\nLogger::~Logger() {\n if(this->stream_ != &std::cerr) {\n delete this->stream_;\n }\n}\n\nLogger &Logger::instance() {\n static Logger logger;\n return logger;\n}\n\n} \/\/ namespace fuzzyrat<commit_msg>fix default log level<commit_after>\/*\n * Copyright (C) 2016 Nagisa Sekiguchi\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n *\/\n\n#include <cstring>\n#include <fstream>\n\n#include \"misc\/size.hpp\"\n#include \"logger.h\"\n\nnamespace fuzzyrat {\n\nstatic const char *levelStrTable[] = {\n#define GEN_STR(E) #E,\n EACH_LOG_LEVEL(GEN_STR)\n#undef GEN_STR\n};\n\nstatic LogLevel parseLevel(const char *str, LogLevel defaultLevel) {\n if(str != nullptr) {\n unsigned int index = 0;\n for(; index < ydsh::arraySize(levelStrTable); index++) {\n if(strcasecmp(str, levelStrTable[index]) == 0) {\n return static_cast<LogLevel>(index);\n }\n }\n }\n return defaultLevel;\n}\n\nstd::ostream &operator<<(std::ostream &stream, LogLevel level) {\n return stream << \"[\" << levelStrTable[static_cast<unsigned int>(level)] << \"]\";\n}\n\n\/\/ ####################\n\/\/ ## Logger ##\n\/\/ ####################\n\nLogger::Logger() : stream_(nullptr), level_(LogLevel::info) {\n \/\/ init appender\n const char *appender = getenv(\"FRAT_APPENDER\");\n if(appender != nullptr) {\n std::ostream *os = new std::ofstream(appender);\n if(!(*os)) {\n delete os;\n os = nullptr;\n }\n this->stream_ = os;\n }\n if(this->stream_ == nullptr) {\n this->stream_ = &std::cerr;\n }\n\n \/\/ log level\n this->level_ = parseLevel(getenv(\"FRAT_LEVEL\"), LogLevel::error);\n}\n\nLogger::~Logger() {\n if(this->stream_ != &std::cerr) {\n delete this->stream_;\n }\n}\n\nLogger &Logger::instance() {\n static Logger logger;\n return logger;\n}\n\n} \/\/ namespace fuzzyrat<|endoftext|>"} {"text":"<commit_before>\/*\nCopyright (c) 2016 Carl Sherrell\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 \"mlutil.h\"\n#include <sys\/stat.h>\n#include <dirent.h>\n\nnamespace puml {\n\nconst ml_string &TREE_MODEL_FILE_PREFIX = \"tree\";\n \nbool prepareDirectoryForModelSave(const ml_string &path_to_dir, \n\t\t\t\t bool overwrite_existing) {\n \n if((path_to_dir == \".\") || (path_to_dir == \"..\")) {\n return(false);\n }\n \n \/\/ clear the directory if it already exists and we are allowed to overwrite.\n struct stat info;\n if((stat(path_to_dir.c_str(), &info) == 0) && (info.st_mode & S_IFDIR)) {\n \n if(!overwrite_existing) {\n log_error(\"directory exists and we aren't allowed to overwrite\\n\");\n return(false);\n }\n \n ml_string rm_cmd = ml_string(\"rm -f \") + path_to_dir + \"\/*.json\";\n if(system(rm_cmd.c_str())){\n log_error(\"couldn't clear model files from directory: %s\\n\", path_to_dir.c_str());\n return(false);\n }\n }\n else {\n \/\/ the directory doesn't exist so we will create it.\n if(mkdir(path_to_dir.c_str(), 0755)) {\n log_error(\"couldn't create model save directory: %s\\n\", path_to_dir.c_str());\n perror(\"ERROR --> mkdir\");\n return(false);\n }\n }\n \n return(true);\n}\n \n \nbool readDecisionTreesFromDirectory(const ml_string &path_to_dir,\n\t\t\t\t ml_vector<dt_tree> &trees) { \n trees.clear();\n \n DIR *d = 0;\n struct dirent *dir = 0;\n d = opendir(path_to_dir.c_str());\n if(!d) {\n return(false);\n }\n \n while((dir = readdir(d)) != NULL) {\n ml_string file_name(dir->d_name);\n if(file_name.compare(0, TREE_MODEL_FILE_PREFIX.length(), \n\t\t\t TREE_MODEL_FILE_PREFIX) != 0) {\n continue;\n }\n \n ml_string full_path = path_to_dir + \"\/\" + dir->d_name;\n dt_tree tree = {};\n if(!readDecisionTreeFromFile(full_path, tree)) {\n log_error(\"failed to parse tree from json: %s\\n\", full_path.c_str());\n return(false);\n }\n \n trees.push_back(tree);\n }\n \n closedir(d);\n \n return(true);\n}\n\n} \/\/ namespace puml\n<commit_msg>mv the previous model save directory instead of removing files<commit_after>\/*\nCopyright (c) 2016 Carl Sherrell\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 \"mlutil.h\"\n#include <sstream>\n#include <sys\/stat.h>\n#include <dirent.h>\n\nnamespace puml {\n\nconst ml_string &TREE_MODEL_FILE_PREFIX = \"tree\";\n \nbool prepareDirectoryForModelSave(const ml_string &path_to_dir, \n\t\t\t\t bool overwrite_existing) {\n \n if((path_to_dir == \".\") || (path_to_dir == \"..\")) {\n return(false);\n }\n \n \/\/ move the directory if it already exists and we are allowed to overwrite.\n struct stat info;\n if((stat(path_to_dir.c_str(), &info) == 0) && (info.st_mode & S_IFDIR)) {\n \n if(!overwrite_existing) {\n log_error(\"directory exists and we aren't allowed to overwrite\\n\");\n return(false);\n }\n\n std::time_t timestamp = std::time(0); \n std::ostringstream ss;\n ss << \"mv \" << path_to_dir << \" \" << path_to_dir << \".\" << timestamp;\n if(system(ss.str().c_str())){\n log_error(\"couldn't replace previous model directory: %s\\n\", path_to_dir.c_str());\n return(false);\n }\n }\n\n \/\/ create the model save directory \n if(mkdir(path_to_dir.c_str(), 0755)) {\n log_error(\"couldn't create model save directory: %s\\n\", path_to_dir.c_str());\n perror(\"ERROR --> mkdir\");\n return(false);\n }\n \n \n return(true);\n}\n \n \nbool readDecisionTreesFromDirectory(const ml_string &path_to_dir,\n\t\t\t\t ml_vector<dt_tree> &trees) { \n trees.clear();\n \n DIR *d = 0;\n struct dirent *dir = 0;\n d = opendir(path_to_dir.c_str());\n if(!d) {\n return(false);\n }\n \n while((dir = readdir(d)) != NULL) {\n ml_string file_name(dir->d_name);\n if(file_name.compare(0, TREE_MODEL_FILE_PREFIX.length(), \n\t\t\t TREE_MODEL_FILE_PREFIX) != 0) {\n continue;\n }\n \n ml_string full_path = path_to_dir + \"\/\" + dir->d_name;\n dt_tree tree = {};\n if(!readDecisionTreeFromFile(full_path, tree)) {\n log_error(\"failed to parse tree from json: %s\\n\", full_path.c_str());\n return(false);\n }\n \n trees.push_back(tree);\n }\n \n closedir(d);\n \n return(true);\n}\n\n} \/\/ namespace puml\n<|endoftext|>"} {"text":"<commit_before>\/*!\n * mixed_initiative_teleop_node.cpp\n * Copyright (c) 2014, Manolis Chiou\n * All rights reserved.\n *\n *\n * Redistribution and use in source and binary forms, with or without\n * modification, are permitted provided that the following conditions are met:\n *\n * * Redistributions of source code must retain the above copyright\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 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\n\/*!\n\n@mainpage\n Joystick teleoperation node for use within the mixed initiative framework. The user can operate the robot in\n teleoperation mode and change on the fly autonomy level\/mode. Also a stop button is implimented.\n It was ment to be used with an Xbox 360 joystick but should work with any joystick.\n<hr>\n\n@section usage Usage\n@par\n@verbatim\n$ mixed_initiative_teleop\n@endverbatim\n\n<hr>\n@section topic ROS topics\n\nPublishes to (name \/ type):\n-@b \/teleop\/cmd_vel: will publish to \/teleop\/cmd_vel a geometry_msgs\/Twist.msg type message to drrobot_player.\n For differential robots, linear.x is forward\/backward speed (m\/sec), and angular.z (rad\/sec)is the angular speed.\n<hr>\n*\/\n\n\n#include \"sensor_msgs\/JointState.h\"\n#include \"trajectory_msgs\/JointTrajectory.h\"\n#include \"control_msgs\/JointTrajectoryControllerState.h\"\n#include <ros\/ros.h>\n#include <sensor_msgs\/Joy.h>\n#include <geometry_msgs\/Twist.h>\n#include <ros\/console.h>\n\n#include <std_msgs\/Int8.h>\n#include <std_msgs\/Bool.h>\n\nclass JoystickTeleop\n{\n\npublic:\n JoystickTeleop();\n\nprivate:\n void joyCallback(const sensor_msgs::Joy::ConstPtr& joy);\n void flipper_joint_statesCallback(const control_msgs::JointTrajectoryControllerState::ConstPtr &msg);\n\n ros::NodeHandle nh_;\n\n int linear_axis_, angular_axis_, control_button_, stop_button_, auto_button_, teleop_button_, enable_vel_button_, lighton_button_, lightoff_button_, bluelighton_button_, bluelightoff_button_;\n int axis_flipper_, button_flipper_front_down_, button_flipper_front_up_, button_flipper_rear_down_, button_flipper_rear_up_;\n double linear_scaling_, angular_scaling_, scale_flipper_, scale_flipper_rear_, scale_flipper_front_;\n\n std::vector<std::string> flipper_joint_names_;\n trajectory_msgs::JointTrajectoryPoint current_flipper_joints_;\n\n\n ros::Publisher vel_pub_, mode_pub_, light_pub_, bluelight_pub_ , jointstate_pub_, flipper_joints_pub_;\n\n ros::Subscriber joy_sub_, flipper_joint_states_sub_;\n\n};\n\n\nJoystickTeleop::JoystickTeleop()\n{\n \/\/ Default movement axis\n nh_.param(\"axis_linear\", linear_axis_, 1);\n nh_.param(\"axis_angular\", angular_axis_, 0);\n\n \/\/ Default scaling parameters\n nh_.param(\"scale_angular\", angular_scaling_, 0.5);\n nh_.param(\"scale_linear\", linear_scaling_, 0.2);\n\n \/\/Default buttons for Xbox 360 joystick.\n nh_.param(\"teleop_button\", teleop_button_, 3); \/\/ Y button\n nh_.param(\"auto_button\", auto_button_, 0); \/\/ A button\n nh_.param(\"stop_button\", stop_button_, 4); \/\/ LB button\n nh_.param(\"enable_vel_button\", enable_vel_button_, 5); \/\/ RB button\n nh_.param(\"bluelightoff_button\", bluelightoff_button_, 1); \/\/ B button\n nh_.param(\"bluelighton_button\", bluelighton_button_, 2); \/\/ X button\n nh_.param(\"lightoff_button\", lightoff_button_, 7); \/\/ start button\n nh_.param(\"lighton_button\", lighton_button_, 6); \/\/ back\/select button\n\n \/\/ default buttons and axis for flippers\n nh_.param(\"axis_flipper\", axis_flipper_, 4);\n nh_.param(\"scale_flipper\", scale_flipper_, 0.6);\n nh_.param(\"button_flipper_front_down\", button_flipper_front_down_, 0); \/\/6,7;\n nh_.param(\"button_flipper_front_up\", button_flipper_front_up_, 1);\n nh_.param(\"button_flipper_rear_down\", button_flipper_rear_down_, 2);\n nh_.param(\"button_flipper_rear_up\", button_flipper_rear_up_, 3);\n nh_.param(\"scale_flipper_front\", scale_flipper_front_, 0.6);\n nh_.param(\"scale_flipper_rear\", scale_flipper_rear_, 0.6);\n\n\n vel_pub_ = nh_.advertise<geometry_msgs::Twist>(\"\/teleop\/cmd_vel\", 5);\n mode_pub_ = nh_.advertise<std_msgs::Int8>(\"\/control_mode\", 5);\n light_pub_ = nh_.advertise<std_msgs::Bool>(\"\/light\", 5);\n bluelight_pub_ = nh_.advertise<std_msgs::Bool>(\"\/bluelight\", 5);\n jointstate_pub_ = nh_.advertise<sensor_msgs::JointState>(\"jointstate_cmd\", 1);\n flipper_joints_pub_= nh_.advertise<trajectory_msgs::JointTrajectory>(\"\/\/flipper\/flipper_traj_controller\/command\", 1);\n\n joy_sub_ = nh_.subscribe<sensor_msgs::Joy>(\"joy\", 2, &JoystickTeleop::joyCallback, this);\n flipper_joint_states_sub_ = nh_.subscribe<control_msgs::JointTrajectoryControllerState>(\"\/flipper\/flipper_traj_controller\/state\", 1, &JoystickTeleop::flipper_joint_statesCallback, this);\n\n}\n\nvoid JoystickTeleop::joyCallback(const sensor_msgs::Joy::ConstPtr& joy)\n{\n geometry_msgs::Twist cmd_vel;\n std_msgs::Int8 mode;\n std_msgs::Bool bluelight, light;\n sensor_msgs::JointState jsm;\n trajectory_msgs::JointTrajectory flipper_traj;\n trajectory_msgs::JointTrajectoryPoint flipper_desired_joint_states;\n\n\n if (joy->buttons.size() > enable_vel_button_ && joy->buttons[enable_vel_button_])\n {\n\n\n \/\/ movement commands\n cmd_vel.linear.x = linear_scaling_ * joy->axes[linear_axis_];\n cmd_vel.angular.z = angular_scaling_ * joy->axes[angular_axis_];\n\n vel_pub_.publish(cmd_vel);\n }\n\n else\n {\n cmd_vel.linear.x = 0;\n cmd_vel.angular.z = 0;\n\n vel_pub_.publish(cmd_vel);\n }\n\n \/\/ autonomy mode choice\n if (joy->buttons[stop_button_]){\n mode.data=0;\n mode_pub_.publish(mode);\n }\n if (joy->buttons[teleop_button_]){\n mode.data=1;\n mode_pub_.publish(mode);\n }\n if (joy->buttons[auto_button_]){\n mode.data=2;\n mode_pub_.publish(mode);\n }\n\n \/\/ blue lights control\n if (joy->buttons[bluelighton_button_])\n {\n bluelight.data = true;\n bluelight_pub_.publish(bluelight);\n }\n\n if (joy->buttons[bluelightoff_button_])\n {\n bluelight.data = false;\n bluelight_pub_.publish(bluelight);\n }\n \/\/ lights control\n if (joy->buttons[lighton_button_])\n {\n light.data = true;\n light_pub_.publish(light);\n }\n\n if (joy->buttons[lightoff_button_])\n {\n light.data = false;\n light_pub_.publish(light);\n }\n\n\n \/\/ flipper control\n jsm.header.frame_id = \"flippers_front\";\n jsm.header.stamp = ros::Time::now();\n jsm.name.push_back(\"flippers_front\");\n jsm.position.push_back(joy->axes[axis_flipper_] * scale_flipper_);\n jointstate_pub_.publish(jsm);\n\n\n \/\/ not sure at all what this bit from taurob original code does\n\n ros::Duration dur(0.5);\n\n for(int i=0; i < flipper_joint_names_.size(); i++)\n {\n flipper_traj.joint_names.push_back(flipper_joint_names_[i]);\n if (i == 0)\n {\n flipper_desired_joint_states.positions.push_back(\n current_flipper_joints_.positions.at(i) +\n joy->buttons[button_flipper_front_up_] * -scale_flipper_front_ +\n joy->buttons[button_flipper_front_down_] * scale_flipper_front_);\n }\n else\n {\n flipper_desired_joint_states.positions.push_back(\n current_flipper_joints_.positions.at(i) +\n joy->buttons[button_flipper_rear_up_] * -scale_flipper_rear_ +\n joy->buttons[button_flipper_rear_down_] * scale_flipper_rear_);\n }\n }\n\n flipper_desired_joint_states.time_from_start=dur;\n flipper_traj.header.stamp = ros::Time::now();\n flipper_traj.points.push_back(flipper_desired_joint_states);\n flipper_joints_pub_.publish(flipper_traj);\n\n}\n\nvoid JoystickTeleop::flipper_joint_statesCallback(const control_msgs::JointTrajectoryControllerState::ConstPtr &msg)\n{\n flipper_joint_names_= msg->joint_names;\n current_flipper_joints_= msg->actual;\n}\n\n\nint main(int argc, char** argv)\n{\n ros::init(argc, argv, \"taurob_mi_teleop_node\");\n JoystickTeleop joystick_teleop;\n\n ros::Rate r(20); \/\/ 20 hz\n while (ros::ok())\n {\n ros::spinOnce();\n r.sleep();\n }\n}\n<commit_msg>speed limits teleop update<commit_after>\/*!\n * mixed_initiative_teleop_node.cpp\n * Copyright (c) 2014, Manolis Chiou\n * All rights reserved.\n *\n *\n * Redistribution and use in source and binary forms, with or without\n * modification, are permitted provided that the following conditions are met:\n *\n * * Redistributions of source code must retain the above copyright\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 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\n\/*!\n\n@mainpage\n Joystick teleoperation node for use within the mixed initiative framework. The user can operate the robot in\n teleoperation mode and change on the fly autonomy level\/mode. Also a stop button is implimented.\n It was ment to be used with an Xbox 360 joystick but should work with any joystick.\n<hr>\n\n@section usage Usage\n@par\n@verbatim\n$ mixed_initiative_teleop\n@endverbatim\n\n<hr>\n@section topic ROS topics\n\nPublishes to (name \/ type):\n-@b \/teleop\/cmd_vel: will publish to \/teleop\/cmd_vel a geometry_msgs\/Twist.msg type message to drrobot_player.\n For differential robots, linear.x is forward\/backward speed (m\/sec), and angular.z (rad\/sec)is the angular speed.\n<hr>\n*\/\n\n\n#include \"sensor_msgs\/JointState.h\"\n#include \"trajectory_msgs\/JointTrajectory.h\"\n#include \"control_msgs\/JointTrajectoryControllerState.h\"\n#include <ros\/ros.h>\n#include <sensor_msgs\/Joy.h>\n#include <geometry_msgs\/Twist.h>\n#include <ros\/console.h>\n\n#include <std_msgs\/Int8.h>\n#include <std_msgs\/Bool.h>\n\nclass JoystickTeleop\n{\n\npublic:\n JoystickTeleop();\n\nprivate:\n void joyCallback(const sensor_msgs::Joy::ConstPtr& joy);\n void flipper_joint_statesCallback(const control_msgs::JointTrajectoryControllerState::ConstPtr &msg);\n\n ros::NodeHandle nh_;\n\n int linear_axis_, angular_axis_, control_button_, stop_button_, auto_button_, teleop_button_, enable_vel_button_, lighton_button_, lightoff_button_, bluelighton_button_, bluelightoff_button_;\n int axis_flipper_, button_flipper_front_down_, button_flipper_front_up_, button_flipper_rear_down_, button_flipper_rear_up_;\n double linear_scaling_, angular_scaling_, scale_flipper_, scale_flipper_rear_, scale_flipper_front_;\n\n std::vector<std::string> flipper_joint_names_;\n trajectory_msgs::JointTrajectoryPoint current_flipper_joints_;\n\n\n ros::Publisher vel_pub_, mode_pub_, light_pub_, bluelight_pub_ , jointstate_pub_, flipper_joints_pub_;\n\n ros::Subscriber joy_sub_, flipper_joint_states_sub_;\n\n};\n\n\nJoystickTeleop::JoystickTeleop()\n{\n \/\/ Default movement axis\n nh_.param(\"axis_linear\", linear_axis_, 1);\n nh_.param(\"axis_angular\", angular_axis_, 0);\n\n \/\/ Default scaling parameters\n nh_.param(\"scale_angular\", angular_scaling_, 0.6);\n nh_.param(\"scale_linear\", linear_scaling_, 0.25);\n\n \/\/Default buttons for Xbox 360 joystick.\n nh_.param(\"teleop_button\", teleop_button_, 3); \/\/ Y button\n nh_.param(\"auto_button\", auto_button_, 0); \/\/ A button\n nh_.param(\"stop_button\", stop_button_, 4); \/\/ LB button\n nh_.param(\"enable_vel_button\", enable_vel_button_, 5); \/\/ RB button\n nh_.param(\"bluelightoff_button\", bluelightoff_button_, 1); \/\/ B button\n nh_.param(\"bluelighton_button\", bluelighton_button_, 2); \/\/ X button\n nh_.param(\"lightoff_button\", lightoff_button_, 7); \/\/ start button\n nh_.param(\"lighton_button\", lighton_button_, 6); \/\/ back\/select button\n\n \/\/ default buttons and axis for flippers\n nh_.param(\"axis_flipper\", axis_flipper_, 4);\n nh_.param(\"scale_flipper\", scale_flipper_, 0.6);\n nh_.param(\"button_flipper_front_down\", button_flipper_front_down_, 0); \/\/6,7;\n nh_.param(\"button_flipper_front_up\", button_flipper_front_up_, 1);\n nh_.param(\"button_flipper_rear_down\", button_flipper_rear_down_, 2);\n nh_.param(\"button_flipper_rear_up\", button_flipper_rear_up_, 3);\n nh_.param(\"scale_flipper_front\", scale_flipper_front_, 0.6);\n nh_.param(\"scale_flipper_rear\", scale_flipper_rear_, 0.6);\n\n\n vel_pub_ = nh_.advertise<geometry_msgs::Twist>(\"\/teleop\/cmd_vel\", 5);\n mode_pub_ = nh_.advertise<std_msgs::Int8>(\"\/control_mode\", 5);\n light_pub_ = nh_.advertise<std_msgs::Bool>(\"\/light\", 5);\n bluelight_pub_ = nh_.advertise<std_msgs::Bool>(\"\/bluelight\", 5);\n jointstate_pub_ = nh_.advertise<sensor_msgs::JointState>(\"jointstate_cmd\", 1);\n flipper_joints_pub_= nh_.advertise<trajectory_msgs::JointTrajectory>(\"\/\/flipper\/flipper_traj_controller\/command\", 1);\n\n joy_sub_ = nh_.subscribe<sensor_msgs::Joy>(\"joy\", 2, &JoystickTeleop::joyCallback, this);\n flipper_joint_states_sub_ = nh_.subscribe<control_msgs::JointTrajectoryControllerState>(\"\/flipper\/flipper_traj_controller\/state\", 1, &JoystickTeleop::flipper_joint_statesCallback, this);\n\n}\n\nvoid JoystickTeleop::joyCallback(const sensor_msgs::Joy::ConstPtr& joy)\n{\n geometry_msgs::Twist cmd_vel;\n std_msgs::Int8 mode;\n std_msgs::Bool bluelight, light;\n sensor_msgs::JointState jsm;\n trajectory_msgs::JointTrajectory flipper_traj;\n trajectory_msgs::JointTrajectoryPoint flipper_desired_joint_states;\n\n\n if (joy->buttons.size() > enable_vel_button_ && joy->buttons[enable_vel_button_])\n {\n\n\n \/\/ movement commands\n cmd_vel.linear.x = linear_scaling_ * joy->axes[linear_axis_];\n cmd_vel.angular.z = angular_scaling_ * joy->axes[angular_axis_];\n\n vel_pub_.publish(cmd_vel);\n }\n\n else\n {\n cmd_vel.linear.x = 0;\n cmd_vel.angular.z = 0;\n\n vel_pub_.publish(cmd_vel);\n }\n\n \/\/ autonomy mode choice\n if (joy->buttons[stop_button_]){\n mode.data=0;\n mode_pub_.publish(mode);\n }\n if (joy->buttons[teleop_button_]){\n mode.data=1;\n mode_pub_.publish(mode);\n }\n if (joy->buttons[auto_button_]){\n mode.data=2;\n mode_pub_.publish(mode);\n }\n\n \/\/ blue lights control\n if (joy->buttons[bluelighton_button_])\n {\n bluelight.data = true;\n bluelight_pub_.publish(bluelight);\n }\n\n if (joy->buttons[bluelightoff_button_])\n {\n bluelight.data = false;\n bluelight_pub_.publish(bluelight);\n }\n \/\/ lights control\n if (joy->buttons[lighton_button_])\n {\n light.data = true;\n light_pub_.publish(light);\n }\n\n if (joy->buttons[lightoff_button_])\n {\n light.data = false;\n light_pub_.publish(light);\n }\n\n\n \/\/ flipper control\n jsm.header.frame_id = \"flippers_front\";\n jsm.header.stamp = ros::Time::now();\n jsm.name.push_back(\"flippers_front\");\n jsm.position.push_back(joy->axes[axis_flipper_] * scale_flipper_);\n jointstate_pub_.publish(jsm);\n\n\n \/\/ not sure at all what this bit from taurob original code does\n\n ros::Duration dur(0.5);\n\n for(int i=0; i < flipper_joint_names_.size(); i++)\n {\n flipper_traj.joint_names.push_back(flipper_joint_names_[i]);\n if (i == 0)\n {\n flipper_desired_joint_states.positions.push_back(\n current_flipper_joints_.positions.at(i) +\n joy->buttons[button_flipper_front_up_] * -scale_flipper_front_ +\n joy->buttons[button_flipper_front_down_] * scale_flipper_front_);\n }\n else\n {\n flipper_desired_joint_states.positions.push_back(\n current_flipper_joints_.positions.at(i) +\n joy->buttons[button_flipper_rear_up_] * -scale_flipper_rear_ +\n joy->buttons[button_flipper_rear_down_] * scale_flipper_rear_);\n }\n }\n\n flipper_desired_joint_states.time_from_start=dur;\n flipper_traj.header.stamp = ros::Time::now();\n flipper_traj.points.push_back(flipper_desired_joint_states);\n flipper_joints_pub_.publish(flipper_traj);\n\n}\n\nvoid JoystickTeleop::flipper_joint_statesCallback(const control_msgs::JointTrajectoryControllerState::ConstPtr &msg)\n{\n flipper_joint_names_= msg->joint_names;\n current_flipper_joints_= msg->actual;\n}\n\n\nint main(int argc, char** argv)\n{\n ros::init(argc, argv, \"taurob_mi_teleop_node\");\n JoystickTeleop joystick_teleop;\n\n ros::Rate r(20); \/\/ 20 hz\n while (ros::ok())\n {\n ros::spinOnce();\n r.sleep();\n }\n}\n<|endoftext|>"} {"text":"<commit_before>#include <babylon\/meshes\/sub_mesh.h>\r\n\r\n#include <babylon\/babylon_stl_util.h>\r\n#include <babylon\/collisions\/intersection_info.h>\r\n#include <babylon\/culling\/bounding_info.h>\r\n#include <babylon\/culling\/ray.h>\r\n#include <babylon\/engines\/constants.h>\r\n#include <babylon\/engines\/engine.h>\r\n#include <babylon\/engines\/scene.h>\r\n#include <babylon\/materials\/multi_material.h>\r\n#include <babylon\/materials\/standard_material.h>\r\n#include <babylon\/materials\/standard_material_defines.h>\r\n#include <babylon\/maths\/functions.h>\r\n#include <babylon\/maths\/plane.h>\r\n#include <babylon\/meshes\/abstract_mesh.h>\r\n#include <babylon\/meshes\/geometry.h>\r\n#include <babylon\/meshes\/instanced_lines_mesh.h>\r\n#include <babylon\/meshes\/lines_mesh.h>\r\n#include <babylon\/meshes\/transform_node.h>\r\n#include <babylon\/meshes\/vertex_buffer.h>\r\n#include <babylon\/misc\/tools.h>\r\n\r\nnamespace BABYLON {\r\n\r\nSubMesh::SubMesh(unsigned int iMaterialIndex, unsigned int iVerticesStart, size_t iVerticesCount,\r\n unsigned int iIndexStart, size_t iIndexCount, const AbstractMeshPtr& mesh,\r\n const MeshPtr& renderingMesh, bool iCreateBoundingBox)\r\n : materialIndex{iMaterialIndex}\r\n , verticesStart{iVerticesStart}\r\n , verticesCount{iVerticesCount}\r\n , indexStart{iIndexStart}\r\n , indexCount{iIndexCount}\r\n , createBoundingBox{iCreateBoundingBox}\r\n , _linesIndexCount{0}\r\n , _lastColliderTransformMatrix{nullptr}\r\n , _renderId{0}\r\n , _alphaIndex{0}\r\n , _distanceToCamera{0.f}\r\n , _mesh{mesh}\r\n , _boundingInfo{nullptr}\r\n , _linesIndexBuffer{nullptr}\r\n , _currentMaterial{nullptr}\r\n{\r\n _renderingMesh = renderingMesh ? renderingMesh : std::static_pointer_cast<Mesh>(mesh);\r\n\r\n _id = mesh->subMeshes.size() \/*- 1*\/; \/\/ Submesh is not yet to the list\r\n\r\n if (createBoundingBox) {\r\n refreshBoundingInfo();\r\n mesh->computeWorldMatrix(true);\r\n }\r\n}\r\n\r\nSubMesh::~SubMesh() = default;\r\n\r\nvoid SubMesh::addToMesh(const std::shared_ptr<SubMesh>& newSubMesh)\r\n{\r\n _mesh->subMeshes.emplace_back(newSubMesh);\r\n}\r\n\r\nSubMeshPtr SubMesh::AddToMesh(unsigned int materialIndex, unsigned int verticesStart,\r\n size_t verticesCount, unsigned int indexStart, size_t indexCount,\r\n const AbstractMeshPtr& mesh, const MeshPtr& renderingMesh,\r\n bool createBoundingBox)\r\n{\r\n return SubMesh::New(materialIndex, verticesStart, verticesCount, indexStart, indexCount, mesh,\r\n renderingMesh, createBoundingBox);\r\n}\r\n\r\nbool SubMesh::isGlobal() const\r\n{\r\n return (verticesStart == 0 && verticesCount == _mesh->getTotalVertices());\r\n}\r\n\r\nBoundingInfoPtr& SubMesh::getBoundingInfo()\r\n{\r\n if (isGlobal()) {\r\n return _mesh->getBoundingInfo();\r\n }\r\n\r\n return _boundingInfo;\r\n}\r\n\r\nSubMesh& SubMesh::setBoundingInfo(const BoundingInfo& boundingInfo)\r\n{\r\n _boundingInfo = std::make_unique<BoundingInfo>(boundingInfo);\r\n return *this;\r\n}\r\n\r\nAbstractMeshPtr& SubMesh::getMesh()\r\n{\r\n return _mesh;\r\n}\r\n\r\nMeshPtr& SubMesh::getRenderingMesh()\r\n{\r\n return _renderingMesh;\r\n}\r\n\r\nMaterialPtr SubMesh::getMaterial()\r\n{\r\n auto rootMaterial = _renderingMesh->getMaterial();\r\n\r\n if (!rootMaterial) {\r\n return _mesh->getScene()->defaultMaterial();\r\n }\r\n else if (rootMaterial && (rootMaterial->type() == Type::MULTIMATERIAL)) {\r\n auto multiMaterial = std::static_pointer_cast<MultiMaterial>(rootMaterial);\r\n auto effectiveMaterial = multiMaterial->getSubMaterial(materialIndex);\r\n\r\n if (_currentMaterial != effectiveMaterial) {\r\n _currentMaterial = effectiveMaterial;\r\n _materialDefines = nullptr;\r\n }\r\n\r\n return effectiveMaterial;\r\n }\r\n\r\n return rootMaterial;\r\n}\r\n\r\n\/\/ Methods\r\nSubMesh& SubMesh::refreshBoundingInfo(const Float32Array& iData)\r\n{\r\n _lastColliderWorldVertices.clear();\r\n\r\n if (isGlobal() || !_renderingMesh || !_renderingMesh->geometry()) {\r\n return *this;\r\n }\r\n\r\n auto data = !iData.empty() ? iData : _renderingMesh->getVerticesData(VertexBuffer::PositionKind);\r\n\r\n if (data.empty()) {\r\n _boundingInfo = std::make_unique<BoundingInfo>(*_mesh->_boundingInfo);\r\n return *this;\r\n }\r\n\r\n auto indices = _renderingMesh->getIndices();\r\n MinMax extend;\r\n\r\n \/\/ Is this the only submesh?\r\n if (indexStart == 0 && indexCount == indices.size()) {\r\n const auto& boundingInfo = *_renderingMesh->getBoundingInfo();\r\n\r\n \/\/ the rendering mesh's bounding info can be used, it is the standard\r\n \/\/ submesh for all indices.\r\n extend = {\r\n boundingInfo.minimum, \/\/ minimum\r\n boundingInfo.maximum \/\/ maximum\r\n };\r\n }\r\n else {\r\n extend = extractMinAndMaxIndexed(data, indices, indexStart, indexCount,\r\n *_renderingMesh->geometry()->boundingBias());\r\n }\r\n\r\n if (_boundingInfo) {\r\n _boundingInfo->reConstruct(extend.min, extend.max);\r\n }\r\n else {\r\n _boundingInfo = std::make_shared<BoundingInfo>(extend.min, extend.max);\r\n }\r\n\r\n return *this;\r\n}\r\n\r\nbool SubMesh::_checkCollision(const Collider& collider)\r\n{\r\n const auto& boundingInfo = *getBoundingInfo();\r\n\r\n return boundingInfo._checkCollision(collider);\r\n}\r\n\r\nSubMesh& SubMesh::updateBoundingInfo(const Matrix& world)\r\n{\r\n auto boundingInfo = getBoundingInfo();\r\n\r\n if (!boundingInfo) {\r\n refreshBoundingInfo();\r\n boundingInfo = getBoundingInfo();\r\n }\r\n boundingInfo->update(world);\r\n\r\n return *this;\r\n}\r\n\r\nbool SubMesh::isInFrustum(const std::array<Plane, 6>& frustumPlanes, unsigned int \/*strategy*\/)\r\n{\r\n auto boundingInfo = getBoundingInfo();\r\n\r\n if (!boundingInfo) {\r\n return false;\r\n }\r\n\r\n return boundingInfo->isInFrustum(frustumPlanes, _mesh->cullingStrategy);\r\n}\r\n\r\nbool SubMesh::isCompletelyInFrustum(const std::array<Plane, 6>& frustumPlanes)\r\n{\r\n auto boundingInfo = getBoundingInfo();\r\n\r\n if (!boundingInfo) {\r\n return false;\r\n }\r\n\r\n return boundingInfo->isCompletelyInFrustum(frustumPlanes);\r\n}\r\n\r\nSubMesh& SubMesh::render(bool enableAlphaMode)\r\n{\r\n _renderingMesh->render(this, enableAlphaMode);\r\n return *this;\r\n}\r\n\r\nWebGLDataBufferPtr& SubMesh::_getLinesIndexBuffer(const IndicesArray& indices, Engine* engine)\r\n{\r\n if (!_linesIndexBuffer) {\r\n Uint32Array linesIndices;\r\n\r\n for (auto index = indexStart; index < indexStart + indexCount; index += 3) {\r\n stl_util::concat(linesIndices, {indices[index + 0], indices[index + 1], indices[index + 1],\r\n indices[index + 2], indices[index + 2], indices[index + 0]});\r\n }\r\n\r\n _linesIndexBuffer = engine->createIndexBuffer(linesIndices);\r\n _linesIndexCount = linesIndices.size();\r\n }\r\n return _linesIndexBuffer;\r\n}\r\n\r\nbool SubMesh::canIntersects(const Ray& ray)\r\n{\r\n auto boundingInfo = getBoundingInfo();\r\n\r\n if (!boundingInfo) {\r\n return false;\r\n }\r\n\r\n return ray.intersectsBox(boundingInfo->boundingBox);\r\n}\r\n\r\nstd::optional<IntersectionInfo>\r\nSubMesh::intersects(Ray& ray, const std::vector<Vector3>& positions, const Uint32Array& indices,\r\n bool fastCheck, const TrianglePickingPredicate& trianglePredicate)\r\n{\r\n std::optional<IntersectionInfo> intersectInfo = std::nullopt;\r\n\r\n const auto material = getMaterial();\r\n if (!material) {\r\n return intersectInfo;\r\n }\r\n\r\n switch (material->fillMode()) {\r\n case Constants::MATERIAL_PointListDrawMode:\r\n case Constants::MATERIAL_LineListDrawMode:\r\n case Constants::MATERIAL_LineLoopDrawMode:\r\n case Constants::MATERIAL_LineStripDrawMode:\r\n case Constants::MATERIAL_TriangleFanDrawMode:\r\n case Constants::MATERIAL_TriangleStripDrawMode:\r\n return std::nullopt;\r\n }\r\n\r\n \/\/ LineMesh first as it's also a Mesh...\r\n if (_mesh->getClassName() == \"InstancedLinesMesh\" || _mesh->getClassName() == \"LinesMesh\") {\r\n auto intersectionThreshold = std::static_pointer_cast<LinesMesh>(_mesh)->intersectionThreshold;\r\n \/\/ Check if mesh is unindexed\r\n if (indices.empty()) {\r\n return _intersectUnIndexedLines(ray, positions, indices, intersectionThreshold, fastCheck);\r\n }\r\n return _intersectLines(ray, positions, indices, intersectionThreshold, fastCheck);\r\n }\r\n else {\r\n \/\/ Check if mesh is unindexed\r\n if (indices.empty() && _mesh->_unIndexed) {\r\n return _intersectUnIndexedTriangles(ray, positions, indices, fastCheck, trianglePredicate);\r\n }\r\n\r\n return _intersectTriangles(ray, positions, indices, fastCheck, trianglePredicate);\r\n }\r\n}\r\n\r\nstd::optional<IntersectionInfo>\r\nSubMesh::_intersectLines(Ray& ray, const std::vector<Vector3>& positions,\r\n const IndicesArray& indices, float intersectionThreshold, bool fastCheck)\r\n{\r\n std::optional<IntersectionInfo> intersectInfo = std::nullopt;\r\n\r\n \/\/ Line test\r\n for (auto index = indexStart; index < indexStart + indexCount; index += 2) {\r\n const auto& p0 = positions[indices[index]];\r\n const auto& p1 = positions[indices[index + 1]];\r\n\r\n const auto length = ray.intersectionSegment(p0, p1, intersectionThreshold);\r\n if (length < 0.f) {\r\n continue;\r\n }\r\n\r\n if (fastCheck || !intersectInfo || length < intersectInfo->distance) {\r\n intersectInfo = IntersectionInfo(0.f, 0.f, length);\r\n intersectInfo->faceId = index \/ 2;\r\n if (fastCheck) {\r\n break;\r\n }\r\n }\r\n }\r\n\r\n return intersectInfo;\r\n}\r\n\r\nstd::optional<IntersectionInfo>\r\nSubMesh::_intersectUnIndexedLines(Ray& ray, const std::vector<Vector3>& positions,\r\n const IndicesArray& \/*indices*\/, float intersectionThreshold,\r\n bool fastCheck)\r\n{\r\n std::optional<IntersectionInfo> intersectInfo = std::nullopt;\r\n\r\n \/\/ Line test\r\n for (auto index = verticesStart; index < verticesStart + verticesCount; index += 2) {\r\n const auto& p0 = positions[index];\r\n const auto& p1 = positions[index + 1];\r\n\r\n const auto length = ray.intersectionSegment(p0, p1, intersectionThreshold);\r\n if (length < 0.f) {\r\n continue;\r\n }\r\n\r\n if (fastCheck || !intersectInfo || length < intersectInfo->distance) {\r\n intersectInfo = IntersectionInfo(0.f, 0.f, length);\r\n intersectInfo->faceId = index \/ 2;\r\n if (fastCheck) {\r\n break;\r\n }\r\n }\r\n }\r\n\r\n return intersectInfo;\r\n}\r\n\r\nstd::optional<IntersectionInfo>\r\nSubMesh::_intersectTriangles(Ray& ray, const std::vector<Vector3>& positions,\r\n const IndicesArray& indices, bool fastCheck,\r\n const TrianglePickingPredicate& trianglePredicate)\r\n{\r\n if (positions.empty())\r\n return std::nullopt;\r\n\r\n std::optional<IntersectionInfo> intersectInfo = std::nullopt;\r\n\r\n \/\/ Triangles test\r\n for (auto index = indexStart; index < indexStart + indexCount; index += 3) {\r\n const auto& p0 = positions[indices[index]];\r\n const auto& p1 = positions[indices[index + 1]];\r\n const auto& p2 = positions[indices[index + 2]];\r\n\r\n if (trianglePredicate && !trianglePredicate(p0, p1, p2, ray)) {\r\n continue;\r\n }\r\n\r\n const auto currentIntersectInfo = ray.intersectsTriangle(p0, p1, p2);\r\n\r\n if (currentIntersectInfo) {\r\n if (currentIntersectInfo->distance < 0.f) {\r\n continue;\r\n }\r\n\r\n if (fastCheck || !intersectInfo || currentIntersectInfo->distance < intersectInfo->distance) {\r\n intersectInfo = currentIntersectInfo;\r\n intersectInfo->faceId = index \/ 3;\r\n\r\n if (fastCheck) {\r\n break;\r\n }\r\n }\r\n }\r\n }\r\n\r\n return intersectInfo;\r\n}\r\n\r\nstd::optional<IntersectionInfo>\r\nSubMesh::_intersectUnIndexedTriangles(Ray& ray, const std::vector<Vector3>& positions,\r\n const IndicesArray& \/*indices*\/, bool fastCheck,\r\n const TrianglePickingPredicate& trianglePredicate)\r\n{\r\n std::optional<IntersectionInfo> intersectInfo = std::nullopt;\r\n\r\n \/\/ Triangles test\r\n for (auto index = indexStart; index < indexStart + indexCount; index += 3) {\r\n const auto& p0 = positions[index];\r\n const auto& p1 = positions[index + 1];\r\n const auto& p2 = positions[index + 2];\r\n\r\n if (trianglePredicate && !trianglePredicate(p0, p1, p2, ray)) {\r\n continue;\r\n }\r\n\r\n const auto currentIntersectInfo = ray.intersectsTriangle(p0, p1, p2);\r\n\r\n if (currentIntersectInfo) {\r\n if (currentIntersectInfo->distance < 0.f) {\r\n continue;\r\n }\r\n\r\n if (fastCheck || !intersectInfo || currentIntersectInfo->distance < intersectInfo->distance) {\r\n intersectInfo = currentIntersectInfo;\r\n intersectInfo->faceId = index \/ 3;\r\n\r\n if (fastCheck) {\r\n break;\r\n }\r\n }\r\n }\r\n }\r\n\r\n return intersectInfo;\r\n}\r\n\r\nvoid SubMesh::_rebuild()\r\n{\r\n if (_linesIndexBuffer) {\r\n _linesIndexBuffer = nullptr;\r\n }\r\n}\r\n\r\n\/\/ Clone\r\nSubMeshPtr SubMesh::clone(const AbstractMeshPtr& newMesh, const MeshPtr& newRenderingMesh)\r\n{\r\n auto result = SubMesh::New(materialIndex, verticesStart, verticesCount, indexStart, indexCount,\r\n newMesh, newRenderingMesh, false);\r\n\r\n if (!isGlobal()) {\r\n auto boundingInfo = getBoundingInfo();\r\n\r\n if (!boundingInfo) {\r\n return result;\r\n }\r\n\r\n result->_boundingInfo\r\n = std::make_shared<BoundingInfo>(boundingInfo->minimum, boundingInfo->maximum);\r\n }\r\n\r\n return result;\r\n}\r\n\r\n\/\/ Dispose\r\nvoid SubMesh::dispose()\r\n{\r\n if (_linesIndexBuffer) {\r\n _mesh->getScene()->getEngine()->_releaseBuffer(_linesIndexBuffer);\r\n _linesIndexBuffer = nullptr;\r\n }\r\n\r\n \/\/ Remove from mesh\r\n stl_util::remove_vector_elements_equal_sharedptr(_mesh->subMeshes, this);\r\n}\r\n\r\nstd::string SubMesh::getClassName() const\r\n{\r\n return \"SubMesh\";\r\n}\r\n\r\nSubMeshPtr SubMesh::CreateFromIndices(unsigned int materialIndex, unsigned int startIndex,\r\n size_t indexCount, const AbstractMeshPtr& mesh,\r\n const MeshPtr& renderingMesh)\r\n{\r\n auto minVertexIndex = std::numeric_limits<unsigned>::max();\r\n auto maxVertexIndex = std::numeric_limits<unsigned>::lowest();\r\n\r\n auto whatWillRender = renderingMesh ? renderingMesh : std::static_pointer_cast<Mesh>(mesh);\r\n auto indices = whatWillRender->getIndices();\r\n\r\n for (size_t index = startIndex; index < startIndex + indexCount; ++index) {\r\n auto& vertexIndex = indices[index];\r\n\r\n if (vertexIndex < minVertexIndex) {\r\n minVertexIndex = vertexIndex;\r\n }\r\n if (vertexIndex > maxVertexIndex) {\r\n maxVertexIndex = vertexIndex;\r\n }\r\n }\r\n\r\n return SubMesh::New(materialIndex, minVertexIndex, maxVertexIndex - minVertexIndex + 1,\r\n startIndex, indexCount, mesh, renderingMesh);\r\n}\r\n\r\n} \/\/ end of namespace BABYLON\r\n<commit_msg>updated BabylonFileLoader class to v4.1.0-beta.13<commit_after>#include <babylon\/meshes\/sub_mesh.h>\r\n\r\n#include <babylon\/babylon_stl_util.h>\r\n#include <babylon\/collisions\/intersection_info.h>\r\n#include <babylon\/culling\/bounding_info.h>\r\n#include <babylon\/culling\/ray.h>\r\n#include <babylon\/engines\/constants.h>\r\n#include <babylon\/engines\/engine.h>\r\n#include <babylon\/engines\/scene.h>\r\n#include <babylon\/materials\/multi_material.h>\r\n#include <babylon\/materials\/standard_material.h>\r\n#include <babylon\/materials\/standard_material_defines.h>\r\n#include <babylon\/maths\/functions.h>\r\n#include <babylon\/maths\/plane.h>\r\n#include <babylon\/meshes\/abstract_mesh.h>\r\n#include <babylon\/meshes\/geometry.h>\r\n#include <babylon\/meshes\/instanced_lines_mesh.h>\r\n#include <babylon\/meshes\/lines_mesh.h>\r\n#include <babylon\/meshes\/transform_node.h>\r\n#include <babylon\/meshes\/vertex_buffer.h>\r\n#include <babylon\/misc\/tools.h>\r\n\r\nnamespace BABYLON {\r\n\r\nSubMesh::SubMesh(unsigned int iMaterialIndex, unsigned int iVerticesStart, size_t iVerticesCount,\r\n unsigned int iIndexStart, size_t iIndexCount, const AbstractMeshPtr& mesh,\r\n const MeshPtr& renderingMesh, bool iCreateBoundingBox)\r\n : materialIndex{iMaterialIndex}\r\n , verticesStart{iVerticesStart}\r\n , verticesCount{iVerticesCount}\r\n , indexStart{iIndexStart}\r\n , indexCount{iIndexCount}\r\n , createBoundingBox{iCreateBoundingBox}\r\n , _linesIndexCount{0}\r\n , _lastColliderTransformMatrix{nullptr}\r\n , _renderId{0}\r\n , _alphaIndex{0}\r\n , _distanceToCamera{0.f}\r\n , _mesh{mesh}\r\n , _boundingInfo{nullptr}\r\n , _linesIndexBuffer{nullptr}\r\n , _currentMaterial{nullptr}\r\n{\r\n _renderingMesh = renderingMesh ? renderingMesh : std::static_pointer_cast<Mesh>(mesh);\r\n\r\n _id = mesh->subMeshes.size() \/*- 1*\/; \/\/ Submesh is not yet to the list\r\n\r\n if (createBoundingBox) {\r\n refreshBoundingInfo();\r\n mesh->computeWorldMatrix(true);\r\n }\r\n}\r\n\r\nSubMesh::~SubMesh() = default;\r\n\r\nvoid SubMesh::addToMesh(const std::shared_ptr<SubMesh>& newSubMesh)\r\n{\r\n _mesh->subMeshes.emplace_back(newSubMesh);\r\n}\r\n\r\nSubMeshPtr SubMesh::AddToMesh(unsigned int materialIndex, unsigned int verticesStart,\r\n size_t verticesCount, unsigned int indexStart, size_t indexCount,\r\n const AbstractMeshPtr& mesh, const MeshPtr& renderingMesh,\r\n bool createBoundingBox)\r\n{\r\n return SubMesh::New(materialIndex, verticesStart, verticesCount, indexStart, indexCount, mesh,\r\n renderingMesh, createBoundingBox);\r\n}\r\n\r\nbool SubMesh::isGlobal() const\r\n{\r\n return (verticesStart == 0 && verticesCount == _mesh->getTotalVertices());\r\n}\r\n\r\nBoundingInfoPtr& SubMesh::getBoundingInfo()\r\n{\r\n if (isGlobal()) {\r\n return _mesh->getBoundingInfo();\r\n }\r\n\r\n return _boundingInfo;\r\n}\r\n\r\nSubMesh& SubMesh::setBoundingInfo(const BoundingInfo& boundingInfo)\r\n{\r\n _boundingInfo = std::make_unique<BoundingInfo>(boundingInfo);\r\n return *this;\r\n}\r\n\r\nAbstractMeshPtr& SubMesh::getMesh()\r\n{\r\n return _mesh;\r\n}\r\n\r\nMeshPtr& SubMesh::getRenderingMesh()\r\n{\r\n return _renderingMesh;\r\n}\r\n\r\nMaterialPtr SubMesh::getMaterial()\r\n{\r\n auto rootMaterial = _renderingMesh->getMaterial();\r\n\r\n if (!rootMaterial) {\r\n return _mesh->getScene()->defaultMaterial();\r\n }\r\n else if (rootMaterial && (rootMaterial->type() == Type::MULTIMATERIAL)) {\r\n auto multiMaterial = std::static_pointer_cast<MultiMaterial>(rootMaterial);\r\n auto effectiveMaterial = multiMaterial->getSubMaterial(materialIndex);\r\n\r\n if (_currentMaterial != effectiveMaterial) {\r\n _currentMaterial = effectiveMaterial;\r\n _materialDefines = nullptr;\r\n }\r\n\r\n return effectiveMaterial;\r\n }\r\n\r\n return rootMaterial;\r\n}\r\n\r\n\/\/ Methods\r\nSubMesh& SubMesh::refreshBoundingInfo(const Float32Array& iData)\r\n{\r\n _lastColliderWorldVertices.clear();\r\n\r\n if (isGlobal() || !_renderingMesh || !_renderingMesh->geometry()) {\r\n return *this;\r\n }\r\n\r\n auto data = !iData.empty() ? iData : _renderingMesh->getVerticesData(VertexBuffer::PositionKind);\r\n\r\n if (data.empty()) {\r\n _boundingInfo = std::make_unique<BoundingInfo>(*_mesh->_boundingInfo);\r\n return *this;\r\n }\r\n\r\n auto indices = _renderingMesh->getIndices();\r\n MinMax extend;\r\n\r\n \/\/ Is this the only submesh?\r\n if (indexStart == 0 && indexCount == indices.size()) {\r\n const auto& boundingInfo = *_renderingMesh->getBoundingInfo();\r\n\r\n \/\/ the rendering mesh's bounding info can be used, it is the standard\r\n \/\/ submesh for all indices.\r\n extend = {\r\n boundingInfo.minimum, \/\/ minimum\r\n boundingInfo.maximum \/\/ maximum\r\n };\r\n }\r\n else {\r\n extend = extractMinAndMaxIndexed(data, indices, indexStart, indexCount,\r\n *_renderingMesh->geometry()->boundingBias());\r\n }\r\n\r\n if (_boundingInfo) {\r\n _boundingInfo->reConstruct(extend.min, extend.max);\r\n }\r\n else {\r\n _boundingInfo = std::make_shared<BoundingInfo>(extend.min, extend.max);\r\n }\r\n\r\n return *this;\r\n}\r\n\r\nbool SubMesh::_checkCollision(const Collider& collider)\r\n{\r\n const auto& boundingInfo = *getBoundingInfo();\r\n\r\n return boundingInfo._checkCollision(collider);\r\n}\r\n\r\nSubMesh& SubMesh::updateBoundingInfo(const Matrix& world)\r\n{\r\n auto boundingInfo = getBoundingInfo();\r\n\r\n if (!boundingInfo) {\r\n refreshBoundingInfo();\r\n boundingInfo = getBoundingInfo();\r\n }\r\n if (boundingInfo) {\r\n boundingInfo->update(world);\r\n }\r\n\r\n return *this;\r\n}\r\n\r\nbool SubMesh::isInFrustum(const std::array<Plane, 6>& frustumPlanes, unsigned int \/*strategy*\/)\r\n{\r\n auto boundingInfo = getBoundingInfo();\r\n\r\n if (!boundingInfo) {\r\n return false;\r\n }\r\n\r\n return boundingInfo->isInFrustum(frustumPlanes, _mesh->cullingStrategy);\r\n}\r\n\r\nbool SubMesh::isCompletelyInFrustum(const std::array<Plane, 6>& frustumPlanes)\r\n{\r\n auto boundingInfo = getBoundingInfo();\r\n\r\n if (!boundingInfo) {\r\n return false;\r\n }\r\n\r\n return boundingInfo->isCompletelyInFrustum(frustumPlanes);\r\n}\r\n\r\nSubMesh& SubMesh::render(bool enableAlphaMode)\r\n{\r\n _renderingMesh->render(this, enableAlphaMode,\r\n _mesh->_internalAbstractMeshDataInfo._actAsRegularMesh ? _mesh : nullptr);\r\n return *this;\r\n}\r\n\r\nWebGLDataBufferPtr& SubMesh::_getLinesIndexBuffer(const IndicesArray& indices, Engine* engine)\r\n{\r\n if (!_linesIndexBuffer) {\r\n Uint32Array linesIndices;\r\n\r\n for (auto index = indexStart; index < indexStart + indexCount; index += 3) {\r\n stl_util::concat(linesIndices, {indices[index + 0], indices[index + 1], indices[index + 1],\r\n indices[index + 2], indices[index + 2], indices[index + 0]});\r\n }\r\n\r\n _linesIndexBuffer = engine->createIndexBuffer(linesIndices);\r\n _linesIndexCount = linesIndices.size();\r\n }\r\n return _linesIndexBuffer;\r\n}\r\n\r\nbool SubMesh::canIntersects(const Ray& ray)\r\n{\r\n auto boundingInfo = getBoundingInfo();\r\n\r\n if (!boundingInfo) {\r\n return false;\r\n }\r\n\r\n return ray.intersectsBox(boundingInfo->boundingBox);\r\n}\r\n\r\nstd::optional<IntersectionInfo>\r\nSubMesh::intersects(Ray& ray, const std::vector<Vector3>& positions, const Uint32Array& indices,\r\n bool fastCheck, const TrianglePickingPredicate& trianglePredicate)\r\n{\r\n std::optional<IntersectionInfo> intersectInfo = std::nullopt;\r\n\r\n const auto material = getMaterial();\r\n if (!material) {\r\n return intersectInfo;\r\n }\r\n\r\n switch (material->fillMode()) {\r\n case Constants::MATERIAL_PointListDrawMode:\r\n case Constants::MATERIAL_LineListDrawMode:\r\n case Constants::MATERIAL_LineLoopDrawMode:\r\n case Constants::MATERIAL_LineStripDrawMode:\r\n case Constants::MATERIAL_TriangleFanDrawMode:\r\n case Constants::MATERIAL_TriangleStripDrawMode:\r\n return std::nullopt;\r\n }\r\n\r\n \/\/ LineMesh first as it's also a Mesh...\r\n if (_mesh->getClassName() == \"InstancedLinesMesh\" || _mesh->getClassName() == \"LinesMesh\") {\r\n auto intersectionThreshold = std::static_pointer_cast<LinesMesh>(_mesh)->intersectionThreshold;\r\n \/\/ Check if mesh is unindexed\r\n if (indices.empty()) {\r\n return _intersectUnIndexedLines(ray, positions, indices, intersectionThreshold, fastCheck);\r\n }\r\n return _intersectLines(ray, positions, indices, intersectionThreshold, fastCheck);\r\n }\r\n else {\r\n \/\/ Check if mesh is unindexed\r\n if (indices.empty() && _mesh->_unIndexed) {\r\n return _intersectUnIndexedTriangles(ray, positions, indices, fastCheck, trianglePredicate);\r\n }\r\n\r\n return _intersectTriangles(ray, positions, indices, fastCheck, trianglePredicate);\r\n }\r\n}\r\n\r\nstd::optional<IntersectionInfo>\r\nSubMesh::_intersectLines(Ray& ray, const std::vector<Vector3>& positions,\r\n const IndicesArray& indices, float intersectionThreshold, bool fastCheck)\r\n{\r\n std::optional<IntersectionInfo> intersectInfo = std::nullopt;\r\n\r\n \/\/ Line test\r\n for (auto index = indexStart; index < indexStart + indexCount; index += 2) {\r\n const auto& p0 = positions[indices[index]];\r\n const auto& p1 = positions[indices[index + 1]];\r\n\r\n const auto length = ray.intersectionSegment(p0, p1, intersectionThreshold);\r\n if (length < 0.f) {\r\n continue;\r\n }\r\n\r\n if (fastCheck || !intersectInfo || length < intersectInfo->distance) {\r\n intersectInfo = IntersectionInfo(0.f, 0.f, length);\r\n intersectInfo->faceId = index \/ 2;\r\n if (fastCheck) {\r\n break;\r\n }\r\n }\r\n }\r\n\r\n return intersectInfo;\r\n}\r\n\r\nstd::optional<IntersectionInfo>\r\nSubMesh::_intersectUnIndexedLines(Ray& ray, const std::vector<Vector3>& positions,\r\n const IndicesArray& \/*indices*\/, float intersectionThreshold,\r\n bool fastCheck)\r\n{\r\n std::optional<IntersectionInfo> intersectInfo = std::nullopt;\r\n\r\n \/\/ Line test\r\n for (auto index = verticesStart; index < verticesStart + verticesCount; index += 2) {\r\n const auto& p0 = positions[index];\r\n const auto& p1 = positions[index + 1];\r\n\r\n const auto length = ray.intersectionSegment(p0, p1, intersectionThreshold);\r\n if (length < 0.f) {\r\n continue;\r\n }\r\n\r\n if (fastCheck || !intersectInfo || length < intersectInfo->distance) {\r\n intersectInfo = IntersectionInfo(0.f, 0.f, length);\r\n intersectInfo->faceId = index \/ 2;\r\n if (fastCheck) {\r\n break;\r\n }\r\n }\r\n }\r\n\r\n return intersectInfo;\r\n}\r\n\r\nstd::optional<IntersectionInfo>\r\nSubMesh::_intersectTriangles(Ray& ray, const std::vector<Vector3>& positions,\r\n const IndicesArray& indices, bool fastCheck,\r\n const TrianglePickingPredicate& trianglePredicate)\r\n{\r\n if (positions.empty())\r\n return std::nullopt;\r\n\r\n std::optional<IntersectionInfo> intersectInfo = std::nullopt;\r\n\r\n \/\/ Triangles test\r\n for (auto index = indexStart; index < indexStart + indexCount; index += 3) {\r\n const auto& p0 = positions[indices[index]];\r\n const auto& p1 = positions[indices[index + 1]];\r\n const auto& p2 = positions[indices[index + 2]];\r\n\r\n if (trianglePredicate && !trianglePredicate(p0, p1, p2, ray)) {\r\n continue;\r\n }\r\n\r\n const auto currentIntersectInfo = ray.intersectsTriangle(p0, p1, p2);\r\n\r\n if (currentIntersectInfo) {\r\n if (currentIntersectInfo->distance < 0.f) {\r\n continue;\r\n }\r\n\r\n if (fastCheck || !intersectInfo || currentIntersectInfo->distance < intersectInfo->distance) {\r\n intersectInfo = currentIntersectInfo;\r\n intersectInfo->faceId = index \/ 3;\r\n\r\n if (fastCheck) {\r\n break;\r\n }\r\n }\r\n }\r\n }\r\n\r\n return intersectInfo;\r\n}\r\n\r\nstd::optional<IntersectionInfo>\r\nSubMesh::_intersectUnIndexedTriangles(Ray& ray, const std::vector<Vector3>& positions,\r\n const IndicesArray& \/*indices*\/, bool fastCheck,\r\n const TrianglePickingPredicate& trianglePredicate)\r\n{\r\n std::optional<IntersectionInfo> intersectInfo = std::nullopt;\r\n\r\n \/\/ Triangles test\r\n for (auto index = indexStart; index < indexStart + indexCount; index += 3) {\r\n const auto& p0 = positions[index];\r\n const auto& p1 = positions[index + 1];\r\n const auto& p2 = positions[index + 2];\r\n\r\n if (trianglePredicate && !trianglePredicate(p0, p1, p2, ray)) {\r\n continue;\r\n }\r\n\r\n const auto currentIntersectInfo = ray.intersectsTriangle(p0, p1, p2);\r\n\r\n if (currentIntersectInfo) {\r\n if (currentIntersectInfo->distance < 0.f) {\r\n continue;\r\n }\r\n\r\n if (fastCheck || !intersectInfo || currentIntersectInfo->distance < intersectInfo->distance) {\r\n intersectInfo = currentIntersectInfo;\r\n intersectInfo->faceId = index \/ 3;\r\n\r\n if (fastCheck) {\r\n break;\r\n }\r\n }\r\n }\r\n }\r\n\r\n return intersectInfo;\r\n}\r\n\r\nvoid SubMesh::_rebuild()\r\n{\r\n if (_linesIndexBuffer) {\r\n _linesIndexBuffer = nullptr;\r\n }\r\n}\r\n\r\n\/\/ Clone\r\nSubMeshPtr SubMesh::clone(const AbstractMeshPtr& newMesh, const MeshPtr& newRenderingMesh)\r\n{\r\n auto result = SubMesh::New(materialIndex, verticesStart, verticesCount, indexStart, indexCount,\r\n newMesh, newRenderingMesh, false);\r\n\r\n if (!isGlobal()) {\r\n auto boundingInfo = getBoundingInfo();\r\n\r\n if (!boundingInfo) {\r\n return result;\r\n }\r\n\r\n result->_boundingInfo\r\n = std::make_shared<BoundingInfo>(boundingInfo->minimum, boundingInfo->maximum);\r\n }\r\n\r\n return result;\r\n}\r\n\r\n\/\/ Dispose\r\nvoid SubMesh::dispose()\r\n{\r\n if (_linesIndexBuffer) {\r\n _mesh->getScene()->getEngine()->_releaseBuffer(_linesIndexBuffer);\r\n _linesIndexBuffer = nullptr;\r\n }\r\n\r\n \/\/ Remove from mesh\r\n stl_util::remove_vector_elements_equal_sharedptr(_mesh->subMeshes, this);\r\n}\r\n\r\nstd::string SubMesh::getClassName() const\r\n{\r\n return \"SubMesh\";\r\n}\r\n\r\nSubMeshPtr SubMesh::CreateFromIndices(unsigned int materialIndex, unsigned int startIndex,\r\n size_t indexCount, const AbstractMeshPtr& mesh,\r\n const MeshPtr& renderingMesh)\r\n{\r\n auto minVertexIndex = std::numeric_limits<unsigned>::max();\r\n auto maxVertexIndex = std::numeric_limits<unsigned>::lowest();\r\n\r\n auto whatWillRender = renderingMesh ? renderingMesh : std::static_pointer_cast<Mesh>(mesh);\r\n auto indices = whatWillRender->getIndices();\r\n\r\n for (size_t index = startIndex; index < startIndex + indexCount; ++index) {\r\n auto& vertexIndex = indices[index];\r\n\r\n if (vertexIndex < minVertexIndex) {\r\n minVertexIndex = vertexIndex;\r\n }\r\n if (vertexIndex > maxVertexIndex) {\r\n maxVertexIndex = vertexIndex;\r\n }\r\n }\r\n\r\n return SubMesh::New(materialIndex, minVertexIndex, maxVertexIndex - minVertexIndex + 1,\r\n startIndex, indexCount, mesh, renderingMesh);\r\n}\r\n\r\n} \/\/ end of namespace BABYLON\r\n<|endoftext|>"} {"text":"<commit_before>#include <babylon\/misc\/file_tools.h>\n\n#define STB_IMAGE_IMPLEMENTATION\n#if defined(__GNUC__) || defined(__MINGW32__)\n#pragma GCC diagnostic push\n#pragma GCC diagnostic ignored \"-Wcast-qual\"\n#pragma GCC diagnostic ignored \"-Wconversion\"\n#if __GNUC__ > 5\n#pragma GCC diagnostic ignored \"-Wmisleading-indentation\"\n#pragma GCC diagnostic ignored \"-Wshift-negative-value\"\n#endif\n#if __GNUC__ > 6\n\/\/ Use of GNU statement expression extension\n#endif\n#pragma GCC diagnostic ignored \"-Wswitch-default\"\n#endif\n#if _MSC_VER && !__INTEL_COMPILER\n#ifndef NOMINMAX\n#define NOMINMAX\n#endif\n#pragma warning(push)\n#pragma warning(disable : 4244)\n#endif\n#include <stb_image\/stb_image.h>\n#ifdef _MSC_VER\n#pragma warning(pop)\n#endif\n#if defined(__GNUC__) || defined(__MINGW32__)\n#pragma GCC diagnostic pop\n#endif\n\n#include <babylon\/core\/array_buffer_view.h>\n#include <babylon\/core\/filesystem.h>\n#include <babylon\/core\/logging.h>\n#include <babylon\/core\/string.h>\n#include <babylon\/interfaces\/igl_rendering_context.h>\n#include <babylon\/loading\/progress_event.h>\n#include <babylon\/utils\/base64.h>\n\nnamespace BABYLON {\n\nstd::function<std::string(std::string url)> FileTools::PreprocessUrl = [](std::string url) {\n if (String::startsWith(url, \"file:\")) {\n url = url.substr(5);\n }\n \/\/ Check if the file is locally available\n \/\/ - Check in local folder\n auto absolutePath = Filesystem::absolutePath(url);\n if (Filesystem::exists(absolutePath)) {\n return String::concat(\"file:\", absolutePath);\n }\n \/\/ - Check in assets folder\n absolutePath = Filesystem::absolutePath(BABYLON::assets_folder() + url);\n if (Filesystem::exists(absolutePath)) {\n return String::concat(\"file:\", absolutePath);\n }\n return url;\n};\n\nstd::string FileTools::_CleanUrl(std::string url)\n{\n String::replaceInPlace(url, \"#\", \"%23\");\n return url;\n}\n\nvoid FileTools::LoadImageFromUrl(\n std::string url, const std::function<void(const Image& img)>& onLoad,\n const std::function<void(const std::string& message, const std::string& exception)>& onError,\n bool flipVertically)\n{\n url = FileTools::_CleanUrl(url);\n url = FileTools::PreprocessUrl(url);\n\n if (String::startsWith(url, \"file:\")) {\n using stbi_ptr = std::unique_ptr<unsigned char, std::function<void(unsigned char*)>>;\n\n for (auto req_comp : {STBI_rgb_alpha, STBI_rgb}) {\n int w = -1, h = -1, n = -1;\n stbi_set_flip_vertically_on_load(flipVertically);\n stbi_ptr data(stbi_load(url.substr(5).c_str(), &w, &h, &n, req_comp),\n [](unsigned char* _data) {\n if (_data) {\n stbi_image_free(_data);\n }\n });\n stbi_set_flip_vertically_on_load(false);\n\n if (data) {\n Image image(data.get(), w * h * req_comp, w, h, req_comp,\n (req_comp == 3) ? GL::RGB : GL::RGBA);\n onLoad(image);\n return;\n }\n }\n\n if (onError) {\n onError(\"Error loading image from file \" + url, \"\");\n return;\n }\n }\n}\n\nvoid FileTools::LoadImageFromBuffer(\n const std::variant<std::string, ArrayBuffer, ArrayBufferView, Image>& input, bool invertY,\n const std::function<void(const Image& img)>& onLoad,\n const std::function<void(const std::string& message, const std::string& exception)>& onError)\n{\n if (!onLoad) {\n return;\n }\n\n if (std::holds_alternative<std::string>(input)) {\n onLoad(FileTools::StringToImage(std::get<std::string>(input), invertY));\n }\n else if (std::holds_alternative<ArrayBuffer>(input)) {\n onLoad(FileTools::ArrayBufferToImage(std::get<ArrayBuffer>(input), invertY));\n }\n else if (std::holds_alternative<ArrayBufferView>(input)) {\n onLoad(FileTools::ArrayBufferToImage(std::get<ArrayBufferView>(input).uint8Array, invertY));\n }\n else if (std::holds_alternative<Image>(input)) {\n onLoad(std::get<Image>(input));\n }\n else {\n auto errorMessage = \"Loading image from url not supported\";\n if (onError) {\n onError(errorMessage, \"\");\n }\n else {\n throw std::runtime_error(errorMessage);\n }\n }\n}\n\nImage FileTools::ArrayBufferToImage(const ArrayBuffer& buffer, bool flipVertically)\n{\n if (buffer.empty()) {\n return Image();\n }\n\n using stbi_ptr = std::unique_ptr<unsigned char, std::function<void(unsigned char*)>>;\n\n auto bufferSize = static_cast<int>(buffer.size());\n auto w = -1, h = -1, n = -1;\n auto req_comp = STBI_rgb_alpha;\n stbi_set_flip_vertically_on_load(flipVertically);\n stbi_ptr data(stbi_load_from_memory(buffer.data(), bufferSize, &w, &h, &n, req_comp),\n [](unsigned char* _data) {\n if (_data) {\n stbi_image_free(_data);\n }\n });\n stbi_set_flip_vertically_on_load(false);\n\n if (!data) {\n return Image();\n }\n\n n = STBI_rgb_alpha;\n return Image(data.get(), w * h * n, w, h, n, (n == 3) ? GL::RGB : GL::RGBA);\n}\n\nImage FileTools::StringToImage(const std::string& uri, bool flipVertically)\n{\n const auto IsDataURI = [](const std::string& in) -> bool {\n std::string header = \"data:application\/octet-stream;base64,\";\n if (in.find(header) == 0) {\n return true;\n }\n\n header = \"data:image\/jpeg;base64,\";\n if (in.find(header) == 0) {\n return true;\n }\n\n header = \"data:image\/png;base64,\";\n if (in.find(header) == 0) {\n return true;\n }\n\n header = \"data:image\/bmp;base64,\";\n if (in.find(header) == 0) {\n return true;\n }\n\n header = \"data:image\/gif;base64,\";\n if (in.find(header) == 0) {\n return true;\n }\n\n header = \"data:text\/plain;base64,\";\n if (in.find(header) == 0) {\n return true;\n }\n\n header = \"data:application\/gltf-buffer;base64,\";\n return in.find(header) == 0;\n };\n\n const auto DecodeDataURI = [](std::vector<unsigned char>* out, std::string& mime_type,\n const std::string& in, size_t reqBytes, bool checkSize) -> bool {\n std::string header = \"data:application\/octet-stream;base64,\";\n std::string data;\n if (in.find(header) == 0) {\n data = Base64::decode(in.substr(header.size())); \/\/ cut mime string.\n }\n\n if (data.empty()) {\n header = \"data:image\/jpeg;base64,\";\n if (in.find(header) == 0) {\n mime_type = \"image\/jpeg\";\n data = Base64::decode(in.substr(header.size())); \/\/ cut mime string.\n }\n }\n\n if (data.empty()) {\n header = \"data:image\/png;base64,\";\n if (in.find(header) == 0) {\n mime_type = \"image\/png\";\n data = Base64::decode(in.substr(header.size())); \/\/ cut mime string.\n }\n }\n\n if (data.empty()) {\n header = \"data:image\/bmp;base64,\";\n if (in.find(header) == 0) {\n mime_type = \"image\/bmp\";\n data = Base64::decode(in.substr(header.size())); \/\/ cut mime string.\n }\n }\n\n if (data.empty()) {\n header = \"data:image\/gif;base64,\";\n if (in.find(header) == 0) {\n mime_type = \"image\/gif\";\n data = Base64::decode(in.substr(header.size())); \/\/ cut mime string.\n }\n }\n\n if (data.empty()) {\n header = \"data:text\/plain;base64,\";\n if (in.find(header) == 0) {\n mime_type = \"text\/plain\";\n data = Base64::decode(in.substr(header.size()));\n }\n }\n\n if (data.empty()) {\n header = \"data:application\/gltf-buffer;base64,\";\n if (in.find(header) == 0) {\n data = Base64::decode(in.substr(header.size()));\n }\n }\n\n if (data.empty()) {\n return false;\n }\n\n if (checkSize) {\n if (data.size() != reqBytes) {\n return false;\n }\n out->resize(reqBytes);\n }\n else {\n out->resize(data.size());\n }\n std::copy(data.begin(), data.end(), out->begin());\n return true;\n };\n\n const auto LoadImageData = [](Image& image, int req_width, int req_height,\n const unsigned char* bytes, int size, bool flipVertically) -> bool {\n int w = 0, h = 0, comp = 0, req_comp = 0;\n\n unsigned char* data = nullptr;\n\n \/\/ force 32-bit textures for common Vulkan compatibility. It appears that\n \/\/ some GPU drivers do not support 24-bit images for Vulkan\n req_comp = 4;\n int bits = 8;\n\n stbi_set_flip_vertically_on_load(flipVertically);\n\n \/\/ It is possible that the image we want to load is a 16bit per channel\n \/\/ image We are going to attempt to load it as 16bit per channel, and if it\n \/\/ worked, set the image data accodingly. We are casting the returned\n \/\/ pointer into unsigned char, because we are representing \"bytes\". But we\n \/\/ are updating the Image metadata to signal that this image uses 2 bytes\n \/\/ (16bits) per channel:\n if (stbi_is_16_bit_from_memory(bytes, size)) {\n data = reinterpret_cast<unsigned char*>(\n stbi_load_16_from_memory(bytes, size, &w, &h, &comp, req_comp));\n if (data) {\n bits = 16;\n }\n }\n\n \/\/ at this point, if data is still NULL, it means that the image wasn't\n \/\/ 16bit per channel, we are going to load it as a normal 8bit per channel\n \/\/ mage as we used to do:\n \/\/ if image cannot be decoded, ignore parsing and keep it by its path\n \/\/ don't break in this case\n \/\/ FIXME we should only enter this function if the image is embedded. If\n \/\/ image->uri references\n \/\/ an image file, it should be left as it is. Image loading should not be\n \/\/ mandatory (to support other formats)\n if (!data)\n data = stbi_load_from_memory(bytes, size, &w, &h, &comp, req_comp);\n if (!data) {\n BABYLON_LOG_WARN(\"StringToImage\",\n \"Unknown image format. STB cannot decode image data for image\")\n return false;\n }\n\n stbi_set_flip_vertically_on_load(false);\n\n if ((w < 1) || (h < 1)) {\n stbi_image_free(data);\n BABYLON_LOG_ERROR(\"StringToImage\", \"Invalid image data for image\")\n return false;\n }\n\n if (req_width > 0) {\n if (req_width != w) {\n stbi_image_free(data);\n BABYLON_LOG_ERROR(\"StringToImage\", \"Image width mismatch for image\")\n return false;\n }\n }\n\n if (req_height > 0) {\n if (req_height != h) {\n stbi_image_free(data);\n BABYLON_LOG_ERROR(\"StringToImage\", \"Image height mismatch. for image\")\n return false;\n }\n }\n\n image.width = w;\n image.height = h;\n image.depth = req_comp;\n image.mode = (req_comp == 3) ? GL::RGB : GL::RGBA;\n image.data.resize(static_cast<size_t>(w * h * req_comp) * size_t(bits \/ 8));\n std::copy(data, data + w * h * req_comp * (bits \/ 8), image.data.begin());\n stbi_image_free(data);\n\n return true;\n };\n\n Image image;\n std::vector<unsigned char> img;\n std::string mimeType;\n if (IsDataURI(uri)) {\n if (!DecodeDataURI(&img, mimeType, uri, 0, false)) {\n BABYLON_LOG_ERROR(\"Failed to decode image from uri: %s\", uri.c_str())\n return Image();\n }\n }\n\n if (LoadImageData(image, 0, 0, &img.at(0), static_cast<int>(img.size()), flipVertically)) {\n return image;\n }\n\n return Image();\n}\n\nvoid FileTools::ReadFile(\n std::string fileToLoad,\n const std::function<void(const std::variant<std::string, ArrayBuffer>& data,\n const std::string& responseURL)>& callback,\n const std::function<void(const ProgressEvent& event)>& onProgress, bool useArrayBuffer)\n{\n if (!Filesystem::exists(fileToLoad)) {\n BABYLON_LOGF_ERROR(\"Tools\", \"Error while reading file: %s\", fileToLoad.c_str())\n if (callback) {\n callback(\"\", \"\");\n }\n if (onProgress) {\n onProgress(ProgressEvent{\"ReadFileEvent\", true, 100, 100});\n }\n return;\n }\n\n if (!useArrayBuffer) {\n \/\/ Read file contents\n if (callback) {\n callback(Filesystem::readFileContents(fileToLoad.c_str()), \"\");\n }\n if (onProgress) {\n onProgress(ProgressEvent{\"ReadFileEvent\", true, 100, 100});\n }\n return;\n }\n else {\n \/\/ Read file contents\n if (callback) {\n callback(Filesystem::readBinaryFile(fileToLoad.c_str()), \"\");\n }\n if (onProgress) {\n onProgress(ProgressEvent{\"ReadFileEvent\", true, 100, 100});\n }\n return;\n }\n}\n\nvoid FileTools::LoadFile(\n std::string url,\n const std::function<void(const std::variant<std::string, ArrayBuffer>& data,\n const std::string& responseURL)>& onSuccess,\n const std::function<void(const ProgressEvent& event)>& onProgress, bool useArrayBuffer,\n const std::function<void(const std::string& message, const std::string& exception)>& onError)\n{\n url = FileTools::_CleanUrl(url);\n\n url = FileTools::PreprocessUrl(url);\n\n \/\/ If file and file input are set\n if (String::startsWith(url, \"file:\")) {\n const auto fileName = url.substr(5);\n if (!fileName.empty()) {\n FileTools::ReadFile(fileName, onSuccess, onProgress, useArrayBuffer);\n return;\n }\n }\n\n \/\/ Report error\n if (onError) {\n onError(\"Unable to load file from location \" + url, \"\");\n }\n}\n\n} \/\/ end of namespace BABYLON\n<commit_msg>FileTools::LoadImageFromUrl\/ArrayBufferToImage simplify<commit_after>#include <babylon\/misc\/file_tools.h>\n#include <future>\n\n#define STB_IMAGE_IMPLEMENTATION\n#if defined(__GNUC__) || defined(__MINGW32__)\n#pragma GCC diagnostic push\n#pragma GCC diagnostic ignored \"-Wcast-qual\"\n#pragma GCC diagnostic ignored \"-Wconversion\"\n#if __GNUC__ > 5\n#pragma GCC diagnostic ignored \"-Wmisleading-indentation\"\n#pragma GCC diagnostic ignored \"-Wshift-negative-value\"\n#endif\n#if __GNUC__ > 6\n\/\/ Use of GNU statement expression extension\n#endif\n#pragma GCC diagnostic ignored \"-Wswitch-default\"\n#endif\n#if _MSC_VER && !__INTEL_COMPILER\n#ifndef NOMINMAX\n#define NOMINMAX\n#endif\n#pragma warning(push)\n#pragma warning(disable : 4244)\n#endif\n#include <stb_image\/stb_image.h>\n#ifdef _MSC_VER\n#pragma warning(pop)\n#endif\n#if defined(__GNUC__) || defined(__MINGW32__)\n#pragma GCC diagnostic pop\n#endif\n\n#include <babylon\/core\/array_buffer_view.h>\n#include <babylon\/core\/filesystem.h>\n#include <babylon\/core\/logging.h>\n#include <babylon\/core\/string.h>\n#include <babylon\/interfaces\/igl_rendering_context.h>\n#include <babylon\/loading\/progress_event.h>\n#include <babylon\/utils\/base64.h>\n\nnamespace BABYLON {\n\nstd::function<std::string(std::string url)> FileTools::PreprocessUrl = [](std::string url) {\n if (String::startsWith(url, \"file:\")) {\n url = url.substr(5);\n }\n \/\/ Check if the file is locally available\n \/\/ - Check in local folder\n auto absolutePath = Filesystem::absolutePath(url);\n if (Filesystem::exists(absolutePath)) {\n return String::concat(\"file:\", absolutePath);\n }\n \/\/ - Check in assets folder\n absolutePath = Filesystem::absolutePath(BABYLON::assets_folder() + url);\n if (Filesystem::exists(absolutePath)) {\n return String::concat(\"file:\", absolutePath);\n }\n return url;\n};\n\nstd::string FileTools::_CleanUrl(std::string url)\n{\n String::replaceInPlace(url, \"#\", \"%23\");\n return url;\n}\n\nstd::optional<Image> LoadImage_Stbi_Impl(\n const char *filename,\n int nb_desired_channels,\n bool flipVertically)\n{\n\n \/\/ Basic usage (see HDR discussion below for HDR usage):\n int w, h, nb_channels_real;\n stbi_set_flip_vertically_on_load(flipVertically);\n unsigned char *data = stbi_load(filename, &w, &h, &nb_channels_real, nb_desired_channels);\n stbi_set_flip_vertically_on_load(false);\n if (data)\n {\n unsigned int glColorMode = (nb_desired_channels == 3) ? GL::RGB : GL::RGBA;\n Image image(data, w * h * nb_desired_channels, w, h, nb_desired_channels, glColorMode);\n stbi_image_free(data);\n return image;\n }\n return std::nullopt;\n}\n\n\nvoid FileTools::LoadImageFromUrl(\n std::string url, const std::function<void(const Image& img)>& onLoad,\n const std::function<void(const std::string& message, const std::string& exception)>& onError,\n bool flipVertically)\n{\n url = FileTools::_CleanUrl(url);\n url = FileTools::PreprocessUrl(url);\n\n if (!String::startsWith(url, \"file:\"))\n throw std::runtime_error(\"FileTools::LoadImageFromUrl only supports file urls\");\n\n const char *filename = url.substr(5).c_str();\n std::optional<Image> image;\n\n \/\/ Try to load RGBA, then load RGB on fail (is this really required? we could instead trust stbi)\n image = LoadImage_Stbi_Impl(filename, STBI_rgb_alpha, flipVertically);\n if (!image)\n image = LoadImage_Stbi_Impl(filename, STBI_rgb, flipVertically);\n\n if (image)\n onLoad(*image);\n else if (onError)\n onError(\"Error loading image from file \" + url, \"\");\n}\n\nvoid FileTools::LoadImageFromBuffer(\n const std::variant<std::string, ArrayBuffer, ArrayBufferView, Image>& input, bool invertY,\n const std::function<void(const Image& img)>& onLoad,\n const std::function<void(const std::string& message, const std::string& exception)>& onError)\n{\n if (!onLoad) {\n return;\n }\n\n if (std::holds_alternative<std::string>(input)) {\n onLoad(FileTools::StringToImage(std::get<std::string>(input), invertY));\n }\n else if (std::holds_alternative<ArrayBuffer>(input)) {\n onLoad(FileTools::ArrayBufferToImage(std::get<ArrayBuffer>(input), invertY));\n }\n else if (std::holds_alternative<ArrayBufferView>(input)) {\n onLoad(FileTools::ArrayBufferToImage(std::get<ArrayBufferView>(input).uint8Array, invertY));\n }\n else if (std::holds_alternative<Image>(input)) {\n onLoad(std::get<Image>(input));\n }\n else {\n auto errorMessage = \"Loading image from url not supported\";\n if (onError) {\n onError(errorMessage, \"\");\n }\n else {\n throw std::runtime_error(errorMessage);\n }\n }\n}\n\nImage FileTools::ArrayBufferToImage(const ArrayBuffer& buffer, bool flipVertically)\n{\n if (buffer.empty()) {\n return Image();\n }\n auto bufferSize = static_cast<int>(buffer.size());\n int w = -1, h = -1, n = -1;\n int req_comp = STBI_rgb_alpha;\n\n stbi_set_flip_vertically_on_load(flipVertically);\n unsigned char * ucharBuffer = stbi_load_from_memory(buffer.data(), bufferSize, &w, &h, &n, req_comp);\n stbi_set_flip_vertically_on_load(false);\n\n if (!ucharBuffer)\n return Image();\n\n n = STBI_rgb_alpha;\n Image image (ucharBuffer, w * h * n, w, h, n, (n == 3) ? GL::RGB : GL::RGBA);\n stbi_image_free(ucharBuffer);\n return image;\n}\n\nImage FileTools::StringToImage(const std::string& uri, bool flipVertically)\n{\n const auto IsDataURI = [](const std::string& in) -> bool {\n std::string header = \"data:application\/octet-stream;base64,\";\n if (in.find(header) == 0) {\n return true;\n }\n\n header = \"data:image\/jpeg;base64,\";\n if (in.find(header) == 0) {\n return true;\n }\n\n header = \"data:image\/png;base64,\";\n if (in.find(header) == 0) {\n return true;\n }\n\n header = \"data:image\/bmp;base64,\";\n if (in.find(header) == 0) {\n return true;\n }\n\n header = \"data:image\/gif;base64,\";\n if (in.find(header) == 0) {\n return true;\n }\n\n header = \"data:text\/plain;base64,\";\n if (in.find(header) == 0) {\n return true;\n }\n\n header = \"data:application\/gltf-buffer;base64,\";\n return in.find(header) == 0;\n };\n\n const auto DecodeDataURI = [](std::vector<unsigned char>* out, std::string& mime_type,\n const std::string& in, size_t reqBytes, bool checkSize) -> bool {\n std::string header = \"data:application\/octet-stream;base64,\";\n std::string data;\n if (in.find(header) == 0) {\n data = Base64::decode(in.substr(header.size())); \/\/ cut mime string.\n }\n\n if (data.empty()) {\n header = \"data:image\/jpeg;base64,\";\n if (in.find(header) == 0) {\n mime_type = \"image\/jpeg\";\n data = Base64::decode(in.substr(header.size())); \/\/ cut mime string.\n }\n }\n\n if (data.empty()) {\n header = \"data:image\/png;base64,\";\n if (in.find(header) == 0) {\n mime_type = \"image\/png\";\n data = Base64::decode(in.substr(header.size())); \/\/ cut mime string.\n }\n }\n\n if (data.empty()) {\n header = \"data:image\/bmp;base64,\";\n if (in.find(header) == 0) {\n mime_type = \"image\/bmp\";\n data = Base64::decode(in.substr(header.size())); \/\/ cut mime string.\n }\n }\n\n if (data.empty()) {\n header = \"data:image\/gif;base64,\";\n if (in.find(header) == 0) {\n mime_type = \"image\/gif\";\n data = Base64::decode(in.substr(header.size())); \/\/ cut mime string.\n }\n }\n\n if (data.empty()) {\n header = \"data:text\/plain;base64,\";\n if (in.find(header) == 0) {\n mime_type = \"text\/plain\";\n data = Base64::decode(in.substr(header.size()));\n }\n }\n\n if (data.empty()) {\n header = \"data:application\/gltf-buffer;base64,\";\n if (in.find(header) == 0) {\n data = Base64::decode(in.substr(header.size()));\n }\n }\n\n if (data.empty()) {\n return false;\n }\n\n if (checkSize) {\n if (data.size() != reqBytes) {\n return false;\n }\n out->resize(reqBytes);\n }\n else {\n out->resize(data.size());\n }\n std::copy(data.begin(), data.end(), out->begin());\n return true;\n };\n\n const auto LoadImageData = [](Image& image, int req_width, int req_height,\n const unsigned char* bytes, int size, bool flipVertically) -> bool {\n int w = 0, h = 0, comp = 0, req_comp = 0;\n\n unsigned char* data = nullptr;\n\n \/\/ force 32-bit textures for common Vulkan compatibility. It appears that\n \/\/ some GPU drivers do not support 24-bit images for Vulkan\n req_comp = 4;\n int bits = 8;\n\n stbi_set_flip_vertically_on_load(flipVertically);\n\n \/\/ It is possible that the image we want to load is a 16bit per channel\n \/\/ image We are going to attempt to load it as 16bit per channel, and if it\n \/\/ worked, set the image data accodingly. We are casting the returned\n \/\/ pointer into unsigned char, because we are representing \"bytes\". But we\n \/\/ are updating the Image metadata to signal that this image uses 2 bytes\n \/\/ (16bits) per channel:\n if (stbi_is_16_bit_from_memory(bytes, size)) {\n data = reinterpret_cast<unsigned char*>(\n stbi_load_16_from_memory(bytes, size, &w, &h, &comp, req_comp));\n if (data) {\n bits = 16;\n }\n }\n\n \/\/ at this point, if data is still NULL, it means that the image wasn't\n \/\/ 16bit per channel, we are going to load it as a normal 8bit per channel\n \/\/ mage as we used to do:\n \/\/ if image cannot be decoded, ignore parsing and keep it by its path\n \/\/ don't break in this case\n \/\/ FIXME we should only enter this function if the image is embedded. If\n \/\/ image->uri references\n \/\/ an image file, it should be left as it is. Image loading should not be\n \/\/ mandatory (to support other formats)\n if (!data)\n data = stbi_load_from_memory(bytes, size, &w, &h, &comp, req_comp);\n if (!data) {\n BABYLON_LOG_WARN(\"StringToImage\",\n \"Unknown image format. STB cannot decode image data for image\")\n return false;\n }\n\n stbi_set_flip_vertically_on_load(false);\n\n if ((w < 1) || (h < 1)) {\n stbi_image_free(data);\n BABYLON_LOG_ERROR(\"StringToImage\", \"Invalid image data for image\")\n return false;\n }\n\n if (req_width > 0) {\n if (req_width != w) {\n stbi_image_free(data);\n BABYLON_LOG_ERROR(\"StringToImage\", \"Image width mismatch for image\")\n return false;\n }\n }\n\n if (req_height > 0) {\n if (req_height != h) {\n stbi_image_free(data);\n BABYLON_LOG_ERROR(\"StringToImage\", \"Image height mismatch. for image\")\n return false;\n }\n }\n\n image.width = w;\n image.height = h;\n image.depth = req_comp;\n image.mode = (req_comp == 3) ? GL::RGB : GL::RGBA;\n image.data.resize(static_cast<size_t>(w * h * req_comp) * size_t(bits \/ 8));\n std::copy(data, data + w * h * req_comp * (bits \/ 8), image.data.begin());\n stbi_image_free(data);\n\n return true;\n };\n\n Image image;\n std::vector<unsigned char> img;\n std::string mimeType;\n if (IsDataURI(uri)) {\n if (!DecodeDataURI(&img, mimeType, uri, 0, false)) {\n BABYLON_LOG_ERROR(\"Failed to decode image from uri: %s\", uri.c_str())\n return Image();\n }\n }\n\n if (LoadImageData(image, 0, 0, &img.at(0), static_cast<int>(img.size()), flipVertically)) {\n return image;\n }\n\n return Image();\n}\n\nvoid FileTools::ReadFile(\n std::string fileToLoad,\n const std::function<void(const std::variant<std::string, ArrayBuffer>& data,\n const std::string& responseURL)>& callback,\n const std::function<void(const ProgressEvent& event)>& onProgress, bool useArrayBuffer)\n{\n if (!Filesystem::exists(fileToLoad)) {\n BABYLON_LOGF_ERROR(\"Tools\", \"Error while reading file: %s\", fileToLoad.c_str())\n if (callback) {\n callback(\"\", \"\");\n }\n if (onProgress) {\n onProgress(ProgressEvent{\"ReadFileEvent\", true, 100, 100});\n }\n return;\n }\n\n if (!useArrayBuffer) {\n \/\/ Read file contents\n if (callback) {\n callback(Filesystem::readFileContents(fileToLoad.c_str()), \"\");\n }\n if (onProgress) {\n onProgress(ProgressEvent{\"ReadFileEvent\", true, 100, 100});\n }\n return;\n }\n else {\n \/\/ Read file contents\n if (callback) {\n callback(Filesystem::readBinaryFile(fileToLoad.c_str()), \"\");\n }\n if (onProgress) {\n onProgress(ProgressEvent{\"ReadFileEvent\", true, 100, 100});\n }\n return;\n }\n}\n\nvoid FileTools::LoadFile(\n std::string url,\n const std::function<void(const std::variant<std::string, ArrayBuffer>& data,\n const std::string& responseURL)>& onSuccess,\n const std::function<void(const ProgressEvent& event)>& onProgress, bool useArrayBuffer,\n const std::function<void(const std::string& message, const std::string& exception)>& onError)\n{\n url = FileTools::_CleanUrl(url);\n\n url = FileTools::PreprocessUrl(url);\n\n \/\/ If file and file input are set\n if (String::startsWith(url, \"file:\")) {\n const auto fileName = url.substr(5);\n if (!fileName.empty()) {\n FileTools::ReadFile(fileName, onSuccess, onProgress, useArrayBuffer);\n return;\n }\n }\n\n \/\/ Report error\n if (onError) {\n onError(\"Unable to load file from location \" + url, \"\");\n }\n}\n\n} \/\/ end of namespace BABYLON\n<|endoftext|>"} {"text":"<commit_before>\/*\nA C++ header for Roaring Bitmaps.\n*\/\n#ifndef INCLUDE_ROARING_HH_\n#define INCLUDE_ROARING_HH_\n\n#include <stdarg.h>\n\n#include <algorithm>\n#include <new>\n#include <stdexcept>\n#include <roaring\/roaring.h>\n\nclass RoaringSetBitForwardIterator;\n\nclass Roaring {\n public:\n \/**\n * Create an empty bitmap\n *\/\n Roaring() : roaring(NULL) {\n roaring = roaring_bitmap_create();\n if (roaring == NULL) {\n throw std::runtime_error(\"failed memory alloc in constructor\");\n }\n }\n\n \/**\n * Construct a bitmap from a list of integer values.\n *\/\n Roaring(size_t n, const uint32_t *data) {\n roaring = roaring_bitmap_of_ptr(n, data);\n if (roaring == NULL) {\n throw std::runtime_error(\"failed memory alloc in constructor\");\n }\n }\n \/**\n * Copy constructor\n *\/\n Roaring(const Roaring &r) : roaring(NULL) {\n roaring = roaring_bitmap_copy(r.roaring);\n if (roaring == NULL) {\n throw std::runtime_error(\"failed memory alloc in constructor\");\n }\n }\n\n \/**\n * Construct a roaring object from the C struct.\n *\n * Passing a NULL point is unsafe.\n *\/\n Roaring(roaring_bitmap_t *s) : roaring(s) {}\n\n \/**\n * Construct a bitmap from a list of integer values.\n *\/\n static Roaring bitmapOf(size_t n, ...) {\n Roaring ans;\n va_list vl;\n va_start(vl, n);\n for (size_t i = 0; i < n; i++) {\n ans.add(va_arg(vl, uint32_t));\n }\n va_end(vl);\n return ans;\n }\n\n\n \/**\n * Add value x\n *\n *\/\n void add(uint32_t x) { roaring_bitmap_add(roaring, x); }\n\n \/**\n * Add value n_args from pointer vals\n *\n *\/\n void addMany(size_t n_args, const uint32_t *vals) {\n roaring_bitmap_add_many(roaring, n_args, vals);\n }\n\n \/**\n * Remove value x\n *\n *\/\n void remove(uint32_t x) { roaring_bitmap_remove(roaring, x); }\n\n \/**\n * Check if value x is present\n *\/\n bool contains(uint32_t x) const {\n return roaring_bitmap_contains(roaring, x);\n }\n\n \/**\n * Destructor\n *\/\n ~Roaring() { roaring_bitmap_free(roaring); }\n\n \/**\n * Copies the content of the provided bitmap, and\n * discard the current content.\n *\/\n Roaring &operator=(const Roaring &r) {\n roaring_bitmap_free(roaring);\n roaring = roaring_bitmap_copy(r.roaring);\n if (roaring == NULL) {\n throw std::runtime_error(\"failed memory alloc in assignement\");\n }\n return *this;\n }\n\n \/**\n * Compute the intersection between the current bitmap and the provided\n * bitmap,\n * writing the result in the current bitmap. The provided bitmap is not\n * modified.\n *\/\n Roaring &operator&=(const Roaring &r) {\n roaring_bitmap_and_inplace(roaring, r.roaring);\n return *this;\n }\n\n \/**\n * Compute the union between the current bitmap and the provided bitmap,\n * writing the result in the current bitmap. The provided bitmap is not\n * modified.\n *\n * See also the fastunion function to aggregate many bitmaps more quickly.\n *\/\n Roaring &operator|=(const Roaring &r) {\n roaring_bitmap_or_inplace(roaring, r.roaring);\n return *this;\n }\n\n \/**\n * Compute the symmetric union between the current bitmap and the provided\n * bitmap,\n * writing the result in the current bitmap. The provided bitmap is not\n * modified.\n *\/\n Roaring &operator^=(const Roaring &r) {\n roaring_bitmap_xor_inplace(roaring, r.roaring);\n return *this;\n }\n\n \/**\n * Exchange the content of this bitmap with another.\n *\/\n void swap(Roaring &r) { std::swap(r.roaring, roaring); }\n\n \/**\n * Get the cardinality of the bitmap (number of elements).\n *\/\n uint64_t cardinality() const {\n return roaring_bitmap_get_cardinality(roaring);\n }\n\n \/**\n * Returns true if the bitmap is empty (cardinality is zero).\n *\/\n bool isEmpty() const { return roaring_bitmap_is_empty(roaring); }\n\n \/**\n * Returns true if the bitmap is subset of the other.\n *\/\n bool isSubset(const Roaring &r) const { return roaring_bitmap_is_subset(roaring, r.roaring); }\n\n \/**\n * Returns true if the bitmap is strict subset of the other.\n *\/\n bool isStrictSubset(const Roaring &r) const { return roaring_bitmap_is_strict_subset(roaring, r.roaring); }\n\n \/**\n * Convert the bitmap to an array. Write the output to \"ans\",\n * caller is responsible to ensure that there is enough memory\n * allocated\n * (e.g., ans = new uint32[mybitmap.cardinality()];)\n *\/\n void toUint32Array(uint32_t *ans) const {\n roaring_bitmap_to_uint32_array(roaring, ans);\n }\n\n \/**\n * Return true if the two bitmaps contain the same elements.\n *\/\n bool operator==(const Roaring &r) const {\n return roaring_bitmap_equals(roaring, r.roaring);\n }\n\n \/**\n * compute the negation of the roaring bitmap within a specified interval.\n * areas outside the range are passed through unchanged.\n *\/\n void flip(uint64_t range_start, uint64_t range_end) {\n roaring_bitmap_flip_inplace(roaring, range_start, range_end);\n }\n\n \/**\n * Remove run-length encoding even when it is more space efficient\n * return whether a change was applied\n *\/\n bool removeRunCompression() {\n return roaring_bitmap_remove_run_compression(roaring);\n }\n\n \/** convert array and bitmap containers to run containers when it is more\n * efficient;\n * also convert from run containers when more space efficient. Returns\n * true if the result has at least one run container.\n * Additional savings might be possible by calling shrinkToFit().\n *\/\n bool runOptimize() { return roaring_bitmap_run_optimize(roaring); }\n\n \/**\n * If needed, reallocate memory to shrink the memory usage. Returns\n * the number of bytes saved.\n *\/\n size_t shrinkToFit() { return roaring_bitmap_shrink_to_fit(roaring); }\n\n \/**\n * Iterate over the bitmap elements. The function iterator is called once\n * for\n * all the values with ptr (can be NULL) as the second parameter of each\n * call.\n *\n * roaring_iterator is simply a pointer to a function that returns void,\n * and takes (uint32_t,void*) as inputs.\n *\/\n void iterate(roaring_iterator iterator, void *ptr) const {\n roaring_iterate(roaring, iterator, ptr);\n }\n\n \/**\n * If the size of the roaring bitmap is strictly greater than rank, then\n this\n function returns true and set element to the element of given rank.\n Otherwise, it returns false.\n *\/\n bool select(uint32_t rank, uint32_t *element) const {\n return roaring_bitmap_select(roaring, rank, element);\n }\n\n \/**\n * write a bitmap to a char buffer. This is meant to be compatible with\n * the\n * Java and Go versions. Returns how many bytes were written which should be\n * getSizeInBytes().\n *\n * Setting the portable flag to false enable a custom format that\n * can save space compared to the portable format (e.g., for very\n * sparse bitmaps).\n *\/\n size_t write(char *buf, bool portable = true) const {\n if (portable)\n return roaring_bitmap_portable_serialize(roaring, buf);\n else\n return roaring_bitmap_serialize(roaring, buf);\n }\n\n \/**\n * read a bitmap from a serialized version. This is meant to be compatible\n * with\n * the\n * Java and Go versions.\n *\n * Setting the portable flag to false enable a custom format that\n * can save space compared to the portable format (e.g., for very\n * sparse bitmaps).\n *\/\n static Roaring read(const char *buf, bool portable = true) {\n Roaring ans(NULL);\n if (portable)\n ans.roaring = roaring_bitmap_portable_deserialize(buf);\n else\n ans.roaring = roaring_bitmap_deserialize(buf);\n if (ans.roaring == NULL) {\n throw std::runtime_error(\"failed memory alloc while reading\");\n }\n return ans;\n }\n\n \/**\n * How many bytes are required to serialize this bitmap (meant to be\n * compatible\n * with Java and Go versions)\n *\n * Setting the portable flag to false enable a custom format that\n * can save space compared to the portable format (e.g., for very\n * sparse bitmaps).\n *\/\n size_t getSizeInBytes(bool portable = true) const {\n if (portable)\n return roaring_bitmap_portable_size_in_bytes(roaring);\n else\n return roaring_bitmap_size_in_bytes(roaring);\n }\n\n \/**\n * Computes the intersection between two bitmaps and returns new bitmap.\n * The current bitmap and the provided bitmap are unchanged.\n *\/\n Roaring operator&(const Roaring &o) const {\n roaring_bitmap_t *r = roaring_bitmap_and(roaring, o.roaring);\n if (r == NULL) {\n throw std::runtime_error(\"failed materalization in and\");\n }\n return Roaring(r);\n }\n\n \/**\n * Computes the union between two bitmaps and returns new bitmap.\n * The current bitmap and the provided bitmap are unchanged.\n *\/\n Roaring operator|(const Roaring &o) const {\n roaring_bitmap_t *r = roaring_bitmap_or(roaring, o.roaring);\n if (r == NULL) {\n throw std::runtime_error(\"failed materalization in or\");\n }\n return Roaring(r);\n }\n\n \/**\n * Computes the symmetric union between two bitmaps and returns new bitmap.\n * The current bitmap and the provided bitmap are unchanged.\n *\/\n Roaring operator^(const Roaring &o) const {\n roaring_bitmap_t *r = roaring_bitmap_xor(roaring, o.roaring);\n if (r == NULL) {\n throw std::runtime_error(\"failed materalization in xor\");\n }\n return Roaring(r);\n }\n\n \/**\n * Whether or not we apply copy and write.\n *\/\n void setCopyOnWrite(bool val) { roaring->copy_on_write = val; }\n\n \/**\n * Print the content of the bitmap\n *\/\n void printf() { roaring_bitmap_printf(roaring); }\n\n \/**\n * Whether or not copy and write is active.\n *\/\n bool getCopyOnWrite() const { return roaring->copy_on_write; }\n\n \/**\n * computes the logical or (union) between \"n\" bitmaps (referenced by a\n * pointer).\n *\/\n static Roaring fastunion(size_t n, const Roaring **inputs) {\n const roaring_bitmap_t **x =\n (const roaring_bitmap_t **)malloc(n * sizeof(roaring_bitmap_t *));\n if (x == NULL) {\n throw std::runtime_error(\"failed memory alloc in fastunion\");\n }\n for (size_t k = 0; k < n; ++k) x[k] = inputs[k]->roaring;\n\n Roaring ans(NULL);\n ans.roaring = roaring_bitmap_or_many(n, x);\n if (ans.roaring == NULL) {\n throw std::runtime_error(\"failed memory alloc in fastunion\");\n }\n free(x);\n return ans;\n }\n\n typedef RoaringSetBitForwardIterator const_iterator;\n\n \/**\n * Returns an iterator that can be used to access the position of the\n * set bits. The running time complexity of a full scan is proportional to the\n * number\n * of set bits: be aware that if you have long strings of 1s, this can be\n * very inefficient.\n *\n * It can be much faster to use the toArray method if you want to\n * retrieve the set bits.\n *\/\n const_iterator begin() const ;\n \/*{\n return RoaringSetBitForwardIterator(*this);\n }*\/\n\n \/**\n * A bogus iterator that can be used together with begin()\n * for constructions such as for(auto i = b.begin();\n * i!=b.end(); ++i) {}\n *\/\n const_iterator end() const ; \/*{\n return RoaringSetBitForwardIterator(*this, true);\n }*\/\n\n roaring_bitmap_t *roaring;\n};\n\n\n\/**\n * Used to go through the set bits. Not optimally fast, but convenient.\n *\/\nclass RoaringSetBitForwardIterator {\npublic:\n typedef std::forward_iterator_tag iterator_category;\n typedef uint32_t *pointer;\n typedef uint32_t &reference_type;\n typedef uint32_t value_type;\n typedef int32_t difference_type;\n typedef RoaringSetBitForwardIterator type_of_iterator;\n\n \/**\n * Provides the location of the set bit.\n *\/\n value_type operator*() const {\n return i->current_value;\n }\n\n bool operator<(const type_of_iterator &o) {\n return i->current_value < *o;\n }\n\n bool operator<=(const type_of_iterator &o) {\n return i->current_value <= *o;\n }\n\n bool operator>(const type_of_iterator &o) {\n return i->current_value > *o;\n }\n\n bool operator>=(const type_of_iterator &o) {\n return i->current_value >= *o;\n }\n\n type_of_iterator &operator++() {\/\/ ++i, must returned inc. value\n roaring_advance_uint32_iterator(i);\n return *this;\n }\n\n type_of_iterator operator++(int) {\/\/ i++, must return orig. value\n RoaringSetBitForwardIterator orig(*this);\n roaring_advance_uint32_iterator(i);\n return orig;\n }\n\n bool operator==(const RoaringSetBitForwardIterator &o) {\n return i->current_value == *o;\n }\n\n bool operator!=(const RoaringSetBitForwardIterator &o) {\n return i->current_value != *o;\n }\n\n RoaringSetBitForwardIterator(const Roaring & parent, bool exhausted = false) : i(NULL) {\n if(exhausted) {\n i = (roaring_uint32_iterator_t *) malloc(sizeof(roaring_uint32_iterator_t));\n i->parent = parent.roaring;\n i->container_index = INT32_MAX;\n i->has_value = false;\n i->current_value = UINT32_MAX;\n } else {\n i = roaring_create_iterator(parent.roaring);\n }\n }\n\n virtual ~RoaringSetBitForwardIterator() {\n roaring_free_uint32_iterator(i);\n i = NULL;\n }\n\n RoaringSetBitForwardIterator(\n const RoaringSetBitForwardIterator &o)\n : i(NULL) {\n i = roaring_copy_uint32_iterator (o.i);\n }\n\n\n\n roaring_uint32_iterator_t * i;\n};\n\n\nRoaringSetBitForwardIterator Roaring::begin() const {\n return RoaringSetBitForwardIterator(*this);\n}\n\nRoaringSetBitForwardIterator Roaring::end() const {\n return RoaringSetBitForwardIterator(*this, true);\n}\n\n#endif \/* INCLUDE_ROARING_HH_ *\/\n<commit_msg>Adding missing difference operator to C++ API<commit_after>\/*\nA C++ header for Roaring Bitmaps.\n*\/\n#ifndef INCLUDE_ROARING_HH_\n#define INCLUDE_ROARING_HH_\n\n#include <stdarg.h>\n\n#include <algorithm>\n#include <new>\n#include <stdexcept>\n#include <roaring\/roaring.h>\n\nclass RoaringSetBitForwardIterator;\n\nclass Roaring {\n public:\n \/**\n * Create an empty bitmap\n *\/\n Roaring() : roaring(NULL) {\n roaring = roaring_bitmap_create();\n if (roaring == NULL) {\n throw std::runtime_error(\"failed memory alloc in constructor\");\n }\n }\n\n \/**\n * Construct a bitmap from a list of integer values.\n *\/\n Roaring(size_t n, const uint32_t *data) {\n roaring = roaring_bitmap_of_ptr(n, data);\n if (roaring == NULL) {\n throw std::runtime_error(\"failed memory alloc in constructor\");\n }\n }\n \/**\n * Copy constructor\n *\/\n Roaring(const Roaring &r) : roaring(NULL) {\n roaring = roaring_bitmap_copy(r.roaring);\n if (roaring == NULL) {\n throw std::runtime_error(\"failed memory alloc in constructor\");\n }\n }\n\n \/**\n * Construct a roaring object from the C struct.\n *\n * Passing a NULL point is unsafe.\n *\/\n Roaring(roaring_bitmap_t *s) : roaring(s) {}\n\n \/**\n * Construct a bitmap from a list of integer values.\n *\/\n static Roaring bitmapOf(size_t n, ...) {\n Roaring ans;\n va_list vl;\n va_start(vl, n);\n for (size_t i = 0; i < n; i++) {\n ans.add(va_arg(vl, uint32_t));\n }\n va_end(vl);\n return ans;\n }\n\n\n \/**\n * Add value x\n *\n *\/\n void add(uint32_t x) { roaring_bitmap_add(roaring, x); }\n\n \/**\n * Add value n_args from pointer vals\n *\n *\/\n void addMany(size_t n_args, const uint32_t *vals) {\n roaring_bitmap_add_many(roaring, n_args, vals);\n }\n\n \/**\n * Remove value x\n *\n *\/\n void remove(uint32_t x) { roaring_bitmap_remove(roaring, x); }\n\n \/**\n * Check if value x is present\n *\/\n bool contains(uint32_t x) const {\n return roaring_bitmap_contains(roaring, x);\n }\n\n \/**\n * Destructor\n *\/\n ~Roaring() { roaring_bitmap_free(roaring); }\n\n \/**\n * Copies the content of the provided bitmap, and\n * discard the current content.\n *\/\n Roaring &operator=(const Roaring &r) {\n roaring_bitmap_free(roaring);\n roaring = roaring_bitmap_copy(r.roaring);\n if (roaring == NULL) {\n throw std::runtime_error(\"failed memory alloc in assignement\");\n }\n return *this;\n }\n\n \/**\n * Compute the intersection between the current bitmap and the provided\n * bitmap,\n * writing the result in the current bitmap. The provided bitmap is not\n * modified.\n *\/\n Roaring &operator&=(const Roaring &r) {\n roaring_bitmap_and_inplace(roaring, r.roaring);\n return *this;\n }\n\n \/**\n * Compute the difference between the current bitmap and the provided\n * bitmap,\n * writing the result in the current bitmap. The provided bitmap is not\n * modified.\n *\/\n Roaring &operator-=(const Roaring &r) {\n roaring_bitmap_andnot_inplace(roaring, r.roaring);\n return *this;\n }\n\n \/**\n * Compute the union between the current bitmap and the provided bitmap,\n * writing the result in the current bitmap. The provided bitmap is not\n * modified.\n *\n * See also the fastunion function to aggregate many bitmaps more quickly.\n *\/\n Roaring &operator|=(const Roaring &r) {\n roaring_bitmap_or_inplace(roaring, r.roaring);\n return *this;\n }\n\n \/**\n * Compute the symmetric union between the current bitmap and the provided\n * bitmap,\n * writing the result in the current bitmap. The provided bitmap is not\n * modified.\n *\/\n Roaring &operator^=(const Roaring &r) {\n roaring_bitmap_xor_inplace(roaring, r.roaring);\n return *this;\n }\n\n \/**\n * Exchange the content of this bitmap with another.\n *\/\n void swap(Roaring &r) { std::swap(r.roaring, roaring); }\n\n \/**\n * Get the cardinality of the bitmap (number of elements).\n *\/\n uint64_t cardinality() const {\n return roaring_bitmap_get_cardinality(roaring);\n }\n\n \/**\n * Returns true if the bitmap is empty (cardinality is zero).\n *\/\n bool isEmpty() const { return roaring_bitmap_is_empty(roaring); }\n\n \/**\n * Returns true if the bitmap is subset of the other.\n *\/\n bool isSubset(const Roaring &r) const { return roaring_bitmap_is_subset(roaring, r.roaring); }\n\n \/**\n * Returns true if the bitmap is strict subset of the other.\n *\/\n bool isStrictSubset(const Roaring &r) const { return roaring_bitmap_is_strict_subset(roaring, r.roaring); }\n\n \/**\n * Convert the bitmap to an array. Write the output to \"ans\",\n * caller is responsible to ensure that there is enough memory\n * allocated\n * (e.g., ans = new uint32[mybitmap.cardinality()];)\n *\/\n void toUint32Array(uint32_t *ans) const {\n roaring_bitmap_to_uint32_array(roaring, ans);\n }\n\n \/**\n * Return true if the two bitmaps contain the same elements.\n *\/\n bool operator==(const Roaring &r) const {\n return roaring_bitmap_equals(roaring, r.roaring);\n }\n\n \/**\n * compute the negation of the roaring bitmap within a specified interval.\n * areas outside the range are passed through unchanged.\n *\/\n void flip(uint64_t range_start, uint64_t range_end) {\n roaring_bitmap_flip_inplace(roaring, range_start, range_end);\n }\n\n \/**\n * Remove run-length encoding even when it is more space efficient\n * return whether a change was applied\n *\/\n bool removeRunCompression() {\n return roaring_bitmap_remove_run_compression(roaring);\n }\n\n \/** convert array and bitmap containers to run containers when it is more\n * efficient;\n * also convert from run containers when more space efficient. Returns\n * true if the result has at least one run container.\n * Additional savings might be possible by calling shrinkToFit().\n *\/\n bool runOptimize() { return roaring_bitmap_run_optimize(roaring); }\n\n \/**\n * If needed, reallocate memory to shrink the memory usage. Returns\n * the number of bytes saved.\n *\/\n size_t shrinkToFit() { return roaring_bitmap_shrink_to_fit(roaring); }\n\n \/**\n * Iterate over the bitmap elements. The function iterator is called once\n * for\n * all the values with ptr (can be NULL) as the second parameter of each\n * call.\n *\n * roaring_iterator is simply a pointer to a function that returns void,\n * and takes (uint32_t,void*) as inputs.\n *\/\n void iterate(roaring_iterator iterator, void *ptr) const {\n roaring_iterate(roaring, iterator, ptr);\n }\n\n \/**\n * If the size of the roaring bitmap is strictly greater than rank, then\n this\n function returns true and set element to the element of given rank.\n Otherwise, it returns false.\n *\/\n bool select(uint32_t rank, uint32_t *element) const {\n return roaring_bitmap_select(roaring, rank, element);\n }\n\n \/**\n * write a bitmap to a char buffer. This is meant to be compatible with\n * the\n * Java and Go versions. Returns how many bytes were written which should be\n * getSizeInBytes().\n *\n * Setting the portable flag to false enable a custom format that\n * can save space compared to the portable format (e.g., for very\n * sparse bitmaps).\n *\/\n size_t write(char *buf, bool portable = true) const {\n if (portable)\n return roaring_bitmap_portable_serialize(roaring, buf);\n else\n return roaring_bitmap_serialize(roaring, buf);\n }\n\n \/**\n * read a bitmap from a serialized version. This is meant to be compatible\n * with\n * the\n * Java and Go versions.\n *\n * Setting the portable flag to false enable a custom format that\n * can save space compared to the portable format (e.g., for very\n * sparse bitmaps).\n *\/\n static Roaring read(const char *buf, bool portable = true) {\n Roaring ans(NULL);\n if (portable)\n ans.roaring = roaring_bitmap_portable_deserialize(buf);\n else\n ans.roaring = roaring_bitmap_deserialize(buf);\n if (ans.roaring == NULL) {\n throw std::runtime_error(\"failed memory alloc while reading\");\n }\n return ans;\n }\n\n \/**\n * How many bytes are required to serialize this bitmap (meant to be\n * compatible\n * with Java and Go versions)\n *\n * Setting the portable flag to false enable a custom format that\n * can save space compared to the portable format (e.g., for very\n * sparse bitmaps).\n *\/\n size_t getSizeInBytes(bool portable = true) const {\n if (portable)\n return roaring_bitmap_portable_size_in_bytes(roaring);\n else\n return roaring_bitmap_size_in_bytes(roaring);\n }\n\n \/**\n * Computes the intersection between two bitmaps and returns new bitmap.\n * The current bitmap and the provided bitmap are unchanged.\n *\/\n Roaring operator&(const Roaring &o) const {\n roaring_bitmap_t *r = roaring_bitmap_and(roaring, o.roaring);\n if (r == NULL) {\n throw std::runtime_error(\"failed materalization in and\");\n }\n return Roaring(r);\n }\n\n\n \/**\n * Computes the difference between two bitmaps and returns new bitmap.\n * The current bitmap and the provided bitmap are unchanged.\n *\/\n Roaring operator-(const Roaring &o) const {\n roaring_bitmap_t *r = roaring_bitmap_andnot(roaring, o.roaring);\n if (r == NULL) {\n throw std::runtime_error(\"failed materalization in andnot\");\n }\n return Roaring(r);\n }\n\n \/**\n * Computes the union between two bitmaps and returns new bitmap.\n * The current bitmap and the provided bitmap are unchanged.\n *\/\n Roaring operator|(const Roaring &o) const {\n roaring_bitmap_t *r = roaring_bitmap_or(roaring, o.roaring);\n if (r == NULL) {\n throw std::runtime_error(\"failed materalization in or\");\n }\n return Roaring(r);\n }\n\n \/**\n * Computes the symmetric union between two bitmaps and returns new bitmap.\n * The current bitmap and the provided bitmap are unchanged.\n *\/\n Roaring operator^(const Roaring &o) const {\n roaring_bitmap_t *r = roaring_bitmap_xor(roaring, o.roaring);\n if (r == NULL) {\n throw std::runtime_error(\"failed materalization in xor\");\n }\n return Roaring(r);\n }\n\n \/**\n * Whether or not we apply copy and write.\n *\/\n void setCopyOnWrite(bool val) { roaring->copy_on_write = val; }\n\n \/**\n * Print the content of the bitmap\n *\/\n void printf() { roaring_bitmap_printf(roaring); }\n\n \/**\n * Whether or not copy and write is active.\n *\/\n bool getCopyOnWrite() const { return roaring->copy_on_write; }\n\n \/**\n * computes the logical or (union) between \"n\" bitmaps (referenced by a\n * pointer).\n *\/\n static Roaring fastunion(size_t n, const Roaring **inputs) {\n const roaring_bitmap_t **x =\n (const roaring_bitmap_t **)malloc(n * sizeof(roaring_bitmap_t *));\n if (x == NULL) {\n throw std::runtime_error(\"failed memory alloc in fastunion\");\n }\n for (size_t k = 0; k < n; ++k) x[k] = inputs[k]->roaring;\n\n Roaring ans(NULL);\n ans.roaring = roaring_bitmap_or_many(n, x);\n if (ans.roaring == NULL) {\n throw std::runtime_error(\"failed memory alloc in fastunion\");\n }\n free(x);\n return ans;\n }\n\n typedef RoaringSetBitForwardIterator const_iterator;\n\n \/**\n * Returns an iterator that can be used to access the position of the\n * set bits. The running time complexity of a full scan is proportional to the\n * number\n * of set bits: be aware that if you have long strings of 1s, this can be\n * very inefficient.\n *\n * It can be much faster to use the toArray method if you want to\n * retrieve the set bits.\n *\/\n const_iterator begin() const ;\n \/*{\n return RoaringSetBitForwardIterator(*this);\n }*\/\n\n \/**\n * A bogus iterator that can be used together with begin()\n * for constructions such as for(auto i = b.begin();\n * i!=b.end(); ++i) {}\n *\/\n const_iterator end() const ; \/*{\n return RoaringSetBitForwardIterator(*this, true);\n }*\/\n\n roaring_bitmap_t *roaring;\n};\n\n\n\/**\n * Used to go through the set bits. Not optimally fast, but convenient.\n *\/\nclass RoaringSetBitForwardIterator {\npublic:\n typedef std::forward_iterator_tag iterator_category;\n typedef uint32_t *pointer;\n typedef uint32_t &reference_type;\n typedef uint32_t value_type;\n typedef int32_t difference_type;\n typedef RoaringSetBitForwardIterator type_of_iterator;\n\n \/**\n * Provides the location of the set bit.\n *\/\n value_type operator*() const {\n return i->current_value;\n }\n\n bool operator<(const type_of_iterator &o) {\n return i->current_value < *o;\n }\n\n bool operator<=(const type_of_iterator &o) {\n return i->current_value <= *o;\n }\n\n bool operator>(const type_of_iterator &o) {\n return i->current_value > *o;\n }\n\n bool operator>=(const type_of_iterator &o) {\n return i->current_value >= *o;\n }\n\n type_of_iterator &operator++() {\/\/ ++i, must returned inc. value\n roaring_advance_uint32_iterator(i);\n return *this;\n }\n\n type_of_iterator operator++(int) {\/\/ i++, must return orig. value\n RoaringSetBitForwardIterator orig(*this);\n roaring_advance_uint32_iterator(i);\n return orig;\n }\n\n bool operator==(const RoaringSetBitForwardIterator &o) {\n return i->current_value == *o;\n }\n\n bool operator!=(const RoaringSetBitForwardIterator &o) {\n return i->current_value != *o;\n }\n\n RoaringSetBitForwardIterator(const Roaring & parent, bool exhausted = false) : i(NULL) {\n if(exhausted) {\n i = (roaring_uint32_iterator_t *) malloc(sizeof(roaring_uint32_iterator_t));\n i->parent = parent.roaring;\n i->container_index = INT32_MAX;\n i->has_value = false;\n i->current_value = UINT32_MAX;\n } else {\n i = roaring_create_iterator(parent.roaring);\n }\n }\n\n virtual ~RoaringSetBitForwardIterator() {\n roaring_free_uint32_iterator(i);\n i = NULL;\n }\n\n RoaringSetBitForwardIterator(\n const RoaringSetBitForwardIterator &o)\n : i(NULL) {\n i = roaring_copy_uint32_iterator (o.i);\n }\n\n\n\n roaring_uint32_iterator_t * i;\n};\n\n\nRoaringSetBitForwardIterator Roaring::begin() const {\n return RoaringSetBitForwardIterator(*this);\n}\n\nRoaringSetBitForwardIterator Roaring::end() const {\n return RoaringSetBitForwardIterator(*this, true);\n}\n\n#endif \/* INCLUDE_ROARING_HH_ *\/\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\/\/ XLA-specific Shape Ops.\n\n#include \"tensorflow\/compiler\/tf2xla\/kernels\/shape_util.h\"\n#include \"tensorflow\/compiler\/tf2xla\/type_util.h\"\n#include \"tensorflow\/compiler\/tf2xla\/xla_helpers.h\"\n#include \"tensorflow\/compiler\/tf2xla\/xla_op_kernel.h\"\n#include \"tensorflow\/compiler\/tf2xla\/xla_op_registry.h\"\n#include \"tensorflow\/compiler\/xla\/client\/xla_builder.h\"\n#include \"tensorflow\/core\/framework\/kernel_def_builder.h\"\n#include \"tensorflow\/core\/framework\/tensor_shape.h\"\n#include \"tensorflow\/core\/kernels\/bounds_check.h\"\n\nnamespace tensorflow {\nnamespace {\n\nclass ShapeOp : public XlaOpKernel {\n public:\n explicit ShapeOp(OpKernelConstruction* ctx) : XlaOpKernel(ctx) {\n OP_REQUIRES_OK(ctx, ctx->GetAttr(\"out_type\", &out_dtype_));\n }\n\n void Compile(XlaOpKernelContext* ctx) override {\n const TensorShape input_shape = ctx->InputShape(0);\n Tensor shape_constant(out_dtype_, TensorShape({input_shape.dims()}));\n OP_REQUIRES_OK(ctx, TensorShapeToConstant(input_shape, &shape_constant));\n ctx->SetConstantOutput(0, shape_constant);\n }\n\n private:\n DataType out_dtype_;\n};\n\nREGISTER_XLA_OP(Name(\"Shape\").CompilationOnly().IsMetadataOp(), ShapeOp);\n\nclass ShapeNOp : public XlaOpKernel {\n public:\n explicit ShapeNOp(OpKernelConstruction* ctx) : XlaOpKernel(ctx) {\n OP_REQUIRES_OK(ctx, ctx->GetAttr(\"out_type\", &out_dtype_));\n }\n\n void Compile(XlaOpKernelContext* ctx) override {\n for (int i = 0; i < ctx->num_inputs(); ++i) {\n const TensorShape input_shape = ctx->InputShape(i);\n Tensor shape_constant(out_dtype_, TensorShape({input_shape.dims()}));\n OP_REQUIRES_OK(ctx, TensorShapeToConstant(input_shape, &shape_constant));\n ctx->SetConstantOutput(i, shape_constant);\n }\n }\n\n bool IsExpensive() override { return false; }\n\n private:\n DataType out_dtype_;\n};\nREGISTER_XLA_OP(Name(\"ShapeN\").CompilationOnly().IsMetadataOp(), ShapeNOp);\n\nclass RankOp : public XlaOpKernel {\n public:\n explicit RankOp(OpKernelConstruction* ctx) : XlaOpKernel(ctx) {}\n\n void Compile(XlaOpKernelContext* ctx) override {\n const TensorShape input_shape = ctx->InputShape(0);\n const int rank = input_shape.dims();\n Tensor rank_constant(DT_INT32, TensorShape({}));\n rank_constant.scalar<int32>()() = rank;\n\n ctx->SetConstantOutput(0, rank_constant);\n }\n};\n\nREGISTER_XLA_OP(Name(\"Rank\").CompilationOnly().IsMetadataOp(), RankOp);\n\nclass SizeOp : public XlaOpKernel {\n public:\n explicit SizeOp(OpKernelConstruction* ctx) : XlaOpKernel(ctx) {}\n\n void Compile(XlaOpKernelContext* ctx) override {\n const TensorShape input_shape = ctx->InputShape(0);\n const int64 size = input_shape.num_elements();\n OP_REQUIRES(ctx, FastBoundsCheck(size, std::numeric_limits<int32>::max()),\n errors::InvalidArgument(\"Size does not work for tensors > \"\n \"int32 max.\"));\n Tensor size_constant(DT_INT32, TensorShape({}));\n size_constant.scalar<int32>()() = static_cast<int32>(size);\n\n ctx->SetConstantOutput(0, size_constant);\n }\n};\n\nREGISTER_XLA_OP(Name(\"Size\").CompilationOnly().IsMetadataOp(), SizeOp);\n\nclass ExpandDimsOp : public XlaOpKernel {\n public:\n explicit ExpandDimsOp(OpKernelConstruction* ctx) : XlaOpKernel(ctx) {}\n\n void Compile(XlaOpKernelContext* ctx) override {\n const TensorShape input_shape = ctx->InputShape(\"input\");\n const TensorShape dim_shape = ctx->InputShape(\"dim\");\n\n std::vector<int64> dims;\n OP_REQUIRES_OK(ctx, ctx->ConstantInputReshapedToIntVector(\"dim\", &dims));\n OP_REQUIRES(ctx, dims.size() == 1,\n errors::InvalidArgument(absl::StrCat(\n \"dim input to ExpandDims must be a scalar; got \",\n dim_shape.DebugString())));\n int dim = dims[0];\n\n OP_REQUIRES(ctx,\n (dim >= -1 - input_shape.dims() && dim <= input_shape.dims()),\n errors::InvalidArgument(\"Tried to expand dim index \", dim,\n \" for tensor with \", input_shape.dims(),\n \" dimensions.\"));\n\n auto existing_dims = input_shape.dim_sizes();\n \/\/ Safe - # elements in tensor dims bounded.\n const int existing_dims_size = static_cast<int>(existing_dims.size());\n std::vector<int64> new_shape(existing_dims_size);\n for (size_t i = 0; i < new_shape.size(); ++i) {\n new_shape[i] = existing_dims[i];\n }\n\n \/\/ We emulate numpy's interpretation of the dim axis when\n \/\/ -input.dims() >= dim <= input.dims().\n if (dim < 0) {\n dim += existing_dims.size() + 1;\n }\n\n \/\/ Clamp to the end if needed.\n dim = std::min<int32>(dim, existing_dims_size);\n new_shape.emplace(new_shape.begin() + dim, 1);\n\n ctx->SetOutput(0, xla::Reshape(ctx->Input(\"input\"), new_shape));\n }\n};\nREGISTER_XLA_OP(Name(\"ExpandDims\").CompileTimeConstantInput(\"dim\"),\n ExpandDimsOp);\n\nclass SqueezeOp : public XlaOpKernel {\n public:\n explicit SqueezeOp(OpKernelConstruction* ctx) : XlaOpKernel(ctx) {\n std::vector<int32> squeeze_dims;\n OP_REQUIRES_OK(ctx, ctx->GetAttr(\"squeeze_dims\", &squeeze_dims));\n squeeze_dims_.insert(squeeze_dims.begin(), squeeze_dims.end());\n }\n\n void Compile(XlaOpKernelContext* ctx) override {\n const TensorShape input_shape = ctx->InputShape(0);\n auto existing_dims = input_shape.dim_sizes();\n int existing_dims_size = input_shape.dims();\n std::vector<int64> new_shape;\n\n std::unordered_set<int32> wrapped_squeeze_dims;\n wrapped_squeeze_dims.reserve(squeeze_dims_.size());\n \/\/ Validate squeeze dims against the input.\n for (int32 dim : squeeze_dims_) {\n OP_REQUIRES(ctx, (dim >= -input_shape.dims() && dim < input_shape.dims()),\n errors::InvalidArgument(\"Tried to squeeze dim index \", dim,\n \" for tensor with \",\n input_shape.dims(), \" dimensions.\"));\n \/\/ If dim is < 0, we wrap around (-1 means the last element).\n if (dim < 0) {\n dim = existing_dims_size + dim;\n }\n\n wrapped_squeeze_dims.insert(dim);\n }\n\n for (int i = 0; i < existing_dims_size; ++i) {\n auto existing_dim = existing_dims[i];\n\n \/\/ If squeeze_set is non-empty, only squeeze those dimensions.\n if (!wrapped_squeeze_dims.empty()) {\n if (wrapped_squeeze_dims.count(i) > 0) {\n OP_REQUIRES(ctx, existing_dim == 1,\n errors::InvalidArgument(\n \"Tried to explicitly squeeze dimension \", i,\n \" but dimension was not 1: \", existing_dim));\n } else {\n \/\/ This dimension is not being squeezed.\n new_shape.push_back(existing_dim);\n }\n } else {\n \/\/ Copy over all non-1-length dimensions.\n if (existing_dim != 1) {\n new_shape.push_back(existing_dim);\n }\n }\n }\n\n ctx->SetOutput(0, xla::Reshape(ctx->Input(0), new_shape));\n }\n\n private:\n std::unordered_set<int32> squeeze_dims_;\n};\n\nREGISTER_XLA_OP(Name(\"Squeeze\"), SqueezeOp);\n\nclass ZerosLikeOp : public XlaOpKernel {\n public:\n explicit ZerosLikeOp(OpKernelConstruction* ctx) : XlaOpKernel(ctx) {}\n\n void Compile(XlaOpKernelContext* ctx) override {\n const TensorShape input_shape = ctx->InputShape(0);\n\n auto zero = XlaHelpers::Zero(ctx->builder(), input_type(0));\n ctx->SetOutput(0, xla::Broadcast(zero, input_shape.dim_sizes()));\n }\n};\n\nREGISTER_XLA_OP(Name(\"ZerosLike\"), ZerosLikeOp);\n\nclass OnesLikeOp : public XlaOpKernel {\n public:\n explicit OnesLikeOp(OpKernelConstruction* ctx) : XlaOpKernel(ctx) {}\n\n void Compile(XlaOpKernelContext* ctx) override {\n const TensorShape input_shape = ctx->InputShape(0);\n\n auto one = XlaHelpers::One(ctx->builder(), input_type(0));\n ctx->SetOutput(0, xla::Broadcast(one, input_shape.dim_sizes()));\n }\n};\n\nREGISTER_XLA_OP(Name(\"OnesLike\"), OnesLikeOp);\n\n} \/\/ namespace\n} \/\/ namespace tensorflow\n<commit_msg>[Resubmit][TF2XLA] Use dynamic dimension in SizeOp.<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\/\/ XLA-specific Shape Ops.\n\n#include \"tensorflow\/compiler\/tf2xla\/kernels\/shape_util.h\"\n#include \"tensorflow\/compiler\/tf2xla\/type_util.h\"\n#include \"tensorflow\/compiler\/tf2xla\/xla_helpers.h\"\n#include \"tensorflow\/compiler\/tf2xla\/xla_op_kernel.h\"\n#include \"tensorflow\/compiler\/tf2xla\/xla_op_registry.h\"\n#include \"tensorflow\/compiler\/xla\/client\/lib\/constants.h\"\n#include \"tensorflow\/compiler\/xla\/client\/xla_builder.h\"\n#include \"tensorflow\/core\/framework\/kernel_def_builder.h\"\n#include \"tensorflow\/core\/framework\/tensor_shape.h\"\n#include \"tensorflow\/core\/kernels\/bounds_check.h\"\n\nnamespace tensorflow {\nnamespace {\n\nclass ShapeOp : public XlaOpKernel {\n public:\n explicit ShapeOp(OpKernelConstruction* ctx) : XlaOpKernel(ctx) {\n OP_REQUIRES_OK(ctx, ctx->GetAttr(\"out_type\", &out_dtype_));\n }\n\n void Compile(XlaOpKernelContext* ctx) override {\n const TensorShape input_shape = ctx->InputShape(0);\n Tensor shape_constant(out_dtype_, TensorShape({input_shape.dims()}));\n OP_REQUIRES_OK(ctx, TensorShapeToConstant(input_shape, &shape_constant));\n ctx->SetConstantOutput(0, shape_constant);\n }\n\n private:\n DataType out_dtype_;\n};\n\nREGISTER_XLA_OP(Name(\"Shape\").CompilationOnly().IsMetadataOp(), ShapeOp);\n\nclass ShapeNOp : public XlaOpKernel {\n public:\n explicit ShapeNOp(OpKernelConstruction* ctx) : XlaOpKernel(ctx) {\n OP_REQUIRES_OK(ctx, ctx->GetAttr(\"out_type\", &out_dtype_));\n }\n\n void Compile(XlaOpKernelContext* ctx) override {\n for (int i = 0; i < ctx->num_inputs(); ++i) {\n const TensorShape input_shape = ctx->InputShape(i);\n Tensor shape_constant(out_dtype_, TensorShape({input_shape.dims()}));\n OP_REQUIRES_OK(ctx, TensorShapeToConstant(input_shape, &shape_constant));\n ctx->SetConstantOutput(i, shape_constant);\n }\n }\n\n bool IsExpensive() override { return false; }\n\n private:\n DataType out_dtype_;\n};\nREGISTER_XLA_OP(Name(\"ShapeN\").CompilationOnly().IsMetadataOp(), ShapeNOp);\n\nclass RankOp : public XlaOpKernel {\n public:\n explicit RankOp(OpKernelConstruction* ctx) : XlaOpKernel(ctx) {}\n\n void Compile(XlaOpKernelContext* ctx) override {\n const TensorShape input_shape = ctx->InputShape(0);\n const int rank = input_shape.dims();\n Tensor rank_constant(DT_INT32, TensorShape({}));\n rank_constant.scalar<int32>()() = rank;\n\n ctx->SetConstantOutput(0, rank_constant);\n }\n};\n\nREGISTER_XLA_OP(Name(\"Rank\").CompilationOnly().IsMetadataOp(), RankOp);\n\nclass SizeOp : public XlaOpKernel {\n public:\n explicit SizeOp(OpKernelConstruction* ctx) : XlaOpKernel(ctx) {}\n\n void Compile(XlaOpKernelContext* ctx) override {\n const TensorShape input_shape = ctx->InputShape(0);\n OP_REQUIRES(ctx,\n FastBoundsCheck(input_shape.num_elements(),\n std::numeric_limits<int32>::max()),\n errors::InvalidArgument(\"Size does not work for tensors > \"\n \"int32 max.\"));\n Tensor size_constant(DT_INT32, TensorShape({}));\n const int rank = input_shape.dims();\n xla::XlaBuilder* builder = ctx->builder();\n auto size = xla::One(builder, xla::U32);\n for (int64 i = 0; i < rank; ++i) {\n size = xla::Mul(size, xla::GetDimensionSize(ctx->Input(0), i));\n }\n size = xla::ConvertElementType(size, xla::S32);\n ctx->SetOutput(0, size);\n }\n};\n\nREGISTER_XLA_OP(Name(\"Size\").CompilationOnly().IsMetadataOp(), SizeOp);\n\nclass ExpandDimsOp : public XlaOpKernel {\n public:\n explicit ExpandDimsOp(OpKernelConstruction* ctx) : XlaOpKernel(ctx) {}\n\n void Compile(XlaOpKernelContext* ctx) override {\n const TensorShape input_shape = ctx->InputShape(\"input\");\n const TensorShape dim_shape = ctx->InputShape(\"dim\");\n\n std::vector<int64> dims;\n OP_REQUIRES_OK(ctx, ctx->ConstantInputReshapedToIntVector(\"dim\", &dims));\n OP_REQUIRES(ctx, dims.size() == 1,\n errors::InvalidArgument(absl::StrCat(\n \"dim input to ExpandDims must be a scalar; got \",\n dim_shape.DebugString())));\n int dim = dims[0];\n\n OP_REQUIRES(ctx,\n (dim >= -1 - input_shape.dims() && dim <= input_shape.dims()),\n errors::InvalidArgument(\"Tried to expand dim index \", dim,\n \" for tensor with \", input_shape.dims(),\n \" dimensions.\"));\n\n auto existing_dims = input_shape.dim_sizes();\n \/\/ Safe - # elements in tensor dims bounded.\n const int existing_dims_size = static_cast<int>(existing_dims.size());\n std::vector<int64> new_shape(existing_dims_size);\n for (size_t i = 0; i < new_shape.size(); ++i) {\n new_shape[i] = existing_dims[i];\n }\n\n \/\/ We emulate numpy's interpretation of the dim axis when\n \/\/ -input.dims() >= dim <= input.dims().\n if (dim < 0) {\n dim += existing_dims.size() + 1;\n }\n\n \/\/ Clamp to the end if needed.\n dim = std::min<int32>(dim, existing_dims_size);\n new_shape.emplace(new_shape.begin() + dim, 1);\n\n ctx->SetOutput(0, xla::Reshape(ctx->Input(\"input\"), new_shape));\n }\n};\nREGISTER_XLA_OP(Name(\"ExpandDims\").CompileTimeConstantInput(\"dim\"),\n ExpandDimsOp);\n\nclass SqueezeOp : public XlaOpKernel {\n public:\n explicit SqueezeOp(OpKernelConstruction* ctx) : XlaOpKernel(ctx) {\n std::vector<int32> squeeze_dims;\n OP_REQUIRES_OK(ctx, ctx->GetAttr(\"squeeze_dims\", &squeeze_dims));\n squeeze_dims_.insert(squeeze_dims.begin(), squeeze_dims.end());\n }\n\n void Compile(XlaOpKernelContext* ctx) override {\n const TensorShape input_shape = ctx->InputShape(0);\n auto existing_dims = input_shape.dim_sizes();\n int existing_dims_size = input_shape.dims();\n std::vector<int64> new_shape;\n\n std::unordered_set<int32> wrapped_squeeze_dims;\n wrapped_squeeze_dims.reserve(squeeze_dims_.size());\n \/\/ Validate squeeze dims against the input.\n for (int32 dim : squeeze_dims_) {\n OP_REQUIRES(ctx, (dim >= -input_shape.dims() && dim < input_shape.dims()),\n errors::InvalidArgument(\"Tried to squeeze dim index \", dim,\n \" for tensor with \",\n input_shape.dims(), \" dimensions.\"));\n \/\/ If dim is < 0, we wrap around (-1 means the last element).\n if (dim < 0) {\n dim = existing_dims_size + dim;\n }\n\n wrapped_squeeze_dims.insert(dim);\n }\n\n for (int i = 0; i < existing_dims_size; ++i) {\n auto existing_dim = existing_dims[i];\n\n \/\/ If squeeze_set is non-empty, only squeeze those dimensions.\n if (!wrapped_squeeze_dims.empty()) {\n if (wrapped_squeeze_dims.count(i) > 0) {\n OP_REQUIRES(ctx, existing_dim == 1,\n errors::InvalidArgument(\n \"Tried to explicitly squeeze dimension \", i,\n \" but dimension was not 1: \", existing_dim));\n } else {\n \/\/ This dimension is not being squeezed.\n new_shape.push_back(existing_dim);\n }\n } else {\n \/\/ Copy over all non-1-length dimensions.\n if (existing_dim != 1) {\n new_shape.push_back(existing_dim);\n }\n }\n }\n\n ctx->SetOutput(0, xla::Reshape(ctx->Input(0), new_shape));\n }\n\n private:\n std::unordered_set<int32> squeeze_dims_;\n};\n\nREGISTER_XLA_OP(Name(\"Squeeze\"), SqueezeOp);\n\nclass ZerosLikeOp : public XlaOpKernel {\n public:\n explicit ZerosLikeOp(OpKernelConstruction* ctx) : XlaOpKernel(ctx) {}\n\n void Compile(XlaOpKernelContext* ctx) override {\n const TensorShape input_shape = ctx->InputShape(0);\n\n auto zero = XlaHelpers::Zero(ctx->builder(), input_type(0));\n ctx->SetOutput(0, xla::Broadcast(zero, input_shape.dim_sizes()));\n }\n};\n\nREGISTER_XLA_OP(Name(\"ZerosLike\"), ZerosLikeOp);\n\nclass OnesLikeOp : public XlaOpKernel {\n public:\n explicit OnesLikeOp(OpKernelConstruction* ctx) : XlaOpKernel(ctx) {}\n\n void Compile(XlaOpKernelContext* ctx) override {\n const TensorShape input_shape = ctx->InputShape(0);\n\n auto one = XlaHelpers::One(ctx->builder(), input_type(0));\n ctx->SetOutput(0, xla::Broadcast(one, input_shape.dim_sizes()));\n }\n};\n\nREGISTER_XLA_OP(Name(\"OnesLike\"), OnesLikeOp);\n\n} \/\/ namespace\n} \/\/ namespace tensorflow\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\/natpmp.hpp>\n#include <libtorrent\/io.hpp>\n#include <boost\/bind.hpp>\n#include <boost\/date_time\/posix_time\/posix_time.hpp>\n#include <asio\/ip\/host_name.hpp>\n\nusing boost::bind;\nusing namespace libtorrent;\nusing boost::posix_time::microsec_clock;\n\nnatpmp::natpmp(io_service& ios, portmap_callback_t const& cb)\n\t: m_callback(cb)\n\t, m_currently_mapping(-1)\n\t, m_retry_count(0)\n\t, m_socket(ios)\n\t, m_send_timer(ios)\n\t, m_refresh_timer(ios)\n\t, m_disabled(false)\n{\n\tm_mappings[0].protocol = 2; \/\/ tcp\n\tm_mappings[1].protocol = 1; \/\/ udp\n\n#if defined(TORRENT_LOGGING) || defined(TORRENT_VERBOSE_LOGGING)\n\tm_log.open(\"natpmp.log\", std::ios::in | std::ios::out | std::ios::trunc);\n#endif\n\t\n\tudp::resolver r(ios);\n\tudp::resolver::iterator i = r.resolve(udp::resolver::query(asio::ip::host_name(), \"0\"));\n\tfor (;i != udp::resolver_iterator(); ++i)\n\t{\n\t\tif (i->endpoint().address().is_v4()) break;\n\t}\n\n\tif (i == udp::resolver_iterator())\n\t{\n#if defined(TORRENT_LOGGING) || defined(TORRENT_VERBOSE_LOGGING)\n\t\tm_log << \"local host name did not resolve to an IPv4 address. \"\n\t\t\t\"disabling NAT-PMP\" << std::endl;\n#endif\n\t\tm_disabled = true;\n\t\treturn;\n\t}\n\n\taddress_v4 local = i->endpoint().address().to_v4();\n#if defined(TORRENT_LOGGING) || defined(TORRENT_VERBOSE_LOGGING)\n\tm_log << to_simple_string(microsec_clock::universal_time())\n\t\t<< \" local ip: \" << local.to_string() << std::endl;\n#endif\n\n\tif ((local.to_ulong() & 0xff000000) != 0x0a000000\n\t\t&& (local.to_ulong() & 0xfff00000) != 0xac100000\n\t\t&& (local.to_ulong() & 0xffff0000) != 0xaca80000)\n\t{\n\t\t\/\/ the local address seems to be an external\n\t\t\/\/ internet address. Assume it is not behind a NAT\n#if defined(TORRENT_LOGGING) || defined(TORRENT_VERBOSE_LOGGING)\n\t\tm_log << \"not on a NAT. disabling NAT-PMP\" << std::endl;\n#endif\n\t\tm_disabled = true;\n\t\treturn;\n\t}\n\n\t\/\/ assume the router is located on the local\n\t\/\/ network as x.x.x.1\n\t\/\/ TODO: find a better way to figure out the router IP\n\tm_nat_endpoint = udp::endpoint(\n\t\taddress_v4((local.to_ulong() & 0xffffff00) | 1), 5351);\n\n#if defined(TORRENT_LOGGING) || defined(TORRENT_VERBOSE_LOGGING)\n\tm_log << \"assuming router is at: \" << m_nat_endpoint.address().to_string() << std::endl;\n#endif\n\n\tm_socket.open(udp::v4());\n\tm_socket.bind(udp::endpoint());\n}\n\nvoid natpmp::set_mappings(int tcp, int udp)\n{\n\tif (m_disabled) return;\n\tupdate_mapping(0, tcp);\n\tupdate_mapping(1, udp);\n}\n\nvoid natpmp::update_mapping(int i, int port)\n{\n\tnatpmp::mapping& m = m_mappings[i];\n\tif (port <= 0) return;\n\tif (m.local_port != port)\n\t\tm.need_update = true;\n\n\tm.local_port = port;\n\t\/\/ prefer the same external port as the local port\n\tif (m.external_port == 0) m.external_port = port;\n\n\tif (m_currently_mapping == -1)\n\t{\n\t\t\/\/ the socket is not currently in use\n\t\t\/\/ send out a mapping request\n\t\tm_retry_count = 0;\n\t\tsend_map_request(i);\n\t\tm_socket.async_receive_from(asio::buffer(&m_response_buffer, 16)\n\t\t\t, m_remote, bind(&natpmp::on_reply, this, _1, _2));\n\t}\n}\n\nvoid natpmp::send_map_request(int i) try\n{\n\tusing namespace libtorrent::detail;\n\tusing boost::posix_time::milliseconds;\n\n\tassert(m_currently_mapping == -1\n\t\t|| m_currently_mapping == i);\n\tm_currently_mapping = i;\n\tmapping& m = m_mappings[i];\n\tchar buf[12];\n\tchar* out = buf;\n\twrite_uint8(0, out); \/\/ NAT-PMP version\n\twrite_uint8(m.protocol, out); \/\/ map \"protocol\"\n\twrite_uint16(0, out); \/\/ reserved\n\twrite_uint16(m.local_port, out); \/\/ private port\n\twrite_uint16(m.external_port, out); \/\/ requested public port\n\tint ttl = m.external_port == 0 ? 0 : 3600;\n\twrite_uint32(ttl, out); \/\/ port mapping lifetime\n\n#if defined(TORRENT_LOGGING) || defined(TORRENT_VERBOSE_LOGGING)\n\tm_log << to_simple_string(microsec_clock::universal_time())\n\t\t<< \" ==> port map request: \" << (m.protocol == 1 ? \"udp\" : \"tcp\")\n\t\t<< \" local: \" << m.local_port << \" external: \" << m.external_port\n\t\t<< \" ttl: \" << ttl << std::endl;\n#endif\n\n\tm_socket.send_to(asio::buffer(buf, 12), m_nat_endpoint);\n\t\/\/ linear back-off instead of exponential\n\t++m_retry_count;\n\tm_send_timer.expires_from_now(milliseconds(250 * m_retry_count));\n\tm_send_timer.async_wait(bind(&natpmp::resend_request, this, i, _1));\n}\ncatch (std::exception& e)\n{\n\tstd::string err = e.what();\n}\n\nvoid natpmp::resend_request(int i, asio::error_code const& e)\n{\n\tusing boost::posix_time::hours;\n\tif (e) return;\n\tif (m_retry_count >= 9)\n\t{\n\t\tm_mappings[i].need_update = false;\n\t\t\/\/ try again in two hours\n\t\tm_mappings[i].expires\n\t\t\t= boost::posix_time::second_clock::universal_time() + hours(2);\n\t\treturn;\n\t}\n\tsend_map_request(i);\n}\n\nvoid natpmp::on_reply(asio::error_code const& e\n\t, std::size_t bytes_transferred)\n{\n\tusing namespace libtorrent::detail;\n\tusing boost::posix_time::seconds;\n\tif (e) return;\n\n\ttry\n\t{\n\n\t\tif (m_remote != m_nat_endpoint)\n\t\t{\n\t\t\tm_socket.async_receive_from(asio::buffer(&m_response_buffer, 16)\n\t\t\t\t, m_remote, bind(&natpmp::on_reply, this, _1, _2));\n\t\t\treturn;\n\t\t}\n\t\t\n\t\tm_send_timer.cancel();\n\n\t\tassert(m_currently_mapping >= 0);\n\t\tint i = m_currently_mapping;\n\t\tmapping& m = m_mappings[i];\n\n\t\tchar* in = m_response_buffer;\n\t\tint version = read_uint8(in);\n\t\tint cmd = read_uint8(in);\n\t\tint result = read_uint16(in);\n\t\tint time = read_uint32(in);\n\t\tint private_port = read_uint16(in);\n\t\tint public_port = read_uint16(in);\n\t\tint lifetime = read_uint32(in);\n\n#if defined(TORRENT_LOGGING) || defined(TORRENT_VERBOSE_LOGGING)\n\t\tm_log << to_simple_string(microsec_clock::universal_time())\n\t\t\t<< \" <== port map response: \" << (cmd - 128 == 1 ? \"udp\" : \"tcp\")\n\t\t\t<< \" local: \" << private_port << \" external: \" << public_port\n\t\t\t<< \" ttl: \" << lifetime << std::endl;\n#endif\n\n#if defined(TORRENT_LOGGING) || defined(TORRENT_VERBOSE_LOGGING)\n\t\tif (version != 0)\n\t\t{\n\t\t\tm_log << \"*** unexpected version: \" << version << std::endl;\n\t\t}\n#endif\n\n#if defined(TORRENT_LOGGING) || defined(TORRENT_VERBOSE_LOGGING)\n\t\tif (private_port != m.local_port)\n\t\t{\n\t\t\tm_log << \"*** unexpected local port: \" << private_port << std::endl;\n\t\t}\n#endif\n\n#if defined(TORRENT_LOGGING) || defined(TORRENT_VERBOSE_LOGGING)\n\t\tif (cmd != 128 + m.protocol)\n\t\t{\n\t\t\tm_log << \"*** unexpected protocol: \" << (cmd - 128) << std::endl;\n\t\t}\n#endif\n\n\t\tif (public_port == 0 || lifetime == 0)\n\t\t{\n\t\t\t\/\/ this means the mapping was\n\t\t\t\/\/ successfully closed\n\t\t\tm.local_port = 0;\n\t\t}\n\t\telse\n\t\t{\n\t\t\tm.expires = boost::posix_time::second_clock::universal_time()\n\t\t\t\t+ seconds(int(lifetime * 0.7f));\n\t\t\tm.external_port = public_port;\n\t\t}\n\t\t\n\t\tif (result != 0)\n\t\t{\n#if defined(TORRENT_LOGGING) || defined(TORRENT_VERBOSE_LOGGING)\n\t\t\tm_log << \"*** ERROR: \" << result << std::endl;\n#endif\n\t\t\tstd::stringstream errmsg;\n\t\t\terrmsg << \"NAT router reports error (\" << result << \") \";\n\t\t\tswitch (result)\n\t\t\t{\n\t\t\t\tcase 1: errmsg << \"Unsupported protocol version\"; break;\n\t\t\t\tcase 2: errmsg << \"Not authorized to create port map (enable NAT-PMP on your router)\"; break;\n\t\t\t\tcase 3: errmsg << \"Network failure\"; break;\n\t\t\t\tcase 4: errmsg << \"Out of resources\"; break;\n\t\t\t\tcase 5: errmsg << \"Unsupported opcpde\"; break;\n\t\t\t}\n\t\t\tthrow std::runtime_error(errmsg.str());\n\t\t}\n\n\t\tint tcp_port = 0;\n\t\tint udp_port = 0;\n\t\tif (m.protocol == 1) udp_port = m.external_port;\n\t\telse tcp_port = public_port;\n\t\tm_callback(tcp_port, udp_port, \"\");\n\t}\n\tcatch (std::exception& e)\n\t{\n\t\tusing boost::posix_time::hours;\n\t\t\/\/ try again in two hours\n\t\tm_mappings[m_currently_mapping].expires\n\t\t\t= boost::posix_time::second_clock::universal_time() + hours(2);\n\t\tm_callback(0, 0, e.what());\n\t}\n\tint i = m_currently_mapping;\n\tm_currently_mapping = -1;\n\tm_mappings[i].need_update = false;\n\tupdate_expiration_timer();\n\ttry_next_mapping(i);\n}\n\nvoid natpmp::update_expiration_timer()\n{\n\tusing boost::posix_time::seconds;\n\tboost::posix_time::ptime now = boost::posix_time::second_clock::universal_time();\n\tboost::posix_time::ptime min_expire = now + seconds(3600);\n\tint min_index = -1;\n\tfor (int i = 0; i < 2; ++i)\n\t\tif (m_mappings[i].expires < min_expire\n\t\t\t&& m_mappings[i].local_port != 0)\n\t\t{\n\t\t\tmin_expire = m_mappings[i].expires;\n\t\t\tmin_index = i;\n\t\t}\n\n\tif (min_index >= 0)\n\t{\n\t\tm_refresh_timer.expires_from_now(min_expire - now);\n\t\tm_refresh_timer.async_wait(bind(&natpmp::mapping_expired, this, _1, min_index));\n\t}\n}\n\nvoid natpmp::mapping_expired(asio::error_code const& e, int i)\n{\n\tif (e) return;\n#if defined(TORRENT_LOGGING) || defined(TORRENT_VERBOSE_LOGGING)\n\tm_log << \"*** mapping \" << i << \" expired, updating\" << std::endl;\n#endif\n\trefresh_mapping(i);\n}\n\nvoid natpmp::refresh_mapping(int i)\n{\n\tm_mappings[i].need_update = true;\n\tif (m_currently_mapping == -1)\n\t{\n\t\t\/\/ the socket is not currently in use\n\t\t\/\/ send out a mapping request\n\t\tm_retry_count = 0;\n\t\tsend_map_request(i);\n\t\tm_socket.async_receive_from(asio::buffer(&m_response_buffer, 16)\n\t\t\t, m_remote, bind(&natpmp::on_reply, this, _1, _2));\n\t}\n}\n\nvoid natpmp::try_next_mapping(int i)\n{\n\t++i;\n\tif (i >= 2) i = 0;\n\tif (m_mappings[i].need_update)\n\t\trefresh_mapping(i);\n}\n\nvoid natpmp::close()\n{\n\tif (m_disabled) return;\n\tfor (int i = 0; i < 2; ++i)\n\t{\n\t\tif (m_mappings[i].local_port == 0)\n\t\t\tcontinue;\n\t\tm_mappings[i].external_port = 0;\n\t\trefresh_mapping(i);\n\t}\n}\n\n<commit_msg>fixes incorrect local IP address check<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\/natpmp.hpp>\n#include <libtorrent\/io.hpp>\n#include <boost\/bind.hpp>\n#include <boost\/date_time\/posix_time\/posix_time.hpp>\n#include <asio\/ip\/host_name.hpp>\n\nusing boost::bind;\nusing namespace libtorrent;\nusing boost::posix_time::microsec_clock;\n\nnatpmp::natpmp(io_service& ios, portmap_callback_t const& cb)\n\t: m_callback(cb)\n\t, m_currently_mapping(-1)\n\t, m_retry_count(0)\n\t, m_socket(ios)\n\t, m_send_timer(ios)\n\t, m_refresh_timer(ios)\n\t, m_disabled(false)\n{\n\tm_mappings[0].protocol = 2; \/\/ tcp\n\tm_mappings[1].protocol = 1; \/\/ udp\n\n#if defined(TORRENT_LOGGING) || defined(TORRENT_VERBOSE_LOGGING)\n\tm_log.open(\"natpmp.log\", std::ios::in | std::ios::out | std::ios::trunc);\n#endif\n\t\n\tudp::resolver r(ios);\n\tudp::resolver::iterator i = r.resolve(udp::resolver::query(asio::ip::host_name(), \"0\"));\n\tfor (;i != udp::resolver_iterator(); ++i)\n\t{\n\t\tif (i->endpoint().address().is_v4()) break;\n\t}\n\n\tif (i == udp::resolver_iterator())\n\t{\n#if defined(TORRENT_LOGGING) || defined(TORRENT_VERBOSE_LOGGING)\n\t\tm_log << \"local host name did not resolve to an IPv4 address. \"\n\t\t\t\"disabling NAT-PMP\" << std::endl;\n#endif\n\t\tm_disabled = true;\n\t\treturn;\n\t}\n\n\taddress_v4 local = i->endpoint().address().to_v4();\n#if defined(TORRENT_LOGGING) || defined(TORRENT_VERBOSE_LOGGING)\n\tm_log << to_simple_string(microsec_clock::universal_time())\n\t\t<< \" local ip: \" << local.to_string() << std::endl;\n#endif\n\n\tif ((local.to_ulong() & 0xff000000) != 0x0a000000\n\t\t&& (local.to_ulong() & 0xfff00000) != 0xac100000\n\t\t&& (local.to_ulong() & 0xffff0000) != 0xc0a80000)\n\t{\n\t\t\/\/ the local address seems to be an external\n\t\t\/\/ internet address. Assume it is not behind a NAT\n#if defined(TORRENT_LOGGING) || defined(TORRENT_VERBOSE_LOGGING)\n\t\tm_log << \"not on a NAT. disabling NAT-PMP\" << std::endl;\n#endif\n\t\tm_disabled = true;\n\t\treturn;\n\t}\n\n\t\/\/ assume the router is located on the local\n\t\/\/ network as x.x.x.1\n\t\/\/ TODO: find a better way to figure out the router IP\n\tm_nat_endpoint = udp::endpoint(\n\t\taddress_v4((local.to_ulong() & 0xffffff00) | 1), 5351);\n\n#if defined(TORRENT_LOGGING) || defined(TORRENT_VERBOSE_LOGGING)\n\tm_log << \"assuming router is at: \" << m_nat_endpoint.address().to_string() << std::endl;\n#endif\n\n\tm_socket.open(udp::v4());\n\tm_socket.bind(udp::endpoint());\n}\n\nvoid natpmp::set_mappings(int tcp, int udp)\n{\n\tif (m_disabled) return;\n\tupdate_mapping(0, tcp);\n\tupdate_mapping(1, udp);\n}\n\nvoid natpmp::update_mapping(int i, int port)\n{\n\tnatpmp::mapping& m = m_mappings[i];\n\tif (port <= 0) return;\n\tif (m.local_port != port)\n\t\tm.need_update = true;\n\n\tm.local_port = port;\n\t\/\/ prefer the same external port as the local port\n\tif (m.external_port == 0) m.external_port = port;\n\n\tif (m_currently_mapping == -1)\n\t{\n\t\t\/\/ the socket is not currently in use\n\t\t\/\/ send out a mapping request\n\t\tm_retry_count = 0;\n\t\tsend_map_request(i);\n\t\tm_socket.async_receive_from(asio::buffer(&m_response_buffer, 16)\n\t\t\t, m_remote, bind(&natpmp::on_reply, this, _1, _2));\n\t}\n}\n\nvoid natpmp::send_map_request(int i) try\n{\n\tusing namespace libtorrent::detail;\n\tusing boost::posix_time::milliseconds;\n\n\tassert(m_currently_mapping == -1\n\t\t|| m_currently_mapping == i);\n\tm_currently_mapping = i;\n\tmapping& m = m_mappings[i];\n\tchar buf[12];\n\tchar* out = buf;\n\twrite_uint8(0, out); \/\/ NAT-PMP version\n\twrite_uint8(m.protocol, out); \/\/ map \"protocol\"\n\twrite_uint16(0, out); \/\/ reserved\n\twrite_uint16(m.local_port, out); \/\/ private port\n\twrite_uint16(m.external_port, out); \/\/ requested public port\n\tint ttl = m.external_port == 0 ? 0 : 3600;\n\twrite_uint32(ttl, out); \/\/ port mapping lifetime\n\n#if defined(TORRENT_LOGGING) || defined(TORRENT_VERBOSE_LOGGING)\n\tm_log << to_simple_string(microsec_clock::universal_time())\n\t\t<< \" ==> port map request: \" << (m.protocol == 1 ? \"udp\" : \"tcp\")\n\t\t<< \" local: \" << m.local_port << \" external: \" << m.external_port\n\t\t<< \" ttl: \" << ttl << std::endl;\n#endif\n\n\tm_socket.send_to(asio::buffer(buf, 12), m_nat_endpoint);\n\t\/\/ linear back-off instead of exponential\n\t++m_retry_count;\n\tm_send_timer.expires_from_now(milliseconds(250 * m_retry_count));\n\tm_send_timer.async_wait(bind(&natpmp::resend_request, this, i, _1));\n}\ncatch (std::exception& e)\n{\n\tstd::string err = e.what();\n}\n\nvoid natpmp::resend_request(int i, asio::error_code const& e)\n{\n\tusing boost::posix_time::hours;\n\tif (e) return;\n\tif (m_retry_count >= 9)\n\t{\n\t\tm_mappings[i].need_update = false;\n\t\t\/\/ try again in two hours\n\t\tm_mappings[i].expires\n\t\t\t= boost::posix_time::second_clock::universal_time() + hours(2);\n\t\treturn;\n\t}\n\tsend_map_request(i);\n}\n\nvoid natpmp::on_reply(asio::error_code const& e\n\t, std::size_t bytes_transferred)\n{\n\tusing namespace libtorrent::detail;\n\tusing boost::posix_time::seconds;\n\tif (e) return;\n\n\ttry\n\t{\n\n\t\tif (m_remote != m_nat_endpoint)\n\t\t{\n\t\t\tm_socket.async_receive_from(asio::buffer(&m_response_buffer, 16)\n\t\t\t\t, m_remote, bind(&natpmp::on_reply, this, _1, _2));\n\t\t\treturn;\n\t\t}\n\t\t\n\t\tm_send_timer.cancel();\n\n\t\tassert(m_currently_mapping >= 0);\n\t\tint i = m_currently_mapping;\n\t\tmapping& m = m_mappings[i];\n\n\t\tchar* in = m_response_buffer;\n\t\tint version = read_uint8(in);\n\t\tint cmd = read_uint8(in);\n\t\tint result = read_uint16(in);\n\t\tint time = read_uint32(in);\n\t\tint private_port = read_uint16(in);\n\t\tint public_port = read_uint16(in);\n\t\tint lifetime = read_uint32(in);\n\n#if defined(TORRENT_LOGGING) || defined(TORRENT_VERBOSE_LOGGING)\n\t\tm_log << to_simple_string(microsec_clock::universal_time())\n\t\t\t<< \" <== port map response: \" << (cmd - 128 == 1 ? \"udp\" : \"tcp\")\n\t\t\t<< \" local: \" << private_port << \" external: \" << public_port\n\t\t\t<< \" ttl: \" << lifetime << std::endl;\n#endif\n\n#if defined(TORRENT_LOGGING) || defined(TORRENT_VERBOSE_LOGGING)\n\t\tif (version != 0)\n\t\t{\n\t\t\tm_log << \"*** unexpected version: \" << version << std::endl;\n\t\t}\n#endif\n\n#if defined(TORRENT_LOGGING) || defined(TORRENT_VERBOSE_LOGGING)\n\t\tif (private_port != m.local_port)\n\t\t{\n\t\t\tm_log << \"*** unexpected local port: \" << private_port << std::endl;\n\t\t}\n#endif\n\n#if defined(TORRENT_LOGGING) || defined(TORRENT_VERBOSE_LOGGING)\n\t\tif (cmd != 128 + m.protocol)\n\t\t{\n\t\t\tm_log << \"*** unexpected protocol: \" << (cmd - 128) << std::endl;\n\t\t}\n#endif\n\n\t\tif (public_port == 0 || lifetime == 0)\n\t\t{\n\t\t\t\/\/ this means the mapping was\n\t\t\t\/\/ successfully closed\n\t\t\tm.local_port = 0;\n\t\t}\n\t\telse\n\t\t{\n\t\t\tm.expires = boost::posix_time::second_clock::universal_time()\n\t\t\t\t+ seconds(int(lifetime * 0.7f));\n\t\t\tm.external_port = public_port;\n\t\t}\n\t\t\n\t\tif (result != 0)\n\t\t{\n#if defined(TORRENT_LOGGING) || defined(TORRENT_VERBOSE_LOGGING)\n\t\t\tm_log << \"*** ERROR: \" << result << std::endl;\n#endif\n\t\t\tstd::stringstream errmsg;\n\t\t\terrmsg << \"NAT router reports error (\" << result << \") \";\n\t\t\tswitch (result)\n\t\t\t{\n\t\t\t\tcase 1: errmsg << \"Unsupported protocol version\"; break;\n\t\t\t\tcase 2: errmsg << \"Not authorized to create port map (enable NAT-PMP on your router)\"; break;\n\t\t\t\tcase 3: errmsg << \"Network failure\"; break;\n\t\t\t\tcase 4: errmsg << \"Out of resources\"; break;\n\t\t\t\tcase 5: errmsg << \"Unsupported opcpde\"; break;\n\t\t\t}\n\t\t\tthrow std::runtime_error(errmsg.str());\n\t\t}\n\n\t\tint tcp_port = 0;\n\t\tint udp_port = 0;\n\t\tif (m.protocol == 1) udp_port = m.external_port;\n\t\telse tcp_port = public_port;\n\t\tm_callback(tcp_port, udp_port, \"\");\n\t}\n\tcatch (std::exception& e)\n\t{\n\t\tusing boost::posix_time::hours;\n\t\t\/\/ try again in two hours\n\t\tm_mappings[m_currently_mapping].expires\n\t\t\t= boost::posix_time::second_clock::universal_time() + hours(2);\n\t\tm_callback(0, 0, e.what());\n\t}\n\tint i = m_currently_mapping;\n\tm_currently_mapping = -1;\n\tm_mappings[i].need_update = false;\n\tupdate_expiration_timer();\n\ttry_next_mapping(i);\n}\n\nvoid natpmp::update_expiration_timer()\n{\n\tusing boost::posix_time::seconds;\n\tboost::posix_time::ptime now = boost::posix_time::second_clock::universal_time();\n\tboost::posix_time::ptime min_expire = now + seconds(3600);\n\tint min_index = -1;\n\tfor (int i = 0; i < 2; ++i)\n\t\tif (m_mappings[i].expires < min_expire\n\t\t\t&& m_mappings[i].local_port != 0)\n\t\t{\n\t\t\tmin_expire = m_mappings[i].expires;\n\t\t\tmin_index = i;\n\t\t}\n\n\tif (min_index >= 0)\n\t{\n\t\tm_refresh_timer.expires_from_now(min_expire - now);\n\t\tm_refresh_timer.async_wait(bind(&natpmp::mapping_expired, this, _1, min_index));\n\t}\n}\n\nvoid natpmp::mapping_expired(asio::error_code const& e, int i)\n{\n\tif (e) return;\n#if defined(TORRENT_LOGGING) || defined(TORRENT_VERBOSE_LOGGING)\n\tm_log << \"*** mapping \" << i << \" expired, updating\" << std::endl;\n#endif\n\trefresh_mapping(i);\n}\n\nvoid natpmp::refresh_mapping(int i)\n{\n\tm_mappings[i].need_update = true;\n\tif (m_currently_mapping == -1)\n\t{\n\t\t\/\/ the socket is not currently in use\n\t\t\/\/ send out a mapping request\n\t\tm_retry_count = 0;\n\t\tsend_map_request(i);\n\t\tm_socket.async_receive_from(asio::buffer(&m_response_buffer, 16)\n\t\t\t, m_remote, bind(&natpmp::on_reply, this, _1, _2));\n\t}\n}\n\nvoid natpmp::try_next_mapping(int i)\n{\n\t++i;\n\tif (i >= 2) i = 0;\n\tif (m_mappings[i].need_update)\n\t\trefresh_mapping(i);\n}\n\nvoid natpmp::close()\n{\n\tif (m_disabled) return;\n\tfor (int i = 0; i < 2; ++i)\n\t{\n\t\tif (m_mappings[i].local_port == 0)\n\t\t\tcontinue;\n\t\tm_mappings[i].external_port = 0;\n\t\trefresh_mapping(i);\n\t}\n}\n\n<|endoftext|>"} {"text":"<commit_before>#include \"ncurses.hh\"\n\n#include \"display_buffer.hh\"\n#include \"register_manager.hh\"\n\n#include \"utf8_iterator.hh\"\n#include \"event_manager.hh\"\n\n#include <map>\n\n#include <signal.h>\n#include <termios.h>\n#include <sys\/ioctl.h>\n#include <fcntl.h>\n\nnamespace Kakoune\n{\n\nstatic void set_attribute(int attribute, bool on)\n{\n if (on)\n attron(attribute);\n else\n attroff(attribute);\n}\n\nstatic int nc_color(Color color)\n{\n switch (color)\n {\n case Color::Black: return COLOR_BLACK;\n case Color::Red: return COLOR_RED;\n case Color::Green: return COLOR_GREEN;\n case Color::Yellow: return COLOR_YELLOW;\n case Color::Blue: return COLOR_BLUE;\n case Color::Magenta: return COLOR_MAGENTA;\n case Color::Cyan: return COLOR_CYAN;\n case Color::White: return COLOR_WHITE;\n\n case Color::Default:\n default:\n return -1;\n }\n}\n\nstatic int get_color_pair(Color fg_color, Color bg_color)\n{\n static std::map<std::pair<Color, Color>, int> colorpairs;\n static int next_pair = 1;\n\n std::pair<Color, Color> colorpair(fg_color, bg_color);\n\n auto it = colorpairs.find(colorpair);\n if (it != colorpairs.end())\n return it->second;\n else\n {\n init_pair(next_pair, nc_color(fg_color), nc_color(bg_color));\n colorpairs[colorpair] = next_pair;\n return next_pair++;\n }\n}\n\nstatic void set_color(Color fg_color, Color bg_color)\n{\n static int current_pair = -1;\n\n if (current_pair != -1)\n attroff(COLOR_PAIR(current_pair));\n\n if (fg_color != Color::Default or bg_color != Color::Default)\n {\n current_pair = get_color_pair(fg_color, bg_color);\n attron(COLOR_PAIR(current_pair));\n }\n}\n\nstatic NCursesUI* signal_ui = nullptr;\nvoid on_term_resize(int)\n{\n int fd = open(\"\/dev\/tty\", O_RDWR);\n winsize ws;\n if (fd == -1 or ioctl(fd, TIOCGWINSZ, (void*)&ws) != 0)\n return;\n close(fd);\n resizeterm(ws.ws_row, ws.ws_col);\n ungetch(KEY_RESIZE);\n signal_ui->update_dimensions();\n EventManager::instance().force_signal(0);\n}\n\nvoid on_sigint(int)\n{\n ungetch(CTRL('c'));\n EventManager::instance().force_signal(0);\n}\n\nNCursesUI::NCursesUI()\n{\n \/\/setlocale(LC_CTYPE, \"\");\n initscr();\n cbreak();\n noecho();\n nonl();\n intrflush(stdscr, false);\n keypad(stdscr, true);\n curs_set(0);\n start_color();\n use_default_colors();\n ESCDELAY=25;\n\n m_menu_fg = get_color_pair(Color::Blue, Color::Cyan);\n m_menu_bg = get_color_pair(Color::Cyan, Color::Blue);\n\n update_dimensions();\n\n assert(signal_ui == nullptr);\n signal_ui = this;\n signal(SIGWINCH, on_term_resize);\n signal(SIGINT, on_sigint);\n}\n\nNCursesUI::~NCursesUI()\n{\n endwin();\n}\n\nstatic void redraw(WINDOW* menu_win)\n{\n wnoutrefresh(stdscr);\n if (menu_win)\n {\n redrawwin(menu_win);\n wnoutrefresh(menu_win);\n }\n doupdate();\n}\nusing Utf8Policy = utf8::InvalidBytePolicy::Pass;\nusing Utf8Iterator = utf8::utf8_iterator<String::iterator, Utf8Policy>;\nvoid addutf8str(Utf8Iterator begin, Utf8Iterator end)\n{\n assert(begin <= end);\n while (begin != end)\n addch(*begin++);\n}\n\nvoid NCursesUI::update_dimensions()\n{\n int max_x,max_y;\n getmaxyx(stdscr, max_y, max_x);\n max_y -= 1;\n m_dimensions = { max_y, max_x };\n}\n\nvoid NCursesUI::draw(const DisplayBuffer& display_buffer,\n const String& mode_line)\n{\n LineCount line_index = 0;\n for (const DisplayLine& line : display_buffer.lines())\n {\n move((int)line_index, 0);\n clrtoeol();\n CharCount col_index = 0;\n for (const DisplayAtom& atom : line)\n {\n set_attribute(A_UNDERLINE, atom.attribute & Underline);\n set_attribute(A_REVERSE, atom.attribute & Reverse);\n set_attribute(A_BLINK, atom.attribute & Blink);\n set_attribute(A_BOLD, atom.attribute & Bold);\n\n set_color(atom.fg_color, atom.bg_color);\n\n String content = atom.content.content();\n if (content[content.length()-1] == '\\n' and\n content.char_length() - 1 < m_dimensions.column - col_index)\n {\n addutf8str(Utf8Iterator(content.begin()), Utf8Iterator(content.end())-1);\n addch(' ');\n }\n else\n {\n Utf8Iterator begin(content.begin()), end(content.end());\n if (end - begin > m_dimensions.column - col_index)\n end = begin + (m_dimensions.column - col_index);\n addutf8str(begin, end);\n col_index += end - begin;\n }\n }\n ++line_index;\n }\n\n set_attribute(A_UNDERLINE, 0);\n set_attribute(A_REVERSE, 0);\n set_attribute(A_BLINK, 0);\n set_attribute(A_BOLD, 0);\n set_color(Color::Blue, Color::Black);\n for (;line_index < m_dimensions.line; ++line_index)\n {\n move((int)line_index, 0);\n clrtoeol();\n addch('~');\n }\n\n set_color(Color::Cyan, Color::Black);\n draw_status();\n CharCount status_len = mode_line.char_length();\n \/\/ only draw mode_line if it does not overlap one status line\n if (m_dimensions.column - m_status_line.char_length() > status_len + 1)\n {\n move((int)m_dimensions.line, (int)(m_dimensions.column - status_len));\n addutf8str(Utf8Iterator(mode_line.begin()),\n Utf8Iterator(mode_line.end()));\n }\n redraw(m_menu_win);\n}\n\nstruct getch_iterator\n{\n int operator*() { return getch(); }\n getch_iterator& operator++() { return *this; }\n getch_iterator& operator++(int) { return *this; }\n};\n\nbool NCursesUI::is_key_available()\n{\n timeout(0);\n const int c = getch();\n if (c != ERR)\n ungetch(c);\n timeout(-1);\n return c != ERR;\n}\n\nKey NCursesUI::get_key()\n{\n const unsigned c = getch();\n if (c > 0 and c < 27)\n {\n return {Key::Modifiers::Control, c - 1 + 'a'};\n }\n else if (c == 27)\n {\n timeout(0);\n const Codepoint new_c = getch();\n timeout(-1);\n if (new_c != ERR)\n return {Key::Modifiers::Alt, new_c};\n else\n return Key::Escape;\n }\n else switch (c)\n {\n case KEY_BACKSPACE: return Key::Backspace;\n case KEY_UP: return Key::Up;\n case KEY_DOWN: return Key::Down;\n case KEY_LEFT: return Key::Left;\n case KEY_RIGHT: return Key::Right;\n case KEY_PPAGE: return Key::PageUp;\n case KEY_NPAGE: return Key::PageDown;\n case KEY_BTAB: return Key::BackTab;\n }\n\n if (c < 256)\n {\n ungetch(c);\n return utf8::codepoint(getch_iterator{});\n }\n return Key::Invalid;\n}\n\nvoid NCursesUI::draw_status()\n{\n move((int)m_dimensions.line, 0);\n clrtoeol();\n if (m_status_cursor == -1)\n addutf8str(m_status_line.begin(), m_status_line.end());\n else\n {\n auto cursor_it = utf8::advance(m_status_line.begin(), m_status_line.end(),\n (int)m_status_cursor);\n auto end = m_status_line.end();\n addutf8str(m_status_line.begin(), cursor_it);\n set_attribute(A_REVERSE, 1);\n addch((cursor_it == end) ? ' ' : utf8::codepoint<Utf8Policy>(cursor_it));\n set_attribute(A_REVERSE, 0);\n if (cursor_it != end)\n addutf8str(utf8::next(cursor_it), end);\n }\n}\n\nvoid NCursesUI::print_status(const String& status, CharCount cursor_pos)\n{\n m_status_line = status;\n m_status_cursor = cursor_pos;\n draw_status();\n redraw(m_menu_win);\n}\n\nvoid NCursesUI::menu_show(const memoryview<String>& choices,\n const DisplayCoord& anchor, MenuStyle style)\n{\n assert(m_menu == nullptr);\n assert(m_menu_win == nullptr);\n assert(m_choices.empty());\n assert(m_items.empty());\n\n int max_x,max_y;\n getmaxyx(stdscr, max_y, max_x);\n max_x -= (int)anchor.column;\n\n m_choices.reserve(choices.size());\n CharCount longest = 0;\n for (auto& choice : choices)\n {\n m_choices.push_back(choice.substr(0_char, std::min(max_x-1, 200)));\n m_items.emplace_back(new_item(m_choices.back().c_str(), \"\"));\n longest = std::max(longest, m_choices.back().char_length());\n }\n m_items.push_back(nullptr);\n longest += 1;\n\n int columns = (style == MenuStyle::Prompt) ? (max_x \/ (int)longest) : 1;\n int lines = std::min(10, (int)ceilf((float)m_choices.size()\/columns));\n\n m_menu_pos = { anchor.line+1, anchor.column };\n if (m_menu_pos.line + lines >= max_y)\n m_menu_pos.line = anchor.line - lines;\n m_menu_size = { lines, columns == 1 ? longest : max_x };\n\n m_menu = new_menu(&m_items[0]);\n m_menu_win = newwin((int)m_menu_size.line, (int)m_menu_size.column,\n (int)m_menu_pos.line, (int)m_menu_pos.column);\n set_menu_win(m_menu, m_menu_win);\n set_menu_format(m_menu, lines, columns);\n set_menu_mark(m_menu, nullptr);\n set_menu_fore(m_menu, COLOR_PAIR(m_menu_fg));\n set_menu_back(m_menu, COLOR_PAIR(m_menu_bg));\n post_menu(m_menu);\n}\n\nvoid NCursesUI::menu_select(int selected)\n{\n \/\/ last item in m_items is the nullptr, hence the - 1\n if (selected >= 0 and selected < m_items.size() - 1)\n {\n set_menu_fore(m_menu, COLOR_PAIR(m_menu_fg));\n set_current_item(m_menu, m_items[selected]);\n }\n else\n set_menu_fore(m_menu, COLOR_PAIR(m_menu_bg));\n}\n\nvoid NCursesUI::menu_hide()\n{\n if (not m_menu)\n return;\n unpost_menu(m_menu);\n free_menu(m_menu);\n for (auto item : m_items)\n if (item)\n free_item(item);\n m_menu = nullptr;\n delwin(m_menu_win);\n m_menu_win = nullptr;\n m_items.clear();\n m_choices.clear();\n}\n\nDisplayCoord NCursesUI::dimensions()\n{\n return m_dimensions;\n}\n\n}\n<commit_msg>NCurses: use Default bg color for status line<commit_after>#include \"ncurses.hh\"\n\n#include \"display_buffer.hh\"\n#include \"register_manager.hh\"\n\n#include \"utf8_iterator.hh\"\n#include \"event_manager.hh\"\n\n#include <map>\n\n#include <signal.h>\n#include <termios.h>\n#include <sys\/ioctl.h>\n#include <fcntl.h>\n\nnamespace Kakoune\n{\n\nstatic void set_attribute(int attribute, bool on)\n{\n if (on)\n attron(attribute);\n else\n attroff(attribute);\n}\n\nstatic int nc_color(Color color)\n{\n switch (color)\n {\n case Color::Black: return COLOR_BLACK;\n case Color::Red: return COLOR_RED;\n case Color::Green: return COLOR_GREEN;\n case Color::Yellow: return COLOR_YELLOW;\n case Color::Blue: return COLOR_BLUE;\n case Color::Magenta: return COLOR_MAGENTA;\n case Color::Cyan: return COLOR_CYAN;\n case Color::White: return COLOR_WHITE;\n\n case Color::Default:\n default:\n return -1;\n }\n}\n\nstatic int get_color_pair(Color fg_color, Color bg_color)\n{\n static std::map<std::pair<Color, Color>, int> colorpairs;\n static int next_pair = 1;\n\n std::pair<Color, Color> colorpair(fg_color, bg_color);\n\n auto it = colorpairs.find(colorpair);\n if (it != colorpairs.end())\n return it->second;\n else\n {\n init_pair(next_pair, nc_color(fg_color), nc_color(bg_color));\n colorpairs[colorpair] = next_pair;\n return next_pair++;\n }\n}\n\nstatic void set_color(Color fg_color, Color bg_color)\n{\n static int current_pair = -1;\n\n if (current_pair != -1)\n attroff(COLOR_PAIR(current_pair));\n\n if (fg_color != Color::Default or bg_color != Color::Default)\n {\n current_pair = get_color_pair(fg_color, bg_color);\n attron(COLOR_PAIR(current_pair));\n }\n}\n\nstatic NCursesUI* signal_ui = nullptr;\nvoid on_term_resize(int)\n{\n int fd = open(\"\/dev\/tty\", O_RDWR);\n winsize ws;\n if (fd == -1 or ioctl(fd, TIOCGWINSZ, (void*)&ws) != 0)\n return;\n close(fd);\n resizeterm(ws.ws_row, ws.ws_col);\n ungetch(KEY_RESIZE);\n signal_ui->update_dimensions();\n EventManager::instance().force_signal(0);\n}\n\nvoid on_sigint(int)\n{\n ungetch(CTRL('c'));\n EventManager::instance().force_signal(0);\n}\n\nNCursesUI::NCursesUI()\n{\n \/\/setlocale(LC_CTYPE, \"\");\n initscr();\n cbreak();\n noecho();\n nonl();\n intrflush(stdscr, false);\n keypad(stdscr, true);\n curs_set(0);\n start_color();\n use_default_colors();\n ESCDELAY=25;\n\n m_menu_fg = get_color_pair(Color::Blue, Color::Cyan);\n m_menu_bg = get_color_pair(Color::Cyan, Color::Blue);\n\n update_dimensions();\n\n assert(signal_ui == nullptr);\n signal_ui = this;\n signal(SIGWINCH, on_term_resize);\n signal(SIGINT, on_sigint);\n}\n\nNCursesUI::~NCursesUI()\n{\n endwin();\n}\n\nstatic void redraw(WINDOW* menu_win)\n{\n wnoutrefresh(stdscr);\n if (menu_win)\n {\n redrawwin(menu_win);\n wnoutrefresh(menu_win);\n }\n doupdate();\n}\nusing Utf8Policy = utf8::InvalidBytePolicy::Pass;\nusing Utf8Iterator = utf8::utf8_iterator<String::iterator, Utf8Policy>;\nvoid addutf8str(Utf8Iterator begin, Utf8Iterator end)\n{\n assert(begin <= end);\n while (begin != end)\n addch(*begin++);\n}\n\nvoid NCursesUI::update_dimensions()\n{\n int max_x,max_y;\n getmaxyx(stdscr, max_y, max_x);\n max_y -= 1;\n m_dimensions = { max_y, max_x };\n}\n\nvoid NCursesUI::draw(const DisplayBuffer& display_buffer,\n const String& mode_line)\n{\n LineCount line_index = 0;\n for (const DisplayLine& line : display_buffer.lines())\n {\n move((int)line_index, 0);\n clrtoeol();\n CharCount col_index = 0;\n for (const DisplayAtom& atom : line)\n {\n set_attribute(A_UNDERLINE, atom.attribute & Underline);\n set_attribute(A_REVERSE, atom.attribute & Reverse);\n set_attribute(A_BLINK, atom.attribute & Blink);\n set_attribute(A_BOLD, atom.attribute & Bold);\n\n set_color(atom.fg_color, atom.bg_color);\n\n String content = atom.content.content();\n if (content[content.length()-1] == '\\n' and\n content.char_length() - 1 < m_dimensions.column - col_index)\n {\n addutf8str(Utf8Iterator(content.begin()), Utf8Iterator(content.end())-1);\n addch(' ');\n }\n else\n {\n Utf8Iterator begin(content.begin()), end(content.end());\n if (end - begin > m_dimensions.column - col_index)\n end = begin + (m_dimensions.column - col_index);\n addutf8str(begin, end);\n col_index += end - begin;\n }\n }\n ++line_index;\n }\n\n set_attribute(A_UNDERLINE, 0);\n set_attribute(A_REVERSE, 0);\n set_attribute(A_BLINK, 0);\n set_attribute(A_BOLD, 0);\n set_color(Color::Blue, Color::Black);\n for (;line_index < m_dimensions.line; ++line_index)\n {\n move((int)line_index, 0);\n clrtoeol();\n addch('~');\n }\n\n set_color(Color::Cyan, Color::Default);\n draw_status();\n CharCount status_len = mode_line.char_length();\n \/\/ only draw mode_line if it does not overlap one status line\n if (m_dimensions.column - m_status_line.char_length() > status_len + 1)\n {\n move((int)m_dimensions.line, (int)(m_dimensions.column - status_len));\n addutf8str(Utf8Iterator(mode_line.begin()),\n Utf8Iterator(mode_line.end()));\n }\n redraw(m_menu_win);\n}\n\nstruct getch_iterator\n{\n int operator*() { return getch(); }\n getch_iterator& operator++() { return *this; }\n getch_iterator& operator++(int) { return *this; }\n};\n\nbool NCursesUI::is_key_available()\n{\n timeout(0);\n const int c = getch();\n if (c != ERR)\n ungetch(c);\n timeout(-1);\n return c != ERR;\n}\n\nKey NCursesUI::get_key()\n{\n const unsigned c = getch();\n if (c > 0 and c < 27)\n {\n return {Key::Modifiers::Control, c - 1 + 'a'};\n }\n else if (c == 27)\n {\n timeout(0);\n const Codepoint new_c = getch();\n timeout(-1);\n if (new_c != ERR)\n return {Key::Modifiers::Alt, new_c};\n else\n return Key::Escape;\n }\n else switch (c)\n {\n case KEY_BACKSPACE: return Key::Backspace;\n case KEY_UP: return Key::Up;\n case KEY_DOWN: return Key::Down;\n case KEY_LEFT: return Key::Left;\n case KEY_RIGHT: return Key::Right;\n case KEY_PPAGE: return Key::PageUp;\n case KEY_NPAGE: return Key::PageDown;\n case KEY_BTAB: return Key::BackTab;\n }\n\n if (c < 256)\n {\n ungetch(c);\n return utf8::codepoint(getch_iterator{});\n }\n return Key::Invalid;\n}\n\nvoid NCursesUI::draw_status()\n{\n move((int)m_dimensions.line, 0);\n clrtoeol();\n if (m_status_cursor == -1)\n addutf8str(m_status_line.begin(), m_status_line.end());\n else\n {\n auto cursor_it = utf8::advance(m_status_line.begin(), m_status_line.end(),\n (int)m_status_cursor);\n auto end = m_status_line.end();\n addutf8str(m_status_line.begin(), cursor_it);\n set_attribute(A_REVERSE, 1);\n addch((cursor_it == end) ? ' ' : utf8::codepoint<Utf8Policy>(cursor_it));\n set_attribute(A_REVERSE, 0);\n if (cursor_it != end)\n addutf8str(utf8::next(cursor_it), end);\n }\n}\n\nvoid NCursesUI::print_status(const String& status, CharCount cursor_pos)\n{\n m_status_line = status;\n m_status_cursor = cursor_pos;\n draw_status();\n redraw(m_menu_win);\n}\n\nvoid NCursesUI::menu_show(const memoryview<String>& choices,\n const DisplayCoord& anchor, MenuStyle style)\n{\n assert(m_menu == nullptr);\n assert(m_menu_win == nullptr);\n assert(m_choices.empty());\n assert(m_items.empty());\n\n int max_x,max_y;\n getmaxyx(stdscr, max_y, max_x);\n max_x -= (int)anchor.column;\n\n m_choices.reserve(choices.size());\n CharCount longest = 0;\n for (auto& choice : choices)\n {\n m_choices.push_back(choice.substr(0_char, std::min(max_x-1, 200)));\n m_items.emplace_back(new_item(m_choices.back().c_str(), \"\"));\n longest = std::max(longest, m_choices.back().char_length());\n }\n m_items.push_back(nullptr);\n longest += 1;\n\n int columns = (style == MenuStyle::Prompt) ? (max_x \/ (int)longest) : 1;\n int lines = std::min(10, (int)ceilf((float)m_choices.size()\/columns));\n\n m_menu_pos = { anchor.line+1, anchor.column };\n if (m_menu_pos.line + lines >= max_y)\n m_menu_pos.line = anchor.line - lines;\n m_menu_size = { lines, columns == 1 ? longest : max_x };\n\n m_menu = new_menu(&m_items[0]);\n m_menu_win = newwin((int)m_menu_size.line, (int)m_menu_size.column,\n (int)m_menu_pos.line, (int)m_menu_pos.column);\n set_menu_win(m_menu, m_menu_win);\n set_menu_format(m_menu, lines, columns);\n set_menu_mark(m_menu, nullptr);\n set_menu_fore(m_menu, COLOR_PAIR(m_menu_fg));\n set_menu_back(m_menu, COLOR_PAIR(m_menu_bg));\n post_menu(m_menu);\n}\n\nvoid NCursesUI::menu_select(int selected)\n{\n \/\/ last item in m_items is the nullptr, hence the - 1\n if (selected >= 0 and selected < m_items.size() - 1)\n {\n set_menu_fore(m_menu, COLOR_PAIR(m_menu_fg));\n set_current_item(m_menu, m_items[selected]);\n }\n else\n set_menu_fore(m_menu, COLOR_PAIR(m_menu_bg));\n}\n\nvoid NCursesUI::menu_hide()\n{\n if (not m_menu)\n return;\n unpost_menu(m_menu);\n free_menu(m_menu);\n for (auto item : m_items)\n if (item)\n free_item(item);\n m_menu = nullptr;\n delwin(m_menu_win);\n m_menu_win = nullptr;\n m_items.clear();\n m_choices.clear();\n}\n\nDisplayCoord NCursesUI::dimensions()\n{\n return m_dimensions;\n}\n\n}\n<|endoftext|>"} {"text":"<commit_before>#include \"tensorflow\/core\/common_runtime\/GraphLogger.h\"\n#include \"tensorflow\/core\/framework\/step_stats.pb.h\"\nnamespace tensorflow {\n GraphLogger& GraphLogger::getInstance() {\n static GraphLogger instance;\n return instance;\n }\n\n\n vertex *GraphLogger::addvertex(const string &name)\n {\n mutex_lock l(work_mtx);\n if (work.count(name) == 0) {\n return new vertex(name);\n } else {\n cout << \"\\nVertex already exists!\";\n return work[name];\n }\n }\n\n void GraphLogger::addedge(const string &from, const string &to, double cost)\n {\n vertex *f = addvertex(from);\n vertex *t = addvertex(to);\n pair<double, vertex *> edge = make_pair(cost, t);\n \/\/f->adj_mtx.lock();\n \/\/f->adj.push_back(edge);\n \/\/f->adj_mtx.unlock();\n addadj(f, edge);\n }\n\n void GraphLogger::addadj(vertex *v, pair<double, vertex *> edge) {\n v->adj_mtx.lock();\n v->adj.push_back(edge);\n v->adj_mtx.unlock();\n }\n\n void GraphLogger::addnodes(string node_name) {\n mutex_lock l(recv_nodes_mtx);\n recv_nodes.push_back(node_name);\n }\n\n size_t GraphLogger::get_memory() {\n memory_mtx.lock();\n mutex_lock l(recv_nodes_mtx);\n memory += sizeof(work);\n memory += sizeof(recv_nodes);\n for (auto item : work) {\n item.second->adj_mtx.lock();\n memory += sizeof(*(item.second));\n item.second->adj_mtx.unlock();\n }\n size_t result = memory;\n memory_mtx.unlock();\n return result;\n }\n\n void GraphLogger::add_step_stats(NodeExecStats* nt, const Node *node)\n {\n if (nt) {\n log_mtx.lock();\n FILE *file = fopen(\"\/tmp\/step_stat.log\", \"a+\");\n fprintf(file, \"node_name: \");\n fprintf(file, nt->node_name().c_str());\n fprintf(file, \"\\n\");\n\n fprintf(file, \"all_start_micros: \");\n fprintf(file, \"%ld\", nt->all_start_micros());\n fprintf(file, \"\\n\");\n\n fprintf(file, \"op_start_rel_micros: \");\n fprintf(file, \"%ld\", nt->op_start_rel_micros());\n fprintf(file, \"\\n\");\n\n fprintf(file, \"op_end_rel_micros: \");\n fprintf(file, \"%ld\", nt->op_end_rel_micros());\n fprintf(file, \"\\n\");\n\n fprintf(file, \"all_end_rel_micros: \");\n fprintf(file, \"%ld\", nt->all_end_rel_micros());\n fprintf(file, \"\\n\");\n\n fprintf(file, \"scheduled_micros: \");\n fprintf(file, \"%ld\", nt->scheduled_micros());\n fprintf(file, \"\\n\");\n\n fprintf(file, \"schedule_start_skew: \");\n fprintf(file, \"%ld\", nt->all_start_micros()- nt->scheduled_micros());\n fprintf(file, \"\\n\");\n\n fprintf(file, \"thread_id: \");\n fprintf(file, \"%ld\", nt->thread_id());\n fprintf(file, \"\\n\");\n\n fprintf(file, \"timeline_label: \");\n fprintf(file, nt->timeline_label().c_str());\n fprintf(file, \"\\n\");\n\n fprintf(file, \"\\n\");\n fflush(file);\n\n \/\/ update the information\n vertex *v = addvertex(nt->node_name());\n v->all_start_micros = nt->all_start_micros();\n v->op_start_rel_micros = nt->op_start_rel_micros();\n v->op_end_rel_micros = nt->op_end_rel_micros();\n v->all_end_rel_micros = nt->all_end_rel_micros();\n \/\/v->total_bytes = ;\n \/\/v->peak_bytes;\n v->timeline_label = nt->timeline_label();\n v->scheduled_micros = nt->scheduled_micros();\n v->thread_id = nt->thread_id();\n\n \/\/ add informaion in node for\n \/\/ 1. sender inforamtion of receiver\n \/\/ 2. consum operation for receiver\n const NodeDef& def = node->def();\n if (IsRecv(node)) {\n string send_device;\n TF_CHECK_OK(GetNodeAttr(def, \"send_device\", &send_device));\n v->is_recv = true;\n v->sender = send_device;\n \/\/currently no mutex lock is needed now\n \/\/recv_nodes_mtx.lock();\n addnodes(nt->node_name());\n \/\/recv_nodes_mtx.unlock();\n }\n std::vector<StringPiece> inputs = std::vector<StringPiece>(def.input().begin(), def.input().end());\n for (auto& str : inputs) {\n string new_str = str.ToString();\n work_mtx.lock();\n if (work.count(new_str) == 0) {\n fprintf(file, \"[fatal]: child node done but parent haven't recorded yet\\n\");\n work_mtx.unlock();\n continue;\n }\n work_mtx.unlock();\n vertex *v_parent = addvertex(new_str);\n \/\/no gap_mtx is needed here currently\n \/\/v_parent->gap_mtx.lock();\n v_parent->minimum_gap = min(v->all_start_micros - v_parent->all_start_micros, v_parent->minimum_gap);\n \/\/v_parent->gap_mtx.unlock();\n }\n fclose(file);\n log_mtx.unlock();\n }\n }\n}\n<commit_msg>added graph logger<commit_after>#include \"tensorflow\/core\/common_runtime\/GraphLogger.h\"\n#include \"tensorflow\/core\/framework\/step_stats.pb.h\"\nnamespace tensorflow {\n\n\n vertex *GraphLogger::addvertex(const string &name)\n {\n mutex_lock l(work_mtx);\n if (work.count(name) == 0) {\n return new vertex(name);\n } else {\n cout << \"\\nVertex already exists!\";\n return work[name];\n }\n }\n\n void GraphLogger::addedge(const string &from, const string &to, double cost)\n {\n vertex *f = addvertex(from);\n vertex *t = addvertex(to);\n pair<double, vertex *> edge = make_pair(cost, t);\n \/\/f->adj_mtx.lock();\n \/\/f->adj.push_back(edge);\n \/\/f->adj_mtx.unlock();\n addadj(f, edge);\n }\n\n void GraphLogger::addadj(vertex *v, pair<double, vertex *> edge) {\n v->adj_mtx.lock();\n v->adj.push_back(edge);\n v->adj_mtx.unlock();\n }\n\n void GraphLogger::addnodes(string node_name) {\n mutex_lock l(recv_nodes_mtx);\n recv_nodes.push_back(node_name);\n }\n\n size_t GraphLogger::get_memory() {\n memory_mtx.lock();\n mutex_lock l(recv_nodes_mtx);\n memory += sizeof(work);\n memory += sizeof(recv_nodes);\n for (auto item : work) {\n item.second->adj_mtx.lock();\n memory += sizeof(*(item.second));\n item.second->adj_mtx.unlock();\n }\n size_t result = memory;\n memory_mtx.unlock();\n return result;\n }\n\n void GraphLogger::add_step_stats(NodeExecStats* nt, const Node *node)\n {\n if (nt) {\n log_mtx.lock();\n FILE *file = fopen(\"\/tmp\/step_stat.log\", \"a+\");\n fprintf(file, \"node_name: \");\n fprintf(file, nt->node_name().c_str());\n fprintf(file, \"\\n\");\n\n fprintf(file, \"all_start_micros: \");\n fprintf(file, \"%ld\", nt->all_start_micros());\n fprintf(file, \"\\n\");\n\n fprintf(file, \"op_start_rel_micros: \");\n fprintf(file, \"%ld\", nt->op_start_rel_micros());\n fprintf(file, \"\\n\");\n\n fprintf(file, \"op_end_rel_micros: \");\n fprintf(file, \"%ld\", nt->op_end_rel_micros());\n fprintf(file, \"\\n\");\n\n fprintf(file, \"all_end_rel_micros: \");\n fprintf(file, \"%ld\", nt->all_end_rel_micros());\n fprintf(file, \"\\n\");\n\n fprintf(file, \"scheduled_micros: \");\n fprintf(file, \"%ld\", nt->scheduled_micros());\n fprintf(file, \"\\n\");\n\n fprintf(file, \"schedule_start_skew: \");\n fprintf(file, \"%ld\", nt->all_start_micros()- nt->scheduled_micros());\n fprintf(file, \"\\n\");\n\n fprintf(file, \"thread_id: \");\n fprintf(file, \"%ld\", nt->thread_id());\n fprintf(file, \"\\n\");\n\n fprintf(file, \"timeline_label: \");\n fprintf(file, nt->timeline_label().c_str());\n fprintf(file, \"\\n\");\n\n fprintf(file, \"\\n\");\n fflush(file);\n\n \/\/ update the information\n vertex *v = addvertex(nt->node_name());\n v->all_start_micros = nt->all_start_micros();\n v->op_start_rel_micros = nt->op_start_rel_micros();\n v->op_end_rel_micros = nt->op_end_rel_micros();\n v->all_end_rel_micros = nt->all_end_rel_micros();\n \/\/v->total_bytes = ;\n \/\/v->peak_bytes;\n v->timeline_label = nt->timeline_label();\n v->scheduled_micros = nt->scheduled_micros();\n v->thread_id = nt->thread_id();\n\n \/\/ add informaion in node for\n \/\/ 1. sender inforamtion of receiver\n \/\/ 2. consum operation for receiver\n const NodeDef& def = node->def();\n if (IsRecv(node)) {\n string send_device;\n TF_CHECK_OK(GetNodeAttr(def, \"send_device\", &send_device));\n v->is_recv = true;\n v->sender = send_device;\n \/\/currently no mutex lock is needed now\n \/\/recv_nodes_mtx.lock();\n addnodes(nt->node_name());\n \/\/recv_nodes_mtx.unlock();\n }\n std::vector<StringPiece> inputs = std::vector<StringPiece>(def.input().begin(), def.input().end());\n for (auto& str : inputs) {\n string new_str = str.ToString();\n work_mtx.lock();\n if (work.count(new_str) == 0) {\n fprintf(file, \"[fatal]: child node done but parent haven't recorded yet\\n\");\n work_mtx.unlock();\n continue;\n }\n work_mtx.unlock();\n vertex *v_parent = addvertex(new_str);\n \/\/no gap_mtx is needed here currently\n \/\/v_parent->gap_mtx.lock();\n v_parent->minimum_gap = min(v->all_start_micros - v_parent->all_start_micros, v_parent->minimum_gap);\n \/\/v_parent->gap_mtx.unlock();\n }\n fclose(file);\n log_mtx.unlock();\n }\n }\n}\n<|endoftext|>"} {"text":"<commit_before>\/* Copyright 2016 The TensorFlow Authors All Rights Reserved.\n\nLicensed under the Apache License, Version 2.0 (the \"License\");\nyou may not use this file except in compliance with the License.\nYou may obtain a copy of the License at\n\n http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n\nUnless required by applicable law or agreed to in writing, software\ndistributed under the License is distributed on an \"AS IS\" BASIS,\nWITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\nSee the License for the specific language governing permissions and\nlimitations under the License.\n==============================================================================*\/\n\n#include \"tensorflow\/core\/profiler\/internal\/tfprof_op.h\"\n\n#include <stdio.h>\n#include <utility>\n\n#include \"tensorflow\/core\/lib\/strings\/strcat.h\"\n#include \"tensorflow\/core\/lib\/strings\/stringprintf.h\"\n#include \"tensorflow\/core\/platform\/regexp.h\"\n#include \"tensorflow\/core\/profiler\/internal\/tfprof_constants.h\"\n#include \"tensorflow\/core\/profiler\/internal\/tfprof_tensor.h\"\n\nnamespace tensorflow {\nnamespace tfprof {\nnamespace {\nstring FormatToalExecTime(const ShowMultiNode* node,\n const ShowMultiNode* root) {\n double accu_pct = 0.0;\n double pct = 0.0;\n if (node->proto().total_exec_micros() > 0) {\n accu_pct = 100.0 * node->proto().total_exec_micros() \/\n root->proto().total_exec_micros();\n pct =\n 100.0 * node->proto().exec_micros() \/ root->proto().total_exec_micros();\n }\n\n return strings::Printf(\n \"%30s\", strings::Printf(\"%s (%.2f%%, %.2f%%)\",\n FormatTime(node->proto().exec_micros()).c_str(),\n accu_pct, pct)\n .c_str());\n}\nstring FormatCPUExecTime(const ShowMultiNode* node, const ShowMultiNode* root) {\n double accu_pct = 0.0;\n double pct = 0.0;\n if (node->proto().total_cpu_exec_micros() > 0) {\n accu_pct = 100.0 * node->proto().total_cpu_exec_micros() \/\n root->proto().total_cpu_exec_micros();\n pct = 100.0 * node->proto().cpu_exec_micros() \/\n root->proto().total_cpu_exec_micros();\n }\n\n return strings::Printf(\n \"%30s\",\n strings::Printf(\"%s (%.2f%%, %.2f%%)\",\n FormatTime(node->proto().cpu_exec_micros()).c_str(),\n accu_pct, pct)\n .c_str());\n}\nstring FormatAcceleratorExecTime(const ShowMultiNode* node,\n const ShowMultiNode* root) {\n double accu_pct = 0.0;\n double pct = 0.0;\n if (node->proto().total_accelerator_exec_micros() > 0) {\n accu_pct = 100.0 * node->proto().total_accelerator_exec_micros() \/\n root->proto().total_accelerator_exec_micros();\n pct = 100.0 * node->proto().accelerator_exec_micros() \/\n root->proto().total_accelerator_exec_micros();\n }\n\n return strings::Printf(\n \"%30s\", strings::Printf(\n \"%s (%.2f%%, %.2f%%)\",\n FormatTime(node->proto().accelerator_exec_micros()).c_str(),\n accu_pct, pct)\n .c_str());\n}\n} \/\/ namespace\n\nvoid TFOp::AddNode(TFGraphNode* node) {\n const string& op = node->op();\n if (tfcnodes_map_.find(op) == tfcnodes_map_.end()) {\n tfcnodes_map_[op] =\n std::unique_ptr<TFMultiGraphNode>(new TFMultiGraphNode(op));\n }\n TFMultiGraphNode* tfcnode = tfcnodes_map_[op].get();\n tfcnode->AddGraphNode(node);\n}\n\nvoid TFOp::Build() {\n for (auto& tn : tfcnodes_map_) {\n cnodes_map_[tn.first] =\n std::unique_ptr<OpNode>(new OpNode(tn.second.get()));\n }\n\n tfcnodes_map_[kTFProfRoot] =\n std::unique_ptr<TFMultiGraphNode>(new TFMultiGraphNode(kTFProfRoot));\n root_.reset(new OpNode(tfcnodes_map_[kTFProfRoot].get()));\n}\n\nconst ShowMultiNode* TFOp::ShowInternal(const Options& opts,\n Timeline* timeline) {\n root_->ResetTotalStats();\n if (opts.output_type == kOutput[3]) {\n fprintf(stderr, \"Only 'code' view supports pprof output now.\\n\");\n return root_.get();\n }\n if (opts.output_type == kOutput[1] || opts.output_type == kOutput[2]) {\n root_->formatted_str = FormatNode(root_.get(), root_.get(), opts);\n }\n if (timeline) {\n fprintf(stderr,\n \"op view doesn't support timeline yet. \"\n \"Consider graph\/scope\/code view.\\n\");\n return root_.get();\n }\n if (cnodes_map_.empty()) {\n return root_.get();\n }\n\n std::vector<OpNode*> nodes;\n for (auto& n : cnodes_map_) {\n n.second->account = ReAccount(n.second.get(), opts);\n n.second->ResetTotalStats();\n n.second->AddSelfToTotalStats();\n nodes.push_back(n.second.get());\n }\n nodes = SortNodes(nodes, opts);\n \/\/ pre keeps track of previous visited node.\n OpNode* pre = nullptr;\n std::vector<OpNode*> account_nodes;\n for (auto it = nodes.rbegin(); it != nodes.rend(); ++it) {\n if ((*it)->account) {\n if (pre) (*it)->AggregateTotalStats(pre);\n account_nodes.push_back(*it);\n pre = *it;\n }\n }\n std::reverse(std::begin(account_nodes), std::end(account_nodes));\n if (pre) {\n root_->AggregateTotalStats(pre);\n }\n\n \/\/ Perform the display and optionally redo accounting.\n int64 depth = 0;\n std::vector<OpNode*> show_nodes;\n int64 start = SearchRoot(account_nodes, opts.start_name_regexes);\n for (int64 i = start; i < account_nodes.size(); ++i, ++depth) {\n OpNode* n = account_nodes[i];\n if (ShouldTrim(n, opts.trim_name_regexes) || depth > opts.max_depth) {\n break;\n }\n n->show = ShouldShow(n, opts, depth);\n if (n->show) show_nodes.push_back(n);\n }\n\n pre = nullptr;\n for (auto it = show_nodes.rbegin(); it != show_nodes.rend(); ++it) {\n if (opts.account_displayed_op_only) {\n (*it)->ResetTotalStats();\n (*it)->AddSelfToTotalStats();\n if (pre) (*it)->AggregateTotalStats(pre);\n }\n pre = *it;\n }\n if (opts.account_displayed_op_only) {\n root_->ResetTotalStats();\n if (pre) {\n root_->AggregateTotalStats(pre);\n }\n }\n if (opts.output_type == kOutput[1] || opts.output_type == kOutput[2]) {\n string display_str = FormatLegend(opts);\n for (OpNode* node : show_nodes) {\n display_str += FormatNode(node, root_.get(), opts);\n }\n \/\/ In op view, we don't show root (total). But it will still in proto.\n \/\/ TODO(xpan): Is it the right choice?\n root_->formatted_str = display_str;\n }\n \/\/ Populate the chidren field.\n auto* pre_pb = root_->mutable_proto();\n for (auto& show_node : show_nodes) {\n pre_pb->clear_children();\n pre_pb->add_children()->Swap(show_node->mutable_proto());\n pre_pb = pre_pb->mutable_children(0);\n }\n return root_.get();\n}\n\nint64 TFOp::SearchRoot(const std::vector<OpNode*> nodes,\n const std::vector<string>& regexes) {\n if (regexes.empty() || (regexes.size() == 1 && regexes[0] == \".*\")) {\n return 0;\n }\n int64 i = 0;\n for (; i < nodes.size(); ++i) {\n for (const string& regex : regexes) {\n if (RE2::FullMatch(nodes[i]->name(), regex)) {\n return i;\n }\n }\n }\n return i;\n}\n\nstring TFOp::FormatMemoryNode(int64 node_total_bytes, int64 root_total_bytes,\n int64 node_bytes) const {\n double accu_pct = 0.0;\n double pct = 0.0;\n if (node_bytes > 0) {\n accu_pct = 100.0 * node_total_bytes \/ root_total_bytes;\n pct = 100.0 * node_bytes \/ root_total_bytes;\n }\n return strings::Printf(\n \"%30s\", strings::Printf(\"%s (%.2f%%, %.2f%%)\",\n FormatMemory(node_bytes).c_str(), accu_pct, pct)\n .c_str());\n}\n\nstring TFOp::FormatNode(OpNode* node, OpNode* root, const Options& opts) const {\n std::vector<string> attrs;\n\n if (opts.select.find(kShown[0]) != opts.select.end()) {\n attrs.push_back(FormatMemoryNode(node->proto().total_requested_bytes(),\n root->proto().total_requested_bytes(),\n node->proto().requested_bytes()));\n }\n\n if (opts.select.find(kShown[11]) != opts.select.end()) {\n attrs.push_back(FormatMemoryNode(node->proto().total_peak_bytes(),\n root->proto().total_peak_bytes(),\n node->proto().peak_bytes()));\n }\n\n if (opts.select.find(kShown[12]) != opts.select.end()) {\n attrs.push_back(FormatMemoryNode(node->proto().total_residual_bytes(),\n root->proto().total_residual_bytes(),\n node->proto().residual_bytes()));\n }\n if (opts.select.find(kShown[13]) != opts.select.end()) {\n attrs.push_back(FormatMemoryNode(node->proto().total_output_bytes(),\n root->proto().total_output_bytes(),\n node->proto().output_bytes()));\n }\n\n if (opts.select.find(kShown[1]) != opts.select.end()) {\n attrs.push_back(FormatToalExecTime(node, root));\n attrs.push_back(FormatAcceleratorExecTime(node, root));\n attrs.push_back(FormatCPUExecTime(node, root));\n }\n if (opts.select.find(kShown[9]) != opts.select.end() &&\n opts.select.find(kShown[1]) == opts.select.end()) {\n attrs.push_back(FormatAcceleratorExecTime(node, root));\n }\n if (opts.select.find(kShown[10]) != opts.select.end() &&\n opts.select.find(kShown[1]) == opts.select.end()) {\n attrs.push_back(FormatCPUExecTime(node, root));\n }\n if (opts.select.find(kShown[2]) != opts.select.end()) {\n double accu_pct = 0.0;\n double pct = 0.0;\n if (node->proto().total_parameters() > 0) {\n accu_pct = 100.0 * node->proto().total_parameters() \/\n root->proto().total_parameters();\n pct =\n 100.0 * node->proto().parameters() \/ root->proto().total_parameters();\n }\n attrs.push_back(strings::Printf(\n \"%30s\",\n strings::Printf(\"%s params (%.2f%%, %.2f%%)\",\n FormatNumber(node->proto().parameters()).c_str(),\n accu_pct, pct)\n .c_str()));\n }\n\n if (opts.select.find(kShown[3]) != opts.select.end()) {\n double accu_pct = 0.0;\n double pct = 0.0;\n if (node->proto().total_float_ops() > 0) {\n accu_pct = 100.0 * node->proto().total_float_ops() \/\n root->proto().total_float_ops();\n pct = 100.0 * node->proto().float_ops() \/ root->proto().total_float_ops();\n }\n\n attrs.push_back(strings::Printf(\n \"%30s\", strings::Printf(\"%s float_ops (%.2f%%, %.2f%%)\",\n FormatNumber(node->proto().float_ops()).c_str(),\n accu_pct, pct)\n .c_str()));\n }\n\n if (opts.select.find(kShown[5]) != opts.select.end()) {\n attrs.push_back(str_util::Join(node->node->devices(), \"|\"));\n }\n\n if (opts.select.find(kShown[6]) != opts.select.end()) {\n std::set<string> op_types = node->node->op_types();\n attrs.push_back(str_util::Join(op_types, \"|\"));\n }\n\n if (opts.select.find(kShown[7]) != opts.select.end()) {\n int64 total_runs = 0;\n for (const auto& gnode : node->proto().graph_nodes()) {\n total_runs += gnode.run_count();\n }\n attrs.push_back(strings::Printf(\n \"%10s\",\n strings::Printf(\"%lld|%d\", total_runs, node->proto().graph_nodes_size())\n .c_str()));\n }\n\n string node_str = strings::Printf(\"%-25s%s\\n\", node->name().c_str(),\n str_util::Join(attrs, \", \").c_str());\n\n if (opts.select.find(kShown[8]) != opts.select.end()) {\n string input_shape_str = FormatInputShapes(node->proto());\n if (!input_shape_str.empty()) {\n node_str = strings::Printf(\"%s\\n%s\\n\\n\", node_str.c_str(),\n input_shape_str.c_str());\n }\n }\n return node_str;\n}\n} \/\/ namespace tfprof\n} \/\/ namespace tensorflow\n<commit_msg>Fixed typo<commit_after>\/* Copyright 2016 The TensorFlow Authors All Rights Reserved.\n\nLicensed under the Apache License, Version 2.0 (the \"License\");\nyou may not use this file except in compliance with the License.\nYou may obtain a copy of the License at\n\n http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n\nUnless required by applicable law or agreed to in writing, software\ndistributed under the License is distributed on an \"AS IS\" BASIS,\nWITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\nSee the License for the specific language governing permissions and\nlimitations under the License.\n==============================================================================*\/\n\n#include \"tensorflow\/core\/profiler\/internal\/tfprof_op.h\"\n\n#include <stdio.h>\n#include <utility>\n\n#include \"tensorflow\/core\/lib\/strings\/strcat.h\"\n#include \"tensorflow\/core\/lib\/strings\/stringprintf.h\"\n#include \"tensorflow\/core\/platform\/regexp.h\"\n#include \"tensorflow\/core\/profiler\/internal\/tfprof_constants.h\"\n#include \"tensorflow\/core\/profiler\/internal\/tfprof_tensor.h\"\n\nnamespace tensorflow {\nnamespace tfprof {\nnamespace {\nstring FormatToalExecTime(const ShowMultiNode* node,\n const ShowMultiNode* root) {\n double accu_pct = 0.0;\n double pct = 0.0;\n if (node->proto().total_exec_micros() > 0) {\n accu_pct = 100.0 * node->proto().total_exec_micros() \/\n root->proto().total_exec_micros();\n pct =\n 100.0 * node->proto().exec_micros() \/ root->proto().total_exec_micros();\n }\n\n return strings::Printf(\n \"%30s\", strings::Printf(\"%s (%.2f%%, %.2f%%)\",\n FormatTime(node->proto().exec_micros()).c_str(),\n accu_pct, pct)\n .c_str());\n}\nstring FormatCPUExecTime(const ShowMultiNode* node, const ShowMultiNode* root) {\n double accu_pct = 0.0;\n double pct = 0.0;\n if (node->proto().total_cpu_exec_micros() > 0) {\n accu_pct = 100.0 * node->proto().total_cpu_exec_micros() \/\n root->proto().total_cpu_exec_micros();\n pct = 100.0 * node->proto().cpu_exec_micros() \/\n root->proto().total_cpu_exec_micros();\n }\n\n return strings::Printf(\n \"%30s\",\n strings::Printf(\"%s (%.2f%%, %.2f%%)\",\n FormatTime(node->proto().cpu_exec_micros()).c_str(),\n accu_pct, pct)\n .c_str());\n}\nstring FormatAcceleratorExecTime(const ShowMultiNode* node,\n const ShowMultiNode* root) {\n double accu_pct = 0.0;\n double pct = 0.0;\n if (node->proto().total_accelerator_exec_micros() > 0) {\n accu_pct = 100.0 * node->proto().total_accelerator_exec_micros() \/\n root->proto().total_accelerator_exec_micros();\n pct = 100.0 * node->proto().accelerator_exec_micros() \/\n root->proto().total_accelerator_exec_micros();\n }\n\n return strings::Printf(\n \"%30s\", strings::Printf(\n \"%s (%.2f%%, %.2f%%)\",\n FormatTime(node->proto().accelerator_exec_micros()).c_str(),\n accu_pct, pct)\n .c_str());\n}\n} \/\/ namespace\n\nvoid TFOp::AddNode(TFGraphNode* node) {\n const string& op = node->op();\n if (tfcnodes_map_.find(op) == tfcnodes_map_.end()) {\n tfcnodes_map_[op] =\n std::unique_ptr<TFMultiGraphNode>(new TFMultiGraphNode(op));\n }\n TFMultiGraphNode* tfcnode = tfcnodes_map_[op].get();\n tfcnode->AddGraphNode(node);\n}\n\nvoid TFOp::Build() {\n for (auto& tn : tfcnodes_map_) {\n cnodes_map_[tn.first] =\n std::unique_ptr<OpNode>(new OpNode(tn.second.get()));\n }\n\n tfcnodes_map_[kTFProfRoot] =\n std::unique_ptr<TFMultiGraphNode>(new TFMultiGraphNode(kTFProfRoot));\n root_.reset(new OpNode(tfcnodes_map_[kTFProfRoot].get()));\n}\n\nconst ShowMultiNode* TFOp::ShowInternal(const Options& opts,\n Timeline* timeline) {\n root_->ResetTotalStats();\n if (opts.output_type == kOutput[3]) {\n fprintf(stderr, \"Only 'code' view supports pprof output now.\\n\");\n return root_.get();\n }\n if (opts.output_type == kOutput[1] || opts.output_type == kOutput[2]) {\n root_->formatted_str = FormatNode(root_.get(), root_.get(), opts);\n }\n if (timeline) {\n fprintf(stderr,\n \"op view doesn't support timeline yet. \"\n \"Consider graph\/scope\/code view.\\n\");\n return root_.get();\n }\n if (cnodes_map_.empty()) {\n return root_.get();\n }\n\n std::vector<OpNode*> nodes;\n for (auto& n : cnodes_map_) {\n n.second->account = ReAccount(n.second.get(), opts);\n n.second->ResetTotalStats();\n n.second->AddSelfToTotalStats();\n nodes.push_back(n.second.get());\n }\n nodes = SortNodes(nodes, opts);\n \/\/ pre keeps track of previous visited node.\n OpNode* pre = nullptr;\n std::vector<OpNode*> account_nodes;\n for (auto it = nodes.rbegin(); it != nodes.rend(); ++it) {\n if ((*it)->account) {\n if (pre) (*it)->AggregateTotalStats(pre);\n account_nodes.push_back(*it);\n pre = *it;\n }\n }\n std::reverse(std::begin(account_nodes), std::end(account_nodes));\n if (pre) {\n root_->AggregateTotalStats(pre);\n }\n\n \/\/ Perform the display and optionally redo accounting.\n int64 depth = 0;\n std::vector<OpNode*> show_nodes;\n int64 start = SearchRoot(account_nodes, opts.start_name_regexes);\n for (int64 i = start; i < account_nodes.size(); ++i, ++depth) {\n OpNode* n = account_nodes[i];\n if (ShouldTrim(n, opts.trim_name_regexes) || depth > opts.max_depth) {\n break;\n }\n n->show = ShouldShow(n, opts, depth);\n if (n->show) show_nodes.push_back(n);\n }\n\n pre = nullptr;\n for (auto it = show_nodes.rbegin(); it != show_nodes.rend(); ++it) {\n if (opts.account_displayed_op_only) {\n (*it)->ResetTotalStats();\n (*it)->AddSelfToTotalStats();\n if (pre) (*it)->AggregateTotalStats(pre);\n }\n pre = *it;\n }\n if (opts.account_displayed_op_only) {\n root_->ResetTotalStats();\n if (pre) {\n root_->AggregateTotalStats(pre);\n }\n }\n if (opts.output_type == kOutput[1] || opts.output_type == kOutput[2]) {\n string display_str = FormatLegend(opts);\n for (OpNode* node : show_nodes) {\n display_str += FormatNode(node, root_.get(), opts);\n }\n \/\/ In op view, we don't show root (total). But it will still in proto.\n \/\/ TODO(xpan): Is it the right choice?\n root_->formatted_str = display_str;\n }\n \/\/ Populate the children field.\n auto* pre_pb = root_->mutable_proto();\n for (auto& show_node : show_nodes) {\n pre_pb->clear_children();\n pre_pb->add_children()->Swap(show_node->mutable_proto());\n pre_pb = pre_pb->mutable_children(0);\n }\n return root_.get();\n}\n\nint64 TFOp::SearchRoot(const std::vector<OpNode*> nodes,\n const std::vector<string>& regexes) {\n if (regexes.empty() || (regexes.size() == 1 && regexes[0] == \".*\")) {\n return 0;\n }\n int64 i = 0;\n for (; i < nodes.size(); ++i) {\n for (const string& regex : regexes) {\n if (RE2::FullMatch(nodes[i]->name(), regex)) {\n return i;\n }\n }\n }\n return i;\n}\n\nstring TFOp::FormatMemoryNode(int64 node_total_bytes, int64 root_total_bytes,\n int64 node_bytes) const {\n double accu_pct = 0.0;\n double pct = 0.0;\n if (node_bytes > 0) {\n accu_pct = 100.0 * node_total_bytes \/ root_total_bytes;\n pct = 100.0 * node_bytes \/ root_total_bytes;\n }\n return strings::Printf(\n \"%30s\", strings::Printf(\"%s (%.2f%%, %.2f%%)\",\n FormatMemory(node_bytes).c_str(), accu_pct, pct)\n .c_str());\n}\n\nstring TFOp::FormatNode(OpNode* node, OpNode* root, const Options& opts) const {\n std::vector<string> attrs;\n\n if (opts.select.find(kShown[0]) != opts.select.end()) {\n attrs.push_back(FormatMemoryNode(node->proto().total_requested_bytes(),\n root->proto().total_requested_bytes(),\n node->proto().requested_bytes()));\n }\n\n if (opts.select.find(kShown[11]) != opts.select.end()) {\n attrs.push_back(FormatMemoryNode(node->proto().total_peak_bytes(),\n root->proto().total_peak_bytes(),\n node->proto().peak_bytes()));\n }\n\n if (opts.select.find(kShown[12]) != opts.select.end()) {\n attrs.push_back(FormatMemoryNode(node->proto().total_residual_bytes(),\n root->proto().total_residual_bytes(),\n node->proto().residual_bytes()));\n }\n if (opts.select.find(kShown[13]) != opts.select.end()) {\n attrs.push_back(FormatMemoryNode(node->proto().total_output_bytes(),\n root->proto().total_output_bytes(),\n node->proto().output_bytes()));\n }\n\n if (opts.select.find(kShown[1]) != opts.select.end()) {\n attrs.push_back(FormatToalExecTime(node, root));\n attrs.push_back(FormatAcceleratorExecTime(node, root));\n attrs.push_back(FormatCPUExecTime(node, root));\n }\n if (opts.select.find(kShown[9]) != opts.select.end() &&\n opts.select.find(kShown[1]) == opts.select.end()) {\n attrs.push_back(FormatAcceleratorExecTime(node, root));\n }\n if (opts.select.find(kShown[10]) != opts.select.end() &&\n opts.select.find(kShown[1]) == opts.select.end()) {\n attrs.push_back(FormatCPUExecTime(node, root));\n }\n if (opts.select.find(kShown[2]) != opts.select.end()) {\n double accu_pct = 0.0;\n double pct = 0.0;\n if (node->proto().total_parameters() > 0) {\n accu_pct = 100.0 * node->proto().total_parameters() \/\n root->proto().total_parameters();\n pct =\n 100.0 * node->proto().parameters() \/ root->proto().total_parameters();\n }\n attrs.push_back(strings::Printf(\n \"%30s\",\n strings::Printf(\"%s params (%.2f%%, %.2f%%)\",\n FormatNumber(node->proto().parameters()).c_str(),\n accu_pct, pct)\n .c_str()));\n }\n\n if (opts.select.find(kShown[3]) != opts.select.end()) {\n double accu_pct = 0.0;\n double pct = 0.0;\n if (node->proto().total_float_ops() > 0) {\n accu_pct = 100.0 * node->proto().total_float_ops() \/\n root->proto().total_float_ops();\n pct = 100.0 * node->proto().float_ops() \/ root->proto().total_float_ops();\n }\n\n attrs.push_back(strings::Printf(\n \"%30s\", strings::Printf(\"%s float_ops (%.2f%%, %.2f%%)\",\n FormatNumber(node->proto().float_ops()).c_str(),\n accu_pct, pct)\n .c_str()));\n }\n\n if (opts.select.find(kShown[5]) != opts.select.end()) {\n attrs.push_back(str_util::Join(node->node->devices(), \"|\"));\n }\n\n if (opts.select.find(kShown[6]) != opts.select.end()) {\n std::set<string> op_types = node->node->op_types();\n attrs.push_back(str_util::Join(op_types, \"|\"));\n }\n\n if (opts.select.find(kShown[7]) != opts.select.end()) {\n int64 total_runs = 0;\n for (const auto& gnode : node->proto().graph_nodes()) {\n total_runs += gnode.run_count();\n }\n attrs.push_back(strings::Printf(\n \"%10s\",\n strings::Printf(\"%lld|%d\", total_runs, node->proto().graph_nodes_size())\n .c_str()));\n }\n\n string node_str = strings::Printf(\"%-25s%s\\n\", node->name().c_str(),\n str_util::Join(attrs, \", \").c_str());\n\n if (opts.select.find(kShown[8]) != opts.select.end()) {\n string input_shape_str = FormatInputShapes(node->proto());\n if (!input_shape_str.empty()) {\n node_str = strings::Printf(\"%s\\n%s\\n\\n\", node_str.c_str(),\n input_shape_str.c_str());\n }\n }\n return node_str;\n}\n} \/\/ namespace tfprof\n} \/\/ namespace tensorflow\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 \"Ping.hxx\"\n#include \"system\/Error.hxx\"\n#include \"net\/IPv4Address.hxx\"\n#include \"net\/SocketAddress.hxx\"\n#include \"net\/SendMessage.hxx\"\n#include \"event\/Duration.hxx\"\n\n#include <sys\/socket.h>\n#include <errno.h>\n#include <string.h>\n#include <netinet\/in.h>\n#include <netinet\/ip_icmp.h>\n#include <unistd.h>\n\nPingClient::PingClient(EventLoop &event_loop, PingClientHandler &_handler)\n :event(event_loop, -1, 0, BIND_THIS_METHOD(EventCallback)),\n handler(_handler)\n{\n}\n\ninline void\nPingClient::ScheduleRead()\n{\n event.Add(EventDuration<10>::value);\n}\n\nstatic u_short\nin_cksum(const u_short *addr, register int len, u_short csum)\n{\n\tint nleft = len;\n\tconst u_short *w = addr;\n\tu_short answer;\n\tint sum = csum;\n\n\t\/*\n\t * Our algorithm is simple, using a 32 bit accumulator (sum),\n\t * we add sequential 16 bit words to it, and at the end, fold\n\t * back all the carry bits from the top 16 bits into the lower\n\t * 16 bits.\n\t *\/\n\twhile (nleft > 1) {\n\t\tsum += *w++;\n\t\tnleft -= 2;\n\t}\n\n\t\/* mop up an odd byte, if necessary *\/\n\tif (nleft == 1)\n\t\tsum += htons(*(const u_char *)w << 8);\n\n\t\/*\n\t * add back carry outs from top 16 bits to low 16 bits\n\t *\/\n\tsum = (sum >> 16) + (sum & 0xffff);\t\/* add hi 16 to low 16 *\/\n\tsum += (sum >> 16);\t\t\t\/* add carry *\/\n\tanswer = ~sum;\t\t\t\t\/* truncate to 16 bits *\/\n\treturn (answer);\n}\n\nstatic bool\nparse_reply(struct msghdr *msg, size_t cc, uint16_t ident)\n{\n const void *buf = (const void *)msg->msg_iov->iov_base;\n const struct icmphdr *icp = (const struct icmphdr *)buf;\n if (cc < sizeof(*icp))\n return false;\n\n return icp->type == ICMP_ECHOREPLY && icp->un.echo.id == ident;\n}\n\ninline void\nPingClient::Read()\n{\n char buffer[1024];\n struct iovec iov = {\n .iov_base = buffer,\n .iov_len = sizeof(buffer),\n };\n\n struct msghdr msg;\n memset(&msg, 0, sizeof(msg));\n\n char addrbuf[128];\n msg.msg_name = addrbuf;\n msg.msg_namelen = sizeof(addrbuf);\n msg.msg_iov = &iov;\n msg.msg_iovlen = 1;\n char ans_data[4096];\n msg.msg_control = ans_data;\n msg.msg_controllen = sizeof(ans_data);\n\n int cc = recvmsg(fd.Get(), &msg, MSG_DONTWAIT);\n if (cc >= 0) {\n if (parse_reply(&msg, cc, ident)) {\n fd.Close();\n handler.PingResponse();\n } else\n ScheduleRead();\n } else if (errno == EAGAIN || errno == EINTR) {\n ScheduleRead();\n } else {\n const int e = errno;\n fd.Close();\n handler.PingError(std::make_exception_ptr(MakeErrno(e)));\n }\n}\n\n\n\/*\n * libevent callback\n *\n *\/\n\ninline void\nPingClient::EventCallback(unsigned events)\n{\n assert(fd.IsDefined());\n\n if (events & SocketEvent::READ) {\n Read();\n } else {\n fd.Close();\n handler.PingTimeout();\n }\n}\n\n\/*\n * constructor\n *\n *\/\n\nbool\nping_available(void)\n{\n int fd = socket(AF_INET, SOCK_DGRAM, IPPROTO_ICMP);\n if (fd < 0)\n return false;\n close(fd);\n return true;\n}\n\nstatic UniqueSocketDescriptor\nCreateIcmp()\n{\n UniqueSocketDescriptor fd;\n if (!fd.CreateNonBlock(AF_INET, SOCK_DGRAM, IPPROTO_ICMP))\n throw MakeErrno(\"Failed to create ICMP socket\");\n\n return fd;\n}\n\nstatic uint16_t\nMakeIdent(SocketDescriptor fd)\n{\n if (!fd.Bind(IPv4Address(0)))\n throw MakeErrno(\"Failed to bind ICMP socket\");\n\n struct sockaddr_in sin;\n sin.sin_family = AF_INET;\n sin.sin_addr.s_addr = 0;\n socklen_t sin_length = sizeof(sin);\n\n if (getsockname(fd.Get(), (struct sockaddr *)&sin, &sin_length) < 0)\n throw MakeErrno(\"Failed to inspect ICMP socket\");\n\n return sin.sin_port;\n}\n\nstatic void\nSendPing(SocketDescriptor fd, SocketAddress address, uint16_t ident)\n{\n struct {\n struct icmphdr header;\n char data[8];\n } packet;\n\n packet.header.type = ICMP_ECHO;\n packet.header.code = 0;\n packet.header.checksum = 0;\n packet.header.un.echo.sequence = htons(1);\n packet.header.un.echo.id = ident;\n memset(packet.data, 0, sizeof(packet.data));\n packet.header.checksum = in_cksum((u_short *)&packet, sizeof(packet), 0);\n\n struct iovec iov = {\n .iov_base = &packet,\n .iov_len = sizeof(packet),\n };\n\n SendMessage(fd,\n MessageHeader(ConstBuffer<struct iovec>(&iov, 1))\n .SetAddress(address), 0);\n}\n\nvoid\nPingClient::Start(SocketAddress address)\n{\n try {\n fd = CreateIcmp();\n ident = MakeIdent(fd);\n SendPing(fd, address, ident);\n } catch (...) {\n handler.PingError(std::current_exception());\n return;\n }\n\n ScheduleRead();\n}\n<commit_msg>net\/Ping: remove deprecated `register` keyword<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 \"Ping.hxx\"\n#include \"system\/Error.hxx\"\n#include \"net\/IPv4Address.hxx\"\n#include \"net\/SocketAddress.hxx\"\n#include \"net\/SendMessage.hxx\"\n#include \"event\/Duration.hxx\"\n\n#include <sys\/socket.h>\n#include <errno.h>\n#include <string.h>\n#include <netinet\/in.h>\n#include <netinet\/ip_icmp.h>\n#include <unistd.h>\n\nPingClient::PingClient(EventLoop &event_loop, PingClientHandler &_handler)\n :event(event_loop, -1, 0, BIND_THIS_METHOD(EventCallback)),\n handler(_handler)\n{\n}\n\ninline void\nPingClient::ScheduleRead()\n{\n event.Add(EventDuration<10>::value);\n}\n\nstatic u_short\nin_cksum(const u_short *addr, int len, u_short csum)\n{\n\tint nleft = len;\n\tconst u_short *w = addr;\n\tu_short answer;\n\tint sum = csum;\n\n\t\/*\n\t * Our algorithm is simple, using a 32 bit accumulator (sum),\n\t * we add sequential 16 bit words to it, and at the end, fold\n\t * back all the carry bits from the top 16 bits into the lower\n\t * 16 bits.\n\t *\/\n\twhile (nleft > 1) {\n\t\tsum += *w++;\n\t\tnleft -= 2;\n\t}\n\n\t\/* mop up an odd byte, if necessary *\/\n\tif (nleft == 1)\n\t\tsum += htons(*(const u_char *)w << 8);\n\n\t\/*\n\t * add back carry outs from top 16 bits to low 16 bits\n\t *\/\n\tsum = (sum >> 16) + (sum & 0xffff);\t\/* add hi 16 to low 16 *\/\n\tsum += (sum >> 16);\t\t\t\/* add carry *\/\n\tanswer = ~sum;\t\t\t\t\/* truncate to 16 bits *\/\n\treturn (answer);\n}\n\nstatic bool\nparse_reply(struct msghdr *msg, size_t cc, uint16_t ident)\n{\n const void *buf = (const void *)msg->msg_iov->iov_base;\n const struct icmphdr *icp = (const struct icmphdr *)buf;\n if (cc < sizeof(*icp))\n return false;\n\n return icp->type == ICMP_ECHOREPLY && icp->un.echo.id == ident;\n}\n\ninline void\nPingClient::Read()\n{\n char buffer[1024];\n struct iovec iov = {\n .iov_base = buffer,\n .iov_len = sizeof(buffer),\n };\n\n struct msghdr msg;\n memset(&msg, 0, sizeof(msg));\n\n char addrbuf[128];\n msg.msg_name = addrbuf;\n msg.msg_namelen = sizeof(addrbuf);\n msg.msg_iov = &iov;\n msg.msg_iovlen = 1;\n char ans_data[4096];\n msg.msg_control = ans_data;\n msg.msg_controllen = sizeof(ans_data);\n\n int cc = recvmsg(fd.Get(), &msg, MSG_DONTWAIT);\n if (cc >= 0) {\n if (parse_reply(&msg, cc, ident)) {\n fd.Close();\n handler.PingResponse();\n } else\n ScheduleRead();\n } else if (errno == EAGAIN || errno == EINTR) {\n ScheduleRead();\n } else {\n const int e = errno;\n fd.Close();\n handler.PingError(std::make_exception_ptr(MakeErrno(e)));\n }\n}\n\n\n\/*\n * libevent callback\n *\n *\/\n\ninline void\nPingClient::EventCallback(unsigned events)\n{\n assert(fd.IsDefined());\n\n if (events & SocketEvent::READ) {\n Read();\n } else {\n fd.Close();\n handler.PingTimeout();\n }\n}\n\n\/*\n * constructor\n *\n *\/\n\nbool\nping_available(void)\n{\n int fd = socket(AF_INET, SOCK_DGRAM, IPPROTO_ICMP);\n if (fd < 0)\n return false;\n close(fd);\n return true;\n}\n\nstatic UniqueSocketDescriptor\nCreateIcmp()\n{\n UniqueSocketDescriptor fd;\n if (!fd.CreateNonBlock(AF_INET, SOCK_DGRAM, IPPROTO_ICMP))\n throw MakeErrno(\"Failed to create ICMP socket\");\n\n return fd;\n}\n\nstatic uint16_t\nMakeIdent(SocketDescriptor fd)\n{\n if (!fd.Bind(IPv4Address(0)))\n throw MakeErrno(\"Failed to bind ICMP socket\");\n\n struct sockaddr_in sin;\n sin.sin_family = AF_INET;\n sin.sin_addr.s_addr = 0;\n socklen_t sin_length = sizeof(sin);\n\n if (getsockname(fd.Get(), (struct sockaddr *)&sin, &sin_length) < 0)\n throw MakeErrno(\"Failed to inspect ICMP socket\");\n\n return sin.sin_port;\n}\n\nstatic void\nSendPing(SocketDescriptor fd, SocketAddress address, uint16_t ident)\n{\n struct {\n struct icmphdr header;\n char data[8];\n } packet;\n\n packet.header.type = ICMP_ECHO;\n packet.header.code = 0;\n packet.header.checksum = 0;\n packet.header.un.echo.sequence = htons(1);\n packet.header.un.echo.id = ident;\n memset(packet.data, 0, sizeof(packet.data));\n packet.header.checksum = in_cksum((u_short *)&packet, sizeof(packet), 0);\n\n struct iovec iov = {\n .iov_base = &packet,\n .iov_len = sizeof(packet),\n };\n\n SendMessage(fd,\n MessageHeader(ConstBuffer<struct iovec>(&iov, 1))\n .SetAddress(address), 0);\n}\n\nvoid\nPingClient::Start(SocketAddress address)\n{\n try {\n fd = CreateIcmp();\n ident = MakeIdent(fd);\n SendPing(fd, address, ident);\n } catch (...) {\n handler.PingError(std::current_exception());\n return;\n }\n\n ScheduleRead();\n}\n<|endoftext|>"} {"text":"<commit_before>\/* bzflag\n * Copyright (c) 1993 - 2004 Tim Riker\n *\n * This package is free software; you can redistribute it and\/or\n * modify it under the terms of the license found in the file\n * named COPYING that should have accompanied this file.\n *\n * THIS PACKAGE IS PROVIDED ``AS IS'' AND WITHOUT ANY EXPRESS OR\n * IMPLIED WARRANTIES, INCLUDING, WITHOUT LIMITATION, THE IMPLIED\n * WARRANTIES OF MERCHANTIBILITY AND FITNESS FOR A PARTICULAR PURPOSE.\n *\/\n\/\/ todo make this turn off for .net\n#if defined(_MSC_VER)\n #pragma warning(disable: 4786)\n#endif\n\n\n#include <string.h>\n#include <math.h>\n#include <ctype.h>\n#include <fstream>\n#include \"common.h\"\n#include \"global.h\"\n#include \"Ping.h\"\n#include \"Protocol.h\"\n#include \"TimeKeeper.h\"\n#include \"bzfio.h\"\n\n\/\/ incessint rebuilding for current versioning\n#include \"version.h\"\n\n\n\/\/\n\/\/ PingPacket\n\/\/\n\nconst int\t\tPingPacket::PacketSize = ServerIdPLen + 52;\n\nPingPacket::PingPacket() : gameStyle(PlainGameStyle),\n\t\t\t\tmaxShots(1),\n\t\t\t\tshakeWins(0),\n\t\t\t\tshakeTimeout(0),\n\t\t\t\tmaxPlayerScore(0),\n\t\t\t\tmaxTeamScore(0),\n\t\t\t\tmaxTime(0),\n\t\t\t\tmaxPlayers(1),\n\t\t\t\trogueCount(0),\n\t\t\t\trogueMax(1),\n\t\t\t\tredCount(0),\n\t\t\t\tredMax(1),\n\t\t\t\tgreenCount(0),\n\t\t\t\tgreenMax(1),\n\t\t\t\tblueCount(0),\n\t\t\t\tblueMax(1),\n\t\t\t\tpurpleCount(0),\n\t\t\t\tpurpleMax(1),\n\t\t\t\tobserverCount(0),\n\t\t\t\tobserverMax(1)\n{\n \/\/ do nothing\n}\n\nPingPacket::~PingPacket()\n{\n \/\/ do nothing\n}\n\nbool\t\t\tPingPacket::read(int fd, struct sockaddr_in* addr)\n{\n char buffer[PacketSize], serverVersion[9];\n uint16_t len, code;\n\n \/\/ get packet\n int n = recvMulticast(fd, buffer, sizeof(buffer), addr);\n if (n < 4)\n return false;\n\n \/\/ decode header\n void* buf = buffer;\n buf = nboUnpackUShort(buf, len);\n buf = nboUnpackUShort(buf, code);\n\n \/\/ make sure we got the rest of the message\n if (len != n - 4)\n return false;\n\n \/\/ check that it's a reply\n if (code != MsgPingCodeReply)\n return false;\n\n \/\/ unpack body of reply\n buf = unpack(buf, serverVersion);\n\n \/\/ compare protocol version against my protocol version.\n return (strcmp(serverVersion, getServerVersion()) == 0);\n}\n\nbool\t\t\tPingPacket::waitForReply(int fd,\n\t\t\t\tconst Address& from,\n\t\t\t\tint millisecondsToBlock)\n{\n \/\/ block waiting on input. if the incoming message is not from the\n \/\/ indicated source then ignore it and go back to waiting. if the\n \/\/ incoming message is not a ping then ignore it and go back to waiting.\n float blockTime = 0.0001f * (float)millisecondsToBlock;\n TimeKeeper startTime = TimeKeeper::getCurrent();\n TimeKeeper currentTime = startTime;\n do {\n \/\/ prepare timeout\n const float timeLeft = blockTime - (currentTime - startTime);\n struct timeval timeout;\n timeout.tv_sec = long(floorf(timeLeft));\n timeout.tv_usec = long(1.0e+6f * (timeLeft - floorf(timeLeft)));\n\n \/\/ wait for input\n fd_set read_set;\n FD_ZERO(&read_set);\n _FD_SET(fd, &read_set);\n int nfound = select(fd+1, (fd_set*)&read_set, NULL, NULL, &timeout);\n\n \/\/ if got a message read it. if a ping packet and from right\n \/\/ sender then return success.\n if (nfound < 0)\n return false;\n if (nfound > 0 && read(fd, NULL))\n if (sourceAddr == from)\n\treturn true;\n\n currentTime = TimeKeeper::getCurrent();\n } while (currentTime - startTime < blockTime);\n return false;\n}\n\nbool\t\t\tPingPacket::write(int fd,\n\t\t\t\t\tconst struct sockaddr_in* addr) const\n{\n char buffer[PacketSize] = {0};\n void* buf = buffer;\n buf = nboPackUShort(buf, PacketSize - 4);\n buf = nboPackUShort(buf, MsgPingCodeReply);\n buf = pack(buf, getServerVersion());\n return sendMulticast(fd, buffer, sizeof(buffer), addr) == sizeof(buffer);\n}\n\nbool\t\t\tPingPacket::isRequest(int fd,\n\t\t\t\tstruct sockaddr_in* addr)\n{\n if (fd < 0) return false;\n char buffer[6];\n void *msg = buffer;\n uint16_t len, code;\n int size = recvMulticast(fd, buffer, sizeof(buffer), addr);\n if (size < 2) return false;\n msg = nboUnpackUShort(msg, len);\n msg = nboUnpackUShort(msg, code);\n return code == MsgPingCodeRequest;\n}\n\nbool\t\t\tPingPacket::sendRequest(int fd,\n\t\t\t\t\tconst struct sockaddr_in* addr)\n{\n if (fd < 0 || !addr) return false;\n char buffer[6];\n void *msg = buffer;\n msg = nboPackUShort(msg, 2);\n msg = nboPackUShort(msg, MsgPingCodeRequest);\n msg = nboPackUShort(msg, (uint16_t) 0);\n return sendMulticast(fd, buffer, sizeof(buffer), addr) == sizeof(buffer);\n}\n\nvoid*\t\t\tPingPacket::unpack(void* buf, char* version)\n{\n buf = nboUnpackString(buf, version, 8);\n buf = serverId.unpack(buf);\n buf = sourceAddr.unpack(buf);\n buf = nboUnpackUShort(buf, gameStyle);\n buf = nboUnpackUShort(buf, maxShots);\n buf = nboUnpackUShort(buf, shakeWins);\n buf = nboUnpackUShort(buf, shakeTimeout);\n buf = nboUnpackUShort(buf, maxPlayerScore);\n buf = nboUnpackUShort(buf, maxTeamScore);\n buf = nboUnpackUShort(buf, maxTime);\n buf = nboUnpackUByte(buf, maxPlayers);\n buf = nboUnpackUByte(buf, rogueCount);\n buf = nboUnpackUByte(buf, rogueMax);\n buf = nboUnpackUByte(buf, redCount);\n buf = nboUnpackUByte(buf, redMax);\n buf = nboUnpackUByte(buf, greenCount);\n buf = nboUnpackUByte(buf, greenMax);\n buf = nboUnpackUByte(buf, blueCount);\n buf = nboUnpackUByte(buf, blueMax);\n buf = nboUnpackUByte(buf, purpleCount);\n buf = nboUnpackUByte(buf, purpleMax);\n buf = nboUnpackUByte(buf, observerCount);\n buf = nboUnpackUByte(buf, observerMax);\n return buf;\n}\n\nvoid*\t\t\tPingPacket::pack(void* buf, const char* version) const\n{\n buf = nboPackString(buf, version, 8);\n buf = serverId.pack(buf);\n buf = sourceAddr.pack(buf);\n buf = nboPackUShort(buf, gameStyle);\n buf = nboPackUShort(buf, maxShots);\n buf = nboPackUShort(buf, shakeWins);\n buf = nboPackUShort(buf, shakeTimeout);\t\/\/ 1\/10ths of second\n buf = nboPackUShort(buf, maxPlayerScore);\n buf = nboPackUShort(buf, maxTeamScore);\n buf = nboPackUShort(buf, maxTime);\n buf = nboPackUByte(buf, maxPlayers);\n buf = nboPackUByte(buf, rogueCount);\n buf = nboPackUByte(buf, rogueMax);\n buf = nboPackUByte(buf, redCount);\n buf = nboPackUByte(buf, redMax);\n buf = nboPackUByte(buf, greenCount);\n buf = nboPackUByte(buf, greenMax);\n buf = nboPackUByte(buf, blueCount);\n buf = nboPackUByte(buf, blueMax);\n buf = nboPackUByte(buf, purpleCount);\n buf = nboPackUByte(buf, purpleMax);\n buf = nboPackUByte(buf, observerCount);\n buf = nboPackUByte(buf, observerMax);\n return buf;\n}\n\nvoid\t\t\tPingPacket::packHex(char* buf) const\n{\n buf = packHex16(buf, gameStyle);\n buf = packHex16(buf, maxShots);\n buf = packHex16(buf, shakeWins);\n buf = packHex16(buf, shakeTimeout);\n buf = packHex16(buf, maxPlayerScore);\n buf = packHex16(buf, maxTeamScore);\n buf = packHex16(buf, maxTime);\n buf = packHex8(buf, maxPlayers);\n buf = packHex8(buf, rogueCount);\n buf = packHex8(buf, rogueMax);\n buf = packHex8(buf, redCount);\n buf = packHex8(buf, redMax);\n buf = packHex8(buf, greenCount);\n buf = packHex8(buf, greenMax);\n buf = packHex8(buf, blueCount);\n buf = packHex8(buf, blueMax);\n buf = packHex8(buf, purpleCount);\n buf = packHex8(buf, purpleMax);\n buf = packHex8(buf, observerCount);\n buf = packHex8(buf, observerMax);\n *buf = 0;\n}\n\nvoid\t\t\tPingPacket::unpackHex(char* buf)\n{\n buf = unpackHex16(buf, gameStyle);\n buf = unpackHex16(buf, maxShots);\n buf = unpackHex16(buf, shakeWins);\n buf = unpackHex16(buf, shakeTimeout);\n buf = unpackHex16(buf, maxPlayerScore);\n buf = unpackHex16(buf, maxTeamScore);\n buf = unpackHex16(buf, maxTime);\n buf = unpackHex8(buf, maxPlayers);\n buf = unpackHex8(buf, rogueCount);\n buf = unpackHex8(buf, rogueMax);\n buf = unpackHex8(buf, redCount);\n buf = unpackHex8(buf, redMax);\n buf = unpackHex8(buf, greenCount);\n buf = unpackHex8(buf, greenMax);\n buf = unpackHex8(buf, blueCount);\n buf = unpackHex8(buf, blueMax);\n buf = unpackHex8(buf, purpleCount);\n buf = unpackHex8(buf, purpleMax);\n buf = unpackHex8(buf, observerCount);\n buf = unpackHex8(buf, observerMax);\n}\n\nint\t\t\tPingPacket::hex2bin(char d)\n{\n switch (d) {\n case '0': return 0;\n case '1': return 1;\n case '2': return 2;\n case '3': return 3;\n case '4': return 4;\n case '5': return 5;\n case '6': return 6;\n case '7': return 7;\n case '8': return 8;\n case '9': return 9;\n case 'A':\n case 'a': return 10;\n case 'B':\n case 'b': return 11;\n case 'C':\n case 'c': return 12;\n case 'D':\n case 'd': return 13;\n case 'E':\n case 'e': return 14;\n case 'F':\n case 'f': return 15;\n }\n return 0;\n}\n\nchar\t\t\tPingPacket::bin2hex(int d)\n{\n static const char* digit = \"0123456789abcdef\";\n return digit[d];\n}\n\nchar*\t\t\tPingPacket::packHex16(char* buf, uint16_t v)\n{\n *buf++ = bin2hex((v >> 12) & 0xf);\n *buf++ = bin2hex((v >> 8) & 0xf);\n *buf++ = bin2hex((v >> 4) & 0xf);\n *buf++ = bin2hex( v & 0xf);\n return buf;\n}\n\nchar*\t\t\tPingPacket::unpackHex16(char* buf, uint16_t& v)\n{\n uint16_t d = 0;\n d = (d << 4) | hex2bin(*buf++);\n d = (d << 4) | hex2bin(*buf++);\n d = (d << 4) | hex2bin(*buf++);\n d = (d << 4) | hex2bin(*buf++);\n v = d;\n return buf;\n}\n\nchar*\t\t\tPingPacket::packHex8(char* buf, uint8_t v)\n{\n *buf++ = bin2hex((v >> 4) & 0xf);\n *buf++ = bin2hex( v & 0xf);\n return buf;\n}\n\nchar*\t\t\tPingPacket::unpackHex8(char* buf, uint8_t& v)\n{\n uint16_t d = 0;\n d = (d << 4) | hex2bin(*buf++);\n d = (d << 4) | hex2bin(*buf++);\n v = (uint8_t)d;\n return buf;\n}\n\nvoid\t\t\t PingPacket::zeroPlayerCounts()\n{\n rogueCount = 0;\n redCount = 0;\n greenCount = 0;\n blueCount = 0;\n purpleCount = 0;\n observerCount = 0;\n}\n\n\/\/ serialize packet to file -- note lack of error checking\n\/\/ must write to a binary file if we use plain \"pack\"\nvoid\t\t\t PingPacket::writeToFile (std::ostream& out) const\n{\n if (!out) return;\n\n char buffer[PingPacket::PacketSize];\n void* buf = buffer;\n buf = nboPackUShort(buf, PingPacket::PacketSize - 4);\n buf = nboPackUShort(buf, MsgPingCodeReply);\n buf = pack(buf, getServerVersion());\n out.write(buffer,sizeof(buffer));\n}\n\n\/\/ de serialize packet from file\n\/\/ must read from a binary file if we use plain \"unpack\"\nbool\t\t\t PingPacket::readFromFile(std::istream& in)\n{\n if (!in) return false;\n\n char buffer[PingPacket::PacketSize], serverVersion[9];\n uint16_t len, code;\n\n \/\/ get packet\n in.read(buffer, sizeof(buffer));\n if ((size_t)in.gcount() < sizeof(buffer)){\n return false;\n }\n\n \/\/ decode header\n void* buf = buffer;\n buf = nboUnpackUShort(buf, len);\n buf = nboUnpackUShort(buf, code);\n\n \/\/ make sure we got the rest of the message\n if (len != in.gcount() - 4){\n return false;\n }\n\n \/\/ unpack body of reply\n buf = unpack(buf, serverVersion);\n\n \/\/ compare protocol version against my protocol version.\n return (strcmp(serverVersion, getServerVersion()) == 0);\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\n<commit_msg>Should also revert this, but use full 8 chars to compare for version not just 7<commit_after>\/* bzflag\n * Copyright (c) 1993 - 2004 Tim Riker\n *\n * This package is free software; you can redistribute it and\/or\n * modify it under the terms of the license found in the file\n * named COPYING that should have accompanied this file.\n *\n * THIS PACKAGE IS PROVIDED ``AS IS'' AND WITHOUT ANY EXPRESS OR\n * IMPLIED WARRANTIES, INCLUDING, WITHOUT LIMITATION, THE IMPLIED\n * WARRANTIES OF MERCHANTIBILITY AND FITNESS FOR A PARTICULAR PURPOSE.\n *\/\n\/\/ todo make this turn off for .net\n#if defined(_MSC_VER)\n #pragma warning(disable: 4786)\n#endif\n\n\n#include <string.h>\n#include <math.h>\n#include <ctype.h>\n#include <fstream>\n#include \"common.h\"\n#include \"global.h\"\n#include \"Ping.h\"\n#include \"Protocol.h\"\n#include \"TimeKeeper.h\"\n#include \"bzfio.h\"\n\n\/\/ incessint rebuilding for current versioning\n#include \"version.h\"\n\n\n\/\/\n\/\/ PingPacket\n\/\/\n\nconst int\t\tPingPacket::PacketSize = ServerIdPLen + 52;\n\nPingPacket::PingPacket() : gameStyle(PlainGameStyle),\n\t\t\t\tmaxShots(1),\n\t\t\t\tshakeWins(0),\n\t\t\t\tshakeTimeout(0),\n\t\t\t\tmaxPlayerScore(0),\n\t\t\t\tmaxTeamScore(0),\n\t\t\t\tmaxTime(0),\n\t\t\t\tmaxPlayers(1),\n\t\t\t\trogueCount(0),\n\t\t\t\trogueMax(1),\n\t\t\t\tredCount(0),\n\t\t\t\tredMax(1),\n\t\t\t\tgreenCount(0),\n\t\t\t\tgreenMax(1),\n\t\t\t\tblueCount(0),\n\t\t\t\tblueMax(1),\n\t\t\t\tpurpleCount(0),\n\t\t\t\tpurpleMax(1),\n\t\t\t\tobserverCount(0),\n\t\t\t\tobserverMax(1)\n{\n \/\/ do nothing\n}\n\nPingPacket::~PingPacket()\n{\n \/\/ do nothing\n}\n\nbool\t\t\tPingPacket::read(int fd, struct sockaddr_in* addr)\n{\n char buffer[PacketSize], serverVersion[9];\n uint16_t len, code;\n\n \/\/ get packet\n int n = recvMulticast(fd, buffer, sizeof(buffer), addr);\n if (n < 4)\n return false;\n\n \/\/ decode header\n void* buf = buffer;\n buf = nboUnpackUShort(buf, len);\n buf = nboUnpackUShort(buf, code);\n\n \/\/ make sure we got the rest of the message\n if (len != n - 4)\n return false;\n\n \/\/ check that it's a reply\n if (code != MsgPingCodeReply)\n return false;\n\n \/\/ unpack body of reply\n buf = unpack(buf, serverVersion);\n\n \/\/ compare protocol version against my protocol version.\n return (strncmp(serverVersion, getServerVersion(), 8) == 0);\n}\n\nbool\t\t\tPingPacket::waitForReply(int fd,\n\t\t\t\tconst Address& from,\n\t\t\t\tint millisecondsToBlock)\n{\n \/\/ block waiting on input. if the incoming message is not from the\n \/\/ indicated source then ignore it and go back to waiting. if the\n \/\/ incoming message is not a ping then ignore it and go back to waiting.\n float blockTime = 0.0001f * (float)millisecondsToBlock;\n TimeKeeper startTime = TimeKeeper::getCurrent();\n TimeKeeper currentTime = startTime;\n do {\n \/\/ prepare timeout\n const float timeLeft = blockTime - (currentTime - startTime);\n struct timeval timeout;\n timeout.tv_sec = long(floorf(timeLeft));\n timeout.tv_usec = long(1.0e+6f * (timeLeft - floorf(timeLeft)));\n\n \/\/ wait for input\n fd_set read_set;\n FD_ZERO(&read_set);\n _FD_SET(fd, &read_set);\n int nfound = select(fd+1, (fd_set*)&read_set, NULL, NULL, &timeout);\n\n \/\/ if got a message read it. if a ping packet and from right\n \/\/ sender then return success.\n if (nfound < 0)\n return false;\n if (nfound > 0 && read(fd, NULL))\n if (sourceAddr == from)\n\treturn true;\n\n currentTime = TimeKeeper::getCurrent();\n } while (currentTime - startTime < blockTime);\n return false;\n}\n\nbool\t\t\tPingPacket::write(int fd,\n\t\t\t\t\tconst struct sockaddr_in* addr) const\n{\n char buffer[PacketSize] = {0};\n void* buf = buffer;\n buf = nboPackUShort(buf, PacketSize - 4);\n buf = nboPackUShort(buf, MsgPingCodeReply);\n buf = pack(buf, getServerVersion());\n return sendMulticast(fd, buffer, sizeof(buffer), addr) == sizeof(buffer);\n}\n\nbool\t\t\tPingPacket::isRequest(int fd,\n\t\t\t\tstruct sockaddr_in* addr)\n{\n if (fd < 0) return false;\n char buffer[6];\n void *msg = buffer;\n uint16_t len, code;\n int size = recvMulticast(fd, buffer, sizeof(buffer), addr);\n if (size < 2) return false;\n msg = nboUnpackUShort(msg, len);\n msg = nboUnpackUShort(msg, code);\n return code == MsgPingCodeRequest;\n}\n\nbool\t\t\tPingPacket::sendRequest(int fd,\n\t\t\t\t\tconst struct sockaddr_in* addr)\n{\n if (fd < 0 || !addr) return false;\n char buffer[6];\n void *msg = buffer;\n msg = nboPackUShort(msg, 2);\n msg = nboPackUShort(msg, MsgPingCodeRequest);\n msg = nboPackUShort(msg, (uint16_t) 0);\n return sendMulticast(fd, buffer, sizeof(buffer), addr) == sizeof(buffer);\n}\n\nvoid*\t\t\tPingPacket::unpack(void* buf, char* version)\n{\n buf = nboUnpackString(buf, version, 8);\n buf = serverId.unpack(buf);\n buf = sourceAddr.unpack(buf);\n buf = nboUnpackUShort(buf, gameStyle);\n buf = nboUnpackUShort(buf, maxShots);\n buf = nboUnpackUShort(buf, shakeWins);\n buf = nboUnpackUShort(buf, shakeTimeout);\n buf = nboUnpackUShort(buf, maxPlayerScore);\n buf = nboUnpackUShort(buf, maxTeamScore);\n buf = nboUnpackUShort(buf, maxTime);\n buf = nboUnpackUByte(buf, maxPlayers);\n buf = nboUnpackUByte(buf, rogueCount);\n buf = nboUnpackUByte(buf, rogueMax);\n buf = nboUnpackUByte(buf, redCount);\n buf = nboUnpackUByte(buf, redMax);\n buf = nboUnpackUByte(buf, greenCount);\n buf = nboUnpackUByte(buf, greenMax);\n buf = nboUnpackUByte(buf, blueCount);\n buf = nboUnpackUByte(buf, blueMax);\n buf = nboUnpackUByte(buf, purpleCount);\n buf = nboUnpackUByte(buf, purpleMax);\n buf = nboUnpackUByte(buf, observerCount);\n buf = nboUnpackUByte(buf, observerMax);\n return buf;\n}\n\nvoid*\t\t\tPingPacket::pack(void* buf, const char* version) const\n{\n buf = nboPackString(buf, version, 8);\n buf = serverId.pack(buf);\n buf = sourceAddr.pack(buf);\n buf = nboPackUShort(buf, gameStyle);\n buf = nboPackUShort(buf, maxShots);\n buf = nboPackUShort(buf, shakeWins);\n buf = nboPackUShort(buf, shakeTimeout);\t\/\/ 1\/10ths of second\n buf = nboPackUShort(buf, maxPlayerScore);\n buf = nboPackUShort(buf, maxTeamScore);\n buf = nboPackUShort(buf, maxTime);\n buf = nboPackUByte(buf, maxPlayers);\n buf = nboPackUByte(buf, rogueCount);\n buf = nboPackUByte(buf, rogueMax);\n buf = nboPackUByte(buf, redCount);\n buf = nboPackUByte(buf, redMax);\n buf = nboPackUByte(buf, greenCount);\n buf = nboPackUByte(buf, greenMax);\n buf = nboPackUByte(buf, blueCount);\n buf = nboPackUByte(buf, blueMax);\n buf = nboPackUByte(buf, purpleCount);\n buf = nboPackUByte(buf, purpleMax);\n buf = nboPackUByte(buf, observerCount);\n buf = nboPackUByte(buf, observerMax);\n return buf;\n}\n\nvoid\t\t\tPingPacket::packHex(char* buf) const\n{\n buf = packHex16(buf, gameStyle);\n buf = packHex16(buf, maxShots);\n buf = packHex16(buf, shakeWins);\n buf = packHex16(buf, shakeTimeout);\n buf = packHex16(buf, maxPlayerScore);\n buf = packHex16(buf, maxTeamScore);\n buf = packHex16(buf, maxTime);\n buf = packHex8(buf, maxPlayers);\n buf = packHex8(buf, rogueCount);\n buf = packHex8(buf, rogueMax);\n buf = packHex8(buf, redCount);\n buf = packHex8(buf, redMax);\n buf = packHex8(buf, greenCount);\n buf = packHex8(buf, greenMax);\n buf = packHex8(buf, blueCount);\n buf = packHex8(buf, blueMax);\n buf = packHex8(buf, purpleCount);\n buf = packHex8(buf, purpleMax);\n buf = packHex8(buf, observerCount);\n buf = packHex8(buf, observerMax);\n *buf = 0;\n}\n\nvoid\t\t\tPingPacket::unpackHex(char* buf)\n{\n buf = unpackHex16(buf, gameStyle);\n buf = unpackHex16(buf, maxShots);\n buf = unpackHex16(buf, shakeWins);\n buf = unpackHex16(buf, shakeTimeout);\n buf = unpackHex16(buf, maxPlayerScore);\n buf = unpackHex16(buf, maxTeamScore);\n buf = unpackHex16(buf, maxTime);\n buf = unpackHex8(buf, maxPlayers);\n buf = unpackHex8(buf, rogueCount);\n buf = unpackHex8(buf, rogueMax);\n buf = unpackHex8(buf, redCount);\n buf = unpackHex8(buf, redMax);\n buf = unpackHex8(buf, greenCount);\n buf = unpackHex8(buf, greenMax);\n buf = unpackHex8(buf, blueCount);\n buf = unpackHex8(buf, blueMax);\n buf = unpackHex8(buf, purpleCount);\n buf = unpackHex8(buf, purpleMax);\n buf = unpackHex8(buf, observerCount);\n buf = unpackHex8(buf, observerMax);\n}\n\nint\t\t\tPingPacket::hex2bin(char d)\n{\n switch (d) {\n case '0': return 0;\n case '1': return 1;\n case '2': return 2;\n case '3': return 3;\n case '4': return 4;\n case '5': return 5;\n case '6': return 6;\n case '7': return 7;\n case '8': return 8;\n case '9': return 9;\n case 'A':\n case 'a': return 10;\n case 'B':\n case 'b': return 11;\n case 'C':\n case 'c': return 12;\n case 'D':\n case 'd': return 13;\n case 'E':\n case 'e': return 14;\n case 'F':\n case 'f': return 15;\n }\n return 0;\n}\n\nchar\t\t\tPingPacket::bin2hex(int d)\n{\n static const char* digit = \"0123456789abcdef\";\n return digit[d];\n}\n\nchar*\t\t\tPingPacket::packHex16(char* buf, uint16_t v)\n{\n *buf++ = bin2hex((v >> 12) & 0xf);\n *buf++ = bin2hex((v >> 8) & 0xf);\n *buf++ = bin2hex((v >> 4) & 0xf);\n *buf++ = bin2hex( v & 0xf);\n return buf;\n}\n\nchar*\t\t\tPingPacket::unpackHex16(char* buf, uint16_t& v)\n{\n uint16_t d = 0;\n d = (d << 4) | hex2bin(*buf++);\n d = (d << 4) | hex2bin(*buf++);\n d = (d << 4) | hex2bin(*buf++);\n d = (d << 4) | hex2bin(*buf++);\n v = d;\n return buf;\n}\n\nchar*\t\t\tPingPacket::packHex8(char* buf, uint8_t v)\n{\n *buf++ = bin2hex((v >> 4) & 0xf);\n *buf++ = bin2hex( v & 0xf);\n return buf;\n}\n\nchar*\t\t\tPingPacket::unpackHex8(char* buf, uint8_t& v)\n{\n uint16_t d = 0;\n d = (d << 4) | hex2bin(*buf++);\n d = (d << 4) | hex2bin(*buf++);\n v = (uint8_t)d;\n return buf;\n}\n\nvoid\t\t\t PingPacket::zeroPlayerCounts()\n{\n rogueCount = 0;\n redCount = 0;\n greenCount = 0;\n blueCount = 0;\n purpleCount = 0;\n observerCount = 0;\n}\n\n\/\/ serialize packet to file -- note lack of error checking\n\/\/ must write to a binary file if we use plain \"pack\"\nvoid\t\t\t PingPacket::writeToFile (std::ostream& out) const\n{\n if (!out) return;\n\n char buffer[PingPacket::PacketSize];\n void* buf = buffer;\n buf = nboPackUShort(buf, PingPacket::PacketSize - 4);\n buf = nboPackUShort(buf, MsgPingCodeReply);\n buf = pack(buf, getServerVersion());\n out.write(buffer,sizeof(buffer));\n}\n\n\/\/ de serialize packet from file\n\/\/ must read from a binary file if we use plain \"unpack\"\nbool\t\t\t PingPacket::readFromFile(std::istream& in)\n{\n if (!in) return false;\n\n char buffer[PingPacket::PacketSize], serverVersion[9];\n uint16_t len, code;\n\n \/\/ get packet\n in.read(buffer, sizeof(buffer));\n if ((size_t)in.gcount() < sizeof(buffer)){\n return false;\n }\n\n \/\/ decode header\n void* buf = buffer;\n buf = nboUnpackUShort(buf, len);\n buf = nboUnpackUShort(buf, code);\n\n \/\/ make sure we got the rest of the message\n if (len != in.gcount() - 4){\n return false;\n }\n\n \/\/ unpack body of reply\n buf = unpack(buf, serverVersion);\n\n \/\/ compare protocol version against my protocol version.\n return (strncmp(serverVersion, getServerVersion(), 8) == 0);\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\n<|endoftext|>"} {"text":"<commit_before>\/* -*- Mode: C; tab-width: 4; c-basic-offset: 4; indent-tabs-mode: nil -*- *\/\n\/*\n * Copyright 2011-2013 Couchbase, Inc.\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n *\/\n\n#include \"internal.h\"\n#include \"packetutils.h\"\n#include \"bucketconfig\/clconfig.h\"\n#include \"vbucket\/aliases.h\"\n#include \"sllist-inl.h\"\n\n#define LOGARGS(instance, lvl) (instance)->settings, \"newconfig\", LCB_LOG_##lvl, __FILE__, __LINE__\n#define LOG(instance, lvlbase, msg) lcb_log(instance->settings, \"newconfig\", LCB_LOG_##lvlbase, __FILE__, __LINE__, msg)\n\n#define SERVER_FMT \"%s:%s (%p)\"\n#define SERVER_ARGS(s) (s)->get_host().host, (s)->get_host().port, (void *)s\n\ntypedef struct lcb_GUESSVB_st {\n time_t last_update; \/**< Last time this vBucket was heuristically set *\/\n char newix; \/**< New index, heuristically determined *\/\n char oldix; \/**< Original index, according to map *\/\n char used; \/**< Flag indicating whether or not this entry has been used *\/\n} lcb_GUESSVB;\n\n\/* Ignore configuration updates for heuristically guessed vBuckets for a\n * maximum amount of [n] seconds *\/\n#define MAX_KEEP_GUESS 20\n\nstatic int\nshould_keep_guess(lcb_GUESSVB *guess, lcbvb_VBUCKET *vb)\n{\n if (guess->newix == guess->oldix) {\n \/* Heuristic position is the same as starting position *\/\n return 0;\n }\n if (vb->servers[0] != guess->oldix) {\n \/* Previous master changed *\/\n return 0;\n }\n\n if (time(NULL) - guess->last_update > MAX_KEEP_GUESS) {\n \/* Last usage too old *\/\n return 0;\n }\n\n return 1;\n}\n\nvoid\nlcb_vbguess_newconfig(lcb_t instance, lcbvb_CONFIG *cfg, lcb_GUESSVB *guesses)\n{\n unsigned ii;\n\n if (!guesses) {\n return;\n }\n\n for (ii = 0; ii < cfg->nvb; ii++) {\n lcb_GUESSVB *guess = guesses + ii;\n lcbvb_VBUCKET *vb = cfg->vbuckets + ii;\n\n if (!guess->used) {\n continue;\n }\n\n \/* IF: Heuristically learned a new index, _and_ the old index (which is\n * known to be bad) is the same index stated by the new config *\/\n if (should_keep_guess(guess, vb)) {\n lcb_log(LOGARGS(instance, TRACE), \"Keeping heuristically guessed index. VBID=%d. Current=%d. Old=%d.\", ii, guess->newix, guess->oldix);\n vb->servers[0] = guess->newix;\n } else {\n \/* We don't reassign to the guess structure here. The idea is that\n * we will simply use the new config. If this gives us problems, the\n * config will re-learn again. *\/\n lcb_log(LOGARGS(instance, TRACE), \"Ignoring heuristically guessed index. VBID=%d. Current=%d. Old=%d. New=%d\", ii, guess->newix, guess->oldix, vb->servers[0]);\n guess->used = 0;\n }\n }\n}\n\nint\nlcb_vbguess_remap(lcb_t instance, int vbid, int bad)\n{\n\n if (LCBT_SETTING(instance, vb_noguess)) {\n int newix = lcbvb_nmv_remap_ex(LCBT_VBCONFIG(instance), vbid, bad, 0);\n if (newix > -1 && newix != bad) {\n lcb_log(LOGARGS(instance, TRACE), \"Got new index from ffmap. VBID=%d. Old=%d. New=%d\", vbid, bad, newix);\n }\n return newix;\n\n } else {\n lcb_GUESSVB *guesses = instance->vbguess;\n lcb_GUESSVB *guess = guesses + vbid;\n int newix = lcbvb_nmv_remap_ex(LCBT_VBCONFIG(instance), vbid, bad, 1);\n if (!guesses) {\n guesses = instance->vbguess = reinterpret_cast<lcb_GUESSVB*>(calloc(\n LCBT_VBCONFIG(instance)->nvb, sizeof *guesses));\n }\n if (newix > -1 && newix != bad) {\n guess->newix = newix;\n guess->oldix = bad;\n guess->used = 1;\n guess->last_update = time(NULL);\n lcb_log(LOGARGS(instance, TRACE), \"Guessed new heuristic index VBID=%d. Old=%d. New=%d\", vbid, bad, newix);\n }\n return newix;\n }\n}\n\n\/**\n * Finds the index of an older server using the current config.\n *\n * This function is used to help reuse the server structures for memcached\n * packets.\n *\n * @param oldconfig The old configuration. This is the configuration the\n * old server is bound to\n * @param newconfig The new configuration. This will be inspected for new\n * nodes which may have been added, and ones which may have been removed.\n * @param server The server to match\n * @return The new index, or -1 if the current server is not present in the new\n * config.\n *\/\nstatic int\nfind_new_data_index(lcbvb_CONFIG *oldconfig, lcbvb_CONFIG* newconfig,\n lcb::Server *server)\n{\n const char *old_datahost = lcbvb_get_hostport(oldconfig,\n server->get_index(), LCBVB_SVCTYPE_DATA, LCBVB_SVCMODE_PLAIN);\n\n if (!old_datahost) {\n \/* Old server had no data service *\/\n return -1;\n }\n\n for (size_t ii = 0; ii < LCBVB_NSERVERS(newconfig); ii++) {\n const char *new_datahost = lcbvb_get_hostport(newconfig, ii,\n LCBVB_SVCTYPE_DATA, LCBVB_SVCMODE_PLAIN);\n if (new_datahost && strcmp(new_datahost, old_datahost) == 0) {\n return ii;\n }\n }\n return -1;\n}\n\nstatic void\nlog_vbdiff(lcb_t instance, lcbvb_CONFIGDIFF *diff)\n{\n lcb_log(LOGARGS(instance, INFO), \"Config Diff: [ vBuckets Modified=%d ], [Sequence Changed=%d]\", diff->n_vb_changes, diff->sequence_changed);\n if (diff->servers_added) {\n for (char **curserver = diff->servers_added; *curserver; curserver++) {\n lcb_log(LOGARGS(instance, INFO), \"Detected server %s added\", *curserver);\n }\n }\n if (diff->servers_removed) {\n for (char **curserver = diff->servers_removed; *curserver; curserver++) {\n lcb_log(LOGARGS(instance, INFO), \"Detected server %s removed\", *curserver);\n }\n }\n}\n\n\/**\n * This callback is invoked for packet relocation twice. It tries to relocate\n * commands to their destination server. Some commands may not be relocated\n * either because they have no explicit \"Relocation Information\" (i.e. no\n * specific vbucket) or because the command is tied to a specific server (i.e.\n * CMD_STAT).\n *\n * Note that `KEEP_PACKET` here doesn't mean to \"Save\" the packet, but rather\n * to keep the packet in the current queue (so that if the server ends up\n * being removed, the command will fail); rather than being relocated to\n * another server.\n *\/\nstatic int\niterwipe_cb(mc_CMDQUEUE *cq, mc_PIPELINE *oldpl, mc_PACKET *oldpkt, void *)\n{\n protocol_binary_request_header hdr;\n lcb::Server *srv = static_cast<lcb::Server *>(oldpl);\n int newix;\n\n mcreq_read_hdr(oldpkt, &hdr);\n\n if (!lcb_should_retry(srv->get_settings(), oldpkt, LCB_MAX_ERROR)) {\n return MCREQ_KEEP_PACKET;\n }\n\n if (LCBVB_DISTTYPE(cq->config) == LCBVB_DIST_VBUCKET) {\n newix = lcbvb_vbmaster(cq->config, ntohs(hdr.request.vbucket));\n\n } else {\n const void *key = NULL;\n lcb_SIZE nkey = 0;\n int tmpid;\n\n \/* XXX: We ignore hashkey. This is going away soon, and is probably\n * better than simply failing the items. *\/\n mcreq_get_key(oldpkt, &key, &nkey);\n lcbvb_map_key(cq->config, key, nkey, &tmpid, &newix);\n }\n\n if (newix < 0 || newix > (int)cq->npipelines-1) {\n return MCREQ_KEEP_PACKET;\n }\n\n\n mc_PIPELINE *newpl = cq->pipelines[newix];\n if (newpl == oldpl || newpl == NULL) {\n return MCREQ_KEEP_PACKET;\n }\n\n lcb_log(LOGARGS((lcb_t)cq->cqdata, DEBUG), \"Remapped packet %p (SEQ=%u) from \"SERVER_FMT \" to \" SERVER_FMT,\n (void*)oldpkt, oldpkt->opaque, SERVER_ARGS((lcb::Server*)oldpl), SERVER_ARGS((lcb::Server*)newpl));\n\n \/** Otherwise, copy over the packet and find the new vBucket to map to *\/\n mc_PACKET *newpkt = mcreq_renew_packet(oldpkt);\n newpkt->flags &= ~MCREQ_STATE_FLAGS;\n mcreq_reenqueue_packet(newpl, newpkt);\n mcreq_packet_handled(oldpl, oldpkt);\n return MCREQ_REMOVE_PACKET;\n}\n\nstatic lcb_configuration_t\nreplace_config(lcb_t instance, lcbvb_CONFIG *oldconfig, lcbvb_CONFIG *newconfig)\n{\n mc_CMDQUEUE *cq = &instance->cmdq;\n mc_PIPELINE **ppold, **ppnew;\n unsigned ii, nold, nnew;\n\n assert(LCBT_VBCONFIG(instance) == newconfig);\n\n nnew = LCBVB_NSERVERS(newconfig);\n ppnew = reinterpret_cast<mc_PIPELINE**>(calloc(nnew, sizeof(*ppnew)));\n ppold = mcreq_queue_take_pipelines(cq, &nold);\n\n \/**\n * Determine which existing servers are still part of the new cluster config\n * and place it inside the new list.\n *\/\n for (ii = 0; ii < nold; ii++) {\n lcb::Server *cur = static_cast<lcb::Server *>(ppold[ii]);\n int newix = find_new_data_index(oldconfig, newconfig, cur);\n if (newix > -1) {\n cur->set_new_index(newix);\n ppnew[newix] = cur;\n ppold[ii] = NULL;\n lcb_log(LOGARGS(instance, INFO), \"Reusing server \"SERVER_FMT\". OldIndex=%d. NewIndex=%d\", SERVER_ARGS(cur), ii, newix);\n }\n }\n\n \/**\n * Once we've moved the kept servers to the new list, allocate new lcb::Server\n * structures for slots that don't have an existing lcb::Server. We must do\n * this before add_pipelines() is called, so that there are no holes inside\n * ppnew\n *\/\n for (ii = 0; ii < nnew; ii++) {\n if (!ppnew[ii]) {\n ppnew[ii] = new lcb::Server(instance, ii);\n }\n }\n\n \/**\n * Once we have all the server structures in place for the new config,\n * transfer the new config along with the new list over to the CQ structure.\n *\/\n mcreq_queue_add_pipelines(cq, ppnew, nnew, newconfig);\n for (ii = 0; ii < nnew; ii++) {\n mcreq_iterwipe(cq, ppnew[ii], iterwipe_cb, NULL);\n }\n\n \/**\n * Go through all the servers that are to be removed and relocate commands\n * from their queues into the new queues\n *\/\n for (ii = 0; ii < nold; ii++) {\n if (!ppold[ii]) {\n continue;\n }\n\n mcreq_iterwipe(cq, ppold[ii], iterwipe_cb, NULL);\n static_cast<lcb::Server*>(ppold[ii])->purge(LCB_MAP_CHANGED);\n static_cast<lcb::Server*>(ppold[ii])->close();\n }\n\n for (ii = 0; ii < nnew; ii++) {\n if (static_cast<lcb::Server*>(ppnew[ii])->has_pending()) {\n ppnew[ii]->flush_start(ppnew[ii]);\n }\n }\n\n free(ppnew);\n free(ppold);\n return LCB_CONFIGURATION_CHANGED;\n}\n\nvoid lcb_update_vbconfig(lcb_t instance, clconfig_info *config)\n{\n lcb_configuration_t change_status;\n clconfig_info *old_config = instance->cur_configinfo;\n mc_CMDQUEUE *q = &instance->cmdq;\n\n instance->cur_configinfo = config;\n lcb_clconfig_incref(config);\n q->config = instance->cur_configinfo->vbc;\n q->cqdata = instance;\n\n if (old_config) {\n lcbvb_CONFIGDIFF *diff = lcbvb_compare(old_config->vbc, config->vbc);\n\n if (diff) {\n log_vbdiff(instance, diff);\n lcbvb_free_diff(diff);\n }\n\n \/* Apply the vb guesses *\/\n lcb_vbguess_newconfig(instance, config->vbc, instance->vbguess);\n\n change_status = replace_config(instance, old_config->vbc, config->vbc);\n if (change_status == -1) {\n LOG(instance, ERR, \"Couldn't replace config\");\n return;\n }\n lcb_clconfig_decref(old_config);\n } else {\n size_t nservers = VB_NSERVERS(config->vbc);\n std::vector<mc_PIPELINE*> servers;\n\n for (size_t ii = 0; ii < nservers; ii++) {\n servers.push_back(new lcb::Server(instance, ii));\n }\n\n mcreq_queue_add_pipelines(q, &servers[0], nservers, config->vbc);\n change_status = LCB_CONFIGURATION_NEW;\n }\n\n \/* Update the list of nodes here for server list *\/\n instance->ht_nodes->clear();\n for (size_t ii = 0; ii < LCBVB_NSERVERS(config->vbc); ++ii) {\n const char *hp = lcbvb_get_hostport(config->vbc, ii,\n LCBVB_SVCTYPE_MGMT, LCBVB_SVCMODE_PLAIN);\n if (hp) {\n instance->ht_nodes->add(hp, LCB_CONFIG_HTTP_PORT);\n }\n }\n\n instance->callbacks.configuration(instance, change_status);\n lcb_maybe_breakout(instance);\n}\n<commit_msg>newconfig: fix compiler warning<commit_after>\/* -*- Mode: C; tab-width: 4; c-basic-offset: 4; indent-tabs-mode: nil -*- *\/\n\/*\n * Copyright 2011-2013 Couchbase, Inc.\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n *\/\n\n#include \"internal.h\"\n#include \"packetutils.h\"\n#include \"bucketconfig\/clconfig.h\"\n#include \"vbucket\/aliases.h\"\n#include \"sllist-inl.h\"\n\n#define LOGARGS(instance, lvl) (instance)->settings, \"newconfig\", LCB_LOG_##lvl, __FILE__, __LINE__\n#define LOG(instance, lvlbase, msg) lcb_log(instance->settings, \"newconfig\", LCB_LOG_##lvlbase, __FILE__, __LINE__, msg)\n\n#define SERVER_FMT \"%s:%s (%p)\"\n#define SERVER_ARGS(s) (s)->get_host().host, (s)->get_host().port, (void *)s\n\ntypedef struct lcb_GUESSVB_st {\n time_t last_update; \/**< Last time this vBucket was heuristically set *\/\n char newix; \/**< New index, heuristically determined *\/\n char oldix; \/**< Original index, according to map *\/\n char used; \/**< Flag indicating whether or not this entry has been used *\/\n} lcb_GUESSVB;\n\n\/* Ignore configuration updates for heuristically guessed vBuckets for a\n * maximum amount of [n] seconds *\/\n#define MAX_KEEP_GUESS 20\n\nstatic int\nshould_keep_guess(lcb_GUESSVB *guess, lcbvb_VBUCKET *vb)\n{\n if (guess->newix == guess->oldix) {\n \/* Heuristic position is the same as starting position *\/\n return 0;\n }\n if (vb->servers[0] != guess->oldix) {\n \/* Previous master changed *\/\n return 0;\n }\n\n if (time(NULL) - guess->last_update > MAX_KEEP_GUESS) {\n \/* Last usage too old *\/\n return 0;\n }\n\n return 1;\n}\n\nvoid\nlcb_vbguess_newconfig(lcb_t instance, lcbvb_CONFIG *cfg, lcb_GUESSVB *guesses)\n{\n unsigned ii;\n\n if (!guesses) {\n return;\n }\n\n for (ii = 0; ii < cfg->nvb; ii++) {\n lcb_GUESSVB *guess = guesses + ii;\n lcbvb_VBUCKET *vb = cfg->vbuckets + ii;\n\n if (!guess->used) {\n continue;\n }\n\n \/* IF: Heuristically learned a new index, _and_ the old index (which is\n * known to be bad) is the same index stated by the new config *\/\n if (should_keep_guess(guess, vb)) {\n lcb_log(LOGARGS(instance, TRACE), \"Keeping heuristically guessed index. VBID=%d. Current=%d. Old=%d.\", ii, guess->newix, guess->oldix);\n vb->servers[0] = guess->newix;\n } else {\n \/* We don't reassign to the guess structure here. The idea is that\n * we will simply use the new config. If this gives us problems, the\n * config will re-learn again. *\/\n lcb_log(LOGARGS(instance, TRACE), \"Ignoring heuristically guessed index. VBID=%d. Current=%d. Old=%d. New=%d\", ii, guess->newix, guess->oldix, vb->servers[0]);\n guess->used = 0;\n }\n }\n}\n\nint\nlcb_vbguess_remap(lcb_t instance, int vbid, int bad)\n{\n\n if (LCBT_SETTING(instance, vb_noguess)) {\n int newix = lcbvb_nmv_remap_ex(LCBT_VBCONFIG(instance), vbid, bad, 0);\n if (newix > -1 && newix != bad) {\n lcb_log(LOGARGS(instance, TRACE), \"Got new index from ffmap. VBID=%d. Old=%d. New=%d\", vbid, bad, newix);\n }\n return newix;\n\n } else {\n lcb_GUESSVB *guesses = instance->vbguess;\n lcb_GUESSVB *guess = guesses + vbid;\n int newix = lcbvb_nmv_remap_ex(LCBT_VBCONFIG(instance), vbid, bad, 1);\n if (!guesses) {\n guesses = instance->vbguess = reinterpret_cast<lcb_GUESSVB*>(calloc(\n LCBT_VBCONFIG(instance)->nvb, sizeof *guesses));\n }\n if (newix > -1 && newix != bad) {\n guess->newix = newix;\n guess->oldix = bad;\n guess->used = 1;\n guess->last_update = time(NULL);\n lcb_log(LOGARGS(instance, TRACE), \"Guessed new heuristic index VBID=%d. Old=%d. New=%d\", vbid, bad, newix);\n }\n return newix;\n }\n}\n\n\/**\n * Finds the index of an older server using the current config.\n *\n * This function is used to help reuse the server structures for memcached\n * packets.\n *\n * @param oldconfig The old configuration. This is the configuration the\n * old server is bound to\n * @param newconfig The new configuration. This will be inspected for new\n * nodes which may have been added, and ones which may have been removed.\n * @param server The server to match\n * @return The new index, or -1 if the current server is not present in the new\n * config.\n *\/\nstatic int\nfind_new_data_index(lcbvb_CONFIG *oldconfig, lcbvb_CONFIG* newconfig,\n lcb::Server *server)\n{\n const char *old_datahost = lcbvb_get_hostport(oldconfig,\n server->get_index(), LCBVB_SVCTYPE_DATA, LCBVB_SVCMODE_PLAIN);\n\n if (!old_datahost) {\n \/* Old server had no data service *\/\n return -1;\n }\n\n for (size_t ii = 0; ii < LCBVB_NSERVERS(newconfig); ii++) {\n const char *new_datahost = lcbvb_get_hostport(newconfig, ii,\n LCBVB_SVCTYPE_DATA, LCBVB_SVCMODE_PLAIN);\n if (new_datahost && strcmp(new_datahost, old_datahost) == 0) {\n return ii;\n }\n }\n return -1;\n}\n\nstatic void\nlog_vbdiff(lcb_t instance, lcbvb_CONFIGDIFF *diff)\n{\n lcb_log(LOGARGS(instance, INFO), \"Config Diff: [ vBuckets Modified=%d ], [Sequence Changed=%d]\", diff->n_vb_changes, diff->sequence_changed);\n if (diff->servers_added) {\n for (char **curserver = diff->servers_added; *curserver; curserver++) {\n lcb_log(LOGARGS(instance, INFO), \"Detected server %s added\", *curserver);\n }\n }\n if (diff->servers_removed) {\n for (char **curserver = diff->servers_removed; *curserver; curserver++) {\n lcb_log(LOGARGS(instance, INFO), \"Detected server %s removed\", *curserver);\n }\n }\n}\n\n\/**\n * This callback is invoked for packet relocation twice. It tries to relocate\n * commands to their destination server. Some commands may not be relocated\n * either because they have no explicit \"Relocation Information\" (i.e. no\n * specific vbucket) or because the command is tied to a specific server (i.e.\n * CMD_STAT).\n *\n * Note that `KEEP_PACKET` here doesn't mean to \"Save\" the packet, but rather\n * to keep the packet in the current queue (so that if the server ends up\n * being removed, the command will fail); rather than being relocated to\n * another server.\n *\/\nstatic int\niterwipe_cb(mc_CMDQUEUE *cq, mc_PIPELINE *oldpl, mc_PACKET *oldpkt, void *)\n{\n protocol_binary_request_header hdr;\n lcb::Server *srv = static_cast<lcb::Server *>(oldpl);\n int newix;\n\n mcreq_read_hdr(oldpkt, &hdr);\n\n if (!lcb_should_retry(srv->get_settings(), oldpkt, LCB_MAX_ERROR)) {\n return MCREQ_KEEP_PACKET;\n }\n\n if (LCBVB_DISTTYPE(cq->config) == LCBVB_DIST_VBUCKET) {\n newix = lcbvb_vbmaster(cq->config, ntohs(hdr.request.vbucket));\n\n } else {\n const void *key = NULL;\n lcb_SIZE nkey = 0;\n int tmpid;\n\n \/* XXX: We ignore hashkey. This is going away soon, and is probably\n * better than simply failing the items. *\/\n mcreq_get_key(oldpkt, &key, &nkey);\n lcbvb_map_key(cq->config, key, nkey, &tmpid, &newix);\n }\n\n if (newix < 0 || newix > (int)cq->npipelines-1) {\n return MCREQ_KEEP_PACKET;\n }\n\n\n mc_PIPELINE *newpl = cq->pipelines[newix];\n if (newpl == oldpl || newpl == NULL) {\n return MCREQ_KEEP_PACKET;\n }\n\n lcb_log(LOGARGS((lcb_t)cq->cqdata, DEBUG), \"Remapped packet %p (SEQ=%u) from \"SERVER_FMT \" to \" SERVER_FMT,\n (void*)oldpkt, oldpkt->opaque, SERVER_ARGS((lcb::Server*)oldpl), SERVER_ARGS((lcb::Server*)newpl));\n\n \/** Otherwise, copy over the packet and find the new vBucket to map to *\/\n mc_PACKET *newpkt = mcreq_renew_packet(oldpkt);\n newpkt->flags &= ~MCREQ_STATE_FLAGS;\n mcreq_reenqueue_packet(newpl, newpkt);\n mcreq_packet_handled(oldpl, oldpkt);\n return MCREQ_REMOVE_PACKET;\n}\n\nstatic void\nreplace_config(lcb_t instance, lcbvb_CONFIG *oldconfig, lcbvb_CONFIG *newconfig)\n{\n mc_CMDQUEUE *cq = &instance->cmdq;\n mc_PIPELINE **ppold, **ppnew;\n unsigned ii, nold, nnew;\n\n assert(LCBT_VBCONFIG(instance) == newconfig);\n\n nnew = LCBVB_NSERVERS(newconfig);\n ppnew = reinterpret_cast<mc_PIPELINE**>(calloc(nnew, sizeof(*ppnew)));\n ppold = mcreq_queue_take_pipelines(cq, &nold);\n\n \/**\n * Determine which existing servers are still part of the new cluster config\n * and place it inside the new list.\n *\/\n for (ii = 0; ii < nold; ii++) {\n lcb::Server *cur = static_cast<lcb::Server *>(ppold[ii]);\n int newix = find_new_data_index(oldconfig, newconfig, cur);\n if (newix > -1) {\n cur->set_new_index(newix);\n ppnew[newix] = cur;\n ppold[ii] = NULL;\n lcb_log(LOGARGS(instance, INFO), \"Reusing server \"SERVER_FMT\". OldIndex=%d. NewIndex=%d\", SERVER_ARGS(cur), ii, newix);\n }\n }\n\n \/**\n * Once we've moved the kept servers to the new list, allocate new lcb::Server\n * structures for slots that don't have an existing lcb::Server. We must do\n * this before add_pipelines() is called, so that there are no holes inside\n * ppnew\n *\/\n for (ii = 0; ii < nnew; ii++) {\n if (!ppnew[ii]) {\n ppnew[ii] = new lcb::Server(instance, ii);\n }\n }\n\n \/**\n * Once we have all the server structures in place for the new config,\n * transfer the new config along with the new list over to the CQ structure.\n *\/\n mcreq_queue_add_pipelines(cq, ppnew, nnew, newconfig);\n for (ii = 0; ii < nnew; ii++) {\n mcreq_iterwipe(cq, ppnew[ii], iterwipe_cb, NULL);\n }\n\n \/**\n * Go through all the servers that are to be removed and relocate commands\n * from their queues into the new queues\n *\/\n for (ii = 0; ii < nold; ii++) {\n if (!ppold[ii]) {\n continue;\n }\n\n mcreq_iterwipe(cq, ppold[ii], iterwipe_cb, NULL);\n static_cast<lcb::Server*>(ppold[ii])->purge(LCB_MAP_CHANGED);\n static_cast<lcb::Server*>(ppold[ii])->close();\n }\n\n for (ii = 0; ii < nnew; ii++) {\n if (static_cast<lcb::Server*>(ppnew[ii])->has_pending()) {\n ppnew[ii]->flush_start(ppnew[ii]);\n }\n }\n\n free(ppnew);\n free(ppold);\n}\n\nvoid lcb_update_vbconfig(lcb_t instance, clconfig_info *config)\n{\n lcb_configuration_t change_status;\n clconfig_info *old_config = instance->cur_configinfo;\n mc_CMDQUEUE *q = &instance->cmdq;\n\n instance->cur_configinfo = config;\n lcb_clconfig_incref(config);\n q->config = instance->cur_configinfo->vbc;\n q->cqdata = instance;\n\n if (old_config) {\n lcbvb_CONFIGDIFF *diff = lcbvb_compare(old_config->vbc, config->vbc);\n\n if (diff) {\n log_vbdiff(instance, diff);\n lcbvb_free_diff(diff);\n }\n\n \/* Apply the vb guesses *\/\n lcb_vbguess_newconfig(instance, config->vbc, instance->vbguess);\n\n replace_config(instance, old_config->vbc, config->vbc);\n lcb_clconfig_decref(old_config);\n change_status = LCB_CONFIGURATION_CHANGED;\n } else {\n size_t nservers = VB_NSERVERS(config->vbc);\n std::vector<mc_PIPELINE*> servers;\n\n for (size_t ii = 0; ii < nservers; ii++) {\n servers.push_back(new lcb::Server(instance, ii));\n }\n\n mcreq_queue_add_pipelines(q, &servers[0], nservers, config->vbc);\n change_status = LCB_CONFIGURATION_NEW;\n }\n\n \/* Update the list of nodes here for server list *\/\n instance->ht_nodes->clear();\n for (size_t ii = 0; ii < LCBVB_NSERVERS(config->vbc); ++ii) {\n const char *hp = lcbvb_get_hostport(config->vbc, ii,\n LCBVB_SVCTYPE_MGMT, LCBVB_SVCMODE_PLAIN);\n if (hp) {\n instance->ht_nodes->add(hp, LCB_CONFIG_HTTP_PORT);\n }\n }\n\n instance->callbacks.configuration(instance, change_status);\n lcb_maybe_breakout(instance);\n}\n<|endoftext|>"} {"text":"<commit_before>#include \"eval.hh\"\n#include \"command.hh\"\n#include \"common-args.hh\"\n#include \"shared.hh\"\n#include \"store-api.hh\"\n#include \"local-fs-store.hh\"\n\n#include <nlohmann\/json.hpp>\n\nusing namespace nix;\n\nstruct CmdBuild : InstallablesCommand, MixDryRun, MixJSON, MixProfile\n{\n Path outLink = \"result\";\n BuildMode buildMode = bmNormal;\n\n CmdBuild()\n {\n addFlag({\n .longName = \"out-link\",\n .shortName = 'o',\n .description = \"Use *path* as prefix for the symlinks to the build results. It defaults to `result`.\",\n .labels = {\"path\"},\n .handler = {&outLink},\n .completer = completePath\n });\n\n addFlag({\n .longName = \"no-link\",\n .description = \"Do not create symlinks to the build results.\",\n .handler = {&outLink, Path(\"\")},\n });\n\n addFlag({\n .longName = \"rebuild\",\n .description = \"Rebuild an already built package and compare the result to the existing store paths.\",\n .handler = {&buildMode, bmCheck},\n });\n }\n\n std::string description() override\n {\n return \"build a derivation or fetch a store path\";\n }\n\n std::string doc() override\n {\n return\n #include \"build.md\"\n ;\n }\n\n void run(ref<Store> store) override\n {\n auto buildables = build(store, dryRun ? Realise::Nothing : Realise::Outputs, installables, buildMode);\n\n if (json) logger->cout(\"%s\", derivedPathsWithHintsToJSON(buildables, store).dump());\n\n if (dryRun) return;\n\n if (outLink != \"\")\n if (auto store2 = store.dynamic_pointer_cast<LocalFSStore>())\n for (const auto & [_i, buildable] : enumerate(buildables)) {\n auto i = _i;\n std::visit(overloaded {\n [&](BuiltPath::Opaque bo) {\n std::string symlink = outLink;\n if (i) symlink += fmt(\"-%d\", i);\n store2->addPermRoot(bo.path, absPath(symlink));\n },\n [&](BuiltPath::Built bfd) {\n auto builtOutputs = store->queryDerivationOutputMap(bfd.drvPath);\n for (auto & output : builtOutputs) {\n std::string symlink = outLink;\n if (i) symlink += fmt(\"-%d\", i);\n if (output.first != \"out\") symlink += fmt(\"-%s\", output.first);\n store2->addPermRoot(output.second, absPath(symlink));\n }\n },\n }, buildable.raw());\n }\n\n updateProfile(buildables);\n }\n};\n\nstatic auto rCmdBuild = registerCommand<CmdBuild>(\"build\");\n<commit_msg>Only symlink the requested outputs in `nix build`<commit_after>#include \"eval.hh\"\n#include \"command.hh\"\n#include \"common-args.hh\"\n#include \"shared.hh\"\n#include \"store-api.hh\"\n#include \"local-fs-store.hh\"\n\n#include <nlohmann\/json.hpp>\n\nusing namespace nix;\n\nstruct CmdBuild : InstallablesCommand, MixDryRun, MixJSON, MixProfile\n{\n Path outLink = \"result\";\n BuildMode buildMode = bmNormal;\n\n CmdBuild()\n {\n addFlag({\n .longName = \"out-link\",\n .shortName = 'o',\n .description = \"Use *path* as prefix for the symlinks to the build results. It defaults to `result`.\",\n .labels = {\"path\"},\n .handler = {&outLink},\n .completer = completePath\n });\n\n addFlag({\n .longName = \"no-link\",\n .description = \"Do not create symlinks to the build results.\",\n .handler = {&outLink, Path(\"\")},\n });\n\n addFlag({\n .longName = \"rebuild\",\n .description = \"Rebuild an already built package and compare the result to the existing store paths.\",\n .handler = {&buildMode, bmCheck},\n });\n }\n\n std::string description() override\n {\n return \"build a derivation or fetch a store path\";\n }\n\n std::string doc() override\n {\n return\n #include \"build.md\"\n ;\n }\n\n void run(ref<Store> store) override\n {\n auto buildables = build(store, dryRun ? Realise::Nothing : Realise::Outputs, installables, buildMode);\n\n if (json) logger->cout(\"%s\", derivedPathsWithHintsToJSON(buildables, store).dump());\n\n if (dryRun) return;\n\n if (outLink != \"\")\n if (auto store2 = store.dynamic_pointer_cast<LocalFSStore>())\n for (const auto & [_i, buildable] : enumerate(buildables)) {\n auto i = _i;\n std::visit(overloaded {\n [&](BuiltPath::Opaque bo) {\n std::string symlink = outLink;\n if (i) symlink += fmt(\"-%d\", i);\n store2->addPermRoot(bo.path, absPath(symlink));\n },\n [&](BuiltPath::Built bfd) {\n for (auto & output : bfd.outputs) {\n std::string symlink = outLink;\n if (i) symlink += fmt(\"-%d\", i);\n if (output.first != \"out\") symlink += fmt(\"-%s\", output.first);\n store2->addPermRoot(output.second, absPath(symlink));\n }\n },\n }, buildable.raw());\n }\n\n updateProfile(buildables);\n }\n};\n\nstatic auto rCmdBuild = registerCommand<CmdBuild>(\"build\");\n<|endoftext|>"} {"text":"<commit_before>#include \"src\/operation.h\"\n#include \"src\/internal.h\"\n#include \"src\/graph.h\"\n#include \"src\/tensor.h\"\n\nusing namespace v8;\n\nnamespace TensorflowNode {\n\n#define OP_PROPERTY_GETTER(NAME) \\\n TensorflowNode::Operation* operation = \\\n ObjectWrap::Unwrap<TensorflowNode::Operation>(info.This()); \\\n if (operation->_oper == NULL) \\\n return Nan::ThrowTypeError(\"operation is not created yet.\"); \\\n Local<String> val = \\\n Nan::New<String>(TF_Operation ## NAME(operation->_oper)).ToLocalChecked(); \\\n info.GetReturnValue().Set(val); \\\n\n\nNAN_MODULE_INIT(Operation::Init) {\n Local<FunctionTemplate> tmpl = Nan::New<FunctionTemplate>(New);\n tmpl->SetClassName(Nan::New(\"Operation\").ToLocalChecked());\n tmpl->InstanceTemplate()->SetInternalFieldCount(1);\n\n Nan::SetAccessor(tmpl->InstanceTemplate(), \n Nan::New<String>(\"name\").ToLocalChecked(), NameGetter);\n Nan::SetAccessor(tmpl->InstanceTemplate(), \n Nan::New<String>(\"type\").ToLocalChecked(), TypeGetter);\n Nan::SetAccessor(tmpl->InstanceTemplate(), \n Nan::New<String>(\"device\").ToLocalChecked(), DeviceGetter);\n Nan::SetAccessor(tmpl->InstanceTemplate(),\n Nan::New<String>(\"outputs\").ToLocalChecked(), OutputsGetter);\n\n Nan::SetPrototypeMethod(tmpl, \"setAttrType\", SetAttrType);\n Nan::SetPrototypeMethod(tmpl, \"SetAttrBool\", SetAttrBool);\n Nan::SetPrototypeMethod(tmpl, \"SetAttrInt\", SetAttrInt);\n Nan::SetPrototypeMethod(tmpl, \"SetAttrFloat\", SetAttrFloat);\n Nan::SetPrototypeMethod(tmpl, \"setAttrString\", SetAttrString);\n Nan::SetPrototypeMethod(tmpl, \"setAttrShape\", SetAttrShape);\n Nan::SetPrototypeMethod(tmpl, \"setAttrTensor\", SetAttrTensor);\n Nan::SetPrototypeMethod(tmpl, \"addInput\", AddInput);\n Nan::SetPrototypeMethod(tmpl, \"addInputList\", AddInputList);\n Nan::SetPrototypeMethod(tmpl, \"addControlInput\", AddControlInput);\n Nan::SetPrototypeMethod(tmpl, \"finish\", Finish);\n\n Local<Function> func = Nan::GetFunction(tmpl).ToLocalChecked();\n constructor().Reset(func);\n Nan::Set(target, Nan::New(\"Operation\").ToLocalChecked(), func);\n}\n\nNAN_METHOD(Operation::New) {\n if (info.Length() == 0) {\n return Nan::ThrowTypeError(\"should call with graph, type and name.\");\n }\n TensorflowNode::Graph* graph = ObjectWrap::Unwrap<TensorflowNode::Graph>(info[0]->ToObject());\n TensorflowNode::Operation* operation;\n\n if (info.Length() >= 3) {\n V8_STRING_TO_CSTR(type, info[1]);\n V8_STRING_TO_CSTR(name, info[2]);\n operation = new TensorflowNode::Operation(graph->_graph, type, name);\n } else {\n operation = new TensorflowNode::Operation();\n }\n operation->Wrap(info.This());\n\n \/\/ this._graph = graph\n Nan::Set(info.This(), Nan::New<String>(\"_graph\").ToLocalChecked(), info[0]);\n info.GetReturnValue().Set(info.This());\n}\n\nNAN_PROPERTY_GETTER(Operation::NameGetter) {\n OP_PROPERTY_GETTER(Name);\n}\n\nNAN_PROPERTY_GETTER(Operation::TypeGetter) {\n OP_PROPERTY_GETTER(OpType);\n}\n\nNAN_PROPERTY_GETTER(Operation::DeviceGetter) {\n OP_PROPERTY_GETTER(Device);\n}\n\nNAN_PROPERTY_GETTER(Operation::OutputsGetter) {\n Local<Object> graphObj = Nan::Get(info.This(), Nan::New<String>(\"_graph\").ToLocalChecked()).ToLocalChecked()->ToObject();\n TensorflowNode::Graph* graph = ObjectWrap::Unwrap<TensorflowNode::Graph>(graphObj);\n TensorflowNode::Operation* operation = ObjectWrap::Unwrap<TensorflowNode::Operation>(info.This());\n if (operation->_oper == NULL)\n return Nan::ThrowTypeError(\"operation is not created yet.\");\n int numOfOutputs = TF_OperationNumOutputs(operation->_oper);\n Local<Array> outputsObj = Nan::New<Array>(numOfOutputs);\n\n for (int i = 0; i < numOfOutputs; i++) {\n TF_Output output = TF_Output{operation->_oper, i};\n int numOfDims = TF_GraphGetTensorNumDims(graph->_graph, output, status);\n if (TF_GetCode(status) != TF_OK) {\n ThrowStatusError();\n return;\n }\n int64_t dims[numOfDims];\n TF_GraphGetTensorShape(graph->_graph, output, dims, numOfDims, status);\n if (TF_GetCode(status) != TF_OK) {\n ThrowStatusError();\n return;\n }\n\n TF_DataType type = TF_OperationOutputType(output);\n Local<Object> item = Nan::New<Object>();\n Local<Array> shape = Nan::New<Array>(numOfDims);\n for (int j = 0; j < numOfDims; j++) {\n Nan::Set(shape, j, Nan::New<Number>(dims[i]));\n }\n Nan::Set(item, Nan::New<String>(\"shape\").ToLocalChecked(), shape);\n Nan::Set(item, Nan::New<String>(\"type\").ToLocalChecked(), Nan::New<Number>((int)type));\n Nan::Set(outputsObj, i, item);\n }\n info.GetReturnValue().Set(outputsObj);\n}\n\nNAN_METHOD(Operation::SetAttrType) {\n if (info.Length() != 2) {\n Nan::ThrowTypeError(\"attr name and type are required\");\n return;\n }\n TensorflowNode::Operation* operation = ObjectWrap::Unwrap<TensorflowNode::Operation>(info.This());\n V8_STRING_TO_CSTR(name, info[0]);\n TF_DataType type = (TF_DataType)info[1]->Uint32Value();\n TF_SetAttrType(operation->_description, name, type);\n info.GetReturnValue().Set(info.This());\n}\n\nNAN_METHOD(Operation::SetAttrBool) {\n if (info.Length() != 2) {\n Nan::ThrowTypeError(\"attr name and value are required\");\n return;\n }\n TensorflowNode::Operation* operation = ObjectWrap::Unwrap<TensorflowNode::Operation>(info.This());\n V8_STRING_TO_CSTR(name, info[0]);\n bool value = info[1]->BooleanValue();\n TF_SetAttrBool(operation->_description, name, value);\n info.GetReturnValue().Set(info.This());\n}\n\nNAN_METHOD(Operation::SetAttrInt) {\n if (info.Length() != 2) {\n Nan::ThrowTypeError(\"attr name and value are required\");\n return;\n }\n TensorflowNode::Operation* operation = ObjectWrap::Unwrap<TensorflowNode::Operation>(info.This());\n V8_STRING_TO_CSTR(name, info[0]);\n int64_t value = info[1]->IntegerValue();\n TF_SetAttrInt(operation->_description, name, value);\n info.GetReturnValue().Set(info.This());\n}\n\nNAN_METHOD(Operation::SetAttrFloat) {\n if (info.Length() != 2) {\n Nan::ThrowTypeError(\"attr name and value are required\");\n return;\n }\n TensorflowNode::Operation* operation = ObjectWrap::Unwrap<TensorflowNode::Operation>(info.This());\n V8_STRING_TO_CSTR(name, info[0]);\n double value = info[1]->NumberValue();\n TF_SetAttrFloat(operation->_description, name, (float)value);\n info.GetReturnValue().Set(info.This());\n}\n\nNAN_METHOD(Operation::SetAttrString) {\n if (info.Length() != 2) {\n Nan::ThrowTypeError(\"attr name and value are required\");\n return;\n }\n TensorflowNode::Operation* operation = ObjectWrap::Unwrap<TensorflowNode::Operation>(info.This());\n V8_STRING_TO_CSTR(name, info[0]);\n V8_STRING_TO_CSTR(value, info[1]);\n size_t len = info[1]->ToString()->Length();\n TF_SetAttrString(operation->_description, name, value, len);\n info.GetReturnValue().Set(info.This());\n}\n\nNAN_METHOD(Operation::SetAttrShape) {\n if (info.Length() != 2) {\n Nan::ThrowTypeError(\"attr name and dims\/shape are required\");\n }\n\n TensorflowNode::Operation* operation = ObjectWrap::Unwrap<TensorflowNode::Operation>(info.This());\n V8_STRING_TO_CSTR(name, info[0]);\n Local<Object> maybeDims = info[1]->ToObject();\n if (!maybeDims->IsArray()) {\n Nan::ThrowError(\"The second parameter `shape` should be an array\");\n return;\n }\n\n Local<String> lenstr = Nan::New(\"length\").ToLocalChecked();\n size_t numOfDims = Nan::Get(maybeDims, lenstr).ToLocalChecked()->Uint32Value();\n int64_t dims[numOfDims];\n\n for (size_t i = 0; i < numOfDims; i++) {\n dims[i] = Nan::Get(maybeDims, i).ToLocalChecked()->Int32Value();\n }\n\n TF_SetAttrShape(operation->_description, name, dims, numOfDims);\n info.GetReturnValue().Set(info.This());\n}\n\nNAN_METHOD(Operation::SetAttrTensor) {\n if (info.Length() != 2) {\n Nan::ThrowTypeError(\"attr name and tensor are required\");\n return;\n }\n TensorflowNode::Operation* operation = ObjectWrap::Unwrap<TensorflowNode::Operation>(info.This());\n V8_STRING_TO_CSTR(name, info[0]);\n TensorflowNode::Tensor* tensor = ObjectWrap::Unwrap<TensorflowNode::Tensor>(info[1]->ToObject());\n TF_SetAttrTensor(operation->_description, name, tensor->_tensor, status);\n if (TF_GetCode(status) != TF_OK) {\n return ThrowStatusError();\n }\n info.GetReturnValue().Set(info.This());\n}\n\nNAN_METHOD(Operation::AddInput) {\n if (info.Length() == 0) {\n Nan::ThrowTypeError(\"input is required\");\n return;\n }\n\n TF_Output input;\n {\n int index = info[0]->Int32Value();\n TensorflowNode::Operation* op = ObjectWrap::Unwrap<TensorflowNode::Operation>(info[1]->ToObject());\n input = TF_Output{op->_oper, index};\n }\n\n TensorflowNode::Operation* operation = ObjectWrap::Unwrap<TensorflowNode::Operation>(info.This());\n TF_AddInput(operation->_description, input);\n info.GetReturnValue().Set(info.This());\n}\n\nNAN_METHOD(Operation::AddInputList) {\n if (info.Length() == 0 || !info[0]->IsArray()) {\n Nan::ThrowTypeError(\"inputs is required and be an Array\");\n return;\n }\n\n Local<Array> list = Local<Array>::Cast(info[0]);\n size_t len = list->Length();\n TF_Output inputs[len];\n\n for (size_t i = 0; i < len; i++) {\n Local<Object> item = Nan::Get(list, i).ToLocalChecked()->ToObject();\n Local<Value> indexKey = Nan::New<String>(\"index\").ToLocalChecked();\n Local<Value> opKey = Nan::New<String>(\"op\").ToLocalChecked();\n\n int index = Nan::Get(item, indexKey).ToLocalChecked()->Int32Value();\n Local<Object> op = Nan::Get(item, opKey).ToLocalChecked()->ToObject();\n\n TensorflowNode::Operation* operation = ObjectWrap::Unwrap<TensorflowNode::Operation>(op);\n inputs[i] = TF_Output{operation->_oper, index};\n }\n\n TensorflowNode::Operation* operation = ObjectWrap::Unwrap<TensorflowNode::Operation>(info.This());\n TF_AddInputList(operation->_description, inputs, len);\n info.GetReturnValue().Set(info.This());\n}\n\nNAN_METHOD(Operation::AddControlInput) {\n if (info.Length() == 0) {\n Nan::ThrowTypeError(\"input is required\");\n return;\n }\n TensorflowNode::Operation* input = ObjectWrap::Unwrap<TensorflowNode::Operation>(info[0]->ToObject());\n TensorflowNode::Operation* operation = ObjectWrap::Unwrap<TensorflowNode::Operation>(info.This());\n TF_AddControlInput(operation->_description, input->_oper);\n info.GetReturnValue().Set(info.This());\n}\n\nNAN_METHOD(Operation::Finish) {\n TensorflowNode::Operation* operation = ObjectWrap::Unwrap<TensorflowNode::Operation>(info.This());\n if (operation->_oper != NULL) {\n return Nan::ThrowError(\"finish is can be called once\");\n }\n\n TF_Operation* oper = TF_FinishOperation(operation->_description, status);\n if (TF_GetCode(status) == TF_OK) {\n operation->_oper = oper;\n } else {\n ThrowStatusError();\n }\n}\n\nLocal<Object>\nOperation::NewFromOperation(Local<Object> graph, TF_Operation* oper) {\n Nan::EscapableHandleScope scope;\n Local<Function> tmpl = Nan::New(constructor());\n Local<Value> argv[1] = { graph };\n Local<Object> target = Nan::NewInstance(tmpl, 1, argv).ToLocalChecked();\n TensorflowNode::Operation *operation = ObjectWrap::Unwrap<TensorflowNode::Operation>(target);\n operation->_oper = oper;\n return scope.Escape(target);\n}\n\nOperation::Operation() {\n \/\/ Placeholder\n}\n\nOperation::Operation(TF_Graph* graph, const char* type, const char* name) {\n _description = TF_NewOperation(graph, type, name);\n _oper = NULL;\n}\n\nOperation::~Operation() {\n \/\/ TODO\n}\n\ninline Nan::Persistent<v8::Function>& \nOperation::constructor() {\n static Nan::Persistent<v8::Function> my_constructor;\n return my_constructor;\n}\n\n}<commit_msg>operation: consider numOfDims(-1) in outputs getter<commit_after>#include \"src\/operation.h\"\n#include \"src\/internal.h\"\n#include \"src\/graph.h\"\n#include \"src\/tensor.h\"\n\nusing namespace v8;\n\nnamespace TensorflowNode {\n\n#define OP_PROPERTY_GETTER(NAME) \\\n TensorflowNode::Operation* operation = \\\n ObjectWrap::Unwrap<TensorflowNode::Operation>(info.This()); \\\n if (operation->_oper == NULL) \\\n return Nan::ThrowTypeError(\"operation is not created yet.\"); \\\n Local<String> val = \\\n Nan::New<String>(TF_Operation ## NAME(operation->_oper)).ToLocalChecked(); \\\n info.GetReturnValue().Set(val); \\\n\n\nNAN_MODULE_INIT(Operation::Init) {\n Local<FunctionTemplate> tmpl = Nan::New<FunctionTemplate>(New);\n tmpl->SetClassName(Nan::New(\"Operation\").ToLocalChecked());\n tmpl->InstanceTemplate()->SetInternalFieldCount(1);\n\n Nan::SetAccessor(tmpl->InstanceTemplate(), \n Nan::New<String>(\"name\").ToLocalChecked(), NameGetter);\n Nan::SetAccessor(tmpl->InstanceTemplate(), \n Nan::New<String>(\"type\").ToLocalChecked(), TypeGetter);\n Nan::SetAccessor(tmpl->InstanceTemplate(), \n Nan::New<String>(\"device\").ToLocalChecked(), DeviceGetter);\n Nan::SetAccessor(tmpl->InstanceTemplate(),\n Nan::New<String>(\"outputs\").ToLocalChecked(), OutputsGetter);\n\n Nan::SetPrototypeMethod(tmpl, \"setAttrType\", SetAttrType);\n Nan::SetPrototypeMethod(tmpl, \"SetAttrBool\", SetAttrBool);\n Nan::SetPrototypeMethod(tmpl, \"SetAttrInt\", SetAttrInt);\n Nan::SetPrototypeMethod(tmpl, \"SetAttrFloat\", SetAttrFloat);\n Nan::SetPrototypeMethod(tmpl, \"setAttrString\", SetAttrString);\n Nan::SetPrototypeMethod(tmpl, \"setAttrShape\", SetAttrShape);\n Nan::SetPrototypeMethod(tmpl, \"setAttrTensor\", SetAttrTensor);\n Nan::SetPrototypeMethod(tmpl, \"addInput\", AddInput);\n Nan::SetPrototypeMethod(tmpl, \"addInputList\", AddInputList);\n Nan::SetPrototypeMethod(tmpl, \"addControlInput\", AddControlInput);\n Nan::SetPrototypeMethod(tmpl, \"finish\", Finish);\n\n Local<Function> func = Nan::GetFunction(tmpl).ToLocalChecked();\n constructor().Reset(func);\n Nan::Set(target, Nan::New(\"Operation\").ToLocalChecked(), func);\n}\n\nNAN_METHOD(Operation::New) {\n if (info.Length() == 0) {\n return Nan::ThrowTypeError(\"should call with graph, type and name.\");\n }\n TensorflowNode::Graph* graph = ObjectWrap::Unwrap<TensorflowNode::Graph>(info[0]->ToObject());\n TensorflowNode::Operation* operation;\n\n if (info.Length() >= 3) {\n V8_STRING_TO_CSTR(type, info[1]);\n V8_STRING_TO_CSTR(name, info[2]);\n operation = new TensorflowNode::Operation(graph->_graph, type, name);\n } else {\n operation = new TensorflowNode::Operation();\n }\n operation->Wrap(info.This());\n\n \/\/ this._graph = graph\n Nan::Set(info.This(), Nan::New<String>(\"_graph\").ToLocalChecked(), info[0]);\n info.GetReturnValue().Set(info.This());\n}\n\nNAN_PROPERTY_GETTER(Operation::NameGetter) {\n OP_PROPERTY_GETTER(Name);\n}\n\nNAN_PROPERTY_GETTER(Operation::TypeGetter) {\n OP_PROPERTY_GETTER(OpType);\n}\n\nNAN_PROPERTY_GETTER(Operation::DeviceGetter) {\n OP_PROPERTY_GETTER(Device);\n}\n\nNAN_PROPERTY_GETTER(Operation::OutputsGetter) {\n Local<Object> graphObj = Nan::Get(info.This(), Nan::New<String>(\"_graph\").ToLocalChecked()).ToLocalChecked()->ToObject();\n TensorflowNode::Graph* graph = ObjectWrap::Unwrap<TensorflowNode::Graph>(graphObj);\n TensorflowNode::Operation* operation = ObjectWrap::Unwrap<TensorflowNode::Operation>(info.This());\n if (operation->_oper == NULL)\n return Nan::ThrowTypeError(\"operation is not created yet.\");\n int numOfOutputs = TF_OperationNumOutputs(operation->_oper);\n Local<Array> outputsObj = Nan::New<Array>(numOfOutputs);\n\n for (int i = 0; i < numOfOutputs; i++) {\n TF_Output output = TF_Output{operation->_oper, i};\n int numOfDims = TF_GraphGetTensorNumDims(graph->_graph, output, status);\n if (TF_GetCode(status) != TF_OK) {\n ThrowStatusError();\n return;\n }\n\n TF_DataType type = TF_OperationOutputType(output);\n Local<Object> item = Nan::New<Object>();\n Local<Array> shape;\n\n \/\/ The `numOfDims` possibly to be -1\n if (numOfDims > 0) {\n int64_t dims[numOfDims];\n TF_GraphGetTensorShape(graph->_graph, output, dims, numOfDims, status);\n if (TF_GetCode(status) != TF_OK) {\n ThrowStatusError();\n return;\n }\n shape = Nan::New<Array>(numOfDims);\n } else {\n \/\/ if the `numOfDims` is -1, shape should be [], as a scalar value.\n shape = Nan::New<Array>(0);\n }\n Nan::Set(item, Nan::New<String>(\"shape\").ToLocalChecked(), shape);\n Nan::Set(item, \n Nan::New<String>(\"type\").ToLocalChecked(), \n Nan::New<Number>((int)type));\n Nan::Set(outputsObj, i, item);\n }\n info.GetReturnValue().Set(outputsObj);\n}\n\nNAN_METHOD(Operation::SetAttrType) {\n if (info.Length() != 2) {\n Nan::ThrowTypeError(\"attr name and type are required\");\n return;\n }\n TensorflowNode::Operation* operation = ObjectWrap::Unwrap<TensorflowNode::Operation>(info.This());\n V8_STRING_TO_CSTR(name, info[0]);\n TF_DataType type = (TF_DataType)info[1]->Uint32Value();\n TF_SetAttrType(operation->_description, name, type);\n info.GetReturnValue().Set(info.This());\n}\n\nNAN_METHOD(Operation::SetAttrBool) {\n if (info.Length() != 2) {\n Nan::ThrowTypeError(\"attr name and value are required\");\n return;\n }\n TensorflowNode::Operation* operation = ObjectWrap::Unwrap<TensorflowNode::Operation>(info.This());\n V8_STRING_TO_CSTR(name, info[0]);\n bool value = info[1]->BooleanValue();\n TF_SetAttrBool(operation->_description, name, value);\n info.GetReturnValue().Set(info.This());\n}\n\nNAN_METHOD(Operation::SetAttrInt) {\n if (info.Length() != 2) {\n Nan::ThrowTypeError(\"attr name and value are required\");\n return;\n }\n TensorflowNode::Operation* operation = ObjectWrap::Unwrap<TensorflowNode::Operation>(info.This());\n V8_STRING_TO_CSTR(name, info[0]);\n int64_t value = info[1]->IntegerValue();\n TF_SetAttrInt(operation->_description, name, value);\n info.GetReturnValue().Set(info.This());\n}\n\nNAN_METHOD(Operation::SetAttrFloat) {\n if (info.Length() != 2) {\n Nan::ThrowTypeError(\"attr name and value are required\");\n return;\n }\n TensorflowNode::Operation* operation = ObjectWrap::Unwrap<TensorflowNode::Operation>(info.This());\n V8_STRING_TO_CSTR(name, info[0]);\n double value = info[1]->NumberValue();\n TF_SetAttrFloat(operation->_description, name, (float)value);\n info.GetReturnValue().Set(info.This());\n}\n\nNAN_METHOD(Operation::SetAttrString) {\n if (info.Length() != 2) {\n Nan::ThrowTypeError(\"attr name and value are required\");\n return;\n }\n TensorflowNode::Operation* operation = ObjectWrap::Unwrap<TensorflowNode::Operation>(info.This());\n V8_STRING_TO_CSTR(name, info[0]);\n V8_STRING_TO_CSTR(value, info[1]);\n size_t len = info[1]->ToString()->Length();\n TF_SetAttrString(operation->_description, name, value, len);\n info.GetReturnValue().Set(info.This());\n}\n\nNAN_METHOD(Operation::SetAttrShape) {\n if (info.Length() != 2) {\n Nan::ThrowTypeError(\"attr name and dims\/shape are required\");\n }\n\n TensorflowNode::Operation* operation = ObjectWrap::Unwrap<TensorflowNode::Operation>(info.This());\n V8_STRING_TO_CSTR(name, info[0]);\n Local<Object> maybeDims = info[1]->ToObject();\n if (!maybeDims->IsArray()) {\n Nan::ThrowError(\"The second parameter `shape` should be an array\");\n return;\n }\n\n Local<String> lenstr = Nan::New(\"length\").ToLocalChecked();\n size_t numOfDims = Nan::Get(maybeDims, lenstr).ToLocalChecked()->Uint32Value();\n int64_t dims[numOfDims];\n\n for (size_t i = 0; i < numOfDims; i++) {\n dims[i] = Nan::Get(maybeDims, i).ToLocalChecked()->Int32Value();\n }\n\n TF_SetAttrShape(operation->_description, name, dims, numOfDims);\n info.GetReturnValue().Set(info.This());\n}\n\nNAN_METHOD(Operation::SetAttrTensor) {\n if (info.Length() != 2) {\n Nan::ThrowTypeError(\"attr name and tensor are required\");\n return;\n }\n TensorflowNode::Operation* operation = ObjectWrap::Unwrap<TensorflowNode::Operation>(info.This());\n V8_STRING_TO_CSTR(name, info[0]);\n TensorflowNode::Tensor* tensor = ObjectWrap::Unwrap<TensorflowNode::Tensor>(info[1]->ToObject());\n TF_SetAttrTensor(operation->_description, name, tensor->_tensor, status);\n if (TF_GetCode(status) != TF_OK) {\n return ThrowStatusError();\n }\n info.GetReturnValue().Set(info.This());\n}\n\nNAN_METHOD(Operation::AddInput) {\n if (info.Length() == 0) {\n Nan::ThrowTypeError(\"input is required\");\n return;\n }\n\n TF_Output input;\n {\n int index = info[0]->Int32Value();\n TensorflowNode::Operation* op = ObjectWrap::Unwrap<TensorflowNode::Operation>(info[1]->ToObject());\n input = TF_Output{op->_oper, index};\n }\n\n TensorflowNode::Operation* operation = ObjectWrap::Unwrap<TensorflowNode::Operation>(info.This());\n TF_AddInput(operation->_description, input);\n info.GetReturnValue().Set(info.This());\n}\n\nNAN_METHOD(Operation::AddInputList) {\n if (info.Length() == 0 || !info[0]->IsArray()) {\n Nan::ThrowTypeError(\"inputs is required and be an Array\");\n return;\n }\n\n Local<Array> list = Local<Array>::Cast(info[0]);\n size_t len = list->Length();\n TF_Output inputs[len];\n\n for (size_t i = 0; i < len; i++) {\n Local<Object> item = Nan::Get(list, i).ToLocalChecked()->ToObject();\n Local<Value> indexKey = Nan::New<String>(\"index\").ToLocalChecked();\n Local<Value> opKey = Nan::New<String>(\"op\").ToLocalChecked();\n\n int index = Nan::Get(item, indexKey).ToLocalChecked()->Int32Value();\n Local<Object> op = Nan::Get(item, opKey).ToLocalChecked()->ToObject();\n\n TensorflowNode::Operation* operation = ObjectWrap::Unwrap<TensorflowNode::Operation>(op);\n inputs[i] = TF_Output{operation->_oper, index};\n }\n\n TensorflowNode::Operation* operation = ObjectWrap::Unwrap<TensorflowNode::Operation>(info.This());\n TF_AddInputList(operation->_description, inputs, len);\n info.GetReturnValue().Set(info.This());\n}\n\nNAN_METHOD(Operation::AddControlInput) {\n if (info.Length() == 0) {\n Nan::ThrowTypeError(\"input is required\");\n return;\n }\n TensorflowNode::Operation* input = ObjectWrap::Unwrap<TensorflowNode::Operation>(info[0]->ToObject());\n TensorflowNode::Operation* operation = ObjectWrap::Unwrap<TensorflowNode::Operation>(info.This());\n TF_AddControlInput(operation->_description, input->_oper);\n info.GetReturnValue().Set(info.This());\n}\n\nNAN_METHOD(Operation::Finish) {\n TensorflowNode::Operation* operation = ObjectWrap::Unwrap<TensorflowNode::Operation>(info.This());\n if (operation->_oper != NULL) {\n return Nan::ThrowError(\"finish is can be called once\");\n }\n\n TF_Operation* oper = TF_FinishOperation(operation->_description, status);\n if (TF_GetCode(status) == TF_OK) {\n operation->_oper = oper;\n } else {\n ThrowStatusError();\n }\n}\n\nLocal<Object>\nOperation::NewFromOperation(Local<Object> graph, TF_Operation* oper) {\n Nan::EscapableHandleScope scope;\n Local<Function> tmpl = Nan::New(constructor());\n Local<Value> argv[1] = { graph };\n Local<Object> target = Nan::NewInstance(tmpl, 1, argv).ToLocalChecked();\n TensorflowNode::Operation *operation = ObjectWrap::Unwrap<TensorflowNode::Operation>(target);\n operation->_oper = oper;\n return scope.Escape(target);\n}\n\nOperation::Operation() {\n \/\/ Placeholder\n}\n\nOperation::Operation(TF_Graph* graph, const char* type, const char* name) {\n _description = TF_NewOperation(graph, type, name);\n _oper = NULL;\n}\n\nOperation::~Operation() {\n \/\/ TODO\n}\n\ninline Nan::Persistent<v8::Function>& \nOperation::constructor() {\n static Nan::Persistent<v8::Function> my_constructor;\n return my_constructor;\n}\n\n}<|endoftext|>"} {"text":"<commit_before>#ifndef BUBBLE_SORT_H\n#define BUBBLE_SORT_H 1\n\n#ifndef MAX\n#define MAX 60\n#endif\n#include <algorithm>\nusing namespace std;\n\n\nvoid BubbleSort(int s[MAX], int beg, int end)\n{\n for (int i = end-1; i >= beg; --i)\n for (int j = beg; j < i; ++j)\n if (s[j] > s[j+1])\n swap(s[j], s[j+1]);\n}\n\n\n#endif\n<commit_msg>add comment<commit_after>#ifndef BUBBLE_SORT_H\n#define BUBBLE_SORT_H 1\n\n#ifndef MAX\n#define MAX 60\n#endif\n#include <algorithm>\nusing namespace std;\n\n\n\/* ----------------------------------------------------------------------*\/\n\/**\n * @brief BubbleSort \n * 冒泡排序\n *\n * @param s[MAX] 无序序列\n * @param beg 序列s的末尾下标加1，即左闭右开区间[beg, end)\n * @param end 序列s的末尾下标加1\n *\/\n\/* ----------------------------------------------------------------------*\/\nvoid BubbleSort(int s[MAX], int beg, int end)\n{\n for (int i = end-1; i >= beg; --i)\n for (int j = beg; j < i; ++j)\n if (s[j] > s[j+1])\n swap(s[j], s[j+1]);\n}\n\n\n#endif\n<|endoftext|>"} {"text":"<commit_before>\/\/\n\/\/ Copyright 2013 Uncodin, 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 \"parser.h\"\n\nusing namespace std;\n\nstatic void rndr_blockcode(struct buf *ob, struct buf *text, void *opaque);\nstatic void rndr_blockquote(struct buf *ob, struct buf *text, void *opaque);\nstatic void rndr_header(struct buf *ob, struct buf *text, int level, void *opaque);\nstatic void rndr_list(struct buf *ob, struct buf *text, int flags, void *opaque);\nstatic void rndr_listitem(struct buf *ob, struct buf *text, int flags, void *opaque);\nstatic void rndr_paragraph(struct buf *ob, struct buf *text, void *opaque);\nstatic int rndr_codespan(struct buf *ob, struct buf *text, void *opaque);\nstatic int rndr_double_emphasis(struct buf *ob, struct buf *text, char c, void *opaque);\nstatic int rndr_emphasis(struct buf *ob, struct buf *text, char c, void *opaque);\nstatic int rndr_triple_emphasis(struct buf *ob, struct buf *text, char c, void *opaque);\nstatic int rndr_linebreak(struct buf *ob, void *opaque);\nstatic int rndr_link(struct buf *ob, struct buf *link, struct buf *title, struct buf *content, void *opaque);\nstatic void rndr_normal_text(struct buf *ob, struct buf *text, void *opaque);\n\nstruct mkd_renderer mkd_callbacks = {\n\t\/* document-level callbacks *\/\n\tNULL, \/\/ prolog\n\tNULL, \/\/ epilogue\n\n\t\/* block-level callbacks *\/\n\trndr_blockcode, \/\/ block code\n\trndr_blockquote, \/\/ block quote\n\tNULL, \/\/ block html\n\trndr_header, \/\/ header\n\tNULL, \/\/ hrule\n\trndr_list, \/\/ list\n\trndr_listitem, \/\/ listitem\n\trndr_paragraph, \/\/ paragraph\n\tNULL, \/\/ table\n\tNULL, \/\/ table cell\n\tNULL, \/\/ table row\n\n\t\/* span-level callbacks *\/\n\tNULL, \/\/ autolink\n\trndr_codespan, \/\/ codespan\n\trndr_double_emphasis, \/\/ double emphasis\n\trndr_emphasis, \/\/ emphasis\n\tNULL, \/\/ image\n\trndr_linebreak, \/\/ line break\n\trndr_link, \/\/ link\n\tNULL, \/\/ raw html tag\n\trndr_triple_emphasis, \/\/ triple emphasis\n\n\t\/* low-level callbacks *\/\n\tNULL, \/\/ entity\n\trndr_normal_text, \/\/ normal text\n\n\t\/* renderer data *\/\n\t64, \/\/ max stack\n\t\"*_\",\n\tNULL \/\/ opaque\n};\n\nnamespace Bypass {\n\n\tconst static std::string TWO_SPACES = \" \";\n\tconst static std::string NEWLINE = \"\\n\";\n\n\tParser::Parser()\n\t: elementSoup()\n\t{\n\t\telementCount = 1;\n\t}\n\n\tParser::~Parser() {\n\n\t}\n\n\tDocument Parser::parse(const char* mkd) {\n\t\tdocument = Document();\n\n\t\tif (mkd) {\n\t\t\tstruct buf *ib, *ob;\n\n\t\t\tib = bufnew(INPUT_UNIT);\n\t\t\tbufputs(ib, mkd);\n\n\t\t\tob = bufnew(OUTPUT_UNIT);\n\n\t\t\tmkd_callbacks.opaque = this;\n\n\t\t\t\/\/parse and assemble document\n\t\t\tmarkdown(ob, ib, &mkd_callbacks);\n\n\t\t\tfor (std::map<int, Element>::iterator it = elementSoup.begin(); it != elementSoup.end(); ++it) {\n\t\t\t\tdocument.append(it->second);\n\t\t\t}\n\n\t\t\tbufrelease(ib);\n\t\t\tbufrelease(ob);\n\t\t}\n\n\t\treturn document;\n\t}\n\n\tDocument Parser::parse(const string& markdown) {\n\t\treturn parse(markdown.c_str());\n\t}\n\n\tvoid Parser::eraseTrailingControlCharacters(const std::string& controlCharacters) {\n\t\tstd::map<int, Element>::iterator it = elementSoup.find(elementCount);\n\n\t\tif ( it != elementSoup.end() ) {\n\t\t\tElement * element = &((*it).second);\n\n\t\t\tif (boost::ends_with(element->text, controlCharacters)) {\n\t\t\t\tboost::erase_tail(element->text, controlCharacters.size());\n\t\t\t}\n\t\t}\n\t}\n\n\t\/\/ Block Element Callbacks\n\n\tvoid Parser::handleBlock(Type type, struct buf *ob, struct buf *text, int extra) {\n\t\tElement block;\n\t\tblock.setType(type);\n\n\t\tif (type == HEADER) {\n\t\t\tchar levelStr[2];\n\t\t\tsnprintf(levelStr, 2, \"%d\", extra);\n\t\t\tblock.addAttribute(\"level\", levelStr);\n\t\t}\n\n\t\tstd::string textString(text->data, text->data + text->size);\n\t\tstd::vector<std::string> strs;\n\t\tboost::split(strs, textString, boost::is_any_of(\"|\"));\n\n\t\tfor(vector<std::string>::iterator it = strs.begin(); it != strs.end(); it++) {\n\t\t\tint pos = atoi((*it).c_str());\n\t\t\tstd::map<int, Element>::iterator elit = elementSoup.find(pos);\n\n\t\t\tif ( elit != elementSoup.end() ) {\n\t\t\t\tblock.append((*elit).second);\n\t\t\t\telementSoup.erase(pos);\n\t\t\t}\n\t\t}\n\n\t\telementCount++;\n\n\t\tstd::ostringstream oss;\n\t\toss << elementCount;\n\t\telementSoup[elementCount] = block;\n\t\toss << '|';\n\t\tbufputs(ob, oss.str().c_str());\n\t}\n\n\tvoid Parser::parsedBlockCode(struct buf *ob, struct buf *text) {\n\t\tif(!text) return; \/\/ Analyze seems to believe that text can be null here\n\t\tparsedNormalText(ob, text);\n\t\teraseTrailingControlCharacters(NEWLINE);\n\n\t\tstd::ostringstream oss;\n\t\toss << elementCount << '|';\n\t\tbufreset(text);\n\t\tbufputs(text, oss.str().c_str());\n\t\thandleBlock(BLOCK_CODE, ob, text);\n\t}\n\n\tvoid Parser::parsedBlockQuote(struct buf *ob, struct buf *text) {\n\t\thandleBlock(BLOCK_QUOTE, ob, text);\n\t}\n\n\tvoid Parser::parsedHeader(struct buf *ob, struct buf *text, int level) {\n\t\thandleBlock(HEADER, ob, text, level);\n\t}\n\n\tvoid Parser::parsedList(struct buf *ob, struct buf *text, int flags) {\n\t\thandleBlock(LIST, ob, text);\n\t}\n\n\tvoid Parser::parsedListItem(struct buf *ob, struct buf *text, int flags) {\n\t\thandleBlock(LIST_ITEM, ob, text);\n\t}\n\n\tvoid Parser::parsedParagraph(struct buf *ob, struct buf *text) {\n\t\thandleBlock(PARAGRAPH, ob, text);\n\t}\n\n\t\/\/ Span Element Callbacks\n\n\tvoid Parser::handleSpan(Type type, struct buf *ob, struct buf *text, struct buf *extra, struct buf *extra2) {\n\n\t\tstd::vector<std::string> strs;\n\t\tstd::string textString;\n\t\tif (text) {\n\t\t\ttextString = std::string(text->data, text->data + text->size);\n\t\t\tboost::split(strs, textString, boost::is_any_of(\"|\"));\n\t\t}\n\t\tif (strs.size() > 0) {\n\t\t\tint pos = atoi(strs[0].c_str());\n\t\t\tstd::map<int, Element>::iterator elit = elementSoup.find(pos);\n\n\t\t\tElement element = elit->second;\n\t\t\telement.setType(type);\n\n\t\t\tif (extra != NULL && extra->size) {\n\t\t\t\tif (element.getType() == LINK) {\n\t\t\t\t\telement.addAttribute(\"link\", std::string(extra->data, extra->data + extra->size));\n\t\t\t\t}\n\t\t\t}\n\n\t\t\tif (extra2 != NULL && extra2->size) {\n\t\t\t\tif (element.getType() == LINK) {\n\t\t\t\t\telement.addAttribute(\"title\", std::string(extra2->data, extra2->data + extra2->size));\n\t\t\t\t}\n\t\t\t}\n\n\t\t\telementSoup.erase(pos);\n\t\t\telementSoup[pos] = element;\n\n\t\t\tbufputs(ob, textString.c_str());\n\t\t}\n\t\telse {\n\t\t\tElement element;\n\t\t\telement.setType(type);\n\n\t\t\tcreateSpan(element, ob);\n\t\t}\n\t}\n\n\tvoid Parser::createSpan(const Element& element, struct buf *ob) {\n\t\telementCount++;\n\t\tstd::ostringstream oss;\n\t\toss << elementCount;\n\t\telementSoup[elementCount] = element;\n\t\toss << '|';\n\t\tbufputs(ob, oss.str().c_str());\n\t}\n\n\tint Parser::parsedDoubleEmphasis(struct buf *ob, struct buf *text, char c) {\n\t\thandleSpan(DOUBLE_EMPHASIS, ob, text);\n\t\treturn 1;\n\t}\n\n\tint Parser::parsedEmphasis(struct buf *ob, struct buf *text, char c) {\n\t\thandleSpan(EMPHASIS, ob, text);\n\t\treturn 1;\n\t}\n\n\tint Parser::parsedTripleEmphasis(struct buf *ob, struct buf *text, char c) {\n\t\thandleSpan(TRIPLE_EMPHASIS, ob, text);\n\t\treturn 1;\n\t}\n\n\tint Parser::parsedLink(struct buf *ob, struct buf *link, struct buf *title, struct buf *content) {\n\t\thandleSpan(LINK, ob, content, link, title);\n\t\treturn 1;\n\t}\n\n\tint Parser::parsedCodeSpan(struct buf *ob, struct buf *text) {\n\t\tif (text && text->size > 0) {\n\t\t\tElement codeSpan;\n\t\t\tcodeSpan.setType(CODE_SPAN);\n\t\t\tcodeSpan.text.assign(text->data, text->data + text->size);\n\t\t\tcreateSpan(codeSpan, ob);\n\t\t}\n\t\treturn 1;\n\t}\n\n\tint Parser::parsedLinebreak(struct buf *ob) {\n\t\teraseTrailingControlCharacters(TWO_SPACES);\n\t\thandleSpan(LINEBREAK, ob, NULL);\n\t\treturn 1;\n\t}\n\n\t\/\/ Low Level Callbacks\n\n\tvoid Parser::parsedNormalText(struct buf *ob, struct buf *text) {\n\t\t\/\/ The parser will spuriously emit a text callback for an empty string\n\t\t\/\/ that butts up against a span-level element. This will ignore it.\n\n\t\tif (text && text->size > 0) {\n\t\t\tElement normalText;\n\t\t\tnormalText.setType(TEXT);\n\t\t\tnormalText.text.assign(text->data, text->data + text->size);\n\t\t\tcreateSpan(normalText, ob);\n\t\t}\n\t}\n\n}\n\n\/\/ Block Element callbacks\n\nstatic void rndr_blockcode(struct buf *ob, struct buf *text, void *opaque) {\n\t((Bypass::Parser*) opaque)->parsedBlockCode(ob, text);\n}\n\nstatic void rndr_blockquote(struct buf *ob, struct buf *text, void *opaque) {\n\t((Bypass::Parser*) opaque)->parsedBlockQuote(ob, text);\n}\n\nstatic void rndr_header(struct buf *ob, struct buf *text, int level, void *opaque) {\n\t((Bypass::Parser*) opaque)->parsedHeader(ob, text, level);\n}\n\nstatic void rndr_list(struct buf *ob, struct buf *text, int flags, void *opaque) {\n\t((Bypass::Parser*) opaque)->parsedList(ob, text, flags);\n}\n\nstatic void rndr_listitem(struct buf *ob, struct buf *text, int flags, void *opaque) {\n\t((Bypass::Parser*) opaque)->parsedListItem(ob, text, flags);\n}\n\nstatic void rndr_paragraph(struct buf *ob, struct buf *text, void *opaque) {\n\t((Bypass::Parser*) opaque)->parsedParagraph(ob, text);\n}\n\n\/\/ Span Element callbacks\n\nstatic int rndr_codespan(struct buf *ob, struct buf *text, void *opaque) {\n\treturn ((Bypass::Parser*) opaque)->parsedCodeSpan(ob, text);\n}\n\nstatic int rndr_double_emphasis(struct buf *ob, struct buf *text, char c, void *opaque) {\n\treturn ((Bypass::Parser*) opaque)->parsedDoubleEmphasis(ob, text, c);\n}\n\nstatic int rndr_emphasis(struct buf *ob, struct buf *text, char c, void *opaque) {\n\treturn ((Bypass::Parser*) opaque)->parsedEmphasis(ob, text, c);\n}\n\nstatic int rndr_triple_emphasis(struct buf *ob, struct buf *text, char c, void *opaque) {\n\treturn ((Bypass::Parser*) opaque)->parsedTripleEmphasis(ob, text, c);\n}\n\nstatic int rndr_linebreak(struct buf *ob, void *opaque) {\n\treturn ((Bypass::Parser*) opaque)->parsedLinebreak(ob);\n}\n\nstatic int rndr_link(struct buf *ob, struct buf *link, struct buf *title, struct buf *content, void *opaque) {\n\treturn ((Bypass::Parser*) opaque)->parsedLink(ob, link, title, content);\n}\n\n\/\/\tLow Level Callbacks\n\nstatic void rndr_normal_text(struct buf *ob, struct buf *text, void *opaque) {\n\treturn ((Bypass::Parser*) opaque)->parsedNormalText(ob, text);\n}\n\n<commit_msg>Workaround for potential crash of links without URL and title, e.g. [](\/sometext)<commit_after>\/\/\n\/\/ Copyright 2013 Uncodin, 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 \"parser.h\"\n\nusing namespace std;\n\nstatic void rndr_blockcode(struct buf *ob, struct buf *text, void *opaque);\nstatic void rndr_blockquote(struct buf *ob, struct buf *text, void *opaque);\nstatic void rndr_header(struct buf *ob, struct buf *text, int level, void *opaque);\nstatic void rndr_list(struct buf *ob, struct buf *text, int flags, void *opaque);\nstatic void rndr_listitem(struct buf *ob, struct buf *text, int flags, void *opaque);\nstatic void rndr_paragraph(struct buf *ob, struct buf *text, void *opaque);\nstatic int rndr_codespan(struct buf *ob, struct buf *text, void *opaque);\nstatic int rndr_double_emphasis(struct buf *ob, struct buf *text, char c, void *opaque);\nstatic int rndr_emphasis(struct buf *ob, struct buf *text, char c, void *opaque);\nstatic int rndr_triple_emphasis(struct buf *ob, struct buf *text, char c, void *opaque);\nstatic int rndr_linebreak(struct buf *ob, void *opaque);\nstatic int rndr_link(struct buf *ob, struct buf *link, struct buf *title, struct buf *content, void *opaque);\nstatic void rndr_normal_text(struct buf *ob, struct buf *text, void *opaque);\n\nstruct mkd_renderer mkd_callbacks = {\n\t\/* document-level callbacks *\/\n\tNULL, \/\/ prolog\n\tNULL, \/\/ epilogue\n\n\t\/* block-level callbacks *\/\n\trndr_blockcode, \/\/ block code\n\trndr_blockquote, \/\/ block quote\n\tNULL, \/\/ block html\n\trndr_header, \/\/ header\n\tNULL, \/\/ hrule\n\trndr_list, \/\/ list\n\trndr_listitem, \/\/ listitem\n\trndr_paragraph, \/\/ paragraph\n\tNULL, \/\/ table\n\tNULL, \/\/ table cell\n\tNULL, \/\/ table row\n\n\t\/* span-level callbacks *\/\n\tNULL, \/\/ autolink\n\trndr_codespan, \/\/ codespan\n\trndr_double_emphasis, \/\/ double emphasis\n\trndr_emphasis, \/\/ emphasis\n\tNULL, \/\/ image\n\trndr_linebreak, \/\/ line break\n\trndr_link, \/\/ link\n\tNULL, \/\/ raw html tag\n\trndr_triple_emphasis, \/\/ triple emphasis\n\n\t\/* low-level callbacks *\/\n\tNULL, \/\/ entity\n\trndr_normal_text, \/\/ normal text\n\n\t\/* renderer data *\/\n\t64, \/\/ max stack\n\t\"*_\",\n\tNULL \/\/ opaque\n};\n\nnamespace Bypass {\n\n\tconst static std::string TWO_SPACES = \" \";\n\tconst static std::string NEWLINE = \"\\n\";\n\n\tParser::Parser()\n\t: elementSoup()\n\t{\n\t\telementCount = 1;\n\t}\n\n\tParser::~Parser() {\n\n\t}\n\n\tDocument Parser::parse(const char* mkd) {\n\t\tdocument = Document();\n\n\t\tif (mkd) {\n\t\t\tstruct buf *ib, *ob;\n\n\t\t\tib = bufnew(INPUT_UNIT);\n\t\t\tbufputs(ib, mkd);\n\n\t\t\tob = bufnew(OUTPUT_UNIT);\n\n\t\t\tmkd_callbacks.opaque = this;\n\n\t\t\t\/\/parse and assemble document\n\t\t\tmarkdown(ob, ib, &mkd_callbacks);\n\n\t\t\tfor (std::map<int, Element>::iterator it = elementSoup.begin(); it != elementSoup.end(); ++it) {\n\t\t\t\tdocument.append(it->second);\n\t\t\t}\n\n\t\t\tbufrelease(ib);\n\t\t\tbufrelease(ob);\n\t\t}\n\n\t\treturn document;\n\t}\n\n\tDocument Parser::parse(const string& markdown) {\n\t\treturn parse(markdown.c_str());\n\t}\n\n\tvoid Parser::eraseTrailingControlCharacters(const std::string& controlCharacters) {\n\t\tstd::map<int, Element>::iterator it = elementSoup.find(elementCount);\n\n\t\tif ( it != elementSoup.end() ) {\n\t\t\tElement * element = &((*it).second);\n\n\t\t\tif (boost::ends_with(element->text, controlCharacters)) {\n\t\t\t\tboost::erase_tail(element->text, controlCharacters.size());\n\t\t\t}\n\t\t}\n\t}\n\n\t\/\/ Block Element Callbacks\n\n\tvoid Parser::handleBlock(Type type, struct buf *ob, struct buf *text, int extra) {\n\t\tElement block;\n\t\tblock.setType(type);\n\n\t\tif (type == HEADER) {\n\t\t\tchar levelStr[2];\n\t\t\tsnprintf(levelStr, 2, \"%d\", extra);\n\t\t\tblock.addAttribute(\"level\", levelStr);\n\t\t}\n\n\t\tstd::string textString(text->data, text->data + text->size);\n\t\tstd::vector<std::string> strs;\n\t\tboost::split(strs, textString, boost::is_any_of(\"|\"));\n\n\t\tfor(vector<std::string>::iterator it = strs.begin(); it != strs.end(); it++) {\n\t\t\tint pos = atoi((*it).c_str());\n\t\t\tstd::map<int, Element>::iterator elit = elementSoup.find(pos);\n\n\t\t\tif ( elit != elementSoup.end() ) {\n\t\t\t\tblock.append((*elit).second);\n\t\t\t\telementSoup.erase(pos);\n\t\t\t}\n\t\t}\n\n\t\telementCount++;\n\n\t\tstd::ostringstream oss;\n\t\toss << elementCount;\n\t\telementSoup[elementCount] = block;\n\t\toss << '|';\n\t\tbufputs(ob, oss.str().c_str());\n\t}\n\n\tvoid Parser::parsedBlockCode(struct buf *ob, struct buf *text) {\n\t\tif(!text) return; \/\/ Analyze seems to believe that text can be null here\n\t\tparsedNormalText(ob, text);\n\t\teraseTrailingControlCharacters(NEWLINE);\n\n\t\tstd::ostringstream oss;\n\t\toss << elementCount << '|';\n\t\tbufreset(text);\n\t\tbufputs(text, oss.str().c_str());\n\t\thandleBlock(BLOCK_CODE, ob, text);\n\t}\n\n\tvoid Parser::parsedBlockQuote(struct buf *ob, struct buf *text) {\n\t\thandleBlock(BLOCK_QUOTE, ob, text);\n\t}\n\n\tvoid Parser::parsedHeader(struct buf *ob, struct buf *text, int level) {\n\t\thandleBlock(HEADER, ob, text, level);\n\t}\n\n\tvoid Parser::parsedList(struct buf *ob, struct buf *text, int flags) {\n\t\thandleBlock(LIST, ob, text);\n\t}\n\n\tvoid Parser::parsedListItem(struct buf *ob, struct buf *text, int flags) {\n\t\thandleBlock(LIST_ITEM, ob, text);\n\t}\n\n\tvoid Parser::parsedParagraph(struct buf *ob, struct buf *text) {\n\t\thandleBlock(PARAGRAPH, ob, text);\n\t}\n\n\t\/\/ Span Element Callbacks\n\n\tvoid Parser::handleSpan(Type type, struct buf *ob, struct buf *text, struct buf *extra, struct buf *extra2) {\n\n\t\tstd::vector<std::string> strs;\n\t\tstd::string textString;\n\t\tif (text) {\n\t\t\ttextString = std::string(text->data, text->data + text->size);\n\t\t\tboost::split(strs, textString, boost::is_any_of(\"|\"));\n\t\t}\n\t\tif (strs.size() > 0) {\n std::string str0 = strs[0];\n\n if (str0.length() > 0) {\n int pos = atoi(str0.c_str());\n std::map<int, Element>::iterator elit = elementSoup.find(pos);\n\n Element element = elit->second;\n element.setType(type);\n\n if (extra != NULL && extra->size) {\n if (element.getType() == LINK) {\n element.addAttribute(\"link\", std::string(extra->data, extra->data + extra->size));\n }\n }\n\n if (extra2 != NULL && extra2->size) {\n if (element.getType() == LINK) {\n element.addAttribute(\"title\", std::string(extra2->data, extra2->data + extra2->size));\n }\n }\n \n elementSoup.erase(pos);\n elementSoup[pos] = element;\n }\n\n\t\t\tbufputs(ob, textString.c_str());\n\t\t}\n\t\telse {\n\t\t\tElement element;\n\t\t\telement.setType(type);\n\n\t\t\tcreateSpan(element, ob);\n\t\t}\n\t}\n\n\tvoid Parser::createSpan(const Element& element, struct buf *ob) {\n\t\telementCount++;\n\t\tstd::ostringstream oss;\n\t\toss << elementCount;\n\t\telementSoup[elementCount] = element;\n\t\toss << '|';\n\t\tbufputs(ob, oss.str().c_str());\n\t}\n\n\tint Parser::parsedDoubleEmphasis(struct buf *ob, struct buf *text, char c) {\n\t\thandleSpan(DOUBLE_EMPHASIS, ob, text);\n\t\treturn 1;\n\t}\n\n\tint Parser::parsedEmphasis(struct buf *ob, struct buf *text, char c) {\n\t\thandleSpan(EMPHASIS, ob, text);\n\t\treturn 1;\n\t}\n\n\tint Parser::parsedTripleEmphasis(struct buf *ob, struct buf *text, char c) {\n\t\thandleSpan(TRIPLE_EMPHASIS, ob, text);\n\t\treturn 1;\n\t}\n\n\tint Parser::parsedLink(struct buf *ob, struct buf *link, struct buf *title, struct buf *content) {\n\t\thandleSpan(LINK, ob, content, link, title);\n\t\treturn 1;\n\t}\n\n\tint Parser::parsedCodeSpan(struct buf *ob, struct buf *text) {\n\t\tif (text && text->size > 0) {\n\t\t\tElement codeSpan;\n\t\t\tcodeSpan.setType(CODE_SPAN);\n\t\t\tcodeSpan.text.assign(text->data, text->data + text->size);\n\t\t\tcreateSpan(codeSpan, ob);\n\t\t}\n\t\treturn 1;\n\t}\n\n\tint Parser::parsedLinebreak(struct buf *ob) {\n\t\teraseTrailingControlCharacters(TWO_SPACES);\n\t\thandleSpan(LINEBREAK, ob, NULL);\n\t\treturn 1;\n\t}\n\n\t\/\/ Low Level Callbacks\n\n\tvoid Parser::parsedNormalText(struct buf *ob, struct buf *text) {\n\t\t\/\/ The parser will spuriously emit a text callback for an empty string\n\t\t\/\/ that butts up against a span-level element. This will ignore it.\n\n\t\tif (text && text->size > 0) {\n\t\t\tElement normalText;\n\t\t\tnormalText.setType(TEXT);\n\t\t\tnormalText.text.assign(text->data, text->data + text->size);\n\t\t\tcreateSpan(normalText, ob);\n\t\t}\n\t}\n\n}\n\n\/\/ Block Element callbacks\n\nstatic void rndr_blockcode(struct buf *ob, struct buf *text, void *opaque) {\n\t((Bypass::Parser*) opaque)->parsedBlockCode(ob, text);\n}\n\nstatic void rndr_blockquote(struct buf *ob, struct buf *text, void *opaque) {\n\t((Bypass::Parser*) opaque)->parsedBlockQuote(ob, text);\n}\n\nstatic void rndr_header(struct buf *ob, struct buf *text, int level, void *opaque) {\n\t((Bypass::Parser*) opaque)->parsedHeader(ob, text, level);\n}\n\nstatic void rndr_list(struct buf *ob, struct buf *text, int flags, void *opaque) {\n\t((Bypass::Parser*) opaque)->parsedList(ob, text, flags);\n}\n\nstatic void rndr_listitem(struct buf *ob, struct buf *text, int flags, void *opaque) {\n\t((Bypass::Parser*) opaque)->parsedListItem(ob, text, flags);\n}\n\nstatic void rndr_paragraph(struct buf *ob, struct buf *text, void *opaque) {\n\t((Bypass::Parser*) opaque)->parsedParagraph(ob, text);\n}\n\n\/\/ Span Element callbacks\n\nstatic int rndr_codespan(struct buf *ob, struct buf *text, void *opaque) {\n\treturn ((Bypass::Parser*) opaque)->parsedCodeSpan(ob, text);\n}\n\nstatic int rndr_double_emphasis(struct buf *ob, struct buf *text, char c, void *opaque) {\n\treturn ((Bypass::Parser*) opaque)->parsedDoubleEmphasis(ob, text, c);\n}\n\nstatic int rndr_emphasis(struct buf *ob, struct buf *text, char c, void *opaque) {\n\treturn ((Bypass::Parser*) opaque)->parsedEmphasis(ob, text, c);\n}\n\nstatic int rndr_triple_emphasis(struct buf *ob, struct buf *text, char c, void *opaque) {\n\treturn ((Bypass::Parser*) opaque)->parsedTripleEmphasis(ob, text, c);\n}\n\nstatic int rndr_linebreak(struct buf *ob, void *opaque) {\n\treturn ((Bypass::Parser*) opaque)->parsedLinebreak(ob);\n}\n\nstatic int rndr_link(struct buf *ob, struct buf *link, struct buf *title, struct buf *content, void *opaque) {\n\treturn ((Bypass::Parser*) opaque)->parsedLink(ob, link, title, content);\n}\n\n\/\/\tLow Level Callbacks\n\nstatic void rndr_normal_text(struct buf *ob, struct buf *text, void *opaque) {\n\treturn ((Bypass::Parser*) opaque)->parsedNormalText(ob, text);\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 test suite 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#include <qtest.h>\n#include <QtTest\/QSignalSpy>\n#include <QtDeclarative\/qdeclarativecomponent.h>\n#include <QtDeclarative\/qdeclarativecontext.h>\n#include <QtDeclarative\/qsgview.h>\n#include <QtDeclarative\/qsgitem.h>\n#include \"..\/..\/..\/shared\/util.h\"\n\n#ifdef Q_OS_SYMBIAN\n\/\/ In Symbian OS test data is located in applications private dir\n#define SRCDIR \".\"\n#endif\n\nclass tst_QSGView : public QObject\n\n{\n Q_OBJECT\npublic:\n tst_QSGView();\n\nprivate slots:\n void resizemodeitem();\n void errors();\n};\n\n\ntst_QSGView::tst_QSGView()\n{\n}\n\nvoid tst_QSGView::resizemodeitem()\n{\n QWidget window;\n QSGView *canvas = new QSGView(&window);\n QVERIFY(canvas);\n canvas->setResizeMode(QSGView::SizeRootObjectToView);\n QCOMPARE(QSize(0,0), canvas->initialSize());\n canvas->setSource(QUrl::fromLocalFile(SRCDIR \"\/data\/resizemodeitem.qml\"));\n QSGItem* item = qobject_cast<QSGItem*>(canvas->rootObject());\n QVERIFY(item);\n window.show();\n\n \/\/ initial size from root object\n QCOMPARE(item->width(), 200.0);\n QCOMPARE(item->height(), 200.0);\n QCOMPARE(canvas->size(), QSize(200, 200));\n QCOMPARE(canvas->size(), canvas->sizeHint());\n QCOMPARE(canvas->size(), canvas->initialSize());\n\n \/\/ size update from view\n canvas->resize(QSize(80,100));\n QCOMPARE(item->width(), 80.0);\n QCOMPARE(item->height(), 100.0);\n QCOMPARE(canvas->size(), QSize(80, 100));\n QCOMPARE(canvas->size(), canvas->sizeHint());\n\n canvas->setResizeMode(QSGView::SizeViewToRootObject);\n\n \/\/ size update from view disabled\n canvas->resize(QSize(60,80));\n QCOMPARE(item->width(), 80.0);\n QCOMPARE(item->height(), 100.0);\n QCOMPARE(canvas->size(), QSize(60, 80));\n\n \/\/ size update from root object\n item->setWidth(250);\n item->setHeight(350);\n QCOMPARE(item->width(), 250.0);\n QCOMPARE(item->height(), 350.0);\n QTRY_COMPARE(canvas->size(), QSize(250, 350));\n QCOMPARE(canvas->size(), QSize(250, 350));\n QCOMPARE(canvas->size(), canvas->sizeHint());\n\n \/\/ reset canvas\n window.hide();\n delete canvas;\n canvas = new QSGView(&window);\n QVERIFY(canvas);\n canvas->setResizeMode(QSGView::SizeViewToRootObject);\n canvas->setSource(QUrl::fromLocalFile(SRCDIR \"\/data\/resizemodeitem.qml\"));\n item = qobject_cast<QSGItem*>(canvas->rootObject());\n QVERIFY(item);\n window.show();\n\n \/\/ initial size for root object\n QCOMPARE(item->width(), 200.0);\n QCOMPARE(item->height(), 200.0);\n QCOMPARE(canvas->size(), canvas->sizeHint());\n QCOMPARE(canvas->size(), canvas->initialSize());\n\n \/\/ size update from root object\n item->setWidth(80);\n item->setHeight(100);\n QCOMPARE(item->width(), 80.0);\n QCOMPARE(item->height(), 100.0);\n QTRY_COMPARE(canvas->size(), QSize(80, 100));\n QCOMPARE(canvas->size(), QSize(80, 100));\n QCOMPARE(canvas->size(), canvas->sizeHint());\n\n \/\/ size update from root object disabled\n canvas->setResizeMode(QSGView::SizeRootObjectToView);\n item->setWidth(60);\n item->setHeight(80);\n QCOMPARE(canvas->width(), 80);\n QCOMPARE(canvas->height(), 100);\n QCOMPARE(QSize(item->width(), item->height()), canvas->sizeHint());\n\n \/\/ size update from view\n canvas->resize(QSize(200,300));\n QCOMPARE(item->width(), 200.0);\n QCOMPARE(item->height(), 300.0);\n QCOMPARE(canvas->size(), QSize(200, 300));\n QCOMPARE(canvas->size(), canvas->sizeHint());\n\n delete canvas;\n\n \/\/ if we set a specific size for the view then it should keep that size\n \/\/ for SizeRootObjectToView mode.\n canvas = new QSGView(&window);\n canvas->resize(300, 300);\n canvas->setResizeMode(QSGView::SizeRootObjectToView);\n QCOMPARE(QSize(0,0), canvas->initialSize());\n canvas->setSource(QUrl::fromLocalFile(SRCDIR \"\/data\/resizemodeitem.qml\"));\n item = qobject_cast<QSGItem*>(canvas->rootObject());\n QVERIFY(item);\n window.show();\n\n \/\/ initial size from root object\n QCOMPARE(item->width(), 300.0);\n QCOMPARE(item->height(), 300.0);\n QCOMPARE(canvas->size(), QSize(300, 300));\n QCOMPARE(canvas->size(), canvas->sizeHint());\n QCOMPARE(canvas->initialSize(), QSize(200, 200)); \/\/ initial object size\n\n delete canvas;\n}\n\nstatic void silentErrorsMsgHandler(QtMsgType, const char *)\n{\n}\n\nvoid tst_QSGView::errors()\n{\n QSGView *canvas = new QSGView;\n QVERIFY(canvas);\n QtMsgHandler old = qInstallMsgHandler(silentErrorsMsgHandler);\n canvas->setSource(QUrl::fromLocalFile(SRCDIR \"\/data\/error1.qml\"));\n qInstallMsgHandler(old);\n QVERIFY(canvas->status() == QSGView::Error);\n QVERIFY(canvas->errors().count() == 1);\n delete canvas;\n}\n\n\nQTEST_MAIN(tst_QSGView)\n\n#include \"tst_qsgview.moc\"\n<commit_msg>fixed resizemodelitem<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 test suite 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#include <qtest.h>\n#include <QtTest\/QSignalSpy>\n#include <QtDeclarative\/qdeclarativecomponent.h>\n#include <QtDeclarative\/qdeclarativecontext.h>\n#include <QtDeclarative\/qsgview.h>\n#include <QtDeclarative\/qsgitem.h>\n#include \"..\/..\/..\/shared\/util.h\"\n#include <QtGui\/QWindow>\n#include <QtCore\/QDebug>\n#ifdef Q_OS_SYMBIAN\n\/\/ In Symbian OS test data is located in applications private dir\n#define SRCDIR \".\"\n#endif\n\nclass tst_QSGView : public QObject\n\n{\n Q_OBJECT\npublic:\n tst_QSGView();\n\nprivate slots:\n void resizemodeitem();\n void errors();\n};\n\n\ntst_QSGView::tst_QSGView()\n{\n}\n\nvoid tst_QSGView::resizemodeitem()\n{\n QWindow window;\n window.setGeometry(0, 0, 400, 400);\n\n QSGView *canvas = new QSGView(&window);\n QVERIFY(canvas);\n canvas->setResizeMode(QSGView::SizeRootObjectToView);\n QCOMPARE(QSize(0,0), canvas->initialSize());\n canvas->setSource(QUrl::fromLocalFile(SRCDIR \"\/data\/resizemodeitem.qml\"));\n QSGItem* item = qobject_cast<QSGItem*>(canvas->rootObject());\n QVERIFY(item);\n window.show();\n\n canvas->show();\n\n \/\/ initial size from root object\n QCOMPARE(item->width(), 200.0);\n QCOMPARE(item->height(), 200.0);\n QCOMPARE(canvas->size(), QSize(200, 200));\n QCOMPARE(canvas->size(), canvas->sizeHint());\n QCOMPARE(canvas->size(), canvas->initialSize());\n\n qDebug() << window.size();\n qDebug() << \"canvas size:\" << canvas->size();\n \/\/ size update from view\n canvas->resize(QSize(80,100));\n QTest::qWait(50);\n qDebug() << window.size();\n qDebug() << \"canvas size:\" << canvas->size();\n\n QCOMPARE(item->width(), 80.0);\n QCOMPARE(item->height(), 100.0);\n QCOMPARE(canvas->size(), QSize(80, 100));\n QCOMPARE(canvas->size(), canvas->sizeHint());\n\n canvas->setResizeMode(QSGView::SizeViewToRootObject);\n\n \/\/ size update from view disabled\n canvas->resize(QSize(60,80));\n QCOMPARE(item->width(), 80.0);\n QCOMPARE(item->height(), 100.0);\n QTest::qWait(50);\n QCOMPARE(canvas->size(), QSize(60, 80));\n\n \/\/ size update from root object\n item->setWidth(250);\n item->setHeight(350);\n QCOMPARE(item->width(), 250.0);\n QCOMPARE(item->height(), 350.0);\n QTRY_COMPARE(canvas->size(), QSize(250, 350));\n QCOMPARE(canvas->size(), QSize(250, 350));\n QCOMPARE(canvas->size(), canvas->sizeHint());\n\n \/\/ reset canvas\n window.hide();\n delete canvas;\n canvas = new QSGView(&window);\n QVERIFY(canvas);\n canvas->setResizeMode(QSGView::SizeViewToRootObject);\n canvas->setSource(QUrl::fromLocalFile(SRCDIR \"\/data\/resizemodeitem.qml\"));\n item = qobject_cast<QSGItem*>(canvas->rootObject());\n QVERIFY(item);\n window.show();\n\n canvas->show();\n\n \/\/ initial size for root object\n QCOMPARE(item->width(), 200.0);\n QCOMPARE(item->height(), 200.0);\n QCOMPARE(canvas->size(), canvas->sizeHint());\n QCOMPARE(canvas->size(), canvas->initialSize());\n\n \/\/ size update from root object\n item->setWidth(80);\n item->setHeight(100);\n QCOMPARE(item->width(), 80.0);\n QCOMPARE(item->height(), 100.0);\n QTRY_COMPARE(canvas->size(), QSize(80, 100));\n QCOMPARE(canvas->size(), QSize(80, 100));\n QCOMPARE(canvas->size(), canvas->sizeHint());\n\n \/\/ size update from root object disabled\n canvas->setResizeMode(QSGView::SizeRootObjectToView);\n item->setWidth(60);\n item->setHeight(80);\n QCOMPARE(canvas->width(), 80);\n QCOMPARE(canvas->height(), 100);\n QCOMPARE(QSize(item->width(), item->height()), canvas->sizeHint());\n\n \/\/ size update from view\n canvas->resize(QSize(200,300));\n QTest::qWait(50);\n QCOMPARE(item->width(), 200.0);\n QCOMPARE(item->height(), 300.0);\n QCOMPARE(canvas->size(), QSize(200, 300));\n QCOMPARE(canvas->size(), canvas->sizeHint());\n\n window.hide();\n delete canvas;\n\n \/\/ if we set a specific size for the view then it should keep that size\n \/\/ for SizeRootObjectToView mode.\n canvas = new QSGView(&window);\n canvas->resize(300, 300);\n canvas->setResizeMode(QSGView::SizeRootObjectToView);\n QCOMPARE(QSize(0,0), canvas->initialSize());\n canvas->setSource(QUrl::fromLocalFile(SRCDIR \"\/data\/resizemodeitem.qml\"));\n canvas->resize(300, 300);\n item = qobject_cast<QSGItem*>(canvas->rootObject());\n QVERIFY(item);\n window.show();\n\n canvas->show();\n QTest::qWait(50);\n\n \/\/ initial size from root object\n QCOMPARE(item->width(), 300.0);\n QCOMPARE(item->height(), 300.0);\n QCOMPARE(canvas->size(), QSize(300, 300));\n QCOMPARE(canvas->size(), canvas->sizeHint());\n QCOMPARE(canvas->initialSize(), QSize(200, 200)); \/\/ initial object size\n\n delete canvas;\n}\n\nstatic void silentErrorsMsgHandler(QtMsgType, const char *)\n{\n}\n\nvoid tst_QSGView::errors()\n{\n QSGView *canvas = new QSGView;\n QVERIFY(canvas);\n QtMsgHandler old = qInstallMsgHandler(silentErrorsMsgHandler);\n canvas->setSource(QUrl::fromLocalFile(SRCDIR \"\/data\/error1.qml\"));\n qInstallMsgHandler(old);\n QVERIFY(canvas->status() == QSGView::Error);\n QVERIFY(canvas->errors().count() == 1);\n delete canvas;\n}\n\n\nQTEST_MAIN(tst_QSGView)\n\n#include \"tst_qsgview.moc\"\n<|endoftext|>"} {"text":"<commit_before>\/*\n * Copyright (c) 2009 Roy Wellington IV\n * \n * Permission is hereby granted, free of charge, to any person\n * obtaining a copy of this software and associated documentation\n * files (the \"Software\"), to deal in the Software without\n * restriction, including without limitation the rights to use,\n * copy, modify, merge, publish, distribute, sublicense, and\/or sell\n * copies of the Software, and to permit persons to whom the\n * Software is furnished to do so, subject to the following\n * conditions:\n * \n * The above copyright notice and this permission notice shall be\n * included in all copies or substantial portions of the Software.\n * \n * THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND,\n * EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES\n * OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND\n * NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT\n * HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY,\n * WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING\n * FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR\n * OTHER DEALINGS IN THE SOFTWARE.\n *\/\n\n#include <stack>\n#include <cstdlib>\n#include <climits>\n#include <sstream>\n\n#include \"json.h\"\n#include \"utf8_private.h\"\n\n\/* Throw an exception if the passed stream is in an errored state.\n *\/\nvoid check_stream(std::istream &s)\n{\n\tif(!s)\n\t{\n\t\tif(s.eof())\n\t\t\tthrow json::ParseException(\"Unexpected EOF in input stream.\");\n\t\telse\n\t\t\tthrow json::ParseException(\"I\/O error in input.\");\n\t}\n}\n\n\/* Read a string from a stream.\n * If we can't read the passed string from the stream, throw an exception.\n *\/\nvoid read_string(std::istream &s, const std::string &str)\n{\n\tstd::string::const_iterator i;\n\tchar c;\n\n\tfor(i = str.begin(); i != str.end(); ++i)\n\t{\n\t\ts.get(c);\n\t\tcheck_stream(s);\n\t\tif(c != *i)\n\t\t\tthrow json::ParseException(\"Expected \\\"\" + str + \"\\\" input, but didn't find it.\");\n\t}\n}\n\n\/* Attempt to read a character from a stream.\n * Return true, and remove it from the stream if it is present.\n * Otherwise, return false.\n *\/\nbool try_to_read(std::istream &s, char c_want)\n{\n\tchar c_have;\n\n\tc_have = s.peek();\n\tcheck_stream(s);\n\t\n\tif(c_have == c_want)\n\t{\n\t\ts.ignore();\n\t\tcheck_stream(s);\n\t\treturn true;\n\t}\n\treturn false;\n}\n\n\/* Read digits from a stream, ie: [0-9]* or [0-9]+\n * If need_one is true, we must read at least one digit ([0-9]+)\n * Otherwise, no digits is acceptable ([0-9]*)\n * If need_one is true, and we can't read any digits, throw an exception.\n *\/\nvoid read_digits_from_stream(std::istream &s, std::string &str, bool need_one)\n{\n\twhile(true)\n\t{\n\t\tchar c = s.peek();\n\t\tcheck_stream(s);\n\n\t\tif(c >= '0' && c <= '9')\n\t\t{\n\t\t\ts.ignore();\n\t\t\tcheck_stream(s);\n\t\t\tstr += c;\n\t\t\tneed_one = false;\n\t\t}\n\t\telse\n\t\t\tbreak;\n\t}\n\n\tif(need_one)\n\t{\n\t\t\/\/ We needed a digit, but one didn't get read...\n\t\tthrow json::ParseException();\n\t}\n}\n\n\/* Read a numeric value, either integer or floating point, from the stream.\n * Return it as a json::Value -- this will be either a json::Double or a\n * json::Integer.\n *\/\njson::Value *read_json_numeric(std::istream &s)\n{\n\tstd::string numeric_text;\n\tchar c;\n\n\tif(try_to_read(s, '-'))\n\t\tnumeric_text += '-';\n\n\tif(!try_to_read(s, '0'))\n\t{\n\t\t\/\/ Read in whole digits\n\t\tc = s.peek();\n\t\tcheck_stream(s);\n\t\tif(!(c >= '1' && c <= '9'))\n\t\t{\n\t\t\tthrow json::ParseException();\n\t\t}\n\t\t\n\t\tnumeric_text += c;\n\t\ts.ignore();\n\t\tcheck_stream(s);\n\n\t\tread_digits_from_stream(s, numeric_text, false);\n\t}\n\telse\n\t{\n\t\t\/\/ It was a 0.\n\t\tnumeric_text += '0';\n\t}\n\n\tif(try_to_read(s, '.'))\n\t{\n\t\t\/\/ A decimal point.\n\t\tnumeric_text += '.';\n\n\t\t\/\/ Read the digits!\n\t\tread_digits_from_stream(s, numeric_text, true);\n\t}\n\n\tc = s.peek();\n\tcheck_stream(s);\n\tif(c == 'e' || c == 'E')\n\t{\n\t\ts.ignore();\n\t\tcheck_stream(s);\n\t\tnumeric_text += 'e';\n\n\t\tread_digits_from_stream(s, numeric_text, true);\n\t}\n\n\tlong long ll;\n\tchar *endptr;\n\n\tll = strtoll(numeric_text.c_str(), &endptr, 10);\n\tif(endptr == numeric_text.c_str() + numeric_text.size())\n\t{\n\t\t\/\/ Yay, a number.\n\t\tif(ll <= INT_MAX && ll >= INT_MIN)\n\t\t{\n\t\t\treturn new json::Integer(ll);\n\t\t}\n\t\telse return new json::Integer64(ll);\n\t}\n\n\tdouble d;\n\t\n\td = strtod(numeric_text.c_str(), &endptr);\n\tif(endptr == numeric_text.c_str() + numeric_text.size())\n\t{\n\t\treturn new json::Double(d);\n\t}\n\n\tthrow json::ParseException();\n}\n\n\/* Read a JSON string from a stream. This returns the actual string, and not\n * a json::String as it gets used to read keys in objects as well.\n * A JSON string is:\n * \"text... \"\n * ie, an opening quote, characters, a closing quote. There are some escape\n * sequences for things like quotes or slashes.\n *\/\nstd::string read_json_string_basic(std::istream &s)\n{\n\tchar c;\n\tstd::string text;\n\n\t\/\/ Read opening quote.\n\tc = s.get();\n\tif(!s || c != '\\\"')\n\t\tthrow json::ParseException();\n\t\n\twhile(true)\n\t{\n\t\tc = s.get();\n\t\tcheck_stream(s);\n\n\t\tif(c == '\\\"')\n\t\t\tbreak;\n\n\t\t\/\/ Characters below 0x20 must be escaped.\n\t\tif(c < 0x20)\n\t\t\tthrow json::ParseException();\n\n\t\tif(c == '\\\\')\n\t\t{\n\t\t\tchar escape_code = s.get();\n\t\t\tcheck_stream(s);\n\n\t\t\tif(escape_code == '\\\"')\n\t\t\t\ttext += '\\\"';\n\t\t\telse if(escape_code == '\\\\')\n\t\t\t\ttext += '\\\\';\n\t\t\telse if(escape_code == '\/')\n\t\t\t\ttext += '\/';\n\t\t\telse if(escape_code == 'b')\n\t\t\t\ttext += 0x08;\n\t\t\telse if(escape_code == 'f')\n\t\t\t\ttext += 0x0C;\n\t\t\telse if(escape_code == 'n')\n\t\t\t\ttext += '\\n';\n\t\t\telse if(escape_code == 'r')\n\t\t\t\ttext += '\\r';\n\t\t\telse if(escape_code == 't')\n\t\t\t\ttext += '\\t';\n\t\t\telse if(escape_code == 'u')\n\t\t\t{\n\t\t\t\tchar four_hex[5] = {0};\n\t\t\t\tfor(int i = 0; i < 4; ++i)\n\t\t\t\t{\n\t\t\t\t\tfour_hex[i] = s.get();\n\t\t\t\t\tcheck_stream(s);\n\t\t\t\t\tif(!((four_hex[i] >= '0' && four_hex[i] <= '9')\n\t\t\t\t\t\t|| (four_hex[i] >= 'A' && four_hex[i] <= 'F')\n\t\t\t\t\t\t|| (four_hex[i] >= 'a' && four_hex[i] <= 'f')))\n\t\t\t\t\t{\n\t\t\t\t\t\tthrow json::ParseException();\n\t\t\t\t\t}\n\t\t\t\t}\n\n\t\t\t\tunsigned int code = strtoul(four_hex, NULL, 16);\n\t\t\t\ttext += to_utf8(code);\n\t\t\t}\n\t\t\telse\n\t\t\t\tthrow json::ParseException();\n\t\t}\n\t\telse\n\t\t\ttext += c;\n\t}\n\n\tcheck_is_valid_utf8(text);\n\treturn text;\n}\n\n\/* Remove as much whitespace (tabs, newlines, carriage returns or spaces)\n * from the front of a string as possible.\n *\/\nvoid eat_whitespace(std::istream &s)\n{\n\tchar c;\n\n\twhile(true)\n\t{\n\t\tc = s.peek();\n\t\tcheck_stream(s);\n\n\t\tif(c == ' ' || c == '\\t' || c == '\\r' || c == '\\n')\n\t\t{\n\t\t\ts.ignore();\n\t\t\tcheck_stream(s);\n\t\t}\n\t\telse\n\t\t\tbreak;\n\t}\n}\n\njson::Value *read_json_object_or_array(std::istream &s)\n{\n\tchar c;\n\n\tc = s.peek();\n\tcheck_stream(s);\n\n\tif(c == '[')\n\t{\n\t\ts.ignore();\n\t\tcheck_stream(s);\n\t\teat_whitespace(s);\n\t\treturn new json::Array();\n\t}\n\telse if(c == '{')\n\t{\n\t\ts.ignore();\n\t\tcheck_stream(s);\n\t\teat_whitespace(s);\n\t\treturn new json::Object();\n\t}\n\telse\n\t\tthrow json::ParseException();\n}\n\njson::Value *read_json_value(std::istream &s)\n{\n\tchar c;\n\tc = s.peek();\n\tcheck_stream(s);\n\n\tif(c == 'n')\n\t{\n\t\tread_string(s, \"null\");\n\t\treturn new json::Null();\n\t}\n\telse if(c == 't')\n\t{\n\t\tread_string(s, \"true\");\n\t\treturn new json::Bool(true);\n\t}\n\telse if(c == 'f')\n\t{\n\t\tread_string(s, \"false\");\n\t\treturn new json::Bool(false);\n\t}\n\telse if(c == '\\\"')\n\t{\n\t\tstd::string str;\n\t\tstr = read_json_string_basic(s);\n\t\treturn new json::String(str);\n\t}\n\telse if(c == '-'\n\t\t|| (c >= '0' && c <= '9'))\n\t{\n\t\treturn read_json_numeric(s);\n\t}\n\telse return read_json_object_or_array(s);\n}\n\nvoid parse_item(std::istream &s, std::stack<json::Value *> &struct_stack)\n{\n\t\/\/ Get the object\/array:\n\tjson::Array *arr = NULL;\n\tjson::Object *obj = NULL;\n\tif(struct_stack.top()->type() == json::TYPE_ARRAY)\n\t\tarr = dynamic_cast<json::Array *>(struct_stack.top());\n\telse\n\t\tobj = dynamic_cast<json::Object *>(struct_stack.top());\n\n\t\n\t\/\/ See if we've reached the end:\n\tchar c = s.peek();\n\tcheck_stream(s);\n\tif((arr && c == ']')\n\t\t|| (obj && c == '}'))\n\t{\n\t\ts.ignore();\n\t\tcheck_stream(s);\n\t\tstruct_stack.pop();\n\n\t\tif(!struct_stack.empty())\n\t\t{\n\t\t\teat_whitespace(s);\n\t\t}\n\n\t\treturn;\n\t}\n\n\t\/\/ Check for a comma:\n\tif((arr && !arr->empty())\n\t\t|| (obj && !obj->empty()))\n\t{\n\t\tif(c != ',')\n\t\t\tthrow json::ParseException(\"Expected \\',\\' token.\");\n\n\t\ts.ignore();\n\t\tcheck_stream(s);\n\t\teat_whitespace(s);\n\t}\n\n\n\t\/\/ Read in a key if this is an object\n\tstd::string key;\n\tif(obj)\n\t{\n\t\tkey = read_json_string_basic(s);\n\t\teat_whitespace(s);\n\t\tchar colon = s.get();\n\t\tcheck_stream(s);\n\t\tif(colon != ':')\n\t\t\tthrow json::ParseException(\"Expected \\':\\' token.\");\n\t\teat_whitespace(s);\n\t}\n\n\n\t\/\/ Read in the actual value:\n\tjson::Value *v = NULL;\n\ttry\n\t{\n\t\tv = read_json_value(s);\n\t\tif(arr)\n\t\t\tarr->pushBackTake(v);\n\t\telse\n\t\t\tobj->takeValue(key, v);\n\t}\n\tcatch(...)\n\t{\n\t\tdelete v;\n\t\tthrow;\n\t}\n\n\tif(v->type() == json::TYPE_ARRAY\n\t\t|| v->type() == json::TYPE_OBJECT)\n\t{\n\t\tstruct_stack.push(v);\n\t}\n\n\teat_whitespace(s);\n}\n\njson::Value *json::parse(std::istream &s)\n{\n\tstd::stack<json::Value *> struct_stack;\n\tjson::Value *base_object = NULL;\n\n\teat_whitespace(s);\n\ttry\n\t{\n\t\tstruct_stack.push(base_object = read_json_object_or_array(s));\n\n\t\twhile(!struct_stack.empty())\n\t\t{\n\t\t\tparse_item(s, struct_stack);\n\t\t}\n\t}\n\tcatch(...)\n\t{\n\t\tdelete base_object;\n\t\tthrow;\n\t}\n\treturn base_object;\n}\n\njson::Value *json::parse(const std::string &s)\n{\n\tstd::stringstream ss;\n\n\tss.str(s);\n\treturn json::parse(ss);\n}\n<commit_msg>More comments in source.<commit_after>\/*\n * Copyright (c) 2009 Roy Wellington IV\n * \n * Permission is hereby granted, free of charge, to any person\n * obtaining a copy of this software and associated documentation\n * files (the \"Software\"), to deal in the Software without\n * restriction, including without limitation the rights to use,\n * copy, modify, merge, publish, distribute, sublicense, and\/or sell\n * copies of the Software, and to permit persons to whom the\n * Software is furnished to do so, subject to the following\n * conditions:\n * \n * The above copyright notice and this permission notice shall be\n * included in all copies or substantial portions of the Software.\n * \n * THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND,\n * EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES\n * OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND\n * NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT\n * HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY,\n * WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING\n * FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR\n * OTHER DEALINGS IN THE SOFTWARE.\n *\/\n\n#include <stack>\n#include <cstdlib>\n#include <climits>\n#include <sstream>\n\n#include \"json.h\"\n#include \"utf8_private.h\"\n\n\/* Throw an exception if the passed stream is in an errored state.\n *\/\nvoid check_stream(std::istream &s)\n{\n\tif(!s)\n\t{\n\t\tif(s.eof())\n\t\t\tthrow json::ParseException(\"Unexpected EOF in input stream.\");\n\t\telse\n\t\t\tthrow json::ParseException(\"I\/O error in input.\");\n\t}\n}\n\n\/* Read a string from a stream.\n * If we can't read the passed string from the stream, throw an exception.\n *\/\nvoid read_string(std::istream &s, const std::string &str)\n{\n\tstd::string::const_iterator i;\n\tchar c;\n\n\tfor(i = str.begin(); i != str.end(); ++i)\n\t{\n\t\ts.get(c);\n\t\tcheck_stream(s);\n\t\tif(c != *i)\n\t\t\tthrow json::ParseException(\"Expected \\\"\" + str + \"\\\" input, but didn't find it.\");\n\t}\n}\n\n\/* Attempt to read a character from a stream.\n * Return true, and remove it from the stream if it is present.\n * Otherwise, return false.\n *\/\nbool try_to_read(std::istream &s, char c_want)\n{\n\tchar c_have;\n\n\tc_have = s.peek();\n\tcheck_stream(s);\n\t\n\tif(c_have == c_want)\n\t{\n\t\ts.ignore();\n\t\tcheck_stream(s);\n\t\treturn true;\n\t}\n\treturn false;\n}\n\n\/* Read digits from a stream, ie: [0-9]* or [0-9]+\n * If need_one is true, we must read at least one digit ([0-9]+)\n * Otherwise, no digits is acceptable ([0-9]*)\n * If need_one is true, and we can't read any digits, throw an exception.\n *\/\nvoid read_digits_from_stream(std::istream &s, std::string &str, bool need_one)\n{\n\twhile(true)\n\t{\n\t\tchar c = s.peek();\n\t\tcheck_stream(s);\n\n\t\tif(c >= '0' && c <= '9')\n\t\t{\n\t\t\ts.ignore();\n\t\t\tcheck_stream(s);\n\t\t\tstr += c;\n\t\t\tneed_one = false;\n\t\t}\n\t\telse\n\t\t\tbreak;\n\t}\n\n\tif(need_one)\n\t{\n\t\t\/\/ We needed a digit, but one didn't get read...\n\t\tthrow json::ParseException();\n\t}\n}\n\n\/* Read a numeric value, either integer or floating point, from the stream.\n * Return it as a json::Value -- this will be either a json::Double or a\n * json::Integer.\n *\/\njson::Value *read_json_numeric(std::istream &s)\n{\n\tstd::string numeric_text;\n\tchar c;\n\n\tif(try_to_read(s, '-'))\n\t\tnumeric_text += '-';\n\n\tif(!try_to_read(s, '0'))\n\t{\n\t\t\/\/ Read in whole digits\n\t\tc = s.peek();\n\t\tcheck_stream(s);\n\t\tif(!(c >= '1' && c <= '9'))\n\t\t{\n\t\t\tthrow json::ParseException();\n\t\t}\n\t\t\n\t\tnumeric_text += c;\n\t\ts.ignore();\n\t\tcheck_stream(s);\n\n\t\tread_digits_from_stream(s, numeric_text, false);\n\t}\n\telse\n\t{\n\t\t\/\/ It was a 0.\n\t\tnumeric_text += '0';\n\t}\n\n\tif(try_to_read(s, '.'))\n\t{\n\t\t\/\/ A decimal point.\n\t\tnumeric_text += '.';\n\n\t\t\/\/ Read the digits!\n\t\tread_digits_from_stream(s, numeric_text, true);\n\t}\n\n\tc = s.peek();\n\tcheck_stream(s);\n\tif(c == 'e' || c == 'E')\n\t{\n\t\ts.ignore();\n\t\tcheck_stream(s);\n\t\tnumeric_text += 'e';\n\n\t\tread_digits_from_stream(s, numeric_text, true);\n\t}\n\n\tlong long ll;\n\tchar *endptr;\n\n\tll = strtoll(numeric_text.c_str(), &endptr, 10);\n\tif(endptr == numeric_text.c_str() + numeric_text.size())\n\t{\n\t\t\/\/ Yay, a number.\n\t\tif(ll <= INT_MAX && ll >= INT_MIN)\n\t\t{\n\t\t\treturn new json::Integer(ll);\n\t\t}\n\t\telse return new json::Integer64(ll);\n\t}\n\n\tdouble d;\n\t\n\td = strtod(numeric_text.c_str(), &endptr);\n\tif(endptr == numeric_text.c_str() + numeric_text.size())\n\t{\n\t\treturn new json::Double(d);\n\t}\n\n\tthrow json::ParseException();\n}\n\n\/* Read a JSON string from a stream. This returns the actual string, and not\n * a json::String as it gets used to read keys in objects as well.\n * A JSON string is:\n * \"text... \"\n * ie, an opening quote, characters, a closing quote. There are some escape\n * sequences for things like quotes or slashes.\n *\/\nstd::string read_json_string_basic(std::istream &s)\n{\n\tchar c;\n\tstd::string text;\n\n\t\/\/ Read opening quote.\n\tc = s.get();\n\tif(!s || c != '\\\"')\n\t\tthrow json::ParseException();\n\t\n\twhile(true)\n\t{\n\t\tc = s.get();\n\t\tcheck_stream(s);\n\n\t\tif(c == '\\\"')\n\t\t\tbreak;\n\n\t\t\/\/ Characters below 0x20 must be escaped.\n\t\tif(c < 0x20)\n\t\t\tthrow json::ParseException();\n\n\t\tif(c == '\\\\')\n\t\t{\n\t\t\tchar escape_code = s.get();\n\t\t\tcheck_stream(s);\n\n\t\t\tif(escape_code == '\\\"')\n\t\t\t\ttext += '\\\"';\n\t\t\telse if(escape_code == '\\\\')\n\t\t\t\ttext += '\\\\';\n\t\t\telse if(escape_code == '\/')\n\t\t\t\ttext += '\/';\n\t\t\telse if(escape_code == 'b')\n\t\t\t\ttext += 0x08;\n\t\t\telse if(escape_code == 'f')\n\t\t\t\ttext += 0x0C;\n\t\t\telse if(escape_code == 'n')\n\t\t\t\ttext += '\\n';\n\t\t\telse if(escape_code == 'r')\n\t\t\t\ttext += '\\r';\n\t\t\telse if(escape_code == 't')\n\t\t\t\ttext += '\\t';\n\t\t\telse if(escape_code == 'u')\n\t\t\t{\n\t\t\t\tchar four_hex[5] = {0};\n\t\t\t\tfor(int i = 0; i < 4; ++i)\n\t\t\t\t{\n\t\t\t\t\tfour_hex[i] = s.get();\n\t\t\t\t\tcheck_stream(s);\n\t\t\t\t\tif(!((four_hex[i] >= '0' && four_hex[i] <= '9')\n\t\t\t\t\t\t|| (four_hex[i] >= 'A' && four_hex[i] <= 'F')\n\t\t\t\t\t\t|| (four_hex[i] >= 'a' && four_hex[i] <= 'f')))\n\t\t\t\t\t{\n\t\t\t\t\t\tthrow json::ParseException();\n\t\t\t\t\t}\n\t\t\t\t}\n\n\t\t\t\tunsigned int code = strtoul(four_hex, NULL, 16);\n\t\t\t\ttext += to_utf8(code);\n\t\t\t}\n\t\t\telse\n\t\t\t\tthrow json::ParseException();\n\t\t}\n\t\telse\n\t\t\ttext += c;\n\t}\n\n\tcheck_is_valid_utf8(text);\n\treturn text;\n}\n\n\/* Remove as much whitespace (tabs, newlines, carriage returns or spaces)\n * from the front of a string as possible.\n *\/\nvoid eat_whitespace(std::istream &s)\n{\n\tchar c;\n\n\twhile(true)\n\t{\n\t\tc = s.peek();\n\t\tcheck_stream(s);\n\n\t\tif(c == ' ' || c == '\\t' || c == '\\r' || c == '\\n')\n\t\t{\n\t\t\ts.ignore();\n\t\t\tcheck_stream(s);\n\t\t}\n\t\telse\n\t\t\tbreak;\n\t}\n}\n\n\/* Read in a JSON object or array start marker from the stream,\n * and create and return a JSON object\/array to store it.\n *\/\njson::Value *read_json_object_or_array(std::istream &s)\n{\n\tchar c;\n\n\tc = s.peek();\n\tcheck_stream(s);\n\n\tif(c == '[')\n\t{\n\t\ts.ignore();\n\t\tcheck_stream(s);\n\t\teat_whitespace(s);\n\t\treturn new json::Array();\n\t}\n\telse if(c == '{')\n\t{\n\t\ts.ignore();\n\t\tcheck_stream(s);\n\t\teat_whitespace(s);\n\t\treturn new json::Object();\n\t}\n\telse\n\t\tthrow json::ParseException();\n}\n\n\/* Read in a JSON value from the stream. We should be positioned right before\n * it.\n *\/\njson::Value *read_json_value(std::istream &s)\n{\n\t\/\/ Peek a character - this tells us what type we're looking at.\n\t\/\/ All the JSON primitives differ in their first character.\n\tchar c;\n\tc = s.peek();\n\tcheck_stream(s);\n\n\tif(c == 'n')\n\t{\n\t\tread_string(s, \"null\");\n\t\treturn new json::Null();\n\t}\n\telse if(c == 't')\n\t{\n\t\tread_string(s, \"true\");\n\t\treturn new json::Bool(true);\n\t}\n\telse if(c == 'f')\n\t{\n\t\tread_string(s, \"false\");\n\t\treturn new json::Bool(false);\n\t}\n\telse if(c == '\\\"')\n\t{\n\t\tstd::string str;\n\t\tstr = read_json_string_basic(s);\n\t\treturn new json::String(str);\n\t}\n\telse if(c == '-'\n\t\t|| (c >= '0' && c <= '9'))\n\t{\n\t\treturn read_json_numeric(s);\n\t}\n\t\/\/ By now, it should be an array or an object -- this function will throw\n\t\/\/ if it isn't.\n\telse return read_json_object_or_array(s);\n}\n\nvoid parse_item(std::istream &s, std::stack<json::Value *> &struct_stack)\n{\n\t\/\/ Get the object\/array:\n\tjson::Array *arr = NULL;\n\tjson::Object *obj = NULL;\n\tif(struct_stack.top()->type() == json::TYPE_ARRAY)\n\t\tarr = dynamic_cast<json::Array *>(struct_stack.top());\n\telse\n\t\tobj = dynamic_cast<json::Object *>(struct_stack.top());\n\n\t\n\t\/\/ See if we've reached the end:\n\tchar c = s.peek();\n\tcheck_stream(s);\n\tif((arr && c == ']')\n\t\t|| (obj && c == '}'))\n\t{\n\t\ts.ignore();\n\t\tcheck_stream(s);\n\t\tstruct_stack.pop();\n\n\t\tif(!struct_stack.empty())\n\t\t{\n\t\t\teat_whitespace(s);\n\t\t}\n\n\t\treturn;\n\t}\n\n\t\/\/ Check for a comma:\n\tif((arr && !arr->empty())\n\t\t|| (obj && !obj->empty()))\n\t{\n\t\tif(c != ',')\n\t\t\tthrow json::ParseException(\"Expected \\',\\' token.\");\n\n\t\ts.ignore();\n\t\tcheck_stream(s);\n\t\teat_whitespace(s);\n\t}\n\n\n\t\/\/ Read in a key if this is an object\n\tstd::string key;\n\tif(obj)\n\t{\n\t\tkey = read_json_string_basic(s);\n\t\teat_whitespace(s);\n\t\tchar colon = s.get();\n\t\tcheck_stream(s);\n\t\tif(colon != ':')\n\t\t\tthrow json::ParseException(\"Expected \\':\\' token.\");\n\t\teat_whitespace(s);\n\t}\n\n\n\t\/\/ Read in the actual value:\n\tjson::Value *v = NULL;\n\ttry\n\t{\n\t\tv = read_json_value(s);\n\t\tif(arr)\n\t\t\tarr->pushBackTake(v);\n\t\telse\n\t\t\tobj->takeValue(key, v);\n\t}\n\tcatch(...)\n\t{\n\t\tdelete v;\n\t\tthrow;\n\t}\n\n\tif(v->type() == json::TYPE_ARRAY\n\t\t|| v->type() == json::TYPE_OBJECT)\n\t{\n\t\tstruct_stack.push(v);\n\t}\n\n\teat_whitespace(s);\n}\n\njson::Value *json::parse(std::istream &s)\n{\n\tstd::stack<json::Value *> struct_stack;\n\tjson::Value *base_object = NULL;\n\n\teat_whitespace(s);\n\ttry\n\t{\n\t\tstruct_stack.push(base_object = read_json_object_or_array(s));\n\n\t\twhile(!struct_stack.empty())\n\t\t{\n\t\t\tparse_item(s, struct_stack);\n\t\t}\n\t}\n\tcatch(...)\n\t{\n\t\tdelete base_object;\n\t\tthrow;\n\t}\n\treturn base_object;\n}\n\njson::Value *json::parse(const std::string &s)\n{\n\tstd::stringstream ss;\n\n\tss.str(s);\n\treturn json::parse(ss);\n}\n<|endoftext|>"} {"text":"<commit_before>#include <stack>\n#include <memory>\n\n#define PARSER_H\n\n#ifndef SCANNER_H\n#include \"scanner.hpp\"\n#endif\n\n#include \"util.hpp\"\n\nnamespace CS {\n\n using std::pair;\n using std::string;\n using std::vector;\n using std::shared_ptr;\n\n class TokenNode;\n typedef TokenNode SyntaxTree;\n\n class TokenNode {\n public:\n \/* constructors *\/\n TokenNode(const string& token_value, int token_type):\n value_(token_value), \n type_(token_type),\n left_(nullptr),\n right_(nullptr),\n next_(nullptr) {\n }\n\n TokenNode():\n TokenNode(\"\", 0) {\n }\n\n\n TokenNode(const TokenPair& token):\n TokenNode(token.first, token.second) {\n }\n\n ~TokenNode() {\n if (left_ != nullptr) {\n left_->~TokenNode();\n delete left_;\n }\n if (right_ != nullptr) {\n right_->~TokenNode();\n delete right_;\n }\n if (next_ != nullptr) {\n next_->~TokenNode();\n delete next_;\n }\n }\n\n \/* operations *\/\n void PushLeft(TokenNode* node) {\n left_ = node;\n }\n\n void PushRight(TokenNode* node) {\n right_ = node;\n }\n\n void PushNext(TokenNode* node) {\n next_ = node;\n }\n\n void PushFront(TokenNode* node) {\n if (this->next_ == nullptr) {\n this->next_ = node;\n } else {\n node->next_ = this->next_;\n this->next_ = node;\n }\n }\n\n string value_;\n int type_;\n TokenNode* left_;\n TokenNode* right_;\n TokenNode* next_;\n };\n\n class Parser {\n\n public:\n \/\/ trivial constructor\n Parser():token_list_(nullptr), token_parsed_(0) {}\n\n SyntaxTree* Parse(TokenList& token_list) {\n token_list_ = &token_list;\n token_parsed_ = 0;\n SyntaxTree root;\n TokenNode* cursor = &root;\n\n while (HasNext()) {\n int position = Position();\n if (IsStatement(position)) {\n cursor->PushNext(Statement());\n } else if (IsAssignment(position)) {\n cursor->PushNext(Assignment());\n } else {\n cursor->PushNext(Expression());\n }\n SkipToken(\";\");\n cursor = cursor->next_;\n }\n return root.next_;\n }\n\n private:\n \/\/ helper functions\n\n \/\/ does not need position, so these functions could be called through a single token without position\n inline bool IsOperator(int index) {\n return IsOperator(GetToken(index));\n }\n\n inline bool IsOperator(const TokenPair& token) {\n return Scanner::IsOperator(token.first);\n }\n\n inline bool IsOperator(const string& value) {\n return Scanner::IsOperator(value);\n }\n\n inline bool IsBinaryOperator(int index) {\n return IsBinaryOperator(GetToken(index));\n }\n\n inline bool IsBinaryOperator(const TokenPair& token) {\n return IsOperator(token) &&\n token.first != \"\\\"\" &&\n token.first != \";\";\n }\n\n inline bool IsBinaryOperator(const string& value) {\n return Scanner::IsOperator(value) &&\n value != \"\\\"\" &&\n value != \";\";\n }\n\n inline bool IsNumber(int index) {\n return IsNumber(GetToken(index));\n }\n\n inline bool IsNumber(const TokenPair& token){\n return token.second == GetId(\"int\") ||\n token.second == GetId(\"double\");\n }\n\n inline bool IsIdentifier(int index) {\n return IsIdentifier(GetToken(index));\n }\n\n inline bool IsIdentifier(const TokenPair& token) {\n return token.second == 53;\n }\n \/\/ need the help of position\n bool IsStatement(int index) {\n auto& token = GetToken(index);\n return (token.second == 36 ||\n token.second == 37) &&\n HasNext(index) &&\n IsIdentifier(index+1);\n }\n\n bool IsAssignment(int index) {\n auto& token = GetToken(index);\n return IsIdentifier(index) &&\n HasNext(index) &&\n NextToken(index).first == \"=\";\n }\n\n bool IsCall(int index) {\n auto& token = GetToken(index);\n return IsIdentifier(index) &&\n HasNext(index) &&\n NextToken(index).first == \"(\";\n }\n\n bool IsValue(int index) {\n auto& token = GetToken(index);\n return (token.first == \"(\" && \n HasNext(index) &&\n IsValue(index+1)) ||\n IsNumber(index) ||\n IsIdentifier(index) ||\n IsCall(index);\n }\n\n \/\/ control the token list\n inline void Next() {\n ++token_parsed_;\n }\n\n inline void Prev() {\n --token_parsed_;\n }\n\n inline int Position() {\n return token_parsed_;\n }\n\n inline pair<string, int>& NextToken() {\n return (*token_list_)[token_parsed_+1];\n }\n\n inline pair<string, int>& NextToken(int index) {\n return (*token_list_)[index+1];\n }\n\n inline pair<string, int>& Consume() {\n return (*token_list_)[token_parsed_++];\n }\n\n inline pair<string, int>& GetToken() {\n return (*token_list_)[token_parsed_];\n }\n\n inline pair<string, int>& GetToken(int index) {\n return (*token_list_)[index];\n }\n\n inline bool HasNext() {\n return token_parsed_ < token_list_->size();\n }\n\n inline bool HasNext(int index) {\n return index < token_list_->size();\n }\n\n void SkipToken(const char* token) {\n assert(Consume().first == token);\n }\n\n \/\/ operator priority\n\n int Priority(char ch) {\n switch (ch) {\n case '+':\n case '-':\n return 1;\n case '*':\n case '\/':\n case '%':\n return 2;\n case '(':\n return 3;\n default:\n assert(false);\n }\n }\n\n \/\/ main force\n\n SyntaxTree* Statement() {\n SyntaxTree* type = new SyntaxTree(Consume());\n TokenNode* id = new SyntaxTree(Consume());\n type->PushLeft(id);\n return type;\n }\n\n SyntaxTree* Assignment() {\n SyntaxTree* id = new SyntaxTree(Consume());\n TokenNode* equal = new SyntaxTree(Consume());\n TokenNode* expr = Expression();\n equal->PushLeft(id);\n equal->PushRight(expr);\n return equal;\n }\n\n TokenNode* Arguments() {\n TokenNode* root = nullptr;\n enum State { ZERO, ONE, TWO };\n State state = ZERO;\n while (HasNext() && state != TWO) {\n int position = Position();\n switch (state) {\n case ZERO:\n if (IsValue(position)) {\n if (root == nullptr)\n root = Value();\n else\n root->PushFront(Value());\n state = TWO;\n } else {\n std::cerr << \"not a value\" << std::endl;\n exit(3);\n }\n break;\n case ONE:\n if (GetToken().first == \",\") {\n SkipToken(\",\");\n state = ZERO;\n } else {\n state = TWO;\n }\n break;\n case TWO:\n goto end;\n default:\n assert(false);\n }\n }\nend:\n return root;\n }\n\n TokenNode* Value() {\n auto& token = GetToken();\n TokenNode* node;\n if (token.first == \"(\") {\n SkipToken(\"(\");\n node = Value();\n SkipToken(\")\");\n } else {\n if (IsNumber(Position())) {\n node = new TokenNode(Consume());\n } else if (IsCall(Position())) {\n node = new TokenNode;\n node->type_ = GetId(\"call_type\");\n \/\/ function identifier\n node->PushLeft(new TokenNode(Consume()));\n \/\/ '('\n SkipToken(\"(\");\n \/\/ expr\n node->PushRight(Arguments());\n \/\/ ')'\n SkipToken(\")\");\n } else if (IsIdentifier(Position())) {\n node = new TokenNode(Consume());\n } else {\n std::cerr << \"not a value\" << std::endl;\n exit(3);\n }\n }\n return node;\n }\n\n SyntaxTree* Expression() {\n std::vector<TokenNode*> tokens;\n enum State { ZERO, ONE, TWO};\n State state = ZERO;\n while (HasNext() && state != TWO) {\n int position = Position();\n switch (state) {\n case ZERO:\n if (IsValue(position)) {\n tokens.push_back(Value());\n } else {\n std::cerr << \"not a value:\\t\\'\" << GetToken(position).first << \"\\'\"<< std::endl;\n exit(2);\n }\n state = ONE;\n break;\n case ONE:\n if (IsBinaryOperator(position)) {\n tokens.push_back(new TokenNode(Consume()));\n state = ZERO;\n } else {\n state = TWO;\n }\n break;\n case TWO:\n default:\n assert(false);\n }\n }\n \/\/ convert it to postfix\n std::vector<TokenNode*> postfix;\n std::stack<TokenNode*> operators;\n for (auto node : tokens) {\n char ch = node->value_.front();\n if (IsBinaryOperator(node->value_)) {\n while (!operators.empty() && operators.top()->value_ != \"(\" &&\n Priority(ch) <= Priority(operators.top()->value_.front())) {\n postfix.push_back(operators.top()), operators.pop();\n }\n operators.push(node);\n } else {\n postfix.push_back(node);\n }\n }\n while (!operators.empty()) \n postfix.push_back(operators.top()), operators.pop();\n\n \/\/ construct syntax tree from postfix expression\n std::stack<TokenNode*> node_stack;\n for (auto &node : postfix) {\n if (IsOperator(node->value_)) {\n TokenNode* rhs = node_stack.top(); \n node_stack.pop();\n TokenNode* lhs = node_stack.top();\n node_stack.pop();\n node->PushLeft(lhs);\n node->PushRight(rhs);\n node_stack.push(node);\n } else {\n node_stack.push(node);\n }\n }\n return node_stack.top();\n }\n\n TokenList* token_list_;\n int token_parsed_;\n };\n}\n<commit_msg>solve the memory leak problem<commit_after>#include <stack>\n#include <memory>\n\n#define PARSER_H\n\n#ifndef SCANNER_H\n#include \"scanner.hpp\"\n#endif\n\n#include \"util.hpp\"\n\nnamespace CS {\n\n using std::pair;\n using std::string;\n using std::vector;\n using std::shared_ptr;\n\n class TokenNode;\n typedef TokenNode SyntaxTree;\n\n class TokenNode {\n public:\n \/* constructors *\/\n TokenNode(const string& token_value, int token_type):\n value_(token_value), \n type_(token_type),\n left_(nullptr),\n right_(nullptr),\n next_(nullptr) {\n }\n\n TokenNode():\n TokenNode(\"\", 0) {\n }\n\n\n TokenNode(const TokenPair& token):\n TokenNode(token.first, token.second) {\n }\n\n ~TokenNode() {\n if (left_) delete left_;\n if (right_) delete right_;\n if (next_) delete next_;\n }\n\n \/* operations *\/\n void PushLeft(TokenNode* node) {\n left_ = node;\n }\n\n void PushRight(TokenNode* node) {\n right_ = node;\n }\n\n void PushNext(TokenNode* node) {\n next_ = node;\n }\n\n void PushFront(TokenNode* node) {\n if (this->next_ == nullptr) {\n this->next_ = node;\n } else {\n node->next_ = this->next_;\n this->next_ = node;\n }\n }\n\n string value_;\n int type_;\n TokenNode* left_;\n TokenNode* right_;\n TokenNode* next_;\n };\n\n class Parser {\n\n public:\n \/\/ trivial constructor\n Parser():token_list_(nullptr), token_parsed_(0) {}\n\n SyntaxTree* Parse(TokenList& token_list) {\n token_list_ = &token_list;\n token_parsed_ = 0;\n SyntaxTree guard;\n TokenNode* cursor = &guard;\n\n while (HasNext()) {\n int position = Position();\n if (IsStatement(position)) {\n cursor->PushNext(Statement());\n } else if (IsAssignment(position)) {\n cursor->PushNext(Assignment());\n } else {\n cursor->PushNext(Expression());\n }\n SkipToken(\";\");\n cursor = cursor->next_;\n }\n\n \/* to protect the tree be destructed by the destruction of 'guard' *\/\n TokenNode* res = guard.next_;\n guard.next_ = nullptr;\n return res;\n }\n\n private:\n \/\/ helper functions\n\n \/\/ does not need position, so these functions could be called through a single token without position\n inline bool IsOperator(int index) {\n return IsOperator(GetToken(index));\n }\n\n inline bool IsOperator(const TokenPair& token) {\n return Scanner::IsOperator(token.first);\n }\n\n inline bool IsOperator(const string& value) {\n return Scanner::IsOperator(value);\n }\n\n inline bool IsBinaryOperator(int index) {\n return IsBinaryOperator(GetToken(index));\n }\n\n inline bool IsBinaryOperator(const TokenPair& token) {\n return IsOperator(token) &&\n token.first != \"\\\"\" &&\n token.first != \";\";\n }\n\n inline bool IsBinaryOperator(const string& value) {\n return Scanner::IsOperator(value) &&\n value != \"\\\"\" &&\n value != \";\";\n }\n\n inline bool IsNumber(int index) {\n return IsNumber(GetToken(index));\n }\n\n inline bool IsNumber(const TokenPair& token){\n return token.second == GetId(\"int\") ||\n token.second == GetId(\"double\");\n }\n\n inline bool IsIdentifier(int index) {\n return IsIdentifier(GetToken(index));\n }\n\n inline bool IsIdentifier(const TokenPair& token) {\n return token.second == 53;\n }\n \/\/ need the help of position\n bool IsStatement(int index) {\n auto& token = GetToken(index);\n return (token.second == 36 ||\n token.second == 37) &&\n HasNext(index) &&\n IsIdentifier(index+1);\n }\n\n bool IsAssignment(int index) {\n auto& token = GetToken(index);\n return IsIdentifier(index) &&\n HasNext(index) &&\n NextToken(index).first == \"=\";\n }\n\n bool IsCall(int index) {\n auto& token = GetToken(index);\n return IsIdentifier(index) &&\n HasNext(index) &&\n NextToken(index).first == \"(\";\n }\n\n bool IsValue(int index) {\n auto& token = GetToken(index);\n return (token.first == \"(\" && \n HasNext(index) &&\n IsValue(index+1)) ||\n IsNumber(index) ||\n IsIdentifier(index) ||\n IsCall(index);\n }\n\n \/\/ control the token list\n inline void Next() {\n ++token_parsed_;\n }\n\n inline void Prev() {\n --token_parsed_;\n }\n\n inline int Position() {\n return token_parsed_;\n }\n\n inline pair<string, int>& NextToken() {\n return (*token_list_)[token_parsed_+1];\n }\n\n inline pair<string, int>& NextToken(int index) {\n return (*token_list_)[index+1];\n }\n\n inline pair<string, int>& Consume() {\n return (*token_list_)[token_parsed_++];\n }\n\n inline pair<string, int>& GetToken() {\n return (*token_list_)[token_parsed_];\n }\n\n inline pair<string, int>& GetToken(int index) {\n return (*token_list_)[index];\n }\n\n inline bool HasNext() {\n return token_parsed_ < token_list_->size();\n }\n\n inline bool HasNext(int index) {\n return index < token_list_->size();\n }\n\n void SkipToken(const char* token) {\n assert(Consume().first == token);\n }\n\n \/\/ operator priority\n\n int Priority(char ch) {\n switch (ch) {\n case '+':\n case '-':\n return 1;\n case '*':\n case '\/':\n case '%':\n return 2;\n case '(':\n return 3;\n default:\n assert(false);\n }\n }\n\n \/\/ main force\n\n SyntaxTree* Statement() {\n SyntaxTree* type = new SyntaxTree(Consume());\n TokenNode* id = new SyntaxTree(Consume());\n type->PushLeft(id);\n return type;\n }\n\n SyntaxTree* Assignment() {\n SyntaxTree* id = new SyntaxTree(Consume());\n TokenNode* equal = new SyntaxTree(Consume());\n TokenNode* expr = Expression();\n equal->PushLeft(id);\n equal->PushRight(expr);\n return equal;\n }\n\n TokenNode* Arguments() {\n TokenNode* root = nullptr;\n enum State { ZERO, ONE, TWO };\n State state = ZERO;\n while (HasNext() && state != TWO) {\n int position = Position();\n switch (state) {\n case ZERO:\n if (IsValue(position)) {\n if (root == nullptr)\n root = Value();\n else\n root->PushFront(Value());\n state = TWO;\n } else {\n std::cerr << \"not a value\" << std::endl;\n exit(3);\n }\n break;\n case ONE:\n if (GetToken().first == \",\") {\n SkipToken(\",\");\n state = ZERO;\n } else {\n state = TWO;\n }\n break;\n case TWO:\n goto end;\n default:\n assert(false);\n }\n }\nend:\n return root;\n }\n\n TokenNode* Value() {\n auto& token = GetToken();\n TokenNode* node;\n if (token.first == \"(\") {\n SkipToken(\"(\");\n node = Value();\n SkipToken(\")\");\n } else {\n if (IsNumber(Position())) {\n node = new TokenNode(Consume());\n } else if (IsCall(Position())) {\n node = new TokenNode;\n node->type_ = GetId(\"call_type\");\n \/\/ function identifier\n node->PushLeft(new TokenNode(Consume()));\n \/\/ '('\n SkipToken(\"(\");\n \/\/ expr\n node->PushRight(Arguments());\n \/\/ ')'\n SkipToken(\")\");\n } else if (IsIdentifier(Position())) {\n node = new TokenNode(Consume());\n } else {\n std::cerr << \"not a value\" << std::endl;\n exit(3);\n }\n }\n return node;\n }\n\n SyntaxTree* Expression() {\n std::vector<TokenNode*> tokens;\n enum State { ZERO, ONE, TWO};\n State state = ZERO;\n while (HasNext() && state != TWO) {\n int position = Position();\n switch (state) {\n case ZERO:\n if (IsValue(position)) {\n tokens.push_back(Value());\n } else {\n std::cerr << \"not a value:\\t\\'\" << GetToken(position).first << \"\\'\"<< std::endl;\n exit(2);\n }\n state = ONE;\n break;\n case ONE:\n if (IsBinaryOperator(position)) {\n tokens.push_back(new TokenNode(Consume()));\n state = ZERO;\n } else {\n state = TWO;\n }\n break;\n case TWO:\n default:\n assert(false);\n }\n }\n \/\/ convert it to postfix\n std::vector<TokenNode*> postfix;\n std::stack<TokenNode*> operators;\n for (auto node : tokens) {\n char ch = node->value_.front();\n if (IsBinaryOperator(node->value_)) {\n while (!operators.empty() && operators.top()->value_ != \"(\" &&\n Priority(ch) <= Priority(operators.top()->value_.front())) {\n postfix.push_back(operators.top()), operators.pop();\n }\n operators.push(node);\n } else {\n postfix.push_back(node);\n }\n }\n while (!operators.empty()) \n postfix.push_back(operators.top()), operators.pop();\n\n \/\/ construct syntax tree from postfix expression\n std::stack<TokenNode*> node_stack;\n for (auto &node : postfix) {\n if (IsOperator(node->value_)) {\n TokenNode* rhs = node_stack.top(); \n node_stack.pop();\n TokenNode* lhs = node_stack.top();\n node_stack.pop();\n node->PushLeft(lhs);\n node->PushRight(rhs);\n node_stack.push(node);\n } else {\n node_stack.push(node);\n }\n }\n return node_stack.top();\n }\n\n TokenList* token_list_;\n int token_parsed_;\n };\n}\n<|endoftext|>"} {"text":"<commit_before>\/\/Author: Julian Yi\n\/\/Date Created: 18 July 2017\n\/\/File Description: .cpp file for Pieces\n#include <iostream>\n#include <string>\n#include \"pieces.h\"\n#include \"board.h\"\n#include \"pawn.h\"\n#include \"defs.h\"\n\nusing namespace std;\n\nPieces::Pieces() : team(TeamColor::None), type(PieceType::None), position({0, 0}) { }\n\nvoid Pieces::increaseMove()\n{\n\tmoveCounter++;\n}\n\nint Pieces::getMove()\n{\n\treturn moveCounter;\n}\n\nvoid Pieces::setPosition(coord newPos)\n{\n\tposition = newPos;\n}\n\ncoord Pieces::getPosition() const\n{\n\treturn position;\n}\n\nTeamColor Pieces::getTeamColor() const\n{\n\treturn team;\n}\n\nPieceType Pieces::getPieceType() const\n{\n\treturn type;\n}\n\ncoordList Pieces::calculateMoves(coord boundary, const squareGrid& square) const\n{\n\tcoordList moveList;\n\treturn moveList;\n}\n<commit_msg>Changed Pieces initialization list order<commit_after>\/\/Author: Julian Yi\n\/\/Date Created: 18 July 2017\n\/\/File Description: .cpp file for Pieces\n#include <iostream>\n#include <string>\n#include \"pieces.h\"\n#include \"board.h\"\n#include \"pawn.h\"\n#include \"defs.h\"\n\nusing namespace std;\n\nPieces::Pieces() : position({0, 0}), team(TeamColor::None), type(PieceType::None) { }\n\nvoid Pieces::increaseMove()\n{\n\tmoveCounter++;\n}\n\nint Pieces::getMove()\n{\n\treturn moveCounter;\n}\n\nvoid Pieces::setPosition(coord newPos)\n{\n\tposition = newPos;\n}\n\ncoord Pieces::getPosition() const\n{\n\treturn position;\n}\n\nTeamColor Pieces::getTeamColor() const\n{\n\treturn team;\n}\n\nPieceType Pieces::getPieceType() const\n{\n\treturn type;\n}\n\ncoordList Pieces::calculateMoves(coord boundary, const squareGrid& square) const\n{\n\tcoordList moveList;\n\treturn moveList;\n}\n<|endoftext|>"} {"text":"<commit_before>\/*\n\n Copyright Eli Dupree and Isaac Dupree, 2011, 2012\n \n This file is part of Lasercake.\n\n Lasercake is free software: you can redistribute it and\/or modify\n it under the terms of the GNU General Public License as published by\n the Free Software Foundation, either version 3 of the License, or\n (at your option) any later version.\n\n Lasercake is distributed in the hope that it will be useful,\n but WITHOUT ANY WARRANTY; without even the implied warranty of\n MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the\n GNU General Public License for more details.\n\n You should have received a copy of the GNU General Public License\n along with Lasercake. If not, see <http:\/\/www.gnu.org\/licenses\/>.\n\n*\/\n\n#include \"world.hpp\"\n\nusing namespace the_decomposition_of_the_world_into_blocks_impl;\n\nnamespace the_decomposition_of_the_world_into_blocks_impl {\n\n \/\/ Water that starts out in a worldblock starts out inactive (observing the rule \"the landscape takes zero time to process\").\n \/\/\n \/\/ We would have to make special rules for worldblocks that start out with\n \/\/ active water in them, because it could invalidate iterators into the\n \/\/ active_water_tiles map, because worldblocks can be created essentially any time in the processing.\n \/\/\n \/\/ If we try to use a level-X value from a worldblock while it's busy computing a realization\n \/\/ level less-than-or-equal-to X, then we justly receive get an assertion failure.\n \/\/ Realizing a worldblock at a given level must not require same-level information.\n worldblock& worldblock::ensure_realization(level_of_tile_realization_needed realineeded, world *w, vector3<tile_coordinate> global_position) {\n \/\/ This function gets called to do nothing a LOT more than it gets called to actually do something;\n \/\/ bail ASAP if we don't have to do anything.\n if (realineeded <= current_tile_realization_) return *this;\n \n caller_correct_if(realineeded >= COMPLETELY_IMAGINARY && realineeded <= FULL_REALIZATION, \"Calling ensure_realization with an invalid realization level\");\n \n if (( realineeded >= CONTENTS_ONLY) &&\n (current_tile_realization_ < CONTENTS_ONLY)) {\n \n caller_error_if(is_busy_realizing_, \"Referring to a realization level currently being computed\");\n is_busy_realizing_ = true;\n \n w_ = w;\n global_position_ = global_position;\n tile_bounding_box bounds(global_position_, vector3<tile_coordinate>(worldblock_dimension,worldblock_dimension,worldblock_dimension));\n w_->worldgen_function_(world_building_gun(w_, bounds), bounds);\n \/\/std::cerr << \"A worldblock has been created!\\n\";\n \n current_tile_realization_ = CONTENTS_ONLY;\n is_busy_realizing_ = false;\n }\n \n if (( realineeded >= CONTENTS_AND_LOCAL_CACHES_ONLY) &&\n (current_tile_realization_ < CONTENTS_AND_LOCAL_CACHES_ONLY)) {\n \n caller_error_if(is_busy_realizing_, \"Referring to a realization level currently being computed\");\n is_busy_realizing_ = true;\n \n for (tile_coordinate x = global_position.x; x < global_position.x + worldblock_dimension; ++x) {\n for (tile_coordinate y = global_position.y; y < global_position.y + worldblock_dimension; ++y) {\n for (tile_coordinate z = global_position.z; z < global_position.z + worldblock_dimension; ++z) {\n tile_location loc(vector3<tile_coordinate>(x,y,z), this);\n w_->initialize_tile_local_caches_(loc);\n }\n }\n }\n \n current_tile_realization_ = CONTENTS_AND_LOCAL_CACHES_ONLY;\n is_busy_realizing_ = false;\n }\n \n if (( realineeded >= FULL_REALIZATION) &&\n (current_tile_realization_ < FULL_REALIZATION)) {\n \n caller_error_if(is_busy_realizing_, \"Referring to a realization level currently being computed\");\n is_busy_realizing_ = true;\n \n for (tile_coordinate x = global_position.x; x < global_position.x + worldblock_dimension; ++x) {\n for (tile_coordinate y = global_position.y; y < global_position.y + worldblock_dimension; ++y) {\n for (tile_coordinate z = global_position.z; z < global_position.z + worldblock_dimension; ++z) {\n const vector3<tile_coordinate> coords(x,y,z);\n tile& here = this->get_tile(coords);\n \/\/ Checking contents() here: significant speed improvement.\n \/\/ (Some from the inlining, some from not having to construct a tile_location if not GROUPABLE_WATER,\n \/\/ I believe.) --Isaac\n if (here.contents() == GROUPABLE_WATER) {\n w_->initialize_tile_water_group_caches_(tile_location(coords, this));\n }\n }\n }\n }\n \n current_tile_realization_ = FULL_REALIZATION;\n is_busy_realizing_ = false;\n }\n \n return (*this);\n }\n \n template<> bool worldblock::crossed_boundary<xminus>(tile_coordinate new_coord) { return new_coord < global_position_.x; }\n template<> bool worldblock::crossed_boundary<yminus>(tile_coordinate new_coord) { return new_coord < global_position_.y; }\n template<> bool worldblock::crossed_boundary<zminus>(tile_coordinate new_coord) { return new_coord < global_position_.z; }\n template<> bool worldblock::crossed_boundary<xplus>(tile_coordinate new_coord) { return new_coord >= global_position_.x + worldblock_dimension; }\n template<> bool worldblock::crossed_boundary<yplus>(tile_coordinate new_coord) { return new_coord >= global_position_.y + worldblock_dimension; }\n template<> bool worldblock::crossed_boundary<zplus>(tile_coordinate new_coord) { return new_coord >= global_position_.z + worldblock_dimension; }\n\n template<cardinal_direction Dir> tile_location worldblock::get_neighboring_loc(vector3<tile_coordinate> const& old_coords, level_of_tile_realization_needed realineeded) {\n ensure_realization(realineeded);\n vector3<tile_coordinate> new_coords = old_coords; cdir_info<Dir>::add_to(new_coords);\n if (crossed_boundary<Dir>(new_coords[cdir_info<Dir>::dimension])) return get_loc_across_boundary<Dir>(new_coords, realineeded);\n else return tile_location(new_coords, this);\n }\n\n template<cardinal_direction Dir> tile_location worldblock::get_loc_across_boundary(vector3<tile_coordinate> const& new_coords, level_of_tile_realization_needed realineeded) {\n if (worldblock* neighbor = neighbors_[Dir]) {\n neighbor->ensure_realization(realineeded);\n return tile_location(new_coords, neighbor);\n }\n else return tile_location(\n new_coords,\n (\n neighbors_[Dir] =\n w_->ensure_realization_of_and_get_worldblock_(\n global_position_ + vector3<worldblock_dimension_type>(cdir_info<Dir>::as_vector()) * worldblock_dimension,\n realineeded\n )\n )\n );\n }\n\n tile_location worldblock::get_loc_guaranteed_to_be_in_this_block(vector3<tile_coordinate> coords) {\n return tile_location(coords, this);\n }\n\n}\n\n\ntile_location tile_location::get_neighbor_by_variable(cardinal_direction dir, level_of_tile_realization_needed realineeded)const {\n switch(dir) {\n case xminus: return wb_->get_neighboring_loc<xminus>(v_, realineeded);\n case yminus: return wb_->get_neighboring_loc<yminus>(v_, realineeded);\n case zminus: return wb_->get_neighboring_loc<zminus>(v_, realineeded);\n case xplus: return wb_->get_neighboring_loc<xplus>(v_, realineeded);\n case yplus: return wb_->get_neighboring_loc<yplus>(v_, realineeded);\n case zplus: return wb_->get_neighboring_loc<zplus>(v_, realineeded);\n default: caller_error(\"calling get_neighbor_by_variable with an invalid direction\");\n }\n}\n\nnamespace { \/\/ anonymous\nvector3<tile_coordinate> coordinates_of_containing_worldblock(vector3<tile_coordinate> const& coords) {\n return vector3<tile_coordinate>(\n coords.x & ~(worldblock_dimension-1),\n coords.y & ~(worldblock_dimension-1),\n coords.z & ~(worldblock_dimension-1)\n );\n}\n} \/\/ end anonymous namespace\n\ntile_location world::make_tile_location(vector3<tile_coordinate> const& coords, level_of_tile_realization_needed realineeded) {\n return ensure_realization_of_and_get_worldblock_(coordinates_of_containing_worldblock(coords), realineeded)->get_loc_guaranteed_to_be_in_this_block(coords);\n}\n\nworldblock* world::ensure_realization_of_and_get_worldblock_(vector3<tile_coordinate> position, level_of_tile_realization_needed realineeded) {\n return &(blocks_[position].ensure_realization(realineeded, this, position));\n}\n\nvoid world::ensure_realization_of_space_(tile_bounding_box space, level_of_tile_realization_needed realineeded) {\n const worldblock_dimension_type wd = worldblock_dimension;\n for (tile_coordinate\n x = space.min.x \/ wd;\n x < (space.min.x + space.size.x + (wd - 1)) \/ wd;\n ++x) {\n for (tile_coordinate\n y = space.min.y \/ wd;\n y < (space.min.y + space.size.y + (wd - 1)) \/ wd;\n ++y) {\n for (tile_coordinate\n z = space.min.z \/ wd;\n z < (space.min.z + space.size.z + (wd - 1)) \/ wd;\n ++z) {\n const vector3<tile_coordinate> worldblock_position(x*wd, y*wd, z*wd);\n ensure_realization_of_and_get_worldblock_(worldblock_position, realineeded);\n }\n }\n }\n}\n\n\n<commit_msg>fixed a bug Isaac introduced with the coding conventions<commit_after>\/*\n\n Copyright Eli Dupree and Isaac Dupree, 2011, 2012\n \n This file is part of Lasercake.\n\n Lasercake is free software: you can redistribute it and\/or modify\n it under the terms of the GNU General Public License as published by\n the Free Software Foundation, either version 3 of the License, or\n (at your option) any later version.\n\n Lasercake is distributed in the hope that it will be useful,\n but WITHOUT ANY WARRANTY; without even the implied warranty of\n MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the\n GNU General Public License for more details.\n\n You should have received a copy of the GNU General Public License\n along with Lasercake. If not, see <http:\/\/www.gnu.org\/licenses\/>.\n\n*\/\n\n#include \"world.hpp\"\n\nusing namespace the_decomposition_of_the_world_into_blocks_impl;\n\nnamespace the_decomposition_of_the_world_into_blocks_impl {\n\n \/\/ Water that starts out in a worldblock starts out inactive (observing the rule \"the landscape takes zero time to process\").\n \/\/\n \/\/ We would have to make special rules for worldblocks that start out with\n \/\/ active water in them, because it could invalidate iterators into the\n \/\/ active_water_tiles map, because worldblocks can be created essentially any time in the processing.\n \/\/\n \/\/ If we try to use a level-X value from a worldblock while it's busy computing a realization\n \/\/ level less-than-or-equal-to X, then we justly receive get an assertion failure.\n \/\/ Realizing a worldblock at a given level must not require same-level information.\n worldblock& worldblock::ensure_realization(level_of_tile_realization_needed realineeded, world *w, vector3<tile_coordinate> global_position) {\n \/\/ This function gets called to do nothing a LOT more than it gets called to actually do something;\n \/\/ bail ASAP if we don't have to do anything.\n if (realineeded <= current_tile_realization_) return *this;\n \n caller_correct_if(realineeded >= COMPLETELY_IMAGINARY && realineeded <= FULL_REALIZATION, \"Calling ensure_realization with an invalid realization level\");\n \n if (( realineeded >= CONTENTS_ONLY) &&\n (current_tile_realization_ < CONTENTS_ONLY)) {\n \n caller_error_if(is_busy_realizing_, \"Referring to a realization level currently being computed\");\n is_busy_realizing_ = true;\n \n w_ = w;\n global_position_ = global_position;\n tile_bounding_box bounds(global_position_, vector3<tile_coordinate>(worldblock_dimension,worldblock_dimension,worldblock_dimension));\n w_->worldgen_function_(world_building_gun(w_, bounds), bounds);\n \/\/std::cerr << \"A worldblock has been created!\\n\";\n \n current_tile_realization_ = CONTENTS_ONLY;\n is_busy_realizing_ = false;\n }\n \n if (( realineeded >= CONTENTS_AND_LOCAL_CACHES_ONLY) &&\n (current_tile_realization_ < CONTENTS_AND_LOCAL_CACHES_ONLY)) {\n \n caller_error_if(is_busy_realizing_, \"Referring to a realization level currently being computed\");\n is_busy_realizing_ = true;\n \n for (tile_coordinate x = global_position_.x; x < global_position_.x + worldblock_dimension; ++x) {\n for (tile_coordinate y = global_position_.y; y < global_position_.y + worldblock_dimension; ++y) {\n for (tile_coordinate z = global_position_.z; z < global_position_.z + worldblock_dimension; ++z) {\n tile_location loc(vector3<tile_coordinate>(x,y,z), this);\n w_->initialize_tile_local_caches_(loc);\n }\n }\n }\n \n current_tile_realization_ = CONTENTS_AND_LOCAL_CACHES_ONLY;\n is_busy_realizing_ = false;\n }\n \n if (( realineeded >= FULL_REALIZATION) &&\n (current_tile_realization_ < FULL_REALIZATION)) {\n \n caller_error_if(is_busy_realizing_, \"Referring to a realization level currently being computed\");\n is_busy_realizing_ = true;\n \n for (tile_coordinate x = global_position_.x; x < global_position_.x + worldblock_dimension; ++x) {\n for (tile_coordinate y = global_position_.y; y < global_position_.y + worldblock_dimension; ++y) {\n for (tile_coordinate z = global_position_.z; z < global_position_.z + worldblock_dimension; ++z) {\n const vector3<tile_coordinate> coords(x,y,z);\n tile& here = this->get_tile(coords);\n \/\/ Checking contents() here: significant speed improvement.\n \/\/ (Some from the inlining, some from not having to construct a tile_location if not GROUPABLE_WATER,\n \/\/ I believe.) --Isaac\n if (here.contents() == GROUPABLE_WATER) {\n w_->initialize_tile_water_group_caches_(tile_location(coords, this));\n }\n }\n }\n }\n \n current_tile_realization_ = FULL_REALIZATION;\n is_busy_realizing_ = false;\n }\n \n return (*this);\n }\n \n template<> bool worldblock::crossed_boundary<xminus>(tile_coordinate new_coord) { return new_coord < global_position_.x; }\n template<> bool worldblock::crossed_boundary<yminus>(tile_coordinate new_coord) { return new_coord < global_position_.y; }\n template<> bool worldblock::crossed_boundary<zminus>(tile_coordinate new_coord) { return new_coord < global_position_.z; }\n template<> bool worldblock::crossed_boundary<xplus>(tile_coordinate new_coord) { return new_coord >= global_position_.x + worldblock_dimension; }\n template<> bool worldblock::crossed_boundary<yplus>(tile_coordinate new_coord) { return new_coord >= global_position_.y + worldblock_dimension; }\n template<> bool worldblock::crossed_boundary<zplus>(tile_coordinate new_coord) { return new_coord >= global_position_.z + worldblock_dimension; }\n\n template<cardinal_direction Dir> tile_location worldblock::get_neighboring_loc(vector3<tile_coordinate> const& old_coords, level_of_tile_realization_needed realineeded) {\n ensure_realization(realineeded);\n vector3<tile_coordinate> new_coords = old_coords; cdir_info<Dir>::add_to(new_coords);\n if (crossed_boundary<Dir>(new_coords[cdir_info<Dir>::dimension])) return get_loc_across_boundary<Dir>(new_coords, realineeded);\n else return tile_location(new_coords, this);\n }\n\n template<cardinal_direction Dir> tile_location worldblock::get_loc_across_boundary(vector3<tile_coordinate> const& new_coords, level_of_tile_realization_needed realineeded) {\n if (worldblock* neighbor = neighbors_[Dir]) {\n neighbor->ensure_realization(realineeded);\n return tile_location(new_coords, neighbor);\n }\n else return tile_location(\n new_coords,\n (\n neighbors_[Dir] =\n w_->ensure_realization_of_and_get_worldblock_(\n global_position_ + vector3<worldblock_dimension_type>(cdir_info<Dir>::as_vector()) * worldblock_dimension,\n realineeded\n )\n )\n );\n }\n\n tile_location worldblock::get_loc_guaranteed_to_be_in_this_block(vector3<tile_coordinate> coords) {\n return tile_location(coords, this);\n }\n\n}\n\n\ntile_location tile_location::get_neighbor_by_variable(cardinal_direction dir, level_of_tile_realization_needed realineeded)const {\n switch(dir) {\n case xminus: return wb_->get_neighboring_loc<xminus>(v_, realineeded);\n case yminus: return wb_->get_neighboring_loc<yminus>(v_, realineeded);\n case zminus: return wb_->get_neighboring_loc<zminus>(v_, realineeded);\n case xplus: return wb_->get_neighboring_loc<xplus>(v_, realineeded);\n case yplus: return wb_->get_neighboring_loc<yplus>(v_, realineeded);\n case zplus: return wb_->get_neighboring_loc<zplus>(v_, realineeded);\n default: caller_error(\"calling get_neighbor_by_variable with an invalid direction\");\n }\n}\n\nnamespace { \/\/ anonymous\nvector3<tile_coordinate> coordinates_of_containing_worldblock(vector3<tile_coordinate> const& coords) {\n return vector3<tile_coordinate>(\n coords.x & ~(worldblock_dimension-1),\n coords.y & ~(worldblock_dimension-1),\n coords.z & ~(worldblock_dimension-1)\n );\n}\n} \/\/ end anonymous namespace\n\ntile_location world::make_tile_location(vector3<tile_coordinate> const& coords, level_of_tile_realization_needed realineeded) {\n return ensure_realization_of_and_get_worldblock_(coordinates_of_containing_worldblock(coords), realineeded)->get_loc_guaranteed_to_be_in_this_block(coords);\n}\n\nworldblock* world::ensure_realization_of_and_get_worldblock_(vector3<tile_coordinate> position, level_of_tile_realization_needed realineeded) {\n return &(blocks_[position].ensure_realization(realineeded, this, position));\n}\n\nvoid world::ensure_realization_of_space_(tile_bounding_box space, level_of_tile_realization_needed realineeded) {\n const worldblock_dimension_type wd = worldblock_dimension;\n for (tile_coordinate\n x = space.min.x \/ wd;\n x < (space.min.x + space.size.x + (wd - 1)) \/ wd;\n ++x) {\n for (tile_coordinate\n y = space.min.y \/ wd;\n y < (space.min.y + space.size.y + (wd - 1)) \/ wd;\n ++y) {\n for (tile_coordinate\n z = space.min.z \/ wd;\n z < (space.min.z + space.size.z + (wd - 1)) \/ wd;\n ++z) {\n const vector3<tile_coordinate> worldblock_position(x*wd, y*wd, z*wd);\n ensure_realization_of_and_get_worldblock_(worldblock_position, realineeded);\n }\n }\n }\n}\n\n\n<|endoftext|>"} {"text":"<commit_before>\/\/ This file is part of playd.\n\/\/ playd is licensed under the MIT licence: see LICENSE.txt.\n\n\/**\n * @file\n * Declaration of the Player class, and associated types.\n * @see player.cpp\n *\/\n\n#ifndef PLAYD_PLAYER_HPP\n#define PLAYD_PLAYER_HPP\n\n#include <cstdint>\n#include <map>\n#include <memory>\n#include <string>\n#include <utility>\n#include <vector>\n\n#include \"audio\/audio_system.hpp\"\n#include \"audio\/audio.hpp\"\n#include \"response.hpp\"\n#include \"cmd_result.hpp\"\n\n\/**\n * A Player contains a loaded audio file and a command API for manipulating it.\n * @see Audio\n * @see AudioSystem\n *\/\nclass Player\n{\nprivate:\n\tAudioSystem &audio; \/\/\/< The system used for loading audio.\n\tstd::unique_ptr<Audio> file; \/\/\/< The currently loaded Audio.\n\tbool is_running; \/\/\/< Whether the Player is running.\n\tconst ResponseSink *sink; \/\/\/< The sink for audio responses.\n\n\t\/\/\/ The set of features playd implements.\n\tconst static std::vector<std::string> FEATURES;\n\npublic:\n\t\/**\n\t * Constructs a Player.\n\t * @param audio The AudioSystem to be used by the player.\n\t *\/\n\tPlayer(AudioSystem &audio);\n\n\t\/\/\/ Deleted copy constructor.\n\tPlayer(const Player &) = delete;\n\n\t\/\/\/ Deleted copy-assignment constructor.\n\tPlayer &operator=(const Player &) = delete;\n\n\t\/**\n\t * Sets the sink to which this Player shall send responses.\n\t * @param sink The response sink.\n\t *\/\n\tvoid SetSink(ResponseSink &sink);\n\n\t\/\/\n\t\/\/ Commands\n\t\/\/\n\n\t\/**\n\t * Handles a command line.\n\t * @param cmd A reference to the list of words in the command.\n\t * @return Whether the command succeeded.\n\t *\/\n\tCommandResult RunCommand(const std::vector<std::string> &words);\n\n\t\/\/\n\t\/\/ Other methods\n\t\/\/\n\n\t\/**\n\t * Instructs the Player to perform a cycle of work.\n\t * This includes decoding the next frame and responding to commands.\n\t * @return Whether the player has more cycles of work to do.\n\t *\/\n\tbool Update();\n\n\t\/**\n\t * Sends welcome\/current status information to a new client.\n\t * @param id The ID of the new client inside the IO system.\n\t *\/\n\tvoid WelcomeClient(size_t id) const;\n\nprivate:\n\t\/\/\n\t\/\/ Commands\n\t\/\/\n\n\t\/**\n\t * Runs a nullary (0-argument) command.\n\t * @param word The command word.\n\t * @return True if the command was successfully found and executed;\n\t * false otherwise.\n\t *\/\n\tCommandResult RunNullaryCommand(const std::string &word);\n\n\t\/**\n\t * Runs a unary (1-argument) command.\n\t * @param word The command word.\n\t * @param arg The argument to the command.\n\t * @return True if the command was successfully found and executed;\n\t * false otherwise.\n\t *\/\n\tCommandResult RunUnaryCommand(const std::string &word,\n\t const std::string &arg);\n\n\t\/\/\n\t\/\/ Playback control\n\t\/\/\n\n\t\/**\n\t * Tells the audio file to start or stop playing.\n\t * @param playing True if playing; false otherwise.\n\t * @see Play\n\t * @see Stop\n\t *\/\n\tCommandResult SetPlaying(bool playing);\n\n\t\/**\n\t * Ejects the current loaded song, if any.\n\t * @return Whether the ejection succeeded.\n\t *\/\n\tCommandResult Eject();\n\n\t\/**\n\t * Loads a track.\n\t * @param path The absolute path to a track to load.\n\t * @return Whether the load succeeded.\n\t *\/\n\tCommandResult Load(const std::string &path);\n\n\t\/\/\/ Handles ending a file (stopping and rewinding).\n\tvoid End();\n\n\t\/\/\n\t\/\/ Seeking\n\t\/\/\n\n\t\/**\n\t * Seeks to a given position in the current track.\n\t * @param time_str A string containing a timestamp, followed by the\n\t * shorthand for the units of time in which the timestamp is measured\n\t * relative to the start of the track. If the latter is omitted,\n\t * microseconds are assumed.\n\t * @return Whether the seek succeeded.\n\t *\/\n\tCommandResult Seek(const std::string &time_str);\n\n\t\/**\n\t * Parses time_str as a seek timestamp.\n\t * @param time_str The time string to be parsed.\n\t * @return The parsed time.\n\t * @exception std::out_of_range\n\t * See http:\/\/www.cplusplus.com\/reference\/string\/stoull\/#exceptions\n\t * @exception std::invalid_argument\n\t * See http:\/\/www.cplusplus.com\/reference\/string\/stoull\/#exceptions\n\t * @exception SeekError\n\t * Raised if checks beyond those done by stoull fail.\n\t *\/\n\tstatic std::uint64_t SeekParse(const std::string &time_str);\n\n\t\/**\n\t * Performs an actual seek.\n\t * This does not do any EOF handling.\n\t * @param pos The new position, in microseconds.\n\t * @exception SeekError\n\t * Raised if the seek is out of range (usually EOF).\n\t * @see Player::Seek\n\t *\/\n\tvoid SeekRaw(std::uint64_t pos);\n\n\t\/\/\n\t\/\/ Other\n\t\/\/\n\n\t\/**\n\t * Quits playd.\n\t * @return Whether the quit succeeded.\n\t *\/\n\tCommandResult Quit();\n\n\t\/**\n\t * Asks the current file to dump all of its state to the connection\n\t * with the given ID.\n\t * @param id The ID of the connection to receive the dump.\n\t * @note This is a pointer, not a reference, so as to allow nullptr\n\t * (which means no sink is assigned). When `optional` becomes\n\t * standard, perhaps use that.\n\t *\/\n\tvoid EmitAllAudioState(size_t id) const;\n};\n\n#endif \/\/ PLAYD_PLAYER_HPP\n<commit_msg>Clean up public methods of Player.<commit_after>\/\/ This file is part of playd.\n\/\/ playd is licensed under the MIT licence: see LICENSE.txt.\n\n\/**\n * @file\n * Declaration of the Player class, and associated types.\n * @see player.cpp\n *\/\n\n#ifndef PLAYD_PLAYER_HPP\n#define PLAYD_PLAYER_HPP\n\n#include <cstdint>\n#include <map>\n#include <memory>\n#include <string>\n#include <utility>\n#include <vector>\n\n#include \"audio\/audio_system.hpp\"\n#include \"audio\/audio.hpp\"\n#include \"response.hpp\"\n#include \"cmd_result.hpp\"\n\n\/**\n * A Player contains a loaded audio file and a command API for manipulating it.\n * @see Audio\n * @see AudioSystem\n *\/\nclass Player\n{\npublic:\n\t\/**\n\t * Constructs a Player.\n\t * @param audio The AudioSystem to be used by the player.\n\t *\/\n\tPlayer(AudioSystem &audio);\n\n\t\/\/\/ Deleted copy constructor.\n\tPlayer(const Player &) = delete;\n\n\t\/\/\/ Deleted copy-assignment constructor.\n\tPlayer &operator=(const Player &) = delete;\n\n\t\/**\n\t * Handles a command line.\n\t * @param cmd A reference to the list of words in the command.\n\t * @return Whether the command succeeded.\n\t *\/\n\tCommandResult RunCommand(const std::vector<std::string> &words);\n\n\t\/**\n\t * Sets the sink to which this Player shall send responses.\n\t * This sink shall be the target for WelcomeClient, as well as\n\t * any responses generated by RunCommand or Update.\n\t * @param sink The response sink.\n\t *\/\n\tvoid SetSink(ResponseSink &sink);\n\n\t\/**\n\t * Instructs the Player to perform a cycle of work.\n\t * This includes decoding the next frame and responding to commands.\n\t * @return Whether the player has more cycles of work to do.\n\t *\/\n\tbool Update();\n\n\t\/**\n\t * Sends welcome\/current status information to a new client.\n\t * @param id The ID of the new client inside the IO system.\n\t *\/\n\tvoid WelcomeClient(size_t id) const;\n\nprivate:\n\tAudioSystem &audio; \/\/\/< The system used for loading audio.\n\tstd::unique_ptr<Audio> file; \/\/\/< The currently loaded audio file.\n\tbool is_running; \/\/\/< Whether the Player is running.\n\tconst ResponseSink *sink; \/\/\/< The sink for audio responses.\n\n\t\/\/\/ The set of features playd implements.\n\tconst static std::vector<std::string> FEATURES;\n\n\t\/\/\n\t\/\/ Commands\n\t\/\/\n\n\t\/**\n\t * Runs a nullary (0-argument) command.\n\t * @param word The command word.\n\t * @return True if the command was successfully found and executed;\n\t * false otherwise.\n\t *\/\n\tCommandResult RunNullaryCommand(const std::string &word);\n\n\t\/**\n\t * Runs a unary (1-argument) command.\n\t * @param word The command word.\n\t * @param arg The argument to the command.\n\t * @return True if the command was successfully found and executed;\n\t * false otherwise.\n\t *\/\n\tCommandResult RunUnaryCommand(const std::string &word,\n\t const std::string &arg);\n\n\t\/\/\n\t\/\/ Playback control\n\t\/\/\n\n\t\/**\n\t * Tells the audio file to start or stop playing.\n\t * @param playing True if playing; false otherwise.\n\t * @see Play\n\t * @see Stop\n\t *\/\n\tCommandResult SetPlaying(bool playing);\n\n\t\/**\n\t * Ejects the current loaded song, if any.\n\t * @return Whether the ejection succeeded.\n\t *\/\n\tCommandResult Eject();\n\n\t\/**\n\t * Loads a track.\n\t * @param path The absolute path to a track to load.\n\t * @return Whether the load succeeded.\n\t *\/\n\tCommandResult Load(const std::string &path);\n\n\t\/\/\/ Handles ending a file (stopping and rewinding).\n\tvoid End();\n\n\t\/\/\n\t\/\/ Seeking\n\t\/\/\n\n\t\/**\n\t * Seeks to a given position in the current track.\n\t * @param time_str A string containing a timestamp, followed by the\n\t * shorthand for the units of time in which the timestamp is measured\n\t * relative to the start of the track. If the latter is omitted,\n\t * microseconds are assumed.\n\t * @return Whether the seek succeeded.\n\t *\/\n\tCommandResult Seek(const std::string &time_str);\n\n\t\/**\n\t * Parses time_str as a seek timestamp.\n\t * @param time_str The time string to be parsed.\n\t * @return The parsed time.\n\t * @exception std::out_of_range\n\t * See http:\/\/www.cplusplus.com\/reference\/string\/stoull\/#exceptions\n\t * @exception std::invalid_argument\n\t * See http:\/\/www.cplusplus.com\/reference\/string\/stoull\/#exceptions\n\t * @exception SeekError\n\t * Raised if checks beyond those done by stoull fail.\n\t *\/\n\tstatic std::uint64_t SeekParse(const std::string &time_str);\n\n\t\/**\n\t * Performs an actual seek.\n\t * This does not do any EOF handling.\n\t * @param pos The new position, in microseconds.\n\t * @exception SeekError\n\t * Raised if the seek is out of range (usually EOF).\n\t * @see Player::Seek\n\t *\/\n\tvoid SeekRaw(std::uint64_t pos);\n\n\t\/\/\n\t\/\/ Other\n\t\/\/\n\n\t\/**\n\t * Quits playd.\n\t * @return Whether the quit succeeded.\n\t *\/\n\tCommandResult Quit();\n\n\t\/**\n\t * Asks the current file to dump all of its state to the connection\n\t * with the given ID.\n\t * @param id The ID of the connection to receive the dump.\n\t * @note This is a pointer, not a reference, so as to allow nullptr\n\t * (which means no sink is assigned). When `optional` becomes\n\t * standard, perhaps use that.\n\t *\/\n\tvoid EmitAllAudioState(size_t id) const;\n};\n\n#endif \/\/ PLAYD_PLAYER_HPP\n<|endoftext|>"} {"text":"<commit_before>#include \"core.hpp\"\n#include \"output.hpp\"\n#include <cmath>\n#include \"input-manager.hpp\"\n\nbool wayfire_grab_interface_t::grab()\n{\n if (grabbed)\n return true;\n\n if (!output->is_plugin_active(name))\n return false;\n\n grabbed = true;\n\n \/* unset modifiers, otherwise clients may not receive\n * the release event for them, as the release usually happens in a grab *\/\n auto kbd = weston_seat_get_keyboard(core->get_current_seat());\n if (kbd)\n {\n weston_keyboard_send_modifiers(kbd,\n wl_display_get_serial(core->ec->wl_display),\n 0, 0, 0, 0);\n }\n\n return core->input->grab_input(this);\n}\n\nvoid wayfire_grab_interface_t::ungrab()\n{\n if (!grabbed)\n return;\n\n grabbed = false;\n core->input->ungrab_input();\n}\n\nbool wayfire_grab_interface_t::is_grabbed()\n{\n return grabbed;\n}\n\nvoid wayfire_plugin_t::fini() {}\n\nconst float MPI = 3.1415926535;\n\nfloat GetProgress(float start, float end, float current_step, float max_steps)\n{\n if (max_steps <= 1e-4)\n return end;\n\n float c = current_step \/ max_steps;\n float prog = (std::sin(1.5 * MPI + MPI * c) + 1) \/ 2.0;\n return prog * end + (1 - prog) * start;\n}\n<commit_msg>plugin: change animation easing function<commit_after>#include \"core.hpp\"\n#include \"output.hpp\"\n#include <cmath>\n#include \"input-manager.hpp\"\n\nbool wayfire_grab_interface_t::grab()\n{\n if (grabbed)\n return true;\n\n if (!output->is_plugin_active(name))\n return false;\n\n grabbed = true;\n\n \/* unset modifiers, otherwise clients may not receive\n * the release event for them, as the release usually happens in a grab *\/\n auto kbd = weston_seat_get_keyboard(core->get_current_seat());\n if (kbd)\n {\n weston_keyboard_send_modifiers(kbd,\n wl_display_get_serial(core->ec->wl_display),\n 0, 0, 0, 0);\n }\n\n return core->input->grab_input(this);\n}\n\nvoid wayfire_grab_interface_t::ungrab()\n{\n if (!grabbed)\n return;\n\n grabbed = false;\n core->input->ungrab_input();\n}\n\nbool wayfire_grab_interface_t::is_grabbed()\n{\n return grabbed;\n}\n\nvoid wayfire_plugin_t::fini() {}\n\nconst float MPI = 3.1415926535;\n\nfloat GetProgress(float start, float end, float current_step, float max_steps)\n{\n if (max_steps <= 1e-4)\n return end;\n\n float c = current_step \/ max_steps;\n float prog = std::sqrt(2 * c - c * c);\n return prog * end + (1 - prog) * start;\n}\n<|endoftext|>"} {"text":"<commit_before>#include <cstring>\n\n#include <boost\/filesystem.hpp>\n\n#include \"about_window.h\"\n#include \"viewer_window.h\"\n#include \"find_datarefs_in_files.h\"\n\n#include \"datarefs.h\"\n\n#include \"prefs.h\"\n\n#include \"XPWidgets.h\"\n#include \"XPLMMenus.h\"\n#include \"XPLMDisplay.h\"\n#include \"XPLMUtilities.h\"\n#include \"XPLMPlugin.h\"\n#include \"XPLMProcessing.h\"\n#include \"XPLMPlanes.h\"\n\nboost::filesystem::path prefs_path;\n\nvoid loadAircraftDatarefs() {\n\t\/\/get path\n\tchar filename[256] = {0};\n\tchar path[512] = {0};\n\tXPLMGetNthAircraftModel(0, filename, path);\n\tstd::vector<std::string> aircraft_datarefs = getDatarefsFromAircraft(path);\n\n\tint loaded_ok = addUserDatarefs(aircraft_datarefs);\n\tconst std::string message = std::string(\"DRT: Found \") + std::to_string(aircraft_datarefs.size()) + std::string(\" possible datarefs from aircraft files; \" + std::to_string(loaded_ok) + \" loaded OK.\\n\");\n\tXPLMDebugString(message.c_str());\n}\n\n\n\/\/callback so we can load new aircraft datarefs when the aircraft is reloaded\nfloat load_acf_dr_callback(float, float, int, void *) {\n\tloadAircraftDatarefs();\n\n\tupdateViewerResults();\n\tupdateSearchResults();\n\n\treturn 0; \n}\n\nfloat load_dr_callback(float, float, int, void *) {\n\tif(false == loadDatarefsFile()) {\n\t\tXPLMDebugString(\"DRT: Couldn't load datarefs from file.\");\n\t\treturn 0;\n\t}\n\n\tloadAircraftDatarefs();\n\n\t\/\/load plugins\n\tint num_plugins = XPLMCountPlugins();\n\tXPLMPluginID my_id = XPLMGetMyID();\n\n\tstd::vector<std::string> all_plugin_datarefs;\n\n\tfor(int i = 0; i < num_plugins; i++) {\n\t\tXPLMPluginID id = XPLMGetNthPlugin(i);\n\t\tif(id == my_id) {\n\t\t\tcontinue;\n\t\t}\n\n\t\tchar filename[256] = {0};\n\t\tchar path[512] = {0};\n\t\tXPLMGetPluginInfo(id, filename, path, nullptr, nullptr);\n\n\t\tstd::vector<std::string> this_plugin_datarefs = getDatarefsFromFile(path);\n\t\tall_plugin_datarefs.insert(all_plugin_datarefs.end(), this_plugin_datarefs.begin(), this_plugin_datarefs.end());\n\t}\n\n\tremoveVectorUniques(all_plugin_datarefs);\n\n\tint loaded_ok = addUserDatarefs(all_plugin_datarefs);\n\tconst std::string message = std::string(\"DRT: Found \") + std::to_string(all_plugin_datarefs.size()) + std::string(\" possible datarefs from plugin files; \" + std::to_string(loaded_ok) + \" loaded OK.\\n\");\n\tXPLMDebugString(message.c_str());\n\n\tupdateViewerResults();\n\tupdateSearchResults();\n\n\treturn 0; \n}\n\nvoid reloadAircraft() {\n\tchar acf_path[2048], acf_filename[1024];\n\tXPLMGetNthAircraftModel(0, acf_filename, acf_path);\n\tXPLMSetUsersAircraft(acf_path);\n}\n\nvoid plugin_menu_handler(void *, void * inItemRef)\n{\n\tswitch ( intptr_t(inItemRef) )\n\t{\n\t\tcase 0: showViewerWindow(); break;\t\n\t\t\/\/case 1: showCommandWindow(); break;\t\n\t\tcase 2:\n\t\t\tXPLMSetFlightLoopCallbackInterval(load_dr_callback, -1, 1, nullptr);\n\t\t\tbreak;\n\t\tcase 3: \n\t\t\tXPLMDebugString(\"DRT: reloaded aircraft\\n\");\n\t\t\treloadAircraft();\n\t\t\tbreak;\n\t\tcase 4: \n\t\t\tXPLMDebugString(\"DRT: reloaded plugins\\n\");\n\t\t\tXPLMReloadPlugins(); \n\t\t\tbreak;\n\t\tcase 5: \n\t\t\tXPLMDebugString(\"DRT: reloaded scenery\\n\");\n\t\t\tXPLMReloadScenery(); \n\t\t\tbreak;\n\t\tcase 6: \n\t\t\tshowAboutWindow(); \n\t\t\tbreak;\n\t\tdefault:\n\t\t\tbreak;\n\t}\n}\t\n\nXPLMCommandRef reload_aircraft_command = nullptr;\nXPLMCommandRef reload_plugins_command = nullptr;\nXPLMCommandRef reload_scenery_command = nullptr;\nXPLMCommandRef show_datarefs_command = nullptr;\n\nint command_handler(XPLMCommandRef command, XPLMCommandPhase phase, void * ) {\n\tif(xplm_CommandBegin == phase) {\n\t\tif(command == reload_aircraft_command) {\n\t\t\t\treloadAircraft();\n\t\t} else if(command == reload_plugins_command) {\n\t\t\t\tXPLMReloadPlugins(); \n\t\t} else if(command == reload_scenery_command) {\n\t\t\t\tXPLMReloadScenery(); \n\t\t} else if(command == show_datarefs_command) {\n\t\t\t\tshowViewerWindow();\n\t\t}\n\t}\n\treturn 1;\n}\n\nPLUGIN_API int XPluginStart(char * outName, char * outSig, char * outDesc) {\n\tstrcpy(outName, \"DataRef Tool\");\n\tstrcpy(outSig, \"com.leecbaker.datareftool\");\n\tstrcpy(outDesc, \"View and edit X-Plane Datarefs\");\n\tXPLMEnableFeature(\"XPLM_USE_NATIVE_PATHS\", 1);\n\n\tchar prefs_dir_c[512];\n\tXPLMGetPrefsPath(prefs_dir_c);\n\tprefs_path = boost::filesystem::path(prefs_dir_c).parent_path() \/ \"datareftool.json\";\n if(loadPrefs(prefs_path)) {\n std::stringstream ss;\n ss << \"DRT prefs loaded from \" << prefs_path.native();\n XPLMDebugString(ss.str().c_str());\n }\n\n\tXPLMRegisterFlightLoopCallback(load_dr_callback, -1, nullptr);\n\t\n\tint plugin_submenu = XPLMAppendMenuItem(XPLMFindPluginsMenu(), \"DataRefTool\", nullptr, 1);\n\tXPLMMenuID plugin_menu = XPLMCreateMenu(\"DataRefTool\", XPLMFindPluginsMenu(), plugin_submenu, plugin_menu_handler, nullptr);\n\n\tXPLMAppendMenuItem(plugin_menu, \"View Datarefs\", (void *)0, 1);\n\tXPLMAppendMenuItem(plugin_menu, \"View Commands\", (void *)1, 1);\n\tXPLMAppendMenuSeparator(plugin_menu);\n\tXPLMAppendMenuItem(plugin_menu, \"Rescan for datarefs\", (void *)2, 1);\n\tXPLMAppendMenuSeparator(plugin_menu);\n\tXPLMAppendMenuItem(plugin_menu, \"Reload aircraft\", (void *)3, 1);\n\tXPLMAppendMenuItem(plugin_menu, \"Reload plugins\", (void *)4, 1);\n\tXPLMAppendMenuItem(plugin_menu, \"Reload scenery\", (void *)5, 1);\n\tXPLMAppendMenuSeparator(plugin_menu);\n\tXPLMAppendMenuItem(plugin_menu, \"About DataRefTool\", (void *)6, 1);\n\n\tXPLMEnableMenuItem(plugin_menu, 0, 1);\n\tXPLMEnableMenuItem(plugin_menu, 1, 0);\n\tXPLMEnableMenuItem(plugin_menu, 2, 1);\t\/\/sep\n\tXPLMEnableMenuItem(plugin_menu, 3, 1);\n\tXPLMEnableMenuItem(plugin_menu, 4, 1);\t\/\/sep\n\tXPLMEnableMenuItem(plugin_menu, 5, 1);\n\tXPLMEnableMenuItem(plugin_menu, 6, 1);\n\tXPLMEnableMenuItem(plugin_menu, 7, 1);\n\tXPLMEnableMenuItem(plugin_menu, 8, 1);\t\/\/sep\n\tXPLMEnableMenuItem(plugin_menu, 9, 1);\n\n\t\/\/commands\n\treload_aircraft_command = XPLMCreateCommand(\"datareftool\/reload_aircraft\", \"Reload the current aircraft\");\n\treload_plugins_command = XPLMCreateCommand(\"datareftool\/reload_plugins\", \"Reload all plugins\");\n\treload_scenery_command = XPLMCreateCommand(\"datareftool\/reload_scenery\", \"Reload the scenery\");\n\tshow_datarefs_command = XPLMCreateCommand(\"datareftool\/show_datarefs\", \"Show the dataref search window\");\n\n\tXPLMRegisterCommandHandler(reload_aircraft_command, command_handler, 0, nullptr);\n\tXPLMRegisterCommandHandler(reload_plugins_command, command_handler, 0, nullptr);\n\tXPLMRegisterCommandHandler(reload_scenery_command, command_handler, 0, nullptr);\n\tXPLMRegisterCommandHandler(show_datarefs_command, command_handler, 0, nullptr);\n\n\treturn 1;\n}\n\nPLUGIN_API void\tXPluginStop(void) {\n if(savePrefs(prefs_path)) {\n std::stringstream ss;\n ss << \"DRT prefs saved to \" << prefs_path.native();\n XPLMDebugString(ss.str().c_str());\n }\n\t\/\/closeCommandWindows();\n\tcloseAboutWindow();\n\tcloseViewerWindows();\n\tcleanupDatarefs();\n\tXPLMUnregisterFlightLoopCallback(load_dr_callback, nullptr);\n\tXPLMUnregisterFlightLoopCallback(load_acf_dr_callback, nullptr);\n}\n\nPLUGIN_API void XPluginDisable(void) {\n}\n\nPLUGIN_API int XPluginEnable(void) {\n\treturn 1;\n}\n\nconst intptr_t MSG_ADD_DATAREF = 0x01000000;\nconst intptr_t MSG_ADD_COMMANDREF = 0x01000099;\n\nPLUGIN_API void XPluginReceiveMessage(XPLMPluginID, intptr_t inMessage, void * inParam) {\n\tswitch(inMessage) {\n\t\t\/\/ Add custom datarefs in the style of DRE:\n\t\t\/\/ http:\/\/www.xsquawkbox.net\/xpsdk\/mediawiki\/Register_Custom_DataRef_in_DRE\n\t\tcase MSG_ADD_DATAREF: {\n\t\t\tchar * dataref_name = (char *) inParam;\n\t\t\tbool added_ok = addUserDataref(dataref_name);\n\t\t\tif(added_ok) {\n\t\t\t\tupdateViewerResults();\n\t\t\t} else {\n\t\t\t\tconst std::string message = std::string(\"DRT: Couldn't load dataref from message: \") + dataref_name + std::string(\"\\n\");\n\t\t\t\tXPLMDebugString(message.c_str());\n\t\t\t}\n\t\t\tbreak;\n\t\t}\n\t\tcase MSG_ADD_COMMANDREF: {\n\t\t\tchar * commandref_name = (char *) inParam;\n\t\t\tbool added_ok = true;\/\/addUserCommandref(commandref_name);\n\t\t\tif(added_ok) {\n\t\t\t\t\/\/updateCommandWindows();\n\t\t\t} else {\n\t\t\t\tconst std::string message = std::string(\"DRT: Couldn't load commandref from message: \") + commandref_name + std::string(\"\\n\");\n\t\t\t\tXPLMDebugString(message.c_str());\n\t\t\t}\n\t\t\tbreak;\n\t\t}\n\n\t\tcase XPLM_MSG_PLANE_LOADED: {\n\t\t\tint64_t plane_num = int64_t(inParam);\n\t\t\tconst std::string message = std::string(\"DRT: Plane loaded #: \") + std::to_string(plane_num) + std::string(\"\\n\");\n\t\t\tXPLMDebugString(message.c_str());\n\t\t\tif(0 == plane_num) {\t\/\/user's plane\n\t\t\t\tXPLMRegisterFlightLoopCallback(load_acf_dr_callback, -1, nullptr);\n\t\t\t}\n\t\t\tbreak;\n\t\t}\n\n\t\tcase XPLM_MSG_WILL_WRITE_PREFS: {\n\t\t\tbreak;\n\t\t}\n\t}\n}\n<commit_msg>Added line feed to the prefs statements in the Log.txt file<commit_after>#include <cstring>\n\n#include <boost\/filesystem.hpp>\n\n#include \"about_window.h\"\n#include \"viewer_window.h\"\n#include \"find_datarefs_in_files.h\"\n\n#include \"datarefs.h\"\n\n#include \"prefs.h\"\n\n#include \"XPWidgets.h\"\n#include \"XPLMMenus.h\"\n#include \"XPLMDisplay.h\"\n#include \"XPLMUtilities.h\"\n#include \"XPLMPlugin.h\"\n#include \"XPLMProcessing.h\"\n#include \"XPLMPlanes.h\"\n\nboost::filesystem::path prefs_path;\n\nvoid loadAircraftDatarefs() {\n\t\/\/get path\n\tchar filename[256] = {0};\n\tchar path[512] = {0};\n\tXPLMGetNthAircraftModel(0, filename, path);\n\tstd::vector<std::string> aircraft_datarefs = getDatarefsFromAircraft(path);\n\n\tint loaded_ok = addUserDatarefs(aircraft_datarefs);\n\tconst std::string message = std::string(\"DRT: Found \") + std::to_string(aircraft_datarefs.size()) + std::string(\" possible datarefs from aircraft files; \" + std::to_string(loaded_ok) + \" loaded OK.\\n\");\n\tXPLMDebugString(message.c_str());\n}\n\n\n\/\/callback so we can load new aircraft datarefs when the aircraft is reloaded\nfloat load_acf_dr_callback(float, float, int, void *) {\n\tloadAircraftDatarefs();\n\n\tupdateViewerResults();\n\tupdateSearchResults();\n\n\treturn 0; \n}\n\nfloat load_dr_callback(float, float, int, void *) {\n\tif(false == loadDatarefsFile()) {\n\t\tXPLMDebugString(\"DRT: Couldn't load datarefs from file.\");\n\t\treturn 0;\n\t}\n\n\tloadAircraftDatarefs();\n\n\t\/\/load plugins\n\tint num_plugins = XPLMCountPlugins();\n\tXPLMPluginID my_id = XPLMGetMyID();\n\n\tstd::vector<std::string> all_plugin_datarefs;\n\n\tfor(int i = 0; i < num_plugins; i++) {\n\t\tXPLMPluginID id = XPLMGetNthPlugin(i);\n\t\tif(id == my_id) {\n\t\t\tcontinue;\n\t\t}\n\n\t\tchar filename[256] = {0};\n\t\tchar path[512] = {0};\n\t\tXPLMGetPluginInfo(id, filename, path, nullptr, nullptr);\n\n\t\tstd::vector<std::string> this_plugin_datarefs = getDatarefsFromFile(path);\n\t\tall_plugin_datarefs.insert(all_plugin_datarefs.end(), this_plugin_datarefs.begin(), this_plugin_datarefs.end());\n\t}\n\n\tremoveVectorUniques(all_plugin_datarefs);\n\n\tint loaded_ok = addUserDatarefs(all_plugin_datarefs);\n\tconst std::string message = std::string(\"DRT: Found \") + std::to_string(all_plugin_datarefs.size()) + std::string(\" possible datarefs from plugin files; \" + std::to_string(loaded_ok) + \" loaded OK.\\n\");\n\tXPLMDebugString(message.c_str());\n\n\tupdateViewerResults();\n\tupdateSearchResults();\n\n\treturn 0; \n}\n\nvoid reloadAircraft() {\n\tchar acf_path[2048], acf_filename[1024];\n\tXPLMGetNthAircraftModel(0, acf_filename, acf_path);\n\tXPLMSetUsersAircraft(acf_path);\n}\n\nvoid plugin_menu_handler(void *, void * inItemRef)\n{\n\tswitch ( intptr_t(inItemRef) )\n\t{\n\t\tcase 0: showViewerWindow(); break;\t\n\t\t\/\/case 1: showCommandWindow(); break;\t\n\t\tcase 2:\n\t\t\tXPLMSetFlightLoopCallbackInterval(load_dr_callback, -1, 1, nullptr);\n\t\t\tbreak;\n\t\tcase 3: \n\t\t\tXPLMDebugString(\"DRT: reloaded aircraft\\n\");\n\t\t\treloadAircraft();\n\t\t\tbreak;\n\t\tcase 4: \n\t\t\tXPLMDebugString(\"DRT: reloaded plugins\\n\");\n\t\t\tXPLMReloadPlugins(); \n\t\t\tbreak;\n\t\tcase 5: \n\t\t\tXPLMDebugString(\"DRT: reloaded scenery\\n\");\n\t\t\tXPLMReloadScenery(); \n\t\t\tbreak;\n\t\tcase 6: \n\t\t\tshowAboutWindow(); \n\t\t\tbreak;\n\t\tdefault:\n\t\t\tbreak;\n\t}\n}\t\n\nXPLMCommandRef reload_aircraft_command = nullptr;\nXPLMCommandRef reload_plugins_command = nullptr;\nXPLMCommandRef reload_scenery_command = nullptr;\nXPLMCommandRef show_datarefs_command = nullptr;\n\nint command_handler(XPLMCommandRef command, XPLMCommandPhase phase, void * ) {\n\tif(xplm_CommandBegin == phase) {\n\t\tif(command == reload_aircraft_command) {\n\t\t\t\treloadAircraft();\n\t\t} else if(command == reload_plugins_command) {\n\t\t\t\tXPLMReloadPlugins(); \n\t\t} else if(command == reload_scenery_command) {\n\t\t\t\tXPLMReloadScenery(); \n\t\t} else if(command == show_datarefs_command) {\n\t\t\t\tshowViewerWindow();\n\t\t}\n\t}\n\treturn 1;\n}\n\nPLUGIN_API int XPluginStart(char * outName, char * outSig, char * outDesc) {\n\tstrcpy(outName, \"DataRef Tool\");\n\tstrcpy(outSig, \"com.leecbaker.datareftool\");\n\tstrcpy(outDesc, \"View and edit X-Plane Datarefs\");\n\tXPLMEnableFeature(\"XPLM_USE_NATIVE_PATHS\", 1);\n\n\tchar prefs_dir_c[512];\n\tXPLMGetPrefsPath(prefs_dir_c);\n\tprefs_path = boost::filesystem::path(prefs_dir_c).parent_path() \/ \"datareftool.json\";\n if(loadPrefs(prefs_path)) {\n std::stringstream ss;\n ss << \"DRT: prefs loaded from \" << prefs_path.native() << \"\\n\";\n XPLMDebugString(ss.str().c_str());\n }\n\n\tXPLMRegisterFlightLoopCallback(load_dr_callback, -1, nullptr);\n\t\n\tint plugin_submenu = XPLMAppendMenuItem(XPLMFindPluginsMenu(), \"DataRefTool\", nullptr, 1);\n\tXPLMMenuID plugin_menu = XPLMCreateMenu(\"DataRefTool\", XPLMFindPluginsMenu(), plugin_submenu, plugin_menu_handler, nullptr);\n\n\tXPLMAppendMenuItem(plugin_menu, \"View Datarefs\", (void *)0, 1);\n\tXPLMAppendMenuItem(plugin_menu, \"View Commands\", (void *)1, 1);\n\tXPLMAppendMenuSeparator(plugin_menu);\n\tXPLMAppendMenuItem(plugin_menu, \"Rescan for datarefs\", (void *)2, 1);\n\tXPLMAppendMenuSeparator(plugin_menu);\n\tXPLMAppendMenuItem(plugin_menu, \"Reload aircraft\", (void *)3, 1);\n\tXPLMAppendMenuItem(plugin_menu, \"Reload plugins\", (void *)4, 1);\n\tXPLMAppendMenuItem(plugin_menu, \"Reload scenery\", (void *)5, 1);\n\tXPLMAppendMenuSeparator(plugin_menu);\n\tXPLMAppendMenuItem(plugin_menu, \"About DataRefTool\", (void *)6, 1);\n\n\tXPLMEnableMenuItem(plugin_menu, 0, 1);\n\tXPLMEnableMenuItem(plugin_menu, 1, 0);\n\tXPLMEnableMenuItem(plugin_menu, 2, 1);\t\/\/sep\n\tXPLMEnableMenuItem(plugin_menu, 3, 1);\n\tXPLMEnableMenuItem(plugin_menu, 4, 1);\t\/\/sep\n\tXPLMEnableMenuItem(plugin_menu, 5, 1);\n\tXPLMEnableMenuItem(plugin_menu, 6, 1);\n\tXPLMEnableMenuItem(plugin_menu, 7, 1);\n\tXPLMEnableMenuItem(plugin_menu, 8, 1);\t\/\/sep\n\tXPLMEnableMenuItem(plugin_menu, 9, 1);\n\n\t\/\/commands\n\treload_aircraft_command = XPLMCreateCommand(\"datareftool\/reload_aircraft\", \"Reload the current aircraft\");\n\treload_plugins_command = XPLMCreateCommand(\"datareftool\/reload_plugins\", \"Reload all plugins\");\n\treload_scenery_command = XPLMCreateCommand(\"datareftool\/reload_scenery\", \"Reload the scenery\");\n\tshow_datarefs_command = XPLMCreateCommand(\"datareftool\/show_datarefs\", \"Show the dataref search window\");\n\n\tXPLMRegisterCommandHandler(reload_aircraft_command, command_handler, 0, nullptr);\n\tXPLMRegisterCommandHandler(reload_plugins_command, command_handler, 0, nullptr);\n\tXPLMRegisterCommandHandler(reload_scenery_command, command_handler, 0, nullptr);\n\tXPLMRegisterCommandHandler(show_datarefs_command, command_handler, 0, nullptr);\n\n\treturn 1;\n}\n\nPLUGIN_API void\tXPluginStop(void) {\n if(savePrefs(prefs_path)) {\n std::stringstream ss;\n ss << \"DRT: prefs saved to \" << prefs_path.native() << \"\\n\";\n XPLMDebugString(ss.str().c_str());\n }\n\t\/\/closeCommandWindows();\n\tcloseAboutWindow();\n\tcloseViewerWindows();\n\tcleanupDatarefs();\n\tXPLMUnregisterFlightLoopCallback(load_dr_callback, nullptr);\n\tXPLMUnregisterFlightLoopCallback(load_acf_dr_callback, nullptr);\n}\n\nPLUGIN_API void XPluginDisable(void) {\n}\n\nPLUGIN_API int XPluginEnable(void) {\n\treturn 1;\n}\n\nconst intptr_t MSG_ADD_DATAREF = 0x01000000;\nconst intptr_t MSG_ADD_COMMANDREF = 0x01000099;\n\nPLUGIN_API void XPluginReceiveMessage(XPLMPluginID, intptr_t inMessage, void * inParam) {\n\tswitch(inMessage) {\n\t\t\/\/ Add custom datarefs in the style of DRE:\n\t\t\/\/ http:\/\/www.xsquawkbox.net\/xpsdk\/mediawiki\/Register_Custom_DataRef_in_DRE\n\t\tcase MSG_ADD_DATAREF: {\n\t\t\tchar * dataref_name = (char *) inParam;\n\t\t\tbool added_ok = addUserDataref(dataref_name);\n\t\t\tif(added_ok) {\n\t\t\t\tupdateViewerResults();\n\t\t\t} else {\n\t\t\t\tconst std::string message = std::string(\"DRT: Couldn't load dataref from message: \") + dataref_name + std::string(\"\\n\");\n\t\t\t\tXPLMDebugString(message.c_str());\n\t\t\t}\n\t\t\tbreak;\n\t\t}\n\t\tcase MSG_ADD_COMMANDREF: {\n\t\t\tchar * commandref_name = (char *) inParam;\n\t\t\tbool added_ok = true;\/\/addUserCommandref(commandref_name);\n\t\t\tif(added_ok) {\n\t\t\t\t\/\/updateCommandWindows();\n\t\t\t} else {\n\t\t\t\tconst std::string message = std::string(\"DRT: Couldn't load commandref from message: \") + commandref_name + std::string(\"\\n\");\n\t\t\t\tXPLMDebugString(message.c_str());\n\t\t\t}\n\t\t\tbreak;\n\t\t}\n\n\t\tcase XPLM_MSG_PLANE_LOADED: {\n\t\t\tint64_t plane_num = int64_t(inParam);\n\t\t\tconst std::string message = std::string(\"DRT: Plane loaded #: \") + std::to_string(plane_num) + std::string(\"\\n\");\n\t\t\tXPLMDebugString(message.c_str());\n\t\t\tif(0 == plane_num) {\t\/\/user's plane\n\t\t\t\tXPLMRegisterFlightLoopCallback(load_acf_dr_callback, -1, nullptr);\n\t\t\t}\n\t\t\tbreak;\n\t\t}\n\n\t\tcase XPLM_MSG_WILL_WRITE_PREFS: {\n\t\t\tbreak;\n\t\t}\n\t}\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\/tools\/frame_analyzer\/video_quality_analysis.h\"\n\n#include <assert.h>\n#include <stdio.h>\n#include <stdlib.h>\n\n#include <string>\n\n#define STATS_LINE_LENGTH 32\n#define Y4M_FILE_HEADER_MAX_SIZE 200\n#define Y4M_FRAME_DELIMITER \"FRAME\"\n#define Y4M_FRAME_HEADER_SIZE 6\n\nnamespace webrtc {\nnamespace test {\n\nusing std::string;\n\nint GetI420FrameSize(int width, int height) {\n int half_width = (width + 1) >> 1;\n int half_height = (height + 1) >> 1;\n\n int y_plane = width * height; \/\/ I420 Y plane.\n int u_plane = half_width * half_height; \/\/ I420 U plane.\n int v_plane = half_width * half_height; \/\/ I420 V plane.\n\n return y_plane + u_plane + v_plane;\n}\n\nint ExtractFrameSequenceNumber(std::string line) {\n size_t space_position = line.find(' ');\n if (space_position == string::npos) {\n return -1;\n }\n std::string frame = line.substr(0, space_position);\n\n size_t underscore_position = frame.find('_');\n if (underscore_position == string::npos) {\n return -1;\n }\n std::string frame_number = frame.substr(underscore_position + 1);\n\n return strtol(frame_number.c_str(), NULL, 10);\n}\n\nint ExtractDecodedFrameNumber(std::string line) {\n size_t space_position = line.find(' ');\n if (space_position == string::npos) {\n return -1;\n }\n std::string decoded_number = line.substr(space_position + 1);\n\n return strtol(decoded_number.c_str(), NULL, 10);\n}\n\nbool IsThereBarcodeError(std::string line) {\n size_t barcode_error_position = line.find(\"Barcode error\");\n if (barcode_error_position != string::npos) {\n return true;\n }\n return false;\n}\n\nbool GetNextStatsLine(FILE* stats_file, char* line) {\n int chars = 0;\n char buf = 0;\n\n while (buf != '\\n') {\n size_t chars_read = fread(&buf, 1, 1, stats_file);\n if (chars_read != 1 || feof(stats_file)) {\n return false;\n }\n line[chars] = buf;\n ++chars;\n }\n line[chars-1] = '\\0'; \/\/ Strip the trailing \\n and put end of string.\n return true;\n}\n\nbool ExtractFrameFromYuvFile(const char* i420_file_name, int width, int height,\n int frame_number, uint8* result_frame) {\n int frame_size = GetI420FrameSize(width, height);\n int offset = frame_number * frame_size; \/\/ Calculate offset for the frame.\n bool errors = false;\n\n FILE* input_file = fopen(i420_file_name, \"rb\");\n if (input_file == NULL) {\n fprintf(stderr, \"Couldn't open input file for reading: %s\\n\",\n i420_file_name);\n return false;\n }\n\n \/\/ Change stream pointer to new offset.\n fseek(input_file, offset, SEEK_SET);\n\n size_t bytes_read = fread(result_frame, 1, frame_size, input_file);\n if (bytes_read != static_cast<size_t>(frame_size) &&\n ferror(input_file)) {\n fprintf(stdout, \"Error while reading frame no %d from file %s\\n\",\n frame_number, i420_file_name);\n errors = true;\n }\n fclose(input_file);\n return !errors;\n}\n\nbool ExtractFrameFromY4mFile(const char* y4m_file_name, int width, int height,\n int frame_number, uint8* result_frame) {\n int frame_size = GetI420FrameSize(width, height);\n int frame_offset = frame_number * frame_size\n bool errors = false;\n\n FILE* input_file = fopen(y4m_file_name, \"rb\");\n if (input_file == NULL) {\n fprintf(stderr, \"Couldn't open input file for reading: %s\\n\",\n y4m_file_name);\n return false;\n }\n\n \/\/ YUV4MPEG2, a.k.a. Y4M File format has a file header and a frame header. The\n \/\/ file header has the aspect: \"YUV4MPEG2 C420 W640 H360 Ip F30:1 A1:1\".\n \/\/ Skip the header if this is the first frame of the file.\n if (frame_number == 0) {\n char frame_header[Y4M_FILE_HEADER_MAX_SIZE];\n size_t bytes_read =\n fread(frame_header, 1, Y4M_FILE_HEADER_MAX_SIZE, input_file);\n if (bytes_read != static_cast<size_t>(frame_size) && ferror(input_file)) {\n fprintf(stdout, \"Error while reading first frame from file %s\\n\",\n y4m_file_name);\n fclose(input_file);\n return false;\n }\n std::string header_contents(frame_header);\n std::size_t found = header_contents.find(Y4M_FRAME_DELIMITER);\n if (found == std::string::npos) {\n fprintf(stdout, \"Corrupted Y4M header, could not find \\\"FRAME\\\" in %s\\n\",\n header_contents.c_str());\n fclose(input_file);\n return false;\n }\n frame_offset = static_cast<int>(found);\n }\n\n \/\/ Change stream pointer to new offset, skipping the frame header as well.\n fseek(input_file, frame_offset + Y4M_FRAME_HEADER_SIZE, SEEK_SET);\n\n size_t bytes_read = fread(result_frame, 1, frame_size, input_file);\n if (bytes_read != static_cast<size_t>(frame_size) &&\n ferror(input_file)) {\n fprintf(stdout, \"Error while reading frame no %d from file %s\\n\",\n frame_number, y4m_file_name);\n errors = true;\n }\n\n fclose(input_file);\n return !errors;\n}\n\ndouble CalculateMetrics(VideoAnalysisMetricsType video_metrics_type,\n const uint8* ref_frame, const uint8* test_frame,\n int width, int height) {\n if (!ref_frame || !test_frame)\n return -1;\n else if (height < 0 || width < 0)\n return -1;\n int half_width = (width + 1) >> 1;\n int half_height = (height + 1) >> 1;\n const uint8* src_y_a = ref_frame;\n const uint8* src_u_a = src_y_a + width * height;\n const uint8* src_v_a = src_u_a + half_width * half_height;\n const uint8* src_y_b = test_frame;\n const uint8* src_u_b = src_y_b + width * height;\n const uint8* src_v_b = src_u_b + half_width * half_height;\n\n int stride_y = width;\n int stride_uv = half_width;\n\n double result = 0.0;\n\n switch (video_metrics_type) {\n case kPSNR:\n \/\/ In the following: stride is determined by width.\n result = libyuv::I420Psnr(src_y_a, width, src_u_a, half_width,\n src_v_a, half_width, src_y_b, width,\n src_u_b, half_width, src_v_b, half_width,\n width, height);\n \/\/ LibYuv sets the max psnr value to 128, we restrict it to 48.\n \/\/ In case of 0 mse in one frame, 128 can skew the results significantly.\n result = (result > 48.0) ? 48.0 : result;\n break;\n case kSSIM:\n result = libyuv::I420Ssim(src_y_a, stride_y, src_u_a, stride_uv,\n src_v_a, stride_uv, src_y_b, stride_y,\n src_u_b, stride_uv, src_v_b, stride_uv,\n width, height);\n break;\n default:\n assert(false);\n }\n\n return result;\n}\n\nvoid RunAnalysis(const char* reference_file_name, const char* test_file_name,\n const char* stats_file_name, int width, int height,\n ResultsContainer* results) {\n \/\/ Check if the reference_file_name ends with \"y4m\".\n bool y4m_mode = false;\n if (std::string(reference_file_name).find(\"y4m\") != std::string::npos){\n y4m_mode = true;\n }\n\n int size = GetI420FrameSize(width, height);\n FILE* stats_file = fopen(stats_file_name, \"r\");\n\n \/\/ String buffer for the lines in the stats file.\n char line[STATS_LINE_LENGTH];\n\n \/\/ Allocate buffers for test and reference frames.\n uint8* test_frame = new uint8[size];\n uint8* reference_frame = new uint8[size];\n int previous_frame_number = -1;\n\n \/\/ While there are entries in the stats file.\n while (GetNextStatsLine(stats_file, line)) {\n int extracted_test_frame = ExtractFrameSequenceNumber(line);\n int decoded_frame_number = ExtractDecodedFrameNumber(line);\n\n \/\/ If there was problem decoding the barcode in this frame or the frame has\n \/\/ been duplicated, continue.\n if (IsThereBarcodeError(line) ||\n decoded_frame_number == previous_frame_number) {\n continue;\n }\n\n assert(extracted_test_frame != -1);\n assert(decoded_frame_number != -1);\n\n ExtractFrameFromYuvFile(test_file_name, width, height, extracted_test_frame,\n test_frame);\n if (y4m_mode) {\n ExtractFrameFromY4mFile(reference_file_name, width, height,\n decoded_frame_number, reference_frame);\n } else {\n ExtractFrameFromYuvFile(reference_file_name, width, height,\n decoded_frame_number, reference_frame);\n }\n\n \/\/ Calculate the PSNR and SSIM.\n double result_psnr = CalculateMetrics(kPSNR, reference_frame, test_frame,\n width, height);\n double result_ssim = CalculateMetrics(kSSIM, reference_frame, test_frame,\n width, height);\n\n previous_frame_number = decoded_frame_number;\n\n \/\/ Fill in the result struct.\n AnalysisResult result;\n result.frame_number = decoded_frame_number;\n result.psnr_value = result_psnr;\n result.ssim_value = result_ssim;\n\n results->frames.push_back(result);\n }\n\n \/\/ Cleanup.\n fclose(stats_file);\n delete[] test_frame;\n delete[] reference_frame;\n}\n\nvoid PrintMaxRepeatedAndSkippedFrames(const std::string& label,\n const std::string& stats_file_name) {\n PrintMaxRepeatedAndSkippedFrames(stdout, label, stats_file_name);\n}\n\nvoid PrintMaxRepeatedAndSkippedFrames(FILE* output, const std::string& label,\n const std::string& stats_file_name) {\n FILE* stats_file = fopen(stats_file_name.c_str(), \"r\");\n if (stats_file == NULL) {\n fprintf(stderr, \"Couldn't open stats file for reading: %s\\n\",\n stats_file_name.c_str());\n return;\n }\n char line[STATS_LINE_LENGTH];\n\n int repeated_frames = 1;\n int max_repeated_frames = 1;\n int max_skipped_frames = 1;\n int previous_frame_number = -1;\n\n while (GetNextStatsLine(stats_file, line)) {\n int decoded_frame_number = ExtractDecodedFrameNumber(line);\n\n if (decoded_frame_number == -1) {\n continue;\n }\n\n \/\/ Calculate how many frames a cluster of repeated frames contains.\n if (decoded_frame_number == previous_frame_number) {\n ++repeated_frames;\n if (repeated_frames > max_repeated_frames) {\n max_repeated_frames = repeated_frames;\n }\n } else {\n repeated_frames = 1;\n }\n\n \/\/ Calculate how much frames have been skipped.\n if (decoded_frame_number != 0 && previous_frame_number != -1) {\n int skipped_frames = decoded_frame_number - previous_frame_number - 1;\n if (skipped_frames > max_skipped_frames) {\n max_skipped_frames = skipped_frames;\n }\n }\n previous_frame_number = decoded_frame_number;\n }\n fprintf(output, \"RESULT Max_repeated: %s= %d\\n\", label.c_str(),\n max_repeated_frames);\n fprintf(output, \"RESULT Max_skipped: %s= %d\\n\", label.c_str(),\n max_skipped_frames);\n fclose(stats_file);\n}\n\nvoid PrintAnalysisResults(const std::string& label, ResultsContainer* results) {\n PrintAnalysisResults(stdout, label, results);\n}\n\nvoid PrintAnalysisResults(FILE* output, const std::string& label,\n ResultsContainer* results) {\n std::vector<AnalysisResult>::iterator iter;\n\n fprintf(output, \"RESULT Unique_frames_count: %s= %u\\n\", label.c_str(),\n static_cast<unsigned int>(results->frames.size()));\n\n if (results->frames.size() > 0u) {\n fprintf(output, \"RESULT PSNR: %s= [\", label.c_str());\n for (iter = results->frames.begin(); iter != results->frames.end() - 1;\n ++iter) {\n fprintf(output, \"%f,\", iter->psnr_value);\n }\n fprintf(output, \"%f] dB\\n\", iter->psnr_value);\n\n fprintf(output, \"RESULT SSIM: %s= [\", label.c_str());\n for (iter = results->frames.begin(); iter != results->frames.end() - 1;\n ++iter) {\n fprintf(output, \"%f,\", iter->ssim_value);\n }\n fprintf(output, \"%f]\\n\", iter->ssim_value);\n }\n}\n\n} \/\/ namespace test\n} \/\/ namespace webrtc\n<commit_msg>Add support for YUV4MPEG file reading to tools files. (Minor fix).<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\/tools\/frame_analyzer\/video_quality_analysis.h\"\n\n#include <assert.h>\n#include <stdio.h>\n#include <stdlib.h>\n\n#include <string>\n\n#define STATS_LINE_LENGTH 32\n#define Y4M_FILE_HEADER_MAX_SIZE 200\n#define Y4M_FRAME_DELIMITER \"FRAME\"\n#define Y4M_FRAME_HEADER_SIZE 6\n\nnamespace webrtc {\nnamespace test {\n\nusing std::string;\n\nint GetI420FrameSize(int width, int height) {\n int half_width = (width + 1) >> 1;\n int half_height = (height + 1) >> 1;\n\n int y_plane = width * height; \/\/ I420 Y plane.\n int u_plane = half_width * half_height; \/\/ I420 U plane.\n int v_plane = half_width * half_height; \/\/ I420 V plane.\n\n return y_plane + u_plane + v_plane;\n}\n\nint ExtractFrameSequenceNumber(std::string line) {\n size_t space_position = line.find(' ');\n if (space_position == string::npos) {\n return -1;\n }\n std::string frame = line.substr(0, space_position);\n\n size_t underscore_position = frame.find('_');\n if (underscore_position == string::npos) {\n return -1;\n }\n std::string frame_number = frame.substr(underscore_position + 1);\n\n return strtol(frame_number.c_str(), NULL, 10);\n}\n\nint ExtractDecodedFrameNumber(std::string line) {\n size_t space_position = line.find(' ');\n if (space_position == string::npos) {\n return -1;\n }\n std::string decoded_number = line.substr(space_position + 1);\n\n return strtol(decoded_number.c_str(), NULL, 10);\n}\n\nbool IsThereBarcodeError(std::string line) {\n size_t barcode_error_position = line.find(\"Barcode error\");\n if (barcode_error_position != string::npos) {\n return true;\n }\n return false;\n}\n\nbool GetNextStatsLine(FILE* stats_file, char* line) {\n int chars = 0;\n char buf = 0;\n\n while (buf != '\\n') {\n size_t chars_read = fread(&buf, 1, 1, stats_file);\n if (chars_read != 1 || feof(stats_file)) {\n return false;\n }\n line[chars] = buf;\n ++chars;\n }\n line[chars-1] = '\\0'; \/\/ Strip the trailing \\n and put end of string.\n return true;\n}\n\nbool ExtractFrameFromYuvFile(const char* i420_file_name, int width, int height,\n int frame_number, uint8* result_frame) {\n int frame_size = GetI420FrameSize(width, height);\n int offset = frame_number * frame_size; \/\/ Calculate offset for the frame.\n bool errors = false;\n\n FILE* input_file = fopen(i420_file_name, \"rb\");\n if (input_file == NULL) {\n fprintf(stderr, \"Couldn't open input file for reading: %s\\n\",\n i420_file_name);\n return false;\n }\n\n \/\/ Change stream pointer to new offset.\n fseek(input_file, offset, SEEK_SET);\n\n size_t bytes_read = fread(result_frame, 1, frame_size, input_file);\n if (bytes_read != static_cast<size_t>(frame_size) &&\n ferror(input_file)) {\n fprintf(stdout, \"Error while reading frame no %d from file %s\\n\",\n frame_number, i420_file_name);\n errors = true;\n }\n fclose(input_file);\n return !errors;\n}\n\nbool ExtractFrameFromY4mFile(const char* y4m_file_name, int width, int height,\n int frame_number, uint8* result_frame) {\n int frame_size = GetI420FrameSize(width, height);\n int frame_offset = frame_number * frame_size;\n bool errors = false;\n\n FILE* input_file = fopen(y4m_file_name, \"rb\");\n if (input_file == NULL) {\n fprintf(stderr, \"Couldn't open input file for reading: %s\\n\",\n y4m_file_name);\n return false;\n }\n\n \/\/ YUV4MPEG2, a.k.a. Y4M File format has a file header and a frame header. The\n \/\/ file header has the aspect: \"YUV4MPEG2 C420 W640 H360 Ip F30:1 A1:1\".\n \/\/ Skip the header if this is the first frame of the file.\n if (frame_number == 0) {\n char frame_header[Y4M_FILE_HEADER_MAX_SIZE];\n size_t bytes_read =\n fread(frame_header, 1, Y4M_FILE_HEADER_MAX_SIZE, input_file);\n if (bytes_read != static_cast<size_t>(frame_size) && ferror(input_file)) {\n fprintf(stdout, \"Error while reading first frame from file %s\\n\",\n y4m_file_name);\n fclose(input_file);\n return false;\n }\n std::string header_contents(frame_header);\n std::size_t found = header_contents.find(Y4M_FRAME_DELIMITER);\n if (found == std::string::npos) {\n fprintf(stdout, \"Corrupted Y4M header, could not find \\\"FRAME\\\" in %s\\n\",\n header_contents.c_str());\n fclose(input_file);\n return false;\n }\n frame_offset = static_cast<int>(found);\n }\n\n \/\/ Change stream pointer to new offset, skipping the frame header as well.\n fseek(input_file, frame_offset + Y4M_FRAME_HEADER_SIZE, SEEK_SET);\n\n size_t bytes_read = fread(result_frame, 1, frame_size, input_file);\n if (bytes_read != static_cast<size_t>(frame_size) &&\n ferror(input_file)) {\n fprintf(stdout, \"Error while reading frame no %d from file %s\\n\",\n frame_number, y4m_file_name);\n errors = true;\n }\n\n fclose(input_file);\n return !errors;\n}\n\ndouble CalculateMetrics(VideoAnalysisMetricsType video_metrics_type,\n const uint8* ref_frame, const uint8* test_frame,\n int width, int height) {\n if (!ref_frame || !test_frame)\n return -1;\n else if (height < 0 || width < 0)\n return -1;\n int half_width = (width + 1) >> 1;\n int half_height = (height + 1) >> 1;\n const uint8* src_y_a = ref_frame;\n const uint8* src_u_a = src_y_a + width * height;\n const uint8* src_v_a = src_u_a + half_width * half_height;\n const uint8* src_y_b = test_frame;\n const uint8* src_u_b = src_y_b + width * height;\n const uint8* src_v_b = src_u_b + half_width * half_height;\n\n int stride_y = width;\n int stride_uv = half_width;\n\n double result = 0.0;\n\n switch (video_metrics_type) {\n case kPSNR:\n \/\/ In the following: stride is determined by width.\n result = libyuv::I420Psnr(src_y_a, width, src_u_a, half_width,\n src_v_a, half_width, src_y_b, width,\n src_u_b, half_width, src_v_b, half_width,\n width, height);\n \/\/ LibYuv sets the max psnr value to 128, we restrict it to 48.\n \/\/ In case of 0 mse in one frame, 128 can skew the results significantly.\n result = (result > 48.0) ? 48.0 : result;\n break;\n case kSSIM:\n result = libyuv::I420Ssim(src_y_a, stride_y, src_u_a, stride_uv,\n src_v_a, stride_uv, src_y_b, stride_y,\n src_u_b, stride_uv, src_v_b, stride_uv,\n width, height);\n break;\n default:\n assert(false);\n }\n\n return result;\n}\n\nvoid RunAnalysis(const char* reference_file_name, const char* test_file_name,\n const char* stats_file_name, int width, int height,\n ResultsContainer* results) {\n \/\/ Check if the reference_file_name ends with \"y4m\".\n bool y4m_mode = false;\n if (std::string(reference_file_name).find(\"y4m\") != std::string::npos){\n y4m_mode = true;\n }\n\n int size = GetI420FrameSize(width, height);\n FILE* stats_file = fopen(stats_file_name, \"r\");\n\n \/\/ String buffer for the lines in the stats file.\n char line[STATS_LINE_LENGTH];\n\n \/\/ Allocate buffers for test and reference frames.\n uint8* test_frame = new uint8[size];\n uint8* reference_frame = new uint8[size];\n int previous_frame_number = -1;\n\n \/\/ While there are entries in the stats file.\n while (GetNextStatsLine(stats_file, line)) {\n int extracted_test_frame = ExtractFrameSequenceNumber(line);\n int decoded_frame_number = ExtractDecodedFrameNumber(line);\n\n \/\/ If there was problem decoding the barcode in this frame or the frame has\n \/\/ been duplicated, continue.\n if (IsThereBarcodeError(line) ||\n decoded_frame_number == previous_frame_number) {\n continue;\n }\n\n assert(extracted_test_frame != -1);\n assert(decoded_frame_number != -1);\n\n ExtractFrameFromYuvFile(test_file_name, width, height, extracted_test_frame,\n test_frame);\n if (y4m_mode) {\n ExtractFrameFromY4mFile(reference_file_name, width, height,\n decoded_frame_number, reference_frame);\n } else {\n ExtractFrameFromYuvFile(reference_file_name, width, height,\n decoded_frame_number, reference_frame);\n }\n\n \/\/ Calculate the PSNR and SSIM.\n double result_psnr = CalculateMetrics(kPSNR, reference_frame, test_frame,\n width, height);\n double result_ssim = CalculateMetrics(kSSIM, reference_frame, test_frame,\n width, height);\n\n previous_frame_number = decoded_frame_number;\n\n \/\/ Fill in the result struct.\n AnalysisResult result;\n result.frame_number = decoded_frame_number;\n result.psnr_value = result_psnr;\n result.ssim_value = result_ssim;\n\n results->frames.push_back(result);\n }\n\n \/\/ Cleanup.\n fclose(stats_file);\n delete[] test_frame;\n delete[] reference_frame;\n}\n\nvoid PrintMaxRepeatedAndSkippedFrames(const std::string& label,\n const std::string& stats_file_name) {\n PrintMaxRepeatedAndSkippedFrames(stdout, label, stats_file_name);\n}\n\nvoid PrintMaxRepeatedAndSkippedFrames(FILE* output, const std::string& label,\n const std::string& stats_file_name) {\n FILE* stats_file = fopen(stats_file_name.c_str(), \"r\");\n if (stats_file == NULL) {\n fprintf(stderr, \"Couldn't open stats file for reading: %s\\n\",\n stats_file_name.c_str());\n return;\n }\n char line[STATS_LINE_LENGTH];\n\n int repeated_frames = 1;\n int max_repeated_frames = 1;\n int max_skipped_frames = 1;\n int previous_frame_number = -1;\n\n while (GetNextStatsLine(stats_file, line)) {\n int decoded_frame_number = ExtractDecodedFrameNumber(line);\n\n if (decoded_frame_number == -1) {\n continue;\n }\n\n \/\/ Calculate how many frames a cluster of repeated frames contains.\n if (decoded_frame_number == previous_frame_number) {\n ++repeated_frames;\n if (repeated_frames > max_repeated_frames) {\n max_repeated_frames = repeated_frames;\n }\n } else {\n repeated_frames = 1;\n }\n\n \/\/ Calculate how much frames have been skipped.\n if (decoded_frame_number != 0 && previous_frame_number != -1) {\n int skipped_frames = decoded_frame_number - previous_frame_number - 1;\n if (skipped_frames > max_skipped_frames) {\n max_skipped_frames = skipped_frames;\n }\n }\n previous_frame_number = decoded_frame_number;\n }\n fprintf(output, \"RESULT Max_repeated: %s= %d\\n\", label.c_str(),\n max_repeated_frames);\n fprintf(output, \"RESULT Max_skipped: %s= %d\\n\", label.c_str(),\n max_skipped_frames);\n fclose(stats_file);\n}\n\nvoid PrintAnalysisResults(const std::string& label, ResultsContainer* results) {\n PrintAnalysisResults(stdout, label, results);\n}\n\nvoid PrintAnalysisResults(FILE* output, const std::string& label,\n ResultsContainer* results) {\n std::vector<AnalysisResult>::iterator iter;\n\n fprintf(output, \"RESULT Unique_frames_count: %s= %u\\n\", label.c_str(),\n static_cast<unsigned int>(results->frames.size()));\n\n if (results->frames.size() > 0u) {\n fprintf(output, \"RESULT PSNR: %s= [\", label.c_str());\n for (iter = results->frames.begin(); iter != results->frames.end() - 1;\n ++iter) {\n fprintf(output, \"%f,\", iter->psnr_value);\n }\n fprintf(output, \"%f] dB\\n\", iter->psnr_value);\n\n fprintf(output, \"RESULT SSIM: %s= [\", label.c_str());\n for (iter = results->frames.begin(); iter != results->frames.end() - 1;\n ++iter) {\n fprintf(output, \"%f,\", iter->ssim_value);\n }\n fprintf(output, \"%f]\\n\", iter->ssim_value);\n }\n}\n\n} \/\/ namespace test\n} \/\/ namespace webrtc\n<|endoftext|>"} {"text":"<commit_before>#include <stdlib.h>\n#include <new>\n\n#include \"log.h\"\n#include \"replay.h\"\n#include \"common.h\"\n#include \"error.h\"\n#include \"osd.h\"\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ コンストラクタ\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nREPLAY::REPLAY( void ) : Ini(NULL), RepST(REP_IDLE), Matrix(NULL),\n\t\t\t\t\t\t\tMSize(0), RepFrm(0), EndFrm(0) {}\n\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ デストラクタ\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nREPLAY::~REPLAY( void )\n{\n\tswitch( RepST ){\n\tcase REP_RECORD:\tStopRecord(); break;\n\tcase REP_REPLAY:\tStopReplay(); break;\n\t}\n\tif( Matrix ) delete [] Matrix;\n\tif( Ini ) delete Ini;\n}\n\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ 初期化\n\/\/\n\/\/ 引数:\tmsize\tマトリクスサイズ\n\/\/ 返値:\tbool\ttrue:成功 false:失敗\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nbool REPLAY::Init( int msize )\n{\n\tPRINTD( GRP_LOG, \"[REPLAY][Init]\\n\" );\n\t\n\tif( Ini ) delete Ini;\n\tIni = NULL;\n\t\n\tif( Matrix ) delete [] Matrix;\n\tMatrix = new BYTE[msize];\n\tif( !Matrix ) return false;\n\t\n\tRepST = REP_IDLE;\n\tMSize = msize;\n\tRepFrm = 0;\n\tEndFrm = 0;\n\t\n\treturn true;\n}\n\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ ステータス取得\n\/\/\n\/\/ 引数:\tなし\n\/\/ 返値:\tint\t\tステータス\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nint REPLAY::GetStatus( void ) const\n{\n\treturn RepST;\n}\n\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ リプレイ記録開始\n\/\/\n\/\/ 引数:\tfilename\t出力ファイル名\n\/\/ 返値:\tbool\t\ttrue:成功 false:失敗\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nbool REPLAY::StartRecord( const char *filename )\n{\n\t\/\/ とりあえずエラー設定\n\tError::SetError( Error::ReplayPlayError );\n\ttry{\n\t\tif( RepST != REP_IDLE ) throw Error::ReplayRecError;\n\t\t\n\t\tIni = new cIni();\n\t\tif( !Ini->Init( filename ) ) throw Error::ReplayRecError;\n\t}\n\tcatch( std::bad_alloc ){\t\/\/ new に失敗した場合\n\t\tError::SetError( Error::MemAllocFailed );\n\t\treturn false;\n\t}\n\tcatch( Error::Errno i ){\t\/\/ 例外発生\n\t\tError::SetError( i );\n\t\tif( Ini ) delete Ini;\n\t\tIni = NULL;\n\t\treturn false;\n\t}\n\t\n\tmemset( Matrix, 0xff, MSize );\t\t\/\/ キーマトリクスバッファクリア\n\t\n\tRepFrm = 0;\n\tRepST = REP_RECORD;\n\t\n\t\/\/ 無事だったのでエラーなし\n\tError::Reset();\n\t\n return true;\n}\n\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ リプレイ記録再開\n\/\/\n\/\/ 引数:\tfilename\t出力ファイル名\n\/\/ 引数:\tframe 途中再開するフレーム\n\/\/ 返値:\tbool\t\ttrue:成功 false:失敗\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nbool REPLAY::ResumeRecord(const char *filename, int frame)\n{\n if(!StartRecord(filename)) return false;\n char buf[16];\n sprintf(buf, \"%08lX\", frame);\n \/\/ 指定されたフレーム以降のリプレイを削除し、そこから再開\n Ini->DeleteAfter(\"REPLAY\", buf);\n\n RepFrm = frame;\n return true;\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ リプレイ記録停止\n\/\/\n\/\/ 引数:\tなし\n\/\/ 返値:\tなし\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nvoid REPLAY::StopRecord( void )\n{\n\tif( RepST != REP_RECORD ) return;\n\t\n\tif( Ini ){\n\t\tIni->PutEntry( \"REPLAY\", NULL, \"EndFrm\", \"0x%08lX\", RepFrm );\n\t\t\n\t\tIni->Write();\n\t\t\n\t\tdelete Ini;\n\t\tIni = NULL;\n\t}\n\t\n\tRepST = REP_IDLE;\n}\n\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ リプレイ1フレーム書出し\n\/\/\n\/\/ 引数:\tmt\t\tキーマトリクスポインタ\n\/\/ \t\t\tchg\t\tキーマトリクス変化 true:した false:しない\n\/\/ 返値:\tbool\ttrue:成功 false:失敗\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nbool REPLAY::ReplayWriteFrame( const BYTE *mt, bool chg )\n{\n\tchar stren[16],strva[256];\n\t\n\tif( ( RepST != REP_RECORD ) || !mt || !Ini ) return false;\n\t\n\t\/\/ マトリクスに変化があったら書出し\n\tif( chg ){\n\t\tsprintf( stren, \"%08lX \", RepFrm );\n\t\tfor( int i=0; i<MSize; i++ )\n\t\t\tsprintf( strva+i*2, \"%02X\", mt[i] );\n\t\tIni->PutEntry( \"REPLAY\", NULL, stren, \"%s\", strva );\n\t}\n\t\n\tRepFrm++;\n\t\n\treturn true;\n}\n\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ リプレイ再生開始\n\/\/\n\/\/ 引数:\tfilename\t入力ファイル名\n\/\/ 返値:\tbool\t\ttrue:成功 false:失敗\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nbool REPLAY::StartReplay( const char *filename )\n{\n\t\/\/ とりあえずエラー設定\n\tError::SetError( Error::ReplayPlayError );\n\ttry{\n\t\tint st;\t\/\/ ホントはDWORD\n\t\t\n\t\tif( RepST != REP_IDLE ) throw Error::ReplayPlayError;\n\t\t\n\t\tIni = new cIni();\n\t\tif( !Ini->Init( filename ) ) throw Error::ReplayPlayError;\n\t\t\n\t\tif( !Ini->GetInt( \"REPLAY\", \"EndFrm\", &st, EndFrm ) ) throw Error::NoReplayData;\n\t\telse EndFrm = st;\n\t}\n\tcatch( std::bad_alloc ){\t\/\/ new に失敗した場合\n\t\tError::SetError( Error::MemAllocFailed );\n\t\treturn false;\n\t}\n\tcatch( Error::Errno i ){\t\/\/ 例外発生\n\t\tError::SetError( i );\n\t\tif( Ini ) delete Ini;\n\t\tIni = NULL;\n\t\treturn false;\n\t}\n\t\n\tmemset( Matrix, 0xff, MSize );\t\/\/ キーマトリクスバッファクリア\n\t\n\tRepFrm = 1;\n\tRepST = REP_REPLAY;\n\t\n\t\/\/ 無事だったのでエラーなし\n\tError::Reset();\n\t\n\treturn true;\n}\n\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ リプレイ再生停止\n\/\/\n\/\/ 引数:\tなし\n\/\/ 返値:\tなし\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nvoid REPLAY::StopReplay( void )\n{\n\tif( RepST != REP_REPLAY ) return;\n\t\n\tif( Ini ){\n\t\tdelete Ini;\n\t\tIni = NULL;\n\t}\n\t\n\tRepST = REP_IDLE;\n}\n\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ リプレイ1フレーム読込み\n\/\/\n\/\/ 引数:\tmt\t\tキーマトリクスポインタ\n\/\/ 返値:\tbool\ttrue:成功 false:失敗\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nbool REPLAY::ReplayReadFrame( BYTE *mt )\n{\n\tchar stren[16],strva[256];\n\t\n\tif( ( RepST != REP_REPLAY ) || !mt || !Ini ) return false;\n\t\n\tsprintf( stren, \"%08lX\", RepFrm );\n\tif( Ini->GetString( \"REPLAY\", stren, strva, \"\" ) ){\n\t\tint stl = strlen( strva ) \/ 2;\n\t\tfor( int i=0; i<stl; i++ ){\n\t\t\tchar dt[3] = \"FF\";\n\t\t\tstrncpy( dt, &strva[i*2], 2 );\n\t\t\tMatrix[i] = strtol( dt, NULL, 16 );\n\t\t}\n\t\tmemcpy( mt, Matrix, MSize );\n\t}\n\t\n\tif( ++RepFrm >= EndFrm ){\n\t\t\/\/ データ終端に達したらリプレイ終了\n\t\tStopReplay();\n\t}\n\t\n\treturn true;\n}\n<commit_msg>変化があったフレームだけでなく全フレームリプレイに書きだすようにした。<commit_after>#include <stdlib.h>\n#include <new>\n\n#include \"log.h\"\n#include \"replay.h\"\n#include \"common.h\"\n#include \"error.h\"\n#include \"osd.h\"\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ コンストラクタ\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nREPLAY::REPLAY( void ) : Ini(NULL), RepST(REP_IDLE), Matrix(NULL),\n\t\t\t\t\t\t\tMSize(0), RepFrm(0), EndFrm(0) {}\n\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ デストラクタ\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nREPLAY::~REPLAY( void )\n{\n\tswitch( RepST ){\n\tcase REP_RECORD:\tStopRecord(); break;\n\tcase REP_REPLAY:\tStopReplay(); break;\n\t}\n\tif( Matrix ) delete [] Matrix;\n\tif( Ini ) delete Ini;\n}\n\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ 初期化\n\/\/\n\/\/ 引数:\tmsize\tマトリクスサイズ\n\/\/ 返値:\tbool\ttrue:成功 false:失敗\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nbool REPLAY::Init( int msize )\n{\n\tPRINTD( GRP_LOG, \"[REPLAY][Init]\\n\" );\n\t\n\tif( Ini ) delete Ini;\n\tIni = NULL;\n\t\n\tif( Matrix ) delete [] Matrix;\n\tMatrix = new BYTE[msize];\n\tif( !Matrix ) return false;\n\t\n\tRepST = REP_IDLE;\n\tMSize = msize;\n\tRepFrm = 0;\n\tEndFrm = 0;\n\t\n\treturn true;\n}\n\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ ステータス取得\n\/\/\n\/\/ 引数:\tなし\n\/\/ 返値:\tint\t\tステータス\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nint REPLAY::GetStatus( void ) const\n{\n\treturn RepST;\n}\n\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ リプレイ記録開始\n\/\/\n\/\/ 引数:\tfilename\t出力ファイル名\n\/\/ 返値:\tbool\t\ttrue:成功 false:失敗\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nbool REPLAY::StartRecord( const char *filename )\n{\n\t\/\/ とりあえずエラー設定\n\tError::SetError( Error::ReplayPlayError );\n\ttry{\n\t\tif( RepST != REP_IDLE ) throw Error::ReplayRecError;\n\t\t\n\t\tIni = new cIni();\n\t\tif( !Ini->Init( filename ) ) throw Error::ReplayRecError;\n\t}\n\tcatch( std::bad_alloc ){\t\/\/ new に失敗した場合\n\t\tError::SetError( Error::MemAllocFailed );\n\t\treturn false;\n\t}\n\tcatch( Error::Errno i ){\t\/\/ 例外発生\n\t\tError::SetError( i );\n\t\tif( Ini ) delete Ini;\n\t\tIni = NULL;\n\t\treturn false;\n\t}\n\t\n\tmemset( Matrix, 0xff, MSize );\t\t\/\/ キーマトリクスバッファクリア\n\t\n\tRepFrm = 0;\n\tRepST = REP_RECORD;\n\t\n\t\/\/ 無事だったのでエラーなし\n\tError::Reset();\n\t\n return true;\n}\n\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ リプレイ記録再開\n\/\/\n\/\/ 引数:\tfilename\t出力ファイル名\n\/\/ 引数:\tframe 途中再開するフレーム\n\/\/ 返値:\tbool\t\ttrue:成功 false:失敗\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nbool REPLAY::ResumeRecord(const char *filename, int frame)\n{\n if(!StartRecord(filename)) return false;\n char buf[16];\n sprintf(buf, \"%08lX\", frame);\n \/\/ 指定されたフレーム以降のリプレイを削除し、そこから再開\n Ini->DeleteAfter(\"REPLAY\", buf);\n\n RepFrm = frame;\n return true;\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ リプレイ記録停止\n\/\/\n\/\/ 引数:\tなし\n\/\/ 返値:\tなし\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nvoid REPLAY::StopRecord( void )\n{\n\tif( RepST != REP_RECORD ) return;\n\t\n\tif( Ini ){\n\t\tIni->PutEntry( \"REPLAY\", NULL, \"EndFrm\", \"0x%08lX\", RepFrm );\n\t\t\n\t\tIni->Write();\n\t\t\n\t\tdelete Ini;\n\t\tIni = NULL;\n\t}\n\t\n\tRepST = REP_IDLE;\n}\n\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ リプレイ1フレーム書出し\n\/\/\n\/\/ 引数:\tmt\t\tキーマトリクスポインタ\n\/\/ \t\t\tchg\t\tキーマトリクス変化 true:した false:しない\n\/\/ 返値:\tbool\ttrue:成功 false:失敗\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nbool REPLAY::ReplayWriteFrame( const BYTE *mt, bool chg )\n{\n\tchar stren[16],strva[256];\n\t\n\tif( ( RepST != REP_RECORD ) || !mt || !Ini ) return false;\n\t\n\t\/\/ マトリクスに変化があったら書出し\n if( 1\/*chg*\/ ){\n\t\tsprintf( stren, \"%08lX \", RepFrm );\n\t\tfor( int i=0; i<MSize; i++ )\n\t\t\tsprintf( strva+i*2, \"%02X\", mt[i] );\n\t\tIni->PutEntry( \"REPLAY\", NULL, stren, \"%s\", strva );\n\t}\n\t\n\tRepFrm++;\n\t\n\treturn true;\n}\n\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ リプレイ再生開始\n\/\/\n\/\/ 引数:\tfilename\t入力ファイル名\n\/\/ 返値:\tbool\t\ttrue:成功 false:失敗\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nbool REPLAY::StartReplay( const char *filename )\n{\n\t\/\/ とりあえずエラー設定\n\tError::SetError( Error::ReplayPlayError );\n\ttry{\n\t\tint st;\t\/\/ ホントはDWORD\n\t\t\n\t\tif( RepST != REP_IDLE ) throw Error::ReplayPlayError;\n\t\t\n\t\tIni = new cIni();\n\t\tif( !Ini->Init( filename ) ) throw Error::ReplayPlayError;\n\t\t\n\t\tif( !Ini->GetInt( \"REPLAY\", \"EndFrm\", &st, EndFrm ) ) throw Error::NoReplayData;\n\t\telse EndFrm = st;\n\t}\n\tcatch( std::bad_alloc ){\t\/\/ new に失敗した場合\n\t\tError::SetError( Error::MemAllocFailed );\n\t\treturn false;\n\t}\n\tcatch( Error::Errno i ){\t\/\/ 例外発生\n\t\tError::SetError( i );\n\t\tif( Ini ) delete Ini;\n\t\tIni = NULL;\n\t\treturn false;\n\t}\n\t\n\tmemset( Matrix, 0xff, MSize );\t\/\/ キーマトリクスバッファクリア\n\t\n\tRepFrm = 1;\n\tRepST = REP_REPLAY;\n\t\n\t\/\/ 無事だったのでエラーなし\n\tError::Reset();\n\t\n\treturn true;\n}\n\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ リプレイ再生停止\n\/\/\n\/\/ 引数:\tなし\n\/\/ 返値:\tなし\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nvoid REPLAY::StopReplay( void )\n{\n\tif( RepST != REP_REPLAY ) return;\n\t\n\tif( Ini ){\n\t\tdelete Ini;\n\t\tIni = NULL;\n\t}\n\t\n\tRepST = REP_IDLE;\n}\n\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ リプレイ1フレーム読込み\n\/\/\n\/\/ 引数:\tmt\t\tキーマトリクスポインタ\n\/\/ 返値:\tbool\ttrue:成功 false:失敗\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nbool REPLAY::ReplayReadFrame( BYTE *mt )\n{\n\tchar stren[16],strva[256];\n\t\n\tif( ( RepST != REP_REPLAY ) || !mt || !Ini ) return false;\n\t\n\tsprintf( stren, \"%08lX\", RepFrm );\n\tif( Ini->GetString( \"REPLAY\", stren, strva, \"\" ) ){\n\t\tint stl = strlen( strva ) \/ 2;\n\t\tfor( int i=0; i<stl; i++ ){\n\t\t\tchar dt[3] = \"FF\";\n\t\t\tstrncpy( dt, &strva[i*2], 2 );\n\t\t\tMatrix[i] = strtol( dt, NULL, 16 );\n\t\t}\n\t\tmemcpy( mt, Matrix, MSize );\n\t}\n\t\n\tif( ++RepFrm >= EndFrm ){\n\t\t\/\/ データ終端に達したらリプレイ終了\n\t\tStopReplay();\n\t}\n\t\n\treturn true;\n}\n<|endoftext|>"} {"text":"<commit_before>#ifndef __sitksimpletransformix_hxx_\n#define __sitksimpletransformix_hxx_\n\n#include \"sitkSimpleTransformix.h\"\n \nnamespace itk {\n namespace simple {\n\ntemplate< typename TInputImage >\nImage\nSimpleTransformix::ExecuteInternal( void )\n{\n typedef elastix::TransformixFilter< TInputImage > TransformixFilterType;\n typedef typename TransformixFilterType::Pointer TransforimxFilterPointer;\n\n try\n {\n TransforimxFilterPointer transformixFilter = TransformixFilterType::New();\n\n if( !this->IsEmpty( this->m_InputImage ) ) {\n transformixFilter->SetInputImage( static_cast< TInputImage * >( this->GetInputImage().GetITKBase() ) );\n }\n\n transformixFilter->SetInputPointSetFileName( this->GetInputPointSetFileName() );\n transformixFilter->SetComputeSpatialJacobian( this->GetComputeSpatialJacobian() );\n transformixFilter->SetComputeDeterminantOfSpatialJacobian( this->GetComputeDeterminantOfSpatialJacobian() );\n transformixFilter->SetComputeDeformationField( this->GetComputeDeformationField() );\n\n transformixFilter->SetOutputDirectory( this->GetOutputDirectory() );\n transformixFilter->SetLogFileName( this->GetLogFileName() );\n transformixFilter->SetLogToFile( this->GetLogToFile() );\n transformixFilter->SetLogToConsole( this->GetLogToConsole() );\n\n ParameterObjectPointer parameterObject = ParameterObjectType::New();\n parameterObject->SetParameterMap( this->m_TransformParameterMapVector );\n transformixFilter->SetTransformParameterObject( parameterObject );\n\n transformixFilter->Update();\n\n if( !this->IsEmpty( this->m_InputImage ) )\n {\n this->m_ResultImage = Image( transformixFilter->GetOutput() );\n }\n }\n catch( itk::ExceptionObject &e )\n {\n sitkExceptionMacro( << e );\n }\n\n \/\/ Make a deep copy. This is important to prevent the internal data object trying to update its\n \/\/ source (this elastixFilter) outside this function (where it has gone out of scope and been destroyed).\n \/\/ TODO: We should be able to simply call DisconnectPipeline() on the ITK output image but this does not seem to work\n this->m_ResultImage.MakeUnique();\n\n return this->m_ResultImage;\n}\n\n\n} \/\/ end namespace simple\n} \/\/ end namespace itk\n\n#endif \/\/ __sitksimpletransformix_hxx_\n<commit_msg>ENH: Only make result image unique if it is used<commit_after>#ifndef __sitksimpletransformix_hxx_\n#define __sitksimpletransformix_hxx_\n\n#include \"sitkSimpleTransformix.h\"\n \nnamespace itk {\n namespace simple {\n\ntemplate< typename TInputImage >\nImage\nSimpleTransformix::ExecuteInternal( void )\n{\n typedef elastix::TransformixFilter< TInputImage > TransformixFilterType;\n typedef typename TransformixFilterType::Pointer TransforimxFilterPointer;\n\n try\n {\n TransforimxFilterPointer transformixFilter = TransformixFilterType::New();\n\n if( !this->IsEmpty( this->m_InputImage ) ) {\n transformixFilter->SetInputImage( static_cast< TInputImage* >( this->GetInputImage().GetITKBase() ) );\n }\n\n transformixFilter->SetInputPointSetFileName( this->GetInputPointSetFileName() );\n transformixFilter->SetComputeSpatialJacobian( this->GetComputeSpatialJacobian() );\n transformixFilter->SetComputeDeterminantOfSpatialJacobian( this->GetComputeDeterminantOfSpatialJacobian() );\n transformixFilter->SetComputeDeformationField( this->GetComputeDeformationField() );\n\n transformixFilter->SetOutputDirectory( this->GetOutputDirectory() );\n transformixFilter->SetLogFileName( this->GetLogFileName() );\n transformixFilter->SetLogToFile( this->GetLogToFile() );\n transformixFilter->SetLogToConsole( this->GetLogToConsole() );\n\n ParameterObjectPointer parameterObject = ParameterObjectType::New();\n parameterObject->SetParameterMap( this->m_TransformParameterMapVector );\n transformixFilter->SetTransformParameterObject( parameterObject );\n\n transformixFilter->Update();\n\n if( !this->IsEmpty( this->m_InputImage ) )\n {\n this->m_ResultImage = Image( transformixFilter->GetOutput() );\n\n \/\/ Make a deep copy. This is important to prevent the internal data object trying to update its\n \/\/ source (this transformixFilter) outside this function (where it has gone out of scope and been destroyed).\n \/\/ TODO: We should be able to simply call DisconnectPipeline() on the ITK output image but this does not seem to work\n this->m_ResultImage.MakeUnique();\n }\n }\n catch( itk::ExceptionObject &e )\n {\n sitkExceptionMacro( << e );\n }\n\n return this->m_ResultImage;\n}\n\n} \/\/ end namespace simple\n} \/\/ end namespace itk\n\n#endif \/\/ __sitksimpletransformix_hxx_\n<|endoftext|>"} {"text":"<commit_before>\/**\n * Identify Majority Element in an Array\n * An element which apprears atmost n\/2 times in an array\n * is known as Majority Element\n *\n * I\/P: 3 2 2 3 2 2 2 2\n * O\/P: 2\n *\n * I\/P: 3 3 2 2 4 4\n * O\/P: None\n *\/\n#include <iostream>\n#include <string.h>\nusing namespace std;\n\nvoid findMajorityElement(int A[], int size) {\n int *count = new int[size];\n if (!count) return;\n memset(count, 0, sizeof(count));\n\n for (int i = 0; i < size; i++)\n count[A[i]]++;\n int majority = size\/2;\n\n bool found = false;\n for (int i = 0; i < size; i++) {\n if (count[i] >= majority) {\n cout<<\"Majority element: \"<<i<<endl;\n found = true;\n break;\n }\n }\n if (!found)\n cout<<\"Majority Element: None\"<<endl;\n delete [] count;\n}\n\nvoid printArray(int A[], int size) {\n for (int i = 0; i < size; i++)\n cout<<A[i]<<\" \";\n cout<<endl;\n}\n\nint main() {\n int A[] = {3, 2, 2, 4, 2, 2, 3, 2, 2, 3, 3, 3, 3, 3};\n int size = sizeof(A)\/sizeof(A[0]);\n\n printArray(A, size);\n findMajorityElement(A, size);\n\n int B[] = {3, 3, 2, 2, 4, 4};\n size = sizeof(B)\/sizeof(B[0]);\n printArray(B, size);\n findMajorityElement(B, size);\n\n return 0;\n}\n<commit_msg>Implement Boyer Moore Linear Time Voting Algorithm<commit_after>\/**\n * Identify Majority Element in an Array\n * An element which apprears atmost n\/2 times in an array\n * is known as Majority Element\n *\n * I\/P: 3 2 2 3 2 2 2 2\n * O\/P: 2\n *\n * I\/P: 3 3 2 2 4 4\n * O\/P: None\n *\/\n#include <iostream>\n#include <string.h>\nusing namespace std;\n\nvoid printArray(int A[], int size) {\n for (int i = 0; i < size; i++)\n cout<<A[i]<<\" \";\n cout<<endl;\n}\n\nvoid findMajorityElement(int A[], int size) {\n int *count = new int[size];\n if (!count) return;\n memset(count, 0, sizeof(count));\n\n for (int i = 0; i < size; i++)\n count[A[i]]++;\n int majority = size\/2;\n\n bool found = false;\n for (int i = 0; i < size; i++) {\n if (count[i] >= majority) {\n cout<<\"Majority element: \"<<i<<endl;\n found = true;\n break;\n }\n }\n if (!found)\n cout<<\"Majority Element: None\"<<endl;\n delete [] count;\n}\n\n\n\/**\n * http:\/\/www.cs.utexas.edu\/~moore\/best-ideas\/mjrty\/index.html\n * T(n) = O(n)\n * S(n) = O(1)\n *\/\nvoid boyermoore_voting_algorithm(int A[], int size) {\n \/\/ find candidate\n int cand = 0, count = 1, maj_index = 0;\n for (int i = 1; i < size; i++) {\n \/\/ sweep and change the current candidate and counter\n \/\/ initally if counter = 0 current candidate is e and counter = 1\n if (A[maj_index] == A[i]) count++;\n else count--; \n \/\/ if counter is non zero, if e is current candidate increment\n \/\/ else decrement\n if (count == 0) {\n maj_index = i;\n count = 1;\n }\n }\n cand = A[maj_index];\n \/\/ check if the candidate is majority\n count = 0;\n for (int i = 0; i < size; i++) {\n if (A[i] == cand)\n count++;\n }\n if (count >= size\/2) {\n cout<<\"Majority element: \"<<cand<<endl;\n } else {\n cout<<\"Majority element: None\"<<endl;\n }\n\n}\n\nint main() {\n int A[] = {3, 2, 2, 4, 2, 2, 3, 2, 2, 3, 3, 3, 3, 3};\n int size = sizeof(A)\/sizeof(A[0]);\n\n printArray(A, size);\n \/\/findMajorityElement(A, size);\n boyermoore_voting_algorithm(A, size);\n\n int B[] = {3, 3, 2, 2, 4, 4};\n size = sizeof(B)\/sizeof(B[0]);\n printArray(B, size);\n \/\/findMajorityElement(B, size);\n boyermoore_voting_algorithm(B, size);\n\n return 0;\n}\n<|endoftext|>"} {"text":"<commit_before>#include \"MetaFile.h\"\r\n\r\n#include \"..\/..\/graphics\/GraphicsRenderer.h\"\r\n#include \"..\/..\/raster\/BgraFrame.h\"\r\n\r\n#include \"Emf\/RendererOutput.h\"\r\n#ifndef NEW_WMF\r\n#include \"Wmf\/RendererOutput.h\"\r\n#endif\r\n\r\nnamespace MetaFile\r\n{\r\n\tCMetaFile::CMetaFile(CApplicationFonts *pAppFonts)\r\n\t{\r\n\t\tm_pAppFonts = pAppFonts;\r\n\r\n\t\t\/\/ \r\n\t\tm_pFontManager = pAppFonts->GenerateFontManager();\r\n\t\tCFontsCache* pMeasurerCache = new CFontsCache();\r\n\t\tpMeasurerCache->SetStreams(pAppFonts->GetStreams());\r\n\t\tm_pFontManager->SetOwnerCache(pMeasurerCache);\r\n\t\tm_oWmfFile.SetFontManager(m_pFontManager);\r\n\t\tm_oEmfFile.SetFontManager(m_pFontManager);\r\n\r\n\t\tm_lType = 0;\r\n\t}\r\n\tCMetaFile::~CMetaFile()\r\n\t{\r\n\t\tClose();\r\n\t\tRELEASEINTERFACE(m_pFontManager);\r\n\t}\r\n\tCFontManager* CMetaFile::get_FontManager()\r\n\t{\r\n\t\treturn m_pFontManager;\r\n\t}\r\n\tbool CMetaFile::LoadFromFile(const wchar_t *wsFilePath)\r\n\t{\r\n\t\t\/\/ Wmf\r\n\t\tm_oWmfFile.OpenFromFile(wsFilePath);\r\n\r\n#ifdef NEW_WMF\r\n\t\tm_oWmfFile.Scan();\r\n#else\r\n\t\tm_oWmfFile.Scan(&m_oWmfRect);\r\n#endif\r\n\r\n\t\tif (!m_oWmfFile.CheckError())\r\n\t\t{\r\n\t\t\tm_lType = c_lMetaWmf;\r\n\t\t\treturn true;\r\n\t\t}\r\n\r\n\t\t\/\/ Wmf, Emf\r\n\t\tm_oWmfFile.Close();\r\n\r\n\t\tm_oEmfFile.OpenFromFile(wsFilePath);\r\n\t\tm_oEmfFile.Scan();\r\n\r\n\t\tif (!m_oEmfFile.CheckError())\r\n\t\t{\r\n\t\t\tm_lType = c_lMetaEmf;\r\n\t\t\treturn true;\r\n\t\t}\r\n\r\n\t\t\/\/ Emf\r\n\t\tm_oEmfFile.Close();\r\n\r\n\t\treturn false;\r\n\t};\r\n\tbool CMetaFile::DrawOnRenderer(IRenderer* pRenderer, double dX, double dY, double dWidth, double dHeight)\r\n\t{\r\n\t\tif (NULL == pRenderer)\r\n\t\t\treturn false;\r\n\r\n\t\tpRenderer->BeginCommand(c_nImageType);\r\n\r\n\t\tif (c_lMetaWmf == m_lType)\r\n\t\t{\r\n#ifdef NEW_WMF\r\n#else\r\n\t\t\tdouble dRendererDpix, dRendererDpiY;\r\n\t\t\tpRenderer->get_DpiX(&dRendererDpix);\r\n\t\t\tpRenderer->get_DpiY(&dRendererDpiY);\r\n\r\n\t\t\tCRendererOutput oWmfOut(&m_oWmfFile, pRenderer, dX, dY, dWidth, dHeight);\r\n\r\n\t\t\tdouble fSrcWidth, fSrcHeight;\r\n\r\n\t\t\tfloat fW, fH;\r\n\t\t\tm_oWmfFile.GetSize(&fW, &fH);\r\n\t\t\tm_oWmfFile.GetDisplaySize(&fSrcWidth, &fSrcHeight, dRendererDpix, dRendererDpiY);\r\n\r\n\t\t\t\/\/m_oWmfFile.GetDisplaySize( &fSrcWidth, &fSrcHeight, 25.4, 25.4 );\r\n\t\t\tTWmfRectF oRectB = m_oWmfFile.GetBounds();\r\n\r\n\t\t\t\/\/double dW = m_oRect.oBR.fX - m_oRect.oTL.fX;\r\n\t\t\t\/\/double dH = m_oRect.oBR.fY - m_oRect.oTL.fY;\r\n\t\t\tdouble dW = oRectB.oBR.fX - oRectB.oTL.fX;\r\n\t\t\tdouble dH = oRectB.oBR.fY - oRectB.oTL.fY;\r\n\r\n\t\t\tdouble dScaleX = dWidth \/ dW;\/\/fSrcWidth;\r\n\t\t\tdouble dScaleY = dHeight \/ dH;\/\/fSrcHeight;\r\n\t\t\t\/\/double dScaleX = dWidth \/ fSrcWidth;\r\n\t\t\t\/\/double dScaleY = dHeight \/ fSrcHeight;\r\n\r\n\t\t\tdouble dSrcDpiX, dSrcDpiY;\r\n\t\t\tm_oWmfFile.GetDpi(&dSrcDpiX, &dSrcDpiY);\r\n\r\n\t\t\tdouble dDpiKoefX = dRendererDpix \/ dSrcDpiX;\r\n\t\t\tdouble dDpiKoefY = dRendererDpiY \/ dSrcDpiY;\r\n\r\n\t\t\tdouble dDpi = dSrcDpiY * fSrcHeight \/ fH;\r\n\t\t\toWmfOut.SetDpi(dRendererDpix, dDpi);\r\n\t\t\toWmfOut.SetWmfRect(oRectB);\r\n\t\t\toWmfOut.SetScales(dScaleX, dScaleY);\r\n\r\n\t\t\tm_oWmfFile.SetOutputDevice(&oWmfOut);\r\n\r\n\t\t\tTWmfRectF oRect;\r\n\t\t\tm_oWmfFile.Play(&oRect);\r\n#endif\r\n\t\t}\r\n\t\telse if (c_lMetaEmf == m_lType)\r\n\t\t{\r\n\t\t\tCEmfRendererOutput oEmfOut(&m_oEmfFile, pRenderer, dX, dY, dWidth, dHeight);\r\n\t\t\tm_oEmfFile.SetOutputDevice(&oEmfOut);\r\n\t\t\tm_oEmfFile.PlayMetaFile();\r\n\t\t}\r\n\r\n\t\tpRenderer->EndCommand(c_nImageType);\r\n\t\treturn true;\r\n\t};\r\n\tvoid CMetaFile::Close()\r\n\t{\r\n\t\tm_oWmfFile.Close();\r\n\t\t\/\/m_oEmfFile.Close();\r\n\r\n\t\tm_lType = 0;\r\n\t};\r\n\tint CMetaFile::GetType()\r\n\t{\r\n\t\treturn m_lType;\r\n\t}\r\n\tvoid CMetaFile::GetBounds(double* pdX, double* pdY, double* pdW, double* pdH)\r\n\t{\r\n\t\tif (c_lMetaWmf == m_lType)\r\n\t\t{\r\n\t\t\t*pdX = m_oWmfRect.oTL.fX;\r\n\t\t\t*pdY = m_oWmfRect.oTL.fY;\r\n\t\t\t*pdW = m_oWmfRect.oBR.fX - m_oWmfRect.oTL.fX;\r\n\t\t\t*pdH = m_oWmfRect.oBR.fY - m_oWmfRect.oTL.fY;\r\n\t\t}\r\n\t\telse if (c_lMetaEmf == m_lType)\r\n\t\t{\r\n\t\t\tTEmfRectL* pRect = m_oEmfFile.GetBounds();\r\n\t\t\t*pdX = pRect->lLeft;\r\n\t\t\t*pdY = pRect->lTop;\r\n\t\t\t*pdW = pRect->lRight - pRect->lLeft;\r\n\t\t\t*pdH = pRect->lBottom - pRect->lTop;\r\n\t\t}\r\n\t\telse\r\n\t\t{\r\n\t\t\t*pdX = 0;\r\n\t\t\t*pdY = 0;\r\n\t\t\t*pdW = 0;\r\n\t\t\t*pdH = 0;\r\n\t\t}\r\n\t};\r\n\tvoid CMetaFile::ConvertToRaster(const wchar_t* wsOutFilePath, unsigned int unFileType, int nWidth, int nHeight)\r\n\t{\r\n\t\tCFontManager *pFontManager = m_pAppFonts->GenerateFontManager();\r\n\t\tCFontsCache* pFontCache = new CFontsCache();\r\n\t\tpFontCache->SetStreams(m_pAppFonts->GetStreams());\r\n\t\tpFontManager->SetOwnerCache(pFontCache);\r\n\t\tCImageFilesCache oCache;\r\n\r\n\t\tCGraphicsRenderer oRenderer;\r\n\t\toRenderer.SetSwapRGB(false);\r\n\t\toRenderer.SetFontManager(pFontManager);\r\n\t\toRenderer.SetImageCache(&oCache);\r\n\r\n\t\tif (-1 == nHeight)\r\n\t\t{\r\n\t\t\tdouble dX, dY, dW, dH;\r\n\t\t\tGetBounds(&dX, &dY, &dW, &dH);\r\n\t\t\tnHeight = (int)((double)nWidth * dH \/ dW);\r\n\t\t}\r\n\r\n\t\t\/\/double dDpiX, dDpiY;\r\n\t\t\/\/oRenderer.get_DpiX(&dDpiX);\r\n\t\t\/\/oRenderer.get_DpiX(&dDpiY);\r\n\r\n\t\tdouble dWidth = nWidth ;\/\/* 72 \/ 25.4 \/ dDpiX;\r\n\t\tdouble dHeight = nHeight ;\/\/* 72 \/ 25.4 \/ dDpiY;\r\n\r\n\t\tBYTE* pBgraData = new BYTE[nWidth * nHeight * 4];\r\n\t\tCBgraFrame oFrame;\r\n\t\toFrame.put_Data(pBgraData);\r\n\t\toFrame.put_Width(nWidth);\r\n\t\toFrame.put_Height(nHeight);\r\n\t\toFrame.put_Stride(-4 * nWidth);\r\n\r\n\t\toRenderer.CreateFromBgraFrame(&oFrame);\r\n\t\toRenderer.put_Width(dWidth);\r\n\t\toRenderer.put_Height(dHeight);\r\n\r\n\t\tDrawOnRenderer(&oRenderer, 0, 0, dWidth, dHeight);\r\n\r\n\t\toFrame.SaveFile(wsOutFilePath, unFileType);\r\n\t\tRELEASEINTERFACE(pFontManager);\r\n\t}\r\n}\r\n<commit_msg>SwapRGB перенесен в правильное место.<commit_after>#include \"MetaFile.h\"\r\n\r\n#include \"..\/..\/graphics\/GraphicsRenderer.h\"\r\n#include \"..\/..\/raster\/BgraFrame.h\"\r\n\r\n#include \"Emf\/RendererOutput.h\"\r\n#ifndef NEW_WMF\r\n#include \"Wmf\/RendererOutput.h\"\r\n#endif\r\n\r\nnamespace MetaFile\r\n{\r\n\tCMetaFile::CMetaFile(CApplicationFonts *pAppFonts)\r\n\t{\r\n\t\tm_pAppFonts = pAppFonts;\r\n\r\n\t\t\/\/ \r\n\t\tm_pFontManager = pAppFonts->GenerateFontManager();\r\n\t\tCFontsCache* pMeasurerCache = new CFontsCache();\r\n\t\tpMeasurerCache->SetStreams(pAppFonts->GetStreams());\r\n\t\tm_pFontManager->SetOwnerCache(pMeasurerCache);\r\n\t\tm_oWmfFile.SetFontManager(m_pFontManager);\r\n\t\tm_oEmfFile.SetFontManager(m_pFontManager);\r\n\r\n\t\tm_lType = 0;\r\n\t}\r\n\tCMetaFile::~CMetaFile()\r\n\t{\r\n\t\tClose();\r\n\t\tRELEASEINTERFACE(m_pFontManager);\r\n\t}\r\n\tCFontManager* CMetaFile::get_FontManager()\r\n\t{\r\n\t\treturn m_pFontManager;\r\n\t}\r\n\tbool CMetaFile::LoadFromFile(const wchar_t *wsFilePath)\r\n\t{\r\n\t\t\/\/ Wmf\r\n\t\tm_oWmfFile.OpenFromFile(wsFilePath);\r\n\r\n#ifdef NEW_WMF\r\n\t\tm_oWmfFile.Scan();\r\n#else\r\n\t\tm_oWmfFile.Scan(&m_oWmfRect);\r\n#endif\r\n\r\n\t\tif (!m_oWmfFile.CheckError())\r\n\t\t{\r\n\t\t\tm_lType = c_lMetaWmf;\r\n\t\t\treturn true;\r\n\t\t}\r\n\r\n\t\t\/\/ Wmf, Emf\r\n\t\tm_oWmfFile.Close();\r\n\r\n\t\tm_oEmfFile.OpenFromFile(wsFilePath);\r\n\t\tm_oEmfFile.Scan();\r\n\r\n\t\tif (!m_oEmfFile.CheckError())\r\n\t\t{\r\n\t\t\tm_lType = c_lMetaEmf;\r\n\t\t\treturn true;\r\n\t\t}\r\n\r\n\t\t\/\/ Emf\r\n\t\tm_oEmfFile.Close();\r\n\r\n\t\treturn false;\r\n\t};\r\n\tbool CMetaFile::DrawOnRenderer(IRenderer* pRenderer, double dX, double dY, double dWidth, double dHeight)\r\n\t{\r\n\t\tif (NULL == pRenderer)\r\n\t\t\treturn false;\r\n\r\n\t\tpRenderer->BeginCommand(c_nImageType);\r\n\r\n\t\tif (c_lMetaWmf == m_lType)\r\n\t\t{\r\n#ifdef NEW_WMF\r\n#else\r\n\t\t\tdouble dRendererDpix, dRendererDpiY;\r\n\t\t\tpRenderer->get_DpiX(&dRendererDpix);\r\n\t\t\tpRenderer->get_DpiY(&dRendererDpiY);\r\n\r\n\t\t\tCRendererOutput oWmfOut(&m_oWmfFile, pRenderer, dX, dY, dWidth, dHeight);\r\n\r\n\t\t\tdouble fSrcWidth, fSrcHeight;\r\n\r\n\t\t\tfloat fW, fH;\r\n\t\t\tm_oWmfFile.GetSize(&fW, &fH);\r\n\t\t\tm_oWmfFile.GetDisplaySize(&fSrcWidth, &fSrcHeight, dRendererDpix, dRendererDpiY);\r\n\r\n\t\t\t\/\/m_oWmfFile.GetDisplaySize( &fSrcWidth, &fSrcHeight, 25.4, 25.4 );\r\n\t\t\tTWmfRectF oRectB = m_oWmfFile.GetBounds();\r\n\r\n\t\t\t\/\/double dW = m_oRect.oBR.fX - m_oRect.oTL.fX;\r\n\t\t\t\/\/double dH = m_oRect.oBR.fY - m_oRect.oTL.fY;\r\n\t\t\tdouble dW = oRectB.oBR.fX - oRectB.oTL.fX;\r\n\t\t\tdouble dH = oRectB.oBR.fY - oRectB.oTL.fY;\r\n\r\n\t\t\tdouble dScaleX = dWidth \/ dW;\/\/fSrcWidth;\r\n\t\t\tdouble dScaleY = dHeight \/ dH;\/\/fSrcHeight;\r\n\t\t\t\/\/double dScaleX = dWidth \/ fSrcWidth;\r\n\t\t\t\/\/double dScaleY = dHeight \/ fSrcHeight;\r\n\r\n\t\t\tdouble dSrcDpiX, dSrcDpiY;\r\n\t\t\tm_oWmfFile.GetDpi(&dSrcDpiX, &dSrcDpiY);\r\n\r\n\t\t\tdouble dDpiKoefX = dRendererDpix \/ dSrcDpiX;\r\n\t\t\tdouble dDpiKoefY = dRendererDpiY \/ dSrcDpiY;\r\n\r\n\t\t\tdouble dDpi = dSrcDpiY * fSrcHeight \/ fH;\r\n\t\t\toWmfOut.SetDpi(dRendererDpix, dDpi);\r\n\t\t\toWmfOut.SetWmfRect(oRectB);\r\n\t\t\toWmfOut.SetScales(dScaleX, dScaleY);\r\n\r\n\t\t\tm_oWmfFile.SetOutputDevice(&oWmfOut);\r\n\r\n\t\t\tTWmfRectF oRect;\r\n\t\t\tm_oWmfFile.Play(&oRect);\r\n#endif\r\n\t\t}\r\n\t\telse if (c_lMetaEmf == m_lType)\r\n\t\t{\r\n\t\t\tCEmfRendererOutput oEmfOut(&m_oEmfFile, pRenderer, dX, dY, dWidth, dHeight);\r\n\t\t\tm_oEmfFile.SetOutputDevice(&oEmfOut);\r\n\t\t\tm_oEmfFile.PlayMetaFile();\r\n\t\t}\r\n\r\n\t\tpRenderer->EndCommand(c_nImageType);\r\n\t\treturn true;\r\n\t};\r\n\tvoid CMetaFile::Close()\r\n\t{\r\n\t\tm_oWmfFile.Close();\r\n\t\t\/\/m_oEmfFile.Close();\r\n\r\n\t\tm_lType = 0;\r\n\t};\r\n\tint CMetaFile::GetType()\r\n\t{\r\n\t\treturn m_lType;\r\n\t}\r\n\tvoid CMetaFile::GetBounds(double* pdX, double* pdY, double* pdW, double* pdH)\r\n\t{\r\n\t\tif (c_lMetaWmf == m_lType)\r\n\t\t{\r\n\t\t\t*pdX = m_oWmfRect.oTL.fX;\r\n\t\t\t*pdY = m_oWmfRect.oTL.fY;\r\n\t\t\t*pdW = m_oWmfRect.oBR.fX - m_oWmfRect.oTL.fX;\r\n\t\t\t*pdH = m_oWmfRect.oBR.fY - m_oWmfRect.oTL.fY;\r\n\t\t}\r\n\t\telse if (c_lMetaEmf == m_lType)\r\n\t\t{\r\n\t\t\tTEmfRectL* pRect = m_oEmfFile.GetBounds();\r\n\t\t\t*pdX = pRect->lLeft;\r\n\t\t\t*pdY = pRect->lTop;\r\n\t\t\t*pdW = pRect->lRight - pRect->lLeft;\r\n\t\t\t*pdH = pRect->lBottom - pRect->lTop;\r\n\t\t}\r\n\t\telse\r\n\t\t{\r\n\t\t\t*pdX = 0;\r\n\t\t\t*pdY = 0;\r\n\t\t\t*pdW = 0;\r\n\t\t\t*pdH = 0;\r\n\t\t}\r\n\t};\r\n\tvoid CMetaFile::ConvertToRaster(const wchar_t* wsOutFilePath, unsigned int unFileType, int nWidth, int nHeight)\r\n\t{\r\n\t\tCFontManager *pFontManager = m_pAppFonts->GenerateFontManager();\r\n\t\tCFontsCache* pFontCache = new CFontsCache();\r\n\t\tpFontCache->SetStreams(m_pAppFonts->GetStreams());\r\n\t\tpFontManager->SetOwnerCache(pFontCache);\r\n\t\tCImageFilesCache oCache;\r\n\r\n\t\tCGraphicsRenderer oRenderer;\t\t\r\n\t\toRenderer.SetFontManager(pFontManager);\r\n\t\toRenderer.SetImageCache(&oCache);\r\n\r\n\t\tif (-1 == nHeight)\r\n\t\t{\r\n\t\t\tdouble dX, dY, dW, dH;\r\n\t\t\tGetBounds(&dX, &dY, &dW, &dH);\r\n\t\t\tnHeight = (int)((double)nWidth * dH \/ dW);\r\n\t\t}\r\n\r\n\t\t\/\/double dDpiX, dDpiY;\r\n\t\t\/\/oRenderer.get_DpiX(&dDpiX);\r\n\t\t\/\/oRenderer.get_DpiX(&dDpiY);\r\n\r\n\t\tdouble dWidth = nWidth ;\/\/* 72 \/ 25.4 \/ dDpiX;\r\n\t\tdouble dHeight = nHeight ;\/\/* 72 \/ 25.4 \/ dDpiY;\r\n\r\n\t\tBYTE* pBgraData = new BYTE[nWidth * nHeight * 4];\r\n\t\tCBgraFrame oFrame;\r\n\t\toFrame.put_Data(pBgraData);\r\n\t\toFrame.put_Width(nWidth);\r\n\t\toFrame.put_Height(nHeight);\r\n\t\toFrame.put_Stride(-4 * nWidth);\r\n\r\n\t\toRenderer.CreateFromBgraFrame(&oFrame);\r\n\t\toRenderer.SetSwapRGB(false);\r\n\t\toRenderer.put_Width(dWidth);\r\n\t\toRenderer.put_Height(dHeight);\r\n\r\n\t\tDrawOnRenderer(&oRenderer, 0, 0, dWidth, dHeight);\r\n\r\n\t\toFrame.SaveFile(wsOutFilePath, unFileType);\r\n\t\tRELEASEINTERFACE(pFontManager);\r\n\t}\r\n}\r\n<|endoftext|>"} {"text":"<commit_before>\/**\nCopyright (c) 2013, 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#ifndef _KUL_STRING_HPP_\n#define _KUL_STRING_HPP_\n\n#include <string>\n#include <vector>\n#include <string.h>\n#include <algorithm>\n#include <iostream>\n\n#include \"kul\/except.hpp\"\n\nnamespace kul { \n\nclass StringException : public kul::Exception{\n public:\n StringException(const char*f, const uint16_t& l, const std::string& s) : kul::Exception(f, l, s){}\n};\n\nclass String{\n public:\n static void REPLACE(std::string& s, const std::string& f, const std::string& r){\n size_t p = 0;\n if((p = s.find(f)) != std::string::npos) s.replace(p, f.size(), r);\n }\n static void REPLACE_ALL(std::string& s, const std::string& f, const std::string& r){\n while(s.find(f) != std::string::npos) REPLACE(s, f, r);\n }\n static void TRIM_LEFT(std::string& s, const char& delim=' '){\n while(s.find(delim) == 0)\n s.erase(0, 1);\n }\n static void TRIM_RIGHT(std::string& s, const char& delim=' '){\n while(s.rfind(delim) == s.size() - 1)\n s.pop_back();\n }\n static void TRIM(std::string& s){\n while(s.find(' ') == 0 || s.find('\\t') == 0)\n s.erase(0, 1);\n if(s.size() == 0) return;\n while(s.rfind(' ') == s.size() - 1 || s.rfind('\\t') == s.size() - 1)\n s.pop_back();\n }\n static void PAD(std::string& s, const uint16_t& p){\n while(s.size() < p) s += \" \";\n }\n static std::vector<std::string> SPLIT(const std::string& s, const char& d){\n std::vector<std::string> v;\n SPLIT(s, d, v);\n return v;\n }\n static void SPLIT(const std::string& s, const char& d, std::vector<std::string>& v){\n if(s.find(d) != std::string::npos){\n std::string l;\n std::stringstream stream(s);\n while(std::getline(stream, l, d))\n if(l.compare(\"\") != 0) v.push_back(l);\n }else v.push_back(s);\n }\n static std::vector<std::string> SPLIT(const std::string& s, const std::string& d){\n std::vector<std::string> v;\n SPLIT(s, d, v);\n return v;\n }\n static void SPLIT(const std::string& s, const std::string& d, std::vector<std::string>& v){\n std::string l = s;\n size_t pos = 0;\n while((pos = l.find(d)) != std::string::npos){\n v.push_back(l.substr(0, pos));\n l = l.substr(pos + 1);\n }\n v.push_back(l);\n }\n static std::vector<std::string> ESC_SPLIT(const std::string& s, const char& d, const char& e = '\\\\'){\n std::vector<std::string> v;\n ESC_SPLIT(s, d, v, e);\n return v;\n }\n static void ESC_SPLIT(const std::string& s, const char& d, std::vector<std::string>& v, const char& e = '\\\\'){\n std::string l = s;\n size_t pos = 0, esc = 0;\n while((pos = l.find(d, esc)) != std::string::npos){\n if(pos > 0 && l.find(std::string(1, e) + std::string(1, d)) == pos - 1){ \n esc++; \n continue; \n }\n v.push_back(l.substr(0, pos));\n l = l.substr(pos + 1);\n esc = 0;\n }\n v.push_back(l);\n }\n static bool NO_CASE_CMP(const std::string& a, const std::string& b){\n std::string aCpy(a);\n std::string bCpy(b);\n std::transform(aCpy.begin(), aCpy.end(), aCpy.begin(), ::tolower);\n std::transform(bCpy.begin(), bCpy.end(), bCpy.begin(), ::tolower);\n return (aCpy == bCpy);\n }\n static std::vector<std::string> LINES(const std::string& s){\n std::vector<std::string> v;\n LINES(s, v);\n return v;\n }\n static void LINES(const std::string& s, std::vector<std::string>& v){\n if(s.find(\"\\n\") != std::string::npos){\n std::string l;\n std::stringstream ss(s);\n while(std::getline(ss, l)) if(!l.empty()) v.push_back(l);\n }else v.push_back(s);\n }\n\n static bool BOOL(std::string s){\n TRIM(s);\n const std::vector<std::string>& pos {\"yes\", \"y\", \"true\" , \"1\"}; \n const std::vector<std::string>& neg {\"no\" , \"n\", \"false\", \"0\"}; \n std::transform(s.begin(), s.end(), s.begin(), ::tolower);\n if (std::find(pos.begin(), pos.end(), s) != pos.end()) return true;\n if (std::find(neg.begin(), neg.end(), s) != neg.end()) return false;\n KEXCEPT(StringException, \"input not bool-able, \" + s);\n }\n\n static uint16_t UINT16(const std::string& s) throw(StringException){\n try{\n uint32_t lresult = stoul(s, 0, 10);\n uint16_t result = lresult;\n if (result != lresult) KEXCEPT(StringException, \"UINT failed\");\n return result;\n }catch(const std::invalid_argument& e){ KEXCEPT(StringException, \"UINT failed\"); }\n return 0;\n }\n static int16_t INT16(const std::string& s) throw(StringException){\n try{\n return std::stoi(s); \n }catch(const std::invalid_argument& e){ KEXCEPT(StringException, \"stoi failed\"); }\n }\n static uint32_t UINT32(const std::string& s) throw(StringException){\n try{\n return std::stoul(s);\n }catch(const std::invalid_argument& e){ KEXCEPT(StringException, \"ULONG failed\"); }\n return 0;\n }\n static uint64_t UINT64(const std::string& s) throw(StringException){\n try{\n return std::stoull(s);\n }catch(const std::invalid_argument& e){ KEXCEPT(StringException, \"ULONGLONG failed\"); }\n return 0;\n }\n};\n\n}\n#endif \/* _KUL_STRING_HPP_ *\/\n<commit_msg>whitespace<commit_after>\/**\nCopyright (c) 2013, 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#ifndef _KUL_STRING_HPP_\n#define _KUL_STRING_HPP_\n\n#include <string>\n#include <vector>\n#include <string.h>\n#include <algorithm>\n#include <iostream>\n\n#include \"kul\/except.hpp\"\n\nnamespace kul { \n\nclass StringException : public kul::Exception{\n public:\n StringException(const char*f, const uint16_t& l, const std::string& s) : kul::Exception(f, l, s){}\n};\n\nclass String{\n public:\n static void REPLACE(std::string& s, const std::string& f, const std::string& r){\n size_t p = 0;\n if((p = s.find(f)) != std::string::npos) s.replace(p, f.size(), r);\n }\n static void REPLACE_ALL(std::string& s, const std::string& f, const std::string& r){\n while(s.find(f) != std::string::npos) REPLACE(s, f, r);\n }\n static void TRIM_LEFT(std::string& s, const char& delim=' '){\n while(s.find(delim) == 0)\n s.erase(0, 1);\n }\n static void TRIM_RIGHT(std::string& s, const char& delim=' '){\n while(s.rfind(delim) == s.size() - 1)\n s.pop_back();\n }\n static void TRIM(std::string& s){\n while(s.find(' ') == 0 || s.find('\\t') == 0)\n s.erase(0, 1);\n if(s.size() == 0) return;\n while(s.rfind(' ') == s.size() - 1 || s.rfind('\\t') == s.size() - 1)\n s.pop_back();\n }\n static void PAD(std::string& s, const uint16_t& p){\n while(s.size() < p) s += \" \";\n }\n static std::vector<std::string> SPLIT(const std::string& s, const char& d){\n std::vector<std::string> v;\n SPLIT(s, d, v);\n return v;\n }\n static void SPLIT(const std::string& s, const char& d, std::vector<std::string>& v){\n if(s.find(d) != std::string::npos){\n std::string l;\n std::stringstream stream(s);\n while(std::getline(stream, l, d))\n if(l.compare(\"\") != 0) v.push_back(l);\n }else v.push_back(s);\n }\n static std::vector<std::string> SPLIT(const std::string& s, const std::string& d){\n std::vector<std::string> v;\n SPLIT(s, d, v);\n return v;\n }\n static void SPLIT(const std::string& s, const std::string& d, std::vector<std::string>& v){\n std::string l = s;\n size_t pos = 0;\n while((pos = l.find(d)) != std::string::npos){\n v.push_back(l.substr(0, pos));\n l = l.substr(pos + 1);\n }\n v.push_back(l);\n }\n static std::vector<std::string> ESC_SPLIT(const std::string& s, const char& d, const char& e = '\\\\'){\n std::vector<std::string> v;\n ESC_SPLIT(s, d, v, e);\n return v;\n }\n static void ESC_SPLIT(const std::string& s, const char& d, std::vector<std::string>& v, const char& e = '\\\\'){\n std::string l = s;\n size_t pos = 0, esc = 0;\n while((pos = l.find(d, esc)) != std::string::npos){\n if(pos > 0 && l.find(std::string(1, e) + std::string(1, d)) == pos - 1){ \n esc++; \n continue; \n }\n v.push_back(l.substr(0, pos));\n l = l.substr(pos + 1);\n esc = 0;\n }\n v.push_back(l);\n }\n static bool NO_CASE_CMP(const std::string& a, const std::string& b){\n std::string aCpy(a);\n std::string bCpy(b);\n std::transform(aCpy.begin(), aCpy.end(), aCpy.begin(), ::tolower);\n std::transform(bCpy.begin(), bCpy.end(), bCpy.begin(), ::tolower);\n return (aCpy == bCpy);\n }\n static std::vector<std::string> LINES(const std::string& s){\n std::vector<std::string> v;\n LINES(s, v);\n return v;\n }\n static void LINES(const std::string& s, std::vector<std::string>& v){\n if(s.find(\"\\n\") != std::string::npos){\n std::string l;\n std::stringstream ss(s);\n while(std::getline(ss, l)) if(!l.empty()) v.push_back(l);\n }else v.push_back(s);\n }\n\n static bool BOOL(std::string s){\n TRIM(s);\n const std::vector<std::string>& pos {\"yes\", \"y\", \"true\" , \"1\"}; \n const std::vector<std::string>& neg {\"no\" , \"n\", \"false\", \"0\"}; \n std::transform(s.begin(), s.end(), s.begin(), ::tolower);\n if (std::find(pos.begin(), pos.end(), s) != pos.end()) return true;\n if (std::find(neg.begin(), neg.end(), s) != neg.end()) return false;\n KEXCEPT(StringException, \"input not bool-able, \" + s);\n }\n\n static uint16_t UINT16(const std::string& s) throw(StringException){\n try{\n uint32_t lresult = stoul(s, 0, 10);\n uint16_t result = lresult;\n if (result != lresult) KEXCEPT(StringException, \"UINT failed\");\n return result;\n }catch(const std::invalid_argument& e){ KEXCEPT(StringException, \"UINT failed\"); }\n return 0;\n }\n static int16_t INT16(const std::string& s) throw(StringException){\n try{\n return std::stoi(s); \n }catch(const std::invalid_argument& e){ KEXCEPT(StringException, \"stoi failed\"); }\n }\n static uint32_t UINT32(const std::string& s) throw(StringException){\n try{\n return std::stoul(s);\n }catch(const std::invalid_argument& e){ KEXCEPT(StringException, \"ULONG failed\"); }\n return 0;\n }\n static uint64_t UINT64(const std::string& s) throw(StringException){\n try{\n return std::stoull(s);\n }catch(const std::invalid_argument& e){ KEXCEPT(StringException, \"ULONGLONG failed\"); }\n return 0;\n }\n};\n\n}\n#endif \/* _KUL_STRING_HPP_ *\/\n<|endoftext|>"} {"text":"<commit_before>\/\/ This file is a part of the IncludeOS unikernel - www.includeos.org\n\/\/\n\/\/ Copyright 2015-2016 Oslo and Akershus University College of Applied Sciences\n\/\/ and Alfred Bratterud\n\/\/\n\/\/ Licensed under the Apache License, Version 2.0 (the \"License\");\n\/\/ you may not use this file except in compliance with the License.\n\/\/ You may obtain a copy of the License at\n\/\/ \n\/\/ http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n\/\/ \n\/\/ Unless required by applicable law or agreed to in writing, software\n\/\/ distributed under the License is distributed on an \"AS IS\" BASIS,\n\/\/ WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n\/\/ See the License for the specific language governing permissions and\n\/\/ limitations under the License.\n\n#ifndef HTTP_MIME_TYPES_HPP\n#define HTTP_MIME_TYPES_HPP\n\n#include <string>\n#include <unordered_map>\n\nnamespace http {\n\/\/------------------------------------------------\nusing Extension = std::string;\nusing Mime_Type = std::string;\nusing Mime_Type_Table = std::unordered_map<Extension, Mime_Type>;\n\/\/------------------------------------------------\nconst Mime_Type_Table mime_types {\n \/\/< Text mimes\n {\"html\", \"text\/html\"},\n {\"htm\" , \"text\/html\"},\n {\"js\" , \"text\/javascript\"},\n {\"txt\" , \"text\/plain\"},\n {\"css\" , \"text\/css\"},\n {\"xml\" , \"text\/xml\"},\n \n \/\/< Image mimes\n {\"bmp\" , \"image\/bmp\"},\n {\"gif\" , \"image\/gif\"},\n {\"png\" , \"image\/png\"},\n {\"jpg\" , \"image\/jpeg\"},\n {\"jpeg\", \"image\/jpeg\"},\n {\"ico\" , \"image\/x-icon\"},\n\n \/\/< Audio mimes\n {\"mid\" , \"audio\/midi\"},\n {\"midi\", \"audio\/midi\"},\n {\"kar\" , \"audio\/midi\"},\n {\"mp3\" , \"audio\/mpeg\"},\n {\"ogg\" , \"audio\/ogg\"},\n {\"m4a\" , \"audio\/x-m4a\"},\n {\"ra\" , \"audio\/x-realaudio\"},\n\n \/\/< Video mimes\n {\"3gp\" , \"video\/3gpp\"},\n {\"3gpp\", \"video\/3gpp\"},\n {\"ts\" , \"video\/mp2t\"},\n {\"mp4\" , \"video\/mp4\"},\n {\"mpg\" , \"video\/mpeg\"},\n {\"mpeg\", \"video\/mpeg\"},\n {\"mov\" , \"video\/quicktime\"},\n {\"webm\", \"video\/webm\"},\n {\"flv\" , \"video\/x-flv\"},\n {\"m4v\" , \"video\/x-m4v\"},\n {\"mng\" , \"video\/x-mng\"},\n {\"asf\" , \"video\/x-ms-asf\"},\n {\"asx\" , \"video\/x-ms-asf\"},\n {\"wmv\" , \"video\/x-ms-wmv\"},\n {\"avi\" , \"video\/x-msvideo\"},\n\n \/\/< Application mimes\n {\"zip\" , \"application\/zip\"},\n {\"7z\" , \"application\/x-7z-compressed\"},\n {\"jar\" , \"application\/java-archive\"},\n {\"war\" , \"application\/java-archive\"},\n {\"ear\" , \"application\/java-archive\"},\n {\"json\" , \"application\/json\"},\n {\"pdf\" , \"application\/pdf\"},\n {\"xhtml\", \"application\/xhtml+xml\"},\n {\"xspf\" , \"application\/xspf+xml\"},\n {\"der\" , \"application\/x-x509-ca-cert\"},\n {\"pem\" , \"application\/x-x509-ca-cert\"},\n {\"crt\" , \"application\/x-x509-ca-cert\"},\n {\"bin\" , \"application\/octet-stream\"},\n {\"exe\" , \"application\/octet-stream\"},\n {\"dll\" , \"application\/octet-stream\"},\n {\"deb\" , \"application\/octet-stream\"},\n {\"dmg\" , \"application\/octet-stream\"},\n {\"iso\" , \"application\/octet-stream\"},\n {\"img\" , \"application\/octet-stream\"},\n {\"msi\" , \"application\/octet-stream\"},\n {\"msp\" , \"application\/octet-stream\"},\n {\"msm\" , \"application\/octet-stream\"}\n}; \/\/< mime_types\n\ninline const Mime_Type& extension_to_type(const Extension& extension) noexcept {\n auto iter = mime_types.find(extension);\n \/\/------------------------------------------------\n return (iter not_eq mime_types.end())\n ? iter->second\n : const_cast<Mime_Type_Table&>(mime_types)[\"txt\"];\n}\n\n} \/\/< namespace http\n\n#endif \/\/< HTTP_MIME_TYPES_HPP\n<commit_msg>mime: Added svg type<commit_after>\/\/ This file is a part of the IncludeOS unikernel - www.includeos.org\n\/\/\n\/\/ Copyright 2015-2016 Oslo and Akershus University College of Applied Sciences\n\/\/ and Alfred Bratterud\n\/\/\n\/\/ Licensed under the Apache License, Version 2.0 (the \"License\");\n\/\/ you may not use this file except in compliance with the License.\n\/\/ You may obtain a copy of the License at\n\/\/\n\/\/ http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n\/\/\n\/\/ Unless required by applicable law or agreed to in writing, software\n\/\/ distributed under the License is distributed on an \"AS IS\" BASIS,\n\/\/ WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n\/\/ See the License for the specific language governing permissions and\n\/\/ limitations under the License.\n\n#ifndef HTTP_MIME_TYPES_HPP\n#define HTTP_MIME_TYPES_HPP\n\n#include <string>\n#include <unordered_map>\n\nnamespace http {\n\/\/------------------------------------------------\nusing Extension = std::string;\nusing Mime_Type = std::string;\nusing Mime_Type_Table = std::unordered_map<Extension, Mime_Type>;\n\/\/------------------------------------------------\nconst Mime_Type_Table mime_types {\n \/\/< Text mimes\n {\"html\", \"text\/html\"},\n {\"htm\" , \"text\/html\"},\n {\"js\" , \"text\/javascript\"},\n {\"txt\" , \"text\/plain\"},\n {\"css\" , \"text\/css\"},\n {\"xml\" , \"text\/xml\"},\n\n \/\/< Image mimes\n {\"bmp\" , \"image\/bmp\"},\n {\"gif\" , \"image\/gif\"},\n {\"png\" , \"image\/png\"},\n {\"jpg\" , \"image\/jpeg\"},\n {\"jpeg\", \"image\/jpeg\"},\n {\"ico\" , \"image\/x-icon\"},\n {\"svg\" , \"image\/svg+xml\"},\n\n \/\/< Audio mimes\n {\"mid\" , \"audio\/midi\"},\n {\"midi\", \"audio\/midi\"},\n {\"kar\" , \"audio\/midi\"},\n {\"mp3\" , \"audio\/mpeg\"},\n {\"ogg\" , \"audio\/ogg\"},\n {\"m4a\" , \"audio\/x-m4a\"},\n {\"ra\" , \"audio\/x-realaudio\"},\n\n \/\/< Video mimes\n {\"3gp\" , \"video\/3gpp\"},\n {\"3gpp\", \"video\/3gpp\"},\n {\"ts\" , \"video\/mp2t\"},\n {\"mp4\" , \"video\/mp4\"},\n {\"mpg\" , \"video\/mpeg\"},\n {\"mpeg\", \"video\/mpeg\"},\n {\"mov\" , \"video\/quicktime\"},\n {\"webm\", \"video\/webm\"},\n {\"flv\" , \"video\/x-flv\"},\n {\"m4v\" , \"video\/x-m4v\"},\n {\"mng\" , \"video\/x-mng\"},\n {\"asf\" , \"video\/x-ms-asf\"},\n {\"asx\" , \"video\/x-ms-asf\"},\n {\"wmv\" , \"video\/x-ms-wmv\"},\n {\"avi\" , \"video\/x-msvideo\"},\n\n \/\/< Application mimes\n {\"zip\" , \"application\/zip\"},\n {\"7z\" , \"application\/x-7z-compressed\"},\n {\"jar\" , \"application\/java-archive\"},\n {\"war\" , \"application\/java-archive\"},\n {\"ear\" , \"application\/java-archive\"},\n {\"json\" , \"application\/json\"},\n {\"pdf\" , \"application\/pdf\"},\n {\"xhtml\", \"application\/xhtml+xml\"},\n {\"xspf\" , \"application\/xspf+xml\"},\n {\"der\" , \"application\/x-x509-ca-cert\"},\n {\"pem\" , \"application\/x-x509-ca-cert\"},\n {\"crt\" , \"application\/x-x509-ca-cert\"},\n {\"bin\" , \"application\/octet-stream\"},\n {\"exe\" , \"application\/octet-stream\"},\n {\"dll\" , \"application\/octet-stream\"},\n {\"deb\" , \"application\/octet-stream\"},\n {\"dmg\" , \"application\/octet-stream\"},\n {\"iso\" , \"application\/octet-stream\"},\n {\"img\" , \"application\/octet-stream\"},\n {\"msi\" , \"application\/octet-stream\"},\n {\"msp\" , \"application\/octet-stream\"},\n {\"msm\" , \"application\/octet-stream\"}\n}; \/\/< mime_types\n\ninline const Mime_Type& extension_to_type(const Extension& extension) noexcept {\n auto iter = mime_types.find(extension);\n \/\/------------------------------------------------\n return (iter not_eq mime_types.end())\n ? iter->second\n : const_cast<Mime_Type_Table&>(mime_types)[\"txt\"];\n}\n\n} \/\/< namespace http\n\n#endif \/\/< HTTP_MIME_TYPES_HPP\n<|endoftext|>"} {"text":"<commit_before>\/\/ Copyright 2012 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#define __CL_ENABLE_EXCEPTIONS\n#include <CL\/cl.hpp>\n#include <string>\n#include <utility>\n#include <vector>\n\n#include \"Exceptions.hpp\"\n\n#pragma once\n\nnamespace isa\n{\nnamespace OpenCL\n{\n\n\/\/ Class that represents the configuration of an OpenCL kernel\nclass KernelConf\n{\n public:\n KernelConf();\n ~KernelConf();\n \/\/ Get\n inline std::string getIntType() const;\n inline unsigned int getNrThreadsD0() const;\n inline unsigned int getNrThreadsD1() const;\n inline unsigned int getNrThreadsD2() const;\n inline unsigned int getNrItemsD0() const;\n inline unsigned int getNrItemsD1() const;\n inline unsigned int getNrItemsD2() const;\n \/\/ Set\n inline void setIntType(std::string &type);\n inline void setNrThreadsD0(unsigned int threads);\n inline void setNrThreadsD1(unsigned int threads);\n inline void setNrThreadsD2(unsigned int threads);\n inline void setNrItemsD0(unsigned int items);\n inline void setNrItemsD1(unsigned int items);\n inline void setNrItemsD2(unsigned int items);\n \/\/ utils\n std::string print() const;\n\n private:\n std::string intType;\n unsigned int nrThreadsD0, nrThreadsD1, nrThreadsD2;\n unsigned int nrItemsD0, nrItemsD1, nrItemsD2;\n};\n\ncl::Kernel *compile(const std::string &name, const std::string &code, const std::string &flags, cl::Context &clContext, cl::Device &clDevice);\n\n\/\/ Implementations\ninline std::string KernelConf::getIntType() const\n{\n return intType;\n}\n\ninline unsigned int KernelConf::getNrThreadsD0() const\n{\n return nrThreadsD0;\n}\n\ninline unsigned int KernelConf::getNrThreadsD1() const\n{\n return nrThreadsD1;\n}\n\ninline unsigned int KernelConf::getNrThreadsD2() const\n{\n return nrThreadsD2;\n}\n\ninline unsigned int KernelConf::getNrItemsD0() const\n{\n return nrItemsD0;\n}\n\ninline unsigned int KernelConf::getNrItemsD1() const\n{\n return nrItemsD1;\n}\n\ninline unsigned int KernelConf::getNrItemsD2() const\n{\n return nrItemsD2;\n}\n\ninline void KernelConf::setIntType(std::string &type)\n{\n intType = type;\n}\n\ninline void KernelConf::setNrThreadsD0(unsigned int threads)\n{\n nrThreadsD0 = threads;\n}\n\ninline void KernelConf::setNrThreadsD1(unsigned int threads)\n{\n nrThreadsD1 = threads;\n}\n\ninline void KernelConf::setNrThreadsD2(unsigned int threads)\n{\n nrThreadsD2 = threads;\n}\n\ninline void KernelConf::setNrItemsD0(unsigned int items)\n{\n nrItemsD0 = items;\n}\n\ninline void KernelConf::setNrItemsD1(unsigned int items)\n{\n nrItemsD1 = items;\n}\n\ninline void KernelConf::setNrItemsD2(unsigned int items)\n{\n nrItemsD2 = items;\n}\n\n} \/\/ namespace OpenCL\n} \/\/ namespace isa\n<commit_msg>Pass the parameter by value.<commit_after>\/\/ Copyright 2012 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#define __CL_ENABLE_EXCEPTIONS\n#include <CL\/cl.hpp>\n#include <string>\n#include <utility>\n#include <vector>\n\n#include \"Exceptions.hpp\"\n\n#pragma once\n\nnamespace isa\n{\nnamespace OpenCL\n{\n\n\/\/ Class that represents the configuration of an OpenCL kernel\nclass KernelConf\n{\n public:\n KernelConf();\n ~KernelConf();\n \/\/ Get\n inline std::string getIntType() const;\n inline unsigned int getNrThreadsD0() const;\n inline unsigned int getNrThreadsD1() const;\n inline unsigned int getNrThreadsD2() const;\n inline unsigned int getNrItemsD0() const;\n inline unsigned int getNrItemsD1() const;\n inline unsigned int getNrItemsD2() const;\n \/\/ Set\n inline void setIntType(std::string type);\n inline void setNrThreadsD0(unsigned int threads);\n inline void setNrThreadsD1(unsigned int threads);\n inline void setNrThreadsD2(unsigned int threads);\n inline void setNrItemsD0(unsigned int items);\n inline void setNrItemsD1(unsigned int items);\n inline void setNrItemsD2(unsigned int items);\n \/\/ utils\n std::string print() const;\n\n private:\n std::string intType;\n unsigned int nrThreadsD0, nrThreadsD1, nrThreadsD2;\n unsigned int nrItemsD0, nrItemsD1, nrItemsD2;\n};\n\ncl::Kernel *compile(const std::string &name, const std::string &code, const std::string &flags, cl::Context &clContext, cl::Device &clDevice);\n\n\/\/ Implementations\ninline std::string KernelConf::getIntType() const\n{\n return intType;\n}\n\ninline unsigned int KernelConf::getNrThreadsD0() const\n{\n return nrThreadsD0;\n}\n\ninline unsigned int KernelConf::getNrThreadsD1() const\n{\n return nrThreadsD1;\n}\n\ninline unsigned int KernelConf::getNrThreadsD2() const\n{\n return nrThreadsD2;\n}\n\ninline unsigned int KernelConf::getNrItemsD0() const\n{\n return nrItemsD0;\n}\n\ninline unsigned int KernelConf::getNrItemsD1() const\n{\n return nrItemsD1;\n}\n\ninline unsigned int KernelConf::getNrItemsD2() const\n{\n return nrItemsD2;\n}\n\ninline void KernelConf::setIntType(std::string type)\n{\n intType = type;\n}\n\ninline void KernelConf::setNrThreadsD0(unsigned int threads)\n{\n nrThreadsD0 = threads;\n}\n\ninline void KernelConf::setNrThreadsD1(unsigned int threads)\n{\n nrThreadsD1 = threads;\n}\n\ninline void KernelConf::setNrThreadsD2(unsigned int threads)\n{\n nrThreadsD2 = threads;\n}\n\ninline void KernelConf::setNrItemsD0(unsigned int items)\n{\n nrItemsD0 = items;\n}\n\ninline void KernelConf::setNrItemsD1(unsigned int items)\n{\n nrItemsD1 = items;\n}\n\ninline void KernelConf::setNrItemsD2(unsigned int items)\n{\n nrItemsD2 = items;\n}\n\n} \/\/ namespace OpenCL\n} \/\/ namespace isa\n<|endoftext|>"} {"text":"<commit_before>#pragma once\n\n#include <algorithm>\n#include <cmath>\n#include <cstdint>\n#include <tuple>\n#include <vector>\n\nnamespace kdbush {\n\ntemplate <std::uint8_t I, typename T>\nstruct nth {\n inline static typename std::tuple_element<I, T>::type get(const T &t) {\n return std::get<I>(t);\n }\n};\n\ntemplate <typename TPoint, typename TIndex = std::size_t>\nclass KDBush {\n\npublic:\n using TNumber = decltype(nth<0, TPoint>::get(std::declval<TPoint>()));\n static_assert(\n std::is_same<TNumber, decltype(nth<1, TPoint>::get(std::declval<TPoint>()))>::value,\n \"point component types must be identical\");\n\n static const std::uint8_t defaultNodeSize = 64;\n\n KDBush(const std::vector<TPoint> &points_, const std::uint8_t nodeSize_ = defaultNodeSize)\n : KDBush(std::begin(points_), std::end(points_), nodeSize_) {\n }\n\n template <typename TPointIter>\n KDBush(TPointIter points_begin,\n TPointIter points_end,\n const std::uint8_t nodeSize_ = defaultNodeSize)\n : nodeSize(nodeSize_) {\n\n const TIndex size = std::distance(points_begin, points_end);\n\n points.reserve(size);\n ids.reserve(size);\n\n for (TIndex i = 0; i < size; i++) {\n const auto p = *(points_begin + i);\n points.emplace_back(nth<0, TPoint>::get(p), nth<1, TPoint>::get(p));\n ids.push_back(i);\n }\n\n sortKD(0, size - 1, 0);\n }\n\n template <typename TOutputIter>\n void range(const TNumber minX,\n const TNumber minY,\n const TNumber maxX,\n const TNumber maxY,\n TOutputIter out) {\n range(minX, minY, maxX, maxY, out, 0, ids.size() - 1, 0);\n }\n\n template <typename TOutputIter>\n void within(const TNumber qx, const TNumber qy, const TNumber r, TOutputIter out) {\n within(qx, qy, r, out, 0, ids.size() - 1, 0);\n }\n\nprivate:\n std::vector<TIndex> ids;\n std::vector<std::pair<TNumber, TNumber>> points;\n std::uint8_t nodeSize;\n\n template <typename TOutputIter>\n void range(const TNumber minX,\n const TNumber minY,\n const TNumber maxX,\n const TNumber maxY,\n TOutputIter out,\n const TIndex left,\n const TIndex right,\n const std::uint8_t axis) {\n\n if (right - left <= nodeSize) {\n for (auto i = left; i <= right; i++) {\n const TNumber x = std::get<0>(points[i]);\n const TNumber y = std::get<1>(points[i]);\n if (x >= minX && x <= maxX && y >= minY && y <= maxY) *out++ = ids[i];\n }\n return;\n }\n\n const TIndex m = (left + right) >> 1;\n const TNumber x = std::get<0>(points[m]);\n const TNumber y = std::get<1>(points[m]);\n\n if (x >= minX && x <= maxX && y >= minY && y <= maxY) *out++ = ids[m];\n\n if (axis == 0 ? minX <= x : minY <= y)\n range(minX, minY, maxX, maxY, out, left, m - 1, (axis + 1) % 2);\n\n if (axis == 0 ? maxX >= x : maxY >= y)\n range(minX, minY, maxX, maxY, out, m + 1, right, (axis + 1) % 2);\n }\n\n template <typename TOutputIter>\n void within(const TNumber qx,\n const TNumber qy,\n const TNumber r,\n TOutputIter out,\n const TIndex left,\n const TIndex right,\n const std::uint8_t axis) {\n\n const TNumber r2 = r * r;\n\n if (right - left <= nodeSize) {\n for (auto i = left; i <= right; i++) {\n const TNumber x = std::get<0>(points[i]);\n const TNumber y = std::get<1>(points[i]);\n if (sqDist(x, y, qx, qy) <= r2) *out++ = ids[i];\n }\n return;\n }\n\n const TIndex m = (left + right) >> 1;\n const TNumber x = std::get<0>(points[m]);\n const TNumber y = std::get<1>(points[m]);\n\n if (sqDist(x, y, qx, qy) <= r2) *out++ = ids[m];\n\n if (axis == 0 ? qx - r <= x : qy - r <= y)\n within(qx, qy, r, out, left, m - 1, (axis + 1) % 2);\n\n if (axis == 0 ? qx + r >= x : qy + r >= y)\n within(qx, qy, r, out, m + 1, right, (axis + 1) % 2);\n }\n\n void sortKD(const TIndex left, const TIndex right, const std::uint8_t axis) {\n if (right - left <= nodeSize) return;\n const TIndex m = (left + right) >> 1;\n if (axis == 0) {\n select<0>(m, left, right);\n } else {\n select<1>(m, left, right);\n }\n sortKD(left, m - 1, (axis + 1) % 2);\n sortKD(m + 1, right, (axis + 1) % 2);\n }\n\n template <std::uint8_t axis>\n void select(const TIndex k, TIndex left, TIndex right) {\n\n while (right > left) {\n if (right - left > 600) {\n const TIndex n = right - left + 1;\n const TIndex m = k - left + 1;\n const double z = log(n);\n const double s = 0.5 * exp(2 * z \/ 3);\n const double sd = 0.5 * sqrt(z * s * (n - s) \/ n) * (2 * m < n ? -1 : 1);\n const TIndex newLeft = std::max(left, TIndex(k - m * s \/ n + sd));\n const TIndex newRight = std::min(right, TIndex(k + (n - m) * s \/ n + sd));\n select<axis>(k, newLeft, newRight);\n }\n\n const TNumber t = std::get<axis>(points[k]);\n TIndex i = left;\n TIndex j = right;\n\n swapItem(left, k);\n if (std::get<axis>(points[right]) > t) swapItem(left, right);\n\n while (i < j) {\n swapItem(i, j);\n i++;\n j--;\n while (std::get<axis>(points[i]) < t) i++;\n while (std::get<axis>(points[j]) > t) j--;\n }\n\n if (std::get<axis>(points[left]) == t)\n swapItem(left, j);\n else {\n j++;\n swapItem(j, right);\n }\n\n if (j <= k) left = j + 1;\n if (k <= j) right = j - 1;\n }\n }\n\n void swapItem(const TIndex i, const TIndex j) {\n std::iter_swap(ids.begin() + i, ids.begin() + j);\n std::iter_swap(points.begin() + i, points.begin() + j);\n }\n\n TNumber sqDist(const TNumber ax, const TNumber ay, const TNumber bx, const TNumber by) {\n const TNumber dx = ax - bx;\n const TNumber dy = ay - by;\n return dx * dx + dy * dy;\n }\n};\n\n} \/\/ namespace kdbush\n<commit_msg>avoid iterators copy in constructor<commit_after>#pragma once\n\n#include <algorithm>\n#include <cmath>\n#include <cstdint>\n#include <tuple>\n#include <vector>\n\nnamespace kdbush {\n\ntemplate <std::uint8_t I, typename T>\nstruct nth {\n inline static typename std::tuple_element<I, T>::type get(const T &t) {\n return std::get<I>(t);\n }\n};\n\ntemplate <typename TPoint, typename TIndex = std::size_t>\nclass KDBush {\n\npublic:\n using TNumber = decltype(nth<0, TPoint>::get(std::declval<TPoint>()));\n static_assert(\n std::is_same<TNumber, decltype(nth<1, TPoint>::get(std::declval<TPoint>()))>::value,\n \"point component types must be identical\");\n\n static const std::uint8_t defaultNodeSize = 64;\n\n KDBush(const std::vector<TPoint> &points_, const std::uint8_t nodeSize_ = defaultNodeSize)\n : KDBush(std::begin(points_), std::end(points_), nodeSize_) {\n }\n\n template <typename TPointIter>\n KDBush(const TPointIter &points_begin,\n const TPointIter &points_end,\n const std::uint8_t nodeSize_ = defaultNodeSize)\n : nodeSize(nodeSize_) {\n\n const TIndex size = std::distance(points_begin, points_end);\n\n points.reserve(size);\n ids.reserve(size);\n\n for (TIndex i = 0; i < size; i++) {\n const auto p = *(points_begin + i);\n points.emplace_back(nth<0, TPoint>::get(p), nth<1, TPoint>::get(p));\n ids.push_back(i);\n }\n\n sortKD(0, size - 1, 0);\n }\n\n template <typename TOutputIter>\n void range(const TNumber minX,\n const TNumber minY,\n const TNumber maxX,\n const TNumber maxY,\n TOutputIter out) {\n range(minX, minY, maxX, maxY, out, 0, ids.size() - 1, 0);\n }\n\n template <typename TOutputIter>\n void within(const TNumber qx, const TNumber qy, const TNumber r, TOutputIter out) {\n within(qx, qy, r, out, 0, ids.size() - 1, 0);\n }\n\nprivate:\n std::vector<TIndex> ids;\n std::vector<std::pair<TNumber, TNumber>> points;\n std::uint8_t nodeSize;\n\n template <typename TOutputIter>\n void range(const TNumber minX,\n const TNumber minY,\n const TNumber maxX,\n const TNumber maxY,\n TOutputIter out,\n const TIndex left,\n const TIndex right,\n const std::uint8_t axis) {\n\n if (right - left <= nodeSize) {\n for (auto i = left; i <= right; i++) {\n const TNumber x = std::get<0>(points[i]);\n const TNumber y = std::get<1>(points[i]);\n if (x >= minX && x <= maxX && y >= minY && y <= maxY) *out++ = ids[i];\n }\n return;\n }\n\n const TIndex m = (left + right) >> 1;\n const TNumber x = std::get<0>(points[m]);\n const TNumber y = std::get<1>(points[m]);\n\n if (x >= minX && x <= maxX && y >= minY && y <= maxY) *out++ = ids[m];\n\n if (axis == 0 ? minX <= x : minY <= y)\n range(minX, minY, maxX, maxY, out, left, m - 1, (axis + 1) % 2);\n\n if (axis == 0 ? maxX >= x : maxY >= y)\n range(minX, minY, maxX, maxY, out, m + 1, right, (axis + 1) % 2);\n }\n\n template <typename TOutputIter>\n void within(const TNumber qx,\n const TNumber qy,\n const TNumber r,\n TOutputIter out,\n const TIndex left,\n const TIndex right,\n const std::uint8_t axis) {\n\n const TNumber r2 = r * r;\n\n if (right - left <= nodeSize) {\n for (auto i = left; i <= right; i++) {\n const TNumber x = std::get<0>(points[i]);\n const TNumber y = std::get<1>(points[i]);\n if (sqDist(x, y, qx, qy) <= r2) *out++ = ids[i];\n }\n return;\n }\n\n const TIndex m = (left + right) >> 1;\n const TNumber x = std::get<0>(points[m]);\n const TNumber y = std::get<1>(points[m]);\n\n if (sqDist(x, y, qx, qy) <= r2) *out++ = ids[m];\n\n if (axis == 0 ? qx - r <= x : qy - r <= y)\n within(qx, qy, r, out, left, m - 1, (axis + 1) % 2);\n\n if (axis == 0 ? qx + r >= x : qy + r >= y)\n within(qx, qy, r, out, m + 1, right, (axis + 1) % 2);\n }\n\n void sortKD(const TIndex left, const TIndex right, const std::uint8_t axis) {\n if (right - left <= nodeSize) return;\n const TIndex m = (left + right) >> 1;\n if (axis == 0) {\n select<0>(m, left, right);\n } else {\n select<1>(m, left, right);\n }\n sortKD(left, m - 1, (axis + 1) % 2);\n sortKD(m + 1, right, (axis + 1) % 2);\n }\n\n template <std::uint8_t axis>\n void select(const TIndex k, TIndex left, TIndex right) {\n\n while (right > left) {\n if (right - left > 600) {\n const TIndex n = right - left + 1;\n const TIndex m = k - left + 1;\n const double z = log(n);\n const double s = 0.5 * exp(2 * z \/ 3);\n const double sd = 0.5 * sqrt(z * s * (n - s) \/ n) * (2 * m < n ? -1 : 1);\n const TIndex newLeft = std::max(left, TIndex(k - m * s \/ n + sd));\n const TIndex newRight = std::min(right, TIndex(k + (n - m) * s \/ n + sd));\n select<axis>(k, newLeft, newRight);\n }\n\n const TNumber t = std::get<axis>(points[k]);\n TIndex i = left;\n TIndex j = right;\n\n swapItem(left, k);\n if (std::get<axis>(points[right]) > t) swapItem(left, right);\n\n while (i < j) {\n swapItem(i, j);\n i++;\n j--;\n while (std::get<axis>(points[i]) < t) i++;\n while (std::get<axis>(points[j]) > t) j--;\n }\n\n if (std::get<axis>(points[left]) == t)\n swapItem(left, j);\n else {\n j++;\n swapItem(j, right);\n }\n\n if (j <= k) left = j + 1;\n if (k <= j) right = j - 1;\n }\n }\n\n void swapItem(const TIndex i, const TIndex j) {\n std::iter_swap(ids.begin() + i, ids.begin() + j);\n std::iter_swap(points.begin() + i, points.begin() + j);\n }\n\n TNumber sqDist(const TNumber ax, const TNumber ay, const TNumber bx, const TNumber by) {\n const TNumber dx = ax - bx;\n const TNumber dy = ay - by;\n return dx * dx + dy * dy;\n }\n};\n\n} \/\/ namespace kdbush\n<|endoftext|>"} {"text":"<commit_before>#include <iostream> \n#include <string> \n#include <fstream> \n#include <cstdint> \n\nusing namespace std;\n\ntemplate <typename T>\nstruct Node\n{\n\tNode *left;\n\tNode *right;\n\tT data;\n};\n\ntemplate <typename T>\nclass BinaryTree;\n\ntemplate <typename T>\nstd::ostream& operator<<(std::ostream&, const BinaryTree<T>&);\n\ntemplate <typename T>\nclass BinaryTree\n{\nprivate:\n\tNode<T>*root;\n\tint count = 0;\npublic:\n\tBinaryTree();\n\t~BinaryTree();\n\tNode<T>* root_();\n\tunsigned int getCount()const;\n\tNode<T> *findNode(const T&, Node<T>*)const;\n\tvoid insertNode(const T&x);\n\tvoid deleteNode(Node<T>* temp);\n\tbool removeElement(Node<T>* parent, Node<T>* current, const T& val);\n\tbool deleteValue(const T& value);\n\tvoid write(const std::string& filename)const;\n\tfriend std::ostream& operator<<<>(std::ostream&, const BinaryTree<T>&);\n};\n\ntemplate <typename T>\nBinaryTree<T>::BinaryTree()\n{\n\troot = nullptr;\n}\n\ntemplate<typename T>\nNode<T>* BinaryTree<T>::root_()\n{\n\treturn root;\n}\n\ntemplate <typename T>\nBinaryTree<T>::~BinaryTree()\n{\n\tdeleteNode(root);\n}\n\ntemplate <typename T>\nunsigned int BinaryTree<T>::getCount()const\n{\n\treturn count;\n}\n\ntemplate<typename T>\nNode<T>* BinaryTree<T>::findNode(const T& data, Node<T>* temp) const\n{\n\tif (temp == 0 || data == temp->data)\n\t\treturn temp;\n\tif (data > temp->data)\n\t\treturn findNode(data, temp->right);\n\telse\n\t\treturn findNode(data, temp->left);\n}\n\ntemplate<typename T>\nvoid BinaryTree<T>::insertNode(const T&x)\n{\n\tif (findNode(x, root_())) return;\n\tNode<T>* Tree = new Node<T>;\n\tTree->data = x;\n\tTree->left = Tree->right = 0;\n\tNode<T>* buff = root;\n\tNode<T>* temp = root;\n\twhile (temp)\n\t{\n\t\tbuff = temp;\n\t\tif (x < temp->data)\n\t\t\ttemp = temp->left;\n\t\telse\n\t\t\ttemp = temp->right;\n\t}\n\tif (!buff)\n\t\troot = Tree;\n\telse\n\t{\n\t\tif (x < buff->data)\n\t\t\tbuff->left = Tree;\n\t\telse\n\t\t\tbuff->right = Tree;\n\t}\n\t++count;\n}\n\n\n\ntemplate<typename T>\nvoid BinaryTree<T>::write(const std::string& filename)const\n{\n\tofstream file_1(filename);\n\tfile_1 << count << \"\\t\";\n\toutput(file_1, root);\n\tfile_1.close();\n}\n\ntemplate<typename T>\nvoid BinaryTree<T>::deleteNode(Node<T>* temp)\n{\n\tif (!temp)\n\t\treturn;\n\tif (temp->left)\n\t{\n\t\tdeleteNode(temp->left);\n\t\ttemp->left = nullptr;\n\t}\n\n\tif (temp->right)\n\t{\n\t\tdeleteNode(temp->right);\n\t\ttemp->right = nullptr;\n\t}\n\tdelete temp;\n}\n\ntemplate <typename T>\nstd::ostream& output(std::ostream& out, const Node<T>* node, unsigned int level)\n{\n\tif (!node)\n\t\treturn out;\n\toutput(out, node->right, level + 1);\n\tfor (unsigned int i = 0; i < level; i++)\n\t\tout << \"\\t\";\n\tout << node->data << std::endl;\n\toutput(out, node->left, level + 1);\n\treturn out;\n}\n\ntemplate<typename T>\nbool BinaryTree<T>::removeElement(Node<T>* parent, Node<T>* current, const T& val)\n{\n\tif (!current) return false;\n\tif (current->data == val)\n\t{\n\t\tif (current->left == NULL || current->right == NULL) {\n\t\t\tNode<T>* temp = current->left;\n\t\t\tif (current->right) temp = current->right;\n\t\t\tif (parent) {\n\t\t\t\tif (parent->left == current) {\n\t\t\t\t\tparent->left = temp;\n\t\t\t\t}\n\t\t\t\telse {\n\t\t\t\t\tparent->right = temp;\n\t\t\t\t}\n\t\t\t}\n\t\t\telse {\n\t\t\t\tthis->root = temp;\n\t\t\t}\n\t\t}\n\t\t\/*else {\n\t\t\tNode<T>* validSubs = current->right;\n\t\t\twhile (validSubs->left) {\n\t\t\t\tvalidSubs = validSubs->left;\n\t\t\t}\n\t\t\tT temp = current->data;\n\t\t\tcurrent->data = validSubs->data;\n\t\t\tvalidSubs->data = temp;\n\t\t\treturn removeElement(current, current->right, temp);\n\t\t}*\/\n\t\telse {\n\t\t\tNode<T>* validSubs = current->left;\n\t\t\twhile (validSubs->right) {\n\t\t\t\tvalidSubs = validSubs->right;\n\t\t\t}\n\t\t\tvalidSubs->right = current->right->left;\n\t\t\tcurrent->right->left = current->left;\n\t\t\tif (parent->left == current)\n\t\t\t\tparent->left = current->right;\n\t\t\telse\n\t\t\t\tparent->right = current->right;\n\t\t}\n\t\tdelete current;\n\t\tcount--;\n\t\treturn true;\n\t}\n\tif (current->data > val)\n\t\treturn removeElement(current, current->left, val);\n\telse\n\t\treturn removeElement(current, current->right, val);\n}\n\ntemplate<typename T>\nbool BinaryTree<T>::deleteValue(const T& value)\n{\n\treturn this->removeElement(NULL, root, value);\n}\n\n\ntemplate <typename T>\nstd::ostream& operator<<(std::ostream& out, const BinaryTree<T>& temp)\n{\n\toutput(out, temp.root, 0);\n\treturn out;\n}\n<commit_msg>Create matrix.hpp<commit_after>#include <iostream> \n#include <string> \n#include <fstream> \n#include <cstdint> \n\nusing namespace std;\n\ntemplate <typename T>\nstruct Node\n{\n\tNode *left;\n\tNode *right;\n\tT data;\n};\n\ntemplate <typename T>\nclass BinaryTree;\n\ntemplate <typename T>\nstd::ostream& operator<<(std::ostream&, const BinaryTree<T>&);\n\ntemplate <typename T>\nclass BinaryTree\n{\nprivate:\n\tNode<T>*root;\n\tint count = 0;\npublic:\n\tBinaryTree();\n\t~BinaryTree();\n\tNode<T>* root_();\n\tunsigned int getCount()const;\n\tNode<T> *findNode(const T&, Node<T>*)const;\n\tvoid insertNode(const T&x);\n\tvoid deleteNode(Node<T>* temp);\n\tbool removeElement(Node<T>* parent, Node<T>* current, const T& val);\n\tbool deleteValue(const T& value);\n\tvoid write(const std::string& filename)const;\n\tfriend std::ostream& operator<<<>(std::ostream&, const BinaryTree<T>&);\n};\n\ntemplate <typename T>\nBinaryTree<T>::BinaryTree()\n{\n\troot = nullptr;\n}\n\ntemplate<typename T>\nNode<T>* BinaryTree<T>::root_()\n{\n\treturn root;\n}\n\ntemplate <typename T>\nBinaryTree<T>::~BinaryTree()\n{\n\tdeleteNode(root);\n}\n\ntemplate <typename T>\nunsigned int BinaryTree<T>::getCount()const\n{\n\treturn count;\n}\n\ntemplate<typename T>\nNode<T>* BinaryTree<T>::findNode(const T& data, Node<T>* temp) const\n{\n\tif (temp == 0 || data == temp->data)\n\t\treturn temp;\n\tif (data > temp->data)\n\t\treturn findNode(data, temp->right);\n\telse\n\t\treturn findNode(data, temp->left);\n}\n\ntemplate<typename T>\nvoid BinaryTree<T>::insertNode(const T&x)\n{\n\tif (findNode(x, root_())) return;\n\tNode<T>* Tree = new Node<T>;\n\tTree->data = x;\n\tTree->left = Tree->right = 0;\n\tNode<T>* buff = root;\n\tNode<T>* temp = root;\n\twhile (temp)\n\t{\n\t\tbuff = temp;\n\t\tif (x < temp->data)\n\t\t\ttemp = temp->left;\n\t\telse\n\t\t\ttemp = temp->right;\n\t}\n\tif (!buff)\n\t\troot = Tree;\n\telse\n\t{\n\t\tif (x < buff->data)\n\t\t\tbuff->left = Tree;\n\t\telse\n\t\t\tbuff->right = Tree;\n\t}\n\t++count;\n}\n\n\n\ntemplate<typename T>\nvoid BinaryTree<T>::write(const std::string& filename)const\n{\n\tofstream file_1(filename);\n\tfile_1 << count << \"\\t\";\n\toutput(file_1, root);\n\tfile_1.close();\n}\n\ntemplate<typename T>\nvoid BinaryTree<T>::deleteNode(Node<T>* temp)\n{\n\tif (!temp)\n\t\treturn;\n\tif (temp->left)\n\t{\n\t\tdeleteNode(temp->left);\n\t\ttemp->left = nullptr;\n\t}\n\n\tif (temp->right)\n\t{\n\t\tdeleteNode(temp->right);\n\t\ttemp->right = nullptr;\n\t}\n\tdelete temp;\n}\n\ntemplate <typename T>\nstd::ostream& output(std::ostream& out, const Node<T>* node, unsigned int level)\n{\n\tif (!node)\n\t\treturn out;\n\toutput(out, node->right, level + 1);\n\tfor (unsigned int i = 0; i < level; i++)\n\t\tout << \"\\t\";\n\tout << node->data << std::endl;\n\toutput(out, node->left, level + 1);\n\treturn out;\n}\n\ntemplate<typename T>\nbool BinaryTree<T>::removeElement(Node<T>* parent, Node<T>* current, const T& val)\n{\n\tif (!current) return false;\n\tif (current->data == val)\n\t{\n\t\tif (current->left == NULL || current->right == NULL) {\n\t\t\tNode<T>* temp = current->left;\n\t\t\tif (current->right) temp = current->right;\n\t\t\tif (parent) {\n\t\t\t\tif (parent->left == current) {\n\t\t\t\t\tparent->left = temp;\n\t\t\t\t}\n\t\t\t\telse {\n\t\t\t\t\tparent->right = temp;\n\t\t\t\t}\n\t\t\t}\n\t\t\telse {\n\t\t\t\tthis->root = temp;\n\t\t\t}\n\t\t}\n\t\t\/*else {\n\t\t\tNode<T>* validSubs = current->right;\n\t\t\twhile (validSubs->left) {\n\t\t\t\tvalidSubs = validSubs->left;\n\t\t\t}\n\t\t\tT temp = current->data;\n\t\t\tcurrent->data = validSubs->data;\n\t\t\tvalidSubs->data = temp;\n\t\t\treturn removeElement(current, current->right, temp);\n\t\t}*\/\n\t\telse {\n\t\t\tNode<T>* validSubs = current->left;\n\t\t\twhile (validSubs->right) {\n\t\t\t\tvalidSubs = validSubs->right;\n\t\t\t}\n\t\t\tvalidSubs->right = current->right->left;\n\t\t\tcurrent->right->left = nullptr;\n\t\t\tcurrent->right->left = current->left;\n\t\t\tif (parent->left == current)\n\t\t\t\tparent->left = current->right;\n\t\t\telse\n\t\t\t\tparent->right = current->right;\n\t\t}\n\t\tdelete current;\n\t\tcount--;\n\t\treturn true;\n\t}\n\tif (current->data > val)\n\t\treturn removeElement(current, current->left, val);\n\telse\n\t\treturn removeElement(current, current->right, val);\n}\n\ntemplate<typename T>\nbool BinaryTree<T>::deleteValue(const T& value)\n{\n\treturn this->removeElement(NULL, root, value);\n}\n\n\ntemplate <typename T>\nstd::ostream& operator<<(std::ostream& out, const BinaryTree<T>& temp)\n{\n\toutput(out, temp.root, 0);\n\treturn out;\n}\n<|endoftext|>"} {"text":"<commit_before>#ifdef _MSC_VER\n#pragma warning(disable:4244)\n#pragma warning(disable:4267)\n#pragma warning(disable:4996)\n#endif\n\n#ifdef NDEBUG\n#undef NDEBUG\n#endif\n\n#include <stdlib.h>\n\n#include <boost\/program_options.hpp>\nnamespace po = boost::program_options;\n\n#include <vw\/FileIO.h>\n#include <vw\/Image.h>\n#include <vw\/Math.h>\n#include <vw\/Stereo.h>\n#include <vw\/Cartography.h>\nusing namespace vw;\nusing namespace vw::stereo;\nusing namespace vw::cartography;\n\n#include \"stereo.h\"\n#include \"DEM.h\"\n#include \"nff_terrain.h\"\n#include \"OrthoRasterizer.h\"\n\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\nclass PointTransFunc : public ReturnFixedType<Vector3> {\n Matrix3x3 m_trans;\npublic:\n PointTransFunc(Matrix3x3 trans) : m_trans(trans) {}\n Vector3 operator() (Vector3 const& pt) const { return m_trans*pt; }\n};\n\n\nint main( int argc, char *argv[] ) {\n set_debug_level(VerboseDebugMessage+11);\n\n std::string input_file_name, out_prefix, output_file_type, texture_filename;\n unsigned cache_size, max_triangles;\n float dem_spacing, default_value=0;\n unsigned simplemesh_h_step, simplemesh_v_step;\n int debug_level;\n double semi_major, semi_minor;\n std::string reference_spheroid;\n double phi_rot, omega_rot, kappa_rot;\n std::string rot_order;\n double proj_lat=0, proj_lon=0, proj_scale=1;\n double z_offset;\n unsigned utm_zone;\n\n po::options_description desc(\"Options\");\n desc.add_options()\n (\"help\", \"Display this help message\")\n (\"default-value\", po::value<float>(&default_value), \"Explicitly set the default (missing pixel) value. By default, the min z value is used.\")\n (\"use-alpha\", \"Create images that have an alpha channel\")\n (\"dem-spacing,s\", po::value<float>(&dem_spacing)->default_value(0), \"Set the DEM post size (if this value is 0, the post spacing size is computed for you)\")\n (\"normalized,n\", \"Also write a normalized version of the DEM (for debugging)\") \n (\"orthoimage\", po::value<std::string>(&texture_filename), \"Write an orthoimage based on the texture file given as an argument to this command line option\")\n (\"grayscale\", \"Use grayscale image processing for creating the orthoimage\")\n (\"offset-files\", \"Also write a pair of ascii offset files (for debugging)\") \n (\"cache\", po::value<unsigned>(&cache_size)->default_value(1024), \"Cache size, in megabytes\")\n (\"input-file\", po::value<std::string>(&input_file_name), \"Explicitly specify the input file\")\n (\"texture-file\", po::value<std::string>(&texture_filename), \"Specify texture filename\")\n (\"output-prefix,o\", po::value<std::string>(&out_prefix)->default_value(\"terrain\"), \"Specify the output prefix\")\n (\"output-filetype,t\", po::value<std::string>(&output_file_type)->default_value(\"tif\"), \"Specify the output file\")\n (\"debug-level,d\", po::value<int>(&debug_level)->default_value(vw::DebugMessage-1), \"Set the debugging output level. (0-50+)\")\n (\"xyz-to-lonlat\", \"Convert from xyz coordinates to longitude, latitude, altitude coordinates.\")\n (\"reference-spheroid,r\", po::value<std::string>(&reference_spheroid)->default_value(\"\"),\"Set a reference surface to a hard coded value (one of [moon , mars]. This will override manually set datum information.\")\n (\"semi-major-axis\", po::value<double>(&semi_major)->default_value(0),\"Set the dimensions of the datum.\")\n (\"semi-minor-axis\", po::value<double>(&semi_minor)->default_value(0),\"Set the dimensions of the datum.\")\n (\"z-offset\", po::value<double>(&z_offset)->default_value(0), \"Add a vertical offset to the DEM\")\n\n (\"sinusoidal\", \"Save using a sinusoidal projection\")\n (\"mercator\", \"Save using a Mercator projection\")\n (\"transverse-mercator\", \"Save using a transverse Mercator projection\")\n (\"orthographic\", \"Save using an orthographic projection\")\n (\"stereographic\", \"Save using a stereographic projection\")\n (\"lambert-azimuthal\", \"Save using a Lambert azimuthal projection\")\n (\"utm\", po::value<unsigned>(&utm_zone), \"Save using a UTM projection with the given zone\")\n (\"proj-lat\", po::value<double>(&proj_lat), \"The center of projection latitude (if applicable)\")\n (\"proj-lon\", po::value<double>(&proj_lon), \"The center of projection longitude (if applicable)\")\n (\"proj-scale\", po::value<double>(&proj_scale), \"The projection scale (if applicable)\")\n\n (\"rotation-order\", po::value<std::string>(&rot_order)->default_value(\"xyz\"),\"Set the order of an euler angle rotation applied to the 3D points prior to DEM rasterization\")\n (\"phi-rotation\", po::value<double>(&phi_rot)->default_value(0),\"Set a rotation angle phi\")\n (\"omega-rotation\", po::value<double>(&omega_rot)->default_value(0),\"Set a rotation angle omega\")\n (\"kappa-rotation\", po::value<double>(&kappa_rot)->default_value(0),\"Set a rotation angle kappa\");\n \n po::positional_options_description p;\n p.add(\"input-file\", 1);\n\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 \/\/ Set the Vision Workbench debug level\n set_debug_level(debug_level);\n Cache::system_cache().resize( cache_size*1024*1024 ); \n\n if( vm.count(\"help\") ) {\n std::cout << desc << std::endl;\n return 1;\n }\n\n if( vm.count(\"input-file\") != 1 ) {\n std::cout << \"Error: Must specify exactly one pointcloud file and one texture file!\" << std::endl;\n std::cout << desc << std::endl;\n return 1;\n }\n\n DiskImageView<Vector3> point_disk_image(input_file_name);\n ImageViewRef<Vector3> point_image = point_disk_image;\n\n \/\/ Apply an (optional) rotation to the 3D points before building the mesh.\n if (phi_rot != 0 || omega_rot != 0 || kappa_rot != 0) {\n std::cout << \"Applying rotation sequence: \" << rot_order << \" Angles: \" << phi_rot << \" \" << omega_rot << \" \" << kappa_rot << \"\\n\";\n Matrix3x3 rotation_trans = math::euler_to_rotation_matrix(phi_rot,omega_rot,kappa_rot,rot_order);\n point_image = per_pixel_filter(point_image, PointTransFunc(rotation_trans));\n }\n\n if (vm.count(\"xyz-to-lonlat\") ) {\n std::cout << \"Reprojecting points into longitude, latitude, altitude.\\n\";\n point_image = cartography::xyz_to_lon_lat_radius(point_image); \n }\n\n \/\/ Select a cartographic DATUM. There are several hard coded datums\n \/\/ that can be used here, or the user can specify their own.\n cartography::Datum datum;\n if ( reference_spheroid != \"\" ) {\n if (reference_spheroid == \"mars\") {\n const double MOLA_PEDR_EQUATORIAL_RADIUS = 3396000.0;\n std::cout << \"Re-referencing altitude values using standard MOLA spherical radius: \" << MOLA_PEDR_EQUATORIAL_RADIUS << \"\\n\";\n datum = cartography::Datum(\"Mars Datum\",\n \"MOLA PEDR Spheroid\",\n \"Prime Meridian\",\n MOLA_PEDR_EQUATORIAL_RADIUS,\n MOLA_PEDR_EQUATORIAL_RADIUS,\n 0.0);\n } else if (reference_spheroid == \"moon\") {\n const double LUNAR_RADIUS = 1737400;\n std::cout << \"Re-referencing altitude values using standard lunar spherical radius: \" << LUNAR_RADIUS << \"\\n\";\n datum = cartography::Datum(\"Lunar Datum\",\n \"Lunar Spheroid\",\n \"Prime Meridian\",\n LUNAR_RADIUS,\n LUNAR_RADIUS,\n 0.0);\n } else {\n std::cout << \"Unknown reference spheroid: \" << reference_spheroid << \". Current options are [ moon , mars ]\\nExiting.\\n\\n\";\n exit(0);\n }\n } else if (semi_major != 0 && semi_minor != 0) {\n std::cout << \"Re-referencing altitude values to user supplied datum. Semi-major: \" << semi_major << \" Semi-minor: \" << semi_minor << \"\\n\";\n datum = cartography::Datum(\"User Specified Datum\",\n \"User Specified Spherem\",\n \"Prime Meridian\",\n semi_major, semi_minor, 0.0);\n }\n\n \/\/ Set up the georeferencing information. We specify everything\n \/\/ here except for the affine transform, which is defined later once\n \/\/ we know the bounds of the orthorasterizer view. However, we can\n \/\/ still reproject the points in the point image without the affine\n \/\/ transform because this projection never requires us to convert to\n \/\/ or from pixel space.\n GeoReference georef(datum);\n\n \/\/ If the data was left in cartesian coordinates, we need to give\n \/\/ the DEM a projection that uses some physical units (meters),\n \/\/ rather than lon, lat. This is actually mainly for compatibility\n \/\/ with Viz, and it's sort of a hack, but it's left in for the time\n \/\/ being.\n \/\/\n \/\/ Otherwise, we honor the user's requested projection and convert\n \/\/ the points if necessary.\n if (!vm.count(\"xyz-to-lonlat\"))\n georef.set_mercator(0,0,1);\n else if( vm.count(\"sinusoidal\") ) georef.set_sinusoidal(proj_lon);\n else if( vm.count(\"mercator\") ) georef.set_mercator(proj_lat,proj_lon,proj_scale);\n else if( vm.count(\"transverse-mercator\") ) georef.set_transverse_mercator(proj_lat,proj_lon,proj_scale);\n else if( vm.count(\"orthographic\") ) georef.set_orthographic(proj_lat,proj_lon);\n else if( vm.count(\"stereographic\") ) georef.set_stereographic(proj_lat,proj_lon,proj_scale);\n else if( vm.count(\"lambert-azimuthal\") ) georef.set_lambert_azimuthal(proj_lat,proj_lon);\n else if( vm.count(\"utm\") ) georef.set_UTM( utm_zone );\n\n if (vm.count(\"xyz-to-lonlat\"))\n point_image = cartography::project_point_image(point_image, georef);\n\n \/\/ Rasterize the results to a temporary file on disk so as to speed\n \/\/ up processing in the orthorasterizer, which accesses each pixel\n \/\/ multiple times.\n DiskCacheImageView<Vector3> point_image_cache(point_image, \"tif\");\n \n \/\/ write out the DEM, texture, and extrapolation mask as\n \/\/ georeferenced files.\n vw::cartography::OrthoRasterizerView<PixelGray<float> > rasterizer(point_image_cache, select_channel(point_image_cache,2), dem_spacing);\n if (!vm.count(\"default-value\") ) {\n rasterizer.set_use_minz_as_default(true); \n } else {\n rasterizer.set_use_minz_as_default(false); \n rasterizer.set_default_value(default_value); \n }\n if (vm.count(\"use-alpha\")) {\n rasterizer.set_use_alpha(true);\n }\n\n vw::BBox<float,3> dem_bbox = rasterizer.bounding_box();\n std::cout << \"DEM Bounding box: \" << dem_bbox << \"\\n\";\n \n \/\/ Now we are ready to specify the affine transform.\n Matrix3x3 georef_affine_transform = rasterizer.geo_transform();\n std::cout << \"Georeferencing Transform: \" << georef_affine_transform << \"\\n\";\n georef.set_transform(georef_affine_transform);\n\n \/\/ This is a workaround for now to make GDAL write files that don't\n \/\/ cause it to crash on read. - mbroxton\n georef.set_datum(Datum());\n\n \/\/ Write out a georeferenced orthoimage of the DTM with alpha.\n if (vm.count(\"orthoimage\")) {\n rasterizer.set_use_minz_as_default(false);\n DiskImageView<PixelGray<float> > texture(texture_filename); \n rasterizer.set_texture(texture);\n BlockCacheView<PixelGray<float> > block_drg_raster(rasterizer, Vector2i(rasterizer.cols(), 2048));\n write_georeferenced_image(out_prefix + \"-DRG.tif\", channel_cast_rescale<uint8>(block_drg_raster), georef, TerminalProgressCallback() );\n\n } else {\n \/\/ Write out the DEM.\n std::cout << \"\\n\\n Creating block cache view from rasterizer: \" << rasterizer.cols() << \" \" << rasterizer.rows() << \"\\n\";\n BlockCacheView<PixelGray<float> > block_dem_raster(rasterizer, Vector2i(rasterizer.cols(), 2024));\n if (vm.count(\"z-offset\")) {\n std::cout << \"Adding the following z offset: \" << z_offset << \"\\n\";\n write_georeferenced_image(out_prefix + \"-DEM.\" + output_file_type, block_dem_raster + z_offset, georef, TerminalProgressCallback());\n } else {\n write_georeferenced_image(out_prefix + \"-DEM.\" + output_file_type, block_dem_raster, georef, TerminalProgressCallback());\n }\n\n \/\/ Write out a georeferenced DTM and (optionally) a normalized version of the DTM (for debugging)\n if (vm.count(\"normalized\")) {\n DiskImageView<PixelGray<float> > dem_image(out_prefix + \"-DEM.\" + output_file_type);\n write_georeferenced_image(out_prefix + \"-DEM-normalized.tif\", channel_cast_rescale<uint8>(normalize(dem_image)), georef, TerminalProgressCallback());\n }\n }\n\n if (vm.count(\"offset-files\")) {\n \/\/ Write out the offset files\n std::cout << \"Offset: \" << dem_bbox.min().x()\/rasterizer.spacing() << \" \" << dem_bbox.max().y()\/rasterizer.spacing() << \"\\n\";\n std::string offset_filename = out_prefix + \"-DRG.offset\";\n FILE* offset_file = fopen(offset_filename.c_str(), \"w\");\n fprintf(offset_file, \"%d\\n%d\\n\", int(dem_bbox.min().x()\/rasterizer.spacing()), -int(dem_bbox.max().y()\/rasterizer.spacing()));\n fclose(offset_file);\n offset_filename = out_prefix + \"-DEM-normalized.offset\";\n offset_file = fopen(offset_filename.c_str(), \"w\");\n fprintf(offset_file, \"%d\\n%d\\n\", int(dem_bbox.min().x()\/rasterizer.spacing()), -int(dem_bbox.max().y()\/rasterizer.spacing()));\n fclose(offset_file);\n }\n return 0;\n}\n<commit_msg>Fixed a masking bug when using a z-offset<commit_after>#ifdef _MSC_VER\n#pragma warning(disable:4244)\n#pragma warning(disable:4267)\n#pragma warning(disable:4996)\n#endif\n\n#ifdef NDEBUG\n#undef NDEBUG\n#endif\n\n#include <stdlib.h>\n\n#include <boost\/program_options.hpp>\nnamespace po = boost::program_options;\n\n#include <vw\/FileIO.h>\n#include <vw\/Image.h>\n#include <vw\/Math.h>\n#include <vw\/Stereo.h>\n#include <vw\/Cartography.h>\nusing namespace vw;\nusing namespace vw::stereo;\nusing namespace vw::cartography;\n\n#include \"stereo.h\"\n#include \"DEM.h\"\n#include \"nff_terrain.h\"\n#include \"OrthoRasterizer.h\"\n\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\nclass PointTransFunc : public ReturnFixedType<Vector3> {\n Matrix3x3 m_trans;\npublic:\n PointTransFunc(Matrix3x3 trans) : m_trans(trans) {}\n Vector3 operator() (Vector3 const& pt) const { return m_trans*pt; }\n};\n\n\nint main( int argc, char *argv[] ) {\n set_debug_level(VerboseDebugMessage+11);\n\n std::string input_file_name, out_prefix, output_file_type, texture_filename;\n unsigned cache_size, max_triangles;\n float dem_spacing, default_value=0;\n unsigned simplemesh_h_step, simplemesh_v_step;\n int debug_level;\n double semi_major, semi_minor;\n std::string reference_spheroid;\n double phi_rot, omega_rot, kappa_rot;\n std::string rot_order;\n double proj_lat=0, proj_lon=0, proj_scale=1;\n double z_offset;\n unsigned utm_zone;\n\n po::options_description desc(\"Options\");\n desc.add_options()\n (\"help\", \"Display this help message\")\n (\"default-value\", po::value<float>(&default_value), \"Explicitly set the default (missing pixel) value. By default, the min z value is used.\")\n (\"use-alpha\", \"Create images that have an alpha channel\")\n (\"dem-spacing,s\", po::value<float>(&dem_spacing)->default_value(0), \"Set the DEM post size (if this value is 0, the post spacing size is computed for you)\")\n (\"normalized,n\", \"Also write a normalized version of the DEM (for debugging)\") \n (\"orthoimage\", po::value<std::string>(&texture_filename), \"Write an orthoimage based on the texture file given as an argument to this command line option\")\n (\"grayscale\", \"Use grayscale image processing for creating the orthoimage\")\n (\"offset-files\", \"Also write a pair of ascii offset files (for debugging)\") \n (\"cache\", po::value<unsigned>(&cache_size)->default_value(1024), \"Cache size, in megabytes\")\n (\"input-file\", po::value<std::string>(&input_file_name), \"Explicitly specify the input file\")\n (\"texture-file\", po::value<std::string>(&texture_filename), \"Specify texture filename\")\n (\"output-prefix,o\", po::value<std::string>(&out_prefix)->default_value(\"terrain\"), \"Specify the output prefix\")\n (\"output-filetype,t\", po::value<std::string>(&output_file_type)->default_value(\"tif\"), \"Specify the output file\")\n (\"debug-level,d\", po::value<int>(&debug_level)->default_value(vw::DebugMessage-1), \"Set the debugging output level. (0-50+)\")\n (\"xyz-to-lonlat\", \"Convert from xyz coordinates to longitude, latitude, altitude coordinates.\")\n (\"reference-spheroid,r\", po::value<std::string>(&reference_spheroid)->default_value(\"\"),\"Set a reference surface to a hard coded value (one of [moon , mars]. This will override manually set datum information.\")\n (\"semi-major-axis\", po::value<double>(&semi_major)->default_value(0),\"Set the dimensions of the datum.\")\n (\"semi-minor-axis\", po::value<double>(&semi_minor)->default_value(0),\"Set the dimensions of the datum.\")\n (\"z-offset\", po::value<double>(&z_offset)->default_value(0), \"Add a vertical offset to the DEM\")\n\n (\"sinusoidal\", \"Save using a sinusoidal projection\")\n (\"mercator\", \"Save using a Mercator projection\")\n (\"transverse-mercator\", \"Save using a transverse Mercator projection\")\n (\"orthographic\", \"Save using an orthographic projection\")\n (\"stereographic\", \"Save using a stereographic projection\")\n (\"lambert-azimuthal\", \"Save using a Lambert azimuthal projection\")\n (\"utm\", po::value<unsigned>(&utm_zone), \"Save using a UTM projection with the given zone\")\n (\"proj-lat\", po::value<double>(&proj_lat), \"The center of projection latitude (if applicable)\")\n (\"proj-lon\", po::value<double>(&proj_lon), \"The center of projection longitude (if applicable)\")\n (\"proj-scale\", po::value<double>(&proj_scale), \"The projection scale (if applicable)\")\n\n (\"rotation-order\", po::value<std::string>(&rot_order)->default_value(\"xyz\"),\"Set the order of an euler angle rotation applied to the 3D points prior to DEM rasterization\")\n (\"phi-rotation\", po::value<double>(&phi_rot)->default_value(0),\"Set a rotation angle phi\")\n (\"omega-rotation\", po::value<double>(&omega_rot)->default_value(0),\"Set a rotation angle omega\")\n (\"kappa-rotation\", po::value<double>(&kappa_rot)->default_value(0),\"Set a rotation angle kappa\");\n \n po::positional_options_description p;\n p.add(\"input-file\", 1);\n\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 \/\/ Set the Vision Workbench debug level\n set_debug_level(debug_level);\n Cache::system_cache().resize( cache_size*1024*1024 ); \n\n if( vm.count(\"help\") ) {\n std::cout << desc << std::endl;\n return 1;\n }\n\n if( vm.count(\"input-file\") != 1 ) {\n std::cout << \"Error: Must specify exactly one pointcloud file and one texture file!\" << std::endl;\n std::cout << desc << std::endl;\n return 1;\n }\n\n DiskImageView<Vector3> point_disk_image(input_file_name);\n ImageViewRef<Vector3> point_image = point_disk_image;\n\n \/\/ Apply an (optional) rotation to the 3D points before building the mesh.\n if (phi_rot != 0 || omega_rot != 0 || kappa_rot != 0) {\n std::cout << \"Applying rotation sequence: \" << rot_order << \" Angles: \" << phi_rot << \" \" << omega_rot << \" \" << kappa_rot << \"\\n\";\n Matrix3x3 rotation_trans = math::euler_to_rotation_matrix(phi_rot,omega_rot,kappa_rot,rot_order);\n point_image = per_pixel_filter(point_image, PointTransFunc(rotation_trans));\n }\n\n if (vm.count(\"xyz-to-lonlat\") ) {\n std::cout << \"Reprojecting points into longitude, latitude, altitude.\\n\";\n point_image = cartography::xyz_to_lon_lat_radius(point_image); \n }\n\n \/\/ Select a cartographic DATUM. There are several hard coded datums\n \/\/ that can be used here, or the user can specify their own.\n cartography::Datum datum;\n if ( reference_spheroid != \"\" ) {\n if (reference_spheroid == \"mars\") {\n const double MOLA_PEDR_EQUATORIAL_RADIUS = 3396000.0;\n std::cout << \"Re-referencing altitude values using standard MOLA spherical radius: \" << MOLA_PEDR_EQUATORIAL_RADIUS << \"\\n\";\n datum = cartography::Datum(\"Mars Datum\",\n \"MOLA PEDR Spheroid\",\n \"Prime Meridian\",\n MOLA_PEDR_EQUATORIAL_RADIUS,\n MOLA_PEDR_EQUATORIAL_RADIUS,\n 0.0);\n } else if (reference_spheroid == \"moon\") {\n const double LUNAR_RADIUS = 1737400;\n std::cout << \"Re-referencing altitude values using standard lunar spherical radius: \" << LUNAR_RADIUS << \"\\n\";\n datum = cartography::Datum(\"Lunar Datum\",\n \"Lunar Spheroid\",\n \"Prime Meridian\",\n LUNAR_RADIUS,\n LUNAR_RADIUS,\n 0.0);\n } else {\n std::cout << \"Unknown reference spheroid: \" << reference_spheroid << \". Current options are [ moon , mars ]\\nExiting.\\n\\n\";\n exit(0);\n }\n } else if (semi_major != 0 && semi_minor != 0) {\n std::cout << \"Re-referencing altitude values to user supplied datum. Semi-major: \" << semi_major << \" Semi-minor: \" << semi_minor << \"\\n\";\n datum = cartography::Datum(\"User Specified Datum\",\n \"User Specified Spherem\",\n \"Prime Meridian\",\n semi_major, semi_minor, 0.0);\n }\n\n \/\/ Set up the georeferencing information. We specify everything\n \/\/ here except for the affine transform, which is defined later once\n \/\/ we know the bounds of the orthorasterizer view. However, we can\n \/\/ still reproject the points in the point image without the affine\n \/\/ transform because this projection never requires us to convert to\n \/\/ or from pixel space.\n GeoReference georef(datum);\n\n \/\/ If the data was left in cartesian coordinates, we need to give\n \/\/ the DEM a projection that uses some physical units (meters),\n \/\/ rather than lon, lat. This is actually mainly for compatibility\n \/\/ with Viz, and it's sort of a hack, but it's left in for the time\n \/\/ being.\n \/\/\n \/\/ Otherwise, we honor the user's requested projection and convert\n \/\/ the points if necessary.\n if (!vm.count(\"xyz-to-lonlat\"))\n georef.set_mercator(0,0,1);\n else if( vm.count(\"sinusoidal\") ) georef.set_sinusoidal(proj_lon);\n else if( vm.count(\"mercator\") ) georef.set_mercator(proj_lat,proj_lon,proj_scale);\n else if( vm.count(\"transverse-mercator\") ) georef.set_transverse_mercator(proj_lat,proj_lon,proj_scale);\n else if( vm.count(\"orthographic\") ) georef.set_orthographic(proj_lat,proj_lon);\n else if( vm.count(\"stereographic\") ) georef.set_stereographic(proj_lat,proj_lon,proj_scale);\n else if( vm.count(\"lambert-azimuthal\") ) georef.set_lambert_azimuthal(proj_lat,proj_lon);\n else if( vm.count(\"utm\") ) georef.set_UTM( utm_zone );\n\n if (vm.count(\"xyz-to-lonlat\"))\n point_image = cartography::project_point_image(point_image, georef);\n\n \/\/ Rasterize the results to a temporary file on disk so as to speed\n \/\/ up processing in the orthorasterizer, which accesses each pixel\n \/\/ multiple times.\n DiskCacheImageView<Vector3> point_image_cache(point_image, \"tif\");\n \n \/\/ write out the DEM, texture, and extrapolation mask as\n \/\/ georeferenced files.\n vw::cartography::OrthoRasterizerView<PixelGray<float> > rasterizer(point_image_cache, select_channel(point_image_cache,2), dem_spacing);\n if (!vm.count(\"default-value\") ) {\n rasterizer.set_use_minz_as_default(true); \n } else {\n rasterizer.set_use_minz_as_default(false); \n rasterizer.set_default_value(default_value); \n }\n\n if (vw.count(\"z-offset\")) {\n double val = rasterizer.default_value(); \n rasterizer.set_use_minz_as_default(false); \n rasterizer.set_default_value(val-z_offset); \n }\n\n if (vm.count(\"use-alpha\")) {\n rasterizer.set_use_alpha(true);\n }\n\n vw::BBox<float,3> dem_bbox = rasterizer.bounding_box();\n std::cout << \"DEM Bounding box: \" << dem_bbox << \"\\n\";\n \n \/\/ Now we are ready to specify the affine transform.\n Matrix3x3 georef_affine_transform = rasterizer.geo_transform();\n std::cout << \"Georeferencing Transform: \" << georef_affine_transform << \"\\n\";\n georef.set_transform(georef_affine_transform);\n\n \/\/ This is a workaround for now to make GDAL write files that don't\n \/\/ cause it to crash on read. - mbroxton\n georef.set_datum(Datum());\n\n \/\/ Write out a georeferenced orthoimage of the DTM with alpha.\n if (vm.count(\"orthoimage\")) {\n rasterizer.set_use_minz_as_default(false);\n DiskImageView<PixelGray<float> > texture(texture_filename); \n rasterizer.set_texture(texture);\n BlockCacheView<PixelGray<float> > block_drg_raster(rasterizer, Vector2i(rasterizer.cols(), 2048));\n write_georeferenced_image(out_prefix + \"-DRG.tif\", channel_cast_rescale<uint8>(block_drg_raster), georef, TerminalProgressCallback() );\n\n } else {\n \/\/ Write out the DEM.\n std::cout << \"\\n\\n Creating block cache view from rasterizer: \" << rasterizer.cols() << \" \" << rasterizer.rows() << \"\\n\";\n BlockCacheView<PixelGray<float> > block_dem_raster(rasterizer, Vector2i(rasterizer.cols(), 2024));\n if (vm.count(\"z-offset\")) {\n std::cout << \"Adding the following z offset: \" << z_offset << \"\\n\";\n write_georeferenced_image(out_prefix + \"-DEM.\" + output_file_type, block_dem_raster + z_offset, georef, TerminalProgressCallback());\n } else {\n write_georeferenced_image(out_prefix + \"-DEM.\" + output_file_type, block_dem_raster, georef, TerminalProgressCallback());\n }\n\n \/\/ Write out a georeferenced DTM and (optionally) a normalized version of the DTM (for debugging)\n if (vm.count(\"normalized\")) {\n DiskImageView<PixelGray<float> > dem_image(out_prefix + \"-DEM.\" + output_file_type);\n write_georeferenced_image(out_prefix + \"-DEM-normalized.tif\", channel_cast_rescale<uint8>(normalize(dem_image)), georef, TerminalProgressCallback());\n }\n }\n\n if (vm.count(\"offset-files\")) {\n \/\/ Write out the offset files\n std::cout << \"Offset: \" << dem_bbox.min().x()\/rasterizer.spacing() << \" \" << dem_bbox.max().y()\/rasterizer.spacing() << \"\\n\";\n std::string offset_filename = out_prefix + \"-DRG.offset\";\n FILE* offset_file = fopen(offset_filename.c_str(), \"w\");\n fprintf(offset_file, \"%d\\n%d\\n\", int(dem_bbox.min().x()\/rasterizer.spacing()), -int(dem_bbox.max().y()\/rasterizer.spacing()));\n fclose(offset_file);\n offset_filename = out_prefix + \"-DEM-normalized.offset\";\n offset_file = fopen(offset_filename.c_str(), \"w\");\n fprintf(offset_file, \"%d\\n%d\\n\", int(dem_bbox.min().x()\/rasterizer.spacing()), -int(dem_bbox.max().y()\/rasterizer.spacing()));\n fclose(offset_file);\n }\n return 0;\n}\n<|endoftext|>"} {"text":"<commit_before>\/*\r\n * problem1.cpp\r\n * 作成者：Kenshiro.H\r\n * 第8回　問題1改\r\n *\/\r\n#include <iostream>\r\n#include <iomanip> \/\/std::setw用\r\n#include <fstream> \/\/ファイル入出力用\r\n#include <vector> \/\/動的配列用\r\n#include <algorithm> \/\/std::max_element用\r\n\r\nint main(){\r\n\r\n using std::cout; \/\/ std::cout -> cout\r\n using std::endl; \/\/ std::endl -> endl\r\n\r\n \/\/\/ ファイル入力\r\n cout << \"File open\" << endl;\r\n std::fstream DATA(\"problem1data.txt\");\r\n\r\n \/\/\/ コスト，ペナルティ(ない場合はデータに0を記入)\r\n int COST,PENALTY;\r\n DATA >> COST >> PENALTY;\r\n cout << \"COST:\" << COST <<\" PENALTY:\" << PENALTY << endl;\r\n\r\n \/\/\/ 各要素をファイルから読み取り後、表示\r\n int x_max = 0 , y_max = 0;\r\n int G_i = 0, G_j = 0;\r\n DATA >> x_max >> y_max;\r\n std::vector<std::vector<double> > V( y_max+2 , std::vector<double>(x_max+2 , COST*100) ); \/\/周囲1個分確保する　全部コストよりもすごく小さい値で埋める\r\n\r\n for(int i=1; i < y_max+1; i++){\r\n for(int j=1; j < x_max+1; j++){\r\n DATA >> V[i][j];\r\n if( 1 != V[i][j]){\r\n V[i][j] = -10.0; \/\/ゴール以外の価値は-10.0\r\n }else{\r\n V[i][j] = 0.0; \/\/ゴールの価値は高い\r\n G_i = i; \/\/ゴールの場所を覚えておく\r\n G_j = j;\r\n }\r\n cout << std::setw(4) << V[i][j] << \" \";\r\n }\r\n cout << endl;\r\n }\r\n cout << endl << \"--START--\" << endl ;\r\n\r\n \/\/\/ 各要素の価値を価値反復を用いて計算\r\n int count = 0; \/\/ループ終了用カウント　前回と同じ値のセルが (x_max*y_max-1)と同じになったらループ終了\r\n std::vector<double> TEMP(4 , 0);\r\n while(count != (x_max*y_max)-1 ){\r\n count = 0;\r\n for(int i=1; i < y_max+1; i++){\r\n for(int j=1; j < x_max+1; j++){\r\n if( i != G_i || j != G_j ){\r\n \/\/cout << V[i-1][j] << \"|\" ;\r\n TEMP[0] = V[i-1][j] + COST; \/\/上\r\n \/\/cout << V[i][j-1] << \"|\" ;\r\n TEMP[1] = V[i][j-1] + COST; \/\/左\r\n \/\/cout << V[i+1][j] << \"|\" ;\r\n TEMP[2] = V[i+1][j] + COST; \/\/下\r\n \/\/cout << V[i][j+1] << \"|\" << endl;\r\n TEMP[3] = V[i][j+1] + COST; \/\/右\r\n for(int t=0; t<3 ; t++){\r\n if(TEMP[t]>TEMP[t+1]) TEMP[t+1]=TEMP[t]; \/\/上下左右で値が大きいものを残していく\r\n }\r\n if(V[i][j] == TEMP[3]) count += 1; \/\/前回と同じ値の場合は count +1\r\n V[i][j] = TEMP[3]; \/\/残された一番大きい値を代入\r\n TEMP.clear(); \/\/一時計算用配列　リセット\r\n }\r\n cout << std::setw(4) << V[i][j] << \" \" ;\r\n }\r\n cout << endl;\r\n }\r\n cout << endl;\r\n }\r\n cout << \"--END--\" << endl ;\r\n return 0;\r\n}\r\n<commit_msg>Update problem1.cpp<commit_after>\/*\r\n * problem1.cpp\r\n * 作成者：Kenshiro.H\r\n * 第8回　問題1改\r\n *\/\r\n#include <iostream>\r\n#include <iomanip> \/\/std::setw用\r\n#include <fstream> \/\/ファイル入出力用\r\n#include <vector> \/\/動的配列用\r\n#include <algorithm> \/\/std::max_element用\r\n\r\nint main(){\r\n\r\n using std::cout; \/\/ std::cout -> cout\r\n using std::endl; \/\/ std::endl -> endl\r\n\r\n \/\/\/ ファイル入力\r\n cout << \"File open\" << endl;\r\n std::fstream DATA(\"src\/problem1data.txt\");\r\n\r\n \/\/\/ コスト，ペナルティ(ない場合はデータに0を記入)\r\n int COST,PENALTY;\r\n DATA >> COST >> PENALTY;\r\n cout << \"COST:\" << COST <<\" PENALTY:\" << PENALTY << endl;\r\n\r\n \/\/\/ 各要素をファイルから読み取り後、表示\r\n int x_max = 0 , y_max = 0;\r\n int G_i = 0, G_j = 0;\r\n DATA >> x_max >> y_max;\r\n std::vector<std::vector<double> > V( y_max+2 , std::vector<double>(x_max+2 , COST*100) ); \/\/周囲1個分確保する　全部コストよりもすごく小さい値で埋める\r\n\r\n for(int i=1; i < y_max+1; i++){\r\n for(int j=1; j < x_max+1; j++){\r\n DATA >> V[i][j];\r\n if( 1 != V[i][j]){\r\n V[i][j] = -10.0; \/\/ゴール以外の価値は-10.0\r\n }else{\r\n V[i][j] = 0.0; \/\/ゴールの価値は高い\r\n G_i = i; \/\/ゴールの場所を覚えておく\r\n G_j = j;\r\n }\r\n cout << std::setw(4) << V[i][j] << \" \";\r\n }\r\n cout << endl;\r\n }\r\n cout << endl << \"--START--\" << endl ;\r\n\r\n \/\/\/ 各要素の価値を価値反復を用いて計算\r\n int count = 0; \/\/ループ終了用カウント　前回と同じ値のセルが (x_max*y_max-1)と同じになったらループ終了\r\n std::vector<double> TEMP(4 , 0);\r\n while(count != (x_max*y_max)-1 ){\r\n count = 0;\r\n for(int i=1; i < y_max+1; i++){\r\n for(int j=1; j < x_max+1; j++){\r\n if( i != G_i || j != G_j ){\r\n \/\/cout << V[i-1][j] << \"|\" ;\r\n TEMP[0] = V[i-1][j] + COST; \/\/上\r\n \/\/cout << V[i][j-1] << \"|\" ;\r\n TEMP[1] = V[i][j-1] + COST; \/\/左\r\n \/\/cout << V[i+1][j] << \"|\" ;\r\n TEMP[2] = V[i+1][j] + COST; \/\/下\r\n \/\/cout << V[i][j+1] << \"|\" << endl;\r\n TEMP[3] = V[i][j+1] + COST; \/\/右\r\n for(int t=0; t<3 ; t++){\r\n if(TEMP[t]>TEMP[t+1]) TEMP[t+1]=TEMP[t]; \/\/上下左右で値が大きいものを残していく\r\n }\r\n if(V[i][j] == TEMP[3]) count += 1; \/\/前回と同じ値の場合は count +1\r\n V[i][j] = TEMP[3]; \/\/残された一番大きい値を代入\r\n TEMP.clear(); \/\/一時計算用配列　リセット\r\n }\r\n cout << std::setw(4) << V[i][j] << \" \" ;\r\n }\r\n cout << endl;\r\n }\r\n cout << endl;\r\n }\r\n cout << \"--END--\" << endl ;\r\n return 0;\r\n}\r\n<|endoftext|>"} {"text":"<commit_before>\/\/ Module: Log4CPLUS\n\/\/ File: property.cxx\n\/\/ Created: 2\/2002\n\/\/ Author: Tad E. Smith\n\/\/\n\/\/\n\/\/ Copyright 2002-2015 Tad E. 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 <log4cplus\/config.hxx>\n\n#include <cstring>\n#if defined (UNICODE)\n# include <cwctype>\n#else\n# include <cctype>\n#endif\n#if defined (LOG4CPLUS_HAVE_CODECVT_UTF8_FACET) \\\n || defined (LOG4CPLUS_HAVE_CODECVT_UTF16_FACET) \\\n || defined (LOG4CPLUS_HAVE_CODECVT_UTF32_FACET)\n# include <codecvt>\n#endif\n#include <locale>\n#include <fstream>\n#include <sstream>\n#include <log4cplus\/streams.h>\n#include <log4cplus\/fstreams.h>\n#include <log4cplus\/helpers\/stringhelper.h>\n#include <log4cplus\/helpers\/property.h>\n#include <log4cplus\/internal\/internal.h>\n#include <log4cplus\/internal\/env.h>\n#include <log4cplus\/helpers\/loglog.h>\n\n#if defined (LOG4CPLUS_WITH_UNIT_TESTS)\n#include <catch.hpp>\n#endif\n\n\nnamespace log4cplus { namespace helpers {\n\n\nconst tchar Properties::PROPERTIES_COMMENT_CHAR = LOG4CPLUS_TEXT('#');\n\n\nnamespace\n{\n\n\nstatic\nint\nis_space (tchar ch)\n{\n#if defined (UNICODE)\n return std::iswspace (ch);\n#else\n return std::isspace (static_cast<unsigned char>(ch));\n#endif\n}\n\n\nstatic\nvoid\ntrim_leading_ws (tstring & str)\n{\n tstring::iterator it = str.begin ();\n for (; it != str.end (); ++it)\n {\n if (! is_space (*it))\n break;\n }\n str.erase (str.begin (), it);\n}\n\n\nstatic\nvoid\ntrim_trailing_ws (tstring & str)\n{\n tstring::reverse_iterator rit = str.rbegin ();\n for (; rit != str.rend (); ++rit)\n {\n if (! is_space (*rit))\n break;\n }\n str.erase (rit.base (), str.end ());\n}\n\n\nstatic\nvoid\ntrim_ws (tstring & str)\n{\n trim_trailing_ws (str);\n trim_leading_ws (str);\n}\n\n\n#if defined (LOG4CPLUS_WITH_UNIT_TESTS)\nCATCH_TEST_CASE( \"String trimming\", \"[strings][properties]\")\n{\n CATCH_SECTION (\"trim trailing whitespace\")\n {\n tstring trailing_ws (LOG4CPLUS_TEXT (\"abcd \\t\\n\\v\\f\\r\"));\n trim_trailing_ws (trailing_ws);\n CATCH_REQUIRE (trailing_ws == LOG4CPLUS_TEXT (\"abcd\"));\n }\n\n CATCH_SECTION (\"trim leading whitespace\")\n {\n tstring leading_ws (LOG4CPLUS_TEXT (\" \\t\\n\\v\\f\\rabcd\"));\n trim_leading_ws (leading_ws);\n CATCH_REQUIRE (leading_ws == LOG4CPLUS_TEXT (\"abcd\"));\n }\n\n CATCH_SECTION (\"trim all whitespace\")\n {\n tstring ws (LOG4CPLUS_TEXT (\" \\t\\n\\v\\f\\rabcd \\t\\n\\v\\f\\r\"));\n trim_ws (ws);\n CATCH_REQUIRE (ws == LOG4CPLUS_TEXT (\"abcd\"));\n }\n}\n#endif\n\n\nvoid\nimbue_file_from_flags (tistream & file, unsigned flags)\n{\n switch (flags & (Properties::fEncodingMask << Properties::fEncodingShift))\n {\n#if defined (LOG4CPLUS_HAVE_CODECVT_UTF8_FACET) && defined (UNICODE)\n case Properties::fUTF8:\n file.imbue (\n std::locale (file.getloc (),\n new std::codecvt_utf8<tchar, 0x10FFFF,\n static_cast<std::codecvt_mode>(std::consume_header | std::little_endian)>));\n break;\n#endif\n\n#if defined (LOG4CPLUS_HAVE_CODECVT_UTF16_FACET) && defined (UNICODE)\n case Properties::fUTF16:\n file.imbue (\n std::locale (file.getloc (),\n new std::codecvt_utf16<tchar, 0x10FFFF,\n static_cast<std::codecvt_mode>(std::consume_header | std::little_endian)>));\n break;\n\n#elif defined (UNICODE) && defined (WIN32)\n case Properties::fUTF16:\n file.imbue (\n std::locale (file.getloc (),\n \/\/ TODO: This should actually be a custom \"null\" facet\n \/\/ that just copies the chars to wchar_t buffer.\n new std::codecvt<wchar_t, char, std::mbstate_t>));\n break;\n\n#endif\n\n#if defined (LOG4CPLUS_HAVE_CODECVT_UTF32_FACET) && defined (UNICODE)\n case Properties::fUTF32:\n file.imbue (\n std::locale (file.getloc (),\n new std::codecvt_utf32<tchar, 0x10FFFF,\n static_cast<std::codecvt_mode>(std::consume_header | std::little_endian)>));\n break;\n#endif\n\n case Properties::fUnspecEncoding:;\n default:\n \/\/ Do nothing.\n ;\n }\n}\n\n\n} \/\/ namespace\n\n\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ Properties ctors and dtor\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nProperties::Properties()\n : flags (0)\n{\n}\n\n\n\nProperties::Properties(tistream& input)\n : flags (0)\n{\n init(input);\n}\n\n\n\nProperties::Properties(const tstring& inputFile, unsigned f)\n : flags (f)\n{\n if (inputFile.empty ())\n return;\n\n tifstream file;\n imbue_file_from_flags (file, flags);\n\n file.open(LOG4CPLUS_FSTREAM_PREFERED_FILE_NAME(inputFile).c_str(),\n std::ios::binary);\n if (! file.good ())\n helpers::getLogLog ().error (LOG4CPLUS_TEXT (\"could not open file \")\n + inputFile);\n\n init(file);\n}\n\n\n\nvoid\nProperties::init(tistream& input)\n{\n if (! input)\n return;\n\n tstring buffer;\n while (std::getline (input, buffer))\n {\n trim_leading_ws (buffer);\n\n tstring::size_type const buffLen = buffer.size ();\n if (buffLen == 0 || buffer[0] == PROPERTIES_COMMENT_CHAR)\n continue;\n\n \/\/ Check if we have a trailing \\r because we are\n \/\/ reading a properties file produced on Windows.\n if (buffer[buffLen-1] == LOG4CPLUS_TEXT('\\r'))\n \/\/ Remove trailing 'Windows' \\r.\n buffer.resize (buffLen - 1);\n\n tstring::size_type const idx = buffer.find(LOG4CPLUS_TEXT ('='));\n if (idx != tstring::npos)\n {\n tstring key = buffer.substr(0, idx);\n tstring value = buffer.substr(idx + 1);\n trim_trailing_ws (key);\n trim_ws (value);\n setProperty(key, value);\n }\n else if (buffer.compare (0, 7, LOG4CPLUS_TEXT (\"include\")) == 0\n && buffer.size () >= 7 + 1 + 1\n && is_space (buffer[7]))\n {\n tstring included (buffer, 8) ;\n trim_ws (included);\n\n tifstream file;\n imbue_file_from_flags (file, flags);\n\n file.open (LOG4CPLUS_FSTREAM_PREFERED_FILE_NAME(included).c_str(),\n std::ios::binary);\n if (! file.good ())\n helpers::getLogLog ().error (\n LOG4CPLUS_TEXT (\"could not open file \") + included);\n\n init (file);\n }\n }\n}\n\n\n\nProperties::~Properties()\n{\n}\n\n\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ helpers::Properties public methods\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n\nbool\nProperties::exists(const log4cplus::tstring& key) const\n{\n return data.find(key) != data.end();\n}\n\n\nbool\nProperties::exists(tchar const * key) const\n{\n return data.find(key) != data.end();\n}\n\n\ntstring const &\nProperties::getProperty(const tstring& key) const\n{\n return get_property_worker (key);\n}\n\n\nlog4cplus::tstring const &\nProperties::getProperty(tchar const * key) const\n{\n return get_property_worker (key);\n}\n\n\ntstring\nProperties::getProperty(const tstring& key, const tstring& defaultVal) const\n{\n StringMap::const_iterator it (data.find (key));\n if (it == data.end ())\n return defaultVal;\n else\n return it->second;\n}\n\n\nstd::vector<tstring>\nProperties::propertyNames() const\n{\n std::vector<tstring> tmp;\n tmp.reserve (data.size ());\n for (auto const & kv : data)\n tmp.push_back(kv.first);\n\n return tmp;\n}\n\n\n\nvoid\nProperties::setProperty(const log4cplus::tstring& key,\n const log4cplus::tstring& value)\n{\n data[key] = value;\n}\n\n\nbool\nProperties::removeProperty(const log4cplus::tstring& key)\n{\n return data.erase(key) > 0;\n}\n\n\nProperties\nProperties::getPropertySubset(const log4cplus::tstring& prefix) const\n{\n Properties ret;\n auto const prefix_len = prefix.size ();\n std::vector<tstring> keys = propertyNames();\n for (tstring const & key : keys)\n {\n int result = key.compare (0, prefix_len, prefix);\n if (result == 0)\n ret.setProperty (key.substr (prefix_len), getProperty(key));\n }\n\n return ret;\n}\n\n\nbool\nProperties::getInt (int & val, log4cplus::tstring const & key) const\n{\n return get_type_val_worker (val, key);\n}\n\n\nbool\nProperties::getUInt (unsigned & val, log4cplus::tstring const & key) const\n{\n return get_type_val_worker (val, key);\n}\n\n\nbool\nProperties::getLong (long & val, log4cplus::tstring const & key) const\n{\n return get_type_val_worker (val, key);\n}\n\n\nbool\nProperties::getULong (unsigned long & val, log4cplus::tstring const & key) const\n{\n return get_type_val_worker (val, key);\n}\n\n\nbool\nProperties::getBool (bool & val, log4cplus::tstring const & key) const\n{\n if (! exists (key))\n return false;\n\n log4cplus::tstring const & prop_val = getProperty (key);\n return internal::parse_bool (val, prop_val);\n}\n\n\nbool\nProperties::getString (log4cplus::tstring & val, log4cplus::tstring const & key)\n const\n{\n StringMap::const_iterator it (data.find (key));\n if (it == data.end ())\n return false;\n\n val = it->second;\n return true;\n}\n\n\ntemplate <typename StringType>\nlog4cplus::tstring const &\nProperties::get_property_worker (StringType const & key) const\n{\n StringMap::const_iterator it (data.find (key));\n if (it == data.end ())\n return log4cplus::internal::empty_str;\n else\n return it->second;\n}\n\n\ntemplate <typename ValType>\nbool\nProperties::get_type_val_worker (ValType & val, log4cplus::tstring const & key)\n const\n{\n if (! exists (key))\n return false;\n\n log4cplus::tstring const & prop_val = getProperty (key);\n log4cplus::tistringstream iss (prop_val);\n ValType tmp_val;\n tchar ch;\n\n iss >> tmp_val;\n if (! iss)\n return false;\n iss >> ch;\n if (iss)\n return false;\n\n val = tmp_val;\n return true;\n}\n\n\n#if defined (LOG4CPLUS_WITH_UNIT_TESTS)\nCATCH_TEST_CASE (\"Properties\", \"[properties]\")\n{\n Properties props;\n tistringstream iss (\n LOG4CPLUS_TEXT (\"bool=true\\r\\n\")\n LOG4CPLUS_TEXT (\"bool1=1\\n\")\n LOG4CPLUS_TEXT (\"int=-1\\n\")\n LOG4CPLUS_TEXT (\"uint=42\\n\")\n LOG4CPLUS_TEXT (\"long=-65537\\n\")\n LOG4CPLUS_TEXT (\"ulong=65537\")\n );\n Properties from_stream (iss);\n\n CATCH_SECTION (\"new object is empty\")\n {\n CATCH_REQUIRE (props.size () == 0);\n }\n\n CATCH_SECTION (\"added property can be retrieved\")\n {\n props.setProperty (LOG4CPLUS_TEXT (\"a.b.c\"), LOG4CPLUS_TEXT (\"true\"));\n CATCH_REQUIRE (props.getProperty (LOG4CPLUS_TEXT (\"a.b.c\"))\n == LOG4CPLUS_TEXT (\"true\"));\n }\n\n CATCH_SECTION (\"type conversions work\")\n {\n bool bool_;\n int int_;\n unsigned int uint;\n long long_;\n unsigned long ulong;\n\n CATCH_REQUIRE (from_stream.getBool (bool_, LOG4CPLUS_TEXT (\"bool\")));\n CATCH_REQUIRE (bool_);\n CATCH_REQUIRE (from_stream.getBool (bool_, LOG4CPLUS_TEXT (\"bool1\")));\n CATCH_REQUIRE (bool_);\n CATCH_REQUIRE (from_stream.getInt (int_, LOG4CPLUS_TEXT (\"int\")));\n CATCH_REQUIRE (int_ == -1);\n CATCH_REQUIRE (from_stream.getUInt (uint, LOG4CPLUS_TEXT (\"uint\")));\n CATCH_REQUIRE (uint == 42);\n CATCH_REQUIRE (from_stream.getLong (long_, LOG4CPLUS_TEXT (\"long\")));\n CATCH_REQUIRE (long_ == -65537);\n CATCH_REQUIRE (from_stream.getULong (ulong, LOG4CPLUS_TEXT (\"ulong\")));\n CATCH_REQUIRE (ulong == 65537);\n }\n}\n#endif\n\n\n} } \/\/ namespace log4cplus { namespace helpers {\n<commit_msg>Improve unit test coverage for Properties.<commit_after>\/\/ Module: Log4CPLUS\n\/\/ File: property.cxx\n\/\/ Created: 2\/2002\n\/\/ Author: Tad E. Smith\n\/\/\n\/\/\n\/\/ Copyright 2002-2015 Tad E. 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 <log4cplus\/config.hxx>\n\n#include <cstring>\n#if defined (UNICODE)\n# include <cwctype>\n#else\n# include <cctype>\n#endif\n#if defined (LOG4CPLUS_HAVE_CODECVT_UTF8_FACET) \\\n || defined (LOG4CPLUS_HAVE_CODECVT_UTF16_FACET) \\\n || defined (LOG4CPLUS_HAVE_CODECVT_UTF32_FACET)\n# include <codecvt>\n#endif\n#include <locale>\n#include <fstream>\n#include <sstream>\n#include <log4cplus\/streams.h>\n#include <log4cplus\/fstreams.h>\n#include <log4cplus\/helpers\/stringhelper.h>\n#include <log4cplus\/helpers\/property.h>\n#include <log4cplus\/internal\/internal.h>\n#include <log4cplus\/internal\/env.h>\n#include <log4cplus\/helpers\/loglog.h>\n\n#if defined (LOG4CPLUS_WITH_UNIT_TESTS)\n#include <catch.hpp>\n#endif\n\n\nnamespace log4cplus { namespace helpers {\n\n\nconst tchar Properties::PROPERTIES_COMMENT_CHAR = LOG4CPLUS_TEXT('#');\n\n\nnamespace\n{\n\n\nstatic\nint\nis_space (tchar ch)\n{\n#if defined (UNICODE)\n return std::iswspace (ch);\n#else\n return std::isspace (static_cast<unsigned char>(ch));\n#endif\n}\n\n\nstatic\nvoid\ntrim_leading_ws (tstring & str)\n{\n tstring::iterator it = str.begin ();\n for (; it != str.end (); ++it)\n {\n if (! is_space (*it))\n break;\n }\n str.erase (str.begin (), it);\n}\n\n\nstatic\nvoid\ntrim_trailing_ws (tstring & str)\n{\n tstring::reverse_iterator rit = str.rbegin ();\n for (; rit != str.rend (); ++rit)\n {\n if (! is_space (*rit))\n break;\n }\n str.erase (rit.base (), str.end ());\n}\n\n\nstatic\nvoid\ntrim_ws (tstring & str)\n{\n trim_trailing_ws (str);\n trim_leading_ws (str);\n}\n\n\n#if defined (LOG4CPLUS_WITH_UNIT_TESTS)\nCATCH_TEST_CASE( \"String trimming\", \"[strings][properties]\")\n{\n CATCH_SECTION (\"trim trailing whitespace\")\n {\n tstring trailing_ws (LOG4CPLUS_TEXT (\"abcd \\t\\n\\v\\f\\r\"));\n trim_trailing_ws (trailing_ws);\n CATCH_REQUIRE (trailing_ws == LOG4CPLUS_TEXT (\"abcd\"));\n }\n\n CATCH_SECTION (\"trim leading whitespace\")\n {\n tstring leading_ws (LOG4CPLUS_TEXT (\" \\t\\n\\v\\f\\rabcd\"));\n trim_leading_ws (leading_ws);\n CATCH_REQUIRE (leading_ws == LOG4CPLUS_TEXT (\"abcd\"));\n }\n\n CATCH_SECTION (\"trim all whitespace\")\n {\n tstring ws (LOG4CPLUS_TEXT (\" \\t\\n\\v\\f\\rabcd \\t\\n\\v\\f\\r\"));\n trim_ws (ws);\n CATCH_REQUIRE (ws == LOG4CPLUS_TEXT (\"abcd\"));\n }\n}\n#endif\n\n\nvoid\nimbue_file_from_flags (tistream & file, unsigned flags)\n{\n switch (flags & (Properties::fEncodingMask << Properties::fEncodingShift))\n {\n#if defined (LOG4CPLUS_HAVE_CODECVT_UTF8_FACET) && defined (UNICODE)\n case Properties::fUTF8:\n file.imbue (\n std::locale (file.getloc (),\n new std::codecvt_utf8<tchar, 0x10FFFF,\n static_cast<std::codecvt_mode>(std::consume_header | std::little_endian)>));\n break;\n#endif\n\n#if defined (LOG4CPLUS_HAVE_CODECVT_UTF16_FACET) && defined (UNICODE)\n case Properties::fUTF16:\n file.imbue (\n std::locale (file.getloc (),\n new std::codecvt_utf16<tchar, 0x10FFFF,\n static_cast<std::codecvt_mode>(std::consume_header | std::little_endian)>));\n break;\n\n#elif defined (UNICODE) && defined (WIN32)\n case Properties::fUTF16:\n file.imbue (\n std::locale (file.getloc (),\n \/\/ TODO: This should actually be a custom \"null\" facet\n \/\/ that just copies the chars to wchar_t buffer.\n new std::codecvt<wchar_t, char, std::mbstate_t>));\n break;\n\n#endif\n\n#if defined (LOG4CPLUS_HAVE_CODECVT_UTF32_FACET) && defined (UNICODE)\n case Properties::fUTF32:\n file.imbue (\n std::locale (file.getloc (),\n new std::codecvt_utf32<tchar, 0x10FFFF,\n static_cast<std::codecvt_mode>(std::consume_header | std::little_endian)>));\n break;\n#endif\n\n case Properties::fUnspecEncoding:;\n default:\n \/\/ Do nothing.\n ;\n }\n}\n\n\n} \/\/ namespace\n\n\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ Properties ctors and dtor\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nProperties::Properties()\n : flags (0)\n{\n}\n\n\n\nProperties::Properties(tistream& input)\n : flags (0)\n{\n init(input);\n}\n\n\n\nProperties::Properties(const tstring& inputFile, unsigned f)\n : flags (f)\n{\n if (inputFile.empty ())\n return;\n\n tifstream file;\n imbue_file_from_flags (file, flags);\n\n file.open(LOG4CPLUS_FSTREAM_PREFERED_FILE_NAME(inputFile).c_str(),\n std::ios::binary);\n if (! file.good ())\n helpers::getLogLog ().error (LOG4CPLUS_TEXT (\"could not open file \")\n + inputFile);\n\n init(file);\n}\n\n\n\nvoid\nProperties::init(tistream& input)\n{\n if (! input)\n return;\n\n tstring buffer;\n while (std::getline (input, buffer))\n {\n trim_leading_ws (buffer);\n\n tstring::size_type const buffLen = buffer.size ();\n if (buffLen == 0 || buffer[0] == PROPERTIES_COMMENT_CHAR)\n continue;\n\n \/\/ Check if we have a trailing \\r because we are\n \/\/ reading a properties file produced on Windows.\n if (buffer[buffLen-1] == LOG4CPLUS_TEXT('\\r'))\n \/\/ Remove trailing 'Windows' \\r.\n buffer.resize (buffLen - 1);\n\n tstring::size_type const idx = buffer.find(LOG4CPLUS_TEXT ('='));\n if (idx != tstring::npos)\n {\n tstring key = buffer.substr(0, idx);\n tstring value = buffer.substr(idx + 1);\n trim_trailing_ws (key);\n trim_ws (value);\n setProperty(key, value);\n }\n else if (buffer.compare (0, 7, LOG4CPLUS_TEXT (\"include\")) == 0\n && buffer.size () >= 7 + 1 + 1\n && is_space (buffer[7]))\n {\n tstring included (buffer, 8) ;\n trim_ws (included);\n\n tifstream file;\n imbue_file_from_flags (file, flags);\n\n file.open (LOG4CPLUS_FSTREAM_PREFERED_FILE_NAME(included).c_str(),\n std::ios::binary);\n if (! file.good ())\n helpers::getLogLog ().error (\n LOG4CPLUS_TEXT (\"could not open file \") + included);\n\n init (file);\n }\n }\n}\n\n\n\nProperties::~Properties()\n{\n}\n\n\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ helpers::Properties public methods\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n\nbool\nProperties::exists(const log4cplus::tstring& key) const\n{\n return data.find(key) != data.end();\n}\n\n\nbool\nProperties::exists(tchar const * key) const\n{\n return data.find(key) != data.end();\n}\n\n\ntstring const &\nProperties::getProperty(const tstring& key) const\n{\n return get_property_worker (key);\n}\n\n\nlog4cplus::tstring const &\nProperties::getProperty(tchar const * key) const\n{\n return get_property_worker (key);\n}\n\n\ntstring\nProperties::getProperty(const tstring& key, const tstring& defaultVal) const\n{\n StringMap::const_iterator it (data.find (key));\n if (it == data.end ())\n return defaultVal;\n else\n return it->second;\n}\n\n\nstd::vector<tstring>\nProperties::propertyNames() const\n{\n std::vector<tstring> tmp;\n tmp.reserve (data.size ());\n for (auto const & kv : data)\n tmp.push_back(kv.first);\n\n return tmp;\n}\n\n\n\nvoid\nProperties::setProperty(const log4cplus::tstring& key,\n const log4cplus::tstring& value)\n{\n data[key] = value;\n}\n\n\nbool\nProperties::removeProperty(const log4cplus::tstring& key)\n{\n return data.erase(key) > 0;\n}\n\n\nProperties\nProperties::getPropertySubset(const log4cplus::tstring& prefix) const\n{\n Properties ret;\n auto const prefix_len = prefix.size ();\n std::vector<tstring> keys = propertyNames();\n for (tstring const & key : keys)\n {\n int result = key.compare (0, prefix_len, prefix);\n if (result == 0)\n ret.setProperty (key.substr (prefix_len), getProperty(key));\n }\n\n return ret;\n}\n\n\nbool\nProperties::getInt (int & val, log4cplus::tstring const & key) const\n{\n return get_type_val_worker (val, key);\n}\n\n\nbool\nProperties::getUInt (unsigned & val, log4cplus::tstring const & key) const\n{\n return get_type_val_worker (val, key);\n}\n\n\nbool\nProperties::getLong (long & val, log4cplus::tstring const & key) const\n{\n return get_type_val_worker (val, key);\n}\n\n\nbool\nProperties::getULong (unsigned long & val, log4cplus::tstring const & key) const\n{\n return get_type_val_worker (val, key);\n}\n\n\nbool\nProperties::getBool (bool & val, log4cplus::tstring const & key) const\n{\n if (! exists (key))\n return false;\n\n log4cplus::tstring const & prop_val = getProperty (key);\n return internal::parse_bool (val, prop_val);\n}\n\n\nbool\nProperties::getString (log4cplus::tstring & val, log4cplus::tstring const & key)\n const\n{\n StringMap::const_iterator it (data.find (key));\n if (it == data.end ())\n return false;\n\n val = it->second;\n return true;\n}\n\n\ntemplate <typename StringType>\nlog4cplus::tstring const &\nProperties::get_property_worker (StringType const & key) const\n{\n StringMap::const_iterator it (data.find (key));\n if (it == data.end ())\n return log4cplus::internal::empty_str;\n else\n return it->second;\n}\n\n\ntemplate <typename ValType>\nbool\nProperties::get_type_val_worker (ValType & val, log4cplus::tstring const & key)\n const\n{\n if (! exists (key))\n return false;\n\n log4cplus::tstring const & prop_val = getProperty (key);\n log4cplus::tistringstream iss (prop_val);\n ValType tmp_val;\n tchar ch;\n\n iss >> tmp_val;\n if (! iss)\n return false;\n iss >> ch;\n if (iss)\n return false;\n\n val = tmp_val;\n return true;\n}\n\n\n#if defined (LOG4CPLUS_WITH_UNIT_TESTS)\nCATCH_TEST_CASE (\"Properties\", \"[properties]\")\n{\n static tchar const PROP_ABC[] = LOG4CPLUS_TEXT (\"a.b.c\");\n Properties props;\n\n CATCH_SECTION (\"new object is empty\")\n {\n CATCH_REQUIRE (props.size () == 0);\n }\n\n CATCH_SECTION (\"added property can be retrieved\")\n {\n props.setProperty (PROP_ABC, LOG4CPLUS_TEXT (\"true\"));\n CATCH_REQUIRE (props.exists (PROP_ABC));\n CATCH_REQUIRE (props.exists (LOG4CPLUS_C_STR_TO_TSTRING (PROP_ABC)));\n CATCH_REQUIRE (props.getProperty (PROP_ABC)\n == LOG4CPLUS_TEXT (\"true\"));\n }\n\n CATCH_SECTION (\"type conversions work\")\n {\n bool bool_;\n int int_;\n unsigned int uint;\n long long_;\n unsigned long ulong;\n\n tistringstream iss (\n LOG4CPLUS_TEXT (\"bool=true\\r\\n\")\n LOG4CPLUS_TEXT (\"bool1=1\\n\")\n LOG4CPLUS_TEXT (\"int=-1\\n\")\n LOG4CPLUS_TEXT (\"uint=42\\n\")\n LOG4CPLUS_TEXT (\"long=-65537\\n\")\n LOG4CPLUS_TEXT (\"ulong=65537\")\n );\n Properties from_stream (iss);\n\n CATCH_REQUIRE (from_stream.getBool (bool_, LOG4CPLUS_TEXT (\"bool\")));\n CATCH_REQUIRE (bool_);\n CATCH_REQUIRE (from_stream.getBool (bool_, LOG4CPLUS_TEXT (\"bool1\")));\n CATCH_REQUIRE (bool_);\n CATCH_REQUIRE (from_stream.getInt (int_, LOG4CPLUS_TEXT (\"int\")));\n CATCH_REQUIRE (int_ == -1);\n CATCH_REQUIRE (from_stream.getUInt (uint, LOG4CPLUS_TEXT (\"uint\")));\n CATCH_REQUIRE (uint == 42);\n CATCH_REQUIRE (from_stream.getLong (long_, LOG4CPLUS_TEXT (\"long\")));\n CATCH_REQUIRE (long_ == -65537);\n CATCH_REQUIRE (from_stream.getULong (ulong, LOG4CPLUS_TEXT (\"ulong\")));\n CATCH_REQUIRE (ulong == 65537);\n }\n\n CATCH_SECTION (\"remove property\")\n {\n props.setProperty (PROP_ABC, LOG4CPLUS_TEXT (\"true\"));\n CATCH_REQUIRE (props.exists (PROP_ABC));\n props.removeProperty (PROP_ABC);\n CATCH_REQUIRE (! props.exists (PROP_ABC));\n }\n\n CATCH_SECTION (\"retrieve property names\")\n {\n props.setProperty (PROP_ABC, LOG4CPLUS_TEXT (\"true\"));\n static tchar const PROP_SECOND[] = LOG4CPLUS_TEXT (\"second\");\n props.setProperty (LOG4CPLUS_TEXT (\"second\"), LOG4CPLUS_TEXT (\"false\"));\n std::vector<log4cplus::tstring> names (props.propertyNames ());\n CATCH_REQUIRE (std::find (std::begin (names), std::end (names),\n PROP_ABC) != std::end (names));\n CATCH_REQUIRE (std::find (std::begin (names), std::end (names),\n PROP_SECOND) != std::end (names));\n }\n}\n#endif\n\n\n} } \/\/ namespace log4cplus { namespace helpers {\n<|endoftext|>"} {"text":"<commit_before>\n#include \"requests.h\"\n#include \"macros.h\"\n#include <iostream>\n\n#ifdef __linux__\nRequests::Requests() {\n startWorkers();\n};\n#endif\n\n\/\/Requests::getPopRequest returns the first request of a queue\nvoid Requests::getPopRequest(Requests::Request *req)\n{\n req = requestsQueue.front();\n requestsQueue.pop();\n};\n\n\/\/Request::workerThread is the main function for the worker thread(s)\nvoid Requests::workerThread()\n{\n std::unique_lock<std::mutex> lock(requestsQueueMtx);\n\n while (1)\n {\n threadCondVar.wait(lock, [this]{\n return (requestsQueue.size());\n });\n\n if (requestsQueue.size())\n {\n Requests::Request req;\n getPopRequest(&req);\n\n lock.unlock();\n\n fetchRequest(req);\n delete &req;\n std::cout << req.Url << std::endl;\n\n lock.lock();\n }\n }\n};\n\n\/\/Requests::startWorkers initialize and setups the used worker threads once a time\nvoid Requests::startWorkers()\n{\n if (!workersStarted)\n {\n for (int i = 0; i < THREADS; i++)\n {\n std::thread t(&Requests::workerThread, this);\n t.detach();\n };\n workersStarted = true;\n }\n};\n\n\/\/RequestsCurlCallbackWriter is a function used by cURL to receive the incoming byte packes of the URL content\nstatic size_t RequestsCurlCallbackWriter(void *contents, size_t size, size_t nmemb, void *buf)\n{\n ((std::string *)buf)->append((char *)contents, size * nmemb);\n return size * nmemb;\n};\n\n\/\/Requests::isValidParameter checks if given parameter is existing or valid\nbool Requests::isValidParameter(std::string param)\n{\n if (\n param.compare(\"#url\") == 0 ||\n param.compare(\"#method\") == 0 ||\n param.compare(\"#clientid\") == 0 ||\n param.compare(\"#jsonToArray\") == 0\n ) return false;\n return true;\n};\n\n\/\/Requests::addResult adds a struct of Requests::Result to the result map and returns its id\nint Requests::addResult()\n{\n int key = 1;\n\n resultsMtx.lock();\n while (true)\n {\n if (results.find(key) == results.end())\n break;\n key++;\n };\n resultsMtx.unlock();\n\n Requests::Result res;\n res.status = 1; \/\/ 0 = text pending, 1 = pending, 2 = error\n resultsMtx.lock();\n results.insert(std::pair<int, Requests::Result*>(key, &res));\n resultsMtx.unlock();\n\n #ifdef _MSC_VER\n startWorkers();\n #endif\n\n return key;\n};\n\nint Requests::addRequest(Arguments::Parameters params)\n{\n int key = addResult();\n \n if (key < 1)\n return 0;\n\n Requests::Request req;\n req.RequestID = key;\n req.Url = params.Url;\n req.Method = params.Method;\n req.PostData = params.PostData;\n req.Headers = params.Headers;\n req.JsonToArray = params.JsonToArray;\n req.Redirect = params.Redirect;\n req.MaxRedirects = params.MaxRedirects;\n req.MaxTimeout = params.MaxTimeout;\n\n requestsQueueMtx.lock();\n requestsQueue.push(&req);\n requestsQueueMtx.unlock();\n\n return key;\n};\n\n\/\/Requests::setResult sets a specific result by its id\nvoid Requests::setResult(int id, Requests::Result res)\n{\n if (id <= 0)\n return;\n\n resultsMtx.lock();\n\n if (results.find(id) != results.end())\n {\n results[id] = &res;\n }\n\n resultsMtx.unlock();\n};\n\n\/\/Requests::removeResult removes an existing result from the map\nbool Requests::removeResult(int id)\n{\n std::map<int, Requests::Result*>::iterator f;\n f = results.find(id);\n if (f == results.end())\n return false;\n \n resultsMtx.lock();\n Requests::Result *r = f->second;\n delete r;\n results.erase(f);\n resultsMtx.unlock();\n\n return true;\n};\n\n\/\/Requests::getResult sets the address of an given result pointer and return its status\nint Requests::getResult(int id, Requests::Result *res)\n{\n if (results.find(id) == results.end())\n return 2;\n \n resultsMtx.lock();\n res = results[id]; \/\/error 3 on request...\n resultsMtx.unlock();\n\n if (res->status == 2) removeResult(id);\n\n return res->status;\n};\n\n\/\/Requests::fetchRequest processes a given request by the parameters of Requests::Request\nvoid Requests::fetchRequest(Requests::Request req)\n{\n if (!results.size())\n {\n Requests::Result res;\n\n int status = getResult(req.RequestID, &res);\n res.status = 2;\n\n if (status == 1) {\n CURL *curl;\n CURLcode cS;\n\n curl = curl_easy_init();\n\n struct curl_slist *headers = NULL;\n for (unsigned int i = 0; i < req.Headers.size(); i++)\n {\n headers = curl_slist_append(headers, req.Headers[i].c_str());\n }\n\n std::string resStr;\n\n if (curl)\n {\n curl_easy_setopt(curl, CURLOPT_HTTPHEADER, headers);\n curl_easy_setopt(curl, CURLOPT_URL, req.Url.c_str());\n curl_easy_setopt(curl, CURLOPT_USERAGENT, HTTP_VERSION);\n curl_easy_setopt(curl, CURLOPT_CUSTOMREQUEST, req.Method.c_str());\n\n if (!req.Url.empty()) {\n curl_easy_setopt(curl, CURLOPT_POSTFIELDS, req.PostData.c_str());\n }\n\n if (req.Redirect) {\n curl_easy_setopt(curl, CURLOPT_FOLLOWLOCATION, 1L);\n if (req.MaxRedirects != 0) {\n curl_easy_setopt(curl, CURLOPT_MAXREDIRS, (long int)req.MaxRedirects);\n }\n }\n\n curl_easy_setopt(curl, CURLOPT_CONNECTTIMEOUT, req.MaxTimeout);\n curl_easy_setopt(curl, CURLOPT_WRITEDATA, &resStr);\n curl_easy_setopt(curl, CURLOPT_WRITEFUNCTION, RequestsCurlCallbackWriter);\n\n cS = curl_easy_perform(curl);\n\n if (cS == CURLE_OK)\n {\n if (req.JsonToArray)\n {\n resStr = A3URLCommon::ToArray(resStr);\n }\n\n curl_easy_getinfo(curl, CURLINFO_RESPONSE_CODE, &res.httpCode);\n\n res.result = resStr;\n res.status = 0;\n }\n }\n\n setResult(req.RequestID, res);\n }\n }\n};\n\n\/\/Requests::AddRequest call Requests::addRequest and writes the output to an pointer class Output\nint Requests::AddRequest(Output *op, Arguments::Parameters params)\n{\n int id = addRequest(params);\n threadCondVar.notify_one();\n op->Write(id);\n\n if (id <= 0)\n return 0;\n\n return 0;\n}\n\n\/\/Requests::getResultString copies the result of an Requests::Result class to an std::string pointer\nint Requests::getResultString(int id, std::string *str)\n{\n if (results.find(id) == results.end())\n return 2;\n\n Requests::Result res;\n res.status = getResult(id, &res);\n\n if (res.status == 0)\n {\n if (res.result.size() > 10200)\n {\n *str = res.result.substr(0, 10200);\n res.result.erase(res.result.begin(), (res.result.begin() + 10200));\n setResult(id, res);\n }\n else if (res.result.size() <= 10200)\n {\n *str = res.result;\n removeResult(id);\n res.status = res.httpCode;\n }\n }\n\n return res.status;\n};\n\n\/\/Requests::GetResult copies the result of an result to an sstream Output\nint Requests::GetResult(Output *op, int id)\n{\n std::string str(\"\");\n int status = getResultString(id, &str);\n\n op->Write(str.c_str()); \/\/ IF str IS EQUAL TO \"\", str IS FULLY EMPTIED\n\n return status;\n};\n\nint Requests::GetStatus(int id)\n{\n if (results.find(id) == results.end())\n return 3;\n Requests::Result *res;\n\n resultsMtx.lock();\n res = results[id];\n resultsMtx.unlock();\n\n return res->status;\n}\n<commit_msg>update requests.cpp<commit_after>\n#include \"requests.h\"\n#include \"macros.h\"\n#include <iostream>\n\n#ifdef __linux__\nRequests::Requests() {\n startWorkers();\n};\n#endif\n\n\/\/Requests::getPopRequest returns the first request of a queue\nvoid Requests::getPopRequest(Requests::Request *req)\n{\n req = requestsQueue.front();\n requestsQueue.pop();\n};\n\n\/\/Request::workerThread is the main function for the worker thread(s)\nvoid Requests::workerThread()\n{\n std::unique_lock<std::mutex> lock(requestsQueueMtx);\n\n while (1)\n {\n threadCondVar.wait(lock, [this]{\n return (requestsQueue.size());\n });\n\n if (requestsQueue.size())\n {\n Requests::Request req;\n getPopRequest(&req);\n\n lock.unlock();\n\n fetchRequest(req);\n delete &req;\n std::cout << req.Url << std::endl;\n\n lock.lock();\n }\n }\n};\n\n\/\/Requests::startWorkers initialize and setups the used worker threads once a time\nvoid Requests::startWorkers()\n{\n if (!workersStarted)\n {\n for (int i = 0; i < THREADS; i++)\n {\n std::thread t(&Requests::workerThread, this);\n t.detach();\n };\n workersStarted = true;\n }\n};\n\n\/\/RequestsCurlCallbackWriter is a function used by cURL to receive the incoming byte packes of the URL content\nstatic size_t RequestsCurlCallbackWriter(void *contents, size_t size, size_t nmemb, void *buf)\n{\n ((std::string *)buf)->append((char *)contents, size * nmemb);\n return size * nmemb;\n};\n\n\/\/Requests::isValidParameter checks if given parameter is existing or valid\nbool Requests::isValidParameter(std::string param)\n{\n if (\n param.compare(\"#url\") == 0 ||\n param.compare(\"#method\") == 0 ||\n param.compare(\"#clientid\") == 0 ||\n param.compare(\"#jsonToArray\") == 0\n ) return false;\n return true;\n};\n\n\/\/Requests::addResult adds a struct of Requests::Result to the result map and returns its id\nint Requests::addResult()\n{\n int key = 1;\n\n resultsMtx.lock();\n while (true)\n {\n if (results.find(key) == results.end())\n break;\n key++;\n };\n resultsMtx.unlock();\n\n Requests::Result res;\n res.status = 1; \/\/ 0 = text pending, 1 = pending, 2 = error\n resultsMtx.lock();\n results.insert(std::pair<int, Requests::Result*>(key, &res));\n resultsMtx.unlock();\n\n #ifdef _MSC_VER\n startWorkers();\n #endif\n\n return key;\n};\n\nint Requests::addRequest(Arguments::Parameters params)\n{\n int key = addResult();\n \n if (key < 1)\n return 0;\n\n Requests::Request req;\n req.RequestID = key;\n req.Url = params.Url;\n req.Method = params.Method;\n req.PostData = params.PostData;\n req.Headers = params.Headers;\n req.JsonToArray = params.JsonToArray;\n req.Redirect = params.Redirect;\n req.MaxRedirects = params.MaxRedirects;\n req.MaxTimeout = params.MaxTimeout;\n\n requestsQueueMtx.lock();\n requestsQueue.push(&req);\n requestsQueueMtx.unlock();\n\n return key;\n};\n\n\/\/Requests::setResult sets a specific result by its id\nvoid Requests::setResult(int id, Requests::Result res)\n{\n if (id <= 0)\n return;\n\n resultsMtx.lock();\n\n if (results.find(id) != results.end())\n {\n results[id] = &res;\n }\n\n resultsMtx.unlock();\n};\n\n\/\/Requests::removeResult removes an existing result from the map\nbool Requests::removeResult(int id)\n{\n std::map<int, Requests::Result*>::iterator f;\n f = results.find(id);\n if (f == results.end())\n return false;\n \n resultsMtx.lock();\n Requests::Result *r = f->second;\n delete r;\n results.erase(f);\n resultsMtx.unlock();\n\n return true;\n};\n\n\/\/Requests::getResult sets the address of an given result pointer and return its status\nint Requests::getResult(int id, Requests::Result *res)\n{\n if (results.find(id) == results.end())\n return 2;\n \n resultsMtx.lock();\n res = results[id]; \/\/error 3 on request...\n resultsMtx.unlock();\n\n if (res->status == 2) removeResult(id);\n\n return res->status;\n};\n\n\/\/Requests::fetchRequest processes a given request by the parameters of Requests::Request\nvoid Requests::fetchRequest(Requests::Request req)\n{\n if (!results.empty())\n {\n Requests::Result res;\n\n int status = getResult(req.RequestID, &res);\n res.status = 2;\n\n if (status == 1) {\n CURL *curl;\n CURLcode cS;\n\n curl = curl_easy_init();\n\n struct curl_slist *headers = NULL;\n for (unsigned int i = 0; i < req.Headers.size(); i++)\n {\n headers = curl_slist_append(headers, req.Headers[i].c_str());\n }\n\n std::string resStr;\n\n if (curl)\n {\n curl_easy_setopt(curl, CURLOPT_HTTPHEADER, headers);\n curl_easy_setopt(curl, CURLOPT_URL, req.Url.c_str());\n curl_easy_setopt(curl, CURLOPT_USERAGENT, HTTP_VERSION);\n curl_easy_setopt(curl, CURLOPT_CUSTOMREQUEST, req.Method.c_str());\n\n if (!req.Url.empty()) {\n curl_easy_setopt(curl, CURLOPT_POSTFIELDS, req.PostData.c_str());\n }\n\n if (req.Redirect) {\n curl_easy_setopt(curl, CURLOPT_FOLLOWLOCATION, 1L);\n if (req.MaxRedirects != 0) {\n curl_easy_setopt(curl, CURLOPT_MAXREDIRS, (long int)req.MaxRedirects);\n }\n }\n\n curl_easy_setopt(curl, CURLOPT_CONNECTTIMEOUT, req.MaxTimeout);\n curl_easy_setopt(curl, CURLOPT_WRITEDATA, &resStr);\n curl_easy_setopt(curl, CURLOPT_WRITEFUNCTION, RequestsCurlCallbackWriter);\n\n cS = curl_easy_perform(curl);\n\n if (cS == CURLE_OK)\n {\n if (req.JsonToArray)\n {\n resStr = A3URLCommon::ToArray(resStr);\n }\n\n curl_easy_getinfo(curl, CURLINFO_RESPONSE_CODE, &res.httpCode);\n\n res.result = resStr;\n res.status = 0;\n }\n }\n\n setResult(req.RequestID, res);\n }\n }\n};\n\n\/\/Requests::AddRequest call Requests::addRequest and writes the output to an pointer class Output\nint Requests::AddRequest(Output *op, Arguments::Parameters params)\n{\n int id = addRequest(params);\n threadCondVar.notify_one();\n op->Write(id);\n\n if (id <= 0)\n return 0;\n\n return 0;\n}\n\n\/\/Requests::getResultString copies the result of an Requests::Result class to an std::string pointer\nint Requests::getResultString(int id, std::string *str)\n{\n if (results.find(id) == results.end())\n return 2;\n\n Requests::Result res;\n res.status = getResult(id, &res);\n\n if (res.status == 0)\n {\n if (res.result.size() > 10200)\n {\n *str = res.result.substr(0, 10200);\n res.result.erase(res.result.begin(), (res.result.begin() + 10200));\n setResult(id, res);\n }\n else if (res.result.size() <= 10200)\n {\n *str = res.result;\n removeResult(id);\n res.status = res.httpCode;\n }\n }\n\n return res.status;\n};\n\n\/\/Requests::GetResult copies the result of an result to an sstream Output\nint Requests::GetResult(Output *op, int id)\n{\n std::string str(\"\");\n int status = getResultString(id, &str);\n\n op->Write(str.c_str()); \/\/ IF str IS EQUAL TO \"\", str IS FULLY EMPTIED\n\n return status;\n};\n\nint Requests::GetStatus(int id)\n{\n if (results.find(id) == results.end())\n return 3;\n Requests::Result *res;\n\n resultsMtx.lock();\n res = results[id];\n resultsMtx.unlock();\n\n return res->status;\n}\n<|endoftext|>"} {"text":"<commit_before>#include \"debug_log.hpp\"\n#include \"connection_pool.hpp\"\n\n#include <boost\/asio\/io_service.hpp>\n#include <boost\/asio\/signal_set.hpp>\n#include <boost\/program_options.hpp>\n\nnamespace {\nvoid wait_on_signal() {\n boost::asio::io_service signal_io_service;\n boost::asio::io_service::work work{signal_io_service};\n boost::asio::signal_set signals(signal_io_service, SIGINT, SIGTERM);\n signals.async_wait([&](...) { signal_io_service.stop(); });\n signal_io_service.run();\n}\n\ntemplate<class T, class U>\ninline const T max(T a, U b) { return a < b ? b : a; }\n} \/\/ namespace\n\nint main(int argc, char *argv[]) {\n using namespace riak;\n using namespace std::chrono;\n namespace po = boost::program_options;\n\n \/\/ Parse arguments\n std::string hostname;\n uint16_t port, num_threads, num_sockets, highwatermark;\n uint32_t nmsgs;\n po::options_description description{\n \"Sends a lot of get_object requests to a Riak node using a connection pool.\"\n };\n description.add_options()\n (\"help,h\", \"prints this help message\")\n (\"hostname,n\",\n po::value<std::string>(&hostname)->default_value(\"localhost\"),\n \"hostname of Riak node\")\n (\"port,p\",\n po::value<uint16_t>(&port)->default_value(10017),\n \"port to connect on Riak node\")\n (\"num-threads,t\",\n po::value<uint16_t>(&num_threads)->default_value(2),\n \"number of I\/O threads\")\n (\"num-sockets,s\",\n po::value<uint16_t>(&num_sockets)->default_value(256),\n \"number of sockets in pool\")\n (\"highwatermark,k\",\n po::value<uint16_t>(&highwatermark)->default_value(1024),\n \"max buffered requests\")\n (\"nmsgs,m\",\n po::value<uint32_t>(&nmsgs)->default_value(1000),\n \"number of messages to send to the node\");\n po::variables_map variables;\n try {\n po::store(po::parse_command_line(argc, argv, description), variables);\n po::notify(variables);\n } catch (const std::exception& e) {\n DLOG << e.what();\n return -1;\n }\n if (variables.count(\"help\")) {\n std::cerr << description << std::endl;\n return -1;\n }\n\n\n \/\/ Simple connection_pool usage:\n \/\/ riak::connection_pool conn(hostname, port, num_threads, num_sockets,\n \/\/ highwatermark);\n \/\/ conn.send(string_message1, deadline_ms, handler);\n \/\/ conn.send(string_message2, deadline_ms, handler);\n \/\/ etc.\n \/\/ \n \/\/ What follows is a mess because this is throwaway code.\n\n std::mutex num_sent_mutex;\n uint32_t num_sent = 0;\n auto start_clock = high_resolution_clock::now();\n auto first_response_clock = start_clock;\n \n std::string message{\"\\x09\\x0A\\01\\x62\\x12\\x01\\x6B\", 7};\n DLOG << \"Creating connection pool...\";\n riak::connection_pool conn(hostname, port, num_threads, num_sockets,\n highwatermark);\n\n DLOG << \"Buffering messages...\";\n auto log_every = max(1, nmsgs \/ 20);\n for (int i = 0 ; i < nmsgs ; ++ i) {\n conn.send(\n message, 1000,\n [&](const std::string & response, std::error_code error) {\n std::lock_guard<std::mutex> lock{num_sent_mutex};\n ++num_sent;\n if (num_sent == 1) {\n first_response_clock = high_resolution_clock::now();\n double secs = duration_cast<milliseconds>(\n first_response_clock - start_clock).count() \/ 1000.0;\n DLOG << error.message() << \" [first message \" << secs << \" secs].\";\n } else if (num_sent % log_every == 0 || num_sent == nmsgs) {\n if (num_sent <= num_sockets) return;\n auto total = duration_cast<milliseconds>(\n high_resolution_clock::now() - first_response_clock);\n auto msgs_per_sec = \n (num_sent - num_sockets) \/ (double(total.count()) \/ 1000.0);\n DLOG << error.message() << \" [sent \" << num_sent << \" at \"\n << msgs_per_sec << \" messages\/sec]\";\n }\n });\n\n if (i % log_every == 0) DLOG << \"Buffered \" << i << \" messages.\";\n }\n DLOG << \"Buffered all the messages. Waiting on signal...\";\n\n wait_on_signal();\n DLOG << \"Signal caught.\";\n\n return 0;\n}\n<commit_msg>minor whitespace fix<commit_after>#include \"debug_log.hpp\"\n#include \"connection_pool.hpp\"\n\n#include <boost\/asio\/io_service.hpp>\n#include <boost\/asio\/signal_set.hpp>\n#include <boost\/program_options.hpp>\n\nnamespace {\nvoid wait_on_signal() {\n boost::asio::io_service signal_io_service;\n boost::asio::io_service::work work{signal_io_service};\n boost::asio::signal_set signals(signal_io_service, SIGINT, SIGTERM);\n signals.async_wait([&](...) { signal_io_service.stop(); });\n signal_io_service.run();\n}\n\ntemplate<class T, class U>\ninline const T max(T a, U b) { return a < b ? b : a; }\n} \/\/ namespace\n\nint main(int argc, char *argv[]) {\n using namespace riak;\n using namespace std::chrono;\n namespace po = boost::program_options;\n\n \/\/ Parse arguments\n std::string hostname;\n uint16_t port, num_threads, num_sockets, highwatermark;\n uint32_t nmsgs;\n po::options_description description{\n \"Sends a lot of get_object requests to a Riak node using a connection pool.\"\n };\n description.add_options()\n (\"help,h\", \"prints this help message\")\n (\"hostname,n\",\n po::value<std::string>(&hostname)->default_value(\"localhost\"),\n \"hostname of Riak node\")\n (\"port,p\",\n po::value<uint16_t>(&port)->default_value(10017),\n \"port to connect on Riak node\")\n (\"num-threads,t\",\n po::value<uint16_t>(&num_threads)->default_value(2),\n \"number of I\/O threads\")\n (\"num-sockets,s\",\n po::value<uint16_t>(&num_sockets)->default_value(256),\n \"number of sockets in pool\")\n (\"highwatermark,k\",\n po::value<uint16_t>(&highwatermark)->default_value(1024),\n \"max buffered requests\")\n (\"nmsgs,m\",\n po::value<uint32_t>(&nmsgs)->default_value(1000),\n \"number of messages to send to the node\");\n po::variables_map variables;\n try {\n po::store(po::parse_command_line(argc, argv, description), variables);\n po::notify(variables);\n } catch (const std::exception& e) {\n DLOG << e.what();\n return -1;\n }\n if (variables.count(\"help\")) {\n std::cerr << description << std::endl;\n return -1;\n }\n\n \/\/ Simple connection_pool usage:\n \/\/ riak::connection_pool conn(hostname, port, num_threads, num_sockets,\n \/\/ highwatermark);\n \/\/ conn.send(string_message1, deadline_ms, handler);\n \/\/ conn.send(string_message2, deadline_ms, handler);\n \/\/ etc.\n \/\/ \n \/\/ What follows is a mess because this is throwaway code.\n\n std::mutex num_sent_mutex;\n uint32_t num_sent = 0;\n auto start_clock = high_resolution_clock::now();\n auto first_response_clock = start_clock;\n \n std::string message{\"\\x09\\x0A\\01\\x62\\x12\\x01\\x6B\", 7};\n DLOG << \"Creating connection pool...\";\n riak::connection_pool conn(hostname, port, num_threads, num_sockets,\n highwatermark);\n\n DLOG << \"Buffering messages...\";\n auto log_every = max(1, nmsgs \/ 20);\n for (int i = 0 ; i < nmsgs ; ++ i) {\n conn.send(\n message, 1000,\n [&](const std::string & response, std::error_code error) {\n std::lock_guard<std::mutex> lock{num_sent_mutex};\n ++num_sent;\n if (num_sent == 1) {\n first_response_clock = high_resolution_clock::now();\n double secs = duration_cast<milliseconds>(\n first_response_clock - start_clock).count() \/ 1000.0;\n DLOG << error.message() << \" [first message \" << secs << \" secs].\";\n } else if (num_sent % log_every == 0 || num_sent == nmsgs) {\n if (num_sent <= num_sockets) return;\n auto total = duration_cast<milliseconds>(\n high_resolution_clock::now() - first_response_clock);\n auto msgs_per_sec = \n (num_sent - num_sockets) \/ (double(total.count()) \/ 1000.0);\n DLOG << error.message() << \" [sent \" << num_sent << \" at \"\n << msgs_per_sec << \" messages\/sec]\";\n }\n });\n\n if (i % log_every == 0) DLOG << \"Buffered \" << i << \" messages.\";\n }\n DLOG << \"Buffered all the messages. Waiting on signal...\";\n\n wait_on_signal();\n DLOG << \"Signal caught.\";\n\n return 0;\n}\n<|endoftext|>"} {"text":"<commit_before>\/\/ sdl_main.cpp\n\n#ifdef _WIN32\n# define WINDOWS_LEAN_AND_MEAN\n# define NOMINMAX\n# include <windows.h>\n#endif\n\n#include <GL\/glew.h>\n#include <SDL.h>\n#include <SDL_syswm.h>\n#undef main\n\n#include \"ShaderFunctions.h\"\n#include \"Timer.h\"\n\nTimer g_timer;\nint winw = 800;\nint winh = 600;\n\nstruct Shadertoy {\n GLuint prog;\n\tGLuint progsound;\n\tGLint uloc_iResolution;\n\tGLint uloc_iGlobalTime;\n\tGLint uloc_iBlockOffset;\n\tGLint uloc_iSampleRate;\n};\n\nShadertoy g_toy;\n\n\nvoid keyboard(const SDL_Event& event, int key, int codes, int action, int mods)\n{\n (void)codes;\n (void)mods;\n\n if (action == SDL_KEYDOWN)\n {\n switch (key)\n {\n default:\n break;\n\n case SDLK_ESCAPE:\n SDL_Quit();\n exit(0);\n break;\n }\n }\n}\n\nvoid PollEvents()\n{\n SDL_Event event;\n while (SDL_PollEvent(&event))\n {\n switch(event.type)\n {\n case SDL_KEYDOWN:\n case SDL_KEYUP:\n keyboard(event, event.key.keysym.sym, 0, event.key.type, 0);\n break;\n\n case SDL_MOUSEBUTTONDOWN:\n case SDL_MOUSEBUTTONUP:\n break;\n\n case SDL_MOUSEMOTION:\n break;\n\n case SDL_MOUSEWHEEL:\n break;\n\n case SDL_WINDOWEVENT:\n break;\n\n case SDL_QUIT:\n exit(0);\n break;\n\n default:\n break;\n }\n }\n}\n\nvoid display()\n{\n glUseProgram(g_toy.prog);\n if (g_toy.uloc_iResolution > -1) glUniform3f(g_toy.uloc_iResolution, (float)winw, (float)winh, 1.f);\n if (g_toy.uloc_iGlobalTime > -1) glUniform1f(g_toy.uloc_iGlobalTime, g_timer.seconds());\n glRecti(-1,-1,1,1);\n}\n\n\n\/\/\n\/\/ Audio\n\/\/\n\nstruct\n{\n SDL_AudioSpec spec;\n Uint8 *sound; \/* Pointer to wave data *\/\n Uint32 soundlen; \/* Length of wave data *\/\n int soundpos; \/* Current play position *\/\n} wave;\n\nvoid SDLCALL fillerup(void *unused, Uint8 * stream, int len)\n{\n Uint8 *waveptr;\n int waveleft;\n\n waveptr = wave.sound + wave.soundpos;\n waveleft = wave.soundlen - wave.soundpos;\n\n while (waveleft <= len) { \/\/ wrap condition\n SDL_memcpy(stream, waveptr, waveleft);\n stream += waveleft;\n len -= waveleft;\n waveptr = wave.sound;\n waveleft = wave.soundlen;\n wave.soundpos = 0;\n }\n SDL_memcpy(stream, waveptr, len);\n wave.soundpos += len;\n}\n\nvoid play_audio()\n{\n \/\/ init buffer\n wave.soundlen = 128*1024;\n \/\/wav_spec.samples = samps;\n wave.sound = new Uint8[wave.soundlen];\n \/\/ Fill with noise\n for (int i=0; i<wave.soundlen\/2; ++i)\n {\n wave.sound[i] = rand() % 255;\n }\n\n wave.spec.freq = 44100;\n wave.spec.format = AUDIO_U8; \/\/AUDIO_S16LSB;\n wave.spec.channels = 2;\n wave.spec.callback = fillerup;\n\n\t\/\/ shadertoy effect.js 135\n\t\/\/this.mSampleRate = 44100;\n\t\/\/this.mPlayTime = 60;\n\t\/\/this.mPlaySamples = this.mPlayTime*this.mSampleRate;\n\t\/\/this.mBuffer = wa.createBuffer(2, this.mPlaySamples, this.mSampleRate);\n\t\/\/var l2 = gl.getUniformLocation( this.mProgram, \"iBlockOffset\" );\n\n\t\/\/ render effect.js 983\n#if 0\n\t\/\/ bufL: Float32Array[2646000]\n\t\/\/ numBlocks: 10.09368896484375\n\tvar bufL = this.mBuffer.getChannelData(0); \/\/ Float32Array\n\tvar bufR = this.mBuffer.getChannelData(1); \/\/ Float32Array\n\tvar numBlocks = this.mPlaySamples \/ this.mTmpBufferSamples;\n\tfor (var j = 0; j<numBlocks; j++)\n\t{\n\t\tvar off = j*this.mTmpBufferSamples; \/\/ mTmpBufferSamples: 262144\n\n\t\tgl.uniform1f(l2, off \/ this.mSampleRate);\n\t\tgl.drawArrays(gl.TRIANGLES, 0, 6);\n\t\t\/\/ mTextureDimensions: 512\n\t\tgl.readPixels(0, 0, this.mTextureDimensions, this.mTextureDimensions, gl.RGBA, gl.UNSIGNED_BYTE, this.mData);\n\n\t\tfor (var i = 0; i<this.mTmpBufferSamples; i++)\n\t\t{\n\t\t\tbufL[off + i] = -1.0 + 2.0*(this.mData[4 * i + 0] + 256.0*this.mData[4 * i + 1]) \/ 65535.0;\n\t\t\tbufR[off + i] = -1.0 + 2.0*(this.mData[4 * i + 2] + 256.0*this.mData[4 * i + 3]) \/ 65535.0;\n\t\t}\n\t}\n\n\tgl.disableVertexAttribArray(l1);\n\tgl.useProgram(null);\n\tgl.bindFramebuffer(gl.FRAMEBUFFER, null);\n#endif\n\n if (SDL_OpenAudio(&wave.spec, NULL) < 0)\n {\n SDL_FreeWAV(wave.sound);\n SDL_Quit();\n exit(2);\n }\n\n SDL_PauseAudio(0); \/\/ Start playing\n}\n\n\nint main(void)\n{\n \/\/\/@todo cmd line aargs\n\n if (SDL_Init(SDL_INIT_EVERYTHING) < 0)\n {\n return false;\n }\n\n SDL_GL_SetAttribute(SDL_GL_CONTEXT_PROFILE_MASK, SDL_GL_CONTEXT_PROFILE_COMPATIBILITY);\n SDL_GL_SetAttribute(SDL_GL_CONTEXT_MAJOR_VERSION, 3);\n SDL_GL_SetAttribute(SDL_GL_CONTEXT_MINOR_VERSION, 2);\n \n int winw = 800;\n int winh = 600;\n\n SDL_Window* pWindow = SDL_CreateWindow(\n \"kinderegg\",\n 100,100,\n winw, winh,\n SDL_WINDOW_SHOWN | SDL_WINDOW_OPENGL);\n\n \/\/ thank you http:\/\/www.brandonfoltz.com\/2013\/12\/example-using-opengl-3-0-with-sdl2-and-glew\/\n SDL_GLContext glContext = SDL_GL_CreateContext(pWindow);\n if (glContext == NULL)\n {\n printf(\"There was an error creating the OpenGL context!\\n\");\n return 0;\n }\n\n const unsigned char *version = glGetString(GL_VERSION);\n if (version == NULL) \n {\n printf(\"There was an error creating the OpenGL context!\\n\");\n return 1;\n }\n\n SDL_GL_MakeCurrent(pWindow, glContext);\n\n \/\/ Don't forget to initialize Glew, turn glewExperimental on to\n \/\/ avoid problems fetching function pointers...\n glewExperimental = GL_TRUE;\n const GLenum l_Result = glewInit();\n if (l_Result != GLEW_OK)\n {\n exit(EXIT_FAILURE);\n }\n\n g_toy.prog = makeShaderByName(\"basic\");\n g_toy.uloc_iResolution = glGetUniformLocation(g_toy.prog, \"iResolution\");\n g_toy.uloc_iGlobalTime = glGetUniformLocation(g_toy.prog, \"iGlobalTime\");\n\tg_toy.progsound = makeShaderByName(\"basicsound\");\n\tg_toy.uloc_iBlockOffset = glGetUniformLocation(g_toy.progsound, \"iBlockOffset\");\n\tg_toy.uloc_iSampleRate = glGetUniformLocation(g_toy.progsound, \"iSampleRate\");\n\n\t\/\/var l2 = gl.getUniformLocation( this.mProgram, \"\" );\n\n\n play_audio();\n\n int quit = 0;\n while (quit == 0)\n {\n PollEvents();\n display();\n SDL_GL_SwapWindow(pWindow);\n }\n\n SDL_GL_DeleteContext(glContext);\n SDL_DestroyWindow(pWindow);\n SDL_CloseAudio();\n SDL_FreeWAV(wave.sound);\n SDL_Quit();\n}\n<commit_msg>Render audio to framebuffer and push it to speakers via glReadPixels. Works for the default audio shader.<commit_after>\/\/ sdl_main.cpp\n\n#ifdef _WIN32\n# define WINDOWS_LEAN_AND_MEAN\n# define NOMINMAX\n# include <windows.h>\n#endif\n\n#include <GL\/glew.h>\n#include <SDL.h>\n#include <SDL_syswm.h>\n#undef main\n\n#include \"ShaderFunctions.h\"\n#include \"Timer.h\"\n\nTimer g_timer;\nint winw = 800;\nint winh = 600;\n\nstruct Shadertoy {\n GLuint prog;\n\tGLuint progsound;\n\tGLint uloc_iResolution;\n\tGLint uloc_iGlobalTime;\n\tGLint uloc_iBlockOffset;\n\tGLint uloc_iSampleRate;\n};\n\nShadertoy g_toy;\n\n\nvoid keyboard(const SDL_Event& event, int key, int codes, int action, int mods)\n{\n (void)codes;\n (void)mods;\n\n if (action == SDL_KEYDOWN)\n {\n switch (key)\n {\n default:\n break;\n\n case SDLK_ESCAPE:\n SDL_Quit();\n exit(0);\n break;\n }\n }\n}\n\nvoid PollEvents()\n{\n SDL_Event event;\n while (SDL_PollEvent(&event))\n {\n switch(event.type)\n {\n case SDL_KEYDOWN:\n case SDL_KEYUP:\n keyboard(event, event.key.keysym.sym, 0, event.key.type, 0);\n break;\n\n case SDL_MOUSEBUTTONDOWN:\n case SDL_MOUSEBUTTONUP:\n break;\n\n case SDL_MOUSEMOTION:\n break;\n\n case SDL_MOUSEWHEEL:\n break;\n\n case SDL_WINDOWEVENT:\n break;\n\n case SDL_QUIT:\n exit(0);\n break;\n\n default:\n break;\n }\n }\n}\n\nvoid display()\n{\n glUseProgram(g_toy.prog);\n if (g_toy.uloc_iResolution > -1) glUniform3f(g_toy.uloc_iResolution, (float)winw, (float)winh, 1.f);\n if (g_toy.uloc_iGlobalTime > -1) glUniform1f(g_toy.uloc_iGlobalTime, g_timer.seconds());\n glRecti(-1,-1,1,1);\n}\n\n\n\/\/\n\/\/ Audio\n\/\/\n\nstruct\n{\n SDL_AudioSpec spec;\n Uint8 *sound; \/* Pointer to wave data *\/\n Uint32 soundlen; \/* Length of wave data *\/\n int soundpos; \/* Current play position *\/\n} wave;\n\nvoid SDLCALL fillerup(void *unused, Uint8 * stream, int len)\n{\n Uint8 *waveptr;\n int waveleft;\n\n waveptr = wave.sound + wave.soundpos;\n waveleft = wave.soundlen - wave.soundpos;\n\n while (waveleft <= len) { \/\/ wrap condition\n SDL_memcpy(stream, waveptr, waveleft);\n stream += waveleft;\n len -= waveleft;\n waveptr = wave.sound;\n waveleft = wave.soundlen;\n wave.soundpos = 0;\n }\n SDL_memcpy(stream, waveptr, len);\n wave.soundpos += len;\n}\n\nvoid play_audio()\n{\n wave.spec.freq = 44100;\n wave.spec.format = AUDIO_U8; \/\/AUDIO_S16LSB;\n wave.spec.channels = 2;\n wave.spec.callback = fillerup;\n\n const int mPlayTime = 60; \/\/ Shadertoy gives 60 seconds of audio\n wave.soundlen = mPlayTime * wave.spec.freq;\n wave.sound = new Uint8[2*wave.soundlen];\n glViewport(0,0,512,512);\n glUseProgram(g_toy.progsound);\n\n unsigned char mData[512*512*4];\n int mTmpBufferSamples = 262144;\n int mPlaySamples = wave.soundlen;\n int numBlocks = mPlaySamples \/ mTmpBufferSamples;\n for (int j=0; j<numBlocks; ++j)\n {\n int off = j * mTmpBufferSamples;\n if (g_toy.uloc_iBlockOffset > -1) glUniform1f(g_toy.uloc_iBlockOffset, (float)off \/ (float)wave.spec.freq);\n\n glRecti(-1,-1,1,1);\n \/\/ mData: Uint8Array[1048576]\n glReadPixels(0,0,512,512, GL_RGBA, GL_UNSIGNED_BYTE, mData);\n for (int i = 0; i<mTmpBufferSamples; ++i)\n {\n const float aL = -1.0f + 2.0f*((float)mData[4 * i + 0] + 256.0f*(float)mData[4 * i + 1]) \/ 65535.0f;\n const float aR = -1.0f + 2.0f*((float)mData[4 * i + 2] + 256.0f*(float)mData[4 * i + 3]) \/ 65535.0f;\n wave.sound[2*(off + i) ] = (unsigned char)(.5f*(1.f+aL) * 255.f);\n wave.sound[2*(off + i)+1] = (unsigned char)(.5f*(1.f+aR) * 255.f);\n }\n }\n\n if (SDL_OpenAudio(&wave.spec, NULL) < 0)\n {\n SDL_FreeWAV(wave.sound);\n SDL_Quit();\n exit(2);\n }\n\n SDL_PauseAudio(0); \/\/ Start playing\n}\n\n\nint main(void)\n{\n \/\/\/@todo cmd line aargs\n\n if (SDL_Init(SDL_INIT_EVERYTHING) < 0)\n {\n return false;\n }\n\n SDL_GL_SetAttribute(SDL_GL_CONTEXT_PROFILE_MASK, SDL_GL_CONTEXT_PROFILE_COMPATIBILITY);\n SDL_GL_SetAttribute(SDL_GL_CONTEXT_MAJOR_VERSION, 3);\n SDL_GL_SetAttribute(SDL_GL_CONTEXT_MINOR_VERSION, 2);\n \n int winw = 800;\n int winh = 600;\n\n SDL_Window* pWindow = SDL_CreateWindow(\n \"kinderegg\",\n 100,100,\n winw, winh,\n SDL_WINDOW_SHOWN | SDL_WINDOW_OPENGL);\n\n \/\/ thank you http:\/\/www.brandonfoltz.com\/2013\/12\/example-using-opengl-3-0-with-sdl2-and-glew\/\n SDL_GLContext glContext = SDL_GL_CreateContext(pWindow);\n if (glContext == NULL)\n {\n printf(\"There was an error creating the OpenGL context!\\n\");\n return 0;\n }\n\n const unsigned char *version = glGetString(GL_VERSION);\n if (version == NULL) \n {\n printf(\"There was an error creating the OpenGL context!\\n\");\n return 1;\n }\n\n SDL_GL_MakeCurrent(pWindow, glContext);\n\n \/\/ Don't forget to initialize Glew, turn glewExperimental on to\n \/\/ avoid problems fetching function pointers...\n glewExperimental = GL_TRUE;\n const GLenum l_Result = glewInit();\n if (l_Result != GLEW_OK)\n {\n exit(EXIT_FAILURE);\n }\n\n g_toy.prog = makeShaderByName(\"basic\");\n g_toy.uloc_iResolution = glGetUniformLocation(g_toy.prog, \"iResolution\");\n g_toy.uloc_iGlobalTime = glGetUniformLocation(g_toy.prog, \"iGlobalTime\");\n g_toy.progsound = makeShaderByName(\"basicsound\");\n g_toy.uloc_iBlockOffset = glGetUniformLocation(g_toy.progsound, \"iBlockOffset\");\n g_toy.uloc_iSampleRate = glGetUniformLocation(g_toy.progsound, \"iSampleRate\");\n\n play_audio();\n glViewport(0,0, winw, winh);\n\n int quit = 0;\n while (quit == 0)\n {\n PollEvents();\n display();\n SDL_GL_SwapWindow(pWindow);\n }\n\n SDL_GL_DeleteContext(glContext);\n SDL_DestroyWindow(pWindow);\n SDL_CloseAudio();\n SDL_FreeWAV(wave.sound);\n SDL_Quit();\n}\n<|endoftext|>"} {"text":"<commit_before>\/*\n * Copyright (C) 2011 The Android Open Source Project\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n *\/\n\n#define LOG_TAG \"LatinIME: jni\"\n\n#include \"jni_common.h\"\n\n#include \"com_android_inputmethod_keyboard_ProximityInfo.h\"\n#include \"com_android_inputmethod_latin_BinaryDictionary.h\"\n#include \"com_android_inputmethod_latin_DicTraverseSession.h\"\n#include \"defines.h\"\n\n\/*\n * Returns the JNI version on success, JNI_ERR on failure.\n *\/\njint JNI_OnLoad(JavaVM *vm, void *reserved) {\n JNIEnv *env = 0;\n\n if (vm->GetEnv(reinterpret_cast<void **>(&env), JNI_VERSION_1_6) != JNI_OK) {\n AKLOGE(\"ERROR: GetEnv failed\");\n return JNI_ERR;\n }\n ASSERT(env);\n if (!env) {\n AKLOGE(\"ERROR: JNIEnv is invalid\");\n return JNI_ERR;\n }\n if (!latinime::register_BinaryDictionary(env)) {\n AKLOGE(\"ERROR: BinaryDictionary native registration failed\");\n return JNI_ERR;\n }\n if (!latinime::register_DicTraverseSession(env)) {\n AKLOGE(\"ERROR: DicTraverseSession native registration failed\");\n return JNI_ERR;\n }\n if (!latinime::register_ProximityInfo(env)) {\n AKLOGE(\"ERROR: ProximityInfo native registration failed\");\n return JNI_ERR;\n }\n \/* success -- return valid version number *\/\n return JNI_VERSION_1_6;\n}\n\nnamespace latinime {\nint registerNativeMethods(JNIEnv *env, const char *className, JNINativeMethod *methods,\n int numMethods) {\n jclass clazz = env->FindClass(className);\n if (!clazz) {\n AKLOGE(\"Native registration unable to find class '%s'\", className);\n return JNI_FALSE;\n }\n if (env->RegisterNatives(clazz, methods, numMethods) < 0) {\n AKLOGE(\"RegisterNatives failed for '%s'\", className);\n env->DeleteLocalRef(clazz);\n return JNI_FALSE;\n }\n env->DeleteLocalRef(clazz);\n return JNI_TRUE;\n}\n} \/\/ namespace latinime\n<commit_msg>Extra log line for debugging.<commit_after>\/*\n * Copyright (C) 2011 The Android Open Source Project\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n *\/\n\n#define LOG_TAG \"LatinIME: jni\"\n\n#include \"jni_common.h\"\n\n#include \"com_android_inputmethod_keyboard_ProximityInfo.h\"\n#include \"com_android_inputmethod_latin_BinaryDictionary.h\"\n#include \"com_android_inputmethod_latin_DicTraverseSession.h\"\n#include \"defines.h\"\n\n\/*\n * Returns the JNI version on success, JNI_ERR on failure.\n *\/\njint JNI_OnLoad(JavaVM *vm, void *reserved) {\n JNIEnv *env = 0;\n\n AKLOGE(\"Entered JNI_OnLoad\");\n\n if (vm->GetEnv(reinterpret_cast<void **>(&env), JNI_VERSION_1_6) != JNI_OK) {\n AKLOGE(\"ERROR: GetEnv failed\");\n return JNI_ERR;\n }\n ASSERT(env);\n if (!env) {\n AKLOGE(\"ERROR: JNIEnv is invalid\");\n return JNI_ERR;\n }\n if (!latinime::register_BinaryDictionary(env)) {\n AKLOGE(\"ERROR: BinaryDictionary native registration failed\");\n return JNI_ERR;\n }\n if (!latinime::register_DicTraverseSession(env)) {\n AKLOGE(\"ERROR: DicTraverseSession native registration failed\");\n return JNI_ERR;\n }\n if (!latinime::register_ProximityInfo(env)) {\n AKLOGE(\"ERROR: ProximityInfo native registration failed\");\n return JNI_ERR;\n }\n \/* success -- return valid version number *\/\n return JNI_VERSION_1_6;\n}\n\nnamespace latinime {\nint registerNativeMethods(JNIEnv *env, const char *className, JNINativeMethod *methods,\n int numMethods) {\n jclass clazz = env->FindClass(className);\n if (!clazz) {\n AKLOGE(\"Native registration unable to find class '%s'\", className);\n return JNI_FALSE;\n }\n if (env->RegisterNatives(clazz, methods, numMethods) < 0) {\n AKLOGE(\"RegisterNatives failed for '%s'\", className);\n env->DeleteLocalRef(clazz);\n return JNI_FALSE;\n }\n env->DeleteLocalRef(clazz);\n return JNI_TRUE;\n}\n} \/\/ namespace latinime\n<|endoftext|>"} {"text":"<commit_before>\/*************************************************************************\n *\n * OpenOffice.org - a multi-platform office productivity suite\n *\n * $RCSfile: SchemaSimpleTypeContext.cxx,v $\n *\n * $Revision: 1.3 $\n *\n * last change: $Author: rt $ $Date: 2005-09-09 16:01: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#include \"SchemaSimpleTypeContext.hxx\"\n\n#include \"SchemaRestrictionContext.hxx\"\n#include <xmltoken.hxx>\n#include <nmspmap.hxx>\n#include <xmlnmspe.hxx>\n#include <xmltkmap.hxx>\n#include <xmluconv.hxx>\n\n#include <com\/sun\/star\/beans\/XPropertySet.hpp>\n#include <com\/sun\/star\/xsd\/WhiteSpaceTreatment.hpp>\n\n#include <tools\/debug.hxx>\n\n\nusing rtl::OUString;\nusing com::sun::star::uno::Reference;\nusing com::sun::star::uno::Any;\nusing com::sun::star::xml::sax::XAttributeList;\nusing com::sun::star::beans::XPropertySet;\nusing com::sun::star::xforms::XDataTypeRepository;\nusing namespace xmloff::token;\n\n\n\n\nstatic SvXMLTokenMapEntry aAttributes[] =\n{\n TOKEN_MAP_ENTRY( NONE, NAME ),\n XML_TOKEN_MAP_END\n};\n\nstatic SvXMLTokenMapEntry aChildren[] =\n{\n TOKEN_MAP_ENTRY( XSD, RESTRICTION ),\n XML_TOKEN_MAP_END\n};\n\n\nSchemaSimpleTypeContext::SchemaSimpleTypeContext(\n SvXMLImport& rImport,\n USHORT nPrefix,\n const OUString& rLocalName,\n const Reference<XDataTypeRepository>& rRepository ) :\n TokenContext( rImport, nPrefix, rLocalName, aAttributes, aChildren ),\n mxRepository( rRepository )\n{\n}\n\nSchemaSimpleTypeContext::~SchemaSimpleTypeContext()\n{\n}\n\nvoid SchemaSimpleTypeContext::HandleAttribute(\n sal_uInt16 nToken,\n const OUString& rValue )\n{\n if( nToken == XML_NAME )\n {\n msTypeName = rValue;\n }\n}\n\nSvXMLImportContext* SchemaSimpleTypeContext::HandleChild(\n sal_uInt16 nToken,\n sal_uInt16 nPrefix,\n const OUString& rLocalName,\n const Reference<XAttributeList>& xAttrList )\n{\n SvXMLImportContext* pContext = NULL;\n switch( nToken )\n {\n case XML_RESTRICTION:\n pContext = new SchemaRestrictionContext( GetImport(),\n nPrefix, rLocalName,\n mxRepository, msTypeName );\n break;\n default:\n DBG_ERROR( \"Booo!\" );\n }\n\n return ( pContext != NULL )\n ? pContext\n : new SvXMLImportContext( GetImport(), nPrefix, rLocalName );\n}\n<commit_msg>INTEGRATION: CWS warnings01 (1.3.34); FILE MERGED 2005\/11\/17 16:41:26 pl 1.3.34.1: #i55991# removed warnings<commit_after>\/*************************************************************************\n *\n * OpenOffice.org - a multi-platform office productivity suite\n *\n * $RCSfile: SchemaSimpleTypeContext.cxx,v $\n *\n * $Revision: 1.4 $\n *\n * last change: $Author: hr $ $Date: 2006-06-19 18:56: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 \"SchemaSimpleTypeContext.hxx\"\n\n#include \"SchemaRestrictionContext.hxx\"\n#include <xmltoken.hxx>\n#include <nmspmap.hxx>\n#include <xmlnmspe.hxx>\n#include <xmltkmap.hxx>\n#include <xmluconv.hxx>\n\n#include <com\/sun\/star\/beans\/XPropertySet.hpp>\n#include <com\/sun\/star\/xsd\/WhiteSpaceTreatment.hpp>\n\n#include <tools\/debug.hxx>\n\n\nusing rtl::OUString;\nusing com::sun::star::uno::Reference;\nusing com::sun::star::uno::Any;\nusing com::sun::star::xml::sax::XAttributeList;\nusing com::sun::star::beans::XPropertySet;\nusing com::sun::star::xforms::XDataTypeRepository;\nusing namespace xmloff::token;\n\n\n\n\nstatic SvXMLTokenMapEntry aAttributes[] =\n{\n TOKEN_MAP_ENTRY( NONE, NAME ),\n XML_TOKEN_MAP_END\n};\n\nstatic SvXMLTokenMapEntry aChildren[] =\n{\n TOKEN_MAP_ENTRY( XSD, RESTRICTION ),\n XML_TOKEN_MAP_END\n};\n\n\nSchemaSimpleTypeContext::SchemaSimpleTypeContext(\n SvXMLImport& rImport,\n USHORT nPrefix,\n const OUString& rLocalName,\n const Reference<XDataTypeRepository>& rRepository ) :\n TokenContext( rImport, nPrefix, rLocalName, aAttributes, aChildren ),\n mxRepository( rRepository )\n{\n}\n\nSchemaSimpleTypeContext::~SchemaSimpleTypeContext()\n{\n}\n\nvoid SchemaSimpleTypeContext::HandleAttribute(\n sal_uInt16 nToken,\n const OUString& rValue )\n{\n if( nToken == XML_NAME )\n {\n msTypeName = rValue;\n }\n}\n\nSvXMLImportContext* SchemaSimpleTypeContext::HandleChild(\n sal_uInt16 nToken,\n sal_uInt16 nPrefix,\n const OUString& rLocalName,\n const Reference<XAttributeList>& )\n{\n SvXMLImportContext* pContext = NULL;\n switch( nToken )\n {\n case XML_RESTRICTION:\n pContext = new SchemaRestrictionContext( GetImport(),\n nPrefix, rLocalName,\n mxRepository, msTypeName );\n break;\n default:\n DBG_ERROR( \"Booo!\" );\n }\n\n return ( pContext != NULL )\n ? pContext\n : new SvXMLImportContext( GetImport(), nPrefix, rLocalName );\n}\n<|endoftext|>"} {"text":"<commit_before>\/\/\n\/\/ Created by Dennis Goldfarb on 9\/28\/16.\n\/\/\n\n#include <iostream>\n#include <fstream>\n#include <random>\n#include <string>\n#include <algorithm>\n#include <sys\/types.h>\n#include <sys\/time.h>\n#include <sys\/resource.h>\n\n#include <OpenMS\/CHEMISTRY\/Element.h>\n#include <OpenMS\/CHEMISTRY\/AASequence.h>\n#include <OpenMS\/CHEMISTRY\/ResidueDB.h>\n#include <OpenMS\/CHEMISTRY\/ElementDB.h>\n\n\nstatic const OpenMS::ResidueDB* residueDB = OpenMS::ResidueDB::getInstance();\nstatic const OpenMS::ElementDB* elementDB = OpenMS::ElementDB::getInstance();\n\nstatic std::string AMINO_ACIDS = \"ADEFGHIKLNPQRSTVWY\";\nstatic std::string AMINO_ACIDS_SULFUR = \"CM\";\nstatic std::string AMINO_ACIDS_SELENIUM = \"U\";\n\nstd::random_device rd;\nstd::mt19937 gen(rd());\nstd::uniform_int_distribution<> dis_AA(0, AMINO_ACIDS.length()-1);\nstd::uniform_int_distribution<> dis_S(0, AMINO_ACIDS_SULFUR.length()-1);\n\nint max_depth;\n\nOpenMS::AASequence create_random_peptide_sequence(int peptide_length, int num_sulfurs, int num_c_sulfurs, int num_selenium, int num_c_selenium) {\n OpenMS::AASequence random_peptide;\n\n \/\/ for insertion of sulfur containing amino acids in fragment\n for (int i = 0; i < num_sulfurs; ++i) {\n random_peptide += residueDB->getResidue(AMINO_ACIDS_SULFUR[dis_S(gen)]);\n }\n\n \/\/ for insertion of selenocysteines in fragment\n for (int i = 0; i < num_selenium; ++i) {\n random_peptide += residueDB->getResidue(AMINO_ACIDS_SELENIUM[0]);\n }\n\n \/\/ random amino acid insertion (non Sulfur and Selenium amino acids)\n for (int aa_index = 0; aa_index < peptide_length; ++aa_index) {\n random_peptide += residueDB->getResidue(AMINO_ACIDS[dis_AA(gen)]);\n }\n\n \/\/ for insertion of sulfur containing amino acids in fragment\n for (int i = 0; i < num_c_sulfurs; ++i) {\n random_peptide += residueDB->getResidue(AMINO_ACIDS_SULFUR[dis_S(gen)]);\n }\n\n \/\/ for insertion of selenocysteines in fragment\n for (int i = 0; i < num_c_selenium; ++i) {\n random_peptide += residueDB->getResidue(AMINO_ACIDS_SELENIUM[0]);\n }\n\n\n return random_peptide;\n}\n\n\/*OpenMS::IsotopeDistribution getIsotopeDistribution(OpenMS::EmpiricalFormula &formula, OpenMS::UInt max_depth)\n{\n OpenMS::IsotopeDistribution result(max_depth);\n for (auto it = formula.begin(); it != formula.end(); ++it)\n {\n OpenMS::IsotopeDistribution tmp = it->first->getIsotopeDistribution();\n tmp.setMaxIsotope(max_depth);\n result += tmp * it->second;\n }\n return result;\n}\n\nOpenMS::IsotopeDistribution getFragmentDistribution(OpenMS::EmpiricalFormula &precursor_ef, OpenMS::EmpiricalFormula &fragment_ef, std::vector<OpenMS::UInt> &isolated_isotopes)\n{\n \/\/ A fragment's isotopes can only be as high as the largest isolated precursor isotope.\n OpenMS::UInt max_depth = *std::max_element(isolated_isotopes.begin(), isolated_isotopes.end())+1;\n\n \/\/ Treat *this as the fragment molecule\n OpenMS::EmpiricalFormula complementary_fragment = precursor_ef-fragment_ef;\n\n OpenMS::IsotopeDistribution fragment_isotope_dist = getIsotopeDistribution(fragment_ef, max_depth);\n OpenMS::IsotopeDistribution comp_fragment_isotope_dist = getIsotopeDistribution(complementary_fragment, max_depth);\n\n OpenMS::IsotopeDistribution result;\n result.calcFragmentIsotopeDist(fragment_isotope_dist, comp_fragment_isotope_dist, isolated_isotopes);\n\n return result;\n}*\/\n\nvoid create_fragments(OpenMS::AASequence &p, std::ofstream** outfiles, int num_sulfurs, int num_c_sulfurs, int num_selenium, int num_c_selenium) {\n int num_fragments = p.size()-1;\n\n int tot_left_SSe = std::max(num_sulfurs + num_selenium,1);\n int tot_right_SSe = std::max(num_c_sulfurs + num_c_selenium,1);\n\n OpenMS::EmpiricalFormula precursor_ef = p.getFormula();\n OpenMS::IsotopeDistribution precursor_id = precursor_ef.getIsotopeDistribution(30);\n\n for (int index = tot_left_SSe; index < num_fragments-tot_right_SSe; ++index)\n {\n OpenMS::EmpiricalFormula b_ion = p.getPrefix(index).getFormula(OpenMS::Residue::ResidueType::BIon);\n OpenMS::EmpiricalFormula y_ion = p.getPrefix(index).getFormula(OpenMS::Residue::ResidueType::YIon);\n\n for (int precursor_isotope = 0; precursor_isotope < max_depth; ++precursor_isotope)\n {\n std::vector<OpenMS::UInt> isolated_isotopes;\n isolated_isotopes.push_back(precursor_isotope);\n\n OpenMS::IsotopeDistribution b_id = b_ion.getConditionalFragmentIsotopeDist(precursor_ef, isolated_isotopes);\n OpenMS::IsotopeDistribution y_id = y_ion.getConditionalFragmentIsotopeDist(precursor_ef, isolated_isotopes);\n \/\/OpenMS::IsotopeDistribution b_id = getFragmentDistribution(precursor_ef, b_ion, isolated_isotopes);\n \/\/OpenMS::IsotopeDistribution y_id = getFragmentDistribution(precursor_ef, y_ion, isolated_isotopes);\n\n for (int fragment_isotope = 0; fragment_isotope <= precursor_isotope && fragment_isotope < b_id.size(); ++fragment_isotope)\n {\n outfiles[precursor_isotope][fragment_isotope] << b_id.getContainer()[fragment_isotope].second * precursor_id.getContainer()[precursor_isotope].second\n << \"\\t\" << b_ion.getMonoWeight()\n << \"\\t\" << p.getMonoWeight() << std::endl;\n outfiles[precursor_isotope][fragment_isotope] << y_id.getContainer()[fragment_isotope].second * precursor_id.getContainer()[precursor_isotope].second\n << \"\\t\" << y_ion.getMonoWeight()\n << \"\\t\" << p.getMonoWeight() << std::endl;\n }\n }\n }\n}\n\n\nvoid sample_fragment_isotopic_distributions(std::string base_path, float max_mass, int num_samples, int num_sulfurs, int num_c_sulfurs, int num_selenium, int num_c_selenium, bool append) {\n\n \/\/ create all output files and write header to each\n std::ofstream** outfiles = new std::ofstream*[max_depth];\n for (int precursor_isotope = 0; precursor_isotope < max_depth; ++precursor_isotope) {\n outfiles[precursor_isotope] = new std::ofstream[max_depth];\n for (int fragment_isotope = 0; fragment_isotope <= precursor_isotope; ++fragment_isotope) {\n std::string filename = \"Precursor\" + std::to_string(precursor_isotope) + \"_\" +\n \"Fragment\" + std::to_string(fragment_isotope) + \".tab\";\n\n if (append)\n {\n outfiles[precursor_isotope][fragment_isotope].open(base_path + filename, std::ofstream::out | std::ofstream::app);\n } else\n {\n outfiles[precursor_isotope][fragment_isotope].open(base_path + filename);\n }\n\n \/\/ Only add the header if we're creating a new file\n \/\/ This happens if we're not appending, or if we're appending and it's our first time in the loop\n if (!append) {\n outfiles[precursor_isotope][fragment_isotope] << \"probability\" << \"\\tfrag.mass\" << \"\\tprecursor.mass\"\n << std::endl; \/\/\"\\tfrag.a.mass\" << \"\\tprecursor.a.mass\" << std::endl;\n }\n }\n }\n\n int max_length = max_mass\/100;\n\n for (int peptide_length = 0; peptide_length <= max_length; ++peptide_length) {\n\n for (int sample = 0; sample < num_samples; ++sample) {\n\n OpenMS::AASequence random_sequence = create_random_peptide_sequence(peptide_length, num_sulfurs, num_c_sulfurs,\n num_selenium, num_c_selenium);\n\n if (random_sequence.size() > 0 && random_sequence.getMonoWeight() <= max_mass) {\n create_fragments(random_sequence, outfiles, num_sulfurs, num_c_sulfurs, num_selenium, num_c_selenium);\n }\n }\n\n }\n\n \/\/ close all output files\n for (int precursor_isotope = 0; precursor_isotope < max_depth; ++precursor_isotope) {\n for (int fragment_isotope = 0; fragment_isotope <= precursor_isotope; ++fragment_isotope) {\n outfiles[precursor_isotope][fragment_isotope].close();\n }\n delete[] outfiles[precursor_isotope];\n }\n delete[] outfiles;\n}\n\nvoid sample_average_fragment_isotopic_distribution(std::string distribution_path, std::string base_path, float max_mass, float min_percentage)\n{\n std::map<std::pair<int,int>, int> sulfurs2count;\n\n std::ifstream sulfur_dist_in(distribution_path);\n std::string input;\n int S, CS, count, i=0;\n while (sulfur_dist_in >> input)\n {\n if (i == 0) S = atoi(input.c_str());\n else if (i == 1) CS = atoi(input.c_str());\n else {\n count = atoi(input.c_str());\n sulfurs2count[std::make_pair(S,CS)] = count;\n }\n i = (i+1) % 3;\n }\n\n int max_count = 0;\n for (auto itr : sulfurs2count)\n {\n max_count = std::max(max_count, itr.second);\n }\n\n bool append = false;\n for (auto itr : sulfurs2count)\n {\n double percentage = (double) itr.second \/ max_count;\n if (percentage >= min_percentage) {\n int num_samples = std::floor(percentage \/ min_percentage);\n sample_fragment_isotopic_distributions(base_path, max_mass, num_samples, itr.first.first, itr.first.second, 0, 0, append);\n append = false;\n }\n }\n}\n\nvoid usage()\n{\n std::cout << \"PeptideFragmentSampler out_path max_mass num_samples S CS Se CSe max_isotope\" << std::endl;\n std::cout << \"out_path: The path to the directory that will store the training data, e.g. ~\/data\/\" << std::endl;\n std::cout << \"max_mass: maximum mass allowed for sampled peptides, e.g. 8500\" << std::endl;\n std::cout << \"num_samples: number of random peptides to generate for each peptide length, e.g 100\" << std::endl;\n std::cout << \"S: number of sulfurs that should be in the fragment ion, e.g. 0\" << std::endl;\n std::cout << \"CS: number of sulfurs that should be in the complementary fragment ion, e.g. 0\" << std::endl;\n std::cout << \"Se: number of seleniums that should be in the fragment ion, e.g. 0\" << std::endl;\n std::cout << \"CSe: number of seleniums that should be in the complementary fragment ion, e.g. 0\" << std::endl;\n std::cout << \"max_isotope: The maximum isotope to generate training data for, e.g. 5\" << std::endl;\n std::cout << std::endl;\n\n std::cout << \"PeptideFragmentSampler sulfur_dist_path out_path max_mass min_percentage max_isotope\" << std::endl;\n std::cout << \"sulfur_dist_path: file path to the results of GetSulfurDistribution, e.g. ~\/data\/sulfur_distribution.tab\" << std::endl;\n std::cout << \"out_path: The path to the directory that will store the training data, e.g. ~\/data\/\" << std::endl;\n std::cout << \"max_mass: maximum mass allowed for sampled peptides, e.g. 8500\" << std::endl;\n std::cout << \"min_percentage: the min abundance of a sulfur distribution necessary to be included in the training data (relative to most abundant case), e.g. .001\" << std::endl;\n std::cout << \"max_isotope: The maximum isotope to generate training data for, e.g. 5\" << std::endl;\n}\n\nint main(int argc, const char ** argv) {\n\n if (argc != 9 && argc != 6)\n {\n usage();\n }\n\n \/\/ Increase the maximum number of open files for this process. Was necessary for me.\n struct rlimit rlp;\n rlp.rlim_cur = 600;\n setrlimit(RLIMIT_NOFILE, &rlp);\n\n if (argc == 9) {\n std::string out_path = argv[1];\n float max_mass = atof(argv[2]);\n int num_samples = atoi(argv[3]);\n int S = atoi(argv[4]);\n int CS = atoi(argv[5]);\n int Se = atoi(argv[6]);\n int CSe = atoi(argv[7]);\n\n max_depth = atoi(argv[8]) + 1;\n\n sample_fragment_isotopic_distributions(out_path, max_mass, num_samples, S, CS, Se, CSe, false);\n }\n else if (argc == 6)\n {\n std::string dist_path = argv[1];\n std::string out_path = argv[2];\n float max_mass = atof(argv[3]);\n float min_percentage = atof(argv[4]);\n\n max_depth = atoi(argv[5]) + 1;\n\n sample_average_fragment_isotopic_distribution(dist_path, out_path, max_mass, min_percentage);\n }\n\n return 0;\n}<commit_msg>fixed bug<commit_after>\/\/\n\/\/ Created by Dennis Goldfarb on 9\/28\/16.\n\/\/\n\n#include <iostream>\n#include <fstream>\n#include <random>\n#include <string>\n#include <algorithm>\n#include <sys\/types.h>\n#include <sys\/time.h>\n#include <sys\/resource.h>\n\n#include <OpenMS\/CHEMISTRY\/Element.h>\n#include <OpenMS\/CHEMISTRY\/AASequence.h>\n#include <OpenMS\/CHEMISTRY\/ResidueDB.h>\n#include <OpenMS\/CHEMISTRY\/ElementDB.h>\n\n\nstatic const OpenMS::ResidueDB* residueDB = OpenMS::ResidueDB::getInstance();\nstatic const OpenMS::ElementDB* elementDB = OpenMS::ElementDB::getInstance();\n\nstatic std::string AMINO_ACIDS = \"ADEFGHIKLNPQRSTVWY\";\nstatic std::string AMINO_ACIDS_SULFUR = \"CM\";\nstatic std::string AMINO_ACIDS_SELENIUM = \"U\";\n\nstd::random_device rd;\nstd::mt19937 gen(rd());\nstd::uniform_int_distribution<> dis_AA(0, AMINO_ACIDS.length()-1);\nstd::uniform_int_distribution<> dis_S(0, AMINO_ACIDS_SULFUR.length()-1);\n\nint max_depth;\n\nOpenMS::AASequence create_random_peptide_sequence(int peptide_length, int num_sulfurs, int num_c_sulfurs, int num_selenium, int num_c_selenium) {\n OpenMS::AASequence random_peptide;\n\n \/\/ for insertion of sulfur containing amino acids in fragment\n for (int i = 0; i < num_sulfurs; ++i) {\n random_peptide += residueDB->getResidue(AMINO_ACIDS_SULFUR[dis_S(gen)]);\n }\n\n \/\/ for insertion of selenocysteines in fragment\n for (int i = 0; i < num_selenium; ++i) {\n random_peptide += residueDB->getResidue(AMINO_ACIDS_SELENIUM[0]);\n }\n\n \/\/ random amino acid insertion (non Sulfur and Selenium amino acids)\n for (int aa_index = 0; aa_index < peptide_length; ++aa_index) {\n random_peptide += residueDB->getResidue(AMINO_ACIDS[dis_AA(gen)]);\n }\n\n \/\/ for insertion of sulfur containing amino acids in fragment\n for (int i = 0; i < num_c_sulfurs; ++i) {\n random_peptide += residueDB->getResidue(AMINO_ACIDS_SULFUR[dis_S(gen)]);\n }\n\n \/\/ for insertion of selenocysteines in fragment\n for (int i = 0; i < num_c_selenium; ++i) {\n random_peptide += residueDB->getResidue(AMINO_ACIDS_SELENIUM[0]);\n }\n\n\n return random_peptide;\n}\n\n\/*OpenMS::IsotopeDistribution getIsotopeDistribution(OpenMS::EmpiricalFormula &formula, OpenMS::UInt max_depth)\n{\n OpenMS::IsotopeDistribution result(max_depth);\n for (auto it = formula.begin(); it != formula.end(); ++it)\n {\n OpenMS::IsotopeDistribution tmp = it->first->getIsotopeDistribution();\n tmp.setMaxIsotope(max_depth);\n result += tmp * it->second;\n }\n return result;\n}\n\nOpenMS::IsotopeDistribution getFragmentDistribution(OpenMS::EmpiricalFormula &precursor_ef, OpenMS::EmpiricalFormula &fragment_ef, std::vector<OpenMS::UInt> &isolated_isotopes)\n{\n \/\/ A fragment's isotopes can only be as high as the largest isolated precursor isotope.\n OpenMS::UInt max_depth = *std::max_element(isolated_isotopes.begin(), isolated_isotopes.end())+1;\n\n \/\/ Treat *this as the fragment molecule\n OpenMS::EmpiricalFormula complementary_fragment = precursor_ef-fragment_ef;\n\n OpenMS::IsotopeDistribution fragment_isotope_dist = getIsotopeDistribution(fragment_ef, max_depth);\n OpenMS::IsotopeDistribution comp_fragment_isotope_dist = getIsotopeDistribution(complementary_fragment, max_depth);\n\n OpenMS::IsotopeDistribution result;\n result.calcFragmentIsotopeDist(fragment_isotope_dist, comp_fragment_isotope_dist, isolated_isotopes);\n\n return result;\n}*\/\n\nvoid create_fragments(OpenMS::AASequence &p, std::ofstream** outfiles, int num_sulfurs, int num_c_sulfurs, int num_selenium, int num_c_selenium) {\n int num_fragments = p.size()-1;\n\n int tot_left_SSe = std::max(num_sulfurs + num_selenium,1);\n int tot_right_SSe = std::max(num_c_sulfurs + num_c_selenium,1);\n\n OpenMS::EmpiricalFormula precursor_ef = p.getFormula();\n OpenMS::IsotopeDistribution precursor_id = precursor_ef.getIsotopeDistribution(30);\n\n for (int index = tot_left_SSe; index < num_fragments-tot_right_SSe; ++index)\n {\n OpenMS::EmpiricalFormula b_ion = p.getPrefix(index).getFormula(OpenMS::Residue::ResidueType::BIon);\n OpenMS::EmpiricalFormula y_ion = p.getPrefix(index).getFormula(OpenMS::Residue::ResidueType::YIon);\n\n for (int precursor_isotope = 0; precursor_isotope < max_depth; ++precursor_isotope)\n {\n std::vector<OpenMS::UInt> isolated_isotopes;\n isolated_isotopes.push_back(precursor_isotope);\n\n OpenMS::IsotopeDistribution b_id = b_ion.getConditionalFragmentIsotopeDist(precursor_ef, isolated_isotopes);\n OpenMS::IsotopeDistribution y_id = y_ion.getConditionalFragmentIsotopeDist(precursor_ef, isolated_isotopes);\n \/\/OpenMS::IsotopeDistribution b_id = getFragmentDistribution(precursor_ef, b_ion, isolated_isotopes);\n \/\/OpenMS::IsotopeDistribution y_id = getFragmentDistribution(precursor_ef, y_ion, isolated_isotopes);\n\n for (int fragment_isotope = 0; fragment_isotope <= precursor_isotope && fragment_isotope < b_id.size(); ++fragment_isotope)\n {\n outfiles[precursor_isotope][fragment_isotope] << b_id.getContainer()[fragment_isotope].second * precursor_id.getContainer()[precursor_isotope].second\n << \"\\t\" << b_ion.getMonoWeight()\n << \"\\t\" << p.getMonoWeight() << std::endl;\n outfiles[precursor_isotope][fragment_isotope] << y_id.getContainer()[fragment_isotope].second * precursor_id.getContainer()[precursor_isotope].second\n << \"\\t\" << y_ion.getMonoWeight()\n << \"\\t\" << p.getMonoWeight() << std::endl;\n }\n }\n }\n}\n\n\nvoid sample_fragment_isotopic_distributions(std::string base_path, float max_mass, int num_samples, int num_sulfurs, int num_c_sulfurs, int num_selenium, int num_c_selenium, bool append) {\n\n \/\/ create all output files and write header to each\n std::ofstream** outfiles = new std::ofstream*[max_depth];\n for (int precursor_isotope = 0; precursor_isotope < max_depth; ++precursor_isotope) {\n outfiles[precursor_isotope] = new std::ofstream[max_depth];\n for (int fragment_isotope = 0; fragment_isotope <= precursor_isotope; ++fragment_isotope) {\n std::string filename = \"Precursor\" + std::to_string(precursor_isotope) + \"_\" +\n \"Fragment\" + std::to_string(fragment_isotope) + \".tab\";\n\n if (append)\n {\n outfiles[precursor_isotope][fragment_isotope].open(base_path + filename, std::ofstream::out | std::ofstream::app);\n } else\n {\n outfiles[precursor_isotope][fragment_isotope].open(base_path + filename);\n }\n\n \/\/ Only add the header if we're creating a new file\n \/\/ This happens if we're not appending, or if we're appending and it's our first time in the loop\n if (!append) {\n outfiles[precursor_isotope][fragment_isotope] << \"probability\" << \"\\tfrag.mass\" << \"\\tprecursor.mass\"\n << std::endl; \/\/\"\\tfrag.a.mass\" << \"\\tprecursor.a.mass\" << std::endl;\n }\n }\n }\n\n int max_length = max_mass\/100;\n\n for (int peptide_length = 0; peptide_length <= max_length; ++peptide_length) {\n\n for (int sample = 0; sample < num_samples; ++sample) {\n\n OpenMS::AASequence random_sequence = create_random_peptide_sequence(peptide_length, num_sulfurs, num_c_sulfurs,\n num_selenium, num_c_selenium);\n\n if (random_sequence.size() > 0 && random_sequence.getMonoWeight() <= max_mass) {\n create_fragments(random_sequence, outfiles, num_sulfurs, num_c_sulfurs, num_selenium, num_c_selenium);\n }\n }\n\n }\n\n \/\/ close all output files\n for (int precursor_isotope = 0; precursor_isotope < max_depth; ++precursor_isotope) {\n for (int fragment_isotope = 0; fragment_isotope <= precursor_isotope; ++fragment_isotope) {\n outfiles[precursor_isotope][fragment_isotope].close();\n }\n delete[] outfiles[precursor_isotope];\n }\n delete[] outfiles;\n}\n\nvoid sample_average_fragment_isotopic_distribution(std::string distribution_path, std::string base_path, float max_mass, float min_percentage)\n{\n std::map<std::pair<int,int>, int> sulfurs2count;\n\n std::ifstream sulfur_dist_in(distribution_path);\n std::string input;\n int S, CS, count, i=0;\n while (sulfur_dist_in >> input)\n {\n if (i == 0) S = atoi(input.c_str());\n else if (i == 1) CS = atoi(input.c_str());\n else {\n count = atoi(input.c_str());\n sulfurs2count[std::make_pair(S,CS)] = count;\n }\n i = (i+1) % 3;\n }\n\n int max_count = 0;\n for (auto itr : sulfurs2count)\n {\n max_count = std::max(max_count, itr.second);\n }\n\n bool append = false;\n for (auto itr : sulfurs2count)\n {\n double percentage = (double) itr.second \/ max_count;\n if (percentage >= min_percentage) {\n int num_samples = std::floor(percentage \/ min_percentage);\n sample_fragment_isotopic_distributions(base_path, max_mass, num_samples, itr.first.first, itr.first.second, 0, 0, append);\n append = true;\n }\n }\n}\n\nvoid usage()\n{\n std::cout << \"PeptideFragmentSampler out_path max_mass num_samples S CS Se CSe max_isotope\" << std::endl;\n std::cout << \"out_path: The path to the directory that will store the training data, e.g. ~\/data\/\" << std::endl;\n std::cout << \"max_mass: maximum mass allowed for sampled peptides, e.g. 8500\" << std::endl;\n std::cout << \"num_samples: number of random peptides to generate for each peptide length, e.g 100\" << std::endl;\n std::cout << \"S: number of sulfurs that should be in the fragment ion, e.g. 0\" << std::endl;\n std::cout << \"CS: number of sulfurs that should be in the complementary fragment ion, e.g. 0\" << std::endl;\n std::cout << \"Se: number of seleniums that should be in the fragment ion, e.g. 0\" << std::endl;\n std::cout << \"CSe: number of seleniums that should be in the complementary fragment ion, e.g. 0\" << std::endl;\n std::cout << \"max_isotope: The maximum isotope to generate training data for, e.g. 5\" << std::endl;\n std::cout << std::endl;\n\n std::cout << \"PeptideFragmentSampler sulfur_dist_path out_path max_mass min_percentage max_isotope\" << std::endl;\n std::cout << \"sulfur_dist_path: file path to the results of GetSulfurDistribution, e.g. ~\/data\/sulfur_distribution.tab\" << std::endl;\n std::cout << \"out_path: The path to the directory that will store the training data, e.g. ~\/data\/\" << std::endl;\n std::cout << \"max_mass: maximum mass allowed for sampled peptides, e.g. 8500\" << std::endl;\n std::cout << \"min_percentage: the min abundance of a sulfur distribution necessary to be included in the training data (relative to most abundant case), e.g. .001\" << std::endl;\n std::cout << \"max_isotope: The maximum isotope to generate training data for, e.g. 5\" << std::endl;\n}\n\nint main(int argc, const char ** argv) {\n\n if (argc != 9 && argc != 6)\n {\n usage();\n }\n\n \/\/ Increase the maximum number of open files for this process. Was necessary for me.\n struct rlimit rlp;\n rlp.rlim_cur = 600;\n setrlimit(RLIMIT_NOFILE, &rlp);\n\n if (argc == 9) {\n std::string out_path = argv[1];\n float max_mass = atof(argv[2]);\n int num_samples = atoi(argv[3]);\n int S = atoi(argv[4]);\n int CS = atoi(argv[5]);\n int Se = atoi(argv[6]);\n int CSe = atoi(argv[7]);\n\n max_depth = atoi(argv[8]) + 1;\n\n sample_fragment_isotopic_distributions(out_path, max_mass, num_samples, S, CS, Se, CSe, false);\n }\n else if (argc == 6)\n {\n std::string dist_path = argv[1];\n std::string out_path = argv[2];\n float max_mass = atof(argv[3]);\n float min_percentage = atof(argv[4]);\n\n max_depth = atoi(argv[5]) + 1;\n\n sample_average_fragment_isotopic_distribution(dist_path, out_path, max_mass, min_percentage);\n }\n\n return 0;\n}<|endoftext|>"} {"text":"<commit_before>\/\/ Copyright (c) 2014-2017 Michael J. Sullivan\n\/\/ Use of this source code is governed by an MIT-style license that can be\n\/\/ found in the LICENSE file.\n\n\/\/ This is a version of of rculist_user_rmc that open codes all the\n\/\/ list manipulation crap in instead of abstracting it away, in order\n\/\/ to simplify it as an example.\n\n#include \"rculist_user_rmc_simple.hpp\"\n#include \"epoch.hpp\"\n#include <mutex>\n\nnamespace rmclib {\n\n#include \"rculist_user_rmc_simple_macro.cpp\"\n\n\/\/\/ BEGIN SNIP\n\/\/ Perform a lookup in an RCU-protected widgetlist, with\n\/\/ execution edges drawn to the LGIVE return action.\n\/\/ Must be done in an Epoch read-side critical section.\nwidget *widget_find_fine(widgetlist *list, unsigned key) noexcept {\n XEDGE_HERE(load, load);\n XEDGE_HERE(load, use);\n widget *node;\n widget *head = &list->head;\n for (node = L(load, head->next); node != head; node = L(load, node->next)) {\n if (L(use, node->key) == key) {\n return LGIVE(use, node);\n }\n }\n return nullptr;\n}\n\n\/\/ Perform a lookup in an RCU-protected widgetlist with a traditional\n\/\/ post edge.\n\/\/ Must be done in an Epoch read-side critical section.\nwidget *widget_find(widgetlist *list, unsigned key) noexcept {\n XEDGE(find, post);\n return L(find, widget_find_fine(list, key));\n}\n\nstatic void insert_between(widget *n, widget *n1, widget *n2) {\n VEDGE(pre, link);\n n->prev = n1;\n n2->prev = n;\n n->next = n2;\n L(link, n1->next = n);\n}\nstatic void insert_before(widget *n, widget *n_old) {\n insert_between(n, n_old->prev, n_old);\n}\nstatic void replace(widget *n_old, widget *n_new) {\n insert_between(n_new, n_old->prev, n_old->next);\n}\n\n\/\/ Insert an object into a widgetlist, replacing an old object with\n\/\/ the same key, if necessary.\n\/\/ Must *not* be called from an Epoch read-side critical section.\nvoid widget_insert(widgetlist *list, widget *obj) noexcept {\n \/\/ Acquires write_lock and automatically drops it when we leave scope.\n std::unique_lock<std::mutex> lock(list->write_lock);\n \/\/ We needn't give any constraints on the node lookup here. Since\n \/\/ insertions always happen under the lock, any list modifications\n \/\/ are already visible to us.\n widget *old = widget_find_fine(list, obj->key);\n\n \/\/ If nothing to replace we just insert it normally\n if (!old) {\n insert_before(obj, &list->head);\n return;\n }\n\n replace(old, obj);\n lock.unlock();\n\n \/\/ Wait until any readers that may be using the old node are gone\n \/\/ and then delete it.\n Epoch::rcuSynchronize();\n delete old;\n}\n\/\/\/ END SNIP\n\n}\n<commit_msg>don't use unique_lock for rculist rmc_simple<commit_after>\/\/ Copyright (c) 2014-2017 Michael J. Sullivan\n\/\/ Use of this source code is governed by an MIT-style license that can be\n\/\/ found in the LICENSE file.\n\n\/\/ This is a version of of rculist_user_rmc that open codes all the\n\/\/ list manipulation crap in instead of abstracting it away, in order\n\/\/ to simplify it as an example.\n\n#include \"rculist_user_rmc_simple.hpp\"\n#include \"epoch.hpp\"\n#include <mutex>\n\nnamespace rmclib {\n\n#include \"rculist_user_rmc_simple_macro.cpp\"\n\n\/\/\/ BEGIN SNIP\n\/\/ Perform a lookup in an RCU-protected widgetlist, with\n\/\/ execution edges drawn to the LGIVE return action.\n\/\/ Must be done in an Epoch read-side critical section.\nwidget *widget_find_fine(widgetlist *list, unsigned key) noexcept {\n XEDGE_HERE(load, load);\n XEDGE_HERE(load, use);\n widget *node;\n widget *head = &list->head;\n for (node = L(load, head->next); node != head; node = L(load, node->next)) {\n if (L(use, node->key) == key) {\n return LGIVE(use, node);\n }\n }\n return nullptr;\n}\n\n\/\/ Perform a lookup in an RCU-protected widgetlist with a traditional\n\/\/ post edge.\n\/\/ Must be done in an Epoch read-side critical section.\nwidget *widget_find(widgetlist *list, unsigned key) noexcept {\n XEDGE(find, post);\n return L(find, widget_find_fine(list, key));\n}\n\nstatic void insert_between(widget *n, widget *n1, widget *n2) {\n VEDGE(pre, link);\n n->prev = n1;\n n2->prev = n;\n n->next = n2;\n L(link, n1->next = n);\n}\nstatic void insert_before(widget *n, widget *n_old) {\n insert_between(n, n_old->prev, n_old);\n}\nstatic void replace(widget *n_old, widget *n_new) {\n insert_between(n_new, n_old->prev, n_old->next);\n}\n\n\/\/ Insert an object into a widgetlist, replacing an old object with\n\/\/ the same key, if necessary.\n\/\/ Must *not* be called from an Epoch read-side critical section.\nvoid widget_insert(widgetlist *list, widget *obj) noexcept {\n list->write_lock.lock();\n \/\/ We needn't give any constraints on the node lookup here. Since\n \/\/ insertions always happen under the lock, any list modifications\n \/\/ are already visible to us.\n widget *old = widget_find_fine(list, obj->key);\n\n \/\/ If nothing to replace we just insert it normally\n if (!old) {\n insert_before(obj, &list->head);\n list->write_lock.unlock();\n return;\n }\n\n replace(old, obj);\n list->write_lock.unlock();\n\n \/\/ Wait until any readers that may be using the old node are gone\n \/\/ and then delete it.\n Epoch::rcuSynchronize();\n delete old;\n}\n\/\/\/ END SNIP\n\n}\n<|endoftext|>"} {"text":"<commit_before>\/*****************************************************************************\n * VLC backend for the Phonon library *\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 * *\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 3 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#include \"vlcloader.h\"\n\n#include <QtCore\/QDebug>\n#include <QtCore\/QDir>\n#include <QtCore\/QLibrary>\n#include <QtCore\/QSettings>\n#include <QtCore\/QString>\n#include <QtCore\/QStringList>\n\n\/\/ Global variables\nlibvlc_instance_t *vlc_instance = 0;\nlibvlc_media_player_t *vlc_current_media_player = 0;\n\nnamespace Phonon\n{\nnamespace VLC {\n\nbool vlcInit(int debugLevl)\n{\n \/\/ Global variables\n vlc_instance = 0;\n\n QString path = vlcPath();\n if (!path.isEmpty()) {\n QString pluginsPath = QString(\"--plugin-path=\") + QDir::toNativeSeparators(QFileInfo(vlcPath()).dir().path());\n#if defined(Q_OS_UNIX)\n pluginsPath.append(\"\/vlc\");\n#elif defined(Q_OS_WIN)\n pluginsPath.append(\"\\\\plugins\");\n#endif\n QByteArray p = path.toLatin1();\n QByteArray pp = pluginsPath.toLatin1();\n\n QByteArray log;\n QByteArray logFile;\n QByteArray verboseLevl;\n if(debugLevl>0){\n log=\"--extraintf=logger\";\n#ifdef Q_WS_WIN\n\t logFile=QString(\"--logfile=\").append(qgetenv(\"APPDATA\")).append(\"\\\\vlc\\\\vlc-log.txt\").toLatin1();\n#else\n\t logFile=QString(\"--logfile=\").append(QDir::homePath()).append(\"\/.vlc\/vlc-log.txt\").toLatin1();\n#endif \/\/Q_WS_WIN\n verboseLevl=QString(\"--verbose=\").append(QString::number(debugLevl)).toLatin1();\n }\n\n \/\/ VLC command line options. See vlc --full-help\n const char *vlcArgs[] = {\n p.constData(),\n pp.constData(),\n log.constData(),\n logFile.constData(),\n verboseLevl.constData(),\n \"--intf=dummy\", \n \"--ignore-config\",\n \"--reset-plugins-cache\",\n \"--no-media-library\",\n \"--no-one-instance\",\n \"--no-osd\",\n \"--no-stats\",\n \"--no-video-title-show\",\n \"--album-art=0\"\n };\n\n \/\/ Create and initialize a libvlc instance (it should be done only once)\n vlc_instance = libvlc_new(sizeof(vlcArgs) \/ sizeof(*vlcArgs), vlcArgs);\n if(!vlc_instance)\n qDebug() << \"libvlc exception:\" << libvlc_errmsg();\n\n return true;\n } else {\n return false;\n }\n}\n\nvoid vlcRelease()\n{\n libvlc_release(vlc_instance);\n vlcUnload();\n}\n\n#if defined(Q_OS_UNIX)\nstatic bool libGreaterThan(const QString &lhs, const QString &rhs)\n{\n QStringList lhsparts = lhs.split(QLatin1Char('.'));\n QStringList rhsparts = rhs.split(QLatin1Char('.'));\n Q_ASSERT(lhsparts.count() > 1 && rhsparts.count() > 1);\n\n for (int i = 1; i < rhsparts.count(); ++i) {\n if (lhsparts.count() <= i)\n \/\/ left hand side is shorter, so it's less than rhs\n return false;\n\n bool ok = false;\n int b = 0;\n int a = lhsparts.at(i).toInt(&ok);\n if (ok)\n b = rhsparts.at(i).toInt(&ok);\n if (ok) {\n \/\/ both toInt succeeded\n if (a == b)\n continue;\n return a > b;\n } else {\n \/\/ compare as strings;\n if (lhsparts.at(i) == rhsparts.at(i))\n continue;\n return lhsparts.at(i) > rhsparts.at(i);\n }\n }\n\n \/\/ they compared strictly equally so far\n \/\/ lhs cannot be less than rhs\n return true;\n}\n#endif\n\nstatic QStringList findAllLibVlc()\n{\n QStringList paths;\n#if defined(Q_OS_UNIX)\n paths = QString::fromLatin1(qgetenv(\"LD_LIBRARY_PATH\"))\n .split(QLatin1Char(':'), QString::SkipEmptyParts);\n paths << QLatin1String(PHONON_LIB_INSTALL_DIR) << QLatin1String(\"\/usr\/lib\") << QLatin1String(\"\/usr\/local\/lib\");\n\n QStringList foundVlcs;\n foreach (const QString &path, paths) {\n QDir dir = QDir(path);\n QStringList entryList = dir.entryList(QStringList() << QLatin1String(\"libvlc.*\"), QDir::Files);\n\n qSort(entryList.begin(), entryList.end(), libGreaterThan);\n foreach (const QString &entry, entryList)\n foundVlcs << path + QLatin1Char('\/') + entry;\n }\n\n return foundVlcs;\n#elif defined(Q_OS_WIN)\n \/\/ Read VLC version and installation directory from Windows registry\n QSettings settings(QSettings::SystemScope, \"VideoLAN\", \"VLC\");\n QString vlcVersion = settings.value(\"Version\").toString();\n QString vlcInstallDir = settings.value(\"InstallDir\").toString();\n if (vlcVersion.startsWith(\"1.1\") && !vlcInstallDir.isEmpty()) {\n paths << vlcInstallDir + QLatin1Char('\\\\') + \"libvlc.dll\"; \n return paths;\n }else{\n \/\/If nothing is found in the registry try %PATH%\n QStringList searchPaths = QString::fromLatin1(qgetenv(\"PATH\"))\n .split(QLatin1Char(';'), QString::SkipEmptyParts);\n QStringList foundVlcs;\n foreach (const QString &sp, searchPaths) {\n QDir dir = QDir(sp);\n QStringList entryList = dir.entryList(QStringList() << QLatin1String(\"libvlc.dll\"), QDir::Files);\n foreach (const QString &entry, entryList)\n foundVlcs << sp + QLatin1Char('\\\\') + entry;\n }\n paths<<foundVlcs;\n return paths;\n }\n#endif\n}\n\nstatic QLibrary *vlcLibrary = 0;\n\nQString vlcPath()\n{\n static QString path;\n if (!path.isEmpty()) {\n return path;\n }\n\n vlcLibrary = new QLibrary();\n QStringList paths = findAllLibVlc();\n foreach(path, paths) {\n vlcLibrary->setFileName(path);\n\n if (!vlcLibrary->resolve(\"libvlc_exception_init\")) {\/\/\"libvlc_exception_init\" not contained in 1.1+\n return path;\n } else {\n qDebug(\"Cannot resolve the symbol or load VLC library\");\n }\n qWarning() << vlcLibrary->errorString();\n }\n\n vlcUnload();\n\n return QString();\n}\n\nvoid vlcUnload()\n{\n vlcLibrary->unload();\n delete vlcLibrary;\n vlcLibrary = 0;\n}\n\n}\n} \/\/ Namespace Phonon::VLC\n<commit_msg>use pid in logfile name, use QFile::encode for pathes<commit_after>\/*****************************************************************************\n * VLC backend for the Phonon library *\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 * *\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 3 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#include \"vlcloader.h\"\n\n#include <QtCore\/QDebug>\n#include <QtCore\/QDir>\n#include <QtCore\/QFile>\n#include <QtCore\/QLibrary>\n#include <QtCore\/QSettings>\n#include <QtCore\/QString>\n#include <QtCore\/QStringList>\n#include <QtCore\/QCoreApplication>\n\n\/\/ Global variables\nlibvlc_instance_t *vlc_instance = 0;\nlibvlc_media_player_t *vlc_current_media_player = 0;\n\nnamespace Phonon\n{\nnamespace VLC {\n\nbool vlcInit(int debugLevl)\n{\n \/\/ Global variables\n vlc_instance = 0;\n\n QString path = vlcPath();\n if (!path.isEmpty()) {\n QString pluginsPath = QString(\"--plugin-path=\") + QDir::toNativeSeparators(QFileInfo(vlcPath()).dir().path());\n#if defined(Q_OS_UNIX)\n pluginsPath.append(\"\/vlc\");\n#elif defined(Q_OS_WIN)\n pluginsPath.append(\"\\\\plugins\");\n#endif\n QByteArray p = QFile::encodeName(path);\n QByteArray pp = QFile::encodeName(pluginsPath);\n\n QByteArray log;\n QByteArray logFile;\n QByteArray verboseLevl;\n if(debugLevl>0){\n verboseLevl=QString(\"--verbose=\").append(QString::number(debugLevl)).toLatin1();\n log=\"--extraintf=logger\";\n logFile=\"--logfile=\";\n#ifdef Q_WS_WIN\n QDir logFilePath(QString(qgetenv(\"APPDATA\")).append(\"\/vlc\"));\n#else\n QDir logFilePath(QDir::homePath().append(\"\/.vlc\"));\n#endif \/\/Q_WS_WIN\n logFilePath.mkdir(\"log\");\n logFile.append(QFile::encodeName(QDir::toNativeSeparators(logFilePath.path().append(\"\/log\/vlc-log-\").append(QString::number(qApp->applicationPid())).append(\".txt\"))));\n }\n \/\/ VLC command line options. See vlc --full-help\n const char *vlcArgs[] = {\n p.constData(),\n pp.constData(),\n log.constData(),\n logFile.constData(),\n verboseLevl.constData(),\n \"--intf=dummy\", \n \"--ignore-config\",\n \"--reset-plugins-cache\",\n \"--no-media-library\",\n \"--no-one-instance\",\n \"--no-osd\",\n \"--no-stats\",\n \"--no-video-title-show\",\n \"--album-art=0\"\n };\n\n \/\/ Create and initialize a libvlc instance (it should be done only once)\n vlc_instance = libvlc_new(sizeof(vlcArgs) \/ sizeof(*vlcArgs), vlcArgs);\n if(!vlc_instance)\n qDebug() << \"libvlc exception:\" << libvlc_errmsg();\n\n return true;\n } else {\n return false;\n }\n}\n\nvoid vlcRelease()\n{\n libvlc_release(vlc_instance);\n vlcUnload();\n}\n\n#if defined(Q_OS_UNIX)\nstatic bool libGreaterThan(const QString &lhs, const QString &rhs)\n{\n QStringList lhsparts = lhs.split(QLatin1Char('.'));\n QStringList rhsparts = rhs.split(QLatin1Char('.'));\n Q_ASSERT(lhsparts.count() > 1 && rhsparts.count() > 1);\n\n for (int i = 1; i < rhsparts.count(); ++i) {\n if (lhsparts.count() <= i)\n \/\/ left hand side is shorter, so it's less than rhs\n return false;\n\n bool ok = false;\n int b = 0;\n int a = lhsparts.at(i).toInt(&ok);\n if (ok)\n b = rhsparts.at(i).toInt(&ok);\n if (ok) {\n \/\/ both toInt succeeded\n if (a == b)\n continue;\n return a > b;\n } else {\n \/\/ compare as strings;\n if (lhsparts.at(i) == rhsparts.at(i))\n continue;\n return lhsparts.at(i) > rhsparts.at(i);\n }\n }\n\n \/\/ they compared strictly equally so far\n \/\/ lhs cannot be less than rhs\n return true;\n}\n#endif\n\nstatic QStringList findAllLibVlc()\n{\n QStringList paths;\n#if defined(Q_OS_UNIX)\n paths = QString::fromLatin1(qgetenv(\"LD_LIBRARY_PATH\"))\n .split(QLatin1Char(':'), QString::SkipEmptyParts);\n paths << QLatin1String(PHONON_LIB_INSTALL_DIR) << QLatin1String(\"\/usr\/lib\") << QLatin1String(\"\/usr\/local\/lib\");\n\n QStringList foundVlcs;\n foreach (const QString &path, paths) {\n QDir dir = QDir(path);\n QStringList entryList = dir.entryList(QStringList() << QLatin1String(\"libvlc.*\"), QDir::Files);\n\n qSort(entryList.begin(), entryList.end(), libGreaterThan);\n foreach (const QString &entry, entryList)\n foundVlcs << path + QLatin1Char('\/') + entry;\n }\n\n return foundVlcs;\n#elif defined(Q_OS_WIN)\n \/\/ Read VLC version and installation directory from Windows registry\n QSettings settings(QSettings::SystemScope, \"VideoLAN\", \"VLC\");\n QString vlcVersion = settings.value(\"Version\").toString();\n QString vlcInstallDir = settings.value(\"InstallDir\").toString();\n if (vlcVersion.startsWith(\"1.1\") && !vlcInstallDir.isEmpty()) {\n paths << vlcInstallDir + QLatin1Char('\\\\') + \"libvlc.dll\"; \n return paths;\n }else{\n \/\/If nothing is found in the registry try %PATH%\n QStringList searchPaths = QString::fromLatin1(qgetenv(\"PATH\"))\n .split(QLatin1Char(';'), QString::SkipEmptyParts);\n QStringList foundVlcs;\n foreach (const QString &sp, searchPaths) {\n QDir dir = QDir(sp);\n QStringList entryList = dir.entryList(QStringList() << QLatin1String(\"libvlc.dll\"), QDir::Files);\n foreach (const QString &entry, entryList)\n foundVlcs << sp + QLatin1Char('\\\\') + entry;\n }\n paths<<foundVlcs;\n return paths;\n }\n#endif\n}\n\nstatic QLibrary *vlcLibrary = 0;\n\nQString vlcPath()\n{\n static QString path;\n if (!path.isEmpty()) {\n return path;\n }\n\n vlcLibrary = new QLibrary();\n QStringList paths = findAllLibVlc();\n foreach(path, paths) {\n vlcLibrary->setFileName(path);\n\n if (!vlcLibrary->resolve(\"libvlc_exception_init\")) {\/\/\"libvlc_exception_init\" not contained in 1.1+\n return path;\n } else {\n qDebug(\"Cannot resolve the symbol or load VLC library\");\n }\n qWarning() << vlcLibrary->errorString();\n }\n\n vlcUnload();\n\n return QString();\n}\n\nvoid vlcUnload()\n{\n vlcLibrary->unload();\n delete vlcLibrary;\n vlcLibrary = 0;\n}\n\n}\n} \/\/ Namespace Phonon::VLC\n<|endoftext|>"} {"text":"<commit_before>#include <stdio.h>\n\nmain() \n{\n\tstd::cout << \"Hello World\";\n}\n\n<commit_msg>edit hello world<commit_after>#include <stdio.h>\n#include <iostream>\n\nint main() \n{\n\tstd::cout << \"Hello World\";\n}\n\n<|endoftext|>"} {"text":"<commit_before>\/\/===--- Stubs.cpp - Swift Language ABI Runtime Stubs ---------------------===\/\/\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\/\/ Misc stubs for functions which should be in swift.swift, but are difficult\n\/\/ or impossible to write in swift at the moment.\n\/\/\n\/\/===----------------------------------------------------------------------===\/\/\n\n#include <mach\/mach_time.h>\n#include <sys\/resource.h>\n#include <sys\/errno.h>\n#include <cstring>\n#include <cstdint>\n#include <cstdio>\n#include <cstdlib>\n#include <algorithm>\n#include \"llvm\/ADT\/StringExtras.h\"\n\n\/\/ FIXME: We shouldn't be writing implemenetations for functions in the swift\n\/\/ module in C, and this isn't really an ideal place to put those\n\/\/ implementations.\nextern \"C\" void _TSs5printFT3valNSs5Int64_T_(int64_t l) {\n printf(\"%lld\", l);\n}\n\nextern \"C\" void _TSs5printFT3valNSs6UInt64_T_(uint64_t l) {\n printf(\"%llu\", l);\n}\n\nextern \"C\" void _TSs5printFT3valNSs6Double_T_(double l) {\n char Buffer[256];\n sprintf(Buffer, \"%g\", l);\n if (strchr(Buffer, 'e') == nullptr && strchr(Buffer, '.') == nullptr)\n strcat(Buffer, \".0\");\n printf(\"%s\", Buffer);\n}\n\n\/\/ static func String(v : Int128, radix : Int) -> String\nextern \"C\"\nunsigned long long\nprint_int(char* TmpBuffer, __int64_t buf_len, __int128_t X, uint64_t Radix) {\n assert(Radix != 0 && Radix <= 36 && \"Invalid radix for string conversion\");\n char *P = TmpBuffer;\n \n bool WasNeg = X < 0;\n __uint128_t Y = WasNeg ? -X : X;\n\n if (Y == 0) {\n *P++ = '0'; \/\/ Special case. \n } else if (Radix == 10) { \/\/ Special case for 10, since we care so much about performance right now.\n while (Y) {\n *P++ = '0' + char(Y % 10);\n Y \/= 10;\n }\n } else {\n unsigned Radix32 = Radix;\n while (Y) {\n *P++ = llvm::hexdigit(Y % Radix32);\n Y \/= Radix32;\n }\n }\n \n if (WasNeg) *P++ = '-';\n std::reverse(TmpBuffer, P);\n return size_t(P - TmpBuffer);\n}\n\n\/\/ static func String(v : Double) -> String\nextern \"C\"\nunsigned long long\nprint_double(char* Buffer, double X) {\n long long i = sprintf(Buffer, \"%g\", X);\n if (strchr(Buffer, 'e') == nullptr && strchr(Buffer, '.') == nullptr) {\n Buffer[i++] = '.';\n Buffer[i++] = '0';\n }\n if (i < 0) {\n __builtin_trap();\n }\n return i;\n}\n\nextern \"C\" bool _TNSs4Bool13getLogicValuefRS_FT_i1(bool* b) {\n return *b;\n}\n\n\/\/ FIXME: load_protocol and store_protocol are extremely ugly hacks.\nstruct protocol {\n void **witness_table;\n char buffer[24];\n};\n\nextern \"C\"\nvoid\nload_protocol(protocol *retval, protocol *p) {\n retval->witness_table = p->witness_table;\n typedef void* (*copyTy)(void*, void*, void**);\n copyTy initializeBufferWithCopyOfBuffer = (copyTy)(size_t)retval->witness_table[1];\n initializeBufferWithCopyOfBuffer(&retval->buffer,&p->buffer,retval->witness_table);\n}\n\nextern \"C\"\nvoid\nstore_protocol(protocol *value, protocol *p) {\n p->witness_table = value->witness_table;\n typedef void* (*copyTy)(void*, void*, void**);\n copyTy initializeBufferWithCopyOfBuffer = (copyTy)(size_t)value->witness_table[1];\n initializeBufferWithCopyOfBuffer(&p->buffer,&value->buffer,value->witness_table);\n}\n\nstatic bool\n_swift_replOutputIsUTF8(void) {\n const char *lang = getenv(\"LANG\");\n return lang && strstr(lang, \"UTF-8\");\n}\n\nextern \"C\"\nuint32_t\nswift_replOutputIsUTF8(void) {\n static auto rval = _swift_replOutputIsUTF8();\n return rval;\n}\n\n#if defined(__i386__) || defined(__x86_64__)\nstatic inline uint64_t\nrdtsc() {\n uint32_t lo, hi;\n asm(\"rdtsc\" : \"=a\" (lo), \"=d\" (hi));\n return uint64_t(hi) << 32 | lo;\n}\n#else\n#error \"not supported\"\n#endif\n\nstatic double interruptOverhead;\nstatic double loopOverhead;\n\nstatic uint64_t\n_swift_startBenchmark(void) {\n return rdtsc();\n}\n\nextern \"C\"\nvoid\nswift_printBenchmark(uint64_t start, uint64_t laps, char *buffer, int64_t len) {\n double val = rdtsc() - start;\n val \/= laps;\n val \/= interruptOverhead;\n val -= loopOverhead;\n printf(\"%12.2f %*s\\n\", val, (int)len, buffer);\n}\n\nextern \"C\"\n__attribute__((noinline,used))\n__typeof__(&_swift_startBenchmark)\n_swift_initBenchmark() asm(\"_swift_startBenchmark\");\n\n__typeof__(&_swift_startBenchmark)\n_swift_initBenchmark() {\n asm(\".symbol_resolver _swift_startBenchmark\");\n union {\n unsigned reg[4*3];\n char brand[48];\n } u;\n char brand[48];\n char *s2 = u.brand;\n char *s1 = brand;\n unsigned eax, ebx, ecx, edx;\n memset(&u, 0, sizeof(u));\n\n\n eax = 0x80000002;\n asm(\"cpuid\" : \"+a\" (eax), \"=b\" (ebx), \"=c\" (ecx), \"=d\" (edx));\n u.reg[0] = eax;\n u.reg[1] = ebx;\n u.reg[2] = ecx;\n u.reg[3] = edx;\n\n eax = 0x80000003;\n asm(\"cpuid\" : \"+a\" (eax), \"=b\" (ebx), \"=c\" (ecx), \"=d\" (edx));\n u.reg[4] = eax;\n u.reg[5] = ebx;\n u.reg[6] = ecx;\n u.reg[7] = edx;\n\n eax = 0x80000004;\n asm(\"cpuid\" : \"+a\" (eax), \"=b\" (ebx), \"=c\" (ecx), \"=d\" (edx));\n u.reg[8] = eax;\n u.reg[9] = ebx;\n u.reg[10] = ecx;\n u.reg[11] = edx;\n\n while (*s2 == ' ') {\n s2++;\n }\n do {\n while (s2[0] == ' ' && s2[1] == ' ') {\n s2++;\n }\n } while ((*s1++ = *s2++));\n printf(\"Processor: %s\\n\\n\", brand);\n\n uint64_t start = rdtsc();\n for (unsigned long i = 0; i < 1000000000ull; i++) {\n asm(\"\");\n }\n double delta = (rdtsc() - start) \/ 1000000000.0;\n assert((delta >= 1.0 && delta < 1.05) || (delta >= 2.0 && delta < 2.05));\n if (delta >= 2.0) {\n loopOverhead = 2.0;\n interruptOverhead = delta \/ 2.0;\n } else {\n loopOverhead = 1.0;\n interruptOverhead = delta \/ 1.0;\n }\n assert((interruptOverhead - 1.0) < 0.01);\n\n eax = 6;\n asm(\"cpuid\" : \"+a\" (eax), \"=b\" (ebx), \"=c\" (ecx), \"=d\" (edx));\n\n if (eax & 2) {\n fprintf(stderr, \"WARNING: TurboBoost. Results will be less reliable.\\n\");\n fprintf(stderr, \" Consider: sudo \/usr\/local\/bin\/pstates -D\\n\\n\");\n }\n\n \/\/ Sigh... getpriority() can legitimately return -1\n errno = 0;\n int pri = getpriority(PRIO_PROCESS, 0);\n assert(errno == 0);\n if (pri >= 0) {\n fprintf(stderr, \"WARNING: Non-elevated priority. Results will be less reliable.\\n\");\n fprintf(stderr, \" Consider: sudo nice -n -15 .\/myBench\\n\\n\");\n }\n\n return _swift_startBenchmark;\n}\n<commit_msg>Delay I\/O to avoid OS-vs-benchmark CPU contention<commit_after>\/\/===--- Stubs.cpp - Swift Language ABI Runtime Stubs ---------------------===\/\/\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\/\/ Misc stubs for functions which should be in swift.swift, but are difficult\n\/\/ or impossible to write in swift at the moment.\n\/\/\n\/\/===----------------------------------------------------------------------===\/\/\n\n#include <mach\/mach_time.h>\n#include <sys\/resource.h>\n#include <sys\/errno.h>\n#include <cstring>\n#include <cstdint>\n#include <cstdio>\n#include <cstdlib>\n#include <algorithm>\n#include \"llvm\/ADT\/StringExtras.h\"\n\n\/\/ FIXME: We shouldn't be writing implemenetations for functions in the swift\n\/\/ module in C, and this isn't really an ideal place to put those\n\/\/ implementations.\nextern \"C\" void _TSs5printFT3valNSs5Int64_T_(int64_t l) {\n printf(\"%lld\", l);\n}\n\nextern \"C\" void _TSs5printFT3valNSs6UInt64_T_(uint64_t l) {\n printf(\"%llu\", l);\n}\n\nextern \"C\" void _TSs5printFT3valNSs6Double_T_(double l) {\n char Buffer[256];\n sprintf(Buffer, \"%g\", l);\n if (strchr(Buffer, 'e') == nullptr && strchr(Buffer, '.') == nullptr)\n strcat(Buffer, \".0\");\n printf(\"%s\", Buffer);\n}\n\n\/\/ static func String(v : Int128, radix : Int) -> String\nextern \"C\"\nunsigned long long\nprint_int(char* TmpBuffer, __int64_t buf_len, __int128_t X, uint64_t Radix) {\n assert(Radix != 0 && Radix <= 36 && \"Invalid radix for string conversion\");\n char *P = TmpBuffer;\n \n bool WasNeg = X < 0;\n __uint128_t Y = WasNeg ? -X : X;\n\n if (Y == 0) {\n *P++ = '0'; \/\/ Special case. \n } else if (Radix == 10) { \/\/ Special case for 10, since we care so much about performance right now.\n while (Y) {\n *P++ = '0' + char(Y % 10);\n Y \/= 10;\n }\n } else {\n unsigned Radix32 = Radix;\n while (Y) {\n *P++ = llvm::hexdigit(Y % Radix32);\n Y \/= Radix32;\n }\n }\n \n if (WasNeg) *P++ = '-';\n std::reverse(TmpBuffer, P);\n return size_t(P - TmpBuffer);\n}\n\n\/\/ static func String(v : Double) -> String\nextern \"C\"\nunsigned long long\nprint_double(char* Buffer, double X) {\n long long i = sprintf(Buffer, \"%g\", X);\n if (strchr(Buffer, 'e') == nullptr && strchr(Buffer, '.') == nullptr) {\n Buffer[i++] = '.';\n Buffer[i++] = '0';\n }\n if (i < 0) {\n __builtin_trap();\n }\n return i;\n}\n\nextern \"C\" bool _TNSs4Bool13getLogicValuefRS_FT_i1(bool* b) {\n return *b;\n}\n\n\/\/ FIXME: load_protocol and store_protocol are extremely ugly hacks.\nstruct protocol {\n void **witness_table;\n char buffer[24];\n};\n\nextern \"C\"\nvoid\nload_protocol(protocol *retval, protocol *p) {\n retval->witness_table = p->witness_table;\n typedef void* (*copyTy)(void*, void*, void**);\n copyTy initializeBufferWithCopyOfBuffer = (copyTy)(size_t)retval->witness_table[1];\n initializeBufferWithCopyOfBuffer(&retval->buffer,&p->buffer,retval->witness_table);\n}\n\nextern \"C\"\nvoid\nstore_protocol(protocol *value, protocol *p) {\n p->witness_table = value->witness_table;\n typedef void* (*copyTy)(void*, void*, void**);\n copyTy initializeBufferWithCopyOfBuffer = (copyTy)(size_t)value->witness_table[1];\n initializeBufferWithCopyOfBuffer(&p->buffer,&value->buffer,value->witness_table);\n}\n\nstatic bool\n_swift_replOutputIsUTF8(void) {\n const char *lang = getenv(\"LANG\");\n return lang && strstr(lang, \"UTF-8\");\n}\n\nextern \"C\"\nuint32_t\nswift_replOutputIsUTF8(void) {\n static auto rval = _swift_replOutputIsUTF8();\n return rval;\n}\n\n#if defined(__i386__) || defined(__x86_64__)\nstatic inline uint64_t\nrdtsc() {\n uint32_t lo, hi;\n asm(\"rdtsc\" : \"=a\" (lo), \"=d\" (hi));\n return uint64_t(hi) << 32 | lo;\n}\n#else\n#error \"not supported\"\n#endif\n\nstatic double interruptOverhead;\nstatic double loopOverhead;\n\nstatic uint64_t\n_swift_startBenchmark(void) {\n return rdtsc();\n}\n\nextern \"C\"\nvoid\nswift_printBenchmark(uint64_t start, uint64_t laps, char *buffer, int64_t len) {\n double val = rdtsc() - start;\n val \/= laps;\n val \/= interruptOverhead;\n val -= loopOverhead;\n printf(\"%12.2f %*s\\n\", val, (int)len, buffer);\n}\n\nextern \"C\"\n__attribute__((noinline,used))\n__typeof__(&_swift_startBenchmark)\n_swift_initBenchmark() asm(\"_swift_startBenchmark\");\n\n__typeof__(&_swift_startBenchmark)\n_swift_initBenchmark() {\n asm(\".symbol_resolver _swift_startBenchmark\");\n union {\n unsigned reg[4*3];\n char brand[48];\n } u;\n char brand[48];\n char *s2 = u.brand;\n char *s1 = brand;\n unsigned eax, ebx, ecx, edx;\n memset(&u, 0, sizeof(u));\n int r;\n\n \/\/ Let's not have the OS compete with our CPU time if we can avoid it\n r = setvbuf(stdout, 0, _IOFBF, 0);\n assert(r == 0);\n\n eax = 0x80000002;\n asm(\"cpuid\" : \"+a\" (eax), \"=b\" (ebx), \"=c\" (ecx), \"=d\" (edx));\n u.reg[0] = eax;\n u.reg[1] = ebx;\n u.reg[2] = ecx;\n u.reg[3] = edx;\n\n eax = 0x80000003;\n asm(\"cpuid\" : \"+a\" (eax), \"=b\" (ebx), \"=c\" (ecx), \"=d\" (edx));\n u.reg[4] = eax;\n u.reg[5] = ebx;\n u.reg[6] = ecx;\n u.reg[7] = edx;\n\n eax = 0x80000004;\n asm(\"cpuid\" : \"+a\" (eax), \"=b\" (ebx), \"=c\" (ecx), \"=d\" (edx));\n u.reg[8] = eax;\n u.reg[9] = ebx;\n u.reg[10] = ecx;\n u.reg[11] = edx;\n\n while (*s2 == ' ') {\n s2++;\n }\n do {\n while (s2[0] == ' ' && s2[1] == ' ') {\n s2++;\n }\n } while ((*s1++ = *s2++));\n printf(\"Processor: %s\\n\\n\", brand);\n\n uint64_t start = rdtsc();\n for (unsigned long i = 0; i < 1000000000ull; i++) {\n asm(\"\");\n }\n double delta = (rdtsc() - start) \/ 1000000000.0;\n assert((delta >= 1.0 && delta < 1.05) || (delta >= 2.0 && delta < 2.05));\n if (delta >= 2.0) {\n loopOverhead = 2.0;\n interruptOverhead = delta \/ 2.0;\n } else {\n loopOverhead = 1.0;\n interruptOverhead = delta \/ 1.0;\n }\n assert((interruptOverhead - 1.0) < 0.01);\n\n eax = 6;\n asm(\"cpuid\" : \"+a\" (eax), \"=b\" (ebx), \"=c\" (ecx), \"=d\" (edx));\n\n if (eax & 2) {\n fprintf(stderr, \"WARNING: TurboBoost. Results will be less reliable.\\n\");\n fprintf(stderr, \" Consider: sudo \/usr\/local\/bin\/pstates -D\\n\\n\");\n }\n\n \/\/ Sigh... getpriority() can legitimately return -1\n errno = 0;\n int pri = getpriority(PRIO_PROCESS, 0);\n assert(errno == 0);\n if (pri >= 0) {\n fprintf(stderr, \"WARNING: Non-elevated priority. Results will be less reliable.\\n\");\n fprintf(stderr, \" Consider: sudo nice -n -15 .\/myBench\\n\\n\");\n }\n\n return _swift_startBenchmark;\n}\n<|endoftext|>"} {"text":"<commit_before>\/\/\n\/\/ gunzip.cpp\n\/\/ RhoLib\n\/\/\n\/\/ Created by Alex Epifanoff on 23.09.14.\n\/\/\n\/\/\n\n#include \"gunzip.h\"\n#include \"zlib.h\"\n#include <stdio.h>\n\n\nnamespace gunzip\n{\n\n using namespace zlib;\n\n int UnzipGzip(const char* inputFilename, const char* outputFilename)\n {\n static const int LENGTH = 0x1000;\n \n gzFile input;\n FILE* output;\n \n input = gzopen( inputFilename, \"r\" );\n if ( 0 == input )\n {\n return -1;\n }\n \n output = fopen( outputFilename, \"w\" );\n if ( 0 == output )\n {\n gzclose(input);\n return -1;\n }\n \n int status = 0;\n unsigned char buffer[LENGTH];\n \n while (true)\n {\n int bytes_read = gzread(input, buffer, LENGTH);\n\n if (fwrite(buffer,sizeof(char),bytes_read,output) != bytes_read )\n {\n status = -1;\n break;\n }\n \n if (bytes_read < LENGTH )\n {\n if (!gzeof (input))\n {\n status = -1;\n }\n break;\n }\n }\n \n gzclose(input);\n fclose(output);\n \n return status;\n }\n\n\n\/*\n int UnzipGzip(const char* inputFilename, const char* outputFilename)\n {\n FILE* input;\n FILE* output;\n \n static const int CHUNK_SIZE = 0x4000;\n \n z_stream strm = {0};\n unsigned char in[CHUNK_SIZE];\n unsigned char out[CHUNK_SIZE];\n \n strm.zalloc = Z_NULL;\n strm.zfree = Z_NULL;\n strm.opaque = Z_NULL;\n strm.next_in = in;\n strm.avail_in = 0;\n strm.next_out = out;\n \n int status = 0;\n \n input = fopen(inputFilename, \"rb\" );\n if ( 0 == input ) goto unzip_gzip_error;\n \n output = fopen(outputFilename, \"wb\" );\n if ( 0 == output ) goto unzip_gzip_error;\n \n if ( inflateInit2(&strm) < 0 ) goto unzip_gzip_error;\n\n while (true) {\n int bytes_read;\n\n bytes_read = fread (in, sizeof (char), sizeof (in), input);\n if (ferror(input)) goto unzip_gzip_error;\n\n strm.avail_in = bytes_read;\n do {\n strm.avail_out = CHUNK_SIZE;\n if (inflate(&strm, Z_NO_FLUSH) < 0) goto unzip_gzip_error;\n \n fwrite(out, sizeof(char), strm.avail_out, output);\n \n if (ferror(output)) goto unzip_gzip_error;\n }\n \n while (strm.avail_out == 0);\n if (feof (input)) {\n inflateEnd (& strm);\n break;\n }\n }\n \n status |= fclose(input);\n status |= fclose(output);\n\n return (0==status?0:-1);\n \n unzip_gzip_error:\n\n inflateEnd (& strm);\n \n fclose(input);\n fclose(output);\n\n return -1;\n }\n *\/\n \n}<commit_msg>gzip: change file open modes<commit_after>\/\/\n\/\/ gunzip.cpp\n\/\/ RhoLib\n\/\/\n\/\/ Created by Alex Epifanoff on 23.09.14.\n\/\/\n\/\/\n\n#include \"gunzip.h\"\n#include \"zlib.h\"\n#include <stdio.h>\n\nnamespace gunzip\n{\n\n using namespace zlib;\n\n int UnzipGzip(const char* inputFilename, const char* outputFilename)\n {\n static const int LENGTH = 0x1000;\n \n gzFile input;\n FILE* output;\n \n input = gzopen( inputFilename, \"rb\" );\n if ( 0 == input )\n {\n return -1;\n }\n \n output = fopen( outputFilename, \"wb\" );\n if ( 0 == output )\n {\n gzclose(input);\n return -1;\n }\n \n int status = 0;\n unsigned char buffer[LENGTH];\n \n while (true)\n {\n int bytes_read = gzread(input, buffer, LENGTH);\n\n if (fwrite(buffer,sizeof(char),bytes_read,output) != bytes_read )\n {\n status = -1;\n break;\n }\n \n if (bytes_read < LENGTH )\n {\n if (!gzeof (input))\n {\n status = -1;\n }\n break;\n }\n }\n \n gzclose(input);\n fclose(output);\n \n return status;\n }\n\n\n\/*\n int UnzipGzip(const char* inputFilename, const char* outputFilename)\n {\n FILE* input;\n FILE* output;\n \n static const int CHUNK_SIZE = 0x4000;\n \n z_stream strm = {0};\n unsigned char in[CHUNK_SIZE];\n unsigned char out[CHUNK_SIZE];\n \n strm.zalloc = Z_NULL;\n strm.zfree = Z_NULL;\n strm.opaque = Z_NULL;\n strm.next_in = in;\n strm.avail_in = 0;\n strm.next_out = out;\n \n int status = 0;\n \n input = fopen(inputFilename, \"rb\" );\n if ( 0 == input ) goto unzip_gzip_error;\n \n output = fopen(outputFilename, \"wb\" );\n if ( 0 == output ) goto unzip_gzip_error;\n \n if ( inflateInit2(&strm) < 0 ) goto unzip_gzip_error;\n\n while (true) {\n int bytes_read;\n\n bytes_read = fread (in, sizeof (char), sizeof (in), input);\n if (ferror(input)) goto unzip_gzip_error;\n\n strm.avail_in = bytes_read;\n do {\n strm.avail_out = CHUNK_SIZE;\n if (inflate(&strm, Z_NO_FLUSH) < 0) goto unzip_gzip_error;\n \n fwrite(out, sizeof(char), strm.avail_out, output);\n \n if (ferror(output)) goto unzip_gzip_error;\n }\n \n while (strm.avail_out == 0);\n if (feof (input)) {\n inflateEnd (& strm);\n break;\n }\n }\n \n status |= fclose(input);\n status |= fclose(output);\n\n return (0==status?0:-1);\n \n unzip_gzip_error:\n\n inflateEnd (& strm);\n \n fclose(input);\n fclose(output);\n\n return -1;\n }\n *\/\n \n}<|endoftext|>"} {"text":"<commit_before>#include <stdlib.h>\n#include <stdio.h>\n#include <errno.h>\n\n#include <getopt.h>\n#include <unistd.h>\n\n#define OSMIUM_MAIN\n#include <osmium.hpp>\n\n#include <geos\/geom\/MultiPolygon.h>\n#include <geos\/algorithm\/locate\/IndexedPointInAreaLocator.h>\n\n#include \"softcut.hpp\"\n#include \"hardcut.hpp\"\n\ntemplate <class TExtractInfo> bool readConfig(char *conffile, Cut<TExtractInfo> *cutter);\ngeos::geom::Geometry *readPolyFile(char* file);\n\nint main(int argc, char *argv[]) {\n bool softcut = false;\n bool debug = false;\n char *filename, *conffile;\n\n static struct option long_options[] = {\n {\"debug\", no_argument, 0, 'd'},\n {\"softcut\", no_argument, 0, 's'},\n {\"hardcut\", no_argument, 0, 'h'},\n {0, 0, 0, 0}\n };\n\n while (1) {\n int c = getopt_long(argc, argv, \"dsh\", long_options, 0);\n if (c == -1)\n break;\n\n switch (c) {\n case 'd':\n debug = true;\n break;\n case 's':\n softcut = true;\n break;\n case 'h':\n softcut = false;\n break;\n }\n }\n\n if (optind > argc-2) {\n fprintf(stderr, \"Usage: %s [OPTIONS] OSMFILE CONFIGFILE\\n\", argv[0]);\n return 1;\n }\n\n filename = argv[optind];\n conffile = argv[optind+1];\n\n if(softcut & !strcmp(filename, \"-\")) {\n fprintf(stderr, \"Can't read from stdin when in softcut\\n\");\n return 1;\n }\n\n Osmium::Framework osmium(debug);\n\n if(softcut) {\n Softcut *cutter = new Softcut();\n cutter->debug = debug;\n if(!readConfig(conffile, cutter))\n {\n fprintf(stderr, \"error reading config\\n\");\n return 1;\n }\n\n cutter->phase = Softcut::PHASE::ONE;\n osmium.parse_osmfile<Softcut>(filename, cutter);\n\n cutter->phase = Softcut::PHASE::TWO;\n osmium.parse_osmfile<Softcut>(filename, cutter);\n\n delete cutter;\n } else {\n Hardcut *cutter = new Hardcut();\n cutter->debug = debug;\n if(!readConfig(conffile, cutter))\n {\n fprintf(stderr, \"error reading config\\n\");\n return 1;\n }\n\n osmium.parse_osmfile<Hardcut>(filename, cutter);\n delete cutter;\n }\n\n return 0;\n}\n\ntemplate <class TExtractInfo> bool readConfig(char *conffile, Cut<TExtractInfo> *cutter) {\n const int linelen = 4096;\n\n FILE *fp = fopen(conffile, \"r\");\n if(!fp) {\n fprintf(stderr, \"unable to open config file %s\\n\", conffile);\n return false;\n }\n\n char line[linelen];\n while(fgets(line, linelen-1, fp)) {\n line[linelen-1] = '\\0';\n if(line[0] == '#' || line[0] == '\\r' || line[0] == '\\n' || line[0] == '\\0')\n continue;\n\n int n = 0;\n char *tok = strtok(line, \"\\t \");\n\n const char *name = NULL;\n double minlon = 0, minlat = 0, maxlon = 0, maxlat = 0;\n char type = '\\0';\n\n while(tok) {\n switch(n) {\n case 0:\n name = tok;\n break;\n\n case 1:\n if(0 == strcmp(\"BBOX\", tok))\n type = 'b';\n else if(0 == strcmp(\"POLY\", tok))\n type = 'p';\n else {\n type = '\\0';\n fprintf(stderr, \"output %s of type %s: unkown output type\\n\", name, tok);\n return false;\n }\n break;\n\n case 2:\n switch(type) {\n case 'b':\n if(4 == sscanf(tok, \"%lf,%lf,%lf,%lf\", &minlon, &minlat, &maxlon, &maxlat)) {\n if(minlon > maxlon) {\n double d = maxlon;\n minlon = maxlon;\n maxlon = d;\n }\n\n if(minlat > maxlat) {\n double d = maxlat;\n minlat = maxlat;\n maxlat = d;\n }\n cutter->addBbox(name, minlon, minlat, maxlon, maxlat);\n }\n break;\n case 'p':\n geos::geom::Geometry *poly = readPolyFile(tok);\n cutter->addPoly(name, poly);\n break;\n }\n break;\n }\n\n tok = strtok(NULL, \"\\t \");\n n++;\n }\n }\n fclose(fp);\n return true;\n}\n\ngeos::geom::Geometry *readPolyFile(char* file) {\n \/\/ shorthand\n geos::geom::GeometryFactory *f = Osmium::global.geos_geometry_factory;\n\n std::vector<geos::geom::Coordinate> *c;\n std::vector<geos::geom::Geometry*> outer;\n std::vector<geos::geom::Geometry*> inner;\n\n c = new std::vector<geos::geom::Coordinate>();\n c->push_back(geos::geom::Coordinate(10, 10, DoubleNotANumber));\n c->push_back(geos::geom::Coordinate(10, 20, DoubleNotANumber));\n c->push_back(geos::geom::Coordinate(20, 20, DoubleNotANumber));\n c->push_back(geos::geom::Coordinate(20, 10, DoubleNotANumber));\n c->push_back(geos::geom::Coordinate(10, 10, DoubleNotANumber));\n\n outer.push_back(\n f->createPolygon(\n f->createLinearRing(\n f->getCoordinateSequenceFactory()->create(c)\n ),\n NULL\n )\n );\n\n c = new std::vector<geos::geom::Coordinate>();\n c->push_back(geos::geom::Coordinate(40, 10, DoubleNotANumber));\n c->push_back(geos::geom::Coordinate(40, 20, DoubleNotANumber));\n c->push_back(geos::geom::Coordinate(50, 20, DoubleNotANumber));\n c->push_back(geos::geom::Coordinate(50, 10, DoubleNotANumber));\n c->push_back(geos::geom::Coordinate(40, 10, DoubleNotANumber));\n outer.push_back(\n f->createPolygon(\n f->createLinearRing(\n f->getCoordinateSequenceFactory()->create(c)\n ),\n NULL\n )\n );\n\n c = new std::vector<geos::geom::Coordinate>();\n c->push_back(geos::geom::Coordinate(9, 12, DoubleNotANumber));\n c->push_back(geos::geom::Coordinate(9, 18, DoubleNotANumber));\n c->push_back(geos::geom::Coordinate(18, 18, DoubleNotANumber));\n c->push_back(geos::geom::Coordinate(18, 12, DoubleNotANumber));\n c->push_back(geos::geom::Coordinate(9, 12, DoubleNotANumber));\n\n inner.push_back(\n f->createPolygon(\n f->createLinearRing(\n f->getCoordinateSequenceFactory()->create(c)\n ),\n NULL\n )\n );\n\n\n\n geos::geom::MultiPolygon *outerPoly = f->createMultiPolygon(outer);\n geos::geom::MultiPolygon *innerPoly = f->createMultiPolygon(inner);\n geos::geom::Geometry *poly = outerPoly->difference(innerPoly);\n\n delete outerPoly;\n delete innerPoly;\n\n \/*\n geos::algorithm::locate::IndexedPointInAreaLocator *locator =\n new geos::algorithm::locate::IndexedPointInAreaLocator(*const_cast<const geos::geom::Geometry *>(poly));\n\n printf(\"%d %d: %d (left out)\\n\", 9, 15, locator->locate(new geos::geom::Coordinate( 9, 15, DoubleNotANumber)));\n printf(\"%d %d: %d (on border)\\n\", 10, 15, locator->locate(new geos::geom::Coordinate( 10, 15, DoubleNotANumber)));\n printf(\"%d %d: %d (inside left border)\\n\", 11, 15, locator->locate(new geos::geom::Coordinate(11, 15, DoubleNotANumber)));\n printf(\"%d %d: %d (in hole)\\n\", 15, 15, locator->locate(new geos::geom::Coordinate(15, 15, DoubleNotANumber)));\n printf(\"%d %d: %d (in hole)\\n\", 17, 15, locator->locate(new geos::geom::Coordinate(17, 15, DoubleNotANumber)));\n printf(\"%d %d: %d (inside right border)\\n\", 19, 15, locator->locate(new geos::geom::Coordinate(19, 15, DoubleNotANumber)));\n printf(\"%d %d: %d (between shapes)\\n\", 30, 15, locator->locate(new geos::geom::Coordinate(30, 15, DoubleNotANumber)));\n printf(\"%d %d: %d (inside right shape)\\n\", 45, 15, locator->locate(new geos::geom::Coordinate(45, 15, DoubleNotANumber)));\n printf(\"%d %d: %d (right out)\\n\", 51, 15, locator->locate(new geos::geom::Coordinate(51, 15, DoubleNotANumber)));\n *\/\n\n return poly;\n}\n\n<commit_msg>use factory to destroy<commit_after>#include <stdlib.h>\n#include <stdio.h>\n#include <errno.h>\n\n#include <getopt.h>\n#include <unistd.h>\n\n#define OSMIUM_MAIN\n#include <osmium.hpp>\n\n#include <geos\/geom\/MultiPolygon.h>\n#include <geos\/algorithm\/locate\/IndexedPointInAreaLocator.h>\n\n#include \"softcut.hpp\"\n#include \"hardcut.hpp\"\n\ntemplate <class TExtractInfo> bool readConfig(char *conffile, Cut<TExtractInfo> *cutter);\ngeos::geom::Geometry *readPolyFile(char* file);\n\nint main(int argc, char *argv[]) {\n bool softcut = false;\n bool debug = false;\n char *filename, *conffile;\n\n static struct option long_options[] = {\n {\"debug\", no_argument, 0, 'd'},\n {\"softcut\", no_argument, 0, 's'},\n {\"hardcut\", no_argument, 0, 'h'},\n {0, 0, 0, 0}\n };\n\n while (1) {\n int c = getopt_long(argc, argv, \"dsh\", long_options, 0);\n if (c == -1)\n break;\n\n switch (c) {\n case 'd':\n debug = true;\n break;\n case 's':\n softcut = true;\n break;\n case 'h':\n softcut = false;\n break;\n }\n }\n\n if (optind > argc-2) {\n fprintf(stderr, \"Usage: %s [OPTIONS] OSMFILE CONFIGFILE\\n\", argv[0]);\n return 1;\n }\n\n filename = argv[optind];\n conffile = argv[optind+1];\n\n if(softcut & !strcmp(filename, \"-\")) {\n fprintf(stderr, \"Can't read from stdin when in softcut\\n\");\n return 1;\n }\n\n Osmium::Framework osmium(debug);\n\n if(softcut) {\n Softcut *cutter = new Softcut();\n cutter->debug = debug;\n if(!readConfig(conffile, cutter))\n {\n fprintf(stderr, \"error reading config\\n\");\n return 1;\n }\n\n cutter->phase = Softcut::PHASE::ONE;\n osmium.parse_osmfile<Softcut>(filename, cutter);\n\n cutter->phase = Softcut::PHASE::TWO;\n osmium.parse_osmfile<Softcut>(filename, cutter);\n\n delete cutter;\n } else {\n Hardcut *cutter = new Hardcut();\n cutter->debug = debug;\n if(!readConfig(conffile, cutter))\n {\n fprintf(stderr, \"error reading config\\n\");\n return 1;\n }\n\n osmium.parse_osmfile<Hardcut>(filename, cutter);\n delete cutter;\n }\n\n return 0;\n}\n\ntemplate <class TExtractInfo> bool readConfig(char *conffile, Cut<TExtractInfo> *cutter) {\n const int linelen = 4096;\n\n FILE *fp = fopen(conffile, \"r\");\n if(!fp) {\n fprintf(stderr, \"unable to open config file %s\\n\", conffile);\n return false;\n }\n\n char line[linelen];\n while(fgets(line, linelen-1, fp)) {\n line[linelen-1] = '\\0';\n if(line[0] == '#' || line[0] == '\\r' || line[0] == '\\n' || line[0] == '\\0')\n continue;\n\n int n = 0;\n char *tok = strtok(line, \"\\t \");\n\n const char *name = NULL;\n double minlon = 0, minlat = 0, maxlon = 0, maxlat = 0;\n char type = '\\0';\n\n while(tok) {\n switch(n) {\n case 0:\n name = tok;\n break;\n\n case 1:\n if(0 == strcmp(\"BBOX\", tok))\n type = 'b';\n else if(0 == strcmp(\"POLY\", tok))\n type = 'p';\n else {\n type = '\\0';\n fprintf(stderr, \"output %s of type %s: unkown output type\\n\", name, tok);\n return false;\n }\n break;\n\n case 2:\n switch(type) {\n case 'b':\n if(4 == sscanf(tok, \"%lf,%lf,%lf,%lf\", &minlon, &minlat, &maxlon, &maxlat)) {\n if(minlon > maxlon) {\n double d = maxlon;\n minlon = maxlon;\n maxlon = d;\n }\n\n if(minlat > maxlat) {\n double d = maxlat;\n minlat = maxlat;\n maxlat = d;\n }\n cutter->addBbox(name, minlon, minlat, maxlon, maxlat);\n }\n break;\n case 'p':\n geos::geom::Geometry *poly = readPolyFile(tok);\n cutter->addPoly(name, poly);\n break;\n }\n break;\n }\n\n tok = strtok(NULL, \"\\t \");\n n++;\n }\n }\n fclose(fp);\n return true;\n}\n\ngeos::geom::Geometry *readPolyFile(char* file) {\n \/\/ shorthand\n geos::geom::GeometryFactory *f = Osmium::global.geos_geometry_factory;\n\n std::vector<geos::geom::Coordinate> *c;\n std::vector<geos::geom::Geometry*> outer;\n std::vector<geos::geom::Geometry*> inner;\n\n c = new std::vector<geos::geom::Coordinate>();\n c->push_back(geos::geom::Coordinate(10, 10, DoubleNotANumber));\n c->push_back(geos::geom::Coordinate(10, 20, DoubleNotANumber));\n c->push_back(geos::geom::Coordinate(20, 20, DoubleNotANumber));\n c->push_back(geos::geom::Coordinate(20, 10, DoubleNotANumber));\n c->push_back(geos::geom::Coordinate(10, 10, DoubleNotANumber));\n\n outer.push_back(\n f->createPolygon(\n f->createLinearRing(\n f->getCoordinateSequenceFactory()->create(c)\n ),\n NULL\n )\n );\n\n c = new std::vector<geos::geom::Coordinate>();\n c->push_back(geos::geom::Coordinate(40, 10, DoubleNotANumber));\n c->push_back(geos::geom::Coordinate(40, 20, DoubleNotANumber));\n c->push_back(geos::geom::Coordinate(50, 20, DoubleNotANumber));\n c->push_back(geos::geom::Coordinate(50, 10, DoubleNotANumber));\n c->push_back(geos::geom::Coordinate(40, 10, DoubleNotANumber));\n outer.push_back(\n f->createPolygon(\n f->createLinearRing(\n f->getCoordinateSequenceFactory()->create(c)\n ),\n NULL\n )\n );\n\n c = new std::vector<geos::geom::Coordinate>();\n c->push_back(geos::geom::Coordinate(9, 12, DoubleNotANumber));\n c->push_back(geos::geom::Coordinate(9, 18, DoubleNotANumber));\n c->push_back(geos::geom::Coordinate(18, 18, DoubleNotANumber));\n c->push_back(geos::geom::Coordinate(18, 12, DoubleNotANumber));\n c->push_back(geos::geom::Coordinate(9, 12, DoubleNotANumber));\n\n inner.push_back(\n f->createPolygon(\n f->createLinearRing(\n f->getCoordinateSequenceFactory()->create(c)\n ),\n NULL\n )\n );\n\n\n\n geos::geom::MultiPolygon *outerPoly = f->createMultiPolygon(outer);\n geos::geom::MultiPolygon *innerPoly = f->createMultiPolygon(inner);\n geos::geom::Geometry *poly = outerPoly->difference(innerPoly);\n\n f->destroyGeometry(outerPoly);\n f->destroyGeometry(innerPoly);\n\n \/*\n geos::algorithm::locate::IndexedPointInAreaLocator *locator =\n new geos::algorithm::locate::IndexedPointInAreaLocator(*const_cast<const geos::geom::Geometry *>(poly));\n\n printf(\"%d %d: %d (left out)\\n\", 9, 15, locator->locate(new geos::geom::Coordinate( 9, 15, DoubleNotANumber)));\n printf(\"%d %d: %d (on border)\\n\", 10, 15, locator->locate(new geos::geom::Coordinate( 10, 15, DoubleNotANumber)));\n printf(\"%d %d: %d (inside left border)\\n\", 11, 15, locator->locate(new geos::geom::Coordinate(11, 15, DoubleNotANumber)));\n printf(\"%d %d: %d (in hole)\\n\", 15, 15, locator->locate(new geos::geom::Coordinate(15, 15, DoubleNotANumber)));\n printf(\"%d %d: %d (in hole)\\n\", 17, 15, locator->locate(new geos::geom::Coordinate(17, 15, DoubleNotANumber)));\n printf(\"%d %d: %d (inside right border)\\n\", 19, 15, locator->locate(new geos::geom::Coordinate(19, 15, DoubleNotANumber)));\n printf(\"%d %d: %d (between shapes)\\n\", 30, 15, locator->locate(new geos::geom::Coordinate(30, 15, DoubleNotANumber)));\n printf(\"%d %d: %d (inside right shape)\\n\", 45, 15, locator->locate(new geos::geom::Coordinate(45, 15, DoubleNotANumber)));\n printf(\"%d %d: %d (right out)\\n\", 51, 15, locator->locate(new geos::geom::Coordinate(51, 15, DoubleNotANumber)));\n *\/\n\n return poly;\n}\n\n<|endoftext|>"} {"text":"<commit_before>#include <iostream>\n#include <string>\n#include <unistd.h>\n#include <sys\/types.h>\n#include <sys\/wait.h>\n#include <stdio.h>\n#include <string.h>\n#include <cstring>\n#include <vector>\n#include <boost\/algorithm\/string\/trim.hpp>\n\nusing namespace std;\nusing namespace boost;\n\nbool done = false;\n\nvoid orfinder(string filter, vector<string> &take)\n{\n\tunsigned int start = 0;\n\tunsigned int cut = 0;\n\tbool finished = false;\n\tbool complete = false;\n\tbool over = false;\n\tstring copy = filter;\n\twhile(!finished)\n\t{\n\t\tfor(unsigned int i = start; i <= filter.size()-2 && !complete; ++i)\n\t\t{\n\t\t\tif((filter.at(i) == '|') && (filter.at(i+1) == '|'))\n\t\t\t{\n\t\t\t\tcopy = copy.substr(start, cut);\n\t\t\t\ttrim(copy);\n\t\t\t\ttake.push_back(copy);\n\t\t\t\twhile(i < filter.size() && filter.at(i) == '|')\n\t\t\t\t{\n\t\t\t\t\t++i;\n\t\t\t\t}\n\t\t\t\tif(i == filter.size())\n\t\t\t\t{\n\t\t\t\t\tover = true;\n\t\t\t\t}\n\t\t\t\telse\n\t\t\t\t{\n\t\t\t\t\tstart = i;\n\t\t\t\t}\n\t\t\t\tcomplete = true;\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\tcut++;\n\t\t\t}\n\t\t}\n\t\tcopy = filter;\n\t\tif(!complete || over)\n\t\t{\n\t\t\tcopy = copy.substr(start, copy.size()-start);\n\t\t\ttrim(copy);\n\t\t\ttake.push_back(copy);\n\t\t\tfinished = true;\n\t\t}\n\t\telse\n\t\t{\n\t\t\tcut = 0;\n\t\t\tcomplete = false;\n\t\t\tover = false;\n\t\t}\n\t}\n}\n\nbool charfinder(const char element, const string search)\n{\n\tchar last = 0;\n\tbool condition = false;\n\tfor(unsigned int i = 0; i <= search.size()-2; ++i)\n\t{\n\t\tif(search.at(i) == element && last != element && search.at(i+1) != element)\n\t\t{\n\t\t\tcondition = true;\n\t\t}\n\t\tif(i == search.size()-2)\n\t\t{\n\t\t\tlast = search.at(i);\n\t\t\tif(search.at(i+1) == element && last != element)\n\t\t\t{\n\t\t\t\tcondition = true;\n\t\t\t}\n\t\t}\n\t\tlast = search.at(i);\n\t}\n\treturn condition;\n}\n\nvoid finder(const string search, bool &haspipe, bool &hasleft, bool &has2right, bool &hasright)\n{\n\tbool complete = false;\n\tfor(unsigned int i = 0; i <= search.size()-2 && !complete; ++i)\n\t{\n\t\tif((search.at(i) == '>') && (search.at(i+1) == '>'))\n\t\t{\n\t\t\thas2right = true;\n\t\t\tcomplete = true;\n\t\t}\n\t}\n\thasleft = charfinder('<', search);\n\thasright = charfinder('>', search);\n\thaspipe = charfinder('|', search);\n}\n\nvoid normalBash(string command)\n{\n\tchar *token;\n\tvector<string> sc_cmd;\t\t\/\/sc_cmd stands for semicolon_commands - this holds the commands in string form\n\tvector<string> copy;\t\t\/\/this will hold the new commands from sc_cmd without any comments for a short while\n\tvector<string> and_cmd;\t\t\/\/this will hold the string of single commands combined by &&\n\tvector<string> or_cmd;\t\t\/\/this will hold the string of commands combined by ||\n\tchar* cmd = new char[command.size()];\n\tif(command.size() > 0)\n\t{\n\t\tcopy.push_back(command);\n\t}\n\tif(copy.size() > 0)\n\t{\n\t\tstrcpy(cmd, (copy.at(0)).c_str()); \n\t\tcopy.clear();\n\t\ttoken = strtok(cmd, \";\");\n\t\twhile(token != NULL)\n\t\t{\n\t\t\tsc_cmd.push_back(string(token)); \/\/parse the string, looking for semicolons to split the commands\n\t\t\ttoken = strtok(NULL, \";\");\n\t\t}\n\t\tfor(unsigned int i = 0; i < sc_cmd.size(); ++i)\n\t\t{\n\t\t\tstrcpy(cmd, (sc_cmd.at(i)).c_str());\n\t\t\ttoken = strtok(cmd, \"#\");\t\t\/\/parse the string looking for the start of a comment\n\t\t\tif(token != NULL)\t\t\/\/then only add the beginning part of the command and throw away everything after the #\n\t\t\t{\n\t\t\t\tif(string(token).find_first_not_of(' ') != std::string::npos) \/\/if the parsed string is only white spaces\n\t\t\t\t{\t\t\t\t\t\t\t\t\t\/\/then dont add it list of commands\n\t\t\t\t\tcopy.push_back(string(token));\t\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tsc_cmd.clear();\n\t\tfor(unsigned int i = 0; i < copy.size(); ++i)\n\t\t{\n\t\t\tsc_cmd.push_back(copy.at(i));\t\/\/move the new filtered commands into the proper vector\n\t\t}\n\t\tcopy.clear();\n\t\tfor(unsigned int i = 0; i < sc_cmd.size(); ++i)\t\/\/keep executing these commands regardless of result from previous command\n\t\t{\n\t\t\ttrim(sc_cmd.at(i));\t\t\/\/remove all the unnecessary white spaces around the string if in there\n\t\t\torfinder(sc_cmd.at(i), or_cmd);\n\t\t\tunsigned int fails = 0;\n\t\t\tfor(unsigned int i = 0; i < or_cmd.size(); ++i)\t\/\/keep doing || commands as long as the last command failed\n\t\t\t{\n\t\t\t\ttrim(or_cmd.at(i));\n\t\t\t\tif(fails == i)\n\t\t\t\t{\n\t\t\t\t\tstrcpy(cmd, (or_cmd.at(i)).c_str());\n\t\t\t\t\ttoken = strtok(cmd, \"&&\");\n\t\t\t\t\twhile(token != NULL)\t\/\/parse the string command for && and split the code down to single commands\n\t\t\t\t\t{\n\t\t\t\t\t\tand_cmd.push_back(string(token));\n\t\t\t\t\t\ttoken = strtok(NULL, \"&&\");\n\t\t\t\t\t}\n\t\t\t\t\tunsigned int trues = 0;\n\t\t\t\t\tfor(unsigned int i = 0; i < and_cmd.size(); ++i) \/\/keep doing && commands as long as the last command succeeded\n\t\t\t\t\t{\n\t\t\t\t\t\ttrim(and_cmd.at(i));\n\t\t\t\t\t\tbool haspipe = false;\n\t\t\t\t\t\tbool hasleft = false;\n\t\t\t\t\t\tbool has2right = false;\n\t\t\t\t\t\tbool hasright = false;\n\t\t\t\t\t\tfinder(and_cmd.at(i), haspipe, hasleft, has2right, hasright);\n\t\t\t\t\t\tif(trues == i)\n\t\t\t\t\t\t{\n\t\t\t\t\t\t\tstrcpy(cmd, (and_cmd.at(i)).c_str());\n\t\t\t\t\t\t\ttoken = strtok(cmd, \" \");\n\t\t\t\t\t\t\twhile(token != NULL)\t\/\/break down the command into strings\n\t\t\t\t\t\t\t{\n\t\t\t\t\t\t\t\tcopy.push_back(string(token));\n\t\t\t\t\t\t\t\ttoken = strtok(NULL, \" \");\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\tchar **argv = new char*[copy.size()+1];\t\/\/create an array of char pointers\n\t\t\t\t\t\t\tfor(unsigned int j = 0; j < copy.size(); ++j)\n\t\t\t\t\t\t\t{\n\t\t\t\t\t\t\t\ttrim(copy.at(j));\t\/\/add char pointers into an array of pointers\n\t\t\t\t\t\t\t\targv[j] = const_cast<char*>((copy.at(j)).c_str());\t\/\/this will allow us to use execvp \n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\targv[copy.size()] = 0;\n\t\t\t\t\t\t\tint pid = fork();\n\t\t\t\t\t\t\tif(pid == -1)\n\t\t\t\t\t\t\t{\n\t\t\t\t\t\t\t\tperror(\"There was an error with fork() \");\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\telse if(pid == 0)\n\t\t\t\t\t\t\t{\n\t\t\t\t\t\t\t\tif(and_cmd.at(i) != \"exit\")\t\/\/only move along to execvp if the command is not exit\n\t\t\t\t\t\t\t\t{\n\t\t\t\t\t\t\t\t\tif(haspipe || hasleft || has2right || hasright)\n\t\t\t\t\t\t\t\t\t{\n\t\t\t\t\t\t\t\t\t\tcout << \"I\/O redirection\" << endl;\n\t\t\t\t\t\t\t\t\t\t_exit(0);\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{\t\n\t\t\t\t\t\t\t\t\t\tif(-1 == execvp((copy.at(0)).c_str(), argv))\n\t\t\t\t\t\t\t\t\t\t{\n\t\t\t\t\t\t\t\t\t\t\tperror(\"There was an error with execvp() \");\t\n\t\t\t\t\t\t\t\t\t\t\t_exit(1);\t\/\/if the command failed, then kill the child process and exit\n\t\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\telse \/\/if the command is to exit, dont do anything, simply kill the child process and exit\n\t\t\t\t\t\t\t\t{\n\t\t\t\t\t\t\t\t\t_exit(1);\n\t\t\t\t\t\t\t\t}\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\tint status;\n\t\t\t\t\t\t\t\twait(&status);\n\t\t\t\t\t\t\t\tif(status == -1)\n\t\t\t\t\t\t\t\t{\n\t\t\t\t\t\t\t\t\tperror(\"There was an error with wait() \");\n\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\telse if(status == 0)\t\/\/if the last command was executed successfully, increase the counter\n\t\t\t\t\t\t\t\t{\n\t\t\t\t\t\t\t\t\t++trues;\n\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\tif(and_cmd.at(i) == \"exit\")\t\/\/if the user entered the exit command, end the shell and program\n\t\t\t\t\t\t\t\t{\n\t\t\t\t\t\t\t\t\tdelete []argv;\t\t\/\/since we are done with the program early, we must delete\n\t\t\t\t\t\t\t\t\tdelete []cmd;\t\t\/\/dynamic memory from leaking out\n\t\t\t\t\t\t\t\t\tcopy.clear();\n\t\t\t\t\t\t\t\t\tand_cmd.clear();\n\t\t\t\t\t\t\t\t\tor_cmd.clear();\n\t\t\t\t\t\t\t\t\tsc_cmd.clear();\n\t\t\t\t\t\t\t\t\tdone = true;\t\n\t\t\t\t\t\t\t\t\treturn;\n\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\tdelete []argv;\t\/\/make sure to delete the dynamically allocated memory\n\t\t\t\t\t\t}\n\t\t\t\t\t\tcopy.clear();\t\/\/clear out the vector to be used again\n\t\t\t\t\t}\t\/\/end of and_cmd\n\t\t\t\t\tif(trues != and_cmd.size())\n\t\t\t\t\t{\n\t\t\t\t\t\tfails++; \/\/if the amount of commands that were successfully executed is not the same as the\n\t\t\t\t\t\t\t\/\/number of commands executed, then increase the number of commands failed\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\tand_cmd.clear();\t\/\/clear out the commands in and vector since we are done\n\t\t\t} \/\/end of or_cmd\n\t\t\tor_cmd.clear();\t \/\/clear out the commands in the or vector since we are done\n\t\t}\t\/\/end of sc_cmd\n\t\tsc_cmd.clear();\t\/\/clear out the commands in the semicolon vector since we are done\n\t}\n\tdelete []cmd;\/\/make sure to delete the dynamically allocated memory\n}\n\nint main()\n{\n\tchar *user = getlogin();\t\/\/gets the user name\n\tstring command;\n\tif(user == NULL)\n\t{\n\t\tperror(\"There was an error with getlogin() \");\n\t}\n\tchar name[100];\t\t\t\t\/\/initialize empty string to be used to get the host name\n\tint check = gethostname(name, 100);\t\t\/\/gets the host's name and stores it in the char array variable name\n\tif(check == -1)\n\t{\n\t\tperror(\"There was en error with gethostname() \");\n\t}\n\twhile(!done)\t\t\/\/loop until user enters exit and the loop is terminated\n\t{\n\t\tif((user != NULL) && (check == 0))\n\t\t{\n\t\t\tcout << user << \"@\" << name << \" $ \";\t\/\/output user name, @ symbol, the host name, followed by $\n\t\t}\t\t\t\/\/ output at this point should result in: [user]@[host]$\n\t\telse\n\t\t{\n\t\t\tcout << \"$ \";\n\t\t}\n\t\tgetline(cin, command);\t\/\/get the entire line of command from user\n\t\tunsigned int loc = command.find_first_of(\"#\");\t\/\/keep only everything before the first comment mark\n\t\tcommand = command.substr(0, loc);\n\t\tif(command == \"exit\")\n\t\t{\n\t\t\tdone = true;\t\/\/if the command they type in is initially exit\n\t\t\t\t\t\/\/then there is no need to continue traversing the program, simply end\n\t\t}\n\t\telse\n\t\t{\n\t\t\tnormalBash(command);\n\t\t}\n\t}\n\treturn 0;\n}\n<commit_msg>started > redirection implementation<commit_after>#include <iostream>\n#include <string>\n#include <unistd.h>\n#include <sys\/types.h>\n#include <sys\/wait.h>\n#include <stdio.h>\n#include <string.h>\n#include <cstring>\n#include <vector>\n#include <boost\/algorithm\/string\/trim.hpp>\n\nusing namespace std;\nusing namespace boost;\n\nbool done = false;\nvoid onlyright(string command)\n{\n\tchar *token;\n\tchar* cmd = new char[command.size()];\n\tstrcpy(cmd, command.c_str());\n\ttoken = strtok(cmd, \">\");\n\tvector<string> holder;\n\twhile(token != NULL)\n\t{\n\t\tholder.push_back(string(token));\n\t\ttoken = strtok(NULL, \">\");\n\t}\n}\nvoid orfinder(string filter, vector<string> &take)\n{\n\tunsigned int start = 0;\n\tunsigned int cut = 0;\n\tbool finished = false;\n\tbool complete = false;\n\tbool over = false;\n\tstring copy = filter;\n\twhile(!finished)\n\t{\n\t\tfor(unsigned int i = start; i <= filter.size()-2 && !complete; ++i)\n\t\t{\n\t\t\tif((filter.at(i) == '|') && (filter.at(i+1) == '|'))\n\t\t\t{\n\t\t\t\tcopy = copy.substr(start, cut);\n\t\t\t\ttrim(copy);\n\t\t\t\ttake.push_back(copy);\n\t\t\t\twhile(i < filter.size() && filter.at(i) == '|')\n\t\t\t\t{\n\t\t\t\t\t++i;\n\t\t\t\t}\n\t\t\t\tif(i == filter.size())\n\t\t\t\t{\n\t\t\t\t\tover = true;\n\t\t\t\t}\n\t\t\t\telse\n\t\t\t\t{\n\t\t\t\t\tstart = i;\n\t\t\t\t}\n\t\t\t\tcomplete = true;\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\tcut++;\n\t\t\t}\n\t\t}\n\t\tcopy = filter;\n\t\tif(!complete || over)\n\t\t{\n\t\t\tcopy = copy.substr(start, copy.size()-start);\n\t\t\ttrim(copy);\n\t\t\ttake.push_back(copy);\n\t\t\tfinished = true;\n\t\t}\n\t\telse\n\t\t{\n\t\t\tcut = 0;\n\t\t\tcomplete = false;\n\t\t\tover = false;\n\t\t}\n\t}\n}\n\nbool charfinder(const char element, const string search)\n{\n\tchar last = 0;\n\tbool condition = false;\n\tfor(unsigned int i = 0; i <= search.size()-2; ++i)\n\t{\n\t\tif(search.at(i) == element && last != element && search.at(i+1) != element)\n\t\t{\n\t\t\tcondition = true;\n\t\t}\n\t\tif(i == search.size()-2)\n\t\t{\n\t\t\tlast = search.at(i);\n\t\t\tif(search.at(i+1) == element && last != element)\n\t\t\t{\n\t\t\t\tcondition = true;\n\t\t\t}\n\t\t}\n\t\tlast = search.at(i);\n\t}\n\treturn condition;\n}\n\nvoid finder(const string search, bool &haspipe, bool &hasleft, bool &has2right, bool &hasright)\n{\n\tbool complete = false;\n\tfor(unsigned int i = 0; i <= search.size()-2 && !complete; ++i)\n\t{\n\t\tif((search.at(i) == '>') && (search.at(i+1) == '>'))\n\t\t{\n\t\t\thas2right = true;\n\t\t\tcomplete = true;\n\t\t}\n\t}\n\thasleft = charfinder('<', search);\n\thasright = charfinder('>', search);\n\thaspipe = charfinder('|', search);\n}\n\nvoid normalBash(string command)\n{\n\tchar *token;\n\tvector<string> sc_cmd;\t\t\/\/sc_cmd stands for semicolon_commands - this holds the commands in string form\n\tvector<string> copy;\t\t\/\/this will hold the new commands from sc_cmd without any comments for a short while\n\tvector<string> and_cmd;\t\t\/\/this will hold the string of single commands combined by &&\n\tvector<string> or_cmd;\t\t\/\/this will hold the string of commands combined by ||\n\tchar* cmd = new char[command.size()];\n\tif(command.size() > 0)\n\t{\n\t\tcopy.push_back(command);\n\t}\n\tif(copy.size() > 0)\n\t{\n\t\tstrcpy(cmd, (copy.at(0)).c_str()); \n\t\tcopy.clear();\n\t\ttoken = strtok(cmd, \";\");\n\t\twhile(token != NULL)\n\t\t{\n\t\t\tsc_cmd.push_back(string(token)); \/\/parse the string, looking for semicolons to split the commands\n\t\t\ttoken = strtok(NULL, \";\");\n\t\t}\n\t\tfor(unsigned int i = 0; i < sc_cmd.size(); ++i)\n\t\t{\n\t\t\tstrcpy(cmd, (sc_cmd.at(i)).c_str());\n\t\t\ttoken = strtok(cmd, \"#\");\t\t\/\/parse the string looking for the start of a comment\n\t\t\tif(token != NULL)\t\t\/\/then only add the beginning part of the command and throw away everything after the #\n\t\t\t{\n\t\t\t\tif(string(token).find_first_not_of(' ') != std::string::npos) \/\/if the parsed string is only white spaces\n\t\t\t\t{\t\t\t\t\t\t\t\t\t\/\/then dont add it list of commands\n\t\t\t\t\tcopy.push_back(string(token));\t\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tsc_cmd.clear();\n\t\tfor(unsigned int i = 0; i < copy.size(); ++i)\n\t\t{\n\t\t\tsc_cmd.push_back(copy.at(i));\t\/\/move the new filtered commands into the proper vector\n\t\t}\n\t\tcopy.clear();\n\t\tfor(unsigned int i = 0; i < sc_cmd.size(); ++i)\t\/\/keep executing these commands regardless of result from previous command\n\t\t{\n\t\t\ttrim(sc_cmd.at(i));\t\t\/\/remove all the unnecessary white spaces around the string if in there\n\t\t\torfinder(sc_cmd.at(i), or_cmd);\n\t\t\tunsigned int fails = 0;\n\t\t\tfor(unsigned int i = 0; i < or_cmd.size(); ++i)\t\/\/keep doing || commands as long as the last command failed\n\t\t\t{\n\t\t\t\ttrim(or_cmd.at(i));\n\t\t\t\tif(fails == i)\n\t\t\t\t{\n\t\t\t\t\tstrcpy(cmd, (or_cmd.at(i)).c_str());\n\t\t\t\t\ttoken = strtok(cmd, \"&&\");\n\t\t\t\t\twhile(token != NULL)\t\/\/parse the string command for && and split the code down to single commands\n\t\t\t\t\t{\n\t\t\t\t\t\tand_cmd.push_back(string(token));\n\t\t\t\t\t\ttoken = strtok(NULL, \"&&\");\n\t\t\t\t\t}\n\t\t\t\t\tunsigned int trues = 0;\n\t\t\t\t\tfor(unsigned int i = 0; i < and_cmd.size(); ++i) \/\/keep doing && commands as long as the last command succeeded\n\t\t\t\t\t{\n\t\t\t\t\t\ttrim(and_cmd.at(i));\n\t\t\t\t\t\tbool haspipe = false;\n\t\t\t\t\t\tbool hasleft = false;\n\t\t\t\t\t\tbool has2right = false;\n\t\t\t\t\t\tbool hasright = false;\n\t\t\t\t\t\tfinder(and_cmd.at(i), haspipe, hasleft, has2right, hasright);\n\t\t\t\t\t\tif(trues == i)\n\t\t\t\t\t\t{\n\t\t\t\t\t\t\tstrcpy(cmd, (and_cmd.at(i)).c_str());\n\t\t\t\t\t\t\ttoken = strtok(cmd, \" \");\n\t\t\t\t\t\t\twhile(token != NULL)\t\/\/break down the command into strings\n\t\t\t\t\t\t\t{\n\t\t\t\t\t\t\t\tcopy.push_back(string(token));\n\t\t\t\t\t\t\t\ttoken = strtok(NULL, \" \");\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\tchar **argv = new char*[copy.size()+1];\t\/\/create an array of char pointers\n\t\t\t\t\t\t\tfor(unsigned int j = 0; j < copy.size(); ++j)\n\t\t\t\t\t\t\t{\n\t\t\t\t\t\t\t\ttrim(copy.at(j));\t\/\/add char pointers into an array of pointers\n\t\t\t\t\t\t\t\targv[j] = const_cast<char*>((copy.at(j)).c_str());\t\/\/this will allow us to use execvp \n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\targv[copy.size()] = 0;\n\t\t\t\t\t\t\tint pid = fork();\n\t\t\t\t\t\t\tif(pid == -1)\n\t\t\t\t\t\t\t{\n\t\t\t\t\t\t\t\tperror(\"There was an error with fork() \");\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\telse if(pid == 0)\n\t\t\t\t\t\t\t{\n\t\t\t\t\t\t\t\tif(and_cmd.at(i) != \"exit\")\t\/\/only move along to execvp if the command is not exit\n\t\t\t\t\t\t\t\t{\n\t\t\t\t\t\t\t\t\tif(haspipe || hasleft || has2right || hasright)\n\t\t\t\t\t\t\t\t\t{\n\t\t\t\t\t\t\t\t\t\tcout << \"I\/O redirection\" << endl;\n\t\t\t\t\t\t\t\t\t\t_exit(0);\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{\t\n\t\t\t\t\t\t\t\t\t\tif(-1 == execvp((copy.at(0)).c_str(), argv))\n\t\t\t\t\t\t\t\t\t\t{\n\t\t\t\t\t\t\t\t\t\t\tperror(\"There was an error with execvp() \");\t\n\t\t\t\t\t\t\t\t\t\t\t_exit(1);\t\/\/if the command failed, then kill the child process and exit\n\t\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\telse \/\/if the command is to exit, dont do anything, simply kill the child process and exit\n\t\t\t\t\t\t\t\t{\n\t\t\t\t\t\t\t\t\t_exit(1);\n\t\t\t\t\t\t\t\t}\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\tint status;\n\t\t\t\t\t\t\t\twait(&status);\n\t\t\t\t\t\t\t\tif(status == -1)\n\t\t\t\t\t\t\t\t{\n\t\t\t\t\t\t\t\t\tperror(\"There was an error with wait() \");\n\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\telse if(status == 0)\t\/\/if the last command was executed successfully, increase the counter\n\t\t\t\t\t\t\t\t{\n\t\t\t\t\t\t\t\t\t++trues;\n\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\tif(and_cmd.at(i) == \"exit\")\t\/\/if the user entered the exit command, end the shell and program\n\t\t\t\t\t\t\t\t{\n\t\t\t\t\t\t\t\t\tdelete []argv;\t\t\/\/since we are done with the program early, we must delete\n\t\t\t\t\t\t\t\t\tdelete []cmd;\t\t\/\/dynamic memory from leaking out\n\t\t\t\t\t\t\t\t\tcopy.clear();\n\t\t\t\t\t\t\t\t\tand_cmd.clear();\n\t\t\t\t\t\t\t\t\tor_cmd.clear();\n\t\t\t\t\t\t\t\t\tsc_cmd.clear();\n\t\t\t\t\t\t\t\t\tdone = true;\t\n\t\t\t\t\t\t\t\t\treturn;\n\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\tdelete []argv;\t\/\/make sure to delete the dynamically allocated memory\n\t\t\t\t\t\t}\n\t\t\t\t\t\tcopy.clear();\t\/\/clear out the vector to be used again\n\t\t\t\t\t}\t\/\/end of and_cmd\n\t\t\t\t\tif(trues != and_cmd.size())\n\t\t\t\t\t{\n\t\t\t\t\t\tfails++; \/\/if the amount of commands that were successfully executed is not the same as the\n\t\t\t\t\t\t\t\/\/number of commands executed, then increase the number of commands failed\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\tand_cmd.clear();\t\/\/clear out the commands in and vector since we are done\n\t\t\t} \/\/end of or_cmd\n\t\t\tor_cmd.clear();\t \/\/clear out the commands in the or vector since we are done\n\t\t}\t\/\/end of sc_cmd\n\t\tsc_cmd.clear();\t\/\/clear out the commands in the semicolon vector since we are done\n\t}\n\tdelete []cmd;\/\/make sure to delete the dynamically allocated memory\n}\n\nint main()\n{\n\tchar *user = getlogin();\t\/\/gets the user name\n\tstring command;\n\tif(user == NULL)\n\t{\n\t\tperror(\"There was an error with getlogin() \");\n\t}\n\tchar name[100];\t\t\t\t\/\/initialize empty string to be used to get the host name\n\tint check = gethostname(name, 100);\t\t\/\/gets the host's name and stores it in the char array variable name\n\tif(check == -1)\n\t{\n\t\tperror(\"There was en error with gethostname() \");\n\t}\n\twhile(!done)\t\t\/\/loop until user enters exit and the loop is terminated\n\t{\n\t\tif((user != NULL) && (check == 0))\n\t\t{\n\t\t\tcout << user << \"@\" << name << \" $ \";\t\/\/output user name, @ symbol, the host name, followed by $\n\t\t}\t\t\t\/\/ output at this point should result in: [user]@[host]$\n\t\telse\n\t\t{\n\t\t\tcout << \"$ \";\n\t\t}\n\t\tgetline(cin, command);\t\/\/get the entire line of command from user\n\t\tunsigned int loc = command.find_first_of(\"#\");\t\/\/keep only everything before the first comment mark\n\t\tcommand = command.substr(0, loc);\n\t\tif(command == \"exit\")\n\t\t{\n\t\t\tdone = true;\t\/\/if the command they type in is initially exit\n\t\t\t\t\t\/\/then there is no need to continue traversing the program, simply end\n\t\t}\n\t\telse\n\t\t{\n\t\t\tnormalBash(command);\n\t\t}\n\t}\n\treturn 0;\n}\n<|endoftext|>"} {"text":"<commit_before>\/\/@ {\"targets\":[{\"name\":\"serializer.hpp\",\"type\":\"include\"}]}\n\n#ifndef TEMPLE_SERIALIZER_HPP\n#define TEMPLE_SERIALIZER_HPP\n\n#include \"item.hpp\"\n#include \"treenode.hpp\"\n#include <stack>\n\nnamespace Temple\n\t{\n\tnamespace\n\t\t{\n\t\ttemplate<class Sink,class Callback>\n\t\tclass VisitorBase\n\t\t\t{\n\t\t\tpublic:\n\t\t\t\tvirtual bool atEnd() const noexcept=0;\n\t\t\t\tvirtual void advance() noexcept=0;\n\t\t\t\tvirtual void itemProcess(Callback& cb) const=0;\n\t\t\t\tvirtual ~VisitorBase()=default;\n\t\t\t};\n\n\t\ttemplate<class Sink,class Callback,class Container>\n\t\tclass Visitor:public VisitorBase<Sink,Callback>\n\t\t\t{\n\t\t\tpublic:\n\t\t\t\texplicit Visitor(Container&&)=delete;\n\t\t\t\texplicit Visitor(const Container& container):\n\t\t\t\t\tm_begin(container.begin()),m_current(container.begin()),m_end(container.end())\n\t\t\t\t\t{}\n\n\t\t\t\tbool atEnd() const noexcept\n\t\t\t\t\t{return m_current==m_end;}\n\n\t\t\t\tbool atBegin() const noexcept\n\t\t\t\t\t{return m_current==m_begin;}\n\n\t\t\t\tvoid advance() noexcept\n\t\t\t\t\t{++m_current;}\n\n\t\t\t\tvoid itemProcess(Callback& cb) const\n\t\t\t\t\t{cb(*m_current,*this);}\n\n\t\t\t\tstatic auto create(const Container& cnt)\n\t\t\t\t\t{\n\t\t\t\t\treturn std::unique_ptr<VisitorBase<Sink,Callback>>(new Visitor(cnt));\n\t\t\t\t\t}\n\n\t\t\tprivate:\n\t\t\ttypename Container::const_iterator m_begin;\n\t\t\t\ttypename Container::const_iterator m_current;\n\t\t\t\ttypename Container::const_iterator m_end;\n\t\t\t};\n\t\t\n\t\ttemplate<class StorageModel,class Sink>\n\t\tclass Acceptor\n\t\t\t{\n\t\t\tpublic:\n\t\t\t\tusing MapType=typename StorageModel::template MapType< std::unique_ptr< ItemBase<StorageModel> > > ;\n\t\t\t\tusing CompoundArray=typename StorageModel::template ArrayType<MapType>;\n\n\t\t\t\tusing VisitorArray=Visitor<Sink,Acceptor,CompoundArray>;\n\t\t\t\tusing VisitorMap=Visitor<Sink,Acceptor,MapType>;\n\n\t\t\t\texplicit Acceptor(ItemBase<StorageModel>&&)=delete;\n\n\t\t\t\texplicit Acceptor(const ItemBase<StorageModel>& root,Sink& sink):r_sink(sink)\n\t\t\t\t\t{\n\t\t\t\t\tif(root.array())\n\t\t\t\t\t\t{m_stack.push(VisitorArray::create(root.template value<CompoundArray>() ) );}\n\t\t\t\t\telse\n\t\t\t\t\t\t{}\n\t\t\t\t\t}\n\n\t\t\t\tvoid run()\n\t\t\t\t\t{\n\t\t\t\t\twhile(!m_stack.empty())\n\t\t\t\t\t\t{\n\t\t\t\t\t\tauto visitor=std::move(m_stack.top());\n\t\t\t\t\t\tm_stack.pop();\n\t\t\t\t\t\tvisitor->itemProcess(*this);\n\t\t\t\t\t\tif(!visitor->atEnd())\n\t\t\t\t\t\t\t{\n\t\t\t\t\t\t\tvisitor->advance();\n\t\t\t\t\t\t\tm_stack.push(std::move(visitor));\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\tvoid operator()(const MapType& node_current,const VisitorArray& visitor)\n\t\t\t\t\t{\n\t\t\t\t\tif(visitor.atEnd())\n\t\t\t\t\t\t{\n\t\t\t\t\t\tputc(']',r_sink);\n\t\t\t\t\t\treturn;\n\t\t\t\t\t\t}\n\n\t\t\t\t\tif(visitor.atBegin())\n\t\t\t\t\t\t{putc('[',r_sink);}\n\n\t\t\t\t\t}\n\n\t\t\tprivate:\n\t\t\t\tSink& r_sink;\n\t\t\t\tstd::stack< std::unique_ptr< VisitorBase<Sink,Acceptor> > > m_stack;\n\t\t\t};\n\t\t}\n\n\ttemplate<class StorageModel,class Sink>\n\tvoid temple_store(const ItemBase<StorageModel>& root,Sink& sink)\n\t\t{Acceptor<StorageModel,Sink>(root,sink).run();}\n\t}\n\n#endif\n<commit_msg>Push map node<commit_after>\/\/@ {\"targets\":[{\"name\":\"serializer.hpp\",\"type\":\"include\"}]}\n\n#ifndef TEMPLE_SERIALIZER_HPP\n#define TEMPLE_SERIALIZER_HPP\n\n#include \"item.hpp\"\n#include \"treenode.hpp\"\n#include <stack>\n\nnamespace Temple\n\t{\n\tnamespace\n\t\t{\n\t\ttemplate<class Sink,class Callback>\n\t\tclass VisitorBase\n\t\t\t{\n\t\t\tpublic:\n\t\t\t\tvirtual bool atEnd() const noexcept=0;\n\t\t\t\tvirtual void advance() noexcept=0;\n\t\t\t\tvirtual void itemProcess(Callback& cb) const=0;\n\t\t\t\tvirtual ~VisitorBase()=default;\n\t\t\t};\n\n\t\ttemplate<class Sink,class Callback,class Container>\n\t\tclass Visitor:public VisitorBase<Sink,Callback>\n\t\t\t{\n\t\t\tpublic:\n\t\t\t\texplicit Visitor(Container&&)=delete;\n\t\t\t\texplicit Visitor(const Container& container):\n\t\t\t\t\tm_begin(container.begin()),m_current(container.begin()),m_end(container.end())\n\t\t\t\t\t{}\n\n\t\t\t\tbool atEnd() const noexcept\n\t\t\t\t\t{return m_current==m_end;}\n\n\t\t\t\tbool atBegin() const noexcept\n\t\t\t\t\t{return m_current==m_begin;}\n\n\t\t\t\tvoid advance() noexcept\n\t\t\t\t\t{++m_current;}\n\n\t\t\t\tvoid itemProcess(Callback& cb) const\n\t\t\t\t\t{cb(*m_current,*this);}\n\n\t\t\t\tstatic auto create(const Container& cnt)\n\t\t\t\t\t{\n\t\t\t\t\treturn std::unique_ptr<VisitorBase<Sink,Callback>>(new Visitor(cnt));\n\t\t\t\t\t}\n\n\t\t\tprivate:\n\t\t\ttypename Container::const_iterator m_begin;\n\t\t\t\ttypename Container::const_iterator m_current;\n\t\t\t\ttypename Container::const_iterator m_end;\n\t\t\t};\n\t\t\n\t\ttemplate<class StorageModel,class Sink>\n\t\tclass Acceptor\n\t\t\t{\n\t\t\tpublic:\n\t\t\t\tusing MapType=typename StorageModel::template MapType< std::unique_ptr< ItemBase<StorageModel> > > ;\n\t\t\t\tusing CompoundArray=typename StorageModel::template ArrayType<MapType>;\n\n\t\t\t\tusing VisitorArray=Visitor<Sink,Acceptor,CompoundArray>;\n\t\t\t\tusing VisitorMap=Visitor<Sink,Acceptor,MapType>;\n\n\t\t\t\texplicit Acceptor(ItemBase<StorageModel>&&)=delete;\n\n\t\t\t\texplicit Acceptor(const ItemBase<StorageModel>& root,Sink& sink):r_sink(sink)\n\t\t\t\t\t{\n\t\t\t\t\tif(root.array())\n\t\t\t\t\t\t{m_stack.push(VisitorArray::create(root.template value<CompoundArray>() ) );}\n\t\t\t\t\telse\n\t\t\t\t\t\t{m_stack.push(VisitorMap::create(root.template value<MapType>() ) );}\n\t\t\t\t\t}\n\n\t\t\t\tvoid run()\n\t\t\t\t\t{\n\t\t\t\t\twhile(!m_stack.empty())\n\t\t\t\t\t\t{\n\t\t\t\t\t\tauto visitor=std::move(m_stack.top());\n\t\t\t\t\t\tm_stack.pop();\n\t\t\t\t\t\tvisitor->itemProcess(*this);\n\t\t\t\t\t\tif(!visitor->atEnd())\n\t\t\t\t\t\t\t{\n\t\t\t\t\t\t\tvisitor->advance();\n\t\t\t\t\t\t\tm_stack.push(std::move(visitor));\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\tvoid operator()(const MapType& node_current,const VisitorArray& visitor)\n\t\t\t\t\t{\n\t\t\t\t\tif(visitor.atEnd())\n\t\t\t\t\t\t{\n\t\t\t\t\t\tputc(']',r_sink);\n\t\t\t\t\t\treturn;\n\t\t\t\t\t\t}\n\n\t\t\t\t\tif(visitor.atBegin())\n\t\t\t\t\t\t{putc('[',r_sink);}\n\t\t\t\t\/\/\tm_stack.push\n\t\t\t\t\t}\n\n\t\t\tprivate:\n\t\t\t\tSink& r_sink;\n\t\t\t\tstd::stack< std::unique_ptr< VisitorBase<Sink,Acceptor> > > m_stack;\n\t\t\t};\n\t\t}\n\n\ttemplate<class StorageModel,class Sink>\n\tvoid temple_store(const ItemBase<StorageModel>& root,Sink& sink)\n\t\t{Acceptor<StorageModel,Sink>(root,sink).run();}\n\t}\n\n#endif\n<|endoftext|>"} {"text":"<commit_before>\/\/ null_inst_tests.cc\n#include <gtest\/gtest.h>\n\n#include \"null_inst.h\"\n\n#include \"context.h\"\n#include \"inst_model_tests.h\"\n#include \"model_tests.h\"\n\n\/\/ - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -\nclass NullInstTest : public ::testing::Test {\n protected:\n virtual void SetUp() {}\n\n virtual void TearDown() {}\n};\n\n\/\/ - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -\ncyclus::Model* NullInstModelConstructor(cyclus::Context* ctx) {\n return dynamic_cast<cyclus::Model*>(new cycamore::NullInst(ctx));\n}\n\n\/\/ - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -\ncyclus::InstModel* NullInstConstructor(cyclus::Context* ctx) {\n return dynamic_cast<cyclus::InstModel*>(new cycamore::NullInst(ctx));\n}\n\n\/\/ - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -\nINSTANTIATE_TEST_CASE_P(NullInst, InstModelTests,\n Values(&NullInstConstructor));\nINSTANTIATE_TEST_CASE_P(NullInst, ModelTests,\n Values(&NullInstModelConstructor));\n\n<commit_msg>null_inst_tests : sort includes.<commit_after>\/\/ null_inst_tests.cc\n#include <gtest\/gtest.h>\n\n#include \"context.h\"\n#include \"inst_model_tests.h\"\n#include \"model_tests.h\"\n#include \"null_inst.h\"\n\n\/\/ - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -\nclass NullInstTest : public ::testing::Test {\n protected:\n virtual void SetUp() {}\n\n virtual void TearDown() {}\n};\n\n\/\/ - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -\ncyclus::Model* NullInstModelConstructor(cyclus::Context* ctx) {\n return dynamic_cast<cyclus::Model*>(new cycamore::NullInst(ctx));\n}\n\n\/\/ - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -\ncyclus::InstModel* NullInstConstructor(cyclus::Context* ctx) {\n return dynamic_cast<cyclus::InstModel*>(new cycamore::NullInst(ctx));\n}\n\n\/\/ - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -\nINSTANTIATE_TEST_CASE_P(NullInst, InstModelTests,\n Values(&NullInstConstructor));\nINSTANTIATE_TEST_CASE_P(NullInst, ModelTests,\n Values(&NullInstModelConstructor));\n\n<|endoftext|>"} {"text":"<commit_before>\/*\n * yosys -- Yosys Open SYnthesis Suite\n *\n * Copyright (C) 2012 Clifford Wolf <clifford@clifford.at>\n *\n * Permission to use, copy, modify, and\/or distribute this software for any\n * purpose with or without fee is hereby granted, provided that the above\n * copyright notice and this permission notice appear in all copies.\n *\n * THE SOFTWARE IS PROVIDED \"AS IS\" AND THE AUTHOR DISCLAIMS ALL WARRANTIES\n * WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF\n * MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR\n * ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES\n * WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN\n * ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF\n * OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE.\n *\n *\/\n\n#include \"kernel\/register.h\"\n#include \"kernel\/celltypes.h\"\n#include \"kernel\/rtlil.h\"\n#include \"kernel\/log.h\"\n\nUSING_YOSYS_NAMESPACE\nPRIVATE_NAMESPACE_BEGIN\n\nstruct SynthGreenPAK4Pass : public ScriptPass\n{\n\tSynthGreenPAK4Pass() : ScriptPass(\"synth_greenpak4\", \"synthesis for GreenPAK4 FPGAs\") { }\n\n\tvirtual void help() YS_OVERRIDE\n\t{\n\t\t\/\/ |---v---|---v---|---v---|---v---|---v---|---v---|---v---|---v---|---v---|---v---|\n\t\tlog(\"\\n\");\n\t\tlog(\" synth_greenpak4 [options]\\n\");\n\t\tlog(\"\\n\");\n\t\tlog(\"This command runs synthesis for GreenPAK4 FPGAs. This work is experimental.\\n\");\n\t\tlog(\"\\n\");\n\t\tlog(\" -top <module>\\n\");\n\t\tlog(\" use the specified module as top module (default='top')\\n\");\n\t\tlog(\"\\n\");\n\t\tlog(\" -part <part>\\n\");\n\t\tlog(\" synthesize for the specified part. Valid values are SLG46140V,\\n\");\n\t\tlog(\" SLG46620V, and SLG46621V (default).\\n\");\n\t\tlog(\"\\n\");\n\t\tlog(\" -json <file>\\n\");\n\t\tlog(\" write the design to the specified JSON file. writing of an output file\\n\");\n\t\tlog(\" is omitted if this parameter is not specified.\\n\");\n\t\tlog(\"\\n\");\n\t\tlog(\" -run <from_label>:<to_label>\\n\");\n\t\tlog(\" only run the commands between the labels (see below). an empty\\n\");\n\t\tlog(\" from label is synonymous to 'begin', and empty to label is\\n\");\n\t\tlog(\" synonymous to the end of the command list.\\n\");\n\t\tlog(\"\\n\");\n\t\tlog(\" -noflatten\\n\");\n\t\tlog(\" do not flatten design before synthesis\\n\");\n\t\tlog(\"\\n\");\n\t\tlog(\" -retime\\n\");\n\t\tlog(\" run 'abc' with -dff option\\n\");\n\t\tlog(\"\\n\");\n\t\tlog(\"\\n\");\n\t\tlog(\"The following commands are executed by this synthesis command:\\n\");\n\t\thelp_script();\n\t\tlog(\"\\n\");\n\t}\n\n\tstring top_opt, part, json_file;\n\tbool flatten, retime;\n\n\tvirtual void clear_flags() YS_OVERRIDE\n\t{\n\t\ttop_opt = \"-auto-top\";\n\t\tpart = \"SLG46621V\";\n\t\tjson_file = \"\";\n\t\tflatten = true;\n\t\tretime = false;\n\t}\n\n\tvirtual void execute(std::vector<std::string> args, RTLIL::Design *design) YS_OVERRIDE\n\t{\n\t\tstring run_from, run_to;\n\t\tclear_flags();\n\n\t\tsize_t argidx;\n\t\tfor (argidx = 1; argidx < args.size(); argidx++)\n\t\t{\n\t\t\tif (args[argidx] == \"-top\" && argidx+1 < args.size()) {\n\t\t\t\ttop_opt = \"-top \" + args[++argidx];\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t\tif (args[argidx] == \"-json\" && argidx+1 < args.size()) {\n\t\t\t\tjson_file = args[++argidx];\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t\tif (args[argidx] == \"-part\" && argidx+1 < args.size()) {\n\t\t\t\tpart = args[++argidx];\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t\tif (args[argidx] == \"-run\" && argidx+1 < args.size()) {\n\t\t\t\tsize_t pos = args[argidx+1].find(':');\n\t\t\t\tif (pos == std::string::npos)\n\t\t\t\t\tbreak;\n\t\t\t\trun_from = args[++argidx].substr(0, pos);\n\t\t\t\trun_to = args[argidx].substr(pos+1);\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t\tif (args[argidx] == \"-noflatten\") {\n\t\t\t\tflatten = false;\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t\tif (args[argidx] == \"-retime\") {\n\t\t\t\tretime = true;\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t\tbreak;\n\t\t}\n\t\textra_args(args, argidx, design);\n\n\t\tif (!design->full_selection())\n\t\t\tlog_cmd_error(\"This comannd only operates on fully selected designs!\\n\");\n\n\t\tif (part != \"SLG46140V\" && part != \"SLG46620V\" && part != \"SLG46621V\")\n\t\t\tlog_cmd_error(\"Invalid part name: '%s'\\n\", part.c_str());\n\n\t\tlog_header(design, \"Executing SYNTH_GREENPAK4 pass.\\n\");\n\t\tlog_push();\n\n\t\trun_script(design, run_from, run_to);\n\n\t\tlog_pop();\n\t}\n\n\tvirtual void script() YS_OVERRIDE\n\t{\n\t\tif (check_label(\"begin\"))\n\t\t{\n\t\t\trun(\"read_verilog -lib +\/greenpak4\/cells_sim.v\");\n\t\t\trun(stringf(\"hierarchy -check %s\", help_mode ? \"-top <top>\" : top_opt.c_str()));\n\t\t}\n\n\t\tif (flatten && check_label(\"flatten\", \"(unless -noflatten)\"))\n\t\t{\n\t\t\trun(\"proc\");\n\t\t\trun(\"flatten\");\n\t\t\trun(\"tribuf -logic\");\n\t\t}\n\n\t\tif (check_label(\"coarse\"))\n\t\t{\n\t\t\trun(\"synth -run coarse\");\n\t\t}\n\n\t\tif (check_label(\"fine\"))\n\t\t{\n\t\t\trun(\"greenpak4_counters\");\n\t\t\trun(\"clean\");\n\t\t\trun(\"opt -fast -mux_undef -undriven -fine\");\n\t\t\trun(\"memory_map\");\n\t\t\trun(\"opt -undriven -fine\");\n\t\t\trun(\"techmap\");\n\t\t\trun(\"dfflibmap -prepare -liberty +\/greenpak4\/gp_dff.lib\");\n\t\t\trun(\"opt -fast\");\n\t\t\tif (retime || help_mode)\n\t\t\t\trun(\"abc -dff\", \"(only if -retime)\");\n\t\t}\n\n\t\tif (check_label(\"map_luts\"))\n\t\t{\n\t\t\tif (help_mode || part == \"SLG46140V\") run(\"nlutmap -assert -luts 0,6,8,2\", \" (for -part SLG46140V)\");\n\t\t\tif (help_mode || part == \"SLG46620V\") run(\"nlutmap -assert -luts 2,8,16,2\", \"(for -part SLG46620V)\");\n\t\t\tif (help_mode || part == \"SLG46621V\") run(\"nlutmap -assert -luts 2,8,16,2\", \"(for -part SLG46621V)\");\n\t\t\trun(\"clean\");\n\t\t}\n\n\t\tif (check_label(\"map_cells\"))\n\t\t{\n\t\t\trun(\"shregmap -tech greenpak4\");\n\t\t\trun(\"dfflibmap -liberty +\/greenpak4\/gp_dff.lib\");\n\t\t\trun(\"dffinit -ff GP_DFF Q INIT\");\n\t\t\trun(\"dffinit -ff GP_DFFR Q INIT\");\n\t\t\trun(\"dffinit -ff GP_DFFS Q INIT\");\n\t\t\trun(\"dffinit -ff GP_DFFSR Q INIT\");\n\t\t\trun(\"iopadmap -bits -inpad GP_IBUF OUT:IN -outpad GP_OBUF IN:OUT -inoutpad GP_OBUF OUT:IN -toutpad GP_OBUFT OE:IN:OUT -tinoutpad GP_IOBUF OE:OUT:IN:IO\");\n\t\t\trun(\"techmap -map +\/greenpak4\/cells_map.v\");\n\t\t\trun(\"clean\");\n\t\t}\n\n\t\tif (check_label(\"check\"))\n\t\t{\n\t\t\trun(\"hierarchy -check\");\n\t\t\trun(\"stat\");\n\t\t\trun(\"check -noinit\");\n\t\t}\n\n\t\tif (check_label(\"json\"))\n\t\t{\n\t\t\tif (!json_file.empty() || help_mode)\n\t\t\t\trun(stringf(\"write_json %s\", help_mode ? \"<file-name>\" : json_file.c_str()));\n\t\t}\n\n\t\tlog_pop();\n\t}\n} SynthGreenPAK4Pass;\n\nPRIVATE_NAMESPACE_END\n<commit_msg>synth_greenpak4: use attrmvcp to move LOC from wires to cells.<commit_after>\/*\n * yosys -- Yosys Open SYnthesis Suite\n *\n * Copyright (C) 2012 Clifford Wolf <clifford@clifford.at>\n *\n * Permission to use, copy, modify, and\/or distribute this software for any\n * purpose with or without fee is hereby granted, provided that the above\n * copyright notice and this permission notice appear in all copies.\n *\n * THE SOFTWARE IS PROVIDED \"AS IS\" AND THE AUTHOR DISCLAIMS ALL WARRANTIES\n * WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF\n * MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR\n * ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES\n * WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN\n * ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF\n * OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE.\n *\n *\/\n\n#include \"kernel\/register.h\"\n#include \"kernel\/celltypes.h\"\n#include \"kernel\/rtlil.h\"\n#include \"kernel\/log.h\"\n\nUSING_YOSYS_NAMESPACE\nPRIVATE_NAMESPACE_BEGIN\n\nstruct SynthGreenPAK4Pass : public ScriptPass\n{\n\tSynthGreenPAK4Pass() : ScriptPass(\"synth_greenpak4\", \"synthesis for GreenPAK4 FPGAs\") { }\n\n\tvirtual void help() YS_OVERRIDE\n\t{\n\t\t\/\/ |---v---|---v---|---v---|---v---|---v---|---v---|---v---|---v---|---v---|---v---|\n\t\tlog(\"\\n\");\n\t\tlog(\" synth_greenpak4 [options]\\n\");\n\t\tlog(\"\\n\");\n\t\tlog(\"This command runs synthesis for GreenPAK4 FPGAs. This work is experimental.\\n\");\n\t\tlog(\"\\n\");\n\t\tlog(\" -top <module>\\n\");\n\t\tlog(\" use the specified module as top module (default='top')\\n\");\n\t\tlog(\"\\n\");\n\t\tlog(\" -part <part>\\n\");\n\t\tlog(\" synthesize for the specified part. Valid values are SLG46140V,\\n\");\n\t\tlog(\" SLG46620V, and SLG46621V (default).\\n\");\n\t\tlog(\"\\n\");\n\t\tlog(\" -json <file>\\n\");\n\t\tlog(\" write the design to the specified JSON file. writing of an output file\\n\");\n\t\tlog(\" is omitted if this parameter is not specified.\\n\");\n\t\tlog(\"\\n\");\n\t\tlog(\" -run <from_label>:<to_label>\\n\");\n\t\tlog(\" only run the commands between the labels (see below). an empty\\n\");\n\t\tlog(\" from label is synonymous to 'begin', and empty to label is\\n\");\n\t\tlog(\" synonymous to the end of the command list.\\n\");\n\t\tlog(\"\\n\");\n\t\tlog(\" -noflatten\\n\");\n\t\tlog(\" do not flatten design before synthesis\\n\");\n\t\tlog(\"\\n\");\n\t\tlog(\" -retime\\n\");\n\t\tlog(\" run 'abc' with -dff option\\n\");\n\t\tlog(\"\\n\");\n\t\tlog(\"\\n\");\n\t\tlog(\"The following commands are executed by this synthesis command:\\n\");\n\t\thelp_script();\n\t\tlog(\"\\n\");\n\t}\n\n\tstring top_opt, part, json_file;\n\tbool flatten, retime;\n\n\tvirtual void clear_flags() YS_OVERRIDE\n\t{\n\t\ttop_opt = \"-auto-top\";\n\t\tpart = \"SLG46621V\";\n\t\tjson_file = \"\";\n\t\tflatten = true;\n\t\tretime = false;\n\t}\n\n\tvirtual void execute(std::vector<std::string> args, RTLIL::Design *design) YS_OVERRIDE\n\t{\n\t\tstring run_from, run_to;\n\t\tclear_flags();\n\n\t\tsize_t argidx;\n\t\tfor (argidx = 1; argidx < args.size(); argidx++)\n\t\t{\n\t\t\tif (args[argidx] == \"-top\" && argidx+1 < args.size()) {\n\t\t\t\ttop_opt = \"-top \" + args[++argidx];\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t\tif (args[argidx] == \"-json\" && argidx+1 < args.size()) {\n\t\t\t\tjson_file = args[++argidx];\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t\tif (args[argidx] == \"-part\" && argidx+1 < args.size()) {\n\t\t\t\tpart = args[++argidx];\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t\tif (args[argidx] == \"-run\" && argidx+1 < args.size()) {\n\t\t\t\tsize_t pos = args[argidx+1].find(':');\n\t\t\t\tif (pos == std::string::npos)\n\t\t\t\t\tbreak;\n\t\t\t\trun_from = args[++argidx].substr(0, pos);\n\t\t\t\trun_to = args[argidx].substr(pos+1);\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t\tif (args[argidx] == \"-noflatten\") {\n\t\t\t\tflatten = false;\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t\tif (args[argidx] == \"-retime\") {\n\t\t\t\tretime = true;\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t\tbreak;\n\t\t}\n\t\textra_args(args, argidx, design);\n\n\t\tif (!design->full_selection())\n\t\t\tlog_cmd_error(\"This comannd only operates on fully selected designs!\\n\");\n\n\t\tif (part != \"SLG46140V\" && part != \"SLG46620V\" && part != \"SLG46621V\")\n\t\t\tlog_cmd_error(\"Invalid part name: '%s'\\n\", part.c_str());\n\n\t\tlog_header(design, \"Executing SYNTH_GREENPAK4 pass.\\n\");\n\t\tlog_push();\n\n\t\trun_script(design, run_from, run_to);\n\n\t\tlog_pop();\n\t}\n\n\tvirtual void script() YS_OVERRIDE\n\t{\n\t\tif (check_label(\"begin\"))\n\t\t{\n\t\t\trun(\"read_verilog -lib +\/greenpak4\/cells_sim.v\");\n\t\t\trun(stringf(\"hierarchy -check %s\", help_mode ? \"-top <top>\" : top_opt.c_str()));\n\t\t}\n\n\t\tif (flatten && check_label(\"flatten\", \"(unless -noflatten)\"))\n\t\t{\n\t\t\trun(\"proc\");\n\t\t\trun(\"flatten\");\n\t\t\trun(\"tribuf -logic\");\n\t\t}\n\n\t\tif (check_label(\"coarse\"))\n\t\t{\n\t\t\trun(\"synth -run coarse\");\n\t\t}\n\n\t\tif (check_label(\"fine\"))\n\t\t{\n\t\t\trun(\"greenpak4_counters\");\n\t\t\trun(\"clean\");\n\t\t\trun(\"opt -fast -mux_undef -undriven -fine\");\n\t\t\trun(\"memory_map\");\n\t\t\trun(\"opt -undriven -fine\");\n\t\t\trun(\"techmap\");\n\t\t\trun(\"dfflibmap -prepare -liberty +\/greenpak4\/gp_dff.lib\");\n\t\t\trun(\"opt -fast\");\n\t\t\tif (retime || help_mode)\n\t\t\t\trun(\"abc -dff\", \"(only if -retime)\");\n\t\t}\n\n\t\tif (check_label(\"map_luts\"))\n\t\t{\n\t\t\tif (help_mode || part == \"SLG46140V\") run(\"nlutmap -assert -luts 0,6,8,2\", \" (for -part SLG46140V)\");\n\t\t\tif (help_mode || part == \"SLG46620V\") run(\"nlutmap -assert -luts 2,8,16,2\", \"(for -part SLG46620V)\");\n\t\t\tif (help_mode || part == \"SLG46621V\") run(\"nlutmap -assert -luts 2,8,16,2\", \"(for -part SLG46621V)\");\n\t\t\trun(\"clean\");\n\t\t}\n\n\t\tif (check_label(\"map_cells\"))\n\t\t{\n\t\t\trun(\"shregmap -tech greenpak4\");\n\t\t\trun(\"dfflibmap -liberty +\/greenpak4\/gp_dff.lib\");\n\t\t\trun(\"dffinit -ff GP_DFF Q INIT\");\n\t\t\trun(\"dffinit -ff GP_DFFR Q INIT\");\n\t\t\trun(\"dffinit -ff GP_DFFS Q INIT\");\n\t\t\trun(\"dffinit -ff GP_DFFSR Q INIT\");\n\t\t\trun(\"iopadmap -bits -inpad GP_IBUF OUT:IN -outpad GP_OBUF IN:OUT -inoutpad GP_OBUF OUT:IN -toutpad GP_OBUFT OE:IN:OUT -tinoutpad GP_IOBUF OE:OUT:IN:IO\");\n\t\t\trun(\"attrmvcp -attr src -attr LOC t:GP_OBUF t:GP_OBUFT t:GP_IOBUF n:*\");\n\t\t\trun(\"attrmvcp -attr src -attr LOC -driven t:GP_IBUF n:*\");\n\t\t\trun(\"techmap -map +\/greenpak4\/cells_map.v\");\n\t\t\trun(\"clean\");\n\t\t}\n\n\t\tif (check_label(\"check\"))\n\t\t{\n\t\t\trun(\"hierarchy -check\");\n\t\t\trun(\"stat\");\n\t\t\trun(\"check -noinit\");\n\t\t}\n\n\t\tif (check_label(\"json\"))\n\t\t{\n\t\t\tif (!json_file.empty() || help_mode)\n\t\t\t\trun(stringf(\"write_json %s\", help_mode ? \"<file-name>\" : json_file.c_str()));\n\t\t}\n\n\t\tlog_pop();\n\t}\n} SynthGreenPAK4Pass;\n\nPRIVATE_NAMESPACE_END\n<|endoftext|>"} {"text":"<commit_before>\/\/===- WebAssemblyTargetMachine.cpp - Define TargetMachine for WebAssembly -==\/\/\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 defines the WebAssembly-specific subclass of TargetMachine.\n\/\/\/\n\/\/===----------------------------------------------------------------------===\/\/\n\n#include \"WebAssembly.h\"\n#include \"MCTargetDesc\/WebAssemblyMCTargetDesc.h\"\n#include \"WebAssemblyTargetMachine.h\"\n#include \"WebAssemblyTargetObjectFile.h\"\n#include \"WebAssemblyTargetTransformInfo.h\"\n#include \"llvm\/CodeGen\/MachineFunctionPass.h\"\n#include \"llvm\/CodeGen\/Passes.h\"\n#include \"llvm\/CodeGen\/RegAllocRegistry.h\"\n#include \"llvm\/IR\/Function.h\"\n#include \"llvm\/Support\/CommandLine.h\"\n#include \"llvm\/Support\/TargetRegistry.h\"\n#include \"llvm\/Target\/TargetOptions.h\"\n#include \"llvm\/Transforms\/Scalar.h\"\nusing namespace llvm;\n\n#define DEBUG_TYPE \"wasm\"\n\nextern \"C\" void LLVMInitializeWebAssemblyTarget() {\n \/\/ Register the target.\n RegisterTargetMachine<WebAssemblyTargetMachine> X(TheWebAssemblyTarget32);\n RegisterTargetMachine<WebAssemblyTargetMachine> Y(TheWebAssemblyTarget64);\n}\n\n\/\/===----------------------------------------------------------------------===\/\/\n\/\/ WebAssembly Lowering public interface.\n\/\/===----------------------------------------------------------------------===\/\/\n\n\/\/\/ Create an WebAssembly architecture model.\n\/\/\/\nWebAssemblyTargetMachine::WebAssemblyTargetMachine(\n const Target &T, const Triple &TT, StringRef CPU, StringRef FS,\n const TargetOptions &Options, Reloc::Model RM, CodeModel::Model CM,\n CodeGenOpt::Level OL)\n : LLVMTargetMachine(T,\n TT.isArch64Bit() ? \"e-m:e-p:64:64-i64:64-n32:64-S128\"\n : \"e-m:e-p:32:32-i64:64-n32:64-S128\",\n TT, CPU, FS, Options, RM, CM, OL),\n TLOF(make_unique<WebAssemblyTargetObjectFile>()) {\n \/\/ WebAssembly type-checks expressions, but a noreturn function with a return\n \/\/ type that doesn't match the context will cause a check failure. So we lower\n \/\/ LLVM 'unreachable' to ISD::TRAP and then lower that to WebAssembly's\n \/\/ 'unreachable' expression which is meant for that case.\n this->Options.TrapUnreachable = true;\n\n initAsmInfo();\n\n \/\/ Note that we don't use setRequiresStructuredCFG(true). It disables\n \/\/ optimizations than we're ok with, and want, such as critical edge\n \/\/ splitting and tail merging.\n}\n\nWebAssemblyTargetMachine::~WebAssemblyTargetMachine() {}\n\nconst WebAssemblySubtarget *\nWebAssemblyTargetMachine::getSubtargetImpl(const Function &F) const {\n Attribute CPUAttr = F.getFnAttribute(\"target-cpu\");\n Attribute FSAttr = F.getFnAttribute(\"target-features\");\n\n std::string CPU = !CPUAttr.hasAttribute(Attribute::None)\n ? CPUAttr.getValueAsString().str()\n : TargetCPU;\n std::string FS = !FSAttr.hasAttribute(Attribute::None)\n ? FSAttr.getValueAsString().str()\n : TargetFS;\n\n auto &I = SubtargetMap[CPU + FS];\n if (!I) {\n \/\/ This needs to be done before we create a new subtarget since any\n \/\/ creation will depend on the TM and the code generation flags on the\n \/\/ function that reside in TargetOptions.\n resetTargetOptions(F);\n I = llvm::make_unique<WebAssemblySubtarget>(TargetTriple, CPU, FS, *this);\n }\n return I.get();\n}\n\nnamespace {\n\/\/\/ WebAssembly Code Generator Pass Configuration Options.\nclass WebAssemblyPassConfig final : public TargetPassConfig {\npublic:\n WebAssemblyPassConfig(WebAssemblyTargetMachine *TM, PassManagerBase &PM)\n : TargetPassConfig(TM, PM) {}\n\n WebAssemblyTargetMachine &getWebAssemblyTargetMachine() const {\n return getTM<WebAssemblyTargetMachine>();\n }\n\n FunctionPass *createTargetRegisterAllocator(bool) override;\n\n void addIRPasses() override;\n bool addInstSelector() override;\n bool addILPOpts() override;\n void addPreRegAlloc() override;\n void addPostRegAlloc() override;\n void addPreEmitPass() override;\n};\n} \/\/ end anonymous namespace\n\nTargetIRAnalysis WebAssemblyTargetMachine::getTargetIRAnalysis() {\n return TargetIRAnalysis([this](const Function &F) {\n return TargetTransformInfo(WebAssemblyTTIImpl(this, F));\n });\n}\n\nTargetPassConfig *\nWebAssemblyTargetMachine::createPassConfig(PassManagerBase &PM) {\n return new WebAssemblyPassConfig(this, PM);\n}\n\nFunctionPass *WebAssemblyPassConfig::createTargetRegisterAllocator(bool) {\n return nullptr; \/\/ No reg alloc\n}\n\n\/\/===----------------------------------------------------------------------===\/\/\n\/\/ The following functions are called from lib\/CodeGen\/Passes.cpp to modify\n\/\/ the CodeGen pass sequence.\n\/\/===----------------------------------------------------------------------===\/\/\n\nvoid WebAssemblyPassConfig::addIRPasses() {\n if (TM->Options.ThreadModel == ThreadModel::Single)\n \/\/ In \"single\" mode, atomics get lowered to non-atomics.\n addPass(createLowerAtomicPass());\n else\n \/\/ Expand some atomic operations. WebAssemblyTargetLowering has hooks which\n \/\/ control specifically what gets lowered.\n addPass(createAtomicExpandPass(TM));\n\n \/\/ Optimize \"returned\" function attributes.\n if (getOptLevel() != CodeGenOpt::None)\n addPass(createWebAssemblyOptimizeReturned());\n\n TargetPassConfig::addIRPasses();\n}\n\nbool WebAssemblyPassConfig::addInstSelector() {\n (void)TargetPassConfig::addInstSelector();\n addPass(\n createWebAssemblyISelDag(getWebAssemblyTargetMachine(), getOptLevel()));\n \/\/ Run the argument-move pass immediately after the ScheduleDAG scheduler\n \/\/ so that we can fix up the ARGUMENT instructions before anything else\n \/\/ sees them in the wrong place.\n addPass(createWebAssemblyArgumentMove());\n \/\/ Set the p2align operands. This information is present during ISel, however\n \/\/ it's inconvenient to collect. Collect it now, and update the immediate\n \/\/ operands.\n addPass(createWebAssemblySetP2AlignOperands());\n return false;\n}\n\nbool WebAssemblyPassConfig::addILPOpts() {\n (void)TargetPassConfig::addILPOpts();\n return true;\n}\n\nvoid WebAssemblyPassConfig::addPreRegAlloc() {\n TargetPassConfig::addPreRegAlloc();\n\n \/\/ Prepare store instructions for register stackifying.\n if (getOptLevel() != CodeGenOpt::None)\n addPass(createWebAssemblyStoreResults());\n}\n\nvoid WebAssemblyPassConfig::addPostRegAlloc() {\n \/\/ TODO: The following CodeGen passes don't currently support code containing\n \/\/ virtual registers. Consider removing their restrictions and re-enabling\n \/\/ them.\n \/\/\n \/\/ We use our own PrologEpilogInserter which is very slightly modified to\n \/\/ tolerate virtual registers.\n disablePass(&PrologEpilogCodeInserterID);\n \/\/ Fails with: should be run after register allocation.\n disablePass(&MachineCopyPropagationID);\n disablePass(&TailDuplicateID);\n\n if (getOptLevel() != CodeGenOpt::None) {\n \/\/ Mark registers as representing wasm's expression stack.\n addPass(createWebAssemblyRegStackify());\n\n \/\/ Run the register coloring pass to reduce the total number of registers.\n addPass(createWebAssemblyRegColoring());\n }\n\n TargetPassConfig::addPostRegAlloc();\n\n \/\/ Run WebAssembly's version of the PrologEpilogInserter. Target-independent\n \/\/ PEI runs after PostRegAlloc and after ShrinkWrap. Putting it here will run\n \/\/ PEI before ShrinkWrap but otherwise in the same position in the order.\n addPass(createWebAssemblyPEI());\n}\n\nvoid WebAssemblyPassConfig::addPreEmitPass() {\n TargetPassConfig::addPreEmitPass();\n\n \/\/ Put the CFG in structured form; insert BLOCK and LOOP markers.\n addPass(createWebAssemblyCFGStackify());\n\n \/\/ Lower br_unless into br_if.\n addPass(createWebAssemblyLowerBrUnless());\n\n \/\/ Create a mapping from LLVM CodeGen virtual registers to wasm registers.\n addPass(createWebAssemblyRegNumbering());\n\n \/\/ Perform the very last peephole optimizations on the code.\n if (getOptLevel() != CodeGenOpt::None)\n addPass(createWebAssemblyPeephole());\n}\n<commit_msg>[WebAssembly] Re-enable the TailDuplicate pass.<commit_after>\/\/===- WebAssemblyTargetMachine.cpp - Define TargetMachine for WebAssembly -==\/\/\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 defines the WebAssembly-specific subclass of TargetMachine.\n\/\/\/\n\/\/===----------------------------------------------------------------------===\/\/\n\n#include \"WebAssembly.h\"\n#include \"MCTargetDesc\/WebAssemblyMCTargetDesc.h\"\n#include \"WebAssemblyTargetMachine.h\"\n#include \"WebAssemblyTargetObjectFile.h\"\n#include \"WebAssemblyTargetTransformInfo.h\"\n#include \"llvm\/CodeGen\/MachineFunctionPass.h\"\n#include \"llvm\/CodeGen\/Passes.h\"\n#include \"llvm\/CodeGen\/RegAllocRegistry.h\"\n#include \"llvm\/IR\/Function.h\"\n#include \"llvm\/Support\/CommandLine.h\"\n#include \"llvm\/Support\/TargetRegistry.h\"\n#include \"llvm\/Target\/TargetOptions.h\"\n#include \"llvm\/Transforms\/Scalar.h\"\nusing namespace llvm;\n\n#define DEBUG_TYPE \"wasm\"\n\nextern \"C\" void LLVMInitializeWebAssemblyTarget() {\n \/\/ Register the target.\n RegisterTargetMachine<WebAssemblyTargetMachine> X(TheWebAssemblyTarget32);\n RegisterTargetMachine<WebAssemblyTargetMachine> Y(TheWebAssemblyTarget64);\n}\n\n\/\/===----------------------------------------------------------------------===\/\/\n\/\/ WebAssembly Lowering public interface.\n\/\/===----------------------------------------------------------------------===\/\/\n\n\/\/\/ Create an WebAssembly architecture model.\n\/\/\/\nWebAssemblyTargetMachine::WebAssemblyTargetMachine(\n const Target &T, const Triple &TT, StringRef CPU, StringRef FS,\n const TargetOptions &Options, Reloc::Model RM, CodeModel::Model CM,\n CodeGenOpt::Level OL)\n : LLVMTargetMachine(T,\n TT.isArch64Bit() ? \"e-m:e-p:64:64-i64:64-n32:64-S128\"\n : \"e-m:e-p:32:32-i64:64-n32:64-S128\",\n TT, CPU, FS, Options, RM, CM, OL),\n TLOF(make_unique<WebAssemblyTargetObjectFile>()) {\n \/\/ WebAssembly type-checks expressions, but a noreturn function with a return\n \/\/ type that doesn't match the context will cause a check failure. So we lower\n \/\/ LLVM 'unreachable' to ISD::TRAP and then lower that to WebAssembly's\n \/\/ 'unreachable' expression which is meant for that case.\n this->Options.TrapUnreachable = true;\n\n initAsmInfo();\n\n \/\/ Note that we don't use setRequiresStructuredCFG(true). It disables\n \/\/ optimizations than we're ok with, and want, such as critical edge\n \/\/ splitting and tail merging.\n}\n\nWebAssemblyTargetMachine::~WebAssemblyTargetMachine() {}\n\nconst WebAssemblySubtarget *\nWebAssemblyTargetMachine::getSubtargetImpl(const Function &F) const {\n Attribute CPUAttr = F.getFnAttribute(\"target-cpu\");\n Attribute FSAttr = F.getFnAttribute(\"target-features\");\n\n std::string CPU = !CPUAttr.hasAttribute(Attribute::None)\n ? CPUAttr.getValueAsString().str()\n : TargetCPU;\n std::string FS = !FSAttr.hasAttribute(Attribute::None)\n ? FSAttr.getValueAsString().str()\n : TargetFS;\n\n auto &I = SubtargetMap[CPU + FS];\n if (!I) {\n \/\/ This needs to be done before we create a new subtarget since any\n \/\/ creation will depend on the TM and the code generation flags on the\n \/\/ function that reside in TargetOptions.\n resetTargetOptions(F);\n I = llvm::make_unique<WebAssemblySubtarget>(TargetTriple, CPU, FS, *this);\n }\n return I.get();\n}\n\nnamespace {\n\/\/\/ WebAssembly Code Generator Pass Configuration Options.\nclass WebAssemblyPassConfig final : public TargetPassConfig {\npublic:\n WebAssemblyPassConfig(WebAssemblyTargetMachine *TM, PassManagerBase &PM)\n : TargetPassConfig(TM, PM) {}\n\n WebAssemblyTargetMachine &getWebAssemblyTargetMachine() const {\n return getTM<WebAssemblyTargetMachine>();\n }\n\n FunctionPass *createTargetRegisterAllocator(bool) override;\n\n void addIRPasses() override;\n bool addInstSelector() override;\n bool addILPOpts() override;\n void addPreRegAlloc() override;\n void addPostRegAlloc() override;\n void addPreEmitPass() override;\n};\n} \/\/ end anonymous namespace\n\nTargetIRAnalysis WebAssemblyTargetMachine::getTargetIRAnalysis() {\n return TargetIRAnalysis([this](const Function &F) {\n return TargetTransformInfo(WebAssemblyTTIImpl(this, F));\n });\n}\n\nTargetPassConfig *\nWebAssemblyTargetMachine::createPassConfig(PassManagerBase &PM) {\n return new WebAssemblyPassConfig(this, PM);\n}\n\nFunctionPass *WebAssemblyPassConfig::createTargetRegisterAllocator(bool) {\n return nullptr; \/\/ No reg alloc\n}\n\n\/\/===----------------------------------------------------------------------===\/\/\n\/\/ The following functions are called from lib\/CodeGen\/Passes.cpp to modify\n\/\/ the CodeGen pass sequence.\n\/\/===----------------------------------------------------------------------===\/\/\n\nvoid WebAssemblyPassConfig::addIRPasses() {\n if (TM->Options.ThreadModel == ThreadModel::Single)\n \/\/ In \"single\" mode, atomics get lowered to non-atomics.\n addPass(createLowerAtomicPass());\n else\n \/\/ Expand some atomic operations. WebAssemblyTargetLowering has hooks which\n \/\/ control specifically what gets lowered.\n addPass(createAtomicExpandPass(TM));\n\n \/\/ Optimize \"returned\" function attributes.\n if (getOptLevel() != CodeGenOpt::None)\n addPass(createWebAssemblyOptimizeReturned());\n\n TargetPassConfig::addIRPasses();\n}\n\nbool WebAssemblyPassConfig::addInstSelector() {\n (void)TargetPassConfig::addInstSelector();\n addPass(\n createWebAssemblyISelDag(getWebAssemblyTargetMachine(), getOptLevel()));\n \/\/ Run the argument-move pass immediately after the ScheduleDAG scheduler\n \/\/ so that we can fix up the ARGUMENT instructions before anything else\n \/\/ sees them in the wrong place.\n addPass(createWebAssemblyArgumentMove());\n \/\/ Set the p2align operands. This information is present during ISel, however\n \/\/ it's inconvenient to collect. Collect it now, and update the immediate\n \/\/ operands.\n addPass(createWebAssemblySetP2AlignOperands());\n return false;\n}\n\nbool WebAssemblyPassConfig::addILPOpts() {\n (void)TargetPassConfig::addILPOpts();\n return true;\n}\n\nvoid WebAssemblyPassConfig::addPreRegAlloc() {\n TargetPassConfig::addPreRegAlloc();\n\n \/\/ Prepare store instructions for register stackifying.\n if (getOptLevel() != CodeGenOpt::None)\n addPass(createWebAssemblyStoreResults());\n}\n\nvoid WebAssemblyPassConfig::addPostRegAlloc() {\n \/\/ TODO: The following CodeGen passes don't currently support code containing\n \/\/ virtual registers. Consider removing their restrictions and re-enabling\n \/\/ them.\n \/\/\n \/\/ We use our own PrologEpilogInserter which is very slightly modified to\n \/\/ tolerate virtual registers.\n disablePass(&PrologEpilogCodeInserterID);\n \/\/ Fails with: should be run after register allocation.\n disablePass(&MachineCopyPropagationID);\n\n if (getOptLevel() != CodeGenOpt::None) {\n \/\/ Mark registers as representing wasm's expression stack.\n addPass(createWebAssemblyRegStackify());\n\n \/\/ Run the register coloring pass to reduce the total number of registers.\n addPass(createWebAssemblyRegColoring());\n }\n\n TargetPassConfig::addPostRegAlloc();\n\n \/\/ Run WebAssembly's version of the PrologEpilogInserter. Target-independent\n \/\/ PEI runs after PostRegAlloc and after ShrinkWrap. Putting it here will run\n \/\/ PEI before ShrinkWrap but otherwise in the same position in the order.\n addPass(createWebAssemblyPEI());\n}\n\nvoid WebAssemblyPassConfig::addPreEmitPass() {\n TargetPassConfig::addPreEmitPass();\n\n \/\/ Put the CFG in structured form; insert BLOCK and LOOP markers.\n addPass(createWebAssemblyCFGStackify());\n\n \/\/ Lower br_unless into br_if.\n addPass(createWebAssemblyLowerBrUnless());\n\n \/\/ Create a mapping from LLVM CodeGen virtual registers to wasm registers.\n addPass(createWebAssemblyRegNumbering());\n\n \/\/ Perform the very last peephole optimizations on the code.\n if (getOptLevel() != CodeGenOpt::None)\n addPass(createWebAssemblyPeephole());\n}\n<|endoftext|>"} {"text":"<commit_before>\/*\n Dynamics\/Kinematics modeling and simulation library.\n Copyright (C) 1999 by Michael Alexander Ewert\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\n#include \"cssysdef.h\"\n#include \"csphyzik\/forces.h\"\n#include \"csphyzik\/phyzent.h\"\n#include \"csphyzik\/refframe.h\"\n#include \"csphyzik\/debug.h\"\n\nctGravityF::ctGravityF ( real pg, ctVector3 pd )\n{\n magnitude = pg, direction = pd; \n}\n\nctGravityF::ctGravityF ( ctReferenceFrame &rf, real pg, ctVector3 pd ) \n : ctForce( rf )\n{\n magnitude = pg, direction = pd; \n}\n\nctVector3 ctGravityF::apply_F ( ctDynamicEntity &pe )\n{\n \/\/ F = mg\n ctVector3 f = direction * magnitude * pe.get_m ();\n pe.sum_force ( f );\n return f;\n}\n\nctAirResistanceF::ctAirResistanceF ( real pk )\n{\n magnitude = -pk;\n}\n\nctVector3 ctAirResistanceF::apply_F ( ctDynamicEntity &pe )\n{\n ctVector3 lf = (pe.get_v ()) * magnitude;\n pe.sum_force ( lf );\n\/\/ ctVector3 af = (pe.get_angular_v ()) * magnitude\/5;\n\/\/ pe.sum_torque ( af );\n return lf;\n\n}\n\nctAppliedF::ctAppliedF ( ctVector3 dir, real pm )\n{ \n magnitude = pm; \n direction = dir.Unit(); \n}\n\nctVector3 ctAppliedF::apply_F ( ctDynamicEntity &pe )\n{ \n pe.sum_force ( direction * magnitude ); \n return direction*magnitude; \n}\n\n\nctTorqueF::ctTorqueF( ctVector3 dir, real pm )\n{ \n magnitude = pm; \n direction = dir.Unit(); \n}\n\nctVector3 ctTorqueF::apply_F( ctDynamicEntity &pe )\n{ \n pe.sum_torque ( direction*magnitude ); \n return direction*magnitude; \n}\n\n\nctVector3 ctSpringF::apply_F( ctDynamicEntity &pe )\n{\n ctVector3 f;\n ctVector3 d;\n ctVector3 a1;\n ctVector3 a2;\n\n if ( body_vector.get_size() == 2 && \n attachment_point_vector.get_size() == 2 )\n {\n ctPhysicalEntity *b1 = body_vector.get_first();\n ctPhysicalEntity *b2 = body_vector.get_next();\n \n ctVector3 *orig_a1 = attachment_point_vector.get_first();\n ctVector3 *orig_a2 = attachment_point_vector.get_next();\n\n if ( b1 && orig_a1 && orig_a2 )\n {\n ctReferenceFrame *r1 = b1->get_RF();\n ctReferenceFrame *r2 = ( b2 == NULL ) ? \n\t&(ctReferenceFrame::universe()) : b2->get_RF();\n\n if ( r1 && r2 )\n {\n\tr1->this_to_world( a1, *orig_a1 );\n\tr2->this_to_world( a2, *orig_a2 );\n\t\t\t\t\n\tif ( &pe == b1 ) \n\t d = a2 - a1;\n\telse if( &pe == b2 )\n\t d = a1 - a2;\n\telse\n\t{\n\t log( \"ctSpringF: body applied not part of coupling\\n\" );\n\t return ctVector3(0,0,0);\n\t}\n\t\t\t\t\n\t\/\/!me maybe don't need to normalize and find unit vector\n\t\/\/!me I think that d.Norm() and later mult d by disp divides out to 1\n\treal disp = d.Norm() - rest_length;\n\tif ( d*d > MIN_REAL ) \/\/ avoid divide by zero\n\t d = d.Unit();\n\telse\n\t d = ctVector3(1, 0,0 ); \n\n\t\/\/ f = -kx\n\tf = d*disp*magnitude;\n\t\n\tif ( &pe == b1 )\n\t{ \n\t b1->sum_force(f);\n\t d = a1 - r1->get_world_offset ();\n\t b1->sum_torque ( d % f );\n\t}\n\telse if ( &pe == b2 && b2 != NULL )\n\t{\n\t b2->sum_force (f);\n\t d = a2 - r2->get_world_offset ();\n\t b2->sum_torque ( d % f );\n\t}\n\treturn f;\t\t\t\n }\n }\n }\n return f;\n}\n\n\n\/\/!me untested\n\/\/ 1\/r^2 force. Such as gravity.\n\/\/ right now an object passing too close to the discontinuity will get accelerated\n\/\/ way fast and energy will NOT be conserved. This could be fixed using R-K \n\/\/ method with adaptive step-sizing or some happy horse-shit like that.\nctVector3 ctGravityWell::apply_F ( ctDynamicEntity &moon )\n{\n double g_force;\n ctVector3 r_vec;\n ctVector3 total_f ( 0.0,0.0,0.0 );\n ctVector3 planet_x;\n ctVector3 moon_x;\n double r_len2;\n ctPhysicalEntity *planet;\n\n planet = body_vector.get_first ();\n while ( planet != NULL )\n {\n if ( planet != &moon )\n {\n planet_x = planet->get_pos ();\n moon_x = moon.get_pos ();\n\n r_vec = moon_x - planet_x;\n\n r_len2 = r_vec * r_vec;\n\n r_vec.Normalize ();\n if ( r_len2 < MIN_REAL )\n\tr_len2 = MIN_REAL; \/\/!me maybe have a max accel limit instead?\n\n g_force = ( magnitude * (( ctDynamicEntity * )planet)->get_m() ) * moon.get_m () \/ r_len2;\n r_vec *= g_force;\n moon.sum_force ( r_vec ); \n total_f += r_vec;\n }\n planet = body_vector.get_next ();\n }\t\n return total_f;\n}\n<commit_msg>a new force by Anders Stenberg (Dentoid)<commit_after>\/*\n Dynamics\/Kinematics modeling and simulation library.\n Copyright (C) 1999 by Michael Alexander Ewert\n 2001 Anders Stenberg\n\t\t \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\n#include \"cssysdef.h\"\n#include \"csphyzik\/forces.h\"\n#include \"csphyzik\/phyzent.h\"\n#include \"csphyzik\/refframe.h\"\n#include \"csphyzik\/debug.h\"\n\nctGravityF::ctGravityF ( real pg, ctVector3 pd )\n{\n magnitude = pg, direction = pd; \n}\n\nctGravityF::ctGravityF ( ctReferenceFrame &rf, real pg, ctVector3 pd ) \n : ctForce( rf )\n{\n magnitude = pg, direction = pd; \n}\n\nctVector3 ctGravityF::apply_F ( ctDynamicEntity &pe )\n{\n \/\/ F = mg\n ctVector3 f = direction * magnitude * pe.get_m ();\n pe.sum_force ( f );\n return f;\n}\n\nctAirResistanceF::ctAirResistanceF ( real pk )\n{\n magnitude = -pk;\n}\n\nctVector3 ctAirResistanceF::apply_F ( ctDynamicEntity &pe )\n{\n ctVector3 lf = (pe.get_v ()) * magnitude;\n pe.sum_force ( lf );\n\/\/ ctVector3 af = (pe.get_angular_v ()) * magnitude\/5;\n\/\/ pe.sum_torque ( af );\n return lf;\n\n}\n\nctAppliedF::ctAppliedF ( ctVector3 dir, real pm )\n{ \n magnitude = pm; \n direction = dir.Unit(); \n}\n\nctVector3 ctAppliedF::apply_F ( ctDynamicEntity &pe )\n{ \n pe.sum_force ( direction * magnitude ); \n return direction*magnitude; \n}\n\n\nctTorqueF::ctTorqueF( ctVector3 dir, real pm )\n{ \n magnitude = pm; \n direction = dir.Unit(); \n}\n\nctVector3 ctTorqueF::apply_F( ctDynamicEntity &pe )\n{ \n pe.sum_torque ( direction*magnitude ); \n return direction*magnitude; \n}\n\n\nctVector3 ctSpringF::apply_F( ctDynamicEntity &pe )\n{\n ctVector3 f;\n ctVector3 d;\n ctVector3 a1;\n ctVector3 a2;\n\n if ( body_vector.get_size() == 2 && \n attachment_point_vector.get_size() == 2 )\n {\n ctPhysicalEntity *b1 = body_vector.get_first();\n ctPhysicalEntity *b2 = body_vector.get_next();\n \n ctVector3 *orig_a1 = attachment_point_vector.get_first();\n ctVector3 *orig_a2 = attachment_point_vector.get_next();\n\n if ( b1 && orig_a1 && orig_a2 )\n {\n ctReferenceFrame *r1 = b1->get_RF();\n ctReferenceFrame *r2 = ( b2 == NULL ) ? \n\t&(ctReferenceFrame::universe()) : b2->get_RF();\n\n if ( r1 && r2 )\n {\n\tr1->this_to_world( a1, *orig_a1 );\n\tr2->this_to_world( a2, *orig_a2 );\n\t\t\t\t\n\tif ( &pe == b1 ) \n\t d = a2 - a1;\n\telse if( &pe == b2 )\n\t d = a1 - a2;\n\telse\n\t{\n\t log( \"ctSpringF: body applied not part of coupling\\n\" );\n\t return ctVector3(0,0,0);\n\t}\n\t\t\t\t\n\t\/\/!me maybe don't need to normalize and find unit vector\n\t\/\/!me I think that d.Norm() and later mult d by disp divides out to 1\n\treal disp = d.Norm() - rest_length;\n\tif ( d*d > MIN_REAL ) \/\/ avoid divide by zero\n\t d = d.Unit();\n\telse\n\t d = ctVector3(1, 0,0 ); \n\n\t\/\/ f = -kx\n\tf = d*disp*magnitude;\n\t\n\tif ( &pe == b1 )\n\t{ \n\t b1->sum_force(f);\n\t d = a1 - r1->get_world_offset ();\n\t b1->sum_torque ( d % f );\n\t}\n\telse if ( &pe == b2 && b2 != NULL )\n\t{\n\t b2->sum_force (f);\n\t d = a2 - r2->get_world_offset ();\n\t b2->sum_torque ( d % f );\n\t}\n\treturn f;\t\t\t\n }\n }\n }\n return f;\n}\n\n\nctVector3 ctCappedSpringF::apply_F( ctDynamicEntity &pe )\n{\n ctVector3 f;\n ctVector3 d;\n ctVector3 a1;\n ctVector3 a2;\n\n if ( body_vector.get_size() == 2 && \n attachment_point_vector.get_size() == 2 )\n {\n ctPhysicalEntity *b1 = body_vector.get_first();\n ctPhysicalEntity *b2 = body_vector.get_next();\n \n ctVector3 *orig_a1 = attachment_point_vector.get_first();\n ctVector3 *orig_a2 = attachment_point_vector.get_next();\n\n if ( b1 && orig_a1 && orig_a2 )\n {\n ctReferenceFrame *r1 = b1->get_RF();\n ctReferenceFrame *r2 = ( b2 == NULL ) ? \n\t&(ctReferenceFrame::universe()) : b2->get_RF();\n\n if ( r1 && r2 )\n {\n\tr1->this_to_world( a1, *orig_a1 );\n\tr2->this_to_world( a2, *orig_a2 );\n\t\t\t\t\n\tif ( &pe == b1 ) \n\t d = a2 - a1;\n\telse if( &pe == b2 )\n\t d = a1 - a2;\n\telse\n\t{\n\t log( \"ctSpringF: body applied not part of coupling\\n\" );\n\t return ctVector3(0,0,0);\n\t}\n\t\t\t\t\n\t\/\/!me maybe don't need to normalize and find unit vector\n\t\/\/!me I think that d.Norm() and later mult d by disp divides out to 1\n\treal dist = d.Norm();\n\treal disp = 0;\n\tif ( dist>cap_max ) disp = dist-cap_max;\n\telse if ( dist<cap_min ) disp = cap_min-dist;\n\tif ( d*d > MIN_REAL ) \/\/ avoid divide by zero\n\t d = d.Unit();\n\telse\n\t d = ctVector3(1, 0,0 ); \n\n\t\/\/ f = -kx\n\tf = d*disp*magnitude;\n\t\n\tif ( &pe == b1 )\n\t{ \n\t b1->sum_force(f);\n\t d = a1 - r1->get_world_offset ();\n\t b1->sum_torque ( d % f );\n\t}\n\telse if ( &pe == b2 && b2 != NULL )\n\t{\n\t b2->sum_force (f);\n\t d = a2 - r2->get_world_offset ();\n\t b2->sum_torque ( d % f );\n\t}\n\treturn f;\t\t\t\n }\n }\n }\n return f;\n}\n\n\n\/\/!me untested\n\/\/ 1\/r^2 force. Such as gravity.\n\/\/ right now an object passing too close to the discontinuity will get accelerated\n\/\/ way fast and energy will NOT be conserved. This could be fixed using R-K \n\/\/ method with adaptive step-sizing or some happy horse-shit like that.\nctVector3 ctGravityWell::apply_F ( ctDynamicEntity &moon )\n{\n double g_force;\n ctVector3 r_vec;\n ctVector3 total_f ( 0.0,0.0,0.0 );\n ctVector3 planet_x;\n ctVector3 moon_x;\n double r_len2;\n ctPhysicalEntity *planet;\n\n planet = body_vector.get_first ();\n while ( planet != NULL )\n {\n if ( planet != &moon )\n {\n planet_x = planet->get_pos ();\n moon_x = moon.get_pos ();\n\n r_vec = moon_x - planet_x;\n\n r_len2 = r_vec * r_vec;\n\n r_vec.Normalize ();\n if ( r_len2 < MIN_REAL )\n\tr_len2 = MIN_REAL; \/\/!me maybe have a max accel limit instead?\n\n g_force = ( magnitude * (( ctDynamicEntity * )planet)->get_m() ) * moon.get_m () \/ r_len2;\n r_vec *= g_force;\n moon.sum_force ( r_vec ); \n total_f += r_vec;\n }\n planet = body_vector.get_next ();\n }\t\n return total_f;\n}\n<|endoftext|>"} {"text":"<commit_before>\/*\n Copyright 2002-2013 CEA LIST\n\n This file is part of LIMA.\n\n LIMA 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 LIMA is distributed in the hope that it will be 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 LIMA. If not, see <http:\/\/www.gnu.org\/licenses\/>\n*\/\n\/***************************************************************************\n * Copyright (C) 2003 by CEA *\n * author Olivier MESNARD olivier.mesnard@cea.fr *\n * *\n * Compact dictionnary based on finite state automata implemented with *\n * Boost Graph library. *\n * Algorithm is described in article from Daciuk, Mihov, Watson & Watson: *\n * \"Incremental Construction of Minimal Acyclic Finite State Automata\" *\n ***************************************************************************\/\n\n\nnamespace Lima {\nnamespace Common {\nnamespace StringMap {\n\ntemplate <typename accessMethod, typename contentElement, typename storedSet>\nSimpleDataDico<accessMethod, contentElement, storedSet>::SimpleDataDico( const contentElement& defaultValue )\n\/\/ : StringMap<accessMethod, contentElement, storedSet>( defaultValue ) {\n : StringMap<accessMethod, contentElement>( defaultValue ) {\n#ifdef DEBUG_CD\n STRINGMAPLOGINIT;\n LDEBUG << \"SimpleDataDico::SimpleDataDico()\";\n#endif\n}\n\ntemplate <typename accessMethod, typename contentElement, typename storedSet>\nvoid SimpleDataDico<accessMethod, contentElement, storedSet>::parseData( const std::string& dataFileName )\n{\n#ifdef DEBUG_CD\n STRINGMAPLOGINIT;\n LDEBUG << \"SimpleDataDico::parseData(\" << dataFileName;\n#endif\n\n std::ifstream is(dataFileName.c_str(), std::ios::binary );\n if( is.bad() ) {\n std::string mess = \"SimpleDataDico::parseData: Can't open file \" + dataFileName;\n#ifdef DEBUG_CD\n LERROR << mess;\n#endif\n throw( Lima::IncompleteResources(mess) );\n }\n copy(std::istream_iterator<contentElement>(is), std::istream_iterator<contentElement>(),\n back_inserter(m_data));\n uint64_t dataSize = m_data.size();\n#ifdef DEBUG_CD\n LDEBUG << \"SimpleDataDico::parseData: read \" << dataSize\n << \" pieces of data from \" << dataFileName;\n#endif\n if( StringMap<accessMethod, contentElement>::m_accessMethod.getSize() != dataSize ) {\n std::ostringstream oss;\n oss << \"SimpleDataDico::parseData dataSize = \" << dataSize\n << \" != accessSize = \" << StringMap<accessMethod, contentElement>::m_accessMethod.getSize();\n#ifdef DEBUG_CD\n LERROR << oss.str();\n#endif\n throw( Lima::IncompleteResources(oss.str()) );\n }\n}\n\n\n\/\/ Gets the dictionary entry correponding to the specified word.\n\/\/ If word is not into dictionary, m_emptyElement is returned.\ntemplate <typename accessMethod, typename contentElement, typename storedSet>\nconst contentElement& SimpleDataDico<accessMethod, contentElement, storedSet>::getElement(\nconst Lima::LimaString& word) const{\n uint64_t index = -1;\n#ifdef DEBUG_CD\n STRINGMAPLOGINIT;\n const Lima::LimaString & basicWord = word;\n LDEBUG << \"SimpleDataDico::getElement(\"\n << Lima::Common::Misc::convertString(basicWord) << \")\";\n#endif\n\n \/\/ Look in FsaDictionary (or tree or..)\n index = StringMap<accessMethod, contentElement>::m_accessMethod.getIndex(word);\n#ifdef DEBUG_CD\n LDEBUG << \"index = \" << index;\n#endif\n if( index > 0 )\n return m_data[index];\n else\n return StringMap<accessMethod, contentElement>::m_emptyElement;\n}\n\n\n} \/\/ namespace StringMap\n} \/\/ namespace Commmon\n} \/\/ namespace Lima\n<commit_msg>Correct a compile error<commit_after>\/*\n Copyright 2002-2013 CEA LIST\n\n This file is part of LIMA.\n\n LIMA 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 LIMA is distributed in the hope that it will be 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 LIMA. If not, see <http:\/\/www.gnu.org\/licenses\/>\n*\/\n\/***************************************************************************\n * Copyright (C) 2003 by CEA *\n * author Olivier MESNARD olivier.mesnard@cea.fr *\n * *\n * Compact dictionnary based on finite state automata implemented with *\n * Boost Graph library. *\n * Algorithm is described in article from Daciuk, Mihov, Watson & Watson: *\n * \"Incremental Construction of Minimal Acyclic Finite State Automata\" *\n ***************************************************************************\/\n\n\nnamespace Lima {\nnamespace Common {\nnamespace StringMap {\n\ntemplate <typename accessMethod, typename contentElement, typename storedSet>\nSimpleDataDico<accessMethod, contentElement, storedSet>::SimpleDataDico( const contentElement& defaultValue )\n\/\/ : StringMap<accessMethod, contentElement, storedSet>( defaultValue ) {\n : StringMap<accessMethod, contentElement>( defaultValue ) {\n#ifdef DEBUG_CD\n STRINGMAPLOGINIT;\n LDEBUG << \"SimpleDataDico::SimpleDataDico()\";\n#endif\n}\n\ntemplate <typename accessMethod, typename contentElement, typename storedSet>\nvoid SimpleDataDico<accessMethod, contentElement, storedSet>::parseData( const std::string& dataFileName )\n{\n#ifdef DEBUG_CD\n STRINGMAPLOGINIT;\n LDEBUG << \"SimpleDataDico::parseData(\" << dataFileName;\n#endif\n\n std::ifstream is(dataFileName.c_str(), std::ios::binary );\n if( is.bad() ) {\n std::string mess = \"SimpleDataDico::parseData: Can't open file \" + dataFileName;\n#ifdef DEBUG_CD\n LERROR << mess;\n#endif\n throw( Lima::IncompleteResources(mess) );\n }\n copy(std::istream_iterator<contentElement>(is), std::istream_iterator<contentElement>(),\n back_inserter(m_data));\n uint64_t dataSize = m_data.size();\n#ifdef DEBUG_CD\n LDEBUG << \"SimpleDataDico::parseData: read \" << dataSize\n << \" pieces of data from \" << dataFileName;\n#endif\n if( StringMap<accessMethod, contentElement>::m_accessMethod.getSize() != dataSize ) {\n std::ostringstream oss;\n oss << \"SimpleDataDico::parseData dataSize = \" << dataSize\n << \" != accessSize = \" << StringMap<accessMethod, contentElement>::m_accessMethod.getSize();\n#ifdef DEBUG_CD\n LERROR << oss.str();\n#endif\n throw( Lima::IncompleteResources(oss.str()) );\n }\n}\n\n\n\/\/ Gets the dictionary entry correponding to the specified word.\n\/\/ If word is not into dictionary, m_emptyElement is returned.\ntemplate <typename accessMethod, typename contentElement, typename storedSet>\nconst contentElement& SimpleDataDico<accessMethod, contentElement, storedSet>::getElement(\nconst Lima::LimaString& word) const{\n uint64_t index = -1;\n#ifdef DEBUG_CD\n STRINGMAPLOGINIT;\n const Lima::LimaString & basicWord = word;\n LDEBUG << \"SimpleDataDico::getElement(\" << basicWord << \")\";\n#endif\n\n \/\/ Look in FsaDictionary (or tree or..)\n index = StringMap<accessMethod, contentElement>::m_accessMethod.getIndex(word);\n#ifdef DEBUG_CD\n LDEBUG << \"index = \" << index;\n#endif\n if( index > 0 )\n return m_data[index];\n else\n return StringMap<accessMethod, contentElement>::m_emptyElement;\n}\n\n\n} \/\/ namespace StringMap\n} \/\/ namespace Commmon\n} \/\/ namespace Lima\n<|endoftext|>"} {"text":"<commit_before>#include <SDL2\/SDL.h>\n#include <engine\/input\/InputController.h>\n#include <engine\/core\/Utils.hpp>\n#include <externals\/box2d\/Box2D\/Box2D\/Dynamics\/b2World.h>\n#include \"game\/Game.h\"\n#include \"engine\/input\/Keyboard.h\"\n#include \"globals.h\"\n#include \"engine\/2d_map\/Map.h\"\n\nGame::Game() {\n SDL_Init(SDL_INIT_EVERYTHING);\n this->_eventsManager = new EventsManager();\n\n b2World *world = new b2World(b2Vec2(float32(0), float32(10)));\n this->gameLoop();\n}\n\nGame::~Game() {\n delete(this->_eventsManager);\n}\n\nvoid Game::gameLoop() {\n Graphics graphics = Graphics(\"Game\", globals::SCREEN_WIDTH, globals::SCREEN_HEIGHT);\n Keyboard input;\n SDL_Event event;\n\n InputController *inputController = new InputController();\n\n _map = new Map(graphics);\n _map->loadFromJSON(\"resources\/maps\", \"test.json\");\n _map->setOffset({0,0});\n\n _player = new Player(graphics, inputController, 0);\n _player->setPosition(120, 200);\n\n long time_accumulator = 0;\n float game_speed = 1.0f;\n\n long prev_time = SDL_GetTicks();\n while (true) {\n input.beginNewFrame();\n\n if (SDL_PollEvent(&event)) {\n if (event.type == SDL_KEYDOWN) {\n if (event.key.repeat == 0) {\n input.keyDownEvent(event);\n }\n }\/\/ if a key was released\n else if (event.type == SDL_KEYUP) {\n input.keyUpEvent(event);\n }\/\/if the user hits the exit button\n else if (event.type == SDL_QUIT) {\n break;\n } else {\n _eventsManager->add_frame_event(event);\n }\n }\n\n inputController->process_frame_events(_eventsManager->get_frame_events());\n\n if (input.wasKeyPressed(SDL_SCANCODE_ESCAPE)) {\n break;\n }\n\n long elapsed_time = SDL_GetTicks() - prev_time;\n\/\/ time_accumulator += elapsed_time;\n if (elapsed_time >= globals::FRAME_TIME) {\n game_speed = elapsed_time \/ float(globals::FRAME_TIME);\n\/\/ SDL_Log(\"elapsed:%d speed:%f\", elapsed_time, game_speed);\n\/\/ time_accumulator -= globals::FRAME_TIME;\n this->update(game_speed);\n this->draw(graphics);\n this->_eventsManager->clear_events();\n prev_time = SDL_GetTicks();\n }\n }\n\n SDL_Quit();\n}\n\nvoid Game::draw(Graphics &graphics) {\n graphics.clear(40, 150, 70, 255);\n _map->draw();\n\n SDL_SetRenderDrawColor(graphics.getRenderer(), 0,0,0,255);\n\/\/ SDL_RenderDrawLine(graphics.getRenderer(), 0, 200, 500, 200);\n\/\/ SDL_RenderDrawLine(graphics.getRenderer(), 120, 0, 120, 200);\n\n _player->draw(graphics);\n\n graphics.flip();\n}\n\nstatic int pos = 0;\n\nvoid Game::update(float game_speed) {\n\/\/ pos += 1 * game_speed;\n\/\/ _map->setOffset({0,0});\n\n _player->handleInput(game_speed);\n _player->update(game_speed);\n}\n\n<commit_msg>Clear events outside of the drawing block. This was causing a bug<commit_after>#include <SDL2\/SDL.h>\n#include <engine\/input\/InputController.h>\n#include <engine\/core\/Utils.hpp>\n#include <externals\/box2d\/Box2D\/Box2D\/Dynamics\/b2World.h>\n#include \"game\/Game.h\"\n#include \"engine\/input\/Keyboard.h\"\n#include \"globals.h\"\n#include \"engine\/2d_map\/Map.h\"\n\nGame::Game() {\n SDL_Init(SDL_INIT_EVERYTHING);\n this->_eventsManager = new EventsManager();\n\n b2World *world = new b2World(b2Vec2(float32(0), float32(10)));\n this->gameLoop();\n}\n\nGame::~Game() {\n delete(this->_eventsManager);\n}\n\nvoid Game::gameLoop() {\n Graphics graphics = Graphics(\"Game\", globals::SCREEN_WIDTH, globals::SCREEN_HEIGHT);\n Keyboard input;\n SDL_Event event;\n\n InputController *inputController = new InputController();\n\n _map = new Map(graphics);\n _map->loadFromJSON(\"resources\/maps\", \"test.json\");\n _map->setOffset({0,0});\n\n _player = new Player(graphics, inputController, 0);\n _player->setPosition(120, 200);\n\n long time_accumulator = 0;\n float game_speed = 1.0f;\n\n long prev_time = SDL_GetTicks();\n while (true) {\n input.beginNewFrame();\n\n if (SDL_PollEvent(&event)) {\n if (event.type == SDL_KEYDOWN) {\n if (event.key.repeat == 0) {\n input.keyDownEvent(event);\n }\n }\/\/ if a key was released\n else if (event.type == SDL_KEYUP) {\n input.keyUpEvent(event);\n }\/\/if the user hits the exit button\n else if (event.type == SDL_QUIT) {\n break;\n } else {\n _eventsManager->add_frame_event(event);\n }\n }\n\n inputController->process_frame_events(_eventsManager->get_frame_events());\n\n if (input.wasKeyPressed(SDL_SCANCODE_ESCAPE)) {\n break;\n }\n\n long elapsed_time = SDL_GetTicks() - prev_time;\n\/\/ time_accumulator += elapsed_time;\n if (elapsed_time >= globals::FRAME_TIME) {\n game_speed = elapsed_time \/ float(globals::FRAME_TIME);\n\/\/ SDL_Log(\"elapsed:%d speed:%f\", elapsed_time, game_speed);\n\/\/ time_accumulator -= globals::FRAME_TIME;\n this->update(game_speed);\n this->draw(graphics);\n prev_time = SDL_GetTicks();\n }\n this->_eventsManager->clear_events();\n }\n\n SDL_Quit();\n}\n\nvoid Game::draw(Graphics &graphics) {\n graphics.clear(40, 150, 70, 255);\n _map->draw();\n\n SDL_SetRenderDrawColor(graphics.getRenderer(), 0,0,0,255);\n\/\/ SDL_RenderDrawLine(graphics.getRenderer(), 0, 200, 500, 200);\n\/\/ SDL_RenderDrawLine(graphics.getRenderer(), 120, 0, 120, 200);\n\n _player->draw(graphics);\n\n graphics.flip();\n}\n\nstatic int pos = 0;\n\nvoid Game::update(float game_speed) {\n\/\/ pos += 1 * game_speed;\n\/\/ _map->setOffset({0,0});\n\n _player->handleInput(game_speed);\n _player->update(game_speed);\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 \"chrome\/browser\/app_modal_dialog_queue.h\"\n\n#include \"chrome\/browser\/browser_list.h\"\n\n\/\/ static\nstd::queue<views::AppModalDialogDelegate*>*\n AppModalDialogQueue::app_modal_dialog_queue_ = NULL;\nviews::AppModalDialogDelegate* AppModalDialogQueue::active_dialog_ = NULL;\n\n\/\/ static\nvoid AppModalDialogQueue::AddDialog(views::AppModalDialogDelegate* dialog) {\n DCHECK(dialog->IsModal());\n if (!app_modal_dialog_queue_) {\n app_modal_dialog_queue_ = new std::queue<views::AppModalDialogDelegate*>;\n ShowModalDialog(dialog);\n }\n\n app_modal_dialog_queue_->push(dialog);\n}\n\n\/\/ static\nvoid AppModalDialogQueue::ShowNextDialog() {\n app_modal_dialog_queue_->pop();\n active_dialog_ = NULL;\n if (!app_modal_dialog_queue_->empty()) {\n ShowModalDialog(app_modal_dialog_queue_->front());\n } else {\n delete app_modal_dialog_queue_;\n app_modal_dialog_queue_ = NULL;\n }\n}\n\n\/\/ static\nvoid AppModalDialogQueue::ActivateModalDialog() {\n if (!app_modal_dialog_queue_->empty())\n app_modal_dialog_queue_->front()->ActivateModalDialog();\n}\n\n\/\/ static\nvoid AppModalDialogQueue::ShowModalDialog(\n views::AppModalDialogDelegate* dialog) {\n dialog->ShowModalDialog();\n active_dialog_ = dialog;\n}\n<commit_msg>Fix a couple of (likely rare) crashers that can happen if a tab is closed right as it's about to display a JS modal dialog.<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\/app_modal_dialog_queue.h\"\n\n#include \"chrome\/browser\/browser_list.h\"\n\n\/\/ static\nstd::queue<views::AppModalDialogDelegate*>*\n AppModalDialogQueue::app_modal_dialog_queue_ = NULL;\nviews::AppModalDialogDelegate* AppModalDialogQueue::active_dialog_ = NULL;\n\n\/\/ static\nvoid AppModalDialogQueue::AddDialog(views::AppModalDialogDelegate* dialog) {\n DCHECK(dialog->IsModal());\n if (!app_modal_dialog_queue_) {\n app_modal_dialog_queue_ = new std::queue<views::AppModalDialogDelegate*>;\n ShowModalDialog(dialog);\n }\n\n \/\/ ShowModalDialog can wind up calling ShowNextDialog in some cases, which\n \/\/ can then make app_modal_dialog_queue_ NULL.\n if (app_modal_dialog_queue_)\n app_modal_dialog_queue_->push(dialog);\n}\n\n\/\/ static\nvoid AppModalDialogQueue::ShowNextDialog() {\n app_modal_dialog_queue_->pop();\n active_dialog_ = NULL;\n if (!app_modal_dialog_queue_->empty()) {\n ShowModalDialog(app_modal_dialog_queue_->front());\n } else {\n delete app_modal_dialog_queue_;\n app_modal_dialog_queue_ = NULL;\n }\n}\n\n\/\/ static\nvoid AppModalDialogQueue::ActivateModalDialog() {\n if (!app_modal_dialog_queue_->empty())\n app_modal_dialog_queue_->front()->ActivateModalDialog();\n}\n\n\/\/ static\nvoid AppModalDialogQueue::ShowModalDialog(\n views::AppModalDialogDelegate* dialog) {\n \/\/ ShowModalDialog can wind up calling ShowNextDialog in some cases,\n \/\/ which will wind up calling this method recursively, so active_dialog_\n \/\/ must be set first.\n active_dialog_ = dialog;\n dialog->ShowModalDialog();\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\/external_tab_container.h\"\n\n#include \"base\/logging.h\"\n#include \"base\/win_util.h\"\n#include \"chrome\/browser\/automation\/automation_provider.h\"\n#include \"chrome\/browser\/profile.h\"\n#include \"chrome\/browser\/tab_contents\/tab_contents.h\"\n#include \"chrome\/browser\/views\/tab_contents_container_view.h\"\n#include \"chrome\/browser\/tab_contents\/web_contents.h\"\n#include \"chrome\/common\/chrome_constants.h\"\n#include \"chrome\/common\/win_util.h\"\n\/\/ Included for SetRootViewForHWND.\n#include \"chrome\/views\/widget_win.h\"\n#include \"chrome\/test\/automation\/automation_messages.h\"\n\nstatic const wchar_t kWindowObjectKey[] = L\"ChromeWindowObject\";\n\n\/\/ TODO(sanjeevr): The external_accel_table_ and external_accel_entry_count_\n\/\/ member variables are now obsolete and we don't use them.\n\/\/ We need to remove them.\nExternalTabContainer::ExternalTabContainer(\n AutomationProvider* automation)\n : automation_(automation),\n root_view_(this),\n tab_contents_(NULL),\n external_accel_table_(NULL),\n external_accel_entry_count_(0),\n tab_contents_container_(NULL) {\n}\n\nExternalTabContainer::~ExternalTabContainer() {\n}\n\nbool ExternalTabContainer::Init(Profile* profile, HWND parent,\n const gfx::Rect& dimensions,\n unsigned int style) {\n if (IsWindow()) {\n NOTREACHED();\n return false;\n }\n \/\/ First create the container window\n if (!Create(NULL, dimensions.ToRECT())) {\n NOTREACHED();\n return false;\n }\n\n \/\/ We don't ever remove the prop because the lifetime of this object\n \/\/ is the same as the lifetime of the window\n SetProp(*this, kWindowObjectKey, this);\n\n views::SetRootViewForHWND(m_hWnd, &root_view_);\n \/\/ CreateFocusManager will subclass this window and delete the FocusManager\n \/\/ instance when this window goes away.\n views::FocusManager* focus_manager =\n views::FocusManager::CreateFocusManager(m_hWnd, GetRootView());\n DCHECK(focus_manager);\n focus_manager->AddKeystrokeListener(this);\n tab_contents_ = TabContents::CreateWithType(TAB_CONTENTS_WEB, profile, NULL);\n if (!tab_contents_) {\n NOTREACHED();\n DestroyWindow();\n return false;\n }\n tab_contents_->SetupController(profile);\n tab_contents_->set_delegate(this);\n\n WebContents* web_conents = tab_contents_->AsWebContents();\n if (web_conents)\n web_conents->render_view_host()->AllowExternalHostBindings();\n\n \/\/ Create a TabContentsContainerView to handle focus cycling using Tab and\n \/\/ Shift-Tab.\n tab_contents_container_ = new TabContentsContainerView();\n root_view_.AddChildView(tab_contents_container_);\n \/\/ Note that SetTabContents must be called after AddChildView is called\n tab_contents_container_->SetTabContents(tab_contents_);\n \/\/ Add a dummy view to catch when the user tabs out of the tab\n \/\/ Create a dummy FocusTraversable object to represent the frame of the\n \/\/ external host. This will allow Tab and Shift-Tab to cycle into the\n \/\/ external frame. When the tab_contents_container_ loses focus,\n \/\/ the focus will be moved to this class (See OnSetFocus in this file).\n \/\/ An alternative to using views::View and catching when the focus manager\n \/\/ shifts the focus to the dummy view could be to implement our own view\n \/\/ and handle AboutToRequestFocusFromTabTraversal.\n views::View* dummy = new views::View();\n dummy->SetFocusable(true);\n DCHECK(dummy->IsFocusable());\n root_view_.AddChildView(dummy);\n\n NavigationController* controller = tab_contents_->controller();\n DCHECK(controller);\n registrar_.Add(this, NotificationType::NAV_ENTRY_COMMITTED,\n Source<NavigationController>(controller));\n NotificationService::current()->Notify(\n NotificationType::EXTERNAL_TAB_CREATED,\n Source<NavigationController>(controller),\n NotificationService::NoDetails());\n\n \/\/ Now apply the parenting and style\n if (parent)\n SetParent(parent);\n\n \/\/ We need WS_POPUP to be on the window during initialization, but\n \/\/ once initialized and parent-ed, we apply the requested style which\n \/\/ may or may not include the popup bit.\n ModifyStyle(WS_POPUP, style, 0);\n\n ::ShowWindow(tab_contents_->GetNativeView(), SW_SHOW);\n return true;\n}\n\nvoid ExternalTabContainer::OnDestroy() {\n views::FocusManager* focus_manager =\n views::FocusManager::GetFocusManager(GetHWND());\n if (focus_manager) {\n focus_manager->RemoveKeystrokeListener(this);\n }\n root_view_.RemoveAllChildViews(true);\n if (tab_contents_) {\n NavigationController* controller = tab_contents_->controller();\n DCHECK(controller);\n\n NotificationService::current()->Notify(\n NotificationType::EXTERNAL_TAB_CLOSED,\n Source<NavigationController>(controller),\n Details<ExternalTabContainer>(this));\n tab_contents_->set_delegate(NULL);\n tab_contents_->CloseContents();\n \/\/ WARNING: tab_contents_ has likely been deleted.\n tab_contents_ = NULL;\n }\n}\n\nvoid ExternalTabContainer::OnFinalMessage(HWND window) {\n delete this;\n}\n\nLRESULT ExternalTabContainer::OnSize(UINT, WPARAM, LPARAM, BOOL& handled) {\n if (tab_contents_) {\n RECT client_rect = {0};\n GetClientRect(&client_rect);\n ::SetWindowPos(tab_contents_->GetNativeView(), NULL, client_rect.left,\n client_rect.top, client_rect.right - client_rect.left,\n client_rect.bottom - client_rect.top, SWP_NOZORDER);\n }\n return 0;\n}\n\nLRESULT ExternalTabContainer::OnSetFocus(UINT msg, WPARAM wp, LPARAM lp,\n BOOL& handled) {\n if (automation_) {\n views::FocusManager* focus_manager =\n views::FocusManager::GetFocusManager(GetHWND());\n DCHECK(focus_manager);\n if (focus_manager) {\n focus_manager->ClearFocus();\n automation_->Send(new AutomationMsg_TabbedOut(win_util::IsShiftPressed(),\n false));\n }\n }\n\n return 0;\n}\n\nvoid ExternalTabContainer::OpenURLFromTab(TabContents* source,\n const GURL& url,\n const GURL& referrer,\n WindowOpenDisposition disposition,\n PageTransition::Type transition) {\n switch (disposition) {\n case CURRENT_TAB:\n case NEW_FOREGROUND_TAB:\n case NEW_BACKGROUND_TAB:\n case NEW_WINDOW:\n if (automation_) {\n automation_->Send(new AutomationMsg_OpenURL(0, url, disposition));\n }\n break;\n default:\n break;\n }\n}\n\nvoid ExternalTabContainer::NavigationStateChanged(const TabContents* source,\n unsigned changed_flags) {\n if (automation_) {\n automation_->Send(\n new AutomationMsg_NavigationStateChanged(0, changed_flags));\n }\n}\n\nvoid ExternalTabContainer::ReplaceContents(TabContents* source, TabContents* new_contents) {\n}\n\nvoid ExternalTabContainer::AddNewContents(TabContents* source,\n TabContents* new_contents,\n WindowOpenDisposition disposition,\n const gfx::Rect& initial_pos,\n bool user_gesture) {\n}\n\nvoid ExternalTabContainer::ActivateContents(TabContents* contents) {\n}\n\nvoid ExternalTabContainer::LoadingStateChanged(TabContents* source) {\n}\n\nvoid ExternalTabContainer::CloseContents(TabContents* source) {\n}\n\nvoid ExternalTabContainer::MoveContents(TabContents* source,\n const gfx::Rect& pos) {\n}\n\nbool ExternalTabContainer::IsPopup(TabContents* source) {\n return false;\n}\n\nvoid ExternalTabContainer::URLStarredChanged(TabContents* source,\n bool starred) {\n}\n\nvoid ExternalTabContainer::UpdateTargetURL(TabContents* source,\n const GURL& url) {\n if (automation_) {\n std::wstring url_string = CA2W(url.spec().c_str());\n automation_->Send(\n new AutomationMsg_UpdateTargetUrl(0, url_string));\n }\n}\n\nvoid ExternalTabContainer::ContentsZoomChange(bool zoom_in) {\n}\n\nvoid ExternalTabContainer::ToolbarSizeChanged(TabContents* source,\n bool finished) {\n}\n\nvoid ExternalTabContainer::ForwardMessageToExternalHost(\n const std::string& receiver, const std::string& message) {\n if(automation_) {\n automation_->Send(\n new AutomationMsg_ForwardMessageToExternalHost(0, receiver, message));\n }\n}\n\nvoid ExternalTabContainer::Observe(NotificationType type,\n const NotificationSource& source,\n const NotificationDetails& details) {\n switch (type.value) {\n case NotificationType::NAV_ENTRY_COMMITTED:\n if (automation_) {\n const NavigationController::LoadCommittedDetails* commit =\n Details<NavigationController::LoadCommittedDetails>(details).ptr();\n\n \/\/ When the previous entry index is invalid, it will be -1, which will\n \/\/ still make the computation come out right (navigating to the 0th\n \/\/ entry will be +1).\n automation_->Send(new AutomationMsg_DidNavigate(\n 0, commit->type,\n commit->previous_entry_index -\n tab_contents_->controller()->GetLastCommittedEntryIndex()));\n }\n break;\n default:\n NOTREACHED();\n }\n}\n\nvoid ExternalTabContainer::GetBounds(gfx::Rect* out,\n bool including_frame) const {\n CRect crect;\n GetWindowRect(&crect);\n *out = gfx::Rect(crect);\n}\n\nvoid ExternalTabContainer::MoveToFront(bool should_activate) {\n}\n\nHWND ExternalTabContainer::GetHWND() const {\n return m_hWnd;\n}\n\nvoid ExternalTabContainer::PaintNow(const gfx::Rect& update_rect) {\n RECT native_update_rect = update_rect.ToRECT();\n RedrawWindow(&native_update_rect,\n NULL,\n RDW_INVALIDATE | RDW_ALLCHILDREN | RDW_NOERASE);\n}\n\nviews::RootView* ExternalTabContainer::GetRootView() {\n return const_cast<views::RootView*>(&root_view_);\n}\n\nbool ExternalTabContainer::IsVisible() {\n return !!::IsWindowVisible(*this);\n}\n\nbool ExternalTabContainer::IsActive() {\n return win_util::IsWindowActive(*this);\n}\n\nbool ExternalTabContainer::ProcessKeyDown(HWND window, UINT message,\n WPARAM wparam, LPARAM lparam) {\n if (!automation_) {\n return false;\n }\n if ((wparam == VK_TAB) && !win_util::IsCtrlPressed()) {\n \/\/ Tabs are handled separately (except if this is Ctrl-Tab or\n \/\/ Ctrl-Shift-Tab)\n return false;\n }\n int flags = HIWORD(lparam);\n if ((flags & KF_EXTENDED) || (flags & KF_ALTDOWN) ||\n (wparam >= VK_F1 && wparam <= VK_F24) ||\n win_util::IsShiftPressed() || win_util::IsCtrlPressed()) {\n \/\/ If this is an extended key or if one or more of Alt, Shift and Control\n \/\/ are pressed, this might be an accelerator that the external host wants\n \/\/ to handle. If the host does not handle this accelerator, it will reflect\n \/\/ the accelerator back to us via the ProcessUnhandledAccelerator method.\n MSG msg = {0};\n msg.hwnd = window;\n msg.message = message;\n msg.wParam = wparam;\n msg.lParam = lparam;\n automation_->Send(new AutomationMsg_HandleAccelerator(0, msg));\n return true;\n }\n return false;\n}\n\nvoid ExternalTabContainer::SetAccelerators(HACCEL accel_table,\n int accel_table_entry_count) {\n external_accel_table_ = accel_table;\n external_accel_entry_count_ = accel_table_entry_count;\n}\n\nvoid ExternalTabContainer::ProcessUnhandledAccelerator(const MSG& msg) {\n \/\/ We just received an accelerator key that we had sent to external host\n \/\/ back. Since the external host was not interested in handling this, we\n \/\/ need to dispatch this message as if we had just peeked this out. (we\n \/\/ also need to call TranslateMessage to generate a WM_CHAR if needed).\n TranslateMessage(&msg);\n DispatchMessage(&msg);\n}\n\nvoid ExternalTabContainer::SetInitialFocus(bool reverse) {\n DCHECK(tab_contents_);\n if (tab_contents_) {\n tab_contents_->SetInitialFocus(reverse);\n }\n}\n\n\/\/ static\nbool ExternalTabContainer::IsExternalTabContainer(HWND window) {\n std::wstring class_name = win_util::GetClassName(window);\n return _wcsicmp(class_name.c_str(), chrome::kExternalTabWindowClass) == 0;\n}\n\n\/\/ static\nExternalTabContainer* ExternalTabContainer::GetContainerForTab(\n HWND tab_window) {\n HWND parent_window = ::GetParent(tab_window);\n if (!::IsWindow(parent_window)) {\n return NULL;\n }\n if (!IsExternalTabContainer(parent_window)) {\n return NULL;\n }\n ExternalTabContainer* container = reinterpret_cast<ExternalTabContainer*>(\n GetProp(parent_window, kWindowObjectKey));\n return container;\n}\n<commit_msg>Fixing reverse tabbing.<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\/external_tab_container.h\"\n\n#include \"base\/logging.h\"\n#include \"base\/win_util.h\"\n#include \"chrome\/browser\/automation\/automation_provider.h\"\n#include \"chrome\/browser\/profile.h\"\n#include \"chrome\/browser\/tab_contents\/tab_contents.h\"\n#include \"chrome\/browser\/views\/tab_contents_container_view.h\"\n#include \"chrome\/browser\/tab_contents\/web_contents.h\"\n#include \"chrome\/common\/chrome_constants.h\"\n#include \"chrome\/common\/win_util.h\"\n\/\/ Included for SetRootViewForHWND.\n#include \"chrome\/views\/widget_win.h\"\n#include \"chrome\/test\/automation\/automation_messages.h\"\n\nstatic const wchar_t kWindowObjectKey[] = L\"ChromeWindowObject\";\n\n\/\/ TODO(sanjeevr): The external_accel_table_ and external_accel_entry_count_\n\/\/ member variables are now obsolete and we don't use them.\n\/\/ We need to remove them.\nExternalTabContainer::ExternalTabContainer(\n AutomationProvider* automation)\n : automation_(automation),\n root_view_(this),\n tab_contents_(NULL),\n external_accel_table_(NULL),\n external_accel_entry_count_(0),\n tab_contents_container_(NULL) {\n}\n\nExternalTabContainer::~ExternalTabContainer() {\n}\n\nbool ExternalTabContainer::Init(Profile* profile, HWND parent,\n const gfx::Rect& dimensions,\n unsigned int style) {\n if (IsWindow()) {\n NOTREACHED();\n return false;\n }\n \/\/ First create the container window\n if (!Create(NULL, dimensions.ToRECT())) {\n NOTREACHED();\n return false;\n }\n\n \/\/ We don't ever remove the prop because the lifetime of this object\n \/\/ is the same as the lifetime of the window\n SetProp(*this, kWindowObjectKey, this);\n\n views::SetRootViewForHWND(m_hWnd, &root_view_);\n \/\/ CreateFocusManager will subclass this window and delete the FocusManager\n \/\/ instance when this window goes away.\n views::FocusManager* focus_manager =\n views::FocusManager::CreateFocusManager(m_hWnd, GetRootView());\n DCHECK(focus_manager);\n focus_manager->AddKeystrokeListener(this);\n tab_contents_ = TabContents::CreateWithType(TAB_CONTENTS_WEB, profile, NULL);\n if (!tab_contents_) {\n NOTREACHED();\n DestroyWindow();\n return false;\n }\n tab_contents_->SetupController(profile);\n tab_contents_->set_delegate(this);\n\n WebContents* web_conents = tab_contents_->AsWebContents();\n if (web_conents)\n web_conents->render_view_host()->AllowExternalHostBindings();\n\n \/\/ Create a TabContentsContainerView to handle focus cycling using Tab and\n \/\/ Shift-Tab.\n tab_contents_container_ = new TabContentsContainerView();\n root_view_.AddChildView(tab_contents_container_);\n \/\/ Note that SetTabContents must be called after AddChildView is called\n tab_contents_container_->SetTabContents(tab_contents_);\n \/\/ Add a dummy view to catch when the user tabs out of the tab\n \/\/ Create a dummy FocusTraversable object to represent the frame of the\n \/\/ external host. This will allow Tab and Shift-Tab to cycle into the\n \/\/ external frame. When the tab_contents_container_ loses focus,\n \/\/ the focus will be moved to this class (See OnSetFocus in this file).\n \/\/ An alternative to using views::View and catching when the focus manager\n \/\/ shifts the focus to the dummy view could be to implement our own view\n \/\/ and handle AboutToRequestFocusFromTabTraversal.\n views::View* dummy = new views::View();\n dummy->SetFocusable(true);\n DCHECK(dummy->IsFocusable());\n root_view_.AddChildView(dummy);\n\n NavigationController* controller = tab_contents_->controller();\n DCHECK(controller);\n registrar_.Add(this, NotificationType::NAV_ENTRY_COMMITTED,\n Source<NavigationController>(controller));\n NotificationService::current()->Notify(\n NotificationType::EXTERNAL_TAB_CREATED,\n Source<NavigationController>(controller),\n NotificationService::NoDetails());\n\n \/\/ Now apply the parenting and style\n if (parent)\n SetParent(parent);\n\n \/\/ We need WS_POPUP to be on the window during initialization, but\n \/\/ once initialized and parent-ed, we apply the requested style which\n \/\/ may or may not include the popup bit.\n ModifyStyle(WS_POPUP, style, 0);\n\n ::ShowWindow(tab_contents_->GetNativeView(), SW_SHOW);\n return true;\n}\n\nvoid ExternalTabContainer::OnDestroy() {\n views::FocusManager* focus_manager =\n views::FocusManager::GetFocusManager(GetHWND());\n if (focus_manager) {\n focus_manager->RemoveKeystrokeListener(this);\n }\n root_view_.RemoveAllChildViews(true);\n if (tab_contents_) {\n NavigationController* controller = tab_contents_->controller();\n DCHECK(controller);\n\n NotificationService::current()->Notify(\n NotificationType::EXTERNAL_TAB_CLOSED,\n Source<NavigationController>(controller),\n Details<ExternalTabContainer>(this));\n tab_contents_->set_delegate(NULL);\n tab_contents_->CloseContents();\n \/\/ WARNING: tab_contents_ has likely been deleted.\n tab_contents_ = NULL;\n }\n}\n\nvoid ExternalTabContainer::OnFinalMessage(HWND window) {\n delete this;\n}\n\nLRESULT ExternalTabContainer::OnSize(UINT, WPARAM, LPARAM, BOOL& handled) {\n if (tab_contents_) {\n RECT client_rect = {0};\n GetClientRect(&client_rect);\n ::SetWindowPos(tab_contents_->GetNativeView(), NULL, client_rect.left,\n client_rect.top, client_rect.right - client_rect.left,\n client_rect.bottom - client_rect.top, SWP_NOZORDER);\n }\n return 0;\n}\n\nLRESULT ExternalTabContainer::OnSetFocus(UINT msg, WPARAM wp, LPARAM lp,\n BOOL& handled) {\n if (automation_) {\n views::FocusManager* focus_manager =\n views::FocusManager::GetFocusManager(GetHWND());\n DCHECK(focus_manager);\n if (focus_manager) {\n focus_manager->ClearFocus();\n automation_->Send(new AutomationMsg_TabbedOut(0,\n win_util::IsShiftPressed()));\n }\n }\n\n return 0;\n}\n\nvoid ExternalTabContainer::OpenURLFromTab(TabContents* source,\n const GURL& url,\n const GURL& referrer,\n WindowOpenDisposition disposition,\n PageTransition::Type transition) {\n switch (disposition) {\n case CURRENT_TAB:\n case NEW_FOREGROUND_TAB:\n case NEW_BACKGROUND_TAB:\n case NEW_WINDOW:\n if (automation_) {\n automation_->Send(new AutomationMsg_OpenURL(0, url, disposition));\n }\n break;\n default:\n break;\n }\n}\n\nvoid ExternalTabContainer::NavigationStateChanged(const TabContents* source,\n unsigned changed_flags) {\n if (automation_) {\n automation_->Send(\n new AutomationMsg_NavigationStateChanged(0, changed_flags));\n }\n}\n\nvoid ExternalTabContainer::ReplaceContents(TabContents* source, TabContents* new_contents) {\n}\n\nvoid ExternalTabContainer::AddNewContents(TabContents* source,\n TabContents* new_contents,\n WindowOpenDisposition disposition,\n const gfx::Rect& initial_pos,\n bool user_gesture) {\n}\n\nvoid ExternalTabContainer::ActivateContents(TabContents* contents) {\n}\n\nvoid ExternalTabContainer::LoadingStateChanged(TabContents* source) {\n}\n\nvoid ExternalTabContainer::CloseContents(TabContents* source) {\n}\n\nvoid ExternalTabContainer::MoveContents(TabContents* source,\n const gfx::Rect& pos) {\n}\n\nbool ExternalTabContainer::IsPopup(TabContents* source) {\n return false;\n}\n\nvoid ExternalTabContainer::URLStarredChanged(TabContents* source,\n bool starred) {\n}\n\nvoid ExternalTabContainer::UpdateTargetURL(TabContents* source,\n const GURL& url) {\n if (automation_) {\n std::wstring url_string = CA2W(url.spec().c_str());\n automation_->Send(\n new AutomationMsg_UpdateTargetUrl(0, url_string));\n }\n}\n\nvoid ExternalTabContainer::ContentsZoomChange(bool zoom_in) {\n}\n\nvoid ExternalTabContainer::ToolbarSizeChanged(TabContents* source,\n bool finished) {\n}\n\nvoid ExternalTabContainer::ForwardMessageToExternalHost(\n const std::string& receiver, const std::string& message) {\n if(automation_) {\n automation_->Send(\n new AutomationMsg_ForwardMessageToExternalHost(0, receiver, message));\n }\n}\n\nvoid ExternalTabContainer::Observe(NotificationType type,\n const NotificationSource& source,\n const NotificationDetails& details) {\n switch (type.value) {\n case NotificationType::NAV_ENTRY_COMMITTED:\n if (automation_) {\n const NavigationController::LoadCommittedDetails* commit =\n Details<NavigationController::LoadCommittedDetails>(details).ptr();\n\n \/\/ When the previous entry index is invalid, it will be -1, which will\n \/\/ still make the computation come out right (navigating to the 0th\n \/\/ entry will be +1).\n automation_->Send(new AutomationMsg_DidNavigate(\n 0, commit->type,\n commit->previous_entry_index -\n tab_contents_->controller()->GetLastCommittedEntryIndex()));\n }\n break;\n default:\n NOTREACHED();\n }\n}\n\nvoid ExternalTabContainer::GetBounds(gfx::Rect* out,\n bool including_frame) const {\n CRect crect;\n GetWindowRect(&crect);\n *out = gfx::Rect(crect);\n}\n\nvoid ExternalTabContainer::MoveToFront(bool should_activate) {\n}\n\nHWND ExternalTabContainer::GetHWND() const {\n return m_hWnd;\n}\n\nvoid ExternalTabContainer::PaintNow(const gfx::Rect& update_rect) {\n RECT native_update_rect = update_rect.ToRECT();\n RedrawWindow(&native_update_rect,\n NULL,\n RDW_INVALIDATE | RDW_ALLCHILDREN | RDW_NOERASE);\n}\n\nviews::RootView* ExternalTabContainer::GetRootView() {\n return const_cast<views::RootView*>(&root_view_);\n}\n\nbool ExternalTabContainer::IsVisible() {\n return !!::IsWindowVisible(*this);\n}\n\nbool ExternalTabContainer::IsActive() {\n return win_util::IsWindowActive(*this);\n}\n\nbool ExternalTabContainer::ProcessKeyDown(HWND window, UINT message,\n WPARAM wparam, LPARAM lparam) {\n if (!automation_) {\n return false;\n }\n if ((wparam == VK_TAB) && !win_util::IsCtrlPressed()) {\n \/\/ Tabs are handled separately (except if this is Ctrl-Tab or\n \/\/ Ctrl-Shift-Tab)\n return false;\n }\n int flags = HIWORD(lparam);\n if ((flags & KF_EXTENDED) || (flags & KF_ALTDOWN) ||\n (wparam >= VK_F1 && wparam <= VK_F24) ||\n win_util::IsShiftPressed() || win_util::IsCtrlPressed()) {\n \/\/ If this is an extended key or if one or more of Alt, Shift and Control\n \/\/ are pressed, this might be an accelerator that the external host wants\n \/\/ to handle. If the host does not handle this accelerator, it will reflect\n \/\/ the accelerator back to us via the ProcessUnhandledAccelerator method.\n MSG msg = {0};\n msg.hwnd = window;\n msg.message = message;\n msg.wParam = wparam;\n msg.lParam = lparam;\n automation_->Send(new AutomationMsg_HandleAccelerator(0, msg));\n return true;\n }\n return false;\n}\n\nvoid ExternalTabContainer::SetAccelerators(HACCEL accel_table,\n int accel_table_entry_count) {\n external_accel_table_ = accel_table;\n external_accel_entry_count_ = accel_table_entry_count;\n}\n\nvoid ExternalTabContainer::ProcessUnhandledAccelerator(const MSG& msg) {\n \/\/ We just received an accelerator key that we had sent to external host\n \/\/ back. Since the external host was not interested in handling this, we\n \/\/ need to dispatch this message as if we had just peeked this out. (we\n \/\/ also need to call TranslateMessage to generate a WM_CHAR if needed).\n TranslateMessage(&msg);\n DispatchMessage(&msg);\n}\n\nvoid ExternalTabContainer::SetInitialFocus(bool reverse) {\n DCHECK(tab_contents_);\n if (tab_contents_) {\n tab_contents_->SetInitialFocus(reverse);\n }\n}\n\n\/\/ static\nbool ExternalTabContainer::IsExternalTabContainer(HWND window) {\n std::wstring class_name = win_util::GetClassName(window);\n return _wcsicmp(class_name.c_str(), chrome::kExternalTabWindowClass) == 0;\n}\n\n\/\/ static\nExternalTabContainer* ExternalTabContainer::GetContainerForTab(\n HWND tab_window) {\n HWND parent_window = ::GetParent(tab_window);\n if (!::IsWindow(parent_window)) {\n return NULL;\n }\n if (!IsExternalTabContainer(parent_window)) {\n return NULL;\n }\n ExternalTabContainer* container = reinterpret_cast<ExternalTabContainer*>(\n GetProp(parent_window, kWindowObjectKey));\n return container;\n}\n<|endoftext|>"} {"text":"<commit_before>\/\/ Copyright (c) 2009 The Chromium Authors. All rights reserved.\n\/\/ Use of this source code is governed by a BSD-style license that can be\n\/\/ found in the LICENSE file.\n\n#include \"chrome\/browser\/gtk\/bookmark_utils_gtk.h\"\n\n#include \"app\/resource_bundle.h\"\n#include \"base\/gfx\/gtk_util.h\"\n#include \"base\/pickle.h\"\n#include \"base\/string_util.h\"\n#include \"chrome\/browser\/bookmarks\/bookmark_drag_data.h\"\n#include \"chrome\/browser\/bookmarks\/bookmark_model.h\"\n#include \"chrome\/browser\/gtk\/gtk_chrome_button.h\"\n#include \"chrome\/browser\/gtk\/gtk_dnd_util.h\"\n#include \"chrome\/browser\/profile.h\"\n#include \"grit\/app_resources.h\"\n#include \"grit\/generated_resources.h\"\n#include \"grit\/theme_resources.h\"\n\nnamespace {\n\n\/\/ Used in gtk_selection_data_set(). (I assume from this parameter that gtk has\n\/\/ to some really exotic hardware...)\nconst int kBitsInAByte = 8;\n\n\/\/ Maximum number of characters on a bookmark button.\nconst size_t kMaxCharsOnAButton = 15;\n\n\/\/ Only used for the background of the drag widget.\nconst GdkColor kBackgroundColor = GDK_COLOR_RGB(0xe6, 0xed, 0xf4);\n\n\/\/ Color of the button text, taken from TextButtonView.\nconst GdkColor kEnabledColor = GDK_COLOR_RGB(6, 45, 117);\nconst GdkColor kDisabledColor = GDK_COLOR_RGB(161, 161, 146);\n\/\/ TextButtonView uses 255, 255, 255 with opacity of 200. We don't support\n\/\/ transparent text though, so just use a slightly lighter version of\n\/\/ kEnabledColor.\nconst GdkColor kHighlightColor = GDK_COLOR_RGB(56, 95, 167);\n\nvoid* AsVoid(const BookmarkNode* node) {\n return const_cast<BookmarkNode*>(node);\n}\n\n} \/\/ namespace\n\nnamespace bookmark_utils {\n\nconst char kBookmarkNode[] = \"bookmark-node\";\n\nconst int kBarButtonPadding = 2;\n\nGdkPixbuf* GetFolderIcon() {\n ResourceBundle& rb = ResourceBundle::GetSharedInstance();\n static GdkPixbuf* default_folder_icon = rb.GetPixbufNamed(\n IDR_BOOKMARK_BAR_FOLDER);\n return default_folder_icon;\n}\n\nGdkPixbuf* GetDefaultFavicon() {\n ResourceBundle& rb = ResourceBundle::GetSharedInstance();\n static GdkPixbuf* default_bookmark_icon = rb.GetPixbufNamed(\n IDR_DEFAULT_FAVICON);\n return default_bookmark_icon;\n}\n\nGdkPixbuf* GetPixbufForNode(const BookmarkNode* node, BookmarkModel* model) {\n GdkPixbuf* pixbuf;\n\n if (node->is_url()) {\n if (model->GetFavIcon(node).width() != 0) {\n pixbuf = gfx::GdkPixbufFromSkBitmap(&model->GetFavIcon(node));\n } else {\n pixbuf = GetDefaultFavicon();\n g_object_ref(pixbuf);\n }\n } else {\n pixbuf = GetFolderIcon();\n g_object_ref(pixbuf);\n }\n\n return pixbuf;\n}\n\nGtkWidget* GetDragRepresentation(const BookmarkNode* node,\n BookmarkModel* model) {\n \/\/ Build a windowed representation for our button.\n GtkWidget* window = gtk_window_new(GTK_WINDOW_POPUP);\n gtk_widget_modify_bg(window, GTK_STATE_NORMAL, &kBackgroundColor);\n gtk_widget_realize(window);\n\n GtkWidget* frame = gtk_frame_new(NULL);\n gtk_frame_set_shadow_type(GTK_FRAME(frame), GTK_SHADOW_OUT);\n gtk_container_add(GTK_CONTAINER(window), frame);\n gtk_widget_show(frame);\n\n GtkWidget* floating_button = gtk_chrome_button_new();\n bookmark_utils::ConfigureButtonForNode(node, model, floating_button);\n gtk_container_add(GTK_CONTAINER(frame), floating_button);\n gtk_widget_show(floating_button);\n\n return window;\n}\n\nvoid ConfigureButtonForNode(const BookmarkNode* node, BookmarkModel* model,\n GtkWidget* button) {\n GtkWidget* former_child = gtk_bin_get_child(GTK_BIN(button));\n if (former_child)\n gtk_container_remove(GTK_CONTAINER(button), former_child);\n\n std::string tooltip = BuildTooltipFor(node);\n if (!tooltip.empty())\n gtk_widget_set_tooltip_text(button, tooltip.c_str());\n\n \/\/ We pack the button manually (rather than using gtk_button_set_*) so that\n \/\/ we can have finer control over its label.\n GdkPixbuf* pixbuf = bookmark_utils::GetPixbufForNode(node, model);\n GtkWidget* image = gtk_image_new_from_pixbuf(pixbuf);\n g_object_unref(pixbuf);\n\n GtkWidget* label = gtk_label_new(WideToUTF8(node->GetTitle()).c_str());\n gtk_label_set_max_width_chars(GTK_LABEL(label), kMaxCharsOnAButton);\n gtk_label_set_ellipsize(GTK_LABEL(label), PANGO_ELLIPSIZE_END);\n\n GtkWidget* box = gtk_hbox_new(FALSE, kBarButtonPadding);\n gtk_box_pack_start(GTK_BOX(box), image, FALSE, FALSE, 0);\n gtk_box_pack_start(GTK_BOX(box), label, FALSE, FALSE, 0);\n gtk_container_add(GTK_CONTAINER(button), box);\n\n SetButtonTextColors(label);\n g_object_set_data(G_OBJECT(button), bookmark_utils::kBookmarkNode,\n AsVoid(node));\n}\n\nstd::string BuildTooltipFor(const BookmarkNode* node) {\n \/\/ TODO(erg): Actually build the tooltip. For now, we punt and just return\n \/\/ the URL.\n return node->GetURL().possibly_invalid_spec();\n}\n\nconst BookmarkNode* BookmarkNodeForWidget(GtkWidget* widget) {\n return reinterpret_cast<const BookmarkNode*>(\n g_object_get_data(G_OBJECT(widget), bookmark_utils::kBookmarkNode));\n}\n\nvoid SetButtonTextColors(GtkWidget* label) {\n gtk_widget_modify_fg(label, GTK_STATE_NORMAL, &kEnabledColor);\n gtk_widget_modify_fg(label, GTK_STATE_ACTIVE, &kEnabledColor);\n gtk_widget_modify_fg(label, GTK_STATE_PRELIGHT, &kHighlightColor);\n gtk_widget_modify_fg(label, GTK_STATE_INSENSITIVE, &kDisabledColor);\n}\n\n\/\/ DnD-related -----------------------------------------------------------------\n\nvoid WriteBookmarkToSelection(const BookmarkNode* node,\n GtkSelectionData* selection_data,\n guint target_type,\n Profile* profile) {\n DCHECK(node);\n std::vector<const BookmarkNode*> nodes;\n nodes.push_back(node);\n WriteBookmarksToSelection(nodes, selection_data, target_type, profile);\n}\n\nvoid WriteBookmarksToSelection(const std::vector<const BookmarkNode*>& nodes,\n GtkSelectionData* selection_data,\n guint target_type,\n Profile* profile) {\n switch (target_type) {\n case GtkDndUtil::X_CHROME_BOOKMARK_ITEM: {\n BookmarkDragData data(nodes);\n Pickle pickle;\n data.WriteToPickle(profile, &pickle);\n\n gtk_selection_data_set(selection_data, selection_data->target,\n kBitsInAByte,\n static_cast<const guchar*>(pickle.data()),\n pickle.size());\n break;\n }\n default: {\n DLOG(ERROR) << \"Unsupported drag get type!\";\n }\n }\n}\n\nstd::vector<const BookmarkNode*> GetNodesFromSelection(\n GdkDragContext* context,\n GtkSelectionData* selection_data,\n guint target_type,\n Profile* profile,\n gboolean* delete_selection_data,\n gboolean* dnd_success) {\n *delete_selection_data = FALSE;\n *dnd_success = FALSE;\n\n if ((selection_data != NULL) && (selection_data->length >= 0)) {\n if (context->action == GDK_ACTION_MOVE) {\n *delete_selection_data = TRUE;\n }\n\n switch (target_type) {\n case GtkDndUtil::X_CHROME_BOOKMARK_ITEM: {\n *dnd_success = TRUE;\n Pickle pickle(reinterpret_cast<char*>(selection_data->data),\n selection_data->length);\n BookmarkDragData drag_data;\n drag_data.ReadFromPickle(&pickle);\n return drag_data.GetNodes(profile);\n }\n default: {\n DLOG(ERROR) << \"Unsupported drag received type: \" << target_type;\n }\n }\n }\n\n return std::vector<const BookmarkNode*>();\n}\n\n} \/\/ namespace bookmark_utils\n<commit_msg>Re-show bookmark bar buttons whenever they're configured.<commit_after>\/\/ Copyright (c) 2009 The Chromium Authors. All rights reserved.\n\/\/ Use of this source code is governed by a BSD-style license that can be\n\/\/ found in the LICENSE file.\n\n#include \"chrome\/browser\/gtk\/bookmark_utils_gtk.h\"\n\n#include \"app\/resource_bundle.h\"\n#include \"base\/gfx\/gtk_util.h\"\n#include \"base\/pickle.h\"\n#include \"base\/string_util.h\"\n#include \"chrome\/browser\/bookmarks\/bookmark_drag_data.h\"\n#include \"chrome\/browser\/bookmarks\/bookmark_model.h\"\n#include \"chrome\/browser\/gtk\/gtk_chrome_button.h\"\n#include \"chrome\/browser\/gtk\/gtk_dnd_util.h\"\n#include \"chrome\/browser\/profile.h\"\n#include \"grit\/app_resources.h\"\n#include \"grit\/generated_resources.h\"\n#include \"grit\/theme_resources.h\"\n\nnamespace {\n\n\/\/ Used in gtk_selection_data_set(). (I assume from this parameter that gtk has\n\/\/ to some really exotic hardware...)\nconst int kBitsInAByte = 8;\n\n\/\/ Maximum number of characters on a bookmark button.\nconst size_t kMaxCharsOnAButton = 15;\n\n\/\/ Only used for the background of the drag widget.\nconst GdkColor kBackgroundColor = GDK_COLOR_RGB(0xe6, 0xed, 0xf4);\n\n\/\/ Color of the button text, taken from TextButtonView.\nconst GdkColor kEnabledColor = GDK_COLOR_RGB(6, 45, 117);\nconst GdkColor kDisabledColor = GDK_COLOR_RGB(161, 161, 146);\n\/\/ TextButtonView uses 255, 255, 255 with opacity of 200. We don't support\n\/\/ transparent text though, so just use a slightly lighter version of\n\/\/ kEnabledColor.\nconst GdkColor kHighlightColor = GDK_COLOR_RGB(56, 95, 167);\n\nvoid* AsVoid(const BookmarkNode* node) {\n return const_cast<BookmarkNode*>(node);\n}\n\n} \/\/ namespace\n\nnamespace bookmark_utils {\n\nconst char kBookmarkNode[] = \"bookmark-node\";\n\nconst int kBarButtonPadding = 2;\n\nGdkPixbuf* GetFolderIcon() {\n ResourceBundle& rb = ResourceBundle::GetSharedInstance();\n static GdkPixbuf* default_folder_icon = rb.GetPixbufNamed(\n IDR_BOOKMARK_BAR_FOLDER);\n return default_folder_icon;\n}\n\nGdkPixbuf* GetDefaultFavicon() {\n ResourceBundle& rb = ResourceBundle::GetSharedInstance();\n static GdkPixbuf* default_bookmark_icon = rb.GetPixbufNamed(\n IDR_DEFAULT_FAVICON);\n return default_bookmark_icon;\n}\n\nGdkPixbuf* GetPixbufForNode(const BookmarkNode* node, BookmarkModel* model) {\n GdkPixbuf* pixbuf;\n\n if (node->is_url()) {\n if (model->GetFavIcon(node).width() != 0) {\n pixbuf = gfx::GdkPixbufFromSkBitmap(&model->GetFavIcon(node));\n } else {\n pixbuf = GetDefaultFavicon();\n g_object_ref(pixbuf);\n }\n } else {\n pixbuf = GetFolderIcon();\n g_object_ref(pixbuf);\n }\n\n return pixbuf;\n}\n\nGtkWidget* GetDragRepresentation(const BookmarkNode* node,\n BookmarkModel* model) {\n \/\/ Build a windowed representation for our button.\n GtkWidget* window = gtk_window_new(GTK_WINDOW_POPUP);\n gtk_widget_modify_bg(window, GTK_STATE_NORMAL, &kBackgroundColor);\n gtk_widget_realize(window);\n\n GtkWidget* frame = gtk_frame_new(NULL);\n gtk_frame_set_shadow_type(GTK_FRAME(frame), GTK_SHADOW_OUT);\n gtk_container_add(GTK_CONTAINER(window), frame);\n gtk_widget_show(frame);\n\n GtkWidget* floating_button = gtk_chrome_button_new();\n bookmark_utils::ConfigureButtonForNode(node, model, floating_button);\n gtk_container_add(GTK_CONTAINER(frame), floating_button);\n gtk_widget_show(floating_button);\n\n return window;\n}\n\nvoid ConfigureButtonForNode(const BookmarkNode* node, BookmarkModel* model,\n GtkWidget* button) {\n GtkWidget* former_child = gtk_bin_get_child(GTK_BIN(button));\n if (former_child)\n gtk_container_remove(GTK_CONTAINER(button), former_child);\n\n std::string tooltip = BuildTooltipFor(node);\n if (!tooltip.empty())\n gtk_widget_set_tooltip_text(button, tooltip.c_str());\n\n \/\/ We pack the button manually (rather than using gtk_button_set_*) so that\n \/\/ we can have finer control over its label.\n GdkPixbuf* pixbuf = bookmark_utils::GetPixbufForNode(node, model);\n GtkWidget* image = gtk_image_new_from_pixbuf(pixbuf);\n g_object_unref(pixbuf);\n\n GtkWidget* label = gtk_label_new(WideToUTF8(node->GetTitle()).c_str());\n gtk_label_set_max_width_chars(GTK_LABEL(label), kMaxCharsOnAButton);\n gtk_label_set_ellipsize(GTK_LABEL(label), PANGO_ELLIPSIZE_END);\n\n GtkWidget* box = gtk_hbox_new(FALSE, kBarButtonPadding);\n gtk_box_pack_start(GTK_BOX(box), image, FALSE, FALSE, 0);\n gtk_box_pack_start(GTK_BOX(box), label, FALSE, FALSE, 0);\n gtk_container_add(GTK_CONTAINER(button), box);\n\n SetButtonTextColors(label);\n g_object_set_data(G_OBJECT(button), bookmark_utils::kBookmarkNode,\n AsVoid(node));\n\n gtk_widget_show_all(box);\n}\n\nstd::string BuildTooltipFor(const BookmarkNode* node) {\n \/\/ TODO(erg): Actually build the tooltip. For now, we punt and just return\n \/\/ the URL.\n return node->GetURL().possibly_invalid_spec();\n}\n\nconst BookmarkNode* BookmarkNodeForWidget(GtkWidget* widget) {\n return reinterpret_cast<const BookmarkNode*>(\n g_object_get_data(G_OBJECT(widget), bookmark_utils::kBookmarkNode));\n}\n\nvoid SetButtonTextColors(GtkWidget* label) {\n gtk_widget_modify_fg(label, GTK_STATE_NORMAL, &kEnabledColor);\n gtk_widget_modify_fg(label, GTK_STATE_ACTIVE, &kEnabledColor);\n gtk_widget_modify_fg(label, GTK_STATE_PRELIGHT, &kHighlightColor);\n gtk_widget_modify_fg(label, GTK_STATE_INSENSITIVE, &kDisabledColor);\n}\n\n\/\/ DnD-related -----------------------------------------------------------------\n\nvoid WriteBookmarkToSelection(const BookmarkNode* node,\n GtkSelectionData* selection_data,\n guint target_type,\n Profile* profile) {\n DCHECK(node);\n std::vector<const BookmarkNode*> nodes;\n nodes.push_back(node);\n WriteBookmarksToSelection(nodes, selection_data, target_type, profile);\n}\n\nvoid WriteBookmarksToSelection(const std::vector<const BookmarkNode*>& nodes,\n GtkSelectionData* selection_data,\n guint target_type,\n Profile* profile) {\n switch (target_type) {\n case GtkDndUtil::X_CHROME_BOOKMARK_ITEM: {\n BookmarkDragData data(nodes);\n Pickle pickle;\n data.WriteToPickle(profile, &pickle);\n\n gtk_selection_data_set(selection_data, selection_data->target,\n kBitsInAByte,\n static_cast<const guchar*>(pickle.data()),\n pickle.size());\n break;\n }\n default: {\n DLOG(ERROR) << \"Unsupported drag get type!\";\n }\n }\n}\n\nstd::vector<const BookmarkNode*> GetNodesFromSelection(\n GdkDragContext* context,\n GtkSelectionData* selection_data,\n guint target_type,\n Profile* profile,\n gboolean* delete_selection_data,\n gboolean* dnd_success) {\n *delete_selection_data = FALSE;\n *dnd_success = FALSE;\n\n if ((selection_data != NULL) && (selection_data->length >= 0)) {\n if (context->action == GDK_ACTION_MOVE) {\n *delete_selection_data = TRUE;\n }\n\n switch (target_type) {\n case GtkDndUtil::X_CHROME_BOOKMARK_ITEM: {\n *dnd_success = TRUE;\n Pickle pickle(reinterpret_cast<char*>(selection_data->data),\n selection_data->length);\n BookmarkDragData drag_data;\n drag_data.ReadFromPickle(&pickle);\n return drag_data.GetNodes(profile);\n }\n default: {\n DLOG(ERROR) << \"Unsupported drag received type: \" << target_type;\n }\n }\n }\n\n return std::vector<const BookmarkNode*>();\n}\n\n} \/\/ namespace bookmark_utils\n<|endoftext|>"} {"text":"<commit_before>\/*=========================================================================\n\n Library: CTK\n \n Copyright (c) 2010 Kitware Inc.\n\n Licensed under the Apache License, Version 2.0 (the \"License\");\n you may not use this file except in compliance with the License.\n You may obtain a copy of the License at\n\n http:\/\/www.commontk.org\/LICENSE\n\n Unless required by applicable law or agreed to in writing, software\n distributed under the License is distributed on an \"AS IS\" BASIS,\n WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n See the License for the specific language governing permissions and\n limitations under the License.\n \n=========================================================================*\/\n\n#include \"dcmtk\/config\/osconfig.h\" \/* make sure OS specific configuration is included first *\/\n#include \"dcmtk\/dcmnet\/scu.h\"\n\n\/\/ STD includes\n#include <cstdlib>\n#include <iostream>\n#include <fstream>\n\nvoid print_usage()\n{\n std::cerr << \"Usage: \\n\";\n std::cerr << \" ctkDICOMDemoSCU peer port [peerAETitle]\\n\";\n std::cerr << \" Issues ECHO request to the given host and given port.\\n\"; \n std::cerr << \" Optional peerAETitle tells what application entity to address.\\n\"; \n return;\n}\n\nint main(int argc, char** argv)\n{\n \/\/ Check whether host and port are given\n if (argc < 3)\n {\n print_usage();\n return 2;\n } \n \n std::string host = argv[1];\n unsigned int port = atoi(argv[2]);\n std::string peerAET = \"\";\n if (argc > 3)\n {\n peerAET = argv[3];\n }\n \n \/\/ Setup SCU\n DcmSCU scu;\n scu.setPeerHostName(host);\n scu.setPeerPort(port);\n OFString verificationSOP = UID_VerificationSOPClass;\n OFList<OFString> ts;\n ts.push_back(UID_LittleEndianExplicitTransferSyntax);\n ts.push_back(UID_BigEndianExplicitTransferSyntax); \n ts.push_back(UID_LittleEndianImplicitTransferSyntax);\n scu.addPresentationContext(verificationSOP, ts);\n if (peerAET != \"\")\n {\n scu.setPeerAETitle(peerAET);\n }\n OFCondition result = scu.initNetwork();\n if (result.bad())\n {\n std::cerr << \"Error setting up SCU: \" << result.text() << \"\\n\";\n return 2;\n }\n \n \/\/ Negotiate association\n result = scu.negotiateAssociation();\n if (result.bad())\n {\n std::cerr << \"Error negotiating association: \" << result.text() << \"\\n\";\n return 2;\n }\n \n \/\/ Issue ECHO request and let scu find presentation context itself (0)\n result = scu.sendECHORequest(0);\n if (result.bad())\n { \n std::cerr << \"Error issuing ECHO request or received rejecting response: \" << result.text() << \"\\n\";\n return 2;\n }\n std::cout << \"Successfully sent DICOM Echo to host \" << argv[1] << \" on port \" << argv[2] << \"\\n\";\n return 0;\n \n}\n<commit_msg>Use OString directly instead of std::string<commit_after>\/*=========================================================================\n\n Library: CTK\n \n Copyright (c) 2010 Kitware Inc.\n\n Licensed under the Apache License, Version 2.0 (the \"License\");\n you may not use this file except in compliance with the License.\n You may obtain a copy of the License at\n\n http:\/\/www.commontk.org\/LICENSE\n\n Unless required by applicable law or agreed to in writing, software\n distributed under the License is distributed on an \"AS IS\" BASIS,\n WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n See the License for the specific language governing permissions and\n limitations under the License.\n \n=========================================================================*\/\n\n#include \"dcmtk\/config\/osconfig.h\" \/* make sure OS specific configuration is included first *\/\n#include \"dcmtk\/dcmnet\/scu.h\"\n\n\/\/ STD includes\n#include <cstdlib>\n#include <iostream>\n#include <fstream>\n\nvoid print_usage()\n{\n std::cerr << \"Usage: \\n\";\n std::cerr << \" ctkDICOMDemoSCU peer port [peerAETitle]\\n\";\n std::cerr << \" Issues ECHO request to the given host and given port.\\n\"; \n std::cerr << \" Optional peerAETitle tells what application entity to address.\\n\"; \n return;\n}\n\nint main(int argc, char** argv)\n{\n \/\/ Check whether host and port are given\n if (argc < 3)\n {\n print_usage();\n return 2;\n } \n \n OString host(argv[1]);\n unsigned int port = atoi(argv[2]);\n OString peerAET;\n if (argc > 3)\n {\n peerAET = argv[3];\n }\n \n \/\/ Setup SCU\n DcmSCU scu;\n scu.setPeerHostName(host);\n scu.setPeerPort(port);\n OFString verificationSOP = UID_VerificationSOPClass;\n OFList<OFString> ts;\n ts.push_back(UID_LittleEndianExplicitTransferSyntax);\n ts.push_back(UID_BigEndianExplicitTransferSyntax); \n ts.push_back(UID_LittleEndianImplicitTransferSyntax);\n scu.addPresentationContext(verificationSOP, ts);\n if (peerAET != \"\")\n {\n scu.setPeerAETitle(peerAET);\n }\n OFCondition result = scu.initNetwork();\n if (result.bad())\n {\n std::cerr << \"Error setting up SCU: \" << result.text() << \"\\n\";\n return 2;\n }\n \n \/\/ Negotiate association\n result = scu.negotiateAssociation();\n if (result.bad())\n {\n std::cerr << \"Error negotiating association: \" << result.text() << \"\\n\";\n return 2;\n }\n \n \/\/ Issue ECHO request and let scu find presentation context itself (0)\n result = scu.sendECHORequest(0);\n if (result.bad())\n { \n std::cerr << \"Error issuing ECHO request or received rejecting response: \" << result.text() << \"\\n\";\n return 2;\n }\n std::cout << \"Successfully sent DICOM Echo to host \" << argv[1] << \" on port \" << argv[2] << \"\\n\";\n return 0;\n \n}\n<|endoftext|>"} {"text":"<commit_before>\/\/ Copyright 2013 The Chromium Authors. All rights reserved.\n\/\/ Copyright 2013 Intel Corporation. All rights reserved.\n\/\/ Use of this source code is governed by a BSD-style license that can be\n\/\/ found in the LICENSE file.\n\n#include \"ozone\/wayland\/window.h\"\n\n#include \"ozone\/wayland\/display.h\"\n#include \"ozone\/wayland\/egl\/egl_window.h\"\n#include \"ozone\/wayland\/shell_surface.h\"\n#include \"ozone\/wayland\/surface.h\"\n\n#include \"base\/logging.h\"\n\nnamespace ozonewayland {\n\nWaylandWindow::WaylandWindow(unsigned handle) :\n shell_surface_(NULL),\n handle_(handle),\n window_(NULL),\n type_(None),\n allocation_(gfx::Rect(0, 0, 1, 1))\n{\n}\n\nWaylandWindow::~WaylandWindow() {\n if (window_) {\n delete window_;\n window_ = NULL;\n }\n\n if (shell_surface_)\n {\n delete shell_surface_;\n shell_surface_ = NULL;\n }\n}\n\nvoid WaylandWindow::SetShellType(ShellType type)\n{\n if (type_ == type)\n return;\n\n if (!shell_surface_)\n shell_surface_ = new WaylandShellSurface(this);\n\n type_ = type;\n switch (type_) {\n case TOPLEVEL:\n shell_surface_->UpdateShellSurface(TOPLEVEL);\n break;\n case MENU:\n shell_surface_->UpdateShellSurface(MENU);\n break;\n case FULLSCREEN:\n case TRANSIENT:\n case CUSTOM:\n NOTREACHED() << \"UnSupported Shell Type.\";\n break;\n default:\n break;\n }\n}\n\nvoid WaylandWindow::SetWindowTitle(const string16& title) {\n shell_surface_->SetWindowTitle(title);\n}\n\nvoid WaylandWindow::Maximize()\n{\n NOTIMPLEMENTED();\n}\n\nvoid WaylandWindow::Minimize()\n{\n NOTIMPLEMENTED();\n}\n\nvoid WaylandWindow::Restore()\n{\n NOTIMPLEMENTED();\n}\n\nvoid WaylandWindow::SetFullscreen()\n{\n NOTIMPLEMENTED();\n}\n\nvoid WaylandWindow::RealizeAcceleratedWidget()\n{\n if (!window_)\n window_ = new EGLWindow(shell_surface_->Surface()->wlSurface(),\n allocation_.width(), allocation_.height());\n}\n\nvoid WaylandWindow::HandleSwapBuffers()\n{\n shell_surface_->Surface()->EnsureFrameCallBackDone();\n shell_surface_->Surface()->AddFrameCallBack();\n}\n\nwl_egl_window* WaylandWindow::egl_window() const\n{\n return window_ ? window_->egl_window() : 0;\n}\n\nstruct wl_surface* WaylandWindow::GetSurface() const {\n return shell_surface_ ? shell_surface_->Surface()->wlSurface() : 0;\n}\n\nbool WaylandWindow::SetBounds(const gfx::Rect& new_bounds)\n{\n int width = new_bounds.width();\n int height = new_bounds.height();\n allocation_ = gfx::Rect(allocation_.x(), allocation_.y(), width, height);\n if (!shell_surface_ || !window_)\n return false;\n\n return window_->Resize(shell_surface_->Surface(), width, height);\n}\n\n} \/\/ namespace ozonewayland\n<commit_msg>WaylandWidndow: Remove unecessary switch\/case block<commit_after>\/\/ Copyright 2013 The Chromium Authors. All rights reserved.\n\/\/ Copyright 2013 Intel Corporation. All rights reserved.\n\/\/ Use of this source code is governed by a BSD-style license that can be\n\/\/ found in the LICENSE file.\n\n#include \"ozone\/wayland\/window.h\"\n\n#include \"ozone\/wayland\/display.h\"\n#include \"ozone\/wayland\/egl\/egl_window.h\"\n#include \"ozone\/wayland\/shell_surface.h\"\n#include \"ozone\/wayland\/surface.h\"\n\n#include \"base\/logging.h\"\n\nnamespace ozonewayland {\n\nWaylandWindow::WaylandWindow(unsigned handle) :\n shell_surface_(NULL),\n handle_(handle),\n window_(NULL),\n type_(None),\n allocation_(gfx::Rect(0, 0, 1, 1))\n{\n}\n\nWaylandWindow::~WaylandWindow() {\n if (window_) {\n delete window_;\n window_ = NULL;\n }\n\n if (shell_surface_)\n {\n delete shell_surface_;\n shell_surface_ = NULL;\n }\n}\n\nvoid WaylandWindow::SetShellType(ShellType type)\n{\n if (type_ == type)\n return;\n\n if (!shell_surface_)\n shell_surface_ = new WaylandShellSurface(this);\n\n type_ = type;\n shell_surface_->UpdateShellSurface(type_);\n}\n\nvoid WaylandWindow::SetWindowTitle(const string16& title) {\n shell_surface_->SetWindowTitle(title);\n}\n\nvoid WaylandWindow::Maximize()\n{\n NOTIMPLEMENTED();\n}\n\nvoid WaylandWindow::Minimize()\n{\n NOTIMPLEMENTED();\n}\n\nvoid WaylandWindow::Restore()\n{\n NOTIMPLEMENTED();\n}\n\nvoid WaylandWindow::SetFullscreen()\n{\n NOTIMPLEMENTED();\n}\n\nvoid WaylandWindow::RealizeAcceleratedWidget()\n{\n if (!window_)\n window_ = new EGLWindow(shell_surface_->Surface()->wlSurface(),\n allocation_.width(), allocation_.height());\n}\n\nvoid WaylandWindow::HandleSwapBuffers()\n{\n shell_surface_->Surface()->EnsureFrameCallBackDone();\n shell_surface_->Surface()->AddFrameCallBack();\n}\n\nwl_egl_window* WaylandWindow::egl_window() const\n{\n return window_ ? window_->egl_window() : 0;\n}\n\nstruct wl_surface* WaylandWindow::GetSurface() const {\n return shell_surface_ ? shell_surface_->Surface()->wlSurface() : 0;\n}\n\nbool WaylandWindow::SetBounds(const gfx::Rect& new_bounds)\n{\n int width = new_bounds.width();\n int height = new_bounds.height();\n allocation_ = gfx::Rect(allocation_.x(), allocation_.y(), width, height);\n if (!shell_surface_ || !window_)\n return false;\n\n return window_->Resize(shell_surface_->Surface(), width, height);\n}\n\n} \/\/ namespace ozonewayland\n<|endoftext|>"} {"text":"<commit_before>\/*=========================================================================\n\n Program: OSCAR \n Module: Actor.cc\n Language: C++\n Date: $Date$\n Version: $Revision$\n\nDescription:\n---------------------------------------------------------------------------\nThis file is part of the vis library\n\n- Ken Martin\n\n=========================================================================*\/\n#include <stdlib.h>\n#include <iostream.h>\n#include <math.h>\n\n#include \"Actor.hh\"\n\nvlActor::vlActor()\n{\n this->Mapper = 0;\n this->Property = 0;\n\n this->Origin[0] = 0.0;\n this->Origin[1] = 0.0;\n this->Origin[2] = 0.0;\n\n this->Position[0] = 0.0;\n this->Position[1] = 0.0;\n this->Position[2] = 0.0;\n\n this->Orientation[0] = 0.0;\n this->Orientation[1] = 0.0;\n this->Orientation[2] = 0.0;\n\n this->Scale[0] = 1.0;\n this->Scale[1] = 1.0;\n this->Scale[2] = 1.0;\n\n this->Visibility = 1;\n}\n\nvlActor::~vlActor()\n{\n if ( this->Mapper ) this->Mapper->UnRegister((void *)this);\n}\n\nvoid vlActor::Render(vlRenderer *ren)\n{\n \/* render the property *\/\n this->Property->Render(ren);\n\n \/* send a render to the modeller *\/\n this->Mapper->Render(ren);\n\n}\n \nvoid vlActor::GetCompositeMatrix(float mat[4][4])\n{\n mat[0][0] = 1; mat[0][1] = 0; mat[0][2] = 0; mat[0][3] = 0;\n mat[1][0] = 0; mat[1][1] = 1; mat[1][2] = 0; mat[1][3] = 0;\n mat[2][0] = 0; mat[2][1] = 0; mat[2][2] = 1; mat[2][3] = 0;\n mat[3][0] = 0; mat[3][1] = 0; mat[3][2] = 0; mat[3][3] = 1;\n}\n\nvoid vlActor::SetMapper(vlMapper *m)\n{\n if ( this->Mapper != m )\n {\n if ( this->Mapper ) this->Mapper->UnRegister((void *)this);\n this->Mapper = m;\n this->Mapper->Register((void *)this);\n this->Modified();\n }\n}\n\nvlMapper *vlActor::GetMapper()\n{\n return this->Mapper;\n}\n\n<commit_msg>Added pickable and dragable<commit_after>\/*=========================================================================\n\n Program: OSCAR \n Module: Actor.cc\n Language: C++\n Date: $Date$\n Version: $Revision$\n\nDescription:\n---------------------------------------------------------------------------\nThis file is part of the vis library\n\n- Ken Martin\n\n=========================================================================*\/\n#include <stdlib.h>\n#include <iostream.h>\n#include <math.h>\n\n#include \"Actor.hh\"\n\nvlActor::vlActor()\n{\n this->Mapper = 0;\n this->Property = 0;\n\n this->Origin[0] = 0.0;\n this->Origin[1] = 0.0;\n this->Origin[2] = 0.0;\n\n this->Position[0] = 0.0;\n this->Position[1] = 0.0;\n this->Position[2] = 0.0;\n\n this->Orientation[0] = 0.0;\n this->Orientation[1] = 0.0;\n this->Orientation[2] = 0.0;\n\n this->Scale[0] = 1.0;\n this->Scale[1] = 1.0;\n this->Scale[2] = 1.0;\n\n this->Visibility = 1;\n this->Pickable = 1;\n this->Dragable = 1;\n}\n\nvlActor::~vlActor()\n{\n if ( this->Mapper ) this->Mapper->UnRegister((void *)this);\n}\n\nvoid vlActor::Render(vlRenderer *ren)\n{\n \/* render the property *\/\n this->Property->Render(ren);\n\n \/* send a render to the modeller *\/\n this->Mapper->Render(ren);\n\n}\n \nvoid vlActor::GetCompositeMatrix(float mat[4][4])\n{\n mat[0][0] = 1; mat[0][1] = 0; mat[0][2] = 0; mat[0][3] = 0;\n mat[1][0] = 0; mat[1][1] = 1; mat[1][2] = 0; mat[1][3] = 0;\n mat[2][0] = 0; mat[2][1] = 0; mat[2][2] = 1; mat[2][3] = 0;\n mat[3][0] = 0; mat[3][1] = 0; mat[3][2] = 0; mat[3][3] = 1;\n}\n\nvoid vlActor::SetMapper(vlMapper *m)\n{\n if ( this->Mapper != m )\n {\n if ( this->Mapper ) this->Mapper->UnRegister((void *)this);\n this->Mapper = m;\n this->Mapper->Register((void *)this);\n this->Modified();\n }\n}\n\nvlMapper *vlActor::GetMapper()\n{\n return this->Mapper;\n}\n\n<|endoftext|>"} {"text":"<commit_before>\/*=========================================================================\n\n Program: ORFEO Toolbox\n Language: C++\n Date: $Date$\n Version: $Revision$\n\n\n Copyright (c) Centre National d'Etudes Spatiales. All rights reserved.\n See OTBCopyright.txt for details.\n\n\n This software is distributed WITHOUT ANY WARRANTY; without even\n the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR\n PURPOSE. See the above copyright notices for more information.\n\n=========================================================================*\/\n\n\n\/\/ Software Guide : BeginCommandLineArgs\n\/\/ ${OTB_DATA_ROOT}\/Input\/srtm_directory ${OTB_DATA_ROOT}\/Input\/DEM\/egm96.grd\n\/\/ 40 8.434583 44.647083 383.580313671 0.001\n\/\/ Software Guide : EndCommandLineArgs\n\n\/\/ Software Guide : BeginLatex\n\/\/\n\/\/ OTB relies on OSSIM for elevation handling. Since release 3.16, there is a\n\/\/ single configuration class \\doxygen{otb}{DEMHandler} to manage elevation (in\n\/\/ image projections or localization functions for example). This configuration\n\/\/ is managed by the a proper instanciation and parameters setting of this\n\/\/ class. These instanciations must be done before any call to geometric\n\/\/ filters or functionalities. Ossim internal accesses to elevation are also\n\/\/ configured by this class and this will ensure consistency throughout the\n\/\/ library.\n\/\/\n\/\/ Software Guide : EndLatex\n\n#include \"otbDEMHandler.h\"\n\nint main(int argc, char * argv[])\n{\nif(argc!=8)\n {\n std::cerr<<\"Usage: \"<<argv[0]<<\" demdir[path|no] geoid[path|no] defaultHeight longitude latitude targetValue tolerance\"<<std::endl;\n return EXIT_FAILURE;\n }\n\n std::string demdir = argv[1];\n std::string geoid = argv[2];\n double defaultHeight = atof(argv[3]);\n double longitude = atof(argv[4]);\n double latitude = atof(argv[5]);\n double target = atof(argv[6]);\n double tolerance = atof(argv[7]);\n\n\/\/ Software Guide : BeginLatex\n\/\/\n\/\/ This class is a singleton, the New() method is deprecated and will be removed\n\/\/ in future release. Please use the DEMHandler::Instance() method instead.\n\/\/\n\/\/ Software Guide : EndLatex\n\n \/\/ Software Guide : BeginCodeSnippet\n otb::DEMHandler::Pointer demHandler = otb::DEMHandler::Instance();\n \/\/ Software Guide : EndCodeSnippet\n\n bool fail = false;\n\n\/\/ Software Guide : BeginLatex\n\/\/\n\/\/ The class allows to configure a directory containing DEM tiles (DTED or SRTM\n\/\/ supported) using the OpenDEMDirectory() method. The OpenGeoidFile() method\n\/\/ allows to input a geoid file as well. Last, a default height above ellipsoid\n\/\/ can be set using the SetDefaultHeightAboveEllipsoid() method.\n\/\/ demHandler->SetDefaultHeightAboveEllipsoid(defaultHeight);\n\/\/\n\/\/ Software Guide : EndLatex\n\n \/\/ Software Guide : BeginCodeSnippet\n demHandler->SetDefaultHeightAboveEllipsoid(defaultHeight);\n\n if(!demHandler->IsValidDEMDirectory(demdir.c_str()))\n {\n std::cerr<<\"IsValidDEMDirectory(\"<<demdir<<\") = false\"<<std::endl;\n fail = true;\n }\n\n demHandler->OpenDEMDirectory(demdir);\n demHandler->OpenGeoidFile(geoid);\n\n \/\/ Software Guide : EndCodeSnippet\n\n \/\/ Software Guide : BeginLatex\n \/\/\n \/\/ We can now retrieve height above ellipsoid or height above Mean Sea Level\n \/\/ (MSL) using the methods \\code{GetHeightAboveEllipsoid()} and\n \/\/ \\code{GetHeightAboveMSL()}. Outputs of these methods depend on the\n \/\/ configuration of the class \\doxygen{otb}{DEMHandler} and the different\n \/\/ cases are: For \\code{GetHeightAboveEllipsoid()}:\n \/\/\n \/\/ \\begin{itemize}\n \/\/ \\item DEM and geoid both available: dem_value + geoid_offset\n \/\/ \\item No SDEM but geoid available: geoid_offset\n \/\/ \\item DEM available, but no geoid: dem_value\n \/\/ \\item No DEM and no geoid available: default height above ellipsoid\n \/\/ \\end{itemize}\n \/\/\n \/\/ For \\code{GetHeightAboveMSL()}:\n \/\/\n \/\/ \\begin{itemize}\n \/\/ \\item DEM and geoid both available: srtm_value\n \/\/ \\item No DEM but geoid available: 0\n \/\/ \\item DEM available, but no geoid: srtm_value\n \/\/ \\item No DEM and no geoid available: 0\n \/\/ \\end{itemize}\n \/\/\n \/\/ Software Guide : EndLatex\n\n \/\/ Software Guide : BeginCodeSnippet\n otb::DEMHandler::PointType point;\n point[0] = longitude;\n point[1] = latitude;\n\n double height = -32768;\n\n height = demHandler->GetHeightAboveMSL(point);\n std::cout<<\"height above MSL (\"<<longitude<<\", \"<<latitude<<\") = \"<<height<<\" meters\"<<std::endl;\n\n height = demHandler->GetHeightAboveEllipsoid(point);\n std::cout<<\"height above ellipsoid (\"<<longitude<<\", \"<<latitude<<\") = \"<<height<<\" meters\"<<std::endl;\n \/\/ Software Guide : EndCodeSnippet\n\n \/\/ Software Guide : BeginLatex Please note that OSSIM internal calls for\n \/\/ sensor modelling use the height above ellipsoid, and follow the same logic\n \/\/ as the GetHeightAboveEllipsoid() method. Software Guide : EndLatex\n\n \/\/ Check for Nan\n if(vnl_math_isnan(height))\n {\n std::cerr<<\"Computed value is NaN\"<<std::endl;\n fail = true;\n }\n\n double error = vcl_abs(height-target);\n\n if(error>tolerance)\n {\n std::cerr<<\"Target value is \"<<target<<\" meters, computed value is \"<<height<<\" meters. error (\"<<error<<\" meters) > tolerance (\"<<tolerance<<\" meters)\"<<std::endl;\n fail = true;\n }\n\n if(fail)\n {\n return EXIT_FAILURE;\n }\n\n return EXIT_SUCCESS;\n}\n<commit_msg>DOC: improve DEMHandler example<commit_after>\/*=========================================================================\n\n Program: ORFEO Toolbox\n Language: C++\n Date: $Date$\n Version: $Revision$\n\n\n Copyright (c) Centre National d'Etudes Spatiales. All rights reserved.\n See OTBCopyright.txt for details.\n\n\n This software is distributed WITHOUT ANY WARRANTY; without even\n the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR\n PURPOSE. See the above copyright notices for more information.\n\n=========================================================================*\/\n\n\n\/\/ Software Guide : BeginCommandLineArgs\n\/\/ ${OTB_DATA_ROOT}\/Input\/srtm_directory ${OTB_DATA_ROOT}\/Input\/DEM\/egm96.grd\n\/\/ 40 8.434583 44.647083 383.580313671 0.001\n\/\/ Software Guide : EndCommandLineArgs\n\n\/\/ Software Guide : BeginLatex\n\/\/\n\/\/ OTB relies on OSSIM for elevation handling. Since release 3.16, there is a\n\/\/ single configuration class \\doxygen{otb}{DEMHandler} to manage elevation (in\n\/\/ image projections or localization functions for example). This configuration\n\/\/ is managed by the a proper instanciation and parameters setting of this\n\/\/ class. These instanciations must be done before any call to geometric\n\/\/ filters or functionalities. Ossim internal accesses to elevation are also\n\/\/ configured by this class and this will ensure consistency throughout the\n\/\/ library.\n\/\/\n\/\/ Software Guide : EndLatex\n\n#include \"otbDEMHandler.h\"\n\nint main(int argc, char * argv[])\n{\nif(argc!=8)\n {\n std::cerr<<\"Usage: \"<<argv[0]<<\" demdir[path|no] geoid[path|no] defaultHeight longitude latitude targetValue tolerance\"<<std::endl;\n return EXIT_FAILURE;\n }\n\n std::string demdir = argv[1];\n std::string geoid = argv[2];\n double defaultHeight = atof(argv[3]);\n double longitude = atof(argv[4]);\n double latitude = atof(argv[5]);\n double target = atof(argv[6]);\n double tolerance = atof(argv[7]);\n\n\/\/ Software Guide : BeginLatex\n\/\/\n\/\/ This class is a singleton, the New() method is deprecated and will be removed\n\/\/ in future release. We need to use the \\code{Instance()} method instead.\n\/\/\n\/\/ Software Guide : EndLatex\n\n \/\/ Software Guide : BeginCodeSnippet\n otb::DEMHandler::Pointer demHandler = otb::DEMHandler::Instance();\n \/\/ Software Guide : EndCodeSnippet\n\n bool fail = false;\n\n\/\/ Software Guide : BeginLatex\n\/\/\n\/\/ It allows to configure a directory containing DEM tiles (DTED or SRTM\n\/\/ supported) using the \\code{OpenDEMDirectory()} method. The \\code{OpenGeoidFile()} method\n\/\/ allows to input a geoid file as well. Last, a default height above ellipsoid\n\/\/ can be set using the \\code{SetDefaultHeightAboveEllipsoid()} method.\n\/\/\n\/\/ Software Guide : EndLatex\n\n \/\/ Software Guide : BeginCodeSnippet\n demHandler->SetDefaultHeightAboveEllipsoid(defaultHeight);\n\n if(!demHandler->IsValidDEMDirectory(demdir.c_str()))\n {\n std::cerr<<\"IsValidDEMDirectory(\"<<demdir<<\") = false\"<<std::endl;\n fail = true;\n }\n\n demHandler->OpenDEMDirectory(demdir);\n demHandler->OpenGeoidFile(geoid);\n\n \/\/ Software Guide : EndCodeSnippet\n\n \/\/ Software Guide : BeginLatex\n \/\/\n \/\/ We can now retrieve height above ellipsoid or height above Mean Sea Level\n \/\/ (MSL) using the methods \\code{GetHeightAboveEllipsoid()} and\n \/\/ \\code{GetHeightAboveMSL()}. Outputs of these methods depend on the\n \/\/ configuration of the class \\doxygen{otb}{DEMHandler} and the different\n \/\/ cases are:\n \/\/\n \/\/ For \\code{GetHeightAboveEllipsoid()}:\n \/\/\n \/\/ \\begin{itemize}\n \/\/ \\item DEM and geoid both available: $dem\\_value + geoid\\_offset$\n \/\/ \\item No DEM but geoid available: geoid\\_offset\n \/\/ \\item DEM available, but no geoid: dem\\_value\n \/\/ \\item No DEM and no geoid available: default height above ellipsoid\n \/\/ \\end{itemize}\n \/\/\n \/\/ For \\code{GetHeightAboveMSL()}:\n \/\/\n \/\/ \\begin{itemize}\n \/\/ \\item DEM and geoid both available: srtm\\_value\n \/\/ \\item No DEM but geoid available: $0$\n \/\/ \\item DEM available, but no geoid: srtm\\_value\n \/\/ \\item No DEM and no geoid available: $0$\n \/\/ \\end{itemize}\n \/\/\n \/\/ Software Guide : EndLatex\n\n \/\/ Software Guide : BeginCodeSnippet\n otb::DEMHandler::PointType point;\n point[0] = longitude;\n point[1] = latitude;\n\n double height = -32768;\n\n height = demHandler->GetHeightAboveMSL(point);\n std::cout<<\"height above MSL (\"<<longitude<<\",\"\n <<latitude<<\") = \"<<height<<\" meters\"<<std::endl;\n\n height = demHandler->GetHeightAboveEllipsoid(point);\n std::cout<<\"height above ellipsoid (\"<<longitude\n <<\", \"<<latitude<<\") = \"<<height<<\" meters\"<<std::endl;\n \/\/ Software Guide : EndCodeSnippet\n \/\/\n \/\/ Software Guide : BeginLatex\n \/\/\n \/\/ Note that OSSIM internal calls for sensor\n \/\/ modelling use the height above ellipsoid, and follow the same logic as the\n \/\/ GetHeightAboveEllipsoid() method.\n \/\/\n \/\/Software Guide : EndLatex\n\n \/\/ Check for Nan\n if(vnl_math_isnan(height))\n {\n std::cerr<<\"Computed value is NaN\"<<std::endl;\n fail = true;\n }\n\n double error = vcl_abs(height-target);\n\n if(error>tolerance)\n {\n std::cerr<<\"Target value is \"<<target<<\" meters, computed value is \"<<height<<\" meters. error (\"<<error<<\" meters) > tolerance (\"<<tolerance<<\" meters)\"<<std::endl;\n fail = true;\n }\n\n if(fail)\n {\n return EXIT_FAILURE;\n }\n\n return EXIT_SUCCESS;\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_OS_WINDOWS_SHELL_HPP__\n#define __STOUT_OS_WINDOWS_SHELL_HPP__\n\n#include <process.h>\n#include <stdarg.h> \/\/ For va_list, va_start, etc.\n\n#include <ostream>\n#include <string>\n\n#include <stout\/try.hpp>\n\nnamespace os {\n\nnamespace Shell {\n\n \/\/ Canonical constants used as platform-dependent args to `exec` calls.\n \/\/ `name` is the command name, `arg0` is the first argument received\n \/\/ by the callee, usually the command name and `arg1` is the second\n \/\/ command argument received by the callee.\n\n constexpr const char* name = \"cmd.exe\";\n constexpr const char* arg0 = \"cmd\";\n constexpr const char* arg1 = \"\/c\";\n\n} \/\/ namespace Shell {\n\n\/**\n * Runs a shell command with optional arguments.\n *\n * This assumes that a successful execution will result in the exit code\n * for the command to be `EXIT_SUCCESS`; in this case, the contents\n * of the `Try` will be the contents of `stdout`.\n *\n * If the exit code is non-zero or the process was signaled, we will\n * return an appropriate error message; but *not* `stderr`.\n *\n * If the caller needs to examine the contents of `stderr` it should\n * be redirected to `stdout` (using, e.g., \"2>&1 || true\" in the command\n * string). The `|| true` is required to obtain a success exit\n * code in case of errors, and still obtain `stderr`, as piped to\n * `stdout`.\n *\n * @param fmt the formatting string that contains the command to execute\n * in the underlying shell.\n * @param t optional arguments for `fmt`.\n *\n * @return the output from running the specified command with the shell; or\n * an error message if the command's exit code is non-zero.\n *\/\ntemplate <typename... T>\nTry<std::string> shell(const std::string& fmt, const T&... t)\n{\n const Try<std::string> command = strings::internal::format(fmt, t...);\n if (command.isError()) {\n return Error(command.error());\n }\n\n FILE* file;\n std::ostringstream stdoutstr;\n\n if ((file = _popen(command.get().c_str(), \"r\")) == NULL) {\n return Error(\"Failed to run '\" + command.get() + \"'\");\n }\n\n char line[1024];\n \/\/ NOTE(vinod): Ideally the if and while loops should be interchanged. But\n \/\/ we get a broken pipe error if we don't read the output and simply close.\n while (fgets(line, sizeof(line), file) != NULL) {\n stdoutstr << line;\n }\n\n if (ferror(file) != 0) {\n _pclose(file); \/\/ Ignoring result since we already have an error.\n return Error(\"Error reading output of '\" + command.get() + \"'\");\n }\n\n int status;\n if ((status = _pclose(file)) == -1) {\n return Error(\"Failed to get status of '\" + command.get() + \"'\");\n }\n\n return stdoutstr.str();\n}\n\n\/\/ Executes a command by calling \"cmd \/c <command>\", and returns\n\/\/ after the command has been completed. Returns 0 if succeeds, and\n\/\/ return -1 on error\ninline int system(const std::string& command)\n{\n return ::_spawnlp(\n _P_WAIT, Shell::name, Shell::arg0, Shell::arg1, command.c_str(), NULL);\n}\n\ntemplate<typename... T>\ninline int execlp(const char* file, T... t)\n{\n exit(::_spawnlp(_P_WAIT, file, t...));\n}\n\n} \/\/ namespace os {\n\n#endif \/\/ __STOUT_OS_WINDOWS_SHELL_HPP__\n<commit_msg>Windows: Stout: Added `stringify_args` utility.<commit_after>\/\/ Licensed under the Apache License, Version 2.0 (the \"License\");\n\/\/ you may not use this file except in compliance with the License.\n\/\/ You may obtain a copy of the License at\n\/\/\n\/\/ http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n\/\/\n\/\/ Unless required by applicable law or agreed to in writing, software\n\/\/ distributed under the License is distributed on an \"AS IS\" BASIS,\n\/\/ WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n\/\/ See the License for the specific language governing permissions and\n\/\/ limitations under the License.\n\n#ifndef __STOUT_OS_WINDOWS_SHELL_HPP__\n#define __STOUT_OS_WINDOWS_SHELL_HPP__\n\n#include <process.h>\n#include <stdarg.h> \/\/ For va_list, va_start, etc.\n\n#include <ostream>\n#include <string>\n\n#include <stout\/try.hpp>\n\nnamespace os {\n\nnamespace Shell {\n\n \/\/ Canonical constants used as platform-dependent args to `exec` calls.\n \/\/ `name` is the command name, `arg0` is the first argument received\n \/\/ by the callee, usually the command name and `arg1` is the second\n \/\/ command argument received by the callee.\n constexpr const char* name = \"cmd.exe\";\n constexpr const char* arg0 = \"cmd\";\n constexpr const char* arg1 = \"\/c\";\n\n} \/\/ namespace Shell {\n\n\/**\n * Runs a shell command with optional arguments.\n *\n * This assumes that a successful execution will result in the exit code\n * for the command to be `EXIT_SUCCESS`; in this case, the contents\n * of the `Try` will be the contents of `stdout`.\n *\n * If the exit code is non-zero or the process was signaled, we will\n * return an appropriate error message; but *not* `stderr`.\n *\n * If the caller needs to examine the contents of `stderr` it should\n * be redirected to `stdout` (using, e.g., \"2>&1 || true\" in the command\n * string). The `|| true` is required to obtain a success exit\n * code in case of errors, and still obtain `stderr`, as piped to\n * `stdout`.\n *\n * @param fmt the formatting string that contains the command to execute\n * in the underlying shell.\n * @param t optional arguments for `fmt`.\n *\n * @return the output from running the specified command with the shell; or\n * an error message if the command's exit code is non-zero.\n *\/\ntemplate <typename... T>\nTry<std::string> shell(const std::string& fmt, const T&... t)\n{\n const Try<std::string> command = strings::internal::format(fmt, t...);\n if (command.isError()) {\n return Error(command.error());\n }\n\n FILE* file;\n std::ostringstream stdoutstr;\n\n if ((file = _popen(command.get().c_str(), \"r\")) == NULL) {\n return Error(\"Failed to run '\" + command.get() + \"'\");\n }\n\n char line[1024];\n \/\/ NOTE(vinod): Ideally the if and while loops should be interchanged. But\n \/\/ we get a broken pipe error if we don't read the output and simply close.\n while (fgets(line, sizeof(line), file) != NULL) {\n stdoutstr << line;\n }\n\n if (ferror(file) != 0) {\n _pclose(file); \/\/ Ignoring result since we already have an error.\n return Error(\"Error reading output of '\" + command.get() + \"'\");\n }\n\n int status;\n if ((status = _pclose(file)) == -1) {\n return Error(\"Failed to get status of '\" + command.get() + \"'\");\n }\n\n return stdoutstr.str();\n}\n\n\n\/\/ Executes a command by calling \"cmd \/c <command>\", and returns\n\/\/ after the command has been completed. Returns 0 if succeeds, and\n\/\/ return -1 on error\ninline int system(const std::string& command)\n{\n return ::_spawnlp(\n _P_WAIT, Shell::name, Shell::arg0, Shell::arg1, command.c_str(), NULL);\n}\n\n\ntemplate<typename... T>\ninline int execlp(const char* file, T... t)\n{\n exit(::_spawnlp(_P_WAIT, file, t...));\n}\n\n\n\/\/ Concatenates multiple command-line arguments and escapes the values.\n\/\/ If `arg` is not specified (or takes the value `0`), the function will\n\/\/ scan `argv` until a `NULL` is encountered.\ninline std::string stringify_args(char** argv, unsigned long argc = 0)\n{\n std::string arg_line = \"\";\n unsigned long index = 0;\n while ((argc == 0 || index < argc) && argv[index] != NULL) {\n \/\/ TODO(dpravat): (MESOS-5522) Format these args for all cases.\n \/\/ Specifically, we need to:\n \/\/ (1) Add double quotes around arguments that contain special\n \/\/ characters, like spaces and tabs.\n \/\/ (2) Escape any existing double quotes and backslashes.\n arg_line = strings::join(\" \", arg_line, argv[index++]);\n }\n\n return arg_line;\n}\n\n} \/\/ namespace os {\n\n#endif \/\/ __STOUT_OS_WINDOWS_SHELL_HPP__\n<|endoftext|>"} {"text":"<commit_before>\/*************************************************************************\n *\n * $RCSfile: UCBDeadPropertyValue.hxx,v $\n *\n * $Revision: 1.4 $\n *\n * last change: $Author: obo $ $Date: 2005-01-27 12:14: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 _UCBDEADPROPERTYVALUE_HXX_\n#define _UCBDEADPROPERTYVALUE_HXX_\n\n#ifndef _RTL_STRING_HXX_\n#include <rtl\/string.hxx>\n#endif\n#ifndef _COM_SUN_STAR_UNO_ANY_HXX_\n#include <com\/sun\/star\/uno\/Any.hxx>\n#endif\n\nnamespace webdav_ucp\n{\n\nclass UCBDeadPropertyValue\n{\nprivate:\n static const rtl::OUString aTypeString;\n static const rtl::OUString aTypeLong;\n static const rtl::OUString aTypeShort;\n static const rtl::OUString aTypeBoolean;\n static const rtl::OUString aTypeChar;\n static const rtl::OUString aTypeByte;\n static const rtl::OUString aTypeHyper;\n static const rtl::OUString aTypeFloat;\n static const rtl::OUString aTypeDouble;\n\n static const rtl::OUString aXMLPre;\n static const rtl::OUString aXMLMid;\n static const rtl::OUString aXMLEnd;\n\npublic:\n static bool supportsType( const com::sun::star::uno::Type & rType );\n\n static bool createFromXML( const rtl::OString & rInData,\n com::sun::star::uno::Any & rOutData );\n static bool toXML( const com::sun::star::uno::Any & rInData,\n rtl::OUString & rOutData );\n};\n\n}\n\n#endif \/* _UCBDEADPROPERTYVALUE_HXX_ *\/\n<commit_msg>INTEGRATION: CWS ooo19126 (1.4.34); FILE MERGED 2005\/09\/05 18:45:37 rt 1.4.34.1: #i54170# Change license header: remove SISSL<commit_after>\/*************************************************************************\n *\n * OpenOffice.org - a multi-platform office productivity suite\n *\n * $RCSfile: UCBDeadPropertyValue.hxx,v $\n *\n * $Revision: 1.5 $\n *\n * last change: $Author: rt $ $Date: 2005-09-09 16:14: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 _UCBDEADPROPERTYVALUE_HXX_\n#define _UCBDEADPROPERTYVALUE_HXX_\n\n#ifndef _RTL_STRING_HXX_\n#include <rtl\/string.hxx>\n#endif\n#ifndef _COM_SUN_STAR_UNO_ANY_HXX_\n#include <com\/sun\/star\/uno\/Any.hxx>\n#endif\n\nnamespace webdav_ucp\n{\n\nclass UCBDeadPropertyValue\n{\nprivate:\n static const rtl::OUString aTypeString;\n static const rtl::OUString aTypeLong;\n static const rtl::OUString aTypeShort;\n static const rtl::OUString aTypeBoolean;\n static const rtl::OUString aTypeChar;\n static const rtl::OUString aTypeByte;\n static const rtl::OUString aTypeHyper;\n static const rtl::OUString aTypeFloat;\n static const rtl::OUString aTypeDouble;\n\n static const rtl::OUString aXMLPre;\n static const rtl::OUString aXMLMid;\n static const rtl::OUString aXMLEnd;\n\npublic:\n static bool supportsType( const com::sun::star::uno::Type & rType );\n\n static bool createFromXML( const rtl::OString & rInData,\n com::sun::star::uno::Any & rOutData );\n static bool toXML( const com::sun::star::uno::Any & rInData,\n rtl::OUString & rOutData );\n};\n\n}\n\n#endif \/* _UCBDEADPROPERTYVALUE_HXX_ *\/\n<|endoftext|>"} {"text":"<commit_before>\/*************************************************************************\n *\n * $RCSfile: UCBDeadPropertyValue.hxx,v $\n *\n * $Revision: 1.3 $\n *\n * last change: $Author: kso $ $Date: 2002-08-22 11:37:32 $\n *\n * The Contents of this file are made available subject to the terms of\n * either of the following licenses\n *\n * - GNU Lesser General Public License Version 2.1\n * - Sun Industry Standards Source License Version 1.1\n *\n * Sun Microsystems Inc., October, 2000\n *\n * GNU Lesser General Public License Version 2.1\n * =============================================\n * Copyright 2000 by Sun Microsystems, Inc.\n * 901 San Antonio Road, Palo Alto, CA 94303, USA\n *\n * This library is free software; you can redistribute it and\/or\n * modify it under the terms of the GNU Lesser General Public\n * License version 2.1, as published by the Free Software Foundation.\n *\n * This library is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU\n * Lesser General Public License for more details.\n *\n * You should have received a copy of the GNU Lesser General Public\n * License along with this library; if not, write to the Free Software\n * Foundation, Inc., 59 Temple Place, Suite 330, Boston,\n * MA 02111-1307 USA\n *\n *\n * Sun Industry Standards Source License Version 1.1\n * =================================================\n * The contents of this file are subject to the Sun Industry Standards\n * Source License Version 1.1 (the \"License\"); You may not use this file\n * except in compliance with the License. You may obtain a copy of the\n * License at http:\/\/www.openoffice.org\/license.html.\n *\n * Software provided under this License is provided on an \"AS IS\" basis,\n * WITHOUT WARRANTY OF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING,\n * WITHOUT LIMITATION, WARRANTIES THAT THE SOFTWARE IS FREE OF DEFECTS,\n * MERCHANTABLE, FIT FOR A PARTICULAR PURPOSE, OR NON-INFRINGING.\n * See the License for the specific provisions governing your rights and\n * obligations concerning the Software.\n *\n * The Initial Developer of the Original Code is: Sun Microsystems, Inc.\n *\n * Copyright: 2000 by Sun Microsystems, Inc.\n *\n * All Rights Reserved.\n *\n * Contributor(s): _______________________________________\n *\n *\n ************************************************************************\/\n\n#ifndef _UCBDEADPROPERTYVALUE_HXX_\n#define _UCBDEADPROPERTYVALUE_HXX_\n\n#ifndef NE_XML_H\n#include <neon\/ne_xml.h>\n#endif\n\n#ifndef _RTL_STRING_HXX_\n#include <rtl\/string.hxx>\n#endif\n#ifndef _COM_SUN_STAR_UNO_ANY_HXX_\n#include <com\/sun\/star\/uno\/Any.hxx>\n#endif\n\n#ifndef _DAVTYPES_HXX_\n#include \"DAVTypes.hxx\"\n#endif\n\nnamespace webdav_ucp\n{\n\nclass UCBDeadPropertyValue\n{\nprivate:\n static const ne_xml_elm elements[];\n\n static const rtl::OUString aTypeString;\n static const rtl::OUString aTypeLong;\n static const rtl::OUString aTypeShort;\n static const rtl::OUString aTypeBoolean;\n static const rtl::OUString aTypeChar;\n static const rtl::OUString aTypeByte;\n static const rtl::OUString aTypeHyper;\n static const rtl::OUString aTypeFloat;\n static const rtl::OUString aTypeDouble;\n\n static const rtl::OUString aXMLPre;\n static const rtl::OUString aXMLMid;\n static const rtl::OUString aXMLEnd;\n\npublic:\n static bool supportsType( const com::sun::star::uno::Type & rType );\n\n static bool createFromXML( const rtl::OString & rInData,\n com::sun::star::uno::Any & rOutData );\n static bool toXML( const com::sun::star::uno::Any & rInData,\n rtl::OUString & rOutData );\n};\n\n}\n\n#endif \/* _UCBDEADPROPERTYVALUE_HXX_ *\/\n<commit_msg>INTEGRATION: CWS kso13 (1.3.216); FILE MERGED 2005\/01\/06 09:09:20 kso 1.3.216.2: #i39925# - Adapted to API changes in updated neon version. 2005\/01\/06 09:01:59 kso 1.3.216.1: #i39925# - Adapted to API changes in updated neon version.<commit_after>\/*************************************************************************\n *\n * $RCSfile: UCBDeadPropertyValue.hxx,v $\n *\n * $Revision: 1.4 $\n *\n * last change: $Author: obo $ $Date: 2005-01-27 12:14: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 _UCBDEADPROPERTYVALUE_HXX_\n#define _UCBDEADPROPERTYVALUE_HXX_\n\n#ifndef _RTL_STRING_HXX_\n#include <rtl\/string.hxx>\n#endif\n#ifndef _COM_SUN_STAR_UNO_ANY_HXX_\n#include <com\/sun\/star\/uno\/Any.hxx>\n#endif\n\nnamespace webdav_ucp\n{\n\nclass UCBDeadPropertyValue\n{\nprivate:\n static const rtl::OUString aTypeString;\n static const rtl::OUString aTypeLong;\n static const rtl::OUString aTypeShort;\n static const rtl::OUString aTypeBoolean;\n static const rtl::OUString aTypeChar;\n static const rtl::OUString aTypeByte;\n static const rtl::OUString aTypeHyper;\n static const rtl::OUString aTypeFloat;\n static const rtl::OUString aTypeDouble;\n\n static const rtl::OUString aXMLPre;\n static const rtl::OUString aXMLMid;\n static const rtl::OUString aXMLEnd;\n\npublic:\n static bool supportsType( const com::sun::star::uno::Type & rType );\n\n static bool createFromXML( const rtl::OString & rInData,\n com::sun::star::uno::Any & rOutData );\n static bool toXML( const com::sun::star::uno::Any & rInData,\n rtl::OUString & rOutData );\n};\n\n}\n\n#endif \/* _UCBDEADPROPERTYVALUE_HXX_ *\/\n<|endoftext|>"} {"text":"<commit_before>\/\/ this is for emacs file handling -*- mode: c++; indent-tabs-mode: nil -*-\n\n\/\/ -- BEGIN LICENSE BLOCK ----------------------------------------------\n\/\/ -- END LICENSE BLOCK ------------------------------------------------\n\n\/\/----------------------------------------------------------------------\n\/*!\\file\n *\n * \\author Felix Exner exner@fzi.de\n * \\date 2019-06-14\n *\n *\/\n\/\/----------------------------------------------------------------------\n\n#include <ur_robot_driver\/ur\/calibration_checker.h>\n\nnamespace ur_driver\n{\nCalibrationChecker::CalibrationChecker(const std::string& expected_hash)\n : expected_hash_(expected_hash), checked_(false)\n{\n}\nbool CalibrationChecker::consume(std::shared_ptr<primary_interface::PrimaryPackage> product)\n{\n auto kin_info = std::dynamic_pointer_cast<primary_interface::KinematicsInfo>(product);\n if (kin_info != nullptr)\n {\n \/\/ LOG_INFO(\"%s\", product->toString().c_str());\n \/\/\n if (kin_info->toHash() != expected_hash_)\n {\n LOG_ERROR(\"The calibration parameters of the connected robot don't match the ones from the given kinematics \"\n \"config file. Please be aware that this can lead to critical inaccuracies of tcp positions. Use the \"\n \"ur_calibration tool to extract the correct calibration from the robot and pass that into the \"\n \"description. See [TODO Link to documentation] for details.\");\n }\n else\n {\n LOG_INFO(\"Calibration checked successfully.\");\n }\n\n checked_ = true;\n }\n\n return true;\n}\n} \/\/ namespace ur_driver\n<commit_msg>Add actual documentation link into calibration checker output<commit_after>\/\/ this is for emacs file handling -*- mode: c++; indent-tabs-mode: nil -*-\n\n\/\/ -- BEGIN LICENSE BLOCK ----------------------------------------------\n\/\/ -- END LICENSE BLOCK ------------------------------------------------\n\n\/\/----------------------------------------------------------------------\n\/*!\\file\n *\n * \\author Felix Exner exner@fzi.de\n * \\date 2019-06-14\n *\n *\/\n\/\/----------------------------------------------------------------------\n\n#include <ur_robot_driver\/ur\/calibration_checker.h>\n\nnamespace ur_driver\n{\nCalibrationChecker::CalibrationChecker(const std::string& expected_hash)\n : expected_hash_(expected_hash), checked_(false)\n{\n}\nbool CalibrationChecker::consume(std::shared_ptr<primary_interface::PrimaryPackage> product)\n{\n auto kin_info = std::dynamic_pointer_cast<primary_interface::KinematicsInfo>(product);\n if (kin_info != nullptr)\n {\n \/\/ LOG_INFO(\"%s\", product->toString().c_str());\n \/\/\n if (kin_info->toHash() != expected_hash_)\n {\n LOG_ERROR(\"The calibration parameters of the connected robot don't match the ones from the given kinematics \"\n \"config file. Please be aware that this can lead to critical inaccuracies of tcp positions. Use the \"\n \"ur_calibration tool to extract the correct calibration from the robot and pass that into the \"\n \"description. See \"\n \"[https:\/\/github.com\/UniversalRobots\/Universal_Robots_ROS_Driver#extract-calibration-information] for \"\n \"details.\");\n }\n else\n {\n LOG_INFO(\"Calibration checked successfully.\");\n }\n\n checked_ = true;\n }\n\n return true;\n}\n} \/\/ namespace ur_driver\n<|endoftext|>"} {"text":"<commit_before>#ifndef VIENNAGRID_ALGORITHM_DISTANCE_HPP\n#define VIENNAGRID_ALGORITHM_DISTANCE_HPP\n\n\/* =======================================================================\n Copyright (c) 2011-2014, 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#include <iostream>\n#include <sstream>\n#include <string>\n#include <stdexcept>\n#include <limits>\n\n#include \"viennagrid\/forwards.hpp\"\n#include \"viennagrid\/topology\/all.hpp\"\n#include \"viennagrid\/algorithm\/norm.hpp\"\n#include \"viennagrid\/algorithm\/inner_prod.hpp\"\n#include \"viennagrid\/algorithm\/closest_points.hpp\"\n\n\/** @file viennagrid\/algorithm\/distance.hpp\n @brief Computes the (Cartesian) distance between different elements.\n*\/\n\n\nnamespace viennagrid\n{\n namespace detail\n {\n\n \/\/\n \/\/ Distance between points\n \/\/\n\n \/\/ Distance between two points:\n template <typename PointT1, typename PointT2>\n typename viennagrid::result_of::coord<PointT1>::type\n distance_impl(PointT1 const & p1,\n PointT2 const & p2)\n {\n return norm_2(p1 - p2);\n }\n\n template <typename PointT1, typename PointT2>\n typename viennagrid::result_of::coord<PointT1>::type\n distance_impl( std::pair<PointT1,PointT2> const & pts)\n {\n return distance_impl(pts.first, pts.second);\n }\n\n template <typename PointAccessorT, typename CoordT1, typename CoordinateSystemT1, typename CoordT2, typename CoordinateSystemT2>\n CoordT1\n distance_impl(PointAccessorT const,\n spatial_point<CoordT1, CoordinateSystemT1> const & p1,\n spatial_point<CoordT2, CoordinateSystemT2> const & p2)\n {\n return distance_impl(p1, p2);\n }\n\n template <typename PointAccessorT, typename PointT, typename WrappedConfigT>\n typename viennagrid::result_of::coord<PointT>::type\n distance_impl(PointAccessorT const accessor,\n PointT const & p1,\n viennagrid::element<viennagrid::vertex_tag, WrappedConfigT> const & v2)\n {\n return distance_impl(p1, accessor(v2));\n }\n\n template <typename PointAccessorT, typename PointT, typename WrappedConfigT>\n typename viennagrid::result_of::coord<typename PointAccessorT::value_type>::type\n distance_impl(PointAccessorT const accessor,\n viennagrid::element<viennagrid::vertex_tag, WrappedConfigT> const & v1,\n PointT const & p2)\n {\n return distance_impl(accessor(v1), p2);\n }\n\n \/\/ Distance between vertices: Use point distance\n template <typename PointAccessorT, typename PointT, typename WrappedConfigT1, typename WrappedConfigT2>\n typename viennagrid::result_of::coord<typename PointAccessorT::value_type>::type\n distance_impl(PointAccessorT const accessor,\n viennagrid::element<viennagrid::vertex_tag, WrappedConfigT1> const & v1,\n viennagrid::element<viennagrid::vertex_tag, WrappedConfigT2> const & v2)\n {\n return distance_impl(accessor(v1), accessor(v2));\n }\n\n\n\n \/\/\n \/\/ Generic distance computation: Reuse closest_points()\n \/\/\n template <typename PointAccessorT, typename SomethingT1, typename SomethingT2>\n typename viennagrid::result_of::coord<typename PointAccessorT::value_type>::type\n distance_impl(PointAccessorT const accessor,\n SomethingT1 const & el1,\n SomethingT2 const & el2)\n {\n \/\/typedef typename result_of::point<ElementType1>::type PointT;\n typedef typename PointAccessorT::value_type PointT;\n\n std::pair<PointT, PointT> points = closest_points(accessor, el1, el2);\n\n return distance_impl( points );\n }\n\n\n\n \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/ boundary distance \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n\n template <typename PointT1, typename PointT2>\n typename viennagrid::result_of::coord<PointT1>::type\n boundary_distance_impl(PointT1 const & p1,\n PointT2 const & p2)\n {\n return norm_2(p1 - p2);\n }\n\n template <typename PointT1, typename PointT2>\n typename viennagrid::result_of::coord<PointT1>::type\n boundary_distance_impl( std::pair<PointT1,PointT2> const & pts)\n {\n return boundary_distance_impl(pts.first, pts.second);\n }\n\n template <typename PointAccessorT, typename CoordT1, typename CoordinateSystemT1, typename CoordT2, typename CoordinateSystemT2>\n CoordT1\n boundary_distance_impl(PointAccessorT const,\n spatial_point<CoordT1, CoordinateSystemT1> const & p1,\n spatial_point<CoordT2, CoordinateSystemT2> const & p2)\n {\n return boundary_distance_impl(p1, p2);\n }\n\n template <typename PointAccessorT, typename PointT, typename WrappedConfigT>\n typename viennagrid::result_of::coord<PointT>::type\n boundary_distance_impl(PointAccessorT const accessor,\n PointT const & p1,\n viennagrid::element<viennagrid::vertex_tag, WrappedConfigT> const & v2)\n {\n return boundary_distance_impl(p1, accessor(v2));\n }\n\n template <typename PointAccessorT, typename PointT, typename WrappedConfigT>\n typename viennagrid::result_of::coord<typename PointAccessorT::value_type>::type\n boundary_distance_impl(PointAccessorT const accessor,\n viennagrid::element<viennagrid::vertex_tag, WrappedConfigT> const & v1,\n PointT const & p2)\n {\n return boundary_distance_impl(accessor(v1), p2);\n }\n\n \/\/ Distance between vertices: Use point distance\n template <typename PointAccessorT, typename PointT, typename WrappedConfigT1, typename WrappedConfigT2>\n typename viennagrid::result_of::coord<typename PointAccessorT::value_type>::type\n boundary_distance_impl(PointAccessorT const accessor,\n viennagrid::element<viennagrid::vertex_tag, WrappedConfigT1> const & v1,\n viennagrid::element<viennagrid::vertex_tag, WrappedConfigT2> const & v2)\n {\n return boundary_distance_impl(accessor(v1), accessor(v2));\n }\n\n\n\n \/\/\n \/\/ Generic distance computation: Reuse closest_points()\n \/\/\n template <typename PointAccessorT, typename SomethingT1, typename SomethingT2>\n typename viennagrid::result_of::coord<typename PointAccessorT::value_type>::type\n boundary_distance_impl(PointAccessorT const accessor,\n SomethingT1 const & el1,\n SomethingT2 const & el2)\n {\n \/\/typedef typename result_of::point<ElementType1>::type PointT;\n typedef typename PointAccessorT::value_type PointT;\n\n std::pair<PointT, PointT> points = closest_points_on_boundary(accessor, el1, el2);\n\n return boundary_distance_impl(points);\n }\n\n } \/\/namespace detail\n\n \/\/\n \/\/ The public interface functions\n \/\/\n \/** @brief Returns the distance between elements, segments and\/or meshs using the point accessor provided *\/\n template <typename PointAccessorT, typename SomethingT1, typename SomethingT2>\n typename viennagrid::result_of::coord<SomethingT1>::type\n distance(PointAccessorT const accessor,\n SomethingT1 const & el1,\n SomethingT2 const & el2)\n {\n return detail::distance_impl(accessor, el1, el2);\n }\n\n\n \/** @brief Returns the distance between elements, segments and\/or meshs using the default point accessor*\/\n template <typename SomethingT1, typename SomethingT2>\n typename viennagrid::result_of::coord<SomethingT1>::type\n distance(SomethingT1 const & el1,\n SomethingT2 const & el2)\n {\n return detail::distance_impl( default_point_accessor(el1), el1, el2 );\n }\n\n \/** @brief Returns the distance between a point and an element\/segment\/meshs using the default point accessor*\/\n template <typename SomethingT, typename CoordT, typename CoordinateSystemT>\n typename viennagrid::result_of::coord<SomethingT>::type\n distance(SomethingT const & el1,\n spatial_point<CoordT, CoordinateSystemT> const & el2)\n {\n return detail::distance_impl( default_point_accessor(el1), el1, el2 );\n }\n\n \/** @brief Returns the distance between a point and an element\/segment\/meshs using the default point accessor*\/\n template <typename CoordT, typename CoordinateSystemT, typename SomethingT>\n typename viennagrid::result_of::coord<SomethingT>::type\n distance(spatial_point<CoordT, CoordinateSystemT> const & el1,\n SomethingT const & el2)\n {\n return detail::distance_impl( default_point_accessor(el2), el1, el2 );\n }\n\n \/** @brief Returns the Euclidian distance between two points *\/\n template <typename CoordT1, typename CoordinateSystemT1, typename CoordT2, typename CoordinateSystemT2>\n typename viennagrid::result_of::coord< spatial_point<CoordT1, CoordinateSystemT1> >::type\n distance(spatial_point<CoordT1, CoordinateSystemT1> const & el1,\n spatial_point<CoordT2, CoordinateSystemT2> const & el2)\n {\n return detail::distance_impl( el1, el2 );\n }\n\n\n \/** @brief Returns the Euclidian distance between the boundary of a segment and a line *\/\n template<typename WrappedMeshConfigT, typename SegmentationT>\n typename result_of::coord< segment_handle<SegmentationT> >::type distance( element<line_tag, WrappedMeshConfigT> const & line, segment_handle<SegmentationT> const & segment_handle )\n {\n typedef viennagrid::segment_handle<SegmentationT> SegmentHandleType;\n typedef typename result_of::const_line_range<SegmentHandleType>::type ConstLineRangeType;\n typedef typename result_of::iterator<ConstLineRangeType>::type ConstLineIteratorType;\n\n typedef typename result_of::coord<SegmentHandleType>::type CoordType;\n\n ConstLineRangeType lines(segment_handle);\n if (lines.empty())\n return -1;\n\n ConstLineIteratorType lit = lines.begin();\n CoordType min_distance = distance(line, *(lit++));\n\n for (; lit != lines.end(); ++lit)\n {\n CoordType current_distance = distance(line, *lit);\n if (current_distance < min_distance)\n min_distance = current_distance;\n }\n\n return min_distance;\n }\n\n template<typename SegmentationT, typename WrappedMeshConfigT>\n typename result_of::coord< segment_handle<SegmentationT> >::type distance( segment_handle<SegmentationT> const & segment_handle, element<line_tag, WrappedMeshConfigT> const & line )\n {\n return distance( line, segment_handle );\n }\n\n\n\n\n\n \/** @brief Returns the distance between elements, segments and\/or meshs\n *\n * @param accessor Accessor functor for obtaining a point from a vertex\n * @param el1 The first element\/mesh\/vertex\n * @param el2 The second element\/mesh\/vertex\n *\/\n template <typename PointAccessorT, typename SomethingT1, typename SomethingT2>\n typename viennagrid::result_of::coord<SomethingT1>::type\n boundary_distance(PointAccessorT const accessor,\n SomethingT1 const & el1,\n SomethingT2 const & el2)\n {\n return detail::boundary_distance_impl(accessor, el1, el2);\n }\n\n \/** @brief Returns the distance between elements, segments and\/or meshs *\/\n template <typename SomethingT1, typename SomethingT2>\n typename viennagrid::result_of::coord<SomethingT1>::type\n boundary_distance(SomethingT1 const & el1,\n SomethingT2 const & el2)\n {\n return detail::boundary_distance_impl( default_point_accessor(el1), el1, el2 );\n }\n\n \/** @brief Returns the distance between a point and an element, segment and\/or mesh *\/\n template <typename SomethingT, typename CoordT, typename CoordinateSystemT>\n typename viennagrid::result_of::coord<SomethingT>::type\n boundary_distance(SomethingT const & el1,\n spatial_point<CoordT, CoordinateSystemT> const & el2)\n {\n return detail::boundary_distance_impl( default_point_accessor(el1), el1, el2 );\n }\n\n \/** @brief Returns the distance between a point and an element, segment and\/or mesh *\/\n template <typename CoordT, typename CoordinateSystemT, typename SomethingT>\n typename viennagrid::result_of::coord<SomethingT>::type\n boundary_distance(spatial_point<CoordT, CoordinateSystemT> const & el1,\n SomethingT const & el2)\n {\n return detail::boundary_distance_impl( default_point_accessor(el2), el1, el2 );\n }\n\n\n} \/\/namespace viennagrid\n#endif\n<commit_msg>Delete distance.hpp<commit_after><|endoftext|>"} {"text":"<commit_before>\/\/ Copyright (C) 2014 Oliver Schulz <oschulz@mpp.mpg.de>\n\n\/\/ This 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\n\/\/ the Free Software Foundation; either version 2.1 of the License, or\n\/\/ (at your option) any later version.\n\/\/\n\/\/ This software is distributed in the hope that it will be useful,\n\/\/ but WITHOUT ANY WARRANTY; without even the implied warranty of\n\/\/ MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU\n\/\/ Lesser General Public License for more details.\n\/\/\n\/\/ You should have received a copy of the GNU Lesser General Public\n\/\/ License along with this library; if not, write to the Free Software\n\/\/ Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA.\n\n\n#include \"Bric.h\"\n\n#include <iostream>\n#include <algorithm>\n\n#include \"TypeReflection.h\"\n\n#include \"format.h\"\n\n\nusing namespace std;\n\n\nnamespace dbrx {\n\n\n\nPropPath BricComponent::absolutePath() const {\n\treturn hasParent() ? parent().absolutePath() % name() : name();\n}\n\n\n\nvoid Bric::Terminal::connectInputToInner(Bric &bric, Name inputName, PropPath::Fragment sourcePath) {\n\tif (!sourcePath.empty()) throw runtime_error(\"Couldn't resolve source path %s during input lookup, terminal \\\"%s\\\" has no inner components\"_format(sourcePath, absolutePath()));\n\telse bric.connectOwnInputTo(inputName, *this);\n}\n\n\n\nconst Name Bric::s_defaultInputName(\"input\");\nconst Name Bric::s_defaultOutputName(\"output\");\nconst Name Bric::s_bricTypeKey(\"type\");\n\n\nvoid Bric::registerComponent(BricComponent* component) {\n\tif (component->name() == s_bricTypeKey) throw invalid_argument(\"Can't add component with reserved name \\\"%s\\\" to bric \\\"%s\\\"\"_format(component->name(), absolutePath()));\n\tif (component->name().empty()) throw invalid_argument(\"Can't register BricComponent with empty name in bric \\\"%s\\\"\"_format(absolutePath()));\n\n\tauto r = m_components.find(component->name());\n\tif (r != m_components.end()) throw invalid_argument(\"Can't add duplicate component with name \\\"%s\\\" to bric \\\"%s\\\"\"_format(component->name(), absolutePath()));\n\tm_components[component->name()] = component;\n}\n\n\nvoid Bric::registerBric(Bric* bric)\n\t{ registerComponent(bric); m_brics[bric->name()] = bric; }\n\nvoid Bric::registerTerminal(Terminal* terminal)\n\t{ registerComponent(terminal); m_terminals[terminal->name()] = terminal; }\n\nvoid Bric::registerParam(ParamTerminal* param)\n\t{ registerTerminal(param); m_params[param->name()] = param; }\n\nvoid Bric::registerOutput(OutputTerminal* output) {\n\tif (!canHaveOutputs()) throw invalid_argument(\"Bric \\\"%s\\\" cannot have outputs\"_format(absolutePath()));\n\tregisterTerminal(output);\n\tm_outputs[output->name()] = output;\n}\n\nvoid Bric::registerInput(InputTerminal* input) {\n\tif (!canHaveInputs()) throw invalid_argument(\"Bric \\\"%s\\\" cannot have inputs\"_format(absolutePath()));\n\tregisterTerminal(input);\n\tm_inputs[input->name()] = input;\n}\n\n\nvoid Bric::addDynBric(Name bricName, const std::string& className) {\n\tunique_ptr<Bric> dynBric(TypeReflection(className).newInstance<Bric>());\n\tregisterBric(dynBric.get());\n\tm_dynBrics[dynBric->name()] = std::move(dynBric);\n}\n\n\nvoid Bric::connectInputToInner(Bric &bric, Name inputName, PropPath::Fragment sourcePath) {\n\tif (sourcePath.empty()) {\n\t\tauto found = m_components.find(s_defaultOutputName);\n\t\tif (found != m_components.end()) found->second->connectInputToInner(bric, inputName, sourcePath);\n\t} else {\n\t\tauto found = m_components.find(sourcePath.front().asName());\n\t\tif (found != m_components.end()) found->second->connectInputToInner(bric, inputName, sourcePath.tail());\n\t\telse throw runtime_error(\"Couldn't resolve source path \\\"%s\\\" during input lookup, no such component in bric \\\"%s\\\"\"_format(sourcePath, absolutePath()));\n\t}\n}\n\n\nvoid Bric::connectInputToSiblingOrUp(Bric &bric, Name inputName, PropPath::Fragment sourcePath) {\n\tif (sourcePath.empty()) throw runtime_error(\"Empty source path during input lookup in bric \\\"%s\\\"\"_format(absolutePath()));\n\tName siblingName = sourcePath.front().asName();\n\tif (siblingName == name()) connectInputToInner(bric, inputName, sourcePath.tail());\n\telse {\n\t\tif (hasParent()) {\n\t\t\tauto found = parent().m_brics.find(siblingName);\n\t\t\tif (found != parent().m_brics.end()) {\n\t\t\t\tBric* sibling = found->second;\n\t\t\t\tsibling->connectInputToInner(bric, inputName, sourcePath.tail());\n\t\t\t\taddDependency(sibling);\n\t\t\t}\n\t\t} else throw runtime_error(\"Reached top-level Bric \\\"%s\\\" during input lookup\"_format(absolutePath()));\n\t}\n}\n\n\nvoid Bric::connectOwnInputTo(Name inputName, const Terminal& terminal) {\n\tauto found = m_inputs.find(inputName);\n\tif (found != m_inputs.end()) found->second->connectTo(terminal);\n\telse throw invalid_argument(\"Can't connect non-existing input \\\"%s\\\" to terminal \\\"%s\\\"\"_format(inputName, terminal.absolutePath()));\n}\n\n\nvoid Bric::applyConfig(const PropVal& config) {\n\tfor (const auto& entry: config.asProps()) {\n\t\tName componentName = entry.first.asName();\n\t\tconst PropVal& componentConfig = entry.second;\n\t\tif (componentName != s_bricTypeKey) {\n\t\t\tconst auto& found = m_components.find(componentName);\n\t\t\tif (found != m_components.end())\n\t\t\t\tm_components[entry.first.asName()]->applyConfig(componentConfig);\n\t\t\telse if (subBricsFromConfig()) {\n\t\t\t\tif (!componentConfig.isProps()) throw invalid_argument(\"Invalid configuration format for dynamic sub-bric \\\"%s\\\" in bric \\\"%s\\\"\"_format(componentName, absolutePath()));\n\t\t\t\tProps subBricProps = entry.second.asProps();\n\t\t\t\tconst std::string className = entry.second[s_bricTypeKey].asString();\n\t\t\t\taddDynBric(componentName, className);\n\t\t\t}\n\t\t\telse throw runtime_error(\"Invalid configuration, bric \\\"%s\\\" doesn't have a component named \\\"%s\\\"\"_format(absolutePath(), componentName));\n\t\t}\n\t}\n}\n\n\nPropVal Bric::getConfig() const {\n\tProps props;\n\tfor (const auto& entry: m_components) {\n\t\tPropVal componentConfig = entry.second->getConfig();\n\t\tif (! componentConfig.isNone())\tprops[entry.second->name()] = std::move(componentConfig);\n\t}\n\tprops[s_bricTypeKey] = TypeReflection(typeid(this)).name();\n\treturn PropVal(std::move(props));\n}\n\n\nconst Bric::Terminal& Bric::getTerminal(Name terminalName) const {\n\tauto r = m_terminals.find(terminalName);\n\tif (r == m_terminals.end()) throw invalid_argument(\"No terminal \\\"%s\\\" found in bric \\\"%s\\\"\"_format(terminalName, absolutePath()));\n\telse return *r->second;\n}\n\nBric::Terminal& Bric::getTerminal(Name terminalName) {\n\tauto r = m_terminals.find(terminalName);\n\tif (r == m_terminals.end()) throw invalid_argument(\"No terminal \\\"%s\\\" found in bric \\\"%s\\\"\"_format(terminalName, absolutePath()));\n\telse return *r->second;\n}\n\n\nconst Bric::Terminal& Bric::getTerminal(Name terminalName, const std::type_info& typeInfo) const {\n\tconst Bric::Terminal& terminal = getTerminal(terminalName);\n\tif (terminal.value().typeInfo() != typeInfo)\n\t\tthrow runtime_error(\"Type of terminal \\\"%s\\\" doesn't match requested type \\\"%s\\\"\"_format(terminal.absolutePath(), terminal.typeInfo().name()));\n\treturn terminal;\n}\n\nBric::Terminal& Bric::getTerminal(Name terminalName, const std::type_info& typeInfo) {\n\tBric::Terminal& terminal = getTerminal(terminalName);\n\tif (terminal.value().typeInfo() != typeInfo)\n\t\tthrow runtime_error(\"Type of terminal \\\"%s\\\" doesn't match requested type \\\"%s\\\"\"_format(terminal.absolutePath(), terminal.typeInfo().name()));\n\treturn terminal;\n}\n\n\nconst Bric::OutputTerminal& Bric::getOutput(Name outputName) const\n\t{ return dynamic_cast<const Bric::OutputTerminal&>(getTerminal(outputName)); }\n\nBric::OutputTerminal& Bric::getOutput(Name outputName)\n\t{ return dynamic_cast<Bric::OutputTerminal&>(getTerminal(outputName)); }\n\nconst Bric::OutputTerminal& Bric::getOutput(Name outputName, const std::type_info& typeInfo) const\n\t{ return dynamic_cast<const Bric::OutputTerminal&>(getTerminal(outputName, typeInfo)); }\n\nBric::OutputTerminal& Bric::getOutput(Name outputName, const std::type_info& typeInfo)\n\t{ return dynamic_cast<Bric::OutputTerminal&>(getTerminal(outputName, typeInfo)); }\n\n\nconst Bric::InputTerminal& Bric::getInput(Name inputName) const\n\t{ return dynamic_cast<const Bric::InputTerminal&>(getTerminal(inputName)); }\n\nBric::InputTerminal& Bric::getInput(Name inputName)\n\t{ return dynamic_cast<Bric::InputTerminal&>(getTerminal(inputName)); }\n\nconst Bric::InputTerminal& Bric::getInput(Name inputName, const std::type_info& typeInfo) const\n\t{ return dynamic_cast<const Bric::InputTerminal&>(getTerminal(inputName, typeInfo)); }\n\nBric::InputTerminal& Bric::getInput(Name inputName, const std::type_info& typeInfo)\n\t{ return dynamic_cast<Bric::InputTerminal&>(getTerminal(inputName, typeInfo)); }\n\n\nconst Bric::ParamTerminal& Bric::getParam(Name paramName) const\n\t{ return dynamic_cast<const Bric::ParamTerminal&>(getTerminal(paramName)); }\n\nBric::ParamTerminal& Bric::getParam(Name paramName)\n\t{ return dynamic_cast<Bric::ParamTerminal&>(getTerminal(paramName)); }\n\nconst Bric::ParamTerminal& Bric::getParam(Name paramName, const std::type_info& typeInfo) const\n\t{ return dynamic_cast<const Bric::ParamTerminal&>(getTerminal(paramName, typeInfo)); }\n\nBric::ParamTerminal& Bric::getParam(Name paramName, const std::type_info& typeInfo)\n\t{ return dynamic_cast<Bric::ParamTerminal&>(getTerminal(paramName, typeInfo)); }\n\n\nvoid Bric::connectInputs() {\n\tm_deps.clear();\n\tfor (const auto& input: m_inputs)\n\t\tconnectInputToSiblingOrUp(*this, input.second->name(), input.second->source());\n\tfor (const auto& brics: m_brics)\n\t\tbrics.second->connectInputs();\n}\n\n\nstd::ostream & Bric::printInfo(std::ostream &os) const {\n\tos << \"Bric \" << name() << \":\" << endl;\n\n\tif (! m_inputs.empty()) {\n\t\tos << \" Inputs: \";\n\t\tfor (auto const &x: m_inputs) os << \" \" << x.second->name() << \"(\" << x.second->value().typeInfo().name() << \")\";\n\t\tos << endl;\n\t}\n\n\tif (! m_outputs.empty()) {\n\t\tos << \" Outputs: \";\n\t\tfor (auto const &x: m_outputs) os << \" \" << x.second->name() << \"(\" << x.second->value().typeInfo().name() << \")\";\n\t\tos << endl;\n\t}\n\n\tif (! m_params.empty()) {\n\t\tos << \" Params: \";\n\t\tfor (auto const &x: m_params) os << \" \" << x.second->name() << \"(\" << x.second->value().typeInfo().name() << \")\";\n\t\tos << endl;\n\t}\n\n\treturn os;\n}\n\n\n} \/\/ namespace dbrx\n<commit_msg>Fixed Bric implementation, using at() instead of operator[] for map reads<commit_after>\/\/ Copyright (C) 2014 Oliver Schulz <oschulz@mpp.mpg.de>\n\n\/\/ This 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\n\/\/ the Free Software Foundation; either version 2.1 of the License, or\n\/\/ (at your option) any later version.\n\/\/\n\/\/ This software is distributed in the hope that it will be useful,\n\/\/ but WITHOUT ANY WARRANTY; without even the implied warranty of\n\/\/ MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU\n\/\/ Lesser General Public License for more details.\n\/\/\n\/\/ You should have received a copy of the GNU Lesser General Public\n\/\/ License along with this library; if not, write to the Free Software\n\/\/ Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA.\n\n\n#include \"Bric.h\"\n\n#include <iostream>\n#include <algorithm>\n\n#include \"TypeReflection.h\"\n\n#include \"format.h\"\n\n\nusing namespace std;\n\n\nnamespace dbrx {\n\n\n\nPropPath BricComponent::absolutePath() const {\n\treturn hasParent() ? parent().absolutePath() % name() : name();\n}\n\n\n\nvoid Bric::Terminal::connectInputToInner(Bric &bric, Name inputName, PropPath::Fragment sourcePath) {\n\tif (!sourcePath.empty()) throw runtime_error(\"Couldn't resolve source path %s during input lookup, terminal \\\"%s\\\" has no inner components\"_format(sourcePath, absolutePath()));\n\telse bric.connectOwnInputTo(inputName, *this);\n}\n\n\n\nconst Name Bric::s_defaultInputName(\"input\");\nconst Name Bric::s_defaultOutputName(\"output\");\nconst Name Bric::s_bricTypeKey(\"type\");\n\n\nvoid Bric::registerComponent(BricComponent* component) {\n\tif (component->name() == s_bricTypeKey) throw invalid_argument(\"Can't add component with reserved name \\\"%s\\\" to bric \\\"%s\\\"\"_format(component->name(), absolutePath()));\n\tif (component->name().empty()) throw invalid_argument(\"Can't register BricComponent with empty name in bric \\\"%s\\\"\"_format(absolutePath()));\n\n\tauto r = m_components.find(component->name());\n\tif (r != m_components.end()) throw invalid_argument(\"Can't add duplicate component with name \\\"%s\\\" to bric \\\"%s\\\"\"_format(component->name(), absolutePath()));\n\tm_components[component->name()] = component;\n}\n\n\nvoid Bric::registerBric(Bric* bric)\n\t{ registerComponent(bric); m_brics[bric->name()] = bric; }\n\nvoid Bric::registerTerminal(Terminal* terminal)\n\t{ registerComponent(terminal); m_terminals[terminal->name()] = terminal; }\n\nvoid Bric::registerParam(ParamTerminal* param)\n\t{ registerTerminal(param); m_params[param->name()] = param; }\n\nvoid Bric::registerOutput(OutputTerminal* output) {\n\tif (!canHaveOutputs()) throw invalid_argument(\"Bric \\\"%s\\\" cannot have outputs\"_format(absolutePath()));\n\tregisterTerminal(output);\n\tm_outputs[output->name()] = output;\n}\n\nvoid Bric::registerInput(InputTerminal* input) {\n\tif (!canHaveInputs()) throw invalid_argument(\"Bric \\\"%s\\\" cannot have inputs\"_format(absolutePath()));\n\tregisterTerminal(input);\n\tm_inputs[input->name()] = input;\n}\n\n\nvoid Bric::addDynBric(Name bricName, const std::string& className) {\n\tunique_ptr<Bric> dynBric(TypeReflection(className).newInstance<Bric>());\n\tregisterBric(dynBric.get());\n\tm_dynBrics[dynBric->name()] = std::move(dynBric);\n}\n\n\nvoid Bric::connectInputToInner(Bric &bric, Name inputName, PropPath::Fragment sourcePath) {\n\tif (sourcePath.empty()) {\n\t\tauto found = m_components.find(s_defaultOutputName);\n\t\tif (found != m_components.end()) found->second->connectInputToInner(bric, inputName, sourcePath);\n\t} else {\n\t\tauto found = m_components.find(sourcePath.front().asName());\n\t\tif (found != m_components.end()) found->second->connectInputToInner(bric, inputName, sourcePath.tail());\n\t\telse throw runtime_error(\"Couldn't resolve source path \\\"%s\\\" during input lookup, no such component in bric \\\"%s\\\"\"_format(sourcePath, absolutePath()));\n\t}\n}\n\n\nvoid Bric::connectInputToSiblingOrUp(Bric &bric, Name inputName, PropPath::Fragment sourcePath) {\n\tif (sourcePath.empty()) throw runtime_error(\"Empty source path during input lookup in bric \\\"%s\\\"\"_format(absolutePath()));\n\tName siblingName = sourcePath.front().asName();\n\tif (siblingName == name()) connectInputToInner(bric, inputName, sourcePath.tail());\n\telse {\n\t\tif (hasParent()) {\n\t\t\tauto found = parent().m_brics.find(siblingName);\n\t\t\tif (found != parent().m_brics.end()) {\n\t\t\t\tBric* sibling = found->second;\n\t\t\t\tsibling->connectInputToInner(bric, inputName, sourcePath.tail());\n\t\t\t\taddDependency(sibling);\n\t\t\t}\n\t\t} else throw runtime_error(\"Reached top-level Bric \\\"%s\\\" during input lookup\"_format(absolutePath()));\n\t}\n}\n\n\nvoid Bric::connectOwnInputTo(Name inputName, const Terminal& terminal) {\n\tauto found = m_inputs.find(inputName);\n\tif (found != m_inputs.end()) found->second->connectTo(terminal);\n\telse throw invalid_argument(\"Can't connect non-existing input \\\"%s\\\" to terminal \\\"%s\\\"\"_format(inputName, terminal.absolutePath()));\n}\n\n\nvoid Bric::applyConfig(const PropVal& config) {\n\tfor (const auto& entry: config.asProps()) {\n\t\tName componentName = entry.first.asName();\n\t\tconst PropVal& componentConfig = entry.second;\n\t\tif (componentName != s_bricTypeKey) {\n\t\t\tconst auto& found = m_components.find(componentName);\n\t\t\tif (found != m_components.end())\n\t\t\t\tm_components.at(entry.first.asName())->applyConfig(componentConfig);\n\t\t\telse if (subBricsFromConfig()) {\n\t\t\t\tif (!componentConfig.isProps()) throw invalid_argument(\"Invalid configuration format for dynamic sub-bric \\\"%s\\\" in bric \\\"%s\\\"\"_format(componentName, absolutePath()));\n\t\t\t\tProps subBricProps = entry.second.asProps();\n\t\t\t\tconst std::string className = entry.second.at(s_bricTypeKey).asString();\n\t\t\t\taddDynBric(componentName, className);\n\t\t\t}\n\t\t\telse throw runtime_error(\"Invalid configuration, bric \\\"%s\\\" doesn't have a component named \\\"%s\\\"\"_format(absolutePath(), componentName));\n\t\t}\n\t}\n}\n\n\nPropVal Bric::getConfig() const {\n\tProps props;\n\tfor (const auto& entry: m_components) {\n\t\tPropVal componentConfig = entry.second->getConfig();\n\t\tif (! componentConfig.isNone())\tprops[entry.second->name()] = std::move(componentConfig);\n\t}\n\tprops[s_bricTypeKey] = TypeReflection(typeid(this)).name();\n\treturn PropVal(std::move(props));\n}\n\n\nconst Bric::Terminal& Bric::getTerminal(Name terminalName) const {\n\tauto r = m_terminals.find(terminalName);\n\tif (r == m_terminals.end()) throw invalid_argument(\"No terminal \\\"%s\\\" found in bric \\\"%s\\\"\"_format(terminalName, absolutePath()));\n\telse return *r->second;\n}\n\nBric::Terminal& Bric::getTerminal(Name terminalName) {\n\tauto r = m_terminals.find(terminalName);\n\tif (r == m_terminals.end()) throw invalid_argument(\"No terminal \\\"%s\\\" found in bric \\\"%s\\\"\"_format(terminalName, absolutePath()));\n\telse return *r->second;\n}\n\n\nconst Bric::Terminal& Bric::getTerminal(Name terminalName, const std::type_info& typeInfo) const {\n\tconst Bric::Terminal& terminal = getTerminal(terminalName);\n\tif (terminal.value().typeInfo() != typeInfo)\n\t\tthrow runtime_error(\"Type of terminal \\\"%s\\\" doesn't match requested type \\\"%s\\\"\"_format(terminal.absolutePath(), terminal.typeInfo().name()));\n\treturn terminal;\n}\n\nBric::Terminal& Bric::getTerminal(Name terminalName, const std::type_info& typeInfo) {\n\tBric::Terminal& terminal = getTerminal(terminalName);\n\tif (terminal.value().typeInfo() != typeInfo)\n\t\tthrow runtime_error(\"Type of terminal \\\"%s\\\" doesn't match requested type \\\"%s\\\"\"_format(terminal.absolutePath(), terminal.typeInfo().name()));\n\treturn terminal;\n}\n\n\nconst Bric::OutputTerminal& Bric::getOutput(Name outputName) const\n\t{ return dynamic_cast<const Bric::OutputTerminal&>(getTerminal(outputName)); }\n\nBric::OutputTerminal& Bric::getOutput(Name outputName)\n\t{ return dynamic_cast<Bric::OutputTerminal&>(getTerminal(outputName)); }\n\nconst Bric::OutputTerminal& Bric::getOutput(Name outputName, const std::type_info& typeInfo) const\n\t{ return dynamic_cast<const Bric::OutputTerminal&>(getTerminal(outputName, typeInfo)); }\n\nBric::OutputTerminal& Bric::getOutput(Name outputName, const std::type_info& typeInfo)\n\t{ return dynamic_cast<Bric::OutputTerminal&>(getTerminal(outputName, typeInfo)); }\n\n\nconst Bric::InputTerminal& Bric::getInput(Name inputName) const\n\t{ return dynamic_cast<const Bric::InputTerminal&>(getTerminal(inputName)); }\n\nBric::InputTerminal& Bric::getInput(Name inputName)\n\t{ return dynamic_cast<Bric::InputTerminal&>(getTerminal(inputName)); }\n\nconst Bric::InputTerminal& Bric::getInput(Name inputName, const std::type_info& typeInfo) const\n\t{ return dynamic_cast<const Bric::InputTerminal&>(getTerminal(inputName, typeInfo)); }\n\nBric::InputTerminal& Bric::getInput(Name inputName, const std::type_info& typeInfo)\n\t{ return dynamic_cast<Bric::InputTerminal&>(getTerminal(inputName, typeInfo)); }\n\n\nconst Bric::ParamTerminal& Bric::getParam(Name paramName) const\n\t{ return dynamic_cast<const Bric::ParamTerminal&>(getTerminal(paramName)); }\n\nBric::ParamTerminal& Bric::getParam(Name paramName)\n\t{ return dynamic_cast<Bric::ParamTerminal&>(getTerminal(paramName)); }\n\nconst Bric::ParamTerminal& Bric::getParam(Name paramName, const std::type_info& typeInfo) const\n\t{ return dynamic_cast<const Bric::ParamTerminal&>(getTerminal(paramName, typeInfo)); }\n\nBric::ParamTerminal& Bric::getParam(Name paramName, const std::type_info& typeInfo)\n\t{ return dynamic_cast<Bric::ParamTerminal&>(getTerminal(paramName, typeInfo)); }\n\n\nvoid Bric::connectInputs() {\n\tm_deps.clear();\n\tfor (const auto& input: m_inputs)\n\t\tconnectInputToSiblingOrUp(*this, input.second->name(), input.second->source());\n\tfor (const auto& brics: m_brics)\n\t\tbrics.second->connectInputs();\n}\n\n\nstd::ostream & Bric::printInfo(std::ostream &os) const {\n\tos << \"Bric \" << name() << \":\" << endl;\n\n\tif (! m_inputs.empty()) {\n\t\tos << \" Inputs: \";\n\t\tfor (auto const &x: m_inputs) os << \" \" << x.second->name() << \"(\" << x.second->value().typeInfo().name() << \")\";\n\t\tos << endl;\n\t}\n\n\tif (! m_outputs.empty()) {\n\t\tos << \" Outputs: \";\n\t\tfor (auto const &x: m_outputs) os << \" \" << x.second->name() << \"(\" << x.second->value().typeInfo().name() << \")\";\n\t\tos << endl;\n\t}\n\n\tif (! m_params.empty()) {\n\t\tos << \" Params: \";\n\t\tfor (auto const &x: m_params) os << \" \" << x.second->name() << \"(\" << x.second->value().typeInfo().name() << \")\";\n\t\tos << endl;\n\t}\n\n\treturn os;\n}\n\n\n} \/\/ namespace dbrx\n<|endoftext|>"} {"text":"<commit_before>\/\/ Copyright (c) 2009 The Chromium Authors. All rights reserved.\n\/\/ Use of this source code is governed by a BSD-style license that can be\n\/\/ found in the LICENSE file.\n\n#include \"chrome\/renderer\/devtools_agent_filter.h\"\n\n#include \"base\/message_loop.h\"\n#include \"chrome\/common\/devtools_messages.h\"\n#include \"chrome\/common\/render_messages.h\"\n#include \"chrome\/renderer\/devtools_agent.h\"\n#include \"chrome\/renderer\/plugin_channel_host.h\"\n#include \"chrome\/renderer\/render_view.h\"\n#include \"third_party\/WebKit\/WebKit\/chromium\/public\/WebDevToolsAgent.h\"\n#include \"third_party\/WebKit\/WebKit\/chromium\/public\/WebDevToolsMessageData.h\"\n#include \"third_party\/WebKit\/WebKit\/chromium\/public\/WebString.h\"\n#include \"webkit\/glue\/devtools_message_data.h\"\n\nusing WebKit::WebDevToolsAgent;\nusing WebKit::WebString;\n\n\/\/ static\nvoid DevToolsAgentFilter::DispatchMessageLoop() {\n MessageLoop* current = MessageLoop::current();\n bool old_state = current->NestableTasksAllowed();\n current->SetNestableTasksAllowed(true);\n current->RunAllPending();\n current->SetNestableTasksAllowed(old_state);\n}\n\n\/\/ static\nIPC::Channel* DevToolsAgentFilter::channel_ = NULL;\n\/\/ static\nint DevToolsAgentFilter::current_routing_id_ = 0;\n\nDevToolsAgentFilter::DevToolsAgentFilter()\n : message_handled_(false) {\n WebDevToolsAgent::setMessageLoopDispatchHandler(\n &DevToolsAgentFilter::DispatchMessageLoop);\n}\n\nDevToolsAgentFilter::~DevToolsAgentFilter() {\n}\n\nbool DevToolsAgentFilter::OnMessageReceived(const IPC::Message& message) {\n \/\/ Dispatch debugger commands directly from IO.\n message_handled_ = true;\n current_routing_id_ = message.routing_id();\n IPC_BEGIN_MESSAGE_MAP(DevToolsAgentFilter, message)\n IPC_MESSAGE_HANDLER(DevToolsAgentMsg_DebuggerCommand, OnDebuggerCommand)\n IPC_MESSAGE_HANDLER(DevToolsAgentMsg_DebuggerPauseScript,\n OnDebuggerPauseScript)\n IPC_MESSAGE_HANDLER(DevToolsAgentMsg_RpcMessage, OnRpcMessage)\n IPC_MESSAGE_UNHANDLED(message_handled_ = false)\n IPC_END_MESSAGE_MAP()\n return message_handled_;\n}\n\nvoid DevToolsAgentFilter::OnDebuggerCommand(const std::string& command) {\n WebDevToolsAgent::executeDebuggerCommand(\n WebString::fromUTF8(command), current_routing_id_);\n}\n\nvoid DevToolsAgentFilter::OnDebuggerPauseScript() {\n WebDevToolsAgent::debuggerPauseScript();\n}\n\nvoid DevToolsAgentFilter::OnRpcMessage(const DevToolsMessageData& data) {\n message_handled_ = WebDevToolsAgent::dispatchMessageFromFrontendOnIOThread(\n data.ToWebDevToolsMessageData());\n}\n\n\/\/ static\nvoid DevToolsAgentFilter::SendRpcMessage(const DevToolsMessageData& data) {\n IPC::Message* m = new ViewHostMsg_ForwardToDevToolsClient(\n current_routing_id_,\n DevToolsClientMsg_RpcMessage(data));\n channel_->Send(m);\n}\n<commit_msg>Make WebDevToolsAgentClient::sendMessageToFrontendOnIOThread virtual.<commit_after>\/\/ Copyright (c) 2009 The Chromium Authors. All rights reserved.\n\/\/ Use of this source code is governed by a BSD-style license that can be\n\/\/ found in the LICENSE file.\n\n#include \"chrome\/renderer\/devtools_agent_filter.h\"\n\n#include \"base\/message_loop.h\"\n#include \"chrome\/common\/devtools_messages.h\"\n#include \"chrome\/common\/render_messages.h\"\n#include \"chrome\/renderer\/devtools_agent.h\"\n#include \"chrome\/renderer\/plugin_channel_host.h\"\n#include \"chrome\/renderer\/render_view.h\"\n#include \"third_party\/WebKit\/WebKit\/chromium\/public\/WebDevToolsAgent.h\"\n#include \"third_party\/WebKit\/WebKit\/chromium\/public\/WebDevToolsMessageData.h\"\n#include \"third_party\/WebKit\/WebKit\/chromium\/public\/WebString.h\"\n#include \"webkit\/glue\/devtools_message_data.h\"\n\nusing WebKit::WebDevToolsAgent;\nusing WebKit::WebDevToolsMessageData;\nusing WebKit::WebDevToolsMessageTransport;\nusing WebKit::WebString;\n\n\/\/ static\nvoid DevToolsAgentFilter::DispatchMessageLoop() {\n MessageLoop* current = MessageLoop::current();\n bool old_state = current->NestableTasksAllowed();\n current->SetNestableTasksAllowed(true);\n current->RunAllPending();\n current->SetNestableTasksAllowed(old_state);\n}\n\n\/\/ static\nIPC::Channel* DevToolsAgentFilter::channel_ = NULL;\n\/\/ static\nint DevToolsAgentFilter::current_routing_id_ = 0;\n\nDevToolsAgentFilter::DevToolsAgentFilter()\n : message_handled_(false) {\n WebDevToolsAgent::setMessageLoopDispatchHandler(\n &DevToolsAgentFilter::DispatchMessageLoop);\n}\n\nDevToolsAgentFilter::~DevToolsAgentFilter() {\n}\n\nbool DevToolsAgentFilter::OnMessageReceived(const IPC::Message& message) {\n \/\/ Dispatch debugger commands directly from IO.\n message_handled_ = true;\n current_routing_id_ = message.routing_id();\n IPC_BEGIN_MESSAGE_MAP(DevToolsAgentFilter, message)\n IPC_MESSAGE_HANDLER(DevToolsAgentMsg_DebuggerCommand, OnDebuggerCommand)\n IPC_MESSAGE_HANDLER(DevToolsAgentMsg_DebuggerPauseScript,\n OnDebuggerPauseScript)\n IPC_MESSAGE_HANDLER(DevToolsAgentMsg_RpcMessage, OnRpcMessage)\n IPC_MESSAGE_UNHANDLED(message_handled_ = false)\n IPC_END_MESSAGE_MAP()\n return message_handled_;\n}\n\nvoid DevToolsAgentFilter::OnDebuggerCommand(const std::string& command) {\n WebDevToolsAgent::executeDebuggerCommand(\n WebString::fromUTF8(command), current_routing_id_);\n}\n\nvoid DevToolsAgentFilter::OnDebuggerPauseScript() {\n WebDevToolsAgent::debuggerPauseScript();\n}\n\nnamespace {\n\nclass WebDevToolsMessageTransportImpl : public WebDevToolsMessageTransport {\n public:\n void sendMessageToFrontendOnIOThread(const WebDevToolsMessageData& data) {\n DevToolsAgentFilter::SendRpcMessage(DevToolsMessageData(data));\n }\n};\n\n} \/\/ namespace\n\nvoid DevToolsAgentFilter::OnRpcMessage(const DevToolsMessageData& data) {\n WebDevToolsMessageTransportImpl transport;\n message_handled_ = WebDevToolsAgent::dispatchMessageFromFrontendOnIOThread(\n &transport,\n data.ToWebDevToolsMessageData());\n}\n\n\/\/ static\nvoid DevToolsAgentFilter::SendRpcMessage(const DevToolsMessageData& data) {\n IPC::Message* m = new ViewHostMsg_ForwardToDevToolsClient(\n current_routing_id_,\n DevToolsClientMsg_RpcMessage(data));\n channel_->Send(m);\n}\n<|endoftext|>"} {"text":"<commit_before>\/\/ Copyright (c) 2009 The Chromium Authors. All rights reserved.\n\/\/ Use of this source code is governed by a BSD-style license that can be\n\/\/ found in the LICENSE file.\n\n#include \"chrome\/renderer\/notification_provider.h\"\n\n#include \"base\/string_util.h\"\n#include \"base\/task.h\"\n#include \"chrome\/common\/render_messages.h\"\n#include \"chrome\/common\/url_constants.h\"\n#include \"chrome\/renderer\/render_thread.h\"\n#include \"chrome\/renderer\/render_view.h\"\n#include \"third_party\/WebKit\/WebKit\/chromium\/public\/WebDocument.h\"\n#include \"third_party\/WebKit\/WebKit\/chromium\/public\/WebFrame.h\"\n#include \"third_party\/WebKit\/WebKit\/chromium\/public\/WebNotificationPermissionCallback.h\"\n#include \"third_party\/WebKit\/WebKit\/chromium\/public\/WebURL.h\"\n\nusing WebKit::WebDocument;\nusing WebKit::WebNotification;\nusing WebKit::WebNotificationPresenter;\nusing WebKit::WebNotificationPermissionCallback;\nusing WebKit::WebString;\nusing WebKit::WebURL;\n\nNotificationProvider::NotificationProvider(RenderView* view)\n : view_(view) {\n}\n\nbool NotificationProvider::show(const WebNotification& notification) {\n int notification_id = manager_.RegisterNotification(notification);\n if (notification.isHTML())\n return ShowHTML(notification, notification_id);\n else\n return ShowText(notification, notification_id);\n}\n\nvoid NotificationProvider::cancel(const WebNotification& notification) {\n int id;\n bool id_found = manager_.GetId(notification, id);\n \/\/ Won't be found if the notification has already been closed by the user.\n if (id_found)\n Send(new ViewHostMsg_CancelDesktopNotification(view_->routing_id(), id));\n}\n\nvoid NotificationProvider::objectDestroyed(\n const WebNotification& notification) {\n int id;\n bool id_found = manager_.GetId(notification, id);\n \/\/ Won't be found if the notification has already been closed by the user.\n if (id_found)\n manager_.UnregisterNotification(id);\n}\n\nWebNotificationPresenter::Permission NotificationProvider::checkPermission(\n const WebURL& url, WebDocument* document) {\n int permission;\n Send(new ViewHostMsg_CheckNotificationPermission(\n view_->routing_id(),\n url,\n document ? UTF16ToASCII(document->applicationID()) : \"\",\n &permission));\n return static_cast<WebNotificationPresenter::Permission>(permission);\n}\n\nvoid NotificationProvider::requestPermission(\n const WebString& origin, WebNotificationPermissionCallback* callback) {\n \/\/ We only request permission in response to a user gesture.\n if (!view_->webview()->mainFrame()->isProcessingUserGesture())\n return;\n\n int id = manager_.RegisterPermissionRequest(callback);\n\n Send(new ViewHostMsg_RequestNotificationPermission(view_->routing_id(),\n GURL(origin), id));\n}\n\nbool NotificationProvider::OnMessageReceived(const IPC::Message& message) {\n bool handled = true;\n IPC_BEGIN_MESSAGE_MAP(NotificationProvider, message)\n IPC_MESSAGE_HANDLER(ViewMsg_PostDisplayToNotificationObject, OnDisplay);\n IPC_MESSAGE_HANDLER(ViewMsg_PostErrorToNotificationObject, OnError);\n IPC_MESSAGE_HANDLER(ViewMsg_PostCloseToNotificationObject, OnClose);\n IPC_MESSAGE_HANDLER(ViewMsg_PermissionRequestDone,\n OnPermissionRequestComplete);\n IPC_MESSAGE_UNHANDLED(handled = false)\n IPC_END_MESSAGE_MAP()\n return handled;\n}\n\nvoid NotificationProvider::OnNavigate() {\n \/\/ manager_.Clear();\n}\n\nbool NotificationProvider::ShowHTML(const WebNotification& notification,\n int id) {\n \/\/ Disallow HTML notifications from non-HTTP schemes.\n GURL url = notification.url();\n if (!url.SchemeIs(chrome::kHttpScheme) &&\n !url.SchemeIs(chrome::kHttpsScheme) &&\n !url.SchemeIs(chrome::kExtensionScheme))\n return false;\n\n DCHECK(notification.isHTML());\n return Send(new ViewHostMsg_ShowDesktopNotification(view_->routing_id(),\n GURL(view_->webview()->mainFrame()->url()).GetOrigin(),\n notification.url(), id));\n}\n\nbool NotificationProvider::ShowText(const WebNotification& notification,\n int id) {\n DCHECK(!notification.isHTML());\n return Send(new ViewHostMsg_ShowDesktopNotificationText(view_->routing_id(),\n GURL(view_->webview()->mainFrame()->url()).GetOrigin(),\n GURL(notification.icon()),\n notification.title(), notification.body(), id));\n}\n\nvoid NotificationProvider::OnDisplay(int id) {\n WebNotification notification;\n bool found = manager_.GetNotification(id, ¬ification);\n \/\/ |found| may be false if the WebNotification went out of scope in\n \/\/ the page before it was actually displayed to the user.\n if (found)\n notification.dispatchDisplayEvent();\n}\n\nvoid NotificationProvider::OnError(int id, const WebString& message) {\n WebNotification notification;\n bool found = manager_.GetNotification(id, ¬ification);\n \/\/ |found| may be false if the WebNotification went out of scope in\n \/\/ the page before the error occurred.\n if (found)\n notification.dispatchErrorEvent(message);\n}\n\nvoid NotificationProvider::OnClose(int id, bool by_user) {\n WebNotification notification;\n bool found = manager_.GetNotification(id, ¬ification);\n \/\/ |found| may be false if the WebNotification went out of scope in\n \/\/ the page before the associated toast was closed by the user.\n if (found) {\n notification.dispatchCloseEvent(by_user);\n manager_.UnregisterNotification(id);\n }\n}\n\nvoid NotificationProvider::OnPermissionRequestComplete(int id) {\n WebNotificationPermissionCallback* callback = manager_.GetCallback(id);\n DCHECK(callback);\n callback->permissionRequestComplete();\n manager_.OnPermissionRequestComplete(id);\n}\n\nbool NotificationProvider::Send(IPC::Message* message) {\n return RenderThread::current()->Send(message);\n}\n<commit_msg>Correct a mistake I made on a previous submission by commenting out an important line!<commit_after>\/\/ Copyright (c) 2009 The Chromium Authors. All rights reserved.\n\/\/ Use of this source code is governed by a BSD-style license that can be\n\/\/ found in the LICENSE file.\n\n#include \"chrome\/renderer\/notification_provider.h\"\n\n#include \"base\/string_util.h\"\n#include \"base\/task.h\"\n#include \"chrome\/common\/render_messages.h\"\n#include \"chrome\/common\/url_constants.h\"\n#include \"chrome\/renderer\/render_thread.h\"\n#include \"chrome\/renderer\/render_view.h\"\n#include \"third_party\/WebKit\/WebKit\/chromium\/public\/WebDocument.h\"\n#include \"third_party\/WebKit\/WebKit\/chromium\/public\/WebFrame.h\"\n#include \"third_party\/WebKit\/WebKit\/chromium\/public\/WebNotificationPermissionCallback.h\"\n#include \"third_party\/WebKit\/WebKit\/chromium\/public\/WebURL.h\"\n\nusing WebKit::WebDocument;\nusing WebKit::WebNotification;\nusing WebKit::WebNotificationPresenter;\nusing WebKit::WebNotificationPermissionCallback;\nusing WebKit::WebString;\nusing WebKit::WebURL;\n\nNotificationProvider::NotificationProvider(RenderView* view)\n : view_(view) {\n}\n\nbool NotificationProvider::show(const WebNotification& notification) {\n int notification_id = manager_.RegisterNotification(notification);\n if (notification.isHTML())\n return ShowHTML(notification, notification_id);\n else\n return ShowText(notification, notification_id);\n}\n\nvoid NotificationProvider::cancel(const WebNotification& notification) {\n int id;\n bool id_found = manager_.GetId(notification, id);\n \/\/ Won't be found if the notification has already been closed by the user.\n if (id_found)\n Send(new ViewHostMsg_CancelDesktopNotification(view_->routing_id(), id));\n}\n\nvoid NotificationProvider::objectDestroyed(\n const WebNotification& notification) {\n int id;\n bool id_found = manager_.GetId(notification, id);\n \/\/ Won't be found if the notification has already been closed by the user.\n if (id_found)\n manager_.UnregisterNotification(id);\n}\n\nWebNotificationPresenter::Permission NotificationProvider::checkPermission(\n const WebURL& url, WebDocument* document) {\n int permission;\n Send(new ViewHostMsg_CheckNotificationPermission(\n view_->routing_id(),\n url,\n document ? UTF16ToASCII(document->applicationID()) : \"\",\n &permission));\n return static_cast<WebNotificationPresenter::Permission>(permission);\n}\n\nvoid NotificationProvider::requestPermission(\n const WebString& origin, WebNotificationPermissionCallback* callback) {\n \/\/ We only request permission in response to a user gesture.\n if (!view_->webview()->mainFrame()->isProcessingUserGesture())\n return;\n\n int id = manager_.RegisterPermissionRequest(callback);\n\n Send(new ViewHostMsg_RequestNotificationPermission(view_->routing_id(),\n GURL(origin), id));\n}\n\nbool NotificationProvider::OnMessageReceived(const IPC::Message& message) {\n bool handled = true;\n IPC_BEGIN_MESSAGE_MAP(NotificationProvider, message)\n IPC_MESSAGE_HANDLER(ViewMsg_PostDisplayToNotificationObject, OnDisplay);\n IPC_MESSAGE_HANDLER(ViewMsg_PostErrorToNotificationObject, OnError);\n IPC_MESSAGE_HANDLER(ViewMsg_PostCloseToNotificationObject, OnClose);\n IPC_MESSAGE_HANDLER(ViewMsg_PermissionRequestDone,\n OnPermissionRequestComplete);\n IPC_MESSAGE_UNHANDLED(handled = false)\n IPC_END_MESSAGE_MAP()\n return handled;\n}\n\nvoid NotificationProvider::OnNavigate() {\n manager_.Clear();\n}\n\nbool NotificationProvider::ShowHTML(const WebNotification& notification,\n int id) {\n \/\/ Disallow HTML notifications from non-HTTP schemes.\n GURL url = notification.url();\n if (!url.SchemeIs(chrome::kHttpScheme) &&\n !url.SchemeIs(chrome::kHttpsScheme) &&\n !url.SchemeIs(chrome::kExtensionScheme))\n return false;\n\n DCHECK(notification.isHTML());\n return Send(new ViewHostMsg_ShowDesktopNotification(view_->routing_id(),\n GURL(view_->webview()->mainFrame()->url()).GetOrigin(),\n notification.url(), id));\n}\n\nbool NotificationProvider::ShowText(const WebNotification& notification,\n int id) {\n DCHECK(!notification.isHTML());\n return Send(new ViewHostMsg_ShowDesktopNotificationText(view_->routing_id(),\n GURL(view_->webview()->mainFrame()->url()).GetOrigin(),\n GURL(notification.icon()),\n notification.title(), notification.body(), id));\n}\n\nvoid NotificationProvider::OnDisplay(int id) {\n WebNotification notification;\n bool found = manager_.GetNotification(id, ¬ification);\n \/\/ |found| may be false if the WebNotification went out of scope in\n \/\/ the page before it was actually displayed to the user.\n if (found)\n notification.dispatchDisplayEvent();\n}\n\nvoid NotificationProvider::OnError(int id, const WebString& message) {\n WebNotification notification;\n bool found = manager_.GetNotification(id, ¬ification);\n \/\/ |found| may be false if the WebNotification went out of scope in\n \/\/ the page before the error occurred.\n if (found)\n notification.dispatchErrorEvent(message);\n}\n\nvoid NotificationProvider::OnClose(int id, bool by_user) {\n WebNotification notification;\n bool found = manager_.GetNotification(id, ¬ification);\n \/\/ |found| may be false if the WebNotification went out of scope in\n \/\/ the page before the associated toast was closed by the user.\n if (found) {\n notification.dispatchCloseEvent(by_user);\n manager_.UnregisterNotification(id);\n }\n}\n\nvoid NotificationProvider::OnPermissionRequestComplete(int id) {\n WebNotificationPermissionCallback* callback = manager_.GetCallback(id);\n DCHECK(callback);\n callback->permissionRequestComplete();\n manager_.OnPermissionRequestComplete(id);\n}\n\nbool NotificationProvider::Send(IPC::Message* message) {\n return RenderThread::current()->Send(message);\n}\n<|endoftext|>"} {"text":"<commit_before>\/\/ Copyright (c) 2011-2014, Cornell University\n\/\/ All rights reserved.\n\/\/\n\/\/ Redistribution and use in source and binary forms, with or without\n\/\/ modification, are permitted provided that the following conditions are met:\n\/\/\n\/\/ * Redistributions of source code must retain the above copyright notice,\n\/\/ this list of conditions and the following disclaimer.\n\/\/ * Redistributions in binary form must reproduce the above copyright\n\/\/ notice, this list of conditions and the following disclaimer in the\n\/\/ documentation and\/or other materials provided with the distribution.\n\/\/ * Neither the name of HyperDex nor the names of its contributors may be\n\/\/ used to endorse or promote products derived from this software without\n\/\/ specific prior written permission.\n\/\/\n\/\/ THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS \"AS IS\"\n\/\/ AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE\n\/\/ IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE\n\/\/ ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE\n\/\/ LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR\n\/\/ CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF\n\/\/ SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS\n\/\/ INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN\n\/\/ CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)\n\/\/ ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE\n\/\/ POSSIBILITY OF SUCH DAMAGE.\n\n#define __STDC_LIMIT_MACROS\n\n\/\/ Google Log\n#include <glog\/logging.h>\n\n\/\/ po6\n#include <po6\/net\/ipaddr.h>\n#include <po6\/net\/hostname.h>\n\n\/\/ e\n#include <e\/popt.h>\n\n\/\/ BusyBee\n#include <busybee_utils.h>\n\n\/\/ HyperDex\n#include \"daemon\/daemon.h\"\n\nint\nmain(int argc, const char* argv[])\n{\n bool daemonize = true;\n const char* data = \".\";\n const char* log = NULL;\n const char* pidfile = \"\";\n bool has_pidfile = false;\n bool listen = false;\n const char* listen_host = \"auto\";\n long listen_port = 2012;\n bool coordinator = false;\n const char* coordinator_host = \"127.0.0.1\";\n long coordinator_port = 1982;\n long threads = 0;\n bool log_immediate = false;\n\n e::argparser ap;\n ap.autohelp();\n ap.arg().name('d', \"daemon\")\n .description(\"run in the background\")\n .set_true(&daemonize);\n ap.arg().name('f', \"foreground\")\n .description(\"run in the foreground\")\n .set_false(&daemonize);\n ap.arg().name('D', \"data\")\n .description(\"store persistent state in this directory (default: .)\")\n .metavar(\"dir\").as_string(&data);\n ap.arg().name('L', \"log\")\n .description(\"store logs in this directory (default: --data)\")\n .metavar(\"dir\").as_string(&log);\n ap.arg().long_name(\"pidfile\")\n .description(\"write the PID to a file (default: don't)\")\n .metavar(\"file\").as_string(&pidfile).set_true(&has_pidfile);\n ap.arg().name('l', \"listen\")\n .description(\"listen on a specific IP address (default: auto)\")\n .metavar(\"IP\").as_string(&listen_host).set_true(&listen);\n ap.arg().name('p', \"listen-port\")\n .description(\"listen on an alternative port (default: 1982)\")\n .metavar(\"port\").as_long(&listen_port).set_true(&listen);\n ap.arg().name('c', \"coordinator\")\n .description(\"join an existing HyperDex cluster through IP address or hostname\")\n .metavar(\"addr\").as_string(&coordinator_host).set_true(&coordinator);\n ap.arg().name('P', \"coordinator-port\")\n .description(\"connect to an alternative port on the coordinator (default: 1982)\")\n .metavar(\"port\").as_long(&coordinator_port).set_true(&coordinator);\n ap.arg().name('t', \"threads\")\n .description(\"the number of threads which will handle network traffic\")\n .metavar(\"N\").as_long(&threads);\n ap.arg().long_name(\"log-immediate\")\n .description(\"immediately flush all log output\")\n .set_true(&log_immediate).hidden();\n\n if (!ap.parse(argc, argv))\n {\n return EXIT_FAILURE;\n }\n\n if (ap.args_sz() != 0)\n {\n std::cerr << \"command takes no positional arguments\\n\" << std::endl;\n ap.usage();\n return EXIT_FAILURE;\n }\n\n if (listen_port >= (1 << 16))\n {\n std::cerr << \"listen-port is out of range\" << std::endl;\n return EXIT_FAILURE;\n }\n\n if (coordinator_port >= (1 << 16))\n {\n std::cerr << \"coordinator-port is out of range\" << std::endl;\n return EXIT_FAILURE;\n }\n\n po6::net::ipaddr listen_ip;\n po6::net::location bind_to;\n\n if (strcmp(listen_host, \"auto\") == 0)\n {\n if (!busybee_discover(&listen_ip))\n {\n std::cerr << \"cannot automatically discover local address; specify one manually\" << std::endl;\n return EXIT_FAILURE;\n }\n\n bind_to = po6::net::location(listen_ip, listen_port);\n }\n else\n {\n try\n {\n listen_ip = po6::net::ipaddr(listen_host);\n bind_to = po6::net::location(listen_ip, listen_port);\n }\n catch (std::invalid_argument& e)\n {\n \/\/ fallthrough\n }\n\n if (bind_to == po6::net::location())\n {\n bind_to = po6::net::hostname(listen_host, 0).lookup(AF_UNSPEC, IPPROTO_TCP);\n bind_to.port = listen_port;\n }\n }\n\n if (bind_to == po6::net::location())\n {\n std::cerr << \"cannot interpret listen address as hostname or IP address\" << std::endl;\n return EXIT_FAILURE;\n }\n\n if (bind_to.address == po6::net::ipaddr(\"0.0.0.0\"))\n {\n std::cerr << \"cannot bind to \" << bind_to << \" because it is not routable\" << std::endl;\n return EXIT_FAILURE;\n }\n\n google::InitGoogleLogging(argv[0]);\n google::InstallFailureSignalHandler();\n\n if (log_immediate)\n {\n FLAGS_logbufsecs = 0;\n }\n\n try\n {\n hyperdex::daemon d;\n\n if (threads <= 0)\n {\n threads += sysconf(_SC_NPROCESSORS_ONLN);\n\n if (threads <= 0)\n {\n std::cerr << \"cannot create a non-positive number of threads\" << std::endl;\n return EXIT_FAILURE;\n }\n }\n else if (threads > 512)\n {\n std::cerr << \"refusing to create more than 512 threads\" << std::endl;\n return EXIT_FAILURE;\n }\n\n return d.run(daemonize,\n std::string(data),\n std::string(log ? log : data),\n std::string(pidfile), has_pidfile,\n listen, bind_to,\n coordinator, po6::net::hostname(coordinator_host, coordinator_port),\n threads);\n }\n catch (std::exception& e)\n {\n std::cerr << \"error: \" << e.what() << std::endl;\n return EXIT_FAILURE;\n }\n}\n<commit_msg>Add missing stdexcept header<commit_after>\/\/ Copyright (c) 2011-2014, Cornell University\n\/\/ All rights reserved.\n\/\/\n\/\/ Redistribution and use in source and binary forms, with or without\n\/\/ modification, are permitted provided that the following conditions are met:\n\/\/\n\/\/ * Redistributions of source code must retain the above copyright notice,\n\/\/ this list of conditions and the following disclaimer.\n\/\/ * Redistributions in binary form must reproduce the above copyright\n\/\/ notice, this list of conditions and the following disclaimer in the\n\/\/ documentation and\/or other materials provided with the distribution.\n\/\/ * Neither the name of HyperDex nor the names of its contributors may be\n\/\/ used to endorse or promote products derived from this software without\n\/\/ specific prior written permission.\n\/\/\n\/\/ THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS \"AS IS\"\n\/\/ AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE\n\/\/ IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE\n\/\/ ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE\n\/\/ LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR\n\/\/ CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF\n\/\/ SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS\n\/\/ INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN\n\/\/ CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)\n\/\/ ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE\n\/\/ POSSIBILITY OF SUCH DAMAGE.\n\n#define __STDC_LIMIT_MACROS\n\n\/\/ STL\n#include <stdexcept>\n\n\/\/ Google Log\n#include <glog\/logging.h>\n\n\/\/ po6\n#include <po6\/net\/ipaddr.h>\n#include <po6\/net\/hostname.h>\n\n\/\/ e\n#include <e\/popt.h>\n\n\/\/ BusyBee\n#include <busybee_utils.h>\n\n\/\/ HyperDex\n#include \"daemon\/daemon.h\"\n\nint\nmain(int argc, const char* argv[])\n{\n bool daemonize = true;\n const char* data = \".\";\n const char* log = NULL;\n const char* pidfile = \"\";\n bool has_pidfile = false;\n bool listen = false;\n const char* listen_host = \"auto\";\n long listen_port = 2012;\n bool coordinator = false;\n const char* coordinator_host = \"127.0.0.1\";\n long coordinator_port = 1982;\n long threads = 0;\n bool log_immediate = false;\n\n e::argparser ap;\n ap.autohelp();\n ap.arg().name('d', \"daemon\")\n .description(\"run in the background\")\n .set_true(&daemonize);\n ap.arg().name('f', \"foreground\")\n .description(\"run in the foreground\")\n .set_false(&daemonize);\n ap.arg().name('D', \"data\")\n .description(\"store persistent state in this directory (default: .)\")\n .metavar(\"dir\").as_string(&data);\n ap.arg().name('L', \"log\")\n .description(\"store logs in this directory (default: --data)\")\n .metavar(\"dir\").as_string(&log);\n ap.arg().long_name(\"pidfile\")\n .description(\"write the PID to a file (default: don't)\")\n .metavar(\"file\").as_string(&pidfile).set_true(&has_pidfile);\n ap.arg().name('l', \"listen\")\n .description(\"listen on a specific IP address (default: auto)\")\n .metavar(\"IP\").as_string(&listen_host).set_true(&listen);\n ap.arg().name('p', \"listen-port\")\n .description(\"listen on an alternative port (default: 1982)\")\n .metavar(\"port\").as_long(&listen_port).set_true(&listen);\n ap.arg().name('c', \"coordinator\")\n .description(\"join an existing HyperDex cluster through IP address or hostname\")\n .metavar(\"addr\").as_string(&coordinator_host).set_true(&coordinator);\n ap.arg().name('P', \"coordinator-port\")\n .description(\"connect to an alternative port on the coordinator (default: 1982)\")\n .metavar(\"port\").as_long(&coordinator_port).set_true(&coordinator);\n ap.arg().name('t', \"threads\")\n .description(\"the number of threads which will handle network traffic\")\n .metavar(\"N\").as_long(&threads);\n ap.arg().long_name(\"log-immediate\")\n .description(\"immediately flush all log output\")\n .set_true(&log_immediate).hidden();\n\n if (!ap.parse(argc, argv))\n {\n return EXIT_FAILURE;\n }\n\n if (ap.args_sz() != 0)\n {\n std::cerr << \"command takes no positional arguments\\n\" << std::endl;\n ap.usage();\n return EXIT_FAILURE;\n }\n\n if (listen_port >= (1 << 16))\n {\n std::cerr << \"listen-port is out of range\" << std::endl;\n return EXIT_FAILURE;\n }\n\n if (coordinator_port >= (1 << 16))\n {\n std::cerr << \"coordinator-port is out of range\" << std::endl;\n return EXIT_FAILURE;\n }\n\n po6::net::ipaddr listen_ip;\n po6::net::location bind_to;\n\n if (strcmp(listen_host, \"auto\") == 0)\n {\n if (!busybee_discover(&listen_ip))\n {\n std::cerr << \"cannot automatically discover local address; specify one manually\" << std::endl;\n return EXIT_FAILURE;\n }\n\n bind_to = po6::net::location(listen_ip, listen_port);\n }\n else\n {\n try\n {\n listen_ip = po6::net::ipaddr(listen_host);\n bind_to = po6::net::location(listen_ip, listen_port);\n }\n catch (std::invalid_argument& e)\n {\n \/\/ fallthrough\n }\n\n if (bind_to == po6::net::location())\n {\n bind_to = po6::net::hostname(listen_host, 0).lookup(AF_UNSPEC, IPPROTO_TCP);\n bind_to.port = listen_port;\n }\n }\n\n if (bind_to == po6::net::location())\n {\n std::cerr << \"cannot interpret listen address as hostname or IP address\" << std::endl;\n return EXIT_FAILURE;\n }\n\n if (bind_to.address == po6::net::ipaddr(\"0.0.0.0\"))\n {\n std::cerr << \"cannot bind to \" << bind_to << \" because it is not routable\" << std::endl;\n return EXIT_FAILURE;\n }\n\n google::InitGoogleLogging(argv[0]);\n google::InstallFailureSignalHandler();\n\n if (log_immediate)\n {\n FLAGS_logbufsecs = 0;\n }\n\n try\n {\n hyperdex::daemon d;\n\n if (threads <= 0)\n {\n threads += sysconf(_SC_NPROCESSORS_ONLN);\n\n if (threads <= 0)\n {\n std::cerr << \"cannot create a non-positive number of threads\" << std::endl;\n return EXIT_FAILURE;\n }\n }\n else if (threads > 512)\n {\n std::cerr << \"refusing to create more than 512 threads\" << std::endl;\n return EXIT_FAILURE;\n }\n\n return d.run(daemonize,\n std::string(data),\n std::string(log ? log : data),\n std::string(pidfile), has_pidfile,\n listen, bind_to,\n coordinator, po6::net::hostname(coordinator_host, coordinator_port),\n threads);\n }\n catch (std::exception& e)\n {\n std::cerr << \"error: \" << e.what() << std::endl;\n return EXIT_FAILURE;\n }\n}\n<|endoftext|>"} {"text":"<commit_before>\/\/ RUN: %clang -c -g %s -o \/dev\/null\n\/\/ Radar 8730409\n\nclass foo {\npublic:\n#define x(a) virtual void v ## a (void)\nx(1);\nx(2);\nx(3);\nx(4);\nx(5);\nx(6);\nx(7);\nx(8);\nx(9);\nx(10);\nx(11);\nx(12);\nx(13);\nx(14);\nx(15);\nx(16);\nx(17);\nx(18);\nx(19);\nx(20);\nx(21);\nx(22);\nx(23);\nx(24);\nx(25);\nx(26);\nx(27);\nx(28);\nx(29);\nx(30);\nx(31);\nx(32);\nx(33);\nx(34);\nx(35);\nx(36);\nx(37);\nx(38);\nx(39);\nx(40);\nx(41);\nx(42);\nx(43);\nx(44);\nx(45);\nx(46);\nx(47);\nx(48);\nx(49);\nx(50);\nx(51);\nx(52);\nx(53);\nx(54);\nx(55);\nx(56);\nx(57);\nx(58);\nx(59);\nx(60);\nx(61);\nx(62);\nx(63);\nx(64);\nx(65);\nx(66);\nx(67);\nx(68);\nx(69);\nx(70);\nx(71);\nx(72);\nx(73);\nx(74);\nx(75);\nx(76);\nx(77);\nx(78);\nx(79);\nx(80);\nx(81);\nx(82);\nx(83);\nx(84);\nx(85);\nx(86);\nx(87);\nx(88);\nx(89);\nx(90);\nx(91);\nx(92);\nx(93);\nx(94);\nx(95);\nx(96);\nx(97);\nx(98);\nx(99);\nx(100);\nx(101);\nx(102);\nx(103);\nx(104);\nx(105);\nx(106);\nx(107);\nx(108);\nx(109);\nx(110);\nx(111);\nx(112);\nx(113);\nx(114);\nx(115);\nx(116);\nx(117);\nx(118);\nx(119);\nx(120);\nx(121);\nx(122);\nx(123);\nx(124);\nx(125);\nx(126);\nx(127);\nx(128);\nx(129);\nx(130);\nx(131);\nx(132);\nx(133);\nx(134);\nx(135);\nx(136);\nx(137);\nx(138);\nx(139);\nx(140);\nx(141);\nx(142);\nx(143);\nx(144);\nx(145);\nx(146);\nx(147);\nx(148);\nx(149);\nx(150);\nx(151);\nx(152);\nx(153);\nx(154);\nx(155);\nx(156);\nx(157);\nx(158);\nx(159);\nx(160);\nx(161);\nx(162);\nx(163);\nx(164);\nx(165);\nx(166);\nx(167);\nx(168);\nx(169);\nx(170);\nx(171);\nx(172);\nx(173);\nx(174);\nx(175);\nx(176);\nx(177);\nx(178);\nx(179);\nx(180);\nx(181);\nx(182);\nx(183);\nx(184);\nx(185);\nx(186);\nx(187);\nx(188);\nx(189);\nx(190);\nx(191);\nx(192);\nx(193);\nx(194);\nx(195);\nx(196);\nx(197);\nx(198);\nx(199);\nx(200);\nx(201);\nx(202);\nx(203);\nx(204);\nx(205);\nx(206);\nx(207);\nx(208);\nx(209);\nx(210);\nx(211);\nx(212);\nx(213);\nx(214);\nx(215);\nx(216);\nx(217);\nx(218);\nx(219);\nx(220);\nx(221);\nx(222);\nx(223);\nx(224);\nx(225);\nx(226);\nx(227);\nx(228);\nx(229);\nx(230);\nx(231);\nx(232);\nx(233);\nx(234);\nx(235);\nx(236);\nx(237);\nx(238);\nx(239);\nx(240);\nx(241);\nx(242);\nx(243);\nx(244);\nx(245);\nx(246);\nx(247);\nx(248);\nx(249);\nx(250);\nx(251);\nx(252);\nx(253);\nx(254);\nx(255);\nx(256);\nx(257);\nx(258);\nx(259);\nx(260);\nx(261);\nx(262);\nx(263);\nx(264);\nx(265);\nx(266);\nx(267);\nx(268);\nx(269);\nx(270);\nx(271);\nx(272);\nx(273);\nx(274);\nx(275);\nx(276);\nx(277);\nx(278);\nx(279);\nx(280);\nx(281);\nx(282);\nx(283);\nx(284);\nx(285);\nx(286);\nx(287);\nx(288);\nx(289);\nx(290);\nx(291);\nx(292);\nx(293);\nx(294);\nx(295);\nx(296);\nx(297);\nx(298);\nx(299);\nx(300);\n};\n\nfoo b;\n<commit_msg>Disable this test on Windows; it crashes and popup an dialog on each lit test run. I have no idea how to fix it.<commit_after>\/\/ RUN: %clang -c -g %s -o \/dev\/null\n\/\/ Radar 8730409\n\n\/\/ FIXME: This test crashes on Windows.\n#ifndef _WIN32\n\nclass foo {\npublic:\n#define x(a) virtual void v ## a (void)\nx(1);\nx(2);\nx(3);\nx(4);\nx(5);\nx(6);\nx(7);\nx(8);\nx(9);\nx(10);\nx(11);\nx(12);\nx(13);\nx(14);\nx(15);\nx(16);\nx(17);\nx(18);\nx(19);\nx(20);\nx(21);\nx(22);\nx(23);\nx(24);\nx(25);\nx(26);\nx(27);\nx(28);\nx(29);\nx(30);\nx(31);\nx(32);\nx(33);\nx(34);\nx(35);\nx(36);\nx(37);\nx(38);\nx(39);\nx(40);\nx(41);\nx(42);\nx(43);\nx(44);\nx(45);\nx(46);\nx(47);\nx(48);\nx(49);\nx(50);\nx(51);\nx(52);\nx(53);\nx(54);\nx(55);\nx(56);\nx(57);\nx(58);\nx(59);\nx(60);\nx(61);\nx(62);\nx(63);\nx(64);\nx(65);\nx(66);\nx(67);\nx(68);\nx(69);\nx(70);\nx(71);\nx(72);\nx(73);\nx(74);\nx(75);\nx(76);\nx(77);\nx(78);\nx(79);\nx(80);\nx(81);\nx(82);\nx(83);\nx(84);\nx(85);\nx(86);\nx(87);\nx(88);\nx(89);\nx(90);\nx(91);\nx(92);\nx(93);\nx(94);\nx(95);\nx(96);\nx(97);\nx(98);\nx(99);\nx(100);\nx(101);\nx(102);\nx(103);\nx(104);\nx(105);\nx(106);\nx(107);\nx(108);\nx(109);\nx(110);\nx(111);\nx(112);\nx(113);\nx(114);\nx(115);\nx(116);\nx(117);\nx(118);\nx(119);\nx(120);\nx(121);\nx(122);\nx(123);\nx(124);\nx(125);\nx(126);\nx(127);\nx(128);\nx(129);\nx(130);\nx(131);\nx(132);\nx(133);\nx(134);\nx(135);\nx(136);\nx(137);\nx(138);\nx(139);\nx(140);\nx(141);\nx(142);\nx(143);\nx(144);\nx(145);\nx(146);\nx(147);\nx(148);\nx(149);\nx(150);\nx(151);\nx(152);\nx(153);\nx(154);\nx(155);\nx(156);\nx(157);\nx(158);\nx(159);\nx(160);\nx(161);\nx(162);\nx(163);\nx(164);\nx(165);\nx(166);\nx(167);\nx(168);\nx(169);\nx(170);\nx(171);\nx(172);\nx(173);\nx(174);\nx(175);\nx(176);\nx(177);\nx(178);\nx(179);\nx(180);\nx(181);\nx(182);\nx(183);\nx(184);\nx(185);\nx(186);\nx(187);\nx(188);\nx(189);\nx(190);\nx(191);\nx(192);\nx(193);\nx(194);\nx(195);\nx(196);\nx(197);\nx(198);\nx(199);\nx(200);\nx(201);\nx(202);\nx(203);\nx(204);\nx(205);\nx(206);\nx(207);\nx(208);\nx(209);\nx(210);\nx(211);\nx(212);\nx(213);\nx(214);\nx(215);\nx(216);\nx(217);\nx(218);\nx(219);\nx(220);\nx(221);\nx(222);\nx(223);\nx(224);\nx(225);\nx(226);\nx(227);\nx(228);\nx(229);\nx(230);\nx(231);\nx(232);\nx(233);\nx(234);\nx(235);\nx(236);\nx(237);\nx(238);\nx(239);\nx(240);\nx(241);\nx(242);\nx(243);\nx(244);\nx(245);\nx(246);\nx(247);\nx(248);\nx(249);\nx(250);\nx(251);\nx(252);\nx(253);\nx(254);\nx(255);\nx(256);\nx(257);\nx(258);\nx(259);\nx(260);\nx(261);\nx(262);\nx(263);\nx(264);\nx(265);\nx(266);\nx(267);\nx(268);\nx(269);\nx(270);\nx(271);\nx(272);\nx(273);\nx(274);\nx(275);\nx(276);\nx(277);\nx(278);\nx(279);\nx(280);\nx(281);\nx(282);\nx(283);\nx(284);\nx(285);\nx(286);\nx(287);\nx(288);\nx(289);\nx(290);\nx(291);\nx(292);\nx(293);\nx(294);\nx(295);\nx(296);\nx(297);\nx(298);\nx(299);\nx(300);\n};\n\nfoo b;\n\n#endif\n<|endoftext|>"} {"text":"<commit_before>#include \"cinder\/app\/App.h\"\n#include \"cinder\/app\/RendererGl.h\"\n#include \"cinder\/gl\/gl.h\"\n#include \"cinder\/Log.h\"\n\n#include \"ui\/Suite.h\"\n#include \"mason\/Hud.h\"\n#include \"mason\/Common.h\"\n#include \"mason\/Config.h\"\n#include \"mason\/Assets.h\"\n#include \"mason\/Profiling.h\"\n\n#include \"HudTest.h\"\n#include \"MiscTest.h\"\n\/\/#include \"BlendingTest.h\"\n\n#define USE_SECONDARY_SCREEN 1\n#define MSAA 4\n\nusing namespace ci;\nusing namespace ci::app;\nusing namespace std;\n\nclass MasonTestsApp : public App {\n public:\n\tvoid setup() override;\n\tvoid resize() override;\n\tvoid keyDown( app::KeyEvent event ) override;\n\tvoid update() override;\n\tvoid draw() override;\n\n\tvoid reload();\n\n\tui::SuiteRef\tmSuite;\n\tbool\t\t\tmDrawHud = true;\n\tbool\t\t\tmDrawProfiling = false;\n};\n\nvoid MasonTestsApp::setup()\n{\n\tma::initialize( ma::getRepoRootPath() );\n\n\tmSuite = make_shared<ui::Suite>();\n\n\tmSuite->registerSuiteView<HudTest>( \"hud\" );\n\tmSuite->registerSuiteView<MiscTest>( \"misc\" );\n\t\/\/mSuite->registerSuiteView<MotionTest>( \"motion\" );\n\n\treload();\n}\n\nvoid MasonTestsApp::reload()\n{\n\tma::assets()->getFile( app::getAssetPath( \"config.json\" ), [this]( DataSourceRef dataSource ) {\n\t\tCI_LOG_I( \"config.json reloaded\" );\n\n\t\tma::config()->read( dataSource );\n\n\t\tsize_t testIndex = (size_t)ma::config()->get<int>( \"app\", \"test\" );\n\t\tmSuite->select( testIndex );\n\t} );\n}\n\nvoid MasonTestsApp::keyDown( app::KeyEvent event )\n{\n\tif( event.isControlDown() ) {\n\t\tif( tolower( event.getChar() ) == 'r' ) {\n\t\t\tCI_LOG_I( \"reloading suite\" );\n\t\t\tif( event.isShiftDown() ) {\n\t\t\t\tCI_LOG_I( \"- clearing variables\" );\n\t\t\t\tma::hud()->clear();\n\t\t\t}\n\t\t\tmSuite->reload();\n\t\t}\n\t\telse if( event.getChar() == 'f' ) {\n\t\t\tCI_LOG_I( \"toggling fullscreen\" );\n\t\t\tsetFullScreen( ! isFullScreen() );\n\t\t}\n\t\telse if( event.getChar() == 'h' ) {\n\t\t\tCI_LOG_I( \"toggling Hud\" );\n\t\t\tmDrawHud = ! mDrawHud;\n\t\t\tmSuite->setDrawUiEnabled( mDrawHud );\n\t\t}\n\t\telse if( event.getChar() == 'l' )\n\t\t\tmDrawProfiling = ! mDrawProfiling;\n\t}\n}\n\nvoid MasonTestsApp::resize()\n{\n\tCI_LOG_I( \"window size: \" << getWindowSize() );\n}\n\nvoid MasonTestsApp::update()\n{\n\t{\n\t\tCI_PROFILE_CPU( \"Suite update\" );\n\t\tCI_PROFILE_GPU( \"Suite update\" );\n\t\tmSuite->update();\n\t}\n\n#if CI_PROFILING\n\tif( mDrawProfiling )\n\t\tperf::printProfiling();\n#endif\n}\n\nvoid MasonTestsApp::draw()\n{\n\tCI_PROFILE_CPU( \"main draw\" );\n\tCI_PROFILE_GPU( \"main draw\" );\n\n\tgl::clear();\n\n\t{\n\t\tCI_PROFILE_CPU( \"Suite draw\" );\n\t\tCI_PROFILE_GPU( \"Suite draw\" );\n\t\tmSuite->draw();\n\t}\n\n\tif( mDrawHud ) {\n\t\tCI_PROFILE_CPU( \"Hud draw\" );\n\t\tCI_PROFILE_GPU( \"Hud draw\" );\n\t\tma::hud()->draw();\n\t}\n\n\tCI_CHECK_GL();\n}\n\nvoid prepareSettings( App::Settings *settings )\n{\n\tbool useSecondaryScreen = ( USE_SECONDARY_SCREEN && Display::getDisplays().size() > 1 );\n\n\tif( useSecondaryScreen ) {\n\t\tfor( const auto &display : Display::getDisplays() ) {\n\t\t\t\/\/CI_LOG_I( \"display name: \" << display->getName() );\n\t\t\tif( display->getName() == \"Color LCD\" ) {\n\t\t\t\t\/\/ macbook\n\t\t\t\tsettings->setDisplay( display );\n\t\t\t\tsettings->setWindowSize( 1280, 720 );\n\t\t\t}\n\t\t\telse if( display->getName() == \"Generic PnP Monitor\" ) {\n\t\t\t\t\/\/ gechic 1303i 13\"touch display\n\t\t\t\tsettings->setDisplay( display );\n\t\t\t\tsettings->setFullScreen( true );\n\t\t\t}\n\t\t}\n\t}\n\telse {\n#if defined( CINDER_MAC )\n\t\tivec2 windowPos = { 0, 0 };\n#else\n\t\tivec2 windowPos = { 0, 24 };\n#endif\n\t\tsettings->setWindowPos( windowPos.x, windowPos.y );\n\t\tsettings->setWindowSize( 960, 565 );\n\t}\n}\n\nCINDER_APP( MasonTestsApp, RendererGl( RendererGl::Options().msaa( MSAA ) ), prepareSettings )\n<commit_msg>using new Cinder-Profiler macro<commit_after>#include \"cinder\/app\/App.h\"\n#include \"cinder\/app\/RendererGl.h\"\n#include \"cinder\/gl\/gl.h\"\n#include \"cinder\/Log.h\"\n\n#include \"ui\/Suite.h\"\n#include \"mason\/Hud.h\"\n#include \"mason\/Common.h\"\n#include \"mason\/Config.h\"\n#include \"mason\/Assets.h\"\n#include \"mason\/Profiling.h\"\n\n#include \"HudTest.h\"\n#include \"MiscTest.h\"\n\/\/#include \"BlendingTest.h\"\n\n#define USE_SECONDARY_SCREEN 1\n#define MSAA 4\n\nusing namespace ci;\nusing namespace ci::app;\nusing namespace std;\n\nclass MasonTestsApp : public App {\n public:\n\tvoid setup() override;\n\tvoid resize() override;\n\tvoid keyDown( app::KeyEvent event ) override;\n\tvoid update() override;\n\tvoid draw() override;\n\n\tvoid reload();\n\n\tui::SuiteRef\tmSuite;\n\tbool\t\t\tmDrawHud = true;\n\tbool\t\t\tmDrawProfiling = false;\n};\n\nvoid MasonTestsApp::setup()\n{\n\tma::initialize( ma::getRepoRootPath() );\n\n\tmSuite = make_shared<ui::Suite>();\n\n\tmSuite->registerSuiteView<HudTest>( \"hud\" );\n\tmSuite->registerSuiteView<MiscTest>( \"misc\" );\n\t\/\/mSuite->registerSuiteView<MotionTest>( \"motion\" );\n\n\treload();\n}\n\nvoid MasonTestsApp::reload()\n{\n\tma::assets()->getFile( app::getAssetPath( \"config.json\" ), [this]( DataSourceRef dataSource ) {\n\t\tCI_LOG_I( \"config.json reloaded\" );\n\n\t\tma::config()->read( dataSource );\n\n\t\tsize_t testIndex = (size_t)ma::config()->get<int>( \"app\", \"test\" );\n\t\tmSuite->select( testIndex );\n\t} );\n}\n\nvoid MasonTestsApp::keyDown( app::KeyEvent event )\n{\n\tif( event.isControlDown() ) {\n\t\tif( tolower( event.getChar() ) == 'r' ) {\n\t\t\tCI_LOG_I( \"reloading suite\" );\n\t\t\tif( event.isShiftDown() ) {\n\t\t\t\tCI_LOG_I( \"- clearing variables\" );\n\t\t\t\tma::hud()->clear();\n\t\t\t}\n\t\t\tmSuite->reload();\n\t\t}\n\t\telse if( event.getChar() == 'f' ) {\n\t\t\tCI_LOG_I( \"toggling fullscreen\" );\n\t\t\tsetFullScreen( ! isFullScreen() );\n\t\t}\n\t\telse if( event.getChar() == 'h' ) {\n\t\t\tCI_LOG_I( \"toggling Hud\" );\n\t\t\tmDrawHud = ! mDrawHud;\n\t\t\tmSuite->setDrawUiEnabled( mDrawHud );\n\t\t}\n\t\telse if( event.getChar() == 'l' )\n\t\t\tmDrawProfiling = ! mDrawProfiling;\n\t}\n}\n\nvoid MasonTestsApp::resize()\n{\n\tCI_LOG_I( \"window size: \" << getWindowSize() );\n}\n\nvoid MasonTestsApp::update()\n{\n\t{\n\t\tCI_PROFILE( \"Suite update\" );\n\t\tmSuite->update();\n\t}\n\n#if CI_PROFILING\n\tif( mDrawProfiling )\n\t\tperf::printProfiling();\n#endif\n}\n\nvoid MasonTestsApp::draw()\n{\n\tCI_PROFILE( \"main draw\" );\n\n\tgl::clear();\n\n\t{\n\t\tCI_PROFILE( \"Suite draw\" );\n\t\tmSuite->draw();\n\t}\n\n\tif( mDrawHud ) {\n\t\tCI_PROFILE( \"Hud draw\" );\n\t\tma::hud()->draw();\n\t}\n\n\tCI_CHECK_GL();\n}\n\nvoid prepareSettings( App::Settings *settings )\n{\n\tbool useSecondaryScreen = ( USE_SECONDARY_SCREEN && Display::getDisplays().size() > 1 );\n\n\tif( useSecondaryScreen ) {\n\t\tfor( const auto &display : Display::getDisplays() ) {\n\t\t\t\/\/CI_LOG_I( \"display name: \" << display->getName() );\n\t\t\tif( display->getName() == \"Color LCD\" ) {\n\t\t\t\t\/\/ macbook\n\t\t\t\tsettings->setDisplay( display );\n\t\t\t\tsettings->setWindowSize( 1280, 720 );\n\t\t\t}\n\t\t\telse if( display->getName() == \"Generic PnP Monitor\" ) {\n\t\t\t\t\/\/ gechic 1303i 13\"touch display\n\t\t\t\tsettings->setDisplay( display );\n\t\t\t\tsettings->setFullScreen( true );\n\t\t\t}\n\t\t}\n\t}\n\telse {\n#if defined( CINDER_MAC )\n\t\tivec2 windowPos = { 0, 0 };\n#else\n\t\tivec2 windowPos = { 0, 24 };\n#endif\n\t\tsettings->setWindowPos( windowPos.x, windowPos.y );\n\t\tsettings->setWindowSize( 960, 565 );\n\t}\n}\n\nCINDER_APP( MasonTestsApp, RendererGl( RendererGl::Options().msaa( MSAA ) ), prepareSettings )\n<|endoftext|>"} {"text":"<commit_before>\/\/------------------------------------------------------------------------------\n\/\/ CLING - the C++ LLVM-based InterpreterG :)\n\/\/\n\/\/ This file is dual-licensed: you can choose to license it under the University\n\/\/ of Illinois Open Source License or the GNU Lesser General Public License. See\n\/\/ LICENSE.TXT for details.\n\/\/------------------------------------------------------------------------------\n\n\/\/RUN: cat %s | %cling -Xclang -verify 2>&1\n\/\/ Test unknownTypeTest\n\n #include <x86intrin.h>\n\n __m128 testVar;\ntestVar \/\/ expected-error@2 {{__attribute__((__vector_size__(4 * sizeof(float)))) float has unknown type, which is not supported for this kind of declaration}}\n\n.q\n<commit_msg>Fix x86 dependency in test\/UnknownType.C<commit_after>\/\/------------------------------------------------------------------------------\n\/\/ CLING - the C++ LLVM-based InterpreterG :)\n\/\/\n\/\/ This file is dual-licensed: you can choose to license it under the University\n\/\/ of Illinois Open Source License or the GNU Lesser General Public License. See\n\/\/ LICENSE.TXT for details.\n\/\/------------------------------------------------------------------------------\n\n\/\/RUN: cat %s | %cling -Xclang -verify 2>&1\n\/\/ Test unknownTypeTest\n\ntypedef float vec4f __attribute__((ext_vector_type(4)));\n\nvec4f testVar;\ntestVar \/\/ expected-error {{float __attribute__((ext_vector_type(4))) has unknown type, which is not supported for this kind of declaration}}\n\n.q\n<|endoftext|>"} {"text":"<commit_before>\/\/===--- UseDefaultCheck.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 \"UseDefaultCheck.h\"\n#include \"clang\/AST\/ASTContext.h\"\n#include \"clang\/ASTMatchers\/ASTMatchFinder.h\"\n#include \"clang\/Lex\/Lexer.h\"\n\nusing namespace clang::ast_matchers;\n\nnamespace clang {\nnamespace tidy {\nnamespace modernize {\n\nstatic const char SpecialFunction[] = \"SpecialFunction\";\n\n\/\/\/ \\brief Finds all the named non-static fields of \\p Record.\nstatic std::set<const FieldDecl *>\ngetAllNamedFields(const CXXRecordDecl *Record) {\n std::set<const FieldDecl *> Result;\n for (const auto *Field : Record->fields()) {\n \/\/ Static data members are not in this range.\n if (Field->isUnnamedBitfield())\n continue;\n Result.insert(Field);\n }\n return Result;\n}\n\n\/\/\/ \\brief Returns the names of the direct bases of \\p Record, both virtual and\n\/\/\/ non-virtual.\nstatic std::set<const Type *> getAllDirectBases(const CXXRecordDecl *Record) {\n std::set<const Type *> Result;\n for (auto Base : Record->bases()) {\n \/\/ CXXBaseSpecifier.\n const auto *BaseType = Base.getTypeSourceInfo()->getType().getTypePtr();\n Result.insert(BaseType);\n }\n return Result;\n}\n\n\/\/\/ \\brief Returns a matcher that matches member expressions where the base is\n\/\/\/ the variable declared as \\p Var and the accessed member is the one declared\n\/\/\/ as \\p Field.\ninternal::Matcher<Expr> accessToFieldInVar(const FieldDecl *Field,\n const ValueDecl *Var) {\n return ignoringImpCasts(\n memberExpr(hasObjectExpression(declRefExpr(to(varDecl(equalsNode(Var))))),\n member(fieldDecl(equalsNode(Field)))));\n}\n\n\/\/\/ \\brief Check that the given constructor has copy signature and that it\n\/\/\/ copy-initializes all its bases and members.\nstatic bool isCopyConstructorAndCanBeDefaulted(ASTContext *Context,\n const CXXConstructorDecl *Ctor) {\n \/\/ An explicitly-defaulted constructor cannot have default arguments.\n if (Ctor->getMinRequiredArguments() != 1)\n return false;\n\n const auto *Record = Ctor->getParent();\n const auto *Param = Ctor->getParamDecl(0);\n\n \/\/ Base classes and members that have to be copied.\n auto BasesToInit = getAllDirectBases(Record);\n auto FieldsToInit = getAllNamedFields(Record);\n\n \/\/ Ensure that all the bases are copied.\n for (const auto *Base : BasesToInit) {\n \/\/ The initialization of a base class should be a call to a copy\n \/\/ constructor of the base.\n if (match(\n cxxConstructorDecl(forEachConstructorInitializer(cxxCtorInitializer(\n isBaseInitializer(),\n withInitializer(cxxConstructExpr(allOf(\n hasType(equalsNode(Base)),\n hasDeclaration(cxxConstructorDecl(isCopyConstructor())),\n argumentCountIs(1),\n hasArgument(\n 0, declRefExpr(to(varDecl(equalsNode(Param))))))))))),\n *Ctor, *Context)\n .empty())\n return false;\n }\n\n \/\/ Ensure that all the members are copied.\n for (const auto *Field : FieldsToInit) {\n auto AccessToFieldInParam = accessToFieldInVar(Field, Param);\n \/\/ The initialization is a CXXConstructExpr for class types.\n if (match(\n cxxConstructorDecl(forEachConstructorInitializer(cxxCtorInitializer(\n isMemberInitializer(), forField(equalsNode(Field)),\n withInitializer(anyOf(\n AccessToFieldInParam,\n cxxConstructExpr(allOf(\n hasDeclaration(cxxConstructorDecl(isCopyConstructor())),\n argumentCountIs(1),\n hasArgument(0, AccessToFieldInParam)))))))),\n *Ctor, *Context)\n .empty())\n return false;\n }\n\n \/\/ Ensure that we don't do anything else, like initializing an indirect base.\n return Ctor->getNumCtorInitializers() ==\n BasesToInit.size() + FieldsToInit.size();\n}\n\n\/\/\/ \\brief Checks that the given method is an overloading of the assignment\n\/\/\/ operator, has copy signature, returns a reference to \"*this\" and copies\n\/\/\/ all its members and subobjects.\nstatic bool isCopyAssignmentAndCanBeDefaulted(ASTContext *Context,\n const CXXMethodDecl *Operator) {\n const auto *Record = Operator->getParent();\n const auto *Param = Operator->getParamDecl(0);\n\n \/\/ Base classes and members that have to be copied.\n auto BasesToInit = getAllDirectBases(Record);\n auto FieldsToInit = getAllNamedFields(Record);\n\n const auto *Compound = cast<CompoundStmt>(Operator->getBody());\n\n \/\/ The assignment operator definition has to end with the following return\n \/\/ statement:\n \/\/ return *this;\n if (Compound->body_empty() ||\n match(returnStmt(has(ignoringParenImpCasts(unaryOperator(\n hasOperatorName(\"*\"), hasUnaryOperand(cxxThisExpr()))))),\n *Compound->body_back(), *Context)\n .empty())\n return false;\n\n \/\/ Ensure that all the bases are copied.\n for (const auto *Base : BasesToInit) {\n \/\/ Assignment operator of a base class:\n \/\/ Base::operator=(Other);\n \/\/\n \/\/ Clang translates this into:\n \/\/ ((Base*)this)->operator=((Base)Other);\n \/\/\n \/\/ So we are looking for a member call that fulfills:\n if (match(compoundStmt(has(ignoringParenImpCasts(cxxMemberCallExpr(allOf(\n \/\/ - The object is an implicit cast of 'this' to a pointer to\n \/\/ a base class.\n onImplicitObjectArgument(\n implicitCastExpr(hasImplicitDestinationType(\n pointsTo(type(equalsNode(Base)))),\n hasSourceExpression(cxxThisExpr()))),\n \/\/ - The called method is the operator=.\n callee(cxxMethodDecl(isCopyAssignmentOperator())),\n \/\/ - The argument is (an implicit cast to a Base of) the\n \/\/ argument taken by \"Operator\".\n argumentCountIs(1),\n hasArgument(0,\n declRefExpr(to(varDecl(equalsNode(Param)))))))))),\n *Compound, *Context)\n .empty())\n return false;\n }\n\n \/\/ Ensure that all the members are copied.\n for (const auto *Field : FieldsToInit) {\n \/\/ The assignment of data members:\n \/\/ Field = Other.Field;\n \/\/ Is a BinaryOperator in non-class types, and a CXXOperatorCallExpr\n \/\/ otherwise.\n auto LHS = memberExpr(hasObjectExpression(cxxThisExpr()),\n member(fieldDecl(equalsNode(Field))));\n auto RHS = accessToFieldInVar(Field, Param);\n if (match(\n compoundStmt(has(ignoringParenImpCasts(stmt(anyOf(\n binaryOperator(hasOperatorName(\"=\"), hasLHS(LHS), hasRHS(RHS)),\n cxxOperatorCallExpr(hasOverloadedOperatorName(\"=\"),\n argumentCountIs(2), hasArgument(0, LHS),\n hasArgument(1, RHS))))))),\n *Compound, *Context)\n .empty())\n return false;\n }\n\n \/\/ Ensure that we don't do anything else.\n return Compound->size() == BasesToInit.size() + FieldsToInit.size() + 1;\n}\n\n\/\/\/ \\brief Returns false if the body has any non-whitespace character.\nstatic bool bodyEmpty(const ASTContext *Context, const CompoundStmt *Body) {\n bool Invalid = false;\n StringRef Text = Lexer::getSourceText(\n CharSourceRange::getCharRange(Body->getLBracLoc().getLocWithOffset(1),\n Body->getRBracLoc()),\n Context->getSourceManager(), Context->getLangOpts(), &Invalid);\n return !Invalid && std::strspn(Text.data(), \" \\t\\r\\n\") == Text.size();\n}\n\nvoid UseDefaultCheck::registerMatchers(MatchFinder *Finder) {\n if (getLangOpts().CPlusPlus) {\n \/\/ Destructor.\n Finder->addMatcher(cxxDestructorDecl(isDefinition()).bind(SpecialFunction),\n this);\n Finder->addMatcher(\n cxxConstructorDecl(\n isDefinition(),\n anyOf(\n \/\/ Default constructor.\n allOf(unless(hasAnyConstructorInitializer(isWritten())),\n parameterCountIs(0)),\n \/\/ Copy constructor.\n allOf(isCopyConstructor(),\n \/\/ Discard constructors that can be used as a copy\n \/\/ constructor because all the other arguments have\n \/\/ default values.\n parameterCountIs(1))))\n .bind(SpecialFunction),\n this);\n \/\/ Copy-assignment operator.\n Finder->addMatcher(\n cxxMethodDecl(isDefinition(), isCopyAssignmentOperator(),\n \/\/ isCopyAssignmentOperator() allows the parameter to be\n \/\/ passed by value, and in this case it cannot be\n \/\/ defaulted.\n hasParameter(0, hasType(lValueReferenceType())))\n .bind(SpecialFunction),\n this);\n }\n}\n\nvoid UseDefaultCheck::check(const MatchFinder::MatchResult &Result) {\n std::string SpecialFunctionName;\n\n \/\/ Both CXXConstructorDecl and CXXDestructorDecl inherit from CXXMethodDecl.\n const auto *SpecialFunctionDecl =\n Result.Nodes.getNodeAs<CXXMethodDecl>(SpecialFunction);\n\n \/\/ Discard explicitly deleted\/defaulted special member functions and those\n \/\/ that are not user-provided (automatically generated).\n if (SpecialFunctionDecl->isDeleted() ||\n SpecialFunctionDecl->isExplicitlyDefaulted() ||\n SpecialFunctionDecl->isLateTemplateParsed() ||\n !SpecialFunctionDecl->isUserProvided() || !SpecialFunctionDecl->hasBody())\n return;\n\n const auto *Body = dyn_cast<CompoundStmt>(SpecialFunctionDecl->getBody());\n if (!Body)\n return;\n\n \/\/ If there are comments inside the body, don't do the change.\n if (!SpecialFunctionDecl->isCopyAssignmentOperator() &&\n !bodyEmpty(Result.Context, Body))\n return;\n\n std::vector<FixItHint> RemoveInitializers;\n\n if (const auto *Ctor = dyn_cast<CXXConstructorDecl>(SpecialFunctionDecl)) {\n if (Ctor->getNumParams() == 0) {\n SpecialFunctionName = \"default constructor\";\n } else {\n if (!isCopyConstructorAndCanBeDefaulted(Result.Context, Ctor))\n return;\n SpecialFunctionName = \"copy constructor\";\n \/\/ If there are constructor initializers, they must be removed.\n for (const CXXCtorInitializer *Init : Ctor->inits()) {\n RemoveInitializers.emplace_back(\n FixItHint::CreateRemoval(Init->getSourceRange()));\n }\n }\n } else if (isa<CXXDestructorDecl>(SpecialFunctionDecl)) {\n SpecialFunctionName = \"destructor\";\n } else {\n if (!isCopyAssignmentAndCanBeDefaulted(Result.Context, SpecialFunctionDecl))\n return;\n SpecialFunctionName = \"copy-assignment operator\";\n }\n\n diag(SpecialFunctionDecl->getLocStart(),\n \"use '= default' to define a trivial \" + SpecialFunctionName)\n << FixItHint::CreateReplacement(Body->getSourceRange(), \"= default;\")\n << RemoveInitializers;\n}\n\n} \/\/ namespace modernize\n} \/\/ namespace tidy\n} \/\/ namespace clang\n<commit_msg>Use auto in for loop<commit_after>\/\/===--- UseDefaultCheck.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 \"UseDefaultCheck.h\"\n#include \"clang\/AST\/ASTContext.h\"\n#include \"clang\/ASTMatchers\/ASTMatchFinder.h\"\n#include \"clang\/Lex\/Lexer.h\"\n\nusing namespace clang::ast_matchers;\n\nnamespace clang {\nnamespace tidy {\nnamespace modernize {\n\nstatic const char SpecialFunction[] = \"SpecialFunction\";\n\n\/\/\/ \\brief Finds all the named non-static fields of \\p Record.\nstatic std::set<const FieldDecl *>\ngetAllNamedFields(const CXXRecordDecl *Record) {\n std::set<const FieldDecl *> Result;\n for (const auto *Field : Record->fields()) {\n \/\/ Static data members are not in this range.\n if (Field->isUnnamedBitfield())\n continue;\n Result.insert(Field);\n }\n return Result;\n}\n\n\/\/\/ \\brief Returns the names of the direct bases of \\p Record, both virtual and\n\/\/\/ non-virtual.\nstatic std::set<const Type *> getAllDirectBases(const CXXRecordDecl *Record) {\n std::set<const Type *> Result;\n for (auto Base : Record->bases()) {\n \/\/ CXXBaseSpecifier.\n const auto *BaseType = Base.getTypeSourceInfo()->getType().getTypePtr();\n Result.insert(BaseType);\n }\n return Result;\n}\n\n\/\/\/ \\brief Returns a matcher that matches member expressions where the base is\n\/\/\/ the variable declared as \\p Var and the accessed member is the one declared\n\/\/\/ as \\p Field.\ninternal::Matcher<Expr> accessToFieldInVar(const FieldDecl *Field,\n const ValueDecl *Var) {\n return ignoringImpCasts(\n memberExpr(hasObjectExpression(declRefExpr(to(varDecl(equalsNode(Var))))),\n member(fieldDecl(equalsNode(Field)))));\n}\n\n\/\/\/ \\brief Check that the given constructor has copy signature and that it\n\/\/\/ copy-initializes all its bases and members.\nstatic bool isCopyConstructorAndCanBeDefaulted(ASTContext *Context,\n const CXXConstructorDecl *Ctor) {\n \/\/ An explicitly-defaulted constructor cannot have default arguments.\n if (Ctor->getMinRequiredArguments() != 1)\n return false;\n\n const auto *Record = Ctor->getParent();\n const auto *Param = Ctor->getParamDecl(0);\n\n \/\/ Base classes and members that have to be copied.\n auto BasesToInit = getAllDirectBases(Record);\n auto FieldsToInit = getAllNamedFields(Record);\n\n \/\/ Ensure that all the bases are copied.\n for (const auto *Base : BasesToInit) {\n \/\/ The initialization of a base class should be a call to a copy\n \/\/ constructor of the base.\n if (match(\n cxxConstructorDecl(forEachConstructorInitializer(cxxCtorInitializer(\n isBaseInitializer(),\n withInitializer(cxxConstructExpr(allOf(\n hasType(equalsNode(Base)),\n hasDeclaration(cxxConstructorDecl(isCopyConstructor())),\n argumentCountIs(1),\n hasArgument(\n 0, declRefExpr(to(varDecl(equalsNode(Param))))))))))),\n *Ctor, *Context)\n .empty())\n return false;\n }\n\n \/\/ Ensure that all the members are copied.\n for (const auto *Field : FieldsToInit) {\n auto AccessToFieldInParam = accessToFieldInVar(Field, Param);\n \/\/ The initialization is a CXXConstructExpr for class types.\n if (match(\n cxxConstructorDecl(forEachConstructorInitializer(cxxCtorInitializer(\n isMemberInitializer(), forField(equalsNode(Field)),\n withInitializer(anyOf(\n AccessToFieldInParam,\n cxxConstructExpr(allOf(\n hasDeclaration(cxxConstructorDecl(isCopyConstructor())),\n argumentCountIs(1),\n hasArgument(0, AccessToFieldInParam)))))))),\n *Ctor, *Context)\n .empty())\n return false;\n }\n\n \/\/ Ensure that we don't do anything else, like initializing an indirect base.\n return Ctor->getNumCtorInitializers() ==\n BasesToInit.size() + FieldsToInit.size();\n}\n\n\/\/\/ \\brief Checks that the given method is an overloading of the assignment\n\/\/\/ operator, has copy signature, returns a reference to \"*this\" and copies\n\/\/\/ all its members and subobjects.\nstatic bool isCopyAssignmentAndCanBeDefaulted(ASTContext *Context,\n const CXXMethodDecl *Operator) {\n const auto *Record = Operator->getParent();\n const auto *Param = Operator->getParamDecl(0);\n\n \/\/ Base classes and members that have to be copied.\n auto BasesToInit = getAllDirectBases(Record);\n auto FieldsToInit = getAllNamedFields(Record);\n\n const auto *Compound = cast<CompoundStmt>(Operator->getBody());\n\n \/\/ The assignment operator definition has to end with the following return\n \/\/ statement:\n \/\/ return *this;\n if (Compound->body_empty() ||\n match(returnStmt(has(ignoringParenImpCasts(unaryOperator(\n hasOperatorName(\"*\"), hasUnaryOperand(cxxThisExpr()))))),\n *Compound->body_back(), *Context)\n .empty())\n return false;\n\n \/\/ Ensure that all the bases are copied.\n for (const auto *Base : BasesToInit) {\n \/\/ Assignment operator of a base class:\n \/\/ Base::operator=(Other);\n \/\/\n \/\/ Clang translates this into:\n \/\/ ((Base*)this)->operator=((Base)Other);\n \/\/\n \/\/ So we are looking for a member call that fulfills:\n if (match(compoundStmt(has(ignoringParenImpCasts(cxxMemberCallExpr(allOf(\n \/\/ - The object is an implicit cast of 'this' to a pointer to\n \/\/ a base class.\n onImplicitObjectArgument(\n implicitCastExpr(hasImplicitDestinationType(\n pointsTo(type(equalsNode(Base)))),\n hasSourceExpression(cxxThisExpr()))),\n \/\/ - The called method is the operator=.\n callee(cxxMethodDecl(isCopyAssignmentOperator())),\n \/\/ - The argument is (an implicit cast to a Base of) the\n \/\/ argument taken by \"Operator\".\n argumentCountIs(1),\n hasArgument(0,\n declRefExpr(to(varDecl(equalsNode(Param)))))))))),\n *Compound, *Context)\n .empty())\n return false;\n }\n\n \/\/ Ensure that all the members are copied.\n for (const auto *Field : FieldsToInit) {\n \/\/ The assignment of data members:\n \/\/ Field = Other.Field;\n \/\/ Is a BinaryOperator in non-class types, and a CXXOperatorCallExpr\n \/\/ otherwise.\n auto LHS = memberExpr(hasObjectExpression(cxxThisExpr()),\n member(fieldDecl(equalsNode(Field))));\n auto RHS = accessToFieldInVar(Field, Param);\n if (match(\n compoundStmt(has(ignoringParenImpCasts(stmt(anyOf(\n binaryOperator(hasOperatorName(\"=\"), hasLHS(LHS), hasRHS(RHS)),\n cxxOperatorCallExpr(hasOverloadedOperatorName(\"=\"),\n argumentCountIs(2), hasArgument(0, LHS),\n hasArgument(1, RHS))))))),\n *Compound, *Context)\n .empty())\n return false;\n }\n\n \/\/ Ensure that we don't do anything else.\n return Compound->size() == BasesToInit.size() + FieldsToInit.size() + 1;\n}\n\n\/\/\/ \\brief Returns false if the body has any non-whitespace character.\nstatic bool bodyEmpty(const ASTContext *Context, const CompoundStmt *Body) {\n bool Invalid = false;\n StringRef Text = Lexer::getSourceText(\n CharSourceRange::getCharRange(Body->getLBracLoc().getLocWithOffset(1),\n Body->getRBracLoc()),\n Context->getSourceManager(), Context->getLangOpts(), &Invalid);\n return !Invalid && std::strspn(Text.data(), \" \\t\\r\\n\") == Text.size();\n}\n\nvoid UseDefaultCheck::registerMatchers(MatchFinder *Finder) {\n if (getLangOpts().CPlusPlus) {\n \/\/ Destructor.\n Finder->addMatcher(cxxDestructorDecl(isDefinition()).bind(SpecialFunction),\n this);\n Finder->addMatcher(\n cxxConstructorDecl(\n isDefinition(),\n anyOf(\n \/\/ Default constructor.\n allOf(unless(hasAnyConstructorInitializer(isWritten())),\n parameterCountIs(0)),\n \/\/ Copy constructor.\n allOf(isCopyConstructor(),\n \/\/ Discard constructors that can be used as a copy\n \/\/ constructor because all the other arguments have\n \/\/ default values.\n parameterCountIs(1))))\n .bind(SpecialFunction),\n this);\n \/\/ Copy-assignment operator.\n Finder->addMatcher(\n cxxMethodDecl(isDefinition(), isCopyAssignmentOperator(),\n \/\/ isCopyAssignmentOperator() allows the parameter to be\n \/\/ passed by value, and in this case it cannot be\n \/\/ defaulted.\n hasParameter(0, hasType(lValueReferenceType())))\n .bind(SpecialFunction),\n this);\n }\n}\n\nvoid UseDefaultCheck::check(const MatchFinder::MatchResult &Result) {\n std::string SpecialFunctionName;\n\n \/\/ Both CXXConstructorDecl and CXXDestructorDecl inherit from CXXMethodDecl.\n const auto *SpecialFunctionDecl =\n Result.Nodes.getNodeAs<CXXMethodDecl>(SpecialFunction);\n\n \/\/ Discard explicitly deleted\/defaulted special member functions and those\n \/\/ that are not user-provided (automatically generated).\n if (SpecialFunctionDecl->isDeleted() ||\n SpecialFunctionDecl->isExplicitlyDefaulted() ||\n SpecialFunctionDecl->isLateTemplateParsed() ||\n !SpecialFunctionDecl->isUserProvided() || !SpecialFunctionDecl->hasBody())\n return;\n\n const auto *Body = dyn_cast<CompoundStmt>(SpecialFunctionDecl->getBody());\n if (!Body)\n return;\n\n \/\/ If there are comments inside the body, don't do the change.\n if (!SpecialFunctionDecl->isCopyAssignmentOperator() &&\n !bodyEmpty(Result.Context, Body))\n return;\n\n std::vector<FixItHint> RemoveInitializers;\n\n if (const auto *Ctor = dyn_cast<CXXConstructorDecl>(SpecialFunctionDecl)) {\n if (Ctor->getNumParams() == 0) {\n SpecialFunctionName = \"default constructor\";\n } else {\n if (!isCopyConstructorAndCanBeDefaulted(Result.Context, Ctor))\n return;\n SpecialFunctionName = \"copy constructor\";\n \/\/ If there are constructor initializers, they must be removed.\n for (const auto *Init : Ctor->inits()) {\n RemoveInitializers.emplace_back(\n FixItHint::CreateRemoval(Init->getSourceRange()));\n }\n }\n } else if (isa<CXXDestructorDecl>(SpecialFunctionDecl)) {\n SpecialFunctionName = \"destructor\";\n } else {\n if (!isCopyAssignmentAndCanBeDefaulted(Result.Context, SpecialFunctionDecl))\n return;\n SpecialFunctionName = \"copy-assignment operator\";\n }\n\n diag(SpecialFunctionDecl->getLocStart(),\n \"use '= default' to define a trivial \" + SpecialFunctionName)\n << FixItHint::CreateReplacement(Body->getSourceRange(), \"= default;\")\n << RemoveInitializers;\n}\n\n} \/\/ namespace modernize\n} \/\/ namespace tidy\n} \/\/ namespace clang\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\/proxy\/ppb_url_loader_proxy.h\"\n\n#include <vector>\n\n#include \"base\/logging.h\"\n#include \"build\/build_config.h\"\n#include \"ppapi\/c\/pp_completion_callback.h\"\n#include \"ppapi\/c\/pp_errors.h\"\n#include \"ppapi\/c\/pp_resource.h\"\n#include \"ppapi\/c\/dev\/ppb_url_loader_dev.h\"\n#include \"ppapi\/proxy\/host_dispatcher.h\"\n#include \"ppapi\/proxy\/plugin_dispatcher.h\"\n#include \"ppapi\/proxy\/plugin_resource.h\"\n#include \"ppapi\/proxy\/ppapi_messages.h\"\n#include \"ppapi\/proxy\/ppb_url_response_info_proxy.h\"\n\n#if defined(OS_LINUX)\n#include <sys\/shm.h>\n#endif\n\nnamespace pp {\nnamespace proxy {\n\nclass URLLoader : public PluginResource {\n public:\n URLLoader();\n virtual ~URLLoader();\n\n \/\/ Resource overrides.\n virtual URLLoader* AsURLLoader() { return this; }\n\n \/\/ Initialized to -1. Will be set to nonnegative values by the UpdateProgress\n \/\/ message when the values are known.\n int64_t bytes_sent_;\n int64_t total_bytes_to_be_sent_;\n int64_t bytes_received_;\n int64_t total_bytes_to_be_received_;\n\n \/\/ When an asynchronous read is pending, this will contain the callback and\n \/\/ the buffer to put the data.\n PP_CompletionCallback current_read_callback_;\n char* current_read_buffer_;\n\n private:\n DISALLOW_COPY_AND_ASSIGN(URLLoader);\n};\n\nURLLoader::URLLoader()\n : bytes_sent_(-1),\n total_bytes_to_be_sent_(-1),\n bytes_received_(-1),\n total_bytes_to_be_received_(-1),\n current_read_callback_(PP_MakeCompletionCallback(NULL, NULL)),\n current_read_buffer_(NULL) {\n}\n\nURLLoader::~URLLoader() {\n}\n\nnamespace {\n\n\/\/ Plugin interface implmentation ----------------------------------------------\n\nPP_Resource Create(PP_Instance instance_id) {\n PluginDispatcher* dispatcher = PluginDispatcher::Get();\n PP_Resource result = 0;\n dispatcher->Send(new PpapiHostMsg_PPBURLLoader_Create(\n INTERFACE_ID_PPB_URL_LOADER, instance_id, &result));\n if (result)\n PPB_URLLoader_Proxy::TrackPluginResource(result);\n return result;\n}\n\nPP_Bool IsURLLoader(PP_Resource resource) {\n URLLoader* object = PluginResource::GetAs<URLLoader>(resource);\n return BoolToPPBool(!!object);\n}\n\nint32_t Open(PP_Resource loader_id,\n PP_Resource request_id,\n PP_CompletionCallback callback) {\n Dispatcher* dispatcher = PluginDispatcher::Get();\n dispatcher->Send(new PpapiHostMsg_PPBURLLoader_Open(\n INTERFACE_ID_PPB_URL_LOADER, loader_id, request_id,\n dispatcher->callback_tracker().SendCallback(callback)));\n return PP_ERROR_WOULDBLOCK;\n}\n\nint32_t FollowRedirect(PP_Resource loader_id,\n PP_CompletionCallback callback) {\n Dispatcher* dispatcher = PluginDispatcher::Get();\n dispatcher->Send(new PpapiHostMsg_PPBURLLoader_FollowRedirect(\n INTERFACE_ID_PPB_URL_LOADER, loader_id,\n dispatcher->callback_tracker().SendCallback(callback)));\n return PP_ERROR_WOULDBLOCK;\n}\n\nPP_Bool GetUploadProgress(PP_Resource loader_id,\n int64_t* bytes_sent,\n int64_t* total_bytes_to_be_sent) {\n URLLoader* object = PluginResource::GetAs<URLLoader>(loader_id);\n if (!object || object->bytes_sent_ == -1) {\n *bytes_sent = 0;\n *total_bytes_to_be_sent = 0;\n return PP_FALSE;\n }\n *bytes_sent = object->bytes_sent_;\n *total_bytes_to_be_sent = object->total_bytes_to_be_sent_;\n return PP_TRUE;\n}\n\nPP_Bool GetDownloadProgress(PP_Resource loader_id,\n int64_t* bytes_received,\n int64_t* total_bytes_to_be_received) {\n URLLoader* object = PluginResource::GetAs<URLLoader>(loader_id);\n if (!object || object->bytes_received_ == -1) {\n *bytes_received = 0;\n *total_bytes_to_be_received = 0;\n return PP_FALSE;\n }\n *bytes_received = object->bytes_received_;\n *total_bytes_to_be_received = object->total_bytes_to_be_received_;\n return PP_TRUE;\n}\n\nPP_Resource GetResponseInfo(PP_Resource loader_id) {\n \/\/ If we find that plugins are frequently requesting the response info, we\n \/\/ can improve performance by caching the PP_Resource in the URLLoader\n \/\/ object. This way we only have to do IPC for the first request. However,\n \/\/ it seems that most plugins will only call this once so there's no use\n \/\/ optimizing this case.\n\n PP_Resource result;\n PluginDispatcher* dispatcher = PluginDispatcher::Get();\n dispatcher->Send(new PpapiHostMsg_PPBURLLoader_GetResponseInfo(\n INTERFACE_ID_PPB_URL_LOADER, loader_id, &result));\n if (dispatcher->plugin_resource_tracker()->PreparePreviouslyTrackedResource(\n result))\n return result;\n\n \/\/ Tell the response info to create a tracking object and add it to the\n \/\/ resource tracker.\n PPB_URLResponseInfo_Proxy::TrackPluginResource(result);\n return result;\n}\n\nint32_t ReadResponseBody(PP_Resource loader_id,\n char* buffer,\n int32_t bytes_to_read,\n PP_CompletionCallback callback) {\n URLLoader* object = PluginResource::GetAs<URLLoader>(loader_id);\n if (!object)\n return PP_ERROR_BADRESOURCE;\n\n if (!buffer)\n return PP_ERROR_BADARGUMENT; \/\/ Must specify an output buffer.\n if (object->current_read_callback_.func)\n return PP_ERROR_INPROGRESS; \/\/ Can only have one request pending.\n\n \/\/ Currently we don't support sync calls to read. We'll need to revisit\n \/\/ how this works when we allow blocking calls (from background threads).\n if (!callback.func)\n return PP_ERROR_BADARGUMENT;\n\n object->current_read_callback_ = callback;\n object->current_read_buffer_ = buffer;\n\n PluginDispatcher::Get()->Send(new PpapiHostMsg_PPBURLLoader_ReadResponseBody(\n INTERFACE_ID_PPB_URL_LOADER, loader_id, bytes_to_read));\n return PP_ERROR_WOULDBLOCK;\n}\n\nint32_t FinishStreamingToFile(PP_Resource loader_id,\n PP_CompletionCallback callback) {\n Dispatcher* dispatcher = PluginDispatcher::Get();\n dispatcher->Send(new PpapiHostMsg_PPBURLLoader_FinishStreamingToFile(\n INTERFACE_ID_PPB_URL_LOADER, loader_id,\n dispatcher->callback_tracker().SendCallback(callback)));\n return PP_ERROR_WOULDBLOCK;\n}\n\nvoid Close(PP_Resource loader_id) {\n PluginDispatcher::Get()->Send(new PpapiHostMsg_PPBURLLoader_Close(\n INTERFACE_ID_PPB_URL_LOADER, loader_id));\n}\n\nconst PPB_URLLoader_Dev ppb_urlloader = {\n &Create,\n &IsURLLoader,\n &Open,\n &FollowRedirect,\n &GetUploadProgress,\n &GetDownloadProgress,\n &GetResponseInfo,\n &ReadResponseBody,\n &FinishStreamingToFile,\n &Close\n};\n\n\/\/ Renderer status updates -----------------------------------------------------\n\n\/\/ Called in the renderer when the byte counts have changed. We send a message\n\/\/ to the plugin to synchronize its counts so it can respond to status polls\n\/\/ from the plugin.\nvoid UpdateResourceLoadStatus(PP_Instance pp_instance,\n PP_Resource pp_resource,\n int64 bytes_sent,\n int64 total_bytes_to_be_sent,\n int64 bytes_received,\n int64 total_bytes_to_be_received) {\n Dispatcher* dispatcher = HostDispatcher::GetForInstance(pp_instance);\n dispatcher->Send(new PpapiMsg_PPBURLLoader_UpdateProgress(\n INTERFACE_ID_PPB_URL_LOADER, pp_resource,\n bytes_sent, total_bytes_to_be_sent,\n bytes_received, total_bytes_to_be_received));\n}\n\n\/\/ Data associated with callbacks for ReadResponseBody.\nstruct ReadCallbackInfo {\n base::WeakPtr<PPB_URLLoader_Proxy> loader;\n PP_Resource pp_resource;\n std::string read_buffer;\n};\n\n\/\/ Callback for renderer calls to ReadResponseBody. This function will forward\n\/\/ the result to the plugin and clean up the callback info.\nvoid ReadCallbackHandler(void* user_data, int32_t result) {\n scoped_ptr<ReadCallbackInfo> info(static_cast<ReadCallbackInfo*>(user_data));\n if (!info->loader)\n return;\n\n int32_t bytes_read = 0;\n if (result > 0)\n bytes_read = result; \/\/ Positive results indicate bytes read.\n info->read_buffer.resize(bytes_read);\n\n info->loader->dispatcher()->Send(\n new PpapiMsg_PPBURLLoader_ReadResponseBody_Ack(\n INTERFACE_ID_PPB_URL_LOADER, info->pp_resource,\n result, info->read_buffer));\n}\n\n} \/\/ namespace\n\n\/\/ PPB_URLLoader_Proxy ---------------------------------------------------------\n\nPPB_URLLoader_Proxy::PPB_URLLoader_Proxy(Dispatcher* dispatcher,\n const void* target_interface)\n : InterfaceProxy(dispatcher, target_interface) {\n}\n\nPPB_URLLoader_Proxy::~PPB_URLLoader_Proxy() {\n}\n\n\/\/ static\nvoid PPB_URLLoader_Proxy::TrackPluginResource(PP_Resource url_loader_resource) {\n linked_ptr<URLLoader> object(new URLLoader);\n PluginDispatcher::Get()->plugin_resource_tracker()->AddResource(\n url_loader_resource, object);\n}\n\nconst void* PPB_URLLoader_Proxy::GetSourceInterface() const {\n return &ppb_urlloader;\n}\n\nInterfaceID PPB_URLLoader_Proxy::GetInterfaceId() const {\n return INTERFACE_ID_PPB_URL_LOADER;\n}\n\nvoid PPB_URLLoader_Proxy::OnMessageReceived(const IPC::Message& msg) {\n IPC_BEGIN_MESSAGE_MAP(PPB_URLLoader_Proxy, msg)\n IPC_MESSAGE_HANDLER(PpapiHostMsg_PPBURLLoader_Create,\n OnMsgCreate)\n IPC_MESSAGE_HANDLER(PpapiHostMsg_PPBURLLoader_Open,\n OnMsgOpen)\n IPC_MESSAGE_HANDLER(PpapiHostMsg_PPBURLLoader_FollowRedirect,\n OnMsgFollowRedirect)\n IPC_MESSAGE_HANDLER(PpapiHostMsg_PPBURLLoader_GetResponseInfo,\n OnMsgGetResponseInfo)\n IPC_MESSAGE_HANDLER(PpapiHostMsg_PPBURLLoader_ReadResponseBody,\n OnMsgReadResponseBody)\n IPC_MESSAGE_HANDLER(PpapiHostMsg_PPBURLLoader_FinishStreamingToFile,\n OnMsgFinishStreamingToFile)\n IPC_MESSAGE_HANDLER(PpapiHostMsg_PPBURLLoader_Close,\n OnMsgClose)\n\n IPC_MESSAGE_HANDLER(PpapiMsg_PPBURLLoader_UpdateProgress,\n OnMsgUpdateProgress)\n IPC_MESSAGE_HANDLER(PpapiMsg_PPBURLLoader_ReadResponseBody_Ack,\n OnMsgReadResponseBodyAck)\n IPC_END_MESSAGE_MAP()\n \/\/ TODO(brettw) handle bad messages!\n}\n\nvoid PPB_URLLoader_Proxy::OnMsgCreate(PP_Instance instance,\n PP_Resource* result) {\n *result = ppb_url_loader_target()->Create(instance);\n}\n\nvoid PPB_URLLoader_Proxy::OnMsgOpen(PP_Resource loader,\n PP_Resource request_info,\n uint32_t serialized_callback) {\n PP_CompletionCallback callback = ReceiveCallback(serialized_callback);\n int32_t result = ppb_url_loader_target()->Open(\n loader, request_info, callback);\n if (result != PP_ERROR_WOULDBLOCK)\n PP_RunCompletionCallback(&callback, result);\n}\n\nvoid PPB_URLLoader_Proxy::OnMsgFollowRedirect(\n PP_Resource loader,\n uint32_t serialized_callback) {\n PP_CompletionCallback callback = ReceiveCallback(serialized_callback);\n int32_t result = ppb_url_loader_target()->FollowRedirect(\n loader, callback);\n if (result != PP_ERROR_WOULDBLOCK)\n PP_RunCompletionCallback(&callback, result);\n}\n\nvoid PPB_URLLoader_Proxy::OnMsgGetResponseInfo(PP_Resource loader,\n PP_Resource* result) {\n *result = ppb_url_loader_target()->GetResponseInfo(loader);\n}\n\nvoid PPB_URLLoader_Proxy::OnMsgReadResponseBody(\n PP_Resource loader,\n int32_t bytes_to_read) {\n \/\/ The plugin could be sending us malicious messages, don't accept negative\n \/\/ sizes.\n if (bytes_to_read < 0) {\n \/\/ TODO(brettw) kill plugin.\n bytes_to_read = 0;\n }\n\n \/\/ This heap object will get deleted by the callback handler.\n \/\/ TODO(brettw) this will be leaked if the plugin closes the resource!\n \/\/ (Also including the plugin unloading and having the resource implicitly\n \/\/ destroyed. Depending on the cleanup ordering, we may not need the weak\n \/\/ pointer here.)\n ReadCallbackInfo* info = new ReadCallbackInfo;\n info->loader = AsWeakPtr();\n info->pp_resource = loader;\n info->read_buffer.resize(bytes_to_read);\n\n int32_t result = ppb_url_loader_target()->ReadResponseBody(\n loader, const_cast<char*>(info->read_buffer.c_str()), bytes_to_read,\n PP_MakeCompletionCallback(&ReadCallbackHandler, info));\n if (result != PP_ERROR_WOULDBLOCK) {\n \/\/ Send error (or perhaps success for synchronous reads) back to plugin.\n \/\/ The callback function is already set up to do this and also delete the\n \/\/ callback info.\n ReadCallbackHandler(info, result);\n }\n}\n\nvoid PPB_URLLoader_Proxy::OnMsgFinishStreamingToFile(\n PP_Resource loader,\n uint32_t serialized_callback) {\n PP_CompletionCallback callback = ReceiveCallback(serialized_callback);\n int32_t result = ppb_url_loader_target()->FinishStreamingToFile(\n loader, callback);\n if (result != PP_ERROR_WOULDBLOCK)\n PP_RunCompletionCallback(&callback, result);\n}\n\nvoid PPB_URLLoader_Proxy::OnMsgClose(PP_Resource loader) {\n ppb_url_loader_target()->Close(loader);\n}\n\nvoid PPB_URLLoader_Proxy::OnMsgUpdateProgress(\n PP_Resource resource,\n int64_t bytes_sent,\n int64_t total_bytes_to_be_sent,\n int64_t bytes_received,\n int64_t total_bytes_to_be_received) {\n URLLoader* object = PluginResource::GetAs<URLLoader>(resource);\n if (!object) {\n NOTREACHED();\n return;\n }\n\n object->bytes_sent_ = bytes_sent;\n object->total_bytes_to_be_sent_ = total_bytes_to_be_sent;\n object->bytes_received_ = bytes_received;\n object->total_bytes_to_be_received_ = total_bytes_to_be_received;\n}\n\nvoid PPB_URLLoader_Proxy::OnMsgReadResponseBodyAck(PP_Resource pp_resource,\n int32 result,\n const std::string& data) {\n URLLoader* object = PluginResource::GetAs<URLLoader>(pp_resource);\n if (!object) {\n NOTREACHED();\n return;\n }\n\n if (!object->current_read_callback_.func || !object->current_read_buffer_) {\n NOTREACHED();\n return;\n }\n\n \/\/ In the error case, the string will be empty, so we can always just copy\n \/\/ out of it before issuing the callback.\n memcpy(object->current_read_buffer_, data.c_str(), data.length());\n\n \/\/ The plugin should be able to make a new request from their callback, so\n \/\/ we have to clear our copy first.\n PP_CompletionCallback temp_callback = object->current_read_callback_;\n object->current_read_callback_ = PP_BlockUntilComplete();\n object->current_read_buffer_ = NULL;\n PP_RunCompletionCallback(&temp_callback, result);\n}\n\n} \/\/ namespace proxy\n} \/\/ namespace pp\n<commit_msg>Remove unused function.<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\/proxy\/ppb_url_loader_proxy.h\"\n\n#include <vector>\n\n#include \"base\/logging.h\"\n#include \"build\/build_config.h\"\n#include \"ppapi\/c\/pp_completion_callback.h\"\n#include \"ppapi\/c\/pp_errors.h\"\n#include \"ppapi\/c\/pp_resource.h\"\n#include \"ppapi\/c\/dev\/ppb_url_loader_dev.h\"\n#include \"ppapi\/proxy\/host_dispatcher.h\"\n#include \"ppapi\/proxy\/plugin_dispatcher.h\"\n#include \"ppapi\/proxy\/plugin_resource.h\"\n#include \"ppapi\/proxy\/ppapi_messages.h\"\n#include \"ppapi\/proxy\/ppb_url_response_info_proxy.h\"\n\n#if defined(OS_LINUX)\n#include <sys\/shm.h>\n#endif\n\nnamespace pp {\nnamespace proxy {\n\nclass URLLoader : public PluginResource {\n public:\n URLLoader();\n virtual ~URLLoader();\n\n \/\/ Resource overrides.\n virtual URLLoader* AsURLLoader() { return this; }\n\n \/\/ Initialized to -1. Will be set to nonnegative values by the UpdateProgress\n \/\/ message when the values are known.\n int64_t bytes_sent_;\n int64_t total_bytes_to_be_sent_;\n int64_t bytes_received_;\n int64_t total_bytes_to_be_received_;\n\n \/\/ When an asynchronous read is pending, this will contain the callback and\n \/\/ the buffer to put the data.\n PP_CompletionCallback current_read_callback_;\n char* current_read_buffer_;\n\n private:\n DISALLOW_COPY_AND_ASSIGN(URLLoader);\n};\n\nURLLoader::URLLoader()\n : bytes_sent_(-1),\n total_bytes_to_be_sent_(-1),\n bytes_received_(-1),\n total_bytes_to_be_received_(-1),\n current_read_callback_(PP_MakeCompletionCallback(NULL, NULL)),\n current_read_buffer_(NULL) {\n}\n\nURLLoader::~URLLoader() {\n}\n\nnamespace {\n\n\/\/ Plugin interface implmentation ----------------------------------------------\n\nPP_Resource Create(PP_Instance instance_id) {\n PluginDispatcher* dispatcher = PluginDispatcher::Get();\n PP_Resource result = 0;\n dispatcher->Send(new PpapiHostMsg_PPBURLLoader_Create(\n INTERFACE_ID_PPB_URL_LOADER, instance_id, &result));\n if (result)\n PPB_URLLoader_Proxy::TrackPluginResource(result);\n return result;\n}\n\nPP_Bool IsURLLoader(PP_Resource resource) {\n URLLoader* object = PluginResource::GetAs<URLLoader>(resource);\n return BoolToPPBool(!!object);\n}\n\nint32_t Open(PP_Resource loader_id,\n PP_Resource request_id,\n PP_CompletionCallback callback) {\n Dispatcher* dispatcher = PluginDispatcher::Get();\n dispatcher->Send(new PpapiHostMsg_PPBURLLoader_Open(\n INTERFACE_ID_PPB_URL_LOADER, loader_id, request_id,\n dispatcher->callback_tracker().SendCallback(callback)));\n return PP_ERROR_WOULDBLOCK;\n}\n\nint32_t FollowRedirect(PP_Resource loader_id,\n PP_CompletionCallback callback) {\n Dispatcher* dispatcher = PluginDispatcher::Get();\n dispatcher->Send(new PpapiHostMsg_PPBURLLoader_FollowRedirect(\n INTERFACE_ID_PPB_URL_LOADER, loader_id,\n dispatcher->callback_tracker().SendCallback(callback)));\n return PP_ERROR_WOULDBLOCK;\n}\n\nPP_Bool GetUploadProgress(PP_Resource loader_id,\n int64_t* bytes_sent,\n int64_t* total_bytes_to_be_sent) {\n URLLoader* object = PluginResource::GetAs<URLLoader>(loader_id);\n if (!object || object->bytes_sent_ == -1) {\n *bytes_sent = 0;\n *total_bytes_to_be_sent = 0;\n return PP_FALSE;\n }\n *bytes_sent = object->bytes_sent_;\n *total_bytes_to_be_sent = object->total_bytes_to_be_sent_;\n return PP_TRUE;\n}\n\nPP_Bool GetDownloadProgress(PP_Resource loader_id,\n int64_t* bytes_received,\n int64_t* total_bytes_to_be_received) {\n URLLoader* object = PluginResource::GetAs<URLLoader>(loader_id);\n if (!object || object->bytes_received_ == -1) {\n *bytes_received = 0;\n *total_bytes_to_be_received = 0;\n return PP_FALSE;\n }\n *bytes_received = object->bytes_received_;\n *total_bytes_to_be_received = object->total_bytes_to_be_received_;\n return PP_TRUE;\n}\n\nPP_Resource GetResponseInfo(PP_Resource loader_id) {\n \/\/ If we find that plugins are frequently requesting the response info, we\n \/\/ can improve performance by caching the PP_Resource in the URLLoader\n \/\/ object. This way we only have to do IPC for the first request. However,\n \/\/ it seems that most plugins will only call this once so there's no use\n \/\/ optimizing this case.\n\n PP_Resource result;\n PluginDispatcher* dispatcher = PluginDispatcher::Get();\n dispatcher->Send(new PpapiHostMsg_PPBURLLoader_GetResponseInfo(\n INTERFACE_ID_PPB_URL_LOADER, loader_id, &result));\n if (dispatcher->plugin_resource_tracker()->PreparePreviouslyTrackedResource(\n result))\n return result;\n\n \/\/ Tell the response info to create a tracking object and add it to the\n \/\/ resource tracker.\n PPB_URLResponseInfo_Proxy::TrackPluginResource(result);\n return result;\n}\n\nint32_t ReadResponseBody(PP_Resource loader_id,\n char* buffer,\n int32_t bytes_to_read,\n PP_CompletionCallback callback) {\n URLLoader* object = PluginResource::GetAs<URLLoader>(loader_id);\n if (!object)\n return PP_ERROR_BADRESOURCE;\n\n if (!buffer)\n return PP_ERROR_BADARGUMENT; \/\/ Must specify an output buffer.\n if (object->current_read_callback_.func)\n return PP_ERROR_INPROGRESS; \/\/ Can only have one request pending.\n\n \/\/ Currently we don't support sync calls to read. We'll need to revisit\n \/\/ how this works when we allow blocking calls (from background threads).\n if (!callback.func)\n return PP_ERROR_BADARGUMENT;\n\n object->current_read_callback_ = callback;\n object->current_read_buffer_ = buffer;\n\n PluginDispatcher::Get()->Send(new PpapiHostMsg_PPBURLLoader_ReadResponseBody(\n INTERFACE_ID_PPB_URL_LOADER, loader_id, bytes_to_read));\n return PP_ERROR_WOULDBLOCK;\n}\n\nint32_t FinishStreamingToFile(PP_Resource loader_id,\n PP_CompletionCallback callback) {\n Dispatcher* dispatcher = PluginDispatcher::Get();\n dispatcher->Send(new PpapiHostMsg_PPBURLLoader_FinishStreamingToFile(\n INTERFACE_ID_PPB_URL_LOADER, loader_id,\n dispatcher->callback_tracker().SendCallback(callback)));\n return PP_ERROR_WOULDBLOCK;\n}\n\nvoid Close(PP_Resource loader_id) {\n PluginDispatcher::Get()->Send(new PpapiHostMsg_PPBURLLoader_Close(\n INTERFACE_ID_PPB_URL_LOADER, loader_id));\n}\n\nconst PPB_URLLoader_Dev ppb_urlloader = {\n &Create,\n &IsURLLoader,\n &Open,\n &FollowRedirect,\n &GetUploadProgress,\n &GetDownloadProgress,\n &GetResponseInfo,\n &ReadResponseBody,\n &FinishStreamingToFile,\n &Close\n};\n\n\/\/ Renderer status updates -----------------------------------------------------\n\n\/\/ Data associated with callbacks for ReadResponseBody.\nstruct ReadCallbackInfo {\n base::WeakPtr<PPB_URLLoader_Proxy> loader;\n PP_Resource pp_resource;\n std::string read_buffer;\n};\n\n\/\/ Callback for renderer calls to ReadResponseBody. This function will forward\n\/\/ the result to the plugin and clean up the callback info.\nvoid ReadCallbackHandler(void* user_data, int32_t result) {\n scoped_ptr<ReadCallbackInfo> info(static_cast<ReadCallbackInfo*>(user_data));\n if (!info->loader)\n return;\n\n int32_t bytes_read = 0;\n if (result > 0)\n bytes_read = result; \/\/ Positive results indicate bytes read.\n info->read_buffer.resize(bytes_read);\n\n info->loader->dispatcher()->Send(\n new PpapiMsg_PPBURLLoader_ReadResponseBody_Ack(\n INTERFACE_ID_PPB_URL_LOADER, info->pp_resource,\n result, info->read_buffer));\n}\n\n} \/\/ namespace\n\n\/\/ PPB_URLLoader_Proxy ---------------------------------------------------------\n\nPPB_URLLoader_Proxy::PPB_URLLoader_Proxy(Dispatcher* dispatcher,\n const void* target_interface)\n : InterfaceProxy(dispatcher, target_interface) {\n}\n\nPPB_URLLoader_Proxy::~PPB_URLLoader_Proxy() {\n}\n\n\/\/ static\nvoid PPB_URLLoader_Proxy::TrackPluginResource(PP_Resource url_loader_resource) {\n linked_ptr<URLLoader> object(new URLLoader);\n PluginDispatcher::Get()->plugin_resource_tracker()->AddResource(\n url_loader_resource, object);\n}\n\nconst void* PPB_URLLoader_Proxy::GetSourceInterface() const {\n return &ppb_urlloader;\n}\n\nInterfaceID PPB_URLLoader_Proxy::GetInterfaceId() const {\n return INTERFACE_ID_PPB_URL_LOADER;\n}\n\nvoid PPB_URLLoader_Proxy::OnMessageReceived(const IPC::Message& msg) {\n IPC_BEGIN_MESSAGE_MAP(PPB_URLLoader_Proxy, msg)\n IPC_MESSAGE_HANDLER(PpapiHostMsg_PPBURLLoader_Create,\n OnMsgCreate)\n IPC_MESSAGE_HANDLER(PpapiHostMsg_PPBURLLoader_Open,\n OnMsgOpen)\n IPC_MESSAGE_HANDLER(PpapiHostMsg_PPBURLLoader_FollowRedirect,\n OnMsgFollowRedirect)\n IPC_MESSAGE_HANDLER(PpapiHostMsg_PPBURLLoader_GetResponseInfo,\n OnMsgGetResponseInfo)\n IPC_MESSAGE_HANDLER(PpapiHostMsg_PPBURLLoader_ReadResponseBody,\n OnMsgReadResponseBody)\n IPC_MESSAGE_HANDLER(PpapiHostMsg_PPBURLLoader_FinishStreamingToFile,\n OnMsgFinishStreamingToFile)\n IPC_MESSAGE_HANDLER(PpapiHostMsg_PPBURLLoader_Close,\n OnMsgClose)\n\n IPC_MESSAGE_HANDLER(PpapiMsg_PPBURLLoader_UpdateProgress,\n OnMsgUpdateProgress)\n IPC_MESSAGE_HANDLER(PpapiMsg_PPBURLLoader_ReadResponseBody_Ack,\n OnMsgReadResponseBodyAck)\n IPC_END_MESSAGE_MAP()\n \/\/ TODO(brettw) handle bad messages!\n}\n\nvoid PPB_URLLoader_Proxy::OnMsgCreate(PP_Instance instance,\n PP_Resource* result) {\n *result = ppb_url_loader_target()->Create(instance);\n}\n\nvoid PPB_URLLoader_Proxy::OnMsgOpen(PP_Resource loader,\n PP_Resource request_info,\n uint32_t serialized_callback) {\n PP_CompletionCallback callback = ReceiveCallback(serialized_callback);\n int32_t result = ppb_url_loader_target()->Open(\n loader, request_info, callback);\n if (result != PP_ERROR_WOULDBLOCK)\n PP_RunCompletionCallback(&callback, result);\n}\n\nvoid PPB_URLLoader_Proxy::OnMsgFollowRedirect(\n PP_Resource loader,\n uint32_t serialized_callback) {\n PP_CompletionCallback callback = ReceiveCallback(serialized_callback);\n int32_t result = ppb_url_loader_target()->FollowRedirect(\n loader, callback);\n if (result != PP_ERROR_WOULDBLOCK)\n PP_RunCompletionCallback(&callback, result);\n}\n\nvoid PPB_URLLoader_Proxy::OnMsgGetResponseInfo(PP_Resource loader,\n PP_Resource* result) {\n *result = ppb_url_loader_target()->GetResponseInfo(loader);\n}\n\nvoid PPB_URLLoader_Proxy::OnMsgReadResponseBody(\n PP_Resource loader,\n int32_t bytes_to_read) {\n \/\/ The plugin could be sending us malicious messages, don't accept negative\n \/\/ sizes.\n if (bytes_to_read < 0) {\n \/\/ TODO(brettw) kill plugin.\n bytes_to_read = 0;\n }\n\n \/\/ This heap object will get deleted by the callback handler.\n \/\/ TODO(brettw) this will be leaked if the plugin closes the resource!\n \/\/ (Also including the plugin unloading and having the resource implicitly\n \/\/ destroyed. Depending on the cleanup ordering, we may not need the weak\n \/\/ pointer here.)\n ReadCallbackInfo* info = new ReadCallbackInfo;\n info->loader = AsWeakPtr();\n info->pp_resource = loader;\n info->read_buffer.resize(bytes_to_read);\n\n int32_t result = ppb_url_loader_target()->ReadResponseBody(\n loader, const_cast<char*>(info->read_buffer.c_str()), bytes_to_read,\n PP_MakeCompletionCallback(&ReadCallbackHandler, info));\n if (result != PP_ERROR_WOULDBLOCK) {\n \/\/ Send error (or perhaps success for synchronous reads) back to plugin.\n \/\/ The callback function is already set up to do this and also delete the\n \/\/ callback info.\n ReadCallbackHandler(info, result);\n }\n}\n\nvoid PPB_URLLoader_Proxy::OnMsgFinishStreamingToFile(\n PP_Resource loader,\n uint32_t serialized_callback) {\n PP_CompletionCallback callback = ReceiveCallback(serialized_callback);\n int32_t result = ppb_url_loader_target()->FinishStreamingToFile(\n loader, callback);\n if (result != PP_ERROR_WOULDBLOCK)\n PP_RunCompletionCallback(&callback, result);\n}\n\nvoid PPB_URLLoader_Proxy::OnMsgClose(PP_Resource loader) {\n ppb_url_loader_target()->Close(loader);\n}\n\nvoid PPB_URLLoader_Proxy::OnMsgUpdateProgress(\n PP_Resource resource,\n int64_t bytes_sent,\n int64_t total_bytes_to_be_sent,\n int64_t bytes_received,\n int64_t total_bytes_to_be_received) {\n URLLoader* object = PluginResource::GetAs<URLLoader>(resource);\n if (!object) {\n NOTREACHED();\n return;\n }\n\n object->bytes_sent_ = bytes_sent;\n object->total_bytes_to_be_sent_ = total_bytes_to_be_sent;\n object->bytes_received_ = bytes_received;\n object->total_bytes_to_be_received_ = total_bytes_to_be_received;\n}\n\nvoid PPB_URLLoader_Proxy::OnMsgReadResponseBodyAck(PP_Resource pp_resource,\n int32 result,\n const std::string& data) {\n URLLoader* object = PluginResource::GetAs<URLLoader>(pp_resource);\n if (!object) {\n NOTREACHED();\n return;\n }\n\n if (!object->current_read_callback_.func || !object->current_read_buffer_) {\n NOTREACHED();\n return;\n }\n\n \/\/ In the error case, the string will be empty, so we can always just copy\n \/\/ out of it before issuing the callback.\n memcpy(object->current_read_buffer_, data.c_str(), data.length());\n\n \/\/ The plugin should be able to make a new request from their callback, so\n \/\/ we have to clear our copy first.\n PP_CompletionCallback temp_callback = object->current_read_callback_;\n object->current_read_callback_ = PP_BlockUntilComplete();\n object->current_read_buffer_ = NULL;\n PP_RunCompletionCallback(&temp_callback, result);\n}\n\n} \/\/ namespace proxy\n} \/\/ namespace pp\n<|endoftext|>"} {"text":"<commit_before>#pragma once\n\n#include \"defaults.hpp\"\n#include <fstream>\n#include <iomanip>\n\nnamespace gftools {\n\n\/** num_io is a wrapper around another object (of type T). \n num_io does input\/output operations.\n such as streaming, saving to\/loading from plaintext files.\n Internally it stores references to an instance of type T.\n Typical objects are: numbers, arrays of numbers, complex numbers, grid points*\/\ntemplate <typename T> class num_io {\npublic:\n typedef typename std::remove_reference<T>::type type; \n\n \/\/\/ Construct from value\n num_io(type& v):value_(v){}\n\n \/\/\/ Access the internally stored value\n type &operator()(){return value_;}\n \/\/\/ Const access to the internally stored value\n const type &operator()() const{return value_;}\n \/\/\/ Save the object to a file with a filename passed in as a name\n void savetxt(const std::string& filename) { \n std::cout << \"Saving \" << typeid(*this).name() << \" to \" << filename << std::endl;\n std::ofstream out; out.open(filename.c_str()); out << *this << std::endl; out.close(); \n }; \n \/\/\/ Read the object from a file with a filename passed in as a name\n void loadtxt(const std::string& filename) { \n std::cout << \"Loading \" << typeid(*this).name() << \" from \" << filename << std::endl;\n std::ifstream out; out.open(filename.c_str()); if (out.fail()) throw (std::bad_exception()); out >> *this; out.close(); \n }; \n\n static constexpr int precision() { return prec_; }\n static constexpr double tolerance() { return tol_; }\n\nprivate:\n \/\/\/ Underlying value.\n type& value_;\n \/\/\/ Output precision. TODO: replace c++-11 construct constexpr with something backwards compatible.\n static constexpr int prec_ = std::numeric_limits<double>::max_digits10;\n \/\/\/ Comparison tolerance\n static constexpr double tol_ = 1e-10;\n};\n\n\/\/\/ A shortcut to make num_io wrapper objects without specifying the template parameter\ntemplate <typename T>\nnum_io<T> make_num_io (T &v){return num_io<T>(v);}\n\ntemplate <typename T> inline std::ostream& operator<<(std::ostream& lhs, const num_io<T> &in) {\n lhs << std::setprecision(in.precision()) << in(); return lhs;\n};\ntemplate <typename T> \ninline std::istream& operator>>(std::istream& lhs, num_io<T> out) {\n lhs >> out(); return lhs;\n}\ntemplate <>\ninline std::ostream& operator<<(std::ostream& lhs, const num_io<complex_type> &in){lhs << std::setprecision(in.precision()) << real(in()) << \" \" << imag(in()); return lhs;};\ntemplate <>\ninline std::istream& operator>>(std::istream& lhs, num_io<complex_type> out){real_type re,im; lhs >> re; lhs >> im; out() = re+I*im; return lhs;};\n\n\n} \/\/ end of namespace gftools\n<commit_msg>num_io : add helper value() method<commit_after>#pragma once\n\n#include \"defaults.hpp\"\n#include <fstream>\n#include <iomanip>\n\nnamespace gftools {\n\n\/** num_io is a wrapper around another object (of type T). \n num_io does input\/output operations.\n such as streaming, saving to\/loading from plaintext files.\n Internally it stores references to an instance of type T.\n Typical objects are: numbers, arrays of numbers, complex numbers, grid points*\/\ntemplate <typename T> class num_io {\npublic:\n typedef typename std::remove_reference<T>::type type; \n\n \/\/\/ Construct from value\n num_io(type& v):value_(v){}\n\n \/\/\/ Access the internally stored value\n type &operator()(){return value_;}\n \/\/\/ Const access to the internally stored value\n const type &operator()() const{return value_;}\n \/\/\/ Save the object to a file with a filename passed in as a name\n void savetxt(const std::string& filename) { \n std::cout << \"Saving \" << typeid(*this).name() << \" to \" << filename << std::endl;\n std::ofstream out; out.open(filename.c_str()); out << *this << std::endl; out.close(); \n }; \n \/\/\/ Read the object from a file with a filename passed in as a name\n void loadtxt(const std::string& filename) { \n std::cout << \"Loading \" << typeid(*this).name() << \" from \" << filename << std::endl;\n std::ifstream out; out.open(filename.c_str()); if (out.fail()) throw (std::bad_exception()); out >> *this; out.close(); \n }; \n\n type& value() { return value_; } \/\/ TODO : test using it\n type const& value() const { return value_; } \/\/ TODO : test using it\n static constexpr int precision() { return prec_; }\n static constexpr double tolerance() { return tol_; }\n\nprivate:\n \/\/\/ Underlying value.\n type& value_;\n \/\/\/ Output precision. TODO: replace c++-11 construct constexpr with something backwards compatible.\n static constexpr int prec_ = std::numeric_limits<double>::max_digits10;\n \/\/\/ Comparison tolerance\n static constexpr double tol_ = 1e-10;\n};\n\n\/\/\/ A shortcut to make num_io wrapper objects without specifying the template parameter\ntemplate <typename T>\nnum_io<T> make_num_io (T &v){return num_io<T>(v);}\n\ntemplate <typename T> inline std::ostream& operator<<(std::ostream& lhs, const num_io<T> &in) {\n lhs << std::setprecision(in.precision()) << in(); return lhs;\n};\ntemplate <typename T> \ninline std::istream& operator>>(std::istream& lhs, num_io<T> out) {\n lhs >> out(); return lhs;\n}\ntemplate <>\ninline std::ostream& operator<<(std::ostream& lhs, const num_io<complex_type> &in){lhs << std::setprecision(in.precision()) << real(in()) << \" \" << imag(in()); return lhs;};\ntemplate <>\ninline std::istream& operator>>(std::istream& lhs, num_io<complex_type> out){real_type re,im; lhs >> re; lhs >> im; out() = re+I*im; return lhs;};\n\n\n} \/\/ end of namespace gftools\n<|endoftext|>"} {"text":"<commit_before>#include \"render\/shader.h\"\n\n#include \"core\/assert.h\"\n#include <iostream>\n#include <vector>\n#include <fstream>\n#include <algorithm>\n#include <sstream>\n\n#include \"render\/gl.h\"\n#include \"render\/texture.h\"\n\n#include \"core\/filesystem.h\"\n\nShaderId::ShaderId() : id_(glCreateProgram()) {}\n\nShaderId::~ShaderId() { glDeleteProgram(id_); }\n\nGLuint ShaderId::id() const { return id_; }\n\nnamespace {\nconst Shader *¤tShader() {\n static const Shader *s = nullptr;\n return s;\n}\n}\n\nbool ShaderId::IsCurrentlyBound() const { return this == currentShader(); }\n\nvoid Use(const Shader *shader) {\n if (shader != nullptr) {\n glUseProgram(shader->id());\n }\n else {\n glUseProgram(0);\n }\n currentShader() = shader;\n}\n\nconst Shader* Shader::CurrentlyBound() {\n return currentShader();\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nnamespace {\nbool GetShaderCompileStatus(GLuint object) {\n int r = GL_TRUE;\n glGetShaderiv(object, GL_COMPILE_STATUS, &r);\n return r == GL_TRUE;\n}\n\nbool GetProgramLinkStatus(GLuint object) {\n int r = GL_TRUE;\n glGetProgramiv(object, GL_LINK_STATUS, &r);\n return r == GL_TRUE;\n}\n\nstd::string GetShaderLog(GLuint shader) {\n int length = 0;\n glGetShaderiv(shader, GL_INFO_LOG_LENGTH, &length);\n if (length <= 0) return \"\";\n const int max_length = length + 1;\n std::vector<char> str(max_length, 0);\n glGetShaderInfoLog(shader, max_length, &length, &str[0]);\n return &str[0];\n}\n\nstd::string GetProgramLog(GLuint shader) {\n int length = 0;\n glGetProgramiv(shader, GL_INFO_LOG_LENGTH, &length);\n if (length <= 0) return \"\";\n const int max_length = length + 1;\n std::vector<char> str(max_length, 0);\n glGetProgramInfoLog(shader, max_length, &length, &str[0]);\n return &str[0];\n}\n}\n\nvoid ReportError(const std::string &log, const std::string &type) {\n std::cerr << \"| ERROR::SHADER: Compile-time error: Type: \" << type << \"\\n\"\n << log\n << \"\\n -- --------------------------------------------------- -- \"\n << std::endl;\n}\n\nbool PrintErrorProgram(GLuint program) {\n if (GetProgramLinkStatus(program)) return true;\n const std::string &log = GetProgramLog(program);\n ReportError(log, \"PROGRAM\");\n return false;\n}\n\nvoid PrintErrorShader(GLuint shader, const std::string &type) {\n if (GetShaderCompileStatus(shader)) return;\n const std::string &log = GetShaderLog(shader);\n ReportError(log, type);\n}\n\nGLuint CompileShader(GLuint type, const GLchar *source,\n const std::string &name) {\n GLuint shader = glCreateShader(type);\n glShaderSource(shader, 1, &source, NULL);\n glCompileShader(shader);\n PrintErrorShader(shader, name);\n return shader;\n}\n\nvoid Shader::PreBind(const ShaderAttribute& attribute) {\n Assert(this);\n glBindAttribLocation(id(), attribute.id, attribute.name.c_str());\n bound_attributes_.push_back(attribute);\n}\n\nbool Shader::Compile(const GLchar *vertexSource, const GLchar *fragmentSource,\n const GLchar *geometrySource) {\n bool ret = true;\n\n GLuint sVertex = CompileShader(GL_VERTEX_SHADER, vertexSource, \"VERTEX\");\n GLuint sFragment =\n CompileShader(GL_FRAGMENT_SHADER, fragmentSource, \"FRAGMENT\");\n\n GLuint gShader = 0;\n if (geometrySource != nullptr) {\n gShader = CompileShader(GL_GEOMETRY_SHADER, geometrySource, \"GEOMETRY\");\n }\n\n glAttachShader(id(), sVertex);\n glAttachShader(id(), sFragment);\n if (geometrySource != nullptr) glAttachShader(id(), gShader);\n glLinkProgram(id());\n const bool link_error = PrintErrorProgram(id());\n if( link_error == false ) {\n ret = false;\n }\n\n glDeleteShader(sVertex);\n glDeleteShader(sFragment);\n if (geometrySource != nullptr) glDeleteShader(gShader);\n\n for(const auto& attribute : bound_attributes_) {\n int attribute_id = glGetAttribLocation(id(), attribute.name.c_str());\n if( attribute_id == attribute.id ) continue;\n if( attribute_id == -1 ) continue;\n std::cerr << attribute.name << \" was bound to \" << attribute_id << \" but was requested at \" << attribute.id << \"\\n\";\n ret = false;\n }\n\n return ret;\n}\n\nShaderUniform Shader::GetUniform(const std::string& name) {\n Assert(this);\n int uniform_id = glGetUniformLocation(id(), name.c_str());\n ShaderUniform uniform(name, uniform_id, this);\n bound_uniforms_.push_back(uniform);\n\n if(uniform.id == -1) {\n std::cerr << \"Failed to load \" << uniform.name << \" from shader \" << shader_name_ << \"\\n\";\n }\n\n return uniform;\n}\n\nvoid Shader::SetUniform(const ShaderUniform& attribute, glint val) {\n Assert(this);\n Assert(IsCurrentlyBound());\n Assert(HasBoundUniform(attribute));\n glUniform1i(attribute.id, val);\n}\n\nvoid Shader::SetUniform(const ShaderUniform& attribute, const Rgb& val) {\n Assert(this);\n Assert(IsCurrentlyBound());\n Assert(HasBoundUniform(attribute));\n if(attribute.id == -1) return;\n glUniform3f(attribute.id, val.GetRed(), val.GetGreen(), val.GetBlue());\n}\n\nvoid Shader::SetUniform(const ShaderUniform& attribute, const Rgba& val) {\n Assert(this);\n Assert(IsCurrentlyBound());\n Assert(HasBoundUniform(attribute));\n if(attribute.id == -1) return;\n glUniform4f(attribute.id, val.GetRed(), val.GetGreen(), val.GetBlue(), val.GetAlpha());\n}\n\nvoid Shader::SetUniform(const ShaderUniform& attribute, const vec4f& val) {\n Assert(this);\n Assert(IsCurrentlyBound());\n Assert(HasBoundUniform(attribute));\n if(attribute.id == -1) return;\n glUniform4f(attribute.id, val.x, val.y, val.z, val.w);\n}\n\nvoid Shader::SetUniform(const ShaderUniform& attribute, const mat4f& val) {\n Assert(this);\n Assert(IsCurrentlyBound());\n Assert(HasBoundUniform(attribute));\n if(attribute.id == -1) return;\n glUniformMatrix4fv(attribute.id, 1, GL_FALSE, val.GetDataPtr());\n}\n\nShader::Shader() {}\n\nnamespace {\nstd::string LoadPath(FileSystem* fs, const std::string& path) {\n std::string content;\n if( false == fs->ReadFileToString(path, &content) ) {\n return \"\";\n }\n else {\n return content;\n }\n#if 0\n std::ifstream t(path.c_str());\n\n if( !t ) {\n return \"\";\n }\n\n std::string str;\n\n t.seekg(0, std::ios::end);\n str.reserve(t.tellg());\n t.seekg(0, std::ios::beg);\n\n str.assign((std::istreambuf_iterator<char>(t)),\n std::istreambuf_iterator<char>());\n return str;\n#endif\n}\n}\n\nbool Shader::Load(FileSystem* fs, const std::string& file_path) {\n shader_name_ = file_path;\n auto vert = LoadPath(fs, file_path + \".vert\");\n auto frag = LoadPath(fs, file_path + \".frag\");\n auto geom = LoadPath(fs, file_path + \".geom\");\n bool fail = false;\n if( vert.empty() ) {\n std::cerr << \"Failed to load vert shader \" << file_path << \"\\n\";\n fail = true;\n }\n if( frag.empty() ) {\n std::cerr << \"Failed to load frag shader \" << file_path << \"\\n\";\n fail = true;\n }\n if( fail ) {\n return false;\n }\n\n fail = Compile(vert.c_str(), frag.c_str(), geom.empty() ? nullptr : geom.c_str());\n if( fail == false ) {\n std::cerr << \"Failed to compile shader \" << file_path << \"\\n\";\n }\n return fail;\n}\n\nconst std::vector<ShaderAttribute>& Shader::GetAttributes() const {\n Assert(this);\n return bound_attributes_;\n}\n\nconst std::string& Shader::GetName() const {\n Assert(this);\n return shader_name_;\n}\n\nbool Shader::HasBoundAttribute(const ShaderAttribute &attribute) const {\n return std::find(bound_attributes_.begin(), bound_attributes_.end(), attribute)\n != bound_attributes_.end();\n}\n\nbool Shader::HasBoundUniform(const ShaderUniform& uniform) const {\n return std::find(bound_uniforms_.begin(), bound_uniforms_.end(), uniform)\n != bound_uniforms_.end();\n}\n\nvoid BindTextureToShader(Texture2d* texture, Shader* shader, const ShaderUniform& attribute, unsigned int index)\n{\n Assert(index < 16); \/\/ at most 16 texture units\n GLenum gl_id = GL_TEXTURE0 + index;\n glActiveTexture(gl_id);\n Use(texture);\n shader->SetUniform(attribute, index);\n}\n<commit_msg>added todo<commit_after>#include \"render\/shader.h\"\n\n#include \"core\/assert.h\"\n#include <iostream>\n#include <vector>\n#include <fstream>\n#include <algorithm>\n#include <sstream>\n\n#include \"render\/gl.h\"\n#include \"render\/texture.h\"\n\n#include \"core\/filesystem.h\"\n\nShaderId::ShaderId() : id_(glCreateProgram()) {}\n\nShaderId::~ShaderId() { glDeleteProgram(id_); }\n\nGLuint ShaderId::id() const { return id_; }\n\nnamespace {\nconst Shader *¤tShader() {\n static const Shader *s = nullptr;\n return s;\n}\n}\n\nbool ShaderId::IsCurrentlyBound() const { return this == currentShader(); }\n\nvoid Use(const Shader *shader) {\n if (shader != nullptr) {\n glUseProgram(shader->id());\n }\n else {\n glUseProgram(0);\n }\n currentShader() = shader;\n}\n\nconst Shader* Shader::CurrentlyBound() {\n return currentShader();\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nnamespace {\nbool GetShaderCompileStatus(GLuint object) {\n int r = GL_TRUE;\n glGetShaderiv(object, GL_COMPILE_STATUS, &r);\n return r == GL_TRUE;\n}\n\nbool GetProgramLinkStatus(GLuint object) {\n int r = GL_TRUE;\n glGetProgramiv(object, GL_LINK_STATUS, &r);\n return r == GL_TRUE;\n}\n\nstd::string GetShaderLog(GLuint shader) {\n int length = 0;\n glGetShaderiv(shader, GL_INFO_LOG_LENGTH, &length);\n if (length <= 0) return \"\";\n const int max_length = length + 1;\n std::vector<char> str(max_length, 0);\n glGetShaderInfoLog(shader, max_length, &length, &str[0]);\n return &str[0];\n}\n\nstd::string GetProgramLog(GLuint shader) {\n int length = 0;\n glGetProgramiv(shader, GL_INFO_LOG_LENGTH, &length);\n if (length <= 0) return \"\";\n const int max_length = length + 1;\n std::vector<char> str(max_length, 0);\n glGetProgramInfoLog(shader, max_length, &length, &str[0]);\n return &str[0];\n}\n}\n\nvoid ReportError(const std::string &log, const std::string &type) {\n std::cerr << \"| ERROR::SHADER: Compile-time error: Type: \" << type << \"\\n\"\n << log\n << \"\\n -- --------------------------------------------------- -- \"\n << std::endl;\n}\n\nbool PrintErrorProgram(GLuint program) {\n if (GetProgramLinkStatus(program)) return true;\n const std::string &log = GetProgramLog(program);\n ReportError(log, \"PROGRAM\");\n return false;\n}\n\nvoid PrintErrorShader(GLuint shader, const std::string &type) {\n if (GetShaderCompileStatus(shader)) return;\n const std::string &log = GetShaderLog(shader);\n ReportError(log, type);\n}\n\nGLuint CompileShader(GLuint type, const GLchar *source,\n const std::string &name) {\n GLuint shader = glCreateShader(type);\n glShaderSource(shader, 1, &source, NULL);\n glCompileShader(shader);\n PrintErrorShader(shader, name);\n return shader;\n}\n\nvoid Shader::PreBind(const ShaderAttribute& attribute) {\n Assert(this);\n glBindAttribLocation(id(), attribute.id, attribute.name.c_str());\n bound_attributes_.push_back(attribute);\n}\n\nbool Shader::Compile(const GLchar *vertexSource, const GLchar *fragmentSource,\n const GLchar *geometrySource) {\n bool ret = true;\n\n GLuint sVertex = CompileShader(GL_VERTEX_SHADER, vertexSource, \"VERTEX\");\n GLuint sFragment =\n CompileShader(GL_FRAGMENT_SHADER, fragmentSource, \"FRAGMENT\");\n\n GLuint gShader = 0;\n if (geometrySource != nullptr) {\n gShader = CompileShader(GL_GEOMETRY_SHADER, geometrySource, \"GEOMETRY\");\n }\n\n glAttachShader(id(), sVertex);\n glAttachShader(id(), sFragment);\n if (geometrySource != nullptr) glAttachShader(id(), gShader);\n glLinkProgram(id());\n const bool link_error = PrintErrorProgram(id());\n if( link_error == false ) {\n ret = false;\n }\n\n glDeleteShader(sVertex);\n glDeleteShader(sFragment);\n if (geometrySource != nullptr) glDeleteShader(gShader);\n\n for(const auto& attribute : bound_attributes_) {\n int attribute_id = glGetAttribLocation(id(), attribute.name.c_str());\n if( attribute_id == attribute.id ) continue;\n if( attribute_id == -1 ) continue;\n std::cerr << attribute.name << \" was bound to \" << attribute_id << \" but was requested at \" << attribute.id << \"\\n\";\n ret = false;\n }\n\n return ret;\n}\n\nShaderUniform Shader::GetUniform(const std::string& name) {\n Assert(this);\n int uniform_id = glGetUniformLocation(id(), name.c_str());\n ShaderUniform uniform(name, uniform_id, this);\n bound_uniforms_.push_back(uniform);\n\n if(uniform.id == -1) {\n std::cerr << \"Failed to load \" << uniform.name << \" from shader \" << shader_name_ << \"\\n\";\n }\n\n return uniform;\n}\n\nvoid Shader::SetUniform(const ShaderUniform& attribute, glint val) {\n Assert(this);\n Assert(IsCurrentlyBound());\n Assert(HasBoundUniform(attribute));\n glUniform1i(attribute.id, val);\n}\n\nvoid Shader::SetUniform(const ShaderUniform& attribute, const Rgb& val) {\n Assert(this);\n Assert(IsCurrentlyBound());\n Assert(HasBoundUniform(attribute));\n if(attribute.id == -1) return;\n glUniform3f(attribute.id, val.GetRed(), val.GetGreen(), val.GetBlue());\n}\n\nvoid Shader::SetUniform(const ShaderUniform& attribute, const Rgba& val) {\n Assert(this);\n Assert(IsCurrentlyBound());\n Assert(HasBoundUniform(attribute));\n if(attribute.id == -1) return;\n glUniform4f(attribute.id, val.GetRed(), val.GetGreen(), val.GetBlue(), val.GetAlpha());\n}\n\nvoid Shader::SetUniform(const ShaderUniform& attribute, const vec4f& val) {\n Assert(this);\n Assert(IsCurrentlyBound());\n Assert(HasBoundUniform(attribute));\n if(attribute.id == -1) return;\n glUniform4f(attribute.id, val.x, val.y, val.z, val.w);\n}\n\nvoid Shader::SetUniform(const ShaderUniform& attribute, const mat4f& val) {\n Assert(this);\n Assert(IsCurrentlyBound());\n Assert(HasBoundUniform(attribute));\n if(attribute.id == -1) return;\n glUniformMatrix4fv(attribute.id, 1, GL_FALSE, val.GetDataPtr());\n}\n\nShader::Shader() {}\n\nnamespace {\nstd::string LoadPath(FileSystem* fs, const std::string& path) {\n \/\/ todo: replace with a template instead of basic string\n std::string content;\n if( false == fs->ReadFileToString(path, &content) ) {\n return \"\";\n }\n else {\n return content;\n }\n#if 0\n std::ifstream t(path.c_str());\n\n if( !t ) {\n return \"\";\n }\n\n std::string str;\n\n t.seekg(0, std::ios::end);\n str.reserve(t.tellg());\n t.seekg(0, std::ios::beg);\n\n str.assign((std::istreambuf_iterator<char>(t)),\n std::istreambuf_iterator<char>());\n return str;\n#endif\n}\n}\n\nbool Shader::Load(FileSystem* fs, const std::string& file_path) {\n shader_name_ = file_path;\n auto vert = LoadPath(fs, file_path + \".vert\");\n auto frag = LoadPath(fs, file_path + \".frag\");\n auto geom = LoadPath(fs, file_path + \".geom\");\n bool fail = false;\n if( vert.empty() ) {\n std::cerr << \"Failed to load vert shader \" << file_path << \"\\n\";\n fail = true;\n }\n if( frag.empty() ) {\n std::cerr << \"Failed to load frag shader \" << file_path << \"\\n\";\n fail = true;\n }\n if( fail ) {\n return false;\n }\n\n fail = Compile(vert.c_str(), frag.c_str(), geom.empty() ? nullptr : geom.c_str());\n if( fail == false ) {\n std::cerr << \"Failed to compile shader \" << file_path << \"\\n\";\n }\n return fail;\n}\n\nconst std::vector<ShaderAttribute>& Shader::GetAttributes() const {\n Assert(this);\n return bound_attributes_;\n}\n\nconst std::string& Shader::GetName() const {\n Assert(this);\n return shader_name_;\n}\n\nbool Shader::HasBoundAttribute(const ShaderAttribute &attribute) const {\n return std::find(bound_attributes_.begin(), bound_attributes_.end(), attribute)\n != bound_attributes_.end();\n}\n\nbool Shader::HasBoundUniform(const ShaderUniform& uniform) const {\n return std::find(bound_uniforms_.begin(), bound_uniforms_.end(), uniform)\n != bound_uniforms_.end();\n}\n\nvoid BindTextureToShader(Texture2d* texture, Shader* shader, const ShaderUniform& attribute, unsigned int index)\n{\n Assert(index < 16); \/\/ at most 16 texture units\n GLenum gl_id = GL_TEXTURE0 + index;\n glActiveTexture(gl_id);\n Use(texture);\n shader->SetUniform(attribute, index);\n}\n<|endoftext|>"} {"text":"<commit_before>#if (defined _WIN32) || (defined _WIN64)\n #include <sys\/types.h>\n #include <sys\/stat.h>\n #include <windows.h>\n#else \/\/ (defined _WIN32) || (defined _WIN64)\n #include <sys\/mman.h>\n #include <sys\/stat.h>\n #include <sys\/types.h>\n #include <fcntl.h>\n #include <unistd.h>\n#endif \/\/ (defined _WIN32) || (defined _WIN64)\n\n#include \"mapper.h\"\n\nnamespace marisa {\nnamespace grimoire {\nnamespace io {\n\n#if (defined _WIN32) || (defined _WIN64)\nMapper::Mapper()\n : ptr_(NULL), origin_(NULL), avail_(0), size_(0),\n file_(NULL), map_(NULL) {}\n#else \/\/ (defined _WIN32) || (defined _WIN64)\nMapper::Mapper()\n : ptr_(NULL), origin_(MAP_FAILED), avail_(0), size_(0), fd_(-1) {}\n#endif \/\/ (defined _WIN32) || (defined _WIN64)\n\n#if (defined _WIN32) || (defined _WIN64)\nMapper::~Mapper() {\n if (origin_ != NULL) {\n ::UnmapViewOfFile(origin_);\n }\n\n if (map_ != NULL) {\n ::CloseHandle(map_);\n }\n\n if (file_ != NULL) {\n ::CloseHandle(file_);\n }\n}\n#else \/\/ (defined _WIN32) || (defined _WIN64)\nMapper::~Mapper() {\n if (origin_ != MAP_FAILED) {\n ::munmap(origin_, size_);\n }\n\n if (fd_ != -1) {\n ::close(fd_);\n }\n}\n#endif \/\/ (defined _WIN32) || (defined _WIN64)\n\nvoid Mapper::open(const char *filename) {\n MARISA_THROW_IF(filename == NULL, MARISA_NULL_ERROR);\n\n Mapper temp;\n temp.open_(filename);\n swap(temp);\n}\n\nvoid Mapper::open(const void *ptr, std::size_t size) {\n MARISA_THROW_IF((ptr == NULL) && (size != 0), MARISA_NULL_ERROR);\n\n Mapper temp;\n temp.open_(ptr, size);\n swap(temp);\n}\n\nvoid Mapper::seek(std::size_t size) {\n MARISA_THROW_IF(!is_open(), MARISA_STATE_ERROR);\n MARISA_THROW_IF(size > avail_, MARISA_IO_ERROR);\n\n map_data(size);\n}\n\nbool Mapper::is_open() const {\n return ptr_ != NULL;\n}\n\nvoid Mapper::clear() {\n Mapper().swap(*this);\n}\n\nvoid Mapper::swap(Mapper &rhs) {\n marisa::swap(ptr_, rhs.ptr_);\n marisa::swap(avail_, rhs.avail_);\n marisa::swap(origin_, rhs.origin_);\n marisa::swap(size_, rhs.size_);\n#if (defined _WIN32) || (defined _WIN64)\n marisa::swap(file_, rhs.file_);\n marisa::swap(map_, rhs.map_);\n#else \/\/ (defined _WIN32) || (defined _WIN64)\n marisa::swap(fd_, rhs.fd_);\n#endif \/\/ (defined _WIN32) || (defined _WIN64)\n}\n\nconst void *Mapper::map_data(std::size_t size) {\n MARISA_THROW_IF(!is_open(), MARISA_STATE_ERROR);\n MARISA_THROW_IF(size > avail_, MARISA_IO_ERROR);\n\n const char * const data = static_cast<const char *>(ptr_);\n ptr_ = data + size;\n avail_ -= size;\n return data;\n}\n\n#if (defined _WIN32) || (defined _WIN64)\nvoid Mapper::open_(const char *filename) {\n struct __stat64 st;\n MARISA_THROW_IF(::_stat64(filename, &st) != 0, MARISA_IO_ERROR);\n MARISA_THROW_IF((UInt64)st.st_size > MARISA_SIZE_MAX, MARISA_SIZE_ERROR);\n size_ = (std::size_t)st.st_size;\n\n file_ = ::CreateFileA(filename, GENERIC_READ, FILE_SHARE_READ,\n NULL, OPEN_EXISTING, FILE_ATTRIBUTE_NORMAL, NULL);\n MARISA_THROW_IF(file_ == NULL, MARISA_IO_ERROR);\n\n map_ = ::CreateFileMapping(file_, NULL, PAGE_READONLY, 0, 0, NULL);\n MARISA_THROW_IF(map_ == NULL, MARISA_IO_ERROR);\n\n origin_ = ::MapViewOfFile(map_, FILE_MAP_READ, 0, 0, 0);\n MARISA_THROW_IF(origin_ == NULL, MARISA_IO_ERROR);\n\n ptr_ = static_cast<const char *>(origin_);\n avail_ = size_;\n}\n#else \/\/ (defined _WIN32) || (defined _WIN64)\nvoid Mapper::open_(const char *filename) {\n struct stat st;\n MARISA_THROW_IF(::stat(filename, &st) != 0, MARISA_IO_ERROR);\n MARISA_THROW_IF((UInt64)st.st_size > MARISA_SIZE_MAX, MARISA_SIZE_ERROR);\n size_ = (std::size_t)st.st_size;\n\n fd_ = ::open(filename, O_RDONLY);\n MARISA_THROW_IF(fd_ == -1, MARISA_IO_ERROR);\n\n origin_ = ::mmap(NULL, size_, PROT_READ, MAP_SHARED, fd_, 0);\n MARISA_THROW_IF(origin_ == MAP_FAILED, MARISA_IO_ERROR);\n\n ptr_ = static_cast<const char *>(origin_);\n avail_ = size_;\n}\n#endif \/\/ (defined _WIN32) || (defined _WIN64)\n\nvoid Mapper::open_(const void *ptr, std::size_t size) {\n ptr_ = ptr;\n avail_ = size;\n}\n\n} \/\/ namespace io\n} \/\/ namespace grimoire\n} \/\/ namespace marisa\n<commit_msg>(upstream fix) this should resolve issues with mingw<commit_after>#if (defined _WIN32) || (defined _WIN64)\n #include <sys\/types.h>\n #include <sys\/stat.h>\n #include <windows.h>\n#else \/\/ (defined _WIN32) || (defined _WIN64)\n #include <sys\/mman.h>\n #include <sys\/stat.h>\n #include <sys\/types.h>\n #include <fcntl.h>\n #include <unistd.h>\n#endif \/\/ (defined _WIN32) || (defined _WIN64)\n\n#include \"mapper.h\"\n\nnamespace marisa {\nnamespace grimoire {\nnamespace io {\n\n#if (defined _WIN32) || (defined _WIN64)\nMapper::Mapper()\n : ptr_(NULL), origin_(NULL), avail_(0), size_(0),\n file_(NULL), map_(NULL) {}\n#else \/\/ (defined _WIN32) || (defined _WIN64)\nMapper::Mapper()\n : ptr_(NULL), origin_(MAP_FAILED), avail_(0), size_(0), fd_(-1) {}\n#endif \/\/ (defined _WIN32) || (defined _WIN64)\n\n#if (defined _WIN32) || (defined _WIN64)\nMapper::~Mapper() {\n if (origin_ != NULL) {\n ::UnmapViewOfFile(origin_);\n }\n\n if (map_ != NULL) {\n ::CloseHandle(map_);\n }\n\n if (file_ != NULL) {\n ::CloseHandle(file_);\n }\n}\n#else \/\/ (defined _WIN32) || (defined _WIN64)\nMapper::~Mapper() {\n if (origin_ != MAP_FAILED) {\n ::munmap(origin_, size_);\n }\n\n if (fd_ != -1) {\n ::close(fd_);\n }\n}\n#endif \/\/ (defined _WIN32) || (defined _WIN64)\n\nvoid Mapper::open(const char *filename) {\n MARISA_THROW_IF(filename == NULL, MARISA_NULL_ERROR);\n\n Mapper temp;\n temp.open_(filename);\n swap(temp);\n}\n\nvoid Mapper::open(const void *ptr, std::size_t size) {\n MARISA_THROW_IF((ptr == NULL) && (size != 0), MARISA_NULL_ERROR);\n\n Mapper temp;\n temp.open_(ptr, size);\n swap(temp);\n}\n\nvoid Mapper::seek(std::size_t size) {\n MARISA_THROW_IF(!is_open(), MARISA_STATE_ERROR);\n MARISA_THROW_IF(size > avail_, MARISA_IO_ERROR);\n\n map_data(size);\n}\n\nbool Mapper::is_open() const {\n return ptr_ != NULL;\n}\n\nvoid Mapper::clear() {\n Mapper().swap(*this);\n}\n\nvoid Mapper::swap(Mapper &rhs) {\n marisa::swap(ptr_, rhs.ptr_);\n marisa::swap(avail_, rhs.avail_);\n marisa::swap(origin_, rhs.origin_);\n marisa::swap(size_, rhs.size_);\n#if (defined _WIN32) || (defined _WIN64)\n marisa::swap(file_, rhs.file_);\n marisa::swap(map_, rhs.map_);\n#else \/\/ (defined _WIN32) || (defined _WIN64)\n marisa::swap(fd_, rhs.fd_);\n#endif \/\/ (defined _WIN32) || (defined _WIN64)\n}\n\nconst void *Mapper::map_data(std::size_t size) {\n MARISA_THROW_IF(!is_open(), MARISA_STATE_ERROR);\n MARISA_THROW_IF(size > avail_, MARISA_IO_ERROR);\n\n const char * const data = static_cast<const char *>(ptr_);\n ptr_ = data + size;\n avail_ -= size;\n return data;\n}\n\n#if (defined _WIN32) || (defined _WIN64)\n #ifdef __MSVCRT_VERSION__\n #if __MSVCRT_VERSION__ >= 0x0601\n #define MARISA_HAS_STAT64\n #endif \/\/ __MSVCRT_VERSION__ >= 0x0601\n #endif \/\/ __MSVCRT_VERSION__\nvoid Mapper::open_(const char *filename) {\n #ifdef MARISA_HAS_STAT64\n struct __stat64 st;\n MARISA_THROW_IF(::_stat64(filename, &st) != 0, MARISA_IO_ERROR);\n #else \/\/ MARISA_HAS_STAT64\n struct _stat st;\n MARISA_THROW_IF(::_stat(filename, &st) != 0, MARISA_IO_ERROR);\n #endif \/\/ MARISA_HAS_STAT64\n MARISA_THROW_IF((UInt64)st.st_size > MARISA_SIZE_MAX, MARISA_SIZE_ERROR);\n size_ = (std::size_t)st.st_size;\n\n file_ = ::CreateFileA(filename, GENERIC_READ, FILE_SHARE_READ,\n NULL, OPEN_EXISTING, FILE_ATTRIBUTE_NORMAL, NULL);\n MARISA_THROW_IF(file_ == NULL, MARISA_IO_ERROR);\n\n map_ = ::CreateFileMapping(file_, NULL, PAGE_READONLY, 0, 0, NULL);\n MARISA_THROW_IF(map_ == NULL, MARISA_IO_ERROR);\n\n origin_ = ::MapViewOfFile(map_, FILE_MAP_READ, 0, 0, 0);\n MARISA_THROW_IF(origin_ == NULL, MARISA_IO_ERROR);\n\n ptr_ = static_cast<const char *>(origin_);\n avail_ = size_;\n}\n#else \/\/ (defined _WIN32) || (defined _WIN64)\nvoid Mapper::open_(const char *filename) {\n struct stat st;\n MARISA_THROW_IF(::stat(filename, &st) != 0, MARISA_IO_ERROR);\n MARISA_THROW_IF((UInt64)st.st_size > MARISA_SIZE_MAX, MARISA_SIZE_ERROR);\n size_ = (std::size_t)st.st_size;\n\n fd_ = ::open(filename, O_RDONLY);\n MARISA_THROW_IF(fd_ == -1, MARISA_IO_ERROR);\n\n origin_ = ::mmap(NULL, size_, PROT_READ, MAP_SHARED, fd_, 0);\n MARISA_THROW_IF(origin_ == MAP_FAILED, MARISA_IO_ERROR);\n\n ptr_ = static_cast<const char *>(origin_);\n avail_ = size_;\n}\n#endif \/\/ (defined _WIN32) || (defined _WIN64)\n\nvoid Mapper::open_(const void *ptr, std::size_t size) {\n ptr_ = ptr;\n avail_ = size;\n}\n\n} \/\/ namespace io\n} \/\/ namespace grimoire\n} \/\/ namespace marisa\n<|endoftext|>"} {"text":"<commit_before>#include \"openmc\/source.h\"\n\n#if defined (__unix__) || (defined (__APPLE__) && defined (__MACH__))\n#define HAS_DYNAMIC_LINKING\n#endif\n\n#include <algorithm> \/\/ for move\n\n#ifdef HAS_DYNAMIC_LINKING\n#include <dlfcn.h> \/\/ for dlopen, dlsym, dlclose, dlerror\n#endif\n\n#include <fmt\/core.h>\n#include \"xtensor\/xadapt.hpp\"\n\n#include \"openmc\/bank.h\"\n#include \"openmc\/cell.h\"\n#include \"openmc\/error.h\"\n#include \"openmc\/file_utils.h\"\n#include \"openmc\/hdf5_interface.h\"\n#include \"openmc\/material.h\"\n#include \"openmc\/message_passing.h\"\n#include \"openmc\/mgxs_interface.h\"\n#include \"openmc\/nuclide.h\"\n#include \"openmc\/capi.h\"\n#include \"openmc\/random_lcg.h\"\n#include \"openmc\/search.h\"\n#include \"openmc\/settings.h\"\n#include \"openmc\/simulation.h\"\n#include \"openmc\/state_point.h\"\n#include \"openmc\/xml_interface.h\"\n\nnamespace openmc {\n\n\/\/==============================================================================\n\/\/ Global variables\n\/\/==============================================================================\n\nnamespace model {\n\ntypedef Particle::Bank (*sample_t)(uint64_t &seed);\nsample_t sample_source;\nvoid* source_library;\n\nstd::vector<SourceDistribution> external_sources;\n\n}\n\n\/\/==============================================================================\n\/\/ SourceDistribution implementation\n\/\/==============================================================================\n\nSourceDistribution::SourceDistribution(UPtrSpace space, UPtrAngle angle, UPtrDist energy)\n : space_{std::move(space)}, angle_{std::move(angle)}, energy_{std::move(energy)} { }\n\nSourceDistribution::SourceDistribution(pugi::xml_node node)\n{\n \/\/ Check for particle type\n if (check_for_node(node, \"particle\")) {\n auto temp_str = get_node_value(node, \"particle\", true, true);\n if (temp_str == \"neutron\") {\n particle_ = Particle::Type::neutron;\n } else if (temp_str == \"photon\") {\n particle_ = Particle::Type::photon;\n settings::photon_transport = true;\n } else {\n fatal_error(std::string(\"Unknown source particle type: \") + temp_str);\n }\n }\n\n \/\/ Check for source strength\n if (check_for_node(node, \"strength\")) {\n strength_ = std::stod(get_node_value(node, \"strength\"));\n }\n\n \/\/ Check for external source file\n if (check_for_node(node, \"file\")) {\n \/\/ Copy path of source file\n settings::path_source = get_node_value(node, \"file\", false, true);\n\n \/\/ Check if source file exists\n if (!file_exists(settings::path_source)) {\n fatal_error(fmt::format(\"Source file '{}' does not exist.\",\n settings::path_source));\n }\n } else if (check_for_node(node, \"library\")) {\n settings::path_source_library = get_node_value(node, \"library\", false, true);\n if (!file_exists(settings::path_source_library)) {\n fatal_error(fmt::format(\"Source library '{}' does not exist.\",\n settings::path_source_library));\n }\n } else {\n\n \/\/ Spatial distribution for external source\n if (check_for_node(node, \"space\")) {\n \/\/ Get pointer to spatial distribution\n pugi::xml_node node_space = node.child(\"space\");\n\n \/\/ Check for type of spatial distribution and read\n std::string type;\n if (check_for_node(node_space, \"type\"))\n type = get_node_value(node_space, \"type\", true, true);\n if (type == \"cartesian\") {\n space_ = UPtrSpace{new CartesianIndependent(node_space)};\n } else if (type == \"cylindrical\") {\n space_ = UPtrSpace{new CylindricalIndependent(node_space)};\n } else if (type == \"spherical\") {\n space_ = UPtrSpace{new SphericalIndependent(node_space)};\n } else if (type == \"box\") {\n space_ = UPtrSpace{new SpatialBox(node_space)};\n } else if (type == \"fission\") {\n space_ = UPtrSpace{new SpatialBox(node_space, true)};\n } else if (type == \"point\") {\n space_ = UPtrSpace{new SpatialPoint(node_space)};\n } else {\n fatal_error(fmt::format(\n \"Invalid spatial distribution for external source: {}\", type));\n }\n\n } else {\n \/\/ If no spatial distribution specified, make it a point source\n space_ = UPtrSpace{new SpatialPoint()};\n }\n\n \/\/ Determine external source angular distribution\n if (check_for_node(node, \"angle\")) {\n \/\/ Get pointer to angular distribution\n pugi::xml_node node_angle = node.child(\"angle\");\n\n \/\/ Check for type of angular distribution\n std::string type;\n if (check_for_node(node_angle, \"type\"))\n type = get_node_value(node_angle, \"type\", true, true);\n if (type == \"isotropic\") {\n angle_ = UPtrAngle{new Isotropic()};\n } else if (type == \"monodirectional\") {\n angle_ = UPtrAngle{new Monodirectional(node_angle)};\n } else if (type == \"mu-phi\") {\n angle_ = UPtrAngle{new PolarAzimuthal(node_angle)};\n } else {\n fatal_error(fmt::format(\n \"Invalid angular distribution for external source: {}\", type));\n }\n\n } else {\n angle_ = UPtrAngle{new Isotropic()};\n }\n\n \/\/ Determine external source energy distribution\n if (check_for_node(node, \"energy\")) {\n pugi::xml_node node_dist = node.child(\"energy\");\n energy_ = distribution_from_xml(node_dist);\n } else {\n \/\/ Default to a Watt spectrum with parameters 0.988 MeV and 2.249 MeV^-1\n energy_ = UPtrDist{new Watt(0.988e6, 2.249e-6)};\n }\n }\n}\n\n\nParticle::Bank SourceDistribution::sample(uint64_t* seed) const\n{\n Particle::Bank site;\n\n \/\/ Set weight to one by default\n site.wgt = 1.0;\n\n \/\/ Repeat sampling source location until a good site has been found\n bool found = false;\n int n_reject = 0;\n static int n_accept = 0;\n while (!found) {\n \/\/ Set particle type\n site.particle = particle_;\n\n \/\/ Sample spatial distribution\n site.r = space_->sample(seed);\n double xyz[] {site.r.x, site.r.y, site.r.z};\n\n \/\/ Now search to see if location exists in geometry\n int32_t cell_index, instance;\n int err = openmc_find_cell(xyz, &cell_index, &instance);\n found = (err != OPENMC_E_GEOMETRY);\n\n \/\/ Check if spatial site is in fissionable material\n if (found) {\n auto space_box = dynamic_cast<SpatialBox*>(space_.get());\n if (space_box) {\n if (space_box->only_fissionable()) {\n \/\/ Determine material\n const auto& c = model::cells[cell_index];\n auto mat_index = c->material_.size() == 1\n ? c->material_[0] : c->material_[instance];\n\n if (mat_index == MATERIAL_VOID) {\n found = false;\n } else {\n if (!model::materials[mat_index]->fissionable_) found = false;\n }\n }\n }\n }\n\n \/\/ Check for rejection\n if (!found) {\n ++n_reject;\n if (n_reject >= EXTSRC_REJECT_THRESHOLD &&\n static_cast<double>(n_accept)\/n_reject <= EXTSRC_REJECT_FRACTION) {\n fatal_error(\"More than 95% of external source sites sampled were \"\n \"rejected. Please check your external source definition.\");\n }\n }\n }\n\n \/\/ Increment number of accepted samples\n ++n_accept;\n\n \/\/ Sample angle\n site.u = angle_->sample(seed);\n\n \/\/ Check for monoenergetic source above maximum particle energy\n auto p = static_cast<int>(particle_);\n auto energy_ptr = dynamic_cast<Discrete*>(energy_.get());\n if (energy_ptr) {\n auto energies = xt::adapt(energy_ptr->x());\n if (xt::any(energies > data::energy_max[p])) {\n fatal_error(\"Source energy above range of energies of at least \"\n \"one cross section table\");\n } else if (xt::any(energies < data::energy_min[p])) {\n fatal_error(\"Source energy below range of energies of at least \"\n \"one cross section table\");\n }\n }\n\n while (true) {\n \/\/ Sample energy spectrum\n site.E = energy_->sample(seed);\n\n \/\/ Resample if energy falls outside minimum or maximum particle energy\n if (site.E < data::energy_max[p] && site.E > data::energy_min[p]) break;\n }\n\n \/\/ Set delayed group\n site.delayed_group = 0;\n\n return site;\n}\n\n\/\/==============================================================================\n\/\/ Non-member functions\n\/\/==============================================================================\n\nvoid initialize_source()\n{\n write_message(\"Initializing source particles...\", 5);\n\n if (!settings::path_source.empty()) {\n \/\/ Read the source from a binary file instead of sampling from some\n \/\/ assumed source distribution\n\n write_message(fmt::format(\"Reading source file from {}...\",\n settings::path_source), 6);\n\n \/\/ Open the binary file\n hid_t file_id = file_open(settings::path_source, 'r', true);\n\n \/\/ Read the file type\n std::string filetype;\n read_attribute(file_id, \"filetype\", filetype);\n\n \/\/ Check to make sure this is a source file\n if (filetype != \"source\" && filetype != \"statepoint\") {\n fatal_error(\"Specified starting source file not a source file type.\");\n }\n\n \/\/ Read in the source bank\n read_source_bank(file_id);\n\n \/\/ Close file\n file_close(file_id);\n } else if (!settings::path_source_library.empty()) {\n\n write_message(fmt::format(\"Sampling from library source {}...\",\n settings::path_source), 6);\n\n fill_source_bank_custom_source();\n\n } else {\n \/\/ Generation source sites from specified distribution in user input\n for (int64_t i = 0; i < simulation::work_per_rank; ++i) {\n \/\/ initialize random number seed\n int64_t id = simulation::total_gen*settings::n_particles +\n simulation::work_index[mpi::rank] + i + 1;\n uint64_t seed = init_seed(id, STREAM_SOURCE);\n\n \/\/ sample external source distribution\n simulation::source_bank[i] = sample_external_source(&seed);\n }\n }\n\n \/\/ Write out initial source\n if (settings::write_initial_source) {\n write_message(\"Writing out initial source...\", 5);\n std::string filename = settings::path_output + \"initial_source.h5\";\n hid_t file_id = file_open(filename, 'w', true);\n write_source_bank(file_id);\n file_close(file_id);\n }\n}\n\nParticle::Bank sample_external_source(uint64_t* seed)\n{\n \/\/ Determine total source strength\n double total_strength = 0.0;\n for (auto& s : model::external_sources)\n total_strength += s.strength();\n\n \/\/ Sample from among multiple source distributions\n int i = 0;\n if (model::external_sources.size() > 1) {\n double xi = prn(seed)*total_strength;\n double c = 0.0;\n for (; i < model::external_sources.size(); ++i) {\n c += model::external_sources[i].strength();\n if (xi < c) break;\n }\n }\n\n \/\/ Sample source site from i-th source distribution\n Particle::Bank site {model::external_sources[i].sample(seed)};\n\n \/\/ If running in MG, convert site.E to group\n if (!settings::run_CE) {\n site.E = lower_bound_index(data::mg.rev_energy_bins_.begin(),\n data::mg.rev_energy_bins_.end(), site.E);\n site.E = data::mg.num_energy_groups_ - site.E - 1.;\n }\n\n return site;\n}\n\nvoid free_memory_source()\n{\n model::external_sources.clear();\n}\n\n\/\/Load custom source library\nvoid load_custom_source_library()\n{\n#ifdef HAS_DYNAMIC_LINKING\n\n \/\/ Open the library\n model::source_library = dlopen(settings::path_source_library.c_str(), RTLD_LAZY);\n if (!model::source_library) {\n fatal_error(\"Couldn't open source library \" + settings::path_source_library);\n }\n\n \/\/ reset errors\n dlerror();\n\n \/\/ get the function from the library\n \/\/using sample_t = Particle::Bank (*)(uint64_t* seed);\n model::sample_source = reinterpret_cast<model::sample_t>(dlsym(model::source_library, \"sample_source\"));\n\n \/\/ check for any dlsym errors\n auto dlsym_error = dlerror();\n if (dlsym_error) {\n dlclose(model::source_library);\n fatal_error(fmt::format(\"Couldn't open the sample_source symbol: {}\", dlsym_error));\n }\n\n#else\n fatal_error(\"Custom source libraries have not yet been implemented for \"\n \"non-POSIX systems\");\n#endif\n\n}\n\n\/\/Release custom source library\nvoid close_custom_source_library()\n{\n dlclose(model::source_library);\n}\n\n\/\/Sample source particle from custom library\nParticle::Bank sample_custom_source_library(uint64_t* seed)\n{\n Particle::Bank site = model::sample_source(*seed);\n return site;\n}\n\n\/\/ fill the source bank from the external source\nvoid fill_source_bank_custom_source()\n{\n \/\/ Load the custom library\n load_custom_source_library();\n\n \/\/ Generation source sites from specified distribution in the\n \/\/ library source\n for (int64_t i = 0; i < simulation::work_per_rank; ++i) {\n \/\/ initialize random number seed\n int64_t id = (simulation::total_gen + overall_generation()) *\n settings::n_particles + simulation::work_index[mpi::rank] + i + 1;\n uint64_t seed = init_seed(id, STREAM_SOURCE);\n\n \/\/ sample custom library source\n simulation::source_bank[i] = sample_custom_source_library(&seed);\n }\n\n \/\/ release the library\n close_custom_source_library();\n}\n\n} \/\/ namespace openmc\n<commit_msg>Remove unnecessary variable in src\/source.cpp<commit_after>#include \"openmc\/source.h\"\n\n#if defined (__unix__) || (defined (__APPLE__) && defined (__MACH__))\n#define HAS_DYNAMIC_LINKING\n#endif\n\n#include <algorithm> \/\/ for move\n\n#ifdef HAS_DYNAMIC_LINKING\n#include <dlfcn.h> \/\/ for dlopen, dlsym, dlclose, dlerror\n#endif\n\n#include <fmt\/core.h>\n#include \"xtensor\/xadapt.hpp\"\n\n#include \"openmc\/bank.h\"\n#include \"openmc\/cell.h\"\n#include \"openmc\/error.h\"\n#include \"openmc\/file_utils.h\"\n#include \"openmc\/hdf5_interface.h\"\n#include \"openmc\/material.h\"\n#include \"openmc\/message_passing.h\"\n#include \"openmc\/mgxs_interface.h\"\n#include \"openmc\/nuclide.h\"\n#include \"openmc\/capi.h\"\n#include \"openmc\/random_lcg.h\"\n#include \"openmc\/search.h\"\n#include \"openmc\/settings.h\"\n#include \"openmc\/simulation.h\"\n#include \"openmc\/state_point.h\"\n#include \"openmc\/xml_interface.h\"\n\nnamespace openmc {\n\n\/\/==============================================================================\n\/\/ Global variables\n\/\/==============================================================================\n\nnamespace model {\n\ntypedef Particle::Bank (*sample_t)(uint64_t &seed);\nsample_t sample_source;\nvoid* source_library;\n\nstd::vector<SourceDistribution> external_sources;\n\n}\n\n\/\/==============================================================================\n\/\/ SourceDistribution implementation\n\/\/==============================================================================\n\nSourceDistribution::SourceDistribution(UPtrSpace space, UPtrAngle angle, UPtrDist energy)\n : space_{std::move(space)}, angle_{std::move(angle)}, energy_{std::move(energy)} { }\n\nSourceDistribution::SourceDistribution(pugi::xml_node node)\n{\n \/\/ Check for particle type\n if (check_for_node(node, \"particle\")) {\n auto temp_str = get_node_value(node, \"particle\", true, true);\n if (temp_str == \"neutron\") {\n particle_ = Particle::Type::neutron;\n } else if (temp_str == \"photon\") {\n particle_ = Particle::Type::photon;\n settings::photon_transport = true;\n } else {\n fatal_error(std::string(\"Unknown source particle type: \") + temp_str);\n }\n }\n\n \/\/ Check for source strength\n if (check_for_node(node, \"strength\")) {\n strength_ = std::stod(get_node_value(node, \"strength\"));\n }\n\n \/\/ Check for external source file\n if (check_for_node(node, \"file\")) {\n \/\/ Copy path of source file\n settings::path_source = get_node_value(node, \"file\", false, true);\n\n \/\/ Check if source file exists\n if (!file_exists(settings::path_source)) {\n fatal_error(fmt::format(\"Source file '{}' does not exist.\",\n settings::path_source));\n }\n } else if (check_for_node(node, \"library\")) {\n settings::path_source_library = get_node_value(node, \"library\", false, true);\n if (!file_exists(settings::path_source_library)) {\n fatal_error(fmt::format(\"Source library '{}' does not exist.\",\n settings::path_source_library));\n }\n } else {\n\n \/\/ Spatial distribution for external source\n if (check_for_node(node, \"space\")) {\n \/\/ Get pointer to spatial distribution\n pugi::xml_node node_space = node.child(\"space\");\n\n \/\/ Check for type of spatial distribution and read\n std::string type;\n if (check_for_node(node_space, \"type\"))\n type = get_node_value(node_space, \"type\", true, true);\n if (type == \"cartesian\") {\n space_ = UPtrSpace{new CartesianIndependent(node_space)};\n } else if (type == \"cylindrical\") {\n space_ = UPtrSpace{new CylindricalIndependent(node_space)};\n } else if (type == \"spherical\") {\n space_ = UPtrSpace{new SphericalIndependent(node_space)};\n } else if (type == \"box\") {\n space_ = UPtrSpace{new SpatialBox(node_space)};\n } else if (type == \"fission\") {\n space_ = UPtrSpace{new SpatialBox(node_space, true)};\n } else if (type == \"point\") {\n space_ = UPtrSpace{new SpatialPoint(node_space)};\n } else {\n fatal_error(fmt::format(\n \"Invalid spatial distribution for external source: {}\", type));\n }\n\n } else {\n \/\/ If no spatial distribution specified, make it a point source\n space_ = UPtrSpace{new SpatialPoint()};\n }\n\n \/\/ Determine external source angular distribution\n if (check_for_node(node, \"angle\")) {\n \/\/ Get pointer to angular distribution\n pugi::xml_node node_angle = node.child(\"angle\");\n\n \/\/ Check for type of angular distribution\n std::string type;\n if (check_for_node(node_angle, \"type\"))\n type = get_node_value(node_angle, \"type\", true, true);\n if (type == \"isotropic\") {\n angle_ = UPtrAngle{new Isotropic()};\n } else if (type == \"monodirectional\") {\n angle_ = UPtrAngle{new Monodirectional(node_angle)};\n } else if (type == \"mu-phi\") {\n angle_ = UPtrAngle{new PolarAzimuthal(node_angle)};\n } else {\n fatal_error(fmt::format(\n \"Invalid angular distribution for external source: {}\", type));\n }\n\n } else {\n angle_ = UPtrAngle{new Isotropic()};\n }\n\n \/\/ Determine external source energy distribution\n if (check_for_node(node, \"energy\")) {\n pugi::xml_node node_dist = node.child(\"energy\");\n energy_ = distribution_from_xml(node_dist);\n } else {\n \/\/ Default to a Watt spectrum with parameters 0.988 MeV and 2.249 MeV^-1\n energy_ = UPtrDist{new Watt(0.988e6, 2.249e-6)};\n }\n }\n}\n\n\nParticle::Bank SourceDistribution::sample(uint64_t* seed) const\n{\n Particle::Bank site;\n\n \/\/ Set weight to one by default\n site.wgt = 1.0;\n\n \/\/ Repeat sampling source location until a good site has been found\n bool found = false;\n int n_reject = 0;\n static int n_accept = 0;\n while (!found) {\n \/\/ Set particle type\n site.particle = particle_;\n\n \/\/ Sample spatial distribution\n site.r = space_->sample(seed);\n double xyz[] {site.r.x, site.r.y, site.r.z};\n\n \/\/ Now search to see if location exists in geometry\n int32_t cell_index, instance;\n int err = openmc_find_cell(xyz, &cell_index, &instance);\n found = (err != OPENMC_E_GEOMETRY);\n\n \/\/ Check if spatial site is in fissionable material\n if (found) {\n auto space_box = dynamic_cast<SpatialBox*>(space_.get());\n if (space_box) {\n if (space_box->only_fissionable()) {\n \/\/ Determine material\n const auto& c = model::cells[cell_index];\n auto mat_index = c->material_.size() == 1\n ? c->material_[0] : c->material_[instance];\n\n if (mat_index == MATERIAL_VOID) {\n found = false;\n } else {\n if (!model::materials[mat_index]->fissionable_) found = false;\n }\n }\n }\n }\n\n \/\/ Check for rejection\n if (!found) {\n ++n_reject;\n if (n_reject >= EXTSRC_REJECT_THRESHOLD &&\n static_cast<double>(n_accept)\/n_reject <= EXTSRC_REJECT_FRACTION) {\n fatal_error(\"More than 95% of external source sites sampled were \"\n \"rejected. Please check your external source definition.\");\n }\n }\n }\n\n \/\/ Increment number of accepted samples\n ++n_accept;\n\n \/\/ Sample angle\n site.u = angle_->sample(seed);\n\n \/\/ Check for monoenergetic source above maximum particle energy\n auto p = static_cast<int>(particle_);\n auto energy_ptr = dynamic_cast<Discrete*>(energy_.get());\n if (energy_ptr) {\n auto energies = xt::adapt(energy_ptr->x());\n if (xt::any(energies > data::energy_max[p])) {\n fatal_error(\"Source energy above range of energies of at least \"\n \"one cross section table\");\n } else if (xt::any(energies < data::energy_min[p])) {\n fatal_error(\"Source energy below range of energies of at least \"\n \"one cross section table\");\n }\n }\n\n while (true) {\n \/\/ Sample energy spectrum\n site.E = energy_->sample(seed);\n\n \/\/ Resample if energy falls outside minimum or maximum particle energy\n if (site.E < data::energy_max[p] && site.E > data::energy_min[p]) break;\n }\n\n \/\/ Set delayed group\n site.delayed_group = 0;\n\n return site;\n}\n\n\/\/==============================================================================\n\/\/ Non-member functions\n\/\/==============================================================================\n\nvoid initialize_source()\n{\n write_message(\"Initializing source particles...\", 5);\n\n if (!settings::path_source.empty()) {\n \/\/ Read the source from a binary file instead of sampling from some\n \/\/ assumed source distribution\n\n write_message(fmt::format(\"Reading source file from {}...\",\n settings::path_source), 6);\n\n \/\/ Open the binary file\n hid_t file_id = file_open(settings::path_source, 'r', true);\n\n \/\/ Read the file type\n std::string filetype;\n read_attribute(file_id, \"filetype\", filetype);\n\n \/\/ Check to make sure this is a source file\n if (filetype != \"source\" && filetype != \"statepoint\") {\n fatal_error(\"Specified starting source file not a source file type.\");\n }\n\n \/\/ Read in the source bank\n read_source_bank(file_id);\n\n \/\/ Close file\n file_close(file_id);\n } else if (!settings::path_source_library.empty()) {\n\n write_message(fmt::format(\"Sampling from library source {}...\",\n settings::path_source), 6);\n\n fill_source_bank_custom_source();\n\n } else {\n \/\/ Generation source sites from specified distribution in user input\n for (int64_t i = 0; i < simulation::work_per_rank; ++i) {\n \/\/ initialize random number seed\n int64_t id = simulation::total_gen*settings::n_particles +\n simulation::work_index[mpi::rank] + i + 1;\n uint64_t seed = init_seed(id, STREAM_SOURCE);\n\n \/\/ sample external source distribution\n simulation::source_bank[i] = sample_external_source(&seed);\n }\n }\n\n \/\/ Write out initial source\n if (settings::write_initial_source) {\n write_message(\"Writing out initial source...\", 5);\n std::string filename = settings::path_output + \"initial_source.h5\";\n hid_t file_id = file_open(filename, 'w', true);\n write_source_bank(file_id);\n file_close(file_id);\n }\n}\n\nParticle::Bank sample_external_source(uint64_t* seed)\n{\n \/\/ Determine total source strength\n double total_strength = 0.0;\n for (auto& s : model::external_sources)\n total_strength += s.strength();\n\n \/\/ Sample from among multiple source distributions\n int i = 0;\n if (model::external_sources.size() > 1) {\n double xi = prn(seed)*total_strength;\n double c = 0.0;\n for (; i < model::external_sources.size(); ++i) {\n c += model::external_sources[i].strength();\n if (xi < c) break;\n }\n }\n\n \/\/ Sample source site from i-th source distribution\n Particle::Bank site {model::external_sources[i].sample(seed)};\n\n \/\/ If running in MG, convert site.E to group\n if (!settings::run_CE) {\n site.E = lower_bound_index(data::mg.rev_energy_bins_.begin(),\n data::mg.rev_energy_bins_.end(), site.E);\n site.E = data::mg.num_energy_groups_ - site.E - 1.;\n }\n\n return site;\n}\n\nvoid free_memory_source()\n{\n model::external_sources.clear();\n}\n\n\/\/Load custom source library\nvoid load_custom_source_library()\n{\n#ifdef HAS_DYNAMIC_LINKING\n\n \/\/ Open the library\n model::source_library = dlopen(settings::path_source_library.c_str(), RTLD_LAZY);\n if (!model::source_library) {\n fatal_error(\"Couldn't open source library \" + settings::path_source_library);\n }\n\n \/\/ reset errors\n dlerror();\n\n \/\/ get the function from the library\n \/\/using sample_t = Particle::Bank (*)(uint64_t* seed);\n model::sample_source = reinterpret_cast<model::sample_t>(dlsym(model::source_library, \"sample_source\"));\n\n \/\/ check for any dlsym errors\n auto dlsym_error = dlerror();\n if (dlsym_error) {\n dlclose(model::source_library);\n fatal_error(fmt::format(\"Couldn't open the sample_source symbol: {}\", dlsym_error));\n }\n\n#else\n fatal_error(\"Custom source libraries have not yet been implemented for \"\n \"non-POSIX systems\");\n#endif\n\n}\n\n\/\/Release custom source library\nvoid close_custom_source_library()\n{\n dlclose(model::source_library);\n}\n\n\/\/Sample source particle from custom library\nParticle::Bank sample_custom_source_library(uint64_t* seed)\n{\n return model::sample_source(*seed);\n}\n\n\/\/ fill the source bank from the external source\nvoid fill_source_bank_custom_source()\n{\n \/\/ Load the custom library\n load_custom_source_library();\n\n \/\/ Generation source sites from specified distribution in the\n \/\/ library source\n for (int64_t i = 0; i < simulation::work_per_rank; ++i) {\n \/\/ initialize random number seed\n int64_t id = (simulation::total_gen + overall_generation()) *\n settings::n_particles + simulation::work_index[mpi::rank] + i + 1;\n uint64_t seed = init_seed(id, STREAM_SOURCE);\n\n \/\/ sample custom library source\n simulation::source_bank[i] = sample_custom_source_library(&seed);\n }\n\n \/\/ release the library\n close_custom_source_library();\n}\n\n} \/\/ namespace openmc\n<|endoftext|>"} {"text":"<commit_before>#include \"envoy\/api\/v2\/rds.pb.validate.h\"\n\n#include \"common\/router\/config_impl.h\"\n\n#include \"test\/common\/router\/route_fuzz.pb.h\"\n#include \"test\/fuzz\/fuzz_runner.h\"\n#include \"test\/fuzz\/utility.h\"\n#include \"test\/mocks\/server\/mocks.h\"\n\nnamespace Envoy {\nnamespace Router {\nnamespace {\n\n\/\/ A templated method to replace invalid characters in a protocol buffer that contains\n\/\/ (request\/response)_headers_to_(add\/remove).\ntemplate <class T> T replaceInvalidHeaders(const T& config) {\n T clean_config = config;\n clean_config.mutable_request_headers_to_add()->CopyFrom(\n Fuzz::replaceInvalidHeaders(config.request_headers_to_add()));\n clean_config.mutable_response_headers_to_add()->CopyFrom(\n Fuzz::replaceInvalidHeaders(config.response_headers_to_add()));\n auto request_headers_to_remove = clean_config.mutable_request_headers_to_remove();\n std::for_each(request_headers_to_remove->begin(), request_headers_to_remove->end(),\n [](std::string& n) { n = Fuzz::replaceInvalidCharacters(n); });\n auto response_headers_to_remove = clean_config.mutable_response_headers_to_remove();\n std::for_each(response_headers_to_remove->begin(), response_headers_to_remove->end(),\n [](std::string& n) { n = Fuzz::replaceInvalidCharacters(n); });\n return clean_config;\n}\n\n\/\/ Removes invalid headers from the RouteConfiguration as well as in each of the virtual hosts.\nenvoy::api::v2::RouteConfiguration\ncleanRouteConfig(envoy::api::v2::RouteConfiguration route_config) {\n \/\/ A route config contains a list of HTTP headers that should be added and\/or removed to each\n \/\/ request and\/or response the connection manager routes. This removes invalid characters the\n \/\/ headers.\n envoy::api::v2::RouteConfiguration clean_config =\n replaceInvalidHeaders<envoy::api::v2::RouteConfiguration>(route_config);\n \/\/ Replace invalid characters from\n auto internal_only_headers = clean_config.mutable_internal_only_headers();\n std::for_each(internal_only_headers->begin(), internal_only_headers->end(),\n [](std::string& n) { n = Fuzz::replaceInvalidCharacters(n); });\n auto virtual_hosts = clean_config.mutable_virtual_hosts();\n std::for_each(\n virtual_hosts->begin(), virtual_hosts->end(),\n [](envoy::api::v2::route::VirtualHost& virtual_host) {\n \/\/ Each virtual host in the routing configuration contains a list of headers to add and\/or\n \/\/ remove from each request and response that get routed through it. This replaces invalid\n \/\/ header characters in these fields.\n virtual_host = replaceInvalidHeaders<envoy::api::v2::route::VirtualHost>(virtual_host);\n \/\/ Envoy can determine the cluster to route to by reading the HTTP header named by the\n \/\/ cluster_header from the request header. Because these cluster_headers are destined to be\n \/\/ added to a Header Map, we iterate through each route in and remove invalid characters\n \/\/ from their cluster headers.\n std::for_each(virtual_host.mutable_routes()->begin(), virtual_host.mutable_routes()->end(),\n [](envoy::api::v2::route::Route& route) {\n if (route.has_route()) {\n route.mutable_route()->set_cluster_header(\n Fuzz::replaceInvalidCharacters(route.route().cluster_header()));\n if (route.route().cluster_header().empty()) {\n route.mutable_route()->set_cluster_header(\"not-empty\");\n }\n }\n });\n });\n\n return clean_config;\n}\n\n\/\/ TODO(htuch): figure out how to generate via a genrule from config_impl_test the full corpus.\nDEFINE_PROTO_FUZZER(const test::common::router::RouteTestCase& input) {\n try {\n NiceMock<Envoy::StreamInfo::MockStreamInfo> stream_info;\n NiceMock<Server::Configuration::MockFactoryContext> factory_context;\n TestUtility::validate(input.config());\n ConfigImpl config(cleanRouteConfig(input.config()), factory_context, true);\n Http::TestHeaderMapImpl headers = Fuzz::fromHeaders(input.headers());\n \/\/ It's a precondition of routing that {:authority, :path, x-forwarded-proto} headers exists,\n \/\/ HCM enforces this.\n if (headers.Host() == nullptr) {\n headers.insertHost().value(std::string(\"example.com\"));\n }\n if (headers.Path() == nullptr) {\n headers.insertPath().value(std::string(\"\/\"));\n }\n if (headers.ForwardedProto() == nullptr) {\n headers.insertForwardedProto().value(std::string(\"http\"));\n }\n auto route = config.route(headers, input.random_value());\n if (route != nullptr && route->routeEntry() != nullptr) {\n route->routeEntry()->finalizeRequestHeaders(headers, stream_info, true);\n }\n ENVOY_LOG_MISC(trace, \"Success\");\n } catch (const EnvoyException& e) {\n ENVOY_LOG_MISC(debug, \"EnvoyException: {}\", e.what());\n }\n}\n\n} \/\/ namespace\n} \/\/ namespace Router\n} \/\/ namespace Envoy\n<commit_msg>fuzz: improve fuzz performance for accesslog and route (#8397)<commit_after>#include \"envoy\/api\/v2\/rds.pb.validate.h\"\n\n#include \"common\/router\/config_impl.h\"\n\n#include \"test\/common\/router\/route_fuzz.pb.h\"\n#include \"test\/fuzz\/fuzz_runner.h\"\n#include \"test\/fuzz\/utility.h\"\n#include \"test\/mocks\/server\/mocks.h\"\n\nnamespace Envoy {\nnamespace Router {\nnamespace {\n\n\/\/ A templated method to replace invalid characters in a protocol buffer that contains\n\/\/ (request\/response)_headers_to_(add\/remove).\ntemplate <class T> T replaceInvalidHeaders(const T& config) {\n T clean_config = config;\n clean_config.mutable_request_headers_to_add()->CopyFrom(\n Fuzz::replaceInvalidHeaders(config.request_headers_to_add()));\n clean_config.mutable_response_headers_to_add()->CopyFrom(\n Fuzz::replaceInvalidHeaders(config.response_headers_to_add()));\n auto request_headers_to_remove = clean_config.mutable_request_headers_to_remove();\n std::for_each(request_headers_to_remove->begin(), request_headers_to_remove->end(),\n [](std::string& n) { n = Fuzz::replaceInvalidCharacters(n); });\n auto response_headers_to_remove = clean_config.mutable_response_headers_to_remove();\n std::for_each(response_headers_to_remove->begin(), response_headers_to_remove->end(),\n [](std::string& n) { n = Fuzz::replaceInvalidCharacters(n); });\n return clean_config;\n}\n\n\/\/ Removes invalid headers from the RouteConfiguration as well as in each of the virtual hosts.\nenvoy::api::v2::RouteConfiguration\ncleanRouteConfig(envoy::api::v2::RouteConfiguration route_config) {\n \/\/ A route config contains a list of HTTP headers that should be added and\/or removed to each\n \/\/ request and\/or response the connection manager routes. This removes invalid characters the\n \/\/ headers.\n envoy::api::v2::RouteConfiguration clean_config =\n replaceInvalidHeaders<envoy::api::v2::RouteConfiguration>(route_config);\n auto internal_only_headers = clean_config.mutable_internal_only_headers();\n std::for_each(internal_only_headers->begin(), internal_only_headers->end(),\n [](std::string& n) { n = Fuzz::replaceInvalidCharacters(n); });\n auto virtual_hosts = clean_config.mutable_virtual_hosts();\n std::for_each(\n virtual_hosts->begin(), virtual_hosts->end(),\n [](envoy::api::v2::route::VirtualHost& virtual_host) {\n \/\/ Each virtual host in the routing configuration contains a list of headers to add and\/or\n \/\/ remove from each request and response that get routed through it. This replaces invalid\n \/\/ header characters in these fields.\n virtual_host = replaceInvalidHeaders<envoy::api::v2::route::VirtualHost>(virtual_host);\n \/\/ Envoy can determine the cluster to route to by reading the HTTP header named by the\n \/\/ cluster_header from the request header. Because these cluster_headers are destined to be\n \/\/ added to a Header Map, we iterate through each route in and remove invalid characters\n \/\/ from their cluster headers.\n std::for_each(virtual_host.mutable_routes()->begin(), virtual_host.mutable_routes()->end(),\n [](envoy::api::v2::route::Route& route) {\n if (route.has_route()) {\n route.mutable_route()->set_cluster_header(\n Fuzz::replaceInvalidCharacters(route.route().cluster_header()));\n if (route.route().cluster_header().empty()) {\n route.mutable_route()->set_cluster_header(\"not-empty\");\n }\n }\n });\n });\n\n return clean_config;\n}\n\n\/\/ TODO(htuch): figure out how to generate via a genrule from config_impl_test the full corpus.\nDEFINE_PROTO_FUZZER(const test::common::router::RouteTestCase& input) {\n static NiceMock<Envoy::StreamInfo::MockStreamInfo> stream_info;\n static NiceMock<Server::Configuration::MockFactoryContext> factory_context;\n try {\n TestUtility::validate(input.config());\n ConfigImpl config(cleanRouteConfig(input.config()), factory_context, true);\n Http::TestHeaderMapImpl headers = Fuzz::fromHeaders(input.headers());\n \/\/ It's a precondition of routing that {:authority, :path, x-forwarded-proto} headers exists,\n \/\/ HCM enforces this.\n if (headers.Host() == nullptr) {\n headers.insertHost().value(std::string(\"example.com\"));\n }\n if (headers.Path() == nullptr) {\n headers.insertPath().value(std::string(\"\/\"));\n }\n if (headers.ForwardedProto() == nullptr) {\n headers.insertForwardedProto().value(std::string(\"http\"));\n }\n auto route = config.route(headers, input.random_value());\n if (route != nullptr && route->routeEntry() != nullptr) {\n route->routeEntry()->finalizeRequestHeaders(headers, stream_info, true);\n }\n ENVOY_LOG_MISC(trace, \"Success\");\n } catch (const EnvoyException& e) {\n ENVOY_LOG_MISC(debug, \"EnvoyException: {}\", e.what());\n }\n}\n\n} \/\/ namespace\n} \/\/ namespace Router\n} \/\/ namespace Envoy\n<|endoftext|>"} {"text":"<commit_before>#include <chrono>\n#include <vector>\n#include \"caffe2\/core\/operator.h\"\n#include \"caffe2\/core\/stats.h\"\n#include \"caffe2\/core\/tensor.h\"\n\nnamespace caffe2 {\nnamespace {\n\nclass StatRegistryCreateOp : public Operator<CPUContext> {\n public:\n StatRegistryCreateOp(const OperatorDef& operator_def, Workspace* ws)\n : Operator(operator_def, ws) {}\n\n bool RunOnDevice() override {\n *OperatorBase::Output<std::unique_ptr<StatRegistry>>(0) =\n std::unique_ptr<StatRegistry>(new StatRegistry);\n return true;\n }\n};\n\nclass StatRegistryExportOp : public Operator<CPUContext> {\n public:\n StatRegistryExportOp(const OperatorDef& operator_def, Workspace* ws)\n : Operator(operator_def, ws),\n reset_(GetSingleArgument<bool>(\"reset\", true)) {}\n\n bool RunOnDevice() override {\n auto registry = InputSize() > 0\n ? OperatorBase::Input<std::unique_ptr<StatRegistry>>(0).get()\n : &StatRegistry::get();\n auto* keys = Output(0);\n auto* values = Output(1);\n auto* timestamps = Output(2);\n auto data = registry->publish(reset_);\n keys->Resize(data.size());\n values->Resize(data.size());\n timestamps->Resize(data.size());\n auto* pkeys = keys->mutable_data<std::string>();\n auto* pvals = values->mutable_data<int64_t>();\n auto* ptimestamps = timestamps->mutable_data<int64_t>();\n int i = 0;\n for (const auto& stat : data) {\n pkeys[i] = std::move(stat.key);\n pvals[i] = stat.value;\n ptimestamps[i] =\n std::chrono::nanoseconds(stat.ts.time_since_epoch()).count();\n ++i;\n }\n return true;\n }\n\n private:\n bool reset_;\n};\n\nclass StatRegistryUpdateOp : public Operator<CPUContext> {\n public:\n StatRegistryUpdateOp(const OperatorDef& operator_def, Workspace* ws)\n : Operator(operator_def, ws) {}\n\n bool RunOnDevice() override {\n const auto& keys = Input(0);\n const auto& values = Input(1);\n auto registry = InputSize() == 3\n ? OperatorBase::Input<std::unique_ptr<StatRegistry>>(2).get()\n : &StatRegistry::get();\n CAFFE_ENFORCE_EQ(keys.size(), values.size());\n ExportedStatList data(keys.size());\n auto* pkeys = keys.data<std::string>();\n auto* pvals = values.data<int64_t>();\n int i = 0;\n for (auto& stat : data) {\n stat.key = pkeys[i];\n stat.value = pvals[i];\n ++i;\n }\n registry->update(data);\n return true;\n }\n};\n\nclass TimerInstance {\n public:\n explicit TimerInstance(const std::string& name)\n : running_(false), stat_(name) {}\n\n void begin() {\n CAFFE_ENFORCE(!running_, \"Called TimerBegin on an already running timer.\");\n running_ = true;\n start_ = std::chrono::high_resolution_clock::now();\n }\n\n void end() {\n CAFFE_ENFORCE(running_, \"Called TimerEnd on a stopped timer.\");\n using namespace std::chrono;\n auto duration = high_resolution_clock::now() - start_;\n auto nanos = duration_cast<nanoseconds>(duration).count();\n CAFFE_EVENT(stat_, time_ns, nanos);\n running_ = false;\n }\n\n private:\n bool running_;\n std::chrono::high_resolution_clock::time_point start_;\n\n struct TimerStat {\n CAFFE_STAT_CTOR(TimerStat);\n CAFFE_AVG_EXPORTED_STAT(time_ns);\n } stat_;\n};\n\nstruct TimerBeginOp : public Operator<CPUContext> {\n TimerBeginOp(const OperatorDef& operator_def, Workspace* ws)\n : Operator(operator_def, ws), timer_([this]() {\n auto givenName = GetSingleArgument<std::string>(\"counter_name\", \"\");\n return givenName.empty() ? def().output().Get(0) : givenName;\n }()) {}\n\n bool RunOnDevice() override {\n *OperatorBase::Output<TimerInstance*>(0) = &timer_;\n timer_.begin();\n return true;\n }\n\n private:\n TimerInstance timer_;\n};\n\nstruct TimerEndOp : public Operator<CPUContext> {\n TimerEndOp(const OperatorDef& operator_def, Workspace* ws)\n : Operator(operator_def, ws) {}\n\n bool RunOnDevice() override {\n OperatorBase::Input<TimerInstance*>(0)->end();\n return true;\n }\n};\n\nREGISTER_CPU_OPERATOR(StatRegistryCreate, StatRegistryCreateOp);\nREGISTER_CPU_OPERATOR(StatRegistryUpdate, StatRegistryUpdateOp);\nREGISTER_CPU_OPERATOR(StatRegistryExport, StatRegistryExportOp);\n\nREGISTER_CPU_OPERATOR(TimerBegin, TimerBeginOp);\nREGISTER_CPU_OPERATOR(TimerEnd, TimerEndOp);\n\nOPERATOR_SCHEMA(StatRegistryCreate)\n .NumInputs(0)\n .NumOutputs(1)\n .SetDoc(R\"DOC(\nCreate a StatRegistry object that will contain a map of performance counters\nkeyed by name. A StatRegistry is used to gather and retrieve performance\ncounts throuhgout the caffe2 codebase.\n)DOC\")\n .Output(0, \"handle\", \"A Blob pointing to the newly created StatRegistry.\");\n\nOPERATOR_SCHEMA(StatRegistryUpdate)\n .NumInputs(2, 3)\n .NumOutputs(0)\n .SetDoc(R\"DOC(\nUpdate the given StatRegistry, or the global StatRegistry,\nwith the values of counters for the given keys.\n)DOC\")\n .Input(0, \"keys\", \"1D string tensor with the key names to update.\")\n .Input(1, \"values\", \"1D int64 tensor with the values to update.\")\n .Input(\n 2,\n \"handle\",\n \"If provided, update the given StatRegistry. \"\n \"Otherwise, update the global singleton.\");\n\nOPERATOR_SCHEMA(StatRegistryExport)\n .NumInputs(0, 1)\n .NumOutputs(3)\n .Input(\n 0,\n \"handle\",\n \"If provided, export values from given StatRegistry.\"\n \"Otherwise, export values from the global singleton StatRegistry.\")\n .Output(0, \"keys\", \"1D string tensor with exported key names\")\n .Output(1, \"values\", \"1D int64 tensor with exported values\")\n .Output(2, \"timestamps\", \"The unix timestamp at counter retrieval.\")\n .Arg(\n \"reset\",\n \"(default true) Whether to atomically reset the counters afterwards.\");\n}\n\nOPERATOR_SCHEMA(TimerBegin)\n .NumInputs(0)\n .NumOutputs(1)\n .SetDoc(R\"DOC(\nStart a wallclock timer, returning a pointer to it.\nThe timer is stopped by calling TimerEnd)DOC\")\n .Arg(\"counter_name\", \"Name of the timer. If not provided, use output name.\")\n .Output(0, \"timer\", \"Pointer to timer, to be passed to TimerEnd.\");\n\nOPERATOR_SCHEMA(TimerEnd)\n .NumInputs(1)\n .NumOutputs(0)\n .SetDoc(\"Stop a timer started with TimerBegin, publishing a CAFFE_EVENT\")\n .Input(0, \"timer\", \"Pointer to timer, obtained from TimerBegin.\");\n\nCAFFE_KNOWN_TYPE(TimerInstance*);\nCAFFE_KNOWN_TYPE(std::unique_ptr<caffe2::StatRegistry>);\n} \/\/ namespace caffe2\n<commit_msg>add automatic timing of parameter update phase<commit_after>#include <chrono>\n#include <vector>\n#include \"caffe2\/core\/operator.h\"\n#include \"caffe2\/core\/stats.h\"\n#include \"caffe2\/core\/tensor.h\"\n\nnamespace caffe2 {\nnamespace {\n\nclass StatRegistryCreateOp : public Operator<CPUContext> {\n public:\n StatRegistryCreateOp(const OperatorDef& operator_def, Workspace* ws)\n : Operator(operator_def, ws) {}\n\n bool RunOnDevice() override {\n *OperatorBase::Output<std::unique_ptr<StatRegistry>>(0) =\n std::unique_ptr<StatRegistry>(new StatRegistry);\n return true;\n }\n};\n\nclass StatRegistryExportOp : public Operator<CPUContext> {\n public:\n StatRegistryExportOp(const OperatorDef& operator_def, Workspace* ws)\n : Operator(operator_def, ws),\n reset_(GetSingleArgument<bool>(\"reset\", true)) {}\n\n bool RunOnDevice() override {\n auto registry = InputSize() > 0\n ? OperatorBase::Input<std::unique_ptr<StatRegistry>>(0).get()\n : &StatRegistry::get();\n auto* keys = Output(0);\n auto* values = Output(1);\n auto* timestamps = Output(2);\n auto data = registry->publish(reset_);\n keys->Resize(data.size());\n values->Resize(data.size());\n timestamps->Resize(data.size());\n auto* pkeys = keys->mutable_data<std::string>();\n auto* pvals = values->mutable_data<int64_t>();\n auto* ptimestamps = timestamps->mutable_data<int64_t>();\n int i = 0;\n for (const auto& stat : data) {\n pkeys[i] = std::move(stat.key);\n pvals[i] = stat.value;\n ptimestamps[i] =\n std::chrono::nanoseconds(stat.ts.time_since_epoch()).count();\n ++i;\n }\n return true;\n }\n\n private:\n bool reset_;\n};\n\nclass StatRegistryUpdateOp : public Operator<CPUContext> {\n public:\n StatRegistryUpdateOp(const OperatorDef& operator_def, Workspace* ws)\n : Operator(operator_def, ws) {}\n\n bool RunOnDevice() override {\n const auto& keys = Input(0);\n const auto& values = Input(1);\n auto registry = InputSize() == 3\n ? OperatorBase::Input<std::unique_ptr<StatRegistry>>(2).get()\n : &StatRegistry::get();\n CAFFE_ENFORCE_EQ(keys.size(), values.size());\n ExportedStatList data(keys.size());\n auto* pkeys = keys.data<std::string>();\n auto* pvals = values.data<int64_t>();\n int i = 0;\n for (auto& stat : data) {\n stat.key = pkeys[i];\n stat.value = pvals[i];\n ++i;\n }\n registry->update(data);\n return true;\n }\n};\n\nclass TimerInstance {\n public:\n explicit TimerInstance(const std::string& name)\n : running_(false), stat_(name) {}\n\n void begin() {\n CAFFE_ENFORCE(!running_, \"Called TimerBegin on an already running timer.\");\n running_ = true;\n start_ = std::chrono::high_resolution_clock::now();\n }\n\n void end() {\n CAFFE_ENFORCE(running_, \"Called TimerEnd on a stopped timer.\");\n using namespace std::chrono;\n auto duration = high_resolution_clock::now() - start_;\n auto nanos = duration_cast<nanoseconds>(duration).count();\n CAFFE_EVENT(stat_, time_ns, nanos);\n running_ = false;\n }\n\n int64_t get_ns() {\n CAFFE_ENFORCE(running_, \"Called TimerGet on a stopped timer.\");\n using namespace std::chrono;\n auto duration = high_resolution_clock::now() - start_;\n auto nanos = duration_cast<nanoseconds>(duration).count();\n return nanos;\n }\n\n private:\n bool running_;\n std::chrono::high_resolution_clock::time_point start_;\n\n struct TimerStat {\n CAFFE_STAT_CTOR(TimerStat);\n CAFFE_AVG_EXPORTED_STAT(time_ns);\n } stat_;\n};\n\nstruct TimerBeginOp : public Operator<CPUContext> {\n TimerBeginOp(const OperatorDef& operator_def, Workspace* ws)\n : Operator(operator_def, ws), timer_([this]() {\n auto givenName = GetSingleArgument<std::string>(\"counter_name\", \"\");\n return givenName.empty() ? def().output().Get(0) : givenName;\n }()) {}\n\n bool RunOnDevice() override {\n *OperatorBase::Output<TimerInstance*>(0) = &timer_;\n timer_.begin();\n return true;\n }\n\n private:\n TimerInstance timer_;\n};\n\nstruct TimerEndOp : public Operator<CPUContext> {\n TimerEndOp(const OperatorDef& operator_def, Workspace* ws)\n : Operator(operator_def, ws) {}\n\n bool RunOnDevice() override {\n OperatorBase::Input<TimerInstance*>(0)->end();\n return true;\n }\n};\n\nstruct TimerGetAndEndOp : public Operator<CPUContext> {\n TimerGetAndEndOp(const OperatorDef& operator_def, Workspace* ws)\n : Operator(operator_def, ws) {}\n\n bool RunOnDevice() override {\n int64_t nanos = OperatorBase::Input<TimerInstance*>(0)->get_ns();\n OperatorBase::Input<TimerInstance*>(0)->end();\n auto* res = OperatorBase::Output<TensorCPU>(0);\n res->Resize(1);\n res->template mutable_data<int64_t>()[0] = nanos;\n return true;\n }\n};\n\nREGISTER_CPU_OPERATOR(StatRegistryCreate, StatRegistryCreateOp);\nREGISTER_CPU_OPERATOR(StatRegistryUpdate, StatRegistryUpdateOp);\nREGISTER_CPU_OPERATOR(StatRegistryExport, StatRegistryExportOp);\n\nREGISTER_CPU_OPERATOR(TimerBegin, TimerBeginOp);\nREGISTER_CPU_OPERATOR(TimerEnd, TimerEndOp);\nREGISTER_CPU_OPERATOR(TimerGetAndEnd, TimerGetAndEndOp);\n\nOPERATOR_SCHEMA(StatRegistryCreate)\n .NumInputs(0)\n .NumOutputs(1)\n .SetDoc(R\"DOC(\nCreate a StatRegistry object that will contain a map of performance counters\nkeyed by name. A StatRegistry is used to gather and retrieve performance\ncounts throuhgout the caffe2 codebase.\n)DOC\")\n .Output(0, \"handle\", \"A Blob pointing to the newly created StatRegistry.\");\n\nOPERATOR_SCHEMA(StatRegistryUpdate)\n .NumInputs(2, 3)\n .NumOutputs(0)\n .SetDoc(R\"DOC(\nUpdate the given StatRegistry, or the global StatRegistry,\nwith the values of counters for the given keys.\n)DOC\")\n .Input(0, \"keys\", \"1D string tensor with the key names to update.\")\n .Input(1, \"values\", \"1D int64 tensor with the values to update.\")\n .Input(\n 2,\n \"handle\",\n \"If provided, update the given StatRegistry. \"\n \"Otherwise, update the global singleton.\");\n\nOPERATOR_SCHEMA(StatRegistryExport)\n .NumInputs(0, 1)\n .NumOutputs(3)\n .Input(\n 0,\n \"handle\",\n \"If provided, export values from given StatRegistry.\"\n \"Otherwise, export values from the global singleton StatRegistry.\")\n .Output(0, \"keys\", \"1D string tensor with exported key names\")\n .Output(1, \"values\", \"1D int64 tensor with exported values\")\n .Output(2, \"timestamps\", \"The unix timestamp at counter retrieval.\")\n .Arg(\n \"reset\",\n \"(default true) Whether to atomically reset the counters afterwards.\");\n}\n\nOPERATOR_SCHEMA(TimerBegin)\n .NumInputs(0)\n .NumOutputs(1)\n .SetDoc(R\"DOC(\nStart a wallclock timer, returning a pointer to it.\nThe timer is stopped by calling TimerEnd)DOC\")\n .Arg(\"counter_name\", \"Name of the timer. If not provided, use output name.\")\n .Output(0, \"timer\", \"Pointer to timer, to be passed to TimerEnd.\");\n\nOPERATOR_SCHEMA(TimerEnd)\n .NumInputs(1)\n .NumOutputs(0)\n .SetDoc(\"Stop a timer started with TimerBegin, publishing a CAFFE_EVENT\")\n .Input(0, \"timer\", \"Pointer to timer, obtained from TimerBegin.\");\n\nOPERATOR_SCHEMA(TimerGetAndEnd)\n .NumInputs(1)\n .NumOutputs(1)\n .SetDoc(R\"DOC(Queries the current time of a timer in nanos, stops the timer\n publishing a CAFFE_EVENT)DOC\")\n .Input(0, \"timer\", \"Pointer to timer, obtained from TimerBegin.\")\n .Output(0, \"nanos\", \"nanoseconds in int64\");\n\nCAFFE_KNOWN_TYPE(TimerInstance*);\nCAFFE_KNOWN_TYPE(std::unique_ptr<caffe2::StatRegistry>);\n} \/\/ namespace caffe2\n<|endoftext|>"} {"text":"<commit_before>\/\/ Copyright 2017 Netherlands Institute for Radio Astronomy (ASTRON)\n\/\/ Copyright 2017 Netherlands eScience Center\n\/\/\n\/\/ Licensed under the Apache License, Version 2.0 (the \"License\");\n\/\/ you may not use this file except in compliance with the License.\n\/\/ You may obtain a copy of the License at\n\/\/\n\/\/ http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n\/\/\n\/\/ Unless required by applicable law or agreed to in writing, software\n\/\/ distributed under the License is distributed on an \"AS IS\" BASIS,\n\/\/ WITHOUT WARRANTIES OR CONDITIONS OF 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\nstruct Options\n{\n \/\/ Debug mode\n bool debug = false;\n \/\/ Print messages to standard output\n bool print = false;\n \/\/ Use subband dedispersion\n bool subbandDedispersion = false;\n \/\/ Avoid merging batches of dispersed data into contiguous memory\n bool splitBatchesDedispersion = false;\n \/\/ Compact the triggered events in time and DM dimensions\n bool compactResults = false;\n \/\/ Threshold for triggering\n float threshold = 0.0f;\n \/\/ SNR mode\n SNRMode snrMode;\n \/\/ Step size for median of medians (MOMAD mode)\n unsigned int medianStepSize = 5;\n};\n\nstruct DeviceOptions\n{\n \/\/ OpenCL synchronized operations\n bool synchronized = false;\n \/\/ OpenCL platform ID\n unsigned int platformID = 0;\n \/\/ OpenCL device ID\n unsigned int deviceID = 0;\n \/\/ OpenCL device name\n std::string deviceName{};\n \/\/ Padding of OpenCL devices\n AstroData::paddingConf padding{};\n};\n\nstruct DataOptions\n{\n \/\/ Use LOFAR file as input\n bool dataLOFAR = false;\n \/\/ Use SIGPROC file as input\n bool dataSIGPROC = false;\n \/\/ Use PSRDADA buffer as input\n bool dataPSRDADA = false;\n \/\/ SIGPROC streaming mode\n bool streamingMode = false;\n \/\/ Size (in bytes) of the SIGPROC file header\n unsigned int headerSizeSIGPROC = 0;\n \/\/ Name of the input file\n std::string dataFile{};\n \/\/ Basename for the output files\n std::string outputFile{};\n \/\/ Name of the file containing the zapped channels\n std::string channelsFile{};\n \/\/ Name of the file containing the integration steps\n std::string integrationFile{};\n#ifdef HAVE_HDF5\n \/\/ Limit the number of batches processed from a LOFAR file\n bool limit = false;\n \/\/ Name of the LOFAR header file\n std::string headerFile{};\n#endif \/\/ HAVE_HDF5\n#ifdef HAVE_PSRDADA\n \/\/ PSRDADA buffer key\n key_t dadaKey = 0;\n#endif \/\/ HAVE_PSRDADA\n};\n\nstruct GeneratorOptions\n{\n \/\/ Use random numbers in generated data\n bool random = false;\n \/\/ Width of random generated pulse\n unsigned int width = 0;\n \/\/ DM of random generated pulse\n float DM = 0.0f;\n};\n\nstruct HostMemory\n{\n \/\/ Input data when reading a whole input file\n std::vector<std::vector<std::vector<inputDataType> *> *> input;\n \/\/ Input data when in streaming mode\n std::vector<std::vector<inputDataType> *> inputStream;\n \/\/ Zapped channels\n std::vector<unsigned int> zappedChannels;\n \/\/ Integration steps\n std::set<unsigned int> integrationSteps;\n \/\/ Map to create synthesized beams\n std::vector<unsigned int> beamMapping;\n \/\/ Dispersed data\n std::vector<inputDataType> dispersedData;\n \/\/ Subbanded data\n std::vector<outputDataType> subbandedData;\n \/\/ Dedispersed data\n std::vector<outputDataType> dedispersedData;\n \/\/ Integrated data\n std::vector<outputDataType> integratedData;\n \/\/ SNR data (SNR mode)\n std::vector<float> snrData;\n \/\/ Index of the sample with highest SNR value (SNR mode)\n std::vector<unsigned int> snrSamples;\n \/\/ Value of max sample (MOMAD mode)\n std::vector<outputDataType> maxValues;\n \/\/ Index of max sample (MOMAD MODE)\n std::vector<unsigned int> maxIndices;\n \/\/ Medians of medians (MOMAD mode)\n std::vector<outputDataType> mediansOfMedians;\n \/\/ Medians of medians absolute deviation (MOMAD mode)\n std::vector<outputDataType> medianOfMediansAbsoluteDeviation;\n \/\/ Shifts single step dedispersion\n std::vector<float> *shiftsSingleStep = nullptr;\n \/\/ Shifts step one subbanding dedispersion\n std::vector<float> *shiftsStepOne = nullptr;\n \/\/ Shifts step two subbanding dedispersion\n std::vector<float> *shiftsStepTwo = nullptr;\n#ifdef HAVE_PSRDADA\n \/\/ PSRDADA ring buffer\n dada_hdu_t *ringBuffer = nullptr;\n#endif \/\/ HAVE_PSRDADA\n};\n\nstruct DeviceMemory\n{\n \/\/ Shifts single step dedispersion\n cl::Buffer shiftsSingleStep;\n \/\/ Shifts step one subbanding dedispersion\n cl::Buffer shiftsStepOne;\n \/\/ Shifts step two subbanding dedispersion\n cl::Buffer shiftsStepTwo;\n \/\/ Zapped channels\n cl::Buffer zappedChannels;\n \/\/ Map to create synthesized beams\n cl::Buffer beamMapping;\n \/\/ Dispersed dada\n cl::Buffer dispersedData;\n \/\/ Subbanded data\n cl::Buffer subbandedData;\n \/\/ Dedispersed data\n cl::Buffer dedispersedData;\n \/\/ Integrated data\n cl::Buffer integratedData;\n \/\/ SNR data (SNR mode)\n cl::Buffer snrData;\n \/\/ Index of the sample with highest SNR value (SNR mode)\n cl::Buffer snrSamples;\n \/\/ Value of max sample (MOMAD mode)\n cl::Buffer maxValues;\n \/\/ Index of max sample (MOMAD mode)\n cl::Buffer maxIndices;\n \/\/ Median of medians first step (MOMAD mode)\n cl::Buffer medianOfMediansStepOne;\n \/\/ Median of medians second step (MOMAD mode)\n cl::Buffer medianOfMediansStepTwo;\n};\n\nstruct KernelConfigurations\n{\n \/\/ Configuration of single step dedispersion kernel\n Dedispersion::tunedDedispersionConf dedispersionSingleStepParameters;\n \/\/ Configuration of subband dedispersion kernel, step one\n Dedispersion::tunedDedispersionConf dedispersionStepOneParameters;\n \/\/ Configuration of subband dedispersion kernel, step two\n Dedispersion::tunedDedispersionConf dedispersionStepTwoParameters;\n \/\/ Configuration of integration kernel\n Integration::tunedIntegrationConf integrationParameters;\n \/\/ Configuration of SNR kernel (SNR mode)\n SNR::tunedSNRConf snrParameters;\n \/\/ Configuration of max kernel (MOMAD mode)\n SNR::tunedSNRConf maxParameters;\n \/\/ Configuration of median of medians first step (MOMAD mode)\n SNR::tunedSNRConf medianOfMediansStepOneParameters;\n \/\/ Configuration of median of medians second step (MOMAD mode)\n SNR::tunedSNRConf medianOfMediansStepTwoParameters;\n \/\/ Configuration of median of medians absolute deviation (MOMAD mode)\n SNR::tunedSNRConf medianOfMediansAbsoluteDeviationParameters;\n};\n\nstruct Kernels\n{\n \/\/ Single step dedispersion kernel\n cl::Kernel *dedispersionSingleStep = nullptr;\n \/\/ Step one subbanding dedispersion kernel\n cl::Kernel *dedispersionStepOne = nullptr;\n \/\/ Step two subbanding dedispersion kernel\n cl::Kernel *dedispersionStepTwo = nullptr;\n \/\/ Integration kernels, one for each integration step\n std::vector<cl::Kernel *> integration;\n \/\/ SNR kernels, one for the original data and one for each integration step (SNR mode)\n std::vector<cl::Kernel *> snr;\n \/\/ Max kernels, one for the original data and one for each integration step (MOMAD mode)\n std::vector<cl::Kernel *> max;\n \/\/ Median of medians first step, one for the original data and one for each integration step (MOMAD mode)\n std::vector<cl::Kernel *> medianOfMediansStepOne;\n \/\/ Median of medians second step, one for the original data and one for each integration step (MOMAD mode)\n std::vector<cl::Kernel *> medianOfMediansStepTwo;\n \/\/ Median of medians absolute deviation, one for the original data and one for each integration step (MOMAD mode)\n std::vector<cl::Kernel *> medianOfMediansAbsoluteDeviation;\n};\n\nstruct KernelRunTimeConfigurations\n{\n \/\/ Global NDrange for single step dedispersion\n cl::NDRange dedispersionSingleStepGlobal;\n \/\/ Local NDRange for single step dedispersion\n cl::NDRange dedispersionSingleStepLocal;\n \/\/ Global NDRange for subbanding dedispersion step one\n cl::NDRange dedispersionStepOneGlobal;\n \/\/ Local NDRange for subbanding dedispersion step one\n cl::NDRange dedispersionStepOneLocal;\n \/\/ Global NDRange for subbanding dedispersion step two\n cl::NDRange dedispersionStepTwoGlobal;\n \/\/ Local NDRange for subbanding dedispersion step two\n cl::NDRange dedispersionStepTwoLocal;\n \/\/ Global NDRange for integration\n std::vector<cl::NDRange> integrationGlobal;\n \/\/ Local NDRange for integration\n std::vector<cl::NDRange> integrationLocal;\n \/\/ Global NDRange for SNR (SNR mode)\n std::vector<cl::NDRange> snrGlobal;\n \/\/ Local NDRange for SNR (SNR mode)\n std::vector<cl::NDRange> snrLocal;\n \/\/ Global NDRange for max (MOMAD mode)\n std::vector<cl::NDRange> maxGlobal;\n \/\/ Local NDRange for max (MOMAD mode)\n std::vector<cl::NDRange> maxLocal;\n \/\/ Global NDRange for median of medians first step (MOMAD mode)\n std::vector<cl::NDRange> medianOfMediansStepOneGlobal;\n \/\/ Local NDRange for median of medians first step (MOMAD mode)\n std::vector<cl::NDRange> medianOfMediansStepOneLocal;\n \/\/ Global NDRange for median of medians second step (MOMAD mode)\n std::vector<cl::NDRange> medianOfMediansStepTwoGlobal;\n \/\/ Local NDRange for median of medians second step (MOMAD mode)\n std::vector<cl::NDRange> medianOfMediansStepTwoLocal;\n \/\/ Global NDRange for median of medians absolute deviation (MOMAD mode)\n std::vector<cl::NDRange> medianOfMediansAbsoluteDeviationGlobal;\n \/\/ Local NDRange for median of medians absolute deviation (MOMAD mode)\n std::vector<cl::NDRange> medianOfMediansAbsoluteDeviationLocal;\n};\n\nstruct Timers\n{\n isa::utils::Timer inputLoad;\n isa::utils::Timer search;\n isa::utils::Timer inputHandling;\n isa::utils::Timer inputCopy;\n isa::utils::Timer dedispersionSingleStep;\n isa::utils::Timer dedispersionStepOne;\n isa::utils::Timer dedispersionStepTwo;\n isa::utils::Timer integration;\n isa::utils::Timer snr;\n isa::utils::Timer outputCopy;\n isa::utils::Timer trigger;\n};\n\nstruct TriggeredEvent\n{\n unsigned int beam = 0;\n unsigned int sample = 0;\n unsigned int integration = 0;\n float DM = 0.0f;\n float SNR = 0.0f;\n};\n\nstruct CompactedEvent : TriggeredEvent\n{\n unsigned int compactedIntegration = 1;\n unsigned int compactedDMs = 1;\n};\n\nusing TriggeredEvents = std::vector<std::map<unsigned int, std::vector<TriggeredEvent>>>;\nusing CompactedEvents = std::vector<std::vector<CompactedEvent>>;\n\nstruct OpenCLRunTime\n{\n cl::Context *context = nullptr;\n std::vector<cl::Platform> *platforms = nullptr;\n std::vector<cl::Device> *devices = nullptr;\n std::vector<std::vector<cl::CommandQueue>> *queues = nullptr;\n};\n\nenum SNRMode\n{\n Standard,\n Momad\n};\n<commit_msg>Added timers for MOMAD kernels.<commit_after>\/\/ Copyright 2017 Netherlands Institute for Radio Astronomy (ASTRON)\n\/\/ Copyright 2017 Netherlands eScience Center\n\/\/\n\/\/ Licensed under the Apache License, Version 2.0 (the \"License\");\n\/\/ you may not use this file except in compliance with the License.\n\/\/ You may obtain a copy of the License at\n\/\/\n\/\/ http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n\/\/\n\/\/ Unless required by applicable law or agreed to in writing, software\n\/\/ distributed under the License is distributed on an \"AS IS\" BASIS,\n\/\/ WITHOUT WARRANTIES OR CONDITIONS OF 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\nstruct Options\n{\n \/\/ Debug mode\n bool debug = false;\n \/\/ Print messages to standard output\n bool print = false;\n \/\/ Use subband dedispersion\n bool subbandDedispersion = false;\n \/\/ Avoid merging batches of dispersed data into contiguous memory\n bool splitBatchesDedispersion = false;\n \/\/ Compact the triggered events in time and DM dimensions\n bool compactResults = false;\n \/\/ Threshold for triggering\n float threshold = 0.0f;\n \/\/ SNR mode\n SNRMode snrMode;\n \/\/ Step size for median of medians (MOMAD mode)\n unsigned int medianStepSize = 5;\n};\n\nstruct DeviceOptions\n{\n \/\/ OpenCL synchronized operations\n bool synchronized = false;\n \/\/ OpenCL platform ID\n unsigned int platformID = 0;\n \/\/ OpenCL device ID\n unsigned int deviceID = 0;\n \/\/ OpenCL device name\n std::string deviceName{};\n \/\/ Padding of OpenCL devices\n AstroData::paddingConf padding{};\n};\n\nstruct DataOptions\n{\n \/\/ Use LOFAR file as input\n bool dataLOFAR = false;\n \/\/ Use SIGPROC file as input\n bool dataSIGPROC = false;\n \/\/ Use PSRDADA buffer as input\n bool dataPSRDADA = false;\n \/\/ SIGPROC streaming mode\n bool streamingMode = false;\n \/\/ Size (in bytes) of the SIGPROC file header\n unsigned int headerSizeSIGPROC = 0;\n \/\/ Name of the input file\n std::string dataFile{};\n \/\/ Basename for the output files\n std::string outputFile{};\n \/\/ Name of the file containing the zapped channels\n std::string channelsFile{};\n \/\/ Name of the file containing the integration steps\n std::string integrationFile{};\n#ifdef HAVE_HDF5\n \/\/ Limit the number of batches processed from a LOFAR file\n bool limit = false;\n \/\/ Name of the LOFAR header file\n std::string headerFile{};\n#endif \/\/ HAVE_HDF5\n#ifdef HAVE_PSRDADA\n \/\/ PSRDADA buffer key\n key_t dadaKey = 0;\n#endif \/\/ HAVE_PSRDADA\n};\n\nstruct GeneratorOptions\n{\n \/\/ Use random numbers in generated data\n bool random = false;\n \/\/ Width of random generated pulse\n unsigned int width = 0;\n \/\/ DM of random generated pulse\n float DM = 0.0f;\n};\n\nstruct HostMemory\n{\n \/\/ Input data when reading a whole input file\n std::vector<std::vector<std::vector<inputDataType> *> *> input;\n \/\/ Input data when in streaming mode\n std::vector<std::vector<inputDataType> *> inputStream;\n \/\/ Zapped channels\n std::vector<unsigned int> zappedChannels;\n \/\/ Integration steps\n std::set<unsigned int> integrationSteps;\n \/\/ Map to create synthesized beams\n std::vector<unsigned int> beamMapping;\n \/\/ Dispersed data\n std::vector<inputDataType> dispersedData;\n \/\/ Subbanded data\n std::vector<outputDataType> subbandedData;\n \/\/ Dedispersed data\n std::vector<outputDataType> dedispersedData;\n \/\/ Integrated data\n std::vector<outputDataType> integratedData;\n \/\/ SNR data (SNR mode)\n std::vector<float> snrData;\n \/\/ Index of the sample with highest SNR value (SNR mode)\n std::vector<unsigned int> snrSamples;\n \/\/ Value of max sample (MOMAD mode)\n std::vector<outputDataType> maxValues;\n \/\/ Index of max sample (MOMAD MODE)\n std::vector<unsigned int> maxIndices;\n \/\/ Medians of medians (MOMAD mode)\n std::vector<outputDataType> mediansOfMedians;\n \/\/ Medians of medians absolute deviation (MOMAD mode)\n std::vector<outputDataType> medianOfMediansAbsoluteDeviation;\n \/\/ Shifts single step dedispersion\n std::vector<float> *shiftsSingleStep = nullptr;\n \/\/ Shifts step one subbanding dedispersion\n std::vector<float> *shiftsStepOne = nullptr;\n \/\/ Shifts step two subbanding dedispersion\n std::vector<float> *shiftsStepTwo = nullptr;\n#ifdef HAVE_PSRDADA\n \/\/ PSRDADA ring buffer\n dada_hdu_t *ringBuffer = nullptr;\n#endif \/\/ HAVE_PSRDADA\n};\n\nstruct DeviceMemory\n{\n \/\/ Shifts single step dedispersion\n cl::Buffer shiftsSingleStep;\n \/\/ Shifts step one subbanding dedispersion\n cl::Buffer shiftsStepOne;\n \/\/ Shifts step two subbanding dedispersion\n cl::Buffer shiftsStepTwo;\n \/\/ Zapped channels\n cl::Buffer zappedChannels;\n \/\/ Map to create synthesized beams\n cl::Buffer beamMapping;\n \/\/ Dispersed dada\n cl::Buffer dispersedData;\n \/\/ Subbanded data\n cl::Buffer subbandedData;\n \/\/ Dedispersed data\n cl::Buffer dedispersedData;\n \/\/ Integrated data\n cl::Buffer integratedData;\n \/\/ SNR data (SNR mode)\n cl::Buffer snrData;\n \/\/ Index of the sample with highest SNR value (SNR mode)\n cl::Buffer snrSamples;\n \/\/ Value of max sample (MOMAD mode)\n cl::Buffer maxValues;\n \/\/ Index of max sample (MOMAD mode)\n cl::Buffer maxIndices;\n \/\/ Median of medians first step (MOMAD mode)\n cl::Buffer medianOfMediansStepOne;\n \/\/ Median of medians second step (MOMAD mode)\n cl::Buffer medianOfMediansStepTwo;\n};\n\nstruct KernelConfigurations\n{\n \/\/ Configuration of single step dedispersion kernel\n Dedispersion::tunedDedispersionConf dedispersionSingleStepParameters;\n \/\/ Configuration of subband dedispersion kernel, step one\n Dedispersion::tunedDedispersionConf dedispersionStepOneParameters;\n \/\/ Configuration of subband dedispersion kernel, step two\n Dedispersion::tunedDedispersionConf dedispersionStepTwoParameters;\n \/\/ Configuration of integration kernel\n Integration::tunedIntegrationConf integrationParameters;\n \/\/ Configuration of SNR kernel (SNR mode)\n SNR::tunedSNRConf snrParameters;\n \/\/ Configuration of max kernel (MOMAD mode)\n SNR::tunedSNRConf maxParameters;\n \/\/ Configuration of median of medians first step (MOMAD mode)\n SNR::tunedSNRConf medianOfMediansStepOneParameters;\n \/\/ Configuration of median of medians second step (MOMAD mode)\n SNR::tunedSNRConf medianOfMediansStepTwoParameters;\n \/\/ Configuration of median of medians absolute deviation (MOMAD mode)\n SNR::tunedSNRConf medianOfMediansAbsoluteDeviationParameters;\n};\n\nstruct Kernels\n{\n \/\/ Single step dedispersion kernel\n cl::Kernel *dedispersionSingleStep = nullptr;\n \/\/ Step one subbanding dedispersion kernel\n cl::Kernel *dedispersionStepOne = nullptr;\n \/\/ Step two subbanding dedispersion kernel\n cl::Kernel *dedispersionStepTwo = nullptr;\n \/\/ Integration kernels, one for each integration step\n std::vector<cl::Kernel *> integration;\n \/\/ SNR kernels, one for the original data and one for each integration step (SNR mode)\n std::vector<cl::Kernel *> snr;\n \/\/ Max kernels, one for the original data and one for each integration step (MOMAD mode)\n std::vector<cl::Kernel *> max;\n \/\/ Median of medians first step, one for the original data and one for each integration step (MOMAD mode)\n std::vector<cl::Kernel *> medianOfMediansStepOne;\n \/\/ Median of medians second step, one for the original data and one for each integration step (MOMAD mode)\n std::vector<cl::Kernel *> medianOfMediansStepTwo;\n \/\/ Median of medians absolute deviation, one for the original data and one for each integration step (MOMAD mode)\n std::vector<cl::Kernel *> medianOfMediansAbsoluteDeviation;\n};\n\nstruct KernelRunTimeConfigurations\n{\n \/\/ Global NDrange for single step dedispersion\n cl::NDRange dedispersionSingleStepGlobal;\n \/\/ Local NDRange for single step dedispersion\n cl::NDRange dedispersionSingleStepLocal;\n \/\/ Global NDRange for subbanding dedispersion step one\n cl::NDRange dedispersionStepOneGlobal;\n \/\/ Local NDRange for subbanding dedispersion step one\n cl::NDRange dedispersionStepOneLocal;\n \/\/ Global NDRange for subbanding dedispersion step two\n cl::NDRange dedispersionStepTwoGlobal;\n \/\/ Local NDRange for subbanding dedispersion step two\n cl::NDRange dedispersionStepTwoLocal;\n \/\/ Global NDRange for integration\n std::vector<cl::NDRange> integrationGlobal;\n \/\/ Local NDRange for integration\n std::vector<cl::NDRange> integrationLocal;\n \/\/ Global NDRange for SNR (SNR mode)\n std::vector<cl::NDRange> snrGlobal;\n \/\/ Local NDRange for SNR (SNR mode)\n std::vector<cl::NDRange> snrLocal;\n \/\/ Global NDRange for max (MOMAD mode)\n std::vector<cl::NDRange> maxGlobal;\n \/\/ Local NDRange for max (MOMAD mode)\n std::vector<cl::NDRange> maxLocal;\n \/\/ Global NDRange for median of medians first step (MOMAD mode)\n std::vector<cl::NDRange> medianOfMediansStepOneGlobal;\n \/\/ Local NDRange for median of medians first step (MOMAD mode)\n std::vector<cl::NDRange> medianOfMediansStepOneLocal;\n \/\/ Global NDRange for median of medians second step (MOMAD mode)\n std::vector<cl::NDRange> medianOfMediansStepTwoGlobal;\n \/\/ Local NDRange for median of medians second step (MOMAD mode)\n std::vector<cl::NDRange> medianOfMediansStepTwoLocal;\n \/\/ Global NDRange for median of medians absolute deviation (MOMAD mode)\n std::vector<cl::NDRange> medianOfMediansAbsoluteDeviationGlobal;\n \/\/ Local NDRange for median of medians absolute deviation (MOMAD mode)\n std::vector<cl::NDRange> medianOfMediansAbsoluteDeviationLocal;\n};\n\nstruct Timers\n{\n isa::utils::Timer inputLoad;\n isa::utils::Timer search;\n isa::utils::Timer inputHandling;\n isa::utils::Timer inputCopy;\n isa::utils::Timer dedispersionSingleStep;\n isa::utils::Timer dedispersionStepOne;\n isa::utils::Timer dedispersionStepTwo;\n isa::utils::Timer integration;\n isa::utils::Timer snr;\n isa::utils::Timer max;\n isa::utils::Timer medianOfMediansStepOne;\n isa::utils::Timer medianOfMediansStepTwo;\n isa::utils::Timer medianOfMediansAbsoluteDeviationStepOne;\n isa::utils::Timer medianOfMediansAbsoluteDeviationStepTwo;\n isa::utils::Timer outputCopy;\n isa::utils::Timer trigger;\n};\n\nstruct TriggeredEvent\n{\n unsigned int beam = 0;\n unsigned int sample = 0;\n unsigned int integration = 0;\n float DM = 0.0f;\n float SNR = 0.0f;\n};\n\nstruct CompactedEvent : TriggeredEvent\n{\n unsigned int compactedIntegration = 1;\n unsigned int compactedDMs = 1;\n};\n\nusing TriggeredEvents = std::vector<std::map<unsigned int, std::vector<TriggeredEvent>>>;\nusing CompactedEvents = std::vector<std::vector<CompactedEvent>>;\n\nstruct OpenCLRunTime\n{\n cl::Context *context = nullptr;\n std::vector<cl::Platform> *platforms = nullptr;\n std::vector<cl::Device> *devices = nullptr;\n std::vector<std::vector<cl::CommandQueue>> *queues = nullptr;\n};\n\nenum SNRMode\n{\n Standard,\n Momad\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 \"crypto\/hmac.h\"\n\n#include <nss.h>\n#include <pk11pub.h>\n\n#include \"base\/logging.h\"\n#include \"base\/memory\/scoped_ptr.h\"\n#include \"crypto\/nss_util.h\"\n#include \"crypto\/scoped_nss_types.h\"\n\nnamespace crypto {\n\nstruct HMACPlatformData {\n CK_MECHANISM_TYPE mechanism_;\n ScopedPK11Slot slot_;\n ScopedPK11SymKey sym_key_;\n};\n\nHMAC::HMAC(HashAlgorithm hash_alg)\n : hash_alg_(hash_alg), plat_(new HMACPlatformData()) {\n \/\/ Only SHA-1 and SHA-256 hash algorithms are supported.\n switch (hash_alg_) {\n case SHA1:\n plat_->mechanism_ = CKM_SHA_1_HMAC;\n break;\n case SHA256:\n plat_->mechanism_ = CKM_SHA256_HMAC;\n break;\n default:\n NOTREACHED() << \"Unsupported hash algorithm\";\n break;\n }\n}\n\nHMAC::~HMAC() {\n}\n\nbool HMAC::Init(const unsigned char *key, int key_length) {\n EnsureNSSInit();\n\n if (plat_->slot_.get()) {\n \/\/ Init must not be called more than twice on the same HMAC object.\n NOTREACHED();\n return false;\n }\n\n plat_->slot_.reset(PK11_GetBestSlot(plat_->mechanism_, NULL));\n if (!plat_->slot_.get()) {\n NOTREACHED();\n return false;\n }\n\n SECItem key_item;\n key_item.type = siBuffer;\n key_item.data = const_cast<unsigned char*>(key); \/\/ NSS API isn't const.\n key_item.len = key_length;\n\n plat_->sym_key_.reset(PK11_ImportSymKey(plat_->slot_.get(),\n plat_->mechanism_,\n PK11_OriginUnwrap,\n CKA_SIGN,\n &key_item,\n NULL));\n if (!plat_->sym_key_.get()) {\n NOTREACHED();\n return false;\n }\n\n return true;\n}\n\nbool HMAC::Sign(const base::StringPiece& data,\n unsigned char* digest,\n int digest_length) const {\n if (!plat_->sym_key_.get()) {\n \/\/ Init has not been called before Sign.\n NOTREACHED();\n return false;\n }\n\n SECItem param = { siBuffer, NULL, 0 };\n ScopedPK11Context context(PK11_CreateContextBySymKey(plat_->mechanism_,\n CKA_SIGN,\n plat_->sym_key_.get(),\n ¶m));\n if (!context.get()) {\n NOTREACHED();\n return false;\n }\n\n if (PK11_DigestBegin(context.get()) != SECSuccess) {\n NOTREACHED();\n return false;\n }\n\n if (PK11_DigestOp(context.get(),\n reinterpret_cast<const unsigned char*>(data.data()),\n data.length()) != SECSuccess) {\n NOTREACHED();\n return false;\n }\n\n unsigned int len = 0;\n if (PK11_DigestFinal(context.get(),\n digest, &len, digest_length) != SECSuccess) {\n NOTREACHED();\n return false;\n }\n\n return true;\n}\n\n} \/\/ namespace crypto\n<commit_msg>Fixed slot selection in HMAC class to ensure that we are using softtoken instead of TPM slots.<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 \"crypto\/hmac.h\"\n\n#include <nss.h>\n#include <pk11pub.h>\n\n#include \"base\/logging.h\"\n#include \"base\/memory\/scoped_ptr.h\"\n#include \"crypto\/nss_util.h\"\n#include \"crypto\/scoped_nss_types.h\"\n\nnamespace crypto {\n\nstruct HMACPlatformData {\n CK_MECHANISM_TYPE mechanism_;\n ScopedPK11Slot slot_;\n ScopedPK11SymKey sym_key_;\n};\n\nHMAC::HMAC(HashAlgorithm hash_alg)\n : hash_alg_(hash_alg), plat_(new HMACPlatformData()) {\n \/\/ Only SHA-1 and SHA-256 hash algorithms are supported.\n switch (hash_alg_) {\n case SHA1:\n plat_->mechanism_ = CKM_SHA_1_HMAC;\n break;\n case SHA256:\n plat_->mechanism_ = CKM_SHA256_HMAC;\n break;\n default:\n NOTREACHED() << \"Unsupported hash algorithm\";\n break;\n }\n}\n\nHMAC::~HMAC() {\n}\n\nbool HMAC::Init(const unsigned char *key, int key_length) {\n EnsureNSSInit();\n\n if (plat_->slot_.get()) {\n \/\/ Init must not be called more than twice on the same HMAC object.\n NOTREACHED();\n return false;\n }\n\n plat_->slot_.reset(PK11_GetInternalSlot());\n if (!plat_->slot_.get()) {\n NOTREACHED();\n return false;\n }\n\n SECItem key_item;\n key_item.type = siBuffer;\n key_item.data = const_cast<unsigned char*>(key); \/\/ NSS API isn't const.\n key_item.len = key_length;\n\n plat_->sym_key_.reset(PK11_ImportSymKey(plat_->slot_.get(),\n plat_->mechanism_,\n PK11_OriginUnwrap,\n CKA_SIGN,\n &key_item,\n NULL));\n if (!plat_->sym_key_.get()) {\n NOTREACHED();\n return false;\n }\n\n return true;\n}\n\nbool HMAC::Sign(const base::StringPiece& data,\n unsigned char* digest,\n int digest_length) const {\n if (!plat_->sym_key_.get()) {\n \/\/ Init has not been called before Sign.\n NOTREACHED();\n return false;\n }\n\n SECItem param = { siBuffer, NULL, 0 };\n ScopedPK11Context context(PK11_CreateContextBySymKey(plat_->mechanism_,\n CKA_SIGN,\n plat_->sym_key_.get(),\n ¶m));\n if (!context.get()) {\n NOTREACHED();\n return false;\n }\n\n if (PK11_DigestBegin(context.get()) != SECSuccess) {\n NOTREACHED();\n return false;\n }\n\n if (PK11_DigestOp(context.get(),\n reinterpret_cast<const unsigned char*>(data.data()),\n data.length()) != SECSuccess) {\n LOG(WARNING) << \"PK11_DigestOp failed, error \" << PORT_GetError()\n << \", slot name \" << PK11_GetSlotName(plat_->slot_.get())\n << \", token name \" << PK11_GetTokenName(plat_->slot_.get());\n NOTREACHED();\n return false;\n }\n\n unsigned int len = 0;\n if (PK11_DigestFinal(context.get(),\n digest, &len, digest_length) != SECSuccess) {\n NOTREACHED();\n return false;\n }\n\n return true;\n}\n\n} \/\/ namespace crypto\n<|endoftext|>"} {"text":"<commit_before>\/* Siconos-Kernel, Copyright INRIA 2005-2012.\n* Siconos is a program dedicated to modeling, simulation and control\n* of non smooth dynamical systems.\n* Siconos is a free software; you can redistribute it and\/or modify\n* it under the terms of the GNU General Public License as published by\n* the Free Software Foundation; either version 2 of the License, or\n* (at your option) any later version.\n* Siconos is distributed in the hope that it will be useful,\n* but WITHOUT ANY WARRANTY; without even the implied warranty of\n* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the\n* GNU General Public License for more details.\n*\n* You should have received a copy of the GNU General Public License\n* along with Siconos; if not, write to the Free Software\n* Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA\n*\n* Contact: Vincent ACARY, siconos-team@lists.gforge.inria.fr\n*\/\n\n\/*! \\file Question.hpp\n \\brief ask something to a class with a visitor *\/\n\n\/** example :\n *\n * struct ForMass : public Question<SP::SiconosMatrix>\n * {\n * void visit(const LagrangianDS& ds)\n * {\n * Question::answer = ds.mass();\n * }\n *\n * }\n * SP::DynamicalSystem ds\n * [...]\n *\n * SP::SiconosMatrix mass = ask<ForMass>(*ds);\n *\/\n\n\/* use boost array for the initialization of non const reference *\/\n\/\/#include <boost\/type_traits.hpp>\n\n#ifndef Question_hpp\n#define Question_hpp\n\n#include \"SiconosVisitor.hpp\"\n\n#if (__cplusplus >= 201103L) && !defined(USE_BOOST_FOR_CXX11)\n#include <type_traits>\n#include <array>\n#else\n#include <boost\/type_traits\/remove_reference.hpp>\n#include <boost\/array.hpp>\n#endif\n\n\/** a generic return value visitor *\/\ntemplate <class AnswerType>\nstruct Question : public SiconosVisitor\n{\n typedef AnswerType type;\n type answer;\n\n Question() : answer(std11::array<typename std11::remove_reference<AnswerType>::type, 1>()[0])\n {};\n Question(AnswerType ref) : answer(ref) {};\n\n};\n\n\n\/** get some value from a visitable object with the help of a\n GeneralQuestion\n \\param v a visitable object\n *\/\ntemplate <class GeneralQuestion, class Visitable>\ntypename GeneralQuestion::type ask(const Visitable& v)\n{\n GeneralQuestion t;\n\n v.accept(t);\n\n return t.answer;\n\n}\n\n\/** get some value from a visitable object with the help of a\n parameterized GeneralQuestion\n \\param v a visitable object\n \\param arg the GeneralQuestion argument\n *\/\ntemplate <class GeneralQuestion, class Visitable, class Argument>\ntypename GeneralQuestion::type ask(const Visitable& v, const Argument& arg)\n{\n GeneralQuestion t(arg);\n\n v.accept(t);\n\n return t.answer;\n\n}\n\n\/** apply a SiconosVisitor to a visitable object\n * \\param v a visitable object\n *\/\ntemplate <class Visitor, class Visitable>\nvoid apply(const Visitable& v)\n{\n static Visitor t;\n\n v.accept(t);\n\n}\n\n\/** apply a parameterized SiconosVisitor to a visitable object\n * \\param v a visitable object\n * \\param arg the SiconosVisitor argument\n *\/\ntemplate <class VisitorWithArgument, class Visitable, class Argument>\nvoid apply(const Visitable& v, const Argument& arg)\n{\n VisitorWithArgument t(arg);\n\n v.accept(t);\n\n}\n\n\/** apply a parameterized SiconosVisitor to a visitable object\n * \\param v a visitable object\n * \\param arg1 the first SiconosVisitor argument\n * \\param arg2 the second SiconosVisitor argument\n *\/\ntemplate <class VisitorWith2Arguments, class Visitable, class Argument1, class Argument2>\nvoid apply(const Visitable& v, const Argument1& arg1, const Argument2& arg2)\n{\n VisitorWith2Arguments t(arg1, arg2);\n\n v.accept(t);\n\n}\n\n\n\n#define ANSWER(T,CODE) \\\n void visit(const T& ds) \\\n { \\\n answer = ds . CODE; \\\n }\n\n#define ANSWER_V(T,CODE) \\\n void visit(const T& ds) \\\n { \\\n answer = CODE; \\\n }\n\n#define ANSWER_F(T,CODE) \\\n void visit(const T& ds) \\\n { \\\n answer = CODE(ds); \\\n }\n\n\n#endif\n<commit_msg>Revert \"Remove declaration using SiconosVisitor::visit; to avoid double declaration\"<commit_after>\/* Siconos-Kernel, Copyright INRIA 2005-2012.\n* Siconos is a program dedicated to modeling, simulation and control\n* of non smooth dynamical systems.\n* Siconos is a free software; you can redistribute it and\/or modify\n* it under the terms of the GNU General Public License as published by\n* the Free Software Foundation; either version 2 of the License, or\n* (at your option) any later version.\n* Siconos is distributed in the hope that it will be useful,\n* but WITHOUT ANY WARRANTY; without even the implied warranty of\n* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the\n* GNU General Public License for more details.\n*\n* You should have received a copy of the GNU General Public License\n* along with Siconos; if not, write to the Free Software\n* Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA\n*\n* Contact: Vincent ACARY, siconos-team@lists.gforge.inria.fr\n*\/\n\n\/*! \\file Question.hpp\n \\brief ask something to a class with a visitor *\/\n\n\/** example :\n *\n * struct ForMass : public Question<SP::SiconosMatrix>\n * {\n * void visit(const LagrangianDS& ds)\n * {\n * Question::answer = ds.mass();\n * }\n *\n * }\n * SP::DynamicalSystem ds\n * [...]\n *\n * SP::SiconosMatrix mass = ask<ForMass>(*ds);\n *\/\n\n\/* use boost array for the initialization of non const reference *\/\n\/\/#include <boost\/type_traits.hpp>\n\n#ifndef Question_hpp\n#define Question_hpp\n\n#include \"SiconosVisitor.hpp\"\n\n#if (__cplusplus >= 201103L) && !defined(USE_BOOST_FOR_CXX11)\n#include <type_traits>\n#include <array>\n#else\n#include <boost\/type_traits\/remove_reference.hpp>\n#include <boost\/array.hpp>\n#endif\n\n\/** a generic return value visitor *\/\ntemplate <class AnswerType>\nstruct Question : public SiconosVisitor\n{\n typedef AnswerType type;\n type answer;\n\n Question() : answer(std11::array<typename std11::remove_reference<AnswerType>::type, 1>()[0])\n {};\n Question(AnswerType ref) : answer(ref) {};\n\n};\n\n\n\/** get some value from a visitable object with the help of a\n GeneralQuestion\n \\param v a visitable object\n *\/\ntemplate <class GeneralQuestion, class Visitable>\ntypename GeneralQuestion::type ask(const Visitable& v)\n{\n GeneralQuestion t;\n\n v.accept(t);\n\n return t.answer;\n\n}\n\n\/** get some value from a visitable object with the help of a\n parameterized GeneralQuestion\n \\param v a visitable object\n \\param arg the GeneralQuestion argument\n *\/\ntemplate <class GeneralQuestion, class Visitable, class Argument>\ntypename GeneralQuestion::type ask(const Visitable& v, const Argument& arg)\n{\n GeneralQuestion t(arg);\n\n v.accept(t);\n\n return t.answer;\n\n}\n\n\/** apply a SiconosVisitor to a visitable object\n * \\param v a visitable object\n *\/\ntemplate <class Visitor, class Visitable>\nvoid apply(const Visitable& v)\n{\n static Visitor t;\n\n v.accept(t);\n\n}\n\n\/** apply a parameterized SiconosVisitor to a visitable object\n * \\param v a visitable object\n * \\param arg the SiconosVisitor argument\n *\/\ntemplate <class VisitorWithArgument, class Visitable, class Argument>\nvoid apply(const Visitable& v, const Argument& arg)\n{\n VisitorWithArgument t(arg);\n\n v.accept(t);\n\n}\n\n\/** apply a parameterized SiconosVisitor to a visitable object\n * \\param v a visitable object\n * \\param arg1 the first SiconosVisitor argument\n * \\param arg2 the second SiconosVisitor argument\n *\/\ntemplate <class VisitorWith2Arguments, class Visitable, class Argument1, class Argument2>\nvoid apply(const Visitable& v, const Argument1& arg1, const Argument2& arg2)\n{\n VisitorWith2Arguments t(arg1, arg2);\n\n v.accept(t);\n\n}\n\n\n\n#define ANSWER(T,CODE) \\\n using SiconosVisitor::visit; \\\n void visit(const T& ds) \\\n { \\\n answer = ds . CODE; \\\n }\n\n#define ANSWER_V(T,CODE) \\\n using SiconosVisitor::visit; \\\n void visit(const T& ds) \\\n { \\\n answer = CODE; \\\n }\n\n#define ANSWER_F(T,CODE) \\\n using SiconosVisitor::visit; \\\n void visit(const T& ds) \\\n { \\\n answer = CODE(ds); \\\n }\n\n\n#endif\n<|endoftext|>"} {"text":"<commit_before>\/*\n Realm of Aesir client\n Copyright (C) 2016 Michael de Lang\n\n This program is free software: you can redistribute it and\/or modify\n it under the terms of the GNU Affero General Public License as published by\n the Free Software Foundation, either version 3 of the License, or\n (at your option) any later version.\n\n This program is distributed in the hope that it will be useful,\n but WITHOUT ANY WARRANTY; without even the implied warranty of\n MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the\n GNU Affero General Public License for more details.\n\n You should have received a copy of the GNU Affero General Public License\n along with this program. If not, see <http:\/\/www.gnu.org\/licenses\/>.\n*\/\n\n#include \"sprite.h\"\n\n#include <array>\n#include <SDL.h>\n#include <SDL_opengl.h>\n#include <SDL_image.h>\n#include <glm\/gtc\/type_ptr.hpp>\n#include <glm\/gtc\/matrix_transform.hpp>\n#include <easylogging++.h>\n\n#include \"shader_utils.h\"\n#include \"texture_manager.h\"\n\nusing namespace std;\n\n#ifdef EXPERIMENTAL_OPTIONAL\nusing namespace experimental;\n#endif\n\nsprite::sprite(string const & image, string const & vertex_shader, string const & fragment_shader,\n glm::mat4 const projection_matrix, glm::vec4 const position, optional<glm::vec4> const clip) noexcept\n : _image(image), _texture(create_texture_from_image(image)) {\n\n _program_id = create_shader_program(vertex_shader, fragment_shader);\n _projection = projection_matrix;\n\n array<GLfloat, 16> vertexData;\n if(clip) {\n if(clip.value().x < 0 || clip.value().x > _texture._width || clip.value().y < 0 || clip.value().y > _texture._height) {\n LOG(FATAL) << \"clip out of bounds\";\n }\n\n float x = position.x;\n float y = position.y;\n float w = position.z;\n float h = position.w;\n\n LOG(INFO) << \"[sprite] \" << x << \" \" << y << \" \" << w << \" \" << h << endl;\n\n vertexData = {\n x, y, 0.0f, 0.0f,\n x+w, y, 1.0f, 0.0f,\n x, y, 0.0f, 1.0f,\n x+y, y+h, 1.0f, 1.0f\n };\n\n vertexData[2] = clip.value().x \/ _texture._width;\n vertexData[3] = clip.value().y \/ _texture._height;\n\n vertexData[6] = (clip.value().x + clip.value().z) \/ _texture._width;\n vertexData[7] = clip.value().y \/ _texture._height;\n\n vertexData[10] = clip.value().x \/ _texture._width;\n vertexData[11] = (clip.value().y + clip.value().w) \/ _texture._height;\n\n vertexData[14] = (clip.value().x + clip.value().z) \/ _texture._width;\n vertexData[15] = (clip.value().y + clip.value().w) \/ _texture._height;\n } else {\n vertexData = {\n 0.0f, 0.0f, 0.0f, 0.0f,\n 1.0f, 0.0f, 1.0f, 0.0f,\n 0.0f, 1.0f, 0.0f, 1.0f,\n 1.0f, 1.0f, 1.0f, 1.0f\n };\n }\n\n glGenBuffers(1, &_buffer_object);\n glGenVertexArrays(1, &_vertex_array_id);\n glBindVertexArray(_vertex_array_id);\n\n glBindBuffer(GL_ARRAY_BUFFER, _buffer_object);\n glBufferData(GL_ARRAY_BUFFER, sizeof(vertexData), vertexData.data(), GL_DYNAMIC_DRAW);\n\n glEnableVertexAttribArray(0);\n glVertexAttribPointer(0, 2, GL_FLOAT, GL_FALSE, 4 * sizeof(GLfloat), (GLvoid*)0);\n\n glEnableVertexAttribArray(1);\n glVertexAttribPointer(1, 2, GL_FLOAT, GL_FALSE, 4 * sizeof(GLfloat), (GLvoid*)(2 * sizeof(GLfloat)));\n\n glBindVertexArray(0);\n\n glUseProgram(_program_id);\n\n _projection_location = glGetUniformLocation(_program_id, \"projection\");\n if(_projection_location < 0) {\n LOG(FATAL) << \"[tile] projection location not found in shader\" << endl;\n }\n glUniformMatrix4fv(_projection_location, 1, GL_FALSE, glm::value_ptr(_projection));\n\n _textureunit_location = glGetUniformLocation(_program_id, \"textureUnit\");\n if(_textureunit_location < 0) {\n LOG(FATAL) << \"[tile] textureUnit not found in shader\" << endl;\n }\n glUniform1i(_textureunit_location, GL_TEXTURE0);\n\n glUseProgram(0);\n}\n\nsprite::~sprite() noexcept {\n glDeleteBuffers(1, &_buffer_object);\n glDeleteProgram(_program_id);\n delete_texture(_image);\n}\n\nvoid sprite::render() const noexcept {\n \/\/LOG(INFO) << \"[tile] rendering \" << _program_id << \" - \" << _texture_id << \" - \" << _buffer_object << endl;\n glUseProgram(_program_id);\n\n glActiveTexture(GL_TEXTURE0);\n\n glBindTexture(GL_TEXTURE_2D, _texture._texture_id);\n glBindVertexArray(_vertex_array_id);\n\n glDrawArrays(GL_TRIANGLE_STRIP, 0, 4);\n\n glBindVertexArray(0);\n\n glUseProgram(0);\n}\n\nvoid sprite::set_projection(glm::mat4& projection) noexcept {\n _projection = projection;\n glUniformMatrix4fv(_projection_location, 1, GL_FALSE, glm::value_ptr(_projection));\n}\n<commit_msg>Fix vertex data error<commit_after>\/*\n Realm of Aesir client\n Copyright (C) 2016 Michael de Lang\n\n This program is free software: you can redistribute it and\/or modify\n it under the terms of the GNU Affero General Public License as published by\n the Free Software Foundation, either version 3 of the License, or\n (at your option) any later version.\n\n This program is distributed in the hope that it will be useful,\n but WITHOUT ANY WARRANTY; without even the implied warranty of\n MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the\n GNU Affero General Public License for more details.\n\n You should have received a copy of the GNU Affero General Public License\n along with this program. If not, see <http:\/\/www.gnu.org\/licenses\/>.\n*\/\n\n#include \"sprite.h\"\n\n#include <array>\n#include <SDL.h>\n#include <SDL_opengl.h>\n#include <SDL_image.h>\n#include <glm\/gtc\/type_ptr.hpp>\n#include <glm\/gtc\/matrix_transform.hpp>\n#include <easylogging++.h>\n\n#include \"shader_utils.h\"\n#include \"texture_manager.h\"\n\nusing namespace std;\n\n#ifdef EXPERIMENTAL_OPTIONAL\nusing namespace experimental;\n#endif\n\nsprite::sprite(string const & image, string const & vertex_shader, string const & fragment_shader,\n glm::mat4 const projection_matrix, glm::vec4 const position, optional<glm::vec4> const clip) noexcept\n : _image(image), _texture(create_texture_from_image(image)) {\n\n _program_id = create_shader_program(vertex_shader, fragment_shader);\n _projection = projection_matrix;\n\n array<GLfloat, 16> vertexData;\n\n float x = position.x;\n float y = position.y;\n float w = position.z;\n float h = position.w;\n\n vertexData = {\n x, y, 0.0f, 0.0f,\n x+w, y, 1.0f, 0.0f,\n x, y+h, 0.0f, 1.0f,\n x+w, y+h, 1.0f, 1.0f\n };\n\n if(clip) {\n if(clip.value().x < 0 || clip.value().x > _texture._width || clip.value().y < 0 || clip.value().y > _texture._height) {\n LOG(FATAL) << \"clip out of bounds\";\n }\n \n vertexData[2] = clip.value().x \/ _texture._width;\n vertexData[3] = clip.value().y \/ _texture._height;\n\n vertexData[6] = (clip.value().x + clip.value().z) \/ _texture._width;\n vertexData[7] = clip.value().y \/ _texture._height;\n\n vertexData[10] = clip.value().x \/ _texture._width;\n vertexData[11] = (clip.value().y + clip.value().w) \/ _texture._height;\n\n vertexData[14] = (clip.value().x + clip.value().z) \/ _texture._width;\n vertexData[15] = (clip.value().y + clip.value().w) \/ _texture._height;\n }\n\n glGenBuffers(1, &_buffer_object);\n glGenVertexArrays(1, &_vertex_array_id);\n glBindVertexArray(_vertex_array_id);\n\n glBindBuffer(GL_ARRAY_BUFFER, _buffer_object);\n glBufferData(GL_ARRAY_BUFFER, sizeof(vertexData), vertexData.data(), GL_DYNAMIC_DRAW);\n\n glEnableVertexAttribArray(0);\n glVertexAttribPointer(0, 2, GL_FLOAT, GL_FALSE, 4 * sizeof(GLfloat), (GLvoid*)0);\n\n glEnableVertexAttribArray(1);\n glVertexAttribPointer(1, 2, GL_FLOAT, GL_FALSE, 4 * sizeof(GLfloat), (GLvoid*)(2 * sizeof(GLfloat)));\n\n glBindVertexArray(0);\n\n glUseProgram(_program_id);\n\n _projection_location = glGetUniformLocation(_program_id, \"projection\");\n if(_projection_location < 0) {\n LOG(FATAL) << \"[tile] projection location not found in shader\" << endl;\n }\n glUniformMatrix4fv(_projection_location, 1, GL_FALSE, glm::value_ptr(_projection));\n\n _textureunit_location = glGetUniformLocation(_program_id, \"textureUnit\");\n if(_textureunit_location < 0) {\n LOG(FATAL) << \"[tile] textureUnit not found in shader\" << endl;\n }\n glUniform1i(_textureunit_location, GL_TEXTURE0);\n\n glUseProgram(0);\n}\n\nsprite::~sprite() noexcept {\n glDeleteBuffers(1, &_buffer_object);\n glDeleteProgram(_program_id);\n delete_texture(_image);\n}\n\nvoid sprite::render() const noexcept {\n \/\/LOG(INFO) << \"[tile] rendering \" << _program_id << \" - \" << _texture_id << \" - \" << _buffer_object << endl;\n glUseProgram(_program_id);\n\n glActiveTexture(GL_TEXTURE0);\n\n glBindTexture(GL_TEXTURE_2D, _texture._texture_id);\n glBindVertexArray(_vertex_array_id);\n\n glDrawArrays(GL_TRIANGLE_STRIP, 0, 4);\n\n glBindVertexArray(0);\n\n glUseProgram(0);\n}\n\nvoid sprite::set_projection(glm::mat4& projection) noexcept {\n _projection = projection;\n glUniformMatrix4fv(_projection_location, 1, GL_FALSE, glm::value_ptr(_projection));\n}\n<|endoftext|>"} {"text":"<commit_before><commit_msg>INTEGRATION: CWS canvas05 (1.13.2); FILE MERGED 2008\/04\/21 07:31:09 thb 1.13.2.3: RESYNC: (1.13-1.14); FILE MERGED 2007\/12\/20 22:18:58 thb 1.13.2.2: #i81092# #i78888# #i78925# #i79258# #i79437# #i84784# Large canvas rework, completing various areas such as color spaces, bitmap data access, true sprite and non-sprite implementations, and upstreaming the canvas parts of rodos emf+ rendering 2007\/10\/01 13:02:02 thb 1.13.2.1: #i78888# #i78925# #i79258# #i79437# Merge from CWS picom<commit_after><|endoftext|>"} {"text":"<commit_before>template<typename T>\nT* newCopiedArray(const T* source, size_t source_count, size_t destination_size) \/*strong*\/\n{\n\tT* new_array = nullptr;\n\ttry {\n\t\tnew_array = new T[destination_size];\n\t\tstd::copy(source, source + source_count, new_array); \/\/Throws if an element assignment throws\n\t}\n\tcatch (...) {\n\t\tdelete[] new_array;\n\t\tthrow;\n\t}\n\treturn new_array;\n}\n\ntemplate <typename T>\nclass allocator\n{\nprotected:\n\tallocator(size_t size = 0);\n\t~allocator();\n\tauto swap(allocator & other) -> void;\n\n\tallocator(allocator const &) = delete;\n\tauto operator =(allocator const &)->allocator & = delete;\n\n\tT * ptr_;\n\tsize_t size_;\n\tsize_t count_;\n};\n\ntemplate<typename T>\nallocator<T>::allocator(size_t size = 0)\n{\n\tptr_ = new T[size];\n}\n\ntemplate<typename T>\nallocator<T>::~allocator()\n{\n\tdelete[] ptr_;\n}\n\ntemplate<typename T>\nauto allocator<T>::swap(allocator & other) -> void\n{\n\tif (count_ > other.size_ || other.count_ > size_) {\n\n\t}\n}\n<commit_msg>size_t size = 0 ==> size_t size<commit_after>template<typename T>\nT* newCopiedArray(const T* source, size_t source_count, size_t destination_size) \/*strong*\/\n{\n\tT* new_array = nullptr;\n\ttry {\n\t\tnew_array = new T[destination_size];\n\t\tstd::copy(source, source + source_count, new_array); \/\/Throws if an element assignment throws\n\t}\n\tcatch (...) {\n\t\tdelete[] new_array;\n\t\tthrow;\n\t}\n\treturn new_array;\n}\n\ntemplate <typename T>\nclass allocator\n{\nprotected:\n\tallocator(size_t size = 0);\n\t~allocator();\n\tauto swap(allocator & other) -> void;\n\n\tallocator(allocator const &) = delete;\n\tauto operator =(allocator const &)->allocator & = delete;\n\n\tT * ptr_;\n\tsize_t size_;\n\tsize_t count_;\n};\n\ntemplate<typename T>\nallocator<T>::allocator(size_t size)\n{\n\tptr_ = new T[size];\n}\n\ntemplate<typename T>\nallocator<T>::~allocator()\n{\n\tdelete[] ptr_;\n}\n\ntemplate<typename T>\nauto allocator<T>::swap(allocator & other) -> void\n{\n\tif (count_ > other.size_ || other.count_ > size_) {\n\n\t}\n}\n<|endoftext|>"} {"text":"<commit_before>#include <stdio.h>\n#include \"Halide.h\"\nusing namespace Halide;\n\nint main(int argc, char **argv) {\n\n Func f, g, h; Var x, y;\n\n h(x) = x;\n g(x) = h(x-1) + h(x+1);\n f(x, y) = (g(x-1) + g(x+1)) + y;\n\n h.compute_root();\n g.compute_root();\n\n Target target = get_jit_target_from_environment();\n if (target.has_gpu_feature()) {\n f.gpu_tile(x, y, 16, 16);\n g.gpu_tile(x, 128);\n h.gpu_tile(x, 128);\n }\n\n Image<int> out = f.realize(32, 32, target);\n\n for (int y = 0; y < 32; y++) {\n for (int x = 0; x < 32; x++) {\n if (out(x, y) != x*4 + y) {\n printf(\"out(%d, %d) = %d instead of %d\\n\", x, y, out(x, y), x*4+y);\n return -1;\n }\n }\n }\n\n printf(\"Success!\\n\");\n return 0;\n}\n<commit_msg>Added hexagon scheduling directives.<commit_after>#include <stdio.h>\n#include \"Halide.h\"\nusing namespace Halide;\n\nint main(int argc, char **argv) {\n\n Func f, g, h; Var x, y;\n\n h(x) = x;\n g(x) = h(x-1) + h(x+1);\n f(x, y) = (g(x-1) + g(x+1)) + y;\n\n h.compute_root();\n g.compute_root();\n\n Target target = get_jit_target_from_environment();\n if (target.has_gpu_feature()) {\n f.gpu_tile(x, y, 16, 16);\n g.gpu_tile(x, 128);\n h.gpu_tile(x, 128);\n } else if (target.features_any_of({Target::HVX_64, Target::HVX_128})) {\n f.hexagon().vectorize(x, 32);\n g.hexagon().vectorize(x, 32);\n h.hexagon().vectorize(x, 32);\n }\n\n Image<int> out = f.realize(32, 32, target);\n\n for (int y = 0; y < 32; y++) {\n for (int x = 0; x < 32; x++) {\n if (out(x, y) != x*4 + y) {\n printf(\"out(%d, %d) = %d instead of %d\\n\", x, y, out(x, y), x*4+y);\n return -1;\n }\n }\n }\n\n printf(\"Success!\\n\");\n return 0;\n}\n<|endoftext|>"} {"text":"<commit_before>#ifndef DICT_HPP\n#define DICT_HPP\n\n#include <string>\n#include <vector>\n#include <stdexcept>\n#include <tuple>\n#include <cmath>\n#include <functional>\n\n#include <boost\/iterator\/iterator_facade.hpp>\n\n#include \"detail\/prime.hpp\"\n#include \"detail\/key_value.hpp\"\n#include \"detail\/iterator.hpp\"\n\nnamespace boost {\n\n\/\/ container\ntemplate <typename Key, typename Value, typename Hasher = std::hash<Key>,\n typename KeyEqual = std::equal_to<Key>,\n typename Allocator =\n std::allocator<std::tuple<bool, detail::key_value<Key, Value>>>>\nclass dict {\npublic:\n typedef Key key_type;\n typedef Value mapped_type;\n typedef Allocator allocator_type;\n typedef Hasher hasher;\n typedef KeyEqual key_equal;\n\n typedef std::pair<const Key, Value> value_type;\n typedef std::tuple<bool, detail::key_value<Key, Value>> entry_type;\n typedef std::vector<entry_type, allocator_type> table_type;\n typedef typename table_type::size_type size_type;\n typedef typename table_type::difference_type difference_type;\n typedef value_type& reference;\n\n typedef detail::dict_iterator<Key, Value> iterator;\n typedef detail::const_dict_iterator<Key, Value> const_iterator;\n\n dict()\n : _table(initial_size()), _element_count(0),\n _max_element_count(initial_load_factor() * _table.size()) {}\n\n iterator begin() noexcept {\n return { _table.begin(), _table.end() };\n }\n\n const_iterator begin() const noexcept {\n return { _table.begin(), _table.end() };\n }\n\n const_iterator cbegin() const noexcept {\n return { _table.begin(), _table.end() };\n }\n\n iterator end() noexcept {\n return { _table.end(), _table.end() };\n }\n\n const_iterator end() const noexcept {\n return { _table.end(), _table.end() };\n }\n\n const_iterator cend() const noexcept {\n return { _table.end(), _table.end() };\n }\n\n size_type size() const noexcept { return _element_count; }\n\n bool empty() const noexcept { return _element_count == 0; }\n\n \/\/ size_type max_size() const {}\n\n void clear() {\n _table.clear();\n _element_count = 0;\n }\n\n template <typename... Args>\n std::pair<iterator, bool> emplace(Args&&... args) {\n auto entry = make_entry(std::forward<Args>(args)...);\n auto index = find_index(std::get<1>(entry).view.first);\n\n if (std::get<0>(_table[index])) {\n return { { std::next(_table.begin(), index), _table.end() },\n false };\n } else {\n insert_element(index, std::move(entry));\n return { { std::next(_table.begin(), index), _table.end() }, true };\n }\n }\n\n template <typename... Args>\n std::pair<iterator, bool> emplace_hint(const_iterator \/* hint *\/, Args&&... args) {\n return emplace(std::forward<Args>(args)...);\n }\n\n std::pair<iterator, bool> insert(const value_type& obj) {\n auto index = find_index(obj.first);\n\n if (std::get<0>(_table[index])) {\n return { { std::next(_table.begin(), index), _table.end() },\n false };\n } else {\n insert_element(index, make_entry(obj.first, obj.second));\n return { { std::next(_table.begin(), index), _table.end() }, true };\n }\n }\n\n iterator find(const Key& key) {\n auto index = find_index(key);\n\n if (std::get<0>(_table[index])) {\n return { std::next(_table.begin(), index), _table.end() };\n } else {\n return end();\n }\n }\n\n const_iterator find(const Key& key) const {\n auto index = find_index(key);\n\n if (std::get<0>(_table[index])) {\n return { std::next(_table.begin(), index), _table.end() };\n } else {\n return end();\n }\n }\n\n Value& at(const Key& key) {\n auto index = find_index(key);\n\n if(std::get<0>(_table[index])) {\n return std::get<1>(_table[index]).view.second;\n }\n\n throw std::out_of_range(\"Key not in dict\");\n }\n\n const Value& at(const Key& key) const {\n auto index = find_index(key);\n\n if(std::get<0>(_table[index])) {\n return std::get<1>(_table[index]).view.second;\n }\n\n throw std::out_of_range(\"Key not in dict\");\n }\n\n size_type count(const Key& key) const {\n return find(key) == end() ? 0 : 1;\n }\n\n std::pair<iterator, iterator> equal_range(const Key& key) {\n return { find(key), end() };\n }\n\n std::pair<const_iterator, const_iterator> equal_range(const Key& key) const {\n return { find(key), end() };\n }\n\n Value& operator[](const Key& key) {\n auto index = find_index(key);\n\n if (std::get<0>(_table[index])) {\n return std::get<1>(_table[index]).view.second;\n } else {\n return insert_element(index, make_entry(key, Value()));\n }\n }\n\n size_type erase(const Key& key) {\n auto index = find_index(key);\n\n if (!std::get<0>(_table[index])) {\n return 0;\n }\n\n auto delete_index = index;\n\n bool keep = true;\n while (keep) {\n _table[index] = empty_slot_factory();\n\n while (true) {\n delete_index = (delete_index + 1) % _table.size();\n\n if (!std::get<0>(_table[delete_index])) {\n keep = false;\n break;\n }\n\n auto new_key =\n hash_index(std::get<1>(_table[delete_index]).view.first);\n\n if ((index <= delete_index)\n ? ((index < new_key) && (new_key <= delete_index))\n : (new_key <= delete_index)) {\n continue;\n }\n\n _table[index] = std::move(_table[delete_index]);\n index = delete_index;\n }\n }\n\n return 1;\n }\n\n float load_factor() const { return _element_count \/ float(_table.size()); }\n\n float max_load_factor() const {\n return _max_element_count \/ float(_table.size());\n }\n\n void max_load_factor(float new_max_load_factor) {\n _max_element_count = std::ceil(new_max_load_factor * _table.size());\n if (check_rehash()) {\n rehash();\n }\n }\n\n void reserve(std::size_t new_size) {\n if (new_size > _table.size()) {\n auto old_load_factor = max_load_factor();\n\n table_type new_table(\n next_prime(std::ceil(new_size \/ old_load_factor)));\n new_table.swap(_table);\n _max_element_count = old_load_factor * _table.size();\n _element_count = 0;\n\n for (auto&& e : new_table) {\n if (std::get<0>(e)) {\n (*this)[std::get<1>(e).view.first] =\n std::move(std::get<1>(e).view.second);\n }\n }\n }\n }\n\n void rehash() { reserve(2 * _table.size()); }\n\n bool next_is_rehash() const { return size() + 1 >= _max_element_count; }\n\nprivate:\n template <typename Entry>\n Value& insert_element(size_type index, Entry&& new_entry) {\n _table[index] = std::forward<Entry>(new_entry);\n ++_element_count;\n\n if (check_rehash()) {\n rehash();\n index = find_index(std::get<1>(new_entry).view.first);\n }\n\n return std::get<1>(_table[index]).view.second;\n }\n\n size_type find_index(const Key& key) const {\n auto index = hash_index(key);\n\n while (std::get<0>(_table[index])) {\n if (_key_equal(std::get<1>(_table[index]).view.first, key)) {\n return index;\n }\n\n index = (index + 1) % _table.size();\n }\n\n return index;\n }\n\n bool check_rehash() const { return size() >= _max_element_count; }\n\n size_type hash_index(const Key& key) const {\n return _hasher(key) % _table.size();\n }\n\n template <typename... Args>\n entry_type make_entry(Args&&... args) const {\n return std::make_tuple(\n true, detail::key_value<Key, Value>(std::forward<Args>(args)...));\n }\n\n entry_type empty_slot_factory() const {\n return std::make_tuple(false,\n detail::key_value<Key, Value>(Key(), Value()));\n }\n\n size_type initial_size() const { return next_prime(8); }\n\n constexpr float initial_load_factor() const { return 0.7; }\n\n hasher _hasher;\n key_equal _key_equal;\n table_type _table;\n size_type _element_count;\n size_type _max_element_count;\n};\n\n} \/\/ namespace boost\n\n#endif\n<commit_msg>added key_equal and hash_function<commit_after>#ifndef DICT_HPP\n#define DICT_HPP\n\n#include <string>\n#include <vector>\n#include <stdexcept>\n#include <tuple>\n#include <cmath>\n#include <functional>\n\n#include <boost\/iterator\/iterator_facade.hpp>\n\n#include \"detail\/prime.hpp\"\n#include \"detail\/key_value.hpp\"\n#include \"detail\/iterator.hpp\"\n\nnamespace boost {\n\n\/\/ container\ntemplate <typename Key, typename Value, typename Hasher = std::hash<Key>,\n typename KeyEqual = std::equal_to<Key>,\n typename Allocator =\n std::allocator<std::tuple<bool, detail::key_value<Key, Value>>>>\nclass dict {\npublic:\n typedef Key key_type;\n typedef Value mapped_type;\n typedef Allocator allocator_type;\n typedef Hasher hasher;\n typedef KeyEqual key_equal;\n\n typedef std::pair<const Key, Value> value_type;\n typedef std::tuple<bool, detail::key_value<Key, Value>> entry_type;\n typedef std::vector<entry_type, allocator_type> table_type;\n typedef typename table_type::size_type size_type;\n typedef typename table_type::difference_type difference_type;\n typedef value_type& reference;\n\n typedef detail::dict_iterator<Key, Value> iterator;\n typedef detail::const_dict_iterator<Key, Value> const_iterator;\n\n dict()\n : _table(initial_size()), _element_count(0),\n _max_element_count(initial_load_factor() * _table.size()) {}\n\n iterator begin() noexcept {\n return { _table.begin(), _table.end() };\n }\n\n const_iterator begin() const noexcept {\n return { _table.begin(), _table.end() };\n }\n\n const_iterator cbegin() const noexcept {\n return { _table.begin(), _table.end() };\n }\n\n iterator end() noexcept {\n return { _table.end(), _table.end() };\n }\n\n const_iterator end() const noexcept {\n return { _table.end(), _table.end() };\n }\n\n const_iterator cend() const noexcept {\n return { _table.end(), _table.end() };\n }\n\n size_type size() const noexcept { return _element_count; }\n\n bool empty() const noexcept { return _element_count == 0; }\n\n \/\/ size_type max_size() const {}\n\n void clear() {\n _table.clear();\n _element_count = 0;\n }\n\n template <typename... Args>\n std::pair<iterator, bool> emplace(Args&&... args) {\n auto entry = make_entry(std::forward<Args>(args)...);\n auto index = find_index(std::get<1>(entry).view.first);\n\n if (std::get<0>(_table[index])) {\n return { { std::next(_table.begin(), index), _table.end() },\n false };\n } else {\n insert_element(index, std::move(entry));\n return { { std::next(_table.begin(), index), _table.end() }, true };\n }\n }\n\n template <typename... Args>\n std::pair<iterator, bool> emplace_hint(const_iterator \/* hint *\/,\n Args&&... args) {\n return emplace(std::forward<Args>(args)...);\n }\n\n std::pair<iterator, bool> insert(const value_type& obj) {\n auto index = find_index(obj.first);\n\n if (std::get<0>(_table[index])) {\n return { { std::next(_table.begin(), index), _table.end() },\n false };\n } else {\n insert_element(index, make_entry(obj.first, obj.second));\n return { { std::next(_table.begin(), index), _table.end() }, true };\n }\n }\n\n iterator find(const Key& key) {\n auto index = find_index(key);\n\n if (std::get<0>(_table[index])) {\n return { std::next(_table.begin(), index), _table.end() };\n } else {\n return end();\n }\n }\n\n const_iterator find(const Key& key) const {\n auto index = find_index(key);\n\n if (std::get<0>(_table[index])) {\n return { std::next(_table.begin(), index), _table.end() };\n } else {\n return end();\n }\n }\n\n Value& at(const Key& key) {\n auto index = find_index(key);\n\n if (std::get<0>(_table[index])) {\n return std::get<1>(_table[index]).view.second;\n }\n\n throw std::out_of_range(\"Key not in dict\");\n }\n\n const Value& at(const Key& key) const {\n auto index = find_index(key);\n\n if (std::get<0>(_table[index])) {\n return std::get<1>(_table[index]).view.second;\n }\n\n throw std::out_of_range(\"Key not in dict\");\n }\n\n size_type count(const Key& key) const { return find(key) == end() ? 0 : 1; }\n\n std::pair<iterator, iterator> equal_range(const Key& key) {\n return { find(key), end() };\n }\n\n std::pair<const_iterator, const_iterator>\n equal_range(const Key& key) const {\n return { find(key), end() };\n }\n\n Value& operator[](const Key& key) {\n auto index = find_index(key);\n\n if (std::get<0>(_table[index])) {\n return std::get<1>(_table[index]).view.second;\n } else {\n return insert_element(index, make_entry(key, Value()));\n }\n }\n\n size_type erase(const Key& key) {\n auto index = find_index(key);\n\n if (!std::get<0>(_table[index])) {\n return 0;\n }\n\n auto delete_index = index;\n\n bool keep = true;\n while (keep) {\n _table[index] = empty_slot_factory();\n\n while (true) {\n delete_index = (delete_index + 1) % _table.size();\n\n if (!std::get<0>(_table[delete_index])) {\n keep = false;\n break;\n }\n\n auto new_key =\n hash_index(std::get<1>(_table[delete_index]).view.first);\n\n if ((index <= delete_index)\n ? ((index < new_key) && (new_key <= delete_index))\n : (new_key <= delete_index)) {\n continue;\n }\n\n _table[index] = std::move(_table[delete_index]);\n index = delete_index;\n }\n }\n\n return 1;\n }\n\n float load_factor() const { return _element_count \/ float(_table.size()); }\n\n float max_load_factor() const {\n return _max_element_count \/ float(_table.size());\n }\n\n void max_load_factor(float new_max_load_factor) {\n _max_element_count = std::ceil(new_max_load_factor * _table.size());\n if (check_rehash()) {\n rehash();\n }\n }\n\n void reserve(std::size_t new_size) {\n if (new_size > _table.size()) {\n auto old_load_factor = max_load_factor();\n\n table_type new_table(\n next_prime(std::ceil(new_size \/ old_load_factor)));\n new_table.swap(_table);\n _max_element_count = old_load_factor * _table.size();\n _element_count = 0;\n\n for (auto&& e : new_table) {\n if (std::get<0>(e)) {\n (*this)[std::get<1>(e).view.first] =\n std::move(std::get<1>(e).view.second);\n }\n }\n }\n }\n\n void rehash() { reserve(2 * _table.size()); }\n\n bool next_is_rehash() const { return size() + 1 >= _max_element_count; }\n\n hasher hash_function() const { return _hasher; }\n\n key_equal key_eq() const { return _key_equal; }\n\nprivate:\n template <typename Entry>\n Value& insert_element(size_type index, Entry&& new_entry) {\n _table[index] = std::forward<Entry>(new_entry);\n ++_element_count;\n\n if (check_rehash()) {\n rehash();\n index = find_index(std::get<1>(new_entry).view.first);\n }\n\n return std::get<1>(_table[index]).view.second;\n }\n\n size_type find_index(const Key& key) const {\n auto index = hash_index(key);\n\n while (std::get<0>(_table[index])) {\n if (_key_equal(std::get<1>(_table[index]).view.first, key)) {\n return index;\n }\n\n index = (index + 1) % _table.size();\n }\n\n return index;\n }\n\n bool check_rehash() const { return size() >= _max_element_count; }\n\n size_type hash_index(const Key& key) const {\n return _hasher(key) % _table.size();\n }\n\n template <typename... Args>\n entry_type make_entry(Args&&... args) const {\n return std::make_tuple(\n true, detail::key_value<Key, Value>(std::forward<Args>(args)...));\n }\n\n entry_type empty_slot_factory() const {\n return std::make_tuple(false,\n detail::key_value<Key, Value>(Key(), Value()));\n }\n\n size_type initial_size() const { return next_prime(8); }\n\n constexpr float initial_load_factor() const { return 0.7; }\n\n hasher _hasher;\n key_equal _key_equal;\n table_type _table;\n size_type _element_count;\n size_type _max_element_count;\n};\n\n} \/\/ namespace boost\n\n#endif\n<|endoftext|>"} {"text":"<commit_before>\/\/ @(#)root\/core\/meta:$Id$\n\/\/ Author: Vassil Vassilev 7\/10\/2012\n\n\/*************************************************************************\n * Copyright (C) 1995-2012, 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 \"TClingCallbacks.h\"\n\n#include \"cling\/Interpreter\/Interpreter.h\"\n#include \"cling\/Interpreter\/InterpreterCallbacks.h\"\n#include \"cling\/Interpreter\/Transaction.h\"\n#include \"cling\/Utils\/AST.h\"\n\n#include \"clang\/AST\/ASTContext.h\"\n#include \"clang\/AST\/DeclBase.h\"\n#include \"clang\/Lex\/Preprocessor.h\"\n#include \"clang\/Parse\/Parser.h\"\n#include \"clang\/Sema\/Lookup.h\"\n#include \"clang\/Sema\/Scope.h\"\n\nusing namespace clang;\nusing namespace cling;\n\nclass TObject;\n\n\/\/ Functions used to forward calls from code compiled with no-rtti to code \n\/\/ compiled with rtti.\nextern \"C\" {\n void TCintWithCling__UpdateListsOnCommitted(const cling::Transaction&);\n void TCintWithCling__UpdateListsOnUnloaded(const cling::Transaction&); \n TObject* TCintWithCling__GetObjectAddress(const char *Name, void *&LookupCtx);\n Decl* TCintWithCling__GetObjectDecl(TObject *obj);\n int TCintWithCling__AutoLoadCallback(const char* className);\n}\n\nTClingCallbacks::TClingCallbacks(cling::Interpreter* interp) \n : InterpreterCallbacks(interp), fLastLookupCtx(0), fROOTSpecialNamespace(0),\n fFirstRun(true), fIsAutoloading(false), fIsAutoloadingRecursively(false) {\n const Decl* D = 0;\n m_Interpreter->declare(\"namespace __ROOT_SpecialObjects{}\", &D);\n fROOTSpecialNamespace = dyn_cast<NamespaceDecl>(const_cast<Decl*>(D));\n}\n\n\/\/pin the vtable here\nTClingCallbacks::~TClingCallbacks() {}\n\n\/\/ On a failed lookup we have to try to more things before issuing an error.\n\/\/ The symbol might need to be loaded by ROOT's autoloading mechanism or\n\/\/ it might be a ROOT special object. \n\/\/ \n\/\/ Try those first and if still failing issue the diagnostics.\n\/\/\n\/\/ returns true when a declaration is found and no error should be emitted.\n\/\/\nbool TClingCallbacks::LookupObject(LookupResult &R, Scope *S) {\n\n if (tryAutoloadInternal(R, S))\n return true; \/\/ happiness.\n\n \/\/ If the autoload wasn't successful try ROOT specials.\n return tryFindROOTSpecialInternal(R, S);\n}\n\n\/\/ The symbol might be defined in the ROOT class autoloading map so we have to\n\/\/ try to autoload it first and do secondary lookup to try to find it.\n\/\/\n\/\/ returns true when a declaration is found and no error should be emitted.\n\/\/\nbool TClingCallbacks::tryAutoloadInternal(LookupResult &R, Scope *S) {\n Sema &SemaR = m_Interpreter->getSema();\n ASTContext& C = SemaR.getASTContext();\n Preprocessor &PP = SemaR.getPreprocessor();\n DeclarationName Name = R.getLookupName();\n\n \/\/ Try to autoload first if autoloading is enabled\n if (IsAutoloadingEnabled()) {\n \/\/ Avoid tail chasing.\n if (fIsAutoloadingRecursively)\n return false;\n fIsAutoloadingRecursively = true;\n\n \/\/ Save state of the PP\n Preprocessor::CleanupAndRestoreCacheRAII cleanupRAII(PP);\n Parser& P = const_cast<Parser&>(m_Interpreter->getParser());\n Parser::ParserCurTokRestoreRAII savedCurToken(P);\n\n bool oldSuppressDiags = SemaR.getDiagnostics().getSuppressAllDiagnostics();\n SemaR.getDiagnostics().setSuppressAllDiagnostics();\n \n \/\/ We can't PushDeclContext, because we go up and the routine that pops \n \/\/ the DeclContext assumes that we drill down always.\n \/\/ We have to be on the global context. At that point we are in a \n \/\/ wrapper function so the parent context must be the global.\n Sema::ContextAndScopeRAII pushedSAndDC(SemaR, C.getTranslationUnitDecl(), \n SemaR.TUScope);\n\n bool lookupSuccess = false;\n if (TCintWithCling__AutoLoadCallback(Name.getAsString().c_str())) {\n pushedSAndDC.pop();\n cleanupRAII.pop();\n lookupSuccess = SemaR.LookupName(R, S);\n }\n\n SemaR.getDiagnostics().setSuppressAllDiagnostics(oldSuppressDiags);\n\n fIsAutoloadingRecursively = false;\n \n if (lookupSuccess)\n return true;\n }\n\n return false;\n}\n\n\/\/ If cling cannot find a name it should ask ROOT before it issues an error.\n\/\/ If ROOT knows the name then it has to create a new variable with that name\n\/\/ and type in dedicated for that namespace (eg. __ROOT_SpecialObjects).\n\/\/ For example if the interpreter is looking for h in h-Draw(), this routine\n\/\/ will create\n\/\/ namespace __ROOT_SpecialObjects {\n\/\/ THist* h = (THist*) the_address;\n\/\/ }\n\/\/\n\/\/ Later if h is called again it again won't be found by the standart lookup\n\/\/ because it is in our hidden namespace (nobody should do using namespace \n\/\/ __ROOT_SpecialObjects). It caches the variable declarations and their\n\/\/ last address. If the newly found decl with the same name (h) has different\n\/\/ address than the cached one it goes directly at the address and updates it.\n\/\/\n\/\/ returns true when declaration is found and no error should be emitted.\n\/\/\nbool TClingCallbacks::tryFindROOTSpecialInternal(LookupResult &R, Scope *S) {\n\n Sema &SemaR = m_Interpreter->getSema();\n ASTContext& C = SemaR.getASTContext();\n Preprocessor &PP = SemaR.getPreprocessor();\n DeclContext *CurDC = SemaR.CurContext;\n DeclarationName Name = R.getLookupName();\n\n \/\/ Make sure that the failed lookup comes from the prompt.\n if(!CurDC || !CurDC->isFunctionOrMethod())\n return false;\n if (NamedDecl* ND = dyn_cast<NamedDecl>(CurDC))\n if (!m_Interpreter->isUniqueWrapper(ND->getNameAsString()))\n return false;\n\n TObject *obj = TCintWithCling__GetObjectAddress(Name.getAsString().c_str(), \n fLastLookupCtx);\n if (obj) {\n VarDecl *VD = cast_or_null<VarDecl>(utils::Lookup::Named(&SemaR, \n Name, \n fROOTSpecialNamespace));\n if (VD) {\n \/\/TODO: Check for same types.\n\n TObject **address = (TObject**)m_Interpreter->getAddressOfGlobal(VD);\n \/\/ Since code was generated already we cannot rely on the initializer \n \/\/ of the decl in the AST, however we will update that init so that it\n \/\/ will be easier while debugging.\n CStyleCastExpr *CStyleCast = cast<CStyleCastExpr>(VD->getInit());\n Expr* newInit = utils::Synthesize::IntegerLiteralExpr(C, (uint64_t)obj);\n CStyleCast->setSubExpr(newInit);\n\n \/\/ The actual update happens here, directly in memory.\n *address = obj;\n }\n else {\n \/\/ Save state of the PP\n Preprocessor::CleanupAndRestoreCacheRAII cleanupRAII(PP);\n\n const Decl *TD = TCintWithCling__GetObjectDecl(obj);\n \/\/ We will declare the variable as pointer.\n QualType QT = C.getPointerType(C.getTypeDeclType(cast<TypeDecl>(TD)));\n \n VD = VarDecl::Create(C, fROOTSpecialNamespace, SourceLocation(), \n SourceLocation(), Name.getAsIdentifierInfo(), QT,\n \/*TypeSourceInfo*\/0, SC_None, SC_None\n );\n \/\/ Build an initializer\n Expr* Init \n = utils::Synthesize::CStyleCastPtrExpr(&SemaR, QT, (uint64_t)obj);\n \/\/ Register the decl in our hidden special namespace\n VD->setInit(Init);\n fROOTSpecialNamespace->addDecl(VD);\n\n cling::CompilationOptions CO;\n CO.DeclarationExtraction = 0;\n CO.ValuePrinting = CompilationOptions::VPDisabled;\n CO.ResultEvaluation = 0;\n CO.DynamicScoping = 0;\n CO.Debug = 0;\n CO.CodeGeneration = 1;\n\n cling::Transaction T(CO, \/*llvm::Module=*\/0);\n T.appendUnique(VD);\n T.setCompleted();\n\n Interpreter::CompilationResult Result = m_Interpreter->codegen(&T);\n assert(Result == Interpreter::kSuccess \n && \"Compilation should never fail!\");\n }\n assert(VD && \"Cannot be null!\");\n R.addDecl(VD);\n return true;\n }\n\n return false;\n}\n\/\/ The callback is used to update the list of globals in ROOT.\n\/\/\nvoid TClingCallbacks::TransactionCommitted(const Transaction &T) {\n if (!T.size())\n return;\n if (fFirstRun) {\n \/\/ Before setting up the callbacks register what cling have seen during init.\n const cling::Transaction* T = m_Interpreter->getFirstTransaction();\n while (T) {\n if (T->getState() == cling::Transaction::kCommitted)\n TCintWithCling__UpdateListsOnCommitted(*T);\n T = T->getNext();\n }\n\n fFirstRun = false;\n }\n\n TCintWithCling__UpdateListsOnCommitted(T);\n}\n\n\/\/ The callback is used to update the list of globals in ROOT.\n\/\/\nvoid TClingCallbacks::TransactionUnloaded(const Transaction &T) {\n if (!T.size())\n return;\n\n TCintWithCling__UpdateListsOnUnloaded(T);\n}\n<commit_msg>After we cache the cur token, replace it with a \"neutral\"one. Fix warning.<commit_after>\/\/ @(#)root\/core\/meta:$Id$\n\/\/ Author: Vassil Vassilev 7\/10\/2012\n\n\/*************************************************************************\n * Copyright (C) 1995-2012, 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 \"TClingCallbacks.h\"\n\n#include \"cling\/Interpreter\/Interpreter.h\"\n#include \"cling\/Interpreter\/InterpreterCallbacks.h\"\n#include \"cling\/Interpreter\/Transaction.h\"\n#include \"cling\/Utils\/AST.h\"\n\n#include \"clang\/AST\/ASTContext.h\"\n#include \"clang\/AST\/DeclBase.h\"\n#include \"clang\/Lex\/Preprocessor.h\"\n#include \"clang\/Parse\/Parser.h\"\n#include \"clang\/Sema\/Lookup.h\"\n#include \"clang\/Sema\/Scope.h\"\n\nusing namespace clang;\nusing namespace cling;\n\nclass TObject;\n\n\/\/ Functions used to forward calls from code compiled with no-rtti to code \n\/\/ compiled with rtti.\nextern \"C\" {\n void TCintWithCling__UpdateListsOnCommitted(const cling::Transaction&);\n void TCintWithCling__UpdateListsOnUnloaded(const cling::Transaction&); \n TObject* TCintWithCling__GetObjectAddress(const char *Name, void *&LookupCtx);\n Decl* TCintWithCling__GetObjectDecl(TObject *obj);\n int TCintWithCling__AutoLoadCallback(const char* className);\n}\n\nTClingCallbacks::TClingCallbacks(cling::Interpreter* interp) \n : InterpreterCallbacks(interp), fLastLookupCtx(0), fROOTSpecialNamespace(0),\n fFirstRun(true), fIsAutoloading(false), fIsAutoloadingRecursively(false) {\n const Decl* D = 0;\n m_Interpreter->declare(\"namespace __ROOT_SpecialObjects{}\", &D);\n fROOTSpecialNamespace = dyn_cast<NamespaceDecl>(const_cast<Decl*>(D));\n}\n\n\/\/pin the vtable here\nTClingCallbacks::~TClingCallbacks() {}\n\n\/\/ On a failed lookup we have to try to more things before issuing an error.\n\/\/ The symbol might need to be loaded by ROOT's autoloading mechanism or\n\/\/ it might be a ROOT special object. \n\/\/ \n\/\/ Try those first and if still failing issue the diagnostics.\n\/\/\n\/\/ returns true when a declaration is found and no error should be emitted.\n\/\/\nbool TClingCallbacks::LookupObject(LookupResult &R, Scope *S) {\n\n if (tryAutoloadInternal(R, S))\n return true; \/\/ happiness.\n\n \/\/ If the autoload wasn't successful try ROOT specials.\n return tryFindROOTSpecialInternal(R, S);\n}\n\n\/\/ The symbol might be defined in the ROOT class autoloading map so we have to\n\/\/ try to autoload it first and do secondary lookup to try to find it.\n\/\/\n\/\/ returns true when a declaration is found and no error should be emitted.\n\/\/\nbool TClingCallbacks::tryAutoloadInternal(LookupResult &R, Scope *S) {\n Sema &SemaR = m_Interpreter->getSema();\n ASTContext& C = SemaR.getASTContext();\n Preprocessor &PP = SemaR.getPreprocessor();\n DeclarationName Name = R.getLookupName();\n\n \/\/ Try to autoload first if autoloading is enabled\n if (IsAutoloadingEnabled()) {\n \/\/ Avoid tail chasing.\n if (fIsAutoloadingRecursively)\n return false;\n fIsAutoloadingRecursively = true;\n\n \/\/ Save state of the PP\n Preprocessor::CleanupAndRestoreCacheRAII cleanupRAII(PP);\n Parser& P = const_cast<Parser&>(m_Interpreter->getParser());\n Parser::ParserCurTokRestoreRAII savedCurToken(P);\n \/\/ After we have saved the token reset the current one to something which \n \/\/ is safe (semi colon usually means empty decl)\n Token& Tok = const_cast<Token&>(P.getCurToken());\n Tok.setKind(tok::semi);\n\n bool oldSuppressDiags = SemaR.getDiagnostics().getSuppressAllDiagnostics();\n SemaR.getDiagnostics().setSuppressAllDiagnostics();\n \n \/\/ We can't PushDeclContext, because we go up and the routine that pops \n \/\/ the DeclContext assumes that we drill down always.\n \/\/ We have to be on the global context. At that point we are in a \n \/\/ wrapper function so the parent context must be the global.\n Sema::ContextAndScopeRAII pushedSAndDC(SemaR, C.getTranslationUnitDecl(), \n SemaR.TUScope);\n\n bool lookupSuccess = false;\n if (TCintWithCling__AutoLoadCallback(Name.getAsString().c_str())) {\n pushedSAndDC.pop();\n cleanupRAII.pop();\n lookupSuccess = SemaR.LookupName(R, S);\n }\n\n SemaR.getDiagnostics().setSuppressAllDiagnostics(oldSuppressDiags);\n\n fIsAutoloadingRecursively = false;\n \n if (lookupSuccess)\n return true;\n }\n\n return false;\n}\n\n\/\/ If cling cannot find a name it should ask ROOT before it issues an error.\n\/\/ If ROOT knows the name then it has to create a new variable with that name\n\/\/ and type in dedicated for that namespace (eg. __ROOT_SpecialObjects).\n\/\/ For example if the interpreter is looking for h in h-Draw(), this routine\n\/\/ will create\n\/\/ namespace __ROOT_SpecialObjects {\n\/\/ THist* h = (THist*) the_address;\n\/\/ }\n\/\/\n\/\/ Later if h is called again it again won't be found by the standart lookup\n\/\/ because it is in our hidden namespace (nobody should do using namespace \n\/\/ __ROOT_SpecialObjects). It caches the variable declarations and their\n\/\/ last address. If the newly found decl with the same name (h) has different\n\/\/ address than the cached one it goes directly at the address and updates it.\n\/\/\n\/\/ returns true when declaration is found and no error should be emitted.\n\/\/\nbool TClingCallbacks::tryFindROOTSpecialInternal(LookupResult &R, Scope *S) {\n\n Sema &SemaR = m_Interpreter->getSema();\n ASTContext& C = SemaR.getASTContext();\n Preprocessor &PP = SemaR.getPreprocessor();\n DeclContext *CurDC = SemaR.CurContext;\n DeclarationName Name = R.getLookupName();\n\n \/\/ Make sure that the failed lookup comes from the prompt.\n if(!CurDC || !CurDC->isFunctionOrMethod())\n return false;\n if (NamedDecl* ND = dyn_cast<NamedDecl>(CurDC))\n if (!m_Interpreter->isUniqueWrapper(ND->getNameAsString()))\n return false;\n\n TObject *obj = TCintWithCling__GetObjectAddress(Name.getAsString().c_str(), \n fLastLookupCtx);\n if (obj) {\n VarDecl *VD = cast_or_null<VarDecl>(utils::Lookup::Named(&SemaR, \n Name, \n fROOTSpecialNamespace));\n if (VD) {\n \/\/TODO: Check for same types.\n\n TObject **address = (TObject**)m_Interpreter->getAddressOfGlobal(VD);\n \/\/ Since code was generated already we cannot rely on the initializer \n \/\/ of the decl in the AST, however we will update that init so that it\n \/\/ will be easier while debugging.\n CStyleCastExpr *CStyleCast = cast<CStyleCastExpr>(VD->getInit());\n Expr* newInit = utils::Synthesize::IntegerLiteralExpr(C, (uint64_t)obj);\n CStyleCast->setSubExpr(newInit);\n\n \/\/ The actual update happens here, directly in memory.\n *address = obj;\n }\n else {\n \/\/ Save state of the PP\n Preprocessor::CleanupAndRestoreCacheRAII cleanupRAII(PP);\n\n const Decl *TD = TCintWithCling__GetObjectDecl(obj);\n \/\/ We will declare the variable as pointer.\n QualType QT = C.getPointerType(C.getTypeDeclType(cast<TypeDecl>(TD)));\n \n VD = VarDecl::Create(C, fROOTSpecialNamespace, SourceLocation(), \n SourceLocation(), Name.getAsIdentifierInfo(), QT,\n \/*TypeSourceInfo*\/0, SC_None, SC_None\n );\n \/\/ Build an initializer\n Expr* Init \n = utils::Synthesize::CStyleCastPtrExpr(&SemaR, QT, (uint64_t)obj);\n \/\/ Register the decl in our hidden special namespace\n VD->setInit(Init);\n fROOTSpecialNamespace->addDecl(VD);\n\n cling::CompilationOptions CO;\n CO.DeclarationExtraction = 0;\n CO.ValuePrinting = CompilationOptions::VPDisabled;\n CO.ResultEvaluation = 0;\n CO.DynamicScoping = 0;\n CO.Debug = 0;\n CO.CodeGeneration = 1;\n\n cling::Transaction T(CO, \/*llvm::Module=*\/0);\n T.appendUnique(VD);\n T.setCompleted();\n\n m_Interpreter->codegen(&T);\n assert(T.getState() == Transaction::kCommitted\n && \"Compilation should never fail!\");\n }\n assert(VD && \"Cannot be null!\");\n R.addDecl(VD);\n return true;\n }\n\n return false;\n}\n\/\/ The callback is used to update the list of globals in ROOT.\n\/\/\nvoid TClingCallbacks::TransactionCommitted(const Transaction &T) {\n if (!T.size())\n return;\n if (fFirstRun) {\n \/\/ Before setting up the callbacks register what cling have seen during init.\n const cling::Transaction* T = m_Interpreter->getFirstTransaction();\n while (T) {\n if (T->getState() == cling::Transaction::kCommitted)\n TCintWithCling__UpdateListsOnCommitted(*T);\n T = T->getNext();\n }\n\n fFirstRun = false;\n }\n\n TCintWithCling__UpdateListsOnCommitted(T);\n}\n\n\/\/ The callback is used to update the list of globals in ROOT.\n\/\/\nvoid TClingCallbacks::TransactionUnloaded(const Transaction &T) {\n if (!T.size())\n return;\n\n TCintWithCling__UpdateListsOnUnloaded(T);\n}\n<|endoftext|>"} {"text":"<commit_before>\/*\n * Copyright (c) 2011, Willow Garage, Inc.\n * All rights reserved.\n *\n * Redistribution and use in source and binary forms, with or without\n * modification, are permitted provided that the following conditions are met:\n *\n * * Redistributions of source code must retain the above copyright\n * notice, this list of conditions and the following disclaimer.\n * * Redistributions in binary form must reproduce the above copyright\n * notice, this list of conditions and the following disclaimer in the\n * documentation and\/or other materials provided with the distribution.\n * * Neither the name of the Willow Garage, Inc. nor the names of its\n * contributors may be used to endorse or promote products derived from\n * this software without specific prior written permission.\n *\n * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS \"AS IS\"\n * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE\n * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE\n * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE\n * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR\n * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF\n * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS\n * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN\n * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)\n * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE\n * POSSIBILITY OF SUCH DAMAGE.\n *\/\n#pragma once\n\n#include <boost\/shared_ptr.hpp>\n#include <boost\/noncopyable.hpp>\n#include <boost\/function.hpp>\n#include <boost\/bind.hpp>\n#include <boost\/optional.hpp>\n#include <boost\/typeof\/std\/utility.hpp>\n\n#include <ecto\/tendril.hpp>\n#include <ecto\/tendrils.hpp>\n#include <ecto\/strand.hpp>\n#include <ecto\/util.hpp>\n#include <ecto\/profile.hpp>\n#include <ecto\/is_threadsafe.hpp>\n\n#include <map>\n\nnamespace ecto\n{\n\n \/**\n * \\brief Return values for modules' process functions. These\n * are appropriate for non exceptional behavior.\n *\/\n enum ReturnCode\n {\n OK = 0, \/\/!< Everything A OK.\n QUIT = 1,\n \/\/!< Explicit quit now.\n };\n\n \/**\n * \\brief ecto::cell is the non virtual interface to the basic building\n * block of ecto graphs. This interface should never be the parent of\n * client cell, but may be used for polymorphic access to client cells.\n *\n * Clients should expose their code to this interface through\n * ecto::wrap, or ecto::create_cell<T>().\n *\n * For a client's cell to satisfy the ecto::cell idium, it must\n * look similar to the following definition.\n * @code\n struct MyEctoCell\n {\n \/\/called first thing, the user should declare their parameters in this\n \/\/free standing function.\n static void declare_params(tendrils& params);\n \/\/declare inputs and outputs here. The parameters may be used to\n \/\/determine the io\n static void declare_io(const tendrils& params, tendrils& in, tendrils& out);\n \/\/called right after allocation of the cell, exactly once.\n void configure(tendrils& params, tendrils& inputs, tendrils& outputs);\n \/\/called at every execution of the graph\n int process(const tendrils& in, tendrils& out);\n \/\/called right before the destructor of the cell, a good place to do\n \/\/critical cleanup work.\n void destroy();\n };\n * @endcode\n *\n * It is important to note that all functions have are optional and they all have\n * default implementations.\n *\/\n struct ECTO_EXPORT cell: boost::noncopyable\n {\n typedef boost::shared_ptr<cell> ptr; \/\/!< A convenience pointer typedef\n\n cell();\n virtual ~cell();\n\n \/**\n * \\brief Dispatches parameter declaration code. After this code, the parameters\n * for the cell will be set to their defaults.\n *\/\n void declare_params();\n \/**\n * \\brief Dispatches input\/output declaration code. It is assumed that the parameters\n * have been declared before this is called, so that inputs and outputs may be dependent\n * on those parameters.\n *\/\n void declare_io();\n\n \/**\n * \\brief Given initialized parameters,inputs, and outputs, this will dispatch the client\n * configuration code. This will allocated an instace of the clients cell, so this\n * should not be called during introspection.\n *\/\n void configure();\n\n \/**\n * \\brief Dispatches the process function for the client cell. This should only\n * be called from one thread at a time.\n *\n * Also, this function may throw exceptions...\n *\n * @return A return code, ecto::OK , or 0 means all is ok. Anything non zero should be considered an\n * exit signal.\n *\/\n ReturnCode process();\n\n \/**\n * \\brief This should be called at the end of life for the cell, and signals imminent destruction.\n *\n * Will dispatch the client's destroy code. After this call, do not call any other functions.\n *\/\n void destroy();\n\n \/**\n * \\brief Return the type of the child class.\n * @return A human readable non mangled name for the client class.\n *\/\n std::string type() const;\n\n \/**\n * \\brief Grab the name of the instance.\n * @return The name of the instance, or the address if none was given when object was constructed\n *\/\n std::string name() const;\n\n \/**\n * \\brief Set the name of the instance.\n *\/\n void name(const std::string&);\n\n \/**\n * \\brief Set the short_doc_ of the instance.\n *\/\n std::string short_doc() const;\n\n \/**\n * \\brief Set the short_doc_ of the instance.\n *\/\n void short_doc(const std::string&);\n\n \/**\n * \\brief Generate an Restructured Text doc string for the cell. Includes documentation for all parameters,\n * inputs, outputs.\n * @param doc The highest level documentation for the cell.\n * @return A nicely formatted doc string.\n *\/\n std::string gen_doc(const std::string& doc = \"A module...\") const;\n\n void verify_params() const;\n void verify_inputs() const;\n\n ptr clone() const;\n\n tendrils parameters; \/\/!< Parameters\n tendrils inputs; \/\/!< Inputs, inboxes, always have a valid value ( may be NULL )\n tendrils outputs; \/\/!< Outputs, outboxes, always have a valid value ( may be NULL )\n boost::optional<strand> strand_;\n profile::stats_type stats;\n\n protected:\n\n virtual void init() = 0;\n virtual void dispatch_declare_params(tendrils& t) = 0;\n virtual void dispatch_declare_io(const tendrils& params, tendrils& inputs,\n tendrils& outputs) = 0;\n virtual void dispatch_configure(tendrils& params, tendrils& inputs,\n tendrils& outputs) = 0;\n virtual ReturnCode\n dispatch_process(tendrils& inputs, tendrils& outputs) = 0;\n virtual void dispatch_destroy() = 0;\n virtual std::string dispatch_name() const = 0;\n virtual ptr dispatch_make() const\n {\n return ptr();\n }\n\n virtual std::string dispatch_short_doc() const\n {\n return \"\";\n }\n\n virtual void dispatch_short_doc(const std::string&)\n {\n }\n private:\n std::string instance_name_;\n };\n\n \n \/**\n * \\brief Helper class for determining if client modules have function\n * implementations or not.\n * @internal\n *\/\n template<class T>\n struct has_f\n {\n typedef char yes;\n typedef char (&no)[2];\n \n \/\/ SFINAE eliminates this when the type of arg is invalid\n template<class U>\n static yes test_declare_params(BOOST_TYPEOF_TPL(&U::declare_params));\n \/\/ overload resolution prefers anything at all over \"...\"\n template<class U>\n static no test_declare_params(...);\n\n template<class U>\n static yes test_declare_io(BOOST_TYPEOF_TPL(&U::declare_io));\n template<class U>\n static no test_declare_io(...);\n\n template<class U>\n static yes test_configure(BOOST_TYPEOF_TPL(&U::configure));\n template<class U>\n static no test_configure(...);\n\n template<class U>\n static yes test_process(BOOST_TYPEOF_TPL(&U::process));\n template<class U>\n static no test_process(...);\n\n template<class U>\n static yes test_destroy(BOOST_TYPEOF_TPL(&U::destroy));\n template<class U>\n static no test_destroy(...);\n\n enum\n {\n declare_params = sizeof(test_declare_params<T> (0)) == sizeof(yes)\n };\n enum\n {\n declare_io = sizeof(test_declare_io<T> (0)) == sizeof(yes)\n };\n enum\n {\n configure = sizeof(test_configure<T> (0)) == sizeof(yes)\n };\n enum\n {\n process = sizeof(test_process<T> (0)) == sizeof(yes)\n };\n enum\n {\n destroy = sizeof(test_destroy<T> (0)) == sizeof(yes)\n };\n\n };\n\n \/**\n * \\brief cell_<T> is for registering an arbitrary class\n * with the the cell NVI. This adds a barrier between client code and the cell.\n *\/\n template<class Impl>\n struct cell_: cell\n {\n typedef boost::shared_ptr<cell_<Impl> > ptr;\n\n typedef typename detail::python_mutex<Impl>::type gil_mtx_t;\n\n ~cell_()\n {\n dispatch_destroy();\n }\n protected:\n template<int I>\n struct int_\n {\n };\n typedef int_<0> not_implemented;\n typedef int_<1> implemented;\n\n static void declare_params(not_implemented, tendrils& params)\n {\n }\n\n static void declare_params(implemented, tendrils& params)\n {\n Impl::declare_params(params);\n }\n\n void dispatch_declare_params(tendrils& params)\n {\n \/\/this is a none static function. for virtuality.\n declare_params(int_<has_f<Impl>::declare_params> (), params);\n }\n\n static void declare_io(not_implemented, const tendrils& params,\n tendrils& inputs, tendrils& outputs)\n {\n }\n static void declare_io(implemented, const tendrils& params,\n tendrils& inputs, tendrils& outputs)\n {\n Impl::declare_io(params, inputs, outputs);\n }\n\n void dispatch_declare_io(const tendrils& params, tendrils& inputs,\n tendrils& outputs)\n {\n declare_io(int_<has_f<Impl>::declare_io> (), params, inputs, outputs);\n }\n\n void configure(not_implemented, tendrils&, tendrils& , tendrils&)\n {\n }\n\n void configure(implemented, tendrils& params, tendrils& inputs,\n tendrils& outputs)\n {\n boost::this_thread::interruption_point();\n gil_mtx_t gillock();\n impl->configure(params,inputs,outputs);\n }\n\n void dispatch_configure(tendrils& params, tendrils& inputs,\n tendrils& outputs)\n {\n \/\/the cell may not be allocated here, so check pointer.\n if (!impl)\n {\n try\n {\n impl.reset(new Impl);\n }\n catch (std::exception& e)\n {\n except::EctoException ee(\"Original Exception: \" +name_of(typeid(e)));\n ee << \" What : \" + std::string(e.what());\n ee << \" Module : \" + name() + \"\\n in constructor of: \" + name_of<Impl>();\n boost::throw_exception(ee); \\\n }\n catch (...)\n {\n except::EctoException ee(\"Threw unknown exception type!\");\n ee << \" Module : \" + name() + \"\\n in constructor of: \" + name_of<Impl>();\n boost::throw_exception(ee);\n }\n \/\/configure is only called once.\n configure(int_<has_f<Impl>::configure> (), params,inputs,outputs);\n }\n }\n\n ReturnCode process(not_implemented, const tendrils& ,\n const tendrils& )\n {\n return OK;\n }\n\n ReturnCode process(implemented, tendrils& inputs, tendrils& outputs)\n {\n gil_mtx_t gillock;\n ReturnCode code;\n profile::stats_collector coll(stats);\n code = ReturnCode(impl->process(inputs, outputs));\n return code;\n }\n\n ReturnCode dispatch_process(tendrils& inputs, tendrils& outputs)\n {\n dispatch_configure(parameters,this->inputs,outputs);\n boost::this_thread::interruption_point();\n return process(int_<has_f<Impl>::process> (), inputs, outputs);\n }\n\n void destroy(not_implemented)\n {\n }\n\n void destroy(implemented)\n {\n \/\/destroy only called once, then destructor.\n if(impl)\n impl->destroy();\n }\n\n void dispatch_destroy()\n {\n destroy(int_<has_f<Impl>::destroy> ());\n impl.reset();\n }\n\n std::string dispatch_name() const\n {\n return CELL_TYPE_NAME;\n }\n std::string dispatch_short_doc() const\n {\n return SHORT_DOC;\n }\n\n void dispatch_short_doc(const std::string&)\n {\n }\n\n cell::ptr dispatch_make() const\n {\n cell::ptr m(new cell_<Impl> ());\n m->declare_params();\n \/\/copy all of the parameters by value.\n tendrils::iterator it = m->parameters.begin();\n tendrils::const_iterator end = m->parameters.end(), oit =\n parameters.begin();\n while (it != end)\n {\n it->second << *oit->second;\n ++oit;\n ++it;\n }\n m->declare_io();\n return m;\n }\n void init()\n {\n if(!impl)\n {\n cell::configure();\n }\n }\n\n static const std::string CELL_TYPE_NAME;\n public:\n boost::shared_ptr<Impl> impl;\n static std::string SHORT_DOC;\n };\n\n template<typename Impl>\n std::string cell_<Impl>::SHORT_DOC;\n\n template<typename Impl>\n const std::string cell_<Impl>::CELL_TYPE_NAME = ecto::name_of<Impl>();\n\n \/**\n * Creates a cell from type T that has not been configured, so therefore,\n * not allocated. This only calls the static functions associated with parameter and\n * input\/output declaration.\n *\n * @return A cell::ptr that is initialized as far as default params,inputs,outputs go.\n *\/\n template<typename Impl>\n typename cell_<Impl>::ptr inspect_cell()\n {\n typename cell_<Impl>::ptr p(new cell_<Impl> ());\n cell::ptr base(p);\n base->declare_params();\n base->declare_io();\n return p;\n }\n\n \/**\n * Create a cell from an type that has all of the proper interface functions defined.\n * This will call configure in the cell.\n * @return A cell ptr.\n *\/\n template<typename Impl>\n typename cell_<Impl>::ptr create_cell()\n {\n typename cell_<Impl>::ptr p = inspect_cell<Impl>();\n return p;\n }\n\n}\/\/namespace ecto\n<commit_msg>rm gil lock, verify that python objects aren't passed as in\/outputs<commit_after>\/*\n * Copyright (c) 2011, Willow Garage, Inc.\n * All rights reserved.\n *\n * Redistribution and use in source and binary forms, with or without\n * modification, are permitted provided that the following conditions are met:\n *\n * * Redistributions of source code must retain the above copyright\n * notice, this list of conditions and the following disclaimer.\n * * Redistributions in binary form must reproduce the above copyright\n * notice, this list of conditions and the following disclaimer in the\n * documentation and\/or other materials provided with the distribution.\n * * Neither the name of the Willow Garage, Inc. nor the names of its\n * contributors may be used to endorse or promote products derived from\n * this software without specific prior written permission.\n *\n * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS \"AS IS\"\n * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE\n * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE\n * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE\n * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR\n * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF\n * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS\n * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN\n * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)\n * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE\n * POSSIBILITY OF SUCH DAMAGE.\n *\/\n#pragma once\n\n#include <boost\/shared_ptr.hpp>\n#include <boost\/noncopyable.hpp>\n#include <boost\/function.hpp>\n#include <boost\/bind.hpp>\n#include <boost\/optional.hpp>\n#include <boost\/typeof\/std\/utility.hpp>\n\n#include <ecto\/tendril.hpp>\n#include <ecto\/tendrils.hpp>\n#include <ecto\/strand.hpp>\n#include <ecto\/util.hpp>\n#include <ecto\/profile.hpp>\n#include <ecto\/is_threadsafe.hpp>\n\n#include <map>\n\nnamespace ecto\n{\n\n \/**\n * \\brief Return values for modules' process functions. These\n * are appropriate for non exceptional behavior.\n *\/\n enum ReturnCode\n {\n OK = 0, \/\/!< Everything A OK.\n QUIT = 1,\n \/\/!< Explicit quit now.\n };\n\n \/**\n * \\brief ecto::cell is the non virtual interface to the basic building\n * block of ecto graphs. This interface should never be the parent of\n * client cell, but may be used for polymorphic access to client cells.\n *\n * Clients should expose their code to this interface through\n * ecto::wrap, or ecto::create_cell<T>().\n *\n * For a client's cell to satisfy the ecto::cell idium, it must\n * look similar to the following definition.\n * @code\n struct MyEctoCell\n {\n \/\/called first thing, the user should declare their parameters in this\n \/\/free standing function.\n static void declare_params(tendrils& params);\n \/\/declare inputs and outputs here. The parameters may be used to\n \/\/determine the io\n static void declare_io(const tendrils& params, tendrils& in, tendrils& out);\n \/\/called right after allocation of the cell, exactly once.\n void configure(tendrils& params, tendrils& inputs, tendrils& outputs);\n \/\/called at every execution of the graph\n int process(const tendrils& in, tendrils& out);\n \/\/called right before the destructor of the cell, a good place to do\n \/\/critical cleanup work.\n void destroy();\n };\n * @endcode\n *\n * It is important to note that all functions have are optional and they all have\n * default implementations.\n *\/\n struct ECTO_EXPORT cell: boost::noncopyable\n {\n typedef boost::shared_ptr<cell> ptr; \/\/!< A convenience pointer typedef\n\n cell();\n virtual ~cell();\n\n \/**\n * \\brief Dispatches parameter declaration code. After this code, the parameters\n * for the cell will be set to their defaults.\n *\/\n void declare_params();\n \/**\n * \\brief Dispatches input\/output declaration code. It is assumed that the parameters\n * have been declared before this is called, so that inputs and outputs may be dependent\n * on those parameters.\n *\/\n void declare_io();\n\n \/**\n * \\brief Given initialized parameters,inputs, and outputs, this will dispatch the client\n * configuration code. This will allocated an instace of the clients cell, so this\n * should not be called during introspection.\n *\/\n void configure();\n\n \/**\n * \\brief Dispatches the process function for the client cell. This should only\n * be called from one thread at a time.\n *\n * Also, this function may throw exceptions...\n *\n * @return A return code, ecto::OK , or 0 means all is ok. Anything non zero should be considered an\n * exit signal.\n *\/\n ReturnCode process();\n\n \/**\n * \\brief This should be called at the end of life for the cell, and signals imminent destruction.\n *\n * Will dispatch the client's destroy code. After this call, do not call any other functions.\n *\/\n void destroy();\n\n \/**\n * \\brief Return the type of the child class.\n * @return A human readable non mangled name for the client class.\n *\/\n std::string type() const;\n\n \/**\n * \\brief Grab the name of the instance.\n * @return The name of the instance, or the address if none was given when object was constructed\n *\/\n std::string name() const;\n\n \/**\n * \\brief Set the name of the instance.\n *\/\n void name(const std::string&);\n\n \/**\n * \\brief Set the short_doc_ of the instance.\n *\/\n std::string short_doc() const;\n\n \/**\n * \\brief Set the short_doc_ of the instance.\n *\/\n void short_doc(const std::string&);\n\n \/**\n * \\brief Generate an Restructured Text doc string for the cell. Includes documentation for all parameters,\n * inputs, outputs.\n * @param doc The highest level documentation for the cell.\n * @return A nicely formatted doc string.\n *\/\n std::string gen_doc(const std::string& doc = \"A module...\") const;\n\n void verify_params() const;\n void verify_inputs() const;\n\n ptr clone() const;\n\n tendrils parameters; \/\/!< Parameters\n tendrils inputs; \/\/!< Inputs, inboxes, always have a valid value ( may be NULL )\n tendrils outputs; \/\/!< Outputs, outboxes, always have a valid value ( may be NULL )\n boost::optional<strand> strand_;\n profile::stats_type stats;\n\n protected:\n\n virtual void init() = 0;\n virtual void dispatch_declare_params(tendrils& t) = 0;\n virtual void dispatch_declare_io(const tendrils& params, tendrils& inputs,\n tendrils& outputs) = 0;\n virtual void dispatch_configure(tendrils& params, tendrils& inputs,\n tendrils& outputs) = 0;\n virtual ReturnCode\n dispatch_process(tendrils& inputs, tendrils& outputs) = 0;\n virtual void dispatch_destroy() = 0;\n virtual std::string dispatch_name() const = 0;\n virtual ptr dispatch_make() const\n {\n return ptr();\n }\n\n virtual std::string dispatch_short_doc() const\n {\n return \"\";\n }\n\n virtual void dispatch_short_doc(const std::string&)\n {\n }\n private:\n std::string instance_name_;\n };\n\n \n \/**\n * \\brief Helper class for determining if client modules have function\n * implementations or not.\n * @internal\n *\/\n template<class T>\n struct has_f\n {\n typedef char yes;\n typedef char (&no)[2];\n \n \/\/ SFINAE eliminates this when the type of arg is invalid\n template<class U>\n static yes test_declare_params(BOOST_TYPEOF_TPL(&U::declare_params));\n \/\/ overload resolution prefers anything at all over \"...\"\n template<class U>\n static no test_declare_params(...);\n\n template<class U>\n static yes test_declare_io(BOOST_TYPEOF_TPL(&U::declare_io));\n template<class U>\n static no test_declare_io(...);\n\n template<class U>\n static yes test_configure(BOOST_TYPEOF_TPL(&U::configure));\n template<class U>\n static no test_configure(...);\n\n template<class U>\n static yes test_process(BOOST_TYPEOF_TPL(&U::process));\n template<class U>\n static no test_process(...);\n\n template<class U>\n static yes test_destroy(BOOST_TYPEOF_TPL(&U::destroy));\n template<class U>\n static no test_destroy(...);\n\n enum\n {\n declare_params = sizeof(test_declare_params<T> (0)) == sizeof(yes)\n };\n enum\n {\n declare_io = sizeof(test_declare_io<T> (0)) == sizeof(yes)\n };\n enum\n {\n configure = sizeof(test_configure<T> (0)) == sizeof(yes)\n };\n enum\n {\n process = sizeof(test_process<T> (0)) == sizeof(yes)\n };\n enum\n {\n destroy = sizeof(test_destroy<T> (0)) == sizeof(yes)\n };\n\n };\n\n \/**\n * \\brief cell_<T> is for registering an arbitrary class\n * with the the cell NVI. This adds a barrier between client code and the cell.\n *\/\n template<class Impl>\n struct cell_: cell\n {\n typedef boost::shared_ptr<cell_<Impl> > ptr;\n\n typedef typename detail::python_mutex<Impl>::type gil_mtx_t;\n\n ~cell_()\n {\n dispatch_destroy();\n }\n protected:\n template<int I>\n struct int_\n {\n };\n typedef int_<0> not_implemented;\n typedef int_<1> implemented;\n\n static void declare_params(not_implemented, tendrils& params)\n {\n }\n\n static void declare_params(implemented, tendrils& params)\n {\n Impl::declare_params(params);\n }\n\n void dispatch_declare_params(tendrils& params)\n {\n \/\/this is a none static function. for virtuality.\n declare_params(int_<has_f<Impl>::declare_params> (), params);\n }\n\n static void declare_io(not_implemented, const tendrils& params,\n tendrils& inputs, tendrils& outputs)\n {\n }\n static void declare_io(implemented, const tendrils& params,\n tendrils& inputs, tendrils& outputs)\n {\n Impl::declare_io(params, inputs, outputs);\n }\n\n void dispatch_declare_io(const tendrils& params, tendrils& inputs,\n tendrils& outputs)\n {\n declare_io(int_<has_f<Impl>::declare_io> (), params, inputs, outputs);\n }\n\n void configure(not_implemented, tendrils&, tendrils& , tendrils&)\n {\n }\n\n void configure(implemented, tendrils& params, tendrils& inputs,\n tendrils& outputs)\n {\n boost::this_thread::interruption_point();\n impl->configure(params,inputs,outputs);\n for (tendrils::iterator iter = inputs.begin(); iter != inputs.end(); ++iter)\n if (iter->second->is_type<boost::python::object>())\n throw std::runtime_error(\"you can't use a python object as an input\");\n\n for (tendrils::iterator iter = outputs.begin(); iter != outputs.end(); ++iter)\n if (iter->second->is_type<boost::python::object>())\n throw std::runtime_error(\"you can't use a python object as an output\");\n\n\n }\n\n void dispatch_configure(tendrils& params, tendrils& inputs,\n tendrils& outputs)\n {\n \/\/the cell may not be allocated here, so check pointer.\n if (!impl)\n {\n try\n {\n impl.reset(new Impl);\n }\n catch (std::exception& e)\n {\n except::EctoException ee(\"Original Exception: \" +name_of(typeid(e)));\n ee << \" What : \" + std::string(e.what());\n ee << \" Module : \" + name() + \"\\n in constructor of: \" + name_of<Impl>();\n boost::throw_exception(ee); \\\n }\n catch (...)\n {\n except::EctoException ee(\"Threw unknown exception type!\");\n ee << \" Module : \" + name() + \"\\n in constructor of: \" + name_of<Impl>();\n boost::throw_exception(ee);\n }\n \/\/configure is only called once.\n configure(int_<has_f<Impl>::configure> (), params,inputs,outputs);\n }\n }\n\n ReturnCode process(not_implemented, const tendrils& ,\n const tendrils& )\n {\n return OK;\n }\n\n ReturnCode process(implemented, tendrils& inputs, tendrils& outputs)\n {\n ReturnCode code;\n profile::stats_collector coll(stats);\n code = ReturnCode(impl->process(inputs, outputs));\n return code;\n }\n\n ReturnCode dispatch_process(tendrils& inputs, tendrils& outputs)\n {\n dispatch_configure(parameters,this->inputs,outputs);\n boost::this_thread::interruption_point();\n return process(int_<has_f<Impl>::process> (), inputs, outputs);\n }\n\n void destroy(not_implemented)\n {\n }\n\n void destroy(implemented)\n {\n \/\/destroy only called once, then destructor.\n if(impl)\n impl->destroy();\n }\n\n void dispatch_destroy()\n {\n destroy(int_<has_f<Impl>::destroy> ());\n impl.reset();\n }\n\n std::string dispatch_name() const\n {\n return CELL_TYPE_NAME;\n }\n std::string dispatch_short_doc() const\n {\n return SHORT_DOC;\n }\n\n void dispatch_short_doc(const std::string&)\n {\n }\n\n cell::ptr dispatch_make() const\n {\n cell::ptr m(new cell_<Impl> ());\n m->declare_params();\n \/\/copy all of the parameters by value.\n tendrils::iterator it = m->parameters.begin();\n tendrils::const_iterator end = m->parameters.end(), oit =\n parameters.begin();\n while (it != end)\n {\n it->second << *oit->second;\n ++oit;\n ++it;\n }\n m->declare_io();\n return m;\n }\n void init()\n {\n if(!impl)\n {\n cell::configure();\n }\n }\n\n static const std::string CELL_TYPE_NAME;\n public:\n boost::shared_ptr<Impl> impl;\n static std::string SHORT_DOC;\n };\n\n template<typename Impl>\n std::string cell_<Impl>::SHORT_DOC;\n\n template<typename Impl>\n const std::string cell_<Impl>::CELL_TYPE_NAME = ecto::name_of<Impl>();\n\n \/**\n * Creates a cell from type T that has not been configured, so therefore,\n * not allocated. This only calls the static functions associated with parameter and\n * input\/output declaration.\n *\n * @return A cell::ptr that is initialized as far as default params,inputs,outputs go.\n *\/\n template<typename Impl>\n typename cell_<Impl>::ptr inspect_cell()\n {\n typename cell_<Impl>::ptr p(new cell_<Impl> ());\n cell::ptr base(p);\n base->declare_params();\n base->declare_io();\n return p;\n }\n\n \/**\n * Create a cell from an type that has all of the proper interface functions defined.\n * This will call configure in the cell.\n * @return A cell ptr.\n *\/\n template<typename Impl>\n typename cell_<Impl>::ptr create_cell()\n {\n typename cell_<Impl>::ptr p = inspect_cell<Impl>();\n return p;\n }\n\n}\/\/namespace ecto\n<|endoftext|>"} {"text":"<commit_before>#include <string>\n#include <iostream>\n\n#include \"pneu\/graphics\/Color.hpp\"\n#include \"pneu\/graphics\/Window.hpp\"\n#include \"pneu\/graphics\/Renderer.hpp\"\n#include \"pneu\/core\/MethodResult.hpp\"\n\n#define GLM_FORCE_CXX11\n#define GLM_FORCE_RADIANS\n#include <glm\/glm.hpp>\n\nauto main(int argc, const char** argv) -> int {\n pneu::graphics::Window window(\"testing\", 800, 600, 80, 60);\n\n window.init().onError([](const std::string& error) {\n std::cout << error << std::endl;\n exit(1);\n });\n\n \/\/ set background to a nice shade of blue\n window.getRenderer().setBackgroundColor(pneu::graphics::Color<>(0.2f, 0.3f, 0.7f));\n\n while (window.isRunning()) {\n window.pollEvents();\n window.update();\n window.renderFrame();\n }\n\n return 0;\n}\n<commit_msg>Added Ellipse drawing line (uncomment to segfault :-(<commit_after>#include <string>\n#include <iostream>\n\n#include \"pneu\/graphics\/Color.hpp\"\n#include \"pneu\/graphics\/Window.hpp\"\n#include \"pneu\/graphics\/Renderer.hpp\"\n\n#include \"pneu\/graphics\/shapes\/Ellipse.hpp\"\n\n#include \"pneu\/core\/MethodResult.hpp\"\n\n#define GLM_FORCE_CXX11\n#define GLM_FORCE_RADIANS\n#include <glm\/glm.hpp>\n\nauto main(int argc, const char** argv) -> int {\n pneu::graphics::Window window(\"testing\", 800, 600, 80, 60);\n\n window.init().onError([](const std::string& error) {\n std::cout << error << std::endl;\n exit(1);\n });\n\n \/\/ set background to a nice shade of blue\n window.getRenderer().setBackgroundColor(pneu::graphics::Color<>(0.2f, 0.3f, 0.7f));\n \/*\n window.getRenderer().addRenderObject(\n std::make_shared<pneu::graphics::shapes::Ellipse>(glm::vec2(0.0f),\n pneu::graphics::Color<>::red(),\n 5.0f));\n *\/\n while (window.isRunning()) {\n window.pollEvents();\n window.update();\n window.renderFrame();\n }\n\n return 0;\n}\n<|endoftext|>"} {"text":"<commit_before>\/\/ Copyright (c) 2012 Plenluno All rights reserved.\n\n#include <assert.h>\n#include <stdio.h>\n#include <iv\/lv5\/third_party\/v8_dtoa\/conversions.h>\n#include <string>\n\n#include \"libj\/string.h\"\n#include \".\/glue\/cvtutf.h\"\n\nnamespace libj {\n\nclass StringImpl : public String {\n public:\n Size length() const {\n return str_.length();\n }\n\n Char charAt(Size index) const {\n if (index >= length()) {\n return NO_CHAR;\n } else {\n return str_.at(index);\n }\n }\n\n CPtr substring(Size from) const {\n if (from > length()) {\n return null();\n } else if (from == 0) {\n return toString();\n } else {\n CPtr p(new StringImpl(*this, from));\n return p;\n }\n }\n\n CPtr substring(Size from, Size to) const {\n Size len = length();\n if (from > len || to > len || from > to) {\n return null();\n } else if (from == 0 && to == len) {\n return toString();\n } else {\n CPtr p(new StringImpl(*this, from, to - from));\n return p;\n }\n }\n\n CPtr concat(CPtr other) const {\n if (!other || other->isEmpty()) {\n return this->toString();\n } else if (this->isEmpty()) {\n return other->toString();\n }\n\n StringImpl* s = new StringImpl(*this);\n Size len = other->length();\n for (Size i = 0; i < len; i++)\n s->str_.push_back(other->charAt(i));\n CPtr p(s);\n return p;\n }\n\n Int compareTo(Object::CPtr that) const {\n Int result = Object::compareTo(that);\n if (result != TYPE_CMP_SAME &&\n result != -TYPE_CMP_SAME) {\n return result;\n }\n\n String::CPtr other = LIBJ_STATIC_CPTR_CAST(String)(that);\n Size len1 = this->length();\n Size len2 = other->length();\n Size len = len1 < len2 ? len1 : len2;\n for (Size i = 0; i < len; i++) {\n Char c1 = this->charAt(i);\n Char c2 = other->charAt(i);\n if (c1 != c2)\n return c1 - c2;\n }\n return len1 - len2;\n }\n\n Boolean startsWith(CPtr other, Size from) const {\n Size len1 = this->length();\n Size len2 = other->length();\n if (len1 < from + len2)\n return false;\n for (Size i = 0; i < len2; i++)\n if (this->charAt(from + i) != other->charAt(i))\n return false;\n return true;\n }\n\n Boolean endsWith(CPtr other) const {\n Size len1 = this->length();\n Size len2 = other->length();\n if (len1 < len2)\n return false;\n Size pos = len1 - len2;\n for (Size i = 0; i < len2; i++)\n if (this->charAt(pos + i) != other->charAt(i))\n return false;\n return true;\n }\n\n Size indexOf(Char c, Size from) const {\n Size len = length();\n for (Size i = from; i < len; i++)\n if (charAt(i) == c)\n return i;\n return NO_POS;\n }\n\n Size indexOf(CPtr other, Size from) const {\n \/\/ TODO(plenluno): make it more efficient\n Size len1 = this->length();\n Size len2 = other->length();\n if (len1 < from + len2)\n return NO_POS;\n Size n = len1 - len2 + 1;\n for (Size i = from; i < n; i++)\n if (startsWith(other, i))\n return i;\n return NO_POS;\n }\n\n Size lastIndexOf(Char c, Size from) const {\n Size len = length();\n if (len == 0)\n return NO_POS;\n from = from < len ? from : len - 1;\n for (Size i = from; ; i--) {\n if (charAt(i) == c)\n return i;\n if (i == 0)\n break;\n }\n return NO_POS;\n }\n\n Size lastIndexOf(CPtr other, Size from) const {\n \/\/ TODO(plenluno): make it more efficient\n Size len1 = this->length();\n Size len2 = other->length();\n if (len1 < len2)\n return NO_POS;\n Size diff = len1 - len2;\n from = from < diff ? from : diff;\n for (Size i = from; ; i--) {\n if (startsWith(other, i))\n return i;\n if (i == 0)\n break;\n }\n return NO_POS;\n }\n\n Boolean isEmpty() const {\n return length() == 0;\n }\n\n CPtr toLowerCase() const {\n Size len = length();\n StringImpl* s = new StringImpl();\n for (Size i = 0; i < len; i++) {\n Char c = charAt(i);\n if (c >= 'A' && c <= 'Z')\n c += 'a' - 'A';\n s->str_ += c;\n }\n CPtr p(s);\n return p;\n }\n\n CPtr toUpperCase() const {\n Size len = length();\n StringImpl* s = new StringImpl();\n for (Size i = 0; i < len; i++) {\n Char c = charAt(i);\n if (c >= 'a' && c <= 'z')\n c -= 'a' - 'A';\n s->str_ += c;\n }\n CPtr p(s);\n return p;\n }\n\n CPtr toString() const {\n CPtr p(new StringImpl(*this));\n return p;\n }\n\n std::u16string toStdU16String() const {\n return glue::utf32ToUtf16(str_);\n }\n\n std::u32string toStdU32String() const {\n return str_;\n }\n\n std::string toStdString(Encoding enc) const {\n return glue::fromUtf32(str_, convertEncoding(enc));\n }\n\n static CPtr create() {\n CPtr p(new StringImpl());\n return p;\n }\n\n static CPtr create(Char c, Size n) {\n CPtr p(new StringImpl(c, n));\n return p;\n }\n\n static CPtr create(const std::u16string& s16) {\n CPtr p(new StringImpl(s16));\n return p;\n }\n\n static CPtr create(const std::u32string& s32) {\n CPtr p(new StringImpl(s32));\n return p;\n }\n\n static CPtr create(const void* data, Encoding enc, Size max) {\n CPtr p(new StringImpl(data, enc, max));\n return p;\n }\n\n private:\n static glue::UnicodeEncoding convertEncoding(Encoding enc) {\n switch (enc) {\n case UTF8:\n return glue::UTF8;\n case UTF16BE:\n return glue::UTF16BE;\n case UTF16LE:\n return glue::UTF16LE;\n case UTF32BE:\n return glue::UTF32BE;\n case UTF32LE:\n return glue::UTF32LE;\n default:\n assert(false);\n }\n }\n\n private:\n std::u32string str_;\n\n StringImpl() : str_() {}\n\n StringImpl(Char c, Size n) : str_(n, c) {}\n\n StringImpl(const std::u16string& s16)\n : str_(glue::utf16ToUtf32(s16)) {}\n\n StringImpl(const std::u32string& s32) : str_(s32) {}\n\n StringImpl(const void* data, Encoding enc, Size max)\n : str_(glue::toUtf32(data, convertEncoding(enc), max)) {}\n\n StringImpl(const StringImpl& other) : str_(other.str_) {}\n\n StringImpl(const StringImpl& other, Size pos, Size count = NO_POS)\n : str_(other.str_, pos, count) {}\n};\n\nString::CPtr String::create() {\n static const String::CPtr empty =\n StringImpl::create(NULL, UTF8, NO_POS);\n return empty;\n}\n\nString::CPtr String::create(Char c, Size n) {\n return StringImpl::create(c, n);\n}\n\nString::CPtr String::create(const std::u16string& s16) {\n return StringImpl::create(s16);\n}\n\nString::CPtr String::create(const std::u32string& s32) {\n return StringImpl::create(s32);\n}\n\nString::CPtr String::create(const void* data, Encoding enc, Size max) {\n return StringImpl::create(data, enc, max);\n}\n\nstatic String::CPtr LIBJ_STR_TRUE = String::create(\"true\");\nstatic String::CPtr LIBJ_STR_FALSE = String::create(\"false\");\n\nstatic String::CPtr booleanToString(const Value& val) {\n Boolean b;\n to<Boolean>(val, &b);\n return b ? LIBJ_STR_TRUE : LIBJ_STR_FALSE;\n}\n\nstatic String::CPtr byteToString(const Value& val) {\n Byte b;\n to<Byte>(val, &b);\n const Size kLen = (8 \/ 3) + 3;\n char s[kLen];\n snprintf(s, kLen, \"%d\", b);\n return String::create(s);\n}\n\nstatic String::CPtr shortToString(const Value& val) {\n Short sh;\n to<Short>(val, &sh);\n const Size kLen = (16 \/ 3) + 3;\n char s[kLen];\n snprintf(s, kLen, \"%d\", sh);\n return String::create(s);\n}\n\nstatic String::CPtr intToString(const Value& val) {\n Int i;\n to<Int>(val, &i);\n const Size kLen = (32 \/ 3) + 3;\n char s[kLen];\n snprintf(s, kLen, \"%d\", i);\n String::CPtr p = String::create(s);\n return p;\n}\n\nstatic String::CPtr longToString(const Value& val) {\n Long l;\n to<Long>(val, &l);\n const Size kLen = (64 \/ 3) + 3;\n char s[kLen];\n snprintf(s, kLen, \"%lld\", l);\n return String::create(s);\n}\n\nstatic String::CPtr floatToString(const Value& val) {\n Float f;\n to<Float>(val, &f);\n const Size kLen = 64;\n char s[kLen];\n return String::create(v8::internal::DoubleToCString(f, s, kLen));\n}\n\nstatic String::CPtr doubleToString(const Value& val) {\n Double d;\n to<Double>(val, &d);\n const Size kLen = 64;\n char s[kLen];\n return String::create(v8::internal::DoubleToCString(d, s, kLen));\n}\n\nstatic String::CPtr sizeToString(const Value& val) {\n Size n;\n to<Size>(val, &n);\n const Size kLen = ((sizeof(Size) << 3) \/ 3) + 3;\n char s[kLen];\n snprintf(s, kLen, \"%zd\", n);\n String::CPtr p = String::create(s);\n return p;\n}\n\nstatic String::CPtr typeIdToString(const Value& val) {\n TypeId t;\n to<TypeId>(val, &t);\n const Size kLen = ((sizeof(TypeId) << 3) \/ 3) + 3;\n char s[kLen];\n snprintf(s, kLen, \"%zd\", t);\n String::CPtr p = String::create(s);\n return p;\n}\n\nstatic String::CPtr objectToString(const Value& val) {\n Object::CPtr o = toCPtr<Object>(val);\n if (o) {\n return o->toString();\n } else {\n return String::null();\n }\n}\n\nString::CPtr String::valueOf(const Value& val) {\n if (val.isEmpty()) {\n return null();\n } else if (val.type() == Type<Boolean>::id()) {\n return booleanToString(val);\n } else if (val.type() == Type<Byte>::id()) {\n return byteToString(val);\n } else if (val.type() == Type<Short>::id()) {\n return shortToString(val);\n } else if (val.type() == Type<Int>::id()) {\n return intToString(val);\n } else if (val.type() == Type<Long>::id()) {\n return longToString(val);\n } else if (val.type() == Type<Float>::id()) {\n return floatToString(val);\n } else if (val.type() == Type<Double>::id()) {\n return doubleToString(val);\n } else if (val.type() == Type<Size>::id()) {\n return sizeToString(val);\n } else if (val.type() == Type<TypeId>::id()) {\n return typeIdToString(val);\n } else if (val.instanceof(Type<Object>::id())) {\n return objectToString(val);\n } else {\n return null();\n }\n}\n\n} \/\/ namespace libj\n<commit_msg>refactor String::valueOf<commit_after>\/\/ Copyright (c) 2012 Plenluno All rights reserved.\n\n#include <assert.h>\n#include <stdio.h>\n#include <iv\/lv5\/third_party\/v8_dtoa\/conversions.h>\n#include <string>\n\n#include \"libj\/string.h\"\n#include \".\/glue\/cvtutf.h\"\n\nnamespace libj {\n\nclass StringImpl : public String {\n public:\n Size length() const {\n return str_.length();\n }\n\n Char charAt(Size index) const {\n if (index >= length()) {\n return NO_CHAR;\n } else {\n return str_.at(index);\n }\n }\n\n CPtr substring(Size from) const {\n if (from > length()) {\n return null();\n } else if (from == 0) {\n return toString();\n } else {\n CPtr p(new StringImpl(*this, from));\n return p;\n }\n }\n\n CPtr substring(Size from, Size to) const {\n Size len = length();\n if (from > len || to > len || from > to) {\n return null();\n } else if (from == 0 && to == len) {\n return toString();\n } else {\n CPtr p(new StringImpl(*this, from, to - from));\n return p;\n }\n }\n\n CPtr concat(CPtr other) const {\n if (!other || other->isEmpty()) {\n return this->toString();\n } else if (this->isEmpty()) {\n return other->toString();\n }\n\n StringImpl* s = new StringImpl(*this);\n Size len = other->length();\n for (Size i = 0; i < len; i++)\n s->str_.push_back(other->charAt(i));\n CPtr p(s);\n return p;\n }\n\n Int compareTo(Object::CPtr that) const {\n Int result = Object::compareTo(that);\n if (result != TYPE_CMP_SAME &&\n result != -TYPE_CMP_SAME) {\n return result;\n }\n\n String::CPtr other = LIBJ_STATIC_CPTR_CAST(String)(that);\n Size len1 = this->length();\n Size len2 = other->length();\n Size len = len1 < len2 ? len1 : len2;\n for (Size i = 0; i < len; i++) {\n Char c1 = this->charAt(i);\n Char c2 = other->charAt(i);\n if (c1 != c2)\n return c1 - c2;\n }\n return len1 - len2;\n }\n\n Boolean startsWith(CPtr other, Size from) const {\n Size len1 = this->length();\n Size len2 = other->length();\n if (len1 < from + len2)\n return false;\n for (Size i = 0; i < len2; i++)\n if (this->charAt(from + i) != other->charAt(i))\n return false;\n return true;\n }\n\n Boolean endsWith(CPtr other) const {\n Size len1 = this->length();\n Size len2 = other->length();\n if (len1 < len2)\n return false;\n Size pos = len1 - len2;\n for (Size i = 0; i < len2; i++)\n if (this->charAt(pos + i) != other->charAt(i))\n return false;\n return true;\n }\n\n Size indexOf(Char c, Size from) const {\n Size len = length();\n for (Size i = from; i < len; i++)\n if (charAt(i) == c)\n return i;\n return NO_POS;\n }\n\n Size indexOf(CPtr other, Size from) const {\n \/\/ TODO(plenluno): make it more efficient\n Size len1 = this->length();\n Size len2 = other->length();\n if (len1 < from + len2)\n return NO_POS;\n Size n = len1 - len2 + 1;\n for (Size i = from; i < n; i++)\n if (startsWith(other, i))\n return i;\n return NO_POS;\n }\n\n Size lastIndexOf(Char c, Size from) const {\n Size len = length();\n if (len == 0)\n return NO_POS;\n from = from < len ? from : len - 1;\n for (Size i = from; ; i--) {\n if (charAt(i) == c)\n return i;\n if (i == 0)\n break;\n }\n return NO_POS;\n }\n\n Size lastIndexOf(CPtr other, Size from) const {\n \/\/ TODO(plenluno): make it more efficient\n Size len1 = this->length();\n Size len2 = other->length();\n if (len1 < len2)\n return NO_POS;\n Size diff = len1 - len2;\n from = from < diff ? from : diff;\n for (Size i = from; ; i--) {\n if (startsWith(other, i))\n return i;\n if (i == 0)\n break;\n }\n return NO_POS;\n }\n\n Boolean isEmpty() const {\n return length() == 0;\n }\n\n CPtr toLowerCase() const {\n Size len = length();\n StringImpl* s = new StringImpl();\n for (Size i = 0; i < len; i++) {\n Char c = charAt(i);\n if (c >= 'A' && c <= 'Z')\n c += 'a' - 'A';\n s->str_ += c;\n }\n CPtr p(s);\n return p;\n }\n\n CPtr toUpperCase() const {\n Size len = length();\n StringImpl* s = new StringImpl();\n for (Size i = 0; i < len; i++) {\n Char c = charAt(i);\n if (c >= 'a' && c <= 'z')\n c -= 'a' - 'A';\n s->str_ += c;\n }\n CPtr p(s);\n return p;\n }\n\n CPtr toString() const {\n CPtr p(new StringImpl(*this));\n return p;\n }\n\n std::u16string toStdU16String() const {\n return glue::utf32ToUtf16(str_);\n }\n\n std::u32string toStdU32String() const {\n return str_;\n }\n\n std::string toStdString(Encoding enc) const {\n return glue::fromUtf32(str_, convertEncoding(enc));\n }\n\n static CPtr create() {\n CPtr p(new StringImpl());\n return p;\n }\n\n static CPtr create(Char c, Size n) {\n CPtr p(new StringImpl(c, n));\n return p;\n }\n\n static CPtr create(const std::u16string& s16) {\n CPtr p(new StringImpl(s16));\n return p;\n }\n\n static CPtr create(const std::u32string& s32) {\n CPtr p(new StringImpl(s32));\n return p;\n }\n\n static CPtr create(const void* data, Encoding enc, Size max) {\n CPtr p(new StringImpl(data, enc, max));\n return p;\n }\n\n private:\n static glue::UnicodeEncoding convertEncoding(Encoding enc) {\n switch (enc) {\n case UTF8:\n return glue::UTF8;\n case UTF16BE:\n return glue::UTF16BE;\n case UTF16LE:\n return glue::UTF16LE;\n case UTF32BE:\n return glue::UTF32BE;\n case UTF32LE:\n return glue::UTF32LE;\n default:\n assert(false);\n }\n }\n\n private:\n std::u32string str_;\n\n StringImpl() : str_() {}\n\n StringImpl(Char c, Size n) : str_(n, c) {}\n\n StringImpl(const std::u16string& s16)\n : str_(glue::utf16ToUtf32(s16)) {}\n\n StringImpl(const std::u32string& s32) : str_(s32) {}\n\n StringImpl(const void* data, Encoding enc, Size max)\n : str_(glue::toUtf32(data, convertEncoding(enc), max)) {}\n\n StringImpl(const StringImpl& other) : str_(other.str_) {}\n\n StringImpl(const StringImpl& other, Size pos, Size count = NO_POS)\n : str_(other.str_, pos, count) {}\n};\n\nString::CPtr String::create() {\n static const String::CPtr empty =\n StringImpl::create(NULL, UTF8, NO_POS);\n return empty;\n}\n\nString::CPtr String::create(Char c, Size n) {\n return StringImpl::create(c, n);\n}\n\nString::CPtr String::create(const std::u16string& s16) {\n return StringImpl::create(s16);\n}\n\nString::CPtr String::create(const std::u32string& s32) {\n return StringImpl::create(s32);\n}\n\nString::CPtr String::create(const void* data, Encoding enc, Size max) {\n return StringImpl::create(data, enc, max);\n}\n\nstatic String::CPtr LIBJ_STR_TRUE = String::create(\"true\");\nstatic String::CPtr LIBJ_STR_FALSE = String::create(\"false\");\n\nstatic String::CPtr booleanToString(const Value& val) {\n Boolean b;\n to<Boolean>(val, &b);\n return b ? LIBJ_STR_TRUE : LIBJ_STR_FALSE;\n}\n\nstatic String::CPtr byteToString(const Value& val) {\n Byte b;\n to<Byte>(val, &b);\n const Size kLen = (8 \/ 3) + 3;\n char s[kLen];\n snprintf(s, kLen, \"%d\", b);\n return String::create(s);\n}\n\nstatic String::CPtr shortToString(const Value& val) {\n Short sh;\n to<Short>(val, &sh);\n const Size kLen = (16 \/ 3) + 3;\n char s[kLen];\n snprintf(s, kLen, \"%d\", sh);\n return String::create(s);\n}\n\nstatic String::CPtr intToString(const Value& val) {\n Int i;\n to<Int>(val, &i);\n const Size kLen = (32 \/ 3) + 3;\n char s[kLen];\n snprintf(s, kLen, \"%d\", i);\n return String::create(s);\n}\n\nstatic String::CPtr longToString(const Value& val) {\n Long l;\n to<Long>(val, &l);\n const Size kLen = (64 \/ 3) + 3;\n char s[kLen];\n snprintf(s, kLen, \"%lld\", l);\n return String::create(s);\n}\n\nstatic String::CPtr floatToString(const Value& val) {\n Float f;\n to<Float>(val, &f);\n const Size kLen = 64;\n char s[kLen];\n return String::create(v8::internal::DoubleToCString(f, s, kLen));\n}\n\nstatic String::CPtr doubleToString(const Value& val) {\n Double d;\n to<Double>(val, &d);\n const Size kLen = 64;\n char s[kLen];\n return String::create(v8::internal::DoubleToCString(d, s, kLen));\n}\n\nstatic String::CPtr sizeToString(const Value& val) {\n Size n;\n to<Size>(val, &n);\n const Size kLen = ((sizeof(Size) << 3) \/ 3) + 3;\n char s[kLen];\n snprintf(s, kLen, \"%zd\", n);\n return String::create(s);\n}\n\nstatic String::CPtr typeIdToString(const Value& val) {\n TypeId t;\n to<TypeId>(val, &t);\n const Size kLen = ((sizeof(TypeId) << 3) \/ 3) + 3;\n char s[kLen];\n snprintf(s, kLen, \"%zd\", t);\n return String::create(s);\n}\n\nstatic String::CPtr objectToString(const Value& val) {\n Object::CPtr o = toCPtr<Object>(val);\n if (o) {\n return o->toString();\n } else {\n return String::null();\n }\n}\n\nString::CPtr String::valueOf(const Value& val) {\n if (val.isEmpty()) {\n return null();\n } else if (val.type() == Type<Boolean>::id()) {\n return booleanToString(val);\n } else if (val.type() == Type<Byte>::id()) {\n return byteToString(val);\n } else if (val.type() == Type<Short>::id()) {\n return shortToString(val);\n } else if (val.type() == Type<Int>::id()) {\n return intToString(val);\n } else if (val.type() == Type<Long>::id()) {\n return longToString(val);\n } else if (val.type() == Type<Float>::id()) {\n return floatToString(val);\n } else if (val.type() == Type<Double>::id()) {\n return doubleToString(val);\n } else if (val.type() == Type<Size>::id()) {\n return sizeToString(val);\n } else if (val.type() == Type<TypeId>::id()) {\n return typeIdToString(val);\n } else if (val.instanceof(Type<Object>::id())) {\n return objectToString(val);\n } else {\n return null();\n }\n}\n\n} \/\/ namespace libj\n<|endoftext|>"} {"text":"<commit_before>\/*\n* Copyright 2020 Axel Waggershauser\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*\/\n\n#include \"ODDataBarCommon.h\"\n\nnamespace ZXing {\nnamespace OneD {\n\n\/\/ apparently the spec calls numbers at even indices 'odd'!?!\nconstexpr int odd = 0, evn = 1;\n\ntemplate <typename T>\nstruct OddEven\n{\n\tT odd = {}, evn = {};\n\tT& operator[](int i) { return i & 1 ? evn : odd; }\n};\n\nbool ReadDataCharacterRaw(const PatternView& view, int numModules, bool reversed, Array4I& oddPattern,\n\t\t\t\t\t\t Array4I& evnPattern)\n{\n\tOddEven<Array4I&> res = {oddPattern, evnPattern};\n\tOddEven<Array4F> rem;\n\n\tfloat moduleSize = static_cast<float>(view.sum(8)) \/ numModules;\n\tauto* iter = view.data() + reversed * 7;\n\tint inc = reversed ? -1 : 1;\n\n\tfor (int i = 0; i < 8; ++i, iter += inc) {\n\t\tfloat v = *iter \/ moduleSize;\n\t\tres[i % 2][i \/ 2] = int(v + .5f);\n\t\trem[i % 2][i \/ 2] = v - res[i % 2][i \/ 2];\n\t}\n\n\t\/\/ DataBarExpanded data character is 17 modules wide\n\t\/\/ DataBar outer data character is 16 modules wide\n\t\/\/ DataBar inner data character is 15 modules wide\n\n\tint minSum = 4; \/\/ each data character has 4 bars and 4 spaces\n\tint maxSum = numModules - minSum;\n\tint oddSum = Reduce(res.odd);\n\tint evnSum = Reduce(res.evn);\n\tint sumErr = oddSum + evnSum - numModules;\n\t\/\/ sum < min -> negative error; sum > max -> positive error\n\tint oddSumErr = std::min(0, oddSum - (minSum + (numModules == 15))) + std::max(0, oddSum - maxSum);\n\tint evnSumErr = std::min(0, evnSum - minSum) + std::max(0, evnSum - (maxSum - (numModules == 15)));\n\n\tint oddParityErr = (oddSum & 1) == (numModules > 15);\n\tint evnParityErr = (evnSum & 1) == (numModules < 17);\n\n\tif ((sumErr == 0 && oddParityErr != evnParityErr) || (std::abs(sumErr) == 1 && oddParityErr == evnParityErr) ||\n\t\tstd::abs(sumErr) > 1 || std::abs(oddSumErr) > 1 || std::abs(evnSumErr) > 1)\n\t\treturn {};\n\n\tif (sumErr == -1) {\n\t\toddParityErr *= -1;\n\t\tevnParityErr *= -1;\n\t} else if (sumErr == 0 && oddParityErr != 0) {\n\t\t\/\/ both parity errors are 1 -> flip one of them\n\t\t(oddSum < evnSum ? oddParityErr : evnParityErr) *= -1;\n\t}\n\n\t\/\/ check if parity and sum errors have opposite signs\n\tif (oddParityErr * oddSumErr < 0 || evnParityErr * evnSumErr < 0)\n\t\treturn {};\n\n\tfor (int i : {odd, evn}) {\n\t\tint err = i == odd ? (oddSumErr | oddParityErr) : (evnSumErr | evnParityErr);\n\t\tint mi = err > 0 ? std::max_element(rem[i].begin(), rem[i].end()) - rem[i].begin()\n\t\t\t\t\t\t : std::min_element(rem[i].begin(), rem[i].end()) - rem[i].begin();\n\t\tres[i][mi] -= err;\n\t};\n\n\treturn true;\n}\n\n} \/\/ OneD\n} \/\/ ZXing\n<commit_msg>DataBar: fix '<' vs '>' typo in ReadDataCharacterRaw error correction code<commit_after>\/*\n* Copyright 2020 Axel Waggershauser\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*\/\n\n#include \"ODDataBarCommon.h\"\n\nnamespace ZXing {\nnamespace OneD {\n\n\/\/ apparently the spec calls numbers at even indices 'odd'!?!\nconstexpr int odd = 0, evn = 1;\n\ntemplate <typename T>\nstruct OddEven\n{\n\tT odd = {}, evn = {};\n\tT& operator[](int i) { return i & 1 ? evn : odd; }\n};\n\nbool ReadDataCharacterRaw(const PatternView& view, int numModules, bool reversed, Array4I& oddPattern,\n\t\t\t\t\t\t Array4I& evnPattern)\n{\n\tOddEven<Array4I&> res = {oddPattern, evnPattern};\n\tOddEven<Array4F> rem;\n\n\tfloat moduleSize = static_cast<float>(view.sum(8)) \/ numModules;\n\tauto* iter = view.data() + reversed * 7;\n\tint inc = reversed ? -1 : 1;\n\n\tfor (int i = 0; i < 8; ++i, iter += inc) {\n\t\tfloat v = *iter \/ moduleSize;\n\t\tres[i % 2][i \/ 2] = int(v + .5f);\n\t\trem[i % 2][i \/ 2] = v - res[i % 2][i \/ 2];\n\t}\n\n\t\/\/ DataBarExpanded data character is 17 modules wide\n\t\/\/ DataBar outer data character is 16 modules wide\n\t\/\/ DataBar inner data character is 15 modules wide\n\n\tint minSum = 4; \/\/ each data character has 4 bars and 4 spaces\n\tint maxSum = numModules - minSum;\n\tint oddSum = Reduce(res.odd);\n\tint evnSum = Reduce(res.evn);\n\tint sumErr = oddSum + evnSum - numModules;\n\t\/\/ sum < min -> negative error; sum > max -> positive error\n\tint oddSumErr = std::min(0, oddSum - (minSum + (numModules == 15))) + std::max(0, oddSum - maxSum);\n\tint evnSumErr = std::min(0, evnSum - minSum) + std::max(0, evnSum - (maxSum - (numModules == 15)));\n\n\tint oddParityErr = (oddSum & 1) == (numModules > 15);\n\tint evnParityErr = (evnSum & 1) == (numModules < 17);\n\n\tif ((sumErr == 0 && oddParityErr != evnParityErr) || (std::abs(sumErr) == 1 && oddParityErr == evnParityErr) ||\n\t\tstd::abs(sumErr) > 1 || std::abs(oddSumErr) > 1 || std::abs(evnSumErr) > 1)\n\t\treturn {};\n\n\tif (sumErr == -1) {\n\t\toddParityErr *= -1;\n\t\tevnParityErr *= -1;\n\t} else if (sumErr == 0 && oddParityErr != 0) {\n\t\t\/\/ both parity errors are 1 -> flip one of them\n\t\t(oddSum < evnSum ? oddParityErr : evnParityErr) *= -1;\n\t}\n\n\t\/\/ check if parity and sum errors have opposite signs\n\tif (oddParityErr * oddSumErr < 0 || evnParityErr * evnSumErr < 0)\n\t\treturn {};\n\n\tfor (int i : {odd, evn}) {\n\t\tint err = i == odd ? (oddSumErr | oddParityErr) : (evnSumErr | evnParityErr);\n\t\tint mi = err < 0 ? std::max_element(rem[i].begin(), rem[i].end()) - rem[i].begin()\n\t\t\t\t\t\t : std::min_element(rem[i].begin(), rem[i].end()) - rem[i].begin();\n\t\tres[i][mi] -= err;\n\t};\n\n\treturn true;\n}\n\n} \/\/ OneD\n} \/\/ ZXing\n<|endoftext|>"} {"text":"<commit_before>\/**\n * @file Special Purpose Strings Library: hash\n * @author Daniel Evers\n * @brief Hashing implementation to enable std::hash specialization\n * @license MIT\n *\n * The hashing function is MurmurHash3, taken thankfully from https:\/\/github.com\/aappleby\/smhasher.\n * It provides a 32 bit hash and a 128 bit hash, but no 64 bit version. This is handled by using\n * the 128 bit hash and cutting it to 64 bit.\n *\n * The implementation was slightly modified to meat current C++ standards, fix type safety issues\n * and meat this library's guidelines.\n *\/\n\n#ifndef SPSL_HASH_HPP_\n#define SPSL_HASH_HPP_\n\n#include <cstdint>\n#include <cstring>\n\nnamespace spsl\n{\nnamespace hash\n{\nnamespace murmurhash3\n{\n\/\/ Copied from https:\/\/github.com\/aappleby\/smhasher\/blob\/master\/src\/MurmurHash3.cpp with\n\/\/ small adaptations for C++. Thanks!\n\n\/\/-----------------------------------------------------------------------------\n\/\/ MurmurHash3 was written by Austin Appleby, and is placed in the public\n\/\/ domain.\n\n\/\/ Note - The x86 and x64 versions do _not_ produce the same results, as the\n\/\/ algorithms are optimized for their respective platforms. You can still\n\/\/ compile and run any of them on any platform, but your performance with the\n\/\/ non-native version will be less than optimal.\n\n\/\/-----------------------------------------------------------------------------\n\/\/ Platform-specific functions and macros\n\n\/\/ Microsoft Visual Studio\n\n#if defined(_MSC_VER)\n\n#define SPSL_FORCE_INLINE __forceinline\n\n#include <cstdlib>\n\n#define SPSL_ROTL32(x, y) _rotl(x, y)\n#define SPSL_ROTL64(x, y) _rotl64(x, y)\n\n#define SPSL_BIG_CONSTANT(x) (x)\n\n\/\/ Other compilers\n\n#else \/\/ defined(_MSC_VER)\n\n#define SPSL_FORCE_INLINE inline __attribute__((always_inline))\n\ninline uint32_t rotl32(uint32_t x, int8_t r)\n{\n return (x << r) | (x >> (32 - r));\n}\n\ninline uint64_t rotl64(uint64_t x, int8_t r)\n{\n return (x << r) | (x >> (64 - r));\n}\n\n#define SPSL_ROTL32(x, y) rotl32(x, y)\n#define SPSL_ROTL64(x, y) rotl64(x, y)\n\n#define SPSL_BIG_CONSTANT(x) (x##LLU)\n\n#endif \/\/ !defined(_MSC_VER)\n\n\/\/-----------------------------------------------------------------------------\n\/\/ Block read - if your platform needs to do endian-swapping or can only\n\/\/ handle aligned reads, do the conversion here\n\n\/*\n * For SPSL\/C++, we need aligned memory access - otherwise we run into undefined\n * behavior (due to the reinterpret_cast's below, and it's unclear if C-style\n * casts are better).\n * Benchmarks show that the memcpy version is slightly faster for 64 bit and has\n * no difference on 32 bit. So why not...?\n *\/\n\nSPSL_FORCE_INLINE uint32_t getblock32(const uint8_t* p, uint32_t i)\n{\n uint32_t result;\n memcpy(&result, p + i * sizeof(result), sizeof(result));\n return result;\n}\n\nSPSL_FORCE_INLINE uint64_t getblock64(const uint8_t* p, std::size_t i)\n{\n uint64_t result;\n memcpy(&result, p + i * sizeof(result), sizeof(result));\n return result;\n}\n\n\/\/-----------------------------------------------------------------------------\n\/\/ Finalization mix - force all bits of a hash block to avalanche\n\nSPSL_FORCE_INLINE uint32_t fmix32(uint32_t h)\n{\n h ^= h >> 16;\n h *= 0x85ebca6b;\n h ^= h >> 13;\n h *= 0xc2b2ae35;\n h ^= h >> 16;\n\n return h;\n}\n\n\/\/----------\n\nSPSL_FORCE_INLINE uint64_t fmix64(uint64_t k)\n{\n k ^= k >> 33;\n k *= SPSL_BIG_CONSTANT(0xff51afd7ed558ccd);\n k ^= k >> 33;\n k *= SPSL_BIG_CONSTANT(0xc4ceb9fe1a85ec53);\n k ^= k >> 33;\n\n return k;\n}\n\n\/\/-----------------------------------------------------------------------------\n\ninline void MurmurHash3_x86_32(const uint8_t* data, const uint32_t len, uint32_t seed,\n uint32_t& out)\n{\n const uint32_t nblocks = len \/ 4;\n\n uint32_t h1 = seed;\n\n const uint32_t c1 = 0xcc9e2d51;\n const uint32_t c2 = 0x1b873593;\n\n \/\/----------\n \/\/ body\n\n for (uint32_t i = 0; i < nblocks; ++i)\n {\n uint32_t k1 = getblock32(data, i);\n\n k1 *= c1;\n k1 = SPSL_ROTL32(k1, 15);\n k1 *= c2;\n\n h1 ^= k1;\n h1 = SPSL_ROTL32(h1, 13);\n h1 = h1 * 5 + 0xe6546b64;\n }\n\n \/\/----------\n \/\/ tail\n\n const uint8_t* tail = (data + nblocks * 4);\n\n uint32_t k1 = 0;\n\n switch (len & 3)\n {\n case 3:\n k1 ^= static_cast<uint32_t>(tail[2] << 16);\n \/* no break *\/\n case 2:\n k1 ^= static_cast<uint32_t>(tail[1] << 8);\n \/* no break *\/\n case 1:\n k1 ^= tail[0];\n k1 *= c1;\n k1 = SPSL_ROTL32(k1, 15);\n k1 *= c2;\n h1 ^= k1;\n };\n\n \/\/----------\n \/\/ finalization\n\n h1 ^= len;\n\n h1 = fmix32(h1);\n\n out = h1;\n}\n\n\/\/-----------------------------------------------------------------------------\n\ninline void MurmurHash3_x64_128(const uint8_t* data, const std::size_t len, const uint32_t seed,\n uint64_t& out1, uint64_t& out2)\n{\n const std::size_t nblocks = len \/ 16;\n\n uint64_t h1 = seed;\n uint64_t h2 = seed;\n\n const uint64_t c1 = SPSL_BIG_CONSTANT(0x87c37b91114253d5);\n const uint64_t c2 = SPSL_BIG_CONSTANT(0x4cf5ad432745937f);\n\n \/\/----------\n \/\/ body\n\n for (std::size_t i = 0; i < nblocks; i++)\n {\n uint64_t k1 = getblock64(data, i * 2 + 0);\n uint64_t k2 = getblock64(data, i * 2 + 1);\n\n k1 *= c1;\n k1 = SPSL_ROTL64(k1, 31);\n k1 *= c2;\n h1 ^= k1;\n\n h1 = SPSL_ROTL64(h1, 27);\n h1 += h2;\n h1 = h1 * 5 + 0x52dce729;\n\n k2 *= c2;\n k2 = SPSL_ROTL64(k2, 33);\n k2 *= c1;\n h2 ^= k2;\n\n h2 = SPSL_ROTL64(h2, 31);\n h2 += h1;\n h2 = h2 * 5 + 0x38495ab5;\n }\n\n \/\/----------\n \/\/ tail\n\n const uint8_t* tail = (data + nblocks * 16);\n\n uint64_t k1 = 0;\n uint64_t k2 = 0;\n\n switch (len & 15)\n {\n case 15:\n k2 ^= (static_cast<uint64_t>(tail[14])) << 48;\n \/* no break *\/\n case 14:\n k2 ^= (static_cast<uint64_t>(tail[13])) << 40;\n \/* no break *\/\n case 13:\n k2 ^= (static_cast<uint64_t>(tail[12])) << 32;\n \/* no break *\/\n case 12:\n k2 ^= (static_cast<uint64_t>(tail[11])) << 24;\n \/* no break *\/\n case 11:\n k2 ^= (static_cast<uint64_t>(tail[10])) << 16;\n \/* no break *\/\n case 10:\n k2 ^= (static_cast<uint64_t>(tail[9])) << 8;\n \/* no break *\/\n case 9:\n k2 ^= (static_cast<uint64_t>(tail[8])) << 0;\n k2 *= c2;\n k2 = SPSL_ROTL64(k2, 33);\n k2 *= c1;\n h2 ^= k2;\n \/* no break *\/\n\n case 8:\n k1 ^= (static_cast<uint64_t>(tail[7])) << 56;\n \/* no break *\/\n case 7:\n k1 ^= (static_cast<uint64_t>(tail[6])) << 48;\n \/* no break *\/\n case 6:\n k1 ^= (static_cast<uint64_t>(tail[5])) << 40;\n \/* no break *\/\n case 5:\n k1 ^= (static_cast<uint64_t>(tail[4])) << 32;\n \/* no break *\/\n case 4:\n k1 ^= (static_cast<uint64_t>(tail[3])) << 24;\n \/* no break *\/\n case 3:\n k1 ^= (static_cast<uint64_t>(tail[2])) << 16;\n \/* no break *\/\n case 2:\n k1 ^= (static_cast<uint64_t>(tail[1])) << 8;\n \/* no break *\/\n case 1:\n k1 ^= (static_cast<uint64_t>(tail[0])) << 0;\n k1 *= c1;\n k1 = SPSL_ROTL64(k1, 31);\n k1 *= c2;\n h1 ^= k1;\n };\n\n \/\/----------\n \/\/ finalization\n\n h1 ^= len;\n h2 ^= len;\n\n h1 += h2;\n h2 += h1;\n\n h1 = fmix64(h1);\n h2 = fmix64(h2);\n\n h1 += h2;\n h2 += h1;\n\n out1 = h1;\n out2 = h2;\n}\n\n\/\/-----------------------------------------------------------------------------\n}\n\nusing std::size_t;\n\ntemplate <size_t HashLength>\nsize_t hash_impl(const void* buffer, size_t len, uint32_t seed = 0);\n\n\/**\n * 32 bit hash function: This function shall be called on 32 bit x86.\n * @param[in] buffer the data to hash\n * @param[in] len the number of bytes in the buffer\n * @param[in] seed optional hash seed (warning: changing it alters the hash!)\n * @return 32 bit hash value\n *\/\ntemplate <>\ninline size_t hash_impl<32>(const void* buffer, size_t len, uint32_t seed)\n{\n uint32_t result = 0;\n murmurhash3::MurmurHash3_x86_32(reinterpret_cast<const uint8_t*>(buffer),\n static_cast<uint32_t>(len), seed, result);\n return result;\n}\n\n\/**\n * 64 bit hash function: This function shall be called on 64 bit x86_64.\n * @param[in] buffer the data to hash\n * @param[in] len the number of bytes in the buffer\n * @param[in] seed optional hash seed (warning: changing it alters the hash!)\n * @return 64 bit hash value\n *\/\ntemplate <>\ninline size_t hash_impl<64>(const void* buffer, size_t len, uint32_t seed)\n{\n uint64_t result[2];\n murmurhash3::MurmurHash3_x64_128(reinterpret_cast<const uint8_t*>(buffer), len, seed, result[0],\n result[1]);\n\n \/\/ ignore what we don't need...\n return result[0];\n}\n\n\/**\n * System-independent hash function: Call this function to hash something. Based on the current\n * platform, the matching hash function is called.\n * @param[in] buffer the data to hash\n * @param[in] len the number of bytes in the buffer\n * @param[in] seed optional hash seed (warning: changing it alters the hash!)\n * @return the calculated hash\n *\/\ninline std::size_t hash_impl(const void* buffer, size_t len, uint32_t seed = 0)\n{\n return hash_impl<sizeof(size_t) * 8>(buffer, len, seed);\n}\n}\n}\n\n\n#endif \/* SPSL_HASH_HPP_ *\/\n<commit_msg>Fix missing size_t cast for Windows.<commit_after>\/**\n * @file Special Purpose Strings Library: hash\n * @author Daniel Evers\n * @brief Hashing implementation to enable std::hash specialization\n * @license MIT\n *\n * The hashing function is MurmurHash3, taken thankfully from https:\/\/github.com\/aappleby\/smhasher.\n * It provides a 32 bit hash and a 128 bit hash, but no 64 bit version. This is handled by using\n * the 128 bit hash and cutting it to 64 bit.\n *\n * The implementation was slightly modified to meat current C++ standards, fix type safety issues\n * and meat this library's guidelines.\n *\/\n\n#ifndef SPSL_HASH_HPP_\n#define SPSL_HASH_HPP_\n\n#include <cstdint>\n#include <cstring>\n\nnamespace spsl\n{\nnamespace hash\n{\nnamespace murmurhash3\n{\n\/\/ Copied from https:\/\/github.com\/aappleby\/smhasher\/blob\/master\/src\/MurmurHash3.cpp with\n\/\/ small adaptations for C++. Thanks!\n\n\/\/-----------------------------------------------------------------------------\n\/\/ MurmurHash3 was written by Austin Appleby, and is placed in the public\n\/\/ domain.\n\n\/\/ Note - The x86 and x64 versions do _not_ produce the same results, as the\n\/\/ algorithms are optimized for their respective platforms. You can still\n\/\/ compile and run any of them on any platform, but your performance with the\n\/\/ non-native version will be less than optimal.\n\n\/\/-----------------------------------------------------------------------------\n\/\/ Platform-specific functions and macros\n\n\/\/ Microsoft Visual Studio\n\n#if defined(_MSC_VER)\n\n#define SPSL_FORCE_INLINE __forceinline\n\n#include <cstdlib>\n\n#define SPSL_ROTL32(x, y) _rotl(x, y)\n#define SPSL_ROTL64(x, y) _rotl64(x, y)\n\n#define SPSL_BIG_CONSTANT(x) (x)\n\n\/\/ Other compilers\n\n#else \/\/ defined(_MSC_VER)\n\n#define SPSL_FORCE_INLINE inline __attribute__((always_inline))\n\ninline uint32_t rotl32(uint32_t x, int8_t r)\n{\n return (x << r) | (x >> (32 - r));\n}\n\ninline uint64_t rotl64(uint64_t x, int8_t r)\n{\n return (x << r) | (x >> (64 - r));\n}\n\n#define SPSL_ROTL32(x, y) rotl32(x, y)\n#define SPSL_ROTL64(x, y) rotl64(x, y)\n\n#define SPSL_BIG_CONSTANT(x) (x##LLU)\n\n#endif \/\/ !defined(_MSC_VER)\n\n\/\/-----------------------------------------------------------------------------\n\/\/ Block read - if your platform needs to do endian-swapping or can only\n\/\/ handle aligned reads, do the conversion here\n\n\/*\n * For SPSL\/C++, we need aligned memory access - otherwise we run into undefined\n * behavior (due to the reinterpret_cast's below, and it's unclear if C-style\n * casts are better).\n * Benchmarks show that the memcpy version is slightly faster for 64 bit and has\n * no difference on 32 bit. So why not...?\n *\/\n\nSPSL_FORCE_INLINE uint32_t getblock32(const uint8_t* p, uint32_t i)\n{\n uint32_t result;\n memcpy(&result, p + i * sizeof(result), sizeof(result));\n return result;\n}\n\nSPSL_FORCE_INLINE uint64_t getblock64(const uint8_t* p, std::size_t i)\n{\n uint64_t result;\n memcpy(&result, p + i * sizeof(result), sizeof(result));\n return result;\n}\n\n\/\/-----------------------------------------------------------------------------\n\/\/ Finalization mix - force all bits of a hash block to avalanche\n\nSPSL_FORCE_INLINE uint32_t fmix32(uint32_t h)\n{\n h ^= h >> 16;\n h *= 0x85ebca6b;\n h ^= h >> 13;\n h *= 0xc2b2ae35;\n h ^= h >> 16;\n\n return h;\n}\n\n\/\/----------\n\nSPSL_FORCE_INLINE uint64_t fmix64(uint64_t k)\n{\n k ^= k >> 33;\n k *= SPSL_BIG_CONSTANT(0xff51afd7ed558ccd);\n k ^= k >> 33;\n k *= SPSL_BIG_CONSTANT(0xc4ceb9fe1a85ec53);\n k ^= k >> 33;\n\n return k;\n}\n\n\/\/-----------------------------------------------------------------------------\n\ninline void MurmurHash3_x86_32(const uint8_t* data, const uint32_t len, uint32_t seed,\n uint32_t& out)\n{\n const uint32_t nblocks = len \/ 4;\n\n uint32_t h1 = seed;\n\n const uint32_t c1 = 0xcc9e2d51;\n const uint32_t c2 = 0x1b873593;\n\n \/\/----------\n \/\/ body\n\n for (uint32_t i = 0; i < nblocks; ++i)\n {\n uint32_t k1 = getblock32(data, i);\n\n k1 *= c1;\n k1 = SPSL_ROTL32(k1, 15);\n k1 *= c2;\n\n h1 ^= k1;\n h1 = SPSL_ROTL32(h1, 13);\n h1 = h1 * 5 + 0xe6546b64;\n }\n\n \/\/----------\n \/\/ tail\n\n const uint8_t* tail = (data + nblocks * 4);\n\n uint32_t k1 = 0;\n\n switch (len & 3)\n {\n case 3:\n k1 ^= static_cast<uint32_t>(tail[2] << 16);\n \/* no break *\/\n case 2:\n k1 ^= static_cast<uint32_t>(tail[1] << 8);\n \/* no break *\/\n case 1:\n k1 ^= tail[0];\n k1 *= c1;\n k1 = SPSL_ROTL32(k1, 15);\n k1 *= c2;\n h1 ^= k1;\n };\n\n \/\/----------\n \/\/ finalization\n\n h1 ^= len;\n\n h1 = fmix32(h1);\n\n out = h1;\n}\n\n\/\/-----------------------------------------------------------------------------\n\ninline void MurmurHash3_x64_128(const uint8_t* data, const std::size_t len, const uint32_t seed,\n uint64_t& out1, uint64_t& out2)\n{\n const std::size_t nblocks = len \/ 16;\n\n uint64_t h1 = seed;\n uint64_t h2 = seed;\n\n const uint64_t c1 = SPSL_BIG_CONSTANT(0x87c37b91114253d5);\n const uint64_t c2 = SPSL_BIG_CONSTANT(0x4cf5ad432745937f);\n\n \/\/----------\n \/\/ body\n\n for (std::size_t i = 0; i < nblocks; i++)\n {\n uint64_t k1 = getblock64(data, i * 2 + 0);\n uint64_t k2 = getblock64(data, i * 2 + 1);\n\n k1 *= c1;\n k1 = SPSL_ROTL64(k1, 31);\n k1 *= c2;\n h1 ^= k1;\n\n h1 = SPSL_ROTL64(h1, 27);\n h1 += h2;\n h1 = h1 * 5 + 0x52dce729;\n\n k2 *= c2;\n k2 = SPSL_ROTL64(k2, 33);\n k2 *= c1;\n h2 ^= k2;\n\n h2 = SPSL_ROTL64(h2, 31);\n h2 += h1;\n h2 = h2 * 5 + 0x38495ab5;\n }\n\n \/\/----------\n \/\/ tail\n\n const uint8_t* tail = (data + nblocks * 16);\n\n uint64_t k1 = 0;\n uint64_t k2 = 0;\n\n switch (len & 15)\n {\n case 15:\n k2 ^= (static_cast<uint64_t>(tail[14])) << 48;\n \/* no break *\/\n case 14:\n k2 ^= (static_cast<uint64_t>(tail[13])) << 40;\n \/* no break *\/\n case 13:\n k2 ^= (static_cast<uint64_t>(tail[12])) << 32;\n \/* no break *\/\n case 12:\n k2 ^= (static_cast<uint64_t>(tail[11])) << 24;\n \/* no break *\/\n case 11:\n k2 ^= (static_cast<uint64_t>(tail[10])) << 16;\n \/* no break *\/\n case 10:\n k2 ^= (static_cast<uint64_t>(tail[9])) << 8;\n \/* no break *\/\n case 9:\n k2 ^= (static_cast<uint64_t>(tail[8])) << 0;\n k2 *= c2;\n k2 = SPSL_ROTL64(k2, 33);\n k2 *= c1;\n h2 ^= k2;\n \/* no break *\/\n\n case 8:\n k1 ^= (static_cast<uint64_t>(tail[7])) << 56;\n \/* no break *\/\n case 7:\n k1 ^= (static_cast<uint64_t>(tail[6])) << 48;\n \/* no break *\/\n case 6:\n k1 ^= (static_cast<uint64_t>(tail[5])) << 40;\n \/* no break *\/\n case 5:\n k1 ^= (static_cast<uint64_t>(tail[4])) << 32;\n \/* no break *\/\n case 4:\n k1 ^= (static_cast<uint64_t>(tail[3])) << 24;\n \/* no break *\/\n case 3:\n k1 ^= (static_cast<uint64_t>(tail[2])) << 16;\n \/* no break *\/\n case 2:\n k1 ^= (static_cast<uint64_t>(tail[1])) << 8;\n \/* no break *\/\n case 1:\n k1 ^= (static_cast<uint64_t>(tail[0])) << 0;\n k1 *= c1;\n k1 = SPSL_ROTL64(k1, 31);\n k1 *= c2;\n h1 ^= k1;\n };\n\n \/\/----------\n \/\/ finalization\n\n h1 ^= len;\n h2 ^= len;\n\n h1 += h2;\n h2 += h1;\n\n h1 = fmix64(h1);\n h2 = fmix64(h2);\n\n h1 += h2;\n h2 += h1;\n\n out1 = h1;\n out2 = h2;\n}\n\n\/\/-----------------------------------------------------------------------------\n}\n\nusing std::size_t;\n\ntemplate <size_t HashLength>\nsize_t hash_impl(const void* buffer, size_t len, uint32_t seed = 0);\n\n\/**\n * 32 bit hash function: This function shall be called on 32 bit x86.\n * @param[in] buffer the data to hash\n * @param[in] len the number of bytes in the buffer\n * @param[in] seed optional hash seed (warning: changing it alters the hash!)\n * @return 32 bit hash value\n *\/\ntemplate <>\ninline size_t hash_impl<32>(const void* buffer, size_t len, uint32_t seed)\n{\n uint32_t result = 0;\n murmurhash3::MurmurHash3_x86_32(reinterpret_cast<const uint8_t*>(buffer),\n static_cast<uint32_t>(len), seed, result);\n return result;\n}\n\n\/**\n * 64 bit hash function: This function shall be called on 64 bit x86_64.\n * @param[in] buffer the data to hash\n * @param[in] len the number of bytes in the buffer\n * @param[in] seed optional hash seed (warning: changing it alters the hash!)\n * @return 64 bit hash value\n *\/\ntemplate <>\ninline size_t hash_impl<64>(const void* buffer, size_t len, uint32_t seed)\n{\n uint64_t result[2];\n murmurhash3::MurmurHash3_x64_128(reinterpret_cast<const uint8_t*>(buffer), len, seed, result[0],\n result[1]);\n\n \/\/ ignore what we don't need...\n return static_cast<size_t>(result[0]);\n}\n\n\/**\n * System-independent hash function: Call this function to hash something. Based on the current\n * platform, the matching hash function is called.\n * @param[in] buffer the data to hash\n * @param[in] len the number of bytes in the buffer\n * @param[in] seed optional hash seed (warning: changing it alters the hash!)\n * @return the calculated hash\n *\/\ninline std::size_t hash_impl(const void* buffer, size_t len, uint32_t seed = 0)\n{\n return hash_impl<sizeof(size_t) * 8>(buffer, len, seed);\n}\n}\n}\n\n\n#endif \/* SPSL_HASH_HPP_ *\/\n<|endoftext|>"} {"text":"<commit_before><commit_msg>Revert \"remove unused SvRefBase constructor\"<commit_after><|endoftext|>"} {"text":"<commit_before>\/\/----------------------------------------------------------------------------\n\/\/\/ \\file meta.hpp\n\/\/\/ \\author Serge Aleynikov\n\/\/----------------------------------------------------------------------------\n\/\/\/ \\brief This file contains some generic metaprogramming functions.\n\/\/----------------------------------------------------------------------------\n\/\/ Copyright (c) 2010 Serge Aleynikov <saleyn@gmail.com>\n\/\/ Created: 2010-09-31\n\/\/----------------------------------------------------------------------------\n\/*\n***** BEGIN LICENSE BLOCK *****\n\nThis file is part of the utxx open-source project.\n\nCopyright (C) 2010 Serge Aleynikov <saleyn@gmail.com>\n\nThis library is free software; you can redistribute it and\/or\nmodify it under the terms of the GNU Lesser General Public\nLicense as published by the Free Software Foundation; either\nversion 2.1 of the License, or (at your option) any later version.\n\nThis library is distributed in the hope that it will be useful,\nbut WITHOUT ANY WARRANTY; without even the implied warranty of\nMERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU\nLesser General Public License for more details.\n\nYou should have received a copy of the GNU Lesser General Public\nLicense along with this library; if not, write to the Free Software\nFoundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA\n\n***** END LICENSE BLOCK *****\n*\/\n#pragma once\n\n#include <cstddef>\n\n#include <type_traits>\n#include <tuple>\n#include <utility>\n\nnamespace utxx {\n\ntemplate <size_t N, size_t Base>\nstruct log {\n static const size_t value = 1 + log<N \/ Base, Base>::value;\n};\n\ntemplate <size_t Base> struct log<1, Base> { static const size_t value = 0; };\ntemplate <size_t Base> struct log<0, Base>;\n\ntemplate <size_t N, size_t Power>\nstruct pow {\n static const size_t value = N * pow<N, Power - 1>::value;\n};\n\ntemplate <size_t N> struct pow<N, 0> { static const size_t value = 1; };\ntemplate <size_t Power> struct pow<0, Power> { static const size_t value = 0; };\n\n\/\/\/ Computes the smallest power of \\a base equal or greater than number \\a n.\ntemplate <size_t N, size_t Base>\nclass upper_power {\n static const size_t s_log = log<N,Base>::value;\n static const size_t s_pow = pow<Base,s_log>::value;\npublic:\n static const size_t value = s_pow == N ? N : s_pow*Base;\n};\n\n\/\/ We need specialisation of \"upper_power\" for N=0, because the log cannot be\n\/\/ computed in that case (as required in the generic case above). The result\n\/\/ is 0 in this case (the corresp exponent of Base is \"-oo\") (XXX: even if\n\/\/ Base==0):\ntemplate<size_t Base>\nclass upper_power<0, Base> {\npublic:\n static const size_t value = 0;\n};\n\ntemplate <size_t N>\nusing upper_power2 = upper_power<N, 2>;\n\n\/\/\/ Given the size N and alignment size get the number of padding and aligned \n\/\/\/ space needed to hold the structure of N bytes.\ntemplate<int N, int Size>\nclass align {\n static const int multiplier = Size \/ N;\n static const int remainder = Size % N;\npublic:\n static const int size = remainder > 0 ? (multiplier+1) * N : Size;\n static const int padding = size - Size;\n};\n\n\/\/\/ Check if \\a T and \\a U are the same types by stripping T's ref and cv-qualifiers\n\/\/\/ \\code\n\/\/\/ \/\/ All following expressions return true:\n\/\/\/ std::cout << std::boolalpha\n\/\/\/ << is_same_decayed<int, int>::value << '\\n'\n\/\/\/ << is_same_decayed<int&, int>::value << '\\n'\n\/\/\/ << is_same_decayed<int&&, int>::value << '\\n'\n\/\/\/ << is_same_decayed<const int&, int>::value << '\\n'\n\/\/\/ << is_same_decayed<int[2], int*>::value << '\\n'\n\/\/\/ << is_same_decayed<int(int), int(*)(int)>::value << '\\n';\n\/\/\/ \\endcode\ntemplate <typename T, typename U>\nstruct is_same_decayed : std::is_same<typename std::decay<T>::type, U>::type\n{};\n\n\/\/\/ Convert strongly typed enum to underlying type\n\/\/\/ \\code\n\/\/\/ enum class B { B1 = 1, B2 = 2 };\n\/\/\/ std::cout << utxx::to_underlying(B::B2) << std::endl;\n\/\/\/ \\endcode\ntemplate <typename E>\nconstexpr typename std::underlying_type<E>::type to_underlying(E e) {\n return static_cast<typename std::underlying_type<E>::type>(e);\n}\n\n\/\/\/ Syntactic sugar that evaluates to type \\a T if \\a T is derived from \\a BaseT\ntemplate <typename BaseT, typename T, typename R = T>\nusing if_base_of = typename std::enable_if<std::is_base_of<BaseT, T>::value, R>::type;\n\n\/\/\/ Syntactic sugar that evaluates to type \\a T if \\a T is not derived from \\a BaseT\ntemplate <typename BaseT, typename T, typename R = T>\nusing if_not_base_of = typename std::enable_if<!std::is_base_of<BaseT, T>::value, R>::type;\n\nnamespace {\n template<int N, char... Chars>\n struct to_int_helper;\n\n template<int N, char C>\n struct to_int_helper<N, C> {\n static const size_t value = ((size_t)C) << (8*N);\n };\n\n template <int N, char C, char... Tail>\n struct to_int_helper<N, C, Tail...> {\n static const size_t value =\n ((size_t)C) << (8*N) | to_int_helper<N-1, Tail...>::value;\n };\n}\n\n\/\/\/ Convert list of chars to integer (up to 8 bytes).\n\/\/\/ I.e. to_int<'A','B','C','Z'>::value() is a compile-time equivalent of\n\/\/\/ size_t(\"ABCZ\\0\\0\\0\\0\"). This type of value can be quickly used in switch\n\/\/\/ statements instead of doing string comparisons.\ntemplate <char... Chars>\nstruct to_int {\n static constexpr size_t value() {\n static_assert(sizeof...(Chars) <= 8, \"Invalid size!\");\n return to_int_helper<(sizeof...(Chars))-1, Chars...>::value;\n }\n};\n\n\/\/ For generic types, directly use the result of the signature of its 'operator()'\ntemplate <typename T>\nstruct function_traits : public function_traits<decltype(&T::operator())>\n{};\n\n\/\/ Specialization for pointers to member function\ntemplate <typename ClassType, typename ReturnType, typename... Args>\nstruct function_traits<ReturnType(ClassType::*)(Args...) const>\n{\n \/\/\/ Arity is the number of arguments\n enum { arity = sizeof...(Args) };\n\n typedef ReturnType result_type;\n typedef std::tuple<Args...> args_tuple;\n\n template <size_t i>\n struct arg\n {\n \/\/ the i-th argument is equivalent to the i-th tuple element of a tuple\n \/\/ composed of those arguments.\n typedef typename std::tuple_element<i, std::tuple<Args...>>::type type;\n };\n};\n\n\/\/------------------------------------------------------------------------------\n\/\/\/ Extract the last type in a parameter pack\n\/\/------------------------------------------------------------------------------\n\/\/\/ Usage example:\n\/\/\/ \\code\n\/\/\/ struct S\n\/\/\/ {\n\/\/\/ \/\/ Accept variadic arguments so long as the last argument type is an int\n\/\/\/ template <\n\/\/\/ typename... T,\n\/\/\/ typename = typename std::enable_if<\n\/\/\/ std::is_same<int, typename last_type<T...>::type>>::type>\n\/\/\/ S(T...);\n\/\/\/ };\n\/\/\/ \\endcode\n\/\/------------------------------------------------------------------------------\n\/\/ 0, the empty pack has no last type (only called if 1 and 2+ don't match)\ntemplate<typename... Ts>\nstruct last_type {};\n\n\/\/ 2+ in pack, recurse:\ntemplate<typename T0, typename T1, typename... Ts>\nstruct last_type<T0, T1, Ts...> : last_type<T1, Ts...> {};\n\n\/\/ Length 1, last type is only type:\ntemplate<typename T0>\nstruct last_type<T0> { using type = T0; };\n\n\/\/-----------------------------------------------------------------------------\n\/\/\/ Evaluation of anything\n\/\/-----------------------------------------------------------------------------\n\/\/ functions, functors, lambdas, etc.\ntemplate<\n class F, class... Args,\n class = typename std::enable_if<!std::is_member_function_pointer<F>::value>::type,\n class = typename std::enable_if<!std::is_member_object_pointer<F>::value>::type\n >\nauto eval(F&& f, Args&&... args) -> decltype(f(std::forward<Args>(args)...))\n{\n return f(std::forward<Args>(args)...);\n}\n\n\/\/ const member function\ntemplate<class R, class C, class... Args>\nauto eval(R(C::*f)() const, const C& c, Args&&... args) -> R\n{\n return (c.*f)(std::forward<Args>(args)...);\n}\n\ntemplate<class R, class C, class... Args>\nauto eval(R(C::*f)() const, C& c, Args&&... args) -> R\n{\n return (c.*f)(std::forward<Args>(args)...);\n}\n\n\/\/ non-const member function\ntemplate<class R, class C, class... Args>\nauto eval(R(C::*f)(), C& c, Args&&... args) -> R\n{\n return (c.*f)(std::forward<Args>(args)...);\n}\n\n\/\/ member object\ntemplate<class R, class C>\nauto eval(R(C::*m), const C& c) -> const R&\n{\n return c.*m;\n}\n\ntemplate<class R, class C>\nauto eval(R(C::*m), C& c) -> R&\n{\n return c.*m;\n}\n\n\/\/-----------------------------------------------------------------------------\n\/\/\/ Check that a tuple has a given type\n\/\/\/ Example:\n\/\/\/ ```\n\/\/\/ if (has_type<SomeT, std::tuple<int, uint, bool>>::value) return;\n\/\/\/ ```\n\/\/-----------------------------------------------------------------------------\ntemplate <typename T, typename Tuple>\nstruct has_type;\n\ntemplate <typename T>\nstruct has_type<T, std::tuple<>> : std::false_type {};\n\ntemplate <typename T, typename U, typename... Ts>\nstruct has_type<T, std::tuple<U, Ts...>> : has_type<T, std::tuple<Ts...>> {};\n\ntemplate <typename T, typename... Ts>\nstruct has_type<T, std::tuple<T, Ts...>> : std::true_type {};\n\n\/\/-----------------------------------------------------------------------------\n\/\/\/ Same as has_type but ignores const\/volatile\/reference decorators.\n\/\/\/ Example:\n\/\/\/ ```\n\/\/\/ if (has_type_nocvref<SomeT, std::tuple<int, uint, bool>>::value) return;\n\/\/\/ ```\n\/\/-----------------------------------------------------------------------------\ntemplate <typename T, typename... Ts>\nstruct has_type_nocvref\n : has_type<\n typename std::remove_cv<typename std::remove_reference<T>::type>::type,\n Ts...\n >\n{};\n\n\/\/-----------------------------------------------------------------------------\n\/\/ Remove \"const\", \"volatile\", and reference (\"&\") operators from a type\n\/\/-----------------------------------------------------------------------------\ntemplate <typename T>\nstruct remove_cvref {\n using type = typename std::remove_cv<typename std::remove_reference<T>::type>::type;\n};\n\n\/\/-----------------------------------------------------------------------------\n\/\/ Check if two types are the same, ignore const, volatile, and ref modifiers\n\/\/-----------------------------------------------------------------------------\ntemplate <typename T, typename U>\nstatic constexpr const bool is_same() {\n return std::is_same<typename remove_cvref<T>::type, typename remove_cvref<U>::type>::value;\n};\n\n} \/\/ namespace utxx\n<commit_msg>Add remove_cvr_t<commit_after>\/\/----------------------------------------------------------------------------\n\/\/\/ \\file meta.hpp\n\/\/\/ \\author Serge Aleynikov\n\/\/----------------------------------------------------------------------------\n\/\/\/ \\brief This file contains some generic metaprogramming functions.\n\/\/----------------------------------------------------------------------------\n\/\/ Copyright (c) 2010 Serge Aleynikov <saleyn@gmail.com>\n\/\/ Created: 2010-09-31\n\/\/----------------------------------------------------------------------------\n\/*\n***** BEGIN LICENSE BLOCK *****\n\nThis file is part of the utxx open-source project.\n\nCopyright (C) 2010 Serge Aleynikov <saleyn@gmail.com>\n\nThis library is free software; you can redistribute it and\/or\nmodify it under the terms of the GNU Lesser General Public\nLicense as published by the Free Software Foundation; either\nversion 2.1 of the License, or (at your option) any later version.\n\nThis library is distributed in the hope that it will be useful,\nbut WITHOUT ANY WARRANTY; without even the implied warranty of\nMERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU\nLesser General Public License for more details.\n\nYou should have received a copy of the GNU Lesser General Public\nLicense along with this library; if not, write to the Free Software\nFoundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA\n\n***** END LICENSE BLOCK *****\n*\/\n#pragma once\n\n#include <cstddef>\n\n#include <type_traits>\n#include <tuple>\n#include <utility>\n\nnamespace utxx {\n\ntemplate <size_t N, size_t Base>\nstruct log {\n static const size_t value = 1 + log<N \/ Base, Base>::value;\n};\n\ntemplate <size_t Base> struct log<1, Base> { static const size_t value = 0; };\ntemplate <size_t Base> struct log<0, Base>;\n\ntemplate <size_t N, size_t Power>\nstruct pow {\n static const size_t value = N * pow<N, Power - 1>::value;\n};\n\ntemplate <size_t N> struct pow<N, 0> { static const size_t value = 1; };\ntemplate <size_t Power> struct pow<0, Power> { static const size_t value = 0; };\n\n\/\/\/ Computes the smallest power of \\a base equal or greater than number \\a n.\ntemplate <size_t N, size_t Base>\nclass upper_power {\n static const size_t s_log = log<N,Base>::value;\n static const size_t s_pow = pow<Base,s_log>::value;\npublic:\n static const size_t value = s_pow == N ? N : s_pow*Base;\n};\n\n\/\/ We need specialisation of \"upper_power\" for N=0, because the log cannot be\n\/\/ computed in that case (as required in the generic case above). The result\n\/\/ is 0 in this case (the corresp exponent of Base is \"-oo\") (XXX: even if\n\/\/ Base==0):\ntemplate<size_t Base>\nclass upper_power<0, Base> {\npublic:\n static const size_t value = 0;\n};\n\ntemplate <size_t N>\nusing upper_power2 = upper_power<N, 2>;\n\n\/\/\/ Given the size N and alignment size get the number of padding and aligned \n\/\/\/ space needed to hold the structure of N bytes.\ntemplate<int N, int Size>\nclass align {\n static const int multiplier = Size \/ N;\n static const int remainder = Size % N;\npublic:\n static const int size = remainder > 0 ? (multiplier+1) * N : Size;\n static const int padding = size - Size;\n};\n\n\/\/\/ Check if \\a T and \\a U are the same types by stripping T's ref and cv-qualifiers\n\/\/\/ \\code\n\/\/\/ \/\/ All following expressions return true:\n\/\/\/ std::cout << std::boolalpha\n\/\/\/ << is_same_decayed<int, int>::value << '\\n'\n\/\/\/ << is_same_decayed<int&, int>::value << '\\n'\n\/\/\/ << is_same_decayed<int&&, int>::value << '\\n'\n\/\/\/ << is_same_decayed<const int&, int>::value << '\\n'\n\/\/\/ << is_same_decayed<int[2], int*>::value << '\\n'\n\/\/\/ << is_same_decayed<int(int), int(*)(int)>::value << '\\n';\n\/\/\/ \\endcode\ntemplate <typename T, typename U>\nstruct is_same_decayed : std::is_same<typename std::decay<T>::type, U>::type\n{};\n\n\/\/\/ Convert strongly typed enum to underlying type\n\/\/\/ \\code\n\/\/\/ enum class B { B1 = 1, B2 = 2 };\n\/\/\/ std::cout << utxx::to_underlying(B::B2) << std::endl;\n\/\/\/ \\endcode\ntemplate <typename E>\nconstexpr typename std::underlying_type<E>::type to_underlying(E e) {\n return static_cast<typename std::underlying_type<E>::type>(e);\n}\n\n\/\/\/ Syntactic sugar that evaluates to type \\a T if \\a T is derived from \\a BaseT\ntemplate <typename BaseT, typename T, typename R = T>\nusing if_base_of = typename std::enable_if<std::is_base_of<BaseT, T>::value, R>::type;\n\n\/\/\/ Syntactic sugar that evaluates to type \\a T if \\a T is not derived from \\a BaseT\ntemplate <typename BaseT, typename T, typename R = T>\nusing if_not_base_of = typename std::enable_if<!std::is_base_of<BaseT, T>::value, R>::type;\n\nnamespace {\n template<int N, char... Chars>\n struct to_int_helper;\n\n template<int N, char C>\n struct to_int_helper<N, C> {\n static const size_t value = ((size_t)C) << (8*N);\n };\n\n template <int N, char C, char... Tail>\n struct to_int_helper<N, C, Tail...> {\n static const size_t value =\n ((size_t)C) << (8*N) | to_int_helper<N-1, Tail...>::value;\n };\n}\n\n\/\/\/ Convert list of chars to integer (up to 8 bytes).\n\/\/\/ I.e. to_int<'A','B','C','Z'>::value() is a compile-time equivalent of\n\/\/\/ size_t(\"ABCZ\\0\\0\\0\\0\"). This type of value can be quickly used in switch\n\/\/\/ statements instead of doing string comparisons.\ntemplate <char... Chars>\nstruct to_int {\n static constexpr size_t value() {\n static_assert(sizeof...(Chars) <= 8, \"Invalid size!\");\n return to_int_helper<(sizeof...(Chars))-1, Chars...>::value;\n }\n};\n\n\/\/ For generic types, directly use the result of the signature of its 'operator()'\ntemplate <typename T>\nstruct function_traits : public function_traits<decltype(&T::operator())>\n{};\n\n\/\/ Specialization for pointers to member function\ntemplate <typename ClassType, typename ReturnType, typename... Args>\nstruct function_traits<ReturnType(ClassType::*)(Args...) const>\n{\n \/\/\/ Arity is the number of arguments\n enum { arity = sizeof...(Args) };\n\n typedef ReturnType result_type;\n typedef std::tuple<Args...> args_tuple;\n\n template <size_t i>\n struct arg\n {\n \/\/ the i-th argument is equivalent to the i-th tuple element of a tuple\n \/\/ composed of those arguments.\n typedef typename std::tuple_element<i, std::tuple<Args...>>::type type;\n };\n};\n\n\/\/------------------------------------------------------------------------------\n\/\/\/ Extract the last type in a parameter pack\n\/\/------------------------------------------------------------------------------\n\/\/\/ Usage example:\n\/\/\/ \\code\n\/\/\/ struct S\n\/\/\/ {\n\/\/\/ \/\/ Accept variadic arguments so long as the last argument type is an int\n\/\/\/ template <\n\/\/\/ typename... T,\n\/\/\/ typename = typename std::enable_if<\n\/\/\/ std::is_same<int, typename last_type<T...>::type>>::type>\n\/\/\/ S(T...);\n\/\/\/ };\n\/\/\/ \\endcode\n\/\/------------------------------------------------------------------------------\n\/\/ 0, the empty pack has no last type (only called if 1 and 2+ don't match)\ntemplate<typename... Ts>\nstruct last_type {};\n\n\/\/ 2+ in pack, recurse:\ntemplate<typename T0, typename T1, typename... Ts>\nstruct last_type<T0, T1, Ts...> : last_type<T1, Ts...> {};\n\n\/\/ Length 1, last type is only type:\ntemplate<typename T0>\nstruct last_type<T0> { using type = T0; };\n\n\/\/-----------------------------------------------------------------------------\n\/\/\/ Evaluation of anything\n\/\/-----------------------------------------------------------------------------\n\/\/ functions, functors, lambdas, etc.\ntemplate<\n class F, class... Args,\n class = typename std::enable_if<!std::is_member_function_pointer<F>::value>::type,\n class = typename std::enable_if<!std::is_member_object_pointer<F>::value>::type\n >\nauto eval(F&& f, Args&&... args) -> decltype(f(std::forward<Args>(args)...))\n{\n return f(std::forward<Args>(args)...);\n}\n\n\/\/ const member function\ntemplate<class R, class C, class... Args>\nauto eval(R(C::*f)() const, const C& c, Args&&... args) -> R\n{\n return (c.*f)(std::forward<Args>(args)...);\n}\n\ntemplate<class R, class C, class... Args>\nauto eval(R(C::*f)() const, C& c, Args&&... args) -> R\n{\n return (c.*f)(std::forward<Args>(args)...);\n}\n\n\/\/ non-const member function\ntemplate<class R, class C, class... Args>\nauto eval(R(C::*f)(), C& c, Args&&... args) -> R\n{\n return (c.*f)(std::forward<Args>(args)...);\n}\n\n\/\/ member object\ntemplate<class R, class C>\nauto eval(R(C::*m), const C& c) -> const R&\n{\n return c.*m;\n}\n\ntemplate<class R, class C>\nauto eval(R(C::*m), C& c) -> R&\n{\n return c.*m;\n}\n\n\/\/-----------------------------------------------------------------------------\n\/\/\/ Check that a tuple has a given type\n\/\/\/ Example:\n\/\/\/ ```\n\/\/\/ if (has_type<SomeT, std::tuple<int, uint, bool>>::value) return;\n\/\/\/ ```\n\/\/-----------------------------------------------------------------------------\ntemplate <typename T, typename Tuple>\nstruct has_type;\n\ntemplate <typename T>\nstruct has_type<T, std::tuple<>> : std::false_type {};\n\ntemplate <typename T, typename U, typename... Ts>\nstruct has_type<T, std::tuple<U, Ts...>> : has_type<T, std::tuple<Ts...>> {};\n\ntemplate <typename T, typename... Ts>\nstruct has_type<T, std::tuple<T, Ts...>> : std::true_type {};\n\n\/\/-----------------------------------------------------------------------------\n\/\/\/ Same as has_type but ignores const\/volatile\/reference decorators.\n\/\/\/ Example:\n\/\/\/ ```\n\/\/\/ if (has_type_nocvref<SomeT, std::tuple<int, uint, bool>>::value) return;\n\/\/\/ ```\n\/\/-----------------------------------------------------------------------------\ntemplate <typename T, typename... Ts>\nstruct has_type_nocvref\n : has_type<\n typename std::remove_cv<typename std::remove_reference<T>::type>::type,\n Ts...\n >\n{};\n\n\/\/-----------------------------------------------------------------------------\n\/\/\/ Remove \"const\", \"volatile\", and reference (\"&\") operators from a type\n\/\/-----------------------------------------------------------------------------\ntemplate <typename T>\nstruct remove_cvref {\n using type = typename std::remove_cv<typename std::remove_reference<T>::type>::type;\n};\n\n\/\/-----------------------------------------------------------------------------\n\/\/\/ Remove \"const\", \"volatile\", and reference (\"&\") operators from a type\n\/\/-----------------------------------------------------------------------------\ntemplate< class T>\nusing remove_cvr_t = typename remove_cvref<T>::type;\n\n\/\/-----------------------------------------------------------------------------\n\/\/ Check if two types are the same, ignore const, volatile, and ref modifiers\n\/\/-----------------------------------------------------------------------------\ntemplate <typename T, typename U>\nstatic constexpr const bool is_same() {\n return std::is_same<typename remove_cvref<T>::type, typename remove_cvref<U>::type>::value;\n};\n\n} \/\/ namespace utxx\n<|endoftext|>"} {"text":"<commit_before>\/***********************************************************************\n filename: CEGUITooltip.cpp\n created: 21\/2\/2005\n author: Paul D Turner\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\/widgets\/Tooltip.h\"\n#include \"CEGUI\/Logger.h\"\n#include \"CEGUI\/Font.h\"\n#include \"CEGUI\/Image.h\"\n\n\/\/ Start of CEGUI namespace section\nnamespace CEGUI\n{\n const String Tooltip::WidgetTypeName(\"CEGUI\/Tooltip\");\n\n \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n \/\/ Event name constants\n const String Tooltip::EventNamespace(\"Tooltip\");\n const String Tooltip::EventHoverTimeChanged(\"HoverTimeChanged\");\n const String Tooltip::EventDisplayTimeChanged(\"DisplayTimeChanged\");\n const String Tooltip::EventFadeTimeChanged(\"FadeTimeChanged\");\n const String Tooltip::EventTooltipActive(\"TooltipActive\");\n const String Tooltip::EventTooltipInactive(\"TooltipInactive\");\n const String Tooltip::EventTooltipTransition(\"TooltipTransition\");\n \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n \/*************************************************************************\n TooltipWindowRenderer\n *************************************************************************\/\n TooltipWindowRenderer::TooltipWindowRenderer(const String& name) :\n WindowRenderer(name, Tooltip::EventNamespace)\n {\n }\n\n \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n Tooltip::Tooltip(const String& type, const String& name) :\n Window(type, name),\n\n d_hoverTime(0.4f),\n d_displayTime(7.5f),\n d_inPositionSelf(false)\n {\n addTooltipProperties();\n\n setClippedByParent(false);\n setDestroyedByParent(false);\n setAlwaysOnTop(true);\n \n \/\/ we need updates even when not visible\n setUpdateMode(WUM_ALWAYS);\n\n switchToInactiveState();\n }\n\n Tooltip::~Tooltip(void)\n {}\n\n void Tooltip::positionSelf(void)\n {\n \/\/ no recusion allowed for this function!\n if (d_inPositionSelf)\n return;\n\n d_inPositionSelf = true;\n\n MouseCursor& cursor = getGUIContext().getMouseCursor();\n Rectf screen(Vector2f(0, 0), getRootContainerSize());\n Rectf tipRect(getUnclippedOuterRect().get());\n const Image* mouseImage = cursor.getImage();\n\n Vector2f mousePos(cursor.getPosition());\n Sizef mouseSz(0,0);\n\n if (mouseImage)\n {\n mouseSz = mouseImage->getRenderedSize();\n }\n\n Vector2f tmpPos(mousePos.d_x + mouseSz.d_width, mousePos.d_y + mouseSz.d_height);\n tipRect.setPosition(tmpPos);\n\n \/\/ if tooltip would be off the right of the screen,\n \/\/ reposition to the other side of the mouse cursor.\n if (screen.right() < tipRect.right())\n {\n tmpPos.d_x = mousePos.d_x - tipRect.getWidth() - 5;\n }\n\n \/\/ if tooltip would be off the bottom of the screen,\n \/\/ reposition to the other side of the mouse cursor.\n if (screen.bottom() < tipRect.bottom())\n {\n tmpPos.d_y = mousePos.d_y - tipRect.getHeight() - 5;\n }\n\n \/\/ set final position of tooltip window.\n setPosition(\n UVector2(cegui_absdim(tmpPos.d_x),\n cegui_absdim(tmpPos.d_y)));\n\n d_inPositionSelf = false;\n }\n\n void Tooltip::sizeSelf(void)\n {\n Sizef textSize(getTextSize());\n\n setSize(USize(cegui_absdim(textSize.d_width),\n cegui_absdim(textSize.d_height)));\n }\n\n void Tooltip::setTargetWindow(Window* wnd)\n {\n if (!wnd)\n {\n d_target = wnd;\n }\n else if (wnd != this)\n {\n if (d_target != wnd)\n {\n getGUIContext().getRootWindow()->addChild(this);\n d_target = wnd;\n }\n\n \/\/ set text to that of the tooltip text of the target\n setText(wnd->getTooltipText());\n\n \/\/ set size and position of the tooltip window.\n sizeSelf();\n positionSelf();\n }\n\n resetTimer();\n\n if (d_active)\n {\n WindowEventArgs args(this);\n onTooltipTransition(args);\n }\n }\n\n const Window* Tooltip::getTargetWindow()\n {\n return d_target;\n }\n\n Sizef Tooltip::getTextSize() const\n {\n if (d_windowRenderer != 0)\n {\n TooltipWindowRenderer* wr = (TooltipWindowRenderer*)d_windowRenderer;\n return wr->getTextSize();\n }\n else\n {\n return getTextSize_impl();\n }\n }\n\n Sizef Tooltip::getTextSize_impl() const\n {\n const RenderedString& rs(getRenderedString());\n Sizef sz(0.0f, 0.0f);\n\n for (size_t i = 0; i < rs.getLineCount(); ++i)\n {\n const Sizef line_sz(rs.getPixelSize(i));\n sz.d_height += line_sz.d_height;\n\n if (line_sz.d_width > sz.d_width)\n sz.d_width = line_sz.d_width;\n }\n\n return sz;\n }\n\n void Tooltip::resetTimer(void)\n {\n d_elapsed = 0;\n }\n\n float Tooltip::getHoverTime(void) const\n {\n return d_hoverTime;\n }\n\n void Tooltip::setHoverTime(float seconds)\n {\n if (d_hoverTime != seconds)\n {\n d_hoverTime = seconds;\n\n WindowEventArgs args(this);\n onHoverTimeChanged(args);\n }\n }\n\n float Tooltip::getDisplayTime(void) const\n {\n return d_displayTime;\n }\n\n void Tooltip::setDisplayTime(float seconds)\n {\n if (d_displayTime != seconds)\n {\n d_displayTime = seconds;\n\n WindowEventArgs args(this);\n onDisplayTimeChanged(args);\n }\n }\n\n void Tooltip::doActiveState(float elapsed)\n {\n \/\/ if no target, switch immediately to inactive state.\n if (!d_target || d_target->getTooltipText().empty())\n {\n \/\/ hide immediately since the text is empty\n hide();\n\n switchToInactiveState();\n }\n \/\/ else see if display timeout has been reached\n else if ((d_displayTime > 0) && ((d_elapsed += elapsed) >= d_displayTime))\n {\n \/\/ display time is up, switch states\n switchToInactiveState();\n }\n }\n\n void Tooltip::doInactiveState(float elapsed)\n {\n if (d_target && !d_target->getTooltipText().empty() && ((d_elapsed += elapsed) >= d_hoverTime))\n {\n switchToActiveState();\n }\n }\n\n void Tooltip::switchToInactiveState(void)\n {\n d_active = false;\n d_elapsed = 0;\n\n \/\/ fire event before target gets reset in case that information is required in handler.\n WindowEventArgs args(this);\n onTooltipInactive(args);\n\n d_target = 0;\n }\n\n void Tooltip::switchToActiveState(void)\n {\n positionSelf();\n show();\n\n d_active = true;\n d_elapsed = 0;\n\n WindowEventArgs args(this);\n onTooltipActive(args);\n }\n\n bool Tooltip::validateWindowRenderer(const WindowRenderer* renderer) const\n\t{\n\t\treturn dynamic_cast<const TooltipWindowRenderer*>(renderer) != 0;\n\t}\n\n void Tooltip::updateSelf(float elapsed)\n {\n \/\/ base class processing.\n Window::updateSelf(elapsed);\n\n \/\/ do something based upon current Tooltip state.\n if (d_active)\n {\n doActiveState(elapsed);\n }\n else\n {\n doInactiveState(elapsed);\n }\n }\n\n void Tooltip::addTooltipProperties(void)\n {\n const String& propertyOrigin = WidgetTypeName;\n\n CEGUI_DEFINE_PROPERTY(Tooltip, float,\n \"HoverTime\", \"Property to get\/set the hover timeout value in seconds. Value is a float.\",\n &Tooltip::setHoverTime, &Tooltip::getHoverTime, 0.4f\n );\n\n CEGUI_DEFINE_PROPERTY(Tooltip, float,\n \"DisplayTime\", \"Property to get\/set the display timeout value in seconds. Value is a float.\",\n &Tooltip::setDisplayTime, &Tooltip::getDisplayTime, 7.5f\n );\n }\n\n void Tooltip::onHidden(WindowEventArgs& e)\n {\n Window::onHidden(e);\n\n \/\/ The animation will take care of fade out or whatnot,\n \/\/ at the end it will hide the tooltip to let us know the transition\n \/\/ is done. At this point we will remove the tooltip from the\n \/\/ previous parent.\n\n \/\/ NOTE: There has to be a fadeout animation! Even if it's a 0 second\n \/\/ immediate hide animation.\n\n if (getParent())\n {\n getParent()->removeChild(this);\n }\n }\n\n void Tooltip::onMouseEnters(MouseEventArgs& e)\n {\n positionSelf();\n\n Window::onMouseEnters(e);\n }\n\n void Tooltip::onTextChanged(WindowEventArgs& e)\n {\n \/\/ base class processing\n Window::onTextChanged(e);\n\n \/\/ set size and position of the tooltip window to consider new text\n sizeSelf();\n positionSelf();\n\n \/\/ we do not signal we handled it, in case user wants to hear\n \/\/ about text changes too.\n }\n\n void Tooltip::onHoverTimeChanged(WindowEventArgs& e)\n {\n fireEvent(EventHoverTimeChanged, e, EventNamespace);\n }\n\n void Tooltip::onDisplayTimeChanged(WindowEventArgs& e)\n {\n fireEvent(EventDisplayTimeChanged, e, EventNamespace);\n }\n\n void Tooltip::onTooltipActive(WindowEventArgs& e)\n {\n fireEvent(EventTooltipActive, e, EventNamespace);\n }\n\n void Tooltip::onTooltipInactive(WindowEventArgs& e)\n {\n fireEvent(EventTooltipInactive, e, EventNamespace);\n }\n\n void Tooltip::onTooltipTransition(WindowEventArgs& e)\n {\n fireEvent(EventTooltipTransition, e, EventNamespace);\n }\n} \/\/ End of CEGUI namespace section\n<commit_msg>FIX: Be sure to add ourselves to the right GUIContext root.<commit_after>\/***********************************************************************\n filename: CEGUITooltip.cpp\n created: 21\/2\/2005\n author: Paul D Turner\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\/widgets\/Tooltip.h\"\n#include \"CEGUI\/Logger.h\"\n#include \"CEGUI\/Font.h\"\n#include \"CEGUI\/Image.h\"\n\n\/\/ Start of CEGUI namespace section\nnamespace CEGUI\n{\n const String Tooltip::WidgetTypeName(\"CEGUI\/Tooltip\");\n\n \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n \/\/ Event name constants\n const String Tooltip::EventNamespace(\"Tooltip\");\n const String Tooltip::EventHoverTimeChanged(\"HoverTimeChanged\");\n const String Tooltip::EventDisplayTimeChanged(\"DisplayTimeChanged\");\n const String Tooltip::EventFadeTimeChanged(\"FadeTimeChanged\");\n const String Tooltip::EventTooltipActive(\"TooltipActive\");\n const String Tooltip::EventTooltipInactive(\"TooltipInactive\");\n const String Tooltip::EventTooltipTransition(\"TooltipTransition\");\n \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n \/*************************************************************************\n TooltipWindowRenderer\n *************************************************************************\/\n TooltipWindowRenderer::TooltipWindowRenderer(const String& name) :\n WindowRenderer(name, Tooltip::EventNamespace)\n {\n }\n\n \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n Tooltip::Tooltip(const String& type, const String& name) :\n Window(type, name),\n\n d_hoverTime(0.4f),\n d_displayTime(7.5f),\n d_inPositionSelf(false)\n {\n addTooltipProperties();\n\n setClippedByParent(false);\n setDestroyedByParent(false);\n setAlwaysOnTop(true);\n \n \/\/ we need updates even when not visible\n setUpdateMode(WUM_ALWAYS);\n\n switchToInactiveState();\n }\n\n Tooltip::~Tooltip(void)\n {}\n\n void Tooltip::positionSelf(void)\n {\n \/\/ no recusion allowed for this function!\n if (d_inPositionSelf)\n return;\n\n d_inPositionSelf = true;\n\n MouseCursor& cursor = getGUIContext().getMouseCursor();\n Rectf screen(Vector2f(0, 0), getRootContainerSize());\n Rectf tipRect(getUnclippedOuterRect().get());\n const Image* mouseImage = cursor.getImage();\n\n Vector2f mousePos(cursor.getPosition());\n Sizef mouseSz(0,0);\n\n if (mouseImage)\n {\n mouseSz = mouseImage->getRenderedSize();\n }\n\n Vector2f tmpPos(mousePos.d_x + mouseSz.d_width, mousePos.d_y + mouseSz.d_height);\n tipRect.setPosition(tmpPos);\n\n \/\/ if tooltip would be off the right of the screen,\n \/\/ reposition to the other side of the mouse cursor.\n if (screen.right() < tipRect.right())\n {\n tmpPos.d_x = mousePos.d_x - tipRect.getWidth() - 5;\n }\n\n \/\/ if tooltip would be off the bottom of the screen,\n \/\/ reposition to the other side of the mouse cursor.\n if (screen.bottom() < tipRect.bottom())\n {\n tmpPos.d_y = mousePos.d_y - tipRect.getHeight() - 5;\n }\n\n \/\/ set final position of tooltip window.\n setPosition(\n UVector2(cegui_absdim(tmpPos.d_x),\n cegui_absdim(tmpPos.d_y)));\n\n d_inPositionSelf = false;\n }\n\n void Tooltip::sizeSelf(void)\n {\n Sizef textSize(getTextSize());\n\n setSize(USize(cegui_absdim(textSize.d_width),\n cegui_absdim(textSize.d_height)));\n }\n\n void Tooltip::setTargetWindow(Window* wnd)\n {\n if (!wnd)\n {\n d_target = wnd;\n }\n else if (wnd != this)\n {\n if (d_target != wnd)\n {\n wnd->getGUIContext().getRootWindow()->addChild(this);\n d_target = wnd;\n }\n\n \/\/ set text to that of the tooltip text of the target\n setText(wnd->getTooltipText());\n\n \/\/ set size and position of the tooltip window.\n sizeSelf();\n positionSelf();\n }\n\n resetTimer();\n\n if (d_active)\n {\n WindowEventArgs args(this);\n onTooltipTransition(args);\n }\n }\n\n const Window* Tooltip::getTargetWindow()\n {\n return d_target;\n }\n\n Sizef Tooltip::getTextSize() const\n {\n if (d_windowRenderer != 0)\n {\n TooltipWindowRenderer* wr = (TooltipWindowRenderer*)d_windowRenderer;\n return wr->getTextSize();\n }\n else\n {\n return getTextSize_impl();\n }\n }\n\n Sizef Tooltip::getTextSize_impl() const\n {\n const RenderedString& rs(getRenderedString());\n Sizef sz(0.0f, 0.0f);\n\n for (size_t i = 0; i < rs.getLineCount(); ++i)\n {\n const Sizef line_sz(rs.getPixelSize(i));\n sz.d_height += line_sz.d_height;\n\n if (line_sz.d_width > sz.d_width)\n sz.d_width = line_sz.d_width;\n }\n\n return sz;\n }\n\n void Tooltip::resetTimer(void)\n {\n d_elapsed = 0;\n }\n\n float Tooltip::getHoverTime(void) const\n {\n return d_hoverTime;\n }\n\n void Tooltip::setHoverTime(float seconds)\n {\n if (d_hoverTime != seconds)\n {\n d_hoverTime = seconds;\n\n WindowEventArgs args(this);\n onHoverTimeChanged(args);\n }\n }\n\n float Tooltip::getDisplayTime(void) const\n {\n return d_displayTime;\n }\n\n void Tooltip::setDisplayTime(float seconds)\n {\n if (d_displayTime != seconds)\n {\n d_displayTime = seconds;\n\n WindowEventArgs args(this);\n onDisplayTimeChanged(args);\n }\n }\n\n void Tooltip::doActiveState(float elapsed)\n {\n \/\/ if no target, switch immediately to inactive state.\n if (!d_target || d_target->getTooltipText().empty())\n {\n \/\/ hide immediately since the text is empty\n hide();\n\n switchToInactiveState();\n }\n \/\/ else see if display timeout has been reached\n else if ((d_displayTime > 0) && ((d_elapsed += elapsed) >= d_displayTime))\n {\n \/\/ display time is up, switch states\n switchToInactiveState();\n }\n }\n\n void Tooltip::doInactiveState(float elapsed)\n {\n if (d_target && !d_target->getTooltipText().empty() && ((d_elapsed += elapsed) >= d_hoverTime))\n {\n switchToActiveState();\n }\n }\n\n void Tooltip::switchToInactiveState(void)\n {\n d_active = false;\n d_elapsed = 0;\n\n \/\/ fire event before target gets reset in case that information is required in handler.\n WindowEventArgs args(this);\n onTooltipInactive(args);\n\n d_target = 0;\n }\n\n void Tooltip::switchToActiveState(void)\n {\n positionSelf();\n show();\n\n d_active = true;\n d_elapsed = 0;\n\n WindowEventArgs args(this);\n onTooltipActive(args);\n }\n\n bool Tooltip::validateWindowRenderer(const WindowRenderer* renderer) const\n\t{\n\t\treturn dynamic_cast<const TooltipWindowRenderer*>(renderer) != 0;\n\t}\n\n void Tooltip::updateSelf(float elapsed)\n {\n \/\/ base class processing.\n Window::updateSelf(elapsed);\n\n \/\/ do something based upon current Tooltip state.\n if (d_active)\n {\n doActiveState(elapsed);\n }\n else\n {\n doInactiveState(elapsed);\n }\n }\n\n void Tooltip::addTooltipProperties(void)\n {\n const String& propertyOrigin = WidgetTypeName;\n\n CEGUI_DEFINE_PROPERTY(Tooltip, float,\n \"HoverTime\", \"Property to get\/set the hover timeout value in seconds. Value is a float.\",\n &Tooltip::setHoverTime, &Tooltip::getHoverTime, 0.4f\n );\n\n CEGUI_DEFINE_PROPERTY(Tooltip, float,\n \"DisplayTime\", \"Property to get\/set the display timeout value in seconds. Value is a float.\",\n &Tooltip::setDisplayTime, &Tooltip::getDisplayTime, 7.5f\n );\n }\n\n void Tooltip::onHidden(WindowEventArgs& e)\n {\n Window::onHidden(e);\n\n \/\/ The animation will take care of fade out or whatnot,\n \/\/ at the end it will hide the tooltip to let us know the transition\n \/\/ is done. At this point we will remove the tooltip from the\n \/\/ previous parent.\n\n \/\/ NOTE: There has to be a fadeout animation! Even if it's a 0 second\n \/\/ immediate hide animation.\n\n if (getParent())\n {\n getParent()->removeChild(this);\n }\n }\n\n void Tooltip::onMouseEnters(MouseEventArgs& e)\n {\n positionSelf();\n\n Window::onMouseEnters(e);\n }\n\n void Tooltip::onTextChanged(WindowEventArgs& e)\n {\n \/\/ base class processing\n Window::onTextChanged(e);\n\n \/\/ set size and position of the tooltip window to consider new text\n sizeSelf();\n positionSelf();\n\n \/\/ we do not signal we handled it, in case user wants to hear\n \/\/ about text changes too.\n }\n\n void Tooltip::onHoverTimeChanged(WindowEventArgs& e)\n {\n fireEvent(EventHoverTimeChanged, e, EventNamespace);\n }\n\n void Tooltip::onDisplayTimeChanged(WindowEventArgs& e)\n {\n fireEvent(EventDisplayTimeChanged, e, EventNamespace);\n }\n\n void Tooltip::onTooltipActive(WindowEventArgs& e)\n {\n fireEvent(EventTooltipActive, e, EventNamespace);\n }\n\n void Tooltip::onTooltipInactive(WindowEventArgs& e)\n {\n fireEvent(EventTooltipInactive, e, EventNamespace);\n }\n\n void Tooltip::onTooltipTransition(WindowEventArgs& e)\n {\n fireEvent(EventTooltipTransition, e, EventNamespace);\n }\n} \/\/ End of CEGUI namespace section\n<|endoftext|>"} {"text":"<commit_before>#include <cassert>\n\n#include \"Mesh.h\"\n\nusing namespace eyesore;\n\nusing std::vector;\n\neyesore::Mesh::Mesh(vector<Vertex> vertices, vector<GLuint> indices):\n\tvertices(vertices), indices(indices)\n{\n\tglGenVertexArrays(1, &vao);\n\tglGenBuffers(1, &vbo);\n\tglGenBuffers(1, &ebo);\n\n\tglBindVertexArray(vao);\n\n\tglBindBuffer(GL_ARRAY_BUFFER, vbo);\n\tglBufferData(GL_ARRAY_BUFFER, vertices.size() * sizeof(Vertex), &vertices[0],\n\t\t\tGL_STATIC_DRAW);\n\n\tglBindBuffer(GL_ARRAY_BUFFER, ebo);\n\tglBufferData(GL_ARRAY_BUFFER, indices.size() * sizeof(GLuint), &indices[0],\n\t\t\tGL_STATIC_DRAW);\n\n\tglEnableVertexAttribArray(0);\n\tglVertexAttribPointer(0, 3, GL_FLOAT, GL_FALSE, sizeof(Vertex),\n\t\t\t(GLvoid *) 0);\n\n\tglEnableVertexAttribArray(1);\n\tglVertexAttribPointer(1, 3, GL_FLOAT, GL_FALSE, sizeof(Vertex),\n\t\t\t(GLvoid *) offsetof(Vertex, normal));\n\n\tglEnableVertexAttribArray(2);\n\tglVertexAttribPointer(2, 2, GL_FLOAT, GL_FALSE, sizeof(Vertex),\n\t\t\t(GLvoid *) offsetof(Vertex, uv));\n\n\tglBindVertexArray(0);\n}\n\neyesore::Mesh::~Mesh()\n{\n\tglDeleteBuffers(1, &vbo);\n\tglDeleteBuffers(1, &ebo);\n\tglDeleteVertexArrays(1, &vao);\n}\n\nvoid eyesore::Mesh::render(ShaderProgram &shader, Camera &camera) const\n{\n\tshader.use();\n\tcamera.use();\n\tglBindVertexArray(vao);\n\tglDrawElements(GL_TRIANGLES, indices.size() \/ 3, GL_UNSIGNED_INT, &indices[0]); \n}\n\n<commit_msg>Fix Mesh drawing<commit_after>#include <cassert>\n\n#include \"Mesh.h\"\n\nusing namespace eyesore;\n\nusing std::vector;\n\neyesore::Mesh::Mesh(vector<Vertex> vertices, vector<GLuint> indices):\n\tvertices(vertices), indices(indices)\n{\n\tglGenVertexArrays(1, &vao);\n\tglGenBuffers(1, &vbo);\n\tglGenBuffers(1, &ebo);\n\n\tglBindVertexArray(vao);\n\n\tglBindBuffer(GL_ARRAY_BUFFER, vbo);\n\tglBufferData(GL_ARRAY_BUFFER, vertices.size() * sizeof(Vertex), &vertices[0],\n\t\t\tGL_STATIC_DRAW);\n\n\tglBindBuffer(GL_ELEMENT_ARRAY_BUFFER, ebo);\n\tglBufferData(GL_ELEMENT_ARRAY_BUFFER, indices.size() * sizeof(GLuint), &indices[0],\n\t\t\tGL_STATIC_DRAW);\n\n\tglEnableVertexAttribArray(0);\n\tglVertexAttribPointer(0, 3, GL_FLOAT, GL_FALSE, sizeof(Vertex),\n\t\t\t(GLvoid *) 0);\n\n\tglEnableVertexAttribArray(1);\n\tglVertexAttribPointer(1, 3, GL_FLOAT, GL_FALSE, sizeof(Vertex),\n\t\t\t(GLvoid *) offsetof(Vertex, normal));\n\n\tglEnableVertexAttribArray(2);\n\tglVertexAttribPointer(2, 2, GL_FLOAT, GL_FALSE, sizeof(Vertex),\n\t\t\t(GLvoid *) offsetof(Vertex, uv));\n\n\tglBindVertexArray(0);\n}\n\neyesore::Mesh::~Mesh()\n{\n\tglDeleteBuffers(1, &vbo);\n\tglDeleteBuffers(1, &ebo);\n\tglDeleteVertexArrays(1, &vao);\n}\n\nvoid eyesore::Mesh::render(ShaderProgram &shader, Camera &camera) const\n{\n\tshader.use();\n\tcamera.use();\n\n\tglBindVertexArray(vao);\n\tglDrawElements(GL_TRIANGLES, indices.size(), GL_UNSIGNED_INT, 0); \n\tglBindVertexArray(0);\n}\n\n<|endoftext|>"} {"text":"<commit_before>#include <algorithm>\n#include <cassert>\n#include \"system.h\"\n#include \"errors.h\"\n#include \"utils.h\"\n\nint System::installMemory(MemoryModule &mod, SizeType offset, SizeType size) {\n int status = ERR_SUCCESS;\n\n \/\/ NB: if(size <= 0 || \/* overflow *\/offset + size < offset) {\n if(offset + size <= offset) {\n status = ERR_BADRANGE;\n } else {\n MemoryInstance overlap = resolveAtMost(offset + size - 1);\n if(overlap) {\n SizeType overlapEnd = overlap.offset + overlap.length - 1;\n if(overlapEnd >= offset) {\n status = ERR_CONFLICT;\n }\n }\n }\n\n if(status == ERR_SUCCESS) {\n mem.emplace(offset, MemoryInstance(&mod, offset, size));\n }\n return status;\n}\n\nint System::removeMemory(SizeType offset) {\n MemMap::size_type erased = mem.erase(offset);\n assert(erased <= 1);\n int status = erased ? ERR_SUCCESS : ERR_BADRANGE;\n return status;\n}\n\nint System::bindPort(PortSocket &sock, PortType port) {\n throw \"Not Implemented\";\n}\n\nint System::releasePort(PortType port) {\n throw \"Not Implemented\";\n}\n\nint System::readMemory(SizeType offset, SizeType len, void *data) const {\n return memoryLoop(offset, len, data, false);\n}\n\nint System::writeMemory(SizeType offset, SizeType len, const void *data) const {\n return memoryLoop(offset, len, data, true);\n}\n\nint System::readPort(PortType port, SizeType len, void *data) const {\n throw \"Not Implemented\";\n}\n\nint System::writePort(PortType port, SizeType len, const void *data) const {\n throw \"Not Implemented\";\n}\n\nSystem::MemoryInstance System::resolveAtMost(SizeType address) const {\n auto iterator = mem.lower_bound(address);\n if(iterator->second.offset != address) {\n if (iterator == mem.cbegin()) {\n iterator = mem.cend();\n } else if(iterator != mem.cend()) {\n iterator--;\n }\n }\n return iterator->second;\n}\n\nint System::memoryLoop(SizeType offset, SizeType len, const void *data, bool write) const {\n int status = ERR_SUCCESS;\n while(len > 0) {\n MemoryInstance src = resolveAtMost(offset);\n if(!src) {\n status = ERR_BADRANGE;\n } else {\n SizeType srcOff = offset - src.offset;\n SizeType srcLen = std::min(src.length - srcOff, len);\n if(write) {\n status = src.mod->writeMemory(srcOff, srcLen, data);\n } else {\n status = src.mod->readMemory(srcOff, srcLen, \/* HACK *\/(void*)(data));\n }\n if(status == ERR_SUCCESS)\n {\n len -= srcLen;\n offset += srcLen;\n data = advancePtr(data, srcLen);\n } else {\n break;\n }\n }\n }\n return status;\n}<commit_msg>Correct implementation of resolveAtMost<commit_after>#include <algorithm>\n#include <cassert>\n#include \"system.h\"\n#include \"errors.h\"\n#include \"utils.h\"\n\nint System::installMemory(MemoryModule &mod, SizeType offset, SizeType size) {\n int status = ERR_SUCCESS;\n\n \/\/ NB: if(size <= 0 || \/* overflow *\/offset + size < offset) {\n if(offset + size <= offset) {\n status = ERR_BADRANGE;\n } else {\n MemoryInstance overlap = resolveAtMost(offset + size - 1);\n if(overlap) {\n SizeType overlapEnd = overlap.offset + overlap.length - 1;\n if(overlapEnd >= offset) {\n status = ERR_CONFLICT;\n }\n }\n }\n\n if(status == ERR_SUCCESS) {\n mem.emplace(offset, MemoryInstance(&mod, offset, size));\n }\n return status;\n}\n\nint System::removeMemory(SizeType offset) {\n MemMap::size_type erased = mem.erase(offset);\n assert(erased <= 1);\n int status = erased ? ERR_SUCCESS : ERR_BADRANGE;\n return status;\n}\n\nint System::bindPort(PortSocket &sock, PortType port) {\n throw \"Not Implemented\";\n}\n\nint System::releasePort(PortType port) {\n throw \"Not Implemented\";\n}\n\nint System::readMemory(SizeType offset, SizeType len, void *data) const {\n return memoryLoop(offset, len, data, false);\n}\n\nint System::writeMemory(SizeType offset, SizeType len, const void *data) const {\n return memoryLoop(offset, len, data, true);\n}\n\nint System::readPort(PortType port, SizeType len, void *data) const {\n throw \"Not Implemented\";\n}\n\nint System::writePort(PortType port, SizeType len, const void *data) const {\n throw \"Not Implemented\";\n}\n\nSystem::MemoryInstance System::resolveAtMost(SizeType address) const {\n MemoryInstance ret = MemoryInstance::null;\n auto iterator = mem.lower_bound(address);\n if(iterator != mem.cend()) {\n if(iterator->second.offset == address) {\n ret = iterator->second;\n } else {\n if(iterator != mem.cbegin() && iterator != mem.cend()) {\n iterator--;\n ret = iterator->second;\n }\n }\n }\n return ret;\n}\n\nint System::memoryLoop(SizeType offset, SizeType len, const void *data, bool write) const {\n int status = ERR_SUCCESS;\n while(len > 0) {\n MemoryInstance src = resolveAtMost(offset);\n if(!src) {\n status = ERR_BADRANGE;\n } else {\n SizeType srcOff = offset - src.offset;\n SizeType srcLen = std::min(src.length - srcOff, len);\n if(write) {\n status = src.mod->writeMemory(srcOff, srcLen, data);\n } else {\n status = src.mod->readMemory(srcOff, srcLen, \/* HACK *\/(void*)(data));\n }\n if(status == ERR_SUCCESS)\n {\n len -= srcLen;\n offset += srcLen;\n data = advancePtr(data, srcLen);\n } else {\n break;\n }\n }\n }\n return status;\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\/webkit_forwarding_impl.h\"\n\n#include <string>\n\n#include \"base\/debug\/trace_event.h\"\n#include \"base\/memory\/scoped_ptr.h\"\n#include \"base\/string_util.h\"\n#include \"base\/synchronization\/waitable_event.h\"\n#include \"base\/utf_string_conversions.h\"\n#include \"ppapi\/c\/dev\/ppb_font_dev.h\"\n#include \"ppapi\/c\/pp_point.h\"\n#include \"ppapi\/c\/pp_rect.h\"\n#include \"ppapi\/shared_impl\/ppapi_preferences.h\"\n#include \"skia\/ext\/platform_canvas.h\"\n#include \"third_party\/skia\/include\/core\/SkRect.h\"\n#include \"third_party\/WebKit\/Source\/WebKit\/chromium\/public\/WebCanvas.h\"\n#include \"third_party\/WebKit\/Source\/WebKit\/chromium\/public\/WebFont.h\"\n#include \"third_party\/WebKit\/Source\/WebKit\/chromium\/public\/WebFontDescription.h\"\n#include \"third_party\/WebKit\/Source\/WebKit\/chromium\/public\/WebRect.h\"\n#include \"third_party\/WebKit\/Source\/WebKit\/chromium\/public\/WebFloatPoint.h\"\n#include \"third_party\/WebKit\/Source\/WebKit\/chromium\/public\/WebFloatRect.h\"\n#include \"third_party\/WebKit\/Source\/WebKit\/chromium\/public\/WebTextRun.h\"\n#include \"webkit\/glue\/webkit_glue.h\"\n\nusing ::ppapi::WebKitForwarding;\nusing WebKit::WebCanvas;\nusing WebKit::WebFloatPoint;\nusing WebKit::WebFloatRect;\nusing WebKit::WebFont;\nusing WebKit::WebFontDescription;\nusing WebKit::WebRect;\nusing WebKit::WebTextRun;\n\nnamespace webkit {\nnamespace ppapi {\n\nnamespace {\n\n\/\/ The PP_* version lacks \"None\", so is just one value shifted from the\n\/\/ WebFontDescription version. These values are checked in\n\/\/ PPFontDescToWebFontDesc to make sure the conversion is correct. This is a\n\/\/ macro so it can also be used in the COMPILE_ASSERTS.\n#define PP_FONTFAMILY_TO_WEB_FONTFAMILY(f) \\\n static_cast<WebFontDescription::GenericFamily>(f + 1)\n\n\/\/ Assumes the given PP_FontDescription has been validated.\nWebFontDescription PPFontDescToWebFontDesc(const PP_FontDescription_Dev& font,\n const std::string& face,\n const ::ppapi::Preferences& prefs) {\n \/\/ Verify that the enums match so we can just static cast.\n COMPILE_ASSERT(static_cast<int>(WebFontDescription::Weight100) ==\n static_cast<int>(PP_FONTWEIGHT_100),\n FontWeight100);\n COMPILE_ASSERT(static_cast<int>(WebFontDescription::Weight900) ==\n static_cast<int>(PP_FONTWEIGHT_900),\n FontWeight900);\n COMPILE_ASSERT(WebFontDescription::GenericFamilyStandard ==\n PP_FONTFAMILY_TO_WEB_FONTFAMILY(PP_FONTFAMILY_DEFAULT),\n StandardFamily);\n COMPILE_ASSERT(WebFontDescription::GenericFamilySerif ==\n PP_FONTFAMILY_TO_WEB_FONTFAMILY(PP_FONTFAMILY_SERIF),\n SerifFamily);\n COMPILE_ASSERT(WebFontDescription::GenericFamilySansSerif ==\n PP_FONTFAMILY_TO_WEB_FONTFAMILY(PP_FONTFAMILY_SANSSERIF),\n SansSerifFamily);\n COMPILE_ASSERT(WebFontDescription::GenericFamilyMonospace ==\n PP_FONTFAMILY_TO_WEB_FONTFAMILY(PP_FONTFAMILY_MONOSPACE),\n MonospaceFamily);\n\n WebFontDescription result;\n string16 resolved_family;\n if (face.empty()) {\n \/\/ Resolve the generic family.\n switch (font.family) {\n case PP_FONTFAMILY_SERIF:\n resolved_family = prefs.serif_font_family;\n break;\n case PP_FONTFAMILY_SANSSERIF:\n resolved_family = prefs.sans_serif_font_family;\n break;\n case PP_FONTFAMILY_MONOSPACE:\n resolved_family = prefs.fixed_font_family;\n break;\n case PP_FONTFAMILY_DEFAULT:\n default:\n resolved_family = prefs.standard_font_family;\n break;\n }\n } else {\n \/\/ Use the exact font.\n resolved_family = UTF8ToUTF16(face);\n }\n result.family = resolved_family;\n\n result.genericFamily = PP_FONTFAMILY_TO_WEB_FONTFAMILY(font.family);\n\n if (font.size == 0) {\n \/\/ Resolve the default font size, using the resolved family to see if\n \/\/ we should use the fixed or regular font size. It's difficult at this\n \/\/ level to detect if the requested font is fixed width, so we only apply\n \/\/ the alternate font size to the default fixed font family.\n if (StringToLowerASCII(resolved_family) ==\n StringToLowerASCII(prefs.fixed_font_family))\n result.size = static_cast<float>(prefs.default_fixed_font_size);\n else\n result.size = static_cast<float>(prefs.default_font_size);\n } else {\n \/\/ Use the exact size.\n result.size = static_cast<float>(font.size);\n }\n\n result.italic = font.italic != PP_FALSE;\n result.smallCaps = font.small_caps != PP_FALSE;\n result.weight = static_cast<WebFontDescription::Weight>(font.weight);\n result.letterSpacing = static_cast<short>(font.letter_spacing);\n result.wordSpacing = static_cast<short>(font.word_spacing);\n return result;\n}\n\nWebTextRun TextRunToWebTextRun(const WebKitForwarding::Font::TextRun& run) {\n return WebTextRun(UTF8ToUTF16(run.text),\n run.rtl != PP_FALSE,\n run.override_direction != PP_FALSE);\n}\n\n\/\/ FontImpl --------------------------------------------------------------------\n\nclass FontImpl : public WebKitForwarding::Font {\n public:\n FontImpl(const PP_FontDescription_Dev& desc,\n const std::string& desc_face,\n const ::ppapi::Preferences& prefs);\n virtual ~FontImpl();\n\n virtual void Describe(base::WaitableEvent* event,\n PP_FontDescription_Dev* description,\n std::string* face,\n PP_FontMetrics_Dev* metrics,\n PP_Bool* result) OVERRIDE;\n virtual void DrawTextAt(base::WaitableEvent* event,\n const DrawTextParams& params) OVERRIDE;\n virtual void MeasureText(base::WaitableEvent* event,\n const TextRun& text,\n int32_t* result) OVERRIDE;\n virtual void CharacterOffsetForPixel(base::WaitableEvent* event,\n const TextRun& text,\n int32_t pixel_position,\n uint32_t* result) OVERRIDE;\n virtual void PixelOffsetForCharacter(base::WaitableEvent* event,\n const TextRun& text,\n uint32_t char_offset,\n int32_t* result) OVERRIDE;\n\n private:\n scoped_ptr<WebFont> font_;\n\n DISALLOW_COPY_AND_ASSIGN(FontImpl);\n};\n\nFontImpl::FontImpl(const PP_FontDescription_Dev& desc,\n const std::string& desc_face,\n const ::ppapi::Preferences& prefs) {\n WebFontDescription web_font_desc = PPFontDescToWebFontDesc(desc, desc_face,\n prefs);\n font_.reset(WebFont::create(web_font_desc));\n}\n\nFontImpl::~FontImpl() {\n}\n\nvoid FontImpl::Describe(base::WaitableEvent* event,\n PP_FontDescription_Dev* description,\n std::string* face,\n PP_FontMetrics_Dev* metrics,\n PP_Bool* result) {\n TRACE_EVENT0(\"ppapi WebKit thread\", \"FontImpl::Describe\");\n if (description->face.type != PP_VARTYPE_UNDEFINED) {\n *result = PP_FALSE;\n } else {\n WebFontDescription web_desc = font_->fontDescription();\n\n \/\/ While converting the other way in PPFontDescToWebFontDesc we validated\n \/\/ that the enums can be casted.\n description->face = PP_MakeUndefined();\n description->family =\n static_cast<PP_FontFamily_Dev>(web_desc.genericFamily);\n description->size = static_cast<uint32_t>(web_desc.size);\n description->weight = static_cast<PP_FontWeight_Dev>(web_desc.weight);\n description->italic = web_desc.italic ? PP_TRUE : PP_FALSE;\n description->small_caps = web_desc.smallCaps ? PP_TRUE : PP_FALSE;\n\n *face = UTF16ToUTF8(web_desc.family);\n\n metrics->height = font_->height();\n metrics->ascent = font_->ascent();\n metrics->descent = font_->descent();\n metrics->line_spacing = font_->lineSpacing();\n metrics->x_height = static_cast<int32_t>(font_->xHeight());\n\n *result = PP_TRUE;\n }\n if (event)\n event->Signal();\n}\n\nvoid FontImpl::DrawTextAt(base::WaitableEvent* event,\n const DrawTextParams& params) {\n TRACE_EVENT0(\"ppapi WebKit thread\", \"FontImpl::DrawTextAt\");\n WebTextRun run = TextRunToWebTextRun(params.text);\n\n \/\/ Convert position and clip.\n WebFloatPoint web_position(static_cast<float>(params.position->x),\n static_cast<float>(params.position->y));\n WebRect web_clip;\n if (!params.clip) {\n \/\/ Use entire canvas. SkCanvas doesn't have a size on it, so we just use\n \/\/ the current clip bounds.\n SkRect skclip;\n params.destination->getClipBounds(&skclip);\n web_clip = WebRect(skclip.fLeft, skclip.fTop, skclip.fRight - skclip.fLeft,\n skclip.fBottom - skclip.fTop);\n } else {\n web_clip = WebRect(params.clip->point.x, params.clip->point.y,\n params.clip->size.width, params.clip->size.height);\n }\n\n font_->drawText(webkit_glue::ToWebCanvas(params.destination), run,\n web_position, params.color, web_clip,\n params.image_data_is_opaque == PP_TRUE);\n if (event)\n event->Signal();\n}\n\nvoid FontImpl::MeasureText(base::WaitableEvent* event,\n const TextRun& text, int32_t* result) {\n TRACE_EVENT0(\"ppapi WebKit thread\", \"FontImpl::MeasureText\");\n *result = font_->calculateWidth(TextRunToWebTextRun(text));\n if (event)\n event->Signal();\n}\n\nvoid FontImpl::CharacterOffsetForPixel(base::WaitableEvent* event,\n const TextRun& text,\n int32_t pixel_position,\n uint32_t* result) {\n TRACE_EVENT0(\"ppapi WebKit thread\", \"FontImpl::CharacterOffsetForPixel\");\n *result = static_cast<uint32_t>(font_->offsetForPosition(\n TextRunToWebTextRun(text), static_cast<float>(pixel_position)));\n if (event)\n event->Signal();\n}\n\nvoid FontImpl::PixelOffsetForCharacter(base::WaitableEvent* event,\n const TextRun& text,\n uint32_t char_offset,\n int32_t* result) {\n TRACE_EVENT0(\"ppapi WebKit thread\", \"FontImpl::PixelOffsetForCharacter\");\n WebTextRun run = TextRunToWebTextRun(text);\n if (char_offset >= run.text.length()) {\n *result = -1;\n } else {\n WebFloatRect rect = font_->selectionRectForText(\n run, WebFloatPoint(0.0f, 0.0f), font_->height(), 0, char_offset);\n *result = static_cast<int>(rect.width);\n }\n if (event)\n event->Signal();\n}\n\n} \/\/ namespace\n\n\/\/ WebKitForwardingImpl --------------------------------------------------------\n\nWebKitForwardingImpl::WebKitForwardingImpl() {\n}\n\nWebKitForwardingImpl::~WebKitForwardingImpl() {\n}\n\nvoid WebKitForwardingImpl::CreateFontForwarding(\n base::WaitableEvent* event,\n const PP_FontDescription_Dev& desc,\n const std::string& desc_face,\n const ::ppapi::Preferences& prefs,\n Font** result) {\n TRACE_EVENT0(\"ppapi WebKit thread\",\n \"WebKitForwardingImpl::CreateFontForwarding\");\n *result = new FontImpl(desc, desc_face, prefs);\n if (event)\n event->Signal();\n}\n\n} \/\/ namespace ppapi\n} \/\/ namespace webkit\n<commit_msg>Copy 2 missing fields of PP_FontDescription_Dev.<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\/webkit_forwarding_impl.h\"\n\n#include <string>\n\n#include \"base\/debug\/trace_event.h\"\n#include \"base\/memory\/scoped_ptr.h\"\n#include \"base\/string_util.h\"\n#include \"base\/synchronization\/waitable_event.h\"\n#include \"base\/utf_string_conversions.h\"\n#include \"ppapi\/c\/dev\/ppb_font_dev.h\"\n#include \"ppapi\/c\/pp_point.h\"\n#include \"ppapi\/c\/pp_rect.h\"\n#include \"ppapi\/shared_impl\/ppapi_preferences.h\"\n#include \"skia\/ext\/platform_canvas.h\"\n#include \"third_party\/skia\/include\/core\/SkRect.h\"\n#include \"third_party\/WebKit\/Source\/WebKit\/chromium\/public\/WebCanvas.h\"\n#include \"third_party\/WebKit\/Source\/WebKit\/chromium\/public\/WebFont.h\"\n#include \"third_party\/WebKit\/Source\/WebKit\/chromium\/public\/WebFontDescription.h\"\n#include \"third_party\/WebKit\/Source\/WebKit\/chromium\/public\/WebRect.h\"\n#include \"third_party\/WebKit\/Source\/WebKit\/chromium\/public\/WebFloatPoint.h\"\n#include \"third_party\/WebKit\/Source\/WebKit\/chromium\/public\/WebFloatRect.h\"\n#include \"third_party\/WebKit\/Source\/WebKit\/chromium\/public\/WebTextRun.h\"\n#include \"webkit\/glue\/webkit_glue.h\"\n\nusing ::ppapi::WebKitForwarding;\nusing WebKit::WebCanvas;\nusing WebKit::WebFloatPoint;\nusing WebKit::WebFloatRect;\nusing WebKit::WebFont;\nusing WebKit::WebFontDescription;\nusing WebKit::WebRect;\nusing WebKit::WebTextRun;\n\nnamespace webkit {\nnamespace ppapi {\n\nnamespace {\n\n\/\/ The PP_* version lacks \"None\", so is just one value shifted from the\n\/\/ WebFontDescription version. These values are checked in\n\/\/ PPFontDescToWebFontDesc to make sure the conversion is correct. This is a\n\/\/ macro so it can also be used in the COMPILE_ASSERTS.\n#define PP_FONTFAMILY_TO_WEB_FONTFAMILY(f) \\\n static_cast<WebFontDescription::GenericFamily>(f + 1)\n\n\/\/ Assumes the given PP_FontDescription has been validated.\nWebFontDescription PPFontDescToWebFontDesc(const PP_FontDescription_Dev& font,\n const std::string& face,\n const ::ppapi::Preferences& prefs) {\n \/\/ Verify that the enums match so we can just static cast.\n COMPILE_ASSERT(static_cast<int>(WebFontDescription::Weight100) ==\n static_cast<int>(PP_FONTWEIGHT_100),\n FontWeight100);\n COMPILE_ASSERT(static_cast<int>(WebFontDescription::Weight900) ==\n static_cast<int>(PP_FONTWEIGHT_900),\n FontWeight900);\n COMPILE_ASSERT(WebFontDescription::GenericFamilyStandard ==\n PP_FONTFAMILY_TO_WEB_FONTFAMILY(PP_FONTFAMILY_DEFAULT),\n StandardFamily);\n COMPILE_ASSERT(WebFontDescription::GenericFamilySerif ==\n PP_FONTFAMILY_TO_WEB_FONTFAMILY(PP_FONTFAMILY_SERIF),\n SerifFamily);\n COMPILE_ASSERT(WebFontDescription::GenericFamilySansSerif ==\n PP_FONTFAMILY_TO_WEB_FONTFAMILY(PP_FONTFAMILY_SANSSERIF),\n SansSerifFamily);\n COMPILE_ASSERT(WebFontDescription::GenericFamilyMonospace ==\n PP_FONTFAMILY_TO_WEB_FONTFAMILY(PP_FONTFAMILY_MONOSPACE),\n MonospaceFamily);\n\n WebFontDescription result;\n string16 resolved_family;\n if (face.empty()) {\n \/\/ Resolve the generic family.\n switch (font.family) {\n case PP_FONTFAMILY_SERIF:\n resolved_family = prefs.serif_font_family;\n break;\n case PP_FONTFAMILY_SANSSERIF:\n resolved_family = prefs.sans_serif_font_family;\n break;\n case PP_FONTFAMILY_MONOSPACE:\n resolved_family = prefs.fixed_font_family;\n break;\n case PP_FONTFAMILY_DEFAULT:\n default:\n resolved_family = prefs.standard_font_family;\n break;\n }\n } else {\n \/\/ Use the exact font.\n resolved_family = UTF8ToUTF16(face);\n }\n result.family = resolved_family;\n\n result.genericFamily = PP_FONTFAMILY_TO_WEB_FONTFAMILY(font.family);\n\n if (font.size == 0) {\n \/\/ Resolve the default font size, using the resolved family to see if\n \/\/ we should use the fixed or regular font size. It's difficult at this\n \/\/ level to detect if the requested font is fixed width, so we only apply\n \/\/ the alternate font size to the default fixed font family.\n if (StringToLowerASCII(resolved_family) ==\n StringToLowerASCII(prefs.fixed_font_family))\n result.size = static_cast<float>(prefs.default_fixed_font_size);\n else\n result.size = static_cast<float>(prefs.default_font_size);\n } else {\n \/\/ Use the exact size.\n result.size = static_cast<float>(font.size);\n }\n\n result.italic = font.italic != PP_FALSE;\n result.smallCaps = font.small_caps != PP_FALSE;\n result.weight = static_cast<WebFontDescription::Weight>(font.weight);\n result.letterSpacing = static_cast<short>(font.letter_spacing);\n result.wordSpacing = static_cast<short>(font.word_spacing);\n return result;\n}\n\nWebTextRun TextRunToWebTextRun(const WebKitForwarding::Font::TextRun& run) {\n return WebTextRun(UTF8ToUTF16(run.text),\n run.rtl != PP_FALSE,\n run.override_direction != PP_FALSE);\n}\n\n\/\/ FontImpl --------------------------------------------------------------------\n\nclass FontImpl : public WebKitForwarding::Font {\n public:\n FontImpl(const PP_FontDescription_Dev& desc,\n const std::string& desc_face,\n const ::ppapi::Preferences& prefs);\n virtual ~FontImpl();\n\n virtual void Describe(base::WaitableEvent* event,\n PP_FontDescription_Dev* description,\n std::string* face,\n PP_FontMetrics_Dev* metrics,\n PP_Bool* result) OVERRIDE;\n virtual void DrawTextAt(base::WaitableEvent* event,\n const DrawTextParams& params) OVERRIDE;\n virtual void MeasureText(base::WaitableEvent* event,\n const TextRun& text,\n int32_t* result) OVERRIDE;\n virtual void CharacterOffsetForPixel(base::WaitableEvent* event,\n const TextRun& text,\n int32_t pixel_position,\n uint32_t* result) OVERRIDE;\n virtual void PixelOffsetForCharacter(base::WaitableEvent* event,\n const TextRun& text,\n uint32_t char_offset,\n int32_t* result) OVERRIDE;\n\n private:\n scoped_ptr<WebFont> font_;\n\n DISALLOW_COPY_AND_ASSIGN(FontImpl);\n};\n\nFontImpl::FontImpl(const PP_FontDescription_Dev& desc,\n const std::string& desc_face,\n const ::ppapi::Preferences& prefs) {\n WebFontDescription web_font_desc = PPFontDescToWebFontDesc(desc, desc_face,\n prefs);\n font_.reset(WebFont::create(web_font_desc));\n}\n\nFontImpl::~FontImpl() {\n}\n\nvoid FontImpl::Describe(base::WaitableEvent* event,\n PP_FontDescription_Dev* description,\n std::string* face,\n PP_FontMetrics_Dev* metrics,\n PP_Bool* result) {\n TRACE_EVENT0(\"ppapi WebKit thread\", \"FontImpl::Describe\");\n if (description->face.type != PP_VARTYPE_UNDEFINED) {\n *result = PP_FALSE;\n } else {\n WebFontDescription web_desc = font_->fontDescription();\n\n \/\/ While converting the other way in PPFontDescToWebFontDesc we validated\n \/\/ that the enums can be casted.\n description->face = PP_MakeUndefined();\n description->family =\n static_cast<PP_FontFamily_Dev>(web_desc.genericFamily);\n description->size = static_cast<uint32_t>(web_desc.size);\n description->weight = static_cast<PP_FontWeight_Dev>(web_desc.weight);\n description->italic = web_desc.italic ? PP_TRUE : PP_FALSE;\n description->small_caps = web_desc.smallCaps ? PP_TRUE : PP_FALSE;\n description->letter_spacing = static_cast<int32_t>(web_desc.letterSpacing);\n description->word_spacing = static_cast<int32_t>(web_desc.wordSpacing);\n\n *face = UTF16ToUTF8(web_desc.family);\n\n metrics->height = font_->height();\n metrics->ascent = font_->ascent();\n metrics->descent = font_->descent();\n metrics->line_spacing = font_->lineSpacing();\n metrics->x_height = static_cast<int32_t>(font_->xHeight());\n\n *result = PP_TRUE;\n }\n if (event)\n event->Signal();\n}\n\nvoid FontImpl::DrawTextAt(base::WaitableEvent* event,\n const DrawTextParams& params) {\n TRACE_EVENT0(\"ppapi WebKit thread\", \"FontImpl::DrawTextAt\");\n WebTextRun run = TextRunToWebTextRun(params.text);\n\n \/\/ Convert position and clip.\n WebFloatPoint web_position(static_cast<float>(params.position->x),\n static_cast<float>(params.position->y));\n WebRect web_clip;\n if (!params.clip) {\n \/\/ Use entire canvas. SkCanvas doesn't have a size on it, so we just use\n \/\/ the current clip bounds.\n SkRect skclip;\n params.destination->getClipBounds(&skclip);\n web_clip = WebRect(skclip.fLeft, skclip.fTop, skclip.fRight - skclip.fLeft,\n skclip.fBottom - skclip.fTop);\n } else {\n web_clip = WebRect(params.clip->point.x, params.clip->point.y,\n params.clip->size.width, params.clip->size.height);\n }\n\n font_->drawText(webkit_glue::ToWebCanvas(params.destination), run,\n web_position, params.color, web_clip,\n params.image_data_is_opaque == PP_TRUE);\n if (event)\n event->Signal();\n}\n\nvoid FontImpl::MeasureText(base::WaitableEvent* event,\n const TextRun& text, int32_t* result) {\n TRACE_EVENT0(\"ppapi WebKit thread\", \"FontImpl::MeasureText\");\n *result = font_->calculateWidth(TextRunToWebTextRun(text));\n if (event)\n event->Signal();\n}\n\nvoid FontImpl::CharacterOffsetForPixel(base::WaitableEvent* event,\n const TextRun& text,\n int32_t pixel_position,\n uint32_t* result) {\n TRACE_EVENT0(\"ppapi WebKit thread\", \"FontImpl::CharacterOffsetForPixel\");\n *result = static_cast<uint32_t>(font_->offsetForPosition(\n TextRunToWebTextRun(text), static_cast<float>(pixel_position)));\n if (event)\n event->Signal();\n}\n\nvoid FontImpl::PixelOffsetForCharacter(base::WaitableEvent* event,\n const TextRun& text,\n uint32_t char_offset,\n int32_t* result) {\n TRACE_EVENT0(\"ppapi WebKit thread\", \"FontImpl::PixelOffsetForCharacter\");\n WebTextRun run = TextRunToWebTextRun(text);\n if (char_offset >= run.text.length()) {\n *result = -1;\n } else {\n WebFloatRect rect = font_->selectionRectForText(\n run, WebFloatPoint(0.0f, 0.0f), font_->height(), 0, char_offset);\n *result = static_cast<int>(rect.width);\n }\n if (event)\n event->Signal();\n}\n\n} \/\/ namespace\n\n\/\/ WebKitForwardingImpl --------------------------------------------------------\n\nWebKitForwardingImpl::WebKitForwardingImpl() {\n}\n\nWebKitForwardingImpl::~WebKitForwardingImpl() {\n}\n\nvoid WebKitForwardingImpl::CreateFontForwarding(\n base::WaitableEvent* event,\n const PP_FontDescription_Dev& desc,\n const std::string& desc_face,\n const ::ppapi::Preferences& prefs,\n Font** result) {\n TRACE_EVENT0(\"ppapi WebKit thread\",\n \"WebKitForwardingImpl::CreateFontForwarding\");\n *result = new FontImpl(desc, desc_face, prefs);\n if (event)\n event->Signal();\n}\n\n} \/\/ namespace ppapi\n} \/\/ namespace webkit\n<|endoftext|>"} {"text":"<commit_before>\/*************************************************************************************\n * Copyright (C) 2012 by Alejandro Fiestas Olivares <afiestas@kde.org> *\n * *\n * This program is free software; you can redistribute it and\/or *\n * modify it under the terms of the GNU General Public License *\n * as published by the Free Software Foundation; either version 2 *\n * of the License, or (at your option) any later version. *\n * *\n * This program is distributed in the hope that it will be useful, *\n * but WITHOUT ANY WARRANTY; without even the implied warranty of *\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the *\n * GNU General Public License for more details. *\n * *\n * You should have received a copy of the GNU General Public License *\n * along with this program; if not, write to the Free Software *\n * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA *\n *************************************************************************************\/\n\n#include \"generator.h\"\n#include \"device.h\"\n\n#include <QtCore\/QDebug>\n\n#include <QDBusReply>\n#include <QDBusMessage>\n#include <QDBusConnection>\n\n#include <kscreen\/config.h>\n\nGenerator* Generator::instance = 0;\n\nGenerator* Generator::self()\n{\n if (!Generator::instance) {\n Generator::instance = new Generator();\n }\n return Generator::instance;\n}\n\nGenerator::Generator()\n : QObject()\n , m_device(new Device(this))\n , m_isReady(false)\n , m_forceLaptop(false)\n , m_forceLidClosed(false)\n , m_forceDocked(false)\n{\n connect(m_device, SIGNAL(ready()), SIGNAL(ready()));\n}\n\nvoid Generator::destroy()\n{\n delete Generator::instance;\n}\n\nGenerator::~Generator()\n{\n delete m_device;\n}\n\nKScreen::Config* Generator::idealConfig()\n{\n KScreen::Config* config = KScreen::Config::current();\n\n disableAllDisconnectedOutputs(config->outputs());\n\n KScreen::OutputList connectedOutputs = config->connectedOutputs();\n\n if (connectedOutputs.count() == 1) {\n qDebug() << \"Config for one output\";\n KScreen::Output* output = connectedOutputs.take(connectedOutputs.keys().first());\n output->setCurrentMode(output->preferredMode());\n\n return config;\n }\n\n \/\/If we are a laptop, go into laptop mode\n if (isLaptop()) {\n return laptop(config, connectedOutputs);\n }\n\n extendToRight(connectedOutputs);\n\n return config;\n}\n\nKScreen::Config* Generator::laptop(KScreen::Config* config, KScreen::OutputList& outputs)\n{\n qDebug() << \"Config for a laptop\";\n\n KScreen::Output* embedded = 0;\n Q_FOREACH(KScreen::Output* output, outputs) {\n if (isEmbedded(output->name())) {\n embedded = output;\n outputs.remove(embedded->id());\n continue;\n }\n }\n\n if (outputs.isEmpty() || !embedded) {\n qWarning(\"Neither external outputs or embedded could be found\");\n return KScreen::Config::current();\n }\n\n if (isLidClosed() && outputs.count() == 1) {\n qDebug() << \"With lid closed\";\n embedded->setEnabled(false);\n\n KScreen::Output* external = outputs.value(outputs.keys().first());\n external->setEnabled(true);\n external->setCurrentMode(external->preferredMode());\n external->setPrimary(true);\n\n return config;\n }\n\n if (isLidClosed() && outputs.count() > 1) {\n embedded->setEnabled(false);\n embedded->setPrimary(false);\n\n extendToRight(outputs);\n\n return config;\n }\n\n \/\/If lid is open, laptop screen shuold be primary\n embedded->setPos(QPoint(0,0));\n embedded->setCurrentMode(embedded->preferredMode());\n embedded->setPrimary(true);\n embedded->setEnabled(true);\n\n QSize globalSize = embedded->mode(embedded->preferredMode())->size();\n KScreen::Output* biggest = biggestOutput(outputs);\n outputs.remove(biggest->id());\n\n biggest->setPos(QPoint(globalSize.width(), 0));\n biggest->setEnabled(true);\n biggest->setCurrentMode(biggest->preferredMode());\n biggest->setPrimary(false);\n\n QSize size;\n globalSize += biggest->mode(biggest->currentMode())->size();\n Q_FOREACH(KScreen::Output* output, outputs) {\n output->setEnabled(true);\n output->setCurrentMode(output->preferredMode());\n output->setPos(QPoint(globalSize.width(), 0));\n\n size = output->mode(output->currentMode())->size();\n globalSize += size;\n }\n\n if (isDocked()) {\n qDebug() << \"Docked\";\n embedded->setPrimary(false);\n biggest->setPrimary(true);\n }\n\n return config;\n}\n\nvoid Generator::extendToRight(KScreen::OutputList& outputs)\n{\n KScreen::Output* biggest = biggestOutput(outputs);\n outputs.remove(biggest->id());\n\n biggest->setEnabled(true);\n biggest->setPrimary(true);\n biggest->setCurrentMode(biggest->preferredMode());\n biggest->setPos(QPoint(0,0));\n\n QSize size;\n QSize globalSize = biggest->mode(biggest->currentMode())->size();\n Q_FOREACH(KScreen::Output* output, outputs) {\n output->setEnabled(true);\n output->setPrimary(false);\n output->setCurrentMode(output->preferredMode());\n output->setPos(QPoint(globalSize.width(), 0));\n\n size = output->mode(output->currentMode())->size();\n globalSize += size;\n }\n}\n\nKScreen::Mode* Generator::biggestMode(const KScreen::ModeList& modes)\n{\n int area, total = 0;\n KScreen::Mode* biggest = 0;\n Q_FOREACH(KScreen::Mode* mode, modes) {\n area = mode->size().width() * mode->size().height();\n if (area < total) {\n continue;\n }\n\n total = area;\n biggest = mode;\n }\n\n return biggest;\n}\n\nKScreen::Output* Generator::biggestOutput(const KScreen::OutputList &outputs)\n{\n int area, total = 0;\n KScreen::Output* biggest = 0;\n Q_FOREACH(KScreen::Output* output, outputs) {\n KScreen::Mode* mode = output->mode(output->preferredMode());\n area = mode->size().width() * mode->size().height();\n if (area < total) {\n continue;\n }\n\n total = area;\n biggest = output;\n }\n\n return biggest;\n}\n\nvoid Generator::disableAllDisconnectedOutputs(const KScreen::OutputList& outputs)\n{\n Q_FOREACH(KScreen::Output* output, outputs) {\n if (!output->isConnected()) {\n output->setEnabled(false);\n }\n }\n}\n\nbool Generator::isEmbedded(const QString& name)\n{\n QStringList embedded;\n embedded << \"LVDS\";\n embedded << \"IDP\";\n embedded << \"EDP\";\n\n Q_FOREACH(const QString &pre, embedded) {\n if (name.toUpper().startsWith(pre)) {\n qDebug() << \"This is embedded: \" << name;\n return true;\n }\n }\n\n return false;\n}\n\nbool Generator::isLaptop()\n{\n if (m_forceLaptop) {\n return true;\n }\n\n return m_device->isLaptop();\n}\n\nbool Generator::isLidClosed()\n{\n if (m_forceLidClosed) {\n return true;\n }\n\n return m_device->isLidClosed();\n}\n\nbool Generator::isDocked()\n{\n if (m_forceDocked) {\n return true;\n }\n\n return m_device->isDocked();\n}\n\nKScreen::Config* Generator::dockedLaptop()\n{\n return new KScreen::Config();\n}\n\nKScreen::Config* Generator::desktop()\n{\n return new KScreen::Config();\n}\n\nvoid Generator::setForceLaptop(bool force)\n{\n m_forceLaptop = force;\n}\n\nvoid Generator::setForceLidClosed(bool force)\n{\n m_forceLidClosed = force;\n}\n\nvoid Generator::setForceDocked(bool force)\n{\n m_forceDocked = force;\n}\n<commit_msg>Soem indentation fixes<commit_after>\/*************************************************************************************\n * Copyright (C) 2012 by Alejandro Fiestas Olivares <afiestas@kde.org> *\n * *\n * This program is free software; you can redistribute it and\/or *\n * modify it under the terms of the GNU General Public License *\n * as published by the Free Software Foundation; either version 2 *\n * of the License, or (at your option) any later version. *\n * *\n * This program is distributed in the hope that it will be useful, *\n * but WITHOUT ANY WARRANTY; without even the implied warranty of *\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the *\n * GNU General Public License for more details. *\n * *\n * You should have received a copy of the GNU General Public License *\n * along with this program; if not, write to the Free Software *\n * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA *\n *************************************************************************************\/\n\n#include \"generator.h\"\n#include \"device.h\"\n\n#include <QtCore\/QDebug>\n\n#include <QDBusReply>\n#include <QDBusMessage>\n#include <QDBusConnection>\n\n#include <kscreen\/config.h>\n\nGenerator* Generator::instance = 0;\n\nGenerator* Generator::self()\n{\n if (!Generator::instance) {\n Generator::instance = new Generator();\n }\n return Generator::instance;\n}\n\nGenerator::Generator()\n : QObject()\n , m_device(new Device(this))\n , m_isReady(false)\n , m_forceLaptop(false)\n , m_forceLidClosed(false)\n , m_forceDocked(false)\n{\n connect(m_device, SIGNAL(ready()), SIGNAL(ready()));\n}\n\nvoid Generator::destroy()\n{\n delete Generator::instance;\n}\n\nGenerator::~Generator()\n{\n delete m_device;\n}\n\nKScreen::Config* Generator::idealConfig()\n{\n KScreen::Config* config = KScreen::Config::current();\n\n disableAllDisconnectedOutputs(config->outputs());\n\n KScreen::OutputList connectedOutputs = config->connectedOutputs();\n\n if (connectedOutputs.count() == 1) {\n qDebug() << \"Config for one output\";\n KScreen::Output* output = connectedOutputs.take(connectedOutputs.keys().first());\n output->setCurrentMode(output->preferredMode());\n\n return config;\n }\n\n \/\/If we are a laptop, go into laptop mode\n if (isLaptop()) {\n return laptop(config, connectedOutputs);\n }\n\n extendToRight(connectedOutputs);\n\n return config;\n}\n\nKScreen::Config* Generator::laptop(KScreen::Config* config, KScreen::OutputList& outputs)\n{\n qDebug() << \"Config for a laptop\";\n\n KScreen::Output* embedded = 0;\n Q_FOREACH(KScreen::Output* output, outputs) {\n if (isEmbedded(output->name())) {\n embedded = output;\n outputs.remove(embedded->id());\n continue;\n }\n }\n\n if (outputs.isEmpty() || !embedded) {\n qWarning(\"Neither external outputs or embedded could be found\");\n return KScreen::Config::current();\n }\n\n if (isLidClosed() && outputs.count() == 1) {\n qDebug() << \"With lid closed\";\n embedded->setEnabled(false);\n\n KScreen::Output* external = outputs.value(outputs.keys().first());\n external->setEnabled(true);\n external->setCurrentMode(external->preferredMode());\n external->setPrimary(true);\n\n return config;\n }\n\n if (isLidClosed() && outputs.count() > 1) {\n embedded->setEnabled(false);\n embedded->setPrimary(false);\n\n extendToRight(outputs);\n\n return config;\n }\n\n \/\/If lid is open, laptop screen shuold be primary\n embedded->setPos(QPoint(0,0));\n embedded->setCurrentMode(embedded->preferredMode());\n embedded->setPrimary(true);\n embedded->setEnabled(true);\n\n QSize globalSize = embedded->mode(embedded->preferredMode())->size();\n KScreen::Output* biggest = biggestOutput(outputs);\n outputs.remove(biggest->id());\n\n biggest->setPos(QPoint(globalSize.width(), 0));\n biggest->setEnabled(true);\n biggest->setCurrentMode(biggest->preferredMode());\n biggest->setPrimary(false);\n\n QSize size;\n globalSize += biggest->mode(biggest->currentMode())->size();\n Q_FOREACH(KScreen::Output* output, outputs) {\n output->setEnabled(true);\n output->setCurrentMode(output->preferredMode());\n output->setPos(QPoint(globalSize.width(), 0));\n\n size = output->mode(output->currentMode())->size();\n globalSize += size;\n }\n\n if (isDocked()) {\n qDebug() << \"Docked\";\n embedded->setPrimary(false);\n biggest->setPrimary(true);\n }\n\n return config;\n}\n\nvoid Generator::extendToRight(KScreen::OutputList& outputs)\n{\n KScreen::Output* biggest = biggestOutput(outputs);\n outputs.remove(biggest->id());\n\n biggest->setEnabled(true);\n biggest->setPrimary(true);\n biggest->setCurrentMode(biggest->preferredMode());\n biggest->setPos(QPoint(0,0));\n\n QSize size;\n QSize globalSize = biggest->mode(biggest->currentMode())->size();\n Q_FOREACH(KScreen::Output* output, outputs) {\n output->setEnabled(true);\n output->setPrimary(false);\n output->setCurrentMode(output->preferredMode());\n output->setPos(QPoint(globalSize.width(), 0));\n\n size = output->mode(output->currentMode())->size();\n globalSize += size;\n }\n}\n\nKScreen::Mode* Generator::biggestMode(const KScreen::ModeList& modes)\n{\n int area, total = 0;\n KScreen::Mode* biggest = 0;\n Q_FOREACH(KScreen::Mode* mode, modes) {\n area = mode->size().width() * mode->size().height();\n if (area < total) {\n continue;\n }\n\n total = area;\n biggest = mode;\n }\n\n return biggest;\n}\n\nKScreen::Output* Generator::biggestOutput(const KScreen::OutputList &outputs)\n{\n int area, total = 0;\n KScreen::Output* biggest = 0;\n Q_FOREACH(KScreen::Output* output, outputs) {\n KScreen::Mode* mode = output->mode(output->preferredMode());\n area = mode->size().width() * mode->size().height();\n if (area < total) {\n continue;\n }\n\n total = area;\n biggest = output;\n }\n\n return biggest;\n}\n\nvoid Generator::disableAllDisconnectedOutputs(const KScreen::OutputList& outputs)\n{\n Q_FOREACH(KScreen::Output* output, outputs) {\n if (!output->isConnected()) {\n output->setEnabled(false);\n }\n }\n}\n\nbool Generator::isEmbedded(const QString& name)\n{\n QStringList embedded;\n embedded << \"LVDS\";\n embedded << \"IDP\";\n embedded << \"EDP\";\n\n Q_FOREACH(const QString &pre, embedded) {\n if (name.toUpper().startsWith(pre)) {\n qDebug() << \"This is embedded: \" << name;\n return true;\n }\n }\n\n return false;\n}\n\nbool Generator::isLaptop()\n{\n if (m_forceLaptop) {\n return true;\n }\n\n return m_device->isLaptop();\n}\n\nbool Generator::isLidClosed()\n{\n if (m_forceLidClosed) {\n return true;\n }\n\n return m_device->isLidClosed();\n}\n\nbool Generator::isDocked()\n{\n if (m_forceDocked) {\n return true;\n }\n\n return m_device->isDocked();\n}\n\nKScreen::Config* Generator::dockedLaptop()\n{\n return new KScreen::Config();\n}\n\nKScreen::Config* Generator::desktop()\n{\n return new KScreen::Config();\n}\n\nvoid Generator::setForceLaptop(bool force)\n{\n m_forceLaptop = force;\n}\n\nvoid Generator::setForceLidClosed(bool force)\n{\n m_forceLidClosed = force;\n}\n\nvoid Generator::setForceDocked(bool force)\n{\n m_forceDocked = force;\n}\n<|endoftext|>"} {"text":"<commit_before>\/\/\/ Project specific\n\/\/ This class\n#include <Manager\/EntitySpawnManager.hpp>\n\/\/ Handlers\n#include <EntityComponent\/EntityHandler.hpp>\n#include <EntityComponent\/EntityHandlerServer.hpp>\n#include <EventHandler\/EventHandler.hpp>\n\/\/ Components\n#include <EntityComponent\/Components\/EntitySpawnerComponent.hpp>\n#include <EntityComponent\/Components\/PhysicsMaterialComponent.hpp>\n#include <EntityComponent\/Components\/RigidBodyComponent.hpp>\n#include <EntityComponent\/Components\/EntityTypeComponent.hpp>\n#include <EntityComponent\/Components\/TransformComponent.hpp>\n#include <EntityComponent\/Components\/PotentialFieldComponent.hpp>\n\/\/ Events\n#include <EventHandler\/Events\/EntityCreatedEvent.hpp>\n\n\/\/\/ Engine\n\/\/ Physics\n#include <DoremiEngine\/Physics\/Include\/PhysicsModule.hpp>\n#include <DoremiEngine\/Physics\/Include\/PhysicsMaterialManager.hpp>\n#include <DoremiEngine\/Physics\/Include\/RigidBodyManager.hpp>\n#include <DoremiEngine\/Physics\/Include\/CharacterControlManager.hpp>\n\/\/ AI\n#include <DoremiEngine\/AI\/Include\/Interface\/SubModule\/PotentialFieldSubModule.hpp>\n#include<DoremiEngine\/AI\/Include\/AIModule.hpp>\n\/\/\/ Third party\n#include <DirectXMath.h>\nusing namespace DirectX;\n\n\/\/ DEBUG\n#include <iostream>\nusing namespace std;\n\nnamespace Doremi\n{\n namespace Core\n {\n EntitySpawnManager::EntitySpawnManager(const DoremiEngine::Core::SharedContext& p_sharedContext)\n : Manager(p_sharedContext, \"EntitySpawnManager\")\n {\n }\n\n EntitySpawnManager::~EntitySpawnManager() {}\n\n\n void EntitySpawnManager::Update(double p_dt)\n {\n\t\t\tstatic int DEBUGcount = 0;\n EntityHandler& entityHandler = EntityHandler::GetInstance();\n \/\/ Loop through all entities\n const size_t length = EntityHandler::GetInstance().GetLastEntityIndex();\n for(size_t i = 0; i < length; i++)\n {\n \/\/ Check that the current entity has the relevant components\n if(EntityHandler::GetInstance().HasComponents(i, (int)ComponentType::EntitySpawner) | (int)ComponentType::Transform)\n {\n \/\/ We've found an entity spawner\n EntitySpawnComponent* spawnComp = EntityHandler::GetInstance().GetComponentFromStorage<EntitySpawnComponent>(i);\n \/\/ Check if its a timed spawned\n if(spawnComp->type == SpawnerType::TimedSpawner)\n {\n \/\/ Update time since last spawn\n spawnComp->timeSinceLastSpawn += p_dt;\n \/\/ Check if it's time to spawn and if we haven't already spawned the max number\n if(spawnComp->timeSinceLastSpawn >= spawnComp->timeBetweenSpawns && spawnComp->currentNumSpawnedEntities < spawnComp->maxNumSpawnedEntites)\n {\n \/\/ Reset timer\n spawnComp->timeSinceLastSpawn = 0;\n \/\/ We should spawn something\n CreateEntity(spawnComp->entityBlueprint, i);\n spawnComp->currentNumSpawnedEntities++;\n }\n else\n {\n \/\/ Nothing\n }\n }\n else\n {\n \/\/ nothing\n }\n }\n }\n }\n\n void EntitySpawnManager::OnEvent(Event* p_event) {}\n\n void EntitySpawnManager::CreateEntity(Blueprints p_blueprint, int p_spawnerID)\n {\n EntityHandler& entityHandler = EntityHandler::GetInstance();\n switch(p_blueprint)\n {\n case Blueprints::EnemyEntity:\n TransformComponent* transComp = entityHandler.GetComponentFromStorage<TransformComponent>(p_spawnerID);\n \/\/ Spawn inside the spawner. This might be changed in the future\n XMFLOAT3 spawnPosition = transComp->position;\n int newID = EntityHandlerServer::GetInstance().CreateEntity(Blueprints::EnemyEntity, spawnPosition);\n int matID = Core::EntityHandler::GetInstance().GetComponentFromStorage<Core::PhysicsMaterialComponent>(newID)->p_materialID;\n m_sharedContext.GetPhysicsModule().GetCharacterControlManager().AddController(newID, matID, spawnPosition, XMFLOAT2(0.1f, 0.5f));\n\n Core::PotentialFieldComponent* potentialComponent =\n Core::EntityHandler::GetInstance().GetComponentFromStorage<Core::PotentialFieldComponent>(newID);\n potentialComponent->ChargedActor =\n m_sharedContext.GetAIModule().GetPotentialFieldSubModule().CreateNewActor(spawnPosition, -1.0f, 3.0f, false);\n\n EntityCreatedEvent* AIGroupActorCreated = new Core::EntityCreatedEvent(newID, Core::EventType::AiGroupActorCreation);\n EventHandler::GetInstance()->BroadcastEvent(AIGroupActorCreated);\n break;\n }\n }\n }\n}<commit_msg>EnemySpawner: hax to ensure no spawns before players have joined<commit_after>\/\/\/ Project specific\n\/\/ This class\n#include <Manager\/EntitySpawnManager.hpp>\n\/\/ Handlers\n#include <EntityComponent\/EntityHandler.hpp>\n#include <EntityComponent\/EntityHandlerServer.hpp>\n#include <EventHandler\/EventHandler.hpp>\n#include <PlayerHandler.hpp>\n\/\/ Components\n#include <EntityComponent\/Components\/EntitySpawnerComponent.hpp>\n#include <EntityComponent\/Components\/PhysicsMaterialComponent.hpp>\n#include <EntityComponent\/Components\/RigidBodyComponent.hpp>\n#include <EntityComponent\/Components\/EntityTypeComponent.hpp>\n#include <EntityComponent\/Components\/TransformComponent.hpp>\n#include <EntityComponent\/Components\/PotentialFieldComponent.hpp>\n\/\/ Events\n#include <EventHandler\/Events\/EntityCreatedEvent.hpp>\n\n\/\/\/ Engine\n\/\/ Physics\n#include <DoremiEngine\/Physics\/Include\/PhysicsModule.hpp>\n#include <DoremiEngine\/Physics\/Include\/PhysicsMaterialManager.hpp>\n#include <DoremiEngine\/Physics\/Include\/RigidBodyManager.hpp>\n#include <DoremiEngine\/Physics\/Include\/CharacterControlManager.hpp>\n\/\/ AI\n#include <DoremiEngine\/AI\/Include\/Interface\/SubModule\/PotentialFieldSubModule.hpp>\n#include<DoremiEngine\/AI\/Include\/AIModule.hpp>\n\/\/\/ Third party\n#include <DirectXMath.h>\nusing namespace DirectX;\n\n\/\/ DEBUG\n#include <iostream>\nusing namespace std;\n\nnamespace Doremi\n{\n namespace Core\n {\n EntitySpawnManager::EntitySpawnManager(const DoremiEngine::Core::SharedContext& p_sharedContext)\n : Manager(p_sharedContext, \"EntitySpawnManager\")\n {\n }\n\n EntitySpawnManager::~EntitySpawnManager() {}\n\n\n void EntitySpawnManager::Update(double p_dt)\n {\n\t\t\tstatic int DEBUGcount = 0;\n EntityHandler& entityHandler = EntityHandler::GetInstance();\n \/\/ Loop through all entities\n const size_t length = EntityHandler::GetInstance().GetLastEntityIndex();\n for(size_t i = 0; i < length; i++)\n {\n \/\/ Check that the current entity has the relevant components\n if(EntityHandler::GetInstance().HasComponents(i, (int)ComponentType::EntitySpawner) | (int)ComponentType::Transform)\n {\n \/\/ We've found an entity spawner\n EntitySpawnComponent* spawnComp = EntityHandler::GetInstance().GetComponentFromStorage<EntitySpawnComponent>(i);\n \/\/ Check if its a timed spawned\n if(spawnComp->type == SpawnerType::TimedSpawner)\n {\n \/\/ Update time since last spawn\n spawnComp->timeSinceLastSpawn += p_dt;\n \/\/ Check if it's time to spawn and if we haven't already spawned the max number\n if(spawnComp->timeSinceLastSpawn >= spawnComp->timeBetweenSpawns && spawnComp->currentNumSpawnedEntities < spawnComp->maxNumSpawnedEntites)\n {\n \/\/ Hax to ensure nothing spawns when no players are active, which apparently is a no-can-do\n if(PlayerHandler::GetInstance()->GetPlayerMap().size() > 0)\n {\n \/\/ We should spawn something\n CreateEntity(spawnComp->entityBlueprint, i);\n spawnComp->currentNumSpawnedEntities++;\n }\n \/\/ Reset timer\n spawnComp->timeSinceLastSpawn = 0;\n }\n else\n {\n \/\/ Nothing\n }\n }\n else\n {\n \/\/ nothing\n }\n }\n }\n }\n\n void EntitySpawnManager::OnEvent(Event* p_event) {}\n\n void EntitySpawnManager::CreateEntity(Blueprints p_blueprint, int p_spawnerID)\n {\n EntityHandler& entityHandler = EntityHandler::GetInstance();\n switch(p_blueprint)\n {\n case Blueprints::EnemyEntity:\n TransformComponent* transComp = entityHandler.GetComponentFromStorage<TransformComponent>(p_spawnerID);\n \/\/ Spawn inside the spawner. This might be changed in the future\n XMFLOAT3 spawnPosition = transComp->position;\n int newID = EntityHandlerServer::GetInstance().CreateEntity(Blueprints::EnemyEntity, spawnPosition);\n int matID = Core::EntityHandler::GetInstance().GetComponentFromStorage<Core::PhysicsMaterialComponent>(newID)->p_materialID;\n m_sharedContext.GetPhysicsModule().GetCharacterControlManager().AddController(newID, matID, spawnPosition, XMFLOAT2(0.1f, 0.5f));\n\n Core::PotentialFieldComponent* potentialComponent =\n Core::EntityHandler::GetInstance().GetComponentFromStorage<Core::PotentialFieldComponent>(newID);\n potentialComponent->ChargedActor =\n m_sharedContext.GetAIModule().GetPotentialFieldSubModule().CreateNewActor(spawnPosition, -1.0f, 3.0f, false);\n\n EntityCreatedEvent* AIGroupActorCreated = new Core::EntityCreatedEvent(newID, Core::EventType::AiGroupActorCreation);\n EventHandler::GetInstance()->BroadcastEvent(AIGroupActorCreated);\n break;\n }\n }\n }\n}<|endoftext|>"} {"text":"<commit_before>\/\/ Copyright (c) 2006-2010 The Chromium Authors. All rights reserved.\n\/\/ Use of this source code is governed by a BSD-style license that can be\n\/\/ found in the LICENSE file.\n\n#include \"chrome\/common\/chrome_paths.h\"\n\n#include \"base\/command_line.h\"\n#include \"base\/file_util.h\"\n#include \"base\/logging.h\"\n#include \"base\/path_service.h\"\n#include \"base\/string_util.h\"\n#include \"base\/sys_info.h\"\n#include \"chrome\/common\/chrome_constants.h\"\n#include \"chrome\/common\/chrome_paths_internal.h\"\n#include \"chrome\/common\/chrome_switches.h\"\n\n#if defined(OS_MACOSX)\n#include \"base\/mac_util.h\"\n#endif\n\nnamespace {\n\n\/\/ File name of the internal Flash plugin on different platforms.\nconst FilePath::CharType kInternalFlashPluginFileName[] =\n#if defined(OS_MACOSX)\n FILE_PATH_LITERAL(\"Flash Player Plugin for Chrome.plugin\");\n#elif defined(OS_WIN)\n FILE_PATH_LITERAL(\"gcswf32.dll\");\n#else \/\/ OS_LINUX, etc.\n FILE_PATH_LITERAL(\"libgcflashplayer.so\");\n#endif\n\n} \/\/ namespace\n\nnamespace chrome {\n\n\/\/ Gets the path for internal (or bundled) plugins.\nbool GetInternalPluginsDirectory(FilePath* result) {\n#if defined(OS_MACOSX)\n \/\/ If called from Chrome, get internal plugins from the versioned directory.\n if (mac_util::AmIBundled()) {\n *result = chrome::GetVersionedDirectory();\n DCHECK(!result->empty());\n return true;\n }\n \/\/ In tests, just look in the module directory (below).\n#endif\n\n \/\/ The rest of the world expects plugins in the module directory.\n return PathService::Get(base::DIR_MODULE, result);\n}\n\nbool GetGearsPluginPathFromCommandLine(FilePath* path) {\n#ifndef NDEBUG\n \/\/ for debugging, support a cmd line based override\n FilePath plugin_path =\n CommandLine::ForCurrentProcess()->GetSwitchValuePath(\n switches::kGearsPluginPathOverride);\n *path = plugin_path;\n return !plugin_path.empty();\n#else\n return false;\n#endif\n}\n\nbool PathProvider(int key, FilePath* result) {\n \/\/ Some keys are just aliases...\n switch (key) {\n case chrome::DIR_APP:\n return PathService::Get(base::DIR_MODULE, result);\n case chrome::DIR_LOGS:\n#ifdef NDEBUG\n \/\/ Release builds write to the data dir\n return PathService::Get(chrome::DIR_USER_DATA, result);\n#else\n \/\/ Debug builds write next to the binary (in the build tree)\n#if defined(OS_MACOSX)\n if (!PathService::Get(base::DIR_EXE, result))\n return false;\n if (mac_util::AmIBundled()) {\n \/\/ If we're called from chrome, dump it beside the app (outside the\n \/\/ app bundle), if we're called from a unittest, we'll already\n \/\/ outside the bundle so use the exe dir.\n \/\/ exe_dir gave us ...\/Chromium.app\/Contents\/MacOS\/Chromium.\n *result = result->DirName();\n *result = result->DirName();\n *result = result->DirName();\n }\n return true;\n#else\n return PathService::Get(base::DIR_EXE, result);\n#endif \/\/ defined(OS_MACOSX)\n#endif \/\/ NDEBUG\n case chrome::FILE_RESOURCE_MODULE:\n return PathService::Get(base::FILE_MODULE, result);\n }\n\n \/\/ Assume that we will not need to create the directory if it does not exist.\n \/\/ This flag can be set to true for the cases where we want to create it.\n bool create_dir = false;\n\n FilePath cur;\n switch (key) {\n case chrome::DIR_USER_DATA:\n if (!GetDefaultUserDataDirectory(&cur)) {\n NOTREACHED();\n return false;\n }\n create_dir = true;\n break;\n case chrome::DIR_USER_DOCUMENTS:\n if (!GetUserDocumentsDirectory(&cur))\n return false;\n create_dir = true;\n break;\n case chrome::DIR_DEFAULT_DOWNLOADS_SAFE:\n#if defined(OS_WIN)\n if (!GetUserDownloadsDirectorySafe(&cur))\n return false;\n break;\n#else\n \/\/ Fall through for all other platforms.\n#endif\n case chrome::DIR_DEFAULT_DOWNLOADS:\n if (!GetUserDownloadsDirectory(&cur))\n return false;\n \/\/ Do not create the download directory here, we have done it twice now\n \/\/ and annoyed a lot of users.\n break;\n case chrome::DIR_CRASH_DUMPS:\n \/\/ The crash reports are always stored relative to the default user data\n \/\/ directory. This avoids the problem of having to re-initialize the\n \/\/ exception handler after parsing command line options, which may\n \/\/ override the location of the app's profile directory.\n if (!GetDefaultUserDataDirectory(&cur))\n return false;\n cur = cur.Append(FILE_PATH_LITERAL(\"Crash Reports\"));\n create_dir = true;\n break;\n case chrome::DIR_USER_DESKTOP:\n if (!GetUserDesktop(&cur))\n return false;\n break;\n case chrome::DIR_RESOURCES:\n#if defined(OS_MACOSX)\n cur = mac_util::MainAppBundlePath();\n cur = cur.Append(FILE_PATH_LITERAL(\"Resources\"));\n#else\n if (!PathService::Get(chrome::DIR_APP, &cur))\n return false;\n cur = cur.Append(FILE_PATH_LITERAL(\"resources\"));\n#endif\n break;\n case chrome::DIR_SHARED_RESOURCES:\n if (!PathService::Get(chrome::DIR_RESOURCES, &cur))\n return false;\n cur = cur.Append(FILE_PATH_LITERAL(\"shared\"));\n break;\n case chrome::DIR_BOOKMARK_MANAGER:\n if (!PathService::Get(chrome::DIR_RESOURCES, &cur))\n return false;\n cur = cur.Append(FILE_PATH_LITERAL(\"bookmark_manager\"));\n break;\n case chrome::DIR_INSPECTOR:\n if (!PathService::Get(chrome::DIR_RESOURCES, &cur))\n return false;\n cur = cur.Append(FILE_PATH_LITERAL(\"inspector\"));\n break;\n case chrome::DIR_NET_INTERNALS:\n if (!PathService::Get(chrome::DIR_RESOURCES, &cur))\n return false;\n cur = cur.Append(FILE_PATH_LITERAL(\"net_internals\"));\n break;\n case chrome::DIR_APP_DICTIONARIES:\n#if defined(OS_LINUX) || defined(OS_MACOSX)\n \/\/ We can't write into the EXE dir on Linux, so keep dictionaries\n \/\/ alongside the safe browsing database in the user data dir.\n \/\/ And we don't want to write into the bundle on the Mac, so push\n \/\/ it to the user data dir there also.\n if (!PathService::Get(chrome::DIR_USER_DATA, &cur))\n return false;\n#else\n if (!PathService::Get(base::DIR_EXE, &cur))\n return false;\n#endif\n cur = cur.Append(FILE_PATH_LITERAL(\"Dictionaries\"));\n create_dir = true;\n break;\n case chrome::DIR_USER_DATA_TEMP:\n if (!PathService::Get(chrome::DIR_USER_DATA, &cur))\n return false;\n cur = cur.Append(FILE_PATH_LITERAL(\"Temp\"));\n create_dir = true;\n break;\n case chrome::DIR_INTERNAL_PLUGINS:\n if (!GetInternalPluginsDirectory(&cur))\n return false;\n break;\n case chrome::FILE_LOCAL_STATE:\n if (!PathService::Get(chrome::DIR_USER_DATA, &cur))\n return false;\n cur = cur.Append(chrome::kLocalStateFilename);\n break;\n case chrome::FILE_RECORDED_SCRIPT:\n if (!PathService::Get(chrome::DIR_USER_DATA, &cur))\n return false;\n cur = cur.Append(FILE_PATH_LITERAL(\"script.log\"));\n break;\n case chrome::FILE_GEARS_PLUGIN:\n if (!GetGearsPluginPathFromCommandLine(&cur)) {\n#if defined(OS_WIN)\n \/\/ Search for gears.dll alongside chrome.dll first. This new model\n \/\/ allows us to package gears.dll with the Chrome installer and update\n \/\/ it while Chrome is running.\n if (!GetInternalPluginsDirectory(&cur))\n return false;\n cur = cur.Append(FILE_PATH_LITERAL(\"gears.dll\"));\n\n if (!file_util::PathExists(cur)) {\n if (!PathService::Get(base::DIR_EXE, &cur))\n return false;\n cur = cur.Append(FILE_PATH_LITERAL(\"plugins\"));\n cur = cur.Append(FILE_PATH_LITERAL(\"gears\"));\n cur = cur.Append(FILE_PATH_LITERAL(\"gears.dll\"));\n }\n#else\n \/\/ No gears.dll on non-Windows systems.\n return false;\n#endif\n }\n break;\n case chrome::FILE_FLASH_PLUGIN:\n if (!GetInternalPluginsDirectory(&cur))\n return false;\n cur = cur.Append(kInternalFlashPluginFileName);\n if (!file_util::PathExists(cur))\n return false;\n break;\n case chrome::FILE_PDF_PLUGIN:\n if (!PathService::Get(base::DIR_MODULE, &cur))\n return false;\n#if defined(OS_WIN)\n cur = cur.Append(FILE_PATH_LITERAL(\"pdf.dll\"));\n#elif defined(OS_MACOSX)\n NOTIMPLEMENTED();\n return false;\n#else \/\/ Linux and Chrome OS\n cur = cur.Append(FILE_PATH_LITERAL(\"libpdf.so\"));\n#endif\n if (!file_util::PathExists(cur))\n return false;\n break;\n#if defined(OS_CHROMEOS)\n case chrome::FILE_CHROMEOS_API:\n if (!PathService::Get(base::DIR_MODULE, &cur))\n return false;\n cur = cur.Append(FILE_PATH_LITERAL(\"chromeos\"));\n cur = cur.Append(FILE_PATH_LITERAL(\"libcros.so\"));\n break;\n#endif\n \/\/ The following are only valid in the development environment, and\n \/\/ will fail if executed from an installed executable (because the\n \/\/ generated path won't exist).\n case chrome::DIR_TEST_DATA:\n if (!PathService::Get(base::DIR_SOURCE_ROOT, &cur))\n return false;\n cur = cur.Append(FILE_PATH_LITERAL(\"chrome\"));\n cur = cur.Append(FILE_PATH_LITERAL(\"test\"));\n cur = cur.Append(FILE_PATH_LITERAL(\"data\"));\n if (!file_util::PathExists(cur)) \/\/ we don't want to create this\n return false;\n break;\n case chrome::DIR_TEST_TOOLS:\n if (!PathService::Get(base::DIR_SOURCE_ROOT, &cur))\n return false;\n cur = cur.Append(FILE_PATH_LITERAL(\"chrome\"));\n cur = cur.Append(FILE_PATH_LITERAL(\"tools\"));\n cur = cur.Append(FILE_PATH_LITERAL(\"test\"));\n if (!file_util::PathExists(cur)) \/\/ we don't want to create this\n return false;\n break;\n default:\n return false;\n }\n\n if (create_dir && !file_util::PathExists(cur) &&\n !file_util::CreateDirectory(cur))\n return false;\n\n *result = cur;\n return true;\n}\n\n\/\/ This cannot be done as a static initializer sadly since Visual Studio will\n\/\/ eliminate this object file if there is no direct entry point into it.\nvoid RegisterPathProvider() {\n PathService::RegisterProvider(PathProvider, PATH_START, PATH_END);\n}\n\n} \/\/ namespace chrome\n<commit_msg>[Mac] stop the output that is slowing down all the tests that seem to walk this code path.<commit_after>\/\/ Copyright (c) 2006-2010 The Chromium Authors. All rights reserved.\n\/\/ Use of this source code is governed by a BSD-style license that can be\n\/\/ found in the LICENSE file.\n\n#include \"chrome\/common\/chrome_paths.h\"\n\n#include \"base\/command_line.h\"\n#include \"base\/file_util.h\"\n#include \"base\/logging.h\"\n#include \"base\/path_service.h\"\n#include \"base\/string_util.h\"\n#include \"base\/sys_info.h\"\n#include \"chrome\/common\/chrome_constants.h\"\n#include \"chrome\/common\/chrome_paths_internal.h\"\n#include \"chrome\/common\/chrome_switches.h\"\n\n#if defined(OS_MACOSX)\n#include \"base\/mac_util.h\"\n#endif\n\nnamespace {\n\n\/\/ File name of the internal Flash plugin on different platforms.\nconst FilePath::CharType kInternalFlashPluginFileName[] =\n#if defined(OS_MACOSX)\n FILE_PATH_LITERAL(\"Flash Player Plugin for Chrome.plugin\");\n#elif defined(OS_WIN)\n FILE_PATH_LITERAL(\"gcswf32.dll\");\n#else \/\/ OS_LINUX, etc.\n FILE_PATH_LITERAL(\"libgcflashplayer.so\");\n#endif\n\n} \/\/ namespace\n\nnamespace chrome {\n\n\/\/ Gets the path for internal (or bundled) plugins.\nbool GetInternalPluginsDirectory(FilePath* result) {\n#if defined(OS_MACOSX)\n \/\/ If called from Chrome, get internal plugins from the versioned directory.\n if (mac_util::AmIBundled()) {\n *result = chrome::GetVersionedDirectory();\n DCHECK(!result->empty());\n return true;\n }\n \/\/ In tests, just look in the module directory (below).\n#endif\n\n \/\/ The rest of the world expects plugins in the module directory.\n return PathService::Get(base::DIR_MODULE, result);\n}\n\nbool GetGearsPluginPathFromCommandLine(FilePath* path) {\n#ifndef NDEBUG\n \/\/ for debugging, support a cmd line based override\n FilePath plugin_path =\n CommandLine::ForCurrentProcess()->GetSwitchValuePath(\n switches::kGearsPluginPathOverride);\n *path = plugin_path;\n return !plugin_path.empty();\n#else\n return false;\n#endif\n}\n\nbool PathProvider(int key, FilePath* result) {\n \/\/ Some keys are just aliases...\n switch (key) {\n case chrome::DIR_APP:\n return PathService::Get(base::DIR_MODULE, result);\n case chrome::DIR_LOGS:\n#ifdef NDEBUG\n \/\/ Release builds write to the data dir\n return PathService::Get(chrome::DIR_USER_DATA, result);\n#else\n \/\/ Debug builds write next to the binary (in the build tree)\n#if defined(OS_MACOSX)\n if (!PathService::Get(base::DIR_EXE, result))\n return false;\n if (mac_util::AmIBundled()) {\n \/\/ If we're called from chrome, dump it beside the app (outside the\n \/\/ app bundle), if we're called from a unittest, we'll already\n \/\/ outside the bundle so use the exe dir.\n \/\/ exe_dir gave us ...\/Chromium.app\/Contents\/MacOS\/Chromium.\n *result = result->DirName();\n *result = result->DirName();\n *result = result->DirName();\n }\n return true;\n#else\n return PathService::Get(base::DIR_EXE, result);\n#endif \/\/ defined(OS_MACOSX)\n#endif \/\/ NDEBUG\n case chrome::FILE_RESOURCE_MODULE:\n return PathService::Get(base::FILE_MODULE, result);\n }\n\n \/\/ Assume that we will not need to create the directory if it does not exist.\n \/\/ This flag can be set to true for the cases where we want to create it.\n bool create_dir = false;\n\n FilePath cur;\n switch (key) {\n case chrome::DIR_USER_DATA:\n if (!GetDefaultUserDataDirectory(&cur)) {\n NOTREACHED();\n return false;\n }\n create_dir = true;\n break;\n case chrome::DIR_USER_DOCUMENTS:\n if (!GetUserDocumentsDirectory(&cur))\n return false;\n create_dir = true;\n break;\n case chrome::DIR_DEFAULT_DOWNLOADS_SAFE:\n#if defined(OS_WIN)\n if (!GetUserDownloadsDirectorySafe(&cur))\n return false;\n break;\n#else\n \/\/ Fall through for all other platforms.\n#endif\n case chrome::DIR_DEFAULT_DOWNLOADS:\n if (!GetUserDownloadsDirectory(&cur))\n return false;\n \/\/ Do not create the download directory here, we have done it twice now\n \/\/ and annoyed a lot of users.\n break;\n case chrome::DIR_CRASH_DUMPS:\n \/\/ The crash reports are always stored relative to the default user data\n \/\/ directory. This avoids the problem of having to re-initialize the\n \/\/ exception handler after parsing command line options, which may\n \/\/ override the location of the app's profile directory.\n if (!GetDefaultUserDataDirectory(&cur))\n return false;\n cur = cur.Append(FILE_PATH_LITERAL(\"Crash Reports\"));\n create_dir = true;\n break;\n case chrome::DIR_USER_DESKTOP:\n if (!GetUserDesktop(&cur))\n return false;\n break;\n case chrome::DIR_RESOURCES:\n#if defined(OS_MACOSX)\n cur = mac_util::MainAppBundlePath();\n cur = cur.Append(FILE_PATH_LITERAL(\"Resources\"));\n#else\n if (!PathService::Get(chrome::DIR_APP, &cur))\n return false;\n cur = cur.Append(FILE_PATH_LITERAL(\"resources\"));\n#endif\n break;\n case chrome::DIR_SHARED_RESOURCES:\n if (!PathService::Get(chrome::DIR_RESOURCES, &cur))\n return false;\n cur = cur.Append(FILE_PATH_LITERAL(\"shared\"));\n break;\n case chrome::DIR_BOOKMARK_MANAGER:\n if (!PathService::Get(chrome::DIR_RESOURCES, &cur))\n return false;\n cur = cur.Append(FILE_PATH_LITERAL(\"bookmark_manager\"));\n break;\n case chrome::DIR_INSPECTOR:\n if (!PathService::Get(chrome::DIR_RESOURCES, &cur))\n return false;\n cur = cur.Append(FILE_PATH_LITERAL(\"inspector\"));\n break;\n case chrome::DIR_NET_INTERNALS:\n if (!PathService::Get(chrome::DIR_RESOURCES, &cur))\n return false;\n cur = cur.Append(FILE_PATH_LITERAL(\"net_internals\"));\n break;\n case chrome::DIR_APP_DICTIONARIES:\n#if defined(OS_LINUX) || defined(OS_MACOSX)\n \/\/ We can't write into the EXE dir on Linux, so keep dictionaries\n \/\/ alongside the safe browsing database in the user data dir.\n \/\/ And we don't want to write into the bundle on the Mac, so push\n \/\/ it to the user data dir there also.\n if (!PathService::Get(chrome::DIR_USER_DATA, &cur))\n return false;\n#else\n if (!PathService::Get(base::DIR_EXE, &cur))\n return false;\n#endif\n cur = cur.Append(FILE_PATH_LITERAL(\"Dictionaries\"));\n create_dir = true;\n break;\n case chrome::DIR_USER_DATA_TEMP:\n if (!PathService::Get(chrome::DIR_USER_DATA, &cur))\n return false;\n cur = cur.Append(FILE_PATH_LITERAL(\"Temp\"));\n create_dir = true;\n break;\n case chrome::DIR_INTERNAL_PLUGINS:\n if (!GetInternalPluginsDirectory(&cur))\n return false;\n break;\n case chrome::FILE_LOCAL_STATE:\n if (!PathService::Get(chrome::DIR_USER_DATA, &cur))\n return false;\n cur = cur.Append(chrome::kLocalStateFilename);\n break;\n case chrome::FILE_RECORDED_SCRIPT:\n if (!PathService::Get(chrome::DIR_USER_DATA, &cur))\n return false;\n cur = cur.Append(FILE_PATH_LITERAL(\"script.log\"));\n break;\n case chrome::FILE_GEARS_PLUGIN:\n if (!GetGearsPluginPathFromCommandLine(&cur)) {\n#if defined(OS_WIN)\n \/\/ Search for gears.dll alongside chrome.dll first. This new model\n \/\/ allows us to package gears.dll with the Chrome installer and update\n \/\/ it while Chrome is running.\n if (!GetInternalPluginsDirectory(&cur))\n return false;\n cur = cur.Append(FILE_PATH_LITERAL(\"gears.dll\"));\n\n if (!file_util::PathExists(cur)) {\n if (!PathService::Get(base::DIR_EXE, &cur))\n return false;\n cur = cur.Append(FILE_PATH_LITERAL(\"plugins\"));\n cur = cur.Append(FILE_PATH_LITERAL(\"gears\"));\n cur = cur.Append(FILE_PATH_LITERAL(\"gears.dll\"));\n }\n#else\n \/\/ No gears.dll on non-Windows systems.\n return false;\n#endif\n }\n break;\n case chrome::FILE_FLASH_PLUGIN:\n if (!GetInternalPluginsDirectory(&cur))\n return false;\n cur = cur.Append(kInternalFlashPluginFileName);\n if (!file_util::PathExists(cur))\n return false;\n break;\n case chrome::FILE_PDF_PLUGIN:\n if (!PathService::Get(base::DIR_MODULE, &cur))\n return false;\n#if defined(OS_WIN)\n cur = cur.Append(FILE_PATH_LITERAL(\"pdf.dll\"));\n#elif defined(OS_MACOSX)\n \/\/ http:\/\/crbug.com\/44900\n return false;\n#else \/\/ Linux and Chrome OS\n cur = cur.Append(FILE_PATH_LITERAL(\"libpdf.so\"));\n#endif\n if (!file_util::PathExists(cur))\n return false;\n break;\n#if defined(OS_CHROMEOS)\n case chrome::FILE_CHROMEOS_API:\n if (!PathService::Get(base::DIR_MODULE, &cur))\n return false;\n cur = cur.Append(FILE_PATH_LITERAL(\"chromeos\"));\n cur = cur.Append(FILE_PATH_LITERAL(\"libcros.so\"));\n break;\n#endif\n \/\/ The following are only valid in the development environment, and\n \/\/ will fail if executed from an installed executable (because the\n \/\/ generated path won't exist).\n case chrome::DIR_TEST_DATA:\n if (!PathService::Get(base::DIR_SOURCE_ROOT, &cur))\n return false;\n cur = cur.Append(FILE_PATH_LITERAL(\"chrome\"));\n cur = cur.Append(FILE_PATH_LITERAL(\"test\"));\n cur = cur.Append(FILE_PATH_LITERAL(\"data\"));\n if (!file_util::PathExists(cur)) \/\/ we don't want to create this\n return false;\n break;\n case chrome::DIR_TEST_TOOLS:\n if (!PathService::Get(base::DIR_SOURCE_ROOT, &cur))\n return false;\n cur = cur.Append(FILE_PATH_LITERAL(\"chrome\"));\n cur = cur.Append(FILE_PATH_LITERAL(\"tools\"));\n cur = cur.Append(FILE_PATH_LITERAL(\"test\"));\n if (!file_util::PathExists(cur)) \/\/ we don't want to create this\n return false;\n break;\n default:\n return false;\n }\n\n if (create_dir && !file_util::PathExists(cur) &&\n !file_util::CreateDirectory(cur))\n return false;\n\n *result = cur;\n return true;\n}\n\n\/\/ This cannot be done as a static initializer sadly since Visual Studio will\n\/\/ eliminate this object file if there is no direct entry point into it.\nvoid RegisterPathProvider() {\n PathService::RegisterProvider(PathProvider, PATH_START, PATH_END);\n}\n\n} \/\/ namespace chrome\n<|endoftext|>"} {"text":"<commit_before>\/*=========================================================================\n\n Program: Insight Segmentation & Registration Toolkit\n Module: DeformableRegistration1.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\n#include \"itkImageFileReader.h\" \n#include \"itkRawImageIO.h\"\n\n\/\/#include \"itkImageFileWriter.h\"\n\/\/#include \"itkRawImageWriter.h\"\n\n#include \"itkRescaleIntensityImageFilter.h\"\n#include \"itkHistogramMatchingImageFilter.h\"\n\n#include \"itkFEM.h\"\n#include \"itkFEMRegistrationFilter.h\"\n\n\n\/\/ Below, we have typedefs that instantiate all necessary classes.\n\/\/ Here, we instantiate the image type, load type and \n\/\/ explicitly template the load implementation type.\n\n#define TWOD\n\/\/#define THREED\n\n#ifdef TWOD\ntypedef itk::Image< unsigned char, 2 > fileImageType;\ntypedef itk::Image< float, 2 > ImageType;\n\n\/\/ We now declare an element type and load implementation pointer for the visitor class.\ntypedef itk::fem::Element2DC0LinearTriangularMembrane ElementType2;\ntypedef itk::fem::Element2DC0LinearQuadrilateralMembrane ElementType;\n#endif \n\n#ifdef THREED\ntypedef itk::Image< unsigned char, 3 > fileImageType;\ntypedef itk::Image< float, 3 > ImageType;\ntypedef itk::fem::Element3DC0LinearHexahedronMembrane ElementType;\ntypedef itk::fem::Element3DC0LinearTetrahedronMembrane ElementType2;\n#endif\n\ntypedef itk::fem::ImageMetricLoad<ImageType,ImageType> ImageLoadType;\ntemplate class itk::fem::ImageMetricLoadImplementation<ImageLoadType>;\ntypedef ElementType::LoadImplementationFunctionPointer LoadImpFP;\ntypedef ElementType::LoadType ElementLoadType;\ntypedef ElementType2::LoadImplementationFunctionPointer LoadImpFP2;\ntypedef ElementType2::LoadType ElementLoadType2;\ntypedef itk::fem::VisitorDispatcher<ElementType,ElementLoadType, LoadImpFP> \n DispatcherType;\ntypedef itk::fem::VisitorDispatcher<ElementType2,ElementLoadType2, LoadImpFP2> \n DispatcherType2;\n\ntypedef itk::fem::FEMRegistrationFilter<ImageType,ImageType> RegistrationType;\n\nint main(int argc, char *argv[])\n{\n char *paramname;\n if ( argc < 2 )\n {\n std::cout << \"Parameter file name missing\" << std::endl;\n std::cout << \"Usage: \" << argv[0] << \" param.file\" << std::endl;\n return -1;\n } \n else { paramname=argv[1]; }\n \n \/\/ Register the correct load implementation with the element typed visitor dispatcher. \n {\n ElementType::LoadImplementationFunctionPointer fp = \n &itk::fem::ImageMetricLoadImplementation<ImageLoadType>::ImplementImageMetricLoad;\n DispatcherType::RegisterVisitor((ImageLoadType*)0,fp);\n }\n {\n ElementType2::LoadImplementationFunctionPointer fp =\n &itk::fem::ImageMetricLoadImplementation<ImageLoadType>::ImplementImageMetricLoad;\n DispatcherType2::RegisterVisitor((ImageLoadType*)0,fp);\n }\n\n \/\/ Declare the FEM registration class\n RegistrationType::Pointer X= RegistrationType::New(); \n\n \/\/ Attempt to read the parameter file, and exit if an error occurs\n X->SetConfigFileName(paramname);\n if ( !X->ReadConfigFile( (X->GetConfigFileName()).c_str() ) ) { return -1; }\n \n \/\/ Read the image files\n typedef itk::ImageFileReader< fileImageType > FileSourceType;\n typedef fileImageType::PixelType PixType;\n const unsigned int ImageDimension=fileImageType::ImageDimension;\n typedef itk::RawImageIO< PixType,ImageDimension> RawReaderType;\n\n FileSourceType::Pointer reffilter = FileSourceType::New();\n reffilter->SetFileName( (X->GetReferenceFile()).c_str() );\n FileSourceType::Pointer tarfilter = FileSourceType::New();\n tarfilter->SetFileName( (X->GetTargetFile()).c_str() );\n\n RawReaderType::Pointer rawReader = RawReaderType::New();\n rawReader->SetFileDimensionality( ImageDimension );\n\n ImageType::SizeType ImageSize=X->GetImageSize();\n for (unsigned int ii=0; ii<ImageDimension; ii++) \n {\n unsigned int temp = (unsigned int) ImageSize[ii];\n rawReader->SetDimensions( ii, temp );\n }\n reffilter->SetImageIO( rawReader );\n tarfilter->SetImageIO( rawReader );\n\n try\n {\n reffilter->Update();\n }\n catch( itk::ExceptionObject & e )\n {\n std::cerr << \"Exception caught during reference file reading \" << std::endl;\n std::cerr << e << std::endl;\n return -1;\n }\n try\n {\n tarfilter->Update();\n }\n catch( itk::ExceptionObject & e )\n {\n std::cerr << \"Exception caught during target file reading \" << std::endl;\n std::cerr << e << std::endl;\n return -1;\n }\n \n \/\/ Rescale the image intensities so that they fall between 0 and 255\n typedef itk::RescaleIntensityImageFilter<fileImageType,ImageType> FilterType;\n FilterType::Pointer refrescalefilter = FilterType::New();\n FilterType::Pointer tarrescalefilter = FilterType::New();\n\n refrescalefilter->SetInput(reffilter->GetOutput());\n tarrescalefilter->SetInput(tarfilter->GetOutput());\n\n const double desiredMinimum = 0.0;\n const double desiredMaximum = 255.0;\n\n refrescalefilter->SetOutputMinimum( desiredMinimum );\n refrescalefilter->SetOutputMaximum( desiredMaximum );\n refrescalefilter->UpdateLargestPossibleRegion();\n tarrescalefilter->SetOutputMinimum( desiredMinimum );\n tarrescalefilter->SetOutputMaximum( desiredMaximum );\n tarrescalefilter->UpdateLargestPossibleRegion();\n \n\n \/\/ Histogram match the images\n typedef itk::HistogramMatchingImageFilter<ImageType,ImageType> HEFilterType;\n HEFilterType::Pointer IntensityEqualizeFilter = HEFilterType::New();\n\n IntensityEqualizeFilter->SetReferenceImage( refrescalefilter->GetOutput() );\n IntensityEqualizeFilter->SetInput( tarrescalefilter->GetOutput() );\n IntensityEqualizeFilter->SetNumberOfHistogramLevels( 100);\n IntensityEqualizeFilter->SetNumberOfMatchPoints( 15);\n IntensityEqualizeFilter->ThresholdAtMeanIntensityOn();\n IntensityEqualizeFilter->Update();\n\n X->SetReferenceImage(refrescalefilter->GetOutput());\n X->SetTargetImage(IntensityEqualizeFilter->GetOutput());\n\n\n \n \/\/ Choose the material properties\n itk::fem::MaterialLinearElasticity::Pointer m;\n m = itk::fem::MaterialLinearElasticity::New();\n m->GN = 0; \/\/ Global number of the material \/\/\/\n m->E = X->GetElasticity(); \/\/ Young's modulus -- used in the membrane \/\/\/\n m->A = 1.0; \/\/ Cross-sectional area \/\/\/\n m->h = 1.0; \/\/ Thickness \/\/\/\n m->I = 1.0; \/\/ Moment of inertia \/\/\/\n m->nu = 0.; \/\/ Poisson's ratio -- DONT CHOOSE 1.0!!\/\/\/\n m->RhoC = 1.0; \/\/ Density\n \n \/\/ Create the element type \n ElementType::Pointer e1=ElementType::New();\n e1->m_mat=dynamic_cast<itk::fem::MaterialLinearElasticity*>( m );\n X->SetElement(e1);\n X->SetMaterial(m);\n\n \/\/ Register the images\n X->RunRegistration();\n\n \/\/ Output the image resulting from the registration \n X->WriteWarpedImage((X->GetResultsFileName()).c_str());\n\n \/\/ Output the displacement fields associated with the result\n if (X->GetWriteDisplacements()) {\n X->WriteDisplacementField(0);\n X->WriteDisplacementField(1);\n#ifdef THREE\n X->WriteDisplacementField(2);\n#endif\n }\n\n \/\/ Clean up and exit\n delete m;\n delete e1;\n delete X;\n\n return 0;\n}\n\n\n<commit_msg>DOC: Example Latex tags added.<commit_after>\/*=========================================================================\n\n Program: Insight Segmentation & Registration Toolkit\n Module: DeformableRegistration1.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\n#include \"itkImageFileReader.h\" \n#include \"itkImageFileWriter.h\" \n#include \"itkRawImageIO.h\"\n\n\/\/#include \"itkImageFileWriter.h\"\n\/\/#include \"itkRawImageWriter.h\"\n\n#include \"itkRescaleIntensityImageFilter.h\"\n#include \"itkHistogramMatchingImageFilter.h\"\n\n\n\n\/\/ Software Guide : BeginLatex\n\/\/\n\/\/ The first step in implementing a FEM-Based registration method is to include\n\/\/ the following header files. \n\/\/\n\/\/ Software Guide : EndLatex \n\n\/\/ Software Guide : BeginCodeSnippet\n#include \"itkFEM.h\"\n#include \"itkFEMRegistrationFilter.h\"\n\/\/ Software Guide : EndCodeSnippet\n\n\n\n\/\/ Software Guide : BeginLatex\n\/\/\n\/\/ Below, we have typedefs that instantiate all necessary classes.\n\/\/ Here, we instantiate the image type, load type and \n\/\/ explicitly template the load implementation type.\n\/\/\n\/\/ Software Guide : EndLatex \n\n#define TWOD\n\/\/#define THREED\n\n#ifdef TWOD\ntypedef itk::Image< unsigned char, 2 > fileImageType;\ntypedef itk::Image< float, 2 > ImageType;\n\n\/\/ We now declare an element type and load implementation pointer for the visitor class.\ntypedef itk::fem::Element2DC0LinearTriangularMembrane ElementType2;\ntypedef itk::fem::Element2DC0LinearQuadrilateralMembrane ElementType;\n#endif \n\n#ifdef THREED\ntypedef itk::Image< unsigned char, 3 > fileImageType;\ntypedef itk::Image< float, 3 > ImageType;\ntypedef itk::fem::Element3DC0LinearHexahedronMembrane ElementType;\ntypedef itk::fem::Element3DC0LinearTetrahedronMembrane ElementType2;\n#endif\n\ntypedef itk::fem::ImageMetricLoad<ImageType,ImageType> ImageLoadType;\ntemplate class itk::fem::ImageMetricLoadImplementation<ImageLoadType>;\ntypedef ElementType::LoadImplementationFunctionPointer LoadImpFP;\ntypedef ElementType::LoadType ElementLoadType;\ntypedef ElementType2::LoadImplementationFunctionPointer LoadImpFP2;\ntypedef ElementType2::LoadType ElementLoadType2;\ntypedef itk::fem::VisitorDispatcher<ElementType,ElementLoadType, LoadImpFP> \n DispatcherType;\ntypedef itk::fem::VisitorDispatcher<ElementType2,ElementLoadType2, LoadImpFP2> \n DispatcherType2;\n\ntypedef itk::fem::FEMRegistrationFilter<ImageType,ImageType> RegistrationType;\n\nint main(int argc, char *argv[])\n{\n char *paramname;\n if ( argc < 2 )\n {\n std::cout << \"Parameter file name missing\" << std::endl;\n std::cout << \"Usage: \" << argv[0] << \" param.file\" << std::endl;\n return -1;\n } \n else { paramname=argv[1]; }\n \n \/\/ Register the correct load implementation with the element typed visitor dispatcher. \n {\n ElementType::LoadImplementationFunctionPointer fp = \n &itk::fem::ImageMetricLoadImplementation<ImageLoadType>::ImplementImageMetricLoad;\n DispatcherType::RegisterVisitor((ImageLoadType*)0,fp);\n }\n {\n ElementType2::LoadImplementationFunctionPointer fp =\n &itk::fem::ImageMetricLoadImplementation<ImageLoadType>::ImplementImageMetricLoad;\n DispatcherType2::RegisterVisitor((ImageLoadType*)0,fp);\n }\n\n \/\/ Declare the FEM registration class\n RegistrationType::Pointer X= RegistrationType::New(); \n\n \/\/ Attempt to read the parameter file, and exit if an error occurs\n X->SetConfigFileName(paramname);\n if ( !X->ReadConfigFile( (X->GetConfigFileName()).c_str() ) ) { return -1; }\n \n \/\/ Read the image files\n typedef itk::ImageFileReader< fileImageType > FileSourceType;\n typedef fileImageType::PixelType PixType;\n const unsigned int ImageDimension=fileImageType::ImageDimension;\n typedef itk::RawImageIO< PixType,ImageDimension> RawReaderType;\n\n FileSourceType::Pointer reffilter = FileSourceType::New();\n reffilter->SetFileName( (X->GetReferenceFile()).c_str() );\n FileSourceType::Pointer tarfilter = FileSourceType::New();\n tarfilter->SetFileName( (X->GetTargetFile()).c_str() );\n\n RawReaderType::Pointer rawReader = RawReaderType::New();\n rawReader->SetFileDimensionality( ImageDimension );\n\n ImageType::SizeType ImageSize=X->GetImageSize();\n for (unsigned int ii=0; ii<ImageDimension; ii++) \n {\n unsigned int temp = (unsigned int) ImageSize[ii];\n rawReader->SetDimensions( ii, temp );\n }\n reffilter->SetImageIO( rawReader );\n tarfilter->SetImageIO( rawReader );\n\n try\n {\n reffilter->Update();\n }\n catch( itk::ExceptionObject & e )\n {\n std::cerr << \"Exception caught during reference file reading \" << std::endl;\n std::cerr << e << std::endl;\n return -1;\n }\n try\n {\n tarfilter->Update();\n }\n catch( itk::ExceptionObject & e )\n {\n std::cerr << \"Exception caught during target file reading \" << std::endl;\n std::cerr << e << std::endl;\n return -1;\n }\n \n \/\/ Rescale the image intensities so that they fall between 0 and 255\n typedef itk::RescaleIntensityImageFilter<fileImageType,ImageType> FilterType;\n FilterType::Pointer refrescalefilter = FilterType::New();\n FilterType::Pointer tarrescalefilter = FilterType::New();\n\n refrescalefilter->SetInput(reffilter->GetOutput());\n tarrescalefilter->SetInput(tarfilter->GetOutput());\n\n const double desiredMinimum = 0.0;\n const double desiredMaximum = 255.0;\n\n refrescalefilter->SetOutputMinimum( desiredMinimum );\n refrescalefilter->SetOutputMaximum( desiredMaximum );\n refrescalefilter->UpdateLargestPossibleRegion();\n tarrescalefilter->SetOutputMinimum( desiredMinimum );\n tarrescalefilter->SetOutputMaximum( desiredMaximum );\n tarrescalefilter->UpdateLargestPossibleRegion();\n \n\n \/\/ Histogram match the images\n typedef itk::HistogramMatchingImageFilter<ImageType,ImageType> HEFilterType;\n HEFilterType::Pointer IntensityEqualizeFilter = HEFilterType::New();\n\n IntensityEqualizeFilter->SetReferenceImage( refrescalefilter->GetOutput() );\n IntensityEqualizeFilter->SetInput( tarrescalefilter->GetOutput() );\n IntensityEqualizeFilter->SetNumberOfHistogramLevels( 100);\n IntensityEqualizeFilter->SetNumberOfMatchPoints( 15);\n IntensityEqualizeFilter->ThresholdAtMeanIntensityOn();\n IntensityEqualizeFilter->Update();\n\n X->SetReferenceImage(refrescalefilter->GetOutput());\n X->SetTargetImage(IntensityEqualizeFilter->GetOutput());\n\n\n \n \/\/ Choose the material properties\n itk::fem::MaterialLinearElasticity::Pointer m;\n m = itk::fem::MaterialLinearElasticity::New();\n m->GN = 0; \/\/ Global number of the material \/\/\/\n m->E = X->GetElasticity(); \/\/ Young's modulus -- used in the membrane \/\/\/\n m->A = 1.0; \/\/ Cross-sectional area \/\/\/\n m->h = 1.0; \/\/ Thickness \/\/\/\n m->I = 1.0; \/\/ Moment of inertia \/\/\/\n m->nu = 0.; \/\/ Poisson's ratio -- DONT CHOOSE 1.0!!\/\/\/\n m->RhoC = 1.0; \/\/ Density\n \n \/\/ Create the element type \n ElementType::Pointer e1=ElementType::New();\n e1->m_mat=dynamic_cast<itk::fem::MaterialLinearElasticity*>( m );\n X->SetElement(e1);\n X->SetMaterial(m);\n\n \/\/ Register the images\n X->RunRegistration();\n\n \/\/ Output the image resulting from the registration \n X->WriteWarpedImage((X->GetResultsFileName()).c_str());\n\n \/\/ Output the displacement fields associated with the result\n if (X->GetWriteDisplacements()) {\n X->WriteDisplacementField(0);\n X->WriteDisplacementField(1);\n#ifdef THREE\n X->WriteDisplacementField(2);\n#endif\n }\n\n \/\/ Clean up and exit\n delete m;\n delete e1;\n delete X;\n\n return 0;\n}\n\n\n<|endoftext|>"} {"text":"<commit_before>\/\/===--- DexIndex.cpp - Dex Symbol Index Implementation ---------*- C++ -*-===\/\/\n\/\/\n\/\/ The LLVM Compiler Infrastructure\n\/\/\n\/\/ This file is distributed under the University of Illinois Open Source\n\/\/ License. See LICENSE.TXT for details.\n\/\/\n\/\/===----------------------------------------------------------------------===\/\/\n\n#include \"DexIndex.h\"\n#include \"..\/..\/FuzzyMatch.h\"\n#include \"..\/..\/Logger.h\"\n#include <algorithm>\n#include <queue>\n\nnamespace clang {\nnamespace clangd {\nnamespace dex {\n\nnamespace {\n\n\/\/ Returns the tokens which are given symbol's characteristics. Currently, the\n\/\/ generated tokens only contain fuzzy matching trigrams and symbol's scope,\n\/\/ but in the future this will also return path proximity tokens and other\n\/\/ types of tokens such as symbol type (if applicable).\n\/\/ Returns the tokens which are given symbols's characteristics. For example,\n\/\/ trigrams and scopes.\n\/\/ FIXME(kbobyrev): Support more token types:\n\/\/ * Path proximity\n\/\/ * Types\nstd::vector<Token> generateSearchTokens(const Symbol &Sym) {\n std::vector<Token> Result = generateIdentifierTrigrams(Sym.Name);\n Result.push_back(Token(Token::Kind::Scope, Sym.Scope));\n return Result;\n}\n\n} \/\/ namespace\n\nvoid DexIndex::build(std::shared_ptr<std::vector<const Symbol *>> Syms) {\n llvm::DenseMap<SymbolID, const Symbol *> TempLookupTable;\n llvm::DenseMap<const Symbol *, float> TempSymbolQuality;\n for (const Symbol *Sym : *Syms) {\n TempLookupTable[Sym->ID] = Sym;\n TempSymbolQuality[Sym] = quality(*Sym);\n }\n\n \/\/ Symbols are sorted by symbol qualities so that items in the posting lists\n \/\/ are stored in the descending order of symbol quality.\n std::sort(begin(*Syms), end(*Syms),\n [&](const Symbol *LHS, const Symbol *RHS) {\n return TempSymbolQuality[LHS] > TempSymbolQuality[RHS];\n });\n llvm::DenseMap<Token, PostingList> TempInvertedIndex;\n \/\/ Populate TempInvertedIndex with posting lists for index symbols.\n for (DocID SymbolRank = 0; SymbolRank < Syms->size(); ++SymbolRank) {\n const auto *Sym = (*Syms)[SymbolRank];\n for (const auto &Token : generateSearchTokens(*Sym))\n TempInvertedIndex[Token].push_back(SymbolRank);\n }\n\n {\n std::lock_guard<std::mutex> Lock(Mutex);\n\n \/\/ Replace outdated index with the new one.\n LookupTable = std::move(TempLookupTable);\n Symbols = std::move(Syms);\n InvertedIndex = std::move(TempInvertedIndex);\n SymbolQuality = std::move(TempSymbolQuality);\n }\n}\n\nstd::unique_ptr<SymbolIndex> DexIndex::build(SymbolSlab Slab) {\n auto Idx = llvm::make_unique<MemIndex>();\n Idx->build(getSymbolsFromSlab(std::move(Slab)));\n return std::move(Idx);\n}\n\n\/\/\/ Constructs iterators over tokens extracted from the query and exhausts it\n\/\/\/ while applying Callback to each symbol in the order of decreasing quality\n\/\/\/ of the matched symbols.\nbool DexIndex::fuzzyFind(\n const FuzzyFindRequest &Req,\n llvm::function_ref<void(const Symbol &)> Callback) const {\n assert(!StringRef(Req.Query).contains(\"::\") &&\n \"There must be no :: in query.\");\n FuzzyMatcher Filter(Req.Query);\n bool More = false;\n\n std::vector<std::unique_ptr<Iterator>> TopLevelChildren;\n const auto TrigramTokens = generateIdentifierTrigrams(Req.Query);\n\n {\n std::lock_guard<std::mutex> Lock(Mutex);\n\n \/\/ Generate query trigrams and construct AND iterator over all query\n \/\/ trigrams.\n std::vector<std::unique_ptr<Iterator>> TrigramIterators;\n for (const auto &Trigram : TrigramTokens) {\n const auto It = InvertedIndex.find(Trigram);\n if (It != InvertedIndex.end())\n TrigramIterators.push_back(create(It->second));\n }\n if (!TrigramIterators.empty())\n TopLevelChildren.push_back(createAnd(move(TrigramIterators)));\n\n \/\/ Generate scope tokens for search query.\n std::vector<std::unique_ptr<Iterator>> ScopeIterators;\n for (const auto &Scope : Req.Scopes) {\n const auto It = InvertedIndex.find(Token(Token::Kind::Scope, Scope));\n if (It != InvertedIndex.end())\n ScopeIterators.push_back(create(It->second));\n }\n \/\/ Add OR iterator for scopes if there are any Scope Iterators.\n if (!ScopeIterators.empty())\n TopLevelChildren.push_back(createOr(move(ScopeIterators)));\n\n \/\/ Use TRUE iterator if both trigrams and scopes from the query are not\n \/\/ present in the symbol index.\n auto QueryIterator = TopLevelChildren.empty()\n ? createTrue(Symbols->size())\n : createAnd(move(TopLevelChildren));\n \/\/ Retrieve more items than it was requested: some of the items with high\n \/\/ final score might not be retrieved otherwise.\n \/\/ FIXME(kbobyrev): Pre-scoring retrieval threshold should be adjusted as\n \/\/ using 100x of the requested number might not be good in practice, e.g.\n \/\/ when the requested number of items is small.\n const unsigned ItemsToRetrieve = 100 * Req.MaxCandidateCount;\n std::vector<DocID> SymbolDocIDs = consume(*QueryIterator, ItemsToRetrieve);\n\n \/\/ Retrieve top Req.MaxCandidateCount items.\n std::priority_queue<std::pair<float, const Symbol *>> Top;\n for (const auto &SymbolDocID : SymbolDocIDs) {\n const auto *Sym = (*Symbols)[SymbolDocID];\n const llvm::Optional<float> Score = Filter.match(Sym->Name);\n if (!Score)\n continue;\n \/\/ Multiply score by a negative factor so that Top stores items with the\n \/\/ highest actual score.\n Top.emplace(-(*Score) * SymbolQuality.find(Sym)->second, Sym);\n if (Top.size() > Req.MaxCandidateCount) {\n More = true;\n Top.pop();\n }\n }\n\n \/\/ Apply callback to the top Req.MaxCandidateCount items.\n for (; !Top.empty(); Top.pop())\n Callback(*Top.top().second);\n }\n\n return More;\n}\n\nvoid DexIndex::lookup(const LookupRequest &Req,\n llvm::function_ref<void(const Symbol &)> Callback) const {\n std::lock_guard<std::mutex> Lock(Mutex);\n for (const auto &ID : Req.IDs) {\n auto I = LookupTable.find(ID);\n if (I != LookupTable.end())\n Callback(*I->second);\n }\n}\n\n\nvoid DexIndex::findOccurrences(\n const OccurrencesRequest &Req,\n llvm::function_ref<void(const SymbolOccurrence &)> Callback) const {\n log(\"findOccurrences is not implemented.\");\n}\n\n} \/\/ namespace dex\n} \/\/ namespace clangd\n} \/\/ namespace clang\n<commit_msg>[clangd] Cleanup after D50897<commit_after>\/\/===--- DexIndex.cpp - Dex Symbol Index Implementation ---------*- C++ -*-===\/\/\n\/\/\n\/\/ The LLVM Compiler Infrastructure\n\/\/\n\/\/ This file is distributed under the University of Illinois Open Source\n\/\/ License. See LICENSE.TXT for details.\n\/\/\n\/\/===----------------------------------------------------------------------===\/\/\n\n#include \"DexIndex.h\"\n#include \"..\/..\/FuzzyMatch.h\"\n#include \"..\/..\/Logger.h\"\n#include <algorithm>\n#include <queue>\n\nnamespace clang {\nnamespace clangd {\nnamespace dex {\n\nnamespace {\n\n\/\/ Returns the tokens which are given symbol's characteristics. Currently, the\n\/\/ generated tokens only contain fuzzy matching trigrams and symbol's scope,\n\/\/ but in the future this will also return path proximity tokens and other\n\/\/ types of tokens such as symbol type (if applicable).\n\/\/ Returns the tokens which are given symbols's characteristics. For example,\n\/\/ trigrams and scopes.\n\/\/ FIXME(kbobyrev): Support more token types:\n\/\/ * Path proximity\n\/\/ * Types\nstd::vector<Token> generateSearchTokens(const Symbol &Sym) {\n std::vector<Token> Result = generateIdentifierTrigrams(Sym.Name);\n Result.push_back(Token(Token::Kind::Scope, Sym.Scope));\n return Result;\n}\n\n} \/\/ namespace\n\nvoid DexIndex::build(std::shared_ptr<std::vector<const Symbol *>> Syms) {\n llvm::DenseMap<SymbolID, const Symbol *> TempLookupTable;\n llvm::DenseMap<const Symbol *, float> TempSymbolQuality;\n for (const Symbol *Sym : *Syms) {\n TempLookupTable[Sym->ID] = Sym;\n TempSymbolQuality[Sym] = quality(*Sym);\n }\n\n \/\/ Symbols are sorted by symbol qualities so that items in the posting lists\n \/\/ are stored in the descending order of symbol quality.\n std::sort(begin(*Syms), end(*Syms),\n [&](const Symbol *LHS, const Symbol *RHS) {\n return TempSymbolQuality[LHS] > TempSymbolQuality[RHS];\n });\n llvm::DenseMap<Token, PostingList> TempInvertedIndex;\n \/\/ Populate TempInvertedIndex with posting lists for index symbols.\n for (DocID SymbolRank = 0; SymbolRank < Syms->size(); ++SymbolRank) {\n const auto *Sym = (*Syms)[SymbolRank];\n for (const auto &Token : generateSearchTokens(*Sym))\n TempInvertedIndex[Token].push_back(SymbolRank);\n }\n\n {\n std::lock_guard<std::mutex> Lock(Mutex);\n\n \/\/ Replace outdated index with the new one.\n LookupTable = std::move(TempLookupTable);\n Symbols = std::move(Syms);\n InvertedIndex = std::move(TempInvertedIndex);\n SymbolQuality = std::move(TempSymbolQuality);\n }\n}\n\nstd::unique_ptr<SymbolIndex> DexIndex::build(SymbolSlab Slab) {\n auto Idx = llvm::make_unique<DexIndex>();\n Idx->build(getSymbolsFromSlab(std::move(Slab)));\n return std::move(Idx);\n}\n\n\/\/\/ Constructs iterators over tokens extracted from the query and exhausts it\n\/\/\/ while applying Callback to each symbol in the order of decreasing quality\n\/\/\/ of the matched symbols.\nbool DexIndex::fuzzyFind(\n const FuzzyFindRequest &Req,\n llvm::function_ref<void(const Symbol &)> Callback) const {\n assert(!StringRef(Req.Query).contains(\"::\") &&\n \"There must be no :: in query.\");\n FuzzyMatcher Filter(Req.Query);\n bool More = false;\n\n std::vector<std::unique_ptr<Iterator>> TopLevelChildren;\n const auto TrigramTokens = generateIdentifierTrigrams(Req.Query);\n\n {\n std::lock_guard<std::mutex> Lock(Mutex);\n\n \/\/ Generate query trigrams and construct AND iterator over all query\n \/\/ trigrams.\n std::vector<std::unique_ptr<Iterator>> TrigramIterators;\n for (const auto &Trigram : TrigramTokens) {\n const auto It = InvertedIndex.find(Trigram);\n if (It != InvertedIndex.end())\n TrigramIterators.push_back(create(It->second));\n }\n if (!TrigramIterators.empty())\n TopLevelChildren.push_back(createAnd(move(TrigramIterators)));\n\n \/\/ Generate scope tokens for search query.\n std::vector<std::unique_ptr<Iterator>> ScopeIterators;\n for (const auto &Scope : Req.Scopes) {\n const auto It = InvertedIndex.find(Token(Token::Kind::Scope, Scope));\n if (It != InvertedIndex.end())\n ScopeIterators.push_back(create(It->second));\n }\n \/\/ Add OR iterator for scopes if there are any Scope Iterators.\n if (!ScopeIterators.empty())\n TopLevelChildren.push_back(createOr(move(ScopeIterators)));\n\n \/\/ Use TRUE iterator if both trigrams and scopes from the query are not\n \/\/ present in the symbol index.\n auto QueryIterator = TopLevelChildren.empty()\n ? createTrue(Symbols->size())\n : createAnd(move(TopLevelChildren));\n \/\/ Retrieve more items than it was requested: some of the items with high\n \/\/ final score might not be retrieved otherwise.\n \/\/ FIXME(kbobyrev): Pre-scoring retrieval threshold should be adjusted as\n \/\/ using 100x of the requested number might not be good in practice, e.g.\n \/\/ when the requested number of items is small.\n const unsigned ItemsToRetrieve = 100 * Req.MaxCandidateCount;\n std::vector<DocID> SymbolDocIDs = consume(*QueryIterator, ItemsToRetrieve);\n\n \/\/ Retrieve top Req.MaxCandidateCount items.\n std::priority_queue<std::pair<float, const Symbol *>> Top;\n for (const auto &SymbolDocID : SymbolDocIDs) {\n const auto *Sym = (*Symbols)[SymbolDocID];\n const llvm::Optional<float> Score = Filter.match(Sym->Name);\n if (!Score)\n continue;\n \/\/ Multiply score by a negative factor so that Top stores items with the\n \/\/ highest actual score.\n Top.emplace(-(*Score) * SymbolQuality.find(Sym)->second, Sym);\n if (Top.size() > Req.MaxCandidateCount) {\n More = true;\n Top.pop();\n }\n }\n\n \/\/ Apply callback to the top Req.MaxCandidateCount items.\n for (; !Top.empty(); Top.pop())\n Callback(*Top.top().second);\n }\n\n return More;\n}\n\nvoid DexIndex::lookup(const LookupRequest &Req,\n llvm::function_ref<void(const Symbol &)> Callback) const {\n std::lock_guard<std::mutex> Lock(Mutex);\n for (const auto &ID : Req.IDs) {\n auto I = LookupTable.find(ID);\n if (I != LookupTable.end())\n Callback(*I->second);\n }\n}\n\n\nvoid DexIndex::findOccurrences(\n const OccurrencesRequest &Req,\n llvm::function_ref<void(const SymbolOccurrence &)> Callback) const {\n log(\"findOccurrences is not implemented.\");\n}\n\n} \/\/ namespace dex\n} \/\/ namespace clangd\n} \/\/ namespace clang\n<|endoftext|>"} {"text":"<commit_before>\/** @file\n *\n * @ingroup modularLibrary\n *\n * @brief A Scheduler interface\n *\n * @details\n *\n * @authors Théo de la Hogue\n *\n * @copyright © 2013, Théo de la Hogue @n\n * This code is licensed under the terms of the \"New BSD License\" @n\n * http:\/\/creativecommons.org\/licenses\/BSD\/\n *\/\n\n\n#include \"Scheduler.h\"\n\n#define thisTTClass\t\tScheduler\n\n\/****************************************************************************************************\/\n\nScheduler::Scheduler(TTValue& arguments) :\nTTObjectBase(arguments),\nmDuration(0.),\nmOffset(0.),\nmSpeed(1.),\nmRunning(NO),\nmPaused(NO),\nmProgression(0.),\nmRealTime(0.),\nmCallback(NULL),\nmBaton(NULL)\n{\n mCallback = SchedulerProgressionCallback((TTPtr)arguments[0]);\n mBaton = arguments[1];\n\t\n\taddAttribute(Name, kTypeSymbol);\n\taddAttributeProperty(Name, readOnly, YES);\n\n\taddAttribute(Version, kTypeSymbol);\n\taddAttributeProperty(Version, readOnly, YES);\n\n\taddAttribute(Author, kTypeSymbol);\n\taddAttributeProperty(Author, readOnly, YES);\n \n addAttributeWithSetter(Duration, kTypeFloat64);\n addAttributeWithSetter(Offset, kTypeFloat64);\n addAttributeWithSetter(Speed, kTypeFloat64);\n\n\taddAttribute(Stretchable, kTypeBoolean);\n\taddAttributeProperty(Stretchable, readOnly, YES);\n\t\n\taddAttribute(Running, kTypeBoolean);\n addAttributeProperty(Running, readOnly, YES);\n \n addAttribute(Paused, kTypeBoolean);\n addAttributeProperty(Paused, readOnly, YES);\n \n addAttribute(Progression, kTypeFloat64);\n addAttributeProperty(Progression, readOnly, YES);\n \n addAttribute(RealTime, kTypeFloat64);\n addAttributeProperty(RealTime, readOnly, YES);\n\n\taddMessage(Go);\n\taddMessage(Stop);\n addMessage(Pause);\n addMessage(Resume);\n\taddMessage(Tick);\n \n \/\/ Cache some attributes for high speed notification feedbacks\n this->findAttribute(TTSymbol(\"duration\"), &durationAttribute);\n this->findAttribute(TTSymbol(\"offset\"), &offsetAttribute);\n this->findAttribute(TTSymbol(\"speed\"), &speedAttribute);\n \n this->findAttribute(TTSymbol(\"running\"), &runningAttribute);\n this->findAttribute(TTSymbol(\"progression\"), &progressionAttribute);\n this->findAttribute(TTSymbol(\"realTime\"), &realTimeAttribute);\n}\n\nScheduler::~Scheduler()\n{\n ;\n}\n\nTTErr Scheduler::getParameterNames(TTValue& value)\n{\n\tTTValue\t\tattributeNames;\n\tTTSymbol\tattributeName;\n\t\n\t\/\/ filter all default attributes (Name, Version, Author, Stretchable, Running, ...)\n\tthis->getAttributeNames(attributeNames);\n\t\n\tvalue.clear();\n\tfor (TTUInt8 i = 0; i < attributeNames.size(); i++) {\n\t\tattributeName = attributeNames[0];\n\t\t\n\t\tif (attributeName == TTSymbol(\"name\") ||\n\t\t\tattributeName == TTSymbol(\"version\") ||\n\t\t\tattributeName == TTSymbol(\"author\") ||\n\t\t\tattributeName == TTSymbol(\"stretchable\") ||\n attributeName == TTSymbol(\"duration\") ||\n attributeName == TTSymbol(\"offset\") ||\n attributeName == TTSymbol(\"speed\") ||\n attributeName == TTSymbol(\"running\") ||\n attributeName == TTSymbol(\"progression\") ||\n attributeName == TTSymbol(\"realTime\"))\n\t\t\tcontinue;\n\t\t\n\t\tvalue.append(attributeName);\n\t}\n\t\n\treturn kTTErrNone;\n}\n\nTTErr Scheduler::setDuration(const TTValue& value)\n{\n if (value.size() == 1) {\n \n if (value[0].type() == kTypeFloat64) {\n \n Stop();\n \n mDuration = value[0];\n \n durationAttribute->sendNotification(kTTSym_notify, mDuration); \/\/ we use kTTSym_notify because we know that observers are TTCallback\n \n return kTTErrNone;\n }\n }\n \n return kTTErrGeneric;\n}\n\nTTErr Scheduler::setOffset(const TTValue& value)\n{\n if (value.size() == 1) {\n \n if (value[0].type() == kTypeFloat64) {\n \n mOffset = value[0];\n \n offsetAttribute->sendNotification(kTTSym_notify, mOffset); \/\/ we use kTTSym_notify because we know that observers are TTCallback\n \n return kTTErrNone;\n }\n }\n \n return kTTErrGeneric;\n}\n\nTTErr Scheduler::setSpeed(const TTValue& value)\n{\n if (value.size() == 1) {\n \n if (value[0].type() == kTypeFloat64) {\n \n mSpeed = value[0];\n \n speedAttribute->sendNotification(kTTSym_notify, mSpeed); \/\/ we use kTTSym_notify because we know that observers are TTCallback\n \n return kTTErrNone;\n }\n }\n \n return kTTErrGeneric;\n}\n\n\/***************************************************************************\n \n\tSchedulerLib\n \n ***************************************************************************\/\n\nTTErr SchedulerLib::createScheduler(const TTSymbol SchedulerName, SchedulerPtr *returnedScheduler, SchedulerProgressionCallback aCallback, TTPtr aBaton)\n{\n\tTTValue args;\n\t\n \/\/ prepare arguments\n\targs.append((TTPtr)aCallback);\n args.append(aBaton);\n\t\n\t\/\/ These should be alphabetized\n\tif (SchedulerName == TTSymbol(\"Max\"))\n\t\treturn TTObjectBaseInstantiate(TTSymbol(\"Max\"), (TTObjectBasePtr*)returnedScheduler, args);\n else if (SchedulerName == TTSymbol(\"System\"))\n\t\treturn TTObjectBaseInstantiate(TTSymbol(\"System\"), (TTObjectBasePtr*)returnedScheduler, args);\n \n\tTTLogError(\"Jamoma SchedulerLib : Invalid Scheduler ( %s ) specified\", SchedulerName.c_str());\n\treturn kTTErrValueNotFound;\n}\n\nvoid SchedulerLib::getSchedulerNames(TTValue& SchedulerNames)\n{\n\tSchedulerNames.clear();\n\tSchedulerNames.append(TTSymbol(\"Max\"));\n\tSchedulerNames.append(TTSymbol(\"System\"));\n}\n\n<commit_msg>Removing the Stop from the setDuration accessor<commit_after>\/** @file\n *\n * @ingroup modularLibrary\n *\n * @brief A Scheduler interface\n *\n * @details\n *\n * @authors Théo de la Hogue\n *\n * @copyright © 2013, Théo de la Hogue @n\n * This code is licensed under the terms of the \"New BSD License\" @n\n * http:\/\/creativecommons.org\/licenses\/BSD\/\n *\/\n\n\n#include \"Scheduler.h\"\n\n#define thisTTClass\t\tScheduler\n\n\/****************************************************************************************************\/\n\nScheduler::Scheduler(TTValue& arguments) :\nTTObjectBase(arguments),\nmDuration(0.),\nmOffset(0.),\nmSpeed(1.),\nmRunning(NO),\nmPaused(NO),\nmProgression(0.),\nmRealTime(0.),\nmCallback(NULL),\nmBaton(NULL)\n{\n mCallback = SchedulerProgressionCallback((TTPtr)arguments[0]);\n mBaton = arguments[1];\n\t\n\taddAttribute(Name, kTypeSymbol);\n\taddAttributeProperty(Name, readOnly, YES);\n\n\taddAttribute(Version, kTypeSymbol);\n\taddAttributeProperty(Version, readOnly, YES);\n\n\taddAttribute(Author, kTypeSymbol);\n\taddAttributeProperty(Author, readOnly, YES);\n \n addAttributeWithSetter(Duration, kTypeFloat64);\n addAttributeWithSetter(Offset, kTypeFloat64);\n addAttributeWithSetter(Speed, kTypeFloat64);\n\n\taddAttribute(Stretchable, kTypeBoolean);\n\taddAttributeProperty(Stretchable, readOnly, YES);\n\t\n\taddAttribute(Running, kTypeBoolean);\n addAttributeProperty(Running, readOnly, YES);\n \n addAttribute(Paused, kTypeBoolean);\n addAttributeProperty(Paused, readOnly, YES);\n \n addAttribute(Progression, kTypeFloat64);\n addAttributeProperty(Progression, readOnly, YES);\n \n addAttribute(RealTime, kTypeFloat64);\n addAttributeProperty(RealTime, readOnly, YES);\n\n\taddMessage(Go);\n\taddMessage(Stop);\n addMessage(Pause);\n addMessage(Resume);\n\taddMessage(Tick);\n \n \/\/ Cache some attributes for high speed notification feedbacks\n this->findAttribute(TTSymbol(\"duration\"), &durationAttribute);\n this->findAttribute(TTSymbol(\"offset\"), &offsetAttribute);\n this->findAttribute(TTSymbol(\"speed\"), &speedAttribute);\n \n this->findAttribute(TTSymbol(\"running\"), &runningAttribute);\n this->findAttribute(TTSymbol(\"progression\"), &progressionAttribute);\n this->findAttribute(TTSymbol(\"realTime\"), &realTimeAttribute);\n}\n\nScheduler::~Scheduler()\n{\n ;\n}\n\nTTErr Scheduler::getParameterNames(TTValue& value)\n{\n\tTTValue\t\tattributeNames;\n\tTTSymbol\tattributeName;\n\t\n\t\/\/ filter all default attributes (Name, Version, Author, Stretchable, Running, ...)\n\tthis->getAttributeNames(attributeNames);\n\t\n\tvalue.clear();\n\tfor (TTUInt8 i = 0; i < attributeNames.size(); i++) {\n\t\tattributeName = attributeNames[0];\n\t\t\n\t\tif (attributeName == TTSymbol(\"name\") ||\n\t\t\tattributeName == TTSymbol(\"version\") ||\n\t\t\tattributeName == TTSymbol(\"author\") ||\n\t\t\tattributeName == TTSymbol(\"stretchable\") ||\n attributeName == TTSymbol(\"duration\") ||\n attributeName == TTSymbol(\"offset\") ||\n attributeName == TTSymbol(\"speed\") ||\n attributeName == TTSymbol(\"running\") ||\n attributeName == TTSymbol(\"progression\") ||\n attributeName == TTSymbol(\"realTime\"))\n\t\t\tcontinue;\n\t\t\n\t\tvalue.append(attributeName);\n\t}\n\t\n\treturn kTTErrNone;\n}\n\nTTErr Scheduler::setDuration(const TTValue& value)\n{\n if (value.size() == 1) {\n \n if (value[0].type() == kTypeFloat64) {\n \n mDuration = value[0];\n \n durationAttribute->sendNotification(kTTSym_notify, mDuration); \/\/ we use kTTSym_notify because we know that observers are TTCallback\n \n return kTTErrNone;\n }\n }\n \n return kTTErrGeneric;\n}\n\nTTErr Scheduler::setOffset(const TTValue& value)\n{\n if (value.size() == 1) {\n \n if (value[0].type() == kTypeFloat64) {\n \n mOffset = value[0];\n \n offsetAttribute->sendNotification(kTTSym_notify, mOffset); \/\/ we use kTTSym_notify because we know that observers are TTCallback\n \n return kTTErrNone;\n }\n }\n \n return kTTErrGeneric;\n}\n\nTTErr Scheduler::setSpeed(const TTValue& value)\n{\n if (value.size() == 1) {\n \n if (value[0].type() == kTypeFloat64) {\n \n mSpeed = value[0];\n \n speedAttribute->sendNotification(kTTSym_notify, mSpeed); \/\/ we use kTTSym_notify because we know that observers are TTCallback\n \n return kTTErrNone;\n }\n }\n \n return kTTErrGeneric;\n}\n\n\/***************************************************************************\n \n\tSchedulerLib\n \n ***************************************************************************\/\n\nTTErr SchedulerLib::createScheduler(const TTSymbol SchedulerName, SchedulerPtr *returnedScheduler, SchedulerProgressionCallback aCallback, TTPtr aBaton)\n{\n\tTTValue args;\n\t\n \/\/ prepare arguments\n\targs.append((TTPtr)aCallback);\n args.append(aBaton);\n\t\n\t\/\/ These should be alphabetized\n\tif (SchedulerName == TTSymbol(\"Max\"))\n\t\treturn TTObjectBaseInstantiate(TTSymbol(\"Max\"), (TTObjectBasePtr*)returnedScheduler, args);\n else if (SchedulerName == TTSymbol(\"System\"))\n\t\treturn TTObjectBaseInstantiate(TTSymbol(\"System\"), (TTObjectBasePtr*)returnedScheduler, args);\n \n\tTTLogError(\"Jamoma SchedulerLib : Invalid Scheduler ( %s ) specified\", SchedulerName.c_str());\n\treturn kTTErrValueNotFound;\n}\n\nvoid SchedulerLib::getSchedulerNames(TTValue& SchedulerNames)\n{\n\tSchedulerNames.clear();\n\tSchedulerNames.append(TTSymbol(\"Max\"));\n\tSchedulerNames.append(TTSymbol(\"System\"));\n}\n\n<|endoftext|>"} {"text":"<commit_before><commit_msg>Fix Vulkan memory leak<commit_after><|endoftext|>"} {"text":"<commit_before><commit_msg>Require semicolons after declarations<commit_after><|endoftext|>"} {"text":"<commit_before>\/\/ rm -f galice.root ; aliroot -l -q -b $ALICE_SOURCE\/HLT\/global\/physics\/macros\/testConfigOnlineCalib.C $ALICE_ROOT\/HLT\/exa\/recraw-local.C'(\"raw.root\",\"local:\/\/\/opt\/HLT-DEV\/HCDB\", 23, 23, \"HLT\", \"chains=RootWriter ignore-hltout\")'\n\nvoid testConfigOnlineCalib()\n{\n\tAliHLTSystem* pHLT = AliHLTPluginBase::GetInstance();\n\n\tif (1)\n\t{\n\t\tAliHLTConfiguration calib1(\"myCalibration1\", \"HLTAnalysisManagerComponent\", \"GLOBAL-flat-esd-converter\", \"-fPushEventModulo=3 -MinTracks=5 -QueueDepth=0 AddTaskMacro=$ALICE_PHYSICS\/PWGPP\/CalibMacros\/CPass0\/AddTaskTPCCalib.C(\\\"TPCCalib:CalibTimeDrift\\\")\");\n\/\/\t\tAliHLTConfiguration calib2(\"myCalibration2\", \"TPCCalibManagerComponent\", \"GLOBAL-flat-esd-converter\", \"-fPushEventModulo=3\");\n\t\tAliHLTConfiguration calibmerge(\"myCalibrationMerger\" , \"RootObjectMerger\" , \"myCalibration1\" , \"-QueueDepth 0 -cumulative\");\n\t\tAliHLTConfiguration preproc(\"myTPCOfflinePreprocessor\" , \"TPCOfflinePreprocessorWrapper\" , \"myCalibrationMerger\" , \"-QueueDepth 0\");\n\n\t\tAliHLTConfiguration eventTrigger(\"myCustomTrigger\", \"Zero\", \"TPC-DP\", \"\");\n\n\t\tAliHLTConfiguration zmqsink(\"myZMQsink\", \"ZMQsink\", \"myTPCOfflinePreprocessor\", \"out=PUB@tcp:\/\/*:60203\");\n\t\tAliHLTConfiguration zmqsource(\"myZMQsource\", \"ZMQsource\", \"myCustomTrigger\", \"in=SUB+tcp:\/\/localhost:60203\");\n\n\t\tAliHLTConfiguration mapPrepare1(\"myMapPrepare1\", \"TPCClusterTransformationPrepare\", \"myZMQsource\", \"-QueueDepth 0 -MinSector 0 -MaxSector 35 -NoInitialObject\");\n\t\tAliHLTConfiguration mapPrepare2(\"myMapPrepare2\", \"TPCClusterTransformationPrepare\", \"myZMQsource\", \"-QueueDepth 0 -MinSector 36 -MaxSector 71 -NoInitialObject\");\n\t\tAliHLTConfiguration mapPreparemerge(\"myMapPrepare\", \"RootObjectMerger\", \"myMapPrepare1 myMapPrepare2\", \"-QueueDepth 0\");\n\n\t\tTString clusterTransformation = \"TPC-ClusterTransformation\";\n\t\tAliHLTConfiguration overrideClusterTransformation(clusterTransformation.Data(), \"TPCClusterTransformation\", \"TPC-HWCFDecoder myMapPrepare\", \"-update-object-on-the-fly -offline-mode\");\n\n\t\tAliHLTConfiguration rootWriter(\"RootWriter\", \"ROOTFileWriter\", \"myCalibrationMerger myTPCOfflinePreprocessor myZMQsink GLOBAL-esd-converter\", \"-directory testDir -datafile test.root\");\n\t}\n\telse if (0)\n\t{\n\t\tAliHLTConfiguration calib(\"myCalib\", \"TPCCalibManagerComponent\", \"GLOBAL-esd-converter\", \"\");\n\t\tAliHLTConfiguration rootWriter(\"RootWriter\", \"ROOTFileWriter\", \"myCalib\", \"-directory testDir -datafile test-calib.root\");\n\t}\n\telse\n\t{\n\t\tAliHLTConfiguration rootWriter(\"RootWriter\", \"ROOTFileWriter\", \"GLOBAL-esd-converter\", \"-directory testDir -datafile test-esdevent.root\");\n\t}\n}\n<commit_msg>Cleanup test online calib macro<commit_after>\/\/ rm -f galice.root ; aliroot -l -q -b $ALICE_SOURCE\/HLT\/global\/physics\/macros\/testConfigOnlineCalib.C $ALICE_ROOT\/HLT\/exa\/recraw-local.C'(\"raw.root\",\"local:\/\/\/opt\/HLT-DEV\/HCDB\", 23, 23, \"HLT\", \"chains=RootWriter ignore-hltout\")'\n\nvoid testConfigOnlineCalib()\n{\n\tAliHLTPluginBase::InitInstance();\n\n\tAliHLTConfiguration calib1(\"myCalibration\", \"HLTAnalysisManagerComponent\", \"GLOBAL-flat-esd-converter\", \"-fPushEventModulo=3 -MinTracks=5 -QueueDepth=0 AddTaskMacro=$ALICE_PHYSICS\/PWGPP\/CalibMacros\/CPass0\/AddTaskTPCCalib.C(\\\"TPCCalib:CalibTimeDrift\\\")\");\n\/*\tAliHLTConfiguration calibmerge(\"myCalibrationMerger\" , \"RootObjectMerger\" , \"myCalibration\" , \"-QueueDepth 0 -cumulative\");\n\tAliHLTConfiguration preproc(\"myTPCOfflinePreprocessor\" , \"TPCOfflinePreprocessorWrapper\" , \"myCalibrationMerger\" , \"-QueueDepth 0\");\n\n\tAliHLTConfiguration eventTrigger(\"myCustomTrigger\", \"Zero\", \"TPC-DP\", \"\");\n\n\tAliHLTConfiguration zmqsink(\"myZMQsink\", \"ZMQsink\", \"myTPCOfflinePreprocessor\", \"out=PUB@tcp:\/\/*:60203\");\n\tAliHLTConfiguration zmqsource(\"myZMQsource\", \"ZMQsource\", \"myCustomTrigger\", \"in=SUB+tcp:\/\/localhost:60203\");\n\n\tAliHLTConfiguration mapPrepare1(\"myMapPrepare1\", \"TPCClusterTransformationPrepare\", \"myZMQsource\", \"-QueueDepth 0 -MinSector 0 -MaxSector 35 -NoInitialObject\");\n\tAliHLTConfiguration mapPrepare2(\"myMapPrepare2\", \"TPCClusterTransformationPrepare\", \"myZMQsource\", \"-QueueDepth 0 -MinSector 36 -MaxSector 71 -NoInitialObject\");\n\tAliHLTConfiguration mapPreparemerge(\"myMapPrepare\", \"RootObjectMerger\", \"myMapPrepare1 myMapPrepare2\", \"-QueueDepth 0\");*\/\n\t\n\tTString clusterTransformation = \"TPC-ClusterTransformation\";\n\tAliHLTConfiguration overrideClusterTransformation(clusterTransformation.Data(), \"TPCClusterTransformation\", \"TPC-HWCFDecoder\", \"-update-object-on-the-fly\");\n\t\/*AliHLTConfiguration overrideClusterTransformation(clusterTransformation.Data(), \"TPCClusterTransformation\", \"TPC-HWCFDecoder myMapPrepare\", \"-update-object-on-the-fly\");*\/\n\n\tAliHLTConfiguration rootWriter(\"RootWriter\", \"ROOTFileWriter\", \"myCalibration GLOBAL-esd-converter\", \"-directory testDir -datafile test.root\");\n\t\/*AliHLTConfiguration rootWriter(\"RootWriter\", \"ROOTFileWriter\", \"myCalibrationMerger myTPCOfflinePreprocessor myZMQsink GLOBAL-esd-converter\", \"-directory testDir -datafile test.root\");*\/\n}\n<|endoftext|>"} {"text":"<commit_before>#include <cstdint>\n#include <iostream>\n#include <string>\n#include <vector>\n#include <memory>\n#include <functional>\n\n#include \"board\/full_board.h\"\n#include \"game\/game_info.h\"\n#include \"game\/sgf_game.h\"\n#include \"def.h\"\n#include \"util\/cxxopts.hpp\"\n#include \"util\/SGFParser.h\"\n#include \"deep_learning\/sample.h\"\n#include \"deep_learning\/engine.h\"\n#include \"deep_learning\/cnn\/graph_builder.h\"\n#include \"N3LDG.h\"\n\nusing namespace foolgo;\nusing namespace std;\nusing namespace cxxopts;\n\nint main(int argc, char *argv[]) {\n uint32_t seed = GetTimeSeed();\n cout << \"seed:\" << seed << endl;\n ZobHasher<19>::Init(seed);\n Options options(\"FoolGo\", \"A montecarlo Go A.I.\");\n options.add_options()\n (\"s,sgf\", \"sgf file name\", cxxopts::value<string>());\n auto args = options.parse(argc, argv);\n string sgf_file_name = args[\"sgf\"].as<string>();\n\n SGFParser parser;\n vector<string> strs = parser.chop_all(sgf_file_name);\n cout << strs.size() << endl;\n vector<GameInfo> game_infos = parser.get_game_infos(sgf_file_name);\n vector<Sample<19>> samples;\n\n int iter = 0;\n for (const GameInfo &game_info : game_infos) {\n auto sgf_game = SgfGame<19>::BuildSgfGame(game_info, &samples);\n sgf_game->Run();\n if (++iter % 100 == 0) {\n cout << \"iter:\" << iter << \"sample count:\" << samples.size() << endl;\n break;\n }\n }\n\n return 0;\n}\n<commit_msg>some change<commit_after>#include <cstdint>\n#include <iostream>\n#include <string>\n#include <vector>\n#include <memory>\n#include <functional>\n\n#include \"board\/full_board.h\"\n#include \"game\/game_info.h\"\n#include \"game\/sgf_game.h\"\n#include \"def.h\"\n#include \"util\/cxxopts.hpp\"\n#include \"util\/SGFParser.h\"\n#include \"util\/rand.h\"\n#include \"deep_learning\/sample.h\"\n#include \"deep_learning\/engine.h\"\n#include \"deep_learning\/cnn\/graph_builder.h\"\n#include \"N3LDG.h\"\n\nusing namespace foolgo;\nusing namespace std;\nusing namespace cxxopts;\n\nint main(int argc, char *argv[]) {\n uint32_t seed = GetTimeSeed();\n cout << \"seed:\" << seed << endl;\n ZobHasher<19>::Init(seed);\n Options options(\"FoolGo\", \"A montecarlo Go A.I.\");\n options.add_options()\n (\"s,sgf\", \"sgf file name\", cxxopts::value<string>());\n auto args = options.parse(argc, argv);\n string sgf_file_name = args[\"sgf\"].as<string>();\n\n SGFParser parser;\n vector<string> strs = parser.chop_all(sgf_file_name);\n cout << strs.size() << endl;\n vector<GameInfo> game_infos = parser.get_game_infos(sgf_file_name);\n\n int iter = 0;\n cout << \"game count:\" << game_infos.size() << endl;\n vector<Sample<19>> samples;\n\n for (int i=0; i < 1000; ++i) {\n int rand_game_i = Rand(game_infos.size() - 1, seed);\n const GameInfo &game_info = game_infos.at(rand_game_i);\n vector<Sample<19>> single_game_samples;\n auto game = SgfGame<19>::BuildSgfGame(game_info, &single_game_samples);\n game->Run();\n int rand_sample_i = Rand(game_info.moves.size() - 1, seed);\n samples.push_back(single_game_samples.at(rand_sample_i));\n }\n\n cout << \"samples count:\" << samples.size() << endl;\n\n Engine engine;\n\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-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 \"OgrePredefinedControllers.h\"\n\n#include \"OgreRoot.h\"\n#include \"OgreMath.h\"\n#include \"OgreLogManager.h\"\n#include \"OgreTextureUnitState.h\"\n\nnamespace Ogre\n{\n \/\/-----------------------------------------------------------------------\n \/\/ FrameTimeControllerValue\n \/\/-----------------------------------------------------------------------\n FrameTimeControllerValue::FrameTimeControllerValue()\n {\n \/\/ Register self\n Root::getSingleton().addFrameListener(this);\n mFrameTime = 0;\n\t\tmTimeFactor = 1;\n\t\tmFrameDelay = 0;\n mElapsedTime = 0;\n\n }\n \/\/-----------------------------------------------------------------------\n bool FrameTimeControllerValue::frameStarted(const FrameEvent &evt)\n {\n\t\tif(mFrameDelay) \n\t\t{\n\t\t\t\/\/ Fixed frame time\n\t\t\tmFrameTime = mFrameDelay;\n\t\t\tmTimeFactor = mFrameDelay \/ evt.timeSinceLastFrame;\n\t\t}\n\t\telse \n\t\t{\n\t\t\t\/\/ Save the time value after applying time factor\n\t\t\tmFrameTime = mTimeFactor * evt.timeSinceLastFrame;\n\t\t}\n \/\/ Accumulate the elapsed time\n mElapsedTime += mFrameTime;\n return true;\n }\n \/\/-----------------------------------------------------------------------\n bool FrameTimeControllerValue::frameEnded(const FrameEvent &evt)\n {\n return true;\n }\n \/\/-----------------------------------------------------------------------\n Real FrameTimeControllerValue::getValue() const\n {\n return mFrameTime;\n }\n \/\/-----------------------------------------------------------------------\n void FrameTimeControllerValue::setValue(Real value)\n {\n \/\/ Do nothing - value is set from frame listener\n }\n\t\/\/-----------------------------------------------------------------------\n\tReal FrameTimeControllerValue::getTimeFactor(void) const {\n\t\treturn mTimeFactor;\n\t}\n\t\/\/-----------------------------------------------------------------------\n\tvoid FrameTimeControllerValue::setTimeFactor(Real tf) {\n\t\tif(tf >= 0) \n\t\t{\n\t\t\tmTimeFactor = tf;\n\t\t\tmFrameDelay = 0;\n\t\t}\n\t}\n\t\/\/-----------------------------------------------------------------------\n\tReal FrameTimeControllerValue::getFrameDelay(void) const {\n\t\treturn mFrameDelay;\n\t}\n\t\/\/-----------------------------------------------------------------------\n\tvoid FrameTimeControllerValue::setFrameDelay(Real fd) {\n\t\tmTimeFactor = 0;\n\t\tmFrameDelay = fd;\n\t}\n \/\/-----------------------------------------------------------------------\n Real FrameTimeControllerValue::getElapsedTime(void) const\n {\n return mElapsedTime;\n }\n \/\/-----------------------------------------------------------------------\n void FrameTimeControllerValue::setElapsedTime(Real elapsedTime)\n {\n mElapsedTime = elapsedTime;\n }\n \/\/-----------------------------------------------------------------------\n \/\/ TextureFrameControllerValue\n \/\/-----------------------------------------------------------------------\n TextureFrameControllerValue::TextureFrameControllerValue(TextureUnitState* t)\n {\n mTextureLayer = t;\n }\n \/\/-----------------------------------------------------------------------\n Real TextureFrameControllerValue::getValue(void) const\n {\n int numFrames = mTextureLayer->getNumFrames();\n return (mTextureLayer->getCurrentFrame() \/ numFrames);\n }\n \/\/-----------------------------------------------------------------------\n void TextureFrameControllerValue::setValue(Real value)\n {\n int numFrames = mTextureLayer->getNumFrames();\n mTextureLayer->setCurrentFrame((int)(value * numFrames) % numFrames);\n }\n \/\/-----------------------------------------------------------------------\n \/\/ TexCoordModifierControllerValue\n \/\/-----------------------------------------------------------------------\n TexCoordModifierControllerValue::TexCoordModifierControllerValue(TextureUnitState* t,\n bool translateU, bool translateV, bool scaleU, bool scaleV, bool rotate )\n {\n mTextureLayer = t;\n mTransU = translateU;\n mTransV = translateV;\n mScaleU = scaleU;\n mScaleV = scaleV;\n mRotate = rotate;\n }\n \/\/-----------------------------------------------------------------------\n Real TexCoordModifierControllerValue::getValue() const\n {\n const Matrix4& pMat = mTextureLayer->getTextureTransform();\n if (mTransU)\n {\n return pMat[0][3];\n }\n else if (mTransV)\n {\n return pMat[1][3];\n }\n else if (mScaleU)\n {\n return pMat[0][0];\n }\n else if (mScaleV)\n {\n return pMat[1][1];\n }\n \/\/ Shouldn't get here\n return 0;\n }\n \/\/-----------------------------------------------------------------------\n void TexCoordModifierControllerValue::setValue(Real value)\n {\n if (mTransU)\n {\n mTextureLayer->setTextureUScroll(value);\n }\n if (mTransV)\n {\n mTextureLayer->setTextureVScroll(value);\n }\n if (mScaleU)\n {\n if (value >= 0)\n {\n \/\/ Add 1 to scale (+ve scales up)\n mTextureLayer->setTextureUScale(1 + value);\n }\n else\n {\n \/\/ (-ve scales down)\n mTextureLayer->setTextureUScale(1 \/ -value);\n }\n }\n if (mScaleV)\n {\n if (value >= 0)\n {\n \/\/ Add 1 to scale (+ve scales up)\n mTextureLayer->setTextureVScale(1 + value);\n }\n else\n {\n \/\/ (-ve scales down)\n mTextureLayer->setTextureVScale(1 \/ -value);\n }\n }\n if (mRotate)\n {\n mTextureLayer->setTextureRotate(Radian(value * Math::TWO_PI));\n }\n }\n \/\/-----------------------------------------------------------------------\n \/\/-----------------------------------------------------------------------\n\tFloatGpuParameterControllerValue::FloatGpuParameterControllerValue(\n\t\t\tGpuProgramParameters* params, size_t index) :\n\t\tmParams(params), mParamIndex(index)\n\t{\n\t}\n \/\/-----------------------------------------------------------------------\n\tReal FloatGpuParameterControllerValue::getValue(void) const\n\t{\n\t\t\/\/ do nothing, reading from a set of params not supported\n\t\treturn 0.0f;\n\t}\n \/\/-----------------------------------------------------------------------\n\tvoid FloatGpuParameterControllerValue::setValue(Real val)\n\t{\n\t\tstatic Vector4 v4 = Vector4(0,0,0,0);\n\t\tv4.x = val;\n\t\tmParams->setConstant(mParamIndex, v4);\n\t}\n\t\/\/-----------------------------------------------------------------------\n\t\/\/ PassthroughControllerFunction\n\t\/\/-----------------------------------------------------------------------\n\tPassthroughControllerFunction::PassthroughControllerFunction(bool delta) \n\t\t: ControllerFunction<Real>(delta)\n\t{\n\t}\n\t\/\/-----------------------------------------------------------------------\n\tReal PassthroughControllerFunction::calculate(Real source)\n\t{\n\t\treturn getAdjustedInput(source);\n\n\t}\n \/\/-----------------------------------------------------------------------\n \/\/ AnimationControllerFunction\n \/\/-----------------------------------------------------------------------\n AnimationControllerFunction::AnimationControllerFunction(Real sequenceTime, Real timeOffset) \n\t\t: ControllerFunction<Real>(false)\n {\n mSeqTime = sequenceTime;\n mTime = timeOffset;\n }\n \/\/-----------------------------------------------------------------------\n Real AnimationControllerFunction::calculate(Real source)\n {\n \/\/ Assume source is time since last update\n mTime += source;\n \/\/ Wrap\n while (mTime >= mSeqTime) mTime -= mSeqTime;\n while (mTime < 0) mTime += mSeqTime;\n\n \/\/ Return parametric\n return mTime \/ mSeqTime;\n }\n\t\/\/-----------------------------------------------------------------------\n\tvoid AnimationControllerFunction::setTime(Real timeVal)\n\t{\n\t\tmTime = timeVal;\n\t}\n\t\/\/-----------------------------------------------------------------------\n\tvoid AnimationControllerFunction::setSequenceTime(Real seqVal)\n\t{\n\t\tmSeqTime = seqVal;\n\t}\n \/\/-----------------------------------------------------------------------\n \/\/ ScaleControllerFunction\n \/\/-----------------------------------------------------------------------\n ScaleControllerFunction::ScaleControllerFunction(Real factor, bool delta) : ControllerFunction<Real>(delta)\n {\n mScale = factor;\n }\n \/\/-----------------------------------------------------------------------\n Real ScaleControllerFunction::calculate(Real source)\n {\n return getAdjustedInput(source * mScale);\n\n }\n \/\/-----------------------------------------------------------------------\n \/\/ WaveformControllerFunction\n \/\/-----------------------------------------------------------------------\n WaveformControllerFunction::WaveformControllerFunction(WaveformType wType, Real base, Real frequency, Real phase, Real amplitude, bool delta, Real dutyCycle)\n :ControllerFunction<Real>(delta)\n {\n mWaveType = wType;\n mBase = base;\n mFrequency = frequency;\n mPhase = phase;\n mAmplitude = amplitude;\n mDeltaCount = phase;\n\t\tmDutyCycle = dutyCycle;\n }\n \/\/-----------------------------------------------------------------------\n Real WaveformControllerFunction::getAdjustedInput(Real input)\n {\n Real adjusted = ControllerFunction<Real>::getAdjustedInput(input);\n\n \/\/ If not delta, adjust by phase here\n \/\/ (delta inputs have it adjusted at initialisation)\n if (!mDeltaInput)\n {\n adjusted += mPhase;\n }\n\n return adjusted;\n }\n \/\/-----------------------------------------------------------------------\n Real WaveformControllerFunction::calculate(Real source)\n {\n Real input = getAdjustedInput(source * mFrequency);\n Real output;\n \/\/ For simplicity, factor input down to {0,1)\n \/\/ Use looped subtract rather than divide \/ round\n while (input >= 1.0)\n input -= 1.0;\n while (input < 0.0)\n input += 1.0;\n\n \/\/ Calculate output in -1..1 range\n switch (mWaveType)\n {\n case WFT_SINE:\n output = Math::Sin(Radian(input * Math::TWO_PI));\n break;\n case WFT_TRIANGLE:\n if (input < 0.25)\n output = input * 4;\n else if (input >= 0.25 && input < 0.75)\n output = 1.0 - ((input - 0.25) * 4);\n else\n output = ((input - 0.75) * 4) - 1.0;\n\n break;\n case WFT_SQUARE:\n if (input <= 0.5)\n output = 1.0;\n else\n output = -1.0;\n break;\n case WFT_SAWTOOTH:\n output = (input * 2) - 1;\n break;\n case WFT_INVERSE_SAWTOOTH:\n output = -((input * 2) - 1);\n break;\n\t\tcase WFT_PWM:\n\t\t\tif( input <= mDutyCycle )\n\t\t\t\toutput = 1.0;\n\t\t\telse\n\t\t\t\toutput = -1.0;\n\t\t\tbreak;\n }\n\n \/\/ Scale output into 0..1 range and then by base + amplitude\n return mBase + ((output + 1.0) * 0.5 * mAmplitude);\n\n\n }\n}\n\n<commit_msg>Fix wave_xform and scaling factors. 1.0 should be the base otherwise it's very unintuitive to try to figure out the correct parameters. Also all previous demos assumed that basis.<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 \"OgrePredefinedControllers.h\"\n\n#include \"OgreRoot.h\"\n#include \"OgreMath.h\"\n#include \"OgreLogManager.h\"\n#include \"OgreTextureUnitState.h\"\n\nnamespace Ogre\n{\n \/\/-----------------------------------------------------------------------\n \/\/ FrameTimeControllerValue\n \/\/-----------------------------------------------------------------------\n FrameTimeControllerValue::FrameTimeControllerValue()\n {\n \/\/ Register self\n Root::getSingleton().addFrameListener(this);\n mFrameTime = 0;\n\t\tmTimeFactor = 1;\n\t\tmFrameDelay = 0;\n mElapsedTime = 0;\n\n }\n \/\/-----------------------------------------------------------------------\n bool FrameTimeControllerValue::frameStarted(const FrameEvent &evt)\n {\n\t\tif(mFrameDelay) \n\t\t{\n\t\t\t\/\/ Fixed frame time\n\t\t\tmFrameTime = mFrameDelay;\n\t\t\tmTimeFactor = mFrameDelay \/ evt.timeSinceLastFrame;\n\t\t}\n\t\telse \n\t\t{\n\t\t\t\/\/ Save the time value after applying time factor\n\t\t\tmFrameTime = mTimeFactor * evt.timeSinceLastFrame;\n\t\t}\n \/\/ Accumulate the elapsed time\n mElapsedTime += mFrameTime;\n return true;\n }\n \/\/-----------------------------------------------------------------------\n bool FrameTimeControllerValue::frameEnded(const FrameEvent &evt)\n {\n return true;\n }\n \/\/-----------------------------------------------------------------------\n Real FrameTimeControllerValue::getValue() const\n {\n return mFrameTime;\n }\n \/\/-----------------------------------------------------------------------\n void FrameTimeControllerValue::setValue(Real value)\n {\n \/\/ Do nothing - value is set from frame listener\n }\n\t\/\/-----------------------------------------------------------------------\n\tReal FrameTimeControllerValue::getTimeFactor(void) const {\n\t\treturn mTimeFactor;\n\t}\n\t\/\/-----------------------------------------------------------------------\n\tvoid FrameTimeControllerValue::setTimeFactor(Real tf) {\n\t\tif(tf >= 0) \n\t\t{\n\t\t\tmTimeFactor = tf;\n\t\t\tmFrameDelay = 0;\n\t\t}\n\t}\n\t\/\/-----------------------------------------------------------------------\n\tReal FrameTimeControllerValue::getFrameDelay(void) const {\n\t\treturn mFrameDelay;\n\t}\n\t\/\/-----------------------------------------------------------------------\n\tvoid FrameTimeControllerValue::setFrameDelay(Real fd) {\n\t\tmTimeFactor = 0;\n\t\tmFrameDelay = fd;\n\t}\n \/\/-----------------------------------------------------------------------\n Real FrameTimeControllerValue::getElapsedTime(void) const\n {\n return mElapsedTime;\n }\n \/\/-----------------------------------------------------------------------\n void FrameTimeControllerValue::setElapsedTime(Real elapsedTime)\n {\n mElapsedTime = elapsedTime;\n }\n \/\/-----------------------------------------------------------------------\n \/\/ TextureFrameControllerValue\n \/\/-----------------------------------------------------------------------\n TextureFrameControllerValue::TextureFrameControllerValue(TextureUnitState* t)\n {\n mTextureLayer = t;\n }\n \/\/-----------------------------------------------------------------------\n Real TextureFrameControllerValue::getValue(void) const\n {\n int numFrames = mTextureLayer->getNumFrames();\n return (mTextureLayer->getCurrentFrame() \/ numFrames);\n }\n \/\/-----------------------------------------------------------------------\n void TextureFrameControllerValue::setValue(Real value)\n {\n int numFrames = mTextureLayer->getNumFrames();\n mTextureLayer->setCurrentFrame((int)(value * numFrames) % numFrames);\n }\n \/\/-----------------------------------------------------------------------\n \/\/ TexCoordModifierControllerValue\n \/\/-----------------------------------------------------------------------\n TexCoordModifierControllerValue::TexCoordModifierControllerValue(TextureUnitState* t,\n bool translateU, bool translateV, bool scaleU, bool scaleV, bool rotate )\n {\n mTextureLayer = t;\n mTransU = translateU;\n mTransV = translateV;\n mScaleU = scaleU;\n mScaleV = scaleV;\n mRotate = rotate;\n }\n \/\/-----------------------------------------------------------------------\n Real TexCoordModifierControllerValue::getValue() const\n {\n const Matrix4& pMat = mTextureLayer->getTextureTransform();\n if (mTransU)\n {\n return pMat[0][3];\n }\n else if (mTransV)\n {\n return pMat[1][3];\n }\n else if (mScaleU)\n {\n return pMat[0][0];\n }\n else if (mScaleV)\n {\n return pMat[1][1];\n }\n \/\/ Shouldn't get here\n return 0;\n }\n \/\/-----------------------------------------------------------------------\n void TexCoordModifierControllerValue::setValue(Real value)\n {\n if (mTransU)\n {\n mTextureLayer->setTextureUScroll(value);\n }\n if (mTransV)\n {\n mTextureLayer->setTextureVScroll(value);\n }\n if (mScaleU)\n {\n mTextureLayer->setTextureUScale(value);\n }\n if (mScaleV)\n {\n mTextureLayer->setTextureVScale(value);\n }\n if (mRotate)\n {\n mTextureLayer->setTextureRotate(Radian(value * Math::TWO_PI));\n }\n }\n \/\/-----------------------------------------------------------------------\n \/\/-----------------------------------------------------------------------\n\tFloatGpuParameterControllerValue::FloatGpuParameterControllerValue(\n\t\t\tGpuProgramParameters* params, size_t index) :\n\t\tmParams(params), mParamIndex(index)\n\t{\n\t}\n \/\/-----------------------------------------------------------------------\n\tReal FloatGpuParameterControllerValue::getValue(void) const\n\t{\n\t\t\/\/ do nothing, reading from a set of params not supported\n\t\treturn 0.0f;\n\t}\n \/\/-----------------------------------------------------------------------\n\tvoid FloatGpuParameterControllerValue::setValue(Real val)\n\t{\n\t\tstatic Vector4 v4 = Vector4(0,0,0,0);\n\t\tv4.x = val;\n\t\tmParams->setConstant(mParamIndex, v4);\n\t}\n\t\/\/-----------------------------------------------------------------------\n\t\/\/ PassthroughControllerFunction\n\t\/\/-----------------------------------------------------------------------\n\tPassthroughControllerFunction::PassthroughControllerFunction(bool delta) \n\t\t: ControllerFunction<Real>(delta)\n\t{\n\t}\n\t\/\/-----------------------------------------------------------------------\n\tReal PassthroughControllerFunction::calculate(Real source)\n\t{\n\t\treturn getAdjustedInput(source);\n\n\t}\n \/\/-----------------------------------------------------------------------\n \/\/ AnimationControllerFunction\n \/\/-----------------------------------------------------------------------\n AnimationControllerFunction::AnimationControllerFunction(Real sequenceTime, Real timeOffset) \n\t\t: ControllerFunction<Real>(false)\n {\n mSeqTime = sequenceTime;\n mTime = timeOffset;\n }\n \/\/-----------------------------------------------------------------------\n Real AnimationControllerFunction::calculate(Real source)\n {\n \/\/ Assume source is time since last update\n mTime += source;\n \/\/ Wrap\n while (mTime >= mSeqTime) mTime -= mSeqTime;\n while (mTime < 0) mTime += mSeqTime;\n\n \/\/ Return parametric\n return mTime \/ mSeqTime;\n }\n\t\/\/-----------------------------------------------------------------------\n\tvoid AnimationControllerFunction::setTime(Real timeVal)\n\t{\n\t\tmTime = timeVal;\n\t}\n\t\/\/-----------------------------------------------------------------------\n\tvoid AnimationControllerFunction::setSequenceTime(Real seqVal)\n\t{\n\t\tmSeqTime = seqVal;\n\t}\n \/\/-----------------------------------------------------------------------\n \/\/ ScaleControllerFunction\n \/\/-----------------------------------------------------------------------\n ScaleControllerFunction::ScaleControllerFunction(Real factor, bool delta) : ControllerFunction<Real>(delta)\n {\n mScale = factor;\n }\n \/\/-----------------------------------------------------------------------\n Real ScaleControllerFunction::calculate(Real source)\n {\n return getAdjustedInput(source * mScale);\n\n }\n \/\/-----------------------------------------------------------------------\n \/\/ WaveformControllerFunction\n \/\/-----------------------------------------------------------------------\n WaveformControllerFunction::WaveformControllerFunction(WaveformType wType, Real base, Real frequency, Real phase, Real amplitude, bool delta, Real dutyCycle)\n :ControllerFunction<Real>(delta)\n {\n mWaveType = wType;\n mBase = base;\n mFrequency = frequency;\n mPhase = phase;\n mAmplitude = amplitude;\n mDeltaCount = phase;\n\t\tmDutyCycle = dutyCycle;\n }\n \/\/-----------------------------------------------------------------------\n Real WaveformControllerFunction::getAdjustedInput(Real input)\n {\n Real adjusted = ControllerFunction<Real>::getAdjustedInput(input);\n\n \/\/ If not delta, adjust by phase here\n \/\/ (delta inputs have it adjusted at initialisation)\n if (!mDeltaInput)\n {\n adjusted += mPhase;\n }\n\n return adjusted;\n }\n \/\/-----------------------------------------------------------------------\n Real WaveformControllerFunction::calculate(Real source)\n {\n Real input = getAdjustedInput(source * mFrequency);\n Real output;\n \/\/ For simplicity, factor input down to {0,1)\n \/\/ Use looped subtract rather than divide \/ round\n while (input >= 1.0)\n input -= 1.0;\n while (input < 0.0)\n input += 1.0;\n\n \/\/ Calculate output in -1..1 range\n switch (mWaveType)\n {\n case WFT_SINE:\n output = Math::Sin(Radian(input * Math::TWO_PI));\n break;\n case WFT_TRIANGLE:\n if (input < 0.25)\n output = input * 4;\n else if (input >= 0.25 && input < 0.75)\n output = 1.0 - ((input - 0.25) * 4);\n else\n output = ((input - 0.75) * 4) - 1.0;\n\n break;\n case WFT_SQUARE:\n if (input <= 0.5)\n output = 1.0;\n else\n output = -1.0;\n break;\n case WFT_SAWTOOTH:\n output = (input * 2) - 1;\n break;\n case WFT_INVERSE_SAWTOOTH:\n output = -((input * 2) - 1);\n break;\n\t\tcase WFT_PWM:\n\t\t\tif( input <= mDutyCycle )\n\t\t\t\toutput = 1.0;\n\t\t\telse\n\t\t\t\toutput = -1.0;\n\t\t\tbreak;\n }\n\n \/\/ Scale output into 0..1 range and then by base + amplitude\n return mBase + ((output + 1.0) * 0.5 * mAmplitude);\n\n\n }\n}\n\n<|endoftext|>"} {"text":"<commit_before>\/*****************************************************************************\n *\n * GARGOYLE_PSCAND: Gargoyle Port Scan Detector\n * \n * main cleanup daemon\n *\n * Copyright (c) 2017, Bayshore Networks, Inc.\n * All rights reserved.\n * \n * Redistribution and use in source and binary forms, with or without modification, are permitted provided that\n * the following conditions are met:\n * \n * 1. Redistributions of source code must retain the above copyright notice, this list of conditions and the\n * following disclaimer.\n * \n * 2. 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 * 3. Neither the name of the copyright holder nor the names of its contributors may be used to endorse or promote\n * products derived from this software without specific prior written permission.\n * \n * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS \"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 SERVICES;\n * LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN\n * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE,\n * EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.\n *****************************************************************************\/\n#include <stdexcept>\n#include <iostream>\n#include <vector>\n#include <string>\n#include <sstream>\n\n#include <errno.h>\n#include <ctype.h>\n#include <signal.h>\n#include <string.h>\n#include <stdlib.h>\n#include <syslog.h>\n#include <unistd.h>\n#include <netinet\/in.h>\n#include <arpa\/inet.h>\n\n#include \"sqlite_wrapper_api.h\"\n#include \"iptables_wrapper_api.h\"\n#include \"singleton.h\"\n#include \"gargoyle_config_vals.h\"\n#include \"config_variables.h\"\n\nbool DEBUG = false;\n\n\nbool validate_ip_addr(std::string ip_addr)\n{\n struct sockaddr_in sa;\n int result = inet_pton(AF_INET, ip_addr.c_str(), &(sa.sin_addr));\n return result != 0;\n}\n\n\nint main(int argc, char *argv[])\n{\n\t\n if (geteuid() != 0) {\n \tstd::cerr << std::endl << \"Root privileges are necessary for this to run ...\" << std::endl << std::endl;\n \treturn 1;\n }\n \n char ip[16];\n \n if (DEBUG)\n \tstd::cout << \"ARGC \" << argc << std::endl;\n \n if (argc == 2) {\n \t\n\t\tif (validate_ip_addr(argv[1])) {\n\t\t\t\n\t\t\tstrncpy(ip, argv[1], 15);\n\t\t\tip[strlen(ip)] = '\\0';\n\t\t\t\n\t\t if (DEBUG)\n\t\t \tstd::cout << \"IP addr: \" << ip << std::endl;\n\t\t\t\n\t\t\tsize_t rule_ix = iptables_find_rule_in_chain(GARGOYLE_CHAIN_NAME, ip);\n\t\t\t\n\t\t if (DEBUG)\n\t\t \tstd::cout << \"RuleIX: \" << rule_ix << std::endl;\n\t\t\t\n\t\t\tif (rule_ix > 0 && ip) {\n\t\t\t\t\n\t\t\t\t\/\/ find the host ix for the ip\n\t\t\t\tint host_ix = get_host_ix(ip);\n\t\t\t\tif (host_ix > 0) {\n\n\t\t\t\t\t\/\/ find the row ix for this host (in detected_hosts table)\n\t\t\t\t\tsize_t row_ix = get_detected_hosts_row_ix_by_host_ix(host_ix);\n\t\t\t\t\tif (row_ix > 0) {\n\t\t\t\t\t\t\n\t\t\t\t\t if (DEBUG)\n\t\t\t\t\t \tstd::cout << \"Host ix: \" << host_ix << std::endl;\n\t\t\t\t\t\t\/\/ delete all records for this host_ix from hosts_ports_hits table\n\t\t\t\t\t\tremove_host_ports_all(host_ix);\n\t\t\t\t\t\t\n\t\t\t\t\t if (DEBUG)\n\t\t\t\t\t \tstd::cout << \"Row ix: \" << row_ix << std::endl;\n\t\t\t\t\t\t\/\/ delete row from detected_hosts\n\t\t\t\t\t\tremove_detected_host(row_ix);\n\t\t\t\t\t\t\n\t\t\t\t\t\tint tstamp = (int) time(NULL);\n\t\t\t\t\t\t\n\t\t\t\t\t\t\/\/ add to ignore ip table\n\t\t\t\t\t\tadd_host_to_ignore(host_ix, tstamp);\n\t\t\t\t\t\t\n\t\t\t\t\t\tiptables_delete_rule_from_chain(GARGOYLE_CHAIN_NAME, rule_ix);\n\n\t\t\t\t\t\tsyslog(LOG_INFO | LOG_LOCAL6, \"%s-%s=\\\"%s\\\" %s=\\\"%d\\\"\", \"manually unblocked\", VIOLATOR_SYSLOG, ip, TIMESTAMP_SYSLOG, tstamp);\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n }\n\treturn 0;\n}\n<commit_msg>added a simple usage statement to the unblock prog<commit_after>\/*****************************************************************************\n *\n * GARGOYLE_PSCAND: Gargoyle Port Scan Detector\n * \n * main cleanup daemon\n *\n * Copyright (c) 2017, Bayshore Networks, Inc.\n * All rights reserved.\n * \n * Redistribution and use in source and binary forms, with or without modification, are permitted provided that\n * the following conditions are met:\n * \n * 1. Redistributions of source code must retain the above copyright notice, this list of conditions and the\n * following disclaimer.\n * \n * 2. 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 * 3. Neither the name of the copyright holder nor the names of its contributors may be used to endorse or promote\n * products derived from this software without specific prior written permission.\n * \n * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS \"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 SERVICES;\n * LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN\n * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE,\n * EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.\n *****************************************************************************\/\n#include <stdexcept>\n#include <iostream>\n#include <vector>\n#include <string>\n#include <sstream>\n\n#include <errno.h>\n#include <ctype.h>\n#include <signal.h>\n#include <string.h>\n#include <stdlib.h>\n#include <syslog.h>\n#include <unistd.h>\n#include <netinet\/in.h>\n#include <arpa\/inet.h>\n\n#include \"sqlite_wrapper_api.h\"\n#include \"iptables_wrapper_api.h\"\n#include \"singleton.h\"\n#include \"gargoyle_config_vals.h\"\n#include \"config_variables.h\"\n\nbool DEBUG = false;\n\n\nbool validate_ip_addr(std::string ip_addr)\n{\n struct sockaddr_in sa;\n int result = inet_pton(AF_INET, ip_addr.c_str(), &(sa.sin_addr));\n return result != 0;\n}\n\n\nint main(int argc, char *argv[])\n{\n\t\n if (geteuid() != 0) {\n \tstd::cerr << std::endl << \"Root privileges are necessary for this to run ...\" << std::endl << std::endl;\n \treturn 1;\n }\n \n char ip[16];\n \n if (DEBUG)\n \tstd::cout << \"ARGC \" << argc << std::endl;\n \n if (argc == 2) {\n \t\n\t\tif (validate_ip_addr(argv[1])) {\n\t\t\t\n\t\t\tstrncpy(ip, argv[1], 15);\n\t\t\tip[strlen(ip)] = '\\0';\n\t\t\t\n\t\t if (DEBUG)\n\t\t \tstd::cout << \"IP addr: \" << ip << std::endl;\n\t\t\t\n\t\t\tsize_t rule_ix = iptables_find_rule_in_chain(GARGOYLE_CHAIN_NAME, ip);\n\t\t\t\n\t\t if (DEBUG)\n\t\t \tstd::cout << \"RuleIX: \" << rule_ix << std::endl;\n\t\t\t\n\t\t\tif (rule_ix > 0 && ip) {\n\t\t\t\t\n\t\t\t\t\/\/ find the host ix for the ip\n\t\t\t\tint host_ix = get_host_ix(ip);\n\t\t\t\tif (host_ix > 0) {\n\n\t\t\t\t\t\/\/ find the row ix for this host (in detected_hosts table)\n\t\t\t\t\tsize_t row_ix = get_detected_hosts_row_ix_by_host_ix(host_ix);\n\t\t\t\t\tif (row_ix > 0) {\n\t\t\t\t\t\t\n\t\t\t\t\t if (DEBUG)\n\t\t\t\t\t \tstd::cout << \"Host ix: \" << host_ix << std::endl;\n\t\t\t\t\t\t\/\/ delete all records for this host_ix from hosts_ports_hits table\n\t\t\t\t\t\tremove_host_ports_all(host_ix);\n\t\t\t\t\t\t\n\t\t\t\t\t if (DEBUG)\n\t\t\t\t\t \tstd::cout << \"Row ix: \" << row_ix << std::endl;\n\t\t\t\t\t\t\/\/ delete row from detected_hosts\n\t\t\t\t\t\tremove_detected_host(row_ix);\n\t\t\t\t\t\t\n\t\t\t\t\t\tint tstamp = (int) time(NULL);\n\t\t\t\t\t\t\n\t\t\t\t\t\t\/\/ add to ignore ip table\n\t\t\t\t\t\tadd_host_to_ignore(host_ix, tstamp);\n\t\t\t\t\t\t\n\t\t\t\t\t\tiptables_delete_rule_from_chain(GARGOYLE_CHAIN_NAME, rule_ix);\n\n\t\t\t\t\t\tsyslog(LOG_INFO | LOG_LOCAL6, \"%s-%s=\\\"%s\\\" %s=\\\"%d\\\"\", \"manually unblocked\", VIOLATOR_SYSLOG, ip, TIMESTAMP_SYSLOG, tstamp);\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n } else {\n \tstd::cout << std::endl << \"Usage: .\/gargoyle_pscand_unblockip ip_addr\" << std::endl << std::endl;\n }\n\treturn 0;\n}\n<|endoftext|>"} {"text":"<commit_before>\/* Blink Example\n\n This example code is in the Public Domain (or CC0 licensed, at your option.)\n\n Unless required by applicable law or agreed to in writing, this\n software is distributed on an \"AS IS\" BASIS, WITHOUT WARRANTIES OR\n CONDITIONS OF ANY KIND, either express or implied.\n*\/\n#include <stdio.h>\n#include \"freertos\/FreeRTOS.h\"\n#include \"freertos\/task.h\"\n#include \"freertos\/queue.h\"\n#include \"esp_system.h\"\n#include \"sdkconfig.h\"\n#include <cmath>\n\n#define ms(x) (x\/portTICK_PERIOD_MS)\n\n#define DUMP_VAR_d(x) \\\n printf(\"%s:%d:%s=<%d>\\n\",__FILE__,__LINE__,#x,x)\n\n#define DUMP_VAR_f(x) \\\n printf(\"%s:%d:%s=<%f>\\n\",__FILE__,__LINE__,#x,x)\n\n\n\nstatic const int iConstSampleRate = 100;\nstatic const int iConstSampleDelay = 1000\/iConstSampleRate;\nstatic const double pi = std::acos(-1);\n\nstatic char signal(int counter)\n{\n double x = 2 * pi * (double)counter\/(double)iConstSampleRate;\n double y = sin(x);\n DUMP_VAR_d(counter);\n DUMP_VAR_f(x);\n DUMP_VAR_f(y);\n return y *126;\n}\n\nstatic int gSamplerCounter = 0;\n\nvoid signal_generator_task(void *pvParameter)\n{\n while(true) {\n auto sign = signal(gSamplerCounter++%iConstSampleRate);\n vTaskDelay(ms(iConstSampleDelay));\n }\n}\n\nextern \"C\" void signal_generator_app_main()\n{\n xTaskCreate(&signal_generator_task, \"signal_generator_task\", 2048, NULL, 5, NULL);\n}\n<commit_msg>Update signal.generator.cpp<commit_after>\/* Blink Example\n\n This example code is in the Public Domain (or CC0 licensed, at your option.)\n\n Unless required by applicable law or agreed to in writing, this\n software is distributed on an \"AS IS\" BASIS, WITHOUT WARRANTIES OR\n CONDITIONS OF ANY KIND, either express or implied.\n*\/\n#include <stdio.h>\n#include \"freertos\/FreeRTOS.h\"\n#include \"freertos\/task.h\"\n#include \"freertos\/queue.h\"\n#include \"esp_system.h\"\n#include \"sdkconfig.h\"\n#include <cmath>\n\n#define ms(x) (x\/portTICK_PERIOD_MS)\n\n#define DUMP_VAR_d(x) \\\n printf(\"%s:%d:%s=<%d>\\n\",__FILE__,__LINE__,#x,x)\n\n#define DUMP_VAR_f(x) \\\n printf(\"%s:%d:%s=<%f>\\n\",__FILE__,__LINE__,#x,x)\n\nextern \"C\" ble_server_notify(char);\n\nstatic const int iConstSampleRate = 100;\nstatic const int iConstSampleDelay = 1000\/iConstSampleRate;\nstatic const double pi = std::acos(-1);\n\nstatic char signal(int counter)\n{\n double x = 2 * pi * (double)counter\/(double)iConstSampleRate;\n double y = sin(x);\n DUMP_VAR_d(counter);\n DUMP_VAR_f(x);\n DUMP_VAR_f(y);\n return y *126;\n}\n\nstatic int gSamplerCounter = 0;\n\nvoid signal_generator_task(void *pvParameter)\n{\n while(true) {\n auto sign = signal(gSamplerCounter++%iConstSampleRate);\n ble_server_notify(sign);\n vTaskDelay(ms(iConstSampleDelay));\n }\n}\n\nextern \"C\" void signal_generator_app_main()\n{\n xTaskCreate(&signal_generator_task, \"signal_generator_task\", 2048, NULL, 5, NULL);\n}\n<|endoftext|>"} {"text":"<commit_before>#ifndef CLUSTERING_SUGGESTER_SUGGESTER_TCC_\n#define CLUSTERING_SUGGESTER_SUGGESTER_TCC_\n\n#include \"stl_utils.hpp\"\n#include \"containers\/priority_queue.hpp\"\n\nnamespace {\n\nstruct priority_t {\n machine_id_t machine_id;\n\n bool pinned;\n int redundancy_cost;\n float backfill_cost;\n\n priority_t() { }\n\n priority_t(machine_id_t _machine_id, bool _pinned, \n int _redundancy_cost, float _backfill_cost)\n : machine_id(_machine_id), pinned(_pinned), \n redundancy_cost(_redundancy_cost), backfill_cost(_backfill_cost)\n { }\n};\n\nbool operator<(const priority_t &x, const priority_t &y) {\n\/\/CONTINUE:\n \/\/Round 1: Pinnings.\n \/\/F I G H T\n if (x.pinned && !y.pinned) {\n return false;\n } else if (y.pinned && !x.pinned) {\n return true;\n }\n\n \/\/Round 2: Redundancy.\n \/\/F I G H T\n if (x.redundancy_cost < y.redundancy_cost) {\n return false;\n } else if (y.redundancy_cost < x.redundancy_cost) {\n return true;\n }\n\n \/\/Round 3: Backfill cost.\n \/\/F I G H T\n if (x.backfill_cost < y.backfill_cost) {\n return false;\n } else if (y.backfill_cost < x.backfill_cost) {\n return true;\n }\n\n \/\/You Lose!!\n \/\/Continue? \n \/\/(uncomment the below line to continue)\n \/\/goto CONTINUE;\n \/\/5\n \/\/4\n \/\/3\n \/\/2\n \/\/1\n \/\/Last chance:\n \/\/goto CONTINUE;\n \/\/Didn't continue: Game Over\n return false; \/\/They're equal\n}\n\n\n} \/\/anonymous namespace\n\n\/* Returns a \"score\" indicating how expensive it would be to turn the machine\nwith the given business card into a primary or secondary for the given shard. *\/\n\ntemplate<class protocol_t>\nfloat estimate_cost_to_get_up_to_date(\n const reactor_business_card_t<protocol_t> &business_card,\n const typename protocol_t::region_t &shard) {\n typedef reactor_business_card_t<protocol_t> rb_t;\n region_map_t<protocol_t, float> costs(shard, 3);\n for (typename rb_t::activity_map_t::const_iterator it = business_card.activities.begin();\n it != business_card.activities.end(); it++) {\n typename protocol_t::region_t intersection = region_intersection(it->second.first, shard);\n if (!region_is_empty(intersection)) {\n int cost;\n if (boost::get<typename rb_t::primary_when_safe_t>(&it->second.second)) {\n cost = 0;\n } else if (boost::get<typename rb_t::primary_t>(&it->second.second)) {\n cost = 0;\n } else if (boost::get<typename rb_t::secondary_up_to_date_t>(&it->second.second)) {\n cost = 1;\n } else if (boost::get<typename rb_t::secondary_without_primary_t>(&it->second.second)) {\n cost = 2;\n } else if (boost::get<typename rb_t::secondary_backfilling_t>(&it->second.second)) {\n cost = 2;\n } else if (boost::get<typename rb_t::nothing_when_safe_t>(&it->second.second)) {\n cost = 3;\n } else if (boost::get<typename rb_t::nothing_when_done_erasing_t>(&it->second.second)) {\n cost = 3;\n } else if (boost::get<typename rb_t::nothing_t>(&it->second.second)) {\n cost = 3;\n } else {\n \/\/ I don't know if this is unreachable, but cost would be uninitialized otherwise - Sam\n \/\/ TODO: Is this really unreachable?\n unreachable();\n }\n \/* It's ok to just call `set()` instead of trying to find the minimum\n because activities should never overlap. *\/\n costs.set(intersection, cost);\n }\n }\n float sum = 0;\n int count = 0;\n for (typename region_map_t<protocol_t, float>::iterator it = costs.begin(); it != costs.end(); it++) {\n \/* TODO: Scale by how much data is in `it->first` *\/\n sum += it->second;\n count++;\n }\n return sum \/ count;\n}\n\ninline std::vector<machine_id_t> pick_n_best(priority_queue_t<priority_t> *candidates, int n, const datacenter_id_t &datacenter) {\n std::vector<machine_id_t> result;\n while ((int)result.size() < n) {\n if (candidates->empty()) {\n throw cannot_satisfy_goals_exc_t(strprintf(\"Didn't have enough unused machines in datacenter %s, we needed %d\\n\", uuid_to_str(datacenter).c_str(), n));\n } else {\n result.push_back(candidates->pop().machine_id);\n }\n }\n return result;\n}\n\ntemplate<class protocol_t>\nstd::map<machine_id_t, typename blueprint_details::role_t> suggest_blueprint_for_shard(\n const std::map<machine_id_t, reactor_business_card_t<protocol_t> > &directory,\n const datacenter_id_t &primary_datacenter,\n const std::map<datacenter_id_t, int> &datacenter_affinities,\n const typename protocol_t::region_t &shard,\n const std::map<machine_id_t, datacenter_id_t> &machine_data_centers,\n const std::set<machine_id_t> &primary_pinnings,\n const std::set<machine_id_t> &secondary_pinnings,\n std::map<machine_id_t, int> *primary_usage,\n std::map<machine_id_t, int> *secondary_usage) {\n debugf(\"Suggest blueprint for shards\\n\");\n\n std::map<machine_id_t, typename blueprint_details::role_t> sub_blueprint;\n\n priority_queue_t<priority_t> primary_candidates;\n for (std::map<machine_id_t, datacenter_id_t>::const_iterator it = machine_data_centers.begin();\n it != machine_data_centers.end(); it++) {\n if (it->second == primary_datacenter) {\n bool pinned = !std_contains(primary_pinnings, it->first);\n\n int redundancy_cost = get_with_default(*primary_usage, it->first, 0);\n debugf(\"Redundancy cost: %d\\n\", redundancy_cost);\n\n float backfill_cost;\n if (std_contains(directory, it->first)) {\n backfill_cost = estimate_cost_to_get_up_to_date(directory.find(it->first)->second, shard);\n } else {\n backfill_cost = 3.0;\n }\n\n primary_candidates.push(priority_t(it->first, pinned, redundancy_cost, backfill_cost));\n }\n }\n machine_id_t primary = pick_n_best(&primary_candidates, 1, primary_datacenter).front();\n sub_blueprint[primary] = blueprint_details::role_primary;\n \n \/\/Update primary_usage\n get_with_default(*primary_usage, primary, 0)++;\n\n for (std::map<datacenter_id_t, int>::const_iterator it = datacenter_affinities.begin(); it != datacenter_affinities.end(); it++) {\n priority_queue_t<priority_t> secondary_candidates;\n for (std::map<machine_id_t, datacenter_id_t>::const_iterator jt = machine_data_centers.begin();\n jt != machine_data_centers.end(); jt++) {\n if (jt->second == it->first && jt->first != primary) {\n bool pinned = std_contains(secondary_pinnings, jt->first);\n\n int redundancy_cost = get_with_default(*secondary_usage, jt->first, 0);\n\n float backfill_cost;\n if (std_contains(directory, jt->first)) {\n backfill_cost = estimate_cost_to_get_up_to_date(directory.find(jt->first)->second, shard);\n } else {\n backfill_cost = 3.0;\n }\n\n secondary_candidates.push(priority_t(jt->first, pinned, redundancy_cost, backfill_cost));\n }\n }\n std::vector<machine_id_t> secondaries = pick_n_best(&secondary_candidates, it->second, it->first);\n for (std::vector<machine_id_t>::iterator jt = secondaries.begin(); jt != secondaries.end(); jt++) {\n \/\/Update secondary usage\n get_with_default(*secondary_usage, *jt, 0)++;\n sub_blueprint[*jt] = blueprint_details::role_secondary;\n }\n }\n\n for (std::map<machine_id_t, datacenter_id_t>::const_iterator it = machine_data_centers.begin();\n it != machine_data_centers.end(); it++) {\n \/* This will set the value to `role_nothing` iff the peer is not already\n in the blueprint. *\/\n sub_blueprint.insert(std::make_pair(it->first, blueprint_details::role_nothing));\n }\n\n return sub_blueprint;\n}\n\ntemplate<class protocol_t>\npersistable_blueprint_t<protocol_t> suggest_blueprint(\n const std::map<machine_id_t, reactor_business_card_t<protocol_t> > &directory,\n const datacenter_id_t &primary_datacenter,\n const std::map<datacenter_id_t, int> &datacenter_affinities,\n const std::set<typename protocol_t::region_t> &shards,\n const std::map<machine_id_t, datacenter_id_t> &machine_data_centers,\n const region_map_t<protocol_t, machine_id_t> &primary_pinnings,\n const region_map_t<protocol_t, std::set<machine_id_t> > &secondary_pinnings) {\n\n typedef region_map_t<protocol_t, machine_id_t> primary_pinnings_map_t;\n typedef region_map_t<protocol_t, std::set<machine_id_t> > secondary_pinnings_map_t;\n\n persistable_blueprint_t<protocol_t> blueprint;\n\n \/\/Maps to keep track of how much we're using each machine\n std::map<machine_id_t, int> primary_usage, secondary_usage;\n for (typename std::set<typename protocol_t::region_t>::const_iterator it = shards.begin();\n it != shards.end(); it++) {\n std::set<machine_id_t> machines_shard_primary_is_pinned_to;\n primary_pinnings_map_t primary_masked_map = primary_pinnings.mask(*it);\n\n for (typename primary_pinnings_map_t::iterator pit = primary_masked_map.begin();\n pit != primary_masked_map.end();\n ++pit) {\n machines_shard_primary_is_pinned_to.insert(pit->second);\n }\n\n std::set<machine_id_t> machines_shard_secondary_is_pinned_to;\n secondary_pinnings_map_t secondary_masked_map = secondary_pinnings.mask(*it);\n\n for (typename secondary_pinnings_map_t::iterator pit = secondary_masked_map.begin();\n pit != secondary_masked_map.end();\n ++pit) {\n machines_shard_secondary_is_pinned_to.insert(pit->second.begin(), pit->second.end());\n }\n\n std::map<machine_id_t, typename blueprint_details::role_t> shard_blueprint =\n suggest_blueprint_for_shard(directory, primary_datacenter, datacenter_affinities, *it, \n machine_data_centers, machines_shard_primary_is_pinned_to, \n machines_shard_secondary_is_pinned_to, &primary_usage,\n &secondary_usage);\n for (typename std::map<machine_id_t, typename blueprint_details::role_t>::iterator jt = shard_blueprint.begin();\n jt != shard_blueprint.end(); jt++) {\n blueprint.machines_roles[jt->first][*it] = jt->second;\n }\n }\n return blueprint;\n}\n\n#endif \/* CLUSTERING_SUGGESTER_SUGGESTER_TCC_ *\/\n<commit_msg>Fixes bugs with suggester not respecting pinnings.<commit_after>#ifndef CLUSTERING_SUGGESTER_SUGGESTER_TCC_\n#define CLUSTERING_SUGGESTER_SUGGESTER_TCC_\n\n#include \"stl_utils.hpp\"\n#include \"containers\/priority_queue.hpp\"\n\nnamespace {\n\nstruct priority_t {\n machine_id_t machine_id;\n\n bool pinned;\n bool would_rob_secondary;\n int redundancy_cost;\n float backfill_cost;\n\n priority_t() { }\n\n priority_t(machine_id_t _machine_id, bool _pinned, bool _would_rob_secondary,\n int _redundancy_cost, float _backfill_cost)\n : machine_id(_machine_id), pinned(_pinned), would_rob_secondary(_would_rob_secondary),\n redundancy_cost(_redundancy_cost), backfill_cost(_backfill_cost)\n { }\n};\n\n\/\/It's easier to think about this function if you imagine it as the answer to:\n\/\/is y of higher priority than x\n\nbool operator<(const priority_t &x, const priority_t &y) {\n\/\/CONTINUE:\n \/\/Round 1: Pinnings.\n \/\/F I G H T\n if (x.pinned && !y.pinned) {\n return false;\n } else if (y.pinned && !x.pinned) {\n return true;\n }\n\n \/\/Round 2: Would Rob Secondary.\n \/\/F I G H T\n if (x.would_rob_secondary && !y.would_rob_secondary) {\n return true;\n } else if (y.would_rob_secondary && !x.would_rob_secondary) {\n return false;\n }\n\n \/\/Round 3: Redundancy.\n \/\/F I G H T\n if (x.redundancy_cost < y.redundancy_cost) {\n return false;\n } else if (y.redundancy_cost < x.redundancy_cost) {\n return true;\n }\n\n \/\/Round 4: Backfill cost.\n \/\/F I G H T\n if (x.backfill_cost < y.backfill_cost) {\n return false;\n } else if (y.backfill_cost < x.backfill_cost) {\n return true;\n }\n\n \/\/You Lose!!\n \/\/Continue? \n \/\/(uncomment the below line to continue)\n \/\/goto CONTINUE;\n \/\/5\n \/\/4\n \/\/3\n \/\/2\n \/\/1\n \/\/Last chance:\n \/\/goto CONTINUE;\n \/\/Didn't continue: Game Over\n return false; \/\/They're equal\n}\n\n\n} \/\/anonymous namespace\n\n\/* Returns a \"score\" indicating how expensive it would be to turn the machine\nwith the given business card into a primary or secondary for the given shard. *\/\n\ntemplate<class protocol_t>\nfloat estimate_cost_to_get_up_to_date(\n const reactor_business_card_t<protocol_t> &business_card,\n const typename protocol_t::region_t &shard) {\n typedef reactor_business_card_t<protocol_t> rb_t;\n region_map_t<protocol_t, float> costs(shard, 3);\n for (typename rb_t::activity_map_t::const_iterator it = business_card.activities.begin();\n it != business_card.activities.end(); it++) {\n typename protocol_t::region_t intersection = region_intersection(it->second.first, shard);\n if (!region_is_empty(intersection)) {\n int cost;\n if (boost::get<typename rb_t::primary_when_safe_t>(&it->second.second)) {\n cost = 0;\n } else if (boost::get<typename rb_t::primary_t>(&it->second.second)) {\n cost = 0;\n } else if (boost::get<typename rb_t::secondary_up_to_date_t>(&it->second.second)) {\n cost = 1;\n } else if (boost::get<typename rb_t::secondary_without_primary_t>(&it->second.second)) {\n cost = 2;\n } else if (boost::get<typename rb_t::secondary_backfilling_t>(&it->second.second)) {\n cost = 2;\n } else if (boost::get<typename rb_t::nothing_when_safe_t>(&it->second.second)) {\n cost = 3;\n } else if (boost::get<typename rb_t::nothing_when_done_erasing_t>(&it->second.second)) {\n cost = 3;\n } else if (boost::get<typename rb_t::nothing_t>(&it->second.second)) {\n cost = 3;\n } else {\n \/\/ I don't know if this is unreachable, but cost would be uninitialized otherwise - Sam\n \/\/ TODO: Is this really unreachable?\n unreachable();\n }\n \/* It's ok to just call `set()` instead of trying to find the minimum\n because activities should never overlap. *\/\n costs.set(intersection, cost);\n }\n }\n float sum = 0;\n int count = 0;\n for (typename region_map_t<protocol_t, float>::iterator it = costs.begin(); it != costs.end(); it++) {\n \/* TODO: Scale by how much data is in `it->first` *\/\n sum += it->second;\n count++;\n }\n return sum \/ count;\n}\n\ninline std::vector<machine_id_t> pick_n_best(priority_queue_t<priority_t> *candidates, int n, const datacenter_id_t &datacenter) {\n std::vector<machine_id_t> result;\n while ((int)result.size() < n) {\n if (candidates->empty()) {\n throw cannot_satisfy_goals_exc_t(strprintf(\"Didn't have enough unused machines in datacenter %s, we needed %d\\n\", uuid_to_str(datacenter).c_str(), n));\n } else {\n result.push_back(candidates->pop().machine_id);\n }\n }\n return result;\n}\n\ntemplate<class protocol_t>\nstd::map<machine_id_t, typename blueprint_details::role_t> suggest_blueprint_for_shard(\n const std::map<machine_id_t, reactor_business_card_t<protocol_t> > &directory,\n const datacenter_id_t &primary_datacenter,\n const std::map<datacenter_id_t, int> &datacenter_affinities,\n const typename protocol_t::region_t &shard,\n const std::map<machine_id_t, datacenter_id_t> &machine_data_centers,\n const std::set<machine_id_t> &primary_pinnings,\n const std::set<machine_id_t> &secondary_pinnings,\n std::map<machine_id_t, int> *primary_usage,\n std::map<machine_id_t, int> *secondary_usage) {\n\n std::map<machine_id_t, typename blueprint_details::role_t> sub_blueprint;\n\n priority_queue_t<priority_t> primary_candidates;\n for (std::map<machine_id_t, datacenter_id_t>::const_iterator it = machine_data_centers.begin();\n it != machine_data_centers.end(); it++) {\n if (it->second == primary_datacenter) {\n bool pinned = std_contains(primary_pinnings, it->first);\n\n bool would_rob_secondary = std_contains(secondary_pinnings, it->first);\n\n int redundancy_cost = get_with_default(*primary_usage, it->first, 0);\n\n float backfill_cost;\n if (std_contains(directory, it->first)) {\n backfill_cost = estimate_cost_to_get_up_to_date(directory.find(it->first)->second, shard);\n } else {\n backfill_cost = 3.0;\n }\n\n primary_candidates.push(priority_t(it->first, pinned, would_rob_secondary, redundancy_cost, backfill_cost));\n }\n }\n machine_id_t primary = pick_n_best(&primary_candidates, 1, primary_datacenter).front();\n sub_blueprint[primary] = blueprint_details::role_primary;\n \n \/\/Update primary_usage\n get_with_default(*primary_usage, primary, 0)++;\n\n for (std::map<datacenter_id_t, int>::const_iterator it = datacenter_affinities.begin(); it != datacenter_affinities.end(); it++) {\n priority_queue_t<priority_t> secondary_candidates;\n for (std::map<machine_id_t, datacenter_id_t>::const_iterator jt = machine_data_centers.begin();\n jt != machine_data_centers.end(); jt++) {\n if (jt->second == it->first && jt->first != primary) {\n bool pinned = std_contains(secondary_pinnings, jt->first);\n\n int redundancy_cost = get_with_default(*secondary_usage, jt->first, 0);\n\n bool would_rob_secondary = false; \/\/we're the secondary, we shan't be robbing ourselves\n\n float backfill_cost;\n if (std_contains(directory, jt->first)) {\n backfill_cost = estimate_cost_to_get_up_to_date(directory.find(jt->first)->second, shard);\n } else {\n backfill_cost = 3.0;\n }\n\n secondary_candidates.push(priority_t(jt->first, pinned, would_rob_secondary, redundancy_cost, backfill_cost));\n }\n }\n std::vector<machine_id_t> secondaries = pick_n_best(&secondary_candidates, it->second, it->first);\n for (std::vector<machine_id_t>::iterator jt = secondaries.begin(); jt != secondaries.end(); jt++) {\n \/\/Update secondary usage\n get_with_default(*secondary_usage, *jt, 0)++;\n sub_blueprint[*jt] = blueprint_details::role_secondary;\n }\n }\n\n for (std::map<machine_id_t, datacenter_id_t>::const_iterator it = machine_data_centers.begin();\n it != machine_data_centers.end(); it++) {\n \/* This will set the value to `role_nothing` iff the peer is not already\n in the blueprint. *\/\n sub_blueprint.insert(std::make_pair(it->first, blueprint_details::role_nothing));\n }\n\n return sub_blueprint;\n}\n\ntemplate<class protocol_t>\npersistable_blueprint_t<protocol_t> suggest_blueprint(\n const std::map<machine_id_t, reactor_business_card_t<protocol_t> > &directory,\n const datacenter_id_t &primary_datacenter,\n const std::map<datacenter_id_t, int> &datacenter_affinities,\n const std::set<typename protocol_t::region_t> &shards,\n const std::map<machine_id_t, datacenter_id_t> &machine_data_centers,\n const region_map_t<protocol_t, machine_id_t> &primary_pinnings,\n const region_map_t<protocol_t, std::set<machine_id_t> > &secondary_pinnings) {\n\n typedef region_map_t<protocol_t, machine_id_t> primary_pinnings_map_t;\n typedef region_map_t<protocol_t, std::set<machine_id_t> > secondary_pinnings_map_t;\n\n persistable_blueprint_t<protocol_t> blueprint;\n\n \/\/Maps to keep track of how much we're using each machine\n std::map<machine_id_t, int> primary_usage, secondary_usage;\n for (typename std::set<typename protocol_t::region_t>::const_iterator it = shards.begin();\n it != shards.end(); it++) {\n std::set<machine_id_t> machines_shard_primary_is_pinned_to;\n primary_pinnings_map_t primary_masked_map = primary_pinnings.mask(*it);\n\n for (typename primary_pinnings_map_t::iterator pit = primary_masked_map.begin();\n pit != primary_masked_map.end();\n ++pit) {\n machines_shard_primary_is_pinned_to.insert(pit->second);\n }\n\n std::set<machine_id_t> machines_shard_secondary_is_pinned_to;\n secondary_pinnings_map_t secondary_masked_map = secondary_pinnings.mask(*it);\n\n for (typename secondary_pinnings_map_t::iterator pit = secondary_masked_map.begin();\n pit != secondary_masked_map.end();\n ++pit) {\n machines_shard_secondary_is_pinned_to.insert(pit->second.begin(), pit->second.end());\n }\n\n std::map<machine_id_t, typename blueprint_details::role_t> shard_blueprint =\n suggest_blueprint_for_shard(directory, primary_datacenter, datacenter_affinities, *it, \n machine_data_centers, machines_shard_primary_is_pinned_to, \n machines_shard_secondary_is_pinned_to, &primary_usage,\n &secondary_usage);\n for (typename std::map<machine_id_t, typename blueprint_details::role_t>::iterator jt = shard_blueprint.begin();\n jt != shard_blueprint.end(); jt++) {\n blueprint.machines_roles[jt->first][*it] = jt->second;\n }\n }\n return blueprint;\n}\n\n#endif \/* CLUSTERING_SUGGESTER_SUGGESTER_TCC_ *\/\n<|endoftext|>"} {"text":"<commit_before>\/* Blink Example\n\n This example code is in the Public Domain (or CC0 licensed, at your option.)\n\n Unless required by applicable law or agreed to in writing, this\n software is distributed on an \"AS IS\" BASIS, WITHOUT WARRANTIES OR\n CONDITIONS OF ANY KIND, either express or implied.\n*\/\n#include <stdio.h>\n#include \"freertos\/FreeRTOS.h\"\n#include \"freertos\/task.h\"\n#include \"esp_system.h\"\n#include \"sdkconfig.h\"\n\n\n\nvoid signal_generator_task(void *pvParameter)\n{\n while(1) {\n vTaskDelay(1000 \/ portTICK_PERIOD_MS);\n }\n}\n\nvoid signal_generator_app_main()\n{\n xTaskCreate(&signal_generator_task, \"signal_generator_task\", 512, NULL, 5, NULL);\n}\n<commit_msg>Update signal.generator.cpp<commit_after>\/* Blink Example\n\n This example code is in the Public Domain (or CC0 licensed, at your option.)\n\n Unless required by applicable law or agreed to in writing, this\n software is distributed on an \"AS IS\" BASIS, WITHOUT WARRANTIES OR\n CONDITIONS OF ANY KIND, either express or implied.\n*\/\n#include <stdio.h>\n#include \"freertos\/FreeRTOS.h\"\n#include \"freertos\/task.h\"\n#include \"esp_system.h\"\n#include \"sdkconfig.h\"\n#include <cmath>\n\n#define ms(x) (x\/portTICK_PERIOD_MS)\n#define DUMP_VAR_f(x) \\\n printf(\"%s:%d:%s=<%f>\",__FILE__,__LINE__,#x,x)\n\n\nstatic const int iConstSampleRate = 50;\nstatic const int iConstSampleDelay = 1000\/iConstSampleRate;\nstatic const double pi = std::acos(-1);\n\nstatic char signal(int counter)\n{\n double x = 2 pi * (double)counter\/(double)50;\n double y = sin(x);\n DUMP_VAR_f(x);\n DUMP_VAR_f(y);\n return y *127;\n}\n\nstatic int gSamplerCounter = 0;\n\nvoid signal_generator_task(void *pvParameter)\n{\n while(true) {\n auto sign = signal(gSamplerCounter++%iConstSampleRate);\n vTaskDelay(ms(iConstSampleDelay));\n }\n}\n\nvoid signal_generator_app_main()\n{\n xTaskCreate(&signal_generator_task, \"signal_generator_task\", 512, NULL, 5, NULL);\n}\n<|endoftext|>"} {"text":"<commit_before>\/* Sirikata Utilities -- Math Library\n * BoundingBox.hpp\n *\n * Copyright (c) 2009, Daniel Reiter Horn\n * All rights reserved.\n *\n * Redistribution and use in source and binary forms, with or without\n * modification, are permitted provided that the following conditions are\n * met:\n * * Redistributions of source code must retain the above copyright\n * notice, this list of conditions and the following disclaimer.\n * * Redistributions in binary form must reproduce the above copyright\n * notice, this list of conditions and the following disclaimer in\n * the documentation and\/or other materials provided with the\n * distribution.\n * * Neither the name of Sirikata nor the names of its contributors may\n * be used to endorse or promote products derived from this software\n * without specific prior written permission.\n *\n * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS \"AS\n * IS\" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED\n * TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A\n * PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER\n * OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,\n * EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,\n * PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR\n * PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF\n * LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING\n * NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS\n * SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.\n *\/\n#ifndef _SIRIKATA_BOUNDING_BOX_HPP\n#define _SIRIKATA_BOUNDING_BOX_HPP\nnamespace Sirikata {\ntemplate <typename real> class BoundingBox {\n Vector3<real> mMin;\n Vector3f mAcross;\npublic:\n BoundingBox() {}\n static BoundingBox<real> null() {\n return BoundingBox<real>(Vector3<real>(0,0,0),0);\n }\n\n BoundingBox(const Vector3<real>¢er, float radius){\n mMin=center-Vector3<real>(radius,radius,radius);\n mAcross=Vector3f(2.0*radius,2.0*radius,2.0*radius);\n }\n template <typename flt> BoundingBox(const BoundingBox<flt>&input) {\n mMin=Vector3<real>(input.mMin);\n mAcross=input.mAcross;\n }\n BoundingBox(const Vector3<real>&imin,const Vector3<real>&imax){\n mMin=imin;\n mAcross=Vector3f(imax-imin);\n }\n \n const Vector3<real> &min()const{\n return mMin;\n }\n const Vector3f& across() const {\n return mAcross;\n }\n Vector3<real> max() const {\n return mMin+Vector3<real>(mAcross);\n }\n Vector3<real> center() const {\n return mMin+Vector3<real>(mAcross * 0.5f);\n }\n BoundingSphere<real> toBoundingSphere() {\n Vector3<real> center=this->center();\n float maxlen=(this->max()-this->center()).lengthSquared();\n float minlen=(this->min()-this->center()).lengthSquared();\n float radius=std::sqrt(minlen<maxlen?maxlen:minlen);\n return BoundingSphere<real>(center,radius);\n }\n\n BoundingBox<real> merge(const BoundingBox<real>&other) {\n return BoundingBox<real>(min().min(other.min()),\n max().max(other.max()));\n }\n BoundingBox merge(const Vector3<real>&other) {\n return BoundingBox(min().min(other),\n max().max(other));\n }\n};\n}\n#endif\n<commit_msg>Fill out the BoundingBox class with more useful methods.<commit_after>\/* Sirikata Utilities -- Math Library\n * BoundingBox.hpp\n *\n * Copyright (c) 2009, Daniel Reiter Horn\n * All rights reserved.\n *\n * Redistribution and use in source and binary forms, with or without\n * modification, are permitted provided that the following conditions are\n * met:\n * * Redistributions of source code must retain the above copyright\n * notice, this list of conditions and the following disclaimer.\n * * Redistributions in binary form must reproduce the above copyright\n * notice, this list of conditions and the following disclaimer in\n * the documentation and\/or other materials provided with the\n * distribution.\n * * Neither the name of Sirikata nor the names of its contributors may\n * be used to endorse or promote products derived from this software\n * without specific prior written permission.\n *\n * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS \"AS\n * IS\" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED\n * TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A\n * PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER\n * OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,\n * EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,\n * PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR\n * PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF\n * LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING\n * NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS\n * SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.\n *\/\n#ifndef _SIRIKATA_BOUNDING_BOX_HPP\n#define _SIRIKATA_BOUNDING_BOX_HPP\n\n#define BBOX_CONTAINS_EPSILON 0.0005\n\nnamespace Sirikata {\ntemplate <typename real> class BoundingBox {\n Vector3<real> mMin;\n Vector3f mAcross;\npublic:\n BoundingBox() {}\n static BoundingBox<real> null() {\n return BoundingBox<real>(Vector3<real>(0,0,0),0);\n }\n\n BoundingBox(const Vector3<real>¢er, float radius){\n mMin=center-Vector3<real>(radius,radius,radius);\n mAcross=Vector3f(2.0*radius,2.0*radius,2.0*radius);\n }\n template <typename flt> BoundingBox(const BoundingBox<flt>&input) {\n mMin=Vector3<real>(input.mMin);\n mAcross=input.mAcross;\n }\n BoundingBox(const Vector3<real>&imin,const Vector3<real>&imax){\n mMin=imin;\n mAcross=Vector3f(imax-imin);\n }\n\n const Vector3<real> &min()const{\n return mMin;\n }\n const Vector3f& across() const {\n return mAcross;\n }\n const Vector3f& diag() const {\n return mAcross;\n }\n const Vector3f& extents() const {\n return mAcross;\n }\n Vector3<real> max() const {\n return mMin+Vector3<real>(mAcross);\n }\n Vector3<real> center() const {\n return mMin+Vector3<real>(mAcross * 0.5f);\n }\n BoundingSphere<real> toBoundingSphere() {\n Vector3<real> center=this->center();\n float maxlen=(this->max()-this->center()).lengthSquared();\n float minlen=(this->min()-this->center()).lengthSquared();\n float radius=std::sqrt(minlen<maxlen?maxlen:minlen);\n return BoundingSphere<real>(center,radius);\n }\n\n BoundingBox<real> merge(const BoundingBox<real>&other) {\n return BoundingBox<real>(min().min(other.min()),\n max().max(other.max()));\n }\n BoundingBox merge(const Vector3<real>&other) {\n return BoundingBox(min().min(other),\n max().max(other));\n }\n\n BoundingBox& mergeIn(const BoundingBox<real>& other) {\n mMin = min().min(other.min());\n Vector3<real> mmax = max().max(other.max());\n mAcross = Vector3f(mmax - mMin);\n return *this;\n }\n\n BoundingBox& mergeIn(const Vector3<real>& other) {\n mMin = min().min(other);\n Vector3<real> mmax = max().max(other);\n mAcross = Vector3f(mmax - mMin);\n return *this;\n }\n\n bool contains(const Vector3<real>& point, real eps = BBOX_CONTAINS_EPSILON) const {\n Vector3<real> mmax = max();\n for(int i = 0; i < Vector3<real>::size; i++) {\n if (mMin[i] > point[i] || mmax[i] < point[i]) {\n if ( fabs(mMin[i] - point[i]) > eps &&\n fabs(mmax[i] - point[i]) > eps )\n {\n return false;\n }\n }\n }\n return true;\n }\n\n\n bool degenerate() const {\n for(int i = 0; i < Vector3<real>::size; i++)\n if (mAcross[i] <= 0) return true;\n return false;\n }\n\n real volume() const {\n if (degenerate()) return 0.0;\n real vol = 1;\n for(int i = 0; i < Vector3<real>::size; i++)\n vol *= mAcross[i];\n return vol;\n }\n\n Vector3<real> clamp(const Vector3<real>& v) const {\n return v.max(min()).min(max());\n }\n\n bool operator==(const BoundingBox& rhs) {\n return (mMin == rhs.mMin && mAcross == rhs.mAcross);\n }\n bool operator!=(const BoundingBox& rhs) {\n return (mMin != rhs.mMin || mAcross != rhs.mAcross);\n }\n\n};\n\n}\n#endif\n<|endoftext|>"} {"text":"<commit_before>\/\/ Tags.cpp\n\/\/ Copyright (c) 2010, Dan Heeks\n\/\/ This program is released under the BSD license. See the file COPYING for details.\n\n#include \"stdafx.h\"\n#include \"Tags.h\"\n#include \"Tag.h\"\n#include \"tinyxml\/tinyxml.h\"\n#include \"interface\/Tool.h\"\n\nbool CTags::CanAdd(HeeksObj* object)\n{\n\treturn ((object != NULL) && (object->GetType() == TagType));\n}\n\nCTags & CTags::operator= ( const CTags & rhs )\n{\n\tif (this != &rhs)\n\t{\n\t\tObjList::operator=( rhs );\n\t}\n\n\treturn(*this);\n}\n\nCTags::CTags( const CTags & rhs ) : ObjList(rhs)\n{\n}\n\r\nconst wxBitmap &CTags::GetIcon()\n{\n\tstatic wxBitmap* icon = NULL;\n\tif(icon == NULL)icon = new wxBitmap(wxImage(theApp.GetResFolder() + _T(\"\/icons\/tags.png\")));\n\treturn *icon;\n}\n\nstatic CTags* object_for_tools = NULL;\n\nclass AddTagTool: public Tool\n{\npublic:\n\t\/\/ Tool's virtual functions\n\tconst wxChar* GetTitle(){return _(\"Add Tag\");}\n\n\tvoid Run()\n\t{\n\t\theeksCAD->CreateUndoPoint();\n\t\tCTag* new_object = new CTag();\n\t\tobject_for_tools->Add(new_object, NULL);\n\t\theeksCAD->Changed();\n\t\theeksCAD->ClearMarkedList();\n\t\theeksCAD->Mark(new_object);\n\t}\n\tbool CallChangedOnRun(){return false;}\n\twxString BitmapPath(){ return _T(\"addtag\");}\n};\n\nstatic AddTagTool add_tag_tool;\n\nvoid CTags::GetTools(std::list<Tool*>* t_list, const wxPoint* p)\n{\n\tobject_for_tools = this;\n\tt_list->push_back(&add_tag_tool);\n}\n\nvoid CTags::WriteXML(TiXmlNode *root)\n{\n\tTiXmlElement * element;\n\telement = new TiXmlElement( \"Tags\" );\n\troot->LinkEndChild( element );\n\tWriteBaseXML(element);\n}\n\n\/\/static\nHeeksObj* CTags::ReadFromXMLElement(TiXmlElement* pElem)\n{\n\tCTags* new_object = new CTags;\n\tnew_object->ReadBaseXML(pElem);\n\treturn new_object;\n}\n<commit_msg>Fixed SEGFAULT at Tags.cpp:50 caused by NULL object_for_tools<commit_after>\/\/ Tags.cpp\n\/\/ Copyright (c) 2010, Dan Heeks\n\/\/ This program is released under the BSD license. See the file COPYING for details.\n\n#include \"stdafx.h\"\n#include \"Tags.h\"\n#include \"Tag.h\"\n#include \"tinyxml\/tinyxml.h\"\n#include \"interface\/Tool.h\"\n\nbool CTags::CanAdd(HeeksObj* object)\n{\n\treturn ((object != NULL) && (object->GetType() == TagType));\n}\n\nCTags & CTags::operator= ( const CTags & rhs )\n{\n\tif (this != &rhs)\n\t{\n\t\tObjList::operator=( rhs );\n\t}\n\n\treturn(*this);\n}\n\nCTags::CTags( const CTags & rhs ) : ObjList(rhs)\n{\n}\n\r\nconst wxBitmap &CTags::GetIcon()\n{\n\tstatic wxBitmap* icon = NULL;\n\tif(icon == NULL)icon = new wxBitmap(wxImage(theApp.GetResFolder() + _T(\"\/icons\/tags.png\")));\n\treturn *icon;\n}\n\nstatic CTags* object_for_tools = NULL;\n\nclass AddTagTool: public Tool\n{\npublic:\n\t\/\/ Tool's virtual functions\n\tconst wxChar* GetTitle(){return _(\"Add Tag\");}\n\n\tvoid Run()\n\t{\n if (object_for_tools) { \/\/ jcoffland: object_for_tools can be NULL\n\t\theeksCAD->CreateUndoPoint();\n\t\tCTag* new_object = new CTag();\n\t\tobject_for_tools->Add(new_object, NULL);\n\t\theeksCAD->Changed();\n\t\theeksCAD->ClearMarkedList();\n\t\theeksCAD->Mark(new_object);\n }\n\t}\n\tbool CallChangedOnRun(){return false;}\n\twxString BitmapPath(){ return _T(\"addtag\");}\n};\n\nstatic AddTagTool add_tag_tool;\n\nvoid CTags::GetTools(std::list<Tool*>* t_list, const wxPoint* p)\n{\n\tobject_for_tools = this;\n\tt_list->push_back(&add_tag_tool);\n}\n\nvoid CTags::WriteXML(TiXmlNode *root)\n{\n\tTiXmlElement * element;\n\telement = new TiXmlElement( \"Tags\" );\n\troot->LinkEndChild( element );\n\tWriteBaseXML(element);\n}\n\n\/\/static\nHeeksObj* CTags::ReadFromXMLElement(TiXmlElement* pElem)\n{\n\tCTags* new_object = new CTags;\n\tnew_object->ReadBaseXML(pElem);\n\treturn new_object;\n}\n<|endoftext|>"} {"text":"<commit_before>\/*\n\nCopyright (c) 2006, MassaRoddel, 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#ifdef _MSC_VER\n#pragma warning(push, 1)\n#endif\n\n#include <boost\/shared_ptr.hpp>\n\n#ifdef _MSC_VER\n#pragma warning(pop)\n#endif\n\n#include \"libtorrent\/peer_connection.hpp\"\n#include \"libtorrent\/bt_peer_connection.hpp\"\n#include \"libtorrent\/bencode.hpp\"\n#include \"libtorrent\/torrent.hpp\"\n#include \"libtorrent\/extensions.hpp\"\n\n#include \"libtorrent\/extensions\/ut_pex.hpp\"\n\nnamespace libtorrent { namespace\n{\n\tconst char extension_name[] = \"ut_pex\";\n\n\tenum\n\t{\n\t\textension_index = 1,\n\t\tmax_peer_entries = 100\n\t};\n\n\tstruct ut_pex_plugin: torrent_plugin\n\t{\n\t\tut_pex_plugin(torrent& t): m_torrent(t), m_1_minute(0) {}\n\t\n\t\tvirtual boost::shared_ptr<peer_plugin> new_connection(peer_connection* pc);\n\n\t\tstd::vector<char>& get_ut_pex_msg()\n\t\t{\n\t\t\treturn m_ut_pex_msg;\n\t\t}\n\n\t\t\/\/ the second tick of the torrent\n\t\t\/\/ each minute the new lists of \"added\" + \"added.f\" and \"dropped\"\n\t\t\/\/ are calculated here and the pex message is created\n\t\t\/\/ each peer connection will use this message\n\t\t\/\/ max_peer_entries limits the packet size\n\t\tvirtual void tick()\n\t\t{\n\t\t\tif (++m_1_minute < 60) return;\n\n\t\t\tm_1_minute = 0;\n\t\t\tstd::list<tcp::endpoint> cs;\n\t\t\tfor (torrent::peer_iterator i = m_torrent.begin()\n\t\t\t\t, end(m_torrent.end()); i != end; ++i)\n\t\t\t{\t\n\t\t\t\t\/\/ don't send out peers that we haven't connected to\n\t\t\t\t\/\/ (that have connected to us)\n\t\t\t\tif (!i->second->is_local()) continue;\n\t\t\t\t\/\/ don't send out peers that we haven't successfully connected to\n\t\t\t\tif (i->second->connecting()) continue;\n\t\t\t\tcs.push_back(i->first);\n\t\t\t}\n\t\t\tstd::list<tcp::endpoint> added_peers, dropped_peers;\n\n\t\t\tstd::set_difference(cs.begin(), cs.end(), m_old_peers.begin()\n\t\t\t\t, m_old_peers.end(), std::back_inserter(added_peers));\n\t\t\tstd::set_difference(m_old_peers.begin(), m_old_peers.end()\n\t\t\t\t, cs.begin(), cs.end(), std::back_inserter(dropped_peers));\n\t\t\tm_old_peers = cs;\n\n\t\t\tunsigned int num_peers = max_peer_entries;\n\n\t\t\tstd::string pla, pld, plf;\n\t\t\tstd::back_insert_iterator<std::string> pla_out(pla);\n\t\t\tstd::back_insert_iterator<std::string> pld_out(pld);\n\t\t\tstd::back_insert_iterator<std::string> plf_out(plf);\n\n\t\t\t\/\/ TODO: use random selection in case added_peers.size() > num_peers\n\t\t\tfor (std::list<tcp::endpoint>::const_iterator i = added_peers.begin()\n\t\t\t\t, end(added_peers.end());i != end; ++i)\n\t\t\t{\t\n\t\t\t\tif (!i->address().is_v4()) continue;\n\t\t\t\tdetail::write_endpoint(*i, pla_out);\n\t\t\t\t\/\/ no supported flags to set yet\n\t\t\t\t\/\/ 0x01 - peer supports encryption\n\t\t\t\tdetail::write_uint8(0, plf_out);\n\n\t\t\t\tif (--num_peers == 0) break;\n\t\t\t}\n\n\t\t\tnum_peers = max_peer_entries;\n\t\t\t\/\/ TODO: use random selection in case dropped_peers.size() > num_peers\n\t\t\tfor (std::list<tcp::endpoint>::const_iterator i = dropped_peers.begin()\n\t\t\t\t, end(dropped_peers.end());i != end; ++i)\n\t\t\t{\t\n\t\t\t\tif (!i->address().is_v4()) continue;\n\t\t\t\tdetail::write_endpoint(*i, pld_out);\n\n\t\t\t\tif (--num_peers == 0) break;\n\t\t\t}\n\n\t\t\tentry pex(entry::dictionary_t);\n\t\t\tpex[\"added\"] = pla;\n\t\t\tpex[\"dropped\"] = pld;\n\t\t\tpex[\"added.f\"] = plf;\n\n\t\t\tm_ut_pex_msg.clear();\n\t\t\tbencode(std::back_inserter(m_ut_pex_msg), pex);\n\t\t}\n\n\tprivate:\n\t\ttorrent& m_torrent;\n\n\t\tstd::list<tcp::endpoint> m_old_peers;\n\t\tint m_1_minute;\n\t\tstd::vector<char> m_ut_pex_msg;\n\t};\n\n\n\tstruct ut_pex_peer_plugin : peer_plugin\n\t{\t\n\t\tut_pex_peer_plugin(torrent& t, peer_connection& pc, ut_pex_plugin& tp)\n\t\t\t: m_torrent(t)\n\t\t\t, m_pc(pc)\n\t\t\t, m_tp(tp)\n\t\t\t, m_1_minute(0)\n\t\t\t, m_message_index(0)\n\t\t{}\n\n\t\tvirtual void add_handshake(entry& h)\n\t\t{\n\t\t\tentry& messages = h[\"m\"];\n\t\t\tmessages[extension_name] = extension_index;\n\t\t}\n\n\t\tvirtual bool on_extension_handshake(entry const& h)\n\t\t{\n\t\t\tentry const& messages = h[\"m\"];\n\n\t\t\tif (entry const* index = messages.find_key(extension_name))\n\t\t\t{\n\t\t\t\tm_message_index = index->integer();\n\t\t\t\treturn true;\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\tm_message_index = 0;\n\t\t\t\treturn false;\n\t\t\t}\n\t\t}\n\n\t\tvirtual bool on_extended(int length, int msg, buffer::const_interval body)\n\t\t{\n\t\t\tif (msg != extension_index) return false;\n\t\t\tif (m_message_index == 0) return false;\n\n\t\t\tif (length > 500 * 1024)\n\t\t\t\tthrow protocol_error(\"ut peer exchange message larger than 500 kB\");\n\n\t\t\tif (body.left() < length) return true;\n\n\t\t\t\/\/ in case we are a seed we do not use the peers\n\t\t\t\/\/ from the pex message to prevent us from \n\t\t\t\/\/ overloading ourself\n\t\t\tif (m_torrent.is_seed()) return true;\n\t\t\t\n\t\t\tentry Pex = bdecode(body.begin, body.end);\n\t\t\tentry* PeerList = Pex.find_key(\"added\");\n\n\t\t\tif (!PeerList) return true;\n\t\t\tstd::string const& peers = PeerList->string();\n\t\t\tint num_peers = peers.length() \/ 6;\n\t\t\tchar const* in = peers.c_str();\n\n\t\t\tpeer_id pid;\n\t\t\tpid.clear();\n\t\t\tpolicy& p = m_torrent.get_policy();\n\t\t\tfor (int i = 0; i < num_peers; ++i)\n\t\t\t{\n\t\t\t\ttcp::endpoint adr = detail::read_v4_endpoint<tcp::endpoint>(in);\n\t\t\t\tif (!m_torrent.connection_for(adr)) p.peer_from_tracker(adr, pid);\n\t\t\t} \n\t\t\treturn true;\n\t\t}\n\n\t\t\/\/ the peers second tick\n\t\t\/\/ every minute we send a pex message\n\t\tvirtual void tick()\n\t\t{\n\t\t\tif (!m_message_index) return;\t\/\/ no handshake yet\n\t\t\tif (++m_1_minute <= 60) return;\n\n\t\t\tsend_ut_peer_list();\n\t\t\tm_1_minute = 0;\n\t\t}\n\n\tprivate:\n\n\t\tvoid send_ut_peer_list()\n\t\t{\n\t\t\tstd::vector<char>& pex_msg = m_tp.get_ut_pex_msg();\n\n\t\t\tbuffer::interval i = m_pc.allocate_send_buffer(6 + pex_msg.size());\n\n\t\t\tdetail::write_uint32(1 + 1 + pex_msg.size(), i.begin);\n\t\t\tdetail::write_uint8(bt_peer_connection::msg_extended, i.begin);\n\t\t\tdetail::write_uint8(m_message_index, i.begin);\n\t\t\tstd::copy(pex_msg.begin(), pex_msg.end(), i.begin);\n\t\t\ti.begin += pex_msg.size();\n\n\t\t\tassert(i.begin == i.end);\n\t\t\tm_pc.setup_send();\n\t\t}\n\n\t\ttorrent& m_torrent;\n\t\tpeer_connection& m_pc;\n\t\tut_pex_plugin& m_tp;\n\t\tint m_1_minute;\n\t\tint m_message_index;\n\t};\n\n\tboost::shared_ptr<peer_plugin> ut_pex_plugin::new_connection(peer_connection* pc)\n\t{\n\t\treturn boost::shared_ptr<peer_plugin>(new ut_pex_peer_plugin(m_torrent\n\t\t\t, *pc, *this));\n\t}\n}}\n\nnamespace libtorrent\n{\n\n\tboost::shared_ptr<torrent_plugin> create_ut_pex_plugin(torrent* t)\n\t{\n\t\tif (t->torrent_file().priv())\n\t\t{\n\t\t\treturn boost::shared_ptr<torrent_plugin>();\n\t\t}\n\t\treturn boost::shared_ptr<torrent_plugin>(new ut_pex_plugin(*t));\n\t}\n\n}\n\n\n<commit_msg>fixed typo<commit_after>\/*\n\nCopyright (c) 2006, MassaRoddel, 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#ifdef _MSC_VER\n#pragma warning(push, 1)\n#endif\n\n#include <boost\/shared_ptr.hpp>\n\n#ifdef _MSC_VER\n#pragma warning(pop)\n#endif\n\n#include \"libtorrent\/peer_connection.hpp\"\n#include \"libtorrent\/bt_peer_connection.hpp\"\n#include \"libtorrent\/bencode.hpp\"\n#include \"libtorrent\/torrent.hpp\"\n#include \"libtorrent\/extensions.hpp\"\n\n#include \"libtorrent\/extensions\/ut_pex.hpp\"\n\nnamespace libtorrent { namespace\n{\n\tconst char extension_name[] = \"ut_pex\";\n\n\tenum\n\t{\n\t\textension_index = 1,\n\t\tmax_peer_entries = 100\n\t};\n\n\tstruct ut_pex_plugin: torrent_plugin\n\t{\n\t\tut_pex_plugin(torrent& t): m_torrent(t), m_1_minute(0) {}\n\t\n\t\tvirtual boost::shared_ptr<peer_plugin> new_connection(peer_connection* pc);\n\n\t\tstd::vector<char>& get_ut_pex_msg()\n\t\t{\n\t\t\treturn m_ut_pex_msg;\n\t\t}\n\n\t\t\/\/ the second tick of the torrent\n\t\t\/\/ each minute the new lists of \"added\" + \"added.f\" and \"dropped\"\n\t\t\/\/ are calculated here and the pex message is created\n\t\t\/\/ each peer connection will use this message\n\t\t\/\/ max_peer_entries limits the packet size\n\t\tvirtual void tick()\n\t\t{\n\t\t\tif (++m_1_minute < 60) return;\n\n\t\t\tm_1_minute = 0;\n\t\t\tstd::list<tcp::endpoint> cs;\n\t\t\tfor (torrent::peer_iterator i = m_torrent.begin()\n\t\t\t\t, end(m_torrent.end()); i != end; ++i)\n\t\t\t{\t\n\t\t\t\t\/\/ don't send out peers that we haven't connected to\n\t\t\t\t\/\/ (that have connected to us)\n\t\t\t\tif (!i->second->is_local()) continue;\n\t\t\t\t\/\/ don't send out peers that we haven't successfully connected to\n\t\t\t\tif (i->second->is_connecting()) continue;\n\t\t\t\tcs.push_back(i->first);\n\t\t\t}\n\t\t\tstd::list<tcp::endpoint> added_peers, dropped_peers;\n\n\t\t\tstd::set_difference(cs.begin(), cs.end(), m_old_peers.begin()\n\t\t\t\t, m_old_peers.end(), std::back_inserter(added_peers));\n\t\t\tstd::set_difference(m_old_peers.begin(), m_old_peers.end()\n\t\t\t\t, cs.begin(), cs.end(), std::back_inserter(dropped_peers));\n\t\t\tm_old_peers = cs;\n\n\t\t\tunsigned int num_peers = max_peer_entries;\n\n\t\t\tstd::string pla, pld, plf;\n\t\t\tstd::back_insert_iterator<std::string> pla_out(pla);\n\t\t\tstd::back_insert_iterator<std::string> pld_out(pld);\n\t\t\tstd::back_insert_iterator<std::string> plf_out(plf);\n\n\t\t\t\/\/ TODO: use random selection in case added_peers.size() > num_peers\n\t\t\tfor (std::list<tcp::endpoint>::const_iterator i = added_peers.begin()\n\t\t\t\t, end(added_peers.end());i != end; ++i)\n\t\t\t{\t\n\t\t\t\tif (!i->address().is_v4()) continue;\n\t\t\t\tdetail::write_endpoint(*i, pla_out);\n\t\t\t\t\/\/ no supported flags to set yet\n\t\t\t\t\/\/ 0x01 - peer supports encryption\n\t\t\t\tdetail::write_uint8(0, plf_out);\n\n\t\t\t\tif (--num_peers == 0) break;\n\t\t\t}\n\n\t\t\tnum_peers = max_peer_entries;\n\t\t\t\/\/ TODO: use random selection in case dropped_peers.size() > num_peers\n\t\t\tfor (std::list<tcp::endpoint>::const_iterator i = dropped_peers.begin()\n\t\t\t\t, end(dropped_peers.end());i != end; ++i)\n\t\t\t{\t\n\t\t\t\tif (!i->address().is_v4()) continue;\n\t\t\t\tdetail::write_endpoint(*i, pld_out);\n\n\t\t\t\tif (--num_peers == 0) break;\n\t\t\t}\n\n\t\t\tentry pex(entry::dictionary_t);\n\t\t\tpex[\"added\"] = pla;\n\t\t\tpex[\"dropped\"] = pld;\n\t\t\tpex[\"added.f\"] = plf;\n\n\t\t\tm_ut_pex_msg.clear();\n\t\t\tbencode(std::back_inserter(m_ut_pex_msg), pex);\n\t\t}\n\n\tprivate:\n\t\ttorrent& m_torrent;\n\n\t\tstd::list<tcp::endpoint> m_old_peers;\n\t\tint m_1_minute;\n\t\tstd::vector<char> m_ut_pex_msg;\n\t};\n\n\n\tstruct ut_pex_peer_plugin : peer_plugin\n\t{\t\n\t\tut_pex_peer_plugin(torrent& t, peer_connection& pc, ut_pex_plugin& tp)\n\t\t\t: m_torrent(t)\n\t\t\t, m_pc(pc)\n\t\t\t, m_tp(tp)\n\t\t\t, m_1_minute(0)\n\t\t\t, m_message_index(0)\n\t\t{}\n\n\t\tvirtual void add_handshake(entry& h)\n\t\t{\n\t\t\tentry& messages = h[\"m\"];\n\t\t\tmessages[extension_name] = extension_index;\n\t\t}\n\n\t\tvirtual bool on_extension_handshake(entry const& h)\n\t\t{\n\t\t\tentry const& messages = h[\"m\"];\n\n\t\t\tif (entry const* index = messages.find_key(extension_name))\n\t\t\t{\n\t\t\t\tm_message_index = index->integer();\n\t\t\t\treturn true;\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\tm_message_index = 0;\n\t\t\t\treturn false;\n\t\t\t}\n\t\t}\n\n\t\tvirtual bool on_extended(int length, int msg, buffer::const_interval body)\n\t\t{\n\t\t\tif (msg != extension_index) return false;\n\t\t\tif (m_message_index == 0) return false;\n\n\t\t\tif (length > 500 * 1024)\n\t\t\t\tthrow protocol_error(\"ut peer exchange message larger than 500 kB\");\n\n\t\t\tif (body.left() < length) return true;\n\n\t\t\t\/\/ in case we are a seed we do not use the peers\n\t\t\t\/\/ from the pex message to prevent us from \n\t\t\t\/\/ overloading ourself\n\t\t\tif (m_torrent.is_seed()) return true;\n\t\t\t\n\t\t\tentry Pex = bdecode(body.begin, body.end);\n\t\t\tentry* PeerList = Pex.find_key(\"added\");\n\n\t\t\tif (!PeerList) return true;\n\t\t\tstd::string const& peers = PeerList->string();\n\t\t\tint num_peers = peers.length() \/ 6;\n\t\t\tchar const* in = peers.c_str();\n\n\t\t\tpeer_id pid;\n\t\t\tpid.clear();\n\t\t\tpolicy& p = m_torrent.get_policy();\n\t\t\tfor (int i = 0; i < num_peers; ++i)\n\t\t\t{\n\t\t\t\ttcp::endpoint adr = detail::read_v4_endpoint<tcp::endpoint>(in);\n\t\t\t\tif (!m_torrent.connection_for(adr)) p.peer_from_tracker(adr, pid);\n\t\t\t} \n\t\t\treturn true;\n\t\t}\n\n\t\t\/\/ the peers second tick\n\t\t\/\/ every minute we send a pex message\n\t\tvirtual void tick()\n\t\t{\n\t\t\tif (!m_message_index) return;\t\/\/ no handshake yet\n\t\t\tif (++m_1_minute <= 60) return;\n\n\t\t\tsend_ut_peer_list();\n\t\t\tm_1_minute = 0;\n\t\t}\n\n\tprivate:\n\n\t\tvoid send_ut_peer_list()\n\t\t{\n\t\t\tstd::vector<char>& pex_msg = m_tp.get_ut_pex_msg();\n\n\t\t\tbuffer::interval i = m_pc.allocate_send_buffer(6 + pex_msg.size());\n\n\t\t\tdetail::write_uint32(1 + 1 + pex_msg.size(), i.begin);\n\t\t\tdetail::write_uint8(bt_peer_connection::msg_extended, i.begin);\n\t\t\tdetail::write_uint8(m_message_index, i.begin);\n\t\t\tstd::copy(pex_msg.begin(), pex_msg.end(), i.begin);\n\t\t\ti.begin += pex_msg.size();\n\n\t\t\tassert(i.begin == i.end);\n\t\t\tm_pc.setup_send();\n\t\t}\n\n\t\ttorrent& m_torrent;\n\t\tpeer_connection& m_pc;\n\t\tut_pex_plugin& m_tp;\n\t\tint m_1_minute;\n\t\tint m_message_index;\n\t};\n\n\tboost::shared_ptr<peer_plugin> ut_pex_plugin::new_connection(peer_connection* pc)\n\t{\n\t\treturn boost::shared_ptr<peer_plugin>(new ut_pex_peer_plugin(m_torrent\n\t\t\t, *pc, *this));\n\t}\n}}\n\nnamespace libtorrent\n{\n\n\tboost::shared_ptr<torrent_plugin> create_ut_pex_plugin(torrent* t)\n\t{\n\t\tif (t->torrent_file().priv())\n\t\t{\n\t\t\treturn boost::shared_ptr<torrent_plugin>();\n\t\t}\n\t\treturn boost::shared_ptr<torrent_plugin>(new ut_pex_plugin(*t));\n\t}\n\n}\n\n\n<|endoftext|>"} {"text":"<commit_before>\/*\n** Author(s):\n** - Cedric GESTES <gestes@aldebaran-robotics.com>\n**\n** Copyright (C) 2010, 2012 Aldebaran Robotics\n*\/\n\n#include <iostream>\n#include <string>\n#include <map>\n\n#include <qi\/os.hpp>\n#include <qimessaging\/session.hpp>\n#include <qimessaging\/transport.hpp>\n#include <qimessaging\/object.hpp>\n\n#include <boost\/program_options.hpp>\n\nnamespace po = boost::program_options;\n\nstatic int uniqueReqId = 200;\n\nvoid call(const std::string &addr)\n{\n qi::Session session;\n session.setName(\"client.session\");\n session.connect(addr);\n session.waitForConnected();\n\n std::vector<std::string> servs = session.services();\n for (int i = 0; i < servs.size(); ++i)\n std::cout << \"service named \" << servs[i] << std::endl;\n\n\n qi::Object *obj = session.service(\"serviceTest\");\n\n if (obj == 0)\n {\n std::cerr << \"obj == 0\" << std::endl;\n return;\n }\n\n std::string result = obj->call<std::string>(\"reply\", \"plaf\");\n\n std::cout << \"answer:\" << result << std::endl;\n\n qi::os::sleep(2);\n\n session.disconnect();\n}\n\n\nint main(int argc, char *argv[])\n{\n \/\/ declare the program options\n po::options_description desc(\"Usage:\\n qi masterAddress [options]\\nOptions\");\n desc.add_options()\n (\"help\", \"Print this help.\")\n (\"master-address\",\n po::value<std::string>()->default_value(std::string(\"127.0.0.1:5555\")),\n \"The master address\")\n (\"gateway-address\",\n po::value<std::string>()->default_value(std::string(\"127.0.0.1:12345\")),\n \"The gateway address\");\n\n \/\/ allow master address to be specified as the first arg\n po::positional_options_description pos;\n pos.add(\"master-address\", 1);\n\n \/\/ parse and store\n po::variables_map vm;\n try\n {\n po::store(po::command_line_parser(argc, argv).\n options(desc).positional(pos).run(), vm);\n po::notify(vm);\n\n if (vm.count(\"help\"))\n {\n std::cout << desc << \"\\n\";\n return 0;\n }\n\n if (vm.count(\"master-address\") == 1 &&\n vm.count(\"gateway-address\") == 1)\n {\n std::string masteraddr = vm[\"master-address\"].as<std::string>();\n call(masteraddr);\n\n std::string gatewayaddr = vm[\"gateway-address\"].as<std::string>();\n call(gatewayaddr);\n }\n else\n {\n std::cout << desc << \"\\n\";\n }\n } catch (const boost::program_options::error&) {\n std::cout << desc << \"\\n\";\n }\n\n return 0;\n}\n<commit_msg>Remove useless call to setName from client side.<commit_after>\/*\n** Author(s):\n** - Cedric GESTES <gestes@aldebaran-robotics.com>\n**\n** Copyright (C) 2010, 2012 Aldebaran Robotics\n*\/\n\n#include <iostream>\n#include <string>\n#include <map>\n\n#include <qi\/os.hpp>\n#include <qimessaging\/session.hpp>\n#include <qimessaging\/transport.hpp>\n#include <qimessaging\/object.hpp>\n\n#include <boost\/program_options.hpp>\n\nnamespace po = boost::program_options;\n\nstatic int uniqueReqId = 200;\n\nvoid call(const std::string &addr)\n{\n qi::Session session;\n session.connect(addr);\n session.waitForConnected();\n\n std::vector<std::string> servs = session.services();\n for (int i = 0; i < servs.size(); ++i)\n std::cout << \"service named \" << servs[i] << std::endl;\n\n\n qi::Object *obj = session.service(\"serviceTest\");\n\n if (obj == 0)\n {\n std::cerr << \"obj == 0\" << std::endl;\n return;\n }\n\n std::string result = obj->call<std::string>(\"reply\", \"plaf\");\n\n std::cout << \"answer:\" << result << std::endl;\n\n qi::os::sleep(2);\n\n session.disconnect();\n}\n\n\nint main(int argc, char *argv[])\n{\n \/\/ declare the program options\n po::options_description desc(\"Usage:\\n qi masterAddress [options]\\nOptions\");\n desc.add_options()\n (\"help\", \"Print this help.\")\n (\"master-address\",\n po::value<std::string>()->default_value(std::string(\"127.0.0.1:5555\")),\n \"The master address\")\n (\"gateway-address\",\n po::value<std::string>()->default_value(std::string(\"127.0.0.1:12345\")),\n \"The gateway address\");\n\n \/\/ allow master address to be specified as the first arg\n po::positional_options_description pos;\n pos.add(\"master-address\", 1);\n\n \/\/ parse and store\n po::variables_map vm;\n try\n {\n po::store(po::command_line_parser(argc, argv).\n options(desc).positional(pos).run(), vm);\n po::notify(vm);\n\n if (vm.count(\"help\"))\n {\n std::cout << desc << \"\\n\";\n return 0;\n }\n\n if (vm.count(\"master-address\") == 1 &&\n vm.count(\"gateway-address\") == 1)\n {\n std::string masteraddr = vm[\"master-address\"].as<std::string>();\n call(masteraddr);\n\n std::string gatewayaddr = vm[\"gateway-address\"].as<std::string>();\n call(gatewayaddr);\n }\n else\n {\n std::cout << desc << \"\\n\";\n }\n } catch (const boost::program_options::error&) {\n std::cout << desc << \"\\n\";\n }\n\n return 0;\n}\n<|endoftext|>"} {"text":"<commit_before>\/\/ Copyright 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 \"version.h\"\n\n#include <stdlib.h>\n\n#include \"util.h\"\n\nconst char* kNinjaVersion = \"1.7.0.git\";\n\nvoid ParseVersion(const string& version, int* major, int* minor) {\n size_t end = version.find('.');\n *major = atoi(version.substr(0, end).c_str());\n *minor = 0;\n if (end != string::npos) {\n size_t start = end + 1;\n end = version.find('.', start);\n *minor = atoi(version.substr(start, end).c_str());\n }\n}\n\nvoid CheckNinjaVersion(const string& version) {\n int bin_major, bin_minor;\n ParseVersion(kNinjaVersion, &bin_major, &bin_minor);\n int file_major, file_minor;\n ParseVersion(version, &file_major, &file_minor);\n\n if (bin_major > file_major) {\n Warning(\"ninja executable version (%s) greater than build file \"\n \"ninja_required_version (%s); versions may be incompatible.\",\n kNinjaVersion, version.c_str());\n return;\n }\n\n if ((bin_major == file_major && bin_minor < file_minor) ||\n bin_major < file_major) {\n Fatal(\"ninja version (%s) incompatible with build file \"\n \"ninja_required_version version (%s).\",\n kNinjaVersion, version.c_str());\n }\n}\n<commit_msg>mark this 1.7.1.git<commit_after>\/\/ Copyright 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 \"version.h\"\n\n#include <stdlib.h>\n\n#include \"util.h\"\n\nconst char* kNinjaVersion = \"1.7.1.git\";\n\nvoid ParseVersion(const string& version, int* major, int* minor) {\n size_t end = version.find('.');\n *major = atoi(version.substr(0, end).c_str());\n *minor = 0;\n if (end != string::npos) {\n size_t start = end + 1;\n end = version.find('.', start);\n *minor = atoi(version.substr(start, end).c_str());\n }\n}\n\nvoid CheckNinjaVersion(const string& version) {\n int bin_major, bin_minor;\n ParseVersion(kNinjaVersion, &bin_major, &bin_minor);\n int file_major, file_minor;\n ParseVersion(version, &file_major, &file_minor);\n\n if (bin_major > file_major) {\n Warning(\"ninja executable version (%s) greater than build file \"\n \"ninja_required_version (%s); versions may be incompatible.\",\n kNinjaVersion, version.c_str());\n return;\n }\n\n if ((bin_major == file_major && bin_minor < file_minor) ||\n bin_major < file_major) {\n Fatal(\"ninja version (%s) incompatible with build file \"\n \"ninja_required_version version (%s).\",\n kNinjaVersion, version.c_str());\n }\n}\n<|endoftext|>"} {"text":"<commit_before>\/*******************************************************************\/\/*\n * Several useful utility functions wrapped in a namespace\n *\n * @author Brandon To\n * @version 1.0\n * @since 2015-02-18\n * @modified 2015-02-18\n *********************************************************************\/\n#include \"Util.h\"\n\n#include <cstdio>\n#include <libgen.h>\n\n#ifdef _WIN32\n #include <windows.h>\n#endif\n\n#ifdef linux\n #include <unistd.h>\n#endif\n\nnamespace Util\n{\n std::string fix_path(std::string path)\n {\n#ifdef _WIN32\n \/\/ Creates a path to the binary location\n char buf[256];\n GetModuleFileName(NULL, buf, sizeof(buf)-1);\n std::string binaryLocation = dirname(buf);\n return binaryLocation + \"\/..\/\" + path;\n#endif\n\n#ifdef linux\n \/\/ Creates a path to the binary location\n char buf[256];\n readlink(\"\/proc\/self\/exe\", buf, sizeof(buf)-1);\n std::string binaryLocation = dirname(buf);\n return binaryLocation + \"\/\" + path;\n#endif\n }\n}\n<commit_msg>Fixed compilation of Util.cpp in Visual Studio<commit_after>\/*******************************************************************\/\/*\n * Several useful utility functions wrapped in a namespace\n *\n * @author Brandon To\n * @version 1.0\n * @since 2015-02-18\n * @modified 2015-02-18\n *********************************************************************\/\n#include \"Util.h\"\n\n#include <cstdio>\n\n\n#ifdef _WIN32\n #include <windows.h>\n#endif\n\n#ifdef linux\n #include <unistd.h>\n #include <libgen.h>\n#endif\n\n#ifdef _WIN32\nstd::string dirname(const std::string& fname)\n{\n size_t pos = fname.find_last_of(\"\\\\\/\");\n return (std::string::npos == pos)\n ? \"\"\n : fname.substr(0, pos);\n}\n#endif\n\nnamespace Util\n{\n std::string fix_path(std::string path)\n {\n#ifdef _WIN32\n \/\/ Creates a path to the binary location\n char buf[256];\n GetModuleFileName(NULL, buf, sizeof(buf)-1);\n std::string binaryLocation = dirname(buf);\n return binaryLocation + \"\/..\/\" + path;\n#endif\n\n#ifdef linux\n \/\/ Creates a path to the binary location\n char buf[256];\n readlink(\"\/proc\/self\/exe\", buf, sizeof(buf)-1);\n std::string binaryLocation = dirname(buf);\n return binaryLocation + \"\/\" + path;\n#endif\n }\n}\n<|endoftext|>"} {"text":"<commit_before>\/* \n * TTBlue Global Object\n * Copyright © 2008, Timothy Place\n * \n * License: This code is licensed under the terms of the GNU LGPL\n * http:\/\/www.gnu.org\/licenses\/lgpl.html \n *\/\n\n#include \"TTFoundation.h\"\n#include \"TTEnvironment.h\"\n#include \"TTClass.h\"\n\n#define thisTTClass TTEnvironment\n\n\n\/\/ The environment object has one instance, which is global in scope.\nTTEnvironment*\tttEnvironment = NULL;\n\n\n\/****************************************************************************************************\/\n\nTTEnvironment::TTEnvironment()\n\t: TTObject(*kTTValNONE), debugBasic(false), debugMessaging(false), sr(0)\n{\t\n\tclasses = new TTHash();\n\ttags = new TTHash();\n\n\tregisterAttributeSimple(debugBasic,\t\tkTypeBoolean);\n\tregisterAttributeSimple(debugMessaging,\tkTypeBoolean);\n\tregisterAttributeSimple(sr,\t\t\t\tkTypeUInt32);\n\n\tregisterMessageWithArgument(getVersion);\n\n\tsetAttributeValue(TT(\"sr\"), TTUInt32(44100));\n}\n\n\nTTEnvironment::~TTEnvironment()\n{\n\t\/\/ If on Windows, we need to call FreeLibrary() on all plug-ins loaded with LoadLibrary()\n\t\/\/ On the Mac, we may need to do the equivalent\n\n\tdelete tags;\n\tdelete classes;\n}\n\n\nTTErr TTEnvironment::getVersion(TTValue &value)\n{\n\tvalue = TTFOUNDATION_VERSION_STRING;\n\treturn kTTErrNone;\n}\n\n\nTTErr TTEnvironment::registerClass(const TTSymbolPtr className, const TTString& tagString, const TTObjectInstantiationMethod anInstantiationMethod)\n{\n\tTTValue\t\tv((TTString&)tagString);\t\/\/ The tags to be associated with the class we are registering.\n\tTTValue\t\ttagObjects;\t\t\t\t\t\/\/ Contains a TTList of objects in the environment with the given tag.\n\tTTClassPtr\ttheClass;\n\tTTErr\t\terr;\n\tTTList*\t\tclassNamesForTag;\t\t\t\/\/ The TTList contained by tagObjects\n\tTTUInt16\tsize;\n\tTTSymbolPtr\ttag;\t\n\n\t\/\/ 1. Turn the string into an array of symbols\n\tv.transformCSVStringToSymbolArray();\n\t\n\t\/\/ 2. Create the class and associate it with its name\n\ttheClass = new TTClass(className, v, anInstantiationMethod);\n\t\n\t\/\/ 3. For each symbol in the TTValue array...\n\tsize = v.getSize();\n\tfor(TTUInt16 i=0; i<size; i++){\n\t\tv.get(i, &tag);\n\t\t\n\t\t\/\/ 4. Look to see if this tag exists yet\n\t\terr = tags->lookup(tag, tagObjects);\n\t\tif(!err){\n\t\t\tclassNamesForTag = (TTList*)(TTPtr(tagObjects));\n\t\t\t\n\t\t\t\/\/ TODO: The following code demonstrates so extreme lameness that we need to evaluate.\n\t\t\t\/\/\tFirst, we should probably just do this section of code with TTValue instead of TTList (but we needed code to test TTList)\n\t\t\t\/\/\tSecond, TTList is taking references but keeping things internally as pointers, which leads to lots of confusion\n\t\t\t\/\/\tThird, we have to pass objects that are permanent - so no temporaries are allowed unless we make TTList do a copy\n\t\t\t\/\/\tetc.\n\n\t\t\t\/\/ TODO: We need to factor out a function to add a tag for a named class (or a given class ptr)\n\t\t\t\n\t\t\t\/\/classNamesForTag->append(className);\n\t\t\tclassNamesForTag->append(*new TTValue(className));\n\t\t}\n\t\telse{\n\t\t\tclassNamesForTag = new TTList;\n\t\t\ttagObjects = TTPtr(classNamesForTag);\n\t\t\ttags->append(tag ,tagObjects);\n\t\t\tclassNamesForTag->append(*new TTValue(className));\n\t\t}\n\t}\t\n\t\n\t\/\/ 4. Register it\n\treturn registerClass(theClass);\n}\n\n\nTTErr TTEnvironment::registerClass(TTClassPtr theClass)\n{\n\treturn classes->append(theClass->name, TTPtr(theClass));\n}\n\n\nTTErr TTEnvironment::getAllClassNames(TTValue& returnedClassNames)\n{\n\treturn classes->getKeys(returnedClassNames);\n}\n\n\nTTErr TTEnvironment::getClassNamesWithTags(TTValue& classNames, const TTValue& searchTags)\n{\n\t\/\/ TODO: right now we only look for the first tag, we should look for each and then do a union on the results.\n\t\/\/ Well, that's not what's really happening, but the point is that this really only works if we are searching for one tag.\n\t\n\tTTUInt16\tsize = searchTags.getSize();\n\tTTSymbolPtr\ttag;\n\tTTValue\t\ttagObjects;\n\tTTErr\t\terr = kTTErrGeneric;\n\tTTList*\t\tclassNamesForTag;\n\t\n\tfor(TTUInt16 i=0; i<size; i++){\n\t\tsearchTags.get(i, &tag);\n\t\t\n\t\terr = tags->lookup(tag, tagObjects);\n\t\tif(!err){\n\t\t\tclassNamesForTag = (TTList*)(TTPtr(tagObjects));\n\t\t\tclassNamesForTag->assignToValue(classNames);\n\t\t}\n\t}\n\n\treturn err;\n}\n\n\nTTErr TTEnvironment::createInstance(const TTSymbolPtr className, TTObjectPtr* anObject, const TTValue& anArgument)\n{\n\treturn createInstance(className, anObject, (TTValue&)anArgument); \/\/ throw away the const (I know, I know...), maybe the non-const constructor shouldn't exist at all?\n}\n\nTTErr TTEnvironment::createInstance(const TTSymbolPtr className, TTObjectPtr* anObject, TTValue& anArgument)\n{\n\tTTValue\t\tv;\n\tTTClassPtr\ttheClass;\n\tTTErr\t\terr;\n\tTTObjectPtr\tnewObject = NULL;\n\tTTObjectPtr\toldObject = NULL;\n\n\terr = classes->lookup(className, v);\n\tif(!err){\n\t\ttheClass = TTClassPtr(TTPtr(v));\n\t\tif(theClass)\n\t\t\terr = theClass->createInstance(&newObject, anArgument);\n\t\telse\n\t\t\terr = kTTErrGeneric;\n\t}\n\t\n\tif(!err && newObject){\n\t\tif(*anObject)\n\t\t\toldObject = *anObject;\n\t\t*anObject = newObject;\n\t\tif(oldObject)\n\t\t\treleaseInstance(&oldObject);\n\n\t\t(*anObject)->classPtr = theClass;\n\t\t(*anObject)->valid = true;\n\t}\n\t\t\n\t\/\/TODO: Add instance tracking. For each instance of a class, we push the instance onto a linked list of instances for that class\n\t\/\/ When the object is freed using deleteInstance(), then we pop it.\n\t\/\/ What would this achieve?\n\t\/\/\t- we could check statistics on them or do other logging\n\t\/\/\t- we could access instances remotely, and perhaps then manipulate them remotely in a shared manner\n\t\/\/\t- if an object is referenced by another object, and thus shared, then we need to reference counting here before freeing.\n\t\/\/ THEREFORE: we should have an addReference() and release() method (instead of a deleteInstance() method).\n\t\/\/\t- the reference counting itself should probably be done inside of TTObject though, yes?\n\treturn err;\n}\n\nTTObjectPtr TTEnvironment::referenceInstance(TTObjectPtr anObject)\n{\n\t\/\/ TODO: make sure that anObject is valid or wrap with an exception?\n\tanObject->referenceCount++;\n\treturn anObject;\n}\n\nTTErr TTEnvironment::releaseInstance(TTObjectPtr* anObject)\n{\n\tTTValue v = **anObject;\n\t\n\t(*anObject)->valid = false;\n\t(*anObject)->observers->iterateObjectsSendingMessage(TT(\"objectFreeing\"), v);\n\t\n\t\/\/ If the object is locked (e.g. in the middle of processing a vector in another thread) \n\t\/\/\tthen we spin until the lock is released\n\t\/\/\tTODO: we should also be able to time-out in the event that we have a dead lock.\n\twhile((*anObject)->getlock())\n\t\t;\n\n\t(*anObject)->referenceCount--;\n\tif((*anObject)->referenceCount < 1){\n\t\tdelete *anObject;\n\t\t*anObject = NULL;\n\t}\n\treturn kTTErrNone;\n}\n\n\n#if 0\n#pragma mark -\n#pragma mark Public Interface\n#endif\n\nTTErr TTObjectInstantiate(const TTSymbolPtr className, TTObjectPtr* returnedObjectPtr, TTValue& arguments)\n{\n\treturn ttEnvironment->createInstance(className, returnedObjectPtr, arguments);\n}\n\n\nTTErr TTObjectInstantiate(const TTSymbolPtr className, TTObjectPtr* returnedObjectPtr, const TTValue& arguments)\n{\n\treturn ttEnvironment->createInstance(className, returnedObjectPtr, arguments);\n}\n\n\nTTErr TTObjectInstantiate(const TTSymbolPtr className, TTObjectPtr* returnedObjectPtr, const TTUInt16 arguments)\n{\n\tTTValue\tv(arguments);\n\treturn ttEnvironment->createInstance(className, returnedObjectPtr, v);\n}\n\n\nTTObjectPtr TTObjectReference(TTObjectPtr anObject)\n{\n\treturn ttEnvironment->referenceInstance(anObject);\n}\n\n\nTTErr TTObjectRelease(TTObjectPtr* anObject)\n{\n\tif(*anObject)\n\t\treturn ttEnvironment->releaseInstance(anObject);\n\telse\n\t\treturn kTTErrNone;\n}\n\n\nTTErr TTClassRegister(const TTSymbolPtr className, const TTString& tagString, const TTObjectInstantiationMethod anInstantiationMethod)\n{\n\treturn ttEnvironment->registerClass(className, tagString, anInstantiationMethod);\n}\n\nTTErr TTClassRegister(const TTSymbolPtr className, TTImmutableCString tagString, const TTObjectInstantiationMethod anInstantiationMethod)\n{\n\treturn ttEnvironment->registerClass(className, TTString(tagString), anInstantiationMethod);\n}\n\n\nTTErr TTGetRegisteredClassNames(TTValue& classNames)\n{\n\treturn ttEnvironment->getAllClassNames(classNames);\n}\n\n\nTTErr TTGetRegisteredClassNamesForTags(TTValue& classNames, const TTValue& searchTags)\n{\n\treturn ttEnvironment->getClassNamesWithTags(classNames, searchTags);\n}\n\n\n<commit_msg>TTEnvironment::registerClass: now checks for an existing class of the same name before registering a new class with that name.<commit_after>\/* \n * TTBlue Global Object\n * Copyright © 2008, Timothy Place\n * \n * License: This code is licensed under the terms of the GNU LGPL\n * http:\/\/www.gnu.org\/licenses\/lgpl.html \n *\/\n\n#include \"TTFoundation.h\"\n#include \"TTEnvironment.h\"\n#include \"TTClass.h\"\n\n#define thisTTClass TTEnvironment\n\n\n\/\/ The environment object has one instance, which is global in scope.\nTTEnvironment*\tttEnvironment = NULL;\n\n\n\/****************************************************************************************************\/\n\nTTEnvironment::TTEnvironment()\n\t: TTObject(*kTTValNONE), debugBasic(false), debugMessaging(false), sr(0)\n{\t\n\tclasses = new TTHash();\n\ttags = new TTHash();\n\n\tregisterAttributeSimple(debugBasic,\t\tkTypeBoolean);\n\tregisterAttributeSimple(debugMessaging,\tkTypeBoolean);\n\tregisterAttributeSimple(sr,\t\t\t\tkTypeUInt32);\n\n\tregisterMessageWithArgument(getVersion);\n\n\tsetAttributeValue(TT(\"sr\"), TTUInt32(44100));\n}\n\n\nTTEnvironment::~TTEnvironment()\n{\n\t\/\/ If on Windows, we need to call FreeLibrary() on all plug-ins loaded with LoadLibrary()\n\t\/\/ On the Mac, we may need to do the equivalent\n\n\tdelete tags;\n\tdelete classes;\n}\n\n\nTTErr TTEnvironment::getVersion(TTValue &value)\n{\n\tvalue = TTFOUNDATION_VERSION_STRING;\n\treturn kTTErrNone;\n}\n\n\nTTErr TTEnvironment::registerClass(const TTSymbolPtr className, const TTString& tagString, const TTObjectInstantiationMethod anInstantiationMethod)\n{\n\tTTValue\t\tv((TTString&)tagString);\t\/\/ The tags to be associated with the class we are registering.\n\tTTValue\t\ttagObjects;\t\t\t\t\t\/\/ Contains a TTList of objects in the environment with the given tag.\n\tTTClassPtr\ttheClass;\n\tTTErr\t\terr;\n\tTTList*\t\tclassNamesForTag;\t\t\t\/\/ The TTList contained by tagObjects\n\tTTUInt16\tsize;\n\tTTSymbolPtr\ttag;\n\tTTValue\t\tresult;\n\n\terr = classes->lookup(className, result);\n\t\n\t\/\/ If a class is already registered with this name, then we do not want to register another class with the same name!\n\tif (err == kTTErrValueNotFound) {\n\t\t\n\t\t\/\/ 1. Turn the string into an array of symbols\n\t\tv.transformCSVStringToSymbolArray();\n\t\t\n\t\t\/\/ 2. Create the class and associate it with its name\n\t\ttheClass = new TTClass(className, v, anInstantiationMethod);\n\t\t\n\t\t\/\/ 3. For each symbol in the TTValue array...\n\t\tsize = v.getSize();\n\t\tfor (TTUInt16 i=0; i<size; i++) {\n\t\t\tv.get(i, &tag);\n\t\t\t\n\t\t\t\/\/ 4. Look to see if this tag exists yet\n\t\t\terr = tags->lookup(tag, tagObjects);\n\t\t\tif (!err) {\n\t\t\t\tclassNamesForTag = (TTList*)(TTPtr(tagObjects));\n\t\t\t\t\n\t\t\t\t\/\/ TODO: The following code demonstrates so extreme lameness that we need to evaluate.\n\t\t\t\t\/\/\tFirst, we should probably just do this section of code with TTValue instead of TTList (but we needed code to test TTList)\n\t\t\t\t\/\/\tSecond, TTList is taking references but keeping things internally as pointers, which leads to lots of confusion\n\t\t\t\t\/\/\tThird, we have to pass objects that are permanent - so no temporaries are allowed unless we make TTList do a copy\n\t\t\t\t\/\/\tetc.\n\n\t\t\t\t\/\/ TODO: We need to factor out a function to add a tag for a named class (or a given class ptr)\n\t\t\t\t\n\t\t\t\t\/\/classNamesForTag->append(className);\n\t\t\t\tclassNamesForTag->append(*new TTValue(className));\n\t\t\t}\n\t\t\telse {\n\t\t\t\tclassNamesForTag = new TTList;\n\t\t\t\ttagObjects = TTPtr(classNamesForTag);\n\t\t\t\ttags->append(tag ,tagObjects);\n\t\t\t\tclassNamesForTag->append(*new TTValue(className));\n\t\t\t}\n\t\t}\t\n\t\t\n\t\t\/\/ 4. Register it\n\t\terr = registerClass(theClass);\n\t}\n\treturn err;\n}\n\n\nTTErr TTEnvironment::registerClass(TTClassPtr theClass)\n{\n\treturn classes->append(theClass->name, TTPtr(theClass));\n}\n\n\nTTErr TTEnvironment::getAllClassNames(TTValue& returnedClassNames)\n{\n\treturn classes->getKeys(returnedClassNames);\n}\n\n\nTTErr TTEnvironment::getClassNamesWithTags(TTValue& classNames, const TTValue& searchTags)\n{\n\t\/\/ TODO: right now we only look for the first tag, we should look for each and then do a union on the results.\n\t\/\/ Well, that's not what's really happening, but the point is that this really only works if we are searching for one tag.\n\t\n\tTTUInt16\tsize = searchTags.getSize();\n\tTTSymbolPtr\ttag;\n\tTTValue\t\ttagObjects;\n\tTTErr\t\terr = kTTErrGeneric;\n\tTTList*\t\tclassNamesForTag;\n\t\n\tfor(TTUInt16 i=0; i<size; i++){\n\t\tsearchTags.get(i, &tag);\n\t\t\n\t\terr = tags->lookup(tag, tagObjects);\n\t\tif(!err){\n\t\t\tclassNamesForTag = (TTList*)(TTPtr(tagObjects));\n\t\t\tclassNamesForTag->assignToValue(classNames);\n\t\t}\n\t}\n\n\treturn err;\n}\n\n\nTTErr TTEnvironment::createInstance(const TTSymbolPtr className, TTObjectPtr* anObject, const TTValue& anArgument)\n{\n\treturn createInstance(className, anObject, (TTValue&)anArgument); \/\/ throw away the const (I know, I know...), maybe the non-const constructor shouldn't exist at all?\n}\n\nTTErr TTEnvironment::createInstance(const TTSymbolPtr className, TTObjectPtr* anObject, TTValue& anArgument)\n{\n\tTTValue\t\tv;\n\tTTClassPtr\ttheClass;\n\tTTErr\t\terr;\n\tTTObjectPtr\tnewObject = NULL;\n\tTTObjectPtr\toldObject = NULL;\n\n\terr = classes->lookup(className, v);\n\tif(!err){\n\t\ttheClass = TTClassPtr(TTPtr(v));\n\t\tif(theClass)\n\t\t\terr = theClass->createInstance(&newObject, anArgument);\n\t\telse\n\t\t\terr = kTTErrGeneric;\n\t}\n\t\n\tif(!err && newObject){\n\t\tif(*anObject)\n\t\t\toldObject = *anObject;\n\t\t*anObject = newObject;\n\t\tif(oldObject)\n\t\t\treleaseInstance(&oldObject);\n\n\t\t(*anObject)->classPtr = theClass;\n\t\t(*anObject)->valid = true;\n\t}\n\t\t\n\t\/\/TODO: Add instance tracking. For each instance of a class, we push the instance onto a linked list of instances for that class\n\t\/\/ When the object is freed using deleteInstance(), then we pop it.\n\t\/\/ What would this achieve?\n\t\/\/\t- we could check statistics on them or do other logging\n\t\/\/\t- we could access instances remotely, and perhaps then manipulate them remotely in a shared manner\n\t\/\/\t- if an object is referenced by another object, and thus shared, then we need to reference counting here before freeing.\n\t\/\/ THEREFORE: we should have an addReference() and release() method (instead of a deleteInstance() method).\n\t\/\/\t- the reference counting itself should probably be done inside of TTObject though, yes?\n\treturn err;\n}\n\nTTObjectPtr TTEnvironment::referenceInstance(TTObjectPtr anObject)\n{\n\t\/\/ TODO: make sure that anObject is valid or wrap with an exception?\n\tanObject->referenceCount++;\n\treturn anObject;\n}\n\nTTErr TTEnvironment::releaseInstance(TTObjectPtr* anObject)\n{\n\tTTValue v = **anObject;\n\t\n\t(*anObject)->valid = false;\n\t(*anObject)->observers->iterateObjectsSendingMessage(TT(\"objectFreeing\"), v);\n\t\n\t\/\/ If the object is locked (e.g. in the middle of processing a vector in another thread) \n\t\/\/\tthen we spin until the lock is released\n\t\/\/\tTODO: we should also be able to time-out in the event that we have a dead lock.\n\twhile((*anObject)->getlock())\n\t\t;\n\n\t(*anObject)->referenceCount--;\n\tif((*anObject)->referenceCount < 1){\n\t\tdelete *anObject;\n\t\t*anObject = NULL;\n\t}\n\treturn kTTErrNone;\n}\n\n\n#if 0\n#pragma mark -\n#pragma mark Public Interface\n#endif\n\nTTErr TTObjectInstantiate(const TTSymbolPtr className, TTObjectPtr* returnedObjectPtr, TTValue& arguments)\n{\n\treturn ttEnvironment->createInstance(className, returnedObjectPtr, arguments);\n}\n\n\nTTErr TTObjectInstantiate(const TTSymbolPtr className, TTObjectPtr* returnedObjectPtr, const TTValue& arguments)\n{\n\treturn ttEnvironment->createInstance(className, returnedObjectPtr, arguments);\n}\n\n\nTTErr TTObjectInstantiate(const TTSymbolPtr className, TTObjectPtr* returnedObjectPtr, const TTUInt16 arguments)\n{\n\tTTValue\tv(arguments);\n\treturn ttEnvironment->createInstance(className, returnedObjectPtr, v);\n}\n\n\nTTObjectPtr TTObjectReference(TTObjectPtr anObject)\n{\n\treturn ttEnvironment->referenceInstance(anObject);\n}\n\n\nTTErr TTObjectRelease(TTObjectPtr* anObject)\n{\n\tif(*anObject)\n\t\treturn ttEnvironment->releaseInstance(anObject);\n\telse\n\t\treturn kTTErrNone;\n}\n\n\nTTErr TTClassRegister(const TTSymbolPtr className, const TTString& tagString, const TTObjectInstantiationMethod anInstantiationMethod)\n{\n\treturn ttEnvironment->registerClass(className, tagString, anInstantiationMethod);\n}\n\nTTErr TTClassRegister(const TTSymbolPtr className, TTImmutableCString tagString, const TTObjectInstantiationMethod anInstantiationMethod)\n{\n\treturn ttEnvironment->registerClass(className, TTString(tagString), anInstantiationMethod);\n}\n\n\nTTErr TTGetRegisteredClassNames(TTValue& classNames)\n{\n\treturn ttEnvironment->getAllClassNames(classNames);\n}\n\n\nTTErr TTGetRegisteredClassNamesForTags(TTValue& classNames, const TTValue& searchTags)\n{\n\treturn ttEnvironment->getClassNamesWithTags(classNames, searchTags);\n}\n\n\n<|endoftext|>"} {"text":"<commit_before>#ifndef ITER_FILTER_H_\n#define ITER_FILTER_H_\n\n#include \"iterbase.hpp\"\n\n#include <utility>\n#include <iterator>\n#include <initializer_list>\n\nnamespace iter {\n\n \/\/Forward declarations of Filter and filter\n template <typename FilterFunc, typename Container>\n class Filter;\n\n template <typename FilterFunc, typename Container>\n Filter<FilterFunc, Container> filter(FilterFunc, Container&&);\n\n template <typename FilterFunc, typename T>\n Filter<FilterFunc, std::initializer_list<T>> filter(\n FilterFunc, std::initializer_list<T>);\n\n template <typename FilterFunc, typename Container>\n class Filter {\n private:\n Container container;\n FilterFunc filter_func;\n\n \/\/ The filter function is the only thing allowed to create a Filter\n friend Filter filter<FilterFunc, Container>(\n FilterFunc, Container&&);\n\n template <typename FF, typename T>\n friend Filter<FF, std::initializer_list<T>> filter(\n FF, std::initializer_list<T>);\n \n \/\/ Value constructor for use only in the filter function\n Filter(FilterFunc filter_func, Container container)\n : container(std::forward<Container>(container)),\n filter_func(filter_func)\n { }\n Filter() = delete;\n Filter& operator=(const Filter&) = delete;\n\n public:\n Filter(const Filter&) = default;\n\n class Iterator \n : public std::iterator<std::input_iterator_tag,\n iterator_traits_deref<Container>>\n {\n protected:\n iterator_type<Container> sub_iter;\n const iterator_type<Container> sub_end;\n FilterFunc filter_func;\n\n \/\/ increment until the iterator points to is true on the \n \/\/ predicate. Called by constructor and operator++\n void skip_failures() { \n while (this->sub_iter != this->sub_end\n && !this->filter_func(*this->sub_iter)) {\n ++this->sub_iter;\n }\n }\n\n public:\n Iterator (iterator_type<Container> iter,\n iterator_type<Container> end,\n FilterFunc filter_func)\n : sub_iter{iter},\n sub_end{end},\n filter_func(filter_func)\n { \n this->skip_failures();\n } \n\n iterator_deref<Container> operator*() {\n return *this->sub_iter;\n }\n\n Iterator& operator++() { \n ++this->sub_iter;\n this->skip_failures();\n return *this;\n }\n\n bool operator!=(const Iterator& other) const {\n return this->sub_iter != other.sub_iter;\n }\n };\n\n Iterator begin() {\n return {std::begin(this->container),\n std::end(this->container),\n this->filter_func};\n }\n\n Iterator end() {\n return {std::end(this->container),\n std::end(this->container),\n this->filter_func};\n }\n\n };\n\n \/\/ Helper function to instantiate a Filter\n template <typename FilterFunc, typename Container>\n Filter<FilterFunc, Container> filter(\n FilterFunc filter_func, Container&& container) {\n return {filter_func, std::forward<Container>(container)};\n }\n\n template <typename FilterFunc, typename T>\n Filter<FilterFunc, std::initializer_list<T>> filter(\n FilterFunc filter_func,\n std::initializer_list<T> il)\n {\n return {filter_func, std::move(il)};\n }\n\n namespace detail {\n\n template <typename T>\n bool boolean_cast(const T& t) {\n return bool(t);\n }\n\n template <typename Container>\n class BoolTester {\n public:\n bool operator() (const iterator_deref<Container> item) const {\n return bool(item);\n }\n };\n }\n\n\n template <typename Container>\n auto filter(Container&& container) ->\n decltype(filter(\n detail::BoolTester<Container>(),\n std::forward<Container>(container))) {\n return filter(\n detail::BoolTester<Container>(),\n std::forward<Container>(container));\n }\n\n template <typename T>\n auto filter(std::initializer_list<T> il) ->\n decltype(filter(\n detail::BoolTester<std::initializer_list<T>>(),\n std::move(il))) {\n return filter(\n detail::BoolTester<std::initializer_list<T>>(),\n std::move(il));\n }\n\n}\n\n#endif \/\/ #ifndef ITER_FILTER_H_\n<commit_msg>adds filter iter postfix ++<commit_after>#ifndef ITER_FILTER_H_\n#define ITER_FILTER_H_\n\n#include \"iterbase.hpp\"\n\n#include <utility>\n#include <iterator>\n#include <initializer_list>\n\nnamespace iter {\n\n \/\/Forward declarations of Filter and filter\n template <typename FilterFunc, typename Container>\n class Filter;\n\n template <typename FilterFunc, typename Container>\n Filter<FilterFunc, Container> filter(FilterFunc, Container&&);\n\n template <typename FilterFunc, typename T>\n Filter<FilterFunc, std::initializer_list<T>> filter(\n FilterFunc, std::initializer_list<T>);\n\n template <typename FilterFunc, typename Container>\n class Filter {\n private:\n Container container;\n FilterFunc filter_func;\n\n \/\/ The filter function is the only thing allowed to create a Filter\n friend Filter filter<FilterFunc, Container>(\n FilterFunc, Container&&);\n\n template <typename FF, typename T>\n friend Filter<FF, std::initializer_list<T>> filter(\n FF, std::initializer_list<T>);\n \n \/\/ Value constructor for use only in the filter function\n Filter(FilterFunc filter_func, Container container)\n : container(std::forward<Container>(container)),\n filter_func(filter_func)\n { }\n Filter() = delete;\n Filter& operator=(const Filter&) = delete;\n\n public:\n Filter(const Filter&) = default;\n\n class Iterator \n : public std::iterator<std::input_iterator_tag,\n iterator_traits_deref<Container>>\n {\n protected:\n iterator_type<Container> sub_iter;\n const iterator_type<Container> sub_end;\n FilterFunc filter_func;\n\n \/\/ increment until the iterator points to is true on the \n \/\/ predicate. Called by constructor and operator++\n void skip_failures() { \n while (this->sub_iter != this->sub_end\n && !this->filter_func(*this->sub_iter)) {\n ++this->sub_iter;\n }\n }\n\n public:\n Iterator (iterator_type<Container> iter,\n iterator_type<Container> end,\n FilterFunc filter_func)\n : sub_iter{iter},\n sub_end{end},\n filter_func(filter_func)\n { \n this->skip_failures();\n } \n\n iterator_deref<Container> operator*() {\n return *this->sub_iter;\n }\n\n Iterator& operator++() { \n ++this->sub_iter;\n this->skip_failures();\n return *this;\n }\n\n Iterator operator++(int) {\n auto ret = *this;\n ++*this;\n return ret;\n }\n\n bool operator!=(const Iterator& other) const {\n return this->sub_iter != other.sub_iter;\n }\n };\n\n Iterator begin() {\n return {std::begin(this->container),\n std::end(this->container),\n this->filter_func};\n }\n\n Iterator end() {\n return {std::end(this->container),\n std::end(this->container),\n this->filter_func};\n }\n\n };\n\n \/\/ Helper function to instantiate a Filter\n template <typename FilterFunc, typename Container>\n Filter<FilterFunc, Container> filter(\n FilterFunc filter_func, Container&& container) {\n return {filter_func, std::forward<Container>(container)};\n }\n\n template <typename FilterFunc, typename T>\n Filter<FilterFunc, std::initializer_list<T>> filter(\n FilterFunc filter_func,\n std::initializer_list<T> il)\n {\n return {filter_func, std::move(il)};\n }\n\n namespace detail {\n\n template <typename T>\n bool boolean_cast(const T& t) {\n return bool(t);\n }\n\n template <typename Container>\n class BoolTester {\n public:\n bool operator() (const iterator_deref<Container> item) const {\n return bool(item);\n }\n };\n }\n\n\n template <typename Container>\n auto filter(Container&& container) ->\n decltype(filter(\n detail::BoolTester<Container>(),\n std::forward<Container>(container))) {\n return filter(\n detail::BoolTester<Container>(),\n std::forward<Container>(container));\n }\n\n template <typename T>\n auto filter(std::initializer_list<T> il) ->\n decltype(filter(\n detail::BoolTester<std::initializer_list<T>>(),\n std::move(il))) {\n return filter(\n detail::BoolTester<std::initializer_list<T>>(),\n std::move(il));\n }\n\n}\n\n#endif \/\/ #ifndef ITER_FILTER_H_\n<|endoftext|>"} {"text":"<commit_before>\/* \n * Jamoma Asynchronous Object Graph Layer\n * Creates a wrapper for TTObjects that can be used to build a control graph for asynchronous message passing.\n * Copyright © 2010, Timothy Place\n * \n * License: This code is licensed under the terms of the GNU LGPL\n * http:\/\/www.gnu.org\/licenses\/lgpl.html \n *\/\n\n#include \"TTGraphObject.h\"\n#include \"TTGraphInlet.h\"\n#include \"TTGraphOutlet.h\"\n\n#define thisTTClass\t\t\tTTGraphObject\n#define thisTTClassName\t\t\"graph.object\"\n#define thisTTClassTags\t\t\"audio, multicore, wrapper\"\n\n\n\/\/\tArguments\n\/\/\t1. (required) The name of the Jamoma DSP object you want to wrap\n\/\/\t2. (optional) Number of inlets, default = 1\n\/\/\t3. (optional) Number of outlets, default = 1\n\nTT_OBJECT_CONSTRUCTOR,\n\/\/\tmFlags(kTTGraphProcessor), \n\tmKernel(NULL)\n{\n\tTTErr\t\terr = kTTErrNone;\n\tTTSymbolPtr\twrappedObjectName = NULL;\n\tTTUInt16\tinitialNumChannels = 1;\n\tTTUInt16\tnumInlets = 1;\n\tTTUInt16\tnumOutlets = 1;\n\t\n\tTT_ASSERT(graph_correct_instantiation_args, arguments.getSize() > 0);\n\t\n\targuments.get(0, &wrappedObjectName);\n\tif (arguments.getSize() > 1)\n\t\targuments.get(1, numInlets);\n\tif (arguments.getSize() > 2)\n\t\targuments.get(2, numOutlets);\n\t\n\terr = TTObjectInstantiate(wrappedObjectName, &mKernel, initialNumChannels);\n\tmDictionary = new TTDictionary;\n\t\n\tmInlets.resize(numInlets);\n\tmOutlets.resize(numOutlets);\n}\n\n\nTTGraphObject::~TTGraphObject()\n{\n\tTTObjectRelease(&mKernel);\n\tdelete mDictionary;\n}\n\n\nvoid TTGraphObject::getDescription(TTGraphDescription& desc)\n{\n\tdesc.mClassName = mKernel->getName();\n\tdesc.mInputDescriptions.clear();\n\tfor (TTGraphInletIter inlet = mInlets.begin(); inlet != mInlets.end(); inlet++)\n\t\tinlet->getDescriptions(desc.mInputDescriptions);\n}\n\n\nTTErr TTGraphObject::reset()\n{\n\tfor_each(mInlets.begin(), mInlets.end(), mem_fun_ref(&TTGraphInlet::reset));\t\t\n\tfor_each(mOutlets.begin(), mOutlets.end(), mem_fun_ref(&TTGraphOutlet::reset));\t\t\n\treturn kTTErrNone;\n}\n\n\nTTErr TTGraphObject::handshake(TTGraphObjectPtr objectWhichIsBeingConnected, TTUInt16 fromOutletNumber, TTUInt16 toInletNumber)\n{\n\tTTErr err;\n\t\n\terr = mOutlets[fromOutletNumber].connect(objectWhichIsBeingConnected, toInletNumber);\n\treturn err;\n}\n\n\nTTErr TTGraphObject::connect(TTGraphObjectPtr anObject, TTUInt16 fromOutletNumber, TTUInt16 toInletNumber)\n{\n\tTTErr err;\n\t\n\terr = mInlets[toInletNumber].connect(anObject, fromOutletNumber);\n\tanObject->handshake(this, fromOutletNumber, toInletNumber);\n\n\treturn err;\n}\n\n\nTTErr TTGraphObject::drop(TTGraphObjectPtr anObject, TTUInt16 fromOutletNumber, TTUInt16 toInletNumber)\n{\n\tTTErr err = kTTErrInvalidValue;\n\t\n\tif (toInletNumber < mInlets.size())\n\t\terr = mInlets[toInletNumber].drop(anObject, fromOutletNumber);\t\n\treturn err;\n}\n\n\nTTErr TTGraphObject::push(const TTDictionary& aDictionary)\n{\n\tTTSymbolPtr\t\tschema = aDictionary.getSchema();\n\tTTValue\t\t\tv;\n\tTTErr\t\t\terr = kTTErrMethodNotFound;\n\tTTMessagePtr\tmessage = NULL;\n\t\n\t\/\/ If an object defines a 'dictionary' message then this trumps all the others\n\terr = mKernel->findMessage(TT(\"dictionary\"), &message);\n\tif (!err && message) {\n\t\t(*mDictionary) = aDictionary;\n\t\tv.set(0, TTPtr(mDictionary));\n\t\terr = mKernel->sendMessage(TT(\"dictionary\"), v);\n\t}\n\telse if (schema == TT(\"number\")) {\n\t\taDictionary.getValue(v);\n\t\t\/\/ TODO: maybe try seeing if there is a \"number\" message first and then prefer that if it exists?\n\t\terr = mKernel->sendMessage(TT(\"calculate\"), v);\n\t\t\n\t\tmDictionary->setSchema(TT(\"number\"));\n\t\tmDictionary->setValue(v);\n\t\t\/\/ NOTE: doesn't have inlet\/outlet info at this point\n\t}\n\telse {\n\t\t\/\/ not sure what to do with other dictionary schemas yet...\n\t}\n\t\n\tfor (TTGraphOutletIter outlet = mOutlets.begin(); outlet != mOutlets.end(); outlet++)\n\t\toutlet->push(*mDictionary);\n\n\treturn err;\n}\n\n<commit_msg>lib : capitalization fixes<commit_after>\/* \n * Jamoma Asynchronous Object Graph Layer\n * Creates a wrapper for TTObjects that can be used to build a control graph for asynchronous message passing.\n * Copyright © 2010, Timothy Place\n * \n * License: This code is licensed under the terms of the GNU LGPL\n * http:\/\/www.gnu.org\/licenses\/lgpl.html \n *\/\n\n#include \"TTGraphObject.h\"\n#include \"TTGraphInlet.h\"\n#include \"TTGraphOutlet.h\"\n\n#define thisTTClass\t\t\tTTGraphObject\n#define thisTTClassName\t\t\"graph.object\"\n#define thisTTClassTags\t\t\"audio, multicore, wrapper\"\n\n\n\/\/\tArguments\n\/\/\t1. (required) The name of the Jamoma DSP object you want to wrap\n\/\/\t2. (optional) Number of inlets, default = 1\n\/\/\t3. (optional) Number of outlets, default = 1\n\nTT_OBJECT_CONSTRUCTOR,\n\/\/\tmFlags(kTTGraphProcessor), \n\tmKernel(NULL)\n{\n\tTTErr\t\terr = kTTErrNone;\n\tTTSymbolPtr\twrappedObjectName = NULL;\n\tTTUInt16\tinitialNumChannels = 1;\n\tTTUInt16\tnumInlets = 1;\n\tTTUInt16\tnumOutlets = 1;\n\t\n\tTT_ASSERT(graph_correct_instantiation_args, arguments.getSize() > 0);\n\t\n\targuments.get(0, &wrappedObjectName);\n\tif (arguments.getSize() > 1)\n\t\targuments.get(1, numInlets);\n\tif (arguments.getSize() > 2)\n\t\targuments.get(2, numOutlets);\n\t\n\terr = TTObjectInstantiate(wrappedObjectName, &mKernel, initialNumChannels);\n\tmDictionary = new TTDictionary;\n\t\n\tmInlets.resize(numInlets);\n\tmOutlets.resize(numOutlets);\n}\n\n\nTTGraphObject::~TTGraphObject()\n{\n\tTTObjectRelease(&mKernel);\n\tdelete mDictionary;\n}\n\n\nvoid TTGraphObject::getDescription(TTGraphDescription& desc)\n{\n\tdesc.mClassName = mKernel->getName();\n\tdesc.mInputDescriptions.clear();\n\tfor (TTGraphInletIter inlet = mInlets.begin(); inlet != mInlets.end(); inlet++)\n\t\tinlet->getDescriptions(desc.mInputDescriptions);\n}\n\n\nTTErr TTGraphObject::reset()\n{\n\tfor_each(mInlets.begin(), mInlets.end(), mem_fun_ref(&TTGraphInlet::reset));\t\t\n\tfor_each(mOutlets.begin(), mOutlets.end(), mem_fun_ref(&TTGraphOutlet::reset));\t\t\n\treturn kTTErrNone;\n}\n\n\nTTErr TTGraphObject::handshake(TTGraphObjectPtr objectWhichIsBeingConnected, TTUInt16 fromOutletNumber, TTUInt16 toInletNumber)\n{\n\tTTErr err;\n\t\n\terr = mOutlets[fromOutletNumber].connect(objectWhichIsBeingConnected, toInletNumber);\n\treturn err;\n}\n\n\nTTErr TTGraphObject::connect(TTGraphObjectPtr anObject, TTUInt16 fromOutletNumber, TTUInt16 toInletNumber)\n{\n\tTTErr err;\n\t\n\terr = mInlets[toInletNumber].connect(anObject, fromOutletNumber);\n\tanObject->handshake(this, fromOutletNumber, toInletNumber);\n\n\treturn err;\n}\n\n\nTTErr TTGraphObject::drop(TTGraphObjectPtr anObject, TTUInt16 fromOutletNumber, TTUInt16 toInletNumber)\n{\n\tTTErr err = kTTErrInvalidValue;\n\t\n\tif (toInletNumber < mInlets.size())\n\t\terr = mInlets[toInletNumber].drop(anObject, fromOutletNumber);\t\n\treturn err;\n}\n\n\nTTErr TTGraphObject::push(const TTDictionary& aDictionary)\n{\n\tTTSymbolPtr\t\tschema = aDictionary.getSchema();\n\tTTValue\t\t\tv;\n\tTTErr\t\t\terr = kTTErrMethodNotFound;\n\tTTMessagePtr\tmessage = NULL;\n\t\n\t\/\/ If an object defines a 'dictionary' message then this trumps all the others\n\terr = mKernel->findMessage(TT(\"dictionary\"), &message);\n\tif (!err && message) {\n\t\t(*mDictionary) = aDictionary;\n\t\tv.set(0, TTPtr(mDictionary));\n\t\terr = mKernel->sendMessage(TT(\"dictionary\"), v);\n\t}\n\telse if (schema == TT(\"number\")) {\n\t\taDictionary.getValue(v);\n\t\t\/\/ TODO: maybe try seeing if there is a \"number\" message first and then prefer that if it exists?\n\t\terr = mKernel->sendMessage(TT(\"Calculate\"), v);\n\t\t\n\t\tmDictionary->setSchema(TT(\"number\"));\n\t\tmDictionary->setValue(v);\n\t\t\/\/ NOTE: doesn't have inlet\/outlet info at this point\n\t}\n\telse {\n\t\t\/\/ not sure what to do with other dictionary schemas yet...\n\t}\n\t\n\tfor (TTGraphOutletIter outlet = mOutlets.begin(); outlet != mOutlets.end(); outlet++)\n\t\toutlet->push(*mDictionary);\n\n\treturn err;\n}\n\n<|endoftext|>"} {"text":"<commit_before>\/\/ -*- coding: us-ascii-unix -*-\n\/\/ Copyright 2012 Lukas Kemmer\n\/\/\n\/\/ Licensed under the Apache License, Version 2.0 (the \"License\"); you\n\/\/ may not use this file except in compliance with the License. You\n\/\/ may obtain a copy of the License at\n\/\/\n\/\/ http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n\/\/\n\/\/ Unless required by applicable law or agreed to in writing, software\n\/\/ distributed under the License is distributed on an \"AS IS\" BASIS,\n\/\/ WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or\n\/\/ implied. See the License for the specific language governing\n\/\/ permissions and limitations under the License.\n\n#include <fstream>\n#include <map>\n#include \"wx\/toolbar.h\"\n#include \"wx\/frame.h\"\n#include \"wx\/html\/htmlwin.h\"\n#include \"wx\/splitter.h\"\n#include \"wx\/treectrl.h\"\n#include \"app\/resource-id.hh\"\n#include \"gui\/art.hh\"\n#include \"gui\/help-frame.hh\"\n#include \"util-wx\/bind-event.hh\"\n#include \"util-wx\/convert-wx.hh\"\n#include \"util-wx\/fwd-bind.hh\"\n#include \"util-wx\/gui-util.hh\"\n#include \"util-wx\/make-event.hh\"\n#include \"util\/distinct.hh\"\n#include \"util\/optional.hh\"\n\nnamespace faint{\n\nMAKE_FAINT_COMMAND_EVENT(FAINT_CLOSE_HELP);\nMAKE_FAINT_COMMAND_EVENT(FAINT_MAXIMIZE_HELP);\nMAKE_FAINT_COMMAND_EVENT(FAINT_BACK_HELP);\nMAKE_FAINT_COMMAND_EVENT(FAINT_SCROLL_HELP_END);\nMAKE_FAINT_COMMAND_EVENT(FAINT_SCROLL_HELP_HOME);\nMAKE_FAINT_COMMAND_EVENT(FAINT_SCROLL_HELP_LINE_UP);\nMAKE_FAINT_COMMAND_EVENT(FAINT_SCROLL_HELP_LINE_DOWN);\nMAKE_FAINT_COMMAND_EVENT(FAINT_SCROLL_HELP_PAGE_DOWN);\nMAKE_FAINT_COMMAND_EVENT(FAINT_SCROLL_HELP_PAGE_UP);\n\nstatic bool send_event(wxWindow* window, int eventId){\n wxCommandEvent newEvent(eventId);\n window->GetEventHandler()->ProcessEvent(newEvent);\n return true;\n}\n\nstatic bool is_web_link(const wxHtmlLinkInfo& link){\n auto href = link.GetHref();\n return href.StartsWith(\"http:\/\/\") || href.StartsWith(\"https:\/\/\");\n}\n\nstatic bool is_help_link(const wxHtmlLinkInfo& link){\n return !is_web_link(link);\n}\n\nbool common_help_key(wxWindow* window, const wxKeyEvent& event){\n \/\/ Handle key-presses common to windows within the HelpFrame. The\n \/\/ window parameter is the window that received the event, and is used\n \/\/ for propagating new events to the frame\n if (event.GetKeyCode() == WXK_ESCAPE){\n return send_event(window, FAINT_CLOSE_HELP);\n }\n else if (event.GetKeyCode() == WXK_RETURN && event.AltDown()){\n return send_event(window, FAINT_MAXIMIZE_HELP);\n }\n else if (event.GetKeyCode() == WXK_BACK){\n return send_event(window, FAINT_BACK_HELP);\n }\n else if (event.GetKeyCode() == WXK_SPACE || event.GetKeyCode() == WXK_PAGEDOWN){\n return send_event(window, FAINT_SCROLL_HELP_PAGE_DOWN);\n }\n else if (event.GetKeyCode() == WXK_PAGEUP){\n return send_event(window, FAINT_SCROLL_HELP_PAGE_UP);\n }\n else if (event.GetKeyCode() == WXK_UP && event.ControlDown()){\n return send_event(window, FAINT_SCROLL_HELP_LINE_UP);\n }\n else if (event.GetKeyCode() == WXK_DOWN && event.ControlDown()){\n return send_event(window, FAINT_SCROLL_HELP_LINE_DOWN);\n }\n else if (event.GetKeyCode() == WXK_HOME){\n return send_event(window, FAINT_SCROLL_HELP_HOME);\n }\n else if (event.GetKeyCode() == WXK_END){\n return send_event(window, FAINT_SCROLL_HELP_END);\n }\n return false;\n}\n\nwxSplitterWindow* create_help_splitter(wxWindow* parent){\n wxSplitterWindow* splitter = new wxSplitterWindow(parent);\n\n \/\/ Prevent unsplitting\n splitter->SetMinimumPaneSize(20);\n\n \/\/ Only grow the right window when rescaling\n splitter->SetSashGravity(0.0);\n return splitter;\n}\n\nclass HelpWindow : public wxHtmlWindow{\n\/\/ The html area for the help-text. Uses the basic wxHtmlWindow to\n\/\/ avoid heavier dependencies (like wxWebView), this should be enough\n\/\/ for the help system.\npublic:\n explicit HelpWindow(wxWindow* parent)\n : wxHtmlWindow(parent,\n wxID_ANY,\n wxDefaultPosition,\n wxDefaultSize,\n wxHW_DEFAULT_STYLE | wxBORDER_THEME)\n {\n bind_fwd(this, wxEVT_KEY_DOWN,\n [this](wxKeyEvent& event){\n bool handled = common_help_key(this, event);\n if (!handled){\n event.Skip();\n }\n });\n }\n\n void FaintLineDown(){\n wxPoint pos = GetViewStart();\n Scroll(pos.x, pos.y + 1);\n }\n\n void FaintLineUp(){\n wxPoint pos = GetViewStart();\n Scroll(pos.x, pos.y - 1);\n }\n\n void FaintPageDown(){\n int steps = GetScrollPageSize(wxVERTICAL);\n wxPoint pos = GetViewStart();\n Scroll(pos.x, pos.y + steps - m_keep);\n }\n\n void FaintPageUp(){\n int steps = GetScrollPageSize(wxVERTICAL);\n wxPoint pos = GetViewStart();\n Scroll(pos.x, pos.y - steps + m_keep);\n }\n\n void FaintHome(){\n wxPoint pos = GetViewStart();\n Scroll(pos.x, 0);\n }\n\n void FaintEnd(){\n wxPoint pos = GetViewStart();\n int x, y;\n GetVirtualSize(&x, &y);\n Scroll(pos.x, y);\n }\nprivate:\n void OnLinkClicked(const wxHtmlLinkInfo& link) override{\n if (is_web_link(link)){\n \/\/ External links should open in the default browser, not the\n \/\/ help window.\n wxLaunchDefaultBrowser(link.GetHref());\n }\n else{\n wxHtmlWindow::OnLinkClicked(link);\n }\n }\n\n \/\/ (Approximate-) lines to keep from the current page while\n \/\/ scrolling a page, to make it easier to follow scrolling with pgdn, pgup\n static const int m_keep = 2;\n};\n\nclass HelpTree;\nusing page_filename = Distinct<wxString, HelpTree, 0>;\nusing page_map_t = std::map<wxTreeItemId, page_filename>;\n\nclass HelpTree : public wxTreeCtrl{\n\/\/ The tree-based table of contents for the HelpFrame.\npublic:\n HelpTree(wxWindow* parent, const wxString& contentsFile) :\n wxTreeCtrl(parent, wxID_ANY, wxDefaultPosition, wxDefaultSize,\n wxTR_DEFAULT_STYLE|wxTR_HIDE_ROOT|wxTR_NO_LINES|wxTR_TWIST_BUTTONS)\n {\n m_root = AddRoot(\"\");\n CreateFromFile(contentsFile);\n\n bind_fwd(this, wxEVT_KEY_DOWN,\n [this](wxKeyEvent& event){\n\n bool handled = common_help_key(this, event);\n if (!handled){\n event.Skip();\n }\n });\n }\n\n wxTreeItemId AddPage(const wxString& title, const page_filename& page){\n return AddChildPage(m_root, title, page);\n }\n\n wxTreeItemId AddChildPage(const wxTreeItemId& parent,\n const wxString& title,\n const page_filename& page)\n {\n wxTreeItemId id = AppendItem(parent, title);\n m_idToPage.insert(std::make_pair(id, page));\n return id;\n }\n\n page_filename GetPage(const wxTreeItemId& id){\n return m_idToPage.at(id);\n }\n\n void Next(){\n wxTreeItemId selected = GetSelection();\n if (!selected.IsOk()){\n return;\n }\n wxTreeItemId next = GetNextSibling(selected);\n if (!next.IsOk()){\n return;\n }\n SelectItem(next);\n }\n\n void Prev(){\n wxTreeItemId selected = GetSelection();\n if (!selected.IsOk()){\n return;\n }\n wxTreeItemId prev = GetPrevSibling(selected);\n if (!prev.IsOk()){\n return;\n }\n SelectItem(prev);\n }\n\n void SelectPage(const page_filename& name){\n for (const auto& mapItem : m_idToPage){\n if (mapItem.second == name){\n SelectItem(mapItem.first);\n }\n }\n }\nprivate:\n void CreateFromFile(const wxString& contentsFile){\n std::ifstream f(iostream_friendly(contentsFile));\n std::string s;\n wxTreeItemId currentParent = m_root; \/\/ Note: This is too simplistic for deeper nesting\n while (std::getline(f,s)){\n if (s.empty()){\n break;\n }\n\n size_t sep = s.find(\";\");\n assert(sep != wxString::npos);\n page_filename filename(s.substr(sep + 1));\n wxString name = s.substr(0, sep);\n bool child = name[0] == '>';\n if (child){\n name = name.substr(1);\n }\n if (child){\n AddChildPage(currentParent, name, filename);\n }\n else {\n currentParent = AddPage(name, filename);\n }\n }\n }\n\n page_map_t m_idToPage;\n wxTreeItemId m_root;\n};\n\nconst int help_toolbar_back=0;\nconst int help_toolbar_forward=1;\n\nstatic page_filename parse_page_filename(const wxString& str){\n size_t pos = str.rfind(\"\/\");\n if (pos == wxString::npos){\n pos = str.rfind(\"\\\\\");\n }\n if (pos == wxString::npos){\n return page_filename(\"\");\n }\n return page_filename(str.substr(pos + 1));\n}\n\nstatic page_filename link_to_filename(const wxString& str){\n size_t pos = str.rfind(\"#\");\n if (pos == wxString::npos){\n return page_filename(wxString(str));\n }\n return page_filename(str.substr(0, pos));\n}\n\nclass HelpFrame::HelpFrameImpl : public wxFrame {\npublic:\n HelpFrameImpl(const wxString& rootDir, const Art& art)\n : wxFrame(null_parent(), wxID_ANY, \"Faint Help\"),\n m_html(nullptr),\n m_tree(nullptr),\n m_rootDir(rootDir),\n m_initialized(false),\n m_updateOnTree(true)\n {\n SetInitialSize(wxSize(800,600));\n wxSplitterWindow* splitter = create_help_splitter(this);\n m_tree = make_dumb<HelpTree>(splitter, m_rootDir + \"\/contents.dat\");\n m_html = make_dumb<HelpWindow>(splitter);\n splitter->SplitVertically(m_tree.get(), m_html.get());\n splitter->SetSashPosition(200);\n auto toolbar = new wxToolBar(this, wxID_ANY);\n toolbar->AddTool(help_toolbar_back, \"Back\", art.Get(Icon::HELP_BACK));\n toolbar->AddTool(help_toolbar_forward, \"Forward\", art.Get(Icon::HELP_FORWARD));\n toolbar->Realize();\n SetToolBar(toolbar);\n\n bind_fwd(this, wxEVT_CLOSE_WINDOW,\n [this](wxCloseEvent& event){\n if (event.CanVeto()){\n \/\/ Hide instead of close if possible\n event.Veto();\n Hide();\n }\n else {\n Destroy();\n }\n });\n\n bind(this, EVT_FAINT_CLOSE_HELP,\n \/\/ Handles custom EVT_CLOSE_HELP from contained windows.\n [this](){\n \/\/ Non-forcing close\n Close();\n });\n\n bind(this, EVT_FAINT_MAXIMIZE_HELP,\n [this](){\n Maximize(!IsMaximized());\n });\n\n bind_fwd(this, wxEVT_HTML_LINK_CLICKED,\n [this](wxHtmlLinkEvent& evt){\n m_updateOnTree = false;\n wxHtmlLinkInfo link(evt.GetLinkInfo());\n assert(is_help_link(link));\n m_tree->SelectPage(link_to_filename(link.GetHref()));\n evt.Skip();\n m_updateOnTree = true;\n });\n\n bind(this, EVT_FAINT_SCROLL_HELP_END,\n [this](){\n m_html->FaintEnd();\n });\n\n bind(this, EVT_FAINT_SCROLL_HELP_HOME,\n [this](){\n m_html->FaintHome();\n });\n\n bind(this, EVT_FAINT_SCROLL_HELP_LINE_DOWN,\n [this](){\n if (m_tree->HasFocus()){\n m_html->FaintLineDown();\n }\n else {\n m_tree->Next();\n }\n });\n\n bind(this, EVT_FAINT_SCROLL_HELP_LINE_UP,\n [this](){\n if (m_tree->HasFocus()){\n m_html->FaintLineUp();\n }\n else {\n m_tree->Prev();\n }\n });\n\n bind(this, EVT_FAINT_SCROLL_HELP_PAGE_DOWN,\n [this](){\n m_html->FaintPageDown();\n });\n\n bind(this, EVT_FAINT_SCROLL_HELP_PAGE_UP,\n [this](){\n m_html->FaintPageUp();\n });\n\n bind_fwd(this, wxEVT_TOOL,\n [this](wxCommandEvent& evt){\n if (evt.GetId() == help_toolbar_back){\n GoBack();\n }\n else if (evt.GetId() == help_toolbar_forward){\n GoForward();\n }\n });\n\n bind_fwd(this, wxEVT_TREE_SEL_CHANGED,\n [this](wxTreeEvent& evt){\n evt.Skip();\n wxTreeItemId newItem = evt.GetItem();\n wxTreeItemId old = evt.GetOldItem();\n if (old.IsOk()){\n m_tree->SetItemBold(evt.GetOldItem(), false);\n }\n m_tree->SetItemBold(newItem);\n if (m_updateOnTree){\n page_filename page(m_tree->GetPage(evt.GetItem()));\n wxFileName htmlFile(m_rootDir + \"\/\" + page.Get());\n m_html->LoadFile(htmlFile);\n }\n });\n }\n\n bool FaintHasFocus(){\n return HasFocus() || m_html->HasFocus() || m_tree->HasFocus();\n }\n\n void FaintShow(){\n if (!m_initialized){\n m_html->LoadFile(wxFileName(m_rootDir + \"\/main.html\"));\n m_initialized = true;\n }\n Show();\n }\nprivate:\n void GoBack(){\n m_html->HistoryBack();\n UpdateTreeSelection();\n }\n void GoForward(){\n m_html->HistoryForward();\n UpdateTreeSelection();\n }\n\n void UpdateTreeSelection(){\n m_tree->SelectPage(parse_page_filename(m_html->GetOpenedPage()));\n }\n\n dumb_ptr<HelpWindow> m_html;\n dumb_ptr<HelpTree> m_tree;\n const wxString m_rootDir;\n bool m_initialized;\n bool m_updateOnTree;\n};\n\nHelpFrame::HelpFrame(const DirPath& rootDir, const Art& art)\n : m_impl(make_dumb<HelpFrameImpl>(to_wx(rootDir.Str()), art))\n{\n restore_persisted_state(m_impl.get(), storage_name(\"HelpFrame\"));\n}\n\nHelpFrame::~HelpFrame(){\n if (m_impl != nullptr){\n Close();\n }\n }\n\nvoid HelpFrame::Close(){\n m_impl->Close(true);\n m_impl = nullptr;\n}\n\nvoid HelpFrame::Hide(){\n m_impl->Hide();\n}\n\nbool HelpFrame::HasFocus() const{\n return m_impl->FaintHasFocus();\n}\n\nbool HelpFrame::IsHidden() const{\n return !IsShown();\n}\n\nbool HelpFrame::IsIconized() const{\n return m_impl->IsIconized();\n}\n\nbool HelpFrame::IsShown() const{\n return m_impl->IsShown();\n}\n\nvoid HelpFrame::Raise(){\n m_impl->Raise();\n}\n\nvoid HelpFrame::Restore(){\n m_impl->Restore();\n}\n\nvoid HelpFrame::SetIcons(const wxIcon& icon16, const wxIcon& icon32){\n m_impl->SetIcons(bundle_icons(icon16, icon32));\n}\n\nvoid HelpFrame::Show(){\n m_impl->FaintShow();\n}\n\n} \/\/ namespace\n<commit_msg>Using slice instead of substr.<commit_after>\/\/ -*- coding: us-ascii-unix -*-\n\/\/ Copyright 2012 Lukas Kemmer\n\/\/\n\/\/ Licensed under the Apache License, Version 2.0 (the \"License\"); you\n\/\/ may not use this file except in compliance with the License. You\n\/\/ may obtain a copy of the License at\n\/\/\n\/\/ http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n\/\/\n\/\/ Unless required by applicable law or agreed to in writing, software\n\/\/ distributed under the License is distributed on an \"AS IS\" BASIS,\n\/\/ WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or\n\/\/ implied. See the License for the specific language governing\n\/\/ permissions and limitations under the License.\n\n#include <fstream>\n#include <map>\n#include \"wx\/toolbar.h\"\n#include \"wx\/frame.h\"\n#include \"wx\/html\/htmlwin.h\"\n#include \"wx\/splitter.h\"\n#include \"wx\/treectrl.h\"\n#include \"app\/resource-id.hh\"\n#include \"gui\/art.hh\"\n#include \"gui\/help-frame.hh\"\n#include \"util-wx\/bind-event.hh\"\n#include \"util-wx\/convert-wx.hh\"\n#include \"util-wx\/fwd-bind.hh\"\n#include \"util-wx\/gui-util.hh\"\n#include \"util-wx\/make-event.hh\"\n#include \"util-wx\/slice-wx.hh\"\n#include \"util\/distinct.hh\"\n#include \"util\/optional.hh\"\n\nnamespace faint{\n\nMAKE_FAINT_COMMAND_EVENT(FAINT_CLOSE_HELP);\nMAKE_FAINT_COMMAND_EVENT(FAINT_MAXIMIZE_HELP);\nMAKE_FAINT_COMMAND_EVENT(FAINT_BACK_HELP);\nMAKE_FAINT_COMMAND_EVENT(FAINT_SCROLL_HELP_END);\nMAKE_FAINT_COMMAND_EVENT(FAINT_SCROLL_HELP_HOME);\nMAKE_FAINT_COMMAND_EVENT(FAINT_SCROLL_HELP_LINE_UP);\nMAKE_FAINT_COMMAND_EVENT(FAINT_SCROLL_HELP_LINE_DOWN);\nMAKE_FAINT_COMMAND_EVENT(FAINT_SCROLL_HELP_PAGE_DOWN);\nMAKE_FAINT_COMMAND_EVENT(FAINT_SCROLL_HELP_PAGE_UP);\n\nstatic bool send_event(wxWindow* window, int eventId){\n wxCommandEvent newEvent(eventId);\n window->GetEventHandler()->ProcessEvent(newEvent);\n return true;\n}\n\nstatic bool is_web_link(const wxHtmlLinkInfo& link){\n auto href = link.GetHref();\n return href.StartsWith(\"http:\/\/\") || href.StartsWith(\"https:\/\/\");\n}\n\nstatic bool is_help_link(const wxHtmlLinkInfo& link){\n return !is_web_link(link);\n}\n\nbool common_help_key(wxWindow* window, const wxKeyEvent& event){\n \/\/ Handle key-presses common to windows within the HelpFrame. The\n \/\/ window parameter is the window that received the event, and is used\n \/\/ for propagating new events to the frame\n if (event.GetKeyCode() == WXK_ESCAPE){\n return send_event(window, FAINT_CLOSE_HELP);\n }\n else if (event.GetKeyCode() == WXK_RETURN && event.AltDown()){\n return send_event(window, FAINT_MAXIMIZE_HELP);\n }\n else if (event.GetKeyCode() == WXK_BACK){\n return send_event(window, FAINT_BACK_HELP);\n }\n else if (event.GetKeyCode() == WXK_SPACE || event.GetKeyCode() == WXK_PAGEDOWN){\n return send_event(window, FAINT_SCROLL_HELP_PAGE_DOWN);\n }\n else if (event.GetKeyCode() == WXK_PAGEUP){\n return send_event(window, FAINT_SCROLL_HELP_PAGE_UP);\n }\n else if (event.GetKeyCode() == WXK_UP && event.ControlDown()){\n return send_event(window, FAINT_SCROLL_HELP_LINE_UP);\n }\n else if (event.GetKeyCode() == WXK_DOWN && event.ControlDown()){\n return send_event(window, FAINT_SCROLL_HELP_LINE_DOWN);\n }\n else if (event.GetKeyCode() == WXK_HOME){\n return send_event(window, FAINT_SCROLL_HELP_HOME);\n }\n else if (event.GetKeyCode() == WXK_END){\n return send_event(window, FAINT_SCROLL_HELP_END);\n }\n return false;\n}\n\nwxSplitterWindow* create_help_splitter(wxWindow* parent){\n wxSplitterWindow* splitter = new wxSplitterWindow(parent);\n\n \/\/ Prevent unsplitting\n splitter->SetMinimumPaneSize(20);\n\n \/\/ Only grow the right window when rescaling\n splitter->SetSashGravity(0.0);\n return splitter;\n}\n\nclass HelpWindow : public wxHtmlWindow{\n\/\/ The html area for the help-text. Uses the basic wxHtmlWindow to\n\/\/ avoid heavier dependencies (like wxWebView), this should be enough\n\/\/ for the help system.\npublic:\n explicit HelpWindow(wxWindow* parent)\n : wxHtmlWindow(parent,\n wxID_ANY,\n wxDefaultPosition,\n wxDefaultSize,\n wxHW_DEFAULT_STYLE | wxBORDER_THEME)\n {\n bind_fwd(this, wxEVT_KEY_DOWN,\n [this](wxKeyEvent& event){\n bool handled = common_help_key(this, event);\n if (!handled){\n event.Skip();\n }\n });\n }\n\n void FaintLineDown(){\n wxPoint pos = GetViewStart();\n Scroll(pos.x, pos.y + 1);\n }\n\n void FaintLineUp(){\n wxPoint pos = GetViewStart();\n Scroll(pos.x, pos.y - 1);\n }\n\n void FaintPageDown(){\n int steps = GetScrollPageSize(wxVERTICAL);\n wxPoint pos = GetViewStart();\n Scroll(pos.x, pos.y + steps - m_keep);\n }\n\n void FaintPageUp(){\n int steps = GetScrollPageSize(wxVERTICAL);\n wxPoint pos = GetViewStart();\n Scroll(pos.x, pos.y - steps + m_keep);\n }\n\n void FaintHome(){\n wxPoint pos = GetViewStart();\n Scroll(pos.x, 0);\n }\n\n void FaintEnd(){\n wxPoint pos = GetViewStart();\n int x, y;\n GetVirtualSize(&x, &y);\n Scroll(pos.x, y);\n }\nprivate:\n void OnLinkClicked(const wxHtmlLinkInfo& link) override{\n if (is_web_link(link)){\n \/\/ External links should open in the default browser, not the\n \/\/ help window.\n wxLaunchDefaultBrowser(link.GetHref());\n }\n else{\n wxHtmlWindow::OnLinkClicked(link);\n }\n }\n\n \/\/ (Approximate-) lines to keep from the current page while\n \/\/ scrolling a page, to make it easier to follow scrolling with pgdn, pgup\n static const int m_keep = 2;\n};\n\nclass HelpTree;\nusing page_filename = Distinct<wxString, HelpTree, 0>;\nusing page_map_t = std::map<wxTreeItemId, page_filename>;\n\nclass HelpTree : public wxTreeCtrl{\n\/\/ The tree-based table of contents for the HelpFrame.\npublic:\n HelpTree(wxWindow* parent, const wxString& contentsFile) :\n wxTreeCtrl(parent, wxID_ANY, wxDefaultPosition, wxDefaultSize,\n wxTR_DEFAULT_STYLE|wxTR_HIDE_ROOT|wxTR_NO_LINES|wxTR_TWIST_BUTTONS)\n {\n m_root = AddRoot(\"\");\n CreateFromFile(contentsFile);\n\n bind_fwd(this, wxEVT_KEY_DOWN,\n [this](wxKeyEvent& event){\n\n bool handled = common_help_key(this, event);\n if (!handled){\n event.Skip();\n }\n });\n }\n\n wxTreeItemId AddPage(const wxString& title, const page_filename& page){\n return AddChildPage(m_root, title, page);\n }\n\n wxTreeItemId AddChildPage(const wxTreeItemId& parent,\n const wxString& title,\n const page_filename& page)\n {\n wxTreeItemId id = AppendItem(parent, title);\n m_idToPage.insert(std::make_pair(id, page));\n return id;\n }\n\n page_filename GetPage(const wxTreeItemId& id){\n return m_idToPage.at(id);\n }\n\n void Next(){\n wxTreeItemId selected = GetSelection();\n if (!selected.IsOk()){\n return;\n }\n wxTreeItemId next = GetNextSibling(selected);\n if (!next.IsOk()){\n return;\n }\n SelectItem(next);\n }\n\n void Prev(){\n wxTreeItemId selected = GetSelection();\n if (!selected.IsOk()){\n return;\n }\n wxTreeItemId prev = GetPrevSibling(selected);\n if (!prev.IsOk()){\n return;\n }\n SelectItem(prev);\n }\n\n void SelectPage(const page_filename& name){\n for (const auto& mapItem : m_idToPage){\n if (mapItem.second == name){\n SelectItem(mapItem.first);\n }\n }\n }\nprivate:\n void CreateFromFile(const wxString& contentsFile){\n std::ifstream f(iostream_friendly(contentsFile));\n std::string s;\n wxTreeItemId currentParent = m_root; \/\/ Note: This is too simplistic for deeper nesting\n while (std::getline(f,s)){\n if (s.empty()){\n break;\n }\n\n size_t sep = s.find(\";\");\n assert(sep != wxString::npos);\n wxString name = slice_up_to(s, sep);\n page_filename filename(slice_from(s, sep + 1));\n bool child = name[0] == '>';\n if (child){\n name = slice_from(name, 1);\n }\n if (child){\n AddChildPage(currentParent, name, filename);\n }\n else {\n currentParent = AddPage(name, filename);\n }\n }\n }\n\n page_map_t m_idToPage;\n wxTreeItemId m_root;\n};\n\nconst int help_toolbar_back=0;\nconst int help_toolbar_forward=1;\n\nstatic page_filename parse_page_filename(const wxString& str){\n size_t pos = str.rfind(\"\/\");\n if (pos == wxString::npos){\n pos = str.rfind(\"\\\\\");\n }\n if (pos == wxString::npos){\n return page_filename(\"\");\n }\n return page_filename(slice_from(str, pos + 1));\n}\n\nstatic page_filename link_to_filename(const wxString& str){\n size_t pos = str.rfind(\"#\");\n if (pos == wxString::npos){\n return page_filename(wxString(str));\n }\n return page_filename(slice_up_to(str, pos));\n}\n\nclass HelpFrame::HelpFrameImpl : public wxFrame {\npublic:\n HelpFrameImpl(const wxString& rootDir, const Art& art)\n : wxFrame(null_parent(), wxID_ANY, \"Faint Help\"),\n m_html(nullptr),\n m_tree(nullptr),\n m_rootDir(rootDir),\n m_initialized(false),\n m_updateOnTree(true)\n {\n SetInitialSize(wxSize(800,600));\n wxSplitterWindow* splitter = create_help_splitter(this);\n m_tree = make_dumb<HelpTree>(splitter, m_rootDir + \"\/contents.dat\");\n m_html = make_dumb<HelpWindow>(splitter);\n splitter->SplitVertically(m_tree.get(), m_html.get());\n splitter->SetSashPosition(200);\n auto toolbar = new wxToolBar(this, wxID_ANY);\n toolbar->AddTool(help_toolbar_back, \"Back\", art.Get(Icon::HELP_BACK));\n toolbar->AddTool(help_toolbar_forward, \"Forward\", art.Get(Icon::HELP_FORWARD));\n toolbar->Realize();\n SetToolBar(toolbar);\n\n bind_fwd(this, wxEVT_CLOSE_WINDOW,\n [this](wxCloseEvent& event){\n if (event.CanVeto()){\n \/\/ Hide instead of close if possible\n event.Veto();\n Hide();\n }\n else {\n Destroy();\n }\n });\n\n bind(this, EVT_FAINT_CLOSE_HELP,\n \/\/ Handles custom EVT_CLOSE_HELP from contained windows.\n [this](){\n \/\/ Non-forcing close\n Close();\n });\n\n bind(this, EVT_FAINT_MAXIMIZE_HELP,\n [this](){\n Maximize(!IsMaximized());\n });\n\n bind_fwd(this, wxEVT_HTML_LINK_CLICKED,\n [this](wxHtmlLinkEvent& evt){\n m_updateOnTree = false;\n wxHtmlLinkInfo link(evt.GetLinkInfo());\n assert(is_help_link(link));\n m_tree->SelectPage(link_to_filename(link.GetHref()));\n evt.Skip();\n m_updateOnTree = true;\n });\n\n bind(this, EVT_FAINT_SCROLL_HELP_END,\n [this](){\n m_html->FaintEnd();\n });\n\n bind(this, EVT_FAINT_SCROLL_HELP_HOME,\n [this](){\n m_html->FaintHome();\n });\n\n bind(this, EVT_FAINT_SCROLL_HELP_LINE_DOWN,\n [this](){\n if (m_tree->HasFocus()){\n m_html->FaintLineDown();\n }\n else {\n m_tree->Next();\n }\n });\n\n bind(this, EVT_FAINT_SCROLL_HELP_LINE_UP,\n [this](){\n if (m_tree->HasFocus()){\n m_html->FaintLineUp();\n }\n else {\n m_tree->Prev();\n }\n });\n\n bind(this, EVT_FAINT_SCROLL_HELP_PAGE_DOWN,\n [this](){\n m_html->FaintPageDown();\n });\n\n bind(this, EVT_FAINT_SCROLL_HELP_PAGE_UP,\n [this](){\n m_html->FaintPageUp();\n });\n\n bind_fwd(this, wxEVT_TOOL,\n [this](wxCommandEvent& evt){\n if (evt.GetId() == help_toolbar_back){\n GoBack();\n }\n else if (evt.GetId() == help_toolbar_forward){\n GoForward();\n }\n });\n\n bind_fwd(this, wxEVT_TREE_SEL_CHANGED,\n [this](wxTreeEvent& evt){\n evt.Skip();\n wxTreeItemId newItem = evt.GetItem();\n wxTreeItemId old = evt.GetOldItem();\n if (old.IsOk()){\n m_tree->SetItemBold(evt.GetOldItem(), false);\n }\n m_tree->SetItemBold(newItem);\n if (m_updateOnTree){\n page_filename page(m_tree->GetPage(evt.GetItem()));\n wxFileName htmlFile(m_rootDir + \"\/\" + page.Get());\n m_html->LoadFile(htmlFile);\n }\n });\n }\n\n bool FaintHasFocus(){\n return HasFocus() || m_html->HasFocus() || m_tree->HasFocus();\n }\n\n void FaintShow(){\n if (!m_initialized){\n m_html->LoadFile(wxFileName(m_rootDir + \"\/main.html\"));\n m_initialized = true;\n }\n Show();\n }\nprivate:\n void GoBack(){\n m_html->HistoryBack();\n UpdateTreeSelection();\n }\n void GoForward(){\n m_html->HistoryForward();\n UpdateTreeSelection();\n }\n\n void UpdateTreeSelection(){\n m_tree->SelectPage(parse_page_filename(m_html->GetOpenedPage()));\n }\n\n dumb_ptr<HelpWindow> m_html;\n dumb_ptr<HelpTree> m_tree;\n const wxString m_rootDir;\n bool m_initialized;\n bool m_updateOnTree;\n};\n\nHelpFrame::HelpFrame(const DirPath& rootDir, const Art& art)\n : m_impl(make_dumb<HelpFrameImpl>(to_wx(rootDir.Str()), art))\n{\n restore_persisted_state(m_impl.get(), storage_name(\"HelpFrame\"));\n}\n\nHelpFrame::~HelpFrame(){\n if (m_impl != nullptr){\n Close();\n }\n }\n\nvoid HelpFrame::Close(){\n m_impl->Close(true);\n m_impl = nullptr;\n}\n\nvoid HelpFrame::Hide(){\n m_impl->Hide();\n}\n\nbool HelpFrame::HasFocus() const{\n return m_impl->FaintHasFocus();\n}\n\nbool HelpFrame::IsHidden() const{\n return !IsShown();\n}\n\nbool HelpFrame::IsIconized() const{\n return m_impl->IsIconized();\n}\n\nbool HelpFrame::IsShown() const{\n return m_impl->IsShown();\n}\n\nvoid HelpFrame::Raise(){\n m_impl->Raise();\n}\n\nvoid HelpFrame::Restore(){\n m_impl->Restore();\n}\n\nvoid HelpFrame::SetIcons(const wxIcon& icon16, const wxIcon& icon32){\n m_impl->SetIcons(bundle_icons(icon16, icon32));\n}\n\nvoid HelpFrame::Show(){\n m_impl->FaintShow();\n}\n\n} \/\/ namespace\n<|endoftext|>"} {"text":"<commit_before>\/\/ Extended Euclid: gcd(a, b) = x*a + y*b\nvoid euclid(int a, int b, int &x, int &y, int &d) {\n if (b) euclid(b, a%b, y, x, d), y -= x*(a\/b);\n else x = 1, y = 0, d = a;\n}\n\n\/\/ Solves a*x + b*y = c\nbool find_any_solution(int a, int b, int c, int &x0, int &y0, int &g) {\n euclid(abs(a), abs(b), x0, y0, g);\n if (c % g) {\n return false;\n }\n\n x0 *= c \/ g;\n y0 *= c \/ g;\n if (a < 0) x0 = -x0;\n if (b < 0) y0 = -y0;\n return true;\n}\n\n\/\/ all x' and y' are a valid solution for any integer k\n\/\/ x' = x + k*b\/gcd\n\/\/ y' = y - k*a\/gcd\n\/\/ Here a and b are actually a\/gcd and b\/gcd\nvoid shift_solution (int & x, int & y, int a, int b, int cnt) {\n x += cnt * b;\n y -= cnt * a;\n}\n\n\/\/ Find the amount of solutions in a interval of x and y\nint find_all_solutions (int a, int b, int c, int minx, int maxx, int miny, int maxy) {\n int x, y, g;\n if (! find_any_solution (a, b, c, x, y, g))\n return 0;\n a \/= g; b \/= g;\n\n int sign_a = a>0 ? +1 : -1;\n int sign_b = b>0 ? +1 : -1;\n\n shift_solution (x, y, a, b, (minx - x) \/ b);\n if (x < minx)\n shift_solution (x, y, a, b, sign_b);\n if (x > maxx)\n return 0;\n int lx1 = x;\n\n shift_solution (x, y, a, b, (maxx - x) \/ b);\n if (x > maxx)\n shift_solution (x, y, a, b, -sign_b);\n int rx1 = x;\n\n shift_solution (x, y, a, b, - (miny - y) \/ a);\n if (y < miny)\n shift_solution (x, y, a, b, -sign_a);\n if (y > maxy)\n return 0;\n int lx2 = x;\n\n shift_solution (x, y, a, b, - (maxy - y) \/ a);\n if (y > maxy)\n shift_solution (x, y, a, b, sign_a);\n int rx2 = x;\n\n if (lx2 > rx2)\n swap (lx2, rx2);\n int lx = max (lx1, lx2);\n int rx = min (rx1, rx2);\n\n if (lx > rx) return 0;\n return (rx - lx) \/ abs(b) + 1;\n}\n\n\/\/Solves\n\/\/t = a mod m1\n\/\/t = b mod m2\n\/\/ans = t mod lcm(m1, m2)\nbool chinese_remainder(ll a, ll b, ll m1, ll m2, ll &ans, ll &lcm){\n ll x, y, g, c = b - a;\n euclid(m1, m2, x, y, g);\n if(c%g) return false;\n\n lcm = m1\/g*m2;\n ans = ((a + m1*((x*c\/g)%(m2\/g)))%lcm + lcm)%lcm;\n return true;\n}\n<commit_msg>Update extended-euclid.cpp<commit_after>\/\/ Extended Euclid: gcd(a, b) = x*a + y*b\nvoid euclid(int a, int b, int &x, int &y, int &d) {\n if (b) euclid(b, a%b, y, x, d), y -= x*(a\/b);\n else x = 1, y = 0, d = a;\n}\n\n\/\/ Solves a*x + b*y = c\nbool find_any_solution(int a, int b, int c, int &x0, int &y0, int &g) {\n euclid(abs(a), abs(b), x0, y0, g);\n if (c % g) {\n return false;\n }\n\n x0 *= c \/ g;\n y0 *= c \/ g;\n if (a < 0) x0 = -x0;\n if (b < 0) y0 = -y0;\n return true;\n}\n\n\/\/ all x' and y' are a valid solution for any integer k\n\/\/ x' = x + k*b\/gcd\n\/\/ y' = y - k*a\/gcd\n\/\/ Here a and b are actually a\/gcd and b\/gcd\nvoid shift_solution (int & x, int & y, int a, int b, int cnt) {\n x += cnt * b;\n y -= cnt * a;\n}\n\n\/\/ Find the amount of solutions in a interval of x and y\nint find_all_solutions (int a, int b, int c, int minx, int maxx, int miny, int maxy) {\n int x, y, g;\n if (! find_any_solution (a, b, c, x, y, g))\n return 0;\n a \/= g; b \/= g;\n\n int sign_a = a>0 ? +1 : -1;\n int sign_b = b>0 ? +1 : -1;\n\n shift_solution (x, y, a, b, (minx - x) \/ b);\n if (x < minx)\n shift_solution (x, y, a, b, sign_b);\n if (x > maxx)\n return 0;\n int lx1 = x;\n\n shift_solution (x, y, a, b, (maxx - x) \/ b);\n if (x > maxx)\n shift_solution (x, y, a, b, -sign_b);\n int rx1 = x;\n\n shift_solution (x, y, a, b, - (miny - y) \/ a);\n if (y < miny)\n shift_solution (x, y, a, b, -sign_a);\n if (y > maxy)\n return 0;\n int lx2 = x;\n\n shift_solution (x, y, a, b, - (maxy - y) \/ a);\n if (y > maxy)\n shift_solution (x, y, a, b, sign_a);\n int rx2 = x;\n\n if (lx2 > rx2)\n swap (lx2, rx2);\n int lx = max (lx1, lx2);\n int rx = min (rx1, rx2);\n\n if (lx > rx) return 0;\n return (rx - lx) \/ abs(b) + 1;\n}\n\n\/\/Solves\n\/\/t = a mod m1\n\/\/t = b mod m2\n\/\/ans = t mod lcm(m1, m2)\nbool chinese_remainder(ll a, ll b, ll m1, ll m2, ll &ans, ll &lcm){\n ll x, y, g, c = b - a;\n euclid(m1, m2, x, y, g);\n if(c%g) return false;\n\n lcm = m1\/g*m2;\n ans = ((a + m1*((c\/g*x)%(m2\/g)))%lcm + lcm)%lcm;\n return true;\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 <chrono>\n#include <map>\n#include <optional>\n#include <seastar\/core\/byteorder.hh>\n#include <seastar\/core\/sstring.hh>\n#include \"seastarx.hh\"\n\n\/\/\n\/\/ This hashing differs from std::hash<> in that it decouples knowledge about\n\/\/ type structure from the way the hash value is calculated:\n\/\/ * appending_hash<T> instantiation knows about what data should be included in the hash for type T.\n\/\/ * Hasher object knows how to combine the data into the final hash.\n\/\/\n\/\/ The appending_hash<T> should always feed some data into the hasher, regardless of the state the object is in,\n\/\/ in order for the hash to be highly sensitive for value changes. For example, vector<optional<T>> should\n\/\/ ideally feed different values for empty vector and a vector with a single empty optional.\n\/\/\n\/\/ appending_hash<T> is machine-independent.\n\/\/\n\n\/\/ The Hasher concept\nstruct Hasher {\n void update(const char* ptr, size_t size);\n};\n\ntemplate<typename T, typename Enable = void>\nstruct appending_hash;\n\ntemplate<typename Hasher, typename T, typename... Args>\ninline\nvoid feed_hash(Hasher& h, const T& value, Args&&... args) {\n appending_hash<T>()(h, value, std::forward<Args>(args)...);\n};\n\ntemplate<typename T>\nstruct appending_hash<T, std::enable_if_t<std::is_arithmetic<T>::value>> {\n template<typename Hasher>\n void operator()(Hasher& h, T value) const {\n auto value_le = cpu_to_le(value);\n h.update(reinterpret_cast<const char*>(&value_le), sizeof(T));\n }\n};\n\ntemplate<>\nstruct appending_hash<bool> {\n template<typename Hasher>\n void operator()(Hasher& h, bool value) const {\n feed_hash(h, static_cast<uint8_t>(value));\n }\n};\n\ntemplate<typename T>\nstruct appending_hash<T, std::enable_if_t<std::is_enum<T>::value>> {\n template<typename Hasher>\n void operator()(Hasher& h, const T& value) const {\n feed_hash(h, static_cast<std::underlying_type_t<T>>(value));\n }\n};\n\ntemplate<typename T>\nstruct appending_hash<std::optional<T>> {\n template<typename Hasher>\n void operator()(Hasher& h, const std::optional<T>& value) const {\n if (value) {\n feed_hash(h, true);\n feed_hash(h, *value);\n } else {\n feed_hash(h, false);\n }\n }\n};\n\ntemplate<size_t N>\nstruct appending_hash<char[N]> {\n template<typename Hasher>\n void operator()(Hasher& h, const char (&value) [N]) const {\n feed_hash(h, N);\n h.update(value, N);\n }\n};\n\ntemplate<typename T>\nstruct appending_hash<std::vector<T>> {\n template<typename Hasher>\n void operator()(Hasher& h, const std::vector<T>& value) const {\n feed_hash(h, value.size());\n for (auto&& v : value) {\n appending_hash<T>()(h, v);\n }\n }\n};\n\ntemplate<typename K, typename V>\nstruct appending_hash<std::map<K, V>> {\n template<typename Hasher>\n void operator()(Hasher& h, const std::map<K, V>& value) const {\n feed_hash(h, value.size());\n for (auto&& e : value) {\n appending_hash<K>()(h, e.first);\n appending_hash<V>()(h, e.second);\n }\n }\n};\n\ntemplate<>\nstruct appending_hash<sstring> {\n template<typename Hasher>\n void operator()(Hasher& h, const sstring& v) const {\n feed_hash(h, v.size());\n h.update(reinterpret_cast<const char*>(v.cbegin()), v.size() * sizeof(sstring::value_type));\n }\n};\n\ntemplate<>\nstruct appending_hash<std::string> {\n template<typename Hasher>\n void operator()(Hasher& h, const std::string& v) const {\n feed_hash(h, v.size());\n h.update(reinterpret_cast<const char*>(v.data()), v.size() * sizeof(std::string::value_type));\n }\n};\n\ntemplate<typename T, typename R>\nstruct appending_hash<std::chrono::duration<T, R>> {\n template<typename Hasher>\n void operator()(Hasher& h, std::chrono::duration<T, R> v) const {\n feed_hash(h, v.count());\n }\n};\n\ntemplate<typename Clock, typename Duration>\nstruct appending_hash<std::chrono::time_point<Clock, Duration>> {\n template<typename Hasher>\n void operator()(Hasher& h, std::chrono::time_point<Clock, Duration> v) const {\n feed_hash(h, v.time_since_epoch().count());\n }\n};\n<commit_msg>hashing: Introduce C++ concept for the hasher<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 <chrono>\n#include <map>\n#include <optional>\n#include <seastar\/core\/byteorder.hh>\n#include <seastar\/core\/sstring.hh>\n#include \"seastarx.hh\"\n#include <seastar\/util\/gcc6-concepts.hh>\n\n\/\/\n\/\/ This hashing differs from std::hash<> in that it decouples knowledge about\n\/\/ type structure from the way the hash value is calculated:\n\/\/ * appending_hash<T> instantiation knows about what data should be included in the hash for type T.\n\/\/ * Hasher object knows how to combine the data into the final hash.\n\/\/\n\/\/ The appending_hash<T> should always feed some data into the hasher, regardless of the state the object is in,\n\/\/ in order for the hash to be highly sensitive for value changes. For example, vector<optional<T>> should\n\/\/ ideally feed different values for empty vector and a vector with a single empty optional.\n\/\/\n\/\/ appending_hash<T> is machine-independent.\n\/\/\n\nGCC6_CONCEPT(\n template<typename H>\n concept bool Hasher() {\n return requires(H& h, const char* ptr, size_t size) {\n { h.update(ptr, size) } -> void\n };\n }\n)\n\ntemplate<typename T, typename Enable = void>\nstruct appending_hash;\n\ntemplate<typename H, typename T, typename... Args>\nGCC6_CONCEPT(requires Hasher<H>())\ninline\nvoid feed_hash(H& h, const T& value, Args&&... args) {\n appending_hash<T>()(h, value, std::forward<Args>(args)...);\n};\n\ntemplate<typename T>\nstruct appending_hash<T, std::enable_if_t<std::is_arithmetic<T>::value>> {\n template<typename H>\n GCC6_CONCEPT(requires Hasher<H>())\n void operator()(H& h, T value) const {\n auto value_le = cpu_to_le(value);\n h.update(reinterpret_cast<const char*>(&value_le), sizeof(T));\n }\n};\n\ntemplate<>\nstruct appending_hash<bool> {\n template<typename H>\n GCC6_CONCEPT(requires Hasher<H>())\n void operator()(H& h, bool value) const {\n feed_hash(h, static_cast<uint8_t>(value));\n }\n};\n\ntemplate<typename T>\nstruct appending_hash<T, std::enable_if_t<std::is_enum<T>::value>> {\n template<typename H>\n GCC6_CONCEPT(requires Hasher<H>())\n void operator()(H& h, const T& value) const {\n feed_hash(h, static_cast<std::underlying_type_t<T>>(value));\n }\n};\n\ntemplate<typename T>\nstruct appending_hash<std::optional<T>> {\n template<typename H>\n GCC6_CONCEPT(requires Hasher<H>())\n void operator()(H& h, const std::optional<T>& value) const {\n if (value) {\n feed_hash(h, true);\n feed_hash(h, *value);\n } else {\n feed_hash(h, false);\n }\n }\n};\n\ntemplate<size_t N>\nstruct appending_hash<char[N]> {\n template<typename H>\n GCC6_CONCEPT(requires Hasher<H>())\n void operator()(H& h, const char (&value) [N]) const {\n feed_hash(h, N);\n h.update(value, N);\n }\n};\n\ntemplate<typename T>\nstruct appending_hash<std::vector<T>> {\n template<typename H>\n GCC6_CONCEPT(requires Hasher<H>())\n void operator()(H& h, const std::vector<T>& value) const {\n feed_hash(h, value.size());\n for (auto&& v : value) {\n appending_hash<T>()(h, v);\n }\n }\n};\n\ntemplate<typename K, typename V>\nstruct appending_hash<std::map<K, V>> {\n template<typename H>\n GCC6_CONCEPT(requires Hasher<H>())\n void operator()(H& h, const std::map<K, V>& value) const {\n feed_hash(h, value.size());\n for (auto&& e : value) {\n appending_hash<K>()(h, e.first);\n appending_hash<V>()(h, e.second);\n }\n }\n};\n\ntemplate<>\nstruct appending_hash<sstring> {\n template<typename H>\n GCC6_CONCEPT(requires Hasher<H>())\n void operator()(H& h, const sstring& v) const {\n feed_hash(h, v.size());\n h.update(reinterpret_cast<const char*>(v.cbegin()), v.size() * sizeof(sstring::value_type));\n }\n};\n\ntemplate<>\nstruct appending_hash<std::string> {\n template<typename H>\n GCC6_CONCEPT(requires Hasher<H>())\n void operator()(H& h, const std::string& v) const {\n feed_hash(h, v.size());\n h.update(reinterpret_cast<const char*>(v.data()), v.size() * sizeof(std::string::value_type));\n }\n};\n\ntemplate<typename T, typename R>\nstruct appending_hash<std::chrono::duration<T, R>> {\n template<typename H>\n GCC6_CONCEPT(requires Hasher<H>())\n void operator()(H& h, std::chrono::duration<T, R> v) const {\n feed_hash(h, v.count());\n }\n};\n\ntemplate<typename Clock, typename Duration>\nstruct appending_hash<std::chrono::time_point<Clock, Duration>> {\n template<typename H>\n GCC6_CONCEPT(requires Hasher<H>())\n void operator()(H& h, std::chrono::time_point<Clock, Duration> v) const {\n feed_hash(h, v.time_since_epoch().count());\n }\n};\n<|endoftext|>"} {"text":"<commit_before>\/\/\n\/\/ Created by michael on 09.11.15.\n\/\/\n\n#include <string>\n#include <memory>\n#include \"catch.hpp\"\n#include \"..\/Core\/WeaverUtils.h\"\n#include \"..\/Core\/GraphAnalyzer.h\"\n\nusing namespace weave;\nusing namespace std;\n\nTEST_CASE(\"Graph analyzer\", \"[graph analyzer]\") {\n shared_ptr<RandomStream> rs = make_shared<RandomStream>(42);\n WeaverGraph graph;\n\n SECTION(\"Solve empty graph\") {\n auto properties = GraphAnalyzer::SolveGraph(&graph, rs);\n REQUIRE(properties.size() == 0);\n }\n\n string groupA = \"entityA\";\n graph.CreateNodeGroup(groupA, true);\n Node node1(groupA, 1);\n graph.AddNode(node1);\n\n SECTION(\"Solve graph with single node\") {\n auto properties = GraphAnalyzer::SolveGraph(&graph, rs);\n REQUIRE(properties.size() == 1);\n REQUIRE(properties[groupA] == node1);\n }\n\n Node node2(groupA, 2);\n graph.AddNode(node2);\n\n SECTION(\"Solve graph with two nodes \/ one group\") {\n auto properties = GraphAnalyzer::SolveGraph(&graph, rs);\n REQUIRE(properties.size() == 1);\n REQUIRE(((properties[groupA] == node1) || (properties[groupA] == node2)));\n }\n\n string groupB = \"entityB\";\n graph.CreateNodeGroup(groupB, true);\n\n SECTION(\"Error on missing required node\") {\n REQUIRE_THROWS_AS(GraphAnalyzer::SolveGraph(&graph, rs), ContractFailedException);\n }\n\n Node node3(groupB, 3);\n graph.AddNode(node3);\n\n SECTION(\"Solve graph with three nodes \/ two groups\") {\n auto properties = GraphAnalyzer::SolveGraph(&graph, rs);\n REQUIRE(properties.size() == 2);\n REQUIRE(((properties[groupA] == node1) || (properties[groupA] == node2)));\n REQUIRE((properties[groupB] == node3));\n }\n\n SECTION(\"Solve graph with three nodes \/ two groups \/ edge1-3\") {\n Edge edge13(1, 3, EdgeType::DIRECT);\n graph.AddEdge(edge13);\n auto properties = GraphAnalyzer::SolveGraph(&graph, rs);\n REQUIRE(properties.size() == 2);\n REQUIRE((properties[groupA] == node1));\n REQUIRE((properties[groupB] == node3));\n }\n\n SECTION(\"Solve graph with three nodes \/ two groups \/ edge2-3\") {\n Edge edge23(2, 3, EdgeType::DIRECT);\n graph.AddEdge(edge23);\n auto properties = GraphAnalyzer::SolveGraph(&graph, rs);\n REQUIRE(properties.size() == 2);\n REQUIRE((properties[groupA] == node2));\n REQUIRE((properties[groupB] == node3));\n }\n}\n<commit_msg>Extended the graph analyzer tests<commit_after>\/\/\n\/\/ Created by michael on 09.11.15.\n\/\/\n\n#include <string>\n#include <memory>\n#include \"catch.hpp\"\n#include \"..\/Core\/WeaverUtils.h\"\n#include \"..\/Core\/GraphAnalyzer.h\"\n\nusing namespace weave;\nusing namespace std;\n\nTEST_CASE(\"Graph analyzer\", \"[graph analyzer]\") {\n shared_ptr<RandomStream> rs = make_shared<RandomStream>(42);\n WeaverGraph graph;\n\n SECTION(\"Solve empty graph\") {\n auto properties = GraphAnalyzer::SolveGraph(&graph, rs);\n REQUIRE(properties.size() == 0);\n }\n\n string groupA = \"entityA\";\n graph.CreateNodeGroup(groupA, true);\n Node node1(groupA, 1);\n graph.AddNode(node1);\n\n SECTION(\"Solve graph with single node\") {\n auto properties = GraphAnalyzer::SolveGraph(&graph, rs);\n REQUIRE(properties.size() == 1);\n REQUIRE(properties[groupA] == node1);\n }\n\n Node node2(groupA, 2);\n graph.AddNode(node2);\n\n SECTION(\"Solve graph with two nodes \/ one group\") {\n auto properties = GraphAnalyzer::SolveGraph(&graph, rs);\n REQUIRE(properties.size() == 1);\n REQUIRE(((properties[groupA] == node1) || (properties[groupA] == node2)));\n }\n\n string groupB = \"entityB\";\n graph.CreateNodeGroup(groupB, true);\n\n SECTION(\"Error on missing required node\") {\n REQUIRE_THROWS_AS(GraphAnalyzer::SolveGraph(&graph, rs), ContractFailedException);\n }\n\n Node node3(groupB, 3);\n graph.AddNode(node3);\n\n SECTION(\"Solve graph with three nodes \/ two groups\") {\n auto properties = GraphAnalyzer::SolveGraph(&graph, rs);\n REQUIRE(properties.size() == 2);\n REQUIRE(((properties[groupA] == node1) || (properties[groupA] == node2)));\n REQUIRE((properties[groupB] == node3));\n }\n\n SECTION(\"Solve graph with three nodes \/ two groups \/ edge1-3\") {\n Edge edge13(1, 3, EdgeType::DIRECT);\n graph.AddEdge(edge13);\n auto properties = GraphAnalyzer::SolveGraph(&graph, rs);\n REQUIRE(properties.size() == 2);\n REQUIRE((properties[groupA] == node1));\n REQUIRE((properties[groupB] == node3));\n }\n\n SECTION(\"Solve graph with three nodes \/ two groups \/ edge2-3\") {\n Edge edge23(2, 3, EdgeType::DIRECT);\n graph.AddEdge(edge23);\n auto properties = GraphAnalyzer::SolveGraph(&graph, rs);\n REQUIRE(properties.size() == 2);\n REQUIRE((properties[groupA] == node2));\n REQUIRE((properties[groupB] == node3));\n }\n\n Edge edge13(1, 3, EdgeType::TRANSITIVE);\n string groupC = \"entityC\";\n Node node4(groupC, 4);\n graph.AddEdge(edge13).CreateNodeGroup(groupC, false).AddNode(node4);\n\n SECTION(\"Solve graph with four nodes \/ one optional\") {\n auto properties = GraphAnalyzer::SolveGraph(&graph, rs);\n REQUIRE(properties.size() == 2);\n REQUIRE((properties[groupA] == node1));\n REQUIRE((properties[groupB] == node3));\n }\n\n Edge edge23(2, 3, EdgeType::DIRECT);\n graph.AddEdge(edge23);\n\n SECTION(\"Solve graph with two edges \/ direct edge takes precedence\") {\n auto properties = GraphAnalyzer::SolveGraph(&graph, rs);\n REQUIRE(properties.size() == 2);\n REQUIRE((properties[groupA] == node2));\n REQUIRE((properties[groupB] == node3));\n }\n}\n<|endoftext|>"} {"text":"<commit_before>\/*\n * Copyright (C) 2004-2011 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\/znc.h>\n#include <znc\/IRCNetwork.h>\n#include <znc\/IRCSock.h>\n\nstruct reply {\n\tconst char *szReply;\n\tbool bLastResponse;\n};\n\n\/\/ TODO this list is far from complete, no errors are handled\nstatic const struct {\n\tconst char *szRequest;\n\tstruct reply vReplies[10];\n} vRouteReplies[] = {\n\t{\"WHO\", {\n\t\t{\"352\", false},\n\t\t{\"354\", false}, \/\/ e.g. Quaknet uses this for WHO #chan %n\n\t\t{\"403\", true}, \/\/ No such chan\n\t\t{\"315\", true},\n\t\t{NULL, true}\n\t}},\n\t{\"LIST\", {\n\t\t{\"321\", false},\n\t\t{\"322\", false},\n\t\t{\"323\", true},\n\t\t{NULL, true}\n\t}},\n\t{\"NAMES\", {\n\t\t{\"353\", false},\n\t\t{\"366\", true},\n\t\t\/\/ No such nick\/channel\n\t\t{\"401\", true},\n\t\t{NULL, true},\n\t}},\n\t{\"LUSERS\", {\n\t\t{\"251\", false},\n\t\t{\"252\", false},\n\t\t{\"253\", false},\n\t\t{\"254\", false},\n\t\t{\"255\", false},\n\t\t{\"265\", false},\n\t\t{\"266\", true},\n\t\t\/\/ We don't handle 250 here since some IRCds don't sent it\n\t\t\/\/{\"250\", true},\n\t\t{NULL, true}\n\t}},\n\t{\"WHOIS\", {\n\t\t{\"311\", false},\n\t\t{\"319\", false},\n\t\t{\"312\", false},\n\t\t\/\/ \"<ip> :actually using host\"\n\t\t{\"338\", false},\n\t\t{\"318\", true},\n\t\t\/\/ No such nick\/channel\n\t\t{\"401\", true},\n\t\t\/\/ No such server\n\t\t{\"402\", true},\n\t\t{NULL, true}\n\t}},\n\t{\"PING\", {\n\t\t{\"PONG\", true},\n\t\t{NULL, true}\n\t}},\n\t{\"USERHOST\", {\n\t\t{\"302\", true},\n\t\t{NULL, true}\n\t}},\n\t{\"TIME\", {\n\t\t{\"391\", true},\n\t\t{NULL, true}\n\t}},\n\t{\"WHOWAS\", {\n\t\t{\"312\", false},\n\t\t{\"314\", false},\n\t\t{\"369\", true},\n\t\t{NULL, true}\n\t}},\n\t{\"ISON\", {\n\t\t{\"303\", true},\n\t\t{NULL, true}\n\t}},\n\t{\"LINKS\", {\n\t\t{\"364\", false},\n\t\t{\"365\", true},\n\t\t{NULL, true}\n\t}},\n\t{\"MAP\", {\n\t\t{\"006\", false},\n\t\t\/\/ inspircd\n\t\t{\"270\", false},\n\t\t\/\/ SilverLeo wants this two added\n\t\t{\"015\", false},\n\t\t{\"017\", true},\n\t\t{\"007\", true},\n\t\t{NULL, true}\n\t}},\n\t{\"TRACE\", {\n\t\t{\"200\", false},\n\t\t{\"205\", false},\n\t\t{\"262\", true},\n\t\t{NULL, true}\n\t}},\n\t{\"USERS\", {\n\t\t{\"265\", false},\n\t\t{\"266\", true},\n\t\t{NULL, true},\n\t}},\n\t\/\/ This is just a list of all possible \/mode replies stuffed together.\n\t\/\/ Since there should never be more than one of these going on, this\n\t\/\/ should work fine and makes the code simpler.\n\t{\"MODE\", {\n\t\t\/\/ MODE I\n\t\t{\"346\", false},\n\t\t{\"347\", true},\n\t\t\/\/ MODE b\n\t\t{\"367\", false},\n\t\t{\"368\", true},\n\t\t\/\/ MODE e\n\t\t{\"348\", false},\n\t\t{\"349\", true},\n\t\t{NULL, true},\n\t }},\n\t\/\/ END (last item!)\n\t{NULL, {{NULL, true}}}\n};\n\nclass CRouteTimeout : public CTimer {\npublic:\n\tCRouteTimeout(CModule* pModule, unsigned int uInterval, unsigned int uCycles,\n\t\t\tconst CString& sLabel, const CString& sDescription)\n\t\t: CTimer(pModule, uInterval, uCycles, sLabel, sDescription) {}\n\tvirtual ~CRouteTimeout() {}\n\nprotected:\n\tvirtual void RunJob();\n};\n\nstruct queued_req {\n\tCString sLine;\n\tconst struct reply *reply;\n};\n\ntypedef std::map<CClient *, std::vector<struct queued_req> > requestQueue;\n\nclass CRouteRepliesMod : public CModule\n{\npublic:\n\tMODCONSTRUCTOR(CRouteRepliesMod)\n\t{\n\t\tm_pDoing = NULL;\n\t\tm_pReplies = NULL;\n\t}\n\n\tvirtual ~CRouteRepliesMod() {\n\t\trequestQueue::iterator it;\n\n\t\twhile (!m_vsPending.empty()) {\n\t\t\tit = m_vsPending.begin();\n\n\t\t\twhile (!it->second.empty()) {\n\t\t\t\tPutIRC(it->second[0].sLine);\n\t\t\t\tit->second.erase(it->second.begin());\n\t\t\t}\n\n\t\t\tm_vsPending.erase(it);\n\t\t}\n\t}\n\n\tvirtual void OnIRCConnected()\n\t{\n\t\tm_pDoing = NULL;\n\t\tm_pReplies = NULL;\n\t\tm_vsPending.clear();\n\n\t\t\/\/ No way we get a reply, so stop the timer (If it's running)\n\t\tRemTimer(\"RouteTimeout\");\n\t}\n\n\tvirtual void OnIRCDisconnected()\n\t{\n\t\tOnIRCConnected(); \/\/ Let's keep it in one place\n\t}\n\n\tvirtual void OnClientDisconnect()\n\t{\n\t\trequestQueue::iterator it;\n\n\t\tif (m_pClient == m_pDoing) {\n\t\t\t\/\/ The replies which aren't received yet will be\n\t\t\t\/\/ broadcasted to everyone, but at least nothing breaks\n\t\t\tRemTimer(\"RouteTimeout\");\n\t\t\tm_pDoing = NULL;\n\t\t\tm_pReplies = NULL;\n\t\t}\n\n\t\tit = m_vsPending.find(m_pClient);\n\n\t\tif (it != m_vsPending.end())\n\t\t\tm_vsPending.erase(it);\n\n\t\tSendRequest();\n\t}\n\n\tvirtual EModRet OnRaw(CString& sLine)\n\t{\n\t\tCString sCmd = sLine.Token(1).AsUpper();\n\t\tsize_t i = 0;\n\n\t\tif (!m_pReplies)\n\t\t\treturn CONTINUE;\n\n\t\t\/\/ Is this a \"not enough arguments\" error?\n\t\tif (sCmd == \"461\") {\n\t\t\t\/\/ :server 461 nick WHO :Not enough parameters\n\t\t\tCString sOrigCmd = sLine.Token(3);\n\n\t\t\tif (m_sLastRequest.Token(0).Equals(sOrigCmd)) {\n\t\t\t\t\/\/ This is the reply to the last request\n\t\t\t\tif (RouteReply(sLine, true))\n\t\t\t\t\treturn HALTCORE;\n\t\t\t\treturn CONTINUE;\n\t\t\t}\n\t\t}\n\n\t\twhile (m_pReplies[i].szReply != NULL) {\n\t\t\tif (m_pReplies[i].szReply == sCmd) {\n\t\t\t\tif (RouteReply(sLine, m_pReplies[i].bLastResponse, sCmd == \"353\"))\n\t\t\t\t\treturn HALTCORE;\n\t\t\t\treturn CONTINUE;\n\t\t\t}\n\t\t\ti++;\n\t\t}\n\n\t\t\/\/ TODO HALTCORE is wrong, it should not be passed to\n\t\t\/\/ the clients, but the core itself should still handle it!\n\n\t\treturn CONTINUE;\n\t}\n\n\tvirtual EModRet OnUserRaw(CString& sLine)\n\t{\n\t\tCString sCmd = sLine.Token(0).AsUpper();\n\n\t\tif (!m_pNetwork->GetIRCSock())\n\t\t\treturn CONTINUE;\n\n\t\tif (sCmd.Equals(\"MODE\")) {\n\t\t\t\/\/ Check if this is a mode request that needs to be handled\n\n\t\t\t\/\/ If there are arguments to a mode change,\n\t\t\t\/\/ we must not route it.\n\t\t\tif (!sLine.Token(3, true).empty())\n\t\t\t\treturn CONTINUE;\n\n\t\t\t\/\/ Grab the mode change parameter\n\t\t\tCString sMode = sLine.Token(2);\n\n\t\t\t\/\/ If this is a channel mode request, znc core replies to it\n\t\t\tif (sMode.empty())\n\t\t\t\treturn CONTINUE;\n\n\t\t\t\/\/ Check if this is a mode change or a specific\n\t\t\t\/\/ mode request (the later needs to be routed).\n\t\t\tsMode.TrimPrefix(\"+\");\n\t\t\tif (sMode.length() != 1)\n\t\t\t\treturn CONTINUE;\n\n\t\t\t\/\/ Now just check if it's one of the supported modes\n\t\t\tswitch (sMode[0]) {\n\t\t\tcase 'I':\n\t\t\tcase 'b':\n\t\t\tcase 'e':\n\t\t\t\tbreak;\n\t\t\tdefault:\n\t\t\t\treturn CONTINUE;\n\t\t\t}\n\n\t\t\t\/\/ Ok, this looks like we should route it.\n\t\t\t\/\/ Fall through to the next loop\n\t\t}\n\n\t\tfor (size_t i = 0; vRouteReplies[i].szRequest != NULL; i++) {\n\t\t\tif (vRouteReplies[i].szRequest == sCmd) {\n\t\t\t\tstruct queued_req req = {\n\t\t\t\t\tsLine, vRouteReplies[i].vReplies\n\t\t\t\t};\n\t\t\t\tm_vsPending[m_pClient].push_back(req);\n\t\t\t\tSendRequest();\n\n\t\t\t\treturn HALTCORE;\n\t\t\t}\n\t\t}\n\n\t\treturn CONTINUE;\n\t}\n\n\tvoid Timeout()\n\t{\n\t\t\/\/ The timer will be deleted after this by the event loop\n\n\t\tif (GetNV(\"silent_timeouts\") != \"yes\") {\n\t\t\tPutModule(\"This module hit a timeout which is possibly a bug.\");\n\t\t\tPutModule(\"To disable this message, do \\\"\/msg \" + GetModNick()\n\t\t\t\t\t+ \" silent yes\\\"\");\n\t\t\tPutModule(\"Last request: \" + m_sLastRequest);\n\t\t\tPutModule(\"Expected replies: \");\n\n\t\t\tfor (size_t i = 0; m_pReplies[i].szReply != NULL; i++) {\n\t\t\t\tif (m_pReplies[i].bLastResponse)\n\t\t\t\t\tPutModule(m_pReplies[i].szReply +\n\t\t\t\t\t\t\tCString(\" (last)\"));\n\t\t\t\telse\n\t\t\t\t\tPutModule(m_pReplies[i].szReply);\n\t\t\t}\n\t\t}\n\n\t\tm_pDoing = NULL;\n\t\tm_pReplies = NULL;\n\t\tSendRequest();\n\t}\n\nprivate:\n\tbool RouteReply(const CString& sLine, bool bFinished = false, bool bIsRaw353 = false)\n\t{\n\t\tif (!m_pDoing)\n\t\t\treturn false;\n\n\t\t\/\/ 353 needs special treatment due to NAMESX and UHNAMES\n\t\tif (bIsRaw353)\n\t\t\tm_pNetwork->GetIRCSock()->ForwardRaw353(sLine, m_pDoing);\n\t\telse\n\t\t\tm_pDoing->PutClient(sLine);\n\n\t\tif (bFinished) {\n\t\t\t\/\/ Stop the timeout\n\t\t\tRemTimer(\"RouteTimeout\");\n\n\t\t\tm_pDoing = NULL;\n\t\t\tm_pReplies = NULL;\n\t\t\tSendRequest();\n\t\t}\n\n\t\treturn true;\n\t}\n\n\tvoid SendRequest()\n\t{\n\t\trequestQueue::iterator it;\n\n\t\tif (m_pDoing || m_pReplies)\n\t\t\treturn;\n\n\t\tif (m_vsPending.empty())\n\t\t\treturn;\n\n\t\tit = m_vsPending.begin();\n\n\t\tif (it->second.empty()) {\n\t\t\tm_vsPending.erase(it);\n\t\t\tSendRequest();\n\t\t\treturn;\n\t\t}\n\n\t\t\/\/ When we are called from the timer, we need to remove it.\n\t\t\/\/ We can't delete it (segfault on return), thus we\n\t\t\/\/ just stop it. The main loop will delete it.\n\t\tCTimer *pTimer = FindTimer(\"RouteTimeout\");\n\t\tif (pTimer) {\n\t\t\tpTimer->Stop();\n\t\t\tUnlinkTimer(pTimer);\n\t\t}\n\t\tAddTimer(new CRouteTimeout(this, 60, 1, \"RouteTimeout\",\n\t\t\t\t\"Recover from missing \/ wrong server replies\"));\n\n\t\tm_pDoing = it->first;\n\t\tm_pReplies = it->second[0].reply;\n\t\tm_sLastRequest = it->second[0].sLine;\n\t\tPutIRC(it->second[0].sLine);\n\t\tit->second.erase(it->second.begin());\n\t}\n\n\tvirtual void OnModCommand(const CString& sCommand) {\n\t\tconst CString sCmd = sCommand.Token(0);\n\t\tconst CString sArgs = sCommand.Token(1, true);\n\n\t\tif (sCmd.Equals(\"silent\")) {\n\t\t\tif (sArgs.Equals(\"yes\")) {\n\t\t\t\tSetNV(\"silent_timeouts\", \"yes\");\n\t\t\t\tPutModule(\"Disabled timeout messages\");\n\t\t\t} else if (sArgs.Equals(\"no\")) {\n\t\t\t\tDelNV(\"silent_timeouts\");\n\t\t\t\tPutModule(\"Enabled timeout messages\");\n\t\t\t} else if (sArgs.empty()) {\n\t\t\t\tif (GetNV(\"silent_timeouts\") == \"yes\")\n\t\t\t\t\tPutModule(\"Timeout messages are disabled\");\n\t\t\t\telse\n\t\t\t\t\tPutModule(\"Timeout message are enabled\");\n\t\t\t} else\n\t\t\t\tPutModule(\"Invalid argument\");\n\t\t} else {\n\t\t\tPutModule(\"Available commands: silent [yes\/no], silent\");\n\t\t}\n\t}\n\n\tCClient *m_pDoing;\n\tconst struct reply *m_pReplies;\n\trequestQueue m_vsPending;\n\t\/\/ This field is only used for display purpose.\n\tCString m_sLastRequest;\n};\n\nvoid CRouteTimeout::RunJob()\n{\n\tCRouteRepliesMod *pMod = (CRouteRepliesMod *) m_pModule;\n\tpMod->Timeout();\n}\n\ntemplate<> void TModInfo<CRouteRepliesMod>(CModInfo& Info) {\n\tInfo.SetWikiPage(\"route_replies\");\n}\n\nNETWORKMODULEDEFS(CRouteRepliesMod, \"Send replies (e.g. to \/who) to the right client only\")\n<commit_msg>route_replies: Handle raw 482<commit_after>\/*\n * Copyright (C) 2004-2011 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\/znc.h>\n#include <znc\/IRCNetwork.h>\n#include <znc\/IRCSock.h>\n\nstruct reply {\n\tconst char *szReply;\n\tbool bLastResponse;\n};\n\n\/\/ TODO this list is far from complete, no errors are handled\nstatic const struct {\n\tconst char *szRequest;\n\tstruct reply vReplies[10];\n} vRouteReplies[] = {\n\t{\"WHO\", {\n\t\t{\"352\", false},\n\t\t{\"354\", false}, \/\/ e.g. Quaknet uses this for WHO #chan %n\n\t\t{\"403\", true}, \/\/ No such chan\n\t\t{\"315\", true},\n\t\t{NULL, true}\n\t}},\n\t{\"LIST\", {\n\t\t{\"321\", false},\n\t\t{\"322\", false},\n\t\t{\"323\", true},\n\t\t{NULL, true}\n\t}},\n\t{\"NAMES\", {\n\t\t{\"353\", false},\n\t\t{\"366\", true},\n\t\t\/\/ No such nick\/channel\n\t\t{\"401\", true},\n\t\t{NULL, true},\n\t}},\n\t{\"LUSERS\", {\n\t\t{\"251\", false},\n\t\t{\"252\", false},\n\t\t{\"253\", false},\n\t\t{\"254\", false},\n\t\t{\"255\", false},\n\t\t{\"265\", false},\n\t\t{\"266\", true},\n\t\t\/\/ We don't handle 250 here since some IRCds don't sent it\n\t\t\/\/{\"250\", true},\n\t\t{NULL, true}\n\t}},\n\t{\"WHOIS\", {\n\t\t{\"311\", false},\n\t\t{\"319\", false},\n\t\t{\"312\", false},\n\t\t\/\/ \"<ip> :actually using host\"\n\t\t{\"338\", false},\n\t\t{\"318\", true},\n\t\t\/\/ No such nick\/channel\n\t\t{\"401\", true},\n\t\t\/\/ No such server\n\t\t{\"402\", true},\n\t\t{NULL, true}\n\t}},\n\t{\"PING\", {\n\t\t{\"PONG\", true},\n\t\t{NULL, true}\n\t}},\n\t{\"USERHOST\", {\n\t\t{\"302\", true},\n\t\t{NULL, true}\n\t}},\n\t{\"TIME\", {\n\t\t{\"391\", true},\n\t\t{NULL, true}\n\t}},\n\t{\"WHOWAS\", {\n\t\t{\"312\", false},\n\t\t{\"314\", false},\n\t\t{\"369\", true},\n\t\t{NULL, true}\n\t}},\n\t{\"ISON\", {\n\t\t{\"303\", true},\n\t\t{NULL, true}\n\t}},\n\t{\"LINKS\", {\n\t\t{\"364\", false},\n\t\t{\"365\", true},\n\t\t{NULL, true}\n\t}},\n\t{\"MAP\", {\n\t\t{\"006\", false},\n\t\t\/\/ inspircd\n\t\t{\"270\", false},\n\t\t\/\/ SilverLeo wants this two added\n\t\t{\"015\", false},\n\t\t{\"017\", true},\n\t\t{\"007\", true},\n\t\t{NULL, true}\n\t}},\n\t{\"TRACE\", {\n\t\t{\"200\", false},\n\t\t{\"205\", false},\n\t\t{\"262\", true},\n\t\t{NULL, true}\n\t}},\n\t{\"USERS\", {\n\t\t{\"265\", false},\n\t\t{\"266\", true},\n\t\t{NULL, true},\n\t}},\n\t\/\/ This is just a list of all possible \/mode replies stuffed together.\n\t\/\/ Since there should never be more than one of these going on, this\n\t\/\/ should work fine and makes the code simpler.\n\t{\"MODE\", {\n\t\t\/\/ \"You're not a channel operator\"\n\t\t{\"482\", true},\n\t\t\/\/ MODE I\n\t\t{\"346\", false},\n\t\t{\"347\", true},\n\t\t\/\/ MODE b\n\t\t{\"367\", false},\n\t\t{\"368\", true},\n\t\t\/\/ MODE e\n\t\t{\"348\", false},\n\t\t{\"349\", true},\n\t\t{NULL, true},\n\t }},\n\t\/\/ END (last item!)\n\t{NULL, {{NULL, true}}}\n};\n\nclass CRouteTimeout : public CTimer {\npublic:\n\tCRouteTimeout(CModule* pModule, unsigned int uInterval, unsigned int uCycles,\n\t\t\tconst CString& sLabel, const CString& sDescription)\n\t\t: CTimer(pModule, uInterval, uCycles, sLabel, sDescription) {}\n\tvirtual ~CRouteTimeout() {}\n\nprotected:\n\tvirtual void RunJob();\n};\n\nstruct queued_req {\n\tCString sLine;\n\tconst struct reply *reply;\n};\n\ntypedef std::map<CClient *, std::vector<struct queued_req> > requestQueue;\n\nclass CRouteRepliesMod : public CModule\n{\npublic:\n\tMODCONSTRUCTOR(CRouteRepliesMod)\n\t{\n\t\tm_pDoing = NULL;\n\t\tm_pReplies = NULL;\n\t}\n\n\tvirtual ~CRouteRepliesMod() {\n\t\trequestQueue::iterator it;\n\n\t\twhile (!m_vsPending.empty()) {\n\t\t\tit = m_vsPending.begin();\n\n\t\t\twhile (!it->second.empty()) {\n\t\t\t\tPutIRC(it->second[0].sLine);\n\t\t\t\tit->second.erase(it->second.begin());\n\t\t\t}\n\n\t\t\tm_vsPending.erase(it);\n\t\t}\n\t}\n\n\tvirtual void OnIRCConnected()\n\t{\n\t\tm_pDoing = NULL;\n\t\tm_pReplies = NULL;\n\t\tm_vsPending.clear();\n\n\t\t\/\/ No way we get a reply, so stop the timer (If it's running)\n\t\tRemTimer(\"RouteTimeout\");\n\t}\n\n\tvirtual void OnIRCDisconnected()\n\t{\n\t\tOnIRCConnected(); \/\/ Let's keep it in one place\n\t}\n\n\tvirtual void OnClientDisconnect()\n\t{\n\t\trequestQueue::iterator it;\n\n\t\tif (m_pClient == m_pDoing) {\n\t\t\t\/\/ The replies which aren't received yet will be\n\t\t\t\/\/ broadcasted to everyone, but at least nothing breaks\n\t\t\tRemTimer(\"RouteTimeout\");\n\t\t\tm_pDoing = NULL;\n\t\t\tm_pReplies = NULL;\n\t\t}\n\n\t\tit = m_vsPending.find(m_pClient);\n\n\t\tif (it != m_vsPending.end())\n\t\t\tm_vsPending.erase(it);\n\n\t\tSendRequest();\n\t}\n\n\tvirtual EModRet OnRaw(CString& sLine)\n\t{\n\t\tCString sCmd = sLine.Token(1).AsUpper();\n\t\tsize_t i = 0;\n\n\t\tif (!m_pReplies)\n\t\t\treturn CONTINUE;\n\n\t\t\/\/ Is this a \"not enough arguments\" error?\n\t\tif (sCmd == \"461\") {\n\t\t\t\/\/ :server 461 nick WHO :Not enough parameters\n\t\t\tCString sOrigCmd = sLine.Token(3);\n\n\t\t\tif (m_sLastRequest.Token(0).Equals(sOrigCmd)) {\n\t\t\t\t\/\/ This is the reply to the last request\n\t\t\t\tif (RouteReply(sLine, true))\n\t\t\t\t\treturn HALTCORE;\n\t\t\t\treturn CONTINUE;\n\t\t\t}\n\t\t}\n\n\t\twhile (m_pReplies[i].szReply != NULL) {\n\t\t\tif (m_pReplies[i].szReply == sCmd) {\n\t\t\t\tif (RouteReply(sLine, m_pReplies[i].bLastResponse, sCmd == \"353\"))\n\t\t\t\t\treturn HALTCORE;\n\t\t\t\treturn CONTINUE;\n\t\t\t}\n\t\t\ti++;\n\t\t}\n\n\t\t\/\/ TODO HALTCORE is wrong, it should not be passed to\n\t\t\/\/ the clients, but the core itself should still handle it!\n\n\t\treturn CONTINUE;\n\t}\n\n\tvirtual EModRet OnUserRaw(CString& sLine)\n\t{\n\t\tCString sCmd = sLine.Token(0).AsUpper();\n\n\t\tif (!m_pNetwork->GetIRCSock())\n\t\t\treturn CONTINUE;\n\n\t\tif (sCmd.Equals(\"MODE\")) {\n\t\t\t\/\/ Check if this is a mode request that needs to be handled\n\n\t\t\t\/\/ If there are arguments to a mode change,\n\t\t\t\/\/ we must not route it.\n\t\t\tif (!sLine.Token(3, true).empty())\n\t\t\t\treturn CONTINUE;\n\n\t\t\t\/\/ Grab the mode change parameter\n\t\t\tCString sMode = sLine.Token(2);\n\n\t\t\t\/\/ If this is a channel mode request, znc core replies to it\n\t\t\tif (sMode.empty())\n\t\t\t\treturn CONTINUE;\n\n\t\t\t\/\/ Check if this is a mode change or a specific\n\t\t\t\/\/ mode request (the later needs to be routed).\n\t\t\tsMode.TrimPrefix(\"+\");\n\t\t\tif (sMode.length() != 1)\n\t\t\t\treturn CONTINUE;\n\n\t\t\t\/\/ Now just check if it's one of the supported modes\n\t\t\tswitch (sMode[0]) {\n\t\t\tcase 'I':\n\t\t\tcase 'b':\n\t\t\tcase 'e':\n\t\t\t\tbreak;\n\t\t\tdefault:\n\t\t\t\treturn CONTINUE;\n\t\t\t}\n\n\t\t\t\/\/ Ok, this looks like we should route it.\n\t\t\t\/\/ Fall through to the next loop\n\t\t}\n\n\t\tfor (size_t i = 0; vRouteReplies[i].szRequest != NULL; i++) {\n\t\t\tif (vRouteReplies[i].szRequest == sCmd) {\n\t\t\t\tstruct queued_req req = {\n\t\t\t\t\tsLine, vRouteReplies[i].vReplies\n\t\t\t\t};\n\t\t\t\tm_vsPending[m_pClient].push_back(req);\n\t\t\t\tSendRequest();\n\n\t\t\t\treturn HALTCORE;\n\t\t\t}\n\t\t}\n\n\t\treturn CONTINUE;\n\t}\n\n\tvoid Timeout()\n\t{\n\t\t\/\/ The timer will be deleted after this by the event loop\n\n\t\tif (GetNV(\"silent_timeouts\") != \"yes\") {\n\t\t\tPutModule(\"This module hit a timeout which is possibly a bug.\");\n\t\t\tPutModule(\"To disable this message, do \\\"\/msg \" + GetModNick()\n\t\t\t\t\t+ \" silent yes\\\"\");\n\t\t\tPutModule(\"Last request: \" + m_sLastRequest);\n\t\t\tPutModule(\"Expected replies: \");\n\n\t\t\tfor (size_t i = 0; m_pReplies[i].szReply != NULL; i++) {\n\t\t\t\tif (m_pReplies[i].bLastResponse)\n\t\t\t\t\tPutModule(m_pReplies[i].szReply +\n\t\t\t\t\t\t\tCString(\" (last)\"));\n\t\t\t\telse\n\t\t\t\t\tPutModule(m_pReplies[i].szReply);\n\t\t\t}\n\t\t}\n\n\t\tm_pDoing = NULL;\n\t\tm_pReplies = NULL;\n\t\tSendRequest();\n\t}\n\nprivate:\n\tbool RouteReply(const CString& sLine, bool bFinished = false, bool bIsRaw353 = false)\n\t{\n\t\tif (!m_pDoing)\n\t\t\treturn false;\n\n\t\t\/\/ 353 needs special treatment due to NAMESX and UHNAMES\n\t\tif (bIsRaw353)\n\t\t\tm_pNetwork->GetIRCSock()->ForwardRaw353(sLine, m_pDoing);\n\t\telse\n\t\t\tm_pDoing->PutClient(sLine);\n\n\t\tif (bFinished) {\n\t\t\t\/\/ Stop the timeout\n\t\t\tRemTimer(\"RouteTimeout\");\n\n\t\t\tm_pDoing = NULL;\n\t\t\tm_pReplies = NULL;\n\t\t\tSendRequest();\n\t\t}\n\n\t\treturn true;\n\t}\n\n\tvoid SendRequest()\n\t{\n\t\trequestQueue::iterator it;\n\n\t\tif (m_pDoing || m_pReplies)\n\t\t\treturn;\n\n\t\tif (m_vsPending.empty())\n\t\t\treturn;\n\n\t\tit = m_vsPending.begin();\n\n\t\tif (it->second.empty()) {\n\t\t\tm_vsPending.erase(it);\n\t\t\tSendRequest();\n\t\t\treturn;\n\t\t}\n\n\t\t\/\/ When we are called from the timer, we need to remove it.\n\t\t\/\/ We can't delete it (segfault on return), thus we\n\t\t\/\/ just stop it. The main loop will delete it.\n\t\tCTimer *pTimer = FindTimer(\"RouteTimeout\");\n\t\tif (pTimer) {\n\t\t\tpTimer->Stop();\n\t\t\tUnlinkTimer(pTimer);\n\t\t}\n\t\tAddTimer(new CRouteTimeout(this, 60, 1, \"RouteTimeout\",\n\t\t\t\t\"Recover from missing \/ wrong server replies\"));\n\n\t\tm_pDoing = it->first;\n\t\tm_pReplies = it->second[0].reply;\n\t\tm_sLastRequest = it->second[0].sLine;\n\t\tPutIRC(it->second[0].sLine);\n\t\tit->second.erase(it->second.begin());\n\t}\n\n\tvirtual void OnModCommand(const CString& sCommand) {\n\t\tconst CString sCmd = sCommand.Token(0);\n\t\tconst CString sArgs = sCommand.Token(1, true);\n\n\t\tif (sCmd.Equals(\"silent\")) {\n\t\t\tif (sArgs.Equals(\"yes\")) {\n\t\t\t\tSetNV(\"silent_timeouts\", \"yes\");\n\t\t\t\tPutModule(\"Disabled timeout messages\");\n\t\t\t} else if (sArgs.Equals(\"no\")) {\n\t\t\t\tDelNV(\"silent_timeouts\");\n\t\t\t\tPutModule(\"Enabled timeout messages\");\n\t\t\t} else if (sArgs.empty()) {\n\t\t\t\tif (GetNV(\"silent_timeouts\") == \"yes\")\n\t\t\t\t\tPutModule(\"Timeout messages are disabled\");\n\t\t\t\telse\n\t\t\t\t\tPutModule(\"Timeout message are enabled\");\n\t\t\t} else\n\t\t\t\tPutModule(\"Invalid argument\");\n\t\t} else {\n\t\t\tPutModule(\"Available commands: silent [yes\/no], silent\");\n\t\t}\n\t}\n\n\tCClient *m_pDoing;\n\tconst struct reply *m_pReplies;\n\trequestQueue m_vsPending;\n\t\/\/ This field is only used for display purpose.\n\tCString m_sLastRequest;\n};\n\nvoid CRouteTimeout::RunJob()\n{\n\tCRouteRepliesMod *pMod = (CRouteRepliesMod *) m_pModule;\n\tpMod->Timeout();\n}\n\ntemplate<> void TModInfo<CRouteRepliesMod>(CModInfo& Info) {\n\tInfo.SetWikiPage(\"route_replies\");\n}\n\nNETWORKMODULEDEFS(CRouteRepliesMod, \"Send replies (e.g. to \/who) to the right client only\")\n<|endoftext|>"} {"text":"<commit_before>#ifndef DUNE_STUFF_FUNCTION_FIXED_HH\n#define DUNE_STUFF_FUNCTION_FIXED_HH\n\n#include <dune\/common\/shared_ptr.hh>\n#include <dune\/common\/exceptions.hh>\n\n#include \"interface.hh\"\n#include <dune\/stuff\/common\/parameter.hh>\n#include <dune\/stuff\/common\/color.hh>\n\nnamespace Dune {\nnamespace Stuff {\nnamespace Function {\n\n\ntemplate< class DomainFieldImp, int domainDim, class RangeFieldImp, int rangeDim >\nclass Fixed\n : public Interface< DomainFieldImp, domainDim, RangeFieldImp, rangeDim >\n{\npublic:\n typedef Fixed< DomainFieldImp, domainDim, RangeFieldImp, rangeDim > ThisType;\n typedef Interface< DomainFieldImp, domainDim, RangeFieldImp, rangeDim > BaseType;\n\n typedef typename BaseType::DomainFieldType DomainFieldType;\n static const int dimDomain = BaseType::dimDomain;\n typedef typename BaseType::DomainType DomainType;\n typedef typename BaseType::RangeFieldType RangeFieldType;\n static const int dimRange = BaseType::dimRange;\n typedef typename BaseType::RangeType RangeType;\n typedef typename BaseType::ParamType ParamType;\n\n static std::string id()\n {\n return BaseType::id() + \".fixed\";\n }\n\n Fixed(const Dune::shared_ptr< const BaseType > parametricFunction,\n const ParamType fixedParameter = ParamType())\n : wrappedFunction_(parametricFunction)\n , fixedParam_(fixedParameter)\n {\n DUNE_THROW(Dune::InvalidStateException,\n \"\\n\" << Dune::Stuff::Common::colorStringRed(\"ERROR:\")\n << \" given parameter has wrong size (is \" << fixedParam_.size()\n << \", should be \" << wrappedFunction_->paramSize() << \")!\");\n }\n\n virtual bool parametric() const\n {\n return false;\n }\n\n virtual std::string name() const\n {\n return \"fixed '\" + wrappedFunction_->name() + \"' for parameter '\" + Dune::Stuff::Common::Parameter::report(fixedParam_);\n }\n\n virtual int order() const\n {\n return wrappedFunction_->order();\n }\n\n virtual void evaluate(const DomainType& x, RangeType& ret) const\n {\n wrappedFunction_->evaluate(x, fixedParam_, ret);\n }\n\nprivate:\n const Dune::shared_ptr< const BaseType > wrappedFunction_;\n const ParamType fixedParam_;\n}; \/\/ class Fixed\n\n\n} \/\/ namespace Function\n} \/\/ namespace Stuff\n} \/\/ namespace Dune\n\n#endif \/\/ DUNE_STUFF_FUNCTION_FIXED_HH\n<commit_msg>[function.fixed] fixed unconditional throw<commit_after>#ifndef DUNE_STUFF_FUNCTION_FIXED_HH\n#define DUNE_STUFF_FUNCTION_FIXED_HH\n\n#include <dune\/common\/shared_ptr.hh>\n#include <dune\/common\/exceptions.hh>\n\n#include \"interface.hh\"\n#include <dune\/stuff\/common\/parameter.hh>\n#include <dune\/stuff\/common\/color.hh>\n\nnamespace Dune {\nnamespace Stuff {\nnamespace Function {\n\n\ntemplate< class DomainFieldImp, int domainDim, class RangeFieldImp, int rangeDim >\nclass Fixed\n : public Interface< DomainFieldImp, domainDim, RangeFieldImp, rangeDim >\n{\npublic:\n typedef Fixed< DomainFieldImp, domainDim, RangeFieldImp, rangeDim > ThisType;\n typedef Interface< DomainFieldImp, domainDim, RangeFieldImp, rangeDim > BaseType;\n\n typedef typename BaseType::DomainFieldType DomainFieldType;\n static const int dimDomain = BaseType::dimDomain;\n typedef typename BaseType::DomainType DomainType;\n typedef typename BaseType::RangeFieldType RangeFieldType;\n static const int dimRange = BaseType::dimRange;\n typedef typename BaseType::RangeType RangeType;\n typedef typename BaseType::ParamType ParamType;\n\n static std::string id()\n {\n return BaseType::id() + \".fixed\";\n }\n\n Fixed(const Dune::shared_ptr< const BaseType > parametricFunction,\n const ParamType fixedParameter = ParamType())\n : wrappedFunction_(parametricFunction)\n , fixedParam_(fixedParameter)\n {\n if (fixedParam_.size() != wrappedFunction_->paramSize())\n DUNE_THROW(Dune::InvalidStateException,\n \"\\n\" << Dune::Stuff::Common::colorStringRed(\"ERROR:\")\n << \" given parameter has wrong size (is \" << fixedParam_.size()\n << \", should be \" << wrappedFunction_->paramSize() << \")!\");\n }\n\n virtual bool parametric() const\n {\n return false;\n }\n\n virtual std::string name() const\n {\n return \"fixed '\" + wrappedFunction_->name() + \"' for parameter '\" + Dune::Stuff::Common::Parameter::report(fixedParam_);\n }\n\n virtual int order() const\n {\n return wrappedFunction_->order();\n }\n\n virtual void evaluate(const DomainType& x, RangeType& ret) const\n {\n wrappedFunction_->evaluate(x, fixedParam_, ret);\n }\n\nprivate:\n const Dune::shared_ptr< const BaseType > wrappedFunction_;\n const ParamType fixedParam_;\n}; \/\/ class Fixed\n\n\n} \/\/ namespace Function\n} \/\/ namespace Stuff\n} \/\/ namespace Dune\n\n#endif \/\/ DUNE_STUFF_FUNCTION_FIXED_HH\n<|endoftext|>"} {"text":"<commit_before>\/*************************************************************************\n *\n * $RCSfile: XMLIndexTemplateContext.hxx,v $\n *\n * $Revision: 1.5 $\n *\n * last change: $Author: rt $ $Date: 2004-07-13 08:33: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#ifndef _XMLOFF_XMLINDEXTEMPLATECONTEXT_HXX_\n#define _XMLOFF_XMLINDEXTEMPLATECONTEXT_HXX_\n\n#ifndef _XMLOFF_XMLICTXT_HXX\n#include \"xmlictxt.hxx\"\n#endif\n\n#ifndef _XMLOFF_XMLTOKEN_HXX\n#include \"xmltoken.hxx\"\n#endif\n\n#include <vector>\n\n#ifndef _COM_SUN_STAR_UNO_REFERENCE_H_\n#include <com\/sun\/star\/uno\/Reference.h>\n#endif\n\n#ifndef _COM_SUN_STAR_UNO_SEQUENCE_H_\n#include <com\/sun\/star\/uno\/Sequence.h>\n#endif\n\n#ifndef _COM_SUN_STAR_BEANS_PROPERTYVALUES_HPP_\n#include <com\/sun\/star\/beans\/PropertyValues.hpp>\n#endif\n\n\nnamespace com { namespace sun { namespace star {\n namespace xml { namespace sax { class XAttributeList; } }\n namespace beans { class XPropertySet; }\n} } }\nnamespace rtl { class OUString; }\nstruct SvXMLEnumMapEntry;\n\n\n\/\/ constants for the XMLIndexTemplateContext constructor\n\n\/\/ TOC and user defined index:\nextern const SvXMLEnumMapEntry aLevelNameTOCMap[];\nextern const sal_Char* aLevelStylePropNameTOCMap[];\nextern const sal_Bool aAllowedTokenTypesTOC[];\nextern const sal_Bool aAllowedTokenTypesUser[];\n\n\/\/ alphabetical index:\nextern const SvXMLEnumMapEntry aLevelNameAlphaMap[];\nextern const sal_Char* aLevelStylePropNameAlphaMap[];\nextern const sal_Bool aAllowedTokenTypesAlpha[];\n\n\/\/ bibliography:\nextern const SvXMLEnumMapEntry aLevelNameBibliographyMap[];\nextern const sal_Char* aLevelStylePropNameBibliographyMap[];\nextern const sal_Bool aAllowedTokenTypesBibliography[];\n\n\/\/ table, illustration and object tables:\nextern const SvXMLEnumMapEntry* aLevelNameTableMap; \/\/ NULL: no outline-level\nextern const sal_Char* aLevelStylePropNameTableMap[];\nextern const sal_Bool aAllowedTokenTypesTable[];\n\n\n\/**\n * Import index entry templates\n *\/\nclass XMLIndexTemplateContext : public SvXMLImportContext\n{\n \/\/ pick up PropertyValues to be turned into a sequence.\n ::std::vector< ::com::sun::star::beans::PropertyValues > aValueVector;\n\n ::rtl::OUString sStyleName;\n\n const SvXMLEnumMapEntry* pOutlineLevelNameMap;\n enum ::xmloff::token::XMLTokenEnum eOutlineLevelAttrName;\n const sal_Char** pOutlineLevelStylePropMap;\n const sal_Bool* pAllowedTokenTypesMap;\n\n sal_Int32 nOutlineLevel;\n sal_Bool bStyleNameOK;\n sal_Bool bOutlineLevelOK;\n sal_Bool bTOC;\n\n \/\/ PropertySet of current index\n ::com::sun::star::uno::Reference<\n ::com::sun::star::beans::XPropertySet> & rPropertySet;\n\npublic:\n\n \/\/ constants made available to other contexts (template entry\n \/\/ contexts, in particular)\n const ::rtl::OUString sTokenEntryNumber;\n const ::rtl::OUString sTokenEntryText;\n const ::rtl::OUString sTokenTabStop;\n const ::rtl::OUString sTokenText;\n const ::rtl::OUString sTokenPageNumber;\n const ::rtl::OUString sTokenChapterInfo;\n const ::rtl::OUString sTokenHyperlinkStart;\n const ::rtl::OUString sTokenHyperlinkEnd;\n const ::rtl::OUString sTokenBibliographyDataField;\n\n const ::rtl::OUString sCharacterStyleName;\n const ::rtl::OUString sTokenType;\n const ::rtl::OUString sText;\n const ::rtl::OUString sTabStopRightAligned;\n const ::rtl::OUString sTabStopPosition;\n const ::rtl::OUString sTabStopFillCharacter;\n const ::rtl::OUString sBibliographyDataField;\n const ::rtl::OUString sChapterFormat;\n\n const ::rtl::OUString sLevelFormat;\n const ::rtl::OUString sParaStyleLevel;\n\n\n TYPEINFO();\n\n XMLIndexTemplateContext(\n SvXMLImport& rImport,\n ::com::sun::star::uno::Reference<\n ::com::sun::star::beans::XPropertySet> & rPropSet,\n sal_uInt16 nPrfx,\n const ::rtl::OUString& rLocalName,\n const SvXMLEnumMapEntry* aLevelNameMap,\n enum ::xmloff::token::XMLTokenEnum eLevelAttrName,\n const sal_Char** aLevelStylePropNameMap,\n const sal_Bool* aAllowedTokenTypes,\n sal_Bool bTOC=sal_False);\n\n ~XMLIndexTemplateContext();\n\n \/** add template; to be called by child template entry contexts *\/\n void addTemplateEntry(\n const ::com::sun::star::beans::PropertyValues& aValues);\n\nprotected:\n\n virtual void StartElement(\n const ::com::sun::star::uno::Reference<\n ::com::sun::star::xml::sax::XAttributeList> & xAttrList);\n\n virtual void EndElement();\n\n virtual SvXMLImportContext *CreateChildContext(\n sal_uInt16 nPrefix,\n const ::rtl::OUString& rLocalName,\n const ::com::sun::star::uno::Reference<\n ::com::sun::star::xml::sax::XAttributeList> & xAttrList );\n};\n\n#endif\n<commit_msg>INTEGRATION: CWS ooo19126 (1.5.298); FILE MERGED 2005\/09\/05 14:39:55 rt 1.5.298.1: #i54170# Change license header: remove SISSL<commit_after>\/*************************************************************************\n *\n * OpenOffice.org - a multi-platform office productivity suite\n *\n * $RCSfile: XMLIndexTemplateContext.hxx,v $\n *\n * $Revision: 1.6 $\n *\n * last change: $Author: rt $ $Date: 2005-09-09 15:12: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_XMLINDEXTEMPLATECONTEXT_HXX_\n#define _XMLOFF_XMLINDEXTEMPLATECONTEXT_HXX_\n\n#ifndef _XMLOFF_XMLICTXT_HXX\n#include \"xmlictxt.hxx\"\n#endif\n\n#ifndef _XMLOFF_XMLTOKEN_HXX\n#include \"xmltoken.hxx\"\n#endif\n\n#include <vector>\n\n#ifndef _COM_SUN_STAR_UNO_REFERENCE_H_\n#include <com\/sun\/star\/uno\/Reference.h>\n#endif\n\n#ifndef _COM_SUN_STAR_UNO_SEQUENCE_H_\n#include <com\/sun\/star\/uno\/Sequence.h>\n#endif\n\n#ifndef _COM_SUN_STAR_BEANS_PROPERTYVALUES_HPP_\n#include <com\/sun\/star\/beans\/PropertyValues.hpp>\n#endif\n\n\nnamespace com { namespace sun { namespace star {\n namespace xml { namespace sax { class XAttributeList; } }\n namespace beans { class XPropertySet; }\n} } }\nnamespace rtl { class OUString; }\nstruct SvXMLEnumMapEntry;\n\n\n\/\/ constants for the XMLIndexTemplateContext constructor\n\n\/\/ TOC and user defined index:\nextern const SvXMLEnumMapEntry aLevelNameTOCMap[];\nextern const sal_Char* aLevelStylePropNameTOCMap[];\nextern const sal_Bool aAllowedTokenTypesTOC[];\nextern const sal_Bool aAllowedTokenTypesUser[];\n\n\/\/ alphabetical index:\nextern const SvXMLEnumMapEntry aLevelNameAlphaMap[];\nextern const sal_Char* aLevelStylePropNameAlphaMap[];\nextern const sal_Bool aAllowedTokenTypesAlpha[];\n\n\/\/ bibliography:\nextern const SvXMLEnumMapEntry aLevelNameBibliographyMap[];\nextern const sal_Char* aLevelStylePropNameBibliographyMap[];\nextern const sal_Bool aAllowedTokenTypesBibliography[];\n\n\/\/ table, illustration and object tables:\nextern const SvXMLEnumMapEntry* aLevelNameTableMap; \/\/ NULL: no outline-level\nextern const sal_Char* aLevelStylePropNameTableMap[];\nextern const sal_Bool aAllowedTokenTypesTable[];\n\n\n\/**\n * Import index entry templates\n *\/\nclass XMLIndexTemplateContext : public SvXMLImportContext\n{\n \/\/ pick up PropertyValues to be turned into a sequence.\n ::std::vector< ::com::sun::star::beans::PropertyValues > aValueVector;\n\n ::rtl::OUString sStyleName;\n\n const SvXMLEnumMapEntry* pOutlineLevelNameMap;\n enum ::xmloff::token::XMLTokenEnum eOutlineLevelAttrName;\n const sal_Char** pOutlineLevelStylePropMap;\n const sal_Bool* pAllowedTokenTypesMap;\n\n sal_Int32 nOutlineLevel;\n sal_Bool bStyleNameOK;\n sal_Bool bOutlineLevelOK;\n sal_Bool bTOC;\n\n \/\/ PropertySet of current index\n ::com::sun::star::uno::Reference<\n ::com::sun::star::beans::XPropertySet> & rPropertySet;\n\npublic:\n\n \/\/ constants made available to other contexts (template entry\n \/\/ contexts, in particular)\n const ::rtl::OUString sTokenEntryNumber;\n const ::rtl::OUString sTokenEntryText;\n const ::rtl::OUString sTokenTabStop;\n const ::rtl::OUString sTokenText;\n const ::rtl::OUString sTokenPageNumber;\n const ::rtl::OUString sTokenChapterInfo;\n const ::rtl::OUString sTokenHyperlinkStart;\n const ::rtl::OUString sTokenHyperlinkEnd;\n const ::rtl::OUString sTokenBibliographyDataField;\n\n const ::rtl::OUString sCharacterStyleName;\n const ::rtl::OUString sTokenType;\n const ::rtl::OUString sText;\n const ::rtl::OUString sTabStopRightAligned;\n const ::rtl::OUString sTabStopPosition;\n const ::rtl::OUString sTabStopFillCharacter;\n const ::rtl::OUString sBibliographyDataField;\n const ::rtl::OUString sChapterFormat;\n\n const ::rtl::OUString sLevelFormat;\n const ::rtl::OUString sParaStyleLevel;\n\n\n TYPEINFO();\n\n XMLIndexTemplateContext(\n SvXMLImport& rImport,\n ::com::sun::star::uno::Reference<\n ::com::sun::star::beans::XPropertySet> & rPropSet,\n sal_uInt16 nPrfx,\n const ::rtl::OUString& rLocalName,\n const SvXMLEnumMapEntry* aLevelNameMap,\n enum ::xmloff::token::XMLTokenEnum eLevelAttrName,\n const sal_Char** aLevelStylePropNameMap,\n const sal_Bool* aAllowedTokenTypes,\n sal_Bool bTOC=sal_False);\n\n ~XMLIndexTemplateContext();\n\n \/** add template; to be called by child template entry contexts *\/\n void addTemplateEntry(\n const ::com::sun::star::beans::PropertyValues& aValues);\n\nprotected:\n\n virtual void StartElement(\n const ::com::sun::star::uno::Reference<\n ::com::sun::star::xml::sax::XAttributeList> & xAttrList);\n\n virtual void EndElement();\n\n virtual SvXMLImportContext *CreateChildContext(\n sal_uInt16 nPrefix,\n const ::rtl::OUString& rLocalName,\n const ::com::sun::star::uno::Reference<\n ::com::sun::star::xml::sax::XAttributeList> & xAttrList );\n};\n\n#endif\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 \"otbRPCSolver.h\"\n#include \"otbMacro.h\"\n\n#include \"vnl\/algo\/vnl_svd.h\"\n#include \"vnl\/algo\/vnl_matrix_inverse.h\"\n\n#include \"otbGDALRPCTransformer.h\"\n\nnamespace otb\n{\n\nusing PrecisionType = double;\nusing VectorType = vnl_vector<PrecisionType>;\nusing MatrixType = vnl_matrix<PrecisionType>;\nusing DiagonalMatrixType = vnl_diag_matrix<PrecisionType>;\n\nconst PrecisionType epsilon = 1e-7;\n\nvoid UpdateMatrix(const VectorType & f, \n const std::vector<PrecisionType> & x,\n const std::vector<PrecisionType> & y,\n const std::vector<PrecisionType> & z,\n MatrixType & M)\n{\n for(unsigned int i = 0; i < f.size(); i++)\n {\n M[i][0] = 1;\n M[i][1] = x[i];\n M[i][2] = y[i];\n M[i][3] = z[i];\n M[i][4] = x[i]*y[i];\n M[i][5] = x[i]*z[i];\n M[i][6] = y[i]*z[i];\n M[i][7] = x[i]*x[i];\n M[i][8] = y[i]*y[i];\n M[i][9] = z[i]*z[i];\n M[i][10] = x[i]*y[i]*z[i];\n M[i][11] = x[i]*x[i]*x[i];\n M[i][12] = x[i]*y[i]*y[i];\n M[i][13] = x[i]*z[i]*z[i];\n M[i][14] = x[i]*x[i]*y[i];\n M[i][15] = y[i]*y[i]*y[i];\n M[i][16] = y[i]*z[i]*z[i];\n M[i][17] = x[i]*x[i]*z[i];\n M[i][18] = y[i]*y[i]*z[i];\n M[i][19] = z[i]*z[i]*z[i];\n M[i][20] = -f[i]*x[i];\n M[i][21] = -f[i]*y[i];\n M[i][22] = -f[i]*z[i];\n M[i][23] = -f[i]*x[i]*y[i];\n M[i][24] = -f[i]*x[i]*z[i];\n M[i][25] = -f[i]*y[i]*z[i];\n M[i][26] = -f[i]*x[i]*x[i];\n M[i][27] = -f[i]*y[i]*y[i];\n M[i][28] = -f[i]*z[i]*z[i];\n M[i][29] = -f[i]*x[i]*y[i]*z[i];\n M[i][30] = -f[i]*x[i]*x[i]*x[i];\n M[i][31] = -f[i]*x[i]*y[i]*y[i];\n M[i][32] = -f[i]*x[i]*z[i]*z[i];\n M[i][33] = -f[i]*x[i]*x[i]*y[i];\n M[i][34] = -f[i]*y[i]*y[i]*y[i];\n M[i][35] = -f[i]*y[i]*z[i]*z[i];\n M[i][36] = -f[i]*x[i]*x[i]*z[i];\n M[i][37] = -f[i]*y[i]*y[i]*z[i];\n M[i][38] = -f[i]*z[i]*z[i]*z[i];\n }\n}\n\nvoid UpdateWeights(const std::vector<PrecisionType> & x,\n const std::vector<PrecisionType> & y,\n const std::vector<PrecisionType> & z,\n const VectorType & coeff,\n DiagonalMatrixType & W)\n{\n std::vector<PrecisionType> row(coeff.size());\n \n for(unsigned int i = 0; i < x.size(); i++)\n {\n W[i] = 0.;\n\n row[0] = 1;\n row[1] = x[i];\n row[2] = y[i];\n row[3] = z[i];\n row[4] = x[i]*y[i];\n row[5] = x[i]*z[i];\n row[6] = y[i]*z[i];\n row[7] = x[i]*x[i];\n row[8] = y[i]*y[i];\n row[9] = z[i]*z[i];\n row[10] = x[i]*y[i]*z[i];\n row[11] = x[i]*x[i]*x[i];\n row[12] = x[i]*y[i]*y[i];\n row[13] = x[i]*z[i]*z[i];\n row[14] = x[i]*x[i]*y[i];\n row[15] = y[i]*y[i]*y[i];\n row[16] = y[i]*z[i]*z[i];\n row[17] = x[i]*x[i]*z[i];\n row[18] = y[i]*y[i]*z[i];\n row[19] = z[i]*z[i]*z[i];\n\n for (unsigned int j =0; j < row.size(); j++)\n {\n W[i] += row[j]*coeff[j];\n }\n\n if(W[i] > epsilon)\n {\n W[i] = 1.0\/W[i];\n }\n }\n}\n\nvoid computeCoefficients(const std::vector<PrecisionType> & f, \n const std::vector<PrecisionType> & x,\n const std::vector<PrecisionType> & y,\n const std::vector<PrecisionType> & z,\n std::vector<PrecisionType> & outCoeffs)\n{\n auto numberOfPoints = f.size();\n\n \/\/ Iteratively reweighted least square\n\n MatrixType M(numberOfPoints, 39);\n VectorType r(numberOfPoints, numberOfPoints, f.data());\n DiagonalMatrixType weights(numberOfPoints, 1.);\n\n PrecisionType res = std::numeric_limits<PrecisionType>::max();\n VectorType coeffs;\n\n for (int i =0; i<10; i++)\n {\n if (res < epsilon)\n {\n break;\n }\n auto w2 = weights * weights;\n \n UpdateMatrix(r, x, y ,z ,M);\n\n vnl_svd<PrecisionType> svd(M.transpose()*w2*M);\n\n auto diag = svd.W();\n for (unsigned int idx = 0; idx < diag.size(); idx++)\n {\n if(diag[idx] > epsilon)\n {\n diag[idx] = 1.0\/diag[idx];\n }\n else\n {\n diag[idx] = 0.0;\n }\n }\n \n \/\/ \"svd.V() * diag * svd.U().transpose()\" is the inverse of M.transpose()*w2*M\n coeffs = svd.V() * diag * svd.U().transpose() * M.transpose()*w2*r;\n\n auto denominator = VectorType(&(coeffs[19]), 20);\n denominator[0] = 1;\n\n UpdateWeights( x, y ,z , denominator, weights);\n\n \/\/ compute the residual\n auto residual = M.transpose()*w2*(M*coeffs-r);\n\n auto residualValue = inner_product(residual,residual);\n }\n\n outCoeffs.assign(coeffs.begin(), coeffs.end());\n}\n\n\nvoid RPCSolver::Solve(const GCPsContainerType& gcpContainer, PrecisionType& rmsError, Projection::RPCParam& outputParams)\n{\n \/\/ By default, use elevation provided with ground control points\n bool useElevation = true;\n auto numberOfPoints = gcpContainer.size();\n\n std::vector<PrecisionType> colNorm;\n colNorm.reserve(numberOfPoints);\n \n std::vector<PrecisionType> lineNorm;\n lineNorm.reserve(numberOfPoints);\n\n std::vector<PrecisionType> lonNorm;\n lonNorm.reserve(numberOfPoints);\n \n std::vector<PrecisionType> latNorm;\n latNorm.reserve(numberOfPoints);\n \n std::vector<PrecisionType> altNorm;\n altNorm.reserve(numberOfPoints);\n \n \/\/ Check for enough points\n if (numberOfPoints < 20)\n {\n itkGenericExceptionMacro(<< \"At least 20 points are required to estimate the 40 parameters of a RPC model without elevation support, and 40 are required \"\n \"to estimate the 80 parameters of a RPC model with elevation support. Only \"\n << numberOfPoints << \" points were given.\");\n }\n\n \/\/ If not enough points are given for a proper estimation of RPC\n \/\/ with elevation support, disable elevation. This will result in\n \/\/ all coefficients related to elevation set to zero.\n if (numberOfPoints < 40)\n {\n otbGenericWarningMacro(\"Only \" << numberOfPoints << \" ground control points are provided, can not estimate a RPC model with elevation support (at \"\n \"least 40 points required). Elevation support will be disabled for RPC estimation. All \"\n \"coefficients related to elevation will be set to zero, and elevation will have no effect on the \"\n \"resulting transform.\");\n useElevation = false;\n }\n\n \/\/ Compute Offsets\n\n \/\/ Find the ground points center of mass\n PrecisionType accLat = 0.;\n PrecisionType accLon = 0.;\n PrecisionType accAlt = 0.;\n\n for (const auto & gcp : gcpContainer)\n {\n const auto & groundPoint = gcp.second;\n\n accLon += groundPoint[0];\n accLat += groundPoint[1];\n if (useElevation)\n {\n accAlt += groundPoint[2];\n }\n }\n\n Point3DType groundCenter;\n groundCenter[0] = accLon \/ numberOfPoints;\n groundCenter[1] = accLat \/numberOfPoints;\n groundCenter[2] = useElevation ? accAlt \/ numberOfPoints : 0.;\n\n\n PrecisionType minc = std::numeric_limits<PrecisionType>::max();\n PrecisionType minl = std::numeric_limits<PrecisionType>::max();\n PrecisionType maxc = std::numeric_limits<PrecisionType>::min();\n PrecisionType maxl = std::numeric_limits<PrecisionType>::min();\n\n for (const auto & gcp : gcpContainer)\n {\n const auto & imagePoint = gcp.first;\n\n minc = std::min(imagePoint[0], minl);\n maxc = std::max(imagePoint[0], maxc);\n\n minl = std::min(imagePoint[1], minl);\n maxl = std::max(imagePoint[1], maxl);\n }\n\n Point2DType imageCenter;\n imageCenter[0] = (minc + maxc -1)\/2.0;\n imageCenter[1] = (minl + maxl -1)\/2.0;\n\n auto height = std::abs(minl - maxl) +1;\n auto width = std::abs(minc - maxc) +1;\n\n PrecisionType maxDeltaLon = std::numeric_limits<PrecisionType>::min();\n PrecisionType maxDeltaLat = std::numeric_limits<PrecisionType>::min();\n PrecisionType maxDeltaAlt = std::numeric_limits<PrecisionType>::min();\n\n for (const auto & gcp : gcpContainer)\n {\n const auto & imagePoint = gcp.first;\n const auto & groundPoint = gcp.second;\n auto deltaLon = groundPoint[0] - groundCenter[0];\n auto deltaLat = groundPoint[1] - groundCenter[1];\n auto deltaAlt = useElevation ? groundPoint[2] - groundCenter[2] : 0.;\n auto alt = useElevation ? groundPoint[2] : 0.;\n\n maxDeltaLon = std::max(maxDeltaLon, std::abs(deltaLon));\n maxDeltaLat = std::max(maxDeltaLat, std::abs(deltaLat));\n maxDeltaAlt = std::max(maxDeltaAlt, std::abs(alt));\n\n colNorm.push_back( (imagePoint[0]- imageCenter[0] -0.5) \/ width * 2.);\n lineNorm.push_back( (imagePoint[1]- imageCenter[1] -0.5)\/ height * 2.);\n lonNorm.push_back(deltaLon);\n latNorm.push_back(deltaLat);\n altNorm.push_back(deltaAlt);\n }\n\n if(maxDeltaLat < 1.0)\n {\n maxDeltaLat = 1.0;\n }\n else\n {\n for (auto & lat: latNorm)\n {\n lat \/= maxDeltaLat;\n }\n }\n\n\n if(maxDeltaLon < 1.0)\n {\n maxDeltaLon = 1.0;\n }\n else\n {\n for (auto & lon: lonNorm)\n {\n lon \/= maxDeltaLon;\n }\n }\n\n if(maxDeltaAlt < 1.0) \n {\n maxDeltaAlt = 1.0;\n }\n else\n {\n for (auto & alt: altNorm)\n {\n alt \/= maxDeltaAlt;\n }\n }\n\n std::vector<PrecisionType> colCoeffs;\n computeCoefficients(colNorm, lonNorm, latNorm, altNorm, colCoeffs);\n\n std::vector<PrecisionType> lineCoeffs;\n computeCoefficients(lineNorm, lonNorm, latNorm, altNorm, lineCoeffs);\n\n \/\/ Offsets\n outputParams.SampleOffset = imageCenter[0];\n outputParams.LineOffset = imageCenter[1];\n outputParams.LonOffset = groundCenter[0];\n outputParams.LatOffset = groundCenter[1];\n outputParams.HeightOffset = groundCenter[2];\n\n \/\/ Scales\n outputParams.SampleScale = width\/2.0;\n outputParams.LineScale = height\/2.0;\n outputParams.LatScale = maxDeltaLat;\n outputParams.LonScale = maxDeltaLon;\n outputParams.HeightScale = maxDeltaAlt;\n\n \/\/ Line numerator coefficients\n std::copy(lineCoeffs.begin(), lineCoeffs.begin() +20, outputParams.LineNum);\n \/\/ Line denominator coefficients\n outputParams.LineDen[0] = 1.;\n std::copy(lineCoeffs.begin()+20, lineCoeffs.end(), outputParams.LineDen +1);\n \n \/\/ Sample numerator coefficients\n std::copy(colCoeffs.begin(), colCoeffs.begin() +20, outputParams.SampleNum);\n \/\/ Sample denominator coefficients\n outputParams.SampleDen[0] = 1.;\n std::copy(colCoeffs.begin()+20, colCoeffs.end(), outputParams.SampleDen +1);\n\n \/\/ Compute rmse between input ground point and transformed image points\n GDALRPCTransformer transformer(outputParams, false);\n \n PrecisionType rmseAcc = 0.;\n\n for (const auto & gcp : gcpContainer)\n {\n auto outPoint = transformer.InverseTransform(gcp.second);\n rmseAcc += (gcp.first[0] - outPoint[0]) * (gcp.first[0] - outPoint[0])\n + (gcp.first[1] - outPoint[1]) * (gcp.first[1] - outPoint[1]);\n }\n\n rmsError = std::sqrt(rmseAcc)\/numberOfPoints;\n}\n\n}<commit_msg>BUG: fix various bugs in RPCSolver<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 \"otbRPCSolver.h\"\n#include \"otbMacro.h\"\n\n#include \"vnl\/algo\/vnl_svd.h\"\n#include \"vnl\/algo\/vnl_matrix_inverse.h\"\n\n#include \"otbGDALRPCTransformer.h\"\n\nnamespace otb\n{\n\nusing PrecisionType = double;\nusing VectorType = vnl_vector<PrecisionType>;\nusing MatrixType = vnl_matrix<PrecisionType>;\nusing DiagonalMatrixType = vnl_diag_matrix<PrecisionType>;\n\nconst PrecisionType epsilon = 1e-7;\n\nvoid UpdateMatrix(const VectorType & f, \n const std::vector<PrecisionType> & x,\n const std::vector<PrecisionType> & y,\n const std::vector<PrecisionType> & z,\n MatrixType & M)\n{\n for(unsigned int i = 0; i < f.size(); i++)\n {\n M[i][0] = 1;\n M[i][1] = x[i];\n M[i][2] = y[i];\n M[i][3] = z[i];\n M[i][4] = x[i]*y[i];\n M[i][5] = x[i]*z[i];\n M[i][6] = y[i]*z[i];\n M[i][7] = x[i]*x[i];\n M[i][8] = y[i]*y[i];\n M[i][9] = z[i]*z[i];\n M[i][10] = x[i]*y[i]*z[i];\n M[i][11] = x[i]*x[i]*x[i];\n M[i][12] = x[i]*y[i]*y[i];\n M[i][13] = x[i]*z[i]*z[i];\n M[i][14] = x[i]*x[i]*y[i];\n M[i][15] = y[i]*y[i]*y[i];\n M[i][16] = y[i]*z[i]*z[i];\n M[i][17] = x[i]*x[i]*z[i];\n M[i][18] = y[i]*y[i]*z[i];\n M[i][19] = z[i]*z[i]*z[i];\n M[i][20] = -f[i]*x[i];\n M[i][21] = -f[i]*y[i];\n M[i][22] = -f[i]*z[i];\n M[i][23] = -f[i]*x[i]*y[i];\n M[i][24] = -f[i]*x[i]*z[i];\n M[i][25] = -f[i]*y[i]*z[i];\n M[i][26] = -f[i]*x[i]*x[i];\n M[i][27] = -f[i]*y[i]*y[i];\n M[i][28] = -f[i]*z[i]*z[i];\n M[i][29] = -f[i]*x[i]*y[i]*z[i];\n M[i][30] = -f[i]*x[i]*x[i]*x[i];\n M[i][31] = -f[i]*x[i]*y[i]*y[i];\n M[i][32] = -f[i]*x[i]*z[i]*z[i];\n M[i][33] = -f[i]*x[i]*x[i]*y[i];\n M[i][34] = -f[i]*y[i]*y[i]*y[i];\n M[i][35] = -f[i]*y[i]*z[i]*z[i];\n M[i][36] = -f[i]*x[i]*x[i]*z[i];\n M[i][37] = -f[i]*y[i]*y[i]*z[i];\n M[i][38] = -f[i]*z[i]*z[i]*z[i];\n }\n}\n\nvoid UpdateWeights(const std::vector<PrecisionType> & x,\n const std::vector<PrecisionType> & y,\n const std::vector<PrecisionType> & z,\n const VectorType & coeff,\n DiagonalMatrixType & W)\n{\n std::vector<PrecisionType> row(coeff.size());\n \n for(unsigned int i = 0; i < x.size(); i++)\n {\n W[i] = 0.;\n\n row[0] = 1;\n row[1] = x[i];\n row[2] = y[i];\n row[3] = z[i];\n row[4] = x[i]*y[i];\n row[5] = x[i]*z[i];\n row[6] = y[i]*z[i];\n row[7] = x[i]*x[i];\n row[8] = y[i]*y[i];\n row[9] = z[i]*z[i];\n row[10] = x[i]*y[i]*z[i];\n row[11] = x[i]*x[i]*x[i];\n row[12] = x[i]*y[i]*y[i];\n row[13] = x[i]*z[i]*z[i];\n row[14] = x[i]*x[i]*y[i];\n row[15] = y[i]*y[i]*y[i];\n row[16] = y[i]*z[i]*z[i];\n row[17] = x[i]*x[i]*z[i];\n row[18] = y[i]*y[i]*z[i];\n row[19] = z[i]*z[i]*z[i];\n\n for (unsigned int j =0; j < row.size(); j++)\n {\n W[i] += row[j]*coeff[j];\n }\n\n if(W[i] > epsilon)\n {\n W[i] = 1.0\/W[i];\n }\n }\n}\n\nvoid computeCoefficients(const std::vector<PrecisionType> & f, \n const std::vector<PrecisionType> & x,\n const std::vector<PrecisionType> & y,\n const std::vector<PrecisionType> & z,\n std::vector<PrecisionType> & outCoeffs)\n{\n auto numberOfPoints = f.size();\n\n \/\/ Iteratively reweighted least square\n\n MatrixType M(numberOfPoints, 39);\n VectorType r(numberOfPoints, numberOfPoints, f.data());\n DiagonalMatrixType weights(numberOfPoints, 1.);\n\n PrecisionType res = std::numeric_limits<PrecisionType>::max();\n VectorType coeffs;\n\n for (int i =0; i<10; i++)\n {\n if (res < epsilon)\n {\n break;\n }\n auto w2 = weights * weights;\n \n UpdateMatrix(r, x, y ,z ,M);\n\n vnl_svd<PrecisionType> svd(M.transpose()*w2*M);\n\n auto diag = svd.W();\n for (unsigned int idx = 0; idx < diag.size(); idx++)\n {\n if(diag[idx] > epsilon)\n {\n diag[idx] = 1.0\/diag[idx];\n }\n else\n {\n diag[idx] = 0.0;\n }\n }\n \n \/\/ \"svd.V() * diag * svd.U().transpose()\" is the inverse of M.transpose()*w2*M\n coeffs = svd.V() * diag * svd.U().transpose() * M.transpose()*w2*r;\n\n auto denominator = VectorType(&(coeffs[19]), 20);\n denominator[0] = 1;\n\n UpdateWeights( x, y ,z , denominator, weights);\n\n \/\/ compute the residual\n auto residual = M.transpose()*w2*(M*coeffs-r);\n\n res = inner_product(residual,residual);\n }\n\n outCoeffs.assign(coeffs.begin(), coeffs.end());\n}\n\n\nvoid RPCSolver::Solve(const GCPsContainerType& gcpContainer, PrecisionType& rmsError, Projection::RPCParam& outputParams)\n{\n \/\/ By default, use elevation provided with ground control points\n bool useElevation = true;\n auto numberOfPoints = gcpContainer.size();\n\n std::vector<PrecisionType> colNorm;\n colNorm.reserve(numberOfPoints);\n \n std::vector<PrecisionType> lineNorm;\n lineNorm.reserve(numberOfPoints);\n\n std::vector<PrecisionType> lonNorm;\n lonNorm.reserve(numberOfPoints);\n \n std::vector<PrecisionType> latNorm;\n latNorm.reserve(numberOfPoints);\n \n std::vector<PrecisionType> altNorm;\n altNorm.reserve(numberOfPoints);\n \n \/\/ Check for enough points\n if (numberOfPoints < 20)\n {\n itkGenericExceptionMacro(<< \"At least 20 points are required to estimate the 40 parameters of a RPC model without elevation support, and 40 are required \"\n \"to estimate the 80 parameters of a RPC model with elevation support. Only \"\n << numberOfPoints << \" points were given.\");\n }\n\n \/\/ If not enough points are given for a proper estimation of RPC\n \/\/ with elevation support, disable elevation. This will result in\n \/\/ all coefficients related to elevation set to zero.\n if (numberOfPoints < 40)\n {\n otbGenericWarningMacro(\"Only \" << numberOfPoints << \" ground control points are provided, can not estimate a RPC model with elevation support (at \"\n \"least 40 points required). Elevation support will be disabled for RPC estimation. All \"\n \"coefficients related to elevation will be set to zero, and elevation will have no effect on the \"\n \"resulting transform.\");\n useElevation = false;\n }\n\n \/\/ Compute Offsets\n\n \/\/ Find the ground points center of mass\n PrecisionType accLat = 0.;\n PrecisionType accLon = 0.;\n PrecisionType accAlt = 0.;\n\n for (const auto & gcp : gcpContainer)\n {\n const auto & groundPoint = gcp.second;\n\n accLon += groundPoint[0];\n accLat += groundPoint[1];\n if (useElevation)\n {\n accAlt += groundPoint[2];\n }\n }\n\n Point3DType groundCenter;\n groundCenter[0] = accLon \/ numberOfPoints;\n groundCenter[1] = accLat \/numberOfPoints;\n groundCenter[2] = useElevation ? accAlt \/ numberOfPoints : 0.;\n\n\n PrecisionType minc = std::numeric_limits<PrecisionType>::max();\n PrecisionType minl = std::numeric_limits<PrecisionType>::max();\n PrecisionType maxc = std::numeric_limits<PrecisionType>::min();\n PrecisionType maxl = std::numeric_limits<PrecisionType>::min();\n\n for (const auto & gcp : gcpContainer)\n {\n const auto & imagePoint = gcp.first;\n\n minc = std::min(imagePoint[0], minc);\n maxc = std::max(imagePoint[0], maxc);\n\n minl = std::min(imagePoint[1], minl);\n maxl = std::max(imagePoint[1], maxl);\n }\n\n Point2DType imageCenter;\n imageCenter[0] = (minc + maxc -1)\/2.0;\n imageCenter[1] = (minl + maxl -1)\/2.0;\n\n auto height = std::abs(minl - maxl) +1;\n auto width = std::abs(minc - maxc) +1;\n\n PrecisionType maxDeltaLon = std::numeric_limits<PrecisionType>::min();\n PrecisionType maxDeltaLat = std::numeric_limits<PrecisionType>::min();\n PrecisionType maxDeltaAlt = std::numeric_limits<PrecisionType>::min();\n\n for (const auto & gcp : gcpContainer)\n {\n const auto & imagePoint = gcp.first;\n const auto & groundPoint = gcp.second;\n auto deltaLon = groundPoint[0] - groundCenter[0];\n auto deltaLat = groundPoint[1] - groundCenter[1];\n auto deltaAlt = useElevation ? groundPoint[2] - groundCenter[2] : 0.;\n auto alt = useElevation ? groundPoint[2] : 0.;\n\n maxDeltaLon = std::max(maxDeltaLon, std::abs(deltaLon));\n maxDeltaLat = std::max(maxDeltaLat, std::abs(deltaLat));\n maxDeltaAlt = std::max(maxDeltaAlt, std::abs(alt));\n\n colNorm.push_back( (imagePoint[0]- imageCenter[0] -0.5) \/ width * 2.);\n lineNorm.push_back( (imagePoint[1]- imageCenter[1] -0.5)\/ height * 2.);\n lonNorm.push_back(deltaLon);\n latNorm.push_back(deltaLat);\n altNorm.push_back(deltaAlt);\n }\n\n if(maxDeltaLat < 1.0)\n {\n maxDeltaLat = 1.0;\n }\n else\n {\n for (auto & lat: latNorm)\n {\n lat \/= maxDeltaLat;\n }\n }\n\n\n if(maxDeltaLon < 1.0)\n {\n maxDeltaLon = 1.0;\n }\n else\n {\n for (auto & lon: lonNorm)\n {\n lon \/= maxDeltaLon;\n }\n }\n\n if(maxDeltaAlt < 1.0) \n {\n maxDeltaAlt = 1.0;\n }\n else\n {\n for (auto & alt: altNorm)\n {\n alt \/= maxDeltaAlt;\n }\n }\n\n std::vector<PrecisionType> colCoeffs;\n computeCoefficients(colNorm, lonNorm, latNorm, altNorm, colCoeffs);\n\n std::vector<PrecisionType> lineCoeffs;\n computeCoefficients(lineNorm, lonNorm, latNorm, altNorm, lineCoeffs);\n\n \/\/ Offsets\n outputParams.SampleOffset = imageCenter[0];\n outputParams.LineOffset = imageCenter[1];\n outputParams.LonOffset = groundCenter[0];\n outputParams.LatOffset = groundCenter[1];\n outputParams.HeightOffset = groundCenter[2];\n\n \/\/ Scales\n outputParams.SampleScale = width\/2.0;\n outputParams.LineScale = height\/2.0;\n outputParams.LatScale = maxDeltaLat;\n outputParams.LonScale = maxDeltaLon;\n outputParams.HeightScale = maxDeltaAlt;\n\n \/\/ Line numerator coefficients\n std::copy(lineCoeffs.begin(), lineCoeffs.begin() +20, outputParams.LineNum);\n \/\/ Line denominator coefficients\n outputParams.LineDen[0] = 1.;\n std::copy(lineCoeffs.begin()+20, lineCoeffs.end(), outputParams.LineDen +1);\n \n \/\/ Sample numerator coefficients\n std::copy(colCoeffs.begin(), colCoeffs.begin() +20, outputParams.SampleNum);\n \/\/ Sample denominator coefficients\n outputParams.SampleDen[0] = 1.;\n std::copy(colCoeffs.begin()+20, colCoeffs.end(), outputParams.SampleDen +1);\n\n \/\/ Compute rmse between input ground point and transformed image points\n GDALRPCTransformer transformer(outputParams, false);\n \n PrecisionType rmseAcc = 0.;\n\n for (const auto & gcp : gcpContainer)\n {\n auto outPoint = transformer.InverseTransform(gcp.second);\n rmseAcc += (gcp.first[0] - outPoint[0]) * (gcp.first[0] - outPoint[0])\n + (gcp.first[1] - outPoint[1]) * (gcp.first[1] - outPoint[1]);\n }\n\n rmsError = std::sqrt(rmseAcc\/numberOfPoints);\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 log(e.what());\n failedConnectionAttempts_++;\n step->fail(e.what());\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>Add date and time reminder to diagnostic screen<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](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<|endoftext|>"} {"text":"<commit_before>#include \"mitkPAIOUtil.h\"\n\n#include \"mitkIOUtil.h\"\n#include \"mitkImageReadAccessor.h\"\n\n#include <string>\n#include <sstream>\n#include <vector>\n\n#include \"mitkPAComposedVolume.h\"\n#include \"mitkPASlicedVolumeGenerator.h\"\n#include \"mitkPANoiseGenerator.h\"\n#include \"mitkPAVolumeManipulator.h\"\n#include <mitkProperties.h>\n#include <itkDirectory.h>\n#include <itksys\/SystemTools.hxx>\n\nstatic std::vector<int> splitString(const std::string &s, const char* delim) {\n std::vector<int> elems;\n std::stringstream ss(s);\n std::string item;\n while (std::getline(ss, item, *delim))\n {\n int numb;\n std::stringstream(item) >> numb;\n elems.push_back(numb);\n }\n return elems;\n}\n\nbool mitk::pa::IOUtil::DoesFileHaveEnding(std::string const &fullString, std::string const &ending) {\n if (fullString.length() == 0 || ending.length() == 0 || fullString.length() < ending.length())\n return false;\n\n return (0 == fullString.compare(fullString.length() - ending.length(), ending.length(), ending));\n}\n\nmitk::pa::IOUtil::IOUtil() {}\n\nmitk::pa::IOUtil::~IOUtil() {}\n\nmitk::pa::Volume::Pointer mitk::pa::IOUtil::LoadNrrd(std::string filename, double blur)\n{\n if (filename.empty() || filename == \"\")\n return nullptr;\n\n mitk::Image::Pointer inputImage = mitk::IOUtil::LoadImage(filename);\n\n if (inputImage.IsNull())\n return nullptr;\n\n auto returnImage = Volume::New(inputImage);\n\n VolumeManipulator::GaussianBlur3D(returnImage, blur);\n\n return returnImage;\n}\n\nstd::map<mitk::pa::IOUtil::Position, mitk::pa::Volume::Pointer>\nmitk::pa::IOUtil::LoadFluenceContributionMaps(std::string foldername, double blur, int* progress, bool doLog10)\n{\n std::map<IOUtil::Position, Volume::Pointer> resultMap;\n\n itk::Directory::Pointer directoryHandler = itk::Directory::New();\n directoryHandler->Load(foldername.c_str());\n for (unsigned int fileIndex = 0, numFiles = directoryHandler->GetNumberOfFiles(); fileIndex < numFiles; ++fileIndex)\n {\n std::string filename = std::string(directoryHandler->GetFile(fileIndex));\n if (itksys::SystemTools::FileIsDirectory(filename))\n continue;\n\n if (!DoesFileHaveEnding(filename, \".nrrd\"))\n continue;\n\n size_t s = filename.find(\"_p\");\n size_t e = filename.find(\"Fluence\", s);\n std::string sub = filename.substr(s + 2, e - s - 2);\n std::vector<int> coords = splitString(sub, \",\");\n\n if (coords.size() != 3)\n {\n MITK_ERROR << \"Some of the data to read was corrupted or did not match the \" <<\n \"naming pattern *_pN,N,NFluence*.nrrd\";\n mitkThrow() << \"Some of the data to read was corrupted or did not match the\" <<\n \" naming pattern *_pN,N,NFluence*.nrrd\";\n }\n else\n {\n MITK_DEBUG << \"Extracted coords: \" << coords[0] << \"|\" << coords[1] << \"|\" << coords[2] << \" from string \" << sub;\n Volume::Pointer nrrdFile = LoadNrrd(foldername + filename, blur);\n if (doLog10)\n VolumeManipulator::Log10Image(nrrdFile);\n resultMap[Position{ coords[0], coords[2] }] = nrrdFile;\n *progress = *progress + 1;\n }\n }\n\n return resultMap;\n}\n\nint mitk::pa::IOUtil::GetNumberOfNrrdFilesInDirectory(std::string directory)\n{\n return GetListOfAllNrrdFilesInDirectory(directory).size();\n}\n\nstd::vector<std::string> mitk::pa::IOUtil::GetListOfAllNrrdFilesInDirectory(std::string directory, bool keepFileFormat)\n{\n std::vector<std::string> filenames;\n itk::Directory::Pointer directoryHandler = itk::Directory::New();\n directoryHandler->Load(directory.c_str());\n for (unsigned int fileIndex = 0, numFiles = directoryHandler->GetNumberOfFiles(); fileIndex < numFiles; ++fileIndex)\n {\n std::string filename = std::string(directoryHandler->GetFile(fileIndex));\n if (itksys::SystemTools::FileIsDirectory(filename))\n continue;\n\n if (!DoesFileHaveEnding(filename, \".nrrd\"))\n continue;\n\n if (keepFileFormat)\n {\n filenames.push_back(filename);\n }\n else\n {\n filenames.push_back(filename.substr(0, filename.size() - 5));\n }\n }\n\n return filenames;\n}\n\nstd::vector<std::string> mitk::pa::IOUtil::GetAllChildfoldersFromFolder(std::string folderPath)\n{\n std::vector<std::string> returnVector;\n\n itksys::Directory directoryHandler;\n directoryHandler.Load(folderPath.c_str());\n for (unsigned int fileIndex = 0, numFiles = directoryHandler.GetNumberOfFiles(); fileIndex < numFiles; ++fileIndex)\n {\n std::string foldername = std::string(directoryHandler.GetFile(fileIndex));\n std::string filename = folderPath + \"\/\" + foldername;\n if (itksys::SystemTools::FileIsDirectory(filename))\n {\n if (foldername != std::string(\".\") && foldername != std::string(\"..\"))\n {\n MITK_INFO << filename;\n returnVector.push_back(filename);\n }\n continue;\n }\n\n \/\/If there is a nrrd file in the directory we assume that a bottom level directory was chosen.\n if (DoesFileHaveEnding(filename, \".nrrd\"))\n {\n returnVector.clear();\n returnVector.push_back(folderPath);\n return returnVector;\n }\n }\n\n return returnVector;\n}\n\nmitk::pa::InSilicoTissueVolume::Pointer mitk::pa::IOUtil::LoadInSilicoTissueVolumeFromNrrdFile(std::string nrrdFile)\n{\n MITK_INFO << \"Initializing ComposedVolume by nrrd...\";\n auto inputImage = mitk::IOUtil::Load<mitk::Image>(nrrdFile);\n\n auto tissueParameters = TissueGeneratorParameters::New();\n\n unsigned int xDim = inputImage->GetDimensions()[1];\n unsigned int yDim = inputImage->GetDimensions()[0];\n unsigned int zDim = inputImage->GetDimensions()[2];\n tissueParameters->SetXDim(xDim);\n tissueParameters->SetYDim(yDim);\n tissueParameters->SetZDim(zDim);\n\n double xSpacing = inputImage->GetGeometry(0)->GetSpacing()[1];\n double ySpacing = inputImage->GetGeometry(0)->GetSpacing()[0];\n double zSpacing = inputImage->GetGeometry(0)->GetSpacing()[2];\n\n if ((xSpacing - ySpacing) > mitk::eps || (xSpacing - zSpacing) > mitk::eps || (ySpacing - zSpacing) > mitk::eps)\n {\n throw mitk::Exception(\"Cannot handle unequal spacing.\");\n }\n\n tissueParameters->SetVoxelSpacingInCentimeters(xSpacing);\n\n mitk::PropertyList::Pointer propertyList = inputImage->GetPropertyList();\n\n mitk::ImageReadAccessor readAccess0(inputImage, inputImage->GetVolumeData(0));\n auto* m_AbsorptionArray = new double[xDim*yDim*zDim];\n memcpy(m_AbsorptionArray, readAccess0.GetData(), xDim*yDim*zDim * sizeof(double));\n auto absorptionVolume = Volume::New(m_AbsorptionArray, xDim, yDim, zDim, xSpacing);\n\n mitk::ImageReadAccessor readAccess1(inputImage, inputImage->GetVolumeData(1));\n auto* m_ScatteringArray = new double[xDim*yDim*zDim];\n memcpy(m_ScatteringArray, readAccess1.GetData(), xDim*yDim*zDim * sizeof(double));\n auto scatteringVolume = Volume::New(m_ScatteringArray, xDim, yDim, zDim, xSpacing);\n\n mitk::ImageReadAccessor readAccess2(inputImage, inputImage->GetVolumeData(2));\n auto* m_AnisotropyArray = new double[xDim*yDim*zDim];\n memcpy(m_AnisotropyArray, readAccess2.GetData(), xDim*yDim*zDim * sizeof(double));\n auto anisotropyVolume = Volume::New(m_AnisotropyArray, xDim, yDim, zDim, xSpacing);\n\n Volume::Pointer segmentationVolume;\n\n if (inputImage->GetDimension() == 4)\n {\n mitk::ImageReadAccessor readAccess3(inputImage, inputImage->GetVolumeData(3));\n auto* m_SegmentationArray = new double[xDim*yDim*zDim];\n memcpy(m_SegmentationArray, readAccess3.GetData(), xDim*yDim*zDim * sizeof(double));\n segmentationVolume = Volume::New(m_SegmentationArray, xDim, yDim, zDim, xSpacing);\n }\n\n return mitk::pa::InSilicoTissueVolume::New(absorptionVolume, scatteringVolume,\n anisotropyVolume, segmentationVolume, tissueParameters, propertyList);\n}\n\nmitk::pa::FluenceYOffsetPair::Pointer mitk::pa::IOUtil::LoadFluenceSimulation(std::string fluenceSimulation)\n{\n MITK_INFO << \"Adding slice...\";\n\n mitk::Image::Pointer inputImage = mitk::IOUtil::LoadImage(fluenceSimulation);\n\n auto yOffsetProperty = inputImage->GetProperty(\"y-offset\");\n\n if (yOffsetProperty.IsNull())\n mitkThrow() << \"No \\\"y-offset\\\" property found in fluence file!\";\n\n std::string yOff = yOffsetProperty->GetValueAsString();\n MITK_INFO << \"Reading y Offset: \" << yOff;\n#ifdef __linux__\n std::replace(yOff.begin(), yOff.end(), '.', ',');\n#endif \/\/ __linux__\n double yOffset = std::stod(yOff);\n MITK_INFO << \"Converted offset \" << yOffset;\n return FluenceYOffsetPair::New(Volume::New(inputImage), yOffset);\n}\n<commit_msg>fix mitkIOUtil call<commit_after>#include \"mitkPAIOUtil.h\"\n\n#include \"mitkIOUtil.h\"\n#include \"mitkImageReadAccessor.h\"\n\n#include <string>\n#include <sstream>\n#include <vector>\n\n#include \"mitkPAComposedVolume.h\"\n#include \"mitkPASlicedVolumeGenerator.h\"\n#include \"mitkPANoiseGenerator.h\"\n#include \"mitkPAVolumeManipulator.h\"\n#include <mitkProperties.h>\n#include <itkDirectory.h>\n#include <itksys\/SystemTools.hxx>\n\nstatic std::vector<int> splitString(const std::string &s, const char* delim) {\n std::vector<int> elems;\n std::stringstream ss(s);\n std::string item;\n while (std::getline(ss, item, *delim))\n {\n int numb;\n std::stringstream(item) >> numb;\n elems.push_back(numb);\n }\n return elems;\n}\n\nbool mitk::pa::IOUtil::DoesFileHaveEnding(std::string const &fullString, std::string const &ending) {\n if (fullString.length() == 0 || ending.length() == 0 || fullString.length() < ending.length())\n return false;\n\n return (0 == fullString.compare(fullString.length() - ending.length(), ending.length(), ending));\n}\n\nmitk::pa::IOUtil::IOUtil() {}\n\nmitk::pa::IOUtil::~IOUtil() {}\n\nmitk::pa::Volume::Pointer mitk::pa::IOUtil::LoadNrrd(std::string filename, double blur)\n{\n if (filename.empty() || filename == \"\")\n return nullptr;\n\n mitk::Image::Pointer inputImage = mitk::IOUtil::Load<mitk::Image>(filename);\n\n if (inputImage.IsNull())\n return nullptr;\n\n auto returnImage = Volume::New(inputImage);\n\n VolumeManipulator::GaussianBlur3D(returnImage, blur);\n\n return returnImage;\n}\n\nstd::map<mitk::pa::IOUtil::Position, mitk::pa::Volume::Pointer>\nmitk::pa::IOUtil::LoadFluenceContributionMaps(std::string foldername, double blur, int* progress, bool doLog10)\n{\n std::map<IOUtil::Position, Volume::Pointer> resultMap;\n\n itk::Directory::Pointer directoryHandler = itk::Directory::New();\n directoryHandler->Load(foldername.c_str());\n for (unsigned int fileIndex = 0, numFiles = directoryHandler->GetNumberOfFiles(); fileIndex < numFiles; ++fileIndex)\n {\n std::string filename = std::string(directoryHandler->GetFile(fileIndex));\n if (itksys::SystemTools::FileIsDirectory(filename))\n continue;\n\n if (!DoesFileHaveEnding(filename, \".nrrd\"))\n continue;\n\n size_t s = filename.find(\"_p\");\n size_t e = filename.find(\"Fluence\", s);\n std::string sub = filename.substr(s + 2, e - s - 2);\n std::vector<int> coords = splitString(sub, \",\");\n\n if (coords.size() != 3)\n {\n MITK_ERROR << \"Some of the data to read was corrupted or did not match the \" <<\n \"naming pattern *_pN,N,NFluence*.nrrd\";\n mitkThrow() << \"Some of the data to read was corrupted or did not match the\" <<\n \" naming pattern *_pN,N,NFluence*.nrrd\";\n }\n else\n {\n MITK_DEBUG << \"Extracted coords: \" << coords[0] << \"|\" << coords[1] << \"|\" << coords[2] << \" from string \" << sub;\n Volume::Pointer nrrdFile = LoadNrrd(foldername + filename, blur);\n if (doLog10)\n VolumeManipulator::Log10Image(nrrdFile);\n resultMap[Position{ coords[0], coords[2] }] = nrrdFile;\n *progress = *progress + 1;\n }\n }\n\n return resultMap;\n}\n\nint mitk::pa::IOUtil::GetNumberOfNrrdFilesInDirectory(std::string directory)\n{\n return GetListOfAllNrrdFilesInDirectory(directory).size();\n}\n\nstd::vector<std::string> mitk::pa::IOUtil::GetListOfAllNrrdFilesInDirectory(std::string directory, bool keepFileFormat)\n{\n std::vector<std::string> filenames;\n itk::Directory::Pointer directoryHandler = itk::Directory::New();\n directoryHandler->Load(directory.c_str());\n for (unsigned int fileIndex = 0, numFiles = directoryHandler->GetNumberOfFiles(); fileIndex < numFiles; ++fileIndex)\n {\n std::string filename = std::string(directoryHandler->GetFile(fileIndex));\n if (itksys::SystemTools::FileIsDirectory(filename))\n continue;\n\n if (!DoesFileHaveEnding(filename, \".nrrd\"))\n continue;\n\n if (keepFileFormat)\n {\n filenames.push_back(filename);\n }\n else\n {\n filenames.push_back(filename.substr(0, filename.size() - 5));\n }\n }\n\n return filenames;\n}\n\nstd::vector<std::string> mitk::pa::IOUtil::GetAllChildfoldersFromFolder(std::string folderPath)\n{\n std::vector<std::string> returnVector;\n\n itksys::Directory directoryHandler;\n directoryHandler.Load(folderPath.c_str());\n for (unsigned int fileIndex = 0, numFiles = directoryHandler.GetNumberOfFiles(); fileIndex < numFiles; ++fileIndex)\n {\n std::string foldername = std::string(directoryHandler.GetFile(fileIndex));\n std::string filename = folderPath + \"\/\" + foldername;\n if (itksys::SystemTools::FileIsDirectory(filename))\n {\n if (foldername != std::string(\".\") && foldername != std::string(\"..\"))\n {\n MITK_INFO << filename;\n returnVector.push_back(filename);\n }\n continue;\n }\n\n \/\/If there is a nrrd file in the directory we assume that a bottom level directory was chosen.\n if (DoesFileHaveEnding(filename, \".nrrd\"))\n {\n returnVector.clear();\n returnVector.push_back(folderPath);\n return returnVector;\n }\n }\n\n return returnVector;\n}\n\nmitk::pa::InSilicoTissueVolume::Pointer mitk::pa::IOUtil::LoadInSilicoTissueVolumeFromNrrdFile(std::string nrrdFile)\n{\n MITK_INFO << \"Initializing ComposedVolume by nrrd...\";\n auto inputImage = mitk::IOUtil::Load<mitk::Image>(nrrdFile);\n\n auto tissueParameters = TissueGeneratorParameters::New();\n\n unsigned int xDim = inputImage->GetDimensions()[1];\n unsigned int yDim = inputImage->GetDimensions()[0];\n unsigned int zDim = inputImage->GetDimensions()[2];\n tissueParameters->SetXDim(xDim);\n tissueParameters->SetYDim(yDim);\n tissueParameters->SetZDim(zDim);\n\n double xSpacing = inputImage->GetGeometry(0)->GetSpacing()[1];\n double ySpacing = inputImage->GetGeometry(0)->GetSpacing()[0];\n double zSpacing = inputImage->GetGeometry(0)->GetSpacing()[2];\n\n if ((xSpacing - ySpacing) > mitk::eps || (xSpacing - zSpacing) > mitk::eps || (ySpacing - zSpacing) > mitk::eps)\n {\n throw mitk::Exception(\"Cannot handle unequal spacing.\");\n }\n\n tissueParameters->SetVoxelSpacingInCentimeters(xSpacing);\n\n mitk::PropertyList::Pointer propertyList = inputImage->GetPropertyList();\n\n mitk::ImageReadAccessor readAccess0(inputImage, inputImage->GetVolumeData(0));\n auto* m_AbsorptionArray = new double[xDim*yDim*zDim];\n memcpy(m_AbsorptionArray, readAccess0.GetData(), xDim*yDim*zDim * sizeof(double));\n auto absorptionVolume = Volume::New(m_AbsorptionArray, xDim, yDim, zDim, xSpacing);\n\n mitk::ImageReadAccessor readAccess1(inputImage, inputImage->GetVolumeData(1));\n auto* m_ScatteringArray = new double[xDim*yDim*zDim];\n memcpy(m_ScatteringArray, readAccess1.GetData(), xDim*yDim*zDim * sizeof(double));\n auto scatteringVolume = Volume::New(m_ScatteringArray, xDim, yDim, zDim, xSpacing);\n\n mitk::ImageReadAccessor readAccess2(inputImage, inputImage->GetVolumeData(2));\n auto* m_AnisotropyArray = new double[xDim*yDim*zDim];\n memcpy(m_AnisotropyArray, readAccess2.GetData(), xDim*yDim*zDim * sizeof(double));\n auto anisotropyVolume = Volume::New(m_AnisotropyArray, xDim, yDim, zDim, xSpacing);\n\n Volume::Pointer segmentationVolume;\n\n if (inputImage->GetDimension() == 4)\n {\n mitk::ImageReadAccessor readAccess3(inputImage, inputImage->GetVolumeData(3));\n auto* m_SegmentationArray = new double[xDim*yDim*zDim];\n memcpy(m_SegmentationArray, readAccess3.GetData(), xDim*yDim*zDim * sizeof(double));\n segmentationVolume = Volume::New(m_SegmentationArray, xDim, yDim, zDim, xSpacing);\n }\n\n return mitk::pa::InSilicoTissueVolume::New(absorptionVolume, scatteringVolume,\n anisotropyVolume, segmentationVolume, tissueParameters, propertyList);\n}\n\nmitk::pa::FluenceYOffsetPair::Pointer mitk::pa::IOUtil::LoadFluenceSimulation(std::string fluenceSimulation)\n{\n MITK_INFO << \"Adding slice...\";\n\n mitk::Image::Pointer inputImage = mitk::IOUtil::Load<mitk::Image>(fluenceSimulation);\n\n auto yOffsetProperty = inputImage->GetProperty(\"y-offset\");\n\n if (yOffsetProperty.IsNull())\n mitkThrow() << \"No \\\"y-offset\\\" property found in fluence file!\";\n\n std::string yOff = yOffsetProperty->GetValueAsString();\n MITK_INFO << \"Reading y Offset: \" << yOff;\n#ifdef __linux__\n std::replace(yOff.begin(), yOff.end(), '.', ',');\n#endif \/\/ __linux__\n double yOffset = std::stod(yOff);\n MITK_INFO << \"Converted offset \" << yOffset;\n return FluenceYOffsetPair::New(Volume::New(inputImage), yOffset);\n}\n<|endoftext|>"} {"text":"<commit_before>\/*\nGiven s1, s2, s3, find whether s3 is formed by the interleaving of s1 and s2.\n\nFor example,\nGiven:\ns1 = \"aabcc\",\ns2 = \"dbbca\",\n\nWhen s3 = \"aadbbcbcac\", return true.\nWhen s3 = \"aadbbbaccc\", return false.\n*\/\n\n#include <vector>\n#include <string>\n#include <stdio.h>\n\nusing namespace std;\n\nclass Solution\n{\npublic:\n bool isInterleave(const string& s1, const string& s2, const string& s3)\n {\n int size1 = s1.size();\n int size2 = s2.size();\n int size3 = s3.size();\n if (size1 + size2 != size3)\n {\n return false;\n }\n vector<vector<int> > dp(size1 + 1, vector<int>(size2 + 1, 0));\n dp[0][0] = 1;\n for (int i = 1; i <= size2; ++i)\n {\n if (s2[i - 1] == s3[i - 1])\n {\n dp[0][i] = 1;\n }\n else\n {\n break;\n }\n }\n for (int i = 1; i <= size1; ++i)\n {\n if (s1[i - 1] == s3[i - 1])\n {\n dp[i][0] = 1;\n }\n else\n {\n break;\n }\n }\n for (int i = 1; i <= size1; ++i)\n {\n for (int j = 1; j <= size2; ++j)\n {\n if (s1[i - 1] == s3[i + j - 1])\n {\n dp[i][j] = dp[i - 1][j];\n }\n if (s2[j - 1] == s3[i + j - 1])\n {\n dp[i][j] = dp[i][j] || dp[i][j - 1];\n }\n }\n }\n return dp[size1][size2];\n }\n};\n\nint main(int argc, char* argv[])\n{\n Solution s;\n printf(\"%d\\n\", s.isInterleave(\"aabcc\", \"dbbca\", \"aadbbcbcac\"));\n printf(\"%d\\n\", s.isInterleave(\"aabcc\", \"dbbca\", \"aadbbbaccc\"));\n printf(\"%d\\n\", s.isInterleave(\"aabc\", \"abad\", \"aabadabc\"));\n return 0;\n}\n<commit_msg>Add dp formula for InterleavingString<commit_after>\/*\nGiven s1, s2, s3, find whether s3 is formed by the interleaving of s1 and s2.\n\nFor example,\nGiven:\ns1 = \"aabcc\",\ns2 = \"dbbca\",\n\nWhen s3 = \"aadbbcbcac\", return true.\nWhen s3 = \"aadbbbaccc\", return false.\n*\/\n\n#include <vector>\n#include <string>\n#include <stdio.h>\n\nusing namespace std;\n\nclass Solution\n{\npublic:\n \/\/DP solution\n \/\/\n \/\/dp[i][j] means s1[0...i] and s2[0...j] match s3[0...i+j]\n \/\/\n \/\/formula:\n \/\/\n \/\/dp[i][j] = (s1[i-1] == s3[i+j-1] && dp[i-1][j]) ||\n \/\/ (s2[j-1] == s3[i+j-1] && dp[i][j-1])\n \/\/\n \/\/dp[0][0] = 1\n bool isInterleave(const string& s1, const string& s2, const string& s3)\n {\n int size1 = s1.size();\n int size2 = s2.size();\n int size3 = s3.size();\n if (size1 + size2 != size3)\n {\n return false;\n }\n vector<vector<int> > dp(size1 + 1, vector<int>(size2 + 1, 0));\n dp[0][0] = 1;\n for (int i = 1; i <= size2; ++i)\n {\n if (s2[i - 1] == s3[i - 1])\n {\n dp[0][i] = 1;\n }\n else\n {\n break;\n }\n }\n for (int i = 1; i <= size1; ++i)\n {\n if (s1[i - 1] == s3[i - 1])\n {\n dp[i][0] = 1;\n }\n else\n {\n break;\n }\n }\n for (int i = 1; i <= size1; ++i)\n {\n for (int j = 1; j <= size2; ++j)\n {\n if (s1[i - 1] == s3[i + j - 1])\n {\n dp[i][j] = dp[i - 1][j];\n }\n if (s2[j - 1] == s3[i + j - 1])\n {\n dp[i][j] = dp[i][j] || dp[i][j - 1];\n }\n }\n }\n return dp[size1][size2];\n }\n};\n\nint main(int argc, char* argv[])\n{\n Solution s;\n printf(\"%d\\n\", s.isInterleave(\"aabcc\", \"dbbca\", \"aadbbcbcac\"));\n printf(\"%d\\n\", s.isInterleave(\"aabcc\", \"dbbca\", \"aadbbbaccc\"));\n printf(\"%d\\n\", s.isInterleave(\"aabc\", \"abad\", \"aabadabc\"));\n return 0;\n}\n<|endoftext|>"} {"text":"<commit_before><commit_msg>`SettingMaster::set_and_print`: add checks for `nullptr`.<commit_after><|endoftext|>"} {"text":"<commit_before>\/\/________________________________________________________________________\nvoid demoInteractive() {\n \/\/____________________________________________\/\/\n AliTagAnalysis *TagAna = new AliTagAnalysis();\n \n AliRunTagCuts *RunCuts = new AliRunTagCuts();\n AliEventTagCuts *EvCuts = new AliEventTagCuts();\n EvCuts->SetMultiplicityRange(11,12);\n \/\/grid tags\n TAlienCollection* coll = TAlienCollection::Open(\"tag.xml\");\n TGridResult* TagResult = coll->GetGridResult(\"\");\n TagAna->ChainGridTags(TagResult);\n TChain* chain = 0x0;\n chain = TagAna->QueryTags(RunCuts,EvCuts);\n \n \/\/____________________________________________\/\/\n \/\/ Make the analysis manager\n AliAnalysisManager *mgr = new AliAnalysisManager(\"TestManager\");\n \/\/____________________________________________\/\/\n \/\/ 1st Pt task\n AliAnalysisTaskPt *task1 = new AliAnalysisTaskPt(\"TaskPt\");\n mgr->AddTask(task1);\n \/\/ Create containers for input\/output\n AliAnalysisDataContainer *cinput1 = mgr->CreateContainer(\"cchain1\",TChain::Class(),AliAnalysisManager::kInputContainer);\n AliAnalysisDataContainer *coutput1 = mgr->CreateContainer(\"chist1\", TH1::Class(),AliAnalysisManager::kOutputContainer,\"Pt.ESD.root\");\n \n \/\/____________________________________________\/\/\n mgr->ConnectInput(task1,0,cinput1);\n mgr->ConnectOutput(task1,0,coutput1);\n cinput1->SetData(chain);\n \n if (mgr->InitAnalysis()) {\n mgr->PrintStatus();\n mgr->StartAnalysis(\"local\",chain);\n }\n} \n \n<commit_msg>Adding the 0,0 option in the TGridResult<commit_after>\/\/________________________________________________________________________\nvoid demoInteractive() {\n \/\/____________________________________________\/\/\n AliTagAnalysis *TagAna = new AliTagAnalysis();\n \n AliRunTagCuts *RunCuts = new AliRunTagCuts();\n AliEventTagCuts *EvCuts = new AliEventTagCuts();\n EvCuts->SetMultiplicityRange(11,12);\n \/\/grid tags\n TAlienCollection* coll = TAlienCollection::Open(\"tag.xml\");\n TGridResult* TagResult = coll->GetGridResult(\"\",0,0);\n TagAna->ChainGridTags(TagResult);\n TChain* chain = 0x0;\n chain = TagAna->QueryTags(RunCuts,EvCuts);\n \n \/\/____________________________________________\/\/\n \/\/ Make the analysis manager\n AliAnalysisManager *mgr = new AliAnalysisManager(\"TestManager\");\n \/\/____________________________________________\/\/\n \/\/ 1st Pt task\n AliAnalysisTaskPt *task1 = new AliAnalysisTaskPt(\"TaskPt\");\n mgr->AddTask(task1);\n \/\/ Create containers for input\/output\n AliAnalysisDataContainer *cinput1 = mgr->CreateContainer(\"cchain1\",TChain::Class(),AliAnalysisManager::kInputContainer);\n AliAnalysisDataContainer *coutput1 = mgr->CreateContainer(\"chist1\", TH1::Class(),AliAnalysisManager::kOutputContainer,\"Pt.ESD.root\");\n \n \/\/____________________________________________\/\/\n mgr->ConnectInput(task1,0,cinput1);\n mgr->ConnectOutput(task1,0,coutput1);\n cinput1->SetData(chain);\n \n if (mgr->InitAnalysis()) {\n mgr->PrintStatus();\n mgr->StartAnalysis(\"local\",chain);\n }\n} \n \n<|endoftext|>"} {"text":"<commit_before>#include \"..\/..\/testing\/testing.hpp\"\n\n#include \"..\/bit_streams.hpp\"\n#include \"..\/reader.hpp\"\n#include \"..\/writer.hpp\"\n\n#include \"..\/..\/base\/pseudo_random.hpp\"\n\n#include \"..\/..\/std\/utility.hpp\"\n#include \"..\/..\/std\/vector.hpp\"\n\n\nusing namespace rnd;\n\nUNIT_TEST(BitStream_ReadWrite)\n{\n uint32_t const NUMS_CNT = 1000;\n vector< pair<uint64_t, uint32_t> > nums;\n for (uint32_t i = 0; i < NUMS_CNT; ++i)\n {\n uint32_t numBits = GetRand64() % 65;\n uint64_t num = GetRand64() & (uint64_t(-1) >> (64 - numBits));\n \/\/ Right bit shift by 64 doesn't always work correctly,\n \/\/ this is a workaround.\n if (numBits == 0) num = 0;\n nums.push_back(make_pair(num, numBits));\n }\n \n vector<uint8_t> encodedBits;\n {\n MemWriter< vector<uint8_t> > encodedBitsWriter(encodedBits);\n BitSink bitsSink(encodedBitsWriter);\n for (uint32_t i = 0; i < nums.size(); ++i) bitsSink.Write(nums[i].first, nums[i].second);\n }\n MemReader encodedBitsReader(encodedBits.data(), encodedBits.size());\n BitSource bitsSource(encodedBitsReader);\n for (uint32_t i = 0; i < nums.size(); ++i)\n {\n uint64_t num = bitsSource.Read(nums[i].second);\n TEST_EQUAL(num, nums[i].first, ());\n }\n}\n\n<commit_msg>[coding_tests] Correctly compute mask in Bit Streams test.<commit_after>#include \"..\/..\/testing\/testing.hpp\"\n\n#include \"..\/bit_streams.hpp\"\n#include \"..\/reader.hpp\"\n#include \"..\/writer.hpp\"\n\n#include \"..\/..\/base\/pseudo_random.hpp\"\n\n#include \"..\/..\/std\/utility.hpp\"\n#include \"..\/..\/std\/vector.hpp\"\n\n\nusing namespace rnd;\n\nUNIT_TEST(BitStream_ReadWrite)\n{\n uint32_t const NUMS_CNT = 1000;\n vector< pair<uint64_t, uint32_t> > nums;\n for (uint32_t i = 0; i < NUMS_CNT; ++i)\n {\n uint32_t numBits = GetRand64() % 65;\n uint64_t num = GetRand64() & ((uint64_t(1) << numBits) - 1);\n nums.push_back(make_pair(num, numBits));\n }\n \n vector<uint8_t> encodedBits;\n {\n MemWriter< vector<uint8_t> > encodedBitsWriter(encodedBits);\n BitSink bitsSink(encodedBitsWriter);\n for (uint32_t i = 0; i < nums.size(); ++i) bitsSink.Write(nums[i].first, nums[i].second);\n }\n MemReader encodedBitsReader(encodedBits.data(), encodedBits.size());\n BitSource bitsSource(encodedBitsReader);\n for (uint32_t i = 0; i < nums.size(); ++i)\n {\n uint64_t num = bitsSource.Read(nums[i].second);\n TEST_EQUAL(num, nums[i].first, ());\n }\n}\n\n<|endoftext|>"} {"text":"<commit_before>\n\/\/ ProxyPlayer.hpp\n\/\/ This will invoke another process and waits for a return code.\n\n#ifndef __PROXY_PLAYER_HPP__\n#define __PROXY_PLAYER_HPP__\n\n#include \"Player.hpp\"\n#include <string>\n#include <sstream>\n\n#ifdef _WIN32\n#undef UNICODE\n#define NOMINMAX 1\n#include <windows.h>\n#define EXE_SUFFIX \".exe\"\n#else\n#include <cstdlib>\n#define EXE_SUFFIX \"\"\n#endif\n\nclass ProxyPlayer : public Player\n{\npublic:\n\t\/\/ Initialize with process (without .exe) and identifier of opponent.\n\tProxyPlayer(std::string const &process, std::string const &script = \"\", size_t opponent = -1)\n\t\t: mProcess(process), mScript(script), Player(opponent) {}\n\npublic:\n\t\/\/ Invoke other process.\n\tvirtual Action fight()\n\t{\n\t\tunsigned choice = executeWithArguments(getArguments(3));\n\t\tswitch (choice)\n\t\t{\n\t\tcase 48: return load();\n\t\tcase 49: return bullet();\n\t\tcase 50: return plasma();\n\t\tcase 45: return metal();\n\t\tcase 61: return thermal();\n\t\tdefault: return (Action)(-1);\n\t\t}\n\t}\n\n\t\/\/ Notify external program of result.\n\tvirtual void declared(Result result)\n\t{\n\t\tstd::string arguments;\n\t\tswitch (result)\n\t\t{\n\t\tcase WIN: arguments = getArguments(1);\n\t\tcase LOSS: arguments = getArguments(2);\n\t\tdefault: arguments = getArguments(0);\n\t\t}\n\t\texecuteWithArguments(arguments);\n\t};\n\nprivate:\n\t\/\/ External process name\n\tstd::string mProcess;\n\n\t\/\/ External script name (for non binary submissions)\n\tstd::string mScript;\n\n\t\/\/ Generates argument given game status.\n\tstd::string getArguments(size_t status)\n\t{\n\t\tstd::stringstream sst;\n\t\tsst << getOpponent()\n\t\t\t<< \" \" << getTurn()\n\t\t\t<< \" \" << status\n\t\t\t<< \" \" << getAmmo()\n\t\t\t<< \" \" << getAmmoOpponent();\n\t\tif (getTurn() > 0)\n\t\t{\n\t\t\tsst << \" \" << toActionString(getHistory())\n\t\t\t\t<< \" \" << toActionString(getHistoryOpponent());\n\t\t};\n\t\treturn sst.str();\n\t}\n\n\t\/\/ Execute process with given arguments.\n\tunsigned executeWithArguments(std::string const &arguments) const\n\t{\n#ifdef _WIN32\n\t\tSTARTUPINFO startup = { sizeof(startup) };\n\t\tPROCESS_INFORMATION process;\n\t\tLPSTR lpApplicationName;\n\t\tLPSTR lpCommandLine;\n\n\t\tlpApplicationName = const_cast<char *>(mProcess.c_str());\n\t\tif (mScript.length() == 0)\n\t\t{\n\t\t\t\/\/ Binary Proxy Player\n\t\t\t\/\/ name.exe arguments\n\t\t\tlpCommandLine = const_cast<char *>(arguments.c_str());\n\t\t}\n\t\telse\n\t\t{\n\t\t\t\/\/ Script Proxy Player\n\t\t\t\/\/ python.exe script.py arguments\n\t\t\tstd::string actualArguments = mScript;\n\t\t\tactualArguments.append(1, ' ');\n\t\t\tactualArguments.append(arguments);\n\t\t}\n\n\t\tstartup.cb = sizeof(startup);\n\t\tBOOL result = CreateProcess(lpApplicationName, lpCommandLine,\n\t\t\tNULL, NULL, TRUE, 0, NULL, NULL, &startup, &process);\n\n\t\tif (!result)\n\t\t{\n\t\t\treturn -1;\n\t\t}\n\t\telse\n\t\t{\n\t\t\t\/\/ Wait for process to terminate and sanitize return code.\n\t\t\tDWORD exitCode;\n\t\t\tWaitForSingleObject(process.hProcess, INFINITE);\n\t\t\tGetExitCodeProcess(process.hProcess, &exitCode);\n\t\t\treturn exitCode;\n\t\t}\n#else\n\t\treturn std::system((mProcess + \" \" + mScript + \" \" + arguments).c_str());\n#endif\n\t}\n};\n\n#define STRINGIFY(x) #x\n\n\/\/ Example: BINARY_PLAYER(CustomPlayer)\n\/\/ Effects: Invoke CustomPlayer.exe <arguments>\n#define BINARY_PLAYER(x) \\\n\tclass x final : public ProxyPlayer \\\n\t{ \\\n\tpublic: \\\n\t x(size_t opponent = -1) : ProxyPlayer(#x EXE_SUFFIX, opponent) {} \\\n\t};\n\n\/\/ Example: SCRIPT_PLAYER(CustomPlayer, \"python\", \"CustomScriptPlayer.py\")\n\/\/ Effects: Invoke python CustomScriptPlayer.py <arguments>\n#define SCRIPT_PLAYER(x, y, z) \\\n\tclass x final : public ProxyPlayer \\\n\t{ \\\n\tpublic: \\\n\t\tx(size_t opponent = -1) : ProxyPlayer(y, z, opponent) {} \\\n\t};\n\n#endif \/\/ !__CUSTOM_PLAYER_HPP__\n<commit_msg>Fixing Proxy Player for script submissions.<commit_after>\n\/\/ ProxyPlayer.hpp\n\/\/ This will invoke another process and waits for a return code.\n\n#ifndef __PROXY_PLAYER_HPP__\n#define __PROXY_PLAYER_HPP__\n\n#include \"Player.hpp\"\n#include <string>\n#include <sstream>\n\n#ifdef _WIN32\n#undef UNICODE\n#define NOMINMAX 1\n#include <windows.h>\n#define EXE_SUFFIX \".exe\"\n#else\n#include <cstdlib>\n#define EXE_SUFFIX \"\"\n#endif\n\nclass ProxyPlayer : public Player\n{\npublic:\n\t\/\/ Initialize with process (without .exe) and identifier of opponent.\n\tProxyPlayer(std::string const &process, std::string const &script = \"\", size_t opponent = -1)\n\t\t: mProcess(process), mScript(script), Player(opponent) {}\n\npublic:\n\t\/\/ Invoke other process.\n\tvirtual Action fight()\n\t{\n\t\tunsigned choice = executeWithArguments(getArguments(3));\n\t\tswitch (choice)\n\t\t{\n\t\tcase 48: return load();\n\t\tcase 49: return bullet();\n\t\tcase 50: return plasma();\n\t\tcase 45: return metal();\n\t\tcase 61: return thermal();\n\t\tdefault: return (Action)(-1);\n\t\t}\n\t}\n\n\t\/\/ Notify external program of result.\n\tvirtual void declared(Result result)\n\t{\n\t\tstd::string arguments;\n\t\tswitch (result)\n\t\t{\n\t\tcase WIN: arguments = getArguments(1);\n\t\tcase LOSS: arguments = getArguments(2);\n\t\tdefault: arguments = getArguments(0);\n\t\t}\n\t\texecuteWithArguments(arguments);\n\t};\n\nprivate:\n\t\/\/ External process name\n\tstd::string mProcess;\n\n\t\/\/ External script name (for non binary submissions)\n\tstd::string mScript;\n\n\t\/\/ Generates argument given game status.\n\tstd::string getArguments(size_t status)\n\t{\n\t\tstd::stringstream sst;\n\t\tsst << getOpponent()\n\t\t\t<< \" \" << getTurn()\n\t\t\t<< \" \" << status\n\t\t\t<< \" \" << getAmmo()\n\t\t\t<< \" \" << getAmmoOpponent();\n\t\tif (getTurn() > 0)\n\t\t{\n\t\t\tsst << \" \" << toActionString(getHistory())\n\t\t\t\t<< \" \" << toActionString(getHistoryOpponent());\n\t\t};\n\t\treturn sst.str();\n\t}\n\n\t\/\/ Execute process with given arguments.\n\tunsigned executeWithArguments(std::string const &arguments) const\n\t{\n#ifdef _WIN32\n\t\tSTARTUPINFO startup = { sizeof(startup) };\n\t\tPROCESS_INFORMATION process;\n\t\tLPSTR lpApplicationName;\n\t\tLPSTR lpCommandLine;\n\n\t\tstd::string actualArguments;\n\t\tif (mScript.length() == 0)\n\t\t{\n\t\t\t\/\/ Binary Proxy Player\n\t\t\t\/\/ name.exe arguments\n\t\t\tactualArguments = arguments;\n\t\t}\n\t\telse\n\t\t{\n\t\t\t\/\/ Script Proxy Player\n\t\t\t\/\/ python.exe script.py arguments\n\t\t\tactualArguments = mScript + ' ' + arguments;\n\t\t}\n\n\t\tlpApplicationName = const_cast<char *>(mProcess.c_str());\n\t\tlpCommandLine = const_cast<char *>(actualArguments.c_str());\n\n\t\tstartup.cb = sizeof(startup);\n\t\tBOOL result = CreateProcess(lpApplicationName, lpCommandLine,\n\t\t\tNULL, NULL, TRUE, 0, NULL, NULL, &startup, &process);\n\n\t\tif (!result)\n\t\t{\n\t\t\treturn -1;\n\t\t}\n\t\telse\n\t\t{\n\t\t\t\/\/ Wait for process to terminate and sanitize return code.\n\t\t\tDWORD exitCode;\n\t\t\tWaitForSingleObject(process.hProcess, INFINITE);\n\t\t\tGetExitCodeProcess(process.hProcess, &exitCode);\n\t\t\treturn exitCode;\n\t\t}\n#else\n\t\treturn std::system((mProcess + \" \" + mScript + \" \" + arguments).c_str());\n#endif\n\t}\n};\n\n#define STRINGIFY(x) #x\n\n\/\/ Example: BINARY_PLAYER(CustomPlayer)\n\/\/ Effects: Invoke CustomPlayer.exe <arguments>\n#define BINARY_PLAYER(x) \\\n\tclass x final : public ProxyPlayer \\\n\t{ \\\n\tpublic: \\\n\t x(size_t opponent = -1) : ProxyPlayer(#x EXE_SUFFIX, opponent) {} \\\n\t};\n\n\/\/ Example: SCRIPT_PLAYER(CustomPlayer, \"python\", \"CustomScriptPlayer.py\")\n\/\/ Effects: Invoke python CustomScriptPlayer.py <arguments>\n#define SCRIPT_PLAYER(x, y, z) \\\n\tclass x final : public ProxyPlayer \\\n\t{ \\\n\tpublic: \\\n\t\tx(size_t opponent = -1) : ProxyPlayer(y, z, opponent) {} \\\n\t};\n\n#endif \/\/ !__CUSTOM_PLAYER_HPP__\n<|endoftext|>"} {"text":"<commit_before>#include \"wrapper.hh\"\n#include <stdexcept>\n\nWrapper::Wrapper(v8::Local<v8::Object> options) {\n\tNan::HandleScope scope;\n\n\tv8::Local<v8::Value> options_device_value = Nan::Get(options, Nan::New(\"device\").ToLocalChecked()).ToLocalChecked();\n\tif(!options_device_value->IsString()) {\n\t\tthrow std::invalid_argument(\"Options should have string device property\");\n\t}\n\n\tv8::Local<v8::Value> options_onRecv_value = Nan::Get(options, Nan::New(\"onRecv\").ToLocalChecked()).ToLocalChecked();\n\tif(!options_onRecv_value->IsFunction()) {\n\t\tthrow std::invalid_argument(\"Options should have callback onRecv property\");\n\t}\n\n\tv8::Local<v8::Value> options_onSend_value = Nan::Get(options, Nan::New(\"onSend\").ToLocalChecked()).ToLocalChecked();\n\tif(!options_onSend_value->IsFunction()) {\n\t\tthrow std::invalid_argument(\"Options should have callback onSend property\");\n\t}\n\n\tv8::Local<v8::Value> options_onError_value = Nan::Get(options, Nan::New(\"onError\").ToLocalChecked()).ToLocalChecked();\n\tif(!options_onError_value->IsFunction()) {\n\t\tthrow std::invalid_argument(\"Options should have callback onError property\");\n\t}\n\n\tonRecvCallback.Reset(options_onRecv_value.As<v8::Function>());\n\tonSendCallback.Reset(options_onSend_value.As<v8::Function>());\n\tonSendCallback.Reset(options_onError_value.As<v8::Function>());\n\n\tNan::Utf8String device_string(options_device_value);\n\tsocket = new Socket(*device_string);\n\tpoller = new Poller(socket->get_descriptor(),\n\t\tWrapper::ReadReadyCallback,\n\t\tWrapper::WriteReadyCallback,\n\t\tWrapper::ErrorCallback,\n\t\tthis);\n}\nWrapper::~Wrapper() {\n\tonRecvCallback.Reset();\n\tonSendCallback.Reset();\n\tonErrorCallback.Reset();\n\tdelete poller;\n\tdelete socket;\n}\n\nNan::Persistent<v8::Function> Wrapper::constructor;\n#include <cstdio>\nNAN_MODULE_INIT(Wrapper::Init) {\n\tv8::Local<v8::FunctionTemplate> tpl = Nan::New<v8::FunctionTemplate>(New);\n\ttpl->SetClassName(Nan::New(\"Wrapper\").ToLocalChecked());\n\ttpl->InstanceTemplate()->SetInternalFieldCount(1);\n\n\tNan::SetPrototypeMethod(tpl, \"AddMembership\", AddMembership);\n\tNan::SetPrototypeMethod(tpl, \"DropMembership\", DropMembership);\n\tNan::SetPrototypeMethod(tpl, \"Send\", Send);\n\tNan::SetPrototypeMethod(tpl, \"Receive\", Receive);\n\n\tNan::SetPrototypeMethod(tpl, \"PauseSending\", PauseSending);\n\tNan::SetPrototypeMethod(tpl, \"ResumeSending\", ResumeSending);\n\n\tconstructor.Reset(Nan::GetFunction(tpl).ToLocalChecked());\n\tNan::Set(target, Nan::New(\"Wrapper\").ToLocalChecked(),\n\t\t\tNan::GetFunction(tpl).ToLocalChecked());\n}\n\nNAN_METHOD(Wrapper::New) {\n\tif(info.IsConstructCall()) {\n\t\tNan::MaybeLocal<v8::Object> options_object_maybe = Nan::To<v8::Object>(info[0]);\n\t\tif(options_object_maybe.IsEmpty())\n\t\t\treturn Nan::ThrowError(\"Missing options object\");\n\n\t\tv8::Local<v8::Object> options_object = options_object_maybe.ToLocalChecked();\n\n\t\tif(!Nan::HasOwnProperty(options_object, Nan::New(\"device\").ToLocalChecked()).FromMaybe(false)) {\n\t\t\treturn Nan::ThrowTypeError(\"Options should have device property\");\n\t\t}\n\n\t\tif(!Nan::HasOwnProperty(options_object, Nan::New(\"onRecv\").ToLocalChecked()).FromMaybe(false)) {\n\t\t\treturn Nan::ThrowTypeError(\"Options should have onRecv property\");\n\t\t}\n\n\t\tif(!Nan::HasOwnProperty(options_object, Nan::New(\"onSend\").ToLocalChecked()).FromMaybe(false)) {\n\t\t\treturn Nan::ThrowTypeError(\"Options should have onSend property\");\n\t\t}\n\n\t\tif(!Nan::HasOwnProperty(options_object, Nan::New(\"onError\").ToLocalChecked()).FromMaybe(false)) {\n\t\t\treturn Nan::ThrowTypeError(\"Options should have onError property\");\n\t\t}\n\n\t\ttry {\n\t\t\tWrapper *object = new Wrapper(options_object);\n\t\t\tobject->Wrap(info.This());\n\t\t} catch(const std::exception &e) {\n\t\t\treturn Nan::ThrowError(e.what());\n\t\t}\n\t\tinfo.GetReturnValue().Set(info.This());\n\t} else {\n\t\tconst int argc = 1;\n\t\tv8::Local<v8::Value> argv[argc] = {info[0]};\n\t\tv8::Local<v8::Function> emulate_constructor = Nan::New(constructor);\n\n\t\tNan::TryCatch trycatch;\n\t\tNan::MaybeLocal<v8::Object> constructed_object =\n\t\t\t\tNan::NewInstance(emulate_constructor, argc, argv);\n\t\tif(trycatch.HasCaught()) {\n\t\t\ttrycatch.ReThrow();\n\t\t\treturn;\n\t\t}\n\t\tinfo.GetReturnValue().Set(constructed_object.ToLocalChecked());\n\t}\n}\n\nvoid Wrapper::ReadReadyCallback(void *data) {\n\tNan::HandleScope scope;\n\tWrapper *wrap = reinterpret_cast<Wrapper *>(data);\n\tNan::Callback callback(Nan::New<v8::Function>(wrap->onRecvCallback));\n\tcallback.Call(0, 0);\n}\nvoid Wrapper::WriteReadyCallback(void *data) {\n\tNan::HandleScope scope;\n\tWrapper *wrap = reinterpret_cast<Wrapper *>(data);\n\tNan::Callback callback(Nan::New<v8::Function>(wrap->onSendCallback));\n\tcallback.Call(0, 0);\n}\n\nvoid Wrapper::ErrorCallback(void *data, const char *error) {\n\tNan::HandleScope scope;\n\tWrapper *wrap = reinterpret_cast<Wrapper *>(data);\n\tNan::Callback callback(Nan::New<v8::Function>(wrap->onSendCallback));\n\tconst int argc = 1;\n\tv8::Local<v8::Value> argv[argc] = {Nan::New(error).ToLocalChecked()};\n\tcallback.Call(argc, argv);\n}\n\nvoid Wrapper::ParseMembershipArguments(\n\t\t\tNan::NAN_METHOD_ARGS_TYPE info,\n\t\t\tSocket::MembershipType *type,\n\t\t\tunsigned char **address) {\n\tNan::HandleScope scope;\n\tNan::MaybeLocal<v8::Value> type_or_addr_maybe = info[0];\n\n\tif(info.Length() == 0 || type_or_addr_maybe.IsEmpty())\n\t\tthrow std::invalid_argument(\"Missing type or address argument\");\n\tv8::Local<v8::Value> type_or_addr = type_or_addr_maybe.ToLocalChecked();\n\n\tif(node::Buffer::HasInstance(type_or_addr)) {\n\t\tif(node::Buffer::Length(type_or_addr) < Socket::ADDRESS_LENGHT)\n\t\t\tthrow std::invalid_argument(\"Invalid address length\");\n\t\t*address = reinterpret_cast<unsigned char *>(node::Buffer::Data(type_or_addr));\n\t} else if(type_or_addr->IsNumber()) {\n\t\t*type = static_cast<Socket::MembershipType>(Nan::To<int>(type_or_addr).FromJust());\n\t} else {\n\t\tthrow std::invalid_argument(\"Invalid address length\");\n\t}\n}\n\nNAN_METHOD(Wrapper::AddMembership) {\n\tWrapper *obj = Nan::ObjectWrap::Unwrap<Wrapper>(info.Holder());\n\n\tSocket::MembershipType type = Socket::MULTICAST;\n\tunsigned char *address = NULL;\n\n\ttry {\n\t\tParseMembershipArguments(info, &type, &address);\n\t\tobj->socket->add_membership(type, address);\n\t} catch(const std::exception &e) {\n\t\treturn Nan::ThrowError(e.what());\n\t}\n}\n\nNAN_METHOD(Wrapper::DropMembership) {\n\tWrapper *obj = Nan::ObjectWrap::Unwrap<Wrapper>(info.Holder());\n\n\tSocket::MembershipType type = Socket::MULTICAST;\n\tunsigned char *address = NULL;\n\n\ttry {\n\t\tParseMembershipArguments(info, &type, &address);\n\t\tobj->socket->drop_membership(type, address);\n\t} catch(const std::exception &e) {\n\t\treturn Nan::ThrowError(e.what());\n\t}\n}\n\nNAN_METHOD(Wrapper::Receive) {\n\tWrapper *obj = Nan::ObjectWrap::Unwrap<Wrapper>(info.Holder());\n\n\tif(info.Length() != 1)\n\t\treturn Nan::ThrowError(\"One argument required\");\n\n\tif(!info[0]->IsFunction())\n\t\treturn Nan::ThrowTypeError(\"Callback argument has to be function\");\n\tv8::Local<v8::Function> callback = info[0].As<v8::Function>();\n\n\tint received_bytes = -1;\n\tunsigned char *source_address = reinterpret_cast<unsigned char *>(malloc(Socket::ADDRESS_LENGHT));\n\tif(!source_address)\n\t\treturn Nan::ThrowError(\"Memory allocation for source address failed\");\n\n\tunsigned char *destination_address = reinterpret_cast<unsigned char *>(malloc(Socket::ADDRESS_LENGHT));\n\tif(!destination_address) {\n\t\tfree(source_address);\n\t\treturn Nan::ThrowError(\"Memory allocation for destination address failed\");\n\t}\n\n\tchar *message_buffer = reinterpret_cast<char *>(malloc(Wrapper::MAX_RECEIVE_BUFFER_SIZE));\n\tif(!message_buffer) {\n\t\tfree(source_address);\n\t\tfree(destination_address);\n\t\treturn Nan::ThrowError(\"Memory allocation for buffer failed\");\n\t}\n\n\ttry {\n\t\treceived_bytes = obj->socket->receive_message(\n\t\t\t\tsource_address,\n\t\t\t\tdestination_address,\n\t\t\t\tmessage_buffer,\n\t\t\t\tWrapper::MAX_RECEIVE_BUFFER_SIZE);\n\t} catch(const std::exception &e) {\n\t\tfree(destination_address);\n\t\tfree(source_address);\n\t\tfree(message_buffer);\n\t\treturn Nan::ThrowError(e.what());\n\t}\n\n\tchar *tmp_buff = reinterpret_cast<char *>(realloc(message_buffer, received_bytes));\n\tif(tmp_buff)\n\t\tmessage_buffer = tmp_buff;\n\n\tNan::MaybeLocal<v8::Object> source_address_node_buffer = Nan::NewBuffer((char *)source_address, Socket::ADDRESS_LENGHT);\n\tNan::MaybeLocal<v8::Object> destination_address_node_buffer = Nan::NewBuffer((char *)destination_address, Socket::ADDRESS_LENGHT);\n\tNan::MaybeLocal<v8::Object> message_node_buffer = Nan::NewBuffer(message_buffer, received_bytes);\n\tif(source_address_node_buffer.IsEmpty() || destination_address_node_buffer.IsEmpty() || message_node_buffer.IsEmpty()) {\n\t\treturn Nan::ThrowError(\"Failed to create buffer object\");\n\t}\n\n\tconst int argc = 3;\n\tv8::Local<v8::Value> argv[argc] = {\n\t\tsource_address_node_buffer.ToLocalChecked(),\n\t\tdestination_address_node_buffer.ToLocalChecked(),\n\t\tmessage_node_buffer.ToLocalChecked()\n\t};\n\tNan::MakeCallback(Nan::GetCurrentContext()->Global(), callback, argc, argv);\n\n}\n\nNAN_METHOD(Wrapper::Send) {\n\tWrapper *obj = Nan::ObjectWrap::Unwrap<Wrapper>(info.Holder());\n\n\tif(info.Length() != 3)\n\t\treturn Nan::ThrowError(\"Three arguments required\");\n\n\tv8::Local<v8::Value> message_to_send = info[0];\n\tif(!node::Buffer::HasInstance(message_to_send))\n\t\treturn Nan::ThrowTypeError(\"Message argument has to be buffer\");\n\n\tv8::Local<v8::Value> destination_address = info[1];\n\tif(!node::Buffer::HasInstance(destination_address))\n\t\treturn Nan::ThrowTypeError(\"Address argument has to be buffer\");\n\tif(node::Buffer::Length(destination_address) != Socket::ADDRESS_LENGHT)\n\t\treturn Nan::ThrowTypeError(\"Address argument invalid length\");\n\n\tif(!info[2]->IsFunction())\n\t\treturn Nan::ThrowTypeError(\"Callback argument has to be function\");\n\tv8::Local<v8::Function> callback = info[2].As<v8::Function>();\n\n\tint send_bytes = -1;\n\ttry {\n\t\tsend_bytes = obj->socket->send_message(\n\t\t\t\treinterpret_cast<unsigned char *>(node::Buffer::Data(destination_address)),\n\t\t\t\tnode::Buffer::Data(message_to_send),\n\t\t\t\tnode::Buffer::Length(message_to_send));\n\t} catch(const std::exception &e) {\n\t\treturn Nan::ThrowError(e.what());\n\t}\n\n\tconst int argc = 1;\n\tv8::Local<v8::Value> argv[argc] = { Nan::New(send_bytes) };\n\tNan::MakeCallback(Nan::GetCurrentContext()->Global(), callback, argc, argv);\n}\n\nNAN_METHOD(Wrapper::PauseSending) {\n\tWrapper *obj = Nan::ObjectWrap::Unwrap<Wrapper>(info.Holder());\n\tobj->poller->set_events(Poller::WRITE_EVENT);\n}\n\nNAN_METHOD(Wrapper::ResumeSending) {\n\tWrapper *obj = Nan::ObjectWrap::Unwrap<Wrapper>(info.Holder());\n\tobj->poller->set_events(Poller::RW_EVENT);\n}\n\nNODE_MODULE(packet_socket_addon, Wrapper::Init);\n<commit_msg>Modify send to error variables in error callback<commit_after>#include \"wrapper.hh\"\n#include <stdexcept>\n\nWrapper::Wrapper(v8::Local<v8::Object> options) {\n\tNan::HandleScope scope;\n\n\tv8::Local<v8::Value> options_device_value = Nan::Get(options, Nan::New(\"device\").ToLocalChecked()).ToLocalChecked();\n\tif(!options_device_value->IsString()) {\n\t\tthrow std::invalid_argument(\"Options should have string device property\");\n\t}\n\n\tv8::Local<v8::Value> options_onRecv_value = Nan::Get(options, Nan::New(\"onRecv\").ToLocalChecked()).ToLocalChecked();\n\tif(!options_onRecv_value->IsFunction()) {\n\t\tthrow std::invalid_argument(\"Options should have callback onRecv property\");\n\t}\n\n\tv8::Local<v8::Value> options_onSend_value = Nan::Get(options, Nan::New(\"onSend\").ToLocalChecked()).ToLocalChecked();\n\tif(!options_onSend_value->IsFunction()) {\n\t\tthrow std::invalid_argument(\"Options should have callback onSend property\");\n\t}\n\n\tv8::Local<v8::Value> options_onError_value = Nan::Get(options, Nan::New(\"onError\").ToLocalChecked()).ToLocalChecked();\n\tif(!options_onError_value->IsFunction()) {\n\t\tthrow std::invalid_argument(\"Options should have callback onError property\");\n\t}\n\n\tonRecvCallback.Reset(options_onRecv_value.As<v8::Function>());\n\tonSendCallback.Reset(options_onSend_value.As<v8::Function>());\n\tonErrorCallback.Reset(options_onError_value.As<v8::Function>());\n\n\tNan::Utf8String device_string(options_device_value);\n\tsocket = new Socket(*device_string);\n\tpoller = new Poller(socket->get_descriptor(),\n\t\tWrapper::ReadReadyCallback,\n\t\tWrapper::WriteReadyCallback,\n\t\tWrapper::ErrorCallback,\n\t\tthis);\n}\nWrapper::~Wrapper() {\n\tonRecvCallback.Reset();\n\tonSendCallback.Reset();\n\tonErrorCallback.Reset();\n\tdelete poller;\n\tdelete socket;\n}\n\nNan::Persistent<v8::Function> Wrapper::constructor;\n#include <cstdio>\nNAN_MODULE_INIT(Wrapper::Init) {\n\tv8::Local<v8::FunctionTemplate> tpl = Nan::New<v8::FunctionTemplate>(New);\n\ttpl->SetClassName(Nan::New(\"Wrapper\").ToLocalChecked());\n\ttpl->InstanceTemplate()->SetInternalFieldCount(1);\n\n\tNan::SetPrototypeMethod(tpl, \"AddMembership\", AddMembership);\n\tNan::SetPrototypeMethod(tpl, \"DropMembership\", DropMembership);\n\tNan::SetPrototypeMethod(tpl, \"Send\", Send);\n\tNan::SetPrototypeMethod(tpl, \"Receive\", Receive);\n\n\tNan::SetPrototypeMethod(tpl, \"PauseSending\", PauseSending);\n\tNan::SetPrototypeMethod(tpl, \"ResumeSending\", ResumeSending);\n\n\tconstructor.Reset(Nan::GetFunction(tpl).ToLocalChecked());\n\tNan::Set(target, Nan::New(\"Wrapper\").ToLocalChecked(),\n\t\t\tNan::GetFunction(tpl).ToLocalChecked());\n}\n\nNAN_METHOD(Wrapper::New) {\n\tif(info.IsConstructCall()) {\n\t\tNan::MaybeLocal<v8::Object> options_object_maybe = Nan::To<v8::Object>(info[0]);\n\t\tif(options_object_maybe.IsEmpty())\n\t\t\treturn Nan::ThrowError(\"Missing options object\");\n\n\t\tv8::Local<v8::Object> options_object = options_object_maybe.ToLocalChecked();\n\n\t\tif(!Nan::HasOwnProperty(options_object, Nan::New(\"device\").ToLocalChecked()).FromMaybe(false)) {\n\t\t\treturn Nan::ThrowTypeError(\"Options should have device property\");\n\t\t}\n\n\t\tif(!Nan::HasOwnProperty(options_object, Nan::New(\"onRecv\").ToLocalChecked()).FromMaybe(false)) {\n\t\t\treturn Nan::ThrowTypeError(\"Options should have onRecv property\");\n\t\t}\n\n\t\tif(!Nan::HasOwnProperty(options_object, Nan::New(\"onSend\").ToLocalChecked()).FromMaybe(false)) {\n\t\t\treturn Nan::ThrowTypeError(\"Options should have onSend property\");\n\t\t}\n\n\t\tif(!Nan::HasOwnProperty(options_object, Nan::New(\"onError\").ToLocalChecked()).FromMaybe(false)) {\n\t\t\treturn Nan::ThrowTypeError(\"Options should have onError property\");\n\t\t}\n\n\t\ttry {\n\t\t\tWrapper *object = new Wrapper(options_object);\n\t\t\tobject->Wrap(info.This());\n\t\t} catch(const std::exception &e) {\n\t\t\treturn Nan::ThrowError(e.what());\n\t\t}\n\t\tinfo.GetReturnValue().Set(info.This());\n\t} else {\n\t\tconst int argc = 1;\n\t\tv8::Local<v8::Value> argv[argc] = {info[0]};\n\t\tv8::Local<v8::Function> emulate_constructor = Nan::New(constructor);\n\n\t\tNan::TryCatch trycatch;\n\t\tNan::MaybeLocal<v8::Object> constructed_object =\n\t\t\t\tNan::NewInstance(emulate_constructor, argc, argv);\n\t\tif(trycatch.HasCaught()) {\n\t\t\ttrycatch.ReThrow();\n\t\t\treturn;\n\t\t}\n\t\tinfo.GetReturnValue().Set(constructed_object.ToLocalChecked());\n\t}\n}\n\nvoid Wrapper::ReadReadyCallback(void *data) {\n\tNan::HandleScope scope;\n\tWrapper *wrap = reinterpret_cast<Wrapper *>(data);\n\tNan::Callback callback(Nan::New<v8::Function>(wrap->onRecvCallback));\n\tcallback.Call(0, 0);\n}\nvoid Wrapper::WriteReadyCallback(void *data) {\n\tNan::HandleScope scope;\n\tWrapper *wrap = reinterpret_cast<Wrapper *>(data);\n\tNan::Callback callback(Nan::New<v8::Function>(wrap->onSendCallback));\n\tcallback.Call(0, 0);\n}\n\nvoid Wrapper::ErrorCallback(void *data, const char *error) {\n\tNan::HandleScope scope;\n\tWrapper *wrap = reinterpret_cast<Wrapper *>(data);\n\tNan::Callback callback(Nan::New<v8::Function>(wrap->onErrorCallback));\n\tconst int argc = 1;\n\tv8::Local<v8::Value> argv[argc] = {Nan::New(error).ToLocalChecked()};\n\tcallback.Call(argc, argv);\n}\n\nvoid Wrapper::ParseMembershipArguments(\n\t\t\tNan::NAN_METHOD_ARGS_TYPE info,\n\t\t\tSocket::MembershipType *type,\n\t\t\tunsigned char **address) {\n\tNan::HandleScope scope;\n\tNan::MaybeLocal<v8::Value> type_or_addr_maybe = info[0];\n\n\tif(info.Length() == 0 || type_or_addr_maybe.IsEmpty())\n\t\tthrow std::invalid_argument(\"Missing type or address argument\");\n\tv8::Local<v8::Value> type_or_addr = type_or_addr_maybe.ToLocalChecked();\n\n\tif(node::Buffer::HasInstance(type_or_addr)) {\n\t\tif(node::Buffer::Length(type_or_addr) < Socket::ADDRESS_LENGHT)\n\t\t\tthrow std::invalid_argument(\"Invalid address length\");\n\t\t*address = reinterpret_cast<unsigned char *>(node::Buffer::Data(type_or_addr));\n\t} else if(type_or_addr->IsNumber()) {\n\t\t*type = static_cast<Socket::MembershipType>(Nan::To<int>(type_or_addr).FromJust());\n\t} else {\n\t\tthrow std::invalid_argument(\"Invalid address length\");\n\t}\n}\n\nNAN_METHOD(Wrapper::AddMembership) {\n\tWrapper *obj = Nan::ObjectWrap::Unwrap<Wrapper>(info.Holder());\n\n\tSocket::MembershipType type = Socket::MULTICAST;\n\tunsigned char *address = NULL;\n\n\ttry {\n\t\tParseMembershipArguments(info, &type, &address);\n\t\tobj->socket->add_membership(type, address);\n\t} catch(const std::exception &e) {\n\t\treturn Nan::ThrowError(e.what());\n\t}\n}\n\nNAN_METHOD(Wrapper::DropMembership) {\n\tWrapper *obj = Nan::ObjectWrap::Unwrap<Wrapper>(info.Holder());\n\n\tSocket::MembershipType type = Socket::MULTICAST;\n\tunsigned char *address = NULL;\n\n\ttry {\n\t\tParseMembershipArguments(info, &type, &address);\n\t\tobj->socket->drop_membership(type, address);\n\t} catch(const std::exception &e) {\n\t\treturn Nan::ThrowError(e.what());\n\t}\n}\n\nNAN_METHOD(Wrapper::Receive) {\n\tWrapper *obj = Nan::ObjectWrap::Unwrap<Wrapper>(info.Holder());\n\n\tif(info.Length() != 1)\n\t\treturn Nan::ThrowError(\"One argument required\");\n\n\tif(!info[0]->IsFunction())\n\t\treturn Nan::ThrowTypeError(\"Callback argument has to be function\");\n\tv8::Local<v8::Function> callback = info[0].As<v8::Function>();\n\n\tint received_bytes = -1;\n\tunsigned char *source_address = reinterpret_cast<unsigned char *>(malloc(Socket::ADDRESS_LENGHT));\n\tif(!source_address)\n\t\treturn Nan::ThrowError(\"Memory allocation for source address failed\");\n\n\tunsigned char *destination_address = reinterpret_cast<unsigned char *>(malloc(Socket::ADDRESS_LENGHT));\n\tif(!destination_address) {\n\t\tfree(source_address);\n\t\treturn Nan::ThrowError(\"Memory allocation for destination address failed\");\n\t}\n\n\tchar *message_buffer = reinterpret_cast<char *>(malloc(Wrapper::MAX_RECEIVE_BUFFER_SIZE));\n\tif(!message_buffer) {\n\t\tfree(source_address);\n\t\tfree(destination_address);\n\t\treturn Nan::ThrowError(\"Memory allocation for buffer failed\");\n\t}\n\n\ttry {\n\t\treceived_bytes = obj->socket->receive_message(\n\t\t\t\tsource_address,\n\t\t\t\tdestination_address,\n\t\t\t\tmessage_buffer,\n\t\t\t\tWrapper::MAX_RECEIVE_BUFFER_SIZE);\n\t} catch(const std::exception &e) {\n\t\tfree(destination_address);\n\t\tfree(source_address);\n\t\tfree(message_buffer);\n\t\treturn Nan::ThrowError(e.what());\n\t}\n\n\tchar *tmp_buff = reinterpret_cast<char *>(realloc(message_buffer, received_bytes));\n\tif(tmp_buff)\n\t\tmessage_buffer = tmp_buff;\n\n\tNan::MaybeLocal<v8::Object> source_address_node_buffer = Nan::NewBuffer((char *)source_address, Socket::ADDRESS_LENGHT);\n\tNan::MaybeLocal<v8::Object> destination_address_node_buffer = Nan::NewBuffer((char *)destination_address, Socket::ADDRESS_LENGHT);\n\tNan::MaybeLocal<v8::Object> message_node_buffer = Nan::NewBuffer(message_buffer, received_bytes);\n\tif(source_address_node_buffer.IsEmpty() || destination_address_node_buffer.IsEmpty() || message_node_buffer.IsEmpty()) {\n\t\treturn Nan::ThrowError(\"Failed to create buffer object\");\n\t}\n\n\tconst int argc = 3;\n\tv8::Local<v8::Value> argv[argc] = {\n\t\tsource_address_node_buffer.ToLocalChecked(),\n\t\tdestination_address_node_buffer.ToLocalChecked(),\n\t\tmessage_node_buffer.ToLocalChecked()\n\t};\n\tNan::MakeCallback(Nan::GetCurrentContext()->Global(), callback, argc, argv);\n\n}\n\nNAN_METHOD(Wrapper::Send) {\n\tWrapper *obj = Nan::ObjectWrap::Unwrap<Wrapper>(info.Holder());\n\n\tif(info.Length() != 3)\n\t\treturn Nan::ThrowError(\"Three arguments required\");\n\n\tv8::Local<v8::Value> message_to_send = info[0];\n\tif(!node::Buffer::HasInstance(message_to_send))\n\t\treturn Nan::ThrowTypeError(\"Message argument has to be buffer\");\n\n\tv8::Local<v8::Value> destination_address = info[1];\n\tif(!node::Buffer::HasInstance(destination_address))\n\t\treturn Nan::ThrowTypeError(\"Address argument has to be buffer\");\n\tif(node::Buffer::Length(destination_address) != Socket::ADDRESS_LENGHT)\n\t\treturn Nan::ThrowTypeError(\"Address argument invalid length\");\n\n\tif(!info[2]->IsFunction())\n\t\treturn Nan::ThrowTypeError(\"Callback argument has to be function\");\n\tv8::Local<v8::Function> callback = info[2].As<v8::Function>();\n\n\tint send_bytes = -1;\n\ttry {\n\t\tsend_bytes = obj->socket->send_message(\n\t\t\t\treinterpret_cast<unsigned char *>(node::Buffer::Data(destination_address)),\n\t\t\t\tnode::Buffer::Data(message_to_send),\n\t\t\t\tnode::Buffer::Length(message_to_send));\n\t} catch(const std::exception &e) {\n\t\treturn Nan::ThrowError(e.what());\n\t}\n\n\tconst int argc = 1;\n\tv8::Local<v8::Value> argv[argc] = { Nan::New(send_bytes) };\n\tNan::MakeCallback(Nan::GetCurrentContext()->Global(), callback, argc, argv);\n}\n\nNAN_METHOD(Wrapper::PauseSending) {\n\tWrapper *obj = Nan::ObjectWrap::Unwrap<Wrapper>(info.Holder());\n\tobj->poller->set_events(Poller::WRITE_EVENT);\n}\n\nNAN_METHOD(Wrapper::ResumeSending) {\n\tWrapper *obj = Nan::ObjectWrap::Unwrap<Wrapper>(info.Holder());\n\tobj->poller->set_events(Poller::RW_EVENT);\n}\n\nNODE_MODULE(packet_socket_addon, Wrapper::Init);\n<|endoftext|>"} {"text":"<commit_before><commit_msg>LowB cut var changes<commit_after><|endoftext|>"} {"text":"<commit_before>#include <iostream>\n#include <string> \n#include \"src\/Options.hpp\"\n#include \"src\/Cluster.hpp\"\n\n\n\nusing namespace std;\nint main(int argc, char *argv[]){\n\n\n string path2data = \"..\/data\/\";\n\/* norm of matrix is mofiedable by 'young_modulus' *\/\n double young_modulus = 10000;\n\/\/ double young_modulus = 2.1e9;\n double poissons_ratio = 0.4999;\n\n\/* ---------------------------------------------------------*\/\n\/* ---------------------------------------------------------*\/\n\/* ---------------------------------------------------------*\/\n\/* ---------------------------------------------------------*\/\n\n\n cout << argv[0] << endl;\n Options options;\n options.set_values(path2data, argc, argv, young_modulus, poissons_ratio);\n Cluster cluster(options);\n cout << \"----------------- done -----------------\\n\" ;\n return 0;\n}\n<commit_msg>update<commit_after>#include <iostream>\n#include <string> \n#include \"src\/Options.hpp\"\n#include \"src\/Cluster.hpp\"\n\n\n\nusing namespace std;\nint main(int argc, char *argv[]){\n\n\n string path2data = \"..\/data\/\";\n\/* norm of matrix can be changed by following 2 parameters *\/\n double young_modulus = 10000;\n double poissons_ratio = 0.3;\n\n\n\/\/ double young_modulus = 2.1e9;\n\/\/ double poissons_ratio = 0.4999;\n\n\/* ---------------------------------------------------------*\/\n\/* ---------------------------------------------------------*\/\n\/* ---------------------------------------------------------*\/\n\/* ---------------------------------------------------------*\/\n\n\n cout << argv[0] << endl;\n Options options;\n options.set_values(path2data, argc, argv, young_modulus, poissons_ratio);\n Cluster cluster(options);\n cout << \"----------------- done -----------------\\n\" ;\n return 0;\n}\n<|endoftext|>"} {"text":"<commit_before><commit_msg>`Node::delete_bidirectional_link`: check `this->parent` for `nullptr`.<commit_after><|endoftext|>"} {"text":"<commit_before>AliAnalysisTaskSEDvsMultiplicity *AddTaskDvsMultiplicity(Int_t system=0,\n\t\t\t\t\t\t\t Bool_t readMC=kFALSE,\n\t\t\t\t\t\t\t Int_t MCOption=0,\n\t\t\t\t\t\t\t Int_t pdgMeson=411,\n\t\t\t\t\t\t\t TString finDirname=\"Loose\",\n\t\t\t\t\t\t\t TString filename=\"\",\n\t\t\t\t\t\t\t TString finAnObjname=\"AnalysisCuts\", \n\t\t\t\t\t\t\t TString estimatorFilename=\"\")\n{\n \/\/\n \/\/ Test macro for the AliAnalysisTaskSE for D+ candidates\n \/\/Invariant mass histogram and \n \/\/ association with MC truth (using MC info in AOD)\n \/\/ R. Bala, bala@to.infn.it\n \/\/ Get the pointer to the existing analysis manager via the static access method. \n \/\/============================================================================== \n \n AliAnalysisManager *mgr = AliAnalysisManager::GetAnalysisManager();\n if (!mgr) {\n ::Error(\"AddTaskDvsMultiplicity\", \"No analysis manager to connect to.\");\n }\n \n Bool_t stdcuts=kFALSE;\n TFile* filecuts;\n if( filename.EqualTo(\"\") ) {\n stdcuts=kTRUE; \n } else {\n filecuts=TFile::Open(filename.Data());\n if(!filecuts ||(filecuts&& !filecuts->IsOpen())){\n AliFatal(\"Input file not found : check your cut object\");\n }\n }\n\n \n \/\/Analysis Task \n AliRDHFCuts *analysiscuts=0x0;\n \n TString Name=\"\";\n if(pdgMeson==411){\n if(stdcuts) {\n analysiscuts = new AliRDHFCutsDplustoKpipi();\n if (system == 0) analysiscuts->SetStandardCutsPP2010();\n else analysiscuts->SetStandardCutsPbPb2011();\n }\n else analysiscuts = (AliRDHFCutsDplustoKpipi*)filecuts->Get(finAnObjname);\n Name=\"Dplus\";\n }else if(pdgMeson==421){\n if(stdcuts) {\n analysiscuts = new AliRDHFCutsD0toKpi();\n if (system == 0) analysiscuts->SetStandardCutsPP2010();\n else analysiscuts->SetStandardCutsPbPb2011();\n }\n else analysiscuts = (AliRDHFCutsD0toKpi*)filecuts->Get(finAnObjname);\n Name=\"D0\";\n }else if(pdgMeson==413){\n if(stdcuts) {\n analysiscuts = new AliRDHFCutsDStartoKpipi();\n if (system == 0) analysiscuts->SetStandardCutsPP2010();\n else analysiscuts->SetStandardCutsPbPb2011();\n }\n else analysiscuts = (AliRDHFCutsDStartoKpipi*)filecuts->Get(finAnObjname);\n Name=\"DStar\";\n }\n\n\n AliAnalysisTaskSEDvsMultiplicity *dMultTask = new AliAnalysisTaskSEDvsMultiplicity(\"dMultAnalysis\",pdgMeson,analysiscuts);\n dMultTask->SetReadMC(readMC); \n dMultTask->SetDebugLevel(0);\n dMultTask->SetUseBit(kTRUE);\n dMultTask->SetDoImpactParameterHistos(kFALSE);\n\n if(pdgMeson==421) { \n dMultTask->SetMassLimits(1.5648,2.1648);\n dMultTask->SetMassBins(300);\n }else if(pdgmeson==411)dMultTask->SetMassLimits(pdgmeson,0.2);\n \n if(estimatorFilename.EqualTo(\"\") ) {\n printf(\"Estimator file not provided, multiplcity corrected histograms will not be filled\\n\");\n } else{\n const Char_t* periodNames[4] = {\"LHC10b\", \"LHC10c\", \"LHC10d\", \"LHC10e\"};\n TProfile* multEstimatorAvg[4]; \n TFile* fileEstimator=TFile::Open(estimatorFilename.Data());\n if(!fileEstimator) {\n AliFatal(\"File with multiplicity estimator not found\\n\"); \n return;\n }\n for(Int_t ip=0; ip<4; ip++) {\n multEstimatorAvg[ip] = (TProfile*)(fileEstimator->Get(Form(\"SPDmult10_%s\",periodNames[ip]))->Clone(Form(\"SPDmult10_%s_clone\",periodNames[ip]))); \n }\n dMultTask->SetMultiplVsZProfileLHC10b(multEstimatorAvg[0]);\n dMultTask->SetMultiplVsZProfileLHC10c(multEstimatorAvg[1]);\n dMultTask->SetMultiplVsZProfileLHC10d(multEstimatorAvg[2]);\n dMultTask->SetMultiplVsZProfileLHC10e(multEstimatorAvg[3]);\n }\n mgr->AddTask(dMultTask);\n \n \/\/ Create containers for input\/output \n \n TString inname = \"cinput\";\n TString outname = \"coutput\";\n TString cutsname = \"coutputCuts\";\n TString normname = \"coutputNorm\";\n \n inname += Name.Data();\n outname += Name.Data();\n cutsname += Name.Data();\n normname += Name.Data();\n inname += finDirname.Data();\n outname += finDirname.Data();\n cutsname += finDirname.Data();\n normname += finDirname.Data();\n\n\n AliAnalysisDataContainer *cinput = mgr->CreateContainer(inname,TChain::Class(),AliAnalysisManager::kInputContainer);\n\n TString outputfile = AliAnalysisManager::GetCommonFileName();\n outputfile += \":PWG3_D2H_DMult_\";\n outputfile += Name.Data(); \n outputfile += finDirname.Data(); \n \n AliAnalysisDataContainer *coutputCuts = mgr->CreateContainer(cutsname,TList::Class(),AliAnalysisManager::kOutputContainer,outputfile.Data());\n AliAnalysisDataContainer *coutput = mgr->CreateContainer(outname,TList::Class(),AliAnalysisManager::kOutputContainer,outputfile.Data());\n AliAnalysisDataContainer *coutputNorm = mgr->CreateContainer(normname,TList::Class(),AliAnalysisManager::kOutputContainer,outputfile.Data());\n \n mgr->ConnectInput(dMultTask,0,mgr->GetCommonInputContainer());\n \n mgr->ConnectOutput(dMultTask,1,coutput);\n \n mgr->ConnectOutput(dMultTask,2,coutputCuts);\n\n mgr->ConnectOutput(dMultTask,3,coutputNorm); \n \n return dMultTask;\n}\n<commit_msg>Fix typo<commit_after>AliAnalysisTaskSEDvsMultiplicity *AddTaskDvsMultiplicity(Int_t system=0,\n\t\t\t\t\t\t\t Bool_t readMC=kFALSE,\n\t\t\t\t\t\t\t Int_t MCOption=0,\n\t\t\t\t\t\t\t Int_t pdgMeson=411,\n\t\t\t\t\t\t\t TString finDirname=\"Loose\",\n\t\t\t\t\t\t\t TString filename=\"\",\n\t\t\t\t\t\t\t TString finAnObjname=\"AnalysisCuts\", \n\t\t\t\t\t\t\t TString estimatorFilename=\"\")\n{\n \/\/\n \/\/ Test macro for the AliAnalysisTaskSE for D+ candidates\n \/\/Invariant mass histogram and \n \/\/ association with MC truth (using MC info in AOD)\n \/\/ R. Bala, bala@to.infn.it\n \/\/ Get the pointer to the existing analysis manager via the static access method. \n \/\/============================================================================== \n \n AliAnalysisManager *mgr = AliAnalysisManager::GetAnalysisManager();\n if (!mgr) {\n ::Error(\"AddTaskDvsMultiplicity\", \"No analysis manager to connect to.\");\n }\n \n Bool_t stdcuts=kFALSE;\n TFile* filecuts;\n if( filename.EqualTo(\"\") ) {\n stdcuts=kTRUE; \n } else {\n filecuts=TFile::Open(filename.Data());\n if(!filecuts ||(filecuts&& !filecuts->IsOpen())){\n AliFatal(\"Input file not found : check your cut object\");\n }\n }\n\n \n \/\/Analysis Task \n AliRDHFCuts *analysiscuts=0x0;\n \n TString Name=\"\";\n if(pdgMeson==411){\n if(stdcuts) {\n analysiscuts = new AliRDHFCutsDplustoKpipi();\n if (system == 0) analysiscuts->SetStandardCutsPP2010();\n else analysiscuts->SetStandardCutsPbPb2011();\n }\n else analysiscuts = (AliRDHFCutsDplustoKpipi*)filecuts->Get(finAnObjname);\n Name=\"Dplus\";\n }else if(pdgMeson==421){\n if(stdcuts) {\n analysiscuts = new AliRDHFCutsD0toKpi();\n if (system == 0) analysiscuts->SetStandardCutsPP2010();\n else analysiscuts->SetStandardCutsPbPb2011();\n }\n else analysiscuts = (AliRDHFCutsD0toKpi*)filecuts->Get(finAnObjname);\n Name=\"D0\";\n }else if(pdgMeson==413){\n if(stdcuts) {\n analysiscuts = new AliRDHFCutsDStartoKpipi();\n if (system == 0) analysiscuts->SetStandardCutsPP2010();\n else analysiscuts->SetStandardCutsPbPb2011();\n }\n else analysiscuts = (AliRDHFCutsDStartoKpipi*)filecuts->Get(finAnObjname);\n Name=\"DStar\";\n }\n\n\n AliAnalysisTaskSEDvsMultiplicity *dMultTask = new AliAnalysisTaskSEDvsMultiplicity(\"dMultAnalysis\",pdgMeson,analysiscuts);\n dMultTask->SetReadMC(readMC); \n dMultTask->SetDebugLevel(0);\n dMultTask->SetUseBit(kTRUE);\n dMultTask->SetDoImpactParameterHistos(kFALSE);\n\n if(pdgMeson==421) { \n dMultTask->SetMassLimits(1.5648,2.1648);\n dMultTask->SetMassBins(300);\n }else if(pdgMeson==411)dMultTask->SetMassLimits(pdgMeson,0.2);\n \n if(estimatorFilename.EqualTo(\"\") ) {\n printf(\"Estimator file not provided, multiplcity corrected histograms will not be filled\\n\");\n } else{\n const Char_t* periodNames[4] = {\"LHC10b\", \"LHC10c\", \"LHC10d\", \"LHC10e\"};\n TProfile* multEstimatorAvg[4]; \n TFile* fileEstimator=TFile::Open(estimatorFilename.Data());\n if(!fileEstimator) {\n AliFatal(\"File with multiplicity estimator not found\\n\"); \n return;\n }\n for(Int_t ip=0; ip<4; ip++) {\n multEstimatorAvg[ip] = (TProfile*)(fileEstimator->Get(Form(\"SPDmult10_%s\",periodNames[ip]))->Clone(Form(\"SPDmult10_%s_clone\",periodNames[ip]))); \n }\n dMultTask->SetMultiplVsZProfileLHC10b(multEstimatorAvg[0]);\n dMultTask->SetMultiplVsZProfileLHC10c(multEstimatorAvg[1]);\n dMultTask->SetMultiplVsZProfileLHC10d(multEstimatorAvg[2]);\n dMultTask->SetMultiplVsZProfileLHC10e(multEstimatorAvg[3]);\n }\n mgr->AddTask(dMultTask);\n \n \/\/ Create containers for input\/output \n \n TString inname = \"cinput\";\n TString outname = \"coutput\";\n TString cutsname = \"coutputCuts\";\n TString normname = \"coutputNorm\";\n \n inname += Name.Data();\n outname += Name.Data();\n cutsname += Name.Data();\n normname += Name.Data();\n inname += finDirname.Data();\n outname += finDirname.Data();\n cutsname += finDirname.Data();\n normname += finDirname.Data();\n\n\n AliAnalysisDataContainer *cinput = mgr->CreateContainer(inname,TChain::Class(),AliAnalysisManager::kInputContainer);\n\n TString outputfile = AliAnalysisManager::GetCommonFileName();\n outputfile += \":PWG3_D2H_DMult_\";\n outputfile += Name.Data(); \n outputfile += finDirname.Data(); \n \n AliAnalysisDataContainer *coutputCuts = mgr->CreateContainer(cutsname,TList::Class(),AliAnalysisManager::kOutputContainer,outputfile.Data());\n AliAnalysisDataContainer *coutput = mgr->CreateContainer(outname,TList::Class(),AliAnalysisManager::kOutputContainer,outputfile.Data());\n AliAnalysisDataContainer *coutputNorm = mgr->CreateContainer(normname,TList::Class(),AliAnalysisManager::kOutputContainer,outputfile.Data());\n \n mgr->ConnectInput(dMultTask,0,mgr->GetCommonInputContainer());\n \n mgr->ConnectOutput(dMultTask,1,coutput);\n \n mgr->ConnectOutput(dMultTask,2,coutputCuts);\n\n mgr->ConnectOutput(dMultTask,3,coutputNorm); \n \n return dMultTask;\n}\n<|endoftext|>"} {"text":"<commit_before>\/*************************************************************************\/\n\/* editor_run_native.cpp *\/\n\/*************************************************************************\/\n\/* This file is part of: *\/\n\/* GODOT ENGINE *\/\n\/* https:\/\/godotengine.org *\/\n\/*************************************************************************\/\n\/* Copyright (c) 2007-2019 Juan Linietsky, Ariel Manzur. *\/\n\/* Copyright (c) 2014-2019 Godot Engine contributors (cf. AUTHORS.md) *\/\n\/* *\/\n\/* Permission is hereby granted, free of charge, to any person obtaining *\/\n\/* a copy of this software and associated documentation files (the *\/\n\/* \"Software\"), to deal in the Software without restriction, including *\/\n\/* without limitation the rights to use, copy, modify, merge, publish, *\/\n\/* distribute, sublicense, and\/or sell copies of the Software, and to *\/\n\/* permit persons to whom the Software is furnished to do so, subject to *\/\n\/* the following conditions: *\/\n\/* *\/\n\/* The above copyright notice and this permission notice shall be *\/\n\/* included in all copies or substantial portions of the Software. *\/\n\/* *\/\n\/* THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, *\/\n\/* EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF *\/\n\/* MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT.*\/\n\/* IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY *\/\n\/* CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, *\/\n\/* TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE *\/\n\/* SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE. *\/\n\/*************************************************************************\/\n\n#include \"editor_run_native.h\"\n\n#include \"editor_export.h\"\n#include \"editor_node.h\"\n\nvoid EditorRunNative::_notification(int p_what) {\n\n\tif (p_what == NOTIFICATION_ENTER_TREE) {\n\n\t\tfor (int i = 0; i < EditorExport::get_singleton()->get_export_platform_count(); i++) {\n\n\t\t\tRef<EditorExportPlatform> eep = EditorExport::get_singleton()->get_export_platform(i);\n\t\t\tif (eep.is_null())\n\t\t\t\tcontinue;\n\t\t\tRef<ImageTexture> icon = eep->get_run_icon();\n\t\t\tif (!icon.is_null()) {\n\t\t\t\tRef<Image> im = icon->get_data();\n\t\t\t\tim = im->duplicate();\n\t\t\t\tim->clear_mipmaps();\n\t\t\t\tif (!im->empty()) {\n\n\t\t\t\t\tim->resize(16, 16);\n\t\t\t\t\tRef<ImageTexture> small_icon;\n\t\t\t\t\tsmall_icon.instance();\n\t\t\t\t\tsmall_icon->create_from_image(im, 0);\n\t\t\t\t\tMenuButton *mb = memnew(MenuButton);\n\t\t\t\t\tmb->get_popup()->connect(\"id_pressed\", this, \"_run_native\", varray(i));\n\t\t\t\t\t\/\/mb->connect(\"pressed\", this, \"_run_native\", varray(-1, i));\n\t\t\t\t\tmb->set_icon(small_icon);\n\t\t\t\t\tadd_child(mb);\n\t\t\t\t\tmenus[i] = mb;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\n\tif (p_what == NOTIFICATION_PROCESS) {\n\n\t\tbool changed = EditorExport::get_singleton()->poll_export_platforms() || first;\n\n\t\tif (changed) {\n\n\t\t\tfor (Map<int, MenuButton *>::Element *E = menus.front(); E; E = E->next()) {\n\n\t\t\t\tRef<EditorExportPlatform> eep = EditorExport::get_singleton()->get_export_platform(E->key());\n\t\t\t\tMenuButton *mb = E->get();\n\t\t\t\tint dc = eep->get_device_count();\n\n\t\t\t\tif (dc == 0) {\n\t\t\t\t\tmb->hide();\n\t\t\t\t} else {\n\t\t\t\t\tmb->get_popup()->clear();\n\t\t\t\t\tmb->show();\n\t\t\t\t\tmb->set_tooltip(TTR(\"Select device from the list\"));\n\t\t\t\t\tfor (int i = 0; i < dc; i++) {\n\t\t\t\t\t\tmb->get_popup()->add_icon_item(get_icon(\"Play\", \"EditorIcons\"), eep->get_device_name(i));\n\t\t\t\t\t\tmb->get_popup()->set_item_tooltip(mb->get_popup()->get_item_count() - 1, eep->get_device_info(i).strip_edges());\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\n\t\t\tfirst = false;\n\t\t}\n\t}\n}\n\nvoid EditorRunNative::_run_native(int p_idx, int p_platform) {\n\n\tRef<EditorExportPlatform> eep = EditorExport::get_singleton()->get_export_platform(p_platform);\n\tERR_FAIL_COND(eep.is_null());\n\t\/*if (p_idx == -1) {\n\t\tif (eep->get_device_count() == 1) {\n\t\t\tmenus[p_platform]->get_popup()->hide();\n\t\t\tp_idx = 0;\n\t\t} else {\n\t\t\treturn;\n\t\t}\n\t}*\/\n\n\tRef<EditorExportPreset> preset;\n\n\tfor (int i = 0; i < EditorExport::get_singleton()->get_export_preset_count(); i++) {\n\n\t\tRef<EditorExportPreset> ep = EditorExport::get_singleton()->get_export_preset(i);\n\t\tif (ep->is_runnable() && ep->get_platform() == eep) {\n\t\t\tpreset = ep;\n\t\t\tbreak;\n\t\t}\n\t}\n\n\tif (preset.is_null()) {\n\t\tEditorNode::get_singleton()->show_warning(TTR(\"No runnable export preset found for this platform.\\nPlease add a runnable preset in the export menu.\"));\n\t\treturn;\n\t}\n\n\temit_signal(\"native_run\");\n\n\tint flags = 0;\n\tif (deploy_debug_remote)\n\t\tflags |= EditorExportPlatform::DEBUG_FLAG_REMOTE_DEBUG;\n\tif (deploy_dumb)\n\t\tflags |= EditorExportPlatform::DEBUG_FLAG_DUMB_CLIENT;\n\tif (debug_collisions)\n\t\tflags |= EditorExportPlatform::DEBUG_FLAG_VIEW_COLLISONS;\n\tif (debug_navigation)\n\t\tflags |= EditorExportPlatform::DEBUG_FLAG_VIEW_NAVIGATION;\n\n\teep->run(preset, p_idx, flags);\n}\n\nvoid EditorRunNative::_bind_methods() {\n\n\tClassDB::bind_method(\"_run_native\", &EditorRunNative::_run_native);\n\n\tADD_SIGNAL(MethodInfo(\"native_run\"));\n}\n\nvoid EditorRunNative::set_deploy_dumb(bool p_enabled) {\n\n\tdeploy_dumb = p_enabled;\n}\n\nbool EditorRunNative::is_deploy_dumb_enabled() const {\n\n\treturn deploy_dumb;\n}\n\nvoid EditorRunNative::set_deploy_debug_remote(bool p_enabled) {\n\n\tdeploy_debug_remote = p_enabled;\n}\n\nbool EditorRunNative::is_deploy_debug_remote_enabled() const {\n\n\treturn deploy_debug_remote;\n}\n\nvoid EditorRunNative::set_debug_collisions(bool p_debug) {\n\n\tdebug_collisions = p_debug;\n}\n\nbool EditorRunNative::get_debug_collisions() const {\n\n\treturn debug_collisions;\n}\n\nvoid EditorRunNative::set_debug_navigation(bool p_debug) {\n\n\tdebug_navigation = p_debug;\n}\n\nbool EditorRunNative::get_debug_navigation() const {\n\n\treturn debug_navigation;\n}\n\nEditorRunNative::EditorRunNative() {\n\tset_process(true);\n\tfirst = true;\n\tdeploy_dumb = false;\n\tdeploy_debug_remote = false;\n\tdebug_collisions = false;\n\tdebug_navigation = false;\n}\n<commit_msg>Resize native run button according to editor scale.<commit_after>\/*************************************************************************\/\n\/* editor_run_native.cpp *\/\n\/*************************************************************************\/\n\/* This file is part of: *\/\n\/* GODOT ENGINE *\/\n\/* https:\/\/godotengine.org *\/\n\/*************************************************************************\/\n\/* Copyright (c) 2007-2019 Juan Linietsky, Ariel Manzur. *\/\n\/* Copyright (c) 2014-2019 Godot Engine contributors (cf. AUTHORS.md) *\/\n\/* *\/\n\/* Permission is hereby granted, free of charge, to any person obtaining *\/\n\/* a copy of this software and associated documentation files (the *\/\n\/* \"Software\"), to deal in the Software without restriction, including *\/\n\/* without limitation the rights to use, copy, modify, merge, publish, *\/\n\/* distribute, sublicense, and\/or sell copies of the Software, and to *\/\n\/* permit persons to whom the Software is furnished to do so, subject to *\/\n\/* the following conditions: *\/\n\/* *\/\n\/* The above copyright notice and this permission notice shall be *\/\n\/* included in all copies or substantial portions of the Software. *\/\n\/* *\/\n\/* THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, *\/\n\/* EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF *\/\n\/* MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT.*\/\n\/* IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY *\/\n\/* CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, *\/\n\/* TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE *\/\n\/* SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE. *\/\n\/*************************************************************************\/\n\n#include \"editor_run_native.h\"\n\n#include \"editor_export.h\"\n#include \"editor_node.h\"\n#include \"editor_scale.h\"\n\nvoid EditorRunNative::_notification(int p_what) {\n\n\tif (p_what == NOTIFICATION_ENTER_TREE) {\n\n\t\tfor (int i = 0; i < EditorExport::get_singleton()->get_export_platform_count(); i++) {\n\n\t\t\tRef<EditorExportPlatform> eep = EditorExport::get_singleton()->get_export_platform(i);\n\t\t\tif (eep.is_null())\n\t\t\t\tcontinue;\n\t\t\tRef<ImageTexture> icon = eep->get_run_icon();\n\t\t\tif (!icon.is_null()) {\n\t\t\t\tRef<Image> im = icon->get_data();\n\t\t\t\tim = im->duplicate();\n\t\t\t\tim->clear_mipmaps();\n\t\t\t\tif (!im->empty()) {\n\n\t\t\t\t\tim->resize(16 * EDSCALE, 16 * EDSCALE);\n\t\t\t\t\tRef<ImageTexture> small_icon;\n\t\t\t\t\tsmall_icon.instance();\n\t\t\t\t\tsmall_icon->create_from_image(im, 0);\n\t\t\t\t\tMenuButton *mb = memnew(MenuButton);\n\t\t\t\t\tmb->get_popup()->connect(\"id_pressed\", this, \"_run_native\", varray(i));\n\t\t\t\t\t\/\/mb->connect(\"pressed\", this, \"_run_native\", varray(-1, i));\n\t\t\t\t\tmb->set_icon(small_icon);\n\t\t\t\t\tadd_child(mb);\n\t\t\t\t\tmenus[i] = mb;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\n\tif (p_what == NOTIFICATION_PROCESS) {\n\n\t\tbool changed = EditorExport::get_singleton()->poll_export_platforms() || first;\n\n\t\tif (changed) {\n\n\t\t\tfor (Map<int, MenuButton *>::Element *E = menus.front(); E; E = E->next()) {\n\n\t\t\t\tRef<EditorExportPlatform> eep = EditorExport::get_singleton()->get_export_platform(E->key());\n\t\t\t\tMenuButton *mb = E->get();\n\t\t\t\tint dc = eep->get_device_count();\n\n\t\t\t\tif (dc == 0) {\n\t\t\t\t\tmb->hide();\n\t\t\t\t} else {\n\t\t\t\t\tmb->get_popup()->clear();\n\t\t\t\t\tmb->show();\n\t\t\t\t\tmb->set_tooltip(TTR(\"Select device from the list\"));\n\t\t\t\t\tfor (int i = 0; i < dc; i++) {\n\t\t\t\t\t\tmb->get_popup()->add_icon_item(get_icon(\"Play\", \"EditorIcons\"), eep->get_device_name(i));\n\t\t\t\t\t\tmb->get_popup()->set_item_tooltip(mb->get_popup()->get_item_count() - 1, eep->get_device_info(i).strip_edges());\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\n\t\t\tfirst = false;\n\t\t}\n\t}\n}\n\nvoid EditorRunNative::_run_native(int p_idx, int p_platform) {\n\n\tRef<EditorExportPlatform> eep = EditorExport::get_singleton()->get_export_platform(p_platform);\n\tERR_FAIL_COND(eep.is_null());\n\t\/*if (p_idx == -1) {\n\t\tif (eep->get_device_count() == 1) {\n\t\t\tmenus[p_platform]->get_popup()->hide();\n\t\t\tp_idx = 0;\n\t\t} else {\n\t\t\treturn;\n\t\t}\n\t}*\/\n\n\tRef<EditorExportPreset> preset;\n\n\tfor (int i = 0; i < EditorExport::get_singleton()->get_export_preset_count(); i++) {\n\n\t\tRef<EditorExportPreset> ep = EditorExport::get_singleton()->get_export_preset(i);\n\t\tif (ep->is_runnable() && ep->get_platform() == eep) {\n\t\t\tpreset = ep;\n\t\t\tbreak;\n\t\t}\n\t}\n\n\tif (preset.is_null()) {\n\t\tEditorNode::get_singleton()->show_warning(TTR(\"No runnable export preset found for this platform.\\nPlease add a runnable preset in the export menu.\"));\n\t\treturn;\n\t}\n\n\temit_signal(\"native_run\");\n\n\tint flags = 0;\n\tif (deploy_debug_remote)\n\t\tflags |= EditorExportPlatform::DEBUG_FLAG_REMOTE_DEBUG;\n\tif (deploy_dumb)\n\t\tflags |= EditorExportPlatform::DEBUG_FLAG_DUMB_CLIENT;\n\tif (debug_collisions)\n\t\tflags |= EditorExportPlatform::DEBUG_FLAG_VIEW_COLLISONS;\n\tif (debug_navigation)\n\t\tflags |= EditorExportPlatform::DEBUG_FLAG_VIEW_NAVIGATION;\n\n\teep->run(preset, p_idx, flags);\n}\n\nvoid EditorRunNative::_bind_methods() {\n\n\tClassDB::bind_method(\"_run_native\", &EditorRunNative::_run_native);\n\n\tADD_SIGNAL(MethodInfo(\"native_run\"));\n}\n\nvoid EditorRunNative::set_deploy_dumb(bool p_enabled) {\n\n\tdeploy_dumb = p_enabled;\n}\n\nbool EditorRunNative::is_deploy_dumb_enabled() const {\n\n\treturn deploy_dumb;\n}\n\nvoid EditorRunNative::set_deploy_debug_remote(bool p_enabled) {\n\n\tdeploy_debug_remote = p_enabled;\n}\n\nbool EditorRunNative::is_deploy_debug_remote_enabled() const {\n\n\treturn deploy_debug_remote;\n}\n\nvoid EditorRunNative::set_debug_collisions(bool p_debug) {\n\n\tdebug_collisions = p_debug;\n}\n\nbool EditorRunNative::get_debug_collisions() const {\n\n\treturn debug_collisions;\n}\n\nvoid EditorRunNative::set_debug_navigation(bool p_debug) {\n\n\tdebug_navigation = p_debug;\n}\n\nbool EditorRunNative::get_debug_navigation() const {\n\n\treturn debug_navigation;\n}\n\nEditorRunNative::EditorRunNative() {\n\tset_process(true);\n\tfirst = true;\n\tdeploy_dumb = false;\n\tdeploy_debug_remote = false;\n\tdebug_collisions = false;\n\tdebug_navigation = false;\n}\n<|endoftext|>"} {"text":"<commit_before>\/\/======================================================================\n\n#include \"TimeLayer.h\"\n#include \"Config.h\"\n#include \"Hash.h\"\n#include \"Layer.h\"\n#include \"LonLatToXYTransformation.h\"\n#include \"State.h\"\n#include <boost\/date_time\/local_time\/local_time.hpp>\n#include <boost\/date_time\/posix_time\/posix_time.hpp>\n\n#include <ctpp2\/CDT.hpp>\n#include <fmt\/time.h>\n#include <gis\/Box.h>\n#include <spine\/Exception.h>\n#include <spine\/Json.h>\n\/\/ TODO:\n#include <boost\/timer\/timer.hpp>\n\nnamespace SmartMet\n{\nnamespace Plugin\n{\nnamespace Dali\n{\n\/\/ ----------------------------------------------------------------------\n\/*!\n * \\brief Initialize from JSON\n *\/\n\/\/ ----------------------------------------------------------------------\n\nvoid TimeLayer::init(const Json::Value& theJson,\n const State& theState,\n const Config& theConfig,\n const Properties& theProperties)\n{\n try\n {\n \/\/ Initialize this variable only once!\n now = boost::posix_time::second_clock::universal_time();\n\n if (!theJson.isObject())\n throw Spine::Exception(BCP, \"Time-layer JSON is not a JSON object\");\n\n Layer::init(theJson, theState, theConfig, theProperties);\n\n \/\/ Extract member values\n\n Json::Value nulljson;\n\n auto json = theJson.get(\"timezone\", nulljson);\n if (!json.isNull())\n timezone = json.asString();\n\n json = theJson.get(\"prefix\", nulljson);\n if (!json.isNull())\n prefix = json.asString();\n\n json = theJson.get(\"suffix\", nulljson);\n if (!json.isNull())\n suffix = json.asString();\n\n json = theJson.get(\"timestamp\", nulljson);\n if (!json.isNull())\n {\n if (json.isArray())\n {\n for (unsigned int i = 0; i < json.size(); i++)\n timestamp.push_back(json[i].asString());\n }\n else\n timestamp.push_back(json.asString());\n }\n\n json = theJson.get(\"formatter\", nulljson);\n if (!json.isNull())\n {\n formatter = json.asString();\n if (formatter != \"boost\" && formatter != \"strftime\" && formatter != \"fmt\")\n throw Spine::Exception(BCP, \"Unknown time formatter '\" + formatter + \"'\");\n }\n\n json = theJson.get(\"format\", nulljson);\n if (!json.isNull())\n {\n if (json.isArray())\n {\n for (unsigned int i = 0; i < json.size(); i++)\n format.push_back(json[i].asString());\n }\n else\n format.push_back(json.asString());\n }\n\n auto longitudeJson = theJson.get(\"longitude\", nulljson);\n auto latitudeJson = theJson.get(\"latitude\", nulljson);\n if (!longitudeJson.isNull() && !latitudeJson.isNull())\n {\n double longitude = longitudeJson.asDouble();\n double latitude = latitudeJson.asDouble();\n double xCoord = 0;\n double yCoord = 0;\n LonLatToXYTransformation transformation(projection);\n transformation.transform(longitude, latitude, xCoord, yCoord);\n x = xCoord;\n y = yCoord;\n }\n else\n {\n json = theJson.get(\"x\", nulljson);\n if (!json.isNull())\n x = json.asInt();\n\n json = theJson.get(\"y\", nulljson);\n if (!json.isNull())\n y = json.asInt();\n }\n }\n catch (...)\n {\n throw Spine::Exception::Trace(BCP, \"Operation failed!\");\n }\n}\n\n\/\/ ----------------------------------------------------------------------\n\/*!\n * \\brief Generate the layer details into the template hash\n *\/\n\/\/ ----------------------------------------------------------------------\n\nvoid TimeLayer::generate(CTPP::CDT& theGlobals, CTPP::CDT& theLayersCdt, State& theState)\n{\n try\n {\n if (!validLayer(theState))\n return;\n\n \/\/ Time execution\n\n std::string report = \"TimeLayer::generate finished in %t sec CPU, %w sec real\\n\";\n boost::movelib::unique_ptr<boost::timer::auto_cpu_timer> timer;\n if (theState.useTimer())\n timer = boost::movelib::make_unique<boost::timer::auto_cpu_timer>(2, report);\n\n \/\/ Establish the data\n auto q = getModel(theState);\n\n \/\/ Establish the valid time\n\n auto valid_time = getValidTime();\n\n \/\/ Update the globals\n\n if (css)\n {\n std::string name = theState.getCustomer() + \"\/\" + *css;\n theGlobals[\"css\"][name] = theState.getStyle(*css);\n }\n\n \/\/ Generate a <text>cdata<text> layer\n\n CTPP::CDT text_cdt(CTPP::CDT::HASH_VAL);\n text_cdt[\"start\"] = \"<text\";\n text_cdt[\"end\"] = \"<\/text>\";\n\n \/\/ Add attributes to the text tag\n theState.addAttributes(theGlobals, text_cdt, attributes);\n\n \/\/ Override X and Y coordinates if so requested\n\n if (x || y)\n {\n projection.update(q);\n const auto& box = projection.getBox();\n\n if (x)\n text_cdt[\"attributes\"][\"x\"] = ((*x) >= 0 ? (*x) : box.width() + (*x));\n if (y)\n text_cdt[\"attributes\"][\"y\"] = ((*y) >= 0 ? (*y) : box.height() + (*y));\n }\n\n \/\/ Establish the text to be added\n\n auto tz =\n theState.getGeoEngine().getTimeZones().time_zone_from_string(timezone ? *timezone : \"UTC\");\n\n \/\/ Set defaults and validate input.\n\n if (timestamp.empty())\n timestamp.push_back(\"validtime\");\n\n if (format.empty())\n format.push_back(\"%Y-%m-%d %H:%M\");\n\n if (timestamp.size() != format.size())\n throw Spine::Exception(BCP,\n \"TimeLayer timestamp and format arrays should be of the same size\");\n\n \/\/ Create the output\n std::ostringstream msg;\n msg << prefix;\n\n for (auto i = 0ul; i < timestamp.size(); i++)\n {\n auto name = timestamp[i];\n auto fmt = format[i];\n\n if (name.empty())\n throw Spine::Exception(BCP, \"TimeLayer timestamp setting cannot be an empty string\");\n if (fmt.empty())\n throw Spine::Exception(BCP, \"TimeLayer format setting cannot be an empty string\");\n\n boost::optional<boost::local_time::local_date_time> loctime;\n boost::optional<boost::posix_time::time_duration> duration;\n\n if (name == \"validtime\")\n {\n loctime = boost::local_time::local_date_time(valid_time, tz);\n }\n else if (name == \"origintime\")\n {\n if (!q)\n throw Spine::Exception(BCP, \"Origintime not avaible for TimeLayer\");\n loctime = boost::local_time::local_date_time(q->originTime(), tz);\n }\n else if (name == \"wallclock\" || name == \"now\")\n {\n loctime = boost::local_time::local_date_time(now, tz);\n }\n else if (name == \"starttime\")\n {\n auto tmp = boost::local_time::local_date_time(valid_time, tz);\n if (interval_start)\n tmp -= boost::posix_time::minutes(*interval_start);\n loctime = tmp;\n }\n else if (name == \"endtime\")\n {\n auto tmp = boost::local_time::local_date_time(valid_time, tz);\n if (interval_end)\n tmp += boost::posix_time::minutes(*interval_end);\n loctime = tmp;\n }\n else if (name == \"leadtime\")\n {\n if (!q)\n throw Spine::Exception(BCP, \"Origintime not avaible for TimeLayer\");\n duration = valid_time - q->originTime();\n }\n else if (name == \"leadhour\")\n {\n if (!q)\n throw Spine::Exception(BCP, \"Origintime not avaible for TimeLayer\");\n boost::posix_time::ptime ot = q->originTime();\n duration =\n valid_time - ot + ot.time_of_day() - boost::posix_time::hours(ot.time_of_day().hours());\n }\n else if (name == \"time_offset\")\n {\n duration = boost::posix_time::minutes(time_offset ? *time_offset : 0);\n }\n else if (name == \"interval_start\")\n {\n duration = boost::posix_time::minutes(interval_start ? *interval_start : 0);\n }\n else if (name == \"interval_end\")\n {\n duration = boost::posix_time::minutes(interval_end ? *interval_end : 0);\n }\n else\n {\n loctime = boost::local_time::local_date_time(valid_time, tz) +\n Fmi::TimeParser::parse_duration(name);\n }\n\n \/\/ durations are always formatted with boost\n if (!loctime || formatter == \"boost\")\n {\n try\n {\n auto* facet = new boost::posix_time::time_facet(fmt.c_str());\n msg.imbue(std::locale(msg.getloc(), facet));\n\n if (loctime)\n msg << loctime->local_time();\n else\n msg << *duration;\n }\n catch (...)\n {\n throw Spine::Exception::Trace(BCP, \"Failed to format time with Boost\")\n .addParameter(\"format\", \"'\" + fmt + \"'\");\n }\n }\n else if (formatter == \"strftime\")\n {\n auto timeinfo = to_tm(loctime->local_time());\n char buffer[100];\n if (!strftime(buffer, 100, fmt.c_str(), &timeinfo))\n {\n throw Spine::Exception(BCP, \"Failed to format a non-empty time string with strftime\")\n .addParameter(\"format\", \"'\" + fmt + \"'\");\n }\n msg << buffer;\n }\n else if (formatter == \"fmt\")\n {\n try\n {\n auto timeinfo = to_tm(loctime->local_time());\n msg << fmt::format(fmt, timeinfo);\n }\n catch (...)\n {\n throw Spine::Exception::Trace(BCP, \"Failed to format time with fmt\")\n .addParameter(\"format\", \"'\" + fmt + \"'\");\n }\n }\n\n else\n throw Spine::Exception(BCP, \"Unknown TimeLayer time formatter '\" + formatter + \"'\");\n }\n msg << suffix;\n\n text_cdt[\"cdata\"] = msg.str();\n theLayersCdt.PushBack(text_cdt);\n }\n catch (...)\n {\n throw Spine::Exception::Trace(BCP, \"Operation failed!\");\n }\n}\n\n\/\/ ----------------------------------------------------------------------\n\/*!\n * \\brief Hash value\n *\/\n\/\/ ----------------------------------------------------------------------\n\nstd::size_t TimeLayer::hash_value(const State& theState) const\n{\n try\n {\n auto hash = Layer::hash_value(theState);\n boost::hash_combine(hash, Engine::Querydata::hash_value(getModel(theState)));\n boost::hash_combine(hash, Dali::hash_value(timezone));\n boost::hash_combine(hash, Dali::hash_value(prefix));\n boost::hash_combine(hash, Dali::hash_value(suffix));\n boost::hash_combine(hash, Dali::hash_value(timestamp));\n boost::hash_combine(hash, Dali::hash_value(format));\n boost::hash_combine(hash, Dali::hash_value(formatter));\n boost::hash_combine(hash, Dali::hash_value(x));\n boost::hash_combine(hash, Dali::hash_value(y));\n boost::hash_combine(hash, Dali::hash_value(longitude));\n boost::hash_combine(hash, Dali::hash_value(latitude));\n\n \/\/ TODO: The timestamp to be drawn may depend on the wall clock - must include it\n \/\/ in the hash. A better solution would be to format the timestamp and\n \/\/ then calculate the hash.\n\n for (const auto& name : timestamp)\n {\n if (name == \"wallclock\" || name == \"now\")\n boost::hash_combine(hash, Dali::hash_value(now));\n }\n\n return hash;\n }\n catch (...)\n {\n throw Spine::Exception::Trace(BCP, \"Operation failed!\");\n }\n}\n\n} \/\/ namespace Dali\n} \/\/ namespace Plugin\n} \/\/ namespace SmartMet\n<commit_msg>do not implicitly decay an array into a pointer<commit_after>\/\/======================================================================\n\n#include \"TimeLayer.h\"\n#include \"Config.h\"\n#include \"Hash.h\"\n#include \"Layer.h\"\n#include \"LonLatToXYTransformation.h\"\n#include \"State.h\"\n#include <boost\/date_time\/local_time\/local_time.hpp>\n#include <boost\/date_time\/posix_time\/posix_time.hpp>\n\n#include <ctpp2\/CDT.hpp>\n#include <fmt\/time.h>\n#include <gis\/Box.h>\n#include <spine\/Exception.h>\n#include <spine\/Json.h>\n\/\/ TODO:\n#include <boost\/timer\/timer.hpp>\n\nnamespace SmartMet\n{\nnamespace Plugin\n{\nnamespace Dali\n{\n\/\/ ----------------------------------------------------------------------\n\/*!\n * \\brief Initialize from JSON\n *\/\n\/\/ ----------------------------------------------------------------------\n\nvoid TimeLayer::init(const Json::Value& theJson,\n const State& theState,\n const Config& theConfig,\n const Properties& theProperties)\n{\n try\n {\n \/\/ Initialize this variable only once!\n now = boost::posix_time::second_clock::universal_time();\n\n if (!theJson.isObject())\n throw Spine::Exception(BCP, \"Time-layer JSON is not a JSON object\");\n\n Layer::init(theJson, theState, theConfig, theProperties);\n\n \/\/ Extract member values\n\n Json::Value nulljson;\n\n auto json = theJson.get(\"timezone\", nulljson);\n if (!json.isNull())\n timezone = json.asString();\n\n json = theJson.get(\"prefix\", nulljson);\n if (!json.isNull())\n prefix = json.asString();\n\n json = theJson.get(\"suffix\", nulljson);\n if (!json.isNull())\n suffix = json.asString();\n\n json = theJson.get(\"timestamp\", nulljson);\n if (!json.isNull())\n {\n if (json.isArray())\n {\n for (unsigned int i = 0; i < json.size(); i++)\n timestamp.push_back(json[i].asString());\n }\n else\n timestamp.push_back(json.asString());\n }\n\n json = theJson.get(\"formatter\", nulljson);\n if (!json.isNull())\n {\n formatter = json.asString();\n if (formatter != \"boost\" && formatter != \"strftime\" && formatter != \"fmt\")\n throw Spine::Exception(BCP, \"Unknown time formatter '\" + formatter + \"'\");\n }\n\n json = theJson.get(\"format\", nulljson);\n if (!json.isNull())\n {\n if (json.isArray())\n {\n for (unsigned int i = 0; i < json.size(); i++)\n format.push_back(json[i].asString());\n }\n else\n format.push_back(json.asString());\n }\n\n auto longitudeJson = theJson.get(\"longitude\", nulljson);\n auto latitudeJson = theJson.get(\"latitude\", nulljson);\n if (!longitudeJson.isNull() && !latitudeJson.isNull())\n {\n double longitude = longitudeJson.asDouble();\n double latitude = latitudeJson.asDouble();\n double xCoord = 0;\n double yCoord = 0;\n LonLatToXYTransformation transformation(projection);\n transformation.transform(longitude, latitude, xCoord, yCoord);\n x = xCoord;\n y = yCoord;\n }\n else\n {\n json = theJson.get(\"x\", nulljson);\n if (!json.isNull())\n x = json.asInt();\n\n json = theJson.get(\"y\", nulljson);\n if (!json.isNull())\n y = json.asInt();\n }\n }\n catch (...)\n {\n throw Spine::Exception::Trace(BCP, \"Operation failed!\");\n }\n}\n\n\/\/ ----------------------------------------------------------------------\n\/*!\n * \\brief Generate the layer details into the template hash\n *\/\n\/\/ ----------------------------------------------------------------------\n\nvoid TimeLayer::generate(CTPP::CDT& theGlobals, CTPP::CDT& theLayersCdt, State& theState)\n{\n try\n {\n if (!validLayer(theState))\n return;\n\n \/\/ Time execution\n\n std::string report = \"TimeLayer::generate finished in %t sec CPU, %w sec real\\n\";\n boost::movelib::unique_ptr<boost::timer::auto_cpu_timer> timer;\n if (theState.useTimer())\n timer = boost::movelib::make_unique<boost::timer::auto_cpu_timer>(2, report);\n\n \/\/ Establish the data\n auto q = getModel(theState);\n\n \/\/ Establish the valid time\n\n auto valid_time = getValidTime();\n\n \/\/ Update the globals\n\n if (css)\n {\n std::string name = theState.getCustomer() + \"\/\" + *css;\n theGlobals[\"css\"][name] = theState.getStyle(*css);\n }\n\n \/\/ Generate a <text>cdata<text> layer\n\n CTPP::CDT text_cdt(CTPP::CDT::HASH_VAL);\n text_cdt[\"start\"] = \"<text\";\n text_cdt[\"end\"] = \"<\/text>\";\n\n \/\/ Add attributes to the text tag\n theState.addAttributes(theGlobals, text_cdt, attributes);\n\n \/\/ Override X and Y coordinates if so requested\n\n if (x || y)\n {\n projection.update(q);\n const auto& box = projection.getBox();\n\n if (x)\n text_cdt[\"attributes\"][\"x\"] = ((*x) >= 0 ? (*x) : box.width() + (*x));\n if (y)\n text_cdt[\"attributes\"][\"y\"] = ((*y) >= 0 ? (*y) : box.height() + (*y));\n }\n\n \/\/ Establish the text to be added\n\n auto tz =\n theState.getGeoEngine().getTimeZones().time_zone_from_string(timezone ? *timezone : \"UTC\");\n\n \/\/ Set defaults and validate input.\n\n if (timestamp.empty())\n timestamp.push_back(\"validtime\");\n\n if (format.empty())\n format.push_back(\"%Y-%m-%d %H:%M\");\n\n if (timestamp.size() != format.size())\n throw Spine::Exception(BCP,\n \"TimeLayer timestamp and format arrays should be of the same size\");\n\n \/\/ Create the output\n std::ostringstream msg;\n msg << prefix;\n\n for (auto i = 0ul; i < timestamp.size(); i++)\n {\n auto name = timestamp[i];\n auto fmt = format[i];\n\n if (name.empty())\n throw Spine::Exception(BCP, \"TimeLayer timestamp setting cannot be an empty string\");\n if (fmt.empty())\n throw Spine::Exception(BCP, \"TimeLayer format setting cannot be an empty string\");\n\n boost::optional<boost::local_time::local_date_time> loctime;\n boost::optional<boost::posix_time::time_duration> duration;\n\n if (name == \"validtime\")\n {\n loctime = boost::local_time::local_date_time(valid_time, tz);\n }\n else if (name == \"origintime\")\n {\n if (!q)\n throw Spine::Exception(BCP, \"Origintime not avaible for TimeLayer\");\n loctime = boost::local_time::local_date_time(q->originTime(), tz);\n }\n else if (name == \"wallclock\" || name == \"now\")\n {\n loctime = boost::local_time::local_date_time(now, tz);\n }\n else if (name == \"starttime\")\n {\n auto tmp = boost::local_time::local_date_time(valid_time, tz);\n if (interval_start)\n tmp -= boost::posix_time::minutes(*interval_start);\n loctime = tmp;\n }\n else if (name == \"endtime\")\n {\n auto tmp = boost::local_time::local_date_time(valid_time, tz);\n if (interval_end)\n tmp += boost::posix_time::minutes(*interval_end);\n loctime = tmp;\n }\n else if (name == \"leadtime\")\n {\n if (!q)\n throw Spine::Exception(BCP, \"Origintime not avaible for TimeLayer\");\n duration = valid_time - q->originTime();\n }\n else if (name == \"leadhour\")\n {\n if (!q)\n throw Spine::Exception(BCP, \"Origintime not avaible for TimeLayer\");\n boost::posix_time::ptime ot = q->originTime();\n duration =\n valid_time - ot + ot.time_of_day() - boost::posix_time::hours(ot.time_of_day().hours());\n }\n else if (name == \"time_offset\")\n {\n duration = boost::posix_time::minutes(time_offset ? *time_offset : 0);\n }\n else if (name == \"interval_start\")\n {\n duration = boost::posix_time::minutes(interval_start ? *interval_start : 0);\n }\n else if (name == \"interval_end\")\n {\n duration = boost::posix_time::minutes(interval_end ? *interval_end : 0);\n }\n else\n {\n loctime = boost::local_time::local_date_time(valid_time, tz) +\n Fmi::TimeParser::parse_duration(name);\n }\n\n \/\/ durations are always formatted with boost\n if (!loctime || formatter == \"boost\")\n {\n try\n {\n auto* facet = new boost::posix_time::time_facet(fmt.c_str());\n msg.imbue(std::locale(msg.getloc(), facet));\n\n if (loctime)\n msg << loctime->local_time();\n else\n msg << *duration;\n }\n catch (...)\n {\n throw Spine::Exception::Trace(BCP, \"Failed to format time with Boost\")\n .addParameter(\"format\", \"'\" + fmt + \"'\");\n }\n }\n else if (formatter == \"strftime\")\n {\n auto timeinfo = to_tm(loctime->local_time());\n char buffer[100];\n if (!strftime(static_cast<char*>(buffer), 100, fmt.c_str(), &timeinfo))\n {\n throw Spine::Exception(BCP, \"Failed to format a non-empty time string with strftime\")\n .addParameter(\"format\", \"'\" + fmt + \"'\");\n }\n msg << static_cast<char*>(buffer);\n }\n else if (formatter == \"fmt\")\n {\n try\n {\n auto timeinfo = to_tm(loctime->local_time());\n msg << fmt::format(fmt, timeinfo);\n }\n catch (...)\n {\n throw Spine::Exception::Trace(BCP, \"Failed to format time with fmt\")\n .addParameter(\"format\", \"'\" + fmt + \"'\");\n }\n }\n\n else\n throw Spine::Exception(BCP, \"Unknown TimeLayer time formatter '\" + formatter + \"'\");\n }\n msg << suffix;\n\n text_cdt[\"cdata\"] = msg.str();\n theLayersCdt.PushBack(text_cdt);\n }\n catch (...)\n {\n throw Spine::Exception::Trace(BCP, \"Operation failed!\");\n }\n}\n\n\/\/ ----------------------------------------------------------------------\n\/*!\n * \\brief Hash value\n *\/\n\/\/ ----------------------------------------------------------------------\n\nstd::size_t TimeLayer::hash_value(const State& theState) const\n{\n try\n {\n auto hash = Layer::hash_value(theState);\n boost::hash_combine(hash, Engine::Querydata::hash_value(getModel(theState)));\n boost::hash_combine(hash, Dali::hash_value(timezone));\n boost::hash_combine(hash, Dali::hash_value(prefix));\n boost::hash_combine(hash, Dali::hash_value(suffix));\n boost::hash_combine(hash, Dali::hash_value(timestamp));\n boost::hash_combine(hash, Dali::hash_value(format));\n boost::hash_combine(hash, Dali::hash_value(formatter));\n boost::hash_combine(hash, Dali::hash_value(x));\n boost::hash_combine(hash, Dali::hash_value(y));\n boost::hash_combine(hash, Dali::hash_value(longitude));\n boost::hash_combine(hash, Dali::hash_value(latitude));\n\n \/\/ TODO: The timestamp to be drawn may depend on the wall clock - must include it\n \/\/ in the hash. A better solution would be to format the timestamp and\n \/\/ then calculate the hash.\n\n for (const auto& name : timestamp)\n {\n if (name == \"wallclock\" || name == \"now\")\n boost::hash_combine(hash, Dali::hash_value(now));\n }\n\n return hash;\n }\n catch (...)\n {\n throw Spine::Exception::Trace(BCP, \"Operation failed!\");\n }\n}\n\n} \/\/ namespace Dali\n} \/\/ namespace Plugin\n} \/\/ namespace SmartMet\n<|endoftext|>"} {"text":"<commit_before>\/* \n Copyright(C) 2014 Naoya Murakami <naoya@createfield.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 This file includes the original word2vec's code. https:\/\/code.google.com\/p\/word2vec\/\n The following is the header of the file:\n\n Copyright 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\n#include <stdio.h>\n#include <string.h>\n#include <iostream>\n#include <fstream>\n#include <algorithm>\n#include <string>\n#include <stdexcept>\n#include <vector>\n\n#include <math.h>\n#include <malloc.h>\n\n#include <unicode\/normlzr.h>\n#include <re2\/re2.h>\n#include <google\/gflags.h>\n\nDEFINE_string(file_path, \"\", \"Input binary file learned by word2vec\");\nDEFINE_string(input, \"\", \"Input expression string\");\nDEFINE_int32(output, 1, \"1:word,discatnce 2:word 3:split by commma 4:split by tab\");\nDEFINE_int32(offset, 0, \"offset\");\nDEFINE_int32(limit, -1, \"limit -1:all\");\nDEFINE_double(threshold, 0, \"threshold (ex. --threshold 0.75)\");\nDEFINE_bool(no_normalize, false, \"Don't use NFKC normalize\");\nDEFINE_string(term_filter, \"\", \"Filter by regular expresion pattern to term\");\nDEFINE_string(output_filter, \"\", \"Cut by regular expresion pattern to term\");\nDEFINE_bool(server, false, \"Server mode\");\nDEFINE_string(ip, \"\", \"IP address\");\nDEFINE_string(port, \"\", \"Port number\");\nDEFINE_bool(h, false, \"Help message\");\n\nusing namespace std;\n\nconst long long max_size = 2000; \/\/ max length of strings\nconst long long N = 40; \/\/ number of closest words that will be shown\nconst long long max_w = 50; \/\/ max length of vocabulary entries\n\nlong long words, size = 0;\nfloat *M = NULL;\nchar *vocab = NULL;\n\nstring\nnormalize(const string str)\n{\n icu::UnicodeString src;\n icu::UnicodeString dest;\n src = str.c_str();\n UErrorCode status;\n status = U_ZERO_ERROR;\n Normalizer::normalize(src, UNORM_NFKC, 0, dest, status);\n if(U_FAILURE(status)) {\n throw runtime_error(\"Unicode normalization failed\");\n }\n string result;\n dest.toUTF8String(result);\n transform(result.begin(), result.end(), result.begin(), ::tolower);\n return result;\n}\n\nbool\nword2vec_load(const char *file_name)\n{\n FILE *f;\n float len;\n long long a, b;\n char ch;\n\n f = fopen(file_name, \"rb\");\n if (f == NULL) {\n printf(\"Input file not found : %s\\n\", file_name);\n return false;\n }\n\n fscanf(f, \"%lld\", &words);\n fscanf(f, \"%lld\", &size);\n vocab = (char *)malloc((long long)words * max_w * sizeof(char));\n M = (float *)malloc((long long)words * (long long)size * sizeof(float));\n if (M == NULL) {\n printf(\"Cannot allocate memory: %lld MB %lld %lld\", \n (long long)words * size * sizeof(float) \/ 1048576, words, size);\n return false;\n }\n for (b = 0; b < words; b++) {\n fscanf(f, \"%s%c\", &vocab[b * max_w], &ch);\n for (a = 0; a < size; a++) fread(&M[a + b * size], sizeof(float), 1, f);\n len = 0;\n for (a = 0; a < size; a++) len += M[a + b * size] * M[a + b * size];\n len = sqrt(len);\n for (a = 0; a < size; a++) M[a + b * size] \/= len;\n }\n fclose(f);\n\n return true;\n}\n\nvector<string>\nsplit(const string &str, char delim){\n vector<string> res;\n size_t current = 0, found;\n while((found = str.find_first_of(delim, current)) != string::npos){\n res.push_back(string(str, current, found - current));\n current = found + 1;\n }\n res.push_back(string(str, current, str.size() - current));\n return res;\n}\n\nint\ncalc(string str, int output, int offset, int limit, double threshold,\n bool no_normalize, const char *term_filter, const char *output_filter){\n char st1[max_size];\n char bestw[N][max_size];\n char st[100][max_size];\n char op[100];\n float dist, len, bestd[N], vec[max_size];\n long long a, b, c, d, cn, bi[100];\n\n for (a = 0; a < N; a++) bestd[a] = 0;\n for (a = 0; a < N; a++) bestw[a][0] = 0;\n\n st1[0] = 0;\n\n for(unsigned int i = 0; i < 100; i++){\n st[i][0] = 0;\n op[i] = '+';\n }\n\n if(!no_normalize){\n str = normalize(str);\n }\n\n vector<string> result_array;\n result_array = split(str, ' ');\n string result;\n\n int op_row = 1;\n for(unsigned int i = 0; i < result_array.size(); ++i )\n {\n if(result_array[i] == \"+\"){\n op[op_row] = '+';\n op_row++;\n }\n else if(result_array[i] == \"-\"){\n op[op_row] = '-';\n op_row++;\n } else if(result_array[i] == \"*\"){\n op[op_row] = '*';\n op_row++;\n } else if(result_array[i] == \"\/\"){\n op[op_row] = '\/';\n op_row++;\n } else {\n result += result_array[i];\n if ( i < result_array.size() - 1) {\n result += \" \";\n }\n }\n }\n strcat(st1, result.c_str());\n\n cn = 0;\n b = 0;\n c = 0;\n while (1) {\n st[cn][b] = st1[c];\n b++;\n c++;\n st[cn][b] = 0;\n if (st1[c] == 0) break;\n if (st1[c] == ' ') {\n cn++;\n b = 0;\n c++;\n }\n }\n cn++;\n\n for (a = 0; a < cn; a++) {\n for (b = 0; b < words; b++) if (!strcmp(&vocab[b * max_w], st[a])) break;\n if (b == words) b = 0;\n bi[a] = b;\n if (output == 1) {\n printf(\"\\nWord: %s Position in vocabulary: %lld\\n\", st[a], bi[a]);\n }\n if (b == 0) {\n if (output == 1 || output == 2) {\n printf(\"Out of dictionary word!\\n\");\n }\n break;\n }\n }\n if (b == 0) return -1;\n if(cn == 1) {\n for (a = 0; a < size; a++) vec[a] = 0;\n for (b = 0; b < cn; b++) {\n if (bi[b] == -1) continue;\n for (a = 0; a < size; a++) vec[a] += M[a + bi[b] * size];\n }\n } else {\n for (a = 0; a < size; a++) {\n for (b = 0; b < cn; b++) {\n if(op[b] == '-') {\n vec[a] -= M[a + bi[b] * size];\n } else if(op[b] == '\/') {\n vec[a] \/= M[a + bi[b] * size];\n } else if(op[b] == '*') {\n vec[a] *= M[a + bi[b] * size];\n } else {\n vec[a] += M[a + bi[b] * size];\n }\n }\n }\n }\n\n len = 0;\n for (a = 0; a < size; a++) len += vec[a] * vec[a];\n len = sqrt(len);\n for (a = 0; a < size; a++) vec[a] \/= len;\n for (a = 0; a < N; a++) bestd[a] = 0;\n for (a = 0; a < N; a++) bestw[a][0] = 0;\n for (c = 0; c < words; c++) {\n unsigned int equal = 0;\n for (b = 0; b < cn; b++) {\n if (c == bi[b]) {\n equal = 1;\n break;\n }\n }\n if (equal) continue;\n a = 0;\n for (b = 0; b < cn; b++) if (bi[b] == c) a = 1;\n if (a == 1) continue;\n dist = 0;\n for (a = 0; a < size; a++) dist += vec[a] * M[a + c * size];\n for (a = 0; a < N; a++) {\n if (dist > bestd[a]) {\n for (d = N - 1; d > a; d--) {\n bestd[d] = bestd[d - 1];\n strcpy(bestw[d], bestw[d - 1]);\n }\n bestd[a] = dist;\n strcpy(bestw[a], &vocab[c * max_w]);\n break;\n }\n }\n }\n\n if (threshold > 0 || term_filter != NULL) {\n for (a = 0; a < N; a++) {\n if (threshold > 0 && bestd[a] < threshold) {\n bestd[a] = 0;\n }\n if (term_filter != NULL) {\n string s = bestw[a];\n string t = term_filter;\n if ( RE2::FullMatch(s, t) ) {\n bestd[a] = 0;\n }\n }\n }\n }\n\n unsigned int max;\n if (offset + limit > N) {\n max = N;\n } else {\n max = offset + limit;\n }\n\n for (a = offset; a < max; a++) {\n if (output_filter != NULL) {\n string s = bestw[a];\n re2::RE2::GlobalReplace(&s, output_filter, \"\");\n strcpy(bestw[a],s.c_str());\n }\n if ( a == 0 ) {\n switch(output) {\n case 3 :\n printf(\"%s\", str.c_str());\n printf(\",\");\n break;\n case 4 :\n printf(\"%s\", str.c_str());\n printf(\"\\t\");\n \/\/ for Groonga Groongaのシノニムは自身を含める必要あり。\n if(cn == 1) {\n printf(\"%s\", str.c_str());\n printf(\"\\t\");\n }\n break;\n }\n }\n if (strlen(bestw[a]) > 0 && bestd[a] != 0) {\n if ( a < max - 1){\n switch(output) {\n case 1 :\n printf(\"%f\\t%s\\n\", bestd[a], bestw[a]);\n break;\n case 2 :\n printf(\"%s\\n\", bestw[a]);\n break;\n case 3 :\n printf(\"%s\", bestw[a]);\n printf(\",\");\n break;\n case 4 :\n printf(\"%s\", bestw[a]);\n printf(\"\\t\");\n break;\n }\n } else {\n switch(output) {\n case 1 :\n printf(\"%f\\t%s\\n\", bestd[a], bestw[a]);\n break;\n case 2 :\n printf(\"%s\\n\", bestw[a]);\n break;\n case 3 :\n printf(\"%s\", bestw[a]);\n break;\n case 4 :\n printf(\"%s\", bestw[a]);\n break;\n }\n }\n } else {\n if (max < N) {\n max++;\n }\n }\n }\n printf(\"\\n\");\n\n return 0;\n}\n\nint\nmain(int argc, char **argv) {\n const char *file_name = \"\/var\/lib\/word2vec\/learn.bin\";\n string str;\n\n google::ParseCommandLineFlags(&argc, &argv, true);\n\n if(FLAGS_h == true){\n printf(\" --file_path : Input binary file learned by word2vec\\n\");\n printf(\" --iuput : Input expression string\\n\");\n printf(\" --output : 1:word,discatnce 2:word 3:split by commma 4:split by tab\\n\");\n printf(\" --offset : offset\\n\");\n printf(\" --limit : limit -1:all\\n\");\n printf(\" --threshold : threshold (ex. --threshold 0.75)\\n\");\n printf(\" --no_normalize : Don't use NFKC normalize\\n\");\n printf(\" --term_filter : Filter by regular expresion pattern to term\\n\");\n printf(\" --output_filter : Cut by regular expresion pattern to term\\n\");\n printf(\" --server : Server mode\\n\");\n printf(\" --ip : IP address\\n\");\n printf(\" --port : Port number\\n\");\n exit(0);\n }\n\n if (FLAGS_file_path != \"\") {\n file_name = FLAGS_file_path.c_str();\n }\n\n if(word2vec_load(file_name) == false){\n printf(\"Load file failed\\n\");\n return -1;\n }\n \n int limit;\n if(FLAGS_limit == -1){\n limit = (int)N;\n } else {\n limit = FLAGS_limit;\n }\n if(FLAGS_input == \"\"){\n if(FLAGS_output == 1){\n printf(\"> \");\n }\n while(getline(cin, str)){\n if(str == \"EXIT\"){\n break;\n }\n calc(str, FLAGS_output, FLAGS_offset, limit, FLAGS_threshold,\n FLAGS_no_normalize, FLAGS_term_filter.c_str(),\n FLAGS_output_filter.c_str());\n if(FLAGS_output == 1){\n printf(\"> \");\n }\n }\n } else {\n if(FLAGS_output == 1){\n printf(\"> \");\n }\n ifstream ifs(FLAGS_input.c_str());\n if(ifs.fail()) {\n cerr << \"File do not exist.\\n\";\n exit(0);\n }\n while(getline(ifs, str)){\n calc(str, FLAGS_output, FLAGS_offset, limit, FLAGS_threshold,\n FLAGS_no_normalize, FLAGS_term_filter.c_str(),\n FLAGS_output_filter.c_str());\n if(FLAGS_output == 1){\n printf(\"> \");\n }\n }\n }\n\n return 0;\n}\n<commit_msg>replace fullwidth space to halfwidth space<commit_after>\/* \n Copyright(C) 2014 Naoya Murakami <naoya@createfield.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 This file includes the original word2vec's code. https:\/\/code.google.com\/p\/word2vec\/\n The following is the header of the file:\n\n Copyright 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\n#include <stdio.h>\n#include <string.h>\n#include <iostream>\n#include <fstream>\n#include <algorithm>\n#include <string>\n#include <stdexcept>\n#include <vector>\n\n#include <math.h>\n#include <malloc.h>\n\n#include <unicode\/normlzr.h>\n#include <re2\/re2.h>\n#include <google\/gflags.h>\n\nDEFINE_string(file_path, \"\", \"Input binary file learned by word2vec\");\nDEFINE_string(input, \"\", \"Input expression string\");\nDEFINE_int32(output, 1, \"1:word,discatnce 2:word 3:split by commma 4:split by tab\");\nDEFINE_int32(offset, 0, \"offset\");\nDEFINE_int32(limit, -1, \"limit -1:all\");\nDEFINE_double(threshold, 0, \"threshold (ex. --threshold 0.75)\");\nDEFINE_bool(no_normalize, false, \"Don't use NFKC normalize\");\nDEFINE_string(term_filter, \"\", \"Filter by regular expresion pattern to term\");\nDEFINE_string(output_filter, \"\", \"Cut by regular expresion pattern to term\");\nDEFINE_bool(server, false, \"Server mode\");\nDEFINE_string(ip, \"\", \"IP address\");\nDEFINE_string(port, \"\", \"Port number\");\nDEFINE_bool(h, false, \"Help message\");\n\nusing namespace std;\n\nconst long long max_size = 2000; \/\/ max length of strings\nconst long long N = 40; \/\/ number of closest words that will be shown\nconst long long max_w = 50; \/\/ max length of vocabulary entries\n\nlong long words, size = 0;\nfloat *M = NULL;\nchar *vocab = NULL;\n\nstring\nnormalize(const string str)\n{\n icu::UnicodeString src;\n icu::UnicodeString dest;\n src = str.c_str();\n UErrorCode status;\n status = U_ZERO_ERROR;\n Normalizer::normalize(src, UNORM_NFKC, 0, dest, status);\n if(U_FAILURE(status)) {\n throw runtime_error(\"Unicode normalization failed\");\n }\n string result;\n dest.toUTF8String(result);\n transform(result.begin(), result.end(), result.begin(), ::tolower);\n return result;\n}\n\nbool\nword2vec_load(const char *file_name)\n{\n FILE *f;\n float len;\n long long a, b;\n char ch;\n\n f = fopen(file_name, \"rb\");\n if (f == NULL) {\n printf(\"Input file not found : %s\\n\", file_name);\n return false;\n }\n\n fscanf(f, \"%lld\", &words);\n fscanf(f, \"%lld\", &size);\n vocab = (char *)malloc((long long)words * max_w * sizeof(char));\n M = (float *)malloc((long long)words * (long long)size * sizeof(float));\n if (M == NULL) {\n printf(\"Cannot allocate memory: %lld MB %lld %lld\", \n (long long)words * size * sizeof(float) \/ 1048576, words, size);\n return false;\n }\n for (b = 0; b < words; b++) {\n fscanf(f, \"%s%c\", &vocab[b * max_w], &ch);\n for (a = 0; a < size; a++) fread(&M[a + b * size], sizeof(float), 1, f);\n len = 0;\n for (a = 0; a < size; a++) len += M[a + b * size] * M[a + b * size];\n len = sqrt(len);\n for (a = 0; a < size; a++) M[a + b * size] \/= len;\n }\n fclose(f);\n\n return true;\n}\n\nvector<string>\nsplit(const string &str, char delim){\n vector<string> res;\n size_t current = 0, found;\n while((found = str.find_first_of(delim, current)) != string::npos){\n res.push_back(string(str, current, found - current));\n current = found + 1;\n }\n res.push_back(string(str, current, str.size() - current));\n return res;\n}\n\nint\ncalc(string str, int output, int offset, int limit, double threshold,\n bool no_normalize, const char *term_filter, const char *output_filter){\n char st1[max_size];\n char bestw[N][max_size];\n char st[100][max_size];\n char op[100];\n float dist, len, bestd[N], vec[max_size];\n long long a, b, c, d, cn, bi[100];\n\n for (a = 0; a < N; a++) bestd[a] = 0;\n for (a = 0; a < N; a++) bestw[a][0] = 0;\n\n st1[0] = 0;\n\n for(unsigned int i = 0; i < 100; i++){\n st[i][0] = 0;\n op[i] = '+';\n }\n\n if(!no_normalize){\n str = normalize(str);\n }\n re2::RE2::GlobalReplace(&str, \"　\", \" \");\n\n vector<string> result_array;\n result_array = split(str, ' ');\n string result;\n\n int op_row = 1;\n for(unsigned int i = 0; i < result_array.size(); ++i )\n {\n if(result_array[i] == \"+\"){\n op[op_row] = '+';\n op_row++;\n }\n else if(result_array[i] == \"-\"){\n op[op_row] = '-';\n op_row++;\n } else if(result_array[i] == \"*\"){\n op[op_row] = '*';\n op_row++;\n } else if(result_array[i] == \"\/\"){\n op[op_row] = '\/';\n op_row++;\n } else {\n result += result_array[i];\n if ( i < result_array.size() - 1) {\n result += \" \";\n }\n }\n }\n strcat(st1, result.c_str());\n\n cn = 0;\n b = 0;\n c = 0;\n while (1) {\n st[cn][b] = st1[c];\n b++;\n c++;\n st[cn][b] = 0;\n if (st1[c] == 0) break;\n if (st1[c] == ' ') {\n cn++;\n b = 0;\n c++;\n }\n }\n cn++;\n\n for (a = 0; a < cn; a++) {\n for (b = 0; b < words; b++) if (!strcmp(&vocab[b * max_w], st[a])) break;\n if (b == words) b = 0;\n bi[a] = b;\n if (output == 1) {\n printf(\"\\nWord: %s Position in vocabulary: %lld\\n\", st[a], bi[a]);\n }\n if (b == 0) {\n if (output == 1 || output == 2) {\n printf(\"Out of dictionary word!\\n\");\n }\n break;\n }\n }\n if (b == 0) return -1;\n if(cn == 1) {\n for (a = 0; a < size; a++) vec[a] = 0;\n for (b = 0; b < cn; b++) {\n if (bi[b] == -1) continue;\n for (a = 0; a < size; a++) vec[a] += M[a + bi[b] * size];\n }\n } else {\n for (a = 0; a < size; a++) {\n for (b = 0; b < cn; b++) {\n if(op[b] == '-') {\n vec[a] -= M[a + bi[b] * size];\n } else if(op[b] == '\/') {\n vec[a] \/= M[a + bi[b] * size];\n } else if(op[b] == '*') {\n vec[a] *= M[a + bi[b] * size];\n } else {\n vec[a] += M[a + bi[b] * size];\n }\n }\n }\n }\n\n len = 0;\n for (a = 0; a < size; a++) len += vec[a] * vec[a];\n len = sqrt(len);\n for (a = 0; a < size; a++) vec[a] \/= len;\n for (a = 0; a < N; a++) bestd[a] = 0;\n for (a = 0; a < N; a++) bestw[a][0] = 0;\n for (c = 0; c < words; c++) {\n unsigned int equal = 0;\n for (b = 0; b < cn; b++) {\n if (c == bi[b]) {\n equal = 1;\n break;\n }\n }\n if (equal) continue;\n a = 0;\n for (b = 0; b < cn; b++) if (bi[b] == c) a = 1;\n if (a == 1) continue;\n dist = 0;\n for (a = 0; a < size; a++) dist += vec[a] * M[a + c * size];\n for (a = 0; a < N; a++) {\n if (dist > bestd[a]) {\n for (d = N - 1; d > a; d--) {\n bestd[d] = bestd[d - 1];\n strcpy(bestw[d], bestw[d - 1]);\n }\n bestd[a] = dist;\n strcpy(bestw[a], &vocab[c * max_w]);\n break;\n }\n }\n }\n\n if (threshold > 0 || term_filter != NULL) {\n for (a = 0; a < N; a++) {\n if (threshold > 0 && bestd[a] < threshold) {\n bestd[a] = 0;\n }\n if (term_filter != NULL) {\n string s = bestw[a];\n string t = term_filter;\n if ( RE2::FullMatch(s, t) ) {\n bestd[a] = 0;\n }\n }\n }\n }\n\n unsigned int max;\n if (offset + limit > N) {\n max = N;\n } else {\n max = offset + limit;\n }\n\n for (a = offset; a < max; a++) {\n if (output_filter != NULL) {\n string s = bestw[a];\n re2::RE2::GlobalReplace(&s, output_filter, \"\");\n strcpy(bestw[a],s.c_str());\n }\n if ( a == 0 ) {\n switch(output) {\n case 3 :\n printf(\"%s\", str.c_str());\n printf(\",\");\n break;\n case 4 :\n printf(\"%s\", str.c_str());\n printf(\"\\t\");\n \/\/ for Groonga Groongaのシノニムは自身を含める必要あり。\n if(cn == 1) {\n printf(\"%s\", str.c_str());\n printf(\"\\t\");\n }\n break;\n }\n }\n if (strlen(bestw[a]) > 0 && bestd[a] != 0) {\n if ( a < max - 1){\n switch(output) {\n case 1 :\n printf(\"%f\\t%s\\n\", bestd[a], bestw[a]);\n break;\n case 2 :\n printf(\"%s\\n\", bestw[a]);\n break;\n case 3 :\n printf(\"%s\", bestw[a]);\n printf(\",\");\n break;\n case 4 :\n printf(\"%s\", bestw[a]);\n printf(\"\\t\");\n break;\n }\n } else {\n switch(output) {\n case 1 :\n printf(\"%f\\t%s\\n\", bestd[a], bestw[a]);\n break;\n case 2 :\n printf(\"%s\\n\", bestw[a]);\n break;\n case 3 :\n printf(\"%s\", bestw[a]);\n break;\n case 4 :\n printf(\"%s\", bestw[a]);\n break;\n }\n }\n } else {\n if (max < N) {\n max++;\n }\n }\n }\n printf(\"\\n\");\n\n return 0;\n}\n\nint\nmain(int argc, char **argv) {\n const char *file_name = \"\/var\/lib\/word2vec\/learn.bin\";\n string str;\n\n google::ParseCommandLineFlags(&argc, &argv, true);\n\n if(FLAGS_h == true){\n printf(\" --file_path : Input binary file learned by word2vec\\n\");\n printf(\" --iuput : Input expression string\\n\");\n printf(\" --output : 1:word,discatnce 2:word 3:split by commma 4:split by tab\\n\");\n printf(\" --offset : offset\\n\");\n printf(\" --limit : limit -1:all\\n\");\n printf(\" --threshold : threshold (ex. --threshold 0.75)\\n\");\n printf(\" --no_normalize : Don't use NFKC normalize\\n\");\n printf(\" --term_filter : Filter by regular expresion pattern to term\\n\");\n printf(\" --output_filter : Cut by regular expresion pattern to term\\n\");\n printf(\" --server : Server mode\\n\");\n printf(\" --ip : IP address\\n\");\n printf(\" --port : Port number\\n\");\n exit(0);\n }\n\n if (FLAGS_file_path != \"\") {\n file_name = FLAGS_file_path.c_str();\n }\n\n if(word2vec_load(file_name) == false){\n printf(\"Load file failed\\n\");\n return -1;\n }\n \n int limit;\n if(FLAGS_limit == -1){\n limit = (int)N;\n } else {\n limit = FLAGS_limit;\n }\n if(FLAGS_input == \"\"){\n if(FLAGS_output == 1){\n printf(\"> \");\n }\n while(getline(cin, str)){\n if(str == \"EXIT\"){\n break;\n }\n calc(str, FLAGS_output, FLAGS_offset, limit, FLAGS_threshold,\n FLAGS_no_normalize, FLAGS_term_filter.c_str(),\n FLAGS_output_filter.c_str());\n if(FLAGS_output == 1){\n printf(\"> \");\n }\n }\n } else {\n if(FLAGS_output == 1){\n printf(\"> \");\n }\n ifstream ifs(FLAGS_input.c_str());\n if(ifs.fail()) {\n cerr << \"File do not exist.\\n\";\n exit(0);\n }\n while(getline(ifs, str)){\n calc(str, FLAGS_output, FLAGS_offset, limit, FLAGS_threshold,\n FLAGS_no_normalize, FLAGS_term_filter.c_str(),\n FLAGS_output_filter.c_str());\n if(FLAGS_output == 1){\n printf(\"> \");\n }\n }\n }\n\n return 0;\n}\n<|endoftext|>"} {"text":"<commit_before>\/*************************************************************************\n *\n * $RCSfile: helper.cxx,v $\n *\n * $Revision: 1.1.1.1 $\n *\n * last change: $Author: pl $ $Date: 2001-05-08 11:46:02 $\n *\n * The Contents of this file are made available subject to the terms of\n * either of the following licenses\n *\n * - GNU Lesser General Public License Version 2.1\n * - Sun Industry Standards Source License Version 1.1\n *\n * Sun Microsystems Inc., October, 2000\n *\n * GNU Lesser General Public License Version 2.1\n * =============================================\n * Copyright 2000 by Sun Microsystems, Inc.\n * 901 San Antonio Road, Palo Alto, CA 94303, USA\n *\n * This library is free software; you can redistribute it and\/or\n * modify it under the terms of the GNU Lesser General Public\n * License version 2.1, as published by the Free Software Foundation.\n *\n * This library is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU\n * Lesser General Public License for more details.\n *\n * You should have received a copy of the GNU Lesser General Public\n * License along with this library; if not, write to the Free Software\n * Foundation, Inc., 59 Temple Place, Suite 330, Boston,\n * MA 02111-1307 USA\n *\n *\n * Sun Industry Standards Source License Version 1.1\n * =================================================\n * The contents of this file are subject to the Sun Industry Standards\n * Source License Version 1.1 (the \"License\"); You may not use this file\n * except in compliance with the License. You may obtain a copy of the\n * License at http:\/\/www.openoffice.org\/license.html.\n *\n * Software provided under this License is provided on an \"AS IS\" basis,\n * WITHOUT WARRANTY OF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING,\n * WITHOUT LIMITATION, WARRANTIES THAT THE SOFTWARE IS FREE OF DEFECTS,\n * MERCHANTABLE, FIT FOR A PARTICULAR PURPOSE, OR NON-INFRINGING.\n * See the License for the specific provisions governing your rights and\n * obligations concerning the Software.\n *\n * The Initial Developer of the Original Code is: Sun Microsystems, Inc.\n *\n * Copyright: 2000 by Sun Microsystems, Inc.\n *\n * All Rights Reserved.\n *\n * Contributor(s): _______________________________________\n *\n *\n ************************************************************************\/\n\n#include <psprint\/helper.hxx>\n#include <tools\/string.hxx>\n#include <osl\/file.hxx>\n\nconst ::rtl::OUString& psp::getPrinterPath()\n{\n static const char* pEnv = getenv( \"SAL_PSPRINT\" );\n static ::rtl::OUString aPath( pEnv ? pEnv : \"\", pEnv ? strlen( pEnv ) : 0, gsl_getSystemTextEncoding() );\n return aPath;\n}\n\nbool psp::convertPfbToPfa( ::osl::File& rInFile, ::osl::File& rOutFile )\n{\n static unsigned char hexDigits[] =\n {\n '0', '1', '2', '3', '4', '5', '6', '7',\n '8', '9', 'A', 'B', 'C', 'D', 'E', 'F'\n };\n\n bool bSuccess = true;\n bool bEof = false;\n unsigned char buffer[256];\n sal_uInt64 nRead;\n sal_uInt64 nOrgPos = 0;\n rInFile.getPos( nOrgPos );\n\n while( bSuccess && ! bEof )\n {\n \/\/ read leading bytes\n bEof = ! rInFile.read( buffer, 6, nRead ) && nRead == 6 ? false : true;\n int nType = buffer[ 1 ];\n int nBytesToRead = buffer[2] | buffer[3] << 8 | buffer[4] << 16 | buffer[5] << 24;\n if( buffer[0] != 0x80 ) \/\/ test for pfb m_agic number\n {\n \/\/ this migt be a pfa font already\n sal_uInt64 nWrite = 0;\n if( ! rInFile.read( buffer+6, 9, nRead ) && nRead == 9 &&\n ( ! strncmp( (char*)buffer, \"%!FontType1-\", 12 ) ||\n ! strncmp( (char*)buffer, \"%!PS-AdobeFont-\", 15 ) ) )\n {\n if( rOutFile.write( buffer, 15, nWrite ) || nWrite != 15 )\n bSuccess = false;\n while( bSuccess &&\n ! rInFile.read( buffer, sizeof( buffer ), nRead ) &&\n nRead != 0 )\n {\n if( rOutFile.write( buffer, nRead, nWrite ) ||\n nWrite != nRead )\n bSuccess = false;\n }\n bEof = true;\n }\n else\n bSuccess = false;\n }\n else if( nType == 1 || nType == 2 )\n {\n unsigned char* pBuffer = new unsigned char[ nBytesToRead+1 ];\n\n if( ! rInFile.read( pBuffer, nBytesToRead, nRead ) && nRead == nBytesToRead )\n {\n if( nType == 1 )\n {\n \/\/ ascii data, convert dos lineends( \\r\\n ) and\n \/\/ m_ac lineends( \\r ) to \\n\n unsigned char * pWriteBuffer = new unsigned char[ nBytesToRead ];\n int nBytesToWrite = 0;\n for( int i = 0; i < nBytesToRead; i++ )\n {\n if( pBuffer[i] != '\\r' )\n pWriteBuffer[ nBytesToWrite++ ] = pBuffer[i];\n else if( pBuffer[ i+1 ] == '\\n' )\n {\n i++;\n pWriteBuffer[ nBytesToWrite++ ] = '\\n';\n }\n else\n pWriteBuffer[ nBytesToWrite++ ] = '\\n';\n }\n if( rOutFile.write( pWriteBuffer, nBytesToWrite, nRead ) || nRead != nBytesToWrite )\n bSuccess = false;\n\n delete pWriteBuffer;\n }\n else\n {\n \/\/ binary data\n int nBuffer = 0;\n for( int i = 0; i < nBytesToRead && bSuccess; i++ )\n {\n buffer[ nBuffer++ ] = hexDigits[ pBuffer[ i ] >> 4 ];\n buffer[ nBuffer++ ] = hexDigits[ pBuffer[ i ] & 15 ];\n if( nBuffer >= 80 )\n {\n buffer[ nBuffer++ ] = '\\n';\n if( rOutFile.write( buffer, nBuffer, nRead ) || nRead != nBuffer )\n bSuccess = false;\n nBuffer = 0;\n }\n }\n if( nBuffer > 0 && bSuccess )\n {\n buffer[ nBuffer++ ] = '\\n';\n if( rOutFile.write( buffer, nBuffer, nRead ) || nRead != nBuffer )\n bSuccess = false;\n }\n }\n }\n else\n bSuccess = false;\n\n delete pBuffer;\n }\n else if( nType == 3 )\n bEof = true;\n else\n bSuccess = false;\n }\n\n return bSuccess;\n}\n<commit_msg>#92155# get printer path from configuration<commit_after>\/*************************************************************************\n *\n * $RCSfile: helper.cxx,v $\n *\n * $Revision: 1.2 $\n *\n * last change: $Author: pl $ $Date: 2001-09-14 12:02:42 $\n *\n * The Contents of this file are made available subject to the terms of\n * either of the following licenses\n *\n * - GNU Lesser General Public License Version 2.1\n * - Sun Industry Standards Source License Version 1.1\n *\n * Sun Microsystems Inc., October, 2000\n *\n * GNU Lesser General Public License Version 2.1\n * =============================================\n * Copyright 2000 by Sun Microsystems, Inc.\n * 901 San Antonio Road, Palo Alto, CA 94303, USA\n *\n * This library is free software; you can redistribute it and\/or\n * modify it under the terms of the GNU Lesser General Public\n * License version 2.1, as published by the Free Software Foundation.\n *\n * This library is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU\n * Lesser General Public License for more details.\n *\n * You should have received a copy of the GNU Lesser General Public\n * License along with this library; if not, write to the Free Software\n * Foundation, Inc., 59 Temple Place, Suite 330, Boston,\n * MA 02111-1307 USA\n *\n *\n * Sun Industry Standards Source License Version 1.1\n * =================================================\n * The contents of this file are subject to the Sun Industry Standards\n * Source License Version 1.1 (the \"License\"); You may not use this file\n * except in compliance with the License. You may obtain a copy of the\n * License at http:\/\/www.openoffice.org\/license.html.\n *\n * Software provided under this License is provided on an \"AS IS\" basis,\n * WITHOUT WARRANTY OF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING,\n * WITHOUT LIMITATION, WARRANTIES THAT THE SOFTWARE IS FREE OF DEFECTS,\n * MERCHANTABLE, FIT FOR A PARTICULAR PURPOSE, OR NON-INFRINGING.\n * See the License for the specific provisions governing your rights and\n * obligations concerning the Software.\n *\n * The Initial Developer of the Original Code is: Sun Microsystems, Inc.\n *\n * Copyright: 2000 by Sun Microsystems, Inc.\n *\n * All Rights Reserved.\n *\n * Contributor(s): _______________________________________\n *\n *\n ************************************************************************\/\n\n#include <psprint\/helper.hxx>\n#include <tools\/string.hxx>\n#include <osl\/file.hxx>\n#include <unotools\/configmgr.hxx>\n\nconst ::rtl::OUString& psp::getPrinterPath()\n{\n static ::rtl::OUString aPath;\n\n if( ! aPath.getLength() )\n {\n ::com::sun::star::uno::Any aPathEntry;\n ::rtl::OUString aEntry;\n\n aPathEntry = ::utl::ConfigManager::GetDirectConfigProperty( ::utl::ConfigManager::OFFICEINSTALL );\n aPathEntry >>= aPath;\n aPath += ::rtl::OUString( RTL_CONSTASCII_USTRINGPARAM( \"\/share\/psprint:\" ) );\n aPathEntry = ::utl::ConfigManager::GetDirectConfigProperty( ::utl::ConfigManager::INSTALLPATH );\n aPathEntry >>= aEntry;\n aPath += aEntry;\n aPath += ::rtl::OUString( RTL_CONSTASCII_USTRINGPARAM( \"\/psprint\" ) );\n\n const char* pEnv = getenv( \"SAL_PSPRINT\" );\n if( pEnv && *pEnv )\n {\n aPath += ::rtl::OUString( RTL_CONSTASCII_USTRINGPARAM( \":\" ) );\n aEntry = ::rtl::OUString( pEnv ? pEnv : \"\", pEnv ? strlen( pEnv ) : 0, gsl_getSystemTextEncoding() );\n aPath += aEntry;\n }\n#ifdef DEBUG\n fprintf( stderr, \"initalizing printer path to \\\"%s\\\"\\n\", ::rtl::OUStringToOString( aPath, RTL_TEXTENCODING_ISO_8859_1 ).getStr() );\n#endif\n }\n return aPath;\n}\n\nbool psp::convertPfbToPfa( ::osl::File& rInFile, ::osl::File& rOutFile )\n{\n static unsigned char hexDigits[] =\n {\n '0', '1', '2', '3', '4', '5', '6', '7',\n '8', '9', 'A', 'B', 'C', 'D', 'E', 'F'\n };\n\n bool bSuccess = true;\n bool bEof = false;\n unsigned char buffer[256];\n sal_uInt64 nRead;\n sal_uInt64 nOrgPos = 0;\n rInFile.getPos( nOrgPos );\n\n while( bSuccess && ! bEof )\n {\n \/\/ read leading bytes\n bEof = ! rInFile.read( buffer, 6, nRead ) && nRead == 6 ? false : true;\n int nType = buffer[ 1 ];\n int nBytesToRead = buffer[2] | buffer[3] << 8 | buffer[4] << 16 | buffer[5] << 24;\n if( buffer[0] != 0x80 ) \/\/ test for pfb m_agic number\n {\n \/\/ this migt be a pfa font already\n sal_uInt64 nWrite = 0;\n if( ! rInFile.read( buffer+6, 9, nRead ) && nRead == 9 &&\n ( ! strncmp( (char*)buffer, \"%!FontType1-\", 12 ) ||\n ! strncmp( (char*)buffer, \"%!PS-AdobeFont-\", 15 ) ) )\n {\n if( rOutFile.write( buffer, 15, nWrite ) || nWrite != 15 )\n bSuccess = false;\n while( bSuccess &&\n ! rInFile.read( buffer, sizeof( buffer ), nRead ) &&\n nRead != 0 )\n {\n if( rOutFile.write( buffer, nRead, nWrite ) ||\n nWrite != nRead )\n bSuccess = false;\n }\n bEof = true;\n }\n else\n bSuccess = false;\n }\n else if( nType == 1 || nType == 2 )\n {\n unsigned char* pBuffer = new unsigned char[ nBytesToRead+1 ];\n\n if( ! rInFile.read( pBuffer, nBytesToRead, nRead ) && nRead == nBytesToRead )\n {\n if( nType == 1 )\n {\n \/\/ ascii data, convert dos lineends( \\r\\n ) and\n \/\/ m_ac lineends( \\r ) to \\n\n unsigned char * pWriteBuffer = new unsigned char[ nBytesToRead ];\n int nBytesToWrite = 0;\n for( int i = 0; i < nBytesToRead; i++ )\n {\n if( pBuffer[i] != '\\r' )\n pWriteBuffer[ nBytesToWrite++ ] = pBuffer[i];\n else if( pBuffer[ i+1 ] == '\\n' )\n {\n i++;\n pWriteBuffer[ nBytesToWrite++ ] = '\\n';\n }\n else\n pWriteBuffer[ nBytesToWrite++ ] = '\\n';\n }\n if( rOutFile.write( pWriteBuffer, nBytesToWrite, nRead ) || nRead != nBytesToWrite )\n bSuccess = false;\n\n delete pWriteBuffer;\n }\n else\n {\n \/\/ binary data\n int nBuffer = 0;\n for( int i = 0; i < nBytesToRead && bSuccess; i++ )\n {\n buffer[ nBuffer++ ] = hexDigits[ pBuffer[ i ] >> 4 ];\n buffer[ nBuffer++ ] = hexDigits[ pBuffer[ i ] & 15 ];\n if( nBuffer >= 80 )\n {\n buffer[ nBuffer++ ] = '\\n';\n if( rOutFile.write( buffer, nBuffer, nRead ) || nRead != nBuffer )\n bSuccess = false;\n nBuffer = 0;\n }\n }\n if( nBuffer > 0 && bSuccess )\n {\n buffer[ nBuffer++ ] = '\\n';\n if( rOutFile.write( buffer, nBuffer, nRead ) || nRead != nBuffer )\n bSuccess = false;\n }\n }\n }\n else\n bSuccess = false;\n\n delete pBuffer;\n }\n else if( nType == 3 )\n bEof = true;\n else\n bSuccess = false;\n }\n\n return bSuccess;\n}\n<|endoftext|>"} {"text":"<commit_before>#include <Rcpp.h>\n#include <chrono>\n#include <string>\n#include <unordered_map>\n#include \"zmq.hpp\"\n\ntypedef std::chrono::high_resolution_clock Time;\ntypedef std::chrono::milliseconds ms;\nextern Rcpp::Function R_serialize;\nextern Rcpp::Function R_unserialize;\nint pending_interrupt();\n\nclass ZeroMQ {\npublic:\n ZeroMQ(int threads=1) : ctx(threads), sockets() {}\n\n std::string listen(Rcpp::CharacterVector addrs, std::string socket_type=\"ZMQ_REP\",\n std::string sid=\"default\") {\n auto sock = zmq::socket_t(ctx, str2socket(socket_type));\n int i;\n for (i=0; i<addrs.length(); i++) {\n auto addr = Rcpp::as<std::string>(addrs[i]);\n try {\n sock.bind(addr);\n } catch(zmq::error_t const &e) {\n if (errno != EADDRINUSE)\n Rf_error(e.what());\n }\n char option_value[1024];\n size_t option_value_len = sizeof(option_value);\n sock.getsockopt(ZMQ_LAST_ENDPOINT, option_value, &option_value_len);\n sockets.emplace(sid, std::move(sock));\n return std::string(option_value);\n }\n Rf_error(\"Could not bind port after \", i, \" tries\");\n }\n void connect(std::string address, std::string socket_type=\"ZMQ_REQ\", std::string sid=\"default\") {\n auto sock = zmq::socket_t(ctx, str2socket(socket_type));\n sock.connect(address);\n sockets.emplace(sid, std::move(sock));\n }\n void disconnect(std::string sid=\"default\") {\n sockets.erase(sid);\n }\n\n void send(SEXP data, std::string sid=\"default\", bool dont_wait=false, bool send_more=false) {\n auto & socket = find_socket(sid);\n auto flags = zmq::send_flags::none;\n if (dont_wait)\n flags = flags | zmq::send_flags::dontwait;\n if (send_more)\n flags = flags | zmq::send_flags::sndmore;\n\n if (TYPEOF(data) != RAWSXP)\n data = R_serialize(data, R_NilValue);\n\n zmq::message_t message(Rf_xlength(data));\n memcpy(message.data(), RAW(data), Rf_xlength(data));\n socket.send(message, flags);\n }\n SEXP receive(std::string sid=\"default\", bool dont_wait=false, bool unserialize=true) {\n auto message = rcv_msg(sid, dont_wait);\n SEXP ans = Rf_allocVector(RAWSXP, message.size());\n memcpy(RAW(ans), message.data(), message.size());\n if (unserialize)\n return R_unserialize(ans);\n else\n return ans;\n }\n Rcpp::IntegerVector poll(Rcpp::CharacterVector sids, int timeout=-1) {\n auto nsock = sids.length();\n auto pitems = std::vector<zmq::pollitem_t>(nsock);\n for (int i = 0; i < nsock; i++) {\n auto socket_id = Rcpp::as<std::string>(sids[i]);\n pitems[i].socket = find_socket(socket_id);\n pitems[i].events = ZMQ_POLLIN; \/\/ | ZMQ_POLLOUT; \/\/ ssh_proxy XREP\/XREQ has 2200\n }\n\n int rc = -1;\n auto start = Time::now();\n do {\n try {\n rc = zmq::poll(pitems, timeout);\n } catch(zmq::error_t const &e) {\n if (errno != EINTR || pending_interrupt())\n Rf_error(e.what());\n if (timeout != -1) {\n ms dt = std::chrono::duration_cast<ms>(Time::now() - start);\n timeout = timeout - dt.count();\n if (timeout <= 0)\n break;\n }\n }\n } while(rc < 0);\n\n auto result = Rcpp::IntegerVector(nsock);\n for (int i = 0; i < nsock; i++)\n result[i] = pitems[i].revents;\n return result;\n }\n\nprivate:\n zmq::context_t ctx;\n std::unordered_map<std::string, zmq::socket_t> sockets;\n\n int str2socket(std::string str) {\n if (str == \"ZMQ_REP\") {\n return ZMQ_REP;\n } else if (str == \"ZMQ_REQ\") {\n return ZMQ_REQ;\n } else if (str == \"ZMQ_XREP\") {\n return ZMQ_XREP;\n } else if (str == \"ZMQ_XREQ\") {\n return ZMQ_XREQ;\n } else {\n Rcpp::exception((\"Invalid socket type: \" + str).c_str());\n }\n return -1;\n }\n\n zmq::socket_t & find_socket(std::string socket_id) {\n auto socket_iter = sockets.find(socket_id);\n if (socket_iter == sockets.end())\n Rf_error(\"Trying to access non-existing socket: \", socket_id.c_str());\n return socket_iter->second;\n }\n\n zmq::message_t rcv_msg(std::string sid=\"default\", bool dont_wait=false) {\n auto flags = zmq::recv_flags::none;\n if (dont_wait)\n flags = flags | zmq::recv_flags::dontwait;\n\n zmq::message_t message;\n auto & socket = find_socket(sid);\n socket.recv(message, flags);\n return message;\n }\n};\n\nRCPP_MODULE(zmq) {\n using namespace Rcpp;\n class_<ZeroMQ>(\"ZeroMQ_raw\")\n .constructor() \/\/ .constructor<int>() SIGABRT\n .method(\"listen\", &ZeroMQ::listen)\n .method(\"connect\", &ZeroMQ::connect)\n .method(\"disconnect\", &ZeroMQ::disconnect)\n .method(\"send\", &ZeroMQ::send)\n .method(\"receive\", &ZeroMQ::receive)\n .method(\"poll\", &ZeroMQ::poll)\n ;\n}\n<commit_msg>disable copy<commit_after>#include <Rcpp.h>\n#include <chrono>\n#include <string>\n#include <unordered_map>\n#include \"zmq.hpp\"\n\ntypedef std::chrono::high_resolution_clock Time;\ntypedef std::chrono::milliseconds ms;\nextern Rcpp::Function R_serialize;\nextern Rcpp::Function R_unserialize;\nint pending_interrupt();\n\nclass ZeroMQ {\npublic:\n ZeroMQ(int threads=1) : ctx(threads), sockets() {}\n ZeroMQ(const ZeroMQ &) = delete;\n ZeroMQ & operator=(ZeroMQ const &) = delete;\n\n std::string listen(Rcpp::CharacterVector addrs, std::string socket_type=\"ZMQ_REP\",\n std::string sid=\"default\") {\n auto sock = zmq::socket_t(ctx, str2socket(socket_type));\n int i;\n for (i=0; i<addrs.length(); i++) {\n auto addr = Rcpp::as<std::string>(addrs[i]);\n try {\n sock.bind(addr);\n } catch(zmq::error_t const &e) {\n if (errno != EADDRINUSE)\n Rf_error(e.what());\n }\n char option_value[1024];\n size_t option_value_len = sizeof(option_value);\n sock.getsockopt(ZMQ_LAST_ENDPOINT, option_value, &option_value_len);\n sockets.emplace(sid, std::move(sock));\n return std::string(option_value);\n }\n Rf_error(\"Could not bind port after \", i, \" tries\");\n }\n void connect(std::string address, std::string socket_type=\"ZMQ_REQ\", std::string sid=\"default\") {\n auto sock = zmq::socket_t(ctx, str2socket(socket_type));\n sock.connect(address);\n sockets.emplace(sid, std::move(sock));\n }\n void disconnect(std::string sid=\"default\") {\n sockets.erase(sid);\n }\n\n void send(SEXP data, std::string sid=\"default\", bool dont_wait=false, bool send_more=false) {\n auto & socket = find_socket(sid);\n auto flags = zmq::send_flags::none;\n if (dont_wait)\n flags = flags | zmq::send_flags::dontwait;\n if (send_more)\n flags = flags | zmq::send_flags::sndmore;\n\n if (TYPEOF(data) != RAWSXP)\n data = R_serialize(data, R_NilValue);\n\n zmq::message_t message(Rf_xlength(data));\n memcpy(message.data(), RAW(data), Rf_xlength(data));\n socket.send(message, flags);\n }\n SEXP receive(std::string sid=\"default\", bool dont_wait=false, bool unserialize=true) {\n auto message = rcv_msg(sid, dont_wait);\n SEXP ans = Rf_allocVector(RAWSXP, message.size());\n memcpy(RAW(ans), message.data(), message.size());\n if (unserialize)\n return R_unserialize(ans);\n else\n return ans;\n }\n Rcpp::IntegerVector poll(Rcpp::CharacterVector sids, int timeout=-1) {\n auto nsock = sids.length();\n auto pitems = std::vector<zmq::pollitem_t>(nsock);\n for (int i = 0; i < nsock; i++) {\n auto socket_id = Rcpp::as<std::string>(sids[i]);\n pitems[i].socket = find_socket(socket_id);\n pitems[i].events = ZMQ_POLLIN; \/\/ | ZMQ_POLLOUT; \/\/ ssh_proxy XREP\/XREQ has 2200\n }\n\n int rc = -1;\n auto start = Time::now();\n do {\n try {\n rc = zmq::poll(pitems, timeout);\n } catch(zmq::error_t const &e) {\n if (errno != EINTR || pending_interrupt())\n Rf_error(e.what());\n if (timeout != -1) {\n ms dt = std::chrono::duration_cast<ms>(Time::now() - start);\n timeout = timeout - dt.count();\n if (timeout <= 0)\n break;\n }\n }\n } while(rc < 0);\n\n auto result = Rcpp::IntegerVector(nsock);\n for (int i = 0; i < nsock; i++)\n result[i] = pitems[i].revents;\n return result;\n }\n\nprivate:\n zmq::context_t ctx;\n std::unordered_map<std::string, zmq::socket_t> sockets;\n\n int str2socket(std::string str) {\n if (str == \"ZMQ_REP\") {\n return ZMQ_REP;\n } else if (str == \"ZMQ_REQ\") {\n return ZMQ_REQ;\n } else if (str == \"ZMQ_XREP\") {\n return ZMQ_XREP;\n } else if (str == \"ZMQ_XREQ\") {\n return ZMQ_XREQ;\n } else {\n Rcpp::exception((\"Invalid socket type: \" + str).c_str());\n }\n return -1;\n }\n\n zmq::socket_t & find_socket(std::string socket_id) {\n auto socket_iter = sockets.find(socket_id);\n if (socket_iter == sockets.end())\n Rf_error(\"Trying to access non-existing socket: \", socket_id.c_str());\n return socket_iter->second;\n }\n\n zmq::message_t rcv_msg(std::string sid=\"default\", bool dont_wait=false) {\n auto flags = zmq::recv_flags::none;\n if (dont_wait)\n flags = flags | zmq::recv_flags::dontwait;\n\n zmq::message_t message;\n auto & socket = find_socket(sid);\n socket.recv(message, flags);\n return message;\n }\n};\n\nRCPP_MODULE(zmq) {\n using namespace Rcpp;\n class_<ZeroMQ>(\"ZeroMQ_raw\")\n .constructor() \/\/ .constructor<int>() SIGABRT\n .method(\"listen\", &ZeroMQ::listen)\n .method(\"connect\", &ZeroMQ::connect)\n .method(\"disconnect\", &ZeroMQ::disconnect)\n .method(\"send\", &ZeroMQ::send)\n .method(\"receive\", &ZeroMQ::receive)\n .method(\"poll\", &ZeroMQ::poll)\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-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\n#include \"OgreException.h\"\n#include \"OgreLogManager.h\"\n#include \"OgreRoot.h\"\n#include \"OgreStringConverter.h\"\n\n#include \"OgreGLRenderSystem.h\"\n\n#include \"OgreGLXRenderTexture.h\"\n#include \"OgreGLXContext.h\"\n#include \"OgreGLXUtils.h\"\n#include \"OgreGLXGLSupport.h\"\n#include <iostream>\n\nnamespace Ogre\n{\n\t\/\/-------------------------------------------------------------------------------------------------\/\/\n\tGLXPBuffer::GLXPBuffer(GLXGLSupport* glsupport, PixelComponentType format, size_t width, size_t height):\n\t\tmGLSupport(glsupport), GLPBuffer(format, width, height), mContext(0)\n\t{\n\t\tDisplay *glDisplay = mGLSupport->getGLDisplay();\n\t\t::GLXDrawable glxDrawable = 0;\n\t\t::GLXFBConfig fbConfig = 0;\n\t\t\n\t\tbool isFloat = false;\n\t\tint bits = 0;\n\t\t\n\t\tswitch (mFormat)\n\t\t{\n\t\tcase PCT_BYTE:\n\t\t\tbits = 8; \n\t\t\tbreak;\n\t\t\t\n\t\tcase PCT_SHORT:\n\t\t\tbits = 16; \n\t\t\tbreak;\n\t\t\t\n\t\tcase PCT_FLOAT16:\n\t\t\tbits = 16; \n\t\t\tbreak;\n\t\t\t\n\t\tcase PCT_FLOAT32:\n\t\t\tbits = 32; \n\t\t\tbreak;\n\t\t\t\n\t\tdefault: \n\t\t\tbreak;\n\t\t}\n\t\t\n\t\tint renderAttrib = GLX_RENDER_TYPE;\n\t\tint renderValue = GLX_RGBA_BIT;\n\t\t\n\t\tif (mFormat == PCT_FLOAT16 || mFormat == PCT_FLOAT32)\n\t\t{\n\t\t\tif (GLXEW_NV_float_buffer)\n\t\t\t{\n\t\t\t\trenderAttrib = GLX_FLOAT_COMPONENTS_NV;\n\t\t\t\trenderValue = GL_TRUE;\n\t\t\t}\n\t\t\t\n\t\t\tif (GLXEW_ATI_pixel_format_float)\n\t\t\t{\n\t\t\t\trenderAttrib = GLX_RENDER_TYPE;\n\t\t\t\trenderValue = GLX_RGBA_FLOAT_ATI_BIT;\n\t\t\t}\n\t\t\t\n\t\t\tif (GLXEW_ARB_fbconfig_float)\n\t\t\t{\n\t\t\t\trenderAttrib = GLX_RENDER_TYPE;\n\t\t\t\trenderValue = GLX_RGBA_FLOAT_BIT;\n\t\t\t}\n\t\t\t\n\t\t\tif (renderAttrib == GLX_RENDER_TYPE && renderValue == GLX_RGBA_BIT)\n\t\t\t{\n\t\t\t\tOGRE_EXCEPT(Exception::ERR_NOT_IMPLEMENTED, \"No support for Floating point PBuffers\", \"GLRenderTexture::createPBuffer\");\n\t\t\t}\n\t\t}\n\t\t\n\t\tint minAttribs[] = {\n\t\t\tGLX_DRAWABLE_TYPE, GLX_PBUFFER,\n\t\t\trenderAttrib,\t renderValue,\n\t\t\tGLX_DOUBLEBUFFER, 0,\n\t\t\tNone\n\t\t};\n\t\t\n\t\tint maxAttribs[] = {\n\t\t\tGLX_RED_SIZE,\t bits,\n\t\t\tGLX_GREEN_SIZE,\tbits,\n\t\t\tGLX_BLUE_SIZE,\t bits,\n\t\t\tGLX_ALPHA_SIZE,\tbits,\n\t\t\tGLX_STENCIL_SIZE, INT_MAX,\n\t\t\tNone\n\t\t};\n\t\t\n\t\tint pBufferAttribs[] = {\n\t\t\tGLX_PBUFFER_WIDTH,\t mWidth,\n\t\t\tGLX_PBUFFER_HEIGHT,\t mHeight,\n\t\t\tGLX_PRESERVED_CONTENTS, GL_TRUE,\n\t\t\tNone\n\t\t};\n\t\t\n\t\tfbConfig = mGLSupport->selectFBConfig(minAttribs, maxAttribs);\n\t\t\n\t\tglxDrawable = glXCreatePbuffer(glDisplay, fbConfig, pBufferAttribs);\n\t\t\n\t\tif (! fbConfig || ! glxDrawable) \n\t\t{\n\t\t\tOGRE_EXCEPT(Exception::ERR_RENDERINGAPI_ERROR, \"Unable to create Pbuffer\", \"GLXPBuffer::GLXPBuffer\");\n\t\t}\n\t\t\n\t\tGLint fbConfigID;\n\t\tGLuint iWidth, iHeight;\n\t\t\n\t\tglXGetFBConfigAttrib(glDisplay, fbConfig, GLX_FBCONFIG_ID, &fbConfigID);\n\t\tglXQueryDrawable(glDisplay, glxDrawable, GLX_WIDTH, &iWidth);\n\t\tglXQueryDrawable(glDisplay, glxDrawable, GLX_HEIGHT, &iHeight);\n\t\t\n\t\tmWidth = iWidth; \n\t\tmHeight = iHeight;\n\t\tLogManager::getSingleton().logMessage(LML_NORMAL, \"GLXPBuffer::create used final dimensions \" + StringConverter::toString(mWidth) + \" x \" + StringConverter::toString(mHeight));\n\t\tLogManager::getSingleton().logMessage(\"GLXPBuffer::create used FBConfigID \" + StringConverter::toString(fbConfigID));\n\t\t\n\t\tmContext = new GLXContext(mGLSupport, fbConfig, glxDrawable);\n\t}\n\t\n\t\/\/-------------------------------------------------------------------------------------------------\/\/\n\tGLXPBuffer::~GLXPBuffer()\n\t{\n\t\tglXDestroyPbuffer(mGLSupport->getGLDisplay(), mContext->mDrawable);\n\t\t\n\t\tdelete mContext;\n\t\t\n\t\tLogManager::getSingleton().logMessage(LML_NORMAL, \"GLXPBuffer::PBuffer destroyed\");\n\t}\n\t\n\t\/\/-------------------------------------------------------------------------------------------------\/\/\n\tGLContext *GLXPBuffer::getContext()\n\t{\n\t\treturn mContext;\n\t}\n}\n<commit_msg>Adding climits include to GLXRenderTexture, supposedly needed on some distros<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\n#include \"OgreException.h\"\n#include \"OgreLogManager.h\"\n#include \"OgreRoot.h\"\n#include \"OgreStringConverter.h\"\n\n#include \"OgreGLRenderSystem.h\"\n\n#include \"OgreGLXRenderTexture.h\"\n#include \"OgreGLXContext.h\"\n#include \"OgreGLXUtils.h\"\n#include \"OgreGLXGLSupport.h\"\n#include <iostream>\n#include <climits>\n\nnamespace Ogre\n{\n\t\/\/-------------------------------------------------------------------------------------------------\/\/\n\tGLXPBuffer::GLXPBuffer(GLXGLSupport* glsupport, PixelComponentType format, size_t width, size_t height):\n\t\tmGLSupport(glsupport), GLPBuffer(format, width, height), mContext(0)\n\t{\n\t\tDisplay *glDisplay = mGLSupport->getGLDisplay();\n\t\t::GLXDrawable glxDrawable = 0;\n\t\t::GLXFBConfig fbConfig = 0;\n\t\t\n\t\tbool isFloat = false;\n\t\tint bits = 0;\n\t\t\n\t\tswitch (mFormat)\n\t\t{\n\t\tcase PCT_BYTE:\n\t\t\tbits = 8; \n\t\t\tbreak;\n\t\t\t\n\t\tcase PCT_SHORT:\n\t\t\tbits = 16; \n\t\t\tbreak;\n\t\t\t\n\t\tcase PCT_FLOAT16:\n\t\t\tbits = 16; \n\t\t\tbreak;\n\t\t\t\n\t\tcase PCT_FLOAT32:\n\t\t\tbits = 32; \n\t\t\tbreak;\n\t\t\t\n\t\tdefault: \n\t\t\tbreak;\n\t\t}\n\t\t\n\t\tint renderAttrib = GLX_RENDER_TYPE;\n\t\tint renderValue = GLX_RGBA_BIT;\n\t\t\n\t\tif (mFormat == PCT_FLOAT16 || mFormat == PCT_FLOAT32)\n\t\t{\n\t\t\tif (GLXEW_NV_float_buffer)\n\t\t\t{\n\t\t\t\trenderAttrib = GLX_FLOAT_COMPONENTS_NV;\n\t\t\t\trenderValue = GL_TRUE;\n\t\t\t}\n\t\t\t\n\t\t\tif (GLXEW_ATI_pixel_format_float)\n\t\t\t{\n\t\t\t\trenderAttrib = GLX_RENDER_TYPE;\n\t\t\t\trenderValue = GLX_RGBA_FLOAT_ATI_BIT;\n\t\t\t}\n\t\t\t\n\t\t\tif (GLXEW_ARB_fbconfig_float)\n\t\t\t{\n\t\t\t\trenderAttrib = GLX_RENDER_TYPE;\n\t\t\t\trenderValue = GLX_RGBA_FLOAT_BIT;\n\t\t\t}\n\t\t\t\n\t\t\tif (renderAttrib == GLX_RENDER_TYPE && renderValue == GLX_RGBA_BIT)\n\t\t\t{\n\t\t\t\tOGRE_EXCEPT(Exception::ERR_NOT_IMPLEMENTED, \"No support for Floating point PBuffers\", \"GLRenderTexture::createPBuffer\");\n\t\t\t}\n\t\t}\n\t\t\n\t\tint minAttribs[] = {\n\t\t\tGLX_DRAWABLE_TYPE, GLX_PBUFFER,\n\t\t\trenderAttrib,\t renderValue,\n\t\t\tGLX_DOUBLEBUFFER, 0,\n\t\t\tNone\n\t\t};\n\t\t\n\t\tint maxAttribs[] = {\n\t\t\tGLX_RED_SIZE,\t bits,\n\t\t\tGLX_GREEN_SIZE,\tbits,\n\t\t\tGLX_BLUE_SIZE,\t bits,\n\t\t\tGLX_ALPHA_SIZE,\tbits,\n\t\t\tGLX_STENCIL_SIZE, INT_MAX,\n\t\t\tNone\n\t\t};\n\t\t\n\t\tint pBufferAttribs[] = {\n\t\t\tGLX_PBUFFER_WIDTH,\t mWidth,\n\t\t\tGLX_PBUFFER_HEIGHT,\t mHeight,\n\t\t\tGLX_PRESERVED_CONTENTS, GL_TRUE,\n\t\t\tNone\n\t\t};\n\t\t\n\t\tfbConfig = mGLSupport->selectFBConfig(minAttribs, maxAttribs);\n\t\t\n\t\tglxDrawable = glXCreatePbuffer(glDisplay, fbConfig, pBufferAttribs);\n\t\t\n\t\tif (! fbConfig || ! glxDrawable) \n\t\t{\n\t\t\tOGRE_EXCEPT(Exception::ERR_RENDERINGAPI_ERROR, \"Unable to create Pbuffer\", \"GLXPBuffer::GLXPBuffer\");\n\t\t}\n\t\t\n\t\tGLint fbConfigID;\n\t\tGLuint iWidth, iHeight;\n\t\t\n\t\tglXGetFBConfigAttrib(glDisplay, fbConfig, GLX_FBCONFIG_ID, &fbConfigID);\n\t\tglXQueryDrawable(glDisplay, glxDrawable, GLX_WIDTH, &iWidth);\n\t\tglXQueryDrawable(glDisplay, glxDrawable, GLX_HEIGHT, &iHeight);\n\t\t\n\t\tmWidth = iWidth; \n\t\tmHeight = iHeight;\n\t\tLogManager::getSingleton().logMessage(LML_NORMAL, \"GLXPBuffer::create used final dimensions \" + StringConverter::toString(mWidth) + \" x \" + StringConverter::toString(mHeight));\n\t\tLogManager::getSingleton().logMessage(\"GLXPBuffer::create used FBConfigID \" + StringConverter::toString(fbConfigID));\n\t\t\n\t\tmContext = new GLXContext(mGLSupport, fbConfig, glxDrawable);\n\t}\n\t\n\t\/\/-------------------------------------------------------------------------------------------------\/\/\n\tGLXPBuffer::~GLXPBuffer()\n\t{\n\t\tglXDestroyPbuffer(mGLSupport->getGLDisplay(), mContext->mDrawable);\n\t\t\n\t\tdelete mContext;\n\t\t\n\t\tLogManager::getSingleton().logMessage(LML_NORMAL, \"GLXPBuffer::PBuffer destroyed\");\n\t}\n\t\n\t\/\/-------------------------------------------------------------------------------------------------\/\/\n\tGLContext *GLXPBuffer::getContext()\n\t{\n\t\treturn mContext;\n\t}\n}\n<|endoftext|>"} {"text":"<commit_before>#include \"RenderingSystem.h\"\n#include \"Engine.h\"\n#include \"AutoBinder.hpp\"\n\nusing namespace Core;\nusing namespace Device;\nusing namespace Rendering;\nusing namespace Rendering::Camera;\nusing namespace Rendering::Shader;\nusing namespace Rendering::Renderer;\nusing namespace Rendering::RenderState;\nusing namespace Rendering::GI;\nusing namespace Rendering::Manager;\nusing namespace Rendering::Light;\nusing namespace Rendering::Shadow;\nusing namespace Rendering::Material;\n\nvoid RenderingSystem::InitializeRenderer(Engine& engine, const RenderSetting&& param)\n{\n\tObject& object\t\t= engine.GetObjectManager().Add(param.mainCamName);\n\tMainCamera& maincam\t= engine.GetComponentSystem().SetMainCamera(object.GetObjectID());\n\n\tmaincam.Initialize(engine.GetDirectX(), _shaderManager, param.renderRect);\n\tengine.AddRootObject(object);\n\n\t_shadowRenderer.Initialize(engine.GetDirectX(), param.shadowMapResolution, param.shadowMapResolution, param.shadowMapResolution);\n\t_mainRenderer.Initialize(engine.GetDirectX(), _shaderManager, maincam, param.giParam);\t\n\n\t_defaultShaders.Initialize(engine.GetDirectX(), _shaderManager);\n\t_backBufferMaker.Initialize(engine.GetDirectX(), _shaderManager);\n}\n\nvoid RenderingSystem::Initialize(Engine& engine)\n{\n\t_materialManager.Initialize(engine.GetDirectX());\n\t_postProcessing.Initialize(engine.GetDirectX(), _shaderManager, engine.GetComponentSystem().GetMainCamera());\n}\n\nvoid RenderingSystem::Update(Engine& engine, float dt)\n{\n\t_postProcessing.SetElapsedTime(dt);\n}\n\nvoid RenderingSystem::Render(Engine& engine, float dt)\n{\n\tauto& dx = engine.GetDirectX();\n\t_materialManager.UpdateConstBuffer(dx);\n\n\tconst auto& compoSys\t\t= engine.GetComponentSystem();\n\tconst auto& shadowMgr\t\t= compoSys.GetManager_Direct<ShadowManager>();\n\tconst auto cullParam\t\t= engine.GetCullingParam();\n\tconst auto meshRenderParam\t= GetMeshRenderParam();\n\t_shadowRenderer.RenderShadowMap<SpotLightShadow>(dx, shadowMgr, _materialManager, cullParam, meshRenderParam);\n\t_shadowRenderer.RenderShadowMap<PointLightShadow>(dx, shadowMgr, _materialManager, cullParam, meshRenderParam);\n\t_shadowRenderer.RenderShadowMap<DirectionalLightShadow>(dx, shadowMgr, _materialManager, cullParam, meshRenderParam);\n\n\tconst auto& lightMgr\t\t\t= compoSys.GetManager_Direct<LightManager>();\n\tconst auto& mainCamera\t\t\t= compoSys.GetMainCamera();\n\tSkyBoxMaterial* skyboxMaterial\t= _materialManager.Find<SkyBoxMaterial>(mainCamera.GetSkyBoxMaterialID());\n\t_mainRenderer.UpdateCB(dx, mainCamera, lightMgr);\n\t_mainRenderer.Render(dx, MainRenderer::Param{mainCamera, meshRenderParam, _materialManager, lightMgr, ShadowSystem{shadowMgr, _shadowRenderer}, std::move(cullParam), skyboxMaterial});\n\n\t_postProcessing.SetElapsedTime(dt);\n\t_postProcessing.UpdateCB(dx);\n\t_postProcessing.Render(dx, _mainRenderer, mainCamera);\n\n\tAutoBinderSampler<PixelShader> sampler(dx, SamplerStateBindIndex(0), SamplerState::Point);\n\t_backBufferMaker.Render(dx, dx.GetBackBufferRT(), _mainRenderer.GetResultMap().GetTexture2D());\n\n\tdx.GetSwapChain()->Present(0, 0);\n\n\t_shadowRenderer.ClearDirty();\n}\n\nvoid RenderingSystem::Destroy(Engine& engine)\n{\n\n}<commit_msg>RenderingSystem - 줄 정리<commit_after>#include \"RenderingSystem.h\"\n#include \"Engine.h\"\n#include \"AutoBinder.hpp\"\n\nusing namespace Core;\nusing namespace Device;\nusing namespace Rendering;\nusing namespace Rendering::Camera;\nusing namespace Rendering::Shader;\nusing namespace Rendering::Renderer;\nusing namespace Rendering::RenderState;\nusing namespace Rendering::GI;\nusing namespace Rendering::Manager;\nusing namespace Rendering::Light;\nusing namespace Rendering::Shadow;\nusing namespace Rendering::Material;\n\nvoid RenderingSystem::InitializeRenderer(Engine& engine, const RenderSetting&& param)\n{\n\tObject& object\t\t= engine.GetObjectManager().Add(param.mainCamName);\n\tMainCamera& maincam\t= engine.GetComponentSystem().SetMainCamera(object.GetObjectID());\n\n\tmaincam.Initialize(engine.GetDirectX(), _shaderManager, param.renderRect);\n\tengine.AddRootObject(object);\n\n\t_shadowRenderer.Initialize(engine.GetDirectX(), param.shadowMapResolution, param.shadowMapResolution, param.shadowMapResolution);\n\t_mainRenderer.Initialize(engine.GetDirectX(), _shaderManager, maincam, param.giParam);\t\n\n\t_defaultShaders.Initialize(engine.GetDirectX(), _shaderManager);\n\t_backBufferMaker.Initialize(engine.GetDirectX(), _shaderManager);\n}\n\nvoid RenderingSystem::Initialize(Engine& engine)\n{\n\t_materialManager.Initialize(engine.GetDirectX());\n\t_postProcessing.Initialize(engine.GetDirectX(), _shaderManager, engine.GetComponentSystem().GetMainCamera());\n}\n\nvoid RenderingSystem::Update(Engine& engine, float dt)\n{\n\t_postProcessing.SetElapsedTime(dt);\n}\n\nvoid RenderingSystem::Render(Engine& engine, float dt)\n{\n\tauto& dx = engine.GetDirectX();\n\t_materialManager.UpdateConstBuffer(dx);\n\n\tconst auto& compoSys\t\t= engine.GetComponentSystem();\n\tconst auto& shadowMgr\t\t= compoSys.GetManager_Direct<ShadowManager>();\n\tconst auto cullParam\t\t= engine.GetCullingParam();\n\tconst auto meshRenderParam\t= GetMeshRenderParam();\n\t_shadowRenderer.RenderShadowMap<SpotLightShadow>(dx, shadowMgr, _materialManager, cullParam, meshRenderParam);\n\t_shadowRenderer.RenderShadowMap<PointLightShadow>(dx, shadowMgr, _materialManager, cullParam, meshRenderParam);\n\t_shadowRenderer.RenderShadowMap<DirectionalLightShadow>(dx, shadowMgr, _materialManager, cullParam, meshRenderParam);\n\n\tconst auto& lightMgr\t\t\t\t\t= compoSys.GetManager_Direct<LightManager>();\n\tconst auto& mainCamera\t\t\t\t\t= compoSys.GetMainCamera();\n\tconst SkyBoxMaterial* skyboxMaterial\t= _materialManager.Find<SkyBoxMaterial>(mainCamera.GetSkyBoxMaterialID());\n\t_mainRenderer.UpdateCB(dx, mainCamera, lightMgr);\n\t_mainRenderer.Render(dx, MainRenderer::Param{mainCamera, meshRenderParam, _materialManager, lightMgr, ShadowSystem{shadowMgr, _shadowRenderer}, std::move(cullParam), skyboxMaterial});\n\n\t_postProcessing.SetElapsedTime(dt);\n\t_postProcessing.UpdateCB(dx);\n\t_postProcessing.Render(dx, _mainRenderer, mainCamera);\n\n\tAutoBinderSampler<PixelShader> sampler(dx, SamplerStateBindIndex(0), SamplerState::Point);\n\t_backBufferMaker.Render(dx, dx.GetBackBufferRT(), _mainRenderer.GetResultMap().GetTexture2D());\n\n\tdx.GetSwapChain()->Present(0, 0);\n\n\t_shadowRenderer.ClearDirty();\n}\n\nvoid RenderingSystem::Destroy(Engine& engine)\n{\n\n}<|endoftext|>"} {"text":"<commit_before>\/*=========================================================================\n\nProgram: Medical Imaging & Interaction Toolkit\nModule: $RCSfile$\nLanguage: C++\nDate: $Date$\nVersion: $Revision$\n\nCopyright (c) German Cancer Research Center, Division of Medical and\nBiological Informatics. All rights reserved.\nSee MITKCopyright.txt or http:\/\/www.mitk.org\/copyright.html for details.\n\nThis software is distributed WITHOUT ANY WARRANTY; without even\nthe implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR\nPURPOSE. See the above copyright notices for more information.\n\n=========================================================================*\/\n\n\n#include \"mitkNativeRenderWindowInteractor.h\"\n#include \"mitkVtkRenderWindow.h\"\n\n#include <vtkRenderWindowInteractor.h>\n\nmitk::NativeRenderWindowInteractor::NativeRenderWindowInteractor() : m_MitkRenderWindow(NULL), m_NativeVtkRenderWindowInteractor(NULL)\n{\n m_NativeVtkRenderWindowInteractor = vtkRenderWindowInteractor::New();\n}\n\nmitk::NativeRenderWindowInteractor::~NativeRenderWindowInteractor() \n{\n\n}\n\nvoid mitk::NativeRenderWindowInteractor::SetMitkRenderWindow(mitk::RenderWindow* renderwindow)\n{\n m_MitkRenderWindow = renderwindow;\n if(m_MitkRenderWindow != NULL)\n m_NativeVtkRenderWindowInteractor->SetRenderWindow(m_MitkRenderWindow->GetVtkRenderWindow());\n}\n\nvoid mitk::NativeRenderWindowInteractor::Start()\n{\n if(m_MitkRenderWindow != NULL)\n m_NativeVtkRenderWindowInteractor->Start();\n}\n<commit_msg>FIX: Memory leak<commit_after>\/*=========================================================================\n\nProgram: Medical Imaging & Interaction Toolkit\nModule: $RCSfile$\nLanguage: C++\nDate: $Date$\nVersion: $Revision$\n\nCopyright (c) German Cancer Research Center, Division of Medical and\nBiological Informatics. All rights reserved.\nSee MITKCopyright.txt or http:\/\/www.mitk.org\/copyright.html for details.\n\nThis software is distributed WITHOUT ANY WARRANTY; without even\nthe implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR\nPURPOSE. See the above copyright notices for more information.\n\n=========================================================================*\/\n\n\n#include \"mitkNativeRenderWindowInteractor.h\"\n#include \"mitkVtkRenderWindow.h\"\n\n#include <vtkRenderWindowInteractor.h>\n\nmitk::NativeRenderWindowInteractor::NativeRenderWindowInteractor() : m_MitkRenderWindow(NULL), m_NativeVtkRenderWindowInteractor(NULL)\n{\n m_NativeVtkRenderWindowInteractor = vtkRenderWindowInteractor::New();\n}\n\nmitk::NativeRenderWindowInteractor::~NativeRenderWindowInteractor() \n{\n m_NativeVtkRenderWindowInteractor->Delete();\n}\n\nvoid mitk::NativeRenderWindowInteractor::SetMitkRenderWindow(mitk::RenderWindow* renderwindow)\n{\n m_MitkRenderWindow = renderwindow;\n if(m_MitkRenderWindow != NULL)\n m_NativeVtkRenderWindowInteractor->SetRenderWindow(m_MitkRenderWindow->GetVtkRenderWindow());\n}\n\nvoid mitk::NativeRenderWindowInteractor::Start()\n{\n if(m_MitkRenderWindow != NULL)\n m_NativeVtkRenderWindowInteractor->Start();\n}\n<|endoftext|>"} {"text":"<commit_before>\/*\n * test_cyclecontrol.cpp\n *\n * Created on: Nov 25, 2015\n * Author: jschwan\n *\/\n\n\/\/ boost\n#include <boost\/test\/unit_test.hpp>\n\n#include <iostream>\n#include <chrono>\n#include <iomanip>\n#include <ctime>\n#include <unistd.h>\n\n#include <threading\/cyclecontrol.hpp>\n\nusing namespace fc;\n\nBOOST_AUTO_TEST_SUITE(test_cyclecontrol)\n\nBOOST_AUTO_TEST_CASE( test_cyclecontrol_task_not_finished_in_time) {\n\tfc::thread::cycle_control thread_manager;\n\tstd::atomic<bool> terminate_thread(false);\n\tauto tick_cycle = fc::thread::periodic_task([&terminate_thread]()\n\t{\n\t\twhile(!terminate_thread)\n\t\t\tusleep(100);\n\t}, fc::thread::cycle_control::fast_tick);\n\tthread_manager.add_task(tick_cycle);\n\tthread_manager.start();\n\n\tbool exception_thrown=false;\n\tfor (int i=0; i<300;++i)\n\t{\n\t\tif(auto except_ptr=thread_manager.last_exception()){\n\t\t\tBOOST_CHECK_THROW(std::rethrow_exception(except_ptr), std::runtime_error);\n\t\t\texception_thrown=true;\n\t\t\tterminate_thread=true;\n\t\t\tbreak;\n\t\t}\n\t\tusleep(10000);\n\t}\n\n\tBOOST_CHECK(exception_thrown);\n}\n\nBOOST_AUTO_TEST_SUITE_END()\n\n\n<commit_msg>Fix cppcheck false positive (unused var)<commit_after>\/*\n * test_cyclecontrol.cpp\n *\n * Created on: Nov 25, 2015\n * Author: jschwan\n *\/\n\n\/\/ boost\n#include <boost\/test\/unit_test.hpp>\n\n#include <iostream>\n#include <chrono>\n#include <iomanip>\n#include <ctime>\n#include <unistd.h>\n\n#include <threading\/cyclecontrol.hpp>\n\nusing namespace fc;\n\nBOOST_AUTO_TEST_SUITE(test_cyclecontrol)\n\nBOOST_AUTO_TEST_CASE( test_cyclecontrol_task_not_finished_in_time)\n{\n\tfc::thread::cycle_control thread_manager;\n\tstd::atomic<bool> terminate_thread(false);\n\tauto tick_cycle = fc::thread::periodic_task([&terminate_thread]()\n\t{\n\t\twhile(!terminate_thread)\n\t\t\tusleep(100);\n\t}, fc::thread::cycle_control::fast_tick);\n\tthread_manager.add_task(tick_cycle);\n\tthread_manager.start();\n\n\tbool exception_thrown = false;\n\tfor (int i = 0; i < 300; ++i)\n\t{\n\t\tif (auto except_ptr = thread_manager.last_exception())\n\t\t{\n\t\t\tBOOST_CHECK_THROW(std::rethrow_exception(except_ptr), std::runtime_error);\n\t\t\texception_thrown = true;\n\t\t\tterminate_thread = true;\n\t\t\tbreak;\n\t\t}\n\t\tusleep(10000);\n\t}\n\n\tBOOST_CHECK(exception_thrown);\n\tBOOST_CHECK(terminate_thread);\n}\n\nBOOST_AUTO_TEST_SUITE_END()\n\n\n<|endoftext|>"} {"text":"<commit_before>#include <cstdlib>\n#include <cstdio>\n#include \"env.hpp\"\n\n#if PLATFORM == PLATFORM_LINUX\n#\tinclude <unistd.h>\n#endif\n\nnamespace qm {\n\n#if PLATFORM == PLATFORM_WINDOWS\nbool Env::closeMessage;\nbool Env::lbuttondownMessage;\n#endif\n\nEnv envInit()\n{\n\tconst char* title= \"QM Test\";\n\tVec2i reso(800, 800);\n\n\tEnv env;\n\tenv.cursorPos= Vec2f(0, 0);\n\tenv.lmbDown= false;\n\tenv.dt= 0.0;\n\tenv.winSize= reso;\n\tenv.quitRequested= false;\n\n#if PLATFORM == PLATFORM_LINUX\n\tenv.dpy= XOpenDisplay(NULL);\n\tif(env.dpy == NULL)\n\t\tstd::abort();\n\n\tWindow root= DefaultRootWindow(env.dpy);\n\tGLint att[]= { GLX_RGBA, GLX_DEPTH_SIZE, 24, GLX_DOUBLEBUFFER, None };\n\tXVisualInfo* vi= glXChooseVisual(env.dpy, 0, att);\n\n\tif(vi == NULL)\n\t\tstd::abort();\n\n\tColormap cmap;\n\tcmap= XCreateColormap(env.dpy, root, vi->visual, AllocNone);\n\tXSetWindowAttributes swa;\n\tswa.colormap= cmap;\n\tswa.event_mask= ExposureMask | KeyPressMask | ButtonPressMask | ButtonReleaseMask;\n\tenv.win=\n\t\tXCreateWindow(\tenv.dpy,\n\t\t\t\t\t\troot,\n\t\t\t\t\t\t0, 0, reso.x, reso.y, 0,\n\t\t\t\t\t\tvi->depth,\n\t\t\t\t\t\tInputOutput,\n\t\t\t\t\t\tvi->visual,\n\t\t\t\t\t\tCWColormap | CWEventMask,\n\t\t\t\t\t\t&swa);\n\tXMapWindow(env.dpy, env.win);\n\tXStoreName(env.dpy, env.win, title);\n\t\n\tenv.ctx= glXCreateContext(env.dpy, vi, NULL, GL_TRUE);\n\tglXMakeCurrent(env.dpy, env.win, env.ctx);\n\n\tclock_gettime(CLOCK_MONOTONIC, &env.ts);\n\n#elif PLATFORM == PLATFORM_WINDOWS\n\tstruct WndProc {\n\t\tstatic LRESULT CALLBACK call(\n\t\t\tHWND hWnd, UINT message, WPARAM wParam, LPARAM lParam)\n\t\t{\n\t\t\tswitch (message) {\n\t\t\t\tcase WM_DESTROY:\n\t\t\t\t\tPostQuitMessage(0);\n\t\t\t\tbreak;\n\t\t\t\tcase WM_CLOSE:\n\t\t\t\t\tEnv::closeMessage= true;\n\t\t\t\tbreak;\n\t\t\t\tcase WM_MOUSEMOVE:\n\t\t\t\t\tSetCursor(LoadCursor(NULL, IDC_ARROW));\n\t\t\t\tbreak;\n\t\t\t\tcase WM_LBUTTONDOWN: \n\t\t\t\t\tEnv::lbuttondownMessage= true;\n\t\t\t\tbreak;\n\t\t\t\tdefault:\n\t\t\t\t\treturn DefWindowProc(hWnd, message, wParam, lParam);\n\t\t\t}\n\t\t\treturn 0;\n\t\t}\n\t};\n\n\tWNDCLASS wc= WNDCLASS(); \n\twc.lpfnWndProc= WndProc::call;\n\twc.hInstance= GetModuleHandle(0);\n\twc.hbrBackground= (HBRUSH)(COLOR_BACKGROUND);\n\twc.lpszClassName= title;\n\twc.style = CS_OWNDC;\n\tif( !RegisterClass(&wc) ) {\n\t\t\tstd::printf(\"RegisterClass failed\\n\");\n\t\t\tstd::abort();\n\t}\n\tenv.hWnd= CreateWindow(\n\t\twc.lpszClassName,\n\t\ttitle,\n\t\tWS_OVERLAPPEDWINDOW|WS_VISIBLE,\n\t\t0, 0, reso.x, reso.y, 0, 0, wc.hInstance, 0);\n\n\t\/\/ Create OpenGL context\n\tPIXELFORMATDESCRIPTOR pfd= {\n\t\tsizeof(PIXELFORMATDESCRIPTOR), 1,\n\t\tPFD_DRAW_TO_WINDOW | PFD_SUPPORT_OPENGL | PFD_DOUBLEBUFFER,\n\t\tPFD_TYPE_RGBA,\n\t\t32, \/\/ Framebuffer\n\t\t0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,\n\t\t24, \/\/ Depth buffer\n\t\t8, \/\/ Stencil buffer\n\t\t0, PFD_MAIN_PLANE, 0, 0, 0, 0\n\t};\n\n\tenv.hDC= GetDC(env.hWnd);\n\tint choose= ChoosePixelFormat(env.hDC, &pfd);\n\tSetPixelFormat(env.hDC, choose, &pfd);\n\tenv.hGlrc= wglCreateContext(env.hDC);\n\twglMakeCurrent(env.hDC, env.hGlrc);\n\t\n\tenv.ticks= GetTickCount();\n\n#elif PLATFORM == PLATFORM_SDL\n\tSDL_Init(SDL_INIT_VIDEO);\n\tenv.win= SDL_CreateWindow(\n\t\ttitle,\n\t\tSDL_WINDOWPOS_UNDEFINED,\n\t\tSDL_WINDOWPOS_UNDEFINED,\n\t\treso.x,\n\t\treso.y,\n\t\tSDL_WINDOW_OPENGL);\n\tif (!env.win) {\n\t\tstd::printf(\"SDL Error: %s\\n\", SDL_GetError());\n\t\tstd::abort();\n\t}\n\n\tenv.ctx= SDL_GL_CreateContext(env.win);\n\tenv.ticks= SDL_GetTicks();\n#endif\n\n\treturn env;\n}\n\nvoid envQuit(Env& env)\n{\n#if PLATFORM == PLATFORM_LINUX\n\tglXMakeCurrent(env.dpy, None, NULL);\n\tglXDestroyContext(env.dpy, env.ctx);\n\tXDestroyWindow(env.dpy, env.win);\n\tXCloseDisplay(env.dpy);\n#elif PLATFORM == PLATFORM_WINDOWS\n\twglDeleteContext(env.hGlrc);\n#elif PLATFORM == PLATFORM_SDL\n\tSDL_GL_DeleteContext(env.ctx);\n\tSDL_DestroyWindow(env.win);\n\tSDL_Quit();\n#endif\n}\n\nvoid envUpdate(Env& env)\n{\n\tVec2f prev_cursor_pos= env.cursorPos;\n\n#if PLATFORM == PLATFORM_LINUX\n\tusleep(1);\n\tglXSwapBuffers(env.dpy, env.win);\n\n\twhile(XPending(env.dpy)) {\n\t\tXEvent xev;\n XNextEvent(env.dpy, &xev);\n\t\tif(xev.type == KeyPress) {\n\t\t\tint keys_ret;\n\t\t\tKeySym* keysym=\n\t\t\t\tXGetKeyboardMapping(env.dpy, xev.xkey.keycode, 1, &keys_ret);\n\t\t\t\n\t\t\tif (*keysym == XK_Escape)\n\t\t\t\tenv.quitRequested= true;\n\n\t\t\tXFree(keysym);\n\t\t}\n\n\t\tif (xev.xbutton.type == ButtonPress)\n\t\t\tenv.lmbDown= true;\n\t\telse if (xev.xbutton.type == ButtonRelease)\n\t\t\tenv.lmbDown= false;\n\t}\n\n\tXWindowAttributes gwa;\n\tXGetWindowAttributes(env.dpy, env.win, &gwa);\n\tenv.winSize.x= gwa.width;\n\tenv.winSize.y= gwa.height;\n\n\tint root_x= 0, root_y= 0;\n\tWindow w;\n\tint cursor_x, cursor_y;\n\tunsigned int mask;\n\tXQueryPointer(\tenv.dpy, env.win, &w,\n\t\t\t\t\t&w, &root_x, &root_y, &cursor_x, &cursor_y,\n\t\t\t\t\t&mask);\n\n\tenv.cursorPos.x= 2.0*cursor_x\/gwa.width - 1.0;\n\tenv.cursorPos.y= 1.0 - 2.0*cursor_y\/gwa.height;\n\n\tlong old_us= env.ts.tv_nsec\/1000 + env.ts.tv_sec*1000000;\n\tclock_gettime(CLOCK_MONOTONIC, &env.ts);\n\tlong new_us= env.ts.tv_nsec\/1000 + env.ts.tv_sec*1000000;\n\tenv.dt= (new_us - old_us)\/1000000.0;\n\n#elif PLATFORM == PLATFORM_WINDOWS\n\tSleep(1);\n\tSwapBuffers(env.hDC);\n\n\tenv.lbuttondownMessage= false;\n\n\tMSG msg;\n\twhile(PeekMessage(&msg, env.hWnd, 0, 0, PM_REMOVE) > 0) { \n\t\tTranslateMessage(&msg); \n\t\tDispatchMessage(&msg); \n\t}\n\n\tif (env.lbuttondownMessage)\n\t\tenv.lmbDown= true;\n\t\/\/ Release can happen outside window\n\tif ((GetKeyState(VK_LBUTTON) & 0x8000) == 0)\n\t\tenv.lmbDown= false;\n\n\tif (Env::closeMessage)\n\t\tenv.quitRequested= true;\n\n\tRECT rect;\n\tif(GetClientRect(env.hWnd, &rect)) {\n\t\tenv.winSize.x= rect.right - rect.left;\n\t\tenv.winSize.y= rect.bottom - rect.top;\n\t}\n\tPOINT cursor;\n\tGetCursorPos(&cursor);\n\tScreenToClient(env.hWnd, &cursor);\n\tenv.cursorPos.x= 2.0*cursor.x\/(rect.right - rect.left) - 1.0;\n\tenv.cursorPos.y= 1.0 - 2.0*cursor.y\/(rect.bottom - rect.top);\n\n\tDWORD old_ticks= env.ticks;\n\tenv.ticks= GetTickCount();\n\tDWORD new_ticks= env.ticks;\n\tenv.dt= (new_ticks - old_ticks)\/1000.0;\n\n#elif PLATFORM == PLATFORM_SDL\n\tSDL_Delay(1);\n\tSDL_GL_SwapWindow(env.win);\n\n\tSDL_Event e;\n\twhile(SDL_PollEvent(&e)) {\n\t\tif (e.type == SDL_QUIT)\n\t\t\tenv.quitRequested= true;\t\n\t}\n\n\tint x, y;\n\tint state= SDL_GetMouseState(&x, &y);\n\n\tenv.cursorPos.x= 2.0*x\/env.winSize.x - 1.0;\n\tenv.cursorPos.y= 1.0 - 2.0*y\/env.winSize.y;\n\n\tbool was_down= env.lmbDown;\n\tenv.lmbDown= state & SDL_BUTTON(SDL_BUTTON_LEFT);\n\tif (!was_down && env.lmbDown) {\n\t\tenv.anchorPos= env.cursorPos;\n\t}\n\n\tunsigned int old_ticks= env.ticks;\n\tenv.ticks= SDL_GetTicks();\n\tenv.dt= (env.ticks - old_ticks)\/1000.0;\n\n#endif\n\n\tenv.cursorDelta= env.cursorPos - prev_cursor_pos;\n\tif (!env.lmbDown)\n\t\tenv.anchorPos= env.cursorPos;\n}\n\ntypedef void (*voidFunc)();\nvoidFunc queryGlFunc(const char* name)\n{\n\tvoidFunc f= NULL;\n#if PLATFORM == PLATFORM_LINUX\n\tf= glXGetProcAddressARB((const GLubyte*)name);\n#elif PLATFORM == PLATFORM_WINDOWS\n\tf= (voidFunc)wglGetProcAddress(name);\n#elif PLATFORM == PLATFORM_SDL\n\tf= (voidFunc)SDL_GL_GetProcAddress(name);\n#endif\n\tif (!f) {\n\t\tstd::printf(\"Failed to query gl function: %s\\n\", name);\n\t\tstd::abort();\n\t}\n\treturn f;\n}\n\n} \/\/ qm\n<commit_msg>Changed title text<commit_after>#include <cstdlib>\r\n#include <cstdio>\r\n#include \"env.hpp\"\r\n\r\n#if PLATFORM == PLATFORM_LINUX\r\n#\tinclude <unistd.h>\r\n#endif\r\n\r\nnamespace qm {\r\n\r\n#if PLATFORM == PLATFORM_WINDOWS\r\nbool Env::closeMessage;\r\nbool Env::lbuttondownMessage;\r\n#endif\r\n\r\nEnv envInit()\r\n{\r\n\tconst char* title= \"Hydrogen visualization\";\r\n\tVec2i reso(800, 800);\r\n\r\n\tEnv env;\r\n\tenv.cursorPos= Vec2f(0, 0);\r\n\tenv.lmbDown= false;\r\n\tenv.dt= 0.0;\r\n\tenv.winSize= reso;\r\n\tenv.quitRequested= false;\r\n\r\n#if PLATFORM == PLATFORM_LINUX\r\n\tenv.dpy= XOpenDisplay(NULL);\r\n\tif(env.dpy == NULL)\r\n\t\tstd::abort();\r\n\r\n\tWindow root= DefaultRootWindow(env.dpy);\r\n\tGLint att[]= { GLX_RGBA, GLX_DEPTH_SIZE, 24, GLX_DOUBLEBUFFER, None };\r\n\tXVisualInfo* vi= glXChooseVisual(env.dpy, 0, att);\r\n\r\n\tif(vi == NULL)\r\n\t\tstd::abort();\r\n\r\n\tColormap cmap;\r\n\tcmap= XCreateColormap(env.dpy, root, vi->visual, AllocNone);\r\n\tXSetWindowAttributes swa;\r\n\tswa.colormap= cmap;\r\n\tswa.event_mask= ExposureMask | KeyPressMask | ButtonPressMask | ButtonReleaseMask;\r\n\tenv.win=\r\n\t\tXCreateWindow(\tenv.dpy,\r\n\t\t\t\t\t\troot,\r\n\t\t\t\t\t\t0, 0, reso.x, reso.y, 0,\r\n\t\t\t\t\t\tvi->depth,\r\n\t\t\t\t\t\tInputOutput,\r\n\t\t\t\t\t\tvi->visual,\r\n\t\t\t\t\t\tCWColormap | CWEventMask,\r\n\t\t\t\t\t\t&swa);\r\n\tXMapWindow(env.dpy, env.win);\r\n\tXStoreName(env.dpy, env.win, title);\r\n\t\r\n\tenv.ctx= glXCreateContext(env.dpy, vi, NULL, GL_TRUE);\r\n\tglXMakeCurrent(env.dpy, env.win, env.ctx);\r\n\r\n\tclock_gettime(CLOCK_MONOTONIC, &env.ts);\r\n\r\n#elif PLATFORM == PLATFORM_WINDOWS\r\n\tstruct WndProc {\r\n\t\tstatic LRESULT CALLBACK call(\r\n\t\t\tHWND hWnd, UINT message, WPARAM wParam, LPARAM lParam)\r\n\t\t{\r\n\t\t\tswitch (message) {\r\n\t\t\t\tcase WM_DESTROY:\r\n\t\t\t\t\tPostQuitMessage(0);\r\n\t\t\t\tbreak;\r\n\t\t\t\tcase WM_CLOSE:\r\n\t\t\t\t\tEnv::closeMessage= true;\r\n\t\t\t\tbreak;\r\n\t\t\t\tcase WM_MOUSEMOVE:\r\n\t\t\t\t\tSetCursor(LoadCursor(NULL, IDC_ARROW));\r\n\t\t\t\tbreak;\r\n\t\t\t\tcase WM_LBUTTONDOWN: \r\n\t\t\t\t\tEnv::lbuttondownMessage= true;\r\n\t\t\t\tbreak;\r\n\t\t\t\tdefault:\r\n\t\t\t\t\treturn DefWindowProc(hWnd, message, wParam, lParam);\r\n\t\t\t}\r\n\t\t\treturn 0;\r\n\t\t}\r\n\t};\r\n\r\n\tWNDCLASS wc= WNDCLASS(); \r\n\twc.lpfnWndProc= WndProc::call;\r\n\twc.hInstance= GetModuleHandle(0);\r\n\twc.hbrBackground= (HBRUSH)(COLOR_BACKGROUND);\r\n\twc.lpszClassName= title;\r\n\twc.style = CS_OWNDC;\r\n\tif( !RegisterClass(&wc) ) {\r\n\t\t\tstd::printf(\"RegisterClass failed\\n\");\r\n\t\t\tstd::abort();\r\n\t}\r\n\tenv.hWnd= CreateWindow(\r\n\t\twc.lpszClassName,\r\n\t\ttitle,\r\n\t\tWS_OVERLAPPEDWINDOW|WS_VISIBLE,\r\n\t\t0, 0, reso.x, reso.y, 0, 0, wc.hInstance, 0);\r\n\r\n\t\/\/ Create OpenGL context\r\n\tPIXELFORMATDESCRIPTOR pfd= {\r\n\t\tsizeof(PIXELFORMATDESCRIPTOR), 1,\r\n\t\tPFD_DRAW_TO_WINDOW | PFD_SUPPORT_OPENGL | PFD_DOUBLEBUFFER,\r\n\t\tPFD_TYPE_RGBA,\r\n\t\t32, \/\/ Framebuffer\r\n\t\t0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,\r\n\t\t24, \/\/ Depth buffer\r\n\t\t8, \/\/ Stencil buffer\r\n\t\t0, PFD_MAIN_PLANE, 0, 0, 0, 0\r\n\t};\r\n\r\n\tenv.hDC= GetDC(env.hWnd);\r\n\tint choose= ChoosePixelFormat(env.hDC, &pfd);\r\n\tSetPixelFormat(env.hDC, choose, &pfd);\r\n\tenv.hGlrc= wglCreateContext(env.hDC);\r\n\twglMakeCurrent(env.hDC, env.hGlrc);\r\n\t\r\n\tenv.ticks= GetTickCount();\r\n\r\n#elif PLATFORM == PLATFORM_SDL\r\n\tSDL_Init(SDL_INIT_VIDEO);\r\n\tenv.win= SDL_CreateWindow(\r\n\t\ttitle,\r\n\t\tSDL_WINDOWPOS_UNDEFINED,\r\n\t\tSDL_WINDOWPOS_UNDEFINED,\r\n\t\treso.x,\r\n\t\treso.y,\r\n\t\tSDL_WINDOW_OPENGL);\r\n\tif (!env.win) {\r\n\t\tstd::printf(\"SDL Error: %s\\n\", SDL_GetError());\r\n\t\tstd::abort();\r\n\t}\r\n\r\n\tenv.ctx= SDL_GL_CreateContext(env.win);\r\n\tenv.ticks= SDL_GetTicks();\r\n#endif\r\n\r\n\treturn env;\r\n}\r\n\r\nvoid envQuit(Env& env)\r\n{\r\n#if PLATFORM == PLATFORM_LINUX\r\n\tglXMakeCurrent(env.dpy, None, NULL);\r\n\tglXDestroyContext(env.dpy, env.ctx);\r\n\tXDestroyWindow(env.dpy, env.win);\r\n\tXCloseDisplay(env.dpy);\r\n#elif PLATFORM == PLATFORM_WINDOWS\r\n\twglDeleteContext(env.hGlrc);\r\n#elif PLATFORM == PLATFORM_SDL\r\n\tSDL_GL_DeleteContext(env.ctx);\r\n\tSDL_DestroyWindow(env.win);\r\n\tSDL_Quit();\r\n#endif\r\n}\r\n\r\nvoid envUpdate(Env& env)\r\n{\r\n\tVec2f prev_cursor_pos= env.cursorPos;\r\n\r\n#if PLATFORM == PLATFORM_LINUX\r\n\tusleep(1);\r\n\tglXSwapBuffers(env.dpy, env.win);\r\n\r\n\twhile(XPending(env.dpy)) {\r\n\t\tXEvent xev;\r\n XNextEvent(env.dpy, &xev);\r\n\t\tif(xev.type == KeyPress) {\r\n\t\t\tint keys_ret;\r\n\t\t\tKeySym* keysym=\r\n\t\t\t\tXGetKeyboardMapping(env.dpy, xev.xkey.keycode, 1, &keys_ret);\r\n\t\t\t\r\n\t\t\tif (*keysym == XK_Escape)\r\n\t\t\t\tenv.quitRequested= true;\r\n\r\n\t\t\tXFree(keysym);\r\n\t\t}\r\n\r\n\t\tif (xev.xbutton.type == ButtonPress)\r\n\t\t\tenv.lmbDown= true;\r\n\t\telse if (xev.xbutton.type == ButtonRelease)\r\n\t\t\tenv.lmbDown= false;\r\n\t}\r\n\r\n\tXWindowAttributes gwa;\r\n\tXGetWindowAttributes(env.dpy, env.win, &gwa);\r\n\tenv.winSize.x= gwa.width;\r\n\tenv.winSize.y= gwa.height;\r\n\r\n\tint root_x= 0, root_y= 0;\r\n\tWindow w;\r\n\tint cursor_x, cursor_y;\r\n\tunsigned int mask;\r\n\tXQueryPointer(\tenv.dpy, env.win, &w,\r\n\t\t\t\t\t&w, &root_x, &root_y, &cursor_x, &cursor_y,\r\n\t\t\t\t\t&mask);\r\n\r\n\tenv.cursorPos.x= 2.0*cursor_x\/gwa.width - 1.0;\r\n\tenv.cursorPos.y= 1.0 - 2.0*cursor_y\/gwa.height;\r\n\r\n\tlong old_us= env.ts.tv_nsec\/1000 + env.ts.tv_sec*1000000;\r\n\tclock_gettime(CLOCK_MONOTONIC, &env.ts);\r\n\tlong new_us= env.ts.tv_nsec\/1000 + env.ts.tv_sec*1000000;\r\n\tenv.dt= (new_us - old_us)\/1000000.0;\r\n\r\n#elif PLATFORM == PLATFORM_WINDOWS\r\n\tSleep(1);\r\n\tSwapBuffers(env.hDC);\r\n\r\n\tenv.lbuttondownMessage= false;\r\n\r\n\tMSG msg;\r\n\twhile(PeekMessage(&msg, env.hWnd, 0, 0, PM_REMOVE) > 0) { \r\n\t\tTranslateMessage(&msg); \r\n\t\tDispatchMessage(&msg); \r\n\t}\r\n\r\n\tif (env.lbuttondownMessage)\r\n\t\tenv.lmbDown= true;\r\n\t\/\/ Release can happen outside window\r\n\tif ((GetKeyState(VK_LBUTTON) & 0x8000) == 0)\r\n\t\tenv.lmbDown= false;\r\n\r\n\tif (Env::closeMessage)\r\n\t\tenv.quitRequested= true;\r\n\r\n\tRECT rect;\r\n\tif(GetClientRect(env.hWnd, &rect)) {\r\n\t\tenv.winSize.x= rect.right - rect.left;\r\n\t\tenv.winSize.y= rect.bottom - rect.top;\r\n\t}\r\n\tPOINT cursor;\r\n\tGetCursorPos(&cursor);\r\n\tScreenToClient(env.hWnd, &cursor);\r\n\tenv.cursorPos.x= 2.0*cursor.x\/(rect.right - rect.left) - 1.0;\r\n\tenv.cursorPos.y= 1.0 - 2.0*cursor.y\/(rect.bottom - rect.top);\r\n\r\n\tDWORD old_ticks= env.ticks;\r\n\tenv.ticks= GetTickCount();\r\n\tDWORD new_ticks= env.ticks;\r\n\tenv.dt= (new_ticks - old_ticks)\/1000.0;\r\n\r\n#elif PLATFORM == PLATFORM_SDL\r\n\tSDL_Delay(1);\r\n\tSDL_GL_SwapWindow(env.win);\r\n\r\n\tSDL_Event e;\r\n\twhile(SDL_PollEvent(&e)) {\r\n\t\tif (e.type == SDL_QUIT)\r\n\t\t\tenv.quitRequested= true;\t\r\n\t}\r\n\r\n\tint x, y;\r\n\tint state= SDL_GetMouseState(&x, &y);\r\n\r\n\tenv.cursorPos.x= 2.0*x\/env.winSize.x - 1.0;\r\n\tenv.cursorPos.y= 1.0 - 2.0*y\/env.winSize.y;\r\n\r\n\tbool was_down= env.lmbDown;\r\n\tenv.lmbDown= state & SDL_BUTTON(SDL_BUTTON_LEFT);\r\n\tif (!was_down && env.lmbDown) {\r\n\t\tenv.anchorPos= env.cursorPos;\r\n\t}\r\n\r\n\tunsigned int old_ticks= env.ticks;\r\n\tenv.ticks= SDL_GetTicks();\r\n\tenv.dt= (env.ticks - old_ticks)\/1000.0;\r\n\r\n#endif\r\n\r\n\tenv.cursorDelta= env.cursorPos - prev_cursor_pos;\r\n\tif (!env.lmbDown)\r\n\t\tenv.anchorPos= env.cursorPos;\r\n}\r\n\r\ntypedef void (*voidFunc)();\r\nvoidFunc queryGlFunc(const char* name)\r\n{\r\n\tvoidFunc f= NULL;\r\n#if PLATFORM == PLATFORM_LINUX\r\n\tf= glXGetProcAddressARB((const GLubyte*)name);\r\n#elif PLATFORM == PLATFORM_WINDOWS\r\n\tf= (voidFunc)wglGetProcAddress(name);\r\n#elif PLATFORM == PLATFORM_SDL\r\n\tf= (voidFunc)SDL_GL_GetProcAddress(name);\r\n#endif\r\n\tif (!f) {\r\n\t\tstd::printf(\"Failed to query gl function: %s\\n\", name);\r\n\t\tstd::abort();\r\n\t}\r\n\treturn f;\r\n}\r\n\r\n} \/\/ qm\r\n<|endoftext|>"} {"text":"<commit_before>#include \"gfx.h\"\n\nds_Image * loadImage(std::string path){\n\t\/\/loads a standard rgb bmp (not bmp custom format)\n\t\/\/.3ds_Image\n\t\/\/TODO: write a bmp to this shit convertor\n\tds_image img;\n\tifstream bmp(path.c_str(), ios::binary|ios::ate);\n\tint filelength = bmp.tellg();\n\tunsigned char fBuffer = new char[filelength];\n\tbmp.seekg(0, ios::beg);\n\tbmp.read(fBuffer, filelength); \/\/read file bytes into char array\n\t\n\t\/\/4 bytes = w\n\t\/\/4 bytes = h\n\t\/\/pixel array (r,g,b)\n\t\n\t\/\/4*8 = 32 bits\n\t\/\/32 - 8 = 24\n\t\/\/24 - 8 = 16\n\t\/\/16 - 8 = 8\n\tunsigned int imgW = (fBuffer[0] << 24) && (fBuffer[1] << 16) && (fBuffer[2] << 8) && (fBuffer[3]);\n\tunsigned int imgH = (fBuffer[4] << 24) && (fBuffer[5] << 16) && (fBuffer[6] << 8) && (fBuffer[7]);\n\t\n\timg.w = imgW;\n\timg.h = imgH;\n\timg.Buffer = new u8[imgW*imgH*3];\n\tfor (int i = 0; i < imgW*imgH*3; i++){\n\t\timg.Buffer[i] = fBuffer[8+i];\n\t}\n}\n\nvoid ds_GFX::init(){\n\tgfxInitDefault();\n\tconsoleInit(GFX_BOTTOM, NULL);\n}\n\nvoid ds_GFX::rectFill(ds_Rect rect, ds_Col col){\n\tfor(int x = 0; x < rect.w; x++){\n\t\tfor(int y = 0; y < rect.h; y++){\n\t\t\tputPixel((ds_Point){x+rect.x,y+rect.y},col);\n\t\t}\n\t}\n}\n\nvoid ds_GFX::beginFrame(gfxScreen_t scr){\n\tif(scr == GFX_TOP){\n\t\ttop = true;\n\n\t\tw = 400;\n\t\th = 240;\n\t}else{\n\t\ttop = false;\n\t\t\n\t\tw = 320;\n\t\th = 240;\n\t}\n\tfBuff = gfxGetFramebuffer(scr, GFX_LEFT, NULL\/*W*\/, NULL\/*H*\/);\n}\n\nvoid ds_GFX::pushFrame(){\n\tgfxFlushBuffers();\t\n\tgfxSwapBuffers();\n\tgspWaitForVBlank();\n}\n\nvoid circle(ds_Point p, ds_Col col, int r)\n\tunsigned int x= r0, y= 0;\/\/local coords\n\tint cd2= 0; \/\/current distance squared - radius squared\n\n\tint xc = p.x; int yc = p.y;\n\n\tif (!r0) return;\n\tputPixel((ds_Point){xc-r0, yc}, col);\n\tputPixel((ds_Point){xc+r0, yc}, col);\n\tputPixel((ds_Point){xc, yc-r0}, col);\n\tputPixel((ds_Point){xc, yc+r0}, col);\n\n\twhile (x > y) \/\/only formulate 1\/8 of circle\n\t{\n\t\tcd2-= (--x) - (++y);\n\t\tif (cd2 < 0) cd2+=x++;\n\n\t\tputPixel((ds_Point){xc-x, yc-y}, col);\/\/upper left left\n\t\tputPixel((ds_Point){xc-y, yc-x}, col);\/\/upper upper left\n\t\tputPixel((ds_Point){xc+y, yc-x}, col);\/\/upper upper right\n\t\tputPixel((ds_Point){xc+x, yc-y}, col);\/\/upper right right\n\t\tputPixel((ds_Point){xc-x, yc+y}, col);\/\/lower left left\n\t\tputPixel((ds_Point){xc-y, yc+x}, col);\/\/lower lower left\n\t\tputPixel((ds_Point){xc+y, yc+x}, col);\/\/lower lower right\n\t\tputPixel((ds_Point){xc+x, yc+y}, col);\/\/lower right right\n\t}\n}\n\nvoid ds_GFX::putPixel(ds_Point p, ds_Col col){\n\tif(!(p.y>=h || p.y<=-1 || p.x>=w || p.x<=-1)){\n\t\tint pitch = h * (sizeof(u8) * 3);\n\t\tint pos = (p.x * pitch) + ((h-1-p.y) * sizeof(u8) * 3);\n\t\tfBuff[ pos ] = col.b;\n\t\tfBuff[ pos+1 ] = col.g;\n\t\tfBuff[ pos+2 ] = col.r;\n\t}\n}\n\nvoid ds_GFX::clear(ds_Col col){\n\tif (((col.r - col.g) - col.b) == -col.r){ \/\/if all equal in astrange way for no paticular reason :)\n\t\tmemset(fBuff, col.r, h*w*3);\n\t}else{\n\t\tfor (int i = 0; i < w*h*3; i+=3){\n\t\t\tfBuff[i] = col.b;\n\t\t\tfBuff[i+1] = col.g;\n\t\t\tfBuff[i+2] = col.r;\n\t\t}\n\t}\n}\n<commit_msg>Update gfx.cpp<commit_after>#include \"gfx.h\"\n\nds_Image * loadImage(std::string path){\n\t\/\/loads a standard rgb bmp (not bmp custom format)\n\t\/\/.3ds_Image\n\t\/\/TODO: write a bmp to this shit convertor\n\tds_image img;\n\tifstream bmp(path.c_str(), ios::binary|ios::ate);\n\tint filelength = bmp.tellg();\n\tunsigned char fBuffer = new char[filelength];\n\tbmp.seekg(0, ios::beg);\n\tbmp.read(fBuffer, filelength); \/\/read file bytes into char array\n\t\n\t\/\/4 bytes = w\n\t\/\/4 bytes = h\n\t\/\/pixel array (r,g,b)\n\t\n\t\/\/4*8 = 32 bits\n\t\/\/32 - 8 = 24\n\t\/\/24 - 8 = 16\n\t\/\/16 - 8 = 8\n\tunsigned int imgW = (fBuffer[0] << 24) && (fBuffer[1] << 16) && (fBuffer[2] << 8) && (fBuffer[3]);\n\tunsigned int imgH = (fBuffer[4] << 24) && (fBuffer[5] << 16) && (fBuffer[6] << 8) && (fBuffer[7]);\n\t\n\timg.w = imgW;\n\timg.h = imgH;\n\timg.Buffer = new u8[imgW*imgH*3];\n\tfor (int i = 0; i < imgW*imgH*3; i++){\n\t\timg.Buffer[i] = fBuffer[8+i];\n\t}\n}\n\nvoid ds_GFX::drawImg(ds_Point p, ds_Image img){\n\tfor(int x = 0; x < rect.w; x++){\n\t\tfor(int y = 0; y < rect.h; y++){\n\t\t\tif(!((p.y+y)>=h || (p.y+y)<=-1 || (p.x+x)>=w || (p.x+x)<=-1)){\n\t\t\t\tint pitch = h * (sizeof(u8) * 3);\n\t\t\t\tint pos = ((p.x+x) * pitch) + ((h-1-(p.y+y)) * sizeof(u8) * 3);\n\t\t\t\tint imgBuffPos = (x * pitch) + ((h-1-y) * sizeof(u8) * 3);\n\t\t\t\tfBuff[ pos ] = img.Buffer[imgBuffPos];\n\t\t\t\tfBuff[ pos+1 ] = img.Buffer[imgBuffPos+1];\n\t\t\t\tfBuff[ pos+2 ] = img.Buffer[imgBuffPos+2];\n\t\t\t}\n\t\t}\n\t}\n}\n\nvoid ds_GFX::init(){\n\tgfxInitDefault();\n\tconsoleInit(GFX_BOTTOM, NULL);\n}\n\nvoid ds_GFX::rectFill(ds_Rect rect, ds_Col col){\n\tfor(int x = 0; x < rect.w; x++){\n\t\tfor(int y = 0; y < rect.h; y++){\n\t\t\tputPixel((ds_Point){x+rect.x,y+rect.y},col);\n\t\t}\n\t}\n}\n\nvoid ds_GFX::beginFrame(gfxScreen_t scr){\n\tif(scr == GFX_TOP){\n\t\ttop = true;\n\n\t\tw = 400;\n\t\th = 240;\n\t}else{\n\t\ttop = false;\n\t\t\n\t\tw = 320;\n\t\th = 240;\n\t}\n\tfBuff = gfxGetFramebuffer(scr, GFX_LEFT, NULL\/*W*\/, NULL\/*H*\/);\n}\n\nvoid ds_GFX::pushFrame(){\n\tgfxFlushBuffers();\t\n\tgfxSwapBuffers();\n\tgspWaitForVBlank();\n}\n\nvoid circle(ds_Point p, ds_Col col, int r)\n\tunsigned int x= r0, y= 0;\/\/local coords\n\tint cd2= 0; \/\/current distance squared - radius squared\n\n\tint xc = p.x; int yc = p.y;\n\n\tif (!r0) return;\n\tputPixel((ds_Point){xc-r0, yc}, col);\n\tputPixel((ds_Point){xc+r0, yc}, col);\n\tputPixel((ds_Point){xc, yc-r0}, col);\n\tputPixel((ds_Point){xc, yc+r0}, col);\n\n\twhile (x > y) \/\/only formulate 1\/8 of circle\n\t{\n\t\tcd2-= (--x) - (++y);\n\t\tif (cd2 < 0) cd2+=x++;\n\n\t\tputPixel((ds_Point){xc-x, yc-y}, col);\/\/upper left left\n\t\tputPixel((ds_Point){xc-y, yc-x}, col);\/\/upper upper left\n\t\tputPixel((ds_Point){xc+y, yc-x}, col);\/\/upper upper right\n\t\tputPixel((ds_Point){xc+x, yc-y}, col);\/\/upper right right\n\t\tputPixel((ds_Point){xc-x, yc+y}, col);\/\/lower left left\n\t\tputPixel((ds_Point){xc-y, yc+x}, col);\/\/lower lower left\n\t\tputPixel((ds_Point){xc+y, yc+x}, col);\/\/lower lower right\n\t\tputPixel((ds_Point){xc+x, yc+y}, col);\/\/lower right right\n\t}\n}\n\nvoid ds_GFX::putPixel(ds_Point p, ds_Col col){\n\tif(!(p.y>=h || p.y<=-1 || p.x>=w || p.x<=-1)){\n\t\tint pitch = h * (sizeof(u8) * 3);\n\t\tint pos = (p.x * pitch) + ((h-1-p.y) * sizeof(u8) * 3);\n\t\tfBuff[ pos ] = col.b;\n\t\tfBuff[ pos+1 ] = col.g;\n\t\tfBuff[ pos+2 ] = col.r;\n\t}\n}\n\nvoid ds_GFX::clear(ds_Col col){\n\tif (((col.r - col.g) - col.b) == -col.r){ \/\/if all equal in astrange way for no paticular reason :)\n\t\tmemset(fBuff, col.r, h*w*3);\n\t}else{\n\t\tfor (int i = 0; i < w*h*3; i+=3){\n\t\t\tfBuff[i] = col.b;\n\t\t\tfBuff[i+1] = col.g;\n\t\t\tfBuff[i+2] = col.r;\n\t\t}\n\t}\n}\n<|endoftext|>"} {"text":"<commit_before><commit_msg>Added code to close proxy connection when content-length is unspecified.<commit_after><|endoftext|>"} {"text":"<commit_before>#include \"interfaces\/non_conservative\/navier_stokes.h\"\n#include \"pidomus.h\"\n\n#include <Teuchos_CommandLineProcessor.hpp>\n\n#include \"mpi.h\"\n#include <iostream>\n#include <string>\n\nvoid print_status( std::string name,\n std::string prm_file,\n int dim,\n int spacedim,\n const MPI_Comm &comm);\n\n\nint main (int argc, char *argv[])\n{\n using namespace dealii;\n using namespace deal2lkit;\n\n Teuchos::CommandLineProcessor My_CLP;\n My_CLP.setDocString(\n \".__________ _______ ______ .___ ___. __ __ _______. \\n\"\n \"|_ __ __| | \\\\ \/ __ \\\\ | \\\\\/ | | | | | \/ | \\n\"\n \" | | | | ______| .--. | | | | | \\\\ \/ | | | | | | (----` \\n\"\n \" | | | | |______| | | | | | | | |\\\\\/| | | | | | \\\\ \\\\ \\n\"\n \" | | | | | '--' | `--' | | | | | | `--' | .----) | \\n\"\n \" |_| |_| |_______\/ \\\\______\/ |__| |__| \\\\______\/ |_______\/ \\n\"\n \"\\n\\n\"\n \" PDE implemented: \\n\"\n \" - Navier Stokes (navier_stokes): \\n\"\n \" - dim 2 \\n\"\n \" - default.prm \\n\"\n \" - lid_cavity.prm \\n\"\n \" - flow_past_a_cylinder.prm \\n\\n\\n\"\n );\n\n\n\n std::string pde_name=\"navier_stokes\";\n My_CLP.setOption(\"pde\", &pde_name, \"name of the PDE (heat, stokes, dynamic_stokes, or navier_stokes)\");\n\n int spacedim = 2;\n My_CLP.setOption(\"spacedim\", &spacedim, \"dimensione of the whole space\");\n\n int dim = 2;\n My_CLP.setOption(\"dim\", &dim, \"dimension of the problem\");\n\n std::string prm_file=\"default.prm\";\n My_CLP.setOption(\"prm\", &prm_file, \"name of the parameter file\");\n\n My_CLP.recogniseAllOptions(true);\n My_CLP.throwExceptions(false);\n\n Teuchos::CommandLineProcessor::EParseCommandLineReturn\n parseReturn= My_CLP.parse( argc, argv );\n if ( parseReturn == Teuchos::CommandLineProcessor::PARSE_HELP_PRINTED )\n {\n return 0;\n }\n if ( parseReturn != Teuchos::CommandLineProcessor::PARSE_SUCCESSFUL )\n {\n return 1; \/\/ Error!\n }\n\n My_CLP.printHelpMessage(argv[0], std::cout);\n\n Utilities::MPI::MPI_InitFinalize mpi_initialization(argc, argv,\n numbers::invalid_unsigned_int);\n\n const MPI_Comm &comm = MPI_COMM_WORLD;\n deallog.depth_console (0);\n\n std::string parameter_file = \"..\/utilities\/prm\/\"+pde_name+\"\/\"+prm_file;\n\n if (pde_name == \"navier_stokes\")\n {\n\n\n print_status( \"Navier-Stokes Equation\",\n prm_file,\n dim,\n spacedim,\n comm);\n\n if (dim==2)\n {\n NavierStokes<2> energy;\n piDoMUS<2,2,3> navier_stokes_equation (energy);\n ParameterAcceptor::initialize(parameter_file, \"used_parameters.prm\");\n ParameterAcceptor::prm.log_parameters(deallog);\n navier_stokes_equation.run ();\n }\n else\n {\n NavierStokes<3> energy;\n piDoMUS<3,3,4> navier_stokes_equation (energy);\n ParameterAcceptor::initialize(parameter_file, \"used_parameters.prm\");\n ParameterAcceptor::prm.log_parameters(deallog);\n navier_stokes_equation.run ();\n }\n }\n else\n {\n std::cout << std::endl\n << \"=============================================================\"\n << std::endl\n << \" ERROR:\"\n << std::endl\n << \" \" << pde_name << \" needs to be implemented or it is bad name.\"\n << std::endl\n << \"=============================================================\";\n }\n\n std::cout << std::endl;\n return 0;\n}\n\nvoid print_status( std::string name,\n std::string prm_file,\n int dim,\n int spacedim,\n const MPI_Comm &comm)\n{\n int numprocs = Utilities::MPI::n_mpi_processes(comm);\n int myid = Utilities::MPI::this_mpi_process(comm);\n\n\n if (myid == 0)\n {\n std::cout << std::endl\n << \"=============================================================\"\n << std::endl\n << \" Name: \" << name\n \/\/ << std::endl\n \/\/ << \"-------------------------------------------------------------\"\n << std::endl\n << \" Prm file: \" << prm_file\n << std::endl\n << \" spacedim: \" << spacedim\n << std::endl\n << \" dim: \" << dim\n << std::endl\n << \" codim: \" << spacedim-dim\n << std::endl\n << \"-------------------------------------------------------------\"\n << std::endl;\n }\n std::cout << \" Process \" << getpid() << \" is \" << myid\n << \" of \" << numprocs << \" processes\" << std::endl;\n\n if (myid == 0)\n {\n std::cout << \"-------------------------------------------------------------\"\n << std::endl;\n system(\"read -p \\\" Press [Enter] key to start...\\\"\");\n std::cout << \"=============================================================\"\n <<std::endl<<std::endl;\n }\n}\n<commit_msg>parallel<commit_after>#include \"interfaces\/non_conservative\/navier_stokes.h\"\n#include \"pidomus.h\"\n\n#include \"deal.II\/base\/numbers.h\"\n\n#include \"Teuchos_CommandLineProcessor.hpp\"\n#include \"Teuchos_GlobalMPISession.hpp\"\n#include \"Teuchos_oblackholestream.hpp\"\n#include \"Teuchos_StandardCatchMacros.hpp\"\n#include \"Teuchos_Version.hpp\"\n\n#include \"mpi.h\"\n#include <iostream>\n#include <string>\n\nvoid print_status( std::string name,\n std::string prm_file,\n int dim,\n int spacedim,\n const MPI_Comm &comm);\n\n\nint main (int argc, char *argv[])\n{\n using namespace dealii;\n using namespace deal2lkit;\n\n Teuchos::CommandLineProcessor My_CLP;\n My_CLP.setDocString(\n \".__________ _______ ______ .___ ___. __ __ _______. \\n\"\n \"|_ __ __| | \\\\ \/ __ \\\\ | \\\\\/ | | | | | \/ | \\n\"\n \" | | | | ______| .--. | | | | | \\\\ \/ | | | | | | (----` \\n\"\n \" | | | | |______| | | | | | | | |\\\\\/| | | | | | \\\\ \\\\ \\n\"\n \" | | | | | '--' | `--' | | | | | | `--' | .----) | \\n\"\n \" |_| |_| |_______\/ \\\\______\/ |__| |__| \\\\______\/ |_______\/ \\n\\n\"\n );\n\n std::string pde_name=\"navier_stokes\";\n My_CLP.setOption(\"pde\", &pde_name, \"name of the PDE (heat, stokes, dynamic_stokes, or navier_stokes)\");\n\n int spacedim = 2;\n My_CLP.setOption(\"spacedim\", &spacedim, \"dimensione of the whole space\");\n\n int dim = 2;\n My_CLP.setOption(\"dim\", &dim, \"dimension of the problem\");\n\n int n_threads = 0;\n My_CLP.setOption(\"n_threads\", &n_threads, \"number of threads\");\n\n std::string prm_file=pde_name+\".prm\";\n My_CLP.setOption(\"prm\", &prm_file, \"name of the parameter file\");\n\n \/\/ My_CLP.recogniseAllOptions(true);\n My_CLP.throwExceptions(false);\n\n Teuchos::CommandLineProcessor::EParseCommandLineReturn\n parseReturn= My_CLP.parse( argc, argv );\n\n if ( parseReturn == Teuchos::CommandLineProcessor::PARSE_HELP_PRINTED )\n {\n return 0;\n }\n if ( parseReturn != Teuchos::CommandLineProcessor::PARSE_SUCCESSFUL )\n {\n return 1; \/\/ Error!\n }\n\n\n\n Utilities::MPI::MPI_InitFinalize mpi_initialization(argc, argv,\n n_threads == 0 ? numbers::invalid_unsigned_int : n_threads);\n\n const MPI_Comm &comm = MPI_COMM_WORLD;\n\n Teuchos::oblackholestream blackhole;\n std::ostream &out = ( Utilities::MPI::this_mpi_process(comm) == 0 ? std::cout : blackhole );\n\n My_CLP.printHelpMessage(argv[0], out);\n\n deallog.depth_console (0);\n\n if (pde_name == \"navier_stokes\")\n {\n\n\n print_status( \"Navier-Stokes Equation\",\n prm_file,\n dim,\n spacedim,\n comm);\n\n if (dim==2)\n {\n NavierStokes<2> energy;\n piDoMUS<2,2,3> navier_stokes_equation (energy);\n ParameterAcceptor::initialize(prm_file, pde_name+\"_used.prm\");\n ParameterAcceptor::prm.log_parameters(deallog);\n navier_stokes_equation.run ();\n }\n else\n {\n NavierStokes<3> energy;\n piDoMUS<3,3,4> navier_stokes_equation (energy);\n ParameterAcceptor::initialize(prm_file, pde_name+\"_used.prm\");\n ParameterAcceptor::prm.log_parameters(deallog);\n navier_stokes_equation.run ();\n }\n }\n else\n {\n out << std::endl\n << \"=============================================================\"\n << std::endl\n << \" ERROR:\"\n << std::endl\n << \" \" << pde_name << \" needs to be implemented or it is bad name.\"\n << std::endl\n << \"=============================================================\";\n }\n\n out << std::endl;\n return 0;\n}\n\nvoid print_status( std::string name,\n std::string prm_file,\n int dim,\n int spacedim,\n const MPI_Comm &comm)\n{\n int numprocs = Utilities::MPI::n_mpi_processes(comm);\n int myid = Utilities::MPI::this_mpi_process(comm);\n\n Teuchos::oblackholestream blackhole;\n std::ostream &out = ( Utilities::MPI::this_mpi_process(comm) == 0 ? std::cout : blackhole );\n\n if (myid == 0)\n {\n out << std::endl\n << \"=============================================================\"\n << std::endl\n << \" Name: \" << name\n \/\/ << std::endl\n \/\/ << \"-------------------------------------------------------------\"\n << std::endl\n << \" Prm file: \" << prm_file\n << std::endl\n << \" spacedim: \" << spacedim\n << std::endl\n << \" dim: \" << dim\n << std::endl\n << \" codim: \" << spacedim-dim\n << std::endl\n << \"-------------------------------------------------------------\"\n << std::endl;\n }\n out << \" Process \" << getpid() << \" is \" << myid\n << \" of \" << numprocs << \" processes\" << std::endl;\n\n if (myid == 0)\n {\n out << \"-------------------------------------------------------------\"\n << std::endl;\n system(\"read -p \\\" Press [Enter] key to start...\\\"\");\n out << \"=============================================================\"\n <<std::endl<<std::endl;\n }\n}\n<|endoftext|>"} {"text":"<commit_before>#include \"executors_pool.h\"\n\nlogxx::Log ExecutorsPool::cLog(\"ExecutorsPool\");\n\nExecutorsPool::~ExecutorsPool() {\n}\n\nvoid ExecutorsPool::SetTasksPool(TasksPool* p) {\n for (ExecutorPtr &e : executors){\n e->SetTasksPool(p);\n }\n}\n\nbool ExecutorsPool::LaunchExecutors() {\n S_LOG(\"LaunchExecutors\");\n auto begin = executors.begin();\n auto end = executors.end();\n for (auto it = begin; it != end; ++it){\n ExecutorPtr& e = *it;\n if (!e->Start()){\n log(logxx::error) << \"Can't launch an executor #\" << e->id <<\n \"; interrupting and joining previously launched executors\" << logxx::endl;\n for (auto it2 = begin; it2 != it; ++it2){\n ExecutorPtr& e = *it2;\n e->Interrupt();\n e->Join();\n }\n return false;\n }\n }\n log(logxx::notice) << \"Launched \" << executors.size() << \" executors\" << logxx::endl;\n return true;\n}\n\nvoid ExecutorsPool::Interrupt(bool andJoin) {\n for (ExecutorPtr &e : executors)\n e->Interrupt();\n if (andJoin){\n for (ExecutorPtr &e : executors)\n e->Join();\n }\n}\n\nvoid ExecutorsPool::WaitForExecutors() {\n for (ExecutorPtr &e : executors)\n e->Join();\n}\n\n\n<commit_msg>Added cppcheck inline suppression<commit_after>#include \"executors_pool.h\"\n\nlogxx::Log ExecutorsPool::cLog(\"ExecutorsPool\");\n\nExecutorsPool::~ExecutorsPool() {\n}\n\nvoid ExecutorsPool::SetTasksPool(TasksPool* p) {\n for (ExecutorPtr &e : executors){\n e->SetTasksPool(p);\n }\n}\n\nbool ExecutorsPool::LaunchExecutors() {\n S_LOG(\"LaunchExecutors\");\n auto begin = executors.begin();\n auto end = executors.end();\n for (auto it = begin; it != end; ++it){\n ExecutorPtr& e = *it;\n if (!e->Start()){\n log(logxx::error) << \"Can't launch an executor #\" << e->id <<\n \"; interrupting and joining previously launched executors\" << logxx::endl;\n for (auto it2 = begin; it2 != it; ++it2){\n ExecutorPtr& e = *it2;\n e->Interrupt();\n e->Join();\n }\n return false;\n }\n }\n\t\/\/ cppcheck-suppress constStatement\n log(logxx::notice) << \"Launched \" << executors.size() << \" executors\" << logxx::endl;\n return true;\n}\n\nvoid ExecutorsPool::Interrupt(bool andJoin) {\n for (ExecutorPtr &e : executors)\n e->Interrupt();\n if (andJoin){\n for (ExecutorPtr &e : executors)\n e->Join();\n }\n}\n\nvoid ExecutorsPool::WaitForExecutors() {\n for (ExecutorPtr &e : executors)\n e->Join();\n}\n\n\n<|endoftext|>"} {"text":"<commit_before>#include \"SIO\/LCIORandomAccessMgr.h\"\n\n#include \"SIO\/LCSIO.h\"\n#include \"SIO\/SIORandomAccessHandler.h\"\n#include \"SIO\/SIOIndexHandler.h\"\n#include \"SIO\/SIOEventHandler.h\"\n#include \"SIO\/SIORunHeaderHandler.h\"\n#include \"IOIMPL\/LCEventIOImpl.h\"\n#include \"IOIMPL\/LCRunHeaderIOImpl.h\"\n#include \"Exceptions.h\"\n\n\/\/ -- std headers\n#include <sstream>\n#include <stdio.h>\n#include <string.h>\n\n\/\/ -- sio headers\n#include <sio\/api.h>\n#include <sio\/compression\/zlib.h>\n\nnamespace SIO {\n\n void LCIORandomAccessMgr::clear() {\n _runEvtMap->clear() ;\n _list.clear() ;\n _fileRecord = nullptr ;\n }\n\n \/\/----------------------------------------------------------------------------\n\n std::shared_ptr<LCIORandomAccess> LCIORandomAccessMgr::createFromEventMap() const {\n auto ra = std::make_shared<LCIORandomAccess>() ;\n ra->_minRunEvt = _runEvtMap->minRunEvent() ;\n ra->_maxRunEvt = _runEvtMap->maxRunEvent() ;\n ra->_nRunHeaders = _runEvtMap->getNumberOfRunRecords() ;\n ra->_nEvents = _runEvtMap->getNumberOfEventRecords() ;\n ra->_recordsAreInOrder = true ; \/\/ ???? how is this defined ????\n ra->_indexLocation = 0 ;\n ra->_prevLocation = 0 ;\n ra->_nextLocation = 0 ;\n ra->_firstRecordLocation = 0 ;\n return ra ;\n }\n\n \/\/----------------------------------------------------------------------------\n\n void LCIORandomAccessMgr::createFileRecord() {\n if( nullptr == _fileRecord ) {\n _fileRecord = std::make_shared<LCIORandomAccess>() ;\n _fileRecord->_minRunEvt = RunEvent( 2147483647L, 2147483647L ) ; \/\/ 2**31-1 - largest 32 bit signed\n _fileRecord->_maxRunEvt = 0 ;\n _fileRecord->_nRunHeaders = 0 ;\n _fileRecord->_nEvents = 0 ;\n _fileRecord->_recordsAreInOrder = 1 ;\n _fileRecord->_indexLocation = 0 ; \/\/ defines file record\n _fileRecord->_prevLocation = 9223372036854775807LL ; \/\/ 2**63-1 - largest 64 bit signed\n _fileRecord->_nextLocation = 0 ;\n _fileRecord->_firstRecordLocation = 0 ;\n }\n\n for( auto i = _list.begin() ; i != _list.end() ; ++i ) {\n auto ra = *i ;\n \t_fileRecord->_minRunEvt = ( ra->_minRunEvt < _fileRecord->_minRunEvt ? ra->_minRunEvt : _fileRecord->_minRunEvt ) ;\n \t_fileRecord->_maxRunEvt = ( ra->_maxRunEvt > _fileRecord->_maxRunEvt ? ra->_maxRunEvt : _fileRecord->_maxRunEvt ) ;\n \t_fileRecord->_nRunHeaders += ra->_nRunHeaders ;\n \t_fileRecord->_nEvents += ra->_nEvents ;\n \t_fileRecord->_recordsAreInOrder = ( _fileRecord->_recordsAreInOrder * ra->_recordsAreInOrder ) ; \/\/ should be 0 if any record is 0\n \t_fileRecord->_indexLocation = 0 ; \/\/ defines file record\n \tif( ra->_nextLocation > _fileRecord->_nextLocation ) {\n \t _fileRecord->_nextLocation = ra->_nextLocation ;\n }\n \tif( 0 < ra->_prevLocation && ra->_prevLocation < _fileRecord->_prevLocation ) {\n \t _fileRecord->_prevLocation = ra->_prevLocation ;\n }\n }\n }\n\n \/\/----------------------------------------------------------------------------\n\n void LCIORandomAccessMgr::addLCIORandomAccess( std::shared_ptr<LCIORandomAccess> ra ) {\n _list.push_back( ra );\n }\n\n \/\/----------------------------------------------------------------------------\n\n bool LCIORandomAccessMgr::readLCIORandomAccessAt( sio::ifstream& stream , long64 pos) {\n seekStream( stream, pos ) ;\n return readLCIORandomAccess( stream ) ;\n }\n\n \/\/----------------------------------------------------------------------------\n\n bool LCIORandomAccessMgr::readLCIORandomAccess( sio::ifstream &stream ) {\n \/\/ first extract the record from the stream (header + data)\n sio::record_info recinfo ;\n try {\n sio::api::read_record( stream, recinfo, _rawBuffer ) ;\n }\n catch( sio::exception &e ) {\n return false ;\n }\n \/\/ we got a record but it's not an LCIORandomAccess record...\n if( recinfo._name != LCSIO::AccessRecordName ) {\n return false ;\n }\n \/\/ setup the rando access block\n sio::block_list blocks {} ;\n auto raBlock = std::make_shared<SIORandomAccessHandler>() ;\n blocks.push_back( raBlock ) ;\n \/\/ get a valid buffer span for reading\n auto recordData = _rawBuffer.span( recinfo._header_length, recinfo._data_length ) ;\n \/\/ read the record blocks\n sio::api::read_blocks( recordData, blocks ) ;\n \/\/ get our random access object and add it to our list\n addLCIORandomAccess( raBlock->randomAccess() ) ;\n return true ;\n }\n\n \/\/----------------------------------------------------------------------------\n\n bool LCIORandomAccessMgr::readLCIOIndexAt( sio::ifstream &stream , long64 pos) {\n seekStream( stream, pos ) ;\n return readLCIOIndex( stream ) ;\n }\n\n \/\/----------------------------------------------------------------------------\n\n bool LCIORandomAccessMgr::readLCIOIndex( sio::ifstream &stream ) {\n SIO_DEBUG( \"LCIORandomAccessMgr::readLCIOIndex: Reading at \" << stream.tellg() );\n \/\/ first extract the record from the stream (header + data)\n sio::record_info recinfo ;\n try {\n sio::api::read_record( stream, recinfo, _rawBuffer ) ;\n }\n catch( sio::exception &e ) {\n \/\/ no way to extract a record !\n return false ;\n }\n \/\/ we got a record but it's not an LCIOIndex record...\n if( recinfo._name != LCSIO::IndexRecordName ) {\n return false ;\n }\n \/\/ setup the rando access block\n sio::block_list blocks {} ;\n auto indexBlock = std::make_shared<SIOIndexHandler>() ;\n indexBlock->setRunEventMap( _runEvtMap ) ;\n blocks.push_back( indexBlock ) ;\n \/\/ get a valid buffer span for reading\n auto recordData = _rawBuffer.span( recinfo._header_length, recinfo._data_length ) ;\n \/\/ read the record blocks\n sio::api::read_blocks( recordData, blocks ) ;\n return true ;\n }\n\n \/\/----------------------------------------------------------------------------\n\n bool LCIORandomAccessMgr::initAppend( sio::ifstream & stream ) {\n \/\/ check if the last record is LCIORandomAccess (the file record )\n if( ! readLCIORandomAccessAt( stream , -LCSIO::RandomAccessSize ) ) {\n recreateEventMap( stream ) ;\n return false;\n }\n \/\/ store the file record separately\n _fileRecord = _list.back() ;\n _list.pop_back() ;\n \/\/ now read first LCIORandomAccess record\n readLCIORandomAccessAt( stream , _fileRecord->_nextLocation ) ; \/\/ start of last LCIORandomAccessRecord\n return true ;\n }\n\n \/\/----------------------------------------------------------------------------\n\n bool LCIORandomAccessMgr::createEventMap( sio::ifstream & stream ) {\n \/\/ check if the last record is LCIORandomAccess ( the file record )\n if( ! readLCIORandomAccessAt( stream , -LCSIO::RandomAccessSize) ) {\n return recreateEventMap( stream ) ;\n }\n \/\/ store the file record separately\n _fileRecord = _list.back() ;\n _list.pop_back() ;\n\n auto raPos = _fileRecord->_nextLocation ;\n \/\/ start of last LCIORandomAccessRecord\n readLCIORandomAccessAt( stream , raPos ) ;\n auto ra = lastLCIORandomAccess() ;\n \/\/ and then read all remaining LCIORandomAccess records\n raPos = ra->getPrevLocation() ;\n auto indexPos = ra->getIndexLocation() ;\n readLCIOIndexAt( stream , indexPos ) ;\n\n while( raPos != 0 ) {\n if( readLCIORandomAccessAt( stream , raPos) ) {\n ra = lastLCIORandomAccess() ;\n \traPos = ra->getPrevLocation() ;\n \tauto idxPos = ra->getIndexLocation() ;\n \treadLCIOIndexAt( stream , idxPos ) ;\n }\n else {\n\t throw IO::IOException( std::string( \"[LCIORandomAccessMgr::ReadEventMap()] Could not read previous LCIORandomAccess record\" ) ) ;\n }\n }\n seekStream( stream, 0 ) ;\/\/ go to start of file\n return true ;\n }\n\n \/\/----------------------------------------------------------------------------\n\n bool LCIORandomAccessMgr::recreateEventMap( sio::ifstream & stream ) {\n\n std::cout << \" LCIORandomAccessMgr::getEventMap() recreating event map for direct access (old file)\" << std::endl ;\n \/\/ read the next record from the stream\n if( not stream.is_open() ) {\n throw IO::IOException( \"LCIORandomAccessMgr::recreateEventMap: stream is not open\" ) ;\n }\n \/\/ go to start of file\n seekStream( stream, 0 ) ;\n std::set<std::string> recordlist = { LCSIO::HeaderRecordName, LCSIO::RunRecordName } ;\n while( true ) {\n sio::record_info recinfo {} ;\n try {\n sio::api::skip_records( stream, [&]( const sio::record_info &ri ){\n return ( recordlist.find(ri._name) == recordlist.end() ) ;\n }) ;\n \/\/ we read something valid here. Read the record from the stream\n sio::api::read_record( stream, recinfo, _rawBuffer ) ;\n \/\/ Get the record data\n auto recdata = _rawBuffer.span( recinfo._header_length, recinfo._data_length ) ;\n \/\/ deal with zlib uncompression\n const bool compressed = sio::api::is_compressed( recinfo._options ) ;\n if( compressed ) {\n sio::zlib_compression compressor ;\n _compressBuffer.resize( recinfo._uncompressed_length ) ;\n compressor.uncompress( recdata, _compressBuffer ) ;\n }\n \/\/ get the correct buffer depending of compression settings\n auto databuf = compressed ? _compressBuffer.span() : recdata ;\n \/\/ event case\n if( recinfo._name == LCSIO::HeaderRecordName ) {\n auto event = std::make_shared<IOIMPL::LCEventIOImpl>() ;\n \/\/ pass a dummy list of read collection with only '__dummy__' inside.\n \/\/ We only need the event and run numbers there, no need to settup all collections\n SIOEventHeaderRecord::readBlocks( databuf, event.get(), {\"__dummy__\"} ) ;\n _runEvtMap->add( RunEvent( event->getRunNumber() , event->getEventNumber() ) , static_cast<long64>(recinfo._file_start) ) ;\n }\n \/\/ run case\n else if( recinfo._name == LCSIO::RunRecordName ) {\n auto run = std::make_shared<IOIMPL::LCRunHeaderIOImpl>() ;\n SIORunHeaderRecord::readBlocks( recdata, run.get() ) ;\n _runEvtMap->add( RunEvent( run->getRunNumber() , -1 ) , static_cast<long64>(recinfo._file_start) ) ;\n }\n }\n catch( sio::exception &e ) {\n \/\/ reached end of file\n if( e.code() == sio::error_code::eof ) {\n break ;\n }\n SIO_RETHROW( e, e.code(), \"Couldn't recreate event map !\" ) ;\n }\n } \/\/ while\n \/\/ go to start of file\n seekStream( stream, 0 ) ;\n return true ;\n }\n\n \/\/----------------------------------------------------------------------------\n\n void LCIORandomAccessMgr::writeRandomAccessRecords( sio::ofstream & stream ) {\n \/\/ nothing to write ?\n if( _runEvtMap->empty() ) {\n return ;\n }\n if( not stream.is_open() ) {\n throw IO::IOException( \"[LCIORandomAccessMgr::writeRandomAccessRecords] stream not opened\" ) ;\n }\n sio::block_list blocks {} ;\n\n \/\/ 1) write the first index in the file\n auto indexHandler = std::make_shared<SIOIndexHandler>() ;\n indexHandler->setRunEventMap( _runEvtMap ) ;\n blocks.push_back( indexHandler ) ;\n \/\/ write in the buffer first, then the buffer to the file\n auto recinfo = sio::api::write_record( LCSIO::IndexRecordName, _rawBuffer, blocks, 0 ) ;\n sio::api::write_record( stream, _rawBuffer.span(), recinfo ) ;\n\n \/\/ 2) create the LCIORandomAccess object ( linked list of records )\n auto ra = createFromEventMap() ;\n ra->setIndexLocation( recinfo._file_start ) ;\n long64 thisPos = stream.tellp() ;\n ra->setFirstRecordLocation( thisPos ) ;\n auto lRa = lastLCIORandomAccess() ;\n SIO_DEBUG( \"LCIORandomAccessMgr::writeRandomAccessRecords: lRa is \" << lRa );\n long64 prevPos = ( lRa ? lRa->getFirstRecordLocation() : 0 ) ;\n ra->setPreviousLocation( prevPos ) ;\n addLCIORandomAccess( ra ) ;\n\n \/\/ 3) Write the random access record\n blocks.clear() ;\n auto raHandler = std::make_shared<SIORandomAccessHandler>() ;\n raHandler->setRandomAccess( lastLCIORandomAccess() ) ;\n blocks.push_back( raHandler ) ;\n \/\/ write in the buffer first, then the buffer to the file\n recinfo = sio::api::write_record( LCSIO::AccessRecordName, _rawBuffer, blocks, 0 ) ;\n sio::api::write_record( stream, _rawBuffer.span(), recinfo ) ;\n\n \/\/ 4) Create the file record\n createFileRecord() ;\n if( thisPos > _fileRecord->_nextLocation ) {\n _fileRecord->_nextLocation = thisPos ;\n }\n if( _fileRecord->_prevLocation > thisPos ) {\n _fileRecord->_prevLocation = thisPos ;\n }\n\n \/\/ 5) Write the file random access record to stream\n raHandler->setRandomAccess( _fileRecord ) ;\n \/\/ write in the buffer first, then the buffer to the file\n recinfo = sio::api::write_record( LCSIO::AccessRecordName, _rawBuffer, blocks, 0 ) ;\n sio::api::write_record( stream, _rawBuffer.span(), recinfo ) ;\n\n SIO_DEBUG( \"Random access manager: =====\\n\" << *this );\n }\n\n \/\/----------------------------------------------------------------------------\n\n void LCIORandomAccessMgr::seekStream( sio::ifstream &stream, long64 pos ) {\n if( not stream.is_open() ) {\n throw IO::IOException( \"[LCIORandomAccessMgr::seekStream] Stream not open\") ;\n }\n if( pos < 0 ) {\n stream.seekg( 0 , std::ios_base::end ) ;\n auto endg = stream.tellg() ;\n if( endg < -pos ) {\n std::stringstream s ; s << \"[LCIORandomAccessMgr::seekStream] Can't seek stream to \" << pos ;\n throw IO::IOException( s.str() ) ;\n }\n sio::ifstream::streampos tpos = -pos ;\n \/\/ pos is negative, so addition make sense here !\n stream.seekg( endg - tpos , std::ios_base::beg ) ;\n }\n else {\n stream.seekg( pos ) ;\n }\n if( not stream.good() ) {\n std::stringstream s ; s << \"[LCIORandomAccessMgr::seekStream] Can't seek stream to \" << pos << \". rdstate is: \" << stream.rdstate() ;\n throw IO::IOException( s.str() ) ;\n }\n }\n\n \/\/----------------------------------------------------------------------------\n\n std::ostream& operator<<(std::ostream& os, const LCIORandomAccessMgr& ra ) {\n os << \" LCIORandomAccessMgr: ----------------------- \" << std::endl ;\n for( auto i = ra._list.begin() ; i != ra._list.end() ; ++i ) {\n os << **i ;\n }\n os << ra._runEvtMap << std::endl ;\n return os ;\n }\n}\n<commit_msg>Fixed random access manager streaming operator<commit_after>#include \"SIO\/LCIORandomAccessMgr.h\"\n\n#include \"SIO\/LCSIO.h\"\n#include \"SIO\/SIORandomAccessHandler.h\"\n#include \"SIO\/SIOIndexHandler.h\"\n#include \"SIO\/SIOEventHandler.h\"\n#include \"SIO\/SIORunHeaderHandler.h\"\n#include \"IOIMPL\/LCEventIOImpl.h\"\n#include \"IOIMPL\/LCRunHeaderIOImpl.h\"\n#include \"Exceptions.h\"\n\n\/\/ -- std headers\n#include <sstream>\n#include <stdio.h>\n#include <string.h>\n\n\/\/ -- sio headers\n#include <sio\/api.h>\n#include <sio\/compression\/zlib.h>\n\nnamespace SIO {\n\n void LCIORandomAccessMgr::clear() {\n _runEvtMap->clear() ;\n _list.clear() ;\n _fileRecord = nullptr ;\n }\n\n \/\/----------------------------------------------------------------------------\n\n std::shared_ptr<LCIORandomAccess> LCIORandomAccessMgr::createFromEventMap() const {\n auto ra = std::make_shared<LCIORandomAccess>() ;\n ra->_minRunEvt = _runEvtMap->minRunEvent() ;\n ra->_maxRunEvt = _runEvtMap->maxRunEvent() ;\n ra->_nRunHeaders = _runEvtMap->getNumberOfRunRecords() ;\n ra->_nEvents = _runEvtMap->getNumberOfEventRecords() ;\n ra->_recordsAreInOrder = true ; \/\/ ???? how is this defined ????\n ra->_indexLocation = 0 ;\n ra->_prevLocation = 0 ;\n ra->_nextLocation = 0 ;\n ra->_firstRecordLocation = 0 ;\n return ra ;\n }\n\n \/\/----------------------------------------------------------------------------\n\n void LCIORandomAccessMgr::createFileRecord() {\n if( nullptr == _fileRecord ) {\n _fileRecord = std::make_shared<LCIORandomAccess>() ;\n _fileRecord->_minRunEvt = RunEvent( 2147483647L, 2147483647L ) ; \/\/ 2**31-1 - largest 32 bit signed\n _fileRecord->_maxRunEvt = 0 ;\n _fileRecord->_nRunHeaders = 0 ;\n _fileRecord->_nEvents = 0 ;\n _fileRecord->_recordsAreInOrder = 1 ;\n _fileRecord->_indexLocation = 0 ; \/\/ defines file record\n _fileRecord->_prevLocation = 9223372036854775807LL ; \/\/ 2**63-1 - largest 64 bit signed\n _fileRecord->_nextLocation = 0 ;\n _fileRecord->_firstRecordLocation = 0 ;\n }\n\n for( auto i = _list.begin() ; i != _list.end() ; ++i ) {\n auto ra = *i ;\n \t_fileRecord->_minRunEvt = ( ra->_minRunEvt < _fileRecord->_minRunEvt ? ra->_minRunEvt : _fileRecord->_minRunEvt ) ;\n \t_fileRecord->_maxRunEvt = ( ra->_maxRunEvt > _fileRecord->_maxRunEvt ? ra->_maxRunEvt : _fileRecord->_maxRunEvt ) ;\n \t_fileRecord->_nRunHeaders += ra->_nRunHeaders ;\n \t_fileRecord->_nEvents += ra->_nEvents ;\n \t_fileRecord->_recordsAreInOrder = ( _fileRecord->_recordsAreInOrder * ra->_recordsAreInOrder ) ; \/\/ should be 0 if any record is 0\n \t_fileRecord->_indexLocation = 0 ; \/\/ defines file record\n \tif( ra->_nextLocation > _fileRecord->_nextLocation ) {\n \t _fileRecord->_nextLocation = ra->_nextLocation ;\n }\n \tif( 0 < ra->_prevLocation && ra->_prevLocation < _fileRecord->_prevLocation ) {\n \t _fileRecord->_prevLocation = ra->_prevLocation ;\n }\n }\n }\n\n \/\/----------------------------------------------------------------------------\n\n void LCIORandomAccessMgr::addLCIORandomAccess( std::shared_ptr<LCIORandomAccess> ra ) {\n _list.push_back( ra );\n }\n\n \/\/----------------------------------------------------------------------------\n\n bool LCIORandomAccessMgr::readLCIORandomAccessAt( sio::ifstream& stream , long64 pos) {\n seekStream( stream, pos ) ;\n return readLCIORandomAccess( stream ) ;\n }\n\n \/\/----------------------------------------------------------------------------\n\n bool LCIORandomAccessMgr::readLCIORandomAccess( sio::ifstream &stream ) {\n \/\/ first extract the record from the stream (header + data)\n sio::record_info recinfo ;\n try {\n sio::api::read_record( stream, recinfo, _rawBuffer ) ;\n }\n catch( sio::exception &e ) {\n return false ;\n }\n \/\/ we got a record but it's not an LCIORandomAccess record...\n if( recinfo._name != LCSIO::AccessRecordName ) {\n return false ;\n }\n \/\/ setup the rando access block\n sio::block_list blocks {} ;\n auto raBlock = std::make_shared<SIORandomAccessHandler>() ;\n blocks.push_back( raBlock ) ;\n \/\/ get a valid buffer span for reading\n auto recordData = _rawBuffer.span( recinfo._header_length, recinfo._data_length ) ;\n \/\/ read the record blocks\n sio::api::read_blocks( recordData, blocks ) ;\n \/\/ get our random access object and add it to our list\n addLCIORandomAccess( raBlock->randomAccess() ) ;\n return true ;\n }\n\n \/\/----------------------------------------------------------------------------\n\n bool LCIORandomAccessMgr::readLCIOIndexAt( sio::ifstream &stream , long64 pos) {\n seekStream( stream, pos ) ;\n return readLCIOIndex( stream ) ;\n }\n\n \/\/----------------------------------------------------------------------------\n\n bool LCIORandomAccessMgr::readLCIOIndex( sio::ifstream &stream ) {\n SIO_DEBUG( \"LCIORandomAccessMgr::readLCIOIndex: Reading at \" << stream.tellg() );\n \/\/ first extract the record from the stream (header + data)\n sio::record_info recinfo ;\n try {\n sio::api::read_record( stream, recinfo, _rawBuffer ) ;\n }\n catch( sio::exception &e ) {\n \/\/ no way to extract a record !\n return false ;\n }\n \/\/ we got a record but it's not an LCIOIndex record...\n if( recinfo._name != LCSIO::IndexRecordName ) {\n return false ;\n }\n \/\/ setup the rando access block\n sio::block_list blocks {} ;\n auto indexBlock = std::make_shared<SIOIndexHandler>() ;\n indexBlock->setRunEventMap( _runEvtMap ) ;\n blocks.push_back( indexBlock ) ;\n \/\/ get a valid buffer span for reading\n auto recordData = _rawBuffer.span( recinfo._header_length, recinfo._data_length ) ;\n \/\/ read the record blocks\n sio::api::read_blocks( recordData, blocks ) ;\n return true ;\n }\n\n \/\/----------------------------------------------------------------------------\n\n bool LCIORandomAccessMgr::initAppend( sio::ifstream & stream ) {\n \/\/ check if the last record is LCIORandomAccess (the file record )\n if( ! readLCIORandomAccessAt( stream , -LCSIO::RandomAccessSize ) ) {\n recreateEventMap( stream ) ;\n return false;\n }\n \/\/ store the file record separately\n _fileRecord = _list.back() ;\n _list.pop_back() ;\n \/\/ now read first LCIORandomAccess record\n readLCIORandomAccessAt( stream , _fileRecord->_nextLocation ) ; \/\/ start of last LCIORandomAccessRecord\n return true ;\n }\n\n \/\/----------------------------------------------------------------------------\n\n bool LCIORandomAccessMgr::createEventMap( sio::ifstream & stream ) {\n \/\/ check if the last record is LCIORandomAccess ( the file record )\n if( ! readLCIORandomAccessAt( stream , -LCSIO::RandomAccessSize) ) {\n return recreateEventMap( stream ) ;\n }\n \/\/ store the file record separately\n _fileRecord = _list.back() ;\n _list.pop_back() ;\n\n auto raPos = _fileRecord->_nextLocation ;\n \/\/ start of last LCIORandomAccessRecord\n readLCIORandomAccessAt( stream , raPos ) ;\n auto ra = lastLCIORandomAccess() ;\n \/\/ and then read all remaining LCIORandomAccess records\n raPos = ra->getPrevLocation() ;\n auto indexPos = ra->getIndexLocation() ;\n readLCIOIndexAt( stream , indexPos ) ;\n\n while( raPos != 0 ) {\n if( readLCIORandomAccessAt( stream , raPos) ) {\n ra = lastLCIORandomAccess() ;\n \traPos = ra->getPrevLocation() ;\n \tauto idxPos = ra->getIndexLocation() ;\n \treadLCIOIndexAt( stream , idxPos ) ;\n }\n else {\n\t throw IO::IOException( std::string( \"[LCIORandomAccessMgr::ReadEventMap()] Could not read previous LCIORandomAccess record\" ) ) ;\n }\n }\n seekStream( stream, 0 ) ;\/\/ go to start of file\n return true ;\n }\n\n \/\/----------------------------------------------------------------------------\n\n bool LCIORandomAccessMgr::recreateEventMap( sio::ifstream & stream ) {\n\n std::cout << \" LCIORandomAccessMgr::getEventMap() recreating event map for direct access (old file)\" << std::endl ;\n \/\/ read the next record from the stream\n if( not stream.is_open() ) {\n throw IO::IOException( \"LCIORandomAccessMgr::recreateEventMap: stream is not open\" ) ;\n }\n \/\/ go to start of file\n seekStream( stream, 0 ) ;\n std::set<std::string> recordlist = { LCSIO::HeaderRecordName, LCSIO::RunRecordName } ;\n while( true ) {\n sio::record_info recinfo {} ;\n try {\n sio::api::skip_records( stream, [&]( const sio::record_info &ri ){\n return ( recordlist.find(ri._name) == recordlist.end() ) ;\n }) ;\n \/\/ we read something valid here. Read the record from the stream\n sio::api::read_record( stream, recinfo, _rawBuffer ) ;\n \/\/ Get the record data\n auto recdata = _rawBuffer.span( recinfo._header_length, recinfo._data_length ) ;\n \/\/ deal with zlib uncompression\n const bool compressed = sio::api::is_compressed( recinfo._options ) ;\n if( compressed ) {\n sio::zlib_compression compressor ;\n _compressBuffer.resize( recinfo._uncompressed_length ) ;\n compressor.uncompress( recdata, _compressBuffer ) ;\n }\n \/\/ get the correct buffer depending of compression settings\n auto databuf = compressed ? _compressBuffer.span() : recdata ;\n \/\/ event case\n if( recinfo._name == LCSIO::HeaderRecordName ) {\n auto event = std::make_shared<IOIMPL::LCEventIOImpl>() ;\n \/\/ pass a dummy list of read collection with only '__dummy__' inside.\n \/\/ We only need the event and run numbers there, no need to settup all collections\n SIOEventHeaderRecord::readBlocks( databuf, event.get(), {\"__dummy__\"} ) ;\n _runEvtMap->add( RunEvent( event->getRunNumber() , event->getEventNumber() ) , static_cast<long64>(recinfo._file_start) ) ;\n }\n \/\/ run case\n else if( recinfo._name == LCSIO::RunRecordName ) {\n auto run = std::make_shared<IOIMPL::LCRunHeaderIOImpl>() ;\n SIORunHeaderRecord::readBlocks( recdata, run.get() ) ;\n _runEvtMap->add( RunEvent( run->getRunNumber() , -1 ) , static_cast<long64>(recinfo._file_start) ) ;\n }\n }\n catch( sio::exception &e ) {\n \/\/ reached end of file\n if( e.code() == sio::error_code::eof ) {\n break ;\n }\n SIO_RETHROW( e, e.code(), \"Couldn't recreate event map !\" ) ;\n }\n } \/\/ while\n \/\/ go to start of file\n seekStream( stream, 0 ) ;\n return true ;\n }\n\n \/\/----------------------------------------------------------------------------\n\n void LCIORandomAccessMgr::writeRandomAccessRecords( sio::ofstream & stream ) {\n \/\/ nothing to write ?\n if( _runEvtMap->empty() ) {\n return ;\n }\n if( not stream.is_open() ) {\n throw IO::IOException( \"[LCIORandomAccessMgr::writeRandomAccessRecords] stream not opened\" ) ;\n }\n sio::block_list blocks {} ;\n\n \/\/ 1) write the first index in the file\n auto indexHandler = std::make_shared<SIOIndexHandler>() ;\n indexHandler->setRunEventMap( _runEvtMap ) ;\n blocks.push_back( indexHandler ) ;\n \/\/ write in the buffer first, then the buffer to the file\n auto recinfo = sio::api::write_record( LCSIO::IndexRecordName, _rawBuffer, blocks, 0 ) ;\n sio::api::write_record( stream, _rawBuffer.span(), recinfo ) ;\n\n \/\/ 2) create the LCIORandomAccess object ( linked list of records )\n auto ra = createFromEventMap() ;\n ra->setIndexLocation( recinfo._file_start ) ;\n long64 thisPos = stream.tellp() ;\n ra->setFirstRecordLocation( thisPos ) ;\n auto lRa = lastLCIORandomAccess() ;\n SIO_DEBUG( \"LCIORandomAccessMgr::writeRandomAccessRecords: lRa is \" << lRa );\n long64 prevPos = ( lRa ? lRa->getFirstRecordLocation() : 0 ) ;\n ra->setPreviousLocation( prevPos ) ;\n addLCIORandomAccess( ra ) ;\n\n \/\/ 3) Write the random access record\n blocks.clear() ;\n auto raHandler = std::make_shared<SIORandomAccessHandler>() ;\n raHandler->setRandomAccess( lastLCIORandomAccess() ) ;\n blocks.push_back( raHandler ) ;\n \/\/ write in the buffer first, then the buffer to the file\n recinfo = sio::api::write_record( LCSIO::AccessRecordName, _rawBuffer, blocks, 0 ) ;\n sio::api::write_record( stream, _rawBuffer.span(), recinfo ) ;\n\n \/\/ 4) Create the file record\n createFileRecord() ;\n if( thisPos > _fileRecord->_nextLocation ) {\n _fileRecord->_nextLocation = thisPos ;\n }\n if( _fileRecord->_prevLocation > thisPos ) {\n _fileRecord->_prevLocation = thisPos ;\n }\n\n \/\/ 5) Write the file random access record to stream\n raHandler->setRandomAccess( _fileRecord ) ;\n \/\/ write in the buffer first, then the buffer to the file\n recinfo = sio::api::write_record( LCSIO::AccessRecordName, _rawBuffer, blocks, 0 ) ;\n sio::api::write_record( stream, _rawBuffer.span(), recinfo ) ;\n\n SIO_DEBUG( \"Random access manager: =====\\n\" << *this );\n }\n\n \/\/----------------------------------------------------------------------------\n\n void LCIORandomAccessMgr::seekStream( sio::ifstream &stream, long64 pos ) {\n if( not stream.is_open() ) {\n throw IO::IOException( \"[LCIORandomAccessMgr::seekStream] Stream not open\") ;\n }\n if( pos < 0 ) {\n stream.seekg( 0 , std::ios_base::end ) ;\n auto endg = stream.tellg() ;\n if( endg < -pos ) {\n std::stringstream s ; s << \"[LCIORandomAccessMgr::seekStream] Can't seek stream to \" << pos ;\n throw IO::IOException( s.str() ) ;\n }\n sio::ifstream::streampos tpos = -pos ;\n \/\/ pos is negative, so addition make sense here !\n stream.seekg( endg - tpos , std::ios_base::beg ) ;\n }\n else {\n stream.seekg( pos ) ;\n }\n if( not stream.good() ) {\n std::stringstream s ; s << \"[LCIORandomAccessMgr::seekStream] Can't seek stream to \" << pos << \". rdstate is: \" << stream.rdstate() ;\n throw IO::IOException( s.str() ) ;\n }\n }\n\n \/\/----------------------------------------------------------------------------\n\n std::ostream& operator<<(std::ostream& os, const LCIORandomAccessMgr& ra ) {\n os << \" LCIORandomAccessMgr: ----------------------- \" << std::endl ;\n for( auto i = ra._list.begin() ; i != ra._list.end() ; ++i ) {\n os << **i ;\n }\n os << *(ra._runEvtMap) << std::endl ;\n return os ;\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 QtDeclarative module of the Qt Toolkit.\n**\n** $QT_BEGIN_LICENSE:LGPL$\n** No Commercial Usage\n** This file contains pre-release code and may not be distributed.\n** You may use this file in accordance with the terms and conditions\n** contained in the 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 \"qmleasefollow_p.h\"\n#include <qmlmetaproperty.h>\n#include <math.h>\n#include <QtCore\/qdebug.h>\n#include <private\/qmlanimation_p_p.h>\n\nQT_BEGIN_NAMESPACE\n\nQML_DEFINE_TYPE(Qt,4,6,EaseFollow,QmlEaseFollow);\n\nclass QmlEaseFollowPrivate : public QObjectPrivate\n{\n Q_DECLARE_PUBLIC(QmlEaseFollow)\npublic:\n QmlEaseFollowPrivate()\n : source(0), velocity(200), duration(-1), maximumEasingTime(-1),\n reversingMode(QmlEaseFollow::Eased), initialVelocity(0), \n initialValue(0), invert(false), enabled(true), trackVelocity(0), clockOffset(0),\n lastTick(0), clock(this)\n {} \n\n qreal source;\n qreal velocity;\n qreal duration;\n qreal maximumEasingTime;\n QmlEaseFollow::ReversingMode reversingMode;\n\n qreal initialVelocity;\n qreal initialValue;\n bool invert;\n bool enabled;\n\n qreal trackVelocity;\n\n QmlMetaProperty target;\n\n int clockOffset;\n int lastTick;\n void tick(int);\n void clockStart();\n void clockStop();\n QTickAnimationProxy<QmlEaseFollowPrivate, &QmlEaseFollowPrivate::tick> clock;\n\n void restart();\n\n \/\/ Parameters for use in tick()\n qreal a; \/\/ Acceleration\n qreal d; \/\/ Deceleration\n qreal tf; \/\/ Total time\n qreal tp; \/\/ Time at which peak velocity occurs\n qreal td; \/\/ Time at which decelleration begins\n qreal vp; \/\/ Velocity at tp\n qreal sp; \/\/ Displacement at tp\n qreal sd; \/\/ Displacement at td\n qreal vi; \/\/ \"Normalized\" initialvelocity\n bool recalc();\n};\n\nbool QmlEaseFollowPrivate::recalc()\n{\n qreal s = source - initialValue;\n vi = initialVelocity;\n\n s = (invert?-1.0:1.0) * s;\n vi = (invert?-1.0:1.0) * vi;\n\n if (duration > 0 && velocity > 0) {\n tf = s \/ velocity;\n if (tf > (duration \/ 1000.)) tf = (duration \/ 1000.);\n } else if (duration > 0) {\n tf = duration \/ 1000.;\n } else if (velocity > 0) {\n tf = s \/ velocity;\n } else {\n return false;\n }\n\n if (maximumEasingTime == 0) {\n a = 0;\n d = 0;\n tp = 0;\n td = tf;\n vp = velocity;\n sp = 0;\n sd = s;\n } else if (tf > (maximumEasingTime \/ 1000.)) {\n\n qreal met = maximumEasingTime \/ 1000.;\n td = tf - met;\n\n qreal c1 = td;\n qreal c2 = (tf - td) * vi - tf * velocity;\n qreal c3 = -0.5 * (tf - td) * vi * vi;\n\n qreal vp1 = (-c2 + sqrt(c2 * c2 - 4 * c1 * c3)) \/ (2. * c1);\n \/\/ qreal vp2 = (-c2 - sqrt(c2 * c2 - 4 * c1 * c3)) \/ (2. * c1);\n\n vp = vp1;\n a = vp \/ met;\n d = a;\n tp = (vp - vi) \/ a;\n sp = vi * tp + 0.5 * a * tp * tp;\n sd = sp + (td - tp) * vp;\n } else {\n\n qreal c1 = 0.25 * tf * tf;\n qreal c2 = 0.5 * vi * tf - s;\n qreal c3 = -0.25 * vi * vi;\n\n qreal a1 = (-c2 + sqrt(c2 * c2 - 4 * c1 * c3)) \/ (2. * c1);\n \/\/qreal a2 = (-c2 - sqrt(c2 * c2 - 4 * c1 * c3)) \/ (2. * c1);\n\n qreal tp1 = 0.5 * tf - 0.5 * vi \/ a1;\n \/\/qreal tp2 = 0.5 * tf - 0.5 * vi \/ a2;\n qreal vp1 = a1 * tp1 + vi;\n \/\/qreal vp2 = a2 * tp2 + vi;\n\n qreal sp1 = 0.5 * a1 * tp1 * tp1 + vi * tp1;\n \/\/qreal sp2 = 0.5 * a2 * tp2 * tp2 + vi * tp2;\n\n a = a1;\n d = a1;\n tp = tp1;\n td = tp1;\n vp = vp1;\n sp = sp1;\n sd = sp1;\n }\n\n \/*\n qWarning() << \"a:\" << a << \"tf:\" << tf << \"tp:\" << tp << \"vp:\" \n << vp << \"sp:\" << sp << \"vi:\" << vi << \"invert:\" << invert;\n *\/\n return true;\n}\n\nvoid QmlEaseFollowPrivate::clockStart()\n{\n if (clock.state() == QAbstractAnimation::Running) {\n clockOffset = lastTick;\n return;\n } else {\n clockOffset = 0;\n lastTick = 0;\n clock.start();\n }\n}\n\nvoid QmlEaseFollowPrivate::clockStop()\n{\n clockOffset = 0;\n lastTick = 0;\n clock.stop();\n}\n\nvoid QmlEaseFollowPrivate::tick(int t)\n{\n lastTick = t;\n t -= clockOffset;\n\n qreal time_seconds = qreal(t) \/ 1000.;\n\n qreal out = 0;\n if (time_seconds < tp) {\n\n trackVelocity = vi + time_seconds * a;\n trackVelocity = (invert?-1.0:1.0) * trackVelocity;\n\n qreal value = 0.5 * a * time_seconds * time_seconds + vi * time_seconds;\n value = (invert?-1.0:1.0) * value;\n target.write(initialValue + value);\n out = initialValue + value;\n } else if (time_seconds < td) {\n\n time_seconds -= tp;\n trackVelocity = (invert?-1.0:1.0) * vp;\n qreal value = sp + time_seconds * vp;\n value = (invert?-1.0:1.0) * value;\n\n target.write(initialValue + value);\n\n out = initialValue + value;\n } else if (time_seconds < tf) {\n\n time_seconds -= td;\n\n trackVelocity = vp - time_seconds * a;\n trackVelocity = (invert?-1.0:1.0) * trackVelocity;\n\n qreal value = sd - 0.5 * d * time_seconds * time_seconds + vp * time_seconds;\n value = (invert?-1.0:1.0) * value;\n\n target.write(initialValue + value);\n\n out = initialValue + value;\n } else {\n\n clock.stop();\n\n trackVelocity = 0;\n target.write(source);\n }\n\n \/\/qWarning() << out << trackVelocity << t << a;\n}\n\n\/*!\n \\qmlclass EaseFollow QmlEaseFollow\n \\brief The EaseFollow element allows a property to smoothly track a value.\n\n The EaseFollow smoothly animates a property's value to a set target value \n using an ease in\/out quad easing curve. If the target value changes while\n the animation is in progress, the easing curves used to animate to the old \n and the new target values are spliced together to avoid any obvious visual\n glitches.\n\n The property animation is configured by setting the velocity at which the\n animation should occur, or the duration that the animation should take. \n If both a velocity and a duration are specified, the one that results in\n the quickest animation is chosen for each change in the target value.\n\n For example, animating from 0 to 800 will take 4 seconds if a velocity\n of 200 is set, will take 8 seconds with a duration of 8000 set, and will \n take 4 seconds with both a velocity of 200 and a duration of 8000 set.\n Animating from 0 to 20000 will take 10 seconds if a velocity of 200 is set,\n will take 8 seconds with a duration of 8000 set, and will take 8 seconds\n with both a velocity of 200 and a duration of 8000 set.\n\n The follow example shows one rectangle tracking the position of another.\n\\code\nimport Qt 4.6\n\nRectangle {\n width: 800; height: 600; color: \"blue\"\n\n Rectangle {\n color: \"green\"\n width: 60; height: 60;\n x: -5; y: -5;\n x: EaseFollow { source: rect1.x - 5; velocity: 200 }\n y: EaseFollow { source: rect1.y - 5; velocity: 200 }\n }\n\n Rectangle {\n id: rect1\n color: \"red\"\n width: 50; height: 50;\n }\n\n focus: true\n Keys.onRightPressed: rect1.x = rect1.x + 100\n Keys.onLeftPressed: rect1.x = rect1.x - 100\n Keys.onUpPressed: rect1.y = rect1.y - 100\n Keys.onDownPressed: rect1.y = rect1.y + 100\n}\n\\endcode\n\n \\sa SpringFollow\n*\/\n\nQmlEaseFollow::QmlEaseFollow(QObject *parent)\n: QObject(*(new QmlEaseFollowPrivate), parent)\n{\n}\n\nQmlEaseFollow::~QmlEaseFollow()\n{\n}\n\n\/*!\n \\qmlproperty qreal EaseFollow::source\n This property holds the source value which will be tracked.\n\n Bind to a property in order to track its changes.\n*\/\nqreal QmlEaseFollow::sourceValue() const\n{\n Q_D(const QmlEaseFollow);\n return d->source;\n}\n\n\/*!\n \\qmlproperty enumeration EaseFollow::reversingMode\n\n Sets how the EaseFollow behaves if an animation direction is reversed.\n\n If reversing mode is \\c Eased, the animation will smoothly decelerate, and\n then reverse direction. If the reversing mode is \\c Immediate, the \n animation will immediately begin accelerating in the reverse direction, \n begining with a velocity of 0. If the reversing mode is \\c Sync, the\n property is immediately set to the target value.\n*\/\nQmlEaseFollow::ReversingMode QmlEaseFollow::reversingMode() const\n{\n Q_D(const QmlEaseFollow);\n return d->reversingMode;\n}\n\nvoid QmlEaseFollow::setReversingMode(ReversingMode m)\n{\n Q_D(QmlEaseFollow);\n if (d->reversingMode == m)\n return;\n\n d->reversingMode = m;\n emit reversingModeChanged();\n}\n\nvoid QmlEaseFollowPrivate::restart()\n{\n if (!enabled || velocity == 0) {\n clockStop();\n return;\n }\n\n initialValue = target.read().toReal();\n\n if (source == initialValue) {\n clockStop();\n return;\n }\n\n bool hasReversed = trackVelocity != 0. && \n ((trackVelocity > 0) == ((initialValue - source) > 0));\n\n if (hasReversed) {\n switch (reversingMode) {\n default:\n case QmlEaseFollow::Eased:\n break;\n case QmlEaseFollow::Sync:\n target.write(source);\n return;\n case QmlEaseFollow::Immediate:\n initialVelocity = 0;\n clockStop();\n break;\n }\n }\n\n trackVelocity = initialVelocity;\n\n invert = (source < initialValue);\n\n if (!recalc()) {\n target.write(source);\n clockStop();\n return;\n }\n\n clockStart();\n}\n\nvoid QmlEaseFollow::setSourceValue(qreal s)\n{\n Q_D(QmlEaseFollow);\n\n if (d->clock.state() == QAbstractAnimation::Running && d->source == s)\n return;\n\n d->source = s;\n d->initialVelocity = d->trackVelocity;\n d->restart();\n\n emit sourceChanged();\n}\n\n\/*!\n \\qmlproperty qreal EaseFollow::duration\n\n This property holds the animation duration used when tracking the source.\n\n Setting this to -1 disables the duration value.\n*\/\nqreal QmlEaseFollow::duration() const\n{\n Q_D(const QmlEaseFollow);\n return d->duration;\n}\n\nvoid QmlEaseFollow::setDuration(qreal v)\n{\n Q_D(QmlEaseFollow);\n if (d->duration == v)\n return;\n\n d->duration = v;\n d->trackVelocity = 0;\n\n if (d->clock.state() == QAbstractAnimation::Running) \n d->restart();\n\n emit durationChanged();\n}\n\nqreal QmlEaseFollow::velocity() const\n{\n Q_D(const QmlEaseFollow);\n return d->velocity;\n}\n\n\/*!\n \\qmlproperty qreal EaseFollow::velocity\n\n This property holds the average velocity allowed when tracking the source.\n\n Setting this to -1 disables the velocity value.\n*\/\nvoid QmlEaseFollow::setVelocity(qreal v)\n{\n Q_D(QmlEaseFollow);\n if (d->velocity == v)\n return;\n\n d->velocity = v;\n d->trackVelocity = 0;\n\n if (d->clock.state() == QAbstractAnimation::Running) \n d->restart();\n\n emit velocityChanged();\n}\n\n\/*!\n \\qmlproperty bool EaseFollow::enabled\n This property holds whether the target will track the source.\n*\/\nbool QmlEaseFollow::enabled() const\n{\n Q_D(const QmlEaseFollow);\n return d->enabled;\n}\n\nvoid QmlEaseFollow::setEnabled(bool enabled)\n{\n Q_D(QmlEaseFollow);\n if (d->enabled == enabled)\n return;\n\n d->enabled = enabled;\n if (enabled)\n d->restart();\n else\n d->clockStop();\n\n emit enabledChanged();\n}\n\nvoid QmlEaseFollow::setTarget(const QmlMetaProperty &t)\n{\n Q_D(QmlEaseFollow);\n d->target = t;\n}\n\n\/*!\n\\qmlproperty qreal EaseFollow::maximumEasingTime\n\nThis property specifies the maximum time an \"eases\" during the follow should take.\nSetting this property causes the velocity to \"level out\" after at a time. Setting \na negative value reverts to the normal mode of easing over the entire animation \nduration.\n\nThe default value is -1.\n*\/\nqreal QmlEaseFollow::maximumEasingTime() const\n{\n Q_D(const QmlEaseFollow);\n return d->maximumEasingTime;\n}\n\nvoid QmlEaseFollow::setMaximumEasingTime(qreal v)\n{\n Q_D(QmlEaseFollow);\n d->maximumEasingTime = v;\n\n if (d->clock.state() == QAbstractAnimation::Running) \n d->restart();\n\n emit maximumEasingTimeChanged();\n}\n\nQT_END_NAMESPACE\n<commit_msg>Fix jumpy EaseFollow animations<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 QtDeclarative module of the Qt Toolkit.\n**\n** $QT_BEGIN_LICENSE:LGPL$\n** No Commercial Usage\n** This file contains pre-release code and may not be distributed.\n** You may use this file in accordance with the terms and conditions\n** contained in the 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 \"qmleasefollow_p.h\"\n#include <qmlmetaproperty.h>\n#include <math.h>\n#include <QtCore\/qdebug.h>\n#include <private\/qmlanimation_p_p.h>\n\nQT_BEGIN_NAMESPACE\n\nQML_DEFINE_TYPE(Qt,4,6,EaseFollow,QmlEaseFollow);\n\nclass QmlEaseFollowPrivate : public QObjectPrivate\n{\n Q_DECLARE_PUBLIC(QmlEaseFollow)\npublic:\n QmlEaseFollowPrivate()\n : source(0), velocity(200), duration(-1), maximumEasingTime(-1),\n reversingMode(QmlEaseFollow::Eased), initialVelocity(0), \n initialValue(0), invert(false), enabled(true), trackVelocity(0), clockOffset(0),\n lastTick(0), clock(this)\n {} \n\n qreal source;\n qreal velocity;\n qreal duration;\n qreal maximumEasingTime;\n QmlEaseFollow::ReversingMode reversingMode;\n\n qreal initialVelocity;\n qreal initialValue;\n bool invert;\n bool enabled;\n\n qreal trackVelocity;\n\n QmlMetaProperty target;\n\n int clockOffset;\n int lastTick;\n void tick(int);\n void clockStart();\n void clockStop();\n QTickAnimationProxy<QmlEaseFollowPrivate, &QmlEaseFollowPrivate::tick> clock;\n\n void restart();\n\n \/\/ Parameters for use in tick()\n qreal a; \/\/ Acceleration\n qreal d; \/\/ Deceleration\n qreal tf; \/\/ Total time\n qreal tp; \/\/ Time at which peak velocity occurs\n qreal td; \/\/ Time at which decelleration begins\n qreal vp; \/\/ Velocity at tp\n qreal sp; \/\/ Displacement at tp\n qreal sd; \/\/ Displacement at td\n qreal vi; \/\/ \"Normalized\" initialvelocity\n bool recalc();\n};\n\nbool QmlEaseFollowPrivate::recalc()\n{\n qreal s = source - initialValue;\n vi = initialVelocity;\n\n s = (invert?-1.0:1.0) * s;\n vi = (invert?-1.0:1.0) * vi;\n\n if (duration > 0 && velocity > 0) {\n tf = s \/ velocity;\n if (tf > (duration \/ 1000.)) tf = (duration \/ 1000.);\n } else if (duration > 0) {\n tf = duration \/ 1000.;\n } else if (velocity > 0) {\n tf = s \/ velocity;\n } else {\n return false;\n }\n\n if (maximumEasingTime == 0) {\n a = 0;\n d = 0;\n tp = 0;\n td = tf;\n vp = velocity;\n sp = 0;\n sd = s;\n } else if (maximumEasingTime != -1 && tf > (maximumEasingTime \/ 1000.)) {\n\n qreal met = maximumEasingTime \/ 1000.;\n td = tf - met;\n\n qreal c1 = td;\n qreal c2 = (tf - td) * vi - tf * velocity;\n qreal c3 = -0.5 * (tf - td) * vi * vi;\n\n qreal vp1 = (-c2 + sqrt(c2 * c2 - 4 * c1 * c3)) \/ (2. * c1);\n \/\/ qreal vp2 = (-c2 - sqrt(c2 * c2 - 4 * c1 * c3)) \/ (2. * c1);\n\n vp = vp1;\n a = vp \/ met;\n d = a;\n tp = (vp - vi) \/ a;\n sp = vi * tp + 0.5 * a * tp * tp;\n sd = sp + (td - tp) * vp;\n } else {\n\n qreal c1 = 0.25 * tf * tf;\n qreal c2 = 0.5 * vi * tf - s;\n qreal c3 = -0.25 * vi * vi;\n\n qreal a1 = (-c2 + sqrt(c2 * c2 - 4 * c1 * c3)) \/ (2. * c1);\n \/\/qreal a2 = (-c2 - sqrt(c2 * c2 - 4 * c1 * c3)) \/ (2. * c1);\n\n qreal tp1 = 0.5 * tf - 0.5 * vi \/ a1;\n \/\/qreal tp2 = 0.5 * tf - 0.5 * vi \/ a2;\n qreal vp1 = a1 * tp1 + vi;\n \/\/qreal vp2 = a2 * tp2 + vi;\n\n qreal sp1 = 0.5 * a1 * tp1 * tp1 + vi * tp1;\n \/\/qreal sp2 = 0.5 * a2 * tp2 * tp2 + vi * tp2;\n\n a = a1;\n d = a1;\n tp = tp1;\n td = tp1;\n vp = vp1;\n sp = sp1;\n sd = sp1;\n }\n\n \/*\n qWarning() << \"a:\" << a << \"tf:\" << tf << \"tp:\" << tp << \"vp:\" \n << vp << \"sp:\" << sp << \"vi:\" << vi << \"invert:\" << invert;\n *\/\n return true;\n}\n\nvoid QmlEaseFollowPrivate::clockStart()\n{\n if (clock.state() == QAbstractAnimation::Running) {\n clockOffset = lastTick;\n return;\n } else {\n clockOffset = 0;\n lastTick = 0;\n clock.start();\n }\n}\n\nvoid QmlEaseFollowPrivate::clockStop()\n{\n clockOffset = 0;\n lastTick = 0;\n clock.stop();\n}\n\nvoid QmlEaseFollowPrivate::tick(int t)\n{\n lastTick = t;\n t -= clockOffset;\n\n qreal time_seconds = qreal(t) \/ 1000.;\n\n qreal out = 0;\n if (time_seconds < tp) {\n\n trackVelocity = vi + time_seconds * a;\n trackVelocity = (invert?-1.0:1.0) * trackVelocity;\n\n qreal value = 0.5 * a * time_seconds * time_seconds + vi * time_seconds;\n value = (invert?-1.0:1.0) * value;\n target.write(initialValue + value);\n out = initialValue + value;\n } else if (time_seconds < td) {\n\n time_seconds -= tp;\n trackVelocity = (invert?-1.0:1.0) * vp;\n qreal value = sp + time_seconds * vp;\n value = (invert?-1.0:1.0) * value;\n\n target.write(initialValue + value);\n\n out = initialValue + value;\n } else if (time_seconds < tf) {\n\n time_seconds -= td;\n\n trackVelocity = vp - time_seconds * a;\n trackVelocity = (invert?-1.0:1.0) * trackVelocity;\n\n qreal value = sd - 0.5 * d * time_seconds * time_seconds + vp * time_seconds;\n value = (invert?-1.0:1.0) * value;\n\n target.write(initialValue + value);\n\n out = initialValue + value;\n } else {\n\n clock.stop();\n\n trackVelocity = 0;\n target.write(source);\n }\n\n \/\/qWarning() << out << trackVelocity << t << a;\n}\n\n\/*!\n \\qmlclass EaseFollow QmlEaseFollow\n \\brief The EaseFollow element allows a property to smoothly track a value.\n\n The EaseFollow smoothly animates a property's value to a set target value \n using an ease in\/out quad easing curve. If the target value changes while\n the animation is in progress, the easing curves used to animate to the old \n and the new target values are spliced together to avoid any obvious visual\n glitches.\n\n The property animation is configured by setting the velocity at which the\n animation should occur, or the duration that the animation should take. \n If both a velocity and a duration are specified, the one that results in\n the quickest animation is chosen for each change in the target value.\n\n For example, animating from 0 to 800 will take 4 seconds if a velocity\n of 200 is set, will take 8 seconds with a duration of 8000 set, and will \n take 4 seconds with both a velocity of 200 and a duration of 8000 set.\n Animating from 0 to 20000 will take 10 seconds if a velocity of 200 is set,\n will take 8 seconds with a duration of 8000 set, and will take 8 seconds\n with both a velocity of 200 and a duration of 8000 set.\n\n The follow example shows one rectangle tracking the position of another.\n\\code\nimport Qt 4.6\n\nRectangle {\n width: 800; height: 600; color: \"blue\"\n\n Rectangle {\n color: \"green\"\n width: 60; height: 60;\n x: -5; y: -5;\n x: EaseFollow { source: rect1.x - 5; velocity: 200 }\n y: EaseFollow { source: rect1.y - 5; velocity: 200 }\n }\n\n Rectangle {\n id: rect1\n color: \"red\"\n width: 50; height: 50;\n }\n\n focus: true\n Keys.onRightPressed: rect1.x = rect1.x + 100\n Keys.onLeftPressed: rect1.x = rect1.x - 100\n Keys.onUpPressed: rect1.y = rect1.y - 100\n Keys.onDownPressed: rect1.y = rect1.y + 100\n}\n\\endcode\n\n \\sa SpringFollow\n*\/\n\nQmlEaseFollow::QmlEaseFollow(QObject *parent)\n: QObject(*(new QmlEaseFollowPrivate), parent)\n{\n}\n\nQmlEaseFollow::~QmlEaseFollow()\n{\n}\n\n\/*!\n \\qmlproperty qreal EaseFollow::source\n This property holds the source value which will be tracked.\n\n Bind to a property in order to track its changes.\n*\/\nqreal QmlEaseFollow::sourceValue() const\n{\n Q_D(const QmlEaseFollow);\n return d->source;\n}\n\n\/*!\n \\qmlproperty enumeration EaseFollow::reversingMode\n\n Sets how the EaseFollow behaves if an animation direction is reversed.\n\n If reversing mode is \\c Eased, the animation will smoothly decelerate, and\n then reverse direction. If the reversing mode is \\c Immediate, the \n animation will immediately begin accelerating in the reverse direction, \n begining with a velocity of 0. If the reversing mode is \\c Sync, the\n property is immediately set to the target value.\n*\/\nQmlEaseFollow::ReversingMode QmlEaseFollow::reversingMode() const\n{\n Q_D(const QmlEaseFollow);\n return d->reversingMode;\n}\n\nvoid QmlEaseFollow::setReversingMode(ReversingMode m)\n{\n Q_D(QmlEaseFollow);\n if (d->reversingMode == m)\n return;\n\n d->reversingMode = m;\n emit reversingModeChanged();\n}\n\nvoid QmlEaseFollowPrivate::restart()\n{\n if (!enabled || velocity == 0) {\n clockStop();\n return;\n }\n\n initialValue = target.read().toReal();\n\n if (source == initialValue) {\n clockStop();\n return;\n }\n\n bool hasReversed = trackVelocity != 0. && \n ((trackVelocity > 0) == ((initialValue - source) > 0));\n\n if (hasReversed) {\n switch (reversingMode) {\n default:\n case QmlEaseFollow::Eased:\n break;\n case QmlEaseFollow::Sync:\n target.write(source);\n return;\n case QmlEaseFollow::Immediate:\n initialVelocity = 0;\n clockStop();\n break;\n }\n }\n\n trackVelocity = initialVelocity;\n\n invert = (source < initialValue);\n\n if (!recalc()) {\n target.write(source);\n clockStop();\n return;\n }\n\n clockStart();\n}\n\nvoid QmlEaseFollow::setSourceValue(qreal s)\n{\n Q_D(QmlEaseFollow);\n\n if (d->clock.state() == QAbstractAnimation::Running && d->source == s)\n return;\n\n d->source = s;\n d->initialVelocity = d->trackVelocity;\n d->restart();\n\n emit sourceChanged();\n}\n\n\/*!\n \\qmlproperty qreal EaseFollow::duration\n\n This property holds the animation duration used when tracking the source.\n\n Setting this to -1 disables the duration value.\n*\/\nqreal QmlEaseFollow::duration() const\n{\n Q_D(const QmlEaseFollow);\n return d->duration;\n}\n\nvoid QmlEaseFollow::setDuration(qreal v)\n{\n Q_D(QmlEaseFollow);\n if (d->duration == v)\n return;\n\n d->duration = v;\n d->trackVelocity = 0;\n\n if (d->clock.state() == QAbstractAnimation::Running) \n d->restart();\n\n emit durationChanged();\n}\n\nqreal QmlEaseFollow::velocity() const\n{\n Q_D(const QmlEaseFollow);\n return d->velocity;\n}\n\n\/*!\n \\qmlproperty qreal EaseFollow::velocity\n\n This property holds the average velocity allowed when tracking the source.\n\n Setting this to -1 disables the velocity value.\n*\/\nvoid QmlEaseFollow::setVelocity(qreal v)\n{\n Q_D(QmlEaseFollow);\n if (d->velocity == v)\n return;\n\n d->velocity = v;\n d->trackVelocity = 0;\n\n if (d->clock.state() == QAbstractAnimation::Running) \n d->restart();\n\n emit velocityChanged();\n}\n\n\/*!\n \\qmlproperty bool EaseFollow::enabled\n This property holds whether the target will track the source.\n*\/\nbool QmlEaseFollow::enabled() const\n{\n Q_D(const QmlEaseFollow);\n return d->enabled;\n}\n\nvoid QmlEaseFollow::setEnabled(bool enabled)\n{\n Q_D(QmlEaseFollow);\n if (d->enabled == enabled)\n return;\n\n d->enabled = enabled;\n if (enabled)\n d->restart();\n else\n d->clockStop();\n\n emit enabledChanged();\n}\n\nvoid QmlEaseFollow::setTarget(const QmlMetaProperty &t)\n{\n Q_D(QmlEaseFollow);\n d->target = t;\n}\n\n\/*!\n\\qmlproperty qreal EaseFollow::maximumEasingTime\n\nThis property specifies the maximum time an \"eases\" during the follow should take.\nSetting this property causes the velocity to \"level out\" after at a time. Setting \na negative value reverts to the normal mode of easing over the entire animation \nduration.\n\nThe default value is -1.\n*\/\nqreal QmlEaseFollow::maximumEasingTime() const\n{\n Q_D(const QmlEaseFollow);\n return d->maximumEasingTime;\n}\n\nvoid QmlEaseFollow::setMaximumEasingTime(qreal v)\n{\n Q_D(QmlEaseFollow);\n d->maximumEasingTime = v;\n\n if (d->clock.state() == QAbstractAnimation::Running) \n d->restart();\n\n emit maximumEasingTimeChanged();\n}\n\nQT_END_NAMESPACE\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 * Copyright (c) 2012-, Open Perception, Inc.\n *\n * All rights reserved.\n *\n * Redistribution and use in source and binary forms, with or without\n * modification, are permitted provided that the following conditions\n * are met:\n *\n * * Redistributions of source code must retain the above copyright\n * notice, this list of conditions and the following disclaimer.\n * * Redistributions in binary form must reproduce the above\n * copyright notice, this list of conditions and the following\n * disclaimer in the documentation and\/or other materials provided\n * with the distribution.\n * * Neither the name of the copyright holder(s) nor the names of its\n * contributors may be used to endorse or promote products derived\n * from this software without specific prior written permission.\n *\n * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS\n * \"AS IS\" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT\n * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS\n * FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE\n * COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT,\n * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING,\n * BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;\n * LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER\n * CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT\n * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN\n * ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE\n * POSSIBILITY OF SUCH DAMAGE.\n *\n * $Id$\n *\n *\/\n#ifndef PCL_REGISTRATION_IMPL_CORRESPONDENCE_ESTIMATION_H_\n#define PCL_REGISTRATION_IMPL_CORRESPONDENCE_ESTIMATION_H_\n\n#include <pcl\/common\/concatenate.h>\n#include <pcl\/registration\/correspondence_estimation.h>\n#include <pcl\/common\/io.h>\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\ntemplate <typename PointSource, typename PointTarget> void\npcl::registration::CorrespondenceEstimationBase<PointSource, PointTarget>::setInputTarget (\n const PointCloudTargetConstPtr &cloud)\n{\n if (cloud->points.empty ())\n {\n PCL_ERROR (\"[pcl::%s::setInputTarget] Invalid or empty point cloud dataset given!\\n\", getClassName ().c_str ());\n return;\n }\n target_ = cloud;\n\n \/\/ Set the internal point representation of choice\n if (point_representation_)\n tree_->setPointRepresentation (point_representation_);\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\ntemplate <typename PointSource, typename PointTarget> bool\npcl::registration::CorrespondenceEstimationBase<PointSource, PointTarget>::initCompute ()\n{\n if (!target_)\n {\n PCL_WARN (\"[pcl::%s::compute] No input target dataset was given!\\n\", getClassName ().c_str ());\n return (false);\n }\n\n \/\/ If the target indices have been given via setIndicesTarget\n if (target_indices_)\n tree_->setInputCloud (target_, target_indices_);\n else\n tree_->setInputCloud (target_);\n\n return (PCLBase<PointSource>::initCompute ());\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\ntemplate <typename PointSource, typename PointTarget> void\npcl::registration::CorrespondenceEstimation<PointSource, PointTarget>::determineCorrespondences (\n pcl::Correspondences &correspondences, double max_distance)\n{\n if (!initCompute ())\n return;\n\n double max_dist_sqr = max_distance * max_distance;\n\n typedef typename pcl::traits::fieldList<PointTarget>::type FieldListTarget;\n correspondences.resize (indices_->size ());\n\n std::vector<int> index (1);\n std::vector<float> distance (1);\n pcl::Correspondence corr;\n unsigned int nr_valid_correspondences = 0;\n \n \/\/ Check if the template types are the same. If true, avoid a copy.\n \/\/ Both point types MUST be registered using the POINT_CLOUD_REGISTER_POINT_STRUCT macro!\n if (isSamePointType<PointSource, PointTarget> ())\n {\n \/\/ Iterate over the input set of source indices\n for (std::vector<int>::const_iterator idx = indices_->begin (); idx != indices_->end (); ++idx)\n {\n tree_->nearestKSearch (input_->points[*idx], 1, index, distance);\n if (distance[0] > max_dist_sqr)\n continue;\n\n corr.index_query = *idx;\n corr.index_match = index[0];\n corr.distance = distance[0];\n correspondences[nr_valid_correspondences++] = corr;\n }\n }\n else\n {\n PointTarget pt;\n \n \/\/ Iterate over the input set of source indices\n for (std::vector<int>::const_iterator idx = indices_->begin (); idx != indices_->end (); ++idx)\n {\n \/\/ Copy the source data to a target PointTarget format so we can search in the tree\n pcl::for_each_type <FieldListTarget> (pcl::NdConcatenateFunctor <PointSource, PointTarget> (\n input_->points[*idx], \n pt));\n\n tree_->nearestKSearch (pt, 1, index, distance);\n if (distance[0] > max_dist_sqr)\n continue;\n\n corr.index_query = *idx;\n corr.index_match = index[0];\n corr.distance = distance[0];\n correspondences[nr_valid_correspondences++] = corr;\n }\n }\n correspondences.resize (nr_valid_correspondences);\n deinitCompute ();\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\ntemplate <typename PointSource, typename PointTarget> void\npcl::registration::CorrespondenceEstimation<PointSource, PointTarget>::determineReciprocalCorrespondences (\n pcl::Correspondences &correspondences, double max_distance)\n{\n if (!initCompute ())\n return;\n \n typedef typename pcl::traits::fieldList<PointSource>::type FieldListSource;\n typedef typename pcl::traits::fieldList<PointTarget>::type FieldListTarget;\n typedef typename pcl::intersect<FieldListSource, FieldListTarget>::type FieldList;\n \n \/\/ setup tree for reciprocal search\n pcl::KdTreeFLANN<PointSource> tree_reciprocal;\n \/\/ Set the internal point representation of choice\n if (point_representation_)\n tree_reciprocal.setPointRepresentation (point_representation_);\n\n tree_reciprocal.setInputCloud (input_, indices_);\n\n double max_dist_sqr = max_distance * max_distance;\n\n correspondences.resize (indices_->size());\n std::vector<int> index (1);\n std::vector<float> distance (1);\n std::vector<int> index_reciprocal (1);\n std::vector<float> distance_reciprocal (1);\n pcl::Correspondence corr;\n unsigned int nr_valid_correspondences = 0;\n int target_idx = 0;\n\n \/\/ Check if the template types are the same. If true, avoid a copy.\n \/\/ Both point types MUST be registered using the POINT_CLOUD_REGISTER_POINT_STRUCT macro!\n if (isSamePointType<PointSource, PointTarget> ())\n {\n \/\/ Iterate over the input set of source indices\n for (std::vector<int>::const_iterator idx = indices_->begin (); idx != indices_->end (); ++idx)\n {\n tree_->nearestKSearch (input_->points[*idx], 1, index, distance);\n if (distance[0] > max_dist_sqr)\n continue;\n\n target_idx = index[0];\n\n tree_reciprocal.nearestKSearch (target_->points[target_idx], 1, index_reciprocal, distance_reciprocal);\n if (distance_reciprocal[0] > max_dist_sqr || *idx != index_reciprocal[0])\n continue;\n\n corr.index_query = *idx;\n corr.index_match = index[0];\n corr.distance = distance[0];\n correspondences[nr_valid_correspondences++] = corr;\n }\n }\n else\n {\n PointTarget pt_src;\n PointSource pt_tgt;\n \n \/\/ Iterate over the input set of source indices\n for (std::vector<int>::const_iterator idx = indices_->begin (); idx != indices_->end (); ++idx)\n {\n \/\/ Copy the source data to a target PointTarget format so we can search in the tree\n pcl::for_each_type <FieldList> (pcl::NdConcatenateFunctor <PointSource, PointTarget> (\n input_->points[*idx], \n pt_src));\n\n tree_->nearestKSearch (pt_src, 1, index, distance);\n if (distance[0] > max_dist_sqr)\n continue;\n\n target_idx = index[0];\n\n \/\/ Copy the target data to a target PointSource format so we can search in the tree_reciprocal\n pcl::for_each_type<FieldList> (pcl::NdConcatenateFunctor <PointTarget, PointSource> (\n target_->points[target_idx],\n pt_tgt));\n\n tree_reciprocal.nearestKSearch (pt_tgt, 1, index_reciprocal, distance_reciprocal);\n if (distance_reciprocal[0] > max_dist_sqr || *idx != index_reciprocal[0])\n continue;\n\n corr.index_query = *idx;\n corr.index_match = index[0];\n corr.distance = distance[0];\n correspondences[nr_valid_correspondences++] = corr;\n }\n }\n correspondences.resize (nr_valid_correspondences);\n deinitCompute ();\n}\n\n\/\/#define PCL_INSTANTIATE_CorrespondenceEstimation(T,U) template class PCL_EXPORTS pcl::registration::CorrespondenceEstimation<T,U>;\n\n#endif \/* PCL_REGISTRATION_IMPL_CORRESPONDENCE_ESTIMATION_H_ *\/\n<commit_msg>WARN->ERROR<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 * Copyright (c) 2012-, Open Perception, Inc.\n *\n * All rights reserved.\n *\n * Redistribution and use in source and binary forms, with or without\n * modification, are permitted provided that the following conditions\n * are met:\n *\n * * Redistributions of source code must retain the above copyright\n * notice, this list of conditions and the following disclaimer.\n * * Redistributions in binary form must reproduce the above\n * copyright notice, this list of conditions and the following\n * disclaimer in the documentation and\/or other materials provided\n * with the distribution.\n * * Neither the name of the copyright holder(s) nor the names of its\n * contributors may be used to endorse or promote products derived\n * from this software without specific prior written permission.\n *\n * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS\n * \"AS IS\" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT\n * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS\n * FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE\n * COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT,\n * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING,\n * BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;\n * LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER\n * CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT\n * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN\n * ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE\n * POSSIBILITY OF SUCH DAMAGE.\n *\n * $Id$\n *\n *\/\n#ifndef PCL_REGISTRATION_IMPL_CORRESPONDENCE_ESTIMATION_H_\n#define PCL_REGISTRATION_IMPL_CORRESPONDENCE_ESTIMATION_H_\n\n#include <pcl\/common\/concatenate.h>\n#include <pcl\/registration\/correspondence_estimation.h>\n#include <pcl\/common\/io.h>\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\ntemplate <typename PointSource, typename PointTarget> void\npcl::registration::CorrespondenceEstimationBase<PointSource, PointTarget>::setInputTarget (\n const PointCloudTargetConstPtr &cloud)\n{\n if (cloud->points.empty ())\n {\n PCL_ERROR (\"[pcl::%s::setInputTarget] Invalid or empty point cloud dataset given!\\n\", getClassName ().c_str ());\n return;\n }\n target_ = cloud;\n\n \/\/ Set the internal point representation of choice\n if (point_representation_)\n tree_->setPointRepresentation (point_representation_);\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\ntemplate <typename PointSource, typename PointTarget> bool\npcl::registration::CorrespondenceEstimationBase<PointSource, PointTarget>::initCompute ()\n{\n if (!target_)\n {\n PCL_ERROR (\"[pcl::%s::compute] No input target dataset was given!\\n\", getClassName ().c_str ());\n return (false);\n }\n\n \/\/ If the target indices have been given via setIndicesTarget\n if (target_indices_)\n tree_->setInputCloud (target_, target_indices_);\n else\n tree_->setInputCloud (target_);\n\n return (PCLBase<PointSource>::initCompute ());\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\ntemplate <typename PointSource, typename PointTarget> void\npcl::registration::CorrespondenceEstimation<PointSource, PointTarget>::determineCorrespondences (\n pcl::Correspondences &correspondences, double max_distance)\n{\n if (!initCompute ())\n return;\n\n double max_dist_sqr = max_distance * max_distance;\n\n typedef typename pcl::traits::fieldList<PointTarget>::type FieldListTarget;\n correspondences.resize (indices_->size ());\n\n std::vector<int> index (1);\n std::vector<float> distance (1);\n pcl::Correspondence corr;\n unsigned int nr_valid_correspondences = 0;\n \n \/\/ Check if the template types are the same. If true, avoid a copy.\n \/\/ Both point types MUST be registered using the POINT_CLOUD_REGISTER_POINT_STRUCT macro!\n if (isSamePointType<PointSource, PointTarget> ())\n {\n \/\/ Iterate over the input set of source indices\n for (std::vector<int>::const_iterator idx = indices_->begin (); idx != indices_->end (); ++idx)\n {\n tree_->nearestKSearch (input_->points[*idx], 1, index, distance);\n if (distance[0] > max_dist_sqr)\n continue;\n\n corr.index_query = *idx;\n corr.index_match = index[0];\n corr.distance = distance[0];\n correspondences[nr_valid_correspondences++] = corr;\n }\n }\n else\n {\n PointTarget pt;\n \n \/\/ Iterate over the input set of source indices\n for (std::vector<int>::const_iterator idx = indices_->begin (); idx != indices_->end (); ++idx)\n {\n \/\/ Copy the source data to a target PointTarget format so we can search in the tree\n pcl::for_each_type <FieldListTarget> (pcl::NdConcatenateFunctor <PointSource, PointTarget> (\n input_->points[*idx], \n pt));\n\n tree_->nearestKSearch (pt, 1, index, distance);\n if (distance[0] > max_dist_sqr)\n continue;\n\n corr.index_query = *idx;\n corr.index_match = index[0];\n corr.distance = distance[0];\n correspondences[nr_valid_correspondences++] = corr;\n }\n }\n correspondences.resize (nr_valid_correspondences);\n deinitCompute ();\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\ntemplate <typename PointSource, typename PointTarget> void\npcl::registration::CorrespondenceEstimation<PointSource, PointTarget>::determineReciprocalCorrespondences (\n pcl::Correspondences &correspondences, double max_distance)\n{\n if (!initCompute ())\n return;\n \n typedef typename pcl::traits::fieldList<PointSource>::type FieldListSource;\n typedef typename pcl::traits::fieldList<PointTarget>::type FieldListTarget;\n typedef typename pcl::intersect<FieldListSource, FieldListTarget>::type FieldList;\n \n \/\/ setup tree for reciprocal search\n pcl::KdTreeFLANN<PointSource> tree_reciprocal;\n \/\/ Set the internal point representation of choice\n if (point_representation_)\n tree_reciprocal.setPointRepresentation (point_representation_);\n\n tree_reciprocal.setInputCloud (input_, indices_);\n\n double max_dist_sqr = max_distance * max_distance;\n\n correspondences.resize (indices_->size());\n std::vector<int> index (1);\n std::vector<float> distance (1);\n std::vector<int> index_reciprocal (1);\n std::vector<float> distance_reciprocal (1);\n pcl::Correspondence corr;\n unsigned int nr_valid_correspondences = 0;\n int target_idx = 0;\n\n \/\/ Check if the template types are the same. If true, avoid a copy.\n \/\/ Both point types MUST be registered using the POINT_CLOUD_REGISTER_POINT_STRUCT macro!\n if (isSamePointType<PointSource, PointTarget> ())\n {\n \/\/ Iterate over the input set of source indices\n for (std::vector<int>::const_iterator idx = indices_->begin (); idx != indices_->end (); ++idx)\n {\n tree_->nearestKSearch (input_->points[*idx], 1, index, distance);\n if (distance[0] > max_dist_sqr)\n continue;\n\n target_idx = index[0];\n\n tree_reciprocal.nearestKSearch (target_->points[target_idx], 1, index_reciprocal, distance_reciprocal);\n if (distance_reciprocal[0] > max_dist_sqr || *idx != index_reciprocal[0])\n continue;\n\n corr.index_query = *idx;\n corr.index_match = index[0];\n corr.distance = distance[0];\n correspondences[nr_valid_correspondences++] = corr;\n }\n }\n else\n {\n PointTarget pt_src;\n PointSource pt_tgt;\n \n \/\/ Iterate over the input set of source indices\n for (std::vector<int>::const_iterator idx = indices_->begin (); idx != indices_->end (); ++idx)\n {\n \/\/ Copy the source data to a target PointTarget format so we can search in the tree\n pcl::for_each_type <FieldList> (pcl::NdConcatenateFunctor <PointSource, PointTarget> (\n input_->points[*idx], \n pt_src));\n\n tree_->nearestKSearch (pt_src, 1, index, distance);\n if (distance[0] > max_dist_sqr)\n continue;\n\n target_idx = index[0];\n\n \/\/ Copy the target data to a target PointSource format so we can search in the tree_reciprocal\n pcl::for_each_type<FieldList> (pcl::NdConcatenateFunctor <PointTarget, PointSource> (\n target_->points[target_idx],\n pt_tgt));\n\n tree_reciprocal.nearestKSearch (pt_tgt, 1, index_reciprocal, distance_reciprocal);\n if (distance_reciprocal[0] > max_dist_sqr || *idx != index_reciprocal[0])\n continue;\n\n corr.index_query = *idx;\n corr.index_match = index[0];\n corr.distance = distance[0];\n correspondences[nr_valid_correspondences++] = corr;\n }\n }\n correspondences.resize (nr_valid_correspondences);\n deinitCompute ();\n}\n\n\/\/#define PCL_INSTANTIATE_CorrespondenceEstimation(T,U) template class PCL_EXPORTS pcl::registration::CorrespondenceEstimation<T,U>;\n\n#endif \/* PCL_REGISTRATION_IMPL_CORRESPONDENCE_ESTIMATION_H_ *\/\n<|endoftext|>"} {"text":"<commit_before>\/** Manages the event handling functions in the superloop\n *\n * StageManager.cpp\n * Created 1-28-18 By: Smitty\n *\n * A longer description.\n *\/\n\n#include \"StageManager.hpp\"\n\n\n\n\/** \n * @brief StageManager constructor\n *\/\nStageManager::StageManager(void)\n{\n timerList = new Timer[TIMER_NUM];\n timerList[0].limit = LED_1_POLL;\n timerList[1].limit = LED_2_POLL;\n \/\/ timerList[2].limit = LED_3_POLL;\n \/\/ timerList[3].limit = LED_4_POLL;\n\n \/\/initializing the variables in the Timer array\n for(int i = 0; i < TIMER_NUM; i++) \n {\n \/\/creating the individual mask for each timer\n timerList[i].TFmask = 1 << i;\n timerList[i].count = 0;\n }\n}\n\n\n\/** \n * @brief Handles the multiple timers running off of a single 1ms timer from main\n * @note Might have to be fleshed out more\n * @retval uint32_t with each bit coresponding to which timers went off\n *\/\nuint32_t StageManager::processTimers(Stage currentStage)\n{\n \/\/Goes through the array of timers to increment their count and store which ones popped\n for (int i = 0; i < TIMER_NUM; i++)\n {\n timerList[i].count++;\n if(timerList[i].count >= timerList[i].limit)\n {\n \/\/store which timer popped\n timerTF |= timerList[i].TFmask;\n\n \/\/resetting the count of the timer that just popped\n timerList[i].count = 0;\n }\n\n }\n\n return timerTF;\n}\n\n\n\/** \n * @brief \n * @note \n * @retval \n *\/\nuint32_t StageManager::processCan(Stage currentStage)\n{\n \/\/do CAN stuff\n return 0;\n}\n\n\n\/** \n * @brief \n * @note \n * @retval \n *\/\nuint32_t StageManager::processCooling(Stage currentStage)\n{\n \/\/do Cooling stuff\n return 0;\n}\n\n\/** \n * @brief \n * @note \n * @retval \n *\/\nuint32_t StageManager::processDash(Stage currentStage)\n{\n \/\/do Dash processing\n\n return 0;\n}\n\n\n\/** \n * @brief \n * @note \n * @retval \n *\/\nuint32_t StageManager::processGlcd(Stage currentStage)\n{\n \/\/glcd view display updating\n\n return 0;\n}\n\n\n\/** \n * @brief \n * @note \n * @retval \n *\/\nuint32_t StageManager::processImd(Stage currentStage)\n{ \n return 0;\n}\n\n\/** \n * @brief \n * @note \n * @retval \n *\/\nuint32_t StageManager::processOrion(Stage currentStage)\n{\n return 0;\n}\n\n\n\/** \n * @brief \n * @note \n * @retval \n *\/\nuint32_t StageManager::processPedal(Stage currentStage)\n{\n return 0;\n}\n\n\n\/** \n * @brief \n * @note \n * @retval \n *\/\nuint32_t StageManager::processSdCard(Stage currentStage)\n{\n return 0;\n}\n\n\/** \n * @brief \n * @note \n * @retval \n *\/\nuint32_t StageManager::processUnitek(Stage currentStage)\n{\n return 0;\n}\n\n\n\/** \n * @brief \n * @note \n * @retval \n *\/\nuint32_t StageManager::processBatlog(Stage currentStage)\n{\n return 0;\n}\n\n\n\/** \n * @brief \n * @note \n * @retval \n *\/\nuint32_t StageManager::processPrecharge(Stage currentStage)\n{\n return 0;\n}\n\n\n\/** \n * @brief \n * @note \n * @retval \n *\/\nuint32_t StageManager::processReadyToDrive(Stage currentStage)\n{\n return 0;\n}\n\n\/** \n * @brief \n * @note \n * @retval \n *\/\nuint32_t StageManager::processLaunch(Stage currentStage)\n{\n return 0;\n}\n\n\n\/** \n * @brief \n * @note \n * @retval \n *\/\nuint32_t StageManager::processShutdown(Stage currentStage)\n{\n return 0;\n}\n\n\n\/** \n * @brief \n * @note Entry condition: EVOS finishes subsystem testing\n * Exit condition: Driver requests Precharging\n * @param &localEventFlags: \n * @param urgencyLevel: \n * @retval \n *\/\nStageManager::Stage StageManager::processEventsStandby(uint32_t &localEventFlags, Priority urgencyLevel)\n{\n Stage currentStage = Stage::STAGE_STANDBY;\n\n switch(urgencyLevel)\n {\n case PRIORITY_CRITICAL:\n\n if(localEventFlags && EF_SHUTDOWN)\n {\n processShutdown(currentStage);\n \n \/\/clearing the EF so we don't trigger this again\n localEventFlags &= ~EF_SHUTDOWN;\n }\n\n\n if(localEventFlags && EF_IMD)\n {\n processImd(currentStage);\n \n \/\/clearing the EF so we don't trigger this again\n localEventFlags &= ~EF_IMD;\n }\n\n break;\n\n \n case PRIORITY_HIGH:\n \n if(localEventFlags && EF_CAN)\n {\n processCan(currentStage); \n \n \/\/clearing the EF so we don't trigger this again\n localEventFlags &= ~EF_CAN;\n }\n\n\n if(localEventFlags && EF_UNITEK)\n {\n processUnitek(currentStage);\n \n \/\/clearing the EF so we don't trigger this again\n localEventFlags &= ~EF_UNITEK;\n }\n\n\n if(localEventFlags && EF_ORION)\n {\n processOrion(currentStage);\n \n \/\/clearing the EF so we don't trigger this again\n localEventFlags &= ~EF_ORION;\n }\n \n break;\n\n\n case PRIORITY_MEDIUM:\n\n if(localEventFlags && EF_COOLING)\n {\n processCooling(currentStage);\n \n \/\/clearing the EF so we don't trigger this again\n localEventFlags &= ~EF_COOLING;\n }\n\n\n if(localEventFlags && EF_BATLOG)\n {\n processBatlog(currentStage);\n \n \/\/clearing the EF so we don't trigger this again\n localEventFlags &= ~EF_BATLOG;\n }\n\n\n if(localEventFlags && EF_DASH)\n {\n processDash(currentStage);\n \n \/\/clearing the EF so we don't trigger this again\n localEventFlags &= ~EF_DASH;\n }\n\n break;\n\n\n case PRIORITY_LOW:\n\n if(localEventFlags && EF_GLCD)\n {\n processGlcd(currentStage);\n \n \/\/clearing the EF so we don't trigger this again\n localEventFlags &= ~EF_GLCD;\n }\n\n\n if(localEventFlags && EF_SDCARD)\n {\n processSdCard(currentStage);\n \n \/\/clearing the EF so we don't trigger this again\n localEventFlags &= ~EF_SDCARD;\n }\n\n break;\n\n } \/\/End switch\n\n return currentStage;\n}\n\n\n\/** \n * @brief \n * @note Entry condition: Driver requests Precharging\n * Exit condition: Precharge done signal recieved from Unitek\n * @param &localEventFlags: \n * @param urgencyLevel: \n * @retval \n *\/\nStageManager::Stage StageManager::processEventsPrecharge(uint32_t &localEventFlags, Priority urgencyLevel)\n{\n Stage currentStage = Stage::STAGE_PRECHARGE;\n\n switch(urgencyLevel)\n {\n case PRIORITY_CRITICAL:\n \/\/code here\n if(localEventFlags && EF_SHUTDOWN)\n {\n processShutdown(currentStage);\n \n \/\/clearing the EF so we don't trigger this again\n localEventFlags &= ~EF_SHUTDOWN;\n }\n\n\n if(localEventFlags && EF_IMD)\n {\n processImd(currentStage);\n \n \/\/clearing the EF so we don't trigger this again\n localEventFlags &= ~EF_IMD;\n }\n\n break;\n\n \n case PRIORITY_HIGH:\n \/\/code here\n if(localEventFlags && EF_CAN)\n {\n processCan(currentStage); \n \n \/\/clearing the EF so we don't trigger this again\n localEventFlags &= ~EF_CAN;\n }\n\n\n if(localEventFlags && EF_UNITEK)\n {\n processUnitek(currentStage);\n \n \/\/clearing the EF so we don't trigger this again\n localEventFlags &= ~EF_UNITEK;\n }\n\n\n if(localEventFlags && EF_ORION)\n {\n processOrion(currentStage);\n \n \/\/clearing the EF so we don't trigger this again\n localEventFlags &= ~EF_ORION;\n }\n \n break;\n\n\n case PRIORITY_MEDIUM:\n \/\/code here\n\n if(localEventFlags && EF_COOLING)\n {\n processCooling(currentStage);\n \n \/\/clearing the EF so we don't trigger this again\n localEventFlags &= ~EF_COOLING;\n }\n\n\n if(localEventFlags && EF_BATLOG)\n {\n processBatlog(currentStage);\n \n \/\/clearing the EF so we don't trigger this again\n localEventFlags &= ~EF_BATLOG;\n }\n\n\n if(localEventFlags && EF_DASH)\n {\n processDash(currentStage);\n \n \/\/clearing the EF so we don't trigger this again\n localEventFlags &= ~EF_DASH;\n }\n\n break;\n\n\n case PRIORITY_LOW:\n \/\/code here\n if(localEventFlags && EF_SDCARD)\n {\n processSdCard(currentStage);\n \n \/\/clearing the EF so we don't trigger this again\n localEventFlags &= ~EF_SDCARD;\n }\n\n\n if(localEventFlags && EF_GLCD)\n {\n processGlcd(currentStage);\n \n \/\/clearing the EF so we don't trigger this again\n localEventFlags &= ~EF_GLCD;\n }\n\n break;\n\n } \/\/End switch\n\n return currentStage;\n}\n\n\n\/** \n * @brief \n * @note Entry condition: Precharge done signal recieved from Unitek\n * Exit condition: Driver requests ready to drive\n * @param &localEventFlags: \n * @param urgencyLevel: \n * @retval \n *\/\nStageManager::Stage StageManager::processEventsEnergized(uint32_t &localEventFlags, Priority urgencyLevel)\n{\n Stage currentStage = Stage::STAGE_ENERGIZED;\n\n switch(urgencyLevel)\n {\n case PRIORITY_CRITICAL:\n \/\/code here\n if(localEventFlags && EF_SHUTDOWN)\n {\n processShutdown(currentStage);\n \n \/\/clearing the EF so we don't trigger this again\n localEventFlags &= ~EF_SHUTDOWN;\n }\n\n\n if(localEventFlags && EF_IMD)\n {\n processImd(currentStage);\n \n \/\/clearing the EF so we don't trigger this again\n localEventFlags &= ~EF_IMD;\n }\n\n break;\n\n \n case PRIORITY_HIGH:\n \/\/code here\n if(localEventFlags && EF_CAN)\n {\n processCan(currentStage); \n \n \/\/clearing the EF so we don't trigger this again\n localEventFlags &= ~EF_CAN;\n }\n\n\n if(localEventFlags && EF_UNITEK)\n {\n processUnitek(currentStage);\n \n \/\/clearing the EF so we don't trigger this again\n localEventFlags &= ~EF_UNITEK;\n }\n\n\n if(localEventFlags && EF_ORION)\n {\n processOrion(currentStage);\n \n \/\/clearing the EF so we don't trigger this again\n localEventFlags &= ~EF_ORION;\n }\n \n break;\n\n\n case PRIORITY_MEDIUM:\n \/\/code here\n\n if(localEventFlags && EF_COOLING)\n {\n processCooling(currentStage);\n \n \/\/clearing the EF so we don't trigger this again\n localEventFlags &= ~EF_COOLING;\n }\n\n\n if(localEventFlags && EF_BATLOG)\n {\n processBatlog(currentStage);\n \n \/\/clearing the EF so we don't trigger this again\n localEventFlags &= ~EF_BATLOG;\n }\n\n\n if(localEventFlags && EF_DASH)\n {\n processDash(currentStage);\n \n \/\/clearing the EF so we don't trigger this again\n localEventFlags &= ~EF_DASH;\n }\n\n break;\n\n\n case PRIORITY_LOW:\n \/\/code here\n if(localEventFlags && EF_GLCD)\n {\n processGlcd(currentStage);\n \n \/\/clearing the EF so we don't trigger this again\n localEventFlags &= ~EF_GLCD;\n }\n\n\n if(localEventFlags && EF_SDCARD)\n {\n processSdCard(currentStage);\n \n \/\/clearing the EF so we don't trigger this again\n localEventFlags &= ~EF_SDCARD;\n }\n\n break;\n\n } \/\/End switch\n\n return currentStage;\n}\n\n\n\/** \n * @brief \n * @note Entry condition: Driver requests ready to drive\n * Exit condition: Driver requests standby\n * @param &localEventFlags: \n * @param urgencyLevel: \n * @retval \n *\/\nStageManager::Stage StageManager::processEventsDriving(uint32_t &localEventFlags, Priority urgencyLevel)\n{\n Stage currentStage = Stage::STAGE_STANDBY;\n\n switch(urgencyLevel)\n {\n case PRIORITY_CRITICAL:\n \/\/code here\n if(localEventFlags && EF_SHUTDOWN)\n {\n processShutdown(currentStage);\n \n \/\/clearing the EF so we don't trigger this again\n localEventFlags &= ~EF_SHUTDOWN;\n }\n\n\n if(localEventFlags && EF_IMD)\n {\n processImd(currentStage);\n \n \/\/clearing the EF so we don't trigger this again\n localEventFlags &= ~EF_IMD;\n }\n\n break;\n\n \n case PRIORITY_HIGH:\n \/\/code here\n if(localEventFlags && EF_CAN)\n {\n processCan(currentStage); \n \n \/\/clearing the EF so we don't trigger this again\n localEventFlags &= ~EF_CAN;\n }\n\n\n if(localEventFlags && EF_UNITEK)\n {\n processUnitek(currentStage);\n \n \/\/clearing the EF so we don't trigger this again\n localEventFlags &= ~EF_UNITEK;\n }\n\n\n if(localEventFlags && EF_ORION)\n {\n processOrion(currentStage);\n \n \/\/clearing the EF so we don't trigger this again\n localEventFlags &= ~EF_ORION;\n }\n \n break;\n\n\n case PRIORITY_MEDIUM:\n \/\/code here\n\n if(localEventFlags && EF_COOLING)\n {\n processCooling(currentStage);\n \n \/\/clearing the EF so we don't trigger this again\n localEventFlags &= ~EF_COOLING;\n }\n\n\n if(localEventFlags && EF_BATLOG)\n {\n processBatlog(currentStage);\n \n \/\/clearing the EF so we don't trigger this again\n localEventFlags &= ~EF_BATLOG;\n }\n\n\n if(localEventFlags && EF_DASH)\n {\n processDash(currentStage);\n \n \/\/clearing the EF so we don't trigger this again\n localEventFlags &= ~EF_DASH;\n }\n\n break;\n\n\n case PRIORITY_LOW:\n \/\/code here\n if(localEventFlags && EF_GLCD)\n {\n processGlcd(currentStage);\n \n \/\/clearing the EF so we don't trigger this again\n localEventFlags &= ~EF_GLCD;\n }\n\n\n if(localEventFlags && EF_SDCARD)\n {\n processSdCard(currentStage);\n \n \/\/clearing the EF so we don't trigger this again\n localEventFlags &= ~EF_SDCARD;\n }\n\n break;\n\n } \/\/End switch\n\n return currentStage;\n}<commit_msg>#40 changing the variable names because I forgot to<commit_after>\/** Manages the event handling functions in the superloop\n *\n * StageManager.cpp\n * Created 1-28-18 By: Smitty\n *\n * A longer description.\n *\/\n\n#include \"StageManager.hpp\"\n\n\n\n\/** \n * @brief StageManager constructor\n *\/\nStageManager::StageManager(void)\n{\n timerList = new Timer[TIMER_NUM];\n timerList[0].limit = LED_1_POLL;\n timerList[1].limit = LED_2_POLL;\n \/\/ timerList[2].limit = LED_3_POLL;\n \/\/ timerList[3].limit = LED_4_POLL;\n\n \/\/initializing the variables in the Timer array\n for(int i = 0; i < TIMER_NUM; i++) \n {\n \/\/creating the individual mask for each timer\n timerList[i].TFmask = 1 << i;\n timerList[i].count = 0;\n }\n}\n\n\n\/** \n * @brief Handles the multiple timers running off of a single 1ms timer from main\n * @note Might have to be fleshed out more\n * @retval uint32_t with each bit coresponding to which timers went off\n *\/\nuint32_t StageManager::processTimers(Stage currentStage)\n{\n \/\/Goes through the array of timers to increment their count and store which ones popped\n for (int i = 0; i < TIMER_NUM; i++)\n {\n timerList[i].count++;\n if(timerList[i].count >= timerList[i].limit)\n {\n \/\/store which timer popped\n timerTF |= timerList[i].TFmask;\n\n \/\/resetting the count of the timer that just popped\n timerList[i].count = 0;\n }\n\n }\n\n return timerTF;\n}\n\n\n\/** \n * @brief \n * @note \n * @retval \n *\/\nuint32_t StageManager::processCan(Stage currentStage)\n{\n \/\/do CAN stuff\n return 0;\n}\n\n\n\/** \n * @brief \n * @note \n * @retval \n *\/\nuint32_t StageManager::processCooling(Stage currentStage)\n{\n \/\/do Cooling stuff\n return 0;\n}\n\n\/** \n * @brief \n * @note \n * @retval \n *\/\nuint32_t StageManager::processDash(Stage currentStage)\n{\n \/\/do Dash processing\n\n return 0;\n}\n\n\n\/** \n * @brief \n * @note \n * @retval \n *\/\nuint32_t StageManager::processGlcd(Stage currentStage)\n{\n \/\/glcd view display updating\n\n return 0;\n}\n\n\n\/** \n * @brief \n * @note \n * @retval \n *\/\nuint32_t StageManager::processImd(Stage currentStage)\n{ \n return 0;\n}\n\n\/** \n * @brief \n * @note \n * @retval \n *\/\nuint32_t StageManager::processOrion(Stage currentStage)\n{\n return 0;\n}\n\n\n\/** \n * @brief \n * @note \n * @retval \n *\/\nuint32_t StageManager::processPedal(Stage currentStage)\n{\n return 0;\n}\n\n\n\/** \n * @brief \n * @note \n * @retval \n *\/\nuint32_t StageManager::processSdCard(Stage currentStage)\n{\n return 0;\n}\n\n\/** \n * @brief \n * @note \n * @retval \n *\/\nuint32_t StageManager::processUnitek(Stage currentStage)\n{\n return 0;\n}\n\n\n\/** \n * @brief \n * @note \n * @retval \n *\/\nuint32_t StageManager::processBatlog(Stage currentStage)\n{\n return 0;\n}\n\n\n\/** \n * @brief \n * @note \n * @retval \n *\/\nuint32_t StageManager::processPrecharge(Stage currentStage)\n{\n return 0;\n}\n\n\n\/** \n * @brief \n * @note \n * @retval \n *\/\nuint32_t StageManager::processReadyToDrive(Stage currentStage)\n{\n return 0;\n}\n\n\/** \n * @brief \n * @note \n * @retval \n *\/\nuint32_t StageManager::processLaunch(Stage currentStage)\n{\n return 0;\n}\n\n\n\/** \n * @brief \n * @note \n * @retval \n *\/\nuint32_t StageManager::processShutdown(Stage currentStage)\n{\n return 0;\n}\n\n\n\/** \n * @brief \n * @note Entry condition: EVOS finishes subsystem testing\n * Exit condition: Driver requests Precharging\n * @param &localEventFlags: \n * @param urgencyLevel: \n * @retval \n *\/\nStageManager::Stage StageManager::processEventsStandby(uint32_t &localEventFlags, Priority urgencyLevel)\n{\n Stage currentStage = Stage::STAGE_STANDBY;\n\n switch(urgencyLevel)\n {\n case PRIORITY_CRITICAL:\n\n if(localEventFlags && EF_SHUTDOWN)\n {\n processShutdown(currentStage);\n \n \/\/clearing the EF so we don't trigger this again\n localEventFlags &= ~EF_SHUTDOWN;\n }\n\n\n if(localEventFlags && EF_IMD)\n {\n processImd(currentStage);\n \n \/\/clearing the EF so we don't trigger this again\n localEventFlags &= ~EF_IMD;\n }\n\n break;\n\n \n case PRIORITY_HIGH:\n \n if(localEventFlags && EF_CAN)\n {\n processCan(currentStage); \n \n \/\/clearing the EF so we don't trigger this again\n localEventFlags &= ~EF_CAN;\n }\n\n\n if(localEventFlags && EF_UNITEK)\n {\n processUnitek(currentStage);\n \n \/\/clearing the EF so we don't trigger this again\n localEventFlags &= ~EF_UNITEK;\n }\n\n\n if(localEventFlags && EF_ORION)\n {\n processOrion(currentStage);\n \n \/\/clearing the EF so we don't trigger this again\n localEventFlags &= ~EF_ORION;\n }\n \n break;\n\n\n case PRIORITY_MEDIUM:\n\n if(localEventFlags && EF_COOLING)\n {\n processCooling(currentStage);\n \n \/\/clearing the EF so we don't trigger this again\n localEventFlags &= ~EF_COOLING;\n }\n\n\n if(localEventFlags && EF_BATLOG)\n {\n processBatlog(currentStage);\n \n \/\/clearing the EF so we don't trigger this again\n localEventFlags &= ~EF_BATLOG;\n }\n\n\n if(localEventFlags && EF_DASH)\n {\n processDash(currentStage);\n \n \/\/clearing the EF so we don't trigger this again\n localEventFlags &= ~EF_DASH;\n }\n\n break;\n\n\n case PRIORITY_LOW:\n\n if(localEventFlags && TF_GLCD)\n {\n processGlcd(currentStage);\n \n \/\/clearing the EF so we don't trigger this again\n localEventFlags &= ~TF_GLCD;\n }\n\n\n if(localEventFlags && TF_SDCARD)\n {\n processSdCard(currentStage);\n \n \/\/clearing the EF so we don't trigger this again\n localEventFlags &= ~TF_SDCARD;\n }\n\n break;\n\n } \/\/End switch\n\n return currentStage;\n}\n\n\n\/** \n * @brief \n * @note Entry condition: Driver requests Precharging\n * Exit condition: Precharge done signal recieved from Unitek\n * @param &localEventFlags: \n * @param urgencyLevel: \n * @retval \n *\/\nStageManager::Stage StageManager::processEventsPrecharge(uint32_t &localEventFlags, Priority urgencyLevel)\n{\n Stage currentStage = Stage::STAGE_PRECHARGE;\n\n switch(urgencyLevel)\n {\n case PRIORITY_CRITICAL:\n \/\/code here\n if(localEventFlags && EF_SHUTDOWN)\n {\n processShutdown(currentStage);\n \n \/\/clearing the EF so we don't trigger this again\n localEventFlags &= ~EF_SHUTDOWN;\n }\n\n\n if(localEventFlags && EF_IMD)\n {\n processImd(currentStage);\n \n \/\/clearing the EF so we don't trigger this again\n localEventFlags &= ~EF_IMD;\n }\n\n break;\n\n \n case PRIORITY_HIGH:\n \/\/code here\n if(localEventFlags && EF_CAN)\n {\n processCan(currentStage); \n \n \/\/clearing the EF so we don't trigger this again\n localEventFlags &= ~EF_CAN;\n }\n\n\n if(localEventFlags && EF_UNITEK)\n {\n processUnitek(currentStage);\n \n \/\/clearing the EF so we don't trigger this again\n localEventFlags &= ~EF_UNITEK;\n }\n\n\n if(localEventFlags && EF_ORION)\n {\n processOrion(currentStage);\n \n \/\/clearing the EF so we don't trigger this again\n localEventFlags &= ~EF_ORION;\n }\n \n break;\n\n\n case PRIORITY_MEDIUM:\n \/\/code here\n\n if(localEventFlags && EF_COOLING)\n {\n processCooling(currentStage);\n \n \/\/clearing the EF so we don't trigger this again\n localEventFlags &= ~EF_COOLING;\n }\n\n\n if(localEventFlags && EF_BATLOG)\n {\n processBatlog(currentStage);\n \n \/\/clearing the EF so we don't trigger this again\n localEventFlags &= ~EF_BATLOG;\n }\n\n\n if(localEventFlags && EF_DASH)\n {\n processDash(currentStage);\n \n \/\/clearing the EF so we don't trigger this again\n localEventFlags &= ~EF_DASH;\n }\n\n break;\n\n\n case PRIORITY_LOW:\n \/\/code here\n if(localEventFlags && TF_SDCARD)\n {\n processSdCard(currentStage);\n \n \/\/clearing the EF so we don't trigger this again\n localEventFlags &= ~TF_SDCARD;\n }\n\n\n if(localEventFlags && TF_GLCD)\n {\n processGlcd(currentStage);\n \n \/\/clearing the EF so we don't trigger this again\n localEventFlags &= ~TF_GLCD;\n }\n\n break;\n\n } \/\/End switch\n\n return currentStage;\n}\n\n\n\/** \n * @brief \n * @note Entry condition: Precharge done signal recieved from Unitek\n * Exit condition: Driver requests ready to drive\n * @param &localEventFlags: \n * @param urgencyLevel: \n * @retval \n *\/\nStageManager::Stage StageManager::processEventsEnergized(uint32_t &localEventFlags, Priority urgencyLevel)\n{\n Stage currentStage = Stage::STAGE_ENERGIZED;\n\n switch(urgencyLevel)\n {\n case PRIORITY_CRITICAL:\n \/\/code here\n if(localEventFlags && EF_SHUTDOWN)\n {\n processShutdown(currentStage);\n \n \/\/clearing the EF so we don't trigger this again\n localEventFlags &= ~EF_SHUTDOWN;\n }\n\n\n if(localEventFlags && EF_IMD)\n {\n processImd(currentStage);\n \n \/\/clearing the EF so we don't trigger this again\n localEventFlags &= ~EF_IMD;\n }\n\n break;\n\n \n case PRIORITY_HIGH:\n \/\/code here\n if(localEventFlags && EF_CAN)\n {\n processCan(currentStage); \n \n \/\/clearing the EF so we don't trigger this again\n localEventFlags &= ~EF_CAN;\n }\n\n\n if(localEventFlags && EF_UNITEK)\n {\n processUnitek(currentStage);\n \n \/\/clearing the EF so we don't trigger this again\n localEventFlags &= ~EF_UNITEK;\n }\n\n\n if(localEventFlags && EF_ORION)\n {\n processOrion(currentStage);\n \n \/\/clearing the EF so we don't trigger this again\n localEventFlags &= ~EF_ORION;\n }\n \n break;\n\n\n case PRIORITY_MEDIUM:\n \/\/code here\n\n if(localEventFlags && EF_COOLING)\n {\n processCooling(currentStage);\n \n \/\/clearing the EF so we don't trigger this again\n localEventFlags &= ~EF_COOLING;\n }\n\n\n if(localEventFlags && EF_BATLOG)\n {\n processBatlog(currentStage);\n \n \/\/clearing the EF so we don't trigger this again\n localEventFlags &= ~EF_BATLOG;\n }\n\n\n if(localEventFlags && EF_DASH)\n {\n processDash(currentStage);\n \n \/\/clearing the EF so we don't trigger this again\n localEventFlags &= ~EF_DASH;\n }\n\n break;\n\n\n case PRIORITY_LOW:\n \/\/code here\n if(localEventFlags && TF_GLCD)\n {\n processGlcd(currentStage);\n \n \/\/clearing the EF so we don't trigger this again\n localEventFlags &= ~TF_GLCD;\n }\n\n\n if(localEventFlags && TF_SDCARD)\n {\n processSdCard(currentStage);\n \n \/\/clearing the EF so we don't trigger this again\n localEventFlags &= ~TF_SDCARD;\n }\n\n break;\n\n } \/\/End switch\n\n return currentStage;\n}\n\n\n\/** \n * @brief \n * @note Entry condition: Driver requests ready to drive\n * Exit condition: Driver requests standby\n * @param &localEventFlags: \n * @param urgencyLevel: \n * @retval \n *\/\nStageManager::Stage StageManager::processEventsDriving(uint32_t &localEventFlags, Priority urgencyLevel)\n{\n Stage currentStage = Stage::STAGE_STANDBY;\n\n switch(urgencyLevel)\n {\n case PRIORITY_CRITICAL:\n \/\/code here\n if(localEventFlags && EF_SHUTDOWN)\n {\n processShutdown(currentStage);\n \n \/\/clearing the EF so we don't trigger this again\n localEventFlags &= ~EF_SHUTDOWN;\n }\n\n\n if(localEventFlags && EF_IMD)\n {\n processImd(currentStage);\n \n \/\/clearing the EF so we don't trigger this again\n localEventFlags &= ~EF_IMD;\n }\n\n break;\n\n \n case PRIORITY_HIGH:\n \/\/code here\n if(localEventFlags && EF_CAN)\n {\n processCan(currentStage); \n \n \/\/clearing the EF so we don't trigger this again\n localEventFlags &= ~EF_CAN;\n }\n\n\n if(localEventFlags && EF_UNITEK)\n {\n processUnitek(currentStage);\n \n \/\/clearing the EF so we don't trigger this again\n localEventFlags &= ~EF_UNITEK;\n }\n\n\n if(localEventFlags && EF_ORION)\n {\n processOrion(currentStage);\n \n \/\/clearing the EF so we don't trigger this again\n localEventFlags &= ~EF_ORION;\n }\n \n break;\n\n\n case PRIORITY_MEDIUM:\n \/\/code here\n\n if(localEventFlags && EF_COOLING)\n {\n processCooling(currentStage);\n \n \/\/clearing the EF so we don't trigger this again\n localEventFlags &= ~EF_COOLING;\n }\n\n\n if(localEventFlags && EF_BATLOG)\n {\n processBatlog(currentStage);\n \n \/\/clearing the EF so we don't trigger this again\n localEventFlags &= ~EF_BATLOG;\n }\n\n\n if(localEventFlags && EF_DASH)\n {\n processDash(currentStage);\n \n \/\/clearing the EF so we don't trigger this again\n localEventFlags &= ~EF_DASH;\n }\n\n break;\n\n\n case PRIORITY_LOW:\n \/\/code here\n if(localEventFlags && TF_GLCD)\n {\n processGlcd(currentStage);\n \n \/\/clearing the EF so we don't trigger this again\n localEventFlags &= ~TF_GLCD;\n }\n\n\n if(localEventFlags && TF_SDCARD)\n {\n processSdCard(currentStage);\n \n \/\/clearing the EF so we don't trigger this again\n localEventFlags &= ~TF_SDCARD;\n }\n\n break;\n\n } \/\/End switch\n\n return currentStage;\n}<|endoftext|>"} {"text":"<commit_before>\n#pragma once\n\n\n#include <QString>\n\n#include <reflectionzeug\/property\/Property.h>\n\n\nnamespace reflectionzeug\n{\n\n\n\/**\n* @brief\n* Property implementation for QString\n*\/\nclass PropertyQString : public reflectionzeug::AbstractValueProperty<QString>, public AbstractStringInterface\n{\npublic:\n \/**\n * @brief\n * Constructor\n *\/\n template <typename... Arguments>\n PropertyQString(Arguments&&... args)\n : reflectionzeug::AbstractValueProperty<QString>(std::forward<Arguments>(args)...)\n {\n }\n\n \/\/ Virtual AbstractProperty interface\n virtual std::string toString() const override \n {\n return this->value().toStdString();\n }\n\n virtual bool fromString(const std::string & string) override\n {\n this->setValue(QString::fromStdString(string));\n return true;\n }\n\n virtual Variant toVariant() const override\n {\n \/\/ Return string\n return Variant(this->value().toStdString());\n }\n\n virtual bool fromVariant(const Variant & value) override\n {\n \/\/ Read from string\n if (value.hasType<std::string>() || value.canConvert<std::string>()) {\n this->setValue(QString::fromStdString(value.value<std::string>()));\n return true;\n }\n\n \/\/ Invalid value\n return false;\n }\n\n virtual void accept(AbstractVisitor * visitor) override\n {\n visitor->callVisitor<PropertyQString>(this);\n visitor->callVisitor<AbstractStringInterface>(this);\n }\n};\n\n\/**\n* @brief\n* Property selector for properties of type QString\n*\/\ntemplate <>\nstruct PropertyTypeSelector<QString>\n{\n using Type = PropertyQString;\n};\n\n\n} \/\/ namespace reflectionzeug\n<commit_msg>Implement property class for QColor<commit_after>\n#pragma once\n\n\n#include <QString>\n#include <QColor>\n\n#include <reflectionzeug\/property\/Property.h>\n\n\nnamespace reflectionzeug\n{\n\n\n\/**\n* @brief\n* Property implementation for QString\n*\/\nclass PropertyQString : public reflectionzeug::AbstractValueProperty<QString>, public AbstractStringInterface\n{\npublic:\n \/**\n * @brief\n * Constructor\n *\/\n template <typename... Arguments>\n PropertyQString(Arguments&&... args)\n : reflectionzeug::AbstractValueProperty<QString>(std::forward<Arguments>(args)...)\n {\n }\n\n \/\/ Virtual AbstractProperty interface\n virtual std::string toString() const override \n {\n return this->value().toStdString();\n }\n\n virtual bool fromString(const std::string & string) override\n {\n this->setValue(QString::fromStdString(string));\n return true;\n }\n\n virtual Variant toVariant() const override\n {\n \/\/ Return string\n return Variant(this->value().toStdString());\n }\n\n virtual bool fromVariant(const Variant & value) override\n {\n \/\/ Read from string\n if (value.hasType<std::string>() || value.canConvert<std::string>()) {\n this->setValue(QString::fromStdString(value.value<std::string>()));\n return true;\n }\n\n \/\/ Invalid value\n return false;\n }\n\n virtual void accept(AbstractVisitor * visitor) override\n {\n visitor->callVisitor<PropertyQString>(this);\n visitor->callVisitor<AbstractStringInterface>(this);\n }\n};\n\n\/**\n* @brief\n* Property implementation for QColor\n*\/\nclass PropertyQColor : public reflectionzeug::AbstractValueProperty<QColor>, public AbstractColorInterface\n{\npublic:\n \/**\n * @brief\n * Constructor\n *\/\n template <typename... Arguments>\n PropertyQColor(Arguments&&... args)\n : reflectionzeug::AbstractValueProperty<QColor>(std::forward<Arguments>(args)...)\n {\n }\n\n \/\/ Virtual AbstractColorInterface interface\n virtual void getRGBA(int & r, int & g, int & b, int & a) const override\n {\n QColor color = this->value();\n r = color.red();\n g = color.green();\n b = color.blue();\n a = color.alpha();\n }\n\n virtual void setRGBA(int r, int g, int b, int a) override\n {\n this->setValue(QColor(r, g, b, a));\n }\n\n virtual int red() const override\n {\n return this->value().red();\n }\n\n virtual void setRed(int red) override\n {\n QColor color = this->value();\n color.setRed(red);\n this->setValue(color);\n }\n\n virtual int green() const override\n {\n return this->value().green();\n }\n\n virtual void setGreen(int green) override\n {\n QColor color = this->value();\n color.setGreen(green);\n this->setValue(color);\n }\n\n virtual int blue() const override\n {\n return this->value().blue();\n }\n\n virtual void setBlue(int blue) override\n {\n QColor color = this->value();\n color.setBlue(blue);\n this->setValue(color);\n }\n\n virtual int alpha() const override\n {\n return this->value().alpha();\n }\n\n virtual void setAlpha(int alpha) override\n {\n QColor color = this->value();\n color.setAlpha(alpha);\n this->setValue(color);\n }\n\n\n \/\/ Virtual AbstractProperty interface\n virtual std::string toString() const override \n {\n \/\/ Return hex representation\n return toHexString();\n }\n\n virtual bool fromString(const std::string & string) override\n {\n \/\/ Read from hex representation\n return fromHexString(string);\n }\n\n virtual Variant toVariant() const override\n {\n \/\/ Return color as variant object\n return toColorVariant();\n }\n\n virtual bool fromVariant(const Variant & value) override\n {\n \/\/ Read from variant of the exact type\n if (value.hasType<QColor>() || value.canConvert<QColor>()) {\n setValue( value.value<QColor>() );\n return true;\n }\n\n \/\/ Read from string or object representation\n else {\n return fromColorVariant(value);\n }\n }\n\n virtual void accept(AbstractVisitor * visitor) override\n {\n visitor->callVisitor<PropertyQColor>(this);\n visitor->callVisitor<AbstractColorInterface>(this);\n }\n};\n\n\/**\n* @brief\n* Property selector for properties of type QString\n*\/\ntemplate <>\nstruct PropertyTypeSelector<QString>\n{\n using Type = PropertyQString;\n};\n\n\/**\n* @brief\n* Property selector for properties of type QColor\n*\/\ntemplate <>\nstruct PropertyTypeSelector<QColor>\n{\n using Type = PropertyQColor;\n};\n\n\n} \/\/ namespace reflectionzeug\n<|endoftext|>"} {"text":"<commit_before>\/* -*- mode: jde; c-basic-offset: 2; indent-tabs-mode: nil -*- *\/\n\n\/*\n Part of the Wiring project - http:\/\/wiring.org.co\n Copyright (c) 2004-06 Hernando Barragan\n Modified 13 August 2006, David A. Mellis for Arduino - http:\/\/www.arduino.cc\/\n \n This library is free software; you can redistribute it and\/or\n modify it under the terms of the GNU Lesser General Public\n License as published by the Free Software Foundation; either\n version 2.1 of the License, or (at your option) any later version.\n\n This library is distributed in the hope that it will be useful,\n but WITHOUT ANY WARRANTY; without even the implied warranty of\n MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. 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 $Id$\n*\/\n\nextern \"C\" {\n #include \"stdlib.h\"\n}\n\nvoid randomSeed(unsigned int seed)\n{\n if(seed != 0){\n srand(seed);\n }\n}\n\nlong random(long howbig)\n{\n long value;\n if (howbig == 0){\n return 0;\n }\n return rand() % howbig;\n}\n\nlong random(long howsmall, long howbig)\n{\n if(howsmall >= howbig){\n return howsmall;\n }\n long diff = howbig - howsmall;\n return random(diff) + howsmall;\n}\n\nlong map(long x, long in_min, long in_max, long out_min, long out_max)\n{\n return (x - in_min) * (out_max - out_min) \/ (in_max - in_min) + out_min;\n}<commit_msg>added newline at the end of file to get rid of compiler and SVN warnings<commit_after>\/* -*- mode: jde; c-basic-offset: 2; indent-tabs-mode: nil -*- *\/\n\n\/*\n Part of the Wiring project - http:\/\/wiring.org.co\n Copyright (c) 2004-06 Hernando Barragan\n Modified 13 August 2006, David A. Mellis for Arduino - http:\/\/www.arduino.cc\/\n \n This library is free software; you can redistribute it and\/or\n modify it under the terms of the GNU Lesser General Public\n License as published by the Free Software Foundation; either\n version 2.1 of the License, or (at your option) any later version.\n\n This library is distributed in the hope that it will be useful,\n but WITHOUT ANY WARRANTY; without even the implied warranty of\n MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. 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 $Id$\n*\/\n\nextern \"C\" {\n #include \"stdlib.h\"\n}\n\nvoid randomSeed(unsigned int seed)\n{\n if(seed != 0){\n srand(seed);\n }\n}\n\nlong random(long howbig)\n{\n long value;\n if (howbig == 0){\n return 0;\n }\n return rand() % howbig;\n}\n\nlong random(long howsmall, long howbig)\n{\n if(howsmall >= howbig){\n return howsmall;\n }\n long diff = howbig - howsmall;\n return random(diff) + howsmall;\n}\n\nlong map(long x, long in_min, long in_max, long out_min, long out_max)\n{\n return (x - in_min) * (out_max - out_min) \/ (in_max - in_min) + out_min;\n}\n<|endoftext|>"} {"text":"<commit_before>#include <utility>\n#include \"api\/halley_api.h\"\n#include <halley\/plugin\/plugin.h>\n#include \"halley\/audio\/audio_facade.h\"\n#include \"halley\/support\/logger.h\"\n#include \"entry\/entry_point.h\"\n\nusing namespace Halley;\n\nvoid HalleyAPI::assign()\n{\n\tExpects(coreInternal != nullptr);\n\tExpects(systemInternal != nullptr);\n\n\tcore = coreInternal;\n\tsystem = systemInternal.get();\n\n\tif (videoInternal) {\n\t\tvideo = videoInternal.get();\n\t}\n\tif (inputInternal) {\n\t\tinput = inputInternal.get();\n\t}\n\tif (audioInternal) {\n\t\taudio = audioInternal.get();\n\t}\n\tif (platformInternal) {\n\t\tplatform = platformInternal.get();\n\t}\n\tif (networkInternal) {\n\t\tnetwork = networkInternal.get();\n\t}\n\tif (movieInternal) {\n\t\tmovie = movieInternal.get();\n\t}\n}\n\nvoid HalleyAPI::init()\n{\n\tif (systemInternal) {\n\t\tsystemInternal->init();\n\t}\n\tif (videoInternal) {\n\t\tvideoInternal->init();\n\t}\n\tif (inputInternal) {\n\t\tinputInternal->init();\n\t}\n\tif (audioOutputInternal) {\n\t\taudioOutputInternal->init();\n\t}\n\tif (audioInternal) {\n\t\taudioInternal->init();\n\t}\n\tif (platformInternal) {\n\t\tplatformInternal->init();\n\t}\n\tif (networkInternal) {\n\t\tnetworkInternal->init();\n\t}\n\tif (movieInternal) {\n\t\tmovieInternal->init();\n\t}\n}\n\nvoid HalleyAPI::deInit()\n{\n\tif (movieInternal) {\n\t\tmovieInternal->deInit();\n\t}\n\tif (networkInternal) {\n\t\tnetworkInternal->deInit();\n\t}\n\tif (platformInternal) {\n\t\tplatformInternal->deInit();\n\t}\n\tif (audioInternal) {\n\t\taudioInternal->deInit();\n\t}\n\tif (audioOutputInternal) {\n\t\taudioOutputInternal->deInit();\n\t}\n\tif (inputInternal) {\n\t\tinputInternal->deInit();\n\t}\n\tif (videoInternal) {\n\t\tvideoInternal->deInit();\n\t}\n\tif (systemInternal) {\n\t\tsystemInternal->deInit();\n\t}\n}\n\nstd::unique_ptr<HalleyAPI> HalleyAPI::create(CoreAPIInternal* core, int flags)\n{\n\tauto api = std::make_unique<HalleyAPI>();\n\tapi->coreInternal = core;\n\n\tHalleyAPIFlags::Flags flagList[] = { HalleyAPIFlags::System, HalleyAPIFlags::Video, HalleyAPIFlags::Input, HalleyAPIFlags::Audio, HalleyAPIFlags::Network, HalleyAPIFlags::Platform, HalleyAPIFlags::Movie };\n\tPluginType pluginTypes[] = { PluginType::SystemAPI, PluginType::GraphicsAPI, PluginType::InputAPI, PluginType::AudioOutputAPI, PluginType::NetworkAPI, PluginType::PlatformAPI, PluginType::MovieAPI };\n\tString names[] = { \"System\", \"Graphics\", \"Input\", \"AudioOutput\", \"Network\", \"Platform\", \"Movie\" };\n\n\tconstexpr size_t n = std::end(flagList) - std::begin(flagList);\n\tfor (size_t i = 0; i < n; ++i) {\n\t\tif (flags & flagList[i] || flagList[i] == HalleyAPIFlags::System) {\n\t\t\tauto plugins = core->getPlugins(pluginTypes[i]);\n\t\t\tif (!plugins.empty()) {\n\t\t\t\tLogger::logInfo(names[i] + \" plugin: \" + plugins[0]->getName());\n\t\t\t\tapi->setAPI(pluginTypes[i], plugins[0]->createAPI(api->systemInternal.get()));\n\t\t\t} else {\n\t\t\t\tthrow Exception(\"No suitable \" + names[i] + \" plugins found.\", HalleyExceptions::Core);\n\t\t\t}\n\t\t}\n\t}\n\n\tapi->assign();\n\treturn api;\n}\n\nvoid HalleyAPI::setAPI(PluginType pluginType, HalleyAPIInternal* api)\n{\n\tswitch (pluginType) {\n\tcase PluginType::SystemAPI:\n\t\tsystemInternal.reset(dynamic_cast<SystemAPIInternal*>(api));\n\t\treturn;\n\tcase PluginType::InputAPI:\n\t\tinputInternal.reset(dynamic_cast<InputAPIInternal*>(api));\n\t\treturn;\n\tcase PluginType::GraphicsAPI:\n\t\tvideoInternal.reset(dynamic_cast<VideoAPIInternal*>(api));\n\t\treturn;\n\tcase PluginType::AudioOutputAPI:\n\t\taudioOutputInternal.reset(dynamic_cast<AudioOutputAPIInternal*>(api));\n\t\taudioInternal = std::make_unique<AudioFacade>(*audioOutputInternal, *systemInternal);\n\t\treturn;\n\tcase PluginType::PlatformAPI:\n\t\tplatformInternal.reset(dynamic_cast<PlatformAPIInternal*>(api));\n\t\treturn;\n\tcase PluginType::NetworkAPI:\n\t\tnetworkInternal.reset(dynamic_cast<NetworkAPIInternal*>(api));\n\t\treturn;\n\tcase PluginType::MovieAPI:\n\t\tmovieInternal.reset(dynamic_cast<MovieAPIInternal*>(api));\n\t\treturn;\n\t}\n}\n\nHalleyAPI& HalleyAPI::operator=(const HalleyAPI& other) = default;\n\nstd::unique_ptr<HalleyAPI> HalleyAPI::clone() const\n{\n\tauto api = std::make_unique<HalleyAPI>();\n\t*api = *this;\n\treturn api;\n}\n\nvoid HalleyAPI::replaceCoreAPI(CoreAPIInternal* coreAPI)\n{\n\tcoreInternal = coreAPI;\n\tcore = coreAPI;\n}\n\nuint32_t Halley::getHalleyDLLAPIVersion()\n{\n\treturn 177;\n}\n<commit_msg>Bump version<commit_after>#include <utility>\n#include \"api\/halley_api.h\"\n#include <halley\/plugin\/plugin.h>\n#include \"halley\/audio\/audio_facade.h\"\n#include \"halley\/support\/logger.h\"\n#include \"entry\/entry_point.h\"\n\nusing namespace Halley;\n\nvoid HalleyAPI::assign()\n{\n\tExpects(coreInternal != nullptr);\n\tExpects(systemInternal != nullptr);\n\n\tcore = coreInternal;\n\tsystem = systemInternal.get();\n\n\tif (videoInternal) {\n\t\tvideo = videoInternal.get();\n\t}\n\tif (inputInternal) {\n\t\tinput = inputInternal.get();\n\t}\n\tif (audioInternal) {\n\t\taudio = audioInternal.get();\n\t}\n\tif (platformInternal) {\n\t\tplatform = platformInternal.get();\n\t}\n\tif (networkInternal) {\n\t\tnetwork = networkInternal.get();\n\t}\n\tif (movieInternal) {\n\t\tmovie = movieInternal.get();\n\t}\n}\n\nvoid HalleyAPI::init()\n{\n\tif (systemInternal) {\n\t\tsystemInternal->init();\n\t}\n\tif (videoInternal) {\n\t\tvideoInternal->init();\n\t}\n\tif (inputInternal) {\n\t\tinputInternal->init();\n\t}\n\tif (audioOutputInternal) {\n\t\taudioOutputInternal->init();\n\t}\n\tif (audioInternal) {\n\t\taudioInternal->init();\n\t}\n\tif (platformInternal) {\n\t\tplatformInternal->init();\n\t}\n\tif (networkInternal) {\n\t\tnetworkInternal->init();\n\t}\n\tif (movieInternal) {\n\t\tmovieInternal->init();\n\t}\n}\n\nvoid HalleyAPI::deInit()\n{\n\tif (movieInternal) {\n\t\tmovieInternal->deInit();\n\t}\n\tif (networkInternal) {\n\t\tnetworkInternal->deInit();\n\t}\n\tif (platformInternal) {\n\t\tplatformInternal->deInit();\n\t}\n\tif (audioInternal) {\n\t\taudioInternal->deInit();\n\t}\n\tif (audioOutputInternal) {\n\t\taudioOutputInternal->deInit();\n\t}\n\tif (inputInternal) {\n\t\tinputInternal->deInit();\n\t}\n\tif (videoInternal) {\n\t\tvideoInternal->deInit();\n\t}\n\tif (systemInternal) {\n\t\tsystemInternal->deInit();\n\t}\n}\n\nstd::unique_ptr<HalleyAPI> HalleyAPI::create(CoreAPIInternal* core, int flags)\n{\n\tauto api = std::make_unique<HalleyAPI>();\n\tapi->coreInternal = core;\n\n\tHalleyAPIFlags::Flags flagList[] = { HalleyAPIFlags::System, HalleyAPIFlags::Video, HalleyAPIFlags::Input, HalleyAPIFlags::Audio, HalleyAPIFlags::Network, HalleyAPIFlags::Platform, HalleyAPIFlags::Movie };\n\tPluginType pluginTypes[] = { PluginType::SystemAPI, PluginType::GraphicsAPI, PluginType::InputAPI, PluginType::AudioOutputAPI, PluginType::NetworkAPI, PluginType::PlatformAPI, PluginType::MovieAPI };\n\tString names[] = { \"System\", \"Graphics\", \"Input\", \"AudioOutput\", \"Network\", \"Platform\", \"Movie\" };\n\n\tconstexpr size_t n = std::end(flagList) - std::begin(flagList);\n\tfor (size_t i = 0; i < n; ++i) {\n\t\tif (flags & flagList[i] || flagList[i] == HalleyAPIFlags::System) {\n\t\t\tauto plugins = core->getPlugins(pluginTypes[i]);\n\t\t\tif (!plugins.empty()) {\n\t\t\t\tLogger::logInfo(names[i] + \" plugin: \" + plugins[0]->getName());\n\t\t\t\tapi->setAPI(pluginTypes[i], plugins[0]->createAPI(api->systemInternal.get()));\n\t\t\t} else {\n\t\t\t\tthrow Exception(\"No suitable \" + names[i] + \" plugins found.\", HalleyExceptions::Core);\n\t\t\t}\n\t\t}\n\t}\n\n\tapi->assign();\n\treturn api;\n}\n\nvoid HalleyAPI::setAPI(PluginType pluginType, HalleyAPIInternal* api)\n{\n\tswitch (pluginType) {\n\tcase PluginType::SystemAPI:\n\t\tsystemInternal.reset(dynamic_cast<SystemAPIInternal*>(api));\n\t\treturn;\n\tcase PluginType::InputAPI:\n\t\tinputInternal.reset(dynamic_cast<InputAPIInternal*>(api));\n\t\treturn;\n\tcase PluginType::GraphicsAPI:\n\t\tvideoInternal.reset(dynamic_cast<VideoAPIInternal*>(api));\n\t\treturn;\n\tcase PluginType::AudioOutputAPI:\n\t\taudioOutputInternal.reset(dynamic_cast<AudioOutputAPIInternal*>(api));\n\t\taudioInternal = std::make_unique<AudioFacade>(*audioOutputInternal, *systemInternal);\n\t\treturn;\n\tcase PluginType::PlatformAPI:\n\t\tplatformInternal.reset(dynamic_cast<PlatformAPIInternal*>(api));\n\t\treturn;\n\tcase PluginType::NetworkAPI:\n\t\tnetworkInternal.reset(dynamic_cast<NetworkAPIInternal*>(api));\n\t\treturn;\n\tcase PluginType::MovieAPI:\n\t\tmovieInternal.reset(dynamic_cast<MovieAPIInternal*>(api));\n\t\treturn;\n\t}\n}\n\nHalleyAPI& HalleyAPI::operator=(const HalleyAPI& other) = default;\n\nstd::unique_ptr<HalleyAPI> HalleyAPI::clone() const\n{\n\tauto api = std::make_unique<HalleyAPI>();\n\t*api = *this;\n\treturn api;\n}\n\nvoid HalleyAPI::replaceCoreAPI(CoreAPIInternal* coreAPI)\n{\n\tcoreInternal = coreAPI;\n\tcore = coreAPI;\n}\n\nuint32_t Halley::getHalleyDLLAPIVersion()\n{\n\treturn 178;\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\/\/ --- ROOT system ---\n#include <TObjString.h>\n#include <TH2F.h>\n#include <TClonesArray.h>\n\n\/\/---- AliRoot system ----\n#include \"AliAnaRandomTrigger.h\"\n#include \"AliCaloTrackParticleCorrelation.h\"\n#include \"AliEMCALGeometry.h\"\n\n\/\/\/ \\cond CLASSIMP\nClassImp(AliAnaRandomTrigger) ;\n\/\/\/ \\endcond\n\n\/\/__________________________________________\n\/\/\/ Default Constructor. Initialize parameters.\n\/\/__________________________________________\nAliAnaRandomTrigger::AliAnaRandomTrigger() :\n AliAnaCaloTrackCorrBaseClass(),\n fTriggerDetector(kEMCAL),\n fTriggerDetectorString(\"EMCAL\"),\n fRandom(0), fNRandom(0),\n fMomentum(),\n fhE(0), fhPt(0),\n fhPhi(0), fhEta(0), \n fhEtaPhi(0) \n{\n InitParameters();\n}\n\n\/\/_________________________________________________________________________\n\/\/\/ Check if there is a dead or bad region in a detector.\n\/\/\/ Only EMCAL for now.\n\/\/_________________________________________________________________________\nBool_t AliAnaRandomTrigger::ExcludeDeadBadRegions(Float_t eta, Float_t phi)\n{\n if ( fTriggerDetector!=kEMCAL || fTriggerDetector!=kDCAL ) return kFALSE;\n \n \/\/-------------------------------------\n \/\/ Get the corresponding cell in EMCAL, check if it exists in acceptance (phi gaps, borders)\n \/\/-------------------------------------\n\n Int_t absId = -1;\n if(!GetEMCALGeometry()->GetAbsCellIdFromEtaPhi(eta,phi, absId)) return kTRUE; \/\/ remove if out of EMCAL acceptance, phi gaps\n \n Int_t icol = -1, irow = -1, iRCU = -1;\n Int_t sm = GetCaloUtils()->GetModuleNumberCellIndexes(absId,kEMCAL, icol, irow, iRCU);\n \n \/\/printf(\"eta %f, phi %f, ieta %d, iphi %d, sm %d\\n\",eta,phi,icol,irow,sm);\n \n \/\/-------------------------------------\n \/\/ Remove in case of close to border, by default always 1 but check what was set in reco utils\n \/\/-------------------------------------\n\n Bool_t okrow = kFALSE;\n\tBool_t okcol = kFALSE;\n Int_t nborder = GetCaloUtils()->GetEMCALRecoUtils()->GetNumberOfCellsFromEMCALBorder();\n if ( nborder < 1 ) nborder = 1;\n \n \/\/ Rows\n if ( sm < 10 )\n {\n if(irow >= nborder && irow < 24-nborder) okrow =kTRUE; \n }\n else\n {\n if((GetCaloUtils()->EMCALGeometryName()).Contains(\"12SM\")) \/\/ 1\/3 SM\n {\n if(irow >= nborder && irow < 8-nborder) okrow =kTRUE; \n }\n else \/\/ 1\/2 SM\n {\n if(irow >= nborder && irow <12-nborder) okrow =kTRUE; \n }\n }\n \n \/\/ Columns\n if ( sm%2==0 )\n {\n if ( icol >= nborder ) okcol = kTRUE;\t\n }\n else \n {\n if ( icol < 48-nborder ) okcol = kTRUE;\t\n }\n \n \/\/printf(\"okcol %d, okrow %d\\n\",okcol,okrow);\n if (!okcol || !okrow) return kTRUE; \n \n \/\/-------------------------------------\n \/\/ Check if the cell or those around are bad\n \/\/-------------------------------------\n\n Int_t status = 0;\n if ( GetCaloUtils()->GetEMCALChannelStatus(sm,icol, irow,status) ) \n return kTRUE ; \/\/ trigger falls into a bad channel\n\n \/\/ Check if close there was a bad channel\n\/\/ for(Int_t i = -1; i <= 1; i++)\n\/\/ {\n\/\/ for(Int_t j = -1; j <= 1; j++)\n\/\/ {\n\/\/ \/\/printf(\"\\t check icol %d, irow %d \\n\",icol+i, irow+j);\n\/\/ if(GetCaloUtils()->GetEMCALChannelStatus(sm,icol+i, irow+j) > 0) return kTRUE ; \/\/ trigger falls into a bad channel\n\/\/ \/\/printf(\"\\t ok\\n\");\n\/\/ }\n\/\/ }\n\n \/\/printf(\"\\t OK\\n\");\n \n return kFALSE;\n}\n\n\/\/__________________________________________________\n\/\/\/ Save parameters used for analysis.\n\/\/__________________________________________________\nTObjString * AliAnaRandomTrigger::GetAnalysisCuts()\n{ \t\n TString parList ; \/\/this will be list of parameters used for this analysis.\n const Int_t buffersize = 255;\n char onePar[buffersize] ;\n \n snprintf(onePar,buffersize,\"--- AliAnaRandomTrigger ---:\") ;\n parList+=onePar ;\t\n snprintf(onePar,buffersize,\"Detector: %s;\" , fTriggerDetectorString.Data()) ;\n parList+=onePar ;\n snprintf(onePar,buffersize,\"N per event = %d;\", fNRandom ) ;\n parList+=onePar ;\n snprintf(onePar,buffersize,\"Min E = %3.2f - Max E = %3.2f;\", GetMinPt(), GetMaxPt()) ;\n parList+=onePar ;\n snprintf(onePar,buffersize,\"Min Eta = %3.2f - Max Eta = %3.2f;\", fEtaCut[0], fEtaCut[1]) ;\n parList+=onePar ;\n snprintf(onePar,buffersize,\"Min Phi = %3.2f - Max Phi = %3.2f;\", fPhiCut[0], fPhiCut[1]) ;\n parList+=onePar ;\n \n return new TObjString(parList) ;\n}\n\n\/\/____________________________________________________\n\/\/\/ Create histograms to be saved in output file and\n\/\/\/ store them in fOutputContainer\n\/\/____________________________________________________\nTList * AliAnaRandomTrigger::GetCreateOutputObjects()\n{\n TList * outputContainer = new TList() ; \n outputContainer->SetName(\"RandomTrigger\") ; \n \n Int_t nptbins = GetHistogramRanges()->GetHistoPtBins(); Int_t nphibins = GetHistogramRanges()->GetHistoPhiBins(); Int_t netabins = GetHistogramRanges()->GetHistoEtaBins();\n Float_t ptmax = GetHistogramRanges()->GetHistoPtMax(); Float_t phimax = GetHistogramRanges()->GetHistoPhiMax(); Float_t etamax = GetHistogramRanges()->GetHistoEtaMax();\n Float_t ptmin = GetHistogramRanges()->GetHistoPtMin(); Float_t phimin = GetHistogramRanges()->GetHistoPhiMin(); Float_t etamin = GetHistogramRanges()->GetHistoEtaMin();\t\n\n fhE = new TH1F (\"hE\",\"Random E distribution\", nptbins,ptmin,ptmax); \n fhE->SetXTitle(\"E (GeV)\");\n outputContainer->Add(fhE);\n \n fhPt = new TH1F (\"hPt\",\"Random p_{T} distribution\", nptbins,ptmin,ptmax); \n fhPt->SetXTitle(\"p_{T} (GeV\/c)\");\n outputContainer->Add(fhPt);\n \n fhPhi = new TH2F (\"hPhi\",\"Random #phi distribution\",\n nptbins,ptmin,ptmax, nphibins,phimin,phimax); \n fhPhi->SetYTitle(\"#phi (rad)\");\n fhPhi->SetXTitle(\"p_{T} (GeV\/c)\");\n outputContainer->Add(fhPhi);\n \n fhEta = new TH2F (\"hEta\",\"Random #eta distribution\",\n nptbins,ptmin,ptmax, netabins,etamin,etamax); \n fhEta->SetYTitle(\"#eta \");\n fhEta->SetXTitle(\"p_{T} (GeV\/c)\");\n outputContainer->Add(fhEta);\n \n fhEtaPhi = new TH2F (\"hEtaPhi\",\"Random #eta vs #phi \",netabins,etamin,etamax, nphibins,phimin,phimax); \n fhEtaPhi->SetXTitle(\"#eta \");\n fhEtaPhi->SetYTitle(\"#phi (rad)\"); \n outputContainer->Add(fhEtaPhi);\n \n return outputContainer;\n}\n\n\/\/________________________________________\n\/\/\/ Initialize the parameters of the analysis.\n\/\/________________________________________\nvoid AliAnaRandomTrigger::InitParameters()\n{ \n SetOutputAODClassName(\"AliCaloTrackParticleCorrelation\");\n SetOutputAODName(\"RandomTrigger\");\n\n AddToHistogramsName(\"AnaRandomTrigger_\");\n \n fNRandom = 1 ;\n fPhiCut[0] = 0. ;\n fPhiCut[1] = TMath::TwoPi() ;\n fEtaCut[0] =-1. ;\n fEtaCut[1] = 1. ;\n}\n\n\/\/_________________________________________________________\n\/\/\/ Print some relevant parameters set for the analysis.\n\/\/_________________________________________________________\nvoid AliAnaRandomTrigger::Print(const Option_t * opt) const\n{\n if(! opt)\n return;\n \n printf(\"**** Print %s %s ****\\n\", GetName(), GetTitle() ) ;\n AliAnaCaloTrackCorrBaseClass::Print(\" \");\t\n\n printf(\"Detector = %s\\n\", fTriggerDetectorString.Data());\n printf(\"Min E = %3.2f - Max E = %3.2f\\n\", GetMinPt(), GetMaxPt());\n printf(\"Min Eta = %3.2f - Max Eta = %3.2f\\n\", fEtaCut[0], fEtaCut[1]);\n printf(\"Min Phi = %3.2f - Max Phi = %3.2f\\n\", fPhiCut[0], fPhiCut[1]);\n} \n\n\/\/______________________________________________\n\/\/\/ Do analysis and fill aods.\n\/\/\/ Generate particle randomly.\n\/\/\/ fNRandom particles per event.\n\/\/______________________________________________\nvoid AliAnaRandomTrigger::MakeAnalysisFillAOD()\n{\n for(Int_t irandom = 0; irandom < fNRandom; irandom++)\n {\n \/\/ Get the random variables of the trigger\n Float_t pt = fRandom.Uniform(GetMinPt(), GetMaxPt());\n Float_t eta = fRandom.Uniform(fEtaCut[0], fEtaCut[1]);\n Float_t phi = fRandom.Uniform(fPhiCut[0], fPhiCut[1]);\n \n \/\/ Check if particle falls into a dead region, if inside, get new\n Bool_t excluded = ExcludeDeadBadRegions(eta,phi);\n \n \/\/ If excluded, generate a new trigger until accepted\n while (excluded)\n {\n pt = fRandom.Uniform(GetMinPt(), GetMaxPt());\n eta = fRandom.Uniform(fEtaCut[0], fEtaCut[1]);\n phi = fRandom.Uniform(fPhiCut[0], fPhiCut[1]);\n \n excluded = ExcludeDeadBadRegions(eta,phi);\n }\n \n \/\/ Create the AOD trigger object\n fMomentum.SetPtEtaPhiM(pt,eta,phi,0);\n \n AliCaloTrackParticle trigger = AliCaloTrackParticle(fMomentum);\n trigger.SetDetectorTag(fTriggerDetector);\n trigger.SetSModNumber(GetModuleNumber(&trigger));\n \n AliDebug(1,Form(\"iRandom %d, Trigger e %2.2f pt %2.2f, phi %2.2f, eta %2.2f, SM %d\",\n irandom, trigger.E(), trigger.Pt(), trigger.Phi(), trigger.Eta(), trigger.GetSModNumber()));\n \n AddAODParticle(trigger);\n }\n \n AliDebug(1,Form(\"Final aod branch entries %d\", GetOutputAODBranch()->GetEntriesFast()));\n} \n\n\/\/_____________________________________________________\n\/\/ Fill control histograms with generated trigger kinematics.\n\/\/_____________________________________________________\nvoid AliAnaRandomTrigger::MakeAnalysisFillHistograms()\n{\n \/\/ Loop on stored AODParticles\n Int_t naod = GetOutputAODBranch()->GetEntriesFast();\n \n AliDebug(1,Form(\"AOD branch entries %d, fNRandom %d\", naod, fNRandom));\n \n for(Int_t iaod = 0; iaod < naod ; iaod++)\n {\n AliCaloTrackParticle* trigger = (AliCaloTrackParticle*) (GetOutputAODBranch()->At(iaod));\n \n fhPt ->Fill(trigger->Pt (), GetEventWeight());\n fhE ->Fill(trigger->E (), GetEventWeight());\n fhPhi ->Fill(trigger->Pt (), trigger->Phi(), GetEventWeight());\n fhEta ->Fill(trigger->Pt (), trigger->Eta(), GetEventWeight());\n fhEtaPhi->Fill(trigger->Eta(), trigger->Phi(), GetEventWeight());\n }\/\/ aod branch loop\n}\n\n\/\/_________________________________________________________\n\/\/\/ Set the detrimeter for the analysis.\n\/\/_________________________________________________________\nvoid AliAnaRandomTrigger::SetTriggerDetector(TString det)\n{\n fTriggerDetectorString = det;\n \n if (det==\"EMCAL\") fTriggerDetector = kEMCAL;\n else if(det==\"PHOS\" ) fTriggerDetector = kPHOS;\n else if(det==\"CTS\") fTriggerDetector = kCTS;\n else if(det==\"DCAL\") fTriggerDetector = kDCAL;\n else if(det.Contains(\"DCAL\") && det.Contains(\"PHOS\")) fTriggerDetector = kDCALPHOS;\n else AliFatal(Form(\"Detector < %s > not known!\", det.Data()));\n}\n\n\/\/______________________________________________________\n\/\/ Set the calorimeter for the analysis.\n\/\/______________________________________________________\nvoid AliAnaRandomTrigger::SetTriggerDetector(Int_t det)\n{\n fTriggerDetector = det;\n \n if ( det == kEMCAL ) fTriggerDetectorString = \"EMCAL\";\n else if( det == kPHOS ) fTriggerDetectorString = \"PHOS\";\n else if( det == kCTS ) fTriggerDetectorString = \"CTS\";\n else if( det == kDCAL ) fTriggerDetectorString = \"DCAL\";\n else if( det == kDCALPHOS) fTriggerDetectorString = \"DCAL_PHOS\";\n else AliFatal(Form(\"Detector < %d > not known!\", det));\n}\n\n\n<commit_msg>fix warning<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\/\/ --- ROOT system ---\n#include <TObjString.h>\n#include <TH2F.h>\n#include <TClonesArray.h>\n\n\/\/---- AliRoot system ----\n#include \"AliAnaRandomTrigger.h\"\n#include \"AliCaloTrackParticleCorrelation.h\"\n#include \"AliEMCALGeometry.h\"\n\n\/\/\/ \\cond CLASSIMP\nClassImp(AliAnaRandomTrigger) ;\n\/\/\/ \\endcond\n\n\/\/__________________________________________\n\/\/\/ Default Constructor. Initialize parameters.\n\/\/__________________________________________\nAliAnaRandomTrigger::AliAnaRandomTrigger() :\n AliAnaCaloTrackCorrBaseClass(),\n fTriggerDetector(kEMCAL),\n fTriggerDetectorString(\"EMCAL\"),\n fRandom(0), fNRandom(0),\n fMomentum(),\n fhE(0), fhPt(0),\n fhPhi(0), fhEta(0), \n fhEtaPhi(0) \n{\n InitParameters();\n}\n\n\/\/_________________________________________________________________________\n\/\/\/ Check if there is a dead or bad region in a detector.\n\/\/\/ Only EMCAL for now.\n\/\/_________________________________________________________________________\nBool_t AliAnaRandomTrigger::ExcludeDeadBadRegions(Float_t eta, Float_t phi)\n{\n if ( fTriggerDetector != kEMCAL && fTriggerDetector != kDCAL ) return kFALSE;\n \n \/\/-------------------------------------\n \/\/ Get the corresponding cell in EMCAL, check if it exists in acceptance (phi gaps, borders)\n \/\/-------------------------------------\n\n Int_t absId = -1;\n if(!GetEMCALGeometry()->GetAbsCellIdFromEtaPhi(eta,phi, absId)) return kTRUE; \/\/ remove if out of EMCAL acceptance, phi gaps\n \n Int_t icol = -1, irow = -1, iRCU = -1;\n Int_t sm = GetCaloUtils()->GetModuleNumberCellIndexes(absId,kEMCAL, icol, irow, iRCU);\n \n \/\/printf(\"eta %f, phi %f, ieta %d, iphi %d, sm %d\\n\",eta,phi,icol,irow,sm);\n \n \/\/-------------------------------------\n \/\/ Remove in case of close to border, by default always 1 but check what was set in reco utils\n \/\/-------------------------------------\n\n Bool_t okrow = kFALSE;\n\tBool_t okcol = kFALSE;\n Int_t nborder = GetCaloUtils()->GetEMCALRecoUtils()->GetNumberOfCellsFromEMCALBorder();\n if ( nborder < 1 ) nborder = 1;\n \n \/\/ Rows\n if ( sm < 10 )\n {\n if(irow >= nborder && irow < 24-nborder) okrow =kTRUE; \n }\n else\n {\n if((GetCaloUtils()->EMCALGeometryName()).Contains(\"12SM\")) \/\/ 1\/3 SM\n {\n if(irow >= nborder && irow < 8-nborder) okrow =kTRUE; \n }\n else \/\/ 1\/2 SM\n {\n if(irow >= nborder && irow <12-nborder) okrow =kTRUE; \n }\n }\n \n \/\/ Columns\n if ( sm%2==0 )\n {\n if ( icol >= nborder ) okcol = kTRUE;\t\n }\n else \n {\n if ( icol < 48-nborder ) okcol = kTRUE;\t\n }\n \n \/\/printf(\"okcol %d, okrow %d\\n\",okcol,okrow);\n if (!okcol || !okrow) return kTRUE; \n \n \/\/-------------------------------------\n \/\/ Check if the cell or those around are bad\n \/\/-------------------------------------\n\n Int_t status = 0;\n if ( GetCaloUtils()->GetEMCALChannelStatus(sm,icol, irow,status) ) \n return kTRUE ; \/\/ trigger falls into a bad channel\n\n \/\/ Check if close there was a bad channel\n\/\/ for(Int_t i = -1; i <= 1; i++)\n\/\/ {\n\/\/ for(Int_t j = -1; j <= 1; j++)\n\/\/ {\n\/\/ \/\/printf(\"\\t check icol %d, irow %d \\n\",icol+i, irow+j);\n\/\/ if(GetCaloUtils()->GetEMCALChannelStatus(sm,icol+i, irow+j) > 0) return kTRUE ; \/\/ trigger falls into a bad channel\n\/\/ \/\/printf(\"\\t ok\\n\");\n\/\/ }\n\/\/ }\n\n \/\/printf(\"\\t OK\\n\");\n \n return kFALSE;\n}\n\n\/\/__________________________________________________\n\/\/\/ Save parameters used for analysis.\n\/\/__________________________________________________\nTObjString * AliAnaRandomTrigger::GetAnalysisCuts()\n{ \t\n TString parList ; \/\/this will be list of parameters used for this analysis.\n const Int_t buffersize = 255;\n char onePar[buffersize] ;\n \n snprintf(onePar,buffersize,\"--- AliAnaRandomTrigger ---:\") ;\n parList+=onePar ;\t\n snprintf(onePar,buffersize,\"Detector: %s;\" , fTriggerDetectorString.Data()) ;\n parList+=onePar ;\n snprintf(onePar,buffersize,\"N per event = %d;\", fNRandom ) ;\n parList+=onePar ;\n snprintf(onePar,buffersize,\"Min E = %3.2f - Max E = %3.2f;\", GetMinPt(), GetMaxPt()) ;\n parList+=onePar ;\n snprintf(onePar,buffersize,\"Min Eta = %3.2f - Max Eta = %3.2f;\", fEtaCut[0], fEtaCut[1]) ;\n parList+=onePar ;\n snprintf(onePar,buffersize,\"Min Phi = %3.2f - Max Phi = %3.2f;\", fPhiCut[0], fPhiCut[1]) ;\n parList+=onePar ;\n \n return new TObjString(parList) ;\n}\n\n\/\/____________________________________________________\n\/\/\/ Create histograms to be saved in output file and\n\/\/\/ store them in fOutputContainer\n\/\/____________________________________________________\nTList * AliAnaRandomTrigger::GetCreateOutputObjects()\n{\n TList * outputContainer = new TList() ; \n outputContainer->SetName(\"RandomTrigger\") ; \n \n Int_t nptbins = GetHistogramRanges()->GetHistoPtBins(); Int_t nphibins = GetHistogramRanges()->GetHistoPhiBins(); Int_t netabins = GetHistogramRanges()->GetHistoEtaBins();\n Float_t ptmax = GetHistogramRanges()->GetHistoPtMax(); Float_t phimax = GetHistogramRanges()->GetHistoPhiMax(); Float_t etamax = GetHistogramRanges()->GetHistoEtaMax();\n Float_t ptmin = GetHistogramRanges()->GetHistoPtMin(); Float_t phimin = GetHistogramRanges()->GetHistoPhiMin(); Float_t etamin = GetHistogramRanges()->GetHistoEtaMin();\t\n\n fhE = new TH1F (\"hE\",\"Random E distribution\", nptbins,ptmin,ptmax); \n fhE->SetXTitle(\"E (GeV)\");\n outputContainer->Add(fhE);\n \n fhPt = new TH1F (\"hPt\",\"Random p_{T} distribution\", nptbins,ptmin,ptmax); \n fhPt->SetXTitle(\"p_{T} (GeV\/c)\");\n outputContainer->Add(fhPt);\n \n fhPhi = new TH2F (\"hPhi\",\"Random #phi distribution\",\n nptbins,ptmin,ptmax, nphibins,phimin,phimax); \n fhPhi->SetYTitle(\"#phi (rad)\");\n fhPhi->SetXTitle(\"p_{T} (GeV\/c)\");\n outputContainer->Add(fhPhi);\n \n fhEta = new TH2F (\"hEta\",\"Random #eta distribution\",\n nptbins,ptmin,ptmax, netabins,etamin,etamax); \n fhEta->SetYTitle(\"#eta \");\n fhEta->SetXTitle(\"p_{T} (GeV\/c)\");\n outputContainer->Add(fhEta);\n \n fhEtaPhi = new TH2F (\"hEtaPhi\",\"Random #eta vs #phi \",netabins,etamin,etamax, nphibins,phimin,phimax); \n fhEtaPhi->SetXTitle(\"#eta \");\n fhEtaPhi->SetYTitle(\"#phi (rad)\"); \n outputContainer->Add(fhEtaPhi);\n \n return outputContainer;\n}\n\n\/\/________________________________________\n\/\/\/ Initialize the parameters of the analysis.\n\/\/________________________________________\nvoid AliAnaRandomTrigger::InitParameters()\n{ \n SetOutputAODClassName(\"AliCaloTrackParticleCorrelation\");\n SetOutputAODName(\"RandomTrigger\");\n\n AddToHistogramsName(\"AnaRandomTrigger_\");\n \n fNRandom = 1 ;\n fPhiCut[0] = 0. ;\n fPhiCut[1] = TMath::TwoPi() ;\n fEtaCut[0] =-1. ;\n fEtaCut[1] = 1. ;\n}\n\n\/\/_________________________________________________________\n\/\/\/ Print some relevant parameters set for the analysis.\n\/\/_________________________________________________________\nvoid AliAnaRandomTrigger::Print(const Option_t * opt) const\n{\n if(! opt)\n return;\n \n printf(\"**** Print %s %s ****\\n\", GetName(), GetTitle() ) ;\n AliAnaCaloTrackCorrBaseClass::Print(\" \");\t\n\n printf(\"Detector = %s\\n\", fTriggerDetectorString.Data());\n printf(\"Min E = %3.2f - Max E = %3.2f\\n\", GetMinPt(), GetMaxPt());\n printf(\"Min Eta = %3.2f - Max Eta = %3.2f\\n\", fEtaCut[0], fEtaCut[1]);\n printf(\"Min Phi = %3.2f - Max Phi = %3.2f\\n\", fPhiCut[0], fPhiCut[1]);\n} \n\n\/\/______________________________________________\n\/\/\/ Do analysis and fill aods.\n\/\/\/ Generate particle randomly.\n\/\/\/ fNRandom particles per event.\n\/\/______________________________________________\nvoid AliAnaRandomTrigger::MakeAnalysisFillAOD()\n{\n for(Int_t irandom = 0; irandom < fNRandom; irandom++)\n {\n \/\/ Get the random variables of the trigger\n Float_t pt = fRandom.Uniform(GetMinPt(), GetMaxPt());\n Float_t eta = fRandom.Uniform(fEtaCut[0], fEtaCut[1]);\n Float_t phi = fRandom.Uniform(fPhiCut[0], fPhiCut[1]);\n \n \/\/ Check if particle falls into a dead region, if inside, get new\n Bool_t excluded = ExcludeDeadBadRegions(eta,phi);\n \n \/\/ If excluded, generate a new trigger until accepted\n while (excluded)\n {\n pt = fRandom.Uniform(GetMinPt(), GetMaxPt());\n eta = fRandom.Uniform(fEtaCut[0], fEtaCut[1]);\n phi = fRandom.Uniform(fPhiCut[0], fPhiCut[1]);\n \n excluded = ExcludeDeadBadRegions(eta,phi);\n }\n \n \/\/ Create the AOD trigger object\n fMomentum.SetPtEtaPhiM(pt,eta,phi,0);\n \n AliCaloTrackParticle trigger = AliCaloTrackParticle(fMomentum);\n trigger.SetDetectorTag(fTriggerDetector);\n trigger.SetSModNumber(GetModuleNumber(&trigger));\n \n AliDebug(1,Form(\"iRandom %d, Trigger e %2.2f pt %2.2f, phi %2.2f, eta %2.2f, SM %d\",\n irandom, trigger.E(), trigger.Pt(), trigger.Phi(), trigger.Eta(), trigger.GetSModNumber()));\n \n AddAODParticle(trigger);\n }\n \n AliDebug(1,Form(\"Final aod branch entries %d\", GetOutputAODBranch()->GetEntriesFast()));\n} \n\n\/\/_____________________________________________________\n\/\/ Fill control histograms with generated trigger kinematics.\n\/\/_____________________________________________________\nvoid AliAnaRandomTrigger::MakeAnalysisFillHistograms()\n{\n \/\/ Loop on stored AODParticles\n Int_t naod = GetOutputAODBranch()->GetEntriesFast();\n \n AliDebug(1,Form(\"AOD branch entries %d, fNRandom %d\", naod, fNRandom));\n \n for(Int_t iaod = 0; iaod < naod ; iaod++)\n {\n AliCaloTrackParticle* trigger = (AliCaloTrackParticle*) (GetOutputAODBranch()->At(iaod));\n \n fhPt ->Fill(trigger->Pt (), GetEventWeight());\n fhE ->Fill(trigger->E (), GetEventWeight());\n fhPhi ->Fill(trigger->Pt (), trigger->Phi(), GetEventWeight());\n fhEta ->Fill(trigger->Pt (), trigger->Eta(), GetEventWeight());\n fhEtaPhi->Fill(trigger->Eta(), trigger->Phi(), GetEventWeight());\n }\/\/ aod branch loop\n}\n\n\/\/_________________________________________________________\n\/\/\/ Set the detrimeter for the analysis.\n\/\/_________________________________________________________\nvoid AliAnaRandomTrigger::SetTriggerDetector(TString det)\n{\n fTriggerDetectorString = det;\n \n if (det==\"EMCAL\") fTriggerDetector = kEMCAL;\n else if(det==\"PHOS\" ) fTriggerDetector = kPHOS;\n else if(det==\"CTS\") fTriggerDetector = kCTS;\n else if(det==\"DCAL\") fTriggerDetector = kDCAL;\n else if(det.Contains(\"DCAL\") && det.Contains(\"PHOS\")) fTriggerDetector = kDCALPHOS;\n else AliFatal(Form(\"Detector < %s > not known!\", det.Data()));\n}\n\n\/\/______________________________________________________\n\/\/ Set the calorimeter for the analysis.\n\/\/______________________________________________________\nvoid AliAnaRandomTrigger::SetTriggerDetector(Int_t det)\n{\n fTriggerDetector = det;\n \n if ( det == kEMCAL ) fTriggerDetectorString = \"EMCAL\";\n else if( det == kPHOS ) fTriggerDetectorString = \"PHOS\";\n else if( det == kCTS ) fTriggerDetectorString = \"CTS\";\n else if( det == kDCAL ) fTriggerDetectorString = \"DCAL\";\n else if( det == kDCALPHOS) fTriggerDetectorString = \"DCAL_PHOS\";\n else AliFatal(Form(\"Detector < %d > not known!\", det));\n}\n\n\n<|endoftext|>"} {"text":"<commit_before>#include <gtest\/gtest.h>\n\n#include \"sprint.hh\"\n\nTEST(_fmt, int) {\n\tint a = 2;\n\tASSERT_STREQ(\"%d\", _fmt(a));\n}\n\nTEST(_fmt, uint64_t) {\n\tuint64_t a = 4294967295;\n\tASSERT_STREQ(\"%lu\", _fmt(a));\n}\n\nTEST(_fmt, int64_t) {\n\tint64_t a = 4294967295;\n\tASSERT_STREQ(\"%ld\", _fmt(a));\n}\n\nTEST(_fmt, double) {\n\tdouble a = 3.14159;\n\tASSERT_STREQ(\"%lf\", _fmt(a));\n}\n\nTEST(_sfmt, 3ints) {\n\tchar buffer[100];\n\tmemset(buffer, 0, 100);\n\tint t = _sfmt(buffer, 0, false, 2, 2.1, 'a');\n\tASSERT_STREQ(\"%d %lf %c\", buffer);\n\tASSERT_EQ(9, t);\n}\n\nTEST(_sfmt, newline) {\n\tchar buffer[100];\n\tmemset(buffer, 0, 100);\n\tint t = _sfmt(buffer, 0, true, 2, 2.1, 'a');\n\tASSERT_STREQ(\"%d %lf %c\\n\", buffer);\n\tASSERT_EQ(10, t);\n}\n<commit_msg>sprint_test: fix tests for macOS and more tests<commit_after>#include <gtest\/gtest.h>\n\n#include \"sprint.hh\"\n\nTEST(_fmt, int) {\n\tint a = 2;\n\tASSERT_STREQ(\"%d\", _fmt(a));\n}\n\nTEST(_fmt, uint64_t) {\n\tuint64_t a = 4294967295;\n\tif (typeid(a) == typeid(unsigned long long int)) {\n\t\tASSERT_STREQ(\"%llu\", _fmt(a));\n\t} else {\n\t\tASSERT_STREQ(\"%lu\", _fmt(a));\n\t}\n}\n\nTEST(_fmt, int64_t) {\n\tint64_t a = 4294967295;\n\tif (typeid(a) == typeid(long long int)) {\n\t\tASSERT_STREQ(\"%lld\", _fmt(a));\n\t} else {\n\t\tASSERT_STREQ(\"%ld\", _fmt(a));\n\t}\n}\n\nTEST(_fmt, uint32_t) {\n\tuint32_t a = 4294967295;\n\tif (typeid(a) == typeid(unsigned long int)) {\n\t\tASSERT_STREQ(\"%lu\", _fmt(a));\n\t} else {\n\t\tASSERT_STREQ(\"%u\", _fmt(a));\n\t}\n}\n\nTEST(_fmt, int32_t) {\n\tint32_t a = 4294967295;\n\tif (typeid(a) == typeid(long int)) {\n\t\tASSERT_STREQ(\"%ld\", _fmt(a));\n\t} else {\n\t\tASSERT_STREQ(\"%d\", _fmt(a));\n\t}\n}\n\nTEST(_fmt, double) {\n\tdouble a = 3.14159;\n\tASSERT_STREQ(\"%lf\", _fmt(a));\n}\n\nTEST(_fmt, float) {\n\tfloat a = 3.14159;\n\tASSERT_STREQ(\"%f\", _fmt(a));\n}\n\nTEST(_fmt, char) {\n\tchar a = '1';\n\tASSERT_STREQ(\"%c\", _fmt(a));\n}\n\nTEST(_sfmt, single_arg) {\n\tchar buffer[100];\n\tmemset(buffer, 0, 100);\n\tint t = _sfmt(buffer, 0, false, 2);\n\tASSERT_STREQ(\"%d\", buffer);\n\tASSERT_EQ(2, t);\n}\n\nTEST(_sfmt, three_args) {\n\tchar buffer[100];\n\tmemset(buffer, 0, 100);\n\tint t = _sfmt(buffer, 0, false, 2, 2.1, 'a');\n\tASSERT_STREQ(\"%d %lf %c\", buffer);\n\tASSERT_EQ(9, t);\n}\n\nTEST(_sfmt, newline) {\n\tchar buffer[100];\n\tmemset(buffer, 0, 100);\n\tint t = _sfmt(buffer, 0, true, 2, 2.1, 'a');\n\tASSERT_STREQ(\"%d %lf %c\\n\", buffer);\n\tASSERT_EQ(10, t);\n}\n<|endoftext|>"} {"text":"<commit_before>\/*\r\n * Global flags editor\r\n *\r\n * Copyright (c) 2015 Mark Jansen\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#include <Windows.h>\r\n#include <Strsafe.h>\r\n#include \"gflags.h\"\r\n\r\n#define GLOBALFLAG_REGKEY L\"SYSTEM\\\\CurrentControlSet\\\\Control\\\\Session Manager\"\r\n#define GLOBALFLAG_VALUENAME L\"GlobalFlag\"\r\n\r\n#define IMAGE_FILE_OPTIONS L\"SOFTWARE\\\\Microsoft\\\\Windows NT\\\\CurrentVersion\\\\Image File Execution Options\\\\%s\"\r\n\r\n\/\/ reactos\/include\/ndk\/extypes.h\r\n#define SystemFlagsInformation 9\r\n#define SystemRefTraceInformation 86\r\n#define SystemSpecialPoolInformation 87\r\n\r\ntypedef struct _SYSTEM_FLAGS_INFORMATION\r\n{\r\n ULONG Flags;\r\n} SYSTEM_FLAGS_INFORMATION, *PSYSTEM_FLAGS_INFORMATION;\r\n\r\n\r\n\/\/ Table from https:\/\/msdn.microsoft.com\/en-us\/library\/windows\/hardware\/ff549596(v=vs.85).aspx\r\n\r\nconst FlagInfo g_Flags[] =\r\n{\r\n {FLG_STOP_ON_EXCEPTION, L\"soe\", (DEST_REGISTRY | DEST_KERNEL | DEST_IMAGE), L\"Stop on exception\"},\r\n {FLG_SHOW_LDR_SNAPS, L\"sls\", (DEST_REGISTRY | DEST_KERNEL | DEST_IMAGE), L\"Show loader snaps\"},\r\n {FLG_DEBUG_INITIAL_COMMAND, L\"dic\", (DEST_REGISTRY), L\"Debug initial command\"},\r\n {FLG_STOP_ON_HUNG_GUI, L\"shg\", (DEST_KERNEL), L\"Stop on hung GUI\"},\r\n {FLG_HEAP_ENABLE_TAIL_CHECK, L\"htc\", (DEST_REGISTRY | DEST_KERNEL | DEST_IMAGE), L\"Enable heap tail checking\"},\r\n {FLG_HEAP_ENABLE_FREE_CHECK, L\"hfc\", (DEST_REGISTRY | DEST_KERNEL | DEST_IMAGE), L\"Enable heap free checking\"},\r\n {FLG_HEAP_VALIDATE_PARAMETERS, L\"hpc\", (DEST_REGISTRY | DEST_KERNEL | DEST_IMAGE), L\"Enable heap parameter checking\"},\r\n {FLG_HEAP_VALIDATE_ALL, L\"hvc\", (DEST_REGISTRY | DEST_KERNEL | DEST_IMAGE), L\"Enable heap validation on call\"},\r\n {FLG_APPLICATION_VERIFIER, L\"vrf\", (DEST_REGISTRY | DEST_KERNEL | DEST_IMAGE), L\"Enable application verifier\"},\r\n \/\/ FLG_MONITOR_SILENT_PROCESS_EXIT\r\n {FLG_POOL_ENABLE_TAGGING, L\"ptg\", (DEST_REGISTRY), L\"Enable pool tagging\"},\r\n {FLG_HEAP_ENABLE_TAGGING, L\"htg\", (DEST_REGISTRY | DEST_KERNEL | DEST_IMAGE), L\"Enable heap tagging\"},\r\n {FLG_USER_STACK_TRACE_DB, L\"ust\", (DEST_REGISTRY | DEST_KERNEL | DEST_IMAGE), L\"Create user mode stack trace database\"},\r\n {FLG_KERNEL_STACK_TRACE_DB, L\"kst\", (DEST_REGISTRY), L\"Create kernel mode stack trace database\"},\r\n {FLG_MAINTAIN_OBJECT_TYPELIST, L\"otl\", (DEST_REGISTRY), L\"Maintain a list of objects for each type\"},\r\n {FLG_HEAP_ENABLE_TAG_BY_DLL, L\"htd\", (DEST_REGISTRY | DEST_KERNEL | DEST_IMAGE), L\"Enable heap tagging by DLL\"},\r\n {FLG_DISABLE_STACK_EXTENSION, L\"dse\", (DEST_IMAGE), L\"Disable stack extension\"},\r\n\r\n {FLG_ENABLE_CSRDEBUG, L\"d32\", (DEST_REGISTRY), L\"Enable debugging of Win32 subsystem\"},\r\n {FLG_ENABLE_KDEBUG_SYMBOL_LOAD, L\"ksl\", (DEST_REGISTRY | DEST_KERNEL), L\"Enable loading of kernel debugger symbols\"},\r\n {FLG_DISABLE_PAGE_KERNEL_STACKS, L\"dps\", (DEST_REGISTRY), L\"Disable paging of kernel stacks\"},\r\n {FLG_ENABLE_SYSTEM_CRIT_BREAKS, L\"scb\", (DEST_REGISTRY | DEST_KERNEL | DEST_IMAGE), L\"Enable system critical breaks\"},\r\n {FLG_HEAP_DISABLE_COALESCING, L\"dhc\", (DEST_REGISTRY | DEST_KERNEL | DEST_IMAGE), L\"Disable heap coalesce on free\"},\r\n {FLG_ENABLE_CLOSE_EXCEPTIONS, L\"ece\", (DEST_REGISTRY | DEST_KERNEL), L\"Enable close exception\"},\r\n {FLG_ENABLE_EXCEPTION_LOGGING, L\"eel\", (DEST_REGISTRY | DEST_KERNEL), L\"Enable exception logging\"},\r\n {FLG_ENABLE_HANDLE_TYPE_TAGGING, L\"eot\", (DEST_REGISTRY | DEST_KERNEL), L\"Enable object handle type tagging\"},\r\n {FLG_HEAP_PAGE_ALLOCS, L\"hpa\", (DEST_REGISTRY | DEST_KERNEL | DEST_IMAGE), L\"Enable page heap\"},\r\n {FLG_DEBUG_INITIAL_COMMAND_EX, L\"dwl\", (DEST_REGISTRY), L\"Debug WinLogon\"},\r\n {FLG_DISABLE_DBGPRINT, L\"ddp\", (DEST_REGISTRY | DEST_KERNEL), L\"Buffer DbgPrint Output\"},\r\n {FLG_CRITSEC_EVENT_CREATION, L\"cse\", (DEST_REGISTRY | DEST_KERNEL | DEST_IMAGE), L\"Early critical section event creation\"},\r\n {FLG_STOP_ON_UNHANDLED_EXCEPTION, L\"sue\", (DEST_REGISTRY | DEST_KERNEL | DEST_IMAGE), L\"Stop on unhandled user-mode exception\"},\r\n {FLG_ENABLE_HANDLE_EXCEPTIONS, L\"bhd\", (DEST_REGISTRY | DEST_KERNEL), L\"Enable bad handles detection\"},\r\n {FLG_DISABLE_PROTDLLS, L\"dpd\", (DEST_REGISTRY | DEST_KERNEL | DEST_IMAGE), L\"Disable protected DLL verification\"},\r\n};\r\n\r\n\/\/{FLG_MONITOR_SILENT_PROCESS_EXIT, NULL, (DEST_REGISTRY), L\"Enable silent process exit monitoring\"},\r\n\/\/{0, NULL, (DEST_REGISTRY | DEST_KERNEL | DEST_IMAGE), L\"Object Reference Tracing},\r\n\/\/{0, L\"spp\", (DEST_REGISTRY | DEST_KERNEL), Special Pool\"}, \/\/ kernel only in vista\r\n\r\n\r\nsize_t g_FlagCount = sizeof(g_Flags) \/ sizeof(g_Flags[0]);\r\n\r\nDWORD g_ValidRegistryFlags = 0;\r\nDWORD g_ValidKernelFlags = 0;\r\nDWORD g_ValidImageFlags = 0;\r\nDWORD g_PoolTaggingEnabled = 0;\r\n\r\ntypedef NTSTATUS (NTAPI* tNtQuerySystemInformation)(ULONG SystemInformationClass, PVOID SystemInformation, ULONG InformationLength, PULONG ResultLength);\r\ntypedef NTSTATUS (NTAPI* tNtSetSystemInformation)(ULONG SystemInformationClass, PVOID SystemInformation, ULONG SystemInformationLength);\r\ntypedef NTSTATUS (NTAPI* tRtlGetVersion)(_Inout_ LPOSVERSIONINFOW lpVersionInformation);\r\n\r\n\r\nstatic tNtQuerySystemInformation g_NtQuerySystemInformation = NULL;\r\nstatic tNtSetSystemInformation g_NtSetSystemInformation = NULL;\r\nstatic tRtlGetVersion g_RtlGetVersion = NULL;\r\n\r\ntemplate<typename TYP_, typename FNC_, FNC_ Func>\r\nstruct AutoClose\r\n{\r\n AutoClose( TYP_ value ) : Value(value) {;}\r\n ~AutoClose()\r\n {\r\n Func( Value );\r\n }\r\n TYP_ Value;\r\n};\r\n\r\nstruct AutoCloseHandle : AutoClose<HANDLE, BOOL (WINAPI*)(HANDLE), CloseHandle>\r\n{\r\n AutoCloseHandle( HANDLE value ) : AutoClose( value ) {;}\r\n};\r\n\r\nstruct AutoCloseReg : AutoClose<HKEY, LONG (WINAPI*)(HKEY), RegCloseKey>\r\n{\r\n AutoCloseReg( HKEY value ) : AutoClose( value ) {;}\r\n};\r\n\r\nBOOL InitFunctionPointers()\r\n{\r\n if(!g_NtQuerySystemInformation || !g_NtSetSystemInformation || !g_RtlGetVersion)\r\n {\r\n HMODULE hNtdll = GetModuleHandle(L\"ntdll.dll\");\r\n g_NtQuerySystemInformation = (tNtQuerySystemInformation)GetProcAddress(hNtdll, \"NtQuerySystemInformation\");\r\n g_NtSetSystemInformation = (tNtSetSystemInformation)GetProcAddress(hNtdll, \"NtSetSystemInformation\");\r\n g_RtlGetVersion = (tRtlGetVersion)GetProcAddress(hNtdll, \"RtlGetVersion\");\r\n }\r\n return g_NtQuerySystemInformation && g_NtSetSystemInformation;\r\n}\r\n\r\nvoid UpdateValidFlags()\r\n{\r\n g_ValidRegistryFlags = 0;\r\n g_ValidKernelFlags = 0;\r\n g_ValidImageFlags = 0;\r\n for( size_t n = 0; n < g_FlagCount; ++n )\r\n {\r\n g_ValidRegistryFlags |= (g_Flags[n].wDest & DEST_REGISTRY) ? g_Flags[n].dwFlag : 0;\r\n g_ValidKernelFlags |= (g_Flags[n].wDest & DEST_KERNEL) ? g_Flags[n].dwFlag : 0;\r\n g_ValidImageFlags |= (g_Flags[n].wDest & DEST_IMAGE) ? g_Flags[n].dwFlag : 0;\r\n }\r\n\r\n if(!InitFunctionPointers())\r\n {\r\n return;\r\n }\r\n OSVERSIONINFOW osv = {sizeof(osv), NULL};\r\n g_RtlGetVersion(&osv);\r\n if(osv.dwMajorVersion > 5 || (osv.dwMajorVersion == 5 && osv.dwMinorVersion >= 2))\r\n {\r\n g_PoolTaggingEnabled = 1;\r\n }\r\n}\r\n\r\nBOOL EnableDebug()\r\n{\r\n static BOOL debugEnabled = FALSE;\r\n if( !debugEnabled )\r\n {\r\n HANDLE hToken;\r\n if( OpenProcessToken( GetCurrentProcess(), TOKEN_QUERY | TOKEN_ADJUST_PRIVILEGES, &hToken ) )\r\n {\r\n AutoCloseHandle raii(hToken);\r\n TOKEN_PRIVILEGES tp = {0};\r\n tp.PrivilegeCount = 1;\r\n tp.Privileges[0].Attributes = SE_PRIVILEGE_ENABLED;\r\n if( LookupPrivilegeValueW( NULL, L\"SeDebugPrivilege\", &tp.Privileges[0].Luid) )\r\n {\r\n debugEnabled = AdjustTokenPrivileges( hToken, FALSE, &tp, sizeof(tp), NULL, NULL );\r\n }\r\n }\r\n }\r\n return debugEnabled;\r\n}\r\n\r\n\r\nBOOL ReadGlobalFlagsFromRegistry( _Out_ DWORD* Flag )\r\n{\r\n HKEY hKey;\r\n if(EnableDebug() && ERROR_SUCCESS == RegOpenKeyExW( HKEY_LOCAL_MACHINE, GLOBALFLAG_REGKEY, 0, KEY_READ, &hKey ) )\r\n {\r\n AutoCloseReg raii(hKey);\r\n DWORD Type = 0, cbData = sizeof(*Flag);\r\n if( ERROR_SUCCESS == RegQueryValueExW( hKey, GLOBALFLAG_VALUENAME, NULL, &Type, (LPBYTE)Flag, &cbData ) && Type == REG_DWORD )\r\n {\r\n return TRUE;\r\n }\r\n }\r\n return FALSE;\r\n}\r\n\r\nBOOL WriteGlobalFlagsToRegistry( _In_ DWORD Flag )\r\n{\r\n HKEY hKey;\r\n if(EnableDebug() && ERROR_SUCCESS == RegOpenKeyExW( HKEY_LOCAL_MACHINE, GLOBALFLAG_REGKEY, 0, KEY_WRITE, &hKey ) )\r\n {\r\n AutoCloseReg raii(hKey);\r\n if( ERROR_SUCCESS == RegSetValueExW( hKey, GLOBALFLAG_VALUENAME, NULL, REG_DWORD, (LPBYTE)&Flag, sizeof(Flag) ) )\r\n {\r\n return TRUE;\r\n }\r\n }\r\n return FALSE;\r\n}\r\n\r\nBOOL ReadImageGlobalFlagsFromRegistry( _In_z_ PCWSTR ImageName, _Out_ ULONG* Flag )\r\n{\r\n HKEY hKey;\r\n WCHAR FullKey[260];\r\n if(!ImageName || !ImageName[0])\r\n {\r\n *Flag = 0;\r\n return TRUE;\r\n }\r\n StringCchPrintfW(FullKey, 260, IMAGE_FILE_OPTIONS, ImageName);\r\n if(EnableDebug())\r\n {\r\n LONG lRet = RegOpenKeyExW( HKEY_LOCAL_MACHINE, FullKey, 0, KEY_READ, &hKey );\r\n if( ERROR_SUCCESS == lRet )\r\n {\r\n AutoCloseReg raii(hKey);\r\n DWORD Type = 0, cbData = sizeof(*Flag);\r\n if( ERROR_SUCCESS == RegQueryValueExW( hKey, GLOBALFLAG_VALUENAME, NULL, &Type, (LPBYTE)Flag, &cbData ) && Type == REG_DWORD )\r\n {\r\n return TRUE;\r\n }\r\n }\r\n else if(ERROR_FILE_NOT_FOUND == lRet)\r\n {\r\n *Flag = 0;\r\n return TRUE;\r\n }\r\n }\r\n return FALSE;\r\n}\r\n\r\nBOOL WriteImageGlobalFlagsToRegistry( _In_z_ PCWSTR ImageName,_In_ ULONG Flag )\r\n{\r\n HKEY hKey;\r\n WCHAR FullKey[260];\r\n StringCchPrintfW(FullKey, 260, IMAGE_FILE_OPTIONS, ImageName);\r\n DWORD dwDisposition = 0;\r\n if(EnableDebug() && ERROR_SUCCESS == RegCreateKeyExW( HKEY_LOCAL_MACHINE, FullKey, 0, 0, 0, KEY_WRITE, NULL, &hKey, &dwDisposition ))\r\n {\r\n AutoCloseReg raii(hKey);\r\n \/\/dwDisposition == REG_CREATED_NEW_KEY || REG_OPENED_EXISTING_KEY;\r\n if( ERROR_SUCCESS == RegSetValueExW( hKey, GLOBALFLAG_VALUENAME, NULL, REG_DWORD, (LPBYTE)&Flag, sizeof(Flag) ) )\r\n {\r\n return TRUE;\r\n }\r\n }\r\n return FALSE;\r\n\r\n}\r\n\r\nBOOL ReadGlobalFlagsFromKernel( _Out_ DWORD* Flag )\r\n{\r\n if(InitFunctionPointers())\r\n {\r\n ULONG Length = 0;\r\n SYSTEM_FLAGS_INFORMATION sfi = {0};\r\n sfi.Flags = 0;\r\n if(SUCCEEDED(g_NtQuerySystemInformation(SystemFlagsInformation, &sfi, sizeof(sfi), &Length)) && Length == sizeof(sfi))\r\n {\r\n *Flag = sfi.Flags;\r\n return TRUE;\r\n }\r\n }\r\n return FALSE;\r\n}\r\n\r\nBOOL WriteGlobalFlagsToKernel( _In_ DWORD Flag )\r\n{\r\n if(InitFunctionPointers())\r\n {\r\n SYSTEM_FLAGS_INFORMATION sfi = {0};\r\n sfi.Flags = Flag;\r\n return SUCCEEDED(g_NtSetSystemInformation(SystemFlagsInformation, &sfi, sizeof(sfi)));\r\n }\r\n return FALSE;\r\n}\r\n<commit_msg>tagging<commit_after>\/*\r\n * Global flags editor\r\n *\r\n * Copyright (c) 2015 Mark Jansen\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#include <Windows.h>\r\n#include <Strsafe.h>\r\n#include <assert.h>\r\n#include \"gflags.h\"\r\n\r\n#define GLOBALFLAG_REGKEY L\"SYSTEM\\\\CurrentControlSet\\\\Control\\\\Session Manager\"\r\n#define GLOBALFLAG_VALUENAME L\"GlobalFlag\"\r\n\r\n#define IMAGE_FILE_OPTIONS L\"SOFTWARE\\\\Microsoft\\\\Windows NT\\\\CurrentVersion\\\\Image File Execution Options\\\\%s\"\r\n\r\n\/\/ reactos\/include\/ndk\/extypes.h\r\n#define SystemFlagsInformation 9\r\n#define SystemRefTraceInformation 86\r\n#define SystemSpecialPoolInformation 87\r\n\r\ntypedef struct _SYSTEM_FLAGS_INFORMATION\r\n{\r\n ULONG Flags;\r\n} SYSTEM_FLAGS_INFORMATION, *PSYSTEM_FLAGS_INFORMATION;\r\n\r\n\r\n\/\/ Table from https:\/\/msdn.microsoft.com\/en-us\/library\/windows\/hardware\/ff549596(v=vs.85).aspx\r\n\r\nconst FlagInfo g_Flags[] =\r\n{\r\n {FLG_STOP_ON_EXCEPTION, L\"soe\", (DEST_REGISTRY | DEST_KERNEL | DEST_IMAGE), L\"Stop on exception\"},\r\n {FLG_SHOW_LDR_SNAPS, L\"sls\", (DEST_REGISTRY | DEST_KERNEL | DEST_IMAGE), L\"Show loader snaps\"},\r\n {FLG_DEBUG_INITIAL_COMMAND, L\"dic\", (DEST_REGISTRY), L\"Debug initial command\"},\r\n {FLG_STOP_ON_HUNG_GUI, L\"shg\", (DEST_KERNEL), L\"Stop on hung GUI\"},\r\n {FLG_HEAP_ENABLE_TAIL_CHECK, L\"htc\", (DEST_REGISTRY | DEST_KERNEL | DEST_IMAGE), L\"Enable heap tail checking\"},\r\n {FLG_HEAP_ENABLE_FREE_CHECK, L\"hfc\", (DEST_REGISTRY | DEST_KERNEL | DEST_IMAGE), L\"Enable heap free checking\"},\r\n {FLG_HEAP_VALIDATE_PARAMETERS, L\"hpc\", (DEST_REGISTRY | DEST_KERNEL | DEST_IMAGE), L\"Enable heap parameter checking\"},\r\n {FLG_HEAP_VALIDATE_ALL, L\"hvc\", (DEST_REGISTRY | DEST_KERNEL | DEST_IMAGE), L\"Enable heap validation on call\"},\r\n {FLG_APPLICATION_VERIFIER, L\"vrf\", (DEST_REGISTRY | DEST_KERNEL | DEST_IMAGE), L\"Enable application verifier\"},\r\n \/\/ FLG_MONITOR_SILENT_PROCESS_EXIT\r\n {FLG_POOL_ENABLE_TAGGING, L\"ptg\", (DEST_REGISTRY), L\"Enable pool tagging\"},\r\n {FLG_HEAP_ENABLE_TAGGING, L\"htg\", (DEST_REGISTRY | DEST_KERNEL | DEST_IMAGE), L\"Enable heap tagging\"},\r\n {FLG_USER_STACK_TRACE_DB, L\"ust\", (DEST_REGISTRY | DEST_KERNEL | DEST_IMAGE), L\"Create user mode stack trace database\"},\r\n {FLG_KERNEL_STACK_TRACE_DB, L\"kst\", (DEST_REGISTRY), L\"Create kernel mode stack trace database\"},\r\n {FLG_MAINTAIN_OBJECT_TYPELIST, L\"otl\", (DEST_REGISTRY), L\"Maintain a list of objects for each type\"},\r\n {FLG_HEAP_ENABLE_TAG_BY_DLL, L\"htd\", (DEST_REGISTRY | DEST_KERNEL | DEST_IMAGE), L\"Enable heap tagging by DLL\"},\r\n {FLG_DISABLE_STACK_EXTENSION, L\"dse\", (DEST_IMAGE), L\"Disable stack extension\"},\r\n\r\n {FLG_ENABLE_CSRDEBUG, L\"d32\", (DEST_REGISTRY), L\"Enable debugging of Win32 subsystem\"},\r\n {FLG_ENABLE_KDEBUG_SYMBOL_LOAD, L\"ksl\", (DEST_REGISTRY | DEST_KERNEL), L\"Enable loading of kernel debugger symbols\"},\r\n {FLG_DISABLE_PAGE_KERNEL_STACKS, L\"dps\", (DEST_REGISTRY), L\"Disable paging of kernel stacks\"},\r\n {FLG_ENABLE_SYSTEM_CRIT_BREAKS, L\"scb\", (DEST_REGISTRY | DEST_KERNEL | DEST_IMAGE), L\"Enable system critical breaks\"},\r\n {FLG_HEAP_DISABLE_COALESCING, L\"dhc\", (DEST_REGISTRY | DEST_KERNEL | DEST_IMAGE), L\"Disable heap coalesce on free\"},\r\n {FLG_ENABLE_CLOSE_EXCEPTIONS, L\"ece\", (DEST_REGISTRY | DEST_KERNEL), L\"Enable close exception\"},\r\n {FLG_ENABLE_EXCEPTION_LOGGING, L\"eel\", (DEST_REGISTRY | DEST_KERNEL), L\"Enable exception logging\"},\r\n {FLG_ENABLE_HANDLE_TYPE_TAGGING, L\"eot\", (DEST_REGISTRY | DEST_KERNEL), L\"Enable object handle type tagging\"},\r\n {FLG_HEAP_PAGE_ALLOCS, L\"hpa\", (DEST_REGISTRY | DEST_KERNEL | DEST_IMAGE), L\"Enable page heap\"},\r\n {FLG_DEBUG_INITIAL_COMMAND_EX, L\"dwl\", (DEST_REGISTRY), L\"Debug WinLogon\"},\r\n {FLG_DISABLE_DBGPRINT, L\"ddp\", (DEST_REGISTRY | DEST_KERNEL), L\"Buffer DbgPrint Output\"},\r\n {FLG_CRITSEC_EVENT_CREATION, L\"cse\", (DEST_REGISTRY | DEST_KERNEL | DEST_IMAGE), L\"Early critical section event creation\"},\r\n {FLG_STOP_ON_UNHANDLED_EXCEPTION, L\"sue\", (DEST_REGISTRY | DEST_KERNEL | DEST_IMAGE), L\"Stop on unhandled user-mode exception\"},\r\n {FLG_ENABLE_HANDLE_EXCEPTIONS, L\"bhd\", (DEST_REGISTRY | DEST_KERNEL), L\"Enable bad handles detection\"},\r\n {FLG_DISABLE_PROTDLLS, L\"dpd\", (DEST_REGISTRY | DEST_KERNEL | DEST_IMAGE), L\"Disable protected DLL verification\"},\r\n};\r\n\r\n\/\/{FLG_MONITOR_SILENT_PROCESS_EXIT, NULL, (DEST_REGISTRY), L\"Enable silent process exit monitoring\"},\r\n\/\/{0, NULL, (DEST_REGISTRY | DEST_KERNEL | DEST_IMAGE), L\"Object Reference Tracing},\r\n\/\/{0, L\"spp\", (DEST_REGISTRY | DEST_KERNEL), Special Pool\"}, \/\/ kernel only in vista\r\n\r\n\r\nsize_t g_FlagCount = sizeof(g_Flags) \/ sizeof(g_Flags[0]);\r\n\r\nDWORD g_ValidRegistryFlags = 0;\r\nDWORD g_ValidKernelFlags = 0;\r\nDWORD g_ValidImageFlags = 0;\r\nDWORD g_PoolTaggingEnabled = 0;\r\n\r\ntypedef NTSTATUS (NTAPI* tNtQuerySystemInformation)(ULONG SystemInformationClass, PVOID SystemInformation, ULONG InformationLength, PULONG ResultLength);\r\ntypedef NTSTATUS (NTAPI* tNtSetSystemInformation)(ULONG SystemInformationClass, PVOID SystemInformation, ULONG SystemInformationLength);\r\ntypedef NTSTATUS (NTAPI* tRtlGetVersion)(_Inout_ LPOSVERSIONINFOW lpVersionInformation);\r\n\r\n\r\nstatic tNtQuerySystemInformation g_NtQuerySystemInformation = NULL;\r\nstatic tNtSetSystemInformation g_NtSetSystemInformation = NULL;\r\nstatic tRtlGetVersion g_RtlGetVersion = NULL;\r\n\r\ntemplate<typename TYP_, typename FNC_, FNC_ Func>\r\nstruct AutoClose\r\n{\r\n AutoClose( TYP_ value ) : Value(value) {;}\r\n ~AutoClose()\r\n {\r\n Func( Value );\r\n }\r\n TYP_ Value;\r\n};\r\n\r\nstruct AutoCloseHandle : AutoClose<HANDLE, BOOL (WINAPI*)(HANDLE), CloseHandle>\r\n{\r\n AutoCloseHandle( HANDLE value ) : AutoClose( value ) {;}\r\n};\r\n\r\nstruct AutoCloseReg : AutoClose<HKEY, LONG (WINAPI*)(HKEY), RegCloseKey>\r\n{\r\n AutoCloseReg( HKEY value ) : AutoClose( value ) {;}\r\n};\r\n\r\nBOOL InitFunctionPointers()\r\n{\r\n if(!g_NtQuerySystemInformation || !g_NtSetSystemInformation || !g_RtlGetVersion)\r\n {\r\n HMODULE hNtdll = GetModuleHandle(L\"ntdll.dll\");\r\n g_NtQuerySystemInformation = (tNtQuerySystemInformation)GetProcAddress(hNtdll, \"NtQuerySystemInformation\");\r\n g_NtSetSystemInformation = (tNtSetSystemInformation)GetProcAddress(hNtdll, \"NtSetSystemInformation\");\r\n g_RtlGetVersion = (tRtlGetVersion)GetProcAddress(hNtdll, \"RtlGetVersion\");\r\n }\r\n return g_NtQuerySystemInformation && g_NtSetSystemInformation;\r\n}\r\n\r\nvoid UpdateValidFlags()\r\n{\r\n g_ValidRegistryFlags = 0;\r\n g_ValidKernelFlags = 0;\r\n g_ValidImageFlags = 0;\r\n for( size_t n = 0; n < g_FlagCount; ++n )\r\n {\r\n g_ValidRegistryFlags |= (g_Flags[n].wDest & DEST_REGISTRY) ? g_Flags[n].dwFlag : 0;\r\n g_ValidKernelFlags |= (g_Flags[n].wDest & DEST_KERNEL) ? g_Flags[n].dwFlag : 0;\r\n g_ValidImageFlags |= (g_Flags[n].wDest & DEST_IMAGE) ? g_Flags[n].dwFlag : 0;\r\n }\r\n\r\n if(!InitFunctionPointers())\r\n {\r\n return;\r\n }\r\n OSVERSIONINFOW osv = {sizeof(osv), NULL};\r\n g_RtlGetVersion(&osv);\r\n if(osv.dwMajorVersion > 5 || (osv.dwMajorVersion == 5 && osv.dwMinorVersion >= 2))\r\n {\r\n g_PoolTaggingEnabled = 1;\r\n }\r\n}\r\n\r\nBOOL EnableDebug()\r\n{\r\n static BOOL debugEnabled = FALSE;\r\n if( !debugEnabled )\r\n {\r\n HANDLE hToken;\r\n if( OpenProcessToken( GetCurrentProcess(), TOKEN_QUERY | TOKEN_ADJUST_PRIVILEGES, &hToken ) )\r\n {\r\n AutoCloseHandle raii(hToken);\r\n TOKEN_PRIVILEGES tp = {0};\r\n tp.PrivilegeCount = 1;\r\n tp.Privileges[0].Attributes = SE_PRIVILEGE_ENABLED;\r\n if( LookupPrivilegeValueW( NULL, L\"SeDebugPrivilege\", &tp.Privileges[0].Luid) )\r\n {\r\n debugEnabled = AdjustTokenPrivileges( hToken, FALSE, &tp, sizeof(tp), NULL, NULL );\r\n }\r\n }\r\n }\r\n return debugEnabled;\r\n}\r\n\r\n\r\nBOOL ReadGlobalFlagsFromRegistry( _Out_ DWORD* Flag )\r\n{\r\n HKEY hKey;\r\n if(EnableDebug() && ERROR_SUCCESS == RegOpenKeyExW( HKEY_LOCAL_MACHINE, GLOBALFLAG_REGKEY, 0, KEY_READ, &hKey ) )\r\n {\r\n AutoCloseReg raii(hKey);\r\n DWORD Type = 0, cbData = sizeof(*Flag);\r\n if( ERROR_SUCCESS == RegQueryValueExW( hKey, GLOBALFLAG_VALUENAME, NULL, &Type, (LPBYTE)Flag, &cbData ) && Type == REG_DWORD )\r\n {\r\n return TRUE;\r\n }\r\n }\r\n return FALSE;\r\n}\r\n\r\nBOOL WriteGlobalFlagsToRegistry( _In_ DWORD Flag )\r\n{\r\n HKEY hKey;\r\n if(EnableDebug() && ERROR_SUCCESS == RegOpenKeyExW( HKEY_LOCAL_MACHINE, GLOBALFLAG_REGKEY, 0, KEY_WRITE, &hKey ) )\r\n {\r\n AutoCloseReg raii(hKey);\r\n if( ERROR_SUCCESS == RegSetValueExW( hKey, GLOBALFLAG_VALUENAME, NULL, REG_DWORD, (LPBYTE)&Flag, sizeof(Flag) ) )\r\n {\r\n return TRUE;\r\n }\r\n }\r\n return FALSE;\r\n}\r\n\r\nBOOL ReadImageGlobalFlagsFromRegistry( _In_z_ PCWSTR ImageName, _Out_ ULONG* Flag )\r\n{\r\n HKEY hKey;\r\n WCHAR FullKey[260];\r\n if(!ImageName || !ImageName[0])\r\n {\r\n *Flag = 0;\r\n return TRUE;\r\n }\r\n StringCchPrintfW(FullKey, 260, IMAGE_FILE_OPTIONS, ImageName);\r\n if(EnableDebug())\r\n {\r\n LONG lRet = RegOpenKeyExW( HKEY_LOCAL_MACHINE, FullKey, 0, KEY_READ, &hKey );\r\n if( ERROR_SUCCESS == lRet )\r\n {\r\n AutoCloseReg raii(hKey);\r\n DWORD Type = 0, cbData = sizeof(*Flag);\r\n if( ERROR_SUCCESS == RegQueryValueExW( hKey, GLOBALFLAG_VALUENAME, NULL, &Type, (LPBYTE)Flag, &cbData ) && Type == REG_DWORD )\r\n {\r\n return TRUE;\r\n }\r\n }\r\n else if(ERROR_FILE_NOT_FOUND == lRet)\r\n {\r\n *Flag = 0;\r\n return TRUE;\r\n }\r\n }\r\n return FALSE;\r\n}\r\n\r\nBOOL WriteImageGlobalFlagsToRegistry( _In_z_ PCWSTR ImageName,_In_ ULONG Flag )\r\n{\r\n HKEY hKey;\r\n WCHAR FullKey[260];\r\n StringCchPrintfW(FullKey, 260, IMAGE_FILE_OPTIONS, ImageName);\r\n DWORD dwDisposition = 0;\r\n if(EnableDebug() && ERROR_SUCCESS == RegCreateKeyExW( HKEY_LOCAL_MACHINE, FullKey, 0, 0, 0, KEY_WRITE, NULL, &hKey, &dwDisposition ))\r\n {\r\n AutoCloseReg raii(hKey);\r\n \/\/dwDisposition == REG_CREATED_NEW_KEY || REG_OPENED_EXISTING_KEY;\r\n if( ERROR_SUCCESS == RegSetValueExW( hKey, GLOBALFLAG_VALUENAME, NULL, REG_DWORD, (LPBYTE)&Flag, sizeof(Flag) ) )\r\n {\r\n return TRUE;\r\n }\r\n }\r\n return FALSE;\r\n\r\n}\r\n\r\nBOOL ReadGlobalFlagsFromKernel( _Out_ DWORD* Flag )\r\n{\r\n if(InitFunctionPointers())\r\n {\r\n ULONG Length = 0;\r\n SYSTEM_FLAGS_INFORMATION sfi = {0};\r\n sfi.Flags = 0;\r\n assert(sizeof(SYSTEM_FLAGS_INFORMATION) == 4);\r\n assert(sizeof(sfi) == 4);\r\n if(SUCCEEDED(g_NtQuerySystemInformation(SystemFlagsInformation, &sfi, sizeof(sfi), &Length)) && Length == sizeof(sfi))\r\n {\r\n *Flag = sfi.Flags;\r\n return TRUE;\r\n }\r\n }\r\n return FALSE;\r\n}\r\n\r\nBOOL WriteGlobalFlagsToKernel( _In_ DWORD Flag )\r\n{\r\n if(InitFunctionPointers())\r\n {\r\n SYSTEM_FLAGS_INFORMATION sfi = {0};\r\n sfi.Flags = Flag;\r\n if (g_PoolTaggingEnabled)\r\n {\r\n sfi.Flags |= FLG_POOL_ENABLE_TAGGING;\r\n }\r\n return SUCCEEDED(g_NtSetSystemInformation(SystemFlagsInformation, &sfi, sizeof(sfi)));\r\n }\r\n return FALSE;\r\n}\r\n<|endoftext|>"} {"text":"<commit_before>#include <node.h>\n#include <node_buffer.h>\n#include <v8.h>\n#include <cstring>\n#include <openssl\/aes.h>\n#include <openssl\/engine.h>\n#include <openssl\/rand.h>\n\nextern \"C\" {\n#include \"aes_utils.h\"\n}\n\n#include \"base64.h\"\n\n#include \"..\/alac\/ALACEncoder.h\"\n#include \"..\/alac\/ALACBitUtilities.h\"\n\nusing namespace v8;\nusing namespace node;\n\nstatic int kBlockSize = 16;\nstatic int kFramesPerPacket = 352;\n\n\/\/ These values should be changed at each iteration\nstatic uint8_t iv [] = { 0x78, 0xf4, 0x41, 0x2c, 0x8d, 0x17, 0x37, 0x90, 0x2b, 0x15, 0xa6, 0xb3, 0xee, 0x77, 0x0d, 0x67 };\nstatic uint8_t aes_key [] = { 0x14, 0x49, 0x7d, 0xcc, 0x98, 0xe1, 0x37, 0xa8, 0x55, 0xc1, 0x45, 0x5a, 0x6b, 0xc0, 0xc9, 0x79 };\n\nnamespace nodeairtunes {\n\nvoid FillInputAudioFormat(AudioFormatDescription *format) {\n format->mFormatID = kALACFormatLinearPCM;\n format->mSampleRate = 44100;\n format->mFormatFlags = 12;\n\n format->mBytesPerPacket = 4;\n format->mBytesPerFrame = 4;\n format->mBitsPerChannel = 16;\n format->mChannelsPerFrame = 2;\n format->mFramesPerPacket = 1;\n\n format->mReserved = 0;\n}\n\nvoid FillOutputAudioFormat(AudioFormatDescription *format) {\n format->mFormatID = kALACFormatAppleLossless;\n format->mSampleRate = 44100;\n format->mFormatFlags = 1;\n\n format->mBytesPerPacket = 0;\n format->mBytesPerFrame = 0;\n format->mBitsPerChannel = 0;\n format->mChannelsPerFrame = 2;\n format->mFramesPerPacket = kFramesPerPacket;\n\n format->mReserved = 0;\n}\n\nvoid encoder_weak_callback (const WeakCallbackData<Value, const char*>&data) {\n \/\/HandleScope scope;\n \/\/ALACEncoder *encoder = (ALACEncoder *)\n \/\/data[0];\n \/\/delete encoder;\n \/\/wrapper.Dispose();\n \/\/wrapper.Reset();\n}\n\n\/\/ Creates a new encoder instance and wraps it in a JavaScript object.\n\/\/ This encoder is freed when the object is released by the GC.\n\/\/Handle<Value> NewEncoder(const Arguments& args) {\nvoid NewEncoder(const FunctionCallbackInfo<Value>& args) {\n \/\/HandleScope scope;\n Isolate* isolate = Isolate::GetCurrent();\n EscapableHandleScope scope(isolate);\n\n AudioFormatDescription outputFormat;\n FillOutputAudioFormat(&outputFormat);\n\n ALACEncoder *encoder = new ALACEncoder();\n\n encoder->SetFrameSize(kFramesPerPacket);\n encoder->InitializeEncoder(outputFormat);\n\n \/\/Persistent<ObjectTemplate> encoderClass (isolate, ObjectTemplate::New());\n\/\/ encoderClass->SetInternalFieldCount(1);\n Persistent<Object> o = (isolate, encoder);\n\/\/ o->SetPointerInInternalField(0, encoder);\n \/\/o.SetWeak(encoder, encoder_weak_callback);\n\n\/\/ args.GetReturnValue().Set(o);\n}\n\nvoid EncodeALAC(const FunctionCallbackInfo<Value>& args) {\n\/\/Handle<Value> EncodeALAC(const Arguments& args) {\n \/\/HandleScope scope;\n\n Isolate* isolate = Isolate::GetCurrent();\n EscapableHandleScope scope(isolate);\n\n if(args.Length() < 4) {\n printf(\"expected: EncodeALAC(encoder, pcmData, pcmSize, alacData, alacSize)\\n\");\n args.GetReturnValue().Set(Null(isolate));\n }\n\n Local<Object>wrapper = args[0]->ToObject();\n\/\/ ALACEncoder *encoder = (ALACEncoder*)wrapper->GetPointerFromInternalField(0);\n\n\/\/ ALACEncoder *encoder = (ALACEncoder*)wrapper->GetAlignedPointerFromInternalField(0);\n ALACEncoder *encoder = new ALACEncoder();\n\n Local<Value> pcmBuffer = args[1];\n unsigned char* pcmData = (unsigned char*)Buffer::Data(pcmBuffer->ToObject());\n\n Local<Value> alacBuffer = args[2];\n unsigned char* alacData = (unsigned char*)Buffer::Data(alacBuffer->ToObject());\n\n int32_t pcmSize = args[3]->Int32Value();\n\n AudioFormatDescription inputFormat, outputFormat;\n FillInputAudioFormat(&inputFormat);\n FillOutputAudioFormat(&outputFormat);\n\n int32_t alacSize = pcmSize;\n encoder->Encode(inputFormat, outputFormat, pcmData, alacData, &alacSize);\n\n \/\/return scope.Close(Integer::New(alacSize));\n args.GetReturnValue().Set(Integer::New(isolate, alacSize));\n}\n\nvoid EncryptAES(const FunctionCallbackInfo<Value>& args) {\n \/\/HandleScope scope;\n Isolate* isolate = v8::Isolate::GetCurrent();\n EscapableHandleScope scope(isolate);\n\n if(args.Length() < 2) {\n printf(\"expected: EncryptAES(alacData, alacSize)\\n\");\n args.GetReturnValue().Set(Null(isolate));\n }\n\n Local<Value> alacBuffer = args[0];\n unsigned char* alacData = (unsigned char*)Buffer::Data(alacBuffer->ToObject());\n int32_t alacSize = args[1]->Int32Value();\n\n \/\/ This will encrypt data in-place\n uint8_t *buf;\n int i = 0, j;\n uint8_t nv[kBlockSize];\n\n aes_context ctx;\n aes_set_key(&ctx, aes_key, 128);\n memcpy(nv, iv, kBlockSize);\n\n while(i + kBlockSize <= alacSize) {\n buf = alacData + i;\n\n for(j = 0; j < kBlockSize; j++)\n buf[j] ^= nv[j];\n\n aes_encrypt(&ctx, buf, buf);\n memcpy(nv, buf, kBlockSize);\n\n i += kBlockSize;\n }\n\n \/\/return scope.Close(Null());\n args.GetReturnValue().Set(Null(isolate));\n}\n\nvoid InitCodec(Handle<Object> target) {\n NODE_SET_METHOD(target, \"encodeALAC\", EncodeALAC);\n NODE_SET_METHOD(target, \"encryptAES\", EncryptAES);\n NODE_SET_METHOD(target, \"newEncoder\", NewEncoder);\n}\n\n} \/\/ nodeairtunes namespace\n<commit_msg>got it compiling now on node 0.12, now.. lets solve the segfault at runtime....<commit_after>#include <node.h>\n#include <node_buffer.h>\n#include <v8.h>\n#include <cstring>\n#include <openssl\/aes.h>\n#include <openssl\/engine.h>\n#include <openssl\/rand.h>\n\nextern \"C\" {\n#include \"aes_utils.h\"\n}\n\n#include \"base64.h\"\n\n#include \"..\/alac\/ALACEncoder.h\"\n#include \"..\/alac\/ALACBitUtilities.h\"\n\nusing namespace v8;\nusing namespace node;\n\nstatic int kBlockSize = 16;\nstatic int kFramesPerPacket = 352;\n\n\/\/ These values should be changed at each iteration\nstatic uint8_t iv [] = { 0x78, 0xf4, 0x41, 0x2c, 0x8d, 0x17, 0x37, 0x90, 0x2b, 0x15, 0xa6, 0xb3, 0xee, 0x77, 0x0d, 0x67 };\nstatic uint8_t aes_key [] = { 0x14, 0x49, 0x7d, 0xcc, 0x98, 0xe1, 0x37, 0xa8, 0x55, 0xc1, 0x45, 0x5a, 0x6b, 0xc0, 0xc9, 0x79 };\n\nnamespace nodeairtunes {\n\nvoid FillInputAudioFormat(AudioFormatDescription *format) {\n format->mFormatID = kALACFormatLinearPCM;\n format->mSampleRate = 44100;\n format->mFormatFlags = 12;\n\n format->mBytesPerPacket = 4;\n format->mBytesPerFrame = 4;\n format->mBitsPerChannel = 16;\n format->mChannelsPerFrame = 2;\n format->mFramesPerPacket = 1;\n\n format->mReserved = 0;\n}\n\nvoid FillOutputAudioFormat(AudioFormatDescription *format) {\n format->mFormatID = kALACFormatAppleLossless;\n format->mSampleRate = 44100;\n format->mFormatFlags = 1;\n\n format->mBytesPerPacket = 0;\n format->mBytesPerFrame = 0;\n format->mBitsPerChannel = 0;\n format->mChannelsPerFrame = 2;\n format->mFramesPerPacket = kFramesPerPacket;\n\n format->mReserved = 0;\n}\n\nvoid encoder_weak_callback (const WeakCallbackData<Value, const char*>&data) {\n \/\/HandleScope scope;\n \/\/ALACEncoder *encoder = (ALACEncoder *)\n \/\/data[0];\n \/\/delete encoder;\n \/\/wrapper.Dispose();\n \/\/wrapper.Reset();\n}\n\n\/\/ Creates a new encoder instance and wraps it in a JavaScript object.\n\/\/ This encoder is freed when the object is released by the GC.\n\/\/Handle<Value> NewEncoder(const Arguments& args) {\nvoid NewEncoder(const FunctionCallbackInfo<Value>& args) {\n \/\/HandleScope scope;\n Isolate* isolate = Isolate::GetCurrent();\n EscapableHandleScope scope(isolate);\n\n AudioFormatDescription outputFormat;\n FillOutputAudioFormat(&outputFormat);\n\n ALACEncoder *encoder = new ALACEncoder();\n\n encoder->SetFrameSize(kFramesPerPacket);\n encoder->InitializeEncoder(outputFormat);\n\n Local<ObjectTemplate> point_templ = ObjectTemplate::New(isolate);\n point_templ->SetInternalFieldCount(1);\n\n Local<Object> obj = point_templ->NewInstance();\n obj->SetInternalField(0, External::New(isolate, encoder));\n\n args.GetReturnValue().Set(obj);\n}\n\nvoid EncodeALAC(const FunctionCallbackInfo<Value>& args) {\n\/\/Handle<Value> EncodeALAC(const Arguments& args) {\n \/\/HandleScope scope;\n\n Isolate* isolate = Isolate::GetCurrent();\n EscapableHandleScope scope(isolate);\n\n if(args.Length() < 4) {\n printf(\"expected: EncodeALAC(encoder, pcmData, pcmSize, alacData, alacSize)\\n\");\n args.GetReturnValue().Set(Null(isolate));\n }\n\n Local<Object>wrapper = args[0]->ToObject();\n\/\/ ALACEncoder *encoder = (ALACEncoder*)wrapper->GetPointerFromInternalField(0);\n\n ALACEncoder *encoder = (ALACEncoder*)wrapper->GetAlignedPointerFromInternalField(0);\n\n Local<Value> pcmBuffer = args[1];\n unsigned char* pcmData = (unsigned char*)Buffer::Data(pcmBuffer->ToObject());\n\n Local<Value> alacBuffer = args[2];\n unsigned char* alacData = (unsigned char*)Buffer::Data(alacBuffer->ToObject());\n\n int32_t pcmSize = args[3]->Int32Value();\n\n AudioFormatDescription inputFormat, outputFormat;\n FillInputAudioFormat(&inputFormat);\n FillOutputAudioFormat(&outputFormat);\n\n int32_t alacSize = pcmSize;\n encoder->Encode(inputFormat, outputFormat, pcmData, alacData, &alacSize);\n\n \/\/return scope.Close(Integer::New(alacSize));\n args.GetReturnValue().Set(Integer::New(isolate, alacSize));\n}\n\nvoid EncryptAES(const FunctionCallbackInfo<Value>& args) {\n \/\/HandleScope scope;\n Isolate* isolate = v8::Isolate::GetCurrent();\n EscapableHandleScope scope(isolate);\n\n if(args.Length() < 2) {\n printf(\"expected: EncryptAES(alacData, alacSize)\\n\");\n args.GetReturnValue().Set(Null(isolate));\n }\n\n Local<Value> alacBuffer = args[0];\n unsigned char* alacData = (unsigned char*)Buffer::Data(alacBuffer->ToObject());\n int32_t alacSize = args[1]->Int32Value();\n\n \/\/ This will encrypt data in-place\n uint8_t *buf;\n int i = 0, j;\n uint8_t nv[kBlockSize];\n\n aes_context ctx;\n aes_set_key(&ctx, aes_key, 128);\n memcpy(nv, iv, kBlockSize);\n\n while(i + kBlockSize <= alacSize) {\n buf = alacData + i;\n\n for(j = 0; j < kBlockSize; j++)\n buf[j] ^= nv[j];\n\n aes_encrypt(&ctx, buf, buf);\n memcpy(nv, buf, kBlockSize);\n\n i += kBlockSize;\n }\n\n \/\/return scope.Close(Null());\n args.GetReturnValue().Set(Null(isolate));\n}\n\nvoid InitCodec(Handle<Object> target) {\n NODE_SET_METHOD(target, \"encodeALAC\", EncodeALAC);\n NODE_SET_METHOD(target, \"encryptAES\", EncryptAES);\n NODE_SET_METHOD(target, \"newEncoder\", NewEncoder);\n}\n\n} \/\/ nodeairtunes namespace\n<|endoftext|>"} {"text":"<commit_before>#ifndef PYTHONIC_PYTHON_CORE_HPP\n#define PYTHONIC_PYTHON_CORE_HPP\n\n#ifdef ENABLE_PYTHON_MODULE\n\n#include \"Python.h\"\n#include <type_traits>\n#include <utility>\n#include <sstream>\n\n\/\/ Cython still uses the deprecated API, so we can't set this macro in this\n\/\/ case!\n#ifndef CYTHON_ABI\n#define NPY_NO_DEPRECATED_API NPY_1_7_API_VERSION\n#endif\n#include \"numpy\/arrayobject.h\"\n\nPYTHONIC_NS_BEGIN\ntemplate <class T>\nstruct to_python;\n\ntemplate <class T>\nstruct from_python;\nPYTHONIC_NS_END\n\ntemplate <class T>\nauto to_python(T &&value) -> decltype(pythonic::to_python<\n typename std::remove_cv<typename std::remove_reference<T>::type>::type>::\n convert(std::forward<T>(value)))\n{\n return pythonic::to_python<\n typename std::remove_cv<typename std::remove_reference<T>::type>::type>::\n convert(std::forward<T>(value));\n}\ntemplate <class T>\nT from_python(PyObject *obj)\n{\n return pythonic::from_python<T>::convert(obj);\n}\ntemplate <class T>\nbool is_convertible(PyObject *obj)\n{\n return pythonic::from_python<T>::is_convertible(obj);\n}\n\nPYTHONIC_NS_BEGIN\n\nnamespace python\n{\n\n#if PY_MAJOR_VERSION >= 3\n#ifndef PyString_AS_STRING\n#define PyString_AS_STRING (char *) _PyUnicode_COMPACT_DATA\n#endif\n#endif\n\n void PyObject_TypePrettyPrinter(std::ostream &oss, PyObject *obj)\n {\n if (PyTuple_Check(obj)) {\n oss << '(';\n for (long n = PyTuple_GET_SIZE(obj), i = 0; i < n; ++i) {\n PyObject_TypePrettyPrinter(oss, PyTuple_GET_ITEM(obj, i));\n if (i != n - 1)\n oss << \", \";\n }\n oss << ')';\n } else if (PyArray_Check(obj)) {\n auto *arr = (PyArrayObject *)obj;\n auto *descr = PyArray_DESCR(arr);\n auto *dtype = descr->typeobj;\n auto *repr = PyObject_GetAttrString((PyObject *)dtype, \"__name__\");\n oss << PyString_AS_STRING(repr);\n Py_DECREF(repr);\n\n oss << '[';\n for (int i = 0, n = PyArray_NDIM(arr); i < n; ++i) {\n oss << ':';\n if (i != n - 1)\n oss << \", \";\n }\n oss << ']';\n if ((PyArray_FLAGS(arr) & NPY_ARRAY_F_CONTIGUOUS) &&\n ((PyArray_FLAGS(arr) & NPY_ARRAY_C_CONTIGUOUS) == 0) &&\n (PyArray_NDIM(arr) > 1)) {\n oss << \" (with unsupported column-major layout)\";\n } else if (PyArray_BASE(arr)) {\n oss << \" (reshaped)\";\n } else {\n auto const *stride = PyArray_STRIDES(arr);\n auto const *dims = PyArray_DIMS(arr);\n long current_stride = PyArray_ITEMSIZE(arr);\n for (long i = PyArray_NDIM(arr) - 1; i >= 0; i--) {\n if (stride[i] != current_stride) {\n oss << \" (strided)\";\n break;\n }\n current_stride *= dims[i];\n }\n }\n } else if (PyList_Check(obj)) {\n if (PyObject_Not(obj)) {\n oss << \"empty list\";\n } else {\n PyObject_TypePrettyPrinter(oss, PySequence_Fast_GET_ITEM(obj, 0));\n oss << \" list\";\n }\n } else if (PySet_Check(obj)) {\n PyObject *iterator = PyObject_GetIter(obj);\n if (PyObject *item = PyIter_Next(iterator)) {\n PyObject_TypePrettyPrinter(oss, item);\n Py_DECREF(item);\n Py_DECREF(iterator);\n oss << \" set\";\n } else {\n Py_DECREF(iterator);\n oss << \"empty set\";\n }\n } else if (PyDict_Check(obj)) {\n PyObject *key, *value;\n Py_ssize_t pos = 0;\n if (PyDict_Next(obj, &pos, &key, &value)) {\n PyObject_TypePrettyPrinter(oss, key);\n oss << \", \";\n PyObject_TypePrettyPrinter(oss, value);\n oss << \" dict\";\n } else\n oss << \"empty dict\";\n } else {\n auto *repr = PyObject_GetAttrString((PyObject *)Py_TYPE(obj), \"__name__\");\n oss << PyString_AS_STRING(repr);\n Py_DECREF(repr);\n }\n }\n\n std::nullptr_t raise_invalid_argument(char const name[],\n char const alternatives[],\n PyObject *args, PyObject *kwargs)\n {\n std::ostringstream oss;\n oss << \"Invalid call to pythranized function `\" << name << '(';\n for (long n = PyTuple_GET_SIZE(args), i = 0; i < n; ++i) {\n PyObject_TypePrettyPrinter(oss, PyTuple_GET_ITEM(args, i));\n if (i != n - 1 || (kwargs && PyDict_Size(kwargs)))\n oss << \", \";\n }\n\n if (kwargs) {\n PyObject *key, *value;\n Py_ssize_t pos = 0;\n\n for (int next = PyDict_Next(kwargs, &pos, &key, &value); next;) {\n PyObject *vrepr =\n PyObject_GetAttrString((PyObject *)Py_TYPE(value), \"__name__\");\n oss << PyString_AS_STRING(key) << '=' << PyString_AS_STRING(vrepr);\n Py_DECREF(vrepr);\n if ((next = PyDict_Next(kwargs, &pos, &key, &value)))\n oss << \", \";\n }\n }\n\n oss << \")'\\nCandidates are:\\n\" << alternatives << \"\\n\";\n\n PyErr_SetString(PyExc_TypeError, oss.str().c_str());\n return nullptr;\n }\n}\n\nPYTHONIC_NS_END\n\n#endif\n\n#endif\n<commit_msg>Fix bad interaction with python headers on windows<commit_after>#ifndef PYTHONIC_PYTHON_CORE_HPP\n#define PYTHONIC_PYTHON_CORE_HPP\n\n#ifdef ENABLE_PYTHON_MODULE\n\n#include \"Python.h\"\n\/\/ Python defines this for windows, and it's not needed in C++\n#undef copysign\n\n#include <type_traits>\n#include <utility>\n#include <sstream>\n\n\/\/ Cython still uses the deprecated API, so we can't set this macro in this\n\/\/ case!\n#ifndef CYTHON_ABI\n#define NPY_NO_DEPRECATED_API NPY_1_7_API_VERSION\n#endif\n#include \"numpy\/arrayobject.h\"\n\nPYTHONIC_NS_BEGIN\ntemplate <class T>\nstruct to_python;\n\ntemplate <class T>\nstruct from_python;\nPYTHONIC_NS_END\n\ntemplate <class T>\nauto to_python(T &&value) -> decltype(pythonic::to_python<\n typename std::remove_cv<typename std::remove_reference<T>::type>::type>::\n convert(std::forward<T>(value)))\n{\n return pythonic::to_python<\n typename std::remove_cv<typename std::remove_reference<T>::type>::type>::\n convert(std::forward<T>(value));\n}\ntemplate <class T>\nT from_python(PyObject *obj)\n{\n return pythonic::from_python<T>::convert(obj);\n}\ntemplate <class T>\nbool is_convertible(PyObject *obj)\n{\n return pythonic::from_python<T>::is_convertible(obj);\n}\n\nPYTHONIC_NS_BEGIN\n\nnamespace python\n{\n\n#if PY_MAJOR_VERSION >= 3\n#ifndef PyString_AS_STRING\n#define PyString_AS_STRING (char *) _PyUnicode_COMPACT_DATA\n#endif\n#endif\n\n void PyObject_TypePrettyPrinter(std::ostream &oss, PyObject *obj)\n {\n if (PyTuple_Check(obj)) {\n oss << '(';\n for (long n = PyTuple_GET_SIZE(obj), i = 0; i < n; ++i) {\n PyObject_TypePrettyPrinter(oss, PyTuple_GET_ITEM(obj, i));\n if (i != n - 1)\n oss << \", \";\n }\n oss << ')';\n } else if (PyArray_Check(obj)) {\n auto *arr = (PyArrayObject *)obj;\n auto *descr = PyArray_DESCR(arr);\n auto *dtype = descr->typeobj;\n auto *repr = PyObject_GetAttrString((PyObject *)dtype, \"__name__\");\n oss << PyString_AS_STRING(repr);\n Py_DECREF(repr);\n\n oss << '[';\n for (int i = 0, n = PyArray_NDIM(arr); i < n; ++i) {\n oss << ':';\n if (i != n - 1)\n oss << \", \";\n }\n oss << ']';\n if ((PyArray_FLAGS(arr) & NPY_ARRAY_F_CONTIGUOUS) &&\n ((PyArray_FLAGS(arr) & NPY_ARRAY_C_CONTIGUOUS) == 0) &&\n (PyArray_NDIM(arr) > 1)) {\n oss << \" (with unsupported column-major layout)\";\n } else if (PyArray_BASE(arr)) {\n oss << \" (reshaped)\";\n } else {\n auto const *stride = PyArray_STRIDES(arr);\n auto const *dims = PyArray_DIMS(arr);\n long current_stride = PyArray_ITEMSIZE(arr);\n for (long i = PyArray_NDIM(arr) - 1; i >= 0; i--) {\n if (stride[i] != current_stride) {\n oss << \" (strided)\";\n break;\n }\n current_stride *= dims[i];\n }\n }\n } else if (PyList_Check(obj)) {\n if (PyObject_Not(obj)) {\n oss << \"empty list\";\n } else {\n PyObject_TypePrettyPrinter(oss, PySequence_Fast_GET_ITEM(obj, 0));\n oss << \" list\";\n }\n } else if (PySet_Check(obj)) {\n PyObject *iterator = PyObject_GetIter(obj);\n if (PyObject *item = PyIter_Next(iterator)) {\n PyObject_TypePrettyPrinter(oss, item);\n Py_DECREF(item);\n Py_DECREF(iterator);\n oss << \" set\";\n } else {\n Py_DECREF(iterator);\n oss << \"empty set\";\n }\n } else if (PyDict_Check(obj)) {\n PyObject *key, *value;\n Py_ssize_t pos = 0;\n if (PyDict_Next(obj, &pos, &key, &value)) {\n PyObject_TypePrettyPrinter(oss, key);\n oss << \", \";\n PyObject_TypePrettyPrinter(oss, value);\n oss << \" dict\";\n } else\n oss << \"empty dict\";\n } else {\n auto *repr = PyObject_GetAttrString((PyObject *)Py_TYPE(obj), \"__name__\");\n oss << PyString_AS_STRING(repr);\n Py_DECREF(repr);\n }\n }\n\n std::nullptr_t raise_invalid_argument(char const name[],\n char const alternatives[],\n PyObject *args, PyObject *kwargs)\n {\n std::ostringstream oss;\n oss << \"Invalid call to pythranized function `\" << name << '(';\n for (long n = PyTuple_GET_SIZE(args), i = 0; i < n; ++i) {\n PyObject_TypePrettyPrinter(oss, PyTuple_GET_ITEM(args, i));\n if (i != n - 1 || (kwargs && PyDict_Size(kwargs)))\n oss << \", \";\n }\n\n if (kwargs) {\n PyObject *key, *value;\n Py_ssize_t pos = 0;\n\n for (int next = PyDict_Next(kwargs, &pos, &key, &value); next;) {\n PyObject *vrepr =\n PyObject_GetAttrString((PyObject *)Py_TYPE(value), \"__name__\");\n oss << PyString_AS_STRING(key) << '=' << PyString_AS_STRING(vrepr);\n Py_DECREF(vrepr);\n if ((next = PyDict_Next(kwargs, &pos, &key, &value)))\n oss << \", \";\n }\n }\n\n oss << \")'\\nCandidates are:\\n\" << alternatives << \"\\n\";\n\n PyErr_SetString(PyExc_TypeError, oss.str().c_str());\n return nullptr;\n }\n}\n\nPYTHONIC_NS_END\n\n#endif\n\n#endif\n<|endoftext|>"} {"text":"<commit_before>\/* BSD 2-Clause License\n\nCopyright (c) 2016, Doi Yusuke\nAll rights reserved.\n\nRedistribution and use in source and binary forms, with or without\nmodification, are permitted provided that the following conditions are met:\n\n* Redistributions of source code must retain the above copyright notice, this\n list of conditions and the following disclaimer.\n\n* Redistributions in binary form must reproduce the above copyright notice,\n this list of conditions and the following disclaimer in the documentation\n and\/or other materials provided with the distribution.\n\nTHIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS \"AS IS\"\nAND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE\nIMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE\nDISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE\nFOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL\nDAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR\nSERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER\nCAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,\nOR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE\nOF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.\n*\/\n#include <cstring> \/\/ for memset\n#include <sstream> \/\/ for error massage\n#include <stdexcept>\n#include <unordered_map> \/\/ for cashe\n#include <fcntl.h> \/\/ for open FLAGS\n#include <unistd.h> \/\/ for tty checks\n\n#include \"core.h\"\n\nics::Core::Core(const std::string& path, speed_t baudrate)\n: fd {open(path.c_str(), O_RDWR | O_NOCTTY)},\n oldTio {}\n{\n if (fd < 0)\n throw std::runtime_error {\"Cannot open deveice\"};\n try {\n if (!isatty(fd))\n throw std::invalid_argument {\"Not tty device\"};\n if (tcgetattr(fd, &oldTio) < 0)\n throw std::runtime_error {\"Cannot setup tty\"};\n auto newTio = getTermios(); \/\/ forward reference\n if (cfsetispeed(&newTio, baudrate) < 0)\n throw std::runtime_error {\"Cannot set baudrate\"};\n if (cfsetospeed(&newTio, baudrate) < 0)\n throw std::runtime_error {\"Cannot set baudrate\"};\n if (tcsetattr(fd, TCSANOW, &newTio) < 0)\n throw std::runtime_error {\"Cannot setup tty\"};\n } catch (...) {\n close(fd);\n throw;\n }\n}\n\nics::Core::~Core() noexcept\n{\n if (fd < 0) return;\n closeThis();\n}\n\nics::Core::Core(Core&& rhs) noexcept\n: fd {rhs.fd},\n oldTio(rhs.oldTio) \/\/ for Ubuntu14.04 compiler\n{\n rhs.fd = -1;\n}\n\nics::Core& ics::Core::operator=(Core&& rhs) noexcept\n{\n if (fd != rhs.fd) {\n closeThis();\n fd = rhs.fd;\n oldTio = rhs.oldTio;\n rhs.fd = -1;\n }\n return *this;\n}\n\nstd::shared_ptr<ics::Core> ics::Core::getCore(const std::string& path, speed_t baudrate)\n{\n static std::unordered_map<std::string, std::weak_ptr<Core>> cache;\n auto objPtr = cache[path].lock(); \/\/ try get\n for (const auto& data : cache) if (data.second.expired()) cache.erase(data.first); \/\/ clean cashe\n if (!objPtr) { \/\/ get failed\n objPtr = std::make_shared<Core>(path, baudrate);\n cache[path] = objPtr;\n }\n return objPtr;\n}\n\nvoid ics::Core::communicate(const Container& tx, Container& rx)\n{\n write(fd, tx.data(), tx.size()); \/\/ send\n for (auto& receive : rx) read(fd, &receive, 1); \/\/ receive\n\/\/ check section\n auto receive = rx.cbegin();\n for (const auto& send : tx) {\n if (send != *receive) {\n std::stringstream ss;\n ss << \"Receive falied(loopback):\" << receive - rx.cbegin() << ':' << static_cast<int>(send) << \"<->\" << static_cast<int>(*receive);\n throw std::runtime_error {ss.str()};\n }\n ++receive;\n }\n if ((tx[0] & 0x7F) != *receive) throw std::runtime_error {\"Receive failed: invalid target data\"};\n}\n\nvoid ics::Core::communicateID(const IDContainerTx& tx, IDContainerRx& rx)\n{\n write(fd, tx.data(), tx.size()); \/\/ send\n for (auto& receive : rx) read(fd, &receive, 1); \/\/ receive\n\/\/ check section\n auto receive = rx.cbegin();\n for (const auto& send : tx) {\n if (send != *receive) {\n std::stringstream ss;\n ss << \"Receive falied(loopback):\" << receive - rx.cbegin() << ':' << static_cast<int>(send) << \"<->\" << static_cast<int>(*receive);\n throw std::runtime_error {ss.str()};\n }\n ++receive;\n }\n if ((tx[0] & 0xE0) != (*receive & 0xE0)) throw std::runtime_error {\"Receive failed: invalid target data\"};\n}\n\nvoid ics::Core::closeThis() const noexcept\n{\n tcsetattr(fd, TCSANOW, &oldTio);\n close(fd);\n}\n\ntermios ics::Core::getTermios() noexcept\n{\n termios newTio;\n std::memset(&newTio, 0, sizeof(newTio));\n newTio.c_iflag = 0;\n newTio.c_oflag = 0;\n newTio.c_cflag = CS8 | CREAD | CLOCAL | PARENB;\n newTio.c_lflag = 0;\n newTio.c_cc[VMIN] = 1;\n newTio.c_cc[VTIME] = 1;\n return newTio;\n}\n<commit_msg>Remove check R_CMD for id:0 motor<commit_after>\/* BSD 2-Clause License\n\nCopyright (c) 2016, Doi Yusuke\nAll rights reserved.\n\nRedistribution and use in source and binary forms, with or without\nmodification, are permitted provided that the following conditions are met:\n\n* Redistributions of source code must retain the above copyright notice, this\n list of conditions and the following disclaimer.\n\n* Redistributions in binary form must reproduce the above copyright notice,\n this list of conditions and the following disclaimer in the documentation\n and\/or other materials provided with the distribution.\n\nTHIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS \"AS IS\"\nAND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE\nIMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE\nDISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE\nFOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL\nDAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR\nSERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER\nCAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,\nOR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE\nOF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.\n*\/\n#include <cstring> \/\/ for memset\n#include <sstream> \/\/ for error massage\n#include <stdexcept>\n#include <unordered_map> \/\/ for cashe\n#include <fcntl.h> \/\/ for open FLAGS\n#include <unistd.h> \/\/ for tty checks\n\n#include \"core.h\"\n\nics::Core::Core(const std::string& path, speed_t baudrate)\n: fd {open(path.c_str(), O_RDWR | O_NOCTTY)},\n oldTio {}\n{\n if (fd < 0)\n throw std::runtime_error {\"Cannot open deveice\"};\n try {\n if (!isatty(fd))\n throw std::invalid_argument {\"Not tty device\"};\n if (tcgetattr(fd, &oldTio) < 0)\n throw std::runtime_error {\"Cannot setup tty\"};\n auto newTio = getTermios(); \/\/ forward reference\n if (cfsetispeed(&newTio, baudrate) < 0)\n throw std::runtime_error {\"Cannot set baudrate\"};\n if (cfsetospeed(&newTio, baudrate) < 0)\n throw std::runtime_error {\"Cannot set baudrate\"};\n if (tcsetattr(fd, TCSANOW, &newTio) < 0)\n throw std::runtime_error {\"Cannot setup tty\"};\n } catch (...) {\n close(fd);\n throw;\n }\n}\n\nics::Core::~Core() noexcept\n{\n if (fd < 0) return;\n closeThis();\n}\n\nics::Core::Core(Core&& rhs) noexcept\n: fd {rhs.fd},\n oldTio(rhs.oldTio) \/\/ for Ubuntu14.04 compiler\n{\n rhs.fd = -1;\n}\n\nics::Core& ics::Core::operator=(Core&& rhs) noexcept\n{\n if (fd != rhs.fd) {\n closeThis();\n fd = rhs.fd;\n oldTio = rhs.oldTio;\n rhs.fd = -1;\n }\n return *this;\n}\n\nstd::shared_ptr<ics::Core> ics::Core::getCore(const std::string& path, speed_t baudrate)\n{\n static std::unordered_map<std::string, std::weak_ptr<Core>> cache;\n auto objPtr = cache[path].lock(); \/\/ try get\n for (const auto& data : cache) if (data.second.expired()) cache.erase(data.first); \/\/ clean cashe\n if (!objPtr) { \/\/ get failed\n objPtr = std::make_shared<Core>(path, baudrate);\n cache[path] = objPtr;\n }\n return objPtr;\n}\n\nvoid ics::Core::communicate(const Container& tx, Container& rx)\n{\n write(fd, tx.data(), tx.size()); \/\/ send\n for (auto& receive : rx) read(fd, &receive, 1); \/\/ receive\n\/\/ check section\n auto receive = rx.cbegin();\n for (const auto& send : tx) {\n if (send != *receive) {\n std::stringstream ss;\n ss << \"Receive falied(loopback):\" << receive - rx.cbegin() << ':' << static_cast<int>(send) << \"<->\" << static_cast<int>(*receive);\n throw std::runtime_error {ss.str()};\n }\n ++receive;\n }\n}\n\nvoid ics::Core::communicateID(const IDContainerTx& tx, IDContainerRx& rx)\n{\n write(fd, tx.data(), tx.size()); \/\/ send\n for (auto& receive : rx) read(fd, &receive, 1); \/\/ receive\n\/\/ check section\n auto receive = rx.cbegin();\n for (const auto& send : tx) {\n if (send != *receive) {\n std::stringstream ss;\n ss << \"Receive falied(loopback):\" << receive - rx.cbegin() << ':' << static_cast<int>(send) << \"<->\" << static_cast<int>(*receive);\n throw std::runtime_error {ss.str()};\n }\n ++receive;\n }\n if ((tx[0] & 0xE0) != (*receive & 0xE0)) throw std::runtime_error {\"Receive failed: invalid target data\"};\n}\n\nvoid ics::Core::closeThis() const noexcept\n{\n tcsetattr(fd, TCSANOW, &oldTio);\n close(fd);\n}\n\ntermios ics::Core::getTermios() noexcept\n{\n termios newTio;\n std::memset(&newTio, 0, sizeof(newTio));\n newTio.c_iflag = 0;\n newTio.c_oflag = 0;\n newTio.c_cflag = CS8 | CREAD | CLOCAL | PARENB;\n newTio.c_lflag = 0;\n newTio.c_cc[VMIN] = 1;\n newTio.c_cc[VTIME] = 1;\n return newTio;\n}\n<|endoftext|>"} {"text":"<commit_before>#pragma once\n\ntemplate <typename T>\nclass Buffer\n{\npublic:\n\tusing SizeType = unsigned long;\n\nprivate:\n\tT* data;\n\tSizeType count;\n\t\npublic:\n\tBuffer(): data(nullptr), count(0)\n\t{\n\t}\n\n\tBuffer(const Buffer& other): data(nullptr), count(0)\n\t{\n\t\tthis->operator=(other);\n\t}\n\n\tBuffer(Buffer&& other): data(other.data), count(other.count)\n\t{\n\t\tother.data = nullptr;\n\t\tother.count = 0;\n\t}\n\n\t~Buffer()\n\t{\n\t\t\/\/ Deleting a nullptr is a no-op\n\t\tdelete[] this->data;\n\t}\n\n\tBuffer& operator=(const Buffer& other)\n\t{\n\t\tif (this != &other)\n\t\t{\n\t\t\tif (other.data != nullptr && other.count > 0)\n\t\t\t{\n\t\t\t\tthis->Allocate(other.count);\n\n\t\t\t\tfor (SizeType i = 0; i < this->count; ++i)\n\t\t\t\t\tdata[i] = other.data[i];\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\tthis->data = nullptr;\n\t\t\t\tthis->count = 0;\n\t\t\t}\n\t\t}\n\n\t\treturn *this;\n\t}\n\n\tBuffer& operator=(Buffer&& other)\n\t{\n\t\t\/\/ Deleting a nullptr is a no-op\n\t\tdelete[] this->data;\n\n\t\tthis->data = other.data;\n\t\tthis->count = other.count;\n\n\t\tother.data = nullptr;\n\t\tother.count = 0;\n\n\t\treturn *this;\n\t}\n\t\n\tvoid Allocate(SizeType count)\n\t{\n\t\t\/\/ Deleting a nullptr is a no-op\n\t\tdelete[] this->data;\n\n\t\tthis->count = count;\n\n\t\tif (count > 0)\n\t\t\tthis->data = new T[count];\n\t\telse\n\t\t\tthis->data = nullptr;\n\t}\n\t\n\tvoid Deallocate()\n\t{\n\t\t\/\/ Deleting a nullptr is a no-op\n\t\tdelete[] this->data;\n\t\t\n\t\tthis->data = nullptr;\n\t\tthis->count = 0;\n\t}\n\n\tbool IsValid() { return this->data != nullptr; }\n\t\n\tT* Data() { return this->data; }\n\tconst T* Data() const { return this->data; }\n\tSizeType Count() const { return this->count; }\n\t\n\tT& operator[](SizeType index) { return this->data[index]; }\n\tconst T& operator[](SizeType index) const { return this->data[index]; }\n};\n<commit_msg>Buffer class can return a BufferRef instance<commit_after>#pragma once\n\n#include \"BufferRef.hpp\"\n\ntemplate <typename T>\nclass Buffer\n{\npublic:\n\tusing SizeType = unsigned long;\n\nprivate:\n\tT* data;\n\tSizeType count;\n\t\npublic:\n\tBuffer(): data(nullptr), count(0)\n\t{\n\t}\n\n\tBuffer(const Buffer& other): data(nullptr), count(0)\n\t{\n\t\tthis->operator=(other);\n\t}\n\n\tBuffer(Buffer&& other): data(other.data), count(other.count)\n\t{\n\t\tother.data = nullptr;\n\t\tother.count = 0;\n\t}\n\n\t~Buffer()\n\t{\n\t\t\/\/ Deleting a nullptr is a no-op\n\t\tdelete[] this->data;\n\t}\n\n\tBuffer& operator=(const Buffer& other)\n\t{\n\t\tif (this != &other)\n\t\t{\n\t\t\tif (other.data != nullptr && other.count > 0)\n\t\t\t{\n\t\t\t\tthis->Allocate(other.count);\n\n\t\t\t\tfor (SizeType i = 0; i < this->count; ++i)\n\t\t\t\t\tdata[i] = other.data[i];\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\tthis->data = nullptr;\n\t\t\t\tthis->count = 0;\n\t\t\t}\n\t\t}\n\n\t\treturn *this;\n\t}\n\n\tBuffer& operator=(Buffer&& other)\n\t{\n\t\t\/\/ Deleting a nullptr is a no-op\n\t\tdelete[] this->data;\n\n\t\tthis->data = other.data;\n\t\tthis->count = other.count;\n\n\t\tother.data = nullptr;\n\t\tother.count = 0;\n\n\t\treturn *this;\n\t}\n\t\n\tvoid Allocate(SizeType count)\n\t{\n\t\t\/\/ Deleting a nullptr is a no-op\n\t\tdelete[] this->data;\n\n\t\tthis->count = count;\n\n\t\tif (count > 0)\n\t\t\tthis->data = new T[count];\n\t\telse\n\t\t\tthis->data = nullptr;\n\t}\n\t\n\tvoid Deallocate()\n\t{\n\t\t\/\/ Deleting a nullptr is a no-op\n\t\tdelete[] this->data;\n\t\t\n\t\tthis->data = nullptr;\n\t\tthis->count = 0;\n\t}\n\n\tbool IsValid() { return this->data != nullptr; }\n\t\n\tT* Data() { return this->data; }\n\tconst T* Data() const { return this->data; }\n\tSizeType Count() const { return this->count; }\n\t\n\tT& operator[](SizeType index) { return this->data[index]; }\n\tconst T& operator[](SizeType index) const { return this->data[index]; }\n\n\tBufferRef<T> GetRef() { return BufferRef<T>(data, count); }\n\tBufferRef<const T> GetRef() const { return BufferRef<const T>(data, count); }\n};\n<|endoftext|>"} {"text":"<commit_before>\/*-\n * Copyright (C) 2008-2009 by Maxim Ignatenko\n * gelraen.ua@gmail.com\n *\n * All rights reserved. *\n * *\n * Redistribution and use in source and binary forms, with or without *\n * modification, are permitted provided that the following conditions *\n * are met: *\n * * Redistributions of source code must retain the above copyright *\n * notice, this list of conditions and the following disclaimer. *\n * * Redistributions in binary form must reproduce the above copyright *\n * notice, this list of conditions and the following disclaimer in *\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 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 * $Id$\n *\/\n\n#include \"defs.h\"\n#include <string>\n#include <cctype>\n#include <errno.h>\n#include <string.h>\n#include <time.h>\n#include <fstream>\n\nusing namespace std;\n\nunsigned long LogLevel=0;\nofstream logfile;\n\ntypedef void (*log_f)(int, const string&);\n\nvoid log_stderr(int n,const string& str)\n{\n\ttm t;\n\ttime_t tt=time(NULL);\n\tlocaltime_r(&tt,&t);\n\tchar buf[256]={0};\n\tstrftime(buf,256,\"%F %T: \",&t);\n\tcerr << buf << str << endl;\n}\n\nvoid log_file(int n, const string& str)\n{\n\ttm t;\n\ttime_t tt=time(NULL);\n\tlocaltime_r(&tt,&t);\n\tchar buf[256]={0};\n\tstrftime(buf,256,\"%F %T: \",&t);\n\tlogfile << buf << str << endl;\n}\n\nvoid log_syslog(int n, const string& str)\n{\n\tint sysloglevel =\n\t\t\t(n==log::error) ? LOG_ERR :\n\t\t\t(n==log::warning) ? LOG_WARNING :\n\t\t\t(n==log::notice) ? LOG_NOTICE :\n\t\t\t(n==log::rawdata) ? LOG_DEBUG :\n\t\t\t(n==log::state || n==log::command) ? LOG_INFO :\n\t\t\tLOG_ERR;\n\tsyslog(LOG_DAEMON | sysloglevel, str.c_str());\n}\n\nlog_f logger=log_stderr;\n\nstring trim(string str, const char ch)\n{\n\tstr.erase(0, str.find_first_not_of(ch));\n\tstr.erase(str.find_last_not_of(ch)+1);\n\treturn str;\n}\n\nbool initlog(bool usesyslog,const string& filename)\n{\n\tif (usesyslog)\n\t{\n\t\tlogger=log_syslog;\n\t}\n\telse\n\t{\n\t\tlogfile.open(filename.c_str(),ios::app);\n\t\tif (!logfile) return false;\n\t\tlogger=log_file;\n\t}\n\treturn true;\n}\n\nvoid LOG(int n,const string& str, bool explainErrno)\n{\n\tif ((n)&LogLevel)\n\t{\n\t\tstring errnoMessage = explainErrno? \": \"+string(strerror(errno)) : \"\";\n\t\tlogger(n,str+errnoMessage);\n\t}\n}\n\n<commit_msg>Reopen logfile on SIGHUP<commit_after>\/*-\n * Copyright (C) 2008-2009 by Maxim Ignatenko\n * gelraen.ua@gmail.com\n *\n * All rights reserved. *\n * *\n * Redistribution and use in source and binary forms, with or without *\n * modification, are permitted provided that the following conditions *\n * are met: *\n * * Redistributions of source code must retain the above copyright *\n * notice, this list of conditions and the following disclaimer. *\n * * Redistributions in binary form must reproduce the above copyright *\n * notice, this list of conditions and the following disclaimer in *\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 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 * $Id$\n *\/\n\n#include \"defs.h\"\n#include <string>\n#include <cctype>\n#include <errno.h>\n#include <string.h>\n#include <time.h>\n#include <fstream>\n#include <signal.h>\n\nusing namespace std;\n\nunsigned long LogLevel=0;\nofstream logfile;\nstring logname;\n\nvoid reopen_log(int)\n{\n\tlogfile.close();\n\tlogfile.open(logname.c_str(),ios::app);\n\t\/\/ what should we do if log not reopened correctly?\n\tsignal(SIGHUP,reopen_log);\n}\n\ntypedef void (*log_f)(int, const string&);\n\nvoid log_stderr(int n,const string& str)\n{\n\ttm t;\n\ttime_t tt=time(NULL);\n\tlocaltime_r(&tt,&t);\n\tchar buf[256]={0};\n\tstrftime(buf,256,\"%F %T: \",&t);\n\tcerr << buf << str << endl;\n}\n\nvoid log_file(int n, const string& str)\n{\n\ttm t;\n\ttime_t tt=time(NULL);\n\tlocaltime_r(&tt,&t);\n\tchar buf[256]={0};\n\tstrftime(buf,256,\"%F %T: \",&t);\n\tlogfile << buf << str << endl;\n}\n\nvoid log_syslog(int n, const string& str)\n{\n\tint sysloglevel =\n\t\t\t(n==log::error) ? LOG_ERR :\n\t\t\t(n==log::warning) ? LOG_WARNING :\n\t\t\t(n==log::notice) ? LOG_NOTICE :\n\t\t\t(n==log::rawdata) ? LOG_DEBUG :\n\t\t\t(n==log::state || n==log::command) ? LOG_INFO :\n\t\t\tLOG_ERR;\n\tsyslog(LOG_DAEMON | sysloglevel, str.c_str());\n}\n\nlog_f logger=log_stderr;\n\nstring trim(string str, const char ch)\n{\n\tstr.erase(0, str.find_first_not_of(ch));\n\tstr.erase(str.find_last_not_of(ch)+1);\n\treturn str;\n}\n\nbool initlog(bool usesyslog,const string& filename)\n{\n\tif (usesyslog)\n\t{\n\t\tlogger=log_syslog;\n\t}\n\telse\n\t{\n\t\tlogfile.open(filename.c_str(),ios::app);\n\t\tif (!logfile) return false;\n\t\tlogname=filename;\n\t\tlogger=log_file;\n\t\tsignal(SIGHUP,reopen_log);\n\t}\n\treturn true;\n}\n\nvoid LOG(int n,const string& str, bool explainErrno)\n{\n\tif ((n)&LogLevel)\n\t{\n\t\tstring errnoMessage = explainErrno? \": \"+string(strerror(errno)) : \"\";\n\t\tlogger(n,str+errnoMessage);\n\t}\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_GENERICOBJECT_HXX_\n#define _QITYPE_DETAILS_GENERICOBJECT_HXX_\n\n#include <qi\/future.hpp>\n#include <qitype\/typeinterface.hpp>\n#include <qitype\/typeobject.hpp>\n#include <qitype\/details\/typeimpl.hxx>\n#include <qitype\/objecttypebuilder.hpp>\n\nQI_REGISTER_TEMPLATE_OBJECT(qi::Future , _connect, isFinished, value, wait, isRunning, isCanceled, hasError, error);\nQI_REGISTER_TEMPLATE_OBJECT(qi::FutureSync, _connect, isFinished, value, wait, isRunning, isCanceled, hasError, error, async);\n\nnamespace qi {\n\n namespace detail\n {\n\n template<typename T> void hold(T data) {}\n\n template <typename T>\n void futureAdapterGeneric(AnyReference val, qi::Promise<T> promise)\n {\n TemplateTypeInterface* ft1 = QI_TEMPLATE_TYPE_GET(val.type, Future);\n TemplateTypeInterface* ft2 = QI_TEMPLATE_TYPE_GET(val.type, FutureSync);\n TemplateTypeInterface* futureType = ft1 ? ft1 : ft2;\n ObjectTypeInterface* onext = dynamic_cast<ObjectTypeInterface*>(futureType->next());\n GenericObject gfut(onext, val.value);\n if (gfut.call<bool>(\"hasError\", 0))\n {\n promise.setError(gfut.call<std::string>(\"error\", 0));\n return;\n }\n AnyValue v = gfut.call<AnyValue>(\"value\", 0);\n promise.setValue(v.to<T>());\n val.destroy();\n }\n\n template <typename T>\n inline void futureAdapter(qi::Future<qi::AnyReference> metaFut, qi::Promise<T> promise)\n {\n\n \/\/error handling\n if (metaFut.hasError()) {\n promise.setError(metaFut.error());\n return;\n }\n\n AnyReference val = metaFut.value();\n TemplateTypeInterface* ft1 = QI_TEMPLATE_TYPE_GET(val.type, Future);\n TemplateTypeInterface* ft2 = QI_TEMPLATE_TYPE_GET(val.type, FutureSync);\n TemplateTypeInterface* futureType = ft1 ? ft1 : ft2;\n if (futureType)\n {\n TypeInterface* next = futureType->next();\n ObjectTypeInterface* onext = dynamic_cast<ObjectTypeInterface*>(next);\n GenericObject gfut(onext, val.value);\n boost::function<void()> cb = boost::bind(futureAdapterGeneric<T>, val, promise);\n gfut.call<void>(\"_connect\", cb);\n return;\n }\n TypeInterface* targetType = typeOf<T>();\n try\n {\n std::pair<AnyReference, bool> conv = val.convert(targetType);\n if (!conv.first.type)\n promise.setError(std::string(\"Unable to convert call result to target type:\")\n + val.type->infoString() + \" -> \" + targetType->infoString());\n else\n {\n T* res = (T*)conv.first.type->ptrFromStorage(&conv.first.value);\n promise.setValue(*res);\n }\n if (conv.second)\n conv.first.destroy();\n }\n catch(const std::exception& e)\n {\n promise.setError(std::string(\"Return argument conversion error: \") + e.what());\n }\n val.destroy();\n }\n\n template <typename T>\n inline void futureAdapterVal(qi::Future<qi::AnyValue> metaFut, qi::Promise<T> promise)\n {\n \/\/error handling\n if (metaFut.hasError()) {\n promise.setError(metaFut.error());\n return;\n }\n const AnyValue& val = metaFut.value();\n try\n {\n promise.setValue(val.to<T>());\n }\n catch (const std::exception& e)\n {\n promise.setError(std::string(\"Return argument conversion error: \") + e.what());\n }\n }\n\n template<>\n inline void futureAdapterVal(qi::Future<qi::AnyValue> metaFut, qi::Promise<AnyValue> promise)\n {\n if (metaFut.hasError())\n promise.setError(metaFut.error());\n else\n promise.setValue(metaFut.value());\n }\n\n template <>\n inline void futureAdapter<void>(qi::Future<qi::AnyReference> metaFut, qi::Promise<void> promise)\n {\n \/\/error handling\n if (metaFut.hasError()) {\n promise.setError(metaFut.error());\n return;\n }\n promise.setValue(0);\n }\n\n }\n\n\n \/* Generate qi::FutureSync<R> GenericObject::call(methodname, args...)\n * for all argument counts\n * The function packs arguments in a vector<AnyReference>, computes the\n * signature and bounce those to metaCall.\n *\/\n #define pushi(z, n,_) params.push_back(p ## n);\n#define genCall(n, ATYPEDECL, ATYPES, ADECL, AUSE, comma) \\\n template<typename R> qi::FutureSync<R> GenericObject::call( \\\n const std::string& methodName comma \\\n QI_GEN_ARGSDECLSAMETYPE(n, qi::AutoAnyReference)) \\\n { \\\n if (!value || !type) { \\\n return makeFutureError<R>(\"Invalid GenericObject\"); \\\n } \\\n std::vector<qi::AnyReference> params; \\\n params.reserve(n); \\\n BOOST_PP_REPEAT(n, pushi, _) \\\n std::string sigret; \\\n qi::Promise<R> res; \\\n qi::Future<AnyReference> fmeta = metaCall(methodName, params); \\\n fmeta.connect(boost::bind<void>(&detail::futureAdapter<R>, _1, res)); \\\n return res.future(); \\\n }\n\n QI_GEN(genCall)\n #undef genCall\n #define genCall(n, ATYPEDECL, ATYPES, ADECL, AUSE, comma) \\\n template<typename R> qi::FutureSync<R> GenericObject::async( \\\n const std::string& methodName comma \\\n QI_GEN_ARGSDECLSAMETYPE(n, qi::AutoAnyReference)) \\\n { \\\n if (!value || !type) { \\\n return makeFutureError<R>(\"Invalid GenericObject\"); \\\n } \\\n std::vector<qi::AnyReference> params; \\\n params.reserve(n); \\\n BOOST_PP_REPEAT(n, pushi, _) \\\n std::string sigret; \\\n qi::Promise<R> res; \\\n qi::Future<AnyReference> fmeta = metaCall(methodName, params, MetaCallType_Queued); \\\n fmeta.connect(boost::bind<void>(&detail::futureAdapter<R>, _1, res)); \\\n return res.future(); \\\n }\n\n QI_GEN(genCall)\n #undef genCall\n #define genCall(n, ATYPEDECL, ATYPES, ADECL, AUSE, comma) \\\n template<typename R> qi::FutureSync<R> GenericObject::call( \\\n MetaCallType callType, \\\n const std::string& methodName comma \\\n QI_GEN_ARGSDECLSAMETYPE(n, qi::AutoAnyReference)) \\\n { \\\n if (!value || !type) { \\\n return makeFutureError<R>(\"Invalid GenericObject\"); \\\n } \\\n std::vector<qi::AnyReference> params; \\\n params.reserve(n); \\\n BOOST_PP_REPEAT(n, pushi, _) \\\n std::string sigret; \\\n qi::Promise<R> res; \\\n qi::Future<AnyReference> fmeta = metaCall(methodName, params, callType); \\\n fmeta.connect(boost::bind<void>(&detail::futureAdapter<R>, _1, res)); \\\n return res.future(); \\\n }\n\n QI_GEN(genCall)\n #undef genCall\n\n #define genCall(n, ATYPEDECL, ATYPES, ADECL, AUSE, comma) \\\n template<typename R,typename T> qi::FutureSync<R> async( \\\n T* instance, \\\n const std::string& methodName comma \\\n QI_GEN_ARGSDECLSAMETYPE(n, qi::AutoAnyReference)) \\\n { \\\n AnyObject obj = AnyReference(instance).toObject(); \\\n qi::Future<R> res = obj->call<R>(MetaCallType_Queued, methodName comma AUSE); \\\n res.connect(boost::bind(&detail::hold<AnyObject>, obj)); \\\n return res; \\\n }\n QI_GEN(genCall)\n #undef genCall\n\n #define genCall(n, ATYPEDECL, ATYPES, ADECL, AUSE, comma) \\\n template<typename R,typename T> qi::FutureSync<R> async( \\\n boost::shared_ptr<T> instance, \\\n const std::string& methodName comma \\\n QI_GEN_ARGSDECLSAMETYPE(n, qi::AutoAnyReference)) \\\n { \\\n AnyObject obj = AnyReference(instance).toObject(); \\\n qi::Future<R> res = obj->call<R>(MetaCallType_Queued, methodName comma AUSE); \\\n res.connect(boost::bind(&detail::hold<AnyObject>, obj)); \\\n return res; \\\n }\n QI_GEN(genCall)\n #undef genCall\n #undef pushi\n\n template<typename T>\n qi::FutureSync<T> GenericObject::property(const std::string& name)\n {\n int pid = metaObject().propertyId(name);\n if (pid < 0)\n return makeFutureError<T>(\"Property not found\");\n qi::Future<AnyValue> f = type->property(value, pid);\n qi::Promise<T> p;\n f.connect(boost::bind(&detail::futureAdapterVal<T>,_1, p));\n return p.future();\n }\n\n template<typename T>\n qi::FutureSync<void> GenericObject::setProperty(const std::string& name, const T& val)\n {\n int pid = metaObject().propertyId(name);\n if (pid < 0)\n return makeFutureError<void>(\"Property not found\");\n return type->setProperty(value, pid, AnyValue(AnyReference(val)));\n }\n\n \/* An AnyObject is actually of a Dynamic type: The underlying TypeInterface*\n * is not allways the same.\n *\/\n template<> class QITYPE_API TypeImpl<AnyObject>: public DynamicTypeInterface\n {\n public:\n virtual AnyReference get(void* storage)\n {\n AnyObject* val = (AnyObject*)ptrFromStorage(&storage);\n AnyReference result;\n if (!*val)\n {\n return AnyReference();\n }\n result.type = (*val)->type;\n result.value = (*val)->value;\n return result;\n }\n\n virtual void set(void** storage, AnyReference source)\n {\n qiLogCategory(\"qitype.object\");\n AnyObject* val = (AnyObject*)ptrFromStorage(storage);\n TemplateTypeInterface* templ = dynamic_cast<TemplateTypeInterface*>(source.type);\n if (templ)\n source.type = templ->next();\n if (source.type->info() == info())\n { \/\/ source is objectptr\n AnyObject* src = (AnyObject*)source.type->ptrFromStorage(&source.value);\n if (!*src)\n qiLogWarning() << \"NULL AnyObject\";\n *val = *src;\n }\n else if (source.kind() == TypeKind_Dynamic)\n { \/\/ try to dereference dynamic type in case it contains an object\n set(storage, source.asDynamic());\n }\n else if (source.kind() == TypeKind_Object)\n { \/\/ wrap object in objectptr: we do not keep it alive,\n \/\/ but source type offers no tracking capability\n AnyObject op(new GenericObject(static_cast<ObjectTypeInterface*>(source.type), source.value));\n *val = op;\n }\n else if (source.kind() == TypeKind_Pointer)\n {\n PointerTypeInterface* ptype = static_cast<PointerTypeInterface*>(source.type);\n \/\/ FIXME: find a way!\n if (ptype->pointerKind() == PointerTypeInterface::Shared)\n qiLogInfo() << \"AnyObject will *not* track original shared pointer\";\n set(storage, *source);\n }\n else\n throw std::runtime_error((std::string)\"Cannot assign non-object \" + source.type->infoString() + \" to AnyObject\");\n\n }\n typedef DefaultTypeImplMethods<AnyObject> Methods;\n _QI_BOUNCE_TYPE_METHODS(Methods);\n };\n\n namespace detail\n {\n typedef std::map<TypeInfo, boost::function<AnyReference(AnyObject)> > ProxyGeneratorMap;\n QITYPE_API ProxyGeneratorMap& proxyGeneratorMap();\n\n template<typename Proxy>\n AnyReference makeProxy(AnyObject ptr)\n {\n boost::shared_ptr<Proxy> sp(new Proxy(ptr));\n return AnyReference(sp).clone();\n }\n }\n template<typename Proxy, typename Interface>\n bool registerProxyInterface()\n {\n detail::ProxyGeneratorMap& map = detail::proxyGeneratorMap();\n map[typeOf<Interface>()->info()] = &detail::makeProxy<Proxy>;\n return true;\n }\n template<typename Proxy>\n bool registerProxy()\n {\n detail::ProxyGeneratorMap& map = detail::proxyGeneratorMap();\n map[typeOf<Proxy>()->info()] = &detail::makeProxy<Proxy>;\n return true;\n }\n\n namespace detail\n {\n \/* Factory helper functions\n *\/\n\n \/\/ create a T, wrap in a AnyObject\n template<typename T> AnyObject constructObject()\n {\n return AnyReference::fromPtr(new T()).toObject();\n }\n\n \/\/ in genericobjectbuilder.hxx\n template<typename T> AnyObject makeObject(const std::string& fname, T func);\n\n \/\/ Create a factory function for an object with one method functionName bouncing to func\n template<typename T> boost::function<AnyObject(const std::string&)>\n makeObjectFactory(const std::string functionName, T func)\n {\n return ( boost::function<AnyObject(const std::string&)>)\n boost::bind(&makeObject<T>, functionName, func);\n }\n }\n}\nQI_TYPE_STRUCT(qi::MethodStatistics, cumulatedTime, minTime, maxTime, count);\nQI_TYPE_STRUCT(qi::EventTrace, id, kind, slotId, arguments, timestamp);\nQI_TYPE_STRUCT(qi::os::timeval, tv_sec, tv_usec);\n#endif \/\/ _QITYPE_DETAILS_GENERICOBJECT_HXX_\n<commit_msg>FutureAdapter: Optimize.<commit_after>#pragma once\n\/*\n** Copyright (C) 2012 Aldebaran Robotics\n** See COPYING for the license\n*\/\n\n#ifndef _QITYPE_DETAILS_GENERICOBJECT_HXX_\n#define _QITYPE_DETAILS_GENERICOBJECT_HXX_\n\n#include <qi\/future.hpp>\n#include <qitype\/typeinterface.hpp>\n#include <qitype\/typeobject.hpp>\n#include <qitype\/details\/typeimpl.hxx>\n#include <qitype\/objecttypebuilder.hpp>\n\nQI_REGISTER_TEMPLATE_OBJECT(qi::Future , _connect, isFinished, value, wait, isRunning, isCanceled, hasError, error);\nQI_REGISTER_TEMPLATE_OBJECT(qi::FutureSync, _connect, isFinished, value, wait, isRunning, isCanceled, hasError, error, async);\n\nnamespace qi {\n\n namespace detail\n {\n\n template<typename T> void hold(T data) {}\n\n template <typename T>\n void futureAdapterGeneric(AnyReference val, qi::Promise<T> promise)\n {\n TemplateTypeInterface* ft1 = QI_TEMPLATE_TYPE_GET(val.type, Future);\n TemplateTypeInterface* ft2 = QI_TEMPLATE_TYPE_GET(val.type, FutureSync);\n TemplateTypeInterface* futureType = ft1 ? ft1 : ft2;\n ObjectTypeInterface* onext = dynamic_cast<ObjectTypeInterface*>(futureType->next());\n GenericObject gfut(onext, val.value);\n if (gfut.call<bool>(MetaCallType_Direct, \"hasError\", 0))\n {\n promise.setError(gfut.call<std::string>(\"error\", 0));\n return;\n }\n AnyValue v = gfut.call<AnyValue>(MetaCallType_Direct, \"value\", 0);\n promise.setValue(v.to<T>());\n val.destroy();\n }\n\n template <typename T>\n inline void futureAdapter(qi::Future<qi::AnyReference> metaFut, qi::Promise<T> promise)\n {\n\n \/\/error handling\n if (metaFut.hasError()) {\n promise.setError(metaFut.error());\n return;\n }\n\n AnyReference val = metaFut.value();\n TemplateTypeInterface* ft1 = QI_TEMPLATE_TYPE_GET(val.type, Future);\n TemplateTypeInterface* ft2 = QI_TEMPLATE_TYPE_GET(val.type, FutureSync);\n TemplateTypeInterface* futureType = ft1 ? ft1 : ft2;\n if (futureType)\n {\n TypeInterface* next = futureType->next();\n ObjectTypeInterface* onext = dynamic_cast<ObjectTypeInterface*>(next);\n GenericObject gfut(onext, val.value);\n boost::function<void()> cb = boost::bind(futureAdapterGeneric<T>, val, promise);\n \/\/ Careful, gfut will die at the end of this block, but it is\n \/\/ stored in call data. So call must finish before we exit this block,\n \/\/ and thus must be synchronous.\n gfut.call<void>(MetaCallType_Direct, \"_connect\", cb).wait();\n return;\n }\n TypeInterface* targetType = typeOf<T>();\n try\n {\n std::pair<AnyReference, bool> conv = val.convert(targetType);\n if (!conv.first.type)\n promise.setError(std::string(\"Unable to convert call result to target type:\")\n + val.type->infoString() + \" -> \" + targetType->infoString());\n else\n {\n T* res = (T*)conv.first.type->ptrFromStorage(&conv.first.value);\n promise.setValue(*res);\n }\n if (conv.second)\n conv.first.destroy();\n }\n catch(const std::exception& e)\n {\n promise.setError(std::string(\"Return argument conversion error: \") + e.what());\n }\n val.destroy();\n }\n\n template <typename T>\n inline void futureAdapterVal(qi::Future<qi::AnyValue> metaFut, qi::Promise<T> promise)\n {\n \/\/error handling\n if (metaFut.hasError()) {\n promise.setError(metaFut.error());\n return;\n }\n const AnyValue& val = metaFut.value();\n try\n {\n promise.setValue(val.to<T>());\n }\n catch (const std::exception& e)\n {\n promise.setError(std::string(\"Return argument conversion error: \") + e.what());\n }\n }\n\n template<>\n inline void futureAdapterVal(qi::Future<qi::AnyValue> metaFut, qi::Promise<AnyValue> promise)\n {\n if (metaFut.hasError())\n promise.setError(metaFut.error());\n else\n promise.setValue(metaFut.value());\n }\n\n template <>\n inline void futureAdapter<void>(qi::Future<qi::AnyReference> metaFut, qi::Promise<void> promise)\n {\n \/\/error handling\n if (metaFut.hasError()) {\n promise.setError(metaFut.error());\n return;\n }\n promise.setValue(0);\n }\n\n }\n\n\n \/* Generate qi::FutureSync<R> GenericObject::call(methodname, args...)\n * for all argument counts\n * The function packs arguments in a vector<AnyReference>, computes the\n * signature and bounce those to metaCall.\n *\/\n #define pushi(z, n,_) params.push_back(p ## n);\n#define genCall(n, ATYPEDECL, ATYPES, ADECL, AUSE, comma) \\\n template<typename R> qi::FutureSync<R> GenericObject::call( \\\n const std::string& methodName comma \\\n QI_GEN_ARGSDECLSAMETYPE(n, qi::AutoAnyReference)) \\\n { \\\n if (!value || !type) { \\\n return makeFutureError<R>(\"Invalid GenericObject\"); \\\n } \\\n std::vector<qi::AnyReference> params; \\\n params.reserve(n); \\\n BOOST_PP_REPEAT(n, pushi, _) \\\n std::string sigret; \\\n qi::Promise<R> res; \\\n qi::Future<AnyReference> fmeta = metaCall(methodName, params); \\\n fmeta.connect(boost::bind<void>(&detail::futureAdapter<R>, _1, res)); \\\n return res.future(); \\\n }\n\n QI_GEN(genCall)\n #undef genCall\n #define genCall(n, ATYPEDECL, ATYPES, ADECL, AUSE, comma) \\\n template<typename R> qi::FutureSync<R> GenericObject::async( \\\n const std::string& methodName comma \\\n QI_GEN_ARGSDECLSAMETYPE(n, qi::AutoAnyReference)) \\\n { \\\n if (!value || !type) { \\\n return makeFutureError<R>(\"Invalid GenericObject\"); \\\n } \\\n std::vector<qi::AnyReference> params; \\\n params.reserve(n); \\\n BOOST_PP_REPEAT(n, pushi, _) \\\n std::string sigret; \\\n qi::Promise<R> res; \\\n qi::Future<AnyReference> fmeta = metaCall(methodName, params, MetaCallType_Queued); \\\n fmeta.connect(boost::bind<void>(&detail::futureAdapter<R>, _1, res)); \\\n return res.future(); \\\n }\n\n QI_GEN(genCall)\n #undef genCall\n #define genCall(n, ATYPEDECL, ATYPES, ADECL, AUSE, comma) \\\n template<typename R> qi::FutureSync<R> GenericObject::call( \\\n MetaCallType callType, \\\n const std::string& methodName comma \\\n QI_GEN_ARGSDECLSAMETYPE(n, qi::AutoAnyReference)) \\\n { \\\n if (!value || !type) { \\\n return makeFutureError<R>(\"Invalid GenericObject\"); \\\n } \\\n std::vector<qi::AnyReference> params; \\\n params.reserve(n); \\\n BOOST_PP_REPEAT(n, pushi, _) \\\n std::string sigret; \\\n qi::Promise<R> res; \\\n qi::Future<AnyReference> fmeta = metaCall(methodName, params, callType); \\\n fmeta.connect(boost::bind<void>(&detail::futureAdapter<R>, _1, res)); \\\n return res.future(); \\\n }\n\n QI_GEN(genCall)\n #undef genCall\n\n #define genCall(n, ATYPEDECL, ATYPES, ADECL, AUSE, comma) \\\n template<typename R,typename T> qi::FutureSync<R> async( \\\n T* instance, \\\n const std::string& methodName comma \\\n QI_GEN_ARGSDECLSAMETYPE(n, qi::AutoAnyReference)) \\\n { \\\n AnyObject obj = AnyReference(instance).toObject(); \\\n qi::Future<R> res = obj->call<R>(MetaCallType_Queued, methodName comma AUSE); \\\n res.connect(boost::bind(&detail::hold<AnyObject>, obj)); \\\n return res; \\\n }\n QI_GEN(genCall)\n #undef genCall\n\n #define genCall(n, ATYPEDECL, ATYPES, ADECL, AUSE, comma) \\\n template<typename R,typename T> qi::FutureSync<R> async( \\\n boost::shared_ptr<T> instance, \\\n const std::string& methodName comma \\\n QI_GEN_ARGSDECLSAMETYPE(n, qi::AutoAnyReference)) \\\n { \\\n AnyObject obj = AnyReference(instance).toObject(); \\\n qi::Future<R> res = obj->call<R>(MetaCallType_Queued, methodName comma AUSE); \\\n res.connect(boost::bind(&detail::hold<AnyObject>, obj)); \\\n return res; \\\n }\n QI_GEN(genCall)\n #undef genCall\n #undef pushi\n\n template<typename T>\n qi::FutureSync<T> GenericObject::property(const std::string& name)\n {\n int pid = metaObject().propertyId(name);\n if (pid < 0)\n return makeFutureError<T>(\"Property not found\");\n qi::Future<AnyValue> f = type->property(value, pid);\n qi::Promise<T> p;\n f.connect(boost::bind(&detail::futureAdapterVal<T>,_1, p));\n return p.future();\n }\n\n template<typename T>\n qi::FutureSync<void> GenericObject::setProperty(const std::string& name, const T& val)\n {\n int pid = metaObject().propertyId(name);\n if (pid < 0)\n return makeFutureError<void>(\"Property not found\");\n return type->setProperty(value, pid, AnyValue(AnyReference(val)));\n }\n\n \/* An AnyObject is actually of a Dynamic type: The underlying TypeInterface*\n * is not allways the same.\n *\/\n template<> class QITYPE_API TypeImpl<AnyObject>: public DynamicTypeInterface\n {\n public:\n virtual AnyReference get(void* storage)\n {\n AnyObject* val = (AnyObject*)ptrFromStorage(&storage);\n AnyReference result;\n if (!*val)\n {\n return AnyReference();\n }\n result.type = (*val)->type;\n result.value = (*val)->value;\n return result;\n }\n\n virtual void set(void** storage, AnyReference source)\n {\n qiLogCategory(\"qitype.object\");\n AnyObject* val = (AnyObject*)ptrFromStorage(storage);\n TemplateTypeInterface* templ = dynamic_cast<TemplateTypeInterface*>(source.type);\n if (templ)\n source.type = templ->next();\n if (source.type->info() == info())\n { \/\/ source is objectptr\n AnyObject* src = (AnyObject*)source.type->ptrFromStorage(&source.value);\n if (!*src)\n qiLogWarning() << \"NULL AnyObject\";\n *val = *src;\n }\n else if (source.kind() == TypeKind_Dynamic)\n { \/\/ try to dereference dynamic type in case it contains an object\n set(storage, source.asDynamic());\n }\n else if (source.kind() == TypeKind_Object)\n { \/\/ wrap object in objectptr: we do not keep it alive,\n \/\/ but source type offers no tracking capability\n AnyObject op(new GenericObject(static_cast<ObjectTypeInterface*>(source.type), source.value));\n *val = op;\n }\n else if (source.kind() == TypeKind_Pointer)\n {\n PointerTypeInterface* ptype = static_cast<PointerTypeInterface*>(source.type);\n \/\/ FIXME: find a way!\n if (ptype->pointerKind() == PointerTypeInterface::Shared)\n qiLogInfo() << \"AnyObject will *not* track original shared pointer\";\n set(storage, *source);\n }\n else\n throw std::runtime_error((std::string)\"Cannot assign non-object \" + source.type->infoString() + \" to AnyObject\");\n\n }\n typedef DefaultTypeImplMethods<AnyObject> Methods;\n _QI_BOUNCE_TYPE_METHODS(Methods);\n };\n\n namespace detail\n {\n typedef std::map<TypeInfo, boost::function<AnyReference(AnyObject)> > ProxyGeneratorMap;\n QITYPE_API ProxyGeneratorMap& proxyGeneratorMap();\n\n template<typename Proxy>\n AnyReference makeProxy(AnyObject ptr)\n {\n boost::shared_ptr<Proxy> sp(new Proxy(ptr));\n return AnyReference(sp).clone();\n }\n }\n template<typename Proxy, typename Interface>\n bool registerProxyInterface()\n {\n detail::ProxyGeneratorMap& map = detail::proxyGeneratorMap();\n map[typeOf<Interface>()->info()] = &detail::makeProxy<Proxy>;\n return true;\n }\n template<typename Proxy>\n bool registerProxy()\n {\n detail::ProxyGeneratorMap& map = detail::proxyGeneratorMap();\n map[typeOf<Proxy>()->info()] = &detail::makeProxy<Proxy>;\n return true;\n }\n\n namespace detail\n {\n \/* Factory helper functions\n *\/\n\n \/\/ create a T, wrap in a AnyObject\n template<typename T> AnyObject constructObject()\n {\n return AnyReference::fromPtr(new T()).toObject();\n }\n\n \/\/ in genericobjectbuilder.hxx\n template<typename T> AnyObject makeObject(const std::string& fname, T func);\n\n \/\/ Create a factory function for an object with one method functionName bouncing to func\n template<typename T> boost::function<AnyObject(const std::string&)>\n makeObjectFactory(const std::string functionName, T func)\n {\n return ( boost::function<AnyObject(const std::string&)>)\n boost::bind(&makeObject<T>, functionName, func);\n }\n }\n}\nQI_TYPE_STRUCT(qi::MethodStatistics, cumulatedTime, minTime, maxTime, count);\nQI_TYPE_STRUCT(qi::EventTrace, id, kind, slotId, arguments, timestamp);\nQI_TYPE_STRUCT(qi::os::timeval, tv_sec, tv_usec);\n#endif \/\/ _QITYPE_DETAILS_GENERICOBJECT_HXX_\n<|endoftext|>"} {"text":"<commit_before>#include \"sshtunneloutconnection.h\"\n#include \"sshtunnelout.h\"\n#include \"sshclient.h\"\n\nQ_LOGGING_CATEGORY(logsshtunneloutconnection, \"ssh.tunnelout.connection\")\nQ_LOGGING_CATEGORY(logsshtunneloutconnectiontransfer, \"ssh.tunnelout.connection.transfer\")\n\n#define _DEBUG_ qCDebug(logsshtunneloutconnection) << m_name\n#define _DEBUGT_ qCDebug(logsshtunneloutconnectiontransfer) << m_name\n\n#define SOCKET_WRITE_ERROR (-1001)\n\nSshTunnelOutConnection::SshTunnelOutConnection(const QString &name, SshClient *client, QTcpServer &server, quint16 remotePort)\n : SshChannel(name, client)\n , m_server(server)\n , m_port(remotePort)\n , m_tx_stop_ptr(m_tx_buffer)\n{\n QObject::connect(this, &SshTunnelOutConnection::sendEvent, this, &SshTunnelOutConnection::_eventLoop, Qt::QueuedConnection);\n _DEBUG_ << \"Create SshTunnelOutConnection (constructor)\";\n emit sendEvent();\n}\n\nSshTunnelOutConnection::~SshTunnelOutConnection()\n{\n _DEBUG_ << \"Free SshTunnelOutConnection (destructor)\";\n}\n\nvoid SshTunnelOutConnection::close()\n{\n _DEBUG_ << \"Close SshTunnelOutConnection asked\";\n setChannelState(ChannelState::Close);\n emit sendEvent();\n}\n\nint SshTunnelOutConnection::_displaySshError(const QString &msg)\n{\n char *emsg;\n int size;\n int ret = libssh2_session_last_error(m_sshClient->session(), &emsg, &size, 0);\n if(ret == LIBSSH2_ERROR_EAGAIN)\n {\n \/* Process next connection *\/\n m_sshWaiting = true;\n return LIBSSH2_ERROR_EAGAIN;\n }\n qCCritical(logsshtunneloutconnection) << m_name << \"Error\" << ret << msg << QString(emsg);\n return ret;\n}\n\n\nssize_t SshTunnelOutConnection::_transferSockToTx()\n{\n qint64 len = 0;\n if(m_tx_stop_ptr != nullptr)\n {\n qCWarning(logsshtunneloutconnection) << m_name << \"Asking transfer sock to tx when buffer not empty (\" << m_tx_stop_ptr - m_tx_start_ptr << \" bytes)\";\n return -1;\n }\n\n if(m_sock == nullptr && m_sock->state() != QAbstractSocket::ConnectedState)\n {\n qCCritical(logsshtunneloutconnectiontransfer) << m_name << \"_transferSockToTx on invalid socket\";\n return -1;\n }\n\n len = m_sock->read(m_tx_buffer, BUFFER_SIZE);\n if(len > 0)\n {\n m_tx_stop_ptr = m_tx_buffer + len;\n m_tx_start_ptr = m_tx_buffer;\n if(len < BUFFER_SIZE)\n {\n m_data_to_tx = false;\n }\n _DEBUG_ << \"_transferSockToTx: \" << len << \"bytes (available:\" << m_sock->bytesAvailable() << \", state:\" << m_sock->state() << \")\";\n if(m_sock->state() == QAbstractSocket::UnconnectedState)\n {\n _DEBUG_ << \"Detect Socket disconnected\";\n m_tx_closed = true;\n emit sendEvent();\n }\n }\n else\n {\n m_tx_stop_ptr = nullptr;\n m_tx_start_ptr = nullptr;\n _DEBUG_ << \"_transferSockToTx: error: \" << len;\n }\n\n return len;\n}\n\nssize_t SshTunnelOutConnection::_transferTxToSsh()\n{\n ssize_t transfered = 0;\n\n while(m_tx_start_ptr < m_tx_stop_ptr)\n {\n ssize_t len = libssh2_channel_write(m_sshChannel, m_tx_start_ptr, m_tx_stop_ptr - m_tx_start_ptr);\n if(len == LIBSSH2_ERROR_EAGAIN)\n {\n _DEBUG_ << \"_transferTxToSsh: write again\" ;\n return 0;\n }\n if (len < 0)\n {\n _DEBUG_ << \"_transferTxToSsh: write again\" ;\n return _displaySshError(\"libssh2_channel_write\");\n }\n if (len == 0)\n {\n qCWarning(logsshtunneloutconnectiontransfer) << m_name << \"ERROR: libssh2_channel_write return 0\";\n return 0;\n }\n \/* xfer OK *\/\n m_tx_start_ptr += len;\n transfered += len;\n _DEBUG_ << \"_transferTxToSsh: write on SSH return \" << len << \"bytes\" ;\n\n if(m_tx_start_ptr == m_tx_stop_ptr)\n {\n _DEBUG_ << \"_transferTxToSsh: All buffer sent on SSH, buffer empty\" ;\n m_tx_stop_ptr = nullptr;\n m_tx_start_ptr = nullptr;\n }\n }\n return transfered;\n}\n\nssize_t SshTunnelOutConnection::_transferSshToRx()\n{\n ssize_t sshread = 0;\n\n if(m_rx_stop_ptr != nullptr)\n {\n qCWarning(logsshtunneloutconnection) << \"Buffer not empty, need to retry later\";\n emit sendEvent();\n return 0;\n }\n\n sshread = static_cast<ssize_t>(libssh2_channel_read(m_sshChannel, m_rx_buffer, BUFFER_SIZE));\n if (sshread < 0)\n {\n if(sshread != LIBSSH2_ERROR_EAGAIN)\n {\n _DEBUG_ << \"_transferSshToRx: \" << sshread << \" (error)\";\n m_rx_stop_ptr = nullptr;\n _displaySshError(QString(\"libssh2_channel_read (%1 \/ %2)\").arg(sshread).arg(BUFFER_SIZE));\n }\n else\n {\n _DEBUG_ << \"_transferSshToRx: LIBSSH2_ERROR_EAGAIN\";\n m_data_to_rx = false;\n }\n return sshread;\n }\n\n if(sshread < BUFFER_SIZE)\n {\n _DEBUG_ << \"_transferSshToRx: Xfer \" << sshread << \"bytes\";\n m_data_to_rx = false;\n if (libssh2_channel_eof(m_sshChannel))\n {\n m_rx_closed = true;\n _DEBUG_ << \"_transferSshToRx: Ssh channel closed\";\n }\n }\n else\n {\n _DEBUG_ << \"_transferSshToRx: Xfer \" << sshread << \"bytes; There is probably more data to read, re-arm event\";\n emit sendEvent();\n }\n m_rx_stop_ptr = m_rx_buffer + sshread;\n m_rx_start_ptr = m_rx_buffer;\n return sshread;\n}\n\nssize_t SshTunnelOutConnection::_transferRxToSock()\n{\n ssize_t total = 0;\n\n \/* If socket not ready, wait for socket connected *\/\n if(!m_sock || m_sock->state() != QAbstractSocket::ConnectedState)\n {\n qCWarning(logsshtunneloutconnection) << m_name << \"_transferRxToSock: Data on SSH when socket closed\";\n m_dataWaitingOnSsh = true;\n return -1;\n }\n\n if(m_rx_stop_ptr == nullptr)\n {\n qCWarning(logsshtunneloutconnection) << m_name << \"Buffer empty\";\n return 0;\n }\n\n _DEBUG_ << \"_transferRxToSock: libssh2_channel_read return \" << (m_rx_stop_ptr - m_rx_start_ptr) << \"bytes\";\n\n while (m_rx_start_ptr < m_rx_stop_ptr)\n {\n ssize_t slen = m_sock->write(m_rx_start_ptr, m_rx_stop_ptr - m_rx_start_ptr);\n if (slen <= 0)\n {\n qCWarning(logsshtunneloutconnectiontransfer) << \"ERROR : \" << m_name << \" local failed to write (\" << slen << \")\";\n return slen;\n }\n m_rx_start_ptr += slen;\n total += slen;\n _DEBUG_ << \"_transferRxToSock: \" << slen << \"bytes written on socket\";\n }\n\n \/* Buffer is empty *\/\n m_rx_stop_ptr = nullptr;\n m_rx_start_ptr = nullptr;\n return total;\n}\n\nvoid SshTunnelOutConnection::_socketStateChanged(QAbstractSocket::SocketState socketState)\n{\n _DEBUG_ << \"_socketStateChanged: Socket State changed: \" << socketState;\n}\n\n\nvoid SshTunnelOutConnection::_socketDisconnected()\n{\n _DEBUG_ << \"_socketDisconnected: Socket disconnected\";\n m_tx_closed = true;\n emit sendEvent();\n}\n\nvoid SshTunnelOutConnection::_socketDataRecived()\n{\n _DEBUG_ << \"_socketDataRecived: Socket data received\";\n m_data_to_tx = true;\n emit sendEvent();\n}\n\nvoid SshTunnelOutConnection::sshDataReceived()\n{\n _DEBUG_ << \"sshDataReceived: SSH data received\";\n m_data_to_rx = true;\n emit sendEvent();\n}\n\nvoid SshTunnelOutConnection::_socketError()\n{\n _DEBUG_ << \"_socketError\";\n auto error = m_sock->error();\n switch(error)\n {\n case QAbstractSocket::RemoteHostClosedError:\n _DEBUG_ << \"socket RemoteHostClosedError\";\n \/\/ Socket will be closed just after this, nothing to care about\n break;\n default:\n qCWarning(logsshtunneloutconnection) << m_name << \"socket error=\" << error << m_sock->errorString();\n \/\/ setChannelState(ChannelState::Close);\n }\n}\n\nvoid SshTunnelOutConnection::_eventLoop()\n{\n switch(channelState())\n {\n case Openning:\n {\n if ( ! m_sshClient->takeChannelCreationMutex(this) )\n {\n return;\n }\n m_sshChannel = libssh2_channel_direct_tcpip(m_sshClient->session(), \"127.0.0.1\", m_port);\n m_sshClient->releaseChannelCreationMutex(this);\n if (m_sshChannel == nullptr)\n {\n char *emsg;\n int size;\n int ret = libssh2_session_last_error(m_sshClient->session(), &emsg, &size, 0);\n if(ret == LIBSSH2_ERROR_EAGAIN)\n {\n return;\n }\n if(!m_error)\n {\n qCDebug(logsshtunneloutconnection) << \"Refuse client socket connection on \" << m_server.serverPort() << QString(emsg);\n m_error = true;\n m_sock = m_server.nextPendingConnection();\n if(m_sock)\n {\n m_sock->close();\n m_sock->deleteLater();\n }\n m_server.close();\n }\n setChannelState(ChannelState::Error);\n qCWarning(logsshtunneloutconnection) << \"Channel session open failed\";\n return;\n }\n _DEBUG_ << \"Channel session opened\";\n setChannelState(ChannelState::Exec);\n }\n\n FALLTHROUGH; case Exec:\n {\n m_sock = m_server.nextPendingConnection();\n if(!m_sock)\n {\n m_server.close();\n setChannelState(ChannelState::Error);\n qCWarning(logsshtunneloutconnection) << \"Fail to get client socket\";\n setChannelState(ChannelState::Close);\n return;\n }\n\n QObject::connect(m_sock, &QTcpSocket::stateChanged,\n this, &SshTunnelOutConnection::_socketStateChanged);\n\n QObject::connect(m_sock, &QTcpSocket::readyRead,\n this, &SshTunnelOutConnection::_socketDataRecived);\n\n QObject::connect(m_sock, &QTcpSocket::disconnected,\n this, &SshTunnelOutConnection::_socketDisconnected);\n\n QObject::connect(m_sock, QOverload<QAbstractSocket::SocketError>::of(&QAbstractSocket::error),\n this, &SshTunnelOutConnection::_socketError);\n\n m_name = QString(m_name + \":%1\").arg(m_sock->localPort());\n _DEBUG_ << \"createConnection: \" << m_sock << m_sock->localPort();\n m_rx_start_ptr = nullptr;\n m_rx_stop_ptr = nullptr;\n m_tx_start_ptr = nullptr;\n m_tx_stop_ptr = nullptr;\n m_data_to_tx = true;\n setChannelState(ChannelState::Read);\n \/* OK, next step *\/\n }\n\n FALLTHROUGH; case Read:\n {\n _DEBUG_ << \"_eventLoop in\" << channelState() << \"RX:\" << m_data_to_rx << \" TX:\" << m_data_to_tx << \" BUFTX:\" << m_tx_start_ptr << \" BUFRX:\" << m_rx_start_ptr;\n ssize_t xfer = 0;\n if(m_rx_start_ptr) xfer += _transferRxToSock();\n if(m_data_to_rx) _transferSshToRx();\n if(m_rx_start_ptr) xfer += _transferRxToSock();\n\n if(m_tx_start_ptr) xfer += _transferTxToSsh();\n if(m_data_to_tx) _transferSockToTx();\n if(m_tx_start_ptr) xfer += _transferTxToSsh();\n\n if(m_tx_closed && (m_tx_start_ptr == nullptr))\n {\n _DEBUG_ << \"Send EOF to SSH\";\n libssh2_channel_send_eof(m_sshChannel);\n setChannelState(ChannelState::Close);\n }\n\n _DEBUG_ << \"_eventLoop out:\" << channelState() << \"RX:\" << m_data_to_rx << \" TX:\" << m_data_to_tx << \" BUFTX:\" << m_tx_start_ptr << \" BUFRX:\" << m_rx_start_ptr;\n return;\n }\n\n case Close:\n {\n if(!m_disconnectedFromSock && m_sock && m_sock->state() == QAbstractSocket::ConnectedState)\n {\n m_sock->disconnectFromHost();\n }\n _DEBUG_ << \"closeChannel\";\n setChannelState(ChannelState::WaitClose);\n }\n\n FALLTHROUGH; case WaitClose:\n {\n _DEBUG_ << \"Wait close channel\";\n if(m_sock->state() == QAbstractSocket::UnconnectedState)\n {\n setChannelState(ChannelState::Freeing);\n }\n }\n\n FALLTHROUGH; case Freeing:\n {\n _DEBUG_ << \"free Channel\";\n\n int ret = libssh2_channel_free(m_sshChannel);\n if(ret == LIBSSH2_ERROR_EAGAIN)\n {\n return;\n }\n if(ret < 0)\n {\n if(!m_error)\n {\n m_error = true;\n qCWarning(logsshtunneloutconnection) << \"Failed to free channel: \" << sshErrorToString(ret);\n }\n }\n if(m_error)\n {\n setChannelState(ChannelState::Error);\n }\n else\n {\n setChannelState(ChannelState::Free);\n }\n m_sshChannel = nullptr;\n QObject::disconnect(m_sshClient, &SshClient::sshDataReceived, this, &SshTunnelOutConnection::sshDataReceived);\n emit canBeDestroy(this);\n return;\n }\n\n case Free:\n {\n qCDebug(logsshtunneloutconnection) << \"Channel\" << m_name << \"is free\";\n return;\n }\n\n case Error:\n {\n qCDebug(logsshtunneloutconnection) << \"Channel\" << m_name << \"is in error state\";\n return;\n }\n }\n}\n\n<commit_msg>Fix test 1MB<commit_after>#include \"sshtunneloutconnection.h\"\n#include \"sshtunnelout.h\"\n#include \"sshclient.h\"\n\nQ_LOGGING_CATEGORY(logsshtunneloutconnection, \"ssh.tunnelout.connection\")\nQ_LOGGING_CATEGORY(logsshtunneloutconnectiontransfer, \"ssh.tunnelout.connection.transfer\")\n\n#define _DEBUG_ qCDebug(logsshtunneloutconnection) << m_name\n#define _DEBUGT_ qCDebug(logsshtunneloutconnectiontransfer) << m_name\n\n#define SOCKET_WRITE_ERROR (-1001)\n\nSshTunnelOutConnection::SshTunnelOutConnection(const QString &name, SshClient *client, QTcpServer &server, quint16 remotePort)\n : SshChannel(name, client)\n , m_server(server)\n , m_port(remotePort)\n , m_tx_stop_ptr(m_tx_buffer)\n{\n QObject::connect(this, &SshTunnelOutConnection::sendEvent, this, &SshTunnelOutConnection::_eventLoop, Qt::QueuedConnection);\n _DEBUG_ << \"Create SshTunnelOutConnection (constructor)\";\n emit sendEvent();\n}\n\nSshTunnelOutConnection::~SshTunnelOutConnection()\n{\n _DEBUG_ << \"Free SshTunnelOutConnection (destructor)\";\n}\n\nvoid SshTunnelOutConnection::close()\n{\n _DEBUG_ << \"Close SshTunnelOutConnection asked\";\n setChannelState(ChannelState::Close);\n emit sendEvent();\n}\n\nint SshTunnelOutConnection::_displaySshError(const QString &msg)\n{\n char *emsg;\n int size;\n int ret = libssh2_session_last_error(m_sshClient->session(), &emsg, &size, 0);\n if(ret == LIBSSH2_ERROR_EAGAIN)\n {\n \/* Process next connection *\/\n m_sshWaiting = true;\n return LIBSSH2_ERROR_EAGAIN;\n }\n qCCritical(logsshtunneloutconnection) << m_name << \"Error\" << ret << msg << QString(emsg);\n return ret;\n}\n\n\nssize_t SshTunnelOutConnection::_transferSockToTx()\n{\n qint64 len = 0;\n if(m_tx_stop_ptr != nullptr)\n {\n qCWarning(logsshtunneloutconnection) << m_name << \"Asking transfer sock to tx when buffer not empty (\" << m_tx_stop_ptr - m_tx_start_ptr << \" bytes)\";\n return -1;\n }\n\n if(m_sock == nullptr && m_sock->state() != QAbstractSocket::ConnectedState)\n {\n qCCritical(logsshtunneloutconnectiontransfer) << m_name << \"_transferSockToTx on invalid socket\";\n return -1;\n }\n\n len = m_sock->read(m_tx_buffer, BUFFER_SIZE);\n if(len > 0)\n {\n m_tx_stop_ptr = m_tx_buffer + len;\n m_tx_start_ptr = m_tx_buffer;\n if(len < BUFFER_SIZE)\n {\n m_data_to_tx = false;\n }\n _DEBUG_ << \"_transferSockToTx: \" << len << \"bytes (available:\" << m_sock->bytesAvailable() << \", state:\" << m_sock->state() << \")\";\n if(m_sock->bytesAvailable() == 0)\n {\n if(m_sock->state() == QAbstractSocket::UnconnectedState)\n {\n _DEBUG_ << \"Detect Socket disconnected\";\n m_tx_closed = true;\n emit sendEvent();\n }\n }\n else\n {\n m_data_to_tx = true;\n _DEBUG_ << \"_transferSockToTx: There is other data in socket, re-arm read\";\n emit sendEvent();\n }\n }\n else\n {\n m_tx_stop_ptr = nullptr;\n m_tx_start_ptr = nullptr;\n _DEBUG_ << \"_transferSockToTx: error: \" << len;\n }\n\n return len;\n}\n\nssize_t SshTunnelOutConnection::_transferTxToSsh()\n{\n ssize_t transfered = 0;\n\n while(m_tx_start_ptr < m_tx_stop_ptr)\n {\n ssize_t len = libssh2_channel_write(m_sshChannel, m_tx_start_ptr, m_tx_stop_ptr - m_tx_start_ptr);\n if(len == LIBSSH2_ERROR_EAGAIN)\n {\n _DEBUG_ << \"_transferTxToSsh: write again\" ;\n return 0;\n }\n if (len < 0)\n {\n _DEBUG_ << \"_transferTxToSsh: write again\" ;\n return _displaySshError(\"libssh2_channel_write\");\n }\n if (len == 0)\n {\n qCWarning(logsshtunneloutconnectiontransfer) << m_name << \"ERROR: libssh2_channel_write return 0\";\n return 0;\n }\n \/* xfer OK *\/\n m_tx_start_ptr += len;\n transfered += len;\n _DEBUG_ << \"_transferTxToSsh: write on SSH return \" << len << \"bytes\" ;\n\n if(m_tx_start_ptr == m_tx_stop_ptr)\n {\n _DEBUG_ << \"_transferTxToSsh: All buffer sent on SSH, buffer empty\" ;\n m_tx_stop_ptr = nullptr;\n m_tx_start_ptr = nullptr;\n }\n }\n return transfered;\n}\n\nssize_t SshTunnelOutConnection::_transferSshToRx()\n{\n ssize_t sshread = 0;\n\n if(m_rx_stop_ptr != nullptr)\n {\n qCWarning(logsshtunneloutconnection) << \"Buffer not empty, need to retry later\";\n emit sendEvent();\n return 0;\n }\n\n sshread = static_cast<ssize_t>(libssh2_channel_read(m_sshChannel, m_rx_buffer, BUFFER_SIZE));\n if (sshread < 0)\n {\n if(sshread != LIBSSH2_ERROR_EAGAIN)\n {\n _DEBUG_ << \"_transferSshToRx: \" << sshread << \" (error)\";\n m_rx_stop_ptr = nullptr;\n _displaySshError(QString(\"libssh2_channel_read (%1 \/ %2)\").arg(sshread).arg(BUFFER_SIZE));\n }\n else\n {\n _DEBUG_ << \"_transferSshToRx: LIBSSH2_ERROR_EAGAIN\";\n m_data_to_rx = false;\n }\n return sshread;\n }\n\n if(sshread < BUFFER_SIZE)\n {\n _DEBUG_ << \"_transferSshToRx: Xfer \" << sshread << \"bytes\";\n m_data_to_rx = false;\n if (libssh2_channel_eof(m_sshChannel))\n {\n m_rx_closed = true;\n _DEBUG_ << \"_transferSshToRx: Ssh channel closed\";\n }\n }\n else\n {\n _DEBUG_ << \"_transferSshToRx: Xfer \" << sshread << \"bytes; There is probably more data to read, re-arm event\";\n emit sendEvent();\n }\n m_rx_stop_ptr = m_rx_buffer + sshread;\n m_rx_start_ptr = m_rx_buffer;\n return sshread;\n}\n\nssize_t SshTunnelOutConnection::_transferRxToSock()\n{\n ssize_t total = 0;\n\n \/* If socket not ready, wait for socket connected *\/\n if(!m_sock || m_sock->state() != QAbstractSocket::ConnectedState)\n {\n qCWarning(logsshtunneloutconnection) << m_name << \"_transferRxToSock: Data on SSH when socket closed\";\n m_dataWaitingOnSsh = true;\n return -1;\n }\n\n if(m_rx_stop_ptr == nullptr)\n {\n qCWarning(logsshtunneloutconnection) << m_name << \"Buffer empty\";\n return 0;\n }\n\n _DEBUG_ << \"_transferRxToSock: libssh2_channel_read return \" << (m_rx_stop_ptr - m_rx_start_ptr) << \"bytes\";\n\n while (m_rx_start_ptr < m_rx_stop_ptr)\n {\n ssize_t slen = m_sock->write(m_rx_start_ptr, m_rx_stop_ptr - m_rx_start_ptr);\n if (slen <= 0)\n {\n qCWarning(logsshtunneloutconnectiontransfer) << \"ERROR : \" << m_name << \" local failed to write (\" << slen << \")\";\n return slen;\n }\n m_rx_start_ptr += slen;\n total += slen;\n _DEBUG_ << \"_transferRxToSock: \" << slen << \"bytes written on socket\";\n }\n\n \/* Buffer is empty *\/\n m_rx_stop_ptr = nullptr;\n m_rx_start_ptr = nullptr;\n return total;\n}\n\nvoid SshTunnelOutConnection::_socketStateChanged(QAbstractSocket::SocketState socketState)\n{\n _DEBUG_ << \"_socketStateChanged: Socket State changed: \" << socketState;\n}\n\n\nvoid SshTunnelOutConnection::_socketDisconnected()\n{\n _DEBUG_ << \"_socketDisconnected: Socket disconnected\";\n m_tx_closed = true;\n emit sendEvent();\n}\n\nvoid SshTunnelOutConnection::_socketDataRecived()\n{\n _DEBUG_ << \"_socketDataRecived: Socket data received\";\n m_data_to_tx = true;\n emit sendEvent();\n}\n\nvoid SshTunnelOutConnection::sshDataReceived()\n{\n _DEBUG_ << \"sshDataReceived: SSH data received\";\n m_data_to_rx = true;\n emit sendEvent();\n}\n\nvoid SshTunnelOutConnection::_socketError()\n{\n _DEBUG_ << \"_socketError\";\n auto error = m_sock->error();\n switch(error)\n {\n case QAbstractSocket::RemoteHostClosedError:\n _DEBUG_ << \"socket RemoteHostClosedError\";\n \/\/ Socket will be closed just after this, nothing to care about\n break;\n default:\n qCWarning(logsshtunneloutconnection) << m_name << \"socket error=\" << error << m_sock->errorString();\n \/\/ setChannelState(ChannelState::Close);\n }\n}\n\nvoid SshTunnelOutConnection::_eventLoop()\n{\n switch(channelState())\n {\n case Openning:\n {\n if ( ! m_sshClient->takeChannelCreationMutex(this) )\n {\n return;\n }\n m_sshChannel = libssh2_channel_direct_tcpip(m_sshClient->session(), \"127.0.0.1\", m_port);\n m_sshClient->releaseChannelCreationMutex(this);\n if (m_sshChannel == nullptr)\n {\n char *emsg;\n int size;\n int ret = libssh2_session_last_error(m_sshClient->session(), &emsg, &size, 0);\n if(ret == LIBSSH2_ERROR_EAGAIN)\n {\n return;\n }\n if(!m_error)\n {\n qCDebug(logsshtunneloutconnection) << \"Refuse client socket connection on \" << m_server.serverPort() << QString(emsg);\n m_error = true;\n m_sock = m_server.nextPendingConnection();\n if(m_sock)\n {\n m_sock->close();\n m_sock->deleteLater();\n }\n m_server.close();\n }\n setChannelState(ChannelState::Error);\n qCWarning(logsshtunneloutconnection) << \"Channel session open failed\";\n return;\n }\n _DEBUG_ << \"Channel session opened\";\n setChannelState(ChannelState::Exec);\n }\n\n FALLTHROUGH; case Exec:\n {\n m_sock = m_server.nextPendingConnection();\n if(!m_sock)\n {\n m_server.close();\n setChannelState(ChannelState::Error);\n qCWarning(logsshtunneloutconnection) << \"Fail to get client socket\";\n setChannelState(ChannelState::Close);\n return;\n }\n\n QObject::connect(m_sock, &QTcpSocket::stateChanged,\n this, &SshTunnelOutConnection::_socketStateChanged);\n\n QObject::connect(m_sock, &QTcpSocket::readyRead,\n this, &SshTunnelOutConnection::_socketDataRecived);\n\n QObject::connect(m_sock, &QTcpSocket::disconnected,\n this, &SshTunnelOutConnection::_socketDisconnected);\n\n QObject::connect(m_sock, QOverload<QAbstractSocket::SocketError>::of(&QAbstractSocket::error),\n this, &SshTunnelOutConnection::_socketError);\n\n m_name = QString(m_name + \":%1\").arg(m_sock->localPort());\n _DEBUG_ << \"createConnection: \" << m_sock << m_sock->localPort();\n m_rx_start_ptr = nullptr;\n m_rx_stop_ptr = nullptr;\n m_tx_start_ptr = nullptr;\n m_tx_stop_ptr = nullptr;\n m_data_to_tx = true;\n setChannelState(ChannelState::Read);\n \/* OK, next step *\/\n }\n\n FALLTHROUGH; case Read:\n {\n _DEBUG_ << \"_eventLoop in\" << channelState() << \"RX:\" << m_data_to_rx << \" TX:\" << m_data_to_tx << \" BUFTX:\" << m_tx_start_ptr << \" BUFRX:\" << m_rx_start_ptr;\n ssize_t xfer = 0;\n if(m_rx_start_ptr) xfer += _transferRxToSock();\n if(m_data_to_rx) _transferSshToRx();\n if(m_rx_start_ptr) xfer += _transferRxToSock();\n\n if(m_tx_start_ptr) xfer += _transferTxToSsh();\n if(m_data_to_tx) _transferSockToTx();\n if(m_tx_start_ptr) xfer += _transferTxToSsh();\n\n if(m_tx_closed && (m_tx_start_ptr == nullptr))\n {\n _DEBUG_ << \"Send EOF to SSH\";\n libssh2_channel_send_eof(m_sshChannel);\n setChannelState(ChannelState::Close);\n }\n\n _DEBUG_ << \"_eventLoop out:\" << channelState() << \"RX:\" << m_data_to_rx << \" TX:\" << m_data_to_tx << \" BUFTX:\" << m_tx_start_ptr << \" BUFRX:\" << m_rx_start_ptr;\n return;\n }\n\n case Close:\n {\n if(!m_disconnectedFromSock && m_sock && m_sock->state() == QAbstractSocket::ConnectedState)\n {\n m_sock->disconnectFromHost();\n }\n _DEBUG_ << \"closeChannel\";\n setChannelState(ChannelState::WaitClose);\n }\n\n FALLTHROUGH; case WaitClose:\n {\n _DEBUG_ << \"Wait close channel\";\n if(m_sock->state() == QAbstractSocket::UnconnectedState)\n {\n setChannelState(ChannelState::Freeing);\n }\n }\n\n FALLTHROUGH; case Freeing:\n {\n _DEBUG_ << \"free Channel\";\n\n int ret = libssh2_channel_free(m_sshChannel);\n if(ret == LIBSSH2_ERROR_EAGAIN)\n {\n return;\n }\n if(ret < 0)\n {\n if(!m_error)\n {\n m_error = true;\n qCWarning(logsshtunneloutconnection) << \"Failed to free channel: \" << sshErrorToString(ret);\n }\n }\n if(m_error)\n {\n setChannelState(ChannelState::Error);\n }\n else\n {\n setChannelState(ChannelState::Free);\n }\n m_sshChannel = nullptr;\n QObject::disconnect(m_sshClient, &SshClient::sshDataReceived, this, &SshTunnelOutConnection::sshDataReceived);\n emit canBeDestroy(this);\n return;\n }\n\n case Free:\n {\n qCDebug(logsshtunneloutconnection) << \"Channel\" << m_name << \"is free\";\n return;\n }\n\n case Error:\n {\n qCDebug(logsshtunneloutconnection) << \"Channel\" << m_name << \"is in error state\";\n return;\n }\n }\n}\n\n<|endoftext|>"} {"text":"<commit_before>\/* Copyright 2014 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\n#ifndef RCLCPP_RCLCPP_CLIENT_HPP_\n#define RCLCPP_RCLCPP_CLIENT_HPP_\n\n#include <memory>\n\n#include <ros_middleware_interface\/functions.h>\n#include <ros_middleware_interface\/handles.h>\n\n#include <rclcpp\/macros.hpp>\n\nnamespace rclcpp\n{\n\n\/\/ Forward declaration for friend statement\nnamespace node {class Node;}\n\nnamespace client\n{\n\ntemplate<typename ServiceT>\nclass Client\n{\npublic:\n RCLCPP_MAKE_SHARED_DEFINITIONS(Client);\n\n Client(ros_middleware_interface::ClientHandle client_handle,\n std::string& service_name)\n : client_handle_(client_handle), service_name_(service_name)\n {}\n\n std::shared_ptr<typename ServiceT::Response>\n send_request(std::shared_ptr<typename ServiceT::Request> &req)\n {\n ::ros_middleware_interface::send_request(client_handle_, req.get());\n\n std::shared_ptr<typename ServiceT::Response> res = std::make_shared<typename ServiceT::Response>();\n ::ros_middleware_interface::receive_response(client_handle_, res.get());\n return res;\n }\n\nprivate:\n ros_middleware_interface::ClientHandle client_handle_;\n std::string service_name_;\n\n};\n\n} \/* namespace client *\/\n} \/* namespace rclcpp *\/\n\n#endif \/* RCLCPP_RCLCPP_CLIENT_HPP_ *\/\n<commit_msg>Added support for timeouts<commit_after>\/* Copyright 2014 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\n#ifndef RCLCPP_RCLCPP_CLIENT_HPP_\n#define RCLCPP_RCLCPP_CLIENT_HPP_\n\n#include <memory>\n\n#include <ros_middleware_interface\/functions.h>\n#include <ros_middleware_interface\/handles.h>\n\n#include <rclcpp\/macros.hpp>\n\nnamespace rclcpp\n{\n\n\/\/ Forward declaration for friend statement\nnamespace node {class Node;}\n\nnamespace client\n{\n\ntemplate<typename ServiceT>\nclass Client\n{\npublic:\n RCLCPP_MAKE_SHARED_DEFINITIONS(Client);\n\n Client(ros_middleware_interface::ClientHandle client_handle,\n std::string& service_name)\n : client_handle_(client_handle), service_name_(service_name)\n {}\n\n std::shared_ptr<typename ServiceT::Response>\n send_request(std::shared_ptr<typename ServiceT::Request> &req, long timeout=10)\n {\n ::ros_middleware_interface::send_request(client_handle_, req.get());\n\n std::shared_ptr<typename ServiceT::Response> res = std::make_shared<typename ServiceT::Response>();\n bool received = ::ros_middleware_interface::receive_response(client_handle_, res.get(), timeout);\n if(!received)\n {\n \/\/ TODO: use custom exception\n throw std::runtime_error(\"Timed out while waiting for response\");\n }\n return res;\n }\n\nprivate:\n ros_middleware_interface::ClientHandle client_handle_;\n std::string service_name_;\n\n};\n\n} \/* namespace client *\/\n} \/* namespace rclcpp *\/\n\n#endif \/* RCLCPP_RCLCPP_CLIENT_HPP_ *\/\n<|endoftext|>"} {"text":"<commit_before>\/\/ This file is part of the dune-stuff project:\n\/\/ https:\/\/users.dune-project.org\/projects\/dune-stuff\/\n\/\/ Copyright holders: Rene Milk, Felix Schindler\n\/\/ License: BSD 2-Clause License (http:\/\/opensource.org\/licenses\/BSD-2-Clause)\n\n\/\/ This one has to come first (includes the config.h)!\n#include <dune\/stuff\/test\/test_common.hh>\n\n#include <tuple>\n\n#include <dune\/stuff\/common\/exceptions.hh>\n#include <dune\/stuff\/common\/logging.hh>\n#include <dune\/stuff\/la\/container.hh>\n#include <dune\/stuff\/la\/solver.hh>\n\n\/\/ toggle output\n\/\/std::ostream& out = std::cout;\nstd::ostream& out = DSC_LOG.devnull();\n\nusing namespace Dune::Stuff;\nusing namespace Dune::Stuff::LA;\n\ntypedef testing::Types< std::tuple< Dune::DynamicMatrix< double >, Dune::DynamicVector< double >, Dune::DynamicVector< double > >\n#if HAVE_EIGEN\n , std::tuple< EigenDenseMatrix< double >, EigenDenseVector< double >, EigenDenseVector< double > >\n , std::tuple< EigenDenseMatrix< double >, EigenDenseVector< double >, EigenMappedDenseVector< double > >\n , std::tuple< EigenDenseMatrix< double >, EigenMappedDenseVector< double >, EigenDenseVector< double > >\n , std::tuple< EigenDenseMatrix< double >, EigenMappedDenseVector< double >, EigenMappedDenseVector< double > >\n , std::tuple< EigenRowMajorSparseMatrix< double >, EigenDenseVector< double >, EigenDenseVector< double > >\n#endif \/\/ HAVE_EIGEN\n#if HAVE_DUNE_ISTL\n , std::tuple< IstlRowMajorSparseMatrix< double >, IstlDenseVector< double >, IstlDenseVector< double > >\n#endif\n > MatrixVectorCombinations;\n\ntemplate< class MatrixVectorCombination >\nstruct SolverTest\n : public ::testing::Test\n{\n typedef typename std::tuple_element< 0, MatrixVectorCombination >::type MatrixType;\n typedef typename std::tuple_element< 1, MatrixVectorCombination >::type RhsType;\n typedef typename std::tuple_element< 2, MatrixVectorCombination >::type SolutionType;\n\n typedef Solver< MatrixType > SolverType;\n\n static void produces_correct_results()\n {\n const size_t dim = 10;\n const MatrixType matrix = Container< MatrixType >::create(dim);\n const RhsType rhs = Container< RhsType >::create(dim);\n SolutionType solution = Container< SolutionType >::create(dim);\n solution.scal(0);\n\n \/\/ dynamic test\n const SolverType solver(matrix);\n solver.apply(rhs, solution);\n if (!solution.almost_equal(rhs))\n DUNE_THROW_COLORFULLY(Exceptions::results_are_not_as_expected, \"Wrong solution!\");\n solution.scal(0);\n\n \/\/ static tests\n typedef typename SolverType::MatrixType M;\n std::vector< std::string > opts = SolverType::options();\n if (opts.size() == 0) DUNE_THROW_COLORFULLY(Exceptions::results_are_not_as_expected, \"Solver has no options!\");\n for (auto opt : opts) {\n out << \"solving with option '\" << opt << \"' and detailed options\" << std::endl;\n Common::ConfigTree detailed_opts = SolverType::options(opt);\n detailed_opts.report(out, \" \");\n\n \/\/ dynamic tests\n solver.apply(rhs, solution, opt);\n if (!solution.almost_equal(rhs))\n DUNE_THROW_COLORFULLY(Exceptions::results_are_not_as_expected, \"Wrong solution!\");\n solution.scal(0);\n\n solver.apply(rhs, solution, detailed_opts);\n if (!solution.almost_equal(rhs))\n DUNE_THROW_COLORFULLY(Exceptions::results_are_not_as_expected, \"Wrong solution!\");\n solution.scal(0);\n }\n } \/\/ ... produces_correct_results(...)\n}; \/\/ struct SolverTest\n\nTYPED_TEST_CASE(SolverTest, MatrixVectorCombinations);\nTYPED_TEST(SolverTest, behaves_correctly) {\n this->produces_correct_results();\n}\n\n\nint main(int argc, char** argv)\n{\n try {\n test_init(argc, argv);\n return RUN_ALL_TESTS();\n } catch (Dune::Exception& e) {\n std::cerr << e.what() << std::endl;\n std::abort();\n } catch (std::exception& e) {\n std::cerr << e.what() << std::endl;\n std::abort();\n } catch (...) {\n std::cerr << \"Unknown exception thrown!\" << std::endl;\n std::abort();\n } \/\/ try\n}\n<commit_msg>[test.la_solver] update<commit_after>\/\/ This file is part of the dune-stuff project:\n\/\/ https:\/\/users.dune-project.org\/projects\/dune-stuff\/\n\/\/ Copyright holders: Rene Milk, Felix Schindler\n\/\/ License: BSD 2-Clause License (http:\/\/opensource.org\/licenses\/BSD-2-Clause)\n\n\/\/ This one has to come first (includes the config.h)!\n#include <dune\/stuff\/test\/test_common.hh>\n\n#include <tuple>\n\n#include <dune\/stuff\/common\/exceptions.hh>\n#include <dune\/stuff\/common\/logging.hh>\n#include <dune\/stuff\/la\/container.hh>\n#include <dune\/stuff\/la\/solver.hh>\n\n#include \"la_container.hh\"\n\n\/\/ toggle output\n\/\/std::ostream& out = std::cout;\nstd::ostream& out = DSC_LOG.devnull();\n\nusing namespace Dune::Stuff;\nusing namespace Dune::Stuff::LA;\n\ntypedef testing::Types< std::tuple< CommonDenseMatrix< double >, CommonDenseVector< double >, CommonDenseVector< double > >\n#if HAVE_EIGEN\n , std::tuple< EigenDenseMatrix< double >, EigenDenseVector< double >, EigenDenseVector< double > >\n , std::tuple< EigenDenseMatrix< double >, EigenDenseVector< double >, EigenMappedDenseVector< double > >\n , std::tuple< EigenDenseMatrix< double >, EigenMappedDenseVector< double >, EigenDenseVector< double > >\n , std::tuple< EigenDenseMatrix< double >, EigenMappedDenseVector< double >, EigenMappedDenseVector< double > >\n , std::tuple< EigenRowMajorSparseMatrix< double >, EigenDenseVector< double >, EigenDenseVector< double > >\n#endif \/\/ HAVE_EIGEN\n#if HAVE_DUNE_ISTL\n , std::tuple< IstlRowMajorSparseMatrix< double >, IstlDenseVector< double >, IstlDenseVector< double > >\n#endif\n > MatrixVectorCombinations;\n\ntemplate< class MatrixVectorCombination >\nstruct SolverTest\n : public ::testing::Test\n{\n typedef typename std::tuple_element< 0, MatrixVectorCombination >::type MatrixType;\n typedef typename std::tuple_element< 1, MatrixVectorCombination >::type RhsType;\n typedef typename std::tuple_element< 2, MatrixVectorCombination >::type SolutionType;\n\n typedef Solver< MatrixType > SolverType;\n\n static void produces_correct_results()\n {\n const size_t dim = 10;\n const MatrixType matrix = ContainerFactory< MatrixType >::create(dim);\n const RhsType rhs = ContainerFactory< RhsType >::create(dim);\n SolutionType solution = ContainerFactory< SolutionType >::create(dim);\n solution.scal(0);\n\n \/\/ dynamic test\n const SolverType solver(matrix);\n solver.apply(rhs, solution);\n if (!solution.almost_equal(rhs))\n DUNE_THROW_COLORFULLY(Exceptions::results_are_not_as_expected, \"Wrong solution!\");\n solution.scal(0);\n\n \/\/ static tests\n typedef typename SolverType::MatrixType M;\n std::vector< std::string > opts = SolverType::options();\n if (opts.size() == 0) DUNE_THROW_COLORFULLY(Exceptions::results_are_not_as_expected, \"Solver has no options!\");\n for (auto opt : opts) {\n out << \"solving with option '\" << opt << \"' and detailed options\" << std::endl;\n Common::ConfigTree detailed_opts = SolverType::options(opt);\n detailed_opts.report(out, \" \");\n\n \/\/ dynamic tests\n solver.apply(rhs, solution, opt);\n if (!solution.almost_equal(rhs))\n DUNE_THROW_COLORFULLY(Exceptions::results_are_not_as_expected, \"Wrong solution!\");\n solution.scal(0);\n\n solver.apply(rhs, solution, detailed_opts);\n if (!solution.almost_equal(rhs))\n DUNE_THROW_COLORFULLY(Exceptions::results_are_not_as_expected, \"Wrong solution!\");\n }\n } \/\/ ... produces_correct_results(...)\n}; \/\/ struct SolverTest\n\nTYPED_TEST_CASE(SolverTest, MatrixVectorCombinations);\nTYPED_TEST(SolverTest, behaves_correctly) {\n this->produces_correct_results();\n}\n\n\nint main(int argc, char** argv)\n{\n try {\n test_init(argc, argv);\n return RUN_ALL_TESTS();\n } catch (Dune::Exception& e) {\n std::cerr << e.what() << std::endl;\n std::abort();\n } catch (std::exception& e) {\n std::cerr << e.what() << std::endl;\n std::abort();\n } catch (...) {\n std::cerr << \"Unknown exception thrown!\" << std::endl;\n std::abort();\n } \/\/ try\n}\n<|endoftext|>"} {"text":"<commit_before>\/\/ Catch\n#include <catch.hpp>\n\n\/\/ C++ Standard Library\n#include <memory>\n#include <iostream>\n#include <cmath>\n\n\/\/ Boost\n#include <boost\/filesystem.hpp>\n\n\/\/ Armadillo\n#include <armadillo>\n\n\/\/ HOP\n#include <hop>\n\nextern boost::filesystem::path testDirectory;\nstatic std::string dataPath_ = \"\/data\/optimisationAlgorithm\/trajectoryBasedAlgrorithm\/hillClimbing\/\";\n\nclass TestHillClimbing : public hop::HillClimbing {\n public:\n TestHillClimbing(\n const std::shared_ptr<hop::OptimisationProblem> optimisationProblem)\n : HillClimbing(optimisationProblem),\n velocityIndex_(0){\n }\n\n arma::Col<double> getVelocity() override {\n return velocities_.col(velocityIndex_++);\n }\n\n void setVelocitys(arma::mat velocities){\n velocities_ = velocities;\n }\n\n protected:\n unsigned int velocityIndex_;\n arma::mat velocities_;\n};\n\nclass TestHillClimbingProblem : public hop::OptimisationProblem {\n public:\n TestHillClimbingProblem(\n const unsigned int numberOfDimensions)\n : OptimisationProblem(numberOfDimensions) {\n softConstraintsValuesIndex_ = 0;\n objectiveValuesIndex_ = 0;\n parameterHistory_.clear();\n }\n\n\n std::vector<arma::Col<double>> getParameterHistory() const noexcept {\n return parameterHistory_;\n }\n\n void setObjectiveValues(arma::Col<double> objectiveValues){\n objectiveValues_ = objectiveValues;\n }\n\n void setSoftConstraintsValues(arma::Col<double> softConstraintsValues){\n softConstraintsValues_ = softConstraintsValues;\n }\n\n protected:\n static unsigned int softConstraintsValuesIndex_;\n static unsigned int objectiveValuesIndex_;\n arma::Col<double> objectiveValues_;\n arma::Col<double> softConstraintsValues_;\n\n static std::vector<arma::Col<double>> parameterHistory_;\n\n double getSoftConstraintsValueImplementation(\n const arma::Col<double>& parameter) const override {\n\n return softConstraintsValues_.at(softConstraintsValuesIndex_++);\n }\n\n double getObjectiveValueImplementation(\n const arma::Col<double>& parameter) const override {\n parameterHistory_.push_back(parameter);\n\n return objectiveValues_.at(objectiveValuesIndex_++);\n }\n\n std::string to_string() const noexcept {\n return \"TestHillClimbing\";\n }\n};\n\ndecltype(TestHillClimbingProblem::parameterHistory_) TestHillClimbingProblem::parameterHistory_;\ndecltype(TestHillClimbingProblem::softConstraintsValuesIndex_) TestHillClimbingProblem::softConstraintsValuesIndex_;\ndecltype(TestHillClimbingProblem::objectiveValuesIndex_) TestHillClimbingProblem::objectiveValuesIndex_;\n\nTEST_CASE(\"Hill climbing\", \"\") {\n\n \/\/ Set OptimisationProblem values\n arma::Col<double> upperBounds;\n upperBounds.load(testDirectory.string() + dataPath_ + \"upperBounds.mat\"); \/\/the parametre is optional\n\n arma::Col<double> lowerBounds;\n lowerBounds.load(testDirectory.string() + dataPath_ + \"lowerBounds.mat\"); \/\/the parametre is optional\n\n arma::Col<double> objectiveValues;\n objectiveValues.load(testDirectory.string() + dataPath_ + \"objectiveValues[2.0].mat\");\n\n arma::Col<double> softConstraintsValues;\n softConstraintsValues.load(testDirectory.string() + dataPath_ + \"softConstraintsValues[2.0].mat\");\n\n \/\/ Init OptimisationProblem\n std::shared_ptr<TestHillClimbingProblem> testHillClimbingProblem(new TestHillClimbingProblem(upperBounds.n_elem));\n testHillClimbingProblem->setUpperBounds(upperBounds);\n testHillClimbingProblem->setLowerBounds(lowerBounds);\n testHillClimbingProblem->setAcceptableObjectiveValue(-500.0);\n testHillClimbingProblem->setObjectiveValues(objectiveValues);\n testHillClimbingProblem->setSoftConstraintsValues(softConstraintsValues);\n\n \/\/ Set OptimisationAlgorithm values\n arma::mat velocities;\n velocities.load(testDirectory.string() + dataPath_ + \"velocities[2.0].mat\");\n\n arma::Col<double> initialParameter;\n initialParameter.load(testDirectory.string() + dataPath_ + \"initialParameter[null].mat\"); \/\/the parametre is optional\n\n arma::Col<double> maximalStepSize;\n maximalStepSize.load(testDirectory.string() + dataPath_ + \"maximalStepSize[2.1].mat\"); \/\/the parametre is optional\n\n \/\/ Init OptimisationAlgorithm\n TestHillClimbing testHillClimbing(testHillClimbingProblem);\n testHillClimbing.setVelocitys(velocities);\n testHillClimbing.setInitialParameter(initialParameter);\n testHillClimbing.setMaximalStepSize(maximalStepSize);\n\n \/\/ Set Expected values\n arma::Mat<double> expectedParameterHistory;\n expectedParameterHistory.load(testDirectory.string() + dataPath_ + \"expected[2.1].mat\");\n\n \/\/ Run hill climbing algorithm\n testHillClimbing.optimise();\n \/\/ Comparing of candidateParameters\n std::vector<arma::Col<double>> actualParameterHistory = testHillClimbingProblem->getParameterHistory();\n\n\n for(std::size_t n = 0; n < expectedParameterHistory.n_cols; ++n) {\n arma::Col<double> expectedParameter = expectedParameterHistory.col(n);\n arma::Col<double> actualParameter = actualParameterHistory.at(n);\n\n for (std::size_t k = 0; k < expectedParameter.n_elem; ++k) {\n if(isfinite(expectedParameter.at(k))) {\n CHECK(actualParameter.at(k) == Approx(expectedParameter.at(k)));\n } elese {\n CHECK(actualParameter.at(k) == expectedParameter.at(k));\n }\n }\n }\n}\n\nTEST_CASE(\"Hill climbing (init Test)\", \"\") {\n\n \/\/ Set OptimisationProblem values\n arma::Col<double> upperBounds;\n upperBounds.load(testDirectory.string() + dataPath_ + \"upperBounds.mat\"); \/\/the parametre is optional\n\n arma::Col<double> lowerBounds;\n lowerBounds.load(testDirectory.string() + dataPath_ + \"lowerBounds.mat\"); \/\/the parametre is optional\n\n arma::Col<double> objectiveValues;\n objectiveValues.load(testDirectory.string() + dataPath_ + \"objectiveValues[1.0].mat\");\n\n arma::Col<double> softConstraintsValues;\n softConstraintsValues.load(testDirectory.string() + dataPath_ + \"softConstraintsValues[1.0].mat\");\n\n \/\/ Init OptimisationProblem\n std::shared_ptr<TestHillClimbingProblem> testHillClimbingProblem(new TestHillClimbingProblem(upperBounds.n_elem));\n testHillClimbingProblem->setUpperBounds(upperBounds);\n testHillClimbingProblem->setLowerBounds(lowerBounds);\n testHillClimbingProblem->setObjectiveValues(objectiveValues);\n testHillClimbingProblem->setSoftConstraintsValues(softConstraintsValues);\n testHillClimbingProblem->setAcceptableObjectiveValue(10.0);\n\n \/\/ Set OptimisationAlgorithm values\n arma::mat velocities;\n velocities.load(testDirectory.string() + dataPath_ + \"velocities[1.0].mat\");\n\n \/\/ Init OptimisationAlgorithm\n TestHillClimbing testHillClimbing(testHillClimbingProblem);\n testHillClimbing.setVelocitys(velocities);\n\n arma::Mat<double> expectedParameterHistory;\n\n SECTION(\"Check MaximalStepSize\"){\n arma::Col<double> initialParameter;\n initialParameter.load(testDirectory.string() + dataPath_ + \"initialParameter[null].mat\"); \/\/the parametre is optional\n\n expectedParameterHistory.load(testDirectory.string() + dataPath_ + \"expected[1.1].mat\");\n\n testHillClimbing.setInitialParameter(initialParameter);\n testHillClimbing.optimise();\n\n \/\/ Comparing of candidateParameters\n std::vector<arma::Col<double>> actualParameterHistory = testHillClimbingProblem->getParameterHistory();\n\n for(std::size_t n = 0; n < expectedParameterHistory.n_cols; ++n) {\n arma::Col<double> expectedParameter = expectedParameterHistory.col(n);\n arma::Col<double> actualParameter = actualParameterHistory.at(n);\n std::cout<<actualParameter;\n for (std::size_t k = 0; k < expectedParameter.n_elem; ++k) {\n if(isfinite(expectedParameter.at(k))) {\n CHECK(actualParameter.at(k) == Approx(expectedParameter.at(k)));\n } elese {\n CHECK(actualParameter.at(k) == expectedParameter.at(k));\n }\n }\n }\n\n }\n\/*\n SECTION(\"Check initialParameter at each limit \"){\n arma::Col<double> initialParameter;\n initialParameter.load(testDirectory.string() + dataPath_ + \"initialParameter[1.2].mat\"); \/\/the parametre is optional\n\n expectedParameterHistory.load(testDirectory.string() + dataPath_ + \"expected[1.2].mat\");\n\n testHillClimbing.setInitialParameter(initialParameter);\n testHillClimbing.optimise();\n\n \/\/ Comparing of candidateParameters\n std::vector<arma::Col<double>> actualParameterHistory = testHillClimbingProblem->getParameterHistory();\n\n for(std::size_t n = 0; n < expectedParameterHistory.n_cols; ++n) {\n arma::Col<double> expectedParameter = expectedParameterHistory.col(n);\n arma::Col<double> actualParameter = actualParameterHistory.at(n);\n\n for (std::size_t k = 0; k < expectedParameter.n_elem; ++k) {\n if(isfinite(expectedParameter.at(k))) {\n CHECK(actualParameter.at(k) == Approx(expectedParameter.at(k)));\n } elese {\n CHECK(actualParameter.at(k) == expectedParameter.at(k));\n }\n }\n }\n\n }\n*\/\n}\n<commit_msg>fix: Simple spelling error<commit_after>\/\/ Catch\n#include <catch.hpp>\n\n\/\/ C++ Standard Library\n#include <memory>\n#include <iostream>\n#include <cmath>\n\n\/\/ Boost\n#include <boost\/filesystem.hpp>\n\n\/\/ Armadillo\n#include <armadillo>\n\n\/\/ HOP\n#include <hop>\n\nextern boost::filesystem::path testDirectory;\nstatic std::string dataPath_ = \"\/data\/optimisationAlgorithm\/trajectoryBasedAlgrorithm\/hillClimbing\/\";\n\nclass TestHillClimbing : public hop::HillClimbing {\n public:\n TestHillClimbing(\n const std::shared_ptr<hop::OptimisationProblem> optimisationProblem)\n : HillClimbing(optimisationProblem),\n velocityIndex_(0){\n }\n\n arma::Col<double> getVelocity() override {\n return velocities_.col(velocityIndex_++);\n }\n\n void setVelocitys(arma::mat velocities){\n velocities_ = velocities;\n }\n\n protected:\n unsigned int velocityIndex_;\n arma::mat velocities_;\n};\n\nclass TestHillClimbingProblem : public hop::OptimisationProblem {\n public:\n TestHillClimbingProblem(\n const unsigned int numberOfDimensions)\n : OptimisationProblem(numberOfDimensions) {\n softConstraintsValuesIndex_ = 0;\n objectiveValuesIndex_ = 0;\n parameterHistory_.clear();\n }\n\n\n std::vector<arma::Col<double>> getParameterHistory() const noexcept {\n return parameterHistory_;\n }\n\n void setObjectiveValues(arma::Col<double> objectiveValues){\n objectiveValues_ = objectiveValues;\n }\n\n void setSoftConstraintsValues(arma::Col<double> softConstraintsValues){\n softConstraintsValues_ = softConstraintsValues;\n }\n\n protected:\n static unsigned int softConstraintsValuesIndex_;\n static unsigned int objectiveValuesIndex_;\n arma::Col<double> objectiveValues_;\n arma::Col<double> softConstraintsValues_;\n\n static std::vector<arma::Col<double>> parameterHistory_;\n\n double getSoftConstraintsValueImplementation(\n const arma::Col<double>& parameter) const override {\n\n return softConstraintsValues_.at(softConstraintsValuesIndex_++);\n }\n\n double getObjectiveValueImplementation(\n const arma::Col<double>& parameter) const override {\n parameterHistory_.push_back(parameter);\n\n return objectiveValues_.at(objectiveValuesIndex_++);\n }\n\n std::string to_string() const noexcept {\n return \"TestHillClimbing\";\n }\n};\n\ndecltype(TestHillClimbingProblem::parameterHistory_) TestHillClimbingProblem::parameterHistory_;\ndecltype(TestHillClimbingProblem::softConstraintsValuesIndex_) TestHillClimbingProblem::softConstraintsValuesIndex_;\ndecltype(TestHillClimbingProblem::objectiveValuesIndex_) TestHillClimbingProblem::objectiveValuesIndex_;\n\nTEST_CASE(\"Hill climbing\", \"\") {\n\n \/\/ Set OptimisationProblem values\n arma::Col<double> upperBounds;\n upperBounds.load(testDirectory.string() + dataPath_ + \"upperBounds.mat\"); \/\/the parametre is optional\n\n arma::Col<double> lowerBounds;\n lowerBounds.load(testDirectory.string() + dataPath_ + \"lowerBounds.mat\"); \/\/the parametre is optional\n\n arma::Col<double> objectiveValues;\n objectiveValues.load(testDirectory.string() + dataPath_ + \"objectiveValues[2.0].mat\");\n\n arma::Col<double> softConstraintsValues;\n softConstraintsValues.load(testDirectory.string() + dataPath_ + \"softConstraintsValues[2.0].mat\");\n\n \/\/ Init OptimisationProblem\n std::shared_ptr<TestHillClimbingProblem> testHillClimbingProblem(new TestHillClimbingProblem(upperBounds.n_elem));\n testHillClimbingProblem->setUpperBounds(upperBounds);\n testHillClimbingProblem->setLowerBounds(lowerBounds);\n testHillClimbingProblem->setAcceptableObjectiveValue(-500.0);\n testHillClimbingProblem->setObjectiveValues(objectiveValues);\n testHillClimbingProblem->setSoftConstraintsValues(softConstraintsValues);\n\n \/\/ Set OptimisationAlgorithm values\n arma::mat velocities;\n velocities.load(testDirectory.string() + dataPath_ + \"velocities[2.0].mat\");\n\n arma::Col<double> initialParameter;\n initialParameter.load(testDirectory.string() + dataPath_ + \"initialParameter[null].mat\"); \/\/the parametre is optional\n\n arma::Col<double> maximalStepSize;\n maximalStepSize.load(testDirectory.string() + dataPath_ + \"maximalStepSize[2.1].mat\"); \/\/the parametre is optional\n\n \/\/ Init OptimisationAlgorithm\n TestHillClimbing testHillClimbing(testHillClimbingProblem);\n testHillClimbing.setVelocitys(velocities);\n testHillClimbing.setInitialParameter(initialParameter);\n testHillClimbing.setMaximalStepSize(maximalStepSize);\n\n \/\/ Set Expected values\n arma::Mat<double> expectedParameterHistory;\n expectedParameterHistory.load(testDirectory.string() + dataPath_ + \"expected[2.1].mat\");\n\n \/\/ Run hill climbing algorithm\n testHillClimbing.optimise();\n \/\/ Comparing of candidateParameters\n std::vector<arma::Col<double>> actualParameterHistory = testHillClimbingProblem->getParameterHistory();\n\n\n for(std::size_t n = 0; n < expectedParameterHistory.n_cols; ++n) {\n arma::Col<double> expectedParameter = expectedParameterHistory.col(n);\n arma::Col<double> actualParameter = actualParameterHistory.at(n);\n\n for (std::size_t k = 0; k < expectedParameter.n_elem; ++k) {\n if(std::isfinite(expectedParameter.at(k))) {\n CHECK(actualParameter.at(k) == Approx(expectedParameter.at(k)));\n } else {\n CHECK(actualParameter.at(k) == expectedParameter.at(k));\n }\n }\n }\n}\n\nTEST_CASE(\"Hill climbing (init Test)\", \"\") {\n\n \/\/ Set OptimisationProblem values\n arma::Col<double> upperBounds;\n upperBounds.load(testDirectory.string() + dataPath_ + \"upperBounds.mat\"); \/\/the parametre is optional\n\n arma::Col<double> lowerBounds;\n lowerBounds.load(testDirectory.string() + dataPath_ + \"lowerBounds.mat\"); \/\/the parametre is optional\n\n arma::Col<double> objectiveValues;\n objectiveValues.load(testDirectory.string() + dataPath_ + \"objectiveValues[1.0].mat\");\n\n arma::Col<double> softConstraintsValues;\n softConstraintsValues.load(testDirectory.string() + dataPath_ + \"softConstraintsValues[1.0].mat\");\n\n \/\/ Init OptimisationProblem\n std::shared_ptr<TestHillClimbingProblem> testHillClimbingProblem(new TestHillClimbingProblem(upperBounds.n_elem));\n testHillClimbingProblem->setUpperBounds(upperBounds);\n testHillClimbingProblem->setLowerBounds(lowerBounds);\n testHillClimbingProblem->setObjectiveValues(objectiveValues);\n testHillClimbingProblem->setSoftConstraintsValues(softConstraintsValues);\n testHillClimbingProblem->setAcceptableObjectiveValue(10.0);\n\n \/\/ Set OptimisationAlgorithm values\n arma::mat velocities;\n velocities.load(testDirectory.string() + dataPath_ + \"velocities[1.0].mat\");\n\n \/\/ Init OptimisationAlgorithm\n TestHillClimbing testHillClimbing(testHillClimbingProblem);\n testHillClimbing.setVelocitys(velocities);\n\n arma::Mat<double> expectedParameterHistory;\n\n SECTION(\"Check MaximalStepSize\"){\n arma::Col<double> initialParameter;\n initialParameter.load(testDirectory.string() + dataPath_ + \"initialParameter[null].mat\"); \/\/the parametre is optional\n\n expectedParameterHistory.load(testDirectory.string() + dataPath_ + \"expected[1.1].mat\");\n\n testHillClimbing.setInitialParameter(initialParameter);\n testHillClimbing.optimise();\n\n \/\/ Comparing of candidateParameters\n std::vector<arma::Col<double>> actualParameterHistory = testHillClimbingProblem->getParameterHistory();\n\n for(std::size_t n = 0; n < expectedParameterHistory.n_cols; ++n) {\n arma::Col<double> expectedParameter = expectedParameterHistory.col(n);\n arma::Col<double> actualParameter = actualParameterHistory.at(n);\n std::cout<<actualParameter;\n for (std::size_t k = 0; k < expectedParameter.n_elem; ++k) {\n if(std::isfinite(expectedParameter.at(k))) {\n CHECK(actualParameter.at(k) == Approx(expectedParameter.at(k)));\n } else {\n CHECK(actualParameter.at(k) == expectedParameter.at(k));\n }\n }\n }\n\n }\n\/*\n SECTION(\"Check initialParameter at each limit \"){\n arma::Col<double> initialParameter;\n initialParameter.load(testDirectory.string() + dataPath_ + \"initialParameter[1.2].mat\"); \/\/the parametre is optional\n\n expectedParameterHistory.load(testDirectory.string() + dataPath_ + \"expected[1.2].mat\");\n\n testHillClimbing.setInitialParameter(initialParameter);\n testHillClimbing.optimise();\n\n \/\/ Comparing of candidateParameters\n std::vector<arma::Col<double>> actualParameterHistory = testHillClimbingProblem->getParameterHistory();\n\n for(std::size_t n = 0; n < expectedParameterHistory.n_cols; ++n) {\n arma::Col<double> expectedParameter = expectedParameterHistory.col(n);\n arma::Col<double> actualParameter = actualParameterHistory.at(n);\n\n for (std::size_t k = 0; k < expectedParameter.n_elem; ++k) {\n if(std::isfinite(expectedParameter.at(k))) {\n CHECK(actualParameter.at(k) == Approx(expectedParameter.at(k)));\n } else {\n CHECK(actualParameter.at(k) == expectedParameter.at(k));\n }\n }\n }\n\n }\n*\/\n}\n<|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\/\/ This one has to come first (includes the config.h)!\n#include \"main.hxx\"\n\n#include <tuple>\n\n#include <dune\/stuff\/common\/exceptions.hh>\n#include <dune\/stuff\/common\/logging.hh>\n#include <dune\/stuff\/la\/container.hh>\n#include <dune\/stuff\/la\/solver.hh>\n\n#include \"la_container.hh\"\n\n\/\/ toggle output\n\/\/std::ostream& out = std::cout;\nstd::ostream& out = DSC_LOG.devnull();\n\nusing namespace Dune::Stuff;\nusing namespace Dune::Stuff::LA;\n\ntypedef testing::Types< std::tuple< CommonDenseMatrix< double >, CommonDenseVector< double >, CommonDenseVector< double > >\n#if HAVE_EIGEN\n , std::tuple< EigenDenseMatrix< double >, EigenDenseVector< double >, EigenDenseVector< double > >\n , std::tuple< EigenDenseMatrix< double >, EigenDenseVector< double >, EigenMappedDenseVector< double > >\n , std::tuple< EigenDenseMatrix< double >, EigenMappedDenseVector< double >, EigenDenseVector< double > >\n , std::tuple< EigenDenseMatrix< double >, EigenMappedDenseVector< double >, EigenMappedDenseVector< double > >\n , std::tuple< EigenRowMajorSparseMatrix< double >, EigenDenseVector< double >, EigenDenseVector< double > >\n#endif \/\/ HAVE_EIGEN\n#if HAVE_DUNE_ISTL\n , std::tuple< IstlRowMajorSparseMatrix< double >, IstlDenseVector< double >, IstlDenseVector< double > >\n#endif\n > MatrixVectorCombinations;\n\ntemplate< class MatrixVectorCombination >\nstruct SolverTest\n : public ::testing::Test\n{\n typedef typename std::tuple_element< 0, MatrixVectorCombination >::type MatrixType;\n typedef typename std::tuple_element< 1, MatrixVectorCombination >::type RhsType;\n typedef typename std::tuple_element< 2, MatrixVectorCombination >::type SolutionType;\n\n typedef Solver< MatrixType > SolverType;\n\n static void produces_correct_results()\n {\n const size_t dim = 10;\n const MatrixType matrix = ContainerFactory< MatrixType >::create(dim);\n const RhsType rhs = ContainerFactory< RhsType >::create(dim);\n SolutionType solution = ContainerFactory< SolutionType >::create(dim);\n solution.scal(0);\n\n \/\/ dynamic test\n const SolverType solver(matrix);\n solver.apply(rhs, solution);\n if (!solution.almost_equal(rhs))\n DUNE_THROW(Exceptions::results_are_not_as_expected, \"Wrong solution!\");\n solution.scal(0);\n\n \/\/ static tests\n typedef typename SolverType::MatrixType M;\n std::vector< std::string > opts = SolverType::options();\n if (opts.size() == 0) DUNE_THROW(Exceptions::results_are_not_as_expected, \"Solver has no options!\");\n for (auto opt : opts) {\n out << \"solving with option '\" << opt << \"' and detailed options\" << std::endl;\n Common::Configuration detailed_opts = SolverType::options(opt);\n detailed_opts.report(out, \" \");\n\n \/\/ dynamic tests\n solver.apply(rhs, solution, opt);\n if (!solution.almost_equal(rhs))\n DUNE_THROW(Exceptions::results_are_not_as_expected, \"Wrong solution!\");\n solution.scal(0);\n\n solver.apply(rhs, solution, detailed_opts);\n if (!solution.almost_equal(rhs))\n DUNE_THROW(Exceptions::results_are_not_as_expected, \"Wrong solution!\");\n }\n } \/\/ ... produces_correct_results(...)\n}; \/\/ struct SolverTest\n\nTYPED_TEST_CASE(SolverTest, MatrixVectorCombinations);\nTYPED_TEST(SolverTest, behaves_correctly) {\n this->produces_correct_results();\n}\n\n<commit_msg>[test] switches a couple exceptions -> test macros<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\/\/ This one has to come first (includes the config.h)!\n#include \"main.hxx\"\n\n#include <tuple>\n\n#include <dune\/stuff\/common\/exceptions.hh>\n#include <dune\/stuff\/common\/logging.hh>\n#include <dune\/stuff\/la\/container.hh>\n#include <dune\/stuff\/la\/solver.hh>\n\n#include \"la_container.hh\"\n\n\/\/ toggle output\n\/\/std::ostream& out = std::cout;\nstd::ostream& out = DSC_LOG.devnull();\n\nusing namespace Dune::Stuff;\nusing namespace Dune::Stuff::LA;\n\ntypedef testing::Types< std::tuple< CommonDenseMatrix< double >, CommonDenseVector< double >, CommonDenseVector< double > >\n#if HAVE_EIGEN\n , std::tuple< EigenDenseMatrix< double >, EigenDenseVector< double >, EigenDenseVector< double > >\n , std::tuple< EigenDenseMatrix< double >, EigenDenseVector< double >, EigenMappedDenseVector< double > >\n , std::tuple< EigenDenseMatrix< double >, EigenMappedDenseVector< double >, EigenDenseVector< double > >\n , std::tuple< EigenDenseMatrix< double >, EigenMappedDenseVector< double >, EigenMappedDenseVector< double > >\n , std::tuple< EigenRowMajorSparseMatrix< double >, EigenDenseVector< double >, EigenDenseVector< double > >\n#endif \/\/ HAVE_EIGEN\n#if HAVE_DUNE_ISTL\n , std::tuple< IstlRowMajorSparseMatrix< double >, IstlDenseVector< double >, IstlDenseVector< double > >\n#endif\n > MatrixVectorCombinations;\n\ntemplate< class MatrixVectorCombination >\nstruct SolverTest\n : public ::testing::Test\n{\n typedef typename std::tuple_element< 0, MatrixVectorCombination >::type MatrixType;\n typedef typename std::tuple_element< 1, MatrixVectorCombination >::type RhsType;\n typedef typename std::tuple_element< 2, MatrixVectorCombination >::type SolutionType;\n\n typedef Solver< MatrixType > SolverType;\n\n static void produces_correct_results()\n {\n const size_t dim = 10;\n const MatrixType matrix = ContainerFactory< MatrixType >::create(dim);\n const RhsType rhs = ContainerFactory< RhsType >::create(dim);\n SolutionType solution = ContainerFactory< SolutionType >::create(dim);\n solution.scal(0);\n\n \/\/ dynamic test\n const SolverType solver(matrix);\n solver.apply(rhs, solution);\n EXPECT_TRUE(solution.almost_equal(rhs));\n solution.scal(0);\n\n \/\/ static tests\n typedef typename SolverType::MatrixType M;\n std::vector< std::string > opts = SolverType::options();\n if (opts.size() == 0) DUNE_THROW(Exceptions::results_are_not_as_expected, \"Solver has no options!\");\n for (auto opt : opts) {\n out << \"solving with option '\" << opt << \"' and detailed options\" << std::endl;\n Common::Configuration detailed_opts = SolverType::options(opt);\n detailed_opts.report(out, \" \");\n\n \/\/ dynamic tests\n solver.apply(rhs, solution, opt);\n EXPECT_TRUE(solution.almost_equal(rhs));\n solution.scal(0);\n\n solver.apply(rhs, solution, detailed_opts);\n EXPECT_TRUE(solution.almost_equal(rhs));\n }\n } \/\/ ... produces_correct_results(...)\n}; \/\/ struct SolverTest\n\nTYPED_TEST_CASE(SolverTest, MatrixVectorCombinations);\nTYPED_TEST(SolverTest, behaves_correctly) {\n this->produces_correct_results();\n}\n\n<|endoftext|>"} {"text":"<commit_before>\/*\n * Wrapper for execve(). Allows building the argument list\n * dynamically, and automatically de-consts the argument strings.\n *\n * author: Max Kellermann <mk@cm4all.com>\n *\/\n\n#include \"exec.hxx\"\n\n#include <assert.h>\n#include <string.h>\n#include <unistd.h>\n#include <errno.h>\n#include <stdio.h>\n#include <stdlib.h>\n\nvoid\nExec::SetEnv(const char *name, const char *value)\n{\n assert(name != nullptr);\n assert(value != nullptr);\n\n const size_t name_length = strlen(name);\n const size_t value_length = strlen(name);\n\n assert(name_length > 0);\n\n char *buffer = (char *)malloc(name_length + 1 + value_length + 1);\n memcpy(buffer, name, name_length);\n buffer[name_length] = '=';\n memcpy(buffer + name_length + 1, value, value_length);\n buffer[name_length + 1 + value_length] = 0;\n\n PutEnv(buffer);\n\n \/* no need to free this allocation; this process will be replaced\n soon by execve() anyway *\/\n}\n\nvoid\nExec::DoExec()\n{\n assert(!args.empty());\n\n args.push_back(nullptr);\n\n const char *path = args.front();\n const char *slash = strrchr(path, '\/');\n if (slash != nullptr && slash[1] != 0)\n args.front() = const_cast<char *>(slash + 1);\n\n env.push_back(nullptr);\n\n execve(path, args.raw(), env.raw());\n\n fprintf(stderr, \"failed to execute %s: %s\\n\", path, strerror(errno));\n _exit(1);\n}\n<commit_msg>exec: fix value corruption in SetEnv()<commit_after>\/*\n * Wrapper for execve(). Allows building the argument list\n * dynamically, and automatically de-consts the argument strings.\n *\n * author: Max Kellermann <mk@cm4all.com>\n *\/\n\n#include \"exec.hxx\"\n\n#include <assert.h>\n#include <string.h>\n#include <unistd.h>\n#include <errno.h>\n#include <stdio.h>\n#include <stdlib.h>\n\nvoid\nExec::SetEnv(const char *name, const char *value)\n{\n assert(name != nullptr);\n assert(value != nullptr);\n\n const size_t name_length = strlen(name);\n const size_t value_length = strlen(value);\n\n assert(name_length > 0);\n\n char *buffer = (char *)malloc(name_length + 1 + value_length + 1);\n memcpy(buffer, name, name_length);\n buffer[name_length] = '=';\n memcpy(buffer + name_length + 1, value, value_length);\n buffer[name_length + 1 + value_length] = 0;\n\n PutEnv(buffer);\n\n \/* no need to free this allocation; this process will be replaced\n soon by execve() anyway *\/\n}\n\nvoid\nExec::DoExec()\n{\n assert(!args.empty());\n\n args.push_back(nullptr);\n\n const char *path = args.front();\n const char *slash = strrchr(path, '\/');\n if (slash != nullptr && slash[1] != 0)\n args.front() = const_cast<char *>(slash + 1);\n\n env.push_back(nullptr);\n\n execve(path, args.raw(), env.raw());\n\n fprintf(stderr, \"failed to execute %s: %s\\n\", path, strerror(errno));\n _exit(1);\n}\n<|endoftext|>"} {"text":"<commit_before>\/* * * * * * * * * * * * *\\\n|* ╔═╗ v0.3 *|\n|* ╔═╦═╦═══╦═══╣ ╚═╦═╦═╗ *|\n|* ║ ╔═╣ '╔╬═╗╚╣ ║ ║ '║ *|\n|* ╚═╝ ╚═══╩═══╩═╩═╣ ╔═╝ *|\n|* * * * * * * * * ╚═╝ * *|\n|* Manipulation tool for *|\n|* ESRI Shapefiles *|\n|* * * * * * * * * * * * *|\n|* http:\/\/www.npolar.no\/ *|\n\\* * * * * * * * * * * * *\/\n\n#include \"file.hpp\"\n\nnamespace reshp\n{\n const file::endian::type file::endian::native = file::endian::detect();\n\n file::endian::type file::endian::detect()\n {\n union { uint32_t dw; uint8_t b[4]; }; dw = 0xAABBCCDD;\n \n if(b[0] == 0xAA && b[1] == 0xBB && b[2] == 0xCC && b[3] == 0xDD)\n return file::endian::big;\n \n if(b[0] == 0xDD && b[1] == 0xCC && b[2] == 0xBB && b[3] == 0xAA)\n return file::endian::little;\n \n return file::endian::unknown;\n }\n\n file::file() :\n file_(NULL),\n endian_(file::endian::native),\n eol_(file::eol::detect),\n modes_(file::mode::read),\n size_(0)\n {\n }\n\n file::~file()\n {\n close();\n }\n\n bool file::clear(const std::string& filename)\n {\n if(file::exists(filename))\n {\n FILE* fp = fopen(filename.c_str(), \"wb\");\n \n if(fp)\n {\n fclose(fp);\n return true;\n }\n }\n \n return false;\n }\n\n bool file::exists(const std::string& filename)\n {\n FILE* fp = fopen(filename.c_str(), \"rb\");\n \n if(fp)\n {\n fclose(fp);\n return true;\n }\n \n return false;\n }\n\n bool file::remove(const std::string& filename)\n {\n return (::remove(filename.c_str()) == 0 ? true : false);\n }\n\n bool file::rename(const std::string& oldname, const std::string& newname)\n {\n return (::rename(oldname.c_str(), newname.c_str()) == 0 ? true : false);\n }\n\n size_t file::size(const std::string& filename)\n {\n FILE* fp = fopen(filename.c_str(), \"rb\");\n \n if(fp)\n {\n fseek(fp, 0, SEEK_END);\n long int bytes = ftell(fp);\n \n if(bytes >= 0)\n {\n fclose(fp);\n return static_cast<size_t>(bytes);\n }\n \n fclose(fp);\n }\n \n return 0;\n }\n\n file::time file::timestamp(const std::string& filename)\n {\n file::time ft;\n \n memset(ft.accessed.data, 0, sizeof(ft.accessed.data));\n memset(ft.modified.data, 0, sizeof(ft.modified.data));\n \n if(file::exists(filename))\n {\n bool success = false;\n \n #if defined(__linux__)\n struct stat attr;\n success = (::stat(filename.c_str(), &attr) == 0);\n #elif defined(__WIN32)\n struct _stat attr;\n success = (::_stat(filename, &attr) == 0);\n #endif\n \n if(success)\n {\n struct tm* ltaccessed = localtime(&attr.st_atime);\n ft.accessed.year = ltaccessed->tm_year + 1900;\n ft.accessed.month = ltaccessed->tm_mon + 1;\n ft.accessed.day = ltaccessed->tm_mday;\n ft.accessed.hour = ltaccessed->tm_hour;\n ft.accessed.minute = ltaccessed->tm_min;\n ft.accessed.second = ltaccessed->tm_sec;\n \n struct tm* ltmodified = localtime(&attr.st_mtime);\n ft.modified.year = ltmodified->tm_year + 1900;\n ft.modified.month = ltmodified->tm_mon + 1;\n ft.modified.day = ltmodified->tm_mday;\n ft.modified.hour = ltaccessed->tm_hour;\n ft.modified.minute = ltaccessed->tm_min;\n ft.modified.second = ltaccessed->tm_sec;\n }\n }\n \n return ft;\n }\n\n bool file::clear()\n {\n if(file_ && (modes_ & file::mode::write))\n {\n char fmodes[4] = { 'w', 0, 0, 0 };\n uint8_t m = 1;\n \n if(modes_ & file::mode::read)\n fmodes[m++] = 'r';\n \n if(modes_ & file::mode::binary)\n fmodes[m++] = 'b';\n \n if((file_ = freopen(NULL, fmodes, file_)))\n {\n size_ = 0;\n return true;\n }\n }\n \n return false;\n }\n\n void file::close()\n {\n if(file_)\n {\n fclose(file_);\n file_ = NULL;\n }\n \n endian_ = file::endian::native;\n eol_ = file::eol::detect;\n modes_ = file::mode::read;\n size_ = 0;\n }\n\n bool file::eof() const\n {\n if(file_)\n {\n if(feof(file_))\n return true;\n \n char c = fgetc(file_);\n if(c == EOF) return true;\n else ungetc(c, file_);\n }\n \n return false;\n }\n\n bool file::open(const std::string& filename, const file::mode::flags modes, const file::eol::type eol)\n {\n close();\n \n char fmodes[4] = { 0, 0, 0, 0 };\n uint8_t m = 0;\n \n if(modes & file::mode::read)\n fmodes[m++] = 'r';\n \n if(modes & file::mode::write)\n fmodes[m++] = 'a';\n \n if(modes & file::mode::binary)\n fmodes[m++] = 'b';\n \n if((file_ = fopen(filename.c_str(), fmodes)))\n {\n if(!(modes & file::mode::binary))\n {\n if(eol == file::eol::detect)\n {\n fseek(file_, 0, SEEK_SET);\n \n for(char c = fgetc(file_); c != EOF; c = fgetc(file_))\n {\n if(c == '\\r')\n {\n eol_ = (fgetc(file_) == '\\n' ? file::eol::crlf : file::eol::cr);\n ungetc(c, file_);\n break;\n }\n else if(c == '\\n')\n {\n eol_ = (fgetc(file_) == '\\r' ? file::eol::lfcr : file::eol::lf);\n ungetc(c, file_);\n break;\n }\n }\n \n if(eol_ == file::eol::detect)\n {\n #if defined(__WIN32)\n eol_ = file::eol::crlf;\n #else\n eol_ = file::eol::lf;\n #endif\n }\n \n clearerr(file_);\n }\n else eol_ = eol;\n }\n \n fseek(file_, 0, SEEK_END);\n size_ = static_cast<size_t>(ftell(file_));\n \n if(!((modes_ = modes) & file::mode::write))\n fseek(file_, 0, SEEK_SET);\n \n return true;\n }\n \n return false;\n }\n\n bool file::opened() const\n {\n return (file_ ? true : false);\n }\n\n bool file::seek(const long position, const bool relative)\n {\n if(file_)\n {\n return (fseek(file_, position, (relative ? SEEK_CUR : SEEK_SET)) == 0);\n }\n \n return false;\n }\n\n size_t file::size() const\n {\n return size_;\n }\n\n long file::tell() const\n {\n if(file_)\n return ftell(file_);\n \n return -1;\n }\n\n bool file::read(char* dst, size_t bytes)\n {\n if(file_ && (modes_ & file::mode::read))\n if(fread(dst, bytes, 1, file_))\n return true;\n \n return false;\n }\n\n bool file::gets(std::string& str)\n {\n if(file_ && (modes_ & file::mode::read))\n {\n size_t len = 0;\n char* buf = NULL;\n \n if(modes_ & file::mode::binary)\n {\n for(char c = fgetc(file_); c != EOF; c = fgetc(file_), ++len)\n if(c == '\\0')\n break;\n \n if(len++ && (fseek(file_, -len, SEEK_CUR) == 0))\n {\n if((buf = new char[len]()))\n {\n if(!fread(buf, len, 1, file_))\n {\n delete [] buf;\n return false;\n }\n \n str = buf;\n delete [] buf;\n }\n }\n \n return true;\n }\n else\n {\n if((buf = new char[size_]()))\n {\n if(fscanf(file_, \"%s\", buf) == 1)\n {\n str = buf;\n delete [] buf;\n return true;\n }\n \n delete [] buf;\n }\n }\n }\n \n return false;\n }\n\n bool file::getline(std::string& str)\n {\n if(file_ && (modes_ & file::mode::read) && !(modes_ & file::mode::binary))\n {\n char eol[2] = { 0, 0 };\n \n switch(eol_)\n {\n case file::eol::cr: memcpy(eol, \"\\r\", 1); break;\n case file::eol::crlf: memcpy(eol, \"\\r\\r\", 2); break;\n case file::eol::lf: memcpy(eol, \"\\n\", 1); break;\n case file::eol::lfcr: memcpy(eol, \"\\n\\r\", 2); break;\n default:\n return false;\n }\n \n \/\/ Remove leading whitespace characters\n for(char c = fgetc(file_); c != EOF; ++c)\n {\n if(c != ' ' && c != '\\t' && c != '\\v' && c != '\\r' && c != '\\n')\n {\n ungetc(c, file_);\n break;\n }\n else continue;\n }\n \n for(char c = fgetc(file_), cc; c != EOF; c = fgetc(file_))\n {\n if(c == eol[0])\n {\n if(!eol[1] || (eol[1] && (cc = fgetc(file_)) == eol[1]))\n break;\n \n else if(eol[1])\n ungetc(cc, file_);\n }\n \n str += c;\n }\n \n return true;\n }\n \n return false;\n }\n\n file& file::operator>> (char& c)\n {\n read(&c, 1);\n return *this;\n }\n\n file& file::operator>> (int8_t& s)\n {\n geti(s);\n return *this;\n }\n\n file& file::operator>> (int16_t& s)\n {\n geti(s);\n return *this;\n }\n\n file& file::operator>> (int32_t& s)\n {\n geti(s);\n return *this;\n }\n\n file& file::operator>> (uint8_t& u)\n {\n geti(u);\n return *this;\n }\n\n file& file::operator>> (uint16_t& u)\n {\n geti(u);\n return *this;\n }\n\n file& file::operator>> (uint32_t& u)\n {\n geti(u);\n return *this;\n }\n\n file& file::operator>> (float& f)\n {\n getf(f);\n return *this;\n }\n\n file& file::operator>> (double& d)\n {\n getf(d);\n return *this;\n }\n\n file& file::operator>> (std::string& str)\n {\n gets(str);\n return *this;\n }\n\n #if __WORDSIZE == 64\n file& file::operator>> (int64_t& s)\n {\n geti(s);\n return *this;\n }\n\n file& file::operator>> (uint64_t& u)\n {\n geti(u);\n return *this;\n }\n #endif\n\n bool file::write(const char* src, size_t bytes)\n {\n if(file_ && (modes_ & file::mode::write))\n {\n if(fwrite(src, bytes, 1, file_))\n {\n size_ += bytes;\n return true;\n }\n }\n \n return false;\n }\n\n bool file::putline(const std::string& str)\n {\n if(file_ && (modes_ & file::mode::write) && !(modes_ & file::mode::binary))\n {\n if(ftell(file_) > 0)\n {\n switch(eol_)\n {\n case file::eol::cr: size_ += fwrite(\"\\r\", 1, 1, file_); break;\n case file::eol::crlf: size_ += fwrite(\"\\r\\n\", 1, 2, file_); break;\n case file::eol::lf: size_ += fwrite(\"\\n\", 1, 1, file_); break;\n case file::eol::lfcr: size_ += fwrite(\"\\n\\r\", 1, 2, file_); break;\n default:;\n }\n }\n \n if(fwrite(str.c_str(), str.length(), 1, file_))\n {\n size_ += str.length();\n return true;\n }\n }\n \n return false;\n }\n\n bool file::puts(const std::string& str)\n {\n if(file_ && (modes_ & file::mode::write))\n {\n if(fputs(str.c_str(), file_) != EOF)\n {\n size_ += str.length();\n \n if(fputc((modes_ & file::mode::binary) ? '\\0' : ' ', file_) != EOF)\n {\n size_ += 1;\n return true;\n }\n }\n }\n \n return false;\n }\n\n file& file::operator<< (const char c)\n {\n write(&c, 1);\n return *this;\n }\n\n file& file::operator<< (const int8_t s)\n {\n puti(s);\n return *this;\n }\n\n file& file::operator<< (const int16_t s)\n {\n puti(s);\n return *this;\n }\n\n file& file::operator<< (const int32_t s)\n {\n puti(s);\n return *this;\n }\n\n file& file::operator<< (const uint8_t u)\n {\n puti(u);\n return *this;\n }\n\n file& file::operator<< (const uint16_t u)\n {\n puti(u);\n return *this;\n }\n\n file& file::operator<< (const uint32_t u)\n {\n puti(u);\n return *this;\n }\n\n file& file::operator<< (const float f)\n {\n putf(f);\n return *this;\n }\n\n file& file::operator<< (const double d)\n {\n putf(d);\n return *this;\n }\n\n file& file::operator<< (const std::string& str)\n {\n puts(str);\n return *this;\n }\n\n #if __WORDSIZE == 64\n file& file::operator<< (const int64_t s)\n {\n puti(s);\n return *this;\n }\n\n file& file::operator<< (const uint64_t u)\n {\n puti(u);\n return *this;\n }\n #endif\n}\n<commit_msg>Fixed file::timestamp() bug for Windows builds<commit_after>\/* * * * * * * * * * * * *\\\n|* ╔═╗ v0.3 *|\n|* ╔═╦═╦═══╦═══╣ ╚═╦═╦═╗ *|\n|* ║ ╔═╣ '╔╬═╗╚╣ ║ ║ '║ *|\n|* ╚═╝ ╚═══╩═══╩═╩═╣ ╔═╝ *|\n|* * * * * * * * * ╚═╝ * *|\n|* Manipulation tool for *|\n|* ESRI Shapefiles *|\n|* * * * * * * * * * * * *|\n|* http:\/\/www.npolar.no\/ *|\n\\* * * * * * * * * * * * *\/\n\n#include \"file.hpp\"\n\nnamespace reshp\n{\n const file::endian::type file::endian::native = file::endian::detect();\n\n file::endian::type file::endian::detect()\n {\n union { uint32_t dw; uint8_t b[4]; }; dw = 0xAABBCCDD;\n \n if(b[0] == 0xAA && b[1] == 0xBB && b[2] == 0xCC && b[3] == 0xDD)\n return file::endian::big;\n \n if(b[0] == 0xDD && b[1] == 0xCC && b[2] == 0xBB && b[3] == 0xAA)\n return file::endian::little;\n \n return file::endian::unknown;\n }\n\n file::file() :\n file_(NULL),\n endian_(file::endian::native),\n eol_(file::eol::detect),\n modes_(file::mode::read),\n size_(0)\n {\n }\n\n file::~file()\n {\n close();\n }\n\n bool file::clear(const std::string& filename)\n {\n if(file::exists(filename))\n {\n FILE* fp = fopen(filename.c_str(), \"wb\");\n \n if(fp)\n {\n fclose(fp);\n return true;\n }\n }\n \n return false;\n }\n\n bool file::exists(const std::string& filename)\n {\n FILE* fp = fopen(filename.c_str(), \"rb\");\n \n if(fp)\n {\n fclose(fp);\n return true;\n }\n \n return false;\n }\n\n bool file::remove(const std::string& filename)\n {\n return (::remove(filename.c_str()) == 0 ? true : false);\n }\n\n bool file::rename(const std::string& oldname, const std::string& newname)\n {\n return (::rename(oldname.c_str(), newname.c_str()) == 0 ? true : false);\n }\n\n size_t file::size(const std::string& filename)\n {\n FILE* fp = fopen(filename.c_str(), \"rb\");\n \n if(fp)\n {\n fseek(fp, 0, SEEK_END);\n long int bytes = ftell(fp);\n \n if(bytes >= 0)\n {\n fclose(fp);\n return static_cast<size_t>(bytes);\n }\n \n fclose(fp);\n }\n \n return 0;\n }\n\n file::time file::timestamp(const std::string& filename)\n {\n file::time ft;\n \n memset(ft.accessed.data, 0, sizeof(ft.accessed.data));\n memset(ft.modified.data, 0, sizeof(ft.modified.data));\n \n if(file::exists(filename))\n {\n bool success = false;\n \n #if defined(__linux__)\n struct stat attr;\n success = (::stat(filename.c_str(), &attr) == 0);\n #elif defined(__WIN32)\n struct _stat attr;\n success = (::_stat(filename.c_str(), &attr) == 0);\n #endif\n \n if(success)\n {\n struct tm* ltaccessed = localtime(&attr.st_atime);\n ft.accessed.year = ltaccessed->tm_year + 1900;\n ft.accessed.month = ltaccessed->tm_mon + 1;\n ft.accessed.day = ltaccessed->tm_mday;\n ft.accessed.hour = ltaccessed->tm_hour;\n ft.accessed.minute = ltaccessed->tm_min;\n ft.accessed.second = ltaccessed->tm_sec;\n \n struct tm* ltmodified = localtime(&attr.st_mtime);\n ft.modified.year = ltmodified->tm_year + 1900;\n ft.modified.month = ltmodified->tm_mon + 1;\n ft.modified.day = ltmodified->tm_mday;\n ft.modified.hour = ltaccessed->tm_hour;\n ft.modified.minute = ltaccessed->tm_min;\n ft.modified.second = ltaccessed->tm_sec;\n }\n }\n \n return ft;\n }\n\n bool file::clear()\n {\n if(file_ && (modes_ & file::mode::write))\n {\n char fmodes[4] = { 'w', 0, 0, 0 };\n uint8_t m = 1;\n \n if(modes_ & file::mode::read)\n fmodes[m++] = 'r';\n \n if(modes_ & file::mode::binary)\n fmodes[m++] = 'b';\n \n if((file_ = freopen(NULL, fmodes, file_)))\n {\n size_ = 0;\n return true;\n }\n }\n \n return false;\n }\n\n void file::close()\n {\n if(file_)\n {\n fclose(file_);\n file_ = NULL;\n }\n \n endian_ = file::endian::native;\n eol_ = file::eol::detect;\n modes_ = file::mode::read;\n size_ = 0;\n }\n\n bool file::eof() const\n {\n if(file_)\n {\n if(feof(file_))\n return true;\n \n char c = fgetc(file_);\n if(c == EOF) return true;\n else ungetc(c, file_);\n }\n \n return false;\n }\n\n bool file::open(const std::string& filename, const file::mode::flags modes, const file::eol::type eol)\n {\n close();\n \n char fmodes[4] = { 0, 0, 0, 0 };\n uint8_t m = 0;\n \n if(modes & file::mode::read)\n fmodes[m++] = 'r';\n \n if(modes & file::mode::write)\n fmodes[m++] = 'a';\n \n if(modes & file::mode::binary)\n fmodes[m++] = 'b';\n \n if((file_ = fopen(filename.c_str(), fmodes)))\n {\n if(!(modes & file::mode::binary))\n {\n if(eol == file::eol::detect)\n {\n fseek(file_, 0, SEEK_SET);\n \n for(char c = fgetc(file_); c != EOF; c = fgetc(file_))\n {\n if(c == '\\r')\n {\n eol_ = (fgetc(file_) == '\\n' ? file::eol::crlf : file::eol::cr);\n ungetc(c, file_);\n break;\n }\n else if(c == '\\n')\n {\n eol_ = (fgetc(file_) == '\\r' ? file::eol::lfcr : file::eol::lf);\n ungetc(c, file_);\n break;\n }\n }\n \n if(eol_ == file::eol::detect)\n {\n #if defined(__WIN32)\n eol_ = file::eol::crlf;\n #else\n eol_ = file::eol::lf;\n #endif\n }\n \n clearerr(file_);\n }\n else eol_ = eol;\n }\n \n fseek(file_, 0, SEEK_END);\n size_ = static_cast<size_t>(ftell(file_));\n \n if(!((modes_ = modes) & file::mode::write))\n fseek(file_, 0, SEEK_SET);\n \n return true;\n }\n \n return false;\n }\n\n bool file::opened() const\n {\n return (file_ ? true : false);\n }\n\n bool file::seek(const long position, const bool relative)\n {\n if(file_)\n {\n return (fseek(file_, position, (relative ? SEEK_CUR : SEEK_SET)) == 0);\n }\n \n return false;\n }\n\n size_t file::size() const\n {\n return size_;\n }\n\n long file::tell() const\n {\n if(file_)\n return ftell(file_);\n \n return -1;\n }\n\n bool file::read(char* dst, size_t bytes)\n {\n if(file_ && (modes_ & file::mode::read))\n if(fread(dst, bytes, 1, file_))\n return true;\n \n return false;\n }\n\n bool file::gets(std::string& str)\n {\n if(file_ && (modes_ & file::mode::read))\n {\n size_t len = 0;\n char* buf = NULL;\n \n if(modes_ & file::mode::binary)\n {\n for(char c = fgetc(file_); c != EOF; c = fgetc(file_), ++len)\n if(c == '\\0')\n break;\n \n if(len++ && (fseek(file_, -len, SEEK_CUR) == 0))\n {\n if((buf = new char[len]()))\n {\n if(!fread(buf, len, 1, file_))\n {\n delete [] buf;\n return false;\n }\n \n str = buf;\n delete [] buf;\n }\n }\n \n return true;\n }\n else\n {\n if((buf = new char[size_]()))\n {\n if(fscanf(file_, \"%s\", buf) == 1)\n {\n str = buf;\n delete [] buf;\n return true;\n }\n \n delete [] buf;\n }\n }\n }\n \n return false;\n }\n\n bool file::getline(std::string& str)\n {\n if(file_ && (modes_ & file::mode::read) && !(modes_ & file::mode::binary))\n {\n char eol[2] = { 0, 0 };\n \n switch(eol_)\n {\n case file::eol::cr: memcpy(eol, \"\\r\", 1); break;\n case file::eol::crlf: memcpy(eol, \"\\r\\r\", 2); break;\n case file::eol::lf: memcpy(eol, \"\\n\", 1); break;\n case file::eol::lfcr: memcpy(eol, \"\\n\\r\", 2); break;\n default:\n return false;\n }\n \n \/\/ Remove leading whitespace characters\n for(char c = fgetc(file_); c != EOF; ++c)\n {\n if(c != ' ' && c != '\\t' && c != '\\v' && c != '\\r' && c != '\\n')\n {\n ungetc(c, file_);\n break;\n }\n else continue;\n }\n \n for(char c = fgetc(file_), cc; c != EOF; c = fgetc(file_))\n {\n if(c == eol[0])\n {\n if(!eol[1] || (eol[1] && (cc = fgetc(file_)) == eol[1]))\n break;\n \n else if(eol[1])\n ungetc(cc, file_);\n }\n \n str += c;\n }\n \n return true;\n }\n \n return false;\n }\n\n file& file::operator>> (char& c)\n {\n read(&c, 1);\n return *this;\n }\n\n file& file::operator>> (int8_t& s)\n {\n geti(s);\n return *this;\n }\n\n file& file::operator>> (int16_t& s)\n {\n geti(s);\n return *this;\n }\n\n file& file::operator>> (int32_t& s)\n {\n geti(s);\n return *this;\n }\n\n file& file::operator>> (uint8_t& u)\n {\n geti(u);\n return *this;\n }\n\n file& file::operator>> (uint16_t& u)\n {\n geti(u);\n return *this;\n }\n\n file& file::operator>> (uint32_t& u)\n {\n geti(u);\n return *this;\n }\n\n file& file::operator>> (float& f)\n {\n getf(f);\n return *this;\n }\n\n file& file::operator>> (double& d)\n {\n getf(d);\n return *this;\n }\n\n file& file::operator>> (std::string& str)\n {\n gets(str);\n return *this;\n }\n\n #if __WORDSIZE == 64\n file& file::operator>> (int64_t& s)\n {\n geti(s);\n return *this;\n }\n\n file& file::operator>> (uint64_t& u)\n {\n geti(u);\n return *this;\n }\n #endif\n\n bool file::write(const char* src, size_t bytes)\n {\n if(file_ && (modes_ & file::mode::write))\n {\n if(fwrite(src, bytes, 1, file_))\n {\n size_ += bytes;\n return true;\n }\n }\n \n return false;\n }\n\n bool file::putline(const std::string& str)\n {\n if(file_ && (modes_ & file::mode::write) && !(modes_ & file::mode::binary))\n {\n if(ftell(file_) > 0)\n {\n switch(eol_)\n {\n case file::eol::cr: size_ += fwrite(\"\\r\", 1, 1, file_); break;\n case file::eol::crlf: size_ += fwrite(\"\\r\\n\", 1, 2, file_); break;\n case file::eol::lf: size_ += fwrite(\"\\n\", 1, 1, file_); break;\n case file::eol::lfcr: size_ += fwrite(\"\\n\\r\", 1, 2, file_); break;\n default:;\n }\n }\n \n if(fwrite(str.c_str(), str.length(), 1, file_))\n {\n size_ += str.length();\n return true;\n }\n }\n \n return false;\n }\n\n bool file::puts(const std::string& str)\n {\n if(file_ && (modes_ & file::mode::write))\n {\n if(fputs(str.c_str(), file_) != EOF)\n {\n size_ += str.length();\n \n if(fputc((modes_ & file::mode::binary) ? '\\0' : ' ', file_) != EOF)\n {\n size_ += 1;\n return true;\n }\n }\n }\n \n return false;\n }\n\n file& file::operator<< (const char c)\n {\n write(&c, 1);\n return *this;\n }\n\n file& file::operator<< (const int8_t s)\n {\n puti(s);\n return *this;\n }\n\n file& file::operator<< (const int16_t s)\n {\n puti(s);\n return *this;\n }\n\n file& file::operator<< (const int32_t s)\n {\n puti(s);\n return *this;\n }\n\n file& file::operator<< (const uint8_t u)\n {\n puti(u);\n return *this;\n }\n\n file& file::operator<< (const uint16_t u)\n {\n puti(u);\n return *this;\n }\n\n file& file::operator<< (const uint32_t u)\n {\n puti(u);\n return *this;\n }\n\n file& file::operator<< (const float f)\n {\n putf(f);\n return *this;\n }\n\n file& file::operator<< (const double d)\n {\n putf(d);\n return *this;\n }\n\n file& file::operator<< (const std::string& str)\n {\n puts(str);\n return *this;\n }\n\n #if __WORDSIZE == 64\n file& file::operator<< (const int64_t s)\n {\n puti(s);\n return *this;\n }\n\n file& file::operator<< (const uint64_t u)\n {\n puti(u);\n return *this;\n }\n #endif\n}\n<|endoftext|>"} {"text":"<commit_before>\/**\n * @file file.cpp\n * @brief Classes for transferring files\n *\n * (c) 2013-2014 by Mega Limited, Auckland, 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\/file.h\"\n#include \"mega\/transfer.h\"\n#include \"mega\/transferslot.h\"\n#include \"mega\/megaclient.h\"\n#include \"mega\/sync.h\"\n#include \"mega\/command.h\"\n\nnamespace mega {\nFile::File()\n{\n transfer = NULL;\n hprivate = true;\n syncxfer = false;\n}\n\nFile::~File()\n{\n \/\/ if transfer currently running, stop\n if (transfer)\n {\n transfer->client->stopxfer(this);\n }\n}\n\nvoid File::prepare()\n{\n transfer->localfilename = localname;\n}\n\nvoid File::start()\n{\n}\n\nvoid File::progress()\n{\n}\n\nvoid File::completed(Transfer* t, LocalNode* l)\n{\n if (t->type == PUT)\n {\n NewNode* newnode = new NewNode[1];\n\n \/\/ build new node\n newnode->source = NEW_UPLOAD;\n\n \/\/ upload handle required to retrieve\/include pending file attributes\n newnode->uploadhandle = t->uploadhandle;\n\n \/\/ reference to uploaded file\n memcpy(newnode->uploadtoken, t->ultoken, sizeof newnode->uploadtoken);\n\n \/\/ file's crypto key\n newnode->nodekey.assign((char*)t->filekey, FILENODEKEYLENGTH);\n newnode->type = FILENODE;\n newnode->parenthandle = UNDEF;\n#ifdef ENABLE_SYNC\n if ((newnode->localnode = l))\n {\n l->newnode = newnode;\n newnode->syncid = l->syncid;\n }\n#endif\n AttrMap attrs;\n\n \/\/ store filename\n attrs.map['n'] = name;\n\n \/\/ store fingerprint\n t->serializefingerprint(&attrs.map['c']);\n\n string tattrstring;\n\n attrs.getjson(&tattrstring);\n\n newnode->attrstring = new string;\n t->client->makeattr(&t->key, newnode->attrstring, tattrstring.c_str());\n\n if (targetuser.size())\n {\n \/\/ drop file into targetuser's inbox\n t->client->reqtag = t->tag;\n t->client->putnodes(targetuser.c_str(), newnode, 1);\n }\n else\n {\n handle th = h;\n\n \/\/ inaccessible target folder - use \/ instead\n if (!t->client->nodebyhandle(th))\n {\n th = t->client->rootnodes[0];\n }\n#ifdef ENABLE_SYNC\n if (l)\n {\n t->client->syncadding++;\n }\n#endif\n t->client->reqs[t->client->r].add(new CommandPutNodes(t->client,\n th, NULL,\n newnode, 1,\n t->tag,\n#ifdef ENABLE_SYNC\n l ? PUTNODES_SYNC : PUTNODES_APP));\n#else\n PUTNODES_APP));\n#endif\n }\n }\n}\n\nvoid File::terminated()\n{\n\n}\n\n\/\/ do not retry crypto errors or administrative takedowns; retry other types of\n\/\/ failuresup to 16 times\nbool File::failed(error e)\n{\n return e != API_EKEY && e != API_EBLOCKED && transfer->failcount < 16;\n}\n\nvoid File::displayname(string* dname)\n{\n if (name.size())\n {\n *dname = name;\n }\n else\n {\n Node* n;\n\n if ((n = transfer->client->nodebyhandle(h)))\n {\n *dname = n->displayname();\n }\n else\n {\n *dname = \"DELETED\/UNAVAILABLE\";\n }\n }\n}\n\n#ifdef ENABLE_SYNC\nSyncFileGet::SyncFileGet(Sync* csync, Node* cn, string* clocalname)\n{\n sync = csync;\n\n n = cn;\n h = n->nodehandle;\n *(FileFingerprint*)this = *n;\n localname = *clocalname;\n\n syncxfer = true;\n n->syncget = this;\n}\n\nSyncFileGet::~SyncFileGet()\n{\n n->syncget = NULL;\n}\n\n\/\/ create sync-specific temp download directory and set unique filename\nvoid SyncFileGet::prepare()\n{\n if (!transfer->localfilename.size())\n {\n int i;\n string tmpname, lockname;\n\n tmpname = \"tmp\";\n sync->client->fsaccess->name2local(&tmpname);\n\n if (!sync->tmpfa)\n {\n sync->tmpfa = sync->client->fsaccess->newfileaccess();\n\n for (i = 3; i--;)\n {\n transfer->localfilename = sync->localdebris;\n sync->client->fsaccess->mkdirlocal(&transfer->localfilename, true);\n\n transfer->localfilename.append(sync->client->fsaccess->localseparator);\n transfer->localfilename.append(tmpname);\n sync->client->fsaccess->mkdirlocal(&transfer->localfilename);\n\n \/\/ lock it\n transfer->localfilename.append(sync->client->fsaccess->localseparator);\n lockname = \"lock\";\n sync->client->fsaccess->name2local(&lockname);\n transfer->localfilename.append(lockname);\n\n if (sync->tmpfa->fopen(&transfer->localfilename, false, true))\n {\n break;\n }\n }\n\n \/\/ if we failed to create the tmp dir three times in a row, fall\n \/\/ back to the sync's root\n if (i < 0)\n {\n delete sync->tmpfa;\n sync->tmpfa = NULL;\n }\n }\n\n if (sync->tmpfa)\n {\n transfer->localfilename = sync->localdebris;\n transfer->localfilename.append(sync->client->fsaccess->localseparator);\n transfer->localfilename.append(tmpname);\n }\n else\n {\n transfer->localfilename = sync->localroot.localname;\n }\n\n sync->client->fsaccess->tmpnamelocal(&tmpname);\n transfer->localfilename.append(sync->client->fsaccess->localseparator);\n transfer->localfilename.append(tmpname);\n }\n\n if (n->parent && n->parent->localnode)\n {\n n->parent->localnode->treestate(TREESTATE_SYNCING);\n }\n}\n\nbool SyncFileGet::failed(error e)\n{\n if (n->parent && n->parent->localnode)\n {\n n->parent->localnode->treestate(TREESTATE_PENDING);\n }\n\n return File::failed(e);\n}\n\n\/\/ update localname (parent's localnode)\nvoid SyncFileGet::updatelocalname()\n{\n attr_map::iterator ait;\n\n if ((ait = n->attrs.map.find('n')) != n->attrs.map.end())\n {\n if (n->parent && n->parent->localnode)\n {\n string tmpname = ait->second;\n\n sync->client->fsaccess->name2local(&tmpname);\n n->parent->localnode->getlocalpath(&localname);\n\n localname.append(sync->client->fsaccess->localseparator);\n localname.append(tmpname);\n }\n }\n}\n\n\/\/ add corresponding LocalNode (by path), then self-destruct\nvoid SyncFileGet::completed(Transfer* t, LocalNode* n)\n{\n sync->checkpath(NULL, &localname);\n delete this;\n}\n\nvoid SyncFileGet::terminated()\n{\n delete this;\n}\n#endif\n} \/\/ namespace\n<commit_msg>API_EOVERQUOTA finishes the transfer.<commit_after>\/**\n * @file file.cpp\n * @brief Classes for transferring files\n *\n * (c) 2013-2014 by Mega Limited, Auckland, 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\/file.h\"\n#include \"mega\/transfer.h\"\n#include \"mega\/transferslot.h\"\n#include \"mega\/megaclient.h\"\n#include \"mega\/sync.h\"\n#include \"mega\/command.h\"\n\nnamespace mega {\nFile::File()\n{\n transfer = NULL;\n hprivate = true;\n syncxfer = false;\n}\n\nFile::~File()\n{\n \/\/ if transfer currently running, stop\n if (transfer)\n {\n transfer->client->stopxfer(this);\n }\n}\n\nvoid File::prepare()\n{\n transfer->localfilename = localname;\n}\n\nvoid File::start()\n{\n}\n\nvoid File::progress()\n{\n}\n\nvoid File::completed(Transfer* t, LocalNode* l)\n{\n if (t->type == PUT)\n {\n NewNode* newnode = new NewNode[1];\n\n \/\/ build new node\n newnode->source = NEW_UPLOAD;\n\n \/\/ upload handle required to retrieve\/include pending file attributes\n newnode->uploadhandle = t->uploadhandle;\n\n \/\/ reference to uploaded file\n memcpy(newnode->uploadtoken, t->ultoken, sizeof newnode->uploadtoken);\n\n \/\/ file's crypto key\n newnode->nodekey.assign((char*)t->filekey, FILENODEKEYLENGTH);\n newnode->type = FILENODE;\n newnode->parenthandle = UNDEF;\n#ifdef ENABLE_SYNC\n if ((newnode->localnode = l))\n {\n l->newnode = newnode;\n newnode->syncid = l->syncid;\n }\n#endif\n AttrMap attrs;\n\n \/\/ store filename\n attrs.map['n'] = name;\n\n \/\/ store fingerprint\n t->serializefingerprint(&attrs.map['c']);\n\n string tattrstring;\n\n attrs.getjson(&tattrstring);\n\n newnode->attrstring = new string;\n t->client->makeattr(&t->key, newnode->attrstring, tattrstring.c_str());\n\n if (targetuser.size())\n {\n \/\/ drop file into targetuser's inbox\n t->client->reqtag = t->tag;\n t->client->putnodes(targetuser.c_str(), newnode, 1);\n }\n else\n {\n handle th = h;\n\n \/\/ inaccessible target folder - use \/ instead\n if (!t->client->nodebyhandle(th))\n {\n th = t->client->rootnodes[0];\n }\n#ifdef ENABLE_SYNC\n if (l)\n {\n t->client->syncadding++;\n }\n#endif\n t->client->reqs[t->client->r].add(new CommandPutNodes(t->client,\n th, NULL,\n newnode, 1,\n t->tag,\n#ifdef ENABLE_SYNC\n l ? PUTNODES_SYNC : PUTNODES_APP));\n#else\n PUTNODES_APP));\n#endif\n }\n }\n}\n\nvoid File::terminated()\n{\n\n}\n\n\/\/ do not retry crypto errors or administrative takedowns; retry other types of\n\/\/ failuresup to 16 times\nbool File::failed(error e)\n{\n return e != API_EKEY && e != API_EBLOCKED && e != API_EOVERQUOTA && transfer->failcount < 16;\n}\n\nvoid File::displayname(string* dname)\n{\n if (name.size())\n {\n *dname = name;\n }\n else\n {\n Node* n;\n\n if ((n = transfer->client->nodebyhandle(h)))\n {\n *dname = n->displayname();\n }\n else\n {\n *dname = \"DELETED\/UNAVAILABLE\";\n }\n }\n}\n\n#ifdef ENABLE_SYNC\nSyncFileGet::SyncFileGet(Sync* csync, Node* cn, string* clocalname)\n{\n sync = csync;\n\n n = cn;\n h = n->nodehandle;\n *(FileFingerprint*)this = *n;\n localname = *clocalname;\n\n syncxfer = true;\n n->syncget = this;\n}\n\nSyncFileGet::~SyncFileGet()\n{\n n->syncget = NULL;\n}\n\n\/\/ create sync-specific temp download directory and set unique filename\nvoid SyncFileGet::prepare()\n{\n if (!transfer->localfilename.size())\n {\n int i;\n string tmpname, lockname;\n\n tmpname = \"tmp\";\n sync->client->fsaccess->name2local(&tmpname);\n\n if (!sync->tmpfa)\n {\n sync->tmpfa = sync->client->fsaccess->newfileaccess();\n\n for (i = 3; i--;)\n {\n transfer->localfilename = sync->localdebris;\n sync->client->fsaccess->mkdirlocal(&transfer->localfilename, true);\n\n transfer->localfilename.append(sync->client->fsaccess->localseparator);\n transfer->localfilename.append(tmpname);\n sync->client->fsaccess->mkdirlocal(&transfer->localfilename);\n\n \/\/ lock it\n transfer->localfilename.append(sync->client->fsaccess->localseparator);\n lockname = \"lock\";\n sync->client->fsaccess->name2local(&lockname);\n transfer->localfilename.append(lockname);\n\n if (sync->tmpfa->fopen(&transfer->localfilename, false, true))\n {\n break;\n }\n }\n\n \/\/ if we failed to create the tmp dir three times in a row, fall\n \/\/ back to the sync's root\n if (i < 0)\n {\n delete sync->tmpfa;\n sync->tmpfa = NULL;\n }\n }\n\n if (sync->tmpfa)\n {\n transfer->localfilename = sync->localdebris;\n transfer->localfilename.append(sync->client->fsaccess->localseparator);\n transfer->localfilename.append(tmpname);\n }\n else\n {\n transfer->localfilename = sync->localroot.localname;\n }\n\n sync->client->fsaccess->tmpnamelocal(&tmpname);\n transfer->localfilename.append(sync->client->fsaccess->localseparator);\n transfer->localfilename.append(tmpname);\n }\n\n if (n->parent && n->parent->localnode)\n {\n n->parent->localnode->treestate(TREESTATE_SYNCING);\n }\n}\n\nbool SyncFileGet::failed(error e)\n{\n if (n->parent && n->parent->localnode)\n {\n n->parent->localnode->treestate(TREESTATE_PENDING);\n }\n\n return File::failed(e);\n}\n\n\/\/ update localname (parent's localnode)\nvoid SyncFileGet::updatelocalname()\n{\n attr_map::iterator ait;\n\n if ((ait = n->attrs.map.find('n')) != n->attrs.map.end())\n {\n if (n->parent && n->parent->localnode)\n {\n string tmpname = ait->second;\n\n sync->client->fsaccess->name2local(&tmpname);\n n->parent->localnode->getlocalpath(&localname);\n\n localname.append(sync->client->fsaccess->localseparator);\n localname.append(tmpname);\n }\n }\n}\n\n\/\/ add corresponding LocalNode (by path), then self-destruct\nvoid SyncFileGet::completed(Transfer* t, LocalNode* n)\n{\n sync->checkpath(NULL, &localname);\n delete this;\n}\n\nvoid SyncFileGet::terminated()\n{\n delete this;\n}\n#endif\n} \/\/ namespace\n<|endoftext|>"} {"text":"<commit_before>#include \"p3DFFT_to_iR.hpp\"\n#include \"Morton_shuffler.hpp\"\n#include <iostream>\n\nint myrank, nprocs;\n\nint main(int argc, char *argv[])\n{\n MPI_Init(&argc, &argv);\n MPI_Comm_rank(MPI_COMM_WORLD, &myrank);\n MPI_Comm_size(MPI_COMM_WORLD, &nprocs);\n\n int n, N, nfiles;\n if (argc == 4)\n {\n n = atoi(argv[1]);\n N = atoi(argv[2]);\n nfiles = atoi(argv[3]);\n }\n else\n {\n std::cerr <<\n \"not enough (or too many) parameters.\\naborting.\" <<\n std::endl;\n MPI_Finalize();\n return EXIT_SUCCESS;\n }\n p3DFFT_to_iR *r = new p3DFFT_to_iR(\n (n\/2+1), n, n,\n N, N, N,\n 2);\n\n \/\/ initialize file names\n char* ifile[2];\n for (int i=0; i<2; i++)\n {\n ifile[i] = (char*)malloc(100*sizeof(char));\n sprintf(ifile[i], \"Kdata%d\", i);\n }\n\n \/\/read\n r->read(ifile);\n for (int i = 0; i<2; i++)\n free(ifile[i]);\n\n Morton_shuffler *s = new Morton_shuffler(\n N, N, N, 2, nfiles);\n s->shuffle(r->r3, \"Rdata\");\n\n delete s;\n delete r;\n\n \/\/ clean up\n fftwf_mpi_cleanup();\n MPI_Finalize();\n return EXIT_SUCCESS;\n}\n\n<commit_msg>use 3 fields in full test<commit_after>#include \"p3DFFT_to_iR.hpp\"\n#include \"Morton_shuffler.hpp\"\n#include <iostream>\n\nint myrank, nprocs;\n\nint main(int argc, char *argv[])\n{\n MPI_Init(&argc, &argv);\n MPI_Comm_rank(MPI_COMM_WORLD, &myrank);\n MPI_Comm_size(MPI_COMM_WORLD, &nprocs);\n\n int n, N, nfiles, nfields;\n if (argc == 5)\n {\n n = atoi(argv[1]);\n N = atoi(argv[2]);\n nfiles = atoi(argv[3]);\n nfields = atoi(argv[4]);\n }\n else\n {\n std::cerr <<\n \"not enough (or too many) parameters.\\naborting.\" <<\n std::endl;\n MPI_Finalize();\n return EXIT_SUCCESS;\n }\n p3DFFT_to_iR *r = new p3DFFT_to_iR(\n (n\/2+1), n, n,\n N, N, N,\n nfields);\n\n \/\/ initialize file names\n char* ifile[nfields];\n for (int i=0; i<nfields; i++)\n {\n ifile[i] = (char*)malloc(100*sizeof(char));\n sprintf(ifile[i], \"Kdata%d\", i);\n }\n\n \/\/read\n r->read(ifile);\n for (int i = 0; i<nfields; i++)\n free(ifile[i]);\n\n Morton_shuffler *s = new Morton_shuffler(\n N, N, N, nfields, nfiles);\n s->shuffle(r->r3, \"Rdata\");\n\n delete s;\n delete r;\n\n \/\/ clean up\n fftwf_mpi_cleanup();\n MPI_Finalize();\n return EXIT_SUCCESS;\n}\n\n<|endoftext|>"} {"text":"<commit_before>#ifndef __NODE_GDAL_GLOBAL_H__\n#define __NODE_GDAL_GLOBAL_H__\n\n\/\/ v8\n#include <v8.h>\n\n\/\/ node\n#include <node.h>\n\n\/\/ ogr\n#include <ogr_api.h>\n#include <ogrsf_frmts.h>\n\n\/\/ gdal\n#include \"gdal_common.hpp\"\n#include \"gdal_driver.hpp\"\n#include \"gdal_dataset.hpp\"\n\nusing namespace v8;\nusing namespace node;\n\nnamespace node_gdal {\n\n\tstatic Handle<Value> open(const Arguments &args)\n\t{\n\t\tHandleScope scope;\n\n\t\tstd::string path;\n\t\tstd::string mode = \"r\";\n\t\tGDALAccess access = GA_ReadOnly;\n\n\t\tNODE_ARG_STR(0, \"path\", path);\n\t\tNODE_ARG_OPT_STR(1, \"update\", mode);\n\n\t\tif (mode == \"r+\") {\n\t\t\taccess = GA_Update;\n\t\t} else if (mode != \"r\") {\n\t\t\treturn NODE_THROW(\"Invalid open mode. Must be \\\"r\\\" or \\\"r+\\\"\");\n\t\t}\n\n\t\tOGRDataSource *ogr_ds = OGRSFDriverRegistrar::Open(path.c_str(), static_cast<int>(access));\n\t\tif(ogr_ds) {\n\t\t\treturn scope.Close(Dataset::New(ogr_ds));\n\t\t}\n\n\t\tGDALDataset *gdal_ds = (GDALDataset*) GDALOpen(path.c_str(), access);\n\t\tif(gdal_ds) {\n\t\t\treturn scope.Close(Dataset::New(gdal_ds));\n\t\t}\n\n\t\treturn NODE_THROW(\"Error opening dataset\");\n\t}\n\n\tstatic Handle<Value> setConfigOption(const Arguments &args)\n\t{\n\t\tHandleScope scope;\n\n\t\tstd::string name;\n\t\tstd::string val;\n\n\t\tNODE_ARG_STR(0, \"name\", name);\n\n\t\tif (args.Length() < 2) {\n\t\t\treturn NODE_THROW(\"string or null value must be provided\");\n\t\t}\n\t\tif(args[1]->IsString()){\n\t\t\tval = TOSTR(args[1]);\n\t\t\tCPLSetConfigOption(name.c_str(), val.c_str());\n\t\t} else if(args[1]->IsNull() || args[1]->IsUndefined()) {\n\t\t\tCPLSetConfigOption(name.c_str(), NULL);\n\t\t} else {\n\t\t\treturn NODE_THROW(\"value must be a string or null\");\n\t\t}\n\n\t\treturn Undefined();\n\t}\n\n\tstatic Handle<Value> getConfigOption(const Arguments &args)\n\t{\n\t\tHandleScope scope;\n\n\t\tstd::string name;\n\t\tNODE_ARG_STR(0, \"name\", name);\n\n\t\treturn scope.Close(SafeString::New(CPLGetConfigOption(name.c_str(), NULL)));\n\t}\n\n\tstatic Handle<Value> decToDMS(const Arguments &args){\n\t\tHandleScope scope;\n\n\t\tdouble angle;\n\t\tstd::string axis;\n\t\tint precision = 2;\n\t\tNODE_ARG_DOUBLE(0, \"angle\", angle);\n\t\tNODE_ARG_STR(1, \"axis\", axis);\n\t\tNODE_ARG_INT_OPT(2, \"precision\", precision);\n\n\t\tif (axis.length() > 0) {\n\t\t\taxis[0] = std::toupper(axis[0]);\n\t\t}\n\t\tif (axis != \"Lat\" && axis != \"Long\") {\n\t\t\treturn NODE_THROW(\"Axis must be 'lat' or 'long'\");\n\t\t}\n\n\t\treturn scope.Close(SafeString::New(GDALDecToDMS(angle, axis.c_str(), precision)));\n\t}\n}\n\n#endif\n<commit_msg>toupper, not std::toupper<commit_after>#ifndef __NODE_GDAL_GLOBAL_H__\n#define __NODE_GDAL_GLOBAL_H__\n\n\/\/ v8\n#include <v8.h>\n\n\/\/ node\n#include <node.h>\n\n\/\/ ogr\n#include <ogr_api.h>\n#include <ogrsf_frmts.h>\n\n\/\/ gdal\n#include \"gdal_common.hpp\"\n#include \"gdal_driver.hpp\"\n#include \"gdal_dataset.hpp\"\n\nusing namespace v8;\nusing namespace node;\n\nnamespace node_gdal {\n\n\tstatic Handle<Value> open(const Arguments &args)\n\t{\n\t\tHandleScope scope;\n\n\t\tstd::string path;\n\t\tstd::string mode = \"r\";\n\t\tGDALAccess access = GA_ReadOnly;\n\n\t\tNODE_ARG_STR(0, \"path\", path);\n\t\tNODE_ARG_OPT_STR(1, \"update\", mode);\n\n\t\tif (mode == \"r+\") {\n\t\t\taccess = GA_Update;\n\t\t} else if (mode != \"r\") {\n\t\t\treturn NODE_THROW(\"Invalid open mode. Must be \\\"r\\\" or \\\"r+\\\"\");\n\t\t}\n\n\t\tOGRDataSource *ogr_ds = OGRSFDriverRegistrar::Open(path.c_str(), static_cast<int>(access));\n\t\tif(ogr_ds) {\n\t\t\treturn scope.Close(Dataset::New(ogr_ds));\n\t\t}\n\n\t\tGDALDataset *gdal_ds = (GDALDataset*) GDALOpen(path.c_str(), access);\n\t\tif(gdal_ds) {\n\t\t\treturn scope.Close(Dataset::New(gdal_ds));\n\t\t}\n\n\t\treturn NODE_THROW(\"Error opening dataset\");\n\t}\n\n\tstatic Handle<Value> setConfigOption(const Arguments &args)\n\t{\n\t\tHandleScope scope;\n\n\t\tstd::string name;\n\t\tstd::string val;\n\n\t\tNODE_ARG_STR(0, \"name\", name);\n\n\t\tif (args.Length() < 2) {\n\t\t\treturn NODE_THROW(\"string or null value must be provided\");\n\t\t}\n\t\tif(args[1]->IsString()){\n\t\t\tval = TOSTR(args[1]);\n\t\t\tCPLSetConfigOption(name.c_str(), val.c_str());\n\t\t} else if(args[1]->IsNull() || args[1]->IsUndefined()) {\n\t\t\tCPLSetConfigOption(name.c_str(), NULL);\n\t\t} else {\n\t\t\treturn NODE_THROW(\"value must be a string or null\");\n\t\t}\n\n\t\treturn Undefined();\n\t}\n\n\tstatic Handle<Value> getConfigOption(const Arguments &args)\n\t{\n\t\tHandleScope scope;\n\n\t\tstd::string name;\n\t\tNODE_ARG_STR(0, \"name\", name);\n\n\t\treturn scope.Close(SafeString::New(CPLGetConfigOption(name.c_str(), NULL)));\n\t}\n\n\tstatic Handle<Value> decToDMS(const Arguments &args){\n\t\tHandleScope scope;\n\n\t\tdouble angle;\n\t\tstd::string axis;\n\t\tint precision = 2;\n\t\tNODE_ARG_DOUBLE(0, \"angle\", angle);\n\t\tNODE_ARG_STR(1, \"axis\", axis);\n\t\tNODE_ARG_INT_OPT(2, \"precision\", precision);\n\n\t\tif (axis.length() > 0) {\n\t\t\taxis[0] = toupper(axis[0]);\n\t\t}\n\t\tif (axis != \"Lat\" && axis != \"Long\") {\n\t\t\treturn NODE_THROW(\"Axis must be 'lat' or 'long'\");\n\t\t}\n\n\t\treturn scope.Close(SafeString::New(GDALDecToDMS(angle, axis.c_str(), precision)));\n\t}\n}\n\n#endif\n<|endoftext|>"} {"text":"<commit_before>\/\/ Scintilla source code edit control\n\/\/ @file LexAU3.cxx\n\/\/ Lexer for AutoIt3 http:\/\/www.hiddensoft.com\/autoit3\n\/\/ by Jos van der Zande, jvdzande@yahoo.com \n\/\/\n\/\/ Changes:\n\/\/\n\/\/ Copyright for Scintilla: 1998-2001 by Neil Hodgson <neilh@scintilla.org>\n\/\/ The License.txt file describes the conditions under which this software may be distributed.\n\/\/ Scintilla source code edit control\n\n#include <stdlib.h>\n#include <string.h>\n#include <ctype.h>\n#include <stdio.h>\n#include <stdarg.h>\n\n#include \"Platform.h\"\n\n#include \"PropSet.h\"\n#include \"Accessor.h\"\n#include \"StyleContext.h\"\n#include \"KeyWords.h\"\n#include \"Scintilla.h\"\n#include \"SciLexer.h\"\n\nstatic inline bool IsTypeCharacter(const int ch)\n{\n return ch == '$';\n}\nstatic inline bool IsAWordChar(const int ch)\n{\n return (ch < 0x80) && (isalnum(ch) || ch == '.' || ch == '_' || ch == '-');\n}\n\nstatic inline bool IsAWordStart(const int ch)\n{\n return (ch < 0x80) && (isalnum(ch) || ch == '_' || ch == '@' || ch == '#' || ch == '{' || ch == '+' || ch == '!' || ch == '#' || ch == '^');\n}\n\nstatic void ColouriseAU3Doc(unsigned int startPos, \n\t\t\t\t\t\t\tint length, int initStyle,\n\t\t\t\t\t\t\tWordList *keywordlists[],\n\t\t\t\t\t\t\tAccessor &styler) {\n\n WordList &keywords = *keywordlists[0];\n WordList &keywords2 = *keywordlists[1];\n WordList &keywords3 = *keywordlists[2];\n WordList &keywords4 = *keywordlists[3];\n styler.StartAt(startPos);\n\n StyleContext sc(startPos, length, initStyle, styler);\n\tchar si,sk;\n\tsi=0;\n\tsk=0;\n for (; sc.More(); sc.Forward()) {\n\t\tchar s[100];\n\t\tsc.GetCurrentLowered(s, sizeof(s));\n\t\tswitch (sc.state)\n {\n case SCE_AU3_COMMENTBLOCK:\n {\n if (sc.ch == '#') {sc.SetState(SCE_AU3_DEFAULT);}\n\t\t\t\tbreak;\n\t\t\t}\n case SCE_AU3_COMMENT:\n {\n if (sc.atLineEnd) {sc.SetState(SCE_AU3_DEFAULT);}\n break;\n }\n case SCE_AU3_OPERATOR:\n {\n sc.SetState(SCE_AU3_DEFAULT);\n break;\n }\n case SCE_AU3_KEYWORD:\n {\n if (!IsAWordChar(sc.ch))\n {\n if (!IsTypeCharacter(sc.ch))\n {\n\t\t\t\t\t\tif (strcmp(s, \"#cs\")==0 || strcmp(s, \"#comments_start\")==0)\n\t\t\t\t\t\t{\n\t\t\t\t\t\t\tsc.ChangeState(SCE_AU3_COMMENTBLOCK);\n\t\t\t\t\t\t\tsc.SetState(SCE_AU3_COMMENTBLOCK);\n\t\t\t\t\t\t}\n\t\t\t\t\t\telse if (strcmp(s, \"#ce\")==0 || strcmp(s, \"#comments_end\")==0) \n\t\t\t\t\t\t{\n\t\t\t\t\t\t\tsc.ChangeState(SCE_AU3_COMMENTBLOCK);\n\t\t\t\t\t\t\tsc.SetState(SCE_AU3_DEFAULT);\n\t\t\t\t\t\t}\n\t\t\t\t\t\telse if (keywords.InList(s)) {\n\t\t\t\t\t\t\tsc.ChangeState(SCE_AU3_KEYWORD);\n\t\t\t\t\t\t\tsc.SetState(SCE_AU3_DEFAULT);\n\t\t\t\t\t\t\t\/\/sc.SetState(SCE_AU3_KEYWORD);\n\t\t\t\t\t\t}\n\t\t\t\t\t\telse if (keywords2.InList(s)) {\n\t\t\t\t\t\t\tsc.ChangeState(SCE_AU3_FUNCTION);\n\t\t\t\t\t\t\tsc.SetState(SCE_AU3_DEFAULT);\n\t\t\t\t\t\t\t\/\/sc.SetState(SCE_AU3_FUNCTION);\n\t\t\t\t\t\t}\n\t\t\t\t\t\telse if (keywords3.InList(s)) {\n\t\t\t\t\t\t\tsc.ChangeState(SCE_AU3_MACRO);\n\t\t\t\t\t\t\tsc.SetState(SCE_AU3_DEFAULT);\n\t\t\t\t\t\t}\n\t\t\t\t\t\telse if (!IsAWordChar(sc.ch)) {\n\t\t\t\t\t\t\tsc.ChangeState(SCE_AU3_DEFAULT);\n\t\t\t\t\t\t\tsc.SetState(SCE_AU3_DEFAULT);\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\t\n if (sc.atLineEnd) {sc.SetState(SCE_AU3_DEFAULT);}\n break;\n }\n case SCE_AU3_NUMBER:\n {\n if (!IsAWordChar(sc.ch)) {sc.SetState(SCE_AU3_DEFAULT);}\n break;\n }\n case SCE_AU3_VARIABLE:\n {\n if (!IsAWordChar(sc.ch)) {sc.SetState(SCE_AU3_DEFAULT);}\n break;\n }\n case SCE_AU3_STRING:\n {\n\t\t\t\tsk = 0;\n\t\t\t\t\/\/ check for \" in and single qouted string\n\t if (si == 1){\n\t\t\t\t\tif (sc.ch == '\\\"'){sc.ForwardSetState(SCE_AU3_DEFAULT);}}\n\t\t\t\t\/\/ check for ' in and double qouted string\n if (si == 2){\n\t\t\t\t\tif (sc.ch == '\\''){sc.ForwardSetState(SCE_AU3_DEFAULT);}}\n if (sc.atLineEnd) {sc.SetState(SCE_AU3_DEFAULT);}\n\t\t\t\t\/\/ find Sendkeys in an STRING\n\t\t\t\tif (sc.ch == '{') {sc.SetState(SCE_AU3_SENT);}\n\t\t\t\tif (sc.ch == '+' && sc.chNext == '{') {sc.SetState(SCE_AU3_SENT);}\n\t\t\t\tif (sc.ch == '!' && sc.chNext == '{') {sc.SetState(SCE_AU3_SENT);}\n\t\t\t\tif (sc.ch == '^' && sc.chNext == '{') {sc.SetState(SCE_AU3_SENT);}\n\t\t\t\tif (sc.ch == '#' && sc.chNext == '{') {sc.SetState(SCE_AU3_SENT);}\n\t\t\t\tbreak;\n }\n \n case SCE_AU3_SENT:\n {\n\t\t\t\t\/\/ Sent key string ended \n\t\t\t\tif (sk == 1) \n\t\t\t\t{\n\t\t\t\t\t\/\/ set color to SENTKEY when valid sentkey .. else set to comment to show its wrong\n\t\t\t\t\tif (keywords4.InList(s)) \n\t\t\t\t\t{\n\t\t\t\t\t\tsc.ChangeState(SCE_AU3_SENT);\n\t\t\t\t\t}\n\t\t\t\t\telse\n\t\t\t\t\t{\n\t\t\t\t\t\tsc.ChangeState(SCE_AU3_STRING);\n\t\t\t\t\t}\n\t\t\t\t\tsc.SetState(SCE_AU3_STRING);\n\t\t\t\t\tsk=0;\n\t\t\t\t}\n\t\t\t\t\/\/ check if next portion is again a sentkey\n\t\t\t\tif (sc.atLineEnd) {sc.SetState(SCE_AU3_DEFAULT);}\n\t\t\t\tif (sc.ch == '{') {sc.SetState(SCE_AU3_SENT);}\n\t\t\t\tif (sc.ch == '+' && sc.chNext == '{') {sc.SetState(SCE_AU3_SENT);}\n\t\t\t\tif (sc.ch == '!' && sc.chNext == '{') {sc.SetState(SCE_AU3_SENT);}\n\t\t\t\tif (sc.ch == '^' && sc.chNext == '{') {sc.SetState(SCE_AU3_SENT);}\n\t\t\t\tif (sc.ch == '#' && sc.chNext == '{') {sc.SetState(SCE_AU3_SENT);}\n\t\t\t\t\/\/ check to see if the string ended...\n\t\t\t\t\/\/ check for \" in and single qouted string\n\t if (si == 1){\n\t\t\t\t\tif (sc.ch == '\\\"'){sc.ForwardSetState(SCE_AU3_DEFAULT);}}\n\t\t\t\t\/\/ check for ' in and double qouted string\n if (si == 2){\n\t\t\t\t\tif (sc.ch == '\\''){sc.ForwardSetState(SCE_AU3_DEFAULT);}}\n\t\t\t\tbreak;\n }\n } \/\/switch (sc.state)\n\n \/\/ Determine if a new state should be entered:\n if (sc.state == SCE_AU3_SENT)\n {\n\t\t\tif (sc.ch == '}' && sc.chNext != '}') \n\t\t\t{\n\t\t\t\tsk = 1;\n\t\t\t}\t\t\t\n\t\t}\n\t\tif (sc.state == SCE_AU3_DEFAULT)\n {\n if (sc.ch == ';') {sc.SetState(SCE_AU3_COMMENT);}\n else if (sc.ch == '#') {sc.SetState(SCE_AU3_KEYWORD);}\n else if (IsAWordStart(sc.ch)) {sc.SetState(SCE_AU3_KEYWORD);}\n else if (sc.ch == '@') {sc.SetState(SCE_AU3_KEYWORD);}\n else if (sc.ch == '\\\"') {\n\t\t\t\tsc.SetState(SCE_AU3_STRING);\n\t\t\t\tsi = 1;\t}\n else if (sc.ch == '\\'') {\n\t\t\t\tsc.SetState(SCE_AU3_STRING);\n\t\t\t\tsi = 2;\t}\n else if (sc.ch == '$') {sc.SetState(SCE_AU3_VARIABLE);}\n else if (IsADigit(sc.ch) || (sc.ch == '.' && IsADigit(sc.chNext))) {sc.SetState(SCE_AU3_NUMBER);}\n \/\/else if (IsAWordStart(sc.ch)) {sc.SetState(SCE_AU3_KEYWORD);}\n else if (isoperator(static_cast<char>(sc.ch)) || (sc.ch == '\\\\')) {sc.SetState(SCE_AU3_OPERATOR);}\n\t\t\telse if (sc.atLineEnd) {sc.SetState(SCE_AU3_DEFAULT);}\n }\n } \/\/for (; sc.More(); sc.Forward())\n sc.Complete();\n}\n\n\/\/\n\nstatic const char * const AU3WordLists[] = {\n \"#autoit keywords\",\n \"#autoit functions\",\n \"#autoit macros\",\n \"#autoit Sent keys\",\n 0\n};\nLexerModule lmAU3(SCLEX_AU3, ColouriseAU3Doc, \"au3\", NULL , AU3WordLists);\n<commit_msg>Folder added by Jos.<commit_after>\/\/ Scintilla source code edit control\n\/\/ @file LexAU3.cxx\n\/\/ Lexer for AutoIt3 http:\/\/www.hiddensoft.com\/autoit3\n\/\/ by Jos van der Zande, jvdzande@yahoo.com \n\/\/\n\/\/ Changes:\n\/\/\n\/\/ Copyright for Scintilla: 1998-2001 by Neil Hodgson <neilh@scintilla.org>\n\/\/ The License.txt file describes the conditions under which this software may be distributed.\n\/\/ Scintilla source code edit control\n\n#include <stdlib.h>\n#include <string.h>\n#include <ctype.h>\n#include <stdio.h>\n#include <stdarg.h>\n\n#include \"Platform.h\"\n\n#include \"PropSet.h\"\n#include \"Accessor.h\"\n#include \"StyleContext.h\"\n#include \"KeyWords.h\"\n#include \"Scintilla.h\"\n#include \"SciLexer.h\"\n\nstatic bool IsAU3Comment(Accessor &styler, int pos, int len) {\n\treturn len>0 && styler[pos]==';';\n}\n\nstatic inline bool IsTypeCharacter(const int ch)\n{\n return ch == '$';\n}\nstatic inline bool IsAWordChar(const int ch)\n{\n return (ch < 0x80) && (isalnum(ch) || ch == '.' || ch == '_' || ch == '-');\n}\n\nstatic inline bool IsAWordStart(const int ch)\n{\n return (ch < 0x80) && (isalnum(ch) || ch == '_' || ch == '@' || ch == '#' || ch == '{' || ch == '+' || ch == '!' || ch == '#' || ch == '^');\n}\n\nstatic void ColouriseAU3Doc(unsigned int startPos, \n\t\t\t\t\t\t\tint length, int initStyle,\n\t\t\t\t\t\t\tWordList *keywordlists[],\n\t\t\t\t\t\t\tAccessor &styler) {\n\n WordList &keywords = *keywordlists[0];\n WordList &keywords2 = *keywordlists[1];\n WordList &keywords3 = *keywordlists[2];\n WordList &keywords4 = *keywordlists[3];\n styler.StartAt(startPos);\n\n StyleContext sc(startPos, length, initStyle, styler);\n\tchar si,sk;\n\tsi=0;\n\tsk=0;\n for (; sc.More(); sc.Forward()) {\n\t\tchar s[100];\n\t\tsc.GetCurrentLowered(s, sizeof(s));\n\t\tswitch (sc.state)\n {\n case SCE_AU3_COMMENTBLOCK:\n {\n if (sc.ch == '#') {sc.SetState(SCE_AU3_DEFAULT);}\n\t\t\t\tbreak;\n\t\t\t}\n case SCE_AU3_COMMENT:\n {\n if (sc.atLineEnd) {sc.SetState(SCE_AU3_DEFAULT);}\n break;\n }\n case SCE_AU3_OPERATOR:\n {\n sc.SetState(SCE_AU3_DEFAULT);\n break;\n }\n case SCE_AU3_KEYWORD:\n {\n if (!IsAWordChar(sc.ch))\n {\n if (!IsTypeCharacter(sc.ch))\n {\n\t\t\t\t\t\tif (strcmp(s, \"#cs\")==0 || strcmp(s, \"#comments_start\")==0)\n\t\t\t\t\t\t{\n\t\t\t\t\t\t\tsc.ChangeState(SCE_AU3_COMMENTBLOCK);\n\t\t\t\t\t\t\tsc.SetState(SCE_AU3_COMMENTBLOCK);\n\t\t\t\t\t\t}\n\t\t\t\t\t\telse if (strcmp(s, \"#ce\")==0 || strcmp(s, \"#comments_end\")==0) \n\t\t\t\t\t\t{\n\t\t\t\t\t\t\tsc.ChangeState(SCE_AU3_COMMENTBLOCK);\n\t\t\t\t\t\t\tsc.SetState(SCE_AU3_DEFAULT);\n\t\t\t\t\t\t}\n\t\t\t\t\t\telse if (keywords.InList(s)) {\n\t\t\t\t\t\t\tsc.ChangeState(SCE_AU3_KEYWORD);\n\t\t\t\t\t\t\tsc.SetState(SCE_AU3_DEFAULT);\n\t\t\t\t\t\t\t\/\/sc.SetState(SCE_AU3_KEYWORD);\n\t\t\t\t\t\t}\n\t\t\t\t\t\telse if (keywords2.InList(s)) {\n\t\t\t\t\t\t\tsc.ChangeState(SCE_AU3_FUNCTION);\n\t\t\t\t\t\t\tsc.SetState(SCE_AU3_DEFAULT);\n\t\t\t\t\t\t\t\/\/sc.SetState(SCE_AU3_FUNCTION);\n\t\t\t\t\t\t}\n\t\t\t\t\t\telse if (keywords3.InList(s)) {\n\t\t\t\t\t\t\tsc.ChangeState(SCE_AU3_MACRO);\n\t\t\t\t\t\t\tsc.SetState(SCE_AU3_DEFAULT);\n\t\t\t\t\t\t}\n\t\t\t\t\t\telse if (!IsAWordChar(sc.ch)) {\n\t\t\t\t\t\t\tsc.ChangeState(SCE_AU3_DEFAULT);\n\t\t\t\t\t\t\tsc.SetState(SCE_AU3_DEFAULT);\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\t\n if (sc.atLineEnd) {sc.SetState(SCE_AU3_DEFAULT);}\n break;\n }\n case SCE_AU3_NUMBER:\n {\n if (!IsAWordChar(sc.ch)) {sc.SetState(SCE_AU3_DEFAULT);}\n break;\n }\n case SCE_AU3_VARIABLE:\n {\n if (!IsAWordChar(sc.ch)) {sc.SetState(SCE_AU3_DEFAULT);}\n break;\n }\n case SCE_AU3_STRING:\n {\n\t\t\t\tsk = 0;\n\t\t\t\t\/\/ check for \" in and single qouted string\n\t if (si == 1){\n\t\t\t\t\tif (sc.ch == '\\\"'){sc.ForwardSetState(SCE_AU3_DEFAULT);}}\n\t\t\t\t\/\/ check for ' in and double qouted string\n if (si == 2){\n\t\t\t\t\tif (sc.ch == '\\''){sc.ForwardSetState(SCE_AU3_DEFAULT);}}\n if (sc.atLineEnd) {sc.SetState(SCE_AU3_DEFAULT);}\n\t\t\t\t\/\/ find Sendkeys in an STRING\n\t\t\t\tif (sc.ch == '{') {sc.SetState(SCE_AU3_SENT);}\n\t\t\t\tif (sc.ch == '+' && sc.chNext == '{') {sc.SetState(SCE_AU3_SENT);}\n\t\t\t\tif (sc.ch == '!' && sc.chNext == '{') {sc.SetState(SCE_AU3_SENT);}\n\t\t\t\tif (sc.ch == '^' && sc.chNext == '{') {sc.SetState(SCE_AU3_SENT);}\n\t\t\t\tif (sc.ch == '#' && sc.chNext == '{') {sc.SetState(SCE_AU3_SENT);}\n\t\t\t\tbreak;\n }\n \n case SCE_AU3_SENT:\n {\n\t\t\t\t\/\/ Sent key string ended \n\t\t\t\tif (sk == 1) \n\t\t\t\t{\n\t\t\t\t\t\/\/ set color to SENTKEY when valid sentkey .. else set to comment to show its wrong\n\t\t\t\t\tif (keywords4.InList(s)) \n\t\t\t\t\t{\n\t\t\t\t\t\tsc.ChangeState(SCE_AU3_SENT);\n\t\t\t\t\t}\n\t\t\t\t\telse\n\t\t\t\t\t{\n\t\t\t\t\t\tsc.ChangeState(SCE_AU3_STRING);\n\t\t\t\t\t}\n\t\t\t\t\tsc.SetState(SCE_AU3_STRING);\n\t\t\t\t\tsk=0;\n\t\t\t\t}\n\t\t\t\t\/\/ check if next portion is again a sentkey\n\t\t\t\tif (sc.atLineEnd) {sc.SetState(SCE_AU3_DEFAULT);}\n\t\t\t\tif (sc.ch == '{') {sc.SetState(SCE_AU3_SENT);}\n\t\t\t\tif (sc.ch == '+' && sc.chNext == '{') {sc.SetState(SCE_AU3_SENT);}\n\t\t\t\tif (sc.ch == '!' && sc.chNext == '{') {sc.SetState(SCE_AU3_SENT);}\n\t\t\t\tif (sc.ch == '^' && sc.chNext == '{') {sc.SetState(SCE_AU3_SENT);}\n\t\t\t\tif (sc.ch == '#' && sc.chNext == '{') {sc.SetState(SCE_AU3_SENT);}\n\t\t\t\t\/\/ check to see if the string ended...\n\t\t\t\t\/\/ check for \" in and single qouted string\n\t if (si == 1){\n\t\t\t\t\tif (sc.ch == '\\\"'){sc.ForwardSetState(SCE_AU3_DEFAULT);}}\n\t\t\t\t\/\/ check for ' in and double qouted string\n if (si == 2){\n\t\t\t\t\tif (sc.ch == '\\''){sc.ForwardSetState(SCE_AU3_DEFAULT);}}\n\t\t\t\tbreak;\n }\n } \/\/switch (sc.state)\n\n \/\/ Determine if a new state should be entered:\n if (sc.state == SCE_AU3_SENT)\n {\n\t\t\tif (sc.ch == '}' && sc.chNext != '}') \n\t\t\t{\n\t\t\t\tsk = 1;\n\t\t\t}\t\t\t\n\t\t}\n\t\tif (sc.state == SCE_AU3_DEFAULT)\n {\n if (sc.ch == ';') {sc.SetState(SCE_AU3_COMMENT);}\n else if (sc.ch == '#') {sc.SetState(SCE_AU3_KEYWORD);}\n else if (IsAWordStart(sc.ch)) {sc.SetState(SCE_AU3_KEYWORD);}\n else if (sc.ch == '@') {sc.SetState(SCE_AU3_KEYWORD);}\n else if (sc.ch == '\\\"') {\n\t\t\t\tsc.SetState(SCE_AU3_STRING);\n\t\t\t\tsi = 1;\t}\n else if (sc.ch == '\\'') {\n\t\t\t\tsc.SetState(SCE_AU3_STRING);\n\t\t\t\tsi = 2;\t}\n else if (sc.ch == '$') {sc.SetState(SCE_AU3_VARIABLE);}\n else if (IsADigit(sc.ch) || (sc.ch == '.' && IsADigit(sc.chNext))) {sc.SetState(SCE_AU3_NUMBER);}\n \/\/else if (IsAWordStart(sc.ch)) {sc.SetState(SCE_AU3_KEYWORD);}\n else if (isoperator(static_cast<char>(sc.ch)) || (sc.ch == '\\\\')) {sc.SetState(SCE_AU3_OPERATOR);}\n\t\t\telse if (sc.atLineEnd) {sc.SetState(SCE_AU3_DEFAULT);}\n }\n } \/\/for (; sc.More(); sc.Forward())\n sc.Complete();\n}\n\n\/\/\n\/\/\nstatic void FoldAU3Doc(unsigned int startPos, int length, int, WordList *[], Accessor &styler)\n{\n\t\tint endPos = startPos + length;\n\n\t\/\/ Backtrack to previous line in case need to fix its fold status\n\tint lineCurrent = styler.GetLine(startPos);\n\tif (startPos > 0) {\n\t\tif (lineCurrent > 0) {\n\t\t\tlineCurrent--;\n\t\t\tstartPos = styler.LineStart(lineCurrent);\n\t\t}\n\t}\n\tint spaceFlags = 0;\n\tint indentCurrent = styler.IndentAmount(lineCurrent, &spaceFlags, IsAU3Comment);\n\tchar chNext = styler[startPos];\n\tfor (int i = startPos; i < endPos; i++) {\n\t\tchar ch = chNext;\n\t\tchNext = styler.SafeGetCharAt(i + 1);\n\n\t\tif ((ch == '\\r' && chNext != '\\n') || (ch == '\\n') || (i == endPos)) {\n\t\t\tint lev = indentCurrent;\n\t\t\tint indentNext = styler.IndentAmount(lineCurrent + 1, &spaceFlags, IsAU3Comment);\n\t\t\tif (!(indentCurrent & SC_FOLDLEVELWHITEFLAG)) {\n\t\t\t\t\/\/ Only non whitespace lines can be headers\n\t\t\t\tif ((indentCurrent & SC_FOLDLEVELNUMBERMASK) < (indentNext & SC_FOLDLEVELNUMBERMASK)) {\n\t\t\t\t\tlev |= SC_FOLDLEVELHEADERFLAG;\n\t\t\t\t} else if (indentNext & SC_FOLDLEVELWHITEFLAG) {\n\t\t\t\t\t\/\/ Line after is blank so check the next - maybe should continue further?\n\t\t\t\t\tint spaceFlags2 = 0;\n\t\t\t\t\tint indentNext2 = styler.IndentAmount(lineCurrent + 2, &spaceFlags2, IsAU3Comment);\n\t\t\t\t\tif ((indentCurrent & SC_FOLDLEVELNUMBERMASK) < (indentNext2 & SC_FOLDLEVELNUMBERMASK)) {\n\t\t\t\t\t\tlev |= SC_FOLDLEVELHEADERFLAG;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t\tindentCurrent = indentNext;\n\t\t\tstyler.SetLevel(lineCurrent, lev);\n\t\t\tlineCurrent++;\n\t\t}\n\t}\n\n}\n\n\n\n\/\/\n\nstatic const char * const AU3WordLists[] = {\n \"#autoit keywords\",\n \"#autoit functions\",\n \"#autoit macros\",\n \"#autoit Sent keys\",\n 0\n};\nLexerModule lmAU3(SCLEX_AU3, ColouriseAU3Doc, \"au3\", FoldAU3Doc , AU3WordLists);\n<|endoftext|>"} {"text":"<commit_before>#include \"common.th\"\n#include \"errno.th\"\n\n#define RANK_0_LOG 4\n#define RANK_0_SIZE (1 << RANK_0_LOG)\n#define RANKS 3\n\n\/\/ NOTE there are some assumptions in the below code that NPER * BPER = 32,\n\/\/ notably in DIFF()\n#define NPERBITS 4\n#define BPERBITS 1\n\n#define NPER (1 << NPERBITS)\n#define BPER (1 << BPERBITS)\n\n#define TN rel(nodes)\n\n\/\/ TODO size `nodes' appropriately\nnodes:\n .word 0\n\n\/\/ TODO initialise counts appropriately\ncounts:\n .word 0, 0, 1\n\n\/\/ Type `SZ' is a word-wide unsigned integer (some places used as a boolean).\n\/\/ Type `NP' is a word-wide struct, where the word is split into a 28-bit word\n\/\/ pointer and a 4-bit index into the word pointed to. The word pointer must\n\/\/ have bit 27-31 the same (i.e. we must be able to sign-extend the 28-pointer\n\/\/ to get the original 32-bit pointer).\n\n\/\/ NODE gets SZ index in C, returns NP node in B, clobbers C\n#define NODE(B,C) \\\n B <- C << BPERBITS ; \\\n B <- B + TN ; \\\n C <- C & (BPER - 1) ; \\\n B <- B | C ; \\\n \/\/\n\n\/\/ IRANK gets SZ rank in C, returns SZ inverted-rank in B\n#define IRANK(B,C) \\\n B <- - C + (RANKS - 1) ; \\\n \/\/\n\n\/\/ DIFF gets NP a in C, NP b in D, returns SZ distance in B\n#define DIFF(B,C,D) \\\n B <- C - D ; \\\n \/\/\n\n\/\/ INDEX gets NP n in C, returns SZ distance from TN in B\n#define INDEX(B,C) \\\n B <- TN ; \\\n B <- B << BPERBITS ; \\\n DIFF(B,C,B) ; \\\n \/\/\n\n\/\/ LLINK gets NP n in C, returns NP left-child in B, clobbers C\n#define LLINK(B,C) \\\n INDEX(B,C) ; \\\n C <- B << 1 ; \\\n C <- C + 1 ; \\\n NODE(B,C) ; \\\n \/\/\n\n\/\/ RLINK gets NP n in C, returns NP right-child in B, clobbers C\n#define RLINK(B,C) \\\n INDEX(B,C) ; \\\n C <- B << 1 ; \\\n C <- C + 2 ; \\\n NODE(B,C) ; \\\n \/\/\n\n\/\/ ISLEFT gets NP n in C, returns SZ leftness in B\n#define ISLEFT(B,C) \\\n INDEX(B,C) ; \\\n B <- B & 1 ; \\\n B <- B == 1 ; \\\n \/\/\n\n\/\/ ISRIGHT gets NP n in C, returns SZ rightness in B\n#define ISRIGHT(B,C) \\\n INDEX(B,C) ; \\\n B <- B & 1 ; \\\n B <- B == 0 ; \\\n \/\/\n\n\/\/ PARENT gets NP n in C, returns NP parent in B, clobbers C\n#define PARENT(B,C) \\\n INDEX(B,C) ; \\\n C <- B - 1 ; \\\n C <- C >> 1 ; \\\n NODE(B,C) ; \\\n \/\/\n\n\/\/ TODO check SIBLING logic, not very certain of it\n\/\/ SIBLING gets NP n in C, returns NP sibling in B, clobbers C\n#define SIBLING(B,C) \\\n INDEX(B,C) ; \\\n ISLEFT(C,B) ; \\\n B <- B - C ; \\\n C <- ~ C ; \\\n B <- B + C ; \\\n \/\/\n\n\/\/ TODO NODE2RANK\n\/\/ TODO SIZE2RANK\n#define SIZE2RANK(B,C) \\\n \/\/\n\n\/\/ RANK2WORDS gets SZ rank in C, returns SZ word-count in B, clobbers C\n#define RANK2WORDS(B,C) \\\n C <- C + RANK_0_LOG ; \\\n B <- 1 ; \\\n B <- B << C ; \\\n \/\/\n\n\/\/ GET_COUNT gets SZ rank in C, returns SZ free-count in B\n#define GET_COUNT(B,C) \\\n B <- [C + rel(counts)] ; \\\n \/\/\n\n\/\/ SET_COUNT gets SZ rank in C, SZ free-count in D, returns nothing\n#define SET_COUNT(C,D) \\\n D -> [C + rel(counts)] ; \\\n \/\/\n\n\/\/ GET_NODE gets NP n in C, returns SZ shifted-word in B, clobbers C\n#define GET_NODE(B,C) \\\n B <- C >> BPERBITS ; \\\n C <- C & (BPER - 1) ; \\\n B <- [B] ; \\\n B <- B >> C ; \\\n \/\/\n\n\/\/ GET_LEAF gets NP n in C, returns SZ leafiness in B, clobbers C\n#define GET_LEAF(B,C) \\\n GET_NODE(B,C) ; \\\n B <- B & 1 ; \\\n B <- B == 0 ; \\\n \/\/\n\n\/\/ GET_FULL gets NP n in C, returns SZ fullness in B, clobbers C\n#define GET_FULL(B,C) \\\n GET_NODE(B,C) ; \\\n B <- B & 2 ; \\\n B <- B == 2 ; \\\n \/\/\n\n\/\/ GET_VALID gets NP n in C, returns SZ validity in B\n#define GET_VALID(B,C,T0) \\\n T0 <- C ; \\\n INDEX(B,C) ; \\\n PARENT(C,T0) ; \\\n GET_LEAF(T0,C) ; \\\n B <- B &~ T0 ; \\\n \/\/\n\n\/\/ TODO SET_LEAF\n\/\/ TODO SET_FULL\n#define SET_FULL(C,D) \\\n \/\/\n\/\/ TODO NODE2ADDR\n\/\/ TODO ADDR2NODE\nADDR2NODE:\n \/\/ TODO\n ret\n\n.global buddy_malloc\nbuddy_malloc:\n goto(buddy_alloc)\n\n.global buddy_calloc\nbuddy_calloc:\n C <- C * D\n push(C)\n call(buddy_alloc)\n C <- B\n D <- 0\n pop(E)\n call(memset)\n ret\n\n.global buddy_free\nbuddy_free:\n \/\/ TODO\n ret\n\n.global buddy_realloc\nbuddy_realloc:\n \/\/ TODO\n ret\n\n\/\/ -----------------------------------------------------------------------------\n\nbuddy_splitnode:\n \/\/ TODO\n ret\n\nbuddy_autosplit:\n \/\/ TODO\n ret\n\n\/\/ TODO check for clobbering\n\/\/ buddy_alloc gets SZ size in C, returns address or 0 in B\nbuddy_alloc:\n pushall(D,E,F,G)\n SIZE2RANK(B,C)\n D <- B < RANKS\n jzrel(D,L_buddy_alloc_error)\n D <- B\n GET_COUNT(E,D)\n D <- E == 0\n jnzrel(D,L_buddy_alloc_do_split)\n \/\/ here is the main body, where we have a nonzero count of the needed\n \/\/ rank. B is rank, D is scratch, E is scratch and currently count\n D <- B\n IRANK(E,D)\n F <- 1\n F <- F << E \/\/ F is loop bound\n D <- F - 1 \/\/ D is first index to check\n F <- F + D \/\/ F is loop bound adjust for `first'\nL_buddy_alloc_loop_top:\n NODE(E,D) \/\/ E is NODE(D)\n GET_VALID(C,E,G) \/\/ C is validity\n jzrel(C,L_buddy_alloc_loop_bottom)\n GET_LEAF(C,E) \/\/ C is leafiness\n jzrel(C,L_buddy_alloc_loop_bottom)\n GET_FULL(C,E) \/\/ C is fullness\n jnzrel(C,L_buddy_alloc_loop_bottom)\n SET_FULL(E,-1)\n GET_COUNT(C,B)\n C <- C - 1\n SET_COUNT(E,C)\n C <- E\n call(ADDR2NODE)\n goto(L_buddy_alloc_done)\n\nL_buddy_alloc_loop_bottom:\n D <- D + 1 \/\/ D is loop index\n goto(L_buddy_alloc_loop_top)\n\nL_buddy_alloc_do_split:\n D <- E\n call(buddy_autosplit)\n goto(L_buddy_alloc_done)\n\nL_buddy_alloc_error:\n D <- ENOMEM\n D -> errno\n B <- 0\nL_buddy_alloc_done:\n popall(D,E,F,G)\n ret\n\n<commit_msg>Add some macro implementations<commit_after>#include \"common.th\"\n#include \"errno.th\"\n\n#define RANK_0_LOG 4\n#define RANK_0_SIZE (1 << RANK_0_LOG)\n#define RANKS 3\n\n\/\/ NOTE there are some assumptions in the below code that NPER * BPER = 32,\n\/\/ notably in DIFF()\n#define NPERBITS 4\n#define BPERBITS 1\n\n#define NPER (1 << NPERBITS)\n#define BPER (1 << BPERBITS)\n\n#define TN rel(nodes)\n\n\/\/ TODO size `nodes' appropriately\n\/\/ TODO implement .lcomm and use it for this\nnodes:\n .word 0\n\n\/\/ TODO initialise counts appropriately\ncounts:\n .word 0, 0, 1\n\n\/\/ Type `SZ' is a word-wide unsigned integer (some places used as a boolean).\n\/\/ Type `NP' is a word-wide struct, where the word is split into a 28-bit word\n\/\/ index into `nodes` and a 4-bit index into the word indexed.\n\nilog2:\n B <- 0\n push(D)\nL_ilog2_top:\n C <- C >> 1\n D <- C == 0\n jnzrel(D, L_ilog2_done)\n B <- B + 1\n goto(L_ilog2_top)\nL_ilog2_done:\n pop(D)\n ret\n\n\/\/ NODE gets SZ index in C, returns NP node in B, clobbers C\n#define NODE(B,C) \\\n B <- C << BPERBITS ; \\\n B <- B + TN ; \\\n C <- C & (BPER - 1) ; \\\n B <- B | C ; \\\n \/\/\n\n\/\/ IRANK gets SZ rank in C, returns SZ inverted-rank in B\n#define IRANK(B,C) \\\n B <- - C + (RANKS - 1) ; \\\n \/\/\n\n\/\/ DIFF gets NP a in C, NP b in D, returns SZ distance in B\n#define DIFF(B,C,D) \\\n B <- C - D ; \\\n \/\/\n\n\/\/ INDEX gets NP n in C, returns SZ distance from TN in B\n#define INDEX(B,C) \\\n DIFF(B,C,0) ; \\\n \/\/\n\n\/\/ LLINK gets NP n in C, returns NP left-child in B, clobbers C\n#define LLINK(B,C) \\\n INDEX(B,C) ; \\\n C <- B << 1 ; \\\n C <- C + 1 ; \\\n NODE(B,C) ; \\\n \/\/\n\n\/\/ RLINK gets NP n in C, returns NP right-child in B, clobbers C\n#define RLINK(B,C) \\\n INDEX(B,C) ; \\\n C <- B << 1 ; \\\n C <- C + 2 ; \\\n NODE(B,C) ; \\\n \/\/\n\n\/\/ ISLEFT gets NP n in C, returns SZ leftness in B\n#define ISLEFT(B,C) \\\n INDEX(B,C) ; \\\n B <- B & 1 ; \\\n B <- B == 1 ; \\\n \/\/\n\n\/\/ ISRIGHT gets NP n in C, returns SZ rightness in B\n#define ISRIGHT(B,C) \\\n INDEX(B,C) ; \\\n B <- B & 1 ; \\\n B <- B == 0 ; \\\n \/\/\n\n\/\/ PARENT gets NP n in C, returns NP parent in B, clobbers C\n#define PARENT(B,C) \\\n INDEX(B,C) ; \\\n C <- B - 1 ; \\\n C <- C >> 1 ; \\\n NODE(B,C) ; \\\n \/\/\n\n\/\/ SIBLING gets NP n in C, returns NP sibling in B, clobbers C\n#define SIBLING(B,C) \\\n INDEX(B,C) ; \\\n ISLEFT(C,B) ; \\\n B <- B - C ; \\\n C <- ~ C ; \\\n B <- B + C ; \\\n \/\/\n\n\/\/ NODE2RANK gets NP n in C, returns SZ rank in B\n#define NODE2RANK(B,C) \\\n call(NODE2RANK_func) ; \\\n \/\/\n\nNODE2RANK_func:\n push(D)\n D <- 0\nL_NODE2RANK_top:\n INDEX(B,C)\n B <- B == 0\n jnzrel(B, L_NODE2RANK_done)\n D <- D + 1\n B <- C\n PARENT(C,B)\n goto(L_NODE2RANK_top)\nL_NODE2RANK_done:\n B <- - D + (RANKS - 1)\n pop(D)\n ret\n\n#define SIZE2RANK(B,C) \\\n call(SIZE2RANK_func)\n \/\/\n\nSIZE2RANK_func:\n B <- C <> 0\n jzrel(B, L_SIZE2RANK_zero)\n C <- C - 1\n C <- C >> RANK_0_LOG\n call(ilog2)\n B <- B + 1\nL_SIZE2RANK_zero:\n ret\n\n\/\/ RANK2WORDS gets SZ rank in C, returns SZ word-count in B, clobbers C\n#define RANK2WORDS(B,C) \\\n C <- C + RANK_0_LOG ; \\\n B <- 1 ; \\\n B <- B << C ; \\\n \/\/\n\n\/\/ GET_COUNT gets SZ rank in C, returns SZ free-count in B\n#define GET_COUNT(B,C) \\\n B <- [C + rel(counts)] ; \\\n \/\/\n\n\/\/ SET_COUNT gets SZ rank in C, SZ free-count in D, returns nothing\n#define SET_COUNT(C,D) \\\n D -> [C + rel(counts)] ; \\\n \/\/\n\n\/\/ GET_NODE gets NP n in C, returns SZ shifted-word in B, clobbers C\n#define GET_NODE(B,C) \\\n B <- C >> BPERBITS ; \\\n C <- C & (BPER - 1) ; \\\n B <- [B] ; \\\n B <- B >> C ; \\\n \/\/\n\n\/\/ GET_LEAF gets NP n in C, returns SZ leafiness in B, clobbers C\n#define GET_LEAF(B,C) \\\n GET_NODE(B,C) ; \\\n B <- B & 1 ; \\\n B <- B == 0 ; \\\n \/\/\n\n\/\/ GET_FULL gets NP n in C, returns SZ fullness in B, clobbers C\n#define GET_FULL(B,C) \\\n GET_NODE(B,C) ; \\\n B <- B & 2 ; \\\n B <- B == 2 ; \\\n \/\/\n\n\/\/ GET_VALID gets NP n in C, returns SZ validity in B\n#define GET_VALID(B,C,T0) \\\n T0 <- C ; \\\n INDEX(B,C) ; \\\n PARENT(C,T0) ; \\\n GET_LEAF(T0,C) ; \\\n B <- B &~ T0 ; \\\n \/\/\n\n\/\/ TODO SET_LEAF\n\/\/ TODO SET_FULL\n#define SET_FULL(C,D) \\\n \/\/\n\/\/ TODO NODE2ADDR\n\/\/ TODO ADDR2NODE\nADDR2NODE:\n \/\/ TODO\n ret\n\n.global buddy_malloc\nbuddy_malloc:\n goto(buddy_alloc)\n\n.global buddy_calloc\nbuddy_calloc:\n C <- C * D\n push(C)\n call(buddy_alloc)\n C <- B\n D <- 0\n pop(E)\n call(memset)\n ret\n\n.global buddy_free\nbuddy_free:\n \/\/ TODO\n ret\n\n.global buddy_realloc\nbuddy_realloc:\n \/\/ TODO\n ret\n\n\/\/ -----------------------------------------------------------------------------\n\nbuddy_splitnode:\n \/\/ TODO\n ret\n\nbuddy_autosplit:\n \/\/ TODO\n ret\n\n\/\/ TODO check for clobbering\n\/\/ buddy_alloc gets SZ size in C, returns address or 0 in B\nbuddy_alloc:\n pushall(D,E,F,G)\n SIZE2RANK(B,C)\n D <- B < RANKS\n jzrel(D,L_buddy_alloc_error)\n D <- B\n GET_COUNT(E,D)\n D <- E == 0\n jnzrel(D,L_buddy_alloc_do_split)\n \/\/ here is the main body, where we have a nonzero count of the needed\n \/\/ rank. B is rank, D is scratch, E is scratch and currently count\n D <- B\n IRANK(E,D)\n F <- 1\n F <- F << E \/\/ F is loop bound\n D <- F - 1 \/\/ D is first index to check\n F <- F + D \/\/ F is loop bound adjust for `first'\nL_buddy_alloc_loop_top:\n NODE(E,D) \/\/ E is NODE(D)\n GET_VALID(C,E,G) \/\/ C is validity\n jzrel(C,L_buddy_alloc_loop_bottom)\n GET_LEAF(C,E) \/\/ C is leafiness\n jzrel(C,L_buddy_alloc_loop_bottom)\n GET_FULL(C,E) \/\/ C is fullness\n jnzrel(C,L_buddy_alloc_loop_bottom)\n SET_FULL(E,-1)\n GET_COUNT(C,B)\n C <- C - 1\n SET_COUNT(E,C)\n C <- E\n call(ADDR2NODE)\n goto(L_buddy_alloc_done)\n\nL_buddy_alloc_loop_bottom:\n D <- D + 1 \/\/ D is loop index\n goto(L_buddy_alloc_loop_top)\n\nL_buddy_alloc_do_split:\n D <- E\n call(buddy_autosplit)\n goto(L_buddy_alloc_done)\n\nL_buddy_alloc_error:\n D <- ENOMEM\n D -> errno\n B <- 0\nL_buddy_alloc_done:\n popall(D,E,F,G)\n ret\n\n<|endoftext|>"} {"text":"<commit_before>\/\/ Scintilla source code edit control\n\/** @file LexGAP.cxx\n ** Lexer for the GAP language. (The GAP System for Computational Discrete Algebra)\n ** http:\/\/www.gap-system.org\n **\/\n\/\/ Copyright 2007 by Istvan Szollosi ( szteven <at> gmail <dot> com )\n\/\/ The License.txt file describes the conditions under which this software may be distributed.\n\n#include <stdlib.h>\n#include <string.h>\n#include <ctype.h>\n#include <stdio.h>\n#include <stdarg.h>\n\n#include \"Platform.h\"\n\n#include \"PropSet.h\"\n#include \"Accessor.h\"\n#include \"StyleContext.h\"\n#include \"KeyWords.h\"\n#include \"Scintilla.h\"\n#include \"SciLexer.h\"\n\n\nstatic inline bool IsGAPOperator(char ch) {\n\tif (isalnum(ch)) return false;\n\tif (ch == '+' || ch == '-' || ch == '*' || ch == '\/' || \n\t\tch == '^' || ch == ',' || ch == '!' || ch == '.' || \n\t\tch == '=' || ch == '<' || ch == '>' || ch == '(' || \n\t\tch == ')' || ch == ';' || ch == '[' || ch == ']' || \n\t\tch == '{' || ch == '}' || ch == ':' )\n\t\treturn true;\n\treturn false;\n}\n\nstatic void GetRange(unsigned int start, unsigned int end, Accessor &styler, char *s, unsigned int len) {\n\tunsigned int i = 0;\n\twhile ((i < end - start + 1) && (i < len-1)) {\n\t\ts[i] = static_cast<char>(styler[start + i]);\n\t\ti++;\n\t}\n\ts[i] = '\\0';\n}\n\nstatic void ColouriseGAPDoc(unsigned int startPos, int length, int initStyle, WordList *keywordlists[], Accessor &styler) {\n\t\n\tWordList &keywords1 = *keywordlists[0];\n\tWordList &keywords2 = *keywordlists[1];\n\tWordList &keywords3 = *keywordlists[2];\n\tWordList &keywords4 = *keywordlists[3];\n\t\n\t\/\/ Do not leak onto next line\n\tif (initStyle == SCE_GAP_STRINGEOL) initStyle = SCE_GAP_DEFAULT;\t\n\t\n\tStyleContext sc(startPos, length, initStyle, styler);\n\t\n\tfor (; sc.More(); sc.Forward()) {\n\t\t\n\t\t\/\/ Prevent SCE_GAP_STRINGEOL from leaking back to previous line\n\t\tif ( sc.atLineStart ) {\n\t\t\tif (sc.state == SCE_GAP_STRING) sc.SetState(SCE_GAP_STRING);\n\t\t\tif (sc.state == SCE_GAP_CHAR) sc.SetState(SCE_GAP_CHAR);\n\t\t}\n\t\t\n\t\t\/\/ Handle line continuation generically\n\t\tif (sc.ch == '\\\\' ) {\n\t\t\tif (sc.chNext == '\\n' || sc.chNext == '\\r') {\n\t\t\t\tsc.Forward();\n\t\t\t\tif (sc.ch == '\\r' && sc.chNext == '\\n') {\n\t\t\t\t\tsc.Forward();\n\t\t\t\t}\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t}\n\t\t\n\t\t\/\/ Determine if the current state should terminate\n\t\tswitch (sc.state) {\n\t\t\tcase SCE_GAP_OPERATOR :\n\t\t\t\tsc.SetState(SCE_GAP_DEFAULT);\n\t\t\t\tbreak;\n\t\t\t\t\n\t\t\tcase SCE_GAP_NUMBER : \n\t\t\t\tif (!IsADigit(sc.ch)) { \n\t\t\t\t\tif (sc.ch == '\\\\') {\n\t\t\t\t\t\tif (!sc.atLineEnd) {\n\t\t\t\t\t\t\tif (!IsADigit(sc.chNext)) {\n\t\t\t\t\t\t\t\tsc.Forward();\n\t\t\t\t\t\t\t\tsc.ChangeState(SCE_GAP_IDENTIFIER);\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t}\n\t\t\t\t\t} else if (isalpha(sc.ch) || sc.ch == '_') {\n\t\t\t\t\t\tsc.ChangeState(SCE_GAP_IDENTIFIER);\n\t\t\t\t\t}\n\t\t\t\t\telse sc.SetState(SCE_GAP_DEFAULT);\n\t\t\t\t}\n\t\t\t\tbreak;\n\t\t\t\t\n\t\t\tcase SCE_GAP_IDENTIFIER :\n\t\t\t\tif (!(iswordstart(static_cast<char>(sc.ch)) || sc.ch == '$')) {\n\t\t\t\t\tif (sc.ch == '\\\\') sc.Forward();\n\t\t\t\t\telse {\n\t\t\t\t\t\tchar s[1000];\n\t\t\t\t\t\tsc.GetCurrent(s, sizeof(s));\n\t\t\t\t\t\tif (keywords1.InList(s)) {\n\t\t\t\t\t\t\tsc.ChangeState(SCE_GAP_KEYWORD);\n\t\t\t\t\t\t} else if (keywords2.InList(s)) {\n\t\t\t\t\t\t\tsc.ChangeState(SCE_GAP_KEYWORD2);\n\t\t\t\t\t\t} else if (keywords3.InList(s)) {\n\t\t\t\t\t\t\tsc.ChangeState(SCE_GAP_KEYWORD3);\n\t\t\t\t\t\t} else if (keywords4.InList(s)) {\n\t\t\t\t\t\t\tsc.ChangeState(SCE_GAP_KEYWORD4);\n\t\t\t\t\t\t}\n\t\t\t\t\t\tsc.SetState(SCE_GAP_DEFAULT);\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\tbreak;\n\t\t\t\t\n\t\t\tcase SCE_GAP_COMMENT :\n\t\t\t\tif (sc.atLineEnd) {\n\t\t\t\t\tsc.SetState(SCE_GAP_DEFAULT);\n\t\t\t\t}\n\t\t\t\tbreak;\n\t\t\t\t\n\t\t\tcase SCE_GAP_STRING:\n\t\t\t\tif (sc.atLineEnd) {\n\t\t\t\t\tsc.ChangeState(SCE_GAP_STRINGEOL);\n\t\t\t\t} else if (sc.ch == '\\\\') {\n\t\t\t\t\tif (sc.chNext == '\\\"') {\n\t\t\t\t\t\tsc.Forward();\n\t\t\t\t\t}\n\t\t\t\t} else if (sc.ch == '\\\"') {\n\t\t\t\t\tsc.ForwardSetState(SCE_GAP_DEFAULT);\n\t\t\t\t}\n\t\t\t\tbreak;\n\t\t\t\t\n\t\t\tcase SCE_GAP_CHAR:\n\t\t\t\tif (sc.atLineEnd) {\n\t\t\t\t\tsc.ChangeState(SCE_GAP_STRINGEOL);\n\t\t\t\t} else if (sc.ch == '\\\\') {\n\t\t\t\t\tif (sc.chNext == '\\'') {\n\t\t\t\t\t\tsc.Forward();\n\t\t\t\t\t}\n\t\t\t\t} else if (sc.ch == '\\'') {\n\t\t\t\t\tsc.ForwardSetState(SCE_GAP_DEFAULT);\n\t\t\t\t}\n\t\t\t\tbreak;\t\t\t\t\n\t\t\t\t\n\t\t\tcase SCE_GAP_STRINGEOL:\n\t\t\t\tif (sc.atLineStart) {\n\t\t\t\t\tsc.SetState(SCE_GAP_DEFAULT);\n\t\t\t\t}\n\t\t\t\tbreak;\n\t\t}\n\t\t\n\t\t\/\/ Determine if a new state should be entered\n\t\tif (sc.state == SCE_GAP_DEFAULT) {\n\t\t\tif (IsGAPOperator(static_cast<char>(sc.ch))) {\n\t\t\t\tsc.SetState(SCE_GAP_OPERATOR);\n\t\t\t}\n\t\t\telse if (IsADigit(sc.ch)) {\n\t\t\t\tsc.SetState(SCE_GAP_NUMBER);\n\t\t\t} else if (isalpha(sc.ch) || sc.ch == '_' || sc.ch == '\\\\' || sc.ch == '$' || sc.ch == '~') {\n\t\t\t\tsc.SetState(SCE_GAP_IDENTIFIER);\n\t\t\t\tif (sc.ch == '\\\\') sc.Forward();\n\t\t\t} else if (sc.ch == '#') {\n\t\t\t\tsc.SetState(SCE_GAP_COMMENT);\n\t\t\t} else if (sc.ch == '\\\"') {\n\t\t\t\tsc.SetState(SCE_GAP_STRING);\n\t\t\t} else if (sc.ch == '\\'') {\n\t\t\t\tsc.SetState(SCE_GAP_CHAR);\n\t\t\t}\n\t\t}\n\t\t\n\t}\n\tsc.Complete();\n}\n\nstatic int ClassifyFoldPointGAP(const char* s) {\n\tint level = 0;\n\tif (strcmp(s, \"function\") == 0 ||\n\t\tstrcmp(s, \"do\") == 0 ||\n\t\tstrcmp(s, \"if\") == 0 ||\n\t\tstrcmp(s, \"repeat\") == 0 ) {\n\t\tlevel = 1;\n\t} else if (strcmp(s, \"end\") == 0 ||\n\t\t\tstrcmp(s, \"od\") == 0 ||\n\t\t\tstrcmp(s, \"fi\") == 0 ||\n\t\t\tstrcmp(s, \"until\") == 0 ) {\n\t\tlevel = -1;\n\t}\n\treturn level;\n}\n\nstatic void FoldGAPDoc( unsigned int startPos, int length, int initStyle, WordList** , Accessor &styler) {\n\tunsigned int endPos = startPos + length;\n\tint visibleChars = 0;\n\tint lineCurrent = styler.GetLine(startPos);\n\tint levelPrev = styler.LevelAt(lineCurrent) & SC_FOLDLEVELNUMBERMASK;\n\tint levelCurrent = levelPrev;\n\tchar chNext = styler[startPos];\n\tint styleNext = styler.StyleAt(startPos);\n\tint style = initStyle;\n\n\tint lastStart = 0;\n\n\tfor (unsigned int i = startPos; i < endPos; i++) {\n\t\tchar ch = chNext;\n\t\tchNext = styler.SafeGetCharAt(i + 1);\n\t\tint stylePrev = style;\n\t\tstyle = styleNext;\n\t\tstyleNext = styler.StyleAt(i + 1);\n\t\tbool atEOL = (ch == '\\r' && chNext != '\\n') || (ch == '\\n');\n\n\t\tif (stylePrev == SCE_GAP_DEFAULT && style == SCE_GAP_KEYWORD) {\n\t\t\t\/\/ Store last word start point.\n\t\t\tlastStart = i;\n\t\t}\n\n\t\tif (stylePrev == SCE_GAP_KEYWORD) {\n\t\t\tif(iswordchar(ch) && !iswordchar(chNext)) {\n\t\t\t\tchar s[100];\n\t\t\t\tGetRange(lastStart, i, styler, s, sizeof(s));\n\t\t\t\tlevelCurrent += ClassifyFoldPointGAP(s);\n\t\t\t}\n\t\t}\n\n\t\tif (atEOL) {\n\t\t\tint lev = levelPrev;\n\t\t\tif ((levelCurrent > levelPrev) && (visibleChars > 0))\n\t\t\t\tlev |= SC_FOLDLEVELHEADERFLAG;\n\t\t\tif (lev != styler.LevelAt(lineCurrent)) {\n\t\t\t\tstyler.SetLevel(lineCurrent, lev);\n\t\t\t}\n\t\t\tlineCurrent++;\n\t\t\tlevelPrev = levelCurrent;\n\t\t\tvisibleChars = 0;\n\t\t}\n\n\t\tif (!isspacechar(ch))\n\t\t\tvisibleChars++;\n\t}\n\n\tint flagsNext = styler.LevelAt(lineCurrent) & ~SC_FOLDLEVELNUMBERMASK;\n\tstyler.SetLevel(lineCurrent, levelPrev | flagsNext);\n}\n\nstatic const char * const GAPWordListDesc[] = {\n\t\"Keywords 1\",\n\t\"Keywords 2\",\n\t\"Keywords 3 (unused)\", \n\t\"Keywords 4 (unused)\",\n\t0\n};\n\nLexerModule lmGAP(\n SCLEX_GAP,\n ColouriseGAPDoc,\n \"gap\",\n FoldGAPDoc,\n GAPWordListDesc);\n<commit_msg>Bug 1704800 fixed dealing with strings and chars like \"something\\\\\".<commit_after>\/\/ Scintilla source code edit control\n\/** @file LexGAP.cxx\n ** Lexer for the GAP language. (The GAP System for Computational Discrete Algebra)\n ** http:\/\/www.gap-system.org\n **\/\n\/\/ Copyright 2007 by Istvan Szollosi ( szteven <at> gmail <dot> com )\n\/\/ The License.txt file describes the conditions under which this software may be distributed.\n\n#include <stdlib.h>\n#include <string.h>\n#include <ctype.h>\n#include <stdio.h>\n#include <stdarg.h>\n\n#include \"Platform.h\"\n\n#include \"PropSet.h\"\n#include \"Accessor.h\"\n#include \"StyleContext.h\"\n#include \"KeyWords.h\"\n#include \"Scintilla.h\"\n#include \"SciLexer.h\"\n\n\nstatic inline bool IsGAPOperator(char ch) {\n\tif (isalnum(ch)) return false;\n\tif (ch == '+' || ch == '-' || ch == '*' || ch == '\/' ||\n\t\tch == '^' || ch == ',' || ch == '!' || ch == '.' ||\n\t\tch == '=' || ch == '<' || ch == '>' || ch == '(' ||\n\t\tch == ')' || ch == ';' || ch == '[' || ch == ']' ||\n\t\tch == '{' || ch == '}' || ch == ':' )\n\t\treturn true;\n\treturn false;\n}\n\nstatic void GetRange(unsigned int start, unsigned int end, Accessor &styler, char *s, unsigned int len) {\n\tunsigned int i = 0;\n\twhile ((i < end - start + 1) && (i < len-1)) {\n\t\ts[i] = static_cast<char>(styler[start + i]);\n\t\ti++;\n\t}\n\ts[i] = '\\0';\n}\n\nstatic void ColouriseGAPDoc(unsigned int startPos, int length, int initStyle, WordList *keywordlists[], Accessor &styler) {\n\n\tWordList &keywords1 = *keywordlists[0];\n\tWordList &keywords2 = *keywordlists[1];\n\tWordList &keywords3 = *keywordlists[2];\n\tWordList &keywords4 = *keywordlists[3];\n\n\t\/\/ Do not leak onto next line\n\tif (initStyle == SCE_GAP_STRINGEOL) initStyle = SCE_GAP_DEFAULT;\n\n\tStyleContext sc(startPos, length, initStyle, styler);\n\n\tfor (; sc.More(); sc.Forward()) {\n\n\t\t\/\/ Prevent SCE_GAP_STRINGEOL from leaking back to previous line\n\t\tif ( sc.atLineStart ) {\n\t\t\tif (sc.state == SCE_GAP_STRING) sc.SetState(SCE_GAP_STRING);\n\t\t\tif (sc.state == SCE_GAP_CHAR) sc.SetState(SCE_GAP_CHAR);\n\t\t}\n\n\t\t\/\/ Handle line continuation generically\n\t\tif (sc.ch == '\\\\' ) {\n\t\t\tif (sc.chNext == '\\n' || sc.chNext == '\\r') {\n\t\t\t\tsc.Forward();\n\t\t\t\tif (sc.ch == '\\r' && sc.chNext == '\\n') {\n\t\t\t\t\tsc.Forward();\n\t\t\t\t}\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t}\n\n\t\t\/\/ Determine if the current state should terminate\n\t\tswitch (sc.state) {\n\t\t\tcase SCE_GAP_OPERATOR :\n\t\t\t\tsc.SetState(SCE_GAP_DEFAULT);\n\t\t\t\tbreak;\n\n\t\t\tcase SCE_GAP_NUMBER :\n\t\t\t\tif (!IsADigit(sc.ch)) {\n\t\t\t\t\tif (sc.ch == '\\\\') {\n\t\t\t\t\t\tif (!sc.atLineEnd) {\n\t\t\t\t\t\t\tif (!IsADigit(sc.chNext)) {\n\t\t\t\t\t\t\t\tsc.Forward();\n\t\t\t\t\t\t\t\tsc.ChangeState(SCE_GAP_IDENTIFIER);\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t}\n\t\t\t\t\t} else if (isalpha(sc.ch) || sc.ch == '_') {\n\t\t\t\t\t\tsc.ChangeState(SCE_GAP_IDENTIFIER);\n\t\t\t\t\t}\n\t\t\t\t\telse sc.SetState(SCE_GAP_DEFAULT);\n\t\t\t\t}\n\t\t\t\tbreak;\n\n\t\t\tcase SCE_GAP_IDENTIFIER :\n\t\t\t\tif (!(iswordstart(static_cast<char>(sc.ch)) || sc.ch == '$')) {\n\t\t\t\t\tif (sc.ch == '\\\\') sc.Forward();\n\t\t\t\t\telse {\n\t\t\t\t\t\tchar s[1000];\n\t\t\t\t\t\tsc.GetCurrent(s, sizeof(s));\n\t\t\t\t\t\tif (keywords1.InList(s)) {\n\t\t\t\t\t\t\tsc.ChangeState(SCE_GAP_KEYWORD);\n\t\t\t\t\t\t} else if (keywords2.InList(s)) {\n\t\t\t\t\t\t\tsc.ChangeState(SCE_GAP_KEYWORD2);\n\t\t\t\t\t\t} else if (keywords3.InList(s)) {\n\t\t\t\t\t\t\tsc.ChangeState(SCE_GAP_KEYWORD3);\n\t\t\t\t\t\t} else if (keywords4.InList(s)) {\n\t\t\t\t\t\t\tsc.ChangeState(SCE_GAP_KEYWORD4);\n\t\t\t\t\t\t}\n\t\t\t\t\t\tsc.SetState(SCE_GAP_DEFAULT);\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\tbreak;\n\n\t\t\tcase SCE_GAP_COMMENT :\n\t\t\t\tif (sc.atLineEnd) {\n\t\t\t\t\tsc.SetState(SCE_GAP_DEFAULT);\n\t\t\t\t}\n\t\t\t\tbreak;\n\n\t\t\tcase SCE_GAP_STRING:\n\t\t\t\tif (sc.atLineEnd) {\n\t\t\t\t\tsc.ChangeState(SCE_GAP_STRINGEOL);\n\t\t\t\t} else if (sc.ch == '\\\\') {\n\t\t\t\t\tif (sc.chNext == '\\\"' || sc.chNext == '\\'' || sc.chNext == '\\\\') {\n\t\t\t\t\t\tsc.Forward();\n\t\t\t\t\t}\n\t\t\t\t} else if (sc.ch == '\\\"') {\n\t\t\t\t\tsc.ForwardSetState(SCE_GAP_DEFAULT);\n\t\t\t\t}\n\t\t\t\tbreak;\n\n\t\t\tcase SCE_GAP_CHAR:\n\t\t\t\tif (sc.atLineEnd) {\n\t\t\t\t\tsc.ChangeState(SCE_GAP_STRINGEOL);\n\t\t\t\t} else if (sc.ch == '\\\\') {\n\t\t\t\t\tif (sc.chNext == '\\\"' || sc.chNext == '\\'' || sc.chNext == '\\\\') {\n\t\t\t\t\t\tsc.Forward();\n\t\t\t\t\t}\n\t\t\t\t} else if (sc.ch == '\\'') {\n\t\t\t\t\tsc.ForwardSetState(SCE_GAP_DEFAULT);\n\t\t\t\t}\n\t\t\t\tbreak;\n\n\t\t\tcase SCE_GAP_STRINGEOL:\n\t\t\t\tif (sc.atLineStart) {\n\t\t\t\t\tsc.SetState(SCE_GAP_DEFAULT);\n\t\t\t\t}\n\t\t\t\tbreak;\n\t\t}\n\n\t\t\/\/ Determine if a new state should be entered\n\t\tif (sc.state == SCE_GAP_DEFAULT) {\n\t\t\tif (IsGAPOperator(static_cast<char>(sc.ch))) {\n\t\t\t\tsc.SetState(SCE_GAP_OPERATOR);\n\t\t\t}\n\t\t\telse if (IsADigit(sc.ch)) {\n\t\t\t\tsc.SetState(SCE_GAP_NUMBER);\n\t\t\t} else if (isalpha(sc.ch) || sc.ch == '_' || sc.ch == '\\\\' || sc.ch == '$' || sc.ch == '~') {\n\t\t\t\tsc.SetState(SCE_GAP_IDENTIFIER);\n\t\t\t\tif (sc.ch == '\\\\') sc.Forward();\n\t\t\t} else if (sc.ch == '#') {\n\t\t\t\tsc.SetState(SCE_GAP_COMMENT);\n\t\t\t} else if (sc.ch == '\\\"') {\n\t\t\t\tsc.SetState(SCE_GAP_STRING);\n\t\t\t} else if (sc.ch == '\\'') {\n\t\t\t\tsc.SetState(SCE_GAP_CHAR);\n\t\t\t}\n\t\t}\n\n\t}\n\tsc.Complete();\n}\n\nstatic int ClassifyFoldPointGAP(const char* s) {\n\tint level = 0;\n\tif (strcmp(s, \"function\") == 0 ||\n\t\tstrcmp(s, \"do\") == 0 ||\n\t\tstrcmp(s, \"if\") == 0 ||\n\t\tstrcmp(s, \"repeat\") == 0 ) {\n\t\tlevel = 1;\n\t} else if (strcmp(s, \"end\") == 0 ||\n\t\t\tstrcmp(s, \"od\") == 0 ||\n\t\t\tstrcmp(s, \"fi\") == 0 ||\n\t\t\tstrcmp(s, \"until\") == 0 ) {\n\t\tlevel = -1;\n\t}\n\treturn level;\n}\n\nstatic void FoldGAPDoc( unsigned int startPos, int length, int initStyle, WordList** , Accessor &styler) {\n\tunsigned int endPos = startPos + length;\n\tint visibleChars = 0;\n\tint lineCurrent = styler.GetLine(startPos);\n\tint levelPrev = styler.LevelAt(lineCurrent) & SC_FOLDLEVELNUMBERMASK;\n\tint levelCurrent = levelPrev;\n\tchar chNext = styler[startPos];\n\tint styleNext = styler.StyleAt(startPos);\n\tint style = initStyle;\n\n\tint lastStart = 0;\n\n\tfor (unsigned int i = startPos; i < endPos; i++) {\n\t\tchar ch = chNext;\n\t\tchNext = styler.SafeGetCharAt(i + 1);\n\t\tint stylePrev = style;\n\t\tstyle = styleNext;\n\t\tstyleNext = styler.StyleAt(i + 1);\n\t\tbool atEOL = (ch == '\\r' && chNext != '\\n') || (ch == '\\n');\n\n\t\tif (stylePrev == SCE_GAP_DEFAULT && style == SCE_GAP_KEYWORD) {\n\t\t\t\/\/ Store last word start point.\n\t\t\tlastStart = i;\n\t\t}\n\n\t\tif (stylePrev == SCE_GAP_KEYWORD) {\n\t\t\tif(iswordchar(ch) && !iswordchar(chNext)) {\n\t\t\t\tchar s[100];\n\t\t\t\tGetRange(lastStart, i, styler, s, sizeof(s));\n\t\t\t\tlevelCurrent += ClassifyFoldPointGAP(s);\n\t\t\t}\n\t\t}\n\n\t\tif (atEOL) {\n\t\t\tint lev = levelPrev;\n\t\t\tif ((levelCurrent > levelPrev) && (visibleChars > 0))\n\t\t\t\tlev |= SC_FOLDLEVELHEADERFLAG;\n\t\t\tif (lev != styler.LevelAt(lineCurrent)) {\n\t\t\t\tstyler.SetLevel(lineCurrent, lev);\n\t\t\t}\n\t\t\tlineCurrent++;\n\t\t\tlevelPrev = levelCurrent;\n\t\t\tvisibleChars = 0;\n\t\t}\n\n\t\tif (!isspacechar(ch))\n\t\t\tvisibleChars++;\n\t}\n\n\tint flagsNext = styler.LevelAt(lineCurrent) & ~SC_FOLDLEVELNUMBERMASK;\n\tstyler.SetLevel(lineCurrent, levelPrev | flagsNext);\n}\n\nstatic const char * const GAPWordListDesc[] = {\n\t\"Keywords 1\",\n\t\"Keywords 2\",\n\t\"Keywords 3 (unused)\",\n\t\"Keywords 4 (unused)\",\n\t0\n};\n\nLexerModule lmGAP(\n SCLEX_GAP,\n ColouriseGAPDoc,\n \"gap\",\n FoldGAPDoc,\n GAPWordListDesc);\n<|endoftext|>"} {"text":"<commit_before>#pragma once\n\n#include <string>\n#include <cryptopp\/sha3.h>\n\n#include \"Arguments.hpp\"\n\n\nnamespace Ethereum{namespace ABI{\n\n\nclass Method\n{\n public:\n static std::string Encode(const std::string &method);\n static std::string Encode(const char *method);\n static std::string Encode(const char *method, size_t size);\n static std::string Encode(const char *method, const Arguments &args);\n static std::string Encode(const std::string &method, const Arguments &args);\n static std::string Encode(const char *method, size_t size, const Arguments &args);\n};\n\n\n}}\n<commit_msg>prefer local cryptopp<commit_after>#pragma once\n\n#include <string>\n#include \"cryptopp\/sha3.h\"\n\n#include \"Arguments.hpp\"\n\n\nnamespace Ethereum{namespace ABI{\n\n\nclass Method\n{\n public:\n static std::string Encode(const std::string &method);\n static std::string Encode(const char *method);\n static std::string Encode(const char *method, size_t size);\n static std::string Encode(const char *method, const Arguments &args);\n static std::string Encode(const std::string &method, const Arguments &args);\n static std::string Encode(const char *method, size_t size, const Arguments &args);\n};\n\n\n}}\n<|endoftext|>"} {"text":"<commit_before>\/* \n * Module\n * \n * let you manage your code into modules\n *\n * writen by ImagicTheCat for Tsux\n * https:\/\/github.com\/ImagicTheCat\/Tsux\n *\/\n\n\n#ifndef H_MODULE\n#define H_MODULE\n\n#include <iostream>\n#include \"Tsux.hpp\"\n\nclass Module{\n public:\n \/\/the name need to be unique\n Module(Tsux& tsux, const std::string& name);\n ~Module();\n\n \/* Interface to tsux *\/\n \/\/time in seconds\n void createCookie(const std::string& name, const std::string& data, int time){\n tsux.createCookie(name, data, time);\n }\n\n \/\/generate html : 404, etc\n void generate(int code){ tsux.generate(code); }\n void generate(ParamSet set){ tsux.generate(set); }\n void generate(FileSet set){ tsux.generate(set); }\n\n \/\/misc\n Module* module(const std::string& name){ return tsux.module(name); }\n\n \/\/accessors\n const std::string& uri()const{ return tsux.uri(); }\n const std::string& location()const{ return tsux.location(); }\n\n \/\/streams\n std::ostream& out;\n std::istream& in;\n std::ostream& err;\n std::stringstream& response;\n\n \/\/data\n ParamSet &post, &get, &header, &route, ¶m, &cookie;\n FileSet &file;\n \n \/* Module *\/\n \/\/bind action for this module\n template<typename T> void bind(const std::string& path, void (T::*action)(void)){\n tsux.bind(path, Action((ModAction)action, this));\n }\n\n \/\/accessors\n const std::string& name()const{ return _name; }\n\n private:\n Tsux& tsux;\n std::string _name;\n};\n\ntypedef void (Module::*ModAction)(void);\n\n#endif\n<commit_msg>add locale shortcuts<commit_after>\/* \n * Module\n * \n * let you manage your code into modules\n *\n * writen by ImagicTheCat for Tsux\n * https:\/\/github.com\/ImagicTheCat\/Tsux\n *\/\n\n\n#ifndef H_MODULE\n#define H_MODULE\n\n#include <iostream>\n#include \"Tsux.hpp\"\n\nclass Module{\n public:\n \/\/the name need to be unique\n Module(Tsux& tsux, const std::string& name);\n ~Module();\n\n \/* Interface to tsux *\/\n \/\/time in seconds\n void createCookie(const std::string& name, const std::string& data, int time){\n tsux.createCookie(name, data, time);\n }\n\n \/\/generate html : 404, etc\n void generate(int code){ tsux.generate(code); }\n void generate(ParamSet set){ tsux.generate(set); }\n void generate(FileSet set){ tsux.generate(set); }\n\n \/\/misc\n Module* module(const std::string& name){ return tsux.module(name); }\n\n \/\/accessors\n const std::string& uri()const{ return tsux.uri(); }\n const std::string& location()const{ return tsux.location(); }\n\n const std::string& locale()const{ return tsux.locale(); }\n void locale(const std::string& loc){ tsux.locale(loc); }\n\n \/\/streams\n std::ostream& out;\n std::istream& in;\n std::ostream& err;\n std::stringstream& response;\n\n \/\/data\n ParamSet &post, &get, &header, &route, ¶m, &cookie;\n FileSet &file;\n \n \/* Module *\/\n \/\/bind action for this module\n template<typename T> void bind(const std::string& path, void (T::*action)(void)){\n tsux.bind(path, Action((ModAction)action, this));\n }\n\n \/\/accessors\n const std::string& name()const{ return _name; }\n\n private:\n Tsux& tsux;\n std::string _name;\n};\n\ntypedef void (Module::*ModAction)(void);\n\n#endif\n<|endoftext|>"} {"text":"<commit_before>\/\/ Copyright (c) 2013-2016 The Bitcoin Core developers\n\/\/ Distributed under the MIT software license, see the accompanying\n\/\/ file COPYING or http:\/\/www.opensource.org\/licenses\/mit-license.php.\n\n#include \"hash.h\"\n#include \"crypto\/common.h\"\n#include \"crypto\/hmac_sha512.h\"\n#include \"pubkey.h\"\n\n\ninline uint32_t ROTL32(uint32_t x, int8_t r)\n{\n return (x << r) | (x >> (32 - r));\n}\n\nunsigned int MurmurHash3(unsigned int nHashSeed, const std::vector<unsigned char>& vDataToHash)\n{\n \/\/ The following is MurmurHash3 (x86_32), see http:\/\/code.google.com\/p\/smhasher\/source\/browse\/trunk\/MurmurHash3.cpp\n uint32_t h1 = nHashSeed;\n if (vDataToHash.size() > 0)\n {\n const uint32_t c1 = 0xcc9e2d51;\n const uint32_t c2 = 0x1b873593;\n\n const int nblocks = vDataToHash.size() \/ 4;\n\n \/\/----------\n \/\/ body\n const uint8_t* blocks = &vDataToHash[0] + nblocks * 4;\n\n for (int i = -nblocks; i; i++) {\n uint32_t k1 = ReadLE32(blocks + i*4);\n\n k1 *= c1;\n k1 = ROTL32(k1, 15);\n k1 *= c2;\n\n h1 ^= k1;\n h1 = ROTL32(h1, 13);\n h1 = h1 * 5 + 0xe6546b64;\n }\n\n \/\/----------\n \/\/ tail\n const uint8_t* tail = (const uint8_t*)(&vDataToHash[0] + nblocks * 4);\n\n uint32_t k1 = 0;\n\n switch (vDataToHash.size() & 3) {\n case 3:\n k1 ^= tail[2] << 16;\n case 2:\n k1 ^= tail[1] << 8;\n case 1:\n k1 ^= tail[0];\n k1 *= c1;\n k1 = ROTL32(k1, 15);\n k1 *= c2;\n h1 ^= k1;\n }\n }\n\n \/\/----------\n \/\/ finalization\n h1 ^= vDataToHash.size();\n h1 ^= h1 >> 16;\n h1 *= 0x85ebca6b;\n h1 ^= h1 >> 13;\n h1 *= 0xc2b2ae35;\n h1 ^= h1 >> 16;\n\n return h1;\n}\n\nvoid BIP32Hash(const ChainCode &chainCode, unsigned int nChild, unsigned char header, const unsigned char data[32], unsigned char output[64])\n{\n unsigned char num[4];\n num[0] = (nChild >> 24) & 0xFF;\n num[1] = (nChild >> 16) & 0xFF;\n num[2] = (nChild >> 8) & 0xFF;\n num[3] = (nChild >> 0) & 0xFF;\n CHMAC_SHA512(chainCode.begin(), chainCode.size()).Write(&header, 1).Write(data, 32).Write(num, 4).Finalize(output);\n}\n\n#define ROTL(x, b) (uint64_t)(((x) << (b)) | ((x) >> (64 - (b))))\n\n#define SIPROUND do { \\\n v0 += v1; v1 = ROTL(v1, 13); v1 ^= v0; \\\n v0 = ROTL(v0, 32); \\\n v2 += v3; v3 = ROTL(v3, 16); v3 ^= v2; \\\n v0 += v3; v3 = ROTL(v3, 21); v3 ^= v0; \\\n v2 += v1; v1 = ROTL(v1, 17); v1 ^= v2; \\\n v2 = ROTL(v2, 32); \\\n} while (0)\n\nCSipHasher::CSipHasher(uint64_t k0, uint64_t k1)\n{\n v[0] = 0x736f6d6570736575ULL ^ k0;\n v[1] = 0x646f72616e646f6dULL ^ k1;\n v[2] = 0x6c7967656e657261ULL ^ k0;\n v[3] = 0x7465646279746573ULL ^ k1;\n count = 0;\n tmp = 0;\n}\n\nCSipHasher& CSipHasher::Write(uint64_t data)\n{\n uint64_t v0 = v[0], v1 = v[1], v2 = v[2], v3 = v[3];\n\n assert(count % 8 == 0);\n\n v3 ^= data;\n SIPROUND;\n SIPROUND;\n v0 ^= data;\n\n v[0] = v0;\n v[1] = v1;\n v[2] = v2;\n v[3] = v3;\n\n count += 8;\n return *this;\n}\n\nCSipHasher& CSipHasher::Write(const unsigned char* data, size_t size)\n{\n uint64_t v0 = v[0], v1 = v[1], v2 = v[2], v3 = v[3];\n uint64_t t = tmp;\n int c = count;\n\n while (size--) {\n t |= ((uint64_t)(*(data++))) << (8 * (c % 8));\n c++;\n if ((c & 7) == 0) {\n v3 ^= t;\n SIPROUND;\n SIPROUND;\n v0 ^= t;\n t = 0;\n }\n }\n\n v[0] = v0;\n v[1] = v1;\n v[2] = v2;\n v[3] = v3;\n count = c;\n tmp = t;\n\n return *this;\n}\n\nuint64_t CSipHasher::Finalize() const\n{\n uint64_t v0 = v[0], v1 = v[1], v2 = v[2], v3 = v[3];\n\n uint64_t t = tmp | (((uint64_t)count) << 56);\n\n v3 ^= t;\n SIPROUND;\n SIPROUND;\n v0 ^= t;\n v2 ^= 0xFF;\n SIPROUND;\n SIPROUND;\n SIPROUND;\n SIPROUND;\n return v0 ^ v1 ^ v2 ^ v3;\n}\n\nuint64_t SipHashUint256(uint64_t k0, uint64_t k1, const uint256& val)\n{\n \/* Specialized implementation for efficiency *\/\n uint64_t d = val.GetUint64(0);\n\n uint64_t v0 = 0x736f6d6570736575ULL ^ k0;\n uint64_t v1 = 0x646f72616e646f6dULL ^ k1;\n uint64_t v2 = 0x6c7967656e657261ULL ^ k0;\n uint64_t v3 = 0x7465646279746573ULL ^ k1 ^ d;\n\n SIPROUND;\n SIPROUND;\n v0 ^= d;\n d = val.GetUint64(1);\n v3 ^= d;\n SIPROUND;\n SIPROUND;\n v0 ^= d;\n d = val.GetUint64(2);\n v3 ^= d;\n SIPROUND;\n SIPROUND;\n v0 ^= d;\n d = val.GetUint64(3);\n v3 ^= d;\n SIPROUND;\n SIPROUND;\n v0 ^= d;\n v3 ^= ((uint64_t)4) << 59;\n SIPROUND;\n SIPROUND;\n v0 ^= ((uint64_t)4) << 59;\n v2 ^= 0xFF;\n SIPROUND;\n SIPROUND;\n SIPROUND;\n SIPROUND;\n return v0 ^ v1 ^ v2 ^ v3;\n}\n<commit_msg>Format hash.cpp<commit_after>\/\/ Copyright (c) 2013-2016 The Bitcoin Core developers\n\/\/ Distributed under the MIT software license, see the accompanying\n\/\/ file COPYING or http:\/\/www.opensource.org\/licenses\/mit-license.php.\n\n#include \"hash.h\"\n#include \"crypto\/common.h\"\n#include \"crypto\/hmac_sha512.h\"\n#include \"pubkey.h\"\n\ninline uint32_t ROTL32(uint32_t x, int8_t r) {\n return (x << r) | (x >> (32 - r));\n}\n\nunsigned int MurmurHash3(unsigned int nHashSeed,\n const std::vector<unsigned char> &vDataToHash) {\n \/\/ The following is MurmurHash3 (x86_32), see\n \/\/ http:\/\/code.google.com\/p\/smhasher\/source\/browse\/trunk\/MurmurHash3.cpp\n uint32_t h1 = nHashSeed;\n if (vDataToHash.size() > 0) {\n const uint32_t c1 = 0xcc9e2d51;\n const uint32_t c2 = 0x1b873593;\n\n const int nblocks = vDataToHash.size() \/ 4;\n\n \/\/----------\n \/\/ body\n const uint8_t *blocks = &vDataToHash[0] + nblocks * 4;\n\n for (int i = -nblocks; i; i++) {\n uint32_t k1 = ReadLE32(blocks + i * 4);\n\n k1 *= c1;\n k1 = ROTL32(k1, 15);\n k1 *= c2;\n\n h1 ^= k1;\n h1 = ROTL32(h1, 13);\n h1 = h1 * 5 + 0xe6546b64;\n }\n\n \/\/----------\n \/\/ tail\n const uint8_t *tail = (const uint8_t *)(&vDataToHash[0] + nblocks * 4);\n\n uint32_t k1 = 0;\n\n switch (vDataToHash.size() & 3) {\n case 3:\n k1 ^= tail[2] << 16;\n case 2:\n k1 ^= tail[1] << 8;\n case 1:\n k1 ^= tail[0];\n k1 *= c1;\n k1 = ROTL32(k1, 15);\n k1 *= c2;\n h1 ^= k1;\n }\n }\n\n \/\/----------\n \/\/ finalization\n h1 ^= vDataToHash.size();\n h1 ^= h1 >> 16;\n h1 *= 0x85ebca6b;\n h1 ^= h1 >> 13;\n h1 *= 0xc2b2ae35;\n h1 ^= h1 >> 16;\n\n return h1;\n}\n\nvoid BIP32Hash(const ChainCode &chainCode, unsigned int nChild,\n unsigned char header, const unsigned char data[32],\n unsigned char output[64]) {\n unsigned char num[4];\n num[0] = (nChild >> 24) & 0xFF;\n num[1] = (nChild >> 16) & 0xFF;\n num[2] = (nChild >> 8) & 0xFF;\n num[3] = (nChild >> 0) & 0xFF;\n CHMAC_SHA512(chainCode.begin(), chainCode.size())\n .Write(&header, 1)\n .Write(data, 32)\n .Write(num, 4)\n .Finalize(output);\n}\n\n#define ROTL(x, b) (uint64_t)(((x) << (b)) | ((x) >> (64 - (b))))\n\n#define SIPROUND \\\n do { \\\n v0 += v1; \\\n v1 = ROTL(v1, 13); \\\n v1 ^= v0; \\\n v0 = ROTL(v0, 32); \\\n v2 += v3; \\\n v3 = ROTL(v3, 16); \\\n v3 ^= v2; \\\n v0 += v3; \\\n v3 = ROTL(v3, 21); \\\n v3 ^= v0; \\\n v2 += v1; \\\n v1 = ROTL(v1, 17); \\\n v1 ^= v2; \\\n v2 = ROTL(v2, 32); \\\n } while (0)\n\nCSipHasher::CSipHasher(uint64_t k0, uint64_t k1) {\n v[0] = 0x736f6d6570736575ULL ^ k0;\n v[1] = 0x646f72616e646f6dULL ^ k1;\n v[2] = 0x6c7967656e657261ULL ^ k0;\n v[3] = 0x7465646279746573ULL ^ k1;\n count = 0;\n tmp = 0;\n}\n\nCSipHasher &CSipHasher::Write(uint64_t data) {\n uint64_t v0 = v[0], v1 = v[1], v2 = v[2], v3 = v[3];\n\n assert(count % 8 == 0);\n\n v3 ^= data;\n SIPROUND;\n SIPROUND;\n v0 ^= data;\n\n v[0] = v0;\n v[1] = v1;\n v[2] = v2;\n v[3] = v3;\n\n count += 8;\n return *this;\n}\n\nCSipHasher &CSipHasher::Write(const unsigned char *data, size_t size) {\n uint64_t v0 = v[0], v1 = v[1], v2 = v[2], v3 = v[3];\n uint64_t t = tmp;\n int c = count;\n\n while (size--) {\n t |= ((uint64_t)(*(data++))) << (8 * (c % 8));\n c++;\n if ((c & 7) == 0) {\n v3 ^= t;\n SIPROUND;\n SIPROUND;\n v0 ^= t;\n t = 0;\n }\n }\n\n v[0] = v0;\n v[1] = v1;\n v[2] = v2;\n v[3] = v3;\n count = c;\n tmp = t;\n\n return *this;\n}\n\nuint64_t CSipHasher::Finalize() const {\n uint64_t v0 = v[0], v1 = v[1], v2 = v[2], v3 = v[3];\n\n uint64_t t = tmp | (((uint64_t)count) << 56);\n\n v3 ^= t;\n SIPROUND;\n SIPROUND;\n v0 ^= t;\n v2 ^= 0xFF;\n SIPROUND;\n SIPROUND;\n SIPROUND;\n SIPROUND;\n return v0 ^ v1 ^ v2 ^ v3;\n}\n\nuint64_t SipHashUint256(uint64_t k0, uint64_t k1, const uint256 &val) {\n \/* Specialized implementation for efficiency *\/\n uint64_t d = val.GetUint64(0);\n\n uint64_t v0 = 0x736f6d6570736575ULL ^ k0;\n uint64_t v1 = 0x646f72616e646f6dULL ^ k1;\n uint64_t v2 = 0x6c7967656e657261ULL ^ k0;\n uint64_t v3 = 0x7465646279746573ULL ^ k1 ^ d;\n\n SIPROUND;\n SIPROUND;\n v0 ^= d;\n d = val.GetUint64(1);\n v3 ^= d;\n SIPROUND;\n SIPROUND;\n v0 ^= d;\n d = val.GetUint64(2);\n v3 ^= d;\n SIPROUND;\n SIPROUND;\n v0 ^= d;\n d = val.GetUint64(3);\n v3 ^= d;\n SIPROUND;\n SIPROUND;\n v0 ^= d;\n v3 ^= ((uint64_t)4) << 59;\n SIPROUND;\n SIPROUND;\n v0 ^= ((uint64_t)4) << 59;\n v2 ^= 0xFF;\n SIPROUND;\n SIPROUND;\n SIPROUND;\n SIPROUND;\n return v0 ^ v1 ^ v2 ^ v3;\n}\n<|endoftext|>"} {"text":"<commit_before>\/*\n * This file is part of DGD, https:\/\/github.com\/dworkin\/dgd\n * Copyright (C) 1993-2010 Dworkin B.V.\n * Copyright (C) 2010-2016 DGD Authors (see the commit log for details)\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 \"dgd.h\"\n# include \"hash.h\"\n\n\/*\n * Generic string hash table.\n *\/\n\nunsigned char Hashtab::tab[256] = {\n u'\\001', u'\\127', u'\\061', u'\\014', u'\\260', u'\\262', u'\\146', u'\\246',\n u'\\171', u'\\301', u'\\006', u'\\124', u'\\371', u'\\346', u'\\054', u'\\243',\n u'\\016', u'\\305', u'\\325', u'\\265', u'\\241', u'\\125', u'\\332', u'\\120',\n u'\\100', u'\\357', u'\\030', u'\\342', u'\\354', u'\\216', u'\\046', u'\\310',\n u'\\156', u'\\261', u'\\150', u'\\147', u'\\215', u'\\375', u'\\377', u'\\062',\n u'\\115', u'\\145', u'\\121', u'\\022', u'\\055', u'\\140', u'\\037', u'\\336',\n u'\\031', u'\\153', u'\\276', u'\\106', u'\\126', u'\\355', u'\\360', u'\\042',\n u'\\110', u'\\362', u'\\024', u'\\326', u'\\364', u'\\343', u'\\225', u'\\353',\n u'\\141', u'\\352', u'\\071', u'\\026', u'\\074', u'\\372', u'\\122', u'\\257',\n u'\\320', u'\\005', u'\\177', u'\\307', u'\\157', u'\\076', u'\\207', u'\\370',\n u'\\256', u'\\251', u'\\323', u'\\072', u'\\102', u'\\232', u'\\152', u'\\303',\n u'\\365', u'\\253', u'\\021', u'\\273', u'\\266', u'\\263', u'\\000', u'\\363',\n u'\\204', u'\\070', u'\\224', u'\\113', u'\\200', u'\\205', u'\\236', u'\\144',\n u'\\202', u'\\176', u'\\133', u'\\015', u'\\231', u'\\366', u'\\330', u'\\333',\n u'\\167', u'\\104', u'\\337', u'\\116', u'\\123', u'\\130', u'\\311', u'\\143',\n u'\\172', u'\\013', u'\\134', u'\\040', u'\\210', u'\\162', u'\\064', u'\\012',\n u'\\212', u'\\036', u'\\060', u'\\267', u'\\234', u'\\043', u'\\075', u'\\032',\n u'\\217', u'\\112', u'\\373', u'\\136', u'\\201', u'\\242', u'\\077', u'\\230',\n u'\\252', u'\\007', u'\\163', u'\\247', u'\\361', u'\\316', u'\\003', u'\\226',\n u'\\067', u'\\073', u'\\227', u'\\334', u'\\132', u'\\065', u'\\027', u'\\203',\n u'\\175', u'\\255', u'\\017', u'\\356', u'\\117', u'\\137', u'\\131', u'\\020',\n u'\\151', u'\\211', u'\\341', u'\\340', u'\\331', u'\\240', u'\\045', u'\\173',\n u'\\166', u'\\111', u'\\002', u'\\235', u'\\056', u'\\164', u'\\011', u'\\221',\n u'\\206', u'\\344', u'\\317', u'\\324', u'\\312', u'\\327', u'\\105', u'\\345',\n u'\\033', u'\\274', u'\\103', u'\\174', u'\\250', u'\\374', u'\\052', u'\\004',\n u'\\035', u'\\154', u'\\025', u'\\367', u'\\023', u'\\315', u'\\047', u'\\313',\n u'\\351', u'\\050', u'\\272', u'\\223', u'\\306', u'\\300', u'\\233', u'\\041',\n u'\\244', u'\\277', u'\\142', u'\\314', u'\\245', u'\\264', u'\\165', u'\\114',\n u'\\214', u'\\044', u'\\322', u'\\254', u'\\051', u'\\066', u'\\237', u'\\010',\n u'\\271', u'\\350', u'\\161', u'\\304', u'\\347', u'\\057', u'\\222', u'\\170',\n u'\\063', u'\\101', u'\\034', u'\\220', u'\\376', u'\\335', u'\\135', u'\\275',\n u'\\302', u'\\213', u'\\160', u'\\053', u'\\107', u'\\155', u'\\270', u'\\321',\n};\n\n\/*\n * NAME:\tHashtab::create()\n * DESCRIPTION:\thashtable factory\n *\/\nHashtab *Hashtab::create(unsigned int size, unsigned int maxlen, bool mem)\n{\n return new HashtabImpl(size, maxlen, mem);\n}\n\n\/*\n * NAME:\tHashtab::hashstr()\n * DESCRIPTION:\tHash string s, considering at most len characters. Return\n *\t\tan unsigned modulo size.\n *\t\tBased on Peter K. Pearson's article in CACM 33-6, pp 677.\n *\/\nunsigned short Hashtab::hashstr(const char *str, unsigned int len)\n{\n unsigned char h, l;\n\n h = l = 0;\n while (*str != '\\0' && len > 0) {\n\th = l;\n\tl = tab[l ^ (unsigned char) *str++];\n\t--len;\n }\n return (unsigned short) ((h << 8) | l);\n}\n\n\/*\n * NAME:\tHashtab::hashmem()\n * DESCRIPTION:\thash memory\n *\/\nunsigned short Hashtab::hashmem(const char *mem, unsigned int len)\n{\n unsigned char h, l;\n\n h = l = 0;\n while (len > 0) {\n\th = l;\n\tl = tab[l ^ (unsigned char) *mem++];\n\t--len;\n }\n return (unsigned short) ((h << 8) | l);\n}\n\n\n\/*\n * NAME:\tHashtabImpl()\n * DESCRIPTION:\tcreate a new hashtable of size \"size\", where \"maxlen\" characters\n *\t\tof each string are significant\n *\/\nHashtabImpl::HashtabImpl(unsigned int size, unsigned int maxlen, bool mem)\n{\n m_size = size;\n m_maxlen = maxlen;\n m_mem = mem;\n m_table = ALLOC(Entry*, size);\n memset(m_table, '\\0', size * sizeof(Entry*));\n}\n\n\/*\n * NAME:\t~HashtabImpl()\n * DESCRIPTION:\tdelete a hash table\n *\/\nHashtabImpl::~HashtabImpl()\n{\n FREE(m_table);\n}\n\n\/*\n * NAME:\tHashtabImpl::lookup()\n * DESCRIPTION:\tlookup a name in a hashtable, return the address of the entry\n *\t\tor &NULL if none found\n *\/\nHashtab::Entry **HashtabImpl::lookup(const char *name, bool move)\n{\n Entry **first, **e, *next;\n\n if (m_mem) {\n\tfirst = e = &(m_table[hashmem(name, m_maxlen) % m_size]);\n\twhile (*e != (Entry *) NULL) {\n\t if (memcmp((*e)->name, name, m_maxlen) == 0) {\n\t\tif (move && e != first) {\n\t\t \/* move to first position *\/\n\t\t next = (*e)->next;\n\t\t (*e)->next = *first;\n\t\t *first = *e;\n\t\t *e = next;\n\t\t return first;\n\t\t}\n\t\tbreak;\n\t }\n\t e = &((*e)->next);\n\t}\n } else {\n\tfirst = e = &(m_table[hashstr(name, m_maxlen) % m_size]);\n\twhile (*e != (Entry *) NULL) {\n\t if (strcmp((*e)->name, name) == 0) {\n\t\tif (move && e != first) {\n\t\t \/* move to first position *\/\n\t\t next = (*e)->next;\n\t\t (*e)->next = *first;\n\t\t *first = *e;\n\t\t *e = next;\n\t\t return first;\n\t\t}\n\t\tbreak;\n\t }\n\t e = &((*e)->next);\n\t}\n }\n return e;\n}\n<commit_msg>Alternative fix for build error with g++ v6<commit_after>\/*\n * This file is part of DGD, https:\/\/github.com\/dworkin\/dgd\n * Copyright (C) 1993-2010 Dworkin B.V.\n * Copyright (C) 2010-2016 DGD Authors (see the commit log for details)\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 \"dgd.h\"\n# include \"hash.h\"\n\n\/*\n * Generic string hash table.\n *\/\n\nunsigned char Hashtab::tab[256] = {\n 0001, 0127, 0061, 0014, 0260, 0262, 0146, 0246,\n 0171, 0301, 0006, 0124, 0371, 0346, 0054, 0243,\n 0016, 0305, 0325, 0265, 0241, 0125, 0332, 0120,\n 0100, 0357, 0030, 0342, 0354, 0216, 0046, 0310,\n 0156, 0261, 0150, 0147, 0215, 0375, 0377, 0062,\n 0115, 0145, 0121, 0022, 0055, 0140, 0037, 0336,\n 0031, 0153, 0276, 0106, 0126, 0355, 0360, 0042,\n 0110, 0362, 0024, 0326, 0364, 0343, 0225, 0353,\n 0141, 0352, 0071, 0026, 0074, 0372, 0122, 0257,\n 0320, 0005, 0177, 0307, 0157, 0076, 0207, 0370,\n 0256, 0251, 0323, 0072, 0102, 0232, 0152, 0303,\n 0365, 0253, 0021, 0273, 0266, 0263, 0000, 0363,\n 0204, 0070, 0224, 0113, 0200, 0205, 0236, 0144,\n 0202, 0176, 0133, 0015, 0231, 0366, 0330, 0333,\n 0167, 0104, 0337, 0116, 0123, 0130, 0311, 0143,\n 0172, 0013, 0134, 0040, 0210, 0162, 0064, 0012,\n 0212, 0036, 0060, 0267, 0234, 0043, 0075, 0032,\n 0217, 0112, 0373, 0136, 0201, 0242, 0077, 0230,\n 0252, 0007, 0163, 0247, 0361, 0316, 0003, 0226,\n 0067, 0073, 0227, 0334, 0132, 0065, 0027, 0203,\n 0175, 0255, 0017, 0356, 0117, 0137, 0131, 0020,\n 0151, 0211, 0341, 0340, 0331, 0240, 0045, 0173,\n 0166, 0111, 0002, 0235, 0056, 0164, 0011, 0221,\n 0206, 0344, 0317, 0324, 0312, 0327, 0105, 0345,\n 0033, 0274, 0103, 0174, 0250, 0374, 0052, 0004,\n 0035, 0154, 0025, 0367, 0023, 0315, 0047, 0313,\n 0351, 0050, 0272, 0223, 0306, 0300, 0233, 0041,\n 0244, 0277, 0142, 0314, 0245, 0264, 0165, 0114,\n 0214, 0044, 0322, 0254, 0051, 0066, 0237, 0010,\n 0271, 0350, 0161, 0304, 0347, 0057, 0222, 0170,\n 0063, 0101, 0034, 0220, 0376, 0335, 0135, 0275,\n 0302, 0213, 0160, 0053, 0107, 0155, 0270, 0321,\n};\n\n\/*\n * NAME:\tHashtab::create()\n * DESCRIPTION:\thashtable factory\n *\/\nHashtab *Hashtab::create(unsigned int size, unsigned int maxlen, bool mem)\n{\n return new HashtabImpl(size, maxlen, mem);\n}\n\n\/*\n * NAME:\tHashtab::hashstr()\n * DESCRIPTION:\tHash string s, considering at most len characters. Return\n *\t\tan unsigned modulo size.\n *\t\tBased on Peter K. Pearson's article in CACM 33-6, pp 677.\n *\/\nunsigned short Hashtab::hashstr(const char *str, unsigned int len)\n{\n unsigned char h, l;\n\n h = l = 0;\n while (*str != '\\0' && len > 0) {\n\th = l;\n\tl = tab[l ^ (unsigned char) *str++];\n\t--len;\n }\n return (unsigned short) ((h << 8) | l);\n}\n\n\/*\n * NAME:\tHashtab::hashmem()\n * DESCRIPTION:\thash memory\n *\/\nunsigned short Hashtab::hashmem(const char *mem, unsigned int len)\n{\n unsigned char h, l;\n\n h = l = 0;\n while (len > 0) {\n\th = l;\n\tl = tab[l ^ (unsigned char) *mem++];\n\t--len;\n }\n return (unsigned short) ((h << 8) | l);\n}\n\n\n\/*\n * NAME:\tHashtabImpl()\n * DESCRIPTION:\tcreate a new hashtable of size \"size\", where \"maxlen\" characters\n *\t\tof each string are significant\n *\/\nHashtabImpl::HashtabImpl(unsigned int size, unsigned int maxlen, bool mem)\n{\n m_size = size;\n m_maxlen = maxlen;\n m_mem = mem;\n m_table = ALLOC(Entry*, size);\n memset(m_table, '\\0', size * sizeof(Entry*));\n}\n\n\/*\n * NAME:\t~HashtabImpl()\n * DESCRIPTION:\tdelete a hash table\n *\/\nHashtabImpl::~HashtabImpl()\n{\n FREE(m_table);\n}\n\n\/*\n * NAME:\tHashtabImpl::lookup()\n * DESCRIPTION:\tlookup a name in a hashtable, return the address of the entry\n *\t\tor &NULL if none found\n *\/\nHashtab::Entry **HashtabImpl::lookup(const char *name, bool move)\n{\n Entry **first, **e, *next;\n\n if (m_mem) {\n\tfirst = e = &(m_table[hashmem(name, m_maxlen) % m_size]);\n\twhile (*e != (Entry *) NULL) {\n\t if (memcmp((*e)->name, name, m_maxlen) == 0) {\n\t\tif (move && e != first) {\n\t\t \/* move to first position *\/\n\t\t next = (*e)->next;\n\t\t (*e)->next = *first;\n\t\t *first = *e;\n\t\t *e = next;\n\t\t return first;\n\t\t}\n\t\tbreak;\n\t }\n\t e = &((*e)->next);\n\t}\n } else {\n\tfirst = e = &(m_table[hashstr(name, m_maxlen) % m_size]);\n\twhile (*e != (Entry *) NULL) {\n\t if (strcmp((*e)->name, name) == 0) {\n\t\tif (move && e != first) {\n\t\t \/* move to first position *\/\n\t\t next = (*e)->next;\n\t\t (*e)->next = *first;\n\t\t *first = *e;\n\t\t *e = next;\n\t\t return first;\n\t\t}\n\t\tbreak;\n\t }\n\t e = &((*e)->next);\n\t}\n }\n return e;\n}\n<|endoftext|>"} {"text":"<commit_before>\/\/ Pocket.cpp\r\n\r\n#include \"stdafx.h\"\r\n#include \"Pocket.h\"\r\n#include \"CNCConfig.h\"\r\n#include \"ProgramCanvas.h\"\r\n#include \"..\/..\/interface\/HeeksObj.h\"\r\n#include \"..\/..\/interface\/PropertyDouble.h\"\r\n#include \"..\/..\/interface\/PropertyString.h\"\r\n#include \"..\/..\/interface\/PropertyChoice.h\"\r\n#include \"..\/..\/interface\/PropertyVertex.h\"\r\n#include \"..\/..\/interface\/PropertyCheck.h\"\r\n#include \"..\/..\/tinyxml\/tinyxml.h\"\r\n\r\nCPocketParams::CPocketParams()\r\n{\r\n\tm_tool_diameter = 0.0;\r\n\tm_step_over = 0.0;\r\n\tm_round_corner_factor = 0.0;\r\n\tm_clearance_height = 0.0;\r\n\tm_final_depth = 0.0;\r\n\tm_rapid_down_to_height = 0.0;\r\n\tm_horizontal_feed_rate = 0.0;\r\n\tm_vertical_feed_rate = 0.0;\r\n\tm_spindle_speed = 0.0;\r\n}\r\n\r\nvoid CPocketParams::set_initial_values()\n{\n\tCNCConfig config;\n\tconfig.Read(_T(\"PocketToolDiameter\"), &m_tool_diameter, 3.0);\r\n\tconfig.Read(_T(\"PocketStepOver\"), &m_step_over, 1.0);\r\n\tconfig.Read(_T(\"PocketRoundCornerFactor\"), &m_round_corner_factor, 1.5);\r\n\tconfig.Read(_T(\"PocketClearanceHeight\"), &m_clearance_height, 5.0);\r\n\tconfig.Read(_T(\"PocketFinalDepth\"), &m_final_depth, -0.1);\r\n\tconfig.Read(_T(\"PocketRapidDown\"), &m_rapid_down_to_height, 2.0);\r\n\tconfig.Read(_T(\"PocketHorizFeed\"), &m_horizontal_feed_rate, 100.0);\r\n\tconfig.Read(_T(\"PocketVertFeed\"), &m_vertical_feed_rate, 100.0);\r\n\tconfig.Read(_T(\"PocketSpindleSpeed\"), &m_spindle_speed, 7000);\r\n}\r\n\r\nvoid CPocketParams::write_values_to_config()\n{\n\tCNCConfig config;\n\tconfig.Write(_T(\"PocketToolDiameter\"), m_tool_diameter);\r\n\tconfig.Write(_T(\"PocketStepOver\"), m_step_over);\r\n\tconfig.Write(_T(\"PocketRoundCornerFactor\"), m_round_corner_factor);\r\n\tconfig.Write(_T(\"PocketClearanceHeight\"), m_clearance_height);\r\n\tconfig.Write(_T(\"PocketFinalDepth\"), m_final_depth);\r\n\tconfig.Write(_T(\"PocketRapidDown\"), m_rapid_down_to_height);\r\n\tconfig.Write(_T(\"PocketHorizFeed\"), m_horizontal_feed_rate);\r\n\tconfig.Write(_T(\"PocketVertFeed\"), m_vertical_feed_rate);\r\n\tconfig.Write(_T(\"PocketSpindleSpeed\"), m_spindle_speed);\r\n}\n\nstatic void on_set_tool_diameter(double value, HeeksObj* object){((CPocket*)object)->m_params.m_tool_diameter = value;}\r\nstatic void on_set_step_over(double value, HeeksObj* object){((CPocket*)object)->m_params.m_step_over = value;}\r\nstatic void on_set_round_corner_factor(double value, HeeksObj* object){((CPocket*)object)->m_params.m_round_corner_factor = value;}\r\nstatic void on_set_clearance_height(double value, HeeksObj* object){((CPocket*)object)->m_params.m_clearance_height = value;}\r\nstatic void on_set_final_depth(double value, HeeksObj* object){((CPocket*)object)->m_params.m_final_depth = value;}\r\nstatic void on_set_rapid_down_to_height(double value, HeeksObj* object){((CPocket*)object)->m_params.m_rapid_down_to_height = value;}\r\nstatic void on_set_horizontal_feed_rate(double value, HeeksObj* object){((CPocket*)object)->m_params.m_horizontal_feed_rate = value;}\r\nstatic void on_set_vertical_feed_rate(double value, HeeksObj* object){((CPocket*)object)->m_params.m_vertical_feed_rate = value;}\r\nstatic void on_set_spindle_speed(double value, HeeksObj* object){((CPocket*)object)->m_params.m_spindle_speed = value;}\r\n\nvoid CPocketParams::GetProperties(CPocket* parent, std::list<Property *> *list)\r\n{\r\n\tlist->push_back(new PropertyDouble(_(\"tool diameter\"), m_tool_diameter, parent, on_set_tool_diameter));\r\n\tlist->push_back(new PropertyDouble(_(\"step over\"), m_step_over, parent, on_set_step_over));\r\n\tlist->push_back(new PropertyDouble(_(\"round corner factor\"), m_round_corner_factor, parent, on_set_round_corner_factor));\r\n\tlist->push_back(new PropertyString(wxString(_T(\"( \")) + _(\"for 90 degree corners\") + _T(\" )\"), wxString(_T(\"( \")) + _(\"1.5 for square, 1.0 for round\") + _T(\" )\"), NULL));\r\n\tlist->push_back(new PropertyDouble(_(\"clearance height\"), m_clearance_height, parent, on_set_clearance_height));\r\n\tlist->push_back(new PropertyDouble(_(\"final depth\"), m_final_depth, parent, on_set_final_depth));\r\n\tlist->push_back(new PropertyDouble(_(\"rapid down to height\"), m_rapid_down_to_height, parent, on_set_rapid_down_to_height));\r\n\tlist->push_back(new PropertyDouble(_(\"horizontal feed rate\"), m_horizontal_feed_rate, parent, on_set_horizontal_feed_rate));\r\n\tlist->push_back(new PropertyDouble(_(\"vertical feed rate\"), m_vertical_feed_rate, parent, on_set_vertical_feed_rate));\r\n\tlist->push_back(new PropertyDouble(_(\"spindle speed\"), m_spindle_speed, parent, on_set_spindle_speed));\r\n}\r\n\r\nvoid CPocketParams::WriteXMLAttributes(TiXmlNode *root)\r\n{\r\n\tTiXmlElement * element;\r\n\telement = new TiXmlElement( \"params\" );\r\n\troot->LinkEndChild( element ); \r\n\telement->SetAttribute(\"toold\", m_tool_diameter);\r\n\telement->SetAttribute(\"step\", m_step_over);\r\n\telement->SetAttribute(\"rf\", m_round_corner_factor);\r\n\telement->SetAttribute(\"clear\", m_clearance_height);\r\n\telement->SetAttribute(\"depth\", m_final_depth);\r\n\telement->SetAttribute(\"r\", m_rapid_down_to_height);\r\n\telement->SetAttribute(\"hfeed\", m_horizontal_feed_rate);\r\n\telement->SetAttribute(\"vfeed\", m_vertical_feed_rate);\r\n\telement->SetAttribute(\"spin\", m_spindle_speed);\r\n}\r\n\r\nvoid CPocketParams::ReadFromXMLElement(TiXmlElement* pElem)\r\n{\r\n\t\/\/ get the attributes\r\n\tfor(TiXmlAttribute* a = pElem->FirstAttribute(); a; a = a->Next())\r\n\t{\r\n\t\tstd::string name(a->Name());\r\n\t\tif(name == \"toold\"){m_tool_diameter = a->DoubleValue();}\r\n\t\telse if(name == \"step\"){m_step_over = a->DoubleValue();}\r\n\t\telse if(name == \"rf\"){m_round_corner_factor = a->DoubleValue();}\r\n\t\telse if(name == \"clear\"){m_clearance_height = a->DoubleValue();}\r\n\t\telse if(name == \"depth\"){m_final_depth = a->DoubleValue();}\r\n\t\telse if(name == \"r\"){m_rapid_down_to_height = a->DoubleValue();}\r\n\t\telse if(name == \"hfeed\"){m_horizontal_feed_rate = a->DoubleValue();}\r\n\t\telse if(name == \"vfeed\"){m_vertical_feed_rate = a->DoubleValue();}\r\n\t\telse if(name == \"spin\"){m_spindle_speed = a->DoubleValue();}\r\n\t}\r\n}\r\n\nstatic void WriteSketchDefn(HeeksObj* sketch)\n{\n\ttheApp.m_program_canvas->m_textCtrl->AppendText(wxString::Format(_T(\"a%d = area.new()\\n\"), sketch->m_id));\n\n\tbool started = false;\n\n\tfor(HeeksObj* span_object = sketch->GetFirstChild(); span_object; span_object = sketch->GetNextChild())\n\t{\n\t\tdouble s[3] = {0, 0, 0};\r\n\t\tdouble e[3] = {0, 0, 0};\r\n\t\tdouble c[3] = {0, 0, 0};\r\n\r\n\t\tif(span_object){\r\n\t\t\tint type = span_object->GetType();\r\n\t\t\tif(type == LineType || type == ArcType)\r\n\t\t\t{\r\n\t\t\t\tif(!started)\r\n\t\t\t\t{\r\n\t\t\t\t\tspan_object->GetStartPoint(s);\r\n\t\t\t\t\ttheApp.m_program_canvas->m_textCtrl->AppendText(wxString::Format(_T(\"area.add_point(a%d, %d, %g, %g, %g, %g)\\n\"), sketch->m_id, 0, s[0], s[1], 0.0, 0.0));\n\t\t\t\t\tstarted = true;\n\t\t\t\t}\r\n\t\t\t\tspan_object->GetEndPoint(e);\r\n\t\t\t\tif(type == LineType)\r\n\t\t\t\t{\r\n\t\t\t\t\ttheApp.m_program_canvas->m_textCtrl->AppendText(wxString::Format(_T(\"area.add_point(a%d, %d, %g, %g, %g, %g)\\n\"), sketch->m_id, 0, e[0], e[1], 0.0, 0.0));\n\t\t\t\t}\r\n\t\t\t\telse if(type == ArcType)\r\n\t\t\t\t{\r\n\t\t\t\t\tspan_object->GetCentrePoint(c);\r\n\t\t\t\t\tdouble pos[3];\r\n\t\t\t\t\theeksCAD->GetArcAxis(span_object, pos);\r\n\t\t\t\t\tint span_type = (pos[2] >=0) ? 1:-1;\r\n\t\t\t\t\ttheApp.m_program_canvas->m_textCtrl->AppendText(wxString::Format(_T(\"area.add_point(a%d, %d, %g, %g, %g, %g)\\n\"), sketch->m_id, span_type, e[0], e[1], c[0], c[1]));\n\t\t\t\t}\r\n\t\t\t}\r\n\t\t}\r\n\t}\n\n\ttheApp.m_program_canvas->m_textCtrl->AppendText(_T(\"\\n\"));\n}\n\nvoid CPocket::AppendTextToProgram()\n{\n\ttheApp.m_program_canvas->m_textCtrl->AppendText(wxString::Format(_T(\"clearance = float(%g)\\n\"), m_params.m_clearance_height));\n\ttheApp.m_program_canvas->m_textCtrl->AppendText(wxString::Format(_T(\"rapid_down_to_height = float(%g)\\n\"), m_params.m_rapid_down_to_height));\n\ttheApp.m_program_canvas->m_textCtrl->AppendText(wxString::Format(_T(\"final_depth = float(%g)\\n\"), m_params.m_final_depth));\n\ttheApp.m_program_canvas->m_textCtrl->AppendText(wxString::Format(_T(\"tool_diameter = float(%g)\\n\"), m_params.m_tool_diameter));\n\ttheApp.m_program_canvas->m_textCtrl->AppendText(wxString::Format(_T(\"spindle(%g)\\n\"), m_params.m_spindle_speed));\n\ttheApp.m_program_canvas->m_textCtrl->AppendText(wxString::Format(_T(\"feedrate(%g)\\n\"), m_params.m_horizontal_feed_rate));\n\ttheApp.m_program_canvas->m_textCtrl->AppendText(wxString::Format(_T(\"tool_change(1)\\n\")));\n\tfor(std::list<int>::iterator It = m_sketches.begin(); It != m_sketches.end(); It++)\n\t{\n\t\tint sketch = *It;\n\n\t\t\/\/ write an area definition\n\t\tHeeksObj* object = heeksCAD->GetIDObject(SketchType, sketch);\n\t\tif(object == NULL || object->GetNumChildren() == 0)continue;\n\n\t\tif(object)\n\t\t{\n\t\t\tWriteSketchDefn(object);\n\r\n\t\t\t\/\/ start - assume we are at a suitable clearance height\r\n\n\t\t\t\/\/ Pocket the area\n\t\t\ttheApp.m_program_canvas->m_textCtrl->AppendText(wxString::Format(_T(\"stdops.pocket(a%d, tool_diameter\/2, %lf, %lf)\\n\"), sketch, m_params.m_step_over, m_params.m_round_corner_factor));\n\r\n\t\t\t\/\/ rapid back up to clearance plane\r\n\t\t\ttheApp.m_program_canvas->m_textCtrl->AppendText(wxString(_T(\"rapid(z = clearance)\\n\")));\t\t\t\n\t\t}\n\t}\n}\n\r\nvoid CPocket::glCommands(bool select, bool marked, bool no_color)\r\n{\r\n\tif(marked && !no_color)\r\n\t{\r\n\t\tfor(std::list<int>::iterator It = m_sketches.begin(); It != m_sketches.end(); It++)\n\t\t{\n\t\t\tint sketch = *It;\n\t\t\tHeeksObj* object = heeksCAD->GetIDObject(SketchType, sketch);\r\n\t\t\tif(object)object->glCommands(false, true, false);\r\n\t\t}\r\n\t}\r\n}\r\n\r\nvoid CPocket::GetProperties(std::list<Property *> *list)\r\n{\r\n\tm_params.GetProperties(this, list);\r\n\tHeeksObj::GetProperties(list);\r\n}\r\n\r\nHeeksObj *CPocket::MakeACopy(void)const\r\n{\r\n\treturn new CPocket(*this);\r\n}\r\n\r\nvoid CPocket::CopyFrom(const HeeksObj* object)\r\n{\r\n\toperator=(*((CPocket*)object));\r\n}\r\n\r\nbool CPocket::CanAddTo(HeeksObj* owner)\r\n{\r\n\treturn owner->GetType() == OperationsType;\r\n}\r\n\r\nvoid CPocket::WriteXML(TiXmlNode *root)\r\n{\r\n\tTiXmlElement * element = new TiXmlElement( \"Pocket\" );\r\n\troot->LinkEndChild( element ); \r\n\tm_params.WriteXMLAttributes(element);\r\n\r\n\t\/\/ write sketch ids\r\n\tfor(std::list<int>::iterator It = m_sketches.begin(); It != m_sketches.end(); It++)\n\t{\n\t\tint sketch = *It;\r\n\t\tTiXmlElement * sketch_element = new TiXmlElement( \"sketch\" );\r\n\t\telement->LinkEndChild( sketch_element ); \r\n\t\tsketch_element->SetAttribute(\"id\", sketch);\r\n\t}\r\n\r\n\tWriteBaseXML(element);\r\n}\r\n\r\n\/\/ static member function\r\nHeeksObj* CPocket::ReadFromXMLElement(TiXmlElement* element)\r\n{\r\n\tCPocket* new_object = new CPocket;\r\n\r\n\t\/\/ read sketch ids\r\n\tfor(TiXmlElement* pElem = TiXmlHandle(element).FirstChildElement().Element(); pElem; pElem = pElem->NextSiblingElement())\r\n\t{\r\n\t\tstd::string name(pElem->Value());\r\n\t\tif(name == \"params\"){\r\n\t\t\tnew_object->m_params.ReadFromXMLElement(pElem);\r\n\t\t}\r\n\t\telse if(name == \"sketch\"){\r\n\t\t\tfor(TiXmlAttribute* a = pElem->FirstAttribute(); a; a = a->Next())\r\n\t\t\t{\r\n\t\t\t\tstd::string name(a->Name());\r\n\t\t\t\tif(name == \"id\"){\r\n\t\t\t\t\tint id = a->IntValue();\r\n\t\t\t\t\tnew_object->m_sketches.push_back(id);\r\n\t\t\t\t}\r\n\t\t\t}\r\n\t\t}\r\n\t}\r\n\r\n\tnew_object->ReadBaseXML(element);\r\n\r\n\treturn new_object;\r\n}\n<commit_msg>work on libarea Issue 2: \t Islands<commit_after>\/\/ Pocket.cpp\r\n\r\n#include \"stdafx.h\"\r\n#include \"Pocket.h\"\r\n#include \"CNCConfig.h\"\r\n#include \"ProgramCanvas.h\"\r\n#include \"..\/..\/interface\/HeeksObj.h\"\r\n#include \"..\/..\/interface\/PropertyDouble.h\"\r\n#include \"..\/..\/interface\/PropertyString.h\"\r\n#include \"..\/..\/interface\/PropertyChoice.h\"\r\n#include \"..\/..\/interface\/PropertyVertex.h\"\r\n#include \"..\/..\/interface\/PropertyCheck.h\"\r\n#include \"..\/..\/tinyxml\/tinyxml.h\"\r\n\r\nCPocketParams::CPocketParams()\r\n{\r\n\tm_tool_diameter = 0.0;\r\n\tm_step_over = 0.0;\r\n\tm_round_corner_factor = 0.0;\r\n\tm_clearance_height = 0.0;\r\n\tm_final_depth = 0.0;\r\n\tm_rapid_down_to_height = 0.0;\r\n\tm_horizontal_feed_rate = 0.0;\r\n\tm_vertical_feed_rate = 0.0;\r\n\tm_spindle_speed = 0.0;\r\n}\r\n\r\nvoid CPocketParams::set_initial_values()\n{\n\tCNCConfig config;\n\tconfig.Read(_T(\"PocketToolDiameter\"), &m_tool_diameter, 3.0);\r\n\tconfig.Read(_T(\"PocketStepOver\"), &m_step_over, 1.0);\r\n\tconfig.Read(_T(\"PocketRoundCornerFactor\"), &m_round_corner_factor, 1.5);\r\n\tconfig.Read(_T(\"PocketClearanceHeight\"), &m_clearance_height, 5.0);\r\n\tconfig.Read(_T(\"PocketFinalDepth\"), &m_final_depth, -0.1);\r\n\tconfig.Read(_T(\"PocketRapidDown\"), &m_rapid_down_to_height, 2.0);\r\n\tconfig.Read(_T(\"PocketHorizFeed\"), &m_horizontal_feed_rate, 100.0);\r\n\tconfig.Read(_T(\"PocketVertFeed\"), &m_vertical_feed_rate, 100.0);\r\n\tconfig.Read(_T(\"PocketSpindleSpeed\"), &m_spindle_speed, 7000);\r\n}\r\n\r\nvoid CPocketParams::write_values_to_config()\n{\n\tCNCConfig config;\n\tconfig.Write(_T(\"PocketToolDiameter\"), m_tool_diameter);\r\n\tconfig.Write(_T(\"PocketStepOver\"), m_step_over);\r\n\tconfig.Write(_T(\"PocketRoundCornerFactor\"), m_round_corner_factor);\r\n\tconfig.Write(_T(\"PocketClearanceHeight\"), m_clearance_height);\r\n\tconfig.Write(_T(\"PocketFinalDepth\"), m_final_depth);\r\n\tconfig.Write(_T(\"PocketRapidDown\"), m_rapid_down_to_height);\r\n\tconfig.Write(_T(\"PocketHorizFeed\"), m_horizontal_feed_rate);\r\n\tconfig.Write(_T(\"PocketVertFeed\"), m_vertical_feed_rate);\r\n\tconfig.Write(_T(\"PocketSpindleSpeed\"), m_spindle_speed);\r\n}\n\nstatic void on_set_tool_diameter(double value, HeeksObj* object){((CPocket*)object)->m_params.m_tool_diameter = value;}\r\nstatic void on_set_step_over(double value, HeeksObj* object){((CPocket*)object)->m_params.m_step_over = value;}\r\nstatic void on_set_round_corner_factor(double value, HeeksObj* object){((CPocket*)object)->m_params.m_round_corner_factor = value;}\r\nstatic void on_set_clearance_height(double value, HeeksObj* object){((CPocket*)object)->m_params.m_clearance_height = value;}\r\nstatic void on_set_final_depth(double value, HeeksObj* object){((CPocket*)object)->m_params.m_final_depth = value;}\r\nstatic void on_set_rapid_down_to_height(double value, HeeksObj* object){((CPocket*)object)->m_params.m_rapid_down_to_height = value;}\r\nstatic void on_set_horizontal_feed_rate(double value, HeeksObj* object){((CPocket*)object)->m_params.m_horizontal_feed_rate = value;}\r\nstatic void on_set_vertical_feed_rate(double value, HeeksObj* object){((CPocket*)object)->m_params.m_vertical_feed_rate = value;}\r\nstatic void on_set_spindle_speed(double value, HeeksObj* object){((CPocket*)object)->m_params.m_spindle_speed = value;}\r\n\nvoid CPocketParams::GetProperties(CPocket* parent, std::list<Property *> *list)\r\n{\r\n\tlist->push_back(new PropertyDouble(_(\"tool diameter\"), m_tool_diameter, parent, on_set_tool_diameter));\r\n\tlist->push_back(new PropertyDouble(_(\"step over\"), m_step_over, parent, on_set_step_over));\r\n\tlist->push_back(new PropertyDouble(_(\"round corner factor\"), m_round_corner_factor, parent, on_set_round_corner_factor));\r\n\tlist->push_back(new PropertyString(wxString(_T(\"( \")) + _(\"for 90 degree corners\") + _T(\" )\"), wxString(_T(\"( \")) + _(\"1.5 for square, 1.0 for round\") + _T(\" )\"), NULL));\r\n\tlist->push_back(new PropertyDouble(_(\"clearance height\"), m_clearance_height, parent, on_set_clearance_height));\r\n\tlist->push_back(new PropertyDouble(_(\"final depth\"), m_final_depth, parent, on_set_final_depth));\r\n\tlist->push_back(new PropertyDouble(_(\"rapid down to height\"), m_rapid_down_to_height, parent, on_set_rapid_down_to_height));\r\n\tlist->push_back(new PropertyDouble(_(\"horizontal feed rate\"), m_horizontal_feed_rate, parent, on_set_horizontal_feed_rate));\r\n\tlist->push_back(new PropertyDouble(_(\"vertical feed rate\"), m_vertical_feed_rate, parent, on_set_vertical_feed_rate));\r\n\tlist->push_back(new PropertyDouble(_(\"spindle speed\"), m_spindle_speed, parent, on_set_spindle_speed));\r\n}\r\n\r\nvoid CPocketParams::WriteXMLAttributes(TiXmlNode *root)\r\n{\r\n\tTiXmlElement * element;\r\n\telement = new TiXmlElement( \"params\" );\r\n\troot->LinkEndChild( element ); \r\n\telement->SetAttribute(\"toold\", m_tool_diameter);\r\n\telement->SetAttribute(\"step\", m_step_over);\r\n\telement->SetAttribute(\"rf\", m_round_corner_factor);\r\n\telement->SetAttribute(\"clear\", m_clearance_height);\r\n\telement->SetAttribute(\"depth\", m_final_depth);\r\n\telement->SetAttribute(\"r\", m_rapid_down_to_height);\r\n\telement->SetAttribute(\"hfeed\", m_horizontal_feed_rate);\r\n\telement->SetAttribute(\"vfeed\", m_vertical_feed_rate);\r\n\telement->SetAttribute(\"spin\", m_spindle_speed);\r\n}\r\n\r\nvoid CPocketParams::ReadFromXMLElement(TiXmlElement* pElem)\r\n{\r\n\t\/\/ get the attributes\r\n\tfor(TiXmlAttribute* a = pElem->FirstAttribute(); a; a = a->Next())\r\n\t{\r\n\t\tstd::string name(a->Name());\r\n\t\tif(name == \"toold\"){m_tool_diameter = a->DoubleValue();}\r\n\t\telse if(name == \"step\"){m_step_over = a->DoubleValue();}\r\n\t\telse if(name == \"rf\"){m_round_corner_factor = a->DoubleValue();}\r\n\t\telse if(name == \"clear\"){m_clearance_height = a->DoubleValue();}\r\n\t\telse if(name == \"depth\"){m_final_depth = a->DoubleValue();}\r\n\t\telse if(name == \"r\"){m_rapid_down_to_height = a->DoubleValue();}\r\n\t\telse if(name == \"hfeed\"){m_horizontal_feed_rate = a->DoubleValue();}\r\n\t\telse if(name == \"vfeed\"){m_vertical_feed_rate = a->DoubleValue();}\r\n\t\telse if(name == \"spin\"){m_spindle_speed = a->DoubleValue();}\r\n\t}\r\n}\r\n\nstatic void WriteSketchDefn(HeeksObj* sketch)\n{\n\ttheApp.m_program_canvas->m_textCtrl->AppendText(wxString::Format(_T(\"a%d = area.new()\\n\"), sketch->m_id));\n\n\tbool started = false;\n\n\tdouble prev_e[3];\n\n\tfor(HeeksObj* span_object = sketch->GetFirstChild(); span_object; span_object = sketch->GetNextChild())\n\t{\n\t\tdouble s[3] = {0, 0, 0};\r\n\t\tdouble e[3] = {0, 0, 0};\r\n\t\tdouble c[3] = {0, 0, 0};\r\n\r\n\t\tif(span_object){\r\n\t\t\tint type = span_object->GetType();\r\n\t\t\tif(type == LineType || type == ArcType)\r\n\t\t\t{\r\n\t\t\t\tspan_object->GetStartPoint(s);\n\t\t\t\tif(started && (fabs(s[0] - prev_e[0]) > 0.000000001 || fabs(s[1] - prev_e[1]) > 0.000000001))\n\t\t\t\t{\n\t\t\t\t\ttheApp.m_program_canvas->m_textCtrl->AppendText(wxString::Format(_T(\"area.start_new_curve(a%d)\\n\"), sketch->m_id));\n\t\t\t\t\tstarted = false;\n\t\t\t\t}\n\n\t\t\t\tif(!started)\n\t\t\t\t{\r\n\t\t\t\t\ttheApp.m_program_canvas->m_textCtrl->AppendText(wxString::Format(_T(\"area.add_point(a%d, %d, %g, %g, %g, %g)\\n\"), sketch->m_id, 0, s[0], s[1], 0.0, 0.0));\n\t\t\t\t\tstarted = true;\n\t\t\t\t}\n\t\t\t\tspan_object->GetEndPoint(e);\n\t\t\t\tif(type == LineType)\r\n\t\t\t\t{\r\n\t\t\t\t\ttheApp.m_program_canvas->m_textCtrl->AppendText(wxString::Format(_T(\"area.add_point(a%d, %d, %g, %g, %g, %g)\\n\"), sketch->m_id, 0, e[0], e[1], 0.0, 0.0));\n\t\t\t\t}\r\n\t\t\t\telse if(type == ArcType)\r\n\t\t\t\t{\r\n\t\t\t\t\tspan_object->GetCentrePoint(c);\r\n\t\t\t\t\tdouble pos[3];\r\n\t\t\t\t\theeksCAD->GetArcAxis(span_object, pos);\r\n\t\t\t\t\tint span_type = (pos[2] >=0) ? 1:-1;\r\n\t\t\t\t\ttheApp.m_program_canvas->m_textCtrl->AppendText(wxString::Format(_T(\"area.add_point(a%d, %d, %g, %g, %g, %g)\\n\"), sketch->m_id, span_type, e[0], e[1], c[0], c[1]));\n\t\t\t\t}\r\n\t\t\t\tmemcpy(prev_e, e, 3*sizeof(double));\n\t\t\t}\r\n\t\t}\n\t}\n\n\ttheApp.m_program_canvas->m_textCtrl->AppendText(_T(\"\\n\"));\n}\n\nvoid CPocket::AppendTextToProgram()\n{\n\ttheApp.m_program_canvas->m_textCtrl->AppendText(wxString::Format(_T(\"clearance = float(%g)\\n\"), m_params.m_clearance_height));\n\ttheApp.m_program_canvas->m_textCtrl->AppendText(wxString::Format(_T(\"rapid_down_to_height = float(%g)\\n\"), m_params.m_rapid_down_to_height));\n\ttheApp.m_program_canvas->m_textCtrl->AppendText(wxString::Format(_T(\"final_depth = float(%g)\\n\"), m_params.m_final_depth));\n\ttheApp.m_program_canvas->m_textCtrl->AppendText(wxString::Format(_T(\"tool_diameter = float(%g)\\n\"), m_params.m_tool_diameter));\n\ttheApp.m_program_canvas->m_textCtrl->AppendText(wxString::Format(_T(\"spindle(%g)\\n\"), m_params.m_spindle_speed));\n\ttheApp.m_program_canvas->m_textCtrl->AppendText(wxString::Format(_T(\"feedrate(%g)\\n\"), m_params.m_horizontal_feed_rate));\n\ttheApp.m_program_canvas->m_textCtrl->AppendText(wxString::Format(_T(\"tool_change(1)\\n\")));\n\tfor(std::list<int>::iterator It = m_sketches.begin(); It != m_sketches.end(); It++)\n\t{\n\t\tint sketch = *It;\n\n\t\t\/\/ write an area definition\n\t\tHeeksObj* object = heeksCAD->GetIDObject(SketchType, sketch);\n\t\tif(object == NULL || object->GetNumChildren() == 0)continue;\n\n\t\tif(object)\n\t\t{\n\t\t\tWriteSketchDefn(object);\n\r\n\t\t\t\/\/ start - assume we are at a suitable clearance height\r\n\n\t\t\t\/\/ Pocket the area\n\t\t\ttheApp.m_program_canvas->m_textCtrl->AppendText(wxString::Format(_T(\"stdops.pocket(a%d, tool_diameter\/2, %lf, %lf)\\n\"), sketch, m_params.m_step_over, m_params.m_round_corner_factor));\n\r\n\t\t\t\/\/ rapid back up to clearance plane\r\n\t\t\ttheApp.m_program_canvas->m_textCtrl->AppendText(wxString(_T(\"rapid(z = clearance)\\n\")));\t\t\t\n\t\t}\n\t}\n}\n\r\nvoid CPocket::glCommands(bool select, bool marked, bool no_color)\r\n{\r\n\tif(marked && !no_color)\r\n\t{\r\n\t\tfor(std::list<int>::iterator It = m_sketches.begin(); It != m_sketches.end(); It++)\n\t\t{\n\t\t\tint sketch = *It;\n\t\t\tHeeksObj* object = heeksCAD->GetIDObject(SketchType, sketch);\r\n\t\t\tif(object)object->glCommands(false, true, false);\r\n\t\t}\r\n\t}\r\n}\r\n\r\nvoid CPocket::GetProperties(std::list<Property *> *list)\r\n{\r\n\tm_params.GetProperties(this, list);\r\n\tHeeksObj::GetProperties(list);\r\n}\r\n\r\nHeeksObj *CPocket::MakeACopy(void)const\r\n{\r\n\treturn new CPocket(*this);\r\n}\r\n\r\nvoid CPocket::CopyFrom(const HeeksObj* object)\r\n{\r\n\toperator=(*((CPocket*)object));\r\n}\r\n\r\nbool CPocket::CanAddTo(HeeksObj* owner)\r\n{\r\n\treturn owner->GetType() == OperationsType;\r\n}\r\n\r\nvoid CPocket::WriteXML(TiXmlNode *root)\r\n{\r\n\tTiXmlElement * element = new TiXmlElement( \"Pocket\" );\r\n\troot->LinkEndChild( element ); \r\n\tm_params.WriteXMLAttributes(element);\r\n\r\n\t\/\/ write sketch ids\r\n\tfor(std::list<int>::iterator It = m_sketches.begin(); It != m_sketches.end(); It++)\n\t{\n\t\tint sketch = *It;\r\n\t\tTiXmlElement * sketch_element = new TiXmlElement( \"sketch\" );\r\n\t\telement->LinkEndChild( sketch_element ); \r\n\t\tsketch_element->SetAttribute(\"id\", sketch);\r\n\t}\r\n\r\n\tWriteBaseXML(element);\r\n}\r\n\r\n\/\/ static member function\r\nHeeksObj* CPocket::ReadFromXMLElement(TiXmlElement* element)\r\n{\r\n\tCPocket* new_object = new CPocket;\r\n\r\n\t\/\/ read sketch ids\r\n\tfor(TiXmlElement* pElem = TiXmlHandle(element).FirstChildElement().Element(); pElem; pElem = pElem->NextSiblingElement())\r\n\t{\r\n\t\tstd::string name(pElem->Value());\r\n\t\tif(name == \"params\"){\r\n\t\t\tnew_object->m_params.ReadFromXMLElement(pElem);\r\n\t\t}\r\n\t\telse if(name == \"sketch\"){\r\n\t\t\tfor(TiXmlAttribute* a = pElem->FirstAttribute(); a; a = a->Next())\r\n\t\t\t{\r\n\t\t\t\tstd::string name(a->Name());\r\n\t\t\t\tif(name == \"id\"){\r\n\t\t\t\t\tint id = a->IntValue();\r\n\t\t\t\t\tnew_object->m_sketches.push_back(id);\r\n\t\t\t\t}\r\n\t\t\t}\r\n\t\t}\r\n\t}\r\n\r\n\tnew_object->ReadBaseXML(element);\r\n\r\n\treturn new_object;\r\n}\n<|endoftext|>"} {"text":"<commit_before>#include <iostream>\n#include <mutex>\n#include <queue>\n#include <thread>\n#include <tuple>\n#include <condition_variable>\n#include <algorithm>\n\n#include \"input_file_reader.hpp\"\n#include \"minimize.hpp\"\n#include \"comparator.hpp\"\n#include \"result.hpp\"\n#include \"minimizer.hpp\"\n\n\/\/ mutex for shared resources\nstatic std::mutex g_resource_mutex;\n\n\/\/ mutex for result vector\nstatic std::mutex g_result_mutex;\n\n\/\/ global queue with two pointers to the sequences\n\/\/ they are compared directly if the both sequence lengths are small enough\nstatic std::queue<std::tuple<uint32_t, OLC::Sequence*, uint32_t, OLC::Sequence*>> g_sequence_pairs;\n\n\/\/ global queue with two pointers to vectors of minimizers\n\/\/ we use this instead if the sequences are too long\nstatic std::queue<std::tuple<uint32_t, std::vector<OLC::Minimizer>*, uint32_t, std::vector<OLC::Minimizer>*>> g_minimizer_pairs;\n\n\/\/ global vector with results\nstatic std::vector<OLC::Result*> g_results;\n\nstatic const uint32_t SEQUENCE_THRESHOLD_LENGTH = 20000;\n\nvoid worker()\n{\n while(true)\n {\n \/\/ Get the task and remove it from the pool\n uint32_t first_read_number;\n OLC::Sequence* first_sequence;\n std::vector<OLC::Minimizer>* first_minimizer;\n\n uint32_t second_read_number;\n OLC::Sequence* second_sequence;\n std::vector<OLC::Minimizer>* second_minimizer;\n\n {\n std::lock_guard<std::mutex> resource_lock(g_resource_mutex);\n\n if (g_sequence_pairs.empty())\n return;\n\n std::tie(first_read_number, first_sequence, second_read_number, second_sequence) = g_sequence_pairs.front();\n g_sequence_pairs.pop();\n std::tie(first_read_number, first_minimizer, second_read_number, second_minimizer) = g_minimizer_pairs.front();\n g_minimizer_pairs.pop();\n }\n\n \/\/ Pull out the wrapped nucleotide vectors\n const std::vector<OLC::Nucleotide> nucleotides1 = first_sequence->getNucleotides()->getSequence();\n const std::vector<OLC::Nucleotide> nucleotides2 = second_sequence->getNucleotides()->getSequence();\n\n \/\/ If small enough, no need to use minimizers\n if (nucleotides1.size() < SEQUENCE_THRESHOLD_LENGTH && nucleotides2.size() < SEQUENCE_THRESHOLD_LENGTH)\n {\n const OLC::Overlap overlap = compare(nucleotides1, nucleotides2);\n const uint32_t overlapFirstEnd = overlap.getEndFirst();\n const uint32_t overlapSecondEnd = overlap.getEndSecond();\n const uint32_t overlapFirstStart = overlap.getStartFirst();\n const uint32_t overlapSecondStart = overlap.getStartSecond();\n const uint32_t overlapLength = overlapFirstEnd - overlapFirstStart + 1;\n\n int32_t ahang = overlapFirstStart;\n int32_t bhang = nucleotides2.size() - overlapSecondEnd;\n\n if (overlapSecondStart > overlapFirstStart)\n ahang *= -1;\n\n if (nucleotides1.size() > overlapSecondEnd)\n bhang *= -1;\n\n OLC::Result* result = new OLC::Result(first_read_number, second_read_number, overlapLength, ahang, bhang);\n\n {\n std::lock_guard<std::mutex> result_lock(g_result_mutex);\n g_results.push_back(result);\n }\n }\n else\n {\n std::vector<OLC::Minimizer> allMinimizers;\n allMinimizers.reserve(first_minimizer->size() + second_minimizer->size());\n\n for (size_t i = 0; i < first_minimizer->size(); ++i)\n allMinimizers.push_back((*first_minimizer)[i]);\n\n std::sort(allMinimizers.begin(), allMinimizers.end());\n\n for (size_t i = 0; i < second_minimizer->size(); ++i) \n {\n if (!std::binary_search(allMinimizers.begin(), allMinimizers.end(), (*second_minimizer)[i]))\n allMinimizers.push_back((*second_minimizer)[i]);\n }\n\n std::sort(allMinimizers.begin(), allMinimizers.end());\n\n std::vector<int> codedSequence1;\n codedSequence1.reserve(first_minimizer->size());\n\n for (size_t i = 0; i < first_minimizer->size(); ++i)\n {\n const auto lower = std::lower_bound(allMinimizers.begin(), allMinimizers.end(), (*first_minimizer)[i]);\n codedSequence1.emplace_back(std::distance(allMinimizers.begin(), lower));\n }\n\n std::vector<int> codedSequence2;\n codedSequence2.reserve(second_minimizer->size());\n\n for (size_t i = 0; i < second_minimizer->size(); ++i)\n {\n const auto lower = std::lower_bound(allMinimizers.begin(), allMinimizers.end(), (*second_minimizer)[i]);\n codedSequence2.emplace_back(std::distance(allMinimizers.begin(), lower));\n }\n\n allMinimizers.clear();\n std::vector<OLC::Minimizer>().swap(allMinimizers);\n\n const OLC::Overlap overlap = OLC::compare(codedSequence1, codedSequence2);\n const uint32_t overlapFirstEnd = (*first_minimizer)[overlap.getEndFirst()].getPosition() + (*first_minimizer)[overlap.getEndFirst()].size();\n const uint32_t overlapSecondEnd = (*second_minimizer)[overlap.getEndSecond()].getPosition() + (*second_minimizer)[overlap.getEndSecond()].size();\n const uint32_t overlapFirstStart = (*first_minimizer)[overlap.getStartFirst()].getPosition();\n const uint32_t overlapSecondStart = (*second_minimizer)[overlap.getStartSecond()].getPosition();\n const uint32_t overlapLength = overlapFirstEnd - overlapFirstStart + 1;\n int32_t ahang = overlapFirstStart;\n int32_t bhang = nucleotides2.size() - overlapSecondEnd;\n\n if (overlapSecondStart > overlapFirstStart)\n ahang *= -1;\n\n if (nucleotides1.size() > overlapSecondEnd)\n bhang *= -1;\n\n OLC::Result* result = new OLC::Result(first_read_number, second_read_number, overlapLength, ahang, bhang);\n\n {\n std::lock_guard<std::mutex> result_lock(g_result_mutex);\n g_results.push_back(result);\n }\n\n }\n }\n}\n\nint main(int argc, char** argv)\n{\n std::ios_base::sync_with_stdio(false);\n\n if (argc != 4)\n {\n std::cout << \"Usage: \" << argv[0] << \" <minimum overlap length L> <FASTQ or FASTA file> <output file>\\n\";\n return 1;\n }\n\n \/\/ file with the data\n const std::string file = std::string(argv[2]);\n\n \/\/ output file\n const std::string output = std::string(argv[3]);\n\n \/\/ L is the minimum overlap length\n const uint32_t L = std::stoi(argv[1]);\n\n \/\/ window size\n const uint32_t w = (L + 1) \/ 2;\n\n \/\/ size of the k-mer\n const uint32_t k = (L + 1) \/ 2;\n\n \/\/ read phase\n OLC::InputFileReader reader(file);\n const std::vector<OLC::Sequence*> sequences = reader.readSequences();\n std::vector<std::vector<OLC::Minimizer>*> minimizers;\n\n uint32_t max_sequence_size = 0;\n\n for (size_t i = 0; i < sequences.size(); ++i)\n {\n const auto sequence = sequences[i]->getNucleotides()->getSequence();\n\n if (max_sequence_size < sequence.size())\n max_sequence_size = sequence.size();\n\n \/\/ calculate minimizers - both interior and end minimizers\n if (sequence.size() >= SEQUENCE_THRESHOLD_LENGTH)\n minimizers.push_back(minimize(sequence, w, k));\n else\n minimizers.push_back(nullptr);\n }\n\n \/\/ generate tasks so we can do this in parallel if possible\n std::queue<std::tuple<uint32_t, uint32_t>> tasks;\n\n for (uint32_t i = 0; i < sequences.size(); ++i)\n {\n for (uint32_t j = i + 1; j < sequences.size(); ++j)\n {\n g_sequence_pairs.emplace(i + 1, sequences[i], j + 1, sequences[j]);\n g_minimizer_pairs.emplace(i + 1, minimizers[i], j + 1, minimizers[j]);\n }\n }\n\n \/\/ use concurrent minimizer matching\n uint32_t num_threads = std::thread::hardware_concurrency();\n\n \/\/ scale thread number based on sequence size\n if (10000 <= max_sequence_size && max_sequence_size <= 100000)\n num_threads >>= 1;\n else if (100000 <= max_sequence_size)\n num_threads = 1;\n\n std::vector<std::thread> threads(3);\n\n for (uint8_t i = 0; i < threads.size(); ++i)\n threads[i] = std::thread(worker);\n\n for (uint8_t i = 0; i < threads.size(); ++i)\n threads[i].join();\n\n std::ofstream output_stream(output);\n\n for (size_t i = 0; i < g_results.size(); ++i)\n {\n auto identifiers = g_results[i]->getIdentifiers();\n\n output_stream << \"{OVL\\nadj:N\\nrds:\"<< std::get<0>(identifiers) << \",\" << std::get<1>(identifiers) << \"\\nscr:0\\nahg:\" << g_results[i]->getAhng() << \"\\nbhg:\" << g_results[i]->getBhng() << \"\\n}\\n\";\n }\n\n output_stream.close();\n\n \/\/ cleanup\n for (size_t i = 0; i < minimizers.size(); ++i)\n delete minimizers[i];\n\n for (size_t i = 0; i < sequences.size(); ++i)\n delete sequences[i];\n\n for (size_t i = 0; i < g_results.size(); ++i)\n delete g_results[i];\n\n return 0;\n}\n<commit_msg>main: protect against trivial case of empty overlap<commit_after>#include <iostream>\n#include <mutex>\n#include <queue>\n#include <thread>\n#include <tuple>\n#include <condition_variable>\n#include <algorithm>\n\n#include \"input_file_reader.hpp\"\n#include \"minimize.hpp\"\n#include \"comparator.hpp\"\n#include \"result.hpp\"\n#include \"minimizer.hpp\"\n\n\/\/ mutex for shared resources\nstatic std::mutex g_resource_mutex;\n\n\/\/ mutex for result vector\nstatic std::mutex g_result_mutex;\n\n\/\/ global queue with two pointers to the sequences\n\/\/ they are compared directly if the both sequence lengths are small enough\nstatic std::queue<std::tuple<uint32_t, OLC::Sequence*, uint32_t, OLC::Sequence*>> g_sequence_pairs;\n\n\/\/ global queue with two pointers to vectors of minimizers\n\/\/ we use this instead if the sequences are too long\nstatic std::queue<std::tuple<uint32_t, std::vector<OLC::Minimizer>*, uint32_t, std::vector<OLC::Minimizer>*>> g_minimizer_pairs;\n\n\/\/ global vector with results\nstatic std::vector<OLC::Result*> g_results;\n\nstatic const uint32_t SEQUENCE_THRESHOLD_LENGTH = 20000;\n\nvoid worker()\n{\n while(true)\n {\n \/\/ Get the task and remove it from the pool\n uint32_t first_read_number;\n OLC::Sequence* first_sequence;\n std::vector<OLC::Minimizer>* first_minimizer;\n\n uint32_t second_read_number;\n OLC::Sequence* second_sequence;\n std::vector<OLC::Minimizer>* second_minimizer;\n\n {\n std::lock_guard<std::mutex> resource_lock(g_resource_mutex);\n\n if (g_sequence_pairs.empty())\n return;\n\n std::tie(first_read_number, first_sequence, second_read_number, second_sequence) = g_sequence_pairs.front();\n g_sequence_pairs.pop();\n std::tie(first_read_number, first_minimizer, second_read_number, second_minimizer) = g_minimizer_pairs.front();\n g_minimizer_pairs.pop();\n }\n\n \/\/ Pull out the wrapped nucleotide vectors\n const std::vector<OLC::Nucleotide> nucleotides1 = first_sequence->getNucleotides()->getSequence();\n const std::vector<OLC::Nucleotide> nucleotides2 = second_sequence->getNucleotides()->getSequence();\n\n \/\/ If small enough, no need to use minimizers\n if (nucleotides1.size() < SEQUENCE_THRESHOLD_LENGTH && nucleotides2.size() < SEQUENCE_THRESHOLD_LENGTH)\n {\n const OLC::Overlap overlap = compare(nucleotides1, nucleotides2);\n const uint32_t overlapFirstEnd = overlap.getEndFirst();\n const uint32_t overlapSecondEnd = overlap.getEndSecond();\n const uint32_t overlapFirstStart = overlap.getStartFirst();\n const uint32_t overlapSecondStart = overlap.getStartSecond();\n const uint32_t overlapLength = overlapFirstEnd - overlapFirstStart + 1;\n\n int32_t ahang = overlapFirstStart;\n int32_t bhang = nucleotides2.size() - overlapSecondEnd;\n\n if (overlapSecondStart > overlapFirstStart)\n ahang *= -1;\n\n if (nucleotides1.size() > overlapSecondEnd)\n bhang *= -1;\n\n OLC::Result* result = new OLC::Result(first_read_number, second_read_number, overlapLength, ahang, bhang);\n\n {\n std::lock_guard<std::mutex> result_lock(g_result_mutex);\n g_results.push_back(result);\n }\n }\n else\n {\n std::vector<OLC::Minimizer> allMinimizers;\n allMinimizers.reserve(first_minimizer->size() + second_minimizer->size());\n\n for (size_t i = 0; i < first_minimizer->size(); ++i)\n allMinimizers.push_back((*first_minimizer)[i]);\n\n std::sort(allMinimizers.begin(), allMinimizers.end());\n\n for (size_t i = 0; i < second_minimizer->size(); ++i) \n {\n if (!std::binary_search(allMinimizers.begin(), allMinimizers.end(), (*second_minimizer)[i]))\n allMinimizers.push_back((*second_minimizer)[i]);\n }\n\n std::sort(allMinimizers.begin(), allMinimizers.end());\n\n std::vector<int> codedSequence1;\n codedSequence1.reserve(first_minimizer->size());\n\n for (size_t i = 0; i < first_minimizer->size(); ++i)\n {\n const auto lower = std::lower_bound(allMinimizers.begin(), allMinimizers.end(), (*first_minimizer)[i]);\n codedSequence1.emplace_back(std::distance(allMinimizers.begin(), lower));\n }\n\n std::vector<int> codedSequence2;\n codedSequence2.reserve(second_minimizer->size());\n\n for (size_t i = 0; i < second_minimizer->size(); ++i)\n {\n const auto lower = std::lower_bound(allMinimizers.begin(), allMinimizers.end(), (*second_minimizer)[i]);\n codedSequence2.emplace_back(std::distance(allMinimizers.begin(), lower));\n }\n\n allMinimizers.clear();\n std::vector<OLC::Minimizer>().swap(allMinimizers);\n\n const OLC::Overlap overlap = OLC::compare(codedSequence1, codedSequence2);\n const uint32_t overlapFirstEnd = (*first_minimizer)[overlap.getEndFirst()].getPosition() + (*first_minimizer)[overlap.getEndFirst()].size();\n const uint32_t overlapSecondEnd = (*second_minimizer)[overlap.getEndSecond()].getPosition() + (*second_minimizer)[overlap.getEndSecond()].size();\n const uint32_t overlapFirstStart = (*first_minimizer)[overlap.getStartFirst()].getPosition();\n const uint32_t overlapSecondStart = (*second_minimizer)[overlap.getStartSecond()].getPosition();\n const uint32_t overlapLength = overlapFirstEnd - overlapFirstStart + 1;\n int32_t ahang = overlapFirstStart;\n int32_t bhang = nucleotides2.size() - overlapSecondEnd;\n\n if (overlapSecondStart > overlapFirstStart)\n ahang *= -1;\n\n if (nucleotides1.size() > overlapSecondEnd)\n bhang *= -1;\n\n OLC::Result* result = new OLC::Result(first_read_number, second_read_number, overlapLength, ahang, bhang);\n\n if (overlapLength > 0)\n {\n std::lock_guard<std::mutex> result_lock(g_result_mutex);\n g_results.push_back(result);\n }\n\n }\n }\n}\n\nint main(int argc, char** argv)\n{\n std::ios_base::sync_with_stdio(false);\n\n if (argc != 4)\n {\n std::cout << \"Usage: \" << argv[0] << \" <minimum overlap length L> <FASTQ or FASTA file> <output file>\\n\";\n return 1;\n }\n\n \/\/ file with the data\n const std::string file = std::string(argv[2]);\n\n \/\/ output file\n const std::string output = std::string(argv[3]);\n\n \/\/ L is the minimum overlap length\n const uint32_t L = std::stoi(argv[1]);\n\n \/\/ window size\n const uint32_t w = (L + 1) \/ 2;\n\n \/\/ size of the k-mer\n const uint32_t k = (L + 1) \/ 2;\n\n \/\/ read phase\n OLC::InputFileReader reader(file);\n const std::vector<OLC::Sequence*> sequences = reader.readSequences();\n std::vector<std::vector<OLC::Minimizer>*> minimizers;\n\n uint32_t max_sequence_size = 0;\n\n for (size_t i = 0; i < sequences.size(); ++i)\n {\n const auto sequence = sequences[i]->getNucleotides()->getSequence();\n\n if (max_sequence_size < sequence.size())\n max_sequence_size = sequence.size();\n\n \/\/ calculate minimizers - both interior and end minimizers\n if (sequence.size() >= SEQUENCE_THRESHOLD_LENGTH)\n minimizers.push_back(minimize(sequence, w, k));\n else\n minimizers.push_back(nullptr);\n }\n\n \/\/ generate tasks so we can do this in parallel if possible\n std::queue<std::tuple<uint32_t, uint32_t>> tasks;\n\n for (uint32_t i = 0; i < sequences.size(); ++i)\n {\n for (uint32_t j = i + 1; j < sequences.size(); ++j)\n {\n g_sequence_pairs.emplace(i + 1, sequences[i], j + 1, sequences[j]);\n g_minimizer_pairs.emplace(i + 1, minimizers[i], j + 1, minimizers[j]);\n }\n }\n\n \/\/ use concurrent minimizer matching\n uint32_t num_threads = std::thread::hardware_concurrency();\n\n \/\/ scale thread number based on sequence size\n if (10000 <= max_sequence_size && max_sequence_size <= 100000)\n num_threads >>= 1;\n else if (100000 <= max_sequence_size)\n num_threads = 1;\n\n std::vector<std::thread> threads(3);\n\n for (uint8_t i = 0; i < threads.size(); ++i)\n threads[i] = std::thread(worker);\n\n for (uint8_t i = 0; i < threads.size(); ++i)\n threads[i].join();\n\n std::ofstream output_stream(output);\n\n for (size_t i = 0; i < g_results.size(); ++i)\n {\n auto identifiers = g_results[i]->getIdentifiers();\n\n output_stream << \"{OVL\\nadj:N\\nrds:\"<< std::get<0>(identifiers) << \",\" << std::get<1>(identifiers) << \"\\nscr:0\\nahg:\" << g_results[i]->getAhng() << \"\\nbhg:\" << g_results[i]->getBhng() << \"\\n}\\n\";\n }\n\n output_stream.close();\n\n \/\/ cleanup\n for (size_t i = 0; i < minimizers.size(); ++i)\n delete minimizers[i];\n\n for (size_t i = 0; i < sequences.size(); ++i)\n delete sequences[i];\n\n for (size_t i = 0; i < g_results.size(); ++i)\n delete g_results[i];\n\n return 0;\n}\n<|endoftext|>"} {"text":"<commit_before>\/*\n * main.cpp\n *\n * main file for derelict app\n *\n * starts GLUT and runs callbacks\n *\/\n\n#include <iostream>\n#include <GL\/glfw.h>\n\n#include \"Key.h\"\n#include \"Cam.h\"\n#include \"Player.h\"\n#include \"World.h\"\n\n#include \"DisplayFuncs.h\"\n\nWorld w;\n\nvoid Init() {\n\tglClearColor(1, 1, 1, 0);\n\n\tw.Load(\"world\/main.world\");\n}\n\nvoid Display() {\n\tglClear(GL_COLOR_BUFFER_BIT|GL_DEPTH_BUFFER_BIT);\n\n\tw.Draw();\n\n\tglPushMatrix();\n\n\tglTranslatef(0, 0, 5.0);\n\n\tglColor3f(1, 0, 0);\n\n\tPyramid();\n\n\tglTranslatef(0, 0, 5.0);\n\n\tglColor3f(0, 1, 0);\n\n\tCube();\n\n\tglPopMatrix();\n}\n\nvoid Update() {\n\tw.Update();\n}\n\nint main(int argc, char ** argv) {\n\tglfwInit();\n\n\tglfwOpenWindow(800, 600, 0, 0, 0, 0, 16, 0, GLFW_WINDOW);\n\n\tglEnable(GL_DEPTH_TEST);\n\tglDepthFunc(GL_LEQUAL);\n\n\tInit();\n\n\tglfwSetKeyCallback(Key::KeyEvent);\n\tglfwSetWindowSizeCallback(Cam::ResizeCallback);\n\n\tbool running = true;\n\n\twhile(running) {\n\t\tDisplay();\n\n\t\tUpdate();\n\t\tKey::I().Update();\n\n\t\tglfwSwapBuffers();\n\n\t\trunning = !glfwGetKey(GLFW_KEY_ESC) &&\n\t\t glfwGetWindowParam(GLFW_OPENED);\n\t\t\n\t\tglfwSleep(0.01);\n\t}\n\n\tglfwCloseWindow();\n\n\tglfwTerminate();\n}\n<commit_msg>Added glfw mouse callbacks in main<commit_after>\/*\n * main.cpp\n *\n * main file for derelict app\n *\n * starts GLUT and runs callbacks\n *\/\n\n#include <iostream>\n#include <GL\/glfw.h>\n\n#include \"Key.h\"\n#include \"Cam.h\"\n#include \"Player.h\"\n#include \"World.h\"\n#include \"Mouse.h\"\n\n#include \"DisplayFuncs.h\"\n\nWorld w;\n\nvoid Init() {\n\tglClearColor(1, 1, 1, 0);\n\n\tw.Load(\"world\/main.world\");\n}\n\nvoid Display() {\n\tglClear(GL_COLOR_BUFFER_BIT|GL_DEPTH_BUFFER_BIT);\n\n\tw.Draw();\n\n\tglPushMatrix();\n\n\tglTranslatef(0, 0, 5.0);\n\n\tglColor3f(1, 0, 0);\n\n\tPyramid();\n\n\tglTranslatef(0, 0, 5.0);\n\n\tglColor3f(0, 1, 0);\n\n\tCube();\n\n\tglPopMatrix();\n}\n\nvoid Update() {\n\tw.Update();\n}\n\nint main(int argc, char ** argv) {\n\tglfwInit();\n\n\tglfwOpenWindow(800, 600, 0, 0, 0, 0, 16, 0, GLFW_WINDOW);\n\n\tglEnable(GL_DEPTH_TEST);\n\tglDepthFunc(GL_LEQUAL);\n\n\tInit();\n\n\tglfwSetKeyCallback(Key::KeyEvent);\n\tglfwSetWindowSizeCallback(Cam::ResizeCallback);\n\n\tglfwSetMousePosCallback(Mouse::MouseMove);\n\tglfwSetMouseButtonCallback(Mouse::MouseButton);\n\n\tbool running = true;\n\n\twhile(running) {\n\t\tDisplay();\n\n\t\tUpdate();\n\t\tKey::I().Update();\n\n\t\tglfwSwapBuffers();\n\n\t\trunning = !glfwGetKey(GLFW_KEY_ESC) &&\n\t\t glfwGetWindowParam(GLFW_OPENED);\n\t\t\n\t\tglfwSleep(0.01);\n\t}\n\n\tglfwCloseWindow();\n\n\tglfwTerminate();\n}\n<|endoftext|>"} {"text":"<commit_before>#include <iostream>\n#include <vector>\n#include <list>\n#include <stdio.h>\n#include <stdlib.h>\n#include <unistd.h>\n#include <sys\/types.h>\n#include <sys\/wait.h>\n#include <string.h>\n#include <netdb.h>\n#include <pwd.h>\n#include <sys\/socket.h>\n#include <boost\/algorithm\/string.hpp>\n\nusing namespace std;\nusing namespace boost::algorithm;\n\n\/\/Virtual Base Class\nclass Base {\n public:\n Base(){};\n \/\/Function Inherited by each class\n virtual bool evaluate() = 0;\n};\n\n\/\/ Command Class that each command will inherit from\nclass Command: public Base {\n private:\n \n \/\/Vector of commands\n vector<string> commandVec;\n\n public:\n \n \/\/Contructor to take in vector and set it to commands vectors\n Command(vector<string>s){\n commandVec = s;\n }\n bool evaluate(){\n \n \/\/exit if cmd is \"exit\"\n if(commandVec[0] == \"exit\")\n exit(0);\n \n \/\/this chunk is to format the vector in the way we want it\n vector<char *> temp2;\n for(unsigned int i = 0; i < commandVec.size(); i++) {\n temp2.push_back(const_cast<char *>(commandVec.at(i).c_str()));\n }\n temp2.push_back('\\0'); \/\/'\\0 is to make sure there is a null char in c-str'\n char** arr = &temp2[0];\n\n\n \/\/here we will use fork() so we can do multiple process at once\n int status;\n pid_t pid = fork();\n if (pid < 0) { \/\/to chck if fork failed\n perror(\"FORK has FAILED\");\n exit(1);\n }\n else if (pid == 0) {\n \/\/if it reaches here, you can pass into execvp\n \/\/execvp will do all the work for you\n execvp(const_cast<char *>(arr[0]), arr);\n \/\/if it reaches here there is some error\n exit(127); \/\/ exit 127 \"command not found\"\n }\n else if(pid > 0){\n \/\/have to wait until child finishes\n \/\/ use wait pid or wait ???? waitpid(pid, &status, 0);\n wait(&status);\n if(wait(&status) != -1){\n perror(\"ERROR: wait\");\n }\n if(WIFEXITED(status)){\n if(WEXITSTATUS(status) == 0) {\n \n \/\/program is succesful\n return true;\n }\n else {\n \n \/\/this return is false, then the program failed but exiting was normal\n return false;\n }\n }\n else{\n \n \/\/the program messed up and exited abnormally\n perror(\"EXIT: ABNORMAL CHILD\");\n return false;\n }\n }\n return false; \n } \n};\n\nclass Connectors : public Base {\n private:\n Connectors(){};\n \n protected:\n bool leftCommand; \/\/command b4 the connector\n Base* rightCommand; \/\/command @ft3r the connect0r\n};\n\n\n\n\/\/will run the rightCommand if the LeftCommand fails\nclass Or : public Connectors{\n public:\n Or(bool l, Base* r){\n leftCommand = l; rightCommand = r;\n }\n bool evaluate(){\n if(!leftCommand)\n return rightCommand->evaluate();\n return false;\n }\n};\n\n\/\/will always attempt to run rightCommand\nclass Semicolon : public Connectors{\n public:\n Semicolon(bool l, Base* r){\n leftCommand = l; rightCommand = r;\n }\n bool evaluate{\n return rightCommand->evaluate();\n }\n};\n\nclass Or : public Connectors {\n public:\n Or(bool first, Base* right) {leftCommand = first; rightCommand = right}\n bool evaluate() {\n if (!leftCommand) {\n return rightCommand->evaluate();\n }\n else {\n return false;\n }\n }\n};\n\nvector<string> parser(string toSplit, const char* delimiters) {\n char* toTokenize = new char[toSplit.size() + 1];\n strcpy(toTokenize, toSplit.c_str());\n toTokenize[toSplit.size() + 1] = '\\0';\n char* cutThis;\n \/\/begin parsing\n cutThis = strtok(toTokenize, delimiters);\n vector<string> returnThis;\n while (cutThis != NULL) {\n string currWord(cutThis);\n trim(currWord);\n returnThis.push_back(currWord);\n cutThis = strtok(NULL, delimiters);\n }\n return returnThis;\n}\n\nint main () {\n \n \/\/take user input\n string initialCommand = \"\";\n \n while (true) { \/\/infinite loop is there until exit is found\n \/\/this is the extra credit part\n string login = getlogin();\n char hostname[100];\n gethostname(hostname, 100);\n cout << \"[\" << login << \"@\" << hostname << \"] $ \";\n \n getline(cin, initialCommand);\n trim(initialCommand);\n bool noCMD = false;\n if(initialCommand == \"\"){\n noCMD = true;\n }\n while(noCMD == false){\n \/\/FIXME:: NEED TO ADD STUFF HERE\n \n noCMD = true; \/\/this means done with this command and wants next one\n }\n \n \n }\n \n return 0;\n}\n<commit_msg>Added && connector because it got deleted -my bad<commit_after>#include <iostream>\n#include <vector>\n#include <list>\n#include <stdio.h>\n#include <stdlib.h>\n#include <unistd.h>\n#include <sys\/types.h>\n#include <sys\/wait.h>\n#include <string.h>\n#include <netdb.h>\n#include <pwd.h>\n#include <sys\/socket.h>\n#include <boost\/algorithm\/string.hpp>\n\nusing namespace std;\nusing namespace boost::algorithm;\n\n\/\/Virtual Base Class\nclass Base {\n public:\n Base(){};\n \/\/Function Inherited by each class\n virtual bool evaluate() = 0;\n};\n\n\/\/ Command Class that each command will inherit from\nclass Command: public Base {\n private:\n \n \/\/Vector of commands\n vector<string> commandVec;\n\n public:\n \n \/\/Contructor to take in vector and set it to commands vectors\n Command(vector<string>s){\n commandVec = s;\n }\n bool evaluate(){\n \n \/\/exit if cmd is \"exit\"\n if(commandVec[0] == \"exit\")\n exit(0);\n \n \/\/this chunk is to format the vector in the way we want it\n vector<char *> temp2;\n for(unsigned int i = 0; i < commandVec.size(); i++) {\n temp2.push_back(const_cast<char *>(commandVec.at(i).c_str()));\n }\n temp2.push_back('\\0'); \/\/'\\0 is to make sure there is a null char in c-str'\n char** arr = &temp2[0];\n\n\n \/\/here we will use fork() so we can do multiple process at once\n int status;\n pid_t pid = fork();\n if (pid < 0) { \/\/to chck if fork failed\n perror(\"FORK has FAILED\");\n exit(1);\n }\n else if (pid == 0) {\n \/\/if it reaches here, you can pass into execvp\n \/\/execvp will do all the work for you\n execvp(const_cast<char *>(arr[0]), arr);\n \/\/if it reaches here there is some error\n exit(127); \/\/ exit 127 \"command not found\"\n }\n else if(pid > 0){\n \/\/have to wait until child finishes\n \/\/ use wait pid or wait ???? waitpid(pid, &status, 0);\n wait(&status);\n if(wait(&status) != -1){\n perror(\"ERROR: wait\");\n }\n if(WIFEXITED(status)){\n if(WEXITSTATUS(status) == 0) {\n \n \/\/program is succesful\n return true;\n }\n else {\n \n \/\/this return is false, then the program failed but exiting was normal\n return false;\n }\n }\n else{\n \n \/\/the program messed up and exited abnormally\n perror(\"EXIT: ABNORMAL CHILD\");\n return false;\n }\n }\n return false; \n } \n};\n\nclass Connectors : public Base {\n private:\n Connectors(){};\n \n protected:\n bool leftCommand; \/\/command b4 the connector\n Base* rightCommand; \/\/command @ft3r the connect0r\n};\n\n\/\/will run the rightcommand if leftcommand succededs\nclass And : public Connectors{\n public:\n Or(bool l, Base* r){\n leftCommand = l; rightCommand = r;\n }\n bool evaluate(){\n if(leftCommand)\n return rightCommand->evaluate();\n return false;\n }\n};\n\n\/\/will run the rightCommand if the LeftCommand fails\nclass Or : public Connectors{\n public:\n Or(bool l, Base* r){\n leftCommand = l; rightCommand = r;\n }\n bool evaluate(){\n if(!leftCommand)\n return rightCommand->evaluate();\n return false;\n }\n};\n\n\/\/will always attempt to run rightCommand\nclass Semicolon : public Connectors{\n public:\n Semicolon(bool l, Base* r){\n leftCommand = l; rightCommand = r;\n }\n bool evaluate{\n return rightCommand->evaluate();\n }\n};\n\nclass Or : public Connectors {\n public:\n Or(bool first, Base* right) {leftCommand = first; rightCommand = right}\n bool evaluate() {\n if (!leftCommand) {\n return rightCommand->evaluate();\n }\n else {\n return false;\n }\n }\n};\n\nvector<string> parser(string toSplit, const char* delimiters) {\n char* toTokenize = new char[toSplit.size() + 1];\n strcpy(toTokenize, toSplit.c_str());\n toTokenize[toSplit.size() + 1] = '\\0';\n char* cutThis;\n \/\/begin parsing\n cutThis = strtok(toTokenize, delimiters);\n vector<string> returnThis;\n while (cutThis != NULL) {\n string currWord(cutThis);\n trim(currWord);\n returnThis.push_back(currWord);\n cutThis = strtok(NULL, delimiters);\n }\n return returnThis;\n}\n\nint main () {\n \n \/\/take user input\n string initialCommand = \"\";\n \n while (true) { \/\/infinite loop is there until exit is found\n \/\/this is the extra credit part\n string login = getlogin();\n char hostname[100];\n gethostname(hostname, 100);\n cout << \"[\" << login << \"@\" << hostname << \"] $ \";\n \n getline(cin, initialCommand);\n trim(initialCommand);\n bool noCMD = false;\n if(initialCommand == \"\"){\n noCMD = true;\n }\n while(noCMD == false){\n \/\/FIXME:: NEED TO ADD STUFF HERE\n \n noCMD = true; \/\/this means done with this command and wants next one\n }\n \n \n }\n \n return 0;\n}\n<|endoftext|>"} {"text":"<commit_before>#include \"make_ref.h\"\n#include \"InfoVisitor.h\"\n#include \"board_def.h\"\n#include \"Board.h\"\n#include \"NPC.h\"\n#include \"GhostFactory.h\"\n#include \"FPSManipulator.h\"\n\n#include <iostream>\n#include <thread>\n\n#include <osg\/ShapeDrawable>\n#include <osg\/Geode>\n#include <osgViewer\/Viewer>\n#include <osg\/MatrixTransform>\n#include <osg\/Fog>\n#include <osgUtil\/Optimizer>\n#include <osgDB\/ReadFile>\n#include <osgDB\/FileUtils>\n#include <osgDB\/FileNameUtils>\n#include <osgGA\/KeySwitchMatrixManipulator>\n#include <osgGA\/OrbitManipulator>\n#include <osg\/Texture2D>\n\nbool loadShaderSource(osg::Shader* obj, const std::string& fileName )\n{\n std::string fqFileName = osgDB::findDataFile(fileName);\n if( fqFileName.length() == 0 )\n {\n std::cout << \"File \\\"\" << fileName << \"\\\" not found.\" << std::endl;\n return false;\n }\n bool success = obj->loadShaderSourceFromFile( fqFileName.c_str());\n if ( !success )\n {\n std::cout << \"Couldn't load file: \" << fileName << std::endl;\n return false;\n }\n else\n {\n return true;\n }\n}\n\n\nint main(int argc, char** argv)\n{\n osg::ArgumentParser arguments( &argc, argv );\n\n std::string dbPath;\n arguments.read(\"--db_path\", dbPath);\n\n std::srand ( unsigned ( std::time(0) ) );\n\n auto board = Board(boardDefinition, boardSizeX, boardSizeY, dbPath);\n auto ghostFactory = GhostFactory();\n\n auto main_obj = make_ref<osg::Group>();\n main_obj->addChild(board.draw().get());\n\n auto ghostModel = osgDB::readNodeFile(dbPath + \"\/cow.osg\");\n auto ghostCount = 16;\n while(ghostCount--)\n {\n main_obj->addChild(ghostFactory.drawGhost(board, ghostModel).get());\n }\n\n \/\/ init rotate\n auto init_rotate = make_ref<osg::MatrixTransform>();\n init_rotate->setMatrix( osg::Matrix::rotate(osg::PI * 2, osg::Vec3(1.0f, 0.0f, 0.0f)) );\n\n \/\/ chain rotates\n init_rotate->addChild(main_obj);\n\n \/\/ Root group\n auto root = make_ref<osg::Group>();\n root->addChild(init_rotate);\n\n \/\/ Setup fog\n if(FogEnabled) {\n osg::ref_ptr<osg::Fog> fog = new osg::Fog;\n fog->setMode( osg::Fog::EXP2 );\n fog->setStart( 0.0f );\n fog->setEnd(board.getFieldSizeX() * 20);\n fog->setDensity(0.02);\n fog->setColor( osg::Vec4(0., 0., 0., 1.0) );\n\n root->getOrCreateStateSet()->setAttributeAndModes(fog.get());\n }\n\n \/\/ Start viewer\n osgViewer::Viewer viewer;\n\n double height = std::min(board.getFieldSizeX(), board.getFieldSizeY()) \/ 1.5;\n\n auto fpsManipulator = make_ref<FPSManipulator>(board, viewer);\n fpsManipulator->setHomePosition(\n osg::Vec3d(board.getFieldCenterX(1), board.getFieldCenterY(10), height),\n osg::Vec3d(0.0f, 0.0f, height),\n osg::Vec3d(0.0f, 0.0f, 1.0f)\n );\n\n\n auto keySwitch = make_ref<osgGA::KeySwitchMatrixManipulator>();\n keySwitch->addNumberedMatrixManipulator(make_ref<osgGA::OrbitManipulator>());\n keySwitch->addNumberedMatrixManipulator(fpsManipulator);\n viewer.setCameraManipulator(keySwitch);\n\n viewer.home();\n viewer.setSceneData( root );\n\n osgViewer::Viewer::Windows windows;\n viewer.getWindows(windows);\n viewer.getCamera()->setClearColor(osg::Vec4{0, 0, 0, 0});\n\n viewer.getCamera()->getView()->setLightingMode(osg::View::HEADLIGHT);\n auto defaultLight = viewer.getCamera()->getView()->getLight();\n defaultLight->setDiffuse(osg::Vec4(0, 0, 0, 1));\n defaultLight->setAmbient(osg::Vec4(0, 0, 0, 1));\n defaultLight->setSpecular(osg::Vec4(0, 0, 0, 1));\n\n auto lightSource = make_ref<osg::LightSource>();\n lightSource->setReferenceFrame(osg::LightSource::ABSOLUTE_RF);\n auto light = lightSource->getLight();\n const osg::Vec3 lightPosition{1.5, -.5, -1}; \/\/ right, down, front\n light->setPosition(osg::Vec4{lightPosition, 1});\n light->setDirection(osg::Vec3{0, 0, -1} * 30 - lightPosition);\n light->setSpotExponent(200);\n light->setSpotCutoff(100);\n light->setDiffuse(osg::Vec4(1, 1, 1, 1));\n light->setAmbient(osg::Vec4(0.6, 0.6, 0.6, 1));\n light->setSpecular(osg::Vec4(1, 1, 1, 1));\n light->setLinearAttenuation(0.005);\n light->setConstantAttenuation(0);\n\n root->addChild(lightSource);\n\n\n \/\/ Shaders\n auto program = make_ref<osg::Program>();\n auto fragmentObject = make_ref<osg::Shader>(osg::Shader::FRAGMENT);\n loadShaderSource(fragmentObject, dbPath + \"\/shader.frag\");\n auto vertexObject = make_ref<osg::Shader>(osg::Shader::VERTEX);\n loadShaderSource(vertexObject, dbPath + \"\/shader.vert\");\n program->addShader(vertexObject);\n program->addShader(fragmentObject);\n root->getOrCreateStateSet()->setAttributeAndModes(program, osg::StateAttribute::ON);\n\n root->getOrCreateStateSet()->addUniform(new osg::Uniform(\"samplerName\", TEXTURE_UNIT));\n root->getOrCreateStateSet()->addUniform(new osg::Uniform(\"Shininess\", BoardObjectsShininess));\n root->getOrCreateStateSet()->addUniform(new osg::Uniform(\"FogEnabled\", FogEnabled));\n\n \/\/ Optimize\n osgUtil::Optimizer optimzer;\n optimzer.optimize(root);\n\n return viewer.run();\n}\n<commit_msg>Tweak fog density and light attenuation.<commit_after>#include \"make_ref.h\"\n#include \"InfoVisitor.h\"\n#include \"board_def.h\"\n#include \"Board.h\"\n#include \"NPC.h\"\n#include \"GhostFactory.h\"\n#include \"FPSManipulator.h\"\n\n#include <iostream>\n#include <thread>\n\n#include <osg\/ShapeDrawable>\n#include <osg\/Geode>\n#include <osgViewer\/Viewer>\n#include <osg\/MatrixTransform>\n#include <osg\/Fog>\n#include <osgUtil\/Optimizer>\n#include <osgDB\/ReadFile>\n#include <osgDB\/FileUtils>\n#include <osgDB\/FileNameUtils>\n#include <osgGA\/KeySwitchMatrixManipulator>\n#include <osgGA\/OrbitManipulator>\n#include <osg\/Texture2D>\n\nbool loadShaderSource(osg::Shader* obj, const std::string& fileName )\n{\n std::string fqFileName = osgDB::findDataFile(fileName);\n if( fqFileName.length() == 0 )\n {\n std::cout << \"File \\\"\" << fileName << \"\\\" not found.\" << std::endl;\n return false;\n }\n bool success = obj->loadShaderSourceFromFile( fqFileName.c_str());\n if ( !success )\n {\n std::cout << \"Couldn't load file: \" << fileName << std::endl;\n return false;\n }\n else\n {\n return true;\n }\n}\n\n\nint main(int argc, char** argv)\n{\n osg::ArgumentParser arguments( &argc, argv );\n\n std::string dbPath;\n arguments.read(\"--db_path\", dbPath);\n\n std::srand ( unsigned ( std::time(0) ) );\n\n auto board = Board(boardDefinition, boardSizeX, boardSizeY, dbPath);\n auto ghostFactory = GhostFactory();\n\n auto main_obj = make_ref<osg::Group>();\n main_obj->addChild(board.draw().get());\n\n auto ghostModel = osgDB::readNodeFile(dbPath + \"\/cow.osg\");\n auto ghostCount = 16;\n while(ghostCount--)\n {\n main_obj->addChild(ghostFactory.drawGhost(board, ghostModel).get());\n }\n\n \/\/ init rotate\n auto init_rotate = make_ref<osg::MatrixTransform>();\n init_rotate->setMatrix( osg::Matrix::rotate(osg::PI * 2, osg::Vec3(1.0f, 0.0f, 0.0f)) );\n\n \/\/ chain rotates\n init_rotate->addChild(main_obj);\n\n \/\/ Root group\n auto root = make_ref<osg::Group>();\n root->addChild(init_rotate);\n\n \/\/ Setup fog\n if(FogEnabled) {\n osg::ref_ptr<osg::Fog> fog = new osg::Fog;\n fog->setMode( osg::Fog::EXP2 );\n fog->setStart( 0.0f );\n fog->setEnd(board.getFieldSizeX() * 20);\n fog->setDensity(0.015);\n fog->setColor( osg::Vec4(0., 0., 0., 1.0) );\n\n root->getOrCreateStateSet()->setAttributeAndModes(fog.get());\n }\n\n \/\/ Start viewer\n osgViewer::Viewer viewer;\n\n double height = std::min(board.getFieldSizeX(), board.getFieldSizeY()) \/ 1.5;\n\n auto fpsManipulator = make_ref<FPSManipulator>(board, viewer);\n fpsManipulator->setHomePosition(\n osg::Vec3d(board.getFieldCenterX(1), board.getFieldCenterY(10), height),\n osg::Vec3d(0.0f, 0.0f, height),\n osg::Vec3d(0.0f, 0.0f, 1.0f)\n );\n\n\n auto keySwitch = make_ref<osgGA::KeySwitchMatrixManipulator>();\n keySwitch->addNumberedMatrixManipulator(make_ref<osgGA::OrbitManipulator>());\n keySwitch->addNumberedMatrixManipulator(fpsManipulator);\n viewer.setCameraManipulator(keySwitch);\n\n viewer.home();\n viewer.setSceneData( root );\n\n osgViewer::Viewer::Windows windows;\n viewer.getWindows(windows);\n viewer.getCamera()->setClearColor(osg::Vec4{0, 0, 0, 0});\n\n viewer.getCamera()->getView()->setLightingMode(osg::View::HEADLIGHT);\n auto defaultLight = viewer.getCamera()->getView()->getLight();\n defaultLight->setDiffuse(osg::Vec4(0, 0, 0, 1));\n defaultLight->setAmbient(osg::Vec4(0, 0, 0, 1));\n defaultLight->setSpecular(osg::Vec4(0, 0, 0, 1));\n\n auto lightSource = make_ref<osg::LightSource>();\n lightSource->setReferenceFrame(osg::LightSource::ABSOLUTE_RF);\n auto light = lightSource->getLight();\n const osg::Vec3 lightPosition{1.5, -1, -1}; \/\/ right, down, front\n light->setPosition(osg::Vec4{lightPosition, 1});\n light->setDirection(osg::Vec3{0, 0, -1} * 30 - lightPosition);\n light->setSpotExponent(200);\n light->setSpotCutoff(100);\n light->setDiffuse(osg::Vec4(1, 1, 1, 1));\n light->setAmbient(osg::Vec4(0.6, 0.6, 0.6, 1));\n light->setSpecular(osg::Vec4(1, 1, 1, 1));\n light->setLinearAttenuation(0.001);\n light->setConstantAttenuation(0.5);\n\n root->addChild(lightSource);\n\n\n \/\/ Shaders\n auto program = make_ref<osg::Program>();\n auto fragmentObject = make_ref<osg::Shader>(osg::Shader::FRAGMENT);\n loadShaderSource(fragmentObject, dbPath + \"\/shader.frag\");\n auto vertexObject = make_ref<osg::Shader>(osg::Shader::VERTEX);\n loadShaderSource(vertexObject, dbPath + \"\/shader.vert\");\n program->addShader(vertexObject);\n program->addShader(fragmentObject);\n root->getOrCreateStateSet()->setAttributeAndModes(program, osg::StateAttribute::ON);\n\n root->getOrCreateStateSet()->addUniform(new osg::Uniform(\"samplerName\", TEXTURE_UNIT));\n root->getOrCreateStateSet()->addUniform(new osg::Uniform(\"Shininess\", BoardObjectsShininess));\n root->getOrCreateStateSet()->addUniform(new osg::Uniform(\"FogEnabled\", FogEnabled));\n\n \/\/ Optimize\n osgUtil::Optimizer optimzer;\n optimzer.optimize(root);\n\n return viewer.run();\n}\n<|endoftext|>"} {"text":"<commit_before>\/*\n * TODO list\n * - Line wrapping on current input buffer\n * - Response lines for each line of input after CR\n * - Better \/ alternative build method instead of eclipse maintained makefiles\n * - Movable input cursor \/ implement delete key\n * - Open \/ close console with some key\n *\/\n\n#include <console\/Console.h>\n#include <drawing\/DisplayBox.h>\n#include <drawing\/DrawingContext.h>\n#include <drawing\/TextBox.h>\n#include <gl\/glut.h>\n#include <GL\/gl.h>\n#include <sstream>\n#include <string>\n\n#define WINDOW_WIDTH 1024\n#define WINDOW_HEIGHT 760\n\n#define WORLD_MOVE_STEP_SIZE 3\n\nvoid handleMouseMove(int x, int y);\n\nDrawingContext context;\nConsole console(&context);\nTextBox coordinates(&context);\n\nvoid handleDisplay() {\n \/\/ Clear the window\n glClearColor(0.0, 0.0, 0.0, 0.0);\n glClear(GL_COLOR_BUFFER_BIT);\n\n console.draw();\n coordinates.draw();\n\n \/\/ Swap buffers (color buffers, makes previous render visible)\n glutSwapBuffers();\n}\n\nvoid handleKeyboard(unsigned char key, int x, int y) {\n#pragma unused (x, y)\n\n if(key == '`' || key == '~') {\n static bool motionCallbackSet = false;\n if(motionCallbackSet) {\n motionCallbackSet = false;\n glutPassiveMotionFunc(NULL);\n }\n else {\n motionCallbackSet = true;\n glutPassiveMotionFunc(handleMouseMove);\n }\n }\n else if(console.handleKey(key)) {\n glutPostRedisplay();\n }\n}\n\nvoid handleSpecialKeyboard(int key, int x, int y) {\n#pragma unused (x, y)\n\n int modifiers = glutGetModifiers();\n if(modifiers & GLUT_ACTIVE_SHIFT) {\n switch(key) {\n case GLUT_KEY_UP:\n console.moveY(WORLD_MOVE_STEP_SIZE);\n break;\n\n case GLUT_KEY_DOWN:\n console.moveY(-WORLD_MOVE_STEP_SIZE);\n break;\n\n case GLUT_KEY_LEFT:\n console.moveX(-WORLD_MOVE_STEP_SIZE);\n break;\n\n case GLUT_KEY_RIGHT:\n console.moveX(WORLD_MOVE_STEP_SIZE);\n break;\n\n default:\n return;\n }\n\n glutPostRedisplay();\n }\n}\n\nvoid handleMouse(int button, int state, int x, int y) {\n handleMouseMove(x, y);\n}\n\nvoid handleMouseMove(int x, int y) {\n std::ostringstream msg;\n msg << \"X:\" << x << \", Y:\" << y;\n\n coordinates.setText(msg.str());\n glutPostRedisplay();\n}\n\n\/* Note that this results with an origin in the center of the screen. Not sure that\n * I'm too wild about this so that might change in the future.\n *\/\nvoid handleReshape(int width, int height) {\n GLdouble size;\n GLdouble aspect;\n\n \/* Use the whole window. *\/\n glViewport(0, 0, width, height);\n\n \/* We are going to do some 2-D orthographic drawing. *\/\n glMatrixMode(GL_PROJECTION);\n glLoadIdentity();\n size = (GLdouble) ((width >= height) ? width : height) \/ 2.0;\n if (width <= height) {\n aspect = (GLdouble) height \/ (GLdouble) width;\n glOrtho(-size, size, -size * aspect, size * aspect, -100000.0, 100000.0);\n } else {\n aspect = (GLdouble) width \/ (GLdouble) height;\n glOrtho(-size * aspect, size * aspect, -size, size, -100000.0, 100000.0);\n }\n\n \/* Make the world and window coordinates coincide so that 1.0 in *\/\n \/* model space equals one pixel in window space. *\/\n glScaled(aspect, aspect, 1.0);\n\n \/* Now determine where to draw things. *\/\n glMatrixMode(GL_MODELVIEW);\n glLoadIdentity();\n\n coordinates.setLocation(-width \/ 2.0 + 2, height \/ 2.0 - 2);\n}\n\nint main(int argc, char** argv) {\n glutInit(&argc, argv);\n glutInitWindowSize(WINDOW_WIDTH, WINDOW_HEIGHT);\n glutInitDisplayMode(GLUT_RGB | GLUT_DOUBLE);\n glutCreateWindow(\"OGL Console Sandbox\");\n\n console.setLocation(-240, 120);\n console.setSize(480, 240);\n\n coordinates.setLocation(0, 0);\n coordinates.setSize(150, 30);\n\n glutDisplayFunc(handleDisplay);\n glutKeyboardFunc(handleKeyboard);\n glutSpecialFunc(handleSpecialKeyboard);\n glutReshapeFunc(handleReshape);\n glutMouseFunc(handleMouse);\n\n glutMainLoop();\n}\n<commit_msg>Update todo list<commit_after>\/*\n * TODO list\n * - Line wrapping on current input buffer\n * - Response lines for each line of input after CR\n * - Better \/ alternative build method instead of eclipse maintained makefiles?\n * - Movable input cursor \/ implement delete key\n * - Add toggle button for console\n * - Up arrow should cycle the previous buffer lines into the current line\n * - Auto-complete on commands for tab key?\n * - Implement concept of focus via mouse location in order to route to appropriate key handlers\n * - Add FPS to coordinates box\n * - Add window dimensions to coordinates box\n * - Add toggle button for coordinates box\n * - Build scene graph object to better manage visual objects\n *\/\n\n#include <console\/Console.h>\n#include <drawing\/DisplayBox.h>\n#include <drawing\/DrawingContext.h>\n#include <drawing\/TextBox.h>\n#include <gl\/glut.h>\n#include <GL\/gl.h>\n#include <sstream>\n#include <string>\n\n#define WINDOW_WIDTH 1024\n#define WINDOW_HEIGHT 760\n\n#define WORLD_MOVE_STEP_SIZE 3\n\nvoid handleMouseMove(int x, int y);\n\nDrawingContext context;\nConsole console(&context);\nTextBox coordinates(&context);\n\nvoid handleDisplay() {\n \/\/ Clear the window\n glClearColor(0.0, 0.0, 0.0, 0.0);\n glClear(GL_COLOR_BUFFER_BIT);\n\n console.draw();\n coordinates.draw();\n\n \/\/ Swap buffers (color buffers, makes previous render visible)\n glutSwapBuffers();\n}\n\nvoid handleKeyboard(unsigned char key, int x, int y) {\n#pragma unused (x, y)\n\n if(key == '`' || key == '~') {\n static bool motionCallbackSet = false;\n if(motionCallbackSet) {\n motionCallbackSet = false;\n glutPassiveMotionFunc(NULL);\n }\n else {\n motionCallbackSet = true;\n glutPassiveMotionFunc(handleMouseMove);\n }\n }\n else if(console.handleKey(key)) {\n glutPostRedisplay();\n }\n}\n\nvoid handleSpecialKeyboard(int key, int x, int y) {\n#pragma unused (x, y)\n\n int modifiers = glutGetModifiers();\n if(modifiers & GLUT_ACTIVE_SHIFT) {\n switch(key) {\n case GLUT_KEY_UP:\n console.moveY(WORLD_MOVE_STEP_SIZE);\n break;\n\n case GLUT_KEY_DOWN:\n console.moveY(-WORLD_MOVE_STEP_SIZE);\n break;\n\n case GLUT_KEY_LEFT:\n console.moveX(-WORLD_MOVE_STEP_SIZE);\n break;\n\n case GLUT_KEY_RIGHT:\n console.moveX(WORLD_MOVE_STEP_SIZE);\n break;\n\n default:\n return;\n }\n\n glutPostRedisplay();\n }\n}\n\nvoid handleMouse(int button, int state, int x, int y) {\n handleMouseMove(x, y);\n}\n\nvoid handleMouseMove(int x, int y) {\n std::ostringstream msg;\n msg << \"X:\" << x << \", Y:\" << y;\n\n coordinates.setText(msg.str());\n glutPostRedisplay();\n}\n\n\/* Note that this results with an origin in the center of the screen. Not sure that\n * I'm too wild about this so that might change in the future.\n *\/\nvoid handleReshape(int width, int height) {\n GLdouble size;\n GLdouble aspect;\n\n \/* Use the whole window. *\/\n glViewport(0, 0, width, height);\n\n \/* We are going to do some 2-D orthographic drawing. *\/\n glMatrixMode(GL_PROJECTION);\n glLoadIdentity();\n size = (GLdouble) ((width >= height) ? width : height) \/ 2.0;\n if (width <= height) {\n aspect = (GLdouble) height \/ (GLdouble) width;\n glOrtho(-size, size, -size * aspect, size * aspect, -100000.0, 100000.0);\n } else {\n aspect = (GLdouble) width \/ (GLdouble) height;\n glOrtho(-size * aspect, size * aspect, -size, size, -100000.0, 100000.0);\n }\n\n \/* Make the world and window coordinates coincide so that 1.0 in *\/\n \/* model space equals one pixel in window space. *\/\n glScaled(aspect, aspect, 1.0);\n\n \/* Now determine where to draw things. *\/\n glMatrixMode(GL_MODELVIEW);\n glLoadIdentity();\n\n coordinates.setLocation(-width \/ 2.0 + 2, height \/ 2.0 - 2);\n}\n\nint main(int argc, char** argv) {\n glutInit(&argc, argv);\n glutInitWindowSize(WINDOW_WIDTH, WINDOW_HEIGHT);\n glutInitDisplayMode(GLUT_RGB | GLUT_DOUBLE);\n glutCreateWindow(\"OGL Console Sandbox\");\n\n console.setLocation(-240, 120);\n console.setSize(480, 240);\n\n coordinates.setLocation(0, 0);\n coordinates.setSize(150, 30);\n\n glutDisplayFunc(handleDisplay);\n glutKeyboardFunc(handleKeyboard);\n glutSpecialFunc(handleSpecialKeyboard);\n glutReshapeFunc(handleReshape);\n glutMouseFunc(handleMouse);\n\n glutMainLoop();\n}\n<|endoftext|>"} {"text":"<commit_before>#include <stdio.h>\n#include <fcntl.h>\n#include <stdlib.h>\n#include <string.h>\n#include <math.h>\n#include <assert.h>\n#include <unistd.h>\n#include <fstream>\n#include <iostream>\n#include <time.h>\n#include <unistd.h>\n#include <sys\/shm.h>\n\n#include \"bcm_host.h\"\n\n#include \"GLES2\/gl2.h\"\n#include \"EGL\/egl.h\"\n#include \"EGL\/eglext.h\"\n\n#include \"shader.h\"\n\n#include \"inotify-cxx.h\"\n\ntypedef struct {\n uint32_t screen_width;\n uint32_t screen_height;\n\n int mouse_x;\n int mouse_y;\n\n \/\/ OpenGL|ES objects\n EGLDisplay display;\n EGLSurface surface;\n EGLContext context;\n\n GLuint buf;\n\n} CUBE_STATE_T;\nstatic CUBE_STATE_T _state, *state=&_state;\n\nbool* fragHasChanged;\nstd::string fragFile;\nstd::string vertSource =\n\"attribute vec4 a_position;\"\n\"varying vec2 v_texcoord;\"\n\"void main(void) {\"\n\" gl_Position = a_position;\"\n\" v_texcoord = a_position.xy*0.5+0.5;\"\n\"}\";\n\nShader shader;\n\nstatic void init_ogl(CUBE_STATE_T *state){\n int32_t success = 0;\n EGLBoolean result;\n EGLint num_config;\n \n static EGL_DISPMANX_WINDOW_T nativewindow;\n \n DISPMANX_ELEMENT_HANDLE_T dispman_element;\n DISPMANX_DISPLAY_HANDLE_T dispman_display;\n DISPMANX_UPDATE_HANDLE_T dispman_update;\n VC_RECT_T dst_rect;\n VC_RECT_T src_rect;\n \n static const EGLint attribute_list[] = {\n EGL_RED_SIZE, 8,\n EGL_GREEN_SIZE, 8,\n EGL_BLUE_SIZE, 8,\n EGL_ALPHA_SIZE, 8,\n EGL_SURFACE_TYPE, EGL_WINDOW_BIT,\n EGL_NONE\n };\n \n static const EGLint context_attributes[] = {\n EGL_CONTEXT_CLIENT_VERSION, 2,\n EGL_NONE\n };\n EGLConfig config;\n \n \/\/ get an EGL display connection\n state->display = eglGetDisplay(EGL_DEFAULT_DISPLAY);\n assert(state->display!=EGL_NO_DISPLAY);\n \n \n \/\/ initialize the EGL display connection\n result = eglInitialize(state->display, NULL, NULL);\n assert(EGL_FALSE != result);\n \n \n \/\/ get an appropriate EGL frame buffer configuration\n result = eglChooseConfig(state->display, attribute_list, &config, 1, &num_config);\n assert(EGL_FALSE != result);\n \n \n \/\/ get an appropriate EGL frame buffer configuration\n result = eglBindAPI(EGL_OPENGL_ES_API);\n assert(EGL_FALSE != result);\n \n \n \/\/ create an EGL rendering context\n state->context = eglCreateContext(state->display, config, EGL_NO_CONTEXT, context_attributes);\n assert(state->context!=EGL_NO_CONTEXT);\n \n \n \/\/ create an EGL window surface\n success = graphics_get_display_size(0 \/* LCD *\/, &state->screen_width, &state->screen_height);\n assert( success >= 0 );\n \n dst_rect.x = 0;\n dst_rect.y = 0;\n dst_rect.width = state->screen_width;\n dst_rect.height = state->screen_height;\n \n src_rect.x = 0;\n src_rect.y = 0;\n src_rect.width = state->screen_width << 16;\n src_rect.height = state->screen_height << 16;\n \n dispman_display = vc_dispmanx_display_open( 0 \/* LCD *\/);\n dispman_update = vc_dispmanx_update_start( 0 );\n dispman_element = vc_dispmanx_element_add ( dispman_update, dispman_display,\n 0\/*layer*\/, &dst_rect, 0\/*src*\/,\n &src_rect, DISPMANX_PROTECTION_NONE, 0 \/*alpha*\/, 0\/*clamp*\/, 0\/*transform*\/);\n \n nativewindow.element = dispman_element;\n nativewindow.width = state->screen_width;\n nativewindow.height = state->screen_height;\n vc_dispmanx_update_submit_sync( dispman_update );\n \n \n state->surface = eglCreateWindowSurface( state->display, config, &nativewindow, NULL );\n assert(state->surface != EGL_NO_SURFACE);\n \n \n \/\/ connect the context to the surface\n result = eglMakeCurrent(state->display, state->surface, state->surface, state->context);\n assert(EGL_FALSE != result);\n \n \/\/ Set background color and clear buffers\n glClearColor(0.15f, 0.25f, 0.35f, 1.0f);\n glClear( GL_COLOR_BUFFER_BIT );\n}\n\nstatic bool loadFromPath(const std::string& path, std::string* into) {\n std::ifstream file;\n std::string buffer;\n \n file.open(path.c_str());\n if(!file.is_open()) return false;\n while(!file.eof()) {\n getline(file, buffer);\n (*into) += buffer + \"\\n\";\n }\n \n file.close();\n return true;\n}\n\nstatic void draw(CUBE_STATE_T *state){\n\n if(*fragHasChanged) {\n std::string fragSource;\n if(loadFromPath(fragFile, &fragSource)){\n state->shader.detach(GL_FRAGMENT_SHADER | GL_VERTEX_SHADER);\n state->shader.build(fragSource,vertSource);\n *fragHasChanged = false;\n }\n }\n\n \/\/ Now render to the main frame buffer\n glBindFramebuffer(GL_FRAMEBUFFER,0);\n \/\/ Clear the background (not really necessary I suppose)\n glClear(GL_COLOR_BUFFER_BIT|GL_DEPTH_BUFFER_BIT);\n \n glBindBuffer(GL_ARRAY_BUFFER, state->buf);\n state->shader.use();\n \n state->shader.sendUniform(\"u_time\", ((float)clock())\/CLOCKS_PER_SEC);\n state->shader.sendUniform(\"u_mouse\", state->mouse_x, state_mouse_y);\n state->shader.sendUniform(\"u_resolution\",state->screen_width, state->screen_height);\n \n glDrawArrays(GL_TRIANGLE_FAN, 0, 4);\n \n glBindBuffer(GL_ARRAY_BUFFER, 0);\n \n glFlush();\n glFinish();\n \n eglSwapBuffers(state->display, state->surface); \n}\n\nstatic int get_mouse(CUBE_STATE_T *state){\n static int fd = -1;\n const int width=state->screen_width, height=state->screen_height;\n static int x=width, y=height;\n const int XSIGN = 1<<4, YSIGN = 1<<5;\n if (fd<0) {\n fd = open(\"\/dev\/input\/mouse0\",O_RDONLY|O_NONBLOCK);\n }\n if (fd>=0) {\n struct {char buttons, dx, dy; } m;\n while (1) {\n int bytes = read(fd, &m, sizeof m);\n if (bytes < (int)sizeof m) goto _exit;\n if (m.buttons&8) {\n break; \/\/ This bit should always be set\n }\n read(fd, &m, 1); \/\/ Try to sync up again\n }\n if (m.buttons&3)\n return m.buttons&3;\n x+=m.dx;\n y+=m.dy;\n if (m.buttons&XSIGN)\n x-=256;\n if (m.buttons&YSIGN)\n y-=256;\n if (x<0) x=0;\n if (y<0) y=0;\n if (x>width) x=width;\n if (y>height) y=height;\n }\n\n_exit:\n state->mouse_x = x;\n state->mouse_y = y;\n return 0;\n} \n\nvoid drawThread() {\n setup();\n while (1) {\n if (get_mouse(state)) break;\n draw(state);\n }\n} \n\nvoid watchThread(const std::string& _file) {\n Inotify notify;\n\n InotifyWatch watch(\".\", IN_MODIFY);\/\/IN_ALL_EVENTS);\n notify.Add(watch);\n\n for (;;) {\n\n if(!(*fragHasChanged)){\n notify.WaitForEvents();\n\n size_t count = notify.GetEventCount();\n while(count-- > 0) {\n InotifyEvent event;\n bool got_event = notify.GetEvent(&event);\n\n if(got_event){ \n std::string mask_str;\n event.DumpTypes(mask_str);\n std::string filename = event.GetName();\n std::cout << \"Child: \" << filename << \" have change \" << mask_str << std::endl;\n if (filename == _file){\n *fragHasChanged = true;\n }\n }\n } \n }\n }\n}\n\nvoid setup() {\n bcm_host_init();\n\n \/\/ Clear application state\n memset( state, 0, sizeof( *state ) );\n \n \/\/ Start OGLES\n init_ogl(state);\n\n \/\/ Build shader;\n \/\/\n std::string fragSource;\n if(!loadFromPath(fragFile, &fragSource)) {\n return;\n }\n state->shader.build(fragSource,vertSource);\n\n \/\/ Make Quad\n \/\/\n static const GLfloat vertex_data[] = {\n -1.0,-1.0,1.0,1.0,\n 1.0,-1.0,1.0,1.0,\n 1.0,1.0,1.0,1.0,\n -1.0,1.0,1.0,1.0\n };\n GLint posAttribut = state->shader.getAttribLocation(\"a_position\");\n \n glClearColor ( 0.0, 1.0, 1.0, 1.0 );\n \n glGenBuffers(1, &state->buf);\n \n \/\/ Prepare viewport\n glViewport ( 0, 0, state->screen_width, state->screen_height );\n \n \n \/\/ Upload vertex data to a buffer\n glBindBuffer(GL_ARRAY_BUFFER, state->buf);\n glBufferData(GL_ARRAY_BUFFER, sizeof(vertex_data),\n vertex_data, GL_STATIC_DRAW);\n glVertexAttribPointer(posAttribut, 4, GL_FLOAT, 0, 16, 0);\n glEnableVertexAttribArray(posAttribut);\n \n}\n \n\/\/==============================================================================\n\nint main(int argc, char **argv){\n fragFile = std::string(argv[1]);\n\n int shmId = shmget(IPC_PRIVATE, sizeof(bool), 0666);\n pid_t pid = fork();\n fragHasChanged = (bool *) shmat(shmId, NULL, 0);\n\n switch(pid) {\n case -1: \/\/error\n break;\n\n case 0: \/\/ child\n {\n *fragHasChanged = false;\n watchThread(fragFile);\n }\n break;\n\n default: \n {\n drawThread();\n\n kill(pid, SIGKILL);\n }\n break;\n }\n\n shmctl(shmId, IPC_RMID, NULL);\n return 0;\n}\n\n<commit_msg>reorganizing<commit_after>#include <stdio.h>\n#include <fcntl.h>\n#include <stdlib.h>\n#include <string.h>\n#include <math.h>\n#include <assert.h>\n#include <unistd.h>\n#include <fstream>\n#include <iostream>\n#include <time.h>\n#include <unistd.h>\n#include <sys\/shm.h>\n\n#include \"bcm_host.h\"\n\n#include \"GLES2\/gl2.h\"\n#include \"EGL\/egl.h\"\n#include \"EGL\/eglext.h\"\n\n#include \"shader.h\"\n\n#include \"inotify-cxx.h\"\n\ntypedef struct {\n uint32_t screen_width;\n uint32_t screen_height;\n\n int mouse_x;\n int mouse_y;\n\n \/\/ OpenGL|ES objects\n EGLDisplay display;\n EGLSurface surface;\n EGLContext context;\n\n GLuint buf;\n\n} CUBE_STATE_T;\nstatic CUBE_STATE_T _state, *state=&_state;\n\nbool* fragHasChanged;\nstd::string fragFile;\nstd::string vertSource =\n\"attribute vec4 a_position;\"\n\"varying vec2 v_texcoord;\"\n\"void main(void) {\"\n\" gl_Position = a_position;\"\n\" v_texcoord = a_position.xy*0.5+0.5;\"\n\"}\";\n\nShader shader;\n\nstatic void init_ogl(CUBE_STATE_T *state){\n int32_t success = 0;\n EGLBoolean result;\n EGLint num_config;\n \n static EGL_DISPMANX_WINDOW_T nativewindow;\n \n DISPMANX_ELEMENT_HANDLE_T dispman_element;\n DISPMANX_DISPLAY_HANDLE_T dispman_display;\n DISPMANX_UPDATE_HANDLE_T dispman_update;\n VC_RECT_T dst_rect;\n VC_RECT_T src_rect;\n \n static const EGLint attribute_list[] = {\n EGL_RED_SIZE, 8,\n EGL_GREEN_SIZE, 8,\n EGL_BLUE_SIZE, 8,\n EGL_ALPHA_SIZE, 8,\n EGL_SURFACE_TYPE, EGL_WINDOW_BIT,\n EGL_NONE\n };\n \n static const EGLint context_attributes[] = {\n EGL_CONTEXT_CLIENT_VERSION, 2,\n EGL_NONE\n };\n EGLConfig config;\n \n \/\/ get an EGL display connection\n state->display = eglGetDisplay(EGL_DEFAULT_DISPLAY);\n assert(state->display!=EGL_NO_DISPLAY);\n \n \n \/\/ initialize the EGL display connection\n result = eglInitialize(state->display, NULL, NULL);\n assert(EGL_FALSE != result);\n \n \n \/\/ get an appropriate EGL frame buffer configuration\n result = eglChooseConfig(state->display, attribute_list, &config, 1, &num_config);\n assert(EGL_FALSE != result);\n \n \n \/\/ get an appropriate EGL frame buffer configuration\n result = eglBindAPI(EGL_OPENGL_ES_API);\n assert(EGL_FALSE != result);\n \n \n \/\/ create an EGL rendering context\n state->context = eglCreateContext(state->display, config, EGL_NO_CONTEXT, context_attributes);\n assert(state->context!=EGL_NO_CONTEXT);\n \n \n \/\/ create an EGL window surface\n success = graphics_get_display_size(0 \/* LCD *\/, &state->screen_width, &state->screen_height);\n assert( success >= 0 );\n \n dst_rect.x = 0;\n dst_rect.y = 0;\n dst_rect.width = state->screen_width;\n dst_rect.height = state->screen_height;\n \n src_rect.x = 0;\n src_rect.y = 0;\n src_rect.width = state->screen_width << 16;\n src_rect.height = state->screen_height << 16;\n \n dispman_display = vc_dispmanx_display_open( 0 \/* LCD *\/);\n dispman_update = vc_dispmanx_update_start( 0 );\n dispman_element = vc_dispmanx_element_add ( dispman_update, dispman_display,\n 0\/*layer*\/, &dst_rect, 0\/*src*\/,\n &src_rect, DISPMANX_PROTECTION_NONE, 0 \/*alpha*\/, 0\/*clamp*\/, 0\/*transform*\/);\n \n nativewindow.element = dispman_element;\n nativewindow.width = state->screen_width;\n nativewindow.height = state->screen_height;\n vc_dispmanx_update_submit_sync( dispman_update );\n \n \n state->surface = eglCreateWindowSurface( state->display, config, &nativewindow, NULL );\n assert(state->surface != EGL_NO_SURFACE);\n \n \n \/\/ connect the context to the surface\n result = eglMakeCurrent(state->display, state->surface, state->surface, state->context);\n assert(EGL_FALSE != result);\n \n \/\/ Set background color and clear buffers\n glClearColor(0.15f, 0.25f, 0.35f, 1.0f);\n glClear( GL_COLOR_BUFFER_BIT );\n}\n\nstatic bool loadFromPath(const std::string& path, std::string* into) {\n std::ifstream file;\n std::string buffer;\n \n file.open(path.c_str());\n if(!file.is_open()) return false;\n while(!file.eof()) {\n getline(file, buffer);\n (*into) += buffer + \"\\n\";\n }\n \n file.close();\n return true;\n}\n\nstatic void draw(CUBE_STATE_T *state){\n\n if(*fragHasChanged) {\n std::string fragSource;\n if(loadFromPath(fragFile, &fragSource)){\n shader.detach(GL_FRAGMENT_SHADER | GL_VERTEX_SHADER);\n shader.build(fragSource,vertSource);\n *fragHasChanged = false;\n }\n }\n\n \/\/ Now render to the main frame buffer\n glBindFramebuffer(GL_FRAMEBUFFER,0);\n \/\/ Clear the background (not really necessary I suppose)\n glClear(GL_COLOR_BUFFER_BIT|GL_DEPTH_BUFFER_BIT);\n \n glBindBuffer(GL_ARRAY_BUFFER, state->buf);\n shader.use();\n \n shader.sendUniform(\"u_time\", ((float)clock())\/CLOCKS_PER_SEC);\n shader.sendUniform(\"u_mouse\", state->mouse_x, state_mouse_y);\n shader.sendUniform(\"u_resolution\",state->screen_width, state->screen_height);\n \n glDrawArrays(GL_TRIANGLE_FAN, 0, 4);\n \n glBindBuffer(GL_ARRAY_BUFFER, 0);\n \n glFlush();\n glFinish();\n \n eglSwapBuffers(state->display, state->surface); \n}\n\nstatic int get_mouse(CUBE_STATE_T *state){\n static int fd = -1;\n const int width=state->screen_width, height=state->screen_height;\n static int x=width, y=height;\n const int XSIGN = 1<<4, YSIGN = 1<<5;\n if (fd<0) {\n fd = open(\"\/dev\/input\/mouse0\",O_RDONLY|O_NONBLOCK);\n }\n if (fd>=0) {\n struct {char buttons, dx, dy; } m;\n while (1) {\n int bytes = read(fd, &m, sizeof m);\n if (bytes < (int)sizeof m) goto _exit;\n if (m.buttons&8) {\n break; \/\/ This bit should always be set\n }\n read(fd, &m, 1); \/\/ Try to sync up again\n }\n if (m.buttons&3)\n return m.buttons&3;\n x+=m.dx;\n y+=m.dy;\n if (m.buttons&XSIGN)\n x-=256;\n if (m.buttons&YSIGN)\n y-=256;\n if (x<0) x=0;\n if (y<0) y=0;\n if (x>width) x=width;\n if (y>height) y=height;\n }\n\n_exit:\n state->mouse_x = x;\n state->mouse_y = y;\n return 0;\n} \n\nvoid drawThread() {\n setup();\n while (1) {\n if (get_mouse(state)) break;\n draw(state);\n }\n} \n\nvoid watchThread(const std::string& _file) {\n Inotify notify;\n\n InotifyWatch watch(\".\", IN_MODIFY);\/\/IN_ALL_EVENTS);\n notify.Add(watch);\n\n for (;;) {\n\n if(!(*fragHasChanged)){\n notify.WaitForEvents();\n\n size_t count = notify.GetEventCount();\n while(count-- > 0) {\n InotifyEvent event;\n bool got_event = notify.GetEvent(&event);\n\n if(got_event){ \n std::string mask_str;\n event.DumpTypes(mask_str);\n std::string filename = event.GetName();\n std::cout << \"Child: \" << filename << \" have change \" << mask_str << std::endl;\n if (filename == _file){\n *fragHasChanged = true;\n }\n }\n } \n }\n }\n}\n\nvoid setup() {\n bcm_host_init();\n\n \/\/ Clear application state\n memset( state, 0, sizeof( *state ) );\n \n \/\/ Start OGLES\n init_ogl(state);\n\n \/\/ Build shader;\n \/\/\n std::string fragSource;\n if(!loadFromPath(fragFile, &fragSource)) {\n return;\n }\n shader.build(fragSource,vertSource);\n\n \/\/ Make Quad\n \/\/\n static const GLfloat vertex_data[] = {\n -1.0,-1.0,1.0,1.0,\n 1.0,-1.0,1.0,1.0,\n 1.0,1.0,1.0,1.0,\n -1.0,1.0,1.0,1.0\n };\n GLint posAttribut = shader.getAttribLocation(\"a_position\");\n \n glClearColor ( 0.0, 1.0, 1.0, 1.0 );\n \n glGenBuffers(1, &state->buf);\n \n \/\/ Prepare viewport\n glViewport ( 0, 0, state->screen_width, state->screen_height );\n \n \n \/\/ Upload vertex data to a buffer\n glBindBuffer(GL_ARRAY_BUFFER, state->buf);\n glBufferData(GL_ARRAY_BUFFER, sizeof(vertex_data),\n vertex_data, GL_STATIC_DRAW);\n glVertexAttribPointer(posAttribut, 4, GL_FLOAT, 0, 16, 0);\n glEnableVertexAttribArray(posAttribut);\n \n}\n \n\/\/==============================================================================\n\nint main(int argc, char **argv){\n fragFile = std::string(argv[1]);\n\n int shmId = shmget(IPC_PRIVATE, sizeof(bool), 0666);\n pid_t pid = fork();\n fragHasChanged = (bool *) shmat(shmId, NULL, 0);\n\n switch(pid) {\n case -1: \/\/error\n break;\n\n case 0: \/\/ child\n {\n *fragHasChanged = false;\n watchThread(fragFile);\n }\n break;\n\n default: \n {\n drawThread();\n\n kill(pid, SIGKILL);\n }\n break;\n }\n\n shmctl(shmId, IPC_RMID, NULL);\n return 0;\n}\n\n<|endoftext|>"} {"text":"<commit_before>\/* ---------------------------------------------------------------------------\n** This software is in the public domain, furnished \"as is\", without technical\n** support, and with no warranty, express or implied, as to its usefulness for\n** any purpose.\n**\n** main.cpp\n**\n** -------------------------------------------------------------------------*\/\n\n#include <iostream>\n\n#include \"rtc_base\/ssladapter.h\"\n#include \"rtc_base\/thread.h\"\n#include \"p2p\/base\/stunserver.h\"\n\n#include \"PeerConnectionManager.h\"\n#include \"HttpServerRequestHandler.h\"\n\n\/* ---------------------------------------------------------------------------\n** main\n** -------------------------------------------------------------------------*\/\nint main(int argc, char* argv[])\n{\n\tconst char* turnurl = \"\";\n\tconst char* defaultlocalstunurl = \"0.0.0.0:3478\";\n\tconst char* localstunurl = NULL;\n\tconst char* stunurl = \"stun.l.google.com:19302\";\n\tint logLevel = rtc::LERROR;\n\tconst char* webroot = \".\/html\";\n\tstd::string sslCertificate;\n\twebrtc::AudioDeviceModule::AudioLayer audioLayer = webrtc::AudioDeviceModule::kLinuxAlsaAudio;\n\tstd::string streamName;\n\tstd::map<std::string,std::string> urlList;\n\n\tstd::string httpAddress(\"0.0.0.0:\");\n\tstd::string httpPort = \"8000\";\n\tconst char * port = getenv(\"PORT\");\n\tif (port)\n\t{\n\t\thttpPort = port;\n\t}\n\thttpAddress.append(httpPort);\n\n\tint c = 0;\n\twhile ((c = getopt (argc, argv, \"hVv::\" \"c:H:w:\" \"t:S::s::\" \"a::n:u:\")) != -1)\n\t{\n\t\tswitch (c)\n\t\t{\n\t\t\tcase 'H': httpAddress = optarg; break;\n\t\t\tcase 'c': sslCertificate = optarg; break;\n\t\t\tcase 'w': webroot = optarg; break;\n\n\t\t\tcase 't': turnurl = optarg; break;\n\t\t\tcase 'S': localstunurl = optarg ? optarg : defaultlocalstunurl; stunurl = localstunurl; break;\n\t\t\tcase 's': localstunurl = NULL; if (optarg) stunurl = optarg; break;\n\t\t\t\n\t\t\tcase 'a': audioLayer = optarg ? (webrtc::AudioDeviceModule::AudioLayer)atoi(optarg) : webrtc::AudioDeviceModule::kDummyAudio; break;\n\t\t\tcase 'n': streamName = optarg; break;\n\t\t\tcase 'u': {\n\t\t\t\tif (!streamName.empty()) {\n\t\t\t\t\turlList[streamName]=optarg;\n\t\t\t\t\tstreamName.clear();\n\t\t\t\t}\n\t\t\t}\n\t\t\tbreak;\n\t\t\t\n\t\t\tcase 'v': \n\t\t\t\tlogLevel--; \n\t\t\t\tif (optarg) {\n\t\t\t\t\tlogLevel-=strlen(optarg); \n\t\t\t\t}\n\t\t\tbreak;\t\t\t\n\t\t\tcase 'V':\n\t\t\t\tstd::cout << VERSION << std::endl;\n\t\t\t\texit(0);\n\t\t\tbreak;\n\t\t\tcase 'h':\n\t\t\tdefault:\n\t\t\t\tstd::cout << argv[0] << \" [-H http port] [-S[embeded stun address]] [-t [username:password@]turn_address] -[v[v]] [url1]...[urln]\" << std::endl;\n\t\t\t\tstd::cout << argv[0] << \" [-H http port] [-s[externel stun address]] [-t [username:password@]turn_address] -[v[v]] [url1]...[urln]\" << std::endl;\n\t\t\t\tstd::cout << argv[0] << \" -V\" << std::endl;\n\t\t\t\tstd::cout << \"\\t -H hostname:port : HTTP server binding (default \" << httpAddress << \")\" << std::endl;\n\t\t\t\tstd::cout << \"\\t -w webroot : path to get files\" << std::endl;\n\t\t\t\tstd::cout << \"\\t -c sslkeycert : path to private key and certificate for HTTPS\" << std::endl;\n\t\t\t\n\t\t\t\tstd::cout << \"\\t -S[stun_address] : start embeded STUN server bind to address (default \" << defaultlocalstunurl << \")\" << std::endl;\n\t\t\t\tstd::cout << \"\\t -s[stun_address] : use an external STUN server (default \" << stunurl << \")\" << std::endl;\n\t\t\t\tstd::cout << \"\\t -t[username:password@]turn_address : use an external TURN relay server (default disabled)\" << std::endl;\n\n\t\t\t\tstd::cout << \"\\t -a[audio layer] : spefify audio capture layer to use (default:\" << audioLayer << \")\" << std::endl;\n\t\t\t\tstd::cout << \"\\t -n name -u url : register a stream with name using url\" << std::endl;\n\t\t\t\n\t\t\t\tstd::cout << \"\\t [url] : url to register in the source list\" << std::endl;\n\t\t\t\n\t\t\t\tstd::cout << \"\\t -v[v[v]] : verbosity\" << std::endl;\n\t\t\t\tstd::cout << \"\\t -V : print version\" << std::endl;\n\t\t\t\texit(0);\n\t\t}\n\t}\n\n\twhile (optind<argc)\n\t{\n\t\tstd::string url(argv[optind]);\n\t\turlList[url]=url;\n\t\toptind++;\n\t}\n\n\trtc::LogMessage::LogToDebug((rtc::LoggingSeverity)logLevel);\n\trtc::LogMessage::LogTimestamps();\n\trtc::LogMessage::LogThreads();\n\tstd::cout << \"Logger level:\" << rtc::LogMessage::GetLogToDebug() << std::endl;\n\n\trtc::Thread* thread = rtc::Thread::Current();\n\trtc::InitializeSSL();\n\n\t\/\/ webrtc server\n\tPeerConnectionManager webRtcServer(stunurl, turnurl, urlList, audioLayer);\n\tif (!webRtcServer.InitializePeerConnection())\n\t{\n\t\tstd::cout << \"Cannot Initialize WebRTC server\" << std::endl;\n\t}\n\telse\n\t{\n\t\t\/\/ http server\n\t\tstd::vector<std::string> options;\n\t\toptions.push_back(\"document_root\");\n\t\toptions.push_back(webroot);\n\t\toptions.push_back(\"listening_ports\");\n\t\toptions.push_back(httpAddress);\n\t\tif (!sslCertificate.empty()) {\n\t\t\toptions.push_back(\"ssl_certificate\");\n\t\t\toptions.push_back(sslCertificate);\n\t\t}\n\n\t\ttry {\n\t\t\tstd::cout << \"HTTP Listen at \" << httpAddress << std::endl;\n\t\t\tHttpServerRequestHandler httpServer(&webRtcServer, options);\n\n\t\t\t\/\/ start STUN server if needed\n\t\t\tstd::unique_ptr<cricket::StunServer> stunserver;\n\t\t\tif (localstunurl != NULL)\n\t\t\t{\n\t\t\t\trtc::SocketAddress server_addr;\n\t\t\t\tserver_addr.FromString(localstunurl);\n\t\t\t\trtc::AsyncUDPSocket* server_socket = rtc::AsyncUDPSocket::Create(thread->socketserver(), server_addr);\n\t\t\t\tif (server_socket)\n\t\t\t\t{\n\t\t\t\t\tstunserver.reset(new cricket::StunServer(server_socket));\n\t\t\t\t\tstd::cout << \"STUN Listening at \" << server_addr.ToString() << std::endl;\n\t\t\t\t}\n\t\t\t}\n\t\t\t\n\t\t\t\/\/ mainloop\n\t\t\tthread->Run();\n\n\t\t} catch (const CivetException & ex) {\n\t\t\tstd::cout << \"Cannot Initialize start HTTP server exception:\" << ex.what() << std::endl;\n\t\t}\n\t}\n\n\trtc::CleanupSSL();\n\treturn 0;\n}\n\n<commit_msg>add CORS header<commit_after>\/* ---------------------------------------------------------------------------\n** This software is in the public domain, furnished \"as is\", without technical\n** support, and with no warranty, express or implied, as to its usefulness for\n** any purpose.\n**\n** main.cpp\n**\n** -------------------------------------------------------------------------*\/\n\n#include <iostream>\n\n#include \"rtc_base\/ssladapter.h\"\n#include \"rtc_base\/thread.h\"\n#include \"p2p\/base\/stunserver.h\"\n\n#include \"PeerConnectionManager.h\"\n#include \"HttpServerRequestHandler.h\"\n\n\/* ---------------------------------------------------------------------------\n** main\n** -------------------------------------------------------------------------*\/\nint main(int argc, char* argv[])\n{\n\tconst char* turnurl = \"\";\n\tconst char* defaultlocalstunurl = \"0.0.0.0:3478\";\n\tconst char* localstunurl = NULL;\n\tconst char* stunurl = \"stun.l.google.com:19302\";\n\tint logLevel = rtc::LERROR;\n\tconst char* webroot = \".\/html\";\n\tstd::string sslCertificate;\n\twebrtc::AudioDeviceModule::AudioLayer audioLayer = webrtc::AudioDeviceModule::kLinuxAlsaAudio;\n\tstd::string streamName;\n\tstd::map<std::string,std::string> urlList;\n\n\tstd::string httpAddress(\"0.0.0.0:\");\n\tstd::string httpPort = \"8000\";\n\tconst char * port = getenv(\"PORT\");\n\tif (port)\n\t{\n\t\thttpPort = port;\n\t}\n\thttpAddress.append(httpPort);\n\n\tint c = 0;\n\twhile ((c = getopt (argc, argv, \"hVv::\" \"c:H:w:\" \"t:S::s::\" \"a::n:u:\")) != -1)\n\t{\n\t\tswitch (c)\n\t\t{\n\t\t\tcase 'H': httpAddress = optarg; break;\n\t\t\tcase 'c': sslCertificate = optarg; break;\n\t\t\tcase 'w': webroot = optarg; break;\n\n\t\t\tcase 't': turnurl = optarg; break;\n\t\t\tcase 'S': localstunurl = optarg ? optarg : defaultlocalstunurl; stunurl = localstunurl; break;\n\t\t\tcase 's': localstunurl = NULL; if (optarg) stunurl = optarg; break;\n\t\t\t\n\t\t\tcase 'a': audioLayer = optarg ? (webrtc::AudioDeviceModule::AudioLayer)atoi(optarg) : webrtc::AudioDeviceModule::kDummyAudio; break;\n\t\t\tcase 'n': streamName = optarg; break;\n\t\t\tcase 'u': {\n\t\t\t\tif (!streamName.empty()) {\n\t\t\t\t\turlList[streamName]=optarg;\n\t\t\t\t\tstreamName.clear();\n\t\t\t\t}\n\t\t\t}\n\t\t\tbreak;\n\t\t\t\n\t\t\tcase 'v': \n\t\t\t\tlogLevel--; \n\t\t\t\tif (optarg) {\n\t\t\t\t\tlogLevel-=strlen(optarg); \n\t\t\t\t}\n\t\t\tbreak;\t\t\t\n\t\t\tcase 'V':\n\t\t\t\tstd::cout << VERSION << std::endl;\n\t\t\t\texit(0);\n\t\t\tbreak;\n\t\t\tcase 'h':\n\t\t\tdefault:\n\t\t\t\tstd::cout << argv[0] << \" [-H http port] [-S[embeded stun address]] [-t [username:password@]turn_address] -[v[v]] [url1]...[urln]\" << std::endl;\n\t\t\t\tstd::cout << argv[0] << \" [-H http port] [-s[externel stun address]] [-t [username:password@]turn_address] -[v[v]] [url1]...[urln]\" << std::endl;\n\t\t\t\tstd::cout << argv[0] << \" -V\" << std::endl;\n\t\t\t\tstd::cout << \"\\t -H hostname:port : HTTP server binding (default \" << httpAddress << \")\" << std::endl;\n\t\t\t\tstd::cout << \"\\t -w webroot : path to get files\" << std::endl;\n\t\t\t\tstd::cout << \"\\t -c sslkeycert : path to private key and certificate for HTTPS\" << std::endl;\n\t\t\t\n\t\t\t\tstd::cout << \"\\t -S[stun_address] : start embeded STUN server bind to address (default \" << defaultlocalstunurl << \")\" << std::endl;\n\t\t\t\tstd::cout << \"\\t -s[stun_address] : use an external STUN server (default \" << stunurl << \")\" << std::endl;\n\t\t\t\tstd::cout << \"\\t -t[username:password@]turn_address : use an external TURN relay server (default disabled)\" << std::endl;\n\n\t\t\t\tstd::cout << \"\\t -a[audio layer] : spefify audio capture layer to use (default:\" << audioLayer << \")\" << std::endl;\n\t\t\t\tstd::cout << \"\\t -n name -u url : register a stream with name using url\" << std::endl;\n\t\t\t\n\t\t\t\tstd::cout << \"\\t [url] : url to register in the source list\" << std::endl;\n\t\t\t\n\t\t\t\tstd::cout << \"\\t -v[v[v]] : verbosity\" << std::endl;\n\t\t\t\tstd::cout << \"\\t -V : print version\" << std::endl;\n\t\t\t\texit(0);\n\t\t}\n\t}\n\n\twhile (optind<argc)\n\t{\n\t\tstd::string url(argv[optind]);\n\t\turlList[url]=url;\n\t\toptind++;\n\t}\n\n\trtc::LogMessage::LogToDebug((rtc::LoggingSeverity)logLevel);\n\trtc::LogMessage::LogTimestamps();\n\trtc::LogMessage::LogThreads();\n\tstd::cout << \"Logger level:\" << rtc::LogMessage::GetLogToDebug() << std::endl;\n\n\trtc::Thread* thread = rtc::Thread::Current();\n\trtc::InitializeSSL();\n\n\t\/\/ webrtc server\n\tPeerConnectionManager webRtcServer(stunurl, turnurl, urlList, audioLayer);\n\tif (!webRtcServer.InitializePeerConnection())\n\t{\n\t\tstd::cout << \"Cannot Initialize WebRTC server\" << std::endl;\n\t}\n\telse\n\t{\n\t\t\/\/ http server\n\t\tstd::vector<std::string> options;\n\t\toptions.push_back(\"document_root\");\n\t\toptions.push_back(webroot);\n\t\toptions.push_back(\"access_control_allow_origin\");\n\t\toptions.push_back(\"*\");\n\t\toptions.push_back(\"listening_ports\");\n\t\toptions.push_back(httpAddress);\n\t\tif (!sslCertificate.empty()) {\n\t\t\toptions.push_back(\"ssl_certificate\");\n\t\t\toptions.push_back(sslCertificate);\n\t\t}\n\n\t\ttry {\n\t\t\tstd::cout << \"HTTP Listen at \" << httpAddress << std::endl;\n\t\t\tHttpServerRequestHandler httpServer(&webRtcServer, options);\n\n\t\t\t\/\/ start STUN server if needed\n\t\t\tstd::unique_ptr<cricket::StunServer> stunserver;\n\t\t\tif (localstunurl != NULL)\n\t\t\t{\n\t\t\t\trtc::SocketAddress server_addr;\n\t\t\t\tserver_addr.FromString(localstunurl);\n\t\t\t\trtc::AsyncUDPSocket* server_socket = rtc::AsyncUDPSocket::Create(thread->socketserver(), server_addr);\n\t\t\t\tif (server_socket)\n\t\t\t\t{\n\t\t\t\t\tstunserver.reset(new cricket::StunServer(server_socket));\n\t\t\t\t\tstd::cout << \"STUN Listening at \" << server_addr.ToString() << std::endl;\n\t\t\t\t}\n\t\t\t}\n\t\t\t\n\t\t\t\/\/ mainloop\n\t\t\tthread->Run();\n\n\t\t} catch (const CivetException & ex) {\n\t\t\tstd::cout << \"Cannot Initialize start HTTP server exception:\" << ex.what() << std::endl;\n\t\t}\n\t}\n\n\trtc::CleanupSSL();\n\treturn 0;\n}\n\n<|endoftext|>"} {"text":"<commit_before>\/**\n* Assimp2XML3D\n*\n* Copyright (c)2015, Christian Schlinkmann\n*\n*\n**\/\n\n#include <assimp\/version.h>\n#include <assimp\/postprocess.h>\n#include <assimp\/scene.h>\n#include <assimp\/Importer.hpp>\n#include <assimp\/Exporter.hpp>\n\n#include <iostream>\n\nextern Assimp::Exporter::ExportFormatEntry Assimp2XML3D_desc;\n\nint invalidUsageExit() {\n\tstd::cout << \"usage: assimp2xml3d [FLAGS] inputFile [outputFile]\" << std::endl;\n\treturn -1;\n}\n\n\nint main(int argc, char *argv[]) {\n\tif (argc < 3) {\n\t\treturn invalidUsageExit();\n\t}\n\n\tconst char* input = argv[1], *output = argv[2];\n\n\tAssimp::Importer importer;\n\timporter.SetPropertyBool(AI_CONFIG_PP_FD_REMOVE, true);\n\n\tconst aiScene* const scene = importer.ReadFile(input, aiProcessPreset_TargetRealtime_MaxQuality);\n\n\tif (!scene) {\n\t\tstd::cerr << \"Assimp: Could not read file \" << input << std::endl;\n\t\treturn -1;\n\t}\n\n\tstd::cout << \"Assimp read file successfully\";\n\n\tAssimp::Exporter exporter;\n\texporter.RegisterExporter(Assimp2XML3D_desc);\n\texporter.Export(scene, \"xml\", output);\n}\n<commit_msg>Assimp should filter out points and lines until support for them is added<commit_after>\/**\n* Assimp2XML3D\n*\n* Copyright (c)2015, Christian Schlinkmann\n*\n*\n**\/\n\n#include <assimp\/version.h>\n#include <assimp\/postprocess.h>\n#include <assimp\/scene.h>\n#include <assimp\/Importer.hpp>\n#include <assimp\/Exporter.hpp>\n\n#include <iostream>\n\nextern Assimp::Exporter::ExportFormatEntry Assimp2XML3D_desc;\n\nint invalidUsageExit() {\n\tstd::cout << \"usage: assimp2xml3d [FLAGS] inputFile [outputFile]\" << std::endl;\n\treturn -1;\n}\n\n\nint main(int argc, char *argv[]) {\n\tif (argc < 3) {\n\t\treturn invalidUsageExit();\n\t}\n\n\tconst char* input = argv[1], *output = argv[2];\n\n\tAssimp::Importer importer;\n\timporter.SetPropertyBool(AI_CONFIG_PP_FD_REMOVE, true);\n\timporter.SetPropertyInteger(AI_CONFIG_PP_SBP_REMOVE, aiPrimitiveType_POINT | aiPrimitiveType_LINE);\n\n\tconst aiScene* const scene = importer.ReadFile(input, aiProcessPreset_TargetRealtime_MaxQuality);\n\n\tif (!scene) {\n\t\tstd::cerr << \"Assimp: Could not read file \" << input << std::endl;\n\t\treturn -1;\n\t}\n\n\tstd::cout << \"Assimp read file successfully\";\n\n\tAssimp::Exporter exporter;\n\texporter.RegisterExporter(Assimp2XML3D_desc);\n\texporter.Export(scene, \"xml\", output);\n}\n<|endoftext|>"} {"text":"<commit_before>#include \"parse_git_st.h\"\n#include \"git_committer.h\"\n#include \"exceptions.h\"\n#include <ncurses.h>\n#include <menu.h>\n#include <iostream>\n#include <sstream>\n\nusing namespace std;\n\nMENU* init_all_files_menu(GitStatusParser* git_status_parser, WINDOW* window) {\n vector<string*>* new_files = git_status_parser->getNewFiles();\n vector<string*>* modified_files = git_status_parser->getModifiedFiles();\n vector<string*>* untracked_files = git_status_parser->getUntrackedFiles();\n int total_files = new_files->size() + modified_files->size() + untracked_files->size();\n\n\n ITEM** items = new ITEM*[total_files + 1]; \/\/need 1 more space for null entry (end of menu)\n int index = 0;\n for (int i = 0; i < new_files->size(); i++, index++) {\n items[index] = new_item((new_files->at(i))->c_str(), \"(new)\");\n }\n for (int i = 0; i < modified_files->size(); i++, index++) {\n items[index] = new_item((modified_files->at(i))->c_str(), \"(modified)\");\n }\n for (int i = 0; i < untracked_files->size(); i++, index++) {\n items[index] = new_item((untracked_files->at(i))->c_str(), \"(untracked)\");\n }\n items[index] = 0;\n MENU* menu = new_menu(items);\n set_menu_win(menu, window);\n menu_opts_off(menu, O_ONEVALUE);\n return menu;\n}\n\nstring* menu_item_to_string(ITEM* item) {\n const char* name = item->name.str;\n return new string(name);\n}\n\nbool is_selected_any_file(MENU* menu) {\n ITEM** items = menu_items(menu);\n int count = item_count(menu);\n for (int i = 0; i < count; i++) {\n if (item_value(items[i]) == TRUE) {\n return true;\n }\n }\n}\n\nvoid add_selected_files(MENU* menu, GitCommitter* git_committer) {\n ITEM** items = menu_items(menu);\n int count = item_count(menu);\n for (int i = 0; i < count; i++) {\n if (item_value(items[i]) == TRUE) {\n string* filename = menu_item_to_string(items[i]);\n git_committer->addFile(filename);\n }\n }\n}\n\nvoid draw_title_line() {\n const char* title = \"GIT EASY COMMIT\";\n int x, y;\n attron(COLOR_PAIR(3) | A_REVERSE | A_BOLD);\n getmaxyx(stdscr, y, x);\n for (int i = 0; i < x; i++) {\n mvaddch(0, i, ' ');\n }\n mvprintw(0, (x \/ 2) - (strlen(title) \/ 2), title);\n attroff(A_REVERSE | A_BOLD);\n}\n\nvoid draw_help() {\n attron(COLOR_PAIR(1));\n mvprintw(1, 1, \"<up>, k - navigate up, <down>, j - navigate down\");;\n mvprintw(2, 1, \"<space> - select\/deselect file, c - commit selected file(s)\");\n mvprintw(3, 1, \"<esc>, q - quit\");\n attron(A_BOLD);\n mvprintw(5, 1, \"All files\");\n attroff(A_BOLD);\n}\n\n\/\/ Global variables\nWINDOW* menu_window;\nMENU* files_menu;\nGitStatusParser git_st_parser;\nGitCommitter git_committer;\nbool terminated = false;\n\nvoid init_git_parser() {\n try {\n git_st_parser.parse();\n } catch (NotAGitRepositoryException e) {\n cerr << \"Missing git repository! Use git-ec in the git repository or any of it's subdirectories.\" << endl;\n cerr.flush();\n exit(1);\n }\n}\n\nvoid init_curses() {\n initscr();\n keypad(stdscr, TRUE);\n start_color();\n noecho();\n curs_set(0);\n init_pair(1, COLOR_WHITE, COLOR_BLACK);\n init_pair(2, COLOR_CYAN, COLOR_BLACK);\n init_pair(3, COLOR_GREEN, COLOR_BLACK);\n}\n\nvoid init_menu_window() {\n int rows, cols;\n int menu_y = 6;\n getmaxyx(stdscr, rows, cols);\n int menu_height = (rows - menu_y) - 2;\n if (menu_height < 2) {\n menu_height = 2;\n }\n menu_window = newwin(menu_height, cols, 6, 0);\n files_menu = init_all_files_menu(&git_st_parser, menu_window);\n set_menu_format(files_menu, menu_height, 1);\n set_menu_fore(files_menu, COLOR_PAIR(2) | A_REVERSE | A_BOLD);\n set_menu_grey(files_menu, COLOR_PAIR(1) | A_REVERSE | A_BOLD);\n post_menu(files_menu);\n refresh();\n wrefresh(menu_window);\n}\n\nvoid cleanup() {\n if (files_menu) {\n free_menu(files_menu);\n }\n endwin();\n}\n\n\/\/TODO add ctrl-c handling (cleanup)\nint main(int argc, char** argv) {\n init_git_parser();\n init_curses();\n init_menu_window();\n \n draw_title_line();\n draw_help();\n\n bool done = false;\n int key = 0;\n\n do {\n key = getch();\n switch (key) {\n case KEY_DOWN:\n case 'j':\n menu_driver(files_menu, REQ_DOWN_ITEM);\n break;\n\n case KEY_UP:\n case 'k':\n menu_driver(files_menu, REQ_UP_ITEM);\n break;\n\n case KEY_PPAGE:\n menu_driver(files_menu, REQ_SCR_UPAGE);\n break;\n\n case KEY_NPAGE:\n menu_driver(files_menu, REQ_SCR_DPAGE);\n break;\n\n case ' ':\n menu_driver(files_menu, REQ_TOGGLE_ITEM);\n break;\n\n case 'c': \n if (is_selected_any_file(files_menu)) {\n add_selected_files(files_menu, &git_committer);\n free_menu(files_menu);\n endwin();\n git_committer.commit();\n return 0;\n }\n break;\n\n case 'q':\n case 27: \/\/ESC\n done = true;\n break;\n }\n wrefresh(menu_window);\n refresh();\n } while (!done);\n free_menu(files_menu);\n endwin();\n return 0;\n}\n\n<commit_msg>Add basic SIGINT handler with cleanup method.<commit_after>#include \"parse_git_st.h\"\n#include \"git_committer.h\"\n#include \"exceptions.h\"\n#include <ncurses.h>\n#include <menu.h>\n#include <iostream>\n#include <sstream>\n\nusing namespace std;\n\nMENU* init_all_files_menu(GitStatusParser* git_status_parser, WINDOW* window) {\n vector<string*>* new_files = git_status_parser->getNewFiles();\n vector<string*>* modified_files = git_status_parser->getModifiedFiles();\n vector<string*>* untracked_files = git_status_parser->getUntrackedFiles();\n int total_files = new_files->size() + modified_files->size() + untracked_files->size();\n\n\n ITEM** items = new ITEM*[total_files + 1]; \/\/need 1 more space for null entry (end of menu)\n int index = 0;\n for (int i = 0; i < new_files->size(); i++, index++) {\n items[index] = new_item((new_files->at(i))->c_str(), \"(new)\");\n }\n for (int i = 0; i < modified_files->size(); i++, index++) {\n items[index] = new_item((modified_files->at(i))->c_str(), \"(modified)\");\n }\n for (int i = 0; i < untracked_files->size(); i++, index++) {\n items[index] = new_item((untracked_files->at(i))->c_str(), \"(untracked)\");\n }\n items[index] = 0;\n MENU* menu = new_menu(items);\n set_menu_win(menu, window);\n menu_opts_off(menu, O_ONEVALUE);\n return menu;\n}\n\nstring* menu_item_to_string(ITEM* item) {\n const char* name = item->name.str;\n return new string(name);\n}\n\nbool is_selected_any_file(MENU* menu) {\n ITEM** items = menu_items(menu);\n int count = item_count(menu);\n for (int i = 0; i < count; i++) {\n if (item_value(items[i]) == TRUE) {\n return true;\n }\n }\n}\n\nvoid add_selected_files(MENU* menu, GitCommitter* git_committer) {\n ITEM** items = menu_items(menu);\n int count = item_count(menu);\n for (int i = 0; i < count; i++) {\n if (item_value(items[i]) == TRUE) {\n string* filename = menu_item_to_string(items[i]);\n git_committer->addFile(filename);\n }\n }\n}\n\nvoid draw_title_line() {\n const char* title = \"GIT EASY COMMIT\";\n int x, y;\n attron(COLOR_PAIR(3) | A_REVERSE | A_BOLD);\n getmaxyx(stdscr, y, x);\n for (int i = 0; i < x; i++) {\n mvaddch(0, i, ' ');\n }\n mvprintw(0, (x \/ 2) - (strlen(title) \/ 2), title);\n attroff(A_REVERSE | A_BOLD);\n}\n\nvoid draw_help() {\n attron(COLOR_PAIR(1));\n mvprintw(1, 1, \"<up>, k - navigate up, <down>, j - navigate down\");;\n mvprintw(2, 1, \"<space> - select\/deselect file, c - commit selected file(s)\");\n mvprintw(3, 1, \"<esc>, q - quit\");\n attron(A_BOLD);\n mvprintw(5, 1, \"All files\");\n attroff(A_BOLD);\n}\n\n\/\/ Global variables\nWINDOW* menu_window;\nMENU* files_menu;\nGitStatusParser git_st_parser;\nGitCommitter git_committer;\n\nvoid init_git_parser() {\n try {\n git_st_parser.parse();\n } catch (NotAGitRepositoryException e) {\n cerr << \"Missing git repository! Use git-ec in the git repository or any of it's subdirectories.\" << endl;\n cerr.flush();\n exit(1);\n }\n}\n\nvoid init_curses() {\n initscr();\n keypad(stdscr, TRUE);\n start_color();\n noecho();\n curs_set(0);\n init_pair(1, COLOR_WHITE, COLOR_BLACK);\n init_pair(2, COLOR_CYAN, COLOR_BLACK);\n init_pair(3, COLOR_GREEN, COLOR_BLACK);\n}\n\nvoid init_menu_window() {\n int rows, cols;\n int menu_y = 6;\n getmaxyx(stdscr, rows, cols);\n int menu_height = (rows - menu_y) - 2;\n if (menu_height < 2) {\n menu_height = 2;\n }\n menu_window = newwin(menu_height, cols, 6, 0);\n files_menu = init_all_files_menu(&git_st_parser, menu_window);\n set_menu_format(files_menu, menu_height, 1);\n set_menu_fore(files_menu, COLOR_PAIR(2) | A_REVERSE | A_BOLD);\n set_menu_grey(files_menu, COLOR_PAIR(1) | A_REVERSE | A_BOLD);\n post_menu(files_menu);\n refresh();\n wrefresh(menu_window);\n}\n\nvoid cleanup() {\n if (files_menu) {\n free_menu(files_menu);\n }\n endwin();\n}\n\nvoid handle_sigint(int params) {\n cleanup();\n exit(1);\n}\n\n\/\/TODO add ctrl-c handling (cleanup)\nint main(int argc, char** argv) {\n init_git_parser();\n init_curses();\n init_menu_window();\n \n draw_title_line();\n draw_help();\n\n signal(SIGINT, handle_sigint);\n\n bool done = false;\n int key = 0;\n\n do {\n key = getch();\n switch (key) {\n case KEY_DOWN:\n case 'j':\n menu_driver(files_menu, REQ_DOWN_ITEM);\n break;\n\n case KEY_UP:\n case 'k':\n menu_driver(files_menu, REQ_UP_ITEM);\n break;\n\n case KEY_PPAGE:\n menu_driver(files_menu, REQ_SCR_UPAGE);\n break;\n\n case KEY_NPAGE:\n menu_driver(files_menu, REQ_SCR_DPAGE);\n break;\n\n case ' ':\n menu_driver(files_menu, REQ_TOGGLE_ITEM);\n break;\n\n case 'c': \n if (is_selected_any_file(files_menu)) {\n add_selected_files(files_menu, &git_committer);\n cleanup();\n git_committer.commit();\n return 0;\n }\n break;\n\n case 'q':\n case 27: \/\/ESC\n done = true;\n break;\n }\n wrefresh(menu_window);\n refresh();\n } while (!done);\n cleanup();\n return 0;\n}\n\n<|endoftext|>"} {"text":"<commit_before>#include\t<iostream>\n#include\t<SDL.h>\n#include\t\"..\/vbam\/gba\/GBA.h\"\n#include\t\"..\/vbam\/gba\/Globals.h\"\n#include\t\"..\/vbam\/gba\/armdis.h\"\n#include\t\"..\/vbam\/sdl\/SDLGlobals.h\"\n#include \"..\/vbam\/sdl\/debugger.h\"\n#include\t\"Data.hh\"\n#include\t\"Script.hh\"\n#include\t\"ThumbDisas.hh\"\n#include\t\"PrintUtils.hh\"\n#include\t\"Bot.hh\"\n#include \"VM.hh\"\n#include \"Lua.hh\"\n#include \"Config.hh\"\n\nextern Lua L;\n\nvoid\t\tdoLoop()\n{\n Data\t\t&data = *Data::data;\n int\t\tstep = 0;\n\n while (emulating)\n {\n if (paused)\n {\n L.doREPL();\n paused = false;\n }\n L.doFunc(\"onEnterFrame\");\n if (++step < 900)\n\t{\n\t sdlSetButton(KEY_BUTTON_AUTO_A, step < 899);\n\t sdlSetButton(KEY_BUTTON_SPEED, step < 899);\n\t}\n else\n\t{\n\t data.update();\n Bot::bot.update();\n\t if (step == 900)\n {\n VM::vm->update();\n L.doFunc(\"onInit\");\n }\n\t if (step % Config::getNumber(\"refreshRate\") == 0)\n\t {\n if (Config::getNumber(\"clearOnRefresh\"))\n printf(\"\\033[2J\\033[0;0H\");\n\t printTeam(data);\n\t printMap(data);\n L.doFunc(\"onRefresh\");\n\t }\n\t}\n\n emulator.emuMain(emulator.emuCount);\n sdlPollEvents(data, Bot::bot);\n }\n}\n\nint\t\tmain(int ac, char **av)\n{\n if (ac < 2)\n {\n std::cerr << \"Usage: .\/pokebot <Pokemon_FireRed.gba>\" << std::endl;\n return (1);\n }\n initVBAM(ac, av);\n \/\/ Break when script engine PC is modified\n debuggerDoString(\"bpw 03000EB8 4\");\n Data::data = new Data();\n VM::vm = new VM();\n L.init();\n doLoop();\n destroyVBAM();\n return (0);\n}\n<commit_msg>add rom validity check for Firered US V1.0<commit_after>#include\t<iostream>\n#include\t<SDL.h>\n#include\t\"..\/vbam\/gba\/GBA.h\"\n#include\t\"..\/vbam\/gba\/Globals.h\"\n#include\t\"..\/vbam\/gba\/armdis.h\"\n#include\t\"..\/vbam\/sdl\/SDLGlobals.h\"\n#include \"..\/vbam\/sdl\/debugger.h\"\n#include\t\"Data.hh\"\n#include\t\"Script.hh\"\n#include\t\"ThumbDisas.hh\"\n#include\t\"PrintUtils.hh\"\n#include\t\"Bot.hh\"\n#include \"VM.hh\"\n#include \"Lua.hh\"\n#include \"Config.hh\"\n\nextern Lua L;\n\nvoid\t\tdoLoop()\n{\n Data\t\t&data = *Data::data;\n int\t\tstep = 0;\n\n while (emulating)\n {\n if (paused)\n {\n L.doREPL();\n paused = false;\n }\n L.doFunc(\"onEnterFrame\");\n if (++step < 900)\n {\n sdlSetButton(KEY_BUTTON_AUTO_A, step < 899);\n sdlSetButton(KEY_BUTTON_SPEED, step < 899);\n }\n else\n {\n data.update();\n Bot::bot.update();\n if (step == 900)\n {\n VM::vm->update();\n L.doFunc(\"onInit\");\n }\n if (step % Config::getNumber(\"refreshRate\") == 0)\n {\n if (Config::getNumber(\"clearOnRefresh\"))\n printf(\"\\033[2J\\033[0;0H\");\n printTeam(data);\n printMap(data);\n L.doFunc(\"onRefresh\");\n }\n }\n\n emulator.emuMain(emulator.emuCount);\n sdlPollEvents(data, Bot::bot);\n }\n}\n\nstatic bool isROMValid()\n{\n const char *err = NULL;\n\n if (strncmp(gbaPtr<char *>(0x080000A0), \"POKEMON FIRE\", 12))\n err = \"the loaded game is not Pokemon FireRed\";\n else if (strncmp(gbaPtr<char *>(0x080000AC), \"BPRE\", 4))\n err = \"the loaded game is not the english version\";\n else if (gbaMem<uint8_t>(0x080000BC) != 0x00)\n err = \"the game version is not V1.0\";\n\n if (err)\n fprintf(stderr, \"Error: %s. Check Readme.md to see what the right rom is\\n\", err);\n return !err;\n}\n\nint\t\tmain(int ac, char **av)\n{\n if (ac < 2)\n {\n std::cerr << \"Usage: .\/pokebot <Pokemon_FireRed.gba>\" << std::endl;\n return (1);\n }\n initVBAM(ac, av);\n\n if (isROMValid())\n {\n \/\/ Break when script engine PC is modified\n debuggerDoString(\"bpw 03000EB8 4\");\n Data::data = new Data();\n VM::vm = new VM();\n L.init();\n doLoop();\n }\n destroyVBAM();\n return (0);\n}\n<|endoftext|>"} {"text":"<commit_before>#include <stdio.h>\n#include <stdlib.h>\n#include <string.h>\n#include <errno.h>\n#include <getopt.h>\n#include <signal.h>\n#include <poll.h>\n#include <unistd.h>\n#include <sys\/eventfd.h>\n#include <sys\/timerfd.h>\n\n#include <string>\n\n#include \"SystemRecorder.hpp\"\n#include \"SystemMonitor.hpp\"\n\n#define SIZEOF_ARRAY(array) (sizeof(array)\/sizeof(array[0]))\n\nstatic struct Context {\n\tbool stop;\n\tint stopfd;\n\tint timer;\n\tint durationTimer;\n\n\tContext()\n\t{\n\t\tstop = false;\n\t\tstopfd = -1;\n\t\ttimer = -1;\n\t\tdurationTimer = -1;\n\t}\n} ctx;\n\nstruct Params {\n\tbool help;\n\tstd::string output;\n\tint period;\n\tint duration;\n\tint recordThreads;\n\n\tParams()\n\t{\n\t\thelp = false;\n\t\tperiod = 1;\n\t\tduration = -1;\n\t\trecordThreads = true;\n\t}\n};\n\nstatic int readDecimalParam(int *out_v, const char *name)\n{\n\tchar *end;\n\tlong int v;\n\n\terrno = 0;\n\tv = strtol(optarg, &end, 10);\n\tif (errno != 0) {\n\t\tint ret = -errno;\n\t\tprintf(\"Unable to parse '%s' %s : %d(%m)\\n\",\n\t\t name, optarg, errno);\n\t\treturn ret;\n\t} else if (*end != '\\0') {\n\t\tprintf(\"'%s' arg '%s' is not decimal\\n\",\n\t\t name, optarg);\n\t\treturn -EINVAL;\n\t} else if (v <= 0) {\n\t\tprintf(\"'%s' arg '%s' is negative or null\\n\",\n\t\t name, optarg);\n\t\treturn -EINVAL;\n\t}\n\n\t*out_v = v;\n\n\treturn 0;\n}\n\nint parseArgs(int argc, char *argv[], Params *params)\n{\n\tint optionIndex = 0;\n\tint value;\n\tint ret;\n\n\tconst struct option argsOptions[] = {\n\t\t{ \"help\" , optional_argument, 0, 'h' },\n\t\t{ \"period\", optional_argument, 0, 'p' },\n\t\t{ \"duration\", optional_argument, 0, 'd' },\n\t\t{ \"output\", required_argument, 0, 'o' },\n\t\t{ \"disable-threads\", optional_argument, ¶ms->recordThreads, 0 },\n\t\t{ 0, 0, 0}\n\t};\n\n\twhile (true) {\n\t\tvalue = getopt_long(argc, argv, \"ho:p:d:\", argsOptions, &optionIndex);\n\t\tif (value == -1 || value == '?')\n\t\t\tbreak;\n\n\t\tswitch (value) {\n\t\tcase 'h':\n\t\t\tparams->help = true;\n\t\t\tbreak;\n\n\t\tcase 'o':\n\t\t\tparams->output = optarg;\n\t\t\tbreak;\n\n\t\tcase 'd':\n\t\t\tret = readDecimalParam(¶ms->duration, \"duration\");\n\t\t\tif (ret < 0)\n\t\t\t\treturn ret;\n\t\t\tbreak;\n\n\t\tcase 'p':\n\t\t\tret = readDecimalParam(¶ms->period, \"period\");\n\t\t\tif (ret < 0)\n\t\t\t\treturn ret;\n\t\t\tbreak;\n\n\t\tdefault:\n\t\t\tbreak;\n\t\t}\n\t}\n\n\treturn 0;\n}\n\nvoid printUsage(int argc, char *argv[])\n{\n\tprintf(\"Usage %s [-h] [-p PERIOD] -o OUTPUT process [process ...]\\n\",\n\t argv[0]);\n\n\tprintf(\"\\n\");\n\n\tprintf(\"positional arguments:\\n\");\n\tprintf(\" %-20s %s\\n\", \"process\", \"Process name to monitor\");\n\n\tprintf(\"\\n\");\n\n\tprintf(\"optional arguments:\\n\");\n\tprintf(\" %-20s %s\\n\", \"-h, --help\", \"show this help message and exit\");\n\tprintf(\" %-20s %s\\n\", \"-p, --period\", \"sample acquisition period (seconds). Default : 1\");\n\tprintf(\" %-20s %s\\n\", \"-d, --duration\", \"acquisition duration (seconds). Default : infinite\");\n\tprintf(\" %-20s %s\\n\", \"-o, --output\", \"output record file\");\n\tprintf(\" %-20s %s\\n\", \"--disable-threads\", \"disable threads recording\");\n}\n\nstatic void sighandler(int s)\n{\n\tint64_t stop = 1;\n\tint ret;\n\n\tprintf(\"stop\\n\");\n\tctx.stop = true;\n\tret = write(ctx.stopfd, &stop, sizeof(stop));\n\tif (ret < 0)\n\t\tprintf(\"write() failed : %d(%m)\\n\", errno);\n}\n\nstatic void systemStatsCb(\n\t\tconst SystemMonitor::SystemStats &stats,\n\t\tvoid *userdata)\n{\n\tSystemRecorder *recorder = (SystemRecorder *) userdata;\n\tint ret;\n\n\tret = recorder->record(stats);\n\tif (ret < 0)\n\t\tprintf(\"record() failed : %d(%s)\\n\", -ret, strerror(-ret));\n}\n\nstatic void processStatsCb(\n\t\tconst SystemMonitor::ProcessStats &stats,\n\t\tvoid *userdata)\n{\n\tSystemRecorder *recorder = (SystemRecorder *) userdata;\n\tint ret;\n\n\tret = recorder->record(stats);\n\tif (ret < 0)\n\t\tprintf(\"record() failed : %d(%s)\\n\", -ret, strerror(-ret));\n}\n\nstatic void threadStatsCb(\n\t\tconst SystemMonitor::ThreadStats &stats,\n\t\tvoid *userdata)\n{\n\tSystemRecorder *recorder = (SystemRecorder *) userdata;\n\tint ret;\n\n\tret = recorder->record(stats);\n\tif (ret < 0)\n\t\tprintf(\"record() failed : %d(%s)\\n\", -ret, strerror(-ret));\n}\n\nstatic void acquisitionDurationCb(\n\t\tconst SystemMonitor::AcquisitionDuration &stats,\n\t\tvoid *userdata)\n{\n\tSystemRecorder *recorder = (SystemRecorder *) userdata;\n\tint ret;\n\n\tret = recorder->record(stats);\n\tif (ret < 0)\n\t\tprintf(\"record() failed : %d(%s)\\n\", -ret, strerror(-ret));\n}\n\nstatic void buildProgParameters(int argc, char *argv[], ProgramParameters *out)\n{\n\tstd::string s;\n\n\ts = argv[0];\n\n\tfor (int i = 1; i < argc; i++)\n\t\ts += std::string(\" \") + std::string(argv[i]);\n\n\tsnprintf(out->mParams, sizeof(out->mParams), \"%s\", s.c_str());\n}\n\nint main(int argc, char *argv[])\n{\n\tstruct itimerspec timer;\n\tstruct pollfd fds[3];\n\tint fdsCount;\n\tParams params;\n\tProgramParameters progParameters;\n\tSystemMonitor::SystemConfig systemConfig;\n\tSystemMonitor::Callbacks cb;\n\tSystemMonitor *mon = nullptr;\n\tSystemMonitor::Config monConfig;\n\tSystemRecorder *recorder = nullptr;\n\tint ret;\n\n\tsignal(SIGINT, sighandler);\n\n\t\/\/ Parse parameters\n\tif (argc == 1) {\n\t\tprintUsage(argc, argv);\n\t\treturn 0;\n\t}\n\n\tret = parseArgs(argc, argv, ¶ms);\n\tif (ret < 0) {\n\t\tprintUsage(argc, argv);\n\t\treturn 1;\n\t} else if (params.output.empty()) {\n\t\tprintf(\"No output file specified\\n\\n\");\n\t\tprintUsage(argc, argv);\n\t\treturn 1;\n\t} else if (optind == argc) {\n\t\tprintf(\"No process name specified\\n\\n\");\n\t\tprintUsage(argc, argv);\n\t\treturn 1;\n\t}\n\n\t\/\/ Create recorder\n\trecorder = SystemRecorder::create();\n\tif (!recorder)\n\t\tgoto error;\n\n\tret = recorder->open(params.output.c_str());\n\tif (ret < 0)\n\t\tgoto error;\n\n\t\/\/ Create monitor\n\tcb.mSystemStats = systemStatsCb;\n\tcb.mProcessStats = processStatsCb;\n\tcb.mThreadStats = threadStatsCb;\n\tcb.mAcquisitionDuration = acquisitionDurationCb;\n\tcb.mUserdata = recorder;\n\n\tmonConfig.mRecordThreads = params.recordThreads;\n\n\tmon = SystemMonitor::create(monConfig, cb);\n\tif (!mon)\n\t\tgoto error;\n\n\tfor (int i = optind; i < argc; i++) {\n\t\tret = mon->addProcess(argv[i]);\n\t\tif (ret < 0) {\n\t\t\tprintf(\"addProcessFailed() : %d(%s)\\n\", -ret, strerror(-ret));\n\t\t\tgoto error;\n\t\t}\n\n\t}\n\n\tmon->loadProcesses();\n\n\t\/\/ Write program parameters\n\tbuildProgParameters(argc, argv, &progParameters);\n\trecorder->record(progParameters);\n\n\t\/\/ Write system config\n\tret = mon->readSystemConfig(&systemConfig);\n\tif (ret < 0) {\n\t\tprintf(\"readSystemConfig() failed : %d(%m)\\n\", errno);\n\t\tgoto error;\n\t}\n\n\trecorder->record(systemConfig);\n\n\t\/\/ Create stopfd\n\tret = eventfd(0, EFD_CLOEXEC);\n\tif (ret < 0) {\n\t\tprintf(\"eventfd() failed : %d(%m)\\n\", errno);\n\t\tgoto error;\n\t}\n\n\tctx.stopfd = ret;\n\n\tfds[0].fd = ctx.stopfd;\n\tfds[0].events = POLLIN;\n\tfds[0].revents = 0;\n\n\t\/\/ Create timer\n\tret = timerfd_create(CLOCK_MONOTONIC, EFD_CLOEXEC);\n\tif (ret < 0) {\n\t\tprintf(\"timerfd_create() failed : %d(%m)\\n\", errno);\n\t\tgoto error;\n\t}\n\n\tctx.timer = ret;\n\n\t\/\/ Start timer\n\ttimer.it_interval.tv_sec = params.period;\n\ttimer.it_interval.tv_nsec = 0;\n\n\ttimer.it_value.tv_sec = params.period;\n\ttimer.it_value.tv_nsec = 0;\n\n\tret = timerfd_settime(ctx.timer, 0, &timer, NULL);\n\tif (ret < 0) {\n\t\tprintf(\"timerfd_settime() failed : %d(%m)\\n\", errno);\n\t\tgoto error;\n\t}\n\n\tfds[1].fd = ctx.timer;\n\tfds[1].events = POLLIN;\n\tfds[1].revents = 0;\n\n\tfdsCount = 2;\n\n\t\/\/ Create duration timer\n\tif (params.duration > 0) {\n\t\tret = timerfd_create(CLOCK_MONOTONIC, EFD_CLOEXEC);\n\t\tif (ret < 0) {\n\t\t\tprintf(\"timerfd_create() failed : %d(%m)\\n\", errno);\n\t\t\tgoto error;\n\t\t}\n\n\t\tctx.durationTimer = ret;\n\n\t\t\/\/ Start timer\n\t\ttimer.it_value.tv_sec = params.duration;\n\t\ttimer.it_value.tv_nsec = 0;\n\n\t\ttimer.it_interval.tv_sec = 0;\n\t\ttimer.it_interval.tv_nsec = 0;\n\n\t\tret = timerfd_settime(ctx.durationTimer, 0, &timer, NULL);\n\t\tif (ret < 0) {\n\t\t\tprintf(\"timerfd_settime() failed : %d(%m)\\n\", errno);\n\t\t\tgoto error;\n\t\t}\n\n\t\tfds[2].fd = ctx.durationTimer;\n\t\tfds[2].events = POLLIN;\n\t\tfds[2].revents = 0;\n\n\t\tfdsCount++;\n\t} else {\n\t\tfds[2].fd = -1;\n\t\tfds[2].events = 0;\n\t\tfds[2].revents = 0;\n\t}\n\n\t\/\/ Start poll\n\twhile (true) {\n\t\tdo {\n\t\t\tret = poll(fds, fdsCount, -1);\n\t\t} while (ret == -1 && errno == EINTR);\n\n\t\tif (ret == -1) {\n\t\t\tprintf(\"poll() failed : %d(%m)\\n\", errno);\n\t\t\tgoto error;\n\t\t} else if (ret == 0) {\n\t\t\tprintf(\"poll() : timeout\\n\");\n\t\t\tcontinue;\n\t\t}\n\n\t\tif (ctx.stop)\n\t\t\tbreak;\n\n\t\tif (fds[1].revents & POLLIN) {\n\t\t\tuint64_t expirations;\n\n\t\t\tmon->process();\n\n\t\t\tret = read(fds[1].fd, &expirations, sizeof(expirations));\n\t\t\tif (ret < 0)\n\t\t\t\tprintf(\"read() failed : %d(%m)\\n\", errno);\n\t\t}\n\n\t\tif (fds[2].revents & POLLIN)\n\t\t\tbreak;\n\t}\n\n\trecorder->close();\n\n\tdelete mon;\n\tdelete recorder;\n\n\tif (ctx.stopfd != -1)\n\t\tclose(ctx.stopfd);\n\n\tif (ctx.timer != -1)\n\t\tclose(ctx.timer);\n\n\treturn 0;\n\nerror:\n\tdelete mon;\n\tdelete recorder;\n\n\tif (ctx.stopfd != -1)\n\t\tclose(ctx.stopfd);\n\n\tif (ctx.timer != -1)\n\t\tclose(ctx.timer);\n\n\treturn 1;\n}\n<commit_msg>Introduce output filename rotation<commit_after>#include <stdio.h>\n#include <stdlib.h>\n#include <string.h>\n#include <errno.h>\n#include <getopt.h>\n#include <signal.h>\n#include <poll.h>\n#include <unistd.h>\n#include <sys\/eventfd.h>\n#include <sys\/timerfd.h>\n#include <sys\/stat.h>\n\n#include <string>\n\n#include \"SystemRecorder.hpp\"\n#include \"SystemMonitor.hpp\"\n\n#define SIZEOF_ARRAY(array) (sizeof(array)\/sizeof(array[0]))\n\nstatic struct Context {\n\tbool stop;\n\tint stopfd;\n\tint timer;\n\tint durationTimer;\n\n\tContext()\n\t{\n\t\tstop = false;\n\t\tstopfd = -1;\n\t\ttimer = -1;\n\t\tdurationTimer = -1;\n\t}\n} ctx;\n\nstruct Params {\n\tbool help;\n\tstd::string output;\n\tint period;\n\tint duration;\n\tint recordThreads;\n\n\tParams()\n\t{\n\t\thelp = false;\n\t\tperiod = 1;\n\t\tduration = -1;\n\t\trecordThreads = true;\n\t}\n};\n\nstatic int readDecimalParam(int *out_v, const char *name)\n{\n\tchar *end;\n\tlong int v;\n\n\terrno = 0;\n\tv = strtol(optarg, &end, 10);\n\tif (errno != 0) {\n\t\tint ret = -errno;\n\t\tprintf(\"Unable to parse '%s' %s : %d(%m)\\n\",\n\t\t name, optarg, errno);\n\t\treturn ret;\n\t} else if (*end != '\\0') {\n\t\tprintf(\"'%s' arg '%s' is not decimal\\n\",\n\t\t name, optarg);\n\t\treturn -EINVAL;\n\t} else if (v <= 0) {\n\t\tprintf(\"'%s' arg '%s' is negative or null\\n\",\n\t\t name, optarg);\n\t\treturn -EINVAL;\n\t}\n\n\t*out_v = v;\n\n\treturn 0;\n}\n\nint parseArgs(int argc, char *argv[], Params *params)\n{\n\tint optionIndex = 0;\n\tint value;\n\tint ret;\n\n\tconst struct option argsOptions[] = {\n\t\t{ \"help\" , optional_argument, 0, 'h' },\n\t\t{ \"period\", optional_argument, 0, 'p' },\n\t\t{ \"duration\", optional_argument, 0, 'd' },\n\t\t{ \"output\", required_argument, 0, 'o' },\n\t\t{ \"disable-threads\", optional_argument, ¶ms->recordThreads, 0 },\n\t\t{ 0, 0, 0}\n\t};\n\n\twhile (true) {\n\t\tvalue = getopt_long(argc, argv, \"ho:p:d:\", argsOptions, &optionIndex);\n\t\tif (value == -1 || value == '?')\n\t\t\tbreak;\n\n\t\tswitch (value) {\n\t\tcase 'h':\n\t\t\tparams->help = true;\n\t\t\tbreak;\n\n\t\tcase 'o':\n\t\t\tparams->output = optarg;\n\t\t\tbreak;\n\n\t\tcase 'd':\n\t\t\tret = readDecimalParam(¶ms->duration, \"duration\");\n\t\t\tif (ret < 0)\n\t\t\t\treturn ret;\n\t\t\tbreak;\n\n\t\tcase 'p':\n\t\t\tret = readDecimalParam(¶ms->period, \"period\");\n\t\t\tif (ret < 0)\n\t\t\t\treturn ret;\n\t\t\tbreak;\n\n\t\tdefault:\n\t\t\tbreak;\n\t\t}\n\t}\n\n\treturn 0;\n}\n\nvoid printUsage(int argc, char *argv[])\n{\n\tprintf(\"Usage %s [-h] [-p PERIOD] -o OUTPUT process [process ...]\\n\",\n\t argv[0]);\n\n\tprintf(\"\\n\");\n\n\tprintf(\"positional arguments:\\n\");\n\tprintf(\" %-20s %s\\n\", \"process\", \"Process name to monitor\");\n\n\tprintf(\"\\n\");\n\n\tprintf(\"optional arguments:\\n\");\n\tprintf(\" %-20s %s\\n\", \"-h, --help\", \"show this help message and exit\");\n\tprintf(\" %-20s %s\\n\", \"-p, --period\", \"sample acquisition period (seconds). Default : 1\");\n\tprintf(\" %-20s %s\\n\", \"-d, --duration\", \"acquisition duration (seconds). Default : infinite\");\n\tprintf(\" %-20s %s\\n\", \"-o, --output\", \"output record file\");\n\tprintf(\" %-20s %s\\n\", \"--disable-threads\", \"disable threads recording\");\n}\n\nstatic void sighandler(int s)\n{\n\tint64_t stop = 1;\n\tint ret;\n\n\tprintf(\"stop\\n\");\n\tctx.stop = true;\n\tret = write(ctx.stopfd, &stop, sizeof(stop));\n\tif (ret < 0)\n\t\tprintf(\"write() failed : %d(%m)\\n\", errno);\n}\n\nstatic void systemStatsCb(\n\t\tconst SystemMonitor::SystemStats &stats,\n\t\tvoid *userdata)\n{\n\tSystemRecorder *recorder = (SystemRecorder *) userdata;\n\tint ret;\n\n\tret = recorder->record(stats);\n\tif (ret < 0)\n\t\tprintf(\"record() failed : %d(%s)\\n\", -ret, strerror(-ret));\n}\n\nstatic void processStatsCb(\n\t\tconst SystemMonitor::ProcessStats &stats,\n\t\tvoid *userdata)\n{\n\tSystemRecorder *recorder = (SystemRecorder *) userdata;\n\tint ret;\n\n\tret = recorder->record(stats);\n\tif (ret < 0)\n\t\tprintf(\"record() failed : %d(%s)\\n\", -ret, strerror(-ret));\n}\n\nstatic void threadStatsCb(\n\t\tconst SystemMonitor::ThreadStats &stats,\n\t\tvoid *userdata)\n{\n\tSystemRecorder *recorder = (SystemRecorder *) userdata;\n\tint ret;\n\n\tret = recorder->record(stats);\n\tif (ret < 0)\n\t\tprintf(\"record() failed : %d(%s)\\n\", -ret, strerror(-ret));\n}\n\nstatic void acquisitionDurationCb(\n\t\tconst SystemMonitor::AcquisitionDuration &stats,\n\t\tvoid *userdata)\n{\n\tSystemRecorder *recorder = (SystemRecorder *) userdata;\n\tint ret;\n\n\tret = recorder->record(stats);\n\tif (ret < 0)\n\t\tprintf(\"record() failed : %d(%s)\\n\", -ret, strerror(-ret));\n}\n\nstatic void buildProgParameters(int argc, char *argv[], ProgramParameters *out)\n{\n\tstd::string s;\n\n\ts = argv[0];\n\n\tfor (int i = 1; i < argc; i++)\n\t\ts += std::string(\" \") + std::string(argv[i]);\n\n\tsnprintf(out->mParams, sizeof(out->mParams), \"%s\", s.c_str());\n}\n\nstatic bool getOutputPath(const std::string &basePath, std::string *outPath)\n{\n\tstruct stat st;\n\tchar path[128];\n\tint ret;\n\tbool found = false;\n\n\tfor (int i = 0; i < 100; i++) {\n\t\tsnprintf(path, sizeof(path), \"%s-%02d.log\",\n\t\t\t basePath.c_str(), i);\n\n\t\tret = stat(path, &st);\n\t\tif (ret == -1 && errno == ENOENT) {\n\t\t\tfound = true;\n\t\t\t*outPath = path;\n\t\t\tbreak;\n\t\t}\n\t}\n\n\treturn found;\n}\n\nint main(int argc, char *argv[])\n{\n\tstruct itimerspec timer;\n\tstruct pollfd fds[3];\n\tint fdsCount;\n\tParams params;\n\tstd::string outputPath;\n\tProgramParameters progParameters;\n\tSystemMonitor::SystemConfig systemConfig;\n\tSystemMonitor::Callbacks cb;\n\tSystemMonitor *mon = nullptr;\n\tSystemMonitor::Config monConfig;\n\tSystemRecorder *recorder = nullptr;\n\tint ret;\n\n\tsignal(SIGINT, sighandler);\n\n\t\/\/ Parse parameters\n\tif (argc == 1) {\n\t\tprintUsage(argc, argv);\n\t\treturn 0;\n\t}\n\n\tret = parseArgs(argc, argv, ¶ms);\n\tif (ret < 0) {\n\t\tprintUsage(argc, argv);\n\t\treturn 1;\n\t} else if (params.output.empty()) {\n\t\tprintf(\"No output file specified\\n\\n\");\n\t\tprintUsage(argc, argv);\n\t\treturn 1;\n\t} else if (optind == argc) {\n\t\tprintf(\"No process name specified\\n\\n\");\n\t\tprintUsage(argc, argv);\n\t\treturn 1;\n\t}\n\n\t\/\/ Create recorder\n\trecorder = SystemRecorder::create();\n\tif (!recorder)\n\t\tgoto error;\n\n\tif (!getOutputPath(params.output, &outputPath)) {\n\t\tprintf(\"Can find a new output file path\\n\");\n\t\treturn 1;\n\t}\n\n\tprintf(\"Recording in file %s\\n\", outputPath.c_str());\n\tret = recorder->open(outputPath.c_str());\n\tif (ret < 0)\n\t\tgoto error;\n\n\t\/\/ Create monitor\n\tcb.mSystemStats = systemStatsCb;\n\tcb.mProcessStats = processStatsCb;\n\tcb.mThreadStats = threadStatsCb;\n\tcb.mAcquisitionDuration = acquisitionDurationCb;\n\tcb.mUserdata = recorder;\n\n\tmonConfig.mRecordThreads = params.recordThreads;\n\n\tmon = SystemMonitor::create(monConfig, cb);\n\tif (!mon)\n\t\tgoto error;\n\n\tfor (int i = optind; i < argc; i++) {\n\t\tret = mon->addProcess(argv[i]);\n\t\tif (ret < 0) {\n\t\t\tprintf(\"addProcessFailed() : %d(%s)\\n\", -ret, strerror(-ret));\n\t\t\tgoto error;\n\t\t}\n\n\t}\n\n\tmon->loadProcesses();\n\n\t\/\/ Write program parameters\n\tbuildProgParameters(argc, argv, &progParameters);\n\trecorder->record(progParameters);\n\n\t\/\/ Write system config\n\tret = mon->readSystemConfig(&systemConfig);\n\tif (ret < 0) {\n\t\tprintf(\"readSystemConfig() failed : %d(%m)\\n\", errno);\n\t\tgoto error;\n\t}\n\n\trecorder->record(systemConfig);\n\n\t\/\/ Create stopfd\n\tret = eventfd(0, EFD_CLOEXEC);\n\tif (ret < 0) {\n\t\tprintf(\"eventfd() failed : %d(%m)\\n\", errno);\n\t\tgoto error;\n\t}\n\n\tctx.stopfd = ret;\n\n\tfds[0].fd = ctx.stopfd;\n\tfds[0].events = POLLIN;\n\tfds[0].revents = 0;\n\n\t\/\/ Create timer\n\tret = timerfd_create(CLOCK_MONOTONIC, EFD_CLOEXEC);\n\tif (ret < 0) {\n\t\tprintf(\"timerfd_create() failed : %d(%m)\\n\", errno);\n\t\tgoto error;\n\t}\n\n\tctx.timer = ret;\n\n\t\/\/ Start timer\n\ttimer.it_interval.tv_sec = params.period;\n\ttimer.it_interval.tv_nsec = 0;\n\n\ttimer.it_value.tv_sec = params.period;\n\ttimer.it_value.tv_nsec = 0;\n\n\tret = timerfd_settime(ctx.timer, 0, &timer, NULL);\n\tif (ret < 0) {\n\t\tprintf(\"timerfd_settime() failed : %d(%m)\\n\", errno);\n\t\tgoto error;\n\t}\n\n\tfds[1].fd = ctx.timer;\n\tfds[1].events = POLLIN;\n\tfds[1].revents = 0;\n\n\tfdsCount = 2;\n\n\t\/\/ Create duration timer\n\tif (params.duration > 0) {\n\t\tret = timerfd_create(CLOCK_MONOTONIC, EFD_CLOEXEC);\n\t\tif (ret < 0) {\n\t\t\tprintf(\"timerfd_create() failed : %d(%m)\\n\", errno);\n\t\t\tgoto error;\n\t\t}\n\n\t\tctx.durationTimer = ret;\n\n\t\t\/\/ Start timer\n\t\ttimer.it_value.tv_sec = params.duration;\n\t\ttimer.it_value.tv_nsec = 0;\n\n\t\ttimer.it_interval.tv_sec = 0;\n\t\ttimer.it_interval.tv_nsec = 0;\n\n\t\tret = timerfd_settime(ctx.durationTimer, 0, &timer, NULL);\n\t\tif (ret < 0) {\n\t\t\tprintf(\"timerfd_settime() failed : %d(%m)\\n\", errno);\n\t\t\tgoto error;\n\t\t}\n\n\t\tfds[2].fd = ctx.durationTimer;\n\t\tfds[2].events = POLLIN;\n\t\tfds[2].revents = 0;\n\n\t\tfdsCount++;\n\t} else {\n\t\tfds[2].fd = -1;\n\t\tfds[2].events = 0;\n\t\tfds[2].revents = 0;\n\t}\n\n\t\/\/ Start poll\n\twhile (true) {\n\t\tdo {\n\t\t\tret = poll(fds, fdsCount, -1);\n\t\t} while (ret == -1 && errno == EINTR);\n\n\t\tif (ret == -1) {\n\t\t\tprintf(\"poll() failed : %d(%m)\\n\", errno);\n\t\t\tgoto error;\n\t\t} else if (ret == 0) {\n\t\t\tprintf(\"poll() : timeout\\n\");\n\t\t\tcontinue;\n\t\t}\n\n\t\tif (ctx.stop)\n\t\t\tbreak;\n\n\t\tif (fds[1].revents & POLLIN) {\n\t\t\tuint64_t expirations;\n\n\t\t\tmon->process();\n\n\t\t\tret = read(fds[1].fd, &expirations, sizeof(expirations));\n\t\t\tif (ret < 0)\n\t\t\t\tprintf(\"read() failed : %d(%m)\\n\", errno);\n\t\t}\n\n\t\tif (fds[2].revents & POLLIN)\n\t\t\tbreak;\n\t}\n\n\trecorder->close();\n\n\tdelete mon;\n\tdelete recorder;\n\n\tif (ctx.stopfd != -1)\n\t\tclose(ctx.stopfd);\n\n\tif (ctx.timer != -1)\n\t\tclose(ctx.timer);\n\n\treturn 0;\n\nerror:\n\tdelete mon;\n\tdelete recorder;\n\n\tif (ctx.stopfd != -1)\n\t\tclose(ctx.stopfd);\n\n\tif (ctx.timer != -1)\n\t\tclose(ctx.timer);\n\n\treturn 1;\n}\n<|endoftext|>"} {"text":"<commit_before>\/**\n * Copyright 2016 Michal Korbela, Filip Pokrývka, Ondřej Slámečka\n * See the LICENSE file for more information.\n *\/\n\n#include <bits\/stdc++.h>\n\n\/\/#include \"..\/mnist\/include\/mnist\/mnist_reader.hpp\"\n\n#include \"brca_image.hpp\"\n\n#include \"MLP.hpp\"\n\nstruct Stats {\n int corr;\n int unsure;\n int fail;\n};\n\nstd::vector<double> transform(bool i) {\n std::vector<double> v;\n if(i) {\n v.push_back(0); v.push_back(1);\n }\n else {\n v.push_back(1); v.push_back(0);\n }\n return v;\n}\n\ndouble validate(MLP &nn, std::vector<BrcaImage> &validation) {\n Stats stats = {0,0,0};\n std::vector<double> r1, r2;\n for(unsigned i = 0; i<validation.size(); i++) {\n r1 = nn.feed(validation[i].data);\n if(r1[0]<0.5) r1[0] = 0;\n else r1[0] = 1;\n if(r1[1]<0.5) r1[1] = 0;\n else r1[1] = 1;\n if(r1 == transform(validation[i].malignant)) {\n stats.corr++;\n }\n else if (r2 == transform(!validation[i].malignant) ){\n stats.fail++;\n }\n else {\n stats.unsure++;\n }\n }\n std::cout << (stats.corr*100.0)\/validation.size() << \" %: \" << stats.corr << \"\/\" << validation.size() << \" (\" << stats.unsure << \" unsure), \";\n return (stats.corr*100.0)\/validation.size();\n}\n\nvoid normalize(std::vector<BrcaImage> &input, double a, double b) {\n double min_input = input[0].data[0];\n double max_input = input[0].data[0];\n for(auto & img: input) \n for(auto & data: img.data) {\n if (data<min_input)\n min_input = data;\n if (data>max_input)\n max_input = data;\n }\n a = (max_input + min_input) \/ 2;\n b = (max_input - min_input) \/ 2;\n std::cout << \"using normalisation constants: (X-\" << a << \")\/\" << b << \"\\n\";\n for(auto & img: input) \n for(auto & data: img.data)\n data = (data-a)\/b;\n\n \/\/ test of normalisation\n int bad = 0;\n for(auto & img: input)\n for(auto & data: img.data) {\n if(data < -1 || data > 1)\n bad++;\n }\n if(bad) {\n std::cout << \"normalization went wrong, \" << bad << \" numbers are not in range <-1,1>\\n\";\n }\n else {\n std::cout << \"data normalized successfully\\n\";\n }\n}\n\n\nint main(int argc, char** argv) {\n if (argc < 2)\n throw std::invalid_argument(\"No data file specified \"\n \"please provide it as first parameter\");\n if (argc < 3)\n throw std::invalid_argument(\"No training set size specified \"\n \"please provide it as second parameter\");\n if (argc < 4)\n throw std::invalid_argument(\"No validation set size specified \"\n \"please provide it as third parameter (can be 0)\");\n \n unsigned training_size;\n unsigned validation_size;\n \n std::stringstream ss;\n ss << argv[2] << \" \" << argv[3];\n ss >> training_size >> validation_size;\n\n std::vector<BrcaImage> all_data = parse_brca_dataset(argv[1]);\n double a=0, b=0;\n normalize(all_data, a, b);\n \n unsigned tot_size = training_size + validation_size;\n if (tot_size > all_data.size())\n throw std::invalid_argument(\"please decrease training or validation set size\");\n\n\n\n \n std::vector<BrcaImage> training, validation;\n for(unsigned i = 0; i<training_size; ++i) {\n training.push_back(all_data[i]);\n }\n if (validation_size == 0)\n validation = all_data;\n else {\n for(unsigned i = training_size; i<tot_size; ++i) \n validation.push_back(all_data[i]);\n }\n\n unsigned queue_size = 10000000;\n unsigned interval = 100;\n double treshold = 93.0;\n\n MLP nn({30,2});\n nn.randomize_weights(-1, 1);\n int i = -1;\n\n while(validate(nn, validation) < treshold) {\n ++i;\n std::cout << i*interval << std::endl;\n \/\/ if efficiency does not grow for queue_size intervals, randomize weights\n for(unsigned i = 0; i<interval; i++) {\n for(unsigned j = 0; j<training_size; j++) {\n nn.learn(training[j].data, transform(training[j].malignant), 0.5, 0.1);\n }\n }\n }\n\n validate(nn, all_data);\n std::cout << queue_size*interval << \"\\n\";\n\n return 0;\n}\n<commit_msg>final version od main.cpp<commit_after>\/**\n * Copyright 2016 Michal Korbela, Filip Pokrývka, Ondřej Slámečka\n * See the LICENSE file for more information.\n *\/\n\n#include <bits\/stdc++.h>\n\n#include \"brca_image.hpp\"\n\n#include \"MLP.hpp\"\n\nstruct Stats {\n int corr;\n int unsure;\n int fail;\n};\n\nstd::vector<double> transform(bool i) {\n std::vector<double> v;\n if(i) {\n v.push_back(0); v.push_back(1);\n }\n else {\n v.push_back(1); v.push_back(0);\n }\n return v;\n}\n\ndouble validate(MLP &nn, std::vector<BrcaImage> &validation) {\n Stats stats = {0,0,0};\n std::vector<double> r1, r2;\n for (unsigned i = 0; i<validation.size(); i++) {\n r1 = nn.feed(validation[i].data);\n if(r1[0]<0.5) r1[0] = 0;\n else r1[0] = 1;\n if(r1[1]<0.5) r1[1] = 0;\n else r1[1] = 1;\n if(r1 == transform(validation[i].malignant)) {\n stats.corr++;\n }\n else if (r2 == transform(!validation[i].malignant) ){\n stats.fail++;\n }\n else {\n stats.unsure++;\n }\n }\n std::cout << (stats.corr*100.0)\/validation.size() << \"%: \" << stats.corr << \"\/\" << validation.size() << \" (\" << stats.fail << \" incorrect, \" << stats.unsure << \" unsure)\\n\";\n return (stats.corr*100.0)\/validation.size();\n}\n\nvoid normalize(std::vector<BrcaImage> &input, double a, double b) {\n double min_input = input[0].data[0];\n double max_input = input[0].data[0];\n for (auto & img: input) \n for (auto & data: img.data) {\n if (data<min_input)\n min_input = data;\n if (data>max_input)\n max_input = data;\n }\n a = (max_input + min_input) \/ 2;\n b = (max_input - min_input) \/ 2;\n std::cout << \"using normalization constants: (X-\" << a << \")\/\" << b << \"\\n\";\n for (auto & img: input) \n for (auto & data: img.data)\n data = (data-a)\/b;\n\n \/\/ test of normalisation\n int bad = 0;\n for (auto & img: input)\n for (auto & data: img.data) {\n if (data < -1 || data > 1)\n bad++;\n }\n if (bad)\n std::cout << \"normalization went wrong, \" << bad << \" numbers are not in range <-1,1>\\n\";\n else\n std::cout << \"data normalized successfully\\n\";\n}\n\n\nint main(int argc, char** argv) {\n if (argc < 2)\n throw std::invalid_argument(\"No data file specified\\n\"\n \"USAGE: bin\/nn traiing_file_name training_set_size\"\n );\n if (argc < 3)\n throw std::invalid_argument(\"No training set size specified \"\n \"USAGE: bin\/nn traiing_file_name training_set_size\"\n );\n \n unsigned training_size;\n \n std::stringstream ss;\n ss << argv[2];\n ss >> training_size;\n\n std::vector<BrcaImage> all_data = parse_brca_dataset(argv[1]);\n double a=0, b=0;\n normalize(all_data, a, b);\n \n if (training_size > all_data.size())\n throw std::invalid_argument(\"please decrease training set size\");\n\n std::vector<BrcaImage> training, validation;\n for(unsigned i = 0; i<training_size; ++i) \n training.push_back(all_data[i]);\n \n \/\/ how often is validation run\n unsigned interval = 1000;\n \/\/ when to stop\n double treshold = 92.5;\n\n MLP nn({30,2});\n nn.randomize_weights(-1, 1);\n int i = -1;\n\n while (validate(nn, all_data) < treshold) {\n ++i;\n for (unsigned i = 0; i<interval; i++)\n for (unsigned j = 0; j<training_size; j++)\n nn.learn(training[j].data, transform(training[j].malignant), 0.5, 0.0);\n }\n\n std::cout << \"Learning finished, reached treshold \" << treshold << \"%\" << std::endl;\n\n return 0;\n}\n<|endoftext|>"} {"text":"<commit_before>\/*\n * This program is free software; you can redistribute it and\/or modify it under\n * the terms of the GNU General Public License as published by the Free Software\n * Foundation; version 3 of the License.\n *\n * This program is distributed in the hope that it will be useful, but WITHOUT\n * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS\n * FOR A PARTICULAR PURPOSE. See the GNU General Public License for more\n * details.\n *\/\n\n\n#include <QtGui\/QApplication>\n#include \"config.h\"\n#include \"dbmanager.h\"\n#include \"iconmanager.h\"\n#include \"mainwindow.h\"\n#include \"sqlhighlighter.h\"\n#include \"tabwidget\/abstracttabwidget.h\"\n#include \"widgets\/querytextedit.h\"\n\nint main(int argc, char *argv[])\n{\n QApplication::setApplicationName(\"dbmaster\");\n QApplication::setApplicationVersion(\"0.7.4\");\n QApplication::setOrganizationDomain(\"dbmaster.sourceforge.net\");\n QApplication a(argc, argv);\n\n QSplashScreen splash(QPixmap(\":\/img\/splash.png\"));\n splash.show();\n\n \/\/ Loading translations\n splash.showMessage(QObject::tr(\"Loading translations...\"), Qt::AlignBottom);\n\n QTranslator translator;\n \/\/ getting the current locale\n QString lang = QLocale::system().name();\n QString transdir;\n#if defined(Q_WS_X11)\n \/\/ for *nix\n transdir = QString(PREFIX).append(\"\/share\/dbmaster\/tr\");\n#endif\n\n#if defined(Q_WS_WIN)\n transdir = \"share\/tr\";\n#endif\n\n QString path;\n \/* on teste d'abord si le .qm est dans le dossier courant -> alors on est en\n * dev, on le charge, sinon il est dans le répertoire d'installation. *\/\n path = QDir::currentPath() + QString(\"\/tr\/%1.qm\").arg(lang);\n if (!QFile::exists(path))\n path = transdir.append(\"\/%1.qm\").arg(lang);\n translator.load(path);\n a.installTranslator(&translator);\n \n QTranslator qtTranslator;\n qtTranslator.load(\"qt_\" + lang,\n#if defined (Q_WS_X11)\n QLibraryInfo::location(QLibraryInfo::TranslationsPath));\n#endif\n#if defined (Q_WS_WIN)\n QDir::currentPath());\n#endif\n a.installTranslator(&qtTranslator);\n\n splash.showMessage(QObject::tr(\"Initialization...\"), Qt::AlignBottom);\n\n IconManager::init();\n DbManager::init();\n Config::init();\n QueryTextEdit::reloadCompleter();\n\n MainWindow *w = new MainWindow();\n w->show();\n splash.finish(w);\n return a.exec();\n}\n<commit_msg>No version<commit_after>\/*\n * This program is free software; you can redistribute it and\/or modify it under\n * the terms of the GNU General Public License as published by the Free Software\n * Foundation; version 3 of the License.\n *\n * This program is distributed in the hope that it will be useful, but WITHOUT\n * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS\n * FOR A PARTICULAR PURPOSE. See the GNU General Public License for more\n * details.\n *\/\n\n\n#include <QtGui\/QApplication>\n#include \"config.h\"\n#include \"dbmanager.h\"\n#include \"iconmanager.h\"\n#include \"mainwindow.h\"\n#include \"sqlhighlighter.h\"\n#include \"tabwidget\/abstracttabwidget.h\"\n#include \"widgets\/querytextedit.h\"\n\nint main(int argc, char *argv[])\n{\n QApplication::setApplicationName(\"dbmaster\");\n QApplication::setApplicationVersion(\"0.7.5\");\n QApplication::setOrganizationDomain(\"dbmaster.sourceforge.net\");\n QApplication a(argc, argv);\n\n QSplashScreen splash(QPixmap(\":\/img\/splash.png\"));\n splash.show();\n\n \/\/ Loading translations\n splash.showMessage(QObject::tr(\"Loading translations...\"), Qt::AlignBottom);\n\n QTranslator translator;\n \/\/ getting the current locale\n QString lang = QLocale::system().name();\n QString transdir;\n#if defined(Q_WS_X11)\n \/\/ for *nix\n transdir = QString(PREFIX).append(\"\/share\/dbmaster\/tr\");\n#endif\n\n#if defined(Q_WS_WIN)\n transdir = \"share\/tr\";\n#endif\n\n QString path;\n \/* on teste d'abord si le .qm est dans le dossier courant -> alors on est en\n * dev, on le charge, sinon il est dans le répertoire d'installation. *\/\n path = QDir::currentPath() + QString(\"\/tr\/%1.qm\").arg(lang);\n if (!QFile::exists(path))\n path = transdir.append(\"\/%1.qm\").arg(lang);\n translator.load(path);\n a.installTranslator(&translator);\n \n QTranslator qtTranslator;\n qtTranslator.load(\"qt_\" + lang,\n#if defined (Q_WS_X11)\n QLibraryInfo::location(QLibraryInfo::TranslationsPath));\n#endif\n#if defined (Q_WS_WIN)\n QDir::currentPath());\n#endif\n a.installTranslator(&qtTranslator);\n\n splash.showMessage(QObject::tr(\"Initialization...\"), Qt::AlignBottom);\n\n IconManager::init();\n DbManager::init();\n Config::init();\n QueryTextEdit::reloadCompleter();\n\n MainWindow *w = new MainWindow();\n w->show();\n splash.finish(w);\n return a.exec();\n}\n<|endoftext|>"} {"text":"<commit_before>\/*\n * Copyright (C) 2014 Luke San Antonio\n * All rights reserved.\n *\/\n#include <fstream>\n#include <sstream>\n#include <cstdlib>\n#include <vector>\n\n#include \"common\/log.h\"\n\n#include \"gfx\/mesh.h\"\n#include \"gfx\/program.h\"\n#include \"gfx\/pipeline.h\"\n\n#include \"glad\/glad.h\"\n#include \"glfw3.h\"\n\n#include \"glm\/glm.hpp\"\n#include \"glm\/gtc\/matrix_transform.hpp\"\n\n#include \"uv.h\"\n\n#define CATCH_CONFIG_RUNNER\n#include \"catch\/catch.hpp\"\n\nstruct Command_Options\n{\n bool test = false;\n};\n\nCommand_Options parse_command_line(int argc, char** argv)\n{\n Command_Options opt;\n for(int i = 0; i < argc; ++i)\n {\n auto option = argv[i];\n if(strcmp(option, \"--test\") == 0)\n {\n opt.test = true;\n }\n }\n return opt;\n}\n\nint main(int argc, char** argv)\n{\n using namespace survive;\n\n uv_chdir(\"assets\/\");\n\n \/\/ Initialize logger.\n Scoped_Log_Init log_init_raii_lock{};\n\n \/\/ Parse command line arguments.\n auto options = parse_command_line(argc - 1, argv+1);\n\n \/\/ Should be run the testing whatchamacallit?\n if(options.test)\n {\n int result = Catch::Session().run(1, argv);\n if(result)\n {\n return EXIT_FAILURE;\n }\n }\n\n \/\/ Init glfw.\n if(!glfwInit())\n return EXIT_FAILURE;\n\n auto window = glfwCreateWindow(1000, 1000, \"Hello World\", NULL, NULL);\n if(!window)\n {\n glfwTerminate();\n return EXIT_FAILURE;\n }\n\n \/\/ Init context + load gl functions.\n glfwMakeContextCurrent(window);\n gladLoadGLLoader((GLADloadproc) glfwGetProcAddress);\n\n \/\/ Log glfw version.\n log_i(\"Initialized GLFW %\", glfwGetVersionString());\n\n int maj = glfwGetWindowAttrib(window, GLFW_CONTEXT_VERSION_MAJOR);\n int min = glfwGetWindowAttrib(window, GLFW_CONTEXT_VERSION_MINOR);\n int rev = glfwGetWindowAttrib(window, GLFW_CONTEXT_REVISION);\n\n \/\/ Log GL profile.\n log_i(\"OpenGL core profile %.%.%\", maj, min, rev);\n\n \/\/ Initialize the graphics pipeline.\n auto pipeline = gfx::Pipeline{};\n\n \/\/ Load a shader program.\n auto shader_program = gfx::Program::from_files(\"shader\/diffuse\/vertex\",\n \"shader\/diffuse\/fragment\");\n \/\/ Prepare a mesh for rendering.\n auto mesh = pipeline.prepare_mesh(Mesh::from_file(\"obj\/plane.obj\"));\n\n int fps = 0;\n int time = glfwGetTime();\n\n \/\/ Set up some pre-rendering state.\n glClearColor(.75, .34, .50, 1.0);\n glClearDepth(1);\n\n glEnable(GL_DEPTH_TEST);\n glDepthFunc(GL_LEQUAL);\n\n \/\/ Use our shader.\n shader_program.use();\n\n float deg = -5;\n while(!glfwWindowShouldClose(window))\n {\n ++fps;\n\n \/\/ Create our matrix.\n\n \/\/glm::mat4 view = glm::lookAt(glm::vec3(0, 10, 0), glm::vec3(0, 0, 0),\n \/\/glm::vec3(0, 0, 1));\n \/\/glm::mat4 perspective = glm::frustum(-1, 1, -1, 1, -1, 1);\n \/\/glm::mat4 perspective = glm::ortho(-1, 1, -1, 1, -1, 1);\n glm::mat4 view(1.0);\n view = glm::lookAt(glm::vec3(0, 0, 15), glm::vec3(0, 0, 0),\n glm::vec3(0, 1, 0));\n glm::mat4 perspective(1.0);\n perspective = glm::perspective(45., 1., .01, 30.);\n\n auto model = glm::mat4(1.0);\n\n \/\/ rotate 90 degrees ccw\n \/\/model = glm::translate(model, glm::vec3(0, cam_height, 0));\n model = glm::rotate(model, -3.14159f \/ 2.0f, glm::vec3(0, 1, 0));\n model = glm::rotate(model, deg, glm::vec3(0, 1, 0));\n \/\/model = glm::translate(model, glm::vec3(0, 0, 0));\n \/\/model = glm::translate(model, glm::vec3(0, 0, 7));\n model = glm::scale(model, glm::vec3(5));\n\n deg += .001;\n\n glm::mat4 mvp = perspective * view * model;\n\n \/\/ Set the matrix in the program.\n \/\/ TODO this seems bad, change this.\n shader_program.set_uniform_mat4(\"mvp\", mvp);\n\n \/\/ Clear the screen and render.\n pipeline.clear();\n pipeline.render_pipeline_mesh(mesh);\n\n \/\/ Show it on screen.\n glfwSwapBuffers(window);\n glfwPollEvents();\n\n if(int(glfwGetTime()) != time)\n {\n time = glfwGetTime();\n log_d(\"fps: %\", fps);\n fps = 0;\n }\n }\n\n glfwTerminate();\n return 0;\n}\n<commit_msg>New clear color.<commit_after>\/*\n * Copyright (C) 2014 Luke San Antonio\n * All rights reserved.\n *\/\n#include <fstream>\n#include <sstream>\n#include <cstdlib>\n#include <vector>\n\n#include \"common\/log.h\"\n\n#include \"gfx\/mesh.h\"\n#include \"gfx\/program.h\"\n#include \"gfx\/pipeline.h\"\n\n#include \"glad\/glad.h\"\n#include \"glfw3.h\"\n\n#include \"glm\/glm.hpp\"\n#include \"glm\/gtc\/matrix_transform.hpp\"\n\n#include \"uv.h\"\n\n#define CATCH_CONFIG_RUNNER\n#include \"catch\/catch.hpp\"\n\nstruct Command_Options\n{\n bool test = false;\n};\n\nCommand_Options parse_command_line(int argc, char** argv)\n{\n Command_Options opt;\n for(int i = 0; i < argc; ++i)\n {\n auto option = argv[i];\n if(strcmp(option, \"--test\") == 0)\n {\n opt.test = true;\n }\n }\n return opt;\n}\n\nint main(int argc, char** argv)\n{\n using namespace survive;\n\n uv_chdir(\"assets\/\");\n\n \/\/ Initialize logger.\n Scoped_Log_Init log_init_raii_lock{};\n\n \/\/ Parse command line arguments.\n auto options = parse_command_line(argc - 1, argv+1);\n\n \/\/ Should be run the testing whatchamacallit?\n if(options.test)\n {\n int result = Catch::Session().run(1, argv);\n if(result)\n {\n return EXIT_FAILURE;\n }\n }\n\n \/\/ Init glfw.\n if(!glfwInit())\n return EXIT_FAILURE;\n\n auto window = glfwCreateWindow(1000, 1000, \"Hello World\", NULL, NULL);\n if(!window)\n {\n glfwTerminate();\n return EXIT_FAILURE;\n }\n\n \/\/ Init context + load gl functions.\n glfwMakeContextCurrent(window);\n gladLoadGLLoader((GLADloadproc) glfwGetProcAddress);\n\n \/\/ Log glfw version.\n log_i(\"Initialized GLFW %\", glfwGetVersionString());\n\n int maj = glfwGetWindowAttrib(window, GLFW_CONTEXT_VERSION_MAJOR);\n int min = glfwGetWindowAttrib(window, GLFW_CONTEXT_VERSION_MINOR);\n int rev = glfwGetWindowAttrib(window, GLFW_CONTEXT_REVISION);\n\n \/\/ Log GL profile.\n log_i(\"OpenGL core profile %.%.%\", maj, min, rev);\n\n \/\/ Initialize the graphics pipeline.\n auto pipeline = gfx::Pipeline{};\n\n \/\/ Load a shader program.\n auto shader_program = gfx::Program::from_files(\"shader\/diffuse\/vertex\",\n \"shader\/diffuse\/fragment\");\n \/\/ Prepare a mesh for rendering.\n auto mesh = pipeline.prepare_mesh(Mesh::from_file(\"obj\/plane.obj\"));\n\n int fps = 0;\n int time = glfwGetTime();\n\n \/\/ Set up some pre-rendering state.\n glClearColor(0.509, .694, .737, 1.0);\n glClearDepth(1);\n\n glEnable(GL_DEPTH_TEST);\n glDepthFunc(GL_LEQUAL);\n\n \/\/ Use our shader.\n shader_program.use();\n\n float deg = -5;\n while(!glfwWindowShouldClose(window))\n {\n ++fps;\n\n \/\/ Create our matrix.\n\n \/\/glm::mat4 view = glm::lookAt(glm::vec3(0, 10, 0), glm::vec3(0, 0, 0),\n \/\/glm::vec3(0, 0, 1));\n \/\/glm::mat4 perspective = glm::frustum(-1, 1, -1, 1, -1, 1);\n \/\/glm::mat4 perspective = glm::ortho(-1, 1, -1, 1, -1, 1);\n glm::mat4 view(1.0);\n view = glm::lookAt(glm::vec3(0, 0, 15), glm::vec3(0, 0, 0),\n glm::vec3(0, 1, 0));\n glm::mat4 perspective(1.0);\n perspective = glm::perspective(45., 1., .01, 30.);\n\n auto model = glm::mat4(1.0);\n\n \/\/ rotate 90 degrees ccw\n \/\/model = glm::translate(model, glm::vec3(0, cam_height, 0));\n model = glm::rotate(model, -3.14159f \/ 2.0f, glm::vec3(0, 1, 0));\n model = glm::rotate(model, deg, glm::vec3(0, 1, 0));\n \/\/model = glm::translate(model, glm::vec3(0, 0, 0));\n \/\/model = glm::translate(model, glm::vec3(0, 0, 7));\n model = glm::scale(model, glm::vec3(5));\n\n deg += .001;\n\n glm::mat4 mvp = perspective * view * model;\n\n \/\/ Set the matrix in the program.\n \/\/ TODO this seems bad, change this.\n shader_program.set_uniform_mat4(\"mvp\", mvp);\n\n \/\/ Clear the screen and render.\n pipeline.clear();\n pipeline.render_pipeline_mesh(mesh);\n\n \/\/ Show it on screen.\n glfwSwapBuffers(window);\n glfwPollEvents();\n\n if(int(glfwGetTime()) != time)\n {\n time = glfwGetTime();\n log_d(\"fps: %\", fps);\n fps = 0;\n }\n }\n\n glfwTerminate();\n return 0;\n}\n<|endoftext|>"} {"text":"<commit_before>\n\n#include <iostream>\n\n#include \"rapidxml.hpp\"\n#include \"rapidxml_utils.hpp\"\n#include \"rapidxml_print.hpp\"\n\nnamespace {\n\nbool ignore_package(const std::string& name, const std::vector<std::string>& ignore_packages){\n for(auto& ignore : ignore_packages){\n if(std::mismatch(ignore.begin(), ignore.end(), name.begin()).first == ignore.end()){\n return true;\n }\n }\n\n return false;\n}\n\n} \/\/end of anonymous namespace\n\nint main(int argc, char* argv[]){\n \/\/Argument counter\n std::size_t i = 1;\n\n \/\/Collect the packages to ignore\n std::vector<std::string> ignore_packages;\n for(; i < std::size_t(argc); ++i){\n std::string arg(argv[i]);\n\n std::string ignore(\"--ignore=\");\n\n if(std::mismatch(ignore.begin(), ignore.end(), arg.begin()).first == ignore.end()){\n ignore_packages.emplace_back(arg.begin() + ignore.size(), arg.end());\n } else {\n break;\n }\n }\n\n if(argc - i + 1 < 4){\n std::cout << \"coverage_merger: not enough arguments\" << std::endl;\n return 1;\n }\n\n \/\/Collect the paths\n std::string source_path(argv[i]);\n std::string inc_path(argv[i+1]);\n std::string target_path(argv[i+2]);\n\n std::cout << \"Source file: \" << source_path << std::endl;\n std::cout << \"Increment file: \" << inc_path << std::endl;\n std::cout << \"Target file: \" << target_path << std::endl;\n\n rapidxml::file<> source_file(source_path.c_str());\n rapidxml::xml_document<> source_doc;\n source_doc.parse<0>(source_file.data());\n\n rapidxml::file<> inc_file(inc_path.c_str());\n rapidxml::xml_document<> inc_doc;\n inc_doc.parse<0>(inc_file.data());\n\n rapidxml::xml_document<> target_doc;\n\n std::cout << \"Documents parsed\" << std::endl;\n\n \/\/Find the root nodes\n auto source_root_node = source_doc.first_node(\"coverage\");\n auto inc_root_node = inc_doc.first_node(\"coverage\");\n\n \/\/Find the \"packages\" nodes\n auto packages_source = source_root_node->first_node(\"packages\");\n auto packages_inc = inc_root_node->first_node(\"packages\");\n\n \/\/Create root node in target\n auto* target_root_node = target_doc.allocate_node(rapidxml::node_element, \"coverage\");\n \/\/TODO Copy attributes from source\n target_doc.append_node(target_root_node);\n\n \/\/Copy directly the \"sources\" node\n auto* target_sources_node = source_doc.clone_node(source_root_node->first_node(\"sources\"));\n target_root_node->append_node(target_sources_node);\n\n \/\/Create the \"packages\" node\n auto packages_target = target_doc.allocate_node(rapidxml::node_element, \"packages\");\n target_root_node->append_node(packages_target);\n\n \/\/1. Copy all relevant packages from source -> target\n\n for(auto* package_node = packages_source->first_node(\"package\"); package_node; package_node = package_node->next_sibling()){\n std::string package_name(package_node->first_attribute(\"name\")->value());\n std::string package_branch_rate(package_node->first_attribute(\"branch-rate\")->value());\n std::string package_line_rate(package_node->first_attribute(\"line-rate\")->value());\n\n \/\/Skip any ignored package\n bool process = !ignore_package(package_name, ignore_packages);\n\n \/\/Skip the entire package is no coverage\n if(package_branch_rate == \"0.0\" && package_line_rate == \"0.0\"){\n process = false;\n }\n\n if(process){\n \/\/Create the \"package\" node\n auto package_target = target_doc.allocate_node(rapidxml::node_element, \"package\");\n package_target->append_attribute(target_doc.allocate_attribute(\"name\", package_node->first_attribute(\"name\")->value()));\n package_target->append_attribute(target_doc.allocate_attribute(\"branch-rate\", package_node->first_attribute(\"branch-rate\")->value()));\n package_target->append_attribute(target_doc.allocate_attribute(\"line-rate\", package_node->first_attribute(\"line-rate\")->value()));\n package_target->append_attribute(target_doc.allocate_attribute(\"complexity\", package_node->first_attribute(\"complexity\")->value()));\n packages_target->append_node(package_target);\n\n \/\/Create the \"classes\" node\n auto classes_target = target_doc.allocate_node(rapidxml::node_element, \"classes\");\n package_target->append_node(classes_target);\n\n auto classes_sources = package_node->first_node(\"classes\");\n\n for(auto* class_source = classes_sources->first_node(\"class\"); class_source; class_source = class_source->next_sibling()){\n std::string class_name(class_source->first_attribute(\"name\")->value());\n std::string class_branch_rate(class_source->first_attribute(\"branch-rate\")->value());\n std::string class_line_rate(class_source->first_attribute(\"line-rate\")->value());\n\n if(!(class_branch_rate == \"0.0\" && class_line_rate == \"0.0\")){\n \/\/Copy \"class\" node into target\n auto* class_target = source_doc.clone_node(class_source);\n classes_target->append_node(class_target);\n }\n }\n }\n }\n\n \/\/2. Copy all relevant packages not present in target from inc -> target\n\n for(auto* package_node = packages_inc->first_node(\"package\"); package_node; package_node = package_node->next_sibling()){\n std::string package_name(package_node->first_attribute(\"name\")->value());\n std::string package_branch_rate(package_node->first_attribute(\"branch-rate\")->value());\n std::string package_line_rate(package_node->first_attribute(\"line-rate\")->value());\n\n \/\/Skip any ignored package\n bool process = !ignore_package(package_name, ignore_packages);\n\n \/\/Skip the entire package is no coverage\n if(package_branch_rate == \"0.0\" && package_line_rate == \"0.0\"){\n process = false;\n }\n\n \/\/Skip package that are already existing in target\n if(process){\n for(auto* target_package = packages_target->first_node(\"package\"); target_package; target_package = target_package->next_sibling()){\n std::string source_package_name(target_package->first_attribute(\"name\")->value());\n\n if(source_package_name == package_name){\n process = false;\n break;\n }\n }\n }\n\n if(process){\n \/\/Create the \"package\" node\n auto package_target = target_doc.allocate_node(rapidxml::node_element, \"package\");\n package_target->append_attribute(target_doc.allocate_attribute(\"name\", package_node->first_attribute(\"name\")->value()));\n package_target->append_attribute(target_doc.allocate_attribute(\"branch-rate\", package_node->first_attribute(\"branch-rate\")->value()));\n package_target->append_attribute(target_doc.allocate_attribute(\"line-rate\", package_node->first_attribute(\"line-rate\")->value()));\n package_target->append_attribute(target_doc.allocate_attribute(\"complexity\", package_node->first_attribute(\"complexity\")->value()));\n packages_target->append_node(package_target);\n\n \/\/Create the \"classes\" node\n auto classes_target = target_doc.allocate_node(rapidxml::node_element, \"classes\");\n package_target->append_node(classes_target);\n\n auto classes_sources = package_node->first_node(\"classes\");\n\n for(auto* class_source = classes_sources->first_node(\"class\"); class_source; class_source = class_source->next_sibling()){\n std::string class_name(class_source->first_attribute(\"name\")->value());\n std::string class_branch_rate(class_source->first_attribute(\"branch-rate\")->value());\n std::string class_line_rate(class_source->first_attribute(\"line-rate\")->value());\n\n if(!(class_branch_rate == \"0.0\" && class_line_rate == \"0.0\")){\n \/\/Copy \"class\" node into target\n auto* class_target = source_doc.clone_node(class_source);\n classes_target->append_node(class_target);\n }\n }\n }\n }\n\n \/\/Write the target doc\n std::ofstream target_stream(target_path);\n target_stream << target_doc;\n target_stream.close();\n\n std::cout << \"Documents have been processed and target has been written\" << std::endl;\n\n return 0;\n}\n<commit_msg>Refactorings<commit_after>\n\n#include <iostream>\n\n#include \"rapidxml.hpp\"\n#include \"rapidxml_utils.hpp\"\n#include \"rapidxml_print.hpp\"\n\nnamespace {\n\n\/\/The documents\n\nrapidxml::xml_document<> source_doc;\nrapidxml::xml_document<> inc_doc;\nrapidxml::xml_document<> target_doc;\n\nbool ignore_package(const std::string& name, const std::vector<std::string>& ignore_packages){\n for(auto& ignore : ignore_packages){\n if(std::mismatch(ignore.begin(), ignore.end(), name.begin()).first == ignore.end()){\n return true;\n }\n }\n\n return false;\n}\n\n} \/\/end of anonymous namespace\n\nint main(int argc, char* argv[]){\n \/\/Argument counter\n std::size_t i = 1;\n\n \/\/Collect the packages to ignore\n std::vector<std::string> ignore_packages;\n for(; i < std::size_t(argc); ++i){\n std::string arg(argv[i]);\n\n std::string ignore(\"--ignore=\");\n\n if(std::mismatch(ignore.begin(), ignore.end(), arg.begin()).first == ignore.end()){\n ignore_packages.emplace_back(arg.begin() + ignore.size(), arg.end());\n } else {\n break;\n }\n }\n\n if(argc - i + 1 < 4){\n std::cout << \"coverage_merger: not enough arguments\" << std::endl;\n return 1;\n }\n\n \/\/Collect the paths\n std::string source_path(argv[i]);\n std::string inc_path(argv[i+1]);\n std::string target_path(argv[i+2]);\n\n std::cout << \"Source file: \" << source_path << std::endl;\n std::cout << \"Increment file: \" << inc_path << std::endl;\n std::cout << \"Target file: \" << target_path << std::endl;\n\n \/\/Parse all documents\n\n rapidxml::file<> source_file(source_path.c_str());\n source_doc.parse<0>(source_file.data());\n\n rapidxml::file<> inc_file(inc_path.c_str());\n inc_doc.parse<0>(inc_file.data());\n\n std::cout << \"Documents parsed\" << std::endl;\n\n \/\/Find the root nodes\n auto source_root_node = source_doc.first_node(\"coverage\");\n auto inc_root_node = inc_doc.first_node(\"coverage\");\n\n \/\/Find the \"packages\" nodes\n auto packages_source = source_root_node->first_node(\"packages\");\n auto packages_inc = inc_root_node->first_node(\"packages\");\n\n \/\/Create root node in target (rates attributes are not copied on purpose)\n auto* target_root_node = target_doc.allocate_node(rapidxml::node_element, \"coverage\");\n target_root_node->append_attribute(target_doc.allocate_attribute(\"version\", source_root_node->first_attribute(\"version\")->value()));\n target_root_node->append_attribute(target_doc.allocate_attribute(\"timestamp\", source_root_node->first_attribute(\"timestamp\")->value()));\n target_doc.append_node(target_root_node);\n\n \/\/Copy directly the \"sources\" node\n auto* target_sources_node = source_doc.clone_node(source_root_node->first_node(\"sources\"));\n target_root_node->append_node(target_sources_node);\n\n \/\/Create the \"packages\" node\n auto packages_target = target_doc.allocate_node(rapidxml::node_element, \"packages\");\n target_root_node->append_node(packages_target);\n\n \/\/1. Copy all relevant packages from source -> target\n\n for(auto* package_node = packages_source->first_node(\"package\"); package_node; package_node = package_node->next_sibling()){\n std::string package_name(package_node->first_attribute(\"name\")->value());\n std::string package_branch_rate(package_node->first_attribute(\"branch-rate\")->value());\n std::string package_line_rate(package_node->first_attribute(\"line-rate\")->value());\n\n \/\/Skip any ignored package\n bool process = !ignore_package(package_name, ignore_packages);\n\n \/\/Skip the entire package is no coverage\n if(package_branch_rate == \"0.0\" && package_line_rate == \"0.0\"){\n process = false;\n }\n\n if(process){\n \/\/Create the \"package\" node\n auto package_target = target_doc.allocate_node(rapidxml::node_element, \"package\");\n package_target->append_attribute(target_doc.allocate_attribute(\"name\", package_node->first_attribute(\"name\")->value()));\n package_target->append_attribute(target_doc.allocate_attribute(\"branch-rate\", package_node->first_attribute(\"branch-rate\")->value()));\n package_target->append_attribute(target_doc.allocate_attribute(\"line-rate\", package_node->first_attribute(\"line-rate\")->value()));\n package_target->append_attribute(target_doc.allocate_attribute(\"complexity\", package_node->first_attribute(\"complexity\")->value()));\n packages_target->append_node(package_target);\n\n \/\/Create the \"classes\" node\n auto classes_target = target_doc.allocate_node(rapidxml::node_element, \"classes\");\n package_target->append_node(classes_target);\n\n auto classes_sources = package_node->first_node(\"classes\");\n\n for(auto* class_source = classes_sources->first_node(\"class\"); class_source; class_source = class_source->next_sibling()){\n std::string class_name(class_source->first_attribute(\"name\")->value());\n std::string class_branch_rate(class_source->first_attribute(\"branch-rate\")->value());\n std::string class_line_rate(class_source->first_attribute(\"line-rate\")->value());\n\n if(!(class_branch_rate == \"0.0\" && class_line_rate == \"0.0\")){\n \/\/Copy \"class\" node into target\n auto* class_target = source_doc.clone_node(class_source);\n classes_target->append_node(class_target);\n }\n }\n }\n }\n\n \/\/2. Copy all relevant packages not present in target from inc -> target\n\n for(auto* package_node = packages_inc->first_node(\"package\"); package_node; package_node = package_node->next_sibling()){\n std::string package_name(package_node->first_attribute(\"name\")->value());\n std::string package_branch_rate(package_node->first_attribute(\"branch-rate\")->value());\n std::string package_line_rate(package_node->first_attribute(\"line-rate\")->value());\n\n \/\/Skip any ignored package\n bool process = !ignore_package(package_name, ignore_packages);\n\n \/\/Skip the entire package is no coverage\n if(package_branch_rate == \"0.0\" && package_line_rate == \"0.0\"){\n process = false;\n }\n\n \/\/Skip package that are already existing in target\n if(process){\n for(auto* target_package = packages_target->first_node(\"package\"); target_package; target_package = target_package->next_sibling()){\n std::string source_package_name(target_package->first_attribute(\"name\")->value());\n\n if(source_package_name == package_name){\n process = false;\n break;\n }\n }\n }\n\n if(process){\n \/\/Create the \"package\" node\n auto package_target = target_doc.allocate_node(rapidxml::node_element, \"package\");\n package_target->append_attribute(target_doc.allocate_attribute(\"name\", package_node->first_attribute(\"name\")->value()));\n package_target->append_attribute(target_doc.allocate_attribute(\"branch-rate\", package_node->first_attribute(\"branch-rate\")->value()));\n package_target->append_attribute(target_doc.allocate_attribute(\"line-rate\", package_node->first_attribute(\"line-rate\")->value()));\n package_target->append_attribute(target_doc.allocate_attribute(\"complexity\", package_node->first_attribute(\"complexity\")->value()));\n packages_target->append_node(package_target);\n\n \/\/Create the \"classes\" node\n auto classes_target = target_doc.allocate_node(rapidxml::node_element, \"classes\");\n package_target->append_node(classes_target);\n\n auto classes_sources = package_node->first_node(\"classes\");\n\n for(auto* class_source = classes_sources->first_node(\"class\"); class_source; class_source = class_source->next_sibling()){\n std::string class_name(class_source->first_attribute(\"name\")->value());\n std::string class_branch_rate(class_source->first_attribute(\"branch-rate\")->value());\n std::string class_line_rate(class_source->first_attribute(\"line-rate\")->value());\n\n if(!(class_branch_rate == \"0.0\" && class_line_rate == \"0.0\")){\n \/\/Copy \"class\" node into target\n auto* class_target = source_doc.clone_node(class_source);\n classes_target->append_node(class_target);\n }\n }\n }\n }\n\n \/\/Write the target doc\n std::ofstream target_stream(target_path);\n target_stream << target_doc;\n target_stream.close();\n\n std::cout << \"Documents have been processed and target has been written\" << std::endl;\n\n return 0;\n}\n<|endoftext|>"} {"text":"<commit_before>\/** \n * This is the main file that will be used to run the rshell.\n**\/\n#include \"Rshell.h\"\n\n#include <iostream>\n#include <string>\n\nusing namespace std;\n\nint main()\n{\n string input = \"\";\n while (input != \"exit\")\n {\n cout << \"$\";\n cin >> input;\n }\t\t \n return 0;\n}\n<commit_msg>Updated main.cpp file to include whitespace<commit_after>\/** \n * This is the main file that will be used to run the rshell.\n**\/\n#include \"Rshell.h\"\n\n#include <iostream>\n#include <string>\n\nusing namespace std;\n\nint main()\n{\n string input = \"\";\n while(input != \"exit\")\n {\n cout << \"$\";\n getline(cin, input);\n }\t\t \n return 0;\n}\n<|endoftext|>"} {"text":"<commit_before>#include \"Hydra.h\"\n#include \"Sprite.h\"\n#include <vector>\n#include <unistd.h>\n#include <stdio.h>\r\nusing namespace std;\r\nusing namespace Hydra;\n\nenum dirs {left, right, up, down};\n\nclass ComicPanel\n{\npublic:\n int posX;\n int posY;\n int height;\n int width;\n float vel; \/\/Speed when traveling TO this panel! bool root;\n bool blank; \/\/If true, don't render this panel - it's just an empty frame.\n bool root; \/\/Is this comic a root?\n string nextComic[4]; \/\/The name of the next panel to be moved to given\n string name;\n Sprite* image;\n};\r\n\nComicPanel* loadFromXML(pugi::xml_node configNode);\nComicPanel* switchToComic(vector<ComicPanel*> panels, string nextName);\ninline double getScaling(ComicPanel* panel, HydraEngine* engine);\n\nLog* sysLog = Logger::getInstance()->getLog(\"sysLog\");\n\r\nint main(int argc, char* argv[])\r\n{\r\n\tHydraEngine* engine = HydraEngine::getInstance();\n\tengine->init();\n\n vector<ComicPanel*> panels;\n bool quit = false;\n\n double currentX = 0, currentY = 0;\n double dX = 0, dY = 0;\n double scale = 1.0f;\n double scalingDiff = 0.0f; \/\/How much to change the scaling by\n bool transitioning = false;\n bool fullscreen = false;\n int fcCooldown = 0;\n ComicPanel* currentPanel;\n\n char cCurrentPath[FILENAME_MAX];\n cout << \"CWD: \" << getcwd(cCurrentPath, sizeof(cCurrentPath)) << endl;\n\n \/\/Load all comics\n pugi::xml_document doc;\n pugi::xml_parse_result result = doc.load_file(\"Comic.xml\");\n cout << \"Loaded file Comic.xml with result: \" << result.description() << endl;\n sysLog->log(\"Loaded file Comic.xml with result: \" + string(result.description()));\n sysLog->log(\"Loading panels...\", Hydra::resource);\n cout << \"\\nLoading panels...\\n\" << endl;\n\n for (pugi::xml_node comic = doc.child(\"Comics\").child(\"panel\"); comic; comic = comic.next_sibling())\n {\n ComicPanel* newPanel = loadFromXML(comic);\n if (newPanel->root)\n {\n currentPanel = newPanel;\n cout << \"Setting root panel to panel \" << currentPanel->name << \" at position \" << currentPanel->posX << \", \" << currentPanel->posY << endl;\n scale = getScaling(currentPanel, engine); \/\/The comic is to start out scaled to the root panel\n currentX = currentPanel->posX;\n currentY = currentPanel->posY;\n }\n panels.push_back(newPanel);\n }\n\n if (currentPanel == nullptr)\n cout << \"Error - couldn't find the root panel! Have you specified one yet?\" << endl;\n\n while (!quit && currentPanel != nullptr)\n {\n if (fcCooldown > 0)\n fcCooldown--;\n Timer fpsTimer;\n fpsTimer.start();\n fpsTimer.setInterval(1000.0f \/ 60.0f);\n\n SDL_Event e;\n while (SDL_PollEvent(&e) != 0)\n {\n if (e.type == SDL_QUIT || e.key.keysym.scancode == SDL_SCANCODE_ESCAPE)\n quit = true;\n if (e.key.keysym.scancode == SDL_SCANCODE_F && !transitioning && fcCooldown == 0)\n {\n if (!fullscreen)\n {\n fullscreen = true;\n engine->setWSize(1366, 768);\n SDL_SetWindowFullscreen(engine->getWindow(), SDL_WINDOW_FULLSCREEN);\n }\n else\n {\n fullscreen = false;\n SDL_SetWindowFullscreen(engine->getWindow(), 0);\n engine->setWSize(800, 600);\n }\n\n scale = getScaling(currentPanel, engine);\n\n cout << \"Fullscreen: \" << fullscreen << \". Window dimensions: \" << engine->getWXSize() << \"x\" <<\n engine->getWYSize() << \". Scaling: \" << scale << endl;\n fcCooldown = 30;\n\n\n }\n }\n\n \/\/Transitioning stuff\n if (!transitioning)\n {\n ComicPanel* nextPanel = nullptr;\n\n const Uint8* keystate = SDL_GetKeyboardState(nullptr);\n if (keystate[SDL_SCANCODE_DOWN])\n nextPanel = switchToComic(panels, currentPanel->nextComic[dirs::down]);\n if (keystate[SDL_SCANCODE_UP])\n nextPanel = switchToComic(panels, currentPanel->nextComic[dirs::up]);\n if (keystate[SDL_SCANCODE_LEFT])\n nextPanel = switchToComic(panels, currentPanel->nextComic[dirs::left]);\n if (keystate[SDL_SCANCODE_RIGHT])\n nextPanel = switchToComic(panels, currentPanel->nextComic[dirs::right]);\n\n if (nextPanel != nullptr)\n {\n currentPanel = nextPanel;\n transitioning = true;\n cout << \"Switching panels to panel \" << currentPanel->name;\n sysLog->log(\"Switching panels to panel \" + currentPanel->name);\n\n \/\/Compute dX and dY values\n Vector2D dir;\n dir.rotate(atan2f((double)(currentPanel->posY - currentY), (double)(currentPanel->posX - currentX)));\n dir.setMag(currentPanel->vel);\n dX = dir.getX();\n dY = dir.getY();\n }\n }\n\n \/\/Velocities in directions - uses a Vector2D for calculations (because TRIGONOMETRY!)\n if (transitioning)\n {\n Vector2D dir;\n dir.setX(abs((int)(scale * ((double)currentPanel->posX - currentX))));\n dir.setY(abs((int)(scale * ((double)currentPanel->posY - currentY))));\n scalingDiff = (getScaling(currentPanel, engine) - scale) \/ (dir.getMag() \/ (double)currentPanel->vel);\n\n scale += scalingDiff;\n currentX += dX;\/\/ * scale;\n currentY += dY;\/\/ * scale;\n\n if (dir.getMag() <= currentPanel->vel)\n {\n transitioning = false;\n currentX = (double)currentPanel->posX; \/\/Absolute magic. Complete effing magic!\n currentY = (double)currentPanel->posY;\n scale= getScaling(currentPanel, engine); \/\/Fix scaling\n cout << \". Viewer at \" << currentX << \", \" << currentY << \". Scale: \" << getScaling(currentPanel, engine) << endl;\n sysLog->log(\"Viewer at \" + to_string(currentX) + \", \" + to_string(currentY) + \". Scale: \" + to_string(getScaling(currentPanel, engine)));\n }\n }\n\n \/\/Rendering stuff\n SDL_RenderClear(engine->getRenderer());\n for (auto iter = panels.begin(); iter != panels.end(); iter++)\n {\n if ((*iter)->blank)\n continue;\n Sprite* image = (*iter)->image;\n image->render(((*iter)->posX - currentX) * scale,\n ((*iter)->posY - currentY) * scale,\n image->getH() * scale,\n image->getW() * scale);\n }\n\n SDL_RenderPresent(engine->getRenderer());\n\n \/\/Ensures 60 fps\n while (!fpsTimer.hasIntervalPassed());\n }\n\n \/\/Shutdown sequence\n cout << \"\\nFreeing images...\" << endl;\n sysLog->log(\"Freeing images...\", Hydra::resource);\n for (auto iter = panels.begin(); iter != panels.end(); iter++)\n {\n cout << \"Freeing \" << (*iter)->name << \"...\" << endl;\n sysLog->log(\"Freeing \" + (*iter)->name + \"...\", Hydra::resource);\n (*iter)->image->free();\n delete *iter;\n }\n engine->shutdown();\r\n}\r\n\nComicPanel* loadFromXML(pugi::xml_node configNode)\n{\n \/\/Assumes that this node is a \"panel\" node.\n ComicPanel* newPanel = new ComicPanel;\n newPanel->image = new Sprite;\n\n newPanel->name = configNode.attribute(\"name\").as_string();\n newPanel->posX = configNode.child(\"position\").attribute(\"x\").as_int();\n newPanel->posY = configNode.child(\"position\").attribute(\"y\").as_int();\n newPanel->vel = configNode.child(\"vel\").attribute(\"value\").as_float();\n newPanel->root = false; \/\/Default value\n newPanel->root = configNode.child(\"root\").attribute(\"enabled\").as_bool();\n newPanel->blank = false; \/\/Default value\n newPanel->blank = configNode.child(\"blank\").attribute(\"enabled\").as_bool();\n for (int i = 0; i < 4; i++)\n newPanel->nextComic[i] = \"null\"; \/\/Signifies that there is no transition to a new comic. These are default values.\n\n newPanel->nextComic[dirs::up] = configNode.child(\"dirs\").child(\"up\").attribute(\"nextComic\").as_string();\n newPanel->nextComic[dirs::down] = configNode.child(\"dirs\").child(\"down\").attribute(\"nextComic\").as_string();\n newPanel->nextComic[dirs::left] = configNode.child(\"dirs\").child(\"left\").attribute(\"nextComic\").as_string();\n newPanel->nextComic[dirs::right] = configNode.child(\"dirs\").child(\"right\").attribute(\"nextComic\").as_string();\n\n\n cout << \"Loaded panel \" << newPanel->name << endl;\n sysLog->log(\"Loaded panel \" + newPanel->name, Hydra::resource);\n if (newPanel->blank)\n {\n newPanel->width = configNode.child(\"dims\").attribute(\"width\").as_int();\n newPanel->height = configNode.child(\"dims\").attribute(\"height\").as_int();\n return newPanel; \/\/There is no image to load; skip loading an image.\n }\n\n newPanel->image->loadFromFile(configNode.child(\"filename\").attribute(\"str\").as_string());\n cout << \"Loaded file \" << configNode.child(\"filename\").attribute(\"str\").as_string() << endl << endl;\n sysLog->log(\"Loaded file \" + string(configNode.child(\"filename\").attribute(\"str\").as_string()), Hydra::resource);\n newPanel->height = newPanel->image->getH();\n newPanel->width = newPanel->image->getW();\n return newPanel;\n}\nComicPanel* switchToComic(vector<ComicPanel*> panels, string nextName)\n{\n \/\/Given a name of a panel and a vector of pointers to panels, find a panel with the given name.\n \/\/Returns nullptr if there is no such pointer\n\n \/\/Dummy check - XML file should specify null if you don't want to switch to comic from a dir\n if (nextName == \"null\")\n return nullptr;\n\n for (auto iter = panels.begin(); iter != panels.end(); iter++)\n {\n if ((*iter)->name == nextName)\n {\n return *iter;\n }\n }\n\n cout << \"Error switching panels: panel \" << nextName << \" does not exist.\" << endl;\n sysLog->log(\"Error switching panels: panel \" + nextName + \" does not exist.\", Hydra::error);\n return nullptr; \/\/Yeah, sorry, this panel doesn't exist.\n}\ndouble getScaling(ComicPanel* panel, HydraEngine* engine)\n{\n \/\/Figure out the scaling needed to fit this panel's largest dimension on the screen\n if (panel->width > panel->height)\n return (double)engine->getWXSize() \/ (double)panel->width;\n else\n return (double)engine->getWYSize() \/ (double)panel->height;\n\n return 1.0f;\n}\n<commit_msg>Fixed bottom cutoff issues<commit_after>#include \"Hydra.h\"\n#include \"Sprite.h\"\n#include <vector>\n#include <unistd.h>\n#include <stdio.h>\r\nusing namespace std;\r\nusing namespace Hydra;\n\nenum dirs {left, right, up, down};\n\nclass ComicPanel\n{\npublic:\n int posX;\n int posY;\n int height;\n int width;\n float vel; \/\/Speed when traveling TO this panel! bool root;\n bool blank; \/\/If true, don't render this panel - it's just an empty frame.\n bool root; \/\/Is this comic a root?\n string nextComic[4]; \/\/The name of the next panel to be moved to given\n string name;\n Sprite* image;\n};\r\n\nComicPanel* loadFromXML(pugi::xml_node configNode);\nComicPanel* switchToComic(vector<ComicPanel*> panels, string nextName);\ninline double getScaling(ComicPanel* panel, HydraEngine* engine);\n\nLog* sysLog = Logger::getInstance()->getLog(\"sysLog\");\n\r\nint main(int argc, char* argv[])\r\n{\r\n\tHydraEngine* engine = HydraEngine::getInstance();\n\tengine->init();\n\n vector<ComicPanel*> panels;\n bool quit = false;\n\n double currentX = 0, currentY = 0;\n double dX = 0, dY = 0;\n double scale = 1.0f;\n double scalingDiff = 0.0f; \/\/How much to change the scaling by\n bool transitioning = false;\n bool fullscreen = false;\n int fcCooldown = 0;\n ComicPanel* currentPanel;\n\n char cCurrentPath[FILENAME_MAX];\n cout << \"CWD: \" << getcwd(cCurrentPath, sizeof(cCurrentPath)) << endl;\n\n \/\/Load all comics\n pugi::xml_document doc;\n pugi::xml_parse_result result = doc.load_file(\"Comic.xml\");\n cout << \"Loaded file Comic.xml with result: \" << result.description() << endl;\n sysLog->log(\"Loaded file Comic.xml with result: \" + string(result.description()));\n sysLog->log(\"Loading panels...\", Hydra::resource);\n cout << \"\\nLoading panels...\\n\" << endl;\n\n for (pugi::xml_node comic = doc.child(\"Comics\").child(\"panel\"); comic; comic = comic.next_sibling())\n {\n ComicPanel* newPanel = loadFromXML(comic);\n if (newPanel->root)\n {\n currentPanel = newPanel;\n cout << \"Setting root panel to panel \" << currentPanel->name << \" at position \" << currentPanel->posX << \", \" << currentPanel->posY << endl;\n scale = getScaling(currentPanel, engine); \/\/The comic is to start out scaled to the root panel\n currentX = currentPanel->posX;\n currentY = currentPanel->posY;\n }\n panels.push_back(newPanel);\n }\n\n if (currentPanel == nullptr)\n cout << \"Error - couldn't find the root panel! Have you specified one yet?\" << endl;\n\n while (!quit && currentPanel != nullptr)\n {\n if (fcCooldown > 0)\n fcCooldown--;\n Timer fpsTimer;\n fpsTimer.start();\n fpsTimer.setInterval(1000.0f \/ 60.0f);\n\n SDL_Event e;\n while (SDL_PollEvent(&e) != 0)\n {\n if (e.type == SDL_QUIT || e.key.keysym.scancode == SDL_SCANCODE_ESCAPE)\n quit = true;\n if (e.key.keysym.scancode == SDL_SCANCODE_F && !transitioning && fcCooldown == 0)\n {\n if (!fullscreen)\n {\n fullscreen = true;\n engine->setWSize(1366, 768);\n SDL_SetWindowFullscreen(engine->getWindow(), SDL_WINDOW_FULLSCREEN);\n }\n else\n {\n fullscreen = false;\n SDL_SetWindowFullscreen(engine->getWindow(), 0);\n engine->setWSize(800, 600);\n }\n\n scale = getScaling(currentPanel, engine);\n\n cout << \"Fullscreen: \" << fullscreen << \". Window dimensions: \" << engine->getWXSize() << \"x\" <<\n engine->getWYSize() << \". Scaling: \" << scale << endl;\n fcCooldown = 30;\n\n\n }\n }\n\n \/\/Transitioning stuff\n if (!transitioning)\n {\n ComicPanel* nextPanel = nullptr;\n\n const Uint8* keystate = SDL_GetKeyboardState(nullptr);\n if (keystate[SDL_SCANCODE_DOWN])\n nextPanel = switchToComic(panels, currentPanel->nextComic[dirs::down]);\n if (keystate[SDL_SCANCODE_UP])\n nextPanel = switchToComic(panels, currentPanel->nextComic[dirs::up]);\n if (keystate[SDL_SCANCODE_LEFT])\n nextPanel = switchToComic(panels, currentPanel->nextComic[dirs::left]);\n if (keystate[SDL_SCANCODE_RIGHT])\n nextPanel = switchToComic(panels, currentPanel->nextComic[dirs::right]);\n\n if (nextPanel != nullptr)\n {\n currentPanel = nextPanel;\n transitioning = true;\n cout << \"Switching panels to panel \" << currentPanel->name;\n sysLog->log(\"Switching panels to panel \" + currentPanel->name);\n\n \/\/Compute dX and dY values\n Vector2D dir;\n dir.rotate(atan2f((double)(currentPanel->posY - currentY), (double)(currentPanel->posX - currentX)));\n dir.setMag(currentPanel->vel);\n dX = dir.getX();\n dY = dir.getY();\n }\n }\n\n \/\/Velocities in directions - uses a Vector2D for calculations (because TRIGONOMETRY!)\n if (transitioning)\n {\n Vector2D dir;\n dir.setX(abs((int)(scale * ((double)currentPanel->posX - currentX))));\n dir.setY(abs((int)(scale * ((double)currentPanel->posY - currentY))));\n scalingDiff = (getScaling(currentPanel, engine) - scale) \/ (dir.getMag() \/ (double)currentPanel->vel);\n\n scale += scalingDiff;\n currentX += dX;\/\/ * scale;\n currentY += dY;\/\/ * scale;\n\n if (dir.getMag() <= currentPanel->vel)\n {\n transitioning = false;\n currentX = (double)currentPanel->posX; \/\/Absolute magic. Complete effing magic!\n currentY = (double)currentPanel->posY;\n scale= getScaling(currentPanel, engine); \/\/Fix scaling\n cout << \". Viewer at \" << currentX << \", \" << currentY << \". Scale: \" << getScaling(currentPanel, engine) << endl;\n sysLog->log(\"Viewer at \" + to_string(currentX) + \", \" + to_string(currentY) + \". Scale: \" + to_string(getScaling(currentPanel, engine)));\n }\n }\n\n \/\/Rendering stuff\n SDL_RenderClear(engine->getRenderer());\n for (auto iter = panels.begin(); iter != panels.end(); iter++)\n {\n if ((*iter)->blank)\n continue;\n Sprite* image = (*iter)->image;\n image->render(((*iter)->posX - currentX) * scale,\n ((*iter)->posY - currentY) * scale,\n image->getH() * scale,\n image->getW() * scale);\n }\n\n SDL_RenderPresent(engine->getRenderer());\n\n \/\/Ensures 60 fps\n while (!fpsTimer.hasIntervalPassed());\n }\n\n \/\/Shutdown sequence\n cout << \"\\nFreeing images...\" << endl;\n sysLog->log(\"Freeing images...\", Hydra::resource);\n for (auto iter = panels.begin(); iter != panels.end(); iter++)\n {\n cout << \"Freeing \" << (*iter)->name << \"...\" << endl;\n sysLog->log(\"Freeing \" + (*iter)->name + \"...\", Hydra::resource);\n (*iter)->image->free();\n delete *iter;\n }\n engine->shutdown();\r\n}\r\n\nComicPanel* loadFromXML(pugi::xml_node configNode)\n{\n \/\/Assumes that this node is a \"panel\" node.\n ComicPanel* newPanel = new ComicPanel;\n newPanel->image = new Sprite;\n\n newPanel->name = configNode.attribute(\"name\").as_string();\n newPanel->posX = configNode.child(\"position\").attribute(\"x\").as_int();\n newPanel->posY = configNode.child(\"position\").attribute(\"y\").as_int();\n newPanel->vel = configNode.child(\"vel\").attribute(\"value\").as_float();\n newPanel->root = false; \/\/Default value\n newPanel->root = configNode.child(\"root\").attribute(\"enabled\").as_bool();\n newPanel->blank = false; \/\/Default value\n newPanel->blank = configNode.child(\"blank\").attribute(\"enabled\").as_bool();\n for (int i = 0; i < 4; i++)\n newPanel->nextComic[i] = \"null\"; \/\/Signifies that there is no transition to a new comic. These are default values.\n\n newPanel->nextComic[dirs::up] = configNode.child(\"dirs\").child(\"up\").attribute(\"nextComic\").as_string();\n newPanel->nextComic[dirs::down] = configNode.child(\"dirs\").child(\"down\").attribute(\"nextComic\").as_string();\n newPanel->nextComic[dirs::left] = configNode.child(\"dirs\").child(\"left\").attribute(\"nextComic\").as_string();\n newPanel->nextComic[dirs::right] = configNode.child(\"dirs\").child(\"right\").attribute(\"nextComic\").as_string();\n\n\n cout << \"Loaded panel \" << newPanel->name << endl;\n sysLog->log(\"Loaded panel \" + newPanel->name, Hydra::resource);\n if (newPanel->blank)\n {\n newPanel->width = configNode.child(\"dims\").attribute(\"width\").as_int();\n newPanel->height = configNode.child(\"dims\").attribute(\"height\").as_int();\n return newPanel; \/\/There is no image to load; skip loading an image.\n }\n\n newPanel->image->loadFromFile(configNode.child(\"filename\").attribute(\"str\").as_string());\n cout << \"Loaded file \" << configNode.child(\"filename\").attribute(\"str\").as_string() << endl << endl;\n sysLog->log(\"Loaded file \" + string(configNode.child(\"filename\").attribute(\"str\").as_string()), Hydra::resource);\n newPanel->height = newPanel->image->getH();\n newPanel->width = newPanel->image->getW();\n return newPanel;\n}\nComicPanel* switchToComic(vector<ComicPanel*> panels, string nextName)\n{\n \/\/Given a name of a panel and a vector of pointers to panels, find a panel with the given name.\n \/\/Returns nullptr if there is no such pointer\n\n \/\/Dummy check - XML file should specify null if you don't want to switch to comic from a dir\n if (nextName == \"null\")\n return nullptr;\n\n for (auto iter = panels.begin(); iter != panels.end(); iter++)\n {\n if ((*iter)->name == nextName)\n {\n return *iter;\n }\n }\n\n cout << \"Error switching panels: panel \" << nextName << \" does not exist.\" << endl;\n sysLog->log(\"Error switching panels: panel \" + nextName + \" does not exist.\", Hydra::error);\n return nullptr; \/\/Yeah, sorry, this panel doesn't exist.\n}\ndouble getScaling(ComicPanel* panel, HydraEngine* engine)\n{\n \/\/Figure out the scaling needed to fit this panel's largest dimension on the screen\n double zWidth = (double)engine->getWXSize() \/ (double)panel->width;\n double zHeight = (double)engine->getWYSize() \/ (double)panel->height;\n\n if (zWidth < zHeight)\n return zWidth;\n else\n return zHeight;\n}\n<|endoftext|>"} {"text":"<commit_before>\/*\n\nThis file is part of VROOM.\n\nCopyright (c) 2015-2022, Julien Coupey.\nAll rights reserved (see LICENSE).\n\n*\/\n\n#include <fstream>\n#include <iostream>\n#include <sstream>\n#ifndef _WIN32\n#include <unistd.h>\n#endif\n\n#if USE_LIBOSRM\n#include \"osrm\/exception.hpp\"\n#endif\n\n#include \"..\/include\/cxxopts\/include\/cxxopts.hpp\"\n#include \"problems\/vrp.h\"\n#include \"structures\/cl_args.h\"\n#include \"utils\/exception.h\"\n#include \"utils\/helpers.h\"\n#include \"utils\/input_parser.h\"\n#include \"utils\/output_json.h\"\n#include \"utils\/version.h\"\n\nint main(int argc, char** argv) {\n vroom::io::CLArgs cl_args;\n std::string host_arg;\n std::string port_arg;\n std::string router_arg;\n std::string limit_arg;\n std::string nb_threads_arg;\n std::vector<std::string> heuristic_params_arg;\n\n \/\/ clang-format off\n cxxopts::Options options(\n \"vroom\",\n \"VROOM Copyright (C) 2015-2022, Julien Coupey\\n\"\n \"Version: \" + vroom::get_version() + \"\\n\\n\"\n \"A command-line utility to solve complex vehicle routing problems.\\n\"\n );\n\n options\n .set_width(80)\n .set_tab_expansion()\n .add_options(\"main_group\")\n (\"h,help\", \"Print this help message.\")\n (\"v,version\", \"Print the version of this software.\")\n (\"a,host\", \"The host for the routing profile, e.g. '\" + vroom::DEFAULT_PROFILE + \":0.0.0.0'\", cxxopts::value<std::string>(host_arg)->default_value(\"car:0.0.0.0\"))\n (\"c,choose-eta\", \"Choose ETA for custom routes and report violations.\", cxxopts::value<bool>(cl_args.check)->default_value(\"false\"))\n (\"g,geometry\", \"Add detailed route geometry and indicators\", cxxopts::value<bool>(cl_args.geometry)->default_value(\"false\"))\n (\"i,input-file\", \"Read input from 'input-file' rather than from stdin\", cxxopts::value<std::string>(cl_args.input_file))\n (\"l,limit\", \"Stop solving process after 'limit' seconds\", cxxopts::value<std::string>(limit_arg)->default_value(\"\"))\n (\"o,output\", \"Output file name\", cxxopts::value<std::string>(cl_args.output_file))\n (\"p,port\", \"The host port for the routing profile, e.g. '\" + vroom::DEFAULT_PROFILE + \":5000'\", cxxopts::value<std::string>(port_arg)->default_value(\"car:5000\"))\n (\"r,router\", \"osrm, libosrm, ors or valhalla\", cxxopts::value<std::string>(router_arg)->default_value(\"osrm\"))\n (\"t,threads\", \"Number of threads to use\", cxxopts::value<unsigned>(cl_args.nb_threads)->default_value(\"4\"))\n (\"x,explore\", \"Exploration level to use (0..5)\", cxxopts::value<unsigned>(cl_args.exploration_level)->default_value(\"5\"))\n (\"input\", \"optional input positional arg\", cxxopts::value<std::string>(cl_args.input));\n \n try {\n \/\/ we don't want to print debug args on --help\n options.add_options(\"debug_group\")\n (\"e,heuristic-param\", \"Heuristic parameter\", cxxopts::value<std::vector<std::string>>(heuristic_params_arg));\n \/\/ clang-format on\n\n options.parse_positional({\"input\"});\n options.positional_help(\"OPTIONAL INLINE JSON\");\n auto parsed_args = options.parse(argc, argv);\n\n if (parsed_args.count(\"help\")) {\n std::cout << options.help({\"main_group\"}) << \"\\n\";\n exit(0);\n }\n\n if (parsed_args.count(\"version\")) {\n std::cout << \"vroom \" << vroom::get_version() << \"\\n\";\n exit(0);\n }\n } catch (const cxxopts::OptionException& e) {\n auto error_code = vroom::InputException(\"\").error_code;\n std::cerr << \"[Error] \" << e.what() << std::endl;\n vroom::io::write_to_json({error_code, e.what()}, false, cl_args.output_file);\n exit(error_code);\n }\n\n \/\/ parse and update some params\n vroom::io::update_host(cl_args.servers, host_arg);\n vroom::io::update_port(cl_args.servers, port_arg);\n if (!limit_arg.empty()) {\n \/\/ Internally timeout is in milliseconds.\n cl_args.timeout = 1000 * std::stof(limit_arg);\n }\n cl_args.exploration_level =\n std::min(cl_args.exploration_level, cl_args.max_exploration_level);\n\n \/\/ Determine routing engine (defaults to ROUTER::OSRM).\n if (router_arg == \"libosrm\") {\n cl_args.router = vroom::ROUTER::LIBOSRM;\n } else if (router_arg == \"ors\") {\n cl_args.router = vroom::ROUTER::ORS;\n } else if (router_arg == \"valhalla\") {\n cl_args.router = vroom::ROUTER::VALHALLA;\n } else if (!router_arg.empty() and router_arg != \"osrm\") {\n auto error_code = vroom::InputException(\"\").error_code;\n std::string message = \"Invalid routing engine: \" + router_arg + \".\";\n std::cerr << \"[Error] \" << message << std::endl;\n vroom::io::write_to_json({error_code, message}, false, cl_args.output_file);\n exit(error_code);\n }\n\n try {\n \/\/ Force heuristic parameters from the command-line, useful for\n \/\/ debugging.\n std::transform(heuristic_params_arg.begin(),\n heuristic_params_arg.end(),\n std::back_inserter(cl_args.h_params),\n [](const auto& str_param) {\n return vroom::utils::str_to_heuristic_param(str_param);\n });\n } catch (const vroom::Exception& e) {\n std::cerr << \"[Error] \" << e.message << std::endl;\n vroom::io::write_to_json({e.error_code, e.message},\n false,\n cl_args.output_file);\n exit(e.error_code);\n }\n\n \/\/ Read input problem\n if (cl_args.input.empty()) {\n std::stringstream buffer;\n if (!cl_args.input_file.empty()) {\n std::ifstream ifs(cl_args.input_file);\n buffer << ifs.rdbuf();\n } else {\n buffer << std::cin.rdbuf();\n }\n cl_args.input = buffer.str();\n }\n\n try {\n \/\/ Build problem.\n vroom::Input problem_instance = vroom::io::parse(cl_args);\n\n vroom::Solution sol = (cl_args.check)\n ? problem_instance.check(cl_args.nb_threads)\n : problem_instance.solve(cl_args.exploration_level,\n cl_args.nb_threads,\n cl_args.timeout,\n cl_args.h_params);\n\n \/\/ Write solution.\n vroom::io::write_to_json(sol, cl_args.geometry, cl_args.output_file);\n } catch (const vroom::Exception& e) {\n std::cerr << \"[Error] \" << e.message << std::endl;\n vroom::io::write_to_json({e.error_code, e.message},\n false,\n cl_args.output_file);\n exit(e.error_code);\n }\n#if USE_LIBOSRM\n catch (const osrm::exception& e) {\n \/\/ In case of an unhandled routing error.\n auto error_code = vroom::RoutingException(\"\").error_code;\n auto message = \"Routing problem: \" + std::string(e.what());\n std::cerr << \"[Error] \" << message << std::endl;\n vroom::io::write_to_json({error_code, message}, false, cl_args.output_file);\n exit(error_code);\n }\n#endif\n catch (const std::exception& e) {\n \/\/ In case of an unhandled internal error.\n auto error_code = vroom::InternalException(\"\").error_code;\n std::cerr << \"[Error] \" << e.what() << std::endl;\n vroom::io::write_to_json({error_code, e.what()},\n false,\n cl_args.output_file);\n exit(error_code);\n }\n\n return 0;\n}\n<commit_msg>try to remove clang-format<commit_after>\/*\n\nThis file is part of VROOM.\n\nCopyright (c) 2015-2022, Julien Coupey.\nAll rights reserved (see LICENSE).\n\n*\/\n\n#include <fstream>\n#include <iostream>\n#include <sstream>\n#ifndef _WIN32\n#include <unistd.h>\n#endif\n\n#if USE_LIBOSRM\n#include \"osrm\/exception.hpp\"\n#endif\n\n#include \"..\/include\/cxxopts\/include\/cxxopts.hpp\"\n\n#include \"problems\/vrp.h\"\n#include \"structures\/cl_args.h\"\n#include \"utils\/exception.h\"\n#include \"utils\/helpers.h\"\n#include \"utils\/input_parser.h\"\n#include \"utils\/output_json.h\"\n#include \"utils\/version.h\"\n\nint main(int argc, char** argv) {\n vroom::io::CLArgs cl_args;\n std::string host_arg;\n std::string port_arg;\n std::string router_arg;\n std::string limit_arg;\n std::string nb_threads_arg;\n std::vector<std::string> heuristic_params_arg;\n\n cxxopts::Options options(\n \"vroom\",\n \"VROOM Copyright (C) 2015-2022, Julien Coupey\\n\"\n \"Version: \" + vroom::get_version() + \"\\n\\n\"\n \"A command-line utility to solve complex vehicle routing problems.\\n\"\n );\n\n options\n .set_width(80)\n .set_tab_expansion()\n .add_options(\"main_group\")\n (\"h,help\", \"Print this help message.\")\n (\"v,version\", \"Print the version of this software.\")\n (\"a,host\", \"The host for the routing profile, e.g. '\" + vroom::DEFAULT_PROFILE + \":0.0.0.0'\",\n cxxopts::value<std::string>(host_arg)->default_value(\"car:0.0.0.0\"))\n (\"c,choose-eta\", \"Choose ETA for custom routes and report violations.\",\n cxxopts::value<bool>(cl_args.check)->default_value(\"false\"))\n (\"g,geometry\", \"Add detailed route geometry and indicators\",\n cxxopts::value<bool>(cl_args.geometry)->default_value(\"false\"))\n (\"i,input-file\", \"Read input from 'input-file' rather than from stdin\",\n cxxopts::value<std::string>(cl_args.input_file))\n (\"l,limit\", \"Stop solving process after 'limit' seconds\",\n cxxopts::value<std::string>(limit_arg)->default_value(\"\"))\n (\"o,output\", \"Output file name\", cxxopts::value<std::string>(cl_args.output_file))\n (\"p,port\", \"The host port for the routing profile, e.g. '\" + vroom::DEFAULT_PROFILE + \":5000'\",\n cxxopts::value<std::string>(port_arg)->default_value(\"car:5000\"))\n (\"r,router\", \"osrm, libosrm, ors or valhalla\",\n cxxopts::value<std::string>(router_arg)->default_value(\"osrm\"))\n (\"t,threads\", \"Number of threads to use\",\n cxxopts::value<unsigned>(cl_args.nb_threads)->default_value(\"4\"))\n (\"x,explore\", \"Exploration level to use (0..5)\",\n cxxopts::value<unsigned>(cl_args.exploration_level)->default_value(\"5\"))\n (\"input\", \"optional input positional arg\",\n cxxopts::value<std::string>(cl_args.input));\n \n try {\n \/\/ we don't want to print debug args on --help\n options.add_options(\"debug_group\")\n (\"e,heuristic-param\", \"Heuristic parameter\",\n cxxopts::value<std::vector<std::string>>(heuristic_params_arg));\n\n options.parse_positional({\"input\"});\n options.positional_help(\"OPTIONAL INLINE JSON\");\n auto parsed_args = options.parse(argc, argv);\n\n if (parsed_args.count(\"help\")) {\n std::cout << options.help({\"main_group\"}) << \"\\n\";\n exit(0);\n }\n\n if (parsed_args.count(\"version\")) {\n std::cout << \"vroom \" << vroom::get_version() << \"\\n\";\n exit(0);\n }\n } catch (const cxxopts::OptionException& e) {\n auto error_code = vroom::InputException(\"\").error_code;\n std::cerr << \"[Error] \" << e.what() << std::endl;\n vroom::io::write_to_json({error_code, e.what()}, false, cl_args.output_file);\n exit(error_code);\n }\n\n \/\/ parse and update some params\n vroom::io::update_host(cl_args.servers, host_arg);\n vroom::io::update_port(cl_args.servers, port_arg);\n if (!limit_arg.empty()) {\n \/\/ Internally timeout is in milliseconds.\n cl_args.timeout = 1000 * std::stof(limit_arg);\n }\n cl_args.exploration_level =\n std::min(cl_args.exploration_level, cl_args.max_exploration_level);\n\n \/\/ Determine routing engine (defaults to ROUTER::OSRM).\n if (router_arg == \"libosrm\") {\n cl_args.router = vroom::ROUTER::LIBOSRM;\n } else if (router_arg == \"ors\") {\n cl_args.router = vroom::ROUTER::ORS;\n } else if (router_arg == \"valhalla\") {\n cl_args.router = vroom::ROUTER::VALHALLA;\n } else if (!router_arg.empty() and router_arg != \"osrm\") {\n auto error_code = vroom::InputException(\"\").error_code;\n std::string message = \"Invalid routing engine: \" + router_arg + \".\";\n std::cerr << \"[Error] \" << message << std::endl;\n vroom::io::write_to_json({error_code, message}, false, cl_args.output_file);\n exit(error_code);\n }\n\n try {\n \/\/ Force heuristic parameters from the command-line, useful for\n \/\/ debugging.\n std::transform(heuristic_params_arg.begin(),\n heuristic_params_arg.end(),\n std::back_inserter(cl_args.h_params),\n [](const auto& str_param) {\n return vroom::utils::str_to_heuristic_param(str_param);\n });\n } catch (const vroom::Exception& e) {\n std::cerr << \"[Error] \" << e.message << std::endl;\n vroom::io::write_to_json({e.error_code, e.message},\n false,\n cl_args.output_file);\n exit(e.error_code);\n }\n\n \/\/ Read input problem\n if (cl_args.input.empty()) {\n std::stringstream buffer;\n if (!cl_args.input_file.empty()) {\n std::ifstream ifs(cl_args.input_file);\n buffer << ifs.rdbuf();\n } else {\n buffer << std::cin.rdbuf();\n }\n cl_args.input = buffer.str();\n }\n\n try {\n \/\/ Build problem.\n vroom::Input problem_instance = vroom::io::parse(cl_args);\n\n vroom::Solution sol = (cl_args.check)\n ? problem_instance.check(cl_args.nb_threads)\n : problem_instance.solve(cl_args.exploration_level,\n cl_args.nb_threads,\n cl_args.timeout,\n cl_args.h_params);\n\n \/\/ Write solution.\n vroom::io::write_to_json(sol, cl_args.geometry, cl_args.output_file);\n } catch (const vroom::Exception& e) {\n std::cerr << \"[Error] \" << e.message << std::endl;\n vroom::io::write_to_json({e.error_code, e.message},\n false,\n cl_args.output_file);\n exit(e.error_code);\n }\n#if USE_LIBOSRM\n catch (const osrm::exception& e) {\n \/\/ In case of an unhandled routing error.\n auto error_code = vroom::RoutingException(\"\").error_code;\n auto message = \"Routing problem: \" + std::string(e.what());\n std::cerr << \"[Error] \" << message << std::endl;\n vroom::io::write_to_json({error_code, message}, false, cl_args.output_file);\n exit(error_code);\n }\n#endif\n catch (const std::exception& e) {\n \/\/ In case of an unhandled internal error.\n auto error_code = vroom::InternalException(\"\").error_code;\n std::cerr << \"[Error] \" << e.what() << std::endl;\n vroom::io::write_to_json({error_code, e.what()},\n false,\n cl_args.output_file);\n exit(error_code);\n }\n\n return 0;\n}\n<|endoftext|>"} {"text":"<commit_before>#include <limits>\n\/\/#include <sys\/stat.h>\n#include <cerrno>\n#include <cstring>\n#include <system_error>\n#include <iostream>\n#include <fstream>\n\n\/*\n#include <stdio.h>\n#include <stdlib.h>\n#include <sys\/mman.h>\n#include <fcntl.h>\n#include <string.h>\n*\/\n\n#ifdef _WIN32\n\n#ifndef EFU_SIMPLEREADHKLMKEY_H\n#include \"simple_read_hklm_key.h\"\n#endif\n\n#endif\n\n#ifndef EFU_EFULAUNCHER_H\n#include \"efulauncher.h\"\n#endif\n\n#ifndef EFU_CURLEASY_H\n#include \"curleasy.h\"\n#endif\n\nbool confirm()\n{\n char c;\n do\n {\n std::cin >> c;\n std::cin.ignore(std::numeric_limits<std::streamsize>::max(), '\\n');\n c = static_cast<char>(tolower(c));\n } while (c != 'y' && c != 'n');\n return c == 'y';\n}\n\n\n\nint main(int, char *argv[])\n{\n CurlGlobalInit curl_global;\n\n#ifdef _WIN32\n std::string nwn_bin(\"nwmain.exe\");\n std::string nwn_root_dir(\".\/\");\n std::ifstream nwn(nwn_root_dir + nwn_bin, std::ios::binary);\n if (!nwn)\n {\n std::cout << \"Current launcher directory not detected as NWN root\"\\\n \" directory.\";\n nwn_root_dir = \"C:\/NeverwinterNights\/NWN\/\";\n std::cout << \"\\nTrying \" << nwn_root_dir << \"... \";\n nwn.open(nwn_root_dir + nwn_bin, std::ios::binary);\n\n if (!nwn)\n {\n std::cout << \"not found.\\nSearching registry... \";\n SimpleReadHKLMKey reg(\"SOFTWARE\\\\BioWare\\\\NWN\\\\Neverwinter\",\n \"Location\");\n if (reg.good())\n {\n nwn_root_dir = reg.str();\n std::cout << \"key found.\";\n auto path_sep = nwn_root_dir.at(nwn_root_dir.size() - 1);\n if (path_sep != '\/' && path_sep != '\\\\')\n {\n nwn_root_dir.append(\"\/\");\n }\n std::cout << \"\\nTrying \" << nwn_root_dir << \"... \";\n nwn.open(nwn_root_dir + nwn_bin, std::ios::binary);\n if (!nwn)\n {\n std::cout << \"not found.\";\n }\n }\n else\n {\n std::cout << \"no key found.\";\n }\n }\n }\n if (nwn)\n {\n std::cout << nwn_bin << \" found.\" << std::endl;\n }\n else\n {\n std::cout << \"\\n\\nNWN root directory not found, known\"\\\n \" options exhausted.\"\\\n \"\\nThe launcher will not be able to download files to the correct\"\\\n \" location or\"\\\n \"\\nlaunch Neverwinter Nights, however, the launcher\"\\\n \" may still download files to\"\\\n \"\\nthe current directory and you can\"\\\n \" move them manually afterwards. To avoid this\"\\\n \"\\nin the future\"\\\n \" either move the launcher to the NWN root directory containing\"\\\n \"\\nnwmain.exe or pass the -nwn=C:\/NeverwinterNights\/NWN flag to\"\\\n \" the launcher\"\\\n \"\\nexecutable, substituting the correct path, quoted\"\\\n \" if it contains spaces:\"\\\n \"\\n\\t-nwn=\\\"X:\/Games\/Neverwinter Nights\/NWN\\\".\"\\\n \"\\n\/ and \\\\ are interchangeable.\"\\\n \"\\nWould you like to download files anyway (y\/n)?\" << std::endl;\n if (!confirm())\n {\n std::cout << \"Exiting EfU Launcher. Goodbye!\" << std::endl;\n return 0;\n }\n }\n#endif\n\n EfuLauncher l(argv[0],\n \"https:\/\/raw.github.com\/commonquail\/efulauncher\/\"\\\n \"master\/versioncheck\");\n\n if (l.has_update())\n {\n std::cout << \"A new version of the launcher is available.\"\\\n \" Would you like to download it (y\/n)?\" << std::endl;\n bool download(confirm());\n if (!download)\n {\n std::cout << \"It is strongly recommended to always use\"\\\n \" the latest launcher. Would you like to download it (y\/n)?\"\n << std::endl;\n download = confirm();\n }\n if (download)\n {\n \/\/ Download.\n std::cout << \"Downloading new launcher...\" << std::endl;\n if (l.get_update())\n {\n std::cout << \"Done. Please extract and run the new launcher.\" << std::endl;\n }\n return 0;\n }\n }\n\n try\n {\n l.stat_targets();\n }\n catch (std::exception &e)\n {\n std::cerr << e.what() << std::endl;\n }\n\n return 0;\n}\n<commit_msg>(Win) Launch nwmain.exe with EfU direct-connect.<commit_after>#include <limits>\n\/\/#include <sys\/stat.h>\n#include <cerrno>\n#include <cstring>\n#include <system_error>\n#include <iostream>\n#include <fstream>\n#include <vector>\n\n\/*\n#include <stdio.h>\n#include <stdlib.h>\n#include <sys\/mman.h>\n#include <fcntl.h>\n#include <string.h>\n*\/\n\n#ifdef _WIN32\n\n#ifndef EFU_SIMPLEREADHKLMKEY_H\n#include \"simple_read_hklm_key.h\"\n#endif\n\n#ifndef EFU_TARGET_H\n#include \"target.h\"\n#endif\n\n#ifndef EFU_WINERRORSTRING_H\n#include \"win_error_string.h\"\n#endif\n\n#endif\n\n#ifndef EFU_EFULAUNCHER_H\n#include \"efulauncher.h\"\n#endif\n\n#ifndef EFU_CURLEASY_H\n#include \"curleasy.h\"\n#endif\n\nbool confirm()\n{\n char c;\n do\n {\n std::cin >> c;\n std::cin.ignore(std::numeric_limits<std::streamsize>::max(), '\\n');\n c = static_cast<char>(tolower(c));\n } while (c != 'y' && c != 'n');\n return c == 'y';\n}\n\n\n\nint main(int argc, char *argv[])\n{\n CurlGlobalInit curl_global;\n\n#ifdef _WIN32\n std::string nwn_bin(\"nwmain.exe\");\n std::string nwn_root_dir(\".\/\");\n std::ifstream nwn(nwn_root_dir + nwn_bin, std::ios::binary);\n if (!nwn)\n {\n std::cout << \"Current launcher directory not detected as NWN root\"\\\n \" directory.\";\n nwn_root_dir = \"C:\/NeverwinterNights\/NWN\/\";\n std::cout << \"\\nTrying \" << nwn_root_dir << \"... \";\n nwn.open(nwn_root_dir + nwn_bin, std::ios::binary);\n\n if (!nwn)\n {\n std::cout << \"not found.\\nSearching registry... \";\n SimpleReadHKLMKey reg(\"SOFTWARE\\\\BioWare\\\\NWN\\\\Neverwinter\",\n \"Location\");\n if (reg.good())\n {\n nwn_root_dir = reg.str();\n std::cout << \"key found.\";\n auto path_sep = nwn_root_dir.at(nwn_root_dir.size() - 1);\n if (path_sep != '\/' && path_sep != '\\\\')\n {\n nwn_root_dir.append(\"\/\");\n }\n std::cout << \"\\nTrying \" << nwn_root_dir << \"... \";\n nwn.open(nwn_root_dir + nwn_bin, std::ios::binary);\n if (!nwn)\n {\n std::cout << \"not found.\";\n }\n }\n else\n {\n std::cout << \"no key found.\";\n }\n }\n }\n if (nwn)\n {\n std::cout << nwn_bin << \" found.\" << std::endl;\n }\n else\n {\n std::cout << \"\\n\\nNWN root directory not found, known\"\\\n \" options exhausted.\"\\\n \"\\nThe launcher will not be able to download files to the correct\"\\\n \" location or\"\\\n \"\\nlaunch Neverwinter Nights, however, the launcher\"\\\n \" may still download files to\"\\\n \"\\nthe current directory and you can\"\\\n \" move them manually afterwards. To avoid this\"\\\n \"\\nin the future\"\\\n \" either move the launcher to the NWN root directory containing\"\\\n \"\\nnwmain.exe or pass the -nwn=C:\/NeverwinterNights\/NWN flag to\"\\\n \" the launcher\"\\\n \"\\nexecutable, substituting the correct path, quoted\"\\\n \" if it contains spaces:\"\\\n \"\\n\\t-nwn=\\\"X:\/Games\/Neverwinter Nights\/NWN\\\".\"\\\n \"\\n\/ and \\\\ are interchangeable.\"\\\n \"\\nWould you like to download files anyway (y\/n)?\" << std::endl;\n if (!confirm())\n {\n std::cout << \"Exiting EfU Launcher. Goodbye!\" << std::endl;\n return 0;\n }\n }\n#endif\n\n EfuLauncher l(argv[0],\n \"https:\/\/raw.github.com\/commonquail\/efulauncher\/\"\\\n \"master\/versioncheck\");\n\n if (l.has_update())\n {\n std::cout << \"A new version of the launcher is available.\"\\\n \" Would you like to download it (y\/n)?\" << std::endl;\n bool download(confirm());\n if (!download)\n {\n std::cout << \"It is strongly recommended to always use\"\\\n \" the latest launcher. Would you like to download it (y\/n)?\"\n << std::endl;\n download = confirm();\n }\n if (download)\n {\n \/\/ Download.\n std::cout << \"Downloading new launcher...\" << std::endl;\n if (l.get_update())\n {\n std::cout << \"Done. Please extract and run the new launcher.\" << std::endl;\n }\n return 0;\n }\n }\n\n try\n {\n l.stat_targets();\n }\n catch (std::exception &e)\n {\n std::cerr << e.what() << std::endl;\n }\n\n#ifdef _WIN32\n if (nwn)\n {\n STARTUPINFO si;\n PROCESS_INFORMATION pi;\n ::ZeroMemory(&pi, sizeof(pi));\n ::ZeroMemory(&si, sizeof(si));\n si.cb = sizeof(si);\n \n auto nwn_path(nwn_root_dir + nwn_bin);\n auto cmd_line(nwn_path + \" +connect nwn.efupw.com:5121\");\n \n const std::vector<const std::string> args(argv + 1, argv + argc);\n\n for (size_t i = 0; i < args.size(); ++i)\n {\n auto arg(args.at(i));\n \n if (arg.find(\"-dmpass\") == 0)\n {\n auto cmd(split(arg, '='));\n if (cmd.size() == 2)\n {\n cmd_line.append(\" -dmc +password \" + cmd.at(1));\n }\n else\n {\n std::cout << \"-dmpass specified but no value given. Use\\n\"\\\n \"-dmpass=mypassword\" <<std::endl;\n }\n }\n else if (arg.find(\"-nwn\") == 0)\n {\n auto cmd(split(arg, '='));\n if (cmd.size() == 2)\n {\n\/\/ cmd_line.append(\" -nwn \" + cmd.at(1));\n }\n else\n {\n std::cout << \"-nwn specified but no value given. Use\\n\"\\\n \"-nwn=\\\"path\\\\to\\\\NWN\\\\directory\\\\\" <<std::endl;\n }\n }\n else\n {\n std::cout << \"Ignoring unrecognized argument: \" << arg\n << std::endl;\n }\n }\n\n BOOL success = ::CreateProcess(\n const_cast<char *>(nwn_path.c_str()),\n const_cast<char *>(cmd_line.c_str()),\n NULL, \/\/ Process handle not inheritable\n NULL, \/\/ Thread handle not inheritable\n FALSE, \/\/ Set handle inheritance to FALSE\n 0, \/\/ No creation flags\n NULL, \/\/ Use parent's environment block\n const_cast<char *>(nwn_root_dir.c_str()), \/\/ Starting directory \n &si, &pi);\n if (success)\n {\n ::CloseHandle(pi.hProcess);\n ::CloseHandle(pi.hThread);\n }\n else\n {\n WinErrorString we;\n std::cout << we.str() << std::endl;\n }\n }\n#endif\n\n return 0;\n}\n<|endoftext|>"} {"text":"<commit_before>#include <iostream>\n#include <unistd.h>\n#include <stdio.h>\n#include <errno.h>\n#include <sys\/types.h>\n#include <sys\/stat.h>\n#include <string>\n#include <vector>\n#include <queue>\n#include <boost\/tokenizer.hpp>\n#include <boost\/algorithm\/string.hpp>\n#include \"argument.h\"\n#include \"parse.h\"\n#include <cstddef>\n#include <stdexcept>\n\nusing namespace std;\nusing namespace boost;\n\ntypedef boost::tokenizer<boost::char_separator<char> > mytok;\ntypedef mytok::iterator tok_it;\n\nint main()\n{\n\twhile(1) {\n\t\ttry {\n\t\t\t\/\/ Declare variables\n\t\t\tchar *login = getlogin();\n\t\t\tchar host[200];\n\t\t if(gethostname(host, 200) == -1) perror(\"hostname\");\n\t\t\tstring bash_input;\n\t\t\t\n\t\t\t\/\/ Output user information\n\t\t\tcout << login << \"@\" << host << \"$ \";\n\t\t\tgetline(cin, bash_input);\n\t\n\t\t\t\/\/ Look for comments and remove comments if necessary\n\t\t\tsize_t s = bash_input.find(\"#\");\n\t\t\tif (s != string::npos) {\n\t\t\t\tbash_input.erase(s);\n\t\t\t}\n\t\t\t\n\t\t\t\/\/ Trim left and right whitespace\n\t\t\tstring bash_command = trim_copy(bash_input);\n\t\t\t\n \n \/\/ Now look for exit as only command and quit if necessary\n\t\t\tif (bash_command == \"exit\") {\n\t\t\t\texit(0);\n\t\t\t}\n\t\t\t\n\t\t\t\/\/ Create commands and execute bash line\n\t\t\tBase* start = parse(bash_command);\n if (start != 0) {\n\t\t\t\tstart->execute();\n\t\t\t}\n\t\t\tdelete start;\n\t\t}\n\t\tcatch (runtime_error &e) {\n\t\t\tcout << \"-rshell: \" << e.what() << endl;\n\t\t}\n\t}\n\t\n\treturn 0;\n}\n<commit_msg>added directory to prompt<commit_after>#include <iostream>\n#include <unistd.h>\n#include <stdio.h>\n#include <stdlib.h>\n#include <errno.h>\n#include <sys\/types.h>\n#include <sys\/stat.h>\n#include <string>\n#include <vector>\n#include <queue>\n#include <boost\/tokenizer.hpp>\n#include <boost\/algorithm\/string.hpp>\n#include \"argument.h\"\n#include \"parse.h\"\n#include <cstddef>\n#include <stdexcept>\n\nusing namespace std;\nusing namespace boost;\n\ntypedef boost::tokenizer<boost::char_separator<char> > mytok;\ntypedef mytok::iterator tok_it;\n\nint main()\n{\n\twhile(1) \n\t{\n\t\ttry \n\t\t{\n\t\t\t\/\/ Declare variables\n\t\t\tchar *login = getlogin();\n\t\t\tchar host[200];\n\t\t if(gethostname(host, 200) == -1) perror(\"hostname\");\n\t\t\tstring bash_input;\n\t\t\t\n\t\t\t\/\/ Output user information\n\t\t\tcout << login << \"@\" << host << ':' << getenv(\"PWD\") << \" $ \";\n\t\t\tgetline(cin, bash_input);\n\t\n\t\t\t\/\/ Look for comments and remove comments if necessary\n\t\t\tsize_t s = bash_input.find(\"#\");\n\t\t\tif (s != string::npos) \n\t\t\t{\n\t\t\t\tbash_input.erase(s);\n\t\t\t}\n\t\t\t\n\t\t\t\/\/ Trim left and right whitespace\n\t\t\tstring bash_command = trim_copy(bash_input);\n\t\t\t\n \n \/\/ Now look for exit as only command and quit if necessary\n\t\t\tif (bash_command == \"exit\") \n\t\t\t{\n\t\t\t\texit(0);\n\t\t\t}\n\t\t\t\n\t\t\t\/\/ Create commands and execute bash line\n\t\t\tBase* start = parse(bash_command);\n \tif (start != 0) \n \t{\n\t\t\t\tstart->execute();\n\t\t\t}\n\n\t\t\tdelete start;\n\n\t\t}\n\t\tcatch (runtime_error &e) {\n\t\t\tcout << \"-rshell: \" << e.what() << endl;\n\t\t}\n\t}\n\t\n\treturn 0;\n}\n<|endoftext|>"} {"text":"<commit_before>\/**\n * This file is part of Slideshow.\n * Copyright (C) 2008-2010 David Sveningsson <ext@sidvind.com>\n *\n * Slideshow is free software: you can redistribute it and\/or modify\n * it under the terms of the GNU Affero General Public License as\n * published by the Free Software Foundation, either version 3 of the\n * License, or (at your option) any later version.\n *\n * Slideshow is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the\n * GNU Affero General Public License for more details.\n *\n * You should have received a copy of the GNU Affero General Public License\n * along with Slideshow. If not, see <http:\/\/www.gnu.org\/licenses\/>.\n *\/\n\n#ifdef HAVE_CONFIG_H\n#\tinclude \"config.h\"\n#endif\n\n#include \"Kernel.h\"\n#include \"ForegroundApp.h\"\n\n#ifdef BUILD_DAEMON\n#\tinclude \"DaemonApp.h\"\n#endif \/* BUILD_DAEMON *\/\n\n#include \"Log.h\"\n#include \"exception.h\"\n#include \"module_loader.h\"\n#include \"path.h\"\n#include <cstring>\n#include <cstdlib>\n#include <limits.h>\n#include <signal.h>\n#include <portable\/portable.h>\n#include <portable\/time.h>\n#include \"backend\/platform.h\"\n#include \"Browser.h\"\n\n\/\/ for getcwd\n#ifdef WIN32\n#\tinclude <direct.h>\n#\tdefine getcwd _getcwd\n#\tdefine PATH_MAX _MAX_PATH\n#endif\n\nstatic Kernel* application = NULL;\n\nstatic void sighandler(int signum){\n\tswitch ( signum ){\n\tcase SIGINT:\n\t\tLog::verbose(\"IPC: Quit\\n\");\n\t\tapplication->quit();\n\t\tbreak;\n\tcase SIGHUP:\n\t\tLog::verbose(\"IPC: Reload browser\\n\");\n\t\tapplication->reload_browser();\n\t\tsignal(SIGHUP, sighandler);\n\t\tbreak;\n\t}\n}\n\nint main( int argc, const char* argv[] ){\n\ttry {\n\n\t\t\/\/ Default arguments\n\t\tKernel::argument_set_t arguments = {\n\t\t\tKernel::ForegroundMode, \/\/ mode\n\t\t\tLog_Info, \t\t\t\t\/\/ loglevel\n\t\t\tfalse,\t\t\t\t\t\/\/ fullscreen\n\t\t\tfalse,\t\t\t\t\t\/\/ have_password\n\t\t\t0, \t\t\t\t\t\t\/\/ queue_id\n\t\t\t800,\t\t\t\t\t\/\/ width\n\t\t\t600,\t\t\t\t\t\/\/ height\n\t\t\t3.0f,\t\t\t\t\t\/\/ transition_time;\n\t\t\t5.0f,\t\t\t\t\t\/\/ switch_time;\n\t\t\tNULL,\t\t\t\t\t\/\/ connection_string\n\t\t\tNULL,\t\t\t\t\t\/\/ transition_string\n\t\t\tNULL,\t\t\t\t\t\/\/ file log\n\t\t\tNULL,\t\t\t\t\t\/\/ named pipe log\n\t\t\tNULL,\t\t\t\t\t\/\/ unix domain socket log\n\n\t\t\tNULL, \/\/ Frontend URL.\n\t\t\tNULL, \/\/ Instance name.\n\t\t};\n\n\t\t\/\/ Parse the cli arguments, overriding the defaults. Throw an exception\n\t\t\/\/ if running as a child (e.g. from a front-end).\n\t\tif ( !Kernel::parse_arguments(arguments, argc, argv) && !isatty(STDOUT_FILENO) ){\n\t\t\tthrow exception(\"Failed to parse commandline arguments\");\n\t\t}\n\n\t\tportable_init(stderr);\n\t\tmoduleloader_init(pluginpath());\n\t\tPlatformBackend::register_all();\n\n\t\tLog::initialize();\n\n\t\t\/* only log to stdout if no other destination has been set *\/\n\t\tif ( !(arguments.log_file || arguments.log_fifo || arguments.log_domain) ){\n\t\t\tLog::add_destination(new FileDestination(stdout));\n\t\t}\n\n\t\t\/* setup file log *\/\n\t\tif ( arguments.log_file ){\n\t\t\tLog::add_destination(new FileDestination(arguments.log_file));\n\t\t}\n\n\t\t\/* setup named pipe log *\/\n\t\tif ( arguments.log_fifo ){\n\t\t\tLog::add_destination(new FIFODestination(arguments.log_fifo));\n\t\t}\n\n\t\t\/* setup unix domain socket log *\/\n\t\tif ( arguments.log_domain ){\n\t\t\tUDSServer d(arguments.log_domain);\n\t\t\td.accept(NULL);\n\t\t}\n\n#ifdef HAVE_SYSLOG\n\t\tLog::add_destination(new SyslogDestination());\n#endif \/* HAVE_SYSLOG *\/\n\t\t\/\/Log::set_level( (Log::Severity)arguments.loglevel );\n\n\t\t\/* Kernel takes ownership of backend and will release memory when finished *\/\n\t\tconst char* backend_name = \"sdl\";\n\t\tPlatformBackend* backend = PlatformBackend::factory(backend_name);\n\t\tif ( !backend ){\n\t\t\tthrow exception(\"Failed to create a backend named \\\"%s\\\"\", backend_name);\n\t\t}\n\n\t\tswitch ( arguments.mode ){\n\t\t\tcase Kernel::ForegroundMode:\n\t\t\t\tapplication = new ForegroundApp(arguments, backend);\n\t\t\t\tbreak;\n\t\t\tcase Kernel::DaemonMode:\n#ifdef BUILD_DAEMON\n\t\t\t\tapplication = new DaemonApp(arguments, backend); break;\n#else \/* BUILD_DAEMON *\/\n\t\t\t\tthrow exception(\"DaemonMode is not supported on this platform.\");\n#endif \/* BUILD_DAEMON *\/\n\t\t\tcase Kernel::ListTransitionMode:\n\t\t\t\tKernel::print_transitions();\n\t\t\t\tthrow ExitException();\n\t\t\tdefault:\n\t\t\t\tthrow exception(\"No valid mode. This should not happen, please report this to the maintainer. Modeid: %d\\n\", arguments.mode);\n\t\t}\n\n\t\tsignal(SIGINT, sighandler);\n\t\tsignal(SIGHUP, sighandler);\n\n\t\tapplication->init();\n\t\tapplication->run();\n\t\tapplication->cleanup();\n\n\t\tdelete application;\n\t\tapplication = NULL;\n\n\t\tmoduleloader_cleanup();\n\t\tPlatformBackend::register_cleanup();\n\n\t\tLog::cleanup();\n\n\t} catch ( ExitException &e ){\n\t\tprintf(\"exit exception\\n\");\n\t\treturn e.code();\n\n\t} catch ( exception &e ){\n\t\t\/* Handle unhandled exceptions, if anythin makes it here it is a fatal\n\t\t * error and it is not possible to continue operation. *\/\n\n\t\tchar cwd[PATH_MAX];\n\n\t\tif ( getcwd(cwd, 256) == NULL ){\n\t\t\tfprintf(stderr, \"Failed to get cwd\\n\");\n\t\t\tcwd[0] = '\\0';\n\t\t}\n\n\t\tfprintf(stderr, \" *** slideshow unhandled exception ***\\n\");\n\t\tfprintf(stderr, \"\\tcwd: %s\\n\", cwd);\n\t\tfprintf(stderr, \"\\tSource: %s:%d\\n\", e.file(), e.line());\n\t\tfprintf(stderr, \"\\tMessage: %s\\n\\n\", e.what());\n\t\tfprintf(stderr, \"Troubleshooting:\\n\");\n\t\tfprintf(stderr, \" - Make sure that all required dll's are installed.\\n\");\n\t\tfprintf(stderr, \" - Make sure that the cwd is correct.\\n\\n\");\n\t\tfprintf(stderr, \"If the problem persists report the bug at\\n\"\n\t\t\t\t\"http:\/\/sidvind.com:8000\/slideshow\/newticket\\n\"\n\t\t\t\t\"and copy the entire output from the console.\\n\\n\");\n\t\tfprintf(stderr, \"This is a fatal error, the application will now terminate!\\n\\n\");\n\n\t\tfflush(stderr);\n\n\t\tif ( getenv(\"SLIDESHOW_NO_ABORT\") ) {\n\t\t\treturn 1;\n\t\t} else {\n#ifdef WIN32\n\t\t\t__debugbreak();\n#elif defined(__GNUC__)\n\t\t\t__builtin_trap();\n#else\n\t\t\tabort();\n#endif\n\t\t}\n\n\t\t\/* silence compiler warnings *\/\n\t\treturn -1;\n\t}\n\n\treturn 0;\n}\n<commit_msg>update crash message to reflect move to github and add package version.<commit_after>\/**\n * This file is part of Slideshow.\n * Copyright (C) 2008-2010 David Sveningsson <ext@sidvind.com>\n *\n * Slideshow is free software: you can redistribute it and\/or modify\n * it under the terms of the GNU Affero General Public License as\n * published by the Free Software Foundation, either version 3 of the\n * License, or (at your option) any later version.\n *\n * Slideshow is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the\n * GNU Affero General Public License for more details.\n *\n * You should have received a copy of the GNU Affero General Public License\n * along with Slideshow. If not, see <http:\/\/www.gnu.org\/licenses\/>.\n *\/\n\n#ifdef HAVE_CONFIG_H\n#\tinclude \"config.h\"\n#endif\n\n#include \"Kernel.h\"\n#include \"ForegroundApp.h\"\n\n#ifdef BUILD_DAEMON\n#\tinclude \"DaemonApp.h\"\n#endif \/* BUILD_DAEMON *\/\n\n#include \"Log.h\"\n#include \"exception.h\"\n#include \"module_loader.h\"\n#include \"path.h\"\n#include <cstring>\n#include <cstdlib>\n#include <limits.h>\n#include <signal.h>\n#include <portable\/portable.h>\n#include <portable\/time.h>\n#include \"backend\/platform.h\"\n#include \"Browser.h\"\n\n\/\/ for getcwd\n#ifdef WIN32\n#\tinclude <direct.h>\n#\tdefine getcwd _getcwd\n#\tdefine PATH_MAX _MAX_PATH\n#endif\n\nstatic Kernel* application = NULL;\n\nstatic void sighandler(int signum){\n\tswitch ( signum ){\n\tcase SIGINT:\n\t\tLog::verbose(\"IPC: Quit\\n\");\n\t\tapplication->quit();\n\t\tbreak;\n\tcase SIGHUP:\n\t\tLog::verbose(\"IPC: Reload browser\\n\");\n\t\tapplication->reload_browser();\n\t\tsignal(SIGHUP, sighandler);\n\t\tbreak;\n\t}\n}\n\nint main( int argc, const char* argv[] ){\n\ttry {\n\n\t\t\/\/ Default arguments\n\t\tKernel::argument_set_t arguments = {\n\t\t\tKernel::ForegroundMode, \/\/ mode\n\t\t\tLog_Info, \t\t\t\t\/\/ loglevel\n\t\t\tfalse,\t\t\t\t\t\/\/ fullscreen\n\t\t\tfalse,\t\t\t\t\t\/\/ have_password\n\t\t\t0, \t\t\t\t\t\t\/\/ queue_id\n\t\t\t800,\t\t\t\t\t\/\/ width\n\t\t\t600,\t\t\t\t\t\/\/ height\n\t\t\t3.0f,\t\t\t\t\t\/\/ transition_time;\n\t\t\t5.0f,\t\t\t\t\t\/\/ switch_time;\n\t\t\tNULL,\t\t\t\t\t\/\/ connection_string\n\t\t\tNULL,\t\t\t\t\t\/\/ transition_string\n\t\t\tNULL,\t\t\t\t\t\/\/ file log\n\t\t\tNULL,\t\t\t\t\t\/\/ named pipe log\n\t\t\tNULL,\t\t\t\t\t\/\/ unix domain socket log\n\n\t\t\tNULL, \/\/ Frontend URL.\n\t\t\tNULL, \/\/ Instance name.\n\t\t};\n\n\t\t\/\/ Parse the cli arguments, overriding the defaults. Throw an exception\n\t\t\/\/ if running as a child (e.g. from a front-end).\n\t\tif ( !Kernel::parse_arguments(arguments, argc, argv) && !isatty(STDOUT_FILENO) ){\n\t\t\tthrow exception(\"Failed to parse commandline arguments\");\n\t\t}\n\n\t\tportable_init(stderr);\n\t\tmoduleloader_init(pluginpath());\n\t\tPlatformBackend::register_all();\n\n\t\tLog::initialize();\n\n\t\t\/* only log to stdout if no other destination has been set *\/\n\t\tif ( !(arguments.log_file || arguments.log_fifo || arguments.log_domain) ){\n\t\t\tLog::add_destination(new FileDestination(stdout));\n\t\t}\n\n\t\t\/* setup file log *\/\n\t\tif ( arguments.log_file ){\n\t\t\tLog::add_destination(new FileDestination(arguments.log_file));\n\t\t}\n\n\t\t\/* setup named pipe log *\/\n\t\tif ( arguments.log_fifo ){\n\t\t\tLog::add_destination(new FIFODestination(arguments.log_fifo));\n\t\t}\n\n\t\t\/* setup unix domain socket log *\/\n\t\tif ( arguments.log_domain ){\n\t\t\tUDSServer d(arguments.log_domain);\n\t\t\td.accept(NULL);\n\t\t}\n\n#ifdef HAVE_SYSLOG\n\t\tLog::add_destination(new SyslogDestination());\n#endif \/* HAVE_SYSLOG *\/\n\t\t\/\/Log::set_level( (Log::Severity)arguments.loglevel );\n\n\t\t\/* Kernel takes ownership of backend and will release memory when finished *\/\n\t\tconst char* backend_name = \"sdl\";\n\t\tPlatformBackend* backend = PlatformBackend::factory(backend_name);\n\t\tif ( !backend ){\n\t\t\tthrow exception(\"Failed to create a backend named \\\"%s\\\"\", backend_name);\n\t\t}\n\n\t\tswitch ( arguments.mode ){\n\t\t\tcase Kernel::ForegroundMode:\n\t\t\t\tapplication = new ForegroundApp(arguments, backend);\n\t\t\t\tbreak;\n\t\t\tcase Kernel::DaemonMode:\n#ifdef BUILD_DAEMON\n\t\t\t\tapplication = new DaemonApp(arguments, backend); break;\n#else \/* BUILD_DAEMON *\/\n\t\t\t\tthrow exception(\"DaemonMode is not supported on this platform.\");\n#endif \/* BUILD_DAEMON *\/\n\t\t\tcase Kernel::ListTransitionMode:\n\t\t\t\tKernel::print_transitions();\n\t\t\t\tthrow ExitException();\n\t\t\tdefault:\n\t\t\t\tthrow exception(\"No valid mode. This should not happen, please report this to the maintainer. Modeid: %d\\n\", arguments.mode);\n\t\t}\n\n\t\tsignal(SIGINT, sighandler);\n\t\tsignal(SIGHUP, sighandler);\n\n\t\tapplication->init();\n\t\tapplication->run();\n\t\tapplication->cleanup();\n\n\t\tdelete application;\n\t\tapplication = NULL;\n\n\t\tmoduleloader_cleanup();\n\t\tPlatformBackend::register_cleanup();\n\n\t\tLog::cleanup();\n\n\t} catch ( ExitException &e ){\n\t\tprintf(\"exit exception\\n\");\n\t\treturn e.code();\n\n\t} catch ( exception &e ){\n\t\t\/* Handle unhandled exceptions, if anythin makes it here it is a fatal\n\t\t * error and it is not possible to continue operation. *\/\n\n\t\tchar cwd[PATH_MAX];\n\n\t\tif ( getcwd(cwd, 256) == NULL ){\n\t\t\tfprintf(stderr, \"Failed to get cwd\\n\");\n\t\t\tcwd[0] = '\\0';\n\t\t}\n\n\t\tfprintf(stderr, \" *** \"PACKAGE\" unhandled exception ***\\n\");\n\t\tfprintf(stderr, \"\\tversion: \"PACKAGE\"-\"VERSION\"\\n\");\n\t\tfprintf(stderr, \"\\tcwd: %s\\n\", cwd);\n\t\tfprintf(stderr, \"\\tSource: %s:%d\\n\", e.file(), e.line());\n\t\tfprintf(stderr, \"\\tMessage: %s\\n\\n\", e.what());\n\t\tfprintf(stderr, \"Troubleshooting:\\n\");\n\t\tfprintf(stderr, \" - Make sure that all required shared libraries are installed.\\n\");\n\t\tfprintf(stderr, \" - Make sure that the cwd is correct.\\n\\n\");\n\t\tfprintf(stderr, \"If the problem persists report the bug at\\n\"\n\t\t\t\t\"https:\/\/github.com\/ext\/slideshow\/issues\/new\\n\"\n\t\t\t\t\"and copy the entire output from the console.\\n\\n\");\n\t\tfprintf(stderr, \"This is a fatal error, the application will now terminate!\\n\\n\");\n\n\t\tfflush(stderr);\n\n\t\tif ( getenv(\"SLIDESHOW_NO_ABORT\") ) {\n\t\t\treturn 1;\n\t\t} else {\n#ifdef WIN32\n\t\t\t__debugbreak();\n#elif defined(__GNUC__)\n\t\t\t__builtin_trap();\n#else\n\t\t\tabort();\n#endif\n\t\t}\n\n\t\t\/* silence compiler warnings *\/\n\t\treturn -1;\n\t}\n\n\treturn 0;\n}\n<|endoftext|>"} {"text":"<commit_before>#include <iostream>\n#include \"input\/filter.h\"\n#include \"input\/format.h\"\n#include \"encoder\/encoder.h\"\n#include \"sjoin\/sjoin.h\"\n#include \"virtualizer\/virtualizer.h\"\n#include <ctime>\n#include <stdio.h>\n\nint process_filter_graph(Format *fmt, Filter *filter, std::string sofa_file_name) {\n FILE *fl;\n FILE *fr;\n FILE *fc;\n FILE *bl;\n FILE *br;\n const char * fl_filename = \"FL.aac\";\n const char * fr_filename = \"FR.aac\";\n const char * fc_filename = \"FC.aac\";\n const char * bl_filename = \"BL.aac\";\n const char * br_filename = \"BR.aac\";\n\n AVPacket packet, packet0;\n AVFrame *frame = av_frame_alloc();\n AVFrame *filt_frame = av_frame_alloc();\n int got_frame;\n\n\n std::unordered_map<Filter::Channel, Virtualizer*, std::hash<int>> c2v_;\n complete_sofa sofa_;\n\n\n AVPacket packet_out;\n int got_output;\n\n Encoder *encoder = new Encoder(AV_CODEC_ID_AC3,\n fmt->decoder_ctx->bit_rate, AV_SAMPLE_FMT_FLTP);\n\n SJoin *sjoin = new SJoin(encoder);\n\n fl = fopen(fl_filename, \"wb\");\n fr = fopen(fr_filename, \"wb\");\n fc = fopen(fc_filename, \"wb\");\n bl = fopen(bl_filename, \"wb\");\n br = fopen(br_filename, \"wb\");\n if(!fl || !fr || !fc || !bl || !br) {\n std::cout << \"Error opening file\" << std::endl;\n }\n\n int ret = 0;\n\n \/* Read all of the packets *\/\n packet0.data = NULL;\n packet.data = NULL;\n while(1) {\n\n if(!packet0.data) {\n ret = av_read_frame(fmt->format_ctx, &packet);\n if(ret < 0) break;\n packet0 = packet;\n }\n\n if(packet.stream_index == fmt->audio_stream_index) {\n got_frame = 0;\n ret = avcodec_decode_audio4(fmt->decoder_ctx, frame, &got_frame, &packet);\n\n if(ret < 0) {\n av_log(NULL, AV_LOG_ERROR, \"Error decoding audio\\n\");\n continue;\n }\n\n packet.size -= ret;\n packet.data += ret;\n\n if(got_frame) {\n\n \/* push audio from decoded frame through filter graph *\/\n if(av_buffersrc_add_frame_flags(filter->abuffer_ctx, frame, 0) < 0) {\n av_log(NULL, AV_LOG_ERROR, \"Error feeding into filter graph\\n\");\n break;\n }\n\n while(ret >= 0) {\n \/\/ This is where you will work with each processed frame.\n\n int i = 0;\n\n for (auto it = filter->abuffersink_ctx_map.begin();\n it != filter->abuffersink_ctx_map.end(); it++) {\n\n ret = av_buffersink_get_frame(it->second, filt_frame);\n if(ret == AVERROR(EAGAIN) || ret == AVERROR_EOF) break;\n\n\n int sample_count = filt_frame->nb_samples;\n int sample_rate = filt_frame->sample_rate;\n\n if (c2v_.count(it->first) == 0) {\n float x;\n float y;\n float z;\n Filter::get_coords(it->first, &x, &y, &z);\n\n if (sofa_.hrtf == NULL) {\n \/\/TODO: delete these after execution\n Virtualizer * virt = new Virtualizer(sofa_file_name.c_str(), sample_rate, x, y, z);\n c2v_.insert(std::make_pair(it->first, virt));\n sofa_ = virt->get_hrtf();\n }\n else {\n \/\/TODO: delete these after execution\n Virtualizer * virt = new Virtualizer(sofa_, sample_rate, x, y, z);\n c2v_.insert(std::make_pair(it->first, virt));\n }\n }\n\n float * samples = Virtualizer::get_float_samples(filt_frame->extended_data[0],\n fmt->decoder_ctx->sample_fmt, sample_count);\n\n float ** float_results = c2v_[it->first]->process(samples, sample_count);\n\n uint8_t * result_l = Virtualizer::get_short_samples(float_results[0],\n fmt->decoder_ctx->sample_fmt, sample_count);\n\n uint8_t * result_r = Virtualizer::get_short_samples(float_results[1],\n fmt->decoder_ctx->sample_fmt, sample_count);\n\n delete[] float_results[0];\n delete[] float_results[1];\n delete[] float_results;\n delete[] samples;\n\n AVFrame *virt_frame = encoder->new_frame(encoder->codec_ctx, result_r,\n result_l);\n\n \/\/ apparently, new_frame just points to our data, it doesn't make a copy\n \/\/free(result_l);\n \/\/free(result_r);\n\n \/\/ This will move once virtualizaiton works\n av_init_packet(&packet_out);\n packet_out.data = NULL;\n packet_out.size = 0;\n\n ret = avcodec_encode_audio2(encoder->codec_ctx, &packet_out, virt_frame, &got_output);\n if(ret < 0) exit(1);\n\n if(it->first == Filter::FL && got_output) fwrite(packet_out.data, 1, packet_out.size, fl);\n else if(it->first == Filter::FR && got_output) fwrite(packet_out.data, 1, packet_out.size, fr);\n else if(it->first == Filter::FC && got_output) fwrite(packet_out.data, 1, packet_out.size, fc);\n else if(it->first == Filter::BL && got_output) fwrite(packet_out.data, 1, packet_out.size, bl);\n else if(it->first == Filter::BR && got_output) fwrite(packet_out.data, 1, packet_out.size, br);\n\n av_free_packet(&packet_out);\n\n \/\/std::cout << \"FR\";\n av_frame_unref(filt_frame);\n \/\/av_frame_unref(r_frame);\n i++;\n }\n av_frame_unref(filt_frame);\n }\n }\n if(packet.size <= 0) av_free_packet(&packet0);\n } else {\n av_free_packet(&packet0);\n }\n }\n\n \/\/for (auto it = c2v_.begin(); it != c2v_.end(); it++) delete it->second;\n\n fclose(fl);\n fclose(fc);\n fclose(fr);\n fclose(bl);\n fclose(br);\n av_frame_free(&frame);\n av_frame_free(&filt_frame);\n delete filter;\n delete fmt;\n}\n\nint main(int argc, char *argv[]) {\n std::string videoFile = std::string(argv[1]);\n std::string sofaFile = std::string(argv[2]);\n\n clock_t begin = clock();\n Format *format = new Format(videoFile);\n Filter *filter = new Filter(format);\n clock_t end = clock();\n\n std::cout << \"Filter initialization: \" << (double)(end - begin) \/ CLOCKS_PER_SEC << \" s\" << std::endl;\n\n begin = clock();\n process_filter_graph(format, filter, sofaFile);\n end = clock();\n\n std::cout << \"Processing Time: \" << (double)(end - begin) \/ CLOCKS_PER_SEC << \" s\" << std::endl;\n return 0;\n}\n<commit_msg>Revert src\/main.cpp back to Conor's version.<commit_after>#include <iostream>\n#include \"input\/filter.h\"\n#include \"input\/format.h\"\n#include \"encoder\/encoder.h\"\n#include \"sjoin\/sjoin.h\"\n#include \"virtualizer\/virtualizer.h\"\n#include <ctime>\n#include <stdio.h>\n\nint process_filter_graph(Format *fmt, Filter *filter, std::string sofa_file_name) {\n FILE *f;\n const char *filename = \"FL.aac\";\n\n AVPacket packet, packet0;\n AVFrame *frame = av_frame_alloc();\n AVFrame *filt_frame = av_frame_alloc();\n int got_frame;\n\n\n std::unordered_map<Filter::Channel, Virtualizer*, std::hash<int>> c2v_;\n complete_sofa sofa_;\n\n\n AVPacket packet_out;\n int got_output;\n\n Encoder *encoder = new Encoder(AV_CODEC_ID_AC3,\n fmt->decoder_ctx->bit_rate, AV_SAMPLE_FMT_FLTP);\n\n SJoin *sjoin = new SJoin(encoder);\n\n f = fopen(filename, \"wb\");\n if(!f) {\n std::cout << \"Error opening file\" << std::endl;\n }\n\n int ret = 0;\n\n \/* Read all of the packets *\/\n packet0.data = NULL;\n packet.data = NULL;\n while(1) {\n\n if(!packet0.data) {\n ret = av_read_frame(fmt->format_ctx, &packet);\n if(ret < 0) break;\n packet0 = packet;\n }\n\n if(packet.stream_index == fmt->audio_stream_index) {\n got_frame = 0;\n ret = avcodec_decode_audio4(fmt->decoder_ctx, frame, &got_frame, &packet);\n\n if(ret < 0) {\n av_log(NULL, AV_LOG_ERROR, \"Error decoding audio\\n\");\n continue;\n }\n\n packet.size -= ret;\n packet.data += ret;\n\n if(got_frame) {\n\n \/* push audio from decoded frame through filter graph *\/\n if(av_buffersrc_add_frame_flags(filter->abuffer_ctx, frame, 0) < 0) {\n av_log(NULL, AV_LOG_ERROR, \"Error feeding into filter graph\\n\");\n break;\n }\n\n while(ret >= 0) {\n \/\/ This is where you will work with each processed frame.\n\n int i;\n\n i = 0;\n for (auto it = filter->abuffersink_ctx_map.begin();\n it != filter->abuffersink_ctx_map.end(); it++) {\n\n ret = av_buffersink_get_frame(it->second, filt_frame);\n if(ret == AVERROR(EAGAIN) || ret == AVERROR_EOF) break;\n\n\n int sample_count = filt_frame->nb_samples;\n int sample_rate = filt_frame->sample_rate;\n\n if (c2v_.count(it->first) == 0) {\n float x;\n float y;\n float z;\n Filter::get_coords(it->first, &x, &y, &z);\n\n if (sofa_.hrtf == NULL) {\n \/\/TODO: delete these after execution\n Virtualizer * virt = new Virtualizer(sofa_file_name.c_str(), sample_rate, x, y, z);\n c2v_.insert(std::make_pair(it->first, virt));\n sofa_ = virt->get_hrtf();\n }\n else {\n \/\/TODO: delete these after execution\n Virtualizer * virt = new Virtualizer(sofa_, sample_rate, x, y, z);\n c2v_.insert(std::make_pair(it->first, virt));\n }\n }\n\n float * samples = Virtualizer::get_float_samples(filt_frame->extended_data[0],\n fmt->decoder_ctx->sample_fmt, sample_count);\n\n float ** float_results = c2v_[it->first]->process(samples, sample_count);\n\n uint8_t * result_l = Virtualizer::get_short_samples(float_results[0],\n fmt->decoder_ctx->sample_fmt, sample_count);\n\n uint8_t * result_r = Virtualizer::get_short_samples(float_results[1],\n fmt->decoder_ctx->sample_fmt, sample_count);\n\n delete[] float_results[0];\n delete[] float_results[1];\n delete[] float_results;\n delete[] samples;\n\n AVFrame *virt_frame = encoder->new_frame(encoder->codec_ctx, result_r,\n result_l);\n\n if(it->first == 0) {\n \/\/std::cout << l_frame->nb_samples << std::endl;\n \/\/std::cout << l_frame->format << std::endl;\n \/\/ This will move once virtualizaiton works\n av_init_packet(&packet_out);\n packet_out.data = NULL;\n packet_out.size = 0;\n\n\n ret = avcodec_encode_audio2(encoder->codec_ctx, &packet_out, virt_frame, &got_output);\n if(ret < 0) exit(1);\n if(got_output) {\n fwrite(packet_out.data, 1, packet_out.size, f);\n av_free_packet(&packet_out);\n }\n }\n\n\n \/\/AVFrame *r_frame = encoder->fill_new_frame(result_r, 2);\n\n \/*\n if(av_buffersrc_add_frame_flags(sjoin->right_abuffers_ctx[i], r_frame, 0) < 0) {\n av_log(NULL, AV_LOG_ERROR, \"Error feeding into filter graph\\n\");\n break;\n }\n *\/\n \/\/ TODO: do something with the result\n\n \/\/std::cout << \"FR\";\n av_frame_unref(filt_frame);\n \/\/av_frame_unref(r_frame);\n i++;\n }\n av_frame_unref(filt_frame);\n }\n }\n if(packet.size <= 0) av_free_packet(&packet0);\n } else {\n av_free_packet(&packet0);\n }\n }\n fclose(f);\n av_frame_free(&frame);\n av_frame_free(&filt_frame);\n delete filter;\n delete fmt;\n}\n\nint main(int argc, char *argv[]) {\n std::string videoFile = std::string(argv[1]);\n std::string sofaFile = std::string(argv[2]);\n\n clock_t begin = clock();\n Format *format = new Format(videoFile);\n Filter *filter = new Filter(format);\n clock_t end = clock();\n\n std::cout << \"Filter initialization: \" << (double)(end - begin) \/ CLOCKS_PER_SEC << \" s\" << std::endl;\n\n begin = clock();\n process_filter_graph(format, filter, sofaFile);\n end = clock();\n\n std::cout << \"Processing Time: \" << (double)(end - begin) \/ CLOCKS_PER_SEC << \" s\" << std::endl;\n return 0;\n}\n<|endoftext|>"} {"text":"<commit_before>#include <stdio.h>\n\n#include <thread>\n#include <SFML\/Graphics\/RenderWindow.hpp>\n#include <SFML\/Graphics\/RectangleShape.hpp>\n\n\n\n#include \"engine\/terrain.hpp\"\n#include \"engine\/unit.hpp\"\n#include \"engine\/engine.hpp\"\n\n#include \"gui\/cursor.hpp\"\n#include \"gui\/guihandler.hpp\"\n#include \"gui\/splashscreen.hpp\"\n#include \"gui\/imagemanager.hpp\"\n#include \"gui\/texturemanager.hpp\"\n\n#include \"config\/tilesetprocessor.hpp\"\n\n\nint main(int argc, char const *argv[])\n{\n\t\/\/ Create and show splash\n\t\/\/qrw::SplashScreen* splash = new qrw::SplashScreen(\".\/res\/img\/splash.png\");\n\t\/\/std::thread splashthread(&qrw::SplashScreen::show, splash);\n\n\t\/\/ Preload image resources.\n\tqrw::ImageManager* imgmgr = qrw::ImageManager::getInstance();\n\timgmgr->loadImage(\"p1swordman\", \".\/res\/img\/units\/p1swordman.png\");\n\timgmgr->loadImage(\"p1archer\", \".\/res\/img\/units\/p1archer.png\");\n\timgmgr->loadImage(\"p1spearman\", \".\/res\/img\/units\/p1spearman.png\");\n\timgmgr->loadImage(\"p2swordman\", \".\/res\/img\/units\/p2swordman.png\");\n\timgmgr->loadImage(\"p2archer\", \".\/res\/img\/units\/p2archer.png\");\n\timgmgr->loadImage(\"p2spearman\", \".\/res\/img\/units\/p2spearman.png\");\n\timgmgr->loadImage(\"plainsquare\", \".\/res\/img\/plainsquare.png\");\n\t\/\/ Preload texture resources.\n\tqrw::TextureManager* texturemanager = qrw::TextureManager::getInstance();\n\tqrw::TilesetProcessor tilesetprocessor;\n\ttilesetprocessor.loadTileset(\".\/res\/defaulttileset.xml\");\n\n\ttexturemanager->loadTexture(\"nextbutton\", \".\/res\/img\/gui\/nextbutton.png\");\n\ttexturemanager->loadTexture(\"nextbutton_hover\", \".\/res\/img\/gui\/nextbutton_hover.png\");\n\ttexturemanager->loadTexture(\"nextbutton_active\", \".\/res\/img\/gui\/nextbutton_active.png\");\n\ttexturemanager->loadTexture(\"health\", \".\/res\/img\/gui\/health.png\");\n\ttexturemanager->loadTexture(\"attack\", \".\/res\/img\/gui\/attack.png\");\n\ttexturemanager->loadTexture(\"defense\", \".\/res\/img\/gui\/defense.png\");\n\ttexturemanager->loadTexture(\"movement\", \".\/res\/img\/gui\/movement.png\");\n\ttexturemanager->loadTexture(\"startbutton\", \".\/res\/img\/gui\/startbutton.png\");\n\n\t\/\/splash->setCloseable(true);\n\t\/\/splashthread.join();\n\t\/\/delete splash;\n\n\tsf::Vector2f windowsize(800, 600);\n\tqrw::Engine engine;\n\tengine.init(10, 4);\n\n\n\/\/ Setup random board for test dings\nqrw::Board* board = engine.getBoard();\nqrw::Terrain* terrain1 = new qrw::Terrain(qrw::ET_WOOD, 1, 2);\nboard->getSquare(0, 0)->setTerrain(terrain1);\nqrw::Terrain* terrain2 = new qrw::Terrain(qrw::ET_HILL, 3, -1);\nboard->getSquare(1, 2)->setTerrain(terrain2);\nqrw::Terrain* terrain3 = new qrw::Terrain(qrw::ET_WALL, 2, 2);\nboard->getSquare(5, 1)->setTerrain(terrain3);\n\n\tsf::RenderWindow renderwindow(sf::VideoMode(windowsize.x, windowsize.y), \"Quad-Ruled War\", sf::Style::Default);\n\tqrw::GuiHandler guihandler(&engine, &renderwindow);\n\tsf::View camera(sf::FloatRect(0.0f, 0.0f, windowsize.x, windowsize.y));\n\trenderwindow.setView(camera);\n\n\tsf::RectangleShape rect(sf::Vector2f(10.0f, 10.0f));\n\trect.setFillColor(sf::Color::Green);\n\n\tsf::Clock clock;\n\tfloat elapsedtime;\n\n\twhile(!guihandler.getQuit())\n\t{\n\t\telapsedtime = clock.restart().asSeconds();\n\t\t\/\/ Event handling\n\t\tsf::Event event;\n\t\twhile(renderwindow.pollEvent(event))\n\t\t\tguihandler.HandleEvent(event);\n\n\t\t\/\/ Rendering\n\t\trenderwindow.clear(sf::Color::Black);\n\t\trenderwindow.draw(rect);\n\n\t\tguihandler.Update(elapsedtime);\n\t\tguihandler.display(renderwindow);\n\n\t\trenderwindow.display();\n\t}\n\n\treturn 0;\n}\n<commit_msg>Now using Settings to initialize game in main.cpp.<commit_after>#include <stdio.h>\n\n#include <thread>\n#include <SFML\/Graphics\/RenderWindow.hpp>\n#include <SFML\/Graphics\/RectangleShape.hpp>\n\n\n\n#include \"engine\/terrain.hpp\"\n#include \"engine\/unit.hpp\"\n#include \"engine\/engine.hpp\"\n\n#include \"gui\/cursor.hpp\"\n#include \"gui\/guihandler.hpp\"\n#include \"gui\/splashscreen.hpp\"\n#include \"gui\/imagemanager.hpp\"\n#include \"gui\/texturemanager.hpp\"\n\n#include \"config\/tilesetprocessor.hpp\"\n#include \"config\/settings.hpp\"\n\n\nint main(int argc, char const *argv[])\n{\n\tqrw::Settings* settings = qrw::Settings::getInstance();\n\tsettings->loadFromFile(\"res\/conf\/settings.xml\");\n\n\t\/\/ Create and show splash\n\t\/\/qrw::SplashScreen* splash = new qrw::SplashScreen(\".\/res\/img\/splash.png\");\n\t\/\/std::thread splashthread(&qrw::SplashScreen::show, splash);\n\n\t\/\/ Preload image resources.\n\tqrw::ImageManager* imgmgr = qrw::ImageManager::getInstance();\n\timgmgr->loadImage(\"p1swordman\", \".\/res\/img\/units\/p1swordman.png\");\n\timgmgr->loadImage(\"p1archer\", \".\/res\/img\/units\/p1archer.png\");\n\timgmgr->loadImage(\"p1spearman\", \".\/res\/img\/units\/p1spearman.png\");\n\timgmgr->loadImage(\"p2swordman\", \".\/res\/img\/units\/p2swordman.png\");\n\timgmgr->loadImage(\"p2archer\", \".\/res\/img\/units\/p2archer.png\");\n\timgmgr->loadImage(\"p2spearman\", \".\/res\/img\/units\/p2spearman.png\");\n\timgmgr->loadImage(\"plainsquare\", \".\/res\/img\/plainsquare.png\");\n\t\/\/ Preload texture resources.\n\tqrw::TextureManager* texturemanager = qrw::TextureManager::getInstance();\n\tqrw::TilesetProcessor tilesetprocessor;\n\ttilesetprocessor.loadTileset(settings->getTilesetPath());\n\n\ttexturemanager->loadTexture(\"nextbutton\", \".\/res\/img\/gui\/nextbutton.png\");\n\ttexturemanager->loadTexture(\"nextbutton_hover\", \".\/res\/img\/gui\/nextbutton_hover.png\");\n\ttexturemanager->loadTexture(\"nextbutton_active\", \".\/res\/img\/gui\/nextbutton_active.png\");\n\ttexturemanager->loadTexture(\"health\", \".\/res\/img\/gui\/health.png\");\n\ttexturemanager->loadTexture(\"attack\", \".\/res\/img\/gui\/attack.png\");\n\ttexturemanager->loadTexture(\"defense\", \".\/res\/img\/gui\/defense.png\");\n\ttexturemanager->loadTexture(\"movement\", \".\/res\/img\/gui\/movement.png\");\n\ttexturemanager->loadTexture(\"startbutton\", \".\/res\/img\/gui\/startbutton.png\");\n\n\t\/\/splash->setCloseable(true);\n\t\/\/splashthread.join();\n\t\/\/delete splash;\n\n\tqrw::Engine engine;\n\tengine.init(10, 4);\n\n\n\/\/ Setup random board for test dings\nqrw::Board* board = engine.getBoard();\nqrw::Terrain* terrain1 = new qrw::Terrain(qrw::ET_WOOD, 1, 2);\nboard->getSquare(0, 0)->setTerrain(terrain1);\nqrw::Terrain* terrain2 = new qrw::Terrain(qrw::ET_HILL, 3, -1);\nboard->getSquare(1, 2)->setTerrain(terrain2);\nqrw::Terrain* terrain3 = new qrw::Terrain(qrw::ET_WALL, 2, 2);\nboard->getSquare(5, 1)->setTerrain(terrain3);\n\n\tsf::RenderWindow renderwindow(\n\t\tsf::VideoMode(settings->getResolutionX(), settings->getResolutionY()),\n\t\t\"Quad-Ruled War\",\n\t\tsf::Style::Default\n\t);\n\n\tqrw::GuiHandler guihandler(&engine, &renderwindow);\n\tsf::View camera(sf::FloatRect(0.0f, 0.0f, settings->getResolutionX(), settings->getResolutionY()));\n\trenderwindow.setView(camera);\n\n\tsf::RectangleShape rect(sf::Vector2f(10.0f, 10.0f));\n\trect.setFillColor(sf::Color::Green);\n\n\tsf::Clock clock;\n\tfloat elapsedtime;\n\n\twhile(!guihandler.getQuit())\n\t{\n\t\telapsedtime = clock.restart().asSeconds();\n\t\t\/\/ Event handling\n\t\tsf::Event event;\n\t\twhile(renderwindow.pollEvent(event))\n\t\t\tguihandler.HandleEvent(event);\n\n\t\t\/\/ Rendering\n\t\trenderwindow.clear(sf::Color::Black);\n\t\trenderwindow.draw(rect);\n\n\t\tguihandler.Update(elapsedtime);\n\t\tguihandler.display(renderwindow);\n\n\t\trenderwindow.display();\n\t}\n\n\treturn 0;\n}\n<|endoftext|>"} {"text":"<commit_before>#include <SFML\/Graphics.hpp>\r\n#include \"PhysSystem.h\"\r\n#include <sstream>\r\n#include <iomanip>\r\n\r\n\/\/50 125 218\r\n\/\/50 50 50\r\n\r\nsf::Vector2f ConvertVector(Vector2f vec)\r\n{\r\n return sf::Vector2f(vec.x, vec.y);\r\n}\r\n\r\nvoid RenderBox(std::vector<sf::Vertex>& vertices, Coords2f coords, Vector2f size, sf::Color color)\r\n{\r\n Vector2f localPoints[4];\r\n localPoints[0] = Vector2f(-size.x, -size.y);\r\n localPoints[1] = Vector2f(size.x, -size.y);\r\n localPoints[2] = Vector2f(size.x, size.y);\r\n localPoints[3] = Vector2f(-size.x, size.y);\r\n\r\n for (int vertexNumber = 0; vertexNumber < 4; vertexNumber++)\r\n {\r\n sf::Vertex v;\r\n v.color = color;\r\n v.position = ConvertVector(coords.GetPointGlobalPos(localPoints[vertexNumber]));\r\n vertices.push_back(v);\r\n }\r\n}\r\n\r\nfloat random(float min, float max)\r\n{\r\n return min + (max - min) * (float(rand()) \/ float(RAND_MAX));\r\n}\r\n\r\nconst struct { PhysSystem::SolveMode mode; const char* name; } kModes[] =\r\n{\r\n { PhysSystem::Solve_Baseline, \"Baseline\" },\r\n { PhysSystem::Solve_AoS, \"AoS\" },\r\n { PhysSystem::Solve_SoA_Scalar, \"SoA Scalar\" },\r\n { PhysSystem::Solve_SoA_SSE2, \"SoA SSE2\" },\r\n\r\n #ifdef __AVX2__\r\n { PhysSystem::Solve_SoA_AVX2, \"SoA AVX2\" },\r\n #endif\r\n\r\n { PhysSystem::Solve_SoAPacked_Scalar, \"SoA Packed Scalar\" },\r\n { PhysSystem::Solve_SoAPacked_SSE2, \"SoA Packed SSE2\" },\r\n\r\n #ifdef __AVX2__\r\n { PhysSystem::Solve_SoAPacked_AVX2, \"SoA Packed AVX2\" },\r\n #endif\r\n};\r\n\r\nint main(int argc, char** argv)\r\n{\r\n int windowWidth = 1024, windowHeight = 768;\r\n\r\n PhysSystem physSystem;\r\n RigidBody *groundBody = physSystem.AddBody(Coords2f(Vector2f(windowWidth * 0.5f, windowHeight * 0.95f), 0.0f), Vector2f(windowWidth * 10.45f, 10.0f));\r\n groundBody->invInertia = 0.0f;\r\n groundBody->invMass = 0.0f;\r\n\r\n int currentMode = sizeof(kModes) \/ sizeof(kModes[0]) - 1;\r\n\r\n const float gravity = 200.0f;\r\n const float integrationTime = 2e-2f;\r\n\r\n float physicsTime = 0.0f;\r\n\r\n RigidBody *draggedBody = physSystem.AddBody(\r\n Coords2f(Vector2f(windowWidth * 0.1f, windowHeight * 0.7f), 0.0f), Vector2f(30.0f, 30.0f));\r\n\r\n for (int bodyIndex = 0; bodyIndex < 1000; bodyIndex++)\r\n {\r\n RigidBody *testBody = physSystem.AddBody(\r\n Coords2f(Vector2f(windowWidth * 0.5f, windowHeight * 0.6f) + Vector2f(random(-250.0f, 250.0f), random(-650.0f, 250.0f)), 0.0f), Vector2f(15.0f, 15.0f));\r\n \/\/testBody->invInertia = 0;\r\n testBody->velocity = Vector2f(10.0f, 0.0f);\r\n }\r\n\r\n if (argc > 1 && strcmp(argv[1], \"profile\") == 0)\r\n {\r\n for (int mode = 0; mode < sizeof(kModes) \/ sizeof(kModes[0]); ++mode)\r\n {\r\n PhysSystem testSystem;\r\n\r\n for (int i = 0; i < physSystem.GetBodiesCount(); ++i)\r\n {\r\n RigidBody* body = physSystem.GetBody(i);\r\n\r\n RigidBody* testBody = testSystem.AddBody(body->coords, body->geom.size);\r\n testBody->velocity = body->velocity;\r\n }\r\n\r\n double solveTime = 0;\r\n\r\n for (int i = 0; i < 10; ++i)\r\n {\r\n testSystem.Update(1.f \/ 60.f, kModes[mode].mode);\r\n\r\n solveTime += testSystem.solveTime;\r\n }\r\n\r\n printf(\"%s: %.2f ms\\n\", kModes[mode].name, solveTime * 1000.f);\r\n }\r\n\r\n return 0;\r\n }\r\n\r\n sf::Font font;\r\n font.loadFromFile(\"DroidSansMono.ttf\");\r\n\r\n sf::RenderWindow *window = new sf::RenderWindow(sf::VideoMode(windowWidth, windowHeight), \"This is awesome!\");\r\n\r\n sf::Clock clock;\r\n\r\n float prevUpdateTime = 0.0f;\r\n\r\n bool paused = 0;\r\n\r\n std::vector<sf::Vertex> vertices;\r\n\r\n while (window->isOpen())\r\n {\r\n sf::Event event;\r\n while (window->pollEvent(event))\r\n {\r\n if (event.type == sf::Event::Closed)\r\n window->close();\r\n else if (event.type == sf::Event::KeyPressed && event.key.code == sf::Keyboard::M)\r\n currentMode = (currentMode + 1) % (sizeof(kModes) \/ sizeof(kModes[0]));\r\n }\r\n Vector2f mousePos = Vector2f(sf::Mouse::getPosition(*window).x, sf::Mouse::getPosition(*window).y);\r\n if (sf::Keyboard::isKeyPressed(sf::Keyboard::LShift))\r\n {\r\n paused = 0;\r\n }\r\n window->clear(sf::Color(50, 50, 50, 255));\r\n vertices.clear();\r\n if (clock.getElapsedTime().asSeconds() > prevUpdateTime + integrationTime)\r\n {\r\n sf::Clock physicsClock;\r\n prevUpdateTime += integrationTime;\r\n if (!paused)\r\n {\r\n\r\n for (size_t bodyIndex = 0; bodyIndex < physSystem.GetBodiesCount(); bodyIndex++)\r\n {\r\n physSystem.GetBody(bodyIndex)->acceleration = Vector2f(0.0f, 0.0f);\r\n physSystem.GetBody(bodyIndex)->angularAcceleration = 0.0f;\r\n }\r\n for (size_t bodyIndex = 0; bodyIndex < physSystem.GetBodiesCount(); bodyIndex++)\r\n {\r\n RigidBody *body = physSystem.GetBody(bodyIndex);\r\n if (body->invMass > 0.0f)\r\n {\r\n physSystem.GetBody(bodyIndex)->acceleration += Vector2f(0.0f, gravity);\r\n }\r\n }\r\n RigidBody *draggedBody = physSystem.GetBody(1);\r\n Vector2f dstVelocity = (mousePos - draggedBody->coords.pos) * 5e1f;\r\n draggedBody->acceleration += (dstVelocity - draggedBody->velocity) * 5e0;\r\n\r\n physSystem.Update(integrationTime, kModes[currentMode].mode);\r\n physicsTime = physicsClock.getElapsedTime().asSeconds();\r\n }\r\n }\r\n\r\n\r\n for (size_t bodyIndex = 0; bodyIndex < physSystem.GetBodiesCount(); bodyIndex++)\r\n {\r\n RigidBody *body = physSystem.GetBody(bodyIndex);\r\n Coords2f bodyCoords = body->coords;\r\n Vector2f size = body->geom.size;\r\n\r\n float colorMult = float(bodyIndex) \/ float(physSystem.GetBodiesCount()) * 0.5f + 0.5f;\r\n sf::Color color = sf::Color(char(50 * colorMult), char(125 * colorMult), char(218 * colorMult));\r\n\r\n if (bodyIndex == 1) \/\/dragged body\r\n {\r\n color = sf::Color(242, 236, 164, 255);\r\n }\r\n\r\n RenderBox(vertices, bodyCoords, size, color);\r\n }\r\n\r\n\r\n bool pickingCollision = 0;\r\n \/*if (sf::Mouse::isButtonPressed(sf::Mouse::Left))\r\n {\r\n pickingCollision = true;\r\n }*\/\r\n if (sf::Keyboard::isKeyPressed(sf::Keyboard::C))\r\n for (size_t manifoldIndex = 0; manifoldIndex < physSystem.GetCollider()->manifolds.size(); ++manifoldIndex)\r\n {\r\n Manifold& man = physSystem.GetCollider()->manifolds[manifoldIndex];\r\n\r\n for (int collisionNumber = 0; collisionNumber < man.collisionsCount; collisionNumber++)\r\n {\r\n Coords2f coords = Coords2f(Vector2f(0.0f, 0.0f), 3.1415f \/ 4.0f);\r\n\r\n coords.pos = man.body1->coords.pos + man.collisions[collisionNumber].delta1;\r\n\r\n float redMult = 1.0f;\r\n if (man.collisions[collisionNumber].isNewlyCreated)\r\n redMult = 0.5f;\r\n\r\n sf::Color color1(100, char(100 * redMult), char(100 * redMult), 100);\r\n RenderBox(vertices, coords, Vector2f(3.0f, 3.0f), color1);\r\n\r\n coords.pos = man.body2->coords.pos + man.collisions[collisionNumber].delta2;\r\n sf::Color color2(150, char(150 * redMult), char(150 * redMult), 100);\r\n \/\/if (pickingCollision && (coords.pos - mousePos).SquareLen() < 5.0f * 5.0f)\r\n \/\/{\r\n \/\/ color2 = sf::Color(255, 0, 0, 255);\r\n \/\/}\r\n RenderBox(vertices, coords, Vector2f(3.0f, 3.0f), color2);\r\n }\r\n }\r\n\r\n if (vertices.size() > 0)\r\n window->draw(&vertices[0], vertices.size(), sf::Quads);\r\n\r\n std::stringstream debugTextStream;\r\n debugTextStream << \"Bodies count: \" << physSystem.GetBodiesCount() << \" contacts count: \" << physSystem.GetJointsCount();\r\n sf::Text text(debugTextStream.str().c_str(), font, 20);\r\n text.setPosition(sf::Vector2f(10.0f, 30.0f));\r\n window->draw(text);\r\n\r\n std::stringstream debugTextStream2;\r\n debugTextStream2 << std::fixed;\r\n debugTextStream2.precision(2);\r\n debugTextStream2 << \r\n \"Mode: \" << kModes[currentMode].name << \"; \" <<\r\n \"Physics time: \" << std::setw(5) << physicsTime * 1000.0f << \r\n \"ms (c: \" << std::setw(5) << physSystem.collisionTime * 1000.0f << \r\n \"ms, m: \" << std::setw(5) << physSystem.mergeTime * 1000.0f << \r\n \"ms, s: \" << std::setw(5) << physSystem.solveTime * 1000.0f << \"ms)\";\r\n sf::Text text2(debugTextStream2.str().c_str(), font, 20);\r\n text2.setPosition(sf::Vector2f(10.0f, 50.0f));\r\n window->draw(text2);\r\n\r\n\r\n window->display();\r\n }\r\n}<commit_msg>Add string.h include<commit_after>#include <SFML\/Graphics.hpp>\r\n#include \"PhysSystem.h\"\r\n#include <sstream>\r\n#include <iomanip>\r\n#include <string.h>\r\n\r\nsf::Vector2f ConvertVector(Vector2f vec)\r\n{\r\n return sf::Vector2f(vec.x, vec.y);\r\n}\r\n\r\nvoid RenderBox(std::vector<sf::Vertex>& vertices, Coords2f coords, Vector2f size, sf::Color color)\r\n{\r\n Vector2f localPoints[4];\r\n localPoints[0] = Vector2f(-size.x, -size.y);\r\n localPoints[1] = Vector2f(size.x, -size.y);\r\n localPoints[2] = Vector2f(size.x, size.y);\r\n localPoints[3] = Vector2f(-size.x, size.y);\r\n\r\n for (int vertexNumber = 0; vertexNumber < 4; vertexNumber++)\r\n {\r\n sf::Vertex v;\r\n v.color = color;\r\n v.position = ConvertVector(coords.GetPointGlobalPos(localPoints[vertexNumber]));\r\n vertices.push_back(v);\r\n }\r\n}\r\n\r\nfloat random(float min, float max)\r\n{\r\n return min + (max - min) * (float(rand()) \/ float(RAND_MAX));\r\n}\r\n\r\nconst struct { PhysSystem::SolveMode mode; const char* name; } kModes[] =\r\n{\r\n { PhysSystem::Solve_Baseline, \"Baseline\" },\r\n { PhysSystem::Solve_AoS, \"AoS\" },\r\n { PhysSystem::Solve_SoA_Scalar, \"SoA Scalar\" },\r\n { PhysSystem::Solve_SoA_SSE2, \"SoA SSE2\" },\r\n\r\n #ifdef __AVX2__\r\n { PhysSystem::Solve_SoA_AVX2, \"SoA AVX2\" },\r\n #endif\r\n\r\n { PhysSystem::Solve_SoAPacked_Scalar, \"SoA Packed Scalar\" },\r\n { PhysSystem::Solve_SoAPacked_SSE2, \"SoA Packed SSE2\" },\r\n\r\n #ifdef __AVX2__\r\n { PhysSystem::Solve_SoAPacked_AVX2, \"SoA Packed AVX2\" },\r\n #endif\r\n};\r\n\r\nint main(int argc, char** argv)\r\n{\r\n int windowWidth = 1024, windowHeight = 768;\r\n\r\n PhysSystem physSystem;\r\n RigidBody *groundBody = physSystem.AddBody(Coords2f(Vector2f(windowWidth * 0.5f, windowHeight * 0.95f), 0.0f), Vector2f(windowWidth * 10.45f, 10.0f));\r\n groundBody->invInertia = 0.0f;\r\n groundBody->invMass = 0.0f;\r\n\r\n int currentMode = sizeof(kModes) \/ sizeof(kModes[0]) - 1;\r\n\r\n const float gravity = 200.0f;\r\n const float integrationTime = 2e-2f;\r\n\r\n float physicsTime = 0.0f;\r\n\r\n RigidBody *draggedBody = physSystem.AddBody(\r\n Coords2f(Vector2f(windowWidth * 0.1f, windowHeight * 0.7f), 0.0f), Vector2f(30.0f, 30.0f));\r\n\r\n for (int bodyIndex = 0; bodyIndex < 1000; bodyIndex++)\r\n {\r\n RigidBody *testBody = physSystem.AddBody(\r\n Coords2f(Vector2f(windowWidth * 0.5f, windowHeight * 0.6f) + Vector2f(random(-250.0f, 250.0f), random(-650.0f, 250.0f)), 0.0f), Vector2f(15.0f, 15.0f));\r\n \/\/testBody->invInertia = 0;\r\n testBody->velocity = Vector2f(10.0f, 0.0f);\r\n }\r\n\r\n if (argc > 1 && strcmp(argv[1], \"profile\") == 0)\r\n {\r\n for (int mode = 0; mode < sizeof(kModes) \/ sizeof(kModes[0]); ++mode)\r\n {\r\n PhysSystem testSystem;\r\n\r\n for (int i = 0; i < physSystem.GetBodiesCount(); ++i)\r\n {\r\n RigidBody* body = physSystem.GetBody(i);\r\n\r\n RigidBody* testBody = testSystem.AddBody(body->coords, body->geom.size);\r\n testBody->velocity = body->velocity;\r\n }\r\n\r\n double solveTime = 0;\r\n\r\n for (int i = 0; i < 10; ++i)\r\n {\r\n testSystem.Update(1.f \/ 60.f, kModes[mode].mode);\r\n\r\n solveTime += testSystem.solveTime;\r\n }\r\n\r\n printf(\"%s: %.2f ms\\n\", kModes[mode].name, solveTime * 1000.f);\r\n }\r\n\r\n return 0;\r\n }\r\n\r\n sf::Font font;\r\n font.loadFromFile(\"DroidSansMono.ttf\");\r\n\r\n sf::RenderWindow *window = new sf::RenderWindow(sf::VideoMode(windowWidth, windowHeight), \"This is awesome!\");\r\n\r\n sf::Clock clock;\r\n\r\n float prevUpdateTime = 0.0f;\r\n\r\n bool paused = 0;\r\n\r\n std::vector<sf::Vertex> vertices;\r\n\r\n while (window->isOpen())\r\n {\r\n sf::Event event;\r\n while (window->pollEvent(event))\r\n {\r\n if (event.type == sf::Event::Closed)\r\n window->close();\r\n else if (event.type == sf::Event::KeyPressed && event.key.code == sf::Keyboard::M)\r\n currentMode = (currentMode + 1) % (sizeof(kModes) \/ sizeof(kModes[0]));\r\n }\r\n Vector2f mousePos = Vector2f(sf::Mouse::getPosition(*window).x, sf::Mouse::getPosition(*window).y);\r\n if (sf::Keyboard::isKeyPressed(sf::Keyboard::LShift))\r\n {\r\n paused = 0;\r\n }\r\n window->clear(sf::Color(50, 50, 50, 255));\r\n vertices.clear();\r\n if (clock.getElapsedTime().asSeconds() > prevUpdateTime + integrationTime)\r\n {\r\n sf::Clock physicsClock;\r\n prevUpdateTime += integrationTime;\r\n if (!paused)\r\n {\r\n\r\n for (size_t bodyIndex = 0; bodyIndex < physSystem.GetBodiesCount(); bodyIndex++)\r\n {\r\n physSystem.GetBody(bodyIndex)->acceleration = Vector2f(0.0f, 0.0f);\r\n physSystem.GetBody(bodyIndex)->angularAcceleration = 0.0f;\r\n }\r\n for (size_t bodyIndex = 0; bodyIndex < physSystem.GetBodiesCount(); bodyIndex++)\r\n {\r\n RigidBody *body = physSystem.GetBody(bodyIndex);\r\n if (body->invMass > 0.0f)\r\n {\r\n physSystem.GetBody(bodyIndex)->acceleration += Vector2f(0.0f, gravity);\r\n }\r\n }\r\n RigidBody *draggedBody = physSystem.GetBody(1);\r\n Vector2f dstVelocity = (mousePos - draggedBody->coords.pos) * 5e1f;\r\n draggedBody->acceleration += (dstVelocity - draggedBody->velocity) * 5e0;\r\n\r\n physSystem.Update(integrationTime, kModes[currentMode].mode);\r\n physicsTime = physicsClock.getElapsedTime().asSeconds();\r\n }\r\n }\r\n\r\n\r\n for (size_t bodyIndex = 0; bodyIndex < physSystem.GetBodiesCount(); bodyIndex++)\r\n {\r\n RigidBody *body = physSystem.GetBody(bodyIndex);\r\n Coords2f bodyCoords = body->coords;\r\n Vector2f size = body->geom.size;\r\n\r\n float colorMult = float(bodyIndex) \/ float(physSystem.GetBodiesCount()) * 0.5f + 0.5f;\r\n sf::Color color = sf::Color(char(50 * colorMult), char(125 * colorMult), char(218 * colorMult));\r\n\r\n if (bodyIndex == 1) \/\/dragged body\r\n {\r\n color = sf::Color(242, 236, 164, 255);\r\n }\r\n\r\n RenderBox(vertices, bodyCoords, size, color);\r\n }\r\n\r\n\r\n bool pickingCollision = 0;\r\n \/*if (sf::Mouse::isButtonPressed(sf::Mouse::Left))\r\n {\r\n pickingCollision = true;\r\n }*\/\r\n if (sf::Keyboard::isKeyPressed(sf::Keyboard::C))\r\n for (size_t manifoldIndex = 0; manifoldIndex < physSystem.GetCollider()->manifolds.size(); ++manifoldIndex)\r\n {\r\n Manifold& man = physSystem.GetCollider()->manifolds[manifoldIndex];\r\n\r\n for (int collisionNumber = 0; collisionNumber < man.collisionsCount; collisionNumber++)\r\n {\r\n Coords2f coords = Coords2f(Vector2f(0.0f, 0.0f), 3.1415f \/ 4.0f);\r\n\r\n coords.pos = man.body1->coords.pos + man.collisions[collisionNumber].delta1;\r\n\r\n float redMult = 1.0f;\r\n if (man.collisions[collisionNumber].isNewlyCreated)\r\n redMult = 0.5f;\r\n\r\n sf::Color color1(100, char(100 * redMult), char(100 * redMult), 100);\r\n RenderBox(vertices, coords, Vector2f(3.0f, 3.0f), color1);\r\n\r\n coords.pos = man.body2->coords.pos + man.collisions[collisionNumber].delta2;\r\n sf::Color color2(150, char(150 * redMult), char(150 * redMult), 100);\r\n \/\/if (pickingCollision && (coords.pos - mousePos).SquareLen() < 5.0f * 5.0f)\r\n \/\/{\r\n \/\/ color2 = sf::Color(255, 0, 0, 255);\r\n \/\/}\r\n RenderBox(vertices, coords, Vector2f(3.0f, 3.0f), color2);\r\n }\r\n }\r\n\r\n if (vertices.size() > 0)\r\n window->draw(&vertices[0], vertices.size(), sf::Quads);\r\n\r\n std::stringstream debugTextStream;\r\n debugTextStream << \"Bodies count: \" << physSystem.GetBodiesCount() << \" contacts count: \" << physSystem.GetJointsCount();\r\n sf::Text text(debugTextStream.str().c_str(), font, 20);\r\n text.setPosition(sf::Vector2f(10.0f, 30.0f));\r\n window->draw(text);\r\n\r\n std::stringstream debugTextStream2;\r\n debugTextStream2 << std::fixed;\r\n debugTextStream2.precision(2);\r\n debugTextStream2 << \r\n \"Mode: \" << kModes[currentMode].name << \"; \" <<\r\n \"Physics time: \" << std::setw(5) << physicsTime * 1000.0f << \r\n \"ms (c: \" << std::setw(5) << physSystem.collisionTime * 1000.0f << \r\n \"ms, m: \" << std::setw(5) << physSystem.mergeTime * 1000.0f << \r\n \"ms, s: \" << std::setw(5) << physSystem.solveTime * 1000.0f << \"ms)\";\r\n sf::Text text2(debugTextStream2.str().c_str(), font, 20);\r\n text2.setPosition(sf::Vector2f(10.0f, 50.0f));\r\n window->draw(text2);\r\n\r\n\r\n window->display();\r\n }\r\n}<|endoftext|>"} {"text":"<commit_before>#include \"consts.h\"\n#include \"utils.h\"\n#include \"circuits\/circuit.h\"\n#include \"circuits\/element.h\"\n#include \"matrix\/matrix.h\"\n#include \"matrix\/newtonraphson.h\"\n#include <iostream>\n#include <fstream>\n#include <sstream>\n#include <iomanip>\n#include <string>\n#include <vector>\n#include <cstdlib>\n#include <math.h>\n\n\nusing namespace std;\n\n\n\/* The program starts here *\/\nint main(int argc, char **argv){\n printIntro();\n\n int rc=0;\n ifstream netlistFile;\n Circuit circuit;\n\n\n \/\/ Reads netlist file\n string netlistFileName;\n rc = openNetlistFile(argc, argv, netlistFileName, netlistFile);\n if (rc == EXIT_FAILURE)\n exitPolitely(EXIT_FAILURE);\n \/\/ Prepares solutions file\n string outputFileName;\n outputFileName = netlistFileName.substr(0, netlistFileName.find(\".\")).append(\"_mnapoly.tab\");\n ofstream solutionsFile(outputFileName.c_str(), ofstream::out);\n\n\n \/\/ Parses netlist file (constructs Circuit)\n cout << \"Reading netlist:\" << endl;\n circuit = Circuit(netlistFile);\n netlistFile.close();\n\n \/\/ Write solutions file header\n circuit.writeSolutionsHeader(solutionsFile);\n\n #ifdef DEBUG\n cout << \"Internal variables:\" << endl;\n circuit.printVariables();\n\n cout << \"Summary:\" << endl;\n circuit.printSummary();\n #endif\n\n\n \/\/ Bias Analysis\n double t=0;\n double solution[MAX_NODES+1];\n copySolution(circuit.getNumVariables(), ZERO_SOLUTION, solution);\n runNewtonRaphson(circuit, solution, t);\n circuit.appendSolutionToFile(solutionsFile, solution);\n\n \/\/ Transient Analysis\n double step = circuit.getStep();\n int numInternalSteps = circuit.getNumInternalSteps();\n double realStep = step\/(double)numInternalSteps;\n double finalTime = circuit.getFinalTime();\n double lastSolution[MAX_NODES+1];\n do {\n t += step;\n copySolution(circuit.getNumVariables(),\n solution,\n lastSolution);\n t += realStep;\n runNewtonRaphson(circuit, solution, t, lastSolution);\n if (fmod(t, realStep) < TOLG)\n circuit.appendSolutionToFile(solutionsFile, solution, t);\n } while (t<finalTime);\n\n \/\/Closing The File\n cout << endl << \"Created: \" << outputFileName << endl;\n solutionsFile.close();\n\n\n exitPolitely(EXIT_SUCCESS);\n}\n<commit_msg>Fixes bad commit cherrypicking for internal step<commit_after>#include \"consts.h\"\n#include \"utils.h\"\n#include \"circuits\/circuit.h\"\n#include \"circuits\/element.h\"\n#include \"matrix\/matrix.h\"\n#include \"matrix\/newtonraphson.h\"\n#include <iostream>\n#include <fstream>\n#include <sstream>\n#include <iomanip>\n#include <string>\n#include <vector>\n#include <cstdlib>\n#include <math.h>\n\n\nusing namespace std;\n\n\n\/* The program starts here *\/\nint main(int argc, char **argv){\n printIntro();\n\n int rc=0;\n ifstream netlistFile;\n Circuit circuit;\n\n\n \/\/ Reads netlist file\n string netlistFileName;\n rc = openNetlistFile(argc, argv, netlistFileName, netlistFile);\n if (rc == EXIT_FAILURE)\n exitPolitely(EXIT_FAILURE);\n \/\/ Prepares solutions file\n string outputFileName;\n outputFileName = netlistFileName.substr(0, netlistFileName.find(\".\")).append(\"_mnapoly.tab\");\n ofstream solutionsFile(outputFileName.c_str(), ofstream::out);\n\n\n \/\/ Parses netlist file (constructs Circuit)\n cout << \"Reading netlist:\" << endl;\n circuit = Circuit(netlistFile);\n netlistFile.close();\n\n \/\/ Write solutions file header\n circuit.writeSolutionsHeader(solutionsFile);\n\n #ifdef DEBUG\n cout << \"Internal variables:\" << endl;\n circuit.printVariables();\n\n cout << \"Summary:\" << endl;\n circuit.printSummary();\n #endif\n\n\n \/\/ Bias Analysis\n double t=0;\n double solution[MAX_NODES+1];\n copySolution(circuit.getNumVariables(), ZERO_SOLUTION, solution);\n runNewtonRaphson(circuit, solution, t);\n circuit.appendSolutionToFile(solutionsFile, solution);\n\n \/\/ Transient Analysis\n double step = circuit.getStep();\n int numInternalSteps = circuit.getNumInternalSteps();\n double realStep = step\/(double)numInternalSteps;\n double finalTime = circuit.getFinalTime();\n double lastSolution[MAX_NODES+1];\n do {\n t += realStep;\n copySolution(circuit.getNumVariables(),\n solution,\n lastSolution);\n runNewtonRaphson(circuit, solution, t, lastSolution);\n if (fmod(t, realStep) < TOLG)\n circuit.appendSolutionToFile(solutionsFile, solution, t);\n } while (t<finalTime);\n\n \/\/Closing The File\n cout << endl << \"Created: \" << outputFileName << endl;\n solutionsFile.close();\n\n\n exitPolitely(EXIT_SUCCESS);\n}\n<|endoftext|>"} {"text":"<commit_before>#include \"..\/include\/PSATsolver.hpp\"\n\nusing namespace std;\nusing namespace arma;\n\nint main(int argc, char** argv)\n{\n bool v = false;\n \n if (argc < 2)\n {\n std::cout << \"I need a input file \" << \"\\n\";\n return -1;\n }\n \n \/\/if (argc == 3 && argv[2][1] == 'v' && argv[2][0] == '-')\n \/\/ v = true;\n \n int** m;\n int**& M = m;\n vector<double> pi;\n double time;\n int n;\n \n for(int i = 0; i < argc; i++)\n {\n n = PSATsolver::solve(M, pi, &time, argv[i], v);\n cout << time << \"\\n\";\n }\n \n \n return 1;\n}\n<commit_msg>just a test<commit_after>#include \"..\/include\/PSATsolver.hpp\"\n\nusing namespace std;\nusing namespace arma;\n\nint main(int argc, char** argv)\n{\n bool v = false;\n \n if (argc < 2)\n {\n std::cout << \"I need a input file \" << \"\\n\";\n return -1;\n }\n \n \/\/if (argc == 3 && argv[2][1] == 'v' && argv[2][0] == '-')\n \/\/ v = true;\n \n int** m;\n int**& M = m;\n vector<double> pi;\n double time;\n int n;\n \n for(int i = 1; i < argc; i++)\n {\n n = PSATsolver::solve(M, pi, &time, argv[i], v);\n cout << time << \"\\n\";\n }\n \n \n return 1;\n}\n<|endoftext|>"} {"text":"<commit_before>#include <cassert>\n#include <cstdlib>\n#include <iostream>\n#include <ios>\n\n#include \"hext\/parser.h\"\n#include \"hext\/matcher.h\"\n#include \"hext\/program-options.h\"\n\n\nint main(int argc, const char ** argv)\n{\n std::ios_base::sync_with_stdio(false);\n\n hext::program_options po(argc, argv);\n\n if( !po.validate_or_print_error(std::cerr) )\n return EXIT_FAILURE;\n\n if( argc < 2 || po.contains(\"help\") )\n {\n po.print(argv[0], std::cout);\n return EXIT_SUCCESS;\n }\n\n try\n {\n auto rules = hext::parser::parse_file(po.get(\"hext-file\"));\n\n if( po.contains(\"print\") )\n {\n for(const auto& r : rules)\n r.print();\n return EXIT_SUCCESS;\n }\n\n if( po.contains(\"lint\") )\n return EXIT_SUCCESS;\n\n hext::matcher m(po.get(\"html-file\"));\n\n for(const auto& r : rules)\n {\n std::fstream g(\n \"auto.graph.dot\",\n std::fstream::out|std::fstream::trunc\n );\n std::fstream gf(\n \"auto.graph.filtered.dot\",\n std::fstream::out|std::fstream::trunc\n );\n\n std::unique_ptr<hext::match_tree> mt = m.match(r);\n assert(mt != nullptr);\n\n if( po.contains(\"mt-graph\") )\n {\n mt->print_dot(g); \/\/ debug\n mt->filter();\n mt->print_dot(gf); \/\/ debug\n mt->print_dot();\n }\n else if( po.contains(\"unfiltered-mt-graph\") )\n {\n mt->print_dot();\n }\n else\n {\n mt->filter();\n mt->print_json();\n }\n }\n }\n catch( std::ios_base::failure& e )\n {\n std::cerr << e.what() << '\\n';\n return EXIT_FAILURE;\n }\n\n return EXIT_SUCCESS;\n}\n\n<commit_msg>only open graph files if we want to write data<commit_after>#include <cassert>\n#include <cstdlib>\n#include <iostream>\n#include <ios>\n\n#include \"hext\/parser.h\"\n#include \"hext\/matcher.h\"\n#include \"hext\/program-options.h\"\n\n\nint main(int argc, const char ** argv)\n{\n std::ios_base::sync_with_stdio(false);\n\n hext::program_options po(argc, argv);\n\n if( !po.validate_or_print_error(std::cerr) )\n return EXIT_FAILURE;\n\n if( argc < 2 || po.contains(\"help\") )\n {\n po.print(argv[0], std::cout);\n return EXIT_SUCCESS;\n }\n\n try\n {\n auto rules = hext::parser::parse_file(po.get(\"hext-file\"));\n\n if( po.contains(\"print\") )\n {\n for(const auto& r : rules)\n r.print();\n return EXIT_SUCCESS;\n }\n\n if( po.contains(\"lint\") )\n return EXIT_SUCCESS;\n\n hext::matcher m(po.get(\"html-file\"));\n\n for(const auto& r : rules)\n {\n std::unique_ptr<hext::match_tree> mt = m.match(r);\n assert(mt != nullptr);\n\n if( po.contains(\"mt-graph\") )\n {\n std::fstream g(\n \"auto.graph.dot\",\n std::fstream::out|std::fstream::trunc\n );\n std::fstream gf(\n \"auto.graph.filtered.dot\",\n std::fstream::out|std::fstream::trunc\n );\n\n mt->print_dot(g); \/\/ debug\n mt->filter();\n mt->print_dot(gf); \/\/ debug\n mt->print_dot();\n }\n else if( po.contains(\"unfiltered-mt-graph\") )\n {\n mt->print_dot();\n }\n else\n {\n mt->filter();\n mt->print_json();\n }\n }\n }\n catch( std::ios_base::failure& e )\n {\n std::cerr << e.what() << '\\n';\n return EXIT_FAILURE;\n }\n\n return EXIT_SUCCESS;\n}\n\n<|endoftext|>"} {"text":"<commit_before>\/*\n This file is part of the PhantomJS project from Ofi Labs.\n\n Copyright (C) 2011 Ariya Hidayat <ariya.hidayat@gmail.com>\n\n Redistribution and use in source and binary forms, with or without\n modification, are permitted provided that the following conditions are met:\n\n * Redistributions of source code must retain the above copyright\n notice, this list of conditions and the following disclaimer.\n * Redistributions in binary form must reproduce the above copyright\n notice, this list of conditions and the following disclaimer in the\n documentation and\/or other materials provided with the distribution.\n * Neither the name of the <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 \"consts.h\"\n#include \"utils.h\"\n#include \"phantom.h\"\n#include \"crashdump.h\"\n\n#include <QApplication>\n#include <QSslSocket>\n#include <QWebSettings>\n\n#include <stdio.h>\n\nstatic int inner_main(int argc, char** argv)\n{\n QApplication app(argc, argv);\n\n app.setWindowIcon(QIcon(\":\/phantomjs-icon.png\"));\n app.setApplicationName(\"PhantomJS\");\n app.setOrganizationName(\"Ofi Labs\");\n app.setOrganizationDomain(\"www.ofilabs.com\");\n app.setApplicationVersion(PHANTOMJS_VERSION_STRING);\n\n \/\/ Registering an alternative Message Handler\n qInstallMessageHandler(Utils::messageHandler);\n\n#if defined(Q_OS_LINUX)\n if (QSslSocket::supportsSsl()) {\n \/\/ Don't perform on-demand loading of root certificates on Linux\n QSslSocket::addDefaultCaCertificates(QSslSocket::systemCaCertificates());\n }\n#endif\n\n \/\/ Get the Phantom singleton\n Phantom* phantom = Phantom::instance();\n\n \/\/ Start script execution\n if (phantom->execute()) {\n app.exec();\n }\n\n \/\/ End script execution: delete the phantom singleton and set\n \/\/ execution return value\n int retVal = phantom->returnValue();\n delete phantom;\n\n#ifndef QT_NO_DEBUG\n \/\/ Clear all cached data before exiting, so it is not detected as\n \/\/ leaked.\n QWebSettings::clearMemoryCaches();\n#endif\n\n return retVal;\n}\n\nint main(int argc, char** argv)\n{\n try {\n init_crash_handler();\n return inner_main(argc, argv);\n\n \/\/ These last-ditch exception handlers write to the C stderr\n \/\/ because who knows what kind of state Qt is in. And they avoid\n \/\/ using fprintf because _that_ might be in bad shape too.\n \/\/ (I would drop all the way down to write() but then I'd have to\n \/\/ write the code again for Windows.)\n \/\/\n \/\/ print_crash_message includes a call to fflush(stderr).\n } catch (std::bad_alloc) {\n fputs(\"Memory exhausted.\\n\", stderr);\n fflush(stderr);\n return 1;\n\n } catch (std::exception& e) {\n fputs(\"Uncaught C++ exception: \", stderr);\n fputs(e.what(), stderr);\n putc('\\n', stderr);\n print_crash_message();\n return 1;\n\n } catch (...) {\n fputs(\"Uncaught nonstandard exception.\\n\", stderr);\n print_crash_message();\n return 1;\n }\n}\n<commit_msg>[Linux] Override the default QPA platform plugin<commit_after>\/*\n This file is part of the PhantomJS project from Ofi Labs.\n\n Copyright (C) 2011 Ariya Hidayat <ariya.hidayat@gmail.com>\n\n Redistribution and use in source and binary forms, with or without\n modification, are permitted provided that the following conditions are met:\n\n * Redistributions of source code must retain the above copyright\n notice, this list of conditions and the following disclaimer.\n * Redistributions in binary form must reproduce the above copyright\n notice, this list of conditions and the following disclaimer in the\n documentation and\/or other materials provided with the distribution.\n * Neither the name of the <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 \"consts.h\"\n#include \"utils.h\"\n#include \"phantom.h\"\n#include \"crashdump.h\"\n\n#include <QApplication>\n#include <QSslSocket>\n#include <QWebSettings>\n\n#include <stdio.h>\n\nstatic int inner_main(int argc, char** argv)\n{\n#ifdef Q_OS_LINUX\n \/\/ override default Qt platform plugin\n qputenv(\"QT_QPA_PLATFORM\", \"offscreen\");\n#endif\n\n QApplication app(argc, argv);\n\n app.setWindowIcon(QIcon(\":\/phantomjs-icon.png\"));\n app.setApplicationName(\"PhantomJS\");\n app.setOrganizationName(\"Ofi Labs\");\n app.setOrganizationDomain(\"www.ofilabs.com\");\n app.setApplicationVersion(PHANTOMJS_VERSION_STRING);\n\n \/\/ Registering an alternative Message Handler\n qInstallMessageHandler(Utils::messageHandler);\n\n#if defined(Q_OS_LINUX)\n if (QSslSocket::supportsSsl()) {\n \/\/ Don't perform on-demand loading of root certificates on Linux\n QSslSocket::addDefaultCaCertificates(QSslSocket::systemCaCertificates());\n }\n#endif\n\n \/\/ Get the Phantom singleton\n Phantom* phantom = Phantom::instance();\n\n \/\/ Start script execution\n if (phantom->execute()) {\n app.exec();\n }\n\n \/\/ End script execution: delete the phantom singleton and set\n \/\/ execution return value\n int retVal = phantom->returnValue();\n delete phantom;\n\n#ifndef QT_NO_DEBUG\n \/\/ Clear all cached data before exiting, so it is not detected as\n \/\/ leaked.\n QWebSettings::clearMemoryCaches();\n#endif\n\n return retVal;\n}\n\nint main(int argc, char** argv)\n{\n try {\n init_crash_handler();\n return inner_main(argc, argv);\n\n \/\/ These last-ditch exception handlers write to the C stderr\n \/\/ because who knows what kind of state Qt is in. And they avoid\n \/\/ using fprintf because _that_ might be in bad shape too.\n \/\/ (I would drop all the way down to write() but then I'd have to\n \/\/ write the code again for Windows.)\n \/\/\n \/\/ print_crash_message includes a call to fflush(stderr).\n } catch (std::bad_alloc) {\n fputs(\"Memory exhausted.\\n\", stderr);\n fflush(stderr);\n return 1;\n\n } catch (std::exception& e) {\n fputs(\"Uncaught C++ exception: \", stderr);\n fputs(e.what(), stderr);\n putc('\\n', stderr);\n print_crash_message();\n return 1;\n\n } catch (...) {\n fputs(\"Uncaught nonstandard exception.\\n\", stderr);\n print_crash_message();\n return 1;\n }\n}\n<|endoftext|>"} {"text":"<commit_before>\/\/ Jubatus: Online machine learning framework for distributed environment\n\/\/ Copyright (C) 2013 Preferred Networks and Nippon Telegraph and Telephone Corporation.\n\/\/\n\/\/ This library is free software; you can redistribute it and\/or\n\/\/ modify it under the terms of the GNU Lesser General Public\n\/\/ License version 2.1 as published by the Free Software Foundation.\n\/\/\n\/\/ This library is distributed in the hope that it will be useful,\n\/\/ but WITHOUT ANY WARRANTY; without even the implied warranty of\n\/\/ MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU\n\/\/ Lesser General Public License for more details.\n\/\/\n\/\/ You should have received a copy of the GNU Lesser General Public\n\/\/ License along with this library; if not, write to the Free Software\n\/\/ Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA\n\n#include <iostream>\n#include <string>\n#include <exception>\n#include <vector>\n\n#include <msgpack.hpp>\n#include <jubatus\/core\/common\/big_endian.hpp>\n#include <jubatus\/core\/common\/jsonconfig\/config.hpp>\n#include <jubatus\/core\/common\/jsonconfig\/cast.hpp>\n#include <jubatus\/util\/data\/serialization\/unordered_map.h>\n#include <jubatus\/util\/text\/json.h>\n#include <jubatus\/util\/lang\/cast.h>\n\n#include \"third_party\/cmdline\/cmdline.h\"\n\n#include \"jubatus\/dump\/classifier.hpp\"\n#include \"jubatus\/dump\/recommender.hpp\"\n#include \"jubatus\/dump\/anomaly.hpp\"\n\nusing std::runtime_error;\nusing jubatus::core::common::read_big_endian;\nusing jubatus::util::lang::lexical_cast;\nusing jubatus::util::text::json::from_json;\n\nnamespace jubatus {\nnamespace dump {\n\nstruct model {\n std::string type_;\n jubatus::core::common::jsonconfig::config config_;\n std::vector<char> user_data_;\n};\n\nvoid read(std::ifstream& ifs, model& m) {\n \/\/ TODO(unno): This implementation ignores checksums, version, and all other\n \/\/ check codes. We need to re-implemenet such process like\n \/\/ jubatus::server::framework::save_server\/load_server, or to use these\n \/\/ methods to show file format errors.\n\n ifs.exceptions(std::ifstream::failbit);\n\n std::vector<char> system_data_buf;\n try {\n char header_buf[48];\n ifs.read(header_buf, 48);\n\n uint64_t system_data_size = read_big_endian<uint64_t>(&header_buf[32]);\n system_data_buf.resize(system_data_size);\n ifs.read(&system_data_buf[0], system_data_size);\n\n uint64_t user_data_size = read_big_endian<uint64_t>(&header_buf[40]);\n m.user_data_.resize(user_data_size);\n ifs.read(&m.user_data_[0], user_data_size);\n } catch (std::ios_base::failure& e) {\n throw runtime_error(\"Input stream reached end of file.\");\n }\n\n if (ifs.peek() != -1) {\n std::ifstream::pos_type pos = ifs.tellg();\n throw runtime_error(\"Input stream remains. Position: \" +\n lexical_cast<std::string>(pos));\n }\n ifs.close();\n\n msgpack::unpacked msg;\n msgpack::unpack(&msg, system_data_buf.data(), system_data_buf.size());\n msgpack::object system_data = msg.get();\n std::string config;\n system_data.via.array.ptr[2].convert(&m.type_);\n system_data.via.array.ptr[4].convert(&config);\n m.config_ = jubatus::core::common::jsonconfig::config(\n jubatus::util::lang::lexical_cast<\n jubatus::util::text::json::json>(config));\n}\n\ntemplate <typename T, typename D>\nvoid dump(model& m, jubatus::util::text::json::json& js) {\n msgpack::unpacked msg_user;\n msgpack::unpack(&msg_user, m.user_data_.data(), m.user_data_.size());\n\n \/\/ obj[0] is the version of the saved model file\n T data;\n msg_user.get().via.array.ptr[1].convert(&data);\n\n D dump(data);\n js = jubatus::util::text::json::to_json(dump);\n}\n\nint run(const std::string& path) try {\n std::ifstream ifs(path.c_str());\n if (!ifs) {\n throw runtime_error(\"Cannot open: \" + path);\n }\n\n model m;\n jubatus::util::text::json::json js;\n\n try {\n read(ifs, m);\n } catch (const std::exception& e) {\n throw runtime_error(std::string(\"invalid model file structure: \") +\n e.what());\n }\n\n if (m.type_ == \"classifier\") {\n dump<classifier<local_storage>,\n classifier_dump<local_storage, local_storage_dump> >(m, js);\n } else if (m.type_ == \"recommender\") {\n std::string method;\n from_json<std::string>(m.config_[\"method\"].get(), method);\n if (method == \"inverted_index\") {\n dump<recommender<inverted_index>,\n recommender_dump<inverted_index_recommender_dump> >(m, js);\n } else {\n throw runtime_error(\"recommender method \\\"\" + method +\n \"\\\" is not supported for dump\");\n }\n } else if (m.type_ == \"anomaly\") {\n std::string method, backend_method;\n from_json<std::string>(m.config_[\"method\"].get(), method);\n from_json<std::string>(m.config_[\"parameter\"][\"method\"].get(),\n backend_method);\n if (method == \"lof\") {\n if (backend_method == \"inverted_index\") {\n dump<\n anomaly<lof<inverted_index> >,\n anomaly_dump<lof<inverted_index>, lof_dump<\n inverted_index, inverted_index_recommender_dump> > >(m, js);\n } else {\n throw runtime_error(\"backend recommender method \\\"\" + backend_method +\n \"\\\" is not supported for dump\");\n }\n } else {\n throw runtime_error(\"anomaly method \\\"\" + method +\n \"\\\" is not supported for dump\");\n }\n } else {\n throw runtime_error(\"type \\\"\" + m.type_ +\n \"\\\" is not supported for dump\");\n }\n\n js.pretty(std::cout, true);\n return 0;\n} catch (const std::exception& e) {\n std::cerr << \"Error: failed to dump \\\"\" << path\n << \"\\\": \" << e.what() << std::endl;\n return -1;\n}\n\n} \/\/ namespace dump\n} \/\/ namespace jubatus\n\n\nint main(int argc, char* argv[]) {\n cmdline::parser p;\n p.add<std::string>(\"input\", 'i', \"Input file\");\n p.parse_check(argc, argv);\n\n return jubatus::dump::run(p.get<std::string>(\"input\"));\n}\n<commit_msg>support regression<commit_after>\/\/ Jubatus: Online machine learning framework for distributed environment\n\/\/ Copyright (C) 2013 Preferred Networks and Nippon Telegraph and Telephone Corporation.\n\/\/\n\/\/ This library is free software; you can redistribute it and\/or\n\/\/ modify it under the terms of the GNU Lesser General Public\n\/\/ License version 2.1 as published by the Free Software Foundation.\n\/\/\n\/\/ This library is distributed in the hope that it will be useful,\n\/\/ but WITHOUT ANY WARRANTY; without even the implied warranty of\n\/\/ MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU\n\/\/ Lesser General Public License for more details.\n\/\/\n\/\/ You should have received a copy of the GNU Lesser General Public\n\/\/ License along with this library; if not, write to the Free Software\n\/\/ Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA\n\n#include <iostream>\n#include <string>\n#include <exception>\n#include <vector>\n\n#include <msgpack.hpp>\n#include <jubatus\/core\/common\/big_endian.hpp>\n#include <jubatus\/core\/common\/jsonconfig\/config.hpp>\n#include <jubatus\/core\/common\/jsonconfig\/cast.hpp>\n#include <jubatus\/util\/data\/serialization\/unordered_map.h>\n#include <jubatus\/util\/text\/json.h>\n#include <jubatus\/util\/lang\/cast.h>\n\n#include \"third_party\/cmdline\/cmdline.h\"\n\n#include \"jubatus\/dump\/classifier.hpp\"\n#include \"jubatus\/dump\/recommender.hpp\"\n#include \"jubatus\/dump\/anomaly.hpp\"\n\nusing std::runtime_error;\nusing jubatus::core::common::read_big_endian;\nusing jubatus::util::lang::lexical_cast;\nusing jubatus::util::text::json::from_json;\n\nnamespace jubatus {\nnamespace dump {\n\nstruct model {\n std::string type_;\n jubatus::core::common::jsonconfig::config config_;\n std::vector<char> user_data_;\n};\n\nvoid read(std::ifstream& ifs, model& m) {\n \/\/ TODO(unno): This implementation ignores checksums, version, and all other\n \/\/ check codes. We need to re-implemenet such process like\n \/\/ jubatus::server::framework::save_server\/load_server, or to use these\n \/\/ methods to show file format errors.\n\n ifs.exceptions(std::ifstream::failbit);\n\n std::vector<char> system_data_buf;\n try {\n char header_buf[48];\n ifs.read(header_buf, 48);\n\n uint64_t system_data_size = read_big_endian<uint64_t>(&header_buf[32]);\n system_data_buf.resize(system_data_size);\n ifs.read(&system_data_buf[0], system_data_size);\n\n uint64_t user_data_size = read_big_endian<uint64_t>(&header_buf[40]);\n m.user_data_.resize(user_data_size);\n ifs.read(&m.user_data_[0], user_data_size);\n } catch (std::ios_base::failure& e) {\n throw runtime_error(\"Input stream reached end of file.\");\n }\n\n if (ifs.peek() != -1) {\n std::ifstream::pos_type pos = ifs.tellg();\n throw runtime_error(\"Input stream remains. Position: \" +\n lexical_cast<std::string>(pos));\n }\n ifs.close();\n\n msgpack::unpacked msg;\n msgpack::unpack(&msg, system_data_buf.data(), system_data_buf.size());\n msgpack::object system_data = msg.get();\n std::string config;\n system_data.via.array.ptr[2].convert(&m.type_);\n system_data.via.array.ptr[4].convert(&config);\n m.config_ = jubatus::core::common::jsonconfig::config(\n jubatus::util::lang::lexical_cast<\n jubatus::util::text::json::json>(config));\n}\n\ntemplate <typename T, typename D>\nvoid dump(model& m, jubatus::util::text::json::json& js) {\n msgpack::unpacked msg_user;\n msgpack::unpack(&msg_user, m.user_data_.data(), m.user_data_.size());\n\n \/\/ obj[0] is the version of the saved model file\n T data;\n msg_user.get().via.array.ptr[1].convert(&data);\n\n D dump(data);\n js = jubatus::util::text::json::to_json(dump);\n}\n\nint run(const std::string& path) try {\n std::ifstream ifs(path.c_str());\n if (!ifs) {\n throw runtime_error(\"Cannot open: \" + path);\n }\n\n model m;\n jubatus::util::text::json::json js;\n\n try {\n read(ifs, m);\n } catch (const std::exception& e) {\n throw runtime_error(std::string(\"invalid model file structure: \") +\n e.what());\n }\n\n if (m.type_ == \"classifier\" || m.type_ == \"regression\") {\n dump<classifier<local_storage>,\n classifier_dump<local_storage, local_storage_dump> >(m, js);\n } else if (m.type_ == \"recommender\") {\n std::string method;\n from_json<std::string>(m.config_[\"method\"].get(), method);\n if (method == \"inverted_index\") {\n dump<recommender<inverted_index>,\n recommender_dump<inverted_index_recommender_dump> >(m, js);\n } else {\n throw runtime_error(\"recommender method \\\"\" + method +\n \"\\\" is not supported for dump\");\n }\n } else if (m.type_ == \"anomaly\") {\n std::string method, backend_method;\n from_json<std::string>(m.config_[\"method\"].get(), method);\n from_json<std::string>(m.config_[\"parameter\"][\"method\"].get(),\n backend_method);\n if (method == \"lof\") {\n if (backend_method == \"inverted_index\") {\n dump<\n anomaly<lof<inverted_index> >,\n anomaly_dump<lof<inverted_index>, lof_dump<\n inverted_index, inverted_index_recommender_dump> > >(m, js);\n } else {\n throw runtime_error(\"backend recommender method \\\"\" + backend_method +\n \"\\\" is not supported for dump\");\n }\n } else {\n throw runtime_error(\"anomaly method \\\"\" + method +\n \"\\\" is not supported for dump\");\n }\n } else {\n throw runtime_error(\"type \\\"\" + m.type_ +\n \"\\\" is not supported for dump\");\n }\n\n js.pretty(std::cout, true);\n return 0;\n} catch (const std::exception& e) {\n std::cerr << \"Error: failed to dump \\\"\" << path\n << \"\\\": \" << e.what() << std::endl;\n return -1;\n}\n\n} \/\/ namespace dump\n} \/\/ namespace jubatus\n\n\nint main(int argc, char* argv[]) {\n cmdline::parser p;\n p.add<std::string>(\"input\", 'i', \"Input file\");\n p.parse_check(argc, argv);\n\n return jubatus::dump::run(p.get<std::string>(\"input\"));\n}\n<|endoftext|>"} {"text":"<commit_before>#include <iostream>\n#include <fstream>\n#include <iomanip>\n#include <string>\n#include <random>\n#include <nanikanizer\/nanikanizer.hpp>\n\ntypedef std::pair<int, std::valarray<float>> image_type;\nstatic const std::size_t channel_size = 32 * 32;\nstatic const std::size_t whole_size = channel_size * 3;\n\ntemplate <class Iterator>\nvoid load_images(const std::string& file, Iterator it)\n{\n\tstd::ifstream is(file, std::ios_base::binary);\n\n\tstd::vector<char> buffer(whole_size);\n\tstd::valarray<float> values(whole_size);\n\n\twhile (true)\n\t{\n\t\tint type = is.get();\n\t\tif (is.eof())\n\t\t\tbreak;\n\n\t\tis.read(buffer.data(), whole_size);\n\n\t\tfor (std::size_t i = 0; i < channel_size; ++i)\n\t\t{\n\t\t\tvalues[i * 3] = static_cast<float>(static_cast<unsigned char>(buffer[i]));\n\t\t\tvalues[i * 3 + 1] = static_cast<float>(static_cast<unsigned char>(buffer[i + channel_size]));\n\t\t\tvalues[i * 3 + 2] = static_cast<float>(static_cast<unsigned char>(buffer[i + channel_size * 2]));\n\t\t}\n\n\t\tvalues -= values.sum() \/ values.size();\n\t\tvalues \/= (values * values).sum() \/ values.size();\n\n\t\t*it++ = image_type(type, values);\n\t}\n}\n\nint main(int \/*argc*\/, char* \/*argv*\/[])\n{\n\ttry\n\t{\n\t\tstd::vector<std::string> data_files =\n\t\t{\n\t\t\t\"data_batch_1.bin\",\n\t\t\t\"data_batch_2.bin\",\n\t\t\t\"data_batch_3.bin\",\n\t\t\t\"data_batch_4.bin\",\n\t\t\t\"data_batch_5.bin\",\n\t\t};\n\n\t\tstd::string test_file = \"test_batch.bin\";\n\n\t\tstd::vector<image_type> data_images;\n\t\tstd::vector<image_type> test_images;\n\n\t\tfor (const std::string& file : data_files)\n\t\t\tload_images(file, std::back_inserter(data_images));\n\n\t\tload_images(test_file, std::back_inserter(test_images));\n\n\t\tstd::size_t id_size = 10;\n\n\t\tstd::vector<std::valarray<float>> ids(id_size);\n\n\t\tfor (std::size_t i = 0; i < id_size; ++i)\n\t\t{\n\t\t\tstd::valarray<float> id(id_size);\n\t\t\tid[i] = 1.0f;\n\t\t\tids[i] = id;\n\t\t}\n\n\t\ttypedef std::pair<std::string, std::shared_ptr<nnk::optimizer_base>> named_optimizer_type;\n\n\t\tstd::vector<named_optimizer_type> optimizers =\n\t\t{\n\t\t\tstd::make_pair(\"SGD\", std::make_shared<nnk::sgd_optimizer>()),\n\t\t\tstd::make_pair(\"AdaGrad\", std::make_shared<nnk::adagrad_optimizer>()),\n\t\t\tstd::make_pair(\"RMSProp\", std::make_shared<nnk::rmsprop_optimizer>()),\n\t\t\tstd::make_pair(\"AdaDelta\", std::make_shared<nnk::adadelta_optimizer>()),\n\t\t\tstd::make_pair(\"Adam\", std::make_shared<nnk::adam_optimizer>()),\n\t\t};\n\n\t\tfor (auto& key_value : optimizers)\n\t\t{\n\t\t\tstd::ofstream os(key_value.first + \".log\");\n\n\t\t\tstd::cout << std::fixed << std::setprecision(5);\n\t\t\tos << std::fixed << std::setprecision(5);\n\n\t\t\tstd::cout << key_value.first << std::endl;\n\t\t\tos << key_value.first << std::endl;\n\n\t\t\tnnk::linear_layer<float> l1(75, 6);\n\t\t\tnnk::linear_layer<float> l2(150, 16);\n\t\t\tnnk::linear_layer<float> l3(400, 120);\n\t\t\tnnk::linear_layer<float> l4(120, 84);\n\t\t\tnnk::linear_layer<float> l5(84, id_size);\n\n\t\t\tstd::size_t batch_size = 900;\n\n\t\t\tnnk::variable<float> x1;\n\t\t\tnnk::variable<float> y;\n\n\t\t\tauto x2 = nnk::convolution_2d(x1.expr(), 32, 32, 3, 5, 5);\n\t\t\tauto x3 = nnk::relu(l1(x2));\n\t\t\tauto x4 = nnk::max_pooling_2d(x3, 28, 28, 6, 2, 2);\n\t\t\tauto x5 = nnk::convolution_2d(x4, 14, 14, 6, 5, 5);\n\t\t\tauto x6 = nnk::relu(l2(x5));\n\t\t\tauto x7 = nnk::max_pooling_2d(x6, 10, 10, 16, 2, 2);\n\t\t\tauto x8 = nnk::relu(l3(x7));\n\t\t\tauto x9 = nnk::relu(l4(x8));\n\t\t\tauto x10 = nnk::softmax(l5(x9), id_size);\n\t\t\tauto loss = nnk::cross_entropy(x10 - y.expr());\n\n\t\t\tauto get_answer = [&](std::size_t index)\n\t\t\t{\n\t\t\t\tconst auto& r = x10.root()->output();\n\t\t\t\tauto begin = &r[index * id_size];\n\t\t\t\tauto end = begin + id_size;\n\t\t\t\tauto it = std::max_element(begin, end);\n\t\t\t\treturn it - begin;\n\t\t\t};\n\n\t\t\tnnk::evaluator<float> ev(loss);\n\n\t\t\tauto& optimizer = *key_value.second;\n\n\t\t\toptimizer.add_parameter(l1);\n\t\t\toptimizer.add_parameter(l2);\n\t\t\toptimizer.add_parameter(l3);\n\t\t\toptimizer.add_parameter(l4);\n\t\t\toptimizer.add_parameter(l5);\n\n\t\t\tstd::mt19937 generator;\n\t\t\tstd::uniform_int<std::size_t> index_generator(0, data_images.size() - 1);\n\n\t\t\tfor (std::size_t i = 0; i < 100; ++i)\n\t\t\t{\n\t\t\t\tx1.value().resize(batch_size * whole_size);\n\t\t\t\ty.value().resize(batch_size * id_size);\n\n\t\t\t\tfor (std::size_t j = 0; j < 300; ++j)\n\t\t\t\t{\n\t\t\t\t\tfor (std::size_t k = 0; k < batch_size; ++k)\n\t\t\t\t\t{\n\t\t\t\t\t\tstd::size_t index = index_generator(generator);\n\t\t\t\t\t\tconst image_type& image = data_images[index];\n\n\t\t\t\t\t\tfor (std::size_t l = 0; l < whole_size; ++l)\n\t\t\t\t\t\t\tx1.value()[k * whole_size + l] = image.second[l];\n\n\t\t\t\t\t\tfor (std::size_t l = 0; l < id_size; ++l)\n\t\t\t\t\t\t\ty.value()[k * id_size + l] = ids[image.first][l];\n\t\t\t\t\t}\n\n\t\t\t\t\toptimizer.zero_grads();\n\n\t\t\t\t\tdouble loss_value = ev.forward()[0];\n\t\t\t\t\tev.backward();\n\n\t\t\t\t\tstd::cout << loss_value << std::endl;\n\t\t\t\t\tos << loss_value << std::endl;\n\n\t\t\t\t\toptimizer.update();\n\t\t\t\t}\n\n\t\t\t\tstd::size_t count_ok = 0;\n\n\t\t\t\tfor (const auto& image : test_images)\n\t\t\t\t{\n\t\t\t\t\tx1.value() = image.second;\n\n\t\t\t\t\tev.forward();\n\n\t\t\t\t\tif (get_answer(0) == image.first)\n\t\t\t\t\t\t++count_ok;\n\t\t\t\t}\n\n\t\t\t\tdouble rate = static_cast<double>(count_ok) \/ static_cast<double>(test_images.size());\n\t\t\t\tstd::cout << \"rate: \" << rate << std::endl;\n\t\t\t}\n\t\t}\n\t}\n\tcatch (std::exception& e)\n\t{\n\t\tstd::cerr << e.what() << std::endl;\n\t\treturn -1;\n\t}\n\n\treturn 0;\n}\n<commit_msg>Regularization<commit_after>#include <iostream>\n#include <fstream>\n#include <iomanip>\n#include <string>\n#include <random>\n#include <nanikanizer\/nanikanizer.hpp>\n\ntypedef std::pair<int, std::valarray<float>> image_type;\nstatic const std::size_t channel_size = 32 * 32;\nstatic const std::size_t whole_size = channel_size * 3;\n\ntemplate <class Iterator>\nvoid load_images(const std::string& file, Iterator it)\n{\n\tstd::ifstream is(file, std::ios_base::binary);\n\n\tstd::vector<char> buffer(whole_size);\n\tstd::valarray<float> values(whole_size);\n\n\twhile (true)\n\t{\n\t\tint type = is.get();\n\t\tif (is.eof())\n\t\t\tbreak;\n\n\t\tis.read(buffer.data(), whole_size);\n\n\t\tfor (std::size_t i = 0; i < channel_size; ++i)\n\t\t{\n\t\t\tvalues[i * 3] = static_cast<float>(static_cast<unsigned char>(buffer[i]));\n\t\t\tvalues[i * 3 + 1] = static_cast<float>(static_cast<unsigned char>(buffer[i + channel_size]));\n\t\t\tvalues[i * 3 + 2] = static_cast<float>(static_cast<unsigned char>(buffer[i + channel_size * 2]));\n\t\t}\n\n\t\tvalues -= values.sum() \/ values.size();\n\t\tvalues \/= (values * values).sum() \/ values.size();\n\n\t\t*it++ = image_type(type, values);\n\t}\n}\n\nint main(int \/*argc*\/, char* \/*argv*\/[])\n{\n\ttry\n\t{\n\t\tstd::vector<std::string> data_files =\n\t\t{\n\t\t\t\"data_batch_1.bin\",\n\t\t\t\"data_batch_2.bin\",\n\t\t\t\"data_batch_3.bin\",\n\t\t\t\"data_batch_4.bin\",\n\t\t\t\"data_batch_5.bin\",\n\t\t};\n\n\t\tstd::string test_file = \"test_batch.bin\";\n\n\t\tstd::vector<image_type> data_images;\n\t\tstd::vector<image_type> test_images;\n\n\t\tfor (const std::string& file : data_files)\n\t\t\tload_images(file, std::back_inserter(data_images));\n\n\t\tload_images(test_file, std::back_inserter(test_images));\n\n\t\tstd::size_t id_size = 10;\n\n\t\tstd::vector<std::valarray<float>> ids(id_size);\n\n\t\tfor (std::size_t i = 0; i < id_size; ++i)\n\t\t{\n\t\t\tstd::valarray<float> id(id_size);\n\t\t\tid[i] = 1.0f;\n\t\t\tids[i] = id;\n\t\t}\n\n\t\ttypedef std::pair<std::string, std::shared_ptr<nnk::optimizer_base>> named_optimizer_type;\n\n\t\tstd::vector<named_optimizer_type> optimizers =\n\t\t{\n\t\t\tstd::make_pair(\"SGD\", std::make_shared<nnk::sgd_optimizer>()),\n\t\t\tstd::make_pair(\"AdaGrad\", std::make_shared<nnk::adagrad_optimizer>()),\n\t\t\tstd::make_pair(\"RMSProp\", std::make_shared<nnk::rmsprop_optimizer>()),\n\t\t\tstd::make_pair(\"AdaDelta\", std::make_shared<nnk::adadelta_optimizer>()),\n\t\t\tstd::make_pair(\"Adam\", std::make_shared<nnk::adam_optimizer>()),\n\t\t};\n\n\t\tfor (auto& key_value : optimizers)\n\t\t{\n\t\t\tstd::ofstream os(key_value.first + \".log\");\n\n\t\t\tstd::cout << std::fixed << std::setprecision(5);\n\t\t\tos << std::fixed << std::setprecision(5);\n\n\t\t\tstd::cout << key_value.first << std::endl;\n\t\t\tos << key_value.first << std::endl;\n\n\t\t\tnnk::linear_layer<float> l1(75, 6);\n\t\t\tnnk::linear_layer<float> l2(150, 16);\n\t\t\tnnk::linear_layer<float> l3(400, 120);\n\t\t\tnnk::linear_layer<float> l4(120, 84);\n\t\t\tnnk::linear_layer<float> l5(84, id_size);\n\n\t\t\tstd::size_t batch_size = 900;\n\n\t\t\tnnk::variable<float> x1;\n\t\t\tnnk::variable<float> y;\n\n\t\t\tauto x2 = nnk::convolution_2d(x1.expr(), 32, 32, 3, 5, 5);\n\t\t\tauto x3 = nnk::relu(l1(x2));\n\t\t\tauto x4 = nnk::max_pooling_2d(x3, 28, 28, 6, 2, 2);\n\t\t\tauto x5 = nnk::convolution_2d(x4, 14, 14, 6, 5, 5);\n\t\t\tauto x6 = nnk::relu(l2(x5));\n\t\t\tauto x7 = nnk::max_pooling_2d(x6, 10, 10, 16, 2, 2);\n\t\t\tauto x8 = nnk::relu(l3(x7));\n\t\t\tauto x9 = nnk::relu(l4(x8));\n\t\t\tauto x10 = nnk::softmax(l5(x9), id_size);\n\t\t\tauto x11 = nnk::cross_entropy(x10 - y.expr());\n\n\t\t\tauto reg =\n\t\t\t\tnnk::sum(nnk::abs(l1.weight())) +\n\t\t\t\tnnk::sum(nnk::abs(l2.weight())) +\n\t\t\t\tnnk::sum(nnk::abs(l3.weight())) +\n\t\t\t\tnnk::sum(nnk::abs(l4.weight())) +\n\t\t\t\tnnk::sum(nnk::abs(l5.weight()));\n\n\t\t\tauto loss = x11 + reg * nnk::expression<float>(0.1f);\n\n\t\t\tauto get_answer = [&](std::size_t index)\n\t\t\t{\n\t\t\t\tconst auto& r = x10.root()->output();\n\t\t\t\tauto begin = &r[index * id_size];\n\t\t\t\tauto end = begin + id_size;\n\t\t\t\tauto it = std::max_element(begin, end);\n\t\t\t\treturn it - begin;\n\t\t\t};\n\n\t\t\tnnk::evaluator<float> ev(loss);\n\n\t\t\tauto& optimizer = *key_value.second;\n\n\t\t\toptimizer.add_parameter(l1);\n\t\t\toptimizer.add_parameter(l2);\n\t\t\toptimizer.add_parameter(l3);\n\t\t\toptimizer.add_parameter(l4);\n\t\t\toptimizer.add_parameter(l5);\n\n\t\t\tstd::mt19937 generator;\n\t\t\tstd::uniform_int<std::size_t> index_generator(0, data_images.size() - 1);\n\n\t\t\tfor (std::size_t i = 0; i < 100; ++i)\n\t\t\t{\n\t\t\t\tx1.value().resize(batch_size * whole_size);\n\t\t\t\ty.value().resize(batch_size * id_size);\n\n\t\t\t\tfloat last_loss = 0.0f;\n\n\t\t\t\tfor (std::size_t j = 0; j < 100; ++j)\n\t\t\t\t{\n\t\t\t\t\tfor (std::size_t k = 0; k < batch_size; ++k)\n\t\t\t\t\t{\n\t\t\t\t\t\tstd::size_t index = index_generator(generator);\n\t\t\t\t\t\tconst image_type& image = data_images[index];\n\n\t\t\t\t\t\tfor (std::size_t l = 0; l < whole_size; ++l)\n\t\t\t\t\t\t\tx1.value()[k * whole_size + l] = image.second[l];\n\n\t\t\t\t\t\tfor (std::size_t l = 0; l < id_size; ++l)\n\t\t\t\t\t\t\ty.value()[k * id_size + l] = ids[image.first][l];\n\t\t\t\t\t}\n\n\t\t\t\t\toptimizer.zero_grads();\n\n\t\t\t\t\tlast_loss = ev.forward()[0];\n\t\t\t\t\tev.backward();\n\n\t\t\t\t\toptimizer.update();\n\t\t\t\t}\n\n\t\t\t\tstd::size_t count_ok = 0;\n\n\t\t\t\tfor (const auto& image : test_images)\n\t\t\t\t{\n\t\t\t\t\tx1.value() = image.second;\n\n\t\t\t\t\tev.forward();\n\n\t\t\t\t\tif (get_answer(0) == image.first)\n\t\t\t\t\t\t++count_ok;\n\t\t\t\t}\n\n\t\t\t\tdouble rate = static_cast<double>(count_ok) \/ static_cast<double>(test_images.size());\n\t\t\t\tstd::cout << last_loss << \"\\t\" << rate << std::endl;\n\t\t\t\tos << last_loss << \"\\t\" << rate << std::endl;\n\t\t\t}\n\t\t}\n\t}\n\tcatch (std::exception& e)\n\t{\n\t\tstd::cerr << e.what() << std::endl;\n\t\treturn -1;\n\t}\n\n\treturn 0;\n}\n<|endoftext|>"} {"text":"<commit_before>\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\n\/\/ Minimalistic Vulkan Triangle sample\n\/\/\n\/\/ \n\n#define USE_GLSL\n#define VERTEX_BUFFER_BIND_ID 0\n\n\n\/\/ vulkan utilities.\n#include \"vku.hpp\"\n\nclass triangle_example : public vku::window\n{\npublic:\n struct {\n glm::mat4 projectionMatrix;\n glm::mat4 modelMatrix;\n glm::mat4 viewMatrix;\n } uniform_data;\n\n vku::buffer vertex_buffer;\n vku::buffer index_buffer;\n vku::buffer uniform_buffer;\n vku::descriptorPool descPool;\n vku::pipeline pipe;\n vku::shaderModule vertexShader;\n vku::shaderModule fragmentShader;\n size_t num_indices;\n\n triangle_example() : vku::window(false, 1280, 720, -2.5f, \"triangle\") {\n\n \/\/ Vertices\n struct Vertex { float pos[3]; float col[3]; };\n\n static const Vertex vertex_data[] = {\n { { 1.0f, 1.0f, 0.0f }, { 1.0f, 0.0f, 0.0f } },\n { { -1.0f, 1.0f, 0.0f }, { 0.0f, 1.0f, 0.0f } },\n { { 0.0f, -1.0f, 0.0f }, { 0.0f, 0.0f, 1.0f} }\n };\n\n vertex_buffer = vku::buffer(device(), (void*)vertex_data, sizeof(vertex_data), VK_BUFFER_USAGE_VERTEX_BUFFER_BIT);\n\n \/\/ Indices\n static const uint32_t index_data[] = { 0, 1, 2 };\n index_buffer = vku::buffer(device(), (void*)index_data, sizeof(index_data), VK_BUFFER_USAGE_INDEX_BUFFER_BIT);\n num_indices = 3;\n\n \/\/ Binding state\n vku::pipelineCreateHelper pipeHelper;\n pipeHelper.binding(VERTEX_BUFFER_BIND_ID, sizeof(Vertex), VK_VERTEX_INPUT_RATE_VERTEX);\n pipeHelper.attrib(0, VERTEX_BUFFER_BIND_ID, VK_FORMAT_R32G32B32_SFLOAT, 0);\n pipeHelper.attrib(1, VERTEX_BUFFER_BIND_ID, VK_FORMAT_R32G32B32_SFLOAT, sizeof(float) * 3);\n\n uniform_buffer = vku::buffer(device(), (void*)nullptr, sizeof(uniform_data), VK_BUFFER_USAGE_UNIFORM_BUFFER_BIT);\n \n vertexShader = vku::shaderModule(device(), \"data\/shaders\/triangle.vert\", VK_SHADER_STAGE_VERTEX_BIT);\n fragmentShader = vku::shaderModule(device(), \"data\/shaders\/triangle.frag\", VK_SHADER_STAGE_FRAGMENT_BIT);\n\n pipeHelper.uniformBuffers(1, VK_SHADER_STAGE_VERTEX_BIT);\n\n pipeHelper.shader(vertexShader, VK_SHADER_STAGE_VERTEX_BIT);\n pipeHelper.shader(fragmentShader, VK_SHADER_STAGE_FRAGMENT_BIT);\n\n pipe = vku::pipeline(device(), swapChain().renderPass(), pipelineCache(), pipeHelper);\n\n descPool = vku::descriptorPool(device());\n\n pipe.allocateDescriptorSets(descPool);\n pipe.updateDescriptorSets(uniform_buffer);\n\n for (int32_t i = 0; i < swapChain().imageCount(); ++i) {\n const vku::cmdBuffer &cmdbuf = drawCmdBuffer(i);\n cmdbuf.begin(swapChain().renderPass(), swapChain().frameBuffer(i), width(), height());\n\n cmdbuf.bindPipeline(pipe);\n cmdbuf.bindVertexBuffer(vertex_buffer, VERTEX_BUFFER_BIND_ID);\n cmdbuf.bindIndexBuffer(index_buffer);\n cmdbuf.drawIndexed((uint32_t)num_indices, 1, 0, 0, 1);\n\n cmdbuf.end(swapChain().image(i));\n }\n\n updateUniformBuffers();\n }\n\n void draw()\n {\n present();\n }\n\n void updateUniformBuffers()\n {\n uniform_data.projectionMatrix = defaultProjectionMatrix();\n uniform_data.viewMatrix = defaultViewMatrix();\n uniform_data.modelMatrix = defaultModelMatrix();\n\n void *dest = uniform_buffer.map();\n memcpy(dest, &uniform_data, sizeof(uniform_data));\n uniform_buffer.unmap();\n }\n\n void render() override\n {\n device().waitIdle();\n draw();\n device().waitIdle();\n }\n\n void viewChanged() override\n {\n \/\/ This function is called by the base example class \n \/\/ each time the view is changed by user input\n updateUniformBuffers();\n }\n};\n\n\n\nint main(const int argc, const char *argv[]) {\n try {\n triangle_example my_example;\n\n while (vku::window::poll()) {\n if (my_example.windowIsClosed()) {\n break;\n }\n my_example.render();\n }\n } catch(std::runtime_error &e) {\n printf(\"fail: %s\\n\", e.what());\n }\n\n return 0;\n}\n<commit_msg>Lance's feedback<commit_after>\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\n\/\/ Minimalistic Vulkan Triangle sample\n\/\/\n\/\/ \n\n\/\/ vulkan utilities.\n#include \"vku.hpp\"\n\nclass triangle_example : public vku::window\n{\npublic:\n struct {\n glm::mat4 projectionMatrix;\n glm::mat4 modelMatrix;\n glm::mat4 viewMatrix;\n } uniform_data;\n\n vku::buffer vertex_buffer;\n vku::buffer index_buffer;\n vku::buffer uniform_buffer;\n\n vku::descriptorPool descPool;\n vku::pipeline pipe;\n\n vku::shaderModule vertexShader;\n vku::shaderModule fragmentShader;\n size_t num_indices;\n\n static const int VERTEX_BUFFER_BIND_ID = 0;\n\n\n triangle_example() : vku::window(false, 1280, 720, -2.5f, \"triangle\") {\n\n \/\/ Vertices\n struct Vertex { float pos[3]; float col[3]; };\n\n static const Vertex vertex_data[] = {\n { { 1.0f, 1.0f, 0.0f }, { 1.0f, 0.0f, 0.0f } },\n { { -1.0f, 1.0f, 0.0f }, { 0.0f, 1.0f, 0.0f } },\n { { 0.0f, -1.0f, 0.0f }, { 0.0f, 0.0f, 1.0f} }\n };\n\n vertex_buffer = vku::buffer(device(), (void*)vertex_data, sizeof(vertex_data), VK_BUFFER_USAGE_VERTEX_BUFFER_BIT);\n\n \/\/ Indices\n static const uint32_t index_data[] = { 0, 1, 2 };\n index_buffer = vku::buffer(device(), (void*)index_data, sizeof(index_data), VK_BUFFER_USAGE_INDEX_BUFFER_BIT);\n num_indices = 3;\n\n \/\/ Binding state\n vku::pipelineCreateHelper pipeHelper;\n pipeHelper.binding(VERTEX_BUFFER_BIND_ID, sizeof(Vertex), VK_VERTEX_INPUT_RATE_VERTEX);\n pipeHelper.attrib(0, VERTEX_BUFFER_BIND_ID, VK_FORMAT_R32G32B32_SFLOAT, 0);\n pipeHelper.attrib(1, VERTEX_BUFFER_BIND_ID, VK_FORMAT_R32G32B32_SFLOAT, sizeof(float) * 3);\n\n uniform_buffer = vku::buffer(device(), (void*)nullptr, sizeof(uniform_data), VK_BUFFER_USAGE_UNIFORM_BUFFER_BIT);\n \n vertexShader = vku::shaderModule(device(), \"data\/shaders\/triangle.vert\", VK_SHADER_STAGE_VERTEX_BIT);\n fragmentShader = vku::shaderModule(device(), \"data\/shaders\/triangle.frag\", VK_SHADER_STAGE_FRAGMENT_BIT);\n\n pipeHelper.uniformBuffers(1, VK_SHADER_STAGE_VERTEX_BIT);\n\n pipeHelper.shader(vertexShader, VK_SHADER_STAGE_VERTEX_BIT);\n pipeHelper.shader(fragmentShader, VK_SHADER_STAGE_FRAGMENT_BIT);\n\n pipe = vku::pipeline(device(), swapChain().renderPass(), pipelineCache(), pipeHelper);\n\n descPool = vku::descriptorPool(device());\n\n pipe.allocateDescriptorSets(descPool);\n pipe.updateDescriptorSets(uniform_buffer);\n\n for (int32_t i = 0; i < swapChain().imageCount(); ++i) {\n const vku::cmdBuffer &cmdbuf = drawCmdBuffer(i);\n cmdbuf.begin(swapChain().renderPass(), swapChain().frameBuffer(i), width(), height());\n\n cmdbuf.bindPipeline(pipe);\n cmdbuf.bindVertexBuffer(vertex_buffer, VERTEX_BUFFER_BIND_ID);\n cmdbuf.bindIndexBuffer(index_buffer);\n cmdbuf.drawIndexed((uint32_t)num_indices, 1, 0, 0, 1);\n\n cmdbuf.end(swapChain().image(i));\n }\n\n updateUniformBuffers();\n }\n\n void updateUniformBuffers()\n {\n uniform_data.projectionMatrix = defaultProjectionMatrix();\n uniform_data.viewMatrix = defaultViewMatrix();\n uniform_data.modelMatrix = defaultModelMatrix();\n\n void *dest = uniform_buffer.map();\n memcpy(dest, &uniform_data, sizeof(uniform_data));\n uniform_buffer.unmap();\n }\n\n void render() override\n {\n device().waitIdle();\n present();\n device().waitIdle();\n }\n\n void viewChanged() override\n {\n \/\/ This function is called by the base example class \n \/\/ each time the view is changed by user input\n updateUniformBuffers();\n }\n};\n\n\n\nint main(const int argc, const char *argv[]) {\n try {\n triangle_example my_example;\n\n while (vku::window::poll()) {\n if (my_example.windowIsClosed()) {\n break;\n }\n my_example.render();\n }\n } catch(std::runtime_error &e) {\n printf(\"fail: %s\\n\", e.what());\n }\n\n return 0;\n}\n<|endoftext|>"} {"text":"<commit_before>#include <iostream>\n\nint main() {\n std::cout << \"Hello World\" << std::endl;\n}<commit_msg>Code sample to show how pool works<commit_after>#include <iostream>\n\n\n#include \"SafeQueue.h\"\n#include \"ThreadPool.h\"\n#include <utility>\n\n\n\/\/ Simple function that adds multiplies two numbers and prints the result\nvoid multiply(const int a, const int b) {\n \/\/ Simulate hard computation\n _sleep(2000);\n const int res = a * b;\n std::cout << a << \" * \" << b << \" = \" << res << std::endl;\n}\n\n\n\/\/ Same as before but now we have an output parameter\nvoid multiply_output(const int a, const int b, int & res) {\n \/\/ Simulate hard computation\n _sleep(2000);\n res = a * b;\n std::cout << a << \" * \" << b << \" = \" << res << std::endl;\n}\n\n\nint main() {\n \/\/ Create pool with 3 threads\n ThreadPool pool(3);\n \/\/ Initialize pool\n pool.init();\n\n \/\/ Initialize local variables\n int res;\n const int a = 2, b = 3, c = 4, d = 5;\n\n \/\/ Submit multiplication table\n for (int i = 1; i < 10; ++i) {\n for (int j = 1; j < 10; ++j) {\n pool.submit(multiply, i, j);\n }\n }\n\n \/\/ Submit some functions to execute\n auto multiply_future = pool.submit(multiply_output, a, b, std::ref(res));\n\n \/\/ Wait for multiplication output to finish\n multiply_future.get();\n std::cout << \"Last operation result is equals to \" << res << std::endl;\n\n _sleep(10000);\n pool.shutdown();\n}<|endoftext|>"} {"text":"<commit_before>\/**\n * Copyright (c) 2013-2014, Dan\n * All rights 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 \"main.h\"\n\n#include <map>\n\n#include \"sdk\/amx\/amx.h\"\n#include \"sdk\/amx\/amx2.h\"\n#include \"sdk\/plugincommon.h\"\n\n#include \"time.h\"\n#include \"timers.h\"\n#include \"natives.h\"\n\nextern void *pAMXFunctions;\nlogprintf_t logprintf;\n\nconst AMX_NATIVE_INFO NATIVES[] =\n{\n {\"KillPlayerTimers\", Natives::KillPlayerTimers},\n {\"SetTimer_\", Natives::SetTimer_},\n {\"SetTimerEx_\", Natives::SetTimerEx_},\n {\"SetPlayerTimer\", Natives::SetPlayerTimer},\n {\"SetPlayerTimerEx\", Natives::SetPlayerTimerEx},\n {\"SetPlayerTimer_\", Natives::SetPlayerTimer_},\n {\"SetPlayerTimerEx_\", Natives::SetPlayerTimerEx_},\n {\"GetTimerFunctionName\", Natives::GetTimerFunctionName},\n {\"SetTimerInterval\", Natives::SetTimerInterval},\n {\"GetTimerInterval\", Natives::GetTimerInterval},\n {\"GetTimerIntervalLeft\", Natives::GetTimerIntervalLeft},\n {\"SetTimerDelay\", Natives::SetTimerDelay},\n {\"SetTimerCount\", Natives::SetTimerCount},\n {\"GetTimerCallsLeft\", Natives::GetTimerCallsLeft},\n {NULL, NULL}\n};\n\nPLUGIN_EXPORT unsigned int PLUGIN_CALL Supports()\n{\n return SUPPORTS_VERSION | SUPPORTS_AMX_NATIVES | SUPPORTS_PROCESS_TICK;\n}\n\nPLUGIN_EXPORT bool PLUGIN_CALL Load(void **ppData)\n{\n logprintf = (logprintf_t) ppData[PLUGIN_DATA_LOGPRINTF];\n pAMXFunctions = ppData[PLUGIN_DATA_AMX_EXPORTS];\n InitTime();\n logprintf(\" >> TimerFix \" PLUGIN_VERSION \" successfully loaded.\");\n return true;\n}\n\nPLUGIN_EXPORT int PLUGIN_CALL AmxLoad(AMX *amx)\n{\n amx_Redirect(amx, \"SetTimer\", (ucell) Natives::SetTimer, NULL);\n amx_Redirect(amx, \"SetTimerEx\", (ucell) Natives::SetTimerEx, NULL);\n amx_Redirect(amx, \"KillTimer\", (ucell) Natives::KillTimer, NULL);\n amx_Redirect(amx, \"GetTickCount\", (ucell) Natives::GetTickCount, NULL);\n return amx_Register(amx, NATIVES, -1);\n}\n\nPLUGIN_EXPORT int PLUGIN_CALL AmxUnload(AMX *amx)\n{\n for (std::map<int, struct timer*>::iterator it = timers.begin(), next = it; it != timers.end(); it = next)\n {\n ++next;\n struct timer *t = it->second;\n if (t->amx == amx)\n {\n DestroyTimer(t);\n timers.erase(it);\n }\n }\n return AMX_ERR_NONE;\n}\n\nPLUGIN_EXPORT void PLUGIN_CALL Unload()\n{\n logprintf(\"[plugin.timerfix] Plugsin successfully unloaded!\");\n}\n\nPLUGIN_EXPORT void PLUGIN_CALL ProcessTick()\n{\n unsigned long long now = GetMsTime();\n for (std::map<int, struct timer*>::iterator it = timers.begin(), next = it; it != timers.end(); it = next)\n {\n ++next;\n struct timer *t = it->second;\n if (t->repeat != 0)\n {\n if (t->next < now)\n {\n t->next += t->interval;\n ExecuteTimer(it->second);\n if (t->repeat > 0)\n {\n --t->repeat;\n }\n }\n }\n else\n {\n DestroyTimer(t);\n timers.erase(it);\n }\n }\n}\n<commit_msg>Fixed typo.<commit_after>\/**\n * Copyright (c) 2013-2014, Dan\n * All rights 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 \"main.h\"\n\n#include <map>\n\n#include \"sdk\/amx\/amx.h\"\n#include \"sdk\/amx\/amx2.h\"\n#include \"sdk\/plugincommon.h\"\n\n#include \"time.h\"\n#include \"timers.h\"\n#include \"natives.h\"\n\nextern void *pAMXFunctions;\nlogprintf_t logprintf;\n\nconst AMX_NATIVE_INFO NATIVES[] =\n{\n {\"KillPlayerTimers\", Natives::KillPlayerTimers},\n {\"SetTimer_\", Natives::SetTimer_},\n {\"SetTimerEx_\", Natives::SetTimerEx_},\n {\"SetPlayerTimer\", Natives::SetPlayerTimer},\n {\"SetPlayerTimerEx\", Natives::SetPlayerTimerEx},\n {\"SetPlayerTimer_\", Natives::SetPlayerTimer_},\n {\"SetPlayerTimerEx_\", Natives::SetPlayerTimerEx_},\n {\"GetTimerFunctionName\", Natives::GetTimerFunctionName},\n {\"SetTimerInterval\", Natives::SetTimerInterval},\n {\"GetTimerInterval\", Natives::GetTimerInterval},\n {\"GetTimerIntervalLeft\", Natives::GetTimerIntervalLeft},\n {\"SetTimerDelay\", Natives::SetTimerDelay},\n {\"SetTimerCount\", Natives::SetTimerCount},\n {\"GetTimerCallsLeft\", Natives::GetTimerCallsLeft},\n {NULL, NULL}\n};\n\nPLUGIN_EXPORT unsigned int PLUGIN_CALL Supports()\n{\n return SUPPORTS_VERSION | SUPPORTS_AMX_NATIVES | SUPPORTS_PROCESS_TICK;\n}\n\nPLUGIN_EXPORT bool PLUGIN_CALL Load(void **ppData)\n{\n logprintf = (logprintf_t) ppData[PLUGIN_DATA_LOGPRINTF];\n pAMXFunctions = ppData[PLUGIN_DATA_AMX_EXPORTS];\n InitTime();\n logprintf(\" >> TimerFix \" PLUGIN_VERSION \" successfully loaded.\");\n return true;\n}\n\nPLUGIN_EXPORT int PLUGIN_CALL AmxLoad(AMX *amx)\n{\n amx_Redirect(amx, \"SetTimer\", (ucell) Natives::SetTimer, NULL);\n amx_Redirect(amx, \"SetTimerEx\", (ucell) Natives::SetTimerEx, NULL);\n amx_Redirect(amx, \"KillTimer\", (ucell) Natives::KillTimer, NULL);\n amx_Redirect(amx, \"GetTickCount\", (ucell) Natives::GetTickCount, NULL);\n return amx_Register(amx, NATIVES, -1);\n}\n\nPLUGIN_EXPORT int PLUGIN_CALL AmxUnload(AMX *amx)\n{\n for (std::map<int, struct timer*>::iterator it = timers.begin(), next = it; it != timers.end(); it = next)\n {\n ++next;\n struct timer *t = it->second;\n if (t->amx == amx)\n {\n DestroyTimer(t);\n timers.erase(it);\n }\n }\n return AMX_ERR_NONE;\n}\n\nPLUGIN_EXPORT void PLUGIN_CALL Unload()\n{\n logprintf(\"[plugin.timerfix] Plugin successfully unloaded!\");\n}\n\nPLUGIN_EXPORT void PLUGIN_CALL ProcessTick()\n{\n unsigned long long now = GetMsTime();\n for (std::map<int, struct timer*>::iterator it = timers.begin(), next = it; it != timers.end(); it = next)\n {\n ++next;\n struct timer *t = it->second;\n if (t->repeat != 0)\n {\n if (t->next < now)\n {\n t->next += t->interval;\n ExecuteTimer(it->second);\n if (t->repeat > 0)\n {\n --t->repeat;\n }\n }\n }\n else\n {\n DestroyTimer(t);\n timers.erase(it);\n }\n }\n}\n<|endoftext|>"} {"text":"<commit_before>\/* \n * The MIT License (MIT)\n * \n * Copyright (c) 2014 Vivek Galatage\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 <include\/v8.h>\n#include <iostream>\n#include <fstream>\n#include <string>\n\nusing namespace v8;\nusing namespace std;\n\nHandle<ObjectTemplate> global_template;\nIsolate *isolate;\nclass Point;\n\nHandle<String> ReadFile(const char* name);\n\n\nclass Point\n{\npublic: \n Point(){x_ = 0; y_ = 0;}\n Point(int x, int y) : x_(x), y_(y) {}\n int x_, y_;\n\n inline void mul( const double scale )\n {\n x_ *= scale;\n y_ *= scale;\n }\n};\n\nPoint* UnwrapPoint( const FunctionCallbackInfo<v8::Value>& info ) \n{\n \/\/Get the self object,\n Local<v8::Object> self = info.Holder();\n \/\/Fetch the c++ pointer.\n Local<External> external = Local<External>::Cast( self->GetInternalField(0) );\n \/\/Get back to the type.\n Point* pt = static_cast<Point*>( external->Value());\n \/\/Return it\n return pt;\n}\n\nvoid GetPointX(Local<String> property,\n const PropertyCallbackInfo<Value>& info)\n{\n Local<Object> self = info.Holder();\n Local<External> wrap = Local<External>::Cast(self->GetInternalField(0));\n void* ptr = wrap->Value();\n int value = static_cast<Point*>(ptr)->x_;\n info.GetReturnValue().Set(Number::New(isolate, value));\n}\n\nvoid SetPointX(Local<String> property, \n Local<Value> value,\n const PropertyCallbackInfo<Value>& info)\n{\n Local<Object> self = info.Holder();\n Local<External> wrap = Local<External>::Cast(self->GetInternalField(0));\n void* ptr = wrap->Value();\n static_cast<Point*>(ptr)->x_ = value->Int32Value();\n}\n\nvoid GetPointY(Local<String> property,\n const PropertyCallbackInfo<Value>& info)\n{\n Local<Object> self = info.Holder();\n Local<External> wrap = Local<External>::Cast(self->GetInternalField(0));\n void* ptr = wrap->Value();\n int value = static_cast<Point*>(ptr)->y_;\n info.GetReturnValue().Set(Number::New(isolate, value));\n}\n\nvoid SetPointY(Local<String> property, \n Local<Value> value,\n const PropertyCallbackInfo<Value>& info)\n{\n Local<Object> self = info.Holder();\n Local<External> wrap = Local<External>::Cast(self->GetInternalField(0));\n void* ptr = wrap->Value();\n static_cast<Point*>(ptr)->y_ = value->Int32Value();\n}\n\nvoid MulCallback(const FunctionCallbackInfo<v8::Value>& args){\n int product = args.This()->Get(String::NewFromUtf8(isolate, \"x\"))->Int32Value() * args[0]->Int32Value();\n args.This()->Set(String::NewFromUtf8(isolate, \"x\"), Number::New(isolate, product));\n\n product = args.This()->Get(String::NewFromUtf8(isolate, \"y\"))->Int32Value() * args[0]->Int32Value();\n args.This()->Set(String::NewFromUtf8(isolate, \"y\"), Number::New(isolate, product));\n}\n\n\/\/ Defines a Point() JS Object\nvoid PointConstructor( const FunctionCallbackInfo<v8::Value>& args )\n{\n \/\/Locker lock;\n HandleScope scope(isolate);\n Handle<ObjectTemplate> t = v8::ObjectTemplate::New();\n\n \/\/The JavaScript point object only has 1 C++ object\n t->SetInternalFieldCount(1);\n\n \/\/ Create x and y members with starting values of 0\n \/\/t->Set(String::New(\"x\"), Number::New(0));\n t->SetAccessor(String::NewFromUtf8(isolate, \"x\"), \n (AccessorGetterCallback)GetPointX,\n (AccessorSetterCallback)SetPointX);\n\n \/\/t->Set(String::New(\"y\"), Number::New(0));\n t->SetAccessor(String::NewFromUtf8(isolate, \"y\"),\n (AccessorGetterCallback)GetPointY,\n (AccessorSetterCallback)SetPointY);\n\n \/\/ Create a mul(number) function that scales the point\n t->Set(String::NewFromUtf8(isolate, \"mul\"), FunctionTemplate::New(isolate, MulCallback));\n\n \/\/ for use in the if statement\n Point *p = NULL;\n Local<Object> obj;\n \n \/\/ If Point(x, y) ctor was passed in values assign them\n if(!args[0].IsEmpty() && args[0]->IsNumber() &&\n !args[1].IsEmpty() && args[1]->IsNumber()) {\n \/\/t->Set(String::New(\"x\"), args[0]);\n \/\/t->Set(String::New(\"y\"), args[1]);\n p = new Point(args[0]->Int32Value(), args[1]->Int32Value());\n obj = t->NewInstance();\n obj->SetInternalField(0, External::New(isolate, p)); \n } else {\n \/**\n * Wrap a point object\n *\/\n p = new Point(0, 0);\n obj = t->NewInstance();\n obj->SetInternalField(0, External::New(isolate, p));\n }\n\n \/\/ Return this newly created object\n args.GetReturnValue().Set(obj);\n}\n\n#define ANSI_COLOR_RED \"\\x1b[31m\"\n#define ANSI_COLOR_GREEN \"\\x1b[32m\"\n#define ANSI_COLOR_YELLOW \"\\x1b[33m\"\n#define ANSI_COLOR_BLUE \"\\x1b[34m\"\n#define ANSI_COLOR_MAGENTA \"\\x1b[35m\"\n#define ANSI_COLOR_CYAN \"\\x1b[36m\"\n#define ANSI_COLOR_RESET \"\\x1b[0m\"\nvoid Print(const v8::FunctionCallbackInfo<v8::Value>& args) {\n const char* color = nullptr;\n const char* resetColor = ANSI_COLOR_RESET;\n if (!args[0].IsEmpty() && args[0]->IsNumber()) {\n switch (args[0]->Int32Value()) {\n case 1:\n color = ANSI_COLOR_GREEN;\n break;\n case 2:\n color = ANSI_COLOR_YELLOW;\n break;\n case 3:\n color = ANSI_COLOR_RED;\n break;\n }\n }\n for (int i = 1; i < args.Length(); i++) {\n v8::HandleScope handle_scope(args.GetIsolate());\n v8::String::Utf8Value str(args[i]);\n string myStr = *(str);\n const char* cstr = myStr.c_str();\n printf(\"%s%s %s\", color, cstr, resetColor);\n }\n printf(\"\\n\", NULL);\n}\n\nint main()\n{\n \/\/Create the v8 environment\n \/*Isolate**\/ isolate = Isolate::New();\n Isolate::Scope isolate_scope(isolate);\n HandleScope handle_scope(isolate);\n\n \/*Handle<ObjectTemplate>*\/ global_template = ObjectTemplate::New(isolate);\n\n Handle<FunctionTemplate> obj = FunctionTemplate::New(isolate);\n obj->Set(String::NewFromUtf8(isolate, \"Point\"), FunctionTemplate::New(isolate, PointConstructor));\n\n \/\/ Tell global A JS Obj Point() can now be create and instructions on how to set up\n global_template->Set(String::NewFromUtf8(isolate, \"Point\"), FunctionTemplate::New(isolate, PointConstructor));\n\n Local<Context> context = Context::New(isolate, NULL, global_template);\n\n Context::Scope context_scope(context);\n\n Handle<v8::Object> global = context->Global();\n\n \/\/global->Set(String::New(\"Point\"), t);\n global->Set(v8::String::NewFromUtf8(isolate, \"print\"), v8::FunctionTemplate::New(isolate, Print)->GetFunction());\n\n string file = \"foo.js\";\n\n while(true){\n cout << \"How many times do you want to run the script? \\n\" << endl;\n\n int n; \n\n cin >> n;\n\n cout << \"\" << endl;\n\n std::cin.get();\n\n Handle<String> source = ReadFile(file.c_str());\n\n if(source.IsEmpty())\n {\n cout << \"Error reading file\" << endl;\n cout << \"Press enter to quit\" << endl;\n cin.get();\n return 0;\n }\n\n \/\/Compile\n Handle<Script> script = Script::Compile(source);\n \n \/\/Run the script and print \n Handle<Value> result;\n\n result = script->Run();\n\n } \/\/ End of while\n\n \/\/Exit program\n cout << \"\\nTest completed. Press enter to exit program. \\n\" << endl;\n std::cin.get();\n \n return 0;\n}\n\nv8::Handle<String> ReadFile(const char* name)\n{\n \/\/Open the file\n FILE* file;\n file = fopen(name, \"rb\");\n\n \/\/If there is no file, return an empty string\n if (file == NULL) return v8::Handle<v8::String>();\n\n \/\/Set the pointer to the end of the file\n fseek(file, 0, SEEK_END);\n\n \/\/Get the size of file\n int size = ftell(file);\n\n \/\/Rewind the pointer to the beginning of the stream\n rewind(file);\n\n \/\/Set up and read into the buffer\n char* chars = new char[size + 1];\n chars[size] = '\\0';\n for (int i = 0 ; i < size;)\n {\n int read = static_cast<int>(fread(&chars[i], 1, size - i, file));\n i += read;\n }\n\n \/\/Close file\n fclose(file);\n\n v8::Handle<v8::String> result = v8::String::NewFromUtf8(isolate, chars, String::kNormalString, size);\n delete[] chars;\n return result;\n}\n<commit_msg>In case of no color, remove the 'null' apperaing on the log<commit_after>\/* \n * The MIT License (MIT)\n * \n * Copyright (c) 2014 Vivek Galatage\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 <include\/v8.h>\n#include <iostream>\n#include <fstream>\n#include <string>\n\nusing namespace v8;\nusing namespace std;\n\nHandle<ObjectTemplate> global_template;\nIsolate *isolate;\nclass Point;\n\nHandle<String> ReadFile(const char* name);\n\n\nclass Point\n{\npublic: \n Point(){x_ = 0; y_ = 0;}\n Point(int x, int y) : x_(x), y_(y) {}\n int x_, y_;\n\n inline void mul( const double scale )\n {\n x_ *= scale;\n y_ *= scale;\n }\n};\n\nPoint* UnwrapPoint( const FunctionCallbackInfo<v8::Value>& info ) \n{\n \/\/Get the self object,\n Local<v8::Object> self = info.Holder();\n \/\/Fetch the c++ pointer.\n Local<External> external = Local<External>::Cast( self->GetInternalField(0) );\n \/\/Get back to the type.\n Point* pt = static_cast<Point*>( external->Value());\n \/\/Return it\n return pt;\n}\n\nvoid GetPointX(Local<String> property,\n const PropertyCallbackInfo<Value>& info)\n{\n Local<Object> self = info.Holder();\n Local<External> wrap = Local<External>::Cast(self->GetInternalField(0));\n void* ptr = wrap->Value();\n int value = static_cast<Point*>(ptr)->x_;\n info.GetReturnValue().Set(Number::New(isolate, value));\n}\n\nvoid SetPointX(Local<String> property, \n Local<Value> value,\n const PropertyCallbackInfo<Value>& info)\n{\n Local<Object> self = info.Holder();\n Local<External> wrap = Local<External>::Cast(self->GetInternalField(0));\n void* ptr = wrap->Value();\n static_cast<Point*>(ptr)->x_ = value->Int32Value();\n}\n\nvoid GetPointY(Local<String> property,\n const PropertyCallbackInfo<Value>& info)\n{\n Local<Object> self = info.Holder();\n Local<External> wrap = Local<External>::Cast(self->GetInternalField(0));\n void* ptr = wrap->Value();\n int value = static_cast<Point*>(ptr)->y_;\n info.GetReturnValue().Set(Number::New(isolate, value));\n}\n\nvoid SetPointY(Local<String> property, \n Local<Value> value,\n const PropertyCallbackInfo<Value>& info)\n{\n Local<Object> self = info.Holder();\n Local<External> wrap = Local<External>::Cast(self->GetInternalField(0));\n void* ptr = wrap->Value();\n static_cast<Point*>(ptr)->y_ = value->Int32Value();\n}\n\nvoid MulCallback(const FunctionCallbackInfo<v8::Value>& args){\n int product = args.This()->Get(String::NewFromUtf8(isolate, \"x\"))->Int32Value() * args[0]->Int32Value();\n args.This()->Set(String::NewFromUtf8(isolate, \"x\"), Number::New(isolate, product));\n\n product = args.This()->Get(String::NewFromUtf8(isolate, \"y\"))->Int32Value() * args[0]->Int32Value();\n args.This()->Set(String::NewFromUtf8(isolate, \"y\"), Number::New(isolate, product));\n}\n\n\/\/ Defines a Point() JS Object\nvoid PointConstructor( const FunctionCallbackInfo<v8::Value>& args )\n{\n \/\/Locker lock;\n HandleScope scope(isolate);\n Handle<ObjectTemplate> t = v8::ObjectTemplate::New();\n\n \/\/The JavaScript point object only has 1 C++ object\n t->SetInternalFieldCount(1);\n\n \/\/ Create x and y members with starting values of 0\n \/\/t->Set(String::New(\"x\"), Number::New(0));\n t->SetAccessor(String::NewFromUtf8(isolate, \"x\"), \n (AccessorGetterCallback)GetPointX,\n (AccessorSetterCallback)SetPointX);\n\n \/\/t->Set(String::New(\"y\"), Number::New(0));\n t->SetAccessor(String::NewFromUtf8(isolate, \"y\"),\n (AccessorGetterCallback)GetPointY,\n (AccessorSetterCallback)SetPointY);\n\n \/\/ Create a mul(number) function that scales the point\n t->Set(String::NewFromUtf8(isolate, \"mul\"), FunctionTemplate::New(isolate, MulCallback));\n\n \/\/ for use in the if statement\n Point *p = NULL;\n Local<Object> obj;\n \n \/\/ If Point(x, y) ctor was passed in values assign them\n if(!args[0].IsEmpty() && args[0]->IsNumber() &&\n !args[1].IsEmpty() && args[1]->IsNumber()) {\n \/\/t->Set(String::New(\"x\"), args[0]);\n \/\/t->Set(String::New(\"y\"), args[1]);\n p = new Point(args[0]->Int32Value(), args[1]->Int32Value());\n obj = t->NewInstance();\n obj->SetInternalField(0, External::New(isolate, p)); \n } else {\n \/**\n * Wrap a point object\n *\/\n p = new Point(0, 0);\n obj = t->NewInstance();\n obj->SetInternalField(0, External::New(isolate, p));\n }\n\n \/\/ Return this newly created object\n args.GetReturnValue().Set(obj);\n}\n\n#define ANSI_COLOR_RED \"\\x1b[31m\"\n#define ANSI_COLOR_GREEN \"\\x1b[32m\"\n#define ANSI_COLOR_YELLOW \"\\x1b[33m\"\n#define ANSI_COLOR_BLUE \"\\x1b[34m\"\n#define ANSI_COLOR_MAGENTA \"\\x1b[35m\"\n#define ANSI_COLOR_CYAN \"\\x1b[36m\"\n#define ANSI_COLOR_RESET \"\\x1b[0m\"\nvoid Print(const v8::FunctionCallbackInfo<v8::Value>& args) {\n const char* color = nullptr;\n const char* resetColor = ANSI_COLOR_RESET;\n if (!args[0].IsEmpty() && args[0]->IsNumber()) {\n switch (args[0]->Int32Value()) {\n case 1:\n color = ANSI_COLOR_GREEN;\n break;\n case 2:\n color = ANSI_COLOR_YELLOW;\n break;\n case 3:\n color = ANSI_COLOR_RED;\n break;\n }\n }\n for (int i = 1; i < args.Length(); i++) {\n v8::HandleScope handle_scope(args.GetIsolate());\n v8::String::Utf8Value str(args[i]);\n string myStr = *(str);\n const char* cstr = myStr.c_str();\n if (color)\n printf(\"%s%s %s\", color, cstr, resetColor);\n else\n printf(\"%s %s\", cstr, resetColor);\n }\n printf(\"\\n\", NULL);\n}\n\nint main()\n{\n \/\/Create the v8 environment\n \/*Isolate**\/ isolate = Isolate::New();\n Isolate::Scope isolate_scope(isolate);\n HandleScope handle_scope(isolate);\n\n \/*Handle<ObjectTemplate>*\/ global_template = ObjectTemplate::New(isolate);\n\n Handle<FunctionTemplate> obj = FunctionTemplate::New(isolate);\n obj->Set(String::NewFromUtf8(isolate, \"Point\"), FunctionTemplate::New(isolate, PointConstructor));\n\n \/\/ Tell global A JS Obj Point() can now be create and instructions on how to set up\n global_template->Set(String::NewFromUtf8(isolate, \"Point\"), FunctionTemplate::New(isolate, PointConstructor));\n\n Local<Context> context = Context::New(isolate, NULL, global_template);\n\n Context::Scope context_scope(context);\n\n Handle<v8::Object> global = context->Global();\n\n \/\/global->Set(String::New(\"Point\"), t);\n global->Set(v8::String::NewFromUtf8(isolate, \"print\"), v8::FunctionTemplate::New(isolate, Print)->GetFunction());\n\n string file = \"foo.js\";\n\n while(true){\n cout << \"How many times do you want to run the script? \\n\" << endl;\n\n int n; \n\n cin >> n;\n\n cout << \"\" << endl;\n\n std::cin.get();\n\n Handle<String> source = ReadFile(file.c_str());\n\n if(source.IsEmpty())\n {\n cout << \"Error reading file\" << endl;\n cout << \"Press enter to quit\" << endl;\n cin.get();\n return 0;\n }\n\n \/\/Compile\n Handle<Script> script = Script::Compile(source);\n \n \/\/Run the script and print \n Handle<Value> result;\n\n result = script->Run();\n\n } \/\/ End of while\n\n \/\/Exit program\n cout << \"\\nTest completed. Press enter to exit program. \\n\" << endl;\n std::cin.get();\n \n return 0;\n}\n\nv8::Handle<String> ReadFile(const char* name)\n{\n \/\/Open the file\n FILE* file;\n file = fopen(name, \"rb\");\n\n \/\/If there is no file, return an empty string\n if (file == NULL) return v8::Handle<v8::String>();\n\n \/\/Set the pointer to the end of the file\n fseek(file, 0, SEEK_END);\n\n \/\/Get the size of file\n int size = ftell(file);\n\n \/\/Rewind the pointer to the beginning of the stream\n rewind(file);\n\n \/\/Set up and read into the buffer\n char* chars = new char[size + 1];\n chars[size] = '\\0';\n for (int i = 0 ; i < size;)\n {\n int read = static_cast<int>(fread(&chars[i], 1, size - i, file));\n i += read;\n }\n\n \/\/Close file\n fclose(file);\n\n v8::Handle<v8::String> result = v8::String::NewFromUtf8(isolate, chars, String::kNormalString, size);\n delete[] chars;\n return result;\n}\n<|endoftext|>"} {"text":"<commit_before>\/\/ easyblogger V 2.0\n\/\/ \n\/\/ Copyright 2011 Florian Weber <florian.weber@sfz-bw.de>\n\/\/ \n\/\/ This program is free software; you can redistribute it and\/or modify\n\/\/ it under the terms of the GNU Affero General Public License as published by\n\/\/ the Free Software Foundation; either version 3 of the License, or\n\/\/ (at your option) any later version.\n\/\/ \n\/\/ This program is distributed in the hope that it will be useful,\n\/\/ but WITHOUT ANY WARRANTY; without even the implied warranty of\n\/\/ MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the\n\/\/ GNU Affero General Public License for more details.\n\/\/ \n\/\/ You should have received a copy of the GNU Affero General Public License\n\/\/ along with this program; if not, write to the Free Software\n\/\/ Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston,\n\/\/ MA 02110-1301, USA.\n\/\/ \n\n#include <iostream>\n\n#include <string>\n#include <vector>\n\n#include \"settings.hpp\"\n#include \"help.hpp\"\n#include \"actions.hpp\"\n#include \"config.hpp\"\n\nusing namespace std;\n\nint main(int argc, char **argv){\n\t\/\/\/bring parameters into a reasonable form:\n\tvector<string> args;\n\targs.resize(argc);\n\tfor(int i=0;i<argc;++i){\n\t\targs[i]=(string(argv[i]));\n\t}\n\tsettings S;\n\tif(argc==1){\n\t\tprint_help();\n\t\treturn 0;\n\t}\n\telse if(argc==2){\n\t\tif(args[1]==\"-h\"||args[1]==\"--help\"){\n\t\t\tprint_help();\n\t\t\treturn 0;\n\t\t}\n\t\telse if(args[1]==\"--about\"){\n\t\t\tprint_info();\n\t\t\treturn 0;\n\t\t}\n\t\telse if(args[1]==\"--create\"||args[1]==\"-c\"){\n\t\t\tS=get_blog_by_name();\n\t\t\tcreate_all(S);\n\t\t}\n\t\telse if(args[1]==\"--list-entries\"||args[1]==\"-l\"){\n\t\t\tS=get_blog_by_name();\n\t\t\treturn list_entries(S);\n\t\t}\n\t\telse if(args[1]==\"--configure\"){\n\t\t\tS=get_blog_by_name();\n\t\t\treturn configure_blog(S);\n\t\t}\n\t\telse{\n\t\t\tprint_help();\n\t\t\treturn 1;\n\t\t}\n\t}\n\telse if(argc==3){\n\t\tif(args[2]==\"--create\"||args[2]==\"-c\"){\n\t\t\tS=get_blog_by_name(args[1]);\n\t\t\treturn create_all(S);\n\t\t}\n\t\telse if(args[1]==\"--import\"||args[1]==\"-i\"){\n\t\t\tS=get_blog_by_name();\n\t\t\treturn import(S,args[2]);\n\t\t}\n\t\telse if(args[1]==\"--edit\"||args[1]==\"-e\"){\n\t\t\tS=get_blog_by_name();\n\t\t\treturn edit(S,ID(args[2]));\n\t\t}\n\t\telse if(args[1]==\"--edit-comment\"||args[1]==\"-E\"){\n\t\t\tS=get_blog_by_name();\n\t\t\treturn edit_comment(S,ID(args[2]));\n\t\t}\n\t\telse if(args[2]==\"--configure\"){\n\t\t\tS=get_blog_by_name(args[1]);\n\t\t\treturn configure_blog(S,args[1]);\n\t\t}\n\t\telse if(args[2]==\"--list-entries\"||args[2]==\"-l\"){\n\t\t\tS=get_blog_by_name(args[1]);\n\t\t\treturn list_entries(S);\n\t\t}\n\t\telse{\n\t\t\tprint_help();\n\t\t\treturn 1;\n\t\t}\n\t}\n\telse if(argc==4){\n\t\tif(args[2]==\"--import\"||args[2]==\"-i\"){\n\t\t\tS=get_blog_by_name(args[1]);\n\t\t\treturn import(S,args[3]);\n\t\t}\n\t\telse if(args[2]==\"--edit\"||args[2]==\"-e\"){\n\t\t\tS=get_blog_by_name(args[1]);\n\t\t\treturn edit(S,ID(args[3]));\n\t\t}\n\t\telse if(args[2]==\"--edit-comment\"||args[2]==\"-E\"){\n\t\t\tS=get_blog_by_name(args[1]);\n\t\t\treturn edit_comment(S,ID(args[3]));\n\t\t}\n\t\telse if(args[1]==\"--comment\"){\n\t\t\tS=get_blog_by_name();\n\t\t\tcomment(S,ID(args[2]),args[3]);\n\t\t}\n\t\telse{\n\t\t\tprint_help();\n\t\t\treturn 1;\n\t\t}\n\t}\n\telse if(argc==5){\n\t\tif(args[2]==\"--comment\"){\n\t\t\tS=get_blog_by_name(args[1]);\n\t\t\tcomment(S,ID(args[3]),args[4]);\n\t\t}\n\t\telse{\n\t\t\tprint_help();\n\t\t\treturn 1;\n\t\t}\n\t}\n\telse{\n\t\tprint_help();\n\t\treturn 1;\n\t}\n\treturn 0;\n}\n<commit_msg>tiny change<commit_after>\/\/ easyblogger V 2.0\n\/\/ \n\/\/ Copyright 2011 Florian Weber <florian.weber@sfz-bw.de>\n\/\/ \n\/\/ This program is free software; you can redistribute it and\/or modify\n\/\/ it under the terms of the GNU Affero General Public License as published by\n\/\/ the Free Software Foundation; either version 3 of the License, or\n\/\/ (at your option) any later version.\n\/\/ \n\/\/ This program is distributed in the hope that it will be useful,\n\/\/ but WITHOUT ANY WARRANTY; without even the implied warranty of\n\/\/ MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the\n\/\/ GNU Affero General Public License for more details.\n\/\/ \n\/\/ You should have received a copy of the GNU Affero General Public License\n\/\/ along with this program; if not, write to the Free Software\n\/\/ Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston,\n\/\/ MA 02110-1301, USA.\n\/\/ \n\n#include <iostream>\n\n#include <string>\n#include <vector>\n\n#include \"settings.hpp\"\n#include \"help.hpp\"\n#include \"actions.hpp\"\n#include \"config.hpp\"\n\nusing namespace std;\n\nint main(int argc, char **argv){\n\t\/\/\/bring parameters into a reasonable form:\n\tvector<string> args(&argv[0],&argv[argc-1]);\n\tsettings S;\n\tif(argc==1){\n\t\tprint_help();\n\t\treturn 0;\n\t}\n\telse if(argc==2){\n\t\tif(args[1]==\"-h\"||args[1]==\"--help\"){\n\t\t\tprint_help();\n\t\t\treturn 0;\n\t\t}\n\t\telse if(args[1]==\"--about\"){\n\t\t\tprint_info();\n\t\t\treturn 0;\n\t\t}\n\t\telse if(args[1]==\"--create\"||args[1]==\"-c\"){\n\t\t\tS=get_blog_by_name();\n\t\t\tcreate_all(S);\n\t\t}\n\t\telse if(args[1]==\"--list-entries\"||args[1]==\"-l\"){\n\t\t\tS=get_blog_by_name();\n\t\t\treturn list_entries(S);\n\t\t}\n\t\telse if(args[1]==\"--configure\"){\n\t\t\tS=get_blog_by_name();\n\t\t\treturn configure_blog(S);\n\t\t}\n\t\telse{\n\t\t\tprint_help();\n\t\t\treturn 1;\n\t\t}\n\t}\n\telse if(argc==3){\n\t\tif(args[2]==\"--create\"||args[2]==\"-c\"){\n\t\t\tS=get_blog_by_name(args[1]);\n\t\t\treturn create_all(S);\n\t\t}\n\t\telse if(args[1]==\"--import\"||args[1]==\"-i\"){\n\t\t\tS=get_blog_by_name();\n\t\t\treturn import(S,args[2]);\n\t\t}\n\t\telse if(args[1]==\"--edit\"||args[1]==\"-e\"){\n\t\t\tS=get_blog_by_name();\n\t\t\treturn edit(S,ID(args[2]));\n\t\t}\n\t\telse if(args[1]==\"--edit-comment\"||args[1]==\"-E\"){\n\t\t\tS=get_blog_by_name();\n\t\t\treturn edit_comment(S,ID(args[2]));\n\t\t}\n\t\telse if(args[2]==\"--configure\"){\n\t\t\tS=get_blog_by_name(args[1]);\n\t\t\treturn configure_blog(S,args[1]);\n\t\t}\n\t\telse if(args[2]==\"--list-entries\"||args[2]==\"-l\"){\n\t\t\tS=get_blog_by_name(args[1]);\n\t\t\treturn list_entries(S);\n\t\t}\n\t\telse{\n\t\t\tprint_help();\n\t\t\treturn 1;\n\t\t}\n\t}\n\telse if(argc==4){\n\t\tif(args[2]==\"--import\"||args[2]==\"-i\"){\n\t\t\tS=get_blog_by_name(args[1]);\n\t\t\treturn import(S,args[3]);\n\t\t}\n\t\telse if(args[2]==\"--edit\"||args[2]==\"-e\"){\n\t\t\tS=get_blog_by_name(args[1]);\n\t\t\treturn edit(S,ID(args[3]));\n\t\t}\n\t\telse if(args[2]==\"--edit-comment\"||args[2]==\"-E\"){\n\t\t\tS=get_blog_by_name(args[1]);\n\t\t\treturn edit_comment(S,ID(args[3]));\n\t\t}\n\t\telse if(args[1]==\"--comment\"){\n\t\t\tS=get_blog_by_name();\n\t\t\tcomment(S,ID(args[2]),args[3]);\n\t\t}\n\t\telse{\n\t\t\tprint_help();\n\t\t\treturn 1;\n\t\t}\n\t}\n\telse if(argc==5){\n\t\tif(args[2]==\"--comment\"){\n\t\t\tS=get_blog_by_name(args[1]);\n\t\t\tcomment(S,ID(args[3]),args[4]);\n\t\t}\n\t\telse{\n\t\t\tprint_help();\n\t\t\treturn 1;\n\t\t}\n\t}\n\telse{\n\t\tprint_help();\n\t\treturn 1;\n\t}\n\treturn 0;\n}\n<|endoftext|>"} {"text":"<commit_before>#include \"rift\/bucket.hpp\"\n#include \"rift\/cache.hpp\"\n#include \"rift\/common.hpp\"\n#include \"rift\/index.hpp\"\n#include \"rift\/io.hpp\"\n#include \"rift\/server.hpp\"\n\nusing namespace ioremap;\n\nclass example_server : public thevoid::server<example_server>\n{\npublic:\n\tstruct signature_info {\n\t\tstd::string key;\n\t\tstd::string path;\n\t};\n\n\texample_server() : m_noauth_allowed(false) {\n\t}\n\n\t~example_server() {\n\t\tm_async.stop();\n\t\tm_cache.reset();\n\t}\n\n\tvirtual bool initialize(const rapidjson::Value &config) {\n\t\tdaemonize();\n\n\t\tif (!m_elliptics.initialize(config, logger()))\n\t\t\treturn false;\n\n\t\tm_async.initialize(logger());\n\n\t\tif (config.HasMember(\"noauth\")) {\n\t\t\tm_noauth_allowed = std::string(config[\"noauth\"].GetString()) == \"allowed\";\n\t\t}\n\n\t\tif (config.HasMember(\"cache\")) {\n\t\t\tm_cache = std::make_shared<rift::cache>();\n\t\t\tif (!m_cache->initialize(config[\"cache\"], m_elliptics.node(), logger(),\n\t\t\t\t\t\t&m_async, m_elliptics.metadata_groups()))\n\t\t\t\treturn false;\n\t\t}\n\n\t\tif (config.HasMember(\"bucket\")) {\n\t\t\tm_bucket = std::make_shared<rift::bucket>();\n\t\t\tif (!m_bucket->initialize(config[\"bucket\"], m_elliptics, &m_async))\n\t\t\t\treturn false;\n\t\t}\n\n\t\tif (config.HasMember(\"redirect\")) {\n\t\t\tm_redirect_read = config[\"redirect\"].GetBool();\n\t\t} else {\n\t\t\tm_redirect_read = false;\n\t\t}\n\n\t\tif (config.HasMember(\"redirect-port\")) {\n\t\t\tm_redirect_port = config[\"redirect-port\"].GetInt();\n\t\t} else {\n\t\t\tm_redirect_port = -1;\n\t\t}\n\n\t\tif (config.HasMember(\"https\")) {\n\t\t\tm_secured_http = config[\"https\"].GetBool();\n\t\t} else {\n\t\t\tm_secured_http = false;\n\t\t}\n\n\t\ton<rift::index::on_update<example_server>>(\n\t\t\toptions::exact_match(\"\/update\"),\n\t\t\toptions::methods(\"POST\")\n\t\t);\n\t\ton<rift::index::on_find<example_server>>(\n\t\t\toptions::exact_match(\"\/find\"),\n\t\t\toptions::methods(\"GET\")\n\t\t);\n\t\tif (m_redirect_read) {\n\t\t\ton<rift::io::on_redirectable_get<example_server>>(\n\t\t\t\toptions::exact_match(\"\/get\"),\n\t\t\t\toptions::methods(\"GET\")\n\t\t\t);\n\t\t} else {\n\t\t\ton<rift::io::on_get<example_server>>(\n\t\t\t\toptions::exact_match(\"\/get\"),\n\t\t\t\toptions::methods(\"GET\")\n\t\t\t);\n\t\t}\n\t\ton<rift::io::on_buffered_get<example_server>>(\n\t\t\toptions::exact_match(\"\/get-big\"),\n\t\t\toptions::methods(\"GET\")\n\t\t);\n\t\ton<rift::io::on_upload<example_server>>(\n\t\t\toptions::exact_match(\"\/upload\"),\n\t\t\toptions::methods(\"POST\")\n\t\t);\n\t\ton<rift::io::on_buffered_upload<example_server>>(\n\t\t\toptions::exact_match(\"\/upload-big\"),\n\t\t\toptions::methods(\"POST\")\n\t\t);\n\t\ton<rift::io::on_download_info<example_server>>(\n\t\t\toptions::exact_match(\"\/download-info\"),\n\t\t\toptions::methods(\"GET\")\n\t\t);\n\t\ton<rift::common::on_ping<example_server>>(\n\t\t\toptions::exact_match(\"\/ping\"),\n\t\t\toptions::methods(\"GET\")\n\t\t);\n\t\ton<rift::common::on_echo<example_server>>(\n\t\t\toptions::exact_match(\"\/echo\"),\n\t\t\toptions::methods(\"GET\")\n\t\t);\n\t\n\t\treturn true;\n\t}\n\n\tswarm::url generate_url_base(dnet_addr *addr) {\n\t\tchar buffer[128];\n\n\t\tswarm::url url;\n\t\turl.set_scheme(m_secured_http ? \"https\" : \"http\");\n\t\turl.set_host(dnet_server_convert_dnet_addr_raw(addr, buffer, sizeof(buffer)));\n\t\tif (m_redirect_port > 0) {\n\t\t\turl.set_port(m_redirect_port);\n\t\t}\n\n\t\treturn std::move(url);\n\t}\n\n\tconst rift::elliptics_base *elliptics() const {\n\t\treturn &m_elliptics;\n\t}\n\n\tvoid process(const swarm::http_request &request, const boost::asio::const_buffer &buffer,\n\t\t\tconst rift::continue_handler_t &continue_handler) const {\n\t\tauto ns = request.url().query().item_value(\"namespace\");\n\t\tif (!ns || !m_bucket) {\n\t\t\tauto verdict = swarm::http_response::bad_request;\n\t\t\tif (m_noauth_allowed || !m_bucket)\n\t\t\t\tverdict = swarm::http_response::ok;\n\n\t\t\trift::bucket_meta_raw meta;\n\t\t\tcontinue_handler(request, buffer, meta, verdict);\n\t\t} else {\n\t\t\tm_bucket->check(*ns, request, buffer, continue_handler);\n\t\t}\n\t}\n\n\tvoid check_cache(const elliptics::key &key, elliptics::session &sess) const {\n\t\tif (m_cache) {\n\t\t\tauto cache_groups = m_cache->groups(key);\n\t\t\tif (!cache_groups.empty()) {\n\t\t\t\tauto groups = sess.get_groups();\n\t\t\t\tgroups.insert(groups.end(), cache_groups.begin(), cache_groups.end());\n\t\t\t\tsess.set_groups(groups);\n\t\t\t}\n\t\t}\n\t}\n\n\tbool query_ok(const swarm::http_request &request) const {\n\t\tconst auto &query = request.url().query();\n\n\t\tif (auto name = query.item_value(\"name\")) {\n\t\t\treturn true;\n\t\t} else if (auto sid = query.item_value(\"id\")) {\n\t\t\treturn true;\n\t\t}\n\n\t\treturn false;\n\t}\n\n\telliptics::session extract_key(const swarm::http_request &request, const rift::bucket_meta_raw &meta,\n\t\t\telliptics::key &key) const {\n\t\tconst auto &query = request.url().query();\n\n\t\tif (auto name = query.item_value(\"name\")) {\n\t\t\tkey = *name;\n\t\t} else if (auto sid = query.item_value(\"id\")) {\n\t\t\tstruct dnet_id id;\n\t\t\tmemset(&id, 0, sizeof(struct dnet_id));\n\n\t\t\tdnet_parse_numeric_id(sid->c_str(), id.id);\n\n\t\t\tkey = id;\n\t\t}\n\n\t\telliptics::session session = m_elliptics.session();\n\t\tsession.set_namespace(meta.key.c_str(), meta.key.size());\n\t\tsession.set_groups(meta.groups);\n\t\tsession.transform(key);\n\n\t\treturn session;\n\t}\n\nprivate:\n\trift::async_performer m_async;\n\tbool m_redirect_read;\n\tint m_redirect_port;\n\tbool m_secured_http;\n\tstd::shared_ptr<rift::cache> m_cache;\n\tstd::shared_ptr<rift::bucket> m_bucket;\n\trift::elliptics_base m_elliptics;\n\tbool m_noauth_allowed;\n};\n\nint main(int argc, char **argv)\n{\n\treturn thevoid::run_server<example_server>(argc, argv);\n}\n<commit_msg>rift: only allow query by elliptics ID if 'noauth: allowed' is set and authentication is globally turned off<commit_after>#include \"rift\/bucket.hpp\"\n#include \"rift\/cache.hpp\"\n#include \"rift\/common.hpp\"\n#include \"rift\/index.hpp\"\n#include \"rift\/io.hpp\"\n#include \"rift\/server.hpp\"\n\nusing namespace ioremap;\n\nclass example_server : public thevoid::server<example_server>\n{\npublic:\n\tstruct signature_info {\n\t\tstd::string key;\n\t\tstd::string path;\n\t};\n\n\texample_server() : m_noauth_allowed(false) {\n\t}\n\n\t~example_server() {\n\t\tm_async.stop();\n\t\tm_cache.reset();\n\t}\n\n\tvirtual bool initialize(const rapidjson::Value &config) {\n\t\tdaemonize();\n\n\t\tif (!m_elliptics.initialize(config, logger()))\n\t\t\treturn false;\n\n\t\tm_async.initialize(logger());\n\n\t\tif (config.HasMember(\"noauth\")) {\n\t\t\tm_noauth_allowed = std::string(config[\"noauth\"].GetString()) == \"allowed\";\n\t\t}\n\n\t\tif (config.HasMember(\"cache\")) {\n\t\t\tm_cache = std::make_shared<rift::cache>();\n\t\t\tif (!m_cache->initialize(config[\"cache\"], m_elliptics.node(), logger(),\n\t\t\t\t\t\t&m_async, m_elliptics.metadata_groups()))\n\t\t\t\treturn false;\n\t\t}\n\n\t\tif (config.HasMember(\"bucket\")) {\n\t\t\tm_bucket = std::make_shared<rift::bucket>();\n\t\t\tif (!m_bucket->initialize(config[\"bucket\"], m_elliptics, &m_async))\n\t\t\t\treturn false;\n\t\t}\n\n\t\tif (config.HasMember(\"redirect\")) {\n\t\t\tm_redirect_read = config[\"redirect\"].GetBool();\n\t\t} else {\n\t\t\tm_redirect_read = false;\n\t\t}\n\n\t\tif (config.HasMember(\"redirect-port\")) {\n\t\t\tm_redirect_port = config[\"redirect-port\"].GetInt();\n\t\t} else {\n\t\t\tm_redirect_port = -1;\n\t\t}\n\n\t\tif (config.HasMember(\"https\")) {\n\t\t\tm_secured_http = config[\"https\"].GetBool();\n\t\t} else {\n\t\t\tm_secured_http = false;\n\t\t}\n\n\t\ton<rift::index::on_update<example_server>>(\n\t\t\toptions::exact_match(\"\/update\"),\n\t\t\toptions::methods(\"POST\")\n\t\t);\n\t\ton<rift::index::on_find<example_server>>(\n\t\t\toptions::exact_match(\"\/find\"),\n\t\t\toptions::methods(\"GET\")\n\t\t);\n\t\tif (m_redirect_read) {\n\t\t\ton<rift::io::on_redirectable_get<example_server>>(\n\t\t\t\toptions::exact_match(\"\/get\"),\n\t\t\t\toptions::methods(\"GET\")\n\t\t\t);\n\t\t} else {\n\t\t\ton<rift::io::on_get<example_server>>(\n\t\t\t\toptions::exact_match(\"\/get\"),\n\t\t\t\toptions::methods(\"GET\")\n\t\t\t);\n\t\t}\n\t\ton<rift::io::on_buffered_get<example_server>>(\n\t\t\toptions::exact_match(\"\/get-big\"),\n\t\t\toptions::methods(\"GET\")\n\t\t);\n\t\ton<rift::io::on_upload<example_server>>(\n\t\t\toptions::exact_match(\"\/upload\"),\n\t\t\toptions::methods(\"POST\")\n\t\t);\n\t\ton<rift::io::on_buffered_upload<example_server>>(\n\t\t\toptions::exact_match(\"\/upload-big\"),\n\t\t\toptions::methods(\"POST\")\n\t\t);\n\t\ton<rift::io::on_download_info<example_server>>(\n\t\t\toptions::exact_match(\"\/download-info\"),\n\t\t\toptions::methods(\"GET\")\n\t\t);\n\t\ton<rift::common::on_ping<example_server>>(\n\t\t\toptions::exact_match(\"\/ping\"),\n\t\t\toptions::methods(\"GET\")\n\t\t);\n\t\ton<rift::common::on_echo<example_server>>(\n\t\t\toptions::exact_match(\"\/echo\"),\n\t\t\toptions::methods(\"GET\")\n\t\t);\n\t\n\t\treturn true;\n\t}\n\n\tswarm::url generate_url_base(dnet_addr *addr) {\n\t\tchar buffer[128];\n\n\t\tswarm::url url;\n\t\turl.set_scheme(m_secured_http ? \"https\" : \"http\");\n\t\turl.set_host(dnet_server_convert_dnet_addr_raw(addr, buffer, sizeof(buffer)));\n\t\tif (m_redirect_port > 0) {\n\t\t\turl.set_port(m_redirect_port);\n\t\t}\n\n\t\treturn std::move(url);\n\t}\n\n\tconst rift::elliptics_base *elliptics() const {\n\t\treturn &m_elliptics;\n\t}\n\n\tvoid process(const swarm::http_request &request, const boost::asio::const_buffer &buffer,\n\t\t\tconst rift::continue_handler_t &continue_handler) const {\n\t\tauto ns = request.url().query().item_value(\"namespace\");\n\t\tif (!ns || !m_bucket) {\n\t\t\tauto verdict = swarm::http_response::bad_request;\n\t\t\tif (m_noauth_allowed || !m_bucket)\n\t\t\t\tverdict = swarm::http_response::ok;\n\n\t\t\trift::bucket_meta_raw meta;\n\t\t\tcontinue_handler(request, buffer, meta, verdict);\n\t\t} else {\n\t\t\tm_bucket->check(*ns, request, buffer, continue_handler);\n\t\t}\n\t}\n\n\tvoid check_cache(const elliptics::key &key, elliptics::session &sess) const {\n\t\tif (m_cache) {\n\t\t\tauto cache_groups = m_cache->groups(key);\n\t\t\tif (!cache_groups.empty()) {\n\t\t\t\tauto groups = sess.get_groups();\n\t\t\t\tgroups.insert(groups.end(), cache_groups.begin(), cache_groups.end());\n\t\t\t\tsess.set_groups(groups);\n\t\t\t}\n\t\t}\n\t}\n\n\tbool query_ok(const swarm::http_request &request) const {\n\t\tconst auto &query = request.url().query();\n\n\t\tif (auto name = query.item_value(\"name\")) {\n\t\t\treturn true;\n\t\t} else if (auto sid = query.item_value(\"id\")) {\n\t\t\tif (m_noauth_allowed)\n\t\t\t\treturn true;\n\t\t}\n\n\t\treturn false;\n\t}\n\n\telliptics::session extract_key(const swarm::http_request &request, const rift::bucket_meta_raw &meta,\n\t\t\telliptics::key &key) const {\n\t\tconst auto &query = request.url().query();\n\n\t\tif (auto name = query.item_value(\"name\")) {\n\t\t\tkey = *name;\n\t\t} else if (auto sid = query.item_value(\"id\")) {\n\t\t\tstruct dnet_id id;\n\t\t\tmemset(&id, 0, sizeof(struct dnet_id));\n\n\t\t\tdnet_parse_numeric_id(sid->c_str(), id.id);\n\n\t\t\tkey = id;\n\t\t}\n\n\t\telliptics::session session = m_elliptics.session();\n\t\tsession.set_namespace(meta.key.c_str(), meta.key.size());\n\t\tsession.set_groups(meta.groups);\n\t\tsession.transform(key);\n\n\t\treturn session;\n\t}\n\nprivate:\n\trift::async_performer m_async;\n\tbool m_redirect_read;\n\tint m_redirect_port;\n\tbool m_secured_http;\n\tstd::shared_ptr<rift::cache> m_cache;\n\tstd::shared_ptr<rift::bucket> m_bucket;\n\trift::elliptics_base m_elliptics;\n\tbool m_noauth_allowed;\n};\n\nint main(int argc, char **argv)\n{\n\treturn thevoid::run_server<example_server>(argc, argv);\n}\n<|endoftext|>"} {"text":"<commit_before>#include <iostream>\n#include <vector>\n#include <map>\n#include <memory>\n#include <fstream>\n#include <iomanip>\n#include <boost\/filesystem.hpp>\n#include <memory.h>\n\nextern \"C\" {\n#include <libircclient.h>\n}\n\nstruct DCCFile\n{\n irc_dcc_t id;\n std::string filename;\n unsigned long size;\n unsigned long received;\n std::ofstream stream;\n\n DCCFile(irc_dcc_t id, const char *filename, unsigned long size) \n : id(id),\n filename(filename),\n size(size),\n received(0)\n { stream.open(filename, std::fstream::binary); }\n};\n\ntypedef std::shared_ptr<DCCFile> DCCFilePtr;\n\nstruct IRCContext\n{\n std::vector<std::string> channels;\n std::string nick;\n std::map<irc_dcc_t, DCCFilePtr> files;\n};\n\nvoid event_connect(irc_session_t* session, const char* event, const char* origin, const char** params, unsigned int count)\n{\n IRCContext* ctx = (IRCContext*) irc_get_ctx(session);\n\n for (auto &c : ctx->channels)\n {\n irc_cmd_join (session, c.c_str(), 0);\n }\n}\n\nvoid event_channel(irc_session_t* session, const char* event, const char* origin, const char** params, unsigned int count)\n{\n char nickbuf[128];\n\n if ( count != 2 )\n return;\n\n std::cout << origin << \"@\" << params[0] << \": \" << params[1] << std::endl;\n\n if ( !origin )\n return;\n}\n\nvoid dcc_file_recv_callback (irc_session_t* session, irc_dcc_t id, int status, void* fp, const char* data, unsigned int length)\n{\n IRCContext* ctx = (IRCContext*) irc_get_ctx(session);\n DCCFilePtr fileptr = ctx->files[id];\n\n if (status == 0 && length == 0)\n {\n std::cout << \"File \" << fileptr->filename << \" received successfully!\" << std::endl;\n fileptr->stream.close();\n ctx->files.erase(id);\n }\n else if (status)\n {\n std::cout << \"Error receiving file '\" << fileptr->filename << \"': \" << status << std::endl;\n fileptr->stream.close();\n ctx->files.erase(id);\n }\n else\n {\n fileptr->received += length;\n float percent = ((float)fileptr->received \/ (float)fileptr->size) * 100.0f;\n\n std::cout << \"File '\" << fileptr->filename << \"': \"\n << std::setprecision(4) << percent << \"%\"\n << \" (\" << fileptr->received << \"\/\" << fileptr->size << \")\" << std::endl;\n\n fileptr->stream.write(data, length);\n }\n}\n\nvoid event_dcc_send_req(irc_session_t* session, const char* nick, const char* addr, const char* filename, unsigned long size, irc_dcc_t dccid)\n{\n IRCContext* ctx = (IRCContext*) irc_get_ctx(session);\n boost::filesystem::path p(filename);\n DCCFilePtr fileptr = std::make_shared<DCCFile>(dccid, filename, size);\n\n ctx->files[dccid] = fileptr;\n\n std::cout << \"Receiving file \" << filename << \", size: \" << size << std::endl;\n\n irc_dcc_accept(session, dccid, nullptr, dcc_file_recv_callback);\n}\n\nint main(int argc, char **argv)\n{\n irc_callbacks_t callbacks;\n IRCContext ctx;\n irc_session_t * s;\n unsigned short port = 6667;\n\n if ( argc < 4 )\n {\n printf (\"Usage: %s <server> <nick> <channel>\\n\", argv[0]);\n return 1;\n }\n\n memset (&callbacks, 0, sizeof(callbacks));\n\n callbacks.event_connect = event_connect;\n callbacks.event_channel = event_channel;\n \/\/callbacks.event_privmsg = event_privmsg;\n\n callbacks.event_dcc_send_req = event_dcc_send_req;\n\n s = irc_create_session (&callbacks);\n\n if ( !s )\n {\n printf (\"Could not create session\\n\");\n return 1;\n }\n\n ctx.nick = argv[2];\n unsigned int channel = 3;\n\n while (channel < argc)\n {\n ctx.channels.push_back(argv[channel]);\n channel++;\n }\n\n irc_set_ctx (s, &ctx);\n\n \/\/ If the port number is specified in the server string, use the port 0 so it gets parsed\n if ( strchr( argv[1], ':' ) != 0 )\n port = 0;\n\n \/\/ To handle the \"SSL certificate verify failed\" from command line we allow passing ## in front \n \/\/ of the server name, and in this case tell libircclient not to verify the cert\n if ( argv[1][0] == '#' && argv[1][1] == '#' )\n {\n \/\/ Skip the first character as libircclient needs only one # for SSL support, i.e. #irc.freenode.net\n argv[1]++;\n \n irc_option_set( s, LIBIRC_OPTION_SSL_NO_VERIFY );\n }\n \n \/\/ Initiate the IRC server connection\n if ( irc_connect (s, argv[1], port, 0, argv[2], 0, 0) )\n {\n printf (\"Could not connect: %s\\n\", irc_strerror (irc_errno(s)));\n return 1;\n }\n\n \/\/ and run into forever loop, generating events\n if ( irc_run (s) )\n {\n printf (\"Could not connect or I\/O error: %s\\n\", irc_strerror (irc_errno(s)));\n return 1;\n }\n\n return 1;\n}\n<commit_msg>Download files to subdirectory, only print status every 5%<commit_after>#include <iostream>\n#include <vector>\n#include <map>\n#include <memory>\n#include <fstream>\n#include <iomanip>\n#include <boost\/filesystem.hpp>\n#include <memory.h>\n\nextern \"C\" {\n#include <libircclient.h>\n}\n\nstruct DCCFile\n{\n irc_dcc_t id;\n std::string filename;\n unsigned long size;\n unsigned long received;\n std::ofstream stream;\n float old_percent;\n\n DCCFile(irc_dcc_t id, const char *filename, unsigned long size) \n : id(id),\n filename(filename),\n size(size),\n received(0),\n old_percent(0.0f)\n {\n boost::filesystem::path p(\"downloads\");\n p \/= filename;\n stream.open(p.string(), std::fstream::binary);\n }\n};\n\ntypedef std::shared_ptr<DCCFile> DCCFilePtr;\n\nstruct IRCContext\n{\n std::vector<std::string> channels;\n std::string nick;\n std::map<irc_dcc_t, DCCFilePtr> files;\n};\n\nvoid event_connect(irc_session_t* session, const char* event, const char* origin, const char** params, unsigned int count)\n{\n IRCContext* ctx = (IRCContext*) irc_get_ctx(session);\n\n for (auto &c : ctx->channels)\n {\n irc_cmd_join (session, c.c_str(), 0);\n }\n}\n\nvoid event_channel(irc_session_t* session, const char* event, const char* origin, const char** params, unsigned int count)\n{\n char nickbuf[128];\n\n if ( count != 2 )\n return;\n\n std::cout << origin << \"@\" << params[0] << \": \" << params[1] << std::endl;\n\n if ( !origin )\n return;\n}\n\nvoid dcc_file_recv_callback (irc_session_t* session, irc_dcc_t id, int status, void* fp, const char* data, unsigned int length)\n{\n IRCContext* ctx = (IRCContext*) irc_get_ctx(session);\n DCCFilePtr fileptr = ctx->files[id];\n\n if (status == 0 && length == 0)\n {\n std::cout << \"File \" << fileptr->filename << \" received successfully!\" << std::endl;\n fileptr->stream.close();\n ctx->files.erase(id);\n }\n else if (status)\n {\n std::cout << \"Error receiving file '\" << fileptr->filename << \"': \" << status << std::endl;\n fileptr->stream.close();\n ctx->files.erase(id);\n }\n else\n {\n fileptr->received += length;\n float percent = ((float)fileptr->received \/ (float)fileptr->size) * 100.0f;\n\n if (percent - fileptr->old_percent > 5.0f)\n {\n std::cout << \"File '\" << fileptr->filename << \"': \"\n << std::setprecision(4) << percent << \"%\"\n << \" (\" << fileptr->received << \"\/\" << fileptr->size << \")\" << std::endl;\n\n fileptr->old_percent = percent;\n }\n\n fileptr->stream.write(data, length);\n }\n}\n\nvoid event_dcc_send_req(irc_session_t* session, const char* nick, const char* addr, const char* filename, unsigned long size, irc_dcc_t dccid)\n{\n IRCContext* ctx = (IRCContext*) irc_get_ctx(session);\n DCCFilePtr fileptr = std::make_shared<DCCFile>(dccid, filename, size);\n\n ctx->files[dccid] = fileptr;\n\n std::cout << \"Receiving file \" << filename << \", size: \" << size << std::endl;\n\n irc_dcc_accept(session, dccid, nullptr, dcc_file_recv_callback);\n}\n\nint main(int argc, char **argv)\n{\n irc_callbacks_t callbacks;\n IRCContext ctx;\n irc_session_t * s;\n unsigned short port = 6667;\n\n if ( argc < 4 )\n {\n printf (\"Usage: %s <server> <nick> <channel>\\n\", argv[0]);\n return 1;\n }\n\n memset (&callbacks, 0, sizeof(callbacks));\n\n callbacks.event_connect = event_connect;\n callbacks.event_channel = event_channel;\n \/\/callbacks.event_privmsg = event_privmsg;\n\n callbacks.event_dcc_send_req = event_dcc_send_req;\n\n s = irc_create_session (&callbacks);\n\n if ( !s )\n {\n printf (\"Could not create session\\n\");\n return 1;\n }\n\n ctx.nick = argv[2];\n\n unsigned int channel = 3;\n\n while (channel < argc)\n {\n ctx.channels.push_back(argv[channel]);\n channel++;\n }\n\n irc_set_ctx (s, &ctx);\n\n \/\/ If the port number is specified in the server string, use the port 0 so it gets parsed\n if ( strchr( argv[1], ':' ) != 0 )\n port = 0;\n\n \/\/ To handle the \"SSL certificate verify failed\" from command line we allow passing ## in front \n \/\/ of the server name, and in this case tell libircclient not to verify the cert\n if ( argv[1][0] == '#' && argv[1][1] == '#' )\n {\n \/\/ Skip the first character as libircclient needs only one # for SSL support, i.e. #irc.freenode.net\n argv[1]++;\n \n irc_option_set( s, LIBIRC_OPTION_SSL_NO_VERIFY );\n }\n \n \/\/ Initiate the IRC server connection\n if ( irc_connect (s, argv[1], port, 0, argv[2], 0, 0) )\n {\n printf (\"Could not connect: %s\\n\", irc_strerror (irc_errno(s)));\n return 1;\n }\n\n \/\/ and run into forever loop, generating events\n if ( irc_run (s) )\n {\n printf (\"Could not connect or I\/O error: %s\\n\", irc_strerror (irc_errno(s)));\n return 1;\n }\n\n return 1;\n}\n<|endoftext|>"} {"text":"<commit_before>#include \"GarrysMod\/Lua\/Interface.h\"\n\n#include \"interface.h\"\n#include \"vgui\/VGUI.h\"\n\n#include \"IGameConsole.h\"\n#include \"CGameConsoleDialog.h\"\n\nusing namespace GarrysMod;\n\nIGameConsole *g_GameConsole = NULL;\nCGameConsoleDialog *g_GameConsoleDialog = NULL;\n\nint console_Activate(lua_State *state) {\n\tg_GameConsole->Activate();\n\n\treturn 0;\n}\n\nint console_Initialize(lua_State *state) {\n\tg_GameConsole->Initialize();\n\n\treturn 0;\n}\n\nint console_Hide(lua_State *state) {\n\tg_GameConsole->Hide();\n\n\treturn 0;\n}\n\nint console_Clear(lua_State *state) {\n\tg_GameConsole->Clear();\n\n\treturn 0;\n}\n\nint console_IsConsoleVisible(lua_State *state) {\n\tLUA->PushBool(g_GameConsole->IsConsoleVisible());\n\n\treturn 1;\n}\n\nint console_Get(lua_State *state) {\n\tLua::UserData *ud = (Lua::UserData *)LUA->NewUserdata(sizeof(Lua::UserData));\n\t\/\/ ud->data = *(((void **)g_GameConsole) + 2);\n\tud->data = g_GameConsoleDialog;\n\tud->type = 420;\n\n\tLUA->CreateMetaTableType(\"Console\", 420);\n\n\tLUA->SetMetaTable(-2);\n\n\treturn 1;\n}\n\nint CONSOLE_SetParent(lua_State *state) {\n\tLUA->CheckType(1, Lua::Type::PANEL);\n\n\tvgui::Panel *pPanel = *(vgui::Panel **)LUA->GetUserdata(1);\n\n\tg_GameConsoleDialog->SetParent(pPanel*);\n\n\treturn 0;\n}\n\nGMOD_MODULE_OPEN() {\n\tCreateInterfaceFn GameUIFactory = Sys_GetFactory(\"gameui.dll\");\n\tg_GameConsole = (IGameConsole*)GameUIFactory(GAMECONSOLE_INTERFACE_VERSION, NULL);\n\n\tif (g_GameConsole == NULL) {\n\t\tLUA->ThrowError(\"gm_console: Error getting IGameConsole interface.\");\n\n\t\treturn 0;\n\t}\n\n\tg_GameConsoleDialog = *((CGameConsoleDialog **)(g_GameConsole) + 2);\n\n\tLUA->PushSpecial(Lua::SPECIAL_GLOB);\n\t\tLUA->CreateTable();\n\t\t\tLUA->PushCFunction(console_Activate);\n\t\t\tLUA->SetField(-2, \"Activate\");\n\n\t\t\tLUA->PushCFunction(console_Initialize);\n\t\t\tLUA->SetField(-2, \"Initialize\");\n\n\t\t\tLUA->PushCFunction(console_Hide);\n\t\t\tLUA->SetField(-2, \"Hide\");\n\n\t\t\tLUA->PushCFunction(console_Clear);\n\t\t\tLUA->SetField(-2, \"Clear\");\n\n\t\t\tLUA->PushCFunction(console_IsConsoleVisible);\n\t\t\tLUA->SetField(-2, \"IsConsoleVisible\");\n\n\t\t\tLUA->PushCFunction(console_Get);\n\t\t\tLUA->SetField(-2, \"Get\");\n\t\tLUA->SetField(-2, \"console\");\n\tLUA->Pop();\n\n\tLUA->CreateMetaTableType(\"Console\", 420);\n\t\tLUA->CreateTable();\n\t\t\tLUA->PushCFunction(CONSOLE_SetParent);\n\t\t\tLUA->SetField(-2, \"SetParent\");\n\t\tLUA->SetField(-2, \"__index\");\n\tLUA->Pop();\n\n\treturn 0;\n}\n<commit_msg>linux gameui lib<commit_after>#ifdef _LINUX\n\t#define GAMEUI_LIB \"GameUI.so\"\n#else\n\t#define GAMEUI_LIB \"GameUI.dll\"\n#endif\n\n#include \"GarrysMod\/Lua\/Interface.h\"\n\n#include \"interface.h\"\n#include \"vgui\/VGUI.h\"\n\n#include \"IGameConsole.h\"\n#include \"CGameConsoleDialog.h\"\n\nusing namespace GarrysMod;\n\nIGameConsole *g_GameConsole = NULL;\nCGameConsoleDialog *g_GameConsoleDialog = NULL;\n\nint console_Activate(lua_State *state) {\n\tg_GameConsole->Activate();\n\n\treturn 0;\n}\n\nint console_Initialize(lua_State *state) {\n\tg_GameConsole->Initialize();\n\n\treturn 0;\n}\n\nint console_Hide(lua_State *state) {\n\tg_GameConsole->Hide();\n\n\treturn 0;\n}\n\nint console_Clear(lua_State *state) {\n\tg_GameConsole->Clear();\n\n\treturn 0;\n}\n\nint console_IsConsoleVisible(lua_State *state) {\n\tLUA->PushBool(g_GameConsole->IsConsoleVisible());\n\n\treturn 1;\n}\n\nint console_Get(lua_State *state) {\n\tLua::UserData *ud = (Lua::UserData *)LUA->NewUserdata(sizeof(Lua::UserData));\n\t\/\/ ud->data = *(((void **)g_GameConsole) + 2);\n\tud->data = g_GameConsoleDialog;\n\tud->type = 420;\n\n\tLUA->CreateMetaTableType(\"Console\", 420);\n\n\tLUA->SetMetaTable(-2);\n\n\treturn 1;\n}\n\nint CONSOLE_SetParent(lua_State *state) {\n\tLUA->CheckType(1, Lua::Type::PANEL);\n\n\tvgui::Panel *pPanel = *(vgui::Panel **)LUA->GetUserdata(1);\n\n\tg_GameConsoleDialog->SetParent(pPanel*);\n\n\treturn 0;\n}\n\nGMOD_MODULE_OPEN() {\n\tCreateInterfaceFn GameUIFactory = Sys_GetFactory(GAMEUI_LIB);\n\tg_GameConsole = (IGameConsole*)GameUIFactory(GAMECONSOLE_INTERFACE_VERSION, NULL);\n\n\tif (g_GameConsole == NULL) {\n\t\tLUA->ThrowError(\"gm_console: Error getting IGameConsole interface.\");\n\n\t\treturn 0;\n\t}\n\n\tg_GameConsoleDialog = *((CGameConsoleDialog **)(g_GameConsole) + 2);\n\n\tLUA->PushSpecial(Lua::SPECIAL_GLOB);\n\t\tLUA->CreateTable();\n\t\t\tLUA->PushCFunction(console_Activate);\n\t\t\tLUA->SetField(-2, \"Activate\");\n\n\t\t\tLUA->PushCFunction(console_Initialize);\n\t\t\tLUA->SetField(-2, \"Initialize\");\n\n\t\t\tLUA->PushCFunction(console_Hide);\n\t\t\tLUA->SetField(-2, \"Hide\");\n\n\t\t\tLUA->PushCFunction(console_Clear);\n\t\t\tLUA->SetField(-2, \"Clear\");\n\n\t\t\tLUA->PushCFunction(console_IsConsoleVisible);\n\t\t\tLUA->SetField(-2, \"IsConsoleVisible\");\n\n\t\t\tLUA->PushCFunction(console_Get);\n\t\t\tLUA->SetField(-2, \"Get\");\n\t\tLUA->SetField(-2, \"console\");\n\tLUA->Pop();\n\n\tLUA->CreateMetaTableType(\"Console\", 420);\n\t\tLUA->CreateTable();\n\t\t\tLUA->PushCFunction(CONSOLE_SetParent);\n\t\t\tLUA->SetField(-2, \"SetParent\");\n\t\tLUA->SetField(-2, \"__index\");\n\tLUA->Pop();\n\n\treturn 0;\n}\n<|endoftext|>"} {"text":"<commit_before>#include <iostream>\n#include <vector>\n#include <list>\n#include <stdio.h>\n#include <stdlib.h>\n#include <unistd.h>\n#include <sys\/types.h>\n#include <sys\/wait.h>\n#include <string.h>\n#include <netdb.h>\n#include <pwd.h>\n#include <sys\/socket.h>\n#include <boost\/algorithm\/string.hpp>\n\nusing namespace std;\nusing namespace boost::algorithm;\n\nint main () {\n\n return 0;\n}\n<commit_msg>Added Base class <commit_after>#include <iostream>\n#include <vector>\n#include <list>\n#include <stdio.h>\n#include <stdlib.h>\n#include <unistd.h>\n#include <sys\/types.h>\n#include <sys\/wait.h>\n#include <string.h>\n#include <netdb.h>\n#include <pwd.h>\n#include <sys\/socket.h>\n#include <boost\/algorithm\/string.hpp>\n\nusing namespace std;\nusing namespace boost::algorithm;\n\nclass Base{\npublic:\n Base(){};\n virtual bool evaluate() =0;\n\n\n}\n\nint main () {\n\n return 0;\n}\n<|endoftext|>"} {"text":"<commit_before>#include <dirent.h>\n#include <unistd.h>\n#include \"cartridge.hpp\"\n#include \"menu.hpp\"\n\nnamespace GUI {\n\nusing namespace std;\n\n\nEntry::Entry(string label, function<void()> callback, int x, int y) : callback(callback), x(x), y(y)\n{\n setLabel(label);\n}\n\nEntry::~Entry()\n{\n SDL_DestroyTexture(whiteTexture);\n SDL_DestroyTexture(redTexture);\n}\n\nvoid Entry::setLabel(string label)\n{\n this->label = label;\n\n if (whiteTexture != nullptr) SDL_DestroyTexture(whiteTexture);\n if (redTexture != nullptr) SDL_DestroyTexture(redTexture);\n\n whiteTexture = gen_text(label, { 255, 255, 255 });\n redTexture = gen_text(label, { 255, 0, 0 });\n}\n\nvoid Entry::render()\n{\n render_texture(selected ? redTexture : whiteTexture, getX(), getY());\n}\n\n\nControlEntry::ControlEntry(string action, SDL_Scancode* key, int x, int y) : key(key),\n Entry::Entry(\n action,\n [&]{ keyEntry->setLabel(SDL_GetScancodeName(*(this->key) = query_key())); },\n x,\n y)\n{\n this->keyEntry = new Entry(SDL_GetScancodeName(*key), []{}, TEXT_RIGHT, y);\n}\n\nControlEntry::ControlEntry(string action, int* button, int x, int y) : button(button),\n Entry::Entry(\n action,\n [&]{ keyEntry->setLabel(to_string(*(this->button) = query_button())); },\n x,\n y)\n{\n this->keyEntry = new Entry(to_string(*button), []{}, TEXT_RIGHT, y);\n}\n\n\nvoid Menu::add(Entry* entry)\n{\n if (entries.empty())\n entry->select();\n entry->setY(entries.size() * FONT_SZ);\n entries.push_back(entry);\n}\n\nvoid Menu::clear()\n{\n for (auto entry : entries)\n delete entry;\n entries.clear();\n cursor = 0;\n}\n\nvoid Menu::update(u8 const* keys)\n{\n int oldCursor = cursor;\n\n if (keys[SDL_SCANCODE_DOWN] and cursor < entries.size() - 1)\n cursor++;\n else if (keys[SDL_SCANCODE_UP] and cursor > 0)\n cursor--;\n\n entries[oldCursor]->unselect();\n entries[cursor]->select();\n\n if (keys[SDL_SCANCODE_RETURN])\n entries[cursor]->trigger();\n}\n\nvoid Menu::render()\n{\n for (auto entry : entries)\n entry->render();\n}\n\n\nvoid FileMenu::change_dir(string dir)\n{\n clear();\n\n struct dirent* dirp;\n DIR* dp = opendir(dir.c_str());\n\n while ((dirp = readdir(dp)) != NULL)\n {\n string name = dirp->d_name;\n string path = dir + \"\/\" + name;\n\n if (name[0] == '.' and name != \"..\") continue;\n\n if (dirp->d_type == DT_DIR)\n {\n add(new Entry(name + \"\/\",\n [=]{ change_dir(path); },\n 0));\n }\n else if (name.size() > 4 and name.substr(name.size() - 4) == \".nes\")\n {\n add(new Entry(name,\n [=]{ Cartridge::load(path.c_str()); toggle_pause(); },\n 0));\n }\n }\n closedir(dp);\n}\n\nFileMenu::FileMenu()\n{\n change_dir(getwd(NULL));\n}\n\n\n}\n<commit_msg>Fixed Linux.<commit_after>#include <dirent.h>\n#include <unistd.h>\n#include \"cartridge.hpp\"\n#include \"menu.hpp\"\n\nnamespace GUI {\n\nusing namespace std;\n\n\nEntry::Entry(string label, function<void()> callback, int x, int y) : callback(callback), x(x), y(y)\n{\n setLabel(label);\n}\n\nEntry::~Entry()\n{\n SDL_DestroyTexture(whiteTexture);\n SDL_DestroyTexture(redTexture);\n}\n\nvoid Entry::setLabel(string label)\n{\n this->label = label;\n\n if (whiteTexture != nullptr) SDL_DestroyTexture(whiteTexture);\n if (redTexture != nullptr) SDL_DestroyTexture(redTexture);\n\n whiteTexture = gen_text(label, { 255, 255, 255 });\n redTexture = gen_text(label, { 255, 0, 0 });\n}\n\nvoid Entry::render()\n{\n render_texture(selected ? redTexture : whiteTexture, getX(), getY());\n}\n\n\nControlEntry::ControlEntry(string action, SDL_Scancode* key, int x, int y) : key(key),\n Entry::Entry(\n action,\n [&]{ keyEntry->setLabel(SDL_GetScancodeName(*(this->key) = query_key())); },\n x,\n y)\n{\n this->keyEntry = new Entry(SDL_GetScancodeName(*key), []{}, TEXT_RIGHT, y);\n}\n\nControlEntry::ControlEntry(string action, int* button, int x, int y) : button(button),\n Entry::Entry(\n action,\n [&]{ keyEntry->setLabel(to_string(*(this->button) = query_button())); },\n x,\n y)\n{\n this->keyEntry = new Entry(to_string(*button), []{}, TEXT_RIGHT, y);\n}\n\n\nvoid Menu::add(Entry* entry)\n{\n if (entries.empty())\n entry->select();\n entry->setY(entries.size() * FONT_SZ);\n entries.push_back(entry);\n}\n\nvoid Menu::clear()\n{\n for (auto entry : entries)\n delete entry;\n entries.clear();\n cursor = 0;\n}\n\nvoid Menu::update(u8 const* keys)\n{\n int oldCursor = cursor;\n\n if (keys[SDL_SCANCODE_DOWN] and cursor < entries.size() - 1)\n cursor++;\n else if (keys[SDL_SCANCODE_UP] and cursor > 0)\n cursor--;\n\n entries[oldCursor]->unselect();\n entries[cursor]->select();\n\n if (keys[SDL_SCANCODE_RETURN])\n entries[cursor]->trigger();\n}\n\nvoid Menu::render()\n{\n for (auto entry : entries)\n entry->render();\n}\n\n\nvoid FileMenu::change_dir(string dir)\n{\n clear();\n\n struct dirent* dirp;\n DIR* dp = opendir(dir.c_str());\n\n while ((dirp = readdir(dp)) != NULL)\n {\n string name = dirp->d_name;\n string path = dir + \"\/\" + name;\n\n if (name[0] == '.' and name != \"..\") continue;\n\n if (dirp->d_type == DT_DIR)\n {\n add(new Entry(name + \"\/\",\n [=]{ change_dir(path); },\n 0));\n }\n else if (name.size() > 4 and name.substr(name.size() - 4) == \".nes\")\n {\n add(new Entry(name,\n [=]{ Cartridge::load(path.c_str()); toggle_pause(); },\n 0));\n }\n }\n closedir(dp);\n}\n\nFileMenu::FileMenu()\n{\n char cwd[512];\n\n change_dir(getcwd(cwd, 512));\n}\n\n\n}\n<|endoftext|>"} {"text":"<commit_before>#include <ros\/ros.h>\n#include <pluginlib\/class_loader.h>\n\n\/\/ MoveIt!\n#include <moveit\/robot_model_loader\/robot_model_loader.h>\n#include <moveit\/planning_interface\/planning_interface.h>\n#include <moveit\/planning_pipeline\/planning_pipeline.h>\n#include <moveit\/kinematic_constraints\/utils.h>\n#include <moveit_msgs\/DisplayTrajectory.h>\n#include <moveit_msgs\/PlanningScene.h>\n#include <moveit\/planning_scene_monitor\/planning_scene_monitor.h>\n#include <moveit\/planning_scene_interface\/planning_scene_interface.h>\n#include <moveit\/move_group_interface\/move_group.h>\n#include <moveit_msgs\/CollisionObject.h>\n#include <moveit_msgs\/AttachedCollisionObject.h>\n#include <moveit\/robot_state\/robot_state.h>\n\n#include <math.h>\n#include <eigen_conversions\/eigen_msg.h>\n\n#include <tf\/transform_datatypes.h>\n#include <tf\/transform_listener.h>\n\n#include <kinect2_viewer\/Merosy_Obj.h>\n#include <kinect2_viewer\/Vec_Obj.h>\n#include <sstream>\n\n\/\/ Globals\nros::Subscriber sub;\nint aux = -1;\nint obj_nr = 1;\nstd::vector<kinect2_viewer::Merosy_Obj> detected_objects;\nstd::vector<kinect2_viewer::Merosy_Obj> manipulator;\nint SLEEP_TIME = 3; \/\/ in seconds\n\n\nclass Pose {\n\tpublic:\n\t\tPose(double x, double y, double z, double roll, double pitch, double yaw) {\n\t\t\tdX = x;\n\t\t\tdY = y;\n\t\t\tdZ = z;\n\t\t\troll_deg = roll;\n\t\t\tpitch_deg = pitch;\n\t\t\tyaw_deg = yaw;\n\t\t}\n\t\tdouble dX;\n\t\tdouble dY;\n\t\tdouble dZ;\n\t\tdouble roll_deg;\n\t\tdouble pitch_deg;\n\t\tdouble yaw_deg;\n};\n\n\nvoid send_joints_to_robot(const std::vector<std::string>& joint_names_received,\n\t\tstd::vector<double>& joint_values_received, robot_state::RobotState ¤t_values)\n{\n\n \/* Move group for Robot and joints set *\/\n moveit::planning_interface::MoveGroup group(\"manipulator\");\n\n group.setPlannerId(\"RRTkConfigDefault\");\n std::map<std::string, double> joints;\n\n for(std::size_t i = 0; i < joint_names_received.size(); ++i)\n {\n joints[joint_names_received[i].c_str()] = joint_values_received[i];\n \/\/ROS_INFO(\"Joints r %s: %f\", joint_names_received[i].c_str(), joint_values_received[i]);\n }\n\n \/\/ New current state\n planning_scene_monitor::PlanningSceneMonitorPtr final_planning_scene =\n boost::make_shared<planning_scene_monitor::PlanningSceneMonitor>(\"robot_description\");\n group.setStartState(current_values);\n\n group.setJointValueTarget(joints);\n\n moveit::planning_interface::MoveGroup::Plan plan;\n if (!group.plan(plan))\n { \/\/If fails we try with PRMkConfigDefault\n group.setPlannerId(\"PRMkConfigDefault\");\n group.setStartState(current_values);\n group.setJointValueTarget(joints);\n\n if (!group.plan(plan))\n ROS_FATAL(\"Unable to create motion plan. Aborting.\");\n else\n {\n std::cout << \"Move the robot? (Press 1 if YES)\";\n aux = 1;\n if(aux==1)\n group.execute(plan);\n }\n }\n else\n {\n std::cout << \"Move the robot? (Press 1 if YES)\";\n aux = 1;\n if(aux==1)\n group.execute(plan);\n }\n}\n\nbool isStateValid(const planning_scene::PlanningScene *planning_scene, robot_state::RobotState *state,\n const robot_state::JointModelGroup *group, const double *joint_group_variable_values)\n{\n state->setJointGroupPositions(group, joint_group_variable_values);\n std::vector<double> joint_values;\n state->copyJointGroupPositions(group, joint_values);\n collision_detection::CollisionRequest request;\n request.verbose = false;\n request.group_name = group->getName();\n collision_detection::CollisionResult result;\n planning_scene->checkCollision(request, result, *state);\n\n if (result.collision)\n return false;\n \/\/ limit for joints for the IK validation to be above the table\n else if (joint_values[1] > 0.3 || joint_values[0] < -0.5 || joint_values[4] < 0.3 || joint_values[4] > 1.5)\n return false;\n\n return planning_scene->isStateFeasible(*state);\n}\n\nkinect2_viewer::Merosy_Obj get_obj_closest_to_camera(\n\t\tstd::vector<kinect2_viewer::Merosy_Obj>& objs)\n{\n\tdouble closest = 100;\n\tfor (size_t i = 0; i < objs.size(); ++i) {\n\t\tif (objs.at(i).center_x < closest) {\n\t\t\tclosest = objs.at(i).center_x;\n\t\t}\n\t}\n\treturn objs.at(closest);\n}\n\nvoid objCallback(const kinect2_viewer::Vec_Obj::ConstPtr& msg)\n{\n\t\/\/ no detexted objects\n if (msg->objs.size() <= 1)\n {\n ROS_ERROR(\"Please put at least one object on the table\");\n return;\n }\n\n\t\/\/ gripper and many objects\n else {\n\t\tfor (size_t i = 0; i < msg->objs.size(); ++i) {\n\t\t\tif (msg->objs[i].min_z < 0.1) {\n\t\t\t\tdetected_objects.push_back(msg->objs[i]);\n\t\t\t} else {\n\t\t\t\tmanipulator.push_back(msg->objs[i]);\n\t\t\t}\n\t\t}\n\t}\n\n sub.shutdown();\n\n\tfor (size_t i = 0; i < detected_objects.size(); ++i) {\n std::cout << \"[\" << i+1 << \"]- Found object at (\" <<\n\t\tdetected_objects.at(i).center_x << \", \" <<\n\t\tdetected_objects.at(i).center_y << \",\" <<\n\t\tdetected_objects.at(i).center_z << \")\" << std::endl;\n\t}\n\n\tstd::cout << \"To where do you want to move? (Press 0 to Cancel)\" << std::endl;\n\taux = 1;\n}\n\nEigen::Affine3d get_obj_pose(\n\t\tdouble dXObj,double dYObj, double dZObj,\n\t\tdouble roll_deg,double pitch_deg,double yaw_deg)\n{\n\t\tdouble roll_rad = roll_deg * (M_PI\/180);\n\t\tdouble pitch_rad = pitch_deg * (M_PI\/180);\n\t\tdouble yaw_rad = yaw_deg * (M_PI\/180);\n\n\t\ttf::Quaternion l_q;\n\t\tl_q.setRPY(roll_rad, pitch_rad, yaw_rad);\n\n\t\tdouble dXCenter = 0.64;\n\t\tdouble dYCenter = -0.015;\n\t\tdouble dZCenter = 0.185;\n\n\t\t\/* Arm position *\/\n\t\tEigen::Affine3d goal_pose = Eigen::Translation3d(dXCenter-dXObj, dYCenter-dYObj, dZCenter-dZObj) * Eigen::Quaterniond(l_q);\n\t\treturn goal_pose;\n}\n\nvoid move_robot_to(Pose& pose)\n{\n\tmoveit::planning_interface::PlanningSceneInterface planning_scene_interface;\n\n\t\/\/ wait a bit for ros things to initialize\n\tros::WallDuration(1.0).sleep();\n\n\t\/* Model, scene and state *\/\n\trobot_model_loader::RobotModelLoader robot_model_loader(\"robot_description\");\n\trobot_model::RobotModelPtr kinematic_model = robot_model_loader.getModel();\n\tplanning_scene::PlanningScene planning_scene(kinematic_model);\n\trobot_state::RobotStatePtr kinematic_state(new robot_state::RobotState(kinematic_model));\n\n\t\/* Joints and Robot group *\/\n\tstd::vector<double> joint_values;\n\tconst robot_state::JointModelGroup* joint_model_group = kinematic_model->getJointModelGroup(\"manipulator\");\n\tconst std::vector<std::string> &joint_names = joint_model_group->getJointModelNames();\n\n\t\/* Get the current state *\/\n\tplanning_scene_monitor::PlanningSceneMonitor psm(\"robot_description\");\n\tpsm.startStateMonitor();\n\tsleep(1);\n\trobot_state::RobotState current_values = psm.getPlanningScene()->getCurrentState();\n\tpsm.stopStateMonitor();\n\n\t\/* Put the kinematic state in current state *\/\n\tcurrent_values.copyJointGroupPositions(joint_model_group, joint_values);\n\tkinematic_state->setJointGroupPositions(joint_model_group, joint_values);\n\n\t\/* Print joint names and values *\/\n\tfor(std::size_t i = 0; i < joint_names.size(); ++i)\n\t{\n\t\tROS_INFO(\"Joint %s: %f\", joint_names[i].c_str(), joint_values[i]);\n\t}\n\n\t\/\/ Move the arm in position\n\tEigen::Affine3d goal_pose = get_obj_pose(pose.dX, pose.dY, pose.dZ, pose.roll_deg, pose.pitch_deg, pose.yaw_deg);\n\n\t\/* Arm group, model and end-effector *\/\n\tmoveit::planning_interface::MoveGroup group(\"manipulator\");\n\tstd::string end_effector_name = group.getEndEffectorLink();\n\n\t\/* Arm IK *\/\n\tif (!kinematic_state->setFromIK(joint_model_group, goal_pose, end_effector_name, 200, 0.1,\n\t\t\t\tboost::bind(&isStateValid, &planning_scene, _1, _2, _3)))\n\t{\n\t\tROS_WARN(\"Was NOT able to set IK\");\n\t\treturn;\n\t}\n\tkinematic_state->copyJointGroupPositions(joint_model_group, joint_values);\n\n\tsend_joints_to_robot(joint_names, joint_values, current_values);\n\tsleep(SLEEP_TIME);\n}\n\n\nint main(int argc, char **argv)\n{\n ros::init (argc, argv, \"move\");\n ros::AsyncSpinner spinner(1);\n spinner.start();\n\n\tstd::cout << \"argc = \" << argc << std::endl;\n\tdouble dXGripper = 0.25;\n\tdouble dYGripper = -0.0003;\n\tdouble dZGripper = 0.441;\n\t\tdouble dXObj = 0;\n\t\tdouble dYObj = 0;\n\t\tdouble dZObj = 0;\n\t\tdouble roll_deg=0;\n\t\tdouble pitch_deg=180;\n\t\tdouble yaw_deg=-90;\n\tif (argc >= 7) {\n\t\tstd::istringstream iss1( argv[1] );\n\t\tiss1 >> dXObj;\n\t\tstd::istringstream iss2( argv[2] );\n\t\tiss2 >> dYObj;\n\t\tstd::istringstream iss3( argv[3] );\n\t\tiss3 >> dZObj;\n\t\tstd::istringstream iss4( argv[4] );\n\t\tiss4 >> roll_deg;\n\t\tstd::istringstream iss5( argv[5] );\n\t\tiss5 >> pitch_deg;\n\t\tstd::istringstream iss6( argv[6] );\n\t\tiss6 >> yaw_deg;\n\t}\n\n\t\tstd::cout << \"argv[1] = \" << argv[1] << \", \" << dXObj << std::endl;\n\t\tstd::cout << \"argv[2] = \" << argv[2] << \", \" << dYObj << std::endl;\n\t\tstd::cout << \"argv[3] = \" << argv[3] << \", \" << dZObj << std::endl;\n\t\tstd::cout << \"argv[4] = \" << argv[4] << \", \" << roll_deg << std::endl;\n\t\tstd::cout << \"argv[5] = \" << argv[5] << \", \" << pitch_deg << std::endl;\n\t\tstd::cout << \"argv[6] = \" << argv[6] << \", \" << yaw_deg << std::endl;\n\t\/\/ Move the arm in position\n\tPose pose1 = Pose(dXObj, dYObj, dZObj-0.02, roll_deg, pitch_deg, yaw_deg);\n\tmove_robot_to(pose1);\n\n\t{\n\t\t\/\/ Move to preset active position\n\t\troll_deg=30;\n\t\tpitch_deg=180;\n\t\tyaw_deg=90;\n\t\tPose pose = Pose(dXGripper, dYGripper, dZGripper-0.73, roll_deg, pitch_deg, yaw_deg);\n\t\tmove_robot_to(pose);\n\t}\n\n ros::shutdown();\n return 0;\n}\n\n<commit_msg>improve indentation<commit_after>#include <ros\/ros.h>\n#include <pluginlib\/class_loader.h>\n\n\/\/ MoveIt!\n#include <moveit\/robot_model_loader\/robot_model_loader.h>\n#include <moveit\/planning_interface\/planning_interface.h>\n#include <moveit\/planning_pipeline\/planning_pipeline.h>\n#include <moveit\/kinematic_constraints\/utils.h>\n#include <moveit_msgs\/DisplayTrajectory.h>\n#include <moveit_msgs\/PlanningScene.h>\n#include <moveit\/planning_scene_monitor\/planning_scene_monitor.h>\n#include <moveit\/planning_scene_interface\/planning_scene_interface.h>\n#include <moveit\/move_group_interface\/move_group.h>\n#include <moveit_msgs\/CollisionObject.h>\n#include <moveit_msgs\/AttachedCollisionObject.h>\n#include <moveit\/robot_state\/robot_state.h>\n\n#include <math.h>\n#include <eigen_conversions\/eigen_msg.h>\n\n#include <tf\/transform_datatypes.h>\n#include <tf\/transform_listener.h>\n\n#include <kinect2_viewer\/Merosy_Obj.h>\n#include <kinect2_viewer\/Vec_Obj.h>\n#include <sstream>\n\n\/\/ Globals\nros::Subscriber sub;\nint aux = -1;\nint obj_nr = 1;\nstd::vector<kinect2_viewer::Merosy_Obj> detected_objects;\nstd::vector<kinect2_viewer::Merosy_Obj> manipulator;\nint SLEEP_TIME = 3; \/\/ in seconds\n\n\nclass Pose {\n\tpublic:\n\t\tPose(double x, double y, double z, double roll, double pitch, double yaw) {\n\t\t\tdX = x;\n\t\t\tdY = y;\n\t\t\tdZ = z;\n\t\t\troll_deg = roll;\n\t\t\tpitch_deg = pitch;\n\t\t\tyaw_deg = yaw;\n\t\t}\n\t\tdouble dX;\n\t\tdouble dY;\n\t\tdouble dZ;\n\t\tdouble roll_deg;\n\t\tdouble pitch_deg;\n\t\tdouble yaw_deg;\n};\n\n\nvoid send_joints_to_robot(const std::vector<std::string>& joint_names_received,\n\t\tstd::vector<double>& joint_values_received, robot_state::RobotState ¤t_values)\n{\n\n\t\/* Move group for Robot and joints set *\/\n\tmoveit::planning_interface::MoveGroup group(\"manipulator\");\n\n\tgroup.setPlannerId(\"RRTkConfigDefault\");\n\tstd::map<std::string, double> joints;\n\n\tfor(std::size_t i = 0; i < joint_names_received.size(); ++i)\n\t{\n\t\tjoints[joint_names_received[i].c_str()] = joint_values_received[i];\n\t\t\/\/ROS_INFO(\"Joints r %s: %f\", joint_names_received[i].c_str(), joint_values_received[i]);\n\t}\n\n\t\/\/ New current state\n\tplanning_scene_monitor::PlanningSceneMonitorPtr final_planning_scene =\n\t\tboost::make_shared<planning_scene_monitor::PlanningSceneMonitor>(\"robot_description\");\n\tgroup.setStartState(current_values);\n\n\tgroup.setJointValueTarget(joints);\n\n\tmoveit::planning_interface::MoveGroup::Plan plan;\n\tif (!group.plan(plan))\n\t{ \/\/If fails we try with PRMkConfigDefault\n\t\tgroup.setPlannerId(\"PRMkConfigDefault\");\n\t\tgroup.setStartState(current_values);\n\t\tgroup.setJointValueTarget(joints);\n\n\t\tif (!group.plan(plan))\n\t\t\tROS_FATAL(\"Unable to create motion plan. Aborting.\");\n\t\telse\n\t\t{\n\t\t\tstd::cout << \"Move the robot? (Press 1 if YES)\";\n\t\t\taux = 1;\n\t\t\tif(aux==1)\n\t\t\t\tgroup.execute(plan);\n\t\t}\n\t}\n\telse\n\t{\n\t\tstd::cout << \"Move the robot? (Press 1 if YES)\";\n\t\taux = 1;\n\t\tif(aux==1)\n\t\t\tgroup.execute(plan);\n\t}\n}\n\nbool isStateValid(const planning_scene::PlanningScene *planning_scene, robot_state::RobotState *state,\n\t\tconst robot_state::JointModelGroup *group, const double *joint_group_variable_values)\n{\n\tstate->setJointGroupPositions(group, joint_group_variable_values);\n\tstd::vector<double> joint_values;\n\tstate->copyJointGroupPositions(group, joint_values);\n\tcollision_detection::CollisionRequest request;\n\trequest.verbose = false;\n\trequest.group_name = group->getName();\n\tcollision_detection::CollisionResult result;\n\tplanning_scene->checkCollision(request, result, *state);\n\n\tif (result.collision)\n\t\treturn false;\n\t\/\/ limit for joints for the IK validation to be above the table\n\telse if (joint_values[1] > 0.3 || joint_values[0] < -0.5 || joint_values[4] < 0.3 || joint_values[4] > 1.5)\n\t\treturn false;\n\n\treturn planning_scene->isStateFeasible(*state);\n}\n\nkinect2_viewer::Merosy_Obj get_obj_closest_to_camera(\n\t\tstd::vector<kinect2_viewer::Merosy_Obj>& objs)\n{\n\tdouble closest = 100;\n\tfor (size_t i = 0; i < objs.size(); ++i) {\n\t\tif (objs.at(i).center_x < closest) {\n\t\t\tclosest = objs.at(i).center_x;\n\t\t}\n\t}\n\treturn objs.at(closest);\n}\n\nvoid objCallback(const kinect2_viewer::Vec_Obj::ConstPtr& msg)\n{\n\t\/\/ no detexted objects\n\tif (msg->objs.size() <= 1)\n\t{\n\t\tROS_ERROR(\"Please put at least one object on the table\");\n\t\treturn;\n\t}\n\n\t\/\/ gripper and many objects\n\telse {\n\t\tfor (size_t i = 0; i < msg->objs.size(); ++i) {\n\t\t\tif (msg->objs[i].min_z < 0.1) {\n\t\t\t\tdetected_objects.push_back(msg->objs[i]);\n\t\t\t} else {\n\t\t\t\tmanipulator.push_back(msg->objs[i]);\n\t\t\t}\n\t\t}\n\t}\n\n\tsub.shutdown();\n\n\tfor (size_t i = 0; i < detected_objects.size(); ++i) {\n\t\tstd::cout << \"[\" << i+1 << \"]- Found object at (\" <<\n\t\t\tdetected_objects.at(i).center_x << \", \" <<\n\t\t\tdetected_objects.at(i).center_y << \",\" <<\n\t\t\tdetected_objects.at(i).center_z << \")\" << std::endl;\n\t}\n\n\tstd::cout << \"To where do you want to move? (Press 0 to Cancel)\" << std::endl;\n\taux = 1;\n}\n\nEigen::Affine3d get_obj_pose(\n\t\tdouble dXObj,double dYObj, double dZObj,\n\t\tdouble roll_deg,double pitch_deg,double yaw_deg)\n{\n\tdouble roll_rad = roll_deg * (M_PI\/180);\n\tdouble pitch_rad = pitch_deg * (M_PI\/180);\n\tdouble yaw_rad = yaw_deg * (M_PI\/180);\n\n\ttf::Quaternion l_q;\n\tl_q.setRPY(roll_rad, pitch_rad, yaw_rad);\n\n\tdouble dXCenter = 0.64;\n\tdouble dYCenter = -0.015;\n\tdouble dZCenter = 0.185;\n\n\t\/* Arm position *\/\n\tEigen::Affine3d goal_pose = Eigen::Translation3d(dXCenter-dXObj, dYCenter-dYObj, dZCenter-dZObj) * Eigen::Quaterniond(l_q);\n\treturn goal_pose;\n}\n\nvoid move_robot_to(Pose& pose)\n{\n\tmoveit::planning_interface::PlanningSceneInterface planning_scene_interface;\n\n\t\/\/ wait a bit for ros things to initialize\n\tros::WallDuration(1.0).sleep();\n\n\t\/* Model, scene and state *\/\n\trobot_model_loader::RobotModelLoader robot_model_loader(\"robot_description\");\n\trobot_model::RobotModelPtr kinematic_model = robot_model_loader.getModel();\n\tplanning_scene::PlanningScene planning_scene(kinematic_model);\n\trobot_state::RobotStatePtr kinematic_state(new robot_state::RobotState(kinematic_model));\n\n\t\/* Joints and Robot group *\/\n\tstd::vector<double> joint_values;\n\tconst robot_state::JointModelGroup* joint_model_group = kinematic_model->getJointModelGroup(\"manipulator\");\n\tconst std::vector<std::string> &joint_names = joint_model_group->getJointModelNames();\n\n\t\/* Get the current state *\/\n\tplanning_scene_monitor::PlanningSceneMonitor psm(\"robot_description\");\n\tpsm.startStateMonitor();\n\tsleep(1);\n\trobot_state::RobotState current_values = psm.getPlanningScene()->getCurrentState();\n\tpsm.stopStateMonitor();\n\n\t\/* Put the kinematic state in current state *\/\n\tcurrent_values.copyJointGroupPositions(joint_model_group, joint_values);\n\tkinematic_state->setJointGroupPositions(joint_model_group, joint_values);\n\n\t\/* Print joint names and values *\/\n\tfor(std::size_t i = 0; i < joint_names.size(); ++i)\n\t{\n\t\tROS_INFO(\"Joint %s: %f\", joint_names[i].c_str(), joint_values[i]);\n\t}\n\n\t\/\/ Move the arm in position\n\tEigen::Affine3d goal_pose = get_obj_pose(pose.dX, pose.dY, pose.dZ, pose.roll_deg, pose.pitch_deg, pose.yaw_deg);\n\n\t\/* Arm group, model and end-effector *\/\n\tmoveit::planning_interface::MoveGroup group(\"manipulator\");\n\tstd::string end_effector_name = group.getEndEffectorLink();\n\n\t\/* Arm IK *\/\n\tif (!kinematic_state->setFromIK(joint_model_group, goal_pose, end_effector_name, 200, 0.1,\n\t\t\t\tboost::bind(&isStateValid, &planning_scene, _1, _2, _3)))\n\t{\n\t\tROS_WARN(\"Was NOT able to set IK\");\n\t\treturn;\n\t}\n\tkinematic_state->copyJointGroupPositions(joint_model_group, joint_values);\n\n\tsend_joints_to_robot(joint_names, joint_values, current_values);\n\tsleep(SLEEP_TIME);\n}\n\n\nint main(int argc, char **argv)\n{\n\tros::init (argc, argv, \"move\");\n\tros::AsyncSpinner spinner(1);\n\tspinner.start();\n\n\tstd::cout << \"argc = \" << argc << std::endl;\n\tdouble dXGripper = 0.25;\n\tdouble dYGripper = -0.0003;\n\tdouble dZGripper = 0.441;\n\tdouble dXObj = 0;\n\tdouble dYObj = 0;\n\tdouble dZObj = 0;\n\tdouble roll_deg=0;\n\tdouble pitch_deg=180;\n\tdouble yaw_deg=-90;\n\tif (argc >= 7) {\n\t\tstd::istringstream iss1( argv[1] );\n\t\tiss1 >> dXObj;\n\t\tstd::istringstream iss2( argv[2] );\n\t\tiss2 >> dYObj;\n\t\tstd::istringstream iss3( argv[3] );\n\t\tiss3 >> dZObj;\n\t\tstd::istringstream iss4( argv[4] );\n\t\tiss4 >> roll_deg;\n\t\tstd::istringstream iss5( argv[5] );\n\t\tiss5 >> pitch_deg;\n\t\tstd::istringstream iss6( argv[6] );\n\t\tiss6 >> yaw_deg;\n\t}\n\n\tstd::cout << \"argv[1] = \" << argv[1] << \", \" << dXObj << std::endl;\n\tstd::cout << \"argv[2] = \" << argv[2] << \", \" << dYObj << std::endl;\n\tstd::cout << \"argv[3] = \" << argv[3] << \", \" << dZObj << std::endl;\n\tstd::cout << \"argv[4] = \" << argv[4] << \", \" << roll_deg << std::endl;\n\tstd::cout << \"argv[5] = \" << argv[5] << \", \" << pitch_deg << std::endl;\n\tstd::cout << \"argv[6] = \" << argv[6] << \", \" << yaw_deg << std::endl;\n\t\/\/ Move the arm in position\n\tPose pose1 = Pose(dXObj, dYObj, dZObj-0.02, roll_deg, pitch_deg, yaw_deg);\n\tmove_robot_to(pose1);\n\n\t{\n\t\t\/\/ Move to preset active position\n\t\troll_deg=30;\n\t\tpitch_deg=180;\n\t\tyaw_deg=90;\n\t\tPose pose = Pose(dXGripper, dYGripper, dZGripper-0.73, roll_deg, pitch_deg, yaw_deg);\n\t\tmove_robot_to(pose);\n\t}\n\n\tros::shutdown();\n\treturn 0;\n}\n\n<|endoftext|>"} {"text":"<commit_before>\/**\n * Copyright (C) 2014 Lantern\n *\n * This program is free software: you can redistribute it and\/or modify\n * it under the terms of the GNU General Public License as published by\n * the Free Software Foundation, either version 3 of the License, or\n * (at your option) any later version.\n *\n * This program is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the\n * GNU General Public License for more details.\n *\n * You should have received a copy of the GNU General Public License\n * along with this program. If not, see <http:\/\/www.gnu.org\/licenses\/>.\n *\/\n\n#include \"natty.h\"\n\n#include <utility>\n#include <iostream>\n#include <fstream>\n#include <streambuf>\n#include <string>\n\n#include \"talk\/app\/webrtc\/videosourceinterface.h\"\n#include \"talk\/base\/common.h\"\n#include \"talk\/app\/webrtc\/datachannelinterface.h\"\n#include \"talk\/base\/json.h\"\n#include \"talk\/base\/logging.h\"\n#include \"talk\/media\/devices\/devicemanager.h\"\n\nusing namespace std;\n\n#define DEBUG(fmt, ...) printf(\"%s:%d: \" fmt, __FILE__, __LINE__, __VA_ARGS__);\n\n\/\/ Names used for a IceCandidate JSON object.\nconst char kCandidateSdpMidName[] = \"sdpMid\";\nconst char kCandidateSdpMlineIndexName[] = \"sdpMLineIndex\";\nconst char kCandidateSdpName[] = \"candidate\";\n\ntypedef webrtc::PeerConnectionInterface::IceServers IceServers;\ntypedef webrtc::PeerConnectionInterface::IceServer IceServer;;\n\n\/\/ Names used for a SessionDescription JSON object.\nconst char kSessionDescriptionTypeName[] = \"type\";\nconst char kSessionDescriptionSdpName[] = \"sdp\";\n\nvoid Natty::InputStream::read(Natty* natty) {\n \/\/std::ifstream filein(\"cand-input.txt\");\n while (getline(std::cin, input)) {\n \/* need to remove new lines or the SDP won't be valid *\/\n if (input == \"exit\") {\n natty->Shutdown();\n break;\n }\n\n if (input.empty()) {\n \/* terminate input on empty line *\/\n \/\/std::cout << \"\\n\";\n continue;\n }\n natty->ReadMessage(input); \n }\n\n}\n\nstring Natty::InputStream::build() const {\n string str = ss.str();\n str.erase(\n std::remove(str.begin(), str.end(), '\\n'), str.end()\n ); \n return str;\n}\n\nclass NattySessionObserver\n: public webrtc::SetSessionDescriptionObserver {\n public:\n static NattySessionObserver* Create() {\n return\n new talk_base::RefCountedObject<NattySessionObserver>();\n }\n virtual void OnSuccess() {\n LOG(INFO) << __FUNCTION__;\n }\n virtual void OnFailure(const std::string& error) {\n LOG(INFO) << __FUNCTION__ << \" \" << error;\n }\n\n protected:\n NattySessionObserver() {}\n ~NattySessionObserver() {}\n};\n\nbool NattySocket::Wait(int cms, bool process_io) {\n return talk_base::PhysicalSocketServer::Wait(-1,\n process_io);\n}\n\nMessageClient::~MessageClient() {\n delete socket_;\n}\n\nvoid MessageClient::OnMessage(talk_base::Message *pmsg) {\n NattyMessage* msg = static_cast<NattyMessage*>(pmsg->pdata);\n \n delete msg;\n}\n\n\nNatty::Natty(PeerConnectionClient* client,\n talk_base::Thread* thread\n )\n: peer_id_(-1),\n thread_(thread),\n client_(client) {\n client_->RegisterObserver(this);\n }\n\nNatty::~Natty() {\n if (outfile != NULL) {\n outfile.close();\n }\n ASSERT(peer_connection_.get() == NULL);\n}\n\nbool Natty::connection_active() const {\n return peer_connection_.get() != NULL;\n}\n\nPeerConnectionClient* Natty::GetClient() {\n return client_;\n}\n\nvoid Natty::ConnectToPeer(int peer_id) {\n ASSERT(peer_id_ == -1);\n ASSERT(peer_id != -1);\n\n if (InitializePeerConnection()) {\n peer_id_ = peer_id;\n peer_connection_->CreateOffer(this, NULL);\n }\n}\n\nstd::string GetEnvVarOrDefault(const char* env_var_name,\n const char* default_value) {\n std::string value;\n const char* env_var = getenv(env_var_name);\n if (env_var)\n value = env_var;\n\n if (value.empty())\n value = default_value;\n\n return value;\n}\n\nstd::string GetPeerConnectionString() {\n \/\/return GetEnvVarOrDefault(\"WEBRTC_CONNECT\", \"stun:stun.l.google.com:19302\");\n return GetEnvVarOrDefault(\"WEBRTC_CONNECT\", \"stun:stun3.l.google.com:19302\");\n}\n\nbool Natty::InitializePeerConnection() {\n\n IceServers servers;\n IceServer server;\n\n ASSERT(peer_connection_factory_.get() == NULL);\n ASSERT(peer_connection_.get() == NULL);\n\n peer_connection_factory_ = webrtc::CreatePeerConnectionFactory();\n\n if (!peer_connection_factory_.get()) {\n LOG(INFO) << \"Failed to initialize peer connection factory\";\n Shutdown();\n return false;\n }\n LOG(INFO) << \"Created peer connection factory\";\n\n server.uri = GetPeerConnectionString();\n servers.push_back(server);\n\n peer_connection_ = peer_connection_factory_->CreatePeerConnection(servers, NULL, NULL, this);\n\n if (!peer_connection_.get()) {\n LOG(INFO) << \"Create peer connection failed\";\n Shutdown();\n }\n\n return peer_connection_.get() != NULL;\n}\n\nvoid Natty::Shutdown() {\n LOG(INFO) << \"Deleting peer connection\";\n\n peer_connection_ = NULL;\n peer_connection_factory_ = NULL;\n peer_id_ = -1;\n talk_base::CleanupSSL();\n thread_->Stop();\n}\n\n\/\/\n\/\/ PeerConnectionObserver implementation.\n\/\/\n\nvoid Natty::OnError() {\n LOG(LS_ERROR) << __FUNCTION__;\n}\n\nvoid Natty::OnAddStream(webrtc::MediaStreamInterface* stream) {\n\n}\n\nvoid Natty::OnRemoveStream(webrtc::MediaStreamInterface* stream) {\n LOG(INFO) << __FUNCTION__ << \" \" << stream->label();\n stream->AddRef();\n}\n\nvoid Natty::ShowCandidate(const webrtc::IceCandidateInterface* candidate) {\n std::string out;\n const cricket::Candidate& cand = candidate->candidate();\n const talk_base::SocketAddress & address = cand.address(); \n candidate->ToString(&out);\n LOG(INFO) << \"Ice candidate \" << out.c_str();\n}\n\nvoid Natty::Add5Tuple() {\n Json::FastWriter writer;\n\n fivetuple[\"type\"] = \"5-tuple\";\n fivetuple[\"proto\"] = \"udp\";\n outfile << writer.write(fivetuple);\n}\n\nvoid Natty::SaveCandidate(bool status, const webrtc::IceCandidateInterface* candidate) {\n const talk_base::SocketAddress address = candidate->candidate().address();\n const std::string type = candidate->candidate().type();\n fivetuple[status ? \"local\" : \"remote\"] = address.ToString();\n Natty::Add5Tuple();\n}\n\nvoid Natty::OnIceCandidate(const webrtc::IceCandidateInterface* candidate) {\n Json::FastWriter writer;\n Json::Value jmessage;\n\n jmessage[kCandidateSdpMidName] = candidate->sdp_mid();\n jmessage[kCandidateSdpMlineIndexName] = candidate->sdp_mline_index();\n std::string sdp;\n if (!candidate->ToString(&sdp)) {\n LOG(LS_ERROR) << \"Failed to serialize candidate\";\n return;\n }\n\n jmessage[kCandidateSdpName] = sdp;\n outfile << writer.write(jmessage) << endl;\n \/\/SaveCandidate(true, candidate);\n \/\/outfile << jmessage;\n}\n\nvoid Natty::OnRenegotiationNeeded() {\n LOG(INFO) << \"Renegotiation needed\";\n}\n\n\n\/\/\n\/\/ PeerConnectionClientObserver implementation.\n\/\/\n\nvoid Natty::OnSignedIn() {\n\n}\n\nvoid Natty::OnDisconnected() {\n printf(\"Disconnecting..\\n\");\n Shutdown();\n}\n\nvoid Natty::OnPeerConnected(int id, const std::string& name) {\n LOG(INFO) << \"Another peer connected \" << id << \" \" << name;\n}\n\nvoid Natty::OnPeerDisconnected(int id) {\n if (id == peer_id_) {\n LOG(INFO) << \"Our peer disconnected\";\n }\n}\n\nvoid Natty::ReadMessage(const std::string& message) {\n Json::Reader reader;\n Json::Value jmessage;\n std::string type;\n std::string json_object;\n\n if (!reader.parse(message, jmessage)) {\n LOG(INFO) << \"Received an unknown message.\";\n return;\n }\n\n GetStringFromJsonObject(jmessage, kSessionDescriptionTypeName, &type);\n\n if (!type.empty()) {\n std::string sdp;\n if (!GetStringFromJsonObject(jmessage, kSessionDescriptionSdpName, &sdp)) {\n LOG(INFO) << \"Can't parse received session description message.\";\n return;\n }\n webrtc::SessionDescriptionInterface* session_description(\n webrtc::CreateSessionDescription(type, sdp));\n if (!session_description) {\n LOG(INFO) << \"Can't parse SDP message\";\n return;\n }\n LOG(INFO) << \"Received session description \" << message << \" sending answer back\";\n\n if (session_description->type() ==\n webrtc::SessionDescriptionInterface::kOffer) {\n peer_connection_->SetRemoteDescription(\n NattySessionObserver::Create(), session_description);\n peer_connection_->CreateAnswer(this, NULL);\n }\n else {\n peer_connection_->SetRemoteDescription(\n NattySessionObserver::Create(), session_description);\n }\n }\n else {\n std::string sdp_mid;\n int sdp_mlineindex = 0;\n std::string sdp;\n if (!GetStringFromJsonObject(jmessage, kCandidateSdpMidName, &sdp_mid) ||\n !GetIntFromJsonObject(jmessage, kCandidateSdpMlineIndexName,\n &sdp_mlineindex) ||\n !GetStringFromJsonObject(jmessage, kCandidateSdpName, &sdp)) {\n LOG(INFO) << \"Can't parse received message\";\n return;\n }\n talk_base::scoped_ptr<webrtc::IceCandidateInterface> candidate(\n webrtc::CreateIceCandidate(sdp_mid, sdp_mlineindex, sdp));\n LOG(INFO) << \"Remote candidate information\";\n\n if (!candidate.get()) {\n LOG(WARNING) << \"Can't parse received candidate message.\";\n return;\n }\n if (!peer_connection_->AddIceCandidate(candidate.get())) {\n LOG(WARNING) << \"Failed to apply the received candidate\";\n return;\n }\n Natty::SaveCandidate(false, candidate.get());\n\n LOG(INFO) << \" Received candidate :\" << message;\n return;\n }\n};\n\nvoid Natty::OnMessageFromPeer(int peer_id, const std::string& message) {\n\n}\n\nvoid Natty::OnDataChannel(webrtc::DataChannelInterface* data_channel) {\n LOG(INFO) << \"New data channel created \" << data_channel;\n}\n\nvoid Natty::OnMessageSent(int err) {\n\n}\n\nvoid Natty::OnIceComplete() {\n LOG(INFO) << \"ICE finished gathering candidates!\";\n \/\/Natty::Shutdown();\n}\n\n\/\/ PeerConnectionObserver implementation.\nvoid Natty::OnServerConnectionFailure() {\n\n}\n\nstd::string GetPeerName() {\n char computer_name[256];\n if (gethostname(computer_name, ARRAY_SIZE(computer_name)) != 0)\n strcpy(computer_name, \"host\");\n std::string ret(GetEnvVarOrDefault(\"USERNAME\", \"user\"));\n ret += '@';\n ret += computer_name;\n return ret;\n} \n\nvoid Natty::setMode(Natty::Mode m) {\n mode = m;\n}\n\nvoid Natty::Init(bool offer) {\n\n talk_base::InitializeSSL();\n InitializePeerConnection();\n if (offer) {\n Natty::setMode(Natty::OFFER);\n peer_connection_->CreateOffer(this, NULL);\n }\n}\n\nvoid Natty::ProcessInput() {\n Natty::InputStream is;\n const talk_base::SocketAddress addr(\"127.0.0.1\", 0);\n\n \/\/talk_base::Socket* socket = thread_->socketserver()->CreateAsyncSocket(addr.family(), SOCK_DGRAM); \n \/\/MessageClient msg(thread_, socket);\n\n \/\/thread_->Start();\n\n \/\/thread_->ProcessMessages(1000);\n \/\/thread_->PostDelayed(100, &msg, 0,\n \/\/ new NattyMessage(\"Hey\"));\n\n \/\/thread->ProcessMessages(2000);\n \/\/natty.get()->Shutdown();\n\n is.read(this);\n\n}\n\n\/* need to update this to accept stdout when the stdout\n * option is blank \n *\n *\/\nvoid Natty::OpenDumpFile(const std::string& filename) {\n if (!filename.empty()) {\n outfile.open(filename.c_str());\n }\n else {\n outfile.copyfmt(std::cout);\n outfile.clear(std::cout.rdstate());\n outfile.basic_ios<char>::rdbuf(std::cout.rdbuf());\n }\n}\n\nvoid Natty::OnSuccess(webrtc::SessionDescriptionInterface* desc) {\n LOG(INFO) << \"Setting local description\";\n peer_connection_->SetLocalDescription(\n NattySessionObserver::Create(), desc);\n Json::FastWriter writer;\n Json::Value jmessage;\n jmessage[kSessionDescriptionTypeName] = desc->type();\n\n std::string sdp;\n desc->ToString(&sdp);\n jmessage[kSessionDescriptionSdpName] = sdp;\n outfile << writer.write(jmessage) << endl; \n}\n\nvoid Natty::OnFailure(const std::string& error) {\n LOG(LERROR) << error;\n}\n\nvoid Natty::SendMessage(const std::string& json_object) {\n\n}\n\nvoid Natty::DisconnectFromServer() {\n if (client_->is_connected())\n client_->SignOut();\n}\n\n<commit_msg>adding endlines<commit_after>\/**\n * Copyright (C) 2014 Lantern\n *\n * This program is free software: you can redistribute it and\/or modify\n * it under the terms of the GNU General Public License as published by\n * the Free Software Foundation, either version 3 of the License, or\n * (at your option) any later version.\n *\n * This program is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the\n * GNU General Public License for more details.\n *\n * You should have received a copy of the GNU General Public License\n * along with this program. If not, see <http:\/\/www.gnu.org\/licenses\/>.\n *\/\n\n#include \"natty.h\"\n\n#include <utility>\n#include <iostream>\n#include <fstream>\n#include <streambuf>\n#include <string>\n\n#include \"talk\/app\/webrtc\/videosourceinterface.h\"\n#include \"talk\/base\/common.h\"\n#include \"talk\/app\/webrtc\/datachannelinterface.h\"\n#include \"talk\/base\/json.h\"\n#include \"talk\/base\/logging.h\"\n#include \"talk\/media\/devices\/devicemanager.h\"\n\nusing namespace std;\n\n#define DEBUG(fmt, ...) printf(\"%s:%d: \" fmt, __FILE__, __LINE__, __VA_ARGS__);\n\n\/\/ Names used for a IceCandidate JSON object.\nconst char kCandidateSdpMidName[] = \"sdpMid\";\nconst char kCandidateSdpMlineIndexName[] = \"sdpMLineIndex\";\nconst char kCandidateSdpName[] = \"candidate\";\n\ntypedef webrtc::PeerConnectionInterface::IceServers IceServers;\ntypedef webrtc::PeerConnectionInterface::IceServer IceServer;;\n\n\/\/ Names used for a SessionDescription JSON object.\nconst char kSessionDescriptionTypeName[] = \"type\";\nconst char kSessionDescriptionSdpName[] = \"sdp\";\n\nvoid Natty::InputStream::read(Natty* natty) {\n \/\/std::ifstream filein(\"cand-input.txt\");\n while (getline(std::cin, input)) {\n \/* need to remove new lines or the SDP won't be valid *\/\n if (input == \"exit\") {\n natty->Shutdown();\n break;\n }\n\n if (input.empty()) {\n \/* terminate input on empty line *\/\n \/\/std::cout << \"\\n\";\n continue;\n }\n natty->ReadMessage(input); \n }\n\n}\n\nstring Natty::InputStream::build() const {\n string str = ss.str();\n str.erase(\n std::remove(str.begin(), str.end(), '\\n'), str.end()\n ); \n return str;\n}\n\nclass NattySessionObserver\n: public webrtc::SetSessionDescriptionObserver {\n public:\n static NattySessionObserver* Create() {\n return\n new talk_base::RefCountedObject<NattySessionObserver>();\n }\n virtual void OnSuccess() {\n LOG(INFO) << __FUNCTION__;\n }\n virtual void OnFailure(const std::string& error) {\n LOG(INFO) << __FUNCTION__ << \" \" << error;\n }\n\n protected:\n NattySessionObserver() {}\n ~NattySessionObserver() {}\n};\n\nbool NattySocket::Wait(int cms, bool process_io) {\n return talk_base::PhysicalSocketServer::Wait(-1,\n process_io);\n}\n\nMessageClient::~MessageClient() {\n delete socket_;\n}\n\nvoid MessageClient::OnMessage(talk_base::Message *pmsg) {\n NattyMessage* msg = static_cast<NattyMessage*>(pmsg->pdata);\n \n delete msg;\n}\n\n\nNatty::Natty(PeerConnectionClient* client,\n talk_base::Thread* thread\n )\n: peer_id_(-1),\n thread_(thread),\n client_(client) {\n client_->RegisterObserver(this);\n }\n\nNatty::~Natty() {\n if (outfile != NULL) {\n outfile.close();\n }\n ASSERT(peer_connection_.get() == NULL);\n}\n\nbool Natty::connection_active() const {\n return peer_connection_.get() != NULL;\n}\n\nPeerConnectionClient* Natty::GetClient() {\n return client_;\n}\n\nvoid Natty::ConnectToPeer(int peer_id) {\n ASSERT(peer_id_ == -1);\n ASSERT(peer_id != -1);\n\n if (InitializePeerConnection()) {\n peer_id_ = peer_id;\n peer_connection_->CreateOffer(this, NULL);\n }\n}\n\nstd::string GetEnvVarOrDefault(const char* env_var_name,\n const char* default_value) {\n std::string value;\n const char* env_var = getenv(env_var_name);\n if (env_var)\n value = env_var;\n\n if (value.empty())\n value = default_value;\n\n return value;\n}\n\nstd::string GetPeerConnectionString() {\n \/\/return GetEnvVarOrDefault(\"WEBRTC_CONNECT\", \"stun:stun.l.google.com:19302\");\n return GetEnvVarOrDefault(\"WEBRTC_CONNECT\", \"stun:stun3.l.google.com:19302\");\n}\n\nbool Natty::InitializePeerConnection() {\n\n IceServers servers;\n IceServer server;\n\n ASSERT(peer_connection_factory_.get() == NULL);\n ASSERT(peer_connection_.get() == NULL);\n\n peer_connection_factory_ = webrtc::CreatePeerConnectionFactory();\n\n if (!peer_connection_factory_.get()) {\n LOG(INFO) << \"Failed to initialize peer connection factory\";\n Shutdown();\n return false;\n }\n LOG(INFO) << \"Created peer connection factory\";\n\n server.uri = GetPeerConnectionString();\n servers.push_back(server);\n\n peer_connection_ = peer_connection_factory_->CreatePeerConnection(servers, NULL, NULL, this);\n\n if (!peer_connection_.get()) {\n LOG(INFO) << \"Create peer connection failed\";\n Shutdown();\n }\n\n return peer_connection_.get() != NULL;\n}\n\nvoid Natty::Shutdown() {\n LOG(INFO) << \"Deleting peer connection\";\n\n peer_connection_ = NULL;\n peer_connection_factory_ = NULL;\n peer_id_ = -1;\n talk_base::CleanupSSL();\n thread_->Stop();\n}\n\n\/\/\n\/\/ PeerConnectionObserver implementation.\n\/\/\n\nvoid Natty::OnError() {\n LOG(LS_ERROR) << __FUNCTION__;\n}\n\nvoid Natty::OnAddStream(webrtc::MediaStreamInterface* stream) {\n\n}\n\nvoid Natty::OnRemoveStream(webrtc::MediaStreamInterface* stream) {\n LOG(INFO) << __FUNCTION__ << \" \" << stream->label();\n stream->AddRef();\n}\n\nvoid Natty::ShowCandidate(const webrtc::IceCandidateInterface* candidate) {\n std::string out;\n const cricket::Candidate& cand = candidate->candidate();\n const talk_base::SocketAddress & address = cand.address(); \n candidate->ToString(&out);\n LOG(INFO) << \"Ice candidate \" << out.c_str();\n}\n\nvoid Natty::Add5Tuple() {\n Json::FastWriter writer;\n\n fivetuple[\"type\"] = \"5-tuple\";\n fivetuple[\"proto\"] = \"udp\";\n outfile << writer.write(fivetuple);\n}\n\nvoid Natty::SaveCandidate(bool status, const webrtc::IceCandidateInterface* candidate) {\n const talk_base::SocketAddress address = candidate->candidate().address();\n const std::string type = candidate->candidate().type();\n fivetuple[status ? \"local\" : \"remote\"] = address.ToString();\n Natty::Add5Tuple();\n}\n\nvoid Natty::OnIceCandidate(const webrtc::IceCandidateInterface* candidate) {\n Json::FastWriter writer;\n Json::Value jmessage;\n\n jmessage[kCandidateSdpMidName] = candidate->sdp_mid();\n jmessage[kCandidateSdpMlineIndexName] = candidate->sdp_mline_index();\n std::string sdp;\n if (!candidate->ToString(&sdp)) {\n LOG(LS_ERROR) << \"Failed to serialize candidate\";\n return;\n }\n\n jmessage[kCandidateSdpName] = sdp;\n outfile << writer.write(jmessage);\n outfile.flush();\n \/\/SaveCandidate(true, candidate);\n \/\/outfile << jmessage;\n}\n\nvoid Natty::OnRenegotiationNeeded() {\n LOG(INFO) << \"Renegotiation needed\";\n}\n\n\n\/\/\n\/\/ PeerConnectionClientObserver implementation.\n\/\/\n\nvoid Natty::OnSignedIn() {\n\n}\n\nvoid Natty::OnDisconnected() {\n printf(\"Disconnecting..\\n\");\n Shutdown();\n}\n\nvoid Natty::OnPeerConnected(int id, const std::string& name) {\n LOG(INFO) << \"Another peer connected \" << id << \" \" << name;\n}\n\nvoid Natty::OnPeerDisconnected(int id) {\n if (id == peer_id_) {\n LOG(INFO) << \"Our peer disconnected\";\n }\n}\n\nvoid Natty::ReadMessage(const std::string& message) {\n Json::Reader reader;\n Json::Value jmessage;\n std::string type;\n std::string json_object;\n\n if (!reader.parse(message, jmessage)) {\n LOG(INFO) << \"Received an unknown message.\";\n return;\n }\n\n GetStringFromJsonObject(jmessage, kSessionDescriptionTypeName, &type);\n\n if (!type.empty()) {\n std::string sdp;\n if (!GetStringFromJsonObject(jmessage, kSessionDescriptionSdpName, &sdp)) {\n LOG(INFO) << \"Can't parse received session description message.\";\n return;\n }\n webrtc::SessionDescriptionInterface* session_description(\n webrtc::CreateSessionDescription(type, sdp));\n if (!session_description) {\n LOG(INFO) << \"Can't parse SDP message\";\n return;\n }\n LOG(INFO) << \"Received session description \" << message << \" sending answer back\";\n\n if (session_description->type() ==\n webrtc::SessionDescriptionInterface::kOffer) {\n peer_connection_->SetRemoteDescription(\n NattySessionObserver::Create(), session_description);\n peer_connection_->CreateAnswer(this, NULL);\n }\n else {\n peer_connection_->SetRemoteDescription(\n NattySessionObserver::Create(), session_description);\n }\n }\n else {\n std::string sdp_mid;\n int sdp_mlineindex = 0;\n std::string sdp;\n if (!GetStringFromJsonObject(jmessage, kCandidateSdpMidName, &sdp_mid) ||\n !GetIntFromJsonObject(jmessage, kCandidateSdpMlineIndexName,\n &sdp_mlineindex) ||\n !GetStringFromJsonObject(jmessage, kCandidateSdpName, &sdp)) {\n LOG(INFO) << \"Can't parse received message\";\n return;\n }\n talk_base::scoped_ptr<webrtc::IceCandidateInterface> candidate(\n webrtc::CreateIceCandidate(sdp_mid, sdp_mlineindex, sdp));\n LOG(INFO) << \"Remote candidate information\";\n\n if (!candidate.get()) {\n LOG(WARNING) << \"Can't parse received candidate message.\";\n return;\n }\n if (!peer_connection_->AddIceCandidate(candidate.get())) {\n LOG(WARNING) << \"Failed to apply the received candidate\";\n return;\n }\n Natty::SaveCandidate(false, candidate.get());\n\n LOG(INFO) << \" Received candidate :\" << message;\n return;\n }\n};\n\nvoid Natty::OnMessageFromPeer(int peer_id, const std::string& message) {\n\n}\n\nvoid Natty::OnDataChannel(webrtc::DataChannelInterface* data_channel) {\n LOG(INFO) << \"New data channel created \" << data_channel;\n}\n\nvoid Natty::OnMessageSent(int err) {\n\n}\n\nvoid Natty::OnIceComplete() {\n LOG(INFO) << \"ICE finished gathering candidates!\";\n \/\/Natty::Shutdown();\n}\n\n\/\/ PeerConnectionObserver implementation.\nvoid Natty::OnServerConnectionFailure() {\n\n}\n\nstd::string GetPeerName() {\n char computer_name[256];\n if (gethostname(computer_name, ARRAY_SIZE(computer_name)) != 0)\n strcpy(computer_name, \"host\");\n std::string ret(GetEnvVarOrDefault(\"USERNAME\", \"user\"));\n ret += '@';\n ret += computer_name;\n return ret;\n} \n\nvoid Natty::setMode(Natty::Mode m) {\n mode = m;\n}\n\nvoid Natty::Init(bool offer) {\n\n talk_base::InitializeSSL();\n InitializePeerConnection();\n if (offer) {\n Natty::setMode(Natty::OFFER);\n peer_connection_->CreateOffer(this, NULL);\n }\n}\n\nvoid Natty::ProcessInput() {\n Natty::InputStream is;\n const talk_base::SocketAddress addr(\"127.0.0.1\", 0);\n\n \/\/talk_base::Socket* socket = thread_->socketserver()->CreateAsyncSocket(addr.family(), SOCK_DGRAM); \n \/\/MessageClient msg(thread_, socket);\n\n \/\/thread_->Start();\n\n \/\/thread_->ProcessMessages(1000);\n \/\/thread_->PostDelayed(100, &msg, 0,\n \/\/ new NattyMessage(\"Hey\"));\n\n \/\/thread->ProcessMessages(2000);\n \/\/natty.get()->Shutdown();\n\n is.read(this);\n\n}\n\n\/* need to update this to accept stdout when the stdout\n * option is blank \n *\n *\/\nvoid Natty::OpenDumpFile(const std::string& filename) {\n if (!filename.empty()) {\n outfile.open(filename.c_str());\n }\n else {\n outfile.copyfmt(std::cout);\n outfile.clear(std::cout.rdstate());\n outfile.basic_ios<char>::rdbuf(std::cout.rdbuf());\n }\n}\n\nvoid Natty::OnSuccess(webrtc::SessionDescriptionInterface* desc) {\n LOG(INFO) << \"Setting local description\";\n peer_connection_->SetLocalDescription(\n NattySessionObserver::Create(), desc);\n Json::FastWriter writer;\n Json::Value jmessage;\n jmessage[kSessionDescriptionTypeName] = desc->type();\n\n std::string sdp;\n desc->ToString(&sdp);\n jmessage[kSessionDescriptionSdpName] = sdp;\n outfile << writer.write(jmessage); \n outfile.flush();\n}\n\nvoid Natty::OnFailure(const std::string& error) {\n LOG(LERROR) << error;\n}\n\nvoid Natty::SendMessage(const std::string& json_object) {\n\n}\n\nvoid Natty::DisconnectFromServer() {\n if (client_->is_connected())\n client_->SignOut();\n}\n\n<|endoftext|>"} {"text":"<commit_before>#include \"note.h\"\n#include <QDebug>\n#include <QFile>\n#include <QPushButton>\n#include <QDir>\n\nNote::Note(QWidget *parent) : QDialog (parent){\n\n setupUi(this);\n\n timer = new QTimer(this);\n timer->setInterval(1000);\n timer->setSingleShot(true);\n\n connect(textEdit, SIGNAL(textChanged()), timer, SLOT(start()));\n connect(timer, SIGNAL(timeout()), this, SLOT(saveNote()));\n connect(buttonBox->button(QDialogButtonBox::Ok), SIGNAL(clicked(bool)), this, SLOT(saveNote()));\n connect(buttonBox->button(QDialogButtonBox::Cancel), SIGNAL(clicked(bool)), this, SLOT(dontSave()));\n connect(toolB, SIGNAL(clicked()), this, SLOT(boldText()));\n connect(toolI, SIGNAL(clicked()), this, SLOT(italicText()));\n connect(toolU, SIGNAL(clicked()), this, SLOT(underlinedText()));\n connect(fontComboBox, SIGNAL(currentFontChanged(const QFont &)), this, SLOT(fontOfText()));\n connect(fontSizeSpin, SIGNAL(valueChanged(int)), this, SLOT(pointSizeOfText()));\n connect(textEdit, SIGNAL(cursorPositionChanged()), this, SLOT(getFontAndPointSizeOfText()));\n}\n\nNote::~Note(){}\n\nvoid Note::saveNote(){\n QFile file(notesPath);\n if(!file.open(QIODevice::WriteOnly | QIODevice::Truncate))\n return;\n QTextStream stream(&file);\n stream << textEdit->toHtml();\n file.close();\n \/\/TODO: create real notes (so far only journal)\n}\n\nvoid Note::dontSave(){\n QFile file(notesPath);\n if(!file.open(QIODevice::WriteOnly | QIODevice::Truncate))\n return;\n QTextStream stream(&file);\n stream << text;\n file.close();\n}\n\nQTextCharFormat Note::getFormatOnWordOrSelection(){\n QTextCursor cursor = textEdit->textCursor();\n if (!cursor.hasSelection())\n cursor.select(QTextCursor::WordUnderCursor);\n return cursor.charFormat();\n}\n\nvoid Note::mergeFormatOnWordOrSelection(const QTextCharFormat &format){\n QTextCursor cursor = textEdit->textCursor();\n if (!cursor.hasSelection())\n cursor.select(QTextCursor::WordUnderCursor);\n cursor.mergeCharFormat(format);\n textEdit->mergeCurrentCharFormat(format);\n}\n\nvoid Note::boldText(){\n QTextCharFormat fmt;\n if(getFormatOnWordOrSelection().fontWeight() == 75)\n fmt.setFontWeight(QFont::Normal);\n else\n fmt.setFontWeight(QFont::Bold);\n mergeFormatOnWordOrSelection(fmt);\n}\n\nvoid Note::italicText(){\n QTextCharFormat fmt;\n if(getFormatOnWordOrSelection().fontItalic())\n fmt.setFontItalic(false);\n else\n fmt.setFontItalic(true);\n mergeFormatOnWordOrSelection(fmt);\n}\n\nvoid Note::underlinedText(){\/\/TODO:for some reason (under-)line disappears while text is selected\n QTextCharFormat fmt;\n if(getFormatOnWordOrSelection().fontUnderline())\n fmt.setFontUnderline(false);\n else\n fmt.setFontUnderline(true);\n mergeFormatOnWordOrSelection(fmt);\n}\n\nvoid Note::getFontAndPointSizeOfText(){\n fontComboBox->setCurrentFont(getFormatOnWordOrSelection().font());\n fontSizeSpin->setValue(getFormatOnWordOrSelection().fontPointSize());\n}\n\nvoid Note::fontOfText(){\n QTextCharFormat fmt;\n fmt.setFont(fontComboBox->currentFont());\n mergeFormatOnWordOrSelection(fmt);\n}\n\nvoid Note::pointSizeOfText(){\n QTextCharFormat fmt;\n fmt.setFontPointSize(fontSizeSpin->value());\n mergeFormatOnWordOrSelection(fmt);\n}\n\nvoid Note::showEvent(QShowEvent* show_Note){\n textEdit->setHtml(text);\n QWidget::showEvent(show_Note);\n}\n\nvoid Note::closeEvent(QCloseEvent* close_Note){\n dontSave();\n QWidget::closeEvent(close_Note);\n}\n<commit_msg>Fix introduces new Bug When moving the text cursor the current font will be set in the combobox and spinbox. Bug: While moving the text cursor or selecting text the font changes.<commit_after>#include \"note.h\"\n#include <QDebug>\n#include <QFile>\n#include <QPushButton>\n#include <QDir>\n\nNote::Note(QWidget *parent) : QDialog (parent){\n\n setupUi(this);\n\n timer = new QTimer(this);\n timer->setInterval(1000);\n timer->setSingleShot(true);\n\n connect(textEdit, SIGNAL(textChanged()), timer, SLOT(start()));\n connect(timer, SIGNAL(timeout()), this, SLOT(saveNote()));\n connect(buttonBox->button(QDialogButtonBox::Ok), SIGNAL(clicked(bool)), this, SLOT(saveNote()));\n connect(buttonBox->button(QDialogButtonBox::Cancel), SIGNAL(clicked(bool)), this, SLOT(dontSave()));\n connect(toolB, SIGNAL(clicked()), this, SLOT(boldText()));\n connect(toolI, SIGNAL(clicked()), this, SLOT(italicText()));\n connect(toolU, SIGNAL(clicked()), this, SLOT(underlinedText()));\n connect(fontComboBox, SIGNAL(currentFontChanged(const QFont &)), this, SLOT(fontOfText()));\n connect(fontSizeSpin, SIGNAL(valueChanged(int)), this, SLOT(pointSizeOfText()));\n connect(textEdit, SIGNAL(cursorPositionChanged()), this, SLOT(getFontAndPointSizeOfText()));\n}\n\nNote::~Note(){}\n\nvoid Note::saveNote(){\n QFile file(notesPath);\n if(!file.open(QIODevice::WriteOnly | QIODevice::Truncate))\n return;\n QTextStream stream(&file);\n stream << textEdit->toHtml();\n file.close();\n \/\/TODO: create real notes (so far only journal)\n}\n\nvoid Note::dontSave(){\n QFile file(notesPath);\n if(!file.open(QIODevice::WriteOnly | QIODevice::Truncate))\n return;\n QTextStream stream(&file);\n stream << text;\n file.close();\n}\n\nQTextCharFormat Note::getFormatOnWordOrSelection(){\n QTextCursor cursor = textEdit->textCursor();\n if (!cursor.hasSelection())\n cursor.select(QTextCursor::WordUnderCursor);\n return cursor.charFormat();\n}\n\nvoid Note::mergeFormatOnWordOrSelection(const QTextCharFormat &format){\n QTextCursor cursor = textEdit->textCursor();\n if (!cursor.hasSelection())\n cursor.select(QTextCursor::WordUnderCursor);\n cursor.mergeCharFormat(format);\n textEdit->mergeCurrentCharFormat(format);\n}\n\nvoid Note::boldText(){\n QTextCharFormat fmt;\n if(getFormatOnWordOrSelection().fontWeight() == 75)\n fmt.setFontWeight(QFont::Normal);\n else\n fmt.setFontWeight(QFont::Bold);\n mergeFormatOnWordOrSelection(fmt);\n}\n\nvoid Note::italicText(){\n QTextCharFormat fmt;\n if(getFormatOnWordOrSelection().fontItalic())\n fmt.setFontItalic(false);\n else\n fmt.setFontItalic(true);\n mergeFormatOnWordOrSelection(fmt);\n}\n\nvoid Note::underlinedText(){\/\/TODO:for some reason (under-)line disappears while text is selected\n QTextCharFormat fmt;\n if(getFormatOnWordOrSelection().fontUnderline())\n fmt.setFontUnderline(false);\n else\n fmt.setFontUnderline(true);\n mergeFormatOnWordOrSelection(fmt);\n}\n\nvoid Note::getFontAndPointSizeOfText(){\n fontComboBox->setCurrentFont(getFormatOnWordOrSelection().font());\n fontSizeSpin->setValue(getFormatOnWordOrSelection().fontPointSize());\n \/\/TODO: this causes for some reason the text to change it's font settings when the text cursor changes its position or text is being selected...\n}\n\nvoid Note::fontOfText(){\n QTextCharFormat fmt;\n fmt.setFont(fontComboBox->currentFont());\n fmt.setFontPointSize(fontSizeSpin->value());\n mergeFormatOnWordOrSelection(fmt);\n}\n\nvoid Note::pointSizeOfText(){\n QTextCharFormat fmt;\n fmt.setFontPointSize(fontSizeSpin->value());\n mergeFormatOnWordOrSelection(fmt);\n}\n\nvoid Note::showEvent(QShowEvent* show_Note){\n textEdit->setHtml(text);\n QWidget::showEvent(show_Note);\n}\n\nvoid Note::closeEvent(QCloseEvent* close_Note){\n dontSave();\n QWidget::closeEvent(close_Note);\n}\n<|endoftext|>"} {"text":"<commit_before>\/\/Author: Julian Yi\n\/\/Date Created: 18 July 2017\n\/\/File Description: .cpp for the pawn class.\n#include <iostream>\n#include <string>\n#include \"pieces.h\"\n#include \"pawn.h\"\n\nusing namespace std;\n\nvoid Pawn::move(coord newPos)\n{\n\tsetPosition(newPos);\n\n}\n\ncoordList Pawn::calculateMoves(coord boundary) const\n{\n\tcoordList validMoves;\n\t\/\/ Pawn can move in 4 directions left, right, down, and up by 1.\n\tif (position.x + 1 <= boundary.x) {\n\t\tvalidMoves.push_back(coord{position.x + 1, position.y});\n\t}\n\tif (position.x - 1 >= 0) {\n\t\tvalidMoves.push_back(coord{position.x - 1, position.y});\n\t}\n\n\tif (position.y + 1 <= boundary.y) {\n\t\tvalidMoves.push_back(coord{position.x, position.y + 1});\n\t}\n\tif (position.y - 1 >= 0) {\n\t\tvalidMoves.push_back(coord{position.x, position.y - 1});\n\t}\n\treturn validMoves;\n}\n\nvoid Pawn::promote()\n{\n\t\/\/do things\n}\n<commit_msg>Added outline to promote function. Need to fill in<commit_after>\/\/Author: Julian Yi\n\/\/Date Created: 18 July 2017\n\/\/File Description: .cpp for the pawn class.\n#include <iostream>\n#include <string>\n#include \"pieces.h\"\n#include \"pawn.h\"\n#include \"queen.h\"\n#include \"rook.h\"\n#include \"bishop.h\"\n#include \"knight.h\"\n\nusing namespace std;\n\nvoid Pawn::move(coord newPos)\n{\n\tsetPosition(newPos);\n\n}\n\ncoordList Pawn::calculateMoves(coord boundary) const\n{\n\tcoordList validMoves;\n\t\/\/ Pawn can move in 4 directions left, right, down, and up by 1.\n\tif (position.x + 1 <= boundary.x) {\n\t\tvalidMoves.push_back(coord{position.x + 1, position.y});\n\t}\n\tif (position.x - 1 >= 0) {\n\t\tvalidMoves.push_back(coord{position.x - 1, position.y});\n\t}\n\n\tif (position.y + 1 <= boundary.y) {\n\t\tvalidMoves.push_back(coord{position.x, position.y + 1});\n\t}\n\tif (position.y - 1 >= 0) {\n\t\tvalidMoves.push_back(coord{position.x, position.y - 1});\n\t}\n\treturn validMoves;\n}\n\nvoid Pawn::promote()\n{\n\t\/\/to do\n\t\/\/check y coordinate\n\t\/\/if y coordinate == 8\n\t\/\/then piece should be promoted\n\t\/\/in order for that to happen, the pawn object must be destroyed\n\t\/\/and then it should be replaced with the promoted piece object. \n\tstring promotedPiece = \"\";\n\n\tif (position.y == 8)\n\t{\n\t\tstd::cout << \"Promote pawn to: \";\n\t\tstd::cin >> promotedPiece;\n\t\tif(promotedPiece == \"Queen\" || promotedPiece == \"queen\")\n\t\t{\n\t\t\t\/\/create queen object\n\t\t\t\/\/give queen pawn's coordinates\n\t\t\t\/\/destroy pawn\n\t\t}\n\t\tif(promotedPiece == \"Rook\" || promotedPiece == \"rook\")\n\t\t{\n\t\t\t\/\/create rook object\n\t\t\t\/\/give rook pawn's coordinates\n\t\t\t\/\/destroy pawn\n\t\t}\n\t\tif(promotedPiece == \"Bishop\" || promotedPiece == \"bishop\")\n\t\t{\n\t\t\t\/\/create bishop object\n\t\t\t\/\/give bishop pawn's coordinates\n\t\t\t\/\/destroy pawn\n\t\t}\n\t\tif(promotedPiece == \"Knight\" || promotedPiece == \"knight\")\n\t\t{\n\t\t\t\/\/create knight object\n\t\t\t\/\/give knight pawn's coordinates\n\t\t\t\/\/destroy pawn\n\t\t}\n\t}\n}\n<|endoftext|>"} {"text":"<commit_before>#include <chrono>\n#include <iostream>\n#include \"logger.hpp\"\n#include \"config.hpp\"\n#include \"peers.hpp\"\n#include \"utility.hpp\"\n\nPeer::Peer(std::string IP, std::string port, class User* u, bool seeding, unsigned long left, unsigned long stats, unsigned int torrentID, std::string client, std::string peerID) {\n\tLOG_INFO(\"Creating peer on torrent \" + std::to_string(torrentID) + \" using client \" + client);\n\tuser = u;\n\ttotal_stats = stats;\n\tstats = 0;\n\tthis->left = left;\n\tthis->seeding = seeding;\n\tcompleted = seeding;\n\tactive = true;\n\tthis->IP = IP;\n\tthis->hexIPPort = Utility::ip_port_hex_encode(IP, port);\n\tthis->peerID = peerID;\n\tthis->torrentID = torrentID;\n\tthis->client = client;\n\ttimespent = 0;\n\tauto duration = std::chrono::system_clock::now().time_since_epoch();\n\tlastUpdate = std::chrono::duration_cast<std::chrono::seconds>(duration).count();\n\tthis->speed = 0;\n}\n\nUser* Peer::getUser() {\n\treturn user;\n}\n\nconst std::string& Peer::getPeerID() {\n\treturn peerID;\n}\n\nconst std::string& Peer::getIP() {\n\treturn IP;\n}\n\nconst std::string& Peer::getHexIPPort() {\n\treturn hexIPPort;\n}\n\nconst std::string& Peer::getClient() {\n\treturn client;\n}\n\nvoid Peer::updateStats (unsigned long stats, unsigned long left, unsigned int corrupt, long long now) {\n\tthis->stats = stats - total_stats;\n\ttotal_stats = stats;\n\tthis->left = left;\n\tif (now > lastUpdate)\n\t\tspeed = (this->stats)\/(now-lastUpdate);\n\telse\n\t\tspeed = 0;\n\tif (seeding)\n\t\ttimespent += now - lastUpdate;\n\tthis->corrupt = corrupt;\n\tlastUpdate = now;\n}\n\nunsigned long Peer::getLeft() {\n\treturn left;\n}\n\nlong long Peer::getLastUpdate() {\n\treturn lastUpdate;\n}\n\nbool Peer::isSeeding() {\n\treturn seeding;\n}\n\nbool Peer::isCompleted() {\n\treturn completed;\n}\n\nunsigned long Peer::getStats() {\n\treturn stats;\n}\n\nunsigned long Peer::getTotalStats() {\n\treturn total_stats;\n}\n\nunsigned int Peer::getTorrentID() {\n\treturn torrentID;\n}\n\nvoid Peer::snatched() {\n\tcompleted = true;\n}\n\nbool Peer::isSnatched() {\n\treturn completed;\n}\n\nbool Peer::timedOut(long long now) {\n\treturn (now - lastUpdate) > Config::getInt(\"timeout\");\n}\n\nunsigned long Peer::getTimespent() {\n\treturn timespent;\n}\n\nbool Peer::isActive() {\n\treturn active;\n}\n\nvoid Peer::inactive() {\n\tactive = false;\n}\n\nunsigned int Peer::getSpeed() {\n\treturn speed;\n}\n\nunsigned int Peer::getCorrupt() {\n\treturn corrupt;\n}\n<commit_msg>fix timespent<commit_after>#include <chrono>\n#include <iostream>\n#include \"logger.hpp\"\n#include \"config.hpp\"\n#include \"peers.hpp\"\n#include \"utility.hpp\"\n\nPeer::Peer(std::string IP, std::string port, class User* u, bool seeding, unsigned long left, unsigned long stats, unsigned int torrentID, std::string client, std::string peerID) {\n\tLOG_INFO(\"Creating peer on torrent \" + std::to_string(torrentID) + \" using client \" + client);\n\tuser = u;\n\ttotal_stats = stats;\n\tstats = 0;\n\tthis->left = left;\n\tthis->seeding = seeding;\n\tcompleted = seeding;\n\tactive = true;\n\tthis->IP = IP;\n\tthis->hexIPPort = Utility::ip_port_hex_encode(IP, port);\n\tthis->peerID = peerID;\n\tthis->torrentID = torrentID;\n\tthis->client = client;\n\ttimespent = 0;\n\tauto duration = std::chrono::system_clock::now().time_since_epoch();\n\tlastUpdate = std::chrono::duration_cast<std::chrono::seconds>(duration).count();\n\tthis->speed = 0;\n}\n\nUser* Peer::getUser() {\n\treturn user;\n}\n\nconst std::string& Peer::getPeerID() {\n\treturn peerID;\n}\n\nconst std::string& Peer::getIP() {\n\treturn IP;\n}\n\nconst std::string& Peer::getHexIPPort() {\n\treturn hexIPPort;\n}\n\nconst std::string& Peer::getClient() {\n\treturn client;\n}\n\nvoid Peer::updateStats (unsigned long stats, unsigned long left, unsigned int corrupt, long long now) {\n\tthis->stats = stats - total_stats;\n\ttotal_stats = stats;\n\tthis->left = left;\n\tif (now > lastUpdate)\n\t\tspeed = (this->stats)\/(now-lastUpdate);\n\telse\n\t\tspeed = 0;\n\tif (seeding)\n\t\ttimespent += now - lastUpdate;\n\tthis->corrupt = corrupt;\n\tlastUpdate = now;\n}\n\nunsigned long Peer::getLeft() {\n\treturn left;\n}\n\nlong long Peer::getLastUpdate() {\n\treturn lastUpdate;\n}\n\nbool Peer::isSeeding() {\n\treturn seeding;\n}\n\nbool Peer::isCompleted() {\n\treturn completed;\n}\n\nunsigned long Peer::getStats() {\n\treturn stats;\n}\n\nunsigned long Peer::getTotalStats() {\n\treturn total_stats;\n}\n\nunsigned int Peer::getTorrentID() {\n\treturn torrentID;\n}\n\nvoid Peer::snatched() {\n\tcompleted = true;\n}\n\nbool Peer::isSnatched() {\n\treturn completed;\n}\n\nbool Peer::timedOut(long long now) {\n\treturn (now - lastUpdate) > Config::getInt(\"timeout\");\n}\n\nunsigned long Peer::getTimespent() {\n\tunsigned long tmp = timespent;\n\ttimespent = 0;\n\treturn tmp;\n}\n\nbool Peer::isActive() {\n\treturn active;\n}\n\nvoid Peer::inactive() {\n\tactive = false;\n}\n\nunsigned int Peer::getSpeed() {\n\treturn speed;\n}\n\nunsigned int Peer::getCorrupt() {\n\treturn corrupt;\n}\n<|endoftext|>"} {"text":"<commit_before>\/*\n * Copyright (c) 2003-2014, John Wiegley. All rights 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 New Artisans LLC 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 <system.hh>\n\n#include \"ptree.h\"\n#include \"xact.h\"\n#include \"post.h\"\n#include \"account.h\"\n#include \"session.h\"\n#include \"report.h\"\n\nnamespace ledger {\n\nnamespace {\n bool account_visited_p(const account_t& acct) {\n return ((acct.has_xdata() &&\n acct.xdata().has_flags(ACCOUNT_EXT_VISITED)) ||\n acct.children_with_flags(ACCOUNT_EXT_VISITED));\n }\n}\n\nvoid format_ptree::flush()\n{\n std::ostream& out(report.output_stream);\n\n property_tree::ptree pt;\n\n pt.put(\"ledger.<xmlattr>.version\",\n lexical_cast<string>((Ledger_VERSION_MAJOR << 16) |\n (Ledger_VERSION_MINOR << 8) |\n Ledger_VERSION_PATCH));\n\n property_tree::ptree& ct(pt.put(\"ledger.commodities\", \"\"));\n foreach (const commodities_pair& pair, commodities)\n put_commodity(ct.add(\"commodity\", \"\"), *pair.second, true);\n\n property_tree::ptree& at(pt.put(\"ledger.accounts\", \"\"));\n put_account(at.add(\"account\", \"\"), *report.session.journal->master, account_visited_p);\n\n property_tree::ptree& tt(pt.put(\"ledger.transactions\", \"\"));\n foreach (const xact_t * xact, transactions) {\n property_tree::ptree& t(tt.add(\"transaction\", \"\"));\n put_xact(t, *xact);\n\n property_tree::ptree& post_tree(t.put(\"postings\", \"\"));\n foreach (const post_t * post, xact->posts)\n if (post->has_xdata() &&\n post->xdata().has_flags(POST_EXT_VISITED))\n put_post(post_tree.add(\"posting\", \"\"), *post);\n }\n\n switch (format) {\n case FORMAT_XML:\n auto indented = property_tree::xml_writer_make_settings<std::string> (' ', 2);\n property_tree::write_xml(out, pt, indented);\n out << std::endl;\n break;\n }\n}\n\nvoid format_ptree::operator()(post_t& post)\n{\n assert(post.xdata().has_flags(POST_EXT_VISITED));\n\n commodities.insert(commodities_pair(post.amount.commodity().symbol(),\n &post.amount.commodity()));\n\n std::pair<std::set<xact_t *>::iterator, bool> result =\n transactions_set.insert(post.xact);\n if (result.second) \/\/ we haven't seen this transaction before\n transactions.push_back(post.xact);\n}\n\n} \/\/ namespace ledger\n<commit_msg>Revert \"fix \"type 'char' cannot be used prior to '::'\"\"<commit_after>\/*\n * Copyright (c) 2003-2014, John Wiegley. All rights 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 New Artisans LLC 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 <system.hh>\n\n#include \"ptree.h\"\n#include \"xact.h\"\n#include \"post.h\"\n#include \"account.h\"\n#include \"session.h\"\n#include \"report.h\"\n\nnamespace ledger {\n\nnamespace {\n bool account_visited_p(const account_t& acct) {\n return ((acct.has_xdata() &&\n acct.xdata().has_flags(ACCOUNT_EXT_VISITED)) ||\n acct.children_with_flags(ACCOUNT_EXT_VISITED));\n }\n}\n\nvoid format_ptree::flush()\n{\n std::ostream& out(report.output_stream);\n\n property_tree::ptree pt;\n\n pt.put(\"ledger.<xmlattr>.version\",\n lexical_cast<string>((Ledger_VERSION_MAJOR << 16) |\n (Ledger_VERSION_MINOR << 8) |\n Ledger_VERSION_PATCH));\n\n property_tree::ptree& ct(pt.put(\"ledger.commodities\", \"\"));\n foreach (const commodities_pair& pair, commodities)\n put_commodity(ct.add(\"commodity\", \"\"), *pair.second, true);\n\n property_tree::ptree& at(pt.put(\"ledger.accounts\", \"\"));\n put_account(at.add(\"account\", \"\"), *report.session.journal->master, account_visited_p);\n\n property_tree::ptree& tt(pt.put(\"ledger.transactions\", \"\"));\n foreach (const xact_t * xact, transactions) {\n property_tree::ptree& t(tt.add(\"transaction\", \"\"));\n put_xact(t, *xact);\n\n property_tree::ptree& post_tree(t.put(\"postings\", \"\"));\n foreach (const post_t * post, xact->posts)\n if (post->has_xdata() &&\n post->xdata().has_flags(POST_EXT_VISITED))\n put_post(post_tree.add(\"posting\", \"\"), *post);\n }\n\n switch (format) {\n case FORMAT_XML:\n property_tree::xml_writer_settings<char> indented(' ', 2);\n property_tree::write_xml(out, pt, indented);\n out << std::endl;\n break;\n }\n}\n\nvoid format_ptree::operator()(post_t& post)\n{\n assert(post.xdata().has_flags(POST_EXT_VISITED));\n\n commodities.insert(commodities_pair(post.amount.commodity().symbol(),\n &post.amount.commodity()));\n\n std::pair<std::set<xact_t *>::iterator, bool> result =\n transactions_set.insert(post.xact);\n if (result.second) \/\/ we haven't seen this transaction before\n transactions.push_back(post.xact);\n}\n\n} \/\/ namespace ledger\n<|endoftext|>"} {"text":"<commit_before>#include <stdlib.h>\n#include <iostream>\n#include <vector>\n#include <unistd.h>\n#include <dirent.h>\n#include \"omp.h\"\n\nvoid helpCheck(char *argv[]) {\n\tif (argv[1] == std::string(\"-h\") || argv[1] == std::string(\"--help\")) {\n\t\tstd::cout << \"\\nptxv - Parallel Tar XZ by Ryan Chui (2017)\\n\" << std::endl;\n\t\texit(0);\n\t}\n}\n\nvoid findAll(int *numFiles, const char *cwd) {\n\tDIR *dir;\n\tstruct dirent *ent;\n\n\t\/\/ Check if cwd is a directory\n\tif ((dir = opendir(cwd)) != NULL) {\n\t\t\/\/ Get all file paths within directory.\n\t\twhile ((ent = readdir (dir)) != NULL) {\n\t\t\tstd::string fileBuff = std::string(ent -> d_name);\n\t\t\tif (fileBuff != \".\" && fileBuff != \"..\") {\n\t\t\t\tDIR *dir2;\n\t\t\t\tstd::string filePath = std::string(cwd) + \"\/\" + fileBuff;\n\t\t\t\t\/\/ Check if file path is a directory.\n\t\t\t\tif ((dir2 = opendir(filePath.c_str())) != NULL) {\n\t\t\t\t\tclosedir(dir2);\n\t\t\t\t\tfindAll(numFiles, filePath.c_str());\n\t\t\t\t} else {\n\t\t\t\t\t*numFiles += 1;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tclosedir(dir);\n\t}\n}\n\nvoid getPaths(std::vector<std::string> *filePaths, const char *cwd, std::string rootPath) {\n\tDIR *dir;\n\tstruct dirent *ent;\n\n\t\/\/ Check if cwd is a directory\n\tif ((dir = opendir(cwd)) != NULL) {\n\t\t\/\/ Get all file paths within directory.\n\t\twhile ((ent = readdir (dir)) != NULL) {\n\t\t\tstd::string fileBuff = std::string(ent -> d_name);\n\t\t\tif (fileBuff != \".\" && fileBuff != \"..\") {\n\t\t\t\tDIR *dir2;\n\t\t\t\tstd::string filePath = std::string(cwd) + \"\/\" + fileBuff;\n\t\t\t\t\/\/ Check if file path is a directory.\n\t\t\t\tif ((dir2 = opendir(filePath.c_str())) != NULL) {\n\t\t\t\t\tclosedir(dir2);\n\t\t\t\t\tgetPaths(filePaths, filePath.c_str(), rootPath + fileBuff + \"\/\");\n\t\t\t\t} else {\n\t\t\t\t\tfilePaths->push_back(rootPath + fileBuff);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tclosedir(dir);\n\t}\n}\n\nvoid compress(std::vector<std::string> *filePaths) {\n\t\/\/ #pragma omp parallel for schedule(dynamic)\n\tfor (int i = 0; i < filePaths->size(); ++i) {\n\t\tstd::cout << filePaths->at(i) << std::endl;\n\t\tstd::string command = \"tar cxvf test.\" + std::to_string(i) + \".tar \" + filePaths->at(i);\n\t\tsystem(command.c_str());\n\t}\n}\n\nchar cwd [PATH_MAX];\n\nint main(int argc, char *argv[]) {\n\tint *numFiles = new int(0);\n\t\n\tif (argc > 1) {\n\t\thelpCheck(argv);\n\t}\n\n\tgetcwd(cwd, PATH_MAX);\n\tfindAll(numFiles, cwd);\n\t\/\/ std::cout << *numFiles << std::endl;\n\n\tstd::vector<std::string> *filePaths = new std::vector<std::string>();\n\n\tgetPaths(filePaths, cwd, \"\");\n\tcompress(filePaths);\n\n\tdelete(numFiles);\n\treturn 0;\n}\n<commit_msg>used wrong command<commit_after>#include <stdlib.h>\n#include <iostream>\n#include <vector>\n#include <unistd.h>\n#include <dirent.h>\n#include \"omp.h\"\n\nvoid helpCheck(char *argv[]) {\n\tif (argv[1] == std::string(\"-h\") || argv[1] == std::string(\"--help\")) {\n\t\tstd::cout << \"\\nptxv - Parallel Tar XZ by Ryan Chui (2017)\\n\" << std::endl;\n\t\texit(0);\n\t}\n}\n\nvoid findAll(int *numFiles, const char *cwd) {\n\tDIR *dir;\n\tstruct dirent *ent;\n\n\t\/\/ Check if cwd is a directory\n\tif ((dir = opendir(cwd)) != NULL) {\n\t\t\/\/ Get all file paths within directory.\n\t\twhile ((ent = readdir (dir)) != NULL) {\n\t\t\tstd::string fileBuff = std::string(ent -> d_name);\n\t\t\tif (fileBuff != \".\" && fileBuff != \"..\") {\n\t\t\t\tDIR *dir2;\n\t\t\t\tstd::string filePath = std::string(cwd) + \"\/\" + fileBuff;\n\t\t\t\t\/\/ Check if file path is a directory.\n\t\t\t\tif ((dir2 = opendir(filePath.c_str())) != NULL) {\n\t\t\t\t\tclosedir(dir2);\n\t\t\t\t\tfindAll(numFiles, filePath.c_str());\n\t\t\t\t} else {\n\t\t\t\t\t*numFiles += 1;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tclosedir(dir);\n\t}\n}\n\nvoid getPaths(std::vector<std::string> *filePaths, const char *cwd, std::string rootPath) {\n\tDIR *dir;\n\tstruct dirent *ent;\n\n\t\/\/ Check if cwd is a directory\n\tif ((dir = opendir(cwd)) != NULL) {\n\t\t\/\/ Get all file paths within directory.\n\t\twhile ((ent = readdir (dir)) != NULL) {\n\t\t\tstd::string fileBuff = std::string(ent -> d_name);\n\t\t\tif (fileBuff != \".\" && fileBuff != \"..\") {\n\t\t\t\tDIR *dir2;\n\t\t\t\tstd::string filePath = std::string(cwd) + \"\/\" + fileBuff;\n\t\t\t\t\/\/ Check if file path is a directory.\n\t\t\t\tif ((dir2 = opendir(filePath.c_str())) != NULL) {\n\t\t\t\t\tclosedir(dir2);\n\t\t\t\t\tgetPaths(filePaths, filePath.c_str(), rootPath + fileBuff + \"\/\");\n\t\t\t\t} else {\n\t\t\t\t\tfilePaths->push_back(rootPath + fileBuff);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tclosedir(dir);\n\t}\n}\n\nvoid compress(std::vector<std::string> *filePaths) {\n\t\/\/ #pragma omp parallel for schedule(dynamic)\n\tfor (int i = 0; i < filePaths->size(); ++i) {\n\t\tstd::cout << filePaths->at(i) << std::endl;\n\t\tstd::string command = \"tar cJvf test.\" + std::to_string(i) + \".tar \" + filePaths->at(i);\n\t\tsystem(command.c_str());\n\t}\n}\n\nchar cwd [PATH_MAX];\n\nint main(int argc, char *argv[]) {\n\tint *numFiles = new int(0);\n\t\n\tif (argc > 1) {\n\t\thelpCheck(argv);\n\t}\n\n\tgetcwd(cwd, PATH_MAX);\n\tfindAll(numFiles, cwd);\n\t\/\/ std::cout << *numFiles << std::endl;\n\n\tstd::vector<std::string> *filePaths = new std::vector<std::string>();\n\n\tgetPaths(filePaths, cwd, \"\");\n\tcompress(filePaths);\n\n\tdelete(numFiles);\n\treturn 0;\n}\n<|endoftext|>"} {"text":"<commit_before>#include <sstream>\n\n#include <qpdf\/Constants.h>\n#include <qpdf\/Types.h>\n#include <qpdf\/DLL.h>\n#include <qpdf\/QPDFExc.hh>\n#include <qpdf\/QPDFObjGen.hh>\n#include <qpdf\/QPDFXRefEntry.hh>\n#include <qpdf\/PointerHolder.hh>\n#include <qpdf\/Buffer.hh>\n#include <qpdf\/QPDFObjectHandle.hh>\n#include <qpdf\/QPDF.hh>\n#include <qpdf\/QPDFWriter.hh>\n\n#include <pybind11\/pybind11.h>\n#include <pybind11\/stl.h>\n\n#include \"pikepdf.h\"\n\nusing namespace std::literals::string_literals;\n\nextern \"C\" const char* qpdf_get_qpdf_version();\n\ntemplate <typename T>\nvoid kwargs_to_method(py::kwargs kwargs, const char* key, std::unique_ptr<QPDF> &q, void (QPDF::*callback)(T))\n{\n try {\n if (kwargs.contains(key)) {\n auto v = kwargs[key].cast<T>();\n ((*q).*callback)(v); \/\/ <-- Cute\n }\n } catch (py::cast_error &e) {\n throw py::type_error(std::string(key) + \": unsupported argument type\");\n }\n}\n\n\n\/* Convert a Python object to a filesystem encoded path\n * Use Python's os.fspath() which accepts os.PathLike (str, bytes, pathlib.Path)\n * and returns bytes encoded in the filesystem encoding.\n * Cast to a string without transcoding.\n *\/\nstd::string fsencode_filename(py::object py_filename)\n{\n auto fspath = py::module::import(\"pikepdf._cpphelpers\").attr(\"fspath\");\n std::string filename;\n\n try {\n auto py_encoded_filename = fspath(py_filename);\n filename = py_encoded_filename.cast<std::string>();\n } catch (py::cast_error &e) {\n throw py::type_error(\"expected pathlike object\");\n }\n\n return filename;\n}\n\nvoid check_stream_is_usable(py::object stream)\n{\n auto TextIOBase = py::module::import(\"io\").attr(\"TextIOBase\");\n\n if (py::isinstance(stream, TextIOBase)) {\n throw py::type_error(\"stream must be binary (no transcoding) and seekable\");\n }\n}\n\nauto open_pdf(py::args args, py::kwargs kwargs)\n{\n auto q = std::make_unique<QPDF>();\n if (args.size() < 1)\n throw py::value_error(\"not enough arguments\");\n if (args.size() > 2)\n throw py::value_error(\"too many arguments\");\n\n std::string password;\n\n q->setSuppressWarnings(true);\n if (kwargs) {\n if (kwargs.contains(\"password\")) {\n auto v = kwargs[\"password\"].cast<std::string>();\n password = v;\n }\n kwargs_to_method(kwargs, \"ignore_xref_streams\", q, &QPDF::setIgnoreXRefStreams);\n kwargs_to_method(kwargs, \"suppress_warnings\", q, &QPDF::setSuppressWarnings);\n kwargs_to_method(kwargs, \"attempt_recovery\", q, &QPDF::setAttemptRecovery);\n }\n\n if (py::hasattr(args[0], \"read\") && py::hasattr(args[0], \"seek\")) {\n \/\/ Python code gave us an object with a stream interface\n py::object stream = args[0];\n\n check_stream_is_usable(stream);\n\n py::object read = stream.attr(\"read\");\n py::object pydata = read();\n py::bytes data = pydata.cast<py::bytes>();\n char *buffer;\n ssize_t length;\n\n \/\/ Is it safe to grab .ptr() like this? Not sure; probably safe under\n \/\/ GIL only\n PYBIND11_BYTES_AS_STRING_AND_SIZE(data.ptr(), &buffer, &length);\n\n \/\/ libqpdf will create a copy of this memory and attach it\n \/\/ to 'q'\n \/\/ This could be improved by subclassing InputSource into C++\n \/\/ and creating a version that obtains its data from its Python object,\n \/\/ but that is much more complex.\n q->processMemoryFile(\"memory\", buffer, length, password.c_str());\n } else {\n std::string filename = fsencode_filename(args[0]);\n \/\/ We can release GIL because Python knows nothing about q at this\n \/\/ point; this could also take a moment for large files\n py::gil_scoped_release release;\n q->processFile(filename.c_str(), password.c_str());\n }\n\n return q;\n}\n\n\nvoid save_pdf(\n QPDF &q,\n py::object filename_or_stream,\n bool static_id=false,\n bool preserve_pdfa=false,\n std::string min_version=\"\"s,\n std::string force_version=\"\"s,\n qpdf_object_stream_e object_stream_mode=qpdf_o_preserve,\n qpdf_stream_data_e stream_data_mode=qpdf_s_preserve)\n{\n QPDFWriter w(q);\n\n \/\/ Parameters\n if (static_id) {\n w.setStaticID(true);\n w.setStreamDataMode(qpdf_s_uncompress);\n }\n if (!min_version.empty()) {\n w.setMinimumPDFVersion(min_version, 0);\n }\n if (!force_version.empty()) {\n w.forcePDFVersion(force_version, 0);\n }\n w.setObjectStreamMode(object_stream_mode);\n w.setStreamDataMode(stream_data_mode);\n\n if (py::hasattr(filename_or_stream, \"read\") && py::hasattr(filename_or_stream, \"seek\")) {\n \/\/ Python code gave us an object with a stream interface\n py::object stream = filename_or_stream;\n check_stream_is_usable(stream);\n\n if (preserve_pdfa) {\n throw py::notimpl_error(\"Cannot perserve PDF\/A compatible when writing to a stream\");\n }\n\n \/\/ TODO could improve this by streaming rather than buffering\n \/\/ using subclass of Pipeline that routes calls to Python\n w.setOutputMemory();\n w.write();\n\n \/\/ getBuffer returns Buffer* and qpdf says we are responsible for\n \/\/ deleting it, so capture it\n std::unique_ptr<Buffer> output_buffer(w.getBuffer());\n\n \/\/ Awkward API alert:\n \/\/ QPDFWriter::getBuffer -> Buffer* (caller frees memory)\n \/\/ and Buffer::getBuffer -> unsigned char* (caller does not own memory)\n auto output = py::bytes(\n (const char*)output_buffer->getBuffer(),\n output_buffer->getSize());\n\n stream.attr(\"write\")(output);\n } else {\n py::object filename = filename_or_stream;\n w.setOutputFilename(fsencode_filename(filename).c_str());\n w.write();\n\n if (preserve_pdfa) {\n auto helpers = py::module::import(\"pikepdf._cpphelpers\");\n helpers.attr(\"repair_pdfa\")(filename);\n }\n }\n}\n\nvoid init_object(py::module& m);\n\nPYBIND11_MODULE(_qpdf, m) {\n \/\/py::options options;\n \/\/options.disable_function_signatures();\n\n m.doc() = \"pikepdf provides a Pythonic interface for QPDF\";\n\n m.def(\"qpdf_version\", &qpdf_get_qpdf_version, \"Get libqpdf version\");\n\n static py::exception<QPDFExc> exc_main(m, \"PDFError\");\n static py::exception<QPDFExc> exc_password(m, \"PasswordError\");\n py::register_exception_translator([](std::exception_ptr p) {\n try {\n if (p) std::rethrow_exception(p);\n } catch (const QPDFExc &e) {\n if (e.getErrorCode() == qpdf_e_password) {\n exc_password(e.what());\n } else {\n exc_main(e.what());\n }\n }\n });\n\n py::enum_<qpdf_object_stream_e>(m, \"ObjectStreamMode\")\n .value(\"disable\", qpdf_object_stream_e::qpdf_o_disable)\n .value(\"preserve\", qpdf_object_stream_e::qpdf_o_preserve)\n .value(\"generate\", qpdf_object_stream_e::qpdf_o_generate);\n\n py::enum_<qpdf_stream_data_e>(m, \"StreamDataMode\")\n .value(\"uncompress\", qpdf_stream_data_e::qpdf_s_uncompress)\n .value(\"preserve\", qpdf_stream_data_e::qpdf_s_preserve)\n .value(\"compress\", qpdf_stream_data_e::qpdf_s_compress);\n\n py::class_<QPDF>(m, \"PDF\", \"In-memory representation of a PDF\")\n .def_static(\"new\",\n []() {\n auto q = std::make_unique<QPDF>();\n q->emptyPDF();\n q->setSuppressWarnings(true);\n return q;\n },\n \"create a new empty PDF from stratch\"\n )\n .def_static(\"open\", open_pdf,\n R\"~~~(\n Open an existing file at `filename_or_stream` according to `options`, all\n of which are optional.\n\n If `filename_or_stream` is path-like, the file will be opened.\n\n If `filename_or_stream` has `.read()` and `.seek()` methods, the file\n will be accessed as a readable binary stream. pikepdf will read the\n entire stream into a private buffer.\n\n :param filename_or_stream: Filename of PDF to open\n :param password: User or owner password to open the PDF, if encrypted\n :type filename_or_stream: os.PathLike or file stream\n :type password: str or None\n :param ignore_xref_streams: If True, ignore cross-reference streams. See qpdf documentation.\n :param suppress_warnings: If True (default), warnings are not printed to stderr. Use `get_warnings()` to retrieve warnings.\n :param attempt_recovery: If True (default), attempt to recover from PDF parsing errors.\n :throws pikepdf.PasswordError: If the password failed to open the file.\n :throws pikepdf.PDFError: If for other reasons we could not open the file.\n :throws TypeError: If the type of `filename_or_stream` is not usable.\n )~~~\"\n )\n .def(\"__repr__\",\n [](const QPDF &q) {\n return \"<pikepdf.PDF description='\"s + q.getFilename() + \"'>\"s;\n }\n )\n .def_property_readonly(\"filename\", &QPDF::getFilename,\n \"the source filename of an existing PDF, when available\")\n .def_property_readonly(\"pdf_version\", &QPDF::getPDFVersion,\n \"the PDF standard version, such as '1.7'\")\n .def_property_readonly(\"extension_level\", &QPDF::getExtensionLevel)\n .def_property_readonly(\"root\", &QPDF::getRoot,\n \"the \/Root object of the PDF\")\n .def_property_readonly(\"trailer\", &QPDF::getTrailer,\n \"the PDF trailer\")\n .def_property_readonly(\"pages\", &QPDF::getAllPages)\n .def_property_readonly(\"is_encrypted\", &QPDF::isEncrypted)\n .def(\"get_warnings\", &QPDF::getWarnings) \/\/ this is a def because it modifies state by clearing warnings\n .def(\"show_xref_table\", &QPDF::showXRefTable)\n .def(\"add_page\",\n [](QPDF& q, QPDFObjectHandle& oh, bool first=false) {\n q.addPage(oh, first);\n },\n R\"~~~(\n Attach a page to this PDF. The page can be either be a\n newly constructed PDF object or it can be obtained from another\n PDF.\n\n :param pikepdf.Object page: The page object to attach\n :param bool first: If True, prepend this before the first page; if False append after last page\n )~~~\",\n py::arg(\"page\"),\n py::arg(\"first\")=false\n )\n .def(\"remove_page\", &QPDF::removePage)\n .def(\"save\",\n save_pdf,\n \"save as a PDF\",\n py::arg(\"filename\"),\n py::arg(\"static_id\")=false,\n py::arg(\"preserve_pdfa\")=false,\n py::arg(\"min_version\")=\"\"s,\n py::arg(\"force_version\")=\"\"s,\n py::arg(\"object_stream_mode\")=qpdf_o_preserve,\n py::arg(\"stream_data_mode\")=qpdf_s_preserve\n )\n .def(\"_get_object_id\", &QPDF::getObjectByID)\n .def(\"make_indirect\", &QPDF::makeIndirectObject)\n .def(\"make_indirect\",\n [](QPDF &q, py::object obj) -> QPDFObjectHandle {\n return q.makeIndirectObject(objecthandle_encode(obj));\n }\n )\n .def(\"_replace_object\",\n [](QPDF &q, int objid, int gen, QPDFObjectHandle &h) {\n q.replaceObject(objid, gen, h);\n }\n );\n\n init_object(m);\n\n#ifdef VERSION_INFO\n m.attr(\"__version__\") = py::str(VERSION_INFO);\n#else\n m.attr(\"__version__\") = py::str(\"dev\");\n#endif\n}\n<commit_msg>Fix \"duplicate page reference\" bug<commit_after>#include <sstream>\n\n#include <qpdf\/Constants.h>\n#include <qpdf\/Types.h>\n#include <qpdf\/DLL.h>\n#include <qpdf\/QPDFExc.hh>\n#include <qpdf\/QPDFObjGen.hh>\n#include <qpdf\/QPDFXRefEntry.hh>\n#include <qpdf\/PointerHolder.hh>\n#include <qpdf\/Buffer.hh>\n#include <qpdf\/QPDFObjectHandle.hh>\n#include <qpdf\/QPDF.hh>\n#include <qpdf\/QPDFWriter.hh>\n\n#include <pybind11\/pybind11.h>\n#include <pybind11\/stl.h>\n\n#include \"pikepdf.h\"\n\nusing namespace std::literals::string_literals;\n\nextern \"C\" const char* qpdf_get_qpdf_version();\n\ntemplate <typename T>\nvoid kwargs_to_method(py::kwargs kwargs, const char* key, std::unique_ptr<QPDF> &q, void (QPDF::*callback)(T))\n{\n try {\n if (kwargs.contains(key)) {\n auto v = kwargs[key].cast<T>();\n ((*q).*callback)(v); \/\/ <-- Cute\n }\n } catch (py::cast_error &e) {\n throw py::type_error(std::string(key) + \": unsupported argument type\");\n }\n}\n\n\n\/* Convert a Python object to a filesystem encoded path\n * Use Python's os.fspath() which accepts os.PathLike (str, bytes, pathlib.Path)\n * and returns bytes encoded in the filesystem encoding.\n * Cast to a string without transcoding.\n *\/\nstd::string fsencode_filename(py::object py_filename)\n{\n auto fspath = py::module::import(\"pikepdf._cpphelpers\").attr(\"fspath\");\n std::string filename;\n\n try {\n auto py_encoded_filename = fspath(py_filename);\n filename = py_encoded_filename.cast<std::string>();\n } catch (py::cast_error &e) {\n throw py::type_error(\"expected pathlike object\");\n }\n\n return filename;\n}\n\nvoid check_stream_is_usable(py::object stream)\n{\n auto TextIOBase = py::module::import(\"io\").attr(\"TextIOBase\");\n\n if (py::isinstance(stream, TextIOBase)) {\n throw py::type_error(\"stream must be binary (no transcoding) and seekable\");\n }\n}\n\nauto open_pdf(py::args args, py::kwargs kwargs)\n{\n auto q = std::make_unique<QPDF>();\n if (args.size() < 1)\n throw py::value_error(\"not enough arguments\");\n if (args.size() > 2)\n throw py::value_error(\"too many arguments\");\n\n std::string password;\n\n q->setSuppressWarnings(true);\n if (kwargs) {\n if (kwargs.contains(\"password\")) {\n auto v = kwargs[\"password\"].cast<std::string>();\n password = v;\n }\n kwargs_to_method(kwargs, \"ignore_xref_streams\", q, &QPDF::setIgnoreXRefStreams);\n kwargs_to_method(kwargs, \"suppress_warnings\", q, &QPDF::setSuppressWarnings);\n kwargs_to_method(kwargs, \"attempt_recovery\", q, &QPDF::setAttemptRecovery);\n }\n\n if (py::hasattr(args[0], \"read\") && py::hasattr(args[0], \"seek\")) {\n \/\/ Python code gave us an object with a stream interface\n py::object stream = args[0];\n\n check_stream_is_usable(stream);\n\n py::object read = stream.attr(\"read\");\n py::object pydata = read();\n py::bytes data = pydata.cast<py::bytes>();\n char *buffer;\n ssize_t length;\n\n \/\/ Is it safe to grab .ptr() like this? Not sure; probably safe under\n \/\/ GIL only\n PYBIND11_BYTES_AS_STRING_AND_SIZE(data.ptr(), &buffer, &length);\n\n \/\/ libqpdf will create a copy of this memory and attach it\n \/\/ to 'q'\n \/\/ This could be improved by subclassing InputSource into C++\n \/\/ and creating a version that obtains its data from its Python object,\n \/\/ but that is much more complex.\n q->processMemoryFile(\"memory\", buffer, length, password.c_str());\n } else {\n std::string filename = fsencode_filename(args[0]);\n \/\/ We can release GIL because Python knows nothing about q at this\n \/\/ point; this could also take a moment for large files\n py::gil_scoped_release release;\n q->processFile(filename.c_str(), password.c_str());\n }\n\n return q;\n}\n\n\nvoid save_pdf(\n QPDF &q,\n py::object filename_or_stream,\n bool static_id=false,\n bool preserve_pdfa=false,\n std::string min_version=\"\"s,\n std::string force_version=\"\"s,\n qpdf_object_stream_e object_stream_mode=qpdf_o_preserve,\n qpdf_stream_data_e stream_data_mode=qpdf_s_preserve)\n{\n QPDFWriter w(q);\n\n \/\/ Parameters\n if (static_id) {\n w.setStaticID(true);\n w.setStreamDataMode(qpdf_s_uncompress);\n }\n if (!min_version.empty()) {\n w.setMinimumPDFVersion(min_version, 0);\n }\n if (!force_version.empty()) {\n w.forcePDFVersion(force_version, 0);\n }\n w.setObjectStreamMode(object_stream_mode);\n w.setStreamDataMode(stream_data_mode);\n\n if (py::hasattr(filename_or_stream, \"read\") && py::hasattr(filename_or_stream, \"seek\")) {\n \/\/ Python code gave us an object with a stream interface\n py::object stream = filename_or_stream;\n check_stream_is_usable(stream);\n\n if (preserve_pdfa) {\n throw py::notimpl_error(\"Cannot perserve PDF\/A compatible when writing to a stream\");\n }\n\n \/\/ TODO could improve this by streaming rather than buffering\n \/\/ using subclass of Pipeline that routes calls to Python\n w.setOutputMemory();\n w.write();\n\n \/\/ getBuffer returns Buffer* and qpdf says we are responsible for\n \/\/ deleting it, so capture it\n std::unique_ptr<Buffer> output_buffer(w.getBuffer());\n\n \/\/ Awkward API alert:\n \/\/ QPDFWriter::getBuffer -> Buffer* (caller frees memory)\n \/\/ and Buffer::getBuffer -> unsigned char* (caller does not own memory)\n auto output = py::bytes(\n (const char*)output_buffer->getBuffer(),\n output_buffer->getSize());\n\n stream.attr(\"write\")(output);\n } else {\n py::object filename = filename_or_stream;\n w.setOutputFilename(fsencode_filename(filename).c_str());\n w.write();\n\n if (preserve_pdfa) {\n auto helpers = py::module::import(\"pikepdf._cpphelpers\");\n helpers.attr(\"repair_pdfa\")(filename);\n }\n }\n}\n\nvoid init_object(py::module& m);\n\nPYBIND11_MODULE(_qpdf, m) {\n \/\/py::options options;\n \/\/options.disable_function_signatures();\n\n m.doc() = \"pikepdf provides a Pythonic interface for QPDF\";\n\n m.def(\"qpdf_version\", &qpdf_get_qpdf_version, \"Get libqpdf version\");\n\n static py::exception<QPDFExc> exc_main(m, \"PDFError\");\n static py::exception<QPDFExc> exc_password(m, \"PasswordError\");\n py::register_exception_translator([](std::exception_ptr p) {\n try {\n if (p) std::rethrow_exception(p);\n } catch (const QPDFExc &e) {\n if (e.getErrorCode() == qpdf_e_password) {\n exc_password(e.what());\n } else {\n exc_main(e.what());\n }\n }\n });\n\n py::enum_<qpdf_object_stream_e>(m, \"ObjectStreamMode\")\n .value(\"disable\", qpdf_object_stream_e::qpdf_o_disable)\n .value(\"preserve\", qpdf_object_stream_e::qpdf_o_preserve)\n .value(\"generate\", qpdf_object_stream_e::qpdf_o_generate);\n\n py::enum_<qpdf_stream_data_e>(m, \"StreamDataMode\")\n .value(\"uncompress\", qpdf_stream_data_e::qpdf_s_uncompress)\n .value(\"preserve\", qpdf_stream_data_e::qpdf_s_preserve)\n .value(\"compress\", qpdf_stream_data_e::qpdf_s_compress);\n\n py::class_<QPDF>(m, \"PDF\", \"In-memory representation of a PDF\")\n .def_static(\"new\",\n []() {\n auto q = std::make_unique<QPDF>();\n q->emptyPDF();\n q->setSuppressWarnings(true);\n return q;\n },\n \"create a new empty PDF from stratch\"\n )\n .def_static(\"open\", open_pdf,\n R\"~~~(\n Open an existing file at `filename_or_stream` according to `options`, all\n of which are optional.\n\n If `filename_or_stream` is path-like, the file will be opened.\n\n If `filename_or_stream` has `.read()` and `.seek()` methods, the file\n will be accessed as a readable binary stream. pikepdf will read the\n entire stream into a private buffer.\n\n :param filename_or_stream: Filename of PDF to open\n :param password: User or owner password to open the PDF, if encrypted\n :type filename_or_stream: os.PathLike or file stream\n :type password: str or None\n :param ignore_xref_streams: If True, ignore cross-reference streams. See qpdf documentation.\n :param suppress_warnings: If True (default), warnings are not printed to stderr. Use `get_warnings()` to retrieve warnings.\n :param attempt_recovery: If True (default), attempt to recover from PDF parsing errors.\n :throws pikepdf.PasswordError: If the password failed to open the file.\n :throws pikepdf.PDFError: If for other reasons we could not open the file.\n :throws TypeError: If the type of `filename_or_stream` is not usable.\n )~~~\"\n )\n .def(\"__repr__\",\n [](const QPDF &q) {\n return \"<pikepdf.PDF description='\"s + q.getFilename() + \"'>\"s;\n }\n )\n .def_property_readonly(\"filename\", &QPDF::getFilename,\n \"the source filename of an existing PDF, when available\")\n .def_property_readonly(\"pdf_version\", &QPDF::getPDFVersion,\n \"the PDF standard version, such as '1.7'\")\n .def_property_readonly(\"extension_level\", &QPDF::getExtensionLevel)\n .def_property_readonly(\"root\", &QPDF::getRoot,\n \"the \/Root object of the PDF\")\n .def_property_readonly(\"trailer\", &QPDF::getTrailer,\n \"the PDF trailer\")\n .def_property_readonly(\"pages\", &QPDF::getAllPages)\n .def_property_readonly(\"is_encrypted\", &QPDF::isEncrypted)\n .def(\"get_warnings\", &QPDF::getWarnings) \/\/ this is a def because it modifies state by clearing warnings\n .def(\"show_xref_table\", &QPDF::showXRefTable)\n .def(\"add_page\",\n [](QPDF& q, QPDFObjectHandle& page, bool first=false) {\n q.addPage(page, first);\n },\n R\"~~~(\n Attach a page to this PDF. The page can be either be a\n newly constructed PDF object or it can be obtained from another\n PDF.\n\n :param pikepdf.Object page: The page object to attach\n :param bool first: If True, prepend this before the first page; if False append after last page\n )~~~\",\n py::arg(\"page\"),\n py::arg(\"first\")=false,\n py::keep_alive<1, 2>()\n )\n .def(\"remove_page\", &QPDF::removePage)\n .def(\"save\",\n save_pdf,\n \"save as a PDF\",\n py::arg(\"filename\"),\n py::arg(\"static_id\")=false,\n py::arg(\"preserve_pdfa\")=false,\n py::arg(\"min_version\")=\"\"s,\n py::arg(\"force_version\")=\"\"s,\n py::arg(\"object_stream_mode\")=qpdf_o_preserve,\n py::arg(\"stream_data_mode\")=qpdf_s_preserve\n )\n .def(\"_get_object_id\", &QPDF::getObjectByID)\n .def(\"make_indirect\", &QPDF::makeIndirectObject)\n .def(\"make_indirect\",\n [](QPDF &q, py::object obj) -> QPDFObjectHandle {\n return q.makeIndirectObject(objecthandle_encode(obj));\n }\n )\n .def(\"_replace_object\",\n [](QPDF &q, int objid, int gen, QPDFObjectHandle &h) {\n q.replaceObject(objid, gen, h);\n }\n );\n\n init_object(m);\n\n#ifdef VERSION_INFO\n m.attr(\"__version__\") = py::str(VERSION_INFO);\n#else\n m.attr(\"__version__\") = py::str(\"dev\");\n#endif\n}\n<|endoftext|>"} {"text":"<commit_before>\/\/ -*- mode:C++; tab-width:8; c-basic-offset:2; indent-tabs-mode:t -*- \n\/\/ vim: ts=8 sw=2 smarttab\n\/*\n * Ceph - scalable distributed file system\n *\n * Copyright (C) 2004-2006 Sage Weil <sage@newdream.net>\n *\n * This is free software; you can redistribute it and\/or\n * modify it under the terms of the GNU Lesser General Public\n * License version 2.1, as published by the Free Software \n * Foundation. See file COPYING.\n * \n *\/\n\n#include <sys\/types.h>\n#include <sys\/stat.h>\n#include <fcntl.h>\n\n#include <sys\/stat.h>\n#include <iostream>\n#include <string>\nusing namespace std;\n\n#include \"config.h\"\n\n#include \"mon\/MonMap.h\"\n#include \"mds\/MDS.h\"\n#include \"osd\/OSDMap.h\"\n\n#include \"msg\/SimpleMessenger.h\"\n\n#include \"common\/Timer.h\"\n#include \"common\/common_init.h\"\n\n#include \"mon\/MonClient.h\"\n\n#include \"osdc\/Objecter.h\"\n\n#include \"messages\/MOSDGetMap.h\"\n#include \"messages\/MClientMount.h\"\n#include \"messages\/MClientMountAck.h\"\n\n#include \"libs3.h\"\n\nvoid usage()\n{\n cerr << \"usage: c3 -i name [flags] [--mds rank] [--shadow rank]\\n\";\n cerr << \" -m monitorip:port\\n\";\n cerr << \" connect to monitor at given address\\n\";\n cerr << \" --debug_mds n\\n\";\n cerr << \" debug MDS level (e.g. 10)\\n\";\n generic_server_usage();\n}\n\nclass C3 : public Dispatcher\n{\n MonMap monmap;\n OSDMap osdmap;\n Messenger *messenger;\n MonClient *mc;\n SimpleMessenger rank;\n\n bool _dispatch(Message *m);\n bool dispatch_impl(Message *m);\n\n Objecter *objecter;\n\n Mutex lock;\n\n class C_WriteAck : public Context {\n object_t oid;\n loff_t start;\n size_t *length;\n Cond *pcond;\n public:\n tid_t tid;\n C_WriteAck(object_t o, loff_t s, size_t *l, Cond *cond) : oid(o), start(s), length(l), pcond(cond) {}\n void finish(int r) {\n if (pcond) {\n *length = r;\n pcond->Signal();\n }\n }\n };\n class C_WriteCommit : public Context {\n object_t oid;\n loff_t start;\n size_t *length;\n Cond *pcond;\n public:\n tid_t tid;\n C_WriteCommit(object_t o, loff_t s, size_t *l, Cond *cond) : oid(o), start(s), length(l), pcond(cond) {}\n void finish(int r) {\n if (pcond) {\n *length = r;\n pcond->Signal();\n }\n }\n };\n class C_ExecCommit : public Context {\n object_t oid;\n loff_t start;\n size_t *length;\n Cond *pcond;\n public:\n tid_t tid;\n C_ExecCommit(object_t o, loff_t s, size_t *l, Cond *cond) : oid(o), start(s), length(l), pcond(cond) {}\n void finish(int r) {\n if (pcond) {\n *length = r;\n pcond->Signal();\n }\n }\n };\n class C_ReadCommit : public Context {\n object_t oid;\n loff_t start;\n size_t *length;\n bufferlist *bl;\n Cond *pcond;\n public:\n tid_t tid;\n C_ReadCommit(object_t o, loff_t s, size_t *l, bufferlist *b, Cond *cond) : oid(o), start(s), length(l), bl(b),\n pcond(cond) {}\n void finish(int r) {\n *length = r;\n if (pcond)\n pcond->Signal();\n }\n };\n\npublic:\n C3() : messenger(NULL), mc(NULL), lock(\"c3\") {}\n ~C3();\n bool init();\n\n int write(object_t& oid, const char *buf, off_t off, size_t len);\n int exec(object_t& oid, const char *code, off_t data_off, size_t data_len, char *buf, size_t out_len);\n int read(object_t& oid, char *buf, off_t off, size_t len);\n};\n\nbool C3::init()\n{\n mc = new MonClient(&monmap, NULL);\n\n \/\/ get monmap\n if (!mc->get_monmap())\n return false;\n\n rank.bind();\n cout << \"starting c3.\" << g_conf.id\n << \" at \" << rank.get_rank_addr() \n << \" fsid \" << monmap.get_fsid()\n << std::endl;\n\n messenger = rank.register_entity(entity_name_t::CLIENT(-1));\n assert_warn(messenger);\n if (!messenger)\n return false;\n\n mc->set_messenger(messenger);\n\n rank.set_policy(entity_name_t::TYPE_MON, SimpleMessenger::Policy::lossy_fail_after(1.0));\n rank.set_policy(entity_name_t::TYPE_MDS, SimpleMessenger::Policy::lossless());\n rank.set_policy(entity_name_t::TYPE_OSD, SimpleMessenger::Policy::lossless());\n rank.set_policy(entity_name_t::TYPE_CLIENT, SimpleMessenger::Policy::lossless()); \/\/ mds does its own timeout\/markdown\n\n rank.start(1);\n\n mc->mount(g_conf.client_mount_timeout);\n\n objecter = new Objecter(messenger, &monmap, &osdmap, lock);\n if (!objecter)\n return false;\n\n lock.Lock();\n mc->link_dispatcher(this);\n\n objecter->set_client_incarnation(0);\n objecter->init();\n\n objecter->set_client_incarnation(0);\n\n lock.Unlock();\n\n return true;\n}\n\nC3::~C3()\n{\n if (mc)\n delete mc;\n if (messenger)\n messenger->shutdown();\n}\n\n\nbool C3::dispatch_impl(Message *m)\n{\n bool ret;\n\n \/\/ verify protocol version\n if (m->get_orig_source().is_mds() &&\n m->get_header().mds_protocol != CEPH_MDS_PROTOCOL) {\n dout(0) << \"mds protocol v \" << (int)m->get_header().mds_protocol << \" != my \" << CEPH_MDS_PROTOCOL\n\t << \" from \" << m->get_orig_source_inst() << \" \" << *m << dendl;\n delete m;\n return true;\n }\n\n if (m->get_header().mdsc_protocol != CEPH_MDSC_PROTOCOL) {\n dout(0) << \"mdsc protocol v \" << (int)m->get_header().mdsc_protocol << \" != my \" << CEPH_MDSC_PROTOCOL\n\t << \" from \" << m->get_orig_source_inst() << \" \" << *m << dendl;\n delete m;\n return true;\n }\n if (m->get_orig_source().is_mon() &&\n m->get_header().monc_protocol != CEPH_MONC_PROTOCOL) {\n dout(0) << \"monc protocol v \" << (int)m->get_header().monc_protocol << \" != my \" << CEPH_MONC_PROTOCOL\n\t << \" from \" << m->get_orig_source_inst() << \" \" << *m << dendl;\n delete m;\n return true;\n }\n if (m->get_orig_source().is_osd() &&\n m->get_header().osdc_protocol != CEPH_OSDC_PROTOCOL) {\n dout(0) << \"osdc protocol v \" << (int)m->get_header().osdc_protocol << \" != my \" << CEPH_OSDC_PROTOCOL\n\t << \" from \" << m->get_orig_source_inst() << \" \" << *m << dendl;\n delete m;\n return true;\n }\n\n lock.Lock();\n ret = _dispatch(m);\n lock.Unlock();\n\n return ret;\n}\n\n\nbool C3::_dispatch(Message *m)\n{\n switch (m->get_type()) {\n \/\/ OSD\n case CEPH_MSG_OSD_OPREPLY:\n objecter->handle_osd_op_reply((class MOSDOpReply*)m);\n break;\n case CEPH_MSG_OSD_MAP:\n objecter->handle_osd_map((MOSDMap*)m);\n break;\n\n default:\n return false;\n }\n\n return true;\n}\n\nint C3::write(object_t& oid, const char *buf, off_t off, size_t len)\n{\n SnapContext snapc;\n bufferlist bl;\n utime_t ut = g_clock.now();\n\n Mutex lock(\"C3::write\");\n Cond write_wait;\n bl.append(&buf[off], len);\n\n C_WriteAck *onack = new C_WriteAck(oid, off, &len, &write_wait);\n C_WriteCommit *oncommit = new C_WriteCommit(oid, off, &len, NULL);\n\n ceph_object_layout layout = objecter->osdmap->make_object_layout(oid, 0);\n\n dout(0) << \"going to write\" << dendl;\n\n lock.Lock();\n\n objecter->write(oid, layout,\n\t off, len, snapc, bl, ut, 0,\n onack, oncommit);\n\n dout(0) << \"after write call\" << dendl;\n\n write_wait.Wait(lock);\n\n lock.Unlock();\n\n return len;\n}\n\nint C3::exec(object_t& oid, const char *code, off_t data_off, size_t data_len, char *buf, size_t out_len)\n{\n SnapContext snapc;\n bufferlist bl, obl;\n utime_t ut = g_clock.now();\n\n Mutex lock(\"C3::exec\");\n Cond exec_wait;\n bl.append(code, strlen(code) + 1);\n\n C_ExecCommit *oncommit = new C_ExecCommit(oid, data_off, &out_len, &exec_wait);\n\n ceph_object_layout layout = objecter->osdmap->make_object_layout(oid, 0);\n\n dout(0) << \"going to exec\" << dendl;\n\n lock.Lock();\n\n objecter->exec(oid, layout,\n\t data_off, data_len, CEPH_NOSNAP, bl, 0,\n\t &obl, out_len,\n oncommit);\n\n dout(0) << \"after write call\" << dendl;\n\n exec_wait.Wait(lock);\n\n lock.Unlock();\n\n if (out_len)\n memcpy(buf, obl.c_str(), out_len);\n\n return out_len;\n}\n\nint C3::read(object_t& oid, char *buf, off_t off, size_t len)\n{\n SnapContext snapc;\n bufferlist *bl = new bufferlist;\n Mutex lock(\"C3::read\");\n Cond read_wait;\n\n C_ReadCommit *oncommit = new C_ReadCommit(oid, off, &len, bl, &read_wait);\n\n ceph_object_layout layout = objecter->osdmap->make_object_layout(oid, 0);\n\n dout(0) << \"going to read\" << dendl;\n\n lock.Lock();\n\n objecter->read(oid, layout,\n\t off, len, CEPH_NOSNAP, bl, 0,\n oncommit);\n\n dout(0) << \"after read call\" << dendl;\n read_wait.Wait(lock);\n\n lock.Unlock();\n\n if (len)\n memcpy(buf, bl->c_str(), len);\n\n delete bl;\n\n return len;\n}\n\nstatic void __c3_init(int argc, const char *argv[])\n{\n vector<const char*> args;\n\n if (argc && argv) {\n argv_to_vec(argc, argv, args);\n env_to_vec(args);\n }\n common_init(args, \"ccc\", true);\n\n if (g_conf.clock_tare) g_clock.tare();\n}\n\nstatic Mutex c3_init_mutex(\"c3_init\");\nstatic int c3_initialized = 0;\n\nstatic C3 *c3p;\n\n#include \"c3.h\"\n\nextern \"C\" int c3_initialize(int argc, const char **argv) \n{\n int ret = 0;\n c3_init_mutex.Lock();\n\n if (!c3_initialized) {\n __c3_init(argc, argv);\n c3p = new C3();\n\n if (!c3p) {\n ret = ENOMEM;\n goto out;\n }\n c3p->init();\n }\n ++c3_initialized;\n\nout:\n c3_init_mutex.Unlock();\n return ret;\n}\n\nextern \"C\" void c3_deinitialize()\n{\n c3_init_mutex.Lock();\n --c3_initialized;\n\n if (!c3_initialized)\n delete c3p;\n\n c3p = NULL;\n\n c3_init_mutex.Unlock();\n}\n\nextern \"C\" int c3_write(object_t *oid, const char *buf, off_t off, size_t len)\n{\n return c3p->write(*oid, buf, off, len);\n}\n\nextern \"C\" int c3_read(object_t *oid, char *buf, off_t off, size_t len)\n{\n return c3p->read(*oid, buf, off, len);\n}\n\nextern \"C\" int c3_exec(object_t *oid, const char *code, off_t off, size_t len, char *buf, size_t out_len)\n{\n return c3p->exec(*oid, code, off, len, buf, out_len);\n}\n\n\nint main(int argc, const char **argv) \n{\n if (c3_initialize(argc, argv)) {\n cerr << \"error initializing\" << std::endl;\n exit(1);\n }\n\n time_t tm;\n char buf[128], buf2[128];\n\n time(&tm);\n snprintf(buf, 128, \"%s\", ctime(&tm));\n\n object_t oid(0x2010, 0);\n\n c3_write(&oid, buf, 0, strlen(buf) + 1);\n c3_exec(&oid, \"code\", 0, 128, buf, 128);\n cerr << \"exec result=\" << buf << std::endl;\n size_t size = c3_read(&oid, buf2, 0, 128);\n\n cerr << \"read result=\" << buf2 << \"\" << std::endl;\n cerr << \"size=\" << size << std::endl;\n\n\n c3_deinitialize();\n\n return 0;\n}\n\n<commit_msg>c3: handle unhandled message<commit_after>\/\/ -*- mode:C++; tab-width:8; c-basic-offset:2; indent-tabs-mode:t -*- \n\/\/ vim: ts=8 sw=2 smarttab\n\/*\n * Ceph - scalable distributed file system\n *\n * Copyright (C) 2004-2006 Sage Weil <sage@newdream.net>\n *\n * This is free software; you can redistribute it and\/or\n * modify it under the terms of the GNU Lesser General Public\n * License version 2.1, as published by the Free Software \n * Foundation. See file COPYING.\n * \n *\/\n\n#include <sys\/types.h>\n#include <sys\/stat.h>\n#include <fcntl.h>\n\n#include <sys\/stat.h>\n#include <iostream>\n#include <string>\nusing namespace std;\n\n#include \"config.h\"\n\n#include \"mon\/MonMap.h\"\n#include \"mds\/MDS.h\"\n#include \"osd\/OSDMap.h\"\n\n#include \"msg\/SimpleMessenger.h\"\n\n#include \"common\/Timer.h\"\n#include \"common\/common_init.h\"\n\n#include \"mon\/MonClient.h\"\n\n#include \"osdc\/Objecter.h\"\n\n#include \"messages\/MOSDGetMap.h\"\n#include \"messages\/MClientMount.h\"\n#include \"messages\/MClientMountAck.h\"\n\n#include \"libs3.h\"\n\nvoid usage()\n{\n cerr << \"usage: c3 -i name [flags] [--mds rank] [--shadow rank]\\n\";\n cerr << \" -m monitorip:port\\n\";\n cerr << \" connect to monitor at given address\\n\";\n cerr << \" --debug_mds n\\n\";\n cerr << \" debug MDS level (e.g. 10)\\n\";\n generic_server_usage();\n}\n\nclass C3 : public Dispatcher\n{\n MonMap monmap;\n OSDMap osdmap;\n Messenger *messenger;\n MonClient *mc;\n SimpleMessenger rank;\n\n bool _dispatch(Message *m);\n bool dispatch_impl(Message *m);\n\n Objecter *objecter;\n\n Mutex lock;\n\n class C_WriteAck : public Context {\n object_t oid;\n loff_t start;\n size_t *length;\n Cond *pcond;\n public:\n tid_t tid;\n C_WriteAck(object_t o, loff_t s, size_t *l, Cond *cond) : oid(o), start(s), length(l), pcond(cond) {}\n void finish(int r) {\n if (pcond) {\n *length = r;\n pcond->Signal();\n }\n }\n };\n class C_WriteCommit : public Context {\n object_t oid;\n loff_t start;\n size_t *length;\n Cond *pcond;\n public:\n tid_t tid;\n C_WriteCommit(object_t o, loff_t s, size_t *l, Cond *cond) : oid(o), start(s), length(l), pcond(cond) {}\n void finish(int r) {\n if (pcond) {\n *length = r;\n pcond->Signal();\n }\n }\n };\n class C_ExecCommit : public Context {\n object_t oid;\n loff_t start;\n size_t *length;\n Cond *pcond;\n public:\n tid_t tid;\n C_ExecCommit(object_t o, loff_t s, size_t *l, Cond *cond) : oid(o), start(s), length(l), pcond(cond) {}\n void finish(int r) {\n if (pcond) {\n *length = r;\n pcond->Signal();\n }\n }\n };\n class C_ReadCommit : public Context {\n object_t oid;\n loff_t start;\n size_t *length;\n bufferlist *bl;\n Cond *pcond;\n public:\n tid_t tid;\n C_ReadCommit(object_t o, loff_t s, size_t *l, bufferlist *b, Cond *cond) : oid(o), start(s), length(l), bl(b),\n pcond(cond) {}\n void finish(int r) {\n *length = r;\n if (pcond)\n pcond->Signal();\n }\n };\n\npublic:\n C3() : messenger(NULL), mc(NULL), lock(\"c3\") {}\n ~C3();\n bool init();\n\n int write(object_t& oid, const char *buf, off_t off, size_t len);\n int exec(object_t& oid, const char *code, off_t data_off, size_t data_len, char *buf, size_t out_len);\n int read(object_t& oid, char *buf, off_t off, size_t len);\n};\n\nbool C3::init()\n{\n mc = new MonClient(&monmap, NULL);\n\n \/\/ get monmap\n if (!mc->get_monmap())\n return false;\n\n rank.bind();\n cout << \"starting c3.\" << g_conf.id\n << \" at \" << rank.get_rank_addr() \n << \" fsid \" << monmap.get_fsid()\n << std::endl;\n\n messenger = rank.register_entity(entity_name_t::CLIENT(-1));\n assert_warn(messenger);\n if (!messenger)\n return false;\n\n mc->set_messenger(messenger);\n\n rank.set_policy(entity_name_t::TYPE_MON, SimpleMessenger::Policy::lossy_fail_after(1.0));\n rank.set_policy(entity_name_t::TYPE_MDS, SimpleMessenger::Policy::lossless());\n rank.set_policy(entity_name_t::TYPE_OSD, SimpleMessenger::Policy::lossless());\n rank.set_policy(entity_name_t::TYPE_CLIENT, SimpleMessenger::Policy::lossless()); \/\/ mds does its own timeout\/markdown\n\n rank.start(1);\n\n mc->mount(g_conf.client_mount_timeout);\n\n objecter = new Objecter(messenger, &monmap, &osdmap, lock);\n if (!objecter)\n return false;\n\n lock.Lock();\n mc->link_dispatcher(this);\n\n objecter->set_client_incarnation(0);\n objecter->init();\n\n objecter->set_client_incarnation(0);\n\n lock.Unlock();\n\n return true;\n}\n\nC3::~C3()\n{\n if (mc)\n delete mc;\n if (messenger)\n messenger->shutdown();\n}\n\n\nbool C3::dispatch_impl(Message *m)\n{\n bool ret;\n\n \/\/ verify protocol version\n if (m->get_orig_source().is_mds() &&\n m->get_header().mds_protocol != CEPH_MDS_PROTOCOL) {\n dout(0) << \"mds protocol v \" << (int)m->get_header().mds_protocol << \" != my \" << CEPH_MDS_PROTOCOL\n\t << \" from \" << m->get_orig_source_inst() << \" \" << *m << dendl;\n delete m;\n return true;\n }\n\n if (m->get_header().mdsc_protocol != CEPH_MDSC_PROTOCOL) {\n dout(0) << \"mdsc protocol v \" << (int)m->get_header().mdsc_protocol << \" != my \" << CEPH_MDSC_PROTOCOL\n\t << \" from \" << m->get_orig_source_inst() << \" \" << *m << dendl;\n delete m;\n return true;\n }\n if (m->get_orig_source().is_mon() &&\n m->get_header().monc_protocol != CEPH_MONC_PROTOCOL) {\n dout(0) << \"monc protocol v \" << (int)m->get_header().monc_protocol << \" != my \" << CEPH_MONC_PROTOCOL\n\t << \" from \" << m->get_orig_source_inst() << \" \" << *m << dendl;\n delete m;\n return true;\n }\n if (m->get_orig_source().is_osd() &&\n m->get_header().osdc_protocol != CEPH_OSDC_PROTOCOL) {\n dout(0) << \"osdc protocol v \" << (int)m->get_header().osdc_protocol << \" != my \" << CEPH_OSDC_PROTOCOL\n\t << \" from \" << m->get_orig_source_inst() << \" \" << *m << dendl;\n delete m;\n return true;\n }\n\n lock.Lock();\n ret = _dispatch(m);\n lock.Unlock();\n\n return ret;\n}\n\n\nbool C3::_dispatch(Message *m)\n{\n switch (m->get_type()) {\n \/\/ OSD\n case CEPH_MSG_OSD_OPREPLY:\n objecter->handle_osd_op_reply((class MOSDOpReply*)m);\n break;\n case CEPH_MSG_OSD_MAP:\n objecter->handle_osd_map((MOSDMap*)m);\n break;\n case CEPH_MSG_MDS_MAP:\n break;\n\n default:\n return false;\n }\n\n return true;\n}\n\nint C3::write(object_t& oid, const char *buf, off_t off, size_t len)\n{\n SnapContext snapc;\n bufferlist bl;\n utime_t ut = g_clock.now();\n\n Mutex lock(\"C3::write\");\n Cond write_wait;\n bl.append(&buf[off], len);\n\n C_WriteAck *onack = new C_WriteAck(oid, off, &len, &write_wait);\n C_WriteCommit *oncommit = new C_WriteCommit(oid, off, &len, NULL);\n\n ceph_object_layout layout = objecter->osdmap->make_object_layout(oid, 0);\n\n dout(0) << \"going to write\" << dendl;\n\n lock.Lock();\n\n objecter->write(oid, layout,\n\t off, len, snapc, bl, ut, 0,\n onack, oncommit);\n\n dout(0) << \"after write call\" << dendl;\n\n write_wait.Wait(lock);\n\n lock.Unlock();\n\n return len;\n}\n\nint C3::exec(object_t& oid, const char *code, off_t data_off, size_t data_len, char *buf, size_t out_len)\n{\n SnapContext snapc;\n bufferlist bl, obl;\n utime_t ut = g_clock.now();\n\n Mutex lock(\"C3::exec\");\n Cond exec_wait;\n bl.append(code, strlen(code) + 1);\n\n C_ExecCommit *oncommit = new C_ExecCommit(oid, data_off, &out_len, &exec_wait);\n\n ceph_object_layout layout = objecter->osdmap->make_object_layout(oid, 0);\n\n dout(0) << \"going to exec\" << dendl;\n\n lock.Lock();\n\n objecter->exec(oid, layout,\n\t data_off, data_len, CEPH_NOSNAP, bl, 0,\n\t &obl, out_len,\n oncommit);\n\n dout(0) << \"after write call\" << dendl;\n\n exec_wait.Wait(lock);\n\n lock.Unlock();\n\n if (out_len)\n memcpy(buf, obl.c_str(), out_len);\n\n return out_len;\n}\n\nint C3::read(object_t& oid, char *buf, off_t off, size_t len)\n{\n SnapContext snapc;\n bufferlist *bl = new bufferlist;\n Mutex lock(\"C3::read\");\n Cond read_wait;\n\n C_ReadCommit *oncommit = new C_ReadCommit(oid, off, &len, bl, &read_wait);\n\n ceph_object_layout layout = objecter->osdmap->make_object_layout(oid, 0);\n\n dout(0) << \"going to read\" << dendl;\n\n lock.Lock();\n\n objecter->read(oid, layout,\n\t off, len, CEPH_NOSNAP, bl, 0,\n oncommit);\n\n dout(0) << \"after read call\" << dendl;\n read_wait.Wait(lock);\n\n lock.Unlock();\n\n if (len)\n memcpy(buf, bl->c_str(), len);\n\n delete bl;\n\n return len;\n}\n\nstatic void __c3_init(int argc, const char *argv[])\n{\n vector<const char*> args;\n\n if (argc && argv) {\n argv_to_vec(argc, argv, args);\n env_to_vec(args);\n }\n common_init(args, \"ccc\", true);\n\n if (g_conf.clock_tare) g_clock.tare();\n}\n\nstatic Mutex c3_init_mutex(\"c3_init\");\nstatic int c3_initialized = 0;\n\nstatic C3 *c3p;\n\n#include \"c3.h\"\n\nextern \"C\" int c3_initialize(int argc, const char **argv) \n{\n int ret = 0;\n c3_init_mutex.Lock();\n\n if (!c3_initialized) {\n __c3_init(argc, argv);\n c3p = new C3();\n\n if (!c3p) {\n ret = ENOMEM;\n goto out;\n }\n c3p->init();\n }\n ++c3_initialized;\n\nout:\n c3_init_mutex.Unlock();\n return ret;\n}\n\nextern \"C\" void c3_deinitialize()\n{\n c3_init_mutex.Lock();\n --c3_initialized;\n\n if (!c3_initialized)\n delete c3p;\n\n c3p = NULL;\n\n c3_init_mutex.Unlock();\n}\n\nextern \"C\" int c3_write(object_t *oid, const char *buf, off_t off, size_t len)\n{\n return c3p->write(*oid, buf, off, len);\n}\n\nextern \"C\" int c3_read(object_t *oid, char *buf, off_t off, size_t len)\n{\n return c3p->read(*oid, buf, off, len);\n}\n\nextern \"C\" int c3_exec(object_t *oid, const char *code, off_t off, size_t len, char *buf, size_t out_len)\n{\n return c3p->exec(*oid, code, off, len, buf, out_len);\n}\n\n\nint main(int argc, const char **argv) \n{\n if (c3_initialize(argc, argv)) {\n cerr << \"error initializing\" << std::endl;\n exit(1);\n }\n\n time_t tm;\n char buf[128], buf2[128];\n\n time(&tm);\n snprintf(buf, 128, \"%s\", ctime(&tm));\n\n object_t oid(0x2010, 0);\n\n c3_write(&oid, buf, 0, strlen(buf) + 1);\n c3_exec(&oid, \"code\", 0, 128, buf, 128);\n cerr << \"exec result=\" << buf << std::endl;\n size_t size = c3_read(&oid, buf2, 0, 128);\n\n cerr << \"read result=\" << buf2 << \"\" << std::endl;\n cerr << \"size=\" << size << std::endl;\n\n\n c3_deinitialize();\n\n return 0;\n}\n\n<|endoftext|>"} {"text":"<commit_before>\/**\n * @file fetcher.cpp\n *\n * @date Nov 21, 2012\n * @author partio\n *\/\n\n#include \"fetcher.h\"\n#include \"plugin_factory.h\"\n#include \"logger_factory.h\"\n#include <fstream>\n#include <boost\/lexical_cast.hpp>\n#include <boost\/filesystem\/operations.hpp>\n#include \"timer_factory.h\"\n#include \"util.h\"\n\n#define HIMAN_AUXILIARY_INCLUDE\n\n#include \"grib.h\"\n#include \"neons.h\"\n#include \"param.h\"\n#include \"cache.h\"\n#include \"querydata.h\"\n\n#undef HIMAN_AUXILIARY_INCLUDE\n\nusing namespace himan::plugin;\nusing namespace std;\n\nconst unsigned int SLEEPSECONDS = 10;\n\nshared_ptr<cache> itsCache;\n\nfetcher::fetcher()\n\t: itsDoLevelTransform(true)\n{\n\titsLogger = std::unique_ptr<logger> (logger_factory::Instance()->GetLog(\"fetcher\"));\n}\n\nshared_ptr<himan::info> fetcher::Fetch(shared_ptr<const plugin_configuration> config,\n\t\t\t\t\t\t\t\t\t\tconst forecast_time& requestedTime,\n\t\t\t\t\t\t\t\t\t\tconst level& requestedLevel,\n\t\t\t\t\t\t\t\t\t\tconst params& requestedParams,\n\t\t\t\t\t\t\t\t\t\tbool readPackedData)\n{\n\tunsigned int waitedSeconds = 0;\n\n\tshared_ptr<info> ret;\n\t\n\tdo\n\t{\n\t\tfor (size_t i = 0; i < requestedParams.size(); i++)\n\t\t{\n\t\t\ttry\n\t\t\t{\n\t\t\t\tret = Fetch(config, requestedTime, requestedLevel, requestedParams[i], readPackedData, false);\n\t\t\t\t\n\t\t\t\treturn ret;\n\t\t\t}\n\t\t\tcatch (const HPExceptionType& e)\n\t\t\t{\n\t\t\t\tif (e != kFileDataNotFound)\n\t\t\t\t{\n\t\t\t\t\tthrow e;\n\t\t\t\t}\n\t\t\t}\n\t\t\tcatch (const exception& e)\n\t\t\t{\n\t\t\t\tthrow e;\n\t\t\t}\n\n\t\t}\n\t\tif (config->FileWaitTimeout() > 0)\n\t\t{\n\t\t\titsLogger->Debug(\"Sleeping for \" + boost::lexical_cast<string> (SLEEPSECONDS) + \" seconds (cumulative: \" + boost::lexical_cast<string> (waitedSeconds) + \")\");\n\n\t\t\tif (!config->ReadDataFromDatabase())\n\t\t\t{\n\t\t\t\titsLogger->Warning(\"file_wait_timeout specified but file read from Neons is disabled\");\n\t\t\t}\n\n\t\t\tsleep(SLEEPSECONDS);\n\t\t}\n\n\t\twaitedSeconds += SLEEPSECONDS;\n\t}\n\twhile (waitedSeconds < config->FileWaitTimeout() * 60);\n\n\tstring optsStr = \"producer(s): \";\n\n\tfor (size_t prodNum = 0; prodNum < config->SizeSourceProducers(); prodNum++)\n\t{\n\t\toptsStr += boost::lexical_cast<string> (config->SourceProducer(prodNum).Id()) + \",\";\n\t}\n\n\toptsStr = optsStr.substr(0, optsStr.size()-1);\n\n\toptsStr += \" origintime: \" + requestedTime.OriginDateTime()->String() + \", step: \" + boost::lexical_cast<string> (requestedTime.Step());\n\n\toptsStr += \" param(s): \";\n\t\n\tfor (size_t i = 0; i < requestedParams.size(); i++)\n\t{\n\t\toptsStr += requestedParams[i].Name() + \",\";\n\t}\n\n\toptsStr = optsStr.substr(0, optsStr.size()-1);\n\n\toptsStr += \" level: \" + string(himan::HPLevelTypeToString.at(requestedLevel.Type())) + \" \" + boost::lexical_cast<string> (requestedLevel.Value());\n\n\titsLogger->Warning(\"No valid data found with given search options \" + optsStr);\n\n\tthrow kFileDataNotFound;\n\n}\n\n\nshared_ptr<himan::info> fetcher::Fetch(shared_ptr<const plugin_configuration> config,\n\t\t\t\t\t\t\t\t\t\tconst forecast_time& requestedTime,\n\t\t\t\t\t\t\t\t\t\tconst level& requestedLevel,\n\t\t\t\t\t\t\t\t\t\tconst param& requestedParam,\n\t\t\t\t\t\t\t\t\t\tbool readPackedData,\n\t\t\t\t\t\t\t\t\t\tbool controlWaitTime)\n{\n\n\tunique_ptr<timer> t = unique_ptr<timer> (timer_factory::Instance()->GetTimer());\n\t\n\tif (config->StatisticsEnabled())\n\t{\n\t\tt->Start();\n\t}\n\t\n\tvector<shared_ptr<info>> theInfos;\n\tunsigned int waitedSeconds = 0;\n\n\tlevel newLevel = requestedLevel;\n\t\n\tif (itsDoLevelTransform &&\n\t\t\t(requestedLevel.Type() != kHybrid && requestedLevel.Type() != kPressure))\n\t{\n\t\tnewLevel = LevelTransform(config->SourceProducer(), requestedParam, requestedLevel);\n\n\t\tif (newLevel != requestedLevel)\n\t\t{\n\t\t\titsLogger->Trace(\"Transform level \" + string(HPLevelTypeToString.at(requestedLevel.Type()))\n\t\t\t\t\t\t+ \"\/\" + boost::lexical_cast<string> (requestedLevel.Value())\n\t\t\t\t\t\t+ \" to \" + HPLevelTypeToString.at(newLevel.Type())\n\t\t\t\t\t\t+ \"\/\" + boost::lexical_cast<string> (newLevel.Value())\n\t\t\t\t\t\t+ \" for producer \" + boost::lexical_cast<string> (config->SourceProducer().Id())\n\t\t\t\t\t\t+ \", parameter \" + requestedParam.Name());\n\t\t}\n\t}\n\t\n\tdo\n\t{\n\t\t\/\/ Loop over all source producers if more than one specified\n\n\t\tfor (size_t prodNum = 0; prodNum < config->SizeSourceProducers(); prodNum++)\n\t\t{\n\t\t\n\t\t\tproducer sourceProd(config->SourceProducer(prodNum));\n\t\t\t\n\t\t\tconst search_options opts (requestedTime, requestedParam, newLevel, sourceProd, config);\n\n\t\t\t\/\/ itsLogger->Trace(\"Current producer: \" + sourceProd.Name());\n\n\t\t\tif (config->UseCache())\n\t\t\t{\n\n\t\t\t\t\/\/ 1. Fetch data from cache\n\n\t\t\t\tif (!itsCache)\n\t\t\t\t{\n\t\t\t\t\titsCache = dynamic_pointer_cast<plugin::cache> (plugin_factory::Instance()->Plugin(\"cache\"));\n\t\t\t\t}\n\n\t\t\t\ttheInfos = FromCache(opts);\n\n\t\t\t\tif (theInfos.size())\n\t\t\t\t{\n\t\t\t\t\titsLogger->Trace(\"Data found from cache\");\n\n\t\t\t\t\tif (config->StatisticsEnabled())\n\t\t\t\t\t{\n\t\t\t\t\t\tconfig->Statistics()->AddToCacheHitCount(1);\n\t\t\t\t\t}\n\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\n\t\t\t\/*\n\t\t\t * 2. Fetch data from auxiliary files specified at command line\n\t\t\t *\n\t\t\t * Even if file_wait_timeout is specified, auxiliary files is searched\n\t\t\t * only once.\n\t\t\t *\/\n\n\t\t\tif (config->AuxiliaryFiles().size() && waitedSeconds == 0)\n\t\t\t{\n\t\t\t\ttheInfos = FromFile(config->AuxiliaryFiles(), opts, true, readPackedData);\n\n\t\t\t\tif (theInfos.size())\n\t\t\t\t{\n\t\t\t\t\titsLogger->Trace(\"Data found from auxiliary file(s)\");\n\n\t\t\t\t\tif (config->StatisticsEnabled())\n\t\t\t\t\t{\n\t\t\t\t\t\tconfig->Statistics()->AddToCacheMissCount(1);\n\t\t\t\t\t}\n\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t\telse\n\t\t\t\t{\n\t\t\t\t\titsLogger->Trace(\"Data not found from auxiliary file(s)\");\n\t\t\t\t}\n\t\t\t}\n\n\t\t\t\/\/ 3. Fetch data from Neons\n\n\t\t\tvector<string> files;\n\n\t\t\tif (config->ReadDataFromDatabase())\n\t\t\t{\n\t\t\t\tshared_ptr<neons> n = dynamic_pointer_cast<neons> (plugin_factory::Instance()->Plugin(\"neons\"));\n\n\t\t\t\tfiles = n->Files(opts);\n\n\t\t\t\tif (!files.empty())\n\t\t\t\t{\n\t\t\t\t\ttheInfos = FromFile(files, opts, true, readPackedData);\n\n\t\t\t\t\tif (config->StatisticsEnabled())\n\t\t\t\t\t{\n\t\t\t\t\t\tconfig->Statistics()->AddToCacheMissCount(1);\n\t\t\t\t\t}\n\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\tif (controlWaitTime && config->FileWaitTimeout() > 0)\n\t\t{\n\t\t\titsLogger->Debug(\"Sleeping for \" + boost::lexical_cast<string> (SLEEPSECONDS) + \" seconds (cumulative: \" + boost::lexical_cast<string> (waitedSeconds) + \")\");\n\n\t\t\tif (!config->ReadDataFromDatabase())\n\t\t\t{\n\t\t\t\titsLogger->Warning(\"file_wait_timeout specified but file read from Neons is disabled\");\n\t\t\t}\n\n\t\t\tsleep(SLEEPSECONDS);\n\t\t}\n\n\t\twaitedSeconds += SLEEPSECONDS;\n\t}\n\twhile (controlWaitTime && waitedSeconds < config->FileWaitTimeout() * 60);\n\n\tif (config->StatisticsEnabled())\n\t{\n\t\tt->Stop();\n\n\t\tconfig->Statistics()->AddToFetchingTime(t->GetTime());\n\t}\n\t\/*\n\t * Safeguard; later in the code we do not check whether the data requested\n\t * was actually what was requested.\n\t *\/\n\n\tif (theInfos.size() == 0)\n\t{\n\t\t\/\/ If this function is called from multi-param Fetch(), do not print\n\t\t\/\/ any messages yet since we might have another source param coming\n\n\t\tif (controlWaitTime)\n\t\t{\n\t\t\tstring optsStr = \"producer(s): \";\n\n\t\t\tfor (size_t prodNum = 0; prodNum < config->SizeSourceProducers(); prodNum++)\n\t\t\t{\n\t\t\t\toptsStr += boost::lexical_cast<string> (config->SourceProducer(prodNum).Id()) + \",\";\n\t\t\t}\n\n\t\t\toptsStr = optsStr.substr(0, optsStr.size()-1);\n\n\t\t\toptsStr += \" origintime: \" + requestedTime.OriginDateTime()->String() + \", step: \" + boost::lexical_cast<string> (requestedTime.Step());\n\t\t\toptsStr += \" param: \" + requestedParam.Name();\n\t\t\toptsStr += \" level: \" + string(himan::HPLevelTypeToString.at(requestedLevel.Type())) + \" \" + boost::lexical_cast<string> (requestedLevel.Value());\n\n\t\t\titsLogger->Warning(\"No valid data found with given search options \" + optsStr);\n\t\t}\n\n\t\tthrow kFileDataNotFound;\n\t}\n\n\t\/\/ assert(theConfiguration->SourceProducer() == theInfos[0]->Producer());\n\n\tassert((theInfos[0]->Level()) == newLevel);\n\n\tassert((theInfos[0]->Time()) == requestedTime);\n\n\tassert((theInfos[0]->Param()) == requestedParam);\n\n\treturn theInfos[0];\n\n}\n\nvector<shared_ptr<himan::info>> fetcher::FromFile(const vector<string>& files, const search_options& options, bool readContents, bool readPackedData)\n{\n\n\tvector<shared_ptr<himan::info>> allInfos ;\n\n\tfor (size_t i = 0; i < files.size(); i++)\n\t{\n\t\tstring inputFile = files[i];\n\n\t\tif (!boost::filesystem::exists(inputFile))\n\t\t{\n\t\t\titsLogger->Error(\"Input file '\" + inputFile + \"' does not exist\");\n\t\t\tcontinue;\n\t\t}\n\n\t\tvector<shared_ptr<himan::info>> curInfos;\n\n\t\tswitch (util::FileType(inputFile))\n\t\t{\n\n\t\tcase kGRIB:\n\t\tcase kGRIB1:\n\t\tcase kGRIB2:\n\t\t{\n\n\t\t\tcurInfos = FromGrib(inputFile, options, readContents, readPackedData);\n\t\t\tbreak;\n\n\t\t}\n\n\t\tcase kQueryData:\n\t\t{\n\t\t\tcurInfos = FromQueryData(inputFile, options, readContents);\n\t\t\tbreak;\n\t\t}\n\n\t\tcase kNetCDF:\n\t\t\titsLogger->Error(\"File is NetCDF\");\n\t\t\tbreak;\n\n\t\tdefault:\n\t\t\t\/\/ Unknown file type, cannot proceed\n\t\t\tthrow runtime_error(\"Input file is neither GRIB, NetCDF nor QueryData\");\n\t\t\tbreak;\n\t\t}\n\n\t\tallInfos.insert(allInfos.end(), curInfos.begin(), curInfos.end());\n\n\t\tif (curInfos.size())\n\t\t{\n\t\t\tif (options.configuration->UseCache())\n\t\t\t{\n\t\t\t\titsCache->Insert(allInfos);\n\t\t\t}\n\n\t\t\tbreak; \/\/ We found what we were looking for\n\t\t}\n\n\t}\n\n\treturn allInfos;\n}\n\nvector<shared_ptr<himan::info> > fetcher::FromCache(const search_options& options)\n{\n\tvector<shared_ptr<himan::info>> infos = itsCache->GetInfo(options);\n\n\treturn infos;\n}\n\nvector<shared_ptr<himan::info> > fetcher::FromGrib(const string& inputFile, const search_options& options, bool readContents, bool readPackedData)\n{\n\n\tshared_ptr<grib> g = dynamic_pointer_cast<grib> (plugin_factory::Instance()->Plugin(\"grib\"));\n\n\tvector<shared_ptr<info>> infos = g->FromFile(inputFile, options, readContents, readPackedData);\n\n\treturn infos;\n}\n\nvector<shared_ptr<himan::info>> fetcher::FromQueryData(const string& inputFile, const search_options& options, bool readContents)\n{\n\n\tshared_ptr<querydata> q = dynamic_pointer_cast<querydata> (plugin_factory::Instance()->Plugin(\"querydata\"));\n\n\tshared_ptr<info> i = q->FromFile(inputFile, options, readContents);\n\n\tvector<shared_ptr<info>> theInfos;\n\n\ttheInfos.push_back(i);\n\n\treturn theInfos;\n}\n\nhiman::level fetcher::LevelTransform(const producer& sourceProducer, const param& targetParam,\tconst level& targetLevel) const\n{\n\n\tlevel sourceLevel = targetLevel;\n\n\tif (sourceProducer.TableVersion() != kHPMissingInt)\n\t{\n\t\tshared_ptr<neons> n = dynamic_pointer_cast <neons> (plugin_factory::Instance()->Plugin(\"neons\"));\n\n\t\tstring lvlName = n->NeonsDB().GetGridLevelName(targetParam.Name(), targetLevel.Type(), 204, sourceProducer.TableVersion());\n\n\t\tHPLevelType lvlType = kUnknownLevel;\n\n\t\tdouble lvlValue = targetLevel.Value();\n\n\t\tif (lvlName == \"GROUND\")\n\t\t{\n\t\t\tlvlType = kGround;\n\t\t\tlvlValue = 0;\n\t\t}\n\t\telse if (lvlName == \"PRESSURE\")\n\t\t{\n\t\t\tlvlType = kPressure;\n\t\t}\n\t\telse if (lvlName == \"HYBRID\")\n\t\t{\n\t\t\tlvlType = kHybrid;\n\t\t}\n\t\telse if (lvlName == \"HEIGHT\")\n\t\t{\n\t\t\tlvlType = kHeight;\n\t\t}\n\t\telse\n\t\t{\n\t\t\tthrow runtime_error(ClassName() + \": Unknown level type: \" + lvlName);\n\t\t}\n\n\t\tsourceLevel = level(lvlType, lvlValue, lvlName);\n\t}\n\telse\n\t{\n\t\tsourceLevel = targetLevel;\n\t}\n\n\treturn sourceLevel;\n}\n\nvoid fetcher::DoLevelTransform(bool theDoLevelTransform)\n{\n\titsDoLevelTransform = theDoLevelTransform;\n}\n\nbool fetcher::DoLevelTransform() const\n{\n\treturn itsDoLevelTransform;\n}<commit_msg>Move level transform to inner loop so that all producers are handled correctly<commit_after>\/**\n * @file fetcher.cpp\n *\n * @date Nov 21, 2012\n * @author partio\n *\/\n\n#include \"fetcher.h\"\n#include \"plugin_factory.h\"\n#include \"logger_factory.h\"\n#include <fstream>\n#include <boost\/lexical_cast.hpp>\n#include <boost\/filesystem\/operations.hpp>\n#include \"timer_factory.h\"\n#include \"util.h\"\n\n#define HIMAN_AUXILIARY_INCLUDE\n\n#include \"grib.h\"\n#include \"neons.h\"\n#include \"param.h\"\n#include \"cache.h\"\n#include \"querydata.h\"\n\n#undef HIMAN_AUXILIARY_INCLUDE\n\nusing namespace himan::plugin;\nusing namespace std;\n\nconst unsigned int SLEEPSECONDS = 10;\n\nshared_ptr<cache> itsCache;\n\nfetcher::fetcher()\n\t: itsDoLevelTransform(true)\n{\n\titsLogger = std::unique_ptr<logger> (logger_factory::Instance()->GetLog(\"fetcher\"));\n}\n\nshared_ptr<himan::info> fetcher::Fetch(shared_ptr<const plugin_configuration> config,\n\t\t\t\t\t\t\t\t\t\tconst forecast_time& requestedTime,\n\t\t\t\t\t\t\t\t\t\tconst level& requestedLevel,\n\t\t\t\t\t\t\t\t\t\tconst params& requestedParams,\n\t\t\t\t\t\t\t\t\t\tbool readPackedData)\n{\n\tunsigned int waitedSeconds = 0;\n\n\tshared_ptr<info> ret;\n\t\n\tdo\n\t{\n\t\tfor (size_t i = 0; i < requestedParams.size(); i++)\n\t\t{\n\t\t\ttry\n\t\t\t{\n\t\t\t\tret = Fetch(config, requestedTime, requestedLevel, requestedParams[i], readPackedData, false);\n\t\t\t\t\n\t\t\t\treturn ret;\n\t\t\t}\n\t\t\tcatch (const HPExceptionType& e)\n\t\t\t{\n\t\t\t\tif (e != kFileDataNotFound)\n\t\t\t\t{\n\t\t\t\t\tthrow;\n\t\t\t\t}\n\t\t\t}\n\t\t\tcatch (const exception& e)\n\t\t\t{\n\t\t\t\tthrow;\n\t\t\t}\n\n\t\t}\n\t\tif (config->FileWaitTimeout() > 0)\n\t\t{\n\t\t\titsLogger->Debug(\"Sleeping for \" + boost::lexical_cast<string> (SLEEPSECONDS) + \" seconds (cumulative: \" + boost::lexical_cast<string> (waitedSeconds) + \")\");\n\n\t\t\tif (!config->ReadDataFromDatabase())\n\t\t\t{\n\t\t\t\titsLogger->Warning(\"file_wait_timeout specified but file read from Neons is disabled\");\n\t\t\t}\n\n\t\t\tsleep(SLEEPSECONDS);\n\t\t}\n\n\t\twaitedSeconds += SLEEPSECONDS;\n\t}\n\twhile (waitedSeconds < config->FileWaitTimeout() * 60);\n\n\tstring optsStr = \"producer(s): \";\n\n\tfor (size_t prodNum = 0; prodNum < config->SizeSourceProducers(); prodNum++)\n\t{\n\t\toptsStr += boost::lexical_cast<string> (config->SourceProducer(prodNum).Id()) + \",\";\n\t}\n\n\toptsStr = optsStr.substr(0, optsStr.size()-1);\n\n\toptsStr += \" origintime: \" + requestedTime.OriginDateTime()->String() + \", step: \" + boost::lexical_cast<string> (requestedTime.Step());\n\n\toptsStr += \" param(s): \";\n\t\n\tfor (size_t i = 0; i < requestedParams.size(); i++)\n\t{\n\t\toptsStr += requestedParams[i].Name() + \",\";\n\t}\n\n\toptsStr = optsStr.substr(0, optsStr.size()-1);\n\n\toptsStr += \" level: \" + string(himan::HPLevelTypeToString.at(requestedLevel.Type())) + \" \" + boost::lexical_cast<string> (requestedLevel.Value());\n\n\titsLogger->Warning(\"No valid data found with given search options \" + optsStr);\n\n\tthrow kFileDataNotFound;\n\n}\n\n\nshared_ptr<himan::info> fetcher::Fetch(shared_ptr<const plugin_configuration> config,\n\t\t\t\t\t\t\t\t\t\tconst forecast_time& requestedTime,\n\t\t\t\t\t\t\t\t\t\tconst level& requestedLevel,\n\t\t\t\t\t\t\t\t\t\tconst param& requestedParam,\n\t\t\t\t\t\t\t\t\t\tbool readPackedData,\n\t\t\t\t\t\t\t\t\t\tbool controlWaitTime)\n{\n\n\tunique_ptr<timer> t = unique_ptr<timer> (timer_factory::Instance()->GetTimer());\n\t\n\tif (config->StatisticsEnabled())\n\t{\n\t\tt->Start();\n\t}\n\t\n\tvector<shared_ptr<info>> theInfos;\n\tunsigned int waitedSeconds = 0;\n\n\tlevel newLevel = requestedLevel;\n\n\tdo\n\t{\n\t\t\/\/ Loop over all source producers if more than one specified\n\n\t\tfor (size_t prodNum = 0; prodNum < config->SizeSourceProducers(); prodNum++)\n\t\t{\n\t\t\n\t\t\tproducer sourceProd(config->SourceProducer(prodNum));\n\n\t\t\tif (itsDoLevelTransform &&\n\t\t\t\t\t(requestedLevel.Type() != kHybrid && requestedLevel.Type() != kPressure))\n\t\t\t{\n\t\t\t\tnewLevel = LevelTransform(sourceProd, requestedParam, requestedLevel);\n\n\t\t\t\tif (newLevel != requestedLevel)\n\t\t\t\t{\n\t\t\t\t\titsLogger->Trace(\"Transform level \" + string(HPLevelTypeToString.at(requestedLevel.Type()))\n\t\t\t\t\t\t\t\t+ \"\/\" + boost::lexical_cast<string> (requestedLevel.Value())\n\t\t\t\t\t\t\t\t+ \" to \" + HPLevelTypeToString.at(newLevel.Type())\n\t\t\t\t\t\t\t\t+ \"\/\" + boost::lexical_cast<string> (newLevel.Value())\n\t\t\t\t\t\t\t\t+ \" for producer \" + boost::lexical_cast<string> (config->SourceProducer().Id())\n\t\t\t\t\t\t\t\t+ \", parameter \" + requestedParam.Name());\n\t\t\t\t}\n\t\t\t}\n\t\t\t\n\t\t\tconst search_options opts (requestedTime, requestedParam, newLevel, sourceProd, config);\n\n\t\t\t\/\/ itsLogger->Trace(\"Current producer: \" + sourceProd.Name());\n\n\t\t\tif (config->UseCache())\n\t\t\t{\n\n\t\t\t\t\/\/ 1. Fetch data from cache\n\n\t\t\t\tif (!itsCache)\n\t\t\t\t{\n\t\t\t\t\titsCache = dynamic_pointer_cast<plugin::cache> (plugin_factory::Instance()->Plugin(\"cache\"));\n\t\t\t\t}\n\n\t\t\t\ttheInfos = FromCache(opts);\n\n\t\t\t\tif (theInfos.size())\n\t\t\t\t{\n\t\t\t\t\titsLogger->Trace(\"Data found from cache\");\n\n\t\t\t\t\tif (config->StatisticsEnabled())\n\t\t\t\t\t{\n\t\t\t\t\t\tconfig->Statistics()->AddToCacheHitCount(1);\n\t\t\t\t\t}\n\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\n\t\t\t\/*\n\t\t\t * 2. Fetch data from auxiliary files specified at command line\n\t\t\t *\n\t\t\t * Even if file_wait_timeout is specified, auxiliary files is searched\n\t\t\t * only once.\n\t\t\t *\/\n\n\t\t\tif (config->AuxiliaryFiles().size() && waitedSeconds == 0)\n\t\t\t{\n\t\t\t\ttheInfos = FromFile(config->AuxiliaryFiles(), opts, true, readPackedData);\n\n\t\t\t\tif (theInfos.size())\n\t\t\t\t{\n\t\t\t\t\titsLogger->Trace(\"Data found from auxiliary file(s)\");\n\n\t\t\t\t\tif (config->StatisticsEnabled())\n\t\t\t\t\t{\n\t\t\t\t\t\tconfig->Statistics()->AddToCacheMissCount(1);\n\t\t\t\t\t}\n\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t\telse\n\t\t\t\t{\n\t\t\t\t\titsLogger->Trace(\"Data not found from auxiliary file(s)\");\n\t\t\t\t}\n\t\t\t}\n\n\t\t\t\/\/ 3. Fetch data from Neons\n\n\t\t\tvector<string> files;\n\n\t\t\tif (config->ReadDataFromDatabase())\n\t\t\t{\n\t\t\t\tshared_ptr<neons> n = dynamic_pointer_cast<neons> (plugin_factory::Instance()->Plugin(\"neons\"));\n\n\t\t\t\tfiles = n->Files(opts);\n\n\t\t\t\tif (!files.empty())\n\t\t\t\t{\n\t\t\t\t\ttheInfos = FromFile(files, opts, true, readPackedData);\n\n\t\t\t\t\tif (config->StatisticsEnabled())\n\t\t\t\t\t{\n\t\t\t\t\t\tconfig->Statistics()->AddToCacheMissCount(1);\n\t\t\t\t\t}\n\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\tif (controlWaitTime && config->FileWaitTimeout() > 0)\n\t\t{\n\t\t\titsLogger->Debug(\"Sleeping for \" + boost::lexical_cast<string> (SLEEPSECONDS) + \" seconds (cumulative: \" + boost::lexical_cast<string> (waitedSeconds) + \")\");\n\n\t\t\tif (!config->ReadDataFromDatabase())\n\t\t\t{\n\t\t\t\titsLogger->Warning(\"file_wait_timeout specified but file read from Neons is disabled\");\n\t\t\t}\n\n\t\t\tsleep(SLEEPSECONDS);\n\t\t}\n\n\t\twaitedSeconds += SLEEPSECONDS;\n\t}\n\twhile (controlWaitTime && waitedSeconds < config->FileWaitTimeout() * 60);\n\n\tif (config->StatisticsEnabled())\n\t{\n\t\tt->Stop();\n\n\t\tconfig->Statistics()->AddToFetchingTime(t->GetTime());\n\t}\n\t\/*\n\t * Safeguard; later in the code we do not check whether the data requested\n\t * was actually what was requested.\n\t *\/\n\n\tif (theInfos.size() == 0)\n\t{\n\t\t\/\/ If this function is called from multi-param Fetch(), do not print\n\t\t\/\/ any messages yet since we might have another source param coming\n\n\t\tif (controlWaitTime)\n\t\t{\n\t\t\tstring optsStr = \"producer(s): \";\n\n\t\t\tfor (size_t prodNum = 0; prodNum < config->SizeSourceProducers(); prodNum++)\n\t\t\t{\n\t\t\t\toptsStr += boost::lexical_cast<string> (config->SourceProducer(prodNum).Id()) + \",\";\n\t\t\t}\n\n\t\t\toptsStr = optsStr.substr(0, optsStr.size()-1);\n\n\t\t\toptsStr += \" origintime: \" + requestedTime.OriginDateTime()->String() + \", step: \" + boost::lexical_cast<string> (requestedTime.Step());\n\t\t\toptsStr += \" param: \" + requestedParam.Name();\n\t\t\toptsStr += \" level: \" + string(himan::HPLevelTypeToString.at(requestedLevel.Type())) + \" \" + boost::lexical_cast<string> (requestedLevel.Value());\n\n\t\t\titsLogger->Warning(\"No valid data found with given search options \" + optsStr);\n\t\t}\n\n\t\tthrow kFileDataNotFound;\n\t}\n\n\t\/\/ assert(theConfiguration->SourceProducer() == theInfos[0]->Producer());\n\n\tassert((theInfos[0]->Level()) == newLevel);\n\n\tassert((theInfos[0]->Time()) == requestedTime);\n\n\tassert((theInfos[0]->Param()) == requestedParam);\n\n\treturn theInfos[0];\n\n}\n\nvector<shared_ptr<himan::info>> fetcher::FromFile(const vector<string>& files, const search_options& options, bool readContents, bool readPackedData)\n{\n\n\tvector<shared_ptr<himan::info>> allInfos ;\n\n\tfor (size_t i = 0; i < files.size(); i++)\n\t{\n\t\tstring inputFile = files[i];\n\n\t\tif (!boost::filesystem::exists(inputFile))\n\t\t{\n\t\t\titsLogger->Error(\"Input file '\" + inputFile + \"' does not exist\");\n\t\t\tcontinue;\n\t\t}\n\n\t\tvector<shared_ptr<himan::info>> curInfos;\n\n\t\tswitch (util::FileType(inputFile))\n\t\t{\n\n\t\tcase kGRIB:\n\t\tcase kGRIB1:\n\t\tcase kGRIB2:\n\t\t{\n\n\t\t\tcurInfos = FromGrib(inputFile, options, readContents, readPackedData);\n\t\t\tbreak;\n\n\t\t}\n\n\t\tcase kQueryData:\n\t\t{\n\t\t\tcurInfos = FromQueryData(inputFile, options, readContents);\n\t\t\tbreak;\n\t\t}\n\n\t\tcase kNetCDF:\n\t\t\titsLogger->Error(\"File is NetCDF\");\n\t\t\tbreak;\n\n\t\tdefault:\n\t\t\t\/\/ Unknown file type, cannot proceed\n\t\t\tthrow runtime_error(\"Input file is neither GRIB, NetCDF nor QueryData\");\n\t\t\tbreak;\n\t\t}\n\n\t\tallInfos.insert(allInfos.end(), curInfos.begin(), curInfos.end());\n\n\t\tif (curInfos.size())\n\t\t{\n\t\t\tif (options.configuration->UseCache())\n\t\t\t{\n\t\t\t\titsCache->Insert(allInfos);\n\t\t\t}\n\n\t\t\tbreak; \/\/ We found what we were looking for\n\t\t}\n\n\t}\n\n\treturn allInfos;\n}\n\nvector<shared_ptr<himan::info> > fetcher::FromCache(const search_options& options)\n{\n\tvector<shared_ptr<himan::info>> infos = itsCache->GetInfo(options);\n\n\treturn infos;\n}\n\nvector<shared_ptr<himan::info> > fetcher::FromGrib(const string& inputFile, const search_options& options, bool readContents, bool readPackedData)\n{\n\n\tshared_ptr<grib> g = dynamic_pointer_cast<grib> (plugin_factory::Instance()->Plugin(\"grib\"));\n\n\tvector<shared_ptr<info>> infos = g->FromFile(inputFile, options, readContents, readPackedData);\n\n\treturn infos;\n}\n\nvector<shared_ptr<himan::info>> fetcher::FromQueryData(const string& inputFile, const search_options& options, bool readContents)\n{\n\n\tshared_ptr<querydata> q = dynamic_pointer_cast<querydata> (plugin_factory::Instance()->Plugin(\"querydata\"));\n\n\tshared_ptr<info> i = q->FromFile(inputFile, options, readContents);\n\n\tvector<shared_ptr<info>> theInfos;\n\n\ttheInfos.push_back(i);\n\n\treturn theInfos;\n}\n\nhiman::level fetcher::LevelTransform(const producer& sourceProducer, const param& targetParam,\tconst level& targetLevel) const\n{\n\n\tlevel sourceLevel = targetLevel;\n\n\tif (sourceProducer.TableVersion() != kHPMissingInt)\n\t{\n\t\tshared_ptr<neons> n = dynamic_pointer_cast <neons> (plugin_factory::Instance()->Plugin(\"neons\"));\n\n\t\tstring lvlName = n->NeonsDB().GetGridLevelName(targetParam.Name(), targetLevel.Type(), 204, sourceProducer.TableVersion());\n\n\t\tHPLevelType lvlType = kUnknownLevel;\n\n\t\tdouble lvlValue = targetLevel.Value();\n\n\t\tif (lvlName == \"GROUND\")\n\t\t{\n\t\t\tlvlType = kGround;\n\t\t\tlvlValue = 0;\n\t\t}\n\t\telse if (lvlName == \"PRESSURE\")\n\t\t{\n\t\t\tlvlType = kPressure;\n\t\t}\n\t\telse if (lvlName == \"HYBRID\")\n\t\t{\n\t\t\tlvlType = kHybrid;\n\t\t}\n\t\telse if (lvlName == \"HEIGHT\")\n\t\t{\n\t\t\tlvlType = kHeight;\n\t\t}\n\t\telse\n\t\t{\n\t\t\tthrow runtime_error(ClassName() + \": Unknown level type: \" + lvlName);\n\t\t}\n\n\t\tsourceLevel = level(lvlType, lvlValue, lvlName);\n\t}\n\telse\n\t{\n\t\tsourceLevel = targetLevel;\n\t}\n\n\treturn sourceLevel;\n}\n\nvoid fetcher::DoLevelTransform(bool theDoLevelTransform)\n{\n\titsDoLevelTransform = theDoLevelTransform;\n}\n\nbool fetcher::DoLevelTransform() const\n{\n\treturn itsDoLevelTransform;\n}<|endoftext|>"} {"text":"<commit_before>#include \"geotiff.h\"\n#include \"cpl_conv.h\" \/\/ for CPLMalloc()\n#include \"file_accessor.h\"\n#include \"gdal_frmts.h\"\n#include \"grid.h\"\n#include \"lambert_conformal_grid.h\"\n#include \"lambert_equal_area_grid.h\"\n#include \"latitude_longitude_grid.h\"\n#include \"logger.h\"\n#include \"plugin_factory.h\"\n#include \"producer.h\"\n#include \"reduced_gaussian_grid.h\"\n#include \"s3.h\"\n#include \"stereographic_grid.h\"\n#include \"timer.h\"\n#include \"transverse_mercator_grid.h\"\n#include \"util.h\"\n#include <algorithm>\n#include <boost\/filesystem.hpp>\n#include <boost\/regex.hpp>\n#include <ogr_spatialref.h>\n\n#include \"plugin_factory.h\"\n#include \"radon.h\"\n\n#pragma GCC diagnostic push\n#pragma GCC diagnostic ignored \"-Wold-style-cast\"\n#include \"gdal_priv.h\"\n\n#pragma GCC diagnostic pop\n\nusing namespace himan;\nusing namespace himan::plugin;\n\n#include \"radon.h\"\n\ngeotiff::geotiff()\n{\n\titsLogger = logger(\"geotiff\");\n}\n\nhiman::file_information geotiff::ToFile(info<double>& anInfo)\n{\n\treturn ToFile<double>(anInfo);\n}\n\ntemplate <typename T>\nfile_information geotiff::ToFile(info<T>& anInfo)\n{\n\tif (anInfo.Grid()->Class() == kIrregularGrid && anInfo.Grid()->Type() != kReducedGaussian)\n\t{\n\t\titsLogger.Error(\"Unable to write irregular grid of type \" + HPGridTypeToString.at(anInfo.Grid()->Type()) +\n\t\t \" to geotiff\");\n\t\tthrow kInvalidWriteOptions;\n\t}\n\n\titsLogger.Fatal(\"No support for writing geotiff data\");\n\thiman::Abort();\n}\n\ntemplate file_information geotiff::ToFile<double>(info<double>&);\ntemplate file_information geotiff::ToFile<float>(info<float>&);\n\nstd::unique_ptr<grid> ReadAreaAndGrid(GDALDataset* poDataset)\n{\n\tlogger log(\"geotiff\");\n\tconst int ni = poDataset->GetRasterXSize(), nj = poDataset->GetRasterYSize();\n\tdouble adfGeoTransform[6];\n\tif (poDataset->GetGeoTransform(adfGeoTransform) != CE_None)\n\t{\n\t\tlog.Error(\"File does not contain geo transformation coefficients\");\n\t\treturn nullptr;\n\t}\n\n\tconst double di = adfGeoTransform[1];\n\tconst double dj = fabs(adfGeoTransform[5]);\n\tconst point fp(adfGeoTransform[0], adfGeoTransform[3]);\n\tconst HPScanningMode sm = (adfGeoTransform[5] < 0) ? kTopLeft : kBottomLeft;\n\tASSERT(di > 0);\n\n\tstd::string proj = poDataset->GetProjectionRef();\n\n\tif (proj.empty())\n\t{\n\t\t\/\/ Use OCRSpatialReference ?\n\t\treturn std::unique_ptr<latitude_longitude_grid>(\n\t\t new latitude_longitude_grid(sm, fp, ni, nj, di, dj, earth_shape<double>()));\n\t}\n\n\tconst OGRSpatialReference spRef(proj.c_str());\n\tconst std::string projection = spRef.GetAttrValue(\"PROJECTION\");\n\n\tif (projection == SRS_PT_LAMBERT_AZIMUTHAL_EQUAL_AREA)\n\t{\n\t\treturn std::unique_ptr<lambert_equal_area_grid>(new lambert_equal_area_grid(\n\t\t sm, fp, ni, nj, di, dj, std::unique_ptr<OGRSpatialReference>(spRef.Clone()), true));\n\t}\n\telse if (projection == SRS_PT_TRANSVERSE_MERCATOR)\n\t{\n\t\treturn std::unique_ptr<transverse_mercator_grid>(new transverse_mercator_grid(\n\t\t sm, fp, ni, nj, di, dj, std::unique_ptr<OGRSpatialReference>(spRef.Clone()), true));\n\t}\n\tlog.Error(\"Unsupported projection: \" + projection);\n\treturn nullptr;\n}\n\nparam ReadParam(const std::map<std::string, std::string>& meta, const producer& prod, const param& par)\n{\n\tstd::string param_value;\n\n\tfor (const auto& m : meta)\n\t{\n\t\tif (m.first == \"param_name\")\n\t\t{\n\t\t\tparam_value = m.second;\n\t\t\tbreak;\n\t\t}\n\t}\n\n\tif (param_value.empty())\n\t{\n\t\treturn par;\n\t}\n\n\tauto r = GET_PLUGIN(radon);\n\n\tauto parameter = r->RadonDB().GetParameterFromGeoTIFF(prod.Id(), param_value);\n\n\tif (parameter[\"name\"].empty())\n\t{\n\t\treturn par;\n\t}\n\n\treturn param(parameter[\"name\"]);\n}\n\nlevel ReadLevel(const std::map<std::string, std::string>& meta, const level& lvl)\n{\n\t\/\/ Don't know how to deal with this yet\n\treturn lvl;\n}\n\nforecast_type ReadForecastType(const std::map<std::string, std::string>& meta, const forecast_type& ftype)\n{\n\t\/\/ Don't know how to deal with this yet\n\treturn ftype;\n}\n\nvoid SQLTimeMaskToCTimeMask(std::string& sqlTimeMask)\n{\n\tboost::replace_all(sqlTimeMask, \"YYYY\", \"%Y\");\n\tboost::replace_all(sqlTimeMask, \"MM\", \"%m\");\n\tboost::replace_all(sqlTimeMask, \"DD\", \"%d\");\n\tboost::replace_all(sqlTimeMask, \"hh\", \"%H\");\n\tboost::replace_all(sqlTimeMask, \"mm\", \"%M\");\n}\n\nforecast_time ReadTime(const std::map<std::string, std::string>& meta, const forecast_time& ftime)\n{\n\tstd::string origintime, validtime, mask;\n\tfor (const auto& m : meta)\n\t{\n\t\tif (m.first == \"analysis_time\")\n\t\t{\n\t\t\torigintime = m.second;\n\t\t}\n\t\telse if (m.first == \"valid_time\")\n\t\t{\n\t\t\tvalidtime = m.second;\n\t\t}\n\t\telse if (m.first == \"time_mask\")\n\t\t{\n\t\t\tmask = m.second;\n\t\t}\n\t}\n\n\tif (origintime.empty())\n\t{\n\t\treturn ftime;\n\t}\n\n\tif (validtime.empty())\n\t{\n\t\tvalidtime = origintime;\n\t}\n\n\tif (mask.find(\"YYYY\") != std::string::npos)\n\t{\n\t\tSQLTimeMaskToCTimeMask(mask);\n\t}\n\n\treturn forecast_time(raw_time(origintime, mask), raw_time(validtime, mask));\n}\n\ntemplate <typename T>\nGDALDataType TypeToGDALType();\n\ntemplate <>\nGDALDataType TypeToGDALType<float>()\n{\n\treturn GDT_Float32;\n}\n\ntemplate <>\nGDALDataType TypeToGDALType<double>()\n{\n\treturn GDT_Float64;\n}\n\ntemplate <typename T>\nT ConvertTo(const std::string& str)\n{\n\tstd::istringstream ss(str);\n\tT num;\n\tss >> num;\n\treturn num;\n}\n\nstd::map<std::string, std::string> ParseMetadata(char** mdata, const producer& prod)\n{\n\tstd::map<std::string, std::string> ret;\n\tstd::stringstream ss;\n\tss << \"SELECT attribute, key, mask FROM geotiff_metadata WHERE producer_id = \" << prod.Id();\n\n\tauto r = GET_PLUGIN(radon);\n\n\tr->RadonDB().Query(ss.str());\n\n\tlogger log(\"geotiff\");\n\n\twhile (true)\n\t{\n\t\tconst auto row = r->RadonDB().FetchRow();\n\t\tif (row.empty())\n\t\t{\n\t\t\tbreak;\n\t\t}\n\n\t\tconst auto attribute = row[0];\n\t\tconst auto keyName = row[1];\n\t\tconst auto keyMask = row[2];\n\t\tconst char* m = CSLFetchNameValue(mdata, keyName.c_str());\n\n\t\tif (m == nullptr)\n\t\t{\n\t\t\tcontinue;\n\t\t}\n\n\t\tconst std::string metadata = std::string(m);\n\n\t\t\/\/ Try to extract information from free-form text fields\n\t\t\/\/ attribute: a metadata attribute name that Himan understands, like 'analysis_time'\n\t\t\/\/ keyName: name of the metadata element in geotiff file\n\t\t\/\/ keyMask: optional mask for the value of the key, if only specific value needs\n\t\t\/\/ to be extraced, regular expressions are used\n\n\t\tif (keyMask.empty())\n\t\t{\n\t\t\tret[attribute] = metadata;\n\t\t}\n\t\telse\n\t\t{\n\t\t\tconst boost::regex re(keyMask);\n\t\t\tboost::smatch what;\n\t\t\tif (boost::regex_search(metadata, what, re) == false || what.size() == 0)\n\t\t\t{\n\t\t\t\tlog.Warning(\"Regex did not match for attribute \" + attribute);\n\t\t\t\tlog.Warning(\"Regex: '\" + keyMask + \"' Metadata: '\" + metadata + \"'\");\n\t\t\t}\n\n\t\t\tif (what.size() != 2)\n\t\t\t{\n\t\t\t\tlog.Fatal(\"Regex matched too many times: \" + std::to_string(what.size() - 1));\n\t\t\t\thiman::Abort();\n\t\t\t}\n\n\t\t\tlog.Debug(\"Regex match for \" + attribute + \": \" + what[1]);\n\t\t\tret[attribute] = what[1];\n\t\t}\n\t}\n\n\treturn ret;\n}\n\ntemplate <typename T>\nvoid ReadData(GDALRasterBand* poBand, matrix<T>& mat, const std::map<std::string, std::string>& meta)\n{\n\tif (meta.find(\"missing_value\") != meta.end())\n\t{\n\t\tmat.MissingValue(ConvertTo<T>(meta.at(\"missing_value\")));\n\t}\n\n\tASSERT(poBand->GetXSize() == mat.SizeX());\n\tASSERT(poBand->GetYSize() == mat.SizeY());\n\n\tint nXSize = poBand->GetXSize();\n\tint nYSize = poBand->GetYSize();\n\n\tif (poBand->RasterIO(GF_Read, 0, 0, nXSize, nYSize, mat.ValuesAsPOD(), nXSize, nYSize, TypeToGDALType<T>(), 0, 0) !=\n\t CE_None)\n\t{\n\t\tthrow std::runtime_error(\"Read failed\");\n\t}\n\t\/\/ Change missingvalue to our own\n\tmat.MissingValue(MissingValue<T>());\n}\n\nstd::vector<std::shared_ptr<info<double>>> geotiff::FromFile(const file_information& theInputFile,\n const search_options& options) const\n{\n\treturn FromFile<double>(theInputFile, options);\n}\n\ntemplate <typename T>\nstd::vector<std::shared_ptr<info<T>>> geotiff::FromFile(const file_information& theInputFile,\n const search_options& options) const\n{\n\tstd::vector<std::shared_ptr<himan::info<T>>> infos;\n\n\tGDALRegister_GTiff();\n\t\/\/ GDALRegister_COG(); \/\/ not working, maybe due to using an oldish gdal version\n\n\tstd::unique_ptr<GDALDataset, std::function<void(GDALDataset*)>> poDataset(\n\t reinterpret_cast<GDALDataset*>(GDALOpen(theInputFile.file_location.c_str(), GA_ReadOnly)),\n\t [](GDALDataset* dset) { GDALClose(dset); });\n\n\tif (poDataset == nullptr)\n\t{\n\t\titsLogger.Error(\"Failed to open dataset from \" + theInputFile.file_location);\n\t\treturn infos;\n\t}\n\n\tauto meta = ParseMetadata(poDataset->GetMetadata(), options.prod); \/\/ Get full dataset metadata\n\n\tif (meta.size() == 0)\n\t{\n\t\titsLogger.Error(\"Failed to parse metadata from \" + theInputFile.file_location);\n\t\treturn infos;\n\t}\n\n\tauto area = ReadAreaAndGrid(poDataset.get());\n\n\tif (area == nullptr)\n\t{\n\t\treturn infos;\n\t}\n\n\t\/\/ \"first guess\" metadata from file metadata\n\tauto par = ReadParam(meta, options.prod, options.param);\n\tauto lvl = ReadLevel(meta, options.level);\n\tauto ftype = ReadForecastType(meta, options.ftype);\n\tauto ftime = ReadTime(meta, options.time);\n\n\tauto MakeInfoFromGeoTIFFBand = [&](GDALRasterBand* poBand) -> std::shared_ptr<info<T>> {\n\n\t\t\/\/ Read possible metadata from band\n\t\tauto bmeta = ParseMetadata(poBand->GetMetadata(), options.prod);\n\n\t\tauto bpar = ReadParam(bmeta, options.prod, par);\n\t\tauto blvl = ReadLevel(bmeta, lvl);\n\t\tauto bftype = ReadForecastType(bmeta, ftype);\n\t\tauto bftime = ReadTime(bmeta, ftime);\n\n\t\tif (options.time != bftime)\n\t\t{\n\t\t\titsLogger.Warning(\"Time does not match: \" + options.time.OriginDateTime().String() + \" step \" +\n\t\t\t options.time.Step().String(\"%02H:%02M:%02S\") + \" vs \" + bftime.OriginDateTime().String() +\n\t\t\t \" step \" + bftime.Step().String(\"%02H:%02M:%02S\"));\n\t\t}\n\t\tif (options.level != blvl)\n\t\t{\n\t\t\titsLogger.Warning(\"Level does not match\");\n\t\t}\n\t\tif (options.ftype != bftype)\n\t\t{\n\t\t\titsLogger.Warning(\"Forecast type does not match\");\n\t\t}\n\t\tif (options.param != bpar)\n\t\t{\n\t\t\titsLogger.Warning(\"param does not match: \" + options.param.Name() + \" vs \" + bpar.Name());\n\t\t}\n\n\t\tauto anInfo = std::make_shared<info<T>>(bftype, bftime, blvl, bpar);\n\t\tauto b = std::make_shared<base<T>>();\n\t\tb->grid = std::shared_ptr<grid>(area->Clone());\n\n\t\tanInfo->Create(b, true);\n\t\tanInfo->Producer(options.prod);\n\n\t\tReadData<T>(poBand, anInfo->Data(), meta);\n\n\t\treturn anInfo;\n\t};\n\n\tif (theInputFile.message_no == boost::none)\n\t{\n\t\tfor (int bandNo = 1; bandNo <= poDataset->GetRasterCount(); bandNo++)\n\t\t{\n\t\t\tGDALRasterBand* poBand = poDataset->GetRasterBand(bandNo);\n\t\t\tinfos.push_back(MakeInfoFromGeoTIFFBand(poBand));\n\t\t}\n\t}\n\telse\n\t{\n\t\tGDALRasterBand* poBand = poDataset->GetRasterBand(static_cast<int>(theInputFile.message_no.get()));\n\t\tinfos.push_back(MakeInfoFromGeoTIFFBand(poBand));\n\t}\n\n\treturn infos;\n}\n\ntemplate std::vector<std::shared_ptr<info<double>>> geotiff::FromFile<double>(const file_information&,\n const search_options&) const;\ntemplate std::vector<std::shared_ptr<info<float>>> geotiff::FromFile<float>(const file_information&,\n const search_options&) const;\n<commit_msg>Log read geotiff file names and band numbers<commit_after>#include \"geotiff.h\"\n#include \"cpl_conv.h\" \/\/ for CPLMalloc()\n#include \"file_accessor.h\"\n#include \"gdal_frmts.h\"\n#include \"grid.h\"\n#include \"lambert_conformal_grid.h\"\n#include \"lambert_equal_area_grid.h\"\n#include \"latitude_longitude_grid.h\"\n#include \"logger.h\"\n#include \"plugin_factory.h\"\n#include \"producer.h\"\n#include \"reduced_gaussian_grid.h\"\n#include \"s3.h\"\n#include \"stereographic_grid.h\"\n#include \"timer.h\"\n#include \"transverse_mercator_grid.h\"\n#include \"util.h\"\n#include <algorithm>\n#include <boost\/filesystem.hpp>\n#include <boost\/regex.hpp>\n#include <ogr_spatialref.h>\n\n#include \"plugin_factory.h\"\n#include \"radon.h\"\n\n#pragma GCC diagnostic push\n#pragma GCC diagnostic ignored \"-Wold-style-cast\"\n#include \"gdal_priv.h\"\n\n#pragma GCC diagnostic pop\n\nusing namespace himan;\nusing namespace himan::plugin;\n\n#include \"radon.h\"\n\ngeotiff::geotiff()\n{\n\titsLogger = logger(\"geotiff\");\n}\n\nhiman::file_information geotiff::ToFile(info<double>& anInfo)\n{\n\treturn ToFile<double>(anInfo);\n}\n\ntemplate <typename T>\nfile_information geotiff::ToFile(info<T>& anInfo)\n{\n\tif (anInfo.Grid()->Class() == kIrregularGrid && anInfo.Grid()->Type() != kReducedGaussian)\n\t{\n\t\titsLogger.Error(\"Unable to write irregular grid of type \" + HPGridTypeToString.at(anInfo.Grid()->Type()) +\n\t\t \" to geotiff\");\n\t\tthrow kInvalidWriteOptions;\n\t}\n\n\titsLogger.Fatal(\"No support for writing geotiff data\");\n\thiman::Abort();\n}\n\ntemplate file_information geotiff::ToFile<double>(info<double>&);\ntemplate file_information geotiff::ToFile<float>(info<float>&);\n\nstd::unique_ptr<grid> ReadAreaAndGrid(GDALDataset* poDataset)\n{\n\tlogger log(\"geotiff\");\n\tconst int ni = poDataset->GetRasterXSize(), nj = poDataset->GetRasterYSize();\n\tdouble adfGeoTransform[6];\n\tif (poDataset->GetGeoTransform(adfGeoTransform) != CE_None)\n\t{\n\t\tlog.Error(\"File does not contain geo transformation coefficients\");\n\t\treturn nullptr;\n\t}\n\n\tconst double di = adfGeoTransform[1];\n\tconst double dj = fabs(adfGeoTransform[5]);\n\tconst point fp(adfGeoTransform[0], adfGeoTransform[3]);\n\tconst HPScanningMode sm = (adfGeoTransform[5] < 0) ? kTopLeft : kBottomLeft;\n\tASSERT(di > 0);\n\n\tstd::string proj = poDataset->GetProjectionRef();\n\n\tif (proj.empty())\n\t{\n\t\t\/\/ Use OCRSpatialReference ?\n\t\treturn std::unique_ptr<latitude_longitude_grid>(\n\t\t new latitude_longitude_grid(sm, fp, ni, nj, di, dj, earth_shape<double>()));\n\t}\n\n\tconst OGRSpatialReference spRef(proj.c_str());\n\tconst std::string projection = spRef.GetAttrValue(\"PROJECTION\");\n\n\tif (projection == SRS_PT_LAMBERT_AZIMUTHAL_EQUAL_AREA)\n\t{\n\t\treturn std::unique_ptr<lambert_equal_area_grid>(new lambert_equal_area_grid(\n\t\t sm, fp, ni, nj, di, dj, std::unique_ptr<OGRSpatialReference>(spRef.Clone()), true));\n\t}\n\telse if (projection == SRS_PT_TRANSVERSE_MERCATOR)\n\t{\n\t\treturn std::unique_ptr<transverse_mercator_grid>(new transverse_mercator_grid(\n\t\t sm, fp, ni, nj, di, dj, std::unique_ptr<OGRSpatialReference>(spRef.Clone()), true));\n\t}\n\tlog.Error(\"Unsupported projection: \" + projection);\n\treturn nullptr;\n}\n\nparam ReadParam(const std::map<std::string, std::string>& meta, const producer& prod, const param& par)\n{\n\tstd::string param_value;\n\n\tfor (const auto& m : meta)\n\t{\n\t\tif (m.first == \"param_name\")\n\t\t{\n\t\t\tparam_value = m.second;\n\t\t\tbreak;\n\t\t}\n\t}\n\n\tif (param_value.empty())\n\t{\n\t\treturn par;\n\t}\n\n\tauto r = GET_PLUGIN(radon);\n\n\tauto parameter = r->RadonDB().GetParameterFromGeoTIFF(prod.Id(), param_value);\n\n\tif (parameter[\"name\"].empty())\n\t{\n\t\treturn par;\n\t}\n\n\treturn param(parameter[\"name\"]);\n}\n\nlevel ReadLevel(const std::map<std::string, std::string>& meta, const level& lvl)\n{\n\t\/\/ Don't know how to deal with this yet\n\treturn lvl;\n}\n\nforecast_type ReadForecastType(const std::map<std::string, std::string>& meta, const forecast_type& ftype)\n{\n\t\/\/ Don't know how to deal with this yet\n\treturn ftype;\n}\n\nvoid SQLTimeMaskToCTimeMask(std::string& sqlTimeMask)\n{\n\tboost::replace_all(sqlTimeMask, \"YYYY\", \"%Y\");\n\tboost::replace_all(sqlTimeMask, \"MM\", \"%m\");\n\tboost::replace_all(sqlTimeMask, \"DD\", \"%d\");\n\tboost::replace_all(sqlTimeMask, \"hh\", \"%H\");\n\tboost::replace_all(sqlTimeMask, \"mm\", \"%M\");\n}\n\nforecast_time ReadTime(const std::map<std::string, std::string>& meta, const forecast_time& ftime)\n{\n\tstd::string origintime, validtime, mask;\n\tfor (const auto& m : meta)\n\t{\n\t\tif (m.first == \"analysis_time\")\n\t\t{\n\t\t\torigintime = m.second;\n\t\t}\n\t\telse if (m.first == \"valid_time\")\n\t\t{\n\t\t\tvalidtime = m.second;\n\t\t}\n\t\telse if (m.first == \"time_mask\")\n\t\t{\n\t\t\tmask = m.second;\n\t\t}\n\t}\n\n\tif (origintime.empty())\n\t{\n\t\treturn ftime;\n\t}\n\n\tif (validtime.empty())\n\t{\n\t\tvalidtime = origintime;\n\t}\n\n\tif (mask.find(\"YYYY\") != std::string::npos)\n\t{\n\t\tSQLTimeMaskToCTimeMask(mask);\n\t}\n\n\treturn forecast_time(raw_time(origintime, mask), raw_time(validtime, mask));\n}\n\ntemplate <typename T>\nGDALDataType TypeToGDALType();\n\ntemplate <>\nGDALDataType TypeToGDALType<float>()\n{\n\treturn GDT_Float32;\n}\n\ntemplate <>\nGDALDataType TypeToGDALType<double>()\n{\n\treturn GDT_Float64;\n}\n\ntemplate <typename T>\nT ConvertTo(const std::string& str)\n{\n\tstd::istringstream ss(str);\n\tT num;\n\tss >> num;\n\treturn num;\n}\n\nstd::map<std::string, std::string> ParseMetadata(char** mdata, const producer& prod)\n{\n\tstd::map<std::string, std::string> ret;\n\tstd::stringstream ss;\n\tss << \"SELECT attribute, key, mask FROM geotiff_metadata WHERE producer_id = \" << prod.Id();\n\n\tauto r = GET_PLUGIN(radon);\n\n\tr->RadonDB().Query(ss.str());\n\n\tlogger log(\"geotiff\");\n\n\twhile (true)\n\t{\n\t\tconst auto row = r->RadonDB().FetchRow();\n\t\tif (row.empty())\n\t\t{\n\t\t\tbreak;\n\t\t}\n\n\t\tconst auto attribute = row[0];\n\t\tconst auto keyName = row[1];\n\t\tconst auto keyMask = row[2];\n\t\tconst char* m = CSLFetchNameValue(mdata, keyName.c_str());\n\n\t\tif (m == nullptr)\n\t\t{\n\t\t\tcontinue;\n\t\t}\n\n\t\tconst std::string metadata = std::string(m);\n\n\t\t\/\/ Try to extract information from free-form text fields\n\t\t\/\/ attribute: a metadata attribute name that Himan understands, like 'analysis_time'\n\t\t\/\/ keyName: name of the metadata element in geotiff file\n\t\t\/\/ keyMask: optional mask for the value of the key, if only specific value needs\n\t\t\/\/ to be extraced, regular expressions are used\n\n\t\tif (keyMask.empty())\n\t\t{\n\t\t\tret[attribute] = metadata;\n\t\t}\n\t\telse\n\t\t{\n\t\t\tconst boost::regex re(keyMask);\n\t\t\tboost::smatch what;\n\t\t\tif (boost::regex_search(metadata, what, re) == false || what.size() == 0)\n\t\t\t{\n\t\t\t\tlog.Warning(\"Regex did not match for attribute \" + attribute);\n\t\t\t\tlog.Warning(\"Regex: '\" + keyMask + \"' Metadata: '\" + metadata + \"'\");\n\t\t\t}\n\n\t\t\tif (what.size() != 2)\n\t\t\t{\n\t\t\t\tlog.Fatal(\"Regex matched too many times: \" + std::to_string(what.size() - 1));\n\t\t\t\thiman::Abort();\n\t\t\t}\n\n\t\t\tlog.Debug(\"Regex match for \" + attribute + \": \" + what[1]);\n\t\t\tret[attribute] = what[1];\n\t\t}\n\t}\n\n\treturn ret;\n}\n\ntemplate <typename T>\nvoid ReadData(GDALRasterBand* poBand, matrix<T>& mat, const std::map<std::string, std::string>& meta)\n{\n\tif (meta.find(\"missing_value\") != meta.end())\n\t{\n\t\tmat.MissingValue(ConvertTo<T>(meta.at(\"missing_value\")));\n\t}\n\n\tASSERT(poBand->GetXSize() == mat.SizeX());\n\tASSERT(poBand->GetYSize() == mat.SizeY());\n\n\tint nXSize = poBand->GetXSize();\n\tint nYSize = poBand->GetYSize();\n\n\tif (poBand->RasterIO(GF_Read, 0, 0, nXSize, nYSize, mat.ValuesAsPOD(), nXSize, nYSize, TypeToGDALType<T>(), 0, 0) !=\n\t CE_None)\n\t{\n\t\tthrow std::runtime_error(\"Read failed\");\n\t}\n\t\/\/ Change missingvalue to our own\n\tmat.MissingValue(MissingValue<T>());\n}\n\nstd::vector<std::shared_ptr<info<double>>> geotiff::FromFile(const file_information& theInputFile,\n const search_options& options) const\n{\n\treturn FromFile<double>(theInputFile, options);\n}\n\ntemplate <typename T>\nstd::vector<std::shared_ptr<info<T>>> geotiff::FromFile(const file_information& theInputFile,\n const search_options& options) const\n{\n\tstd::vector<std::shared_ptr<himan::info<T>>> infos;\n\n\tGDALRegister_GTiff();\n\t\/\/ GDALRegister_COG(); \/\/ not working, maybe due to using an oldish gdal version\n\n\tstd::unique_ptr<GDALDataset, std::function<void(GDALDataset*)>> poDataset(\n\t reinterpret_cast<GDALDataset*>(GDALOpen(theInputFile.file_location.c_str(), GA_ReadOnly)),\n\t [](GDALDataset* dset) { GDALClose(dset); });\n\n\tif (poDataset == nullptr)\n\t{\n\t\titsLogger.Error(\"Failed to open dataset from \" + theInputFile.file_location);\n\t\treturn infos;\n\t}\n\n\tauto meta = ParseMetadata(poDataset->GetMetadata(), options.prod); \/\/ Get full dataset metadata\n\n\tif (meta.size() == 0)\n\t{\n\t\titsLogger.Error(\"Failed to parse metadata from \" + theInputFile.file_location);\n\t\treturn infos;\n\t}\n\n\tauto area = ReadAreaAndGrid(poDataset.get());\n\n\tif (area == nullptr)\n\t{\n\t\treturn infos;\n\t}\n\n\t\/\/ \"first guess\" metadata from file metadata\n\tauto par = ReadParam(meta, options.prod, options.param);\n\tauto lvl = ReadLevel(meta, options.level);\n\tauto ftype = ReadForecastType(meta, options.ftype);\n\tauto ftime = ReadTime(meta, options.time);\n\n\tauto MakeInfoFromGeoTIFFBand = [&](GDALRasterBand* poBand) -> std::shared_ptr<info<T>> {\n\n\t\t\/\/ Read possible metadata from band\n\t\tauto bmeta = ParseMetadata(poBand->GetMetadata(), options.prod);\n\n\t\tauto bpar = ReadParam(bmeta, options.prod, par);\n\t\tauto blvl = ReadLevel(bmeta, lvl);\n\t\tauto bftype = ReadForecastType(bmeta, ftype);\n\t\tauto bftime = ReadTime(bmeta, ftime);\n\n\t\tif (options.time != bftime)\n\t\t{\n\t\t\titsLogger.Warning(\"Time does not match: \" + options.time.OriginDateTime().String() + \" step \" +\n\t\t\t options.time.Step().String(\"%02H:%02M:%02S\") + \" vs \" + bftime.OriginDateTime().String() +\n\t\t\t \" step \" + bftime.Step().String(\"%02H:%02M:%02S\"));\n\t\t}\n\t\tif (options.level != blvl)\n\t\t{\n\t\t\titsLogger.Warning(\"Level does not match\");\n\t\t}\n\t\tif (options.ftype != bftype)\n\t\t{\n\t\t\titsLogger.Warning(\"Forecast type does not match\");\n\t\t}\n\t\tif (options.param != bpar)\n\t\t{\n\t\t\titsLogger.Warning(\"param does not match: \" + options.param.Name() + \" vs \" + bpar.Name());\n\t\t}\n\n\t\tauto anInfo = std::make_shared<info<T>>(bftype, bftime, blvl, bpar);\n\t\tauto b = std::make_shared<base<T>>();\n\t\tb->grid = std::shared_ptr<grid>(area->Clone());\n\n\t\tanInfo->Create(b, true);\n\t\tanInfo->Producer(options.prod);\n\n\t\tReadData<T>(poBand, anInfo->Data(), meta);\n\n\t\treturn anInfo;\n\t};\n\n\tif (theInputFile.message_no == boost::none)\n\t{\n\t\tfor (int bandNo = 1; bandNo <= poDataset->GetRasterCount(); bandNo++)\n\t\t{\n\t\t\titsLogger.Info(\"Read from file '\" + theInputFile.file_location + \"- band# \" + std::to_string(bandNo));\n\t\t\tGDALRasterBand* poBand = poDataset->GetRasterBand(bandNo);\n\t\t\tinfos.push_back(MakeInfoFromGeoTIFFBand(poBand));\n\t\t}\n\t}\n\telse\n\t{\n\t\titsLogger.Info(\"Read from file '\" + theInputFile.file_location + \"' band# \" +\n\t\t std::to_string(theInputFile.message_no.get()));\n\t\tGDALRasterBand* poBand = poDataset->GetRasterBand(static_cast<int>(theInputFile.message_no.get()));\n\t\tinfos.push_back(MakeInfoFromGeoTIFFBand(poBand));\n\t}\n\n\treturn infos;\n}\n\ntemplate std::vector<std::shared_ptr<info<double>>> geotiff::FromFile<double>(const file_information&,\n const search_options&) const;\ntemplate std::vector<std::shared_ptr<info<float>>> geotiff::FromFile<float>(const file_information&,\n const search_options&) const;\n<|endoftext|>"} {"text":"<commit_before>\n#ifdef _WIN32\n#include <Windows.h>\n#else\n#include <pthread.h>\n#endif\n\n#include <nstd\/Signal.h>\n#include <nstd\/Debug.h>\n\nSignal::Signal(bool set)\n{\n#ifdef _WIN32\n VERIFY(handle = CreateEvent(NULL, TRUE, set ? TRUE : FALSE, NULL));\n#else\n ASSERT(sizeof(cdata) >= sizeof(pthread_cond_t));\n ASSERT(sizeof(mdata) >= sizeof(pthread_mutex_t));\n pthread_cond_init((pthread_cond_t*)cdata, 0);\n pthread_mutex_init((pthread_mutex_t*)mdata, 0);\n signaled = set;\n#endif\n}\n\nSignal::~Signal()\n{\n#ifdef _WIN32\n VERIFY(CloseHandle(handle));\n#else\n VERIFY(pthread_cond_destroy((pthread_cond_t*)cdata) == 0);\n VERIFY(pthread_mutex_destroy((pthread_mutex_t*)mdata) == 0);\n#endif\n}\n\nvoid Signal::set()\n{\n#ifdef _WIN32\n VERIFY(SetEvent(handle));\n#else\n VERIFY(pthread_mutex_lock((pthread_mutex_t*)mdata) == 0);\n signaled = true;\n VERIFY(pthread_mutex_unlock((pthread_mutex_t*)mdata) == 0);\n VERIFY(pthread_cond_signal((pthread_cond_t*)cdata) == 0);\n#endif\n}\n\nvoid Signal::reset()\n{\n#ifdef _WIN32\n VERIFY(ResetEvent(handle));\n#else\n VERIFY(pthread_mutex_lock((pthread_mutex_t*)mdata) == 0);\n signaled = false;\n VERIFY(pthread_mutex_unlock((pthread_mutex_t*)mdata) == 0);\n#endif\n}\n\nbool Signal::wait()\n{\n#ifdef _WIN32\n return WaitForSingleObject(handle, INFINITE) == WAIT_OBJECT_0;\n#else\n VERIFY(pthread_mutex_lock((pthread_mutex_t*)mdata) == 0);\n for(;;)\n {\n if(signaled)\n {\n VERIFY(pthread_mutex_unlock((pthread_mutex_t*)mdata) == 0);\n return true;\n }\n VERIFY(pthread_cond_wait((pthread_cond_t*)cdata, (pthread_mutex_t*)mdata) == 0);\n }\n#endif\n}\n\nbool Signal::wait(int64 timeout)\n{\n#ifdef _WIN32\n return WaitForSingleObject(handle, (DWORD)timeout) == WAIT_OBJECT_0;\n#else\n struct timespec ts;\n clock_gettime(CLOCK_REALTIME, &ts);\n ts.tv_nsec += (timeout % 1000) * 1000000;\n ts.tv_sec += timeout \/ 1000 + ts.tv_nsec \/ 1000000000;\n ts.tv_nsec %= 1000000000;\n VERIFY(pthread_mutex_lock((pthread_mutex_t*)mdata) == 0);\n for(;;)\n {\n if(signaled)\n {\n VERIFY(pthread_mutex_unlock((pthread_mutex_t*)mdata) == 0);\n return true;\n }\n if(pthread_cond_timedwait((pthread_cond_t*)cdata, (pthread_mutex_t*)mdata, &ts) != 0)\n {\n VERIFY(pthread_mutex_unlock((pthread_mutex_t*)mdata) == 0);\n return false;\n }\n }\n#endif\n}\n<commit_msg>Signal: Fixed thread waking on Linux<commit_after>\n#ifdef _WIN32\n#include <Windows.h>\n#else\n#include <pthread.h>\n#endif\n\n#include <nstd\/Signal.h>\n#include <nstd\/Debug.h>\n\nSignal::Signal(bool set)\n{\n#ifdef _WIN32\n VERIFY(handle = CreateEvent(NULL, TRUE, set ? TRUE : FALSE, NULL));\n#else\n ASSERT(sizeof(cdata) >= sizeof(pthread_cond_t));\n ASSERT(sizeof(mdata) >= sizeof(pthread_mutex_t));\n pthread_cond_init((pthread_cond_t*)cdata, 0);\n pthread_mutex_init((pthread_mutex_t*)mdata, 0);\n signaled = set;\n#endif\n}\n\nSignal::~Signal()\n{\n#ifdef _WIN32\n VERIFY(CloseHandle(handle));\n#else\n VERIFY(pthread_cond_destroy((pthread_cond_t*)cdata) == 0);\n VERIFY(pthread_mutex_destroy((pthread_mutex_t*)mdata) == 0);\n#endif\n}\n\nvoid Signal::set()\n{\n#ifdef _WIN32\n VERIFY(SetEvent(handle));\n#else\n VERIFY(pthread_mutex_lock((pthread_mutex_t*)mdata) == 0);\n signaled = true;\n VERIFY(pthread_mutex_unlock((pthread_mutex_t*)mdata) == 0);\n VERIFY(pthread_cond_broadcast((pthread_cond_t*)cdata) == 0);\n#endif\n}\n\nvoid Signal::reset()\n{\n#ifdef _WIN32\n VERIFY(ResetEvent(handle));\n#else\n VERIFY(pthread_mutex_lock((pthread_mutex_t*)mdata) == 0);\n signaled = false;\n VERIFY(pthread_mutex_unlock((pthread_mutex_t*)mdata) == 0);\n#endif\n}\n\nbool Signal::wait()\n{\n#ifdef _WIN32\n return WaitForSingleObject(handle, INFINITE) == WAIT_OBJECT_0;\n#else\n VERIFY(pthread_mutex_lock((pthread_mutex_t*)mdata) == 0);\n for(;;)\n {\n if(signaled)\n {\n VERIFY(pthread_mutex_unlock((pthread_mutex_t*)mdata) == 0);\n return true;\n }\n VERIFY(pthread_cond_wait((pthread_cond_t*)cdata, (pthread_mutex_t*)mdata) == 0);\n }\n#endif\n}\n\nbool Signal::wait(int64 timeout)\n{\n#ifdef _WIN32\n return WaitForSingleObject(handle, (DWORD)timeout) == WAIT_OBJECT_0;\n#else\n struct timespec ts;\n clock_gettime(CLOCK_REALTIME, &ts);\n ts.tv_nsec += (timeout % 1000) * 1000000;\n ts.tv_sec += timeout \/ 1000 + ts.tv_nsec \/ 1000000000;\n ts.tv_nsec %= 1000000000;\n VERIFY(pthread_mutex_lock((pthread_mutex_t*)mdata) == 0);\n for(;;)\n {\n if(signaled)\n {\n VERIFY(pthread_mutex_unlock((pthread_mutex_t*)mdata) == 0);\n return true;\n }\n if(pthread_cond_timedwait((pthread_cond_t*)cdata, (pthread_mutex_t*)mdata, &ts) != 0)\n {\n VERIFY(pthread_mutex_unlock((pthread_mutex_t*)mdata) == 0);\n return false;\n }\n }\n#endif\n}\n<|endoftext|>"} {"text":"<commit_before>\/*\n * This file is part of libArcus\n *\n * Copyright (C) 2015 Ultimaker b.v. <a.hiemstra@ultimaker.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\n * by the Free Software Foundation, either version 3 of the License, or\n * (at your option) any later version.\n *\n * This program is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the\n * GNU Affero General Public License for more details.\n * 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 \"Socket.h\"\n#include \"Socket_p.h\"\n\n#include <algorithm>\n#include <typeinfo>\n\nusing namespace Arcus;\n\nSocket::Socket() : d(new SocketPrivate)\n{\n}\n\nSocket::~Socket()\n{\n if(d->thread)\n {\n if(d->state != SocketState::Closed || d->state != SocketState::Error)\n {\n d->nextState = SocketState::Closing;\n if(d->thread)\n {\n d->thread->join();\n d->thread = nullptr;\n }\n }\n delete d->thread;\n }\n}\n\nSocketState::State Socket::state() const\n{\n return d->state;\n}\n\nstd::string Socket::errorString() const\n{\n return d->errorString;\n}\n\nvoid Socket::clearError()\n{\n d->errorString.clear();\n}\n\nvoid Socket::registerMessageType(int type, const google::protobuf::Message* messageType)\n{\n if(d->state != SocketState::Initial)\n {\n return;\n }\n\n if(type <= 0)\n throw new std::bad_typeid();\n\n d->messageTypes[type] = messageType;\n d->messageTypeMapping[messageType->GetDescriptor()] = type;\n}\n\nvoid Socket::addListener(SocketListener* listener)\n{\n if(d->state != SocketState::Initial)\n {\n return;\n }\n\n listener->setSocket(this);\n d->listeners.push_back(listener);\n}\n\nvoid Socket::removeListener(SocketListener* listener)\n{\n if(d->state != SocketState::Initial)\n {\n return;\n }\n\n auto itr = std::find(d->listeners.begin(), d->listeners.end(), listener);\n d->listeners.erase(itr);\n}\n\nvoid Socket::connect(const std::string& address, int port)\n{\n d->address = address;\n d->port = port;\n d->nextState = SocketState::Connecting;\n d->thread = new std::thread([&]() { d->run(); });\n}\n\nvoid Socket::reset()\n{\n if (d->state != SocketState::Closed &&\n d->state != SocketState::Error)\n return;\n\n if(d->thread)\n {\n d->thread->join();\n d->thread = nullptr;\n }\n\n d->state = SocketState::Initial;\n d->nextState = SocketState::Initial;\n d->errorString = \"\";\n}\n\nvoid Socket::listen(const std::string& address, int port)\n{\n d->address = address;\n d->port = port;\n d->nextState = SocketState::Opening;\n d->thread = new std::thread([&]() { d->run(); });\n}\n\nvoid Socket::close()\n{\n d->nextState = SocketState::Closing;\n if(d->thread)\n {\n d->thread->join();\n d->thread = nullptr;\n }\n}\n\nvoid Socket::sendMessage(MessagePtr message)\n{\n std::lock_guard<std::mutex> lock(d->sendQueueMutex);\n d->sendQueue.push_back(message);\n}\n\nMessagePtr Socket::takeNextMessage()\n{\n std::lock_guard<std::mutex> lock(d->receiveQueueMutex);\n if(d->receiveQueue.size() > 0)\n {\n MessagePtr next = d->receiveQueue.front();\n d->receiveQueue.pop_front();\n return next;\n }\n else\n {\n return nullptr;\n }\n}\n<commit_msg>Socket: Only connect if there's no signs of connection<commit_after>\/*\n * This file is part of libArcus\n *\n * Copyright (C) 2015 Ultimaker b.v. <a.hiemstra@ultimaker.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\n * by the Free Software Foundation, either version 3 of the License, or\n * (at your option) any later version.\n *\n * This program is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the\n * GNU Affero General Public License for more details.\n * 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 \"Socket.h\"\n#include \"Socket_p.h\"\n\n#include <algorithm>\n#include <typeinfo>\n\nusing namespace Arcus;\n\nSocket::Socket() : d(new SocketPrivate)\n{\n}\n\nSocket::~Socket()\n{\n if(d->thread)\n {\n if(d->state != SocketState::Closed || d->state != SocketState::Error)\n {\n d->nextState = SocketState::Closing;\n if(d->thread)\n {\n d->thread->join();\n d->thread = nullptr;\n }\n }\n delete d->thread;\n }\n}\n\nSocketState::State Socket::state() const\n{\n return d->state;\n}\n\nstd::string Socket::errorString() const\n{\n return d->errorString;\n}\n\nvoid Socket::clearError()\n{\n d->errorString.clear();\n}\n\nvoid Socket::registerMessageType(int type, const google::protobuf::Message* messageType)\n{\n if(d->state != SocketState::Initial)\n {\n return;\n }\n\n if(type <= 0)\n throw new std::bad_typeid();\n\n d->messageTypes[type] = messageType;\n d->messageTypeMapping[messageType->GetDescriptor()] = type;\n}\n\nvoid Socket::addListener(SocketListener* listener)\n{\n if(d->state != SocketState::Initial)\n {\n return;\n }\n\n listener->setSocket(this);\n d->listeners.push_back(listener);\n}\n\nvoid Socket::removeListener(SocketListener* listener)\n{\n if(d->state != SocketState::Initial)\n {\n return;\n }\n\n auto itr = std::find(d->listeners.begin(), d->listeners.end(), listener);\n d->listeners.erase(itr);\n}\n\nvoid Socket::connect(const std::string& address, int port)\n{\n if(d->state != SocketState::Initial || d->thread != nullptr)\n {\n return;\n }\n\n d->address = address;\n d->port = port;\n d->nextState = SocketState::Connecting;\n d->thread = new std::thread([&]() { d->run(); });\n}\n\nvoid Socket::reset()\n{\n if (d->state != SocketState::Closed &&\n d->state != SocketState::Error)\n return;\n\n if(d->thread)\n {\n d->thread->join();\n d->thread = nullptr;\n }\n\n d->state = SocketState::Initial;\n d->nextState = SocketState::Initial;\n d->errorString = \"\";\n}\n\nvoid Socket::listen(const std::string& address, int port)\n{\n d->address = address;\n d->port = port;\n d->nextState = SocketState::Opening;\n d->thread = new std::thread([&]() { d->run(); });\n}\n\nvoid Socket::close()\n{\n d->nextState = SocketState::Closing;\n if(d->thread)\n {\n d->thread->join();\n d->thread = nullptr;\n }\n}\n\nvoid Socket::sendMessage(MessagePtr message)\n{\n std::lock_guard<std::mutex> lock(d->sendQueueMutex);\n d->sendQueue.push_back(message);\n}\n\nMessagePtr Socket::takeNextMessage()\n{\n std::lock_guard<std::mutex> lock(d->receiveQueueMutex);\n if(d->receiveQueue.size() > 0)\n {\n MessagePtr next = d->receiveQueue.front();\n d->receiveQueue.pop_front();\n return next;\n }\n else\n {\n return nullptr;\n }\n}\n<|endoftext|>"} {"text":"<commit_before>\n\/*\n * Stream.cpp\n * sfeMovie project\n *\n * Copyright (C) 2010-2015 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 <libavcodec\/avcodec.h>\n#include <libswscale\/swscale.h>\n}\n\n#include \"Stream.hpp\"\n#include \"Utilities.hpp\"\n#include \"TimerPriorities.hpp\"\n#include <cassert>\n#include <iostream>\n#include <stdexcept>\n\nnamespace sfe\n{\n std::string Stream::AVStreamDescription(AVStream* stream)\n {\n return std::string(\"'\" + std::string(av_get_media_type_string(stream->codec->codec_type))\n + \"\/\" + avcodec_get_name(stream->codec->codec_id) + \"' stream @ \" + s(stream));\n }\n \n Stream::Stream(AVFormatContext*& formatCtx, AVStream*& stream, DataSource& dataSource, std::shared_ptr<Timer> timer) :\n m_formatCtx(formatCtx),\n m_stream(stream),\n m_dataSource(dataSource),\n m_timer(timer),\n m_codec(nullptr),\n m_streamID(-1),\n m_packetList(),\n m_status(Stopped),\n m_readerMutex()\n {\n CHECK(stream, \"Stream::Stream() - invalid stream argument\");\n CHECK(timer, \"Inconcistency error: null timer\");\n int err = 0;\n \n m_stream = stream;\n m_streamID = stream->index;\n CHECK(m_stream, \"Inconcistency error: null stream\")\n CHECK(m_streamID >= 0, \"Inconcistency error: invalid stream id\");\n \n \/\/ Get the decoder\n m_codec = avcodec_find_decoder(m_stream->codec->codec_id);\n CHECK(m_codec, \"Stream() - no decoder for \" + std::string(avcodec_get_name(m_stream->codec->codec_id)) + \" codec\");\n \n \/\/ Load the codec\n err = avcodec_open2(m_stream->codec, m_codec, nullptr);\n CHECK0(err, \"Stream() - unable to load decoder for codec \" + std::string(avcodec_get_name(m_stream->codec->codec_id)));\n \n AVDictionaryEntry* entry = av_dict_get(m_stream->metadata, \"language\", nullptr, 0);\n if (entry)\n {\n m_language = entry->value;\n }\n }\n \n Stream::~Stream()\n {\n disconnect();\n flushBuffers();\n \n if (m_formatCtx && m_stream && m_stream->codec)\n {\n avcodec_close(m_stream->codec);\n }\n }\n \n void Stream::connect()\n {\n if (isPassive())\n m_timer->addObserver(*this, PassiveStreamTimerPriority);\n else\n m_timer->addObserver(*this, ActiveStreamTimerPriority);\n }\n \n void Stream::disconnect()\n {\n m_timer->removeObserver(*this);\n }\n \n void Stream::pushEncodedData(AVPacket* packet)\n {\n CHECK(packet, \"invalid argument\");\n sf::Lock l(m_readerMutex);\n m_packetList.push_back(packet);\n }\n \n void Stream::prependEncodedData(AVPacket* packet)\n {\n CHECK(packet, \"invalid argument\");\n sf::Lock l(m_readerMutex);\n m_packetList.push_front(packet);\n }\n \n AVPacket* Stream::popEncodedData()\n {\n AVPacket* result = nullptr;\n sf::Lock l(m_readerMutex);\n \n if (m_packetList.empty() && !isPassive())\n {\n m_dataSource.requestMoreData(*this);\n }\n \n if (!m_packetList.empty())\n {\n result = m_packetList.front();\n m_packetList.pop_front();\n }\n else\n {\n if (m_stream->codec->codec->capabilities & CODEC_CAP_DELAY)\n {\n AVPacket* flushPacket = (AVPacket*)av_malloc(sizeof(*flushPacket));\n av_init_packet(flushPacket);\n flushPacket->data = nullptr;\n flushPacket->size = 0;\n result = flushPacket;\n \n sfeLogDebug(\"Sending flush packet: \" + mediaTypeToString(getStreamKind()));\n }\n }\n \n return result;\n }\n \n void Stream::flushBuffers()\n {\n sf::Lock l(m_readerMutex);\n if (getStatus() == Playing)\n {\n sfeLogWarning(\"packets flushed while the stream is still playing\");\n }\n \n if (m_formatCtx && m_stream)\n avcodec_flush_buffers(m_stream->codec);\n \n AVPacket* pkt = nullptr;\n \n while (!m_packetList.empty())\n {\n pkt = m_packetList.front();\n m_packetList.pop_front();\n \n av_free_packet(pkt);\n av_free(pkt);\n }\n }\n \n bool Stream::needsMoreData() const\n {\n return m_packetList.size() < 10;\n }\n \n MediaType Stream::getStreamKind() const\n {\n return Unknown;\n }\n \n Status Stream::getStatus() const\n {\n return m_status;\n }\n \n std::string Stream::getLanguage() const\n {\n return m_language;\n }\n \n sf::Time Stream::computeEncodedPosition()\n {\n if (m_packetList.empty())\n {\n m_dataSource.requestMoreData(*this);\n return sf::Time::Zero;\n }\n else\n {\n sf::Lock l(m_readerMutex);\n AVPacket* packet = m_packetList.front();\n CHECK(packet, \"internal inconcistency\");\n \n int64_t timestamp = -424242;\n \n if (packet->dts != AV_NOPTS_VALUE)\n {\n timestamp = packet->dts;\n }\n else if (packet->pts != AV_NOPTS_VALUE)\n {\n int64_t startTime = m_stream->start_time != AV_NOPTS_VALUE ? m_stream->start_time : 0;\n timestamp = packet->pts - startTime;\n }\n \n AVRational seconds = av_mul_q(av_make_q(timestamp, 1), m_stream->time_base);\n return sf::milliseconds(1000 * av_q2d(seconds));\n }\n }\n \n sf::Time Stream::packetDuration(const AVPacket* packet) const\n {\n CHECK(packet, \"inconcistency error: null packet\");\n CHECK(packet->stream_index == m_streamID, \"Asking for duration of a packet for a different stream!\");\n \n if (packet->duration != 0)\n {\n AVRational seconds = av_mul_q(av_make_q(packet->duration, 1), m_stream->time_base);\n return sf::seconds(av_q2d(seconds));\n }\n else\n {\n return sf::seconds(1. \/ av_q2d(av_guess_frame_rate(m_formatCtx, m_stream, nullptr)));\n }\n }\n \n std::string Stream::description() const\n {\n return AVStreamDescription(m_stream);\n }\n \n bool Stream::canUsePacket(AVPacket* packet) const\n {\n CHECK(packet, \"inconcistency error: null argument\");\n \n return packet->stream_index == m_stream->index;\n }\n \n bool Stream::isPassive() const\n {\n return false;\n }\n \n void Stream::setStatus(Status status)\n {\n m_status = status;\n }\n \n void Stream::didPlay(const Timer& timer, Status previousStatus)\n {\n setStatus(Playing);\n }\n \n void Stream::didPause(const Timer& timer, Status previousStatus)\n {\n setStatus(Paused);\n }\n \n void Stream::didStop(const Timer& timer, Status previousStatus)\n {\n setStatus(Stopped);\n }\n \n bool Stream::didSeek(const Timer& timer, sf::Time oldPosition)\n {\n if (timer.getOffset() != sf::Time::Zero)\n return fastForward(timer.getOffset());\n \n return true;\n }\n \n bool Stream::hasPackets()\n {\n return !m_packetList.empty();\n }\n}\n<commit_msg>Fix mistake in pull request<commit_after>\n\/*\n * Stream.cpp\n * sfeMovie project\n *\n * Copyright (C) 2010-2015 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 <libavcodec\/avcodec.h>\n#include <libswscale\/swscale.h>\n}\n\n#include \"Stream.hpp\"\n#include \"Utilities.hpp\"\n#include \"TimerPriorities.hpp\"\n#include <cassert>\n#include <iostream>\n#include <stdexcept>\n\nnamespace sfe\n{\n std::string Stream::AVStreamDescription(AVStream* stream)\n {\n return std::string(\"'\" + std::string(av_get_media_type_string(stream->codec->codec_type))\n + \"\/\" + avcodec_get_name(stream->codec->codec_id) + \"' stream @ \" + s(stream));\n }\n \n Stream::Stream(AVFormatContext*& formatCtx, AVStream*& stream, DataSource& dataSource, std::shared_ptr<Timer> timer) :\n m_formatCtx(formatCtx),\n m_stream(stream),\n m_dataSource(dataSource),\n m_timer(timer),\n m_codec(nullptr),\n m_streamID(-1),\n m_packetList(),\n m_status(Stopped),\n m_readerMutex()\n {\n CHECK(stream, \"Stream::Stream() - invalid stream argument\");\n CHECK(timer, \"Inconcistency error: null timer\");\n int err = 0;\n \n m_stream = stream;\n m_streamID = stream->index;\n CHECK(m_stream, \"Inconcistency error: null stream\")\n CHECK(m_streamID >= 0, \"Inconcistency error: invalid stream id\");\n \n \/\/ Get the decoder\n m_codec = avcodec_find_decoder(m_stream->codec->codec_id);\n CHECK(m_codec, \"Stream() - no decoder for \" + std::string(avcodec_get_name(m_stream->codec->codec_id)) + \" codec\");\n \n \/\/ Load the codec\n err = avcodec_open2(m_stream->codec, m_codec, nullptr);\n CHECK0(err, \"Stream() - unable to load decoder for codec \" + std::string(avcodec_get_name(m_stream->codec->codec_id)));\n \n AVDictionaryEntry* entry = av_dict_get(m_stream->metadata, \"language\", nullptr, 0);\n if (entry)\n {\n m_language = entry->value;\n }\n }\n \n Stream::~Stream()\n {\n disconnect();\n flushBuffers();\n \n if (m_formatCtx && m_stream && m_stream->codec)\n {\n avcodec_close(m_stream->codec);\n }\n }\n \n void Stream::connect()\n {\n if (isPassive())\n m_timer->addObserver(*this, PassiveStreamTimerPriority);\n else\n m_timer->addObserver(*this, ActiveStreamTimerPriority);\n }\n \n void Stream::disconnect()\n {\n m_timer->removeObserver(*this);\n }\n \n void Stream::pushEncodedData(AVPacket* packet)\n {\n CHECK(packet, \"invalid argument\");\n sf::Lock l(m_readerMutex);\n m_packetList.push_back(packet);\n }\n \n void Stream::prependEncodedData(AVPacket* packet)\n {\n CHECK(packet, \"invalid argument\");\n sf::Lock l(m_readerMutex);\n m_packetList.push_front(packet);\n }\n \n AVPacket* Stream::popEncodedData()\n {\n AVPacket* result = nullptr;\n sf::Lock l(m_readerMutex);\n \n if (m_packetList.empty() && !isPassive())\n {\n m_dataSource.requestMoreData(*this);\n }\n \n if (!m_packetList.empty())\n {\n result = m_packetList.front();\n m_packetList.pop_front();\n }\n else\n {\n if (m_stream->codec->codec->capabilities & CODEC_CAP_DELAY)\n {\n AVPacket* flushPacket = (AVPacket*)av_malloc(sizeof(*flushPacket));\n av_init_packet(flushPacket);\n flushPacket->data = nullptr;\n flushPacket->size = 0;\n result = flushPacket;\n \n sfeLogDebug(\"Sending flush packet: \" + mediaTypeToString(getStreamKind()));\n }\n }\n \n return result;\n }\n \n void Stream::flushBuffers()\n {\n sf::Lock l(m_readerMutex);\n if (getStatus() == Playing)\n {\n sfeLogWarning(\"packets flushed while the stream is still playing\");\n }\n \n if (m_formatCtx && m_stream)\n avcodec_flush_buffers(m_stream->codec);\n \n AVPacket* pkt = nullptr;\n \n while (!m_packetList.empty())\n {\n pkt = m_packetList.front();\n m_packetList.pop_front();\n \n av_free_packet(pkt);\n av_free(pkt);\n }\n }\n \n bool Stream::needsMoreData() const\n {\n return m_packetList.size() < 10;\n }\n \n MediaType Stream::getStreamKind() const\n {\n return Unknown;\n }\n \n Status Stream::getStatus() const\n {\n return m_status;\n }\n \n std::string Stream::getLanguage() const\n {\n return m_language;\n }\n \n sf::Time Stream::computeEncodedPosition()\n {\n if (m_packetList.empty())\n {\n m_dataSource.requestMoreData(*this);\n }\n \n if (m_packetList.empty())\n {\n return sf::Time::Zero;\n }\n else\n {\n sf::Lock l(m_readerMutex);\n AVPacket* packet = m_packetList.front();\n CHECK(packet, \"internal inconcistency\");\n \n int64_t timestamp = -424242;\n \n if (packet->dts != AV_NOPTS_VALUE)\n {\n timestamp = packet->dts;\n }\n else if (packet->pts != AV_NOPTS_VALUE)\n {\n int64_t startTime = m_stream->start_time != AV_NOPTS_VALUE ? m_stream->start_time : 0;\n timestamp = packet->pts - startTime;\n }\n \n AVRational seconds = av_mul_q(av_make_q(timestamp, 1), m_stream->time_base);\n return sf::milliseconds(1000 * av_q2d(seconds));\n }\n }\n \n sf::Time Stream::packetDuration(const AVPacket* packet) const\n {\n CHECK(packet, \"inconcistency error: null packet\");\n CHECK(packet->stream_index == m_streamID, \"Asking for duration of a packet for a different stream!\");\n \n if (packet->duration != 0)\n {\n AVRational seconds = av_mul_q(av_make_q(packet->duration, 1), m_stream->time_base);\n return sf::seconds(av_q2d(seconds));\n }\n else\n {\n return sf::seconds(1. \/ av_q2d(av_guess_frame_rate(m_formatCtx, m_stream, nullptr)));\n }\n }\n \n std::string Stream::description() const\n {\n return AVStreamDescription(m_stream);\n }\n \n bool Stream::canUsePacket(AVPacket* packet) const\n {\n CHECK(packet, \"inconcistency error: null argument\");\n \n return packet->stream_index == m_stream->index;\n }\n \n bool Stream::isPassive() const\n {\n return false;\n }\n \n void Stream::setStatus(Status status)\n {\n m_status = status;\n }\n \n void Stream::didPlay(const Timer& timer, Status previousStatus)\n {\n setStatus(Playing);\n }\n \n void Stream::didPause(const Timer& timer, Status previousStatus)\n {\n setStatus(Paused);\n }\n \n void Stream::didStop(const Timer& timer, Status previousStatus)\n {\n setStatus(Stopped);\n }\n \n bool Stream::didSeek(const Timer& timer, sf::Time oldPosition)\n {\n if (timer.getOffset() != sf::Time::Zero)\n return fastForward(timer.getOffset());\n \n return true;\n }\n \n bool Stream::hasPackets()\n {\n return !m_packetList.empty();\n }\n}\n<|endoftext|>"} {"text":"<commit_before>\/*\n * Copyright (C) 2005-2019 Centre National d'Etudes Spatiales (CNES)\n *\n * This file is part of Orfeo Toolbox\n *\n * https:\/\/www.orfeo-toolbox.org\/\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n *\/\n\n#include \"otbWrapperOutputImageParameter.h\"\n#include \"otbClampImageFilter.h\"\n#include \"otbImageIOFactory.h\"\n#include \"itksys\/SystemTools.hxx\"\n\n#ifdef OTB_USE_MPI\n\n#include \"otbMPIConfig.h\"\n#include \"otbMPIVrtWriter.h\"\n\n#ifdef OTB_USE_SPTW\n#include \"otbSimpleParallelTiffWriter.h\"\n#endif\n\n#endif\n\n\n#define CAST_IMAGE_BASE( T, image_base )\t\t\\\n {\t\t\t\t\t\t\t\\\n T * img = dynamic_cast< T * >( image_base );\t\\\n\t\t\t\t\t\t\t\\\n if( img )\t\t\t\t\t\t\\\n SwitchInput< T >( img );\t\t\t\t\\\n \t\t\t\t\t\t\t\\\n return;\t\t\t\t\t\t\\\n }\n\n\nnamespace otb\n{\nnamespace Wrapper\n{\n\n\/\/ Declare specialisation for UInt8RGBAImageType\ntemplate<>\nvoid OutputImageParameter::SwitchInput(UInt8RGBAImageType * );\n\n\/\/ Declare specialisation for UInt8RGBImageType\ntemplate <>\nvoid OutputImageParameter::SwitchInput( UInt8RGBImageType * );\n\n\nOutputImageParameter::OutputImageParameter()\n : m_PixelType(ImagePixelType_float),\n m_DefaultPixelType(ImagePixelType_float),\n m_RAMValue(0)\n{\n SetName(\"Output Image\");\n SetKey(\"out\");\n}\n\n\nOutputImageParameter::~OutputImageParameter()\n{\n}\n\nstd::string OutputImageParameter::ConvertPixelTypeToString(ImagePixelType type)\n{\n \/\/ TODO: Could be replaced by constant static string array e.g.:\n \/\/ return PIXEL_TYPE_NAME[ type ];\n\n std::string ret;\n switch(type)\n {\n case ImagePixelType_uint8:\n {\n ret = \"uint8\";\n break;\n }\n case ImagePixelType_int16:\n {\n ret = \"int16\";\n break;\n }\n case ImagePixelType_uint16:\n {\n ret = \"uint16\";\n break;\n }\n case ImagePixelType_int32:\n {\n ret = \"int32\";\n break;\n }\n case ImagePixelType_uint32:\n {\n ret = \"uint32\";\n break;\n }\n case ImagePixelType_float:\n {\n ret = \"float\";\n break;\n }\n case ImagePixelType_double:\n {\n ret = \"double\";\n break;\n }\n case ImagePixelType_cint16:\n {\n ret = \"cint16\";\n break;\n }\n case ImagePixelType_cint32:\n {\n ret = \"cint32\";\n break;\n }\n case ImagePixelType_cfloat:\n {\n ret = \"cfloat\";\n break;\n }\n case ImagePixelType_cdouble:\n {\n ret = \"cdouble\";\n break;\n }\n }\n return ret;\n}\n\nbool\nOutputImageParameter::ConvertStringToPixelType(const std::string &value, ImagePixelType &type)\n{\n \/\/ TODO: Could be replaced std::find_if() in constant static string\n \/\/ array (see ::ConvertPixelTypeToString().\n\n if (value == \"uint8\")\n type = ImagePixelType_uint8;\n else if (value == \"int16\")\n type = ImagePixelType_int16;\n else if (value == \"uint16\")\n type = ImagePixelType_uint16;\n else if (value == \"int32\")\n type = ImagePixelType_int32;\n else if (value == \"uint32\")\n type = ImagePixelType_uint32;\n else if (value == \"float\")\n type = ImagePixelType_float;\n else if (value == \"double\")\n type = ImagePixelType_double;\n else if (value == \"cint16\")\n type = ImagePixelType_cint16;\n else if (value == \"cint32\")\n type = ImagePixelType_cint32;\n else if (value == \"cfloat\")\n type = ImagePixelType_cfloat;\n else if (value == \"cdouble\")\n type = ImagePixelType_cdouble;\n else\n return false;\n return true;\n}\n\n\nvoid\nOutputImageParameter\n::InitializeWriters()\n{\n ImageBaseType * image = m_Image.GetPointer();\n\n CAST_IMAGE_BASE( UInt8VectorImageType, image );\n CAST_IMAGE_BASE( Int16VectorImageType, image );\n CAST_IMAGE_BASE( UInt16VectorImageType, image );\n CAST_IMAGE_BASE( Int32VectorImageType, image );\n CAST_IMAGE_BASE( UInt32VectorImageType, image );\n\n CAST_IMAGE_BASE( FloatVectorImageType, image );\n CAST_IMAGE_BASE( DoubleVectorImageType, image );\n\n CAST_IMAGE_BASE( ComplexInt16VectorImageType, image );\n CAST_IMAGE_BASE( ComplexInt32VectorImageType, image );\n CAST_IMAGE_BASE( ComplexFloatVectorImageType, image );\n CAST_IMAGE_BASE( ComplexDoubleVectorImageType, image );\n\n CAST_IMAGE_BASE( UInt8ImageType, image );\n CAST_IMAGE_BASE( Int16ImageType, image );\n CAST_IMAGE_BASE( UInt16ImageType, image );\n CAST_IMAGE_BASE( Int32ImageType, image );\n CAST_IMAGE_BASE( UInt32ImageType, image );\n\n CAST_IMAGE_BASE( FloatImageType, image );\n CAST_IMAGE_BASE( DoubleImageType, image );\n\n CAST_IMAGE_BASE( ComplexInt16ImageType, image );\n CAST_IMAGE_BASE( ComplexInt32ImageType, image );\n CAST_IMAGE_BASE( ComplexFloatImageType, image );\n CAST_IMAGE_BASE( ComplexDoubleImageType, image );\n\n CAST_IMAGE_BASE( UInt8RGBImageType, image );\n CAST_IMAGE_BASE( UInt8RGBAImageType, image );\n\n itkExceptionMacro( \"Unknown image-base type.\" );\n}\n\n\ntemplate< typename TOutputImage,\n\t typename TInputImage >\nvoid\nOutputImageParameter\n::ClampAndWriteVectorImage( TInputImage * in )\n{\n assert( !m_FileName.empty() );\n\n\n auto icif =\n ClampImageFilter< TInputImage, DoubleVectorImageType >::New();\n\n auto clampFilter =\n ClampImageFilter< DoubleVectorImageType , TOutputImage >::New();\n\n icif->SetInput( in );\n\n clampFilter->SetInput( icif->GetOutput() );\n\n\n#ifdef OTB_USE_MPI\n\n otb::MPIConfig::Pointer mpiConfig = otb::MPIConfig::Instance();\n\n if( mpiConfig->GetNbProcs() > 1 )\n {\n useStandardWriter = false;\n\n std::string extension =\n itksys::SystemTools::GetFilenameExtension( m_Filename );\n\n if(extension == \".vrt\")\n {\n \/\/ Use the MPIVrtWriter\n\n auto vrtWriter =\n\totb::MPIVrtWriter< TOutputImage >::New();\n\n vrtWriter->SetInput( clampFilter->GetOutput() );\n vrtWriter->SetFileName( m_Filename );\n vrtWriter->SetAvailableRAM( m_RAMValue);\n\n \/\/ Change internal state only when everything has been setup\n \/\/ without raising exception.\n\n m_Caster = clampFilter;\n m_Writer = vrtWriter;\n\n return;\n }\n\n#ifdef OTB_USE_SPTW\n\n else if (extension == \".tif\")\n {\n \/\/ Use simple parallel tiff writer\n\n auto sptWriter =\n\totb::SimpleParallelTiffWriter< TOutputImage >::New();\n\n sptWriter->SetFileName( m_Filename );\n sptWriter->SetInput( clampFilter->GetOutput() );\n sptWriter->GetStreamingManager()->SetDefaultRAM( m_RAMValue );\n\n \/\/ Change internal state only when everything has been setup\n \/\/ without raising exception.\n\n m_Caster = clampFilter;\n m_Writer = sptWriter;\n\n return;\n }\n\n#endif \/\/ OTB_USE_SPTW\n\n else\n {\n itkGenericExceptionMacro(\n\t\"File format \"\n\t<< extension\n\t<< \" not supported for parallel writing with MPI. Supported formats are \"\n\t \".vrt and .tif. Extended filenames are not supported.\"\n );\n }\n }\n\n#endif \/\/ OTB_USE_MPI\n\n \/\/\n \/\/ Use default OTB writer.\n\n auto writer = otb::ImageFileWriter< TOutputImage >::New();\n\n writer->SetFileName( m_FileName );\n writer->SetInput( clampFilter->GetOutput() );\n writer->GetStreamingManager()->SetDefaultRAM( m_RAMValue );\n\n \/\/ Change internal state only when everything has been setup\n \/\/ without raising exception.\n\n m_InputCaster = icif;\n m_OutputCaster = clampFilter;\n\n m_Writer = writer;\n}\n\n\ntemplate< typename TInputImage >\nvoid\nOutputImageParameter\n::SwitchInput( TInputImage * image )\n{\n assert( image );\n\n switch( m_PixelType )\n {\n case ImagePixelType_uint8:\n ClampAndWriteVectorImage< UInt8VectorImageType >( image );\n break;\n\n case ImagePixelType_int16:\n ClampAndWriteVectorImage< Int16VectorImageType >( image );\n break;\n\n case ImagePixelType_uint16:\n ClampAndWriteVectorImage< UInt16VectorImageType >( image );\n break;\n\n case ImagePixelType_int32:\n\n ClampAndWriteVectorImage< Int32VectorImageType >( image );\n break;\n\n case ImagePixelType_uint32:\n ClampAndWriteVectorImage< UInt32VectorImageType >( image );\n break;\n\n case ImagePixelType_float:\n ClampAndWriteVectorImage< FloatVectorImageType >( image );\n break;\n\n case ImagePixelType_double:\n ClampAndWriteVectorImage< DoubleVectorImageType >( image );\n break;\n\n case ImagePixelType_cint16:\n ClampAndWriteVectorImage < ComplexInt16VectorImageType >( image );\n break;\n\n case ImagePixelType_cint32:\n ClampAndWriteVectorImage < ComplexInt32VectorImageType >( image );\n break;\n\n case ImagePixelType_cfloat:\n ClampAndWriteVectorImage< ComplexFloatVectorImageType >( image );\n break;\n\n case ImagePixelType_cdouble:\n ClampAndWriteVectorImage < ComplexDoubleVectorImageType >( image );\n break;\n\n default:\n assert( false && \"Unexpected image-type.\" );\n break;\n }\n}\n\n\nvoid\nOutputImageParameter::Write()\n{\n m_Writer->Update();\n\n \/\/ Clean internal filters\n m_InputCaster = nullptr;\n m_OutputCaster = nullptr;\n\n m_Writer = nullptr;\n}\n\n\nitk::ProcessObject*\nOutputImageParameter::GetWriter()\n{\n return m_Writer;\n}\n\nImageBaseType*\nOutputImageParameter::GetValue( )\n{\n return m_Image;\n}\n\nvoid\nOutputImageParameter::SetValue(ImageBaseType* image)\n{\n m_Image = image;\n SetActive(true);\n}\n\nbool\nOutputImageParameter\n::HasValue() const\n{\n return !m_FileName.empty();\n}\n\nstd::string\nOutputImageParameter::CheckFileName(bool fixMissingExtension)\n{\n std::string ret(\"\");\n \/\/ Check that there is an ImageIO capable of writing the file\n otb::ExtendedFilenameToWriterOptions::Pointer filenameHelper =\n otb::ExtendedFilenameToWriterOptions::New();\n filenameHelper->SetExtendedFileName(this->GetFileName());\n std::string simpleFilename = filenameHelper->GetSimpleFileName();\n \/\/ TODO : check if simpleFilename is empty\n\n otb::ImageIOBase::Pointer imageIO =\n otb::ImageIOFactory::CreateImageIO(simpleFilename.c_str(),\n otb::ImageIOFactory::WriteMode);\n if(imageIO.IsNull())\n {\n \/\/ check for missing extension\n std::string outExt = itksys::SystemTools::GetFilenameLastExtension(simpleFilename);\n if (outExt.empty())\n {\n if (fixMissingExtension)\n {\n \/\/ try with .tif\n std::string fullFileName(this->GetFileName());\n std::string extendedPart = fullFileName.substr(simpleFilename.size());\n this->SetFileName(simpleFilename+std::string(\".tif\")+extendedPart);\n ret += std::string(\"no extension detected, using TIF as default.\");\n }\n else\n {\n \/\/ TODO : call exception here?\n }\n }\n else\n {\n \/\/ TODO : call exception here?\n }\n }\n return ret;\n}\n\n\/\/ Specialization for UInt8RGBAImageType\n\ntemplate<>\nvoid\nOutputImageParameter\n::SwitchInput( UInt8RGBAImageType * img )\n{\n assert( img );\n\n if( m_PixelType != ImagePixelType_uint8 )\n itkExceptionMacro(\"Unknown PixelType for RGBA Image. Only uint8 is supported.\");\n\n auto writer =\n otb::ImageFileWriter< UInt8RGBAImageType >::New();\n\n writer->SetFileName( GetFileName() );\n writer->SetInput( img );\n writer->GetStreamingManager()->SetDefaultRAM( m_RAMValue );\n\n m_Writer = writer;\n}\n\n\/\/ Specialization for UInt8RGBImageType\ntemplate<>\nvoid\nOutputImageParameter\n::SwitchInput( UInt8RGBImageType * img )\n{\n if( m_PixelType != ImagePixelType_uint8 )\n itkExceptionMacro(\"Unknown PixelType for RGB Image. Only uint8 is supported.\");\n\n auto writer = otb::ImageFileWriter< UInt8RGBImageType >::New();\n\n writer->SetFileName( GetFileName() );\n writer->SetInput( img );\n writer->GetStreamingManager()->SetDefaultRAM( m_RAMValue );\n\n m_Writer = writer;\n}\n\nvoid OutputImageParameter::SetFileName (const char* filename)\n{\n this->SetFileName(std::string(filename));\n}\n\nvoid OutputImageParameter::SetFileName (const std::string& filename)\n{\n m_FileName = filename;\n SetActive(true);\n}\n\n}\n}\n<commit_msg>ENH: 1649: Fixed compile-time error (OTB_USE_MPI).<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 \"otbWrapperOutputImageParameter.h\"\n#include \"otbClampImageFilter.h\"\n#include \"otbImageIOFactory.h\"\n#include \"itksys\/SystemTools.hxx\"\n\n#ifdef OTB_USE_MPI\n\n#include \"otbMPIConfig.h\"\n#include \"otbMPIVrtWriter.h\"\n\n#ifdef OTB_USE_SPTW\n#include \"otbSimpleParallelTiffWriter.h\"\n#endif\n\n#endif\n\n\n#define CAST_IMAGE_BASE( T, image_base )\t\t\\\n {\t\t\t\t\t\t\t\\\n T * img = dynamic_cast< T * >( image_base );\t\\\n\t\t\t\t\t\t\t\\\n if( img )\t\t\t\t\t\t\\\n SwitchInput< T >( img );\t\t\t\t\\\n \t\t\t\t\t\t\t\\\n return;\t\t\t\t\t\t\\\n }\n\n\nnamespace otb\n{\nnamespace Wrapper\n{\n\n\/\/ Declare specialisation for UInt8RGBAImageType\ntemplate<>\nvoid OutputImageParameter::SwitchInput(UInt8RGBAImageType * );\n\n\/\/ Declare specialisation for UInt8RGBImageType\ntemplate <>\nvoid OutputImageParameter::SwitchInput( UInt8RGBImageType * );\n\n\nOutputImageParameter::OutputImageParameter()\n : m_PixelType(ImagePixelType_float),\n m_DefaultPixelType(ImagePixelType_float),\n m_RAMValue(0)\n{\n SetName(\"Output Image\");\n SetKey(\"out\");\n}\n\n\nOutputImageParameter::~OutputImageParameter()\n{\n}\n\nstd::string OutputImageParameter::ConvertPixelTypeToString(ImagePixelType type)\n{\n \/\/ TODO: Could be replaced by constant static string array e.g.:\n \/\/ return PIXEL_TYPE_NAME[ type ];\n\n std::string ret;\n switch(type)\n {\n case ImagePixelType_uint8:\n {\n ret = \"uint8\";\n break;\n }\n case ImagePixelType_int16:\n {\n ret = \"int16\";\n break;\n }\n case ImagePixelType_uint16:\n {\n ret = \"uint16\";\n break;\n }\n case ImagePixelType_int32:\n {\n ret = \"int32\";\n break;\n }\n case ImagePixelType_uint32:\n {\n ret = \"uint32\";\n break;\n }\n case ImagePixelType_float:\n {\n ret = \"float\";\n break;\n }\n case ImagePixelType_double:\n {\n ret = \"double\";\n break;\n }\n case ImagePixelType_cint16:\n {\n ret = \"cint16\";\n break;\n }\n case ImagePixelType_cint32:\n {\n ret = \"cint32\";\n break;\n }\n case ImagePixelType_cfloat:\n {\n ret = \"cfloat\";\n break;\n }\n case ImagePixelType_cdouble:\n {\n ret = \"cdouble\";\n break;\n }\n }\n return ret;\n}\n\nbool\nOutputImageParameter::ConvertStringToPixelType(const std::string &value, ImagePixelType &type)\n{\n \/\/ TODO: Could be replaced std::find_if() in constant static string\n \/\/ array (see ::ConvertPixelTypeToString().\n\n if (value == \"uint8\")\n type = ImagePixelType_uint8;\n else if (value == \"int16\")\n type = ImagePixelType_int16;\n else if (value == \"uint16\")\n type = ImagePixelType_uint16;\n else if (value == \"int32\")\n type = ImagePixelType_int32;\n else if (value == \"uint32\")\n type = ImagePixelType_uint32;\n else if (value == \"float\")\n type = ImagePixelType_float;\n else if (value == \"double\")\n type = ImagePixelType_double;\n else if (value == \"cint16\")\n type = ImagePixelType_cint16;\n else if (value == \"cint32\")\n type = ImagePixelType_cint32;\n else if (value == \"cfloat\")\n type = ImagePixelType_cfloat;\n else if (value == \"cdouble\")\n type = ImagePixelType_cdouble;\n else\n return false;\n return true;\n}\n\n\nvoid\nOutputImageParameter\n::InitializeWriters()\n{\n ImageBaseType * image = m_Image.GetPointer();\n\n CAST_IMAGE_BASE( UInt8VectorImageType, image );\n CAST_IMAGE_BASE( Int16VectorImageType, image );\n CAST_IMAGE_BASE( UInt16VectorImageType, image );\n CAST_IMAGE_BASE( Int32VectorImageType, image );\n CAST_IMAGE_BASE( UInt32VectorImageType, image );\n\n CAST_IMAGE_BASE( FloatVectorImageType, image );\n CAST_IMAGE_BASE( DoubleVectorImageType, image );\n\n CAST_IMAGE_BASE( ComplexInt16VectorImageType, image );\n CAST_IMAGE_BASE( ComplexInt32VectorImageType, image );\n CAST_IMAGE_BASE( ComplexFloatVectorImageType, image );\n CAST_IMAGE_BASE( ComplexDoubleVectorImageType, image );\n\n CAST_IMAGE_BASE( UInt8ImageType, image );\n CAST_IMAGE_BASE( Int16ImageType, image );\n CAST_IMAGE_BASE( UInt16ImageType, image );\n CAST_IMAGE_BASE( Int32ImageType, image );\n CAST_IMAGE_BASE( UInt32ImageType, image );\n\n CAST_IMAGE_BASE( FloatImageType, image );\n CAST_IMAGE_BASE( DoubleImageType, image );\n\n CAST_IMAGE_BASE( ComplexInt16ImageType, image );\n CAST_IMAGE_BASE( ComplexInt32ImageType, image );\n CAST_IMAGE_BASE( ComplexFloatImageType, image );\n CAST_IMAGE_BASE( ComplexDoubleImageType, image );\n\n CAST_IMAGE_BASE( UInt8RGBImageType, image );\n CAST_IMAGE_BASE( UInt8RGBAImageType, image );\n\n itkExceptionMacro( \"Unknown image-base type.\" );\n}\n\n\ntemplate< typename TOutputImage,\n\t typename TInputImage >\nvoid\nOutputImageParameter\n::ClampAndWriteVectorImage( TInputImage * in )\n{\n assert( !m_FileName.empty() );\n\n\n auto icif =\n ClampImageFilter< TInputImage, DoubleVectorImageType >::New();\n\n auto clampFilter =\n ClampImageFilter< DoubleVectorImageType , TOutputImage >::New();\n\n icif->SetInput( in );\n\n clampFilter->SetInput( icif->GetOutput() );\n\n\n#ifdef OTB_USE_MPI\n\n otb::MPIConfig::Pointer mpiConfig = otb::MPIConfig::Instance();\n\n if( mpiConfig->GetNbProcs() > 1 )\n {\n useStandardWriter = false;\n\n std::string extension =\n itksys::SystemTools::GetFilenameExtension( m_Filename );\n\n if(extension == \".vrt\")\n {\n \/\/ Use the MPIVrtWriter\n\n auto vrtWriter =\n\totb::MPIVrtWriter< TOutputImage >::New();\n\n vrtWriter->SetInput( clampFilter->GetOutput() );\n vrtWriter->SetFileName( m_Filename );\n vrtWriter->SetAvailableRAM( m_RAMValue);\n\n \/\/ Change internal state only when everything has been setup\n \/\/ without raising exception.\n\n m_InputCaster = icif;\n m_OutputCaster = clampFilter;\n\n m_Writer = vrtWriter;\n\n return;\n }\n\n#ifdef OTB_USE_SPTW\n\n else if (extension == \".tif\")\n {\n \/\/ Use simple parallel tiff writer\n\n auto sptWriter =\n\totb::SimpleParallelTiffWriter< TOutputImage >::New();\n\n sptWriter->SetFileName( m_Filename );\n sptWriter->SetInput( clampFilter->GetOutput() );\n sptWriter->GetStreamingManager()->SetDefaultRAM( m_RAMValue );\n\n \/\/ Change internal state only when everything has been setup\n \/\/ without raising exception.\n\n m_InputCaster = icif;\n m_OutputCaster = clampFilter;\n\n m_Writer = sptWriter;\n\n return;\n }\n\n#endif \/\/ OTB_USE_SPTW\n\n else\n {\n itkGenericExceptionMacro(\n\t\"File format \"\n\t<< extension\n\t<< \" not supported for parallel writing with MPI. Supported formats are \"\n\t \".vrt and .tif. Extended filenames are not supported.\"\n );\n }\n }\n\n#endif \/\/ OTB_USE_MPI\n\n \/\/\n \/\/ Use default OTB writer.\n\n auto writer = otb::ImageFileWriter< TOutputImage >::New();\n\n writer->SetFileName( m_FileName );\n writer->SetInput( clampFilter->GetOutput() );\n writer->GetStreamingManager()->SetDefaultRAM( m_RAMValue );\n\n \/\/ Change internal state only when everything has been setup\n \/\/ without raising exception.\n\n m_InputCaster = icif;\n m_OutputCaster = clampFilter;\n\n m_Writer = writer;\n}\n\n\ntemplate< typename TInputImage >\nvoid\nOutputImageParameter\n::SwitchInput( TInputImage * image )\n{\n assert( image );\n\n switch( m_PixelType )\n {\n case ImagePixelType_uint8:\n ClampAndWriteVectorImage< UInt8VectorImageType >( image );\n break;\n\n case ImagePixelType_int16:\n ClampAndWriteVectorImage< Int16VectorImageType >( image );\n break;\n\n case ImagePixelType_uint16:\n ClampAndWriteVectorImage< UInt16VectorImageType >( image );\n break;\n\n case ImagePixelType_int32:\n\n ClampAndWriteVectorImage< Int32VectorImageType >( image );\n break;\n\n case ImagePixelType_uint32:\n ClampAndWriteVectorImage< UInt32VectorImageType >( image );\n break;\n\n case ImagePixelType_float:\n ClampAndWriteVectorImage< FloatVectorImageType >( image );\n break;\n\n case ImagePixelType_double:\n ClampAndWriteVectorImage< DoubleVectorImageType >( image );\n break;\n\n case ImagePixelType_cint16:\n ClampAndWriteVectorImage < ComplexInt16VectorImageType >( image );\n break;\n\n case ImagePixelType_cint32:\n ClampAndWriteVectorImage < ComplexInt32VectorImageType >( image );\n break;\n\n case ImagePixelType_cfloat:\n ClampAndWriteVectorImage< ComplexFloatVectorImageType >( image );\n break;\n\n case ImagePixelType_cdouble:\n ClampAndWriteVectorImage < ComplexDoubleVectorImageType >( image );\n break;\n\n default:\n assert( false && \"Unexpected image-type.\" );\n break;\n }\n}\n\n\nvoid\nOutputImageParameter::Write()\n{\n m_Writer->Update();\n\n \/\/ Clean internal filters\n m_InputCaster = nullptr;\n m_OutputCaster = nullptr;\n\n m_Writer = nullptr;\n}\n\n\nitk::ProcessObject*\nOutputImageParameter::GetWriter()\n{\n return m_Writer;\n}\n\nImageBaseType*\nOutputImageParameter::GetValue( )\n{\n return m_Image;\n}\n\nvoid\nOutputImageParameter::SetValue(ImageBaseType* image)\n{\n m_Image = image;\n SetActive(true);\n}\n\nbool\nOutputImageParameter\n::HasValue() const\n{\n return !m_FileName.empty();\n}\n\nstd::string\nOutputImageParameter::CheckFileName(bool fixMissingExtension)\n{\n std::string ret(\"\");\n \/\/ Check that there is an ImageIO capable of writing the file\n otb::ExtendedFilenameToWriterOptions::Pointer filenameHelper =\n otb::ExtendedFilenameToWriterOptions::New();\n filenameHelper->SetExtendedFileName(this->GetFileName());\n std::string simpleFilename = filenameHelper->GetSimpleFileName();\n \/\/ TODO : check if simpleFilename is empty\n\n otb::ImageIOBase::Pointer imageIO =\n otb::ImageIOFactory::CreateImageIO(simpleFilename.c_str(),\n otb::ImageIOFactory::WriteMode);\n if(imageIO.IsNull())\n {\n \/\/ check for missing extension\n std::string outExt = itksys::SystemTools::GetFilenameLastExtension(simpleFilename);\n if (outExt.empty())\n {\n if (fixMissingExtension)\n {\n \/\/ try with .tif\n std::string fullFileName(this->GetFileName());\n std::string extendedPart = fullFileName.substr(simpleFilename.size());\n this->SetFileName(simpleFilename+std::string(\".tif\")+extendedPart);\n ret += std::string(\"no extension detected, using TIF as default.\");\n }\n else\n {\n \/\/ TODO : call exception here?\n }\n }\n else\n {\n \/\/ TODO : call exception here?\n }\n }\n return ret;\n}\n\n\/\/ Specialization for UInt8RGBAImageType\n\ntemplate<>\nvoid\nOutputImageParameter\n::SwitchInput( UInt8RGBAImageType * img )\n{\n assert( img );\n\n if( m_PixelType != ImagePixelType_uint8 )\n itkExceptionMacro(\"Unknown PixelType for RGBA Image. Only uint8 is supported.\");\n\n auto writer =\n otb::ImageFileWriter< UInt8RGBAImageType >::New();\n\n writer->SetFileName( GetFileName() );\n writer->SetInput( img );\n writer->GetStreamingManager()->SetDefaultRAM( m_RAMValue );\n\n m_Writer = writer;\n}\n\n\/\/ Specialization for UInt8RGBImageType\ntemplate<>\nvoid\nOutputImageParameter\n::SwitchInput( UInt8RGBImageType * img )\n{\n if( m_PixelType != ImagePixelType_uint8 )\n itkExceptionMacro(\"Unknown PixelType for RGB Image. Only uint8 is supported.\");\n\n auto writer = otb::ImageFileWriter< UInt8RGBImageType >::New();\n\n writer->SetFileName( GetFileName() );\n writer->SetInput( img );\n writer->GetStreamingManager()->SetDefaultRAM( m_RAMValue );\n\n m_Writer = writer;\n}\n\nvoid OutputImageParameter::SetFileName (const char* filename)\n{\n this->SetFileName(std::string(filename));\n}\n\nvoid OutputImageParameter::SetFileName (const std::string& filename)\n{\n m_FileName = filename;\n SetActive(true);\n}\n\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#include \"mitkGetPropertyService.h\"\n#include \"QmitkAddNewPropertyDialog.h\"\n#include \"QmitkPropertiesPreferencePage.h\"\n#include \"QmitkPropertyItemDelegate.h\"\n#include \"QmitkPropertyItemModel.h\"\n#include \"QmitkPropertyItemSortFilterProxyModel.h\"\n#include \"QmitkPropertyTreeView.h\"\n#include <berryIBerryPreferences.h>\n#include <mitkIPropertyAliases.h>\n#include <mitkIPropertyDescriptions.h>\n#include <QmitkRenderWindow.h>\n#include <QPainter>\n\nconst std::string QmitkPropertyTreeView::VIEW_ID = \"org.mitk.views.properties\";\n\nQmitkPropertyTreeView::QmitkPropertyTreeView()\n : m_Parent(NULL),\n m_PropertyNameChangedTag(0),\n m_PropertyAliases(NULL),\n m_PropertyDescriptions(NULL),\n m_ShowAliasesInDescription(true),\n m_DeveloperMode(false),\n m_ProxyModel(NULL),\n m_Model(NULL),\n m_Delegate(NULL),\n m_Renderer(NULL)\n{\n}\n\nQmitkPropertyTreeView::~QmitkPropertyTreeView()\n{\n}\n\nvoid QmitkPropertyTreeView::CreateQtPartControl(QWidget* parent)\n{\n m_Parent = parent;\n\n m_Controls.setupUi(parent);\n\n m_Controls.propertyListComboBox->addItem(\"global\");\n\n m_Controls.newButton->setEnabled(false);\n\n m_Controls.description->hide();\n m_Controls.propertyListLabel->hide();\n m_Controls.propertyListComboBox->hide();\n m_Controls.newButton->hide();\n\n m_ProxyModel = new QmitkPropertyItemSortFilterProxyModel(m_Controls.treeView);\n m_Model = new QmitkPropertyItemModel(m_ProxyModel);\n\n m_ProxyModel->setSourceModel(m_Model);\n m_ProxyModel->setFilterCaseSensitivity(Qt::CaseInsensitive);\n m_ProxyModel->setSortCaseSensitivity(Qt::CaseInsensitive);\n m_ProxyModel->setDynamicSortFilter(true);\n\n m_Delegate = new QmitkPropertyItemDelegate(m_Controls.treeView);\n\n m_Controls.treeView->setItemDelegateForColumn(1, m_Delegate);\n m_Controls.treeView->setModel(m_ProxyModel);\n m_Controls.treeView->setColumnWidth(0, 180);\n m_Controls.treeView->sortByColumn(0, Qt::AscendingOrder);\n m_Controls.treeView->setSelectionBehavior(QAbstractItemView::SelectRows);\n m_Controls.treeView->setSelectionMode(QAbstractItemView::SingleSelection);\n m_Controls.treeView->setEditTriggers(QAbstractItemView::SelectedClicked | QAbstractItemView::DoubleClicked);\n\n connect(m_Controls.filterLineEdit, SIGNAL(textChanged(const QString&)), this, SLOT(OnFilterTextChanged(const QString&)));\n connect(m_Controls.propertyListComboBox, SIGNAL(currentIndexChanged(int)), this, SLOT(OnPropertyListChanged(int)));\n connect(m_Controls.newButton, SIGNAL(clicked()), this, SLOT(OnAddNewProperty()));\n connect(m_Controls.treeView->selectionModel(), SIGNAL(currentRowChanged(const QModelIndex&, const QModelIndex&)), this, SLOT(OnCurrentRowChanged(const QModelIndex&, const QModelIndex&)));\n connect(m_Model, SIGNAL(modelReset()), this, SLOT(OnModelReset()));\n}\n\nQString QmitkPropertyTreeView::GetPropertyNameOrAlias(const QModelIndex& index)\n{\n QString propertyName;\n\n if (index.isValid())\n {\n QModelIndex current = index;\n\n while (current.isValid())\n {\n QString name = m_ProxyModel->data(m_ProxyModel->index(current.row(), 0, current.parent())).toString();\n\n propertyName.prepend(propertyName.isEmpty()\n ? name\n : name.append('.'));\n\n current = current.parent();\n }\n }\n\n return propertyName;\n}\n\nvoid QmitkPropertyTreeView::OnCurrentRowChanged(const QModelIndex& current, const QModelIndex&)\n{\n if (m_PropertyDescriptions != NULL && current.isValid())\n {\n QString name = this->GetPropertyNameOrAlias(current);\n\n if (!name.isEmpty())\n {\n QString alias;\n bool isTrueName = true;\n\n if (m_PropertyAliases != NULL)\n {\n std::string trueName = m_PropertyAliases->GetPropertyName(name.toStdString());\n\n if (trueName.empty() && !m_SelectionClassName.empty())\n trueName = m_PropertyAliases->GetPropertyName(name.toStdString(), m_SelectionClassName);\n\n if (!trueName.empty())\n {\n alias = name;\n name = QString::fromStdString(trueName);\n isTrueName = false;\n }\n }\n\n QString description = QString::fromStdString(m_PropertyDescriptions->GetDescription(name.toStdString()));\n std::vector<std::string> aliases;\n\n if (!isTrueName && m_PropertyAliases != NULL)\n {\n aliases = m_PropertyAliases->GetAliases(name.toStdString(), m_SelectionClassName);\n\n if (aliases.empty() && !m_SelectionClassName.empty())\n aliases = m_PropertyAliases->GetAliases(name.toStdString());\n }\n\n if (!description.isEmpty() || !aliases.empty())\n {\n QString customizedDescription;\n\n if (m_ShowAliasesInDescription && !aliases.empty())\n {\n customizedDescription = \"<h3 style=\\\"margin-bottom:0\\\">\" + name + \"<\/h3>\";\n\n std::size_t numAliases = aliases.size();\n std::size_t lastAlias = numAliases - 1;\n\n for (std::size_t i = 0; i < numAliases; ++i)\n {\n customizedDescription += i != lastAlias\n ? \"<h5 style=\\\"margin-top:0;margin-bottom:0\\\">\"\n : \"<h5 style=\\\"margin-top:0;margin-bottom:10px\\\">\";\n\n customizedDescription += QString::fromStdString(aliases[i]) + \"<\/h5>\";\n }\n }\n else\n {\n customizedDescription = \"<h3 style=\\\"margin-bottom:10px\\\">\" + name + \"<\/h3>\";\n }\n\n if (!description.isEmpty())\n customizedDescription += description;\n\n m_Controls.description->setText(customizedDescription);\n m_Controls.description->show();\n\n return;\n }\n }\n }\n\n m_Controls.description->hide();\n}\n\nvoid QmitkPropertyTreeView::OnFilterTextChanged(const QString& filter)\n{\n m_ProxyModel->setFilterWildcard(filter);\n\n if (filter.isEmpty())\n m_Controls.treeView->collapseAll();\n else\n m_Controls.treeView->expandAll();\n}\n\nvoid QmitkPropertyTreeView::OnModelReset()\n{\n m_Controls.description->hide();\n}\n\nvoid QmitkPropertyTreeView::OnPreferencesChanged(const berry::IBerryPreferences* preferences)\n{\n bool showAliases = preferences->GetBool(QmitkPropertiesPreferencePage::SHOW_ALIASES, true);\n bool showDescriptions = preferences->GetBool(QmitkPropertiesPreferencePage::SHOW_DESCRIPTIONS, true);\n bool showAliasesInDescription = preferences->GetBool(QmitkPropertiesPreferencePage::SHOW_ALIASES_IN_DESCRIPTION, true);\n bool developerMode = preferences->GetBool(QmitkPropertiesPreferencePage::DEVELOPER_MODE, true);\n\n bool updateAliases = showAliases != (m_PropertyAliases != NULL);\n bool updateDescriptions = showDescriptions != (m_PropertyDescriptions != NULL);\n bool updateAliasesInDescription = showAliasesInDescription != m_ShowAliasesInDescription;\n bool updateDeveloperMode = developerMode != m_DeveloperMode;\n\n if (updateAliases)\n m_PropertyAliases = showAliases\n ? mitk::GetPropertyService<mitk::IPropertyAliases>()\n : NULL;\n\n if (updateDescriptions)\n m_PropertyDescriptions = showDescriptions\n ? mitk::GetPropertyService<mitk::IPropertyDescriptions>()\n : NULL;\n\n if (updateAliasesInDescription)\n m_ShowAliasesInDescription = showAliasesInDescription;\n\n if (updateDescriptions || updateAliasesInDescription)\n {\n QModelIndexList selection = m_Controls.treeView->selectionModel()->selectedRows();\n\n if (!selection.isEmpty())\n this->OnCurrentRowChanged(selection[0], selection[0]);\n }\n\n if (updateDeveloperMode)\n {\n m_DeveloperMode = developerMode;\n\n if (!developerMode)\n m_Controls.propertyListComboBox->setCurrentIndex(0);\n\n m_Controls.propertyListLabel->setVisible(developerMode);\n m_Controls.propertyListComboBox->setVisible(developerMode);\n m_Controls.newButton->setVisible(developerMode);\n }\n\n m_Model->OnPreferencesChanged(preferences);\n}\n\nvoid QmitkPropertyTreeView::OnPropertyNameChanged(const itk::EventObject&)\n{\n mitk::PropertyList* propertyList = m_Model->GetPropertyList();\n\n if (propertyList != NULL)\n {\n mitk::BaseProperty* nameProperty = propertyList->GetProperty(\"name\");\n\n if (nameProperty != NULL)\n {\n std::ostringstream partName;\n partName << \"Properties (\" << nameProperty->GetValueAsString() << ')';\n this->SetPartName(partName.str());\n }\n }\n}\n\nvoid QmitkPropertyTreeView::OnSelectionChanged(berry::IWorkbenchPart::Pointer, const QList<mitk::DataNode::Pointer>& nodes)\n{\n mitk::PropertyList* propertyList = m_Model->GetPropertyList();\n\n if (propertyList != NULL)\n {\n mitk::BaseProperty* nameProperty = propertyList->GetProperty(\"name\");\n\n if (nameProperty != NULL)\n nameProperty->RemoveObserver(m_PropertyNameChangedTag);\n\n m_PropertyNameChangedTag = 0;\n }\n\n if (nodes.empty() || nodes.front().IsNull())\n {\n m_SelectedNode = NULL;\n\n this->SetPartName(\"Properties\");\n m_Model->SetPropertyList(NULL);\n m_Delegate->SetPropertyList(NULL);\n\n m_Controls.newButton->setEnabled(false);\n }\n else\n {\n m_SelectedNode = nodes.front();\n\n QString selectionClassName = m_SelectedNode->GetData() != NULL\n ? m_SelectedNode->GetData()->GetNameOfClass()\n : \"\";\n\n m_SelectionClassName = selectionClassName.toStdString();\n m_Model->SetPropertyList(m_SelectedNode->GetPropertyList(m_Renderer), selectionClassName);\n m_Delegate->SetPropertyList(m_SelectedNode->GetPropertyList(m_Renderer));\n OnPropertyNameChanged(itk::ModifiedEvent());\n\n mitk::BaseProperty* nameProperty = m_SelectedNode->GetProperty(\"name\");\n\n if (nameProperty != NULL)\n {\n itk::ReceptorMemberCommand<QmitkPropertyTreeView>::Pointer command = itk::ReceptorMemberCommand<QmitkPropertyTreeView>::New();\n command->SetCallbackFunction(this, &QmitkPropertyTreeView::OnPropertyNameChanged);\n m_PropertyNameChangedTag = nameProperty->AddObserver(itk::ModifiedEvent(), command);\n }\n\n m_Controls.newButton->setEnabled(true);\n }\n\n if (!m_ProxyModel->filterRegExp().isEmpty())\n m_Controls.treeView->expandAll();\n}\n\nvoid QmitkPropertyTreeView::SetFocus()\n{\n m_Controls.filterLineEdit->setFocus();\n}\n\nvoid QmitkPropertyTreeView::RenderWindowPartActivated(mitk::IRenderWindowPart* renderWindowPart)\n{\n QHash<QString, QmitkRenderWindow*> renderWindows = this->GetRenderWindowPart()->GetQmitkRenderWindows();\n\n Q_FOREACH(QString renderWindow, renderWindows.keys())\n {\n m_Controls.propertyListComboBox->addItem(renderWindow);\n }\n}\n\nvoid QmitkPropertyTreeView::RenderWindowPartDeactivated(mitk::IRenderWindowPart*)\n{\n m_Controls.propertyListComboBox->clear();\n m_Controls.propertyListComboBox->addItem(\"global\");\n}\n\nvoid QmitkPropertyTreeView::OnPropertyListChanged(int index)\n{\n if (index == -1)\n return;\n\n QString renderWindow = m_Controls.propertyListComboBox->itemText(index);\n\n m_Renderer = renderWindow != \"global\"\n ? this->GetRenderWindowPart()->GetQmitkRenderWindow(renderWindow)->GetRenderer()\n : NULL;\n\n QList<mitk::DataNode::Pointer> nodes;\n\n if (m_SelectedNode.IsNotNull())\n nodes << m_SelectedNode;\n\n berry::IWorkbenchPart::Pointer workbenchPart;\n\n this->OnSelectionChanged(workbenchPart, nodes);\n}\n\nvoid QmitkPropertyTreeView::OnAddNewProperty()\n{\n QmitkAddNewPropertyDialog dialog(m_SelectedNode, m_Renderer, m_Parent);\n \n if (dialog.exec() == QDialog::Accepted)\n this->m_Model->Update();\n}\n<commit_msg>Made creation of property list combo box items more robust regarding re-opening the properties view.<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 \"mitkGetPropertyService.h\"\n#include \"QmitkAddNewPropertyDialog.h\"\n#include \"QmitkPropertiesPreferencePage.h\"\n#include \"QmitkPropertyItemDelegate.h\"\n#include \"QmitkPropertyItemModel.h\"\n#include \"QmitkPropertyItemSortFilterProxyModel.h\"\n#include \"QmitkPropertyTreeView.h\"\n#include <berryIBerryPreferences.h>\n#include <mitkIPropertyAliases.h>\n#include <mitkIPropertyDescriptions.h>\n#include <QmitkRenderWindow.h>\n#include <QPainter>\n\nconst std::string QmitkPropertyTreeView::VIEW_ID = \"org.mitk.views.properties\";\n\nQmitkPropertyTreeView::QmitkPropertyTreeView()\n : m_Parent(NULL),\n m_PropertyNameChangedTag(0),\n m_PropertyAliases(NULL),\n m_PropertyDescriptions(NULL),\n m_ShowAliasesInDescription(true),\n m_DeveloperMode(false),\n m_ProxyModel(NULL),\n m_Model(NULL),\n m_Delegate(NULL),\n m_Renderer(NULL)\n{\n}\n\nQmitkPropertyTreeView::~QmitkPropertyTreeView()\n{\n}\n\nvoid QmitkPropertyTreeView::CreateQtPartControl(QWidget* parent)\n{\n m_Parent = parent;\n\n m_Controls.setupUi(parent);\n\n m_Controls.propertyListComboBox->addItem(\"independent\");\n\n mitk::IRenderWindowPart* renderWindowPart = this->GetRenderWindowPart();\n\n if (renderWindowPart != NULL)\n {\n QHash<QString, QmitkRenderWindow*> renderWindows = renderWindowPart->GetQmitkRenderWindows();\n\n Q_FOREACH(QString renderWindow, renderWindows.keys())\n {\n m_Controls.propertyListComboBox->addItem(renderWindow);\n }\n }\n\n m_Controls.newButton->setEnabled(false);\n\n m_Controls.description->hide();\n m_Controls.propertyListLabel->hide();\n m_Controls.propertyListComboBox->hide();\n m_Controls.newButton->hide();\n\n m_ProxyModel = new QmitkPropertyItemSortFilterProxyModel(m_Controls.treeView);\n m_Model = new QmitkPropertyItemModel(m_ProxyModel);\n\n m_ProxyModel->setSourceModel(m_Model);\n m_ProxyModel->setFilterCaseSensitivity(Qt::CaseInsensitive);\n m_ProxyModel->setSortCaseSensitivity(Qt::CaseInsensitive);\n m_ProxyModel->setDynamicSortFilter(true);\n\n m_Delegate = new QmitkPropertyItemDelegate(m_Controls.treeView);\n\n m_Controls.treeView->setItemDelegateForColumn(1, m_Delegate);\n m_Controls.treeView->setModel(m_ProxyModel);\n m_Controls.treeView->setColumnWidth(0, 160);\n m_Controls.treeView->sortByColumn(0, Qt::AscendingOrder);\n m_Controls.treeView->setSelectionBehavior(QAbstractItemView::SelectRows);\n m_Controls.treeView->setSelectionMode(QAbstractItemView::SingleSelection);\n m_Controls.treeView->setEditTriggers(QAbstractItemView::SelectedClicked | QAbstractItemView::DoubleClicked);\n\n connect(m_Controls.filterLineEdit, SIGNAL(textChanged(const QString&)), this, SLOT(OnFilterTextChanged(const QString&)));\n connect(m_Controls.propertyListComboBox, SIGNAL(currentIndexChanged(int)), this, SLOT(OnPropertyListChanged(int)));\n connect(m_Controls.newButton, SIGNAL(clicked()), this, SLOT(OnAddNewProperty()));\n connect(m_Controls.treeView->selectionModel(), SIGNAL(currentRowChanged(const QModelIndex&, const QModelIndex&)), this, SLOT(OnCurrentRowChanged(const QModelIndex&, const QModelIndex&)));\n connect(m_Model, SIGNAL(modelReset()), this, SLOT(OnModelReset()));\n}\n\nQString QmitkPropertyTreeView::GetPropertyNameOrAlias(const QModelIndex& index)\n{\n QString propertyName;\n\n if (index.isValid())\n {\n QModelIndex current = index;\n\n while (current.isValid())\n {\n QString name = m_ProxyModel->data(m_ProxyModel->index(current.row(), 0, current.parent())).toString();\n\n propertyName.prepend(propertyName.isEmpty()\n ? name\n : name.append('.'));\n\n current = current.parent();\n }\n }\n\n return propertyName;\n}\n\nvoid QmitkPropertyTreeView::OnCurrentRowChanged(const QModelIndex& current, const QModelIndex&)\n{\n if (m_PropertyDescriptions != NULL && current.isValid())\n {\n QString name = this->GetPropertyNameOrAlias(current);\n\n if (!name.isEmpty())\n {\n QString alias;\n bool isTrueName = true;\n\n if (m_PropertyAliases != NULL)\n {\n std::string trueName = m_PropertyAliases->GetPropertyName(name.toStdString());\n\n if (trueName.empty() && !m_SelectionClassName.empty())\n trueName = m_PropertyAliases->GetPropertyName(name.toStdString(), m_SelectionClassName);\n\n if (!trueName.empty())\n {\n alias = name;\n name = QString::fromStdString(trueName);\n isTrueName = false;\n }\n }\n\n QString description = QString::fromStdString(m_PropertyDescriptions->GetDescription(name.toStdString()));\n std::vector<std::string> aliases;\n\n if (!isTrueName && m_PropertyAliases != NULL)\n {\n aliases = m_PropertyAliases->GetAliases(name.toStdString(), m_SelectionClassName);\n\n if (aliases.empty() && !m_SelectionClassName.empty())\n aliases = m_PropertyAliases->GetAliases(name.toStdString());\n }\n\n if (!description.isEmpty() || !aliases.empty())\n {\n QString customizedDescription;\n\n if (m_ShowAliasesInDescription && !aliases.empty())\n {\n customizedDescription = \"<h3 style=\\\"margin-bottom:0\\\">\" + name + \"<\/h3>\";\n\n std::size_t numAliases = aliases.size();\n std::size_t lastAlias = numAliases - 1;\n\n for (std::size_t i = 0; i < numAliases; ++i)\n {\n customizedDescription += i != lastAlias\n ? \"<h5 style=\\\"margin-top:0;margin-bottom:0\\\">\"\n : \"<h5 style=\\\"margin-top:0;margin-bottom:10px\\\">\";\n\n customizedDescription += QString::fromStdString(aliases[i]) + \"<\/h5>\";\n }\n }\n else\n {\n customizedDescription = \"<h3 style=\\\"margin-bottom:10px\\\">\" + name + \"<\/h3>\";\n }\n\n if (!description.isEmpty())\n customizedDescription += description;\n\n m_Controls.description->setText(customizedDescription);\n m_Controls.description->show();\n\n return;\n }\n }\n }\n\n m_Controls.description->hide();\n}\n\nvoid QmitkPropertyTreeView::OnFilterTextChanged(const QString& filter)\n{\n m_ProxyModel->setFilterWildcard(filter);\n\n if (filter.isEmpty())\n m_Controls.treeView->collapseAll();\n else\n m_Controls.treeView->expandAll();\n}\n\nvoid QmitkPropertyTreeView::OnModelReset()\n{\n m_Controls.description->hide();\n}\n\nvoid QmitkPropertyTreeView::OnPreferencesChanged(const berry::IBerryPreferences* preferences)\n{\n bool showAliases = preferences->GetBool(QmitkPropertiesPreferencePage::SHOW_ALIASES, true);\n bool showDescriptions = preferences->GetBool(QmitkPropertiesPreferencePage::SHOW_DESCRIPTIONS, true);\n bool showAliasesInDescription = preferences->GetBool(QmitkPropertiesPreferencePage::SHOW_ALIASES_IN_DESCRIPTION, true);\n bool developerMode = preferences->GetBool(QmitkPropertiesPreferencePage::DEVELOPER_MODE, false);\n\n bool updateAliases = showAliases != (m_PropertyAliases != NULL);\n bool updateDescriptions = showDescriptions != (m_PropertyDescriptions != NULL);\n bool updateAliasesInDescription = showAliasesInDescription != m_ShowAliasesInDescription;\n bool updateDeveloperMode = developerMode != m_DeveloperMode;\n\n if (updateAliases)\n m_PropertyAliases = showAliases\n ? mitk::GetPropertyService<mitk::IPropertyAliases>()\n : NULL;\n\n if (updateDescriptions)\n m_PropertyDescriptions = showDescriptions\n ? mitk::GetPropertyService<mitk::IPropertyDescriptions>()\n : NULL;\n\n if (updateAliasesInDescription)\n m_ShowAliasesInDescription = showAliasesInDescription;\n\n if (updateDescriptions || updateAliasesInDescription)\n {\n QModelIndexList selection = m_Controls.treeView->selectionModel()->selectedRows();\n\n if (!selection.isEmpty())\n this->OnCurrentRowChanged(selection[0], selection[0]);\n }\n\n if (updateDeveloperMode)\n {\n m_DeveloperMode = developerMode;\n\n if (!developerMode)\n m_Controls.propertyListComboBox->setCurrentIndex(0);\n\n m_Controls.propertyListLabel->setVisible(developerMode);\n m_Controls.propertyListComboBox->setVisible(developerMode);\n m_Controls.newButton->setVisible(developerMode);\n }\n\n m_Model->OnPreferencesChanged(preferences);\n}\n\nvoid QmitkPropertyTreeView::OnPropertyNameChanged(const itk::EventObject&)\n{\n mitk::PropertyList* propertyList = m_Model->GetPropertyList();\n\n if (propertyList != NULL)\n {\n mitk::BaseProperty* nameProperty = propertyList->GetProperty(\"name\");\n\n if (nameProperty != NULL)\n {\n std::ostringstream partName;\n partName << \"Properties (\" << nameProperty->GetValueAsString() << ')';\n this->SetPartName(partName.str());\n }\n }\n}\n\nvoid QmitkPropertyTreeView::OnSelectionChanged(berry::IWorkbenchPart::Pointer, const QList<mitk::DataNode::Pointer>& nodes)\n{\n mitk::PropertyList* propertyList = m_Model->GetPropertyList();\n\n if (propertyList != NULL)\n {\n mitk::BaseProperty* nameProperty = propertyList->GetProperty(\"name\");\n\n if (nameProperty != NULL)\n nameProperty->RemoveObserver(m_PropertyNameChangedTag);\n\n m_PropertyNameChangedTag = 0;\n }\n\n if (nodes.empty() || nodes.front().IsNull())\n {\n m_SelectedNode = NULL;\n\n this->SetPartName(\"Properties\");\n m_Model->SetPropertyList(NULL);\n m_Delegate->SetPropertyList(NULL);\n\n m_Controls.newButton->setEnabled(false);\n }\n else\n {\n m_SelectedNode = nodes.front();\n\n QString selectionClassName = m_SelectedNode->GetData() != NULL\n ? m_SelectedNode->GetData()->GetNameOfClass()\n : \"\";\n\n m_SelectionClassName = selectionClassName.toStdString();\n m_Model->SetPropertyList(m_SelectedNode->GetPropertyList(m_Renderer), selectionClassName);\n m_Delegate->SetPropertyList(m_SelectedNode->GetPropertyList(m_Renderer));\n OnPropertyNameChanged(itk::ModifiedEvent());\n\n mitk::BaseProperty* nameProperty = m_SelectedNode->GetProperty(\"name\");\n\n if (nameProperty != NULL)\n {\n itk::ReceptorMemberCommand<QmitkPropertyTreeView>::Pointer command = itk::ReceptorMemberCommand<QmitkPropertyTreeView>::New();\n command->SetCallbackFunction(this, &QmitkPropertyTreeView::OnPropertyNameChanged);\n m_PropertyNameChangedTag = nameProperty->AddObserver(itk::ModifiedEvent(), command);\n }\n\n m_Controls.newButton->setEnabled(true);\n }\n\n if (!m_ProxyModel->filterRegExp().isEmpty())\n m_Controls.treeView->expandAll();\n}\n\nvoid QmitkPropertyTreeView::SetFocus()\n{\n m_Controls.filterLineEdit->setFocus();\n}\n\nvoid QmitkPropertyTreeView::RenderWindowPartActivated(mitk::IRenderWindowPart* renderWindowPart)\n{\n if (m_Controls.propertyListComboBox->count() == 1)\n {\n QHash<QString, QmitkRenderWindow*> renderWindows = this->GetRenderWindowPart()->GetQmitkRenderWindows();\n\n Q_FOREACH(QString renderWindow, renderWindows.keys())\n {\n m_Controls.propertyListComboBox->addItem(renderWindow);\n }\n }\n}\n\nvoid QmitkPropertyTreeView::RenderWindowPartDeactivated(mitk::IRenderWindowPart*)\n{\n if (m_Controls.propertyListComboBox->count() > 1)\n {\n m_Controls.propertyListComboBox->clear();\n m_Controls.propertyListComboBox->addItem(\"independent\");\n }\n}\n\nvoid QmitkPropertyTreeView::OnPropertyListChanged(int index)\n{\n if (index == -1)\n return;\n\n QString renderer = m_Controls.propertyListComboBox->itemText(index);\n\n m_Renderer = renderer != \"independent\"\n ? this->GetRenderWindowPart()->GetQmitkRenderWindow(renderer)->GetRenderer()\n : NULL;\n\n QList<mitk::DataNode::Pointer> nodes;\n\n if (m_SelectedNode.IsNotNull())\n nodes << m_SelectedNode;\n\n berry::IWorkbenchPart::Pointer workbenchPart;\n\n this->OnSelectionChanged(workbenchPart, nodes);\n}\n\nvoid QmitkPropertyTreeView::OnAddNewProperty()\n{\n QmitkAddNewPropertyDialog dialog(m_SelectedNode, m_Renderer, m_Parent);\n\n if (dialog.exec() == QDialog::Accepted)\n this->m_Model->Update();\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\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\tconst int numCommentLine = 7;\n\t\tstd::string lineId;\n\t\tchar comma;\n\t\tint i,j,k, 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\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);\n\t\t\t\ttruthCube->cubeData1.push_back(position1);\n\t\t\t\ttruthCube->cubeData2.push_back(position2);\n\t\t\t\ttruthCube->cubeData3.push_back(position3);\n\t\t\t}\n\n\t\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, 140.0, 0.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>Add curly braces to while loop statement.<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\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\tconst int numCommentLine = 7;\n\t\tstd::string lineId;\n\t\tchar comma;\n\t\tint i,j,k, 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);\n\t\t\t\ttruthCube->cubeData1.push_back(position1);\n\t\t\t\ttruthCube->cubeData2.push_back(position2);\n\t\t\t\ttruthCube->cubeData3.push_back(position3);\n\t\t\t}\n\t\t}\n\t\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, 140.0, 0.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 * 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 \"InactivityMonitor.h\"\n\n#include \"ReadChecker.h\"\n#include \"WriteChecker.h\"\n\n#include <activemq\/threads\/CompositeTask.h>\n#include <activemq\/threads\/CompositeTaskRunner.h>\n#include <activemq\/commands\/WireFormatInfo.h>\n#include <activemq\/commands\/KeepAliveInfo.h>\n\n#include <decaf\/lang\/Math.h>\n#include <decaf\/lang\/Thread.h>\n#include <decaf\/lang\/Runnable.h>\n#include <decaf\/lang\/Boolean.h>\n\nusing namespace std;\nusing namespace activemq;\nusing namespace activemq::commands;\nusing namespace activemq::threads;\nusing namespace activemq::transport;\nusing namespace activemq::transport::inactivity;\nusing namespace activemq::exceptions;\nusing namespace activemq::wireformat;\nusing namespace decaf;\nusing namespace decaf::io;\nusing namespace decaf::util;\nusing namespace decaf::util::concurrent;\nusing namespace decaf::util::concurrent::atomic;\nusing namespace decaf::lang;\nusing namespace decaf::lang::exceptions;\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nnamespace activemq{\nnamespace transport{\nnamespace inactivity{\n\n class InactivityMonitorData {\n public:\n\n \/\/ The configured WireFormat for the Transport Chain.\n Pointer<WireFormat> wireFormat;\n\n \/\/ Local and Remote WireFormat information.\n Pointer<WireFormatInfo> localWireFormatInfo;\n Pointer<WireFormatInfo> remoteWireFormatInfo;\n\n Pointer<ReadChecker> readCheckerTask;\n Pointer<WriteChecker> writeCheckerTask;\n\n Timer readCheckTimer;\n Timer writeCheckTimer;\n\n Pointer<CompositeTaskRunner> asyncTasks;\n\n Pointer<AsyncSignalReadErrorkTask> asyncReadTask;\n Pointer<AsyncWriteTask> asyncWriteTask;\n\n AtomicBoolean monitorStarted;\n\n AtomicBoolean commandSent;\n AtomicBoolean commandReceived;\n\n AtomicBoolean failed;\n AtomicBoolean inRead;\n AtomicBoolean inWrite;\n\n Mutex inWriteMutex;\n Mutex monitor;\n\n long long readCheckTime;\n long long writeCheckTime;\n long long initialDelayTime;\n\n bool keepAliveResponseRequired;\n };\n\n \/\/ Task that fires when the TaskRunner is signaled by the ReadCheck Timer Task.\n class AsyncSignalReadErrorkTask : public CompositeTask {\n private:\n\n InactivityMonitor* parent;\n std::string remote;\n AtomicBoolean failed;\n\n public:\n\n AsyncSignalReadErrorkTask( InactivityMonitor* parent, const std::string& remote ) {\n this->parent = parent;\n this->remote = remote;\n }\n\n void setFailed( bool failed ) {\n this->failed.set( failed );\n }\n\n virtual bool isPending() const {\n return this->failed.get();\n }\n\n virtual bool iterate() {\n\n if( this->failed.compareAndSet( true, false ) ) {\n\n IOException ex (\n __FILE__, __LINE__,\n ( std::string( \"Channel was inactive for too long: \" ) + remote ).c_str() );\n\n this->parent->onException( ex );\n }\n\n return this->failed.get();\n }\n };\n\n \/\/ Task that fires when the TaskRunner is signaled by the WriteCheck Timer Task.\n class AsyncWriteTask : public CompositeTask {\n private:\n\n InactivityMonitor* parent;\n AtomicBoolean write;\n\n public:\n\n AsyncWriteTask( InactivityMonitor* parent ) : parent( parent ) {\n }\n\n void setWrite( bool write ) {\n this->write.set( write );\n }\n\n virtual bool isPending() const {\n return this->write.get();\n }\n\n virtual bool iterate() {\n\n if( this->write.compareAndSet( true, false ) &&\n this->parent->members->monitorStarted.get() ) {\n\n try {\n Pointer<KeepAliveInfo> info( new KeepAliveInfo() );\n info->setResponseRequired( this->parent->members->keepAliveResponseRequired );\n this->parent->oneway( info );\n } catch( IOException& e ) {\n this->parent->onException( e );\n }\n }\n\n return this->write.get();\n }\n };\n\n}}}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nInactivityMonitor::InactivityMonitor( const Pointer<Transport>& next, const Pointer<WireFormat>& wireFormat )\n: TransportFilter( next ), members( new InactivityMonitorData() ) {\n\n this->members->wireFormat = wireFormat;\n this->members->monitorStarted = false;\n this->members->commandSent = false;\n this->members->commandReceived = true;\n this->members->failed = false;\n this->members->inRead = false;\n this->members->inWrite = false;\n this->members->readCheckTime = 0;\n this->members->writeCheckTime = 0;\n this->members->initialDelayTime = 0;\n this->members->keepAliveResponseRequired = false;\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nInactivityMonitor::InactivityMonitor( const Pointer<Transport>& next,\n const decaf::util::Properties& properties,\n const Pointer<wireformat::WireFormat>& wireFormat )\n: TransportFilter( next ), members( new InactivityMonitorData() ) {\n\n this->members->wireFormat = wireFormat;\n this->members->monitorStarted = false;\n this->members->commandSent = false;\n this->members->commandReceived = true;\n this->members->failed = false;\n this->members->inRead = false;\n this->members->inWrite = false;\n this->members->readCheckTime = 0;\n this->members->writeCheckTime = 0;\n this->members->initialDelayTime = 0;\n this->members->keepAliveResponseRequired =\n Boolean::parseBoolean( properties.getProperty( \"keepAliveResponseRequired\", \"false\" ) );\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nInactivityMonitor::~InactivityMonitor() {\n try{\n this->stopMonitorThreads();\n }\n AMQ_CATCHALL_NOTHROW()\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nlong long InactivityMonitor::getReadCheckTime() const {\n return this->members->readCheckTime;\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nvoid InactivityMonitor::setReadCheckTime( long long value ) {\n this->members->readCheckTime = value;\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nlong long InactivityMonitor::getWriteCheckTime() const {\n return this->members->writeCheckTime;\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nvoid InactivityMonitor::setWriteCheckTime( long long value ) {\n this->members->writeCheckTime = value;\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nlong long InactivityMonitor::getInitialDelayTime() const {\n return this->members->initialDelayTime;\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nvoid InactivityMonitor::setInitialDelayTime( long long value ) const {\n this->members->initialDelayTime = value;\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nbool InactivityMonitor::isKeepAliveResponseRequired() const {\n return this->members->keepAliveResponseRequired;\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nvoid InactivityMonitor::setKeepAliveResponseRequired( bool value ) {\n this->members->keepAliveResponseRequired = value;\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nvoid InactivityMonitor::close() throw( decaf::io::IOException ) {\n try{\n stopMonitorThreads();\n TransportFilter::close();\n }\n AMQ_CATCH_RETHROW( IOException )\n AMQ_CATCH_EXCEPTION_CONVERT( Exception, IOException )\n AMQ_CATCHALL_THROW( IOException )\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nvoid InactivityMonitor::onException( const decaf::lang::Exception& ex ) {\n\n if( this->members->failed.compareAndSet( false, true ) ) {\n stopMonitorThreads();\n TransportFilter::onException( ex );\n }\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nvoid InactivityMonitor::onCommand( const Pointer<Command>& command ) {\n\n this->members->commandReceived.set( true );\n this->members->inRead.set( true );\n\n try {\n\n if( command->isWireFormatInfo() ) {\n synchronized( &this->members->monitor ) {\n\n this->members->remoteWireFormatInfo = command.dynamicCast<WireFormatInfo>();\n try {\n startMonitorThreads();\n } catch( IOException& e ) {\n onException( e );\n }\n }\n }\n\n TransportFilter::onCommand( command );\n\n this->members->inRead.set( false );\n\n } catch( Exception& ex ) {\n this->members->inRead.set( false );\n ex.setMark( __FILE__, __LINE__ );\n throw ex;\n }\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nvoid InactivityMonitor::oneway( const Pointer<Command>& command )\n throw( decaf::io::IOException, decaf::lang::exceptions::UnsupportedOperationException ) {\n\n try{\n \/\/ Disable inactivity monitoring while processing a command. Synchronize this\n \/\/ method - its not synchronized\n \/\/ further down the transport stack and gets called by more\n \/\/ than one thread by this class\n synchronized( &this->members->inWriteMutex ) {\n this->members->inWrite.set( true );\n try {\n\n if( this->members->failed.get() ) {\n throw IOException(\n __FILE__, __LINE__,\n ( std::string( \"Channel was inactive for too long: \" ) + next->getRemoteAddress() ).c_str() );\n }\n\n if( command->isWireFormatInfo() ) {\n synchronized( &this->members->monitor ) {\n this->members->localWireFormatInfo = command.dynamicCast<WireFormatInfo>();\n startMonitorThreads();\n }\n }\n\n this->next->oneway( command );\n\n this->members->commandSent.set( true );\n this->members->inWrite.set( false );\n\n } catch( Exception& ex ) {\n this->members->commandSent.set( true );\n this->members->inWrite.set( false );\n\n ex.setMark( __FILE__, __LINE__ );\n throw ex;\n }\n }\n }\n AMQ_CATCH_RETHROW( IOException )\n AMQ_CATCH_RETHROW( UnsupportedOperationException )\n AMQ_CATCH_EXCEPTION_CONVERT( Exception, IOException )\n AMQ_CATCHALL_THROW( IOException )\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nbool InactivityMonitor::allowReadCheck( long long elapsed ) {\n return elapsed > ( this->members->readCheckTime * 9 \/ 10 );\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nvoid InactivityMonitor::readCheck() {\n\n if( this->members->inRead.get() || this->members->wireFormat->inReceive() ) {\n return;\n }\n\n if( !this->members->commandReceived.get() ) {\n\n \/\/ Set the failed state on our async Read Failure Task and wakeup its runner.\n this->members->asyncReadTask->setFailed( true );\n this->members->asyncTasks->wakeup();\n }\n\n this->members->commandReceived.set( false );\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nvoid InactivityMonitor::writeCheck() {\n\n if( this->members->inWrite.get() ) {\n return;\n }\n\n if(! this->members->commandSent.get() ) {\n\n this->members->asyncWriteTask->setWrite( true );\n this->members->asyncTasks->wakeup();\n }\n\n this->members->commandSent.set( false );\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nvoid InactivityMonitor::startMonitorThreads() {\n\n synchronized( &this->members->monitor ) {\n\n if( this->members->monitorStarted.get() ) {\n return;\n }\n if( this->members->localWireFormatInfo == NULL ) {\n return;\n }\n if( this->members->remoteWireFormatInfo == NULL ) {\n return;\n }\n\n this->members->asyncTasks.reset( new CompositeTaskRunner() );\n this->members->asyncReadTask.reset( new AsyncSignalReadErrorkTask( this, this->getRemoteAddress() ) );\n this->members->asyncWriteTask.reset( new AsyncWriteTask( this ) );\n\n this->members->asyncTasks->addTask( this->members->asyncReadTask.get() );\n this->members->asyncTasks->addTask( this->members->asyncWriteTask.get() );\n\n this->members->readCheckTime =\n Math::min( this->members->localWireFormatInfo->getMaxInactivityDuration(),\n this->members->remoteWireFormatInfo->getMaxInactivityDuration() );\n\n this->members->initialDelayTime =\n Math::min( this->members->localWireFormatInfo->getMaxInactivityDurationInitalDelay(),\n this->members->remoteWireFormatInfo->getMaxInactivityDurationInitalDelay() );\n\n if( this->members->readCheckTime > 0 ) {\n\n this->members->monitorStarted.set( true );\n this->members->writeCheckerTask.reset( new WriteChecker( this ) );\n this->members->readCheckerTask.reset( new ReadChecker( this ) );\n this->members->writeCheckTime = this->members->readCheckTime > 3 ?\n this->members->readCheckTime \/ 3 : this->members->readCheckTime;\n\n this->members->writeCheckTimer.scheduleAtFixedRate(\n this->members->writeCheckerTask, this->members->initialDelayTime, this->members->writeCheckTime );\n this->members->readCheckTimer.scheduleAtFixedRate(\n this->members->readCheckerTask, this->members->initialDelayTime, this->members->readCheckTime );\n }\n }\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nvoid InactivityMonitor::stopMonitorThreads() {\n\n synchronized( &this->members->monitor ) {\n\n if( this->members->monitorStarted.compareAndSet( true, false ) ) {\n\n this->members->readCheckerTask->cancel();\n this->members->writeCheckerTask->cancel();\n\n this->members->readCheckTimer.purge();\n this->members->readCheckTimer.cancel();\n this->members->writeCheckTimer.purge();\n this->members->writeCheckTimer.cancel();\n\n this->members->asyncTasks->shutdown();\n }\n }\n}\n<commit_msg>Cleanup code.<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 \"InactivityMonitor.h\"\n\n#include \"ReadChecker.h\"\n#include \"WriteChecker.h\"\n\n#include <activemq\/threads\/CompositeTask.h>\n#include <activemq\/threads\/CompositeTaskRunner.h>\n#include <activemq\/commands\/WireFormatInfo.h>\n#include <activemq\/commands\/KeepAliveInfo.h>\n\n#include <decaf\/lang\/Math.h>\n#include <decaf\/lang\/Thread.h>\n#include <decaf\/lang\/Runnable.h>\n#include <decaf\/lang\/Boolean.h>\n\nusing namespace std;\nusing namespace activemq;\nusing namespace activemq::commands;\nusing namespace activemq::threads;\nusing namespace activemq::transport;\nusing namespace activemq::transport::inactivity;\nusing namespace activemq::exceptions;\nusing namespace activemq::wireformat;\nusing namespace decaf;\nusing namespace decaf::io;\nusing namespace decaf::util;\nusing namespace decaf::util::concurrent;\nusing namespace decaf::util::concurrent::atomic;\nusing namespace decaf::lang;\nusing namespace decaf::lang::exceptions;\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nnamespace activemq{\nnamespace transport{\nnamespace inactivity{\n\n class InactivityMonitorData {\n public:\n\n \/\/ The configured WireFormat for the Transport Chain.\n Pointer<WireFormat> wireFormat;\n\n \/\/ Local and Remote WireFormat information.\n Pointer<WireFormatInfo> localWireFormatInfo;\n Pointer<WireFormatInfo> remoteWireFormatInfo;\n\n Pointer<ReadChecker> readCheckerTask;\n Pointer<WriteChecker> writeCheckerTask;\n\n Timer readCheckTimer;\n Timer writeCheckTimer;\n\n Pointer<CompositeTaskRunner> asyncTasks;\n\n Pointer<AsyncSignalReadErrorkTask> asyncReadTask;\n Pointer<AsyncWriteTask> asyncWriteTask;\n\n AtomicBoolean monitorStarted;\n\n AtomicBoolean commandSent;\n AtomicBoolean commandReceived;\n\n AtomicBoolean failed;\n AtomicBoolean inRead;\n AtomicBoolean inWrite;\n\n Mutex inWriteMutex;\n Mutex monitor;\n\n long long readCheckTime;\n long long writeCheckTime;\n long long initialDelayTime;\n\n bool keepAliveResponseRequired;\n };\n\n \/\/ Task that fires when the TaskRunner is signaled by the ReadCheck Timer Task.\n class AsyncSignalReadErrorkTask : public CompositeTask {\n private:\n\n InactivityMonitor* parent;\n std::string remote;\n AtomicBoolean failed;\n\n public:\n\n AsyncSignalReadErrorkTask( InactivityMonitor* parent, const std::string& remote ) {\n this->parent = parent;\n this->remote = remote;\n }\n\n void setFailed( bool failed ) {\n this->failed.set( failed );\n }\n\n virtual bool isPending() const {\n return this->failed.get();\n }\n\n virtual bool iterate() {\n\n if( this->failed.compareAndSet( true, false ) ) {\n\n IOException ex (\n __FILE__, __LINE__,\n ( std::string( \"Channel was inactive for too long: \" ) + remote ).c_str() );\n\n this->parent->onException( ex );\n }\n\n return this->failed.get();\n }\n };\n\n \/\/ Task that fires when the TaskRunner is signaled by the WriteCheck Timer Task.\n class AsyncWriteTask : public CompositeTask {\n private:\n\n InactivityMonitor* parent;\n AtomicBoolean write;\n\n public:\n\n AsyncWriteTask( InactivityMonitor* parent ) : parent( parent ) {\n }\n\n void setWrite( bool write ) {\n this->write.set( write );\n }\n\n virtual bool isPending() const {\n return this->write.get();\n }\n\n virtual bool iterate() {\n\n if( this->write.compareAndSet( true, false ) &&\n this->parent->members->monitorStarted.get() ) {\n\n try {\n Pointer<KeepAliveInfo> info( new KeepAliveInfo() );\n info->setResponseRequired( this->parent->members->keepAliveResponseRequired );\n this->parent->oneway( info );\n } catch( IOException& e ) {\n this->parent->onException( e );\n }\n }\n\n return this->write.get();\n }\n };\n\n}}}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nInactivityMonitor::InactivityMonitor( const Pointer<Transport>& next, const Pointer<WireFormat>& wireFormat )\n: TransportFilter( next ), members( new InactivityMonitorData() ) {\n\n this->members->wireFormat = wireFormat;\n this->members->monitorStarted = false;\n this->members->commandSent = false;\n this->members->commandReceived = true;\n this->members->failed = false;\n this->members->inRead = false;\n this->members->inWrite = false;\n this->members->readCheckTime = 0;\n this->members->writeCheckTime = 0;\n this->members->initialDelayTime = 0;\n this->members->keepAliveResponseRequired = false;\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nInactivityMonitor::InactivityMonitor( const Pointer<Transport>& next,\n const decaf::util::Properties& properties,\n const Pointer<wireformat::WireFormat>& wireFormat )\n: TransportFilter( next ), members( new InactivityMonitorData() ) {\n\n this->members->wireFormat = wireFormat;\n this->members->monitorStarted = false;\n this->members->commandSent = false;\n this->members->commandReceived = true;\n this->members->failed = false;\n this->members->inRead = false;\n this->members->inWrite = false;\n this->members->readCheckTime = 0;\n this->members->writeCheckTime = 0;\n this->members->initialDelayTime = 0;\n this->members->keepAliveResponseRequired =\n Boolean::parseBoolean( properties.getProperty( \"keepAliveResponseRequired\", \"false\" ) );\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nInactivityMonitor::~InactivityMonitor() {\n try{\n this->stopMonitorThreads();\n }\n AMQ_CATCHALL_NOTHROW()\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nlong long InactivityMonitor::getReadCheckTime() const {\n return this->members->readCheckTime;\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nvoid InactivityMonitor::setReadCheckTime( long long value ) {\n this->members->readCheckTime = value;\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nlong long InactivityMonitor::getWriteCheckTime() const {\n return this->members->writeCheckTime;\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nvoid InactivityMonitor::setWriteCheckTime( long long value ) {\n this->members->writeCheckTime = value;\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nlong long InactivityMonitor::getInitialDelayTime() const {\n return this->members->initialDelayTime;\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nvoid InactivityMonitor::setInitialDelayTime( long long value ) const {\n this->members->initialDelayTime = value;\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nbool InactivityMonitor::isKeepAliveResponseRequired() const {\n return this->members->keepAliveResponseRequired;\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nvoid InactivityMonitor::setKeepAliveResponseRequired( bool value ) {\n this->members->keepAliveResponseRequired = value;\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nvoid InactivityMonitor::close() throw( decaf::io::IOException ) {\n try{\n stopMonitorThreads();\n TransportFilter::close();\n }\n AMQ_CATCH_RETHROW( IOException )\n AMQ_CATCH_EXCEPTION_CONVERT( Exception, IOException )\n AMQ_CATCHALL_THROW( IOException )\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nvoid InactivityMonitor::onException( const decaf::lang::Exception& ex ) {\n\n if( this->members->failed.compareAndSet( false, true ) ) {\n stopMonitorThreads();\n TransportFilter::onException( ex );\n }\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nvoid InactivityMonitor::onCommand( const Pointer<Command>& command ) {\n\n this->members->commandReceived.set( true );\n this->members->inRead.set( true );\n\n try {\n\n if( command->isWireFormatInfo() ) {\n synchronized( &this->members->monitor ) {\n\n this->members->remoteWireFormatInfo = command.dynamicCast<WireFormatInfo>();\n try {\n startMonitorThreads();\n } catch( IOException& e ) {\n onException( e );\n }\n }\n }\n\n TransportFilter::onCommand( command );\n\n this->members->inRead.set( false );\n\n } catch( Exception& ex ) {\n this->members->inRead.set( false );\n ex.setMark( __FILE__, __LINE__ );\n throw ex;\n }\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nvoid InactivityMonitor::oneway( const Pointer<Command>& command )\n throw( decaf::io::IOException, decaf::lang::exceptions::UnsupportedOperationException ) {\n\n try{\n \/\/ Disable inactivity monitoring while processing a command. Synchronize this\n \/\/ method - its not synchronized\n \/\/ further down the transport stack and gets called by more\n \/\/ than one thread by this class\n synchronized( &this->members->inWriteMutex ) {\n this->members->inWrite.set( true );\n try {\n\n if( this->members->failed.get() ) {\n throw IOException(\n __FILE__, __LINE__,\n ( std::string( \"Channel was inactive for too long: \" ) + next->getRemoteAddress() ).c_str() );\n }\n\n if( command->isWireFormatInfo() ) {\n synchronized( &this->members->monitor ) {\n this->members->localWireFormatInfo = command.dynamicCast<WireFormatInfo>();\n startMonitorThreads();\n }\n }\n\n this->next->oneway( command );\n\n this->members->commandSent.set( true );\n this->members->inWrite.set( false );\n\n } catch( Exception& ex ) {\n this->members->commandSent.set( true );\n this->members->inWrite.set( false );\n\n ex.setMark( __FILE__, __LINE__ );\n throw ex;\n }\n }\n }\n AMQ_CATCH_RETHROW( IOException )\n AMQ_CATCH_RETHROW( UnsupportedOperationException )\n AMQ_CATCH_EXCEPTION_CONVERT( Exception, IOException )\n AMQ_CATCHALL_THROW( IOException )\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nbool InactivityMonitor::allowReadCheck( long long elapsed ) {\n return elapsed > ( this->members->readCheckTime * 9 \/ 10 );\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nvoid InactivityMonitor::readCheck() {\n\n if( this->members->inRead.get() || this->members->wireFormat->inReceive() ) {\n return;\n }\n\n if( !this->members->commandReceived.get() ) {\n\n \/\/ Set the failed state on our async Read Failure Task and wakeup its runner.\n this->members->asyncReadTask->setFailed( true );\n this->members->asyncTasks->wakeup();\n }\n\n this->members->commandReceived.set( false );\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nvoid InactivityMonitor::writeCheck() {\n\n if( this->members->inWrite.get() ) {\n return;\n }\n\n if( !this->members->commandSent.get() ) {\n\n this->members->asyncWriteTask->setWrite( true );\n this->members->asyncTasks->wakeup();\n }\n\n this->members->commandSent.set( false );\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nvoid InactivityMonitor::startMonitorThreads() {\n\n synchronized( &this->members->monitor ) {\n\n if( this->members->monitorStarted.get() ) {\n return;\n }\n if( this->members->localWireFormatInfo == NULL ) {\n return;\n }\n if( this->members->remoteWireFormatInfo == NULL ) {\n return;\n }\n\n this->members->asyncTasks.reset( new CompositeTaskRunner() );\n this->members->asyncReadTask.reset( new AsyncSignalReadErrorkTask( this, this->getRemoteAddress() ) );\n this->members->asyncWriteTask.reset( new AsyncWriteTask( this ) );\n\n this->members->asyncTasks->addTask( this->members->asyncReadTask.get() );\n this->members->asyncTasks->addTask( this->members->asyncWriteTask.get() );\n\n this->members->readCheckTime =\n Math::min( this->members->localWireFormatInfo->getMaxInactivityDuration(),\n this->members->remoteWireFormatInfo->getMaxInactivityDuration() );\n\n this->members->initialDelayTime =\n Math::min( this->members->localWireFormatInfo->getMaxInactivityDurationInitalDelay(),\n this->members->remoteWireFormatInfo->getMaxInactivityDurationInitalDelay() );\n\n if( this->members->readCheckTime > 0 ) {\n\n this->members->monitorStarted.set( true );\n this->members->writeCheckerTask.reset( new WriteChecker( this ) );\n this->members->readCheckerTask.reset( new ReadChecker( this ) );\n this->members->writeCheckTime = this->members->readCheckTime > 3 ?\n this->members->readCheckTime \/ 3 : this->members->readCheckTime;\n\n this->members->writeCheckTimer.scheduleAtFixedRate(\n this->members->writeCheckerTask, this->members->initialDelayTime, this->members->writeCheckTime );\n this->members->readCheckTimer.scheduleAtFixedRate(\n this->members->readCheckerTask, this->members->initialDelayTime, this->members->readCheckTime );\n }\n }\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nvoid InactivityMonitor::stopMonitorThreads() {\n\n synchronized( &this->members->monitor ) {\n\n if( this->members->monitorStarted.compareAndSet( true, false ) ) {\n\n this->members->readCheckerTask->cancel();\n this->members->writeCheckerTask->cancel();\n\n this->members->readCheckTimer.purge();\n this->members->readCheckTimer.cancel();\n this->members->writeCheckTimer.purge();\n this->members->writeCheckTimer.cancel();\n\n this->members->asyncTasks->shutdown();\n }\n }\n}\n<|endoftext|>"} {"text":"<commit_before>\/*=========================================================================\n *\n * Copyright Insight Software Consortium\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http:\/\/www.apache.org\/licenses\/LICENSE-2.0.txt\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n *\n *=========================================================================*\/\n\n#include \"itkPyCommand.h\"\n\nnamespace itk\n{\n\nPyCommand::PyCommand()\n{\n this->m_Object = nullptr;\n}\n\n\nPyCommand::~PyCommand()\n{\n if (this->m_Object)\n {\n Py_DECREF(this->m_Object);\n }\n this->m_Object = nullptr;\n}\n\n\nvoid PyCommand::SetCommandCallable(PyObject *o)\n{\n if (o != this->m_Object)\n {\n if (this->m_Object)\n {\n \/\/ get rid of our reference\n Py_DECREF(this->m_Object);\n }\n\n \/\/ store the new object\n this->m_Object = o;\n\n if (this->m_Object)\n {\n \/\/ take out reference (so that the calling code doesn't\n \/\/ have to keep a binding to the callable around)\n Py_INCREF(this->m_Object);\n }\n }\n}\n\n\nPyObject * PyCommand::GetCommandCallable()\n{\n return this->m_Object;\n}\n\n\nvoid PyCommand::Execute(Object *, const EventObject&)\n{\n this->PyExecute();\n}\n\n\nvoid PyCommand::Execute(const Object*, const EventObject&)\n{\n this->PyExecute();\n}\n\n\nvoid PyCommand::PyExecute()\n{\n \/\/ make sure that the CommandCallable is in fact callable\n if (!PyCallable_Check(this->m_Object))\n {\n \/\/ we throw a standard ITK exception: this makes it possible for\n \/\/ our standard Swig exception handling logic to take this\n \/\/ through to the invoking Python process\n itkExceptionMacro(<<\"CommandCallable is not a callable Python object, \"\n <<\"or it has not been set.\");\n }\n else\n {\n PyObject *result = PyEval_CallObject(this->m_Object, (PyObject *)nullptr);\n\n if (result)\n {\n Py_DECREF(result);\n }\n else\n {\n \/\/ there was a Python error. Clear the error by printing to stdout\n PyErr_Print();\n \/\/ make sure the invoking Python code knows there was a problem\n \/\/ by raising an exception\n itkExceptionMacro(<<\"There was an error executing the \"\n <<\"CommandCallable.\");\n }\n }\n}\n\n} \/\/ end namespace itk\n<commit_msg>BUG: itk::PyCommand ensures the GIL state<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 \"itkPyCommand.h\"\n\nnamespace\n{\n\/\/ Wrapper to automatics obtain and release GIL\n\/\/ RAII idiom\nclass PyGILStateEnsure\n{\npublic:\n PyGILStateEnsure()\n {\n m_GIL = PyGILState_Ensure();\n }\n ~PyGILStateEnsure()\n {\n PyGILState_Release(m_GIL);\n }\nprivate:\n PyGILState_STATE m_GIL;\n};\n} \/\/ end anonymous namespace\n\nnamespace itk\n{\n\nPyCommand::PyCommand()\n{\n this->m_Object = nullptr;\n}\n\n\nPyCommand::~PyCommand()\n{\n if (this->m_Object)\n {\n PyGILStateEnsure gil;\n Py_DECREF(this->m_Object);\n }\n this->m_Object = nullptr;\n}\n\n\nvoid PyCommand::SetCommandCallable(PyObject *o)\n{\n if (o != this->m_Object)\n {\n PyGILStateEnsure gil;\n if (this->m_Object)\n {\n \/\/ get rid of our reference\n Py_DECREF(this->m_Object);\n }\n\n \/\/ store the new object\n this->m_Object = o;\n\n if (this->m_Object)\n {\n \/\/ take out reference (so that the calling code doesn't\n \/\/ have to keep a binding to the callable around)\n Py_INCREF(this->m_Object);\n }\n }\n}\n\n\nPyObject * PyCommand::GetCommandCallable()\n{\n return this->m_Object;\n}\n\n\nvoid PyCommand::Execute(Object *, const EventObject&)\n{\n this->PyExecute();\n}\n\n\nvoid PyCommand::Execute(const Object*, const EventObject&)\n{\n this->PyExecute();\n}\n\n\nvoid PyCommand::PyExecute()\n{\n \/\/ make sure that the CommandCallable is in fact callable\n if (!PyCallable_Check(this->m_Object))\n {\n \/\/ we throw a standard ITK exception: this makes it possible for\n \/\/ our standard Swig exception handling logic to take this\n \/\/ through to the invoking Python process\n itkExceptionMacro(<<\"CommandCallable is not a callable Python object, \"\n <<\"or it has not been set.\");\n }\n else\n {\n PyGILStateEnsure gil;\n PyObject *result = PyEval_CallObject(this->m_Object, (PyObject *)nullptr);\n\n if (result)\n {\n Py_DECREF(result);\n }\n else\n {\n \/\/ there was a Python error. Clear the error by printing to stdout\n PyErr_Print();\n \/\/ make sure the invoking Python code knows there was a problem\n \/\/ by raising an exception\n itkExceptionMacro(<<\"There was an error executing the \"\n <<\"CommandCallable.\");\n }\n }\n}\n\n} \/\/ end namespace itk\n<|endoftext|>"} {"text":"<commit_before>\/** @example user_accelerometer_poses.cpp\n * Pose detection using accelerometers.\n *\/\n#include <ESP.h>\n\nASCIISerialStream stream(0, 115200, 3);\nGestureRecognitionPipeline pipeline;\nCalibrator calibrator;\nTcpOStream oStream(\"localhost\", 5204, 3, \"l\", \"r\", \" \");\n\nMatrixDouble uprightData, upsideDownData;\nbool haveUprightData = false, haveUpsideDownData = false;\ndouble range;\nvector<double> zeroGs(3);\n\nvector<double> processAccelerometerData(vector<double> input)\n{\n vector<double> result(3);\n \n for (int i = 0; i < 3; i++) {\n result[i] = (input[i] - zeroGs[i]) \/ range;\n }\n \n return result;\n}\n\nCalibrateResult calibrate(const MatrixDouble& data) {\n CalibrateResult result = CalibrateResult::SUCCESS;\n \n \/\/ Run checks on newly collected sample.\n\n \/\/ take average of X and Y acceleration as the zero G value\n double zG = (data.getMean()[0] + data.getMean()[1]) \/ 2;\n double oG = data.getMean()[2]; \/\/ use Z acceleration as one G value\n \n double r = abs(oG - zG);\n vector<double> stddev = data.getStdDev();\n \n if (stddev[0] \/ r > 0.05 ||\n stddev[1] \/ r > 0.05 ||\n stddev[2] \/ r > 0.05)\n result = CalibrateResult(CalibrateResult::WARNING,\n \"Accelerometer seemed to be moving; consider recollecting the \"\n \"calibration sample.\");\n \n if (abs(data.getMean()[0] - data.getMean()[1]) \/ r > 0.1)\n result = CalibrateResult(CalibrateResult::WARNING,\n \"X and Y axes differ by \" + std::to_string(\n abs(data.getMean()[0] - data.getMean()[1]) \/ r * 100) +\n \" percent. Check that accelerometer is flat.\");\n \n \/\/ If we have both samples, do the actual calibration.\n\n if (haveUprightData && haveUpsideDownData) {\n for (int i = 0; i < 3; i++) {\n zeroGs[i] =\n (uprightData.getMean()[i] + upsideDownData.getMean()[i]) \/ 2;\n }\n \n \/\/ use half the difference between the two z-axis values (-1 and +1)\n \/\/ as the range\n range = (uprightData.getMean()[2] - upsideDownData.getMean()[2]) \/ 2;\n }\n\n return result;\n}\n\nCalibrateResult uprightDataCollected(const MatrixDouble& data)\n{\n uprightData = data;\n haveUprightData = true;\n return calibrate(data);\n}\n\nCalibrateResult upsideDownDataCollected(const MatrixDouble& data)\n{\n upsideDownData = data;\n haveUpsideDownData = true;\n return calibrate(data);\n}\n\ndouble null_rej = 5.0;\nbool always_pick_something = false;\nbool send_repeated_predictions = false;\nint timeout = 100;\n\nvoid updateAlwaysPickSomething(bool new_val) {\n pipeline.getClassifier()->enableNullRejection(!new_val);\n}\n\nvoid updateVariability(double new_val) {\n pipeline.getClassifier()->setNullRejectionCoeff(new_val);\n pipeline.getClassifier()->recomputeNullRejectionThresholds();\n}\n\nvoid updateSendRepeatedPredictions(bool new_val) {\n if (new_val) {\n assert(pipeline.getNumPostProcessingModules() == 0);\n pipeline.addPostProcessingModule(ClassLabelTimeoutFilter(timeout));\n } else {\n assert(pipeline.getNumPostProcessingModules() == 1);\n pipeline.removePostProcessingModule(0);\n }\n}\n\nvoid updateTimeout(int new_val) {\n if (pipeline.getNumPostProcessingModules() > 0) {\n ClassLabelTimeoutFilter *filter =\n dynamic_cast<ClassLabelTimeoutFilter *>\n (pipeline.getPostProcessingModule(0));\n assert(filter != nullptr);\n filter->setTimeoutDuration(new_val);\n }\n \n \/\/ else do nothing, i.e. allow the user to adjust the timout parameter\n \/\/ even if it's not currently being used (because send_repeated_predictions\n \/\/ is false).\n}\n\nvoid setup()\n{\n stream.setLabelsForAllDimensions({\"x\", \"y\", \"z\"});\n useInputStream(stream);\n useOutputStream(oStream);\n \/\/useStream(stream);\n\n calibrator.setCalibrateFunction(processAccelerometerData);\n calibrator.addCalibrateProcess(\"Upright\",\n \"Rest accelerometer upright on flat surface.\", uprightDataCollected);\n calibrator.addCalibrateProcess(\"Upside Down\",\n \"Rest accelerometer upside down on flat surface.\", upsideDownDataCollected);\n useCalibrator(calibrator);\n\n pipeline.addFeatureExtractionModule(TimeDomainFeatures(10, 1, 3, false, true, true, false, false));\n pipeline.setClassifier(ANBC(false, !always_pick_something, null_rej)); \/\/ use scaling, use null rejection, null rejection parameter\n \/\/ null rejection parameter is multiplied by the standard deviation to determine\n \/\/ the rejection threshold. the higher the number, the looser the filter; the\n \/\/ lower the number, the tighter the filter.\n\n if (send_repeated_predictions)\n pipeline.addPostProcessingModule(ClassLabelTimeoutFilter(timeout));\n usePipeline(pipeline);\n\n registerTuneable(always_pick_something, \"Always Pick Something\",\n \"Whether to always pick (predict) one of the classes of training data, \"\n \"even if it's not a very good match. If selected, 'Variability' will \"\n \"not be used.\", updateAlwaysPickSomething);\n registerTuneable(null_rej, 1.0, 25.0, \"Variability\",\n \"How different from the training data a new gesture can be and \"\n \"still be considered the same gesture. The higher the number, the more \"\n \"different it can be.\", updateVariability);\n registerTuneable(send_repeated_predictions, \"Send Repeated Predictions\",\n \"Whether to send repeated predictions while a pose is being held. If \"\n \"not selected, predictions will only be sent on transition from one \"\n \"pose to another.\", updateSendRepeatedPredictions);\n registerTuneable(timeout, 1, 3000,\n \"Timeout\",\n \"How long (in milliseconds) to wait after recognizing a class before \"\n \"recognizing a different one. Only used if 'Send Repeated Predictions' \"\n \"is selected.\", updateTimeout);\n}\n<commit_msg>Don't hard-code serial port in accelerometer poses example.<commit_after>\/** @example user_accelerometer_poses.cpp\n * Pose detection using accelerometers.\n *\/\n#include <ESP.h>\n\nASCIISerialStream stream(115200, 3);\nGestureRecognitionPipeline pipeline;\nCalibrator calibrator;\nTcpOStream oStream(\"localhost\", 5204, 3, \"l\", \"r\", \" \");\n\nMatrixDouble uprightData, upsideDownData;\nbool haveUprightData = false, haveUpsideDownData = false;\ndouble range;\nvector<double> zeroGs(3);\n\nvector<double> processAccelerometerData(vector<double> input)\n{\n vector<double> result(3);\n \n for (int i = 0; i < 3; i++) {\n result[i] = (input[i] - zeroGs[i]) \/ range;\n }\n \n return result;\n}\n\nCalibrateResult calibrate(const MatrixDouble& data) {\n CalibrateResult result = CalibrateResult::SUCCESS;\n \n \/\/ Run checks on newly collected sample.\n\n \/\/ take average of X and Y acceleration as the zero G value\n double zG = (data.getMean()[0] + data.getMean()[1]) \/ 2;\n double oG = data.getMean()[2]; \/\/ use Z acceleration as one G value\n \n double r = abs(oG - zG);\n vector<double> stddev = data.getStdDev();\n \n if (stddev[0] \/ r > 0.05 ||\n stddev[1] \/ r > 0.05 ||\n stddev[2] \/ r > 0.05)\n result = CalibrateResult(CalibrateResult::WARNING,\n \"Accelerometer seemed to be moving; consider recollecting the \"\n \"calibration sample.\");\n \n if (abs(data.getMean()[0] - data.getMean()[1]) \/ r > 0.1)\n result = CalibrateResult(CalibrateResult::WARNING,\n \"X and Y axes differ by \" + std::to_string(\n abs(data.getMean()[0] - data.getMean()[1]) \/ r * 100) +\n \" percent. Check that accelerometer is flat.\");\n \n \/\/ If we have both samples, do the actual calibration.\n\n if (haveUprightData && haveUpsideDownData) {\n for (int i = 0; i < 3; i++) {\n zeroGs[i] =\n (uprightData.getMean()[i] + upsideDownData.getMean()[i]) \/ 2;\n }\n \n \/\/ use half the difference between the two z-axis values (-1 and +1)\n \/\/ as the range\n range = (uprightData.getMean()[2] - upsideDownData.getMean()[2]) \/ 2;\n }\n\n return result;\n}\n\nCalibrateResult uprightDataCollected(const MatrixDouble& data)\n{\n uprightData = data;\n haveUprightData = true;\n return calibrate(data);\n}\n\nCalibrateResult upsideDownDataCollected(const MatrixDouble& data)\n{\n upsideDownData = data;\n haveUpsideDownData = true;\n return calibrate(data);\n}\n\ndouble null_rej = 5.0;\nbool always_pick_something = false;\nbool send_repeated_predictions = false;\nint timeout = 100;\n\nvoid updateAlwaysPickSomething(bool new_val) {\n pipeline.getClassifier()->enableNullRejection(!new_val);\n}\n\nvoid updateVariability(double new_val) {\n pipeline.getClassifier()->setNullRejectionCoeff(new_val);\n pipeline.getClassifier()->recomputeNullRejectionThresholds();\n}\n\nvoid updateSendRepeatedPredictions(bool new_val) {\n if (new_val) {\n assert(pipeline.getNumPostProcessingModules() == 0);\n pipeline.addPostProcessingModule(ClassLabelTimeoutFilter(timeout));\n } else {\n assert(pipeline.getNumPostProcessingModules() == 1);\n pipeline.removePostProcessingModule(0);\n }\n}\n\nvoid updateTimeout(int new_val) {\n if (pipeline.getNumPostProcessingModules() > 0) {\n ClassLabelTimeoutFilter *filter =\n dynamic_cast<ClassLabelTimeoutFilter *>\n (pipeline.getPostProcessingModule(0));\n assert(filter != nullptr);\n filter->setTimeoutDuration(new_val);\n }\n \n \/\/ else do nothing, i.e. allow the user to adjust the timout parameter\n \/\/ even if it's not currently being used (because send_repeated_predictions\n \/\/ is false).\n}\n\nvoid setup()\n{\n stream.setLabelsForAllDimensions({\"x\", \"y\", \"z\"});\n useInputStream(stream);\n useOutputStream(oStream);\n \/\/useStream(stream);\n\n calibrator.setCalibrateFunction(processAccelerometerData);\n calibrator.addCalibrateProcess(\"Upright\",\n \"Rest accelerometer upright on flat surface.\", uprightDataCollected);\n calibrator.addCalibrateProcess(\"Upside Down\",\n \"Rest accelerometer upside down on flat surface.\", upsideDownDataCollected);\n useCalibrator(calibrator);\n\n pipeline.addFeatureExtractionModule(TimeDomainFeatures(10, 1, 3, false, true, true, false, false));\n pipeline.setClassifier(ANBC(false, !always_pick_something, null_rej)); \/\/ use scaling, use null rejection, null rejection parameter\n \/\/ null rejection parameter is multiplied by the standard deviation to determine\n \/\/ the rejection threshold. the higher the number, the looser the filter; the\n \/\/ lower the number, the tighter the filter.\n\n if (send_repeated_predictions)\n pipeline.addPostProcessingModule(ClassLabelTimeoutFilter(timeout));\n usePipeline(pipeline);\n\n registerTuneable(always_pick_something, \"Always Pick Something\",\n \"Whether to always pick (predict) one of the classes of training data, \"\n \"even if it's not a very good match. If selected, 'Variability' will \"\n \"not be used.\", updateAlwaysPickSomething);\n registerTuneable(null_rej, 1.0, 25.0, \"Variability\",\n \"How different from the training data a new gesture can be and \"\n \"still be considered the same gesture. The higher the number, the more \"\n \"different it can be.\", updateVariability);\n registerTuneable(send_repeated_predictions, \"Send Repeated Predictions\",\n \"Whether to send repeated predictions while a pose is being held. If \"\n \"not selected, predictions will only be sent on transition from one \"\n \"pose to another.\", updateSendRepeatedPredictions);\n registerTuneable(timeout, 1, 3000,\n \"Timeout\",\n \"How long (in milliseconds) to wait after recognizing a class before \"\n \"recognizing a different one. Only used if 'Send Repeated Predictions' \"\n \"is selected.\", updateTimeout);\n}\n<|endoftext|>"} {"text":"<commit_before>\/\/ Copyright (c) 2011, Cornell University\n\/\/ All rights reserved.\n\/\/\n\/\/ Redistribution and use in source and binary forms, with or without\n\/\/ modification, are permitted provided that the following conditions are met:\n\/\/\n\/\/ * Redistributions of source code must retain the above copyright notice,\n\/\/ this list of conditions and the following disclaimer.\n\/\/ * Redistributions in binary form must reproduce the above copyright\n\/\/ notice, this list of conditions and the following disclaimer in the\n\/\/ documentation and\/or other materials provided with the distribution.\n\/\/ * Neither the name of HyperDex nor the names of its contributors may be\n\/\/ used to endorse or promote products derived from this software without\n\/\/ specific prior written permission.\n\/\/\n\/\/ THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS \"AS IS\"\n\/\/ AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE\n\/\/ IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE\n\/\/ ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE\n\/\/ LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR\n\/\/ CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF\n\/\/ SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS\n\/\/ INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN\n\/\/ CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)\n\/\/ ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE\n\/\/ POSSIBILITY OF SUCH DAMAGE.\n\n#define __STDC_LIMIT_MACROS\n\n\/\/ C\n#include <cassert>\n#include <cstdlib>\n#include <ctime>\n\n\/\/ HyperspaceHashing\n#include \"hashes_internal.h\"\n#include \"hyperspacehashing\/hashes.h\"\n#include \"hyperspacehashing\/mask.h\"\n#include \"hyperspacehashing\/prefix.h\"\n#include \"hyperspacehashing\/search.h\"\n\nusing hyperspacehashing::hash_t;\nusing hyperspacehashing::EQUALITY;\nusing hyperspacehashing::NONE;\nusing namespace hyperspacehashing;\n\nvoid\nvalidate(const std::vector<hash_t> hf, const e::buffer& key, const std::vector<e::buffer>& value);\n\nint\nmain(int, char* [])\n{\n srand(time(NULL));\n\n for (size_t i = 0; i < 10; ++i)\n {\n uint32_t nums[5];\n\n for (int j = 0; j < 5; ++j)\n {\n nums[i] = static_cast<uint32_t>(rand());\n }\n\n for (size_t k = EQUALITY; k <= NONE; ++k)\n {\n std::vector<hash_t> hf(1);\n hf[0] = static_cast<hash_t>(k);\n\n std::vector<e::buffer> value;\n e::buffer key;\n key.pack() << nums[0];\n validate(hf, key, value);\n hf.push_back(NONE);\n value.push_back(e::buffer());\n\n for (size_t v1 = EQUALITY; v1 <= NONE; ++v1)\n {\n assert(hf.size() == 2);\n assert(value.size() == 1);\n hf[1] = static_cast<hash_t>(v1);\n value[0].pack() << nums[1];\n validate(hf, key, value);\n hf.push_back(NONE);\n value.push_back(e::buffer());\n\n for (size_t v2 = EQUALITY; v2 <= NONE; ++v2)\n {\n assert(hf.size() == 3);\n assert(value.size() == 2);\n hf[2] = static_cast<hash_t>(v2);\n value[1].pack() << nums[2];\n validate(hf, key, value);\n hf.push_back(NONE);\n value.push_back(e::buffer());\n\n for (size_t v3 = EQUALITY; v3 <= NONE; ++v3)\n {\n assert(hf.size() == 4);\n assert(value.size() == 3);\n hf[3] = static_cast<hash_t>(v3);\n value[2].pack() << nums[3];\n validate(hf, key, value);\n hf.push_back(NONE);\n value.push_back(e::buffer());\n\n for (size_t v4 = EQUALITY; v4 <= NONE; ++v4)\n {\n assert(hf.size() == 5);\n assert(value.size() == 4);\n hf[4] = static_cast<hash_t>(v4);\n value[3].pack() << nums[4];\n validate(hf, key, value);\n }\n\n value.pop_back();\n hf.pop_back();\n }\n\n value.pop_back();\n hf.pop_back();\n }\n\n value.pop_back();\n hf.pop_back();\n }\n }\n }\n\n return EXIT_SUCCESS;\n}\n\nvoid\nvalidate(const std::vector<hash_t> hf, const e::buffer& key, const std::vector<e::buffer>& value)\n{\n prefix::hasher ph(hf);\n prefix::coordinate pc = ph.hash(key, value);\n \/\/mask::hasher mh(hf);\n \/\/mask::coordinate mc = mh.hash(key, value);\n\n \/\/ Do an equality search for each attribute\n for (size_t i = 0; i < value.size() + 1; ++i)\n {\n search s(value.size() + 1);\n\n if (i == 0)\n {\n s.equality_set(0, key);\n }\n else\n {\n s.equality_set(i, value[i - 1]);\n }\n\n prefix::search_coordinate psc = ph.hash(s);\n \/\/mask::search_coordinate msc = mh.hash(s);\n assert(psc.matches(pc));\n \/\/assert(msc.matches(mc));\n \/\/assert(msc.matches(key, value));\n }\n\n \/\/ Do a range search for each attribute\n for (size_t i = 0; i < value.size() + 1; ++i)\n {\n search s(value.size() + 1);\n\n if (i == 0)\n {\n uint64_t num = lendian(key);\n s.range_set(0, num, num + 1);\n }\n else\n {\n uint64_t num = lendian(value[i - 1]);\n s.range_set(i, num, num + 1);\n }\n\n prefix::search_coordinate psc = ph.hash(s);\n \/\/mask::search_coordinate msc = mh.hash(s);\n assert(psc.matches(pc));\n \/\/assert(msc.matches(mc));\n \/\/assert(msc.matches(key, value));\n }\n\n \/\/ Do an equality\/range search for two attributes\n for (size_t i = 0; i < value.size() + 1; ++i)\n {\n for (size_t j = 0; j < value.size() + 1; ++j)\n {\n if (i == j)\n {\n continue;\n }\n\n search s(value.size() + 1);\n\n if (i == 0)\n {\n s.equality_set(0, key);\n }\n else\n {\n s.equality_set(i, value[i - 1]);\n }\n\n if (j == 0)\n {\n uint64_t num = lendian(key);\n s.range_set(0, num, num + 1);\n }\n else\n {\n uint64_t num = lendian(value[j - 1]);\n s.range_set(j, num, num + 1);\n }\n\n prefix::search_coordinate psc = ph.hash(s);\n \/\/mask::search_coordinate msc = mh.hash(s);\n assert(psc.matches(pc));\n \/\/assert(msc.matches(mc));\n \/\/assert(msc.matches(key, value));\n }\n }\n}\n<commit_msg>Use the appropriate loop counter to index.<commit_after>\/\/ Copyright (c) 2011, Cornell University\n\/\/ All rights reserved.\n\/\/\n\/\/ Redistribution and use in source and binary forms, with or without\n\/\/ modification, are permitted provided that the following conditions are met:\n\/\/\n\/\/ * Redistributions of source code must retain the above copyright notice,\n\/\/ this list of conditions and the following disclaimer.\n\/\/ * Redistributions in binary form must reproduce the above copyright\n\/\/ notice, this list of conditions and the following disclaimer in the\n\/\/ documentation and\/or other materials provided with the distribution.\n\/\/ * Neither the name of HyperDex nor the names of its contributors may be\n\/\/ used to endorse or promote products derived from this software without\n\/\/ specific prior written permission.\n\/\/\n\/\/ THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS \"AS IS\"\n\/\/ AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE\n\/\/ IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE\n\/\/ ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE\n\/\/ LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR\n\/\/ CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF\n\/\/ SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS\n\/\/ INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN\n\/\/ CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)\n\/\/ ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE\n\/\/ POSSIBILITY OF SUCH DAMAGE.\n\n#define __STDC_LIMIT_MACROS\n\n\/\/ C\n#include <cassert>\n#include <cstdlib>\n#include <ctime>\n\n\/\/ HyperspaceHashing\n#include \"hashes_internal.h\"\n#include \"hyperspacehashing\/hashes.h\"\n#include \"hyperspacehashing\/mask.h\"\n#include \"hyperspacehashing\/prefix.h\"\n#include \"hyperspacehashing\/search.h\"\n\nusing hyperspacehashing::hash_t;\nusing hyperspacehashing::EQUALITY;\nusing hyperspacehashing::NONE;\nusing namespace hyperspacehashing;\n\nvoid\nvalidate(const std::vector<hash_t> hf, const e::buffer& key, const std::vector<e::buffer>& value);\n\nint\nmain(int, char* [])\n{\n srand(time(NULL));\n\n for (size_t i = 0; i < 100; ++i)\n {\n uint32_t nums[5];\n\n for (int j = 0; j < 5; ++j)\n {\n nums[j] = static_cast<uint32_t>(rand());\n }\n\n for (size_t k = EQUALITY; k <= NONE; ++k)\n {\n std::vector<hash_t> hf(1);\n hf[0] = static_cast<hash_t>(k);\n\n std::vector<e::buffer> value;\n e::buffer key;\n key.pack() << nums[0];\n validate(hf, key, value);\n hf.push_back(NONE);\n value.push_back(e::buffer());\n\n for (size_t v1 = EQUALITY; v1 <= NONE; ++v1)\n {\n assert(hf.size() == 2);\n assert(value.size() == 1);\n hf[1] = static_cast<hash_t>(v1);\n value[0].pack() << nums[1];\n validate(hf, key, value);\n hf.push_back(NONE);\n value.push_back(e::buffer());\n\n for (size_t v2 = EQUALITY; v2 <= NONE; ++v2)\n {\n assert(hf.size() == 3);\n assert(value.size() == 2);\n hf[2] = static_cast<hash_t>(v2);\n value[1].pack() << nums[2];\n validate(hf, key, value);\n hf.push_back(NONE);\n value.push_back(e::buffer());\n\n for (size_t v3 = EQUALITY; v3 <= NONE; ++v3)\n {\n assert(hf.size() == 4);\n assert(value.size() == 3);\n hf[3] = static_cast<hash_t>(v3);\n value[2].pack() << nums[3];\n validate(hf, key, value);\n hf.push_back(NONE);\n value.push_back(e::buffer());\n\n for (size_t v4 = EQUALITY; v4 <= NONE; ++v4)\n {\n assert(hf.size() == 5);\n assert(value.size() == 4);\n hf[4] = static_cast<hash_t>(v4);\n value[3].pack() << nums[4];\n validate(hf, key, value);\n }\n\n value.pop_back();\n hf.pop_back();\n }\n\n value.pop_back();\n hf.pop_back();\n }\n\n value.pop_back();\n hf.pop_back();\n }\n }\n }\n\n return EXIT_SUCCESS;\n}\n\nvoid\nvalidate(const std::vector<hash_t> hf, const e::buffer& key, const std::vector<e::buffer>& value)\n{\n prefix::hasher ph(hf);\n prefix::coordinate pc = ph.hash(key, value);\n \/\/mask::hasher mh(hf);\n \/\/mask::coordinate mc = mh.hash(key, value);\n\n \/\/ Do an equality search for each attribute\n for (size_t i = 0; i < value.size() + 1; ++i)\n {\n search s(value.size() + 1);\n\n if (i == 0)\n {\n s.equality_set(0, key);\n }\n else\n {\n s.equality_set(i, value[i - 1]);\n }\n\n prefix::search_coordinate psc = ph.hash(s);\n \/\/mask::search_coordinate msc = mh.hash(s);\n assert(psc.matches(pc));\n \/\/assert(msc.matches(mc));\n \/\/assert(msc.matches(key, value));\n }\n\n \/\/ Do a range search for each attribute\n for (size_t i = 0; i < value.size() + 1; ++i)\n {\n search s(value.size() + 1);\n\n if (i == 0)\n {\n uint64_t num = lendian(key);\n s.range_set(0, num, num + 1);\n }\n else\n {\n uint64_t num = lendian(value[i - 1]);\n s.range_set(i, num, num + 1);\n }\n\n prefix::search_coordinate psc = ph.hash(s);\n \/\/mask::search_coordinate msc = mh.hash(s);\n assert(psc.matches(pc));\n \/\/assert(msc.matches(mc));\n \/\/assert(msc.matches(key, value));\n }\n\n \/\/ Do an equality\/range search for two attributes\n for (size_t i = 0; i < value.size() + 1; ++i)\n {\n for (size_t j = 0; j < value.size() + 1; ++j)\n {\n if (i == j)\n {\n continue;\n }\n\n search s(value.size() + 1);\n\n if (i == 0)\n {\n s.equality_set(0, key);\n }\n else\n {\n s.equality_set(i, value[i - 1]);\n }\n\n if (j == 0)\n {\n uint64_t num = lendian(key);\n s.range_set(0, num, num + 1);\n }\n else\n {\n uint64_t num = lendian(value[j - 1]);\n s.range_set(j, num, num + 1);\n }\n\n prefix::search_coordinate psc = ph.hash(s);\n \/\/mask::search_coordinate msc = mh.hash(s);\n assert(psc.matches(pc));\n \/\/assert(msc.matches(mc));\n \/\/assert(msc.matches(key, value));\n }\n }\n}\n<|endoftext|>"} {"text":"<commit_before>#include <tiramisu\/tiramisu.h>\n#include <vector>\n#include \"configure.h\"\n\nusing namespace tiramisu;\n\nint main()\n{\n init(\"densenet_block\");\n\n \/\/ -------------------------------------------------------\n \/\/ Layer I\n \/\/ -------------------------------------------------------\n var x(\"x\", 0, N), y(\"y\", 0, N), z(\"z\", 0, 4*GR), n(\"n\", 0, BATCH_SIZE);\n var _y(\"_y\", 0, N - 1);\n\n var x_pad(\"x\", 0, N + 2), y_pad(\"y\", 0, N + 2);\n var k_x(\"k_x\", 0, K_X), k_y(\"k_y\", 0, K_Y), fout(\"fout\", 0, GR);\n\n var z_b(\"z_b\", 0, Z_NB_BLOCKS), zz(\"zz\", 0, Z_BLOCKING);\n var fout_b(\"fout_b\", 0, FOUT_NB_BLOCKS), ffout(\"ffout\", 0, FOUT_BLOCKING);\n\n input c_input(\"c_input\", {n, z_b, y, x, zz}, p_float32);\n input bn_scale(\"bn_scale\", {z_b, zz}, p_float32);\n input bn_shift(\"bn_shift\", {z_b, zz}, p_float32);\n\n input conv_filter(\"conv_filter\", {z_b, fout_b, k_y, k_x, ffout, zz}, p_float32);\n input conv_bias(\"conv_bias\", {fout_b, ffout}, p_float32);\n\n \/\/ Batch normalization followed by ReLU\n \/\/ Compute the sum over the features dimension (z)\n computation input_sum_init(\"input_sum_init\", {z_b, zz}, cast(p_float32, 0));\n computation input_sum(\n \"input_sum\", \n {n, z_b, y, x, zz}, \n input_sum_init(z_b, zz) + c_input(n, z_b, y, x, zz)\n );\n\n \/\/ Compute the sum of squares over the features dimension (z)\n computation input_sum_squares_init(\"input_sum_squares_init\", {z_b, zz}, cast(p_float32, 0));\n computation input_sum_squares(\n \"input_sum_squares\", \n {n, z_b, y, x, zz}, \n input_sum_squares_init(z_b, zz) + c_input(n, z_b, y, x, zz) * c_input(n, z_b, y, x, zz)\n );\n\n computation input_mean(\n \"input_mean\", \n {z_b, zz}, \n input_sum(BATCH_SIZE - 1, z_b, N - 1, N - 1, zz) \/ cast(p_float32, BATCH_SIZE*N*N)\n );\n\n computation input_sd(\n \"input_sd\", \n {z_b, zz}, \n expr(\n o_sqrt, \n input_sum_squares(BATCH_SIZE - 1, z_b, N - 1, N - 1, zz) \/ cast(p_float32, BATCH_SIZE*N*N) - input_mean(z_b, zz) * input_mean(z_b, zz) + cast(p_float32, EPSILON)\n )\n );\n \n \/\/ Compute BN followed by ReLU\n std::vector<var> bn_relu_iter_vars = {n, z_b, y, x, zz};\n if (SCHEDULE_FUSION)\n bn_relu_iter_vars = {n, z_b, _y, x, zz};\n \n computation init_workspace(\"init_workspace\", {n, z_b, y_pad, x_pad, zz}, cast(p_float32, 0));\n computation bn(\"bn\", bn_relu_iter_vars, expr(p_float32));\n computation relu(\"relu\", bn_relu_iter_vars, expr(p_float32));\n \n \/\/ These two computations are not scheduled when fusion is disabled\n computation bn_prelude(\"bn_prelude\", {n, z_b, x, zz}, expr(p_float32), SCHEDULE_FUSION);\n computation relu_prelude(\"relu_prelude\", {n, z_b, x, zz}, expr(p_float32), SCHEDULE_FUSION);\n\n if (!SCHEDULE_FUSION) {\n bn.set_expression(bn_scale(z_b, zz) * ((c_input(n, z_b, y, x, zz) - input_mean(z_b, zz)) \/ input_sd(z_b, zz)) + bn_shift(z_b, zz));\n relu.set_expression(\n expr(\n o_max, \n cast(p_float32, 0), bn(n, z_b, y, x, zz)\n )\n );\n }\n\n else {\n bn_prelude.set_expression(bn_scale(z_b, zz) * ((c_input(n, z_b, 0, x, zz) - input_mean(z_b, zz)) \/ input_sd(z_b, zz)) + bn_shift(z_b, zz));\n relu_prelude.set_expression(\n expr(\n o_max, \n cast(p_float32, 0), bn_prelude(n, z_b, x, zz)\n )\n );\n\n\n bn.set_expression(bn_scale(z_b, zz) * ((c_input(n, z_b, _y + 1, x, zz) - input_mean(z_b, zz)) \/ input_sd(z_b, zz)) + bn_shift(z_b, zz));\n relu.set_expression(\n expr(\n o_max, \n cast(p_float32, 0), bn(n, z_b, _y, x, zz)\n )\n );\n }\n\n view relu_padded(\"relu_padded\", {n, z_b, y_pad, x_pad, zz}, p_float32);\n\n \/\/ Convolution computation\n std::vector<var> conv_iter_vars = {n, z_b, fout_b, y, x, k_y, k_x, ffout, zz};\n if (SCHEDULE_FUSION)\n conv_iter_vars = {n, z_b, fout_b, _y, x, k_y, k_x, ffout, zz};\n\n computation init_output(\"init_output\", {n, fout_b, y, x, ffout}, conv_bias(fout_b, ffout));\n computation conv(\"conv\", conv_iter_vars, expr(p_float32));\n\n \/\/ This operation is not scheduled when fusion is disabled\n computation conv_conclude(\n \"conv_conclude\", \n {n, z_b, fout_b, x, k_y, k_x, ffout, zz}, \n expr(p_float32), \n SCHEDULE_FUSION\n );\n\n if (!SCHEDULE_FUSION)\n conv.set_expression(init_output(n, fout_b, y, x, ffout) + relu_padded(n, z_b, y + k_y, x + k_x, zz)*conv_filter(z_b, fout_b, k_y, k_x, ffout, zz));\n\n else {\n conv.set_expression(init_output(n, fout_b, _y, x, ffout) + relu_padded(n, z_b, _y + k_y, x + k_x, zz)*conv_filter(z_b, fout_b, k_y, k_x, ffout, zz));\n conv_conclude.set_expression(init_output(n, fout_b, N - 1, x, ffout) + relu_padded(n, z_b, N + k_y - 1, x + k_x, zz)*conv_filter(z_b, fout_b, k_y, k_x, ffout, zz));\n }\n \n \/\/ -------------------------------------------------------\n \/\/ Layer II\n \/\/ -------------------------------------------------------\n if (!SCHEDULE_FUSION) {\n init_output.then(input_sum_init, computation::root)\n .then(input_sum_squares_init, zz)\n .then(input_sum, computation::root)\n .then(input_sum_squares, zz)\n .then(input_mean, computation::root)\n .then(input_sd, zz)\n .then(init_workspace, computation::root)\n .then(bn, z_b)\n .then(relu, zz)\n .then(conv, computation::root);\n\n input_sum.vectorize(zz, Z_BLOCKING);\n \n bn.tag_parallel_level(n);\n bn.vectorize(zz, Z_BLOCKING);\n\n \/\/n, z_b, fout_b, y, x, k_y, k_x, ffout, z_b\n conv.interchange(x, k_y);\n conv.interchange(x, k_x);\n\n if (BLOCK_NUMBER >= 1) {\n conv.interchange(y, k_y);\n conv.interchange(y, k_x);\n }\n \n conv.tag_parallel_level(n);\n conv.vectorize(ffout, FOUT_BLOCKING);\n }\n\n else {\n conv.interchange(fout_b, _y);\n conv_conclude.interchange(fout_b, x);\n\n init_output.then(input_sum_init, computation::root)\n .then(input_sum_squares_init, zz)\n .then(input_sum, computation::root)\n .then(input_sum_squares, zz)\n .then(input_mean, computation::root)\n .then(input_sd, zz)\n .then(init_workspace, computation::root)\n .then(bn_prelude, z_b)\n .then(relu_prelude, z_b)\n .then(bn, z_b)\n .then(relu, zz)\n .then(conv, _y)\n .then(conv_conclude, z_b);\n\n input_sum.vectorize(zz, Z_BLOCKING);\n bn_prelude.vectorize(zz, Z_BLOCKING);\n bn.vectorize(zz, Z_BLOCKING);\n\n \/\/n, z_b, y, fout_b, x, k_y, k_x, ffout, zz\n conv.interchange(x, k_y);\n conv.interchange(x, k_x);\n\n conv_conclude.interchange(x, k_y);\n conv_conclude.interchange(x, k_x);\n \/\/n, z_b, y, fout_b, k_y, k_x, x, ffout, zz\n \n conv.tag_parallel_level(n);\n conv.vectorize(ffout, FOUT_BLOCKING);\n conv_conclude.vectorize(ffout, FOUT_BLOCKING);\n }\n\n \/\/ -------------------------------------------------------\n \/\/ Layer III\n \/\/ -------------------------------------------------------\n buffer output_buf(\"output_buf\", {BATCH_SIZE, FOUT_NB_BLOCKS, N, N, FOUT_BLOCKING}, p_float32, a_output);\n\n buffer input_mean_buf(\"input_mean_buf\", {Z_NB_BLOCKS, Z_BLOCKING}, p_float32, a_temporary);\n buffer input_sd_buf(\"input_sd_buf\", {Z_NB_BLOCKS, Z_BLOCKING}, p_float32, a_temporary);\n\n \/\/ We use this buffer as a temporary buffer to store BN and ReLU results\n \/\/ This buffer is padded (its width and height are C_N + 2) so as to prepare it for convolution\n std::vector<expr> workspace_dim_sizes = {BATCH_SIZE, Z_NB_BLOCKS, N + 2, N + 2, Z_BLOCKING};\n\n \/\/ When fusion is enabled, we don't need the second dimension of workspace_buf.\n \/\/ This is because we consume all computed values of this buffer before moving\n \/\/ on to the next z_block.\n if (SCHEDULE_FUSION)\n workspace_dim_sizes = {BATCH_SIZE, N + 2, N + 2, Z_BLOCKING};\n\n buffer workspace_buf(\n \"workspace_buf\", \n workspace_dim_sizes, \n p_float32, \n a_temporary\n );\n\n if (!SCHEDULE_FUSION)\n init_workspace.store_in(&workspace_buf);\n else\n init_workspace.store_in(&workspace_buf, {n, y_pad, x_pad, zz});\n\n input_sum_init.store_in(&input_mean_buf);\n input_sum.store_in(&input_mean_buf, {z_b, zz});\n input_mean.store_in(&input_mean_buf);\n \n input_sum_squares_init.store_in(&input_sd_buf);\n input_sum_squares.store_in(&input_sd_buf, {z_b, zz});\n input_sd.store_in(&input_sd_buf);\n\n if (!SCHEDULE_FUSION) {\n \/\/ We shift the BN and ReLU computations, so as to avoid to\n \/\/ compute on the padding region of workspace_buf.\n bn.store_in(&workspace_buf, {n, z_b, y + 1, x + 1, zz});\n relu.store_in(&workspace_buf, {n, z_b, y + 1, x + 1, zz});\n relu_padded.store_in(&workspace_buf);\n\n init_output.store_in(&output_buf);\n conv.store_in(&output_buf, {n, fout_b, y, x, ffout});\n }\n\n else {\n \/\/ We shift the BN and ReLU computations, so as to avoid to\n \/\/ compute on the padding region of workspace_buf.\n bn_prelude.store_in(&workspace_buf, {n, 1, x + 1, zz});\n relu_prelude.store_in(&workspace_buf, {n, 1, x + 1, zz});\n\n bn.store_in(&workspace_buf, {n, _y + 2, x + 1, zz});\n relu.store_in(&workspace_buf, {n, _y + 2, x + 1, zz});\n\n relu_padded.store_in(&workspace_buf, {n, y_pad, x_pad, zz});\n\n init_output.store_in(&output_buf);\n conv.store_in(&output_buf, {n, fout_b, _y, x, ffout});\n conv_conclude.store_in(&output_buf, {n, fout_b, N - 1, x, ffout});\n }\n\n \/\/ -------------------------------------------------------\n \/\/ Code Generation\n \/\/ -------------------------------------------------------\n codegen({\n c_input.get_buffer(),\n bn_scale.get_buffer(), \n bn_shift.get_buffer(),\n conv_filter.get_buffer(), \n conv_bias.get_buffer(), \n &output_buf\n }, \"densenet_block_tiramisu.o\");\n\n return 0;\n}\n<commit_msg>DenseNet block : Fuse BN-ReLU with CONV<commit_after>#include <tiramisu\/tiramisu.h>\n#include <vector>\n#include \"configure.h\"\n\nusing namespace tiramisu;\n\nint main()\n{\n init(\"densenet_block\");\n\n \/\/ -------------------------------------------------------\n \/\/ Layer I\n \/\/ -------------------------------------------------------\n var x(\"x\", 0, N), y(\"y\", 0, N), z(\"z\", 0, 4*GR), n(\"n\", 0, BATCH_SIZE);\n var _y(\"_y\", 0, N - 1);\n\n var x_pad(\"x\", 0, N + 2), y_pad(\"y\", 0, N + 2);\n var k_x(\"k_x\", 0, K_X), k_y(\"k_y\", 0, K_Y), fout(\"fout\", 0, GR);\n\n var z_b(\"z_b\", 0, Z_NB_BLOCKS), zz(\"zz\", 0, Z_BLOCKING);\n var fout_b(\"fout_b\", 0, FOUT_NB_BLOCKS), ffout(\"ffout\", 0, FOUT_BLOCKING);\n\n input c_input(\"c_input\", {n, z_b, y, x, zz}, p_float32);\n input bn_scale(\"bn_scale\", {z_b, zz}, p_float32);\n input bn_shift(\"bn_shift\", {z_b, zz}, p_float32);\n\n input conv_filter(\"conv_filter\", {z_b, fout_b, k_y, k_x, ffout, zz}, p_float32);\n input conv_bias(\"conv_bias\", {fout_b, ffout}, p_float32);\n\n \/\/ Batch normalization followed by ReLU\n \/\/ Compute the sum over the features dimension (z)\n computation input_sum_init(\"input_sum_init\", {z_b, zz}, cast(p_float32, 0));\n computation input_sum(\n \"input_sum\", \n {n, z_b, y, x, zz}, \n input_sum_init(z_b, zz) + c_input(n, z_b, y, x, zz)\n );\n\n \/\/ Compute the sum of squares over the features dimension (z)\n computation input_sum_squares_init(\"input_sum_squares_init\", {z_b, zz}, cast(p_float32, 0));\n computation input_sum_squares(\n \"input_sum_squares\", \n {n, z_b, y, x, zz}, \n input_sum_squares_init(z_b, zz) + c_input(n, z_b, y, x, zz) * c_input(n, z_b, y, x, zz)\n );\n\n computation input_mean(\n \"input_mean\", \n {z_b, zz}, \n input_sum(BATCH_SIZE - 1, z_b, N - 1, N - 1, zz) \/ cast(p_float32, BATCH_SIZE*N*N)\n );\n\n computation input_sd(\n \"input_sd\", \n {z_b, zz}, \n expr(\n o_sqrt, \n input_sum_squares(BATCH_SIZE - 1, z_b, N - 1, N - 1, zz) \/ cast(p_float32, BATCH_SIZE*N*N) - input_mean(z_b, zz) * input_mean(z_b, zz) + cast(p_float32, EPSILON)\n )\n );\n \n \/\/ Compute BN followed by ReLU\n std::vector<var> bn_relu_iter_vars = {n, z_b, y, x, zz};\n if (SCHEDULE_FUSION)\n bn_relu_iter_vars = {n, z_b, _y, x, zz};\n \n computation init_workspace(\"init_workspace\", {n, z_b, y_pad, x_pad, zz}, cast(p_float32, 0));\n computation bn(\"bn\", bn_relu_iter_vars, expr(p_float32));\n computation relu(\"relu\", bn_relu_iter_vars, expr(p_float32));\n \n \/\/ These two computations are not scheduled when fusion is disabled\n computation bn_prelude(\"bn_prelude\", {n, z_b, x, zz}, expr(p_float32), SCHEDULE_FUSION);\n computation relu_prelude(\"relu_prelude\", {n, z_b, x, zz}, expr(p_float32), SCHEDULE_FUSION);\n\n if (!SCHEDULE_FUSION) {\n bn.set_expression(bn_scale(z_b, zz) * ((c_input(n, z_b, y, x, zz) - input_mean(z_b, zz)) \/ input_sd(z_b, zz)) + bn_shift(z_b, zz));\n relu.set_expression(\n expr(\n o_max, \n cast(p_float32, 0), bn(n, z_b, y, x, zz)\n )\n );\n }\n\n else {\n bn_prelude.set_expression(bn_scale(z_b, zz) * ((c_input(n, z_b, 0, x, zz) - input_mean(z_b, zz)) \/ input_sd(z_b, zz)) + bn_shift(z_b, zz));\n relu_prelude.set_expression(\n expr(\n o_max, \n cast(p_float32, 0), bn_prelude(n, z_b, x, zz)\n )\n );\n\n\n bn.set_expression(bn_scale(z_b, zz) * ((c_input(n, z_b, _y + 1, x, zz) - input_mean(z_b, zz)) \/ input_sd(z_b, zz)) + bn_shift(z_b, zz));\n relu.set_expression(\n expr(\n o_max, \n cast(p_float32, 0), bn(n, z_b, _y, x, zz)\n )\n );\n }\n\n view relu_padded(\"relu_padded\", {n, z_b, y_pad, x_pad, zz}, p_float32);\n\n \/\/ Convolution computation\n std::vector<var> conv_iter_vars = {n, z_b, fout_b, y, x, k_y, k_x, ffout, zz};\n if (SCHEDULE_FUSION)\n conv_iter_vars = {n, z_b, fout_b, _y, x, k_y, k_x, ffout, zz};\n\n computation init_output(\"init_output\", {n, fout_b, y, x, ffout}, conv_bias(fout_b, ffout));\n computation conv(\"conv\", conv_iter_vars, expr(p_float32));\n\n \/\/ This operation is not scheduled when fusion is disabled\n computation conv_conclude(\n \"conv_conclude\", \n {n, z_b, fout_b, x, k_y, k_x, ffout, zz}, \n expr(p_float32), \n SCHEDULE_FUSION\n );\n\n if (!SCHEDULE_FUSION)\n conv.set_expression(init_output(n, fout_b, y, x, ffout) + relu_padded(n, z_b, y + k_y, x + k_x, zz)*conv_filter(z_b, fout_b, k_y, k_x, ffout, zz));\n\n else {\n conv.set_expression(init_output(n, fout_b, _y, x, ffout) + relu_padded(n, z_b, _y + k_y, x + k_x, zz)*conv_filter(z_b, fout_b, k_y, k_x, ffout, zz));\n conv_conclude.set_expression(init_output(n, fout_b, N - 1, x, ffout) + relu_padded(n, z_b, N + k_y - 1, x + k_x, zz)*conv_filter(z_b, fout_b, k_y, k_x, ffout, zz));\n }\n \n \/\/ -------------------------------------------------------\n \/\/ Layer II\n \/\/ -------------------------------------------------------\n if (!SCHEDULE_FUSION) {\n init_output.then(input_sum_init, computation::root)\n .then(input_sum_squares_init, zz)\n .then(input_sum, computation::root)\n .then(input_sum_squares, zz)\n .then(input_mean, computation::root)\n .then(input_sd, zz)\n .then(init_workspace, computation::root)\n .then(bn, z_b)\n .then(relu, zz)\n .then(conv, computation::root);\n\n input_sum.vectorize(zz, Z_BLOCKING);\n \n bn.tag_parallel_level(n);\n bn.vectorize(zz, Z_BLOCKING);\n\n \/\/n, z_b, fout_b, y, x, k_y, k_x, ffout, z_b\n conv.interchange(x, k_y);\n conv.interchange(x, k_x);\n \/\/n, z_b, fout_b, y, k_y, k_x, x, ffout, z_b\n\n if (BLOCK_NUMBER >= 1) {\n \/\/n, z_b, fout_b, y, k_y, k_x, x, ffout, z_b\n conv.interchange(y, k_y);\n conv.interchange(y, k_x);\n \/\/n, z_b, fout_b, k_y, k_x, y, x, ffout, z_b\n }\n \n conv.tag_parallel_level(n);\n conv.vectorize(ffout, FOUT_BLOCKING);\n }\n\n else {\n conv.interchange(fout_b, _y);\n conv_conclude.interchange(fout_b, x);\n\n init_output.then(input_sum_init, computation::root)\n .then(input_sum_squares_init, zz)\n .then(input_sum, computation::root)\n .then(input_sum_squares, zz)\n .then(input_mean, computation::root)\n .then(input_sd, zz)\n .then(init_workspace, computation::root)\n .then(bn_prelude, z_b)\n .then(relu_prelude, z_b)\n .then(bn, z_b)\n .then(relu, zz)\n .then(conv, _y)\n .then(conv_conclude, z_b);\n\n input_sum.vectorize(zz, Z_BLOCKING);\n bn_prelude.vectorize(zz, Z_BLOCKING);\n bn.vectorize(zz, Z_BLOCKING);\n\n \/\/n, z_b, y, fout_b, x, k_y, k_x, ffout, zz\n conv.interchange(x, k_y);\n conv.interchange(x, k_x);\n\n conv_conclude.interchange(x, k_y);\n conv_conclude.interchange(x, k_x);\n \/\/n, z_b, y, fout_b, k_y, k_x, x, ffout, zz\n \n conv.tag_parallel_level(n);\n conv.vectorize(ffout, FOUT_BLOCKING);\n conv_conclude.vectorize(ffout, FOUT_BLOCKING);\n }\n\n \/\/ -------------------------------------------------------\n \/\/ Layer III\n \/\/ -------------------------------------------------------\n buffer output_buf(\"output_buf\", {BATCH_SIZE, FOUT_NB_BLOCKS, N, N, FOUT_BLOCKING}, p_float32, a_output);\n\n buffer input_mean_buf(\"input_mean_buf\", {Z_NB_BLOCKS, Z_BLOCKING}, p_float32, a_temporary);\n buffer input_sd_buf(\"input_sd_buf\", {Z_NB_BLOCKS, Z_BLOCKING}, p_float32, a_temporary);\n\n \/\/ We use this buffer as a temporary buffer to store BN and ReLU results\n \/\/ This buffer is padded (its width and height are C_N + 2) so as to prepare it for convolution\n std::vector<expr> workspace_dim_sizes = {BATCH_SIZE, Z_NB_BLOCKS, N + 2, N + 2, Z_BLOCKING};\n\n \/\/ When fusion is enabled, we don't need the second dimension of workspace_buf.\n \/\/ This is because we consume all computed values of this buffer before moving\n \/\/ on to the next z_block.\n if (SCHEDULE_FUSION)\n workspace_dim_sizes = {BATCH_SIZE, N + 2, N + 2, Z_BLOCKING};\n\n buffer workspace_buf(\n \"workspace_buf\", \n workspace_dim_sizes, \n p_float32, \n a_temporary\n );\n\n if (!SCHEDULE_FUSION)\n init_workspace.store_in(&workspace_buf);\n else\n init_workspace.store_in(&workspace_buf, {n, y_pad, x_pad, zz});\n\n input_sum_init.store_in(&input_mean_buf);\n input_sum.store_in(&input_mean_buf, {z_b, zz});\n input_mean.store_in(&input_mean_buf);\n \n input_sum_squares_init.store_in(&input_sd_buf);\n input_sum_squares.store_in(&input_sd_buf, {z_b, zz});\n input_sd.store_in(&input_sd_buf);\n\n if (!SCHEDULE_FUSION) {\n \/\/ We shift the BN and ReLU computations, so as to avoid to\n \/\/ compute on the padding region of workspace_buf.\n bn.store_in(&workspace_buf, {n, z_b, y + 1, x + 1, zz});\n relu.store_in(&workspace_buf, {n, z_b, y + 1, x + 1, zz});\n relu_padded.store_in(&workspace_buf);\n\n init_output.store_in(&output_buf);\n conv.store_in(&output_buf, {n, fout_b, y, x, ffout});\n }\n\n else {\n \/\/ We shift the BN and ReLU computations, so as to avoid to\n \/\/ compute on the padding region of workspace_buf.\n bn_prelude.store_in(&workspace_buf, {n, 1, x + 1, zz});\n relu_prelude.store_in(&workspace_buf, {n, 1, x + 1, zz});\n\n bn.store_in(&workspace_buf, {n, _y + 2, x + 1, zz});\n relu.store_in(&workspace_buf, {n, _y + 2, x + 1, zz});\n\n relu_padded.store_in(&workspace_buf, {n, y_pad, x_pad, zz});\n\n init_output.store_in(&output_buf);\n conv.store_in(&output_buf, {n, fout_b, _y, x, ffout});\n conv_conclude.store_in(&output_buf, {n, fout_b, N - 1, x, ffout});\n }\n\n \/\/ -------------------------------------------------------\n \/\/ Code Generation\n \/\/ -------------------------------------------------------\n codegen({\n c_input.get_buffer(),\n bn_scale.get_buffer(), \n bn_shift.get_buffer(),\n conv_filter.get_buffer(), \n conv_bias.get_buffer(), \n &output_buf\n }, \"densenet_block_tiramisu.o\");\n\n return 0;\n}\n<|endoftext|>"} {"text":"<commit_before>\/*\n Copyright (C) 2013 Samsung Electronics\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 \"eweb_view.h\"\n#include \"selection_controller_efl.h\"\n#include \"selection_handle_efl.h\"\n#include \"selection_box_efl.h\"\n#include \"selection_magnifier_efl.h\"\n\nnamespace content {\n\nstatic bool IsRectEmpty(const gfx::Rect& rect) {\n if (rect.x() == 0 && rect.y() == 0 && rect.height() == 0 && rect.width() == 0) {\n LOG(INFO) << \"SelectionControllerEfl:IsRectEmpty : true\";\n return true;\n }\n return false;\n}\n\nSelectionControllerEfl::SelectionControllerEfl(EWebView* parent_view)\n : parent_view_(parent_view),\n mouse_press_(false),\n long_mouse_press_(false),\n scrolling_(false),\n selection_data_(new SelectionBoxEfl(parent_view)),\n start_handle_(new SelectionHandleEfl(this, SelectionHandleEfl::HANDLE_TYPE_LEFT, parent_view->evas_object())),\n end_handle_(new SelectionHandleEfl(this, SelectionHandleEfl::HANDLE_TYPE_RIGHT, parent_view->evas_object())),\n input_handle_(new SelectionHandleEfl(this, SelectionHandleEfl::HANDLE_TYPE_INPUT, parent_view->evas_object())),\n magnifier_(new SelectionMagnifierEfl(this)) {\n evas_object_event_callback_add(parent_view_->evas_object(), EVAS_CALLBACK_MOVE, &EvasParentViewMoveCallback, this);\n}\n\nvoid SelectionControllerEfl::SetSelectionStatus(bool enable) {\n LOG(INFO) << \"SelectionControllerEfl::SetSelectionStatus \" << enable;\n selection_data_->SetStatus(enable);\n}\n\nbool SelectionControllerEfl::GetSelectionStatus() const {\n LOG(INFO) << \"SelectionControllerEfl::GetSelectionStatus \" << selection_data_->GetStatus();\n return selection_data_->GetStatus();\n}\n\nvoid SelectionControllerEfl::SetSelectionEditable(bool enable) {\n LOG(INFO) << \"SelectionControllerEfl::SetSelectionEditable\" << enable;\n selection_data_->SetEditable(enable);\n}\n\nbool SelectionControllerEfl::GetSelectionEditable() const {\n LOG(INFO) << \"SelectionControllerEfl::GetSelectionEditable \" << selection_data_->GetEditable();\n return selection_data_->GetEditable();\n}\n\nvoid SelectionControllerEfl::SetCaretSelectionStatus(const bool enable) {\n LOG(INFO) << \"SelectionControllerEfl::SetCaretSelectionStatus : \" << enable;\n selection_data_->SetCaretSelectionStatus(enable);\n}\n\nbool SelectionControllerEfl::GetCaretSelectionStatus() const {\n LOG(INFO) << \"SelectionControllerEfl::GetCaretSelectionStatus : \" << selection_data_->GetCaretSelectionStatus();\n return selection_data_->GetCaretSelectionStatus();\n}\n\nvoid SelectionControllerEfl::SetScrollStatus(const bool enable) {\n LOG(INFO) << __PRETTY_FUNCTION__ << \" enable : \" << enable;\n scrolling_ = enable;\n if (enable)\n Clear();\n else\n ShowHandleAndContextMenuIfRequired();\n}\n\nbool SelectionControllerEfl::GetScrollStatus() {\n LOG(INFO) << __PRETTY_FUNCTION__ << \" \" << scrolling_;\n return scrolling_;\n}\n\nvoid SelectionControllerEfl::UpdateSelectionData(const base::string16& text) {\n selection_data_->UpdateSelectStringData(text);\n}\n\nvoid SelectionControllerEfl::UpdateMagnifierScreen(Evas_Object* img) {\n magnifier_->UpdateScreen(img);\n}\n\nvoid SelectionControllerEfl::UpdateSelectionDataAndShow(const gfx::Rect& left_rect, const gfx::Rect& right_rect, bool is_anchor_first) {\n LOG(INFO) << __PRETTY_FUNCTION__;\n selection_data_->UpdateRectData(left_rect, right_rect, is_anchor_first);\n\n if (!IsSelectionValid(left_rect, right_rect)) {\n Clear();\n return;\n }\n\n \/\/ Do not show the context menu and handlers untill long mouse press is released\n if (long_mouse_press_)\n return;\n\n \/\/ Do not show the context menu and handlers while page is scrolling\n if (scrolling_)\n return;\n\n ShowHandleAndContextMenuIfRequired();\n}\n\nvoid SelectionControllerEfl::ShowHandleAndContextMenuIfRequired() {\n LOG(INFO) << __PRETTY_FUNCTION__;\n if (!selection_data_->GetStatus())\n return;\n\n Clear();\n\n \/\/ Is in edit field and no text is selected. show only single handle\n if (selection_data_->IsInEditField() && GetCaretSelectionStatus()) {\n gfx::Rect left = selection_data_->GetLeftRect();\n input_handle_->SetBasePosition(gfx::Point(left.x(), left.y()));\n input_handle_->SetCursorHandlerStatus(true);\n input_handle_->Move(gfx::Point(left.x(), left.y() + left.height()));\n input_handle_->Show();\n\n return;\n }\n\n \/\/ FIXME : Check the text Direction later\n gfx::Rect left = selection_data_->GetLeftRect();\n start_handle_->SetBasePosition(gfx::Point(left.x(), left.y()));\n start_handle_->Move(gfx::Point(left.x(), left.y() + left.height()));\n start_handle_->Show();\n\n gfx::Rect right = selection_data_->GetRightRect();\n\n end_handle_->SetBasePosition(gfx::Point(right.x(), right.y()));\n end_handle_->Move(gfx::Point(right.x() + right.width(), right.y() + right.height()));\n end_handle_->Show();\n\n \/\/ Do not show the context menu during selection extend\n if (!mouse_press_)\n parent_view_->ShowContextMenu(*(selection_data_->GetContextMenuParams()), MENU_TYPE_SELECTION);\n parent_view_->QuerySelectionStyle();\n}\n\nvoid SelectionControllerEfl::HideHandle() {\n SetCaretSelectionStatus(false);\n Clear();\n}\n\nvoid SelectionControllerEfl::HideHandleAndContextMenu() {\n parent_view_->CancelContextMenu(0);\n HideHandle();\n}\n\nvoid SelectionControllerEfl::Clear() {\n start_handle_->Hide();\n end_handle_->Hide();\n input_handle_->Hide();\n}\n\nvoid SelectionControllerEfl::OnMouseDown(const gfx::Point& touch_point) {\n \/\/ Hide context menu on mouse down\n parent_view_->CancelContextMenu(0);\n mouse_press_ = true;\n magnifier_->UpdateLocation(touch_point);\n magnifier_->Move(touch_point);\n magnifier_->Show();\n}\n\nvoid SelectionControllerEfl::OnMouseMove(const gfx::Point& touch_point, bool on_curson_handle) {\n \/\/ FIXME : Check the text Direction later\n magnifier_->UpdateLocation(touch_point);\n magnifier_->Move(touch_point);\n if (!on_curson_handle)\n parent_view_->SelectRange(start_handle_->GetBasePosition(), end_handle_->GetBasePosition());\n else\n parent_view_->MoveCaret(input_handle_->GetBasePosition());\n}\n\nvoid SelectionControllerEfl::OnMouseUp(const gfx::Point& touch_point) {\n selection_data_->UpdateHandleData();\n mouse_press_ = false;\n magnifier_->Hide();\n parent_view_->ShowContextMenu(*(selection_data_->GetContextMenuParams()), MENU_TYPE_SELECTION);\n}\n\nvoid SelectionControllerEfl::GetSelectionBounds(gfx::Rect* left, gfx::Rect* right) {\n if (left)\n *left = selection_data_->GetLeftRect();\n if (right)\n *right = selection_data_->GetRightRect();\n}\n\nvoid SelectionControllerEfl::HandleLongPressEvent(const gfx::Point& touch_point) {\n long_mouse_press_ = true;\n magnifier_->HandleLongPress(touch_point);\n}\n\nvoid SelectionControllerEfl::HandleLongPressMoveEvent(const gfx::Point& touch_point) {\n parent_view_->SelectClosestWord(touch_point);\n\n if (selection_data_->GetCaretSelectionStatus()) {\n parent_view_->MoveCaret(touch_point);\n SetSelectionStatus(true);\n ShowHandleAndContextMenuIfRequired();\n } else{\n parent_view_->SelectClosestWord(touch_point);\n }\n}\n\nvoid SelectionControllerEfl::HandleLongPressEndEvent() {\n long_mouse_press_ = false;\n if (selection_data_->GetCaretSelectionStatus()) {\n SetSelectionStatus(true);\n SetSelectionEditable(true);\n }\n ShowHandleAndContextMenuIfRequired();\n}\n\nbool SelectionControllerEfl::IsSelectionValid(const gfx::Rect& left_rect, const gfx::Rect& right_rect) {\n LOG(INFO) << __PRETTY_FUNCTION__ << \" l_x = \" << left_rect.x() << \" l_y = \" << left_rect.y() << \" r_x = \" << right_rect.x() << \" r_y = \" << right_rect.y();\n \/\/ For all normal cases the widht will be 0 and we want to check empty which Implies\n \/\/ x, y, h w all to be 0\n if ((IsRectEmpty(left_rect) || IsRectEmpty(right_rect))) {\n SetSelectionStatus(false);\n return false;\n }\n\n \/\/ The most of sites return width of each rects as 0 when text is selected.\n \/\/ However, some websites that have viewport attributes on meta tag v\n \/\/ return width 0 right after they are loaded, even though text is not selected.\n \/\/ Thus the width is not sufficient for checking selection condition.\n \/\/ Further invesitigation showed left_rect and right_rect always have the same x,y values\n \/\/ for such cases. So, the equality for x and y rather than width should be tested.\n if (left_rect.x()==right_rect.x() && left_rect.y()==right_rect.y() &&\n !selection_data_->IsInEditField() && !mouse_press_) {\n SetSelectionStatus(false);\n return false;\n }\n\n LOG(INFO) << \"SelectionControllerEfl::IsSelectionValid true\";\n if (!GetSelectionStatus())\n SetSelectionStatus(true);\n\n if (left_rect.x() != right_rect.x() || left_rect.y() != right_rect.y() &&\n selection_data_->IsInEditField() && GetCaretSelectionStatus()) {\n if (!long_mouse_press_)\n SetCaretSelectionStatus(false);\n }\n\n LOG(INFO) << \"SelectionControllerEfl::IsSelectionValid true\";\n return true;\n}\n\nvoid SelectionControllerEfl::ClearSelection() {\n LOG(INFO) << __PRETTY_FUNCTION__;\n Clear();\n selection_data_->SetStatus(false);\n SetSelectionEditable(false);\n SetCaretSelectionStatus(false);\n}\n\nvoid SelectionControllerEfl::OnParentParentViewMove() {\n LOG(INFO) << __PRETTY_FUNCTION__;\n parent_view_->CancelContextMenu(0);\n start_handle_->Move(start_handle_->GetBasePosition());\n end_handle_->Move(end_handle_->GetBasePosition());\n}\n\ngfx::Rect SelectionControllerEfl::GetLeftRect() {\n return selection_data_->GetLeftRect();\n}\n\ngfx::Rect SelectionControllerEfl::GetRightRect() {\n return selection_data_->GetRightRect();\n}\n\n}\n<commit_msg>Fix text-selection malfunctions in some web page issue<commit_after>\/*\n Copyright (C) 2013 Samsung Electronics\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 \"eweb_view.h\"\n#include \"selection_controller_efl.h\"\n#include \"selection_handle_efl.h\"\n#include \"selection_box_efl.h\"\n#include \"selection_magnifier_efl.h\"\n\nnamespace content {\n\nstatic bool IsRectEmpty(const gfx::Rect& rect) {\n if (rect.x() == 0 && rect.y() == 0 && rect.height() == 0 && rect.width() == 0) {\n LOG(INFO) << \"SelectionControllerEfl:IsRectEmpty : true\";\n return true;\n }\n return false;\n}\n\nSelectionControllerEfl::SelectionControllerEfl(EWebView* parent_view)\n : parent_view_(parent_view),\n mouse_press_(false),\n long_mouse_press_(false),\n scrolling_(false),\n selection_data_(new SelectionBoxEfl(parent_view)),\n start_handle_(new SelectionHandleEfl(this, SelectionHandleEfl::HANDLE_TYPE_LEFT, parent_view->evas_object())),\n end_handle_(new SelectionHandleEfl(this, SelectionHandleEfl::HANDLE_TYPE_RIGHT, parent_view->evas_object())),\n input_handle_(new SelectionHandleEfl(this, SelectionHandleEfl::HANDLE_TYPE_INPUT, parent_view->evas_object())),\n magnifier_(new SelectionMagnifierEfl(this)) {\n evas_object_event_callback_add(parent_view_->evas_object(), EVAS_CALLBACK_MOVE, &EvasParentViewMoveCallback, this);\n}\n\nvoid SelectionControllerEfl::SetSelectionStatus(bool enable) {\n LOG(INFO) << \"SelectionControllerEfl::SetSelectionStatus \" << enable;\n selection_data_->SetStatus(enable);\n}\n\nbool SelectionControllerEfl::GetSelectionStatus() const {\n LOG(INFO) << \"SelectionControllerEfl::GetSelectionStatus \" << selection_data_->GetStatus();\n return selection_data_->GetStatus();\n}\n\nvoid SelectionControllerEfl::SetSelectionEditable(bool enable) {\n LOG(INFO) << \"SelectionControllerEfl::SetSelectionEditable\" << enable;\n selection_data_->SetEditable(enable);\n}\n\nbool SelectionControllerEfl::GetSelectionEditable() const {\n LOG(INFO) << \"SelectionControllerEfl::GetSelectionEditable \" << selection_data_->GetEditable();\n return selection_data_->GetEditable();\n}\n\nvoid SelectionControllerEfl::SetCaretSelectionStatus(const bool enable) {\n LOG(INFO) << \"SelectionControllerEfl::SetCaretSelectionStatus : \" << enable;\n selection_data_->SetCaretSelectionStatus(enable);\n}\n\nbool SelectionControllerEfl::GetCaretSelectionStatus() const {\n LOG(INFO) << \"SelectionControllerEfl::GetCaretSelectionStatus : \" << selection_data_->GetCaretSelectionStatus();\n return selection_data_->GetCaretSelectionStatus();\n}\n\nvoid SelectionControllerEfl::SetScrollStatus(const bool enable) {\n LOG(INFO) << __PRETTY_FUNCTION__ << \" enable : \" << enable;\n scrolling_ = enable;\n if (enable)\n Clear();\n else\n ShowHandleAndContextMenuIfRequired();\n}\n\nbool SelectionControllerEfl::GetScrollStatus() {\n LOG(INFO) << __PRETTY_FUNCTION__ << \" \" << scrolling_;\n return scrolling_;\n}\n\nvoid SelectionControllerEfl::UpdateSelectionData(const base::string16& text) {\n selection_data_->UpdateSelectStringData(text);\n}\n\nvoid SelectionControllerEfl::UpdateMagnifierScreen(Evas_Object* img) {\n magnifier_->UpdateScreen(img);\n}\n\nvoid SelectionControllerEfl::UpdateSelectionDataAndShow(const gfx::Rect& left_rect, const gfx::Rect& right_rect, bool is_anchor_first) {\n LOG(INFO) << __PRETTY_FUNCTION__;\n selection_data_->UpdateRectData(left_rect, right_rect, is_anchor_first);\n\n if (!IsSelectionValid(left_rect, right_rect)) {\n Clear();\n return;\n }\n\n \/\/ Do not show the context menu and handlers untill long mouse press is released\n if (long_mouse_press_)\n return;\n\n \/\/ Do not show the context menu and handlers while page is scrolling\n if (scrolling_)\n return;\n\n ShowHandleAndContextMenuIfRequired();\n}\n\nvoid SelectionControllerEfl::ShowHandleAndContextMenuIfRequired() {\n LOG(INFO) << __PRETTY_FUNCTION__;\n if (!selection_data_->GetStatus())\n return;\n\n Clear();\n\n \/\/ Is in edit field and no text is selected. show only single handle\n if (selection_data_->IsInEditField() && GetCaretSelectionStatus()) {\n gfx::Rect left = selection_data_->GetLeftRect();\n input_handle_->SetBasePosition(gfx::Point(left.x(), left.y()));\n input_handle_->SetCursorHandlerStatus(true);\n input_handle_->Move(gfx::Point(left.x(), left.y() + left.height()));\n input_handle_->Show();\n\n return;\n }\n\n \/\/ FIXME : Check the text Direction later\n gfx::Rect left = selection_data_->GetLeftRect();\n \/\/ The base position of start_handle should be set to the middle of the left rectangle.\n \/\/ Otherwise the start_handle may be shifted up when the right_handle is moving\n start_handle_->SetBasePosition(gfx::Point(left.x(), left.y() + (left.height() \/ 2)));\n start_handle_->Move(gfx::Point(left.x(), left.y() + left.height()));\n start_handle_->Show();\n\n gfx::Rect right = selection_data_->GetRightRect();\n\n \/\/ The base position of end_handle should be set to the middle of the right rectangle.\n \/\/ Otherwise the end_handle may be shifted up when the left_handle is moving\n end_handle_->SetBasePosition(gfx::Point(right.x(), right.y() + (right.height() \/ 2)));\n end_handle_->Move(gfx::Point(right.x() + right.width(), right.y() + right.height()));\n end_handle_->Show();\n\n \/\/ Do not show the context menu during selection extend\n if (!mouse_press_)\n parent_view_->ShowContextMenu(*(selection_data_->GetContextMenuParams()), MENU_TYPE_SELECTION);\n parent_view_->QuerySelectionStyle();\n}\n\nvoid SelectionControllerEfl::HideHandle() {\n SetCaretSelectionStatus(false);\n Clear();\n}\n\nvoid SelectionControllerEfl::HideHandleAndContextMenu() {\n parent_view_->CancelContextMenu(0);\n HideHandle();\n}\n\nvoid SelectionControllerEfl::Clear() {\n start_handle_->Hide();\n end_handle_->Hide();\n input_handle_->Hide();\n}\n\nvoid SelectionControllerEfl::OnMouseDown(const gfx::Point& touch_point) {\n \/\/ Hide context menu on mouse down\n parent_view_->CancelContextMenu(0);\n mouse_press_ = true;\n magnifier_->UpdateLocation(touch_point);\n magnifier_->Move(touch_point);\n magnifier_->Show();\n}\n\nvoid SelectionControllerEfl::OnMouseMove(const gfx::Point& touch_point, bool on_curson_handle) {\n \/\/ FIXME : Check the text Direction later\n magnifier_->UpdateLocation(touch_point);\n magnifier_->Move(touch_point);\n if (!on_curson_handle)\n parent_view_->SelectRange(start_handle_->GetBasePosition(), end_handle_->GetBasePosition());\n else\n parent_view_->MoveCaret(input_handle_->GetBasePosition());\n}\n\nvoid SelectionControllerEfl::OnMouseUp(const gfx::Point& touch_point) {\n selection_data_->UpdateHandleData();\n mouse_press_ = false;\n magnifier_->Hide();\n parent_view_->ShowContextMenu(*(selection_data_->GetContextMenuParams()), MENU_TYPE_SELECTION);\n}\n\nvoid SelectionControllerEfl::GetSelectionBounds(gfx::Rect* left, gfx::Rect* right) {\n if (left)\n *left = selection_data_->GetLeftRect();\n if (right)\n *right = selection_data_->GetRightRect();\n}\n\nvoid SelectionControllerEfl::HandleLongPressEvent(const gfx::Point& touch_point) {\n long_mouse_press_ = true;\n magnifier_->HandleLongPress(touch_point);\n}\n\nvoid SelectionControllerEfl::HandleLongPressMoveEvent(const gfx::Point& touch_point) {\n parent_view_->SelectClosestWord(touch_point);\n\n if (selection_data_->GetCaretSelectionStatus()) {\n parent_view_->MoveCaret(touch_point);\n SetSelectionStatus(true);\n ShowHandleAndContextMenuIfRequired();\n } else{\n parent_view_->SelectClosestWord(touch_point);\n }\n}\n\nvoid SelectionControllerEfl::HandleLongPressEndEvent() {\n long_mouse_press_ = false;\n if (selection_data_->GetCaretSelectionStatus()) {\n SetSelectionStatus(true);\n SetSelectionEditable(true);\n }\n ShowHandleAndContextMenuIfRequired();\n}\n\nbool SelectionControllerEfl::IsSelectionValid(const gfx::Rect& left_rect, const gfx::Rect& right_rect) {\n LOG(INFO) << __PRETTY_FUNCTION__ << \" l_x = \" << left_rect.x() << \" l_y = \" << left_rect.y() << \" r_x = \" << right_rect.x() << \" r_y = \" << right_rect.y();\n \/\/ For all normal cases the widht will be 0 and we want to check empty which Implies\n \/\/ x, y, h w all to be 0\n if ((IsRectEmpty(left_rect) || IsRectEmpty(right_rect))) {\n SetSelectionStatus(false);\n return false;\n }\n\n \/\/ The most of sites return width of each rects as 0 when text is selected.\n \/\/ However, some websites that have viewport attributes on meta tag v\n \/\/ return width 0 right after they are loaded, even though text is not selected.\n \/\/ Thus the width is not sufficient for checking selection condition.\n \/\/ Further invesitigation showed left_rect and right_rect always have the same x,y values\n \/\/ for such cases. So, the equality for x and y rather than width should be tested.\n if (left_rect.x()==right_rect.x() && left_rect.y()==right_rect.y() &&\n !selection_data_->IsInEditField() && !mouse_press_) {\n SetSelectionStatus(false);\n return false;\n }\n\n LOG(INFO) << \"SelectionControllerEfl::IsSelectionValid true\";\n if (!GetSelectionStatus())\n SetSelectionStatus(true);\n\n if (left_rect.x() != right_rect.x() || left_rect.y() != right_rect.y() &&\n selection_data_->IsInEditField() && GetCaretSelectionStatus()) {\n if (!long_mouse_press_)\n SetCaretSelectionStatus(false);\n }\n\n LOG(INFO) << \"SelectionControllerEfl::IsSelectionValid true\";\n return true;\n}\n\nvoid SelectionControllerEfl::ClearSelection() {\n LOG(INFO) << __PRETTY_FUNCTION__;\n Clear();\n selection_data_->SetStatus(false);\n SetSelectionEditable(false);\n SetCaretSelectionStatus(false);\n}\n\nvoid SelectionControllerEfl::OnParentParentViewMove() {\n LOG(INFO) << __PRETTY_FUNCTION__;\n parent_view_->CancelContextMenu(0);\n start_handle_->Move(start_handle_->GetBasePosition());\n end_handle_->Move(end_handle_->GetBasePosition());\n}\n\ngfx::Rect SelectionControllerEfl::GetLeftRect() {\n return selection_data_->GetLeftRect();\n}\n\ngfx::Rect SelectionControllerEfl::GetRightRect() {\n return selection_data_->GetRightRect();\n}\n\n}\n<|endoftext|>"} {"text":"<commit_before><commit_msg>Fixing the google browser name in about:memory page.<commit_after><|endoftext|>"} {"text":"<commit_before>\npublic class Vector {\n\n private float[] vect;\n int index;\n\n public Vector() {\n vect = new float[3];\n index = 0;\n }\n\n public void setVector(float x, float y, float z) {\n vect[0] = (index*(vect[0])+x)\/(index+1);\n vect[1] = (index*(vect[1])+y)\/(index+1);\n vect[2] = (index*(vect[2])+z)\/(index+1);\n index++;\n \n }\n \n public float[] getVector(){\n return this.vect;\n }\n \n public Vector unitVector(){\n float d = (float) Math.sqrt(vect[0]*vect[0]+vect[1]*vect[1]+vect[2]*vect[2]);\n Vector v = new Vector();\n v.setVector(vect[0]\/d, vect[1]\/d, vect[2]\/d);\n return v;\n }\n}\n<commit_msg>the method 'dotProduct' is added to the class<commit_after>\npublic class Vector {\n\n private float[] vect;\n int index;\n\n public Vector() {\n vect = new float[3];\n index = 0;\n }\n\n public void setVector(float x, float y, float z) {\n vect[0] = (index*(vect[0])+x)\/(index+1);\n vect[1] = (index*(vect[1])+y)\/(index+1);\n vect[2] = (index*(vect[2])+z)\/(index+1);\n index++;\n \n }\n \n public float[] getVector(){\n return this.vect;\n }\n \n public static float dotProduct(Vector x, Vector y){\n float[] a = x.getVector();\n float[] b = y.getVector();\n return (a[0]*b[0]+a[1]*b[1]+a[2]*b[2]);\n }\n \n public Vector unitVector(){\n float d = (float) Math.sqrt(vect[0]*vect[0]+vect[1]*vect[1]+vect[2]*vect[2]);\n Vector v = new Vector();\n v.setVector(vect[0]\/d, vect[1]\/d, vect[2]\/d);\n return v;\n }\n}\n<|endoftext|>"} {"text":"<commit_before>#pragma once\r\n\/\/=====================================================================\/\/\r\n\/*! @file\r\n @brief サンプリング・クラス\r\n\t@copyright Copyright 2017 Kunihito Hiramatsu All Right Reserved.\r\n @author 平松邦仁 (hira@rvf-rc45.net)\r\n*\/\r\n\/\/=====================================================================\/\/\r\n#include \"common\/format.hpp\"\r\n#include \"common\/time.h\"\r\n#include \"common\/fixed_fifo.hpp\"\r\n#include \"fixed_map.hpp\"\r\n\r\nnamespace seeda {\r\n\r\n\t\/\/+++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++\/\/\r\n\t\/*!\r\n\t\t@brief サンプリング・ホルダー\r\n\t*\/\r\n\t\/\/+++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++\/\/\r\n\tstruct sample_t {\r\n\r\n\t\tenum class mode : uint8_t {\r\n\t\t\tnone,\t\/\/\/< 無変換\r\n\t\t\treal,\t\/\/\/< 係数変換\r\n\t\t\tabs,\t\/\/\/< 絶対値変換\r\n\t\t};\r\n\r\n\t\tfloat\t\tgain_;\t\t\t\t\/\/\/< 係数変換ゲイン\r\n\/\/\/\t\tfloat\t\toffset_;\t\t\t\/\/\/< 係数オフセット\r\n\r\n\t\tuint32_t\tlimit_lo_count_;\t\/\/\/< lo を超えた数\r\n\t\tuint32_t\tlimit_hi_count_;\t\/\/\/< hi を超えた数\r\n\t\tuint16_t\tlimit_lo_level_;\t\/\/\/< lo レベル\r\n\t\tuint16_t\tlimit_hi_level_;\t\/\/\/< hi レベル\r\n\t\tuint16_t\tcenter_;\r\n\r\n\t\tuint16_t\tch_;\r\n\t\tmode\t\tmode_;\r\n\t\tbool\t\tsignal_;\r\n\t\tuint16_t\tmin_;\r\n\t\tuint16_t\tmax_;\r\n\t\tuint16_t\taverage_;\r\n\t\tuint16_t\tmedian_;\r\n\r\n\t\tsample_t() :\r\n\t\t\tgain_(1024.0f),\r\n\t\t\tlimit_lo_count_(0), limit_hi_count_(0), limit_lo_level_(30000), limit_hi_level_(40000),\r\n\t\t\tcenter_(0),\r\n\t\t\tch_(0), mode_(mode::none), signal_(false),\r\n\t\t\tmin_(0), max_(0), average_(0), median_(0) { }\r\n\r\n\r\n\t\tvoid value_convert(uint16_t value, char* dst, uint32_t size) const\r\n\t\t{\r\n\t\t\tswitch(mode_) {\r\n\t\t\tcase mode::real:\r\n\t\t\t\t{\r\n\t\t\t\t\tint32_t v = static_cast<int32_t>(value) - static_cast<int32_t>(center_);\r\n\t\t\t\t\tfloat a = static_cast<float>(v) \/ 65535.0f * gain_;\r\n\t\t\t\t\tutils::sformat(\"%3.2f\", dst, size, true) % a;\r\n\t\t\t\t}\r\n\t\t\t\tbreak;\r\n\t\t\tcase mode::abs:\r\n\t\t\t\t{\r\n\t\t\t\t\tfloat a = static_cast<float>(value) \/ 65535.0f * gain_;\r\n\t\t\t\t\tutils::sformat(\"%3.2f\", dst, size, true) % a;\r\n\t\t\t\t}\r\n\t\t\t\tbreak;\r\n\t\t\tdefault:\r\n\t\t\t\tutils::sformat(\"%d\", dst, size, true) % value;\r\n\t\t\t\tbreak;\r\n\t\t\t}\r\n\t\t}\r\n\r\n\r\n\t\tvoid make_csv(char* dst, uint32_t size, bool append) const\r\n\t\t{\r\n\t\t\tstatic const char* modes[] = { \"value\", \"real\", \"abs\" };\r\n\r\n\t\t\tutils::sformat(\"%d,%s\", dst, size, append) % ch_ % modes[static_cast<uint32_t>(mode_)];\r\n\t\t\tutils::sformat(\",\", dst, size, true);\r\n\t\t\tvalue_convert(min_, dst, size);\r\n\t\t\tutils::sformat(\",\", dst, size, true);\r\n\t\t\tvalue_convert(max_, dst, size);\r\n\t\t\tutils::sformat(\",\", dst, size, true);\r\n\t\t\tvalue_convert(average_, dst, size);\r\n\t\t\tutils::sformat(\"%d,\", dst, size, true) % static_cast<uint32_t>(limit_lo_level_);\r\n\t\t\tutils::sformat(\"%d,\", dst, size, true) % static_cast<uint32_t>(limit_lo_count_);\r\n\t\t\tutils::sformat(\"%d,\", dst, size, true) % static_cast<uint32_t>(limit_hi_level_);\r\n\t\t\tutils::sformat(\"%d,\", dst, size, true) % static_cast<uint32_t>(limit_hi_count_);\r\n\t\t\tvalue_convert(median_, dst, size);\r\n\t\t}\r\n\r\n\r\n\t\tvoid make_csv2(char* dst, uint32_t size, bool append) const\r\n\t\t{\r\n\t\t\tuint32_t count = limit_lo_count_ + limit_hi_count_;\r\n\r\n\t\t\tutils::sformat(\"%d,\", dst, size, append) % ch_;\r\n\t\t\tvalue_convert(max_, dst, size);\r\n\t\t\tutils::sformat(\",\", dst, size, true);\r\n\t\t\tvalue_convert(min_, dst, size);\r\n\t\t\tutils::sformat(\",\", dst, size, true);\r\n\t\t\tvalue_convert(average_, dst, size);\r\n\t\t\tutils::sformat(\",\", dst, size, true);\r\n\t\t\tvalue_convert(median_, dst, size);\r\n\t\t\tutils::sformat(\",%u\", dst, size, true) % count;\r\n\t\t}\r\n\t};\r\n\r\n\r\n\t\/\/+++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++\/\/\r\n\t\/*!\r\n\t\t@brief サンプル・データ\r\n\t*\/\r\n\t\/\/+++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++\/\/\r\n\tstruct sample_data {\r\n\t\ttime_t\t\ttime_;\r\n\t\tsample_t\tsmp_[8];\r\n\t};\r\n\t\/\/ sample_data FIFO (sizeof 32[sec])\r\n\ttypedef utils::fixed_fifo<sample_data, 32> EADC_FIFO;\r\n\r\n\r\n\t\/\/+++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++\/\/\r\n\t\/*!\r\n\t\t@brief サンプリング・クラス\r\n\t*\/\r\n\t\/\/+++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++\/\/\r\n\tclass sample {\r\n\r\n\t\tsample_t\tt_;\r\n\r\n\t\tuint32_t\tsum_;\r\n\t\tuint32_t\tcount_;\r\n\r\n\t\ttypedef utils::fixed_map<uint16_t, uint16_t, 1000> MAP;\r\n\t\tMAP\t\t\tmap_;\r\n\r\n#if 0\r\n\t\tuint32_t\ttrav_sum_;\r\n\t\tuint32_t\ttrav_med_;\r\n\t\tbool\t\texit_trav_;\r\n\r\n\t\tvoid in_trav_(uint16_t idx)\r\n\t\t{\r\n\t\t\tif(exit_trav_) return;\r\n\r\n\t\t\tif(map_.get_left(idx) != -1) {\r\n\t\t\t\tin_trav_(map_.get_left(idx));\r\n\t\t\t}\r\n\r\n\t\t\tuint32_t cnt = map_.get_pad(idx);\r\n\t\t\ttrav_sum_ += cnt;\r\n\t\t\tif(trav_sum_ >= (count_ \/ 2)) {\r\n\t\t\t\ttrav_med_ = map_.get_key(idx);\r\n\t\t\t\tif((count_ & 1) == 0) {\r\n\t\t\t\t\t++idx;\r\n\t\t\t\t\tif(idx == 1000) { \/\/ 要素数が１個の場合は、平均しない\r\n\t\t\t\t\t\texit_trav_ = true;\r\n\t\t\t\t\t\treturn;\r\n\t\t\t\t\t}\r\n\t\t\t\t\ttrav_med_ += static_cast<uint32_t>(map_.get_key(idx));\r\n\t\t\t\t\ttrav_med_ \/= 2;\r\n\t\t\t\t}\r\n\t\t\t\texit_trav_ = true;\r\n\t\t\t\treturn;\r\n\t\t\t}\r\n\r\n\t\t\tif(map_.get_right(idx) != -1) {\r\n\t\t\t\tin_trav_(map_.get_right(idx));\r\n\t\t\t}\r\n\t\t}\r\n#endif\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\tsample() : t_(), sum_(0), count_(0), map_() { }\r\n\/\/\/\t\t\ttrav_sum_(0), trav_med_(0), exit_trav_(true) { }\r\n\r\n\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\tvoid clear()\r\n\t\t{\r\n\t\t\tsum_ = 0;\r\n\t\t\tcount_ = 0;\r\n\r\n\t\t\tt_.min_ = 65535;\r\n\t\t\tt_.max_ = 0;\r\n\t\t\tt_.average_ = 0;\r\n\t\t\tt_.median_ = 0;\r\n\t\t\tt_.limit_lo_count_ = 0;\r\n\t\t\tt_.limit_hi_count_ = 0;\r\n\r\n\t\t\tmap_.clear();\r\n\t\t}\r\n\r\n\r\n\t\t\/\/-----------------------------------------------------------------\/\/\r\n\t\t\/*!\r\n\t\t\t@brief 追加\r\n\t\t\t@param[in]\tdata\tデータ\r\n\t\t*\/\r\n\t\t\/\/-----------------------------------------------------------------\/\/\r\n\t\tvoid add(uint16_t data)\r\n\t\t{\r\n\t\t\tif(t_.mode_ == sample_t::mode::abs) {\r\n\t\t\t\tif(data >= t_.center_) data -= t_.center_;\r\n\t\t\t\telse data = t_.center_ - data;\r\n\t\t\t}\r\n\r\n\t\t\tsum_ += data;\r\n\t\t\tif(t_.min_ > data) t_.min_ = data;\r\n\t\t\tif(t_.max_ < data) t_.max_ = data;\r\n\r\n\t\t\tif(t_.limit_hi_level_ < data) ++t_.limit_hi_count_;\r\n\t\t\tif(t_.limit_lo_level_ > data) ++t_.limit_lo_count_;\r\n\r\n\t\t\tmap_.insert(data, 1);\r\n\t\t\t++count_;\r\n\t\t}\r\n\r\n\r\n\t\t\/\/-----------------------------------------------------------------\/\/\r\n\t\t\/*!\r\n\t\t\t@brief 主に median の計算\r\n\t\t*\/\r\n\t\t\/\/-----------------------------------------------------------------\/\/\r\n\t\tvoid collect()\r\n\t\t{\r\n#if 0\r\n\t\t\ttrav_med_ = 0;\r\n\t\t\ttrav_sum_ = 0;\r\n\t\t\texit_trav_ = false;\r\n\r\n\/\/\/\t\t\tin_trav_(0);\r\n\r\n\t\t\tt_.median_ = trav_med_;\r\n\t\t\tt_.average_ = trav_sum_ \/ count_;\r\n#endif\r\n\t\t\tuint32_t med = 0;\r\n\t\t\tuint32_t sum = 0;\r\n\t\t\tuint32_t i = 0;\r\n\t\t\twhile(i < 1000) {\r\n\t\t\t\tuint32_t cnt = map_.get_pad(i);\r\n\t\t\t\tsum += cnt;\r\n\t\t\t\tif(sum >= (count_ \/ 2)) {\r\n\t\t\t\t\tmed = map_.get_key(i);\r\n\t\t\t\t\tif((count_ & 1) == 0) {\r\n\t\t\t\t\t\t++i;\r\n\t\t\t\t\t\tif(i >= map_.size()) { \/\/ 要素数が１個の場合は、平均しない\r\n\t\t\t\t\t\t\tbreak;\r\n\t\t\t\t\t\t}\r\n\t\t\t\t\t\tmed += static_cast<uint32_t>(map_.get_key(i));\r\n\t\t\t\t\t\tmed \/= 2;\r\n\t\t\t\t\t}\r\n\t\t\t\t\tbreak;\r\n\t\t\t\t}\r\n\t\t\t\t++i;\r\n\t\t\t}\r\n\t\t\tt_.median_ = med;\r\n\t\t\tt_.average_ = sum_ \/ count_;\r\n\t\t}\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 sample_t& get() const { return t_; }\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\tsample_t& at() { return t_; }\r\n\t};\r\n}\r\n<commit_msg>update: disable MEDIAN filter<commit_after>#pragma once\r\n\/\/=====================================================================\/\/\r\n\/*! @file\r\n @brief サンプリング・クラス\r\n\t@copyright Copyright 2017, 2018 Kunihito Hiramatsu All Right Reserved.\r\n @author 平松邦仁 (hira@rvf-rc45.net)\r\n*\/\r\n\/\/=====================================================================\/\/\r\n#include \"common\/format.hpp\"\r\n#include \"common\/time.h\"\r\n#include \"common\/fixed_fifo.hpp\"\r\n#include \"fixed_map.hpp\"\r\n\r\n\/\/ #define MEDIAN\r\n\r\nnamespace seeda {\r\n\r\n\t\/\/+++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++\/\/\r\n\t\/*!\r\n\t\t@brief サンプリング・ホルダー\r\n\t*\/\r\n\t\/\/+++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++\/\/\r\n\tstruct sample_t {\r\n\r\n\t\tenum class mode : uint8_t {\r\n\t\t\tnone,\t\/\/\/< 無変換\r\n\t\t\treal,\t\/\/\/< 係数変換\r\n\t\t\tabs,\t\/\/\/< 絶対値変換\r\n\t\t};\r\n\r\n\t\tfloat\t\tgain_;\t\t\t\t\/\/\/< 係数変換ゲイン\r\n\/\/\/\t\tfloat\t\toffset_;\t\t\t\/\/\/< 係数オフセット\r\n\r\n\t\tuint32_t\tlimit_lo_count_;\t\/\/\/< lo を超えた数\r\n\t\tuint32_t\tlimit_hi_count_;\t\/\/\/< hi を超えた数\r\n\t\tuint16_t\tlimit_lo_level_;\t\/\/\/< lo レベル\r\n\t\tuint16_t\tlimit_hi_level_;\t\/\/\/< hi レベル\r\n\t\tuint16_t\tcenter_;\r\n\r\n\t\tuint16_t\tch_;\r\n\t\tmode\t\tmode_;\r\n\t\tbool\t\tsignal_;\r\n\t\tuint16_t\tmin_;\r\n\t\tuint16_t\tmax_;\r\n\t\tuint16_t\taverage_;\r\n\t\tuint16_t\tmedian_;\r\n\r\n\t\tsample_t() :\r\n\t\t\tgain_(1024.0f),\r\n\t\t\tlimit_lo_count_(0), limit_hi_count_(0), limit_lo_level_(30000), limit_hi_level_(40000),\r\n\t\t\tcenter_(0),\r\n\t\t\tch_(0), mode_(mode::none), signal_(false),\r\n\t\t\tmin_(0), max_(0), average_(0), median_(0) { }\r\n\r\n\r\n\t\tvoid value_convert(uint16_t value, char* dst, uint32_t size) const\r\n\t\t{\r\n\t\t\tswitch(mode_) {\r\n\t\t\tcase mode::real:\r\n\t\t\t\t{\r\n\t\t\t\t\tint32_t v = static_cast<int32_t>(value) - static_cast<int32_t>(center_);\r\n\t\t\t\t\tfloat a = static_cast<float>(v) \/ 65535.0f * gain_;\r\n\t\t\t\t\tutils::sformat(\"%3.2f\", dst, size, true) % a;\r\n\t\t\t\t}\r\n\t\t\t\tbreak;\r\n\t\t\tcase mode::abs:\r\n\t\t\t\t{\r\n\t\t\t\t\tfloat a = static_cast<float>(value) \/ 65535.0f * gain_;\r\n\t\t\t\t\tutils::sformat(\"%3.2f\", dst, size, true) % a;\r\n\t\t\t\t}\r\n\t\t\t\tbreak;\r\n\t\t\tdefault:\r\n\t\t\t\tutils::sformat(\"%d\", dst, size, true) % value;\r\n\t\t\t\tbreak;\r\n\t\t\t}\r\n\t\t}\r\n\r\n\r\n\t\tvoid make_csv(char* dst, uint32_t size, bool append) const\r\n\t\t{\r\n\t\t\tstatic const char* modes[] = { \"value\", \"real\", \"abs\" };\r\n\r\n\t\t\tutils::sformat(\"%d,%s\", dst, size, append) % ch_ % modes[static_cast<uint32_t>(mode_)];\r\n\t\t\tutils::sformat(\",\", dst, size, true);\r\n\t\t\tvalue_convert(min_, dst, size);\r\n\t\t\tutils::sformat(\",\", dst, size, true);\r\n\t\t\tvalue_convert(max_, dst, size);\r\n\t\t\tutils::sformat(\",\", dst, size, true);\r\n\t\t\tvalue_convert(average_, dst, size);\r\n\t\t\tutils::sformat(\"%d,\", dst, size, true) % static_cast<uint32_t>(limit_lo_level_);\r\n\t\t\tutils::sformat(\"%d,\", dst, size, true) % static_cast<uint32_t>(limit_lo_count_);\r\n\t\t\tutils::sformat(\"%d,\", dst, size, true) % static_cast<uint32_t>(limit_hi_level_);\r\n\t\t\tutils::sformat(\"%d,\", dst, size, true) % static_cast<uint32_t>(limit_hi_count_);\r\n\t\t\tvalue_convert(median_, dst, size);\r\n\t\t}\r\n\r\n\r\n\t\tvoid make_csv2(char* dst, uint32_t size, bool append) const\r\n\t\t{\r\n\t\t\tuint32_t count = limit_lo_count_ + limit_hi_count_;\r\n\r\n\t\t\tutils::sformat(\"%d,\", dst, size, append) % ch_;\r\n\t\t\tvalue_convert(max_, dst, size);\r\n\t\t\tutils::sformat(\",\", dst, size, true);\r\n\t\t\tvalue_convert(min_, dst, size);\r\n\t\t\tutils::sformat(\",\", dst, size, true);\r\n\t\t\tvalue_convert(average_, dst, size);\r\n\t\t\tutils::sformat(\",\", dst, size, true);\r\n\t\t\tvalue_convert(median_, dst, size);\r\n\t\t\tutils::sformat(\",%u\", dst, size, true) % count;\r\n\t\t}\r\n\t};\r\n\r\n\r\n\t\/\/+++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++\/\/\r\n\t\/*!\r\n\t\t@brief サンプル・データ\r\n\t*\/\r\n\t\/\/+++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++\/\/\r\n\tstruct sample_data {\r\n\t\ttime_t\t\ttime_;\r\n\t\tsample_t\tsmp_[8];\r\n\t};\r\n\t\/\/ sample_data FIFO (sizeof 32[sec])\r\n\ttypedef utils::fixed_fifo<sample_data, 32> EADC_FIFO;\r\n\r\n\r\n\t\/\/+++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++\/\/\r\n\t\/*!\r\n\t\t@brief サンプリング・クラス\r\n\t*\/\r\n\t\/\/+++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++\/\/\r\n\tclass sample {\r\n\r\n\t\tsample_t\tt_;\r\n\r\n\t\tuint32_t\tsum_;\r\n\t\tuint32_t\tcount_;\r\n\r\n\t\ttypedef utils::fixed_map<uint16_t, uint16_t, 1000> MAP;\r\n\t\tMAP\t\t\tmap_;\r\n\r\n#if 0\r\n\t\tuint32_t\ttrav_sum_;\r\n\t\tuint32_t\ttrav_med_;\r\n\t\tbool\t\texit_trav_;\r\n\r\n\t\tvoid in_trav_(uint16_t idx)\r\n\t\t{\r\n\t\t\tif(exit_trav_) return;\r\n\r\n\t\t\tif(map_.get_left(idx) != -1) {\r\n\t\t\t\tin_trav_(map_.get_left(idx));\r\n\t\t\t}\r\n\r\n\t\t\tuint32_t cnt = map_.get_pad(idx);\r\n\t\t\ttrav_sum_ += cnt;\r\n\t\t\tif(trav_sum_ >= (count_ \/ 2)) {\r\n\t\t\t\ttrav_med_ = map_.get_key(idx);\r\n\t\t\t\tif((count_ & 1) == 0) {\r\n\t\t\t\t\t++idx;\r\n\t\t\t\t\tif(idx == 1000) { \/\/ 要素数が１個の場合は、平均しない\r\n\t\t\t\t\t\texit_trav_ = true;\r\n\t\t\t\t\t\treturn;\r\n\t\t\t\t\t}\r\n\t\t\t\t\ttrav_med_ += static_cast<uint32_t>(map_.get_key(idx));\r\n\t\t\t\t\ttrav_med_ \/= 2;\r\n\t\t\t\t}\r\n\t\t\t\texit_trav_ = true;\r\n\t\t\t\treturn;\r\n\t\t\t}\r\n\r\n\t\t\tif(map_.get_right(idx) != -1) {\r\n\t\t\t\tin_trav_(map_.get_right(idx));\r\n\t\t\t}\r\n\t\t}\r\n#endif\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\tsample() : t_(), sum_(0), count_(0), map_() { }\r\n\/\/\/\t\t\ttrav_sum_(0), trav_med_(0), exit_trav_(true) { }\r\n\r\n\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\tvoid clear()\r\n\t\t{\r\n\t\t\tsum_ = 0;\r\n\t\t\tcount_ = 0;\r\n\r\n\t\t\tt_.min_ = 65535;\r\n\t\t\tt_.max_ = 0;\r\n\t\t\tt_.average_ = 0;\r\n\t\t\tt_.median_ = 0;\r\n\t\t\tt_.limit_lo_count_ = 0;\r\n\t\t\tt_.limit_hi_count_ = 0;\r\n\r\n\t\t\tmap_.clear();\r\n\t\t}\r\n\r\n\r\n\t\t\/\/-----------------------------------------------------------------\/\/\r\n\t\t\/*!\r\n\t\t\t@brief 追加\r\n\t\t\t@param[in]\tdata\tデータ\r\n\t\t*\/\r\n\t\t\/\/-----------------------------------------------------------------\/\/\r\n\t\tvoid add(uint16_t data)\r\n\t\t{\r\n\t\t\tif(t_.mode_ == sample_t::mode::abs) {\r\n\t\t\t\tif(data >= t_.center_) data -= t_.center_;\r\n\t\t\t\telse data = t_.center_ - data;\r\n\t\t\t}\r\n\r\n\t\t\tsum_ += data;\r\n\t\t\tif(t_.min_ > data) t_.min_ = data;\r\n\t\t\tif(t_.max_ < data) t_.max_ = data;\r\n\r\n\t\t\tif(t_.limit_hi_level_ < data) ++t_.limit_hi_count_;\r\n\t\t\tif(t_.limit_lo_level_ > data) ++t_.limit_lo_count_;\r\n#ifdef MEDIAN\r\n\t\t\tmap_.insert(data, 1);\r\n#endif\r\n\t\t\t++count_;\r\n\t\t}\r\n\r\n\r\n\t\t\/\/-----------------------------------------------------------------\/\/\r\n\t\t\/*!\r\n\t\t\t@brief 主に median の計算\r\n\t\t*\/\r\n\t\t\/\/-----------------------------------------------------------------\/\/\r\n\t\tvoid collect()\r\n\t\t{\r\n#if 0\r\n\t\t\ttrav_med_ = 0;\r\n\t\t\ttrav_sum_ = 0;\r\n\t\t\texit_trav_ = false;\r\n\r\n\t\t\tt_.median_ = trav_med_;\r\n\t\t\tt_.average_ = trav_sum_ \/ count_;\r\n#endif\r\n\r\n#ifdef MEDIAN\r\n\t\t\tuint32_t med = 0;\r\n\t\t\tuint32_t sum = 0;\r\n\t\t\tuint32_t i = 0;\r\n\t\t\twhile(i < 1000) {\r\n\t\t\t\tuint32_t cnt = map_.get_pad(i);\r\n\t\t\t\tsum += cnt;\r\n\t\t\t\tif(sum >= (count_ \/ 2)) {\r\n\t\t\t\t\tmed = map_.get_key(i);\r\n\t\t\t\t\tif((count_ & 1) == 0) {\r\n\t\t\t\t\t\t++i;\r\n\t\t\t\t\t\tif(i >= map_.size()) { \/\/ 要素数が１個の場合は、平均しない\r\n\t\t\t\t\t\t\tbreak;\r\n\t\t\t\t\t\t}\r\n\t\t\t\t\t\tmed += static_cast<uint32_t>(map_.get_key(i));\r\n\t\t\t\t\t\tmed \/= 2;\r\n\t\t\t\t\t}\r\n\t\t\t\t\tbreak;\r\n\t\t\t\t}\r\n\t\t\t\t++i;\r\n\t\t\t}\r\n\t\t\tt_.median_ = med;\r\n#else\r\n\t\t\tt_.median_ = (static_cast<uint32_t>(t_.min_) + static_cast<uint32_t>(t_.max_)) \/ 2;\r\n#endif\r\n\t\t\tt_.average_ = sum_ \/ count_;\r\n\t\t}\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 sample_t& get() const { return t_; }\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\tsample_t& at() { return t_; }\r\n\t};\r\n}\r\n<|endoftext|>"} {"text":"<commit_before>#include <iostream>\n\n#include <SDL2\/SDL.h>\n\n#include <GL\/glew.h>\n#include <GL\/glu.h>\n#include <SDL2\/SDL_opengl.h>\n\n#include <glm\/glm.hpp>\n#include <glm\/gtc\/matrix_transform.hpp>\n\n#include \"Cube.h\"\n#include \"Origin.h\"\n#include \"Shader.h\"\n#include \"ShaderManager.h\"\n\nusing namespace std;\n\nconst float STEP = 0.01f;\n\nfloat window_width = 640.0f;\nfloat window_height = 480.0f;\n\nint main(int argc, char** argv) {\n int result = SDL_Init(SDL_INIT_VIDEO);\n if (result != 0) {\n cerr << \"Could not initialize SDL: \" << SDL_GetError() << endl;\n return 1;\n }\n\n SDL_Window* window = SDL_CreateWindow(argv[0], 0, 0, (int)window_width,\n (int)window_height,\n SDL_WINDOW_SHOWN | SDL_WINDOW_OPENGL);\n if (window == nullptr) {\n cerr << \"Could not create window: \" << SDL_GetError() << endl;\n return 2;\n }\n\n SDL_GL_SetAttribute( SDL_GL_CONTEXT_MAJOR_VERSION, 3 );\n SDL_GL_SetAttribute( SDL_GL_CONTEXT_MINOR_VERSION, 1 );\n SDL_GL_SetAttribute( SDL_GL_CONTEXT_PROFILE_MASK, SDL_GL_CONTEXT_PROFILE_CORE );\n\n SDL_GLContext gl_context = SDL_GL_CreateContext(window);\n if (gl_context == nullptr) {\n cerr << \"Could not create OpenGL context: \" << SDL_GetError() << endl;\n return 3;\n }\n\n glewExperimental = GL_TRUE;\n GLenum glewError = glewInit();\n if (glewError != GLEW_OK) {\n cerr << \"Could not initialize GLEW: \" << glewGetErrorString(glewError) << endl;\n return 4;\n }\n\n glEnable(GL_DEPTH);\n glEnable(GL_VERTEX_ARRAY);\n glEnable(GL_DEPTH_TEST);\n glDisable(GL_CULL_FACE);\n\n glMatrixMode(GL_PROJECTION);\n glLoadIdentity();\n glMatrixMode(GL_MODELVIEW);\n glLoadIdentity();\n glClearColor(0.0f, 0.0f, 0.0f, 0.0f);\n\n auto shaders = ShaderManager();\n\n auto shader_transform = shaders.get(\"transform\");\n shader_transform->apply();\n auto cube = Cube();\n\n auto shader_colour = shaders.get(\"colour\");\n shader_colour->apply();\n auto origin = Origin();\n\n auto eye = glm::vec3(0, 0, 5.0f);\n auto at = glm::vec3(0, 0, 0);\n auto up = glm::vec3(0, 1, 0);\n auto view = glm::lookAt(eye, at, up);\n shaders.updateViewMatrices(view);\n\n auto proj = glm::perspective(45.f, window_width \/ window_height, 0.1f,\n -100.f);\n shaders.updateProjectionMatrices(proj);\n\n float angle = 0.0f;\n bool done = false;\n SDL_Event event;\n while (done == false) {\n while (SDL_PollEvent(&event) != 0) {\n if (event.type == SDL_QUIT) {\n done = true;\n } else if (event.type == SDL_KEYDOWN) {\n switch (event.key.keysym.sym) {\n case SDLK_ESCAPE:\n cout << \"[INFO] Exiting normally at user request.\" << endl;\n done = true;\n break;\n default:\n break;\n }\n }\n }\n\n glm::vec3 direction = STEP * glm::normalize(at - eye);\n glm::vec3 right = STEP * glm::normalize(glm::cross(direction, up));\n\n auto keys = SDL_GetKeyboardState(nullptr);\n if (keys[SDL_SCANCODE_W]) {\n eye += direction;\n at += direction;\n }\n if (keys[SDL_SCANCODE_S]) {\n eye -= direction;\n at -= direction;\n }\n if (keys[SDL_SCANCODE_D]) {\n eye += right;\n at += right;\n }\n if (keys[SDL_SCANCODE_A]) {\n eye -= right;\n at -= right;\n }\n if (keys[SDL_SCANCODE_SPACE]) {\n eye += STEP * up;\n at += STEP * up;\n }\n if (keys[SDL_SCANCODE_LCTRL]) {\n eye -= STEP * up;\n at -= STEP * up;\n }\n auto view = glm::lookAt(eye, at, up);\n shaders.updateViewMatrices(view);\n\n glClear(GL_COLOR_BUFFER_BIT | GL_DEPTH_BUFFER_BIT);\n\n shader_colour->apply();\n auto scale = glm::mat4();\n scale = glm::scale(scale, glm::vec3(5.f, 5.f, 5.f));\n shader_colour->updateWorldMatrix(scale);\n origin.draw();\n\n shader_transform->apply();\n auto modelQuat = glm::quat();\n modelQuat = glm::rotate(modelQuat, angle, glm::vec3(0, 1, 0));\n auto modelMat = (glm::mat4)modelQuat;\n shader_transform->updateWorldMatrix((glm::mat4)modelMat);\n cube.draw();\n\n glFlush();\n SDL_GL_SwapWindow(window);\n\n angle += 0.01f;\n }\n\n SDL_DestroyWindow(window);\n SDL_Quit();\n\n return 0;\n}<commit_msg>Mouse look.<commit_after>#include <iostream>\n\n#include <SDL2\/SDL.h>\n\n#include <GL\/glew.h>\n#include <GL\/glu.h>\n#include <SDL2\/SDL_opengl.h>\n\n#include <glm\/glm.hpp>\n#include <glm\/gtc\/matrix_transform.hpp>\n\n#include \"Cube.h\"\n#include \"Origin.h\"\n#include \"Shader.h\"\n#include \"ShaderManager.h\"\n\nusing namespace std;\nusing glm::vec3;\nusing glm::vec4;\n\nconst float STEP = 0.1f;\nconst float ANGLE_DELTA = 3.14f;\n\nfloat window_width = 640.0f;\nfloat window_height = 480.0f;\n\nint main(int argc, char** argv) {\n int result = SDL_Init(SDL_INIT_VIDEO);\n if (result != 0) {\n cerr << \"Could not initialize SDL: \" << SDL_GetError() << endl;\n return 1;\n }\n\n SDL_Window* window = SDL_CreateWindow(argv[0], 0, 0, (int)window_width,\n (int)window_height,\n SDL_WINDOW_SHOWN | SDL_WINDOW_OPENGL);\n if (window == nullptr) {\n cerr << \"Could not create window: \" << SDL_GetError() << endl;\n return 2;\n }\n\n SDL_ShowCursor(SDL_DISABLE);\n SDL_SetRelativeMouseMode(SDL_TRUE);\n\n SDL_GL_SetAttribute( SDL_GL_CONTEXT_MAJOR_VERSION, 3 );\n SDL_GL_SetAttribute( SDL_GL_CONTEXT_MINOR_VERSION, 1 );\n SDL_GL_SetAttribute( SDL_GL_CONTEXT_PROFILE_MASK, SDL_GL_CONTEXT_PROFILE_CORE );\n\n SDL_GLContext gl_context = SDL_GL_CreateContext(window);\n if (gl_context == nullptr) {\n cerr << \"Could not create OpenGL context: \" << SDL_GetError() << endl;\n return 3;\n }\n\n glewExperimental = GL_TRUE;\n GLenum glewError = glewInit();\n if (glewError != GLEW_OK) {\n cerr << \"Could not initialize GLEW: \" << glewGetErrorString(glewError) << endl;\n return 4;\n }\n\n glEnable(GL_DEPTH);\n glEnable(GL_VERTEX_ARRAY);\n glEnable(GL_DEPTH_TEST);\n glDisable(GL_CULL_FACE);\n\n glMatrixMode(GL_PROJECTION);\n glLoadIdentity();\n glMatrixMode(GL_MODELVIEW);\n glLoadIdentity();\n glClearColor(0.0f, 0.0f, 0.0f, 0.0f);\n\n auto shaders = ShaderManager();\n\n auto shader_transform = shaders.get(\"transform\");\n shader_transform->apply();\n auto cube = Cube();\n\n auto shader_colour = shaders.get(\"colour\");\n shader_colour->apply();\n auto origin = Origin();\n\n auto eye = glm::vec3(0, 0, 5.0f);\n auto at = glm::vec3(0, 0, 0);\n auto up = glm::vec3(0, 1, 0);\n auto view = glm::lookAt(eye, at, up);\n shaders.updateViewMatrices(view);\n\n auto proj = glm::perspective(45.f, window_width \/ window_height, 0.1f,\n -100.f);\n shaders.updateProjectionMatrices(proj);\n\n float angle = 0.0f;\n bool done = false;\n SDL_Event event;\n while (done == false) {\n while (SDL_PollEvent(&event) != 0) {\n if (event.type == SDL_QUIT) {\n done = true;\n } else if (event.type == SDL_KEYDOWN) {\n switch (event.key.keysym.sym) {\n case SDLK_ESCAPE:\n cout << \"[INFO] Exiting normally at user request.\" << endl;\n done = true;\n break;\n default:\n break;\n }\n } else if (event.type == SDL_MOUSEMOTION) {\n cout << event.motion.xrel << \" \" << event.motion.yrel << endl;\n\n const GLfloat X_SCALED = -(GLfloat)event.motion.xrel \/ window_width;\n const GLfloat Y_SCALED = -(GLfloat)event.motion.yrel \/ window_height;\n\n const GLfloat LEFT_RIGHT_ROT = X_SCALED * ANGLE_DELTA;\n const GLfloat UP_DOWN_ROT = Y_SCALED * ANGLE_DELTA;\n\n vec3 tempD(at - eye);\n vec4 d(tempD.x, tempD.y, tempD.z, 0.0f);\n\n vec3 right = cross(tempD, up);\n\n mat4 rot;\n rot = rotate(rot, UP_DOWN_ROT, right);\n rot = rotate(rot, LEFT_RIGHT_ROT, up);\n\n d = rot * d;\n\n at.x = eye.x + d.x;\n at.y = eye.y + d.y;\n at.z = eye.z + d.z;\n\n }\n }\n\n glm::vec3 direction = STEP * glm::normalize(at - eye);\n glm::vec3 right = STEP * glm::normalize(glm::cross(direction, up));\n\n auto keys = SDL_GetKeyboardState(nullptr);\n if (keys[SDL_SCANCODE_W]) {\n eye += direction;\n at += direction;\n }\n if (keys[SDL_SCANCODE_S]) {\n eye -= direction;\n at -= direction;\n }\n if (keys[SDL_SCANCODE_D]) {\n eye += right;\n at += right;\n }\n if (keys[SDL_SCANCODE_A]) {\n eye -= right;\n at -= right;\n }\n if (keys[SDL_SCANCODE_SPACE]) {\n eye += STEP * up;\n at += STEP * up;\n }\n if (keys[SDL_SCANCODE_LCTRL]) {\n eye -= STEP * up;\n at -= STEP * up;\n }\n auto view = glm::lookAt(eye, at, up);\n shaders.updateViewMatrices(view);\n\n glClear(GL_COLOR_BUFFER_BIT | GL_DEPTH_BUFFER_BIT);\n\n shader_colour->apply();\n auto scale = glm::mat4();\n scale = glm::scale(scale, glm::vec3(5.f, 5.f, 5.f));\n shader_colour->updateWorldMatrix(scale);\n origin.draw();\n\n shader_transform->apply();\n auto modelQuat = glm::quat();\n modelQuat = glm::rotate(modelQuat, angle, glm::vec3(0, 1, 0));\n auto modelMat = (glm::mat4)modelQuat;\n shader_transform->updateWorldMatrix((glm::mat4)modelMat);\n cube.draw();\n\n glFlush();\n SDL_GL_SwapWindow(window);\n\n angle += 0.01f;\n }\n\n SDL_DestroyWindow(window);\n SDL_Quit();\n\n return 0;\n}<|endoftext|>"} {"text":"<commit_before>\/*\n\n Copyright (C) 2003-2008 Grame\n Grame Research Laboratory, 9 rue du Garet, 69001 Lyon - France\n research@grame.fr\n\n This file is provided as an example of the MusicXML Library use.\n*\/\n\n#ifdef VC6\n# pragma warning (disable : 4786)\n#endif\n\n#include <stdlib.h>\n#include <string.h>\n#ifndef WIN32\n#include <signal.h>\n#include <string.h>\n#endif\n\n#include \"musicxml2guido.h\"\n\nusing namespace std;\nusing namespace MusicXML2;\n\nstatic void usage() {\n\tcerr << \"usage: musicxml2guido [options] <musicxml file>\" << endl;\n\tcerr << \" reads stdin when <musicxml file> is '-'\" << endl;\n\tcerr << \" option: --autobars don't generates barlines\" << endl;\n\texit(1);\n}\n\n#ifndef WIN32\n\nstatic void _sigaction(int signal, siginfo_t *si, void *arg)\n{\n cerr << \"Signal #\" << signal << \" catched!\" << endl;\n exit(-2);\n}\n\nstatic void catchsigs()\n{\n\tstruct sigaction sa;\n\n memset(&sa, 0, sizeof(struct sigaction));\n sigemptyset(&sa.sa_mask);\n sa.sa_sigaction = _sigaction;\n sa.sa_flags = SA_SIGINFO;\n sigaction(SIGSEGV, &sa, NULL);\n sigaction(SIGILL, &sa, NULL);\n sigaction(SIGFPE, &sa, NULL);\n}\n\n#else\nstatic void catchsigs()\t{}\n#endif\n\n\/\/_______________________________________________________________________________\nint main(int argc, char *argv[]) \n{\n\tcatchsigs();\n\n\tbool generateBars = true;\n\tchar * file = argv[1];\n\tif (argc == 3) {\n\t\tif (!strcmp(argv[1], \"--autobars\")) {\n\t\t\tgenerateBars = false;\n\t\t\tfile = argv[2];\n\t\t}\n\t\telse usage();\n\t}\n\telse if (argc != 2) usage();\n\n\txmlErr err = kNoErr;\n\tif (!strcmp(file, \"-\"))\n\t\terr = musicxmlfd2guido(stdin, generateBars, cout);\n\telse\n\t\terr = musicxmlfile2guido(file, generateBars, cout);\n\tif (err) {\n\t\tcout << \"conversion failed\" << endl;\n\t\treturn -1;\n\t}\n\treturn 0;\n}\n<commit_msg>exit without error for unsupported formats (time-wise)<commit_after>\/*\n\n Copyright (C) 2003-2008 Grame\n Grame Research Laboratory, 9 rue du Garet, 69001 Lyon - France\n research@grame.fr\n\n This file is provided as an example of the MusicXML Library use.\n*\/\n\n#ifdef VC6\n# pragma warning (disable : 4786)\n#endif\n\n#include <stdlib.h>\n#include <string.h>\n#ifndef WIN32\n#include <signal.h>\n#include <string.h>\n#endif\n\n#include \"libmusicxml.h\"\n\nusing namespace std;\nusing namespace MusicXML2;\n\nstatic void usage() {\n\tcerr << \"usage: musicxml2guido [options] <musicxml file>\" << endl;\n\tcerr << \" reads stdin when <musicxml file> is '-'\" << endl;\n\tcerr << \" option: --autobars don't generates barlines\" << endl;\n\texit(1);\n}\n\n#ifndef WIN32\n\nstatic void _sigaction(int signal, siginfo_t *si, void *arg)\n{\n cerr << \"Signal #\" << signal << \" catched!\" << endl;\n exit(-2);\n}\n\nstatic void catchsigs()\n{\n\tstruct sigaction sa;\n\n memset(&sa, 0, sizeof(struct sigaction));\n sigemptyset(&sa.sa_mask);\n sa.sa_sigaction = _sigaction;\n sa.sa_flags = SA_SIGINFO;\n sigaction(SIGSEGV, &sa, NULL);\n sigaction(SIGILL, &sa, NULL);\n sigaction(SIGFPE, &sa, NULL);\n}\n\n#else\nstatic void catchsigs()\t{}\n#endif\n\n\/\/_______________________________________________________________________________\nint main(int argc, char *argv[]) \n{\n\tcatchsigs();\n\n\tbool generateBars = true;\n\tchar * file = argv[1];\n\tif (argc == 3) {\n\t\tif (!strcmp(argv[1], \"--autobars\")) {\n\t\t\tgenerateBars = false;\n\t\t\tfile = argv[2];\n\t\t}\n\t\telse usage();\n\t}\n\telse if (argc != 2) usage();\n\n\txmlErr err = kNoErr;\n\tif (!strcmp(file, \"-\"))\n\t\terr = musicxmlfd2guido(stdin, generateBars, cout);\n\telse\n\t\terr = musicxmlfile2guido(file, generateBars, cout);\n\tif (err == kUnsupported)\n\t\tcerr << \"unsupported xml format\" << endl;\n\telse if (err == kUnsupported) {\n\t\tcerr << \"conversion failed\" << endl;\n\t\treturn -1;\n\t}\n\treturn 0;\n}\n<|endoftext|>"} {"text":"<commit_before>\/*\n\n Copyright (C) 2003-2008 Grame\n Grame Research Laboratory, 9 rue du Garet, 69001 Lyon - France\n research@grame.fr\n\n This file is provided as an example of the MusicXML Library use.\n*\/\n\n#ifdef VC6\n# pragma warning (disable : 4786)\n#endif\n\n#include <string>\n\n#include <stdlib.h>\n#include <string.h>\n#ifndef WIN32\n#include <signal.h>\n#endif\n\n#include \"libmusicxml.h\"\n\nusing namespace std;\nusing namespace MusicXML2;\n\nstatic void usage() {\n\tcerr << \"usage: xml2guido [options] <musicxml file>\" << endl;\n\tcerr << \" reads stdin when <musicxml file> is '-'\" << endl;\n\tcerr << \" option: --autobars don't generates barlines\" << endl;\n\tcerr << \" option: --version print version and exit\" << endl;\n\texit(1);\n}\n\n#ifndef WIN32\n\nstatic void _sigaction(int signal, siginfo_t *si, void *arg)\n{\n cerr << \"Signal #\" << signal << \" catched!\" << endl;\n exit(-2);\n}\n\nstatic void catchsigs()\n{\n\tstruct sigaction sa;\n\n memset(&sa, 0, sizeof(struct sigaction));\n sigemptyset(&sa.sa_mask);\n sa.sa_sigaction = _sigaction;\n sa.sa_flags = SA_SIGINFO;\n sigaction(SIGSEGV, &sa, NULL);\n sigaction(SIGILL, &sa, NULL);\n sigaction(SIGFPE, &sa, NULL);\n}\n\n#else\nstatic void catchsigs()\t{}\n#endif\n\n\/\/_______________________________________________________________________________\nstatic bool checkOpt(int argc, char *argv[], const string& option)\n{\n\tfor (int i=1; i<argc;i++) {\n\t\tif (option == argv[i]) return true;\n\t}\n\treturn false;\n}\n\n\/\/_______________________________________________________________________________\nstatic void versionInfo()\n{\n\tcout << \"xml2guido version \" << musicxml2guidoVersionStr() << endl;\n\tcout << \"Using libmusicxml version \" << musicxmllibVersionStr() << endl;\n\texit (0);\n}\n\n\/\/_______________________________________________________________________________\nint main(int argc, char *argv[])\n{\n\tcatchsigs();\n\n\tbool version = checkOpt (argc, argv, \"--version\");\n\tif (version) versionInfo();\n\n\tif (argc < 2) usage();\n\n\tbool generateBars = checkOpt (argc, argv, \"--autobars\");\n\tchar * file = argv[argc-1];\n\n\txmlErr err = kNoErr;\n\tif (!strcmp(file, \"-\"))\n\t\terr = musicxmlfd2guido(stdin, generateBars, cout);\n\telse\n\t\terr = musicxmlfile2guido(file, generateBars, cout);\n\tif (err == kUnsupported)\n\t\tcerr << \"unsupported xml format\" << endl;\n\telse if (err == kUnsupported) {\n\t\tcerr << \"conversion failed\" << endl;\n\t\treturn -1;\n\t}\n\treturn 0;\n}\n<commit_msg>-v option added<commit_after>\/*\n\n Copyright (C) 2003-2008 Grame\n Grame Research Laboratory, 9 rue du Garet, 69001 Lyon - France\n research@grame.fr\n\n This file is provided as an example of the MusicXML Library use.\n*\/\n\n#ifdef VC6\n# pragma warning (disable : 4786)\n#endif\n\n#include <string>\n\n#include <stdlib.h>\n#include <string.h>\n#ifndef WIN32\n#include <signal.h>\n#endif\n\n#include \"libmusicxml.h\"\n\nusing namespace std;\nusing namespace MusicXML2;\n\nstatic void usage() {\n\tcerr << \"usage: xml2guido [options] <musicxml file>\" << endl;\n\tcerr << \" reads stdin when <musicxml file> is '-'\" << endl;\n\tcerr << \" option: --autobars don't generates barlines\" << endl;\n\tcerr << \" option: --version print version and exit\" << endl;\n\texit(1);\n}\n\n#ifndef WIN32\n\nstatic void _sigaction(int signal, siginfo_t *si, void *arg)\n{\n cerr << \"Signal #\" << signal << \" catched!\" << endl;\n exit(-2);\n}\n\nstatic void catchsigs()\n{\n\tstruct sigaction sa;\n\n memset(&sa, 0, sizeof(struct sigaction));\n sigemptyset(&sa.sa_mask);\n sa.sa_sigaction = _sigaction;\n sa.sa_flags = SA_SIGINFO;\n sigaction(SIGSEGV, &sa, NULL);\n sigaction(SIGILL, &sa, NULL);\n sigaction(SIGFPE, &sa, NULL);\n}\n\n#else\nstatic void catchsigs()\t{}\n#endif\n\n\/\/_______________________________________________________________________________\nstatic bool checkOpt(int argc, char *argv[], const string& option)\n{\n\tfor (int i=1; i<argc;i++) {\n\t\tif (option == argv[i]) return true;\n\t}\n\treturn false;\n}\n\n\/\/_______________________________________________________________________________\nstatic void versionInfo()\n{\n\tcout << \"xml2guido version \" << musicxml2guidoVersionStr() << endl;\n\tcout << \"Using libmusicxml version \" << musicxmllibVersionStr() << endl;\n\texit (0);\n}\n\n\/\/_______________________________________________________________________________\nint main(int argc, char *argv[])\n{\n\tcatchsigs();\n\n\tbool version = checkOpt (argc, argv, \"--version\") || checkOpt (argc, argv, \"-v\");\n\tif (version) versionInfo();\n\n\tif (argc < 2) usage();\n\n\tbool generateBars = checkOpt (argc, argv, \"--autobars\");\n\tchar * file = argv[argc-1];\n\n\txmlErr err = kNoErr;\n\tif (!strcmp(file, \"-\"))\n\t\terr = musicxmlfd2guido(stdin, generateBars, cout);\n\telse\n\t\terr = musicxmlfile2guido(file, generateBars, cout);\n\tif (err == kUnsupported)\n\t\tcerr << \"unsupported xml format\" << endl;\n\telse if (err == kUnsupported) {\n\t\tcerr << \"conversion failed\" << endl;\n\t\treturn -1;\n\t}\n\treturn 0;\n}\n<|endoftext|>"} {"text":"<commit_before>\/*\n * Copyright (C) 2008, 2009 Nokia Corporation.\n *\n * Contact: Marius Vollmer <marius.vollmer@nokia.com>\n *\n * This library is free software; you can redistribute it and\/or\n * modify it under the terms of the GNU Lesser General Public License\n * version 2.1 as published by the Free Software Foundation.\n *\n * This library is distributed in the hope that it will be useful, but\n * WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU\n * Lesser General Public License for more details.\n *\n * You should have received a copy of the GNU Lesser General Public\n * License along with this library; if not, write to the Free Software\n * Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA\n * 02110-1301 USA\n *\n *\/\n\n#include <QtTest\/QtTest>\n#include <QtCore>\n#include \"fileutils.h\"\n#include \"infocdbbackend.h\"\n#include \"cdbwriter.h\"\n\nclass InfoCdbBackendUnitTest : public QObject\n{\n Q_OBJECT\n InfoCdbBackend *backend;\n\nprivate:\n void createBaseDatabase(QString path);\n void createAlternateDatabase(QString path);\n\nprivate slots:\n void initTestCase();\n void databaseExists();\n void databaseDirectory();\n void listKeys();\n void typeForKey();\n void docForKey();\n void keyDeclared();\n void keyProvided();\n void listProviders();\n void dynamics();\n void removed();\n void cleanupTestCase();\n};\n\nvoid InfoCdbBackendUnitTest::createBaseDatabase(QString path)\n{\n CDBWriter writer(path);\n\n if (! writer.isWritable())\n qFatal(\"Failed to open %s for reading!\", path.toLocal8Bit().data());\n\n writer.add(\"KEYS\", \"Battery.Charging\");\n writer.add(\"KEYS\", \"Internet.BytesOut\");\n writer.add(\"PLUGINS\", \"contextkit-dbus\");\n writer.add(\"contextkit-dbus:KEYS\", \"Battery.Charging\");\n writer.add(\"contextkit-dbus:KEYS\", \"Internet.BytesOut\");\n writer.add(\"Battery.Charging:KEYTYPE\", \"TRUTH\");\n writer.add(\"Internet.BytesOut:KEYTYPE\", \"INTEGER\");\n writer.add(\"Battery.Charging:KEYDOC\", \"doc1\");\n writer.add(\"Internet.BytesOut:KEYPLUGIN\", \"contextkit-dbus\");\n writer.add(\"Battery.Charging:KEYPLUGIN\", \"contextkit-dbus\");\n writer.add(\"Battery.Charging:KEYCONSTRUCTIONSTRING\", \"system:org.freedesktop.ContextKit.contextd1\");\n writer.add(\"Internet.BytesOut:KEYCONSTRUCTIONSTRING\", \"session:org.freedesktop.ContextKit.contextd2\");\n\n QVariantList providers1;\n QHash <QString, QVariant> provider1;\n provider1.insert(\"plugin\", \"contextkit-dbus\");\n provider1.insert(\"constructionString\", \"system:org.freedesktop.ContextKit.contextd1\");\n providers1 << QVariant(provider1);\n writer.add(\"Battery.Charging:PROVIDERS\", QVariant(providers1));\n\n QVariantList providers2;\n QHash <QString, QVariant> provider2;\n provider2.insert(\"plugin\", \"contextkit-dbus\");\n provider2.insert(\"constructionString\", \"session:org.freedesktop.ContextKit.contextd2\");\n providers2 << QVariant(provider2);\n writer.add(\"Internet.BytesOut:PROVIDERS\", QVariant(providers2));\n\n writer.close();\n}\n\nvoid InfoCdbBackendUnitTest::createAlternateDatabase(QString path)\n{\n CDBWriter writer(path);\n\n if (! writer.isWritable())\n qFatal(\"Failed to open %s for reading!\", path.toLocal8Bit().data());\n\n writer.add(\"KEYS\", \"Battery.Charging\");\n writer.add(\"KEYS\", \"Battery.Capacity\");\n writer.add(\"PLUGINS\", \"contextkit-dbus\");\n writer.add(\"contextkit-dbus:KEYS\", \"Battery.Charging\");\n writer.add(\"contextkit-dbus:KEYS\", \"Battery.Capacity\");\n writer.add(\"Battery.Charging:KEYTYPE\", \"INTEGER\");\n writer.add(\"Battery.Charging:KEYDOC\", \"doc1\");\n writer.add(\"Battery.Charging:KEYPLUGIN\", \"contextkit-dbus\");\n writer.add(\"Battery.Charging:KEYCONSTRUCTIONSTRING\", \"system:org.freedesktop.ContextKit.contextd1\");\n writer.add(\"Battery.Capacity:KEYTYPE\", \"INTEGER\");\n writer.add(\"Battery.Capacity:KEYDOC\", \"doc3\");\n writer.add(\"Battery.Capacity:KEYPLUGIN\", \"contextkit-dbus\");\n writer.add(\"Battery.Capacity:KEYCONSTRUCTIONSTRING\", \"system:org.freedesktop.ContextKit.contextd1\");\n\n QVariantList providers1;\n QHash <QString, QVariant> provider1;\n provider1.insert(\"plugin\", \"contextkit-dbus\");\n provider1.insert(\"constructionString\", \"system:org.freedesktop.ContextKit.contextd1\");\n providers1 << QVariant(provider1);\n writer.add(\"Battery.Charging:PROVIDERS\", QVariant(providers1));\n\n QVariantList providers2;\n QHash <QString, QVariant> provider2;\n provider2.insert(\"plugin\", \"contextkit-dbus\");\n provider2.insert(\"constructionString\", \"system:org.freedesktop.ContextKit.contextd1\");\n providers2 << QVariant(provider2);\n writer.add(\"Battery.Capacity:PROVIDERS\", providers2);\n\n writer.close();\n}\n\nvoid InfoCdbBackendUnitTest::initTestCase()\n{\n createBaseDatabase(\"cache.cdb\");\n\n utilSetEnv(\"CONTEXT_PROVIDERS\", \".\/\");\n utilSetEnv(\"CONTEXT_CORE_DECLARATIONS\", \"\/dev\/null\");\n backend = new InfoCdbBackend();\n}\n\nvoid InfoCdbBackendUnitTest::databaseDirectory()\n{\n QCOMPARE(backend->databaseDirectory(), QString(\".\/\"));\n}\n\nvoid InfoCdbBackendUnitTest::databaseExists()\n{\n QCOMPARE(backend->databaseExists(), true);\n}\n\nvoid InfoCdbBackendUnitTest::listKeys()\n{\n QStringList keys = backend->listKeys();\n QCOMPARE(keys.count(), 2);\n QVERIFY(keys.contains(\"Battery.Charging\"));\n QVERIFY(keys.contains(\"Internet.BytesOut\"));\n}\n\nvoid InfoCdbBackendUnitTest::typeForKey()\n{\n QCOMPARE(backend->typeForKey(\"Internet.BytesOut\"), QString(\"INTEGER\"));\n QCOMPARE(backend->typeForKey(\"Battery.Charging\"), QString(\"TRUTH\"));\n QCOMPARE(backend->typeForKey(\"Does.Not.Exist\"), QString());\n}\n\nvoid InfoCdbBackendUnitTest::docForKey()\n{\n QCOMPARE(backend->docForKey(\"Internet.BytesOut\"), QString());\n QCOMPARE(backend->docForKey(\"Battery.Charging\"), QString(\"doc1\"));\n QCOMPARE(backend->docForKey(\"Does.Not.Exist\"), QString());\n}\n\nvoid InfoCdbBackendUnitTest::keyDeclared()\n{\n foreach (QString key, backend->listKeys())\n QCOMPARE(backend->keyDeclared(key), true);\n\n QCOMPARE(backend->keyDeclared(\"Does.Not.Exist\"), false);\n QCOMPARE(backend->keyDeclared(\"Battery.Charging\"), true);\n}\n\nvoid InfoCdbBackendUnitTest::keyProvided()\n{\n foreach (QString key, backend->listKeys())\n QVERIFY(backend->keyProvided(key) == true);\n\n QCOMPARE(backend->keyProvided(\"Does.Not.Exist\"), false);\n}\n\nvoid InfoCdbBackendUnitTest::listProviders()\n{\n QList <ContextProviderInfo> list1 = backend->listProviders(\"Battery.Charging\");\n QCOMPARE(list1.count(), 1);\n QCOMPARE(list1.at(0).plugin, QString(\"contextkit-dbus\"));\n QCOMPARE(list1.at(0).constructionString, QString(\"system:org.freedesktop.ContextKit.contextd1\"));\n\n QList <ContextProviderInfo> list2 = backend->listProviders(\"Does.Not.Exist\");\n QCOMPARE(list2.count(), 0);\n}\n\nvoid InfoCdbBackendUnitTest::dynamics()\n{\n backend->connectNotify(\"-\"); \/\/ Fake it. Spy does something fishy here.\n\n \/\/ Setup the spy observers\n QSignalSpy spy1(backend, SIGNAL(keysRemoved(QStringList)));\n QSignalSpy spy2(backend, SIGNAL(keysChanged(QStringList)));\n QSignalSpy spy3(backend, SIGNAL(keyChanged(QString)));\n QSignalSpy spy4(backend, SIGNAL(keysAdded(QStringList)));\n\n createAlternateDatabase(\"cache-next.cdb\");\n QFile::remove(\"cache.cdb\");\n QFile::copy(\"cache-next.cdb\", \"cache.cdb\");\n QTest::qWait(DEFAULT_WAIT_PERIOD);\n\n \/\/ Test the new values\n QCOMPARE(backend->databaseExists(), true);\n QCOMPARE(backend->listKeys().count(), 2);\n QVERIFY(backend->listKeys().contains(\"Battery.Charging\"));\n QVERIFY(backend->listKeys().contains(\"Battery.Capacity\"));\n QCOMPARE(backend->typeForKey(\"Battery.Charging\"), QString(\"INTEGER\"));\n QCOMPARE(backend->docForKey(\"Battery.Charging\"), QString(\"doc1\"));\n QVERIFY(backend->keyProvided(\"Battery.Charging\") == true);\n QVERIFY(backend->keyProvided(\"Internet.BytesOut\") == false);\n\n \/\/ Test emissions\n QCOMPARE(spy1.count(), 1);\n QList<QVariant> args1 = spy1.takeFirst();\n QCOMPARE(args1.at(0).toList().size(), 1);\n QCOMPARE(args1.at(0).toStringList().at(0), QString(\"Internet.BytesOut\"));\n\n QCOMPARE(spy2.count(), 1);\n QList<QVariant> args2 = spy2.takeFirst();\n QCOMPARE(args2.at(0).toList().size(), 2);\n QCOMPARE(args2.at(0).toStringList().at(0), QString(\"Battery.Charging\"));\n QCOMPARE(args2.at(0).toStringList().at(1), QString(\"Battery.Capacity\"));\n\n QCOMPARE(spy3.count(), 3);\n\n QCOMPARE(spy4.count(), 1);\n QList<QVariant> args4 = spy4.takeFirst();\n QCOMPARE(args4.at(0).toList().size(), 1);\n QCOMPARE(args4.at(0).toStringList().at(0), QString(\"Battery.Capacity\"));\n\n backend->disconnectNotify(\"-\"); \/\/ Fake it. Spy does something fishy here.\n}\n\nvoid InfoCdbBackendUnitTest::removed()\n{\n backend->connectNotify(\"-\"); \/\/ Fake it. Spy does something fishy here.\n QSignalSpy spy(backend, SIGNAL(keysRemoved(QStringList)));\n\n QFile::remove(\"cache.cdb\");\n\n QTest::qWait(DEFAULT_WAIT_PERIOD);\n\n \/\/QCOMPARE(spy.count(), 1);\n \/\/QList<QVariant> args = spy.takeFirst();\n \/\/QCOMPARE(args.at(0).toList().size(), 2);\n\n backend->disconnectNotify(\"-\"); \/\/ Fake it. Spy does something fishy here.\n}\n\nvoid InfoCdbBackendUnitTest::cleanupTestCase()\n{\n QFile::remove(\"cache.cdb\");\n QFile::remove(\"cache-next.cdb\");\n}\n\n#include \"infocdbbackendunittest.moc\"\nQTEST_MAIN(InfoCdbBackendUnitTest);\n<commit_msg>Removing redundant stuff now.<commit_after>\/*\n * Copyright (C) 2008, 2009 Nokia Corporation.\n *\n * Contact: Marius Vollmer <marius.vollmer@nokia.com>\n *\n * This library is free software; you can redistribute it and\/or\n * modify it under the terms of the GNU Lesser General Public License\n * version 2.1 as published by the Free Software Foundation.\n *\n * This library is distributed in the hope that it will be useful, but\n * WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU\n * Lesser General Public License for more details.\n *\n * You should have received a copy of the GNU Lesser General Public\n * License along with this library; if not, write to the Free Software\n * Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA\n * 02110-1301 USA\n *\n *\/\n\n#include <QtTest\/QtTest>\n#include <QtCore>\n#include \"fileutils.h\"\n#include \"infocdbbackend.h\"\n#include \"cdbwriter.h\"\n\nclass InfoCdbBackendUnitTest : public QObject\n{\n Q_OBJECT\n InfoCdbBackend *backend;\n\nprivate:\n void createBaseDatabase(QString path);\n void createAlternateDatabase(QString path);\n\nprivate slots:\n void initTestCase();\n void databaseExists();\n void databaseDirectory();\n void listKeys();\n void typeForKey();\n void docForKey();\n void keyDeclared();\n void keyProvided();\n void listProviders();\n void dynamics();\n void removed();\n void cleanupTestCase();\n};\n\nvoid InfoCdbBackendUnitTest::createBaseDatabase(QString path)\n{\n CDBWriter writer(path);\n\n if (! writer.isWritable())\n qFatal(\"Failed to open %s for reading!\", path.toLocal8Bit().data());\n\n writer.add(\"KEYS\", \"Battery.Charging\");\n writer.add(\"KEYS\", \"Internet.BytesOut\");\n writer.add(\"Battery.Charging:KEYTYPE\", \"TRUTH\");\n writer.add(\"Internet.BytesOut:KEYTYPE\", \"INTEGER\");\n writer.add(\"Battery.Charging:KEYDOC\", \"doc1\");\n\n QVariantList providers1;\n QHash <QString, QVariant> provider1;\n provider1.insert(\"plugin\", \"contextkit-dbus\");\n provider1.insert(\"constructionString\", \"system:org.freedesktop.ContextKit.contextd1\");\n providers1 << QVariant(provider1);\n writer.add(\"Battery.Charging:PROVIDERS\", QVariant(providers1));\n\n QVariantList providers2;\n QHash <QString, QVariant> provider2;\n provider2.insert(\"plugin\", \"contextkit-dbus\");\n provider2.insert(\"constructionString\", \"session:org.freedesktop.ContextKit.contextd2\");\n providers2 << QVariant(provider2);\n writer.add(\"Internet.BytesOut:PROVIDERS\", QVariant(providers2));\n\n writer.close();\n}\n\nvoid InfoCdbBackendUnitTest::createAlternateDatabase(QString path)\n{\n CDBWriter writer(path);\n\n if (! writer.isWritable())\n qFatal(\"Failed to open %s for reading!\", path.toLocal8Bit().data());\n\n writer.add(\"KEYS\", \"Battery.Charging\");\n writer.add(\"KEYS\", \"Battery.Capacity\");\n writer.add(\"Battery.Charging:KEYTYPE\", \"INTEGER\");\n writer.add(\"Battery.Charging:KEYDOC\", \"doc1\");\n writer.add(\"Battery.Capacity:KEYTYPE\", \"INTEGER\");\n writer.add(\"Battery.Capacity:KEYDOC\", \"doc3\");\n\n QVariantList providers1;\n QHash <QString, QVariant> provider1;\n provider1.insert(\"plugin\", \"contextkit-dbus\");\n provider1.insert(\"constructionString\", \"system:org.freedesktop.ContextKit.contextd1\");\n providers1 << QVariant(provider1);\n writer.add(\"Battery.Charging:PROVIDERS\", QVariant(providers1));\n\n QVariantList providers2;\n QHash <QString, QVariant> provider2;\n provider2.insert(\"plugin\", \"contextkit-dbus\");\n provider2.insert(\"constructionString\", \"system:org.freedesktop.ContextKit.contextd1\");\n providers2 << QVariant(provider2);\n writer.add(\"Battery.Capacity:PROVIDERS\", providers2);\n\n writer.close();\n}\n\nvoid InfoCdbBackendUnitTest::initTestCase()\n{\n createBaseDatabase(\"cache.cdb\");\n\n utilSetEnv(\"CONTEXT_PROVIDERS\", \".\/\");\n utilSetEnv(\"CONTEXT_CORE_DECLARATIONS\", \"\/dev\/null\");\n backend = new InfoCdbBackend();\n}\n\nvoid InfoCdbBackendUnitTest::databaseDirectory()\n{\n QCOMPARE(backend->databaseDirectory(), QString(\".\/\"));\n}\n\nvoid InfoCdbBackendUnitTest::databaseExists()\n{\n QCOMPARE(backend->databaseExists(), true);\n}\n\nvoid InfoCdbBackendUnitTest::listKeys()\n{\n QStringList keys = backend->listKeys();\n QCOMPARE(keys.count(), 2);\n QVERIFY(keys.contains(\"Battery.Charging\"));\n QVERIFY(keys.contains(\"Internet.BytesOut\"));\n}\n\nvoid InfoCdbBackendUnitTest::typeForKey()\n{\n QCOMPARE(backend->typeForKey(\"Internet.BytesOut\"), QString(\"INTEGER\"));\n QCOMPARE(backend->typeForKey(\"Battery.Charging\"), QString(\"TRUTH\"));\n QCOMPARE(backend->typeForKey(\"Does.Not.Exist\"), QString());\n}\n\nvoid InfoCdbBackendUnitTest::docForKey()\n{\n QCOMPARE(backend->docForKey(\"Internet.BytesOut\"), QString());\n QCOMPARE(backend->docForKey(\"Battery.Charging\"), QString(\"doc1\"));\n QCOMPARE(backend->docForKey(\"Does.Not.Exist\"), QString());\n}\n\nvoid InfoCdbBackendUnitTest::keyDeclared()\n{\n foreach (QString key, backend->listKeys())\n QCOMPARE(backend->keyDeclared(key), true);\n\n QCOMPARE(backend->keyDeclared(\"Does.Not.Exist\"), false);\n QCOMPARE(backend->keyDeclared(\"Battery.Charging\"), true);\n}\n\nvoid InfoCdbBackendUnitTest::keyProvided()\n{\n foreach (QString key, backend->listKeys())\n QVERIFY(backend->keyProvided(key) == true);\n\n QCOMPARE(backend->keyProvided(\"Does.Not.Exist\"), false);\n}\n\nvoid InfoCdbBackendUnitTest::listProviders()\n{\n QList <ContextProviderInfo> list1 = backend->listProviders(\"Battery.Charging\");\n QCOMPARE(list1.count(), 1);\n QCOMPARE(list1.at(0).plugin, QString(\"contextkit-dbus\"));\n QCOMPARE(list1.at(0).constructionString, QString(\"system:org.freedesktop.ContextKit.contextd1\"));\n\n QList <ContextProviderInfo> list2 = backend->listProviders(\"Does.Not.Exist\");\n QCOMPARE(list2.count(), 0);\n}\n\nvoid InfoCdbBackendUnitTest::dynamics()\n{\n backend->connectNotify(\"-\"); \/\/ Fake it. Spy does something fishy here.\n\n \/\/ Setup the spy observers\n QSignalSpy spy1(backend, SIGNAL(keysRemoved(QStringList)));\n QSignalSpy spy2(backend, SIGNAL(keysChanged(QStringList)));\n QSignalSpy spy3(backend, SIGNAL(keyChanged(QString)));\n QSignalSpy spy4(backend, SIGNAL(keysAdded(QStringList)));\n\n createAlternateDatabase(\"cache-next.cdb\");\n QFile::remove(\"cache.cdb\");\n QFile::copy(\"cache-next.cdb\", \"cache.cdb\");\n QTest::qWait(DEFAULT_WAIT_PERIOD);\n\n \/\/ Test the new values\n QCOMPARE(backend->databaseExists(), true);\n QCOMPARE(backend->listKeys().count(), 2);\n QVERIFY(backend->listKeys().contains(\"Battery.Charging\"));\n QVERIFY(backend->listKeys().contains(\"Battery.Capacity\"));\n QCOMPARE(backend->typeForKey(\"Battery.Charging\"), QString(\"INTEGER\"));\n QCOMPARE(backend->docForKey(\"Battery.Charging\"), QString(\"doc1\"));\n QVERIFY(backend->keyProvided(\"Battery.Charging\") == true);\n QVERIFY(backend->keyProvided(\"Internet.BytesOut\") == false);\n\n \/\/ Test emissions\n QCOMPARE(spy1.count(), 1);\n QList<QVariant> args1 = spy1.takeFirst();\n QCOMPARE(args1.at(0).toList().size(), 1);\n QCOMPARE(args1.at(0).toStringList().at(0), QString(\"Internet.BytesOut\"));\n\n QCOMPARE(spy2.count(), 1);\n QList<QVariant> args2 = spy2.takeFirst();\n QCOMPARE(args2.at(0).toList().size(), 2);\n QCOMPARE(args2.at(0).toStringList().at(0), QString(\"Battery.Charging\"));\n QCOMPARE(args2.at(0).toStringList().at(1), QString(\"Battery.Capacity\"));\n\n QCOMPARE(spy3.count(), 3);\n\n QCOMPARE(spy4.count(), 1);\n QList<QVariant> args4 = spy4.takeFirst();\n QCOMPARE(args4.at(0).toList().size(), 1);\n QCOMPARE(args4.at(0).toStringList().at(0), QString(\"Battery.Capacity\"));\n\n backend->disconnectNotify(\"-\"); \/\/ Fake it. Spy does something fishy here.\n}\n\nvoid InfoCdbBackendUnitTest::removed()\n{\n backend->connectNotify(\"-\"); \/\/ Fake it. Spy does something fishy here.\n QSignalSpy spy(backend, SIGNAL(keysRemoved(QStringList)));\n\n QFile::remove(\"cache.cdb\");\n\n QTest::qWait(DEFAULT_WAIT_PERIOD);\n\n \/\/QCOMPARE(spy.count(), 1);\n \/\/QList<QVariant> args = spy.takeFirst();\n \/\/QCOMPARE(args.at(0).toList().size(), 2);\n\n backend->disconnectNotify(\"-\"); \/\/ Fake it. Spy does something fishy here.\n}\n\nvoid InfoCdbBackendUnitTest::cleanupTestCase()\n{\n QFile::remove(\"cache.cdb\");\n QFile::remove(\"cache-next.cdb\");\n}\n\n#include \"infocdbbackendunittest.moc\"\nQTEST_MAIN(InfoCdbBackendUnitTest);\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 <thread>\n\n#include \"test\/core\/util\/port.h\"\n#include \"test\/core\/util\/test_config.h\"\n#include \"test\/cpp\/util\/echo_duplicate.grpc.pb.h\"\n#include \"test\/cpp\/util\/echo.grpc.pb.h\"\n#include \"src\/cpp\/server\/thread_pool.h\"\n#include <grpc++\/channel_arguments.h>\n#include <grpc++\/channel_interface.h>\n#include <grpc++\/client_context.h>\n#include <grpc++\/create_channel.h>\n#include <grpc++\/credentials.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 <grpc++\/time.h>\n#include <gtest\/gtest.h>\n\n#include <grpc\/grpc.h>\n#include <grpc\/support\/thd.h>\n#include <grpc\/support\/time.h>\n\n#include \"test\/cpp\/util\/subprocess.h\"\n\nusing grpc::cpp::test::util::EchoRequest;\nusing grpc::cpp::test::util::EchoResponse;\nusing std::chrono::system_clock;\n\nstatic std::string g_root;\n\nnamespace grpc {\nnamespace testing {\n\nnamespace {\n\nclass CrashTest : public ::testing::Test {\n protected:\n CrashTest() {}\n\n std::unique_ptr<grpc::cpp::test::util::TestService::Stub> CreateServerAndStub() {\n auto port = grpc_pick_unused_port_or_die();\n auto addr = (std::ostringstream() << \"localhost:\" << port).str();\n server_.reset(new SubProcess({\n (std::ostringstream() << g_root << \"\/crash_test_server\").str(),\n (std::ostringstream() << \"--address=\" << addr).str(),\n }));\n GPR_ASSERT(server_);\n return grpc::cpp::test::util::TestService::NewStub(CreateChannel(addr, InsecureCredentials(), ChannelArguments()));\n }\n\n void KillServer() {\n server_.reset();\n }\n\n private:\n std::unique_ptr<SubProcess> server_;\n};\n\nTEST_F(CrashTest, KillAfterWrite) {\n auto stub = CreateServerAndStub();\n\n EchoRequest request;\n EchoResponse response;\n ClientContext context;\n\n auto stream = stub->BidiStream(&context);\n\n request.set_message(\"Hello\");\n EXPECT_TRUE(stream->Write(request));\n EXPECT_TRUE(stream->Read(&response));\n EXPECT_EQ(response.message(), request.message());\n\n request.set_message(\"I'm going to kill you\");\n EXPECT_TRUE(stream->Write(request));\n\n KillServer();\n\n EXPECT_FALSE(stream->Read(&response));\n\n EXPECT_FALSE(stream->Finish().IsOk());\n}\n\nTEST_F(CrashTest, KillBeforeWrite) {\n auto stub = CreateServerAndStub();\n\n EchoRequest request;\n EchoResponse response;\n ClientContext context;\n\n auto stream = stub->BidiStream(&context);\n\n request.set_message(\"Hello\");\n EXPECT_TRUE(stream->Write(request));\n EXPECT_TRUE(stream->Read(&response));\n EXPECT_EQ(response.message(), request.message());\n\n KillServer();\n\n request.set_message(\"You should be dead\");\n EXPECT_FALSE(stream->Write(request));\n EXPECT_FALSE(stream->Read(&response));\n\n EXPECT_FALSE(stream->Finish().IsOk());\n}\n\n} \/\/ namespace\n\n} \/\/ namespace testing\n} \/\/ namespace grpc\n\nint main(int argc, char** argv) {\n std::string me = argv[0];\n auto lslash = me.rfind('\/');\n if (lslash != std::string::npos) {\n g_root = me.substr(0, lslash);\n } else {\n g_root = \".\";\n }\n\n grpc_test_init(argc, argv);\n ::testing::InitGoogleTest(&argc, argv);\n return RUN_ALL_TESTS();\n}\n<commit_msg>Sleep a little after server death to allow TCP time to catch up<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 <thread>\n\n#include \"test\/core\/util\/port.h\"\n#include \"test\/core\/util\/test_config.h\"\n#include \"test\/cpp\/util\/echo_duplicate.grpc.pb.h\"\n#include \"test\/cpp\/util\/echo.grpc.pb.h\"\n#include \"src\/cpp\/server\/thread_pool.h\"\n#include <grpc++\/channel_arguments.h>\n#include <grpc++\/channel_interface.h>\n#include <grpc++\/client_context.h>\n#include <grpc++\/create_channel.h>\n#include <grpc++\/credentials.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 <grpc++\/time.h>\n#include <gtest\/gtest.h>\n\n#include <grpc\/grpc.h>\n#include <grpc\/support\/thd.h>\n#include <grpc\/support\/time.h>\n\n#include \"test\/cpp\/util\/subprocess.h\"\n\nusing grpc::cpp::test::util::EchoRequest;\nusing grpc::cpp::test::util::EchoResponse;\nusing std::chrono::system_clock;\n\nstatic std::string g_root;\n\nnamespace grpc {\nnamespace testing {\n\nnamespace {\n\nclass CrashTest : public ::testing::Test {\n protected:\n CrashTest() {}\n\n std::unique_ptr<grpc::cpp::test::util::TestService::Stub> CreateServerAndStub() {\n auto port = grpc_pick_unused_port_or_die();\n auto addr = (std::ostringstream() << \"localhost:\" << port).str();\n server_.reset(new SubProcess({\n (std::ostringstream() << g_root << \"\/crash_test_server\").str(),\n (std::ostringstream() << \"--address=\" << addr).str(),\n }));\n GPR_ASSERT(server_);\n return grpc::cpp::test::util::TestService::NewStub(CreateChannel(addr, InsecureCredentials(), ChannelArguments()));\n }\n\n void KillServer() {\n server_.reset();\n \/\/ give some time for the TCP connection to drop\n gpr_sleep_until(gpr_time_add(gpr_now(), gpr_time_from_seconds(1)));\n }\n\n private:\n std::unique_ptr<SubProcess> server_;\n};\n\nTEST_F(CrashTest, KillAfterWrite) {\n auto stub = CreateServerAndStub();\n\n EchoRequest request;\n EchoResponse response;\n ClientContext context;\n\n auto stream = stub->BidiStream(&context);\n\n request.set_message(\"Hello\");\n EXPECT_TRUE(stream->Write(request));\n EXPECT_TRUE(stream->Read(&response));\n EXPECT_EQ(response.message(), request.message());\n\n request.set_message(\"I'm going to kill you\");\n EXPECT_TRUE(stream->Write(request));\n\n KillServer();\n\n EXPECT_FALSE(stream->Read(&response));\n\n EXPECT_FALSE(stream->Finish().IsOk());\n}\n\nTEST_F(CrashTest, KillBeforeWrite) {\n auto stub = CreateServerAndStub();\n\n EchoRequest request;\n EchoResponse response;\n ClientContext context;\n\n auto stream = stub->BidiStream(&context);\n\n request.set_message(\"Hello\");\n EXPECT_TRUE(stream->Write(request));\n EXPECT_TRUE(stream->Read(&response));\n EXPECT_EQ(response.message(), request.message());\n\n KillServer();\n\n request.set_message(\"You should be dead\");\n EXPECT_FALSE(stream->Write(request));\n EXPECT_FALSE(stream->Read(&response));\n\n EXPECT_FALSE(stream->Finish().IsOk());\n}\n\n} \/\/ namespace\n\n} \/\/ namespace testing\n} \/\/ namespace grpc\n\nint main(int argc, char** argv) {\n std::string me = argv[0];\n auto lslash = me.rfind('\/');\n if (lslash != std::string::npos) {\n g_root = me.substr(0, lslash);\n } else {\n g_root = \".\";\n }\n\n grpc_test_init(argc, argv);\n ::testing::InitGoogleTest(&argc, argv);\n return RUN_ALL_TESTS();\n}\n<|endoftext|>"} {"text":"<commit_before>#include <cap\/version.h>\n#include <pycap\/property_tree_wrappers.h>\n#include <pycap\/energy_storage_device_wrappers.h>\n#include <boost\/python.hpp>\n#include <string>\n#include <memory>\n#include <map>\n\n\nBOOST_PYTHON_MODULE(_pycap)\n{\n \/\/ Deprecated stuff\n boost::python::class_<pycap::ElectrochemicalImpedanceSpectroscopyData, std::shared_ptr<pycap::ElectrochemicalImpedanceSpectroscopyData>>(\"ElectrochemicalImpedanceSpectroscopyData\")\n .def(\"impedance_spectroscopy\", &pycap::ElectrochemicalImpedanceSpectroscopyData::impedance_spectroscopy)\n .def(\"measure_impedance\", &pycap::ElectrochemicalImpedanceSpectroscopyData::measure_impedance)\n .def(\"get_frequency\", &pycap::ElectrochemicalImpedanceSpectroscopyData::get_frequency)\n .def(\"get_complex_impedance\", &pycap::ElectrochemicalImpedanceSpectroscopyData::get_complex_impedance)\n .def(\"clear\", &pycap::ElectrochemicalImpedanceSpectroscopyData::clear)\n ;\n\n boost::python::docstring_options doc_options;\n doc_options.enable_user_defined();\n doc_options.disable_py_signatures();\n doc_options.disable_cpp_signatures();\n\n boost::python::class_<pycap::EnergyStorageDeviceWrap, std::shared_ptr<pycap::EnergyStorageDeviceWrap>, boost::noncopyable>(\"EnergyStorageDevice\", \"Wrappers for Cap.EnergyStorageDevice\", boost::python::no_init)\n .def(\"__init__\", boost::python::make_constructor(&pycap::build_energy_storage_device) )\n .def(\"get_voltage\", (&pycap::get_voltage), boost::python::args(\"self\") )\n .def(\"get_current\", (&pycap::get_current), boost::python::args(\"self\") )\n .def(\"evolve_one_time_step_constant_current\", boost::python::pure_virtual(&cap::EnergyStorageDevice::evolve_one_time_step_constant_current), boost::python::args(\"self\", \"time_step\", \"current\") )\n .def(\"evolve_one_time_step_constant_voltage\", boost::python::pure_virtual(&cap::EnergyStorageDevice::evolve_one_time_step_constant_voltage), boost::python::args(\"self\", \"time_step\", \"voltage\") )\n .def(\"evolve_one_time_step_constant_power\" , boost::python::pure_virtual(&cap::EnergyStorageDevice::evolve_one_time_step_constant_power ), boost::python::args(\"self\", \"time_step\", \"load\" ) )\n .def(\"evolve_one_time_step_constant_load\" , boost::python::pure_virtual(&cap::EnergyStorageDevice::evolve_one_time_step_constant_load ), boost::python::args(\"self\", \"time_step\", \"power\" ) )\n .def(\"evolve_one_time_step_changing_current\", boost::python::pure_virtual(&cap::EnergyStorageDevice::evolve_one_time_step_changing_current), boost::python::args(\"self\", \"time_step\", \"current\") )\n .def(\"evolve_one_time_step_changing_voltage\", boost::python::pure_virtual(&cap::EnergyStorageDevice::evolve_one_time_step_changing_voltage), boost::python::args(\"self\", \"time_step\", \"voltage\") )\n .def(\"evolve_one_time_step_changing_power\" , boost::python::pure_virtual(&cap::EnergyStorageDevice::evolve_one_time_step_changing_power ), boost::python::args(\"self\", \"time_step\", \"power\" ) )\n .def(\"evolve_one_time_step_changing_load\" , boost::python::pure_virtual(&cap::EnergyStorageDevice::evolve_one_time_step_changing_load ), boost::python::args(\"self\", \"time_step\", \"load\" ) )\n .def(\"compute_equivalent_circuit\", &pycap::compute_equivalent_circuit, \"Return the PropertyTree to build an equivalent circuit model\", boost::python::args(\"ptree\") )\n .staticmethod(\"compute_equivalent_circuit\")\n\/\/ .def_pickle(pycap::serializable_class_pickle_support<cap::EnergyStorageDevice>())\n ;\n boost::python::register_ptr_to_python<std::shared_ptr<cap::EnergyStorageDevice>>();\n\n boost::python::scope().attr(\"__version__\" ) = cap::version() ;\n boost::python::scope().attr(\"__git_branch__\" ) = cap::git_branch() ;\n boost::python::scope().attr(\"__git_commit_hash__\") = cap::git_commit_hash();\n\n boost::python::class_<boost::property_tree::ptree,std::shared_ptr<boost::property_tree::ptree>>(\"PropertyTree\", \"Wrappers for Boost.PropertyTree\")\n .def(\"get_double\" , &pycap::get_double , \"Get the double at the given path.\" , boost::python::args(\"self\", \"path\") )\n .def(\"get_string\" , &pycap::get_string , \"Get the string at the given path.\" , boost::python::args(\"self\", \"path\") )\n .def(\"get_int\" , &pycap::get_int , \"Get the integer at the given path.\" , boost::python::args(\"self\", \"path\") )\n .def(\"get_bool\" , &pycap::get_bool , \"Get the boolean at the given path.\" , boost::python::args(\"self\", \"path\") )\n .def(\"get_double_with_default_value\", &pycap::get_double_with_default_value, \"Get the double at the given path or return default_value.\" , boost::python::args(\"self\", \"path\", \"default_value\") )\n .def(\"get_string_with_default_value\", &pycap::get_string_with_default_value, \"Get the string at the given path or return default_value.\" , boost::python::args(\"self\", \"path\", \"default_value\") )\n .def(\"get_int_with_default_value\" , &pycap::get_int_with_default_value , \"Get the integer at the given path or return default_value.\" , boost::python::args(\"self\", \"path\", \"default_value\") )\n .def(\"get_bool_with_default_value\" , &pycap::get_bool_with_default_value , \"Get the boolean at the given path or return default_value.\" , boost::python::args(\"self\", \"path\", \"default_value\") )\n .def(\"put_double\" , &pycap::put_double , \"Set the node at the given path to the supplied value.\" , boost::python::args(\"self\", \"path\", \"value\") )\n .def(\"put_string\" , &pycap::put_string , \"Set the node at the given path to the supplied value.\" , boost::python::args(\"self\", \"path\", \"value\") )\n .def(\"put_int\" , &pycap::put_int , \"Set the node at the given path to the supplied value.\" , boost::python::args(\"self\", \"path\", \"value\") )\n .def(\"put_bool\" , &pycap::put_bool , \"Set the node at the given path to the supplied value.\" , boost::python::args(\"self\", \"path\", \"value\") )\n .def(\"get_array_double\" , &pycap::get_array_double , \"Get comma separated array of double.\" , boost::python::args(\"self\", \"path\") )\n .def(\"get_array_string\" , &pycap::get_array_string , \"Get comma separated array of string.\" , boost::python::args(\"self\", \"path\") )\n .def(\"get_array_int\" , &pycap::get_array_int , \"Get comma separated array of integer.\" , boost::python::args(\"self\", \"path\") )\n .def(\"get_array_bool\" , &pycap::get_array_bool , \"Get comma separated array of boolean.\" , boost::python::args(\"self\", \"path\") )\n .def(\"parse_xml\" , &pycap::parse_xml , \"Read the input file at XML format and populate the PropertyTree.\" , boost::python::args(\"self\", \"filename\") )\n .def(\"parse_json\" , &pycap::parse_json , \"Read the input file at JSON format and populate the PropertyTree.\", boost::python::args(\"self\", \"filename\") )\n .def(\"parse_info\" , &pycap::parse_info , \"Read the input file at INFO format and populate the PropertyTree.\", boost::python::args(\"self\", \"filename\") )\n .def(\"get_child\" , &pycap::get_child , \"Get the child at the given path, or throw ptree_bad_path.\" , boost::python::args(\"self\", \"path\") )\n .def_pickle(pycap::serializable_class_pickle_support<boost::property_tree::ptree>())\n ;\n}\n<commit_msg>enable py signature in docstring<commit_after>#include <cap\/version.h>\n#include <pycap\/property_tree_wrappers.h>\n#include <pycap\/energy_storage_device_wrappers.h>\n#include <boost\/python.hpp>\n#include <string>\n#include <memory>\n#include <map>\n\n\nBOOST_PYTHON_MODULE(_pycap)\n{\n \/\/ Deprecated stuff\n boost::python::class_<pycap::ElectrochemicalImpedanceSpectroscopyData, std::shared_ptr<pycap::ElectrochemicalImpedanceSpectroscopyData>>(\"ElectrochemicalImpedanceSpectroscopyData\")\n .def(\"impedance_spectroscopy\", &pycap::ElectrochemicalImpedanceSpectroscopyData::impedance_spectroscopy)\n .def(\"measure_impedance\", &pycap::ElectrochemicalImpedanceSpectroscopyData::measure_impedance)\n .def(\"get_frequency\", &pycap::ElectrochemicalImpedanceSpectroscopyData::get_frequency)\n .def(\"get_complex_impedance\", &pycap::ElectrochemicalImpedanceSpectroscopyData::get_complex_impedance)\n .def(\"clear\", &pycap::ElectrochemicalImpedanceSpectroscopyData::clear)\n ;\n\n boost::python::docstring_options doc_options;\n doc_options.enable_user_defined();\n doc_options.enable_py_signatures();\n doc_options.disable_cpp_signatures();\n\n boost::python::class_<pycap::EnergyStorageDeviceWrap, std::shared_ptr<pycap::EnergyStorageDeviceWrap>, boost::noncopyable>(\"EnergyStorageDevice\", \"Wrappers for Cap.EnergyStorageDevice\", boost::python::no_init)\n .def(\"__init__\", boost::python::make_constructor(&pycap::build_energy_storage_device) )\n .def(\"get_voltage\", (&pycap::get_voltage), boost::python::args(\"self\") )\n .def(\"get_current\", (&pycap::get_current), boost::python::args(\"self\") )\n .def(\"evolve_one_time_step_constant_current\", boost::python::pure_virtual(&cap::EnergyStorageDevice::evolve_one_time_step_constant_current), boost::python::args(\"self\", \"time_step\", \"current\") )\n .def(\"evolve_one_time_step_constant_voltage\", boost::python::pure_virtual(&cap::EnergyStorageDevice::evolve_one_time_step_constant_voltage), boost::python::args(\"self\", \"time_step\", \"voltage\") )\n .def(\"evolve_one_time_step_constant_power\" , boost::python::pure_virtual(&cap::EnergyStorageDevice::evolve_one_time_step_constant_power ), boost::python::args(\"self\", \"time_step\", \"load\" ) )\n .def(\"evolve_one_time_step_constant_load\" , boost::python::pure_virtual(&cap::EnergyStorageDevice::evolve_one_time_step_constant_load ), boost::python::args(\"self\", \"time_step\", \"power\" ) )\n .def(\"evolve_one_time_step_changing_current\", boost::python::pure_virtual(&cap::EnergyStorageDevice::evolve_one_time_step_changing_current), boost::python::args(\"self\", \"time_step\", \"current\") )\n .def(\"evolve_one_time_step_changing_voltage\", boost::python::pure_virtual(&cap::EnergyStorageDevice::evolve_one_time_step_changing_voltage), boost::python::args(\"self\", \"time_step\", \"voltage\") )\n .def(\"evolve_one_time_step_changing_power\" , boost::python::pure_virtual(&cap::EnergyStorageDevice::evolve_one_time_step_changing_power ), boost::python::args(\"self\", \"time_step\", \"power\" ) )\n .def(\"evolve_one_time_step_changing_load\" , boost::python::pure_virtual(&cap::EnergyStorageDevice::evolve_one_time_step_changing_load ), boost::python::args(\"self\", \"time_step\", \"load\" ) )\n .def(\"compute_equivalent_circuit\", &pycap::compute_equivalent_circuit, \"Return the PropertyTree to build an equivalent circuit model\", boost::python::args(\"ptree\") )\n .staticmethod(\"compute_equivalent_circuit\")\n\/\/ .def_pickle(pycap::serializable_class_pickle_support<cap::EnergyStorageDevice>())\n ;\n boost::python::register_ptr_to_python<std::shared_ptr<cap::EnergyStorageDevice>>();\n\n boost::python::scope().attr(\"__version__\" ) = cap::version() ;\n boost::python::scope().attr(\"__git_branch__\" ) = cap::git_branch() ;\n boost::python::scope().attr(\"__git_commit_hash__\") = cap::git_commit_hash();\n\n boost::python::class_<boost::property_tree::ptree,std::shared_ptr<boost::property_tree::ptree>>(\"PropertyTree\", \"Wrappers for Boost.PropertyTree\")\n .def(\"get_double\" , &pycap::get_double , \"Get the double at the given path.\" , boost::python::args(\"self\", \"path\") )\n .def(\"get_string\" , &pycap::get_string , \"Get the string at the given path.\" , boost::python::args(\"self\", \"path\") )\n .def(\"get_int\" , &pycap::get_int , \"Get the integer at the given path.\" , boost::python::args(\"self\", \"path\") )\n .def(\"get_bool\" , &pycap::get_bool , \"Get the boolean at the given path.\" , boost::python::args(\"self\", \"path\") )\n .def(\"get_double_with_default_value\", &pycap::get_double_with_default_value, \"Get the double at the given path or return default_value.\" , boost::python::args(\"self\", \"path\", \"default_value\") )\n .def(\"get_string_with_default_value\", &pycap::get_string_with_default_value, \"Get the string at the given path or return default_value.\" , boost::python::args(\"self\", \"path\", \"default_value\") )\n .def(\"get_int_with_default_value\" , &pycap::get_int_with_default_value , \"Get the integer at the given path or return default_value.\" , boost::python::args(\"self\", \"path\", \"default_value\") )\n .def(\"get_bool_with_default_value\" , &pycap::get_bool_with_default_value , \"Get the boolean at the given path or return default_value.\" , boost::python::args(\"self\", \"path\", \"default_value\") )\n .def(\"put_double\" , &pycap::put_double , \"Set the node at the given path to the supplied value.\" , boost::python::args(\"self\", \"path\", \"value\") )\n .def(\"put_string\" , &pycap::put_string , \"Set the node at the given path to the supplied value.\" , boost::python::args(\"self\", \"path\", \"value\") )\n .def(\"put_int\" , &pycap::put_int , \"Set the node at the given path to the supplied value.\" , boost::python::args(\"self\", \"path\", \"value\") )\n .def(\"put_bool\" , &pycap::put_bool , \"Set the node at the given path to the supplied value.\" , boost::python::args(\"self\", \"path\", \"value\") )\n .def(\"get_array_double\" , &pycap::get_array_double , \"Get comma separated array of double.\" , boost::python::args(\"self\", \"path\") )\n .def(\"get_array_string\" , &pycap::get_array_string , \"Get comma separated array of string.\" , boost::python::args(\"self\", \"path\") )\n .def(\"get_array_int\" , &pycap::get_array_int , \"Get comma separated array of integer.\" , boost::python::args(\"self\", \"path\") )\n .def(\"get_array_bool\" , &pycap::get_array_bool , \"Get comma separated array of boolean.\" , boost::python::args(\"self\", \"path\") )\n .def(\"parse_xml\" , &pycap::parse_xml , \"Read the input file at XML format and populate the PropertyTree.\" , boost::python::args(\"self\", \"filename\") )\n .def(\"parse_json\" , &pycap::parse_json , \"Read the input file at JSON format and populate the PropertyTree.\", boost::python::args(\"self\", \"filename\") )\n .def(\"parse_info\" , &pycap::parse_info , \"Read the input file at INFO format and populate the PropertyTree.\", boost::python::args(\"self\", \"filename\") )\n .def(\"get_child\" , &pycap::get_child , \"Get the child at the given path, or throw ptree_bad_path.\" , boost::python::args(\"self\", \"path\") )\n .def_pickle(pycap::serializable_class_pickle_support<boost::property_tree::ptree>())\n ;\n}\n<|endoftext|>"} {"text":"<commit_before>\/* \n* Copyright 2011 Matthias Fuchs\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*\/\n\n#include <stromx\/core\/Primitive.h>\n\n#include <boost\/python.hpp>\n\nusing namespace boost::python;\nusing namespace stromx::core;\n\nvoid exportPrimitive()\n{\n class_<Bool, bases<Data> >(\"Bool\")\n .def(init<>())\n .def(init<bool>())\n .def(\"get\", &Bool::get)\n .def(\"data_cast\", &data_cast<Bool &>, return_internal_reference<1>())\n .staticmethod(\"data_cast\")\n ;\n \n class_<Int8, bases<Data> >(\"Int8\")\n .def(init<>())\n .def(init<int>())\n .def(\"get\", &Int8::get)\n .def(\"data_cast\", &data_cast<Int8 &>, return_internal_reference<1>())\n .staticmethod(\"data_cast\")\n ;\n \n class_<UInt32, bases<Data> >(\"UInt32\")\n .def(init<>())\n .def(init<unsigned int>())\n .def(\"get\", &UInt32::get)\n .def(\"data_cast\", &data_cast<UInt32 &>, return_internal_reference<1>())\n .staticmethod(\"data_cast\")\n ;\n}\n<commit_msg>Python wrapper for all primitives<commit_after>\/* \n* Copyright 2011 Matthias Fuchs\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*\/\n\n#include <stromx\/core\/Primitive.h>\n\n#include <boost\/python.hpp>\n\nusing namespace boost::python;\nusing namespace stromx::core;\n\nnamespace\n{ \n template <class repr_t, class val_t>\n void primitive(const char* name)\n {\n class_<val_t, bases<Data> >(name)\n .def(init<>())\n .def(init<repr_t>())\n .def(\"get\", &val_t::get)\n .def(\"data_cast\", &data_cast<val_t &>, return_internal_reference<1>())\n .staticmethod(\"data_cast\")\n ;\n }\n}\n\nvoid exportPrimitive()\n{\n primitive<bool, Bool>(\"Bool\");\n primitive<int, Int8>(\"Int8\");\n primitive<unsigned int, UInt8>(\"UInt8\");\n primitive<int, Int16>(\"Int16\");\n primitive<unsigned int, UInt16>(\"UInt16\");\n primitive<int, Int32>(\"Int32\");\n primitive<unsigned int, UInt32>(\"UInt32\");\n primitive<double, Float>(\"Float\");\n primitive<float, Double>(\"Double\");\n}\n<|endoftext|>"} {"text":"<commit_before>\/\/ Copyright (c) 2019 The Chromium Authors. All rights reserved.\n\/\/ 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\/third_party\/quiche\/src\/quic\/qbone\/qbone_session_base.h\"\n\n#include <netinet\/icmp6.h>\n#include <netinet\/ip6.h>\n\n#include <utility>\n\n#include \"net\/third_party\/quiche\/src\/quic\/core\/quic_buffer_allocator.h\"\n#include \"net\/third_party\/quiche\/src\/quic\/core\/quic_data_reader.h\"\n#include \"net\/third_party\/quiche\/src\/quic\/core\/quic_types.h\"\n#include \"net\/third_party\/quiche\/src\/quic\/platform\/api\/quic_exported_stats.h\"\n#include \"net\/third_party\/quiche\/src\/quic\/platform\/api\/quic_logging.h\"\n#include \"net\/third_party\/quiche\/src\/quic\/qbone\/platform\/icmp_packet.h\"\n#include \"net\/third_party\/quiche\/src\/quic\/qbone\/qbone_constants.h\"\n#include \"net\/third_party\/quiche\/src\/common\/platform\/api\/quiche_string_piece.h\"\n\nnamespace quic {\n\n#define ENDPOINT \\\n (perspective() == Perspective::IS_SERVER ? \"Server: \" : \"Client: \")\n\nQboneSessionBase::QboneSessionBase(\n QuicConnection* connection,\n Visitor* owner,\n const QuicConfig& config,\n const ParsedQuicVersionVector& supported_versions,\n QbonePacketWriter* writer)\n : QuicSession(connection,\n owner,\n config,\n supported_versions,\n \/*num_expected_unidirectional_static_streams = *\/ 0) {\n set_writer(writer);\n const uint32_t max_streams =\n (std::numeric_limits<uint32_t>::max() \/ kMaxAvailableStreamsMultiplier) -\n 1;\n this->config()->SetMaxBidirectionalStreamsToSend(max_streams);\n if (VersionHasIetfQuicFrames(transport_version())) {\n ConfigureMaxDynamicStreamsToSend(max_streams);\n }\n}\n\nQboneSessionBase::~QboneSessionBase() {\n \/\/ Clear out the streams before leaving this destructor to avoid calling\n \/\/ QuicSession::UnregisterStreamPriority\n stream_map().clear();\n closed_streams()->clear();\n}\n\nvoid QboneSessionBase::Initialize() {\n crypto_stream_ = CreateCryptoStream();\n QuicSession::Initialize();\n}\n\nconst QuicCryptoStream* QboneSessionBase::GetCryptoStream() const {\n return crypto_stream_.get();\n}\n\nQuicCryptoStream* QboneSessionBase::GetMutableCryptoStream() {\n return crypto_stream_.get();\n}\n\nQuicStream* QboneSessionBase::CreateOutgoingStream() {\n return ActivateDataStream(\n CreateDataStream(GetNextOutgoingUnidirectionalStreamId()));\n}\n\nvoid QboneSessionBase::CloseStream(QuicStreamId stream_id) {\n if (IsClosedStream(stream_id)) {\n \/\/ When CloseStream has been called recursively (via\n \/\/ QuicStream::OnClose), the stream is already closed so return.\n return;\n }\n QuicSession::CloseStream(stream_id);\n}\n\nvoid QboneSessionBase::OnStreamFrame(const QuicStreamFrame& frame) {\n if (frame.offset == 0 && frame.fin && frame.data_length > 0) {\n ++num_ephemeral_packets_;\n ProcessPacketFromPeer(\n quiche::QuicheStringPiece(frame.data_buffer, frame.data_length));\n flow_controller()->AddBytesConsumed(frame.data_length);\n return;\n }\n QuicSession::OnStreamFrame(frame);\n}\n\nvoid QboneSessionBase::OnMessageReceived(quiche::QuicheStringPiece message) {\n ++num_message_packets_;\n ProcessPacketFromPeer(message);\n}\n\nQuicStream* QboneSessionBase::CreateIncomingStream(QuicStreamId id) {\n return ActivateDataStream(CreateDataStream(id));\n}\n\nQuicStream* QboneSessionBase::CreateIncomingStream(PendingStream* \/*pending*\/) {\n QUIC_NOTREACHED();\n return nullptr;\n}\n\nbool QboneSessionBase::ShouldKeepConnectionAlive() const {\n \/\/ QBONE connections stay alive until they're explicitly closed.\n return true;\n}\n\nstd::unique_ptr<QuicStream> QboneSessionBase::CreateDataStream(\n QuicStreamId id) {\n if (crypto_stream_ == nullptr || !crypto_stream_->encryption_established()) {\n \/\/ Encryption not active so no stream created\n return nullptr;\n }\n\n if (IsIncomingStream(id)) {\n ++num_streamed_packets_;\n return std::make_unique<QboneReadOnlyStream>(id, this);\n }\n\n return std::make_unique<QboneWriteOnlyStream>(id, this);\n}\n\nQuicStream* QboneSessionBase::ActivateDataStream(\n std::unique_ptr<QuicStream> stream) {\n \/\/ Transfer ownership of the data stream to the session via ActivateStream().\n QuicStream* raw = stream.get();\n if (stream) {\n \/\/ Make QuicSession take ownership of the stream.\n ActivateStream(std::move(stream));\n }\n return raw;\n}\n\nvoid QboneSessionBase::SendPacketToPeer(quiche::QuicheStringPiece packet) {\n if (crypto_stream_ == nullptr) {\n QUIC_BUG << \"Attempting to send packet before encryption established\";\n return;\n }\n\n if (send_packets_as_messages_) {\n QuicUniqueBufferPtr buffer = MakeUniqueBuffer(\n connection()->helper()->GetStreamSendBufferAllocator(), packet.size());\n memcpy(buffer.get(), packet.data(), packet.size());\n QuicMemSlice slice(std::move(buffer), packet.size());\n switch (SendMessage(QuicMemSliceSpan(&slice), \/*flush=*\/true).status) {\n case MESSAGE_STATUS_SUCCESS:\n break;\n case MESSAGE_STATUS_TOO_LARGE: {\n if (packet.size() < sizeof(ip6_hdr)) {\n QUIC_BUG << \"Dropped malformed packet: IPv6 header too short\";\n break;\n }\n auto* header = reinterpret_cast<const ip6_hdr*>(packet.begin());\n icmp6_hdr icmp_header{};\n icmp_header.icmp6_type = ICMP6_PACKET_TOO_BIG;\n icmp_header.icmp6_mtu =\n connection()->GetGuaranteedLargestMessagePayload();\n\n CreateIcmpPacket(header->ip6_dst, header->ip6_src, icmp_header, packet,\n [this](quiche::QuicheStringPiece icmp_packet) {\n writer_->WritePacketToNetwork(icmp_packet.data(),\n icmp_packet.size());\n });\n break;\n }\n case MESSAGE_STATUS_ENCRYPTION_NOT_ESTABLISHED:\n QUIC_BUG << \"MESSAGE_STATUS_ENCRYPTION_NOT_ESTABLISHED\";\n break;\n case MESSAGE_STATUS_UNSUPPORTED:\n QUIC_BUG << \"MESSAGE_STATUS_UNSUPPORTED\";\n break;\n case MESSAGE_STATUS_BLOCKED:\n QUIC_BUG << \"MESSAGE_STATUS_BLOCKED\";\n break;\n case MESSAGE_STATUS_INTERNAL_ERROR:\n QUIC_BUG << \"MESSAGE_STATUS_INTERNAL_ERROR\";\n break;\n }\n return;\n }\n\n \/\/ QBONE streams are ephemeral.\n QuicStream* stream = CreateOutgoingStream();\n if (!stream) {\n QUIC_BUG << \"Failed to create an outgoing QBONE stream.\";\n return;\n }\n\n QboneWriteOnlyStream* qbone_stream =\n static_cast<QboneWriteOnlyStream*>(stream);\n qbone_stream->WritePacketToQuicStream(packet);\n}\n\nuint64_t QboneSessionBase::GetNumEphemeralPackets() const {\n return num_ephemeral_packets_;\n}\n\nuint64_t QboneSessionBase::GetNumStreamedPackets() const {\n return num_streamed_packets_;\n}\n\nuint64_t QboneSessionBase::GetNumMessagePackets() const {\n return num_message_packets_;\n}\n\nuint64_t QboneSessionBase::GetNumFallbackToStream() const {\n return num_fallback_to_stream_;\n}\n\nvoid QboneSessionBase::set_writer(QbonePacketWriter* writer) {\n writer_ = writer;\n testing::testvalue::Adjust(\"quic_QbonePacketWriter\", &writer_);\n}\n\n} \/\/ namespace quic\n<commit_msg>Close any existing stream when processing an ephemeral packet.<commit_after>\/\/ Copyright (c) 2019 The Chromium Authors. All rights reserved.\n\/\/ 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\/third_party\/quiche\/src\/quic\/qbone\/qbone_session_base.h\"\n\n#include <netinet\/icmp6.h>\n#include <netinet\/ip6.h>\n\n#include <utility>\n\n#include \"net\/third_party\/quiche\/src\/quic\/core\/quic_buffer_allocator.h\"\n#include \"net\/third_party\/quiche\/src\/quic\/core\/quic_data_reader.h\"\n#include \"net\/third_party\/quiche\/src\/quic\/core\/quic_types.h\"\n#include \"net\/third_party\/quiche\/src\/quic\/platform\/api\/quic_exported_stats.h\"\n#include \"net\/third_party\/quiche\/src\/quic\/platform\/api\/quic_logging.h\"\n#include \"net\/third_party\/quiche\/src\/quic\/qbone\/platform\/icmp_packet.h\"\n#include \"net\/third_party\/quiche\/src\/quic\/qbone\/qbone_constants.h\"\n#include \"net\/third_party\/quiche\/src\/common\/platform\/api\/quiche_string_piece.h\"\n\nABSL_FLAG(\n bool,\n qbone_close_ephemeral_frames,\n true,\n \"If true, we'll call CloseStream even when we receive ephemeral frames.\");\n\nnamespace quic {\n\n#define ENDPOINT \\\n (perspective() == Perspective::IS_SERVER ? \"Server: \" : \"Client: \")\n\nQboneSessionBase::QboneSessionBase(\n QuicConnection* connection,\n Visitor* owner,\n const QuicConfig& config,\n const ParsedQuicVersionVector& supported_versions,\n QbonePacketWriter* writer)\n : QuicSession(connection,\n owner,\n config,\n supported_versions,\n \/*num_expected_unidirectional_static_streams = *\/ 0) {\n set_writer(writer);\n const uint32_t max_streams =\n (std::numeric_limits<uint32_t>::max() \/ kMaxAvailableStreamsMultiplier) -\n 1;\n this->config()->SetMaxBidirectionalStreamsToSend(max_streams);\n if (VersionHasIetfQuicFrames(transport_version())) {\n ConfigureMaxDynamicStreamsToSend(max_streams);\n }\n}\n\nQboneSessionBase::~QboneSessionBase() {\n \/\/ Clear out the streams before leaving this destructor to avoid calling\n \/\/ QuicSession::UnregisterStreamPriority\n stream_map().clear();\n closed_streams()->clear();\n}\n\nvoid QboneSessionBase::Initialize() {\n crypto_stream_ = CreateCryptoStream();\n QuicSession::Initialize();\n}\n\nconst QuicCryptoStream* QboneSessionBase::GetCryptoStream() const {\n return crypto_stream_.get();\n}\n\nQuicCryptoStream* QboneSessionBase::GetMutableCryptoStream() {\n return crypto_stream_.get();\n}\n\nQuicStream* QboneSessionBase::CreateOutgoingStream() {\n return ActivateDataStream(\n CreateDataStream(GetNextOutgoingUnidirectionalStreamId()));\n}\n\nvoid QboneSessionBase::CloseStream(QuicStreamId stream_id) {\n if (IsClosedStream(stream_id)) {\n \/\/ When CloseStream has been called recursively (via\n \/\/ QuicStream::OnClose), the stream is already closed so return.\n return;\n }\n QuicSession::CloseStream(stream_id);\n}\n\nvoid QboneSessionBase::OnStreamFrame(const QuicStreamFrame& frame) {\n if (frame.offset == 0 && frame.fin && frame.data_length > 0) {\n ++num_ephemeral_packets_;\n ProcessPacketFromPeer(\n quiche::QuicheStringPiece(frame.data_buffer, frame.data_length));\n flow_controller()->AddBytesConsumed(frame.data_length);\n \/\/ TODO(b\/147817422): Add a counter for how many streams were actually\n \/\/ closed here.\n if (GetQuicFlag(FLAGS_qbone_close_ephemeral_frames)) {\n CloseStream(frame.stream_id);\n }\n return;\n }\n QuicSession::OnStreamFrame(frame);\n}\n\nvoid QboneSessionBase::OnMessageReceived(quiche::QuicheStringPiece message) {\n ++num_message_packets_;\n ProcessPacketFromPeer(message);\n}\n\nQuicStream* QboneSessionBase::CreateIncomingStream(QuicStreamId id) {\n return ActivateDataStream(CreateDataStream(id));\n}\n\nQuicStream* QboneSessionBase::CreateIncomingStream(PendingStream* \/*pending*\/) {\n QUIC_NOTREACHED();\n return nullptr;\n}\n\nbool QboneSessionBase::ShouldKeepConnectionAlive() const {\n \/\/ QBONE connections stay alive until they're explicitly closed.\n return true;\n}\n\nstd::unique_ptr<QuicStream> QboneSessionBase::CreateDataStream(\n QuicStreamId id) {\n if (crypto_stream_ == nullptr || !crypto_stream_->encryption_established()) {\n \/\/ Encryption not active so no stream created\n return nullptr;\n }\n\n if (IsIncomingStream(id)) {\n ++num_streamed_packets_;\n return std::make_unique<QboneReadOnlyStream>(id, this);\n }\n\n return std::make_unique<QboneWriteOnlyStream>(id, this);\n}\n\nQuicStream* QboneSessionBase::ActivateDataStream(\n std::unique_ptr<QuicStream> stream) {\n \/\/ Transfer ownership of the data stream to the session via ActivateStream().\n QuicStream* raw = stream.get();\n if (stream) {\n \/\/ Make QuicSession take ownership of the stream.\n ActivateStream(std::move(stream));\n }\n return raw;\n}\n\nvoid QboneSessionBase::SendPacketToPeer(quiche::QuicheStringPiece packet) {\n if (crypto_stream_ == nullptr) {\n QUIC_BUG << \"Attempting to send packet before encryption established\";\n return;\n }\n\n if (send_packets_as_messages_) {\n QuicUniqueBufferPtr buffer = MakeUniqueBuffer(\n connection()->helper()->GetStreamSendBufferAllocator(), packet.size());\n memcpy(buffer.get(), packet.data(), packet.size());\n QuicMemSlice slice(std::move(buffer), packet.size());\n switch (SendMessage(QuicMemSliceSpan(&slice), \/*flush=*\/true).status) {\n case MESSAGE_STATUS_SUCCESS:\n break;\n case MESSAGE_STATUS_TOO_LARGE: {\n if (packet.size() < sizeof(ip6_hdr)) {\n QUIC_BUG << \"Dropped malformed packet: IPv6 header too short\";\n break;\n }\n auto* header = reinterpret_cast<const ip6_hdr*>(packet.begin());\n icmp6_hdr icmp_header{};\n icmp_header.icmp6_type = ICMP6_PACKET_TOO_BIG;\n icmp_header.icmp6_mtu =\n connection()->GetGuaranteedLargestMessagePayload();\n\n CreateIcmpPacket(header->ip6_dst, header->ip6_src, icmp_header, packet,\n [this](quiche::QuicheStringPiece icmp_packet) {\n writer_->WritePacketToNetwork(icmp_packet.data(),\n icmp_packet.size());\n });\n break;\n }\n case MESSAGE_STATUS_ENCRYPTION_NOT_ESTABLISHED:\n QUIC_BUG << \"MESSAGE_STATUS_ENCRYPTION_NOT_ESTABLISHED\";\n break;\n case MESSAGE_STATUS_UNSUPPORTED:\n QUIC_BUG << \"MESSAGE_STATUS_UNSUPPORTED\";\n break;\n case MESSAGE_STATUS_BLOCKED:\n QUIC_BUG << \"MESSAGE_STATUS_BLOCKED\";\n break;\n case MESSAGE_STATUS_INTERNAL_ERROR:\n QUIC_BUG << \"MESSAGE_STATUS_INTERNAL_ERROR\";\n break;\n }\n return;\n }\n\n \/\/ QBONE streams are ephemeral.\n QuicStream* stream = CreateOutgoingStream();\n if (!stream) {\n QUIC_BUG << \"Failed to create an outgoing QBONE stream.\";\n return;\n }\n\n QboneWriteOnlyStream* qbone_stream =\n static_cast<QboneWriteOnlyStream*>(stream);\n qbone_stream->WritePacketToQuicStream(packet);\n}\n\nuint64_t QboneSessionBase::GetNumEphemeralPackets() const {\n return num_ephemeral_packets_;\n}\n\nuint64_t QboneSessionBase::GetNumStreamedPackets() const {\n return num_streamed_packets_;\n}\n\nuint64_t QboneSessionBase::GetNumMessagePackets() const {\n return num_message_packets_;\n}\n\nuint64_t QboneSessionBase::GetNumFallbackToStream() const {\n return num_fallback_to_stream_;\n}\n\nvoid QboneSessionBase::set_writer(QbonePacketWriter* writer) {\n writer_ = writer;\n testing::testvalue::Adjust(\"quic_QbonePacketWriter\", &writer_);\n}\n\n} \/\/ namespace quic\n<|endoftext|>"} {"text":"<commit_before>\/***********************************************************************\n filename: CEGUIOgreTexture.cpp\n created: Tue Feb 17 2009\n author: Paul D Turner\n*************************************************************************\/\n\/***************************************************************************\n * Copyright (C) 2004 - 2009 Paul D Turner & The CEGUI Development Team\n *\n * Permission is hereby granted, free of charge, to any person obtaining\n * a copy of this software and associated documentation files (the\n * \"Software\"), to deal in the Software without restriction, including\n * without limitation the rights to use, copy, modify, merge, publish,\n * distribute, sublicense, and\/or sell copies of the Software, and to\n * permit persons to whom the Software is furnished to do so, subject to\n * the following conditions:\n *\n * The above copyright notice and this permission notice shall be\n * included in all copies or substantial portions of the Software.\n *\n * THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND,\n * EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF\n * MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT.\n * IN NO EVENT SHALL THE AUTHORS BE LIABLE FOR ANY CLAIM, DAMAGES OR\n * OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE,\n * ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR\n * OTHER DEALINGS IN THE SOFTWARE.\n ***************************************************************************\/\n#include \"CEGUIOgreTexture.h\"\n#include \"CEGUIExceptions.h\"\n#include \"CEGUISystem.h\"\n#include \"CEGUIImageCodec.h\"\n#include <OgreTextureManager.h>\n\n\/\/ Start of CEGUI namespace section\nnamespace CEGUI\n{\n\/\/----------------------------------------------------------------------------\/\/\n\/\/ Internal function that reverses all bytes in a buffer\nvoid _byteSwap(unsigned char* b, int n)\n{\n register int i = 0;\n register int j = n-1;\n while (i < j)\n std::swap(b[i++], b[j--]);\n}\n#define byteSwap(x) _byteSwap((unsigned char*) &x,sizeof(x))\n\n\/\/----------------------------------------------------------------------------\/\/\nuint32 OgreTexture::d_textureNumber = 0;\n\n\/\/----------------------------------------------------------------------------\/\/\nconst Size& OgreTexture::getSize() const\n{\n return d_size;\n}\n\n\/\/----------------------------------------------------------------------------\/\/\nconst Size& OgreTexture::getOriginalDataSize() const\n{\n return d_dataSize;\n}\n\n\/\/----------------------------------------------------------------------------\/\/\nconst Vector2& OgreTexture::getTexelScaling() const\n{\n return d_texelScaling;\n}\n\n\/\/----------------------------------------------------------------------------\/\/\nvoid OgreTexture::loadFromFile(const String& filename,\n const String& resourceGroup)\n{\n \/\/ get and check existence of CEGUI::System object\n System* sys = System::getSingletonPtr();\n if (!sys)\n throw RendererException(\"OgreTexture::loadFromFile: \"\n \"CEGUI::System object has not been created!\");\n\n \/\/ load file to memory via resource provider\n RawDataContainer texFile;\n sys->getResourceProvider()->loadRawDataContainer(filename, texFile,\n resourceGroup);\n\n Texture* res = sys->getImageCodec().load(texFile, this);\n\n \/\/ unload file data buffer\n sys->getResourceProvider()->unloadRawDataContainer(texFile);\n\n \/\/ throw exception if data was load loaded to texture.\n if (!res)\n throw RendererException(\"OgreTexture::loadFromFile: \" +\n sys->getImageCodec().getIdentifierString()+\n \" failed to load image '\" + filename + \"'.\");\n}\n\n\/\/----------------------------------------------------------------------------\/\/\nvoid OgreTexture::loadFromMemory(const void* buffer, const Size& buffer_size,\n PixelFormat pixel_format)\n{\n using namespace Ogre;\n\n \/\/ get rid of old texture\n freeOgreTexture();\n\n \/\/ wrap input buffer with an Ogre data stream\n const size_t pixel_size = pixel_format == PF_RGBA ? 4 : 3;\n const size_t byte_size = buffer_size.d_width * buffer_size.d_height *\n pixel_size;\n\n#if OGRE_ENDIAN == OGRE_ENDIAN_BIG\n \/\/ FIXME: I think this leaks memory, though need to check!\n unsigned char* swapped_buffer = new unsigned char[byte_size];\n memcpy(swapped_buffer, buffer, byte_size);\n\n for (size_t i = 0; i < byte_size; i += pixel_size)\n _byteSwap(&swapped_buffer[i], pixel_size);\n\n DataStreamPtr odc(new MemoryDataStream(static_cast<void*>(swapped_buffer),\n byte_size, false));\n#else\n DataStreamPtr odc(new MemoryDataStream(const_cast<void*>(buffer),\n byte_size, false));\n#endif\n\n \/\/ get pixel type for the target texture.\n Ogre::PixelFormat target_fmt =\n (pixel_format == PF_RGBA) ? Ogre::PF_A8B8G8R8 : Ogre::PF_B8G8R8;\n\n \/\/ try to create a Ogre::Texture from the input data\n d_texture = TextureManager::getSingleton().loadRawData(\n getUniqueName(), \"General\", odc,\n buffer_size.d_width, buffer_size.d_height,\n target_fmt, TEX_TYPE_2D, 0, 1.0f);\n\n \/\/ throw exception if no texture was able to be created\n if (d_texture.isNull())\n throw RendererException(\"OgreTexture::loadFromMemory: Failed to create \"\n \"Texture object from memory.\");\n\n d_size.d_width = d_texture->getWidth();\n d_size.d_height = d_texture->getHeight();\n d_dataSize = buffer_size;\n updateCachedScaleValues();\n}\n\n\/\/----------------------------------------------------------------------------\/\/\nvoid OgreTexture::saveToMemory(void* buffer)\n{\n \/\/ TODO:\n}\n\n\/\/----------------------------------------------------------------------------\/\/\nOgreTexture::OgreTexture() :\n d_isLinked(false),\n d_size(0, 0),\n d_dataSize(0, 0),\n d_texelScaling(0, 0)\n{\n}\n\n\/\/----------------------------------------------------------------------------\/\/\nOgreTexture::OgreTexture(const String& filename, const String& resourceGroup) :\n d_isLinked(false),\n d_size(0, 0),\n d_dataSize(0, 0),\n d_texelScaling(0, 0)\n{\n loadFromFile(filename, resourceGroup);\n}\n\n\/\/----------------------------------------------------------------------------\/\/\nOgreTexture::OgreTexture(const Size& sz) :\n d_isLinked(false),\n d_size(0, 0),\n d_dataSize(0, 0),\n d_texelScaling(0, 0)\n{\n \/\/ TODO:\n}\n\n\/\/----------------------------------------------------------------------------\/\/\nOgreTexture::OgreTexture(Ogre::TexturePtr& tex, bool take_ownership) :\n d_isLinked(false),\n d_size(0, 0),\n d_dataSize(0, 0),\n d_texelScaling(0, 0)\n{\n setOgreTexture(tex, take_ownership);\n}\n\n\/\/----------------------------------------------------------------------------\/\/\nOgreTexture::~OgreTexture()\n{\n freeOgreTexture();\n}\n\n\/\/----------------------------------------------------------------------------\/\/\nvoid OgreTexture::freeOgreTexture()\n{\n if (!d_texture.isNull() && !d_isLinked)\n Ogre::TextureManager::getSingleton().remove(d_texture->getHandle());\n\n d_texture.setNull();\n}\n\n\/\/----------------------------------------------------------------------------\/\/\nOgre::String OgreTexture::getUniqueName()\n{\n Ogre::StringUtil::StrStreamType strstream;\n strstream << \"_cegui_ogre_\" << d_textureNumber++;\n\n return strstream.str();\n}\n\n\/\/----------------------------------------------------------------------------\/\/\nvoid OgreTexture::updateCachedScaleValues()\n{\n \/\/\n \/\/ calculate what to use for x scale\n \/\/\n const float orgW = d_dataSize.d_width;\n const float texW = d_size.d_width;\n\n \/\/ if texture and original data width are the same, scale is based\n \/\/ on the original size.\n \/\/ if texture is wider (and source data was not stretched), scale\n \/\/ is based on the size of the resulting texture.\n d_texelScaling.d_x = 1.0f \/ ((orgW == texW) ? orgW : texW);\n\n \/\/\n \/\/ calculate what to use for y scale\n \/\/\n const float orgH = d_dataSize.d_height;\n const float texH = d_size.d_height;\n\n \/\/ if texture and original data height are the same, scale is based\n \/\/ on the original size.\n \/\/ if texture is taller (and source data was not stretched), scale\n \/\/ is based on the size of the resulting texture.\n d_texelScaling.d_y = 1.0f \/ ((orgH == texH) ? orgH : texH);\n}\n\n\/\/----------------------------------------------------------------------------\/\/\nvoid OgreTexture::setOgreTexture(Ogre::TexturePtr texture, bool take_ownership)\n{\n freeOgreTexture();\n\n d_texture = texture;\n d_isLinked = !take_ownership;\n\n if (!d_texture.isNull())\n {\n d_size.d_width = d_texture->getWidth();\n d_size.d_height= d_texture->getHeight();\n d_dataSize = d_size;\n }\n else\n d_size = d_dataSize = Size(0, 0);\n\n updateCachedScaleValues();\n}\n\n\/\/----------------------------------------------------------------------------\/\/\nOgre::TexturePtr OgreTexture::getOgreTexture() const\n{\n return d_texture;\n}\n\n\/\/----------------------------------------------------------------------------\/\/\n\n} \/\/ End of CEGUI namespace section\n<commit_msg>ADD: Implement missing parts in Ogre renderer.<commit_after>\/***********************************************************************\n filename: CEGUIOgreTexture.cpp\n created: Tue Feb 17 2009\n author: Paul D Turner\n*************************************************************************\/\n\/***************************************************************************\n * Copyright (C) 2004 - 2009 Paul D Turner & The CEGUI Development Team\n *\n * Permission is hereby granted, free of charge, to any person obtaining\n * a copy of this software and associated documentation files (the\n * \"Software\"), to deal in the Software without restriction, including\n * without limitation the rights to use, copy, modify, merge, publish,\n * distribute, sublicense, and\/or sell copies of the Software, and to\n * permit persons to whom the Software is furnished to do so, subject to\n * the following conditions:\n *\n * The above copyright notice and this permission notice shall be\n * included in all copies or substantial portions of the Software.\n *\n * THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND,\n * EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF\n * MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT.\n * IN NO EVENT SHALL THE AUTHORS BE LIABLE FOR ANY CLAIM, DAMAGES OR\n * OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE,\n * ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR\n * OTHER DEALINGS IN THE SOFTWARE.\n ***************************************************************************\/\n#include \"CEGUIOgreTexture.h\"\n#include \"CEGUIExceptions.h\"\n#include \"CEGUISystem.h\"\n#include \"CEGUIImageCodec.h\"\n#include <OgreTextureManager.h>\n#include <OgreHardwarePixelBuffer.h>\n\n\/\/ Start of CEGUI namespace section\nnamespace CEGUI\n{\n\/\/----------------------------------------------------------------------------\/\/\n\/\/ Internal function that reverses all bytes in a buffer\nvoid _byteSwap(unsigned char* b, int n)\n{\n register int i = 0;\n register int j = n-1;\n while (i < j)\n std::swap(b[i++], b[j--]);\n}\n#define byteSwap(x) _byteSwap((unsigned char*) &x,sizeof(x))\n\n\/\/----------------------------------------------------------------------------\/\/\nuint32 OgreTexture::d_textureNumber = 0;\n\n\/\/----------------------------------------------------------------------------\/\/\nconst Size& OgreTexture::getSize() const\n{\n return d_size;\n}\n\n\/\/----------------------------------------------------------------------------\/\/\nconst Size& OgreTexture::getOriginalDataSize() const\n{\n return d_dataSize;\n}\n\n\/\/----------------------------------------------------------------------------\/\/\nconst Vector2& OgreTexture::getTexelScaling() const\n{\n return d_texelScaling;\n}\n\n\/\/----------------------------------------------------------------------------\/\/\nvoid OgreTexture::loadFromFile(const String& filename,\n const String& resourceGroup)\n{\n \/\/ get and check existence of CEGUI::System object\n System* sys = System::getSingletonPtr();\n if (!sys)\n throw RendererException(\"OgreTexture::loadFromFile: \"\n \"CEGUI::System object has not been created!\");\n\n \/\/ load file to memory via resource provider\n RawDataContainer texFile;\n sys->getResourceProvider()->loadRawDataContainer(filename, texFile,\n resourceGroup);\n\n Texture* res = sys->getImageCodec().load(texFile, this);\n\n \/\/ unload file data buffer\n sys->getResourceProvider()->unloadRawDataContainer(texFile);\n\n \/\/ throw exception if data was load loaded to texture.\n if (!res)\n throw RendererException(\"OgreTexture::loadFromFile: \" +\n sys->getImageCodec().getIdentifierString()+\n \" failed to load image '\" + filename + \"'.\");\n}\n\n\/\/----------------------------------------------------------------------------\/\/\nvoid OgreTexture::loadFromMemory(const void* buffer, const Size& buffer_size,\n PixelFormat pixel_format)\n{\n using namespace Ogre;\n\n \/\/ get rid of old texture\n freeOgreTexture();\n\n \/\/ wrap input buffer with an Ogre data stream\n const size_t pixel_size = pixel_format == PF_RGBA ? 4 : 3;\n const size_t byte_size = buffer_size.d_width * buffer_size.d_height *\n pixel_size;\n\n#if OGRE_ENDIAN == OGRE_ENDIAN_BIG\n \/\/ FIXME: I think this leaks memory, though need to check!\n unsigned char* swapped_buffer = new unsigned char[byte_size];\n memcpy(swapped_buffer, buffer, byte_size);\n\n for (size_t i = 0; i < byte_size; i += pixel_size)\n _byteSwap(&swapped_buffer[i], pixel_size);\n\n DataStreamPtr odc(new MemoryDataStream(static_cast<void*>(swapped_buffer),\n byte_size, false));\n#else\n DataStreamPtr odc(new MemoryDataStream(const_cast<void*>(buffer),\n byte_size, false));\n#endif\n\n \/\/ get pixel type for the target texture.\n Ogre::PixelFormat target_fmt =\n (pixel_format == PF_RGBA) ? Ogre::PF_A8B8G8R8 : Ogre::PF_B8G8R8;\n\n \/\/ try to create a Ogre::Texture from the input data\n d_texture = TextureManager::getSingleton().loadRawData(\n getUniqueName(), \"General\", odc,\n buffer_size.d_width, buffer_size.d_height,\n target_fmt, TEX_TYPE_2D, 0, 1.0f);\n\n \/\/ throw exception if no texture was able to be created\n if (d_texture.isNull())\n throw RendererException(\"OgreTexture::loadFromMemory: Failed to create \"\n \"Texture object from memory.\");\n\n d_size.d_width = d_texture->getWidth();\n d_size.d_height = d_texture->getHeight();\n d_dataSize = buffer_size;\n updateCachedScaleValues();\n}\n\n\/\/----------------------------------------------------------------------------\/\/\nvoid OgreTexture::saveToMemory(void* buffer)\n{\n if (d_texture.isNull())\n return;\n \n Ogre::HardwarePixelBufferSharedPtr src = d_texture->getBuffer();\n\n if (src.isNull())\n throw RendererException(\"OgreTexture::saveToMemory: unable to obtain \"\n \"hardware pixel buffer pointer.\");\n\n const size_t sz = static_cast<size_t>(d_size.d_width * d_size.d_height) * 4;\n src->readData(0, sz, buffer);\n}\n\n\/\/----------------------------------------------------------------------------\/\/\nOgreTexture::OgreTexture() :\n d_isLinked(false),\n d_size(0, 0),\n d_dataSize(0, 0),\n d_texelScaling(0, 0)\n{\n}\n\n\/\/----------------------------------------------------------------------------\/\/\nOgreTexture::OgreTexture(const String& filename, const String& resourceGroup) :\n d_isLinked(false),\n d_size(0, 0),\n d_dataSize(0, 0),\n d_texelScaling(0, 0)\n{\n loadFromFile(filename, resourceGroup);\n}\n\n\/\/----------------------------------------------------------------------------\/\/\nOgreTexture::OgreTexture(const Size& sz) :\n d_isLinked(false),\n d_size(0, 0),\n d_dataSize(0, 0),\n d_texelScaling(0, 0)\n{\n using namespace Ogre;\n\n \/\/ try to create a Ogre::Texture with given dimensions\n d_texture = TextureManager::getSingleton().createManual(\n getUniqueName(), \"General\", TEX_TYPE_2D,\n sz.d_width, sz.d_height, 0,\n Ogre::PF_A8B8G8R8);\n \n \/\/ throw exception if no texture was able to be created\n if (d_texture.isNull())\n throw RendererException(\"OgreTexture: Failed to create Texture object \"\n \"with spcecified size.\");\n \n d_size.d_width = d_texture->getWidth();\n d_size.d_height = d_texture->getHeight();\n d_dataSize = sz;\n updateCachedScaleValues();\n}\n\n\/\/----------------------------------------------------------------------------\/\/\nOgreTexture::OgreTexture(Ogre::TexturePtr& tex, bool take_ownership) :\n d_isLinked(false),\n d_size(0, 0),\n d_dataSize(0, 0),\n d_texelScaling(0, 0)\n{\n setOgreTexture(tex, take_ownership);\n}\n\n\/\/----------------------------------------------------------------------------\/\/\nOgreTexture::~OgreTexture()\n{\n freeOgreTexture();\n}\n\n\/\/----------------------------------------------------------------------------\/\/\nvoid OgreTexture::freeOgreTexture()\n{\n if (!d_texture.isNull() && !d_isLinked)\n Ogre::TextureManager::getSingleton().remove(d_texture->getHandle());\n\n d_texture.setNull();\n}\n\n\/\/----------------------------------------------------------------------------\/\/\nOgre::String OgreTexture::getUniqueName()\n{\n Ogre::StringUtil::StrStreamType strstream;\n strstream << \"_cegui_ogre_\" << d_textureNumber++;\n\n return strstream.str();\n}\n\n\/\/----------------------------------------------------------------------------\/\/\nvoid OgreTexture::updateCachedScaleValues()\n{\n \/\/\n \/\/ calculate what to use for x scale\n \/\/\n const float orgW = d_dataSize.d_width;\n const float texW = d_size.d_width;\n\n \/\/ if texture and original data width are the same, scale is based\n \/\/ on the original size.\n \/\/ if texture is wider (and source data was not stretched), scale\n \/\/ is based on the size of the resulting texture.\n d_texelScaling.d_x = 1.0f \/ ((orgW == texW) ? orgW : texW);\n\n \/\/\n \/\/ calculate what to use for y scale\n \/\/\n const float orgH = d_dataSize.d_height;\n const float texH = d_size.d_height;\n\n \/\/ if texture and original data height are the same, scale is based\n \/\/ on the original size.\n \/\/ if texture is taller (and source data was not stretched), scale\n \/\/ is based on the size of the resulting texture.\n d_texelScaling.d_y = 1.0f \/ ((orgH == texH) ? orgH : texH);\n}\n\n\/\/----------------------------------------------------------------------------\/\/\nvoid OgreTexture::setOgreTexture(Ogre::TexturePtr texture, bool take_ownership)\n{\n freeOgreTexture();\n\n d_texture = texture;\n d_isLinked = !take_ownership;\n\n if (!d_texture.isNull())\n {\n d_size.d_width = d_texture->getWidth();\n d_size.d_height= d_texture->getHeight();\n d_dataSize = d_size;\n }\n else\n d_size = d_dataSize = Size(0, 0);\n\n updateCachedScaleValues();\n}\n\n\/\/----------------------------------------------------------------------------\/\/\nOgre::TexturePtr OgreTexture::getOgreTexture() const\n{\n return d_texture;\n}\n\n\/\/----------------------------------------------------------------------------\/\/\n\n} \/\/ End of CEGUI namespace section\n<|endoftext|>"} {"text":"<commit_before>\/***********************************************************************\n filename: FalSlider.cpp\n created: Sun Jul 3 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 \"FalSlider.h\"\n#include \"falagard\/CEGUIFalWidgetLookManager.h\"\n#include \"falagard\/CEGUIFalWidgetLookFeel.h\"\n#include \"CEGUIWindowManager.h\"\n#include \"elements\/CEGUIThumb.h\"\n\n\/\/ Start of CEGUI namespace section\nnamespace CEGUI\n{\n const utf8 FalagardSlider::TypeName[] = \"Falagard\/Slider\";\n FalagardSliderProperties::VerticalSlider FalagardSlider::d_verticalProperty;\n FalagardSliderProperties::ReversedDirection FalagardSlider::d_reversedProperty;\n\n\n FalagardSlider::FalagardSlider(const String& type) :\n SliderWindowRenderer(type),\n d_vertical(false),\n d_reversed(false)\n {\n registerProperty(&d_verticalProperty);\n registerProperty(&d_reversedProperty);\n }\n\n void FalagardSlider::render()\n {\n const StateImagery* imagery;\n\n \/\/ get WidgetLookFeel for the assigned look.\n const WidgetLookFeel& wlf = getLookNFeel();\n \/\/ try and get imagery for our current state\n imagery = &wlf.getStateImagery(d_window->isDisabled() ? \"Disabled\" : \"Enabled\");\n \/\/ peform the rendering operation.\n imagery->render(*d_window);\n }\n\n void FalagardSlider::performChildWindowLayout()\n {\n updateThumb();\n }\n\n void FalagardSlider::updateThumb(void)\n {\n Slider* w = (Slider*)d_window;\n \/\/ get area the thumb is supposed to use as it's area.\n const WidgetLookFeel& wlf = getLookNFeel();\n Rect area(wlf.getNamedArea(\"ThumbTrackArea\").getArea().getPixelRect(*w));\n \/\/ get accesss to the thumb\n Thumb* theThumb = w->getThumb();\n\n const Size w_pixel_size(w->getPixelSize());\n\n \/\/ get base location for thumb widget\n UVector2 thumbPosition(cegui_reldim(area.d_left \/ w_pixel_size.d_width),\n cegui_reldim(area.d_top \/ w_pixel_size.d_height));\n\n \/\/ Is this a vertical slider\n if (d_vertical)\n {\n \/\/ pixel extent of total available area the thumb moves in\n float slideExtent = area.getHeight() - theThumb->getPixelSize().d_height;\n\n \/\/ Set range of motion for the thumb widget\n if (w_pixel_size.d_height != 0.0f)\n theThumb->setVertRange(area.d_top \/ w_pixel_size.d_height,\n (area.d_top + slideExtent) \/ w_pixel_size.d_height);\n else\n theThumb->setVertRange(0.0f, 0.0f);\n\n \/\/ calculate vertical positon for thumb\n float thumbOffset = w->getCurrentValue() * (slideExtent \/ w->getMaxValue());\n\n if (w_pixel_size.d_height != 0.0f)\n thumbPosition.d_y.d_scale +=\n (d_reversed ? thumbOffset : slideExtent - thumbOffset) \/ w_pixel_size.d_height;\n }\n \/\/ Horizontal slider\n else\n {\n \/\/ pixel extent of total available area the thumb moves in\n float slideExtent = area.getWidth() - theThumb->getPixelSize().d_width;\n\n \/\/ Set range of motion for the thumb widget\n if (w_pixel_size.d_width != 0.0f)\n theThumb->setHorzRange(area.d_left \/ w_pixel_size.d_width,\n (area.d_left + slideExtent) \/ w_pixel_size.d_width);\n else\n theThumb->setHorzRange(0.0f, 0.0f);\n\n\n \/\/ calculate horizontal positon for thumb\n float thumbOffset = w->getCurrentValue() * (slideExtent \/ w->getMaxValue());\n\n if (w_pixel_size.d_width != 0.0f)\n thumbPosition.d_x.d_scale +=\n (d_reversed ? slideExtent - thumbOffset : thumbOffset) \/ w_pixel_size.d_width;\n }\n\n \/\/ set new position for thumb.\n theThumb->setPosition(thumbPosition);\n }\n\n float FalagardSlider::getValueFromThumb(void) const\n {\n Slider* w = (Slider*)d_window;\n \/\/ get area the thumb is supposed to use as it's area.\n const WidgetLookFeel& wlf = getLookNFeel();\n Rect area(wlf.getNamedArea(\"ThumbTrackArea\").getArea().getPixelRect(*w));\n \/\/ get accesss to the thumb\n Thumb* theThumb = w->getThumb();\n\n \/\/ slider is vertical\n if (d_vertical)\n {\n \/\/ pixel extent of total available area the thumb moves in\n float slideExtent = area.getHeight() - theThumb->getPixelSize().d_height;\n \/\/ calculate value represented by current thumb position\n float thumbValue = (theThumb->getYPosition().asAbsolute(w->getPixelSize().d_height) - area.d_top) \/ (slideExtent \/ w->getMaxValue());\n \/\/ return final thumb value according to slider settings\n return d_reversed ? thumbValue : w->getMaxValue() - thumbValue;\n }\n \/\/ slider is horizontal\n else\n {\n \/\/ pixel extent of total available area the thumb moves in\n float slideExtent = area.getWidth() - theThumb->getPixelSize().d_width;\n \/\/ calculate value represented by current thumb position\n float thumbValue = (theThumb->getXPosition().asAbsolute(w->getPixelSize().d_width) - area.d_left) \/ (slideExtent \/ w->getMaxValue());\n \/\/ return final thumb value according to slider settings\n return d_reversed ? w->getMaxValue() - thumbValue : thumbValue;\n }\n }\n\n float FalagardSlider::getAdjustDirectionFromPoint(const Point& pt) const\n {\n Slider* w = (Slider*)d_window;\n Rect absrect(w->getThumb()->getUnclippedOuterRect());\n\n if ((d_vertical && (pt.d_y < absrect.d_top)) ||\n (!d_vertical && (pt.d_x > absrect.d_right)))\n {\n return d_reversed ? -1.0f : 1.0f;\n }\n else if ((d_vertical && (pt.d_y > absrect.d_bottom)) ||\n (!d_vertical && (pt.d_x < absrect.d_left)))\n {\n return d_reversed ? 1.0f : -1.0f;\n }\n else\n {\n return 0;\n }\n }\n\n bool FalagardSlider::isVertical() const\n {\n return d_vertical;\n }\n\n void FalagardSlider::setVertical(bool setting)\n {\n d_vertical = setting;\n }\n\n bool FalagardSlider::isReversedDirection() const\n {\n return d_reversed;\n }\n\n void FalagardSlider::setReversedDirection(bool setting)\n {\n d_reversed = setting;\n }\n\n} \/\/ End of CEGUI namespace section\n<commit_msg>FIX: Divisoin by zero \/ NaN issue with slider where the thumb would end up never getting a correct position. Thanks to Erik Hjortsberg.<commit_after>\/***********************************************************************\n filename: FalSlider.cpp\n created: Sun Jul 3 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 \"FalSlider.h\"\n#include \"falagard\/CEGUIFalWidgetLookManager.h\"\n#include \"falagard\/CEGUIFalWidgetLookFeel.h\"\n#include \"CEGUIWindowManager.h\"\n#include \"elements\/CEGUIThumb.h\"\n\n\/\/ Start of CEGUI namespace section\nnamespace CEGUI\n{\n const utf8 FalagardSlider::TypeName[] = \"Falagard\/Slider\";\n FalagardSliderProperties::VerticalSlider FalagardSlider::d_verticalProperty;\n FalagardSliderProperties::ReversedDirection FalagardSlider::d_reversedProperty;\n\n\n FalagardSlider::FalagardSlider(const String& type) :\n SliderWindowRenderer(type),\n d_vertical(false),\n d_reversed(false)\n {\n registerProperty(&d_verticalProperty);\n registerProperty(&d_reversedProperty);\n }\n\n void FalagardSlider::render()\n {\n const StateImagery* imagery;\n\n \/\/ get WidgetLookFeel for the assigned look.\n const WidgetLookFeel& wlf = getLookNFeel();\n \/\/ try and get imagery for our current state\n imagery = &wlf.getStateImagery(d_window->isDisabled() ? \"Disabled\" : \"Enabled\");\n \/\/ peform the rendering operation.\n imagery->render(*d_window);\n }\n\n void FalagardSlider::performChildWindowLayout()\n {\n updateThumb();\n }\n\n void FalagardSlider::updateThumb(void)\n {\n Slider* w = (Slider*)d_window;\n \/\/ get area the thumb is supposed to use as it's area.\n const WidgetLookFeel& wlf = getLookNFeel();\n Rect area(wlf.getNamedArea(\"ThumbTrackArea\").getArea().getPixelRect(*w));\n \/\/ get accesss to the thumb\n Thumb* theThumb = w->getThumb();\n\n const Size w_pixel_size(w->getPixelSize());\n\n float thumbRelXPos = w_pixel_size.d_width == 0.0f ? 0.0f : (area.d_left \/ w_pixel_size.d_width);\n float thumbRelYPos = w_pixel_size.d_height == 0.0f ? 0.0f : (area.d_top \/ w_pixel_size.d_height);\n \/\/ get base location for thumb widget\n UVector2 thumbPosition(cegui_reldim(thumbRelXPos), cegui_reldim(thumbRelYPos));\n\n \/\/ Is this a vertical slider\n if (d_vertical)\n {\n \/\/ pixel extent of total available area the thumb moves in\n float slideExtent = area.getHeight() - theThumb->getPixelSize().d_height;\n\n \/\/ Set range of motion for the thumb widget\n if (w_pixel_size.d_height != 0.0f)\n theThumb->setVertRange(area.d_top \/ w_pixel_size.d_height,\n (area.d_top + slideExtent) \/ w_pixel_size.d_height);\n else\n theThumb->setVertRange(0.0f, 0.0f);\n\n \/\/ calculate vertical positon for thumb\n float thumbOffset = w->getCurrentValue() * (slideExtent \/ w->getMaxValue());\n\n if (w_pixel_size.d_height != 0.0f)\n thumbPosition.d_y.d_scale +=\n (d_reversed ? thumbOffset : slideExtent - thumbOffset) \/ w_pixel_size.d_height;\n }\n \/\/ Horizontal slider\n else\n {\n \/\/ pixel extent of total available area the thumb moves in\n float slideExtent = area.getWidth() - theThumb->getPixelSize().d_width;\n\n \/\/ Set range of motion for the thumb widget\n if (w_pixel_size.d_width != 0.0f)\n theThumb->setHorzRange(area.d_left \/ w_pixel_size.d_width,\n (area.d_left + slideExtent) \/ w_pixel_size.d_width);\n else\n theThumb->setHorzRange(0.0f, 0.0f);\n\n\n \/\/ calculate horizontal positon for thumb\n float thumbOffset = w->getCurrentValue() * (slideExtent \/ w->getMaxValue());\n\n if (w_pixel_size.d_width != 0.0f)\n thumbPosition.d_x.d_scale +=\n (d_reversed ? slideExtent - thumbOffset : thumbOffset) \/ w_pixel_size.d_width;\n }\n\n \/\/ set new position for thumb.\n theThumb->setPosition(thumbPosition);\n }\n\n float FalagardSlider::getValueFromThumb(void) const\n {\n Slider* w = (Slider*)d_window;\n \/\/ get area the thumb is supposed to use as it's area.\n const WidgetLookFeel& wlf = getLookNFeel();\n Rect area(wlf.getNamedArea(\"ThumbTrackArea\").getArea().getPixelRect(*w));\n \/\/ get accesss to the thumb\n Thumb* theThumb = w->getThumb();\n\n \/\/ slider is vertical\n if (d_vertical)\n {\n \/\/ pixel extent of total available area the thumb moves in\n float slideExtent = area.getHeight() - theThumb->getPixelSize().d_height;\n \/\/ calculate value represented by current thumb position\n float thumbValue = (theThumb->getYPosition().asAbsolute(w->getPixelSize().d_height) - area.d_top) \/ (slideExtent \/ w->getMaxValue());\n \/\/ return final thumb value according to slider settings\n return d_reversed ? thumbValue : w->getMaxValue() - thumbValue;\n }\n \/\/ slider is horizontal\n else\n {\n \/\/ pixel extent of total available area the thumb moves in\n float slideExtent = area.getWidth() - theThumb->getPixelSize().d_width;\n \/\/ calculate value represented by current thumb position\n float thumbValue = (theThumb->getXPosition().asAbsolute(w->getPixelSize().d_width) - area.d_left) \/ (slideExtent \/ w->getMaxValue());\n \/\/ return final thumb value according to slider settings\n return d_reversed ? w->getMaxValue() - thumbValue : thumbValue;\n }\n }\n\n float FalagardSlider::getAdjustDirectionFromPoint(const Point& pt) const\n {\n Slider* w = (Slider*)d_window;\n Rect absrect(w->getThumb()->getUnclippedOuterRect());\n\n if ((d_vertical && (pt.d_y < absrect.d_top)) ||\n (!d_vertical && (pt.d_x > absrect.d_right)))\n {\n return d_reversed ? -1.0f : 1.0f;\n }\n else if ((d_vertical && (pt.d_y > absrect.d_bottom)) ||\n (!d_vertical && (pt.d_x < absrect.d_left)))\n {\n return d_reversed ? 1.0f : -1.0f;\n }\n else\n {\n return 0;\n }\n }\n\n bool FalagardSlider::isVertical() const\n {\n return d_vertical;\n }\n\n void FalagardSlider::setVertical(bool setting)\n {\n d_vertical = setting;\n }\n\n bool FalagardSlider::isReversedDirection() const\n {\n return d_reversed;\n }\n\n void FalagardSlider::setReversedDirection(bool setting)\n {\n d_reversed = setting;\n }\n\n} \/\/ End of CEGUI namespace section\n<|endoftext|>"} {"text":"<commit_before>\/* -*- Mode: C++; tab-width: 4; indent-tabs-mode: nil; c-basic-offset: 4 -*- *\/\n\/*\n * This file is part of the LibreOffice project.\n *\n * This Source Code Form is subject to the terms of the Mozilla Public\n * License, v. 2.0. If a copy of the MPL was not distributed with this\n * file, You can obtain one at http:\/\/mozilla.org\/MPL\/2.0\/.\n *\n * This file incorporates work covered by the following license notice:\n *\n * Licensed to the Apache Software Foundation (ASF) under one or more\n * contributor license agreements. See the NOTICE file distributed\n * with this work for additional information regarding copyright\n * ownership. The ASF licenses this file to you under the Apache\n * License, Version 2.0 (the \"License\"); you may not use this file\n * except in compliance with the License. You may obtain a copy of\n * the License at http:\/\/www.apache.org\/licenses\/LICENSE-2.0 .\n *\/\n#ifndef INCLUDED_CHART2_SOURCE_INC_CHARTVIEW_EXPLICITSCALEVALUES_HXX\n#define INCLUDED_CHART2_SOURCE_INC_CHARTVIEW_EXPLICITSCALEVALUES_HXX\n\n#include \"chartviewdllapi.hxx\"\n#include <com\/sun\/star\/chart\/TimeInterval.hpp>\n#include <com\/sun\/star\/chart\/TimeUnit.hpp>\n#include <com\/sun\/star\/chart2\/AxisOrientation.hpp>\n#include <com\/sun\/star\/chart2\/AxisType.hpp>\n#include <com\/sun\/star\/chart2\/XScaling.hpp>\n#include <tools\/date.hxx>\n#include <vector>\nnamespace chart\n{\n\n\/** This structure contains the explicit values for a scale like Minimum and Maximum.\n See also ::com::sun::star::chart2::ScaleData.\n*\/\n\nstruct OOO_DLLPUBLIC_CHARTVIEW ExplicitScaleData\n{\n ExplicitScaleData();\n\n double Minimum;\n double Maximum;\n double Origin;\n\n ::com::sun::star::chart2::AxisOrientation Orientation;\n\n ::com::sun::star::uno::Reference< ::com::sun::star::chart2::XScaling > Scaling;\n\n sal_Int32 AxisType;\/\/see ::com::sun::star::chart2::AxisType\n bool ShiftedCategoryPosition;\n sal_Int32 TimeResolution; \/\/constant of type <type>::com::sun::star::chart::TimeUnit<\/type>\n Date NullDate;\n};\n\nstruct OOO_DLLPUBLIC_CHARTVIEW ExplicitSubIncrement\n{\n ExplicitSubIncrement();\n\n \/** Numbers of intervals between two superior ticks. For an axis\n this usually means, that <code>IntervalCount - 1<\/code>\n sub-tick-marks are displayed between two superior ticks.\n\n *\/\n sal_Int32 IntervalCount;\n\n \/** If <TRUE\/>, the distance between two sub-tick-marks on the\n screen is always the same. If <FALSE\/>, the distances may\n differ depending on the <type>XScaling<\/type>.\n *\/\n bool PostEquidistant;\n};\n\n\/** describes how tickmarks are positioned on the scale of an axis.\n*\/\nstruct OOO_DLLPUBLIC_CHARTVIEW ExplicitIncrementData\n{\n ExplicitIncrementData();\n\n \/** the following two members are only for date-time axis\n *\/\n ::com::sun::star::chart::TimeInterval MajorTimeInterval;\n ::com::sun::star::chart::TimeInterval MinorTimeInterval;\n\n \/** the other members are for *not* date-time axis\n *\/\n\n \/** <member>Distance<\/member> describes the distance between two\n neighboring main tickmarks on a <type>Scale<\/type> of an axis.\n All neighboring main tickmarks have the same constant distance.\n\n <p>If the Scale has a <type>XScaling<\/type> the <member>Distance<\/member>\n may be measured in two different ways - that is - before or after the\n scaling is applied.<\/p>\n\n <p>On a logarithmic scale for example the distance between two main\n tickmarks is typically measured after the scaling is applied:\n Distance = log(tick2)-log(tick1)\n ( log(1000)-log(100)==log(100)-log(10)==log(10)-log(1)==1==Distance ).\n The resulting tickmarks will always look equidistant on the screen.\n The other possibility is to have a Distance = tick2-tick1 measured constant\n before a scaling is applied, which may lead to non equidistant tickmarks\n on the screen.<\/p>\n\n <p><member>PostEquidistant<\/member> rules whether the <member>Distance<\/member>\n is meant to be a value before or after scaling.<\/p>\n *\/\n double Distance;\n\n \/**\n <member>PostEquidistant<\/member> rules whether the member <member>Distance<\/member>\n describes a distance before or after the scaling is applied.\n\n <p>If <member>PostEquidistant<\/member> equals <TRUE\/> <member>Distance<\/member>\n is given in values after <type>XScaling<\/type> is applied, thus resulting\n main tickmarks will always look equidistant on the screen.\n If <member>PostEquidistant<\/member> equals <FALSE\/> <member>Distance<\/member>\n is given in values before <type>XScaling<\/type> is applied.<\/p>\n *\/\n bool PostEquidistant;\n\n \/** The <member>BaseValue<\/member> gives a starting point on the scale\n to which all further main tickmarks are relatively positioned.\n\n <p>The <member>BaseValue<\/member> is always a value on the scale before\n a possible scaling is applied. If the given value is not valid in the\n associated scaling the minimum of the scaling is assumed,\n if there is no minimum any other obvious value will be assumed.<\/p>\n\n <p>E.g.: assume a scale from 0 to 6 with identical scaling.\n Further assume this Increment to have Distance==2 and PostEquidistant==false.\n Setting BaseValue=0 would lead to main tickmarks 0; 2; 4; 6;\n Setting BaseValue=1,3 would lead to main tickmarks 1,3; 3,3; 5,3;\n Setting BaseValue=-0,7 would also lead to main tickmarks 1,3; 3,3; 5,3;\n And setting BaseValue to 2, -2, 4, -4 etc. in this example\n leads to the same result as BaseValue=0.<\/p>\n *\/\n double BaseValue;\n\n \/** <member>SubIncrements<\/member> describes the positioning of further\n sub tickmarks on the scale of an axis.\n\n <p>The first SubIncrement in this sequence determines how the\n distance between two neighboring main tickmarks is divided for positioning\n of further sub tickmarks. Every following SubIncrement determines the\n positions of subsequent tickmarks in relation to their parent tickmarks\n iven by the preceding SubIncrement.<\/p>\n *\/\n ::std::vector< ExplicitSubIncrement > SubIncrements;\n};\n\n} \/\/namespace chart\n#endif\n\n\/* vim:set shiftwidth=4 softtabstop=4 expandtab: *\/\n<commit_msg>remove whitespace<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_CHART2_SOURCE_INC_CHARTVIEW_EXPLICITSCALEVALUES_HXX\n#define INCLUDED_CHART2_SOURCE_INC_CHARTVIEW_EXPLICITSCALEVALUES_HXX\n\n#include \"chartviewdllapi.hxx\"\n#include <com\/sun\/star\/chart\/TimeInterval.hpp>\n#include <com\/sun\/star\/chart\/TimeUnit.hpp>\n#include <com\/sun\/star\/chart2\/AxisOrientation.hpp>\n#include <com\/sun\/star\/chart2\/AxisType.hpp>\n#include <com\/sun\/star\/chart2\/XScaling.hpp>\n#include <tools\/date.hxx>\n#include <vector>\nnamespace chart\n{\n\n\/** This structure contains the explicit values for a scale like Minimum and Maximum.\n See also ::com::sun::star::chart2::ScaleData.\n*\/\nstruct OOO_DLLPUBLIC_CHARTVIEW ExplicitScaleData\n{\n ExplicitScaleData();\n\n double Minimum;\n double Maximum;\n double Origin;\n\n ::com::sun::star::chart2::AxisOrientation Orientation;\n\n ::com::sun::star::uno::Reference< ::com::sun::star::chart2::XScaling > Scaling;\n\n sal_Int32 AxisType;\/\/see ::com::sun::star::chart2::AxisType\n bool ShiftedCategoryPosition;\n sal_Int32 TimeResolution; \/\/constant of type <type>::com::sun::star::chart::TimeUnit<\/type>\n Date NullDate;\n};\n\nstruct OOO_DLLPUBLIC_CHARTVIEW ExplicitSubIncrement\n{\n ExplicitSubIncrement();\n\n \/** Numbers of intervals between two superior ticks. For an axis\n this usually means, that <code>IntervalCount - 1<\/code>\n sub-tick-marks are displayed between two superior ticks.\n\n *\/\n sal_Int32 IntervalCount;\n\n \/** If <TRUE\/>, the distance between two sub-tick-marks on the\n screen is always the same. If <FALSE\/>, the distances may\n differ depending on the <type>XScaling<\/type>.\n *\/\n bool PostEquidistant;\n};\n\n\/** describes how tickmarks are positioned on the scale of an axis.\n*\/\nstruct OOO_DLLPUBLIC_CHARTVIEW ExplicitIncrementData\n{\n ExplicitIncrementData();\n\n \/** the following two members are only for date-time axis\n *\/\n ::com::sun::star::chart::TimeInterval MajorTimeInterval;\n ::com::sun::star::chart::TimeInterval MinorTimeInterval;\n\n \/** the other members are for *not* date-time axis\n *\/\n\n \/** <member>Distance<\/member> describes the distance between two\n neighboring main tickmarks on a <type>Scale<\/type> of an axis.\n All neighboring main tickmarks have the same constant distance.\n\n <p>If the Scale has a <type>XScaling<\/type> the <member>Distance<\/member>\n may be measured in two different ways - that is - before or after the\n scaling is applied.<\/p>\n\n <p>On a logarithmic scale for example the distance between two main\n tickmarks is typically measured after the scaling is applied:\n Distance = log(tick2)-log(tick1)\n ( log(1000)-log(100)==log(100)-log(10)==log(10)-log(1)==1==Distance ).\n The resulting tickmarks will always look equidistant on the screen.\n The other possibility is to have a Distance = tick2-tick1 measured constant\n before a scaling is applied, which may lead to non equidistant tickmarks\n on the screen.<\/p>\n\n <p><member>PostEquidistant<\/member> rules whether the <member>Distance<\/member>\n is meant to be a value before or after scaling.<\/p>\n *\/\n double Distance;\n\n \/**\n <member>PostEquidistant<\/member> rules whether the member <member>Distance<\/member>\n describes a distance before or after the scaling is applied.\n\n <p>If <member>PostEquidistant<\/member> equals <TRUE\/> <member>Distance<\/member>\n is given in values after <type>XScaling<\/type> is applied, thus resulting\n main tickmarks will always look equidistant on the screen.\n If <member>PostEquidistant<\/member> equals <FALSE\/> <member>Distance<\/member>\n is given in values before <type>XScaling<\/type> is applied.<\/p>\n *\/\n bool PostEquidistant;\n\n \/** The <member>BaseValue<\/member> gives a starting point on the scale\n to which all further main tickmarks are relatively positioned.\n\n <p>The <member>BaseValue<\/member> is always a value on the scale before\n a possible scaling is applied. If the given value is not valid in the\n associated scaling the minimum of the scaling is assumed,\n if there is no minimum any other obvious value will be assumed.<\/p>\n\n <p>E.g.: assume a scale from 0 to 6 with identical scaling.\n Further assume this Increment to have Distance==2 and PostEquidistant==false.\n Setting BaseValue=0 would lead to main tickmarks 0; 2; 4; 6;\n Setting BaseValue=1,3 would lead to main tickmarks 1,3; 3,3; 5,3;\n Setting BaseValue=-0,7 would also lead to main tickmarks 1,3; 3,3; 5,3;\n And setting BaseValue to 2, -2, 4, -4 etc. in this example\n leads to the same result as BaseValue=0.<\/p>\n *\/\n double BaseValue;\n\n \/** <member>SubIncrements<\/member> describes the positioning of further\n sub tickmarks on the scale of an axis.\n\n <p>The first SubIncrement in this sequence determines how the\n distance between two neighboring main tickmarks is divided for positioning\n of further sub tickmarks. Every following SubIncrement determines the\n positions of subsequent tickmarks in relation to their parent tickmarks\n iven by the preceding SubIncrement.<\/p>\n *\/\n ::std::vector< ExplicitSubIncrement > SubIncrements;\n};\n\n} \/\/namespace chart\n#endif\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: RegressionCalculationHelper.hxx,v $\n *\n * $Revision: 1.5 $\n *\n * last change: $Author: ihi $ $Date: 2007-11-23 12:07: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#ifndef CHART2_REGRESSIONCALCULATIONHELPER_HXX\n#define CHART2_REGRESSIONCALCULATIONHELPER_HXX\n\n#ifndef INCLUDED_RTL_MATH_HXX\n#include <rtl\/math.hxx>\n#endif\n\n#include <utility>\n#include <functional>\n#include <vector>\n\n#ifndef INCLUDED_RTL_MATH_HXX\n#include <rtl\/math.hxx>\n#endif\n\n#define NUMBER_TO_STR(number) (::rtl::OStringToOUString(::rtl::math::doubleToString( \\\n number, rtl_math_StringFormat_G, 4, '.', true ),RTL_TEXTENCODING_ASCII_US ))\n\n#define UC_SPACE (sal_Unicode(' '))\n#define UC_MINUS_SIGN (sal_Unicode('-'))\n\/\/ #define UC_MINUS_SIGN (sal_Unicode(0x2212))\n\nnamespace chart\n{\nnamespace RegressionCalculationHelper\n{\n\ntypedef ::std::pair< ::std::vector< double >, ::std::vector< double > > tDoubleVectorPair;\n\n\/** takes the given x- and y-values and copyies them into the resulting pair,\n which contains x-values in the first element and the y-values in the second\n one. All tuples for which aPred is false are not copied.\n\n <p>The functors below provide a set of useful predicates that can be\n used to pass as parameter aPred.<\/p>\n *\/\ntemplate< class Pred >\ntDoubleVectorPair\n cleanup( const ::com::sun::star::uno::Sequence< double > & rXValues,\n const ::com::sun::star::uno::Sequence< double > & rYValues,\n Pred aPred )\n{\n tDoubleVectorPair aResult;\n sal_Int32 nSize = ::std::min( rXValues.getLength(), rYValues.getLength());\n for( sal_Int32 i=0; i<nSize; ++i )\n {\n if( aPred( rXValues[i], rYValues[i] ))\n {\n aResult.first.push_back( rXValues[i] );\n aResult.second.push_back( rYValues[i] );\n }\n }\n\n return aResult;\n}\n\n\nclass isValid : public ::std::binary_function< double, double, bool >\n{\npublic:\n inline bool operator()( double x, double y )\n { return ! ( ::rtl::math::isNan( x ) ||\n ::rtl::math::isNan( y ) ||\n ::rtl::math::isInf( x ) ||\n ::rtl::math::isInf( y ) );\n }\n};\n\nclass isValidAndXPositive : public ::std::binary_function< double, double, bool >\n{\npublic:\n inline bool operator()( double x, double y )\n { return ! ( ::rtl::math::isNan( x ) ||\n ::rtl::math::isNan( y ) ||\n ::rtl::math::isInf( x ) ||\n ::rtl::math::isInf( y ) ||\n x <= 0.0 );\n }\n};\n\nclass isValidAndYPositive : public ::std::binary_function< double, double, bool >\n{\npublic:\n inline bool operator()( double x, double y )\n { return ! ( ::rtl::math::isNan( x ) ||\n ::rtl::math::isNan( y ) ||\n ::rtl::math::isInf( x ) ||\n ::rtl::math::isInf( y ) ||\n y <= 0.0 );\n }\n};\n\nclass isValidAndBothPositive : public ::std::binary_function< double, double, bool >\n{\npublic:\n inline bool operator()( double x, double y )\n { return ! ( ::rtl::math::isNan( x ) ||\n ::rtl::math::isNan( y ) ||\n ::rtl::math::isInf( x ) ||\n ::rtl::math::isInf( y ) ||\n x <= 0.0 ||\n y <= 0.0 );\n }\n};\n\n} \/\/ namespace RegressionCalculationHelper\n} \/\/ namespace chart\n\n\/\/ CHART2_REGRESSIONCALCULATIONHELPER_HXX\n#endif\n<commit_msg>INTEGRATION: CWS changefileheader (1.5.60); FILE MERGED 2008\/04\/01 15:04:23 thb 1.5.60.2: #i85898# Stripping all external header guards 2008\/03\/28 16:44:24 rt 1.5.60.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: RegressionCalculationHelper.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 CHART2_REGRESSIONCALCULATIONHELPER_HXX\n#define CHART2_REGRESSIONCALCULATIONHELPER_HXX\n\n#include <rtl\/math.hxx>\n\n#include <utility>\n#include <functional>\n#include <vector>\n#include <rtl\/math.hxx>\n\n#define NUMBER_TO_STR(number) (::rtl::OStringToOUString(::rtl::math::doubleToString( \\\n number, rtl_math_StringFormat_G, 4, '.', true ),RTL_TEXTENCODING_ASCII_US ))\n\n#define UC_SPACE (sal_Unicode(' '))\n#define UC_MINUS_SIGN (sal_Unicode('-'))\n\/\/ #define UC_MINUS_SIGN (sal_Unicode(0x2212))\n\nnamespace chart\n{\nnamespace RegressionCalculationHelper\n{\n\ntypedef ::std::pair< ::std::vector< double >, ::std::vector< double > > tDoubleVectorPair;\n\n\/** takes the given x- and y-values and copyies them into the resulting pair,\n which contains x-values in the first element and the y-values in the second\n one. All tuples for which aPred is false are not copied.\n\n <p>The functors below provide a set of useful predicates that can be\n used to pass as parameter aPred.<\/p>\n *\/\ntemplate< class Pred >\ntDoubleVectorPair\n cleanup( const ::com::sun::star::uno::Sequence< double > & rXValues,\n const ::com::sun::star::uno::Sequence< double > & rYValues,\n Pred aPred )\n{\n tDoubleVectorPair aResult;\n sal_Int32 nSize = ::std::min( rXValues.getLength(), rYValues.getLength());\n for( sal_Int32 i=0; i<nSize; ++i )\n {\n if( aPred( rXValues[i], rYValues[i] ))\n {\n aResult.first.push_back( rXValues[i] );\n aResult.second.push_back( rYValues[i] );\n }\n }\n\n return aResult;\n}\n\n\nclass isValid : public ::std::binary_function< double, double, bool >\n{\npublic:\n inline bool operator()( double x, double y )\n { return ! ( ::rtl::math::isNan( x ) ||\n ::rtl::math::isNan( y ) ||\n ::rtl::math::isInf( x ) ||\n ::rtl::math::isInf( y ) );\n }\n};\n\nclass isValidAndXPositive : public ::std::binary_function< double, double, bool >\n{\npublic:\n inline bool operator()( double x, double y )\n { return ! ( ::rtl::math::isNan( x ) ||\n ::rtl::math::isNan( y ) ||\n ::rtl::math::isInf( x ) ||\n ::rtl::math::isInf( y ) ||\n x <= 0.0 );\n }\n};\n\nclass isValidAndYPositive : public ::std::binary_function< double, double, bool >\n{\npublic:\n inline bool operator()( double x, double y )\n { return ! ( ::rtl::math::isNan( x ) ||\n ::rtl::math::isNan( y ) ||\n ::rtl::math::isInf( x ) ||\n ::rtl::math::isInf( y ) ||\n y <= 0.0 );\n }\n};\n\nclass isValidAndBothPositive : public ::std::binary_function< double, double, bool >\n{\npublic:\n inline bool operator()( double x, double y )\n { return ! ( ::rtl::math::isNan( x ) ||\n ::rtl::math::isNan( y ) ||\n ::rtl::math::isInf( x ) ||\n ::rtl::math::isInf( y ) ||\n x <= 0.0 ||\n y <= 0.0 );\n }\n};\n\n} \/\/ namespace RegressionCalculationHelper\n} \/\/ namespace chart\n\n\/\/ CHART2_REGRESSIONCALCULATIONHELPER_HXX\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 \"build\/build_config.h\"\n\n#if defined(TOOLKIT_GTK)\n#include <gtk\/gtk.h>\n#endif\n\n#include \"base\/gfx\/rect.h\"\n#include \"base\/gfx\/size.h\"\n#include \"chrome\/browser\/browser.h\"\n#include \"chrome\/browser\/browser_window.h\"\n#include \"chrome\/browser\/extensions\/browser_action_test_util.h\"\n#include \"chrome\/browser\/extensions\/extension_apitest.h\"\n#include \"chrome\/browser\/extensions\/extension_browser_event_router.h\"\n#include \"chrome\/browser\/extensions\/extension_tabs_module.h\"\n#include \"chrome\/browser\/extensions\/extensions_service.h\"\n#include \"chrome\/browser\/profile.h\"\n#include \"chrome\/browser\/tab_contents\/tab_contents.h\"\n#include \"chrome\/common\/extensions\/extension_action.h\"\n#include \"chrome\/test\/ui_test_utils.h\"\n\nstatic const int kTimeoutMs = 60 * 1000; \/\/ 1 minute\n\nclass BrowserActionApiTest : public ExtensionApiTest {\n public:\n BrowserActionApiTest() {}\n virtual ~BrowserActionApiTest() {}\n\n protected:\n BrowserActionTestUtil GetBrowserActionsBar() {\n return BrowserActionTestUtil(browser());\n }\n\n gfx::Rect OpenPopup(int index) {\n {\n NotificationRegistrar registrar;\n registrar.Add(this, NotificationType::EXTENSION_HOST_DID_STOP_LOADING,\n NotificationService::AllSources());\n GetBrowserActionsBar().Press(index);\n \/\/ If the popup is already showing then we needn't wait for the\n \/\/ notification before proceeding.\n if (!GetBrowserActionsBar().HasPopup()) {\n MessageLoop::current()->PostDelayedTask(\n FROM_HERE, new MessageLoop::QuitTask, kTimeoutMs);\n }\n ui_test_utils::RunMessageLoop();\n }\n EXPECT_TRUE(GetBrowserActionsBar().HasPopup());\n return GetBrowserActionsBar().GetPopupBounds();\n }\n};\n\nIN_PROC_BROWSER_TEST_F(BrowserActionApiTest, Basic) {\n StartHTTPServer();\n ASSERT_TRUE(RunExtensionTest(\"browser_action\/basics\")) << message_;\n\n \/\/ Test that there is a browser action in the toolbar.\n ASSERT_EQ(1, GetBrowserActionsBar().NumberOfBrowserActions());\n\n \/\/ Tell the extension to update the browser action state.\n ResultCatcher catcher;\n ExtensionsService* service = browser()->profile()->GetExtensionsService();\n Extension* extension = service->extensions()->at(0);\n ui_test_utils::NavigateToURL(browser(),\n GURL(extension->GetResourceURL(\"update.html\")));\n ASSERT_TRUE(catcher.GetNextResult());\n\n \/\/ Test that we received the changes.\n ExtensionAction* action = extension->browser_action();\n ASSERT_EQ(\"Modified\", action->GetTitle(ExtensionAction::kDefaultTabId));\n ASSERT_EQ(\"badge\", action->GetBadgeText(ExtensionAction::kDefaultTabId));\n ASSERT_EQ(SkColorSetARGB(255, 255, 255, 255),\n action->GetBadgeBackgroundColor(ExtensionAction::kDefaultTabId));\n\n \/\/ Simulate the browser action being clicked.\n ui_test_utils::NavigateToURL(browser(),\n GURL(\"http:\/\/localhost:1337\/files\/extensions\/test_file.txt\"));\n\n ExtensionBrowserEventRouter::GetInstance()->BrowserActionExecuted(\n browser()->profile(), action->extension_id(), browser());\n\n \/\/ Verify the command worked.\n TabContents* tab = browser()->GetSelectedTabContents();\n bool result = false;\n ui_test_utils::ExecuteJavaScriptAndExtractBool(\n tab->render_view_host(), L\"\",\n L\"setInterval(function(){\"\n L\" if(document.body.bgColor == 'red'){\"\n L\" window.domAutomationController.send(true)}}, 100)\",\n &result);\n ASSERT_TRUE(result);\n}\n\nIN_PROC_BROWSER_TEST_F(BrowserActionApiTest, DynamicBrowserAction) {\n ASSERT_TRUE(RunExtensionTest(\"browser_action\/no_icon\")) << message_;\n\n \/\/ Test that there is a browser action in the toolbar and that it has no icon.\n ASSERT_EQ(1, GetBrowserActionsBar().NumberOfBrowserActions());\n EXPECT_FALSE(GetBrowserActionsBar().HasIcon(0));\n\n \/\/ Tell the extension to update the icon using setIcon({imageData:...}).\n ResultCatcher catcher;\n ExtensionsService* service = browser()->profile()->GetExtensionsService();\n Extension* extension = service->extensions()->at(0);\n ui_test_utils::NavigateToURL(browser(),\n GURL(extension->GetResourceURL(\"update.html\")));\n ASSERT_TRUE(catcher.GetNextResult());\n\n \/\/ Test that we received the changes.\n EXPECT_TRUE(GetBrowserActionsBar().HasIcon(0));\n\n \/\/ Tell the extension to update using setIcon({path:...});\n ui_test_utils::NavigateToURL(browser(),\n GURL(extension->GetResourceURL(\"update2.html\")));\n ASSERT_TRUE(catcher.GetNextResult());\n\n \/\/ Test that we received the changes.\n EXPECT_TRUE(GetBrowserActionsBar().HasIcon(0));\n\n \/\/ TODO(aa): Would be nice here to actually compare that the pixels change.\n}\n\nIN_PROC_BROWSER_TEST_F(BrowserActionApiTest, TabSpecificBrowserActionState) {\n ASSERT_TRUE(RunExtensionTest(\"browser_action\/tab_specific_state\")) <<\n message_;\n\n \/\/ Test that there is a browser action in the toolbar and that it has an icon.\n ASSERT_EQ(1, GetBrowserActionsBar().NumberOfBrowserActions());\n EXPECT_TRUE(GetBrowserActionsBar().HasIcon(0));\n\n \/\/ Execute the action, its title should change.\n ResultCatcher catcher;\n GetBrowserActionsBar().Press(0);\n ASSERT_TRUE(catcher.GetNextResult());\n EXPECT_EQ(\"Showing icon 2\", GetBrowserActionsBar().GetTooltip(0));\n\n \/\/ Open a new tab, the title should go back.\n browser()->NewTab();\n EXPECT_EQ(\"hi!\", GetBrowserActionsBar().GetTooltip(0));\n\n \/\/ Go back to first tab, changed title should reappear.\n browser()->SelectTabContentsAt(0, true);\n EXPECT_EQ(\"Showing icon 2\", GetBrowserActionsBar().GetTooltip(0));\n\n \/\/ Reload that tab, default title should come back.\n ui_test_utils::NavigateToURL(browser(), GURL(\"about:blank\"));\n EXPECT_EQ(\"hi!\", GetBrowserActionsBar().GetTooltip(0));\n}\n\nIN_PROC_BROWSER_TEST_F(BrowserActionApiTest, BrowserActionPopup) {\n ASSERT_TRUE(LoadExtension(test_data_dir_.AppendASCII(\n \"browser_action\/popup\")));\n\n \/\/ The extension's popup's size grows by |growFactor| each click.\n const int growFactor = 500;\n gfx::Size minSize = BrowserActionTestUtil::GetMinPopupSize();\n gfx::Size maxSize = BrowserActionTestUtil::GetMaxPopupSize();\n\n \/\/ Ensure that two clicks will exceed the maximum allowed size.\n ASSERT_GT(minSize.height() + growFactor * 2, maxSize.height());\n ASSERT_GT(minSize.width() + growFactor * 2, maxSize.width());\n\n \/\/ Simulate a click on the browser action and verify the size of the resulting\n \/\/ popup. The first one tries to be 0x0, so it should be the min values.\n gfx::Rect bounds = OpenPopup(0);\n EXPECT_EQ(minSize, bounds.size());\n EXPECT_TRUE(GetBrowserActionsBar().HidePopup());\n\n bounds = OpenPopup(0);\n EXPECT_EQ(gfx::Size(growFactor, growFactor), bounds.size());\n EXPECT_TRUE(GetBrowserActionsBar().HidePopup());\n\n \/\/ One more time, but this time it should be constrained by the max values.\n bounds = OpenPopup(0);\n EXPECT_EQ(maxSize, bounds.size());\n EXPECT_TRUE(GetBrowserActionsBar().HidePopup());\n}\n<commit_msg>Mark ExtensionApiTest.BrowserActionPopup as flaky.<commit_after>\/\/ Copyright (c) 2009 The Chromium Authors. All rights reserved.\n\/\/ Use of this source code is governed by a BSD-style license that can be\n\/\/ found in the LICENSE file.\n\n#include \"build\/build_config.h\"\n\n#if defined(TOOLKIT_GTK)\n#include <gtk\/gtk.h>\n#endif\n\n#include \"base\/gfx\/rect.h\"\n#include \"base\/gfx\/size.h\"\n#include \"chrome\/browser\/browser.h\"\n#include \"chrome\/browser\/browser_window.h\"\n#include \"chrome\/browser\/extensions\/browser_action_test_util.h\"\n#include \"chrome\/browser\/extensions\/extension_apitest.h\"\n#include \"chrome\/browser\/extensions\/extension_browser_event_router.h\"\n#include \"chrome\/browser\/extensions\/extension_tabs_module.h\"\n#include \"chrome\/browser\/extensions\/extensions_service.h\"\n#include \"chrome\/browser\/profile.h\"\n#include \"chrome\/browser\/tab_contents\/tab_contents.h\"\n#include \"chrome\/common\/extensions\/extension_action.h\"\n#include \"chrome\/test\/ui_test_utils.h\"\n\nstatic const int kTimeoutMs = 60 * 1000; \/\/ 1 minute\n\nclass BrowserActionApiTest : public ExtensionApiTest {\n public:\n BrowserActionApiTest() {}\n virtual ~BrowserActionApiTest() {}\n\n protected:\n BrowserActionTestUtil GetBrowserActionsBar() {\n return BrowserActionTestUtil(browser());\n }\n\n gfx::Rect OpenPopup(int index) {\n {\n NotificationRegistrar registrar;\n registrar.Add(this, NotificationType::EXTENSION_HOST_DID_STOP_LOADING,\n NotificationService::AllSources());\n GetBrowserActionsBar().Press(index);\n \/\/ If the popup is already showing then we needn't wait for the\n \/\/ notification before proceeding.\n if (!GetBrowserActionsBar().HasPopup()) {\n MessageLoop::current()->PostDelayedTask(\n FROM_HERE, new MessageLoop::QuitTask, kTimeoutMs);\n }\n ui_test_utils::RunMessageLoop();\n }\n EXPECT_TRUE(GetBrowserActionsBar().HasPopup());\n return GetBrowserActionsBar().GetPopupBounds();\n }\n};\n\nIN_PROC_BROWSER_TEST_F(BrowserActionApiTest, Basic) {\n StartHTTPServer();\n ASSERT_TRUE(RunExtensionTest(\"browser_action\/basics\")) << message_;\n\n \/\/ Test that there is a browser action in the toolbar.\n ASSERT_EQ(1, GetBrowserActionsBar().NumberOfBrowserActions());\n\n \/\/ Tell the extension to update the browser action state.\n ResultCatcher catcher;\n ExtensionsService* service = browser()->profile()->GetExtensionsService();\n Extension* extension = service->extensions()->at(0);\n ui_test_utils::NavigateToURL(browser(),\n GURL(extension->GetResourceURL(\"update.html\")));\n ASSERT_TRUE(catcher.GetNextResult());\n\n \/\/ Test that we received the changes.\n ExtensionAction* action = extension->browser_action();\n ASSERT_EQ(\"Modified\", action->GetTitle(ExtensionAction::kDefaultTabId));\n ASSERT_EQ(\"badge\", action->GetBadgeText(ExtensionAction::kDefaultTabId));\n ASSERT_EQ(SkColorSetARGB(255, 255, 255, 255),\n action->GetBadgeBackgroundColor(ExtensionAction::kDefaultTabId));\n\n \/\/ Simulate the browser action being clicked.\n ui_test_utils::NavigateToURL(browser(),\n GURL(\"http:\/\/localhost:1337\/files\/extensions\/test_file.txt\"));\n\n ExtensionBrowserEventRouter::GetInstance()->BrowserActionExecuted(\n browser()->profile(), action->extension_id(), browser());\n\n \/\/ Verify the command worked.\n TabContents* tab = browser()->GetSelectedTabContents();\n bool result = false;\n ui_test_utils::ExecuteJavaScriptAndExtractBool(\n tab->render_view_host(), L\"\",\n L\"setInterval(function(){\"\n L\" if(document.body.bgColor == 'red'){\"\n L\" window.domAutomationController.send(true)}}, 100)\",\n &result);\n ASSERT_TRUE(result);\n}\n\nIN_PROC_BROWSER_TEST_F(BrowserActionApiTest, DynamicBrowserAction) {\n ASSERT_TRUE(RunExtensionTest(\"browser_action\/no_icon\")) << message_;\n\n \/\/ Test that there is a browser action in the toolbar and that it has no icon.\n ASSERT_EQ(1, GetBrowserActionsBar().NumberOfBrowserActions());\n EXPECT_FALSE(GetBrowserActionsBar().HasIcon(0));\n\n \/\/ Tell the extension to update the icon using setIcon({imageData:...}).\n ResultCatcher catcher;\n ExtensionsService* service = browser()->profile()->GetExtensionsService();\n Extension* extension = service->extensions()->at(0);\n ui_test_utils::NavigateToURL(browser(),\n GURL(extension->GetResourceURL(\"update.html\")));\n ASSERT_TRUE(catcher.GetNextResult());\n\n \/\/ Test that we received the changes.\n EXPECT_TRUE(GetBrowserActionsBar().HasIcon(0));\n\n \/\/ Tell the extension to update using setIcon({path:...});\n ui_test_utils::NavigateToURL(browser(),\n GURL(extension->GetResourceURL(\"update2.html\")));\n ASSERT_TRUE(catcher.GetNextResult());\n\n \/\/ Test that we received the changes.\n EXPECT_TRUE(GetBrowserActionsBar().HasIcon(0));\n\n \/\/ TODO(aa): Would be nice here to actually compare that the pixels change.\n}\n\nIN_PROC_BROWSER_TEST_F(BrowserActionApiTest, TabSpecificBrowserActionState) {\n ASSERT_TRUE(RunExtensionTest(\"browser_action\/tab_specific_state\")) <<\n message_;\n\n \/\/ Test that there is a browser action in the toolbar and that it has an icon.\n ASSERT_EQ(1, GetBrowserActionsBar().NumberOfBrowserActions());\n EXPECT_TRUE(GetBrowserActionsBar().HasIcon(0));\n\n \/\/ Execute the action, its title should change.\n ResultCatcher catcher;\n GetBrowserActionsBar().Press(0);\n ASSERT_TRUE(catcher.GetNextResult());\n EXPECT_EQ(\"Showing icon 2\", GetBrowserActionsBar().GetTooltip(0));\n\n \/\/ Open a new tab, the title should go back.\n browser()->NewTab();\n EXPECT_EQ(\"hi!\", GetBrowserActionsBar().GetTooltip(0));\n\n \/\/ Go back to first tab, changed title should reappear.\n browser()->SelectTabContentsAt(0, true);\n EXPECT_EQ(\"Showing icon 2\", GetBrowserActionsBar().GetTooltip(0));\n\n \/\/ Reload that tab, default title should come back.\n ui_test_utils::NavigateToURL(browser(), GURL(\"about:blank\"));\n EXPECT_EQ(\"hi!\", GetBrowserActionsBar().GetTooltip(0));\n}\n\nIN_PROC_BROWSER_TEST_F(BrowserActionApiTest, FLAKY_BrowserActionPopup) {\n ASSERT_TRUE(LoadExtension(test_data_dir_.AppendASCII(\n \"browser_action\/popup\")));\n\n \/\/ The extension's popup's size grows by |growFactor| each click.\n const int growFactor = 500;\n gfx::Size minSize = BrowserActionTestUtil::GetMinPopupSize();\n gfx::Size maxSize = BrowserActionTestUtil::GetMaxPopupSize();\n\n \/\/ Ensure that two clicks will exceed the maximum allowed size.\n ASSERT_GT(minSize.height() + growFactor * 2, maxSize.height());\n ASSERT_GT(minSize.width() + growFactor * 2, maxSize.width());\n\n \/\/ Simulate a click on the browser action and verify the size of the resulting\n \/\/ popup. The first one tries to be 0x0, so it should be the min values.\n gfx::Rect bounds = OpenPopup(0);\n EXPECT_EQ(minSize, bounds.size());\n EXPECT_TRUE(GetBrowserActionsBar().HidePopup());\n\n bounds = OpenPopup(0);\n EXPECT_EQ(gfx::Size(growFactor, growFactor), bounds.size());\n EXPECT_TRUE(GetBrowserActionsBar().HidePopup());\n\n \/\/ One more time, but this time it should be constrained by the max values.\n bounds = OpenPopup(0);\n EXPECT_EQ(maxSize, bounds.size());\n EXPECT_TRUE(GetBrowserActionsBar().HidePopup());\n}\n<|endoftext|>"} {"text":"<commit_before>\/\/ Copyright (c) 2011 The Chromium Authors. All rights reserved.\n\/\/ Use of this source code is governed by a BSD-style license that can be\n\/\/ found in the LICENSE file.\n\n#include \"chrome\/browser\/extensions\/extension_apitest.h\"\n#include \"net\/base\/mock_host_resolver.h\"\n\nclass ExecuteScriptApiTest : public ExtensionApiTest {\n protected:\n void SetupDelayedHostResolver() {\n \/\/ We need a.com to be a little bit slow to trigger a race condition.\n host_resolver()->AddRuleWithLatency(\"a.com\", \"127.0.0.1\", 500);\n host_resolver()->AddRule(\"b.com\", \"127.0.0.1\");\n host_resolver()->AddRule(\"c.com\", \"127.0.0.1\");\n }\n};\n\nIN_PROC_BROWSER_TEST_F(ExecuteScriptApiTest, ExecuteScriptBasic) {\n SetupDelayedHostResolver();\n ASSERT_TRUE(StartTestServer());\n ASSERT_TRUE(RunExtensionTest(\"executescript\/basic\")) << message_;\n}\n\nIN_PROC_BROWSER_TEST_F(ExecuteScriptApiTest, ExecuteScriptInFrame) {\n SetupDelayedHostResolver();\n ASSERT_TRUE(StartTestServer());\n ASSERT_TRUE(RunExtensionTest(\"executescript\/in_frame\")) << message_;\n}\n\nIN_PROC_BROWSER_TEST_F(ExecuteScriptApiTest, ExecuteScriptPermissions) {\n SetupDelayedHostResolver();\n ASSERT_TRUE(StartTestServer());\n ASSERT_TRUE(RunExtensionTest(\"executescript\/permissions\")) << message_;\n}\n\n\/\/ http:\/\/crbug.com\/84760\n#if defined(OS_CHROMEOS)\n#define MAYBE_ExecuteScriptFileAfterClose DISABLED_ExecuteScriptFileAfterClose\n#else\n#define MAYBE_ExecuteScriptFileAfterClose ExecuteScriptFileAfterClose\n#endif \/\/ defined(OS_CHROMEOS)\n\nIN_PROC_BROWSER_TEST_F(ExecuteScriptApiTest,\n MAYBE_ExecuteScriptFileAfterClose) {\n host_resolver()->AddRule(\"b.com\", \"127.0.0.1\");\n ASSERT_TRUE(StartTestServer());\n ASSERT_TRUE(RunExtensionTest(\"executescript\/file_after_close\")) << message_;\n}\n\n\/\/ Crashy, http:\/\/crbug.com\/67774.\nIN_PROC_BROWSER_TEST_F(ExecuteScriptApiTest,\n DISABLED_ExecuteScriptFragmentNavigation) {\n ASSERT_TRUE(StartTestServer());\n const char* extension_name = \"executescript\/fragment\";\n ASSERT_TRUE(RunExtensionTest(extension_name)) << message_;\n}\n\nIN_PROC_BROWSER_TEST_F(ExecuteScriptApiTest, NavigationRaceExecuteScript) {\n host_resolver()->AddRule(\"a.com\", \"127.0.0.1\");\n host_resolver()->AddRule(\"b.com\", \"127.0.0.1\");\n ASSERT_TRUE(StartTestServer());\n ASSERT_TRUE(RunExtensionSubtest(\"executescript\/navigation_race\",\n \"execute_script.html\")) << message_;\n}\n\n\n#if defined(OS_LINUX)\n\/\/ Fails on Linux. http:\/\/crbug.com\/89731\n#define MAYBE_NavigationRaceJavaScriptUrl DISABLED_NavigationRaceJavaScriptUrl\n#else\n#define MAYBE_NavigationRaceJavaScriptUrl NavigationRaceJavaScriptUrl\n#endif\n\nIN_PROC_BROWSER_TEST_F(ExecuteScriptApiTest,\n MAYBE_NavigationRaceJavaScriptUrl) {\n host_resolver()->AddRule(\"a.com\", \"127.0.0.1\");\n host_resolver()->AddRule(\"b.com\", \"127.0.0.1\");\n ASSERT_TRUE(StartTestServer());\n ASSERT_TRUE(RunExtensionSubtest(\"executescript\/navigation_race\",\n \"javascript_url.html\")) << message_;\n}\n\nIN_PROC_BROWSER_TEST_F(ExecuteScriptApiTest, ExecuteScriptFrameAfterLoad) {\n SetupDelayedHostResolver();\n ASSERT_TRUE(StartTestServer());\n ASSERT_TRUE(RunExtensionTest(\"executescript\/frame_after_load\")) << message_;\n}\n<commit_msg>Disable cros tests on trunk.<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\n\/\/ DISABLED http:\/\/crbug.com\/92105\n#if defined(OS_CHROMEOS)\n#define MAYBE_ExecuteScriptBasic DISABLED_ExecuteScriptBasic\n#else\n#define MAYBE_ExecuteScriptBasic ExecuteScriptBasic\n#endif \/\/ defined(OS_CHROMEOS)\n\nIN_PROC_BROWSER_TEST_F(ExecuteScriptApiTest, MAYBE_ExecuteScriptBasic) {\n SetupDelayedHostResolver();\n ASSERT_TRUE(StartTestServer());\n ASSERT_TRUE(RunExtensionTest(\"executescript\/basic\")) << message_;\n}\n\n\/\/ DISABLED http:\/\/crbug.com\/92105\n#if defined(OS_CHROMEOS)\n#define MAYBE_ExecuteScriptInFrame DISABLED_ExecuteScriptInFrame\n#else\n#define MAYBE_ExecuteScriptInFrame ExecuteScriptInFrame\n#endif \/\/ defined(OS_CHROMEOS)\n\nIN_PROC_BROWSER_TEST_F(ExecuteScriptApiTest, MAYBE_ExecuteScriptInFrame) {\n SetupDelayedHostResolver();\n ASSERT_TRUE(StartTestServer());\n ASSERT_TRUE(RunExtensionTest(\"executescript\/in_frame\")) << message_;\n}\n\nIN_PROC_BROWSER_TEST_F(ExecuteScriptApiTest, ExecuteScriptPermissions) {\n SetupDelayedHostResolver();\n ASSERT_TRUE(StartTestServer());\n ASSERT_TRUE(RunExtensionTest(\"executescript\/permissions\")) << message_;\n}\n\n\/\/ http:\/\/crbug.com\/84760\n#if defined(OS_CHROMEOS)\n#define MAYBE_ExecuteScriptFileAfterClose DISABLED_ExecuteScriptFileAfterClose\n#else\n#define MAYBE_ExecuteScriptFileAfterClose ExecuteScriptFileAfterClose\n#endif \/\/ defined(OS_CHROMEOS)\n\nIN_PROC_BROWSER_TEST_F(ExecuteScriptApiTest,\n MAYBE_ExecuteScriptFileAfterClose) {\n host_resolver()->AddRule(\"b.com\", \"127.0.0.1\");\n ASSERT_TRUE(StartTestServer());\n ASSERT_TRUE(RunExtensionTest(\"executescript\/file_after_close\")) << message_;\n}\n\n\/\/ Crashy, http:\/\/crbug.com\/67774.\nIN_PROC_BROWSER_TEST_F(ExecuteScriptApiTest,\n DISABLED_ExecuteScriptFragmentNavigation) {\n ASSERT_TRUE(StartTestServer());\n const char* extension_name = \"executescript\/fragment\";\n ASSERT_TRUE(RunExtensionTest(extension_name)) << message_;\n}\n\nIN_PROC_BROWSER_TEST_F(ExecuteScriptApiTest, NavigationRaceExecuteScript) {\n host_resolver()->AddRule(\"a.com\", \"127.0.0.1\");\n host_resolver()->AddRule(\"b.com\", \"127.0.0.1\");\n ASSERT_TRUE(StartTestServer());\n ASSERT_TRUE(RunExtensionSubtest(\"executescript\/navigation_race\",\n \"execute_script.html\")) << message_;\n}\n\n\n#if defined(OS_LINUX)\n\/\/ Fails on Linux. http:\/\/crbug.com\/89731\n#define MAYBE_NavigationRaceJavaScriptUrl DISABLED_NavigationRaceJavaScriptUrl\n#else\n#define MAYBE_NavigationRaceJavaScriptUrl NavigationRaceJavaScriptUrl\n#endif\n\nIN_PROC_BROWSER_TEST_F(ExecuteScriptApiTest,\n MAYBE_NavigationRaceJavaScriptUrl) {\n host_resolver()->AddRule(\"a.com\", \"127.0.0.1\");\n host_resolver()->AddRule(\"b.com\", \"127.0.0.1\");\n ASSERT_TRUE(StartTestServer());\n ASSERT_TRUE(RunExtensionSubtest(\"executescript\/navigation_race\",\n \"javascript_url.html\")) << message_;\n}\n\n\/\/ DISABLED http:\/\/crbug.com\/92105\n#if defined(OS_CHROMEOS)\n#define MAYBE_ExecuteScriptFrameAfterLoad DISABLED_ExecuteScriptFrameAfterLoad\n#else\n#define MAYBE_ExecuteScriptFrameAfterLoad ExecuteScriptFrameAfterLoad\n#endif \/\/ defined(OS_CHROMEOS)\n\nIN_PROC_BROWSER_TEST_F(ExecuteScriptApiTest,\n MAYBE_ExecuteScriptFrameAfterLoad) {\n SetupDelayedHostResolver();\n ASSERT_TRUE(StartTestServer());\n ASSERT_TRUE(RunExtensionTest(\"executescript\/frame_after_load\")) << message_;\n}\n<|endoftext|>"} {"text":"<commit_before>\/\/ Copyright (c) 2006-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\/sync\/engine\/change_reorder_buffer.h\"\n\n#include <limits>\n#include <queue>\n#include <set>\n#include <utility> \/\/ for pair<>\n#include <vector>\n\n#include \"chrome\/browser\/sync\/syncable\/syncable.h\"\n\nusing std::numeric_limits;\nusing std::pair;\nusing std::queue;\nusing std::set;\nusing std::vector;\n\nnamespace sync_api {\n\n\/\/ Traversal provides a way to collect a set of nodes from the syncable\n\/\/ directory structure and then traverse them, along with any intermediate\n\/\/ nodes, in a top-down fashion, starting from a single common ancestor. A\n\/\/ Traversal starts out empty and is grown by means of the ExpandToInclude\n\/\/ method. Once constructed, the top(), begin_children(), and end_children()\n\/\/ methods can be used to explore the nodes in root-to-leaf order.\nclass ChangeReorderBuffer::Traversal {\n public:\n typedef pair<int64, int64> ParentChildLink;\n typedef set<ParentChildLink> LinkSet;\n\n Traversal() : top_(kInvalidId) { }\n\n \/\/ Expand the traversal so that it includes the node indicated by\n \/\/ |child_handle|.\n void ExpandToInclude(syncable::BaseTransaction* trans,\n int64 child_handle) {\n \/\/ If |top_| is invalid, this is the first insertion -- easy.\n if (top_ == kInvalidId) {\n top_ = child_handle;\n return;\n }\n\n int64 node_to_include = child_handle;\n while (node_to_include != kInvalidId && node_to_include != top_) {\n int64 node_parent = 0;\n\n syncable::Entry node(trans, syncable::GET_BY_HANDLE, node_to_include);\n CHECK(node.good());\n if (node.Get(syncable::ID).IsRoot()) {\n \/\/ If we've hit the root, and the root isn't already in the tree\n \/\/ (it would have to be |top_| if it were), start a new expansion\n \/\/ upwards from |top_| to unite the original traversal with the\n \/\/ path we just added that goes from |child_handle| to the root.\n node_to_include = top_;\n top_ = node.Get(syncable::META_HANDLE);\n } else {\n \/\/ Otherwise, get the parent ID so that we can add a ParentChildLink.\n syncable::Entry parent(trans, syncable::GET_BY_ID,\n node.Get(syncable::PARENT_ID));\n CHECK(parent.good());\n node_parent = parent.Get(syncable::META_HANDLE);\n\n ParentChildLink link(node_parent, node_to_include);\n\n \/\/ If the link exists in the LinkSet |links_|, we don't need to search\n \/\/ any higher; we are done.\n if (links_.find(link) != links_.end())\n return;\n\n \/\/ Otherwise, extend |links_|, and repeat on the parent.\n links_.insert(link);\n node_to_include = node_parent;\n }\n }\n }\n\n \/\/ Return the top node of the traversal. Use this as a starting point\n \/\/ for walking the tree.\n int64 top() const { return top_; }\n\n \/\/ Return an iterator corresponding to the first child (in the traversal)\n \/\/ of the node specified by |parent_id|. Iterate this return value until\n \/\/ it is equal to the value returned by end_children(parent_id). The\n \/\/ enumeration thus provided is unordered.\n LinkSet::const_iterator begin_children(int64 parent_id) const {\n return links_.upper_bound(\n ParentChildLink(parent_id, numeric_limits<int64>::min()));\n }\n\n \/\/ Return an iterator corresponding to the last child in the traversal\n \/\/ of the node specified by |parent_id|.\n LinkSet::const_iterator end_children(int64 parent_id) const {\n return begin_children(parent_id + 1);\n }\n\n private:\n \/\/ The topmost point in the directory hierarchy that is in the traversal,\n \/\/ and thus the first node to be traversed. If the traversal is empty,\n \/\/ this is kInvalidId. If the traversal contains exactly one member, |top_|\n \/\/ will be the solitary member, and |links_| will be empty.\n int64 top_;\n \/\/ A set of single-level links that compose the traversal below |top_|. The\n \/\/ (parent, child) ordering of values enables efficient lookup of children\n \/\/ given the parent handle, which is used for top-down traversal. |links_|\n \/\/ is expected to be connected -- every node that appears as a parent in a\n \/\/ link must either appear as a child of another link, or else be the\n \/\/ topmost node, |top_|.\n LinkSet links_;\n\n DISALLOW_COPY_AND_ASSIGN(Traversal);\n};\n\nChangeReorderBuffer::ChangeReorderBuffer() {\n}\n\nChangeReorderBuffer::~ChangeReorderBuffer() {\n}\n\nvoid ChangeReorderBuffer::GetAllChangesInTreeOrder(\n const BaseTransaction* sync_trans,\n vector<ChangeRecord>* changelist) {\n syncable::BaseTransaction* trans = sync_trans->GetWrappedTrans();\n\n \/\/ Step 1: Iterate through the operations, doing three things:\n \/\/ (a) Push deleted items straight into the |changelist|.\n \/\/ (b) Construct a traversal spanning all non-deleted items.\n \/\/ (c) Construct a set of all parent nodes of any position changes.\n set<int64> parents_of_position_changes;\n Traversal traversal;\n\n OperationMap::const_iterator i;\n for (i = operations_.begin(); i != operations_.end(); ++i) {\n if (i->second == OP_DELETE) {\n ChangeRecord record;\n record.id = i->first;\n record.action = ChangeRecord::ACTION_DELETE;\n if (specifics_.find(record.id) != specifics_.end())\n record.specifics = specifics_[record.id];\n if (extra_data_.find(record.id) != extra_data_.end())\n record.extra = extra_data_[record.id];\n changelist->push_back(record);\n } else {\n traversal.ExpandToInclude(trans, i->first);\n if (i->second == OP_ADD ||\n i->second == OP_UPDATE_POSITION_AND_PROPERTIES) {\n ReadNode node(sync_trans);\n CHECK(node.InitByIdLookup(i->first));\n parents_of_position_changes.insert(node.GetParentId());\n }\n }\n }\n\n \/\/ Step 2: Breadth-first expansion of the traversal, enumerating children in\n \/\/ the syncable sibling order if there were any position updates.\n queue<int64> to_visit;\n to_visit.push(traversal.top());\n while (!to_visit.empty()) {\n int64 next = to_visit.front();\n to_visit.pop();\n\n \/\/ If the node has an associated action, output a change record.\n i = operations_.find(next);\n if (i != operations_.end()) {\n ChangeRecord record;\n record.id = next;\n if (i->second == OP_ADD)\n record.action = ChangeRecord::ACTION_ADD;\n else\n record.action = ChangeRecord::ACTION_UPDATE;\n if (specifics_.find(record.id) != specifics_.end())\n record.specifics = specifics_[record.id];\n if (extra_data_.find(record.id) != extra_data_.end())\n record.extra = extra_data_[record.id];\n changelist->push_back(record);\n }\n\n \/\/ Now add the children of |next| to |to_visit|.\n if (parents_of_position_changes.find(next) ==\n parents_of_position_changes.end()) {\n \/\/ No order changes on this parent -- traverse only the nodes listed\n \/\/ in the traversal (and not in sibling order).\n Traversal::LinkSet::const_iterator j = traversal.begin_children(next);\n Traversal::LinkSet::const_iterator end = traversal.end_children(next);\n for (; j != end; ++j) {\n CHECK(j->first == next);\n to_visit.push(j->second);\n }\n } else {\n \/\/ There were ordering changes on the children of this parent, so\n \/\/ enumerate all the children in the sibling order.\n syncable::Entry parent(trans, syncable::GET_BY_HANDLE, next);\n syncable::Id id = trans->directory()->\n GetFirstChildId(trans, parent.Get(syncable::ID));\n while (!id.IsRoot()) {\n syncable::Entry child(trans, syncable::GET_BY_ID, id);\n CHECK(child.good());\n int64 handle = child.Get(syncable::META_HANDLE);\n to_visit.push(handle);\n \/\/ If there is no operation on this child node, record it as as an\n \/\/ update, so that the listener gets notified of all nodes in the new\n \/\/ ordering.\n if (operations_.find(handle) == operations_.end())\n operations_[handle] = OP_UPDATE_POSITION_AND_PROPERTIES;\n id = child.Get(syncable::NEXT_ID);\n }\n }\n }\n}\n\n} \/\/ namespace sync_api\n<commit_msg>[SYNC] Check if a change's entry is for a position-sensitive model before traversing its parents.<commit_after>\/\/ Copyright (c) 2006-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\/sync\/engine\/change_reorder_buffer.h\"\n\n#include <limits>\n#include <queue>\n#include <set>\n#include <utility> \/\/ for pair<>\n#include <vector>\n\n#include \"chrome\/browser\/sync\/syncable\/syncable.h\"\n\nusing std::numeric_limits;\nusing std::pair;\nusing std::queue;\nusing std::set;\nusing std::vector;\n\nnamespace sync_api {\n\n\/\/ Traversal provides a way to collect a set of nodes from the syncable\n\/\/ directory structure and then traverse them, along with any intermediate\n\/\/ nodes, in a top-down fashion, starting from a single common ancestor. A\n\/\/ Traversal starts out empty and is grown by means of the ExpandToInclude\n\/\/ method. Once constructed, the top(), begin_children(), and end_children()\n\/\/ methods can be used to explore the nodes in root-to-leaf order.\nclass ChangeReorderBuffer::Traversal {\n public:\n typedef pair<int64, int64> ParentChildLink;\n typedef set<ParentChildLink> LinkSet;\n\n Traversal() : top_(kInvalidId) { }\n\n \/\/ Expand the traversal so that it includes the node indicated by\n \/\/ |child_handle|.\n void ExpandToInclude(syncable::BaseTransaction* trans,\n int64 child_handle) {\n \/\/ If |top_| is invalid, this is the first insertion -- easy.\n if (top_ == kInvalidId) {\n top_ = child_handle;\n return;\n }\n\n int64 node_to_include = child_handle;\n while (node_to_include != kInvalidId && node_to_include != top_) {\n int64 node_parent = 0;\n\n syncable::Entry node(trans, syncable::GET_BY_HANDLE, node_to_include);\n CHECK(node.good());\n if (node.Get(syncable::ID).IsRoot()) {\n \/\/ If we've hit the root, and the root isn't already in the tree\n \/\/ (it would have to be |top_| if it were), start a new expansion\n \/\/ upwards from |top_| to unite the original traversal with the\n \/\/ path we just added that goes from |child_handle| to the root.\n node_to_include = top_;\n top_ = node.Get(syncable::META_HANDLE);\n } else {\n \/\/ Otherwise, get the parent ID so that we can add a ParentChildLink.\n syncable::Entry parent(trans, syncable::GET_BY_ID,\n node.Get(syncable::PARENT_ID));\n CHECK(parent.good());\n node_parent = parent.Get(syncable::META_HANDLE);\n\n ParentChildLink link(node_parent, node_to_include);\n\n \/\/ If the link exists in the LinkSet |links_|, we don't need to search\n \/\/ any higher; we are done.\n if (links_.find(link) != links_.end())\n return;\n\n \/\/ Otherwise, extend |links_|, and repeat on the parent.\n links_.insert(link);\n node_to_include = node_parent;\n }\n }\n }\n\n \/\/ Return the top node of the traversal. Use this as a starting point\n \/\/ for walking the tree.\n int64 top() const { return top_; }\n\n \/\/ Return an iterator corresponding to the first child (in the traversal)\n \/\/ of the node specified by |parent_id|. Iterate this return value until\n \/\/ it is equal to the value returned by end_children(parent_id). The\n \/\/ enumeration thus provided is unordered.\n LinkSet::const_iterator begin_children(int64 parent_id) const {\n return links_.upper_bound(\n ParentChildLink(parent_id, numeric_limits<int64>::min()));\n }\n\n \/\/ Return an iterator corresponding to the last child in the traversal\n \/\/ of the node specified by |parent_id|.\n LinkSet::const_iterator end_children(int64 parent_id) const {\n return begin_children(parent_id + 1);\n }\n\n private:\n \/\/ The topmost point in the directory hierarchy that is in the traversal,\n \/\/ and thus the first node to be traversed. If the traversal is empty,\n \/\/ this is kInvalidId. If the traversal contains exactly one member, |top_|\n \/\/ will be the solitary member, and |links_| will be empty.\n int64 top_;\n \/\/ A set of single-level links that compose the traversal below |top_|. The\n \/\/ (parent, child) ordering of values enables efficient lookup of children\n \/\/ given the parent handle, which is used for top-down traversal. |links_|\n \/\/ is expected to be connected -- every node that appears as a parent in a\n \/\/ link must either appear as a child of another link, or else be the\n \/\/ topmost node, |top_|.\n LinkSet links_;\n\n DISALLOW_COPY_AND_ASSIGN(Traversal);\n};\n\nChangeReorderBuffer::ChangeReorderBuffer() {\n}\n\nChangeReorderBuffer::~ChangeReorderBuffer() {\n}\n\nvoid ChangeReorderBuffer::GetAllChangesInTreeOrder(\n const BaseTransaction* sync_trans,\n vector<ChangeRecord>* changelist) {\n syncable::BaseTransaction* trans = sync_trans->GetWrappedTrans();\n\n \/\/ Step 1: Iterate through the operations, doing three things:\n \/\/ (a) Push deleted items straight into the |changelist|.\n \/\/ (b) Construct a traversal spanning all non-deleted items.\n \/\/ (c) Construct a set of all parent nodes of any position changes.\n set<int64> parents_of_position_changes;\n Traversal traversal;\n\n OperationMap::const_iterator i;\n for (i = operations_.begin(); i != operations_.end(); ++i) {\n if (i->second == OP_DELETE) {\n ChangeRecord record;\n record.id = i->first;\n record.action = ChangeRecord::ACTION_DELETE;\n if (specifics_.find(record.id) != specifics_.end())\n record.specifics = specifics_[record.id];\n if (extra_data_.find(record.id) != extra_data_.end())\n record.extra = extra_data_[record.id];\n changelist->push_back(record);\n } else {\n traversal.ExpandToInclude(trans, i->first);\n if (i->second == OP_ADD ||\n i->second == OP_UPDATE_POSITION_AND_PROPERTIES) {\n ReadNode node(sync_trans);\n CHECK(node.InitByIdLookup(i->first));\n\n \/\/ We only care about parents of entry's with position-sensitive models.\n if (node.GetEntry()->ShouldMaintainPosition())\n parents_of_position_changes.insert(node.GetParentId());\n }\n }\n }\n\n \/\/ Step 2: Breadth-first expansion of the traversal, enumerating children in\n \/\/ the syncable sibling order if there were any position updates.\n queue<int64> to_visit;\n to_visit.push(traversal.top());\n while (!to_visit.empty()) {\n int64 next = to_visit.front();\n to_visit.pop();\n\n \/\/ If the node has an associated action, output a change record.\n i = operations_.find(next);\n if (i != operations_.end()) {\n ChangeRecord record;\n record.id = next;\n if (i->second == OP_ADD)\n record.action = ChangeRecord::ACTION_ADD;\n else\n record.action = ChangeRecord::ACTION_UPDATE;\n if (specifics_.find(record.id) != specifics_.end())\n record.specifics = specifics_[record.id];\n if (extra_data_.find(record.id) != extra_data_.end())\n record.extra = extra_data_[record.id];\n changelist->push_back(record);\n }\n\n \/\/ Now add the children of |next| to |to_visit|.\n if (parents_of_position_changes.find(next) ==\n parents_of_position_changes.end()) {\n \/\/ No order changes on this parent -- traverse only the nodes listed\n \/\/ in the traversal (and not in sibling order).\n Traversal::LinkSet::const_iterator j = traversal.begin_children(next);\n Traversal::LinkSet::const_iterator end = traversal.end_children(next);\n for (; j != end; ++j) {\n CHECK(j->first == next);\n to_visit.push(j->second);\n }\n } else {\n \/\/ There were ordering changes on the children of this parent, so\n \/\/ enumerate all the children in the sibling order.\n syncable::Entry parent(trans, syncable::GET_BY_HANDLE, next);\n syncable::Id id = trans->directory()->\n GetFirstChildId(trans, parent.Get(syncable::ID));\n while (!id.IsRoot()) {\n syncable::Entry child(trans, syncable::GET_BY_ID, id);\n CHECK(child.good());\n int64 handle = child.Get(syncable::META_HANDLE);\n to_visit.push(handle);\n \/\/ If there is no operation on this child node, record it as as an\n \/\/ update, so that the listener gets notified of all nodes in the new\n \/\/ ordering.\n if (operations_.find(handle) == operations_.end())\n operations_[handle] = OP_UPDATE_POSITION_AND_PROPERTIES;\n id = child.Get(syncable::NEXT_ID);\n }\n }\n }\n}\n\n} \/\/ namespace sync_api\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\/fullscreen_exit_bubble_gtk.h\"\n\n#include \"base\/utf_string_conversions.h\"\n#include \"chrome\/browser\/ui\/browser.h\"\n#include \"chrome\/browser\/ui\/gtk\/gtk_chrome_link_button.h\"\n#include \"chrome\/browser\/ui\/gtk\/gtk_util.h\"\n#include \"chrome\/browser\/ui\/gtk\/rounded_window.h\"\n#include \"content\/browser\/renderer_host\/render_widget_host_view.h\"\n#include \"content\/browser\/tab_contents\/tab_contents.h\"\n#include \"grit\/generated_resources.h\"\n#include \"grit\/ui_strings.h\"\n#include \"ui\/base\/gtk\/gtk_floating_container.h\"\n#include \"ui\/base\/gtk\/gtk_hig_constants.h\"\n#include \"ui\/base\/l10n\/l10n_util.h\"\n\nnamespace {\nconst GdkColor kFrameColor = GDK_COLOR_RGB(0x63, 0x63, 0x63);\nconst int kMiddlePaddingPx = 30;\n} \/\/ namespace\n\nFullscreenExitBubbleGtk::FullscreenExitBubbleGtk(\n GtkFloatingContainer* container,\n Browser* browser,\n const GURL& url,\n FullscreenExitBubbleType bubble_type)\n : FullscreenExitBubble(browser, url, bubble_type),\n container_(container),\n render_widget_host_view_widget_(browser->GetSelectedTabContents()->\n GetRenderWidgetHostView()->GetNativeView()) {\n InitWidgets();\n}\n\nFullscreenExitBubbleGtk::~FullscreenExitBubbleGtk() {\n}\n\nvoid FullscreenExitBubbleGtk::UpdateContent(\n const GURL& url,\n FullscreenExitBubbleType bubble_type) {\n if (bubble_type == FEB_TYPE_NONE) {\n NOTREACHED();\n bubble_type = FEB_TYPE_BROWSER_FULLSCREEN_EXIT_INSTRUCTION;\n }\n\n url_ = url;\n bubble_type_ = bubble_type;\n\n gtk_label_set_text(GTK_LABEL(message_label_),\n UTF16ToUTF8(GetCurrentMessageText()).c_str());\n if (fullscreen_bubble::ShowButtonsForType(bubble_type)) {\n gtk_widget_hide(link_);\n gtk_widget_hide(instruction_label_);\n gtk_widget_show(allow_button_);\n gtk_button_set_label(GTK_BUTTON(deny_button_),\n UTF16ToUTF8(GetCurrentDenyButtonText()).c_str());\n gtk_widget_show(deny_button_);\n } else {\n if (bubble_type == FEB_TYPE_BROWSER_FULLSCREEN_EXIT_INSTRUCTION) {\n gtk_widget_show(link_);\n gtk_widget_hide(instruction_label_);\n } else {\n gtk_widget_hide(link_);\n gtk_widget_show(instruction_label_);\n }\n gtk_widget_hide(allow_button_);\n gtk_widget_hide(deny_button_);\n }\n\n Show();\n StopWatchingMouse();\n StartWatchingMouseIfNecessary();\n}\n\nvoid FullscreenExitBubbleGtk::InitWidgets() {\n \/\/ The exit bubble is a gtk_chrome_link_button inside a gtk event box and gtk\n \/\/ alignment (these provide the background color). This is then made rounded\n \/\/ and put into a slide widget.\n\n \/\/ The Windows code actually looks up the accelerator key in the accelerator\n \/\/ table and then converts the key to a string (in a switch statement). This\n \/\/ doesn't seem to be implemented for Gtk, so we just use F11 directly.\n std::string exit_text_utf8(l10n_util::GetStringFUTF8(\n IDS_EXIT_FULLSCREEN_MODE, l10n_util::GetStringUTF16(IDS_APP_F11_KEY)));\n\n hbox_ = gtk_hbox_new(false, ui::kControlSpacing);\n\n message_label_ = gtk_label_new(GetMessage(url_).c_str());\n gtk_box_pack_start(GTK_BOX(hbox_), message_label_, FALSE, FALSE, 0);\n\n allow_button_ = gtk_button_new_with_label(\n l10n_util::GetStringUTF8(IDS_FULLSCREEN_ALLOW).c_str());\n gtk_widget_set_no_show_all(allow_button_, FALSE);\n gtk_box_pack_start(GTK_BOX(hbox_), allow_button_, FALSE, FALSE, 0);\n\n deny_button_ = gtk_button_new_with_label(\n l10n_util::GetStringUTF8(IDS_FULLSCREEN_DENY).c_str());\n gtk_widget_set_no_show_all(deny_button_, FALSE);\n gtk_box_pack_start(GTK_BOX(hbox_), deny_button_, FALSE, FALSE, 0);\n\n link_ = gtk_chrome_link_button_new(exit_text_utf8.c_str());\n gtk_widget_set_no_show_all(link_, FALSE);\n gtk_chrome_link_button_set_use_gtk_theme(GTK_CHROME_LINK_BUTTON(link_),\n FALSE);\n gtk_box_pack_start(GTK_BOX(hbox_), link_, FALSE, FALSE, 0);\n\n\n instruction_label_ = gtk_label_new(UTF16ToUTF8(GetInstructionText()).c_str());\n gtk_widget_set_no_show_all(instruction_label_, FALSE);\n gtk_box_pack_start(GTK_BOX(hbox_), instruction_label_, FALSE, FALSE, 0);\n\n\n GtkWidget* bubble = gtk_util::CreateGtkBorderBin(\n hbox_, &ui::kGdkWhite,\n kPaddingPx, kPaddingPx, kPaddingPx, kPaddingPx);\n gtk_util::ActAsRoundedWindow(bubble, kFrameColor, 3,\n gtk_util::ROUNDED_ALL, gtk_util::BORDER_ALL);\n GtkWidget* alignment = gtk_alignment_new(0.0, 0.0, 1.0, 1.0);\n gtk_alignment_set_padding(GTK_ALIGNMENT(alignment), 5, 0, 0, 0);\n gtk_container_add(GTK_CONTAINER(alignment), bubble);\n ui_container_.Own(alignment);\n\n slide_widget_.reset(new SlideAnimatorGtk(ui_container_.get(),\n SlideAnimatorGtk::DOWN, kSlideOutDurationMs, false, false, NULL));\n gtk_widget_set_name(widget(), \"exit-fullscreen-bubble\");\n gtk_widget_show_all(ui_container_.get());\n gtk_widget_show(widget());\n slide_widget_->OpenWithoutAnimation();\n\n gtk_floating_container_add_floating(GTK_FLOATING_CONTAINER(container_),\n widget());\n\n signals_.Connect(container_, \"set-floating-position\",\n G_CALLBACK(OnSetFloatingPositionThunk), this);\n signals_.Connect(link_, \"clicked\", G_CALLBACK(OnLinkClickedThunk), this);\n signals_.Connect(allow_button_, \"clicked\",\n G_CALLBACK(&OnAllowClickedThunk), this);\n signals_.Connect(deny_button_, \"clicked\",\n G_CALLBACK(&OnDenyClickedThunk), this);\n\n UpdateContent(url_, bubble_type_);\n}\n\nstd::string FullscreenExitBubbleGtk::GetMessage(const GURL& url) {\n if (url.is_empty()) {\n return l10n_util::GetStringUTF8(\n IDS_FULLSCREEN_USER_ENTERED_FULLSCREEN);\n }\n if (url.SchemeIsFile())\n return l10n_util::GetStringUTF8(IDS_FULLSCREEN_ENTERED_FULLSCREEN);\n return l10n_util::GetStringFUTF8(IDS_FULLSCREEN_SITE_ENTERED_FULLSCREEN,\n UTF8ToUTF16(url.host()));\n}\n\ngfx::Rect FullscreenExitBubbleGtk::GetPopupRect(\n bool ignore_animation_state) const {\n GtkRequisition bubble_size;\n if (ignore_animation_state) {\n gtk_widget_size_request(ui_container_.get(), &bubble_size);\n } else {\n gtk_widget_size_request(widget(), &bubble_size);\n }\n return gfx::Rect(bubble_size.width, bubble_size.height);\n}\n\ngfx::Point FullscreenExitBubbleGtk::GetCursorScreenPoint() {\n GdkDisplay* display = gtk_widget_get_display(widget());\n\n \/\/ Get cursor position.\n \/\/ TODO: this hits the X server, so we may want to consider decreasing\n \/\/ kPositionCheckHz if we detect that we're running remotely.\n int x, y;\n gdk_display_get_pointer(display, NULL, &x, &y, NULL);\n\n return gfx::Point(x, y);\n}\n\nbool FullscreenExitBubbleGtk::WindowContainsPoint(gfx::Point pos) {\n GtkWindow* window = GTK_WINDOW(\n gtk_widget_get_ancestor(widget(), GTK_TYPE_WINDOW));\n int width, height, x, y;\n gtk_window_get_size(window, &width, &height);\n gtk_window_get_position(window, &x, &y);\n return gfx::Rect(x, y, width, height).Contains(pos);\n}\n\nbool FullscreenExitBubbleGtk::IsWindowActive() {\n if (!widget()->parent)\n return false;\n GtkWindow* window = GTK_WINDOW(\n gtk_widget_get_ancestor(widget(), GTK_TYPE_WINDOW));\n return gtk_window_is_active(window);\n}\n\nvoid FullscreenExitBubbleGtk::Hide() {\n slide_widget_->Close();\n}\n\nvoid FullscreenExitBubbleGtk::Show() {\n slide_widget_->Open();\n}\n\nbool FullscreenExitBubbleGtk::IsAnimating() {\n return slide_widget_->IsAnimating();\n}\n\nvoid FullscreenExitBubbleGtk::StartWatchingMouseIfNecessary() {\n if (!fullscreen_bubble::ShowButtonsForType(bubble_type_))\n StartWatchingMouse();\n}\n\nvoid FullscreenExitBubbleGtk::OnSetFloatingPosition(\n GtkWidget* floating_container,\n GtkAllocation* allocation) {\n GtkRequisition bubble_size;\n gtk_widget_size_request(widget(), &bubble_size);\n\n \/\/ Position the bubble at the top center of the screen.\n GValue value = { 0, };\n g_value_init(&value, G_TYPE_INT);\n g_value_set_int(&value, (allocation->width - bubble_size.width) \/ 2);\n gtk_container_child_set_property(GTK_CONTAINER(floating_container),\n widget(), \"x\", &value);\n\n g_value_set_int(&value, 0);\n gtk_container_child_set_property(GTK_CONTAINER(floating_container),\n widget(), \"y\", &value);\n g_value_unset(&value);\n}\n\nvoid FullscreenExitBubbleGtk::OnLinkClicked(GtkWidget* link) {\n gtk_widget_grab_focus(render_widget_host_view_widget_);\n ToggleFullscreen();\n}\n\nvoid FullscreenExitBubbleGtk::OnAllowClicked(GtkWidget* button) {\n gtk_widget_grab_focus(render_widget_host_view_widget_);\n Accept();\n UpdateContent(url_, bubble_type_);\n StartWatchingMouse();\n}\nvoid FullscreenExitBubbleGtk::OnDenyClicked(GtkWidget* button) {\n gtk_widget_grab_focus(render_widget_host_view_widget_);\n Cancel();\n}\n<commit_msg>Remove extraneous StartWatchingMouse().<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\/fullscreen_exit_bubble_gtk.h\"\n\n#include \"base\/utf_string_conversions.h\"\n#include \"chrome\/browser\/ui\/browser.h\"\n#include \"chrome\/browser\/ui\/gtk\/gtk_chrome_link_button.h\"\n#include \"chrome\/browser\/ui\/gtk\/gtk_util.h\"\n#include \"chrome\/browser\/ui\/gtk\/rounded_window.h\"\n#include \"content\/browser\/renderer_host\/render_widget_host_view.h\"\n#include \"content\/browser\/tab_contents\/tab_contents.h\"\n#include \"grit\/generated_resources.h\"\n#include \"grit\/ui_strings.h\"\n#include \"ui\/base\/gtk\/gtk_floating_container.h\"\n#include \"ui\/base\/gtk\/gtk_hig_constants.h\"\n#include \"ui\/base\/l10n\/l10n_util.h\"\n\nnamespace {\nconst GdkColor kFrameColor = GDK_COLOR_RGB(0x63, 0x63, 0x63);\nconst int kMiddlePaddingPx = 30;\n} \/\/ namespace\n\nFullscreenExitBubbleGtk::FullscreenExitBubbleGtk(\n GtkFloatingContainer* container,\n Browser* browser,\n const GURL& url,\n FullscreenExitBubbleType bubble_type)\n : FullscreenExitBubble(browser, url, bubble_type),\n container_(container),\n render_widget_host_view_widget_(browser->GetSelectedTabContents()->\n GetRenderWidgetHostView()->GetNativeView()) {\n InitWidgets();\n}\n\nFullscreenExitBubbleGtk::~FullscreenExitBubbleGtk() {\n}\n\nvoid FullscreenExitBubbleGtk::UpdateContent(\n const GURL& url,\n FullscreenExitBubbleType bubble_type) {\n if (bubble_type == FEB_TYPE_NONE) {\n NOTREACHED();\n bubble_type = FEB_TYPE_BROWSER_FULLSCREEN_EXIT_INSTRUCTION;\n }\n\n url_ = url;\n bubble_type_ = bubble_type;\n\n gtk_label_set_text(GTK_LABEL(message_label_),\n UTF16ToUTF8(GetCurrentMessageText()).c_str());\n if (fullscreen_bubble::ShowButtonsForType(bubble_type)) {\n gtk_widget_hide(link_);\n gtk_widget_hide(instruction_label_);\n gtk_widget_show(allow_button_);\n gtk_button_set_label(GTK_BUTTON(deny_button_),\n UTF16ToUTF8(GetCurrentDenyButtonText()).c_str());\n gtk_widget_show(deny_button_);\n } else {\n if (bubble_type == FEB_TYPE_BROWSER_FULLSCREEN_EXIT_INSTRUCTION) {\n gtk_widget_show(link_);\n gtk_widget_hide(instruction_label_);\n } else {\n gtk_widget_hide(link_);\n gtk_widget_show(instruction_label_);\n }\n gtk_widget_hide(allow_button_);\n gtk_widget_hide(deny_button_);\n }\n\n Show();\n StopWatchingMouse();\n StartWatchingMouseIfNecessary();\n}\n\nvoid FullscreenExitBubbleGtk::InitWidgets() {\n \/\/ The exit bubble is a gtk_chrome_link_button inside a gtk event box and gtk\n \/\/ alignment (these provide the background color). This is then made rounded\n \/\/ and put into a slide widget.\n\n \/\/ The Windows code actually looks up the accelerator key in the accelerator\n \/\/ table and then converts the key to a string (in a switch statement). This\n \/\/ doesn't seem to be implemented for Gtk, so we just use F11 directly.\n std::string exit_text_utf8(l10n_util::GetStringFUTF8(\n IDS_EXIT_FULLSCREEN_MODE, l10n_util::GetStringUTF16(IDS_APP_F11_KEY)));\n\n hbox_ = gtk_hbox_new(false, ui::kControlSpacing);\n\n message_label_ = gtk_label_new(GetMessage(url_).c_str());\n gtk_box_pack_start(GTK_BOX(hbox_), message_label_, FALSE, FALSE, 0);\n\n allow_button_ = gtk_button_new_with_label(\n l10n_util::GetStringUTF8(IDS_FULLSCREEN_ALLOW).c_str());\n gtk_widget_set_no_show_all(allow_button_, FALSE);\n gtk_box_pack_start(GTK_BOX(hbox_), allow_button_, FALSE, FALSE, 0);\n\n deny_button_ = gtk_button_new_with_label(\n l10n_util::GetStringUTF8(IDS_FULLSCREEN_DENY).c_str());\n gtk_widget_set_no_show_all(deny_button_, FALSE);\n gtk_box_pack_start(GTK_BOX(hbox_), deny_button_, FALSE, FALSE, 0);\n\n link_ = gtk_chrome_link_button_new(exit_text_utf8.c_str());\n gtk_widget_set_no_show_all(link_, FALSE);\n gtk_chrome_link_button_set_use_gtk_theme(GTK_CHROME_LINK_BUTTON(link_),\n FALSE);\n gtk_box_pack_start(GTK_BOX(hbox_), link_, FALSE, FALSE, 0);\n\n\n instruction_label_ = gtk_label_new(UTF16ToUTF8(GetInstructionText()).c_str());\n gtk_widget_set_no_show_all(instruction_label_, FALSE);\n gtk_box_pack_start(GTK_BOX(hbox_), instruction_label_, FALSE, FALSE, 0);\n\n\n GtkWidget* bubble = gtk_util::CreateGtkBorderBin(\n hbox_, &ui::kGdkWhite,\n kPaddingPx, kPaddingPx, kPaddingPx, kPaddingPx);\n gtk_util::ActAsRoundedWindow(bubble, kFrameColor, 3,\n gtk_util::ROUNDED_ALL, gtk_util::BORDER_ALL);\n GtkWidget* alignment = gtk_alignment_new(0.0, 0.0, 1.0, 1.0);\n gtk_alignment_set_padding(GTK_ALIGNMENT(alignment), 5, 0, 0, 0);\n gtk_container_add(GTK_CONTAINER(alignment), bubble);\n ui_container_.Own(alignment);\n\n slide_widget_.reset(new SlideAnimatorGtk(ui_container_.get(),\n SlideAnimatorGtk::DOWN, kSlideOutDurationMs, false, false, NULL));\n gtk_widget_set_name(widget(), \"exit-fullscreen-bubble\");\n gtk_widget_show_all(ui_container_.get());\n gtk_widget_show(widget());\n slide_widget_->OpenWithoutAnimation();\n\n gtk_floating_container_add_floating(GTK_FLOATING_CONTAINER(container_),\n widget());\n\n signals_.Connect(container_, \"set-floating-position\",\n G_CALLBACK(OnSetFloatingPositionThunk), this);\n signals_.Connect(link_, \"clicked\", G_CALLBACK(OnLinkClickedThunk), this);\n signals_.Connect(allow_button_, \"clicked\",\n G_CALLBACK(&OnAllowClickedThunk), this);\n signals_.Connect(deny_button_, \"clicked\",\n G_CALLBACK(&OnDenyClickedThunk), this);\n\n UpdateContent(url_, bubble_type_);\n}\n\nstd::string FullscreenExitBubbleGtk::GetMessage(const GURL& url) {\n if (url.is_empty()) {\n return l10n_util::GetStringUTF8(\n IDS_FULLSCREEN_USER_ENTERED_FULLSCREEN);\n }\n if (url.SchemeIsFile())\n return l10n_util::GetStringUTF8(IDS_FULLSCREEN_ENTERED_FULLSCREEN);\n return l10n_util::GetStringFUTF8(IDS_FULLSCREEN_SITE_ENTERED_FULLSCREEN,\n UTF8ToUTF16(url.host()));\n}\n\ngfx::Rect FullscreenExitBubbleGtk::GetPopupRect(\n bool ignore_animation_state) const {\n GtkRequisition bubble_size;\n if (ignore_animation_state) {\n gtk_widget_size_request(ui_container_.get(), &bubble_size);\n } else {\n gtk_widget_size_request(widget(), &bubble_size);\n }\n return gfx::Rect(bubble_size.width, bubble_size.height);\n}\n\ngfx::Point FullscreenExitBubbleGtk::GetCursorScreenPoint() {\n GdkDisplay* display = gtk_widget_get_display(widget());\n\n \/\/ Get cursor position.\n \/\/ TODO: this hits the X server, so we may want to consider decreasing\n \/\/ kPositionCheckHz if we detect that we're running remotely.\n int x, y;\n gdk_display_get_pointer(display, NULL, &x, &y, NULL);\n\n return gfx::Point(x, y);\n}\n\nbool FullscreenExitBubbleGtk::WindowContainsPoint(gfx::Point pos) {\n GtkWindow* window = GTK_WINDOW(\n gtk_widget_get_ancestor(widget(), GTK_TYPE_WINDOW));\n int width, height, x, y;\n gtk_window_get_size(window, &width, &height);\n gtk_window_get_position(window, &x, &y);\n return gfx::Rect(x, y, width, height).Contains(pos);\n}\n\nbool FullscreenExitBubbleGtk::IsWindowActive() {\n if (!widget()->parent)\n return false;\n GtkWindow* window = GTK_WINDOW(\n gtk_widget_get_ancestor(widget(), GTK_TYPE_WINDOW));\n return gtk_window_is_active(window);\n}\n\nvoid FullscreenExitBubbleGtk::Hide() {\n slide_widget_->Close();\n}\n\nvoid FullscreenExitBubbleGtk::Show() {\n slide_widget_->Open();\n}\n\nbool FullscreenExitBubbleGtk::IsAnimating() {\n return slide_widget_->IsAnimating();\n}\n\nvoid FullscreenExitBubbleGtk::StartWatchingMouseIfNecessary() {\n if (!fullscreen_bubble::ShowButtonsForType(bubble_type_))\n StartWatchingMouse();\n}\n\nvoid FullscreenExitBubbleGtk::OnSetFloatingPosition(\n GtkWidget* floating_container,\n GtkAllocation* allocation) {\n GtkRequisition bubble_size;\n gtk_widget_size_request(widget(), &bubble_size);\n\n \/\/ Position the bubble at the top center of the screen.\n GValue value = { 0, };\n g_value_init(&value, G_TYPE_INT);\n g_value_set_int(&value, (allocation->width - bubble_size.width) \/ 2);\n gtk_container_child_set_property(GTK_CONTAINER(floating_container),\n widget(), \"x\", &value);\n\n g_value_set_int(&value, 0);\n gtk_container_child_set_property(GTK_CONTAINER(floating_container),\n widget(), \"y\", &value);\n g_value_unset(&value);\n}\n\nvoid FullscreenExitBubbleGtk::OnLinkClicked(GtkWidget* link) {\n gtk_widget_grab_focus(render_widget_host_view_widget_);\n ToggleFullscreen();\n}\n\nvoid FullscreenExitBubbleGtk::OnAllowClicked(GtkWidget* button) {\n gtk_widget_grab_focus(render_widget_host_view_widget_);\n Accept();\n UpdateContent(url_, bubble_type_);\n}\nvoid FullscreenExitBubbleGtk::OnDenyClicked(GtkWidget* button) {\n gtk_widget_grab_focus(render_widget_host_view_widget_);\n Cancel();\n}\n<|endoftext|>"} {"text":"<commit_before>\/\/ Copyright (c) 2012 The Chromium Authors. All rights reserved.\n\/\/ Use of this source code is governed by a BSD-style license that can be\n\/\/ found in the LICENSE file.\n\n#include \"chrome\/browser\/ui\/webui\/sync_promo\/sync_promo_ui.h\"\n\n#include \"base\/command_line.h\"\n#include \"base\/utf_string_conversions.h\"\n#include \"chrome\/browser\/browser_process.h\"\n#include \"chrome\/browser\/first_run\/first_run.h\"\n#include \"chrome\/browser\/google\/google_util.h\"\n#include \"chrome\/browser\/prefs\/pref_service.h\"\n#include \"chrome\/browser\/profiles\/profile.h\"\n#include \"chrome\/browser\/profiles\/profile_info_cache.h\"\n#include \"chrome\/browser\/profiles\/profile_manager.h\"\n#include \"chrome\/browser\/sync\/profile_sync_service.h\"\n#include \"chrome\/browser\/sync\/profile_sync_service_factory.h\"\n#include \"chrome\/browser\/ui\/webui\/chrome_url_data_manager.h\"\n#include \"chrome\/browser\/ui\/webui\/chrome_web_ui_data_source.h\"\n#include \"chrome\/browser\/ui\/webui\/options\/core_options_handler.h\"\n#include \"chrome\/browser\/ui\/webui\/sync_promo\/sync_promo_handler.h\"\n#include \"chrome\/browser\/ui\/webui\/sync_promo\/sync_promo_trial.h\"\n#include \"chrome\/browser\/ui\/webui\/theme_source.h\"\n#include \"chrome\/common\/chrome_switches.h\"\n#include \"chrome\/common\/pref_names.h\"\n#include \"chrome\/common\/url_constants.h\"\n#include \"content\/public\/browser\/web_contents.h\"\n#include \"content\/public\/browser\/web_ui.h\"\n#include \"googleurl\/src\/url_util.h\"\n#include \"grit\/browser_resources.h\"\n#include \"grit\/generated_resources.h\"\n#include \"grit\/theme_resources.h\"\n#include \"ui\/base\/l10n\/l10n_util.h\"\n\nusing content::WebContents;\n\nnamespace {\n\nconst char kStringsJsFile[] = \"strings.js\";\nconst char kSyncPromoJsFile[] = \"sync_promo.js\";\n\nconst char kSyncPromoQueryKeyIsLaunchPage[] = \"is_launch_page\";\nconst char kSyncPromoQueryKeyNextPage[] = \"next_page\";\nconst char kSyncPromoQueryKeySource[] = \"source\";\n\n\/\/ The maximum number of times we want to show the sync promo at startup.\nconst int kSyncPromoShowAtStartupMaximum = 10;\n\n\/\/ Checks we want to show the sync promo for the given brand.\nbool AllowPromoAtStartupForCurrentBrand() {\n std::string brand;\n google_util::GetBrand(&brand);\n\n if (brand.empty())\n return true;\n\n if (google_util::IsInternetCafeBrandCode(brand))\n return false;\n\n if (google_util::IsOrganic(brand))\n return true;\n\n if (StartsWithASCII(brand, \"CH\", true))\n return true;\n\n \/\/ Default to disallow for all other brand codes.\n return false;\n}\n\n\/\/ The Web UI data source for the sync promo page.\nclass SyncPromoUIHTMLSource : public ChromeWebUIDataSource {\n public:\n explicit SyncPromoUIHTMLSource(content::WebUI* web_ui);\n\n private:\n ~SyncPromoUIHTMLSource() {}\n DISALLOW_COPY_AND_ASSIGN(SyncPromoUIHTMLSource);\n};\n\nSyncPromoUIHTMLSource::SyncPromoUIHTMLSource(content::WebUI* web_ui)\n : ChromeWebUIDataSource(chrome::kChromeUISyncPromoHost) {\n DictionaryValue localized_strings;\n CoreOptionsHandler::GetStaticLocalizedValues(&localized_strings);\n SyncSetupHandler::GetStaticLocalizedValues(&localized_strings, web_ui);\n AddLocalizedStrings(localized_strings);\n}\n\n\/\/ Looks for |search_key| in the query portion of |url|. Returns true if the\n\/\/ key is found and sets |out_value| to the value for the key. Returns false if\n\/\/ the key is not found.\nbool GetValueForKeyInQuery(const GURL& url, const std::string& search_key,\n std::string* out_value) {\n url_parse::Component query = url.parsed_for_possibly_invalid_spec().query;\n url_parse::Component key, value;\n while (url_parse::ExtractQueryKeyValue(\n url.spec().c_str(), &query, &key, &value)) {\n if (key.is_nonempty()) {\n std::string key_string = url.spec().substr(key.begin, key.len);\n if (key_string == search_key) {\n if (value.is_nonempty())\n *out_value = url.spec().substr(value.begin, value.len);\n else\n *out_value = \"\";\n return true;\n }\n }\n }\n return false;\n}\n\n} \/\/ namespace\n\nSyncPromoUI::SyncPromoUI(content::WebUI* web_ui) : WebUIController(web_ui) {\n SyncPromoHandler* handler = new SyncPromoHandler(\n GetSourceForSyncPromoURL(web_ui->GetWebContents()->GetURL()),\n g_browser_process->profile_manager());\n web_ui->AddMessageHandler(handler);\n\n \/\/ Set up the chrome:\/\/theme\/ source.\n Profile* profile = Profile::FromWebUI(web_ui);\n ThemeSource* theme = new ThemeSource(profile);\n profile->GetChromeURLDataManager()->AddDataSource(theme);\n\n \/\/ Set up the sync promo source.\n SyncPromoUIHTMLSource* html_source = new SyncPromoUIHTMLSource(web_ui);\n html_source->set_json_path(kStringsJsFile);\n html_source->add_resource_path(kSyncPromoJsFile, IDR_SYNC_PROMO_JS);\n html_source->set_default_resource(IDR_SYNC_PROMO_HTML);\n profile->GetChromeURLDataManager()->AddDataSource(html_source);\n\n sync_promo_trial::RecordUserShownPromo(web_ui);\n}\n\n\/\/ static\nbool SyncPromoUI::HasShownPromoAtStartup(Profile* profile) {\n return profile->GetPrefs()->HasPrefPath(prefs::kSyncPromoStartupCount);\n}\n\n\/\/ static\nbool SyncPromoUI::ShouldShowSyncPromo(Profile* profile) {\n#if defined(OS_CHROMEOS)\n \/\/ There's no need to show the sync promo on cros since cros users are logged\n \/\/ into sync already.\n return false;\n#endif\n\n \/\/ Honor the sync policies.\n if (!profile->GetOriginalProfile()->IsSyncAccessible())\n return false;\n\n \/\/ If the user is already signed into sync then don't show the promo.\n ProfileSyncService* service =\n ProfileSyncServiceFactory::GetInstance()->GetForProfile(\n profile->GetOriginalProfile());\n if (!service || service->HasSyncSetupCompleted())\n return false;\n\n \/\/ Default to allow the promo.\n return true;\n}\n\n\/\/ static\nvoid SyncPromoUI::RegisterUserPrefs(PrefService* prefs) {\n prefs->RegisterIntegerPref(\n prefs::kSyncPromoStartupCount, 0, PrefService::UNSYNCABLE_PREF);\n prefs->RegisterBooleanPref(\n prefs::kSyncPromoUserSkipped, false, PrefService::UNSYNCABLE_PREF);\n prefs->RegisterBooleanPref(prefs::kSyncPromoShowOnFirstRunAllowed, true,\n PrefService::UNSYNCABLE_PREF);\n\n SyncPromoHandler::RegisterUserPrefs(prefs);\n}\n\n\/\/ static\nbool SyncPromoUI::ShouldShowSyncPromoAtStartup(Profile* profile,\n bool is_new_profile,\n bool* promo_suppressed) {\n DCHECK(profile);\n DCHECK(promo_suppressed);\n *promo_suppressed = false;\n\n if (!ShouldShowSyncPromo(profile))\n return false;\n\n const CommandLine& command_line = *CommandLine::ForCurrentProcess();\n if (command_line.HasSwitch(switches::kNoFirstRun))\n is_new_profile = false;\n\n if (!is_new_profile) {\n if (!HasShownPromoAtStartup(profile))\n return false;\n }\n\n if (HasUserSkippedSyncPromo(profile))\n return false;\n\n \/\/ For Chinese users skip the sync promo.\n if (g_browser_process->GetApplicationLocale() == \"zh-CN\")\n return false;\n\n PrefService* prefs = profile->GetPrefs();\n int show_count = prefs->GetInteger(prefs::kSyncPromoStartupCount);\n if (show_count >= kSyncPromoShowAtStartupMaximum)\n return false;\n\n \/\/ If the current install is part of trial then let the trial determine if we\n \/\/ should show the promo or not.\n switch (sync_promo_trial::GetStartupOverrideForCurrentTrial()) {\n case sync_promo_trial::STARTUP_OVERRIDE_NONE:\n \/\/ No override so simply continue.\n break;\n case sync_promo_trial::STARTUP_OVERRIDE_SHOW:\n return true;\n case sync_promo_trial::STARTUP_OVERRIDE_HIDE:\n *promo_suppressed = true;\n return false;\n }\n\n \/\/ This pref can be set in the master preferences file to allow or disallow\n \/\/ showing the sync promo at startup.\n if (prefs->HasPrefPath(prefs::kSyncPromoShowOnFirstRunAllowed))\n return prefs->GetBoolean(prefs::kSyncPromoShowOnFirstRunAllowed);\n\n \/\/ For now don't show the promo for some brands.\n if (!AllowPromoAtStartupForCurrentBrand())\n return false;\n\n \/\/ Default to show the promo for Google Chrome builds.\n#if defined(GOOGLE_CHROME_BUILD)\n return true;\n#else\n return false;\n#endif\n}\n\nvoid SyncPromoUI::DidShowSyncPromoAtStartup(Profile* profile) {\n int show_count = profile->GetPrefs()->GetInteger(\n prefs::kSyncPromoStartupCount);\n show_count++;\n profile->GetPrefs()->SetInteger(prefs::kSyncPromoStartupCount, show_count);\n}\n\nbool SyncPromoUI::HasUserSkippedSyncPromo(Profile* profile) {\n return profile->GetPrefs()->GetBoolean(prefs::kSyncPromoUserSkipped);\n}\n\nvoid SyncPromoUI::SetUserSkippedSyncPromo(Profile* profile) {\n profile->GetPrefs()->SetBoolean(prefs::kSyncPromoUserSkipped, true);\n}\n\n\/\/ static\nGURL SyncPromoUI::GetSyncPromoURL(const GURL& next_page,\n bool show_title,\n const std::string& source) {\n std::stringstream stream;\n stream << chrome::kChromeUISyncPromoURL << \"?\"\n << kSyncPromoQueryKeyIsLaunchPage << \"=\"\n << (show_title ? \"true\" : \"false\") << \"&\"\n << kSyncPromoQueryKeySource << \"=\" << source;\n\n if (!next_page.spec().empty()) {\n url_canon::RawCanonOutputT<char> output;\n url_util::EncodeURIComponent(\n next_page.spec().c_str(), next_page.spec().length(), &output);\n std::string escaped_spec(output.data(), output.length());\n stream << \"&\" << kSyncPromoQueryKeyNextPage << \"=\" << escaped_spec;\n }\n\n return GURL(stream.str());\n}\n\n\/\/ static\nbool SyncPromoUI::GetIsLaunchPageForSyncPromoURL(const GURL& url) {\n std::string value;\n \/\/ Show the title if the promo is currently the Chrome launch page (and not\n \/\/ the page accessed through the NTP).\n if (GetValueForKeyInQuery(url, kSyncPromoQueryKeyIsLaunchPage, &value))\n return value == \"true\";\n return false;\n}\n\n\/\/ static\nGURL SyncPromoUI::GetNextPageURLForSyncPromoURL(const GURL& url) {\n std::string value;\n if (GetValueForKeyInQuery(url, kSyncPromoQueryKeyNextPage, &value)) {\n url_canon::RawCanonOutputT<char16> output;\n url_util::DecodeURLEscapeSequences(value.c_str(), value.length(), &output);\n std::string url;\n UTF16ToUTF8(output.data(), output.length(), &url);\n return GURL(url);\n }\n return GURL();\n}\n\n\/\/ static\nstd::string SyncPromoUI::GetSourceForSyncPromoURL(const GURL& url) {\n std::string value;\n return GetValueForKeyInQuery(url, kSyncPromoQueryKeySource, &value) ?\n value : std::string();\n}\n\n\/\/ static\nSyncPromoUI::Version SyncPromoUI::GetSyncPromoVersion() {\n Version version;\n if (sync_promo_trial::GetSyncPromoVersionForCurrentTrial(&version)) {\n \/\/ Currently the sync promo dialog has two problems. First, it's not modal\n \/\/ so the user can interact with other browser windows. Second, it uses\n \/\/ a nested message loop that can cause the sync promo page not to render.\n \/\/ To work around these problems the sync promo dialog is only shown for\n \/\/ the first profile. TODO(sail): Fix these issues if the sync promo dialog\n \/\/ is more widely deployed.\n ProfileInfoCache& cache =\n g_browser_process->profile_manager()->GetProfileInfoCache();\n if (cache.GetNumberOfProfiles() > 1 &&\n version == SyncPromoUI::VERSION_DIALOG) {\n return SyncPromoUI::VERSION_SIMPLE;\n }\n return version;\n }\n\n return VERSION_DEFAULT;\n}\n<commit_msg>Change the default sync promo<commit_after>\/\/ Copyright (c) 2012 The Chromium Authors. All rights reserved.\n\/\/ Use of this source code is governed by a BSD-style license that can be\n\/\/ found in the LICENSE file.\n\n#include \"chrome\/browser\/ui\/webui\/sync_promo\/sync_promo_ui.h\"\n\n#include \"base\/command_line.h\"\n#include \"base\/utf_string_conversions.h\"\n#include \"chrome\/browser\/browser_process.h\"\n#include \"chrome\/browser\/first_run\/first_run.h\"\n#include \"chrome\/browser\/google\/google_util.h\"\n#include \"chrome\/browser\/prefs\/pref_service.h\"\n#include \"chrome\/browser\/profiles\/profile.h\"\n#include \"chrome\/browser\/profiles\/profile_info_cache.h\"\n#include \"chrome\/browser\/profiles\/profile_manager.h\"\n#include \"chrome\/browser\/sync\/profile_sync_service.h\"\n#include \"chrome\/browser\/sync\/profile_sync_service_factory.h\"\n#include \"chrome\/browser\/ui\/webui\/chrome_url_data_manager.h\"\n#include \"chrome\/browser\/ui\/webui\/chrome_web_ui_data_source.h\"\n#include \"chrome\/browser\/ui\/webui\/options\/core_options_handler.h\"\n#include \"chrome\/browser\/ui\/webui\/sync_promo\/sync_promo_handler.h\"\n#include \"chrome\/browser\/ui\/webui\/sync_promo\/sync_promo_trial.h\"\n#include \"chrome\/browser\/ui\/webui\/theme_source.h\"\n#include \"chrome\/common\/chrome_switches.h\"\n#include \"chrome\/common\/pref_names.h\"\n#include \"chrome\/common\/url_constants.h\"\n#include \"content\/public\/browser\/web_contents.h\"\n#include \"content\/public\/browser\/web_ui.h\"\n#include \"googleurl\/src\/url_util.h\"\n#include \"grit\/browser_resources.h\"\n#include \"grit\/generated_resources.h\"\n#include \"grit\/theme_resources.h\"\n#include \"ui\/base\/l10n\/l10n_util.h\"\n\nusing content::WebContents;\n\nnamespace {\n\nconst char kStringsJsFile[] = \"strings.js\";\nconst char kSyncPromoJsFile[] = \"sync_promo.js\";\n\nconst char kSyncPromoQueryKeyIsLaunchPage[] = \"is_launch_page\";\nconst char kSyncPromoQueryKeyNextPage[] = \"next_page\";\nconst char kSyncPromoQueryKeySource[] = \"source\";\n\n\/\/ The maximum number of times we want to show the sync promo at startup.\nconst int kSyncPromoShowAtStartupMaximum = 10;\n\n\/\/ Checks we want to show the sync promo for the given brand.\nbool AllowPromoAtStartupForCurrentBrand() {\n std::string brand;\n google_util::GetBrand(&brand);\n\n if (brand.empty())\n return true;\n\n if (google_util::IsInternetCafeBrandCode(brand))\n return false;\n\n if (google_util::IsOrganic(brand))\n return true;\n\n if (StartsWithASCII(brand, \"CH\", true))\n return true;\n\n \/\/ Default to disallow for all other brand codes.\n return false;\n}\n\n\/\/ The Web UI data source for the sync promo page.\nclass SyncPromoUIHTMLSource : public ChromeWebUIDataSource {\n public:\n explicit SyncPromoUIHTMLSource(content::WebUI* web_ui);\n\n private:\n ~SyncPromoUIHTMLSource() {}\n DISALLOW_COPY_AND_ASSIGN(SyncPromoUIHTMLSource);\n};\n\nSyncPromoUIHTMLSource::SyncPromoUIHTMLSource(content::WebUI* web_ui)\n : ChromeWebUIDataSource(chrome::kChromeUISyncPromoHost) {\n DictionaryValue localized_strings;\n CoreOptionsHandler::GetStaticLocalizedValues(&localized_strings);\n SyncSetupHandler::GetStaticLocalizedValues(&localized_strings, web_ui);\n AddLocalizedStrings(localized_strings);\n}\n\n\/\/ Looks for |search_key| in the query portion of |url|. Returns true if the\n\/\/ key is found and sets |out_value| to the value for the key. Returns false if\n\/\/ the key is not found.\nbool GetValueForKeyInQuery(const GURL& url, const std::string& search_key,\n std::string* out_value) {\n url_parse::Component query = url.parsed_for_possibly_invalid_spec().query;\n url_parse::Component key, value;\n while (url_parse::ExtractQueryKeyValue(\n url.spec().c_str(), &query, &key, &value)) {\n if (key.is_nonempty()) {\n std::string key_string = url.spec().substr(key.begin, key.len);\n if (key_string == search_key) {\n if (value.is_nonempty())\n *out_value = url.spec().substr(value.begin, value.len);\n else\n *out_value = \"\";\n return true;\n }\n }\n }\n return false;\n}\n\n} \/\/ namespace\n\nSyncPromoUI::SyncPromoUI(content::WebUI* web_ui) : WebUIController(web_ui) {\n SyncPromoHandler* handler = new SyncPromoHandler(\n GetSourceForSyncPromoURL(web_ui->GetWebContents()->GetURL()),\n g_browser_process->profile_manager());\n web_ui->AddMessageHandler(handler);\n\n \/\/ Set up the chrome:\/\/theme\/ source.\n Profile* profile = Profile::FromWebUI(web_ui);\n ThemeSource* theme = new ThemeSource(profile);\n profile->GetChromeURLDataManager()->AddDataSource(theme);\n\n \/\/ Set up the sync promo source.\n SyncPromoUIHTMLSource* html_source = new SyncPromoUIHTMLSource(web_ui);\n html_source->set_json_path(kStringsJsFile);\n html_source->add_resource_path(kSyncPromoJsFile, IDR_SYNC_PROMO_JS);\n html_source->set_default_resource(IDR_SYNC_PROMO_HTML);\n profile->GetChromeURLDataManager()->AddDataSource(html_source);\n\n sync_promo_trial::RecordUserShownPromo(web_ui);\n}\n\n\/\/ static\nbool SyncPromoUI::HasShownPromoAtStartup(Profile* profile) {\n return profile->GetPrefs()->HasPrefPath(prefs::kSyncPromoStartupCount);\n}\n\n\/\/ static\nbool SyncPromoUI::ShouldShowSyncPromo(Profile* profile) {\n#if defined(OS_CHROMEOS)\n \/\/ There's no need to show the sync promo on cros since cros users are logged\n \/\/ into sync already.\n return false;\n#endif\n\n \/\/ Honor the sync policies.\n if (!profile->GetOriginalProfile()->IsSyncAccessible())\n return false;\n\n \/\/ If the user is already signed into sync then don't show the promo.\n ProfileSyncService* service =\n ProfileSyncServiceFactory::GetInstance()->GetForProfile(\n profile->GetOriginalProfile());\n if (!service || service->HasSyncSetupCompleted())\n return false;\n\n \/\/ Default to allow the promo.\n return true;\n}\n\n\/\/ static\nvoid SyncPromoUI::RegisterUserPrefs(PrefService* prefs) {\n prefs->RegisterIntegerPref(\n prefs::kSyncPromoStartupCount, 0, PrefService::UNSYNCABLE_PREF);\n prefs->RegisterBooleanPref(\n prefs::kSyncPromoUserSkipped, false, PrefService::UNSYNCABLE_PREF);\n prefs->RegisterBooleanPref(prefs::kSyncPromoShowOnFirstRunAllowed, true,\n PrefService::UNSYNCABLE_PREF);\n\n SyncPromoHandler::RegisterUserPrefs(prefs);\n}\n\n\/\/ static\nbool SyncPromoUI::ShouldShowSyncPromoAtStartup(Profile* profile,\n bool is_new_profile,\n bool* promo_suppressed) {\n DCHECK(profile);\n DCHECK(promo_suppressed);\n *promo_suppressed = false;\n\n if (!ShouldShowSyncPromo(profile))\n return false;\n\n const CommandLine& command_line = *CommandLine::ForCurrentProcess();\n if (command_line.HasSwitch(switches::kNoFirstRun))\n is_new_profile = false;\n\n if (!is_new_profile) {\n if (!HasShownPromoAtStartup(profile))\n return false;\n }\n\n if (HasUserSkippedSyncPromo(profile))\n return false;\n\n \/\/ For Chinese users skip the sync promo.\n if (g_browser_process->GetApplicationLocale() == \"zh-CN\")\n return false;\n\n PrefService* prefs = profile->GetPrefs();\n int show_count = prefs->GetInteger(prefs::kSyncPromoStartupCount);\n if (show_count >= kSyncPromoShowAtStartupMaximum)\n return false;\n\n \/\/ If the current install is part of trial then let the trial determine if we\n \/\/ should show the promo or not.\n switch (sync_promo_trial::GetStartupOverrideForCurrentTrial()) {\n case sync_promo_trial::STARTUP_OVERRIDE_NONE:\n \/\/ No override so simply continue.\n break;\n case sync_promo_trial::STARTUP_OVERRIDE_SHOW:\n return true;\n case sync_promo_trial::STARTUP_OVERRIDE_HIDE:\n *promo_suppressed = true;\n return false;\n }\n\n \/\/ This pref can be set in the master preferences file to allow or disallow\n \/\/ showing the sync promo at startup.\n if (prefs->HasPrefPath(prefs::kSyncPromoShowOnFirstRunAllowed))\n return prefs->GetBoolean(prefs::kSyncPromoShowOnFirstRunAllowed);\n\n \/\/ For now don't show the promo for some brands.\n if (!AllowPromoAtStartupForCurrentBrand())\n return false;\n\n \/\/ Default to show the promo for Google Chrome builds.\n#if defined(GOOGLE_CHROME_BUILD)\n return true;\n#else\n return false;\n#endif\n}\n\nvoid SyncPromoUI::DidShowSyncPromoAtStartup(Profile* profile) {\n int show_count = profile->GetPrefs()->GetInteger(\n prefs::kSyncPromoStartupCount);\n show_count++;\n profile->GetPrefs()->SetInteger(prefs::kSyncPromoStartupCount, show_count);\n}\n\nbool SyncPromoUI::HasUserSkippedSyncPromo(Profile* profile) {\n return profile->GetPrefs()->GetBoolean(prefs::kSyncPromoUserSkipped);\n}\n\nvoid SyncPromoUI::SetUserSkippedSyncPromo(Profile* profile) {\n profile->GetPrefs()->SetBoolean(prefs::kSyncPromoUserSkipped, true);\n}\n\n\/\/ static\nGURL SyncPromoUI::GetSyncPromoURL(const GURL& next_page,\n bool show_title,\n const std::string& source) {\n std::stringstream stream;\n stream << chrome::kChromeUISyncPromoURL << \"?\"\n << kSyncPromoQueryKeyIsLaunchPage << \"=\"\n << (show_title ? \"true\" : \"false\") << \"&\"\n << kSyncPromoQueryKeySource << \"=\" << source;\n\n if (!next_page.spec().empty()) {\n url_canon::RawCanonOutputT<char> output;\n url_util::EncodeURIComponent(\n next_page.spec().c_str(), next_page.spec().length(), &output);\n std::string escaped_spec(output.data(), output.length());\n stream << \"&\" << kSyncPromoQueryKeyNextPage << \"=\" << escaped_spec;\n }\n\n return GURL(stream.str());\n}\n\n\/\/ static\nbool SyncPromoUI::GetIsLaunchPageForSyncPromoURL(const GURL& url) {\n std::string value;\n \/\/ Show the title if the promo is currently the Chrome launch page (and not\n \/\/ the page accessed through the NTP).\n if (GetValueForKeyInQuery(url, kSyncPromoQueryKeyIsLaunchPage, &value))\n return value == \"true\";\n return false;\n}\n\n\/\/ static\nGURL SyncPromoUI::GetNextPageURLForSyncPromoURL(const GURL& url) {\n std::string value;\n if (GetValueForKeyInQuery(url, kSyncPromoQueryKeyNextPage, &value)) {\n url_canon::RawCanonOutputT<char16> output;\n url_util::DecodeURLEscapeSequences(value.c_str(), value.length(), &output);\n std::string url;\n UTF16ToUTF8(output.data(), output.length(), &url);\n return GURL(url);\n }\n return GURL();\n}\n\n\/\/ static\nstd::string SyncPromoUI::GetSourceForSyncPromoURL(const GURL& url) {\n std::string value;\n return GetValueForKeyInQuery(url, kSyncPromoQueryKeySource, &value) ?\n value : std::string();\n}\n\n\/\/ static\nSyncPromoUI::Version SyncPromoUI::GetSyncPromoVersion() {\n Version version;\n if (sync_promo_trial::GetSyncPromoVersionForCurrentTrial(&version)) {\n \/\/ Currently the sync promo dialog has two problems. First, it's not modal\n \/\/ so the user can interact with other browser windows. Second, it uses\n \/\/ a nested message loop that can cause the sync promo page not to render.\n \/\/ To work around these problems the sync promo dialog is only shown for\n \/\/ the first profile. TODO(sail): Fix these issues if the sync promo dialog\n \/\/ is more widely deployed.\n ProfileInfoCache& cache =\n g_browser_process->profile_manager()->GetProfileInfoCache();\n if (cache.GetNumberOfProfiles() > 1 &&\n version == SyncPromoUI::VERSION_DIALOG) {\n return SyncPromoUI::VERSION_SIMPLE;\n }\n return version;\n }\n\n return VERSION_SIMPLE;\n}\n<|endoftext|>"} {"text":"<commit_before>\/\/ Copyright (c) 2006-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\/\/ This file defines specific implementation of BrowserDistribution class for\n\/\/ Google Chrome.\n\n#include \"chrome\/installer\/util\/google_chrome_distribution.h\"\n\n#include <atlbase.h>\n#include <windows.h>\n#include <msi.h>\n\n#include \"base\/file_path.h\"\n#include \"base\/path_service.h\"\n#include \"base\/registry.h\"\n#include \"base\/scoped_ptr.h\"\n#include \"base\/string_util.h\"\n#include \"base\/wmi_util.h\"\n#include \"chrome\/common\/json_value_serializer.h\"\n#include \"chrome\/common\/pref_names.h\"\n#include \"chrome\/installer\/util\/l10n_string_util.h\"\n#include \"chrome\/installer\/util\/google_update_constants.h\"\n#include \"chrome\/installer\/util\/google_update_settings.h\"\n#include \"chrome\/installer\/util\/util_constants.h\"\n\n#include \"installer_util_strings.h\"\n\nnamespace {\n\/\/ Substitute the locale parameter in uninstall URL with whatever\n\/\/ Google Update tells us is the locale. In case we fail to find\n\/\/ the locale, we use US English.\nstd::wstring GetUninstallSurveyUrl() {\n std::wstring kSurveyUrl = L\"http:\/\/www.google.com\/support\/chrome\/bin\/\"\n L\"request.py?hl=$1&contact_type=uninstall\";\n\n std::wstring language;\n if (!GoogleUpdateSettings::GetLanguage(&language))\n language = L\"en-US\"; \/\/ Default to US English.\n\n return ReplaceStringPlaceholders(kSurveyUrl.c_str(), language.c_str(), NULL);\n}\n}\n\nbool GoogleChromeDistribution::BuildUninstallMetricsString(\n DictionaryValue* uninstall_metrics_dict, std::wstring* metrics) {\n DCHECK(NULL != metrics);\n bool has_values = false;\n\n DictionaryValue::key_iterator iter(uninstall_metrics_dict->begin_keys());\n for (; iter != uninstall_metrics_dict->end_keys(); ++iter) {\n has_values = true;\n metrics->append(L\"&\");\n metrics->append(*iter);\n metrics->append(L\"=\");\n\n std::wstring value;\n uninstall_metrics_dict->GetString(*iter, &value);\n metrics->append(value);\n }\n\n return has_values;\n}\n\nbool GoogleChromeDistribution::ExtractUninstallMetricsFromFile(\n const std::wstring& file_path, std::wstring* uninstall_metrics_string) {\n\n JSONFileValueSerializer json_serializer(FilePath::FromWStringHack(file_path));\n\n std::string json_error_string;\n scoped_ptr<Value> root(json_serializer.Deserialize(NULL));\n if (!root.get())\n return false;\n\n \/\/ Preferences should always have a dictionary root.\n if (!root->IsType(Value::TYPE_DICTIONARY))\n return false;\n\n return ExtractUninstallMetrics(*static_cast<DictionaryValue*>(root.get()),\n uninstall_metrics_string);\n}\n\nbool GoogleChromeDistribution::ExtractUninstallMetrics(\n const DictionaryValue& root, std::wstring* uninstall_metrics_string) {\n \/\/ Make sure that the user wants us reporting metrics. If not, don't\n \/\/ add our uninstall metrics.\n bool metrics_reporting_enabled = false;\n if (!root.GetBoolean(prefs::kMetricsReportingEnabled,\n &metrics_reporting_enabled) ||\n !metrics_reporting_enabled) {\n return false;\n }\n\n DictionaryValue* uninstall_metrics_dict;\n if (!root.HasKey(installer_util::kUninstallMetricsName) ||\n !root.GetDictionary(installer_util::kUninstallMetricsName,\n &uninstall_metrics_dict)) {\n return false;\n }\n\n if (!BuildUninstallMetricsString(uninstall_metrics_dict,\n uninstall_metrics_string)) {\n return false;\n }\n\n return true;\n}\n\nvoid GoogleChromeDistribution::DoPostUninstallOperations(\n const installer::Version& version, const std::wstring& local_data_path,\n const std::wstring& distribution_data) {\n \/\/ Send the Chrome version and OS version as params to the form.\n \/\/ It would be nice to send the locale, too, but I don't see an\n \/\/ easy way to get that in the existing code. It's something we\n \/\/ can add later, if needed.\n \/\/ We depend on installed_version.GetString() not having spaces or other\n \/\/ characters that need escaping: 0.2.13.4. Should that change, we will\n \/\/ need to escape the string before using it in a URL.\n const std::wstring kVersionParam = L\"crversion\";\n const std::wstring kVersion = version.GetString();\n const std::wstring kOSParam = L\"os\";\n std::wstring os_version = L\"na\";\n OSVERSIONINFO version_info;\n version_info.dwOSVersionInfoSize = sizeof(version_info);\n if (GetVersionEx(&version_info)) {\n os_version = StringPrintf(L\"%d.%d.%d\", version_info.dwMajorVersion,\n version_info.dwMinorVersion,\n version_info.dwBuildNumber);\n }\n\n FilePath iexplore;\n if (!PathService::Get(base::DIR_PROGRAM_FILES, &iexplore))\n return;\n\n iexplore = iexplore.AppendASCII(\"Internet Explorer\");\n iexplore = iexplore.AppendASCII(\"iexplore.exe\");\n\n std::wstring command = iexplore.value() + L\" \" + GetUninstallSurveyUrl() +\n L\"&\" + kVersionParam + L\"=\" + kVersion + L\"&\" + kOSParam + L\"=\" +\n os_version;\n\n std::wstring uninstall_metrics;\n if (ExtractUninstallMetricsFromFile(local_data_path, &uninstall_metrics)) {\n \/\/ The user has opted into anonymous usage data collection, so append\n \/\/ metrics and distribution data.\n command += uninstall_metrics;\n if (!distribution_data.empty()) {\n command += L\"&\";\n command += distribution_data;\n }\n }\n\n int pid = 0;\n WMIProcessUtil::Launch(command, &pid);\n}\n\nstd::wstring GoogleChromeDistribution::GetApplicationName() {\n const std::wstring& product_name =\n installer_util::GetLocalizedString(IDS_PRODUCT_NAME_BASE);\n return product_name;\n}\n\nstd::wstring GoogleChromeDistribution::GetAlternateApplicationName() {\n const std::wstring& alt_product_name =\n installer_util::GetLocalizedString(IDS_OEM_MAIN_SHORTCUT_NAME_BASE);\n return alt_product_name;\n}\n\nstd::wstring GoogleChromeDistribution::GetInstallSubDir() {\n return L\"Google\\\\Chrome\";\n}\n\nstd::wstring GoogleChromeDistribution::GetNewGoogleUpdateApKey(\n bool diff_install, installer_util::InstallStatus status,\n const std::wstring& value) {\n \/\/ Magic suffix that we need to add or remove to \"ap\" key value.\n const std::wstring kMagicSuffix = L\"-full\";\n\n bool has_magic_string = false;\n if ((value.length() >= kMagicSuffix.length()) &&\n (value.rfind(kMagicSuffix) == (value.length() - kMagicSuffix.length()))) {\n LOG(INFO) << \"Incremental installer failure key already set.\";\n has_magic_string = true;\n }\n\n std::wstring new_value(value);\n if ((!diff_install || !GetInstallReturnCode(status)) && has_magic_string) {\n LOG(INFO) << \"Removing failure key from value \" << value;\n new_value = value.substr(0, value.length() - kMagicSuffix.length());\n } else if ((diff_install && GetInstallReturnCode(status)) &&\n !has_magic_string) {\n LOG(INFO) << \"Incremental installer failed, setting failure key.\";\n new_value.append(kMagicSuffix);\n }\n\n return new_value;\n}\n\nstd::wstring GoogleChromeDistribution::GetPublisherName() {\n const std::wstring& publisher_name =\n installer_util::GetLocalizedString(IDS_ABOUT_VERSION_COMPANY_NAME_BASE);\n return publisher_name;\n}\n\nstd::wstring GoogleChromeDistribution::GetAppDescription() {\n const std::wstring& app_description =\n installer_util::GetLocalizedString(IDS_SHORTCUT_TOOLTIP_BASE);\n return app_description;\n}\n\nint GoogleChromeDistribution::GetInstallReturnCode(\n installer_util::InstallStatus status) {\n switch (status) {\n case installer_util::FIRST_INSTALL_SUCCESS:\n case installer_util::INSTALL_REPAIRED:\n case installer_util::NEW_VERSION_UPDATED:\n case installer_util::HIGHER_VERSION_EXISTS:\n return 0; \/\/ For Google Update's benefit we need to return 0 for success\n default:\n return status;\n }\n}\n\nstd::wstring GoogleChromeDistribution::GetStateKey() {\n std::wstring key(google_update::kRegPathClientState);\n key.append(L\"\\\\\");\n key.append(google_update::kChromeGuid);\n return key;\n}\n\nstd::wstring GoogleChromeDistribution::GetStateMediumKey() {\n std::wstring key(google_update::kRegPathClientStateMedium);\n key.append(L\"\\\\\");\n key.append(google_update::kChromeGuid);\n return key;\n}\n\nstd::wstring GoogleChromeDistribution::GetStatsServerURL() {\n return L\"https:\/\/clients4.google.com\/firefox\/metrics\/collect\";\n}\n\nstd::wstring GoogleChromeDistribution::GetDistributionData(RegKey* key) {\n DCHECK(NULL != key);\n std::wstring sub_key(google_update::kRegPathClientState);\n sub_key.append(L\"\\\\\");\n sub_key.append(google_update::kChromeGuid);\n\n RegKey client_state_key(key->Handle(), sub_key.c_str());\n std::wstring result;\n std::wstring brand_value;\n if (client_state_key.ReadValue(google_update::kRegRLZBrandField,\n &brand_value)) {\n result = google_update::kRegRLZBrandField;\n result.append(L\"=\");\n result.append(brand_value);\n }\n\n return result;\n}\n\nstd::wstring GoogleChromeDistribution::GetUninstallLinkName() {\n const std::wstring& link_name =\n installer_util::GetLocalizedString(IDS_UNINSTALL_CHROME_BASE);\n return link_name;\n}\n\nstd::wstring GoogleChromeDistribution::GetUninstallRegPath() {\n return L\"Software\\\\Microsoft\\\\Windows\\\\CurrentVersion\\\\Uninstall\\\\\"\n L\"Google Chrome\";\n}\n\nstd::wstring GoogleChromeDistribution::GetVersionKey() {\n std::wstring key(google_update::kRegPathClients);\n key.append(L\"\\\\\");\n key.append(google_update::kChromeGuid);\n return key;\n}\n\n\/\/ This method checks if we need to change \"ap\" key in Google Update to try\n\/\/ full installer as fall back method in case incremental installer fails.\n\/\/ - If incremental installer fails we append a magic string (\"-full\"), if\n\/\/ it is not present already, so that Google Update server next time will send\n\/\/ full installer to update Chrome on the local machine\n\/\/ - If we are currently running full installer, we remove this magic\n\/\/ string (if it is present) regardless of whether installer failed or not.\n\/\/ There is no fall-back for full installer :)\nvoid GoogleChromeDistribution::UpdateDiffInstallStatus(bool system_install,\n bool incremental_install, installer_util::InstallStatus install_status) {\n HKEY reg_root = (system_install) ? HKEY_LOCAL_MACHINE : HKEY_CURRENT_USER;\n\n RegKey key;\n std::wstring ap_key_value;\n std::wstring reg_key(google_update::kRegPathClientState);\n reg_key.append(L\"\\\\\");\n reg_key.append(google_update::kChromeGuid);\n if (!key.Open(reg_root, reg_key.c_str(), KEY_ALL_ACCESS) ||\n !key.ReadValue(google_update::kRegApField, &ap_key_value)) {\n LOG(INFO) << \"Application key not found.\";\n if (!incremental_install || !GetInstallReturnCode(install_status)) {\n LOG(INFO) << \"Returning without changing application key.\";\n key.Close();\n return;\n } else if (!key.Valid()) {\n reg_key.assign(google_update::kRegPathClientState);\n if (!key.Open(reg_root, reg_key.c_str(), KEY_ALL_ACCESS) ||\n !key.CreateKey(google_update::kChromeGuid, KEY_ALL_ACCESS)) {\n LOG(ERROR) << \"Failed to create application key.\";\n key.Close();\n return;\n }\n }\n }\n\n std::wstring new_value = GoogleChromeDistribution::GetNewGoogleUpdateApKey(\n incremental_install, install_status, ap_key_value);\n if ((new_value.compare(ap_key_value) != 0) &&\n !key.WriteValue(google_update::kRegApField, new_value.c_str())) {\n LOG(ERROR) << \"Failed to write value \" << new_value\n << \" to the registry field \" << google_update::kRegApField;\n }\n key.Close();\n}\n<commit_msg>Adding ap key inclusion to uninstall metrics.<commit_after>\/\/ Copyright (c) 2006-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\/\/ This file defines specific implementation of BrowserDistribution class for\n\/\/ Google Chrome.\n\n#include \"chrome\/installer\/util\/google_chrome_distribution.h\"\n\n#include <atlbase.h>\n#include <windows.h>\n#include <msi.h>\n\n#include \"base\/file_path.h\"\n#include \"base\/path_service.h\"\n#include \"base\/registry.h\"\n#include \"base\/scoped_ptr.h\"\n#include \"base\/string_util.h\"\n#include \"base\/wmi_util.h\"\n#include \"chrome\/common\/json_value_serializer.h\"\n#include \"chrome\/common\/pref_names.h\"\n#include \"chrome\/installer\/util\/l10n_string_util.h\"\n#include \"chrome\/installer\/util\/google_update_constants.h\"\n#include \"chrome\/installer\/util\/google_update_settings.h\"\n#include \"chrome\/installer\/util\/util_constants.h\"\n\n#include \"installer_util_strings.h\"\n\nnamespace {\n\/\/ Substitute the locale parameter in uninstall URL with whatever\n\/\/ Google Update tells us is the locale. In case we fail to find\n\/\/ the locale, we use US English.\nstd::wstring GetUninstallSurveyUrl() {\n std::wstring kSurveyUrl = L\"http:\/\/www.google.com\/support\/chrome\/bin\/\"\n L\"request.py?hl=$1&contact_type=uninstall\";\n\n std::wstring language;\n if (!GoogleUpdateSettings::GetLanguage(&language))\n language = L\"en-US\"; \/\/ Default to US English.\n\n return ReplaceStringPlaceholders(kSurveyUrl.c_str(), language.c_str(), NULL);\n}\n}\n\nbool GoogleChromeDistribution::BuildUninstallMetricsString(\n DictionaryValue* uninstall_metrics_dict, std::wstring* metrics) {\n DCHECK(NULL != metrics);\n bool has_values = false;\n\n DictionaryValue::key_iterator iter(uninstall_metrics_dict->begin_keys());\n for (; iter != uninstall_metrics_dict->end_keys(); ++iter) {\n has_values = true;\n metrics->append(L\"&\");\n metrics->append(*iter);\n metrics->append(L\"=\");\n\n std::wstring value;\n uninstall_metrics_dict->GetString(*iter, &value);\n metrics->append(value);\n }\n\n return has_values;\n}\n\nbool GoogleChromeDistribution::ExtractUninstallMetricsFromFile(\n const std::wstring& file_path, std::wstring* uninstall_metrics_string) {\n\n JSONFileValueSerializer json_serializer(FilePath::FromWStringHack(file_path));\n\n std::string json_error_string;\n scoped_ptr<Value> root(json_serializer.Deserialize(NULL));\n if (!root.get())\n return false;\n\n \/\/ Preferences should always have a dictionary root.\n if (!root->IsType(Value::TYPE_DICTIONARY))\n return false;\n\n return ExtractUninstallMetrics(*static_cast<DictionaryValue*>(root.get()),\n uninstall_metrics_string);\n}\n\nbool GoogleChromeDistribution::ExtractUninstallMetrics(\n const DictionaryValue& root, std::wstring* uninstall_metrics_string) {\n \/\/ Make sure that the user wants us reporting metrics. If not, don't\n \/\/ add our uninstall metrics.\n bool metrics_reporting_enabled = false;\n if (!root.GetBoolean(prefs::kMetricsReportingEnabled,\n &metrics_reporting_enabled) ||\n !metrics_reporting_enabled) {\n return false;\n }\n\n DictionaryValue* uninstall_metrics_dict;\n if (!root.HasKey(installer_util::kUninstallMetricsName) ||\n !root.GetDictionary(installer_util::kUninstallMetricsName,\n &uninstall_metrics_dict)) {\n return false;\n }\n\n if (!BuildUninstallMetricsString(uninstall_metrics_dict,\n uninstall_metrics_string)) {\n return false;\n }\n\n return true;\n}\n\nvoid GoogleChromeDistribution::DoPostUninstallOperations(\n const installer::Version& version, const std::wstring& local_data_path,\n const std::wstring& distribution_data) {\n \/\/ Send the Chrome version and OS version as params to the form.\n \/\/ It would be nice to send the locale, too, but I don't see an\n \/\/ easy way to get that in the existing code. It's something we\n \/\/ can add later, if needed.\n \/\/ We depend on installed_version.GetString() not having spaces or other\n \/\/ characters that need escaping: 0.2.13.4. Should that change, we will\n \/\/ need to escape the string before using it in a URL.\n const std::wstring kVersionParam = L\"crversion\";\n const std::wstring kVersion = version.GetString();\n const std::wstring kOSParam = L\"os\";\n std::wstring os_version = L\"na\";\n OSVERSIONINFO version_info;\n version_info.dwOSVersionInfoSize = sizeof(version_info);\n if (GetVersionEx(&version_info)) {\n os_version = StringPrintf(L\"%d.%d.%d\", version_info.dwMajorVersion,\n version_info.dwMinorVersion,\n version_info.dwBuildNumber);\n }\n\n FilePath iexplore;\n if (!PathService::Get(base::DIR_PROGRAM_FILES, &iexplore))\n return;\n\n iexplore = iexplore.AppendASCII(\"Internet Explorer\");\n iexplore = iexplore.AppendASCII(\"iexplore.exe\");\n\n std::wstring command = iexplore.value() + L\" \" + GetUninstallSurveyUrl() +\n L\"&\" + kVersionParam + L\"=\" + kVersion + L\"&\" + kOSParam + L\"=\" +\n os_version;\n\n std::wstring uninstall_metrics;\n if (ExtractUninstallMetricsFromFile(local_data_path, &uninstall_metrics)) {\n \/\/ The user has opted into anonymous usage data collection, so append\n \/\/ metrics and distribution data.\n command += uninstall_metrics;\n if (!distribution_data.empty()) {\n command += L\"&\";\n command += distribution_data;\n }\n }\n\n int pid = 0;\n WMIProcessUtil::Launch(command, &pid);\n}\n\nstd::wstring GoogleChromeDistribution::GetApplicationName() {\n const std::wstring& product_name =\n installer_util::GetLocalizedString(IDS_PRODUCT_NAME_BASE);\n return product_name;\n}\n\nstd::wstring GoogleChromeDistribution::GetAlternateApplicationName() {\n const std::wstring& alt_product_name =\n installer_util::GetLocalizedString(IDS_OEM_MAIN_SHORTCUT_NAME_BASE);\n return alt_product_name;\n}\n\nstd::wstring GoogleChromeDistribution::GetInstallSubDir() {\n return L\"Google\\\\Chrome\";\n}\n\nstd::wstring GoogleChromeDistribution::GetNewGoogleUpdateApKey(\n bool diff_install, installer_util::InstallStatus status,\n const std::wstring& value) {\n \/\/ Magic suffix that we need to add or remove to \"ap\" key value.\n const std::wstring kMagicSuffix = L\"-full\";\n\n bool has_magic_string = false;\n if ((value.length() >= kMagicSuffix.length()) &&\n (value.rfind(kMagicSuffix) == (value.length() - kMagicSuffix.length()))) {\n LOG(INFO) << \"Incremental installer failure key already set.\";\n has_magic_string = true;\n }\n\n std::wstring new_value(value);\n if ((!diff_install || !GetInstallReturnCode(status)) && has_magic_string) {\n LOG(INFO) << \"Removing failure key from value \" << value;\n new_value = value.substr(0, value.length() - kMagicSuffix.length());\n } else if ((diff_install && GetInstallReturnCode(status)) &&\n !has_magic_string) {\n LOG(INFO) << \"Incremental installer failed, setting failure key.\";\n new_value.append(kMagicSuffix);\n }\n\n return new_value;\n}\n\nstd::wstring GoogleChromeDistribution::GetPublisherName() {\n const std::wstring& publisher_name =\n installer_util::GetLocalizedString(IDS_ABOUT_VERSION_COMPANY_NAME_BASE);\n return publisher_name;\n}\n\nstd::wstring GoogleChromeDistribution::GetAppDescription() {\n const std::wstring& app_description =\n installer_util::GetLocalizedString(IDS_SHORTCUT_TOOLTIP_BASE);\n return app_description;\n}\n\nint GoogleChromeDistribution::GetInstallReturnCode(\n installer_util::InstallStatus status) {\n switch (status) {\n case installer_util::FIRST_INSTALL_SUCCESS:\n case installer_util::INSTALL_REPAIRED:\n case installer_util::NEW_VERSION_UPDATED:\n case installer_util::HIGHER_VERSION_EXISTS:\n return 0; \/\/ For Google Update's benefit we need to return 0 for success\n default:\n return status;\n }\n}\n\nstd::wstring GoogleChromeDistribution::GetStateKey() {\n std::wstring key(google_update::kRegPathClientState);\n key.append(L\"\\\\\");\n key.append(google_update::kChromeGuid);\n return key;\n}\n\nstd::wstring GoogleChromeDistribution::GetStateMediumKey() {\n std::wstring key(google_update::kRegPathClientStateMedium);\n key.append(L\"\\\\\");\n key.append(google_update::kChromeGuid);\n return key;\n}\n\nstd::wstring GoogleChromeDistribution::GetStatsServerURL() {\n return L\"https:\/\/clients4.google.com\/firefox\/metrics\/collect\";\n}\n\nstd::wstring GoogleChromeDistribution::GetDistributionData(RegKey* key) {\n DCHECK(NULL != key);\n std::wstring sub_key(google_update::kRegPathClientState);\n sub_key.append(L\"\\\\\");\n sub_key.append(google_update::kChromeGuid);\n\n RegKey client_state_key(key->Handle(), sub_key.c_str());\n std::wstring result;\n std::wstring brand_value;\n if (client_state_key.ReadValue(google_update::kRegRLZBrandField,\n &brand_value)) {\n result = google_update::kRegRLZBrandField;\n result.append(L\"=\");\n result.append(brand_value);\n result.append(L\"&\");\n }\n\n std::wstring ap_value;\n \/\/ If we fail to read the ap key, send up \"&ap=\" anyway to indicate\n \/\/ that this was probably a stable channel release.\n client_state_key.ReadValue(google_update::kRegApField, &ap_value);\n result.append(google_update::kRegApField);\n result.append(L\"=\");\n result.append(ap_value);\n\n return result;\n}\n\nstd::wstring GoogleChromeDistribution::GetUninstallLinkName() {\n const std::wstring& link_name =\n installer_util::GetLocalizedString(IDS_UNINSTALL_CHROME_BASE);\n return link_name;\n}\n\nstd::wstring GoogleChromeDistribution::GetUninstallRegPath() {\n return L\"Software\\\\Microsoft\\\\Windows\\\\CurrentVersion\\\\Uninstall\\\\\"\n L\"Google Chrome\";\n}\n\nstd::wstring GoogleChromeDistribution::GetVersionKey() {\n std::wstring key(google_update::kRegPathClients);\n key.append(L\"\\\\\");\n key.append(google_update::kChromeGuid);\n return key;\n}\n\n\/\/ This method checks if we need to change \"ap\" key in Google Update to try\n\/\/ full installer as fall back method in case incremental installer fails.\n\/\/ - If incremental installer fails we append a magic string (\"-full\"), if\n\/\/ it is not present already, so that Google Update server next time will send\n\/\/ full installer to update Chrome on the local machine\n\/\/ - If we are currently running full installer, we remove this magic\n\/\/ string (if it is present) regardless of whether installer failed or not.\n\/\/ There is no fall-back for full installer :)\nvoid GoogleChromeDistribution::UpdateDiffInstallStatus(bool system_install,\n bool incremental_install, installer_util::InstallStatus install_status) {\n HKEY reg_root = (system_install) ? HKEY_LOCAL_MACHINE : HKEY_CURRENT_USER;\n\n RegKey key;\n std::wstring ap_key_value;\n std::wstring reg_key(google_update::kRegPathClientState);\n reg_key.append(L\"\\\\\");\n reg_key.append(google_update::kChromeGuid);\n if (!key.Open(reg_root, reg_key.c_str(), KEY_ALL_ACCESS) ||\n !key.ReadValue(google_update::kRegApField, &ap_key_value)) {\n LOG(INFO) << \"Application key not found.\";\n if (!incremental_install || !GetInstallReturnCode(install_status)) {\n LOG(INFO) << \"Returning without changing application key.\";\n key.Close();\n return;\n } else if (!key.Valid()) {\n reg_key.assign(google_update::kRegPathClientState);\n if (!key.Open(reg_root, reg_key.c_str(), KEY_ALL_ACCESS) ||\n !key.CreateKey(google_update::kChromeGuid, KEY_ALL_ACCESS)) {\n LOG(ERROR) << \"Failed to create application key.\";\n key.Close();\n return;\n }\n }\n }\n\n std::wstring new_value = GoogleChromeDistribution::GetNewGoogleUpdateApKey(\n incremental_install, install_status, ap_key_value);\n if ((new_value.compare(ap_key_value) != 0) &&\n !key.WriteValue(google_update::kRegApField, new_value.c_str())) {\n LOG(ERROR) << \"Failed to write value \" << new_value\n << \" to the registry field \" << google_update::kRegApField;\n }\n key.Close();\n}\n<|endoftext|>"} {"text":"<commit_before>\/\/ Copyright 2014 The Chromium Authors. All rights reserved.\n\/\/ Use of this source code is governed by a BSD-style license that can be\n\/\/ found in the LICENSE file.\n\n#include \"chrome\/utility\/printing_handler_win.h\"\n\n#include \"base\/files\/file_util.h\"\n#include \"base\/lazy_instance.h\"\n#include \"base\/path_service.h\"\n#include \"base\/scoped_native_library.h\"\n#include \"chrome\/common\/print_messages.h\"\n#include \"content\/public\/utility\/utility_thread.h\"\n#include \"printing\/emf_win.h\"\n#include \"printing\/page_range.h\"\n#include \"printing\/pdf_render_settings.h\"\n#include \"ui\/gfx\/gdi_util.h\"\n\nnamespace {\n\nbool Send(IPC::Message* message) {\n return content::UtilityThread::Get()->Send(message);\n}\n\nvoid ReleaseProcessIfNeeded() {\n content::UtilityThread::Get()->ReleaseProcessIfNeeded();\n}\n\nclass PdfFunctions {\n public:\n PdfFunctions() : get_pdf_doc_info_func_(NULL),\n render_pdf_to_dc_func_(NULL) {}\n\n bool Init() {\n base::FilePath pdf_module_path(FILE_PATH_LITERAL(\"pdf.dll\"));\n pdf_lib_.Reset(base::LoadNativeLibrary(pdf_module_path, NULL));\n if (!pdf_lib_.is_valid()) {\n LOG(WARNING) << \"Couldn't load PDF plugin\";\n return false;\n }\n\n get_pdf_doc_info_func_ =\n reinterpret_cast<GetPDFDocInfoProc>(\n pdf_lib_.GetFunctionPointer(\"GetPDFDocInfo\"));\n LOG_IF(WARNING, !get_pdf_doc_info_func_) << \"Missing GetPDFDocInfo\";\n\n render_pdf_to_dc_func_ =\n reinterpret_cast<RenderPDFPageToDCProc>(\n pdf_lib_.GetFunctionPointer(\"RenderPDFPageToDC\"));\n LOG_IF(WARNING, !render_pdf_to_dc_func_) << \"Missing RenderPDFPageToDC\";\n\n if (!get_pdf_doc_info_func_ || !render_pdf_to_dc_func_) {\n Reset();\n }\n\n return IsValid();\n }\n\n bool IsValid() const {\n return pdf_lib_.is_valid();\n }\n\n void Reset() {\n pdf_lib_.Reset(NULL);\n }\n\n bool GetPDFDocInfo(const void* pdf_buffer,\n int buffer_size,\n int* page_count,\n double* max_page_width) {\n if (!get_pdf_doc_info_func_)\n return false;\n return get_pdf_doc_info_func_(pdf_buffer, buffer_size, page_count,\n max_page_width);\n }\n\n bool RenderPDFPageToDC(const void* pdf_buffer,\n int buffer_size,\n int page_number,\n HDC dc,\n int dpi,\n int bounds_origin_x,\n int bounds_origin_y,\n int bounds_width,\n int bounds_height,\n bool fit_to_bounds,\n bool stretch_to_bounds,\n bool keep_aspect_ratio,\n bool center_in_bounds,\n bool autorotate) {\n if (!render_pdf_to_dc_func_)\n return false;\n return render_pdf_to_dc_func_(pdf_buffer, buffer_size, page_number,\n dc, dpi, bounds_origin_x,\n bounds_origin_y, bounds_width, bounds_height,\n fit_to_bounds, stretch_to_bounds,\n keep_aspect_ratio, center_in_bounds,\n autorotate);\n }\n\n private:\n \/\/ Exported by PDF plugin.\n typedef bool (*GetPDFDocInfoProc)(const void* pdf_buffer,\n int buffer_size, int* page_count,\n double* max_page_width);\n typedef bool (*RenderPDFPageToDCProc)(\n const void* pdf_buffer, int buffer_size, int page_number, HDC dc,\n int dpi, int bounds_origin_x, int bounds_origin_y,\n int bounds_width, int bounds_height, bool fit_to_bounds,\n bool stretch_to_bounds, bool keep_aspect_ratio, bool center_in_bounds,\n bool autorotate);\n\n RenderPDFPageToDCProc render_pdf_to_dc_func_;\n GetPDFDocInfoProc get_pdf_doc_info_func_;\n\n base::ScopedNativeLibrary pdf_lib_;\n\n DISALLOW_COPY_AND_ASSIGN(PdfFunctions);\n};\n\nbase::LazyInstance<PdfFunctions> g_pdf_lib = LAZY_INSTANCE_INITIALIZER;\n\n} \/\/ namespace\n\nPrintingHandlerWin::PrintingHandlerWin() {}\n\nPrintingHandlerWin::~PrintingHandlerWin() {}\n\n\/\/ static\nvoid PrintingHandlerWin::PreSandboxStartup() {\n g_pdf_lib.Get().Init();\n}\n\nbool PrintingHandlerWin::OnMessageReceived(const IPC::Message& message) {\n bool handled = true;\n IPC_BEGIN_MESSAGE_MAP(PrintingHandlerWin, message)\n IPC_MESSAGE_HANDLER(ChromeUtilityMsg_RenderPDFPagesToMetafiles,\n OnRenderPDFPagesToMetafile)\n IPC_MESSAGE_HANDLER(ChromeUtilityMsg_RenderPDFPagesToMetafiles_GetPage,\n OnRenderPDFPagesToMetafileGetPage)\n IPC_MESSAGE_HANDLER(ChromeUtilityMsg_RenderPDFPagesToMetafiles_Stop,\n OnRenderPDFPagesToMetafileStop)\n IPC_MESSAGE_UNHANDLED(handled = false)\n IPC_END_MESSAGE_MAP()\n return handled;\n}\n\nvoid PrintingHandlerWin::OnRenderPDFPagesToMetafile(\n IPC::PlatformFileForTransit pdf_transit,\n const printing::PdfRenderSettings& settings) {\n pdf_rendering_settings_ = settings;\n base::File pdf_file = IPC::PlatformFileForTransitToFile(pdf_transit);\n int page_count = LoadPDF(pdf_file.Pass());\n \/\/int page_count = 1;\n Send(\n new ChromeUtilityHostMsg_RenderPDFPagesToMetafiles_PageCount(page_count));\n}\n\nvoid PrintingHandlerWin::OnRenderPDFPagesToMetafileGetPage(\n int page_number,\n IPC::PlatformFileForTransit output_file) {\n base::File emf_file = IPC::PlatformFileForTransitToFile(output_file);\n float scale_factor = 1.0f;\n bool success =\n RenderPdfPageToMetafile(page_number, emf_file.Pass(), &scale_factor);\n Send(new ChromeUtilityHostMsg_RenderPDFPagesToMetafiles_PageDone(\n success, scale_factor));\n}\n\nvoid PrintingHandlerWin::OnRenderPDFPagesToMetafileStop() {\n ReleaseProcessIfNeeded();\n}\n\nint PrintingHandlerWin::LoadPDF(base::File pdf_file) {\n if (!g_pdf_lib.Get().IsValid())\n return 0;\n\n int64 length64 = pdf_file.GetLength();\n if (length64 <= 0 || length64 > std::numeric_limits<int>::max())\n return 0;\n int length = static_cast<int>(length64);\n\n pdf_data_.resize(length);\n if (length != pdf_file.Read(0, pdf_data_.data(), pdf_data_.size()))\n return 0;\n\n int total_page_count = 0;\n if (!g_pdf_lib.Get().GetPDFDocInfo(\n &pdf_data_.front(), pdf_data_.size(), &total_page_count, NULL)) {\n return 0;\n }\n return total_page_count;\n}\n\nbool PrintingHandlerWin::RenderPdfPageToMetafile(int page_number,\n base::File output_file,\n float* scale_factor) {\n printing::Emf metafile;\n metafile.Init();\n\n \/\/ We need to scale down DC to fit an entire page into DC available area.\n \/\/ Current metafile is based on screen DC and have current screen size.\n \/\/ Writing outside of those boundaries will result in the cut-off output.\n \/\/ On metafiles (this is the case here), scaling down will still record\n \/\/ original coordinates and we'll be able to print in full resolution.\n \/\/ Before playback we'll need to counter the scaling up that will happen\n \/\/ in the service (print_system_win.cc).\n *scale_factor =\n gfx::CalculatePageScale(metafile.context(),\n pdf_rendering_settings_.area().right(),\n pdf_rendering_settings_.area().bottom());\n gfx::ScaleDC(metafile.context(), *scale_factor);\n\n \/\/ The underlying metafile is of type Emf and ignores the arguments passed\n \/\/ to StartPage.\n metafile.StartPage(gfx::Size(), gfx::Rect(), 1);\n if (!g_pdf_lib.Get().RenderPDFPageToDC(\n &pdf_data_.front(),\n pdf_data_.size(),\n page_number,\n metafile.context(),\n pdf_rendering_settings_.dpi(),\n pdf_rendering_settings_.area().x(),\n pdf_rendering_settings_.area().y(),\n pdf_rendering_settings_.area().width(),\n pdf_rendering_settings_.area().height(),\n true,\n false,\n true,\n true,\n pdf_rendering_settings_.autorotate())) {\n return false;\n }\n metafile.FinishPage();\n metafile.FinishDocument();\n return metafile.SaveTo(&output_file);\n}\n<commit_msg>win: Load pdf.dll with abosolute path, fix #1826<commit_after>\/\/ Copyright 2014 The Chromium Authors. All rights reserved.\n\/\/ Use of this source code is governed by a BSD-style license that can be\n\/\/ found in the LICENSE file.\n\n#include \"chrome\/utility\/printing_handler_win.h\"\n\n#include \"base\/files\/file_util.h\"\n#include \"base\/lazy_instance.h\"\n#include \"base\/path_service.h\"\n#include \"base\/scoped_native_library.h\"\n#include \"chrome\/common\/print_messages.h\"\n#include \"content\/public\/utility\/utility_thread.h\"\n#include \"printing\/emf_win.h\"\n#include \"printing\/page_range.h\"\n#include \"printing\/pdf_render_settings.h\"\n#include \"ui\/gfx\/gdi_util.h\"\n\nnamespace {\n\nbool Send(IPC::Message* message) {\n return content::UtilityThread::Get()->Send(message);\n}\n\nvoid ReleaseProcessIfNeeded() {\n content::UtilityThread::Get()->ReleaseProcessIfNeeded();\n}\n\nclass PdfFunctions {\n public:\n PdfFunctions() : get_pdf_doc_info_func_(NULL),\n render_pdf_to_dc_func_(NULL) {}\n\n bool Init() {\n base::FilePath module_path;\n if (!PathService::Get(base::DIR_MODULE, &module_path))\n return false;\n base::FilePath::StringType name(FILE_PATH_LITERAL(\"pdf.dll\"));\n pdf_lib_.Reset(base::LoadNativeLibrary(module_path.Append(name), NULL));\n if (!pdf_lib_.is_valid()) {\n LOG(WARNING) << \"Couldn't load PDF plugin\";\n return false;\n }\n\n get_pdf_doc_info_func_ =\n reinterpret_cast<GetPDFDocInfoProc>(\n pdf_lib_.GetFunctionPointer(\"GetPDFDocInfo\"));\n LOG_IF(WARNING, !get_pdf_doc_info_func_) << \"Missing GetPDFDocInfo\";\n\n render_pdf_to_dc_func_ =\n reinterpret_cast<RenderPDFPageToDCProc>(\n pdf_lib_.GetFunctionPointer(\"RenderPDFPageToDC\"));\n LOG_IF(WARNING, !render_pdf_to_dc_func_) << \"Missing RenderPDFPageToDC\";\n\n if (!get_pdf_doc_info_func_ || !render_pdf_to_dc_func_) {\n Reset();\n }\n\n return IsValid();\n }\n\n bool IsValid() const {\n return pdf_lib_.is_valid();\n }\n\n void Reset() {\n pdf_lib_.Reset(NULL);\n }\n\n bool GetPDFDocInfo(const void* pdf_buffer,\n int buffer_size,\n int* page_count,\n double* max_page_width) {\n if (!get_pdf_doc_info_func_)\n return false;\n return get_pdf_doc_info_func_(pdf_buffer, buffer_size, page_count,\n max_page_width);\n }\n\n bool RenderPDFPageToDC(const void* pdf_buffer,\n int buffer_size,\n int page_number,\n HDC dc,\n int dpi,\n int bounds_origin_x,\n int bounds_origin_y,\n int bounds_width,\n int bounds_height,\n bool fit_to_bounds,\n bool stretch_to_bounds,\n bool keep_aspect_ratio,\n bool center_in_bounds,\n bool autorotate) {\n if (!render_pdf_to_dc_func_)\n return false;\n return render_pdf_to_dc_func_(pdf_buffer, buffer_size, page_number,\n dc, dpi, bounds_origin_x,\n bounds_origin_y, bounds_width, bounds_height,\n fit_to_bounds, stretch_to_bounds,\n keep_aspect_ratio, center_in_bounds,\n autorotate);\n }\n\n private:\n \/\/ Exported by PDF plugin.\n typedef bool (*GetPDFDocInfoProc)(const void* pdf_buffer,\n int buffer_size, int* page_count,\n double* max_page_width);\n typedef bool (*RenderPDFPageToDCProc)(\n const void* pdf_buffer, int buffer_size, int page_number, HDC dc,\n int dpi, int bounds_origin_x, int bounds_origin_y,\n int bounds_width, int bounds_height, bool fit_to_bounds,\n bool stretch_to_bounds, bool keep_aspect_ratio, bool center_in_bounds,\n bool autorotate);\n\n RenderPDFPageToDCProc render_pdf_to_dc_func_;\n GetPDFDocInfoProc get_pdf_doc_info_func_;\n\n base::ScopedNativeLibrary pdf_lib_;\n\n DISALLOW_COPY_AND_ASSIGN(PdfFunctions);\n};\n\nbase::LazyInstance<PdfFunctions> g_pdf_lib = LAZY_INSTANCE_INITIALIZER;\n\n} \/\/ namespace\n\nPrintingHandlerWin::PrintingHandlerWin() {}\n\nPrintingHandlerWin::~PrintingHandlerWin() {}\n\n\/\/ static\nvoid PrintingHandlerWin::PreSandboxStartup() {\n g_pdf_lib.Get().Init();\n}\n\nbool PrintingHandlerWin::OnMessageReceived(const IPC::Message& message) {\n bool handled = true;\n IPC_BEGIN_MESSAGE_MAP(PrintingHandlerWin, message)\n IPC_MESSAGE_HANDLER(ChromeUtilityMsg_RenderPDFPagesToMetafiles,\n OnRenderPDFPagesToMetafile)\n IPC_MESSAGE_HANDLER(ChromeUtilityMsg_RenderPDFPagesToMetafiles_GetPage,\n OnRenderPDFPagesToMetafileGetPage)\n IPC_MESSAGE_HANDLER(ChromeUtilityMsg_RenderPDFPagesToMetafiles_Stop,\n OnRenderPDFPagesToMetafileStop)\n IPC_MESSAGE_UNHANDLED(handled = false)\n IPC_END_MESSAGE_MAP()\n return handled;\n}\n\nvoid PrintingHandlerWin::OnRenderPDFPagesToMetafile(\n IPC::PlatformFileForTransit pdf_transit,\n const printing::PdfRenderSettings& settings) {\n pdf_rendering_settings_ = settings;\n base::File pdf_file = IPC::PlatformFileForTransitToFile(pdf_transit);\n int page_count = LoadPDF(pdf_file.Pass());\n \/\/int page_count = 1;\n Send(\n new ChromeUtilityHostMsg_RenderPDFPagesToMetafiles_PageCount(page_count));\n}\n\nvoid PrintingHandlerWin::OnRenderPDFPagesToMetafileGetPage(\n int page_number,\n IPC::PlatformFileForTransit output_file) {\n base::File emf_file = IPC::PlatformFileForTransitToFile(output_file);\n float scale_factor = 1.0f;\n bool success =\n RenderPdfPageToMetafile(page_number, emf_file.Pass(), &scale_factor);\n Send(new ChromeUtilityHostMsg_RenderPDFPagesToMetafiles_PageDone(\n success, scale_factor));\n}\n\nvoid PrintingHandlerWin::OnRenderPDFPagesToMetafileStop() {\n ReleaseProcessIfNeeded();\n}\n\nint PrintingHandlerWin::LoadPDF(base::File pdf_file) {\n if (!g_pdf_lib.Get().IsValid())\n return 0;\n\n int64 length64 = pdf_file.GetLength();\n if (length64 <= 0 || length64 > std::numeric_limits<int>::max())\n return 0;\n int length = static_cast<int>(length64);\n\n pdf_data_.resize(length);\n if (length != pdf_file.Read(0, pdf_data_.data(), pdf_data_.size()))\n return 0;\n\n int total_page_count = 0;\n if (!g_pdf_lib.Get().GetPDFDocInfo(\n &pdf_data_.front(), pdf_data_.size(), &total_page_count, NULL)) {\n return 0;\n }\n return total_page_count;\n}\n\nbool PrintingHandlerWin::RenderPdfPageToMetafile(int page_number,\n base::File output_file,\n float* scale_factor) {\n printing::Emf metafile;\n metafile.Init();\n\n \/\/ We need to scale down DC to fit an entire page into DC available area.\n \/\/ Current metafile is based on screen DC and have current screen size.\n \/\/ Writing outside of those boundaries will result in the cut-off output.\n \/\/ On metafiles (this is the case here), scaling down will still record\n \/\/ original coordinates and we'll be able to print in full resolution.\n \/\/ Before playback we'll need to counter the scaling up that will happen\n \/\/ in the service (print_system_win.cc).\n *scale_factor =\n gfx::CalculatePageScale(metafile.context(),\n pdf_rendering_settings_.area().right(),\n pdf_rendering_settings_.area().bottom());\n gfx::ScaleDC(metafile.context(), *scale_factor);\n\n \/\/ The underlying metafile is of type Emf and ignores the arguments passed\n \/\/ to StartPage.\n metafile.StartPage(gfx::Size(), gfx::Rect(), 1);\n if (!g_pdf_lib.Get().RenderPDFPageToDC(\n &pdf_data_.front(),\n pdf_data_.size(),\n page_number,\n metafile.context(),\n pdf_rendering_settings_.dpi(),\n pdf_rendering_settings_.area().x(),\n pdf_rendering_settings_.area().y(),\n pdf_rendering_settings_.area().width(),\n pdf_rendering_settings_.area().height(),\n true,\n false,\n true,\n true,\n pdf_rendering_settings_.autorotate())) {\n return false;\n }\n metafile.FinishPage();\n metafile.FinishDocument();\n return metafile.SaveTo(&output_file);\n}\n<|endoftext|>"} {"text":"<commit_before>#include \"omp.h\"\n\n inline\n kth_cv_omp::kth_cv_omp(const std::string in_path,\n\t\tconst std::string in_actionNames, \n\t\tconst field<std::string> in_all_people,\n\t\tconst int in_scale_factor, \n\t\tconst int in_shift,\n\t\tconst int in_scene, \/\/only for kth\n\t\tconst int in_segment_length,\n\t\tconst int in_dim \n ):path(in_path), actionNames(in_actionNames), all_people (in_all_people), scale_factor(in_scale_factor), shift(in_shift), total_scenes(in_scene), segment_length(in_segment_length), dim(in_dim)\n {\n actions.load( actionNames ); \n \n \n }\n \n \n \/\/ Log-Euclidean Distance\n inline\n void\n kth_cv_omp::logEucl()\n {\n \n int n_actions = actions.n_rows;\n int n_peo = all_people.n_rows;\n \n float acc;\n acc = 0;\n \n int n_test = n_peo*n_actions*total_scenes - 1; \/\/ - person13_handclapping_d3\n vec real_labels;\n vec est_labels;\n field<std::string> test_video_list(n_test);\n \n \n real_labels.zeros(n_test);\n est_labels.zeros(n_test);\n \n int k=0;\n \n \n for (int sc = 1; sc<=total_scenes; ++sc) \/\/scene\n {\n for (int pe = 0; pe< n_peo; ++pe)\n {\n for (int act=0; act<n_actions; ++act)\n {\n\t if( !( ( sc==3 && pe==12) && act==1) ) \/\/person13_handclapping_d3\n\t {\n\t \n\t \/\/load number of segments\n\t \n\t vec total_seg; \n\t int num_s;\n\t std::stringstream load_sub_path;\n\t std::stringstream load_num_seg;\n\t \n\t load_sub_path << path << \"\/kth-cov-mat\/sc\" << sc << \"\/scale\" << scale_factor << \"-shift\"<< shift ;\n\t load_num_seg << load_sub_path.str() << \"\/num_seg_\"<< all_people (pe) << \"_\" << actions(act) << \"_dim\" << dim << \".dat\";\n\t total_seg.load( load_num_seg.str());\n\t num_s = total_seg(0);\n\t uvec est_lab_segm;\n\t est_lab_segm.zeros(num_s);\n\t vec count = zeros<vec>( n_actions );\n\t \n\t \n\t for (int s=0; s<num_s; ++s)\n\t {\n\t std::stringstream load_cov_seg;\n\t load_cov_seg << load_sub_path.str() << \"\/LogMcov_seg\" << s << \"_\"<< all_people (pe) << \"_\" << actions(act) << \"_dim\" << dim << \".h5\";\n\t \n\t \/\/cout << \"LogMcov_seg\" << s << \"_\"<< all_people (pe) << \"_\" << actions(act) << \"_dim\" << dim << \".h5\" << endl;\n\t \/\/debe devolver el est_labe de ese segmento\n\t est_lab_segm(s) = logEucl_one_seg_est_lab( pe, load_sub_path.str(), load_cov_seg.str());\n\t count( est_lab_segm(s) )++;\n\t \/\/getchar();\n\t }\n\t \n\t \n\t uword index_video;\n\t double max_val = count.max(index_video);\n\t \/\/est_lab_segm.t().print(\"est_lab_segm\");\n\t cout << \"This video is \" << actions(act) << \" and was classified as class: \" << actions(index_video ) << endl;\n\t \n\t \n\t real_labels(k) = act;\n\t est_labels(k) = index_video;\n\t test_video_list(k) = load_sub_path.str();\n\t \n\t real_labels.save(\"Log_Eucl_real_labels.dat\", raw_ascii);\n\t est_labels.save(\"Log_Eucl_est_labels.dat\", raw_ascii);\n\t test_video_list.save(\"Log_Eucl_test_video_list.dat\", raw_ascii);\n\t k++;\n\t \n\t \n\t if (index_video == act) {\n\t acc++;\n\t \n\t }\n\t \n\t \/\/getchar();\n\t }\n }\n \n \n }\n }\n \n cout << \"Performance: \" << acc*100\/n_test << \" %\" << endl;\n \n }\n \n \n inline\n uword\n kth_cv_omp::logEucl_one_seg_est_lab(int pe_test, std::string load_sub_path, std::string segm_name)\n {\n \/\/wall_clock timer;\n \/\/timer.tic();\n \n mat logMtest_cov;\n logMtest_cov.load(segm_name);\n \n int n_actions = actions.n_rows;\n int n_peo = all_people.n_rows;\n \n double dist, tmp_dist;\n tmp_dist = datum::inf;\n \n \n double est_lab;\n \/\/cout << \"Comparing with person \";\n \n for (int pe_tr = 0; pe_tr< n_peo; ++pe_tr)\n {\n if (pe_tr!= pe_test)\n {\t \n \n \/\/cout << \" \" << all_people (pe_tr);\n \n \n for (int sc = 1; sc<=total_scenes; ++sc) \/\/scene\n {\n\t for (int act=0; act<n_actions; ++act)\n\t {\n\t vec total_seg; \n\t int num_s;\n\t std::stringstream load_num_seg;\n\t load_num_seg << load_sub_path << \"\/num_seg_\"<< all_people (pe_tr) << \"_\" << actions(act) << \"_dim\" << dim << \".dat\";\n\t total_seg.load( load_num_seg.str());\n\t num_s = total_seg(0);\n\t \n\t vec dist_segm_s = zeros<vec> (num_s);\n\t \n\t omp_set_num_threads(6);\n\t #pragma omp for\n\t for (int s_tr=0; s_tr<num_s; ++s_tr)\n\t {\n\t std::stringstream load_cov_seg_tr;\n\t load_cov_seg_tr << load_sub_path << \"\/LogMcov_seg\" << s_tr << \"_\" << all_people (pe_tr) << \"_\" << actions(act) << \"_dim\" << dim << \".h5\";\n\t \n\t \/\/cout << \"Comparing with cov_seg\" << s_tr << \"_\"<< all_people (pe_tr) << \"_\" << actions(act) << \"_dim\" << dim << \".h5\" << endl;\n\t mat logMtrain_cov;\n\t logMtrain_cov.load( load_cov_seg_tr.str() );\n\t \n\t \/\/logMtest_cov.print(\"logMtest_cov\");\n\t \/\/train_cov.print(\"train_cov\");\n\t \n\t dist_segm_s(s_tr) = norm( logMtest_cov - logMtrain_cov, \"fro\");\n\t \n\t \/\/cout << \"dist \" << dis\n\t \/\/cout << \"Press a key\" << endl;\n\t \/\/getchar();\n\t }\n\t cout << omp_get_thread_num() << endl;\n\t #pragma omp barrier\n\t \t \n\t dist_segm_s.t().print(\"dist_segm_s\");\n\t getchar();\n\t }\n }\n }\n }\n \n \/\/double n = timer.toc();\n \/\/cout << \"number of seconds: \" << n << endl;\n \/\/cout << \" est_lab \"<< est_lab << endl << endl;\n \/\/getchar();\n return est_lab;\n \n }\n \n \n \n \/\/DO IT\n \/\/ Stein Divergence \n \n inline\n void\n kth_cv_omp::SteinDiv()\n {\n \n int n_actions = actions.n_rows;\n int n_peo = all_people.n_rows;\n \n float acc;\n acc = 0;\n \n int n_test = n_peo*n_actions*total_scenes - 1; \/\/ - person13_handclapping_d3\n\n vec real_labels;\n vec est_labels;\n field<std::string> test_video_list(n_test);\n \n \n real_labels.zeros(n_test);\n est_labels.zeros(n_test);\n \n int k=0;\n \n \n for (int sc = 1; sc<=total_scenes; ++sc) \/\/scene\n {\n for (int pe = 0; pe< n_peo; ++pe)\n {\n for (int act=0; act<n_actions; ++act)\n {\n\t if( !( ( sc==3 && pe==12) && act==1) ) \/\/person13_handclapping_d3\n\t {\n\t \/\/load number of segments\n\t \n\t vec total_seg; \n\t int num_s;\n\t std::stringstream load_sub_path;\n\t std::stringstream load_num_seg;\n\t \n\t load_sub_path << path << \"\/kth-cov-mat\/sc\" << sc << \"\/scale\" << scale_factor << \"-shift\"<< shift ;\n\t load_num_seg << load_sub_path.str() << \"\/num_seg_\"<< all_people (pe) << \"_\" << actions(act) << \"_dim\" << dim << \".dat\";\n\t total_seg.load( load_num_seg.str());\n\t num_s = total_seg(0);\n\t uvec est_lab_segm;\n\t est_lab_segm.zeros(num_s);\n\t vec count = zeros<vec>( n_actions );\n\t \n\t for (int s=0; s<num_s; ++s)\n\t {\n\t std::stringstream load_cov_seg;\n\t load_cov_seg << load_sub_path.str() << \"\/cov_seg\" << s << \"_\"<< all_people (pe) << \"_\" << actions(act) << \"_dim\" << dim << \".h5\";\n\t \n\t est_lab_segm(s) = SteinDiv_one_seg_est_lab( pe, load_sub_path.str(), load_cov_seg.str());\n\t count( est_lab_segm(s) )++;\n\t \/\/getchar();\n\t }\n\t \n\t uword index_video;\n\t double max_val = count.max(index_video);\n\t \/\/est_lab_segm.t().print(\"est_lab_segm\");\n\t cout << \"This video is \" << actions(act) << \" and was classified as class: \" << actions(index_video ) << endl;\n\t \n\t \n\t real_labels(k) = act;\n\t est_labels(k) = index_video;\n\t test_video_list(k) = load_sub_path.str();\n\t \n\t real_labels.save(\"Stein_div_real_labels.dat\", raw_ascii);\n\t est_labels.save(\"Stein_div__est_labels.dat\", raw_ascii);\n\t test_video_list.save(\"Stein_div_test_video_list.dat\", raw_ascii);\n\t k++;\n\t \n\t \n\t if (index_video == act) {\n\t acc++;\n\t \n\t }\n\t \n\t \/\/getchar();\n\t }\n\t \n }\n }\n }\n \n cout << \"Performance: \" << acc*100\/n_test << \" %\" << endl;\n \n }\n \n \n \/\/DO IT!!!!!!!!!\n inline\n uword\n kth_cv_omp::SteinDiv_one_seg_est_lab(int pe_test, std::string load_sub_path, std::string segm_name)\n {\n \/\/wall_clock timer;\n \/\/timer.tic();\n \n mat test_cov;\n test_cov.load(segm_name);\n \n int n_actions = actions.n_rows;\n int n_peo = all_people.n_rows;\n \n double dist_stein, tmp_dist;\n tmp_dist = datum::inf;\n \n \n double est_lab;\n \/\/cout << \"Comparing with person \";\n \n for (int pe_tr = 0; pe_tr< n_peo; ++pe_tr)\n {\n if (pe_tr!= pe_test)\n {\t \n \n \/\/cout << \" \" << all_people (pe_tr);\n \n \n for (int sc = 1; sc<=total_scenes; ++sc) \/\/scene\n {\n\t for (int act=0; act<n_actions; ++act)\n\t {\n\t vec total_seg; \n\t int num_s;\n\t std::stringstream load_num_seg;\n\t load_num_seg << load_sub_path << \"\/num_seg_\"<< all_people (pe_tr) << \"_\" << actions(act) << \"_dim\" << dim << \".dat\";\n\t total_seg.load( load_num_seg.str());\n\t num_s = total_seg(0);\n\t \n\t for (int s_tr=0; s_tr<num_s; ++s_tr)\n\t {\n\t std::stringstream load_cov_seg_tr;\n\t load_cov_seg_tr << load_sub_path << \"\/cov_seg\" << s_tr << \"_\" << all_people (pe_tr) << \"_\" << actions(act) << \"_dim\" << dim << \".h5\";\n\t \n\t mat train_cov;\n\t train_cov.load( load_cov_seg_tr.str() );\n\t \n\t \/\/Esto vienen de PartI4. No recuerdo mas :(\n\t double det_op1 = det( diagmat( (test_cov + train_cov)\/2 ) );\n\t double det_op2 = det( diagmat( ( test_cov%train_cov ) ) );\n\t dist_stein = log( det_op1 ) - 0.5*log( det_op2 ) ;\n\t \n\t \n\t \n\t \n\t \/\/dist_stein = norm( logMtest_cov - logMtrain_cov, \"fro\");\n\t \n\t \/\/cout << \"dist \" << dist << endl;\n\t \n\t if (dist_stein < tmp_dist)\n\t {\n\t \/\/cout << \"Es menor\" << endl;\n\t tmp_dist = dist_stein;\n\t est_lab = act;\n\t }\n\t \/\/cout << \"Press a key\" << endl;\n\t \/\/getchar();\n\t }\n\t }\n }\n }\n }\n \n \/\/double n = timer.toc();\n \/\/cout << \"number of seconds: \" << n << endl;\n \/\/cout << \" est_lab \"<< est_lab << endl << endl;\n \/\/getchar();\n return est_lab;\n \n }\n \n \n <commit_msg>try oPenMP<commit_after>#include \"omp.h\"\n\n inline\n kth_cv_omp::kth_cv_omp(const std::string in_path,\n\t\tconst std::string in_actionNames, \n\t\tconst field<std::string> in_all_people,\n\t\tconst int in_scale_factor, \n\t\tconst int in_shift,\n\t\tconst int in_scene, \/\/only for kth\n\t\tconst int in_segment_length,\n\t\tconst int in_dim \n ):path(in_path), actionNames(in_actionNames), all_people (in_all_people), scale_factor(in_scale_factor), shift(in_shift), total_scenes(in_scene), segment_length(in_segment_length), dim(in_dim)\n {\n actions.load( actionNames ); \n \n \n }\n \n \n \/\/ Log-Euclidean Distance\n inline\n void\n kth_cv_omp::logEucl()\n {\n \n int n_actions = actions.n_rows;\n int n_peo = all_people.n_rows;\n \n float acc;\n acc = 0;\n \n int n_test = n_peo*n_actions*total_scenes - 1; \/\/ - person13_handclapping_d3\n vec real_labels;\n vec est_labels;\n field<std::string> test_video_list(n_test);\n \n \n real_labels.zeros(n_test);\n est_labels.zeros(n_test);\n \n int k=0;\n \n \n for (int sc = 1; sc<=total_scenes; ++sc) \/\/scene\n {\n for (int pe = 0; pe< n_peo; ++pe)\n {\n for (int act=0; act<n_actions; ++act)\n {\n\t if( !( ( sc==3 && pe==12) && act==1) ) \/\/person13_handclapping_d3\n\t {\n\t \n\t \/\/load number of segments\n\t \n\t vec total_seg; \n\t int num_s;\n\t std::stringstream load_sub_path;\n\t std::stringstream load_num_seg;\n\t \n\t load_sub_path << path << \"\/kth-cov-mat\/sc\" << sc << \"\/scale\" << scale_factor << \"-shift\"<< shift ;\n\t load_num_seg << load_sub_path.str() << \"\/num_seg_\"<< all_people (pe) << \"_\" << actions(act) << \"_dim\" << dim << \".dat\";\n\t total_seg.load( load_num_seg.str());\n\t num_s = total_seg(0);\n\t uvec est_lab_segm;\n\t est_lab_segm.zeros(num_s);\n\t vec count = zeros<vec>( n_actions );\n\t \n\t \n\t for (int s=0; s<num_s; ++s)\n\t {\n\t std::stringstream load_cov_seg;\n\t load_cov_seg << load_sub_path.str() << \"\/LogMcov_seg\" << s << \"_\"<< all_people (pe) << \"_\" << actions(act) << \"_dim\" << dim << \".h5\";\n\t \n\t \/\/cout << \"LogMcov_seg\" << s << \"_\"<< all_people (pe) << \"_\" << actions(act) << \"_dim\" << dim << \".h5\" << endl;\n\t \/\/debe devolver el est_labe de ese segmento\n\t est_lab_segm(s) = logEucl_one_seg_est_lab( pe, load_sub_path.str(), load_cov_seg.str());\n\t count( est_lab_segm(s) )++;\n\t \/\/getchar();\n\t }\n\t \n\t \n\t uword index_video;\n\t double max_val = count.max(index_video);\n\t \/\/est_lab_segm.t().print(\"est_lab_segm\");\n\t cout << \"This video is \" << actions(act) << \" and was classified as class: \" << actions(index_video ) << endl;\n\t \n\t \n\t real_labels(k) = act;\n\t est_labels(k) = index_video;\n\t test_video_list(k) = load_sub_path.str();\n\t \n\t real_labels.save(\"Log_Eucl_real_labels.dat\", raw_ascii);\n\t est_labels.save(\"Log_Eucl_est_labels.dat\", raw_ascii);\n\t test_video_list.save(\"Log_Eucl_test_video_list.dat\", raw_ascii);\n\t k++;\n\t \n\t \n\t if (index_video == act) {\n\t acc++;\n\t \n\t }\n\t \n\t \/\/getchar();\n\t }\n }\n \n \n }\n }\n \n cout << \"Performance: \" << acc*100\/n_test << \" %\" << endl;\n \n }\n \n \n inline\n uword\n kth_cv_omp::logEucl_one_seg_est_lab(int pe_test, std::string load_sub_path, std::string segm_name)\n {\n \/\/wall_clock timer;\n \/\/timer.tic();\n \n mat logMtest_cov;\n logMtest_cov.load(segm_name);\n \n int n_actions = actions.n_rows;\n int n_peo = all_people.n_rows;\n \n double dist, tmp_dist;\n tmp_dist = datum::inf;\n \n \n double est_lab;\n \/\/cout << \"Comparing with person \";\n \n for (int pe_tr = 0; pe_tr< n_peo; ++pe_tr)\n {\n if (pe_tr!= pe_test)\n {\t \n \n \/\/cout << \" \" << all_people (pe_tr);\n \n \n for (int sc = 1; sc<=total_scenes; ++sc) \/\/scene\n {\n\t for (int act=0; act<n_actions; ++act)\n\t {\n\t vec total_seg; \n\t int num_s;\n\t std::stringstream load_num_seg;\n\t load_num_seg << load_sub_path << \"\/num_seg_\"<< all_people (pe_tr) << \"_\" << actions(act) << \"_dim\" << dim << \".dat\";\n\t total_seg.load( load_num_seg.str());\n\t num_s = total_seg(0);\n\t \n\t vec dist_segm_s = zeros<vec> (num_s);\n\t \n\t omp_set_num_threads(6);\n\t cout << omp_get_thread_num() << endl;\n\t #pragma omp for\n\t for (int s_tr=0; s_tr<num_s; ++s_tr)\n\t {\n\t std::stringstream load_cov_seg_tr;\n\t load_cov_seg_tr << load_sub_path << \"\/LogMcov_seg\" << s_tr << \"_\" << all_people (pe_tr) << \"_\" << actions(act) << \"_dim\" << dim << \".h5\";\n\t \n\t \/\/cout << \"Comparing with cov_seg\" << s_tr << \"_\"<< all_people (pe_tr) << \"_\" << actions(act) << \"_dim\" << dim << \".h5\" << endl;\n\t mat logMtrain_cov;\n\t logMtrain_cov.load( load_cov_seg_tr.str() );\n\t \n\t \/\/logMtest_cov.print(\"logMtest_cov\");\n\t \/\/train_cov.print(\"train_cov\");\n\t \n\t dist_segm_s(s_tr) = norm( logMtest_cov - logMtrain_cov, \"fro\");\n\t \n\t \/\/cout << \"dist \" << dis\n\t \/\/cout << \"Press a key\" << endl;\n\t \/\/getchar();\n\t }\n\t \n\t #pragma omp barrier\n\t \t \n\t dist_segm_s.t().print(\"dist_segm_s\");\n\t getchar();\n\t }\n }\n }\n }\n \n \/\/double n = timer.toc();\n \/\/cout << \"number of seconds: \" << n << endl;\n \/\/cout << \" est_lab \"<< est_lab << endl << endl;\n \/\/getchar();\n return est_lab;\n \n }\n \n \n \n \/\/DO IT\n \/\/ Stein Divergence \n \n inline\n void\n kth_cv_omp::SteinDiv()\n {\n \n int n_actions = actions.n_rows;\n int n_peo = all_people.n_rows;\n \n float acc;\n acc = 0;\n \n int n_test = n_peo*n_actions*total_scenes - 1; \/\/ - person13_handclapping_d3\n\n vec real_labels;\n vec est_labels;\n field<std::string> test_video_list(n_test);\n \n \n real_labels.zeros(n_test);\n est_labels.zeros(n_test);\n \n int k=0;\n \n \n for (int sc = 1; sc<=total_scenes; ++sc) \/\/scene\n {\n for (int pe = 0; pe< n_peo; ++pe)\n {\n for (int act=0; act<n_actions; ++act)\n {\n\t if( !( ( sc==3 && pe==12) && act==1) ) \/\/person13_handclapping_d3\n\t {\n\t \/\/load number of segments\n\t \n\t vec total_seg; \n\t int num_s;\n\t std::stringstream load_sub_path;\n\t std::stringstream load_num_seg;\n\t \n\t load_sub_path << path << \"\/kth-cov-mat\/sc\" << sc << \"\/scale\" << scale_factor << \"-shift\"<< shift ;\n\t load_num_seg << load_sub_path.str() << \"\/num_seg_\"<< all_people (pe) << \"_\" << actions(act) << \"_dim\" << dim << \".dat\";\n\t total_seg.load( load_num_seg.str());\n\t num_s = total_seg(0);\n\t uvec est_lab_segm;\n\t est_lab_segm.zeros(num_s);\n\t vec count = zeros<vec>( n_actions );\n\t \n\t for (int s=0; s<num_s; ++s)\n\t {\n\t std::stringstream load_cov_seg;\n\t load_cov_seg << load_sub_path.str() << \"\/cov_seg\" << s << \"_\"<< all_people (pe) << \"_\" << actions(act) << \"_dim\" << dim << \".h5\";\n\t \n\t est_lab_segm(s) = SteinDiv_one_seg_est_lab( pe, load_sub_path.str(), load_cov_seg.str());\n\t count( est_lab_segm(s) )++;\n\t \/\/getchar();\n\t }\n\t \n\t uword index_video;\n\t double max_val = count.max(index_video);\n\t \/\/est_lab_segm.t().print(\"est_lab_segm\");\n\t cout << \"This video is \" << actions(act) << \" and was classified as class: \" << actions(index_video ) << endl;\n\t \n\t \n\t real_labels(k) = act;\n\t est_labels(k) = index_video;\n\t test_video_list(k) = load_sub_path.str();\n\t \n\t real_labels.save(\"Stein_div_real_labels.dat\", raw_ascii);\n\t est_labels.save(\"Stein_div__est_labels.dat\", raw_ascii);\n\t test_video_list.save(\"Stein_div_test_video_list.dat\", raw_ascii);\n\t k++;\n\t \n\t \n\t if (index_video == act) {\n\t acc++;\n\t \n\t }\n\t \n\t \/\/getchar();\n\t }\n\t \n }\n }\n }\n \n cout << \"Performance: \" << acc*100\/n_test << \" %\" << endl;\n \n }\n \n \n \/\/DO IT!!!!!!!!!\n inline\n uword\n kth_cv_omp::SteinDiv_one_seg_est_lab(int pe_test, std::string load_sub_path, std::string segm_name)\n {\n \/\/wall_clock timer;\n \/\/timer.tic();\n \n mat test_cov;\n test_cov.load(segm_name);\n \n int n_actions = actions.n_rows;\n int n_peo = all_people.n_rows;\n \n double dist_stein, tmp_dist;\n tmp_dist = datum::inf;\n \n \n double est_lab;\n \/\/cout << \"Comparing with person \";\n \n for (int pe_tr = 0; pe_tr< n_peo; ++pe_tr)\n {\n if (pe_tr!= pe_test)\n {\t \n \n \/\/cout << \" \" << all_people (pe_tr);\n \n \n for (int sc = 1; sc<=total_scenes; ++sc) \/\/scene\n {\n\t for (int act=0; act<n_actions; ++act)\n\t {\n\t vec total_seg; \n\t int num_s;\n\t std::stringstream load_num_seg;\n\t load_num_seg << load_sub_path << \"\/num_seg_\"<< all_people (pe_tr) << \"_\" << actions(act) << \"_dim\" << dim << \".dat\";\n\t total_seg.load( load_num_seg.str());\n\t num_s = total_seg(0);\n\t \n\t for (int s_tr=0; s_tr<num_s; ++s_tr)\n\t {\n\t std::stringstream load_cov_seg_tr;\n\t load_cov_seg_tr << load_sub_path << \"\/cov_seg\" << s_tr << \"_\" << all_people (pe_tr) << \"_\" << actions(act) << \"_dim\" << dim << \".h5\";\n\t \n\t mat train_cov;\n\t train_cov.load( load_cov_seg_tr.str() );\n\t \n\t \/\/Esto vienen de PartI4. No recuerdo mas :(\n\t double det_op1 = det( diagmat( (test_cov + train_cov)\/2 ) );\n\t double det_op2 = det( diagmat( ( test_cov%train_cov ) ) );\n\t dist_stein = log( det_op1 ) - 0.5*log( det_op2 ) ;\n\t \n\t \n\t \n\t \n\t \/\/dist_stein = norm( logMtest_cov - logMtrain_cov, \"fro\");\n\t \n\t \/\/cout << \"dist \" << dist << endl;\n\t \n\t if (dist_stein < tmp_dist)\n\t {\n\t \/\/cout << \"Es menor\" << endl;\n\t tmp_dist = dist_stein;\n\t est_lab = act;\n\t }\n\t \/\/cout << \"Press a key\" << endl;\n\t \/\/getchar();\n\t }\n\t }\n }\n }\n }\n \n \/\/double n = timer.toc();\n \/\/cout << \"number of seconds: \" << n << endl;\n \/\/cout << \" est_lab \"<< est_lab << endl << endl;\n \/\/getchar();\n return est_lab;\n \n }\n \n \n <|endoftext|>"} {"text":"<commit_before>#include \"pch.h\"\n#include \"httprequest_service.h\"\n#include \"service_manager.h\"\n#include \"main\/memory_stream.h\"\n#include \"curl\/curl.h\"\n\n\n\n\n\n#ifdef __EMSCRIPTEN__\nextern \"C\"\n{\n extern int emscripten_async_wget3_data(const char* url, const char* requesttype, const char* param, const char* additionalHeader, void *arg, int free, em_async_wget2_data_onload_func onload, em_async_wget2_data_onerror_func onerror, em_async_wget2_data_onprogress_func onprogress);\n}\n#endif\n\nstatic char errorBuffer[CURL_ERROR_SIZE];\nconst char * HTTP_REQUEST_SERVICE_QUEUE = \"HTTPRequestServiceQueue\";\n\nHTTPRequestService::HTTPRequestService(const ServiceManager * manager)\n : Service(manager)\n , _curl(NULL)\n , _taskQueueService(NULL)\n{\n}\n\nHTTPRequestService::~HTTPRequestService()\n{\n}\n\nbool HTTPRequestService::onPreInit()\n{\n _taskQueueService = _manager->findService<TaskQueueService>();\n _taskQueueService->createQueue(HTTP_REQUEST_SERVICE_QUEUE);\n \n#ifndef __EMSCRIPTEN__\n _curl = curl_easy_init();\n if (_curl)\n {\n curl_easy_setopt(_curl, CURLOPT_USERAGENT, gameplay::Game::getInstance()->getUserAgentString());\n \/\/curl_easy_setopt( _curl, CURLOPT_DNS_CACHE_TIMEOUT, -1 );\n curl_easy_setopt(_curl, CURLOPT_NOSIGNAL, 1);\n curl_easy_setopt(_curl, CURLOPT_TIMEOUT, 120);\n curl_easy_setopt(_curl, CURLOPT_ERRORBUFFER, errorBuffer);\n curl_easy_setopt(_curl, CURLOPT_TCP_NODELAY, 1); \/\/ make sure packets are sent immediately\n curl_easy_setopt(_curl, CURLOPT_WRITEFUNCTION, &writeFunction);\n curl_easy_setopt(_curl, CURLOPT_FOLLOWLOCATION, 1);\n curl_easy_setopt(_curl, CURLOPT_SSL_VERIFYPEER, 0);\n }\n#endif\n\n return true;\n}\n\nbool HTTPRequestService::onInit()\n{\n return true;\n}\n\nbool HTTPRequestService::onTick()\n{\n \/\/ service has no work to do every frame\n return true;\n}\n\nbool HTTPRequestService::onShutdown()\n{\n if (_taskQueueService)\n _taskQueueService->removeQueue(HTTP_REQUEST_SERVICE_QUEUE);\n\n#ifndef __EMSCRIPTEN__\n if (_curl)\n curl_easy_cleanup(_curl);\n#endif\n\n return true;\n}\n\nint HTTPRequestService::makeRequestAsync(const Request& request, bool headOnly)\n{\n \/\/ note: request is copied by value\n return _taskQueueService->addWorkItem(HTTP_REQUEST_SERVICE_QUEUE, std::bind(&HTTPRequestService::sendRequest, this, request, headOnly));\n}\n\nvoid HTTPRequestService::makeRequestSync(const Request& request, bool headOnly)\n{\n sendRequest(request, headOnly);\n}\n\nstatic int __requestCount = 0;\nvoid HTTPRequestService::requestLoadCallback(unsigned, void * arg, void *buf, unsigned length)\n{\n Request * request = reinterpret_cast<Request *>(arg);\n request->responseCallback(CURLE_OK, MemoryStream::create(buf, length), NULL, 200);\n delete request;\n\n __requestCount--;\n}\n\nvoid HTTPRequestService::requestErrorCallback(unsigned, void *arg, int errorCode, const char * status)\n{\n Request * request = reinterpret_cast<Request *>(arg);\n GP_LOG(\"Failed to perform HTTP request to %s: error %d %s\", request->url.c_str(), errorCode, status);\n request->responseCallback(-1, NULL, status, errorCode); \/\/ there is no 'curl' error for emscripten callback, errorCode is HTTP status code\n delete request;\n\n __requestCount--;\n}\n\nvoid HTTPRequestService::requestProgressCallback(unsigned, void * arg, int dlnow, int dltotal)\n{\n Request * request = reinterpret_cast<Request *>(arg);\n request->progressCallback(static_cast<uint64_t>(dltotal), static_cast<uint64_t>(dlnow), 0, 0);\n}\n\nint progressFunction(void * userp, curl_off_t dltotal, curl_off_t dlnow, curl_off_t ultotal, curl_off_t ulnow)\n{\n HTTPRequestService::Request * request = reinterpret_cast<HTTPRequestService::Request *>(userp);\n GP_ASSERT(request->progressCallback);\n return request->progressCallback(static_cast<uint64_t>(dltotal), static_cast<uint64_t>(dlnow), static_cast<uint64_t>(ultotal), static_cast<uint64_t>(ulnow));\n}\n\nbool HTTPRequestService::hasActiveEmscriptenHTTPRequest() const\n{\n return __requestCount > 0;\n}\n\nvoid HTTPRequestService::sendRequest(const Request& request, bool headOnly)\n{\n#ifdef _DEBUG\n GP_LOG(\"Sending HTTP request: %s, POST: %s\", request.url.c_str(), request.postPayload.c_str());\n#endif\n\n \/\/ make sure curl is used only for one thread in any moment\n std::unique_lock<std::mutex> lock(_requestProcessingMutex);\n\n#ifndef __EMSCRIPTEN__\n MemoryStream * response = MemoryStream::create();\n\n curl_easy_setopt(_curl, CURLOPT_URL, request.url.c_str());\n curl_easy_setopt(_curl, CURLOPT_POSTFIELDS, request.postPayload.c_str());\n curl_easy_setopt(_curl, CURLOPT_POSTFIELDSIZE, request.postPayload.size());\n curl_easy_setopt(_curl, CURLOPT_POST, request.postPayload.empty() ? 0 : 1);\n curl_easy_setopt(_curl, CURLOPT_WRITEDATA, response);\n curl_easy_setopt(_curl, CURLOPT_NOPROGRESS, request.progressCallback ? 0 : 1);\n curl_easy_setopt(_curl, CURLOPT_XFERINFOFUNCTION, &progressFunction);\n curl_easy_setopt(_curl, CURLOPT_XFERINFODATA, &request);\n curl_easy_setopt(_curl, CURLOPT_HEADER, headOnly ? 1 : 0);\n curl_easy_setopt(_curl, CURLOPT_NOBODY, headOnly ? 1 : 0);\n\n struct curl_slist *list = NULL;\n if (!request.headers.empty())\n {\n for (auto& h : request.headers)\n list = curl_slist_append(list, (h.first + \": \" + h.second).c_str());\n }\n curl_easy_setopt(_curl, CURLOPT_HTTPHEADER, list);\n\n CURLcode res = curl_easy_perform(_curl);\n curl_slist_free_all(list);\n\n long httpResponseCode = 0;\n curl_easy_getinfo(_curl, CURLINFO_RESPONSE_CODE, &httpResponseCode);\n\n if (res != CURLE_OK)\n GP_LOG(\"Failed to perform HTTP request: error %d - %s\", res, request.url.c_str());\n\n \/\/ response is copied by value since callback is invoked on main thread\n _taskQueueService->runOnMainThread([=]() { response->rewind(); request.responseCallback(res, response, curl_easy_strerror(res), httpResponseCode); delete response; });\n\n#else\n \n \/\/ HEAD request are currently not supported\n if (headOnly)\n {\n request.responseCallback(-1, NULL, \"Unsupported\", 404);\n return;\n }\n\n std::string additionalHeaders; \/\/ headers in JSON format\n if (!request.headers.empty())\n {\n additionalHeaders += \"{\";\n for (auto& h : request.headers)\n {\n additionalHeaders += \"\\\"\";\n additionalHeaders += h.first;\n additionalHeaders += \"\\\":\\\"\";\n additionalHeaders += h.second;\n additionalHeaders += \"\\\",\";\n }\n additionalHeaders.pop_back();\n additionalHeaders += \"}\";\n }\n\n Request * newRequest = new Request(request);\n\n __requestCount++;\n emscripten_async_wget3_data(request.url.c_str(), request.postPayload.empty() ? \"GET\" : \"POST\", request.postPayload.c_str(), request.postPayload.size(),\n additionalHeaders.c_str(), newRequest, true, &HTTPRequestService::requestLoadCallback, &HTTPRequestService::requestErrorCallback, \n request.progressCallback ? &HTTPRequestService::requestProgressCallback : NULL);\n\n#endif\n}\n\nsize_t HTTPRequestService::writeFunction(void *contents, size_t size, size_t nmemb, void *userp)\n{\n size_t realSize = size * nmemb;\n gameplay::Stream * response = reinterpret_cast<gameplay::Stream *>(userp);\n\n response->write(contents, size, nmemb);\n\n return realSize;\n}\n\nconst char * HTTPRequestService::getTaskQueueName()\n{\n return HTTP_REQUEST_SERVICE_QUEUE;\n}<commit_msg>fixed compilation on emscripten<commit_after>#include \"pch.h\"\n#include \"httprequest_service.h\"\n#include \"service_manager.h\"\n#include \"main\/memory_stream.h\"\n#include \"curl\/curl.h\"\n\n\n\n\n\n#ifdef __EMSCRIPTEN__\nextern \"C\"\n{\n extern int emscripten_async_wget3_data(const char* url, const char* requesttype, const char* data, int dataSize, const char* additionalHeader, void *arg, int free, em_async_wget2_data_onload_func onload, em_async_wget2_data_onerror_func onerror, em_async_wget2_data_onprogress_func onprogress);\n}\n#endif\n\nstatic char errorBuffer[CURL_ERROR_SIZE];\nconst char * HTTP_REQUEST_SERVICE_QUEUE = \"HTTPRequestServiceQueue\";\n\nHTTPRequestService::HTTPRequestService(const ServiceManager * manager)\n : Service(manager)\n , _curl(NULL)\n , _taskQueueService(NULL)\n{\n}\n\nHTTPRequestService::~HTTPRequestService()\n{\n}\n\nbool HTTPRequestService::onPreInit()\n{\n _taskQueueService = _manager->findService<TaskQueueService>();\n _taskQueueService->createQueue(HTTP_REQUEST_SERVICE_QUEUE);\n \n#ifndef __EMSCRIPTEN__\n _curl = curl_easy_init();\n if (_curl)\n {\n curl_easy_setopt(_curl, CURLOPT_USERAGENT, gameplay::Game::getInstance()->getUserAgentString());\n \/\/curl_easy_setopt( _curl, CURLOPT_DNS_CACHE_TIMEOUT, -1 );\n curl_easy_setopt(_curl, CURLOPT_NOSIGNAL, 1);\n curl_easy_setopt(_curl, CURLOPT_TIMEOUT, 120);\n curl_easy_setopt(_curl, CURLOPT_ERRORBUFFER, errorBuffer);\n curl_easy_setopt(_curl, CURLOPT_TCP_NODELAY, 1); \/\/ make sure packets are sent immediately\n curl_easy_setopt(_curl, CURLOPT_WRITEFUNCTION, &writeFunction);\n curl_easy_setopt(_curl, CURLOPT_FOLLOWLOCATION, 1);\n curl_easy_setopt(_curl, CURLOPT_SSL_VERIFYPEER, 0);\n }\n#endif\n\n return true;\n}\n\nbool HTTPRequestService::onInit()\n{\n return true;\n}\n\nbool HTTPRequestService::onTick()\n{\n \/\/ service has no work to do every frame\n return true;\n}\n\nbool HTTPRequestService::onShutdown()\n{\n if (_taskQueueService)\n _taskQueueService->removeQueue(HTTP_REQUEST_SERVICE_QUEUE);\n\n#ifndef __EMSCRIPTEN__\n if (_curl)\n curl_easy_cleanup(_curl);\n#endif\n\n return true;\n}\n\nint HTTPRequestService::makeRequestAsync(const Request& request, bool headOnly)\n{\n \/\/ note: request is copied by value\n return _taskQueueService->addWorkItem(HTTP_REQUEST_SERVICE_QUEUE, std::bind(&HTTPRequestService::sendRequest, this, request, headOnly));\n}\n\nvoid HTTPRequestService::makeRequestSync(const Request& request, bool headOnly)\n{\n sendRequest(request, headOnly);\n}\n\nstatic int __requestCount = 0;\nvoid HTTPRequestService::requestLoadCallback(unsigned, void * arg, void *buf, unsigned length)\n{\n Request * request = reinterpret_cast<Request *>(arg);\n request->responseCallback(CURLE_OK, MemoryStream::create(buf, length), NULL, 200);\n delete request;\n\n __requestCount--;\n}\n\nvoid HTTPRequestService::requestErrorCallback(unsigned, void *arg, int errorCode, const char * status)\n{\n Request * request = reinterpret_cast<Request *>(arg);\n GP_LOG(\"Failed to perform HTTP request to %s: error %d %s\", request->url.c_str(), errorCode, status);\n request->responseCallback(-1, NULL, status, errorCode); \/\/ there is no 'curl' error for emscripten callback, errorCode is HTTP status code\n delete request;\n\n __requestCount--;\n}\n\nvoid HTTPRequestService::requestProgressCallback(unsigned, void * arg, int dlnow, int dltotal)\n{\n Request * request = reinterpret_cast<Request *>(arg);\n request->progressCallback(static_cast<uint64_t>(dltotal), static_cast<uint64_t>(dlnow), 0, 0);\n}\n\nint progressFunction(void * userp, curl_off_t dltotal, curl_off_t dlnow, curl_off_t ultotal, curl_off_t ulnow)\n{\n HTTPRequestService::Request * request = reinterpret_cast<HTTPRequestService::Request *>(userp);\n GP_ASSERT(request->progressCallback);\n return request->progressCallback(static_cast<uint64_t>(dltotal), static_cast<uint64_t>(dlnow), static_cast<uint64_t>(ultotal), static_cast<uint64_t>(ulnow));\n}\n\nbool HTTPRequestService::hasActiveEmscriptenHTTPRequest() const\n{\n return __requestCount > 0;\n}\n\nvoid HTTPRequestService::sendRequest(const Request& request, bool headOnly)\n{\n#ifdef _DEBUG\n GP_LOG(\"Sending HTTP request: %s, POST: %s\", request.url.c_str(), request.postPayload.c_str());\n#endif\n\n \/\/ make sure curl is used only for one thread in any moment\n std::unique_lock<std::mutex> lock(_requestProcessingMutex);\n\n#ifndef __EMSCRIPTEN__\n MemoryStream * response = MemoryStream::create();\n\n curl_easy_setopt(_curl, CURLOPT_URL, request.url.c_str());\n curl_easy_setopt(_curl, CURLOPT_POSTFIELDS, request.postPayload.c_str());\n curl_easy_setopt(_curl, CURLOPT_POSTFIELDSIZE, request.postPayload.size());\n curl_easy_setopt(_curl, CURLOPT_POST, request.postPayload.empty() ? 0 : 1);\n curl_easy_setopt(_curl, CURLOPT_WRITEDATA, response);\n curl_easy_setopt(_curl, CURLOPT_NOPROGRESS, request.progressCallback ? 0 : 1);\n curl_easy_setopt(_curl, CURLOPT_XFERINFOFUNCTION, &progressFunction);\n curl_easy_setopt(_curl, CURLOPT_XFERINFODATA, &request);\n curl_easy_setopt(_curl, CURLOPT_HEADER, headOnly ? 1 : 0);\n curl_easy_setopt(_curl, CURLOPT_NOBODY, headOnly ? 1 : 0);\n\n struct curl_slist *list = NULL;\n if (!request.headers.empty())\n {\n for (auto& h : request.headers)\n list = curl_slist_append(list, (h.first + \": \" + h.second).c_str());\n }\n curl_easy_setopt(_curl, CURLOPT_HTTPHEADER, list);\n\n CURLcode res = curl_easy_perform(_curl);\n curl_slist_free_all(list);\n\n long httpResponseCode = 0;\n curl_easy_getinfo(_curl, CURLINFO_RESPONSE_CODE, &httpResponseCode);\n\n if (res != CURLE_OK)\n GP_LOG(\"Failed to perform HTTP request: error %d - %s\", res, request.url.c_str());\n\n \/\/ response is copied by value since callback is invoked on main thread\n _taskQueueService->runOnMainThread([=]() { response->rewind(); request.responseCallback(res, response, curl_easy_strerror(res), httpResponseCode); delete response; });\n\n#else\n \n \/\/ HEAD request are currently not supported\n if (headOnly)\n {\n request.responseCallback(-1, NULL, \"Unsupported\", 404);\n return;\n }\n\n std::string additionalHeaders; \/\/ headers in JSON format\n if (!request.headers.empty())\n {\n additionalHeaders += \"{\";\n for (auto& h : request.headers)\n {\n additionalHeaders += \"\\\"\";\n additionalHeaders += h.first;\n additionalHeaders += \"\\\":\\\"\";\n additionalHeaders += h.second;\n additionalHeaders += \"\\\",\";\n }\n additionalHeaders.pop_back();\n additionalHeaders += \"}\";\n }\n\n Request * newRequest = new Request(request);\n\n __requestCount++;\n emscripten_async_wget3_data(request.url.c_str(), request.postPayload.empty() ? \"GET\" : \"POST\", request.postPayload.c_str(), request.postPayload.size(),\n additionalHeaders.c_str(), newRequest, true, &HTTPRequestService::requestLoadCallback, &HTTPRequestService::requestErrorCallback, \n request.progressCallback ? &HTTPRequestService::requestProgressCallback : NULL);\n\n#endif\n}\n\nsize_t HTTPRequestService::writeFunction(void *contents, size_t size, size_t nmemb, void *userp)\n{\n size_t realSize = size * nmemb;\n gameplay::Stream * response = reinterpret_cast<gameplay::Stream *>(userp);\n\n response->write(contents, size, nmemb);\n\n return realSize;\n}\n\nconst char * HTTPRequestService::getTaskQueueName()\n{\n return HTTP_REQUEST_SERVICE_QUEUE;\n}<|endoftext|>"} {"text":"<commit_before>#include \"ledger.h\"\n#include \"datetime.h\"\n#include \"error.h\"\n#include \"util.h\"\n\n#include <cstring>\n\nnamespace ledger {\n\n#define MAX_LINE 1024\n\nstatic char line[MAX_LINE + 1];\nstatic std::string path;\nstatic unsigned int linenum;\n\nstatic inline char * get_line(std::istream& in) {\n in.getline(line, MAX_LINE);\n int len = std::strlen(line);\n if (line[len - 1] == '\\r')\n line[len - 1] = '\\0';\n linenum++;\n return line;\n}\n\nunsigned int parse_qif_file(std::istream& in, journal_t * journal,\n\t\t\t account_t * master, commodity_t * def_commodity)\n{\n std::auto_ptr<entry_t> entry;\n std::auto_ptr<amount_t> amount;\n transaction_t *\t xact;\n account_t * misc = journal->find_account(\"Miscellaneous\");\n unsigned int count;\n\n path\t = journal->sources.back();\n linenum = 1;\n\n while (! in.eof()) {\n char c;\n in.get(c);\n switch (c) {\n case ' ':\n case '\\t':\n if (peek_next_nonws(in) != '\\n') {\n\tget_line(in);\n\tthrow parse_error(path, linenum, \"Line begins with whitespace\");\n }\n \/\/ fall through...\n\n case '\\n':\n linenum++;\n case '\\r': \/\/ skip blank lines\n break;\n\n case '!':\n in >> line;\n\n \/\/ jww (2004-08-19): these types are not supported yet\n assert(std::strcmp(line, \"Type:Invst\") != 0 &&\n\t std::strcmp(line, \"Account\") != 0 &&\n\t std::strcmp(line, \"Type:Cat\") != 0 &&\n\t std::strcmp(line, \"Type:Class\") != 0 &&\n\t std::strcmp(line, \"Type:Memorized\") != 0);\n\n get_line(in);\n break;\n\n case 'D':\n entry.reset(new entry_t);\n xact = new transaction_t(master);\n entry->add_transaction(xact);\n\n in >> line;\n if (! parse_date(line, &entry->date))\n\tthrow parse_error(path, linenum, \"Failed to parse date\");\n break;\n\n case 'T':\n case '$':\n in >> line;\n xact->amount.parse(line);\n if (def_commodity)\n\txact->amount.commodity = def_commodity;\n if (c == '$')\n\txact->amount.negate();\n xact->cost = xact->amount;\n break;\n\n case 'C':\n if (in.peek() == '*') {\n\tin.get(c);\n\tentry->state = entry_t::CLEARED;\n }\n break;\n\n case 'N':\n if (std::isdigit(in.peek())) {\n\tin >> c >> line;\n\tentry->code = line;\n }\n break;\n\n case 'P':\n case 'M':\n case 'L':\n case 'S':\n case 'E': {\n char b = c;\n int len;\n c = in.peek();\n if (! std::isspace(c) && c != '\\n') {\n\tget_line(in);\n\n\tswitch (b) {\n\tcase 'P':\n\t entry->payee = line;\n\t break;\n\n\tcase 'S':\n\t xact = new transaction_t(NULL);\n\t entry->add_transaction(xact);\n\t \/\/ fall through...\n\tcase 'L':\n\t len = std::strlen(line);\n\t if (line[len - 1] == ']')\n\t line[len - 1] = '\\0';\n\t xact->account = journal->find_account(line[0] == '[' ?\n\t\t\t\t\t\tline + 1 : line);\n\t break;\n\n\tcase 'M':\n\tcase 'E':\n\t xact->note = line;\n\t break;\n\t}\n }\n break;\n }\n\n case 'A':\n \/\/ jww (2004-08-19): these are ignored right now\n get_line(in);\n break;\n\n case '^':\n if (xact->account == master) {\n\ttransaction_t * nxact = new transaction_t(misc);\n\tentry->add_transaction(nxact);\n\tnxact->amount = nxact->cost = - xact->amount;\n }\n\n if (journal->add_entry(entry.release()))\n\tcount++;\n break;\n }\n }\n\n return count;\n}\n\n} \/\/ namespace ledger\n<commit_msg>bug fix in QIF parsing<commit_after>#include \"ledger.h\"\n#include \"datetime.h\"\n#include \"error.h\"\n#include \"util.h\"\n\n#include <cstring>\n\nnamespace ledger {\n\n#define MAX_LINE 1024\n\nstatic char line[MAX_LINE + 1];\nstatic std::string path;\nstatic unsigned int linenum;\n\nstatic inline char * get_line(std::istream& in) {\n in.getline(line, MAX_LINE);\n int len = std::strlen(line);\n if (line[len - 1] == '\\r')\n line[len - 1] = '\\0';\n linenum++;\n return line;\n}\n\nunsigned int parse_qif_file(std::istream& in, journal_t * journal,\n\t\t\t account_t * master, commodity_t * def_commodity)\n{\n std::auto_ptr<entry_t> entry;\n std::auto_ptr<amount_t> amount;\n transaction_t *\t xact;\n account_t * misc = journal->find_account(\"Miscellaneous\");\n unsigned int count;\n\n path\t = journal->sources.back();\n linenum = 1;\n\n while (! in.eof()) {\n char c;\n in.get(c);\n switch (c) {\n case ' ':\n case '\\t':\n if (peek_next_nonws(in) != '\\n') {\n\tget_line(in);\n\tthrow parse_error(path, linenum, \"Line begins with whitespace\");\n }\n \/\/ fall through...\n\n case '\\n':\n linenum++;\n case '\\r': \/\/ skip blank lines\n break;\n\n case '!':\n in >> line;\n\n \/\/ jww (2004-08-19): these types are not supported yet\n assert(std::strcmp(line, \"Type:Invst\") != 0 &&\n\t std::strcmp(line, \"Account\") != 0 &&\n\t std::strcmp(line, \"Type:Cat\") != 0 &&\n\t std::strcmp(line, \"Type:Class\") != 0 &&\n\t std::strcmp(line, \"Type:Memorized\") != 0);\n\n get_line(in);\n break;\n\n case 'D':\n entry.reset(new entry_t);\n xact = new transaction_t(master);\n entry->add_transaction(xact);\n\n in >> line;\n if (! parse_date(line, &entry->date))\n\tthrow parse_error(path, linenum, \"Failed to parse date\");\n break;\n\n case 'T':\n case '$':\n in >> line;\n xact->amount.parse(line);\n if (def_commodity)\n\txact->amount.commodity = def_commodity;\n if (c == '$')\n\txact->amount.negate();\n xact->cost = xact->amount;\n break;\n\n case 'C':\n if (in.peek() == '*') {\n\tin.get(c);\n\tentry->state = entry_t::CLEARED;\n }\n break;\n\n case 'N':\n if (std::isdigit(in.peek())) {\n\tin >> line;\n\tentry->code = line;\n }\n break;\n\n case 'P':\n case 'M':\n case 'L':\n case 'S':\n case 'E': {\n char b = c;\n int len;\n c = in.peek();\n if (! std::isspace(c) && c != '\\n') {\n\tget_line(in);\n\n\tswitch (b) {\n\tcase 'P':\n\t entry->payee = line;\n\t break;\n\n\tcase 'S':\n\t xact = new transaction_t(NULL);\n\t entry->add_transaction(xact);\n\t \/\/ fall through...\n\tcase 'L':\n\t len = std::strlen(line);\n\t if (line[len - 1] == ']')\n\t line[len - 1] = '\\0';\n\t xact->account = journal->find_account(line[0] == '[' ?\n\t\t\t\t\t\tline + 1 : line);\n\t break;\n\n\tcase 'M':\n\tcase 'E':\n\t xact->note = line;\n\t break;\n\t}\n }\n break;\n }\n\n case 'A':\n \/\/ jww (2004-08-19): these are ignored right now\n get_line(in);\n break;\n\n case '^':\n if (xact->account == master) {\n\ttransaction_t * nxact = new transaction_t(misc);\n\tentry->add_transaction(nxact);\n\tnxact->amount = nxact->cost = - xact->amount;\n }\n\n if (journal->add_entry(entry.release()))\n\tcount++;\n break;\n }\n }\n\n return count;\n}\n\n} \/\/ namespace ledger\n<|endoftext|>"} {"text":"<commit_before>\/\/================ Copyright (c) 2016, PG, All rights reserved. =================\/\/\n\/\/\n\/\/ Purpose:\t\tfuck windows, doesn't even support utf8 filepaths\n\/\/\n\/\/ $NoKeywords: $winfile\n\/\/===============================================================================\/\/\n\n#if defined(_WIN32) || defined(_WIN64) || defined(__WIN32__) || defined(__CYGWIN__) || defined(__CYGWIN32__) || defined(__TOS_WIN__) || defined(__WINDOWS__)\n\n#include \"WinFile.h\"\n#include \"Engine.h\"\n#include \"ConVar.h\"\n\nWinFile::WinFile(UString filePath, File::TYPE type)\n{\n\tm_sFilePath = filePath;\n\tm_bReady = false;\n\n\tm_bCanWrite = false;\n\tm_bCanRead = false;\n\tm_iFileSize = 0;\n\n\tm_buffer = NULL;\n\tm_handle = NULL;\n\tm_fullBuffer = NULL;\n\n\tif (type == File::TYPE::READ)\n\t{\n\t\t\/\/ line reader\n\t\tm_iRead = 0;\n\t\tm_bNeedsRead = true;\n\t\tm_iLineIndex = 0;\n\t\tm_iLineBufferReadIndexOffset = 0;\n\t\tm_bCanRead = true;\n\t\tm_bEOF = false;\n\n\t\t\/\/ open file handle\n\t\tm_handle = CreateFileW(filePath.wc_str(), \/\/ file to open\n\t\t\t\tGENERIC_READ,\t\t\t\t\t\/\/ open for reading\n\t\t\t\tFILE_SHARE_READ,\t\t\t\t\/\/ share for reading\n\t\t\t\tNULL,\t\t\t\t\t\t\t\/\/ default security\n\t\t\t\tOPEN_EXISTING,\t\t\t\t\t\/\/ existing file only\n\t\t\t\tFILE_FLAG_SEQUENTIAL_SCAN,\t\t\/\/ normal file\n\t\t\t\tNULL);\t\t\t\t\t\t\t\/\/ no attr. template\n\n\t\tif (m_handle == INVALID_HANDLE_VALUE)\n\t\t{\n\t\t\tm_handle = NULL;\n\t\t\tdebugLog(\"File Error: Couldn't CreateFileW(), GetLastError() = %i\\n\", GetLastError());\n\t\t\treturn;\n\t\t}\n\n\t\t\/\/ check if file contains anything at all\n\t\tm_iFileSize = GetFileSize(m_handle, 0);\n\t\tif (m_iFileSize < 1)\n\t\t{\n\t\t\tdebugLog(\"File Error: FileSize is < 0\\n\");\n\t\t\treturn;\n\t\t}\n\t\telse if (m_iFileSize > 1024*1024*File::size_max->getInt()) \/\/ size sanity check\n\t\t{\n\t\t\tdebugLog(\"File Error: FileSize is > %i MB!!!\\n\", File::size_max->getInt());\n\t\t\treturn;\n\t\t}\n\t}\n\telse \/\/ WRITE\n\t{\n\t\tm_bCanWrite = true;\n\n\t\t\/\/ open file handle\n\t\tm_handle = CreateFileW(filePath.wc_str(), \/\/ file to open\n\t\t\t\tGENERIC_WRITE,\t\t\t\t\t\/\/ open for writing\n\t\t\t\t0,\t\t\t\t\t\t\t\t\/\/ exclusive access (not shared)\n\t\t\t\tNULL,\t\t\t\t\t\t\t\/\/ default security\n\t\t\t\tCREATE_ALWAYS,\t\t\t\t\t\/\/ overwrite everything\n\t\t\t\tFILE_ATTRIBUTE_NORMAL,\t\t\t\/\/ normal file\n\t\t\t\tNULL);\t\t\t\t\t\t\t\/\/ no attr. template\n\n\t\tif (m_handle == INVALID_HANDLE_VALUE)\n\t\t{\n\t\t\tm_handle = NULL;\n\t\t\tdebugLog(\"File Error: Couldn't CreateFileW(), GetLastError() = %i\\n\", GetLastError());\n\t\t\treturn;\n\t\t}\n\t}\n\n\tif (File::debug->getBool())\n\t\tdebugLog(\"WinFile: Opening %s, m_iFileSize = %i\\n\", filePath.toUtf8(), m_iFileSize);\n\n\tm_bReady = true;\n}\n\nWinFile::~WinFile()\n{\n\tif (m_handle != NULL)\n\t\tCloseHandle(m_handle);\n\n\tm_handle = NULL;\n\n\tif (m_fullBuffer != NULL)\n\t{\n\t\tdelete[] m_fullBuffer;\n\t\tm_fullBuffer = NULL;\n\t}\n\n\tif (m_buffer != NULL)\n\t{\n\t\tdelete[] m_buffer;\n\t\tm_buffer = NULL;\n\t}\n}\n\nbool WinFile::canRead() const\n{\n\treturn m_bReady && m_bCanRead;\n}\n\nbool WinFile::canWrite() const\n{\n\treturn m_bReady && m_bCanWrite;\n}\n\nvoid WinFile::write(const char *buffer, size_t size)\n{\n\tif (!canWrite()) return;\n\n\tDWORD bytesWritten;\n\tif (WriteFile(m_handle, buffer, size, &bytesWritten, NULL) == TRUE)\n\t{\n\t\tif (bytesWritten != size)\n\t\t\tdebugLog(\"WinFile Warning: WriteFile() only wrote %lu\/%lu bytes\\n\", bytesWritten, size);\n\n\t\tm_iFileSize += bytesWritten;\n\n\t\tLARGE_INTEGER absolutePosition;\n\t\tabsolutePosition.QuadPart = m_iFileSize;\n\n\t\tSetFilePointerEx(m_handle, absolutePosition, NULL, FILE_BEGIN);\n\t}\n\telse\n\t{\n\t\tm_bCanWrite = false;\n\t\tdebugLog(\"WinFile Error: Couldn't WriteFile(), GetLastError() = %i\\n\", GetLastError());\n\t}\n}\n\nbool WinFile::checkReadForLineBuffer()\n{\n\tif (!m_bReady || !m_bNeedsRead || !m_bCanRead) return false;\n\n\tm_bNeedsRead = false;\n\tm_iLineIndex = 0;\n\n\t\/\/ create\/reset readline buffer\n\tif (m_buffer == NULL)\n\t\tm_buffer = new char[bufferSize];\n\n\tmemset(m_buffer, '\\0', bufferSize);\n\n\t\/\/ try to read and fill the buffer; (bufferSize-1) to always reserve 1 zero bit at the end\n\tif (!ReadFile(m_handle, m_buffer, bufferSize-1, &m_iRead, NULL) || m_iRead == 0)\n\t{\n\t\t\/\/ ERROR_HANDLE_EOF\n\t\tm_bCanRead = false;\n\t\tm_bEOF = true;\n\t\treturn false;\n\t}\n\n\treturn true;\n}\n\nbool WinFile::checkReadForFullBuffer()\n{\n\tif (!m_bReady || !m_bNeedsRead) return false;\n\n\tm_bNeedsRead = false;\n\n\t\/\/ create full buffer\n\tm_fullBuffer = new char[m_iFileSize];\n\n\tif (m_fullBuffer == NULL)\n\t{\n\t\tdebugLog(\"File Error: Out of memory!!!\\n\");\n\t\treturn false;\n\t}\n\n\t\/\/ try to read and fill the entire buffer\n\tif (!ReadFile(m_handle, m_fullBuffer, m_iFileSize, &m_iRead, NULL) || m_iRead == 0)\n\t{\n\t\t\/\/ ERROR_HANDLE_EOF\n\t\tm_bCanRead = false;\n\t\treturn false;\n\t}\n\n\tm_bEOF = true;\n\n\treturn true;\n}\n\nUString WinFile::readLine()\n{\n\tif (!canRead()) return \"\";\n\n\tbool foundLine = false;\n\tUString result;\n\n\tchar lineBuffer[bufferSize+2]; \/\/ +2 for sanity\n\twhile (!foundLine && m_bCanRead)\n\t{\n\t\t\/\/ check if we need to read some more\n\t\tcheckReadForLineBuffer();\n\n\t\t\/\/ line detection loop\n\t\tunsigned int lineBufferIndex = 0;\n\t\tmemset(lineBuffer, '\\0', bufferSize); \/\/ two zero chars at the end should actually be enough, but whatever\n\t\tfor (size_t i=m_iLineIndex; (i < bufferSize) && ((i+m_iLineBufferReadIndexOffset) < m_iRead) && (lineBufferIndex < bufferSize); i++)\n\t\t{\n\t\t\tconst unsigned char c = ((unsigned char*)m_buffer)[i+m_iLineBufferReadIndexOffset];\n\n\t\t\t\/\/ detect newline, then break and set next index for future readLine()s\n\t\t\tif (c == '\\r')\n\t\t\t{\n\t\t\t\t\/\/ skip possibly following '\\n' as well\n\t\t\t\tif (i+m_iLineBufferReadIndexOffset+1 < m_iRead && ((unsigned char*)m_buffer)[i+m_iLineBufferReadIndexOffset+1] == '\\n')\n\t\t\t\t\ti++;\n\n\t\t\t\t\/\/ set new line index for next iteration, +1 to skip the newline char\n\t\t\t\tfoundLine = true;\n\t\t\t\tm_iLineIndex = i+1;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\telse if (c == '\\n')\n\t\t\t{\n\t\t\t\t\/\/ set new line index for next iteration, +1 to skip the newline char\n\t\t\t\tfoundLine = true;\n\t\t\t\tm_iLineIndex = i+1;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\telse \/\/ if not on newline, add to linebuffer\n\t\t\t\tlineBuffer[lineBufferIndex++] = m_buffer[i+m_iLineBufferReadIndexOffset];\n\t\t}\n\n\t\t\/\/ append everything read so far\n\t\tif (lineBufferIndex > 0 || foundLine)\n\t\t{\n\t\t\t\/\/ only manually correct lineIndex if we didn't find a line\n\t\t\tif (!foundLine)\n\t\t\t\tm_iLineIndex += lineBufferIndex; \/\/ increase read position for possible next line\n\n\t\t\t\/\/ only append if we have anything at all\n\t\t\tif (lineBufferIndex > 0)\n\t\t\t\tresult.append(lineBuffer);\n\t\t}\n\t\telse \/\/ if no line could be read, check if we need to read more in the next iteration\n\t\t\tm_bNeedsRead = true; \/\/ this triggers a file read in checkReadForLineBuffer()\n\t}\n\n\treturn result;\n}\n\nconst char *WinFile::readFile()\n{\n\tif (File::debug->getBool())\n\t\tdebugLog(\"WinFile::readFile() on %s\\n\", m_sFilePath.toUtf8());\n\n\tif (checkReadForFullBuffer() || m_bEOF)\n\t\treturn m_fullBuffer;\n\telse\n\t\treturn NULL;\n}\n\nsize_t WinFile::getFileSize() const\n{\n\treturn m_iFileSize;\n}\n\n#endif\n<commit_msg>Print filename in WinFile errors<commit_after>\/\/================ Copyright (c) 2016, PG, All rights reserved. =================\/\/\n\/\/\n\/\/ Purpose:\t\tfuck windows, doesn't even support utf8 filepaths\n\/\/\n\/\/ $NoKeywords: $winfile\n\/\/===============================================================================\/\/\n\n#if defined(_WIN32) || defined(_WIN64) || defined(__WIN32__) || defined(__CYGWIN__) || defined(__CYGWIN32__) || defined(__TOS_WIN__) || defined(__WINDOWS__)\n\n#include \"WinFile.h\"\n#include \"Engine.h\"\n#include \"ConVar.h\"\n\nWinFile::WinFile(UString filePath, File::TYPE type)\n{\n\tm_sFilePath = filePath;\n\tm_bReady = false;\n\n\tm_bCanWrite = false;\n\tm_bCanRead = false;\n\tm_iFileSize = 0;\n\n\tm_buffer = NULL;\n\tm_handle = NULL;\n\tm_fullBuffer = NULL;\n\n\tif (type == File::TYPE::READ)\n\t{\n\t\t\/\/ line reader\n\t\tm_iRead = 0;\n\t\tm_bNeedsRead = true;\n\t\tm_iLineIndex = 0;\n\t\tm_iLineBufferReadIndexOffset = 0;\n\t\tm_bCanRead = true;\n\t\tm_bEOF = false;\n\n\t\t\/\/ open file handle\n\t\tm_handle = CreateFileW(filePath.wc_str(), \/\/ file to open\n\t\t\t\tGENERIC_READ,\t\t\t\t\t\/\/ open for reading\n\t\t\t\tFILE_SHARE_READ,\t\t\t\t\/\/ share for reading\n\t\t\t\tNULL,\t\t\t\t\t\t\t\/\/ default security\n\t\t\t\tOPEN_EXISTING,\t\t\t\t\t\/\/ existing file only\n\t\t\t\tFILE_FLAG_SEQUENTIAL_SCAN,\t\t\/\/ normal file\n\t\t\t\tNULL);\t\t\t\t\t\t\t\/\/ no attr. template\n\n\t\tif (m_handle == INVALID_HANDLE_VALUE)\n\t\t{\n\t\t\tm_handle = NULL;\n\t\t\tdebugLog(\"File Error: Couldn't CreateFileW(%s), GetLastError() = %i\\n\", filePath.toUtf8(), GetLastError());\n\t\t\treturn;\n\t\t}\n\n\t\t\/\/ check if file contains anything at all\n\t\tm_iFileSize = GetFileSize(m_handle, 0);\n\t\tif (m_iFileSize < 1)\n\t\t{\n\t\t\tdebugLog(\"File Error: FileSize of \\\"%s\\\" is < 1\\n\", filePath.toUtf8());\n\t\t\treturn;\n\t\t}\n\t\telse if (m_iFileSize > 1024*1024*File::size_max->getInt()) \/\/ size sanity check\n\t\t{\n\t\t\tdebugLog(\"File Error: FileSize of \\\"%s\\\" is > %i MB!!!\\n\", filePath.toUtf8(), File::size_max->getInt());\n\t\t\treturn;\n\t\t}\n\t}\n\telse \/\/ WRITE\n\t{\n\t\tm_bCanWrite = true;\n\n\t\t\/\/ open file handle\n\t\tm_handle = CreateFileW(filePath.wc_str(), \/\/ file to open\n\t\t\t\tGENERIC_WRITE,\t\t\t\t\t\/\/ open for writing\n\t\t\t\t0,\t\t\t\t\t\t\t\t\/\/ exclusive access (not shared)\n\t\t\t\tNULL,\t\t\t\t\t\t\t\/\/ default security\n\t\t\t\tCREATE_ALWAYS,\t\t\t\t\t\/\/ overwrite everything\n\t\t\t\tFILE_ATTRIBUTE_NORMAL,\t\t\t\/\/ normal file\n\t\t\t\tNULL);\t\t\t\t\t\t\t\/\/ no attr. template\n\n\t\tif (m_handle == INVALID_HANDLE_VALUE)\n\t\t{\n\t\t\tm_handle = NULL;\n\t\t\tdebugLog(\"File Error: Couldn't CreateFileW(%s), GetLastError() = %i\\n\", filePath.toUtf8(), GetLastError());\n\t\t\treturn;\n\t\t}\n\t}\n\n\tif (File::debug->getBool())\n\t\tdebugLog(\"WinFile: Opening %s, m_iFileSize = %i\\n\", filePath.toUtf8(), m_iFileSize);\n\n\tm_bReady = true;\n}\n\nWinFile::~WinFile()\n{\n\tif (m_handle != NULL)\n\t\tCloseHandle(m_handle);\n\n\tm_handle = NULL;\n\n\tif (m_fullBuffer != NULL)\n\t{\n\t\tdelete[] m_fullBuffer;\n\t\tm_fullBuffer = NULL;\n\t}\n\n\tif (m_buffer != NULL)\n\t{\n\t\tdelete[] m_buffer;\n\t\tm_buffer = NULL;\n\t}\n}\n\nbool WinFile::canRead() const\n{\n\treturn m_bReady && m_bCanRead;\n}\n\nbool WinFile::canWrite() const\n{\n\treturn m_bReady && m_bCanWrite;\n}\n\nvoid WinFile::write(const char *buffer, size_t size)\n{\n\tif (!canWrite()) return;\n\n\tDWORD bytesWritten;\n\tif (WriteFile(m_handle, buffer, size, &bytesWritten, NULL) == TRUE)\n\t{\n\t\tif (bytesWritten != size)\n\t\t\tdebugLog(\"WinFile Warning: WriteFile() only wrote %lu\/%lu bytes\\n\", bytesWritten, size);\n\n\t\tm_iFileSize += bytesWritten;\n\n\t\tLARGE_INTEGER absolutePosition;\n\t\tabsolutePosition.QuadPart = m_iFileSize;\n\n\t\tSetFilePointerEx(m_handle, absolutePosition, NULL, FILE_BEGIN);\n\t}\n\telse\n\t{\n\t\tm_bCanWrite = false;\n\t\tdebugLog(\"WinFile Error: Couldn't WriteFile(), GetLastError() = %i\\n\", GetLastError());\n\t}\n}\n\nbool WinFile::checkReadForLineBuffer()\n{\n\tif (!m_bReady || !m_bNeedsRead || !m_bCanRead) return false;\n\n\tm_bNeedsRead = false;\n\tm_iLineIndex = 0;\n\n\t\/\/ create\/reset readline buffer\n\tif (m_buffer == NULL)\n\t\tm_buffer = new char[bufferSize];\n\n\tmemset(m_buffer, '\\0', bufferSize);\n\n\t\/\/ try to read and fill the buffer; (bufferSize-1) to always reserve 1 zero bit at the end\n\tif (!ReadFile(m_handle, m_buffer, bufferSize-1, &m_iRead, NULL) || m_iRead == 0)\n\t{\n\t\t\/\/ ERROR_HANDLE_EOF\n\t\tm_bCanRead = false;\n\t\tm_bEOF = true;\n\t\treturn false;\n\t}\n\n\treturn true;\n}\n\nbool WinFile::checkReadForFullBuffer()\n{\n\tif (!m_bReady || !m_bNeedsRead) return false;\n\n\tm_bNeedsRead = false;\n\n\t\/\/ create full buffer\n\tm_fullBuffer = new char[m_iFileSize];\n\n\tif (m_fullBuffer == NULL)\n\t{\n\t\tdebugLog(\"File Error: Out of memory!!!\\n\");\n\t\treturn false;\n\t}\n\n\t\/\/ try to read and fill the entire buffer\n\tif (!ReadFile(m_handle, m_fullBuffer, m_iFileSize, &m_iRead, NULL) || m_iRead == 0)\n\t{\n\t\t\/\/ ERROR_HANDLE_EOF\n\t\tm_bCanRead = false;\n\t\treturn false;\n\t}\n\n\tm_bEOF = true;\n\n\treturn true;\n}\n\nUString WinFile::readLine()\n{\n\tif (!canRead()) return \"\";\n\n\tbool foundLine = false;\n\tUString result;\n\n\tchar lineBuffer[bufferSize+2]; \/\/ +2 for sanity\n\twhile (!foundLine && m_bCanRead)\n\t{\n\t\t\/\/ check if we need to read some more\n\t\tcheckReadForLineBuffer();\n\n\t\t\/\/ line detection loop\n\t\tunsigned int lineBufferIndex = 0;\n\t\tmemset(lineBuffer, '\\0', bufferSize); \/\/ two zero chars at the end should actually be enough, but whatever\n\t\tfor (size_t i=m_iLineIndex; (i < bufferSize) && ((i+m_iLineBufferReadIndexOffset) < m_iRead) && (lineBufferIndex < bufferSize); i++)\n\t\t{\n\t\t\tconst unsigned char c = ((unsigned char*)m_buffer)[i+m_iLineBufferReadIndexOffset];\n\n\t\t\t\/\/ detect newline, then break and set next index for future readLine()s\n\t\t\tif (c == '\\r')\n\t\t\t{\n\t\t\t\t\/\/ skip possibly following '\\n' as well\n\t\t\t\tif (i+m_iLineBufferReadIndexOffset+1 < m_iRead && ((unsigned char*)m_buffer)[i+m_iLineBufferReadIndexOffset+1] == '\\n')\n\t\t\t\t\ti++;\n\n\t\t\t\t\/\/ set new line index for next iteration, +1 to skip the newline char\n\t\t\t\tfoundLine = true;\n\t\t\t\tm_iLineIndex = i+1;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\telse if (c == '\\n')\n\t\t\t{\n\t\t\t\t\/\/ set new line index for next iteration, +1 to skip the newline char\n\t\t\t\tfoundLine = true;\n\t\t\t\tm_iLineIndex = i+1;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\telse \/\/ if not on newline, add to linebuffer\n\t\t\t\tlineBuffer[lineBufferIndex++] = m_buffer[i+m_iLineBufferReadIndexOffset];\n\t\t}\n\n\t\t\/\/ append everything read so far\n\t\tif (lineBufferIndex > 0 || foundLine)\n\t\t{\n\t\t\t\/\/ only manually correct lineIndex if we didn't find a line\n\t\t\tif (!foundLine)\n\t\t\t\tm_iLineIndex += lineBufferIndex; \/\/ increase read position for possible next line\n\n\t\t\t\/\/ only append if we have anything at all\n\t\t\tif (lineBufferIndex > 0)\n\t\t\t\tresult.append(lineBuffer);\n\t\t}\n\t\telse \/\/ if no line could be read, check if we need to read more in the next iteration\n\t\t\tm_bNeedsRead = true; \/\/ this triggers a file read in checkReadForLineBuffer()\n\t}\n\n\treturn result;\n}\n\nconst char *WinFile::readFile()\n{\n\tif (File::debug->getBool())\n\t\tdebugLog(\"WinFile::readFile() on %s\\n\", m_sFilePath.toUtf8());\n\n\tif (checkReadForFullBuffer() || m_bEOF)\n\t\treturn m_fullBuffer;\n\telse\n\t\treturn NULL;\n}\n\nsize_t WinFile::getFileSize() const\n{\n\treturn m_iFileSize;\n}\n\n#endif\n<|endoftext|>"} {"text":"<commit_before>\/*===================================================================\n\nThe Medical Imaging Interaction Toolkit (MITK)\n\nCopyright (c) German Cancer Research Center,\nDivision of Medical and Biological Informatics.\nAll rights reserved.\n\nThis software is distributed WITHOUT ANY WARRANTY; without\neven the implied warranty of MERCHANTABILITY or FITNESS FOR\nA PARTICULAR PURPOSE.\n\nSee LICENSE.txt or http:\/\/www.mitk.org for details.\n\n===================================================================*\/\n\n#include \"QmitkPythonTextEditor.h\"\n\n#include <QList>\n#include <QFileInfo>\n#include <QUrl>\n#include <QtGui>\n#include <usModuleContext.h>\n#include <usServiceReference.h>\n#include <mitkDataNode.h>\n#include <usGetModuleContext.h>\n#include <mitkIPythonService.h>\n#include \"QmitkPythonScriptEditorHighlighter.h\"\n\nstruct QmitkPythonTextEditorData\n{\n QString m_FilePath;\n\n QAction* m_LoadScript;\n QAction* m_SaveScript;\n QAction* m_RunScript;\n QToolBar* m_Toolbar;\n\n QTextEdit* m_Content;\n\n QGridLayout* m_Layout;\n mitk::IPythonService* m_PythonService;\n us::ServiceReference<mitk::IPythonService> m_PythonServiceRef;\n\n QString m_FileName;\n};\n\nQmitkPythonTextEditor::QmitkPythonTextEditor(QWidget *parent)\n :QWidget(parent), d(new QmitkPythonTextEditorData)\n{\n us::ModuleContext* context = us::GetModuleContext();\n d->m_PythonServiceRef = context->GetServiceReference<mitk::IPythonService>();\n d->m_PythonService = context->GetService<mitk::IPythonService>( d->m_PythonServiceRef );\n\n d->m_LoadScript = new QAction(this);\n d->m_LoadScript->setToolTip(\"Load script from disk.\");\n d->m_LoadScript->setObjectName(QString::fromUtf8(\"LoadScript\"));\n QIcon icon2;\n icon2.addFile(QString::fromUtf8(\":\/mitkPython\/document-open.png\"), QSize(), QIcon::Normal, QIcon::Off);\n d->m_LoadScript->setIcon(icon2);\n\n d->m_SaveScript = new QAction(this);\n d->m_SaveScript->setToolTip(\"Save script to disk.\");\n d->m_SaveScript->setObjectName(QString::fromUtf8(\"SaveScript\"));\n QIcon icon3;\n icon3.addFile(QString::fromUtf8(\":\/mitkPython\/document-save.png\"), QSize(), QIcon::Normal, QIcon::Off);\n d->m_SaveScript->setIcon(icon3);\n\n d->m_RunScript = new QAction(this);\n d->m_RunScript->setToolTip(\"Run the current script.\");\n d->m_RunScript->setObjectName(QString::fromUtf8(\"RunScript\"));\n QIcon icon4;\n icon4.addFile(QString::fromUtf8(\":\/mitkPython\/media-playback-start.png\"), QSize(), QIcon::Normal, QIcon::Off);\n d->m_RunScript->setIcon(icon4);\n\n d->m_Toolbar = new QToolBar;\n d->m_Toolbar->addAction( d->m_LoadScript );\n d->m_Toolbar->addAction( d->m_SaveScript );\n d->m_Toolbar->addAction( d->m_RunScript );\n\n d->m_Content = new QTextEdit(this);\n d->m_Content->setObjectName(QString::fromUtf8(\"Content\"));\n\n QmitkPythonScriptEditorHighlighter* highlighter =\n new QmitkPythonScriptEditorHighlighter( d->m_Content->document() );\n\n d->m_Layout = new QGridLayout;\n d->m_Layout->addWidget( d->m_Toolbar, 0, 0, 1, 1 );\n d->m_Layout->addWidget( d->m_Content, 1, 0, 1, 1 );\n d->m_Layout->setContentsMargins(2,2,2,2);\n\n this->setLayout(d->m_Layout);\n QMetaObject::connectSlotsByName(this);\n}\n\nQmitkPythonTextEditor::~QmitkPythonTextEditor()\n{\n us::ModuleContext* context = us::GetModuleContext();\n context->UngetService( d->m_PythonServiceRef );\n\n delete d;\n}\n\nvoid QmitkPythonTextEditor::dragEnterEvent(QDragEnterEvent *event)\n{\n event->accept();\n}\n\nvoid QmitkPythonTextEditor::dropEvent(QDropEvent *event)\n{\n QList<QUrl> urls = event->mimeData()->urls();\n for(int i = 0; i < urls.size(); i++)\n {\n this->Paste( urls[i].toString() );\n }\n}\n\/*\nbool QmitkPythonTextEditor::canInsertFromMimeData( const QMimeData * ) const\n{\n return true;\n}\n*\/\n\nvoid QmitkPythonTextEditor::Paste(const QString &command)\n{\n if( this->isVisible() )\n {\n d->m_Content->insertPlainText(command + \"\\n\");\n }\n}\n\n\nQString QmitkPythonTextEditor::ReadFile(const QString& filename)\n{\n QFile file(filename);\n if (!file.open(QIODevice::ReadOnly | QIODevice::Text))\n {\n MITK_ERROR << \"Could not open file \" << filename.toStdString();\n return NULL;\n }\n\n QByteArray total;\n QByteArray line;\n while (!file.atEnd())\n {\n line = file.read(1024);\n total.append(line);\n }\n\n return QString(total);\n}\n\nvoid QmitkPythonTextEditor::on_SaveScript_triggered( bool )\n{\n d->m_FileName = QFileDialog::getSaveFileName(this,tr(\"Save File\"), d->m_FileName,tr(\"*.py\"));\n if( d->m_FileName.compare(\"\") != 0)\n {\n ofstream myfile;\n myfile.open(d->m_FileName.toLocal8Bit().data());\n myfile << d->m_Content->toPlainText().toLocal8Bit().data();\n myfile.close();\n }\n}\n\nvoid QmitkPythonTextEditor::on_LoadScript_triggered( bool )\n{\n d->m_FileName = QFileDialog::getOpenFileName( this, \"Load Script\", d->m_FileName, tr(\"*.py\"));\n if( !d->m_FileName.isEmpty() )\n {\n QString contents = this->ReadFile( d->m_FileName );\n d->m_Content->setText(contents);\n }\n}\n\nvoid QmitkPythonTextEditor::on_RunScript_triggered( bool )\n{\n if( !d->m_PythonService )\n {\n MITK_ERROR << \"Python service not available.\";\n return;\n }\n\n d->m_PythonService->Execute( d->m_Content->toPlainText().toStdString(), mitk::IPythonService::MULTI_LINE_COMMAND );\n}\n<commit_msg>added missing std namespace<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 \"QmitkPythonTextEditor.h\"\n\n#include <QList>\n#include <QFileInfo>\n#include <QUrl>\n#include <QtGui>\n#include <usModuleContext.h>\n#include <usServiceReference.h>\n#include <mitkDataNode.h>\n#include <usGetModuleContext.h>\n#include <mitkIPythonService.h>\n#include \"QmitkPythonScriptEditorHighlighter.h\"\n\nstruct QmitkPythonTextEditorData\n{\n QString m_FilePath;\n\n QAction* m_LoadScript;\n QAction* m_SaveScript;\n QAction* m_RunScript;\n QToolBar* m_Toolbar;\n\n QTextEdit* m_Content;\n\n QGridLayout* m_Layout;\n mitk::IPythonService* m_PythonService;\n us::ServiceReference<mitk::IPythonService> m_PythonServiceRef;\n\n QString m_FileName;\n};\n\nQmitkPythonTextEditor::QmitkPythonTextEditor(QWidget *parent)\n :QWidget(parent), d(new QmitkPythonTextEditorData)\n{\n us::ModuleContext* context = us::GetModuleContext();\n d->m_PythonServiceRef = context->GetServiceReference<mitk::IPythonService>();\n d->m_PythonService = context->GetService<mitk::IPythonService>( d->m_PythonServiceRef );\n\n d->m_LoadScript = new QAction(this);\n d->m_LoadScript->setToolTip(\"Load script from disk.\");\n d->m_LoadScript->setObjectName(QString::fromUtf8(\"LoadScript\"));\n QIcon icon2;\n icon2.addFile(QString::fromUtf8(\":\/mitkPython\/document-open.png\"), QSize(), QIcon::Normal, QIcon::Off);\n d->m_LoadScript->setIcon(icon2);\n\n d->m_SaveScript = new QAction(this);\n d->m_SaveScript->setToolTip(\"Save script to disk.\");\n d->m_SaveScript->setObjectName(QString::fromUtf8(\"SaveScript\"));\n QIcon icon3;\n icon3.addFile(QString::fromUtf8(\":\/mitkPython\/document-save.png\"), QSize(), QIcon::Normal, QIcon::Off);\n d->m_SaveScript->setIcon(icon3);\n\n d->m_RunScript = new QAction(this);\n d->m_RunScript->setToolTip(\"Run the current script.\");\n d->m_RunScript->setObjectName(QString::fromUtf8(\"RunScript\"));\n QIcon icon4;\n icon4.addFile(QString::fromUtf8(\":\/mitkPython\/media-playback-start.png\"), QSize(), QIcon::Normal, QIcon::Off);\n d->m_RunScript->setIcon(icon4);\n\n d->m_Toolbar = new QToolBar;\n d->m_Toolbar->addAction( d->m_LoadScript );\n d->m_Toolbar->addAction( d->m_SaveScript );\n d->m_Toolbar->addAction( d->m_RunScript );\n\n d->m_Content = new QTextEdit(this);\n d->m_Content->setObjectName(QString::fromUtf8(\"Content\"));\n\n QmitkPythonScriptEditorHighlighter* highlighter =\n new QmitkPythonScriptEditorHighlighter( d->m_Content->document() );\n\n d->m_Layout = new QGridLayout;\n d->m_Layout->addWidget( d->m_Toolbar, 0, 0, 1, 1 );\n d->m_Layout->addWidget( d->m_Content, 1, 0, 1, 1 );\n d->m_Layout->setContentsMargins(2,2,2,2);\n\n this->setLayout(d->m_Layout);\n QMetaObject::connectSlotsByName(this);\n}\n\nQmitkPythonTextEditor::~QmitkPythonTextEditor()\n{\n us::ModuleContext* context = us::GetModuleContext();\n context->UngetService( d->m_PythonServiceRef );\n\n delete d;\n}\n\nvoid QmitkPythonTextEditor::dragEnterEvent(QDragEnterEvent *event)\n{\n event->accept();\n}\n\nvoid QmitkPythonTextEditor::dropEvent(QDropEvent *event)\n{\n QList<QUrl> urls = event->mimeData()->urls();\n for(int i = 0; i < urls.size(); i++)\n {\n this->Paste( urls[i].toString() );\n }\n}\n\/*\nbool QmitkPythonTextEditor::canInsertFromMimeData( const QMimeData * ) const\n{\n return true;\n}\n*\/\n\nvoid QmitkPythonTextEditor::Paste(const QString &command)\n{\n if( this->isVisible() )\n {\n d->m_Content->insertPlainText(command + \"\\n\");\n }\n}\n\n\nQString QmitkPythonTextEditor::ReadFile(const QString& filename)\n{\n QFile file(filename);\n if (!file.open(QIODevice::ReadOnly | QIODevice::Text))\n {\n MITK_ERROR << \"Could not open file \" << filename.toStdString();\n return NULL;\n }\n\n QByteArray total;\n QByteArray line;\n while (!file.atEnd())\n {\n line = file.read(1024);\n total.append(line);\n }\n\n return QString(total);\n}\n\nvoid QmitkPythonTextEditor::on_SaveScript_triggered( bool )\n{\n d->m_FileName = QFileDialog::getSaveFileName(this,tr(\"Save File\"), d->m_FileName,tr(\"*.py\"));\n if( d->m_FileName.compare(\"\") != 0)\n {\n std::ofstream myfile;\n myfile.open(d->m_FileName.toLocal8Bit().data());\n myfile << d->m_Content->toPlainText().toLocal8Bit().data();\n myfile.close();\n }\n}\n\nvoid QmitkPythonTextEditor::on_LoadScript_triggered( bool )\n{\n d->m_FileName = QFileDialog::getOpenFileName( this, \"Load Script\", d->m_FileName, tr(\"*.py\"));\n if( !d->m_FileName.isEmpty() )\n {\n QString contents = this->ReadFile( d->m_FileName );\n d->m_Content->setText(contents);\n }\n}\n\nvoid QmitkPythonTextEditor::on_RunScript_triggered( bool )\n{\n if( !d->m_PythonService )\n {\n MITK_ERROR << \"Python service not available.\";\n return;\n }\n\n d->m_PythonService->Execute( d->m_Content->toPlainText().toStdString(), mitk::IPythonService::MULTI_LINE_COMMAND );\n}\n<|endoftext|>"} {"text":"<commit_before>\/*\n This file is part of: \n NoahFrame\n https:\/\/github.com\/ketoo\/NoahGameFrame\n\n Copyright 2009 - 2018 NoahFrame(NoahGameFrame)\n\n File creator: lvsheng.huang\n \n NoahFrame is open-source software and you can redistribute it and\/or modify\n it under the terms of the License; besides, anyone who use this file\/software must include this copyright announcement.\n\n Licensed under the Apache License, Version 2.0 (the \"License\");\n you may not use this file except in compliance with the License.\n You may obtain a copy of the License at\n\n http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n\n Unless required by applicable law or agreed to in writing, software\n distributed under the License is distributed on an \"AS IS\" BASIS,\n WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n See the License for the specific language governing permissions and\n limitations under the License.\n*\/\n\n#include \"NFCChatModule.h\"\n#include \"NFComm\/NFMessageDefine\/NFProtocolDefine.hpp\"\n#include \"NFComm\/NFPluginModule\/NFIEventModule.h\"\n\nbool NFCChatModule::Init()\n{\n\tm_pNetModule = pPluginManager->FindModule<NFINetModule>();\n\tm_pKernelModule = pPluginManager->FindModule<NFIKernelModule>();\n\tm_pClassModule = pPluginManager->FindModule<NFIClassModule>();\n\tm_pElementModule = pPluginManager->FindModule<NFIElementModule>();\n\tm_pLogModule = pPluginManager->FindModule<NFILogModule>();\n\tm_pEventModule = pPluginManager->FindModule<NFIEventModule>();\n\tm_pSceneAOIModule = pPluginManager->FindModule<NFISceneAOIModule>();\n\tm_pGameServerNet_ServerModule = pPluginManager->FindModule<NFIGameServerNet_ServerModule>();\n\tm_pGameServerToWorldModule = pPluginManager->FindModule<NFIGameServerToWorldModule>();\n\n\treturn true;\n}\n\nbool NFCChatModule::AfterInit()\n{\n\n\treturn true;\n}\n\nbool NFCChatModule::Shut()\n{\n\n\treturn true;\n}\n\nbool NFCChatModule::Execute()\n{\n\treturn true;\n}\n\nvoid NFCChatModule::OnClienChatProcess(const NFSOCK nSockIndex, const int nMsgID, const char* msg, const uint32_t nLen)\n{\n\tCLIENT_MSG_PROCESS( nMsgID, msg, nLen, NFMsg::ReqAckPlayerChat);\n\n\tswitch (xMsg.chat_type())\n\t{\n\tcase NFMsg::ReqAckPlayerChat_EGameChatType::ReqAckPlayerChat_EGameChatType_EGCT_WORLD:\n\t{\n\t\tm_pNetModule->SendMsgPBToAllClient(NFMsg::EGMI_ACK_CHAT, xMsg);\n\t}\n\tbreak;\n\tcase NFMsg::ReqAckPlayerChat_EGameChatType::ReqAckPlayerChat_EGameChatType_EGCT_GUILD:\n\t{\n\t\tNFGUID xTargetID = NFINetModule::PBToNF(xMsg.target_id());\n\t\tNFGUID xGuildID = m_pKernelModule->GetPropertyObject(nPlayerID, NFrame::Player::GuildID());\n\t\tif (!xGuildID.IsNull() && xGuildID == xTargetID)\n\t\t{\n\t\t\t\/\/send to world server\n\t\t\tm_pGameServerToWorldModule->TransmitToWorld(xGuildID.nData64, nMsgID, xMsg);\n\t\t}\n\t}\n\tbreak;\n\tcase NFMsg::ReqAckPlayerChat_EGameChatType::ReqAckPlayerChat_EGameChatType_EGCT_PRIVATE:\n\tcase NFMsg::ReqAckPlayerChat_EGameChatType::ReqAckPlayerChat_EGameChatType_EGCT_TEAM:\n\t{\n\t\tif (xMsg.has_target_id())\n\t\t{\n\t\t\tNFGUID xTargetID = NFINetModule::PBToNF(xMsg.target_id());\n\t\t\tif (!xTargetID.IsNull())\n\t\t\t{\n\t\t\t\tif (m_pKernelModule->GetObject(xTargetID))\n\t\t\t\t{\n\n\t\t\t\t}\n\t\t\t\telse\n\t\t\t\t{\n\t\t\t\t\t\/\/send to world server\n\t\t\t\t\tm_pGameServerToWorldModule->TransmitToWorld(xTargetID.nData64, nMsgID, xMsg);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\tbreak;\n\tdefault:\n\t\tbreak;;\n\t}\n}<commit_msg>BC to all the players for chatting<commit_after>\/*\n This file is part of: \n NoahFrame\n https:\/\/github.com\/ketoo\/NoahGameFrame\n\n Copyright 2009 - 2018 NoahFrame(NoahGameFrame)\n\n File creator: lvsheng.huang\n \n NoahFrame is open-source software and you can redistribute it and\/or modify\n it under the terms of the License; besides, anyone who use this file\/software must include this copyright announcement.\n\n Licensed under the Apache License, Version 2.0 (the \"License\");\n you may not use this file except in compliance with the License.\n You may obtain a copy of the License at\n\n http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n\n Unless required by applicable law or agreed to in writing, software\n distributed under the License is distributed on an \"AS IS\" BASIS,\n WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n See the License for the specific language governing permissions and\n limitations under the License.\n*\/\n\n#include \"NFCChatModule.h\"\n#include \"NFComm\/NFMessageDefine\/NFProtocolDefine.hpp\"\n#include \"NFComm\/NFPluginModule\/NFIEventModule.h\"\n\nbool NFCChatModule::Init()\n{\n\tm_pNetModule = pPluginManager->FindModule<NFINetModule>();\n\tm_pKernelModule = pPluginManager->FindModule<NFIKernelModule>();\n\tm_pClassModule = pPluginManager->FindModule<NFIClassModule>();\n\tm_pElementModule = pPluginManager->FindModule<NFIElementModule>();\n\tm_pLogModule = pPluginManager->FindModule<NFILogModule>();\n\tm_pEventModule = pPluginManager->FindModule<NFIEventModule>();\n\tm_pSceneAOIModule = pPluginManager->FindModule<NFISceneAOIModule>();\n\tm_pGameServerNet_ServerModule = pPluginManager->FindModule<NFIGameServerNet_ServerModule>();\n\tm_pGameServerToWorldModule = pPluginManager->FindModule<NFIGameServerToWorldModule>();\n\n\treturn true;\n}\n\nbool NFCChatModule::AfterInit()\n{\n\n\tm_pNetModule->AddReceiveCallBack(NFMsg::EGMI_REQ_CHAT, this, &NFCChatModule::OnClienChatProcess);\n\n\treturn true;\n}\n\nbool NFCChatModule::Shut()\n{\n\n\treturn true;\n}\n\nbool NFCChatModule::Execute()\n{\n\treturn true;\n}\n\nvoid NFCChatModule::OnClienChatProcess(const NFSOCK nSockIndex, const int nMsgID, const char* msg, const uint32_t nLen)\n{\n\tCLIENT_MSG_PROCESS( nMsgID, msg, nLen, NFMsg::ReqAckPlayerChat);\n\n\tswitch (xMsg.chat_type())\n\t{\n\tcase NFMsg::ReqAckPlayerChat_EGameChatType::ReqAckPlayerChat_EGameChatType_EGCT_WORLD:\n\t{\n\t\tm_pNetModule->SendMsgPBToAllClient(NFMsg::EGMI_ACK_CHAT, xMsg);\n\t}\n\tbreak;\n\tcase NFMsg::ReqAckPlayerChat_EGameChatType::ReqAckPlayerChat_EGameChatType_EGCT_GUILD:\n\t{\n\t\tNFGUID xTargetID = NFINetModule::PBToNF(xMsg.target_id());\n\t\tNFGUID xGuildID = m_pKernelModule->GetPropertyObject(nPlayerID, NFrame::Player::GuildID());\n\t\tif (!xGuildID.IsNull() && xGuildID == xTargetID)\n\t\t{\n\t\t\t\/\/send to world server\n\t\t\tm_pGameServerToWorldModule->TransmitToWorld(xGuildID.nData64, nMsgID, xMsg);\n\t\t}\n\t}\n\tbreak;\n\tcase NFMsg::ReqAckPlayerChat_EGameChatType::ReqAckPlayerChat_EGameChatType_EGCT_PRIVATE:\n\tcase NFMsg::ReqAckPlayerChat_EGameChatType::ReqAckPlayerChat_EGameChatType_EGCT_TEAM:\n\t{\n\t\tif (xMsg.has_target_id())\n\t\t{\n\t\t\tNFGUID xTargetID = NFINetModule::PBToNF(xMsg.target_id());\n\t\t\tif (!xTargetID.IsNull())\n\t\t\t{\n\t\t\t\tif (m_pKernelModule->GetObject(xTargetID))\n\t\t\t\t{\n\n\t\t\t\t}\n\t\t\t\telse\n\t\t\t\t{\n\t\t\t\t\t\/\/send to world server\n\t\t\t\t\tm_pGameServerToWorldModule->TransmitToWorld(xTargetID.nData64, nMsgID, xMsg);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\tbreak;\n\tdefault:\n\t\tbreak;;\n\t}\n}<|endoftext|>"} {"text":"<commit_before>\/*\n -----------------------------------------------------------------------------\n This source file is part of OGRE\n (Object-oriented Graphics Rendering Engine)\n For the latest info, see http:\/\/www.ogre3d.org\/\n \n Copyright (c) 2000-2014 Torus Knot Software Ltd\n \n Permission is hereby granted, free of charge, to any person obtaining a copy\n of this software and associated documentation files (the \"Software\"), to deal\n in the Software without restriction, including without limitation the rights\n to use, copy, modify, merge, publish, distribute, sublicense, and\/or sell\n copies of the Software, and to permit persons to whom the Software is\n furnished to do so, subject to the following conditions:\n \n The above copyright notice and this permission notice shall be included in\n all copies or substantial portions of the Software.\n \n THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\n IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\n FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE\n AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\n LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,\n OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN\n THE SOFTWARE.\n -----------------------------------------------------------------------------\n *\/\n#include \"OgreFileSystemLayer.h\"\n#include <errno.h>\n#include <unistd.h>\n#include <sys\/types.h>\n#include <sys\/stat.h>\n#include <pwd.h>\n\nnamespace Ogre\n{\n namespace {\n \/** Get actual file pointed to by symlink *\/\n const Ogre::String resolveSymlink(const Ogre::String& symlink)\n {\n ssize_t bufsize = 256;\n char* resolved = 0;\n do\n {\n char* buf = OGRE_ALLOC_T(char, bufsize, Ogre::MEMCATEGORY_GENERAL);\n ssize_t retval = readlink(symlink.c_str(), buf, bufsize);\n if (retval == -1)\n {\n OGRE_FREE(buf, Ogre::MEMCATEGORY_GENERAL);\n break;\n }\n\n if (retval < bufsize)\n {\n \/\/ operation was successful.\n \/\/ readlink does not guarantee to 0-terminate, so do this manually\n buf[retval] = '\\0';\n resolved = buf;\n }\n else\n {\n \/\/ buffer was too small, grow buffer and try again\n OGRE_FREE(buf, Ogre::MEMCATEGORY_GENERAL);\n bufsize <<= 1;\n }\n } while (!resolved);\n\n if (resolved)\n {\n Ogre::String result (resolved);\n OGRE_FREE(resolved, Ogre::MEMCATEGORY_GENERAL);\n return result;\n }\n else\n return \"\";\n }\n }\n \/\/---------------------------------------------------------------------\n void FileSystemLayer::getConfigPaths()\n {\n \/\/ try to determine the application's path:\n \/\/ recent systems should provide the executable path via the \/proc system\n Ogre::String appPath = resolveSymlink(\"\/proc\/self\/exe\");\n if (appPath.empty())\n {\n \/\/ if \/proc\/self\/exe isn't available, try it via the program's pid\n pid_t pid = getpid();\n char proc[64];\n int retval = snprintf(proc, sizeof(proc), \"\/proc\/%llu\/exe\", (unsigned long long) pid);\n if (retval > 0 && retval < (long)sizeof(proc))\n appPath = resolveSymlink(proc);\n }\n\n if (!appPath.empty())\n {\n \/\/ we need to strip the executable name from the path\n Ogre::String::size_type pos = appPath.rfind('\/');\n if (pos != Ogre::String::npos)\n appPath.erase(pos);\n }\n else\n {\n \/\/ couldn't find actual executable path, assume current working dir\n appPath = \".\";\n }\n\n \/\/ use application path as first config search path\n mConfigPaths.push_back(appPath + '\/');\n \/\/ then search inside ..\/share\/OGRE\n mConfigPaths.push_back(appPath + \"\/..\/share\/OGRE\/\");\n \/\/ then try system wide \/etc\n mConfigPaths.push_back(\"\/etc\/OGRE\/\");\n }\n \/\/---------------------------------------------------------------------\n void FileSystemLayer::prepareUserHome(const Ogre::String& subdir)\n {\n struct passwd* pwd = getpwuid(getuid());\n if (pwd)\n {\n mHomePath = pwd->pw_dir;\n }\n else\n {\n \/\/ try the $HOME environment variable\n mHomePath = getenv(\"HOME\");\n }\n\n if (!mHomePath.empty())\n {\n \/\/ create an .ogre subdir\n mHomePath.append(\"\/.ogre\/\");\n if (mkdir(mHomePath.c_str(), 0755) != 0 && errno != EEXIST)\n {\n \/\/ can't create dir\n mHomePath.clear();\n }\n else\n {\n \/\/ now create the given subdir\n mHomePath.append(subdir + '\/');\n if (mkdir(mHomePath.c_str(), 0755) != 0 && errno != EEXIST)\n {\n \/\/ can't create dir\n mHomePath.clear();\n }\n }\n }\n\n if (mHomePath.empty())\n {\n \/\/ couldn't create dir in home directory, fall back to cwd\n mHomePath = \".\/\";\n }\n }\n \/\/---------------------------------------------------------------------\n bool FileSystemLayer::fileExists(const Ogre::String& path)\n {\n return access(path.c_str(), R_OK) == 0;\n }\n \/\/---------------------------------------------------------------------\n bool FileSystemLayer::createDirectory(const Ogre::String& path)\n {\n return !mkdir(path.c_str(), 0755) || errno == EEXIST;\n }\n \/\/---------------------------------------------------------------------\n bool FileSystemLayer::removeDirectory(const Ogre::String& path)\n {\n return !rmdir(path.c_str()) || errno == ENOENT;\n }\n \/\/---------------------------------------------------------------------\n bool FileSystemLayer::removeFile(const Ogre::String& path)\n {\n return !unlink(path.c_str()) || errno == ENOENT;\n }\n \/\/---------------------------------------------------------------------\n bool FileSystemLayer::renameFile(const Ogre::String& oldname, const Ogre::String& newname)\n {\n return !rename(oldname.c_str(), newname.c_str());\n }\n}\n<commit_msg>FileSystemLayer: use XDG_CACHE_HOME as base path on Linux<commit_after>\/*\n -----------------------------------------------------------------------------\n This source file is part of OGRE\n (Object-oriented Graphics Rendering Engine)\n For the latest info, see http:\/\/www.ogre3d.org\/\n \n Copyright (c) 2000-2014 Torus Knot Software Ltd\n \n Permission is hereby granted, free of charge, to any person obtaining a copy\n of this software and associated documentation files (the \"Software\"), to deal\n in the Software without restriction, including without limitation the rights\n to use, copy, modify, merge, publish, distribute, sublicense, and\/or sell\n copies of the Software, and to permit persons to whom the Software is\n furnished to do so, subject to the following conditions:\n \n The above copyright notice and this permission notice shall be included in\n all copies or substantial portions of the Software.\n \n THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\n IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\n FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE\n AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\n LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,\n OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN\n THE SOFTWARE.\n -----------------------------------------------------------------------------\n *\/\n#include \"OgreFileSystemLayer.h\"\n#include <errno.h>\n#include <unistd.h>\n#include <sys\/types.h>\n#include <sys\/stat.h>\n#include <pwd.h>\n\nnamespace Ogre\n{\n namespace {\n \/** Get actual file pointed to by symlink *\/\n const Ogre::String resolveSymlink(const Ogre::String& symlink)\n {\n ssize_t bufsize = 256;\n char* resolved = 0;\n do\n {\n char* buf = OGRE_ALLOC_T(char, bufsize, Ogre::MEMCATEGORY_GENERAL);\n ssize_t retval = readlink(symlink.c_str(), buf, bufsize);\n if (retval == -1)\n {\n OGRE_FREE(buf, Ogre::MEMCATEGORY_GENERAL);\n break;\n }\n\n if (retval < bufsize)\n {\n \/\/ operation was successful.\n \/\/ readlink does not guarantee to 0-terminate, so do this manually\n buf[retval] = '\\0';\n resolved = buf;\n }\n else\n {\n \/\/ buffer was too small, grow buffer and try again\n OGRE_FREE(buf, Ogre::MEMCATEGORY_GENERAL);\n bufsize <<= 1;\n }\n } while (!resolved);\n\n if (resolved)\n {\n Ogre::String result (resolved);\n OGRE_FREE(resolved, Ogre::MEMCATEGORY_GENERAL);\n return result;\n }\n else\n return \"\";\n }\n }\n \/\/---------------------------------------------------------------------\n void FileSystemLayer::getConfigPaths()\n {\n \/\/ try to determine the application's path:\n \/\/ recent systems should provide the executable path via the \/proc system\n Ogre::String appPath = resolveSymlink(\"\/proc\/self\/exe\");\n if (appPath.empty())\n {\n \/\/ if \/proc\/self\/exe isn't available, try it via the program's pid\n pid_t pid = getpid();\n char proc[64];\n int retval = snprintf(proc, sizeof(proc), \"\/proc\/%llu\/exe\", (unsigned long long) pid);\n if (retval > 0 && retval < (long)sizeof(proc))\n appPath = resolveSymlink(proc);\n }\n\n if (!appPath.empty())\n {\n \/\/ we need to strip the executable name from the path\n Ogre::String::size_type pos = appPath.rfind('\/');\n if (pos != Ogre::String::npos)\n appPath.erase(pos);\n }\n else\n {\n \/\/ couldn't find actual executable path, assume current working dir\n appPath = \".\";\n }\n\n \/\/ use application path as first config search path\n mConfigPaths.push_back(appPath + '\/');\n \/\/ then search inside ..\/share\/OGRE\n mConfigPaths.push_back(appPath + \"\/..\/share\/OGRE\/\");\n \/\/ then try system wide \/etc\n mConfigPaths.push_back(\"\/etc\/OGRE\/\");\n }\n \/\/---------------------------------------------------------------------\n void FileSystemLayer::prepareUserHome(const Ogre::String& subdir)\n {\n char* xdg_cache = getenv(\"XDG_CACHE_HOME\");\n\n if(xdg_cache) {\n mHomePath = xdg_cache;\n mHomePath.append(\"\/\");\n } else {\n struct passwd* pwd = getpwuid(getuid());\n if (pwd)\n {\n mHomePath = pwd->pw_dir;\n }\n else\n {\n \/\/ try the $HOME environment variable\n mHomePath = getenv(\"HOME\");\n }\n\n if(!mHomePath.empty()) {\n mHomePath.append(\"\/.cache\/\");\n }\n }\n\n if (!mHomePath.empty())\n {\n \/\/ create the given subdir\n mHomePath.append(subdir + '\/');\n if (mkdir(mHomePath.c_str(), 0755) != 0 && errno != EEXIST)\n {\n \/\/ can't create dir\n mHomePath.clear();\n }\n }\n\n if (mHomePath.empty())\n {\n \/\/ couldn't create dir in home directory, fall back to cwd\n mHomePath = \".\/\";\n }\n }\n \/\/---------------------------------------------------------------------\n bool FileSystemLayer::fileExists(const Ogre::String& path)\n {\n return access(path.c_str(), R_OK) == 0;\n }\n \/\/---------------------------------------------------------------------\n bool FileSystemLayer::createDirectory(const Ogre::String& path)\n {\n return !mkdir(path.c_str(), 0755) || errno == EEXIST;\n }\n \/\/---------------------------------------------------------------------\n bool FileSystemLayer::removeDirectory(const Ogre::String& path)\n {\n return !rmdir(path.c_str()) || errno == ENOENT;\n }\n \/\/---------------------------------------------------------------------\n bool FileSystemLayer::removeFile(const Ogre::String& path)\n {\n return !unlink(path.c_str()) || errno == ENOENT;\n }\n \/\/---------------------------------------------------------------------\n bool FileSystemLayer::renameFile(const Ogre::String& oldname, const Ogre::String& newname)\n {\n return !rename(oldname.c_str(), newname.c_str());\n }\n}\n<|endoftext|>"} {"text":"<commit_before>\/\/ $Id$\n\/\/\n\/\/ Class to put cells into trigger patches\n\/\/\n\/\/ Author: M. Verweij\n\n#include <TClonesArray.h>\n#include <TRandom3.h>\n#include <TProfile.h>\n#include <TH3F.h>\n\n#include \"AliAnalysisManager.h\"\n#include \"AliLog.h\"\n#include \"AliEMCALGeometry.h\"\n#include \"AliEmcalTriggerPatchInfo.h\"\n\n#include \"AliEmcalPatchFromCellMaker.h\"\n\nClassImp(AliEmcalPatchFromCellMaker)\n\n\/\/________________________________________________________________________\nAliEmcalPatchFromCellMaker::AliEmcalPatchFromCellMaker() : \n AliAnalysisTaskEmcal(\"AliEmcalPatchFromCellMaker\",kTRUE),\n fCaloTriggersOutName(\"EmcalPatches32x32\"),\n fCaloTriggersOut(0),\n fPatchDim(32),\n fMinCellE(0.15),\n fCellTimeMin(485e-9),\n fCellTimeMax(685e-9),\n fL1Slide(0),\n fh3EEtaPhiCell(0),\n fh2CellEnergyVsTime(0),\n fh1CellEnergySum(0)\n{\n \/\/ Constructor.\n for (Int_t i = 0; i < kPatchCols; i++) {\n for (Int_t j = 0; j < kPatchRows; j++) {\n fPatchADCSimple[i][j] = 0.;\n fPatchESimple[i][j] = 0.;\n }\n }\n\n SetMakeGeneralHistograms(kTRUE);\n}\n\n\/\/________________________________________________________________________\nAliEmcalPatchFromCellMaker::AliEmcalPatchFromCellMaker(const char *name) : \n AliAnalysisTaskEmcal(name,kTRUE),\n fCaloTriggersOutName(\"EmcalPatches32x32\"),\n fCaloTriggersOut(0),\n fPatchDim(32),\n fMinCellE(0.15),\n fCellTimeMin(485e-9),\n fCellTimeMax(685e-9),\n fL1Slide(0),\n fh3EEtaPhiCell(0),\n fh2CellEnergyVsTime(0),\n fh1CellEnergySum(0)\n{\n \/\/ Constructor.\n for (Int_t i = 0; i < kPatchCols; i++) {\n for (Int_t j = 0; j < kPatchRows; j++) {\n fPatchADCSimple[i][j] = 0.;\n fPatchESimple[i][j] = 0.;\n }\n }\n\n SetMakeGeneralHistograms(kTRUE);\n}\n\n\/\/________________________________________________________________________\nAliEmcalPatchFromCellMaker::~AliEmcalPatchFromCellMaker()\n{\n \/\/ Destructor.\n}\n\n\/\/________________________________________________________________________\nvoid AliEmcalPatchFromCellMaker::ExecOnce() \n{\n \/\/ Init the analysis.\n\n AliAnalysisTaskEmcal::ExecOnce();\n\n if (!fInitialized)\n return;\n\n if (!fCaloTriggersOutName.IsNull()) {\n fCaloTriggersOut = new TClonesArray(\"AliEmcalTriggerPatchInfo\");\n fCaloTriggersOut->SetName(fCaloTriggersOutName);\n\n if (!(InputEvent()->FindListObject(fCaloTriggersOutName))) {\n InputEvent()->AddObject(fCaloTriggersOut);\n }\n else {\n fInitialized = kFALSE;\n AliFatal(Form(\"%s: Container with same name %s already present. Aborting\", GetName(), fCaloTriggersOutName.Data()));\n return;\n }\n }\n\n}\n\n\/\/________________________________________________________________________\nvoid AliEmcalPatchFromCellMaker::UserCreateOutputObjects()\n{\n \/\/ Create user output.\n\n AliAnalysisTaskEmcal::UserCreateOutputObjects();\n\n Int_t fgkNPhiBins = 18*8;\n Float_t kMinPhi = 0.;\n Float_t kMaxPhi = 2.*TMath::Pi();\n Double_t *binsPhi = new Double_t[fgkNPhiBins+1];\n for(Int_t i=0; i<=fgkNPhiBins; i++) binsPhi[i]=(Double_t)kMinPhi + (kMaxPhi-kMinPhi)\/fgkNPhiBins*(Double_t)i ;\n\n Int_t fgkNEtaBins = 100;\n Float_t fgkEtaMin = -1.;\n Float_t fgkEtaMax = 1.;\n Double_t *binsEta=new Double_t[fgkNEtaBins+1];\n for(Int_t i=0; i<=fgkNEtaBins; i++) binsEta[i]=(Double_t)fgkEtaMin + (fgkEtaMax-fgkEtaMin)\/fgkNEtaBins*(Double_t)i ;\n\n Int_t fgkNTimeBins = 600;\n Float_t kMinTime = -200.;\n Float_t kMaxTime = 1000;\n Double_t *binsTime = new Double_t[fgkNTimeBins+1];\n for(Int_t i=0; i<=fgkNTimeBins; i++) binsTime[i]=(Double_t)kMinTime + (kMaxTime-kMinTime)\/fgkNTimeBins*(Double_t)i ;\n\n Double_t enBinEdges[3][2];\n enBinEdges[0][0] = 1.; \/\/10 bins\n enBinEdges[0][1] = 0.1;\n enBinEdges[1][0] = 5.; \/\/8 bins\n enBinEdges[1][1] = 0.5;\n enBinEdges[2][0] = 100.;\/\/95 bins\n enBinEdges[2][1] = 1.;\n\n const Float_t enmin1 = 0;\n const Float_t enmax1 = enBinEdges[0][0];\n const Float_t enmin2 = enmax1 ;\n const Float_t enmax2 = enBinEdges[1][0];\n const Float_t enmin3 = enmax2 ;\n const Float_t enmax3 = enBinEdges[2][0];\/\/fgkEnMax;\n const Int_t nbin11 = (int)((enmax1-enmin1)\/enBinEdges[0][1]);\n const Int_t nbin12 = (int)((enmax2-enmin2)\/enBinEdges[1][1])+nbin11;\n const Int_t nbin13 = (int)((enmax3-enmin3)\/enBinEdges[2][1])+nbin12;\n\n Int_t fgkNEnBins=nbin13;\n Double_t *binsEn=new Double_t[fgkNEnBins+1];\n for(Int_t i=0; i<=fgkNEnBins; i++) {\n if(i<=nbin11) binsEn[i]=(Double_t)enmin1 + (enmax1-enmin1)\/nbin11*(Double_t)i ;\n if(i<=nbin12 && i>nbin11) binsEn[i]=(Double_t)enmin2 + (enmax2-enmin2)\/(nbin12-nbin11)*((Double_t)i-(Double_t)nbin11) ;\n if(i<=nbin13 && i>nbin12) binsEn[i]=(Double_t)enmin3 + (enmax3-enmin3)\/(nbin13-nbin12)*((Double_t)i-(Double_t)nbin12) ;\n }\n\n fh3EEtaPhiCell = new TH3F(\"fh3EEtaPhiCell\",\"fh3EEtaPhiCell;E_{cell};#eta;#phi\",fgkNEnBins,binsEn,fgkNEtaBins,binsEta,fgkNPhiBins,binsPhi);\n fOutput->Add(fh3EEtaPhiCell);\n\n fh2CellEnergyVsTime = new TH2F(\"fh2CellEnergyVsTime\",\"fh2CellEnergyVsTime;E_{cell};time\",fgkNEnBins,binsEn,fgkNTimeBins,binsTime);\n fOutput->Add(fh2CellEnergyVsTime);\n\n fh1CellEnergySum = new TH1F(\"fh1CellEnergySum\",\"fh1CellEnergySum;E_{cell};time\",fgkNEnBins,binsEn);\n fOutput->Add(fh1CellEnergySum);\n\n PostData(1, fOutput); \/\/ Post data for ALL output slots > 0 here.\n\n if(binsEn) delete [] binsEn;\n if(binsPhi) delete [] binsPhi;\n if(binsEta) delete [] binsEta;\n if(binsTime) delete [] binsTime;\n}\n\n\/\/________________________________________________________________________\nBool_t AliEmcalPatchFromCellMaker::Run() \n{\n \/\/ Main loop, called for each event.\n \n fCaloTriggersOut->Delete();\n\n if (!fCaloCells) {\n AliError(Form(\"Calo cells container %s not available.\", fCaloCellsName.Data()));\n return kFALSE;\n }\n\n for (Int_t i = 0; i < kPatchCols; i++) {\n for (Int_t j = 0; j < kPatchRows; j++) {\n fPatchADCSimple[i][j] = 0.;\n fPatchESimple[i][j] = 0.;\n }\n }\n\n if(!FillPatchADCSimple()) {\n AliError(Form(\"%s Could not create simple ADC patches\",GetName()));\n return kFALSE;\n }\n\n RunSimpleOfflineTrigger();\n\n Double_t sum = 0.;\n for (Int_t i = 0; i < kPatchCols; i++) {\n for (Int_t j = 0; j < kPatchRows; j++) {\n sum+=fPatchESimple[i][j];\n }\n }\n\n return kTRUE;\n}\n\n\/\/________________________________________________________________________\nBool_t AliEmcalPatchFromCellMaker::FillPatchADCSimple()\n{\n\n \/\/ fill the array for offline trigger processing\n\n \/\/ fill the patch ADCs from cells\n Double_t sum = 0.;\n Int_t nCell = fCaloCells->GetNumberOfCells();\n for(Int_t iCell = 0; iCell < nCell; ++iCell) {\n \/\/ get the cell info, based in index in array\n Short_t cellId = fCaloCells->GetCellNumber(iCell);\n\n Double_t cellT = fCaloCells->GetCellTime(cellId); \n Double_t amp = fCaloCells->GetAmplitude(iCell);\n fh2CellEnergyVsTime->Fill(amp,cellT*1e9);\n\n \/\/timing cuts\n if(cellT<fCellTimeMin || cellT>fCellTimeMax) continue;\n \/\/energy cut\n if(amp<fMinCellE) continue;\n sum+=amp;\n\n \/\/ get position\n Int_t absId=-1;\n fGeom->GetFastORIndexFromCellIndex(cellId, absId);\n Int_t globCol=-1, globRow=-1;\n fGeom->GetPositionInEMCALFromAbsFastORIndex(absId, globCol, globRow);\n \/\/ add\n fPatchADCSimple[globCol][globRow] += amp\/kEMCL1ADCtoGeV;\n fPatchESimple[globCol][globRow] += amp;\n\n TVector3 pos;\n fGeom->GetGlobal(cellId, pos);\n TLorentzVector lv(pos,amp);\n Double_t cellEta = lv.Eta();\n Double_t cellPhi = lv.Phi();\n if(cellPhi<0.) cellPhi+=TMath::TwoPi();\n if(cellPhi>TMath::TwoPi()) cellPhi-=TMath::TwoPi();\n fh3EEtaPhiCell->Fill(amp,cellEta,cellPhi); \n }\n fh1CellEnergySum->Fill(sum);\n\n return kTRUE;\n}\n\n\/\/________________________________________________________________________\nvoid AliEmcalPatchFromCellMaker::RunSimpleOfflineTrigger()\n{\n \/\/ Runs a simple offline trigger algorithm.\n \/\/ It creates separate patches with dimension fPatchDim\n\n \/\/ run the trigger algo, stepping by stepsize (in trigger tower units)\n Int_t itrig = 0;\n Int_t patchSize = GetDimFastor();\n Int_t stepSize = GetSlidingStepSizeFastor();\n Int_t maxCol = kPatchCols - patchSize;\n Int_t maxRow = kPatchRows - patchSize;\n\n for (Int_t i = 0; i <= maxCol; i += stepSize) {\n for (Int_t j = 0; j <= maxRow; j += stepSize) {\n \/\/ get the trigger towers composing the patch\n Int_t adcAmp = 0;\n Double_t enAmp = 0.;\n \/\/ window\n for (Int_t k = 0; k < patchSize; ++k) {\n for (Int_t l = 0; l < patchSize; ++l) {\n\t \/\/ add amplitudes\n adcAmp += (ULong64_t)fPatchADCSimple[i+k][j+l];\n\t enAmp += fPatchESimple[i+k][j+l];\n\t}\n }\n\n if (adcAmp == 0) {\n\tAliDebug(2,\"EMCal trigger patch with 0 ADC counts.\");\n\tcontinue;\n }\n\n Int_t absId=-1;\n Int_t cellAbsId[4]={-1,-1,-1,-1};\n\n \/\/ get low left edge (eta max, phi min)\n fGeom->GetAbsFastORIndexFromPositionInEMCAL(i, j, absId);\n \/\/ convert to the 4 absId of the cells composing the trigger channel\n fGeom->GetCellIndexFromFastORIndex(absId, cellAbsId);\n TVector3 edge1;\n fGeom->GetGlobal(cellAbsId[0], edge1);\n\n \/\/ get up right edge (eta min, phi max)\n fGeom->GetAbsFastORIndexFromPositionInEMCAL(i+patchSize-1, j+patchSize-1, absId);\n fGeom->GetCellIndexFromFastORIndex(absId, cellAbsId);\n TVector3 edge2;\n fGeom->GetGlobal(cellAbsId[3], edge2);\n\n \/\/ get the center of the patch\n Int_t offsetCenter = TMath::FloorNint(0.5*patchSize);\n fGeom->GetAbsFastORIndexFromPositionInEMCAL(i+offsetCenter-1, j+offsetCenter-1, absId);\n fGeom->GetCellIndexFromFastORIndex(absId, cellAbsId);\n TVector3 center1;\n fGeom->GetGlobal(cellAbsId[3], center1);\n\n fGeom->GetAbsFastORIndexFromPositionInEMCAL(i+offsetCenter, j+offsetCenter, absId);\n fGeom->GetCellIndexFromFastORIndex(absId, cellAbsId);\n TVector3 center2;\n fGeom->GetGlobal(cellAbsId[0], center2);\n\n TVector3 centerGeo(center1);\n centerGeo += center2;\n centerGeo *= 0.5;\n\n \/\/ save the trigger object\n AliEmcalTriggerPatchInfo *trigger =\n\tnew ((*fCaloTriggersOut)[itrig]) AliEmcalTriggerPatchInfo();\n itrig++;\n trigger->SetCenterGeo(centerGeo, enAmp);\n trigger->SetEdge1(edge1, enAmp);\n trigger->SetEdge2(edge2, enAmp);\n trigger->SetADCAmp(adcAmp);\n trigger->SetEdgeCell(i*2, j*2); \/\/ from triggers to cells\n }\n } \/\/ trigger algo\n AliDebug(2,Form(\"Created %d trigger patches (%d) in this event\",itrig,patchSize));\n\n}\n\n\/\/________________________________________________________________________\nInt_t AliEmcalPatchFromCellMaker::GetDimFastor() const {\n\n Int_t dim = TMath::FloorNint((Double_t)(fPatchDim\/2.));\n return dim;\n}\n\n\/\/________________________________________________________________________\nInt_t AliEmcalPatchFromCellMaker::GetSlidingStepSizeFastor() const {\n\n Int_t dim = GetDimFastor();\n if(!fL1Slide) return dim;\n\n if(dim==2) return 2;\n else if(dim==4) return 4;\n else if(dim==8) return 4;\n else if(dim==16) return 8;\n else return -1;\n}\n\n\n\n\n<commit_msg>lower cell energy<commit_after>\/\/ $Id$\n\/\/\n\/\/ Class to put cells into trigger patches\n\/\/\n\/\/ Author: M. Verweij\n\n#include <TClonesArray.h>\n#include <TRandom3.h>\n#include <TProfile.h>\n#include <TH3F.h>\n\n#include \"AliAnalysisManager.h\"\n#include \"AliLog.h\"\n#include \"AliEMCALGeometry.h\"\n#include \"AliEmcalTriggerPatchInfo.h\"\n\n#include \"AliEmcalPatchFromCellMaker.h\"\n\nClassImp(AliEmcalPatchFromCellMaker)\n\n\/\/________________________________________________________________________\nAliEmcalPatchFromCellMaker::AliEmcalPatchFromCellMaker() : \n AliAnalysisTaskEmcal(\"AliEmcalPatchFromCellMaker\",kTRUE),\n fCaloTriggersOutName(\"EmcalPatches32x32\"),\n fCaloTriggersOut(0),\n fPatchDim(32),\n fMinCellE(0.05),\n fCellTimeMin(485e-9),\n fCellTimeMax(685e-9),\n fL1Slide(0),\n fh3EEtaPhiCell(0),\n fh2CellEnergyVsTime(0),\n fh1CellEnergySum(0)\n{\n \/\/ Constructor.\n for (Int_t i = 0; i < kPatchCols; i++) {\n for (Int_t j = 0; j < kPatchRows; j++) {\n fPatchADCSimple[i][j] = 0.;\n fPatchESimple[i][j] = 0.;\n }\n }\n\n SetMakeGeneralHistograms(kTRUE);\n}\n\n\/\/________________________________________________________________________\nAliEmcalPatchFromCellMaker::AliEmcalPatchFromCellMaker(const char *name) : \n AliAnalysisTaskEmcal(name,kTRUE),\n fCaloTriggersOutName(\"EmcalPatches32x32\"),\n fCaloTriggersOut(0),\n fPatchDim(32),\n fMinCellE(0.05),\n fCellTimeMin(485e-9),\n fCellTimeMax(685e-9),\n fL1Slide(0),\n fh3EEtaPhiCell(0),\n fh2CellEnergyVsTime(0),\n fh1CellEnergySum(0)\n{\n \/\/ Constructor.\n for (Int_t i = 0; i < kPatchCols; i++) {\n for (Int_t j = 0; j < kPatchRows; j++) {\n fPatchADCSimple[i][j] = 0.;\n fPatchESimple[i][j] = 0.;\n }\n }\n\n SetMakeGeneralHistograms(kTRUE);\n}\n\n\/\/________________________________________________________________________\nAliEmcalPatchFromCellMaker::~AliEmcalPatchFromCellMaker()\n{\n \/\/ Destructor.\n}\n\n\/\/________________________________________________________________________\nvoid AliEmcalPatchFromCellMaker::ExecOnce() \n{\n \/\/ Init the analysis.\n\n AliAnalysisTaskEmcal::ExecOnce();\n\n if (!fInitialized)\n return;\n\n if (!fCaloTriggersOutName.IsNull()) {\n fCaloTriggersOut = new TClonesArray(\"AliEmcalTriggerPatchInfo\");\n fCaloTriggersOut->SetName(fCaloTriggersOutName);\n\n if (!(InputEvent()->FindListObject(fCaloTriggersOutName))) {\n InputEvent()->AddObject(fCaloTriggersOut);\n }\n else {\n fInitialized = kFALSE;\n AliFatal(Form(\"%s: Container with same name %s already present. Aborting\", GetName(), fCaloTriggersOutName.Data()));\n return;\n }\n }\n\n}\n\n\/\/________________________________________________________________________\nvoid AliEmcalPatchFromCellMaker::UserCreateOutputObjects()\n{\n \/\/ Create user output.\n\n AliAnalysisTaskEmcal::UserCreateOutputObjects();\n\n Int_t fgkNPhiBins = 18*8;\n Float_t kMinPhi = 0.;\n Float_t kMaxPhi = 2.*TMath::Pi();\n Double_t *binsPhi = new Double_t[fgkNPhiBins+1];\n for(Int_t i=0; i<=fgkNPhiBins; i++) binsPhi[i]=(Double_t)kMinPhi + (kMaxPhi-kMinPhi)\/fgkNPhiBins*(Double_t)i ;\n\n Int_t fgkNEtaBins = 100;\n Float_t fgkEtaMin = -1.;\n Float_t fgkEtaMax = 1.;\n Double_t *binsEta=new Double_t[fgkNEtaBins+1];\n for(Int_t i=0; i<=fgkNEtaBins; i++) binsEta[i]=(Double_t)fgkEtaMin + (fgkEtaMax-fgkEtaMin)\/fgkNEtaBins*(Double_t)i ;\n\n Int_t fgkNTimeBins = 600;\n Float_t kMinTime = -200.;\n Float_t kMaxTime = 1000;\n Double_t *binsTime = new Double_t[fgkNTimeBins+1];\n for(Int_t i=0; i<=fgkNTimeBins; i++) binsTime[i]=(Double_t)kMinTime + (kMaxTime-kMinTime)\/fgkNTimeBins*(Double_t)i ;\n\n Double_t enBinEdges[3][2];\n enBinEdges[0][0] = 1.; \/\/10 bins\n enBinEdges[0][1] = 0.1;\n enBinEdges[1][0] = 5.; \/\/8 bins\n enBinEdges[1][1] = 0.5;\n enBinEdges[2][0] = 100.;\/\/95 bins\n enBinEdges[2][1] = 1.;\n\n const Float_t enmin1 = 0;\n const Float_t enmax1 = enBinEdges[0][0];\n const Float_t enmin2 = enmax1 ;\n const Float_t enmax2 = enBinEdges[1][0];\n const Float_t enmin3 = enmax2 ;\n const Float_t enmax3 = enBinEdges[2][0];\/\/fgkEnMax;\n const Int_t nbin11 = (int)((enmax1-enmin1)\/enBinEdges[0][1]);\n const Int_t nbin12 = (int)((enmax2-enmin2)\/enBinEdges[1][1])+nbin11;\n const Int_t nbin13 = (int)((enmax3-enmin3)\/enBinEdges[2][1])+nbin12;\n\n Int_t fgkNEnBins=nbin13;\n Double_t *binsEn=new Double_t[fgkNEnBins+1];\n for(Int_t i=0; i<=fgkNEnBins; i++) {\n if(i<=nbin11) binsEn[i]=(Double_t)enmin1 + (enmax1-enmin1)\/nbin11*(Double_t)i ;\n if(i<=nbin12 && i>nbin11) binsEn[i]=(Double_t)enmin2 + (enmax2-enmin2)\/(nbin12-nbin11)*((Double_t)i-(Double_t)nbin11) ;\n if(i<=nbin13 && i>nbin12) binsEn[i]=(Double_t)enmin3 + (enmax3-enmin3)\/(nbin13-nbin12)*((Double_t)i-(Double_t)nbin12) ;\n }\n\n fh3EEtaPhiCell = new TH3F(\"fh3EEtaPhiCell\",\"fh3EEtaPhiCell;E_{cell};#eta;#phi\",fgkNEnBins,binsEn,fgkNEtaBins,binsEta,fgkNPhiBins,binsPhi);\n fOutput->Add(fh3EEtaPhiCell);\n\n fh2CellEnergyVsTime = new TH2F(\"fh2CellEnergyVsTime\",\"fh2CellEnergyVsTime;E_{cell};time\",fgkNEnBins,binsEn,fgkNTimeBins,binsTime);\n fOutput->Add(fh2CellEnergyVsTime);\n\n fh1CellEnergySum = new TH1F(\"fh1CellEnergySum\",\"fh1CellEnergySum;E_{cell};time\",fgkNEnBins,binsEn);\n fOutput->Add(fh1CellEnergySum);\n\n PostData(1, fOutput); \/\/ Post data for ALL output slots > 0 here.\n\n if(binsEn) delete [] binsEn;\n if(binsPhi) delete [] binsPhi;\n if(binsEta) delete [] binsEta;\n if(binsTime) delete [] binsTime;\n}\n\n\/\/________________________________________________________________________\nBool_t AliEmcalPatchFromCellMaker::Run() \n{\n \/\/ Main loop, called for each event.\n \n fCaloTriggersOut->Delete();\n\n if (!fCaloCells) {\n AliError(Form(\"Calo cells container %s not available.\", fCaloCellsName.Data()));\n return kFALSE;\n }\n\n for (Int_t i = 0; i < kPatchCols; i++) {\n for (Int_t j = 0; j < kPatchRows; j++) {\n fPatchADCSimple[i][j] = 0.;\n fPatchESimple[i][j] = 0.;\n }\n }\n\n if(!FillPatchADCSimple()) {\n AliError(Form(\"%s Could not create simple ADC patches\",GetName()));\n return kFALSE;\n }\n\n RunSimpleOfflineTrigger();\n\n Double_t sum = 0.;\n for (Int_t i = 0; i < kPatchCols; i++) {\n for (Int_t j = 0; j < kPatchRows; j++) {\n sum+=fPatchESimple[i][j];\n }\n }\n\n return kTRUE;\n}\n\n\/\/________________________________________________________________________\nBool_t AliEmcalPatchFromCellMaker::FillPatchADCSimple()\n{\n\n \/\/ fill the array for offline trigger processing\n\n \/\/ fill the patch ADCs from cells\n Double_t sum = 0.;\n Int_t nCell = fCaloCells->GetNumberOfCells();\n for(Int_t iCell = 0; iCell < nCell; ++iCell) {\n \/\/ get the cell info, based in index in array\n Short_t cellId = fCaloCells->GetCellNumber(iCell);\n\n Double_t cellT = fCaloCells->GetCellTime(cellId); \n Double_t amp = fCaloCells->GetAmplitude(iCell);\n fh2CellEnergyVsTime->Fill(amp,cellT*1e9);\n\n \/\/timing cuts\n if(cellT<fCellTimeMin || cellT>fCellTimeMax) continue;\n \/\/energy cut\n if(amp<fMinCellE) continue;\n sum+=amp;\n\n \/\/ get position\n Int_t absId=-1;\n fGeom->GetFastORIndexFromCellIndex(cellId, absId);\n Int_t globCol=-1, globRow=-1;\n fGeom->GetPositionInEMCALFromAbsFastORIndex(absId, globCol, globRow);\n \/\/ add\n fPatchADCSimple[globCol][globRow] += amp\/kEMCL1ADCtoGeV;\n fPatchESimple[globCol][globRow] += amp;\n\n TVector3 pos;\n fGeom->GetGlobal(cellId, pos);\n TLorentzVector lv(pos,amp);\n Double_t cellEta = lv.Eta();\n Double_t cellPhi = lv.Phi();\n if(cellPhi<0.) cellPhi+=TMath::TwoPi();\n if(cellPhi>TMath::TwoPi()) cellPhi-=TMath::TwoPi();\n fh3EEtaPhiCell->Fill(amp,cellEta,cellPhi); \n }\n fh1CellEnergySum->Fill(sum);\n\n return kTRUE;\n}\n\n\/\/________________________________________________________________________\nvoid AliEmcalPatchFromCellMaker::RunSimpleOfflineTrigger()\n{\n \/\/ Runs a simple offline trigger algorithm.\n \/\/ It creates separate patches with dimension fPatchDim\n\n \/\/ run the trigger algo, stepping by stepsize (in trigger tower units)\n Int_t itrig = 0;\n Int_t patchSize = GetDimFastor();\n Int_t stepSize = GetSlidingStepSizeFastor();\n Int_t maxCol = kPatchCols - patchSize;\n Int_t maxRow = kPatchRows - patchSize;\n\n for (Int_t i = 0; i <= maxCol; i += stepSize) {\n for (Int_t j = 0; j <= maxRow; j += stepSize) {\n \/\/ get the trigger towers composing the patch\n Int_t adcAmp = 0;\n Double_t enAmp = 0.;\n \/\/ window\n for (Int_t k = 0; k < patchSize; ++k) {\n for (Int_t l = 0; l < patchSize; ++l) {\n\t \/\/ add amplitudes\n adcAmp += (ULong64_t)fPatchADCSimple[i+k][j+l];\n\t enAmp += fPatchESimple[i+k][j+l];\n\t}\n }\n\n if (adcAmp == 0) {\n\tAliDebug(2,\"EMCal trigger patch with 0 ADC counts.\");\n\tcontinue;\n }\n\n Int_t absId=-1;\n Int_t cellAbsId[4]={-1,-1,-1,-1};\n\n \/\/ get low left edge (eta max, phi min)\n fGeom->GetAbsFastORIndexFromPositionInEMCAL(i, j, absId);\n \/\/ convert to the 4 absId of the cells composing the trigger channel\n fGeom->GetCellIndexFromFastORIndex(absId, cellAbsId);\n TVector3 edge1;\n fGeom->GetGlobal(cellAbsId[0], edge1);\n\n \/\/ get up right edge (eta min, phi max)\n fGeom->GetAbsFastORIndexFromPositionInEMCAL(i+patchSize-1, j+patchSize-1, absId);\n fGeom->GetCellIndexFromFastORIndex(absId, cellAbsId);\n TVector3 edge2;\n fGeom->GetGlobal(cellAbsId[3], edge2);\n\n \/\/ get the center of the patch\n Int_t offsetCenter = TMath::FloorNint(0.5*patchSize);\n fGeom->GetAbsFastORIndexFromPositionInEMCAL(i+offsetCenter-1, j+offsetCenter-1, absId);\n fGeom->GetCellIndexFromFastORIndex(absId, cellAbsId);\n TVector3 center1;\n fGeom->GetGlobal(cellAbsId[3], center1);\n\n fGeom->GetAbsFastORIndexFromPositionInEMCAL(i+offsetCenter, j+offsetCenter, absId);\n fGeom->GetCellIndexFromFastORIndex(absId, cellAbsId);\n TVector3 center2;\n fGeom->GetGlobal(cellAbsId[0], center2);\n\n TVector3 centerGeo(center1);\n centerGeo += center2;\n centerGeo *= 0.5;\n\n \/\/ save the trigger object\n AliEmcalTriggerPatchInfo *trigger =\n\tnew ((*fCaloTriggersOut)[itrig]) AliEmcalTriggerPatchInfo();\n itrig++;\n trigger->SetCenterGeo(centerGeo, enAmp);\n trigger->SetEdge1(edge1, enAmp);\n trigger->SetEdge2(edge2, enAmp);\n trigger->SetADCAmp(adcAmp);\n trigger->SetEdgeCell(i*2, j*2); \/\/ from triggers to cells\n }\n } \/\/ trigger algo\n AliDebug(2,Form(\"Created %d trigger patches (%d) in this event\",itrig,patchSize));\n\n}\n\n\/\/________________________________________________________________________\nInt_t AliEmcalPatchFromCellMaker::GetDimFastor() const {\n\n Int_t dim = TMath::FloorNint((Double_t)(fPatchDim\/2.));\n return dim;\n}\n\n\/\/________________________________________________________________________\nInt_t AliEmcalPatchFromCellMaker::GetSlidingStepSizeFastor() const {\n\n Int_t dim = GetDimFastor();\n if(!fL1Slide) return dim;\n\n if(dim==2) return 2;\n else if(dim==4) return 4;\n else if(dim==8) return 4;\n else if(dim==16) return 8;\n else return -1;\n}\n\n\n\n\n<|endoftext|>"} {"text":"<commit_before>#include \"function.h\"\n\nFunction::Function(\n\t\tchar * name,\n\t\tbool isOperator,\n\t\tExpr * returnT,\n\t\tstd::vector<Variable*> * params) {\n\tthis->name = name;\n\tthis->isOperator = isOperator;\n\tthis->returnT = returnT;\n\tthis->params = params;\n}\n\nPyObject * Function::toJson() const {\n\tPyObject *d = Named::toJson();\n\tPyDict_SetItemString(d, \"isOperator\", PyBool_FromLong(isOperator));\n\tif (returnT) {\n\t\tPyDict_SetItemString(d, \"returnT\", returnT->toJson());\n\t} else {\n\t\tPy_IncRef(Py_None);\n\t\tPyDict_SetItemString(d, \"returnT\", Py_None);\n\t\taddJsonArrP(d, \"params\", *params);\n\t\taddJsonArrP(d, \"locals\", locals);\n\t\taddJsonArrP(d, \"body\", body);\n\t}\n\tPy_IncRef(d);\n\treturn d;\n}\n<commit_msg>fix function params, locals, body toJson<commit_after>#include \"function.h\"\n\nFunction::Function(\n\t\tchar * name,\n\t\tbool isOperator,\n\t\tExpr * returnT,\n\t\tstd::vector<Variable*> * params) {\n\tthis->name = name;\n\tthis->isOperator = isOperator;\n\tthis->returnT = returnT;\n\tthis->params = params;\n}\n\nPyObject * Function::toJson() const {\n\tPyObject *d = Named::toJson();\n\tPyDict_SetItemString(d, \"isOperator\", PyBool_FromLong(isOperator));\n\tif (returnT) {\n\t\tPyDict_SetItemString(d, \"returnT\", returnT->toJson());\n\t} else {\n\t\tPy_IncRef(Py_None);\n\t\tPyDict_SetItemString(d, \"returnT\", Py_None);\n\t}\n\taddJsonArrP(d, \"params\", *params);\n\taddJsonArrP(d, \"locals\", locals);\n\taddJsonArrP(d, \"body\", body);\n\tPy_IncRef(d);\n\treturn d;\n}\n<|endoftext|>"} {"text":"<commit_before>#include <glog\/logging.h>\n#include <sstream>\n#include <stdlib.h>\n#include <exception>\n#include <boost\/lexical_cast.hpp>\n#include <boost\/algorithm\/string.hpp>\n#include <boost\/property_tree\/ptree.hpp>\n#include <boost\/property_tree\/json_parser.hpp>\n#include <boost\/foreach.hpp>\n#include <boost\/any.hpp>\n#include \"SSEConfig.h\"\n\nusing namespace std;\n\n\/**\n Constructor.\n*\/\nSSEConfig::SSEConfig() {\n InitDefaults();\n}\n\n\/**\n Initialize some sane default config values.\n*\/\nvoid SSEConfig::InitDefaults() {\n\n ConfigMap[\"server.bindip\"] = \"0.0.0.0\";\n ConfigMap[\"server.port\"] = \"8090\";\n ConfigMap[\"server.logdir\"] = \".\/\";\n ConfigMap[\"server.pingInterval\"] = \"5\";\n ConfigMap[\"server.threadsPerChannel\"] = \"5\";\n ConfigMap[\"server.channelCacheSize\"] = \"500\";\n ConfigMap[\"server.allowUndefinedChannels\"] = \"true\";\n\n ConfigMap[\"amqp.host\"] = \"127.0.0.1\";\n ConfigMap[\"amqp.port\"] = \"5672\";\n ConfigMap[\"amqp.user\"] = \"guest\";\n ConfigMap[\"amqp.password\"] = \"guest\";\n ConfigMap[\"amqp.exchange\"] = \"amq.fanout\";\n\n}\n\n\/**\n Load a config file.\n @param file Filename of config to load. \n*\/\nbool SSEConfig::load(const char *file) {\n boost::property_tree::ptree pt;\n\n try {\n boost::property_tree::read_json(file, pt);\n } catch (...) {\n return false;\n }\n\n \/\/ Populate ConfigMap.\n BOOST_FOREACH(ConfigMap_t::value_type &element, ConfigMap) {\n try {\n string val = pt.get<std::string>(element.first);\n ConfigMap[element.first] = val;\n DLOG(INFO) << element.first << \" = \" << ConfigMap[element.first];\n } catch (...) {}\n }\n\n \/\/ Populate ChannelMap.\n try {\n BOOST_FOREACH(boost::property_tree::ptree::value_type& child, pt.get_child(\"channels\")) {\n try {\n string chName = child.second.get<std::string>(\"path\");\n string allowedOrigins = child.second.get<std::string>(\"allowedOrigins\");\n int historyLength = child.second.get<int>(\"historyLength\");\n\n ChannelMap[chName].allowedOrigins = allowedOrigins;\n ChannelMap[chName].historyLength = historyLength;\n } catch (boost::property_tree::ptree_error &e) {\n LOG(FATAL) << \"Invalid channel definition in config: \" << e.what();\n }\n }\n } catch(...) {\n DLOG(INFO) << \"Warning: No channels defined in config.\";\n }\n\n return true;\n}\n\n\/**\n Fetch a config attribute and return as a string.\n @param key Config attribute to fetch. \n*\/\nconst string &SSEConfig::GetValue(const string& key) {\n return ConfigMap[key];\n}\n\n\/**\n Fetch a config attribute and return as a int.\n @param key Config attribute to fetch. \n*\/\nint SSEConfig::GetValueInt(const string& key) {\n try {\n return boost::lexical_cast<int>(ConfigMap[key]);\n } catch(...) {\n return 0;\n }\n}\n\n\/**\n * Fetch a config attribute and return as a boolean.\n * @param key Config attribute to fetch.\n*\/\nbool SSEConfig::GetValueBool(const string& key) {\n if (ConfigMap[key].compare(\"true\") == 0) return true;\n return false;\n}\n<commit_msg>Fail if there is no channels configured and allowUndefinedChannels is false.<commit_after>#include <glog\/logging.h>\n#include <sstream>\n#include <stdlib.h>\n#include <exception>\n#include <boost\/lexical_cast.hpp>\n#include <boost\/algorithm\/string.hpp>\n#include <boost\/property_tree\/ptree.hpp>\n#include <boost\/property_tree\/json_parser.hpp>\n#include <boost\/foreach.hpp>\n#include <boost\/any.hpp>\n#include \"SSEConfig.h\"\n\nusing namespace std;\n\n\/**\n Constructor.\n*\/\nSSEConfig::SSEConfig() {\n InitDefaults();\n}\n\n\/**\n Initialize some sane default config values.\n*\/\nvoid SSEConfig::InitDefaults() {\n\n ConfigMap[\"server.bindip\"] = \"0.0.0.0\";\n ConfigMap[\"server.port\"] = \"8090\";\n ConfigMap[\"server.logdir\"] = \".\/\";\n ConfigMap[\"server.pingInterval\"] = \"5\";\n ConfigMap[\"server.threadsPerChannel\"] = \"5\";\n ConfigMap[\"server.channelCacheSize\"] = \"500\";\n ConfigMap[\"server.allowUndefinedChannels\"] = \"true\";\n\n ConfigMap[\"amqp.host\"] = \"127.0.0.1\";\n ConfigMap[\"amqp.port\"] = \"5672\";\n ConfigMap[\"amqp.user\"] = \"guest\";\n ConfigMap[\"amqp.password\"] = \"guest\";\n ConfigMap[\"amqp.exchange\"] = \"amq.fanout\";\n\n}\n\n\/**\n Load a config file.\n @param file Filename of config to load. \n*\/\nbool SSEConfig::load(const char *file) {\n boost::property_tree::ptree pt;\n\n try {\n boost::property_tree::read_json(file, pt);\n } catch (...) {\n return false;\n }\n\n \/\/ Populate ConfigMap.\n BOOST_FOREACH(ConfigMap_t::value_type &element, ConfigMap) {\n try {\n string val = pt.get<std::string>(element.first);\n ConfigMap[element.first] = val;\n DLOG(INFO) << element.first << \" = \" << ConfigMap[element.first];\n } catch (...) {}\n }\n\n \/\/ Populate ChannelMap.\n try {\n BOOST_FOREACH(boost::property_tree::ptree::value_type& child, pt.get_child(\"channels\")) {\n try {\n string chName = child.second.get<std::string>(\"path\");\n string allowedOrigins = child.second.get<std::string>(\"allowedOrigins\");\n int historyLength = child.second.get<int>(\"historyLength\");\n\n ChannelMap[chName].allowedOrigins = allowedOrigins;\n ChannelMap[chName].historyLength = historyLength;\n } catch (boost::property_tree::ptree_error &e) {\n LOG(FATAL) << \"Invalid channel definition in config: \" << e.what();\n }\n }\n } catch(...) {\n if (!GetValueBool(\"server.allowUndefinedChannels\")) {\n DLOG(FATAL) << \"Error: No channels defined in config and allowUndefinedChannels is disabled.\";\n }\n }\n\n return true;\n}\n\n\/**\n Fetch a config attribute and return as a string.\n @param key Config attribute to fetch. \n*\/\nconst string &SSEConfig::GetValue(const string& key) {\n return ConfigMap[key];\n}\n\n\/**\n Fetch a config attribute and return as a int.\n @param key Config attribute to fetch. \n*\/\nint SSEConfig::GetValueInt(const string& key) {\n try {\n return boost::lexical_cast<int>(ConfigMap[key]);\n } catch(...) {\n return 0;\n }\n}\n\n\/**\n * Fetch a config attribute and return as a boolean.\n * @param key Config attribute to fetch.\n*\/\nbool SSEConfig::GetValueBool(const string& key) {\n if (ConfigMap[key].compare(\"true\") == 0) return true;\n return false;\n}\n<|endoftext|>"} {"text":"<commit_before><commit_msg>INTEGRATION: CWS hsqldb3 (1.4.20); FILE MERGED 2005\/03\/18 16:54:21 fs 1.4.20.1: #i44127# initialize a newly created DB with OOo's system collation<commit_after><|endoftext|>"} {"text":"<commit_before>#include <cstdint>\n#include <cstring>\n#include \"antenna\/driver.h\"\n#include \"antenna_state.h\"\n#include \"antenna_task.hpp\"\n#include \"gsl\/gsl_util\"\n#include \"logger\/logger.h\"\n#include \"mission\/base.hpp\"\n#include \"mission\/obc.hpp\"\n#include \"system.h\"\n#include \"time\/TimePoint.h\"\n\nusing namespace std::chrono_literals;\n\nnamespace mission\n{\n namespace antenna\n {\n \/**\n * @addtogroup mission_atenna\n * @{\n *\/\n \/**\n * @brief Type definition of the specific deployment step handler.\n *\n * @param[in] state Reference to global satellite state.\n * @param[in] stateDescriptor Reference to deployment process state.\n * @param[in] driver Reference to current antenna driver instance\n *\/\n typedef void DeploymentProcedure(const SystemState& state, \/\/\n AntennaMissionState& stateDescriptor,\n AntennaDriver& driver \/\/\n );\n\n \/**\n * @brief This deployment step performs regular deployment operation.\n *\n * @param[in] state Reference to global satellite state.\n * @param[in] stateDescriptor Reference to the deployment process state object.\n * @param[in] driver Reference to current antenna driver instance.\n *\/\n static void RegularDeploymentStep(const SystemState& state, \/\/\n AntennaMissionState& stateDescriptor,\n AntennaDriver& driver \/\/\n );\n\n \/**\n * @brief This deployment step resets current hardware channel.\n *\n * @param[in] state Reference to global satellite state.\n * @param[in] stateDescriptor Reference to the deployment process state object.\n * @param[in] driver Reference to current antenna driver instance.\n *\/\n static void ResetDriverStep(const SystemState& state, \/\/\n AntennaMissionState& stateDescriptor,\n AntennaDriver& driver \/\/\n );\n\n \/**\n * @brief This deployment step finalizes antenna deployment process.\n *\n * @param[in] state Reference to global satellite state.\n * @param[in] stateDescriptor Reference to the deployment process state object.\n * @param[in] driver Reference to current antenna driver instance.\n *\/\n static void FinishDeploymentStep(const SystemState& state, \/\/\n AntennaMissionState& stateDescriptor,\n AntennaDriver& driver \/\/\n );\n\n \/**\n * @brief Deployment step retry limit.\n *\n * This value controls how many times each deployment step will be repeated\n * in case of errors before process can advance further.\n *\/\n static constexpr std::uint8_t StepRetryLimit = 3;\n\n \/**\n * @brief Hardware operation retry limit.\n *\n * This value controls how many times each hardware operation will be issued\n * in case of errors before declaring it as a failure.\n *\/\n static constexpr std::uint8_t RetryLimit = 3;\n\n \/**\n * @brief Class that describes single deployment step.\n *\n * The entire process is driven by the array of steps, each described by the object of this type.\n *\/\n struct AntennaDeploymentStep final\n {\n \/**\n * @brief Pointer to the procedure the performs current step.\n *\/\n DeploymentProcedure* procedure;\n\n \/**\n * @brief Hardware channel that should be used to perform this step.\n *\/\n AntennaChannel channel;\n\n \/**\n * @brief Identifier of the antenna that should be used\/affected by this step.\n *\/\n AntennaId antennaId;\n\n \/**\n * @brief Antenna deployment process timeout in seconds.\n *\/\n uint8_t deploymentTimeout;\n\n \/**\n * @brief Flag indicating whether hardware deployment switches should be overriden.\n *\/\n bool overrideSwitches;\n };\n\n \/**\n * @brief Default timeout value that should be enough in case there are no problems.\n *\/\n constexpr std::uint8_t DefaultTimeout = 9;\n\n \/**\n * @brief Extended timeout that should take care of the most of the problems.\n *\/\n constexpr std::uint8_t MediumTimeout = 19;\n\n \/**\n * @brief Long timeouts for heating problems.\n *\/\n constexpr std::uint8_t LongTimeout = 39;\n\n \/**\n * @brief Last resort timeout in case everything else fails.\n *\/\n constexpr std::uint8_t EmergencyTimeout = 59;\n\n \/**\n * @brief Array of antenna deployment steps.\n *\n * The entire process is composed of steps that are run in sequence from the beginning. Steps themselves are\n * grouped into series that together form logical variant of the antenna deployment process.\n *\n * Following is the list of the deployment stages that are defined in this array:\n * - Automatic deployment (primary hardware channel)\n * - Manual deployment with overridden deployment switches (primary hardware channel)\n * - Deployment finalization (primary hardware channel)\n *\n * - Automatic deployment (backup hardware channel)\n * - Manual deployment with overridden deployment switches (backup hardware channel)\n * - Deployment finalization (backup hardware channel)\n *\/\n static const AntennaDeploymentStep deploymentSteps[] = {\n {ResetDriverStep, ANTENNA_PRIMARY_CHANNEL, ANTENNA_AUTO_ID, 0, false},\n {RegularDeploymentStep, ANTENNA_PRIMARY_CHANNEL, ANTENNA_AUTO_ID, DefaultTimeout, false},\n {RegularDeploymentStep, ANTENNA_PRIMARY_CHANNEL, ANTENNA1_ID, LongTimeout, true},\n {RegularDeploymentStep, ANTENNA_PRIMARY_CHANNEL, ANTENNA2_ID, LongTimeout, true},\n {RegularDeploymentStep, ANTENNA_PRIMARY_CHANNEL, ANTENNA3_ID, LongTimeout, true},\n {RegularDeploymentStep, ANTENNA_PRIMARY_CHANNEL, ANTENNA4_ID, LongTimeout, true},\n {FinishDeploymentStep, ANTENNA_PRIMARY_CHANNEL, ANTENNA_AUTO_ID, 0, false},\n\n {ResetDriverStep, ANTENNA_BACKUP_CHANNEL, ANTENNA_AUTO_ID, 0, false},\n {RegularDeploymentStep, ANTENNA_BACKUP_CHANNEL, ANTENNA_AUTO_ID, DefaultTimeout, false},\n {RegularDeploymentStep, ANTENNA_BACKUP_CHANNEL, ANTENNA1_ID, LongTimeout, true},\n {RegularDeploymentStep, ANTENNA_BACKUP_CHANNEL, ANTENNA2_ID, LongTimeout, true},\n {RegularDeploymentStep, ANTENNA_BACKUP_CHANNEL, ANTENNA3_ID, LongTimeout, true},\n {RegularDeploymentStep, ANTENNA_BACKUP_CHANNEL, ANTENNA4_ID, LongTimeout, true},\n {FinishDeploymentStep, ANTENNA_BACKUP_CHANNEL, ANTENNA_AUTO_ID, 0, false},\n };\n\n \/**\n * @brief Number of steps in the antenna deployment process.\n *\/\n static constexpr uint8_t DeploymentStepLimit = count_of(deploymentSteps);\n\n AntennaMissionState::AntennaMissionState(AntennaDriver& antennaDriver)\n : _overrideState(false), \/\/\n _inProgress(false), \/\/\n _stepNumber(0), \/\/\n _retryCount(0), \/\/\n _driver(antennaDriver)\n {\n }\n\n void AntennaMissionState::Retry(std::uint8_t limit)\n {\n if ((this->_retryCount + 1) == limit)\n {\n NextStep();\n }\n else\n {\n ++this->_retryCount;\n }\n }\n\n bool AntennaMissionState::IsFinished() const\n {\n return this->_stepNumber >= DeploymentStepLimit;\n }\n\n void AntennaMissionState::Update(const AntennaDeploymentStatus& status)\n {\n this->_inProgress = status.IsDeploymentActive[0] | \/\/\n status.IsDeploymentActive[1] | \/\/\n status.IsDeploymentActive[2] | \/\/\n status.IsDeploymentActive[3];\n }\n\n std::uint8_t AntennaMissionState::StepCount()\n {\n return DeploymentStepLimit;\n }\n\n \/**\n * @brief This procedure is supposed to stop any deployment process that may currently be active on the\n * passed hardware channel.\n *\n * @param[in] driver Reference to current antenna driver instance.\n * @param[in] channel Hardware channel that should be used for current operation.\n * @param[in] retryCount Number of step retry attempts in case of errors.\n * @return True if operation has been successfully completed, false otherwise.\n *\/\n static bool EndDeployment(AntennaDriver& driver, AntennaChannel channel, std::uint8_t retryCount)\n {\n while (retryCount-- > 0)\n {\n const OSResult status = driver.FinishDeployment(&driver, channel);\n if (OS_RESULT_SUCCEEDED(status))\n {\n return true;\n }\n }\n\n return false;\n }\n\n \/**\n * @brief This procedure is supposed to stop any deployment process that may currently be active on the\n * hardware channel used in the previous step.\n *\n * @param[in] state Reference to global satellite state.\n * @param[in] stateDescriptor Reference to the deployment process state object.\n * @param[in] driver Reference to current antenna driver instance.\n *\/\n static void StopDeployment(const SystemState& state,\n AntennaMissionState& stateDescriptor,\n AntennaDriver& driver \/\/\n )\n {\n UNREFERENCED_PARAMETER(state);\n if (stateDescriptor.StepNumber() == 0)\n {\n return;\n }\n\n const AntennaDeploymentStep& step = deploymentSteps[stateDescriptor.StepNumber() - 1];\n EndDeployment(driver, step.channel, RetryLimit);\n }\n\n \/**\n * @brief This procedure is supposed to start deployment process described by the current step.\n *\n * @param[in] state Reference to global satellite state.\n * @param[in] stateDescriptor Reference to the deployment process state object.\n * @param[in] driver Reference to current antenna driver instance.\n *\/\n static void BeginDeployment(const SystemState& state,\n AntennaMissionState& stateDescriptor,\n AntennaDriver& driver \/\/\n )\n {\n UNREFERENCED_PARAMETER(state);\n const AntennaDeploymentStep& step = deploymentSteps[stateDescriptor.StepNumber()];\n std::uint8_t counter = RetryLimit;\n while (counter-- > 0)\n {\n const OSResult result = driver.DeployAntenna(&driver,\n step.channel,\n step.antennaId,\n std::chrono::seconds(step.deploymentTimeout),\n step.overrideSwitches \/\/\n );\n\n if (OS_RESULT_SUCCEEDED(result))\n {\n stateDescriptor.NextStep();\n return;\n }\n }\n\n stateDescriptor.Retry(StepRetryLimit);\n }\n\n void RegularDeploymentStep(const SystemState& state,\n AntennaMissionState& stateDescriptor,\n AntennaDriver& driver \/\/\n )\n {\n const AntennaDeploymentStep& step = deploymentSteps[stateDescriptor.StepNumber()];\n\n LOGF(LOG_LEVEL_INFO,\n \"[ant] [Step%d] Regular deployment (channel %d, antenna %d)\",\n stateDescriptor.StepNumber(),\n step.channel,\n step.antennaId);\n\n StopDeployment(state, stateDescriptor, driver);\n BeginDeployment(state, stateDescriptor, driver);\n }\n\n void ResetDriverStep(const SystemState& state,\n AntennaMissionState& stateDescriptor,\n AntennaDriver& driver \/\/\n )\n {\n UNREFERENCED_PARAMETER(state);\n const AntennaDeploymentStep& step = deploymentSteps[stateDescriptor.StepNumber()];\n\n LOGF(LOG_LEVEL_INFO, \"[ant] [Step%d] Reseting driver %d\", stateDescriptor.StepNumber(), step.channel);\n\n std::uint8_t counter = RetryLimit;\n while (counter-- > 0)\n {\n const OSResult result = driver.Reset(&driver, step.channel);\n if (OS_RESULT_SUCCEEDED(result))\n {\n stateDescriptor.NextStep();\n return;\n }\n }\n\n stateDescriptor.Retry(StepRetryLimit);\n }\n\n void FinishDeploymentStep(const SystemState& state,\n AntennaMissionState& stateDescriptor,\n AntennaDriver& driver \/\/\n )\n {\n UNREFERENCED_PARAMETER(state);\n const AntennaDeploymentStep& step = deploymentSteps[stateDescriptor.StepNumber()];\n\n LOGF(LOG_LEVEL_INFO, \"[ant] [Step%d] Finish deployment %d\", stateDescriptor.StepNumber(), step.channel);\n\n if (EndDeployment(driver, step.channel, RetryLimit))\n {\n stateDescriptor.NextStep();\n }\n else\n {\n stateDescriptor.Retry(StepRetryLimit);\n }\n }\n\n \/**\n * @brief This procedure is deployment action entry point.\n *\n * This procedure runs the antenna deployment process.\n * @param[in] state Pointer to global satellite state.\n * @param[in] param Pointer to the deployment condition private context. This pointer should point\n * at the object of AntennaMissionState type.\n *\/\n static void AntennaDeploymentAction(SystemState& state, void* param)\n {\n auto stateDescriptor = static_cast<AntennaMissionState*>(param);\n\n LOGF(LOG_LEVEL_DEBUG, \"[ant] Executing antenna deployment step %d\", stateDescriptor->StepNumber());\n\n if (state.PersistentState.Get<state::AntennaConfiguration>().IsDeploymentDisabled())\n {\n LOG(LOG_LEVEL_DEBUG, \"[ant] Antenna deployment disabled\");\n stateDescriptor->Finish();\n }\n else\n {\n const AntennaDeploymentStep& step = deploymentSteps[stateDescriptor->StepNumber()];\n DeploymentProcedure* procedure = step.procedure;\n procedure(state, *stateDescriptor, stateDescriptor->Driver());\n }\n }\n\n \/**\n * @brief Procedure that verifies whether the antenna deployment process should be executed.\n * @param[in] state Pointer to global satellite state.\n * @param[in] param Pointer to the deployment condition private context. This pointer should point\n * at the object of AntennaMissionState type.\n *\n * @return True if the deployment action should be performed, false otherwise.\n *\/\n static bool AntennaDeploymentCondition(const SystemState& state, void* param)\n {\n AntennaMissionState* stateDescriptor = (AntennaMissionState*)param;\n if (!IsInitialSilentPeriodFinished(state.Time))\n {\n return false;\n }\n\n if (stateDescriptor->IsDeploymentInProgress())\n {\n return false;\n }\n\n return !stateDescriptor->IsFinished();\n }\n\n \/**\n * @brief This procedure is antenna deployment update descriptor entry point.\n *\n * This procedure updates the global satellite state as well as deployemnt process private state.\n * @param[in] state Pointer to global satellite state.\n * @param[in] param Pointer to the deployment condition private context. This pointer should point\n * at the object of AntennaMissionState type.\n * @return Operation status.\n *\/\n static UpdateResult AntennaDeploymentUpdate(SystemState& state, void* param)\n {\n UNREFERENCED_PARAMETER(state);\n AntennaMissionState* stateDescriptor = (AntennaMissionState*)param;\n state.AntennaState.SetDeployment(stateDescriptor->IsFinished());\n if (stateDescriptor->IsFinished())\n {\n return UpdateResult::Ok;\n }\n\n AntennaDeploymentStatus deploymentStatus;\n AntennaDriver& driver = stateDescriptor->Driver();\n const OSResult result = driver.GetDeploymentStatus(&driver,\n deploymentSteps[stateDescriptor->StepNumber()].channel,\n &deploymentStatus \/\/\n );\n\n if (OS_RESULT_FAILED(result))\n {\n return UpdateResult::Failure;\n }\n\n stateDescriptor->Update(deploymentStatus);\n return UpdateResult::Ok;\n }\n\n AntennaTask::AntennaTask(AntennaDriver& driver) : state(driver)\n {\n }\n\n ActionDescriptor<SystemState> AntennaTask::BuildAction()\n {\n ActionDescriptor<SystemState> descriptor;\n descriptor.name = \"Deploy Antenna Action\";\n descriptor.param = &this->state;\n descriptor.condition = AntennaDeploymentCondition;\n descriptor.actionProc = AntennaDeploymentAction;\n return descriptor;\n }\n\n UpdateDescriptor<SystemState> AntennaTask::BuildUpdate()\n {\n UpdateDescriptor<SystemState> descriptor;\n descriptor.name = \"Deploy Antenna Update\";\n descriptor.param = &this->state;\n descriptor.updateProc = AntennaDeploymentUpdate;\n return descriptor;\n }\n\n StopAntennaDeploymentTask::StopAntennaDeploymentTask(std::uint8_t \/*mark*\/)\n {\n }\n mission::ActionDescriptor<SystemState> StopAntennaDeploymentTask::BuildAction()\n {\n mission::ActionDescriptor<SystemState> action;\n action.name = \"Stop antenna deployment\";\n action.param = this;\n action.condition = Condition;\n action.actionProc = Action;\n return action;\n }\n\n void StopAntennaDeploymentTask::DisableDeployment()\n {\n this->_shouldDisable = true;\n }\n\n bool StopAntennaDeploymentTask::Condition(const SystemState& state, void* param)\n {\n auto This = reinterpret_cast<StopAntennaDeploymentTask*>(param);\n auto alreadyDisabled = state.PersistentState.Get<state::AntennaConfiguration>().IsDeploymentDisabled();\n\n return This->_shouldDisable && !alreadyDisabled && state.AntennaState.IsDeployed();\n }\n\n void StopAntennaDeploymentTask::Action(SystemState& state, void*)\n {\n LOG(LOG_LEVEL_INFO, \"[ant] Disabling antenna deployment\");\n\n state.PersistentState.Set(state::AntennaConfiguration(true));\n }\n\n \/** @}*\/\n }\n}\n<commit_msg>Do not abort mission loop on antenna NACK<commit_after>#include <cstdint>\n#include <cstring>\n#include \"antenna\/driver.h\"\n#include \"antenna_state.h\"\n#include \"antenna_task.hpp\"\n#include \"gsl\/gsl_util\"\n#include \"logger\/logger.h\"\n#include \"mission\/base.hpp\"\n#include \"mission\/obc.hpp\"\n#include \"system.h\"\n#include \"time\/TimePoint.h\"\n\nusing namespace std::chrono_literals;\n\nnamespace mission\n{\n namespace antenna\n {\n \/**\n * @addtogroup mission_atenna\n * @{\n *\/\n \/**\n * @brief Type definition of the specific deployment step handler.\n *\n * @param[in] state Reference to global satellite state.\n * @param[in] stateDescriptor Reference to deployment process state.\n * @param[in] driver Reference to current antenna driver instance\n *\/\n typedef void DeploymentProcedure(const SystemState& state, \/\/\n AntennaMissionState& stateDescriptor,\n AntennaDriver& driver \/\/\n );\n\n \/**\n * @brief This deployment step performs regular deployment operation.\n *\n * @param[in] state Reference to global satellite state.\n * @param[in] stateDescriptor Reference to the deployment process state object.\n * @param[in] driver Reference to current antenna driver instance.\n *\/\n static void RegularDeploymentStep(const SystemState& state, \/\/\n AntennaMissionState& stateDescriptor,\n AntennaDriver& driver \/\/\n );\n\n \/**\n * @brief This deployment step resets current hardware channel.\n *\n * @param[in] state Reference to global satellite state.\n * @param[in] stateDescriptor Reference to the deployment process state object.\n * @param[in] driver Reference to current antenna driver instance.\n *\/\n static void ResetDriverStep(const SystemState& state, \/\/\n AntennaMissionState& stateDescriptor,\n AntennaDriver& driver \/\/\n );\n\n \/**\n * @brief This deployment step finalizes antenna deployment process.\n *\n * @param[in] state Reference to global satellite state.\n * @param[in] stateDescriptor Reference to the deployment process state object.\n * @param[in] driver Reference to current antenna driver instance.\n *\/\n static void FinishDeploymentStep(const SystemState& state, \/\/\n AntennaMissionState& stateDescriptor,\n AntennaDriver& driver \/\/\n );\n\n \/**\n * @brief Deployment step retry limit.\n *\n * This value controls how many times each deployment step will be repeated\n * in case of errors before process can advance further.\n *\/\n static constexpr std::uint8_t StepRetryLimit = 3;\n\n \/**\n * @brief Hardware operation retry limit.\n *\n * This value controls how many times each hardware operation will be issued\n * in case of errors before declaring it as a failure.\n *\/\n static constexpr std::uint8_t RetryLimit = 3;\n\n \/**\n * @brief Class that describes single deployment step.\n *\n * The entire process is driven by the array of steps, each described by the object of this type.\n *\/\n struct AntennaDeploymentStep final\n {\n \/**\n * @brief Pointer to the procedure the performs current step.\n *\/\n DeploymentProcedure* procedure;\n\n \/**\n * @brief Hardware channel that should be used to perform this step.\n *\/\n AntennaChannel channel;\n\n \/**\n * @brief Identifier of the antenna that should be used\/affected by this step.\n *\/\n AntennaId antennaId;\n\n \/**\n * @brief Antenna deployment process timeout in seconds.\n *\/\n uint8_t deploymentTimeout;\n\n \/**\n * @brief Flag indicating whether hardware deployment switches should be overriden.\n *\/\n bool overrideSwitches;\n };\n\n \/**\n * @brief Default timeout value that should be enough in case there are no problems.\n *\/\n constexpr std::uint8_t DefaultTimeout = 9;\n\n \/**\n * @brief Extended timeout that should take care of the most of the problems.\n *\/\n constexpr std::uint8_t MediumTimeout = 19;\n\n \/**\n * @brief Long timeouts for heating problems.\n *\/\n constexpr std::uint8_t LongTimeout = 39;\n\n \/**\n * @brief Last resort timeout in case everything else fails.\n *\/\n constexpr std::uint8_t EmergencyTimeout = 59;\n\n \/**\n * @brief Array of antenna deployment steps.\n *\n * The entire process is composed of steps that are run in sequence from the beginning. Steps themselves are\n * grouped into series that together form logical variant of the antenna deployment process.\n *\n * Following is the list of the deployment stages that are defined in this array:\n * - Automatic deployment (primary hardware channel)\n * - Manual deployment with overridden deployment switches (primary hardware channel)\n * - Deployment finalization (primary hardware channel)\n *\n * - Automatic deployment (backup hardware channel)\n * - Manual deployment with overridden deployment switches (backup hardware channel)\n * - Deployment finalization (backup hardware channel)\n *\/\n static const AntennaDeploymentStep deploymentSteps[] = {\n {ResetDriverStep, ANTENNA_PRIMARY_CHANNEL, ANTENNA_AUTO_ID, 0, false},\n {RegularDeploymentStep, ANTENNA_PRIMARY_CHANNEL, ANTENNA_AUTO_ID, DefaultTimeout, false},\n {RegularDeploymentStep, ANTENNA_PRIMARY_CHANNEL, ANTENNA1_ID, LongTimeout, true},\n {RegularDeploymentStep, ANTENNA_PRIMARY_CHANNEL, ANTENNA2_ID, LongTimeout, true},\n {RegularDeploymentStep, ANTENNA_PRIMARY_CHANNEL, ANTENNA3_ID, LongTimeout, true},\n {RegularDeploymentStep, ANTENNA_PRIMARY_CHANNEL, ANTENNA4_ID, LongTimeout, true},\n {FinishDeploymentStep, ANTENNA_PRIMARY_CHANNEL, ANTENNA_AUTO_ID, 0, false},\n\n {ResetDriverStep, ANTENNA_BACKUP_CHANNEL, ANTENNA_AUTO_ID, 0, false},\n {RegularDeploymentStep, ANTENNA_BACKUP_CHANNEL, ANTENNA_AUTO_ID, DefaultTimeout, false},\n {RegularDeploymentStep, ANTENNA_BACKUP_CHANNEL, ANTENNA1_ID, LongTimeout, true},\n {RegularDeploymentStep, ANTENNA_BACKUP_CHANNEL, ANTENNA2_ID, LongTimeout, true},\n {RegularDeploymentStep, ANTENNA_BACKUP_CHANNEL, ANTENNA3_ID, LongTimeout, true},\n {RegularDeploymentStep, ANTENNA_BACKUP_CHANNEL, ANTENNA4_ID, LongTimeout, true},\n {FinishDeploymentStep, ANTENNA_BACKUP_CHANNEL, ANTENNA_AUTO_ID, 0, false},\n };\n\n \/**\n * @brief Number of steps in the antenna deployment process.\n *\/\n static constexpr uint8_t DeploymentStepLimit = count_of(deploymentSteps);\n\n AntennaMissionState::AntennaMissionState(AntennaDriver& antennaDriver)\n : _overrideState(false), \/\/\n _inProgress(false), \/\/\n _stepNumber(0), \/\/\n _retryCount(0), \/\/\n _driver(antennaDriver)\n {\n }\n\n void AntennaMissionState::Retry(std::uint8_t limit)\n {\n if ((this->_retryCount + 1) == limit)\n {\n NextStep();\n }\n else\n {\n ++this->_retryCount;\n }\n }\n\n bool AntennaMissionState::IsFinished() const\n {\n return this->_stepNumber >= DeploymentStepLimit;\n }\n\n void AntennaMissionState::Update(const AntennaDeploymentStatus& status)\n {\n this->_inProgress = status.IsDeploymentActive[0] | \/\/\n status.IsDeploymentActive[1] | \/\/\n status.IsDeploymentActive[2] | \/\/\n status.IsDeploymentActive[3];\n }\n\n std::uint8_t AntennaMissionState::StepCount()\n {\n return DeploymentStepLimit;\n }\n\n \/**\n * @brief This procedure is supposed to stop any deployment process that may currently be active on the\n * passed hardware channel.\n *\n * @param[in] driver Reference to current antenna driver instance.\n * @param[in] channel Hardware channel that should be used for current operation.\n * @param[in] retryCount Number of step retry attempts in case of errors.\n * @return True if operation has been successfully completed, false otherwise.\n *\/\n static bool EndDeployment(AntennaDriver& driver, AntennaChannel channel, std::uint8_t retryCount)\n {\n while (retryCount-- > 0)\n {\n const OSResult status = driver.FinishDeployment(&driver, channel);\n if (OS_RESULT_SUCCEEDED(status))\n {\n return true;\n }\n }\n\n return false;\n }\n\n \/**\n * @brief This procedure is supposed to stop any deployment process that may currently be active on the\n * hardware channel used in the previous step.\n *\n * @param[in] state Reference to global satellite state.\n * @param[in] stateDescriptor Reference to the deployment process state object.\n * @param[in] driver Reference to current antenna driver instance.\n *\/\n static void StopDeployment(const SystemState& state,\n AntennaMissionState& stateDescriptor,\n AntennaDriver& driver \/\/\n )\n {\n UNREFERENCED_PARAMETER(state);\n if (stateDescriptor.StepNumber() == 0)\n {\n return;\n }\n\n const AntennaDeploymentStep& step = deploymentSteps[stateDescriptor.StepNumber() - 1];\n EndDeployment(driver, step.channel, RetryLimit);\n }\n\n \/**\n * @brief This procedure is supposed to start deployment process described by the current step.\n *\n * @param[in] state Reference to global satellite state.\n * @param[in] stateDescriptor Reference to the deployment process state object.\n * @param[in] driver Reference to current antenna driver instance.\n *\/\n static void BeginDeployment(const SystemState& state,\n AntennaMissionState& stateDescriptor,\n AntennaDriver& driver \/\/\n )\n {\n UNREFERENCED_PARAMETER(state);\n const AntennaDeploymentStep& step = deploymentSteps[stateDescriptor.StepNumber()];\n std::uint8_t counter = RetryLimit;\n while (counter-- > 0)\n {\n const OSResult result = driver.DeployAntenna(&driver,\n step.channel,\n step.antennaId,\n std::chrono::seconds(step.deploymentTimeout),\n step.overrideSwitches \/\/\n );\n\n if (OS_RESULT_SUCCEEDED(result))\n {\n stateDescriptor.NextStep();\n return;\n }\n }\n\n stateDescriptor.Retry(StepRetryLimit);\n }\n\n void RegularDeploymentStep(const SystemState& state,\n AntennaMissionState& stateDescriptor,\n AntennaDriver& driver \/\/\n )\n {\n const AntennaDeploymentStep& step = deploymentSteps[stateDescriptor.StepNumber()];\n\n LOGF(LOG_LEVEL_INFO,\n \"[ant] [Step%d] Regular deployment (channel %d, antenna %d)\",\n stateDescriptor.StepNumber(),\n step.channel,\n step.antennaId);\n\n StopDeployment(state, stateDescriptor, driver);\n BeginDeployment(state, stateDescriptor, driver);\n }\n\n void ResetDriverStep(const SystemState& state,\n AntennaMissionState& stateDescriptor,\n AntennaDriver& driver \/\/\n )\n {\n UNREFERENCED_PARAMETER(state);\n const AntennaDeploymentStep& step = deploymentSteps[stateDescriptor.StepNumber()];\n\n LOGF(LOG_LEVEL_INFO, \"[ant] [Step%d] Reseting driver %d\", stateDescriptor.StepNumber(), step.channel);\n\n std::uint8_t counter = RetryLimit;\n while (counter-- > 0)\n {\n const OSResult result = driver.Reset(&driver, step.channel);\n if (OS_RESULT_SUCCEEDED(result))\n {\n stateDescriptor.NextStep();\n return;\n }\n }\n\n stateDescriptor.Retry(StepRetryLimit);\n }\n\n void FinishDeploymentStep(const SystemState& state,\n AntennaMissionState& stateDescriptor,\n AntennaDriver& driver \/\/\n )\n {\n UNREFERENCED_PARAMETER(state);\n const AntennaDeploymentStep& step = deploymentSteps[stateDescriptor.StepNumber()];\n\n LOGF(LOG_LEVEL_INFO, \"[ant] [Step%d] Finish deployment %d\", stateDescriptor.StepNumber(), step.channel);\n\n if (EndDeployment(driver, step.channel, RetryLimit))\n {\n stateDescriptor.NextStep();\n }\n else\n {\n stateDescriptor.Retry(StepRetryLimit);\n }\n }\n\n \/**\n * @brief This procedure is deployment action entry point.\n *\n * This procedure runs the antenna deployment process.\n * @param[in] state Pointer to global satellite state.\n * @param[in] param Pointer to the deployment condition private context. This pointer should point\n * at the object of AntennaMissionState type.\n *\/\n static void AntennaDeploymentAction(SystemState& state, void* param)\n {\n auto stateDescriptor = static_cast<AntennaMissionState*>(param);\n\n LOGF(LOG_LEVEL_DEBUG, \"[ant] Executing antenna deployment step %d\", stateDescriptor->StepNumber());\n\n if (state.PersistentState.Get<state::AntennaConfiguration>().IsDeploymentDisabled())\n {\n LOG(LOG_LEVEL_DEBUG, \"[ant] Antenna deployment disabled\");\n stateDescriptor->Finish();\n }\n else\n {\n const AntennaDeploymentStep& step = deploymentSteps[stateDescriptor->StepNumber()];\n DeploymentProcedure* procedure = step.procedure;\n procedure(state, *stateDescriptor, stateDescriptor->Driver());\n }\n }\n\n \/**\n * @brief Procedure that verifies whether the antenna deployment process should be executed.\n * @param[in] state Pointer to global satellite state.\n * @param[in] param Pointer to the deployment condition private context. This pointer should point\n * at the object of AntennaMissionState type.\n *\n * @return True if the deployment action should be performed, false otherwise.\n *\/\n static bool AntennaDeploymentCondition(const SystemState& state, void* param)\n {\n AntennaMissionState* stateDescriptor = (AntennaMissionState*)param;\n if (!IsInitialSilentPeriodFinished(state.Time))\n {\n return false;\n }\n\n if (stateDescriptor->IsDeploymentInProgress())\n {\n return false;\n }\n\n return !stateDescriptor->IsFinished();\n }\n\n \/**\n * @brief This procedure is antenna deployment update descriptor entry point.\n *\n * This procedure updates the global satellite state as well as deployemnt process private state.\n * @param[in] state Pointer to global satellite state.\n * @param[in] param Pointer to the deployment condition private context. This pointer should point\n * at the object of AntennaMissionState type.\n * @return Operation status.\n *\/\n static UpdateResult AntennaDeploymentUpdate(SystemState& state, void* param)\n {\n UNREFERENCED_PARAMETER(state);\n AntennaMissionState* stateDescriptor = (AntennaMissionState*)param;\n state.AntennaState.SetDeployment(stateDescriptor->IsFinished());\n if (stateDescriptor->IsFinished())\n {\n return UpdateResult::Ok;\n }\n\n AntennaDeploymentStatus deploymentStatus;\n AntennaDriver& driver = stateDescriptor->Driver();\n const OSResult result = driver.GetDeploymentStatus(&driver,\n deploymentSteps[stateDescriptor->StepNumber()].channel,\n &deploymentStatus \/\/\n );\n\n if (OS_RESULT_FAILED(result))\n {\n return UpdateResult::Warning;\n }\n\n stateDescriptor->Update(deploymentStatus);\n return UpdateResult::Ok;\n }\n\n AntennaTask::AntennaTask(AntennaDriver& driver) : state(driver)\n {\n }\n\n ActionDescriptor<SystemState> AntennaTask::BuildAction()\n {\n ActionDescriptor<SystemState> descriptor;\n descriptor.name = \"Deploy Antenna Action\";\n descriptor.param = &this->state;\n descriptor.condition = AntennaDeploymentCondition;\n descriptor.actionProc = AntennaDeploymentAction;\n return descriptor;\n }\n\n UpdateDescriptor<SystemState> AntennaTask::BuildUpdate()\n {\n UpdateDescriptor<SystemState> descriptor;\n descriptor.name = \"Deploy Antenna Update\";\n descriptor.param = &this->state;\n descriptor.updateProc = AntennaDeploymentUpdate;\n return descriptor;\n }\n\n StopAntennaDeploymentTask::StopAntennaDeploymentTask(std::uint8_t \/*mark*\/)\n {\n }\n mission::ActionDescriptor<SystemState> StopAntennaDeploymentTask::BuildAction()\n {\n mission::ActionDescriptor<SystemState> action;\n action.name = \"Stop antenna deployment\";\n action.param = this;\n action.condition = Condition;\n action.actionProc = Action;\n return action;\n }\n\n void StopAntennaDeploymentTask::DisableDeployment()\n {\n this->_shouldDisable = true;\n }\n\n bool StopAntennaDeploymentTask::Condition(const SystemState& state, void* param)\n {\n auto This = reinterpret_cast<StopAntennaDeploymentTask*>(param);\n auto alreadyDisabled = state.PersistentState.Get<state::AntennaConfiguration>().IsDeploymentDisabled();\n\n return This->_shouldDisable && !alreadyDisabled && state.AntennaState.IsDeployed();\n }\n\n void StopAntennaDeploymentTask::Action(SystemState& state, void*)\n {\n LOG(LOG_LEVEL_INFO, \"[ant] Disabling antenna deployment\");\n\n state.PersistentState.Set(state::AntennaConfiguration(true));\n }\n\n \/** @}*\/\n }\n}\n<|endoftext|>"} {"text":"<commit_before>\/*************************************************************************\n *\n * $RCSfile: convdicxml.hxx,v $\n *\n * $Revision: 1.2 $\n *\n * last change: $Author: obo $ $Date: 2004-04-27 16:06: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 _LINGUISTIC_CONVDICXML_HXX_\n#define _LINGUISTIC_CONVDICXML_HXX_\n\n#ifndef _COM_SUN_STAR_LINGUISTIC2_XCONVERSIONDICTIONARY_HPP_\n#include <com\/sun\/star\/linguistic2\/XConversionDictionary.hpp>\n#endif\n#ifndef _COM_SUN_STAR_UTIL_XFLUSHABLE_HPP_\n#include <com\/sun\/star\/util\/XFlushable.hpp>\n#endif\n#ifndef _COM_SUN_STAR_LANG_XSERVICEINFO_HPP_\n#include <com\/sun\/star\/lang\/XServiceInfo.hpp>\n#endif\n#ifndef _COM_SUN_STAR_XML_SAX_XDOCUMENTHANDLER_HPP_\n#include <com\/sun\/star\/xml\/sax\/XDocumentHandler.hpp>\n#endif\n#ifndef _XMLOFF_XMLEXP_HXX\n#include <xmloff\/xmlexp.hxx>\n#endif\n#ifndef _XMLOFF_XMLIMP_HXX\n#include <xmloff\/xmlimp.hxx>\n#endif\n\n#ifndef _CPPUHELPER_IMPLBASE3_HXX_\n#include <cppuhelper\/implbase3.hxx>\n#endif\n#ifndef _CPPUHELPER_INTERFACECONTAINER_H_\n#include <cppuhelper\/interfacecontainer.h>\n#endif\n\n#ifndef _STRING_HXX\n#include <tools\/string.hxx>\n#endif\n#ifndef _RTL_USTRING_HXX_\n#include <rtl\/ustring.hxx>\n#endif\n\n#ifndef _LINGUISTIC_MISC_HXX_\n#include \"misc.hxx\"\n#endif\n#ifndef _LINGUISTIC_DEFS_HXX_\n#include \"defs.hxx\"\n#endif\n\n\nclass ConvDic;\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nclass ConvDicXMLExport : public SvXMLExport\n{\n ConvDic &rDic;\n sal_Bool bSuccess;\n\nprotected:\n \/\/void ExportNodes(const SmNode *pIn, int nLevel);\n\npublic:\n ConvDicXMLExport( ConvDic &rConvDic,\n const rtl::OUString &rFileName,\n com::sun::star::uno::Reference< com::sun::star::xml::sax::XDocumentHandler > &rHandler) :\n SvXMLExport ( rFileName, rHandler ),\n rDic ( rConvDic ),\n bSuccess ( sal_False )\n {\n }\n virtual ~ConvDicXMLExport()\n {\n }\n\n \/\/ XServiceInfo (override parent method)\n ::rtl::OUString SAL_CALL getImplementationName() throw( ::com::sun::star::uno::RuntimeException );\n\n \/\/ SvXMLExport\n void _ExportAutoStyles() {}\n void _ExportMasterStyles() {}\n void _ExportContent();\n sal_uInt32 exportDoc( enum ::xmloff::token::XMLTokenEnum eClass );\n\n sal_Bool Export( SfxMedium &rMedium );\n};\n\n\nclass ConvDicXMLImport : public SvXMLImport\n{\n ConvDic *pDic; \/\/ conversion dictionary to be used\n \/\/ if != NULL: whole file will be read and\n \/\/ all entries will be added to the dictionary\n \/\/ if == NULL: no entries will be added\n \/\/ but the language and conversion type will\n \/\/ still be determined!\n\n INT16 nLanguage; \/\/ language of the dictionary\n sal_Int16 nConversionType; \/\/ conversion type the dictionary is used for\n sal_Bool bSuccess;\n\npublic:\n\n \/\/!! see comment for pDic member\n ConvDicXMLImport( ConvDic *pConvDic, const rtl::OUString &rFileName ) :\n SvXMLImport ( IMPORT_ALL ),\n pDic ( pConvDic )\n {\n nLanguage = LANGUAGE_NONE;\n nConversionType = -1;\n bSuccess = sal_False;\n }\n\n virtual ~ConvDicXMLImport() throw ()\n {\n }\n\n \/\/ XServiceInfo (override parent method)\n ::rtl::OUString SAL_CALL getImplementationName() throw( ::com::sun::star::uno::RuntimeException );\n\n virtual void SAL_CALL startDocument(void) throw( ::com::sun::star::xml::sax::SAXException, ::com::sun::star::uno::RuntimeException );\n virtual void SAL_CALL endDocument(void) throw( ::com::sun::star::xml::sax::SAXException, ::com::sun::star::uno::RuntimeException );\n\n virtual SvXMLImportContext * CreateContext(\n sal_uInt16 nPrefix, const rtl::OUString &rLocalName,\n const com::sun::star::uno::Reference < com::sun::star::xml::sax::XAttributeList > &rxAttrList );\n\n ConvDic * GetDic() { return pDic; }\n INT16 GetLanguage() const { return nLanguage; }\n sal_Int16 GetConversionType() const { return nConversionType; }\n sal_Bool GetSuccess() const { return bSuccess; }\n\n void SetLanguage( INT16 nLang ) { nLanguage = nLang; }\n void SetConversionType( sal_Int16 nType ) { nConversionType = nType; }\n};\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n#endif\n\n<commit_msg>#110680#, #i10000#: Constructor of SvXMLExport \/ SvXMLImport now needs a getProcessServiceFactory() as first parameter.<commit_after>\/*************************************************************************\n *\n * $RCSfile: convdicxml.hxx,v $\n *\n * $Revision: 1.3 $\n *\n * last change: $Author: rt $ $Date: 2004-05-04 10:45: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 _LINGUISTIC_CONVDICXML_HXX_\n#define _LINGUISTIC_CONVDICXML_HXX_\n\n#ifndef _COM_SUN_STAR_LINGUISTIC2_XCONVERSIONDICTIONARY_HPP_\n#include <com\/sun\/star\/linguistic2\/XConversionDictionary.hpp>\n#endif\n#ifndef _COM_SUN_STAR_UTIL_XFLUSHABLE_HPP_\n#include <com\/sun\/star\/util\/XFlushable.hpp>\n#endif\n#ifndef _COM_SUN_STAR_LANG_XSERVICEINFO_HPP_\n#include <com\/sun\/star\/lang\/XServiceInfo.hpp>\n#endif\n#ifndef _COM_SUN_STAR_XML_SAX_XDOCUMENTHANDLER_HPP_\n#include <com\/sun\/star\/xml\/sax\/XDocumentHandler.hpp>\n#endif\n#ifndef _XMLOFF_XMLEXP_HXX\n#include <xmloff\/xmlexp.hxx>\n#endif\n#ifndef _XMLOFF_XMLIMP_HXX\n#include <xmloff\/xmlimp.hxx>\n#endif\n\n#ifndef _CPPUHELPER_IMPLBASE3_HXX_\n#include <cppuhelper\/implbase3.hxx>\n#endif\n#ifndef _CPPUHELPER_INTERFACECONTAINER_H_\n#include <cppuhelper\/interfacecontainer.h>\n#endif\n\n#ifndef _STRING_HXX\n#include <tools\/string.hxx>\n#endif\n#ifndef _RTL_USTRING_HXX_\n#include <rtl\/ustring.hxx>\n#endif\n\n#ifndef _LINGUISTIC_MISC_HXX_\n#include \"misc.hxx\"\n#endif\n#ifndef _LINGUISTIC_DEFS_HXX_\n#include \"defs.hxx\"\n#endif\n\n\nclass ConvDic;\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nclass ConvDicXMLExport : public SvXMLExport\n{\n ConvDic &rDic;\n sal_Bool bSuccess;\n\nprotected:\n \/\/void ExportNodes(const SmNode *pIn, int nLevel);\n\npublic:\n ConvDicXMLExport( ConvDic &rConvDic,\n const rtl::OUString &rFileName,\n com::sun::star::uno::Reference< com::sun::star::xml::sax::XDocumentHandler > &rHandler) :\n SvXMLExport ( utl::getProcessServiceFactory(), rFileName, rHandler ),\n rDic ( rConvDic ),\n bSuccess ( sal_False )\n {\n }\n virtual ~ConvDicXMLExport()\n {\n }\n\n \/\/ XServiceInfo (override parent method)\n ::rtl::OUString SAL_CALL getImplementationName() throw( ::com::sun::star::uno::RuntimeException );\n\n \/\/ SvXMLExport\n void _ExportAutoStyles() {}\n void _ExportMasterStyles() {}\n void _ExportContent();\n sal_uInt32 exportDoc( enum ::xmloff::token::XMLTokenEnum eClass );\n\n sal_Bool Export( SfxMedium &rMedium );\n};\n\n\nclass ConvDicXMLImport : public SvXMLImport\n{\n ConvDic *pDic; \/\/ conversion dictionary to be used\n \/\/ if != NULL: whole file will be read and\n \/\/ all entries will be added to the dictionary\n \/\/ if == NULL: no entries will be added\n \/\/ but the language and conversion type will\n \/\/ still be determined!\n\n INT16 nLanguage; \/\/ language of the dictionary\n sal_Int16 nConversionType; \/\/ conversion type the dictionary is used for\n sal_Bool bSuccess;\n\npublic:\n\n \/\/!! see comment for pDic member\n ConvDicXMLImport( ConvDic *pConvDic, const rtl::OUString &rFileName ) :\n SvXMLImport ( utl::getProcessServiceFactory(), IMPORT_ALL ),\n pDic ( pConvDic )\n {\n nLanguage = LANGUAGE_NONE;\n nConversionType = -1;\n bSuccess = sal_False;\n }\n\n virtual ~ConvDicXMLImport() throw ()\n {\n }\n\n \/\/ XServiceInfo (override parent method)\n ::rtl::OUString SAL_CALL getImplementationName() throw( ::com::sun::star::uno::RuntimeException );\n\n virtual void SAL_CALL startDocument(void) throw( ::com::sun::star::xml::sax::SAXException, ::com::sun::star::uno::RuntimeException );\n virtual void SAL_CALL endDocument(void) throw( ::com::sun::star::xml::sax::SAXException, ::com::sun::star::uno::RuntimeException );\n\n virtual SvXMLImportContext * CreateContext(\n sal_uInt16 nPrefix, const rtl::OUString &rLocalName,\n const com::sun::star::uno::Reference < com::sun::star::xml::sax::XAttributeList > &rxAttrList );\n\n ConvDic * GetDic() { return pDic; }\n INT16 GetLanguage() const { return nLanguage; }\n sal_Int16 GetConversionType() const { return nConversionType; }\n sal_Bool GetSuccess() const { return bSuccess; }\n\n void SetLanguage( INT16 nLang ) { nLanguage = nLang; }\n void SetConversionType( sal_Int16 nType ) { nConversionType = nType; }\n};\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n#endif\n\n<|endoftext|>"} {"text":"<commit_before>\/\/ Scintilla source code edit control\n\/** @file Selection.cxx\n ** Classes maintaining the selection.\n **\/\n\/\/ Copyright 2009 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\n#include <vector>\n\n#include \"Platform.h\"\n\n#include \"Scintilla.h\"\n\n#include \"Selection.h\"\n\n#ifdef SCI_NAMESPACE\nusing namespace Scintilla;\n#endif\n\nvoid SelectionPosition::MoveForInsertDelete(bool insertion, int startChange, int length) {\n\tif (insertion) {\n\t\tif (position > startChange) {\n\t\t\tposition += length;\n\t\t}\n\t} else {\n\t\tif (position > startChange) {\n\t\t\tint endDeletion = startChange + length;\n\t\t\tif (position > endDeletion) {\n\t\t\t\tposition -= length;\n\t\t\t} else {\n\t\t\t\tposition = startChange;\n\t\t\t}\n\t\t}\n\t}\n}\n\nbool SelectionPosition::operator <(const SelectionPosition &other) const {\n\tif (position == other.position)\n\t\treturn virtualSpace < other.virtualSpace;\n\telse\n\t\treturn position < other.position;\n}\n\nbool SelectionPosition::operator >(const SelectionPosition &other) const {\n\tif (position == other.position)\n\t\treturn virtualSpace > other.virtualSpace;\n\telse\n\t\treturn position > other.position;\n}\n\nbool SelectionPosition::operator <=(const SelectionPosition &other) const {\n\tif (position == other.position && virtualSpace == other.virtualSpace)\n\t\treturn true;\n\telse\n\t\treturn other > *this;\n}\n\nbool SelectionPosition::operator >=(const SelectionPosition &other) const {\n\tif (position == other.position && virtualSpace == other.virtualSpace)\n\t\treturn true;\n\telse\n\t\treturn *this > other;\n}\n\nint SelectionRange::Length() const {\n\tif (anchor > caret) {\n\t\treturn anchor.Position() - caret.Position();\n\t} else {\n\t\treturn caret.Position() - anchor.Position();\n\t}\n}\n\nbool SelectionRange::Contains(int pos) const {\n\tif (anchor > caret)\n\t\treturn (pos >= caret.Position()) && (pos <= anchor.Position());\n\telse\n\t\treturn (pos >= anchor.Position()) && (pos <= caret.Position());\n}\n\nbool SelectionRange::Contains(SelectionPosition sp) const {\n\tif (anchor > caret)\n\t\treturn (sp >= caret) && (sp <= anchor);\n\telse\n\t\treturn (sp >= anchor) && (sp <= caret);\n}\n\nbool SelectionRange::ContainsCharacter(int posCharacter) const {\n\tif (anchor > caret)\n\t\treturn (posCharacter >= caret.Position()) && (posCharacter < anchor.Position());\n\telse\n\t\treturn (posCharacter >= anchor.Position()) && (posCharacter < caret.Position());\n}\n\nSelectionSegment SelectionRange::Intersect(SelectionSegment check) const {\n\tSelectionSegment inOrder(caret, anchor);\n\tif ((inOrder.start <= check.end) || (inOrder.end >= check.start)) {\n\t\tSelectionSegment portion = check;\n\t\tif (portion.start < inOrder.start)\n\t\t\tportion.start = inOrder.start;\n\t\tif (portion.end > inOrder.end)\n\t\t\tportion.end = inOrder.end;\n\t\tif (portion.start > portion.end)\n\t\t\treturn SelectionSegment();\n\t\telse\n\t\t\treturn portion;\n\t} else {\n\t\treturn SelectionSegment();\n\t}\n}\n\nbool SelectionRange::Trim(SelectionRange range) {\n\tSelectionPosition startRange = range.Start();\n\tSelectionPosition endRange = range.End();\n\tSelectionPosition start = Start();\n\tSelectionPosition end = End();\n\tPLATFORM_ASSERT(start <= end);\n\tPLATFORM_ASSERT(startRange <= endRange);\n\tif ((startRange <= end) && (endRange >= start)) {\n\t\tif ((start > startRange) && (end < endRange)) {\n\t\t\t\/\/ Completely covered by range -> empty at start\n\t\t\tend = start;\n\t\t} else if ((start < startRange) && (end > endRange)) {\n\t\t\t\/\/ Completely covers range -> empty at start\n\t\t\tend = start;\n\t\t} else if (start <= startRange) {\n\t\t\t\/\/ Trim end\n\t\t\tend = startRange;\n\t\t} else { \/\/ \n\t\t\tPLATFORM_ASSERT(end >= endRange);\n\t\t\t\/\/ Trim start\n\t\t\tstart = endRange;\n\t\t}\n\t\tif (anchor > caret) {\n\t\t\tcaret = start;\n\t\t\tanchor = end;\n\t\t} else {\n\t\t\tanchor = start;\n\t\t\tcaret = end;\n\t\t}\n\t\treturn Empty();\n\t} else {\n\t\treturn false;\n\t}\n}\n\n\/\/ If range is all virtual collapse to start of virtual space\nvoid SelectionRange::MinimizeVirtualSpace() {\n\tif (caret.Position() == anchor.Position()) {\n\t\tint virtualSpace = caret.VirtualSpace();\n\t\tif (virtualSpace > anchor.VirtualSpace())\n\t\t\tvirtualSpace = anchor.VirtualSpace();\n\t\tcaret.SetVirtualSpace(virtualSpace);\n\t\tanchor.SetVirtualSpace(virtualSpace);\n\t}\n}\n\nSelection::Selection() : mainRange(0), moveExtends(false), selType(selStream), tentativeMain(false) {\n\tAddSelection(SelectionPosition(0));\n}\n\nSelection::~Selection() {\n}\n\nbool Selection::IsRectangular() const {\n\treturn (selType == selRectangle) || (selType == selThin);\n}\n\nint Selection::MainCaret() const {\n\treturn ranges[mainRange].caret.Position();\n}\n\nint Selection::MainAnchor() const {\n\treturn ranges[mainRange].anchor.Position();\n}\n\nSelectionRange &Selection::Rectangular() {\n\treturn rangeRectangular;\n}\n\nsize_t Selection::Count() const {\n\treturn ranges.size();\n}\n\nsize_t Selection::Main() const {\n\treturn mainRange;\n}\n\nvoid Selection::SetMain(size_t r) {\n\tPLATFORM_ASSERT(r < ranges.size());\n\tmainRange = r;\n}\n\nSelectionRange &Selection::Range(size_t r) {\n\treturn ranges[r];\n}\n\nSelectionRange &Selection::RangeMain() {\n\treturn ranges[mainRange];\n}\n\nbool Selection::MoveExtends() const {\n\treturn moveExtends;\n}\n\nvoid Selection::SetMoveExtends(bool moveExtends_) {\n\tmoveExtends = moveExtends_;\n}\n\nbool Selection::Empty() const {\n\tfor (size_t i=0; i<ranges.size(); i++) {\n\t\tif (!ranges[i].Empty())\n\t\t\treturn false;\n\t}\n\treturn true;\n}\n\nSelectionPosition Selection::Last() const {\n\tSelectionPosition lastPosition;\n\tfor (size_t i=0; i<ranges.size(); i++) {\n\t\tif (lastPosition < ranges[i].caret)\n\t\t\tlastPosition = ranges[i].caret;\n\t\tif (lastPosition < ranges[i].anchor)\n\t\t\tlastPosition = ranges[i].anchor;\n\t}\n\treturn lastPosition;\n}\n\nint Selection::Length() const {\n\tint len = 0;\n\tfor (size_t i=0; i<ranges.size(); i++) {\n\t\tlen += ranges[i].Length();\n\t}\n\treturn len;\n}\n\nvoid Selection::MovePositions(bool insertion, int startChange, int length) {\n\tfor (size_t i=0; i<ranges.size(); i++) {\n\t\tranges[i].caret.MoveForInsertDelete(insertion, startChange, length);\n\t\tranges[i].anchor.MoveForInsertDelete(insertion, startChange, length);\n\t}\n}\n\nvoid Selection::TrimSelection(SelectionRange range) {\n\tfor (size_t i=0; i<ranges.size();) {\n\t\tif ((i != mainRange) && (ranges[i].Trim(range))) {\n\t\t\t\/\/ Trimmed to empty so remove\n\t\t\tfor (size_t j=i;j<ranges.size()-1;j++) {\n\t\t\t\tranges[j] = ranges[j+1];\n\t\t\t\tif (j == mainRange-1)\n\t\t\t\t\tmainRange--;\n\t\t\t}\n\t\t\tranges.pop_back();\n\t\t} else {\n\t\t\ti++;\n\t\t}\n\t}\n}\n\nvoid Selection::SetSelection(SelectionRange range) {\n\tranges.clear();\n\tranges.push_back(range);\n\tmainRange = ranges.size() - 1;\n}\n\nvoid Selection::AddSelection(SelectionRange range) {\n\tTrimSelection(range);\n\tranges.push_back(range);\n\tmainRange = ranges.size() - 1;\n}\n\nvoid Selection::TentativeSelection(SelectionRange range) {\n\tif (!tentativeMain) {\n\t\trangesSaved = ranges;\n\t}\n\tranges = rangesSaved;\n\tAddSelection(range);\n\tTrimSelection(ranges[mainRange]);\n\ttentativeMain = true;\n}\n\nvoid Selection::CommitTentative() {\n\trangesSaved.clear();\n\ttentativeMain = false;\n}\n\nint Selection::CharacterInSelection(int posCharacter) const {\n\tfor (size_t i=0; i<ranges.size(); i++) {\n\t\tif (ranges[i].ContainsCharacter(posCharacter))\n\t\t\treturn i == mainRange ? 1 : 2;\n\t}\n\treturn 0;\n}\n\nint Selection::InSelectionForEOL(int pos) const {\n\tfor (size_t i=0; i<ranges.size(); i++) {\n\t\tif (!ranges[i].Empty() && (pos > ranges[i].Start().Position()) && (pos <= ranges[i].End().Position()))\n\t\t\treturn i == mainRange ? 1 : 2;\n\t}\n\treturn 0;\n}\n\nint Selection::VirtualSpaceFor(int pos) const {\n\tint virtualSpace = 0;\n\tfor (size_t i=0; i<ranges.size(); i++) {\n\t\tif ((ranges[i].caret.Position() == pos) && (virtualSpace < ranges[i].caret.VirtualSpace()))\n\t\t\tvirtualSpace = ranges[i].caret.VirtualSpace();\n\t\tif ((ranges[i].anchor.Position() == pos) && (virtualSpace < ranges[i].anchor.VirtualSpace()))\n\t\t\tvirtualSpace = ranges[i].anchor.VirtualSpace();\n\t}\n\treturn virtualSpace;\n}\n\nvoid Selection::Clear() {\n\tranges.clear();\n\tranges.push_back(SelectionRange());\n\tmainRange = ranges.size() - 1;\n\tselType = selStream;\n\tmoveExtends = false;\n\tranges[mainRange].Reset();\n\trangeRectangular.Reset();\n}\n\nvoid Selection::RemoveDuplicates() {\n\tfor (size_t i=0; i<ranges.size()-1; i++) {\n\t\tif (ranges[i].Empty()) {\n\t\t\tsize_t j=i+1;\n\t\t\twhile (j<ranges.size()) {\n\t\t\t\tif (ranges[i] == ranges[j]) {\n\t\t\t\t\tranges.erase(ranges.begin() + j);\n\t\t\t\t\tif (mainRange >= j)\n\t\t\t\t\t\tmainRange--;\n\t\t\t\t} else {\n\t\t\t\t\tj++;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n}\n\nvoid Selection::RotateMain() {\n\tmainRange = (mainRange + 1) % ranges.size();\n}\n\n<commit_msg>Avoid warning.<commit_after>\/\/ Scintilla source code edit control\n\/** @file Selection.cxx\n ** Classes maintaining the selection.\n **\/\n\/\/ Copyright 2009 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\n#include <vector>\n\n#include \"Platform.h\"\n\n#include \"Scintilla.h\"\n\n#include \"Selection.h\"\n\n#ifdef SCI_NAMESPACE\nusing namespace Scintilla;\n#endif\n\nvoid SelectionPosition::MoveForInsertDelete(bool insertion, int startChange, int length) {\n\tif (insertion) {\n\t\tif (position > startChange) {\n\t\t\tposition += length;\n\t\t}\n\t} else {\n\t\tif (position > startChange) {\n\t\t\tint endDeletion = startChange + length;\n\t\t\tif (position > endDeletion) {\n\t\t\t\tposition -= length;\n\t\t\t} else {\n\t\t\t\tposition = startChange;\n\t\t\t}\n\t\t}\n\t}\n}\n\nbool SelectionPosition::operator <(const SelectionPosition &other) const {\n\tif (position == other.position)\n\t\treturn virtualSpace < other.virtualSpace;\n\telse\n\t\treturn position < other.position;\n}\n\nbool SelectionPosition::operator >(const SelectionPosition &other) const {\n\tif (position == other.position)\n\t\treturn virtualSpace > other.virtualSpace;\n\telse\n\t\treturn position > other.position;\n}\n\nbool SelectionPosition::operator <=(const SelectionPosition &other) const {\n\tif (position == other.position && virtualSpace == other.virtualSpace)\n\t\treturn true;\n\telse\n\t\treturn other > *this;\n}\n\nbool SelectionPosition::operator >=(const SelectionPosition &other) const {\n\tif (position == other.position && virtualSpace == other.virtualSpace)\n\t\treturn true;\n\telse\n\t\treturn *this > other;\n}\n\nint SelectionRange::Length() const {\n\tif (anchor > caret) {\n\t\treturn anchor.Position() - caret.Position();\n\t} else {\n\t\treturn caret.Position() - anchor.Position();\n\t}\n}\n\nbool SelectionRange::Contains(int pos) const {\n\tif (anchor > caret)\n\t\treturn (pos >= caret.Position()) && (pos <= anchor.Position());\n\telse\n\t\treturn (pos >= anchor.Position()) && (pos <= caret.Position());\n}\n\nbool SelectionRange::Contains(SelectionPosition sp) const {\n\tif (anchor > caret)\n\t\treturn (sp >= caret) && (sp <= anchor);\n\telse\n\t\treturn (sp >= anchor) && (sp <= caret);\n}\n\nbool SelectionRange::ContainsCharacter(int posCharacter) const {\n\tif (anchor > caret)\n\t\treturn (posCharacter >= caret.Position()) && (posCharacter < anchor.Position());\n\telse\n\t\treturn (posCharacter >= anchor.Position()) && (posCharacter < caret.Position());\n}\n\nSelectionSegment SelectionRange::Intersect(SelectionSegment check) const {\n\tSelectionSegment inOrder(caret, anchor);\n\tif ((inOrder.start <= check.end) || (inOrder.end >= check.start)) {\n\t\tSelectionSegment portion = check;\n\t\tif (portion.start < inOrder.start)\n\t\t\tportion.start = inOrder.start;\n\t\tif (portion.end > inOrder.end)\n\t\t\tportion.end = inOrder.end;\n\t\tif (portion.start > portion.end)\n\t\t\treturn SelectionSegment();\n\t\telse\n\t\t\treturn portion;\n\t} else {\n\t\treturn SelectionSegment();\n\t}\n}\n\nbool SelectionRange::Trim(SelectionRange range) {\n\tSelectionPosition startRange = range.Start();\n\tSelectionPosition endRange = range.End();\n\tSelectionPosition start = Start();\n\tSelectionPosition end = End();\n\tPLATFORM_ASSERT(start <= end);\n\tPLATFORM_ASSERT(startRange <= endRange);\n\tif ((startRange <= end) && (endRange >= start)) {\n\t\tif ((start > startRange) && (end < endRange)) {\n\t\t\t\/\/ Completely covered by range -> empty at start\n\t\t\tend = start;\n\t\t} else if ((start < startRange) && (end > endRange)) {\n\t\t\t\/\/ Completely covers range -> empty at start\n\t\t\tend = start;\n\t\t} else if (start <= startRange) {\n\t\t\t\/\/ Trim end\n\t\t\tend = startRange;\n\t\t} else { \/\/ \n\t\t\tPLATFORM_ASSERT(end >= endRange);\n\t\t\t\/\/ Trim start\n\t\t\tstart = endRange;\n\t\t}\n\t\tif (anchor > caret) {\n\t\t\tcaret = start;\n\t\t\tanchor = end;\n\t\t} else {\n\t\t\tanchor = start;\n\t\t\tcaret = end;\n\t\t}\n\t\treturn Empty();\n\t} else {\n\t\treturn false;\n\t}\n}\n\n\/\/ If range is all virtual collapse to start of virtual space\nvoid SelectionRange::MinimizeVirtualSpace() {\n\tif (caret.Position() == anchor.Position()) {\n\t\tint virtualSpace = caret.VirtualSpace();\n\t\tif (virtualSpace > anchor.VirtualSpace())\n\t\t\tvirtualSpace = anchor.VirtualSpace();\n\t\tcaret.SetVirtualSpace(virtualSpace);\n\t\tanchor.SetVirtualSpace(virtualSpace);\n\t}\n}\n\nSelection::Selection() : mainRange(0), moveExtends(false), tentativeMain(false), selType(selStream) {\n\tAddSelection(SelectionPosition(0));\n}\n\nSelection::~Selection() {\n}\n\nbool Selection::IsRectangular() const {\n\treturn (selType == selRectangle) || (selType == selThin);\n}\n\nint Selection::MainCaret() const {\n\treturn ranges[mainRange].caret.Position();\n}\n\nint Selection::MainAnchor() const {\n\treturn ranges[mainRange].anchor.Position();\n}\n\nSelectionRange &Selection::Rectangular() {\n\treturn rangeRectangular;\n}\n\nsize_t Selection::Count() const {\n\treturn ranges.size();\n}\n\nsize_t Selection::Main() const {\n\treturn mainRange;\n}\n\nvoid Selection::SetMain(size_t r) {\n\tPLATFORM_ASSERT(r < ranges.size());\n\tmainRange = r;\n}\n\nSelectionRange &Selection::Range(size_t r) {\n\treturn ranges[r];\n}\n\nSelectionRange &Selection::RangeMain() {\n\treturn ranges[mainRange];\n}\n\nbool Selection::MoveExtends() const {\n\treturn moveExtends;\n}\n\nvoid Selection::SetMoveExtends(bool moveExtends_) {\n\tmoveExtends = moveExtends_;\n}\n\nbool Selection::Empty() const {\n\tfor (size_t i=0; i<ranges.size(); i++) {\n\t\tif (!ranges[i].Empty())\n\t\t\treturn false;\n\t}\n\treturn true;\n}\n\nSelectionPosition Selection::Last() const {\n\tSelectionPosition lastPosition;\n\tfor (size_t i=0; i<ranges.size(); i++) {\n\t\tif (lastPosition < ranges[i].caret)\n\t\t\tlastPosition = ranges[i].caret;\n\t\tif (lastPosition < ranges[i].anchor)\n\t\t\tlastPosition = ranges[i].anchor;\n\t}\n\treturn lastPosition;\n}\n\nint Selection::Length() const {\n\tint len = 0;\n\tfor (size_t i=0; i<ranges.size(); i++) {\n\t\tlen += ranges[i].Length();\n\t}\n\treturn len;\n}\n\nvoid Selection::MovePositions(bool insertion, int startChange, int length) {\n\tfor (size_t i=0; i<ranges.size(); i++) {\n\t\tranges[i].caret.MoveForInsertDelete(insertion, startChange, length);\n\t\tranges[i].anchor.MoveForInsertDelete(insertion, startChange, length);\n\t}\n}\n\nvoid Selection::TrimSelection(SelectionRange range) {\n\tfor (size_t i=0; i<ranges.size();) {\n\t\tif ((i != mainRange) && (ranges[i].Trim(range))) {\n\t\t\t\/\/ Trimmed to empty so remove\n\t\t\tfor (size_t j=i;j<ranges.size()-1;j++) {\n\t\t\t\tranges[j] = ranges[j+1];\n\t\t\t\tif (j == mainRange-1)\n\t\t\t\t\tmainRange--;\n\t\t\t}\n\t\t\tranges.pop_back();\n\t\t} else {\n\t\t\ti++;\n\t\t}\n\t}\n}\n\nvoid Selection::SetSelection(SelectionRange range) {\n\tranges.clear();\n\tranges.push_back(range);\n\tmainRange = ranges.size() - 1;\n}\n\nvoid Selection::AddSelection(SelectionRange range) {\n\tTrimSelection(range);\n\tranges.push_back(range);\n\tmainRange = ranges.size() - 1;\n}\n\nvoid Selection::TentativeSelection(SelectionRange range) {\n\tif (!tentativeMain) {\n\t\trangesSaved = ranges;\n\t}\n\tranges = rangesSaved;\n\tAddSelection(range);\n\tTrimSelection(ranges[mainRange]);\n\ttentativeMain = true;\n}\n\nvoid Selection::CommitTentative() {\n\trangesSaved.clear();\n\ttentativeMain = false;\n}\n\nint Selection::CharacterInSelection(int posCharacter) const {\n\tfor (size_t i=0; i<ranges.size(); i++) {\n\t\tif (ranges[i].ContainsCharacter(posCharacter))\n\t\t\treturn i == mainRange ? 1 : 2;\n\t}\n\treturn 0;\n}\n\nint Selection::InSelectionForEOL(int pos) const {\n\tfor (size_t i=0; i<ranges.size(); i++) {\n\t\tif (!ranges[i].Empty() && (pos > ranges[i].Start().Position()) && (pos <= ranges[i].End().Position()))\n\t\t\treturn i == mainRange ? 1 : 2;\n\t}\n\treturn 0;\n}\n\nint Selection::VirtualSpaceFor(int pos) const {\n\tint virtualSpace = 0;\n\tfor (size_t i=0; i<ranges.size(); i++) {\n\t\tif ((ranges[i].caret.Position() == pos) && (virtualSpace < ranges[i].caret.VirtualSpace()))\n\t\t\tvirtualSpace = ranges[i].caret.VirtualSpace();\n\t\tif ((ranges[i].anchor.Position() == pos) && (virtualSpace < ranges[i].anchor.VirtualSpace()))\n\t\t\tvirtualSpace = ranges[i].anchor.VirtualSpace();\n\t}\n\treturn virtualSpace;\n}\n\nvoid Selection::Clear() {\n\tranges.clear();\n\tranges.push_back(SelectionRange());\n\tmainRange = ranges.size() - 1;\n\tselType = selStream;\n\tmoveExtends = false;\n\tranges[mainRange].Reset();\n\trangeRectangular.Reset();\n}\n\nvoid Selection::RemoveDuplicates() {\n\tfor (size_t i=0; i<ranges.size()-1; i++) {\n\t\tif (ranges[i].Empty()) {\n\t\t\tsize_t j=i+1;\n\t\t\twhile (j<ranges.size()) {\n\t\t\t\tif (ranges[i] == ranges[j]) {\n\t\t\t\t\tranges.erase(ranges.begin() + j);\n\t\t\t\t\tif (mainRange >= j)\n\t\t\t\t\t\tmainRange--;\n\t\t\t\t} else {\n\t\t\t\t\tj++;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n}\n\nvoid Selection::RotateMain() {\n\tmainRange = (mainRange + 1) % ranges.size();\n}\n\n<|endoftext|>"} {"text":"<commit_before>#include <ros\/ros.h>\n#include <ros\/forwards.h>\n#include <ros\/single_subscriber_publisher.h>\n#include <sensor_msgs\/Image.h>\n#include <image_transport\/image_transport.h>\n#include <visualization_msgs\/Marker.h>\n#include <opencv\/cv.h>\n#include <opencv\/highgui.h>\n#include <cv_bridge\/cv_bridge.h>\n\n#include <src\/TagDetector.h>\n#include <src\/TagDetection.h>\n#include <src\/TagFamily.h>\n\n#include <Eigen\/Core>\n#include <Eigen\/Geometry>\n\n#include <visualization_msgs\/MarkerArray.h>\n#include \"yaml-cpp\/yaml.h\"\n#include <sstream>\n#include <fstream>\n\n#include <boost\/unordered_set.hpp>\n#include <boost\/unordered_map.hpp>\n#include <boost\/make_shared.hpp>\n\n#include \"apriltags.h\"\n\nusing namespace std;\n\n\/\/ Functions\n\ndouble GetTagSize(int tag_id)\n{\n boost::unordered_map<size_t, double>::iterator tag_sizes_it =\n tag_sizes_.find(tag_id);\n if(tag_sizes_it != tag_sizes_.end()) {\n return tag_sizes_it->second;\n } else {\n return default_tag_size_;\n }\n}\n\nEigen::Matrix4d GetDetectionTransform(TagDetection detection)\n{\n double tag_size = GetTagSize(detection.id);\n\n std::vector<cv::Point3f> object_pts;\n std::vector<cv::Point2f> image_pts;\n double tag_radius = tag_size\/2.;\n \n object_pts.push_back(cv::Point3f(-tag_radius, -tag_radius, 0));\n object_pts.push_back(cv::Point3f( tag_radius, -tag_radius, 0));\n object_pts.push_back(cv::Point3f( tag_radius, tag_radius, 0));\n object_pts.push_back(cv::Point3f(-tag_radius, tag_radius, 0));\n \n image_pts.push_back(detection.p[0]);\n image_pts.push_back(detection.p[1]);\n image_pts.push_back(detection.p[2]);\n image_pts.push_back(detection.p[3]);\n\n cv::Matx33f intrinsics(camera_info_.K[0], 0, camera_info_.K[2],\n 0, camera_info_.K[4], camera_info_.K[5],\n 0, 0, 1);\n \n cv::Mat rvec, tvec;\n cv::Vec4f dist_param(0,0,0,0);\n cv::solvePnP(object_pts, image_pts, intrinsics, dist_param,\n rvec, tvec);\n cv::Matx33d r;\n cv::Rodrigues(rvec, r);\n Eigen::Matrix3d rot;\n rot << r(0,0), r(0,1), r(0,2),\n r(1,0), r(1,1), r(1,2),\n r(2,0), r(2,1), r(2,2);\n \n Eigen::Matrix4d T;\n T.topLeftCorner(3,3) = rot;\n T.col(3).head(3) <<\n tvec.at<double>(0), tvec.at<double>(1), tvec.at<double>(2);\n T.row(3) << 0,0,0,1;\n \n return T;\n}\n\n\/\/ Callback for camera info\nvoid InfoCallback(const sensor_msgs::CameraInfoConstPtr& camera_info)\n{\n camera_info_ = (*camera_info);\n has_camera_info_ = true;\n}\n\n\/\/ Callback for image data\nvoid ImageCallback(const sensor_msgs::ImageConstPtr& msg )\n{\n if(!has_camera_info_){\n ROS_WARN(\"No Camera Info Received Yet\");\n return;\n }\n \n \/\/ Get the image\n cv_bridge::CvImagePtr subscribed_ptr;\n try\n {\n subscribed_ptr = cv_bridge::toCvCopy(msg, \"mono8\");\n }\n catch(cv_bridge::Exception& e)\n {\n ROS_ERROR(\"cv_bridge exception: %s\", e.what());\n return;\n }\n \n cv::Mat subscribed_gray = subscribed_ptr->image;\n cv::Mat tmp;\n cv::Point2d opticalCenter(0.5*subscribed_gray.rows,\n 0.5*subscribed_gray.cols);\n TagDetectionArray detections;\n detector_->process(subscribed_gray, opticalCenter, detections);\n visualization_msgs::MarkerArray marker_transforms;\n \n if(viewer_)\n {\n subscribed_gray = family_->superimposeDetections(subscribed_gray,\n detections);\n }\n for(unsigned int i = 0; i < detections.size(); ++i)\n {\n Eigen::Matrix4d pose = GetDetectionTransform(detections[i]);\n \n \/\/ Get this info from earlier code, don't extract it again\n Eigen::Matrix3d R = pose.block<3,3>(0,0);\n Eigen::Quaternion<double> q(R);\n \n visualization_msgs::Marker marker_transform;\n marker_transform.header.frame_id = frame_;\n marker_transform.header.stamp = ros::Time::now();\n stringstream convert;\n convert << \"tag\" << detections[i].id;\n marker_transform.ns = convert.str().c_str();\n marker_transform.id = detections[i].id;\n marker_transform.type = visualization_msgs::Marker::ARROW;\n \/\/marker_transform.type = visualization_msgs::Marker::CUBE;\n marker_transform.action = visualization_msgs::Marker::ADD;\n marker_transform.pose.position.x = pose(0,3);\n marker_transform.pose.position.y = pose(1,3);\n marker_transform.pose.position.z = pose(2,3);\n marker_transform.pose.orientation.x = q.x();\n marker_transform.pose.orientation.y = q.y();\n marker_transform.pose.orientation.z = q.z();\n marker_transform.pose.orientation.w = q.w();\n\n \tdouble tag_size = GetTagSize(detections[i].id);\n \/*\n marker_transform.scale.x = tag_size;\n marker_transform.scale.y = tag_size;\n marker_transform.scale.z = 0.01 * tag_size;\n *\/\n marker_transform.scale.x = tag_size;\n marker_transform.scale.y = tag_size;\n marker_transform.scale.z = tag_size;\n \n marker_transform.color.r = 1.0;\n marker_transform.color.g = 0.0;\n marker_transform.color.b = 1.0;\n marker_transform.color.a = 1.0;\n marker_transforms.markers.push_back(marker_transform);\n }\n marker_publisher_.publish(marker_transforms);\n \n if(viewer_)\n {\n cv::imshow(\"AprilTags\", subscribed_gray);\n }\n}\n\nvoid ConnectCallback(const ros::SingleSubscriberPublisher& info)\n{\n \/\/ Check for subscribers.\n uint32_t subscribers = marker_publisher_.getNumSubscribers();\n ROS_DEBUG(\"Subscription detected! (%d subscribers)\", subscribers);\n\n if(subscribers && !running_)\n {\n ROS_DEBUG(\"New Subscribers, Connecting to Input Image Topic.\");\n ros::TransportHints ros_transport_hints(ros::TransportHints().tcpNoDelay());\n image_transport::TransportHints image_transport_hint(image_transport::TransportHints(\n \"raw\", ros_transport_hints, (*node_),\n \"image_transport\"));\n\n image_subscriber = (*image_).subscribe(\n DEFAULT_IMAGE_TOPIC, 1, &ImageCallback,\n image_transport_hint);\n info_subscriber = (*node_).subscribe(\n DEFAULT_CAMERA_INFO_TOPIC, 10, &InfoCallback);\n running_ = true;\n }\n}\n\nvoid DisconnectHandler()\n{\n}\n\nvoid DisconnectCallback(const ros::SingleSubscriberPublisher& info)\n{\n \/\/ Check for subscribers.\n uint32_t subscribers = marker_publisher_.getNumSubscribers();\n ROS_DEBUG(\"Unsubscription detected! (%d subscribers)\", subscribers);\n \n if(!subscribers && running_)\n {\n ROS_DEBUG(\"No Subscribers, Disconnecting from Input Image Topic.\");\n\t\timage_subscriber.shutdown();\n\t\tinfo_subscriber.shutdown();\n\t\trunning_ = false;\n }\n}\n\nvoid GetParameterValues()\n{\n \/\/ Load node-wide configuration values.\n node_->param(\"viewer\", viewer_, 0);\n node_->param(\"tag_family\", tag_family_name_, DEFAULT_TAG_FAMILY);\n node_->param(\"default_tag_size\", default_tag_size_, DEFAULT_TAG_SIZE);\n node_->param(\"tf_frame\", frame_, DEFAULT_TF_FRAME);\n\n \/\/ Load tag specific configuration values.\n XmlRpc::XmlRpcValue tag_data;\n node_->param(\"tag_data\", tag_data, tag_data);\n\n \/\/ Iterate through each tag in the configuration.\n XmlRpc::XmlRpcValue::ValueStruct::iterator it;\n for (it = tag_data.begin(); it != tag_data.end(); ++it)\n {\n \/\/ Retrieve the settings for the next tag.\n int tag_id = boost::lexical_cast<int>(it->first);\n XmlRpc::XmlRpcValue tag_values = it->second;\n\n \/\/ Load all the settings for this tag.\n if (tag_values.hasMember(\"size\")) \n {\n tag_sizes_[tag_id] = static_cast<double>(tag_values[\"size\"]);\n ROS_DEBUG(\"Setting tag%d to size %f m.\", tag_id, tag_sizes_[tag_id]);\n }\n }\n}\n\nvoid SetupPublisher()\n{ \n ros::SubscriberStatusCallback connect_callback = &ConnectCallback;\n ros::SubscriberStatusCallback disconnect_callback = &DisconnectCallback;\n \n \/\/ Publisher\n marker_publisher_ = node_->advertise<visualization_msgs::MarkerArray>(\n DEFAULT_MARKER_TOPIC, 1, connect_callback,\n disconnect_callback);\n}\n\nvoid InitializeTags()\n{\n tag_params.newQuadAlgorithm = 1;\n family_ = new TagFamily(tag_family_name_);\n detector_ = new TagDetector(*family_, tag_params);\n}\n\nvoid InitializeROSNode(int argc, char **argv)\n{\n ros::init(argc, argv, \"apriltags\");\n node_ = boost::make_shared<ros::NodeHandle>(\"~\");\n image_ = boost::make_shared<image_transport::ImageTransport>(*node_);\n}\n\nint main(int argc, char **argv)\n{\n InitializeROSNode(argc,argv);\n GetParameterValues();\n SetupPublisher();\n InitializeTags();\n\n if(viewer_){\n cvNamedWindow(\"AprilTags\");\n cvStartWindowThread();\n }\n\n ROS_INFO(\"AprilTags node started.\");\n running_ = false;\n has_camera_info_ = false;\n ros::spin();\n ROS_INFO(\"AprilTags node stopped.\");\n\n \/\/Destroying Stuff\n cvDestroyWindow(\"AprilTags\");\n delete detector_;\n delete family_;\n\n return EXIT_SUCCESS;\n}\n<commit_msg>testing sizes<commit_after>#include <ros\/ros.h>\n#include <ros\/forwards.h>\n#include <ros\/single_subscriber_publisher.h>\n#include <sensor_msgs\/Image.h>\n#include <image_transport\/image_transport.h>\n#include <visualization_msgs\/Marker.h>\n#include <opencv\/cv.h>\n#include <opencv\/highgui.h>\n#include <cv_bridge\/cv_bridge.h>\n\n#include <src\/TagDetector.h>\n#include <src\/TagDetection.h>\n#include <src\/TagFamily.h>\n\n#include <Eigen\/Core>\n#include <Eigen\/Geometry>\n\n#include <visualization_msgs\/MarkerArray.h>\n#include \"yaml-cpp\/yaml.h\"\n#include <sstream>\n#include <fstream>\n\n#include <boost\/unordered_set.hpp>\n#include <boost\/unordered_map.hpp>\n#include <boost\/make_shared.hpp>\n\n#include \"apriltags.h\"\n\nusing namespace std;\n\n\/\/ Functions\n\ndouble GetTagSize(int tag_id)\n{\n boost::unordered_map<size_t, double>::iterator tag_sizes_it =\n tag_sizes_.find(tag_id);\n if(tag_sizes_it != tag_sizes_.end()) {\n return tag_sizes_it->second;\n } else {\n return default_tag_size_;\n }\n}\n\nEigen::Matrix4d GetDetectionTransform(TagDetection detection)\n{\n double tag_size = GetTagSize(detection.id);\n\n std::vector<cv::Point3f> object_pts;\n std::vector<cv::Point2f> image_pts;\n double tag_radius = tag_size\/2.;\n \n object_pts.push_back(cv::Point3f(-tag_radius, -tag_radius, 0));\n object_pts.push_back(cv::Point3f( tag_radius, -tag_radius, 0));\n object_pts.push_back(cv::Point3f( tag_radius, tag_radius, 0));\n object_pts.push_back(cv::Point3f(-tag_radius, tag_radius, 0));\n \n image_pts.push_back(detection.p[0]);\n image_pts.push_back(detection.p[1]);\n image_pts.push_back(detection.p[2]);\n image_pts.push_back(detection.p[3]);\n\n cv::Matx33f intrinsics(camera_info_.K[0], 0, camera_info_.K[2],\n 0, camera_info_.K[4], camera_info_.K[5],\n 0, 0, 1);\n \n cv::Mat rvec, tvec;\n cv::Vec4f dist_param(0,0,0,0);\n cv::solvePnP(object_pts, image_pts, intrinsics, dist_param,\n rvec, tvec);\n cv::Matx33d r;\n cv::Rodrigues(rvec, r);\n Eigen::Matrix3d rot;\n rot << r(0,0), r(0,1), r(0,2),\n r(1,0), r(1,1), r(1,2),\n r(2,0), r(2,1), r(2,2);\n \n Eigen::Matrix4d T;\n T.topLeftCorner(3,3) = rot;\n T.col(3).head(3) <<\n tvec.at<double>(0), tvec.at<double>(1), tvec.at<double>(2);\n T.row(3) << 0,0,0,1;\n \n return T;\n}\n\n\/\/ Callback for camera info\nvoid InfoCallback(const sensor_msgs::CameraInfoConstPtr& camera_info)\n{\n camera_info_ = (*camera_info);\n has_camera_info_ = true;\n}\n\n\/\/ Callback for image data\nvoid ImageCallback(const sensor_msgs::ImageConstPtr& msg )\n{\n if(!has_camera_info_){\n ROS_WARN(\"No Camera Info Received Yet\");\n return;\n }\n \n \/\/ Get the image\n cv_bridge::CvImagePtr subscribed_ptr;\n try\n {\n subscribed_ptr = cv_bridge::toCvCopy(msg, \"mono8\");\n }\n catch(cv_bridge::Exception& e)\n {\n ROS_ERROR(\"cv_bridge exception: %s\", e.what());\n return;\n }\n \n cv::Mat subscribed_gray = subscribed_ptr->image;\n cv::Mat tmp;\n cv::Point2d opticalCenter(0.5*subscribed_gray.rows,\n 0.5*subscribed_gray.cols);\n TagDetectionArray detections;\n detector_->process(subscribed_gray, opticalCenter, detections);\n visualization_msgs::MarkerArray marker_transforms;\n \n if(viewer_)\n {\n subscribed_gray = family_->superimposeDetections(subscribed_gray,\n detections);\n }\n for(unsigned int i = 0; i < detections.size(); ++i)\n {\n Eigen::Matrix4d pose = GetDetectionTransform(detections[i]);\n \n \/\/ Get this info from earlier code, don't extract it again\n Eigen::Matrix3d R = pose.block<3,3>(0,0);\n Eigen::Quaternion<double> q(R);\n \n visualization_msgs::Marker marker_transform;\n marker_transform.header.frame_id = frame_;\n marker_transform.header.stamp = ros::Time::now();\n stringstream convert;\n convert << \"tag\" << detections[i].id;\n marker_transform.ns = convert.str().c_str();\n marker_transform.id = detections[i].id;\n marker_transform.type = visualization_msgs::Marker::ARROW;\n \/\/marker_transform.type = visualization_msgs::Marker::CUBE;\n marker_transform.action = visualization_msgs::Marker::ADD;\n marker_transform.pose.position.x = pose(0,3);\n marker_transform.pose.position.y = pose(1,3);\n marker_transform.pose.position.z = pose(2,3);\n marker_transform.pose.orientation.x = q.x();\n marker_transform.pose.orientation.y = q.y();\n marker_transform.pose.orientation.z = q.z();\n marker_transform.pose.orientation.w = q.w();\n\n \tdouble tag_size = GetTagSize(detections[i].id);\n \/*\n marker_transform.scale.x = tag_size;\n marker_transform.scale.y = tag_size;\n marker_transform.scale.z = 0.01 * tag_size;\n *\/\n marker_transform.scale.x = tag_size;\n marker_transform.scale.y = tag_size*5;\n marker_transform.scale.z = tag_size;\n \n marker_transform.color.r = 1.0;\n marker_transform.color.g = 0.0;\n marker_transform.color.b = 1.0;\n marker_transform.color.a = 1.0;\n marker_transforms.markers.push_back(marker_transform);\n }\n marker_publisher_.publish(marker_transforms);\n \n if(viewer_)\n {\n cv::imshow(\"AprilTags\", subscribed_gray);\n }\n}\n\nvoid ConnectCallback(const ros::SingleSubscriberPublisher& info)\n{\n \/\/ Check for subscribers.\n uint32_t subscribers = marker_publisher_.getNumSubscribers();\n ROS_DEBUG(\"Subscription detected! (%d subscribers)\", subscribers);\n\n if(subscribers && !running_)\n {\n ROS_DEBUG(\"New Subscribers, Connecting to Input Image Topic.\");\n ros::TransportHints ros_transport_hints(ros::TransportHints().tcpNoDelay());\n image_transport::TransportHints image_transport_hint(image_transport::TransportHints(\n \"raw\", ros_transport_hints, (*node_),\n \"image_transport\"));\n\n image_subscriber = (*image_).subscribe(\n DEFAULT_IMAGE_TOPIC, 1, &ImageCallback,\n image_transport_hint);\n info_subscriber = (*node_).subscribe(\n DEFAULT_CAMERA_INFO_TOPIC, 10, &InfoCallback);\n running_ = true;\n }\n}\n\nvoid DisconnectHandler()\n{\n}\n\nvoid DisconnectCallback(const ros::SingleSubscriberPublisher& info)\n{\n \/\/ Check for subscribers.\n uint32_t subscribers = marker_publisher_.getNumSubscribers();\n ROS_DEBUG(\"Unsubscription detected! (%d subscribers)\", subscribers);\n \n if(!subscribers && running_)\n {\n ROS_DEBUG(\"No Subscribers, Disconnecting from Input Image Topic.\");\n\t\timage_subscriber.shutdown();\n\t\tinfo_subscriber.shutdown();\n\t\trunning_ = false;\n }\n}\n\nvoid GetParameterValues()\n{\n \/\/ Load node-wide configuration values.\n node_->param(\"viewer\", viewer_, 0);\n node_->param(\"tag_family\", tag_family_name_, DEFAULT_TAG_FAMILY);\n node_->param(\"default_tag_size\", default_tag_size_, DEFAULT_TAG_SIZE);\n node_->param(\"tf_frame\", frame_, DEFAULT_TF_FRAME);\n\n \/\/ Load tag specific configuration values.\n XmlRpc::XmlRpcValue tag_data;\n node_->param(\"tag_data\", tag_data, tag_data);\n\n \/\/ Iterate through each tag in the configuration.\n XmlRpc::XmlRpcValue::ValueStruct::iterator it;\n for (it = tag_data.begin(); it != tag_data.end(); ++it)\n {\n \/\/ Retrieve the settings for the next tag.\n int tag_id = boost::lexical_cast<int>(it->first);\n XmlRpc::XmlRpcValue tag_values = it->second;\n\n \/\/ Load all the settings for this tag.\n if (tag_values.hasMember(\"size\")) \n {\n tag_sizes_[tag_id] = static_cast<double>(tag_values[\"size\"]);\n ROS_DEBUG(\"Setting tag%d to size %f m.\", tag_id, tag_sizes_[tag_id]);\n }\n }\n}\n\nvoid SetupPublisher()\n{ \n ros::SubscriberStatusCallback connect_callback = &ConnectCallback;\n ros::SubscriberStatusCallback disconnect_callback = &DisconnectCallback;\n \n \/\/ Publisher\n marker_publisher_ = node_->advertise<visualization_msgs::MarkerArray>(\n DEFAULT_MARKER_TOPIC, 1, connect_callback,\n disconnect_callback);\n}\n\nvoid InitializeTags()\n{\n tag_params.newQuadAlgorithm = 1;\n family_ = new TagFamily(tag_family_name_);\n detector_ = new TagDetector(*family_, tag_params);\n}\n\nvoid InitializeROSNode(int argc, char **argv)\n{\n ros::init(argc, argv, \"apriltags\");\n node_ = boost::make_shared<ros::NodeHandle>(\"~\");\n image_ = boost::make_shared<image_transport::ImageTransport>(*node_);\n}\n\nint main(int argc, char **argv)\n{\n InitializeROSNode(argc,argv);\n GetParameterValues();\n SetupPublisher();\n InitializeTags();\n\n if(viewer_){\n cvNamedWindow(\"AprilTags\");\n cvStartWindowThread();\n }\n\n ROS_INFO(\"AprilTags node started.\");\n running_ = false;\n has_camera_info_ = false;\n ros::spin();\n ROS_INFO(\"AprilTags node stopped.\");\n\n \/\/Destroying Stuff\n cvDestroyWindow(\"AprilTags\");\n delete detector_;\n delete family_;\n\n return EXIT_SUCCESS;\n}\n<|endoftext|>"} {"text":"<commit_before>#include \"lib\/hi_res_time.h\"\r\n#include \"lib\/input.h\"\r\n#include \"lib\/text_renderer.h\"\r\n#include \"lib\/window_manager.h\"\r\n\r\n#include <string.h>\r\n#include <windows.h>\r\n\r\n\r\ninline unsigned GetRand()\r\n{\r\n static unsigned r = 0x12345671;\r\n return r = ((r * 214013 + 2531011) >> 16) & 0xffff;\r\n}\r\n\r\n\r\ndouble CalcMillionPixelsPerSec(BitmapRGBA *backBuffer)\r\n{\r\n unsigned iterations = 1000 * 1000 * 10;\r\n double startTime = GetHighResTime();\r\n for (unsigned i = 0; i < iterations; i++)\r\n {\r\n unsigned r = GetRand();\r\n RGBAColour c;\r\n c.r = r & 0xff;\r\n c.g = r & 0xff;\r\n c.b = r & 0xff;\r\n c.a = 128;\r\n PutPixUnclipped(backBuffer, r & 255, (r >> 8) & 255, c);\r\n }\r\n double endTime = GetHighResTime();\r\n double duration = endTime - startTime;\r\n double numPixels = (double)iterations;\r\n return (numPixels \/ duration) \/ 1e6;\r\n}\r\n\r\n\r\ndouble CalcBillionRectFillPixelsPerSec(BitmapRGBA *backBuffer)\r\n{\r\n unsigned iterations = 1000 * 300;\r\n double startTime = GetHighResTime();\r\n for (unsigned i = 0; i < iterations; i++)\r\n RectFill(backBuffer, 10, 10, 100, 100, g_colourWhite);\r\n double endTime = GetHighResTime();\r\n double duration = endTime - startTime;\r\n double numPixels = 100.0 * 100.0 * (double)iterations;\r\n return (numPixels \/ duration) \/ 1e9;\r\n}\r\n\r\n\r\ndouble CalcMillionLinePixelsPerSec(BitmapRGBA *backBuffer)\r\n{\r\n unsigned iterations = 1000 * 600;\r\n double startTime = GetHighResTime();\r\n for (unsigned i = 0; i < iterations; ++i)\r\n {\r\n DrawLine(backBuffer, 300, 300, 320, 600, g_colourWhite); \/\/ 320 long, nice slope\r\n DrawLine(backBuffer, 300, 300, 600, 320, g_colourWhite);\r\n DrawLine(backBuffer, 300, 300, 301, 315, g_colourWhite); \/\/ 16 long, nice slope\r\n DrawLine(backBuffer, 300, 300, 315, 301, g_colourWhite);\r\n DrawLine(backBuffer, 300, 300, 450, 451, g_colourWhite); \/\/ 151 long, annoying slope\r\n DrawLine(backBuffer, 300, 300, 451, 450, g_colourWhite);\r\n }\r\n double endTime = GetHighResTime();\r\n double duration = endTime - startTime;\r\n double numPixels = (320 + 16 + 151) * 2 * iterations;\r\n return (numPixels \/ duration) \/ 1e6;\r\n}\r\n\r\n\r\ndouble CalcMillionCharsPerSec(BitmapRGBA *backBuffer, TextRenderer *font)\r\n{\r\n static char const *str = \"Here's some interesting text []# !\";\r\n unsigned iterations = 1000 * 100;\r\n double startTime = GetHighResTime();\r\n for (unsigned i = 0; i < iterations; i++)\r\n DrawTextSimple(font, g_colourWhite, backBuffer, 10, 10, str);\r\n double endTime = GetHighResTime();\r\n double duration = endTime - startTime;\r\n double numChars = iterations * (double)strlen(str);\r\n return (numChars \/ duration) \/ 1000000.0;\r\n}\r\n\r\n\r\nint WINAPI WinMain(HINSTANCE _hInstance, HINSTANCE, LPSTR cmdLine, int)\r\n{\r\n\tCreateWin(100, 100, 1024, 768, true, \"Benchmark\");\r\n TextRenderer *font = CreateTextRenderer(\"Courier\", 8);\r\n BitmapRGBA *backBmp = CreateBitmapRGBA(800, 600);\r\n\r\n ClearBitmap(g_window->backBuffer, g_colourBlack);\r\n int textY = 10;\r\n double score;\r\n\r\n \/\/ Put pixel\r\n ClearBitmap(backBmp, g_colourBlack);\r\n score = CalcMillionPixelsPerSec(backBmp);\r\n DrawTextLeft(font, g_colourWhite, g_window->backBuffer, 10, textY, \r\n \"Million putpixels per sec = %.1f\", score);\r\n textY += font->charHeight;\r\n QuickBlit(g_window->backBuffer, 400, 100, backBmp);\r\n AdvanceWin();\r\n if (g_window->windowClosed || g_inputManager.keyDowns[KEY_ESC]) return 0;\r\n\r\n \/\/ Line draw\r\n ClearBitmap(backBmp, g_colourBlack);\r\n score = CalcMillionLinePixelsPerSec(backBmp);\r\n DrawTextLeft(font, g_colourWhite, g_window->backBuffer, 10, textY,\r\n \"Million line pixels per sec = %.2f\", score);\r\n textY += font->charHeight;\r\n QuickBlit(g_window->backBuffer, 400, 200, backBmp);\r\n AdvanceWin();\r\n if (g_window->windowClosed || g_inputManager.keyDowns[KEY_ESC]) return 0;\r\n\r\n \/\/ Rect fill\r\n ClearBitmap(backBmp, g_colourBlack);\r\n score = CalcBillionRectFillPixelsPerSec(backBmp);\r\n DrawTextLeft(font, g_colourWhite, g_window->backBuffer, 10, textY, \r\n \"Rectfill billion pixels per sec = %.2f\", score);\r\n textY += font->charHeight;\r\n QuickBlit(g_window->backBuffer, 400, 300, backBmp);\r\n AdvanceWin();\r\n if (g_window->windowClosed || g_inputManager.keyDowns[KEY_ESC]) return 0;\r\n\r\n \/\/ Text render\r\n ClearBitmap(backBmp, g_colourBlack);\r\n score = CalcMillionCharsPerSec(backBmp, font);\r\n DrawTextLeft(font, g_colourWhite, g_window->backBuffer, 10, textY, \r\n \"Million chars per sec = %.2f\", score);\r\n textY += font->charHeight;\r\n QuickBlit(g_window->backBuffer, 400, 400, backBmp);\r\n AdvanceWin();\r\n if (g_window->windowClosed || g_inputManager.keyDowns[KEY_ESC]) return 0;\r\n\r\n DrawTextLeft(font, g_colourWhite, g_window->backBuffer, 10, textY,\r\n \"Press ESC to quit\");\r\n\r\n while (!g_window->windowClosed && !g_inputManager.keyDowns[KEY_ESC])\r\n {\r\n AdvanceWin();\r\n Sleep(100);\r\n }\r\n}\r\n<commit_msg>Moved lines onto visible part of bitmap<commit_after>#include \"lib\/hi_res_time.h\"\r\n#include \"lib\/input.h\"\r\n#include \"lib\/text_renderer.h\"\r\n#include \"lib\/window_manager.h\"\r\n\r\n#include <string.h>\r\n#include <windows.h>\r\n\r\n\r\ninline unsigned GetRand()\r\n{\r\n static unsigned r = 0x12345671;\r\n return r = ((r * 214013 + 2531011) >> 16) & 0xffff;\r\n}\r\n\r\n\r\ndouble CalcMillionPixelsPerSec(BitmapRGBA *backBuffer)\r\n{\r\n unsigned iterations = 1000 * 1000 * 10;\r\n double startTime = GetHighResTime();\r\n for (unsigned i = 0; i < iterations; i++)\r\n {\r\n unsigned r = GetRand();\r\n RGBAColour c;\r\n c.r = r & 0xff;\r\n c.g = r & 0xff;\r\n c.b = r & 0xff;\r\n c.a = 128;\r\n PutPixUnclipped(backBuffer, r & 255, (r >> 8) & 255, c);\r\n }\r\n double endTime = GetHighResTime();\r\n double duration = endTime - startTime;\r\n double numPixels = (double)iterations;\r\n return (numPixels \/ duration) \/ 1e6;\r\n}\r\n\r\n\r\ndouble CalcBillionRectFillPixelsPerSec(BitmapRGBA *backBuffer)\r\n{\r\n unsigned iterations = 1000 * 300;\r\n double startTime = GetHighResTime();\r\n for (unsigned i = 0; i < iterations; i++)\r\n RectFill(backBuffer, 10, 10, 100, 100, g_colourWhite);\r\n double endTime = GetHighResTime();\r\n double duration = endTime - startTime;\r\n double numPixels = 100.0 * 100.0 * (double)iterations;\r\n return (numPixels \/ duration) \/ 1e9;\r\n}\r\n\r\n\r\ndouble CalcMillionLinePixelsPerSec(BitmapRGBA *backBuffer)\r\n{\r\n unsigned iterations = 1000 * 600;\r\n double startTime = GetHighResTime();\r\n for (unsigned i = 0; i < iterations; ++i)\r\n {\r\n DrawLine(backBuffer, 0, 0, 20, 300, g_colourWhite); \/\/ 320 long, nice slope\r\n DrawLine(backBuffer, 0, 0, 300, 20, g_colourWhite);\r\n DrawLine(backBuffer, 0, 0, 1, 15, g_colourWhite); \/\/ 16 long, nice slope\r\n DrawLine(backBuffer, 0, 0, 15, 1, g_colourWhite);\r\n DrawLine(backBuffer, 0, 0, 150, 151, g_colourWhite); \/\/ 151 long, annoying slope\r\n DrawLine(backBuffer, 0, 0, 151, 150, g_colourWhite);\r\n }\r\n double endTime = GetHighResTime();\r\n double duration = endTime - startTime;\r\n double numPixels = (320 + 16 + 151) * 2 * iterations;\r\n return (numPixels \/ duration) \/ 1e6;\r\n}\r\n\r\n\r\ndouble CalcMillionCharsPerSec(BitmapRGBA *backBuffer, TextRenderer *font)\r\n{\r\n static char const *str = \"Here's some interesting text []# !\";\r\n unsigned iterations = 1000 * 100;\r\n double startTime = GetHighResTime();\r\n for (unsigned i = 0; i < iterations; i++)\r\n DrawTextSimple(font, g_colourWhite, backBuffer, 10, 10, str);\r\n double endTime = GetHighResTime();\r\n double duration = endTime - startTime;\r\n double numChars = iterations * (double)strlen(str);\r\n return (numChars \/ duration) \/ 1000000.0;\r\n}\r\n\r\n\r\nint WINAPI WinMain(HINSTANCE _hInstance, HINSTANCE, LPSTR cmdLine, int)\r\n{\r\n\tCreateWin(100, 100, 1024, 768, true, \"Benchmark\");\r\n TextRenderer *font = CreateTextRenderer(\"Courier\", 8);\r\n BitmapRGBA *backBmp = CreateBitmapRGBA(800, 600);\r\n\r\n ClearBitmap(g_window->backBuffer, g_colourBlack);\r\n int textY = 10;\r\n double score;\r\n\r\n \/\/ Put pixel\r\n ClearBitmap(backBmp, g_colourBlack);\r\n score = CalcMillionPixelsPerSec(backBmp);\r\n DrawTextLeft(font, g_colourWhite, g_window->backBuffer, 10, textY, \r\n \"Million putpixels per sec = %.1f\", score);\r\n textY += font->charHeight;\r\n QuickBlit(g_window->backBuffer, 400, 100, backBmp);\r\n AdvanceWin();\r\n if (g_window->windowClosed || g_inputManager.keyDowns[KEY_ESC]) return 0;\r\n\r\n \/\/ Line draw\r\n ClearBitmap(backBmp, g_colourBlack);\r\n score = CalcMillionLinePixelsPerSec(backBmp);\r\n DrawTextLeft(font, g_colourWhite, g_window->backBuffer, 10, textY,\r\n \"Million line pixels per sec = %.2f\", score);\r\n textY += font->charHeight;\r\n QuickBlit(g_window->backBuffer, 400, 200, backBmp);\r\n AdvanceWin();\r\n if (g_window->windowClosed || g_inputManager.keyDowns[KEY_ESC]) return 0;\r\n\r\n \/\/ Rect fill\r\n ClearBitmap(backBmp, g_colourBlack);\r\n score = CalcBillionRectFillPixelsPerSec(backBmp);\r\n DrawTextLeft(font, g_colourWhite, g_window->backBuffer, 10, textY, \r\n \"Rectfill billion pixels per sec = %.2f\", score);\r\n textY += font->charHeight;\r\n QuickBlit(g_window->backBuffer, 400, 300, backBmp);\r\n AdvanceWin();\r\n if (g_window->windowClosed || g_inputManager.keyDowns[KEY_ESC]) return 0;\r\n\r\n \/\/ Text render\r\n ClearBitmap(backBmp, g_colourBlack);\r\n score = CalcMillionCharsPerSec(backBmp, font);\r\n DrawTextLeft(font, g_colourWhite, g_window->backBuffer, 10, textY, \r\n \"Million chars per sec = %.2f\", score);\r\n textY += font->charHeight;\r\n QuickBlit(g_window->backBuffer, 400, 400, backBmp);\r\n AdvanceWin();\r\n if (g_window->windowClosed || g_inputManager.keyDowns[KEY_ESC]) return 0;\r\n\r\n DrawTextLeft(font, g_colourWhite, g_window->backBuffer, 10, textY,\r\n \"Press ESC to quit\");\r\n\r\n while (!g_window->windowClosed && !g_inputManager.keyDowns[KEY_ESC])\r\n {\r\n AdvanceWin();\r\n Sleep(100);\r\n }\r\n}\r\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 \"..\/tasking_system_handle.h\"\n\n\/\/ tasking system internals\n#if defined(OSPRAY_TASKING_TBB)\n# include <tbb\/task_arena.h>\n# include <tbb\/task_scheduler_init.h>\n#elif defined(OSPRAY_TASKING_CILK)\n# include <cilk\/cilk_api.h>\n#elif defined(OSPRAY_TASKING_OMP)\n# include <omp.h>\n#elif defined(OSPRAY_TASKING_INTERNAL)\n# include \"TaskSys.h\"\n#endif\n\n#include <thread>\n\n#include \"..\/..\/intrinsics.h\"\n#include \"..\/..\/common.h\"\n\nnamespace ospcommon {\n namespace tasking {\n\n struct tasking_system_handle\n {\n tasking_system_handle(int numThreads) :\n numThreads(numThreads)\n#if defined(OSPRAY_TASKING_TBB)\n , tbb_init(numThreads)\n#endif\n {\n#if defined(OSPRAY_TASKING_CILK)\n __cilkrts_set_param(\"nworkers\", std::to_string(numThreads).c_str());\n#elif defined(OSPRAY_TASKING_OMP)\n if (numThreads > 0) omp_set_num_threads(numThreads);\n#elif defined(OSPRAY_TASKING_INTERNAL)\n detail::initTaskSystemInternal(numThreads < 0 ? -1 : numThreads);\n#endif\n }\n\n int num_threads()\n {\n#if defined(OSPRAY_TASKING_TBB)\n# if TBB_INTERFACE_VERSION >= 9100\n return tbb::this_task_arena::max_concurrency();\n# else\n return tbb::task_scheduler_init::default_num_threads();\n# endif\n#elif defined(OSPRAY_TASKING_CILK)\n return numThreads >= 0 ? numThreads : std::thread::hardware_concurrency();\n#elif defined(OSPRAY_TASKING_OMP)\n int threads = 0;\n #pragma omp parallel\n {\n threads = omp_get_num_threads();\n }\n return threads;\n#elif defined(OSPRAY_TASKING_INTERNAL)\n return detail::numThreadsTaskSystemInternal();\n#endif\n }\n\n int numThreads {-1};\n#if defined(OSPRAY_TASKING_TBB)\n tbb::task_scheduler_init tbb_init;\n#endif\n };\n\n static std::unique_ptr<tasking_system_handle> g_tasking_handle;\n\n void initTaskingSystem(int numThreads)\n {\n _MM_SET_FLUSH_ZERO_MODE(_MM_FLUSH_ZERO_ON);\n _MM_SET_DENORMALS_ZERO_MODE(_MM_DENORMALS_ZERO_ON);\n\n#if defined(OSPRAY_TASKING_TBB)\n if (!g_tasking_handle.get())\n g_tasking_handle = make_unique<tasking_system_handle>(numThreads);\n else {\n g_tasking_handle->tbb_init.terminate();\n g_tasking_handle->tbb_init.initialize(numThreads);\n }\n#else\n g_tasking_handle = make_unique<tasking_system_handle>(numThreads);\n#endif\n }\n\n int numTaskingThreads()\n {\n if (!g_tasking_handle.get())\n return 0;\n else\n return g_tasking_handle->num_threads();\n }\n\n void deAffinitizeCores()\n {\n#ifdef __linux__\n cpu_set_t validCores;\n CPU_ZERO(&validCores);\n for (int i=0;i<CPU_SETSIZE;i++)\n CPU_SET(i,&validCores);\n int rc = sched_setaffinity(getpid(),sizeof(validCores),&validCores);\n if (rc != 0) throw std::runtime_error(\"Error setting thread affinity!\");\n#endif\n }\n\n } \/\/ ::ospcommon::tasking\n} \/\/ ::ospcommon\n<commit_msg>fix for bad code path with Debug tasking system<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 \"..\/tasking_system_handle.h\"\n\n\/\/ tasking system internals\n#if defined(OSPRAY_TASKING_TBB)\n# include <tbb\/task_arena.h>\n# include <tbb\/task_scheduler_init.h>\n#elif defined(OSPRAY_TASKING_CILK)\n# include <cilk\/cilk_api.h>\n#elif defined(OSPRAY_TASKING_OMP)\n# include <omp.h>\n#elif defined(OSPRAY_TASKING_INTERNAL)\n# include \"TaskSys.h\"\n#endif\n\n#include <thread>\n\n#include \"..\/..\/intrinsics.h\"\n#include \"..\/..\/common.h\"\n\nnamespace ospcommon {\n namespace tasking {\n\n struct tasking_system_handle\n {\n tasking_system_handle(int numThreads) :\n numThreads(numThreads)\n#if defined(OSPRAY_TASKING_TBB)\n , tbb_init(numThreads)\n#endif\n {\n#if defined(OSPRAY_TASKING_CILK)\n __cilkrts_set_param(\"nworkers\", std::to_string(numThreads).c_str());\n#elif defined(OSPRAY_TASKING_OMP)\n if (numThreads > 0) omp_set_num_threads(numThreads);\n#elif defined(OSPRAY_TASKING_INTERNAL)\n detail::initTaskSystemInternal(numThreads < 0 ? -1 : numThreads);\n#endif\n }\n\n int num_threads()\n {\n#if defined(OSPRAY_TASKING_TBB)\n# if TBB_INTERFACE_VERSION >= 9100\n return tbb::this_task_arena::max_concurrency();\n# else\n return tbb::task_scheduler_init::default_num_threads();\n# endif\n#elif defined(OSPRAY_TASKING_CILK)\n return numThreads >= 0 ? numThreads : std::thread::hardware_concurrency();\n#elif defined(OSPRAY_TASKING_OMP)\n int threads = 0;\n #pragma omp parallel\n {\n threads = omp_get_num_threads();\n }\n return threads;\n#elif defined(OSPRAY_TASKING_INTERNAL)\n return detail::numThreadsTaskSystemInternal();\n#else\n return 0;\n#endif\n }\n\n int numThreads {-1};\n#if defined(OSPRAY_TASKING_TBB)\n tbb::task_scheduler_init tbb_init;\n#endif\n };\n\n static std::unique_ptr<tasking_system_handle> g_tasking_handle;\n\n void initTaskingSystem(int numThreads)\n {\n _MM_SET_FLUSH_ZERO_MODE(_MM_FLUSH_ZERO_ON);\n _MM_SET_DENORMALS_ZERO_MODE(_MM_DENORMALS_ZERO_ON);\n\n#if defined(OSPRAY_TASKING_TBB)\n if (!g_tasking_handle.get())\n g_tasking_handle = make_unique<tasking_system_handle>(numThreads);\n else {\n g_tasking_handle->tbb_init.terminate();\n g_tasking_handle->tbb_init.initialize(numThreads);\n }\n#else\n g_tasking_handle = make_unique<tasking_system_handle>(numThreads);\n#endif\n }\n\n int numTaskingThreads()\n {\n if (!g_tasking_handle.get())\n return 0;\n else\n return g_tasking_handle->num_threads();\n }\n\n void deAffinitizeCores()\n {\n#ifdef __linux__\n cpu_set_t validCores;\n CPU_ZERO(&validCores);\n for (int i=0;i<CPU_SETSIZE;i++)\n CPU_SET(i,&validCores);\n int rc = sched_setaffinity(getpid(),sizeof(validCores),&validCores);\n if (rc != 0) throw std::runtime_error(\"Error setting thread affinity!\");\n#endif\n }\n\n } \/\/ ::ospcommon::tasking\n} \/\/ ::ospcommon\n<|endoftext|>"} {"text":"<commit_before>\/**\n * ClassInfo.cpp\n *\n * Implementation for the class info\n *\n * @author Emiel Bruijntjes <emiel.bruijntjes@copernica.com>\n * @copyright 2013 Copernica BV\n *\/\n#include \"includes.h\"\n\n\/**\n * Set up namespace\n *\/\nnamespace Php {\n\n\/**\n * Function that is called to clean up space that is occupied by the object\n * @param object The object to be deallocated\n *\/\nstatic void deallocate_object(void *object TSRMLS_DC)\n{\n \/\/ allocate memory for the object\n MixedObject *obj = (MixedObject *)object;\n \n \/\/ deallocate the cpp object\n if (obj->cpp) delete obj->cpp;\n \n \/\/ get rid of the object properties\n\t\/\/ @todo if we enable the following two lines, segmentation\n\t\/\/\t\tfaults and memory corruption occurs. however, the online\n\t\/\/\t\tdocumentation does it like this\n \/\/zend_hash_destroy(obj->php.properties);\n \/\/FREE_HASHTABLE(obj->php.properties);\n\n \/\/ deallocate the entire object\n efree(obj);\n}\n\n\/**\n * Function that is called to create space for a cloned object\n * @param object The object to be cloned\n * @param clone The address that should become the clone\n *\/\nstatic void clone_object(void *object, void **clone TSRMLS_DC)\n{\n std::cout << \"clone_object\" << std::endl;\n \n \/\/ @todo implementation\n}\n\n\/**\n * Function that is called when an instance of the class needs to be created.\n * This function will create the C++ class, and the PHP object\n * @param type Pointer to the class\n *\/\nstatic zend_object_value create_object(zend_class_entry *type TSRMLS_DC)\n{\n \/\/ allocate memory for the object\n MixedObject *object = (MixedObject *)emalloc(sizeof(MixedObject));\n \n \/\/ find base object\n zend_class_entry *base = type;\n while (base->parent) base = base->parent;\n \n \/\/ retrieve the classinfo object\n _ClassInfo *info = (_ClassInfo *)base->info.user.doc_comment;\n \n \/\/ store the class\n object->php.ce = type;\n\n \/\/ the original create_object fills the initial object with the default properties,\n \/\/ we're going to do exactly the same. start with setting up a hashtable for the props\n ALLOC_HASHTABLE(object->php.properties);\n\n \/\/ initialize the hash table\n zend_hash_init(object->php.properties, 0, NULL, ZVAL_PTR_DTOR, 0);\n \n \/\/ initialize the properties\n object_properties_init(&(object->php), type);\n\n \/\/ the thing we're going to return\n zend_object_value result;\n\n \/\/ use default object handlers\n result.handlers = zend_get_std_object_handlers();\n \n \/\/ put the object in the storage, and assign a method for deallocating and cloning\n result.handle = zend_objects_store_put(object, NULL, deallocate_object, clone_object TSRMLS_CC); \n\n \/\/ finally, construct the cpp object\n object->cpp = info->construct();\n\n std::cout << \"Allocate object\" << std::endl;\n std::cout << object->cpp << \" \" << object << std::endl;\n\n \/\/ done\n return result;\n}\n\n\/**\n * Constructor\n * @param name\n *\/\n_ClassInfo::_ClassInfo(const char *name) : _name(name), _entry(NULL) \n{\n}\n\n\/**\n * Destructor\n *\/\n_ClassInfo::~_ClassInfo() \n{\n}\n\n\/**\n * Initialize the class\n * @param mixed Optional threading ID \n *\/\nvoid _ClassInfo::initialize(TSRMLS_DC)\n{\n \/\/ the class entry\n zend_class_entry entry;\n\n \/\/ initialize the class entry\n INIT_CLASS_ENTRY_EX(entry, _name.c_str(), _name.size(), methods());\n\n \/\/ we need a special constructor\n entry.create_object = create_object;\n \n \/\/ register the class\n _entry = zend_register_internal_class(&entry TSRMLS_CC);\n\n \/\/ store pointer to the class in the unused doc_comment member\n _entry->info.user.doc_comment = (const char *)this;\n \n \/\/ initialize the entry\n initialize(_entry);\n}\n\n\/**\n * End of namespace\n *\/\n}\n \n<commit_msg>Merging master into ExampleUpdates Branch Merge branch 'master' of github.com:EmielBruijntjes\/PHP-CPP into ExampleUpdates<commit_after>\/**\n * ClassInfo.cpp\n *\n * Implementation for the class info\n *\n * @author Emiel Bruijntjes <emiel.bruijntjes@copernica.com>\n * @copyright 2013 Copernica BV\n *\/\n#include \"includes.h\"\n\n\/**\n * Set up namespace\n *\/\nnamespace Php {\n\n\/**\n * Function that is called to clean up space that is occupied by the object\n * @param object The object to be deallocated\n *\/\nstatic void deallocate_object(void *object TSRMLS_DC)\n{\n \/\/ allocate memory for the object\n MixedObject *obj = (MixedObject *)object;\n \n \/\/ deallocate the cpp object\n if (obj->cpp) delete obj->cpp;\n \n \/\/ get rid of the object properties\n\t\/\/ @todo if we enable the following two lines, segmentation\n\t\/\/\t\tfaults and memory corruption occurs. however, the online\n\t\/\/\t\tdocumentation does it like this\n \/\/zend_hash_destroy(obj->php.properties);\n \/\/FREE_HASHTABLE(obj->php.properties);\n\n \/\/ deallocate the entire object\n efree(obj);\n}\n\n\/**\n * Function that is called to create space for a cloned object\n * @param object The object to be cloned\n * @param clone The address that should become the clone\n *\/\nstatic void clone_object(void *object, void **clone TSRMLS_DC)\n{\n \/\/ @todo implementation\n}\n\n\/**\n * Function that is called when an instance of the class needs to be created.\n * This function will create the C++ class, and the PHP object\n * @param type Pointer to the class\n *\/\nstatic zend_object_value create_object(zend_class_entry *type TSRMLS_DC)\n{\n \/\/ allocate memory for the object\n MixedObject *object = (MixedObject *)emalloc(sizeof(MixedObject));\n \n \/\/ find base object\n zend_class_entry *base = type;\n while (base->parent) base = base->parent;\n \n \/\/ retrieve the classinfo object\n _ClassInfo *info = (_ClassInfo *)base->info.user.doc_comment;\n \n \/\/ store the class\n object->php.ce = type;\n\n \/\/ the original create_object fills the initial object with the default properties,\n \/\/ we're going to do exactly the same. start with setting up a hashtable for the props\n ALLOC_HASHTABLE(object->php.properties);\n\n \/\/ initialize the hash table\n zend_hash_init(object->php.properties, 0, NULL, ZVAL_PTR_DTOR, 0);\n \n \/\/ initialize the properties\n object_properties_init(&(object->php), type);\n\n \/\/ the thing we're going to return\n zend_object_value result;\n\n \/\/ use default object handlers\n result.handlers = zend_get_std_object_handlers();\n \n \/\/ put the object in the storage, and assign a method for deallocating and cloning\n result.handle = zend_objects_store_put(object, NULL, deallocate_object, clone_object TSRMLS_CC); \n\n \/\/ finally, construct the cpp object\n object->cpp = info->construct();\n\n \/\/ done\n return result;\n}\n\n\/**\n * Constructor\n * @param name\n *\/\n_ClassInfo::_ClassInfo(const char *name) : _name(name), _entry(NULL) \n{\n}\n\n\/**\n * Destructor\n *\/\n_ClassInfo::~_ClassInfo() \n{\n}\n\n\/**\n * Initialize the class\n * @param mixed Optional threading ID \n *\/\nvoid _ClassInfo::initialize(TSRMLS_DC)\n{\n \/\/ the class entry\n zend_class_entry entry;\n\n \/\/ initialize the class entry\n INIT_CLASS_ENTRY_EX(entry, _name.c_str(), _name.size(), methods());\n\n \/\/ we need a special constructor\n entry.create_object = create_object;\n \n \/\/ register the class\n _entry = zend_register_internal_class(&entry TSRMLS_CC);\n\n \/\/ store pointer to the class in the unused doc_comment member\n _entry->info.user.doc_comment = (const char *)this;\n \n \/\/ initialize the entry\n initialize(_entry);\n}\n\n\/**\n * End of namespace\n *\/\n}\n \n<|endoftext|>"} {"text":"<commit_before>\/*=========================================================================\n *\n * Copyright Insight Software Consortium\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http:\/\/www.apache.org\/licenses\/LICENSE-2.0.txt\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n *\n *=========================================================================*\/\n\n#include \"itkRegularExpressionSeriesFileNames.h\"\n\nint itkRegularExpressionSeriesFileNamesTest(int ac, char* av[])\n{\n\n if(ac < 2)\n {\n std::cerr << \"Usage: \" << av[0] << \" Directory\\n\";\n return EXIT_FAILURE;\n }\n\n\n itk::RegularExpressionSeriesFileNames::Pointer fit = itk::RegularExpressionSeriesFileNames::New();\n fit->SetDirectory(av[1]);\n fit->SetRegularExpression(\"[^.]*.(.*)\");\n fit->SetSubMatch(1);\n\n std::vector<std::string> names = fit->GetFileNames();\n std::vector<std::string>::iterator nit;\n\n\/\/ normal sort\n std::cout << \"Normal Sort--------\" << std::endl;\n for (nit = names.begin();\n nit != names.end();\n ++nit)\n {\n std::cout << \"File: \" << (*nit).c_str() << std::endl;\n }\n\n\/\/ numeric sort\n fit->SetRegularExpression(\"[^0-9]*([0-9]*)\");\n fit->NumericSortOn();\n fit->SetSubMatch(1);\n names = fit->GetFileNames();\n std::cout << \"Numeric Sort--------\" << std::endl;\n for (nit = names.begin();\n nit != names.end();\n ++nit)\n {\n std::cout << \"File: \" << (*nit).c_str() << std::endl;\n }\n\n std::cout << fit;\n\n \/\/ Show only those files with numbers in the names\n fit->SetRegularExpression(\"([0-9]+)\");\n fit->NumericSortOn();\n fit->SetSubMatch(1);\n names = fit->GetFileNames();\n std::cout << \"Numeric sort on only files with numbers in the names--------\" << std::endl;\n for (nit = names.begin();\n nit != names.end();\n ++nit)\n {\n std::cout << \"File: \" << (*nit).c_str() << std::endl;\n }\n\n\n std::cout << \"Vector size: \" << names.size() << std::endl;\n\n \/\/ Show only those files with numbers in the names followed by other\n \/\/ numbers. Sort them by the first set of numbers.\n fit->SetRegularExpression(\"([0-9]+)[^0-9]+([0-9]+)\");\n fit->NumericSortOn();\n fit->SetSubMatch(1);\n names = fit->GetFileNames();\n std::cout << \"Numeric sort on only files with numbers in the names. Sort on the first set of numbers.--------\" << std::endl;\n for (nit = names.begin();\n nit != names.end();\n ++nit)\n {\n std::cout << \"File: \" << (*nit).c_str() << std::endl;\n }\n\n \/\/ Show only those files with numbers in the names followed by other\n \/\/ numbers. Sort them by the second set of numbers.\n fit->SetRegularExpression(\"([0-9]+)[^0-9]+([0-9]+)\");\n fit->NumericSortOn();\n fit->SetSubMatch(2);\n names = fit->GetFileNames();\n std::cout << \"Numeric sort on only files with numbers in the names. Sort on the second set of numbers.--------\" << std::endl;\n for (nit = names.begin();\n nit != names.end();\n ++nit)\n {\n std::cout << \"File: \" << (*nit).c_str() << std::endl;\n }\n\n\n std::cout << \"Vector size: \" << names.size() << std::endl;\n\n std::cout << \"Directory: \" << fit->GetDirectory() << std::endl;\n std::cout << \"RegularExpression: \" << fit->GetRegularExpression() << std::endl;\n std::cout << \"SubMatch: \" << fit->GetSubMatch() << std::endl;\n\n\n return EXIT_SUCCESS;\n\n}\n<commit_msg>BUG: Remove error prone test 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#include \"itkRegularExpressionSeriesFileNames.h\"\n\nint itkRegularExpressionSeriesFileNamesTest(int ac, char* av[])\n{\n\n if(ac < 2)\n {\n std::cerr << \"Usage: \" << av[0] << \" Directory\\n\";\n return EXIT_FAILURE;\n }\n\n\n itk::RegularExpressionSeriesFileNames::Pointer fit = itk::RegularExpressionSeriesFileNames::New();\n fit->SetDirectory(av[1]);\n fit->SetRegularExpression(\"[^.]*.(.*)\");\n fit->SetSubMatch(1);\n\n std::vector<std::string> names = fit->GetFileNames();\n std::vector<std::string>::iterator nit;\n\n\/\/ normal sort\n std::cout << \"Normal Sort--------\" << std::endl;\n for (nit = names.begin();\n nit != names.end();\n ++nit)\n {\n std::cout << \"File: \" << (*nit).c_str() << std::endl;\n }\n\n \/\/ Show only those files with numbers in the names\n fit->SetRegularExpression(\"([0-9]+)\");\n fit->NumericSortOn();\n fit->SetSubMatch(1);\n names = fit->GetFileNames();\n std::cout << \"Numeric sort on only files with numbers in the names--------\" << std::endl;\n for (nit = names.begin();\n nit != names.end();\n ++nit)\n {\n std::cout << \"File: \" << (*nit).c_str() << std::endl;\n }\n\n\n std::cout << \"Vector size: \" << names.size() << std::endl;\n\n \/\/ Show only those files with numbers in the names followed by other\n \/\/ numbers. Sort them by the first set of numbers.\n fit->SetRegularExpression(\"([0-9]+)[^0-9]+([0-9]+)\");\n fit->NumericSortOn();\n fit->SetSubMatch(1);\n names = fit->GetFileNames();\n std::cout << \"Numeric sort on only files with numbers in the names. Sort on the first set of numbers.--------\" << std::endl;\n for (nit = names.begin();\n nit != names.end();\n ++nit)\n {\n std::cout << \"File: \" << (*nit).c_str() << std::endl;\n }\n\n \/\/ Show only those files with numbers in the names followed by other\n \/\/ numbers. Sort them by the second set of numbers.\n fit->SetRegularExpression(\"([0-9]+)[^0-9]+([0-9]+)\");\n fit->NumericSortOn();\n fit->SetSubMatch(2);\n names = fit->GetFileNames();\n std::cout << \"Numeric sort on only files with numbers in the names. Sort on the second set of numbers.--------\" << std::endl;\n for (nit = names.begin();\n nit != names.end();\n ++nit)\n {\n std::cout << \"File: \" << (*nit).c_str() << std::endl;\n }\n\n\n std::cout << \"Vector size: \" << names.size() << std::endl;\n\n std::cout << \"Directory: \" << fit->GetDirectory() << std::endl;\n std::cout << \"RegularExpression: \" << fit->GetRegularExpression() << std::endl;\n std::cout << \"SubMatch: \" << fit->GetSubMatch() << std::endl;\n\n\n return EXIT_SUCCESS;\n\n}\n<|endoftext|>"} {"text":"<commit_before>\/\/ Copyright 2015-2020 Elviss Strazdins. All rights reserved.\n\n#include <cstring>\n#include \"WaveLoader.hpp\"\n#include \"Bundle.hpp\"\n#include \"..\/audio\/PcmClip.hpp\"\n#include \"..\/core\/Engine.hpp\"\n\nnamespace\n{\n constexpr std::uint16_t WAVE_FORMAT_PCM = 1;\n constexpr std::uint16_t WAVE_FORMAT_IEEE_FLOAT = 3;\n}\n\nnamespace ouzel::assets\n{\n WaveLoader::WaveLoader(Cache& initCache):\n Loader(initCache, Type::sound)\n {\n }\n\n bool WaveLoader::loadAsset(Bundle& bundle,\n const std::string& name,\n const std::vector<std::byte>& data,\n bool)\n {\n try\n {\n std::uint32_t channels = 0;\n std::uint32_t sampleRate = 0;\n\n const std::size_t formatOffset = 0;\n\n if (data.size() < 12) \/\/ RIFF + size + WAVE\n throw std::runtime_error(\"Failed to load sound file, file too small\");\n\n if (static_cast<char>(data[formatOffset + 0]) != 'R' ||\n static_cast<char>(data[formatOffset + 1]) != 'I' ||\n static_cast<char>(data[formatOffset + 2]) != 'F' ||\n static_cast<char>(data[formatOffset + 3]) != 'F')\n throw std::runtime_error(\"Failed to load sound file, not a RIFF format\");\n\n const std::size_t lengthOffset = formatOffset + 4;\n\n const auto length = static_cast<std::uint32_t>(data[lengthOffset + 0]) |\n static_cast<std::uint32_t>(data[lengthOffset + 1] << 8) |\n static_cast<std::uint32_t>(data[lengthOffset + 2] << 16) |\n static_cast<std::uint32_t>(data[lengthOffset + 3] << 24);\n\n const std::size_t typeOffset = lengthOffset + 4;\n\n if (data.size() < typeOffset + length)\n throw std::runtime_error(\"Failed to load sound file, size mismatch\");\n\n if (length < 4 ||\n static_cast<char>(data[typeOffset + 0]) != 'W' ||\n static_cast<char>(data[typeOffset + 1]) != 'A' ||\n static_cast<char>(data[typeOffset + 2]) != 'V' ||\n static_cast<char>(data[typeOffset + 3]) != 'E')\n throw std::runtime_error(\"Failed to load sound file, not a WAVE file\");\n\n std::uint16_t bitsPerSample = 0;\n std::uint16_t formatTag = 0;\n std::vector<std::byte> soundData;\n\n for (std::size_t offset = typeOffset + 4; offset < data.size();)\n {\n if (data.size() < offset + 8)\n throw std::runtime_error(\"Failed to load sound file, not enough data to read chunk\");\n\n const std::byte chunkHeader[4] = {\n data[offset + 0],\n data[offset + 1],\n data[offset + 2],\n data[offset + 3]\n };\n\n offset += 4;\n\n const auto chunkSize = static_cast<std::uint32_t>(data[offset + 0]) |\n (static_cast<std::uint32_t>(data[offset + 1]) << 8) |\n (static_cast<std::uint32_t>(data[offset + 2]) << 16) |\n (static_cast<std::uint32_t>(data[offset + 3]) << 24);\n\n offset += 4;\n\n if (data.size() < offset + chunkSize)\n throw std::runtime_error(\"Failed to load sound file, not enough data to read chunk\");\n\n if (static_cast<char>(chunkHeader[0]) == 'f' &&\n static_cast<char>(chunkHeader[1]) == 'm' &&\n static_cast<char>(chunkHeader[2]) == 't' &&\n static_cast<char>(chunkHeader[3]) == ' ')\n {\n if (chunkSize < 16)\n throw std::runtime_error(\"Failed to load sound file, not enough data to read chunk\");\n\n const std::size_t formatTagOffset = offset;\n\n formatTag = static_cast<std::uint16_t>(static_cast<std::uint32_t>(data[formatTagOffset + 0]) |\n (static_cast<std::uint32_t>(data[formatTagOffset + 1]) << 8));\n\n if (formatTag != WAVE_FORMAT_PCM && formatTag != WAVE_FORMAT_IEEE_FLOAT)\n throw std::runtime_error(\"Failed to load sound file, unsupported format\");\n\n const std::size_t channelsOffset = formatTagOffset + 2;\n channels = static_cast<std::uint32_t>(data[channelsOffset + 0]) |\n (static_cast<std::uint32_t>(data[channelsOffset + 1]) << 8);\n\n if (!channels)\n throw std::runtime_error(\"Failed to load sound file, invalid channel count\");\n\n const std::size_t sampleRateOffset = channelsOffset + 2;\n sampleRate = static_cast<std::uint32_t>(data[sampleRateOffset + 0]) |\n (static_cast<std::uint32_t>(data[sampleRateOffset + 1]) << 8) |\n (static_cast<std::uint32_t>(data[sampleRateOffset + 2]) << 16) |\n (static_cast<std::uint32_t>(data[sampleRateOffset + 3]) << 24);\n\n if (!sampleRate)\n throw std::runtime_error(\"Failed to load sound file, invalid sample rate\");\n\n const std::size_t byteRateOffset = sampleRateOffset + 4;\n const std::size_t blockAlignOffset = byteRateOffset + 4;\n const std::size_t bitsPerSampleOffset = blockAlignOffset + 2;\n bitsPerSample = static_cast<std::uint16_t>(static_cast<std::uint32_t>(data[bitsPerSampleOffset + 0]) |\n static_cast<std::uint32_t>(data[bitsPerSampleOffset + 1] << 8));\n\n if (bitsPerSample != 8 && bitsPerSample != 16 &&\n bitsPerSample != 24 && bitsPerSample != 32)\n throw std::runtime_error(\"Failed to load sound file, unsupported bit depth\");\n }\n else if (static_cast<char>(chunkHeader[0]) == 'd' &&\n static_cast<char>(chunkHeader[1]) == 'a' &&\n static_cast<char>(chunkHeader[2]) == 't' &&\n static_cast<char>(chunkHeader[3]) == 'a')\n soundData.assign(data.begin() + static_cast<int>(offset), data.begin() + static_cast<int>(offset + chunkSize));\n\n \/\/ padding\n offset += ((chunkSize + 1) & 0xFFFFFFFE);\n }\n\n if (!formatTag)\n throw std::runtime_error(\"Failed to load sound file, failed to find a format chunk\");\n\n if (data.empty())\n throw std::runtime_error(\"Failed to load sound file, failed to find a data chunk\");\n\n const auto sampleCount = static_cast<std::uint32_t>(soundData.size() \/ (bitsPerSample \/ 8));\n const auto frames = sampleCount \/ channels;\n std::vector<float> samples(sampleCount);\n\n if (formatTag == WAVE_FORMAT_PCM)\n {\n switch (bitsPerSample)\n {\n case 8:\n {\n for (std::uint32_t channel = 0; channel < channels; ++channel)\n {\n float* outputChannel = &samples[channel * frames];\n\n for (std::uint32_t frame = 0; frame < frames; ++frame)\n {\n const auto* sourceData = &soundData[frame * channels + channel];\n const auto value = static_cast<std::uint8_t>(sourceData[0]);\n outputChannel[frame] = 2.0F * value \/ 255.0F - 1.0F;\n }\n }\n break;\n }\n case 16:\n {\n for (std::uint32_t channel = 0; channel < channels; ++channel)\n {\n float* outputChannel = &samples[channel * frames];\n\n for (std::uint32_t frame = 0; frame < frames; ++frame)\n {\n const auto* sourceData = &soundData[(frame * channels + channel) * 2];\n const auto value = static_cast<std::int32_t>(sourceData[0]) |\n static_cast<std::int32_t>(sourceData[1] << 8);\n outputChannel[frame] = static_cast<float>(value) \/ 32767.0F;\n }\n }\n break;\n }\n case 24:\n {\n for (std::uint32_t channel = 0; channel < channels; ++channel)\n {\n float* outputChannel = &samples[channel * frames];\n\n for (std::uint32_t frame = 0; frame < frames; ++frame)\n {\n const auto* sourceData = &soundData[(frame * channels + channel) * 3];\n const auto value = static_cast<std::int32_t>(sourceData[0] << 8) |\n static_cast<std::int32_t>(sourceData[1] << 16) |\n static_cast<std::int32_t>(sourceData[2] << 24);\n outputChannel[frame] = static_cast<float>(value \/ 2147483648.0);\n }\n }\n break;\n }\n case 32:\n {\n for (std::uint32_t channel = 0; channel < channels; ++channel)\n {\n float* outputChannel = &samples[channel * frames];\n\n for (std::uint32_t frame = 0; frame < frames; ++frame)\n {\n const auto* sourceData = &soundData[(frame * channels + channel) * 4];\n const auto value = static_cast<std::int32_t>(sourceData[0]) |\n static_cast<std::int32_t>(sourceData[1] << 8) |\n static_cast<std::int32_t>(sourceData[2] << 16) |\n static_cast<std::int32_t>(sourceData[3] << 24);\n outputChannel[frame] = static_cast<float>(value \/ 2147483648.0);\n }\n }\n break;\n }\n default:\n throw std::runtime_error(\"Failed to load sound file, unsupported bit depth\");\n }\n }\n else if (formatTag == WAVE_FORMAT_IEEE_FLOAT)\n {\n if (bitsPerSample == 32)\n {\n for (std::uint32_t channel = 0; channel < channels; ++channel)\n {\n float* outputChannel = &samples[channel * frames];\n\n for (std::uint32_t frame = 0; frame < frames; ++frame)\n {\n const auto* sourceData = &soundData[(frame * channels + channel) * 4];\n std::memcpy(&outputChannel[frame], sourceData, sizeof(float));\n }\n }\n }\n else\n throw std::runtime_error(\"Failed to load sound file, unsupported bit depth\");\n }\n\n auto sound = std::make_unique<audio::PcmClip>(*engine->getAudio(), channels, sampleRate, samples);\n bundle.setSound(name, std::move(sound));\n }\n catch (const std::exception&)\n {\n return false;\n }\n\n return true;\n }\n}\n<commit_msg>Fix the wav parser<commit_after>\/\/ Copyright 2015-2020 Elviss Strazdins. All rights reserved.\n\n#include <cstring>\n#include \"WaveLoader.hpp\"\n#include \"Bundle.hpp\"\n#include \"..\/audio\/PcmClip.hpp\"\n#include \"..\/core\/Engine.hpp\"\n\nnamespace\n{\n constexpr std::uint16_t WAVE_FORMAT_PCM = 1;\n constexpr std::uint16_t WAVE_FORMAT_IEEE_FLOAT = 3;\n}\n\nnamespace ouzel::assets\n{\n WaveLoader::WaveLoader(Cache& initCache):\n Loader(initCache, Type::sound)\n {\n }\n\n bool WaveLoader::loadAsset(Bundle& bundle,\n const std::string& name,\n const std::vector<std::byte>& data,\n bool)\n {\n try\n {\n std::uint32_t channels = 0;\n std::uint32_t sampleRate = 0;\n\n const std::size_t formatOffset = 0;\n\n if (data.size() < 12) \/\/ RIFF + size + WAVE\n throw std::runtime_error(\"Failed to load sound file, file too small\");\n\n if (static_cast<char>(data[formatOffset + 0]) != 'R' ||\n static_cast<char>(data[formatOffset + 1]) != 'I' ||\n static_cast<char>(data[formatOffset + 2]) != 'F' ||\n static_cast<char>(data[formatOffset + 3]) != 'F')\n throw std::runtime_error(\"Failed to load sound file, not a RIFF format\");\n\n const std::size_t lengthOffset = formatOffset + 4;\n\n const auto length = static_cast<std::uint32_t>(data[lengthOffset + 0]) |\n (static_cast<std::uint32_t>(data[lengthOffset + 1]) << 8) |\n (static_cast<std::uint32_t>(data[lengthOffset + 2]) << 16) |\n (static_cast<std::uint32_t>(data[lengthOffset + 3]) << 24);\n\n const std::size_t typeOffset = lengthOffset + 4;\n\n if (data.size() < typeOffset + length)\n throw std::runtime_error(\"Failed to load sound file, size mismatch\");\n\n if (length < 4 ||\n static_cast<char>(data[typeOffset + 0]) != 'W' ||\n static_cast<char>(data[typeOffset + 1]) != 'A' ||\n static_cast<char>(data[typeOffset + 2]) != 'V' ||\n static_cast<char>(data[typeOffset + 3]) != 'E')\n throw std::runtime_error(\"Failed to load sound file, not a WAVE file\");\n\n std::uint16_t bitsPerSample = 0;\n std::uint16_t formatTag = 0;\n std::vector<std::byte> soundData;\n\n for (std::size_t offset = typeOffset + 4; offset < data.size();)\n {\n if (data.size() < offset + 8)\n throw std::runtime_error(\"Failed to load sound file, not enough data to read chunk\");\n\n const std::byte chunkHeader[4] = {\n data[offset + 0],\n data[offset + 1],\n data[offset + 2],\n data[offset + 3]\n };\n\n offset += 4;\n\n const auto chunkSize = static_cast<std::uint32_t>(data[offset + 0]) |\n (static_cast<std::uint32_t>(data[offset + 1]) << 8) |\n (static_cast<std::uint32_t>(data[offset + 2]) << 16) |\n (static_cast<std::uint32_t>(data[offset + 3]) << 24);\n\n offset += 4;\n\n if (data.size() < offset + chunkSize)\n throw std::runtime_error(\"Failed to load sound file, not enough data to read chunk\");\n\n if (static_cast<char>(chunkHeader[0]) == 'f' &&\n static_cast<char>(chunkHeader[1]) == 'm' &&\n static_cast<char>(chunkHeader[2]) == 't' &&\n static_cast<char>(chunkHeader[3]) == ' ')\n {\n if (chunkSize < 16)\n throw std::runtime_error(\"Failed to load sound file, not enough data to read chunk\");\n\n const std::size_t formatTagOffset = offset;\n\n formatTag = static_cast<std::uint16_t>(static_cast<std::uint32_t>(data[formatTagOffset + 0]) |\n (static_cast<std::uint32_t>(data[formatTagOffset + 1]) << 8));\n\n if (formatTag != WAVE_FORMAT_PCM && formatTag != WAVE_FORMAT_IEEE_FLOAT)\n throw std::runtime_error(\"Failed to load sound file, unsupported format\");\n\n const std::size_t channelsOffset = formatTagOffset + 2;\n channels = static_cast<std::uint32_t>(data[channelsOffset + 0]) |\n (static_cast<std::uint32_t>(data[channelsOffset + 1]) << 8);\n\n if (!channels)\n throw std::runtime_error(\"Failed to load sound file, invalid channel count\");\n\n const std::size_t sampleRateOffset = channelsOffset + 2;\n sampleRate = static_cast<std::uint32_t>(data[sampleRateOffset + 0]) |\n (static_cast<std::uint32_t>(data[sampleRateOffset + 1]) << 8) |\n (static_cast<std::uint32_t>(data[sampleRateOffset + 2]) << 16) |\n (static_cast<std::uint32_t>(data[sampleRateOffset + 3]) << 24);\n\n if (!sampleRate)\n throw std::runtime_error(\"Failed to load sound file, invalid sample rate\");\n\n const std::size_t byteRateOffset = sampleRateOffset + 4;\n const std::size_t blockAlignOffset = byteRateOffset + 4;\n const std::size_t bitsPerSampleOffset = blockAlignOffset + 2;\n bitsPerSample = static_cast<std::uint16_t>(static_cast<std::uint32_t>(data[bitsPerSampleOffset + 0]) |\n (static_cast<std::uint32_t>(data[bitsPerSampleOffset + 1]) << 8));\n\n if (bitsPerSample != 8 && bitsPerSample != 16 &&\n bitsPerSample != 24 && bitsPerSample != 32)\n throw std::runtime_error(\"Failed to load sound file, unsupported bit depth\");\n }\n else if (static_cast<char>(chunkHeader[0]) == 'd' &&\n static_cast<char>(chunkHeader[1]) == 'a' &&\n static_cast<char>(chunkHeader[2]) == 't' &&\n static_cast<char>(chunkHeader[3]) == 'a')\n soundData.assign(data.begin() + static_cast<int>(offset), data.begin() + static_cast<int>(offset + chunkSize));\n\n \/\/ padding\n offset += ((chunkSize + 1) & 0xFFFFFFFE);\n }\n\n if (!formatTag)\n throw std::runtime_error(\"Failed to load sound file, failed to find a format chunk\");\n\n if (data.empty())\n throw std::runtime_error(\"Failed to load sound file, failed to find a data chunk\");\n\n const auto sampleCount = static_cast<std::uint32_t>(soundData.size() \/ (bitsPerSample \/ 8));\n const auto frames = sampleCount \/ channels;\n std::vector<float> samples(sampleCount);\n\n if (formatTag == WAVE_FORMAT_PCM)\n {\n switch (bitsPerSample)\n {\n case 8:\n {\n for (std::uint32_t channel = 0; channel < channels; ++channel)\n {\n float* outputChannel = &samples[channel * frames];\n\n for (std::uint32_t frame = 0; frame < frames; ++frame)\n {\n const auto* sourceData = &soundData[frame * channels + channel];\n const auto value = static_cast<std::uint8_t>(sourceData[0]);\n outputChannel[frame] = 2.0F * value \/ 255.0F - 1.0F;\n }\n }\n break;\n }\n case 16:\n {\n for (std::uint32_t channel = 0; channel < channels; ++channel)\n {\n float* outputChannel = &samples[channel * frames];\n\n for (std::uint32_t frame = 0; frame < frames; ++frame)\n {\n const auto* sourceData = &soundData[(frame * channels + channel) * 2];\n const auto value = static_cast<std::int32_t>(sourceData[0]) |\n (static_cast<std::int32_t>(sourceData[1]) << 8);\n outputChannel[frame] = static_cast<float>(value) \/ 32767.0F;\n }\n }\n break;\n }\n case 24:\n {\n for (std::uint32_t channel = 0; channel < channels; ++channel)\n {\n float* outputChannel = &samples[channel * frames];\n\n for (std::uint32_t frame = 0; frame < frames; ++frame)\n {\n const auto* sourceData = &soundData[(frame * channels + channel) * 3];\n const auto value = (static_cast<std::int32_t>(sourceData[0]) << 8) |\n (static_cast<std::int32_t>(sourceData[1]) << 16) |\n (static_cast<std::int32_t>(sourceData[2]) << 24);\n outputChannel[frame] = static_cast<float>(value \/ 2147483648.0);\n }\n }\n break;\n }\n case 32:\n {\n for (std::uint32_t channel = 0; channel < channels; ++channel)\n {\n float* outputChannel = &samples[channel * frames];\n\n for (std::uint32_t frame = 0; frame < frames; ++frame)\n {\n const auto* sourceData = &soundData[(frame * channels + channel) * 4];\n const auto value = static_cast<std::int32_t>(sourceData[0]) |\n (static_cast<std::int32_t>(sourceData[1]) << 8) |\n (static_cast<std::int32_t>(sourceData[2]) << 16) |\n (static_cast<std::int32_t>(sourceData[3]) << 24);\n outputChannel[frame] = static_cast<float>(value \/ 2147483648.0);\n }\n }\n break;\n }\n default:\n throw std::runtime_error(\"Failed to load sound file, unsupported bit depth\");\n }\n }\n else if (formatTag == WAVE_FORMAT_IEEE_FLOAT)\n {\n if (bitsPerSample == 32)\n {\n for (std::uint32_t channel = 0; channel < channels; ++channel)\n {\n float* outputChannel = &samples[channel * frames];\n\n for (std::uint32_t frame = 0; frame < frames; ++frame)\n {\n const auto* sourceData = &soundData[(frame * channels + channel) * 4];\n std::memcpy(&outputChannel[frame], sourceData, sizeof(float));\n }\n }\n }\n else\n throw std::runtime_error(\"Failed to load sound file, unsupported bit depth\");\n }\n\n auto sound = std::make_unique<audio::PcmClip>(*engine->getAudio(), channels, sampleRate, samples);\n bundle.setSound(name, std::move(sound));\n }\n catch (const std::exception&)\n {\n return false;\n }\n\n return true;\n }\n}\n<|endoftext|>"} {"text":"<commit_before>#include \"occaParser.hpp\"\n\nnamespace occa {\n namespace parserNamespace {\n _qualifierInfo::_qualifierInfo() :\n qualifierCount(0),\n qualifiers(NULL) {}\n\n _qualifierInfo::_qualifierInfo(const _qualifierInfo &q) :\n qualifierCount(q.qualifierCount),\n qualifiers(q.qualifiers) {}\n\n _qualifierInfo& _qualifierInfo::operator = (const _qualifierInfo &q){\n qualifierCount = q.qualifierCount;\n qualifiers = q.qualifiers;\n\n return *this;\n }\n\n _qualifierInfo _qualifierInfo::clone(){\n _qualifierInfo q;\n\n q.qualifierCount = qualifierCount;\n\n q.qualifiers = new std::string[qualifierCount];\n\n for(int i = 0; i < qualifierCount; ++i)\n q.qualifiers[i] = qualifiers[i];\n\n return q;\n }\n\n strNode* _qualifierInfo::loadFrom(statement &s,\n strNode *nodePos){\n strNode *nodeRoot = nodePos;\n\n while(nodePos &&\n s.nodeHasQualifier(nodePos)){\n ++qualifierCount;\n nodePos = nodePos->right;\n }\n\n if(qualifierCount){\n qualifiers = new std::string[qualifierCount];\n nodePos = nodeRoot;\n\n for(int i = 0; i < qualifierCount; ++i){\n qualifiers[i] = nodePos->value;\n nodePos = nodePos->right;\n }\n }\n\n return nodePos;\n }\n\n std::string _qualifierInfo::toString(){\n std::string ret;\n\n for(int i = 0; i < qualifierCount; ++i){\n ret += qualifiers[i];\n\n if((qualifiers[i][0] != '*') ||\n ( ((i + 1) < qualifierCount) &&\n (qualifiers[i + 1][0] != '*') )){\n\n ret += ' ';\n }\n }\n\n return ret;\n }\n\n _varInfo::_varInfo() :\n info(0),\n\n leftQualifiers(),\n rightQualifiers(),\n\n baseType(NULL),\n\n name(\"\"),\n\n pointerCount(0),\n stackPointerCount(0),\n stackExpRoots(NULL),\n\n argumentCount(0),\n argumentVarInfos(NULL),\n\n functionNestCount(0),\n functionNests(NULL) {}\n\n _varInfo::_varInfo(const _varInfo &var) :\n info(var.info),\n\n leftQualifiers(var.leftQualifiers),\n rightQualifiers(var.rightQualifiers),\n\n baseType(var.baseType),\n\n name(var.name),\n\n pointerCount(var.pointerCount),\n stackPointerCount(var.stackPointerCount),\n stackExpRoots(var.stackExpRoots),\n\n argumentCount(var.argumentCount),\n argumentVarInfos(var.argumentVarInfos),\n\n functionNestCount(var.functionNestCount),\n functionNests(var.functionNests) {}\n\n _varInfo& _varInfo::operator = (const _varInfo &var){\n info = var.info;\n\n leftQualifiers = var.leftQualifiers;\n rightQualifiers = var.rightQualifiers;\n\n baseType = var.baseType;\n\n name = var.name;\n\n pointerCount = var.pointerCount;\n stackPointerCount = var.stackPointerCount;\n stackExpRoots = var.stackExpRoots;\n\n argumentCount = var.argumentCount;\n argumentVarInfos = var.argumentVarInfos;\n\n functionNestCount = var.functionNestCount;\n functionNests = var.functionNests;\n\n return *this;\n }\n\n int _varInfo::variablesInStatement(strNode *nodePos){\n int argc = 0;\n\n while(nodePos){\n if((nodePos->value == \",\") ||\n (nodePos->value == \";\")){\n\n ++argc;\n }\n else if((nodePos->right) == NULL)\n ++argc;\n\n nodePos = nodePos->right;\n }\n\n return argc;\n }\n\n strNode* _varInfo::loadValueFrom(statement &s,\n strNode *nodePos,\n _varInfo *varHasType){\n nodePos = loadTypeFrom(s, nodePos, varHasType);\n\n info = getVarInfoFrom(s, nodePos);\n\n if(info & _varType::functionPointer){\n functionNestCount = getNestCountFrom(s, nodePos);\n functionNests = new _varInfo[functionNestCount];\n }\n\n nodePos = loadNameFrom(s, nodePos);\n nodePos = loadArgsFrom(s, nodePos);\n\n if(nodePos &&\n (nodePos->value == \",\"))\n nodePos = nodePos->right;\n\n return nodePos;\n }\n\n strNode* _varInfo::loadTypeFrom(statement &s,\n strNode *nodePos,\n _varInfo *varHasType){\n if(varHasType == NULL){\n nodePos = leftQualifiers.loadFrom(s, nodePos);\n\n baseType = s.hasTypeInScope(nodePos->value);\n\n if(baseType)\n nodePos = nodePos->right;\n }\n else{\n leftQualifiers = varHasType->leftQualifiers;\n baseType = varHasType->baseType;\n }\n\n nodePos = rightQualifiers.loadFrom(s, nodePos);\n\n return nodePos;\n }\n\n int _varInfo::getVarInfoFrom(statement &s,\n strNode *nodePos){\n \/\/ No name var (argument for function)\n if(nodePos == NULL)\n return _varType::var;\n\n strNode *nextNode = nodePos->right;\n\n const int nestCount = getNestCountFrom(s, nodePos);\n\n if(nestCount)\n return _varType::functionPointer;\n\n if(nextNode &&\n (nextNode->type == startParentheses))\n return _varType::function;\n\n return _varType::var;\n }\n\n int _varInfo::getNestCountFrom(statement &s,\n strNode *nodePos){\n int nestCount = 0;\n\n while(nodePos &&\n (nodePos->type == startParentheses)){\n\n nodePos = nodePos->down;\n\n if(nodePos &&\n nodePos->value == \"*\"){\n\n ++nestCount;\n nodePos = nodePos->right;\n }\n }\n\n return nestCount;\n }\n\n strNode* _varInfo::loadNameFrom(statement &s,\n strNode *nodePos){\n if(nodePos == NULL)\n return NULL;\n\n strNode *nextNode = nodePos->right;\n\n int nestPos = 0;\n\n while(nodePos &&\n (nodePos->type == startParentheses)){\n\n nodePos = nodePos->down;\n\n if(nodePos &&\n nodePos->value == \"*\"){\n\n nodePos = nodePos->right;\n\n if(nodePos &&\n nodePos->right &&\n (nodePos->right->type == startParentheses)){\n\n functionNests[nestPos].info = _varType::function;\n functionNests[nestPos].loadArgsFrom(s, nodePos->right);\n }\n\n ++nestPos;\n }\n }\n\n if(nodePos &&\n (nodePos->type & unknownVariable)){\n\n name = nodePos->value;\n nodePos = nodePos->right;\n\n if(nodePos == nextNode)\n nextNode = loadStackPointersFrom(s, nextNode);\n else\n nodePos = loadStackPointersFrom(s, nodePos);\n }\n\n return nextNode;\n }\n\n strNode* _varInfo::loadStackPointersFrom(statement &s,\n strNode *nodePos){\n strNode *nodeRoot = nodePos;\n\n if(nodePos &&\n (nodePos->value == \"[\") &&\n (nodePos->down)){\n\n ++stackPointerCount;\n nodePos = nodePos->right;\n }\n\n if(stackPointerCount){\n nodePos = nodeRoot;\n\n stackExpRoots = new expNode[stackPointerCount];\n\n for(int i = 0; i < stackPointerCount; ++i){\n stackExpRoots[i].sInfo = &s;\n\n if(nodePos->down){\n strNode *downNode = nodePos->down;\n strNode *lastDown = lastNode(downNode);\n\n \/\/ s.setExpNodeFromStrNode(stackExpRoots[i], downNode);\n }\n\n nodePos = nodePos->right;\n }\n }\n\n return nodePos;\n }\n\n strNode* _varInfo::loadArgsFrom(statement &s,\n strNode *nodePos){\n if( !(info & _varType::functionType) )\n return nodePos;\n\n if(nodePos == NULL){\n std::cout << \"Missing arguments from function variable\\n\";\n throw 1;\n }\n\n strNode *nextNode = nodePos->right;\n\n if(nodePos->down){\n nodePos = nodePos->down;\n\n argumentCount = variablesInStatement(nodePos);\n argumentVarInfos = new _varInfo[argumentCount];\n\n for(int i = 0; i < argumentCount; ++i)\n nodePos = argumentVarInfos[i].loadValueFrom(s, nodePos);\n }\n\n return nextNode;\n }\n\n std::string _varInfo::toString(const bool printType){\n std::string ret;\n\n if(printType){\n ret += leftQualifiers.toString();\n\n if(baseType)\n ret += baseType->typeName;\n\n if((rightQualifiers.qualifierCount) ||\n (name.size())){\n\n ret += ' ';\n }\n }\n\n ret += rightQualifiers.toString();\n\n for(int i = 0; i < functionNestCount; ++i)\n ret += \"(*\";\n\n ret += name;\n\n for(int i = 0; i < stackPointerCount; ++i){\n ret += '[';\n ret += (std::string) stackExpRoots[i];\n ret += ']';\n }\n\n for(int i = 0; i < functionNestCount; ++i){\n ret += ')';\n ret += functionNests[i].toString();\n }\n\n if(info & _varType::functionType){\n ret += '(';\n\n for(int i = 0; i < argumentCount; ++i)\n ret += argumentVarInfos[i].toString();\n\n ret += ')';\n }\n\n return ret;\n }\n\n _varInfo::operator std::string (){\n return toString();\n }\n\n std::ostream& operator << (std::ostream &out, _varInfo &var){\n out << var.toString();\n return out;\n }\n\n expNode* addNewVariables(strNode *nodePos){\n return NULL;\n }\n\n void test(){\n parser p;\n p.loadLanguageTypes();\n statement &s = *(p.globalScope);\n\n strNode *nodeRoot = p.splitAndPreprocessContent(\"const int *const ** const***a[2], *b, ((c)), d[3], e(int), (f), ((*g))(), (*(*h)(int))(double);\");\n\n const int varCount = _varInfo::variablesInStatement(nodeRoot);\n\n if(varCount){\n _varInfo *variables = new _varInfo[varCount];\n\n nodeRoot = variables[0].loadValueFrom(s, nodeRoot);\n std::cout << \"variables[0] = \" << variables[0] << '\\n';\n\n for(int i = 1; i < varCount; ++i){\n nodeRoot = variables[i].loadValueFrom(s, nodeRoot, &(variables[0]));\n std::cout << \"variables[\" << i << \"] = \" << variables[i] << '\\n';\n }\n }\n\n \/\/ expNode *expRoot = addNewVariables(nodeRoot);\n \/\/ expRoot->print();\n\n throw 1;\n }\n };\n};\n\nint main(int argc, char **argv){\n occa::parserNamespace::test();\n\n \/\/ {\n \/\/ occa::parser parser;\n \/\/ std::string parsedContent = parser.parseFile(\"tests\/easy.c\");\n \/\/ std::cout << parsedContent << '\\n';\n \/\/ }\n\n \/\/ {\n \/\/ occa::parser parser;\n \/\/ std::string parsedContent = parser.parseFile(\"tests\/test.cpp\");\n \/\/ std::cout << parsedContent << '\\n';\n \/\/ }\n\n \/\/ {\n \/\/ occa::parser parser;\n \/\/ std::string parsedContent = parser.parseFile(\"tests\/openclTest.cpp\");\n \/\/ std::cout << parsedContent << '\\n';\n \/\/ }\n\n \/\/ {\n \/\/ occa::parser parser;\n \/\/ std::string parsedContent = parser.parseFile(\"tests\/cudaTest.cpp\");\n \/\/ std::cout << parsedContent << '\\n';\n \/\/ }\n\n \/\/ {\n \/\/ occa::parser parser;\n \/\/ std::string parsedContent = parser.parseFile(\"tests\/midg.okl\");\n \/\/ std::cout << parsedContent << '\\n';\n \/\/ }\n\n \/\/ {\n \/\/ occa::parser parser;\n \/\/ std::string parsedContent = parser.parseFile(\"tests\/cleanTest.c\");\n \/\/ std::cout << parsedContent << '\\n';\n \/\/ }\n\n \/\/ {\n \/\/ occa::parser parser;\n \/\/ std::string parsedContent = parser.parseFile(\"tests\/clangTest.c\");\n \/\/ std::cout << parsedContent << '\\n';\n \/\/ }\n\n \/\/ {\n \/\/ occa::parser parser;\n \/\/ std::string parsedContent = parser.parseFile(\"tests\/addVectors.okl\");\n \/\/ std::cout << parsedContent << '\\n';\n \/\/ }\n\n \/\/ {\n \/\/ occa::parser parser;\n \/\/ std::string parsedContent = parser.parseFile(\"tests\/PCGpart1.cl\");\n \/\/ std::cout << parsedContent << '\\n';\n \/\/ }\n\n {\n occa::parser parser;\n std::string parsedContent = parser.parseFile(\"tests\/lookup_kernel.okl\");\n std::cout << parsedContent << '\\n';\n }\n}\n<commit_msg>[Parser] Fixed functionPointer output<commit_after>#include \"occaParser.hpp\"\n\nnamespace occa {\n namespace parserNamespace {\n _qualifierInfo::_qualifierInfo() :\n qualifierCount(0),\n qualifiers(NULL) {}\n\n _qualifierInfo::_qualifierInfo(const _qualifierInfo &q) :\n qualifierCount(q.qualifierCount),\n qualifiers(q.qualifiers) {}\n\n _qualifierInfo& _qualifierInfo::operator = (const _qualifierInfo &q){\n qualifierCount = q.qualifierCount;\n qualifiers = q.qualifiers;\n\n return *this;\n }\n\n _qualifierInfo _qualifierInfo::clone(){\n _qualifierInfo q;\n\n q.qualifierCount = qualifierCount;\n\n q.qualifiers = new std::string[qualifierCount];\n\n for(int i = 0; i < qualifierCount; ++i)\n q.qualifiers[i] = qualifiers[i];\n\n return q;\n }\n\n strNode* _qualifierInfo::loadFrom(statement &s,\n strNode *nodePos){\n strNode *nodeRoot = nodePos;\n\n while(nodePos &&\n s.nodeHasQualifier(nodePos)){\n ++qualifierCount;\n nodePos = nodePos->right;\n }\n\n if(qualifierCount){\n qualifiers = new std::string[qualifierCount];\n nodePos = nodeRoot;\n\n for(int i = 0; i < qualifierCount; ++i){\n qualifiers[i] = nodePos->value;\n nodePos = nodePos->right;\n }\n }\n\n return nodePos;\n }\n\n std::string _qualifierInfo::toString(){\n std::string ret;\n\n for(int i = 0; i < qualifierCount; ++i){\n ret += qualifiers[i];\n\n if((qualifiers[i][0] != '*') ||\n ( ((i + 1) < qualifierCount) &&\n (qualifiers[i + 1][0] != '*') )){\n\n ret += ' ';\n }\n }\n\n return ret;\n }\n\n _varInfo::_varInfo() :\n info(0),\n\n leftQualifiers(),\n rightQualifiers(),\n\n baseType(NULL),\n\n name(\"\"),\n\n pointerCount(0),\n stackPointerCount(0),\n stackExpRoots(NULL),\n\n argumentCount(0),\n argumentVarInfos(NULL),\n\n functionNestCount(0),\n functionNests(NULL) {}\n\n _varInfo::_varInfo(const _varInfo &var) :\n info(var.info),\n\n leftQualifiers(var.leftQualifiers),\n rightQualifiers(var.rightQualifiers),\n\n baseType(var.baseType),\n\n name(var.name),\n\n pointerCount(var.pointerCount),\n stackPointerCount(var.stackPointerCount),\n stackExpRoots(var.stackExpRoots),\n\n argumentCount(var.argumentCount),\n argumentVarInfos(var.argumentVarInfos),\n\n functionNestCount(var.functionNestCount),\n functionNests(var.functionNests) {}\n\n _varInfo& _varInfo::operator = (const _varInfo &var){\n info = var.info;\n\n leftQualifiers = var.leftQualifiers;\n rightQualifiers = var.rightQualifiers;\n\n baseType = var.baseType;\n\n name = var.name;\n\n pointerCount = var.pointerCount;\n stackPointerCount = var.stackPointerCount;\n stackExpRoots = var.stackExpRoots;\n\n argumentCount = var.argumentCount;\n argumentVarInfos = var.argumentVarInfos;\n\n functionNestCount = var.functionNestCount;\n functionNests = var.functionNests;\n\n return *this;\n }\n\n int _varInfo::variablesInStatement(strNode *nodePos){\n int argc = 0;\n\n while(nodePos){\n if((nodePos->value == \",\") ||\n (nodePos->value == \";\")){\n\n ++argc;\n }\n else if((nodePos->right) == NULL)\n ++argc;\n\n nodePos = nodePos->right;\n }\n\n return argc;\n }\n\n strNode* _varInfo::loadValueFrom(statement &s,\n strNode *nodePos,\n _varInfo *varHasType){\n nodePos = loadTypeFrom(s, nodePos, varHasType);\n\n info = getVarInfoFrom(s, nodePos);\n\n if(info & _varType::functionPointer){\n functionNestCount = getNestCountFrom(s, nodePos);\n functionNests = new _varInfo[functionNestCount];\n }\n\n nodePos = loadNameFrom(s, nodePos);\n nodePos = loadArgsFrom(s, nodePos);\n\n if(nodePos &&\n (nodePos->value == \",\"))\n nodePos = nodePos->right;\n\n return nodePos;\n }\n\n strNode* _varInfo::loadTypeFrom(statement &s,\n strNode *nodePos,\n _varInfo *varHasType){\n if(varHasType == NULL){\n nodePos = leftQualifiers.loadFrom(s, nodePos);\n\n baseType = s.hasTypeInScope(nodePos->value);\n\n if(baseType)\n nodePos = nodePos->right;\n }\n else{\n leftQualifiers = varHasType->leftQualifiers;\n baseType = varHasType->baseType;\n }\n\n nodePos = rightQualifiers.loadFrom(s, nodePos);\n\n return nodePos;\n }\n\n int _varInfo::getVarInfoFrom(statement &s,\n strNode *nodePos){\n \/\/ No name var (argument for function)\n if(nodePos == NULL)\n return _varType::var;\n\n strNode *nextNode = nodePos->right;\n\n const int nestCount = getNestCountFrom(s, nodePos);\n\n if(nestCount)\n return _varType::functionPointer;\n\n if(nextNode &&\n (nextNode->type == startParentheses))\n return _varType::function;\n\n return _varType::var;\n }\n\n int _varInfo::getNestCountFrom(statement &s,\n strNode *nodePos){\n int nestCount = 0;\n\n while(nodePos &&\n (nodePos->type == startParentheses)){\n\n nodePos = nodePos->down;\n\n if(nodePos &&\n nodePos->value == \"*\"){\n\n ++nestCount;\n nodePos = nodePos->right;\n }\n }\n\n return nestCount;\n }\n\n strNode* _varInfo::loadNameFrom(statement &s,\n strNode *nodePos){\n if(nodePos == NULL)\n return NULL;\n\n strNode *nextNode = nodePos->right;\n\n int nestPos = 0;\n\n while(nodePos &&\n (nodePos->type == startParentheses)){\n\n nodePos = nodePos->down;\n\n if(nodePos &&\n nodePos->value == \"*\"){\n\n nodePos = nodePos->right;\n\n if(nodePos &&\n nodePos->right &&\n (nodePos->right->type == startParentheses)){\n\n functionNests[nestPos].info = _varType::function;\n functionNests[nestPos].loadArgsFrom(s, nodePos->right);\n }\n\n ++nestPos;\n }\n }\n\n if(nodePos &&\n (nodePos->type & unknownVariable)){\n\n name = nodePos->value;\n nodePos = nodePos->right;\n\n if(nodePos == nextNode)\n nextNode = loadStackPointersFrom(s, nextNode);\n else\n nodePos = loadStackPointersFrom(s, nodePos);\n }\n\n return nextNode;\n }\n\n strNode* _varInfo::loadStackPointersFrom(statement &s,\n strNode *nodePos){\n strNode *nodeRoot = nodePos;\n\n if(nodePos &&\n (nodePos->value == \"[\") &&\n (nodePos->down)){\n\n ++stackPointerCount;\n nodePos = nodePos->right;\n }\n\n if(stackPointerCount){\n nodePos = nodeRoot;\n\n stackExpRoots = new expNode[stackPointerCount];\n\n for(int i = 0; i < stackPointerCount; ++i){\n stackExpRoots[i].sInfo = &s;\n\n if(nodePos->down){\n strNode *downNode = nodePos->down;\n strNode *lastDown = lastNode(downNode);\n\n \/\/ s.setExpNodeFromStrNode(stackExpRoots[i], downNode);\n }\n\n nodePos = nodePos->right;\n }\n }\n\n return nodePos;\n }\n\n strNode* _varInfo::loadArgsFrom(statement &s,\n strNode *nodePos){\n if( !(info & _varType::functionType) )\n return nodePos;\n\n if(nodePos == NULL){\n std::cout << \"Missing arguments from function variable\\n\";\n throw 1;\n }\n\n strNode *nextNode = nodePos->right;\n\n if(nodePos->down){\n nodePos = nodePos->down;\n\n argumentCount = variablesInStatement(nodePos);\n argumentVarInfos = new _varInfo[argumentCount];\n\n for(int i = 0; i < argumentCount; ++i)\n nodePos = argumentVarInfos[i].loadValueFrom(s, nodePos);\n }\n\n return nextNode;\n }\n\n std::string _varInfo::toString(const bool printType){\n std::string ret;\n\n if(printType){\n ret += leftQualifiers.toString();\n\n if(baseType)\n ret += baseType->typeName;\n\n if((rightQualifiers.qualifierCount) ||\n (name.size())){\n\n ret += ' ';\n }\n }\n\n ret += rightQualifiers.toString();\n\n for(int i = 0; i < functionNestCount; ++i)\n ret += \"(*\";\n\n ret += name;\n\n for(int i = 0; i < stackPointerCount; ++i){\n ret += '[';\n ret += (std::string) stackExpRoots[i];\n ret += ']';\n }\n\n for(int i = (functionNestCount - 1); 0 <= i; --i){\n ret += functionNests[i].toString();\n ret += ')';\n }\n\n if(info & _varType::functionType){\n ret += '(';\n\n for(int i = 0; i < argumentCount; ++i)\n ret += argumentVarInfos[i].toString();\n\n ret += ')';\n }\n\n return ret;\n }\n\n _varInfo::operator std::string (){\n return toString();\n }\n\n std::ostream& operator << (std::ostream &out, _varInfo &var){\n out << var.toString();\n return out;\n }\n\n expNode* addNewVariables(strNode *nodePos){\n return NULL;\n }\n\n void test(){\n parser p;\n p.loadLanguageTypes();\n statement &s = *(p.globalScope);\n\n strNode *nodeRoot = p.splitAndPreprocessContent(\"const int *const ** const***a[2], *b, ((c)), d[3], e(int), (f), ((*g))(), (*(*h)(int))(double), (*(*(*i)())(int))(double);\");\n\n const int varCount = _varInfo::variablesInStatement(nodeRoot);\n\n if(varCount){\n _varInfo *variables = new _varInfo[varCount];\n\n nodeRoot = variables[0].loadValueFrom(s, nodeRoot);\n std::cout << \"variables[0] = \" << variables[0] << '\\n';\n\n for(int i = 1; i < varCount; ++i){\n nodeRoot = variables[i].loadValueFrom(s, nodeRoot, &(variables[0]));\n std::cout << \"variables[\" << i << \"] = \" << variables[i] << '\\n';\n }\n }\n\n \/\/ expNode *expRoot = addNewVariables(nodeRoot);\n \/\/ expRoot->print();\n\n throw 1;\n }\n };\n};\n\nint main(int argc, char **argv){\n occa::parserNamespace::test();\n\n \/\/ {\n \/\/ occa::parser parser;\n \/\/ std::string parsedContent = parser.parseFile(\"tests\/easy.c\");\n \/\/ std::cout << parsedContent << '\\n';\n \/\/ }\n\n \/\/ {\n \/\/ occa::parser parser;\n \/\/ std::string parsedContent = parser.parseFile(\"tests\/test.cpp\");\n \/\/ std::cout << parsedContent << '\\n';\n \/\/ }\n\n \/\/ {\n \/\/ occa::parser parser;\n \/\/ std::string parsedContent = parser.parseFile(\"tests\/openclTest.cpp\");\n \/\/ std::cout << parsedContent << '\\n';\n \/\/ }\n\n \/\/ {\n \/\/ occa::parser parser;\n \/\/ std::string parsedContent = parser.parseFile(\"tests\/cudaTest.cpp\");\n \/\/ std::cout << parsedContent << '\\n';\n \/\/ }\n\n \/\/ {\n \/\/ occa::parser parser;\n \/\/ std::string parsedContent = parser.parseFile(\"tests\/midg.okl\");\n \/\/ std::cout << parsedContent << '\\n';\n \/\/ }\n\n \/\/ {\n \/\/ occa::parser parser;\n \/\/ std::string parsedContent = parser.parseFile(\"tests\/cleanTest.c\");\n \/\/ std::cout << parsedContent << '\\n';\n \/\/ }\n\n \/\/ {\n \/\/ occa::parser parser;\n \/\/ std::string parsedContent = parser.parseFile(\"tests\/clangTest.c\");\n \/\/ std::cout << parsedContent << '\\n';\n \/\/ }\n\n \/\/ {\n \/\/ occa::parser parser;\n \/\/ std::string parsedContent = parser.parseFile(\"tests\/addVectors.okl\");\n \/\/ std::cout << parsedContent << '\\n';\n \/\/ }\n\n \/\/ {\n \/\/ occa::parser parser;\n \/\/ std::string parsedContent = parser.parseFile(\"tests\/PCGpart1.cl\");\n \/\/ std::cout << parsedContent << '\\n';\n \/\/ }\n\n {\n occa::parser parser;\n std::string parsedContent = parser.parseFile(\"tests\/lookup_kernel.okl\");\n std::cout << parsedContent << '\\n';\n }\n}\n<|endoftext|>"} {"text":"<commit_before>#include \"stun.h\"\n#include \"stunmsgfact.h\"\n\n#include <QDnsLookup>\n#include <QHostInfo>\n#include <QDateTime>\n#include <QDebug>\n#include <QMutex>\n#include <QWaitCondition>\n#include <QEventLoop>\n\n#include <QtEndian>\n\nconst uint16_t GOOGLE_STUN_PORT = 19302;\nconst uint16_t STUN_PORT = 21000;\n\nStun::Stun():\n udp_(),\n stunmsg_()\n{}\n\nvoid Stun::wantAddress(QString stunServer)\n{\n \/\/ To find the IP address of qt-project.org\n QHostInfo::lookupHost(stunServer, this, SLOT(handleHostaddress(QHostInfo)));\n}\n\nvoid Stun::handleHostaddress(QHostInfo info)\n{\n const auto addresses = info.addresses();\n QHostAddress address;\n if(addresses.size() != 0)\n {\n address = addresses.at(0);\n qDebug() <<\"Found\" << addresses.size() << \"stun server addresses. Using:\" << address.toString();\n }\n else\n {\n qDebug() << \"Did not find any addresses\";\n return;\n }\n\n udp_.bind(QHostAddress::AnyIPv4, STUN_PORT);\n QObject::connect(&udp_, SIGNAL(messageAvailable(QByteArray)), this, SLOT(processReply(QByteArray)));\n\n STUNMessage request_ = stunmsg_.createRequest();\n QByteArray message_ = stunmsg_.hostToNetwork(request_);\n\n udp_.sendData(message_, address, GOOGLE_STUN_PORT, false);\n}\n\nbool Stun::waitForStunResponse(unsigned long timeout)\n{\n QTimer timer;\n timer.setSingleShot(true);\n QEventLoop loop;\n\n connect(this, &Stun::parsingDone, &loop, &QEventLoop::quit);\n connect(&timer, &QTimer::timeout, &loop, &QEventLoop::quit);\n\n timer.start(timeout);\n loop.exec();\n\n return timer.isActive();\n}\n\nbool Stun::waitForNominationRequest(unsigned long timeout)\n{\n QTimer timer;\n timer.setSingleShot(true);\n QEventLoop loop;\n\n connect(this, &Stun::nominationRecv, &loop, &QEventLoop::quit);\n connect(&timer, &QTimer::timeout, &loop, &QEventLoop::quit);\n\n timer.start(timeout);\n loop.exec();\n\n return timer.isActive();\n}\n\nbool Stun::sendBindingRequest(ICEPair *pair, bool controller)\n{\n if (controller)\n qDebug() << \"[controller] BINDING \" << pair->local->address<< \" TO PORT \" << pair->local->port;\n else\n qDebug() << \"[controllee] BINDING \" << pair->local->address << \" TO PORT \" << pair->local->port;\n\n if (!udp_.bindRaw(QHostAddress(pair->local->address), pair->local->port))\n {\n qDebug() << \"Binding failed! Cannot send STUN Binding Requests to \" \n << pair->remote->address << \":\" << pair->remote->port;\n return false;\n }\n\n connect(&udp_, &UDPServer::rawMessageAvailable, this, &Stun::recvStunMessage);\n\n \/\/ TODO this code looks ugly -> refactor\n\n STUNMessage request = stunmsg_.createRequest();\n request.addAttribute(controller ? STUN_ATTR_ICE_CONTROLLING : STUN_ATTR_ICE_CONTROLLED);\n request.addAttribute(STUN_ATTR_PRIORITY, pair->priority);\n\n \/\/ we expect a response to this message from remote, by caching the TransactionID\n \/\/ and associated address port pair, we can succesfully validate the response TransactionID\n stunmsg_.expectReplyFrom(request, pair->remote->address, pair->remote->port);\n\n QByteArray message = stunmsg_.hostToNetwork(request);\n\n bool ok = false;\n\n for (int i = 0; i < 50; ++i)\n {\n udp_.sendData(message, QHostAddress(pair->remote->address), pair->remote->port, false);\n\n if (waitForStunResponse(20 * (i + 1)))\n {\n qDebug() << \"got stun response!\";\n ok = true;\n break;\n }\n }\n\n if (waitForStunResponse(100))\n {\n ok = true;\n }\n\n udp_.unbind();\n return ok;\n}\n\nbool Stun::sendBindingResponse(STUNMessage& request, QString addressRemote, int portRemote)\n{\n STUNMessage response = stunmsg_.createResponse(request);\n\n response.addAttribute(STUN_ATTR_PRIORITY, 0x1337);\n\n request.addAttribute(\n request.hasAttribute(STUN_ATTR_ICE_CONTROLLED)\n ? STUN_ATTR_ICE_CONTROLLING\n : STUN_ATTR_ICE_CONTROLLED\n );\n\n QByteArray message = stunmsg_.hostToNetwork(response);\n\n for (int i = 0; i < 25; ++i)\n {\n udp_.sendData(message, QHostAddress(addressRemote), portRemote, false);\n }\n}\n\n\/\/ either we got Stun binding request -> send binding response\n\/\/ or Stun binding response -> mark candidate as valid\nvoid Stun::recvStunMessage(QNetworkDatagram message)\n{\n QByteArray data = message.data();\n STUNMessage stunMsg = stunmsg_.networkToHost(data);\n\n if (stunMsg.getType() == STUN_REQUEST)\n {\n if (stunmsg_.validateStunRequest(stunMsg))\n {\n stunmsg_.cacheRequest(stunMsg);\n\n if (stunMsg.hasAttribute(STUN_ATTR_USE_CANDIATE))\n {\n sendBindingResponse(stunMsg, message.senderAddress().toString(), message.senderPort());\n emit nominationRecv();\n }\n else\n {\n sendBindingResponse(stunMsg, message.senderAddress().toString(), message.senderPort());\n }\n }\n }\n else if (stunMsg.getType() == STUN_RESPONSE)\n {\n \/\/ if this message is a response to a request we just sent, its TransactionID should be cached\n \/\/ if not, vertaa viimeksi lähetetyn TransactionID:tä vasten\n if (stunmsg_.validateStunResponse(stunMsg, message.senderAddress(), message.senderPort()))\n {\n emit parsingDone();\n }\n }\n else\n {\n qDebug() << \"WARNING: Got unkown STUN message, type: \" << stunMsg.getType()\n << \" from \" << message.senderAddress() << \":\" << message.senderPort()\n << \" to\" << message.destinationAddress() << \":\" << message.destinationPort();\n qDebug() << \"\\n\\n\\n\\n\";\n while (1);\n }\n}\n\nbool Stun::sendNominationRequest(ICEPair *pair)\n{\n qDebug() << \"[controller] BINDING \" << pair->local->address << \" TO PORT \" << pair->local->port;\n\n if (!udp_.bindRaw(QHostAddress(pair->local->address), pair->local->port))\n {\n qDebug() << \"Binding failed! Cannot send STUN Binding Requests to \" << pair->remote->address << \":\" << pair->remote->address;\n return false;\n }\n\n connect(&udp_, &UDPServer::rawMessageAvailable, this, &Stun::recvStunMessage);\n\n STUNMessage request = stunmsg_.createRequest();\n request.addAttribute(STUN_ATTR_ICE_CONTROLLING);\n request.addAttribute(STUN_ATTR_USE_CANDIATE);\n\n \/\/ expect reply for this message from remote\n stunmsg_.expectReplyFrom(request, pair->remote->address, pair->remote->port);\n\n QByteArray message = stunmsg_.hostToNetwork(request);\n\n bool ok = false;\n\n for (int i = 0; i < 25; ++i)\n {\n udp_.sendData(message, QHostAddress(pair->remote->address), pair->remote->port, false);\n\n if (waitForStunResponse(20 * (i + 1)))\n {\n ok = true;\n break;\n }\n }\n\n udp_.unbind();\n return ok;\n}\n\nbool Stun::sendNominationResponse(ICEPair *pair)\n{\n qDebug() << \"[controllee] BINDING \" << pair->local->address << \" TO PORT \" << pair->local->port;\n\n if (!udp_.bindRaw(QHostAddress(pair->local->address), pair->local->port))\n {\n qDebug() << \"Binding failed! Cannot send STUN Binding Requests to \" << pair->remote->address << \":\" << pair->remote->address;\n return false;\n }\n\n connect(&udp_, &UDPServer::rawMessageAvailable, this, &Stun::recvStunMessage);\n\n \/\/ first send empty stun binding requests to remote to create a hole in the firewall\n \/\/ when the first nomination request is received (if any), start sending nomination response\n STUNMessage request = stunmsg_.createRequest();\n request.addAttribute(STUN_ATTR_ICE_CONTROLLED);\n\n QByteArray reqMessage = stunmsg_.hostToNetwork(request);\n bool nominationRecv = false;\n\n for (int i = 0; i < 25; ++i)\n {\n udp_.sendData(reqMessage, QHostAddress(pair->remote->address), pair->remote->port, false);\n\n if (waitForNominationRequest(20 * (i + 1)))\n {\n nominationRecv = true;\n break;\n }\n }\n\n if (nominationRecv)\n {\n nominationRecv = false;\n\n STUNMessage response = stunmsg_.createResponse();\n response.addAttribute(STUN_ATTR_ICE_CONTROLLED);\n response.addAttribute(STUN_ATTR_USE_CANDIATE);\n\n QByteArray respMessage = stunmsg_.hostToNetwork(response);\n\n for (int i = 0; i < 25; ++i)\n {\n udp_.sendData(respMessage, QHostAddress(pair->remote->address), pair->remote->port, false);\n\n \/\/ when we no longer get nomination request it means that remote has received\n \/\/ our response message and end the nomination process\n \/\/\n \/\/ We can stop sending nomination responses when the waitForNominationRequest() timeouts\n \/\/\n \/\/ Because we got here (we received nomination request in the previous step) we can assume\n \/\/ that the connection works in both ends and waitForNominationRequest() doesn't just timeout\n \/\/ because it doesn't receive anything\n if (!waitForNominationRequest(20 * (i + 1)))\n {\n nominationRecv = true;\n break;\n }\n }\n }\n\n udp_.unbind();\n return nominationRecv;\n}\n\nvoid Stun::processReply(QByteArray data)\n{\n if(data.size() < 20)\n {\n qDebug() << \"Received too small response to STUN query!\";\n return;\n }\n\n QString message = QString::fromStdString(data.toHex().toStdString());\n qDebug() << \"Got a STUN reply:\" << message << \"with size:\" << data.size();\n\n STUNMessage response = stunmsg_.networkToHost(data);\n\n if (response.getType() != STUN_RESPONSE)\n {\n qDebug() << \"Unsuccessful STUN transaction!\";\n emit stunError();\n return;\n }\n\n if (response.getLength() == 0 || response.getCookie() != STUN_MAGIC_COOKIE)\n {\n qDebug() << \"Something went wrong with STUN transaction values. Length:\"\n << response.getLength() << \"Magic cookie:\" << response.getCookie();\n emit stunError();\n return;\n }\n\n if (!stunmsg_.verifyTransactionID(response))\n {\n qDebug() << \"TransactionID is invalid!\";\n }\n\n qDebug() << \"Valid STUN response. Decoding address\";\n\n std::pair<QHostAddress, uint16_t> addressInfo;\n\n if (response.getXorMappedAddress(addressInfo))\n {\n emit addressReceived(addressInfo.first);\n }\n else\n {\n qDebug() << \"DIDN'T GET XOR-MAPPED-ADDRESS!\";\n emit stunError();\n }\n}\n<commit_msg>Rewrite the STUN response parsing<commit_after>#include \"stun.h\"\n#include \"stunmsgfact.h\"\n\n#include <QDnsLookup>\n#include <QHostInfo>\n#include <QDateTime>\n#include <QDebug>\n#include <QMutex>\n#include <QWaitCondition>\n#include <QEventLoop>\n\n#include <QtEndian>\n\nconst uint16_t GOOGLE_STUN_PORT = 19302;\nconst uint16_t STUN_PORT = 21000;\n\nStun::Stun():\n udp_(),\n stunmsg_()\n{}\n\nvoid Stun::wantAddress(QString stunServer)\n{\n \/\/ To find the IP address of qt-project.org\n QHostInfo::lookupHost(stunServer, this, SLOT(handleHostaddress(QHostInfo)));\n}\n\nvoid Stun::handleHostaddress(QHostInfo info)\n{\n const auto addresses = info.addresses();\n QHostAddress address;\n if(addresses.size() != 0)\n {\n address = addresses.at(0);\n qDebug() <<\"Found\" << addresses.size() << \"stun server addresses. Using:\" << address.toString();\n }\n else\n {\n qDebug() << \"Did not find any addresses\";\n return;\n }\n\n udp_.bind(QHostAddress::AnyIPv4, STUN_PORT);\n QObject::connect(&udp_, SIGNAL(messageAvailable(QByteArray)), this, SLOT(processReply(QByteArray)));\n\n STUNMessage request = stunmsg_.createRequest();\n QByteArray message = stunmsg_.hostToNetwork(request);\n\n stunmsg_.cacheRequest(request);\n\n udp_.sendData(message, address, GOOGLE_STUN_PORT, false);\n}\n\nbool Stun::waitForStunResponse(unsigned long timeout)\n{\n QTimer timer;\n timer.setSingleShot(true);\n QEventLoop loop;\n\n connect(this, &Stun::parsingDone, &loop, &QEventLoop::quit);\n connect(&timer, &QTimer::timeout, &loop, &QEventLoop::quit);\n\n timer.start(timeout);\n loop.exec();\n\n return timer.isActive();\n}\n\nbool Stun::waitForNominationRequest(unsigned long timeout)\n{\n QTimer timer;\n timer.setSingleShot(true);\n QEventLoop loop;\n\n connect(this, &Stun::nominationRecv, &loop, &QEventLoop::quit);\n connect(&timer, &QTimer::timeout, &loop, &QEventLoop::quit);\n\n timer.start(timeout);\n loop.exec();\n\n return timer.isActive();\n}\n\nbool Stun::sendBindingRequest(ICEPair *pair, bool controller)\n{\n if (controller)\n qDebug() << \"[controller] BINDING \" << pair->local->address<< \" TO PORT \" << pair->local->port;\n else\n qDebug() << \"[controllee] BINDING \" << pair->local->address << \" TO PORT \" << pair->local->port;\n\n if (!udp_.bindRaw(QHostAddress(pair->local->address), pair->local->port))\n {\n qDebug() << \"Binding failed! Cannot send STUN Binding Requests to \" \n << pair->remote->address << \":\" << pair->remote->port;\n return false;\n }\n\n connect(&udp_, &UDPServer::rawMessageAvailable, this, &Stun::recvStunMessage);\n\n \/\/ TODO this code looks ugly -> refactor\n\n STUNMessage request = stunmsg_.createRequest();\n request.addAttribute(controller ? STUN_ATTR_ICE_CONTROLLING : STUN_ATTR_ICE_CONTROLLED);\n request.addAttribute(STUN_ATTR_PRIORITY, pair->priority);\n\n \/\/ we expect a response to this message from remote, by caching the TransactionID\n \/\/ and associated address port pair, we can succesfully validate the response TransactionID\n stunmsg_.expectReplyFrom(request, pair->remote->address, pair->remote->port);\n\n QByteArray message = stunmsg_.hostToNetwork(request);\n\n bool ok = false;\n\n for (int i = 0; i < 50; ++i)\n {\n udp_.sendData(message, QHostAddress(pair->remote->address), pair->remote->port, false);\n\n if (waitForStunResponse(20 * (i + 1)))\n {\n qDebug() << \"got stun response!\";\n ok = true;\n break;\n }\n }\n\n if (waitForStunResponse(100))\n {\n ok = true;\n }\n\n udp_.unbind();\n return ok;\n}\n\nbool Stun::sendBindingResponse(STUNMessage& request, QString addressRemote, int portRemote)\n{\n STUNMessage response = stunmsg_.createResponse(request);\n\n response.addAttribute(STUN_ATTR_PRIORITY, 0x1337);\n\n request.addAttribute(\n request.hasAttribute(STUN_ATTR_ICE_CONTROLLED)\n ? STUN_ATTR_ICE_CONTROLLING\n : STUN_ATTR_ICE_CONTROLLED\n );\n\n QByteArray message = stunmsg_.hostToNetwork(response);\n\n for (int i = 0; i < 25; ++i)\n {\n udp_.sendData(message, QHostAddress(addressRemote), portRemote, false);\n }\n}\n\n\/\/ either we got Stun binding request -> send binding response\n\/\/ or Stun binding response -> mark candidate as valid\nvoid Stun::recvStunMessage(QNetworkDatagram message)\n{\n QByteArray data = message.data();\n STUNMessage stunMsg = stunmsg_.networkToHost(data);\n\n if (stunMsg.getType() == STUN_REQUEST)\n {\n if (stunmsg_.validateStunRequest(stunMsg))\n {\n stunmsg_.cacheRequest(stunMsg);\n\n if (stunMsg.hasAttribute(STUN_ATTR_USE_CANDIATE))\n {\n sendBindingResponse(stunMsg, message.senderAddress().toString(), message.senderPort());\n emit nominationRecv();\n }\n else\n {\n sendBindingResponse(stunMsg, message.senderAddress().toString(), message.senderPort());\n }\n }\n }\n else if (stunMsg.getType() == STUN_RESPONSE)\n {\n \/\/ if this message is a response to a request we just sent, its TransactionID should be cached\n \/\/ if not, vertaa viimeksi lähetetyn TransactionID:tä vasten\n if (stunmsg_.validateStunResponse(stunMsg, message.senderAddress(), message.senderPort()))\n {\n emit parsingDone();\n }\n }\n else\n {\n qDebug() << \"WARNING: Got unkown STUN message, type: \" << stunMsg.getType()\n << \" from \" << message.senderAddress() << \":\" << message.senderPort()\n << \" to\" << message.destinationAddress() << \":\" << message.destinationPort();\n qDebug() << \"\\n\\n\\n\\n\";\n while (1);\n }\n}\n\nbool Stun::sendNominationRequest(ICEPair *pair)\n{\n qDebug() << \"[controller] BINDING \" << pair->local->address << \" TO PORT \" << pair->local->port;\n\n if (!udp_.bindRaw(QHostAddress(pair->local->address), pair->local->port))\n {\n qDebug() << \"Binding failed! Cannot send STUN Binding Requests to \" << pair->remote->address << \":\" << pair->remote->address;\n return false;\n }\n\n connect(&udp_, &UDPServer::rawMessageAvailable, this, &Stun::recvStunMessage);\n\n STUNMessage request = stunmsg_.createRequest();\n request.addAttribute(STUN_ATTR_ICE_CONTROLLING);\n request.addAttribute(STUN_ATTR_USE_CANDIATE);\n\n \/\/ expect reply for this message from remote\n stunmsg_.expectReplyFrom(request, pair->remote->address, pair->remote->port);\n\n QByteArray message = stunmsg_.hostToNetwork(request);\n\n bool ok = false;\n\n for (int i = 0; i < 25; ++i)\n {\n udp_.sendData(message, QHostAddress(pair->remote->address), pair->remote->port, false);\n\n if (waitForStunResponse(20 * (i + 1)))\n {\n ok = true;\n break;\n }\n }\n\n udp_.unbind();\n return ok;\n}\n\nbool Stun::sendNominationResponse(ICEPair *pair)\n{\n qDebug() << \"[controllee] BINDING \" << pair->local->address << \" TO PORT \" << pair->local->port;\n\n if (!udp_.bindRaw(QHostAddress(pair->local->address), pair->local->port))\n {\n qDebug() << \"Binding failed! Cannot send STUN Binding Requests to \" << pair->remote->address << \":\" << pair->remote->address;\n return false;\n }\n\n connect(&udp_, &UDPServer::rawMessageAvailable, this, &Stun::recvStunMessage);\n\n \/\/ first send empty stun binding requests to remote to create a hole in the firewall\n \/\/ when the first nomination request is received (if any), start sending nomination response\n STUNMessage request = stunmsg_.createRequest();\n request.addAttribute(STUN_ATTR_ICE_CONTROLLED);\n\n QByteArray reqMessage = stunmsg_.hostToNetwork(request);\n bool nominationRecv = false;\n\n for (int i = 0; i < 25; ++i)\n {\n udp_.sendData(reqMessage, QHostAddress(pair->remote->address), pair->remote->port, false);\n\n if (waitForNominationRequest(20 * (i + 1)))\n {\n nominationRecv = true;\n break;\n }\n }\n\n if (nominationRecv)\n {\n nominationRecv = false;\n\n STUNMessage response = stunmsg_.createResponse();\n response.addAttribute(STUN_ATTR_ICE_CONTROLLED);\n response.addAttribute(STUN_ATTR_USE_CANDIATE);\n\n QByteArray respMessage = stunmsg_.hostToNetwork(response);\n\n for (int i = 0; i < 25; ++i)\n {\n udp_.sendData(respMessage, QHostAddress(pair->remote->address), pair->remote->port, false);\n\n \/\/ when we no longer get nomination request it means that remote has received\n \/\/ our response message and end the nomination process\n \/\/\n \/\/ We can stop sending nomination responses when the waitForNominationRequest() timeouts\n \/\/\n \/\/ Because we got here (we received nomination request in the previous step) we can assume\n \/\/ that the connection works in both ends and waitForNominationRequest() doesn't just timeout\n \/\/ because it doesn't receive anything\n if (!waitForNominationRequest(20 * (i + 1)))\n {\n nominationRecv = true;\n break;\n }\n }\n }\n\n udp_.unbind();\n return nominationRecv;\n}\n\nvoid Stun::processReply(QByteArray data)\n{\n if(data.size() < 20)\n {\n qDebug() << \"Received too small response to STUN query!\";\n return;\n }\n\n QString message = QString::fromStdString(data.toHex().toStdString());\n qDebug() << \"Got a STUN reply:\" << message << \"with size:\" << data.size();\n\n STUNMessage response = stunmsg_.networkToHost(data);\n\n if (!stunmsg_.validateStunResponse(response))\n {\n qDebug() << \"Invalid STUN Response!\";\n emit stunError();\n return;\n }\n\n std::pair<QHostAddress, uint16_t> addressInfo;\n\n if (response.getXorMappedAddress(addressInfo))\n {\n emit addressReceived(addressInfo.first);\n }\n else\n {\n qDebug() << \"DIDN'T GET XOR-MAPPED-ADDRESS!\";\n emit stunError();\n }\n}\n<|endoftext|>"} {"text":"<commit_before>\/**\n * @file\n * brief description, full stop.\n *\n * long description, many sentences.\n * \n *\/\n#include \"angort.h\"\n\n#include \"ser.h\"\n#include \"file.h\"\n#include \"opcodes.h\"\n\nvoid CodeType::set(Value *v,const struct CodeBlock *cb){\n v->clr();\n v->v.cb=cb;\n v->t = Types::tCode;\n}\n\n\n\nvoid CodeType::saveValue(Serialiser *ser, Value *v){\n ser->file->write32(ser->getFixupByData(v->v.cb));\n}\nvoid CodeType::loadValue(Serialiser *ser, Value *v){\n v->setFixup(ser->file->read32());\n}\n\n\nvoid CodeType::saveDataBlock(Serialiser *ser,const void *v){\n const CodeBlock *cb = (CodeBlock *)v;\n cb->save(ser);\n}\n\nvoid CodeBlock::save(Serialiser *ser) const {\n File *f = ser->file;\n \n f->write16(size);\n f->write16(locals);\n f->write16(params);\n f->write16(closureMapCt);\n f->writeString(spec);\n \n \/\/ save closure map\n for(int i=0;i<closureMapCt;i++){\n f->write16(closureMap[i].parent);\n f->write16(closureMap[i].isLocalInParent ? 1 : 0);\n }\n \n \/\/ save instructions\n const Instruction *p = ip;\n for(int i=0;i<size;i++,p++){\n int opcode = p->opcode;\n \/\/ change the opcode for these, to indicate the data\n \/\/ is now a fixup index\n switch(p->opcode){\n case OP_LITERALSTRING:\n opcode = OP_LITERALSTRING_FIXUP;\n break;\n case OP_LITERALCODE:\n opcode = OP_LITERALCODE_FIXUP;\n break;\n default:break;\n }\n \n f->write16(opcode);\n \n switch(p->opcode){\n case OP_LITERALINT:\n case OP_CLOSUREGET:\n case OP_CLOSURESET:\n case OP_LOCALSET:\n case OP_LOCALGET:\n case OP_GLOBALSET:\n case OP_GLOBALGET:\n case OP_CONSTSET:\n case OP_CONSTGET:\n case OP_WORD:\n case OP_IF:\n case OP_LEAVE:\n case OP_IFLEAVE:\n case OP_DECLEAVENEG:\n case OP_ITERLEAVEIFDONE:\n case OP_JUMP:\n f->writeInt(p->d.i);\n break;\n case OP_PROPSET:\n case OP_PROPGET:\n f->writeString(ser->angort->props.getKey(p->d.prop));\n break;\n case OP_LITERALFLOAT:\n f->writeFloat(p->d.f);\n break;\n case OP_LITERALSTRING:\n f->write32(ser->getFixupByData(p->d.cb));\n break;\n case OP_LITERALCODE:\n f->write32(ser->getFixupByData(p->d.s));\n break;\n case OP_FUNC:\n f->writeString(ser->angort->funcs.getKey(p->d.func));\n break;\n default:\n break;\n }\n }\n}\n\n\nvoid *CodeType::loadDataBlock(Serialiser *ser){\n return (void *)new CodeBlock(ser);\n \n}\n\nCodeBlock::CodeBlock(Serialiser *ser){\n char buf[1024];\n \n File *f = ser->file;\n \n size = f->read16();\n locals = f->read16();\n params = f->read16();\n closureMapCt = f->read16();\n spec = f->readStringAlloc();\n \n printf(\"Reading %d, locals %d, params %d, closureMapCt %d\\n\",\n size,locals,params,closureMapCt);\n \n \/\/ load closure map\n closureMap = new ClosureMapEntry[closureMapCt];\n for(int i=0;i<closureMapCt;i++){\n closureMap[i].parent = f->read16();\n closureMap[i].isLocalInParent = (f->read16()==1);\n }\n \n \/\/ load instructions\n ip = new Instruction[size];\n Instruction *p = (Instruction *)ip;\n \n for(int i=0;i<size;i++,p++){\n p->opcode = f->read16();\n \n switch(p->opcode){\n case OP_LITERALINT:\n case OP_CLOSUREGET:\n case OP_CLOSURESET:\n case OP_LOCALSET:\n case OP_LOCALGET:\n case OP_GLOBALSET:\n case OP_GLOBALGET:\n case OP_CONSTSET:\n case OP_CONSTGET:\n case OP_WORD:\n case OP_IF:\n case OP_LEAVE:\n case OP_IFLEAVE:\n case OP_DECLEAVENEG:\n case OP_ITERLEAVEIFDONE:\n case OP_JUMP:\n p->d.i = f->readInt();\n break;\n case OP_PROPSET:\n case OP_PROPGET:\n f->readString(buf,1024);\n p->d.prop = ser->angort->props.get(buf);\n break;\n case OP_LITERALFLOAT:\n p->d.f = f->readFloat();\n break;\n case OP_LITERALCODE_FIXUP:\n case OP_LITERALSTRING_FIXUP:\n p->d.fixup = f->read32();\n break;\n case OP_FUNC:\n f->readString(buf,1024);\n p->d.func = ser->angort->funcs.get(buf);\n break;\n case OP_LITERALSTRING:\n case OP_LITERALCODE:\n throw WTF; \/\/ should be a fixup!\n default:\n break;\n }\n }\n \n \n}\n\n<commit_msg>Save fixed. Again.<commit_after>\/**\n * @file\n * brief description, full stop.\n *\n * long description, many sentences.\n * \n *\/\n#include \"angort.h\"\n\n#include \"ser.h\"\n#include \"file.h\"\n#include \"opcodes.h\"\n\nvoid CodeType::set(Value *v,const struct CodeBlock *cb){\n v->clr();\n v->v.cb=cb;\n v->t = Types::tCode;\n}\n\n\n\nvoid CodeType::saveValue(Serialiser *ser, Value *v){\n ser->file->write32(ser->getFixupByData(v->v.cb));\n}\nvoid CodeType::loadValue(Serialiser *ser, Value *v){\n v->setFixup(ser->file->read32());\n}\n\n\nvoid CodeType::saveDataBlock(Serialiser *ser,const void *v){\n const CodeBlock *cb = (CodeBlock *)v;\n cb->save(ser);\n}\n\nvoid CodeBlock::save(Serialiser *ser) const {\n File *f = ser->file;\n \n f->write16(size);\n f->write16(locals);\n f->write16(params);\n f->write16(closureMapCt);\n f->writeString(spec?spec:\"\");\n \n \/\/ save closure map\n for(int i=0;i<closureMapCt;i++){\n f->write16(closureMap[i].parent);\n f->write16(closureMap[i].isLocalInParent ? 1 : 0);\n }\n \n \/\/ save instructions\n const Instruction *p = ip;\n for(int i=0;i<size;i++,p++){\n int opcode = p->opcode;\n \/\/ change the opcode for these, to indicate the data\n \/\/ is now a fixup index\n switch(p->opcode){\n case OP_LITERALSTRING:\n opcode = OP_LITERALSTRING_FIXUP;\n break;\n case OP_LITERALCODE:\n opcode = OP_LITERALCODE_FIXUP;\n break;\n default:break;\n }\n \n f->write16(opcode);\n \n switch(p->opcode){\n case OP_LITERALINT:\n case OP_CLOSUREGET:\n case OP_CLOSURESET:\n case OP_LOCALSET:\n case OP_LOCALGET:\n case OP_GLOBALSET:\n case OP_GLOBALGET:\n case OP_CONSTSET:\n case OP_CONSTGET:\n case OP_WORD:\n case OP_IF:\n case OP_LEAVE:\n case OP_IFLEAVE:\n case OP_DECLEAVENEG:\n case OP_ITERLEAVEIFDONE:\n case OP_JUMP:\n f->writeInt(p->d.i);\n break;\n case OP_PROPSET:\n case OP_PROPGET:\n f->writeString(ser->angort->props.getKey(p->d.prop));\n break;\n case OP_LITERALFLOAT:\n f->writeFloat(p->d.f);\n break;\n case OP_LITERALSTRING:\n f->write32(ser->getFixupByData(p->d.cb));\n break;\n case OP_LITERALCODE:\n f->write32(ser->getFixupByData(p->d.s));\n break;\n case OP_FUNC:\n f->writeString(ser->angort->funcs.getKey(p->d.func));\n break;\n default:\n break;\n }\n }\n}\n\n\nvoid *CodeType::loadDataBlock(Serialiser *ser){\n return (void *)new CodeBlock(ser);\n \n}\n\nCodeBlock::CodeBlock(Serialiser *ser){\n char buf[1024];\n \n File *f = ser->file;\n \n size = f->read16();\n locals = f->read16();\n params = f->read16();\n closureMapCt = f->read16();\n spec = f->readStringAlloc();\n \n printf(\"Reading %d, locals %d, params %d, closureMapCt %d\\n\",\n size,locals,params,closureMapCt);\n \n \/\/ load closure map\n closureMap = new ClosureMapEntry[closureMapCt];\n for(int i=0;i<closureMapCt;i++){\n closureMap[i].parent = f->read16();\n closureMap[i].isLocalInParent = (f->read16()==1);\n }\n \n \/\/ load instructions\n ip = new Instruction[size];\n Instruction *p = (Instruction *)ip;\n \n for(int i=0;i<size;i++,p++){\n p->opcode = f->read16();\n \n switch(p->opcode){\n case OP_LITERALINT:\n case OP_CLOSUREGET:\n case OP_CLOSURESET:\n case OP_LOCALSET:\n case OP_LOCALGET:\n case OP_GLOBALSET:\n case OP_GLOBALGET:\n case OP_CONSTSET:\n case OP_CONSTGET:\n case OP_WORD:\n case OP_IF:\n case OP_LEAVE:\n case OP_IFLEAVE:\n case OP_DECLEAVENEG:\n case OP_ITERLEAVEIFDONE:\n case OP_JUMP:\n p->d.i = f->readInt();\n break;\n case OP_PROPSET:\n case OP_PROPGET:\n f->readString(buf,1024);\n p->d.prop = ser->angort->props.get(buf);\n break;\n case OP_LITERALFLOAT:\n p->d.f = f->readFloat();\n break;\n case OP_LITERALCODE_FIXUP:\n case OP_LITERALSTRING_FIXUP:\n p->d.fixup = f->read32();\n break;\n case OP_FUNC:\n f->readString(buf,1024);\n p->d.func = ser->angort->funcs.get(buf);\n break;\n case OP_LITERALSTRING:\n case OP_LITERALCODE:\n throw WTF; \/\/ should be a fixup!\n default:\n break;\n }\n }\n \n \n}\n\n<|endoftext|>"} {"text":"<commit_before>\/*=========================================================================\n *\n * Copyright Insight Software Consortium\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http:\/\/www.apache.org\/licenses\/LICENSE-2.0.txt\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n *\n *=========================================================================*\/\n#ifndef __itkMinimumMaximumImageFilter_hxx\n#define __itkMinimumMaximumImageFilter_hxx\n#include \"itkMinimumMaximumImageFilter.h\"\n\n#include \"itkImageRegionIterator.h\"\n#include \"itkProgressReporter.h\"\n\n#include <vector>\n\nnamespace itk\n{\ntemplate< class TInputImage >\nMinimumMaximumImageFilter< TInputImage >\n::MinimumMaximumImageFilter()\n{\n this->SetNumberOfRequiredOutputs(3);\n \/\/ first output is a copy of the image, DataObject created by\n \/\/ superclass\n \/\/\n \/\/ allocate the data objects for the remaining outputs which are\n \/\/ just decorators around floating point types\n for ( int i = 1; i < 3; ++i )\n {\n typename PixelObjectType::Pointer output =\n static_cast< PixelObjectType * >( this->MakeOutput(i).GetPointer() );\n this->ProcessObject::SetNthOutput( i, output.GetPointer() );\n }\n\n this->GetMinimumOutput()->Set( NumericTraits< PixelType >::max() );\n this->GetMaximumOutput()->Set( NumericTraits< PixelType >::NonpositiveMin() );\n}\n\ntemplate< class TInputImage >\nDataObject::Pointer\nMinimumMaximumImageFilter< TInputImage >\n::MakeOutput(DataObjectPointerArraySizeType output)\n{\n switch ( output )\n {\n case 0:\n return static_cast< DataObject * >( TInputImage::New().GetPointer() );\n break;\n case 1:\n case 2:\n return static_cast< DataObject * >( PixelObjectType::New().GetPointer() );\n break;\n default:\n \/\/ might as well make an image\n return static_cast< DataObject * >( TInputImage::New().GetPointer() );\n break;\n }\n}\n\ntemplate< class TInputImage >\ntypename MinimumMaximumImageFilter< TInputImage >::PixelObjectType *\nMinimumMaximumImageFilter< TInputImage >\n::GetMinimumOutput()\n{\n return static_cast< PixelObjectType * >( this->ProcessObject::GetOutput(1) );\n}\n\ntemplate< class TInputImage >\nconst typename MinimumMaximumImageFilter< TInputImage >::PixelObjectType *\nMinimumMaximumImageFilter< TInputImage >\n::GetMinimumOutput() const\n{\n return static_cast< const PixelObjectType * >( this->ProcessObject::GetOutput(1) );\n}\n\ntemplate< class TInputImage >\ntypename MinimumMaximumImageFilter< TInputImage >::PixelObjectType *\nMinimumMaximumImageFilter< TInputImage >\n::GetMaximumOutput()\n{\n return static_cast< PixelObjectType * >( this->ProcessObject::GetOutput(2) );\n}\n\ntemplate< class TInputImage >\nconst typename MinimumMaximumImageFilter< TInputImage >::PixelObjectType *\nMinimumMaximumImageFilter< TInputImage >\n::GetMaximumOutput() const\n{\n return static_cast< const PixelObjectType * >( this->ProcessObject::GetOutput(2) );\n}\n\ntemplate< class TInputImage >\nvoid\nMinimumMaximumImageFilter< TInputImage >\n::GenerateInputRequestedRegion()\n{\n Superclass::GenerateInputRequestedRegion();\n if ( this->GetInput() )\n {\n InputImagePointer image =\n const_cast< typename Superclass::InputImageType * >( this->GetInput() );\n image->SetRequestedRegionToLargestPossibleRegion();\n }\n}\n\ntemplate< class TInputImage >\nvoid\nMinimumMaximumImageFilter< TInputImage >\n::EnlargeOutputRequestedRegion(DataObject *data)\n{\n Superclass::EnlargeOutputRequestedRegion(data);\n data->SetRequestedRegionToLargestPossibleRegion();\n}\n\ntemplate< class TInputImage >\nvoid\nMinimumMaximumImageFilter< TInputImage >\n::AllocateOutputs()\n{\n \/\/ Pass the input through as the output\n InputImagePointer image =\n const_cast< TInputImage * >( this->GetInput() );\n\n this->GraftOutput(image);\n\n \/\/ Nothing that needs to be allocated for the remaining outputs\n}\n\ntemplate< class TInputImage >\nvoid\nMinimumMaximumImageFilter< TInputImage >\n::BeforeThreadedGenerateData()\n{\n ThreadIdType numberOfThreads = this->GetNumberOfThreads();\n\n \/\/ Create the thread temporaries\n m_ThreadMin = std::vector< PixelType >( numberOfThreads,\n NumericTraits< PixelType >::max() );\n m_ThreadMax = std::vector< PixelType >( numberOfThreads,\n NumericTraits< PixelType >::NonpositiveMin() );\n}\n\ntemplate< class TInputImage >\nvoid\nMinimumMaximumImageFilter< TInputImage >\n::AfterThreadedGenerateData()\n{\n ThreadIdType i;\n ThreadIdType numberOfThreads = this->GetNumberOfThreads();\n\n PixelType minimum, maximum;\n\n \/\/ Find the min\/max over all threads\n minimum = NumericTraits< PixelType >::max();\n maximum = NumericTraits< PixelType >::NonpositiveMin();\n for ( i = 0; i < numberOfThreads; i++ )\n {\n if ( m_ThreadMin[i] < minimum )\n {\n minimum = m_ThreadMin[i];\n }\n if ( m_ThreadMax[i] > maximum )\n {\n maximum = m_ThreadMax[i];\n }\n }\n\n \/\/ Set the outputs\n this->GetMinimumOutput()->Set(minimum);\n this->GetMaximumOutput()->Set(maximum);\n}\n\ntemplate< class TInputImage >\nvoid\nMinimumMaximumImageFilter< TInputImage >\n::ThreadedGenerateData(const RegionType & outputRegionForThread,\n ThreadIdType threadId)\n{\n PixelType value;\n\n ImageRegionConstIterator< TInputImage > it (this->GetInput(), outputRegionForThread);\n\n \/\/ support progress methods\/callbacks\n ProgressReporter progress( this, threadId, outputRegionForThread.GetNumberOfPixels() );\n\n \/\/ do the work\n while ( !it.IsAtEnd() )\n {\n value = static_cast< PixelType >( it.Get() );\n if ( value < m_ThreadMin[threadId] )\n {\n m_ThreadMin[threadId] = value;\n }\n if ( value > m_ThreadMax[threadId] )\n {\n m_ThreadMax[threadId] = value;\n }\n ++it;\n progress.CompletedPixel();\n }\n}\n\ntemplate< class TImage >\nvoid\nMinimumMaximumImageFilter< TImage >\n::PrintSelf(std::ostream & os, Indent indent) const\n{\n Superclass::PrintSelf(os, indent);\n\n os << indent << \"Minimum: \"\n << static_cast< typename NumericTraits< PixelType >::PrintType >( this->GetMinimum() )\n << std::endl;\n os << indent << \"Maximum: \"\n << static_cast< typename NumericTraits< PixelType >::PrintType >( this->GetMaximum() )\n << std::endl;\n}\n} \/\/ end namespace itk\n#endif\n<commit_msg>PERF: eliminate false sharing, improved algorithm<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 __itkMinimumMaximumImageFilter_hxx\n#define __itkMinimumMaximumImageFilter_hxx\n#include \"itkMinimumMaximumImageFilter.h\"\n\n#include \"itkImageRegionIterator.h\"\n#include \"itkProgressReporter.h\"\n\n#include <vector>\n\nnamespace itk\n{\ntemplate< class TInputImage >\nMinimumMaximumImageFilter< TInputImage >\n::MinimumMaximumImageFilter()\n{\n this->SetNumberOfRequiredOutputs(3);\n \/\/ first output is a copy of the image, DataObject created by\n \/\/ superclass\n \/\/\n \/\/ allocate the data objects for the remaining outputs which are\n \/\/ just decorators around floating point types\n for ( int i = 1; i < 3; ++i )\n {\n typename PixelObjectType::Pointer output =\n static_cast< PixelObjectType * >( this->MakeOutput(i).GetPointer() );\n this->ProcessObject::SetNthOutput( i, output.GetPointer() );\n }\n\n this->GetMinimumOutput()->Set( NumericTraits< PixelType >::max() );\n this->GetMaximumOutput()->Set( NumericTraits< PixelType >::NonpositiveMin() );\n}\n\ntemplate< class TInputImage >\nDataObject::Pointer\nMinimumMaximumImageFilter< TInputImage >\n::MakeOutput(DataObjectPointerArraySizeType output)\n{\n switch ( output )\n {\n case 0:\n return static_cast< DataObject * >( TInputImage::New().GetPointer() );\n break;\n case 1:\n case 2:\n return static_cast< DataObject * >( PixelObjectType::New().GetPointer() );\n break;\n default:\n \/\/ might as well make an image\n return static_cast< DataObject * >( TInputImage::New().GetPointer() );\n break;\n }\n}\n\ntemplate< class TInputImage >\ntypename MinimumMaximumImageFilter< TInputImage >::PixelObjectType *\nMinimumMaximumImageFilter< TInputImage >\n::GetMinimumOutput()\n{\n return static_cast< PixelObjectType * >( this->ProcessObject::GetOutput(1) );\n}\n\ntemplate< class TInputImage >\nconst typename MinimumMaximumImageFilter< TInputImage >::PixelObjectType *\nMinimumMaximumImageFilter< TInputImage >\n::GetMinimumOutput() const\n{\n return static_cast< const PixelObjectType * >( this->ProcessObject::GetOutput(1) );\n}\n\ntemplate< class TInputImage >\ntypename MinimumMaximumImageFilter< TInputImage >::PixelObjectType *\nMinimumMaximumImageFilter< TInputImage >\n::GetMaximumOutput()\n{\n return static_cast< PixelObjectType * >( this->ProcessObject::GetOutput(2) );\n}\n\ntemplate< class TInputImage >\nconst typename MinimumMaximumImageFilter< TInputImage >::PixelObjectType *\nMinimumMaximumImageFilter< TInputImage >\n::GetMaximumOutput() const\n{\n return static_cast< const PixelObjectType * >( this->ProcessObject::GetOutput(2) );\n}\n\ntemplate< class TInputImage >\nvoid\nMinimumMaximumImageFilter< TInputImage >\n::GenerateInputRequestedRegion()\n{\n Superclass::GenerateInputRequestedRegion();\n if ( this->GetInput() )\n {\n InputImagePointer image =\n const_cast< typename Superclass::InputImageType * >( this->GetInput() );\n image->SetRequestedRegionToLargestPossibleRegion();\n }\n}\n\ntemplate< class TInputImage >\nvoid\nMinimumMaximumImageFilter< TInputImage >\n::EnlargeOutputRequestedRegion(DataObject *data)\n{\n Superclass::EnlargeOutputRequestedRegion(data);\n data->SetRequestedRegionToLargestPossibleRegion();\n}\n\ntemplate< class TInputImage >\nvoid\nMinimumMaximumImageFilter< TInputImage >\n::AllocateOutputs()\n{\n \/\/ Pass the input through as the output\n InputImagePointer image =\n const_cast< TInputImage * >( this->GetInput() );\n\n this->GraftOutput(image);\n\n \/\/ Nothing that needs to be allocated for the remaining outputs\n}\n\ntemplate< class TInputImage >\nvoid\nMinimumMaximumImageFilter< TInputImage >\n::BeforeThreadedGenerateData()\n{\n ThreadIdType numberOfThreads = this->GetNumberOfThreads();\n\n \/\/ Create the thread temporaries\n m_ThreadMin = std::vector< PixelType >( numberOfThreads,\n NumericTraits< PixelType >::max() );\n m_ThreadMax = std::vector< PixelType >( numberOfThreads,\n NumericTraits< PixelType >::NonpositiveMin() );\n}\n\ntemplate< class TInputImage >\nvoid\nMinimumMaximumImageFilter< TInputImage >\n::AfterThreadedGenerateData()\n{\n ThreadIdType i;\n ThreadIdType numberOfThreads = this->GetNumberOfThreads();\n\n PixelType minimum, maximum;\n\n \/\/ Find the min\/max over all threads\n minimum = NumericTraits< PixelType >::max();\n maximum = NumericTraits< PixelType >::NonpositiveMin();\n for ( i = 0; i < numberOfThreads; i++ )\n {\n if ( m_ThreadMin[i] < minimum )\n {\n minimum = m_ThreadMin[i];\n }\n if ( m_ThreadMax[i] > maximum )\n {\n maximum = m_ThreadMax[i];\n }\n }\n\n \/\/ Set the outputs\n this->GetMinimumOutput()->Set(minimum);\n this->GetMaximumOutput()->Set(maximum);\n}\n\ntemplate< class TInputImage >\nvoid\nMinimumMaximumImageFilter< TInputImage >\n::ThreadedGenerateData(const RegionType & outputRegionForThread,\n ThreadIdType threadId)\n{\n if ( outputRegionForThread.GetNumberOfPixels() == 0 )\n return;\n\n PixelType localMin = m_ThreadMin[threadId];\n PixelType localMax = m_ThreadMax[threadId];\n\n ImageRegionConstIterator< TInputImage > it (this->GetInput(), outputRegionForThread);\n\n \/\/ support progress methods\/callbacks\n ProgressReporter progress( this, threadId, outputRegionForThread.GetNumberOfPixels()\/2 );\n\n \/\/ Handle the odd pixel separately\n if ( outputRegionForThread.GetNumberOfPixels()%2 == 1 )\n {\n const PixelType value = it.Get();\n localMin = localMax = value;\n ++it;\n }\n\n \/\/ do the work for the even number of pixels 2 at a time\n while ( !it.IsAtEnd() )\n {\n const PixelType value1 = it.Get();\n ++it;\n const PixelType value2 = it.Get();\n ++it;\n\n if (value1 > value2)\n {\n localMax = std::max(value1,localMax);\n localMin = std::min(value2,localMin);\n }\n else\n {\n localMax = std::max(value2,localMax);\n localMin = std::min(value1,localMin);\n }\n progress.CompletedPixel();\n }\n\n m_ThreadMin[threadId] = localMin;\n m_ThreadMax[threadId] = localMax;\n}\n\ntemplate< class TImage >\nvoid\nMinimumMaximumImageFilter< TImage >\n::PrintSelf(std::ostream & os, Indent indent) const\n{\n Superclass::PrintSelf(os, indent);\n\n os << indent << \"Minimum: \"\n << static_cast< typename NumericTraits< PixelType >::PrintType >( this->GetMinimum() )\n << std::endl;\n os << indent << \"Maximum: \"\n << static_cast< typename NumericTraits< PixelType >::PrintType >( this->GetMaximum() )\n << std::endl;\n}\n} \/\/ end namespace itk\n#endif\n<|endoftext|>"} {"text":"<commit_before>\/\/ Licensed under the Apache License, Version 2.0 (the \"License\");\n\/\/ you may not use this file except in compliance with the License.\n\/\/ You may obtain a copy of the License at\n\/\/\n\/\/ http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n\/\/\n\/\/ Unless required by applicable law or agreed to in writing, software\n\/\/ distributed under the License is distributed on an \"AS IS\" BASIS,\n\/\/ WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n\/\/ See the License for the specific language governing permissions and\n\/\/ limitations under the License\n\n#ifndef __PROCESS_NETWORK_HPP__\n#define __PROCESS_NETWORK_HPP__\n\n#include <process\/address.hpp>\n\n#include <stout\/net.hpp>\n#include <stout\/try.hpp>\n\nnamespace process {\nnamespace network {\n\n\/**\n * Returns a socket file descriptor for the specified options.\n *\n * **NOTE:** on OS X, the returned socket will have the SO_NOSIGPIPE\n * option set.\n *\/\ninline Try<int> socket(int family, int type, int protocol)\n{\n int s;\n if ((s = ::socket(family, type, protocol)) == -1) {\n return ErrnoError();\n }\n\n#ifdef __APPLE__\n \/\/ Disable SIGPIPE via setsockopt because OS X does not support\n \/\/ the MSG_NOSIGNAL flag on send(2).\n const int enable = 1;\n if (setsockopt(s, SOL_SOCKET, SO_NOSIGPIPE, &enable, sizeof(int)) == -1) {\n return ErrnoError();\n }\n#endif \/\/ __APPLE__\n\n return s;\n}\n\n\n\/\/ TODO(benh): Remove and defer to Socket::accept.\ninline Try<int> accept(int s)\n{\n struct sockaddr_storage storage;\n socklen_t storagelen = sizeof(storage);\n\n int accepted = ::accept(s, (struct sockaddr*) &storage, &storagelen);\n if (accepted < 0) {\n return ErrnoError(\"Failed to accept\");\n }\n\n return accepted;\n}\n\n\n\/\/ TODO(benh): Remove and defer to Socket::bind.\ninline Try<int> bind(int s, const Address& address)\n{\n struct sockaddr_storage storage =\n net::createSockaddrStorage(address.ip, address.port);\n\n int error = ::bind(s, (struct sockaddr*) &storage, address.size());\n if (error < 0) {\n return ErrnoError(\"Failed to bind on \" + stringify(address));\n }\n\n return error;\n}\n\n\n\/\/ TODO(benh): Remove and defer to Socket::connect.\ninline Try<int> connect(int s, const Address& address)\n{\n struct sockaddr_storage storage =\n net::createSockaddrStorage(address.ip, address.port);\n\n int error = ::connect(s, (struct sockaddr*) &storage, address.size());\n if (error < 0) {\n return ErrnoError(\"Failed to connect to \" + stringify(address));\n }\n\n return error;\n}\n\n\n\/**\n * Returns the `Address` with the assigned ip and assigned port.\n *\n * @return An `Address` or an error if the `getsockname` system call\n * fails or the family type is not supported.\n *\/\ninline Try<Address> address(int s)\n{\n struct sockaddr_storage storage;\n socklen_t storagelen = sizeof(storage);\n\n if (::getsockname(s, (struct sockaddr*) &storage, &storagelen) < 0) {\n return ErrnoError(\"Failed to getsockname\");\n }\n\n return Address::create(storage);\n}\n\n\n\/**\n * Returns the peer's `Address` for the accepted or connected socket.\n *\n * @return An `Address` or an error if the `getpeername` system call\n * fails or the family type is not supported.\n *\/\ninline Try<Address> peer(int s)\n{\n struct sockaddr_storage storage;\n socklen_t storagelen = sizeof(storage);\n\n if (::getpeername(s, (struct sockaddr*) &storage, &storagelen) < 0) {\n return ErrnoError(\"Failed to getpeername\");\n }\n\n return Address::create(storage);\n}\n\n} \/\/ namespace network {\n} \/\/ namespace process {\n\n#endif \/\/ __PROCESS_NETWORK_HPP__\n<commit_msg>Windows: [2\/2] Lifted socket API into Stout.<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 __PROCESS_NETWORK_HPP__\n#define __PROCESS_NETWORK_HPP__\n\n#include <process\/address.hpp>\n\n#include <stout\/net.hpp>\n#include <stout\/try.hpp>\n\n#include <stout\/os\/socket.hpp>\n\n\nnamespace process {\nnamespace network {\n\nusing net::socket;\n\n\/\/ TODO(benh): Remove and defer to Socket::accept.\ninline Try<int> accept(int s)\n{\n struct sockaddr_storage storage;\n socklen_t storagelen = sizeof(storage);\n\n int accepted = ::accept(s, (struct sockaddr*) &storage, &storagelen);\n if (accepted < 0) {\n return ErrnoError(\"Failed to accept\");\n }\n\n return accepted;\n}\n\n\n\/\/ TODO(benh): Remove and defer to Socket::bind.\ninline Try<int> bind(int s, const Address& address)\n{\n struct sockaddr_storage storage =\n net::createSockaddrStorage(address.ip, address.port);\n\n int error = ::bind(s, (struct sockaddr*) &storage, address.size());\n if (error < 0) {\n return ErrnoError(\"Failed to bind on \" + stringify(address));\n }\n\n return error;\n}\n\n\n\/\/ TODO(benh): Remove and defer to Socket::connect.\ninline Try<int> connect(int s, const Address& address)\n{\n struct sockaddr_storage storage =\n net::createSockaddrStorage(address.ip, address.port);\n\n int error = ::connect(s, (struct sockaddr*) &storage, address.size());\n if (error < 0) {\n return ErrnoError(\"Failed to connect to \" + stringify(address));\n }\n\n return error;\n}\n\n\n\/**\n * Returns the `Address` with the assigned ip and assigned port.\n *\n * @return An `Address` or an error if the `getsockname` system call\n * fails or the family type is not supported.\n *\/\ninline Try<Address> address(int s)\n{\n struct sockaddr_storage storage;\n socklen_t storagelen = sizeof(storage);\n\n if (::getsockname(s, (struct sockaddr*) &storage, &storagelen) < 0) {\n return ErrnoError(\"Failed to getsockname\");\n }\n\n return Address::create(storage);\n}\n\n\n\/**\n * Returns the peer's `Address` for the accepted or connected socket.\n *\n * @return An `Address` or an error if the `getpeername` system call\n * fails or the family type is not supported.\n *\/\ninline Try<Address> peer(int s)\n{\n struct sockaddr_storage storage;\n socklen_t storagelen = sizeof(storage);\n\n if (::getpeername(s, (struct sockaddr*) &storage, &storagelen) < 0) {\n return ErrnoError(\"Failed to getpeername\");\n }\n\n return Address::create(storage);\n}\n\n} \/\/ namespace network {\n} \/\/ namespace process {\n\n#endif \/\/ __PROCESS_NETWORK_HPP__\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#ifndef __PROCESS_NETWORK_HPP__\n#define __PROCESS_NETWORK_HPP__\n\n#include <process\/address.hpp>\n\n#include <stout\/net.hpp>\n#include <stout\/try.hpp>\n\nnamespace process {\nnamespace network {\n\n\/**\n * Returns a socket file descriptor for the specified options.\n *\n * **NOTE:** on OS X, the returned socket will have the SO_NOSIGPIPE\n * option set.\n *\/\ninline Try<int> socket(int family, int type, int protocol)\n{\n int s;\n if ((s = ::socket(family, type, protocol)) == -1) {\n return ErrnoError();\n }\n\n#ifdef __APPLE__\n \/\/ Disable SIGPIPE via setsockopt because OS X does not support\n \/\/ the MSG_NOSIGNAL flag on send(2).\n const int enable = 1;\n if (setsockopt(s, SOL_SOCKET, SO_NOSIGPIPE, &enable, sizeof(int)) == -1) {\n return ErrnoError();\n }\n#endif \/\/ __APPLE__\n\n return s;\n}\n\n\n\/\/ TODO(benh): Remove and defer to Socket::accept.\ninline Try<int> accept(int s)\n{\n struct sockaddr_storage storage;\n socklen_t storagelen = sizeof(storage);\n\n int accepted = ::accept(s, (struct sockaddr*) &storage, &storagelen);\n if (accepted < 0) {\n return ErrnoError(\"Failed to accept\");\n }\n\n return accepted;\n}\n\n\n\/\/ TODO(benh): Remove and defer to Socket::bind.\ninline Try<int> bind(int s, const Address& address)\n{\n struct sockaddr_storage storage =\n net::createSockaddrStorage(address.ip, address.port);\n\n int error = ::bind(s, (struct sockaddr*) &storage, address.size());\n if (error < 0) {\n return ErrnoError(\"Failed to bind on \" + stringify(address));\n }\n\n return error;\n}\n\n\n\/\/ TODO(benh): Remove and defer to Socket::connect.\ninline Try<int> connect(int s, const Address& address)\n{\n struct sockaddr_storage storage =\n net::createSockaddrStorage(address.ip, address.port);\n\n int error = ::connect(s, (struct sockaddr*) &storage, address.size());\n if (error < 0) {\n return ErrnoError(\"Failed to connect to \" + stringify(address));\n }\n\n return error;\n}\n\n\n\/**\n * Returns the `Address` with the assigned ip and assigned port.\n *\n * @return An `Address` or an error if the `getsockname` system call\n * fails or the family type is not supported.\n *\/\ninline Try<Address> address(int s)\n{\n struct sockaddr_storage storage;\n socklen_t storagelen = sizeof(storage);\n\n if(::getsockname(s, (struct sockaddr*) &storage, &storagelen) < 0) {\n return ErrnoError(\"Failed to getsockname\");\n }\n\n return Address::create(storage);\n}\n\n\n\/**\n * Returns the peer's `Address` for the accepted or connected socket.\n *\n * @return An `Address` or an error if the `getpeername` system call\n * fails or the family type is not supported.\n *\/\ninline Try<Address> peer(int s)\n{\n struct sockaddr_storage storage;\n socklen_t storagelen = sizeof(storage);\n\n if(::getpeername(s, (struct sockaddr*) &storage, &storagelen) < 0) {\n return ErrnoError(\"Failed to getpeername\");\n }\n\n return Address::create(storage);\n}\n\n} \/\/ namespace network {\n} \/\/ namespace process {\n\n#endif \/\/ __PROCESS_NETWORK_HPP__\n<commit_msg>libprocess: Fixed style issues around control structures.<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#ifndef __PROCESS_NETWORK_HPP__\n#define __PROCESS_NETWORK_HPP__\n\n#include <process\/address.hpp>\n\n#include <stout\/net.hpp>\n#include <stout\/try.hpp>\n\nnamespace process {\nnamespace network {\n\n\/**\n * Returns a socket file descriptor for the specified options.\n *\n * **NOTE:** on OS X, the returned socket will have the SO_NOSIGPIPE\n * option set.\n *\/\ninline Try<int> socket(int family, int type, int protocol)\n{\n int s;\n if ((s = ::socket(family, type, protocol)) == -1) {\n return ErrnoError();\n }\n\n#ifdef __APPLE__\n \/\/ Disable SIGPIPE via setsockopt because OS X does not support\n \/\/ the MSG_NOSIGNAL flag on send(2).\n const int enable = 1;\n if (setsockopt(s, SOL_SOCKET, SO_NOSIGPIPE, &enable, sizeof(int)) == -1) {\n return ErrnoError();\n }\n#endif \/\/ __APPLE__\n\n return s;\n}\n\n\n\/\/ TODO(benh): Remove and defer to Socket::accept.\ninline Try<int> accept(int s)\n{\n struct sockaddr_storage storage;\n socklen_t storagelen = sizeof(storage);\n\n int accepted = ::accept(s, (struct sockaddr*) &storage, &storagelen);\n if (accepted < 0) {\n return ErrnoError(\"Failed to accept\");\n }\n\n return accepted;\n}\n\n\n\/\/ TODO(benh): Remove and defer to Socket::bind.\ninline Try<int> bind(int s, const Address& address)\n{\n struct sockaddr_storage storage =\n net::createSockaddrStorage(address.ip, address.port);\n\n int error = ::bind(s, (struct sockaddr*) &storage, address.size());\n if (error < 0) {\n return ErrnoError(\"Failed to bind on \" + stringify(address));\n }\n\n return error;\n}\n\n\n\/\/ TODO(benh): Remove and defer to Socket::connect.\ninline Try<int> connect(int s, const Address& address)\n{\n struct sockaddr_storage storage =\n net::createSockaddrStorage(address.ip, address.port);\n\n int error = ::connect(s, (struct sockaddr*) &storage, address.size());\n if (error < 0) {\n return ErrnoError(\"Failed to connect to \" + stringify(address));\n }\n\n return error;\n}\n\n\n\/**\n * Returns the `Address` with the assigned ip and assigned port.\n *\n * @return An `Address` or an error if the `getsockname` system call\n * fails or the family type is not supported.\n *\/\ninline Try<Address> address(int s)\n{\n struct sockaddr_storage storage;\n socklen_t storagelen = sizeof(storage);\n\n if (::getsockname(s, (struct sockaddr*) &storage, &storagelen) < 0) {\n return ErrnoError(\"Failed to getsockname\");\n }\n\n return Address::create(storage);\n}\n\n\n\/**\n * Returns the peer's `Address` for the accepted or connected socket.\n *\n * @return An `Address` or an error if the `getpeername` system call\n * fails or the family type is not supported.\n *\/\ninline Try<Address> peer(int s)\n{\n struct sockaddr_storage storage;\n socklen_t storagelen = sizeof(storage);\n\n if (::getpeername(s, (struct sockaddr*) &storage, &storagelen) < 0) {\n return ErrnoError(\"Failed to getpeername\");\n }\n\n return Address::create(storage);\n}\n\n} \/\/ namespace network {\n} \/\/ namespace process {\n\n#endif \/\/ __PROCESS_NETWORK_HPP__\n<|endoftext|>"} {"text":"<commit_before>\/\/ Licensed under the Apache License, Version 2.0 (the \"License\");\n\/\/ you may not use this file except in compliance with the License.\n\/\/ You may obtain a copy of the License at\n\/\/\n\/\/ http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n\/\/\n\/\/ Unless required by applicable law or agreed to in writing, software\n\/\/ distributed under the License is distributed on an \"AS IS\" BASIS,\n\/\/ WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n\/\/ See the License for the specific language governing permissions and\n\/\/ limitations under the License.\n\n#ifndef __STOUT_OS_POSIX_SHELL_HPP__\n#define __STOUT_OS_POSIX_SHELL_HPP__\n\n#include <stdarg.h> \/\/ For va_list, va_start, etc.\n#include <stdio.h> \/\/ For ferror, fgets, FILE, pclose, popen.\n\n#include <sys\/wait.h> \/\/ For waitpid.\n\n#include <ostream>\n#include <string>\n\n#include <glog\/logging.h>\n\n#include <stout\/error.hpp>\n#include <stout\/format.hpp>\n#include <stout\/try.hpp>\n\n#include <stout\/os\/raw\/argv.hpp>\n\nnamespace os {\n\n\/\/ Import `::execvp` into `os::` namespace.\nusing ::execvp;\n\nnamespace Shell {\n\n\/\/ Canonical constants used as platform-dependent args to `exec`\n\/\/ calls. `name` is the command name, `arg0` is the first argument\n\/\/ received by the callee, usually the command name and `arg1` is the\n\/\/ second command argument received by the callee.\n\nconstexpr const char* name = \"sh\";\nconstexpr const char* arg0 = \"sh\";\nconstexpr const char* arg1 = \"-c\";\n\n} \/\/ namespace Shell {\n\n\/**\n * Runs a shell command with optional arguments.\n *\n * This assumes that a successful execution will result in the exit code\n * for the command to be `EXIT_SUCCESS`; in this case, the contents\n * of the `Try` will be the contents of `stdout`.\n *\n * If the exit code is non-zero or the process was signaled, we will\n * return an appropriate error message; but *not* `stderr`.\n *\n * If the caller needs to examine the contents of `stderr` it should\n * be redirected to `stdout` (using, e.g., \"2>&1 || true\" in the command\n * string). The `|| true` is required to obtain a success exit\n * code in case of errors, and still obtain `stderr`, as piped to\n * `stdout`.\n *\n * @param fmt the formatting string that contains the command to execute\n * in the underlying shell.\n * @param t optional arguments for `fmt`.\n *\n * @return the output from running the specified command with the shell; or\n * an error message if the command's exit code is non-zero.\n *\/\ntemplate <typename... T>\nTry<std::string> shell(const std::string& fmt, const T&... t)\n{\n const Try<std::string> command = strings::internal::format(fmt, t...);\n if (command.isError()) {\n return Error(command.error());\n }\n\n FILE* file;\n std::ostringstream stdout;\n\n if ((file = popen(command.get().c_str(), \"r\")) == nullptr) {\n return Error(\"Failed to run '\" + command.get() + \"'\");\n }\n\n char line[1024];\n \/\/ NOTE(vinod): Ideally the if and while loops should be interchanged. But\n \/\/ we get a broken pipe error if we don't read the output and simply close.\n while (fgets(line, sizeof(line), file) != nullptr) {\n stdout << line;\n }\n\n if (ferror(file) != 0) {\n pclose(file); \/\/ Ignoring result since we already have an error.\n return Error(\"Error reading output of '\" + command.get() + \"'\");\n }\n\n int status;\n if ((status = pclose(file)) == -1) {\n return Error(\"Failed to get status of '\" + command.get() + \"'\");\n }\n\n if (WIFSIGNALED(status)) {\n return Error(\n \"Running '\" + command.get() + \"' was interrupted by signal '\" +\n strsignal(WTERMSIG(status)) + \"'\");\n } else if ((WEXITSTATUS(status) != EXIT_SUCCESS)) {\n LOG(ERROR) << \"Command '\" << command.get()\n << \"' failed; this is the output:\\n\" << stdout.str();\n return Error(\n \"Failed to execute '\" + command.get() + \"'; the command was either \"\n \"not found or exited with a non-zero exit status: \" +\n stringify(WEXITSTATUS(status)));\n }\n\n return stdout.str();\n}\n\n\n\/\/ Executes a command by calling \"\/bin\/sh -c <command>\", and returns\n\/\/ after the command has been completed. Returns 0 if succeeds, and\n\/\/ return -1 on error (e.g., fork\/exec\/waitpid failed). This function\n\/\/ is async signal safe. We return int instead of returning a Try\n\/\/ because Try involves 'new', which is not async signal safe.\ninline int system(const std::string& command)\n{\n pid_t pid = ::fork();\n\n if (pid == -1) {\n return -1;\n } else if (pid == 0) {\n \/\/ In child process.\n ::execlp(\n Shell::name, Shell::arg0, Shell::arg1, command.c_str(), (char*)nullptr);\n ::exit(127);\n } else {\n \/\/ In parent process.\n int status;\n while (::waitpid(pid, &status, 0) == -1) {\n if (errno != EINTR) {\n return -1;\n }\n }\n\n return status;\n }\n}\n\n\/\/ Executes a command by calling \"<command> <arguments...>\", and\n\/\/ returns after the command has been completed. Returns 0 if\n\/\/ succeeds, and -1 on error (e.g., fork\/exec\/waitpid failed). This\n\/\/ function is async signal safe. We return int instead of returning a\n\/\/ Try because Try involves 'new', which is not async signal safe.\ninline int spawn(\n const std::string& command,\n const std::vector<std::string>& arguments)\n{\n pid_t pid = ::fork();\n\n if (pid == -1) {\n return -1;\n } else if (pid == 0) {\n \/\/ In child process.\n ::execvp(command.c_str(), os::raw::Argv(arguments));\n ::exit(127);\n } else {\n \/\/ In parent process.\n int status;\n while (::waitpid(pid, &status, 0) == -1) {\n if (errno != EINTR) {\n return -1;\n }\n }\n\n return status;\n }\n}\n\n\ntemplate<typename... T>\ninline int execlp(const char* file, T... t)\n{\n return ::execlp(file, t...);\n}\n\n} \/\/ namespace os {\n\n#endif \/\/ __STOUT_OS_POSIX_SHELL_HPP__\n<commit_msg>Made execvp explicit in posix\/shell.hpp.<commit_after>\/\/ Licensed under the Apache License, Version 2.0 (the \"License\");\n\/\/ you may not use this file except in compliance with the License.\n\/\/ You may obtain a copy of the License at\n\/\/\n\/\/ http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n\/\/\n\/\/ Unless required by applicable law or agreed to in writing, software\n\/\/ distributed under the License is distributed on an \"AS IS\" BASIS,\n\/\/ WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n\/\/ See the License for the specific language governing permissions and\n\/\/ limitations under the License.\n\n#ifndef __STOUT_OS_POSIX_SHELL_HPP__\n#define __STOUT_OS_POSIX_SHELL_HPP__\n\n#include <stdarg.h> \/\/ For va_list, va_start, etc.\n#include <stdio.h> \/\/ For ferror, fgets, FILE, pclose, popen.\n\n#include <sys\/wait.h> \/\/ For waitpid.\n\n#include <ostream>\n#include <string>\n\n#include <glog\/logging.h>\n\n#include <stout\/error.hpp>\n#include <stout\/format.hpp>\n#include <stout\/try.hpp>\n\n#include <stout\/os\/raw\/argv.hpp>\n\nnamespace os {\n\nnamespace Shell {\n\n\/\/ Canonical constants used as platform-dependent args to `exec`\n\/\/ calls. `name` is the command name, `arg0` is the first argument\n\/\/ received by the callee, usually the command name and `arg1` is the\n\/\/ second command argument received by the callee.\n\nconstexpr const char* name = \"sh\";\nconstexpr const char* arg0 = \"sh\";\nconstexpr const char* arg1 = \"-c\";\n\n} \/\/ namespace Shell {\n\n\/**\n * Runs a shell command with optional arguments.\n *\n * This assumes that a successful execution will result in the exit code\n * for the command to be `EXIT_SUCCESS`; in this case, the contents\n * of the `Try` will be the contents of `stdout`.\n *\n * If the exit code is non-zero or the process was signaled, we will\n * return an appropriate error message; but *not* `stderr`.\n *\n * If the caller needs to examine the contents of `stderr` it should\n * be redirected to `stdout` (using, e.g., \"2>&1 || true\" in the command\n * string). The `|| true` is required to obtain a success exit\n * code in case of errors, and still obtain `stderr`, as piped to\n * `stdout`.\n *\n * @param fmt the formatting string that contains the command to execute\n * in the underlying shell.\n * @param t optional arguments for `fmt`.\n *\n * @return the output from running the specified command with the shell; or\n * an error message if the command's exit code is non-zero.\n *\/\ntemplate <typename... T>\nTry<std::string> shell(const std::string& fmt, const T&... t)\n{\n const Try<std::string> command = strings::internal::format(fmt, t...);\n if (command.isError()) {\n return Error(command.error());\n }\n\n FILE* file;\n std::ostringstream stdout;\n\n if ((file = popen(command.get().c_str(), \"r\")) == nullptr) {\n return Error(\"Failed to run '\" + command.get() + \"'\");\n }\n\n char line[1024];\n \/\/ NOTE(vinod): Ideally the if and while loops should be interchanged. But\n \/\/ we get a broken pipe error if we don't read the output and simply close.\n while (fgets(line, sizeof(line), file) != nullptr) {\n stdout << line;\n }\n\n if (ferror(file) != 0) {\n pclose(file); \/\/ Ignoring result since we already have an error.\n return Error(\"Error reading output of '\" + command.get() + \"'\");\n }\n\n int status;\n if ((status = pclose(file)) == -1) {\n return Error(\"Failed to get status of '\" + command.get() + \"'\");\n }\n\n if (WIFSIGNALED(status)) {\n return Error(\n \"Running '\" + command.get() + \"' was interrupted by signal '\" +\n strsignal(WTERMSIG(status)) + \"'\");\n } else if ((WEXITSTATUS(status) != EXIT_SUCCESS)) {\n LOG(ERROR) << \"Command '\" << command.get()\n << \"' failed; this is the output:\\n\" << stdout.str();\n return Error(\n \"Failed to execute '\" + command.get() + \"'; the command was either \"\n \"not found or exited with a non-zero exit status: \" +\n stringify(WEXITSTATUS(status)));\n }\n\n return stdout.str();\n}\n\n\n\/\/ Executes a command by calling \"\/bin\/sh -c <command>\", and returns\n\/\/ after the command has been completed. Returns 0 if succeeds, and\n\/\/ return -1 on error (e.g., fork\/exec\/waitpid failed). This function\n\/\/ is async signal safe. We return int instead of returning a Try\n\/\/ because Try involves 'new', which is not async signal safe.\ninline int system(const std::string& command)\n{\n pid_t pid = ::fork();\n\n if (pid == -1) {\n return -1;\n } else if (pid == 0) {\n \/\/ In child process.\n ::execlp(\n Shell::name, Shell::arg0, Shell::arg1, command.c_str(), (char*)nullptr);\n ::exit(127);\n } else {\n \/\/ In parent process.\n int status;\n while (::waitpid(pid, &status, 0) == -1) {\n if (errno != EINTR) {\n return -1;\n }\n }\n\n return status;\n }\n}\n\n\/\/ Executes a command by calling \"<command> <arguments...>\", and\n\/\/ returns after the command has been completed. Returns 0 if\n\/\/ succeeds, and -1 on error (e.g., fork\/exec\/waitpid failed). This\n\/\/ function is async signal safe. We return int instead of returning a\n\/\/ Try because Try involves 'new', which is not async signal safe.\ninline int spawn(\n const std::string& command,\n const std::vector<std::string>& arguments)\n{\n pid_t pid = ::fork();\n\n if (pid == -1) {\n return -1;\n } else if (pid == 0) {\n \/\/ In child process.\n ::execvp(command.c_str(), os::raw::Argv(arguments));\n ::exit(127);\n } else {\n \/\/ In parent process.\n int status;\n while (::waitpid(pid, &status, 0) == -1) {\n if (errno != EINTR) {\n return -1;\n }\n }\n\n return status;\n }\n}\n\n\ntemplate<typename... T>\ninline int execlp(const char* file, T... t)\n{\n return ::execlp(file, t...);\n}\n\n\ninline int execvp(const char* file, char* const argv[])\n{\n return ::execvp(file, argv);\n}\n\n} \/\/ namespace os {\n\n#endif \/\/ __STOUT_OS_POSIX_SHELL_HPP__\n<|endoftext|>"} {"text":"<commit_before>#include <libunittest\/all.hpp>\n#include \"transwarp.h\"\n#include <fstream>\n\n\nCOLLECTION(test_transwarp) {\n\nstd::string make_dot(const std::vector<transwarp::edge>& graph) {\n auto info = [](transwarp::node n) {\n return '\"' + std::to_string(n.id) + \"_\" + n.name + '\"';\n };\n std::ostringstream ofile;\n ofile << \"digraph transwarp {\" << std::endl;\n for (auto pair : graph) {\n ofile << info(pair.parent) << \" -> \" << info(pair.child) << std::endl;\n }\n ofile << \"}\" << std::endl;\n return ofile.str();\n}\n\nTEST(basic) {\n int value = 42;\n\n auto f1 = [&value]{ return value; };\n auto task1 = transwarp::make_task(\"t1\", f1);\n\n auto f2 = [](int v) { return v + 2; };\n auto task2 = transwarp::make_task(\"t2\", f2, task1);\n\n auto f3 = [](int v, int w) { return v + w + 3; }; \n auto root_task = transwarp::make_task(\"t3\", f3, task1, task2);\n\n root_task->make_ids();\n root_task->set_parallel(4);\n\n root_task->schedule();\n ASSERT_EQUAL(89, root_task->get_future().get());\n\n ++value;\n\n root_task->reset();\n root_task->schedule();\n ASSERT_EQUAL(91, root_task->get_future().get());\n\n std::ofstream ofile(\"basic.dot\");\n ofile << make_dot(root_task->get_graph());\n}\n\nTEST(graph) {\n auto f0 = []{ return 0; };\n auto f1 = [](int){ return 0; };\n auto f2 = [](int, int){ return 0; };\n auto f3 = [](int, int, int){ return 0; };\n auto task1 = transwarp::make_task(\"task1\", f0);\n auto task2 = transwarp::make_task(\"task2\", f1, task1);\n auto task3 = transwarp::make_task(\"task3\", f1, task2);\n auto task5 = transwarp::make_task(\"task5\", f2, task3, task2);\n auto task6 = transwarp::make_task(\"task6\", f3, task1, task2, task5);\n auto task7 = transwarp::make_task(\"task7\", f2, task5, task6);\n auto task8 = transwarp::make_task(\"task8\", f2, task6, task7);\n auto task9 = transwarp::make_task(\"task9\", f2, task8, task7);\n auto task10 = transwarp::make_task(\"task10\", f2, task9, task8);\n auto task11 = transwarp::make_task(\"task11\", f2, task10, task7);\n auto task12 = transwarp::make_task(\"task12\", f2, task11, task6);\n auto root = transwarp::make_task(\"root\", f3, task10, task11, task12);\n\n root->make_ids();\n std::ofstream ofile(\"graph.dot\");\n ofile << make_dot(root->get_graph());\n}\n\n}\n<commit_msg>improve test<commit_after>#include <libunittest\/all.hpp>\n#include \"transwarp.h\"\n#include <fstream>\n\n\nCOLLECTION(test_transwarp) {\n\nstd::string make_dot(const std::vector<transwarp::edge>& graph) {\n auto info = [](transwarp::node n) {\n return '\"' + std::to_string(n.id) + \"_\" + n.name + '\"';\n };\n std::ostringstream ofile;\n ofile << \"digraph transwarp {\" << std::endl;\n for (auto pair : graph) {\n ofile << info(pair.parent) << \" -> \" << info(pair.child) << std::endl;\n }\n ofile << \"}\" << std::endl;\n return ofile.str();\n}\n\nTEST(basic) {\n int value = 42;\n\n auto f1 = [&value]{ return value; };\n auto task1 = transwarp::make_task(\"t1\", f1);\n\n auto f2 = [](int v) { return v + 2; };\n auto task2 = transwarp::make_task(\"t2\", f2, task1);\n\n auto f3 = [](int v, int w) { return v + w + 3; }; \n auto root_task = transwarp::make_task(\"t3\", f3, task1, task2);\n\n root_task->make_ids();\n root_task->set_parallel(4);\n\n root_task->schedule();\n ASSERT_EQUAL(89, root_task->get_future().get());\n\n ++value;\n\n root_task->reset();\n root_task->schedule();\n ASSERT_EQUAL(91, root_task->get_future().get());\n\n std::ofstream ofile(\"basic.dot\");\n ofile << make_dot(root_task->get_graph());\n}\n\nTEST(graph) {\n auto f0 = []{ return 0; };\n auto f1 = [](int){ return 0; };\n auto f2 = [](int, int){ return 0; };\n auto f3 = [](int, int, int){ return 0; };\n auto task0 = transwarp::make_task(\"task0\", f0);\n auto task1 = transwarp::make_task(\"task1\", f0);\n auto task2 = transwarp::make_task(\"task2\", f1, task1);\n auto task3 = transwarp::make_task(\"task3\", f2, task2, task0);\n auto task5 = transwarp::make_task(\"task5\", f2, task3, task2);\n auto task6 = transwarp::make_task(\"task6\", f3, task1, task2, task5);\n auto task7 = transwarp::make_task(\"task7\", f2, task5, task6);\n auto task8 = transwarp::make_task(\"task8\", f2, task6, task7);\n auto task9 = transwarp::make_task(\"task9\", f2, task8, task7);\n auto task10 = transwarp::make_task(\"task10\", f2, task9, task8);\n auto task11 = transwarp::make_task(\"task11\", f2, task10, task7);\n auto task12 = transwarp::make_task(\"task12\", f2, task11, task6);\n auto root = transwarp::make_task(\"root\", f3, task10, task11, task12);\n\n root->make_ids();\n std::ofstream ofile(\"graph.dot\");\n ofile << make_dot(root->get_graph());\n}\n\n}\n<|endoftext|>"} {"text":"<commit_before>#include \"generatorBase\/robotsGeneratorPluginBase.h\"\n\n#include <qrutils\/inFile.h>\n#include <qrgui\/mainwindow\/qscintillaTextEdit.h>\n#include <qrutils\/nameNormalizer.h>\n\nusing namespace generatorBase;\nusing namespace qReal;\nusing namespace gui;\nusing namespace utils;\n\nRobotsGeneratorPluginBase::RobotsGeneratorPluginBase()\n{\n\tmAppTranslator.load(\":\/generatorBase_\" + QLocale().name());\n\tQApplication::installTranslator(&mAppTranslator);\n}\n\nQString RobotsGeneratorPluginBase::defaultFilePath(QString const &projectName) const\n{\n\treturn projectName;\n}\n\nQString RobotsGeneratorPluginBase::extension() const\n{\n\treturn QString();\n}\n\nQString RobotsGeneratorPluginBase::extDescrition() const\n{\n\treturn QString();\n}\n\nQString RobotsGeneratorPluginBase::generatorName() const\n{\n\treturn QString();\n}\n\nQString RobotsGeneratorPluginBase::defaultProjectName() const\n{\n\treturn QFileInfo(mProjectManager->saveFilePath()).baseName();\n}\n\nbool RobotsGeneratorPluginBase::canGenerateTo(QString const &project)\n{\n\t\/\/\/ @todo: In some scenarios user hand-coded programs will be rewritten with auto-generated\n\tQ_UNUSED(project)\n\treturn true;\n}\n\nQFileInfo RobotsGeneratorPluginBase::srcPath()\n{\n\tId const &activeDiagram = mMainWindowInterface->activeDiagram();\n\n\tint exampleNumber = 0;\n\twhile (!canGenerateTo(NameNormalizer::normalizeStrongly(defaultProjectName(), false)\n\t\t\t+ QString::number(exampleNumber))) {\n\t\t++exampleNumber;\n\t}\n\n\tQString const projectName = NameNormalizer::normalizeStrongly(defaultProjectName(), false)\n\t\t\t+ QString::number(exampleNumber);\n\tQFileInfo fileInfo = QFileInfo(QApplication::applicationDirPath() + \"\/\" + defaultFilePath(projectName));\n\tQList<QFileInfo> const pathsList = mCodePath.values(activeDiagram);\n\n\tif (!pathsList.isEmpty()) {\n\t\tforeach (QFileInfo const &path, pathsList) {\n\t\t\tif (mTextManager->isDefaultPath(path.absoluteFilePath())\n\t\t\t\t&& (!mTextManager->isModifiedEver(path.absoluteFilePath()))\n\t\t\t\t&& !mTextManager->generatorName(path.absoluteFilePath()).compare(generatorName())) {\n\t\t\t\tfileInfo = path;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t}\n\n\treturn fileInfo;\n}\n\nQFileInfo RobotsGeneratorPluginBase::generateCodeForProcessing()\n{\n\tQFileInfo fileInfo;\n\tId const &activeDiagram = mMainWindowInterface->activeDiagram();\n\n\tif (!activeDiagram.isNull()) {\n\t\tif (generateCode(false)) {\n\t\t\tforeach (QFileInfo const &path, mCodePath.values(activeDiagram)) {\n\t\t\t\tif (mTextManager->isDefaultPath(path.absoluteFilePath())\n\t\t\t\t\t&& (!mTextManager->isModifiedEver(path.absoluteFilePath()))\n\t\t\t\t\t&& !mTextManager->generatorName(path.absoluteFilePath()).compare(generatorName())) {\n\t\t\t\t\tfileInfo = path;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t} else {\n\t\t\treturn QFileInfo();\n\t\t}\n\t} else {\n\t\tQScintillaTextEdit *code = static_cast<QScintillaTextEdit *>(mMainWindowInterface->currentTab());\n\t\tfileInfo = QFileInfo(mTextManager->path(code));\n\t}\n\n\treturn fileInfo;\n}\n\nvoid RobotsGeneratorPluginBase::init(PluginConfigurator const &configurator\n\t\t, interpreterBase::robotModel::RobotModelManagerInterface const &robotModelManager)\n{\n\tmProjectManager = &configurator.projectManager();\n\tmSystemEvents = &configurator.systemEvents();\n\tmTextManager = &configurator.textManager();\n\n\tmMainWindowInterface = &configurator.mainWindowInterpretersInterface();\n\tmRepo = dynamic_cast<qrRepo::RepoApi const *>(&configurator.logicalModelApi().logicalRepoApi());\n\tmProjectManager = &configurator.projectManager();\n\tmRobotModelManager = &robotModelManager;\n\n\tconnect(mSystemEvents, SIGNAL(codePathChanged(qReal::Id, QFileInfo, QFileInfo))\n\t\t\t, this, SLOT(regenerateCode(qReal::Id, QFileInfo, QFileInfo)));\n\tconnect(mSystemEvents, SIGNAL(newCodeAppeared(qReal::Id, QFileInfo)), this, SLOT(addNewCode(qReal::Id, QFileInfo)));\n\tconnect(mSystemEvents, SIGNAL(diagramClosed(qReal::Id)), this, SLOT(removeDiagram(qReal::Id)));\n\tconnect(mSystemEvents, SIGNAL(codeTabClosed(QFileInfo)), this, SLOT(removeCode(QFileInfo)));\n}\n\nbool RobotsGeneratorPluginBase::generateCode(bool openTab)\n{\n\tmProjectManager->save();\n\tmMainWindowInterface->errorReporter()->clearErrors();\n\n\tMasterGeneratorBase * const generator = masterGenerator();\n\tQFileInfo const path = srcPath();\n\n\tgenerator->initialize();\n\tgenerator->setProjectDir(path);\n\n\tQString const generatedSrcPath = generator->generate();\n\n\tif (mMainWindowInterface->errorReporter()->wereErrors()) {\n\t\tdelete generator;\n\t\treturn false;\n\t}\n\n\tId const activeDiagram = mMainWindowInterface->activeDiagram();\n\n\tQString const generatedCode = utils::InFile::readAll(generatedSrcPath);\n\tif (!generatedCode.isEmpty()) {\n\t\tmTextManager->showInTextEditor(path, generatorName());\n\t}\n\n\tif (!openTab) {\n\t\tmMainWindowInterface->activateItemOrDiagram(activeDiagram);\n\t}\n\n\tdelete generator;\n\treturn true;\n}\n\nvoid RobotsGeneratorPluginBase::regenerateCode(qReal::Id const &diagram\n\t, QFileInfo const &oldFileInfo\n\t, QFileInfo const &newFileInfo)\n{\n\tif (!oldFileInfo.completeSuffix().compare(extension())) {\n\t\tmCodePath.remove(diagram, oldFileInfo);\n\t\tmCodePath.insert(diagram, newFileInfo);\n\t\tregenerateExtraFiles(newFileInfo);\n\t}\n}\n\nvoid RobotsGeneratorPluginBase::addNewCode(Id const &diagram, QFileInfo const &fileInfo)\n{\n\tmCodePath.insert(diagram, fileInfo);\n}\n\nvoid RobotsGeneratorPluginBase::removeDiagram(qReal::Id const &diagram)\n{\n\tmCodePath.remove(diagram);\n}\n\nvoid RobotsGeneratorPluginBase::removeCode(QFileInfo const &fileInfo)\n{\n\tId const &diagram = mCodePath.key(fileInfo);\n\tmCodePath.remove(diagram, fileInfo);\n}\n<commit_msg>generated name doesn't began with 0<commit_after>#include \"generatorBase\/robotsGeneratorPluginBase.h\"\n\n#include <qrutils\/inFile.h>\n#include <qrgui\/mainwindow\/qscintillaTextEdit.h>\n#include <qrutils\/nameNormalizer.h>\n\nusing namespace generatorBase;\nusing namespace qReal;\nusing namespace gui;\nusing namespace utils;\n\nRobotsGeneratorPluginBase::RobotsGeneratorPluginBase()\n{\n\tmAppTranslator.load(\":\/generatorBase_\" + QLocale().name());\n\tQApplication::installTranslator(&mAppTranslator);\n}\n\nQString RobotsGeneratorPluginBase::defaultFilePath(QString const &projectName) const\n{\n\treturn projectName;\n}\n\nQString RobotsGeneratorPluginBase::extension() const\n{\n\treturn QString();\n}\n\nQString RobotsGeneratorPluginBase::extDescrition() const\n{\n\treturn QString();\n}\n\nQString RobotsGeneratorPluginBase::generatorName() const\n{\n\treturn QString();\n}\n\nQString RobotsGeneratorPluginBase::defaultProjectName() const\n{\n\treturn QFileInfo(mProjectManager->saveFilePath()).baseName();\n}\n\nbool RobotsGeneratorPluginBase::canGenerateTo(QString const &project)\n{\n\t\/\/\/ @todo: In some scenarios user hand-coded programs will be rewritten with auto-generated\n\tQ_UNUSED(project)\n\treturn true;\n}\n\nQFileInfo RobotsGeneratorPluginBase::srcPath()\n{\n\tId const &activeDiagram = mMainWindowInterface->activeDiagram();\n\n\tint exampleNumber = 0;\n\twhile (!canGenerateTo(NameNormalizer::normalizeStrongly(defaultProjectName(), false)\n\t\t\t+ QString::number(exampleNumber))) {\n\t\t++exampleNumber;\n\t}\n\n\tQString const projectName = NameNormalizer::normalizeStrongly(defaultProjectName(), false)\n\t\t\t+ (exampleNumber > 0 ? QString::number(exampleNumber) : \"\");\n\tQFileInfo fileInfo = QFileInfo(QApplication::applicationDirPath() + \"\/\" + defaultFilePath(projectName));\n\tQList<QFileInfo> const pathsList = mCodePath.values(activeDiagram);\n\n\tif (!pathsList.isEmpty()) {\n\t\tforeach (QFileInfo const &path, pathsList) {\n\t\t\tif (mTextManager->isDefaultPath(path.absoluteFilePath())\n\t\t\t\t&& (!mTextManager->isModifiedEver(path.absoluteFilePath()))\n\t\t\t\t&& !mTextManager->generatorName(path.absoluteFilePath()).compare(generatorName())) {\n\t\t\t\tfileInfo = path;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t}\n\n\treturn fileInfo;\n}\n\nQFileInfo RobotsGeneratorPluginBase::generateCodeForProcessing()\n{\n\tQFileInfo fileInfo;\n\tId const &activeDiagram = mMainWindowInterface->activeDiagram();\n\n\tif (!activeDiagram.isNull()) {\n\t\tif (generateCode(false)) {\n\t\t\tforeach (QFileInfo const &path, mCodePath.values(activeDiagram)) {\n\t\t\t\tif (mTextManager->isDefaultPath(path.absoluteFilePath())\n\t\t\t\t\t&& (!mTextManager->isModifiedEver(path.absoluteFilePath()))\n\t\t\t\t\t&& !mTextManager->generatorName(path.absoluteFilePath()).compare(generatorName())) {\n\t\t\t\t\tfileInfo = path;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t} else {\n\t\t\treturn QFileInfo();\n\t\t}\n\t} else {\n\t\tQScintillaTextEdit *code = static_cast<QScintillaTextEdit *>(mMainWindowInterface->currentTab());\n\t\tfileInfo = QFileInfo(mTextManager->path(code));\n\t}\n\n\treturn fileInfo;\n}\n\nvoid RobotsGeneratorPluginBase::init(PluginConfigurator const &configurator\n\t\t, interpreterBase::robotModel::RobotModelManagerInterface const &robotModelManager)\n{\n\tmProjectManager = &configurator.projectManager();\n\tmSystemEvents = &configurator.systemEvents();\n\tmTextManager = &configurator.textManager();\n\n\tmMainWindowInterface = &configurator.mainWindowInterpretersInterface();\n\tmRepo = dynamic_cast<qrRepo::RepoApi const *>(&configurator.logicalModelApi().logicalRepoApi());\n\tmProjectManager = &configurator.projectManager();\n\tmRobotModelManager = &robotModelManager;\n\n\tconnect(mSystemEvents, SIGNAL(codePathChanged(qReal::Id, QFileInfo, QFileInfo))\n\t\t\t, this, SLOT(regenerateCode(qReal::Id, QFileInfo, QFileInfo)));\n\tconnect(mSystemEvents, SIGNAL(newCodeAppeared(qReal::Id, QFileInfo)), this, SLOT(addNewCode(qReal::Id, QFileInfo)));\n\tconnect(mSystemEvents, SIGNAL(diagramClosed(qReal::Id)), this, SLOT(removeDiagram(qReal::Id)));\n\tconnect(mSystemEvents, SIGNAL(codeTabClosed(QFileInfo)), this, SLOT(removeCode(QFileInfo)));\n}\n\nbool RobotsGeneratorPluginBase::generateCode(bool openTab)\n{\n\tmProjectManager->save();\n\tmMainWindowInterface->errorReporter()->clearErrors();\n\n\tMasterGeneratorBase * const generator = masterGenerator();\n\tQFileInfo const path = srcPath();\n\n\tgenerator->initialize();\n\tgenerator->setProjectDir(path);\n\n\tQString const generatedSrcPath = generator->generate();\n\n\tif (mMainWindowInterface->errorReporter()->wereErrors()) {\n\t\tdelete generator;\n\t\treturn false;\n\t}\n\n\tId const activeDiagram = mMainWindowInterface->activeDiagram();\n\n\tQString const generatedCode = utils::InFile::readAll(generatedSrcPath);\n\tif (!generatedCode.isEmpty()) {\n\t\tmTextManager->showInTextEditor(path, generatorName());\n\t}\n\n\tif (!openTab) {\n\t\tmMainWindowInterface->activateItemOrDiagram(activeDiagram);\n\t}\n\n\tdelete generator;\n\treturn true;\n}\n\nvoid RobotsGeneratorPluginBase::regenerateCode(qReal::Id const &diagram\n\t, QFileInfo const &oldFileInfo\n\t, QFileInfo const &newFileInfo)\n{\n\tif (!oldFileInfo.completeSuffix().compare(extension())) {\n\t\tmCodePath.remove(diagram, oldFileInfo);\n\t\tmCodePath.insert(diagram, newFileInfo);\n\t\tregenerateExtraFiles(newFileInfo);\n\t}\n}\n\nvoid RobotsGeneratorPluginBase::addNewCode(Id const &diagram, QFileInfo const &fileInfo)\n{\n\tmCodePath.insert(diagram, fileInfo);\n}\n\nvoid RobotsGeneratorPluginBase::removeDiagram(qReal::Id const &diagram)\n{\n\tmCodePath.remove(diagram);\n}\n\nvoid RobotsGeneratorPluginBase::removeCode(QFileInfo const &fileInfo)\n{\n\tId const &diagram = mCodePath.key(fileInfo);\n\tmCodePath.remove(diagram, fileInfo);\n}\n<|endoftext|>"} {"text":"<commit_before>\/*=========================================================================\n\n Program: ORFEO Toolbox\n Language: C++\n Date: $Date$\n Version: $Revision$\n\n\n Copyright (c) Centre National d'Etudes Spatiales. All rights reserved.\n See OTBCopyright.txt for details.\n\n\n This software is distributed WITHOUT ANY WARRANTY; without even\n the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR\n PURPOSE. See the above copyright notices for more information.\n\n=========================================================================*\/\n#include \"otbWrapperApplication.h\"\n#include \"otbWrapperApplicationFactory.h\"\n\n#include \"otbGeoInformationConversion.h\"\n\n#include \"otbOGRDataSourceWrapper.h\"\n#include \"otbOGRDataSourceToLabelImageFilter.h\"\n#include \"otbGenericRSTransform.h\"\n\nnamespace otb\n{\nnamespace Wrapper\n{\n\nclass Rasterization : public Application\n{\npublic:\n \/** Standard class typedefs. *\/\n typedef Rasterization Self;\n typedef Application Superclass;\n typedef itk::SmartPointer<Self> Pointer;\n typedef itk::SmartPointer<const Self> ConstPointer;\n\n \/** Standard macro *\/\n itkNewMacro(Self);\n\n itkTypeMacro(Rasterization, otb::Application);\n\n \/** Filters typedef *\/\n \/\/ the application produces a binary mask : no need to use a FloatVectorImageType\n typedef UInt8ImageType::PointType PointType;\n typedef UInt8ImageType::SizeType SizeType;\n typedef UInt8ImageType::SpacingType SpacingType;\n typedef UInt8ImageType::IndexType IndexType;\n \n \/\/ Misc\n typedef otb::GenericRSTransform<> RSTransformType;\n typedef otb::PipelineMemoryPrintCalculator MemoryCalculatorType;\n\n \/\/ Exact rasterization mode\n typedef otb::OGRDataSourceToLabelImageFilter<FloatImageType> OGRDataSourceToMapFilterType;\n\nprivate:\n void DoInit()\n {\n SetName(\"Rasterization\");\n SetDescription(\"Rasterize a vector dataset.\");\n\n SetDocName(\"Rasterization\");\n SetDocLongDescription(\"This application allows to reproject and rasterize a vector dataset. The grid of the rasterized output can be set by using a reference image, or by setting all parmeters (origin, size, spacing) by hand. In the latter case, at least the spacing (ground sampling distance) is needed (other parameters are computed automatically). The rasterized output can also be in a different projection reference system than the input dataset.\\n There are two rasterize mode available in the application. The first is the binary mode: it allows to render all pixels belonging to a geometry of the input dataset in the foreground color, while rendering the other in background color. The second one allows to render pixels belonging to a geometry woth respect to an attribute of this geometry. The field of the attribute to render can be set by the user. In the second mode, the background value is still used for unassociated pixels.\");\n SetDocLimitations(\"None\");\n SetDocAuthors(\"OTB-Team\");\n SetDocSeeAlso(\"For now, support of input dataset with multiple layers having different projection reference system is limited.\");\n \n AddDocTag(Tags::Vector);\n\n AddParameter(ParameterType_InputFilename, \"in\", \"Input vector dataset\");\n SetParameterDescription( \"in\", \"The input vector dataset to be rasterized\" );\n \n AddParameter(ParameterType_OutputImage, \"out\", \"Ouptut image\");\n SetParameterDescription( \"out\", \"An output image containing the rasterized vector dataset\" );\n \n AddParameter(ParameterType_InputImage, \"im\", \"Input reference image\");\n SetParameterDescription( \"im\", \"A reference image from which to import output grid and projection reference system information.\" );\n MandatoryOff(\"im\");\n \n AddParameter(ParameterType_Int, \"szx\", \"Output size x\");\n SetParameterDescription( \"szx\", \"Output size along x axis (useless if support image is given)\" );\n MandatoryOff(\"szx\");\n SetMinimumParameterIntValue(\"szx\",1);\n \n AddParameter(ParameterType_Int, \"szy\", \"Output size y\");\n SetParameterDescription( \"szy\", \"Output size along y axis (useless if support image is given)\" );\n MandatoryOff(\"szy\");\n SetMinimumParameterIntValue(\"szy\",1);\n \n AddParameter(ParameterType_Int, \"epsg\", \"Output EPSG code\");\n SetParameterDescription( \"epsg\", \"EPSG code for the output projection reference system (EPSG 4326 for WGS84, 32631 for UTM31N...,useless if support image is given)\" );\n MandatoryOff(\"epsg\");\n \n AddParameter(ParameterType_Float, \"orx\", \"Output Upper-left x\");\n SetParameterDescription( \"orx\", \"Output upper-left x coordinate (useless if support image is given)\" );\n MandatoryOff(\"orx\");\n \n AddParameter(ParameterType_Float, \"ory\", \"Output Upper-left y\");\n SetParameterDescription( \"ory\", \"Output upper-left y coordinate (useless if support image is given)\" );\n MandatoryOff(\"ory\");\n \n AddParameter(ParameterType_Float, \"spx\", \"Spacing (GSD) x\");\n SetParameterDescription( \"spx\", \"Spacing (ground sampling distance) along x axis (useless if support image is given)\" );\n MandatoryOff(\"spx\");\n \n AddParameter(ParameterType_Float, \"spy\", \"Spacing (GSD) y\");\n SetParameterDescription( \"spy\", \"Spacing (ground sampling distance) along y axis (useless if support image is given)\" );\n MandatoryOff(\"spy\");\n \n AddParameter(ParameterType_Float,\"background\", \"Background value\");\n SetParameterDescription(\"background\",\"Default value for pixels not belonging to any geometry\");\n SetDefaultParameterFloat(\"background\",0.);\n\n AddParameter(ParameterType_Choice,\"mode\",\"Rasterization mode\");\n SetParameterDescription(\"mode\",\"Choice of rasterization modes\");\n \n AddChoice(\"mode.binary\",\"Binary mode\");\n SetParameterDescription(\"mode.binary\",\"In this mode, pixels within a geometry will hold the user-defined foreground value\");\n\n AddParameter(ParameterType_Float,\"mode.binary.foreground\",\"Foreground value\");\n SetParameterDescription(\"mode.binary.foreground\",\"Value for pixels inside a geometry\");\n SetDefaultParameterFloat(\"mode.binary.foreground\",255);\n \n AddChoice(\"mode.attribute\",\"Attribute burning mode\");\n SetParameterDescription(\"mode.attribute\",\"In this mode, pixels within a geometry will hold the value of a user-defined field extracted from this geometry.\");\n\n AddParameter(ParameterType_String,\"mode.attribute.field\",\"The attribute field to burn\");\n SetParameterDescription(\"mode.attribute.field\",\"Name of the attribute field to burn\");\n SetParameterString(\"mode.attribute.field\",\"DN\");\n \n AddRAMParameter();\n \n SetDocExampleParameterValue(\"in\",\"qb_RoadExtract_classification.shp\");\n SetDocExampleParameterValue(\"out\", \"rasterImage.tif\");\n SetDocExampleParameterValue(\"spx\",\"1.\");\n SetDocExampleParameterValue(\"spy\",\"1.\");\n }\n\n void DoUpdateParameters()\n {\n \/\/ Nothing to do\n }\n \n \n void DoExecute()\n {\n UInt8ImageType::Pointer referenceImage;\n\n m_OgrDS = otb::ogr::DataSource::New(GetParameterString(\"in\"), otb::ogr::DataSource::Modes::read);\n\n bool validInputProjRef = false;\n std::string inputProjectionRef = \"\";\n\n otb::ogr::DataSource::const_iterator lit = m_OgrDS->begin();\n\n \/\/ Retrieve extent\n double ulx, uly, lrx, lry;\n bool extentAvailable = true;\n\n try\n {\n inputProjectionRef = m_OgrDS->GetGlobalExtent(ulx,uly,lrx,lry);\n }\n catch(itk::ExceptionObject & err)\n {\n extentAvailable = false;\n }\n\n if(!extentAvailable &&\n (!(HasValue(\"spx\") && HasValue(\"spy\"))\n || (!(HasValue(\"orx\") && HasValue(\"ory\")))))\n {\n otbAppLogWARNING(<<\"Failed to retrieve the spatial extent of the dataset. The application will retry in force mode, which means it might have to walk the entire dataset to determine extent. This might be a long process for large datasets. Consider setting the orx, ory, spx and spy parameters.\");\n\n try\n {\n inputProjectionRef = m_OgrDS->GetGlobalExtent(ulx,uly,lrx,lry);\n extentAvailable = true;\n }\n catch(itk::ExceptionObject & err)\n {\n extentAvailable = false;\n\n otbAppLogFATAL(<<\"Failed to retrieve the sapatial extent of the dataset in force mode. The spatial extent is mandatory when orx, ory, spx and spy parameters are not set, consider setting them.\");\n }\n }\n\n if(extentAvailable)\n {\n otbAppLogINFO(\"Input dataset extent is (\"<<ulx<<\", \"<<uly<<\") (\"<<lrx<<\", \"<<lry<<\")\");\n }\n\n if(inputProjectionRef == \"\")\n {\n otbAppLogWARNING(\"Failed to find a valid projection ref in dataset. The application will asume that the given reference image or origin, spacing and size are consistent with the dataset geometry. Output EPSG code will be ignored.\");\n validInputProjRef = false;\n }\n else\n {\n validInputProjRef = true;\n otbAppLogINFO(\"Input dataset projection reference system is: \"<<inputProjectionRef);\n }\n\n \/\/ region information\n SizeType size;\n PointType origin;\n SpacingType spacing;\n \n \/\/ reading projection information\n \/\/ two choice :\n std::string outputProjectionRef;\n \/\/ a reference image is given as input\n if (HasValue(\"im\"))\n {\n if (HasValue(\"szx\") || HasValue(\"szy\") || HasValue(\"orx\") || HasValue(\"ory\")\n || HasValue(\"spx\") || HasValue(\"spy\") || HasValue(\"epsg\"))\n {\n otbAppLogWARNING(\"A reference image has been given, other parameters \"\n \"regarding the output image will be ignored\");\n }\n \n referenceImage = GetParameterUInt8Image(\"im\");\n outputProjectionRef = referenceImage->GetProjectionRef();\n \n size = referenceImage->GetLargestPossibleRegion().GetSize();\n \n origin = referenceImage->GetOrigin();\n \n spacing = referenceImage->GetSpacing();\n }\n else if (HasValue(\"spx\") && HasValue(\"spy\"))\n {\n if (HasValue(\"epsg\"))\n {\n unsigned int RSID = GetParameterInt(\"epsg\");\n outputProjectionRef = otb::GeoInformationConversion::ToWKT(RSID);\n }\n else\n {\n outputProjectionRef = inputProjectionRef;\n }\n\n spacing[0] = GetParameterFloat(\"spx\");\n spacing[1] = GetParameterFloat(\"spy\");\n\n if ( HasValue(\"orx\") && HasValue(\"ory\"))\n {\n origin[0] = GetParameterFloat(\"orx\");\n origin[1] = GetParameterFloat(\"ory\");\n }\n else if(extentAvailable)\n {\n origin[0] = ulx;\n origin[1] = uly;\n \n \/\/ Transform to output EPSG\n \n if(validInputProjRef)\n {\n RSTransformType::Pointer rsTransform = RSTransformType::New();\n rsTransform->SetInputProjectionRef(inputProjectionRef);\n rsTransform->SetOutputProjectionRef(outputProjectionRef);\n rsTransform->InstanciateTransform();\n\n origin = rsTransform->TransformPoint(origin);\n }\n }\n else\n {\n otbAppLogFATAL(<<\"The orx and ory parameters are not set and the dataset extent could not be retrieved. The application can not deterimine the origin of the output raster\");\n }\n\n if (HasValue(\"szx\") && HasValue(\"szy\"))\n {\n size[0] = GetParameterInt(\"szx\");\n size[1] = GetParameterInt(\"szy\");\n }\n else if(extentAvailable)\n {\n \/\/ Transform to output EPSG\n PointType lrout;\n lrout[0] = lrx;\n lrout[1] = lry;\n\n if(validInputProjRef)\n {\n RSTransformType::Pointer rsTransform = RSTransformType::New();\n rsTransform->SetInputProjectionRef(inputProjectionRef);\n rsTransform->SetOutputProjectionRef(outputProjectionRef);\n rsTransform->InstanciateTransform();\n\n lrout = rsTransform->TransformPoint(lrout);\n }\n size[0]=static_cast<unsigned int>((lrout[0] - origin[0])\/spacing[0]);\n size[1]=static_cast<unsigned int>((lrout[1] - origin[1])\/spacing[1]);\n }\n else\n {\n otbAppLogFATAL(<<\"The szx and szy parameters are not set and the dataset extent could not be retrieved. The application can not deterimine the size of the output raster\");\n\n }\n }\n else\n {\n otbAppLogFATAL(\"No reference image was given, at least spx and spy parameters must be set.\");\n }\n \n m_OGRDataSourceRendering = OGRDataSourceToMapFilterType::New();\n m_OGRDataSourceRendering->AddOGRDataSource(m_OgrDS);\n m_OGRDataSourceRendering->SetOutputSize(size);\n m_OGRDataSourceRendering->SetOutputOrigin(origin);\n m_OGRDataSourceRendering->SetOutputSpacing(spacing);\n m_OGRDataSourceRendering->SetBackgroundValue(GetParameterFloat(\"background\"));\n \n if(GetParameterString(\"mode\") == \"binary\")\n {\n m_OGRDataSourceRendering->SetBurnAttributeMode(false);\n m_OGRDataSourceRendering->SetForegroundValue(GetParameterFloat(\"mode.binary.foreground\"));\n }\n else if(GetParameterString(\"mode\") == \"attribute\")\n {\n m_OGRDataSourceRendering->SetBurnAttributeMode(true);\n m_OGRDataSourceRendering->SetBurnAttribute(GetParameterString(\"mode.attribute.field\"));\n }\n\n if(validInputProjRef)\n {\n m_OGRDataSourceRendering->SetOutputProjectionRef(outputProjectionRef);\n }\n \n otbAppLogINFO(\"Output projection reference system is: \"<<outputProjectionRef);\n\n otbAppLogINFO(\"Output origin: \"<<origin);\n otbAppLogINFO(\"Output size: \"<<size);\n otbAppLogINFO(\"Output spacing: \"<<spacing);\n\n SetParameterOutputImage<FloatImageType>(\"out\", m_OGRDataSourceRendering->GetOutput());\n \n }\n \n otb::ogr::DataSource::Pointer m_OgrDS;\n OGRDataSourceToMapFilterType::Pointer m_OGRDataSourceRendering;\n \n};\n\n}\n}\n\nOTB_APPLICATION_EXPORT(otb::Wrapper::Rasterization)\n<commit_msg>DOC: Small typos<commit_after>\/*=========================================================================\n\n Program: ORFEO Toolbox\n Language: C++\n Date: $Date$\n Version: $Revision$\n\n\n Copyright (c) Centre National d'Etudes Spatiales. All rights reserved.\n See OTBCopyright.txt for details.\n\n\n This software is distributed WITHOUT ANY WARRANTY; without even\n the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR\n PURPOSE. See the above copyright notices for more information.\n\n=========================================================================*\/\n#include \"otbWrapperApplication.h\"\n#include \"otbWrapperApplicationFactory.h\"\n\n#include \"otbGeoInformationConversion.h\"\n\n#include \"otbOGRDataSourceWrapper.h\"\n#include \"otbOGRDataSourceToLabelImageFilter.h\"\n#include \"otbGenericRSTransform.h\"\n\nnamespace otb\n{\nnamespace Wrapper\n{\n\nclass Rasterization : public Application\n{\npublic:\n \/** Standard class typedefs. *\/\n typedef Rasterization Self;\n typedef Application Superclass;\n typedef itk::SmartPointer<Self> Pointer;\n typedef itk::SmartPointer<const Self> ConstPointer;\n\n \/** Standard macro *\/\n itkNewMacro(Self);\n\n itkTypeMacro(Rasterization, otb::Application);\n\n \/** Filters typedef *\/\n \/\/ the application produces a binary mask : no need to use a FloatVectorImageType\n typedef UInt8ImageType::PointType PointType;\n typedef UInt8ImageType::SizeType SizeType;\n typedef UInt8ImageType::SpacingType SpacingType;\n typedef UInt8ImageType::IndexType IndexType;\n \n \/\/ Misc\n typedef otb::GenericRSTransform<> RSTransformType;\n typedef otb::PipelineMemoryPrintCalculator MemoryCalculatorType;\n\n \/\/ Exact rasterization mode\n typedef otb::OGRDataSourceToLabelImageFilter<FloatImageType> OGRDataSourceToMapFilterType;\n\nprivate:\n void DoInit()\n {\n SetName(\"Rasterization\");\n SetDescription(\"Rasterize a vector dataset.\");\n\n SetDocName(\"Rasterization\");\n SetDocLongDescription(\"This application allows to reproject and rasterize a vector dataset. The grid of the rasterized output can be set by using a reference image, or by setting all parmeters (origin, size, spacing) by hand. In the latter case, at least the spacing (ground sampling distance) is needed (other parameters are computed automatically). The rasterized output can also be in a different projection reference system than the input dataset.\\n There are two rasterize mode available in the application. The first is the binary mode: it allows to render all pixels belonging to a geometry of the input dataset in the foreground color, while rendering the other in background color. The second one allows to render pixels belonging to a geometry woth respect to an attribute of this geometry. The field of the attribute to render can be set by the user. In the second mode, the background value is still used for unassociated pixels.\");\n SetDocLimitations(\"None\");\n SetDocAuthors(\"OTB-Team\");\n SetDocSeeAlso(\"For now, support of input dataset with multiple layers having different projection reference system is limited.\");\n \n AddDocTag(Tags::Vector);\n\n AddParameter(ParameterType_InputFilename, \"in\", \"Input vector dataset\");\n SetParameterDescription( \"in\", \"The input vector dataset to be rasterized\" );\n \n AddParameter(ParameterType_OutputImage, \"out\", \"Ouptut image\");\n SetParameterDescription( \"out\", \"An output image containing the rasterized vector dataset\" );\n \n AddParameter(ParameterType_InputImage, \"im\", \"Input reference image\");\n SetParameterDescription( \"im\", \"A reference image from which to import output grid and projection reference system information.\" );\n MandatoryOff(\"im\");\n \n AddParameter(ParameterType_Int, \"szx\", \"Output size x\");\n SetParameterDescription( \"szx\", \"Output size along x axis (useless if support image is given)\" );\n MandatoryOff(\"szx\");\n SetMinimumParameterIntValue(\"szx\",1);\n \n AddParameter(ParameterType_Int, \"szy\", \"Output size y\");\n SetParameterDescription( \"szy\", \"Output size along y axis (useless if support image is given)\" );\n MandatoryOff(\"szy\");\n SetMinimumParameterIntValue(\"szy\",1);\n \n AddParameter(ParameterType_Int, \"epsg\", \"Output EPSG code\");\n SetParameterDescription( \"epsg\", \"EPSG code for the output projection reference system (EPSG 4326 for WGS84, 32631 for UTM31N...,useless if support image is given)\" );\n MandatoryOff(\"epsg\");\n \n AddParameter(ParameterType_Float, \"orx\", \"Output Upper-left x\");\n SetParameterDescription( \"orx\", \"Output upper-left x coordinate (useless if support image is given)\" );\n MandatoryOff(\"orx\");\n \n AddParameter(ParameterType_Float, \"ory\", \"Output Upper-left y\");\n SetParameterDescription( \"ory\", \"Output upper-left y coordinate (useless if support image is given)\" );\n MandatoryOff(\"ory\");\n \n AddParameter(ParameterType_Float, \"spx\", \"Spacing (GSD) x\");\n SetParameterDescription( \"spx\", \"Spacing (ground sampling distance) along x axis (useless if support image is given)\" );\n MandatoryOff(\"spx\");\n \n AddParameter(ParameterType_Float, \"spy\", \"Spacing (GSD) y\");\n SetParameterDescription( \"spy\", \"Spacing (ground sampling distance) along y axis (useless if support image is given)\" );\n MandatoryOff(\"spy\");\n \n AddParameter(ParameterType_Float,\"background\", \"Background value\");\n SetParameterDescription(\"background\",\"Default value for pixels not belonging to any geometry\");\n SetDefaultParameterFloat(\"background\",0.);\n\n AddParameter(ParameterType_Choice,\"mode\",\"Rasterization mode\");\n SetParameterDescription(\"mode\",\"Choice of rasterization modes\");\n \n AddChoice(\"mode.binary\",\"Binary mode\");\n SetParameterDescription(\"mode.binary\",\"In this mode, pixels within a geometry will hold the user-defined foreground value\");\n\n AddParameter(ParameterType_Float,\"mode.binary.foreground\",\"Foreground value\");\n SetParameterDescription(\"mode.binary.foreground\",\"Value for pixels inside a geometry\");\n SetDefaultParameterFloat(\"mode.binary.foreground\",255);\n \n AddChoice(\"mode.attribute\",\"Attribute burning mode\");\n SetParameterDescription(\"mode.attribute\",\"In this mode, pixels within a geometry will hold the value of a user-defined field extracted from this geometry.\");\n\n AddParameter(ParameterType_String,\"mode.attribute.field\",\"The attribute field to burn\");\n SetParameterDescription(\"mode.attribute.field\",\"Name of the attribute field to burn\");\n SetParameterString(\"mode.attribute.field\",\"DN\");\n \n AddRAMParameter();\n \n SetDocExampleParameterValue(\"in\",\"qb_RoadExtract_classification.shp\");\n SetDocExampleParameterValue(\"out\", \"rasterImage.tif\");\n SetDocExampleParameterValue(\"spx\",\"1.\");\n SetDocExampleParameterValue(\"spy\",\"1.\");\n }\n\n void DoUpdateParameters()\n {\n \/\/ Nothing to do\n }\n \n \n void DoExecute()\n {\n UInt8ImageType::Pointer referenceImage;\n\n m_OgrDS = otb::ogr::DataSource::New(GetParameterString(\"in\"), otb::ogr::DataSource::Modes::read);\n\n bool validInputProjRef = false;\n std::string inputProjectionRef = \"\";\n\n otb::ogr::DataSource::const_iterator lit = m_OgrDS->begin();\n\n \/\/ Retrieve extent\n double ulx, uly, lrx, lry;\n bool extentAvailable = true;\n\n try\n {\n inputProjectionRef = m_OgrDS->GetGlobalExtent(ulx,uly,lrx,lry);\n }\n catch(itk::ExceptionObject & err)\n {\n extentAvailable = false;\n }\n\n if(!extentAvailable &&\n (!(HasValue(\"spx\") && HasValue(\"spy\"))\n || (!(HasValue(\"orx\") && HasValue(\"ory\")))))\n {\n otbAppLogWARNING(<<\"Failed to retrieve the spatial extent of the dataset. The application will retry in force mode, which means it might have to walk the entire dataset to determine extent. This might be a long process for large datasets. Consider setting the orx, ory, spx and spy parameters.\");\n\n try\n {\n inputProjectionRef = m_OgrDS->GetGlobalExtent(ulx,uly,lrx,lry);\n extentAvailable = true;\n }\n catch(itk::ExceptionObject & err)\n {\n extentAvailable = false;\n\n otbAppLogFATAL(<<\"Failed to retrieve the spatial extent of the dataset in force mode. The spatial extent is mandatory when orx, ory, spx and spy parameters are not set, consider setting them.\");\n }\n }\n\n if(extentAvailable)\n {\n otbAppLogINFO(\"Input dataset extent is (\"<<ulx<<\", \"<<uly<<\") (\"<<lrx<<\", \"<<lry<<\")\");\n }\n\n if(inputProjectionRef == \"\")\n {\n otbAppLogWARNING(\"Failed to find a valid projection ref in dataset. The application will assume that the given reference image or origin, spacing and size are consistent with the dataset geometry. Output EPSG code will be ignored.\");\n validInputProjRef = false;\n }\n else\n {\n validInputProjRef = true;\n otbAppLogINFO(\"Input dataset projection reference system is: \"<<inputProjectionRef);\n }\n\n \/\/ region information\n SizeType size;\n PointType origin;\n SpacingType spacing;\n \n \/\/ reading projection information\n \/\/ two choice :\n std::string outputProjectionRef;\n \/\/ a reference image is given as input\n if (HasValue(\"im\"))\n {\n if (HasValue(\"szx\") || HasValue(\"szy\") || HasValue(\"orx\") || HasValue(\"ory\")\n || HasValue(\"spx\") || HasValue(\"spy\") || HasValue(\"epsg\"))\n {\n otbAppLogWARNING(\"A reference image has been given, other parameters \"\n \"regarding the output image will be ignored\");\n }\n \n referenceImage = GetParameterUInt8Image(\"im\");\n outputProjectionRef = referenceImage->GetProjectionRef();\n \n size = referenceImage->GetLargestPossibleRegion().GetSize();\n \n origin = referenceImage->GetOrigin();\n \n spacing = referenceImage->GetSpacing();\n }\n else if (HasValue(\"spx\") && HasValue(\"spy\"))\n {\n if (HasValue(\"epsg\"))\n {\n unsigned int RSID = GetParameterInt(\"epsg\");\n outputProjectionRef = otb::GeoInformationConversion::ToWKT(RSID);\n }\n else\n {\n outputProjectionRef = inputProjectionRef;\n }\n\n spacing[0] = GetParameterFloat(\"spx\");\n spacing[1] = GetParameterFloat(\"spy\");\n\n if ( HasValue(\"orx\") && HasValue(\"ory\"))\n {\n origin[0] = GetParameterFloat(\"orx\");\n origin[1] = GetParameterFloat(\"ory\");\n }\n else if(extentAvailable)\n {\n origin[0] = ulx;\n origin[1] = uly;\n \n \/\/ Transform to output EPSG\n \n if(validInputProjRef)\n {\n RSTransformType::Pointer rsTransform = RSTransformType::New();\n rsTransform->SetInputProjectionRef(inputProjectionRef);\n rsTransform->SetOutputProjectionRef(outputProjectionRef);\n rsTransform->InstanciateTransform();\n\n origin = rsTransform->TransformPoint(origin);\n }\n }\n else\n {\n otbAppLogFATAL(<<\"The orx and ory parameters are not set and the dataset extent could not be retrieved. The application can not determine the origin of the output raster\");\n }\n\n if (HasValue(\"szx\") && HasValue(\"szy\"))\n {\n size[0] = GetParameterInt(\"szx\");\n size[1] = GetParameterInt(\"szy\");\n }\n else if(extentAvailable)\n {\n \/\/ Transform to output EPSG\n PointType lrout;\n lrout[0] = lrx;\n lrout[1] = lry;\n\n if(validInputProjRef)\n {\n RSTransformType::Pointer rsTransform = RSTransformType::New();\n rsTransform->SetInputProjectionRef(inputProjectionRef);\n rsTransform->SetOutputProjectionRef(outputProjectionRef);\n rsTransform->InstanciateTransform();\n\n lrout = rsTransform->TransformPoint(lrout);\n }\n size[0]=static_cast<unsigned int>((lrout[0] - origin[0])\/spacing[0]);\n size[1]=static_cast<unsigned int>((lrout[1] - origin[1])\/spacing[1]);\n }\n else\n {\n otbAppLogFATAL(<<\"The szx and szy parameters are not set and the dataset extent could not be retrieved. The application can not deterimine the size of the output raster\");\n\n }\n }\n else\n {\n otbAppLogFATAL(\"No reference image was given, at least spx and spy parameters must be set.\");\n }\n \n m_OGRDataSourceRendering = OGRDataSourceToMapFilterType::New();\n m_OGRDataSourceRendering->AddOGRDataSource(m_OgrDS);\n m_OGRDataSourceRendering->SetOutputSize(size);\n m_OGRDataSourceRendering->SetOutputOrigin(origin);\n m_OGRDataSourceRendering->SetOutputSpacing(spacing);\n m_OGRDataSourceRendering->SetBackgroundValue(GetParameterFloat(\"background\"));\n \n if(GetParameterString(\"mode\") == \"binary\")\n {\n m_OGRDataSourceRendering->SetBurnAttributeMode(false);\n m_OGRDataSourceRendering->SetForegroundValue(GetParameterFloat(\"mode.binary.foreground\"));\n }\n else if(GetParameterString(\"mode\") == \"attribute\")\n {\n m_OGRDataSourceRendering->SetBurnAttributeMode(true);\n m_OGRDataSourceRendering->SetBurnAttribute(GetParameterString(\"mode.attribute.field\"));\n }\n\n if(validInputProjRef)\n {\n m_OGRDataSourceRendering->SetOutputProjectionRef(outputProjectionRef);\n }\n \n otbAppLogINFO(\"Output projection reference system is: \"<<outputProjectionRef);\n\n otbAppLogINFO(\"Output origin: \"<<origin);\n otbAppLogINFO(\"Output size: \"<<size);\n otbAppLogINFO(\"Output spacing: \"<<spacing);\n\n SetParameterOutputImage<FloatImageType>(\"out\", m_OGRDataSourceRendering->GetOutput());\n \n }\n \n otb::ogr::DataSource::Pointer m_OgrDS;\n OGRDataSourceToMapFilterType::Pointer m_OGRDataSourceRendering;\n \n};\n\n}\n}\n\nOTB_APPLICATION_EXPORT(otb::Wrapper::Rasterization)\n<|endoftext|>"} {"text":"<commit_before>\/*\n * traywindow.cpp - the KDE system tray applet\n * Program: kalarm\n * Copyright © 2002-2006 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 <stdlib.h>\n\n#include <QToolTip>\n#include <QMouseEvent>\n#include <QList>\n\n#include <kapplication.h>\n#include <klocale.h>\n#include <kstdaction.h>\n#include <kaboutdata.h>\n#include <kmenu.h>\n#include <kmessagebox.h>\n#include <kstandarddirs.h>\n#include <kstdaction.h>\n#include <kstdguiitem.h>\n#include <kconfig.h>\n#include <kdebug.h>\n\n#include \"alarmcalendar.h\"\n#include \"alarmlistview.h\"\n#include \"alarmtext.h\"\n#include \"daemon.h\"\n#include \"functions.h\"\n#include \"kalarmapp.h\"\n#include \"mainwindow.h\"\n#include \"messagewin.h\"\n#include \"prefdlg.h\"\n#include \"preferences.h\"\n#include \"templatemenuaction.h\"\n#include \"traywindow.moc\"\n\n\nstruct TipItem\n{\n\tQDateTime dateTime;\n\tQString text;\n};\n\n\n\/*=============================================================================\n= Class: TrayWindow\n= The KDE system tray window.\n=============================================================================*\/\n\nTrayWindow::TrayWindow(MainWindow* parent)\n\t: KSystemTray((theApp()->wantRunInSystemTray() ? parent : 0)),\n\t mAssocMainWindow(parent)\n{\n\tkDebug(5950) << \"TrayWindow::TrayWindow()\\n\";\n\t\/\/ Set up GUI icons\n\tmPixmapEnabled = loadIcon(\"kalarm\");\n\tmPixmapDisabled = loadIcon(\"kalarm_disabled\");\n\tif (mPixmapEnabled.isNull() || mPixmapDisabled.isNull())\n\t\tKMessageBox::sorry(this, i18n(\"Cannot load system tray icon.\"));\n\tsetAcceptDrops(true); \/\/ allow drag-and-drop onto this window\n\n\t\/\/ Set up the context menu\n\tKActionCollection* actcol = actionCollection();\n\tKAction* a = Daemon::createAlarmEnableAction(actcol);\n\tcontextMenu()->addAction( a );\n\tconnect(a, SIGNAL(switched(bool)), SLOT(setEnabledStatus(bool)));\n\ta = KAlarm::createNewAlarmAction(i18n(\"&New Alarm...\"), actcol, QLatin1String(\"tNew\"));\n\tcontextMenu()->addAction( a );\n\tconnect(a, SIGNAL(triggered(bool)), SLOT(slotNewAlarm()));\n\ta = KAlarm::createNewFromTemplateAction(i18n(\"New Alarm From &Template\"), actcol, QLatin1String(\"tNewFromTempl\"));\n\tcontextMenu()->addAction( a );\n\tconnect(a, SIGNAL(selected(const KAEvent&)), SLOT(slotNewFromTemplate(const KAEvent&)));\n\tcontextMenu()->addAction( KStdAction::preferences(this, SLOT(slotPreferences()), actcol));\n\n\t\/\/ Replace the default handler for the Quit context menu item\n\tconst char* quitName = KStdAction::name(KStdAction::Quit);\n\tdelete actcol->action(quitName);\n\tKStdAction::quit(this, SLOT(slotQuit()), actcol);\n\n\t\/\/ Set icon to correspond with the alarms enabled menu status\n\tDaemon::checkStatus();\n\tsetEnabledStatus(Daemon::monitoringAlarms());\n}\n\nTrayWindow::~TrayWindow()\n{\n\tkDebug(5950) << \"TrayWindow::~TrayWindow()\\n\";\n\ttheApp()->removeWindow(this);\n\temit deleted();\n}\n\n\/******************************************************************************\n* Called just before the context menu is displayed.\n* Update the Alarms Enabled item status.\n*\/\nvoid TrayWindow::contextMenuAboutToShow(KMenu*)\n{\n\tDaemon::checkStatus();\n}\n\n\/******************************************************************************\n* Called when the \"New Alarm\" menu item is selected to edit a new alarm.\n*\/\nvoid TrayWindow::slotNewAlarm()\n{\n\tMainWindow::executeNew();\n}\n\n\/******************************************************************************\n* Called when the \"New Alarm\" menu item is selected to edit a new alarm.\n*\/\nvoid TrayWindow::slotNewFromTemplate(const KAEvent& event)\n{\n\tMainWindow::executeNew(event);\n}\n\n\/******************************************************************************\n* Called when the \"Configure KAlarm\" menu item is selected.\n*\/\nvoid TrayWindow::slotPreferences()\n{\n\tKAlarmPrefDlg prefDlg;\n\tprefDlg.exec();\n}\n\n\/******************************************************************************\n* Called when the Quit context menu item is selected.\n*\/\nvoid TrayWindow::slotQuit()\n{\n\ttheApp()->doQuit(this);\n}\n\n\/******************************************************************************\n* Called when the Alarms Enabled action status has changed.\n* Updates the alarms enabled menu item check state, and the icon pixmap.\n*\/\nvoid TrayWindow::setEnabledStatus(bool status)\n{\n\tkDebug(5950) << \"TrayWindow::setEnabledStatus(\" << (int)status << \")\\n\";\n\tsetPixmap(status ? mPixmapEnabled : mPixmapDisabled);\n}\n\n\/******************************************************************************\n* Called when the mouse is clicked over the panel icon.\n* A left click displays the KAlarm main window.\n* A middle button click displays the New Alarm window.\n*\/\nvoid TrayWindow::mousePressEvent(QMouseEvent* e)\n{\n\tif (e->button() == Qt::LeftButton && !theApp()->wantRunInSystemTray())\n\t{\n\t\t\/\/ Left click: display\/hide the first main window\n\t\tmAssocMainWindow = MainWindow::toggleWindow(mAssocMainWindow);\n\t}\n\telse if (e->button() == Qt::MidButton)\n\t\tMainWindow::executeNew(); \/\/ display a New Alarm dialog\n\telse\n\t\tKSystemTray::mousePressEvent(e);\n}\n\n\/******************************************************************************\n* Called when the mouse is released over the panel icon.\n* The main window (if not hidden) is raised and made the active window.\n* If this is done in mousePressEvent(), it doesn't work.\n*\/\nvoid TrayWindow::mouseReleaseEvent(QMouseEvent* e)\n{\n\tif (e->button() == Qt::LeftButton && mAssocMainWindow && mAssocMainWindow->isVisible())\n\t{\n\t\tmAssocMainWindow->raise();\n\t\tmAssocMainWindow->activateWindow();\n\t}\n\telse\n\t\tKSystemTray::mouseReleaseEvent(e);\n}\n\n\/******************************************************************************\n* Called when the drag cursor enters the panel icon.\n*\/\nvoid TrayWindow::dragEnterEvent(QDragEnterEvent* e)\n{\n\tMainWindow::executeDragEnterEvent(e);\n}\n\n\/******************************************************************************\n* Called when an object is dropped on the panel icon.\n* If the object is recognised, the edit alarm dialog is opened appropriately.\n*\/\nvoid TrayWindow::dropEvent(QDropEvent* e)\n{\n\tMainWindow::executeDropEvent(0, e);\n}\n\n\/******************************************************************************\n* Called when any event occurs.\n* If it's a tooltip event, display the tooltip text showing alarms due in the\n* next 24 hours. The limit of 24 hours is because only times, not dates, are\n* displayed.\n*\/\nbool TrayWindow::event(QEvent* e)\n{\n\tif (e->type() != QEvent::ToolTip)\n\t\treturn KSystemTray::event(e);\n\tQHelpEvent* he = (QHelpEvent*)e;\n\tQString text;\n\tif (Daemon::monitoringAlarms())\n\t\ttext = kapp->aboutData()->programName();\n\telse\n\t\ttext = i18n(\"%1 - disabled\", kapp->aboutData()->programName());\n\tkDebug(5950) << \"TrayWindow::event(): \" << text << endl;\n\tif (Preferences::tooltipAlarmCount())\n\t\ttooltipAlarmText(text);\n\tQToolTip::showText(he->pos(), text);\n\treturn true;\n}\n\n\/******************************************************************************\n* Return the tooltip text showing alarms due in the next 24 hours.\n* The limit of 24 hours is because only times, not dates, are displayed.\n*\/\nvoid TrayWindow::tooltipAlarmText(QString& text) const\n{\n\tKAEvent event;\n\tconst QString& prefix = Preferences::tooltipTimeToPrefix();\n\tint maxCount = Preferences::tooltipAlarmCount();\n\tQDateTime now = QDateTime::currentDateTime();\n\n\t\/\/ Get today's and tomorrow's alarms, sorted in time order\n\tQList<TipItem> items;\n\tKCal::Event::List events = AlarmCalendar::activeCalendar()->eventsWithAlarms(QDateTime(now.date()), now.addDays(1));\n\tfor (KCal::Event::List::ConstIterator it = events.begin(); it != events.end(); ++it)\n\t{\n\t\tKCal::Event* kcalEvent = *it;\n\t\tevent.set(*kcalEvent);\n\t\tif (event.enabled() && !event.expired() && event.action() == KAEvent::MESSAGE)\n\t\t{\n\t\t\tTipItem item;\n\t\t\tDateTime dateTime = event.nextDateTime(false);\n\t\t\tif (dateTime.date() > now.date())\n\t\t\t{\n\t\t\t\t\/\/ Ignore alarms after tomorrow at the current clock time\n\t\t\t\tif (dateTime.date() != now.date().addDays(1)\n\t\t\t\t|| dateTime.time() >= now.time())\n\t\t\t\t\tcontinue;\n\t\t\t}\n\t\t\titem.dateTime = dateTime.dateTime();\n\n\t\t\t\/\/ The alarm is due today, or early tomorrow\n\t\t\tbool space = false;\n\t\t\tif (Preferences::showTooltipAlarmTime())\n\t\t\t{\n\t\t\t\titem.text += KGlobal::locale()->formatTime(item.dateTime.time());\n\t\t\t\titem.text += QLatin1Char(' ');\n\t\t\t\tspace = true;\n\t\t\t}\n\t\t\tif (Preferences::showTooltipTimeToAlarm())\n\t\t\t{\n\t\t\t\tint mins = (now.secsTo(item.dateTime) + 59) \/ 60;\n\t\t\t\tif (mins < 0)\n\t\t\t\t\tmins = 0;\n\t\t\t\tchar minutes[3] = \"00\";\n\t\t\t\tminutes[0] = (mins%60) \/ 10 + '0';\n\t\t\t\tminutes[1] = (mins%60) % 10 + '0';\n\t\t\t\tif (Preferences::showTooltipAlarmTime())\n\t\t\t\t\titem.text += i18nc(\"prefix + hours:minutes\", \"(%1%2:%3)\", prefix, mins\/60, minutes);\n\t\t\t\telse\n\t\t\t\t\titem.text += i18nc(\"prefix + hours:minutes\", \"%1%2:%3\", prefix, mins\/60, minutes);\n\t\t\t\titem.text += QLatin1Char(' ');\n\t\t\t\tspace = true;\n\t\t\t}\n\t\t\tif (space)\n\t\t\t\titem.text += QLatin1Char(' ');\n\t\t\titem.text += AlarmText::summary(event);\n\n\t\t\t\/\/ Insert the item into the list in time-sorted order\n\t\t\tint i = 0;\n\t\t\tfor (int iend = items.count(); i < iend; ++i)\n\t\t\t{\n\t\t\t\tif (item.dateTime <= items[i].dateTime)\n\t\t\t\t\tbreak;\n\t\t\t}\n\t\t\titems.insert(i, item);\n\t\t}\n }\n\tkDebug(5950) << \"TrayWindow::tooltipAlarmText():\\n\";\n\tint count = 0;\n\tfor (int i = 0, iend = items.count(); i < iend; ++i)\n\t{\n\t\tkDebug(5950) << \"-- \" << (count+1) << \") \" << items[i].text << endl;\n\t\ttext += \"\\n\";\n\t\ttext += items[i].text;\n\t\tif (++count == maxCount)\n\t\t\tbreak;\n\t}\n}\n\n\/******************************************************************************\n* Called when the associated main window is closed.\n*\/\nvoid TrayWindow::removeWindow(MainWindow* win)\n{\n\tif (win == mAssocMainWindow)\n\t\tmAssocMainWindow = 0;\n}\n\n\n#if defined(HAVE_X11_HEADERS) && defined(Q_WS_X11)\n\t#include <X11\/X.h>\n\t#include <X11\/Xlib.h>\n\t#include <X11\/Xutil.h>\n#include <QX11Info>\n#endif\n\n\/******************************************************************************\n* Check whether the widget is in the system tray.\n* Note that it is only sometime AFTER the show event that the system tray\n* becomes the widget's parent. So for a definitive status, call this method\n* only after waiting a bit...\n* Reply = true if the widget is in the system tray, or its status can't be determined.\n* = false if it is not currently in the system tray.\n*\/\nbool TrayWindow::inSystemTray() const\n{\n#if defined(HAVE_X11_HEADERS) && defined(Q_WS_X11)\n\tWindow xParent; \/\/ receives parent window\n\tWindow root;\n\tWindow* children = 0;\n\tunsigned int nchildren;\n\t\/\/ Find the X parent window of the widget. This is not the same as the Qt parent widget.\n\tif (!XQueryTree(QX11Info::display(), winId(), &root, &xParent, &children, &nchildren))\n\t\treturn true; \/\/ error determining its parent X window\n\tif (children)\n\t\tXFree(children);\n\n\t\/\/ If it is in the system tray, the system tray window will be its X parent.\n\t\/\/ Otherwise, the root window will be its X parent.\n\treturn xParent != root;\n#else\n\treturn true;\n#endif \/\/ HAVE_X11_HEADERS\n}\n<commit_msg>Fix coding style<commit_after>\/*\n * traywindow.cpp - the KDE system tray applet\n * Program: kalarm\n * Copyright © 2002-2006 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 <stdlib.h>\n\n#include <QToolTip>\n#include <QMouseEvent>\n#include <QList>\n\n#include <kapplication.h>\n#include <klocale.h>\n#include <kstdaction.h>\n#include <kaboutdata.h>\n#include <kmenu.h>\n#include <kmessagebox.h>\n#include <kstandarddirs.h>\n#include <kstdaction.h>\n#include <kstdguiitem.h>\n#include <kconfig.h>\n#include <kdebug.h>\n\n#include \"alarmcalendar.h\"\n#include \"alarmlistview.h\"\n#include \"alarmtext.h\"\n#include \"daemon.h\"\n#include \"functions.h\"\n#include \"kalarmapp.h\"\n#include \"mainwindow.h\"\n#include \"messagewin.h\"\n#include \"prefdlg.h\"\n#include \"preferences.h\"\n#include \"templatemenuaction.h\"\n#include \"traywindow.moc\"\n\n\nstruct TipItem\n{\n\tQDateTime dateTime;\n\tQString text;\n};\n\n\n\/*=============================================================================\n= Class: TrayWindow\n= The KDE system tray window.\n=============================================================================*\/\n\nTrayWindow::TrayWindow(MainWindow* parent)\n\t: KSystemTray((theApp()->wantRunInSystemTray() ? parent : 0)),\n\t mAssocMainWindow(parent)\n{\n\tkDebug(5950) << \"TrayWindow::TrayWindow()\\n\";\n\t\/\/ Set up GUI icons\n\tmPixmapEnabled = loadIcon(\"kalarm\");\n\tmPixmapDisabled = loadIcon(\"kalarm_disabled\");\n\tif (mPixmapEnabled.isNull() || mPixmapDisabled.isNull())\n\t\tKMessageBox::sorry(this, i18n(\"Cannot load system tray icon.\"));\n\tsetAcceptDrops(true); \/\/ allow drag-and-drop onto this window\n\n\t\/\/ Set up the context menu\n\tKActionCollection* actcol = actionCollection();\n\tKAction* a = Daemon::createAlarmEnableAction(actcol);\n\tcontextMenu()->addAction(a);\n\tconnect(a, SIGNAL(switched(bool)), SLOT(setEnabledStatus(bool)));\n\ta = KAlarm::createNewAlarmAction(i18n(\"&New Alarm...\"), actcol, QLatin1String(\"tNew\"));\n\tcontextMenu()->addAction(a);\n\tconnect(a, SIGNAL(triggered(bool)), SLOT(slotNewAlarm()));\n\ta = KAlarm::createNewFromTemplateAction(i18n(\"New Alarm From &Template\"), actcol, QLatin1String(\"tNewFromTempl\"));\n\tcontextMenu()->addAction(a);\n\tconnect(a, SIGNAL(selected(const KAEvent&)), SLOT(slotNewFromTemplate(const KAEvent&)));\n\tcontextMenu()->addAction(KStdAction::preferences(this, SLOT(slotPreferences()), actcol));\n\n\t\/\/ Replace the default handler for the Quit context menu item\n\tconst char* quitName = KStdAction::name(KStdAction::Quit);\n\tdelete actcol->action(quitName);\n\tKStdAction::quit(this, SLOT(slotQuit()), actcol);\n\n\t\/\/ Set icon to correspond with the alarms enabled menu status\n\tDaemon::checkStatus();\n\tsetEnabledStatus(Daemon::monitoringAlarms());\n}\n\nTrayWindow::~TrayWindow()\n{\n\tkDebug(5950) << \"TrayWindow::~TrayWindow()\\n\";\n\ttheApp()->removeWindow(this);\n\temit deleted();\n}\n\n\/******************************************************************************\n* Called just before the context menu is displayed.\n* Update the Alarms Enabled item status.\n*\/\nvoid TrayWindow::contextMenuAboutToShow(KMenu*)\n{\n\tDaemon::checkStatus();\n}\n\n\/******************************************************************************\n* Called when the \"New Alarm\" menu item is selected to edit a new alarm.\n*\/\nvoid TrayWindow::slotNewAlarm()\n{\n\tMainWindow::executeNew();\n}\n\n\/******************************************************************************\n* Called when the \"New Alarm\" menu item is selected to edit a new alarm.\n*\/\nvoid TrayWindow::slotNewFromTemplate(const KAEvent& event)\n{\n\tMainWindow::executeNew(event);\n}\n\n\/******************************************************************************\n* Called when the \"Configure KAlarm\" menu item is selected.\n*\/\nvoid TrayWindow::slotPreferences()\n{\n\tKAlarmPrefDlg prefDlg;\n\tprefDlg.exec();\n}\n\n\/******************************************************************************\n* Called when the Quit context menu item is selected.\n*\/\nvoid TrayWindow::slotQuit()\n{\n\ttheApp()->doQuit(this);\n}\n\n\/******************************************************************************\n* Called when the Alarms Enabled action status has changed.\n* Updates the alarms enabled menu item check state, and the icon pixmap.\n*\/\nvoid TrayWindow::setEnabledStatus(bool status)\n{\n\tkDebug(5950) << \"TrayWindow::setEnabledStatus(\" << (int)status << \")\\n\";\n\tsetPixmap(status ? mPixmapEnabled : mPixmapDisabled);\n}\n\n\/******************************************************************************\n* Called when the mouse is clicked over the panel icon.\n* A left click displays the KAlarm main window.\n* A middle button click displays the New Alarm window.\n*\/\nvoid TrayWindow::mousePressEvent(QMouseEvent* e)\n{\n\tif (e->button() == Qt::LeftButton && !theApp()->wantRunInSystemTray())\n\t{\n\t\t\/\/ Left click: display\/hide the first main window\n\t\tmAssocMainWindow = MainWindow::toggleWindow(mAssocMainWindow);\n\t}\n\telse if (e->button() == Qt::MidButton)\n\t\tMainWindow::executeNew(); \/\/ display a New Alarm dialog\n\telse\n\t\tKSystemTray::mousePressEvent(e);\n}\n\n\/******************************************************************************\n* Called when the mouse is released over the panel icon.\n* The main window (if not hidden) is raised and made the active window.\n* If this is done in mousePressEvent(), it doesn't work.\n*\/\nvoid TrayWindow::mouseReleaseEvent(QMouseEvent* e)\n{\n\tif (e->button() == Qt::LeftButton && mAssocMainWindow && mAssocMainWindow->isVisible())\n\t{\n\t\tmAssocMainWindow->raise();\n\t\tmAssocMainWindow->activateWindow();\n\t}\n\telse\n\t\tKSystemTray::mouseReleaseEvent(e);\n}\n\n\/******************************************************************************\n* Called when the drag cursor enters the panel icon.\n*\/\nvoid TrayWindow::dragEnterEvent(QDragEnterEvent* e)\n{\n\tMainWindow::executeDragEnterEvent(e);\n}\n\n\/******************************************************************************\n* Called when an object is dropped on the panel icon.\n* If the object is recognised, the edit alarm dialog is opened appropriately.\n*\/\nvoid TrayWindow::dropEvent(QDropEvent* e)\n{\n\tMainWindow::executeDropEvent(0, e);\n}\n\n\/******************************************************************************\n* Called when any event occurs.\n* If it's a tooltip event, display the tooltip text showing alarms due in the\n* next 24 hours. The limit of 24 hours is because only times, not dates, are\n* displayed.\n*\/\nbool TrayWindow::event(QEvent* e)\n{\n\tif (e->type() != QEvent::ToolTip)\n\t\treturn KSystemTray::event(e);\n\tQHelpEvent* he = (QHelpEvent*)e;\n\tQString text;\n\tif (Daemon::monitoringAlarms())\n\t\ttext = kapp->aboutData()->programName();\n\telse\n\t\ttext = i18n(\"%1 - disabled\", kapp->aboutData()->programName());\n\tkDebug(5950) << \"TrayWindow::event(): \" << text << endl;\n\tif (Preferences::tooltipAlarmCount())\n\t\ttooltipAlarmText(text);\n\tQToolTip::showText(he->pos(), text);\n\treturn true;\n}\n\n\/******************************************************************************\n* Return the tooltip text showing alarms due in the next 24 hours.\n* The limit of 24 hours is because only times, not dates, are displayed.\n*\/\nvoid TrayWindow::tooltipAlarmText(QString& text) const\n{\n\tKAEvent event;\n\tconst QString& prefix = Preferences::tooltipTimeToPrefix();\n\tint maxCount = Preferences::tooltipAlarmCount();\n\tQDateTime now = QDateTime::currentDateTime();\n\n\t\/\/ Get today's and tomorrow's alarms, sorted in time order\n\tQList<TipItem> items;\n\tKCal::Event::List events = AlarmCalendar::activeCalendar()->eventsWithAlarms(QDateTime(now.date()), now.addDays(1));\n\tfor (KCal::Event::List::ConstIterator it = events.begin(); it != events.end(); ++it)\n\t{\n\t\tKCal::Event* kcalEvent = *it;\n\t\tevent.set(*kcalEvent);\n\t\tif (event.enabled() && !event.expired() && event.action() == KAEvent::MESSAGE)\n\t\t{\n\t\t\tTipItem item;\n\t\t\tDateTime dateTime = event.nextDateTime(false);\n\t\t\tif (dateTime.date() > now.date())\n\t\t\t{\n\t\t\t\t\/\/ Ignore alarms after tomorrow at the current clock time\n\t\t\t\tif (dateTime.date() != now.date().addDays(1)\n\t\t\t\t|| dateTime.time() >= now.time())\n\t\t\t\t\tcontinue;\n\t\t\t}\n\t\t\titem.dateTime = dateTime.dateTime();\n\n\t\t\t\/\/ The alarm is due today, or early tomorrow\n\t\t\tbool space = false;\n\t\t\tif (Preferences::showTooltipAlarmTime())\n\t\t\t{\n\t\t\t\titem.text += KGlobal::locale()->formatTime(item.dateTime.time());\n\t\t\t\titem.text += QLatin1Char(' ');\n\t\t\t\tspace = true;\n\t\t\t}\n\t\t\tif (Preferences::showTooltipTimeToAlarm())\n\t\t\t{\n\t\t\t\tint mins = (now.secsTo(item.dateTime) + 59) \/ 60;\n\t\t\t\tif (mins < 0)\n\t\t\t\t\tmins = 0;\n\t\t\t\tchar minutes[3] = \"00\";\n\t\t\t\tminutes[0] = (mins%60) \/ 10 + '0';\n\t\t\t\tminutes[1] = (mins%60) % 10 + '0';\n\t\t\t\tif (Preferences::showTooltipAlarmTime())\n\t\t\t\t\titem.text += i18nc(\"prefix + hours:minutes\", \"(%1%2:%3)\", prefix, mins\/60, minutes);\n\t\t\t\telse\n\t\t\t\t\titem.text += i18nc(\"prefix + hours:minutes\", \"%1%2:%3\", prefix, mins\/60, minutes);\n\t\t\t\titem.text += QLatin1Char(' ');\n\t\t\t\tspace = true;\n\t\t\t}\n\t\t\tif (space)\n\t\t\t\titem.text += QLatin1Char(' ');\n\t\t\titem.text += AlarmText::summary(event);\n\n\t\t\t\/\/ Insert the item into the list in time-sorted order\n\t\t\tint i = 0;\n\t\t\tfor (int iend = items.count(); i < iend; ++i)\n\t\t\t{\n\t\t\t\tif (item.dateTime <= items[i].dateTime)\n\t\t\t\t\tbreak;\n\t\t\t}\n\t\t\titems.insert(i, item);\n\t\t}\n }\n\tkDebug(5950) << \"TrayWindow::tooltipAlarmText():\\n\";\n\tint count = 0;\n\tfor (int i = 0, iend = items.count(); i < iend; ++i)\n\t{\n\t\tkDebug(5950) << \"-- \" << (count+1) << \") \" << items[i].text << endl;\n\t\ttext += \"\\n\";\n\t\ttext += items[i].text;\n\t\tif (++count == maxCount)\n\t\t\tbreak;\n\t}\n}\n\n\/******************************************************************************\n* Called when the associated main window is closed.\n*\/\nvoid TrayWindow::removeWindow(MainWindow* win)\n{\n\tif (win == mAssocMainWindow)\n\t\tmAssocMainWindow = 0;\n}\n\n\n#if defined(HAVE_X11_HEADERS) && defined(Q_WS_X11)\n\t#include <X11\/X.h>\n\t#include <X11\/Xlib.h>\n\t#include <X11\/Xutil.h>\n#include <QX11Info>\n#endif\n\n\/******************************************************************************\n* Check whether the widget is in the system tray.\n* Note that it is only sometime AFTER the show event that the system tray\n* becomes the widget's parent. So for a definitive status, call this method\n* only after waiting a bit...\n* Reply = true if the widget is in the system tray, or its status can't be determined.\n* = false if it is not currently in the system tray.\n*\/\nbool TrayWindow::inSystemTray() const\n{\n#if defined(HAVE_X11_HEADERS) && defined(Q_WS_X11)\n\tWindow xParent; \/\/ receives parent window\n\tWindow root;\n\tWindow* children = 0;\n\tunsigned int nchildren;\n\t\/\/ Find the X parent window of the widget. This is not the same as the Qt parent widget.\n\tif (!XQueryTree(QX11Info::display(), winId(), &root, &xParent, &children, &nchildren))\n\t\treturn true; \/\/ error determining its parent X window\n\tif (children)\n\t\tXFree(children);\n\n\t\/\/ If it is in the system tray, the system tray window will be its X parent.\n\t\/\/ Otherwise, the root window will be its X parent.\n\treturn xParent != root;\n#else\n\treturn true;\n#endif \/\/ HAVE_X11_HEADERS\n}\n<|endoftext|>"} {"text":"<commit_before>\/\/ Dak Washbrook - M10A\n\n\/*\n \/\/ Input\n The first three integers are in the range 0..100000. They represent seconds taken to solve the first, second, and third problems, respectively.\n Zero seconds indicates that a problem has not been solved. The last three integers are in the range 0..100, representing the attempts taken to\n solve the first, second, and third problems, respectively.\n \n \/\/ Output\n Each output line should begin with the line number (right justified in a 3 character field), followed by a colon and a space, the teams name\n (left justified in a 40 character field), followed by a single space, the number of solved problems (right justified in a 2 character field),\n a single space, and the total number of seconds including penalties it took for the solved problems (right justified in a 7 character field).\n *\/\n\n\n\/\/ Includes\n#include <iostream>\n#include <string>\n#include <iomanip>\n#include <fstream>\n\n\/\/ Namespace used.\nusing namespace std;\n\nconst int ZERO = 0, SOLVED = 1, NOT_SOLVED = 0, COLUMN1 = 3, COLUMN2 = 40, COLUMN3 = 2, COLUMN4 = 7; \/\/ Declaring Constants for zero, if solved, and the column lengths.\nconst string READ_FILE = \"RawScore.dat\", WRITE_FILE = \"ComputedScore.dat\"; \/\/ Declaring Constants for the filenames.\n\n\/\/ Prototypes\nint Solved(int score);\nbool ReadInputRecord(ifstream &, int &, int &, int &, int &, int &, int &, string &);\nbool WriteInputRecord(ofstream &, int, string, int, int);\nint CountLines(string);\n\nint main() {\n \n \/\/ Declaring all integer values.\n int numLines = ZERO, iteration = ZERO, score1, score2, score3, attempt1, attempt2, attempt3, numSolved, totalTime;\n \n \/\/ Declaring the fstreams for the read and writted files.\n ifstream filename;\n ofstream newFilename;\n \n string teamName; \/\/ Declaring the string for the team name column.\n \n numLines = CountLines(READ_FILE); \/\/ Counts the number of lines in a file.\n \n if (numLines > 0) {\n \n cout << \"Opening \" << READ_FILE << endl;\n \n filename.open(READ_FILE); \/\/ Open the READ_FILE and stream contents.\n \n if (filename) {\n \n cout << READ_FILE << \" successfuly opened.\" << endl << endl;\n \n cout << \"Opening \" << WRITE_FILE << endl;\n \n \/\/ Open the WRITE_FILE and stream contents.\n newFilename.open(WRITE_FILE);\n \n if (newFilename) {\n \n cout << WRITE_FILE << \" successfully opened.\" << endl << endl;\n \n \/\/ For each line, read contents, then convert to desired output and write.\n for (int i = ZERO; i < numLines; i++) {\n cout << \"Reading line.\" << endl;\n \/\/ Read the contents of 'filename' and store it into the reference variables.\n if (ReadInputRecord(filename, score1, score2, score3, attempt1, attempt2, attempt3, teamName)) {\n cout << \"Line successfully read\" << endl; \/\/ Say the line is read if it didn't fail.\n cout << \"Team: \" << teamName << \" found.\" << endl; \/\/ Say the name of the team it found on the current line.\n cout << \"Calculating number of successfully solved problems by \" << teamName << \".\" << endl;\n numSolved = Solved(score1) + Solved(score2) + Solved(score3); \/\/ Find out how many were solved by the team.\n cout << teamName << \" solved \" << numSolved << \" problems.\" << endl; \/\/ Output number of solved problems by the team on the current line.\n cout << \"Calculating total time it took \" << teamName << \" to solve \" << numSolved << \" problems.\" << endl;\n totalTime = score1 + score2 + score3; \/\/ Fine the total time that it took for them to solve all problems.\n cout << teamName << \" took \" << totalTime << \" seconds to solve \" << numSolved << \" problems.\" << endl; \/\/ Output the total time it took the team on the current line.\n iteration++; \/\/ Iterate for the first column's number.\n cout << \"Writing data to \" << WRITE_FILE << endl;\n if (WriteInputRecord(newFilename, iteration, teamName, numSolved, totalTime)) { \/\/ Write the new output to 'newFilename'.\n cout << \"Data written to \" << WRITE_FILE << endl << endl; \/\/ Output that the data was successfully written.\n }\n else {\n cout << \"Error writing data to file.\" << endl << endl; \/\/ If failed to write, output an error.\n break; \/\/ Break the loop due to error.\n }\n }\n else {\n cout << \"Error reading line.\" << endl << endl; \/\/ If failed to write, output an error.\n break; \/\/ Break the loop due to error.\n }\n }\n \n cout << \"Closing \" << WRITE_FILE << endl;\n newFilename.close(); \/\/ Close the WRITE_FILE;\n if (newFilename.is_open()) {\n cout << \"Error closing file.\" << endl << endl; \/\/ If failed to close, output an error.\n return 0; \/\/ If failed to close, end program.\n }\n else {\n cout << WRITE_FILE << \" closed.\" << endl << endl;\n }\n }\n else {\n \/\/ If 'newFilename' failed to open, display an error message.\n cout << \"Error Opening \" << WRITE_FILE << endl << endl;\n }\n \n cout << \"Closing \" << READ_FILE << endl;\n filename.close(); \/\/ Close the READ_FILE.\n if (filename.is_open()) {\n cout << \"Error closing file.\" << endl << endl; \/\/ If failed to close, output an error.\n return 0; \/\/ If failed to close, end program.\n }\n else {\n cout << READ_FILE << \" closed.\" << endl << endl;\n }\n }\n else {\n \/\/ If 'filename' failed to open, display an error message.\n cout << \"Error Opening \" << READ_FILE << endl << endl;\n }\n }\n else {\n \/\/ If the file is empty then alert user.\n cout << READ_FILE << \" is empty.\" << endl << endl;\n }\n \n return 0;\n \n}\n\nbool ReadInputRecord(ifstream &filename, int &score1, int &score2, int &score3, int &attempt1, int &attempt2, int &attempt3, string &teamName) {\n \/\/ Change the values of the reference variables to be the contents of the current line.\n if (filename >> score1 >> score2 >> score3 >> attempt1 >> attempt2 >> attempt3 >> teamName) {\n return true;\n }\n else {\n return false;\n }\n}\n\nbool WriteInputRecord(ofstream &newFilename, int iteration, string teamName, int numSolved, int totalTime) {\n \/\/ Write a new line to the 'newFilename' with the desired values and formatting. Also, sets the correct column widths for each column.\n if (newFilename << setw(COLUMN1) << iteration << \": \" << setw(COLUMN2) << left << teamName << right << \" \" << setw(COLUMN3) << numSolved << \" \" << setw(COLUMN4) << totalTime << endl) {\n return true;\n }\n else {\n return false;\n }\n}\n\nint Solved(int score) {\n \n \/* This function calculates if the problem was solved or not.\n Outputs SOLVED if it was, ZERO if it was not. Allowing\n the outputs to be added together to produce the total\n number of solved problems.\n *\/\n \n if (score > ZERO) { \/\/ Find if the problem was solved by seeing if their seconds were greater than 0.\n return SOLVED; \/\/ Return SOLVED if solved.\n }\n else {\n return NOT_SOLVED; \/\/ Return NOT_SOLVED if not solved.\n }\n}\n\nint CountLines(string file) {\n \n \/* This function finds the number of lines that exist in a file and outputs that number. *\/\n \n int numLines = ZERO; \/\/ Initiate numLines.\n ifstream filename;\n string line;\n \n filename.open(file); \/\/ Open the filename that was passed into the function via a string.\n \n if (filename) {\n \n cout << \"Counting number of lines in \" << file << endl;\n \n while (getline(filename, line)) {\n \/\/ For each line, iterate numLines.\n numLines++;\n }\n \n cout << numLines << \" line(s) counted.\" << endl << endl;\n \n filename.close(); \/\/ Close the file after done.\n \n }\n else {\n cout << file << \" could not be opened.\" << endl << endl;\n }\n \n return numLines; \/\/ Return the number of lines that exist.\n}\n<commit_msg>Delete Assignment-3.cpp<commit_after><|endoftext|>"} {"text":"<commit_before>#include <igloo\/igloo_alt.h>\nusing namespace igloo;\n\n#include <Packet.h>\n#include <AglVector3.h>\n#include <AglQuaternion.h>\n\nstatic const int TEST_PACKET_TYPE = 100;\n\nDescribe(a_packet)\n{\n\tIt(can_have_a_sender_id_defined_in_setSenderId_method)\n\t{\n\t\tPacket packet(TEST_PACKET_TYPE);\n\t\tpacket.setSenderId(77);\n\n\t\tAssert::That(packet.getSenderId(), Equals(77));\n\t}\n\n\tIt(can_contain_int_data)\n\t{\n\t\tPacket packet(TEST_PACKET_TYPE);\n\n\t\tint i_src = 1;\n\t\tpacket << i_src;\n\t\tint i_dst;\n\t\tpacket >> i_dst;\n\n\t\tAssert::That(i_dst, Equals(i_src));\n\t}\n\n\tIt(can_contain_float_data)\n\t{\n\t\tPacket packet(TEST_PACKET_TYPE);\n\t\tfloat f_src = 13.37f;\n\t\tpacket << f_src;\n\t\tfloat f_dst;\n\t\tpacket >> f_dst;\n\n\t\tAssert::That(f_dst, Equals(f_src));\n\t}\n\n\tIt(can_contain_bool_data)\n\t{\n\t\tPacket packet(TEST_PACKET_TYPE);\n\t\tbool b_src = true;\n\t\tpacket << b_src;\n\t\tbool b_dst;\n\t\tpacket >> b_dst;\n\n\t\tAssert::That(b_dst, Equals(b_src));\n\t}\n\n\tIt(can_contain_char_data)\n\t{\n\t\tPacket packet(TEST_PACKET_TYPE);\n\t\tchar c_src = 100;\n\t\tpacket << c_src;\n\t\tchar c_dst;\n\t\tpacket >> c_dst;\n\n\t\tAssert::That(c_dst, Equals(c_src));\n\t}\n\n\tIt(can_contain_short_data)\n\t{\n\t\tPacket packet(TEST_PACKET_TYPE);\n\t\tshort s_src = 10000;\n\t\tpacket << s_src;\n\t\tshort s_dst;\n\t\tpacket >> s_dst;\n\n\t\tAssert::That(s_dst, Equals(s_src));\n\t}\n\n\tIt(can_contain_double_data)\n\t{\n\t\tPacket packet(TEST_PACKET_TYPE);\n\t\tdouble d_src = 1337.1435000000377;\n\t\tpacket << d_src;\n\t\tdouble d_dst;\n\t\tpacket >> d_dst;\n\n\t\tAssert::That(d_dst, Equals(d_src));\n\t}\n\n\tIt(can_contain_vec3_data)\n\t{\n\t\tPacket packet(TEST_PACKET_TYPE);\n\t\tAglVector3 vec_src(1.0f, 2.0f, 3.0f);\n\t\tpacket << vec_src;\n\t\tAglVector3 vec_dst;\n\t\tpacket >> vec_dst;\n\t\t\n\t\tAssert::That(vec_dst.x, Equals(vec_src.x));\n\t\tAssert::That(vec_dst.y, Equals(vec_src.y));\n\t\tAssert::That(vec_dst.z, Equals(vec_src.z));\n\t}\n\n\tIt(can_contain_quaternion_data)\n\t{\n\t\tPacket packet(TEST_PACKET_TYPE);\n\t\tAglQuaternion quaternion_src(1.0f, 2.0f, 3.0f, 4.5f);\n\t\tpacket << quaternion_src;\n\t\tAglQuaternion quaternion_dst;\n\t\tpacket >> quaternion_dst;\n\t\t\n\t\tAssert::That(quaternion_dst.u.x, Equals(quaternion_src.u.x));\n\t\tAssert::That(quaternion_dst.u.y, Equals(quaternion_src.u.y));\n\t\tAssert::That(quaternion_dst.u.z, Equals(quaternion_src.u.z));\n\t\tAssert::That(quaternion_dst.v, Equals(quaternion_src.v));\n\t}\n\n\tIt(can_contain_multiple_int_data)\n\t{\n\t\tPacket packet(TEST_PACKET_TYPE);\n\n\t\tint i_src[] = { 1, 2, 3 };\n\t\tpacket << i_src[0] << i_src[1] << i_src[2];\n\t\tint i_dst[3];\n\t\tpacket >> i_dst[0] >> i_dst[1] >> i_dst[2];\n\n\t\tfor (int i = 0; i <3; i++)\n\t\t\tAssert::That(i_dst[i], Equals(i_src[i]));\n\t}\n\n\tIt(can_contain_multiple_types_of_data)\n\t{\n\t\tPacket packet(TEST_PACKET_TYPE);\n\t\tint i_src = 42;\n\t\tfloat f_src = 13.37f;\n\t\tpacket << i_src << f_src;\n\t\tint i_dst;\n\t\tfloat f_dst;\n\t\tpacket >> i_dst >> f_dst;\n\n\t\tAssert::That(i_dst, Equals(i_src));\n\t\tAssert::That(f_dst, Equals(f_src));\n\t}\n\n\tIt(can_be_cleared)\n\t{\n\t\tPacket packet(TEST_PACKET_TYPE);\n\t\tpacket << 10 << 10.0f;\n\n\t\tpacket.clear();\n\t\tAssert::That(packet.isEmpty(), Equals(true));\n\t}\n\n\tIt(can_return_data_size)\n\t{\n\t\tPacket packet(TEST_PACKET_TYPE);\n\n\t\tint i_src[] = { 1, 2, 3 };\n\t\tpacket << i_src[0] << i_src[1] << i_src[2];\n\t\t\n\t\tAssert::That(packet.getDataSize(), Equals(sizeof(i_src) + Packet::HEADER_SIZE));\n\t}\n\n\tIt(can_be_empty)\n\t{\n\t\tPacket packet(TEST_PACKET_TYPE);\n\t\t\n\t\tAssert::That(packet.isEmpty(), IsTrue());\n\t}\n\n\tIt(throws_an_exception_if_trying_to_stream_out_an_empty_packet)\n\t{\n\t\tPacket packet(TEST_PACKET_TYPE);\n\t\tint i_dst;\n\t\tAssertThrows(std::out_of_range, (packet >> i_dst));\n\t}\n\n\tIt(can_set_byte_data)\n\t{\n\t\tchar* byteData = new char[4 + Packet::HEADER_SIZE];\n\n\t\t\/\/ Header\n\t\tbyteData[0] = 4;\n\t\tbyteData[1] = 0;\n\t\tbyteData[2] = 0;\n\t\tbyteData[3] = 0;\n\t\tbyteData[4] = 0;\n\t\tbyteData[5] = 0;\n\n\t\t\/\/ An int \n\t\tbyteData[6] = 42;\n\t\tbyteData[7] = 0;\n\t\tbyteData[8] = 0;\n\t\tbyteData[9] = 0;\n\n\t\tPacket packet(TEST_PACKET_TYPE);\n\t\tpacket.setDataTest(byteData, 4 + Packet::HEADER_SIZE);\n\n\t\tint i_dst;\n\t\tpacket >> i_dst;\n\t\tAssert::That(i_dst, Equals(42));\n\n\t\tdelete[] byteData;\n\t}\n\n\tIt(should_be_possible_to_copy_byte_data_from_a_packet_to_another)\n\t{\n\t\tint i_src = 5;\n\t\tfloat f_src = 6.9f;\n\t\tPacket packet_src(TEST_PACKET_TYPE);\n\t\tpacket_src << i_src << f_src;\n\n\t\tunsigned int data_size = packet_src.getDataSize();\n\t\tchar* data_src = packet_src.getDataPtr();\n\n\t\tPacket packet_dst(TEST_PACKET_TYPE);\n\t\tpacket_dst.setDataTest(data_src, data_size);\n\n\t\tint i_dst;\n\t\tfloat f_dst;\n\t\tpacket_dst >> i_dst >> f_dst;\n\n\t\tAssert::That(i_dst, Equals(i_src));\n\t\tAssert::That(f_dst, Equals(f_src));\n\t}\n\n};<commit_msg>Added a test that makes sure packet size is ok. Passed.<commit_after>#include <igloo\/igloo_alt.h>\nusing namespace igloo;\n\n#include <Packet.h>\n#include <AglVector3.h>\n#include <AglQuaternion.h>\n\nstatic const int TEST_PACKET_TYPE = 100;\n\nDescribe(a_packet)\n{\n\tIt(can_have_a_sender_id_defined_in_setSenderId_method)\n\t{\n\t\tPacket packet(TEST_PACKET_TYPE);\n\t\tpacket.setSenderId(77);\n\n\t\tAssert::That(packet.getSenderId(), Equals(77));\n\t}\n\n\tIt(can_contain_int_data)\n\t{\n\t\tPacket packet(TEST_PACKET_TYPE);\n\n\t\tint i_src = 1;\n\t\tpacket << i_src;\n\t\tint i_dst;\n\t\tpacket >> i_dst;\n\n\t\tAssert::That(i_dst, Equals(i_src));\n\t}\n\n\tIt(can_contain_float_data)\n\t{\n\t\tPacket packet(TEST_PACKET_TYPE);\n\t\tfloat f_src = 13.37f;\n\t\tpacket << f_src;\n\t\tfloat f_dst;\n\t\tpacket >> f_dst;\n\n\t\tAssert::That(f_dst, Equals(f_src));\n\t}\n\n\tIt(can_contain_bool_data)\n\t{\n\t\tPacket packet(TEST_PACKET_TYPE);\n\t\tbool b_src = true;\n\t\tpacket << b_src;\n\t\tbool b_dst;\n\t\tpacket >> b_dst;\n\n\t\tAssert::That(b_dst, Equals(b_src));\n\t}\n\n\tIt(can_contain_char_data)\n\t{\n\t\tPacket packet(TEST_PACKET_TYPE);\n\t\tchar c_src = 100;\n\t\tpacket << c_src;\n\t\tchar c_dst;\n\t\tpacket >> c_dst;\n\n\t\tAssert::That(c_dst, Equals(c_src));\n\t}\n\n\tIt(can_contain_short_data)\n\t{\n\t\tPacket packet(TEST_PACKET_TYPE);\n\t\tshort s_src = 10000;\n\t\tpacket << s_src;\n\t\tshort s_dst;\n\t\tpacket >> s_dst;\n\n\t\tAssert::That(s_dst, Equals(s_src));\n\t}\n\n\tIt(can_contain_double_data)\n\t{\n\t\tPacket packet(TEST_PACKET_TYPE);\n\t\tdouble d_src = 1337.1435000000377;\n\t\tpacket << d_src;\n\t\tdouble d_dst;\n\t\tpacket >> d_dst;\n\n\t\tAssert::That(d_dst, Equals(d_src));\n\t}\n\n\tIt(can_contain_vec3_data)\n\t{\n\t\tPacket packet(TEST_PACKET_TYPE);\n\t\tAglVector3 vec_src(1.0f, 2.0f, 3.0f);\n\t\tpacket << vec_src;\n\t\tAglVector3 vec_dst;\n\t\tpacket >> vec_dst;\n\t\t\n\t\tAssert::That(vec_dst.x, Equals(vec_src.x));\n\t\tAssert::That(vec_dst.y, Equals(vec_src.y));\n\t\tAssert::That(vec_dst.z, Equals(vec_src.z));\n\t}\n\n\tIt(can_contain_quaternion_data)\n\t{\n\t\tPacket packet(TEST_PACKET_TYPE);\n\t\tAglQuaternion quaternion_src(1.0f, 2.0f, 3.0f, 4.5f);\n\t\tpacket << quaternion_src;\n\t\tAglQuaternion quaternion_dst;\n\t\tpacket >> quaternion_dst;\n\t\t\n\t\tAssert::That(quaternion_dst.u.x, Equals(quaternion_src.u.x));\n\t\tAssert::That(quaternion_dst.u.y, Equals(quaternion_src.u.y));\n\t\tAssert::That(quaternion_dst.u.z, Equals(quaternion_src.u.z));\n\t\tAssert::That(quaternion_dst.v, Equals(quaternion_src.v));\n\t}\n\n\tIt(can_contain_multiple_int_data)\n\t{\n\t\tPacket packet(TEST_PACKET_TYPE);\n\n\t\tint i_src[] = { 1, 2, 3 };\n\t\tpacket << i_src[0] << i_src[1] << i_src[2];\n\t\tint i_dst[3];\n\t\tpacket >> i_dst[0] >> i_dst[1] >> i_dst[2];\n\n\t\tfor (int i = 0; i <3; i++)\n\t\t\tAssert::That(i_dst[i], Equals(i_src[i]));\n\t}\n\n\tIt(can_contain_multiple_types_of_data)\n\t{\n\t\tPacket packet(TEST_PACKET_TYPE);\n\t\tint i_src = 42;\n\t\tfloat f_src = 13.37f;\n\t\tpacket << i_src << f_src;\n\t\tint i_dst;\n\t\tfloat f_dst;\n\t\tpacket >> i_dst >> f_dst;\n\n\t\tAssert::That(i_dst, Equals(i_src));\n\t\tAssert::That(f_dst, Equals(f_src));\n\t}\n\n\tIt(can_be_cleared)\n\t{\n\t\tPacket packet(TEST_PACKET_TYPE);\n\t\tpacket << 10 << 10.0f;\n\n\t\tpacket.clear();\n\t\tAssert::That(packet.isEmpty(), Equals(true));\n\t}\n\n\tIt(can_return_data_size)\n\t{\n\t\tPacket packet(TEST_PACKET_TYPE);\n\n\t\tint i_src[] = { 1, 2, 3 };\n\t\tpacket << i_src[0] << i_src[1] << i_src[2];\n\t\t\n\t\tAssert::That(packet.getDataSize(), Equals(sizeof(i_src) + Packet::HEADER_SIZE));\n\t}\n\n\tIt(can_be_empty)\n\t{\n\t\tPacket packet(TEST_PACKET_TYPE);\n\t\t\n\t\tAssert::That(packet.isEmpty(), IsTrue());\n\t}\n\n\tIt(throws_an_exception_if_trying_to_stream_out_an_empty_packet)\n\t{\n\t\tPacket packet(TEST_PACKET_TYPE);\n\t\tint i_dst;\n\t\tAssertThrows(std::out_of_range, (packet >> i_dst));\n\t}\n\n\tIt(can_set_byte_data)\n\t{\n\t\tchar* byteData = new char[4 + Packet::HEADER_SIZE];\n\n\t\t\/\/ Header\n\t\tbyteData[0] = 4;\n\t\tbyteData[1] = 0;\n\t\tbyteData[2] = 0;\n\t\tbyteData[3] = 0;\n\t\tbyteData[4] = 0;\n\t\tbyteData[5] = 0;\n\n\t\t\/\/ An int \n\t\tbyteData[6] = 42;\n\t\tbyteData[7] = 0;\n\t\tbyteData[8] = 0;\n\t\tbyteData[9] = 0;\n\n\t\tPacket packet(TEST_PACKET_TYPE);\n\t\tpacket.setDataTest(byteData, 4 + Packet::HEADER_SIZE);\n\n\t\tint i_dst;\n\t\tpacket >> i_dst;\n\t\tAssert::That(i_dst, Equals(42));\n\n\t\tdelete[] byteData;\n\t}\n\n\tIt(should_be_possible_to_copy_byte_data_from_a_packet_to_another)\n\t{\n\t\tint i_src = 5;\n\t\tfloat f_src = 6.9f;\n\t\tPacket packet_src(TEST_PACKET_TYPE);\n\t\tpacket_src << i_src << f_src;\n\n\t\tunsigned int data_size = packet_src.getDataSize();\n\t\tchar* data_src = packet_src.getDataPtr();\n\n\t\tPacket packet_dst(TEST_PACKET_TYPE);\n\t\tpacket_dst.setDataTest(data_src, data_size);\n\n\t\tint i_dst;\n\t\tfloat f_dst;\n\t\tpacket_dst >> i_dst >> f_dst;\n\n\t\tAssert::That(i_dst, Equals(i_src));\n\t\tAssert::That(f_dst, Equals(f_src));\n\t}\n\n\tIt(can_return_the_packet_byte_size)\n\t{\n\t\tPacket packet(TEST_PACKET_TYPE);\n\t\tpacket << 10 << 10.0f;\n\t\tAssert::That(packet.getDataSize(), Equals(14));\n\n\t\tint i_dst = 0;\n\t\tpacket >> i_dst;\n\t\tAssert::That(packet.getDataSize(), Equals(14));\n\t}\n};<|endoftext|>"} {"text":"<commit_before>\/**\n * For conditions of distribution and use, see copyright notice in license.txt\n *\n * @file AssetTreeWidget.cpp\n * @brief Tree widget showing all available assets.\n *\/\n\n#include \"StableHeaders.h\"\n#include \"DebugOperatorNew.h\"\n\n#include \"AssetTreeWidget.h\"\n#include \"AddContentWindow.h\"\n#include \"SupportedFileTypes.h\"\n#include \"RequestNewAssetDialog.h\"\n\n#include \"AssetAPI.h\"\n#include \"IAsset.h\"\n#include \"AssetCache.h\"\n#include \"QtUtils.h\"\n\n#ifdef _WINDOWS\n#include <windows.h>\n#endif\n\n#include \"MemoryLeakCheck.h\"\n\n\/\/ AssetItem\n\nAssetItem::AssetItem(const AssetPtr &asset, QTreeWidgetItem *parent) :\n QTreeWidgetItem(parent),\n assetPtr(asset)\n{\n setText(0, asset->Name());\n}\n\nAssetPtr AssetItem::Asset() const\n{\n return assetPtr.lock();\n}\n\n\/\/ AssetTreeWidget\n\nAssetTreeWidget::AssetTreeWidget(Foundation::Framework *fw, QWidget *parent) :\n QTreeWidget(parent),\n framework(fw),\n contextMenu(0)\n{\n setSelectionMode(QAbstractItemView::ExtendedSelection);\n setSelectionBehavior(QAbstractItemView::SelectItems);\n setDragDropMode(QAbstractItemView::DropOnly\/*DragDrop*\/);\n setDropIndicatorShown(true);\n}\n\nvoid AssetTreeWidget::contextMenuEvent(QContextMenuEvent *e)\n{\n \/\/ Do mousePressEvent so that the right item gets selected before we show the menu\n \/\/ (right-click doesn't do this automatically).\n QMouseEvent mouseEvent(QEvent::MouseButtonPress, e->pos(), e->globalPos(),\n Qt::LeftButton, Qt::LeftButton, Qt::NoModifier);\n\n mousePressEvent(&mouseEvent);\n\n \/\/ Create context menu and show it.\n SAFE_DELETE(contextMenu);\n contextMenu = new QMenu(this);\n\n AddAvailableActions(contextMenu);\n\n contextMenu->popup(e->globalPos());\n}\n\nvoid AssetTreeWidget::dragEnterEvent(QDragEnterEvent *e)\n{\n const QMimeData *data = e->mimeData();\n if (data->hasUrls())\n {\n foreach(QUrl url, data->urls())\n if (!GetResourceTypeFromResourceFileName(url.path().toStdString().c_str()).isEmpty())\n e->acceptProposedAction();\n }\n else\n QTreeWidget::dropEvent(e);\n}\n\nvoid AssetTreeWidget::dragMoveEvent(QDragMoveEvent *e)\n{\n const QMimeData *data = e->mimeData();\n if (data->hasUrls())\n {\n foreach(QUrl url, data->urls())\n if (!GetResourceTypeFromResourceFileName(url.path().toStdString().c_str()).isEmpty())\n e->acceptProposedAction();\n }\n else\n QTreeWidget::dragMoveEvent(e);\n}\n\nvoid AssetTreeWidget::dropEvent(QDropEvent *e)\n{\n const QMimeData *data = e->mimeData();\n if (data->hasUrls())\n {\n QStringList filenames;\n foreach(QUrl url, data->urls())\n if (!GetResourceTypeFromResourceFileName(url.path().toStdString().c_str()).isEmpty())\n {\n QString filename = url.path();\n#ifdef _WINDOWS\n \/\/ We have '\/' as the first char on windows and the filename\n \/\/ is not identified as a file properly. But on other platforms the '\/' is valid\/required.\n filename = filename.mid(1);\n#endif\n filenames << filename;\n }\n\n if (!filenames.isEmpty())\n {\n e->acceptProposedAction();\n Upload(filenames);\n }\n }\n else\n QTreeWidget::dropEvent(e);\n}\n\nvoid AssetTreeWidget::AddAvailableActions(QMenu *menu)\n{\n QList<AssetItem *> items = GetSelection();\n if (!items.isEmpty())\n {\n QMenu *deleteMenu = new QMenu(tr(\"Delete\"), menu);\n QAction *deleteSourceAction = new QAction(tr(\"Delete from source\"), deleteMenu);\n deleteSourceAction->setDisabled(true);\n QAction *deleteCacheAction = new QAction(tr(\"Delete from cache\"), deleteMenu);\n QAction *forgetAction = new QAction(tr(\"Forget asset\"), deleteMenu);\n\n deleteMenu->addAction(deleteSourceAction);\n deleteMenu->addAction(deleteCacheAction);\n deleteMenu->addAction(forgetAction);\n menu->addMenu(deleteMenu);\n\n connect(deleteSourceAction, SIGNAL(triggered()), SLOT(DeleteFromSource()));\n connect(deleteCacheAction, SIGNAL(triggered()), SLOT(DeleteFromCache()));\n connect(forgetAction, SIGNAL(triggered()), SLOT(Forget()));\n\n QMenu *reloadMenu = new QMenu(tr(\"Reload\"), menu);\n QAction *reloadFromSourceAction = new QAction(tr(\"Reload from source\"), deleteMenu);\n QAction *reloadFromCacheAction = new QAction(tr(\"Reload from cache\"), deleteMenu);\n QAction *unloadAction = new QAction(tr(\"Unload\"), deleteMenu);\n\n \/\/ Reload from cache is not possible if asset's disk source is empty.\n foreach(AssetItem *item, items)\n if (item->Asset() && item->Asset()->DiskSource().trimmed().isEmpty())\n {\n reloadFromCacheAction->setDisabled(true);\n break;\n }\n\n reloadMenu->addAction(reloadFromSourceAction);\n reloadMenu->addAction(reloadFromCacheAction);\n reloadMenu->addAction(unloadAction);\n menu->addMenu(reloadMenu);\n\n connect(reloadFromSourceAction, SIGNAL(triggered()), SLOT(ReloadFromSource()));\n connect(reloadFromCacheAction, SIGNAL(triggered()), SLOT(ReloadFromCache()));\n connect(unloadAction, SIGNAL(triggered()), SLOT(Unload()));\n\n QAction *openFileLocationAction = new QAction(tr(\"Open file location\"), menu);\n#ifndef _WINDOWS\n openFileLocationAction->setDisabled(true);\n#endif\n menu->addAction(openFileLocationAction);\n\n connect(openFileLocationAction, SIGNAL(triggered()), SLOT(OpenFileLocation()));\n\n menu->addSeparator();\n\n QAction *exportAction = new QAction(tr(\"Export...\"), menu);\n menu->addAction(exportAction);\n connect(exportAction, SIGNAL(triggered()), SLOT(Export()));\n }\n\n QAction *importAction = new QAction(tr(\"Import...\"), menu);\n connect(importAction, SIGNAL(triggered()), SLOT(Import()));\n menu->addAction(importAction);\n\n QAction *requestNewAssetAction = new QAction(tr(\"Request new asset...\"), menu);\n connect(requestNewAssetAction, SIGNAL(triggered()), SLOT(RequestNewAsset()));\n menu->addAction(requestNewAssetAction);\n}\n\nQList<AssetItem *> AssetTreeWidget::GetSelection() const\n{\n QList<AssetItem *> assetItems;\n foreach(QTreeWidgetItem *item, selectedItems())\n {\n \/\/ Omit top-level i.e. asset storage items\n AssetItem *aitem = dynamic_cast<AssetItem *>(item);\n if (aitem)\n assetItems << aitem;\n }\n\n return assetItems;\n}\n\nvoid AssetTreeWidget::DeleteFromSource()\n{\n\/*\n foreach(AssetItem *item, GetSelection())\n framework->Asset()->ForgetAsset(asset, false);\n*\/\n}\n\nvoid AssetTreeWidget::DeleteFromCache()\n{\n foreach(AssetItem *item, GetSelection())\n if (item->Asset())\n framework->Asset()->GetAssetCache()->DeleteAsset(item->Asset()->Name());\n}\n\nvoid AssetTreeWidget::Forget()\n{\n foreach(AssetItem *item, GetSelection())\n if (item->Asset())\n framework->Asset()->ForgetAsset(item->Asset(), false);\n}\n\nvoid AssetTreeWidget::Unload()\n{\n foreach(AssetItem *item, GetSelection())\n if (item->Asset())\n {\n item->Asset()->Unload();\n QTreeWidgetItem *parent = item->parent();\n parent->removeChild(item);\n SAFE_DELETE(item);\n \/\/\/\\todo Preferably use the AssetDeleted() or similar signal from AssetAPI for deleting items.\n }\n}\n\nvoid AssetTreeWidget::ReloadFromCache()\n{\n foreach(AssetItem *item, GetSelection())\n if (item->Asset())\n item->Asset()->LoadFromCache();\n}\n\nvoid AssetTreeWidget::ReloadFromSource()\n{\n foreach(AssetItem *item, GetSelection())\n if (item->Asset())\n {\n QString assetRef = item->Asset()->Name();\n \/\/ The next line will delete IAsset from the system, so dereferencing item->Asset() after that would be invalid.\n framework->Asset()->ForgetAsset(item->Asset(), false);\n framework->Asset()->RequestAsset(assetRef);\n }\n}\n\nvoid AssetTreeWidget::Import()\n{\n QtUtils::OpenFileDialogNonModal(cAllTypesFileFilter, tr(\"Import\"), \"\", 0, this, SLOT(OpenFileDialogClosed(int)), true);\n}\n\nvoid AssetTreeWidget::OpenFileDialogClosed(int result)\n{\n QFileDialog *dialog = dynamic_cast<QFileDialog *>(sender());\n assert(dialog);\n if (!dialog)\n return;\n\n if (result != QDialog::Accepted)\n return;\n\n if (dialog->selectedFiles().isEmpty())\n return;\n\n Upload(dialog->selectedFiles());\n}\n\nvoid AssetTreeWidget::RequestNewAsset()\n{\n RequestNewAssetDialog *dialog = new RequestNewAssetDialog(framework->Asset(), this);\n connect(dialog, SIGNAL(finished(int)), SLOT(RequestNewAssetDialogClosed(int)));\n dialog->show();\n}\n\nvoid AssetTreeWidget::RequestNewAssetDialogClosed(int result)\n{\n RequestNewAssetDialog *dialog = qobject_cast<RequestNewAssetDialog*>(sender());\n if (!dialog)\n return;\n\n if (result != QDialog::Accepted)\n return;\n\n framework->Asset()->RequestAsset(dialog->Source(), dialog->Type());\n}\n\nvoid AssetTreeWidget::Export()\n{\n QList<AssetItem *> sel = GetSelection();\n if (sel.isEmpty())\n return;\n\n if (sel.size() == 1)\n {\n QString ref = sel.first()->Asset() ? sel.first()->Asset()->Name() : \"\";\n QString assetName= AssetAPI::ExtractFilenameFromAssetRef(ref);\n QtUtils::SaveFileDialogNonModal(\"\", tr(\"Save Asset As\"), assetName, 0, this, SLOT(SaveAssetDialogClosed(int)));\n }\n else\n {\n QtUtils::DirectoryDialogNonModal(tr(\"Select Directory\"), \"\", 0, this, SLOT(SaveAssetDialogClosed(int)));\n }\n}\n\nvoid AssetTreeWidget::SaveAssetDialogClosed(int result)\n{\n QFileDialog *dialog = dynamic_cast<QFileDialog *>(sender());\n assert(dialog);\n\n if (!dialog || result != QDialog::Accepted || dialog->selectedFiles().isEmpty())\n return;\n\n QStringList files = dialog->selectedFiles();\n\n QList<AssetItem *> sel = GetSelection();\n\n bool isDir = QDir(files[0]).exists();\n\n if ((sel.size() == 1 && isDir) || (sel.size() > 1 && !isDir))\n {\n \/\/ should not happen normally, so just log error. No prompt for user.\n\/\/ LogError(\"Could not save asset: no such directory.\");\n return;\n }\n\n foreach(AssetItem *item, sel)\n if (item->Asset())\n {\n \/\/ if saving multiple assets, append filename to directory\n QString filename = files[0];\n if (isDir)\n {\n QString assetName = AssetAPI::ExtractFilenameFromAssetRef(item->Asset()->Name());\n \/\/while(QFile::exists(filename))\n \/\/filename.append(\"_\");\n filename += QDir::separator() + assetName;\n }\n\n QString param;\n if (item->Asset()->Type().contains(\"texture\", Qt::CaseInsensitive))\n param = filename.right(filename.size() - filename.lastIndexOf('.') - 1);\n\n item->Asset()->SaveToFile(filename, param);\n }\n}\n\nvoid AssetTreeWidget::Upload(const QStringList &files)\n{\n AddContentWindow *addContent = new AddContentWindow(framework, framework->GetDefaultWorldScene());\n addContent->AddFiles(files);\n addContent->show();\n}\n\nvoid AssetTreeWidget::OpenFileLocation()\n{\n QList<AssetItem *> selection = GetSelection();\n if (selection.isEmpty() || selection.size() < 1)\n return;\n\n AssetItem *item = selection.first();\n if (item->Asset() && !item->Asset()->DiskSource().isEmpty())\n {\n#ifdef _WINDOWS\n \/\/ Craft command line string\n QString path = boost::filesystem::path(item->Asset()->DiskSource().toStdString()).branch_path().string().c_str();\n WCHAR commandLineStr[256] = {};\n WCHAR wcharPath[256] = {};\n mbstowcs(wcharPath, QDir::toNativeSeparators(path).toStdString().c_str(), 254);\n wsprintf(commandLineStr, L\"explorer.exe %s\", wcharPath);\n\n STARTUPINFO startupInfo;\n memset(&startupInfo, 0, sizeof(STARTUPINFO));\n startupInfo.cb = sizeof(STARTUPINFO);\n PROCESS_INFORMATION processInfo;\n memset(&processInfo, 0, sizeof(PROCESS_INFORMATION));\n \/*BOOL success = *\/CreateProcessW(NULL, commandLineStr, NULL, NULL, FALSE, NORMAL_PRIORITY_CLASS,\n NULL, NULL, &startupInfo, &processInfo);\n\n CloseHandle(processInfo.hProcess);\n CloseHandle(processInfo.hThread);\n#endif\n }\n}\n<commit_msg>Assets window: \"Delete from source\" action<commit_after>\/**\n * For conditions of distribution and use, see copyright notice in license.txt\n *\n * @file AssetTreeWidget.cpp\n * @brief Tree widget showing all available assets.\n *\/\n\n#include \"StableHeaders.h\"\n#include \"DebugOperatorNew.h\"\n\n#include \"AssetTreeWidget.h\"\n#include \"AddContentWindow.h\"\n#include \"SupportedFileTypes.h\"\n#include \"RequestNewAssetDialog.h\"\n\n#include \"AssetAPI.h\"\n#include \"IAsset.h\"\n#include \"AssetCache.h\"\n#include \"QtUtils.h\"\n\n#ifdef _WINDOWS\n#include <windows.h>\n#endif\n\n#include \"MemoryLeakCheck.h\"\n\n\/\/ AssetItem\n\nAssetItem::AssetItem(const AssetPtr &asset, QTreeWidgetItem *parent) :\n QTreeWidgetItem(parent),\n assetPtr(asset)\n{\n setText(0, asset->Name());\n}\n\nAssetPtr AssetItem::Asset() const\n{\n return assetPtr.lock();\n}\n\n\/\/ AssetTreeWidget\n\nAssetTreeWidget::AssetTreeWidget(Foundation::Framework *fw, QWidget *parent) :\n QTreeWidget(parent),\n framework(fw),\n contextMenu(0)\n{\n setSelectionMode(QAbstractItemView::ExtendedSelection);\n setSelectionBehavior(QAbstractItemView::SelectItems);\n setDragDropMode(QAbstractItemView::DropOnly\/*DragDrop*\/);\n setDropIndicatorShown(true);\n}\n\nvoid AssetTreeWidget::contextMenuEvent(QContextMenuEvent *e)\n{\n \/\/ Do mousePressEvent so that the right item gets selected before we show the menu\n \/\/ (right-click doesn't do this automatically).\n QMouseEvent mouseEvent(QEvent::MouseButtonPress, e->pos(), e->globalPos(),\n Qt::LeftButton, Qt::LeftButton, Qt::NoModifier);\n\n mousePressEvent(&mouseEvent);\n\n \/\/ Create context menu and show it.\n SAFE_DELETE(contextMenu);\n contextMenu = new QMenu(this);\n\n AddAvailableActions(contextMenu);\n\n contextMenu->popup(e->globalPos());\n}\n\nvoid AssetTreeWidget::dragEnterEvent(QDragEnterEvent *e)\n{\n const QMimeData *data = e->mimeData();\n if (data->hasUrls())\n {\n foreach(QUrl url, data->urls())\n if (!GetResourceTypeFromResourceFileName(url.path().toStdString().c_str()).isEmpty())\n e->acceptProposedAction();\n }\n else\n QTreeWidget::dropEvent(e);\n}\n\nvoid AssetTreeWidget::dragMoveEvent(QDragMoveEvent *e)\n{\n const QMimeData *data = e->mimeData();\n if (data->hasUrls())\n {\n foreach(QUrl url, data->urls())\n if (!GetResourceTypeFromResourceFileName(url.path().toStdString().c_str()).isEmpty())\n e->acceptProposedAction();\n }\n else\n QTreeWidget::dragMoveEvent(e);\n}\n\nvoid AssetTreeWidget::dropEvent(QDropEvent *e)\n{\n const QMimeData *data = e->mimeData();\n if (data->hasUrls())\n {\n QStringList filenames;\n foreach(QUrl url, data->urls())\n if (!GetResourceTypeFromResourceFileName(url.path().toStdString().c_str()).isEmpty())\n {\n QString filename = url.path();\n#ifdef _WINDOWS\n \/\/ We have '\/' as the first char on windows and the filename\n \/\/ is not identified as a file properly. But on other platforms the '\/' is valid\/required.\n filename = filename.mid(1);\n#endif\n filenames << filename;\n }\n\n if (!filenames.isEmpty())\n {\n e->acceptProposedAction();\n Upload(filenames);\n }\n }\n else\n QTreeWidget::dropEvent(e);\n}\n\nvoid AssetTreeWidget::AddAvailableActions(QMenu *menu)\n{\n QList<AssetItem *> items = GetSelection();\n if (!items.isEmpty())\n {\n QMenu *deleteMenu = new QMenu(tr(\"Delete\"), menu);\n QAction *deleteSourceAction = new QAction(tr(\"Delete from source\"), deleteMenu);\n QAction *deleteCacheAction = new QAction(tr(\"Delete from cache\"), deleteMenu);\n QAction *forgetAction = new QAction(tr(\"Forget asset\"), deleteMenu);\n\n deleteMenu->addAction(deleteSourceAction);\n deleteMenu->addAction(deleteCacheAction);\n deleteMenu->addAction(forgetAction);\n menu->addMenu(deleteMenu);\n\n connect(deleteSourceAction, SIGNAL(triggered()), SLOT(DeleteFromSource()));\n connect(deleteCacheAction, SIGNAL(triggered()), SLOT(DeleteFromCache()));\n connect(forgetAction, SIGNAL(triggered()), SLOT(Forget()));\n\n QMenu *reloadMenu = new QMenu(tr(\"Reload\"), menu);\n QAction *reloadFromSourceAction = new QAction(tr(\"Reload from source\"), deleteMenu);\n QAction *reloadFromCacheAction = new QAction(tr(\"Reload from cache\"), deleteMenu);\n QAction *unloadAction = new QAction(tr(\"Unload\"), deleteMenu);\n\n \/\/ Reload from cache is not possible if asset's disk source is empty.\n foreach(AssetItem *item, items)\n if (item->Asset() && item->Asset()->DiskSource().trimmed().isEmpty())\n {\n reloadFromCacheAction->setDisabled(true);\n break;\n }\n\n reloadMenu->addAction(reloadFromSourceAction);\n reloadMenu->addAction(reloadFromCacheAction);\n reloadMenu->addAction(unloadAction);\n menu->addMenu(reloadMenu);\n\n connect(reloadFromSourceAction, SIGNAL(triggered()), SLOT(ReloadFromSource()));\n connect(reloadFromCacheAction, SIGNAL(triggered()), SLOT(ReloadFromCache()));\n connect(unloadAction, SIGNAL(triggered()), SLOT(Unload()));\n\n QAction *openFileLocationAction = new QAction(tr(\"Open file location\"), menu);\n#ifndef _WINDOWS\n openFileLocationAction->setDisabled(true);\n#endif\n menu->addAction(openFileLocationAction);\n\n connect(openFileLocationAction, SIGNAL(triggered()), SLOT(OpenFileLocation()));\n\n menu->addSeparator();\n\n QAction *exportAction = new QAction(tr(\"Export...\"), menu);\n menu->addAction(exportAction);\n connect(exportAction, SIGNAL(triggered()), SLOT(Export()));\n }\n\n QAction *importAction = new QAction(tr(\"Import...\"), menu);\n connect(importAction, SIGNAL(triggered()), SLOT(Import()));\n menu->addAction(importAction);\n\n QAction *requestNewAssetAction = new QAction(tr(\"Request new asset...\"), menu);\n connect(requestNewAssetAction, SIGNAL(triggered()), SLOT(RequestNewAsset()));\n menu->addAction(requestNewAssetAction);\n}\n\nQList<AssetItem *> AssetTreeWidget::GetSelection() const\n{\n QList<AssetItem *> assetItems;\n foreach(QTreeWidgetItem *item, selectedItems())\n {\n \/\/ Omit top-level i.e. asset storage items\n AssetItem *aitem = dynamic_cast<AssetItem *>(item);\n if (aitem)\n assetItems << aitem;\n }\n\n return assetItems;\n}\n\nvoid AssetTreeWidget::DeleteFromSource()\n{\n int ret = QMessageBox::warning(\n this,\n tr(\"Delete From Source\"),\n tr(\"Are you sure want to delete the selected asset(s) permanently from the source?\"),\n QMessageBox::Ok | QMessageBox::Cancel,\n QMessageBox::Cancel);\n\n if (ret == QMessageBox::Ok)\n {\n \/\/ AssetAPI::DeleteAssetFromStorage() signals will start deletion of tree widget asset items:\n \/\/ Gather the asset refs to a separate list beforehand in order to prevent crash.\n QStringList assetRefs;\n foreach(AssetItem *item, GetSelection())\n if (item->Asset())\n assetRefs << item->Asset()->Name();\n\n foreach(QString ref, assetRefs)\n framework->Asset()->DeleteAssetFromStorage(ref);\n }\n}\n\nvoid AssetTreeWidget::DeleteFromCache()\n{\n foreach(AssetItem *item, GetSelection())\n if (item->Asset())\n framework->Asset()->GetAssetCache()->DeleteAsset(item->Asset()->Name());\n}\n\nvoid AssetTreeWidget::Forget()\n{\n foreach(AssetItem *item, GetSelection())\n if (item->Asset())\n framework->Asset()->ForgetAsset(item->Asset(), false);\n}\n\nvoid AssetTreeWidget::Unload()\n{\n foreach(AssetItem *item, GetSelection())\n if (item->Asset())\n {\n item->Asset()->Unload();\n QTreeWidgetItem *parent = item->parent();\n parent->removeChild(item);\n SAFE_DELETE(item);\n \/\/\/\\todo Preferably use the AssetDeleted() or similar signal from AssetAPI for deleting items.\n }\n}\n\nvoid AssetTreeWidget::ReloadFromCache()\n{\n foreach(AssetItem *item, GetSelection())\n if (item->Asset())\n item->Asset()->LoadFromCache();\n}\n\nvoid AssetTreeWidget::ReloadFromSource()\n{\n foreach(AssetItem *item, GetSelection())\n if (item->Asset())\n {\n QString assetRef = item->Asset()->Name();\n \/\/ The next line will delete IAsset from the system, so dereferencing item->Asset() after that would be invalid.\n framework->Asset()->ForgetAsset(item->Asset(), false);\n framework->Asset()->RequestAsset(assetRef);\n }\n}\n\nvoid AssetTreeWidget::Import()\n{\n QtUtils::OpenFileDialogNonModal(cAllTypesFileFilter, tr(\"Import\"), \"\", 0, this, SLOT(OpenFileDialogClosed(int)), true);\n}\n\nvoid AssetTreeWidget::OpenFileDialogClosed(int result)\n{\n QFileDialog *dialog = dynamic_cast<QFileDialog *>(sender());\n assert(dialog);\n if (!dialog)\n return;\n\n if (result != QDialog::Accepted)\n return;\n\n if (dialog->selectedFiles().isEmpty())\n return;\n\n Upload(dialog->selectedFiles());\n}\n\nvoid AssetTreeWidget::RequestNewAsset()\n{\n RequestNewAssetDialog *dialog = new RequestNewAssetDialog(framework->Asset(), this);\n connect(dialog, SIGNAL(finished(int)), SLOT(RequestNewAssetDialogClosed(int)));\n dialog->show();\n}\n\nvoid AssetTreeWidget::RequestNewAssetDialogClosed(int result)\n{\n RequestNewAssetDialog *dialog = qobject_cast<RequestNewAssetDialog*>(sender());\n if (!dialog)\n return;\n\n if (result != QDialog::Accepted)\n return;\n\n framework->Asset()->RequestAsset(dialog->Source(), dialog->Type());\n}\n\nvoid AssetTreeWidget::Export()\n{\n QList<AssetItem *> sel = GetSelection();\n if (sel.isEmpty())\n return;\n\n if (sel.size() == 1)\n {\n QString ref = sel.first()->Asset() ? sel.first()->Asset()->Name() : \"\";\n QString assetName= AssetAPI::ExtractFilenameFromAssetRef(ref);\n QtUtils::SaveFileDialogNonModal(\"\", tr(\"Save Asset As\"), assetName, 0, this, SLOT(SaveAssetDialogClosed(int)));\n }\n else\n {\n QtUtils::DirectoryDialogNonModal(tr(\"Select Directory\"), \"\", 0, this, SLOT(SaveAssetDialogClosed(int)));\n }\n}\n\nvoid AssetTreeWidget::SaveAssetDialogClosed(int result)\n{\n QFileDialog *dialog = dynamic_cast<QFileDialog *>(sender());\n assert(dialog);\n\n if (!dialog || result != QDialog::Accepted || dialog->selectedFiles().isEmpty())\n return;\n\n QStringList files = dialog->selectedFiles();\n\n QList<AssetItem *> sel = GetSelection();\n\n bool isDir = QDir(files[0]).exists();\n\n if ((sel.size() == 1 && isDir) || (sel.size() > 1 && !isDir))\n {\n \/\/ should not happen normally, so just log error. No prompt for user.\n\/\/ LogError(\"Could not save asset: no such directory.\");\n return;\n }\n\n foreach(AssetItem *item, sel)\n if (item->Asset())\n {\n \/\/ if saving multiple assets, append filename to directory\n QString filename = files[0];\n if (isDir)\n {\n QString assetName = AssetAPI::ExtractFilenameFromAssetRef(item->Asset()->Name());\n \/\/while(QFile::exists(filename))\n \/\/filename.append(\"_\");\n filename += QDir::separator() + assetName;\n }\n\n QString param;\n if (item->Asset()->Type().contains(\"texture\", Qt::CaseInsensitive))\n param = filename.right(filename.size() - filename.lastIndexOf('.') - 1);\n\n item->Asset()->SaveToFile(filename, param);\n }\n}\n\nvoid AssetTreeWidget::Upload(const QStringList &files)\n{\n AddContentWindow *addContent = new AddContentWindow(framework, framework->GetDefaultWorldScene());\n addContent->AddFiles(files);\n addContent->show();\n}\n\nvoid AssetTreeWidget::OpenFileLocation()\n{\n QList<AssetItem *> selection = GetSelection();\n if (selection.isEmpty() || selection.size() < 1)\n return;\n\n AssetItem *item = selection.first();\n if (item->Asset() && !item->Asset()->DiskSource().isEmpty())\n {\n#ifdef _WINDOWS\n \/\/ Craft command line string\n QString path = boost::filesystem::path(item->Asset()->DiskSource().toStdString()).branch_path().string().c_str();\n WCHAR commandLineStr[256] = {};\n WCHAR wcharPath[256] = {};\n mbstowcs(wcharPath, QDir::toNativeSeparators(path).toStdString().c_str(), 254);\n wsprintf(commandLineStr, L\"explorer.exe %s\", wcharPath);\n\n STARTUPINFO startupInfo;\n memset(&startupInfo, 0, sizeof(STARTUPINFO));\n startupInfo.cb = sizeof(STARTUPINFO);\n PROCESS_INFORMATION processInfo;\n memset(&processInfo, 0, sizeof(PROCESS_INFORMATION));\n \/*BOOL success = *\/CreateProcessW(NULL, commandLineStr, NULL, NULL, FALSE, NORMAL_PRIORITY_CLASS,\n NULL, NULL, &startupInfo, &processInfo);\n\n CloseHandle(processInfo.hProcess);\n CloseHandle(processInfo.hThread);\n#endif\n }\n}\n<|endoftext|>"} {"text":"<commit_before>\/\/-----------------------------------------------------------------------bl-\n\/\/--------------------------------------------------------------------------\n\/\/ \n\/\/ Antioch - A Gas Dynamics Thermochemistry Library\n\/\/\n\/\/ Copyright (C) 2013 The PECOS Development Team\n\/\/\n\/\/ This library is free software; you can redistribute it and\/or\n\/\/ modify it under the terms of the Version 2.1 GNU Lesser General\n\/\/ Public License as published by the Free Software Foundation.\n\/\/\n\/\/ This library is distributed in the hope that it will be useful,\n\/\/ but WITHOUT ANY WARRANTY; without even the implied warranty of\n\/\/ MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU\n\/\/ Lesser General Public License for more details.\n\/\/\n\/\/ You should have received a copy of the GNU Lesser General Public\n\/\/ License along with this library; if not, write to the Free Software\n\/\/ Foundation, Inc. 51 Franklin Street, Fifth Floor,\n\/\/ Boston, MA 02110-1301 USA\n\/\/\n\/\/-----------------------------------------------------------------------el-\n\/\/\n\/\/ $Id$\n\/\/\n\/\/--------------------------------------------------------------------------\n\/\/--------------------------------------------------------------------------\n\n#include \"antioch_config.h\"\n\n#include <valarray>\n\n#ifdef ANTIOCH_HAVE_EIGEN\n#include \"Eigen\/Dense\"\n#endif\n\n#ifdef ANTIOCH_HAVE_METAPHYSICL\n#include \"metaphysicl\/numberarray.h\"\n#endif\n\n\/\/ C++\n#include <limits>\n#include <string>\n#include <vector>\n\n\/\/ This needs to precede any headers that might use their overloads\n#include \"antioch\/eigen_utils.h\"\n#include \"antioch\/metaphysicl_utils.h\"\n#include \"antioch\/valarray_utils.h\"\n#include \"antioch\/vector_utils.h\"\n\n\/\/ Antioch\n#include \"antioch\/antioch_asserts.h\"\n#include \"antioch\/chemical_species.h\"\n#include \"antioch\/chemical_mixture.h\"\n#include \"antioch\/reaction_set.h\"\n#include \"antioch\/read_reaction_set_data_xml.h\"\n#include \"antioch\/cea_thermo.h\"\n#include \"antioch\/kinetics_evaluator.h\"\n\n\ntemplate <typename Scalar, typename PairScalars>\nint vectester(const std::string& input_name, const PairScalars& example)\n{\n std::vector<std::string> species_str_list;\n const unsigned int n_species = 5;\n species_str_list.reserve(n_species);\n species_str_list.push_back( \"N2\" );\n species_str_list.push_back( \"O2\" );\n species_str_list.push_back( \"N\" );\n species_str_list.push_back( \"O\" );\n species_str_list.push_back( \"NO\" );\n\n Antioch::ChemicalMixture<Scalar> chem_mixture( species_str_list );\n Antioch::ReactionSet<Scalar> reaction_set( chem_mixture );\n Antioch::CEAThermodynamics<Scalar> thermo( chem_mixture );\n\n Antioch::read_reaction_set_data_xml<Scalar>( input_name, true, reaction_set );\n\n PairScalars T = example;\n T[0] = 1500.0;\n T[1] = 1500.0;\n PairScalars P = example;\n P[0] = 1.0e5;\n P[1] = 1.0e5;\n\n \/\/ Mass fractions\n PairScalars massfrac = example;\n massfrac[0] = 0.2;\n massfrac[1] = 0.2;\n std::vector<PairScalars> Y(n_species,massfrac);\n\n const PairScalars R_mix = chem_mixture.R(Y);\n\n const PairScalars rho = P\/(R_mix*T);\n\n std::vector<PairScalars> molar_densities(n_species, example);\n chem_mixture.molar_densities(rho,Y,molar_densities);\n\n std::vector<PairScalars> h_RT_minus_s_R(n_species, example);\n typedef typename Antioch::CEAThermodynamics<Scalar>::\n template Cache<PairScalars> Cache;\n thermo.h_RT_minus_s_R(Cache(T),h_RT_minus_s_R);\n\n Antioch::KineticsEvaluator<Scalar> kinetics( reaction_set );\n std::vector<PairScalars> omega_dot(n_species, example);\n \n kinetics.compute_mass_sources( T, rho, R_mix, Y, molar_densities, h_RT_minus_s_R, omega_dot );\n\n for( unsigned int s = 0; s < n_species; s++)\n {\n std::cout << std::scientific << std::setprecision(16)\n\t\t<< \"omega_dot(\" << chem_mixture.chemical_species()[s]->species() << \") = \"\n\t\t<< omega_dot[s] << std::endl;\n }\n\n int return_flag = 0;\n\n std::vector<PairScalars> omega_dot_reg(n_species,example);\n omega_dot_reg[0][0] = 7.9004530802650654e+04;\n omega_dot_reg[1][0] = -3.4113853617637843e+05;\n omega_dot_reg[2][0] = -1.8898881857838202e+05;\n omega_dot_reg[3][0] = 2.1551399274321867e+05;\n omega_dot_reg[4][0] = 2.3560883120889112e+05;\n omega_dot_reg[0][1] = omega_dot_reg[0][0];\n omega_dot_reg[1][1] = omega_dot_reg[1][0];\n omega_dot_reg[2][1] = omega_dot_reg[2][0];\n omega_dot_reg[3][1] = omega_dot_reg[3][0];\n omega_dot_reg[4][1] = omega_dot_reg[4][0];\n\n const Scalar tol = std::numeric_limits<Scalar>::epsilon() * 100;\n for( unsigned int s = 0; s < n_species; s++)\n {\n \/\/ Break this expression up to workaround bugs in my Eigen\n \/\/ version - RHS\n const PairScalars rel_error =\n (omega_dot[s] - omega_dot_reg[s])\/omega_dot_reg[s];\n const PairScalars abs_rel_error = std::abs(rel_error);\n\n if( Antioch::max(abs_rel_error) > tol )\n\t{\n\t return_flag = 1;\n\t}\n }\n\n if( return_flag == 1 )\n {\n std::cerr << \"Error: Mismatch between compute mass source terms and regression values.\" << std::endl;\n for( unsigned int s = 0; s < n_species; s++)\n\t{\n\t std::cout << std::scientific << std::setprecision(16)\n\t\t << \"omega_dot(\" << chem_mixture.chemical_species()[s]->species() << \") = \" << omega_dot[s]\n\t\t << \", omega_dot_reg(\" << chem_mixture.chemical_species()[s]->species() << \") = \" << omega_dot_reg[s]\n\t\t << std::endl;\n\t}\n }\n \n return return_flag;\n}\n\nint main(int argc, char* argv[])\n{\n \/\/ Check command line count.\n if( argc < 2 )\n {\n \/\/ TODO: Need more consistent error handling.\n std::cerr << \"Error: Must specify reaction set XML input file.\" << std::endl;\n antioch_error();\n }\n\n int returnval = 0;\n\n returnval = returnval ||\n vectester<float, std::valarray<float> >\n (argv[1], std::valarray<float>(2));\n returnval = returnval ||\n vectester<double, std::valarray<double> >\n (argv[1], std::valarray<double>(2));\n\/\/ We're not getting the full long double precision yet?\n\/\/ returnval = returnval ||\n\/\/ vectester<long double, std::valarray<long double> >\n\/\/ (argv[1], std::valarray<long double>(2));\n#ifdef ANTIOCH_HAVE_EIGEN\n returnval = returnval ||\n vectester<float, Eigen::Array2f>\n (argv[1], Eigen::Array2f());\n returnval = returnval ||\n vectester<double, Eigen::Array2d>\n (argv[1], Eigen::Array2d());\n\/\/ We're not getting the full long double precision yet?\n\/\/ returnval = returnval ||\n\/\/ vectester<long double, Eigen::Array<long double, 2, 1> >\n\/\/ (argv[1], Eigen::Array<long double, 2, 1>());\n#endif\n#ifdef ANTIOCH_HAVE_METAPHYSICL\n returnval = returnval ||\n vectester<float, MetaPhysicL::NumberArray<2, float> > (argv[1], 0);\n returnval = returnval ||\n vectester<double, MetaPhysicL::NumberArray<2, double> > (argv[1], 0);\n\/\/ returnval = returnval ||\n\/\/ vectester<long double, MetaPhysicL::NumberArray<2, long double> > (argv[1], 0);\n#endif\n\n return returnval;\n}\n<commit_msg>Refactoring; beginning tests with Eigen::Arrays of StateTypes.<commit_after>\/\/-----------------------------------------------------------------------bl-\n\/\/--------------------------------------------------------------------------\n\/\/ \n\/\/ Antioch - A Gas Dynamics Thermochemistry Library\n\/\/\n\/\/ Copyright (C) 2013 The PECOS Development Team\n\/\/\n\/\/ This library is free software; you can redistribute it and\/or\n\/\/ modify it under the terms of the Version 2.1 GNU Lesser General\n\/\/ Public License as published by the Free Software Foundation.\n\/\/\n\/\/ This library is distributed in the hope that it will be useful,\n\/\/ but WITHOUT ANY WARRANTY; without even the implied warranty of\n\/\/ MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU\n\/\/ Lesser General Public License for more details.\n\/\/\n\/\/ You should have received a copy of the GNU Lesser General Public\n\/\/ License along with this library; if not, write to the Free Software\n\/\/ Foundation, Inc. 51 Franklin Street, Fifth Floor,\n\/\/ Boston, MA 02110-1301 USA\n\/\/\n\/\/-----------------------------------------------------------------------el-\n\/\/\n\/\/ $Id$\n\/\/\n\/\/--------------------------------------------------------------------------\n\/\/--------------------------------------------------------------------------\n\n#include \"antioch_config.h\"\n\n#include <valarray>\n\n#ifdef ANTIOCH_HAVE_EIGEN\n#include \"Eigen\/Dense\"\n#endif\n\n#ifdef ANTIOCH_HAVE_METAPHYSICL\n#include \"metaphysicl\/numberarray.h\"\n#endif\n\n\/\/ C++\n#include <limits>\n#include <string>\n#include <vector>\n\n\/\/ This needs to precede any headers that might use their overloads\n#include \"antioch\/eigen_utils.h\"\n#include \"antioch\/metaphysicl_utils.h\"\n#include \"antioch\/valarray_utils.h\"\n\n\/\/ We don't use std::vector as a numeric vector, but we still need\n\/\/ vector_utils to use it as a container in our container-templated\n\/\/ functions\n#include \"antioch\/vector_utils.h\"\n\n\/\/ Antioch\n#include \"antioch\/antioch_asserts.h\"\n#include \"antioch\/chemical_species.h\"\n#include \"antioch\/chemical_mixture.h\"\n#include \"antioch\/reaction_set.h\"\n#include \"antioch\/read_reaction_set_data_xml.h\"\n#include \"antioch\/cea_thermo.h\"\n#include \"antioch\/kinetics_evaluator.h\"\n\nstatic const unsigned int n_species = 5;\n\ntemplate <typename SpeciesVector1, typename SpeciesVector2>\nint species_vec_compare (const SpeciesVector1 &a, const SpeciesVector2 &b, const std::string &name)\n{\n int found_errors = 0;\n\n typedef typename Antioch::value_type<SpeciesVector1>::type StateType;\n typedef typename Antioch::value_type<StateType>::type Scalar;\n\n for (unsigned int s=0; s != n_species; s++)\n {\n using std::abs;\n using std::max;\n\n const Scalar tol = std::numeric_limits<Scalar>::epsilon() * 100;\n\n \/\/ Break this expression up to workaround bugs in my Eigen\n \/\/ version - RHS\n const StateType rel_error = (a[s] - b[s])\/max(a[s],b[s]);\n const StateType abs_rel_error = abs(rel_error);\n\n if( Antioch::max(abs_rel_error) > tol )\n\t{\n\t found_errors++;\n\t}\n }\n\n if (found_errors)\n {\n std::cerr << \"Error: Mismatch in vectors \" << name << std::endl;\n for( unsigned int s = 0; s < n_species; s++)\n\t{\n\t std::cout << std::scientific << std::setprecision(16)\n\t\t << \"a(\" << s << \") = \" << a[s]\n\t\t << \", b(\" << s << \") = \" << b[s]\n\t\t << \", a-b(\" << s << \") = \" << StateType(a[s]-b[s])\n\t\t << std::endl;\n\t}\n }\n\n return found_errors;\n}\n\ntemplate <typename Scalar, typename PairScalars>\nint vectester(const std::string& input_name, const PairScalars& example)\n{\n std::vector<std::string> species_str_list;\n species_str_list.reserve(n_species);\n species_str_list.push_back( \"N2\" );\n species_str_list.push_back( \"O2\" );\n species_str_list.push_back( \"N\" );\n species_str_list.push_back( \"O\" );\n species_str_list.push_back( \"NO\" );\n\n Antioch::ChemicalMixture<Scalar> chem_mixture( species_str_list );\n Antioch::ReactionSet<Scalar> reaction_set( chem_mixture );\n Antioch::CEAThermodynamics<Scalar> thermo( chem_mixture );\n\n Antioch::read_reaction_set_data_xml<Scalar>( input_name, true, reaction_set );\n\n PairScalars T = example;\n T[0] = 1500.0;\n T[1] = 1500.0;\n PairScalars P = example;\n P[0] = 1.0e5;\n P[1] = 1.0e5;\n\n \/\/ Mass fractions\n PairScalars massfrac = example;\n massfrac[0] = 0.2;\n massfrac[1] = 0.2;\n const std::vector<PairScalars> Y(n_species,massfrac);\n\n const PairScalars R_mix = chem_mixture.R(Y);\n\n const PairScalars rho = P\/(R_mix*T);\n\n std::vector<PairScalars> molar_densities(n_species, example);\n chem_mixture.molar_densities(rho,Y,molar_densities);\n\n std::vector<PairScalars> h_RT_minus_s_R(n_species, example);\n typedef typename Antioch::CEAThermodynamics<Scalar>::\n template Cache<PairScalars> Cache;\n thermo.h_RT_minus_s_R(Cache(T),h_RT_minus_s_R);\n\n Antioch::KineticsEvaluator<Scalar> kinetics( reaction_set );\n std::vector<PairScalars> omega_dot(n_species, example);\n \n kinetics.compute_mass_sources( T, rho, R_mix, Y, molar_densities, h_RT_minus_s_R, omega_dot );\n\n int return_flag = 0;\n\n#ifdef ANTIOCH_HAVE_EIGEN\n typedef Eigen::Array<PairScalars,n_species,1> SpeciesVecEigenType;\n SpeciesVecEigenType eigen_Y = SpeciesVecEigenType::Constant(massfrac);\n\n const PairScalars eigen_R = chem_mixture.R(eigen_Y);\n\n return_flag +=\n species_vec_compare(eigen_R,R_mix,\"eigen_R\");\n\n SpeciesVecEigenType eigen_molar_densities;\n\n chem_mixture.molar_densities(rho,eigen_Y,eigen_molar_densities);\n\n return_flag +=\n species_vec_compare(eigen_molar_densities, molar_densities,\n \"eigen_molar_densities\");\n\n SpeciesVecEigenType eigen_h_RT_minus_s_R;\n\n thermo.h_RT_minus_s_R(Cache(T),eigen_h_RT_minus_s_R);\n\n return_flag +=\n species_vec_compare(eigen_h_RT_minus_s_R, h_RT_minus_s_R,\n \"eigen_h_RT_minus_s_R\");\n#endif \/\/ ANTIOCH_HAVE_EIGEN\n\n for( unsigned int s = 0; s < n_species; s++)\n {\n std::cout << std::scientific << std::setprecision(16)\n\t\t<< \"omega_dot(\" << chem_mixture.chemical_species()[s]->species() << \") = \"\n\t\t<< omega_dot[s] << std::endl;\n }\n\n std::vector<PairScalars> omega_dot_reg(n_species,example);\n omega_dot_reg[0][0] = 7.9004530802650654e+04;\n omega_dot_reg[1][0] = -3.4113853617637843e+05;\n omega_dot_reg[2][0] = -1.8898881857838202e+05;\n omega_dot_reg[3][0] = 2.1551399274321867e+05;\n omega_dot_reg[4][0] = 2.3560883120889112e+05;\n omega_dot_reg[0][1] = omega_dot_reg[0][0];\n omega_dot_reg[1][1] = omega_dot_reg[1][0];\n omega_dot_reg[2][1] = omega_dot_reg[2][0];\n omega_dot_reg[3][1] = omega_dot_reg[3][0];\n omega_dot_reg[4][1] = omega_dot_reg[4][0];\n\n return_flag +=\n species_vec_compare(omega_dot, omega_dot_reg, \"omega_dot\");\n\n return return_flag;\n}\n\nint main(int argc, char* argv[])\n{\n \/\/ Check command line count.\n if( argc < 2 )\n {\n \/\/ TODO: Need more consistent error handling.\n std::cerr << \"Error: Must specify reaction set XML input file.\" << std::endl;\n antioch_error();\n }\n\n int returnval = 0;\n\n returnval +=\n vectester<float, std::valarray<float> >\n (argv[1], std::valarray<float>(2));\n returnval +=\n vectester<double, std::valarray<double> >\n (argv[1], std::valarray<double>(2));\n\/\/ We're not getting the full long double precision yet?\n\/\/ returnval = returnval ||\n\/\/ vectester<long double, std::valarray<long double> >\n\/\/ (argv[1], std::valarray<long double>(2));\n#ifdef ANTIOCH_HAVE_EIGEN\n returnval +=\n vectester<float, Eigen::Array2f>\n (argv[1], Eigen::Array2f());\n returnval +=\n vectester<double, Eigen::Array2d>\n (argv[1], Eigen::Array2d());\n\/\/ We're not getting the full long double precision yet?\n\/\/ returnval = returnval ||\n\/\/ vectester<long double, Eigen::Array<long double, 2, 1> >\n\/\/ (argv[1], Eigen::Array<long double, 2, 1>());\n#endif\n#ifdef ANTIOCH_HAVE_METAPHYSICL\n returnval +=\n vectester<float, MetaPhysicL::NumberArray<2, float> > (argv[1], 0);\n returnval +=\n vectester<double, MetaPhysicL::NumberArray<2, double> > (argv[1], 0);\n\/\/ returnval = returnval ||\n\/\/ vectester<long double, MetaPhysicL::NumberArray<2, long double> > (argv[1], 0);\n#endif\n\n std::cout << \"Found \" << returnval << \" errors\" << std::endl;\n\n return (returnval != 0) ? 1 : 0;\n}\n<|endoftext|>"} {"text":"<commit_before><commit_msg>Fixed timer duplication issue<commit_after><|endoftext|>"} {"text":"<commit_before>#include \"memory_manager_base.h\"\n#include \"pr_l1_pr_l2_dram_directory_msi\/memory_manager.h\"\n#include \"pr_l1_pr_l2_dram_directory_mosi\/memory_manager.h\"\n#include \"log.h\"\n\nMemoryManagerBase* \nMemoryManagerBase::createMMU(std::string protocol_type,\n Core* core, Network* network, ShmemPerfModel* shmem_perf_model)\n{\n CachingProtocol_t caching_protocol = parseProtocolType(protocol_type);\n\n switch (caching_protocol)\n {\n case PR_L1_PR_L2_DRAM_DIRECTORY_MSI:\n return new PrL1PrL2DramDirectoryMSI::MemoryManager(core, network, shmem_perf_model);\n\n case PR_L1_PR_L2_DRAM_DIRECTORY_MOSI:\n return new PrL1PrL2DramDirectoryMOSI::MemoryManager(core, network, shmem_perf_model);\n\n default:\n LOG_PRINT_ERROR(\"Unsupported Caching Protocol (%u)\", caching_protocol);\n return NULL;\n }\n}\n\nMemoryManagerBase::CachingProtocol_t\nMemoryManagerBase::parseProtocolType(std::string& protocol_type)\n{\n if (protocol_type == \"pr_l2_pr_l2_dram_directory_msi\")\n return PR_L1_PR_L2_DRAM_DIRECTORY_MSI;\n else if (protocol_type == \"pr_l1_pr_l2_dram_directory_mosi\")\n return PR_L1_PR_L2_DRAM_DIRECTORY_MOSI;\n else\n return NUM_CACHING_PROTOCOL_TYPES;\n}\n\nvoid MemoryManagerNetworkCallback(void* obj, NetPacket packet)\n{\n MemoryManagerBase *mm = (MemoryManagerBase*) obj;\n assert(mm != NULL);\n\n switch (packet.type)\n {\n case SHARED_MEM_1:\n case SHARED_MEM_2:\n mm->handleMsgFromNetwork(packet);\n break;\n\n default:\n LOG_PRINT_ERROR(\"Got unrecognized packet type(%u)\", packet.type);\n break;\n }\n}\n<commit_msg>[misc] Minor bug<commit_after>#include \"memory_manager_base.h\"\n#include \"pr_l1_pr_l2_dram_directory_msi\/memory_manager.h\"\n#include \"pr_l1_pr_l2_dram_directory_mosi\/memory_manager.h\"\n#include \"log.h\"\n\nMemoryManagerBase* \nMemoryManagerBase::createMMU(std::string protocol_type,\n Core* core, Network* network, ShmemPerfModel* shmem_perf_model)\n{\n CachingProtocol_t caching_protocol = parseProtocolType(protocol_type);\n\n switch (caching_protocol)\n {\n case PR_L1_PR_L2_DRAM_DIRECTORY_MSI:\n return new PrL1PrL2DramDirectoryMSI::MemoryManager(core, network, shmem_perf_model);\n\n case PR_L1_PR_L2_DRAM_DIRECTORY_MOSI:\n return new PrL1PrL2DramDirectoryMOSI::MemoryManager(core, network, shmem_perf_model);\n\n default:\n LOG_PRINT_ERROR(\"Unsupported Caching Protocol (%u)\", caching_protocol);\n return NULL;\n }\n}\n\nMemoryManagerBase::CachingProtocol_t\nMemoryManagerBase::parseProtocolType(std::string& protocol_type)\n{\n if (protocol_type == \"pr_l1_pr_l2_dram_directory_msi\")\n return PR_L1_PR_L2_DRAM_DIRECTORY_MSI;\n else if (protocol_type == \"pr_l1_pr_l2_dram_directory_mosi\")\n return PR_L1_PR_L2_DRAM_DIRECTORY_MOSI;\n else\n return NUM_CACHING_PROTOCOL_TYPES;\n}\n\nvoid MemoryManagerNetworkCallback(void* obj, NetPacket packet)\n{\n MemoryManagerBase *mm = (MemoryManagerBase*) obj;\n assert(mm != NULL);\n\n switch (packet.type)\n {\n case SHARED_MEM_1:\n case SHARED_MEM_2:\n mm->handleMsgFromNetwork(packet);\n break;\n\n default:\n LOG_PRINT_ERROR(\"Got unrecognized packet type(%u)\", packet.type);\n break;\n }\n}\n<|endoftext|>"} {"text":"<commit_before>#include <cassert>\n#include <ctime>\n#include <iostream>\n#include <list>\n#include <sstream>\n#include <string>\n#include <typeinfo>\n\n#include \"..\/..\/include\/domains\/racetrack\/RacetrackProblem.h\"\n#include \"..\/..\/include\/domains\/racetrack\/RTrackDetHeuristic.h\"\n#include \"..\/..\/include\/domains\/DummyState.h\"\n\n#include \"..\/include\/ppddl\/mini-gpt\/states.h\"\n#include \"..\/include\/ppddl\/mini-gpt\/problems.h\"\n#include \"..\/include\/ppddl\/mini-gpt\/domains.h\"\n#include \"..\/include\/ppddl\/mini-gpt\/states.h\"\n#include \"..\/include\/ppddl\/mini-gpt\/exceptions.h\"\n#include \"..\/..\/include\/ppddl\/PPDDLHeuristic.h\"\n#include \"..\/..\/include\/ppddl\/PPDDLProblem.h\"\n\n#include \"..\/..\/include\/reduced\/PPDDLTaggedReduction.h\"\n#include \"..\/..\/include\/reduced\/ReducedHeuristicWrapper.h\"\n#include \"..\/..\/include\/reduced\/ReducedModel.h\"\n#include \"..\/..\/include\/reduced\/ReducedState.h\"\n#include \"..\/..\/include\/reduced\/ReducedTransition.h\"\n\n#include \"..\/..\/include\/solvers\/FFReducedModelSolver.h\"\n#include \"..\/..\/include\/solvers\/LAOStarSolver.h\"\n\n#include \"..\/..\/include\/util\/flags.h\"\n#include \"..\/..\/include\/util\/general.h\"\n\n#include \"..\/..\/include\/Problem.h\"\n\n\nusing namespace std;\nusing namespace mdplib;\nusing namespace mlppddl;\nusing namespace mlreduced;\nusing namespace mlsolvers;\n\n\nextern int yyparse();\nextern FILE* yyin;\nstring current_file;\nint warning_level = 0;\n\nstatic int verbosity = 0;\nstatic int k = 0;\n\nmlcore::Problem* problem = nullptr;\nmlcore::Heuristic* heuristic = nullptr;\nReducedModel* reducedModel = nullptr;\nReducedHeuristicWrapper* reducedHeuristic = nullptr;\nlist<ReducedTransition *> reductions;\n\nstring ffExec = \"\/home\/lpineda\/Desktop\/FF-v2.3\/ff\";\nstring ffDomain = \"-o \/home\/lpineda\/Desktop\/domain.pddl\";\nstring ffProblem = \"-f \/home\/lpineda\/Desktop\/problem.pddl\";\nstring ffCommand = ffExec + \" \" + ffDomain + \" \" + ffProblem;\n\n\n\/*\n * Parses the given PPDDL file, and returns true on success.\n *\/\nstatic bool read_file( const char* ppddlFileName )\n{\n yyin = fopen( ppddlFileName, \"r\" );\n if( yyin == NULL ) {\n cout << \"parser:\" << ppddlFileName <<\n \": \" << strerror( errno ) << endl;\n return( false );\n }\n else {\n current_file = ppddlFileName;\n bool success;\n try {\n success = (yyparse() == 0);\n }\n catch( Exception exception ) {\n fclose( yyin );\n cout << exception << endl;\n return( false );\n }\n fclose( yyin );\n return( success );\n }\n}\n\n\nbool initPPDDL(string ppddlArgs)\n{\n size_t pos_equals = ppddlArgs.find(\":\");\n assert(pos_equals != string::npos);\n string file = ppddlArgs.substr(0, pos_equals);\n string prob =\n ppddlArgs.substr(pos_equals + 1, ppddlArgs.size() - pos_equals);\n\n pair<state_t *,Rational> *initial = nullptr;\n\n if( !read_file( file.c_str() ) ) {\n cerr << \"<main>: ERROR: couldn't read problem file `\" << file << endl;\n return false;\n }\n problem_t* internalPPDDLProblem =\n (problem_t *)(problem_t::find(prob.c_str()));\n if( !internalPPDDLProblem ) {\n cerr << \"<main>: ERROR: problem `\" << prob <<\n \"' is not defined in file '\" << file << \"'\" << endl;\n return false;\n }\n\n problem = new PPDDLProblem(internalPPDDLProblem);\n heuristic = new mlppddl::PPDDLHeuristic(static_cast<PPDDLProblem*>(problem),\n mlppddl::FF);\n problem->setHeuristic(heuristic);\n}\n\n\n\/**\n * This program creates a reduced model for a given PPDDL file and solves\n * using LAO* and FF.\n *\n * The type of model is a Mk1 reduction (at most one primary outcome),\n * which implies that after k exceptions a deterministic model is used. LAO*\n * will solve this model and use FF on states with k-exceptions so that they\n * can be treated as tip nodes with a fixed cost.\n *\n * The reduction to use is specified by a set of command line arguments:\n *\n * --det_problem: the path to a PDDL file describing the deterministic\n * model to be passed to FF after k-exceptions.\n * --det_descriptor: a configuration file describing the determinization\n * in a simple format. The user of testReducedFF is responsible for\n * ensuring consistency between the files det_problem and\n * det_descriptor. The format of this file will be one action name per\n * line followed by a number specifying which of the outcomes is primary.\n * --k: The maximum number of exceptions.\n *\n * Other required command line arguments are:\n * --problem: the PPDDL domain\/problem to solve. The format is\n * ppddlFilename:problemName\n * --dir: the directory to use for FF. This directory must contain the file\n * at \"det_problem\" as well as a file called \"p01.pddl\" containing only\n * the PPDDL problem description (i.e., init and goal, not the domain).\n * The init state must be described in a single line.\n * The user of testReducedFF is responsible for ensuring consistency\n * between p01.pddl and the file passed in the \"problem\" flag.\n *\/\nint main(int argc, char* args[])\n{\n register_flags(argc, args);\n\n if (flag_is_registered(\"debug\"))\n mdplib_debug = true;\n\n \/\/ Reading flags.\n register_flags(argc, args);\n\n \/\/ The PPDDL problem to solve.\n assert(flag_is_registered_with_value(\"problem\"));;\n string ppddlArgs = flag_value(\"problem\");\n\n \/\/ The PDDL determinization to use.\n assert(flag_is_registered_with_value(\"det_problem\"));\n string detProblem = flag_value(\"det_problem\");\n\n \/\/ The configuration file for this determinization.\n assert(flag_is_registered_with_value(\"det_descriptor\"));\n string detDescriptor = flag_value(\"det_descriptor\");\n\n \/\/The directory where the determinization is stored.\n assert(flag_is_registered_with_value(\"dir\"));\n string directory = flag_value(\"dir\");\n\n \/\/The maximum number of exceptions.\n assert(flag_is_registered_with_value(\"k\"));\n int k = stoi(flag_value(\"k\"));\n\n \/\/ The verbosity level.\n if (flag_is_registered_with_value(\"v\"))\n verbosity = stoi(flag_value(\"v\"));\n\n bool useFF = true;\n if (flag_is_registered(\"no-ff\"))\n useFF = false;\n\n \/\/ The number of simulations for the experiments.\n int nsims = 100;\n if (flag_is_registered_with_value(\"n\"))\n nsims = stoi(flag_value(\"n\"));\n\n initPPDDL(ppddlArgs);\n\n \/\/ Creating the reduced model.\n ReducedTransition* reduction =\n new PPDDLTaggedReduction(problem, detDescriptor);\n reducedModel = new ReducedModel(problem, reduction, k);\n reducedHeuristic = new ReducedHeuristicWrapper(heuristic);\n reducedModel->setHeuristic(reducedHeuristic);\n\n \/\/ Solving reduced model using LAO* + FF.\n double totalPlanningTime = 0.0;\n clock_t startTime = clock();\n FFReducedModelSolver solver(reducedModel,\n ffExec,\n directory + \"\/\" + detProblem,\n directory + \"\/ff-template.pddl\",\n k,\n 1.0e-3,\n useFF);\n solver.solve(reducedModel->initialState());\n clock_t endTime = clock();\n totalPlanningTime += (double(endTime - startTime) \/ CLOCKS_PER_SEC);\n cout << \"cost \" << reducedModel->initialState()->cost() <<\n \" time \" << totalPlanningTime << endl;\n\n\n \/\/ Running a trial of the continual planning approach.\n double expectedCost = 0.0;\n for (int i = 0; i < nsims; i++) {\n double cost = 0.0;\n ReducedState* currentState =\n static_cast<ReducedState*> (reducedModel->initialState());\n mlcore::Action* action = currentState->bestAction();\n while (cost < mdplib::dead_end_cost) {\n cost += problem->cost(currentState->originalState(), action);\n \/\/ The successor state according to the original transition model.\n mlcore::State* nextOriginalState =\n randomSuccessor(problem, currentState->originalState(), action);\n\n if (problem->goal(nextOriginalState)) {\n dprint1(\"GOAL!\");\n break;\n }\n\n bool isException =\n reducedModel->isException(currentState->originalState(),\n nextOriginalState,\n action);\n int exceptionCount =\n currentState->exceptionCount() + int(isException);\n currentState = new ReducedState(nextOriginalState,\n exceptionCount,\n reducedModel);\n\n \/\/ Re-planning if needed.\n if (currentState->bestAction() == nullptr ||\n exceptionCount > k) {\n currentState->exceptionCount(0);\n currentState = static_cast<ReducedState*> (\n reducedModel->addState(currentState));\n solver.solve(currentState);\n }\n\n if (currentState->deadEnd()) {\n cost = mdplib::dead_end_cost;\n }\n\n action = currentState->bestAction();\n }\n expectedCost += cost;\n }\n cout << expectedCost \/ nsims << endl;\n cout << totalPlanningTime << endl;\n\n \/\/ Releasing memory\n for (auto reduction : reductions)\n delete reduction;\n reducedModel->cleanup();\n delete reducedModel;\n delete problem;\n return 0;\n}\n\n<commit_msg>minor changes<commit_after>#include <cassert>\n#include <ctime>\n#include <iostream>\n#include <list>\n#include <sstream>\n#include <string>\n#include <typeinfo>\n\n#include \"..\/..\/include\/domains\/racetrack\/RacetrackProblem.h\"\n#include \"..\/..\/include\/domains\/racetrack\/RTrackDetHeuristic.h\"\n#include \"..\/..\/include\/domains\/DummyState.h\"\n\n#include \"..\/include\/ppddl\/mini-gpt\/states.h\"\n#include \"..\/include\/ppddl\/mini-gpt\/problems.h\"\n#include \"..\/include\/ppddl\/mini-gpt\/domains.h\"\n#include \"..\/include\/ppddl\/mini-gpt\/states.h\"\n#include \"..\/include\/ppddl\/mini-gpt\/exceptions.h\"\n#include \"..\/..\/include\/ppddl\/PPDDLHeuristic.h\"\n#include \"..\/..\/include\/ppddl\/PPDDLProblem.h\"\n\n#include \"..\/..\/include\/reduced\/PPDDLTaggedReduction.h\"\n#include \"..\/..\/include\/reduced\/ReducedHeuristicWrapper.h\"\n#include \"..\/..\/include\/reduced\/ReducedModel.h\"\n#include \"..\/..\/include\/reduced\/ReducedState.h\"\n#include \"..\/..\/include\/reduced\/ReducedTransition.h\"\n\n#include \"..\/..\/include\/solvers\/FFReducedModelSolver.h\"\n#include \"..\/..\/include\/solvers\/LAOStarSolver.h\"\n\n#include \"..\/..\/include\/util\/flags.h\"\n#include \"..\/..\/include\/util\/general.h\"\n\n#include \"..\/..\/include\/Problem.h\"\n\n\nusing namespace std;\nusing namespace mdplib;\nusing namespace mlppddl;\nusing namespace mlreduced;\nusing namespace mlsolvers;\n\n\nextern int yyparse();\nextern FILE* yyin;\nstring current_file;\nint warning_level = 0;\n\nstatic int verbosity = 0;\nstatic int k = 0;\n\nmlcore::Problem* problem = nullptr;\nmlcore::Heuristic* heuristic = nullptr;\nReducedModel* reducedModel = nullptr;\nReducedHeuristicWrapper* reducedHeuristic = nullptr;\nlist<ReducedTransition *> reductions;\n\nstring ffExec = \"\/home\/lpineda\/Desktop\/FF-v2.3\/ff\";\nstring ffDomain = \"-o \/home\/lpineda\/Desktop\/domain.pddl\";\nstring ffProblem = \"-f \/home\/lpineda\/Desktop\/problem.pddl\";\nstring ffCommand = ffExec + \" \" + ffDomain + \" \" + ffProblem;\n\n\n\/*\n * Parses the given PPDDL file, and returns true on success.\n *\/\nstatic bool read_file( const char* ppddlFileName )\n{\n yyin = fopen( ppddlFileName, \"r\" );\n if( yyin == NULL ) {\n cout << \"parser:\" << ppddlFileName <<\n \": \" << strerror( errno ) << endl;\n return( false );\n }\n else {\n current_file = ppddlFileName;\n bool success;\n try {\n success = (yyparse() == 0);\n }\n catch( Exception exception ) {\n fclose( yyin );\n cout << exception << endl;\n return( false );\n }\n fclose( yyin );\n return( success );\n }\n}\n\n\nbool initPPDDL(string ppddlArgs)\n{\n size_t pos_equals = ppddlArgs.find(\":\");\n assert(pos_equals != string::npos);\n string file = ppddlArgs.substr(0, pos_equals);\n string prob =\n ppddlArgs.substr(pos_equals + 1, ppddlArgs.size() - pos_equals);\n\n pair<state_t *,Rational> *initial = nullptr;\n\n if( !read_file( file.c_str() ) ) {\n cerr << \"<main>: ERROR: couldn't read problem file `\" << file << endl;\n return false;\n }\n problem_t* internalPPDDLProblem =\n (problem_t *)(problem_t::find(prob.c_str()));\n if( !internalPPDDLProblem ) {\n cerr << \"<main>: ERROR: problem `\" << prob <<\n \"' is not defined in file '\" << file << \"'\" << endl;\n return false;\n }\n\n problem = new PPDDLProblem(internalPPDDLProblem);\n heuristic = new mlppddl::PPDDLHeuristic(static_cast<PPDDLProblem*>(problem),\n mlppddl::FF);\n problem->setHeuristic(heuristic);\n}\n\n\n\/**\n * This program creates a reduced model for a given PPDDL file and solves\n * using LAO* and FF.\n *\n * The type of model is a Mk1 reduction (at most one primary outcome),\n * which implies that after k exceptions a deterministic model is used. LAO*\n * will solve this model and use FF on states with k-exceptions so that they\n * can be treated as tip nodes with a fixed cost.\n *\n * The reduction to use is specified by a set of command line arguments:\n *\n * --det_problem: the path to a PDDL file describing the deterministic\n * model to be passed to FF after k-exceptions.\n * --det_descriptor: a configuration file describing the determinization\n * in a simple format. The user of testReducedFF is responsible for\n * ensuring consistency between the files det_problem and\n * det_descriptor. The format of this file will be one action name per\n * line followed by a number specifying which of the outcomes is primary.\n * --k: The maximum number of exceptions.\n *\n * Other required command line arguments are:\n * --problem: the PPDDL domain\/problem to solve. The format is\n * ppddlFilename:problemName\n * --dir: the directory to use for FF. This directory must contain the file\n * at \"det_problem\" as well as a file called \"p01.pddl\" containing only\n * the PPDDL problem description (i.e., init and goal, not the domain).\n * The init state must be described in a single line.\n * The user of testReducedFF is responsible for ensuring consistency\n * between p01.pddl and the file passed in the \"problem\" flag.\n *\/\nint main(int argc, char* args[])\n{\n register_flags(argc, args);\n\n if (flag_is_registered(\"debug\"))\n mdplib_debug = true;\n\n \/\/ Reading flags.\n register_flags(argc, args);\n\n \/\/ The PPDDL problem to solve.\n assert(flag_is_registered_with_value(\"problem\"));;\n string ppddlArgs = flag_value(\"problem\");\n\n \/\/ The PDDL determinization to use.\n assert(flag_is_registered_with_value(\"det_problem\"));\n string detProblem = flag_value(\"det_problem\");\n\n \/\/ The configuration file for this determinization.\n assert(flag_is_registered_with_value(\"det_descriptor\"));\n string detDescriptor = flag_value(\"det_descriptor\");\n\n \/\/The directory where the determinization is stored.\n assert(flag_is_registered_with_value(\"dir\"));\n string directory = flag_value(\"dir\");\n\n \/\/The maximum number of exceptions.\n assert(flag_is_registered_with_value(\"k\"));\n int k = stoi(flag_value(\"k\"));\n\n \/\/ The verbosity level.\n if (flag_is_registered_with_value(\"v\"))\n verbosity = stoi(flag_value(\"v\"));\n\n bool useFF = true;\n if (flag_is_registered(\"no-ff\"))\n useFF = false;\n\n \/\/ The number of simulations for the experiments.\n int nsims = 100;\n if (flag_is_registered_with_value(\"n\"))\n nsims = stoi(flag_value(\"n\"));\n\n initPPDDL(ppddlArgs);\n\n \/\/ Creating the reduced model.\n ReducedTransition* reduction =\n new PPDDLTaggedReduction(problem, directory + \"\/\" + detDescriptor);\n reducedModel = new ReducedModel(problem, reduction, k);\n reducedHeuristic = new ReducedHeuristicWrapper(heuristic);\n reducedModel->setHeuristic(reducedHeuristic);\n\n \/\/ Solving reduced model using LAO* + FF.\n double totalPlanningTime = 0.0;\n clock_t startTime = clock();\n FFReducedModelSolver solver(reducedModel,\n ffExec,\n directory + \"\/\" + detProblem,\n directory + \"\/ff-template.pddl\",\n k,\n 1.0e-3,\n useFF);\n solver.solve(reducedModel->initialState());\n clock_t endTime = clock();\n totalPlanningTime += (double(endTime - startTime) \/ CLOCKS_PER_SEC);\n cout << \"cost \" << reducedModel->initialState()->cost() <<\n \" time \" << totalPlanningTime << endl;\n\n\n \/\/ Running a trial of the continual planning approach.\n double expectedCost = 0.0;\n int countSuccess = 0;\n for (int i = 0; i < nsims; i++) {\n double cost = 0.0;\n ReducedState* currentState =\n static_cast<ReducedState*> (reducedModel->initialState());\n mlcore::Action* action = currentState->bestAction();\n while (cost < mdplib::dead_end_cost) {\n cost += problem->cost(currentState->originalState(), action);\n \/\/ The successor state according to the original transition model.\n mlcore::State* nextOriginalState =\n randomSuccessor(problem, currentState->originalState(), action);\n\n if (problem->goal(nextOriginalState)) {\n countSuccess++;\n dprint1(\"GOAL!\");\n break;\n }\n\n bool isException =\n reducedModel->isException(currentState->originalState(),\n nextOriginalState,\n action);\n int exceptionCount =\n currentState->exceptionCount() + int(isException);\n currentState = new ReducedState(nextOriginalState,\n exceptionCount,\n reducedModel);\n\n \/\/ Re-planning if needed.\n if (currentState->bestAction() == nullptr ||\n exceptionCount > k) {\n currentState->exceptionCount(0);\n currentState = static_cast<ReducedState*> (\n reducedModel->addState(currentState));\n solver.solve(currentState);\n }\n\n if (currentState->deadEnd()) {\n cost = mdplib::dead_end_cost;\n }\n\n action = currentState->bestAction();\n }\n expectedCost += cost;\n if (verbosity > 1)\n cout << \"sim \" << i << \", success: \" << countSuccess << endl;\n }\n cout << expectedCost \/ nsims << endl;\n cout << totalPlanningTime << endl;\n cout << countSuccess << endl;\n\n \/\/ Releasing memory\n for (auto reduction : reductions)\n delete reduction;\n reducedModel->cleanup();\n delete reducedModel;\n delete problem;\n return 0;\n}\n\n<|endoftext|>"} {"text":"<commit_before>#include <iostream>\n#include <vector>\n\nstd::vector<int> generate_range(int lowerbound, int upperbound) {\n\tint length = upperbound - lowerbound;\n\tstd::vector<int> range;\n\tfor(int i = lowerbound + 1; i <= upperbound; i++) {\n\t\trange << i;\n\t}\n\treturn range;\n}\n\nvoid apply_sieve(std::vector<int> range, std::vector<int> primes) {\n\tint lowerbound = range.front();\n\tint upperbound = range.back();\n\tfor(std::vector<int>::iterator it = primes.begin(); it != primes.end(); ++it) {\n\t\tint p = *it;\n\t\tint composite = lowerbound \/ p + p;\n\t\twhile(composite <= upperbound) {\n\t\t\tint index = composite - lowerbound;\n\t\t\trange.at(index) = 0;\n\t\t}\n\t}\n}\n\nint main(int argc, char** argv) {\n\tstd::vector<int> primes;\n\tprimes << 2;\n\tprimes << 3;\n\tprimes << 5;\n\tstd::vector range = generate_range(6, 25);\n\tapply_sieve(range, primes);\n\n\tfor(std::vector<int>::iterator it = range.begin(); it != range.end(); ++it) {\n\t\tstd::cout << *it << \",\";\n\t}\n\tstd::cout << \"\\n\";\n\treturn 0;\n}\n<commit_msg>It's alive<commit_after>#include <iostream>\n#include <vector>\n\nstd::vector<int> generate_range(int lowerbound, int upperbound) {\n\tint length = upperbound - lowerbound;\n\tstd::vector<int> range;\n\tfor(int i = lowerbound; i <= upperbound; i++) {\n\t\trange.push_back(i);\n\t}\n\treturn range;\n}\n\nvoid mark_composites_in_range(int prime, std::vector<int> &range, int lowerbound, int upperbound) {\n\t\/\/ Determine smallest composite in range (start)\n\tint lb_mod_p = (lowerbound % prime);\n\tint start = (lb_mod_p == 0) ? lowerbound : lowerbound - lb_mod_p + prime;\n\n\t\/\/ Determine largest composite in range (stop)\n\tint ub_mod_p = (upperbound % prime);\n\tint stop = upperbound - ub_mod_p;\n\n\t\/\/ Adjust for appropriate index range\n\tstart = start - lowerbound;\n\tstop = stop - lowerbound;\n\tfor(int index = start; index <= stop; index += prime) {\n\t\tstd::cout << \"\\tMarking \" << index + lowerbound << \" as 0 at position \" << index << \"\\n\";\n\t\trange.at(index) = 0;\n\t}\n}\n\nvoid apply_sieve(std::vector<int> &range, std::vector<int> primes) {\n\tint lowerbound = range.front();\n\tint upperbound = range.back();\n\tfor(std::vector<int>::iterator it = primes.begin(); it != primes.end(); ++it) {\n\t\tint p = *it;\n\t\tstd::cout << \"Attempting to sieve for prime \" << p << \"\\n\";\n\t\tmark_composites_in_range(p, range, lowerbound, upperbound);\n\t}\n}\n\nint main(int argc, char** argv) {\n\tstd::vector<int> primes;\n\tprimes.push_back(2);\n\tprimes.push_back(3);\n\tprimes.push_back(5);\n\tstd::vector<int> range = generate_range(6, 25);\n\tapply_sieve(range, primes);\n\n\tfor(std::vector<int>::iterator it = range.begin(); it != range.end(); ++it) {\n\t\tstd::cout << *it << \",\";\n\t}\n\tstd::cout << \"\\n\";\n\treturn 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 \"ui\/views\/controls\/menu\/menu_config.h\"\n\n#include \"build\/build_config.h\"\n\nnamespace views {\n\nstatic MenuConfig* config_instance = NULL;\n\nMenuConfig::MenuConfig()\n : text_color(SK_ColorBLACK),\n item_top_margin(3),\n item_bottom_margin(4),\n item_no_icon_top_margin(1),\n item_no_icon_bottom_margin(3),\n item_left_margin(4),\n label_to_arrow_padding(10),\n arrow_to_edge_padding(5),\n icon_to_label_padding(8),\n gutter_to_label(5),\n check_width(16),\n check_height(16),\n radio_width(16),\n radio_height(16),\n arrow_height(9),\n arrow_width(9),\n gutter_width(0),\n separator_height(6),\n render_gutter(false),\n show_mnemonics(false),\n scroll_arrow_height(3),\n label_to_accelerator_padding(10),\n show_accelerators(true) {\n}\n\nMenuConfig::~MenuConfig() {}\n\nvoid MenuConfig::Reset() {\n delete config_instance;\n config_instance = NULL;\n}\n\n\/\/ static\nconst MenuConfig& MenuConfig::instance() {\n if (!config_instance)\n config_instance = Create();\n return *config_instance;\n}\n\n} \/\/ namespace views\n<commit_msg>Make menu items 40px tall when touch-optimized-ui is set.<commit_after>\/\/ Copyright (c) 2012 The Chromium Authors. All rights reserved.\n\/\/ Use of this source code is governed by a BSD-style license that can be\n\/\/ found in the LICENSE file.\n\n#include \"ui\/views\/controls\/menu\/menu_config.h\"\n\n#include \"base\/command_line.h\"\n#include \"build\/build_config.h\"\n#include \"ui\/base\/ui_base_switches.h\"\n\nnamespace views {\n\nstatic MenuConfig* config_instance = NULL;\n\nMenuConfig::MenuConfig()\n : text_color(SK_ColorBLACK),\n item_top_margin(3),\n item_bottom_margin(4),\n item_no_icon_top_margin(1),\n item_no_icon_bottom_margin(3),\n item_left_margin(4),\n label_to_arrow_padding(10),\n arrow_to_edge_padding(5),\n icon_to_label_padding(8),\n gutter_to_label(5),\n check_width(16),\n check_height(16),\n radio_width(16),\n radio_height(16),\n arrow_height(9),\n arrow_width(9),\n gutter_width(0),\n separator_height(6),\n render_gutter(false),\n show_mnemonics(false),\n scroll_arrow_height(3),\n label_to_accelerator_padding(10),\n show_accelerators(true) {\n \/\/ Use 40px tall menu items when running in touch optimized mode.\n if (CommandLine::ForCurrentProcess()->HasSwitch(\n switches::kTouchOptimizedUI)) {\n item_top_margin = item_no_icon_top_margin = 12;\n item_bottom_margin = item_no_icon_bottom_margin = 13;\n }\n}\n\nMenuConfig::~MenuConfig() {}\n\nvoid MenuConfig::Reset() {\n delete config_instance;\n config_instance = NULL;\n}\n\n\/\/ static\nconst MenuConfig& MenuConfig::instance() {\n if (!config_instance)\n config_instance = Create();\n return *config_instance;\n}\n\n} \/\/ namespace views\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 \"frtconfigresponsev3.h\"\n#include \"compressioninfo.h\"\n#include <vespa\/fnet\/frt\/frt.h>\n\n#include <vespa\/log\/log.h>\nLOG_SETUP(\".config.frt.frtconfigresponsev3\");\n\nusing namespace vespalib;\nusing namespace vespalib::slime;\nusing namespace vespalib::slime::convenience;\nusing namespace config::protocol;\nusing namespace config::protocol::v2;\nusing namespace config::protocol::v3;\n\nnamespace config {\n\nstd::string make_json(const Slime &slime, bool compact) {\n vespalib::SimpleBuffer buf;\n vespalib::slime::JsonFormat::encode(slime, buf, compact);\n return buf.get().make_string();\n}\n\nclass V3Payload : public Payload\n{\npublic:\n V3Payload(const SlimePtr & data)\n : _data(data)\n {\n }\n\n const Inspector & getSlimePayload() const override {\n return _data->get();\n }\nprivate:\n SlimePtr _data;\n};\n\nconst vespalib::string FRTConfigResponseV3::RESPONSE_TYPES = \"sx\";\n\nFRTConfigResponseV3::FRTConfigResponseV3(FRT_RPCRequest * request)\n : SlimeConfigResponse(request)\n{\n}\n\nconst vespalib::string &\nFRTConfigResponseV3::getResponseTypes() const\n{\n return RESPONSE_TYPES;\n}\n\nconst ConfigValue\nFRTConfigResponseV3::readConfigValue() const\n{\n vespalib::string md5(_data->get()[RESPONSE_CONFIG_MD5].asString().make_string());\n CompressionInfo info;\n info.deserialize(_data->get()[RESPONSE_COMPRESSION_INFO]);\n Slime * rawData = new Slime();\n SlimePtr payloadData(rawData);\n DecompressedData data(decompress(((*_returnValues)[1]._data._buf), ((*_returnValues)[1]._data._len), info.compressionType, info.uncompressedSize));\n size_t consumedSize = JsonFormat::decode(data.memRef, *rawData);\n if (consumedSize == 0) {\n std::string json(make_json(*payloadData, true));\n LOG(error, \"Error decoding JSON. Consumed size: %lu, uncompressed size: %u, compression type: %s, assumed uncompressed size(%u), compressed size: %u, slime(%s)\", consumedSize, data.size, compressionTypeToString(info.compressionType).c_str(), info.uncompressedSize, ((*_returnValues)[1]._data._len), json.c_str());\n assert(false);\n }\n if (LOG_WOULD_LOG(spam)) {\n LOG(spam, \"read config value md5(%s), payload size: %lu\", md5.c_str(), data.memRef.size);\n }\n return ConfigValue(PayloadPtr(new V3Payload(payloadData)), md5);\n}\n\n} \/\/ namespace config\n<commit_msg>Allow empty input to preserve behavior<commit_after>\/\/ Copyright 2017 Yahoo Holdings. Licensed under the terms of the Apache 2.0 license. See LICENSE in the project root.\n#include \"frtconfigresponsev3.h\"\n#include \"compressioninfo.h\"\n#include <vespa\/fnet\/frt\/frt.h>\n\n#include <vespa\/log\/log.h>\nLOG_SETUP(\".config.frt.frtconfigresponsev3\");\n\nusing namespace vespalib;\nusing namespace vespalib::slime;\nusing namespace vespalib::slime::convenience;\nusing namespace config::protocol;\nusing namespace config::protocol::v2;\nusing namespace config::protocol::v3;\n\nnamespace config {\n\nstd::string make_json(const Slime &slime, bool compact) {\n vespalib::SimpleBuffer buf;\n vespalib::slime::JsonFormat::encode(slime, buf, compact);\n return buf.get().make_string();\n}\n\nclass V3Payload : public Payload\n{\npublic:\n V3Payload(const SlimePtr & data)\n : _data(data)\n {\n }\n\n const Inspector & getSlimePayload() const override {\n return _data->get();\n }\nprivate:\n SlimePtr _data;\n};\n\nconst vespalib::string FRTConfigResponseV3::RESPONSE_TYPES = \"sx\";\n\nFRTConfigResponseV3::FRTConfigResponseV3(FRT_RPCRequest * request)\n : SlimeConfigResponse(request)\n{\n}\n\nconst vespalib::string &\nFRTConfigResponseV3::getResponseTypes() const\n{\n return RESPONSE_TYPES;\n}\n\nconst ConfigValue\nFRTConfigResponseV3::readConfigValue() const\n{\n vespalib::string md5(_data->get()[RESPONSE_CONFIG_MD5].asString().make_string());\n CompressionInfo info;\n info.deserialize(_data->get()[RESPONSE_COMPRESSION_INFO]);\n Slime * rawData = new Slime();\n SlimePtr payloadData(rawData);\n DecompressedData data(decompress(((*_returnValues)[1]._data._buf), ((*_returnValues)[1]._data._len), info.compressionType, info.uncompressedSize));\n if (data.memRef.size > 0) {\n size_t consumedSize = JsonFormat::decode(data.memRef, *rawData);\n if (consumedSize == 0) {\n std::string json(make_json(*payloadData, true));\n LOG(error, \"Error decoding JSON. Consumed size: %lu, uncompressed size: %u, compression type: %s, assumed uncompressed size(%u), compressed size: %u, slime(%s)\", consumedSize, data.size, compressionTypeToString(info.compressionType).c_str(), info.uncompressedSize, ((*_returnValues)[1]._data._len), json.c_str());\n assert(false);\n }\n }\n if (LOG_WOULD_LOG(spam)) {\n LOG(spam, \"read config value md5(%s), payload size: %lu\", md5.c_str(), data.memRef.size);\n }\n return ConfigValue(PayloadPtr(new V3Payload(payloadData)), md5);\n}\n\n} \/\/ namespace config\n<|endoftext|>"} {"text":"<commit_before>\/\/===- OperationSupportTest.cpp - Operation support unit tests ------------===\/\/\n\/\/\n\/\/ Copyright 2019 The MLIR Authors.\n\/\/\n\/\/ Licensed under the Apache License, Version 2.0 (the \"License\");\n\/\/ you may not use this file except in compliance with the License.\n\/\/ You may obtain a copy of the License at\n\/\/\n\/\/ http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n\/\/\n\/\/ Unless required by applicable law or agreed to in writing, software\n\/\/ distributed under the License is distributed on an \"AS IS\" BASIS,\n\/\/ WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n\/\/ See the License for the specific language governing permissions and\n\/\/ limitations under the License.\n\/\/ =============================================================================\n\n#include \"mlir\/IR\/OperationSupport.h\"\n#include \"mlir\/IR\/Builders.h\"\n#include \"mlir\/IR\/StandardTypes.h\"\n#include \"gtest\/gtest.h\"\n\nusing namespace mlir;\nusing namespace mlir::detail;\n\nnamespace {\nOperation *createOp(MLIRContext *context, bool resizableOperands,\n ArrayRef<Value *> operands = llvm::None,\n ArrayRef<Type> resultTypes = llvm::None) {\n return Operation::create(\n UnknownLoc::get(context), OperationName(\"foo.bar\", context), operands,\n resultTypes, llvm::None, llvm::None, 0, resizableOperands, context);\n}\n\nTEST(OperandStorageTest, NonResizable) {\n MLIRContext context;\n Builder builder(&context);\n\n Operation *useOp =\n createOp(&context, \/*resizableOperands=*\/false, \/*operands=*\/llvm::None,\n builder.getIntegerType(16));\n Value *operand = useOp->getResult(0);\n\n \/\/ Create a non-resizable operation with one operand.\n Operation *user = createOp(&context, \/*resizableOperands=*\/false, operand,\n builder.getIntegerType(16));\n\n \/\/ Sanity check the storage.\n EXPECT_EQ(user->hasResizableOperandsList(), false);\n\n \/\/ The same number of operands is okay.\n user->setOperands(operand);\n EXPECT_EQ(user->getNumOperands(), 1);\n\n \/\/ Removing is okay.\n user->setOperands(llvm::None);\n EXPECT_EQ(user->getNumOperands(), 0);\n\n \/\/ Destroy the operations.\n user->destroy();\n useOp->destroy();\n}\n\nTEST(OperandStorageDeathTest, AddToNonResizable) {\n MLIRContext context;\n Builder builder(&context);\n\n Operation *useOp =\n createOp(&context, \/*resizableOperands=*\/false, \/*operands=*\/llvm::None,\n builder.getIntegerType(16));\n Value *operand = useOp->getResult(0);\n\n \/\/ Create a non-resizable operation with one operand.\n Operation *user = createOp(&context, \/*resizableOperands=*\/false, operand,\n builder.getIntegerType(16));\n\n \/\/ Sanity check the storage.\n EXPECT_EQ(user->hasResizableOperandsList(), false);\n\n \/\/ Adding operands to a non resizable operation should result in a failure.\n ASSERT_DEATH(user->setOperands({operand, operand}), \"\");\n}\n\nTEST(OperandStorageTest, Resizable) {\n MLIRContext context;\n Builder builder(&context);\n\n Operation *useOp =\n createOp(&context, \/*resizableOperands=*\/false, \/*operands=*\/llvm::None,\n builder.getIntegerType(16));\n Value *operand = useOp->getResult(0);\n\n \/\/ Create a resizable operation with one operand.\n Operation *user = createOp(&context, \/*resizableOperands=*\/true, operand,\n builder.getIntegerType(16));\n\n \/\/ Sanity check the storage.\n EXPECT_EQ(user->hasResizableOperandsList(), true);\n\n \/\/ The same number of operands is okay.\n user->setOperands(operand);\n EXPECT_EQ(user->getNumOperands(), 1);\n\n \/\/ Removing is okay.\n user->setOperands(llvm::None);\n EXPECT_EQ(user->getNumOperands(), 0);\n\n \/\/ Adding more operands is okay.\n user->setOperands({operand, operand, operand});\n EXPECT_EQ(user->getNumOperands(), 3);\n\n \/\/ Destroy the operations.\n user->destroy();\n useOp->destroy();\n}\n\n} \/\/ end namespace\n<commit_msg> Fix -Wsign-compare in OperationSupportTest.cpp<commit_after>\/\/===- OperationSupportTest.cpp - Operation support unit tests ------------===\/\/\n\/\/\n\/\/ Copyright 2019 The MLIR Authors.\n\/\/\n\/\/ Licensed under the Apache License, Version 2.0 (the \"License\");\n\/\/ you may not use this file except in compliance with the License.\n\/\/ You may obtain a copy of the License at\n\/\/\n\/\/ http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n\/\/\n\/\/ Unless required by applicable law or agreed to in writing, software\n\/\/ distributed under the License is distributed on an \"AS IS\" BASIS,\n\/\/ WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n\/\/ See the License for the specific language governing permissions and\n\/\/ limitations under the License.\n\/\/ =============================================================================\n\n#include \"mlir\/IR\/OperationSupport.h\"\n#include \"mlir\/IR\/Builders.h\"\n#include \"mlir\/IR\/StandardTypes.h\"\n#include \"gtest\/gtest.h\"\n\nusing namespace mlir;\nusing namespace mlir::detail;\n\nnamespace {\nOperation *createOp(MLIRContext *context, bool resizableOperands,\n ArrayRef<Value *> operands = llvm::None,\n ArrayRef<Type> resultTypes = llvm::None) {\n return Operation::create(\n UnknownLoc::get(context), OperationName(\"foo.bar\", context), operands,\n resultTypes, llvm::None, llvm::None, 0, resizableOperands, context);\n}\n\nTEST(OperandStorageTest, NonResizable) {\n MLIRContext context;\n Builder builder(&context);\n\n Operation *useOp =\n createOp(&context, \/*resizableOperands=*\/false, \/*operands=*\/llvm::None,\n builder.getIntegerType(16));\n Value *operand = useOp->getResult(0);\n\n \/\/ Create a non-resizable operation with one operand.\n Operation *user = createOp(&context, \/*resizableOperands=*\/false, operand,\n builder.getIntegerType(16));\n\n \/\/ Sanity check the storage.\n EXPECT_EQ(user->hasResizableOperandsList(), false);\n\n \/\/ The same number of operands is okay.\n user->setOperands(operand);\n EXPECT_EQ(user->getNumOperands(), 1u);\n\n \/\/ Removing is okay.\n user->setOperands(llvm::None);\n EXPECT_EQ(user->getNumOperands(), 0u);\n\n \/\/ Destroy the operations.\n user->destroy();\n useOp->destroy();\n}\n\nTEST(OperandStorageDeathTest, AddToNonResizable) {\n MLIRContext context;\n Builder builder(&context);\n\n Operation *useOp =\n createOp(&context, \/*resizableOperands=*\/false, \/*operands=*\/llvm::None,\n builder.getIntegerType(16));\n Value *operand = useOp->getResult(0);\n\n \/\/ Create a non-resizable operation with one operand.\n Operation *user = createOp(&context, \/*resizableOperands=*\/false, operand,\n builder.getIntegerType(16));\n\n \/\/ Sanity check the storage.\n EXPECT_EQ(user->hasResizableOperandsList(), false);\n\n \/\/ Adding operands to a non resizable operation should result in a failure.\n ASSERT_DEATH(user->setOperands({operand, operand}), \"\");\n}\n\nTEST(OperandStorageTest, Resizable) {\n MLIRContext context;\n Builder builder(&context);\n\n Operation *useOp =\n createOp(&context, \/*resizableOperands=*\/false, \/*operands=*\/llvm::None,\n builder.getIntegerType(16));\n Value *operand = useOp->getResult(0);\n\n \/\/ Create a resizable operation with one operand.\n Operation *user = createOp(&context, \/*resizableOperands=*\/true, operand,\n builder.getIntegerType(16));\n\n \/\/ Sanity check the storage.\n EXPECT_EQ(user->hasResizableOperandsList(), true);\n\n \/\/ The same number of operands is okay.\n user->setOperands(operand);\n EXPECT_EQ(user->getNumOperands(), 1u);\n\n \/\/ Removing is okay.\n user->setOperands(llvm::None);\n EXPECT_EQ(user->getNumOperands(), 0u);\n\n \/\/ Adding more operands is okay.\n user->setOperands({operand, operand, operand});\n EXPECT_EQ(user->getNumOperands(), 3u);\n\n \/\/ Destroy the operations.\n user->destroy();\n useOp->destroy();\n}\n\n} \/\/ end namespace\n<|endoftext|>"} {"text":"<commit_before>#include \"stdafx.h\"\n#include \"Main.h\"\n\n#include \"Config.h\"\n#include \"PacketType.h\"\n\n#include \"Exception.h\"\n#include \"ClientSession.h\"\n#include \"ClientManager.h\"\n#include \"DatabaseJobManager.h\"\n#include \"DbHelper.h\"\n\n#include \"GameMap.h\"\n#include \"PlayerManager.h\"\n#include \"GameManager.h\"\n#include \"BulletManager.h\"\n#include \"SkillManager.h\"\n#pragma comment(lib,\"ws2_32.lib\")\n\n\n\nSOCKET g_AcceptedSocket = NULL ;\n\n__declspec(thread) int LThreadType = -1 ;\n\n\nint _tmain(int argc, _TCHAR* argv[])\n{\n#ifdef _DEBUG\n\t_CrtSetDbgFlag(_CRTDBG_ALLOC_MEM_DF|_CRTDBG_LEAK_CHECK_DF);\n\t\/\/_CrtSetBreakAlloc( 155 );\n#endif\n\n\t\/\/\/ crash ߻ dump ؼ\n\tSetUnhandledExceptionFilter(ExceptionFilter) ;\n\n\tLThreadType = THREAD_MAIN ;\n\n\t\/\/\/ Manager Init\n\tGClientManager = new ClientManager ;\n\tGDatabaseJobManager = new DatabaseJobManager ;\n\tGPlayerManager = new PlayerManager;\n\tGGameMap = new GameMap(L\"map\/gamemap.csm\");\n\tGGameManager = new GameManager(10);\n\tGBulletManager = new BulletManager();\n\tGSkillManager = new SkillManager();\n\n\t\/\/\/ DB Helper ʱȭ\n\tif ( false == DbHelper::Initialize(DB_CONN_STR) )\n\t\treturn -1 ;\n\n\t\/\/\/ ʱȭ\n\tWSADATA wsa ;\n\tif (WSAStartup(MAKEWORD(2,2), &wsa) != 0)\n\t\treturn -1 ;\n\n\tSOCKET listenSocket = socket(AF_INET, SOCK_STREAM, 0) ;\n\tif (listenSocket == INVALID_SOCKET)\n\t\treturn -1 ;\n\n\tint opt = 1 ;\n\t::setsockopt(listenSocket, SOL_SOCKET, SO_REUSEADDR, (const char*)&opt, sizeof(int) ) ;\n\n\t\/\/\/ bind\n\tSOCKADDR_IN serveraddr ;\n\tZeroMemory(&serveraddr, sizeof(serveraddr)) ;\n\tserveraddr.sin_family = AF_INET ;\n\tserveraddr.sin_port = htons(LISTEN_PORT) ;\n\tserveraddr.sin_addr.s_addr = htonl(INADDR_ANY) ;\n\tint ret = bind(listenSocket, (SOCKADDR*)&serveraddr, sizeof(serveraddr)) ;\n\tif (ret == SOCKET_ERROR)\n\t\treturn -1 ;\n\t\n\t\/\/\/ listen\n\tret = listen(listenSocket, SOMAXCONN) ;\n\tif (ret == SOCKET_ERROR)\n\t\treturn -1 ;\n\n\t\/\/\/ auto-reset event\n\tHANDLE hEvent = CreateEvent(NULL, FALSE, FALSE, NULL) ;\n\tif (hEvent == NULL)\n\t\treturn -1 ;\n\n\t\/\/\/ I\/O Thread\n\tDWORD dwThreadId ;\n\tHANDLE hThread = (HANDLE)_beginthreadex (NULL, 0, ClientHandlingThread, hEvent, 0, (unsigned int*)&dwThreadId) ;\n if (hThread == NULL)\n\t\treturn -1 ;\n\n\n\t\/\/\/ DB Thread\n\tHANDLE hDbThread = (HANDLE)_beginthreadex (NULL, 0, DatabaseHandlingThread, NULL, 0, (unsigned int*)&dwThreadId) ;\n\tif (hDbThread == NULL)\n\t\treturn -1 ;\n\n\t\/\/\/ accept loop\n\twhile ( true )\n\t{\n\t\tg_AcceptedSocket = accept(listenSocket, NULL, NULL) ;\n\t\tif ( g_AcceptedSocket == INVALID_SOCKET )\n\t\t{\n\t\t\tprintf(\"accept: invalid socket\\n\") ;\n\t\t\tcontinue ;\n\t\t}\/*\n\t\tSOCKADDR_IN clientaddr ;\n\t\tint addrlen = sizeof(clientaddr) ;\n\t\tgetpeername(g_AcceptedSocket, (SOCKADDR*)&clientaddr, &addrlen) ;\n\t\tif( ntohs(clientaddr.sin_port) > 50000)\n\t\t{\n\t\t\tprintf(\"port : %d is wrong!\\n\",clientaddr.sin_port);\n\t\t\tcontinue;\n\t\t}*\/\n\t\t\/\/\/ accept event fire!\n\t\tif ( !SetEvent(hEvent) )\n\t\t{\n\t\t\tprintf(\"SetEvent error: %d\\n\",GetLastError()) ;\n\t\t\tbreak ;\n\t\t}\n\t}\n\n\tCloseHandle( hThread ) ;\n\tCloseHandle( hEvent ) ;\n\tCloseHandle( hDbThread ) ;\n\n\t\/\/ \n\tWSACleanup() ;\n\n\tDbHelper::Finalize() ;\n\n\tdelete GClientManager ;\n\tdelete GDatabaseJobManager ;\n\treturn 0 ;\n}\n\nunsigned int WINAPI ClientHandlingThread( LPVOID lpParam )\n{\n\tLThreadType = THREAD_CLIENT ;\n\n\tHANDLE hEvent = (HANDLE)lpParam ;\n\n\t\/\/\/ Timer\n\tHANDLE hTimer = CreateWaitableTimer(NULL, FALSE, NULL) ;\n\tif (hTimer == NULL)\n\t\treturn -1 ;\n\n\tLARGE_INTEGER liDueTime ;\n\tliDueTime.QuadPart = -10000000 ; \/\/\/< 1 ĺ \n\tif ( !SetWaitableTimer(hTimer, &liDueTime, 1, TimerProc, NULL, TRUE) )\n\t\treturn -1 ;\n\t\t\n\n\twhile ( true )\n\t{\n\t\t\/\/\/ accept or IO\/Timer completion \n\t\tDWORD result = WaitForSingleObjectEx(hEvent, INFINITE, TRUE) ;\n\n\t\t\/\/\/ client connected\n\t\tif ( result == WAIT_OBJECT_0 )\n\t\t{\n\t\n\t\t\t\/\/\/ ü Ҵ ʱȭ\n\t\t\t\n\t\t\tClientSession* client = GClientManager->CreateClient(g_AcceptedSocket) ;\n\t\t\t\n\t\t\tSOCKADDR_IN clientaddr ;\n\t\t\tint addrlen = sizeof(clientaddr) ;\n\t\t\tgetpeername(g_AcceptedSocket, (SOCKADDR*)&clientaddr, &addrlen) ;\n\n\t\t\t\/\/ Ŭ ó\n\t\t\tif ( false == client->OnConnect(&clientaddr) )\n\t\t\t{\n\t\t\t\tclient->Disconnect() ;\n\t\t\t}\n\t\t\n\t\t\tcontinue ; \/\/\/< ٽ \n\t\t}\n\n\t\t\/\/ APC ִ completion ƴ϶ \n\t\tif ( result != WAIT_IO_COMPLETION )\n\t\t\treturn -1 ;\n\t}\n\n\tCloseHandle( hTimer ) ;\n\treturn 0;\n} \n\nunsigned int WINAPI DatabaseHandlingThread( LPVOID lpParam )\n{\n\tLThreadType = THREAD_DATABASE ;\n\n\twhile ( true )\n\t{\n\t\t\/\/\/ ⺻ polling ϸ鼭 Job ִٸ ó ϴ \n\t\tGDatabaseJobManager->ExecuteDatabaseJobs() ;\n\n\t\tSleep(1) ;\n\t}\n\n\treturn 0 ;\n}\n\nvoid CALLBACK TimerProc(LPVOID lpArg, DWORD dwTimerLowValue, DWORD dwTimerHighValue)\n{\n\tassert( LThreadType == THREAD_CLIENT ) ;\n\n\tGClientManager->OnPeriodWork() ;\n}\n<commit_msg>* Fixed MemoryLeak<commit_after>#include \"stdafx.h\"\n#include \"Main.h\"\n\n#include \"Config.h\"\n#include \"PacketType.h\"\n\n#include \"Exception.h\"\n#include \"ClientSession.h\"\n#include \"ClientManager.h\"\n#include \"DatabaseJobManager.h\"\n#include \"DbHelper.h\"\n\n#include \"GameMap.h\"\n#include \"PlayerManager.h\"\n#include \"GameManager.h\"\n#include \"BulletManager.h\"\n#include \"SkillManager.h\"\n#pragma comment(lib,\"ws2_32.lib\")\n\n\n\nSOCKET g_AcceptedSocket = NULL ;\n\n__declspec(thread) int LThreadType = -1 ;\n\n\nint _tmain(int argc, _TCHAR* argv[])\n{\n#ifdef _DEBUG\n\t_CrtSetDbgFlag(_CRTDBG_ALLOC_MEM_DF|_CRTDBG_LEAK_CHECK_DF);\n\t\/\/_CrtSetBreakAlloc( 3651 );\n#endif\n\n\t\/\/\/ crash ߻ dump ؼ\n\tSetUnhandledExceptionFilter(ExceptionFilter) ;\n\n\tLThreadType = THREAD_MAIN ;\n\n\t\/\/\/ Manager Init\n\tGClientManager = new ClientManager ;\n\tGDatabaseJobManager = new DatabaseJobManager ;\n\tGPlayerManager = new PlayerManager;\n\tGGameMap = new GameMap(L\"map\/gamemap.csm\");\n\tGGameManager = new GameManager(10);\n\tGBulletManager = new BulletManager();\n\tGSkillManager = new SkillManager();\n\n\t\/\/\/ DB Helper ʱȭ\n\tif ( false == DbHelper::Initialize(DB_CONN_STR) )\n\t\treturn -1 ;\n\n\t\/\/\/ ʱȭ\n\tWSADATA wsa ;\n\tif (WSAStartup(MAKEWORD(2,2), &wsa) != 0)\n\t\treturn -1 ;\n\n\tSOCKET listenSocket = socket(AF_INET, SOCK_STREAM, 0) ;\n\tif (listenSocket == INVALID_SOCKET)\n\t\treturn -1 ;\n\n\tint opt = 1 ;\n\t::setsockopt(listenSocket, SOL_SOCKET, SO_REUSEADDR, (const char*)&opt, sizeof(int) ) ;\n\n\t\/\/\/ bind\n\tSOCKADDR_IN serveraddr ;\n\tZeroMemory(&serveraddr, sizeof(serveraddr)) ;\n\tserveraddr.sin_family = AF_INET ;\n\tserveraddr.sin_port = htons(LISTEN_PORT) ;\n\tserveraddr.sin_addr.s_addr = htonl(INADDR_ANY) ;\n\tint ret = bind(listenSocket, (SOCKADDR*)&serveraddr, sizeof(serveraddr)) ;\n\tif (ret == SOCKET_ERROR)\n\t\treturn -1 ;\n\t\n\t\/\/\/ listen\n\tret = listen(listenSocket, SOMAXCONN) ;\n\tif (ret == SOCKET_ERROR)\n\t\treturn -1 ;\n\n\t\/\/\/ auto-reset event\n\tHANDLE hEvent = CreateEvent(NULL, FALSE, FALSE, NULL) ;\n\tif (hEvent == NULL)\n\t\treturn -1 ;\n\n\t\/\/\/ I\/O Thread\n\tDWORD dwThreadId ;\n\tHANDLE hThread = (HANDLE)_beginthreadex (NULL, 0, ClientHandlingThread, hEvent, 0, (unsigned int*)&dwThreadId) ;\n if (hThread == NULL)\n\t\treturn -1 ;\n\n\n\t\/\/\/ DB Thread\n\tHANDLE hDbThread = (HANDLE)_beginthreadex (NULL, 0, DatabaseHandlingThread, NULL, 0, (unsigned int*)&dwThreadId) ;\n\tif (hDbThread == NULL)\n\t\treturn -1 ;\n\n\t\/\/\/ accept loop\n\twhile ( true )\n\t{\n\t\tg_AcceptedSocket = accept(listenSocket, NULL, NULL) ;\n\t\tif ( g_AcceptedSocket == INVALID_SOCKET )\n\t\t{\n\t\t\tprintf(\"accept: invalid socket\\n\") ;\n\t\t\tcontinue ;\n\t\t}\/*\n\t\tSOCKADDR_IN clientaddr ;\n\t\tint addrlen = sizeof(clientaddr) ;\n\t\tgetpeername(g_AcceptedSocket, (SOCKADDR*)&clientaddr, &addrlen) ;\n\t\tif( ntohs(clientaddr.sin_port) > 50000)\n\t\t{\n\t\t\tprintf(\"port : %d is wrong!\\n\",clientaddr.sin_port);\n\t\t\tcontinue;\n\t\t}*\/\n\t\t\/\/\/ accept event fire!\n\t\tif ( !SetEvent(hEvent) )\n\t\t{\n\t\t\tprintf(\"SetEvent error: %d\\n\",GetLastError()) ;\n\t\t\tbreak ;\n\t\t}\n\t}\n\n\tCloseHandle( hThread ) ;\n\tCloseHandle( hEvent ) ;\n\tCloseHandle( hDbThread ) ;\n\n\t\/\/ \n\tWSACleanup() ;\n\n\tdelete GGameMap;\n\tdelete GGameManager;\n\tdelete GPlayerManager;\n\tdelete GBulletManager;\n\tdelete GSkillManager;\n\n\tdelete GResourceManager;\n\n\tDbHelper::Finalize() ;\n\n\tdelete GClientManager ;\n\tdelete GDatabaseJobManager ;\n\n\treturn 0 ;\n}\n\nunsigned int WINAPI ClientHandlingThread( LPVOID lpParam )\n{\n\tLThreadType = THREAD_CLIENT ;\n\n\tHANDLE hEvent = (HANDLE)lpParam ;\n\n\t\/\/\/ Timer\n\tHANDLE hTimer = CreateWaitableTimer(NULL, FALSE, NULL) ;\n\tif (hTimer == NULL)\n\t\treturn -1 ;\n\n\tLARGE_INTEGER liDueTime ;\n\tliDueTime.QuadPart = -10000000 ; \/\/\/< 1 ĺ \n\tif ( !SetWaitableTimer(hTimer, &liDueTime, 1, TimerProc, NULL, TRUE) )\n\t\treturn -1 ;\n\t\t\n\n\twhile ( true )\n\t{\n\t\t\/\/\/ accept or IO\/Timer completion \n\t\tDWORD result = WaitForSingleObjectEx(hEvent, INFINITE, TRUE) ;\n\n\t\t\/\/\/ client connected\n\t\tif ( result == WAIT_OBJECT_0 )\n\t\t{\n\t\n\t\t\t\/\/\/ ü Ҵ ʱȭ\n\t\t\t\n\t\t\tClientSession* client = GClientManager->CreateClient(g_AcceptedSocket) ;\n\t\t\t\n\t\t\tSOCKADDR_IN clientaddr ;\n\t\t\tint addrlen = sizeof(clientaddr) ;\n\t\t\tgetpeername(g_AcceptedSocket, (SOCKADDR*)&clientaddr, &addrlen) ;\n\n\t\t\t\/\/ Ŭ ó\n\t\t\tif ( false == client->OnConnect(&clientaddr) )\n\t\t\t{\n\t\t\t\tclient->Disconnect() ;\n\t\t\t}\n\t\t\n\t\t\tcontinue ; \/\/\/< ٽ \n\t\t}\n\n\t\t\/\/ APC ִ completion ƴ϶ \n\t\tif ( result != WAIT_IO_COMPLETION )\n\t\t\treturn -1 ;\n\t}\n\n\tCloseHandle( hTimer ) ;\n\treturn 0;\n} \n\nunsigned int WINAPI DatabaseHandlingThread( LPVOID lpParam )\n{\n\tLThreadType = THREAD_DATABASE ;\n\n\twhile ( true )\n\t{\n\t\t\/\/\/ ⺻ polling ϸ鼭 Job ִٸ ó ϴ \n\t\tGDatabaseJobManager->ExecuteDatabaseJobs() ;\n\n\t\tSleep(1) ;\n\t}\n\n\treturn 0 ;\n}\n\nvoid CALLBACK TimerProc(LPVOID lpArg, DWORD dwTimerLowValue, DWORD dwTimerHighValue)\n{\n\tassert( LThreadType == THREAD_CLIENT ) ;\n\n\tGClientManager->OnPeriodWork() ;\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) 2012 Dan Vratil <dvratil@redhat.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 \"qmloutput.h\"\n#include <kscreen\/output.h>\n#include <KDebug>\n\n#include <QStandardItem>\n#include <QStandardItemModel>\n#include <QStringBuilder>\n\nQ_DECLARE_METATYPE(KScreen::Mode*);\n\nQMLOutput::QMLOutput():\n QDeclarativeItem(),\n m_output(0),\n m_cloneOf(0),\n m_modesModel(new QStandardItemModel(this))\n{\n\n}\n\nQMLOutput::~QMLOutput()\n{\n\n}\n\nvoid QMLOutput::setOutput(KScreen::Output* output)\n{\n m_output = output;\n\n QList<KScreen::Mode*> modes = m_output->modes().values();\n Q_FOREACH (KScreen::Mode *mode, modes) {\n\tQList<QStandardItem*> items = m_modesModel->findItems(mode->name(), Qt::MatchExactly, 0);\n\tif (items.isEmpty()) {\n\t QStandardItem *item = new QStandardItem(mode->name());\n\t item->setData(mode->size(), QMLOutput::SizeRole);\n\n\t m_modesModel->appendRow(item);\n\t items << item;\n\n\t kDebug() << \"Added size \" << mode->name();\n\t}\n\n\tQStandardItem *modeItem = new QStandardItem(QString::number(mode->refreshRate(), 'f', 1) % QLatin1String(\"Hz\"));\n\tmodeItem->setData(mode->refreshRate(), QMLOutput::RefreshRateRole);\n\tmodeItem->setData(mode->id(), QMLOutput::ModeIdRole);\n\tmodeItem->setData(QVariant::fromValue(mode), QMLOutput::ModeRole);\n\n\tkDebug() << \"Added mode\" << mode->refreshRate() << \"to\" << mode->name();\n\n\tQStandardItem *item = items.first();\n\titem->appendRow(modeItem);\n }\n\n connect(output, SIGNAL(clonesChanged()), SIGNAL(changed()));\n connect(output, SIGNAL(currentModeChanged()), SIGNAL(changed()));\n connect(output, SIGNAL(isEnabledChanged()), SIGNAL(changed()));\n connect(output, SIGNAL(isPrimaryChanged()), SIGNAL(changed()));\n connect(output, SIGNAL(outputChanged()), SIGNAL(changed()));\n connect(output, SIGNAL(posChanged()), SIGNAL(changed()));\n connect(output, SIGNAL(rotationChanged()), SIGNAL(changed()));\n\n Q_EMIT outputChanged();\n}\n\nKScreen::Output* QMLOutput::output() const\n{\n return m_output;\n}\n\nvoid QMLOutput::setCloneOf(QMLOutput* other)\n{\n m_cloneOf = other;\n\n Q_EMIT cloneOfChanged();\n}\n\nQMLOutput* QMLOutput::cloneOf() const\n{\n return m_cloneOf;\n}\n\nQAbstractItemModel* QMLOutput::modesModel()\n{\n return m_modesModel;\n}\n<commit_msg>Remove annoying debug messages<commit_after>\/*\n <one line to give the library's name and an idea of what it does.>\n Copyright (C) 2012 Dan Vratil <dvratil@redhat.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 \"qmloutput.h\"\n#include <kscreen\/output.h>\n#include <KDebug>\n\n#include <QStandardItem>\n#include <QStandardItemModel>\n#include <QStringBuilder>\n\nQ_DECLARE_METATYPE(KScreen::Mode*);\n\nQMLOutput::QMLOutput():\n QDeclarativeItem(),\n m_output(0),\n m_cloneOf(0),\n m_modesModel(new QStandardItemModel(this))\n{\n\n}\n\nQMLOutput::~QMLOutput()\n{\n\n}\n\nvoid QMLOutput::setOutput(KScreen::Output* output)\n{\n m_output = output;\n\n QList<KScreen::Mode*> modes = m_output->modes().values();\n Q_FOREACH (KScreen::Mode *mode, modes) {\n\tQList<QStandardItem*> items = m_modesModel->findItems(mode->name(), Qt::MatchExactly, 0);\n\tif (items.isEmpty()) {\n\t QStandardItem *item = new QStandardItem(mode->name());\n\t item->setData(mode->size(), QMLOutput::SizeRole);\n\n\t m_modesModel->appendRow(item);\n\t items << item;\n\t}\n\n\tQStandardItem *modeItem = new QStandardItem(QString::number(mode->refreshRate(), 'f', 1) % QLatin1String(\"Hz\"));\n\tmodeItem->setData(mode->refreshRate(), QMLOutput::RefreshRateRole);\n\tmodeItem->setData(mode->id(), QMLOutput::ModeIdRole);\n\tmodeItem->setData(QVariant::fromValue(mode), QMLOutput::ModeRole);\n\n\tQStandardItem *item = items.first();\n\titem->appendRow(modeItem);\n }\n\n connect(output, SIGNAL(clonesChanged()), SIGNAL(changed()));\n connect(output, SIGNAL(currentModeChanged()), SIGNAL(changed()));\n connect(output, SIGNAL(isEnabledChanged()), SIGNAL(changed()));\n connect(output, SIGNAL(isPrimaryChanged()), SIGNAL(changed()));\n connect(output, SIGNAL(outputChanged()), SIGNAL(changed()));\n connect(output, SIGNAL(posChanged()), SIGNAL(changed()));\n connect(output, SIGNAL(rotationChanged()), SIGNAL(changed()));\n\n Q_EMIT outputChanged();\n}\n\nKScreen::Output* QMLOutput::output() const\n{\n return m_output;\n}\n\nvoid QMLOutput::setCloneOf(QMLOutput* other)\n{\n m_cloneOf = other;\n\n Q_EMIT cloneOfChanged();\n}\n\nQMLOutput* QMLOutput::cloneOf() const\n{\n return m_cloneOf;\n}\n\nQAbstractItemModel* QMLOutput::modesModel()\n{\n return m_modesModel;\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\/\/ main window and event handling for X11\n\n#include <ode\/config.h>\n#include <stdlib.h>\n#include <string.h>\n#include <stdarg.h>\n#include <X11\/Xlib.h>\n#include <X11\/Xatom.h>\n#include <X11\/keysym.h>\n#include <GL\/glx.h>\n\n#include <drawstuff\/drawstuff.h>\n#include <drawstuff\/version.h>\n#include \"internal.h\"\n\n\/\/***************************************************************************\n\/\/ error handling for unix\n\nstatic void printMessage (char *msg1, char *msg2, va_list ap)\n{\n fflush (stderr);\n fflush (stdout);\n fprintf (stderr,\"\\n%s: \",msg1);\n vfprintf (stderr,msg2,ap);\n fprintf (stderr,\"\\n\");\n fflush (stderr);\n}\n\n\nextern \"C\" void dsError (char *msg, ...)\n{\n va_list ap;\n va_start (ap,msg);\n printMessage (\"Error\",msg,ap);\n exit (1);\n}\n\n\nextern \"C\" void dsDebug (char *msg, ...)\n{\n va_list ap;\n va_start (ap,msg);\n printMessage (\"INTERNAL ERROR\",msg,ap);\n \/\/ *((char *)0) = 0;\t ... commit SEGVicide ?\n abort();\n}\n\n\nextern \"C\" void dsPrint (char *msg, ...)\n{\n va_list ap;\n va_start (ap,msg);\n vprintf (msg,ap);\n}\n\n\/\/***************************************************************************\n\/\/ openGL window\n\n\/\/ X11 display info\nstatic Display *display=0;\nstatic int screen=0;\nstatic XVisualInfo *visual=0;\t\t\/\/ best visual for openGL\nstatic Colormap colormap=0;\t\t\/\/ window's colormap\nstatic Atom wm_protocols_atom = 0;\nstatic Atom wm_delete_window_atom = 0;\n\n\/\/ window and openGL\nstatic Window win=0;\t\t\t\/\/ X11 window, 0 if not initialized\nstatic int width=0,height=0;\t\t\/\/ window size\nstatic GLXContext glx_context=0;\t\/\/ openGL rendering context\nstatic int last_key_pressed=0;\t\t\/\/ last key pressed in the window\nstatic int run=1;\t\t\t\/\/ 1 if simulation running\nstatic int pause=0;\t\t\t\/\/ 1 if in `pause' mode\nstatic int singlestep=0;\t\t\/\/ 1 if single step key pressed\nstatic int writeframes=0;\t\t\/\/ 1 if frame files to be written\n\n\nstatic void createMainWindow (int _width, int _height)\n{\n \/\/ create X11 display connection\n display = XOpenDisplay (0);\n if (!display) dsError (0,\"can not open X11 display\");\n screen = DefaultScreen(display);\n\n \/\/ get GL visual\n static int attribList[] = {GLX_RGBA, GLX_DOUBLEBUFFER, GLX_DEPTH_SIZE,16,\n\t\t\t GLX_RED_SIZE,4, GLX_GREEN_SIZE,4,\n\t\t\t GLX_BLUE_SIZE,4, None};\n visual = glXChooseVisual (display,screen,attribList);\n if (!visual) dsError (\"no good X11 visual found for OpenGL\");\n\n \/\/ create colormap\n colormap = XCreateColormap (display,RootWindow(display,screen),\n\t\t\t visual->visual,AllocNone);\n\n \/\/ initialize variables\n win = 0;\n width = _width;\n height = _height;\n glx_context = 0;\n last_key_pressed = 0;\n\n if (width < 1 || height < 1) dsDebug (0,\"bad window width or height\");\n\n \/\/ create the window\n XSetWindowAttributes attributes;\n attributes.background_pixel = BlackPixel(display,screen);\n attributes.colormap = colormap;\n attributes.event_mask = ButtonPressMask | ButtonReleaseMask |\n KeyPressMask | KeyReleaseMask | ButtonMotionMask | PointerMotionHintMask |\n StructureNotifyMask;\n win = XCreateWindow (display,RootWindow(display,screen),50,50,width,height,\n\t\t 0,visual->depth, InputOutput,visual->visual,\n\t\t CWBackPixel | CWColormap | CWEventMask,&attributes);\n\n \/\/ associate a GLX context with the window\n glx_context = glXCreateContext (display,visual,0,GL_TRUE);\n if (!glx_context) dsError (\"can't make an OpenGL context\");\n\n \/\/ set the window title\n XTextProperty window_name;\n window_name.value = (unsigned char *) \"Simulation\";\n window_name.encoding = XA_STRING;\n window_name.format = 8;\n window_name.nitems = strlen((char *) window_name.value);\n XSetWMName (display,win,&window_name);\n\n \/\/ participate in the window manager 'delete yourself' protocol\n wm_protocols_atom = XInternAtom (display,\"WM_PROTOCOLS\",False);\n wm_delete_window_atom = XInternAtom (display,\"WM_DELETE_WINDOW\",False);\n if (XSetWMProtocols (display,win,&wm_delete_window_atom,1)==0)\n dsError (\"XSetWMProtocols() call failed\");\n\n \/\/ pop up the window\n XMapWindow (display,win);\n XSync (display,win);\n}\n\n\nstatic void destroyMainWindow()\n{\n glXDestroyContext (display,glx_context);\n XDestroyWindow (display,win);\n XSync (display,0);\n display = 0;\n win = 0;\n glx_context = 0;\n}\n\n\nstatic void handleEvent (XEvent &event, dsFunctions *fn)\n{\n static int mx=0,my=0; \t\/\/ mouse position\n static int mode = 0;\t\t\/\/ mouse button bits\n\n switch (event.type) {\n\n case ButtonPress: {\n if (event.xbutton.button == Button1) mode |= 1;\n if (event.xbutton.button == Button2) mode |= 2;\n if (event.xbutton.button == Button3) mode |= 4;\n mx = event.xbutton.x;\n my = event.xbutton.y;\n }\n return;\n\n case ButtonRelease: {\n if (event.xbutton.button == Button1) mode &= (~1);\n if (event.xbutton.button == Button2) mode &= (~2);\n if (event.xbutton.button == Button3) mode &= (~4);\n mx = event.xbutton.x;\n my = event.xbutton.x;\n }\n return;\n\n case MotionNotify: {\n if (event.xmotion.is_hint) {\n Window root,child;\n unsigned int mask;\n XQueryPointer (display,win,&root,&child,&event.xbutton.x_root,\n\t\t &event.xbutton.y_root,&event.xbutton.x,&event.xbutton.y,\n\t\t &mask);\n }\n dsMotion (mode, event.xmotion.x - mx, event.xmotion.y - my);\n mx = event.xmotion.x;\n my = event.xmotion.y;\n }\n return;\n\n case KeyPress: {\n KeySym key;\n XLookupString (&event.xkey,NULL,0,&key,0);\n if ((event.xkey.state & ControlMask) == 0) {\n if (key >= ' ' && key <= 126 && fn->command) fn->command (key);\n }\n else if (event.xkey.state & ControlMask) {\n switch (key) {\n case 't': case 'T':\n\tdsSetTextures (dsGetTextures() ^ 1);\n\tbreak;\n case 's': case 'S':\n\tdsSetShadows (dsGetShadows() ^ 1);\n\tbreak;\n case 'x': case 'X':\n\trun = 0;\n\tbreak;\n case 'p': case 'P':\n\tpause ^= 1;\n\tsinglestep = 0;\n\tbreak;\n case 'o': case 'O':\n\tif (pause) singlestep = 1;\n\tbreak;\n case 'v': case 'V': {\n\tfloat xyz[3],hpr[3];\n\tdsGetViewpoint (xyz,hpr);\n\tprintf (\"Viewpoint = (%.4f,%.4f,%.4f,%.4f,%.4f,%.4f)\\n\",\n\t\txyz[0],xyz[1],xyz[2],hpr[0],hpr[1],hpr[2]);\n\tbreak;\n }\n case 'w': case 'W':\n\twriteframes ^= 1;\n\tif (writeframes) printf (\"Now writing frames to PPM files\\n\");\n\tbreak;\n }\n }\n last_key_pressed = key;\t\t\/\/ a kludgy place to put this...\n }\n return;\n\n case KeyRelease: {\n \/\/ hmmmm...\n }\n return;\n\n case ClientMessage:\n if (event.xclient.message_type == wm_protocols_atom &&\n\tevent.xclient.format == 32 &&\n\tAtom(event.xclient.data.l[0]) == wm_delete_window_atom) {\n run = 0;\n return;\n }\n return;\n\n case ConfigureNotify:\n width = event.xconfigure.width;\n height = event.xconfigure.height;\n return;\n }\n}\n\n\n\/\/ return the index of the highest bit\nstatic int getHighBitIndex (unsigned int x)\n{\n int i = 0;\n while (x) {\n i++;\n x >>= 1;\n }\n return i-1;\n}\n\n\n\/\/ shift x left by i, where i can be positive or negative\n#define SHIFTL(x,i) (((i) >= 0) ? ((x) << (i)) : ((x) >> (-i)))\n\n\nstatic void captureFrame (int num)\n{\n fprintf (stderr,\"capturing frame %04d\\n\",num);\n\n char s[100];\n sprintf (s,\"frame\/frame%04d.ppm\",num);\n FILE *f = fopen (s,\"wb\");\n if (!f) dsError (\"can't open \\\"%s\\\" for writing\",s);\n fprintf (f,\"P6\\n%d %d\\n255\\n\",width,height);\n XImage *image = XGetImage (display,win,0,0,width,height,~0,ZPixmap);\n\n int rshift = 7 - getHighBitIndex (image->red_mask);\n int gshift = 7 - getHighBitIndex (image->green_mask);\n int bshift = 7 - getHighBitIndex (image->blue_mask);\n\n for (int y=0; y<height; y++) {\n for (int x=0; x<width; x++) {\n unsigned long pixel = XGetPixel (image,x,y);\n unsigned char b[3];\n b[0] = SHIFTL(pixel & image->red_mask,rshift);\n b[1] = SHIFTL(pixel & image->green_mask,gshift);\n b[2] = SHIFTL(pixel & image->blue_mask,bshift);\n fwrite (b,3,1,f);\n }\n }\n fclose (f);\n XDestroyImage (image);\n}\n\n\nvoid dsPlatformSimLoop (int window_width, int window_height, dsFunctions *fn,\n\t\t\tint initial_pause)\n{\n pause = initial_pause;\n createMainWindow (window_width, window_height);\n glXMakeCurrent (display,win,glx_context);\n\n dsStartGraphics (window_width,window_height,fn);\n\n fprintf (stderr,\n\t \"\\n\"\n\t \"Simulation test environment v%d.%02d\\n\"\n\t \" Ctrl-P : pause \/ unpause (or say `-pause' on command line).\\n\"\n\t \" Ctrl-O : single step when paused.\\n\"\n\t \" Ctrl-T : toggle textures (or say `-notex' on command line).\\n\"\n\t \" Ctrl-S : toggle shadows (or say `-noshadow' on command line).\\n\"\n\t \" Ctrl-V : print current viewpoint coordinates (x,y,z,h,p,r).\\n\"\n\t \" Ctrl-W : write frames to ppm files: frame\/frameNNN.ppm\\n\"\n\t \" Ctrl-X : exit.\\n\"\n\t \"\\n\"\n\t \"Change the camera position by clicking + dragging in the window.\\n\"\n\t \" Left button - pan and tilt.\\n\"\n\t \" Right button - forward and sideways.\\n\"\n\t \" Left + Right button (or middle button) - sideways and up.\\n\"\n\t \"\\n\",DS_VERSION >> 8,DS_VERSION & 0xff);\n\n if (fn->start) fn->start();\n\n int frame = 1;\n run = 1;\n while (run) {\n \/\/ read in and process all pending events for the main window\n XEvent event;\n while (run && XPending (display)) {\n XNextEvent (display,&event);\n handleEvent (event,fn);\n }\n\n dsDrawFrame (width,height,fn,pause && !singlestep);\n singlestep = 0;\n\n glFlush();\n glXSwapBuffers (display,win);\n XSync (display,0);\n\n \/\/ capture frames if necessary\n if (pause==0 && writeframes) {\n captureFrame (frame);\n frame++;\n }\n };\n\n if (fn->stop) fn->stop();\n dsStopGraphics();\n\n destroyMainWindow();\n}\n\n\nextern \"C\" void dsStop()\n{\n run = 0;\n}\n<commit_msg>fixes from d redgrave<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\/\/ main window and event handling for X11\n\n#include <ode\/config.h>\n#include <stdlib.h>\n#include <string.h>\n#include <stdarg.h>\n#include <X11\/Xlib.h>\n#include <X11\/Xatom.h>\n#include <X11\/keysym.h>\n#include <GL\/glx.h>\n\n#include <drawstuff\/drawstuff.h>\n#include <drawstuff\/version.h>\n#include \"internal.h\"\n\n\/\/***************************************************************************\n\/\/ error handling for unix\n\nstatic void printMessage (char *msg1, char *msg2, va_list ap)\n{\n fflush (stderr);\n fflush (stdout);\n fprintf (stderr,\"\\n%s: \",msg1);\n vfprintf (stderr,msg2,ap);\n fprintf (stderr,\"\\n\");\n fflush (stderr);\n}\n\n\nextern \"C\" void dsError (char *msg, ...)\n{\n va_list ap;\n va_start (ap,msg);\n printMessage (\"Error\",msg,ap);\n exit (1);\n}\n\n\nextern \"C\" void dsDebug (char *msg, ...)\n{\n va_list ap;\n va_start (ap,msg);\n printMessage (\"INTERNAL ERROR\",msg,ap);\n \/\/ *((char *)0) = 0;\t ... commit SEGVicide ?\n abort();\n}\n\n\nextern \"C\" void dsPrint (char *msg, ...)\n{\n va_list ap;\n va_start (ap,msg);\n vprintf (msg,ap);\n}\n\n\/\/***************************************************************************\n\/\/ openGL window\n\n\/\/ X11 display info\nstatic Display *display=0;\nstatic int screen=0;\nstatic XVisualInfo *visual=0;\t\t\/\/ best visual for openGL\nstatic Colormap colormap=0;\t\t\/\/ window's colormap\nstatic Atom wm_protocols_atom = 0;\nstatic Atom wm_delete_window_atom = 0;\n\n\/\/ window and openGL\nstatic Window win=0;\t\t\t\/\/ X11 window, 0 if not initialized\nstatic int width=0,height=0;\t\t\/\/ window size\nstatic GLXContext glx_context=0;\t\/\/ openGL rendering context\nstatic int last_key_pressed=0;\t\t\/\/ last key pressed in the window\nstatic int run=1;\t\t\t\/\/ 1 if simulation running\nstatic int pause=0;\t\t\t\/\/ 1 if in `pause' mode\nstatic int singlestep=0;\t\t\/\/ 1 if single step key pressed\nstatic int writeframes=0;\t\t\/\/ 1 if frame files to be written\n\n\nstatic void createMainWindow (int _width, int _height)\n{\n \/\/ create X11 display connection\n display = XOpenDisplay (NULL);\n if (!display) dsError (\"can not open X11 display\");\n screen = DefaultScreen(display);\n\n \/\/ get GL visual\n static int attribList[] = {GLX_RGBA, GLX_DOUBLEBUFFER, GLX_DEPTH_SIZE,16,\n\t\t\t GLX_RED_SIZE,4, GLX_GREEN_SIZE,4,\n\t\t\t GLX_BLUE_SIZE,4, None};\n visual = glXChooseVisual (display,screen,attribList);\n if (!visual) dsError (\"no good X11 visual found for OpenGL\");\n\n \/\/ create colormap\n colormap = XCreateColormap (display,RootWindow(display,screen),\n\t\t\t visual->visual,AllocNone);\n\n \/\/ initialize variables\n win = 0;\n width = _width;\n height = _height;\n glx_context = 0;\n last_key_pressed = 0;\n\n if (width < 1 || height < 1) dsDebug (0,\"bad window width or height\");\n\n \/\/ create the window\n XSetWindowAttributes attributes;\n attributes.background_pixel = BlackPixel(display,screen);\n attributes.colormap = colormap;\n attributes.event_mask = ButtonPressMask | ButtonReleaseMask |\n KeyPressMask | KeyReleaseMask | ButtonMotionMask | PointerMotionHintMask |\n StructureNotifyMask;\n win = XCreateWindow (display,RootWindow(display,screen),50,50,width,height,\n\t\t 0,visual->depth, InputOutput,visual->visual,\n\t\t CWBackPixel | CWColormap | CWEventMask,&attributes);\n\n \/\/ associate a GLX context with the window\n glx_context = glXCreateContext (display,visual,0,GL_TRUE);\n if (!glx_context) dsError (\"can't make an OpenGL context\");\n\n \/\/ set the window title\n XTextProperty window_name;\n window_name.value = (unsigned char *) \"Simulation\";\n window_name.encoding = XA_STRING;\n window_name.format = 8;\n window_name.nitems = strlen((char *) window_name.value);\n XSetWMName (display,win,&window_name);\n\n \/\/ participate in the window manager 'delete yourself' protocol\n wm_protocols_atom = XInternAtom (display,\"WM_PROTOCOLS\",False);\n wm_delete_window_atom = XInternAtom (display,\"WM_DELETE_WINDOW\",False);\n if (XSetWMProtocols (display,win,&wm_delete_window_atom,1)==0)\n dsError (\"XSetWMProtocols() call failed\");\n\n \/\/ pop up the window\n XMapWindow (display,win);\n XSync (display,win);\n}\n\n\nstatic void destroyMainWindow()\n{\n glXDestroyContext (display,glx_context);\n XDestroyWindow (display,win);\n XSync (display,0);\n display = 0;\n win = 0;\n glx_context = 0;\n}\n\n\nstatic void handleEvent (XEvent &event, dsFunctions *fn)\n{\n static int mx=0,my=0; \t\/\/ mouse position\n static int mode = 0;\t\t\/\/ mouse button bits\n\n switch (event.type) {\n\n case ButtonPress: {\n if (event.xbutton.button == Button1) mode |= 1;\n if (event.xbutton.button == Button2) mode |= 2;\n if (event.xbutton.button == Button3) mode |= 4;\n mx = event.xbutton.x;\n my = event.xbutton.y;\n }\n return;\n\n case ButtonRelease: {\n if (event.xbutton.button == Button1) mode &= (~1);\n if (event.xbutton.button == Button2) mode &= (~2);\n if (event.xbutton.button == Button3) mode &= (~4);\n mx = event.xbutton.x;\n my = event.xbutton.x;\n }\n return;\n\n case MotionNotify: {\n if (event.xmotion.is_hint) {\n Window root,child;\n unsigned int mask;\n XQueryPointer (display,win,&root,&child,&event.xbutton.x_root,\n\t\t &event.xbutton.y_root,&event.xbutton.x,&event.xbutton.y,\n\t\t &mask);\n }\n dsMotion (mode, event.xmotion.x - mx, event.xmotion.y - my);\n mx = event.xmotion.x;\n my = event.xmotion.y;\n }\n return;\n\n case KeyPress: {\n KeySym key;\n XLookupString (&event.xkey,NULL,0,&key,0);\n if ((event.xkey.state & ControlMask) == 0) {\n if (key >= ' ' && key <= 126 && fn->command) fn->command (key);\n }\n else if (event.xkey.state & ControlMask) {\n switch (key) {\n case 't': case 'T':\n\tdsSetTextures (dsGetTextures() ^ 1);\n\tbreak;\n case 's': case 'S':\n\tdsSetShadows (dsGetShadows() ^ 1);\n\tbreak;\n case 'x': case 'X':\n\trun = 0;\n\tbreak;\n case 'p': case 'P':\n\tpause ^= 1;\n\tsinglestep = 0;\n\tbreak;\n case 'o': case 'O':\n\tif (pause) singlestep = 1;\n\tbreak;\n case 'v': case 'V': {\n\tfloat xyz[3],hpr[3];\n\tdsGetViewpoint (xyz,hpr);\n\tprintf (\"Viewpoint = (%.4f,%.4f,%.4f,%.4f,%.4f,%.4f)\\n\",\n\t\txyz[0],xyz[1],xyz[2],hpr[0],hpr[1],hpr[2]);\n\tbreak;\n }\n case 'w': case 'W':\n\twriteframes ^= 1;\n\tif (writeframes) printf (\"Now writing frames to PPM files\\n\");\n\tbreak;\n }\n }\n last_key_pressed = key;\t\t\/\/ a kludgy place to put this...\n }\n return;\n\n case KeyRelease: {\n \/\/ hmmmm...\n }\n return;\n\n case ClientMessage:\n if (event.xclient.message_type == wm_protocols_atom &&\n\tevent.xclient.format == 32 &&\n\tAtom(event.xclient.data.l[0]) == wm_delete_window_atom) {\n run = 0;\n return;\n }\n return;\n\n case ConfigureNotify:\n width = event.xconfigure.width;\n height = event.xconfigure.height;\n return;\n }\n}\n\n\n\/\/ return the index of the highest bit\nstatic int getHighBitIndex (unsigned int x)\n{\n int i = 0;\n while (x) {\n i++;\n x >>= 1;\n }\n return i-1;\n}\n\n\n\/\/ shift x left by i, where i can be positive or negative\n#define SHIFTL(x,i) (((i) >= 0) ? ((x) << (i)) : ((x) >> (-i)))\n\n\nstatic void captureFrame (int num)\n{\n fprintf (stderr,\"capturing frame %04d\\n\",num);\n\n char s[100];\n sprintf (s,\"frame\/frame%04d.ppm\",num);\n FILE *f = fopen (s,\"wb\");\n if (!f) dsError (\"can't open \\\"%s\\\" for writing\",s);\n fprintf (f,\"P6\\n%d %d\\n255\\n\",width,height);\n XImage *image = XGetImage (display,win,0,0,width,height,~0,ZPixmap);\n\n int rshift = 7 - getHighBitIndex (image->red_mask);\n int gshift = 7 - getHighBitIndex (image->green_mask);\n int bshift = 7 - getHighBitIndex (image->blue_mask);\n\n for (int y=0; y<height; y++) {\n for (int x=0; x<width; x++) {\n unsigned long pixel = XGetPixel (image,x,y);\n unsigned char b[3];\n b[0] = SHIFTL(pixel & image->red_mask,rshift);\n b[1] = SHIFTL(pixel & image->green_mask,gshift);\n b[2] = SHIFTL(pixel & image->blue_mask,bshift);\n fwrite (b,3,1,f);\n }\n }\n fclose (f);\n XDestroyImage (image);\n}\n\n\nvoid dsPlatformSimLoop (int window_width, int window_height, dsFunctions *fn,\n\t\t\tint initial_pause)\n{\n pause = initial_pause;\n createMainWindow (window_width, window_height);\n glXMakeCurrent (display,win,glx_context);\n\n dsStartGraphics (window_width,window_height,fn);\n\n fprintf (stderr,\n\t \"\\n\"\n\t \"Simulation test environment v%d.%02d\\n\"\n\t \" Ctrl-P : pause \/ unpause (or say `-pause' on command line).\\n\"\n\t \" Ctrl-O : single step when paused.\\n\"\n\t \" Ctrl-T : toggle textures (or say `-notex' on command line).\\n\"\n\t \" Ctrl-S : toggle shadows (or say `-noshadow' on command line).\\n\"\n\t \" Ctrl-V : print current viewpoint coordinates (x,y,z,h,p,r).\\n\"\n\t \" Ctrl-W : write frames to ppm files: frame\/frameNNN.ppm\\n\"\n\t \" Ctrl-X : exit.\\n\"\n\t \"\\n\"\n\t \"Change the camera position by clicking + dragging in the window.\\n\"\n\t \" Left button - pan and tilt.\\n\"\n\t \" Right button - forward and sideways.\\n\"\n\t \" Left + Right button (or middle button) - sideways and up.\\n\"\n\t \"\\n\",DS_VERSION >> 8,DS_VERSION & 0xff);\n\n if (fn->start) fn->start();\n\n int frame = 1;\n run = 1;\n while (run) {\n \/\/ read in and process all pending events for the main window\n XEvent event;\n while (run && XPending (display)) {\n XNextEvent (display,&event);\n handleEvent (event,fn);\n }\n\n dsDrawFrame (width,height,fn,pause && !singlestep);\n singlestep = 0;\n\n glFlush();\n glXSwapBuffers (display,win);\n XSync (display,0);\n\n \/\/ capture frames if necessary\n if (pause==0 && writeframes) {\n captureFrame (frame);\n frame++;\n }\n };\n\n if (fn->stop) fn->stop();\n dsStopGraphics();\n\n destroyMainWindow();\n}\n\n\nextern \"C\" void dsStop()\n{\n run = 0;\n}\n<|endoftext|>"} {"text":"<commit_before>\/******************************************************************************\n** Copyright (c) 2014-2015, Intel Corporation **\n** All rights reserved. **\n** **\n** Redistribution and use in source and binary forms, with or without **\n** modification, are permitted provided that the following conditions **\n** are met: **\n** 1. Redistributions of source code must retain the above copyright **\n** notice, this list of conditions and the following disclaimer. **\n** 2. Redistributions in binary form must reproduce the above copyright **\n** notice, this list of conditions and the following disclaimer in the **\n** documentation and\/or other materials provided with the distribution. **\n** 3. Neither the name of the copyright holder nor the names of its **\n** contributors may be used to endorse or promote products derived **\n** from this software without specific prior written permission. **\n** **\n** THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS **\n** \"AS IS\" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT **\n** LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR **\n** A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT **\n** HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, **\n** SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED **\n** TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR **\n** PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF **\n** LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING **\n** NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS **\n** SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. **\n******************************************************************************\/\n\/* Hans Pabst (Intel Corp.)\n******************************************************************************\/\n#include \"multi-dgemm-type.hpp\"\n\n#include <libxstream_begin.h>\n#include <stdexcept>\n#include <algorithm>\n#include <cstdlib>\n#include <cstring>\n#include <cstdio>\n#include <vector>\n#include <cmath>\n#if defined(_OPENMP)\n# include <omp.h>\n#endif\n#include <libxstream_end.h>\n\n\/\/#define MULTI_DGEMM_USE_NESTED\n#define MULTI_DGEMM_USE_SYNC 1\n#define MULTI_DGEMM_USE_CHECK\n\n#define DGEMM dgemm_\n\n\nLIBXSTREAM_EXTERN_C LIBXSTREAM_TARGET(mic) void DGEMM(\n const char*, const char*, const int*, const int*, const int*,\n const double*, const double*, const int*, const double*, const int*,\n const double*, double*, const int*);\n\n\nLIBXSTREAM_TARGET(mic) void process(LIBXSTREAM_INVAL(size_t) size, LIBXSTREAM_INVAL(size_t) nn, const size_t* idata,\n const double* adata, const double* bdata, double* cdata)\n{\n if (0 < LIBXSTREAM_GETVAL(size)) {\n static const double alpha = 1, beta = 1;\n static const char trans = 'N';\n const int isize = static_cast<int>(size);\n const size_t base = idata[0];\n\n#if defined(_OPENMP) && defined(MULTI_DGEMM_USE_NESTED)\n const int nthreads = omp_get_max_threads() \/ LIBXSTREAM_GETVAL(size);\n const int dynamic = omp_get_dynamic(), nested = omp_get_nested();\n omp_set_dynamic(0);\n omp_set_nested(1);\n# pragma omp parallel for schedule(dynamic,1) num_threads(LIBXSTREAM_GETVAL(size))\n#endif\n for (int i = 0; i < isize; ++i) {\n#if defined(_OPENMP) && defined(MULTI_DGEMM_USE_NESTED)\n omp_set_num_threads(nthreads);\n#endif\n LIBXSTREAM_ASSERT(base <= idata[i]);\n const size_t i0 = idata[i], i1 = (i + 1) < isize ? idata[i+1] : (i0 + LIBXSTREAM_GETVAL(nn)), n2 = i1 - i0, offset = i0 - base;\n const int n = static_cast<int>(std::sqrt(static_cast<double>(n2)) + 0.5);\n DGEMM(&trans, &trans, &n, &n, &n, &alpha, adata + offset, &n, bdata + offset, &n, &beta, cdata + offset, &n);\n }\n\n#if defined(_OPENMP) && defined(MULTI_DGEMM_USE_NESTED)\n omp_set_dynamic(dynamic);\n omp_set_nested(nested);\n#endif\n }\n}\n\n\nint main(int argc, char* argv[])\n{\n try {\n const int nitems = std::max(1 < argc ? std::atoi(argv[1]) : 60, 0);\n const int nbatch = std::max(2 < argc ? std::atoi(argv[2]) : 10, 1);\n const int nstreams = std::min(std::max(3 < argc ? std::atoi(argv[3]) : 2, 1), LIBXSTREAM_MAX_NSTREAMS);\n#if defined(MULTI_DGEMM_USE_SYNC)\n const int demux = 4 < argc ? std::atoi(argv[4]) : 1;\n#else\n const int demux = -1;\n#endif\n size_t ndevices = 0;\n if (LIBXSTREAM_ERROR_NONE != libxstream_get_ndevices(&ndevices) || 0 == ndevices) {\n throw std::runtime_error(\"no device found!\");\n }\n#if !defined(_OPENMP)\n fprintf(stderr, \"Warning: OpenMP support needed for performance results.\\n\");\n#endif\n\n fprintf(stdout, \"Initializing %i device%s and host data...\", static_cast<int>(ndevices), 1 == ndevices ? \"\" : \"s\");\n const size_t split[] = { size_t(nitems * 18.0 \/ 250.0 + 0.5), size_t(nitems * 74.0 \/ 250.0 + 0.5) };\n multi_dgemm_type::host_data_type host_data(reinterpret_cast<libxstream_function>(&process), nitems, split);\n fprintf(stdout, \" %.1f MB\\n\", host_data.bytes() * 1E-6);\n\n fprintf(stdout, \"Initializing %i stream%s per device...\", nstreams, 1 < nstreams ? \"s\" : \"\");\n const size_t nstreams_total = ndevices * nstreams;\n multi_dgemm_type multi_dgemm[LIBXSTREAM_MAX_NSTREAMS];\n for (size_t i = 0; i < nstreams_total; ++i) {\n char name[128];\n LIBXSTREAM_SNPRINTF(name, sizeof(name), \"Stream %i\", static_cast<int>(i + 1));\n LIBXSTREAM_CHECK_CALL_THROW(multi_dgemm[i].init(name, host_data, static_cast<int>(i % ndevices), demux, static_cast<size_t>(nbatch)));\n }\n if (0 < nstreams_total) {\n fprintf(stdout, \" %.1f MB\\n\", nstreams * multi_dgemm[0].bytes() * 1E-6);\n }\n\n const int nbatches = (nitems + nbatch - 1) \/ nbatch;\n fprintf(stdout, \"Running %i batch%s of %i item%s...\\n\", nbatches,\n 1 < nbatches ? \"es\" : \"\", std::min(nbatch, nitems),\n 1 < nbatch ? \"s\" : \"\");\n\n#if defined(_OPENMP)\n# if !defined(LIBXSTREAM_OFFLOAD)\n omp_set_dynamic(0);\n omp_set_nested(0);\n# endif\n const double start = omp_get_wtime();\n# pragma omp parallel for schedule(dynamic)\n#endif\n for (int i = 0; i < nitems; i += nbatch) {\n const size_t j = i \/ nbatch, n = j % nstreams_total;\n multi_dgemm_type& call = multi_dgemm[n];\n LIBXSTREAM_CHECK_CALL_ASSERT(call(i, std::min(nbatch, nitems - i)));\n#if defined(MULTI_DGEMM_USE_SYNC) && (1 <= MULTI_DGEMM_USE_SYNC)\n LIBXSTREAM_CHECK_CALL_ASSERT(libxstream_event_record(call.event(), call.stream()));\n#endif\n \/\/ synchronize every Nth iteration with N being the total number of streams\n if (n == (nstreams_total - 1)) {\n for (size_t k = 0; k < nstreams_total; ++k) {\n#if defined(MULTI_DGEMM_USE_SYNC)\n# if (2 <= (MULTI_DGEMM_USE_SYNC))\n \/\/ wait for an event within a stream\n LIBXSTREAM_CHECK_CALL_ASSERT(libxstream_stream_wait_event(multi_dgemm[0].stream(), multi_dgemm[k].event()));\n# elif (1 <= (MULTI_DGEMM_USE_SYNC))\n \/\/ wait for an event on the host\n LIBXSTREAM_CHECK_CALL_ASSERT(libxstream_event_synchronize(multi_dgemm[k].event()));\n# else\n \/\/ wait for all work in a stream\n LIBXSTREAM_CHECK_CALL_ASSERT(libxstream_stream_sync(multi_dgemm[k].stream()));\n# endif\n#endif\n }\n }\n }\n\n \/\/ sync all streams to complete any pending work\n LIBXSTREAM_CHECK_CALL_THROW(libxstream_stream_sync(0));\n\n#if defined(_OPENMP)\n const double duration = omp_get_wtime() - start;\n fprintf(stdout, \"Performance: %.1f GFLOPS\/s (%s)\\n\", host_data.flops() * 1E-9 \/ duration,\n 0 == demux ? \"manual locking\" : (0 < demux ? \"synchronization\" : \"automatic locking\"));\n fprintf(stdout, \"Duration: %.1f s\\n\", duration);\n#endif\n\n#if defined(MULTI_DGEMM_USE_CHECK)\n std::vector<double> expected(host_data.max_matrix_size());\n const size_t testbatchsize = 1;\n double max_error = 0;\n size_t i0 = 0;\n for (int i = 0; i < nitems; ++i) {\n const size_t i1 = host_data.idata()[i+1];\n const int nn = static_cast<int>(i1 - i0);\n std::fill_n(&expected[0], nn, 0.0);\n process(LIBXSTREAM_SETVAL(testbatchsize), LIBXSTREAM_SETVAL(nn), host_data.idata() + i, host_data.adata() + i0, host_data.bdata() + i0, &expected[0]);\n for (int n = 0; n < nn; ++n) max_error = std::max(max_error, std::abs(expected[n] - host_data.cdata()[i0+n]));\n i0 = i1;\n }\n fprintf(stdout, \"Error: %g\\n\", max_error);\n#endif\n fprintf(stdout, \"Finished\\n\");\n }\n catch(const std::exception& e) {\n fprintf(stderr, \"Error: %s\\n\", e.what());\n return EXIT_FAILURE;\n }\n catch(...) {\n fprintf(stderr, \"Error: unknown exception caught!\\n\");\n return EXIT_FAILURE;\n }\n\n return EXIT_SUCCESS;\n}\n<commit_msg>Avoid \"potential\" division by zero (duration \/ run time).<commit_after>\/******************************************************************************\n** Copyright (c) 2014-2015, Intel Corporation **\n** All rights reserved. **\n** **\n** Redistribution and use in source and binary forms, with or without **\n** modification, are permitted provided that the following conditions **\n** are met: **\n** 1. Redistributions of source code must retain the above copyright **\n** notice, this list of conditions and the following disclaimer. **\n** 2. Redistributions in binary form must reproduce the above copyright **\n** notice, this list of conditions and the following disclaimer in the **\n** documentation and\/or other materials provided with the distribution. **\n** 3. Neither the name of the copyright holder nor the names of its **\n** contributors may be used to endorse or promote products derived **\n** from this software without specific prior written permission. **\n** **\n** THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS **\n** \"AS IS\" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT **\n** LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR **\n** A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT **\n** HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, **\n** SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED **\n** TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR **\n** PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF **\n** LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING **\n** NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS **\n** SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. **\n******************************************************************************\/\n\/* Hans Pabst (Intel Corp.)\n******************************************************************************\/\n#include \"multi-dgemm-type.hpp\"\n\n#include <libxstream_begin.h>\n#include <stdexcept>\n#include <algorithm>\n#include <cstdlib>\n#include <cstring>\n#include <cstdio>\n#include <vector>\n#include <cmath>\n#if defined(_OPENMP)\n# include <omp.h>\n#endif\n#include <libxstream_end.h>\n\n\/\/#define MULTI_DGEMM_USE_NESTED\n#define MULTI_DGEMM_USE_SYNC 1\n#define MULTI_DGEMM_USE_CHECK\n\n#define DGEMM dgemm_\n\n\nLIBXSTREAM_EXTERN_C LIBXSTREAM_TARGET(mic) void DGEMM(\n const char*, const char*, const int*, const int*, const int*,\n const double*, const double*, const int*, const double*, const int*,\n const double*, double*, const int*);\n\n\nLIBXSTREAM_TARGET(mic) void process(LIBXSTREAM_INVAL(size_t) size, LIBXSTREAM_INVAL(size_t) nn, const size_t* idata,\n const double* adata, const double* bdata, double* cdata)\n{\n if (0 < LIBXSTREAM_GETVAL(size)) {\n static const double alpha = 1, beta = 1;\n static const char trans = 'N';\n const int isize = static_cast<int>(size);\n const size_t base = idata[0];\n\n#if defined(_OPENMP) && defined(MULTI_DGEMM_USE_NESTED)\n const int nthreads = omp_get_max_threads() \/ LIBXSTREAM_GETVAL(size);\n const int dynamic = omp_get_dynamic(), nested = omp_get_nested();\n omp_set_dynamic(0);\n omp_set_nested(1);\n# pragma omp parallel for schedule(dynamic,1) num_threads(LIBXSTREAM_GETVAL(size))\n#endif\n for (int i = 0; i < isize; ++i) {\n#if defined(_OPENMP) && defined(MULTI_DGEMM_USE_NESTED)\n omp_set_num_threads(nthreads);\n#endif\n LIBXSTREAM_ASSERT(base <= idata[i]);\n const size_t i0 = idata[i], i1 = (i + 1) < isize ? idata[i+1] : (i0 + LIBXSTREAM_GETVAL(nn)), n2 = i1 - i0, offset = i0 - base;\n const int n = static_cast<int>(std::sqrt(static_cast<double>(n2)) + 0.5);\n DGEMM(&trans, &trans, &n, &n, &n, &alpha, adata + offset, &n, bdata + offset, &n, &beta, cdata + offset, &n);\n }\n\n#if defined(_OPENMP) && defined(MULTI_DGEMM_USE_NESTED)\n omp_set_dynamic(dynamic);\n omp_set_nested(nested);\n#endif\n }\n}\n\n\nint main(int argc, char* argv[])\n{\n try {\n const int nitems = std::max(1 < argc ? std::atoi(argv[1]) : 60, 0);\n const int nbatch = std::max(2 < argc ? std::atoi(argv[2]) : 10, 1);\n const int nstreams = std::min(std::max(3 < argc ? std::atoi(argv[3]) : 2, 1), LIBXSTREAM_MAX_NSTREAMS);\n#if defined(MULTI_DGEMM_USE_SYNC)\n const int demux = 4 < argc ? std::atoi(argv[4]) : 1;\n#else\n const int demux = -1;\n#endif\n size_t ndevices = 0;\n if (LIBXSTREAM_ERROR_NONE != libxstream_get_ndevices(&ndevices) || 0 == ndevices) {\n throw std::runtime_error(\"no device found!\");\n }\n#if !defined(_OPENMP)\n fprintf(stderr, \"Warning: OpenMP support needed for performance results.\\n\");\n#endif\n\n fprintf(stdout, \"Initializing %i device%s and host data...\", static_cast<int>(ndevices), 1 == ndevices ? \"\" : \"s\");\n const size_t split[] = { size_t(nitems * 18.0 \/ 250.0 + 0.5), size_t(nitems * 74.0 \/ 250.0 + 0.5) };\n multi_dgemm_type::host_data_type host_data(reinterpret_cast<libxstream_function>(&process), nitems, split);\n fprintf(stdout, \" %.1f MB\\n\", host_data.bytes() * 1E-6);\n\n fprintf(stdout, \"Initializing %i stream%s per device...\", nstreams, 1 < nstreams ? \"s\" : \"\");\n const size_t nstreams_total = ndevices * nstreams;\n multi_dgemm_type multi_dgemm[LIBXSTREAM_MAX_NSTREAMS];\n for (size_t i = 0; i < nstreams_total; ++i) {\n char name[128];\n LIBXSTREAM_SNPRINTF(name, sizeof(name), \"Stream %i\", static_cast<int>(i + 1));\n LIBXSTREAM_CHECK_CALL_THROW(multi_dgemm[i].init(name, host_data, static_cast<int>(i % ndevices), demux, static_cast<size_t>(nbatch)));\n }\n if (0 < nstreams_total) {\n fprintf(stdout, \" %.1f MB\\n\", nstreams * multi_dgemm[0].bytes() * 1E-6);\n }\n\n const int nbatches = (nitems + nbatch - 1) \/ nbatch;\n fprintf(stdout, \"Running %i batch%s of %i item%s...\\n\", nbatches,\n 1 < nbatches ? \"es\" : \"\", std::min(nbatch, nitems),\n 1 < nbatch ? \"s\" : \"\");\n\n#if defined(_OPENMP)\n# if !defined(LIBXSTREAM_OFFLOAD)\n omp_set_dynamic(0);\n omp_set_nested(0);\n# endif\n const double start = omp_get_wtime();\n# pragma omp parallel for schedule(dynamic)\n#endif\n for (int i = 0; i < nitems; i += nbatch) {\n const size_t j = i \/ nbatch, n = j % nstreams_total;\n multi_dgemm_type& call = multi_dgemm[n];\n LIBXSTREAM_CHECK_CALL_ASSERT(call(i, std::min(nbatch, nitems - i)));\n#if defined(MULTI_DGEMM_USE_SYNC) && (1 <= MULTI_DGEMM_USE_SYNC)\n LIBXSTREAM_CHECK_CALL_ASSERT(libxstream_event_record(call.event(), call.stream()));\n#endif\n \/\/ synchronize every Nth iteration with N being the total number of streams\n if (n == (nstreams_total - 1)) {\n for (size_t k = 0; k < nstreams_total; ++k) {\n#if defined(MULTI_DGEMM_USE_SYNC)\n# if (2 <= (MULTI_DGEMM_USE_SYNC))\n \/\/ wait for an event within a stream\n LIBXSTREAM_CHECK_CALL_ASSERT(libxstream_stream_wait_event(multi_dgemm[0].stream(), multi_dgemm[k].event()));\n# elif (1 <= (MULTI_DGEMM_USE_SYNC))\n \/\/ wait for an event on the host\n LIBXSTREAM_CHECK_CALL_ASSERT(libxstream_event_synchronize(multi_dgemm[k].event()));\n# else\n \/\/ wait for all work in a stream\n LIBXSTREAM_CHECK_CALL_ASSERT(libxstream_stream_sync(multi_dgemm[k].stream()));\n# endif\n#endif\n }\n }\n }\n\n \/\/ sync all streams to complete any pending work\n LIBXSTREAM_CHECK_CALL_THROW(libxstream_stream_sync(0));\n\n#if defined(_OPENMP)\n const double duration = omp_get_wtime() - start;\n if (0 < duration) {\n fprintf(stdout, \"Performance: %.1f GFLOPS\/s (%s)\\n\", host_data.flops() * 1E-9 \/ duration,\n 0 == demux ? \"manual locking\" : (0 < demux ? \"synchronization\" : \"automatic locking\"));\n }\n fprintf(stdout, \"Duration: %.1f s\\n\", duration);\n#endif\n\n#if defined(MULTI_DGEMM_USE_CHECK)\n std::vector<double> expected(host_data.max_matrix_size());\n const size_t testbatchsize = 1;\n double max_error = 0;\n size_t i0 = 0;\n for (int i = 0; i < nitems; ++i) {\n const size_t i1 = host_data.idata()[i+1];\n const int nn = static_cast<int>(i1 - i0);\n std::fill_n(&expected[0], nn, 0.0);\n process(LIBXSTREAM_SETVAL(testbatchsize), LIBXSTREAM_SETVAL(nn), host_data.idata() + i, host_data.adata() + i0, host_data.bdata() + i0, &expected[0]);\n for (int n = 0; n < nn; ++n) max_error = std::max(max_error, std::abs(expected[n] - host_data.cdata()[i0+n]));\n i0 = i1;\n }\n fprintf(stdout, \"Error: %g\\n\", max_error);\n#endif\n fprintf(stdout, \"Finished\\n\");\n }\n catch(const std::exception& e) {\n fprintf(stderr, \"Error: %s\\n\", e.what());\n return EXIT_FAILURE;\n }\n catch(...) {\n fprintf(stderr, \"Error: unknown exception caught!\\n\");\n return EXIT_FAILURE;\n }\n\n return EXIT_SUCCESS;\n}\n<|endoftext|>"} {"text":"<commit_before>\/*\n\nCopyright (c) 2012-2014, Arvid Norberg\nAll rights reserved.\n\nRedistribution and use in source and binary forms, with or without\nmodification, are permitted provided that the following conditions\nare met:\n\n * Redistributions of source code must retain the above copyright\n notice, this list of conditions and the following disclaimer.\n * Redistributions in binary form must reproduce the above copyright\n notice, this list of conditions and the following disclaimer in\n the documentation and\/or other materials provided with the distribution.\n * Neither the name of the author nor the names of its\n contributors may be used to endorse or promote products derived\n from this software without specific prior written permission.\n\nTHIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS \"AS IS\"\nAND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE\nIMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE\nARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE\nLIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR\nCONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF\nSUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS\nINTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN\nCONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)\nARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE\nPOSSIBILITY OF SUCH DAMAGE.\n\n*\/\n\n#include \"libtorrent\/config.hpp\"\n#include \"libtorrent\/utf8.hpp\"\n#include \"libtorrent\/ConvertUTF.h\"\n\n\/\/ on windows we need these functions for\n\/\/ convert_to_native and convert_from_native\n#if TORRENT_USE_WSTRING || defined TORRENT_WINDOWS\n\nnamespace libtorrent\n{\n\tutf8_conv_result_t utf8_wchar(const std::string &utf8, std::wstring &wide)\n\t{\n\t\t\/\/ allocate space for worst-case\n\t\twide.resize(utf8.size());\n\t\twchar_t const* dst_start = wide.c_str();\n\t\tchar const* src_start = utf8.c_str();\n\t\tConversionResult ret;\n\t\t\/\/ TODO: 3 refactor this to use wchar_t as a template\n\t\t\/\/ it would cause less code to be generated without\n\t\t\/\/ relying on dead-code elimination and fix msvc constant\n\t\t\/\/ expression warning\n\t\tif (sizeof(wchar_t) == sizeof(UTF32))\n\t\t{\n\t\t\tret = ConvertUTF8toUTF32((const UTF8**)&src_start, (const UTF8*)src_start\n\t\t\t\t+ utf8.size(), (UTF32**)&dst_start, (UTF32*)dst_start + wide.size()\n\t\t\t\t, lenientConversion);\n\t\t\twide.resize(dst_start - wide.c_str());\n\t\t\treturn (utf8_conv_result_t)ret;\n\t\t}\n\t\telse if (sizeof(wchar_t) == sizeof(UTF16))\n\t\t{\n\t\t\tret = ConvertUTF8toUTF16((const UTF8**)&src_start, (const UTF8*)src_start\n\t\t\t\t+ utf8.size(), (UTF16**)&dst_start, (UTF16*)dst_start + wide.size()\n\t\t\t\t, lenientConversion);\n\t\t\twide.resize(dst_start - wide.c_str());\n\t\t\treturn (utf8_conv_result_t)ret;\n\t\t}\n\t\telse\n\t\t{\n\t\t\treturn source_illegal;\n\t\t}\n\t}\n\n\tutf8_conv_result_t wchar_utf8(const std::wstring &wide, std::string &utf8)\n\t{\n\t\t\/\/ allocate space for worst-case\n\t\tutf8.resize(wide.size() * 6);\n\t\tif (wide.empty()) return conversion_ok;\n\t\tchar* dst_start = &utf8[0];\n\t\twchar_t const* src_start = wide.c_str();\n\t\tConversionResult ret;\n\t\tif (sizeof(wchar_t) == sizeof(UTF32))\n\t\t{\n\t\t\tret = ConvertUTF32toUTF8((const UTF32**)&src_start, (const UTF32*)src_start\n\t\t\t\t+ wide.size(), (UTF8**)&dst_start, (UTF8*)dst_start + utf8.size()\n\t\t\t\t, lenientConversion);\n\t\t\tutf8.resize(dst_start - &utf8[0]);\n\t\t\treturn (utf8_conv_result_t)ret;\n\t\t}\n\t\telse if (sizeof(wchar_t) == sizeof(UTF16))\n\t\t{\n\t\t\tret = ConvertUTF16toUTF8((const UTF16**)&src_start, (const UTF16*)src_start\n\t\t\t\t+ wide.size(), (UTF8**)&dst_start, (UTF8*)dst_start + utf8.size()\n\t\t\t\t, lenientConversion);\n\t\t\tutf8.resize(dst_start - &utf8[0]);\n\t\t\treturn (utf8_conv_result_t)ret;\n\t\t}\n\t\telse\n\t\t{\n\t\t\treturn source_illegal;\n\t\t}\n\t}\n}\n\n#endif\n\n<commit_msg>clean up utf8 conversion wrapper a bit, to not rely on dead-code elimination in constant conditions<commit_after>\/*\n\nCopyright (c) 2012-2014, Arvid Norberg\nAll rights reserved.\n\nRedistribution and use in source and binary forms, with or without\nmodification, are permitted provided that the following conditions\nare met:\n\n * Redistributions of source code must retain the above copyright\n notice, this list of conditions and the following disclaimer.\n * Redistributions in binary form must reproduce the above copyright\n notice, this list of conditions and the following disclaimer in\n the documentation and\/or other materials provided with the distribution.\n * Neither the name of the author nor the names of its\n contributors may be used to endorse or promote products derived\n from this software without specific prior written permission.\n\nTHIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS \"AS IS\"\nAND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE\nIMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE\nARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE\nLIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR\nCONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF\nSUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS\nINTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN\nCONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)\nARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE\nPOSSIBILITY OF SUCH DAMAGE.\n\n*\/\n\n#include \"libtorrent\/config.hpp\"\n#include \"libtorrent\/utf8.hpp\"\n#include \"libtorrent\/ConvertUTF.h\"\n\n\/\/ on windows we need these functions for\n\/\/ convert_to_native and convert_from_native\n#if TORRENT_USE_WSTRING || defined TORRENT_WINDOWS\n\nnamespace libtorrent\n{\n\tnamespace\n\t{\n\t\t\/\/ ==== utf-8 -> wide ===\n\t\ttemplate<int width>\n\t\tstruct convert_to_wide \n\t\t{\n\t\t\tstatic utf8_conv_result_t convert(UTF8 const** src_start\n\t\t\t\t, UTF8 const* src_end\n\t\t\t\t, std::wstring& wide)\n\t\t\t{\n\t\t\t\treturn source_illegal;\n\t\t\t}\n\t\t};\n\n\t\t\/\/ ==== utf-8 -> utf-32 ===\n\t\ttemplate<>\n\t\tstruct convert_to_wide<4>\n\t\t{\n\t\t\tstatic utf8_conv_result_t convert(char const** src_start\n\t\t\t\t, char const* src_end\n\t\t\t\t, std::wstring& wide)\n\t\t\t{\n\t\t\t\twchar_t const* dst_start = wide.c_str();\n\t\t\t\tint ret = ConvertUTF8toUTF32((UTF8 const**)src_start\n\t\t\t\t\t, (UTF8 const*)src_end\n\t\t\t\t\t, (UTF32**)&dst_start, (UTF32*)dst_start + wide.size()\n\t\t\t\t\t, lenientConversion);\n\t\t\t\twide.resize(dst_start - wide.c_str());\n\t\t\t\treturn (utf8_conv_result_t)ret;\n\t\t\t}\n\t\t};\n\n\t\t\/\/ ==== utf-8 -> utf-16 ===\n\t\ttemplate<>\n\t\tstruct convert_to_wide<2>\n\t\t{\n\t\t\tstatic utf8_conv_result_t convert(char const** src_start\n\t\t\t\t, char const* src_end\n\t\t\t\t, std::wstring& wide)\n\t\t\t{\n\t\t\t\twchar_t const* dst_start = wide.c_str();\n\t\t\t\tint ret = ConvertUTF8toUTF16((UTF8 const**)src_start\n\t\t\t\t\t, (UTF8 const*)src_end\n\t\t\t\t\t, (UTF16**)&dst_start, (UTF16*)dst_start + wide.size()\n\t\t\t\t\t, lenientConversion);\n\t\t\t\twide.resize(dst_start - wide.c_str());\n\t\t\t\treturn (utf8_conv_result_t)ret;\n\t\t\t}\n\t\t};\n\n\t\t\/\/ ==== wide -> utf-8 ===\n\t\ttemplate<int width>\n\t\tstruct convert_from_wide\n\t\t{\n\t\t\tstatic utf8_conv_result_t convert(wchar_t const** src_start\n\t\t\t\t, wchar_t const* src_end\n\t\t\t\t, std::string& utf8)\n\t\t\t{\n\t\t\t\treturn source_illegal;\n\t\t\t}\n\t\t};\n\n\t\t\/\/ ==== utf-32 -> utf-8 ===\n\t\ttemplate<>\n\t\tstruct convert_from_wide<4>\n\t\t{\n\t\t\tstatic utf8_conv_result_t convert(wchar_t const** src_start\n\t\t\t\t, wchar_t const* src_end\n\t\t\t\t, std::string& utf8)\n\t\t\t{\n\t\t\t\tchar const* dst_start = utf8.c_str();\n\t\t\t\tint ret = ConvertUTF32toUTF8((UTF32 const**)src_start\n\t\t\t\t\t, (UTF32 const*)src_end, (UTF8**)&dst_start\n\t\t\t\t\t, (UTF8*)dst_start + utf8.size()\n\t\t\t\t\t, lenientConversion);\n\t\t\t\tutf8.resize(dst_start - &utf8[0]);\n\t\t\t\treturn (utf8_conv_result_t)ret;\n\t\t\t}\n\t\t};\n\n\t\t\/\/ ==== utf-16 -> utf-8 ===\n\t\ttemplate<>\n\t\tstruct convert_from_wide<2>\n\t\t{\n\t\t\tstatic utf8_conv_result_t convert(wchar_t const** src_start\n\t\t\t\t, wchar_t const* src_end\n\t\t\t\t, std::string& utf8)\n\t\t\t{\n\t\t\t\tchar const* dst_start = utf8.c_str();\n\t\t\t\tint ret = ConvertUTF16toUTF8((UTF16 const**)src_start\n\t\t\t\t\t, (UTF16 const*)src_end, (UTF8**)&dst_start\n\t\t\t\t\t, (UTF8*)dst_start + utf8.size()\n\t\t\t\t\t, lenientConversion);\n\t\t\t\tutf8.resize(dst_start - &utf8[0]);\n\t\t\t\treturn (utf8_conv_result_t)ret;\n\t\t\t}\n\t\t};\n\t} \/\/ anonymous namespace\n\n\tutf8_conv_result_t utf8_wchar(std::string const& utf8, std::wstring &wide)\n\t{\n\t\t\/\/ allocate space for worst-case\n\t\twide.resize(utf8.size());\n\t\twchar_t const* dst_start = wide.c_str();\n\t\tchar const* src_start = utf8.c_str();\n\t\treturn convert_to_wide<sizeof(wchar_t)>::convert(\n\t\t\t&src_start, src_start + utf8.size(), wide);\n\t}\n\n\tutf8_conv_result_t wchar_utf8(std::wstring const& wide, std::string &utf8)\n\t{\n\t\t\/\/ allocate space for worst-case\n\t\tutf8.resize(wide.size() * 6);\n\t\tif (wide.empty()) return conversion_ok;\n\t\tchar* dst_start = &utf8[0];\n\t\twchar_t const* src_start = wide.c_str();\n\t\treturn convert_from_wide<sizeof(wchar_t)>::convert(\n\t\t\t&src_start, src_start + wide.size(), utf8);\n\t}\n}\n\n#endif\n\n<|endoftext|>"} {"text":"<commit_before>#include <cmath>\n#include <cstdarg>\n#include <assert.h>\n\n#include \"opencv2\/opencv.hpp\"\nusing namespace cv;\n\n#include \"structures.hpp\"\n#include \"util.hpp\"\n\nvoid showImage(const char* title, const Mat& img)\n{\n\tstd::cout << \"\\nShowing image: \\\"\" << title << \"\\\".\" << std::endl;\n\tnamedWindow(title, CV_WINDOW_NORMAL);\n\timshow(title, img);\n}\n\nvoid showImageAndWait(const char* title, const Mat& img)\n{\n\tshowImage(title, img);\n\tstd::cout << \"Press any key to continue...\" << std::endl;\n\twaitKey(0);\n}\n\nPoint3f backproject3D(const float& x,const float& y, const float& depth, const Mat& m_cameraMatrix)\n{\n\tMat new_point = depth * (Mat_<float>(1,3) << x,y,1) * m_cameraMatrix.inv().t();\n\treturn Point3f(new_point);\n}\n\n\/**\n * Custom logger, instantiate with namespace string to prefix messages with.\n * For example:\n * Logger _log(\"Load Images\");\n *\/\nLogger::Logger(const char* _namespace)\n\t: name_space(_namespace), start(ch::system_clock::now())\n{}\n\nvoid Logger::operator() (const char* format, ...)\n{\n\tva_list args;\n\tva_start(args, format);\n\n\tprintf(\"%s>\\t\", name_space);\n\tvprintf(format, args);\n\tprintf(\"\\n\");\n\n\tva_end(args);\n}\n\nvoid Logger::tok()\n{\n\tconst clock_t end = ch::system_clock::now();\n\tch::milliseconds dur = ch::duration_cast<ch::milliseconds>(end - start);\n\t(*this)(\"Done in %.2fs.\", (float)dur.count() \/ 1e3);\n}\n\n\/*\n * convert rotation matrix to quaternion\n*\/\nVec4f R2Quaternion(Mat& R)\n{\n\tassert(R.rows == 3 && R.cols == 3);\n\t\/\/ typedef typename DataType<float>::work_type _wTp;\n\tif (R.type() != CV_32F) R.convertTo(R, CV_32F);;\n\tfloat q0,q1,q2,q3;\n\tfloat r00 = R.at<float>(0,0);\n\tfloat r01 = R.at<float>(0,1);\n\tfloat r02 = R.at<float>(0,2);\n\tfloat r10 = R.at<float>(1,0);\n\tfloat r11 = R.at<float>(1,1);\n\tfloat r12 = R.at<float>(1,2);\n\tfloat r20 = R.at<float>(2,0);\n\tfloat r21 = R.at<float>(2,1);\n\tfloat r22 = R.at<float>(2,2);\n\n\tfloat trace = r00 + r11 + r22;\n\tif( trace > 0 ){\n\t\tfloat s = 0.5 \/ sqrt(trace+ 1.0);\n \tq0 = 0.25 \/ s;\n \tq1 = ( r21 - r12 ) * s;\n \tq2 = ( r02 - r20 ) * s;\n \tq3 = ( r10 - r01 ) * s;\n\t} else {\n \tif ( r00 > r11 && r00 > r22 ) \n \t{\n \tfloat s = 2.0 * sqrt( 1.0 + r00 - r11 - r22);\n \tq0 = (r21 - r12 ) \/ s;\n \tq1 = 0.25 * s;\n \tq2 = (r01 + r10 ) \/ s;\n \tq3 = (r02 + r20 ) \/ s;\n \t} else if (r11 > r22) {\n\t float s = 2.0 * sqrt( 1.0 + r11 - r00 - r22);\n\t q0 = (r02 - r20 ) \/ s;\n\t q1 = (r01 + r10 ) \/ s;\n\t q2 = 0.25 * s;\n\t q3 = (r12 + r21 ) \/ s;\n \t} else {\n \tfloat s = 2.0 * sqrt( 1.0 + r22 - r00 - r11 );\n \tq0 = (r10 - r01 ) \/ s;\n\t q1 = (r02 + r20 ) \/ s;\n\t q2 = (r12 + r21 ) \/ s;\n\t q3 = 0.25 * s;\n \t}\n\t}\n\tVec4f q = normalize(Vec4f(q0, q1, q2, q3));\n\treturn q;\n}\n\nMat quat2R(Vec4f& q){\n\n float sqw = q[0]*q[0];\n float sqx = q[1]*q[1];\n float sqy = q[2]*q[2];\n float sqz = q[3]*q[3];\n\n \/\/ invs (inverse square length) is only required if quaternion is not already normalised\n float invs = 1 \/ (sqx + sqy + sqz + sqw);\n float m00 = ( sqx - sqy - sqz + sqw)*invs ; \/\/ since sqw + sqx + sqy + sqz =1\/invs*invs\n float m11 = (-sqx + sqy - sqz + sqw)*invs ;\n float m22 = (-sqx - sqy + sqz + sqw)*invs ;\n \n float tmp1 = q[1]*q[2];\n float tmp2 = q[3]*q[0];\n float m10 = 2.0 * (tmp1 + tmp2)*invs ;\n float m01 = 2.0 * (tmp1 - tmp2)*invs ;\n \n tmp1 = q[1]*q[3];\n tmp2 = q[2]*q[0];\n float m20 = 2.0 * (tmp1 - tmp2)*invs ;\n float m02 = 2.0 * (tmp1 + tmp2)*invs ;\n tmp1 = q[2]*q[3];\n tmp2 = q[1]*q[0];\n float m21 = 2.0 * (tmp1 + tmp2)*invs ;\n float m12 = 2.0 * (tmp1 - tmp2)*invs ;\n Mat R = (Mat_<float>(3,3) << m00, m01, m02, m10, m11, m12, m20, m21, m22);\n return R;\n}\n\nbool checkCoherentRotation(cv::Mat& R) {\n\t\n\tif(fabs(determinant(R))-1.0 > 1e-05) return false;\n\treturn true;\n}\n\nbool checkCoherentQ(Vec4f& q0, Vec4f& q1)\n{\t\n\tVec4f absdelta,reldelta;\n\tabsdiff(q0,q1,absdelta);\n\tdivide(absdelta,q1,reldelta);\n\tif (reldelta[0]>0.05 ||reldelta[1]>0.05 ||reldelta[2]>0.05 ||reldelta[3]>0.05)\n\t\treturn false;\n\treturn true;\n}\n\n<commit_msg>Make backproject3D signature consistent<commit_after>#include <cmath>\n#include <cstdarg>\n#include <assert.h>\n\n#include \"opencv2\/opencv.hpp\"\nusing namespace cv;\n\n#include \"structures.hpp\"\n#include \"util.hpp\"\n\nvoid showImage(const char* title, const Mat& img)\n{\n\tstd::cout << \"\\nShowing image: \\\"\" << title << \"\\\".\" << std::endl;\n\tnamedWindow(title, CV_WINDOW_NORMAL);\n\timshow(title, img);\n}\n\nvoid showImageAndWait(const char* title, const Mat& img)\n{\n\tshowImage(title, img);\n\tstd::cout << \"Press any key to continue...\" << std::endl;\n\twaitKey(0);\n}\n\nPoint3f backproject3D(const float x, const float y, const float depth, const Mat& m_cameraMatrix)\n{\n\tMat new_point = depth * (Mat_<float>(1,3) << x,y,1) * m_cameraMatrix.inv().t();\n\treturn Point3f(new_point);\n}\n\n\/**\n * Custom logger, instantiate with namespace string to prefix messages with.\n * For example:\n * Logger _log(\"Load Images\");\n *\/\nLogger::Logger(const char* _namespace)\n\t: name_space(_namespace), start(ch::system_clock::now())\n{}\n\nvoid Logger::operator() (const char* format, ...)\n{\n\tva_list args;\n\tva_start(args, format);\n\n\tprintf(\"%s>\\t\", name_space);\n\tvprintf(format, args);\n\tprintf(\"\\n\");\n\n\tva_end(args);\n}\n\nvoid Logger::tok()\n{\n\tconst clock_t end = ch::system_clock::now();\n\tch::milliseconds dur = ch::duration_cast<ch::milliseconds>(end - start);\n\t(*this)(\"Done in %.2fs.\", (float)dur.count() \/ 1e3);\n}\n\n\/*\n * convert rotation matrix to quaternion\n*\/\nVec4f R2Quaternion(Mat& R)\n{\n\tassert(R.rows == 3 && R.cols == 3);\n\t\/\/ typedef typename DataType<float>::work_type _wTp;\n\tif (R.type() != CV_32F) R.convertTo(R, CV_32F);;\n\tfloat q0,q1,q2,q3;\n\tfloat r00 = R.at<float>(0,0);\n\tfloat r01 = R.at<float>(0,1);\n\tfloat r02 = R.at<float>(0,2);\n\tfloat r10 = R.at<float>(1,0);\n\tfloat r11 = R.at<float>(1,1);\n\tfloat r12 = R.at<float>(1,2);\n\tfloat r20 = R.at<float>(2,0);\n\tfloat r21 = R.at<float>(2,1);\n\tfloat r22 = R.at<float>(2,2);\n\n\tfloat trace = r00 + r11 + r22;\n\tif( trace > 0 ){\n\t\tfloat s = 0.5 \/ sqrt(trace+ 1.0);\n \tq0 = 0.25 \/ s;\n \tq1 = ( r21 - r12 ) * s;\n \tq2 = ( r02 - r20 ) * s;\n \tq3 = ( r10 - r01 ) * s;\n\t} else {\n \tif ( r00 > r11 && r00 > r22 ) \n \t{\n \tfloat s = 2.0 * sqrt( 1.0 + r00 - r11 - r22);\n \tq0 = (r21 - r12 ) \/ s;\n \tq1 = 0.25 * s;\n \tq2 = (r01 + r10 ) \/ s;\n \tq3 = (r02 + r20 ) \/ s;\n \t} else if (r11 > r22) {\n\t float s = 2.0 * sqrt( 1.0 + r11 - r00 - r22);\n\t q0 = (r02 - r20 ) \/ s;\n\t q1 = (r01 + r10 ) \/ s;\n\t q2 = 0.25 * s;\n\t q3 = (r12 + r21 ) \/ s;\n \t} else {\n \tfloat s = 2.0 * sqrt( 1.0 + r22 - r00 - r11 );\n \tq0 = (r10 - r01 ) \/ s;\n\t q1 = (r02 + r20 ) \/ s;\n\t q2 = (r12 + r21 ) \/ s;\n\t q3 = 0.25 * s;\n \t}\n\t}\n\tVec4f q = normalize(Vec4f(q0, q1, q2, q3));\n\treturn q;\n}\n\nMat quat2R(Vec4f& q){\n\n float sqw = q[0]*q[0];\n float sqx = q[1]*q[1];\n float sqy = q[2]*q[2];\n float sqz = q[3]*q[3];\n\n \/\/ invs (inverse square length) is only required if quaternion is not already normalised\n float invs = 1 \/ (sqx + sqy + sqz + sqw);\n float m00 = ( sqx - sqy - sqz + sqw)*invs ; \/\/ since sqw + sqx + sqy + sqz =1\/invs*invs\n float m11 = (-sqx + sqy - sqz + sqw)*invs ;\n float m22 = (-sqx - sqy + sqz + sqw)*invs ;\n \n float tmp1 = q[1]*q[2];\n float tmp2 = q[3]*q[0];\n float m10 = 2.0 * (tmp1 + tmp2)*invs ;\n float m01 = 2.0 * (tmp1 - tmp2)*invs ;\n \n tmp1 = q[1]*q[3];\n tmp2 = q[2]*q[0];\n float m20 = 2.0 * (tmp1 - tmp2)*invs ;\n float m02 = 2.0 * (tmp1 + tmp2)*invs ;\n tmp1 = q[2]*q[3];\n tmp2 = q[1]*q[0];\n float m21 = 2.0 * (tmp1 + tmp2)*invs ;\n float m12 = 2.0 * (tmp1 - tmp2)*invs ;\n Mat R = (Mat_<float>(3,3) << m00, m01, m02, m10, m11, m12, m20, m21, m22);\n return R;\n}\n\nbool checkCoherentRotation(cv::Mat& R) {\n\t\n\tif(fabs(determinant(R))-1.0 > 1e-05) return false;\n\treturn true;\n}\n\nbool checkCoherentQ(Vec4f& q0, Vec4f& q1)\n{\t\n\tVec4f absdelta,reldelta;\n\tabsdiff(q0,q1,absdelta);\n\tdivide(absdelta,q1,reldelta);\n\tif (reldelta[0]>0.05 ||reldelta[1]>0.05 ||reldelta[2]>0.05 ||reldelta[3]>0.05)\n\t\treturn false;\n\treturn true;\n}\n\n<|endoftext|>"} {"text":"<commit_before><commit_msg>attempt blind fix of Macos compile error<commit_after><|endoftext|>"} {"text":"<commit_before>\/*\n * Copyright (C) 2009 Toni Gundogdu.\n *\n * This file is part of cclive.\n * \n * cclive 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 3 of the License, or (at your option) any later\n * version.\n * \n * cclive 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 more\n * details.\n * \n * You should have received a copy of the GNU General Public License along with\n * this program. If not, see <http:\/\/www.gnu.org\/licenses\/>.\n *\/\n\n#include <algorithm>\n#include <fstream>\n#include <string>\n#include <vector>\n#include <map>\n\n#include \"hosthandler.h\"\n#include \"opts.h\"\n\nconst double\nUtil::fileExists(const std::string& path) {\n std::ifstream f;\n f.open(path.c_str(), std::ios::binary);\n\n double len = 0;\n\n if (f.is_open()) {\n f.seekg(0, std::ios::end);\n len = f.tellg();\n f.close();\n }\n\n return len;\n}\n\nconst std::string\nUtil::subStr(const std::string& src,\n const std::string& begin,\n const std::string& end,\n const bool& croak_if_not_found \/*=true*\/)\n{\n const std::string::size_type begin_pos = src.find(begin);\n if (begin_pos == std::string::npos && croak_if_not_found)\n throw HostHandler::ParseException(\"not found: \"+begin);\n\n const std::string::size_type end_pos =\n src.find(end, begin_pos + begin.length());\n\n if (end_pos == std::string::npos && croak_if_not_found)\n throw HostHandler::ParseException(\"not found: \"+end);\n\n const std::string::size_type from =\n begin_pos + begin.length();\n\n const std::string::size_type len =\n end_pos - begin_pos - begin.length();\n\n return src.substr(from, len);\n}\n\nconst std::string\nUtil::rsubStr(const std::string& src,\n const std::string& begin,\n const std::string& end,\n const bool& croak_if_not_found \/*=true*\/)\n{\n const std::string::size_type end_pos = src.rfind(end);\n if (end_pos == std::string::npos && croak_if_not_found)\n throw HostHandler::ParseException(\"not found: \"+end);\n\n const std::string::size_type begin_pos =\n src.rfind(begin, end_pos - end.length());\n\n if (begin_pos == std::string::npos && croak_if_not_found)\n throw HostHandler::ParseException(\"not found: \"+begin);\n\n const std::string::size_type from =\n begin_pos + begin.length();\n\n const std::string::size_type len =\n end_pos - begin_pos - begin.length();\n\n return src.substr(from, len);\n}\n\nstd::string&\nUtil::subStrReplace(\n std::string& src,\n const std::string& what,\n const std::string& with)\n{\n std::string::size_type pos;\n\n while ((pos = src.find(what)) != std::string::npos)\n src.replace(pos, what.size(), with);\n\n return src;\n}\n\nstd::string&\nUtil::nocookieToYoutube(std::string& url) {\n \/\/ Convert alternate domain youtube-nocookie.com\n \/\/ to youtube.com domain.\n return Util::subStrReplace(url, \"-nocookie\", \"\");\n}\n\nstd::string&\nUtil::embedToPage(std::string& url) {\n typedef std::map<std::string, std::string> mapstr;\n\n mapstr m;\n\n m[\"\/v\/\"] = \"\/watch?v=\"; \/\/ youtube\n m[\"googleplayer.swf\"] = \"videoplay\"; \/\/ google\n m[\"\/pl\/\"] = \"\/videos\/\"; \/\/ sevenload\n m[\"\/e\/\"] = \"\/view?i=\"; \/\/ liveleak\n\n for (mapstr::const_iterator iter = m.begin();\n iter != m.end();\n ++iter)\n {\n Util::subStrReplace(url, iter->first, iter->second);\n }\n\n return url;\n}\n\nstd::string&\nUtil::lastfmToYoutube(std::string& url) {\n const std::string::size_type pos = url.find(\"+1-\");\n if (pos != std::string::npos) {\n const std::string id = url.substr(pos+3);\n url = \"http:\/\/youtube.com\/watch?v=\" + id;\n }\n return url;\n}\n\nstd::string&\nUtil::toLower(std::string& src) {\n std::transform(src.begin(), src.end(),\n src.begin(), tolower);\n return src;\n}\n\nstd::vector<std::string>\nUtil::tokenize(const std::string& src, const std::string& delims) {\n std::string::size_type last = src.find_first_not_of(delims);\n std::string::size_type pos = src.find_first_of(delims, last);\n\n std::vector<std::string> v;\n\n while (std::string::npos != pos || std::string::npos != last) {\n v.push_back( src.substr(last, pos-last) );\n last = src.find_first_not_of(delims, pos);\n pos = src.find_first_of(delims, last);\n }\n return v;\n}\n\nstd::string\nUtil::parseFormatMap(const std::string& host) {\n\n const Options opts =\n optsmgr.getOptions();\n\n std::string fmt;\n\n if (opts.format_map_given) {\n pcrecpp::RE re(host + \":(.*?)(\\\\||$)\");\n re.PartialMatch(opts.format_map_arg, &fmt);\n }\n\n if (opts.format_given) \/\/ Override.\n fmt = opts.format_arg;\n\n return fmt;\n}\n\n\n<commit_msg>util.cpp: use typedef.<commit_after>\/*\n * Copyright (C) 2009 Toni Gundogdu.\n *\n * This file is part of cclive.\n * \n * cclive 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 3 of the License, or (at your option) any later\n * version.\n * \n * cclive 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 more\n * details.\n * \n * You should have received a copy of the GNU General Public License along with\n * this program. If not, see <http:\/\/www.gnu.org\/licenses\/>.\n *\/\n\n#include <algorithm>\n#include <fstream>\n#include <string>\n#include <vector>\n#include <map>\n\n#include \"hosthandler.h\"\n#include \"opts.h\"\n\nconst double\nUtil::fileExists(const std::string& path) {\n std::ifstream f;\n f.open(path.c_str(), std::ios::binary);\n\n double len = 0;\n\n if (f.is_open()) {\n f.seekg(0, std::ios::end);\n len = f.tellg();\n f.close();\n }\n\n return len;\n}\n\nconst std::string\nUtil::subStr(const std::string& src,\n const std::string& begin,\n const std::string& end,\n const bool& croak_if_not_found \/*=true*\/)\n{\n const std::string::size_type begin_pos = src.find(begin);\n if (begin_pos == std::string::npos && croak_if_not_found)\n throw HostHandler::ParseException(\"not found: \"+begin);\n\n const std::string::size_type end_pos =\n src.find(end, begin_pos + begin.length());\n\n if (end_pos == std::string::npos && croak_if_not_found)\n throw HostHandler::ParseException(\"not found: \"+end);\n\n const std::string::size_type from =\n begin_pos + begin.length();\n\n const std::string::size_type len =\n end_pos - begin_pos - begin.length();\n\n return src.substr(from, len);\n}\n\nconst std::string\nUtil::rsubStr(const std::string& src,\n const std::string& begin,\n const std::string& end,\n const bool& croak_if_not_found \/*=true*\/)\n{\n const std::string::size_type end_pos = src.rfind(end);\n if (end_pos == std::string::npos && croak_if_not_found)\n throw HostHandler::ParseException(\"not found: \"+end);\n\n const std::string::size_type begin_pos =\n src.rfind(begin, end_pos - end.length());\n\n if (begin_pos == std::string::npos && croak_if_not_found)\n throw HostHandler::ParseException(\"not found: \"+begin);\n\n const std::string::size_type from =\n begin_pos + begin.length();\n\n const std::string::size_type len =\n end_pos - begin_pos - begin.length();\n\n return src.substr(from, len);\n}\n\nstd::string&\nUtil::subStrReplace(\n std::string& src,\n const std::string& what,\n const std::string& with)\n{\n std::string::size_type pos;\n\n while ((pos = src.find(what)) != std::string::npos)\n src.replace(pos, what.size(), with);\n\n return src;\n}\n\nstd::string&\nUtil::nocookieToYoutube(std::string& url) {\n \/\/ Convert alternate domain youtube-nocookie.com\n \/\/ to youtube.com domain.\n return Util::subStrReplace(url, \"-nocookie\", \"\");\n}\n\nstd::string&\nUtil::embedToPage(std::string& url) {\n typedef std::map<std::string, std::string> mapstr;\n\n mapstr m;\n\n m[\"\/v\/\"] = \"\/watch?v=\"; \/\/ youtube\n m[\"googleplayer.swf\"] = \"videoplay\"; \/\/ google\n m[\"\/pl\/\"] = \"\/videos\/\"; \/\/ sevenload\n m[\"\/e\/\"] = \"\/view?i=\"; \/\/ liveleak\n\n for (mapstr::const_iterator iter = m.begin();\n iter != m.end();\n ++iter)\n {\n Util::subStrReplace(url, iter->first, iter->second);\n }\n\n return url;\n}\n\nstd::string&\nUtil::lastfmToYoutube(std::string& url) {\n const std::string::size_type pos = url.find(\"+1-\");\n if (pos != std::string::npos) {\n const std::string id = url.substr(pos+3);\n url = \"http:\/\/youtube.com\/watch?v=\" + id;\n }\n return url;\n}\n\nstd::string&\nUtil::toLower(std::string& src) {\n std::transform(src.begin(), src.end(),\n src.begin(), tolower);\n return src;\n}\n\ntypedef std::vector<std::string> STRV;\n\nSTRV\nUtil::tokenize(const std::string& src, const std::string& delims) {\n std::string::size_type last = src.find_first_not_of(delims);\n std::string::size_type pos = src.find_first_of(delims, last);\n\n STRV v;\n\n while (std::string::npos != pos || std::string::npos != last) {\n v.push_back( src.substr(last, pos-last) );\n last = src.find_first_not_of(delims, pos);\n pos = src.find_first_of(delims, last);\n }\n return v;\n}\n\nstd::string\nUtil::parseFormatMap(const std::string& host) {\n\n const Options opts =\n optsmgr.getOptions();\n\n std::string fmt;\n\n if (opts.format_map_given) {\n pcrecpp::RE re(host + \":(.*?)(\\\\||$)\");\n re.PartialMatch(opts.format_map_arg, &fmt);\n }\n\n if (opts.format_given) \/\/ Override.\n fmt = opts.format_arg;\n\n return fmt;\n}\n\n\n<|endoftext|>"} {"text":"<commit_before>\/*************************************************************************\n *\n * $RCSfile: xcl97dum.cxx,v $\n *\n * $Revision: 1.15 $\n *\n * last change: $Author: vg $ $Date: 2005-02-21 13:49:34 $\n *\n * The Contents of this file are made available subject to the terms of\n * either of the following licenses\n *\n * - GNU Lesser General Public License Version 2.1\n * - Sun Industry Standards Source License Version 1.1\n *\n * Sun Microsystems Inc., October, 2000\n *\n * GNU Lesser General Public License Version 2.1\n * =============================================\n * Copyright 2000 by Sun Microsystems, Inc.\n * 901 San Antonio Road, Palo Alto, CA 94303, USA\n *\n * This library is free software; you can redistribute it and\/or\n * modify it under the terms of the GNU Lesser General Public\n * License version 2.1, as published by the Free Software Foundation.\n *\n * This library is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU\n * Lesser General Public License for more details.\n *\n * You should have received a copy of the GNU Lesser General Public\n * License along with this library; if not, write to the Free Software\n * Foundation, Inc., 59 Temple Place, Suite 330, Boston,\n * MA 02111-1307 USA\n *\n *\n * Sun Industry Standards Source License Version 1.1\n * =================================================\n * The contents of this file are subject to the Sun Industry Standards\n * Source License Version 1.1 (the \"License\"); You may not use this file\n * except in compliance with the License. You may obtain a copy of the\n * License at http:\/\/www.openoffice.org\/license.html.\n *\n * Software provided under this License is provided on an \"AS IS\" basis,\n * WITHOUT WARRANTY OF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING,\n * WITHOUT LIMITATION, WARRANTIES THAT THE SOFTWARE IS FREE OF DEFECTS,\n * MERCHANTABLE, FIT FOR A PARTICULAR PURPOSE, OR NON-INFRINGING.\n * See the License for the specific provisions governing your rights and\n * obligations concerning the Software.\n *\n * The Initial Developer of the Original Code is: Sun Microsystems, Inc.\n *\n * Copyright: 2000 by Sun Microsystems, Inc.\n *\n * All Rights Reserved.\n *\n * Contributor(s): _______________________________________\n *\n *\n ************************************************************************\/\n\n#ifdef PCH\n#include \"filt_pch.hxx\"\n#endif\n\n#pragma hdrstop\n\n\n#include \"xcl97dum.hxx\"\n\n\n\/\/ --- ExcDummy8_xx Data ---------------------------------------------\n\n\/\/ ... (8+) := neu in Biff8, ... (8*) := anders in Biff8\n\nconst BYTE ExcDummy8_00a::pMyData[] = {\n 0xe1, 0x00, 0x02, 0x00, 0xb0, 0x04, \/\/ INTERFACEHDR\n 0xc1, 0x00, 0x02, 0x00, 0x00, 0x00, \/\/ MMS\n 0xe2, 0x00, 0x00, 0x00, \/\/ INTERFACEEND\n 0x5c, 0x00, 0x70, 0x00, \/\/ WRITEACCESS (8*)\n 0x04, 0x00, 0x00, 'C', 'a', 'l', 'c', 0x20, \/\/ \"Calc\"\n 0x20, 0x20, 0x20, 0x20, 0x20, 0x20, 0x20, 0x20,\n 0x20, 0x20, 0x20, 0x20, 0x20, 0x20, 0x20, 0x20,\n 0x20, 0x20, 0x20, 0x20, 0x20, 0x20, 0x20, 0x20,\n 0x20, 0x20, 0x20, 0x20, 0x20, 0x20, 0x20, 0x20,\n 0x20, 0x20, 0x20, 0x20, 0x20, 0x20, 0x20, 0x20,\n 0x20, 0x20, 0x20, 0x20, 0x20, 0x20, 0x20, 0x20,\n 0x20, 0x20, 0x20, 0x20, 0x20, 0x20, 0x20, 0x20,\n 0x20, 0x20, 0x20, 0x20, 0x20, 0x20, 0x20, 0x20,\n 0x20, 0x20, 0x20, 0x20, 0x20, 0x20, 0x20, 0x20,\n 0x20, 0x20, 0x20, 0x20, 0x20, 0x20, 0x20, 0x20,\n 0x20, 0x20, 0x20, 0x20, 0x20, 0x20, 0x20, 0x20,\n 0x20, 0x20, 0x20, 0x20, 0x20, 0x20, 0x20, 0x20,\n 0x20, 0x20, 0x20, 0x20, 0x20, 0x20, 0x20, 0x20,\n 0x42, 0x00, 0x02, 0x00, 0xb0, 0x04, \/\/ CODEPAGE\n 0x61, 0x01, 0x02, 0x00, 0x00, 0x00 \/\/ DSF (8+)\n};\nconst ULONG ExcDummy8_00a::nMyLen = sizeof(ExcDummy8_00a::pMyData);\n\n \/\/ TABID (8+): ExcTabid\n\nconst BYTE ExcDummy8_00b::pMyData[] = {\n 0x9c, 0x00, 0x02, 0x00, 0x0e, 0x00 \/\/ FNGROUPCOUNT\n};\nconst ULONG ExcDummy8_00b::nMyLen = sizeof(ExcDummy8_00b::pMyData);\n\n\nconst BYTE ExcDummy8_040::pMyData[] = {\n 0xaf, 0x01, 0x02, 0x00, 0x00, 0x00, \/\/ PROT4REV (8+)\n 0xbc, 0x01, 0x02, 0x00, 0x00, 0x00, \/\/ PROT4REVPASS (8+)\n\/\/ 0x3d, 0x00, 0x12, 0x00, 0xe0, 0x01, 0x5a, 0x00, 0xcf, \/\/ WINDOW1\n\/\/ 0x3f, 0x4e, 0x2a, 0x38, 0x00, 0x00, 0x00, 0x00, 0x00,\n\/\/ 0x01, 0x00, 0x58, 0x02,\n 0x40, 0x00, 0x02, 0x00, 0x00, 0x00, \/\/ BACKUP\n 0x8d, 0x00, 0x02, 0x00, 0x00, 0x00 \/\/ HIDEOBJ\n};\nconst ULONG ExcDummy8_040::nMyLen = sizeof(ExcDummy8_040::pMyData);\n\n\nconst BYTE ExcDummy8_041::pMyData[] = {\n 0x0e, 0x00, 0x02, 0x00, 0x01, 0x00, \/\/ PRECISION\n 0xb7, 0x01, 0x02, 0x00, 0x00, 0x00, \/\/ REFRESHALL (8+)\n 0xda, 0x00, 0x02, 0x00, 0x00, 0x00 \/\/ BOOKBOOL\n};\nconst ULONG ExcDummy8_041::nMyLen = sizeof(ExcDummy8_041::pMyData);\n\n\n\nconst BYTE ExcDummy8_02::pMyData[] = {\n 0x5f, 0x00, 0x02, 0x00, 0x01, 0x00 \/\/ SAVERECALC\n };\nconst ULONG ExcDummy8_02::nMyLen = sizeof(ExcDummy8_02::pMyData);\n\n\nconst BYTE XclRefmode::pMyData[] = { 0x0f, 0x00, 0x02, 0x00, 0x01, 0x00 }; \/\/ REFMODE\nconst ULONG XclRefmode::nMyLen = sizeof( XclRefmode::pMyData );\n\n\n\/\/ --- class ExcDummy8_xx --------------------------------------------\n\nULONG ExcDummy8_00a::GetLen() const\n{\n return nMyLen;\n}\n\n\nconst BYTE* ExcDummy8_00a::GetData() const\n{\n return pMyData;\n}\n\n\n\nULONG ExcDummy8_00b::GetLen() const\n{\n return nMyLen;\n}\n\n\nconst BYTE* ExcDummy8_00b::GetData() const\n{\n return pMyData;\n}\n\n\n\nULONG ExcDummy8_040::GetLen() const\n{\n return nMyLen;\n}\n\n\nconst BYTE* ExcDummy8_040::GetData() const\n{\n return pMyData;\n}\n\n\n\nULONG ExcDummy8_041::GetLen() const\n{\n return nMyLen;\n}\n\n\nconst BYTE* ExcDummy8_041::GetData() const\n{\n return pMyData;\n}\n\n\n\nULONG ExcDummy8_02::GetLen() const\n{\n return nMyLen;\n}\n\n\nconst BYTE* ExcDummy8_02::GetData() const\n{\n return pMyData;\n}\n\n\n\nULONG XclRefmode::GetLen( void ) const\n{\n return nMyLen;\n}\n\n\nconst BYTE* XclRefmode::GetData( void ) const\n{\n return pMyData;\n}\n\n\n\n<commit_msg>INTEGRATION: CWS ooo19126 (1.15.146); FILE MERGED 2005\/09\/05 15:03:15 rt 1.15.146.1: #i54170# Change license header: remove SISSL<commit_after>\/*************************************************************************\n *\n * OpenOffice.org - a multi-platform office productivity suite\n *\n * $RCSfile: xcl97dum.cxx,v $\n *\n * $Revision: 1.16 $\n *\n * last change: $Author: rt $ $Date: 2005-09-08 19:47:30 $\n *\n * The Contents of this file are made available subject to\n * the terms of GNU Lesser General Public License Version 2.1.\n *\n *\n * GNU Lesser General Public License Version 2.1\n * =============================================\n * Copyright 2005 by Sun Microsystems, Inc.\n * 901 San Antonio Road, Palo Alto, CA 94303, USA\n *\n * This library is free software; you can redistribute it and\/or\n * modify it under the terms of the GNU Lesser General Public\n * License version 2.1, as published by the Free Software Foundation.\n *\n * This library is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU\n * Lesser General Public License for more details.\n *\n * You should have received a copy of the GNU Lesser General Public\n * License along with this library; if not, write to the Free Software\n * Foundation, Inc., 59 Temple Place, Suite 330, Boston,\n * MA 02111-1307 USA\n *\n ************************************************************************\/\n\n#ifdef PCH\n#include \"filt_pch.hxx\"\n#endif\n\n#pragma hdrstop\n\n\n#include \"xcl97dum.hxx\"\n\n\n\/\/ --- ExcDummy8_xx Data ---------------------------------------------\n\n\/\/ ... (8+) := neu in Biff8, ... (8*) := anders in Biff8\n\nconst BYTE ExcDummy8_00a::pMyData[] = {\n 0xe1, 0x00, 0x02, 0x00, 0xb0, 0x04, \/\/ INTERFACEHDR\n 0xc1, 0x00, 0x02, 0x00, 0x00, 0x00, \/\/ MMS\n 0xe2, 0x00, 0x00, 0x00, \/\/ INTERFACEEND\n 0x5c, 0x00, 0x70, 0x00, \/\/ WRITEACCESS (8*)\n 0x04, 0x00, 0x00, 'C', 'a', 'l', 'c', 0x20, \/\/ \"Calc\"\n 0x20, 0x20, 0x20, 0x20, 0x20, 0x20, 0x20, 0x20,\n 0x20, 0x20, 0x20, 0x20, 0x20, 0x20, 0x20, 0x20,\n 0x20, 0x20, 0x20, 0x20, 0x20, 0x20, 0x20, 0x20,\n 0x20, 0x20, 0x20, 0x20, 0x20, 0x20, 0x20, 0x20,\n 0x20, 0x20, 0x20, 0x20, 0x20, 0x20, 0x20, 0x20,\n 0x20, 0x20, 0x20, 0x20, 0x20, 0x20, 0x20, 0x20,\n 0x20, 0x20, 0x20, 0x20, 0x20, 0x20, 0x20, 0x20,\n 0x20, 0x20, 0x20, 0x20, 0x20, 0x20, 0x20, 0x20,\n 0x20, 0x20, 0x20, 0x20, 0x20, 0x20, 0x20, 0x20,\n 0x20, 0x20, 0x20, 0x20, 0x20, 0x20, 0x20, 0x20,\n 0x20, 0x20, 0x20, 0x20, 0x20, 0x20, 0x20, 0x20,\n 0x20, 0x20, 0x20, 0x20, 0x20, 0x20, 0x20, 0x20,\n 0x20, 0x20, 0x20, 0x20, 0x20, 0x20, 0x20, 0x20,\n 0x42, 0x00, 0x02, 0x00, 0xb0, 0x04, \/\/ CODEPAGE\n 0x61, 0x01, 0x02, 0x00, 0x00, 0x00 \/\/ DSF (8+)\n};\nconst ULONG ExcDummy8_00a::nMyLen = sizeof(ExcDummy8_00a::pMyData);\n\n \/\/ TABID (8+): ExcTabid\n\nconst BYTE ExcDummy8_00b::pMyData[] = {\n 0x9c, 0x00, 0x02, 0x00, 0x0e, 0x00 \/\/ FNGROUPCOUNT\n};\nconst ULONG ExcDummy8_00b::nMyLen = sizeof(ExcDummy8_00b::pMyData);\n\n\nconst BYTE ExcDummy8_040::pMyData[] = {\n 0xaf, 0x01, 0x02, 0x00, 0x00, 0x00, \/\/ PROT4REV (8+)\n 0xbc, 0x01, 0x02, 0x00, 0x00, 0x00, \/\/ PROT4REVPASS (8+)\n\/\/ 0x3d, 0x00, 0x12, 0x00, 0xe0, 0x01, 0x5a, 0x00, 0xcf, \/\/ WINDOW1\n\/\/ 0x3f, 0x4e, 0x2a, 0x38, 0x00, 0x00, 0x00, 0x00, 0x00,\n\/\/ 0x01, 0x00, 0x58, 0x02,\n 0x40, 0x00, 0x02, 0x00, 0x00, 0x00, \/\/ BACKUP\n 0x8d, 0x00, 0x02, 0x00, 0x00, 0x00 \/\/ HIDEOBJ\n};\nconst ULONG ExcDummy8_040::nMyLen = sizeof(ExcDummy8_040::pMyData);\n\n\nconst BYTE ExcDummy8_041::pMyData[] = {\n 0x0e, 0x00, 0x02, 0x00, 0x01, 0x00, \/\/ PRECISION\n 0xb7, 0x01, 0x02, 0x00, 0x00, 0x00, \/\/ REFRESHALL (8+)\n 0xda, 0x00, 0x02, 0x00, 0x00, 0x00 \/\/ BOOKBOOL\n};\nconst ULONG ExcDummy8_041::nMyLen = sizeof(ExcDummy8_041::pMyData);\n\n\n\nconst BYTE ExcDummy8_02::pMyData[] = {\n 0x5f, 0x00, 0x02, 0x00, 0x01, 0x00 \/\/ SAVERECALC\n };\nconst ULONG ExcDummy8_02::nMyLen = sizeof(ExcDummy8_02::pMyData);\n\n\nconst BYTE XclRefmode::pMyData[] = { 0x0f, 0x00, 0x02, 0x00, 0x01, 0x00 }; \/\/ REFMODE\nconst ULONG XclRefmode::nMyLen = sizeof( XclRefmode::pMyData );\n\n\n\/\/ --- class ExcDummy8_xx --------------------------------------------\n\nULONG ExcDummy8_00a::GetLen() const\n{\n return nMyLen;\n}\n\n\nconst BYTE* ExcDummy8_00a::GetData() const\n{\n return pMyData;\n}\n\n\n\nULONG ExcDummy8_00b::GetLen() const\n{\n return nMyLen;\n}\n\n\nconst BYTE* ExcDummy8_00b::GetData() const\n{\n return pMyData;\n}\n\n\n\nULONG ExcDummy8_040::GetLen() const\n{\n return nMyLen;\n}\n\n\nconst BYTE* ExcDummy8_040::GetData() const\n{\n return pMyData;\n}\n\n\n\nULONG ExcDummy8_041::GetLen() const\n{\n return nMyLen;\n}\n\n\nconst BYTE* ExcDummy8_041::GetData() const\n{\n return pMyData;\n}\n\n\n\nULONG ExcDummy8_02::GetLen() const\n{\n return nMyLen;\n}\n\n\nconst BYTE* ExcDummy8_02::GetData() const\n{\n return pMyData;\n}\n\n\n\nULONG XclRefmode::GetLen( void ) const\n{\n return nMyLen;\n}\n\n\nconst BYTE* XclRefmode::GetData( void ) const\n{\n return pMyData;\n}\n\n\n\n<|endoftext|>"} {"text":"<commit_before>\/******************************************************************************\n * The MIT License (MIT)\n * \n * Copyright (c) 2014 Crytek\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 \"replay\/renderdoc.h\"\n#include \"replay\/replay_renderer.h\"\n#include \"core\/core.h\"\n#include \"os\/os_specific.h\"\n#include \"serialise\/serialiser.h\"\n#include \"socket_helpers.h\"\n#include \"replay_proxy.h\"\n\n#include <utility>\nusing std::pair;\n\nenum PacketType\n{\n\tePacket_Noop,\n\tePacket_RemoteDriverList,\n\tePacket_CopyCapture,\n\tePacket_LogOpenProgress,\n\tePacket_LogReady,\n};\n\nstruct ProgressLoopData\n{\n\tNetwork::Socket *sock;\n\tfloat progress;\n\tbool killsignal;\n};\n\nstatic void ProgressTicker(void *d)\n{\n\tProgressLoopData *data = (ProgressLoopData *)d;\n\t\n\tSerialiser ser(L\"\", Serialiser::WRITING, false);\n\t\t\n\twhile(!data->killsignal)\n\t{\n\t\tser.Rewind();\n\t\tser.Serialise(\"\", data->progress);\n\n\t\tif(!SendPacket(data->sock, ePacket_LogOpenProgress, ser))\n\t\t{\n\t\t\tSAFE_DELETE(data->sock);\n\t\t\tbreak;\n\t\t}\n\t\tThreading::Sleep(100);\n\t}\n}\n\nvoid RenderDoc::BecomeReplayHost(volatile bool &killReplay)\n{\n\tNetwork::Socket *sock = Network::CreateServerSocket(\"0.0.0.0\", RenderDoc_ReplayNetworkPort, 1);\n\n\tif(sock == NULL)\n\t\treturn;\n\t\n\tSerialiser ser(L\"\", Serialiser::WRITING, false);\n\n\tbool newlyReady = true;\n\t\t\n\twhile(!killReplay)\n\t{\n\t\tif(newlyReady)\n\t\t{\n\t\t\tRDCLOG(\"Replay host ready for requests.\");\n\t\t\tnewlyReady = false;\n\t\t}\n\t\t\n\t\tNetwork::Socket *client = sock->AcceptClient(false);\n\n\t\tif(client == NULL)\n\t\t{\n\t\t\tif(!sock->Connected())\n\t\t\t{\n\t\t\t\tRDCERR(\"Error in accept - shutting down server\");\n\n\t\t\t\tSAFE_DELETE(sock);\n\t\t\t\treturn;\n\t\t\t}\n\n\t\t\tThreading::Sleep(5);\n\n\t\t\tcontinue;\n\t\t}\n\n\t\tnewlyReady = true;\n\n\t\tRDCLOG(\"Connection received.\");\n\t\t\n\t\tmap<RDCDriver,wstring> drivers = RenderDoc::Inst().GetRemoteDrivers();\n\n\t\tuint32_t count = (uint32_t)drivers.size();\n\t\tser.Serialise(\"\", count);\n\n\t\tfor(auto it=drivers.begin(); it != drivers.end(); ++it)\n\t\t{\n\t\t\tRDCDriver driver = it->first;\n\t\t\tser.Serialise(\"\", driver);\n\t\t\tser.Serialise(\"\", (*it).second);\n\t\t}\n\n\t\tif(!SendPacket(client, ePacket_RemoteDriverList, ser))\n\t\t{\n\t\t\tRDCERR(\"Network error sending supported driver list\");\n\t\t\tSAFE_DELETE(client);\n\t\t\tcontinue;\n\t\t}\n\n\t\tThreading::Sleep(4);\n\n\t\t\/\/ don't care about the result, just want to check that the socket hasn't been gracefully shut down\n\t\tclient->IsRecvDataWaiting();\n\t\tif(!client->Connected())\n\t\t{\n\t\t\tRDCLOG(\"Connection closed after sending remote driver list\");\n\t\t\tSAFE_DELETE(client);\n\t\t\tcontinue;\n\t\t}\n\n\t\twstring cap_file;\n\t\twstring dummy, dummy2;\n\t\tFileIO::GetDefaultFiles(L\"remotecopy\", cap_file, dummy, dummy2);\n\n\t\tSerialiser *ser = NULL;\n\n\t\tif(!RecvChunkedFile(client, ePacket_CopyCapture, cap_file.c_str(), ser, NULL))\n\t\t{\n\t\t\tFileIO::UnlinkFileW(cap_file.c_str());\n\t\t\t\n\t\t\tRDCERR(\"Network error receiving file\");\n\n\t\t\tSAFE_DELETE(ser);\n\t\t\tSAFE_DELETE(client);\n\t\t\tcontinue;\n\t\t}\n\t\t\n\t\tRDCLOG(\"File received.\");\n\t\t\n\t\tSAFE_DELETE(ser);\n\n\t\tRDCDriver driverType = RDC_Unknown;\n\t\twstring driverName = L\"\";\n\t\tRenderDoc::Inst().FillInitParams(cap_file.c_str(), driverType, driverName, NULL);\n\n\t\tif(RenderDoc::Inst().HasRemoteDriver(driverType))\n\t\t{\n\t\t\tProgressLoopData data;\n\n\t\t\tdata.sock = client;\n\t\t\tdata.killsignal = false;\n\t\t\tdata.progress = 0.0f;\n\n\t\t\tRenderDoc::Inst().SetProgressPtr(&data.progress);\n\n\t\t\tThreading::ThreadHandle ticker = Threading::CreateThread(ProgressTicker, &data);\n\n\t\t\tIRemoteDriver *driver = NULL;\n\t\t\tauto status = RenderDoc::Inst().CreateRemoteDriver(driverType, cap_file.c_str(), &driver);\n\n\t\t\tif(status != eReplayCreate_Success || driver == NULL)\n\t\t\t{\n\t\t\t\tRDCERR(\"Failed to create remote driver for driver type %d name %ls\", driverType, driverName.c_str());\n\t\t\t\tSAFE_DELETE(ser);\n\t\t\t\tSAFE_DELETE(client);\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t\n\t\t\tdriver->ReadLogInitialisation();\n\t\n\t\t\tRenderDoc::Inst().SetProgressPtr(NULL);\n\n\t\t\tdata.killsignal = true;\n\t\t\tThreading::JoinThread(ticker);\n\t\t\tThreading::CloseThread(ticker);\n\n\t\t\tFileIO::UnlinkFileW(cap_file.c_str());\n\n\t\t\tSendPacket(client, ePacket_LogReady);\n\n\t\t\tProxySerialiser *proxy = new ProxySerialiser(client, driver);\n\n\t\t\twhile(client)\n\t\t\t{\n\t\t\t\tif(!proxy->Tick() || killReplay)\n\t\t\t\t{\n\t\t\t\t\tSAFE_DELETE(client);\n\t\t\t\t}\n\t\t\t}\n\t\t\t\n\t\t\tdriver->Shutdown();\n\t\t\t\n\t\t\tRDCLOG(\"Closing replay connection\");\n\n\t\t\tSAFE_DELETE(proxy);\n\t\t\tSAFE_DELETE(client);\n\t\t}\n\t\telse\n\t\t{\n\t\t\tRDCERR(\"File needs driver for %ls which isn't supported!\", driverName.c_str());\n\t\t\n\t\t\tFileIO::UnlinkFileW(cap_file.c_str());\n\t\t}\n\n\t\tSAFE_DELETE(client);\n\t}\n}\n\nstruct RemoteRenderer\n{\n\tpublic:\n\t\tRemoteRenderer(Network::Socket *sock)\n\t\t\t: m_Socket(sock)\n\t\t{\n\t\t\tmap<RDCDriver,wstring> m = RenderDoc::Inst().GetReplayDrivers();\n\n\t\t\tm_Proxies.reserve(m.size());\n\t\t\tfor(auto it=m.begin(); it != m.end(); ++it) m_Proxies.push_back(*it);\n\t\t\t\n\t\t\t{\n\t\t\t\tPacketType type;\n\t\t\t\tSerialiser *ser = NULL;\n\t\t\t\tGetPacket(type, &ser);\n\n\t\t\t\tm.clear();\n\n\t\t\t\tif(ser)\n\t\t\t\t{\n\t\t\t\t\tuint32_t count = 0;\n\t\t\t\t\tser->Serialise(\"\", count);\n\n\t\t\t\t\tfor(uint32_t i=0; i < count; i++)\n\t\t\t\t\t{\n\t\t\t\t\t\tRDCDriver driver = RDC_Unknown;\n\t\t\t\t\t\twstring name = L\"\";\n\t\t\t\t\t\tser->Serialise(\"\", driver);\n\t\t\t\t\t\tser->Serialise(\"\", name);\n\n\t\t\t\t\t\tm[driver] = name;\n\t\t\t\t\t}\n\n\t\t\t\t\tdelete ser;\n\t\t\t\t}\n\t\t\t}\n\n\t\t\tm_RemoteDrivers.reserve(m.size());\n\t\t\tfor(auto it=m.begin(); it != m.end(); ++it) m_RemoteDrivers.push_back(*it);\n\n\t\t\tm_ProxyDriver = NULL;\n\t\t\tm_ProxySerialiser = NULL;\n\t\t}\n\t\t~RemoteRenderer()\n\t\t{\n\t\t\tSAFE_DELETE(m_ProxySerialiser);\n\t\t\tSAFE_DELETE(m_Socket);\n\t\t}\n\n\t\tvoid Shutdown()\n\t\t{\n\t\t\tdelete this;\n\t\t}\n\n\t\tbool Connected() { return m_Socket != NULL && m_Socket->Connected(); }\n\t\t\n\t\tbool LocalProxies(rdctype::array<rdctype::wstr> *out)\n\t\t{\n\t\t\tif(out == NULL) return false;\n\n\t\t\tcreate_array_uninit(*out, m_Proxies.size());\n\n\t\t\tsize_t i=0;\n\t\t\tfor(auto it=m_Proxies.begin(); it != m_Proxies.end(); ++it, ++i)\n\t\t\t\tout->elems[i] = it->second;\n\n\t\t\treturn true;\n\t\t}\n\t\t\n\t\tbool RemoteSupportedReplays(rdctype::array<rdctype::wstr> *out)\n\t\t{\n\t\t\tif(out == NULL) return false;\n\t\t\t\n\t\t\tcreate_array_uninit(*out, m_RemoteDrivers.size());\n\n\t\t\tsize_t i=0;\n\t\t\tfor(auto it=m_RemoteDrivers.begin(); it != m_RemoteDrivers.end(); ++it, ++i)\n\t\t\t\tout->elems[i] = it->second;\n\n\t\t\treturn true;\n\t\t}\n\n\t\tReplayCreateStatus CreateProxyRenderer(uint32_t proxyid, const wchar_t *logfile, float *progress, ReplayRenderer **rend)\n\t\t{\n\t\t\tif(rend == NULL) return eReplayCreate_InternalError;\n\n\t\t\tif(proxyid >= m_Proxies.size())\n\t\t\t{\n\t\t\t\tRDCERR(\"Invalid proxy driver id %d specified for remote renderer\", proxyid);\n\t\t\t\treturn eReplayCreate_InternalError;\n\t\t\t}\n\t\t\t\n\t\t\tfloat dummy = 0.0f;\n\t\t\tif(progress == NULL)\n\t\t\t\tprogress = &dummy;\n\n\t\t\tRDCDriver proxydriver = m_Proxies[proxyid].first;\n\n\t\t\tSerialiser ser(L\"\", Serialiser::WRITING, false);\n\t\t\n\t\t\tif(!SendChunkedFile(m_Socket, ePacket_CopyCapture, logfile, ser, progress))\n\t\t\t{\n\t\t\t\tSAFE_DELETE(m_Socket);\n\t\t\t\treturn eReplayCreate_NetworkIOFailed;\n\t\t\t}\n\n\t\t\tRDCLOG(\"Sent file to replay host. Loading...\");\n\t\t\t\n\t\t\tPacketType type = ePacket_Noop;\n\t\t\twhile(m_Socket)\n\t\t\t{\n\t\t\t\tSerialiser *ser;\n\t\t\t\tGetPacket(type, &ser);\n\n\t\t\t\tif(!m_Socket || type != ePacket_LogOpenProgress) break;\n\n\t\t\t\tser->Serialise(\"\", *progress);\n\n\t\t\t\tRDCLOG(\"% 3.0f%%...\", (*progress)*100.0f);\n\t\t\t}\n\n\t\t\tif(!m_Socket || type != ePacket_LogReady)\n\t\t\t\treturn eReplayCreate_NetworkIOFailed;\n\n\t\t\t*progress = 1.0f;\n\n\t\t\tRDCLOG(\"Log ready on replay host\");\n\n\t\t\tm_ProxyDriver = NULL;\n\t\t\tauto status = RenderDoc::Inst().CreateReplayDriver(proxydriver, NULL, &m_ProxyDriver);\n\n\t\t\tif(status != eReplayCreate_Success || !m_ProxyDriver)\n\t\t\t\treturn status;\n\n\t\t\tReplayRenderer *ret = new ReplayRenderer();\n\n\t\t\tm_ProxySerialiser = new ProxySerialiser(m_Socket, m_ProxyDriver);\n\t\t\tstatus = ret->SetDevice(m_ProxySerialiser);\n\n\t\t\tif(status != eReplayCreate_Success)\n\t\t\t{\n\t\t\t\tSAFE_DELETE(ret);\n\t\t\t\tSAFE_DELETE(m_ProxySerialiser);\n\t\t\t\treturn status;\n\t\t\t}\n\n\t\t\t*rend = ret;\n\n\t\t\treturn eReplayCreate_Success;\n\t\t}\n\tprivate:\n\t\tNetwork::Socket *m_Socket;\n\t\t\n\t\tvoid GetPacket(PacketType &type, Serialiser **ser)\n\t\t{\n\t\t\tvector<byte> payload;\n\n\t\t\tif(!RecvPacket(m_Socket, type, payload))\n\t\t\t{\n\t\t\t\tSAFE_DELETE(m_Socket);\n\t\t\t\tif(ser) *ser = NULL;\n\t\t\t\treturn;\n\t\t\t}\n\n\t\t\tif(ser)\t*ser = new Serialiser(payload.size(), &payload[0], false);\n\t\t}\n\n\t\tIReplayDriver *m_ProxyDriver;\n\t\tProxySerialiser *m_ProxySerialiser;\n\n\t\tvector< pair<RDCDriver, wstring> > m_Proxies;\n\t\tvector< pair<RDCDriver, wstring> > m_RemoteDrivers;\n};\n\nextern \"C\" RENDERDOC_API void RENDERDOC_CC RemoteRenderer_Shutdown(RemoteRenderer *remote)\n{\tremote->Shutdown(); }\n\nextern \"C\" RENDERDOC_API bool RENDERDOC_CC RemoteRenderer_LocalProxies(RemoteRenderer *remote, rdctype::array<rdctype::wstr> *out)\n{ return remote->LocalProxies(out); }\n\nextern \"C\" RENDERDOC_API bool RENDERDOC_CC RemoteRenderer_RemoteSupportedReplays(RemoteRenderer *remote, rdctype::array<rdctype::wstr> *out)\n{ return remote->RemoteSupportedReplays(out); }\n\nextern \"C\" RENDERDOC_API ReplayCreateStatus RENDERDOC_CC RemoteRenderer_CreateProxyRenderer(RemoteRenderer *remote, uint32_t proxyid, const wchar_t *logfile, float *progress, ReplayRenderer **rend)\n{ return remote->CreateProxyRenderer(proxyid, logfile, progress, rend); }\n\nextern \"C\" RENDERDOC_API\nReplayCreateStatus RENDERDOC_CC RENDERDOC_CreateRemoteReplayConnection(const wchar_t *host, RemoteRenderer **rend)\n{\n\tif(rend == NULL) return eReplayCreate_InternalError;\n\n\twstring s = L\"localhost\";\n\tif(host != NULL && host[0] != L'\\0')\n\t\ts = host;\n\t\n\tNetwork::Socket *sock = NULL;\n\t\n\tif(s != L\"-\")\n\t{\n\t\tsock = Network::CreateClientSocket(s.c_str(), RenderDoc_ReplayNetworkPort, 3000);\n\n\t\tif(sock == NULL)\n\t\t\treturn eReplayCreate_NetworkIOFailed;\n\t}\n\t\n\t*rend = new RemoteRenderer(sock);\n\n\treturn eReplayCreate_Success;\n}\n<commit_msg>ReplayRenderer takes over ownership of ProxySerialiser<commit_after>\/******************************************************************************\n * The MIT License (MIT)\n * \n * Copyright (c) 2014 Crytek\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 \"replay\/renderdoc.h\"\n#include \"replay\/replay_renderer.h\"\n#include \"core\/core.h\"\n#include \"os\/os_specific.h\"\n#include \"serialise\/serialiser.h\"\n#include \"socket_helpers.h\"\n#include \"replay_proxy.h\"\n\n#include <utility>\nusing std::pair;\n\nenum PacketType\n{\n\tePacket_Noop,\n\tePacket_RemoteDriverList,\n\tePacket_CopyCapture,\n\tePacket_LogOpenProgress,\n\tePacket_LogReady,\n};\n\nstruct ProgressLoopData\n{\n\tNetwork::Socket *sock;\n\tfloat progress;\n\tbool killsignal;\n};\n\nstatic void ProgressTicker(void *d)\n{\n\tProgressLoopData *data = (ProgressLoopData *)d;\n\t\n\tSerialiser ser(L\"\", Serialiser::WRITING, false);\n\t\t\n\twhile(!data->killsignal)\n\t{\n\t\tser.Rewind();\n\t\tser.Serialise(\"\", data->progress);\n\n\t\tif(!SendPacket(data->sock, ePacket_LogOpenProgress, ser))\n\t\t{\n\t\t\tSAFE_DELETE(data->sock);\n\t\t\tbreak;\n\t\t}\n\t\tThreading::Sleep(100);\n\t}\n}\n\nvoid RenderDoc::BecomeReplayHost(volatile bool &killReplay)\n{\n\tNetwork::Socket *sock = Network::CreateServerSocket(\"0.0.0.0\", RenderDoc_ReplayNetworkPort, 1);\n\n\tif(sock == NULL)\n\t\treturn;\n\t\n\tSerialiser ser(L\"\", Serialiser::WRITING, false);\n\n\tbool newlyReady = true;\n\t\t\n\twhile(!killReplay)\n\t{\n\t\tif(newlyReady)\n\t\t{\n\t\t\tRDCLOG(\"Replay host ready for requests.\");\n\t\t\tnewlyReady = false;\n\t\t}\n\t\t\n\t\tNetwork::Socket *client = sock->AcceptClient(false);\n\n\t\tif(client == NULL)\n\t\t{\n\t\t\tif(!sock->Connected())\n\t\t\t{\n\t\t\t\tRDCERR(\"Error in accept - shutting down server\");\n\n\t\t\t\tSAFE_DELETE(sock);\n\t\t\t\treturn;\n\t\t\t}\n\n\t\t\tThreading::Sleep(5);\n\n\t\t\tcontinue;\n\t\t}\n\n\t\tnewlyReady = true;\n\n\t\tRDCLOG(\"Connection received.\");\n\t\t\n\t\tmap<RDCDriver,wstring> drivers = RenderDoc::Inst().GetRemoteDrivers();\n\n\t\tuint32_t count = (uint32_t)drivers.size();\n\t\tser.Serialise(\"\", count);\n\n\t\tfor(auto it=drivers.begin(); it != drivers.end(); ++it)\n\t\t{\n\t\t\tRDCDriver driver = it->first;\n\t\t\tser.Serialise(\"\", driver);\n\t\t\tser.Serialise(\"\", (*it).second);\n\t\t}\n\n\t\tif(!SendPacket(client, ePacket_RemoteDriverList, ser))\n\t\t{\n\t\t\tRDCERR(\"Network error sending supported driver list\");\n\t\t\tSAFE_DELETE(client);\n\t\t\tcontinue;\n\t\t}\n\n\t\tThreading::Sleep(4);\n\n\t\t\/\/ don't care about the result, just want to check that the socket hasn't been gracefully shut down\n\t\tclient->IsRecvDataWaiting();\n\t\tif(!client->Connected())\n\t\t{\n\t\t\tRDCLOG(\"Connection closed after sending remote driver list\");\n\t\t\tSAFE_DELETE(client);\n\t\t\tcontinue;\n\t\t}\n\n\t\twstring cap_file;\n\t\twstring dummy, dummy2;\n\t\tFileIO::GetDefaultFiles(L\"remotecopy\", cap_file, dummy, dummy2);\n\n\t\tSerialiser *ser = NULL;\n\n\t\tif(!RecvChunkedFile(client, ePacket_CopyCapture, cap_file.c_str(), ser, NULL))\n\t\t{\n\t\t\tFileIO::UnlinkFileW(cap_file.c_str());\n\t\t\t\n\t\t\tRDCERR(\"Network error receiving file\");\n\n\t\t\tSAFE_DELETE(ser);\n\t\t\tSAFE_DELETE(client);\n\t\t\tcontinue;\n\t\t}\n\t\t\n\t\tRDCLOG(\"File received.\");\n\t\t\n\t\tSAFE_DELETE(ser);\n\n\t\tRDCDriver driverType = RDC_Unknown;\n\t\twstring driverName = L\"\";\n\t\tRenderDoc::Inst().FillInitParams(cap_file.c_str(), driverType, driverName, NULL);\n\n\t\tif(RenderDoc::Inst().HasRemoteDriver(driverType))\n\t\t{\n\t\t\tProgressLoopData data;\n\n\t\t\tdata.sock = client;\n\t\t\tdata.killsignal = false;\n\t\t\tdata.progress = 0.0f;\n\n\t\t\tRenderDoc::Inst().SetProgressPtr(&data.progress);\n\n\t\t\tThreading::ThreadHandle ticker = Threading::CreateThread(ProgressTicker, &data);\n\n\t\t\tIRemoteDriver *driver = NULL;\n\t\t\tauto status = RenderDoc::Inst().CreateRemoteDriver(driverType, cap_file.c_str(), &driver);\n\n\t\t\tif(status != eReplayCreate_Success || driver == NULL)\n\t\t\t{\n\t\t\t\tRDCERR(\"Failed to create remote driver for driver type %d name %ls\", driverType, driverName.c_str());\n\t\t\t\tSAFE_DELETE(ser);\n\t\t\t\tSAFE_DELETE(client);\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t\n\t\t\tdriver->ReadLogInitialisation();\n\t\n\t\t\tRenderDoc::Inst().SetProgressPtr(NULL);\n\n\t\t\tdata.killsignal = true;\n\t\t\tThreading::JoinThread(ticker);\n\t\t\tThreading::CloseThread(ticker);\n\n\t\t\tFileIO::UnlinkFileW(cap_file.c_str());\n\n\t\t\tSendPacket(client, ePacket_LogReady);\n\n\t\t\tProxySerialiser *proxy = new ProxySerialiser(client, driver);\n\n\t\t\twhile(client)\n\t\t\t{\n\t\t\t\tif(!proxy->Tick() || killReplay)\n\t\t\t\t{\n\t\t\t\t\tSAFE_DELETE(client);\n\t\t\t\t}\n\t\t\t}\n\t\t\t\n\t\t\tdriver->Shutdown();\n\t\t\t\n\t\t\tRDCLOG(\"Closing replay connection\");\n\n\t\t\tSAFE_DELETE(proxy);\n\t\t\tSAFE_DELETE(client);\n\t\t}\n\t\telse\n\t\t{\n\t\t\tRDCERR(\"File needs driver for %ls which isn't supported!\", driverName.c_str());\n\t\t\n\t\t\tFileIO::UnlinkFileW(cap_file.c_str());\n\t\t}\n\n\t\tSAFE_DELETE(client);\n\t}\n}\n\nstruct RemoteRenderer\n{\n\tpublic:\n\t\tRemoteRenderer(Network::Socket *sock)\n\t\t\t: m_Socket(sock)\n\t\t{\n\t\t\tmap<RDCDriver,wstring> m = RenderDoc::Inst().GetReplayDrivers();\n\n\t\t\tm_Proxies.reserve(m.size());\n\t\t\tfor(auto it=m.begin(); it != m.end(); ++it) m_Proxies.push_back(*it);\n\t\t\t\n\t\t\t{\n\t\t\t\tPacketType type;\n\t\t\t\tSerialiser *ser = NULL;\n\t\t\t\tGetPacket(type, &ser);\n\n\t\t\t\tm.clear();\n\n\t\t\t\tif(ser)\n\t\t\t\t{\n\t\t\t\t\tuint32_t count = 0;\n\t\t\t\t\tser->Serialise(\"\", count);\n\n\t\t\t\t\tfor(uint32_t i=0; i < count; i++)\n\t\t\t\t\t{\n\t\t\t\t\t\tRDCDriver driver = RDC_Unknown;\n\t\t\t\t\t\twstring name = L\"\";\n\t\t\t\t\t\tser->Serialise(\"\", driver);\n\t\t\t\t\t\tser->Serialise(\"\", name);\n\n\t\t\t\t\t\tm[driver] = name;\n\t\t\t\t\t}\n\n\t\t\t\t\tdelete ser;\n\t\t\t\t}\n\t\t\t}\n\n\t\t\tm_RemoteDrivers.reserve(m.size());\n\t\t\tfor(auto it=m.begin(); it != m.end(); ++it) m_RemoteDrivers.push_back(*it);\n\n\t\t\tm_ProxyDriver = NULL;\n\t\t}\n\t\t~RemoteRenderer()\n\t\t{\n\t\t\tSAFE_DELETE(m_Socket);\n\t\t}\n\n\t\tvoid Shutdown()\n\t\t{\n\t\t\tdelete this;\n\t\t}\n\n\t\tbool Connected() { return m_Socket != NULL && m_Socket->Connected(); }\n\t\t\n\t\tbool LocalProxies(rdctype::array<rdctype::wstr> *out)\n\t\t{\n\t\t\tif(out == NULL) return false;\n\n\t\t\tcreate_array_uninit(*out, m_Proxies.size());\n\n\t\t\tsize_t i=0;\n\t\t\tfor(auto it=m_Proxies.begin(); it != m_Proxies.end(); ++it, ++i)\n\t\t\t\tout->elems[i] = it->second;\n\n\t\t\treturn true;\n\t\t}\n\t\t\n\t\tbool RemoteSupportedReplays(rdctype::array<rdctype::wstr> *out)\n\t\t{\n\t\t\tif(out == NULL) return false;\n\t\t\t\n\t\t\tcreate_array_uninit(*out, m_RemoteDrivers.size());\n\n\t\t\tsize_t i=0;\n\t\t\tfor(auto it=m_RemoteDrivers.begin(); it != m_RemoteDrivers.end(); ++it, ++i)\n\t\t\t\tout->elems[i] = it->second;\n\n\t\t\treturn true;\n\t\t}\n\n\t\tReplayCreateStatus CreateProxyRenderer(uint32_t proxyid, const wchar_t *logfile, float *progress, ReplayRenderer **rend)\n\t\t{\n\t\t\tif(rend == NULL) return eReplayCreate_InternalError;\n\n\t\t\tif(proxyid >= m_Proxies.size())\n\t\t\t{\n\t\t\t\tRDCERR(\"Invalid proxy driver id %d specified for remote renderer\", proxyid);\n\t\t\t\treturn eReplayCreate_InternalError;\n\t\t\t}\n\t\t\t\n\t\t\tfloat dummy = 0.0f;\n\t\t\tif(progress == NULL)\n\t\t\t\tprogress = &dummy;\n\n\t\t\tRDCDriver proxydriver = m_Proxies[proxyid].first;\n\n\t\t\tSerialiser ser(L\"\", Serialiser::WRITING, false);\n\t\t\n\t\t\tif(!SendChunkedFile(m_Socket, ePacket_CopyCapture, logfile, ser, progress))\n\t\t\t{\n\t\t\t\tSAFE_DELETE(m_Socket);\n\t\t\t\treturn eReplayCreate_NetworkIOFailed;\n\t\t\t}\n\n\t\t\tRDCLOG(\"Sent file to replay host. Loading...\");\n\t\t\t\n\t\t\tPacketType type = ePacket_Noop;\n\t\t\twhile(m_Socket)\n\t\t\t{\n\t\t\t\tSerialiser *ser;\n\t\t\t\tGetPacket(type, &ser);\n\n\t\t\t\tif(!m_Socket || type != ePacket_LogOpenProgress) break;\n\n\t\t\t\tser->Serialise(\"\", *progress);\n\n\t\t\t\tRDCLOG(\"% 3.0f%%...\", (*progress)*100.0f);\n\t\t\t}\n\n\t\t\tif(!m_Socket || type != ePacket_LogReady)\n\t\t\t\treturn eReplayCreate_NetworkIOFailed;\n\n\t\t\t*progress = 1.0f;\n\n\t\t\tRDCLOG(\"Log ready on replay host\");\n\n\t\t\tm_ProxyDriver = NULL;\n\t\t\tauto status = RenderDoc::Inst().CreateReplayDriver(proxydriver, NULL, &m_ProxyDriver);\n\n\t\t\tif(status != eReplayCreate_Success || !m_ProxyDriver)\n\t\t\t\treturn status;\n\n\t\t\tReplayRenderer *ret = new ReplayRenderer();\n\n\t\t\tProxySerialiser *proxy = new ProxySerialiser(m_Socket, m_ProxyDriver);\n\t\t\tstatus = ret->SetDevice(proxy);\n\n\t\t\tif(status != eReplayCreate_Success)\n\t\t\t{\n\t\t\t\tSAFE_DELETE(ret);\n\t\t\t\tSAFE_DELETE(proxy);\n\t\t\t\treturn status;\n\t\t\t}\n\t\t\t\n\t\t\t\/\/ ReplayRenderer takes ownership of the ProxySerialiser (as IReplayDriver)\n\t\t\t\/\/ and it cleans itself up in Shutdown.\n\n\t\t\t*rend = ret;\n\n\t\t\treturn eReplayCreate_Success;\n\t\t}\n\tprivate:\n\t\tNetwork::Socket *m_Socket;\n\t\t\n\t\tvoid GetPacket(PacketType &type, Serialiser **ser)\n\t\t{\n\t\t\tvector<byte> payload;\n\n\t\t\tif(!RecvPacket(m_Socket, type, payload))\n\t\t\t{\n\t\t\t\tSAFE_DELETE(m_Socket);\n\t\t\t\tif(ser) *ser = NULL;\n\t\t\t\treturn;\n\t\t\t}\n\n\t\t\tif(ser)\t*ser = new Serialiser(payload.size(), &payload[0], false);\n\t\t}\n\n\t\tIReplayDriver *m_ProxyDriver;\n\n\t\tvector< pair<RDCDriver, wstring> > m_Proxies;\n\t\tvector< pair<RDCDriver, wstring> > m_RemoteDrivers;\n};\n\nextern \"C\" RENDERDOC_API void RENDERDOC_CC RemoteRenderer_Shutdown(RemoteRenderer *remote)\n{\tremote->Shutdown(); }\n\nextern \"C\" RENDERDOC_API bool RENDERDOC_CC RemoteRenderer_LocalProxies(RemoteRenderer *remote, rdctype::array<rdctype::wstr> *out)\n{ return remote->LocalProxies(out); }\n\nextern \"C\" RENDERDOC_API bool RENDERDOC_CC RemoteRenderer_RemoteSupportedReplays(RemoteRenderer *remote, rdctype::array<rdctype::wstr> *out)\n{ return remote->RemoteSupportedReplays(out); }\n\nextern \"C\" RENDERDOC_API ReplayCreateStatus RENDERDOC_CC RemoteRenderer_CreateProxyRenderer(RemoteRenderer *remote, uint32_t proxyid, const wchar_t *logfile, float *progress, ReplayRenderer **rend)\n{ return remote->CreateProxyRenderer(proxyid, logfile, progress, rend); }\n\nextern \"C\" RENDERDOC_API\nReplayCreateStatus RENDERDOC_CC RENDERDOC_CreateRemoteReplayConnection(const wchar_t *host, RemoteRenderer **rend)\n{\n\tif(rend == NULL) return eReplayCreate_InternalError;\n\n\twstring s = L\"localhost\";\n\tif(host != NULL && host[0] != L'\\0')\n\t\ts = host;\n\t\n\tNetwork::Socket *sock = NULL;\n\t\n\tif(s != L\"-\")\n\t{\n\t\tsock = Network::CreateClientSocket(s.c_str(), RenderDoc_ReplayNetworkPort, 3000);\n\n\t\tif(sock == NULL)\n\t\t\treturn eReplayCreate_NetworkIOFailed;\n\t}\n\t\n\t*rend = new RemoteRenderer(sock);\n\n\treturn eReplayCreate_Success;\n}\n<|endoftext|>"} {"text":"<commit_before><commit_msg>dr78: #i43040# correction for BesselI, patch from Regina<commit_after><|endoftext|>"} {"text":"<commit_before>\/\/ This file is part of Eigen, a lightweight C++ template library\n\/\/ for linear algebra.\n\/\/\n\/\/ Copyright (C) 2008-2009 Gael Guennebaud <gael.guennebaud@inria.fr>\n\/\/\n\/\/ Eigen is free software; you can redistribute it and\/or\n\/\/ modify it under the terms of the GNU Lesser General Public\n\/\/ License as published by the Free Software Foundation; either\n\/\/ version 3 of the License, or (at your option) any later version.\n\/\/\n\/\/ Alternatively, you can redistribute it and\/or\n\/\/ modify it under the terms of the GNU General Public License as\n\/\/ published by the Free Software Foundation; either version 2 of\n\/\/ the License, or (at your option) any later version.\n\/\/\n\/\/ Eigen is distributed in the hope that it will be useful, but WITHOUT ANY\n\/\/ WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS\n\/\/ FOR A PARTICULAR PURPOSE. See the GNU Lesser General Public License or the\n\/\/ GNU General Public License for more details.\n\/\/\n\/\/ You should have received a copy of the GNU Lesser General Public\n\/\/ License and a copy of the GNU General Public License along with\n\/\/ Eigen. If not, see <http:\/\/www.gnu.org\/licenses\/>.\n\n#include \"main.h\"\n\ntemplate<typename ArrayType> void array(const ArrayType& m)\n{\n typedef typename ArrayType::Index Index;\n typedef typename ArrayType::Scalar Scalar;\n typedef typename NumTraits<Scalar>::Real RealScalar;\n typedef Array<Scalar, ArrayType::RowsAtCompileTime, 1> ColVectorType;\n typedef Array<Scalar, 1, ArrayType::ColsAtCompileTime> RowVectorType;\n\n Index rows = m.rows();\n Index cols = m.cols(); \n\n ArrayType m1 = ArrayType::Random(rows, cols),\n m2 = ArrayType::Random(rows, cols),\n m3(rows, cols);\n\n ColVectorType cv1 = ColVectorType::Random(rows);\n RowVectorType rv1 = RowVectorType::Random(cols);\n\n Scalar s1 = internal::random<Scalar>(),\n s2 = internal::random<Scalar>(); \n\n \/\/ scalar addition\n VERIFY_IS_APPROX(m1 + s1, s1 + m1);\n VERIFY_IS_APPROX(m1 + s1, ArrayType::Constant(rows,cols,s1) + m1);\n VERIFY_IS_APPROX(s1 - m1, (-m1)+s1 );\n VERIFY_IS_APPROX(m1 - s1, m1 - ArrayType::Constant(rows,cols,s1));\n VERIFY_IS_APPROX(s1 - m1, ArrayType::Constant(rows,cols,s1) - m1);\n VERIFY_IS_APPROX((m1*Scalar(2)) - s2, (m1+m1) - ArrayType::Constant(rows,cols,s2) );\n m3 = m1;\n m3 += s2;\n VERIFY_IS_APPROX(m3, m1 + s2);\n m3 = m1;\n m3 -= s1;\n VERIFY_IS_APPROX(m3, m1 - s1); \n \n \/\/ scalar operators via Maps\n m3 = m1;\n ArrayType::Map(m1.data(), m1.rows(), m1.cols()) -= ArrayType::Map(m2.data(), m2.rows(), m2.cols());\n VERIFY_IS_APPROX(m1, m3 - m2);\n \n m3 = m1;\n ArrayType::Map(m1.data(), m1.rows(), m1.cols()) += ArrayType::Map(m2.data(), m2.rows(), m2.cols());\n VERIFY_IS_APPROX(m1, m3 + m2);\n \n m3 = m1;\n ArrayType::Map(m1.data(), m1.rows(), m1.cols()) *= ArrayType::Map(m2.data(), m2.rows(), m2.cols());\n VERIFY_IS_APPROX(m1, m3 * m2);\n \n m3 = m1;\n m2 = ArrayType::Random(rows,cols);\n m2 = (m2==0).select(1,m2);\n ArrayType::Map(m1.data(), m1.rows(), m1.cols()) \/= ArrayType::Map(m2.data(), m2.rows(), m2.cols()); \n VERIFY_IS_APPROX(m1, m3 \/ m2);\n\n \/\/ reductions\n VERIFY_IS_APPROX(m1.colwise().sum().sum(), m1.sum());\n VERIFY_IS_APPROX(m1.rowwise().sum().sum(), m1.sum());\n if (!internal::isApprox(m1.sum(), (m1+m2).sum()))\n VERIFY_IS_NOT_APPROX(((m1+m2).rowwise().sum()).sum(), m1.sum());\n VERIFY_IS_APPROX(m1.colwise().sum(), m1.colwise().redux(internal::scalar_sum_op<Scalar>()));\n\n \/\/ vector-wise ops\n m3 = m1;\n VERIFY_IS_APPROX(m3.colwise() += cv1, m1.colwise() + cv1);\n m3 = m1;\n VERIFY_IS_APPROX(m3.colwise() -= cv1, m1.colwise() - cv1);\n m3 = m1;\n VERIFY_IS_APPROX(m3.rowwise() += rv1, m1.rowwise() + rv1);\n m3 = m1;\n VERIFY_IS_APPROX(m3.rowwise() -= rv1, m1.rowwise() - rv1);\n}\n\ntemplate<typename ArrayType> void comparisons(const ArrayType& m)\n{\n typedef typename ArrayType::Index Index;\n typedef typename ArrayType::Scalar Scalar;\n typedef typename NumTraits<Scalar>::Real RealScalar;\n typedef Array<Scalar, ArrayType::RowsAtCompileTime, 1> VectorType;\n\n Index rows = m.rows();\n Index cols = m.cols();\n\n Index r = internal::random<Index>(0, rows-1),\n c = internal::random<Index>(0, cols-1);\n\n ArrayType m1 = ArrayType::Random(rows, cols),\n m2 = ArrayType::Random(rows, cols),\n m3(rows, cols); \n\n VERIFY(((m1 + Scalar(1)) > m1).all());\n VERIFY(((m1 - Scalar(1)) < m1).all());\n if (rows*cols>1)\n {\n m3 = m1;\n m3(r,c) += 1;\n VERIFY(! (m1 < m3).all() );\n VERIFY(! (m1 > m3).all() );\n }\n\n \/\/ comparisons to scalar\n VERIFY( (m1 != (m1(r,c)+1) ).any() );\n VERIFY( (m1 > (m1(r,c)-1) ).any() );\n VERIFY( (m1 < (m1(r,c)+1) ).any() );\n VERIFY( (m1 == m1(r,c) ).any() );\n\n \/\/ test Select\n VERIFY_IS_APPROX( (m1<m2).select(m1,m2), m1.cwiseMin(m2) );\n VERIFY_IS_APPROX( (m1>m2).select(m1,m2), m1.cwiseMax(m2) );\n Scalar mid = (m1.cwiseAbs().minCoeff() + m1.cwiseAbs().maxCoeff())\/Scalar(2);\n for (int j=0; j<cols; ++j)\n for (int i=0; i<rows; ++i)\n m3(i,j) = internal::abs(m1(i,j))<mid ? 0 : m1(i,j);\n VERIFY_IS_APPROX( (m1.abs()<ArrayType::Constant(rows,cols,mid))\n .select(ArrayType::Zero(rows,cols),m1), m3);\n \/\/ shorter versions:\n VERIFY_IS_APPROX( (m1.abs()<ArrayType::Constant(rows,cols,mid))\n .select(0,m1), m3);\n VERIFY_IS_APPROX( (m1.abs()>=ArrayType::Constant(rows,cols,mid))\n .select(m1,0), m3);\n \/\/ even shorter version:\n VERIFY_IS_APPROX( (m1.abs()<mid).select(0,m1), m3);\n\n \/\/ count\n VERIFY(((m1.abs()+1)>RealScalar(0.1)).count() == rows*cols);\n\n typedef Array<typename ArrayType::Index, Dynamic, 1> ArrayOfIndices;\n\n \/\/ TODO allows colwise\/rowwise for array\n VERIFY_IS_APPROX(((m1.abs()+1)>RealScalar(0.1)).colwise().count(), ArrayOfIndices::Constant(cols,rows).transpose());\n VERIFY_IS_APPROX(((m1.abs()+1)>RealScalar(0.1)).rowwise().count(), ArrayOfIndices::Constant(rows, cols));\n}\n\ntemplate<typename ArrayType> void array_real(const ArrayType& m)\n{\n typedef typename ArrayType::Index Index;\n typedef typename ArrayType::Scalar Scalar;\n typedef typename NumTraits<Scalar>::Real RealScalar;\n\n Index rows = m.rows();\n Index cols = m.cols();\n\n ArrayType m1 = ArrayType::Random(rows, cols),\n m2 = ArrayType::Random(rows, cols),\n m3(rows, cols);\n\n VERIFY_IS_APPROX(m1.sin(), std::sin(m1));\n VERIFY_IS_APPROX(m1.sin(), internal::sin(m1));\n VERIFY_IS_APPROX(m1.cos(), std::cos(m1));\n VERIFY_IS_APPROX(m1.cos(), internal::cos(m1));\n\n VERIFY_IS_APPROX(internal::cos(m1+RealScalar(3)*m2), internal::cos((m1+RealScalar(3)*m2).eval()));\n VERIFY_IS_APPROX(std::cos(m1+RealScalar(3)*m2), std::cos((m1+RealScalar(3)*m2).eval()));\n\n VERIFY_IS_APPROX(m1.abs().sqrt(), std::sqrt(std::abs(m1)));\n VERIFY_IS_APPROX(m1.abs().sqrt(), internal::sqrt(internal::abs(m1)));\n VERIFY_IS_APPROX(m1.abs(), internal::sqrt(internal::abs2(m1)));\n\n VERIFY_IS_APPROX(internal::abs2(internal::real(m1)) + internal::abs2(internal::imag(m1)), internal::abs2(m1));\n VERIFY_IS_APPROX(internal::abs2(std::real(m1)) + internal::abs2(std::imag(m1)), internal::abs2(m1));\n if(!NumTraits<Scalar>::IsComplex)\n VERIFY_IS_APPROX(internal::real(m1), m1);\n\n VERIFY_IS_APPROX(m1.abs().log(), std::log(std::abs(m1)));\n VERIFY_IS_APPROX(m1.abs().log(), internal::log(internal::abs(m1)));\n\n VERIFY_IS_APPROX(m1.exp(), std::exp(m1));\n VERIFY_IS_APPROX(m1.exp() * m2.exp(), std::exp(m1+m2));\n VERIFY_IS_APPROX(m1.exp(), internal::exp(m1));\n VERIFY_IS_APPROX(m1.exp() \/ m2.exp(), std::exp(m1-m2));\n\n VERIFY_IS_APPROX(m1.pow(2), m1.square());\n VERIFY_IS_APPROX(std::pow(m1,2), m1.square());\n m3 = m1.abs();\n VERIFY_IS_APPROX(m3.pow(RealScalar(0.5)), m3.sqrt());\n VERIFY_IS_APPROX(std::pow(m3,RealScalar(0.5)), m3.sqrt());\n}\n\nvoid test_array()\n{\n for(int i = 0; i < g_repeat; i++) {\n \/\/CALL_SUBTEST_1( array(Array<float, 1, 1>()) );\n \/\/CALL_SUBTEST_2( array(Array22f()) );\n \/\/CALL_SUBTEST_3( array(Array44d()) );\n \/\/CALL_SUBTEST_4( array(ArrayXXcf(3, 3)) );\n \/\/CALL_SUBTEST_5( array(ArrayXXf(8, 12)) );\n CALL_SUBTEST_6( array(ArrayXXi(8, 12)) );\n }\n \/\/for(int i = 0; i < g_repeat; i++) {\n \/\/ CALL_SUBTEST_1( comparisons(Array<float, 1, 1>()) );\n \/\/ CALL_SUBTEST_2( comparisons(Array22f()) );\n \/\/ CALL_SUBTEST_3( comparisons(Array44d()) );\n \/\/ CALL_SUBTEST_5( comparisons(ArrayXXf(8, 12)) );\n \/\/ CALL_SUBTEST_6( comparisons(ArrayXXi(8, 12)) );\n \/\/}\n \/\/for(int i = 0; i < g_repeat; i++) {\n \/\/ CALL_SUBTEST_1( array_real(Array<float, 1, 1>()) );\n \/\/ CALL_SUBTEST_2( array_real(Array22f()) );\n \/\/ CALL_SUBTEST_3( array_real(Array44d()) );\n \/\/ CALL_SUBTEST_5( array_real(ArrayXXf(8, 12)) );\n \/\/}\n\n \/\/VERIFY((internal::is_same< internal::global_math_functions_filtering_base<int>::type, int >::value));\n \/\/VERIFY((internal::is_same< internal::global_math_functions_filtering_base<float>::type, float >::value));\n \/\/VERIFY((internal::is_same< internal::global_math_functions_filtering_base<Array2i>::type, ArrayBase<Array2i> >::value));\n \/\/typedef CwiseUnaryOp<internal::scalar_sum_op<double>, ArrayXd > Xpr;\n \/\/VERIFY((internal::is_same< internal::global_math_functions_filtering_base<Xpr>::type,\n \/\/ ArrayBase<Xpr>\n \/\/ >::value));\n}\n<commit_msg>Uups - re-enabled subtests 1 to 5.<commit_after>\/\/ This file is part of Eigen, a lightweight C++ template library\n\/\/ for linear algebra.\n\/\/\n\/\/ Copyright (C) 2008-2009 Gael Guennebaud <gael.guennebaud@inria.fr>\n\/\/\n\/\/ Eigen is free software; you can redistribute it and\/or\n\/\/ modify it under the terms of the GNU Lesser General Public\n\/\/ License as published by the Free Software Foundation; either\n\/\/ version 3 of the License, or (at your option) any later version.\n\/\/\n\/\/ Alternatively, you can redistribute it and\/or\n\/\/ modify it under the terms of the GNU General Public License as\n\/\/ published by the Free Software Foundation; either version 2 of\n\/\/ the License, or (at your option) any later version.\n\/\/\n\/\/ Eigen is distributed in the hope that it will be useful, but WITHOUT ANY\n\/\/ WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS\n\/\/ FOR A PARTICULAR PURPOSE. See the GNU Lesser General Public License or the\n\/\/ GNU General Public License for more details.\n\/\/\n\/\/ You should have received a copy of the GNU Lesser General Public\n\/\/ License and a copy of the GNU General Public License along with\n\/\/ Eigen. If not, see <http:\/\/www.gnu.org\/licenses\/>.\n\n#include \"main.h\"\n\ntemplate<typename ArrayType> void array(const ArrayType& m)\n{\n typedef typename ArrayType::Index Index;\n typedef typename ArrayType::Scalar Scalar;\n typedef typename NumTraits<Scalar>::Real RealScalar;\n typedef Array<Scalar, ArrayType::RowsAtCompileTime, 1> ColVectorType;\n typedef Array<Scalar, 1, ArrayType::ColsAtCompileTime> RowVectorType;\n\n Index rows = m.rows();\n Index cols = m.cols(); \n\n ArrayType m1 = ArrayType::Random(rows, cols),\n m2 = ArrayType::Random(rows, cols),\n m3(rows, cols);\n\n ColVectorType cv1 = ColVectorType::Random(rows);\n RowVectorType rv1 = RowVectorType::Random(cols);\n\n Scalar s1 = internal::random<Scalar>(),\n s2 = internal::random<Scalar>(); \n\n \/\/ scalar addition\n VERIFY_IS_APPROX(m1 + s1, s1 + m1);\n VERIFY_IS_APPROX(m1 + s1, ArrayType::Constant(rows,cols,s1) + m1);\n VERIFY_IS_APPROX(s1 - m1, (-m1)+s1 );\n VERIFY_IS_APPROX(m1 - s1, m1 - ArrayType::Constant(rows,cols,s1));\n VERIFY_IS_APPROX(s1 - m1, ArrayType::Constant(rows,cols,s1) - m1);\n VERIFY_IS_APPROX((m1*Scalar(2)) - s2, (m1+m1) - ArrayType::Constant(rows,cols,s2) );\n m3 = m1;\n m3 += s2;\n VERIFY_IS_APPROX(m3, m1 + s2);\n m3 = m1;\n m3 -= s1;\n VERIFY_IS_APPROX(m3, m1 - s1); \n \n \/\/ scalar operators via Maps\n m3 = m1;\n ArrayType::Map(m1.data(), m1.rows(), m1.cols()) -= ArrayType::Map(m2.data(), m2.rows(), m2.cols());\n VERIFY_IS_APPROX(m1, m3 - m2);\n \n m3 = m1;\n ArrayType::Map(m1.data(), m1.rows(), m1.cols()) += ArrayType::Map(m2.data(), m2.rows(), m2.cols());\n VERIFY_IS_APPROX(m1, m3 + m2);\n \n m3 = m1;\n ArrayType::Map(m1.data(), m1.rows(), m1.cols()) *= ArrayType::Map(m2.data(), m2.rows(), m2.cols());\n VERIFY_IS_APPROX(m1, m3 * m2);\n \n m3 = m1;\n m2 = ArrayType::Random(rows,cols);\n m2 = (m2==0).select(1,m2);\n ArrayType::Map(m1.data(), m1.rows(), m1.cols()) \/= ArrayType::Map(m2.data(), m2.rows(), m2.cols()); \n VERIFY_IS_APPROX(m1, m3 \/ m2);\n\n \/\/ reductions\n VERIFY_IS_APPROX(m1.colwise().sum().sum(), m1.sum());\n VERIFY_IS_APPROX(m1.rowwise().sum().sum(), m1.sum());\n if (!internal::isApprox(m1.sum(), (m1+m2).sum()))\n VERIFY_IS_NOT_APPROX(((m1+m2).rowwise().sum()).sum(), m1.sum());\n VERIFY_IS_APPROX(m1.colwise().sum(), m1.colwise().redux(internal::scalar_sum_op<Scalar>()));\n\n \/\/ vector-wise ops\n m3 = m1;\n VERIFY_IS_APPROX(m3.colwise() += cv1, m1.colwise() + cv1);\n m3 = m1;\n VERIFY_IS_APPROX(m3.colwise() -= cv1, m1.colwise() - cv1);\n m3 = m1;\n VERIFY_IS_APPROX(m3.rowwise() += rv1, m1.rowwise() + rv1);\n m3 = m1;\n VERIFY_IS_APPROX(m3.rowwise() -= rv1, m1.rowwise() - rv1);\n}\n\ntemplate<typename ArrayType> void comparisons(const ArrayType& m)\n{\n typedef typename ArrayType::Index Index;\n typedef typename ArrayType::Scalar Scalar;\n typedef typename NumTraits<Scalar>::Real RealScalar;\n typedef Array<Scalar, ArrayType::RowsAtCompileTime, 1> VectorType;\n\n Index rows = m.rows();\n Index cols = m.cols();\n\n Index r = internal::random<Index>(0, rows-1),\n c = internal::random<Index>(0, cols-1);\n\n ArrayType m1 = ArrayType::Random(rows, cols),\n m2 = ArrayType::Random(rows, cols),\n m3(rows, cols); \n\n VERIFY(((m1 + Scalar(1)) > m1).all());\n VERIFY(((m1 - Scalar(1)) < m1).all());\n if (rows*cols>1)\n {\n m3 = m1;\n m3(r,c) += 1;\n VERIFY(! (m1 < m3).all() );\n VERIFY(! (m1 > m3).all() );\n }\n\n \/\/ comparisons to scalar\n VERIFY( (m1 != (m1(r,c)+1) ).any() );\n VERIFY( (m1 > (m1(r,c)-1) ).any() );\n VERIFY( (m1 < (m1(r,c)+1) ).any() );\n VERIFY( (m1 == m1(r,c) ).any() );\n\n \/\/ test Select\n VERIFY_IS_APPROX( (m1<m2).select(m1,m2), m1.cwiseMin(m2) );\n VERIFY_IS_APPROX( (m1>m2).select(m1,m2), m1.cwiseMax(m2) );\n Scalar mid = (m1.cwiseAbs().minCoeff() + m1.cwiseAbs().maxCoeff())\/Scalar(2);\n for (int j=0; j<cols; ++j)\n for (int i=0; i<rows; ++i)\n m3(i,j) = internal::abs(m1(i,j))<mid ? 0 : m1(i,j);\n VERIFY_IS_APPROX( (m1.abs()<ArrayType::Constant(rows,cols,mid))\n .select(ArrayType::Zero(rows,cols),m1), m3);\n \/\/ shorter versions:\n VERIFY_IS_APPROX( (m1.abs()<ArrayType::Constant(rows,cols,mid))\n .select(0,m1), m3);\n VERIFY_IS_APPROX( (m1.abs()>=ArrayType::Constant(rows,cols,mid))\n .select(m1,0), m3);\n \/\/ even shorter version:\n VERIFY_IS_APPROX( (m1.abs()<mid).select(0,m1), m3);\n\n \/\/ count\n VERIFY(((m1.abs()+1)>RealScalar(0.1)).count() == rows*cols);\n\n typedef Array<typename ArrayType::Index, Dynamic, 1> ArrayOfIndices;\n\n \/\/ TODO allows colwise\/rowwise for array\n VERIFY_IS_APPROX(((m1.abs()+1)>RealScalar(0.1)).colwise().count(), ArrayOfIndices::Constant(cols,rows).transpose());\n VERIFY_IS_APPROX(((m1.abs()+1)>RealScalar(0.1)).rowwise().count(), ArrayOfIndices::Constant(rows, cols));\n}\n\ntemplate<typename ArrayType> void array_real(const ArrayType& m)\n{\n typedef typename ArrayType::Index Index;\n typedef typename ArrayType::Scalar Scalar;\n typedef typename NumTraits<Scalar>::Real RealScalar;\n\n Index rows = m.rows();\n Index cols = m.cols();\n\n ArrayType m1 = ArrayType::Random(rows, cols),\n m2 = ArrayType::Random(rows, cols),\n m3(rows, cols);\n\n VERIFY_IS_APPROX(m1.sin(), std::sin(m1));\n VERIFY_IS_APPROX(m1.sin(), internal::sin(m1));\n VERIFY_IS_APPROX(m1.cos(), std::cos(m1));\n VERIFY_IS_APPROX(m1.cos(), internal::cos(m1));\n\n VERIFY_IS_APPROX(internal::cos(m1+RealScalar(3)*m2), internal::cos((m1+RealScalar(3)*m2).eval()));\n VERIFY_IS_APPROX(std::cos(m1+RealScalar(3)*m2), std::cos((m1+RealScalar(3)*m2).eval()));\n\n VERIFY_IS_APPROX(m1.abs().sqrt(), std::sqrt(std::abs(m1)));\n VERIFY_IS_APPROX(m1.abs().sqrt(), internal::sqrt(internal::abs(m1)));\n VERIFY_IS_APPROX(m1.abs(), internal::sqrt(internal::abs2(m1)));\n\n VERIFY_IS_APPROX(internal::abs2(internal::real(m1)) + internal::abs2(internal::imag(m1)), internal::abs2(m1));\n VERIFY_IS_APPROX(internal::abs2(std::real(m1)) + internal::abs2(std::imag(m1)), internal::abs2(m1));\n if(!NumTraits<Scalar>::IsComplex)\n VERIFY_IS_APPROX(internal::real(m1), m1);\n\n VERIFY_IS_APPROX(m1.abs().log(), std::log(std::abs(m1)));\n VERIFY_IS_APPROX(m1.abs().log(), internal::log(internal::abs(m1)));\n\n VERIFY_IS_APPROX(m1.exp(), std::exp(m1));\n VERIFY_IS_APPROX(m1.exp() * m2.exp(), std::exp(m1+m2));\n VERIFY_IS_APPROX(m1.exp(), internal::exp(m1));\n VERIFY_IS_APPROX(m1.exp() \/ m2.exp(), std::exp(m1-m2));\n\n VERIFY_IS_APPROX(m1.pow(2), m1.square());\n VERIFY_IS_APPROX(std::pow(m1,2), m1.square());\n m3 = m1.abs();\n VERIFY_IS_APPROX(m3.pow(RealScalar(0.5)), m3.sqrt());\n VERIFY_IS_APPROX(std::pow(m3,RealScalar(0.5)), m3.sqrt());\n}\n\nvoid test_array()\n{\n for(int i = 0; i < g_repeat; i++) {\n CALL_SUBTEST_1( array(Array<float, 1, 1>()) );\n CALL_SUBTEST_2( array(Array22f()) );\n CALL_SUBTEST_3( array(Array44d()) );\n CALL_SUBTEST_4( array(ArrayXXcf(3, 3)) );\n CALL_SUBTEST_5( array(ArrayXXf(8, 12)) );\n CALL_SUBTEST_6( array(ArrayXXi(8, 12)) );\n }\n for(int i = 0; i < g_repeat; i++) {\n CALL_SUBTEST_1( comparisons(Array<float, 1, 1>()) );\n CALL_SUBTEST_2( comparisons(Array22f()) );\n CALL_SUBTEST_3( comparisons(Array44d()) );\n CALL_SUBTEST_5( comparisons(ArrayXXf(8, 12)) );\n CALL_SUBTEST_6( comparisons(ArrayXXi(8, 12)) );\n }\n for(int i = 0; i < g_repeat; i++) {\n CALL_SUBTEST_1( array_real(Array<float, 1, 1>()) );\n CALL_SUBTEST_2( array_real(Array22f()) );\n CALL_SUBTEST_3( array_real(Array44d()) );\n CALL_SUBTEST_5( array_real(ArrayXXf(8, 12)) );\n }\n\n VERIFY((internal::is_same< internal::global_math_functions_filtering_base<int>::type, int >::value));\n VERIFY((internal::is_same< internal::global_math_functions_filtering_base<float>::type, float >::value));\n VERIFY((internal::is_same< internal::global_math_functions_filtering_base<Array2i>::type, ArrayBase<Array2i> >::value));\n typedef CwiseUnaryOp<internal::scalar_sum_op<double>, ArrayXd > Xpr;\n VERIFY((internal::is_same< internal::global_math_functions_filtering_base<Xpr>::type,\n ArrayBase<Xpr>\n >::value));\n}\n<|endoftext|>"} {"text":"<commit_before>\/\/ Author: Daniel.Lohner@cern.ch\n\n#include \"AliTRDNDFast.h\"\n#include \"TCanvas.h\"\n\nextern Double_t langaufunc(Double_t *x, Double_t *par) {\n\n \/\/ needs protection, parameter [3]>0!!!!!\n \/\/ needs protection, parameter [4]>0!!!!!\n\n \/\/Fit parameters:\n \/\/par[0]=Width (scale) parameter of Landau density\n \/\/par[1]=Most Probable (MP, location) parameter of Landau density\n \/\/par[2]=Total area (integral -inf to inf, normalization constant)\n \/\/par[3]=Width (sigma) of convoluted Gaussian function\n \/\/par[4]=Exponential Slope Parameter\n \/\/\n \/\/In the Landau distribution (represented by the CERNLIB approximation),\n \/\/the maximum is located at x=-0.22278298 with the location parameter=0.\n \/\/This shift is corrected within this function, so that the actual\n \/\/maximum is identical to the MP parameter.\n\n \/\/ Numeric constants\n Double_t invsq2pi = 0.3989422804014; \/\/ (2 pi)^(-1\/2)\n Double_t mpshift = -0.22278298; \/\/ Landau maximum location\n\n \/\/ Control constants\n Double_t np = 100.0; \/\/ number of convolution stpdf\n Double_t sc = 5.0; \/\/ convolution extends to +-sc Gaussian sigmas\n\n \/\/ Variables\n Double_t xx;\n Double_t mpc;\n Double_t fland;\n Double_t sum = 0.0;\n Double_t xlow,xupp;\n Double_t step;\n Double_t i;\n\n \/\/ MP shift correction\n mpc = par[1] - mpshift * par[0];\n\n \/\/ Range of convolution integral\n xlow = x[0] - sc * par[3];\n xupp = x[0] + sc * par[3];\n\n if(xlow<0)xlow=0;\n if(xupp<xlow)cout<<\"ERROR: Convolution around Negative MPV\"<<endl;\n\n step = (xupp-xlow) \/ np;\n\n \/\/ Convolution integral of Landau and Gaussian by sum\n for(i=1.0; i<=np\/2; i++) {\n\txx = xlow + (i-.5) * step;\n\tfland = TMath::Landau(xx,mpc,par[0])*TMath::Exp(-par[4]*xx) \/ par[0];\t\/\/ mpc taken out\n\tsum += fland * TMath::Gaus(x[0],xx,par[3]);\n\n\txx = xupp - (i-.5) * step;\n\tfland = TMath::Landau(xx,mpc,par[0])*TMath::Exp(-par[4]*xx) \/ par[0];\t\/\/ mpc taken out\n\tsum += fland * TMath::Gaus(x[0],xx,par[3]);\n }\n\n return (par[2] * step * sum * invsq2pi \/ par[3]);\n}\n\n\n\nClassImp(AliTRDNDFast);\n\nAliTRDNDFast::AliTRDNDFast(): TObject(),\n fNDim(0),\n fTitle(\"\"),\n fFunc(NULL),\n fHistos(NULL),\n fPars()\n{\n \/\/ default constructor\n}\n\nAliTRDNDFast::AliTRDNDFast(const char *name,Int_t ndim,Int_t nbins,Double_t xlow,Double_t xup): TObject(),\nfNDim(ndim),\nfTitle(name),\nfFunc(NULL),\nfHistos(NULL),\nfPars()\n{\n Init();\n for(Int_t idim=0;idim<fNDim;idim++){\n\tfHistos[idim]=new TH1F(Form(\"%s_axis_%d\",fTitle.Data(),idim),Form(\"%s_axis_%d\",fTitle.Data(),idim),nbins,xlow,xup);\n\tfHistos[idim]->SetDirectory(0);\n }\n}\n\nAliTRDNDFast::AliTRDNDFast(const AliTRDNDFast &ref) : TObject(ref),\nfNDim(ref.fNDim),\nfTitle(ref.fTitle),\nfFunc(NULL),\nfHistos(NULL),\nfPars()\n{\n Cleanup();\n Init();\n for(Int_t idim=0;idim<fNDim;idim++){\n\tfHistos[idim]=(TH1F*)ref.fHistos[idim]->Clone(Form(\"%s_axis_%d\",GetName(),idim));\n\tfHistos[idim]->SetDirectory(0);\n\tfor(Int_t ipar=0;ipar<kNpar;ipar++)fPars[idim][ipar]=ref.fPars[idim][ipar];\n }\n}\n\nAliTRDNDFast &AliTRDNDFast::operator=(const AliTRDNDFast &ref){\n \/\/\n \/\/ Assignment operator\n \/\/\n if(this != &ref){\n\tTObject::operator=(ref);\n\tfNDim=ref.fNDim;\n\tfTitle=ref.fTitle;\n\tfFunc = ref.fFunc;\n\tfHistos=ref.fHistos;\n\tfor(Int_t idim=0;idim<fNDim;idim++){\n\t for(Int_t ipar=0;ipar<kNpar;ipar++)fPars[idim][ipar]=ref.fPars[idim][ipar];\n\t}\n }\n return *this;\n}\n\nAliTRDNDFast::~AliTRDNDFast(){\n Cleanup();\n\n}\n\nvoid AliTRDNDFast::Init(){\n\n for(Int_t ipar=0;ipar<kNpar;ipar++)fPars[ipar].Set(fNDim);\n fFunc=new TF1*[fNDim];\n fHistos=new TH1F*[fNDim];\n for(Int_t idim=0;idim<fNDim;idim++){\n fHistos[idim]=NULL;\n\tfor(Int_t ipar=0;ipar<kNpar;ipar++)fPars[ipar].SetAt(0,idim);\n\tfFunc[idim]=NULL;\n }\n}\n\nvoid AliTRDNDFast::Cleanup(){\n if(fHistos){\n\tfor(Int_t idim=0;idim<fNDim;idim++){\n\t if(fHistos[idim]){\n\t\tdelete fHistos[idim];\n\t\tfHistos[idim]=NULL;\n\t }\n\t}\n\tdelete[] fHistos;\n\tfHistos=NULL;\n }\n if(fPars){\n\tfor(Int_t ipar=0;ipar<kNpar;ipar++){\n\t fPars[ipar].Reset();\n\t}\n }\n if(fFunc){\n\tfor(Int_t idim=0;idim<fNDim;idim++){\n\t if(fFunc[idim]){\n\t\tdelete fFunc[idim];\n\t\tfFunc[idim]=NULL;\n\t }\n\t}\n\tdelete[] fFunc;\n\tfFunc=NULL;\n }\n}\n\nvoid AliTRDNDFast::PrintPars(){\n for(Int_t idim=0;idim<fNDim;idim++){\n\tfor(Int_t ipar=0;ipar<kNpar;ipar++)cout<<idim<<\" \"<<ipar<<\" \"<<GetParam(idim,ipar)<<endl;\n }\n}\n\nvoid AliTRDNDFast::ScaleLangauFun(TF1 *func,Double_t mpv){\n\n Double_t start[kNpar],low[kNpar],high[kNpar];\n for(Int_t ii=0;ii<kNpar;ii++){\n\tstart[ii]=func->GetParameter(ii);\n\tfunc->GetParLimits(ii,low[ii],high[ii]);\n }\n\n Double_t scalefactor=mpv\/start[1];\n\n for(Int_t ii=0;ii<kNpar;ii++){\n\tDouble_t scale=1;\n\tif(ii==0||ii==1||ii==3)scale=scalefactor;\n\tif(ii==4)scale=1.\/scalefactor;\n\tstart[ii]*=scale;\n\tlow[ii]*=scale;\n\thigh[ii]*=scale;\n\tfunc->SetParLimits(ii, low[ii], high[ii]);\n }\n func->SetParameters(start);\n}\n\n\/\/---------------------------------------------------------------\n\/\/---------------------------------------------------------------\nTF1 *AliTRDNDFast::GetLangauFun(TString funcname,Double_t range[2],Double_t scalefactor){\n\n Double_t start[kNpar] = {120, 1000, 1, 100, 1e-5};\n Double_t low[kNpar] = {10, 300, 0.01, 1, 0.};\n Double_t high[kNpar] = {1000, 3000, 100, 1000, 1.};\n\n TF1 *hlandauE=new TF1(funcname.Data(),langaufunc,0,range[1],kNpar);\n hlandauE->SetParameters(start);\n hlandauE->SetParNames(\"Width\",\"MP\",\"Area\",\"GSigma\",\"delta\");\n for (int i=0; i<kNpar; i++) {\n\thlandauE->SetParLimits(i, low[i], high[i]);\n }\n\n if(scalefactor!=1){ScaleLangauFun(hlandauE,scalefactor*start[1]);}\n\n return hlandauE;\n}\n\nTF1 *AliTRDNDFast::FitLandau(TString name,TH1F *htemp,Double_t range[2],TString option){\n\n TF1 *fitlandau1D=GetLangauFun(name,range);\n TF1 fit(\"land\",\"landau\");\n Double_t max=htemp->GetXaxis()->GetBinCenter(htemp->GetMaximumBin());\n fit.SetParameter(1,max);\n fit.SetParLimits(1,0,htemp->GetXaxis()->GetXmax());\n fit.SetParameter(2,0.3*max); \/\/ MPV may never become negative!!!!!\n htemp->Fit(\"land\",option.Data(),\"\",range[0],range[1]);\n ScaleLangauFun(fitlandau1D,fit.GetParameter(1));\n htemp->Fit(fitlandau1D,option.Data(),\"\",range[0],range[1]); \/\/ range for references\n return fitlandau1D;\n}\n\nvoid AliTRDNDFast::BuildHistos(){\n\n for(Int_t idim=0;idim<fNDim;idim++){\n fHistos[idim]->Reset();\n\t\/\/ Fill Histo\n\tDouble_t pars[kNpar];\n\tfor(Int_t ipar=0;ipar<kNpar;ipar++)pars[ipar]=GetParam(idim,ipar);\n \/\/ Also Fill overflow bins!!!\n\tfor(Int_t ii=1;ii<=fHistos[idim]->GetNbinsX()+1;ii++){\n\t Double_t xval=fHistos[idim]->GetXaxis()->GetBinCenter(ii);\n\t Double_t val=langaufunc(&xval,&pars[0]);\n\t \/\/Double_t val=fFunc[idim]->Eval(xval);\n\t fHistos[idim]->SetBinContent(ii,val);\n\t}\n\t\/\/ Normalization\n\tfHistos[idim]->Scale(1.\/fHistos[idim]->Integral(1,fHistos[idim]->GetNbinsX(),\"width\"));\n }\n}\n\nvoid AliTRDNDFast::Build(Double_t **pars){\n \/\/ pars[ndim][npar]\n for(Int_t idim=0;idim<fNDim;idim++){\n\tfor(Int_t ipar=0;ipar<kNpar;ipar++){\n\t fPars[ipar].SetAt(pars[idim][ipar],idim);\n\t}\n }\n BuildHistos();\n}\n\n\nvoid AliTRDNDFast::Build(TH1F **hdEdx,TString path){\n\n Double_t range[2];\n\n TCanvas *CANV=new TCanvas(\"a\",\"a\");\n if(fNDim==2)CANV->Divide(2,1);\n if(fNDim==3)CANV->Divide(2,2);\n if(fNDim>6)CANV->Divide(3,3);\n \/\/ Fit and Extract Parameters\n for(Int_t idim=0;idim<fNDim;idim++){\n\tCANV->cd(idim+1);\n gPad->SetLogy();\n\trange[0]=hdEdx[idim]->GetXaxis()->GetXmin();\n\trange[1]=hdEdx[idim]->GetXaxis()->GetXmax();\n\t\/\/ Norm Histogram\n\thdEdx[idim]->Scale(1.\/hdEdx[idim]->Integral(1,hdEdx[idim]->GetNbinsX(),\"width\"));\n \/\/ Fit Histogram\n\tfFunc[idim]=FitLandau(Form(\"fit%d\",idim),hdEdx[idim],range,\"RMB0\");\n\t\/\/ Norm Landau\n\tfFunc[idim]->SetParameter(2,fFunc[idim]->GetParameter(2)\/fFunc[idim]->Integral(range[0],range[1]));\n\thdEdx[idim]->DrawCopy();\n fFunc[idim]->DrawCopy(\"same\");\n\t\/\/ Set Pars\n\tfor(Int_t ipar=0;ipar<kNpar;ipar++)fPars[ipar].SetAt(fFunc[idim]->GetParameter(ipar),idim);\n }\n if(path!=\"\")CANV->Print(Form(\"%s\/%s_Build.pdf\",path.Data(),fTitle.Data()));\n delete CANV;\n\n BuildHistos();\n}\n\nDouble_t AliTRDNDFast::Eval(Double_t *point) const{\n Double_t val=1;\n for(Int_t idim=0;idim<fNDim;idim++){\n\tInt_t bin=fHistos[idim]->GetXaxis()->FindBin(point[idim]);\n\tval*=fHistos[idim]->GetBinContent(bin);\n }\n return val;\n}\n\nvoid AliTRDNDFast::Random(Double_t *point) const{\n for(Int_t idim=0;idim<fNDim;idim++){\n\tpoint[idim]=fHistos[idim]->GetRandom();\n }\n}\n\nvoid AliTRDNDFast::Random(Double_t *point,AliTRDNDFast *nd0,AliTRDNDFast *nd1,Double_t w0,Double_t w1){\n for(Int_t idim=0;idim<nd0->fNDim;idim++){\n\tpoint[idim]=GetRandomInterpolation(nd0->fHistos[idim],nd1->fHistos[idim],w0,w1);\n }\n}\n\nInt_t AliTRDNDFast::BinarySearchInterpolation(Int_t start,Int_t end,Double_t *a0,Double_t *a1,Double_t w0,Double_t w1,Double_t val){\n\n if((end-start)==1)return start;\n Int_t mid=Int_t((end+start)\/2);\n Double_t valmid=(w0*a0[mid]+w1*a1[mid])\/(w0+w1);\n if(val>=valmid)return BinarySearchInterpolation(mid,end,a0,a1,w0,w1,val);\n return BinarySearchInterpolation(start,mid,a0,a1,w0,w1,val);\n}\n\nDouble_t AliTRDNDFast::GetRandomInterpolation(TH1F *hist0,TH1F *hist1,Double_t w0,Double_t w1){\n\n \/\/ Draw Random Variable\n Double_t rand=gRandom->Rndm();\n\n \/\/ Get Integral Arrays\n Double_t *integral0=hist0->GetIntegral();\n Double_t *integral1=hist1->GetIntegral();\n\n Int_t nbinsX=hist0->GetNbinsX();\n\n Int_t ibin=BinarySearchInterpolation(1,nbinsX+1,integral0,integral1,w0,w1,rand);\n return hist0->GetXaxis()->GetBinCenter(ibin);\n}\n\n\n\n<commit_msg>coverity fix pachmay <Yvonne.Chiara.Pachmayer@cern.ch><commit_after>\/\/ Author: Daniel.Lohner@cern.ch\n\n#include \"AliTRDNDFast.h\"\n#include \"TCanvas.h\"\n\nextern Double_t langaufunc(Double_t *x, Double_t *par) {\n\n \/\/ needs protection, parameter [3]>0!!!!!\n \/\/ needs protection, parameter [4]>0!!!!!\n\n \/\/Fit parameters:\n \/\/par[0]=Width (scale) parameter of Landau density\n \/\/par[1]=Most Probable (MP, location) parameter of Landau density\n \/\/par[2]=Total area (integral -inf to inf, normalization constant)\n \/\/par[3]=Width (sigma) of convoluted Gaussian function\n \/\/par[4]=Exponential Slope Parameter\n \/\/\n \/\/In the Landau distribution (represented by the CERNLIB approximation),\n \/\/the maximum is located at x=-0.22278298 with the location parameter=0.\n \/\/This shift is corrected within this function, so that the actual\n \/\/maximum is identical to the MP parameter.\n\n \/\/ Numeric constants\n Double_t invsq2pi = 0.3989422804014; \/\/ (2 pi)^(-1\/2)\n Double_t mpshift = -0.22278298; \/\/ Landau maximum location\n\n \/\/ Control constants\n Double_t np = 100.0; \/\/ number of convolution stpdf\n Double_t sc = 5.0; \/\/ convolution extends to +-sc Gaussian sigmas\n\n \/\/ Variables\n Double_t xx;\n Double_t mpc;\n Double_t fland;\n Double_t sum = 0.0;\n Double_t xlow,xupp;\n Double_t step;\n Double_t i;\n\n \/\/ MP shift correction\n mpc = par[1] - mpshift * par[0];\n\n \/\/ Range of convolution integral\n xlow = x[0] - sc * par[3];\n xupp = x[0] + sc * par[3];\n\n if(xlow<0)xlow=0;\n if(xupp<xlow)cout<<\"ERROR: Convolution around Negative MPV\"<<endl;\n\n step = (xupp-xlow) \/ np;\n\n \/\/ Convolution integral of Landau and Gaussian by sum\n for(i=1.0; i<=np\/2; i++) {\n\txx = xlow + (i-.5) * step;\n\tfland = TMath::Landau(xx,mpc,par[0])*TMath::Exp(-par[4]*xx) \/ par[0];\t\/\/ mpc taken out\n\tsum += fland * TMath::Gaus(x[0],xx,par[3]);\n\n\txx = xupp - (i-.5) * step;\n\tfland = TMath::Landau(xx,mpc,par[0])*TMath::Exp(-par[4]*xx) \/ par[0];\t\/\/ mpc taken out\n\tsum += fland * TMath::Gaus(x[0],xx,par[3]);\n }\n\n return (par[2] * step * sum * invsq2pi \/ par[3]);\n}\n\n\n\nClassImp(AliTRDNDFast);\n\nAliTRDNDFast::AliTRDNDFast(): TObject(),\n fNDim(0),\n fTitle(\"\"),\n fFunc(NULL),\n fHistos(NULL),\n fPars()\n{\n \/\/ default constructor\n}\n\nAliTRDNDFast::AliTRDNDFast(const char *name,Int_t ndim,Int_t nbins,Double_t xlow,Double_t xup): TObject(),\nfNDim(ndim),\nfTitle(name),\nfFunc(NULL),\nfHistos(NULL),\nfPars()\n{\n Init();\n for(Int_t idim=0;idim<fNDim;idim++){\n\tfHistos[idim]=new TH1F(Form(\"%s_axis_%d\",fTitle.Data(),idim),Form(\"%s_axis_%d\",fTitle.Data(),idim),nbins,xlow,xup);\n\tfHistos[idim]->SetDirectory(0);\n }\n}\n\nAliTRDNDFast::AliTRDNDFast(const AliTRDNDFast &ref) : TObject(ref),\nfNDim(ref.fNDim),\nfTitle(ref.fTitle),\nfFunc(NULL),\nfHistos(NULL),\nfPars()\n{\n Cleanup();\n Init();\n for(Int_t idim=0;idim<fNDim;idim++){\n\tfHistos[idim]=(TH1F*)ref.fHistos[idim]->Clone(Form(\"%s_axis_%d\",GetName(),idim));\n\tfHistos[idim]->SetDirectory(0);\n\tfor(Int_t ipar=0;ipar<kNpar;ipar++)fPars[idim][ipar]=ref.fPars[idim][ipar];\n }\n}\n\nAliTRDNDFast &AliTRDNDFast::operator=(const AliTRDNDFast &ref){\n \/\/\n \/\/ Assignment operator\n \/\/\n if(this != &ref){\n\tTObject::operator=(ref);\n\tfNDim=ref.fNDim;\n\tfTitle=ref.fTitle;\n\tfFunc = ref.fFunc;\n\tfor(Int_t idim=0;idim<fNDim;idim++){\n\t fHistos[idim]=(TH1F*)ref.fHistos[idim]->Clone(Form(\"%s_axis_%d\",GetName(),idim));\n\t fHistos[idim]->SetDirectory(0);\n\t for(Int_t ipar=0;ipar<kNpar;ipar++)fPars[idim][ipar]=ref.fPars[idim][ipar];\n\t}\n }\n return *this;\n}\n\nAliTRDNDFast::~AliTRDNDFast(){\n Cleanup();\n\n}\n\nvoid AliTRDNDFast::Init(){\n\n for(Int_t ipar=0;ipar<kNpar;ipar++)fPars[ipar].Set(fNDim);\n fFunc=new TF1*[fNDim];\n fHistos=new TH1F*[fNDim];\n for(Int_t idim=0;idim<fNDim;idim++){\n fHistos[idim]=NULL;\n\tfor(Int_t ipar=0;ipar<kNpar;ipar++)fPars[ipar].SetAt(0,idim);\n\tfFunc[idim]=NULL;\n }\n}\n\nvoid AliTRDNDFast::Cleanup(){\n if(fHistos){\n\tfor(Int_t idim=0;idim<fNDim;idim++){\n\t if(fHistos[idim]){\n\t\tdelete fHistos[idim];\n\t\tfHistos[idim]=NULL;\n\t }\n\t}\n\tdelete[] fHistos;\n\tfHistos=NULL;\n }\n if(fPars){\n\tfor(Int_t ipar=0;ipar<kNpar;ipar++){\n\t fPars[ipar].Reset();\n\t}\n }\n if(fFunc){\n\tfor(Int_t idim=0;idim<fNDim;idim++){\n\t if(fFunc[idim]){\n\t\tdelete fFunc[idim];\n\t\tfFunc[idim]=NULL;\n\t }\n\t}\n\tdelete[] fFunc;\n\tfFunc=NULL;\n }\n}\n\nvoid AliTRDNDFast::PrintPars(){\n for(Int_t idim=0;idim<fNDim;idim++){\n\tfor(Int_t ipar=0;ipar<kNpar;ipar++)cout<<idim<<\" \"<<ipar<<\" \"<<GetParam(idim,ipar)<<endl;\n }\n}\n\nvoid AliTRDNDFast::ScaleLangauFun(TF1 *func,Double_t mpv){\n\n Double_t start[kNpar],low[kNpar],high[kNpar];\n for(Int_t ii=0;ii<kNpar;ii++){\n\tstart[ii]=func->GetParameter(ii);\n\tfunc->GetParLimits(ii,low[ii],high[ii]);\n }\n\n Double_t scalefactor=mpv\/start[1];\n\n for(Int_t ii=0;ii<kNpar;ii++){\n\tDouble_t scale=1;\n\tif(ii==0||ii==1||ii==3)scale=scalefactor;\n\tif(ii==4)scale=1.\/scalefactor;\n\tstart[ii]*=scale;\n\tlow[ii]*=scale;\n\thigh[ii]*=scale;\n\tfunc->SetParLimits(ii, low[ii], high[ii]);\n }\n func->SetParameters(start);\n}\n\n\/\/---------------------------------------------------------------\n\/\/---------------------------------------------------------------\nTF1 *AliTRDNDFast::GetLangauFun(TString funcname,Double_t range[2],Double_t scalefactor){\n\n Double_t start[kNpar] = {120, 1000, 1, 100, 1e-5};\n Double_t low[kNpar] = {10, 300, 0.01, 1, 0.};\n Double_t high[kNpar] = {1000, 3000, 100, 1000, 1.};\n\n TF1 *hlandauE=new TF1(funcname.Data(),langaufunc,0,range[1],kNpar);\n hlandauE->SetParameters(start);\n hlandauE->SetParNames(\"Width\",\"MP\",\"Area\",\"GSigma\",\"delta\");\n for (int i=0; i<kNpar; i++) {\n\thlandauE->SetParLimits(i, low[i], high[i]);\n }\n\n if(scalefactor!=1){ScaleLangauFun(hlandauE,scalefactor*start[1]);}\n\n return hlandauE;\n}\n\nTF1 *AliTRDNDFast::FitLandau(TString name,TH1F *htemp,Double_t range[2],TString option){\n\n TF1 *fitlandau1D=GetLangauFun(name,range);\n TF1 fit(\"land\",\"landau\");\n Double_t max=htemp->GetXaxis()->GetBinCenter(htemp->GetMaximumBin());\n fit.SetParameter(1,max);\n fit.SetParLimits(1,0,htemp->GetXaxis()->GetXmax());\n fit.SetParameter(2,0.3*max); \/\/ MPV may never become negative!!!!!\n htemp->Fit(\"land\",option.Data(),\"\",range[0],range[1]);\n ScaleLangauFun(fitlandau1D,fit.GetParameter(1));\n htemp->Fit(fitlandau1D,option.Data(),\"\",range[0],range[1]); \/\/ range for references\n return fitlandau1D;\n}\n\nvoid AliTRDNDFast::BuildHistos(){\n\n for(Int_t idim=0;idim<fNDim;idim++){\n fHistos[idim]->Reset();\n\t\/\/ Fill Histo\n\tDouble_t pars[kNpar];\n\tfor(Int_t ipar=0;ipar<kNpar;ipar++)pars[ipar]=GetParam(idim,ipar);\n \/\/ Also Fill overflow bins!!!\n\tfor(Int_t ii=1;ii<=fHistos[idim]->GetNbinsX()+1;ii++){\n\t Double_t xval=fHistos[idim]->GetXaxis()->GetBinCenter(ii);\n\t Double_t val=langaufunc(&xval,&pars[0]);\n\t \/\/Double_t val=fFunc[idim]->Eval(xval);\n\t fHistos[idim]->SetBinContent(ii,val);\n\t}\n\t\/\/ Normalization\n\tfHistos[idim]->Scale(1.\/fHistos[idim]->Integral(1,fHistos[idim]->GetNbinsX(),\"width\"));\n }\n}\n\nvoid AliTRDNDFast::Build(Double_t **pars){\n \/\/ pars[ndim][npar]\n for(Int_t idim=0;idim<fNDim;idim++){\n\tfor(Int_t ipar=0;ipar<kNpar;ipar++){\n\t fPars[ipar].SetAt(pars[idim][ipar],idim);\n\t}\n }\n BuildHistos();\n}\n\n\nvoid AliTRDNDFast::Build(TH1F **hdEdx,TString path){\n\n Double_t range[2];\n\n TCanvas *CANV=new TCanvas(\"a\",\"a\");\n if(fNDim==2)CANV->Divide(2,1);\n if(fNDim==3)CANV->Divide(2,2);\n if(fNDim>6)CANV->Divide(3,3);\n \/\/ Fit and Extract Parameters\n for(Int_t idim=0;idim<fNDim;idim++){\n\tCANV->cd(idim+1);\n gPad->SetLogy();\n\trange[0]=hdEdx[idim]->GetXaxis()->GetXmin();\n\trange[1]=hdEdx[idim]->GetXaxis()->GetXmax();\n\t\/\/ Norm Histogram\n\thdEdx[idim]->Scale(1.\/hdEdx[idim]->Integral(1,hdEdx[idim]->GetNbinsX(),\"width\"));\n \/\/ Fit Histogram\n\tfFunc[idim]=FitLandau(Form(\"fit%d\",idim),hdEdx[idim],range,\"RMB0\");\n\t\/\/ Norm Landau\n\tfFunc[idim]->SetParameter(2,fFunc[idim]->GetParameter(2)\/fFunc[idim]->Integral(range[0],range[1]));\n\thdEdx[idim]->DrawCopy();\n fFunc[idim]->DrawCopy(\"same\");\n\t\/\/ Set Pars\n\tfor(Int_t ipar=0;ipar<kNpar;ipar++)fPars[ipar].SetAt(fFunc[idim]->GetParameter(ipar),idim);\n }\n if(path!=\"\")CANV->Print(Form(\"%s\/%s_Build.pdf\",path.Data(),fTitle.Data()));\n delete CANV;\n\n BuildHistos();\n}\n\nDouble_t AliTRDNDFast::Eval(Double_t *point) const{\n Double_t val=1;\n for(Int_t idim=0;idim<fNDim;idim++){\n\tInt_t bin=fHistos[idim]->GetXaxis()->FindBin(point[idim]);\n\tval*=fHistos[idim]->GetBinContent(bin);\n }\n return val;\n}\n\nvoid AliTRDNDFast::Random(Double_t *point) const{\n for(Int_t idim=0;idim<fNDim;idim++){\n\tpoint[idim]=fHistos[idim]->GetRandom();\n }\n}\n\nvoid AliTRDNDFast::Random(Double_t *point,AliTRDNDFast *nd0,AliTRDNDFast *nd1,Double_t w0,Double_t w1){\n for(Int_t idim=0;idim<nd0->fNDim;idim++){\n\tpoint[idim]=GetRandomInterpolation(nd0->fHistos[idim],nd1->fHistos[idim],w0,w1);\n }\n}\n\nInt_t AliTRDNDFast::BinarySearchInterpolation(Int_t start,Int_t end,Double_t *a0,Double_t *a1,Double_t w0,Double_t w1,Double_t val){\n\n if((end-start)==1)return start;\n Int_t mid=Int_t((end+start)\/2);\n Double_t valmid=(w0*a0[mid]+w1*a1[mid])\/(w0+w1);\n if(val>=valmid)return BinarySearchInterpolation(mid,end,a0,a1,w0,w1,val);\n return BinarySearchInterpolation(start,mid,a0,a1,w0,w1,val);\n}\n\nDouble_t AliTRDNDFast::GetRandomInterpolation(TH1F *hist0,TH1F *hist1,Double_t w0,Double_t w1){\n\n \/\/ Draw Random Variable\n Double_t rand=gRandom->Rndm();\n\n \/\/ Get Integral Arrays\n Double_t *integral0=hist0->GetIntegral();\n Double_t *integral1=hist1->GetIntegral();\n\n Int_t nbinsX=hist0->GetNbinsX();\n\n Int_t ibin=BinarySearchInterpolation(1,nbinsX+1,integral0,integral1,w0,w1,rand);\n return hist0->GetXaxis()->GetBinCenter(ibin);\n}\n\n\n\n<|endoftext|>"} {"text":"<commit_before><commit_msg>Small fix.<commit_after><|endoftext|>"} {"text":"<commit_before>\/**\n * v8cgi - (fast)cgi binary\n *\/\n\n#include <v8.h>\n#include <v8-debug.h>\n#include <stdlib.h>\n#include <string.h>\n#include \"app.h\"\n#include \"macros.h\"\n#include \"path.h\"\n\n#ifdef FASTCGI\n# include <fcgi_stdio.h>\n# include <signal.h>\n#endif\n\n\/**\n * Format for command line arguments\n *\n * as you can see if you wish to pass any arguments to v8, you MUST\n * put a -- surrounded by whitespace after all the v8 arguments\n *\n * any arguments after the v8_args but before the program_file are\n * used by v8cgi.\n *\/\nstatic const char * const v8cgi_usage = \"v8cgi [v8_args --] [-v] [-h] [-w] [-c path] [-d port] program_file [argument ...]\";\n\nclass v8cgi_CGI : public v8cgi_App {\npublic:\n\t\/**\n\t * Initialize from command line\n\t *\/\n\tint init(int argc, char ** argv) {\n\t\tv8cgi_App::init();\n\t\t\n\t\tthis->argv0 = (argc > 0 ? path_normalize(argv[0]) : std::string(\"\"));\n\n\t\tif (argc == 1) {\n\t\t\t\/* no command-line arguments, try looking for CGI env vars *\/\n\t\t\tthis->fromEnvVars();\n\t\t}\n\t\t\n\t\ttry {\n\t\t\tthis->process_args(argc, argv);\n\t\t} catch (std::string e) {\n\t\t\tthis->error(e.c_str(), __FILE__, __LINE__); \n\t\t\treturn 1;\n\t\t}\n\t\t\n\t\treturn 0;\n\t}\n\t\n\t\/**\n\t * STDIN reader\n\t *\/\n\tsize_t reader(char * destination, size_t amount) {\n\t\treturn fread((void *) destination, sizeof(char), amount, stdin);\n\t}\n\n\t\/**\n\t * STDOUT writer\n\t *\/\n\tsize_t writer(const char * data, size_t amount) {\n\t\treturn fwrite((void *) data, sizeof(char), amount, stdout);\n\t}\n\n\t\/**\n\t * STDERR error\n\t *\/\n\tvoid error(const char * data, const char * file, int line) {\n\t\tfwrite((void *) data, sizeof(char), strlen(data), stderr);\n\t\tfwrite((void *) \"\\n\", sizeof(char), 1, stderr);\n\t}\n\t\n\t\/**\n\t * STDOUT flush\n\t * @return whether successful\n\t *\/\n\tbool flush() {\n\t\treturn (fflush(stdout) == 0);\n\t}\n\n\tvoid fromEnvVars() {\n\t\tchar * env = getenv(\"PATH_TRANSLATED\");\n\t\tif (!env) { env = getenv(\"SCRIPT_FILENAME\"); }\n\t\tif (env) { this->mainfile = std::string(env); }\n\t}\n\t\nprivate:\n\tstd::string argv0;\n\n\tconst char * instanceType() { \n\t\treturn \"cli\";\n\t}\n\t\n\tconst char * executableName() {\n\t\treturn this->argv0.c_str();\n\t}\n\t\n\t\/**\n\t * Process command line arguments.\n\t *\/\n\tvoid process_args(int argc, char ** argv) {\n\t\tstd::string err = \"Invalid command line usage.\\n\";\n\t\terr += \"Correct usage: \";\n\t\terr += v8cgi_usage; \/* see the v8cgi_usage definition for the format *\/\n\t\t\n\t\tint index = 0;\n\t\tbool wait_for_debugger = false;\n\t\tint debugger_port = 0;\n\t\t\n\t\t\/* see if we have v8 options *\/\n\t\tbool have_v8args = false;\n\t\tfor (; index < argc; ++index) {\n\t\t\t\/* FIXME: if there is a standalone \"--\" after the name of the script\n\t\t\t then this breaks. I can't figure out a solution to this, so\n\t\t\t for now we don't support any standalone \"--\" after the script name.\n\t\t\t One solution (and the way it currently works) is to require \"--\"\n\t\t\t before all other args even if no v8 args are used, but that seems\n\t\t\t I don't like this, but it is where we are right now. *\/\n\t\t\tif (std::string(argv[index]) == \"--\") {\n\t\t\t\t\/* treat all previous arguments as v8 arguments *\/\n\t\t\t\tint v8argc = index;\n\t\t\t\tv8::V8::SetFlagsFromCommandLine(&v8argc, argv, true);\n\t\t\t\tindex++; \/* skip over the \"--\" *\/\n\t\t\t\thave_v8args = true;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t\t\n\t\t\/* if there were no v8 args, then reset index to the first argument *\/\n\t\tif (!have_v8args) { index = 1; }\n\t\t\n\t\t\/* scan for v8cgi-specific arguments now *\/\n\t\twhile (index < argc) {\n\t\t\tstd::string optname(argv[index]);\n\t\t\tif (optname[0] != '-') { break; } \/* not starting with \"-\" => mainfile *\/\n\t\t\tif (optname.length() != 2) { throw err; } \/* one-character options only *\/\n\t\t\tindex++; \/* skip the option name *\/\n\t\t\t\n\t\t\tswitch (optname[1]) {\n\t\t\t\tcase 'c':\n\t\t\t\t\tif (index >= argc) { throw err; } \/* missing option value *\/\n\t\t\t\t\tthis->cfgfile = argv[index];\t\t\n#ifdef VERBOSE\n\t\t\t\t\tprintf(\"cfgfile: %s\\n\", argv[index]);\n#endif\n\t\t\t\t\tindex++; \/* skip the option value *\/\n\t\t\t\tbreak;\n\t\t\t\t\n\t\t\t\tcase 'w':\n\t\t\t\t\twait_for_debugger = true;\n\t\t\t\tbreak;\n\n\t\t\t\tcase 'd':\n\t\t\t\t\tif (index >= argc) { throw err; } \/* missing option value *\/\n\t\t\t\t\tdebugger_port = atoi(argv[index]);\n#ifdef VERBOSE\n\t\t\t\t\tprintf(\"port: %i\\n\", debugger_port);\n#endif\n\t\t\t\t\tindex++; \/* skip the option value *\/\n\t\t\t\tbreak;\n\t\t\t\t\n\t\t\t\tcase 'h':\n\t\t\t\t\tprintf(v8cgi_usage);\n\t\t\t\t\tprintf(\"\\n\");\n\t\t\t\tbreak;\n\t\t\t\t\n\t\t\t\tcase 'v':\n\t\t\t\t\tprintf(\"v8cgi version %s\", STRING(VERSION));\n\t\t\t\t\tprintf(\"\\n\");\n\t\t\t\tbreak;\n\t\t\t\t\n\t\t\t\t\n\t\t\t\tdefault:\n\t\t\t\t\tthrow err;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\t\n\t\t} \n\t\t\n\t\tif (debugger_port) { \/* launch debugging agent *\/ \n\t\t\tv8::Debug::EnableAgent(\"v8cgi\", debugger_port, wait_for_debugger);\n\t\t}\n\t\t\n\t\tif (index < argc) {\n\t\t\t\/* argv[index] is the program file *\/\n\t\t\tthis->mainfile = argv[index];\n\t\t\t\/* expand mainfile to absolute path *\/\n\t\t\tif (!path_isabsolute(this->mainfile)) {\n\t\t\t\tstd::string tmp = path_getcwd();\n\t\t\t\ttmp += \"\/\";\n\t\t\t\ttmp += this->mainfile;\n\t\t\t\tthis->mainfile = path_normalize(this->mainfile);\n\t\t\t}\n\t\t\tindex++; \/* skip over the program_file *\/\n\t\t}\n\t\t\n\t\t\/* all the rest of the arguments are arguments to the program_file *\/\n\t\tfor (; index < argc; ++index) {\n#ifdef VERBOSE\n\t\t\tprintf(\"program_arg: %s\\n\", argv[index]);\n#endif\n\t\t\tthis->mainfile_args.push_back(std::string(argv[index]));\n\t\t}\n\t}\n};\n\n#ifdef FASTCGI\n\t\/**\n\t * This is true only after we receive a signal to terminate\n\t *\/\n\tvoid handle_sigterm(int param) {\n\t\tFCGI_SetExitStatus(0);\n\t\texit(0); \n \t}\n\n\tvoid handle_sigusr1(int param) {\n\t\tFCGI_SetExitStatus(0);\n\t\texit(0); \n\t}\n\n\tvoid handle_sigpipe(int param) {\n\t\tFCGI_SetExitStatus(0);\n\t\texit(0); \n\t}\n#endif\n\nextern char ** environ;\n\nint main(int argc, char ** argv) {\n\tint result = 0;\n\tv8cgi_CGI cgi;\n\tresult = cgi.init(argc, argv);\n\tif (result) { exit(result); }\n\n#ifdef FASTCGI\n\n\tsignal(SIGTERM, handle_sigterm);\n# ifdef SIGPIPE\n\tsignal(SIGPIPE, handle_sigpipe);\n# endif\n# ifdef SIGUSR1\n\tsignal(SIGUSR1, handle_sigusr1);\n# endif\n\t\/**\n\t * FastCGI main loop\n\t *\/\n\twhile (FCGI_Accept() >= 0) {\n\t\tcgi.fromEnvVars();\n#endif\n\n\t\tresult = cgi.execute(environ);\n\n#ifdef FASTCGI\n\t\tFCGI_SetExitStatus(result);\n\t}\n#endif\n\n\treturn result;\n}\n<commit_msg>issue 91<commit_after>\/**\n * v8cgi - (fast)cgi binary\n *\/\n\n#include <v8.h>\n#include <v8-debug.h>\n#include <stdlib.h>\n#include <string.h>\n#include \"app.h\"\n#include \"macros.h\"\n#include \"path.h\"\n\n#ifdef FASTCGI\n# include <fcgi_stdio.h>\n# include <signal.h>\n#endif\n\n#ifdef windows\n# include <fcntl.h> \/* _O_BINARY *\/\n unsigned int _CRT_fmode = _O_BINARY; \n#endif\n\n\/**\n * Format for command line arguments\n *\n * as you can see if you wish to pass any arguments to v8, you MUST\n * put a -- surrounded by whitespace after all the v8 arguments\n *\n * any arguments after the v8_args but before the program_file are\n * used by v8cgi.\n *\/\nstatic const char * const v8cgi_usage = \"v8cgi [v8_args --] [-v] [-h] [-w] [-c path] [-d port] program_file [argument ...]\";\n\nclass v8cgi_CGI : public v8cgi_App {\npublic:\n\t\/**\n\t * Initialize from command line\n\t *\/\n\tint init(int argc, char ** argv) {\n\t\tv8cgi_App::init();\n\t\t\n\t\tthis->argv0 = (argc > 0 ? path_normalize(argv[0]) : std::string(\"\"));\n\n\t\tif (argc == 1) {\n\t\t\t\/* no command-line arguments, try looking for CGI env vars *\/\n\t\t\tthis->fromEnvVars();\n\t\t}\n\t\t\n\t\ttry {\n\t\t\tthis->process_args(argc, argv);\n\t\t} catch (std::string e) {\n\t\t\tthis->error(e.c_str(), __FILE__, __LINE__); \n\t\t\treturn 1;\n\t\t}\n\t\t\n\t\treturn 0;\n\t}\n\t\n\t\/**\n\t * STDIN reader\n\t *\/\n\tsize_t reader(char * destination, size_t amount) {\n\t\treturn fread((void *) destination, sizeof(char), amount, stdin);\n\t}\n\n\t\/**\n\t * STDOUT writer\n\t *\/\n\tsize_t writer(const char * data, size_t amount) {\n\t\treturn fwrite((void *) data, sizeof(char), amount, stdout);\n\t}\n\n\t\/**\n\t * STDERR error\n\t *\/\n\tvoid error(const char * data, const char * file, int line) {\n\t\tfwrite((void *) data, sizeof(char), strlen(data), stderr);\n\t\tfwrite((void *) \"\\n\", sizeof(char), 1, stderr);\n\t}\n\t\n\t\/**\n\t * STDOUT flush\n\t * @return whether successful\n\t *\/\n\tbool flush() {\n\t\treturn (fflush(stdout) == 0);\n\t}\n\n\tvoid fromEnvVars() {\n\t\tchar * env = getenv(\"PATH_TRANSLATED\");\n\t\tif (!env) { env = getenv(\"SCRIPT_FILENAME\"); }\n\t\tif (env) { this->mainfile = std::string(env); }\n\t}\n\t\nprivate:\n\tstd::string argv0;\n\n\tconst char * instanceType() { \n\t\treturn \"cli\";\n\t}\n\t\n\tconst char * executableName() {\n\t\treturn this->argv0.c_str();\n\t}\n\t\n\t\/**\n\t * Process command line arguments.\n\t *\/\n\tvoid process_args(int argc, char ** argv) {\n\t\tstd::string err = \"Invalid command line usage.\\n\";\n\t\terr += \"Correct usage: \";\n\t\terr += v8cgi_usage; \/* see the v8cgi_usage definition for the format *\/\n\t\t\n\t\tint index = 0;\n\t\tbool wait_for_debugger = false;\n\t\tint debugger_port = 0;\n\t\t\n\t\t\/* see if we have v8 options *\/\n\t\tbool have_v8args = false;\n\t\tfor (; index < argc; ++index) {\n\t\t\t\/* FIXME: if there is a standalone \"--\" after the name of the script\n\t\t\t then this breaks. I can't figure out a solution to this, so\n\t\t\t for now we don't support any standalone \"--\" after the script name.\n\t\t\t One solution (and the way it currently works) is to require \"--\"\n\t\t\t before all other args even if no v8 args are used, but that seems\n\t\t\t I don't like this, but it is where we are right now. *\/\n\t\t\tif (std::string(argv[index]) == \"--\") {\n\t\t\t\t\/* treat all previous arguments as v8 arguments *\/\n\t\t\t\tint v8argc = index;\n\t\t\t\tv8::V8::SetFlagsFromCommandLine(&v8argc, argv, true);\n\t\t\t\tindex++; \/* skip over the \"--\" *\/\n\t\t\t\thave_v8args = true;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t\t\n\t\t\/* if there were no v8 args, then reset index to the first argument *\/\n\t\tif (!have_v8args) { index = 1; }\n\t\t\n\t\t\/* scan for v8cgi-specific arguments now *\/\n\t\twhile (index < argc) {\n\t\t\tstd::string optname(argv[index]);\n\t\t\tif (optname[0] != '-') { break; } \/* not starting with \"-\" => mainfile *\/\n\t\t\tif (optname.length() != 2) { throw err; } \/* one-character options only *\/\n\t\t\tindex++; \/* skip the option name *\/\n\t\t\t\n\t\t\tswitch (optname[1]) {\n\t\t\t\tcase 'c':\n\t\t\t\t\tif (index >= argc) { throw err; } \/* missing option value *\/\n\t\t\t\t\tthis->cfgfile = argv[index];\t\t\n#ifdef VERBOSE\n\t\t\t\t\tprintf(\"cfgfile: %s\\n\", argv[index]);\n#endif\n\t\t\t\t\tindex++; \/* skip the option value *\/\n\t\t\t\tbreak;\n\t\t\t\t\n\t\t\t\tcase 'w':\n\t\t\t\t\twait_for_debugger = true;\n\t\t\t\tbreak;\n\n\t\t\t\tcase 'd':\n\t\t\t\t\tif (index >= argc) { throw err; } \/* missing option value *\/\n\t\t\t\t\tdebugger_port = atoi(argv[index]);\n#ifdef VERBOSE\n\t\t\t\t\tprintf(\"port: %i\\n\", debugger_port);\n#endif\n\t\t\t\t\tindex++; \/* skip the option value *\/\n\t\t\t\tbreak;\n\t\t\t\t\n\t\t\t\tcase 'h':\n\t\t\t\t\tprintf(v8cgi_usage);\n\t\t\t\t\tprintf(\"\\n\");\n\t\t\t\tbreak;\n\t\t\t\t\n\t\t\t\tcase 'v':\n\t\t\t\t\tprintf(\"v8cgi version %s\", STRING(VERSION));\n\t\t\t\t\tprintf(\"\\n\");\n\t\t\t\tbreak;\n\t\t\t\t\n\t\t\t\t\n\t\t\t\tdefault:\n\t\t\t\t\tthrow err;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\t\n\t\t} \n\t\t\n\t\tif (debugger_port) { \/* launch debugging agent *\/ \n\t\t\tv8::Debug::EnableAgent(\"v8cgi\", debugger_port, wait_for_debugger);\n\t\t}\n\t\t\n\t\tif (index < argc) {\n\t\t\t\/* argv[index] is the program file *\/\n\t\t\tthis->mainfile = argv[index];\n\t\t\t\/* expand mainfile to absolute path *\/\n\t\t\tif (!path_isabsolute(this->mainfile)) {\n\t\t\t\tstd::string tmp = path_getcwd();\n\t\t\t\ttmp += \"\/\";\n\t\t\t\ttmp += this->mainfile;\n\t\t\t\tthis->mainfile = path_normalize(this->mainfile);\n\t\t\t}\n\t\t\tindex++; \/* skip over the program_file *\/\n\t\t}\n\t\t\n\t\t\/* all the rest of the arguments are arguments to the program_file *\/\n\t\tfor (; index < argc; ++index) {\n#ifdef VERBOSE\n\t\t\tprintf(\"program_arg: %s\\n\", argv[index]);\n#endif\n\t\t\tthis->mainfile_args.push_back(std::string(argv[index]));\n\t\t}\n\t}\n};\n\n#ifdef FASTCGI\n\t\/**\n\t * This is true only after we receive a signal to terminate\n\t *\/\n\tvoid handle_sigterm(int param) {\n\t\tFCGI_SetExitStatus(0);\n\t\texit(0); \n \t}\n\n\tvoid handle_sigusr1(int param) {\n\t\tFCGI_SetExitStatus(0);\n\t\texit(0); \n\t}\n\n\tvoid handle_sigpipe(int param) {\n\t\tFCGI_SetExitStatus(0);\n\t\texit(0); \n\t}\n#endif\n\nextern char ** environ;\n\nint main(int argc, char ** argv) {\n\tint result = 0;\n\tv8cgi_CGI cgi;\n\tresult = cgi.init(argc, argv);\n\tif (result) { exit(result); }\n\n#ifdef FASTCGI\n\n\tsignal(SIGTERM, handle_sigterm);\n# ifdef SIGPIPE\n\tsignal(SIGPIPE, handle_sigpipe);\n# endif\n# ifdef SIGUSR1\n\tsignal(SIGUSR1, handle_sigusr1);\n# endif\n\t\/**\n\t * FastCGI main loop\n\t *\/\n\twhile (FCGI_Accept() >= 0) {\n\t\tcgi.fromEnvVars();\n#endif\n\n\t\tresult = cgi.execute(environ);\n\n#ifdef FASTCGI\n\t\tFCGI_SetExitStatus(result);\n\t}\n#endif\n\n\treturn result;\n}\n<|endoftext|>"} {"text":"<commit_before>\/\/ -*- mode:C++; tab-width:8; c-basic-offset:2; indent-tabs-mode:t -*- \n\/\/ vim: ts=8 sw=2 smarttab\n\/*\n * Ceph - scalable distributed file system\n *\n * Copyright (C) 2004-2006 Sage Weil <sage@newdream.net>\n *\n * This is free software; you can redistribute it and\/or\n * modify it under the terms of the GNU Lesser General Public\n * License version 2.1, as published by the Free Software \n * Foundation. See file COPYING.\n * \n *\/\n\n#include <sys\/stat.h>\n#include <iostream>\n#include <string>\nusing namespace std;\n\n#include \"config.h\"\n\n#include \"mon\/MonMap.h\"\n#include \"mon\/MonClient.h\"\n#include \"msg\/SimpleMessenger.h\"\n#include \"messages\/MMonCommand.h\"\n#include \"messages\/MMonCommandAck.h\"\n\n#include \"common\/Timer.h\"\n\n#ifndef DARWIN\n#include <envz.h>\n#endif \/\/ DARWIN\n\n#include <sys\/types.h>\n#include <sys\/stat.h>\n#include <fcntl.h>\n\nMutex lock(\"cmonctl.cc lock\");\nMessenger *messenger = 0;\n\nconst char *outfile = 0;\nint watch = 0;\n\nMonMap monmap;\n\nenum { OSD, MON, MDS, CLIENT, LAST };\nint which = 0;\nint same = 0;\nconst char *prefix[4] = { \"mds\", \"osd\", \"pg\", \"client\" };\nmap<string,string> status;\n\n\n\/\/ refresh every second\nvoid get_status(bool newmon=false);\n\nstruct C_Refresh : public Context {\n void finish(int r) {\n get_status(true);\n }\n};\n\nSafeTimer timer(lock);\nContext *event = 0;\n\nvoid get_status(bool newmon)\n{\n int mon = monmap.pick_mon(newmon);\n\n vector<string> vcmd(2);\n vcmd[0] = prefix[which];\n vcmd[1] = \"stat\";\n \n MMonCommand *m = new MMonCommand(monmap.fsid);\n m->cmd.swap(vcmd);\n messenger->send_message(m, monmap.get_inst(mon));\n\n event = new C_Refresh;\n timer.add_event_after(1.0, event);\n}\n\n\nvoid handle_ack(MMonCommandAck *ack)\n{\n if (watch) {\n lock.Lock();\n string w = ack->cmd[0];\n if (ack->rs != status[w]) {\n status[w] = ack->rs;\n generic_dout(0) << w << \" \" << status[w] << dendl;\n }\n\n which++;\n which = which % LAST;\n \n if (event)\n timer.cancel_event(event);\n get_status();\n lock.Unlock();\n } else {\n generic_dout(0) << ack->get_source() << \" -> '\"\n\t\t << ack->rs << \"' (\" << ack->r << \")\"\n\t\t << dendl;\n messenger->shutdown();\n }\n int len = ack->get_data().length();\n if (len) {\n if (outfile) {\n if (strcmp(outfile, \"-\") == 0) {\n\t::write(1, ack->get_data().c_str(), len);\n } else {\n\tint fd = ::open(outfile, O_WRONLY|O_TRUNC|O_CREAT);\n\t::write(fd, ack->get_data().c_str(), len);\n\t::fchmod(fd, 0777);\n\t::close(fd);\n }\n generic_dout(0) << \"wrote \" << len << \" byte payload to \" << outfile << dendl;\n } else {\n generic_dout(0) << \"got \" << len << \" byte payload, discarding (specify -o <outfile)\" << dendl;\n }\n }\n}\n\n\nclass Admin : public Dispatcher {\n void dispatch(Message *m) {\n switch (m->get_type()) {\n case MSG_MON_COMMAND_ACK:\n handle_ack((MMonCommandAck*)m);\n break; \n }\n }\n} dispatcher;\n\n\nvoid usage() \n{\n cerr << \"usage: cmonctl [options] monhost] command\" << std::endl;\n cerr << \"Options:\" << std::endl;\n cerr << \" -m monhost -- specify monitor hostname or ip\" << std::endl;\n cerr << \" -i infile -- specify input file\" << std::endl;\n cerr << \" -o outfile -- specify output file\" << std::endl;\n cerr << \" -w or --watch -- watch mds, osd, pg status\" << std::endl;\n cerr << \"Commands:\" << std::endl;\n cerr << \" stop -- cleanly shut down file system\" << std::endl\n << \" (osd|pg|mds) stat -- get monitor subsystem status\" << std::endl\n << \" ...\" << std::endl;\n exit(1);\n}\n\nint main(int argc, const char **argv, const char *envp[]) {\n\n vector<const char*> args;\n argv_to_vec(argc, argv, args);\n env_to_vec(args);\n parse_config_options(args);\n\n vec_to_argv(args, argc, argv);\n\n srand(getpid());\n\n bufferlist indata;\n vector<const char*> nargs;\n for (unsigned i=0; i<args.size(); i++) {\n if (strcmp(args[i],\"-o\") == 0) \n outfile = args[++i];\n else if (strcmp(args[i], \"-i\") == 0) {\n int fd = ::open(args[++i], O_RDONLY);\n struct stat st;\n if (::fstat(fd, &st) == 0) {\n\tindata.push_back(buffer::create(st.st_size));\n\tindata.zero();\n\t::read(fd, indata.c_str(), st.st_size);\n\t::close(fd);\n\tcout << \"read \" << st.st_size << \" bytes from \" << args[i] << std::endl;\n }\n } else if (strcmp(args[i], \"-w\") == 0 ||\n\t strcmp(args[i], \"--watch\") == 0) {\n watch = 1;\n } else\n nargs.push_back(args[i]);\n }\n\n \/\/ build command\n vector<string> vcmd;\n string cmd;\n if (!watch) {\n for (unsigned i=0; i<nargs.size(); i++) {\n if (i) cmd += \" \";\n cmd += nargs[i];\n vcmd.push_back(string(nargs[i]));\n }\n if (vcmd.empty()) {\n cerr << \"no mon command specified\" << std::endl;\n usage();\n }\n }\n\n \/\/ get monmap\n MonClient mc;\n if (mc.get_monmap(&monmap) < 0)\n return -1;\n \n \/\/ start up network\n rank.bind();\n g_conf.daemonize = false; \/\/ not us!\n messenger = rank.register_entity(entity_name_t::ADMIN());\n messenger->set_dispatcher(&dispatcher);\n\n rank.start();\n rank.set_policy(entity_name_t::TYPE_MON, Rank::Policy::lossy_fail_after(1.0));\n\n if (watch) {\n lock.Lock();\n get_status();\n lock.Unlock();\n } else {\n \/\/ build command\n MMonCommand *m = new MMonCommand(monmap.fsid);\n m->set_data(indata);\n m->cmd.swap(vcmd);\n int mon = monmap.pick_mon();\n \n generic_dout(0) << \"mon\" << mon << \" <- '\" << cmd << \"'\" << dendl;\n \n \/\/ send it\n messenger->send_message(m, monmap.get_inst(mon));\n }\n\n \/\/ wait for messenger to finish\n rank.wait();\n \n return 0;\n}\n\n<commit_msg>cmonctl: fix busy loop<commit_after>\/\/ -*- mode:C++; tab-width:8; c-basic-offset:2; indent-tabs-mode:t -*- \n\/\/ vim: ts=8 sw=2 smarttab\n\/*\n * Ceph - scalable distributed file system\n *\n * Copyright (C) 2004-2006 Sage Weil <sage@newdream.net>\n *\n * This is free software; you can redistribute it and\/or\n * modify it under the terms of the GNU Lesser General Public\n * License version 2.1, as published by the Free Software \n * Foundation. See file COPYING.\n * \n *\/\n\n#include <sys\/stat.h>\n#include <iostream>\n#include <string>\nusing namespace std;\n\n#include \"config.h\"\n\n#include \"mon\/MonMap.h\"\n#include \"mon\/MonClient.h\"\n#include \"msg\/SimpleMessenger.h\"\n#include \"messages\/MMonCommand.h\"\n#include \"messages\/MMonCommandAck.h\"\n\n#include \"common\/Timer.h\"\n\n#ifndef DARWIN\n#include <envz.h>\n#endif \/\/ DARWIN\n\n#include <sys\/types.h>\n#include <sys\/stat.h>\n#include <fcntl.h>\n\nMutex lock(\"cmonctl.cc lock\");\nMessenger *messenger = 0;\n\nconst char *outfile = 0;\nint watch = 0;\n\nMonMap monmap;\n\nenum { OSD, MON, MDS, CLIENT, LAST };\nint which = 0;\nint same = 0;\nconst char *prefix[4] = { \"mds\", \"osd\", \"pg\", \"client\" };\nmap<string,string> status;\n\n\n\/\/ refresh every second\nvoid get_status(bool newmon=false);\n\nstruct C_Refresh : public Context {\n void finish(int r) {\n get_status(true);\n }\n};\n\nSafeTimer timer(lock);\nContext *event = 0;\n\nvoid get_status(bool newmon)\n{\n int mon = monmap.pick_mon(newmon);\n\n vector<string> vcmd(2);\n vcmd[0] = prefix[which];\n vcmd[1] = \"stat\";\n \n MMonCommand *m = new MMonCommand(monmap.fsid);\n m->cmd.swap(vcmd);\n messenger->send_message(m, monmap.get_inst(mon));\n\n event = new C_Refresh;\n timer.add_event_after(.2, event);\n}\n\n\nvoid handle_ack(MMonCommandAck *ack)\n{\n if (watch) {\n lock.Lock();\n\n which++;\n which = which % LAST;\n\n string w = ack->cmd[0];\n if (ack->rs != status[w]) {\n status[w] = ack->rs;\n generic_dout(0) << w << \" \" << status[w] << dendl;\n\n if (event)\n\ttimer.cancel_event(event);\n get_status();\n }\n \n lock.Unlock();\n } else {\n generic_dout(0) << ack->get_source() << \" -> '\"\n\t\t << ack->rs << \"' (\" << ack->r << \")\"\n\t\t << dendl;\n messenger->shutdown();\n }\n int len = ack->get_data().length();\n if (len) {\n if (outfile) {\n if (strcmp(outfile, \"-\") == 0) {\n\t::write(1, ack->get_data().c_str(), len);\n } else {\n\tint fd = ::open(outfile, O_WRONLY|O_TRUNC|O_CREAT);\n\t::write(fd, ack->get_data().c_str(), len);\n\t::fchmod(fd, 0777);\n\t::close(fd);\n }\n generic_dout(0) << \"wrote \" << len << \" byte payload to \" << outfile << dendl;\n } else {\n generic_dout(0) << \"got \" << len << \" byte payload, discarding (specify -o <outfile)\" << dendl;\n }\n }\n}\n\n\nclass Admin : public Dispatcher {\n void dispatch(Message *m) {\n switch (m->get_type()) {\n case MSG_MON_COMMAND_ACK:\n handle_ack((MMonCommandAck*)m);\n break; \n }\n }\n} dispatcher;\n\n\nvoid usage() \n{\n cerr << \"usage: cmonctl [options] monhost] command\" << std::endl;\n cerr << \"Options:\" << std::endl;\n cerr << \" -m monhost -- specify monitor hostname or ip\" << std::endl;\n cerr << \" -i infile -- specify input file\" << std::endl;\n cerr << \" -o outfile -- specify output file\" << std::endl;\n cerr << \" -w or --watch -- watch mds, osd, pg status\" << std::endl;\n cerr << \"Commands:\" << std::endl;\n cerr << \" stop -- cleanly shut down file system\" << std::endl\n << \" (osd|pg|mds) stat -- get monitor subsystem status\" << std::endl\n << \" ...\" << std::endl;\n exit(1);\n}\n\nint main(int argc, const char **argv, const char *envp[]) {\n\n vector<const char*> args;\n argv_to_vec(argc, argv, args);\n env_to_vec(args);\n parse_config_options(args);\n\n vec_to_argv(args, argc, argv);\n\n srand(getpid());\n\n bufferlist indata;\n vector<const char*> nargs;\n for (unsigned i=0; i<args.size(); i++) {\n if (strcmp(args[i],\"-o\") == 0) \n outfile = args[++i];\n else if (strcmp(args[i], \"-i\") == 0) {\n int fd = ::open(args[++i], O_RDONLY);\n struct stat st;\n if (::fstat(fd, &st) == 0) {\n\tindata.push_back(buffer::create(st.st_size));\n\tindata.zero();\n\t::read(fd, indata.c_str(), st.st_size);\n\t::close(fd);\n\tcout << \"read \" << st.st_size << \" bytes from \" << args[i] << std::endl;\n }\n } else if (strcmp(args[i], \"-w\") == 0 ||\n\t strcmp(args[i], \"--watch\") == 0) {\n watch = 1;\n } else\n nargs.push_back(args[i]);\n }\n\n \/\/ build command\n vector<string> vcmd;\n string cmd;\n if (!watch) {\n for (unsigned i=0; i<nargs.size(); i++) {\n if (i) cmd += \" \";\n cmd += nargs[i];\n vcmd.push_back(string(nargs[i]));\n }\n if (vcmd.empty()) {\n cerr << \"no mon command specified\" << std::endl;\n usage();\n }\n }\n\n \/\/ get monmap\n MonClient mc;\n if (mc.get_monmap(&monmap) < 0)\n return -1;\n \n \/\/ start up network\n rank.bind();\n g_conf.daemonize = false; \/\/ not us!\n messenger = rank.register_entity(entity_name_t::ADMIN());\n messenger->set_dispatcher(&dispatcher);\n\n rank.start();\n rank.set_policy(entity_name_t::TYPE_MON, Rank::Policy::lossy_fail_after(1.0));\n\n if (watch) {\n lock.Lock();\n get_status();\n lock.Unlock();\n } else {\n \/\/ build command\n MMonCommand *m = new MMonCommand(monmap.fsid);\n m->set_data(indata);\n m->cmd.swap(vcmd);\n int mon = monmap.pick_mon();\n \n generic_dout(0) << \"mon\" << mon << \" <- '\" << cmd << \"'\" << dendl;\n \n \/\/ send it\n messenger->send_message(m, monmap.get_inst(mon));\n }\n\n \/\/ wait for messenger to finish\n rank.wait();\n \n return 0;\n}\n\n<|endoftext|>"} {"text":"<commit_before>\/*\r\n * Copyright (c) 2014, Oculus VR, Inc.\r\n * All rights reserved.\r\n *\r\n * This source code is licensed under the BSD-style license found in the\r\n * LICENSE file in the root directory of this source tree. An additional grant \r\n * of patent rights can be found in the PATENTS file in the same directory.\r\n *\r\n *\/\r\n\r\n#include \"CCRakNetSlidingWindow.h\"\r\n\r\n#if USE_SLIDING_WINDOW_CONGESTION_CONTROL==1\r\n\r\nstatic const double UNSET_TIME_US=-1;\r\n\r\n#if CC_TIME_TYPE_BytesYTES==4\r\nstatic const CCTimeType SYN=10;\r\n#else\r\nstatic const CCTimeType SYN=10000;\r\n#endif\r\n\r\n#include \"MTUSize.h\"\r\n#include <stdio.h>\r\n#include <math.h>\r\n#include <stdlib.h>\r\n#include \"RakAssert.h\"\r\n#include \"RakAlloca.h\"\r\n\r\nusing namespace RakNet;\r\n\r\n\/\/ ****************************************************** PUBLIC METHODS ******************************************************\r\n\r\nCCRakNetSlidingWindow::CCRakNetSlidingWindow()\r\n{\r\n}\r\n\/\/ ----------------------------------------------------------------------------------------------------------------------------\r\nCCRakNetSlidingWindow::~CCRakNetSlidingWindow()\r\n{\r\n\r\n}\r\n\/\/ ----------------------------------------------------------------------------------------------------------------------------\r\nvoid CCRakNetSlidingWindow::Init(CCTimeType curTime, uint32_t maxDatagramPayload)\r\n{\r\n\t(void) curTime;\r\n\r\n\tlastRtt=estimatedRTT=deviationRtt=UNSET_TIME_US;\r\n\tRakAssert(maxDatagramPayload <= MAXIMUM_MTU_SIZE);\r\n\tMAXIMUM_MTU_INCLUDING_UDP_HEADER=maxDatagramPayload;\r\n\tcwnd=maxDatagramPayload;\r\n\tssThresh=0.0;\r\n\toldestUnsentAck=0;\r\n\tnextDatagramSequenceNumber=0;\r\n\tnextCongestionControlBlock=0;\r\n\tbackoffThisBlock=speedUpThisBlock=false;\r\n\texpectedNextSequenceNumber=0;\r\n\t_isContinuousSend=false;\r\n}\r\n\/\/ ----------------------------------------------------------------------------------------------------------------------------\r\nvoid CCRakNetSlidingWindow::Update(CCTimeType curTime, bool hasDataToSendOrResend)\r\n{\r\n\t(void) curTime;\r\n\t(void) hasDataToSendOrResend;\r\n}\r\n\/\/ ----------------------------------------------------------------------------------------------------------------------------\r\nint CCRakNetSlidingWindow::GetRetransmissionBandwidth(CCTimeType curTime, CCTimeType timeSinceLastTick, uint32_t unacknowledgedBytes, bool isContinuousSend)\r\n{\r\n\t(void) curTime;\r\n\t(void) isContinuousSend;\r\n\t(void) timeSinceLastTick;\r\n\r\n\treturn unacknowledgedBytes;\r\n}\r\n\/\/ ----------------------------------------------------------------------------------------------------------------------------\r\nint CCRakNetSlidingWindow::GetTransmissionBandwidth(CCTimeType curTime, CCTimeType timeSinceLastTick, uint32_t unacknowledgedBytes, bool isContinuousSend)\r\n{\r\n\t(void) curTime;\r\n\t(void) timeSinceLastTick;\r\n\r\n\t_isContinuousSend=isContinuousSend;\r\n\r\n\tif (unacknowledgedBytes<=cwnd)\r\n\t\treturn (int) (cwnd-unacknowledgedBytes);\r\n\telse\r\n\t\treturn 0;\r\n}\r\n\/\/ ----------------------------------------------------------------------------------------------------------------------------\r\nbool CCRakNetSlidingWindow::ShouldSendACKs(CCTimeType curTime, CCTimeType estimatedTimeToNextTick)\r\n{\r\n\tCCTimeType rto = GetSenderRTOForACK();\r\n\t(void) estimatedTimeToNextTick;\r\n\r\n\t\/\/ iphone crashes on comparison between double and int64 http:\/\/www.jenkinssoftware.com\/forum\/index.php?topic=2717.0\r\n\tif (rto==(CCTimeType) UNSET_TIME_US)\r\n\t{\r\n\t\t\/\/ Unknown how long until the remote system will retransmit, so better send right away\r\n\t\treturn true;\r\n\t}\r\n\r\n\treturn curTime >= oldestUnsentAck + SYN;\r\n}\r\n\/\/ ----------------------------------------------------------------------------------------------------------------------------\r\nDatagramSequenceNumberType CCRakNetSlidingWindow::GetNextDatagramSequenceNumber(void)\r\n{\r\n\treturn nextDatagramSequenceNumber;\r\n}\r\n\/\/ ----------------------------------------------------------------------------------------------------------------------------\r\nDatagramSequenceNumberType CCRakNetSlidingWindow::GetAndIncrementNextDatagramSequenceNumber(void)\r\n{\r\n\tDatagramSequenceNumberType dsnt=nextDatagramSequenceNumber;\r\n\tnextDatagramSequenceNumber++;\r\n\treturn dsnt;\r\n}\r\n\/\/ ----------------------------------------------------------------------------------------------------------------------------\r\nvoid CCRakNetSlidingWindow::OnSendBytes(CCTimeType curTime, uint32_t numBytes)\r\n{\r\n\t(void) curTime;\r\n\t(void) numBytes;\r\n}\r\n\/\/ ----------------------------------------------------------------------------------------------------------------------------\r\nvoid CCRakNetSlidingWindow::OnGotPacketPair(DatagramSequenceNumberType datagramSequenceNumber, uint32_t sizeInBytes, CCTimeType curTime)\r\n{\r\n\t(void) curTime;\r\n\t(void) sizeInBytes;\r\n\t(void) datagramSequenceNumber;\r\n}\r\n\/\/ ----------------------------------------------------------------------------------------------------------------------------\r\nbool CCRakNetSlidingWindow::OnGotPacket(DatagramSequenceNumberType datagramSequenceNumber, bool isContinuousSend, CCTimeType curTime, uint32_t sizeInBytes, uint32_t *skippedMessageCount)\r\n{\r\n\t(void) curTime;\r\n\t(void) sizeInBytes;\r\n\t(void) isContinuousSend;\r\n\r\n\tif (oldestUnsentAck==0)\r\n\t\toldestUnsentAck=curTime;\r\n\r\n\tif (datagramSequenceNumber==expectedNextSequenceNumber)\r\n\t{\r\n\t\t*skippedMessageCount=0;\r\n\t\texpectedNextSequenceNumber=datagramSequenceNumber+(DatagramSequenceNumberType)1;\r\n\t}\r\n\telse if (GreaterThan(datagramSequenceNumber, expectedNextSequenceNumber))\r\n\t{\r\n\t\t*skippedMessageCount=datagramSequenceNumber-expectedNextSequenceNumber;\r\n\t\t\/\/ Sanity check, just use timeout resend if this was really valid\r\n\t\tif (*skippedMessageCount>1000)\r\n\t\t{\r\n\t\t\t\/\/ During testing, the nat punchthrough server got 51200 on the first packet. I have no idea where this comes from, but has happened twice\r\n\t\t\tif (*skippedMessageCount>(uint32_t)50000)\r\n\t\t\t\treturn false;\r\n\t\t\t*skippedMessageCount=1000;\r\n\t\t}\r\n\t\texpectedNextSequenceNumber=datagramSequenceNumber+(DatagramSequenceNumberType)1;\r\n\t}\r\n\telse\r\n\t{\r\n\t\t*skippedMessageCount=0;\r\n\t}\r\n\r\n\treturn true;\r\n}\r\n\/\/ ----------------------------------------------------------------------------------------------------------------------------\r\nvoid CCRakNetSlidingWindow::OnResend(CCTimeType curTime, RakNet::TimeUS nextActionTime)\r\n{\r\n\t(void) curTime;\r\n\t(void) nextActionTime;\r\n\r\n\tif (_isContinuousSend && backoffThisBlock==false && cwnd>MAXIMUM_MTU_INCLUDING_UDP_HEADER*2)\r\n\t{\r\n\t\t\/\/ Spec says 1\/2 cwnd, but it never recovers because cwnd increases too slowly\r\n\t\t\/\/ssThresh=cwnd-8.0 * (MAXIMUM_MTU_INCLUDING_UDP_HEADER*MAXIMUM_MTU_INCLUDING_UDP_HEADER\/cwnd);\r\n\t\tssThresh=cwnd\/2;\r\n\t\tif (ssThresh<MAXIMUM_MTU_INCLUDING_UDP_HEADER)\r\n\t\t\tssThresh=MAXIMUM_MTU_INCLUDING_UDP_HEADER;\r\n\t\tcwnd=MAXIMUM_MTU_INCLUDING_UDP_HEADER;\r\n\r\n\t\t\/\/ Only backoff once per period\r\n\t\tnextCongestionControlBlock=nextDatagramSequenceNumber;\r\n\t\tbackoffThisBlock=true;\r\n\r\n\t\t\/\/ CC PRINTF\r\n\t\t\/\/printf(\"-- %.0f (Resend) Enter slow start.\\n\", cwnd);\r\n\t}\r\n}\r\n\/\/ ----------------------------------------------------------------------------------------------------------------------------\r\nvoid CCRakNetSlidingWindow::OnNAK(CCTimeType curTime, DatagramSequenceNumberType nakSequenceNumber)\r\n{\r\n\t(void) nakSequenceNumber;\r\n\t(void) curTime;\r\n\r\n\tif (_isContinuousSend && backoffThisBlock==false)\r\n\t{\r\n\t\t\/\/ Start congestion avoidance\r\n\t\tssThresh=cwnd\/2;\r\n\r\n\t\t\/\/ CC PRINTF\r\n\t\t\/\/printf(\"- %.0f (NAK) Set congestion avoidance.\\n\", cwnd);\r\n\t}\r\n}\r\n\/\/ ----------------------------------------------------------------------------------------------------------------------------\r\nvoid CCRakNetSlidingWindow::OnAck(CCTimeType curTime, CCTimeType rtt, bool hasBAndAS, BytesPerMicrosecond _Bytes, BytesPerMicrosecond _AS, double totalUserDataBytesAcked, bool isContinuousSend, DatagramSequenceNumberType sequenceNumber )\r\n{\r\n\t(void) _Bytes;\r\n\t(void) totalUserDataBytesAcked;\r\n\t(void) _AS;\r\n\t(void) hasBAndAS;\r\n\t(void) curTime;\r\n\t(void) rtt;\r\n\r\n\tlastRtt=(double) rtt;\r\n\tif (estimatedRTT==UNSET_TIME_US)\r\n\t{\r\n\t\testimatedRTT=(double) rtt;\r\n\t\tdeviationRtt=(double)rtt;\r\n\t}\r\n\telse\r\n\t{\r\n\t\tdouble d = .05;\r\n\t\tdouble difference = rtt - estimatedRTT;\r\n\t\testimatedRTT = estimatedRTT + d * difference;\r\n\t\tdeviationRtt = deviationRtt + d * (abs(difference) - deviationRtt);\r\n\t}\r\n\r\n\t_isContinuousSend=isContinuousSend;\r\n\r\n\tif (isContinuousSend==false)\r\n\t\treturn;\r\n\r\n\tbool isNewCongestionControlPeriod;\r\n\tisNewCongestionControlPeriod = GreaterThan(sequenceNumber, nextCongestionControlBlock);\r\n\r\n\tif (isNewCongestionControlPeriod)\r\n\t{\r\n\t\tbackoffThisBlock=false;\r\n\t\tspeedUpThisBlock=false;\r\n\t\tnextCongestionControlBlock=nextDatagramSequenceNumber;\r\n\t}\r\n\r\n\tif (IsInSlowStart())\r\n\t{\r\n\t\tcwnd+=MAXIMUM_MTU_INCLUDING_UDP_HEADER;\r\n\t\tif (cwnd > ssThresh && ssThresh!=0)\r\n\t\t\tcwnd = ssThresh + MAXIMUM_MTU_INCLUDING_UDP_HEADER*MAXIMUM_MTU_INCLUDING_UDP_HEADER\/cwnd;\r\n\r\n\t\t\/\/ CC PRINTF\r\n\t\/\/\tprintf(\"++ %.0f Slow start increase.\\n\", cwnd);\r\n\r\n\t}\r\n\telse if (isNewCongestionControlPeriod)\r\n\t{\r\n\t\tcwnd+=MAXIMUM_MTU_INCLUDING_UDP_HEADER*MAXIMUM_MTU_INCLUDING_UDP_HEADER\/cwnd;\r\n\r\n\t\t\/\/ CC PRINTF\r\n\t\t\/\/ printf(\"+ %.0f Congestion avoidance increase.\\n\", cwnd);\r\n\t}\r\n}\r\n\/\/ ----------------------------------------------------------------------------------------------------------------------------\r\nvoid CCRakNetSlidingWindow::OnDuplicateAck( CCTimeType curTime, DatagramSequenceNumberType sequenceNumber )\r\n{\r\n\t(void) curTime;\r\n\t(void) sequenceNumber;\r\n}\r\n\/\/ ----------------------------------------------------------------------------------------------------------------------------\r\nvoid CCRakNetSlidingWindow::OnSendAckGetBAndAS(CCTimeType curTime, bool *hasBAndAS, BytesPerMicrosecond *_Bytes, BytesPerMicrosecond *_AS)\r\n{\r\n\t(void) curTime;\r\n\t(void) _Bytes;\r\n\t(void) _AS;\r\n\r\n\t*hasBAndAS=false;\r\n}\r\n\/\/ ----------------------------------------------------------------------------------------------------------------------------\r\nvoid CCRakNetSlidingWindow::OnSendAck(CCTimeType curTime, uint32_t numBytes)\r\n{\r\n\t(void) curTime;\r\n\t(void) numBytes;\r\n\r\n\toldestUnsentAck=0;\r\n}\r\n\/\/ ----------------------------------------------------------------------------------------------------------------------------\r\nvoid CCRakNetSlidingWindow::OnSendNACK(CCTimeType curTime, uint32_t numBytes)\r\n{\r\n\t(void) curTime;\r\n\t(void) numBytes;\r\n\r\n}\r\n\/\/ ----------------------------------------------------------------------------------------------------------------------------\r\nCCTimeType CCRakNetSlidingWindow::GetRTOForRetransmission(unsigned char timesSent) const\r\n{\r\n\t(void) timesSent;\r\n\r\n#if CC_TIME_TYPE_BytesYTES==4\r\n\tconst CCTimeType maxThreshold=2000;\r\n\t\/\/const CCTimeType minThreshold=100;\r\n\tconst CCTimeType additionalVariance=30;\r\n#else\r\n\tconst CCTimeType maxThreshold=2000000;\r\n\t\/\/const CCTimeType minThreshold=100000;\r\n\tconst CCTimeType additionalVariance=30000;\r\n#endif\r\n\r\n\r\n\tif (estimatedRTT==UNSET_TIME_US)\r\n\t\treturn maxThreshold;\r\n\r\n \t\/\/double u=1.0f;\r\n\tdouble u=2.0f;\r\n \tdouble q=4.0f;\r\n\r\n\tCCTimeType threshhold = (CCTimeType) (u * estimatedRTT + q * deviationRtt) + additionalVariance;\r\n\tif (threshhold > maxThreshold)\r\n\t\treturn maxThreshold;\r\n\treturn threshhold;\r\n}\r\n\/\/ ----------------------------------------------------------------------------------------------------------------------------\r\nvoid CCRakNetSlidingWindow::SetMTU(uint32_t bytes)\r\n{\r\n\tRakAssert(bytes < MAXIMUM_MTU_SIZE);\r\n\tMAXIMUM_MTU_INCLUDING_UDP_HEADER=bytes;\r\n}\r\n\/\/ ----------------------------------------------------------------------------------------------------------------------------\r\nuint32_t CCRakNetSlidingWindow::GetMTU(void) const\r\n{\r\n\treturn MAXIMUM_MTU_INCLUDING_UDP_HEADER;\r\n}\r\n\/\/ ----------------------------------------------------------------------------------------------------------------------------\r\nBytesPerMicrosecond CCRakNetSlidingWindow::GetLocalReceiveRate(CCTimeType currentTime) const\r\n{\r\n\t(void) currentTime;\r\n\r\n\treturn 0; \/\/ TODO\r\n}\r\n\/\/ ----------------------------------------------------------------------------------------------------------------------------\r\ndouble CCRakNetSlidingWindow::GetRTT(void) const\r\n{\r\n\tif (lastRtt==UNSET_TIME_US)\r\n\t\treturn 0.0;\r\n\treturn lastRtt;\r\n}\r\n\/\/ ----------------------------------------------------------------------------------------------------------------------------\r\nbool CCRakNetSlidingWindow::GreaterThan(DatagramSequenceNumberType a, DatagramSequenceNumberType b)\r\n{\r\n\t\/\/ a > b?\r\n\tconst DatagramSequenceNumberType halfSpan =(DatagramSequenceNumberType) (((DatagramSequenceNumberType)(const uint32_t)-1)\/(DatagramSequenceNumberType)2);\r\n\treturn b!=a && b-a>halfSpan;\r\n}\r\n\/\/ ----------------------------------------------------------------------------------------------------------------------------\r\nbool CCRakNetSlidingWindow::LessThan(DatagramSequenceNumberType a, DatagramSequenceNumberType b)\r\n{\r\n\t\/\/ a < b?\r\n\tconst DatagramSequenceNumberType halfSpan = ((DatagramSequenceNumberType)(const uint32_t)-1)\/(DatagramSequenceNumberType)2;\r\n\treturn b!=a && b-a<halfSpan;\r\n}\r\n\/\/ ----------------------------------------------------------------------------------------------------------------------------\r\nuint64_t CCRakNetSlidingWindow::GetBytesPerSecondLimitByCongestionControl(void) const\r\n{\r\n\treturn 0; \/\/ TODO\r\n}\r\n\/\/ ----------------------------------------------------------------------------------------------------------------------------\r\nCCTimeType CCRakNetSlidingWindow::GetSenderRTOForACK(void) const\r\n{\r\n\tif (lastRtt==UNSET_TIME_US)\r\n\t\treturn (CCTimeType) UNSET_TIME_US;\r\n\treturn (CCTimeType)(lastRtt + SYN);\r\n}\r\n\/\/ ----------------------------------------------------------------------------------------------------------------------------\r\nbool CCRakNetSlidingWindow::IsInSlowStart(void) const\r\n{\r\n\treturn cwnd <= ssThresh || ssThresh==0;\r\n}\r\n\/\/ ----------------------------------------------------------------------------------------------------------------------------\r\n#endif\r\n<commit_msg>Fixed vs2015 build.<commit_after>\/*\r\n * Copyright (c) 2014, Oculus VR, Inc.\r\n * All rights reserved.\r\n *\r\n * This source code is licensed under the BSD-style license found in the\r\n * LICENSE file in the root directory of this source tree. An additional grant \r\n * of patent rights can be found in the PATENTS file in the same directory.\r\n *\r\n *\/\r\n\r\n#include \"CCRakNetSlidingWindow.h\"\r\n\r\n#if USE_SLIDING_WINDOW_CONGESTION_CONTROL==1\r\n\r\nstatic const double UNSET_TIME_US=-1;\r\n\r\n#if CC_TIME_TYPE_BytesYTES==4\r\nstatic const CCTimeType SYN=10;\r\n#else\r\nstatic const CCTimeType SYN=10000;\r\n#endif\r\n\r\n#include \"MTUSize.h\"\r\n#include <stdio.h>\r\n#include <math.h>\r\n#include <stdlib.h>\r\n#include \"RakAssert.h\"\r\n#include \"RakAlloca.h\"\r\n\r\nusing namespace RakNet;\r\n\r\n\/\/ ****************************************************** PUBLIC METHODS ******************************************************\r\n\r\nCCRakNetSlidingWindow::CCRakNetSlidingWindow()\r\n{\r\n}\r\n\/\/ ----------------------------------------------------------------------------------------------------------------------------\r\nCCRakNetSlidingWindow::~CCRakNetSlidingWindow()\r\n{\r\n\r\n}\r\n\/\/ ----------------------------------------------------------------------------------------------------------------------------\r\nvoid CCRakNetSlidingWindow::Init(CCTimeType curTime, uint32_t maxDatagramPayload)\r\n{\r\n\t(void) curTime;\r\n\r\n\tlastRtt=estimatedRTT=deviationRtt=UNSET_TIME_US;\r\n\tRakAssert(maxDatagramPayload <= MAXIMUM_MTU_SIZE);\r\n\tMAXIMUM_MTU_INCLUDING_UDP_HEADER=maxDatagramPayload;\r\n\tcwnd=maxDatagramPayload;\r\n\tssThresh=0.0;\r\n\toldestUnsentAck=0;\r\n\tnextDatagramSequenceNumber=0;\r\n\tnextCongestionControlBlock=0;\r\n\tbackoffThisBlock=speedUpThisBlock=false;\r\n\texpectedNextSequenceNumber=0;\r\n\t_isContinuousSend=false;\r\n}\r\n\/\/ ----------------------------------------------------------------------------------------------------------------------------\r\nvoid CCRakNetSlidingWindow::Update(CCTimeType curTime, bool hasDataToSendOrResend)\r\n{\r\n\t(void) curTime;\r\n\t(void) hasDataToSendOrResend;\r\n}\r\n\/\/ ----------------------------------------------------------------------------------------------------------------------------\r\nint CCRakNetSlidingWindow::GetRetransmissionBandwidth(CCTimeType curTime, CCTimeType timeSinceLastTick, uint32_t unacknowledgedBytes, bool isContinuousSend)\r\n{\r\n\t(void) curTime;\r\n\t(void) isContinuousSend;\r\n\t(void) timeSinceLastTick;\r\n\r\n\treturn unacknowledgedBytes;\r\n}\r\n\/\/ ----------------------------------------------------------------------------------------------------------------------------\r\nint CCRakNetSlidingWindow::GetTransmissionBandwidth(CCTimeType curTime, CCTimeType timeSinceLastTick, uint32_t unacknowledgedBytes, bool isContinuousSend)\r\n{\r\n\t(void) curTime;\r\n\t(void) timeSinceLastTick;\r\n\r\n\t_isContinuousSend=isContinuousSend;\r\n\r\n\tif (unacknowledgedBytes<=cwnd)\r\n\t\treturn (int) (cwnd-unacknowledgedBytes);\r\n\telse\r\n\t\treturn 0;\r\n}\r\n\/\/ ----------------------------------------------------------------------------------------------------------------------------\r\nbool CCRakNetSlidingWindow::ShouldSendACKs(CCTimeType curTime, CCTimeType estimatedTimeToNextTick)\r\n{\r\n\tCCTimeType rto = GetSenderRTOForACK();\r\n\t(void) estimatedTimeToNextTick;\r\n\r\n\t\/\/ iphone crashes on comparison between double and int64 http:\/\/www.jenkinssoftware.com\/forum\/index.php?topic=2717.0\r\n\tif (rto==(CCTimeType) UNSET_TIME_US)\r\n\t{\r\n\t\t\/\/ Unknown how long until the remote system will retransmit, so better send right away\r\n\t\treturn true;\r\n\t}\r\n\r\n\treturn curTime >= oldestUnsentAck + SYN;\r\n}\r\n\/\/ ----------------------------------------------------------------------------------------------------------------------------\r\nDatagramSequenceNumberType CCRakNetSlidingWindow::GetNextDatagramSequenceNumber(void)\r\n{\r\n\treturn nextDatagramSequenceNumber;\r\n}\r\n\/\/ ----------------------------------------------------------------------------------------------------------------------------\r\nDatagramSequenceNumberType CCRakNetSlidingWindow::GetAndIncrementNextDatagramSequenceNumber(void)\r\n{\r\n\tDatagramSequenceNumberType dsnt=nextDatagramSequenceNumber;\r\n\tnextDatagramSequenceNumber++;\r\n\treturn dsnt;\r\n}\r\n\/\/ ----------------------------------------------------------------------------------------------------------------------------\r\nvoid CCRakNetSlidingWindow::OnSendBytes(CCTimeType curTime, uint32_t numBytes)\r\n{\r\n\t(void) curTime;\r\n\t(void) numBytes;\r\n}\r\n\/\/ ----------------------------------------------------------------------------------------------------------------------------\r\nvoid CCRakNetSlidingWindow::OnGotPacketPair(DatagramSequenceNumberType datagramSequenceNumber, uint32_t sizeInBytes, CCTimeType curTime)\r\n{\r\n\t(void) curTime;\r\n\t(void) sizeInBytes;\r\n\t(void) datagramSequenceNumber;\r\n}\r\n\/\/ ----------------------------------------------------------------------------------------------------------------------------\r\nbool CCRakNetSlidingWindow::OnGotPacket(DatagramSequenceNumberType datagramSequenceNumber, bool isContinuousSend, CCTimeType curTime, uint32_t sizeInBytes, uint32_t *skippedMessageCount)\r\n{\r\n\t(void) curTime;\r\n\t(void) sizeInBytes;\r\n\t(void) isContinuousSend;\r\n\r\n\tif (oldestUnsentAck==0)\r\n\t\toldestUnsentAck=curTime;\r\n\r\n\tif (datagramSequenceNumber==expectedNextSequenceNumber)\r\n\t{\r\n\t\t*skippedMessageCount=0;\r\n\t\texpectedNextSequenceNumber=datagramSequenceNumber+(DatagramSequenceNumberType)1;\r\n\t}\r\n\telse if (GreaterThan(datagramSequenceNumber, expectedNextSequenceNumber))\r\n\t{\r\n\t\t*skippedMessageCount=datagramSequenceNumber-expectedNextSequenceNumber;\r\n\t\t\/\/ Sanity check, just use timeout resend if this was really valid\r\n\t\tif (*skippedMessageCount>1000)\r\n\t\t{\r\n\t\t\t\/\/ During testing, the nat punchthrough server got 51200 on the first packet. I have no idea where this comes from, but has happened twice\r\n\t\t\tif (*skippedMessageCount>(uint32_t)50000)\r\n\t\t\t\treturn false;\r\n\t\t\t*skippedMessageCount=1000;\r\n\t\t}\r\n\t\texpectedNextSequenceNumber=datagramSequenceNumber+(DatagramSequenceNumberType)1;\r\n\t}\r\n\telse\r\n\t{\r\n\t\t*skippedMessageCount=0;\r\n\t}\r\n\r\n\treturn true;\r\n}\r\n\/\/ ----------------------------------------------------------------------------------------------------------------------------\r\nvoid CCRakNetSlidingWindow::OnResend(CCTimeType curTime, RakNet::TimeUS nextActionTime)\r\n{\r\n\t(void) curTime;\r\n\t(void) nextActionTime;\r\n\r\n\tif (_isContinuousSend && backoffThisBlock==false && cwnd>MAXIMUM_MTU_INCLUDING_UDP_HEADER*2)\r\n\t{\r\n\t\t\/\/ Spec says 1\/2 cwnd, but it never recovers because cwnd increases too slowly\r\n\t\t\/\/ssThresh=cwnd-8.0 * (MAXIMUM_MTU_INCLUDING_UDP_HEADER*MAXIMUM_MTU_INCLUDING_UDP_HEADER\/cwnd);\r\n\t\tssThresh=cwnd\/2;\r\n\t\tif (ssThresh<MAXIMUM_MTU_INCLUDING_UDP_HEADER)\r\n\t\t\tssThresh=MAXIMUM_MTU_INCLUDING_UDP_HEADER;\r\n\t\tcwnd=MAXIMUM_MTU_INCLUDING_UDP_HEADER;\r\n\r\n\t\t\/\/ Only backoff once per period\r\n\t\tnextCongestionControlBlock=nextDatagramSequenceNumber;\r\n\t\tbackoffThisBlock=true;\r\n\r\n\t\t\/\/ CC PRINTF\r\n\t\t\/\/printf(\"-- %.0f (Resend) Enter slow start.\\n\", cwnd);\r\n\t}\r\n}\r\n\/\/ ----------------------------------------------------------------------------------------------------------------------------\r\nvoid CCRakNetSlidingWindow::OnNAK(CCTimeType curTime, DatagramSequenceNumberType nakSequenceNumber)\r\n{\r\n\t(void) nakSequenceNumber;\r\n\t(void) curTime;\r\n\r\n\tif (_isContinuousSend && backoffThisBlock==false)\r\n\t{\r\n\t\t\/\/ Start congestion avoidance\r\n\t\tssThresh=cwnd\/2;\r\n\r\n\t\t\/\/ CC PRINTF\r\n\t\t\/\/printf(\"- %.0f (NAK) Set congestion avoidance.\\n\", cwnd);\r\n\t}\r\n}\r\n\/\/ ----------------------------------------------------------------------------------------------------------------------------\r\nvoid CCRakNetSlidingWindow::OnAck(CCTimeType curTime, CCTimeType rtt, bool hasBAndAS, BytesPerMicrosecond _Bytes, BytesPerMicrosecond _AS, double totalUserDataBytesAcked, bool isContinuousSend, DatagramSequenceNumberType sequenceNumber )\r\n{\r\n\t(void) _Bytes;\r\n\t(void) totalUserDataBytesAcked;\r\n\t(void) _AS;\r\n\t(void) hasBAndAS;\r\n\t(void) curTime;\r\n\t(void) rtt;\r\n\r\n\tlastRtt=(double) rtt;\r\n\tif (estimatedRTT==UNSET_TIME_US)\r\n\t{\r\n\t\testimatedRTT=(double) rtt;\r\n\t\tdeviationRtt=(double)rtt;\r\n\t}\r\n\telse\r\n\t{\r\n\t\tdouble d = .05;\r\n\t\tdouble difference = rtt - estimatedRTT;\r\n\t\testimatedRTT = estimatedRTT + d * difference;\r\n\t\tdeviationRtt = deviationRtt + d * (fabs(difference) - deviationRtt);\r\n\t}\r\n\r\n\t_isContinuousSend=isContinuousSend;\r\n\r\n\tif (isContinuousSend==false)\r\n\t\treturn;\r\n\r\n\tbool isNewCongestionControlPeriod;\r\n\tisNewCongestionControlPeriod = GreaterThan(sequenceNumber, nextCongestionControlBlock);\r\n\r\n\tif (isNewCongestionControlPeriod)\r\n\t{\r\n\t\tbackoffThisBlock=false;\r\n\t\tspeedUpThisBlock=false;\r\n\t\tnextCongestionControlBlock=nextDatagramSequenceNumber;\r\n\t}\r\n\r\n\tif (IsInSlowStart())\r\n\t{\r\n\t\tcwnd+=MAXIMUM_MTU_INCLUDING_UDP_HEADER;\r\n\t\tif (cwnd > ssThresh && ssThresh!=0)\r\n\t\t\tcwnd = ssThresh + MAXIMUM_MTU_INCLUDING_UDP_HEADER*MAXIMUM_MTU_INCLUDING_UDP_HEADER\/cwnd;\r\n\r\n\t\t\/\/ CC PRINTF\r\n\t\/\/\tprintf(\"++ %.0f Slow start increase.\\n\", cwnd);\r\n\r\n\t}\r\n\telse if (isNewCongestionControlPeriod)\r\n\t{\r\n\t\tcwnd+=MAXIMUM_MTU_INCLUDING_UDP_HEADER*MAXIMUM_MTU_INCLUDING_UDP_HEADER\/cwnd;\r\n\r\n\t\t\/\/ CC PRINTF\r\n\t\t\/\/ printf(\"+ %.0f Congestion avoidance increase.\\n\", cwnd);\r\n\t}\r\n}\r\n\/\/ ----------------------------------------------------------------------------------------------------------------------------\r\nvoid CCRakNetSlidingWindow::OnDuplicateAck( CCTimeType curTime, DatagramSequenceNumberType sequenceNumber )\r\n{\r\n\t(void) curTime;\r\n\t(void) sequenceNumber;\r\n}\r\n\/\/ ----------------------------------------------------------------------------------------------------------------------------\r\nvoid CCRakNetSlidingWindow::OnSendAckGetBAndAS(CCTimeType curTime, bool *hasBAndAS, BytesPerMicrosecond *_Bytes, BytesPerMicrosecond *_AS)\r\n{\r\n\t(void) curTime;\r\n\t(void) _Bytes;\r\n\t(void) _AS;\r\n\r\n\t*hasBAndAS=false;\r\n}\r\n\/\/ ----------------------------------------------------------------------------------------------------------------------------\r\nvoid CCRakNetSlidingWindow::OnSendAck(CCTimeType curTime, uint32_t numBytes)\r\n{\r\n\t(void) curTime;\r\n\t(void) numBytes;\r\n\r\n\toldestUnsentAck=0;\r\n}\r\n\/\/ ----------------------------------------------------------------------------------------------------------------------------\r\nvoid CCRakNetSlidingWindow::OnSendNACK(CCTimeType curTime, uint32_t numBytes)\r\n{\r\n\t(void) curTime;\r\n\t(void) numBytes;\r\n\r\n}\r\n\/\/ ----------------------------------------------------------------------------------------------------------------------------\r\nCCTimeType CCRakNetSlidingWindow::GetRTOForRetransmission(unsigned char timesSent) const\r\n{\r\n\t(void) timesSent;\r\n\r\n#if CC_TIME_TYPE_BytesYTES==4\r\n\tconst CCTimeType maxThreshold=2000;\r\n\t\/\/const CCTimeType minThreshold=100;\r\n\tconst CCTimeType additionalVariance=30;\r\n#else\r\n\tconst CCTimeType maxThreshold=2000000;\r\n\t\/\/const CCTimeType minThreshold=100000;\r\n\tconst CCTimeType additionalVariance=30000;\r\n#endif\r\n\r\n\r\n\tif (estimatedRTT==UNSET_TIME_US)\r\n\t\treturn maxThreshold;\r\n\r\n \t\/\/double u=1.0f;\r\n\tdouble u=2.0f;\r\n \tdouble q=4.0f;\r\n\r\n\tCCTimeType threshhold = (CCTimeType) (u * estimatedRTT + q * deviationRtt) + additionalVariance;\r\n\tif (threshhold > maxThreshold)\r\n\t\treturn maxThreshold;\r\n\treturn threshhold;\r\n}\r\n\/\/ ----------------------------------------------------------------------------------------------------------------------------\r\nvoid CCRakNetSlidingWindow::SetMTU(uint32_t bytes)\r\n{\r\n\tRakAssert(bytes < MAXIMUM_MTU_SIZE);\r\n\tMAXIMUM_MTU_INCLUDING_UDP_HEADER=bytes;\r\n}\r\n\/\/ ----------------------------------------------------------------------------------------------------------------------------\r\nuint32_t CCRakNetSlidingWindow::GetMTU(void) const\r\n{\r\n\treturn MAXIMUM_MTU_INCLUDING_UDP_HEADER;\r\n}\r\n\/\/ ----------------------------------------------------------------------------------------------------------------------------\r\nBytesPerMicrosecond CCRakNetSlidingWindow::GetLocalReceiveRate(CCTimeType currentTime) const\r\n{\r\n\t(void) currentTime;\r\n\r\n\treturn 0; \/\/ TODO\r\n}\r\n\/\/ ----------------------------------------------------------------------------------------------------------------------------\r\ndouble CCRakNetSlidingWindow::GetRTT(void) const\r\n{\r\n\tif (lastRtt==UNSET_TIME_US)\r\n\t\treturn 0.0;\r\n\treturn lastRtt;\r\n}\r\n\/\/ ----------------------------------------------------------------------------------------------------------------------------\r\nbool CCRakNetSlidingWindow::GreaterThan(DatagramSequenceNumberType a, DatagramSequenceNumberType b)\r\n{\r\n\t\/\/ a > b?\r\n\tconst DatagramSequenceNumberType halfSpan =(DatagramSequenceNumberType) (((DatagramSequenceNumberType)(const uint32_t)-1)\/(DatagramSequenceNumberType)2);\r\n\treturn b!=a && b-a>halfSpan;\r\n}\r\n\/\/ ----------------------------------------------------------------------------------------------------------------------------\r\nbool CCRakNetSlidingWindow::LessThan(DatagramSequenceNumberType a, DatagramSequenceNumberType b)\r\n{\r\n\t\/\/ a < b?\r\n\tconst DatagramSequenceNumberType halfSpan = ((DatagramSequenceNumberType)(const uint32_t)-1)\/(DatagramSequenceNumberType)2;\r\n\treturn b!=a && b-a<halfSpan;\r\n}\r\n\/\/ ----------------------------------------------------------------------------------------------------------------------------\r\nuint64_t CCRakNetSlidingWindow::GetBytesPerSecondLimitByCongestionControl(void) const\r\n{\r\n\treturn 0; \/\/ TODO\r\n}\r\n\/\/ ----------------------------------------------------------------------------------------------------------------------------\r\nCCTimeType CCRakNetSlidingWindow::GetSenderRTOForACK(void) const\r\n{\r\n\tif (lastRtt==UNSET_TIME_US)\r\n\t\treturn (CCTimeType) UNSET_TIME_US;\r\n\treturn (CCTimeType)(lastRtt + SYN);\r\n}\r\n\/\/ ----------------------------------------------------------------------------------------------------------------------------\r\nbool CCRakNetSlidingWindow::IsInSlowStart(void) const\r\n{\r\n\treturn cwnd <= ssThresh || ssThresh==0;\r\n}\r\n\/\/ ----------------------------------------------------------------------------------------------------------------------------\r\n#endif\r\n<|endoftext|>"} {"text":"<commit_before>\/***\n * Copyright (c) 2013, Dan Hasting\n * All rights reserved.\n *\n * Redistribution and use in source and binary forms, with or without\n * modification, are permitted provided that the following conditions\n * are met:\n *\n * 1. Redistributions of source code must retain the above copyright\n * notice, this list of conditions and the following disclaimer.\n * 2. Redistributions in binary form must reproduce the above copyright\n * notice, this list of conditions and the following disclaimer in the\n * documentation and\/or other materials provided with the distribution.\n * 3. Neither the name of the organization nor the names of its\n * contributors may be used to endorse or promote products derived from\n * this software without specific prior written permission.\n *\n * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS \"AS IS\"\n * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE\n * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE\n * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE\n * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR\n * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF\n * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS\n * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN\n * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)\n * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE\n * POSSIBILITY OF SUCH DAMAGE.\n *\n ***\/\n\n#include \"common.h\"\n#include \"global.h\"\n\n#include <QColor>\n#include <QDir>\n#include <QEventLoop>\n#include <QFile>\n#include <QSize>\n\n#include <quazip\/quazip.h>\n#include <quazip\/quazipfile.h>\n\n#ifdef Q_OS_WIN\n#include <QCoreApplication>\n#else\n#include <QDesktopServices>\n#endif\n\n\nQByteArray byteswap(QByteArray romData)\n{\n QByteArray flipped;\n\n if (romData.left(4).toHex() == \"37804012\") {\n for (int i = 0; i < romData.length(); i += 2)\n {\n flipped.append(romData[i + 1]);\n flipped.append(romData[i]);\n }\n return flipped;\n } else {\n return romData;\n }\n}\n\n\nQString getDataLocation()\n{\n QString dataDir;\n\n#ifdef Q_OS_WIN\n dataDir = QCoreApplication::applicationDirPath();\n#else\n\n#if QT_VERSION >= 0x050000\n dataDir = QStandardPaths::writableLocation(QStandardPaths::DataLocation)\n .replace(\"CEN64\/CEN64-Qt\",\"cen64-qt\");\n#else\n dataDir = QDesktopServices::storageLocation(QDesktopServices::DataLocation)\n .remove(\"data\/\").replace(\"CEN64\/CEN64-Qt\",\"cen64-qt\");\n#endif\n\n#endif\n\n QDir data(dataDir);\n if (!data.exists())\n data.mkpath(dataDir);\n\n return dataDir;\n}\n\n\nQColor getColor(QString color, int transparency)\n{\n if (transparency <= 255) {\n if (color == \"Black\") return QColor(0, 0, 0, transparency);\n else if (color == \"White\") return QColor(255, 255, 255, transparency);\n else if (color == \"Light Gray\") return QColor(200, 200, 200, transparency);\n else if (color == \"Dark Gray\") return QColor(50, 50, 59, transparency);\n else if (color == \"Green\") return QColor(0, 255, 0, transparency);\n else if (color == \"Cyan\") return QColor(30, 175, 255, transparency);\n else if (color == \"Blue\") return QColor(0, 0, 255, transparency);\n else if (color == \"Purple\") return QColor(128, 0, 128, transparency);\n else if (color == \"Red\") return QColor(255, 0, 0, transparency);\n else if (color == \"Pink\") return QColor(246, 96, 171, transparency);\n else if (color == \"Orange\") return QColor(255, 165, 0, transparency);\n else if (color == \"Yellow\") return QColor(255, 255, 0, transparency);\n else if (color == \"Brown\") return QColor(127, 70, 44, transparency);\n }\n\n return QColor(0, 0, 0, 255);\n}\n\n\nint getDefaultWidth(QString id, int imageWidth)\n{\n if (id == \"Overview\")\n return 400;\n else if (id == \"GoodName\" || id.left(8) == \"Filename\" || id == \"Game Title\")\n return 300;\n else if (id == \"MD5\")\n return 250;\n else if (id == \"Internal Name\" || id == \"Publisher\" || id == \"Developer\")\n return 200;\n else if (id == \"ESRB\" || id == \"Genre\")\n return 150;\n else if (id == \"Save Type\" || id == \"Release Date\")\n return 100;\n else if (id == \"CRC1\" || id == \"CRC2\")\n return 90;\n else if (id == \"Size\" || id == \"Rumble\" || id == \"Players\" || id == \"Rating\")\n return 75;\n else if (id == \"Game Cover\")\n return imageWidth;\n else\n return 100;\n}\n\n\nint getGridSize(QString which)\n{\n QString size = SETTINGS.value(\"Grid\/imagesize\",\"Medium\").toString();\n\n if (which == \"height\") {\n if (SETTINGS.value(\"Grid\/label\", \"true\").toString() == \"true\") {\n if (size == \"Extra Small\") return 65;\n if (size == \"Small\") return 90;\n if (size == \"Medium\") return 145;\n if (size == \"Large\") return 190;\n if (size == \"Extra Large\") return 250;\n } else {\n if (size == \"Extra Small\") return 47;\n if (size == \"Small\") return 71;\n if (size == \"Medium\") return 122;\n if (size == \"Large\") return 172;\n if (size == \"Extra Large\") return 224;\n }\n } else if (which == \"width\") {\n if (size == \"Extra Small\") return 60;\n if (size == \"Small\") return 90;\n if (size == \"Medium\") return 160;\n if (size == \"Large\") return 225;\n if (size == \"Extra Large\") return 300;\n } else if (which == \"font\") {\n if (size == \"Extra Small\") return 5;\n if (size == \"Small\") return 7;\n if (size == \"Medium\") return 10;\n if (size == \"Large\") return 12;\n if (size == \"Extra Large\") return 13;\n }\n return 0;\n}\n\n\nQSize getImageSize(QString view)\n{\n QString size = SETTINGS.value(view+\"\/imagesize\",\"Medium\").toString();\n\n if (view == \"Table\") {\n if (size == \"Extra Small\") return QSize(33, 24);\n if (size == \"Small\") return QSize(48, 35);\n if (size == \"Medium\") return QSize(69, 50);\n if (size == \"Large\") return QSize(103, 75);\n if (size == \"Extra Large\") return QSize(138, 100);\n } else if (view == \"Grid\" || view == \"List\") {\n if (size == \"Extra Small\") return QSize(48, 35);\n if (size == \"Small\") return QSize(69, 50);\n if (size == \"Medium\") return QSize(138, 100);\n if (size == \"Large\") return QSize(203, 150);\n if (size == \"Extra Large\") return QSize(276, 200);\n }\n\n return QSize();\n}\n\n\nQString getRomInfo(QString identifier, const Rom *rom, bool removeWarn, bool sort)\n{\n QString text = \"\";\n\n if (identifier == \"GoodName\")\n text = rom->goodName;\n else if (identifier == \"Filename\")\n text = rom->baseName;\n else if (identifier == \"Filename (extension)\")\n text = rom->fileName;\n else if (identifier == \"Zip File\")\n text = rom->zipFile;\n else if (identifier == \"Internal Name\")\n text = rom->internalName;\n else if (identifier == \"Size\")\n text = rom->size;\n else if (identifier == \"MD5\")\n text = rom->romMD5.toLower();\n else if (identifier == \"CRC1\")\n text = rom->CRC1.toLower();\n else if (identifier == \"CRC2\")\n text = rom->CRC2.toLower();\n else if (identifier == \"Players\")\n text = rom->players;\n else if (identifier == \"Rumble\")\n text = rom->rumble;\n else if (identifier == \"Save Type\")\n text = rom->saveType;\n else if (identifier == \"Game Title\")\n text = rom->gameTitle;\n else if (identifier == \"Release Date\")\n text = rom->releaseDate;\n else if (identifier == \"Overview\")\n text = rom->overview;\n else if (identifier == \"ESRB\")\n text = rom->esrb;\n else if (identifier == \"Genre\")\n text = rom->genre;\n else if (identifier == \"Publisher\")\n text = rom->publisher;\n else if (identifier == \"Developer\")\n text = rom->developer;\n else if (identifier == \"Rating\")\n text = rom->rating;\n\n if (!removeWarn)\n return text;\n else if (text == getTranslation(\"Unknown ROM\") ||\n text == getTranslation(\"Requires catalog file\") ||\n text == getTranslation(\"Not found\")) {\n if (sort)\n return \"ZZZ\"; \/\/Sort warnings at the end\n else\n return \"\";\n } else\n return text;\n}\n\n\nQGraphicsDropShadowEffect *getShadow(bool active)\n{\n QGraphicsDropShadowEffect *shadow = new QGraphicsDropShadowEffect;\n\n if (active) {\n shadow->setBlurRadius(25.0);\n shadow->setColor(getColor(SETTINGS.value(\"Grid\/activecolor\",\"Cyan\").toString(), 255));\n shadow->setOffset(0);\n } else {\n shadow->setBlurRadius(10.0);\n shadow->setColor(getColor(SETTINGS.value(\"Grid\/inactivecolor\",\"Black\").toString(), 200));\n shadow->setOffset(0);\n }\n\n return shadow;\n}\n\n\nQString getTranslation(QString text)\n{\n if (text == \"GoodName\") return QObject::tr(\"GoodName\");\n else if (text == \"Filename\") return QObject::tr(\"Filename\");\n else if (text == \"Filename (extension)\") return QObject::tr(\"Filename (extension)\");\n else if (text == \"Zip File\") return QObject::tr(\"Zip File\");\n else if (text == \"Internal Name\") return QObject::tr(\"Internal Name\");\n else if (text == \"Size\") return QObject::tr(\"Size\");\n else if (text == \"MD5\") return QObject::tr(\"MD5\");\n else if (text == \"CRC1\") return QObject::tr(\"CRC1\");\n else if (text == \"CRC2\") return QObject::tr(\"CRC2\");\n else if (text == \"Players\") return QObject::tr(\"Players\");\n else if (text == \"Rumble\") return QObject::tr(\"Rumble\");\n else if (text == \"Save Type\") return QObject::tr(\"Save Type\");\n else if (text == \"Game Title\") return QObject::tr(\"Game Title\");\n else if (text == \"Release Date\") return QObject::tr(\"Release Date\");\n else if (text == \"Overview\") return QObject::tr(\"Overview\");\n else if (text == \"ESRB\") return QObject::tr(\"ESRB\");\n else if (text == \"Genre\") return QObject::tr(\"Genre\");\n else if (text == \"Publisher\") return QObject::tr(\"Publisher\");\n else if (text == \"Developer\") return QObject::tr(\"Developer\");\n else if (text == \"Rating\") return QObject::tr(\"Rating\");\n else if (text == \"Game Cover\") return QObject::tr(\"Game Cover\");\n else if (text == \"Unknown ROM\") return QObject::tr(\"Unknown ROM\");\n else if (text == \"Requires catalog file\") return QObject::tr(\"Requires catalog file\");\n else if (text == \"Not found\") return QObject::tr(\"Not found\");\n\n return text;\n}\n\n\nQString getVersion()\n{\n QFile versionFile(\":\/other\/VERSION\");\n versionFile.open(QIODevice::ReadOnly);\n QString version = versionFile.readAll();\n versionFile.close();\n\n return version;\n}\n\n\nQStringList getZippedFiles(QString completeFileName)\n{\n QuaZip zipFile(completeFileName);\n zipFile.open(QuaZip::mdUnzip);\n QStringList files = zipFile.getFileNameList();\n zipFile.close();\n\n return files;\n}\n\n\nQByteArray *getZippedRom(QString romFileName, QString zipFile)\n{\n QuaZipFile zippedFile(zipFile, romFileName);\n\n zippedFile.open(QIODevice::ReadOnly);\n QByteArray *romData = new QByteArray();\n romData->append(zippedFile.readAll());\n zippedFile.close();\n\n return romData;\n}\n\n\nbool romSorter(const Rom &firstRom, const Rom &lastRom)\n{\n QString sort, direction;\n\n QString layout = SETTINGS.value(\"View\/layout\", \"None\").toString();\n if (layout == \"Grid View\") {\n sort = SETTINGS.value(\"Grid\/sort\", \"Filename\").toString();\n direction = SETTINGS.value(\"Grid\/sortdirection\", \"ascending\").toString();\n } else if (layout == \"List View\") {\n sort = SETTINGS.value(\"List\/sort\", \"Filename\").toString();\n direction = SETTINGS.value(\"List\/sortdirection\", \"ascending\").toString();\n } else \/\/just return sort by filename\n return firstRom.fileName < lastRom.fileName;\n\n\n QString sortFirst = \"\", sortLast = \"\";\n\n if (sort == \"Size\") {\n int firstSize = firstRom.sortSize;\n int lastSize = lastRom.sortSize;\n\n if (direction == \"descending\")\n return firstSize > lastSize;\n else\n return firstSize < lastSize;\n } else if (sort == \"Release Date\") {\n sortFirst = firstRom.sortDate;\n sortLast = lastRom.sortDate;\n } else {\n sortFirst = getRomInfo(sort, &firstRom, true, true);\n sortLast = getRomInfo(sort, &lastRom, true, true);\n }\n\n if (sortFirst == sortLast) { \/\/Equal so sort on filename\n sortFirst = firstRom.fileName;\n sortLast = lastRom.fileName;\n }\n\n if (direction == \"descending\")\n return sortFirst > sortLast;\n else\n return sortFirst < sortLast;\n}\n<commit_msg>Fix sorting bug<commit_after>\/***\n * Copyright (c) 2013, Dan Hasting\n * All rights reserved.\n *\n * Redistribution and use in source and binary forms, with or without\n * modification, are permitted provided that the following conditions\n * are met:\n *\n * 1. Redistributions of source code must retain the above copyright\n * notice, this list of conditions and the following disclaimer.\n * 2. Redistributions in binary form must reproduce the above copyright\n * notice, this list of conditions and the following disclaimer in the\n * documentation and\/or other materials provided with the distribution.\n * 3. Neither the name of the organization nor the names of its\n * contributors may be used to endorse or promote products derived from\n * this software without specific prior written permission.\n *\n * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS \"AS IS\"\n * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE\n * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE\n * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE\n * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR\n * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF\n * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS\n * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN\n * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)\n * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE\n * POSSIBILITY OF SUCH DAMAGE.\n *\n ***\/\n\n#include \"common.h\"\n#include \"global.h\"\n\n#include <QColor>\n#include <QDir>\n#include <QEventLoop>\n#include <QFile>\n#include <QSize>\n\n#include <quazip\/quazip.h>\n#include <quazip\/quazipfile.h>\n\n#ifdef Q_OS_WIN\n#include <QCoreApplication>\n#else\n#include <QDesktopServices>\n#endif\n\n\nQByteArray byteswap(QByteArray romData)\n{\n QByteArray flipped;\n\n if (romData.left(4).toHex() == \"37804012\") {\n for (int i = 0; i < romData.length(); i += 2)\n {\n flipped.append(romData[i + 1]);\n flipped.append(romData[i]);\n }\n return flipped;\n } else {\n return romData;\n }\n}\n\n\nQString getDataLocation()\n{\n QString dataDir;\n\n#ifdef Q_OS_WIN\n dataDir = QCoreApplication::applicationDirPath();\n#else\n\n#if QT_VERSION >= 0x050000\n dataDir = QStandardPaths::writableLocation(QStandardPaths::DataLocation)\n .replace(\"CEN64\/CEN64-Qt\",\"cen64-qt\");\n#else\n dataDir = QDesktopServices::storageLocation(QDesktopServices::DataLocation)\n .remove(\"data\/\").replace(\"CEN64\/CEN64-Qt\",\"cen64-qt\");\n#endif\n\n#endif\n\n QDir data(dataDir);\n if (!data.exists())\n data.mkpath(dataDir);\n\n return dataDir;\n}\n\n\nQColor getColor(QString color, int transparency)\n{\n if (transparency <= 255) {\n if (color == \"Black\") return QColor(0, 0, 0, transparency);\n else if (color == \"White\") return QColor(255, 255, 255, transparency);\n else if (color == \"Light Gray\") return QColor(200, 200, 200, transparency);\n else if (color == \"Dark Gray\") return QColor(50, 50, 59, transparency);\n else if (color == \"Green\") return QColor(0, 255, 0, transparency);\n else if (color == \"Cyan\") return QColor(30, 175, 255, transparency);\n else if (color == \"Blue\") return QColor(0, 0, 255, transparency);\n else if (color == \"Purple\") return QColor(128, 0, 128, transparency);\n else if (color == \"Red\") return QColor(255, 0, 0, transparency);\n else if (color == \"Pink\") return QColor(246, 96, 171, transparency);\n else if (color == \"Orange\") return QColor(255, 165, 0, transparency);\n else if (color == \"Yellow\") return QColor(255, 255, 0, transparency);\n else if (color == \"Brown\") return QColor(127, 70, 44, transparency);\n }\n\n return QColor(0, 0, 0, 255);\n}\n\n\nint getDefaultWidth(QString id, int imageWidth)\n{\n if (id == \"Overview\")\n return 400;\n else if (id == \"GoodName\" || id.left(8) == \"Filename\" || id == \"Game Title\")\n return 300;\n else if (id == \"MD5\")\n return 250;\n else if (id == \"Internal Name\" || id == \"Publisher\" || id == \"Developer\")\n return 200;\n else if (id == \"ESRB\" || id == \"Genre\")\n return 150;\n else if (id == \"Save Type\" || id == \"Release Date\")\n return 100;\n else if (id == \"CRC1\" || id == \"CRC2\")\n return 90;\n else if (id == \"Size\" || id == \"Rumble\" || id == \"Players\" || id == \"Rating\")\n return 75;\n else if (id == \"Game Cover\")\n return imageWidth;\n else\n return 100;\n}\n\n\nint getGridSize(QString which)\n{\n QString size = SETTINGS.value(\"Grid\/imagesize\",\"Medium\").toString();\n\n if (which == \"height\") {\n if (SETTINGS.value(\"Grid\/label\", \"true\").toString() == \"true\") {\n if (size == \"Extra Small\") return 65;\n if (size == \"Small\") return 90;\n if (size == \"Medium\") return 145;\n if (size == \"Large\") return 190;\n if (size == \"Extra Large\") return 250;\n } else {\n if (size == \"Extra Small\") return 47;\n if (size == \"Small\") return 71;\n if (size == \"Medium\") return 122;\n if (size == \"Large\") return 172;\n if (size == \"Extra Large\") return 224;\n }\n } else if (which == \"width\") {\n if (size == \"Extra Small\") return 60;\n if (size == \"Small\") return 90;\n if (size == \"Medium\") return 160;\n if (size == \"Large\") return 225;\n if (size == \"Extra Large\") return 300;\n } else if (which == \"font\") {\n if (size == \"Extra Small\") return 5;\n if (size == \"Small\") return 7;\n if (size == \"Medium\") return 10;\n if (size == \"Large\") return 12;\n if (size == \"Extra Large\") return 13;\n }\n return 0;\n}\n\n\nQSize getImageSize(QString view)\n{\n QString size = SETTINGS.value(view+\"\/imagesize\",\"Medium\").toString();\n\n if (view == \"Table\") {\n if (size == \"Extra Small\") return QSize(33, 24);\n if (size == \"Small\") return QSize(48, 35);\n if (size == \"Medium\") return QSize(69, 50);\n if (size == \"Large\") return QSize(103, 75);\n if (size == \"Extra Large\") return QSize(138, 100);\n } else if (view == \"Grid\" || view == \"List\") {\n if (size == \"Extra Small\") return QSize(48, 35);\n if (size == \"Small\") return QSize(69, 50);\n if (size == \"Medium\") return QSize(138, 100);\n if (size == \"Large\") return QSize(203, 150);\n if (size == \"Extra Large\") return QSize(276, 200);\n }\n\n return QSize();\n}\n\n\nQString getRomInfo(QString identifier, const Rom *rom, bool removeWarn, bool sort)\n{\n QString text = \"\";\n\n if (identifier == \"GoodName\")\n text = rom->goodName;\n else if (identifier == \"Filename\")\n text = rom->baseName;\n else if (identifier == \"Filename (extension)\")\n text = rom->fileName;\n else if (identifier == \"Zip File\")\n text = rom->zipFile;\n else if (identifier == \"Internal Name\")\n text = rom->internalName;\n else if (identifier == \"Size\")\n text = rom->size;\n else if (identifier == \"MD5\")\n text = rom->romMD5.toLower();\n else if (identifier == \"CRC1\")\n text = rom->CRC1.toLower();\n else if (identifier == \"CRC2\")\n text = rom->CRC2.toLower();\n else if (identifier == \"Players\")\n text = rom->players;\n else if (identifier == \"Rumble\")\n text = rom->rumble;\n else if (identifier == \"Save Type\")\n text = rom->saveType;\n else if (identifier == \"Game Title\")\n text = rom->gameTitle;\n else if (identifier == \"Release Date\")\n text = rom->releaseDate;\n else if (identifier == \"Overview\")\n text = rom->overview;\n else if (identifier == \"ESRB\")\n text = rom->esrb;\n else if (identifier == \"Genre\")\n text = rom->genre;\n else if (identifier == \"Publisher\")\n text = rom->publisher;\n else if (identifier == \"Developer\")\n text = rom->developer;\n else if (identifier == \"Rating\")\n text = rom->rating;\n\n if (!removeWarn)\n return text;\n else if (text == getTranslation(\"Unknown ROM\") ||\n text == getTranslation(\"Requires catalog file\") ||\n text == getTranslation(\"Not found\")) {\n if (sort)\n return \"ZZZ\"; \/\/Sort warnings at the end\n else\n return \"\";\n } else\n return text;\n}\n\n\nQGraphicsDropShadowEffect *getShadow(bool active)\n{\n QGraphicsDropShadowEffect *shadow = new QGraphicsDropShadowEffect;\n\n if (active) {\n shadow->setBlurRadius(25.0);\n shadow->setColor(getColor(SETTINGS.value(\"Grid\/activecolor\",\"Cyan\").toString(), 255));\n shadow->setOffset(0);\n } else {\n shadow->setBlurRadius(10.0);\n shadow->setColor(getColor(SETTINGS.value(\"Grid\/inactivecolor\",\"Black\").toString(), 200));\n shadow->setOffset(0);\n }\n\n return shadow;\n}\n\n\nQString getTranslation(QString text)\n{\n if (text == \"GoodName\") return QObject::tr(\"GoodName\");\n else if (text == \"Filename\") return QObject::tr(\"Filename\");\n else if (text == \"Filename (extension)\") return QObject::tr(\"Filename (extension)\");\n else if (text == \"Zip File\") return QObject::tr(\"Zip File\");\n else if (text == \"Internal Name\") return QObject::tr(\"Internal Name\");\n else if (text == \"Size\") return QObject::tr(\"Size\");\n else if (text == \"MD5\") return QObject::tr(\"MD5\");\n else if (text == \"CRC1\") return QObject::tr(\"CRC1\");\n else if (text == \"CRC2\") return QObject::tr(\"CRC2\");\n else if (text == \"Players\") return QObject::tr(\"Players\");\n else if (text == \"Rumble\") return QObject::tr(\"Rumble\");\n else if (text == \"Save Type\") return QObject::tr(\"Save Type\");\n else if (text == \"Game Title\") return QObject::tr(\"Game Title\");\n else if (text == \"Release Date\") return QObject::tr(\"Release Date\");\n else if (text == \"Overview\") return QObject::tr(\"Overview\");\n else if (text == \"ESRB\") return QObject::tr(\"ESRB\");\n else if (text == \"Genre\") return QObject::tr(\"Genre\");\n else if (text == \"Publisher\") return QObject::tr(\"Publisher\");\n else if (text == \"Developer\") return QObject::tr(\"Developer\");\n else if (text == \"Rating\") return QObject::tr(\"Rating\");\n else if (text == \"Game Cover\") return QObject::tr(\"Game Cover\");\n else if (text == \"Unknown ROM\") return QObject::tr(\"Unknown ROM\");\n else if (text == \"Requires catalog file\") return QObject::tr(\"Requires catalog file\");\n else if (text == \"Not found\") return QObject::tr(\"Not found\");\n\n return text;\n}\n\n\nQString getVersion()\n{\n QFile versionFile(\":\/other\/VERSION\");\n versionFile.open(QIODevice::ReadOnly);\n QString version = versionFile.readAll();\n versionFile.close();\n\n return version;\n}\n\n\nQStringList getZippedFiles(QString completeFileName)\n{\n QuaZip zipFile(completeFileName);\n zipFile.open(QuaZip::mdUnzip);\n QStringList files = zipFile.getFileNameList();\n zipFile.close();\n\n return files;\n}\n\n\nQByteArray *getZippedRom(QString romFileName, QString zipFile)\n{\n QuaZipFile zippedFile(zipFile, romFileName);\n\n zippedFile.open(QIODevice::ReadOnly);\n QByteArray *romData = new QByteArray();\n romData->append(zippedFile.readAll());\n zippedFile.close();\n\n return romData;\n}\n\n\nbool romSorter(const Rom &firstRom, const Rom &lastRom)\n{\n QString sort, direction;\n\n QString layout = SETTINGS.value(\"View\/layout\", \"None\").toString();\n if (layout == \"grid\") {\n sort = SETTINGS.value(\"Grid\/sort\", \"Filename\").toString();\n direction = SETTINGS.value(\"Grid\/sortdirection\", \"ascending\").toString();\n } else if (layout == \"list\") {\n sort = SETTINGS.value(\"List\/sort\", \"Filename\").toString();\n direction = SETTINGS.value(\"List\/sortdirection\", \"ascending\").toString();\n } else \/\/just return sort by filename\n return firstRom.fileName < lastRom.fileName;\n\n\n QString sortFirst = \"\", sortLast = \"\";\n\n if (sort == \"Size\") {\n int firstSize = firstRom.sortSize;\n int lastSize = lastRom.sortSize;\n\n if (direction == \"descending\")\n return firstSize > lastSize;\n else\n return firstSize < lastSize;\n } else if (sort == \"Release Date\") {\n sortFirst = firstRom.sortDate;\n sortLast = lastRom.sortDate;\n } else {\n sortFirst = getRomInfo(sort, &firstRom, true, true);\n sortLast = getRomInfo(sort, &lastRom, true, true);\n }\n\n if (sortFirst == sortLast) { \/\/Equal so sort on filename\n sortFirst = firstRom.fileName;\n sortLast = lastRom.fileName;\n }\n\n if (direction == \"descending\")\n return sortFirst > sortLast;\n else\n return sortFirst < sortLast;\n}\n<|endoftext|>"} {"text":"<commit_before>\/*\nESP Wlan configurator\n*\/\n\n#include <ESP8266WebServer.h>\n#include <ESP8266WiFi.h>\n\n#include <EEPROM.h>\n\n#include <string>\n#include <time.h>\n\n#define EE_SIZE 512 \/\/ Size of eeprom\n#define EE_SSID_SIZE 32 \/\/ Max SSID size\n#define EE_PWD_SIZE 32 \/\/ Max password size\n#define EE_HOST_SIZE 32 \/\/ Max hostname size\n#define EE_SIG 0x7812 \/\/ Signature of a valid EEPROM content\n\n\/\/ WLAN configuration states\n#define ST_UNDEFINED 0 \/\/ Nothing\n#define ST_NOTCONFIGURED 1 \/\/ No valid WLAN configuration, starting AP\n#define ST_WAITFORCONFIG 2 \/\/ AP is started, waiting for User to enter data\n#define ST_INITCONFIGURED 3 \/\/ User entered connection information, closing AP\n#define ST_CONFIGURED 4 \/\/ Trying to connect to external AP\n#define ST_CONNECTED 5 \/\/ Connected to AP\n#define ST_STARTUPOK 6 \/\/ Cleanup\n#define ST_NORMALOPERATION 7 \/\/ Normal operation, connected to external AP\n\nString appName=\"MeisterWerk\";\n\nunsigned int uuid = 0; \/\/ Micro UUID\n\ntypedef struct t_eeprom {\n unsigned short int sig; \/\/ Only, if sig is equal to EE_SIG, content of eeprom is considered valid\n unsigned short int uuid; \/\/ current micro-UUID\n char SSID[EE_SSID_SIZE]; \/\/ Network SSID\n char password[EE_PWD_SIZE];\n char localhostname[EE_HOST_SIZE];\n char _fill[EE_SIZE - EE_SSID_SIZE - EE_HOST_SIZE - EE_PWD_SIZE - 2 * sizeof(short int)];\n} T_EEPROM;\n\nT_EEPROM eepr;\n\nESP8266WebServer webserver(80);\nString localhostname;\n\n\/\/ WLAN configuration states ST_*\nunsigned int state = ST_UNDEFINED;\n\nvoid initEEPROM(T_EEPROM *pep) {\n memset((void *)pep, 0, EE_SIZE);\n pep->sig = EE_SIG;\n pep->uuid = uuid;\n}\n\nvoid readEEPROM(T_EEPROM *pep) {\n unsigned char *buf=(unsigned char *)pep;\n for (int i = 0; i < EE_SIZE; i++) {\n buf[i] = EEPROM.read(i);\n }\n}\n\nvoid writeEEPROM(T_EEPROM *pep) {\n unsigned char *buf=(unsigned char *)pep;\n for (int i = 0; i < EE_SIZE; i++) {\n EEPROM.write(i, buf[i]);\n }\n EEPROM.commit();\n}\n\nString body;\nString header;\nString ipStr;\nint statusCode;\n\nunsigned int genUUID() {\n unsigned int uuid = random(65536);\n return uuid;\n}\n\nString UUIDtoString(unsigned int uuid) {\n char uuidstr[16];\n itoa(uuid, uuidstr, 16);\n return String(uuidstr);\n}\n\nString defaultHostname() {\n return appName+\"x\"+UUIDtoString(uuid);\n}\n\nvoid runWebServer() {\n webserver.on(\"\/\", []() {\n body = \"<!DOCTYPE HTML>\\r\\n<html>\";\n body += \"<h3>\"+header+\"<\/h3>\";\n body += \"<p>Esp Sensor at \" + ipStr + \", \" + localhostname + \", UUID=\"+UUIDtoString(uuid)+\"<\/p>\";\n body += \"<p><form method='get' action='save'>\"\n \"<label>SSID: <\/label><input name='ssid' value='\"+String(eepr.SSID)+\"' length=31><br>\"\n \"<label>Password: <\/label><input name='pass' type='password' value='\"+String(eepr.password)+\"' length=31><br>\"\n \"<label>Hostname: <\/label><input name='host' value='\"+String(eepr.localhostname)+\"' length=31><br>\"\n \"<input type='submit' value='Save'><\/form><\/p>\";\n body += \"<p><form method='get' action='factory'>\"\n \"<label>Factory reset:<\/label><br><input type='submit' value='Reset'><\/form><\/p>\";\n body += \"<\/html>\";\n webserver.send(200, \"text\/html\", body);\n });\n webserver.on(\"\/save\", []() {\n initEEPROM(&eepr);\n String ssid = webserver.arg(\"ssid\");\n String pwd = webserver.arg(\"pass\");\n String host = webserver.arg(\"host\");\n strncpy(eepr.SSID, ssid.c_str(), EE_SSID_SIZE - 1);\n strncpy(eepr.password, pwd.c_str(), EE_PWD_SIZE - 1);\n strncpy(eepr.localhostname, host.c_str(), EE_HOST_SIZE - 1);\n localhostname=String(eepr.localhostname);\n writeEEPROM(&eepr);\n body = \"{\\\"Success\\\":\\\"saved \" + ssid + \" to eeprom.\\\"}\";\n statusCode = 200;\n webserver.send(statusCode, \"application\/json\", body);\n state = ST_INITCONFIGURED;\n });\n webserver.on(\"\/factory\", []() {\n memset((unsigned char *)&eepr,0,sizeof(T_EEPROM));\n writeEEPROM(&eepr);\n body = \"{\\\"Success\\\":\\\"erased eeprom.\\\"}\";\n localhostname=defaultHostname();\n statusCode = 200;\n webserver.send(statusCode, \"application\/json\", body);\n state = ST_NOTCONFIGURED;\n });\n\n webserver.begin();\n}\n\n\/\/ Web server that runs during initial configuration, AP is ESP-module.\nvoid initialConfigServer() {\n IPAddress ip = WiFi.softAPIP();\n ipStr = String(ip[0]) + '.' + String(ip[1]) + '.' +\n String(ip[2]) + '.' + String(ip[3]);\n header=\"Access point mode\";\n runWebServer();\n}\n\n\/\/ Web server that runs if connected to external access point (normal operation)\nvoid startConfigServer() {\n IPAddress ip = WiFi.localIP();\n ipStr = String(ip[0]) + '.' + String(ip[1]) + '.' +\n String(ip[2]) + '.' + String(ip[3]);\n header=\"Client mode\";\n runWebServer();\n}\n\n\/\/ create local AP for initial config\nbool createAP(String name, String password=\"\") {\n IPAddress apIP(10, 1, 1, 1); \/\/ Private network address: local & gateway\n IPAddress apNet(255, 255, 255, 0);\n WiFi.mode(WIFI_AP_STA);\n WiFi.softAPConfig(apIP, apIP, apNet);\n if (password==\"\")\n WiFi.softAP(name.c_str());\n else\n WiFi.softAP(name.c_str(), password.c_str());\n WiFi.hostname(localhostname.c_str());\n state = ST_WAITFORCONFIG;\n initialConfigServer();\n}\n\nunsigned int connectTimeout=30; \/\/ Number seconds, a connect to configured access point is tried,\n \/\/ before a local access point is spawned.\n\/\/ connect to external AP, create a local AP if cnnection fails for connectTimeout secs.\nbool connectToAp() {\n WiFi.mode(WIFI_STA);\n Serial.println(\"Connecting to \"+String(eepr.SSID)+\", \"+String(eepr.password));\n WiFi.begin(eepr.SSID, eepr.password);\n WiFi.hostname(localhostname.c_str());\n digitalWrite(LED_BUILTIN, LOW); \/\/ LED on during connect-attempt\n for (int t=0; t<connectTimeout*10; t++) { \/\/ connectTimeout sec. timeout.\n if (WiFi.status() == WL_CONNECTED) {\n state=ST_CONNECTED;\n Serial.println(\"Connection successful!\");\n return true;\n }\n delay(100);\n }\n WiFi.disconnect();\n Serial.println(\"Connection failed!\");\n state=ST_NOTCONFIGURED; \/\/ This needs to be removed (or adapted) for Leo-Use-Case XXX-LEO\n \/\/ Setting state to NOTCONFIGURED causes spawning of local access point.\n \/\/ In order to retry connection with existing configuration, simply set to ST_CONFIGURED.\n return false;\n}\n\nvoid setup() {\n Serial.begin(9600);\n pinMode(LED_BUILTIN, OUTPUT);\n\n Serial.println(\"Starting up.\");\n EEPROM.begin(512);\n state = ST_CONFIGURED;\n readEEPROM(&eepr);\n if (eepr.sig != EE_SIG) {\n uuid = genUUID();\n Serial.println(\"New UUID generated.\");\n initEEPROM(&eepr);\n localhostname=defaultHostname();\n strncpy(eepr.localhostname,localhostname.c_str(),EE_HOST_SIZE-1); \n writeEEPROM(&eepr);\n } else {\n uuid=eepr.uuid;\n localhostname=String(eepr.localhostname);\n }\n Serial.println(\"Unique name: \"+localhostname);\n if (eepr.SSID[0] == 0) {\n Serial.println(\"State: ST_NOTCONFIGURED\");\n state = ST_NOTCONFIGURED;\n } else {\n Serial.println(\"State: ST_CONFIGURED\");\n state = ST_CONFIGURED;\n }\n}\n\nunsigned int ctr = 0;\nunsigned int blfreq=10000;\nvoid loop() { \/\/ non-blocking event loop\n ++ctr;\n\n switch (state) {\n case ST_NOTCONFIGURED:\n Serial.println(\"Unconfigured server, creating AP\");\n blfreq=10000; \/\/ fast blink: initial config\n createAP(localhostname); \/\/ use localhostname as network-name on initial setup.\n break;\n case ST_WAITFORCONFIG:\n break;\n case ST_INITCONFIGURED:\n Serial.println(\"Received connection information\");\n webserver.stop();\n WiFi.disconnect();\n state=ST_CONFIGURED;\n break;\n case ST_CONFIGURED:\n Serial.println(\"Configured, trying connect to AP\");\n connectToAp();\n break;\n case ST_CONNECTED:\n Serial.println(\"Connected to AP\");\n blfreq=20000; \/\/ slow blink: normal operation\n startConfigServer();\n state=ST_STARTUPOK;\n break;\n case ST_STARTUPOK:\n Serial.println(\"Ready for things to be done.\");\n state=ST_NORMALOPERATION;\n break;\n case ST_NORMALOPERATION:\n break;\n }\n\n if (ctr % blfreq == 0)\n digitalWrite(LED_BUILTIN, LOW); \/\/ Turn the LED on\n if (ctr % (blfreq*2) == 0)\n digitalWrite(LED_BUILTIN, HIGH); \/\/ Turn the LED off\n if (ctr > (blfreq*3))\n ctr = 0;\n\n webserver.handleClient(); \/\/ handle web requests\n}\n<commit_msg>Reset hostname of factory reset.<commit_after>\/*\nESP Wlan configurator\n*\/\n\n#include <ESP8266WebServer.h>\n#include <ESP8266WiFi.h>\n\n#include <EEPROM.h>\n\n#include <string>\n#include <time.h>\n\n#define EE_SIZE 512 \/\/ Size of eeprom\n#define EE_SSID_SIZE 32 \/\/ Max SSID size\n#define EE_PWD_SIZE 32 \/\/ Max password size\n#define EE_HOST_SIZE 32 \/\/ Max hostname size\n#define EE_SIG 0x7812 \/\/ Signature of a valid EEPROM content\n\n\/\/ WLAN configuration states\n#define ST_UNDEFINED 0 \/\/ Nothing\n#define ST_NOTCONFIGURED 1 \/\/ No valid WLAN configuration, starting AP\n#define ST_WAITFORCONFIG 2 \/\/ AP is started, waiting for User to enter data\n#define ST_INITCONFIGURED 3 \/\/ User entered connection information, closing AP\n#define ST_CONFIGURED 4 \/\/ Trying to connect to external AP\n#define ST_CONNECTED 5 \/\/ Connected to AP\n#define ST_STARTUPOK 6 \/\/ Cleanup\n#define ST_NORMALOPERATION 7 \/\/ Normal operation, connected to external AP\n\nString appName=\"MeisterWerk\";\n\nunsigned int uuid = 0; \/\/ Micro UUID\n\ntypedef struct t_eeprom {\n unsigned short int sig; \/\/ Only, if sig is equal to EE_SIG, content of eeprom is considered valid\n unsigned short int uuid; \/\/ current micro-UUID\n char SSID[EE_SSID_SIZE]; \/\/ Network SSID\n char password[EE_PWD_SIZE];\n char localhostname[EE_HOST_SIZE];\n char _fill[EE_SIZE - EE_SSID_SIZE - EE_HOST_SIZE - EE_PWD_SIZE - 2 * sizeof(short int)];\n} T_EEPROM;\n\nT_EEPROM eepr;\n\nESP8266WebServer webserver(80);\nString localhostname;\n\n\/\/ WLAN configuration states ST_*\nunsigned int state = ST_UNDEFINED;\n\nvoid initEEPROM(T_EEPROM *pep) {\n memset((void *)pep, 0, EE_SIZE);\n pep->sig = EE_SIG;\n pep->uuid = uuid;\n}\n\nvoid readEEPROM(T_EEPROM *pep) {\n unsigned char *buf=(unsigned char *)pep;\n for (int i = 0; i < EE_SIZE; i++) {\n buf[i] = EEPROM.read(i);\n }\n}\n\nvoid writeEEPROM(T_EEPROM *pep) {\n unsigned char *buf=(unsigned char *)pep;\n for (int i = 0; i < EE_SIZE; i++) {\n EEPROM.write(i, buf[i]);\n }\n EEPROM.commit();\n}\n\nString body;\nString header;\nString ipStr;\nint statusCode;\n\nunsigned int genUUID() {\n unsigned int uuid = random(65536);\n return uuid;\n}\n\nString UUIDtoString(unsigned int uuid) {\n char uuidstr[16];\n itoa(uuid, uuidstr, 16);\n return String(uuidstr);\n}\n\nString defaultHostname() {\n return appName+\"x\"+UUIDtoString(uuid);\n}\n\nvoid runWebServer() {\n webserver.on(\"\/\", []() {\n body = \"<!DOCTYPE HTML>\\r\\n<html>\";\n body += \"<h3>\"+header+\"<\/h3>\";\n body += \"<p>Esp Sensor at \" + ipStr + \", \" + localhostname + \", UUID=\"+UUIDtoString(uuid)+\"<\/p>\";\n body += \"<p><form method='get' action='save'>\"\n \"<label>SSID: <\/label><input name='ssid' value='\"+String(eepr.SSID)+\"' length=31><br>\"\n \"<label>Password: <\/label><input name='pass' type='password' value='\"+String(eepr.password)+\"' length=31><br>\"\n \"<label>Hostname: <\/label><input name='host' value='\"+String(eepr.localhostname)+\"' length=31><br>\"\n \"<input type='submit' value='Save'><\/form><\/p>\";\n body += \"<p><form method='get' action='factory'>\"\n \"<label>Factory reset:<\/label><br><input type='submit' value='Reset'><\/form><\/p>\";\n body += \"<\/html>\";\n webserver.send(200, \"text\/html\", body);\n });\n webserver.on(\"\/save\", []() {\n initEEPROM(&eepr);\n String ssid = webserver.arg(\"ssid\");\n String pwd = webserver.arg(\"pass\");\n String host = webserver.arg(\"host\");\n strncpy(eepr.SSID, ssid.c_str(), EE_SSID_SIZE - 1);\n strncpy(eepr.password, pwd.c_str(), EE_PWD_SIZE - 1);\n strncpy(eepr.localhostname, host.c_str(), EE_HOST_SIZE - 1);\n localhostname=String(eepr.localhostname);\n writeEEPROM(&eepr);\n body = \"{\\\"Success\\\":\\\"saved \" + ssid + \" to eeprom.\\\"}\";\n statusCode = 200;\n webserver.send(statusCode, \"application\/json\", body);\n state = ST_INITCONFIGURED;\n });\n webserver.on(\"\/factory\", []() {\n memset((unsigned char *)&eepr,0,sizeof(T_EEPROM));\n writeEEPROM(&eepr);\n body = \"{\\\"Success\\\":\\\"erased eeprom.\\\"}\";\n statusCode = 200;\n webserver.send(statusCode, \"application\/json\", body);\n state = ST_NOTCONFIGURED;\n });\n\n webserver.begin();\n}\n\n\/\/ Web server that runs during initial configuration, AP is ESP-module.\nvoid initialConfigServer() {\n IPAddress ip = WiFi.softAPIP();\n ipStr = String(ip[0]) + '.' + String(ip[1]) + '.' +\n String(ip[2]) + '.' + String(ip[3]);\n header=\"Access point mode\";\n runWebServer();\n}\n\n\/\/ Web server that runs if connected to external access point (normal operation)\nvoid startConfigServer() {\n IPAddress ip = WiFi.localIP();\n ipStr = String(ip[0]) + '.' + String(ip[1]) + '.' +\n String(ip[2]) + '.' + String(ip[3]);\n header=\"Client mode\";\n runWebServer();\n}\n\n\/\/ create local AP for initial config\nbool createAP(String name, String password=\"\") {\n IPAddress apIP(10, 1, 1, 1); \/\/ Private network address: local & gateway\n IPAddress apNet(255, 255, 255, 0);\n WiFi.mode(WIFI_AP_STA);\n WiFi.softAPConfig(apIP, apIP, apNet);\n if (password==\"\")\n WiFi.softAP(name.c_str());\n else\n WiFi.softAP(name.c_str(), password.c_str());\n WiFi.hostname(localhostname.c_str());\n state = ST_WAITFORCONFIG;\n initialConfigServer();\n}\n\nunsigned int connectTimeout=30; \/\/ Number seconds, a connect to configured access point is tried,\n \/\/ before a local access point is spawned.\n\/\/ connect to external AP, create a local AP if cnnection fails for connectTimeout secs.\nbool connectToAp() {\n WiFi.mode(WIFI_STA);\n Serial.println(\"Connecting to \"+String(eepr.SSID)+\", \"+String(eepr.password));\n WiFi.begin(eepr.SSID, eepr.password);\n WiFi.hostname(localhostname.c_str());\n digitalWrite(LED_BUILTIN, LOW); \/\/ LED on during connect-attempt\n for (int t=0; t<connectTimeout*10; t++) { \/\/ connectTimeout sec. timeout.\n if (WiFi.status() == WL_CONNECTED) {\n state=ST_CONNECTED;\n Serial.println(\"Connection successful!\");\n return true;\n }\n delay(100);\n }\n WiFi.disconnect();\n Serial.println(\"Connection failed!\");\n state=ST_NOTCONFIGURED; \/\/ This needs to be removed (or adapted) for Leo-Use-Case XXX-LEO\n \/\/ Setting state to NOTCONFIGURED causes spawning of local access point.\n \/\/ In order to retry connection with existing configuration, simply set to ST_CONFIGURED.\n return false;\n}\n\nvoid setup() {\n Serial.begin(9600);\n pinMode(LED_BUILTIN, OUTPUT);\n\n Serial.println(\"Starting up.\");\n EEPROM.begin(512);\n state = ST_CONFIGURED;\n readEEPROM(&eepr);\n if (eepr.sig != EE_SIG) {\n uuid = genUUID();\n Serial.println(\"New UUID generated.\");\n initEEPROM(&eepr);\n localhostname=defaultHostname();\n strncpy(eepr.localhostname,localhostname.c_str(),EE_HOST_SIZE-1); \n writeEEPROM(&eepr);\n } else {\n uuid=eepr.uuid;\n localhostname=String(eepr.localhostname);\n }\n Serial.println(\"Unique name: \"+localhostname);\n if (eepr.SSID[0] == 0) {\n Serial.println(\"State: ST_NOTCONFIGURED\");\n state = ST_NOTCONFIGURED;\n } else {\n Serial.println(\"State: ST_CONFIGURED\");\n state = ST_CONFIGURED;\n }\n}\n\nunsigned int ctr = 0;\nunsigned int blfreq=10000;\nvoid loop() { \/\/ non-blocking event loop\n ++ctr;\n\n switch (state) {\n case ST_NOTCONFIGURED:\n Serial.println(\"Unconfigured server, creating AP\");\n blfreq=10000; \/\/ fast blink: initial config\n localhostname=defaultHostname();\n createAP(localhostname); \/\/ use localhostname as network-name on initial setup.\n break;\n case ST_WAITFORCONFIG:\n break;\n case ST_INITCONFIGURED:\n Serial.println(\"Received connection information\");\n webserver.stop();\n WiFi.disconnect();\n state=ST_CONFIGURED;\n break;\n case ST_CONFIGURED:\n Serial.println(\"Configured, trying connect to AP\");\n connectToAp();\n break;\n case ST_CONNECTED:\n Serial.println(\"Connected to AP\");\n blfreq=20000; \/\/ slow blink: normal operation\n startConfigServer();\n state=ST_STARTUPOK;\n break;\n case ST_STARTUPOK:\n Serial.println(\"Ready for things to be done.\");\n state=ST_NORMALOPERATION;\n break;\n case ST_NORMALOPERATION:\n break;\n }\n\n if (ctr % blfreq == 0)\n digitalWrite(LED_BUILTIN, LOW); \/\/ Turn the LED on\n if (ctr % (blfreq*2) == 0)\n digitalWrite(LED_BUILTIN, HIGH); \/\/ Turn the LED off\n if (ctr > (blfreq*3))\n ctr = 0;\n\n webserver.handleClient(); \/\/ handle web requests\n}\n<|endoftext|>"} {"text":"<commit_before>#undef QT_NO_ASCII_CAST\n\/\/ kmacctlocal.cpp\n\n#ifdef HAVE_CONFIG_H\n#include <config.h>\n#endif\n\n#include <qdatetime.h>\n#include <qfileinfo.h>\n#include \"kmacctlocal.h\"\n#include \"kmfolder.h\"\n#include \"kmmessage.h\"\n#include \"kmacctfolder.h\"\n#include \"kmglobal.h\"\n#include \"kmbroadcaststatus.h\"\n\n#include <kapp.h>\n#include <kconfig.h>\n\n#include <stdlib.h>\n#include <stdio.h>\n#include <errno.h>\n#include <klocale.h>\n#include <kmessagebox.h>\n#include <kdebug.h>\n\n#ifdef HAVE_PATHS_H\n#include <paths.h>\t\/* defines _PATH_MAILDIR *\/\n#endif\n\n#ifndef _PATH_MAILDIR\n#define _PATH_MAILDIR \"\/var\/spool\/mail\"\n#endif\n#undef None\n\n\/\/-----------------------------------------------------------------------------\nKMAcctLocal::KMAcctLocal(KMAcctMgr* aOwner, const char* aAccountName):\n KMAcctLocalInherited(aOwner, aAccountName)\n{\n mLock = procmail_lockfile;\n}\n\n\n\/\/-----------------------------------------------------------------------------\nKMAcctLocal::~KMAcctLocal()\n{\n mLocation = \"\";\n}\n\n\n\/\/-----------------------------------------------------------------------------\nconst char* KMAcctLocal::type(void) const\n{\n return \"local\";\n}\n\n\n\/\/-----------------------------------------------------------------------------\nvoid KMAcctLocal::init(void)\n{\n mLocation = getenv(\"MAIL\");\n if (mLocation.isNull()) {\n mLocation = _PATH_MAILDIR;\n mLocation += \"\/\";\n mLocation += getenv(\"USER\");\n }\n setProcmailLockFileName(\"\");\n}\n\n\n\/\/-----------------------------------------------------------------------------\nvoid KMAcctLocal::pseudoAssign(KMAccount *account)\n{\n assert(account->type() == \"local\");\n KMAcctLocal *acct = static_cast<KMAcctLocal*>(account);\n setName(acct->name());\n setLocation(acct->location());\n setCheckInterval(acct->checkInterval());\n setCheckExclude(acct->checkExclude());\n setLockType(acct->lockType());\n setProcmailLockFileName(acct->procmailLockFileName());\n setFolder(acct->folder());\n setPrecommand(acct->precommand());\n}\n\n\/\/-----------------------------------------------------------------------------\nvoid KMAcctLocal::processNewMail(bool)\n{\n QTime t;\n hasNewMail = false;\n\n if ( precommand().isEmpty() ) {\n QFileInfo fi( location() );\n if ( fi.size() == 0 ) {\n emit finishedCheck(hasNewMail);\n return;\n }\n }\n\n KMFolder mailFolder(NULL, location());\n mailFolder.setLockType( mLock );\n if ( mLock == procmail_lockfile)\n mailFolder.setProcmailLockFileName( mProcmailLockFileName );\n\n long num = 0;\n long i;\n int rc;\n KMMessage* msg;\n bool addedOk;\n\n if (!mFolder) {\n emit finishedCheck(hasNewMail);\n return;\n }\n\n KMBroadcastStatus::instance()->reset();\n KMBroadcastStatus::instance()->setStatusMsg(\n\ti18n(\"Preparing transmission from %1...\").arg(mailFolder.name()));\n\n \/\/ run the precommand\n if (!runPrecommand(precommand()))\n {\n perror(\"cannot run precommand \"+precommand());\n\temit finishedCheck(hasNewMail);\n }\n\n mailFolder.setAutoCreateIndex(FALSE);\n\n rc = mailFolder.open();\n if (rc)\n {\n QString aStr;\n aStr = i18n(\"Cannot open file:\");\n aStr += mailFolder.path()+\"\/\"+mailFolder.name();\n KMessageBox::sorry(0, aStr);\n perror(\"cannot open file \"+mailFolder.path()+\"\/\"+mailFolder.name());\n emit finishedCheck(hasNewMail);\n KMBroadcastStatus::instance()->setStatusMsg( i18n( \"Transmission completed.\" ));\n return;\n }\n\n if (mailFolder.isReadOnly()) { \/\/ mailFolder is locked\n kdDebug() << \"mailFolder could not be locked\" << endl;\n mailFolder.close();\n emit finishedCheck(hasNewMail);\n KMBroadcastStatus::instance()->setStatusMsg( i18n( \"Transmission completed.\" ));\n return;\n }\n\n mFolder->quiet(TRUE);\n mFolder->open();\n\t\t\n\n num = mailFolder.count();\n\n addedOk = true;\n t.start();\n\n KMBroadcastStatus::instance()->setStatusProgressEnable( true );\n for (i=0; i<num; i++)\n {\n\n if (!addedOk) break;\n if (KMBroadcastStatus::instance()->abortRequested()) break;\n\n KMBroadcastStatus::instance()->setStatusMsg( i18n(\"Message \") +\n\t\t\t QString(\"%1\/%2\").arg(i).arg(num) );\n KMBroadcastStatus::instance()->setStatusProgressPercent( (i*100) \/ num );\n\n msg = mailFolder.take(0);\n if (msg)\n {\n msg->setStatus(msg->headerField(\"Status\"), msg->headerField(\"X-Status\"));\n addedOk = processNewMsg(msg);\n if (addedOk)\n\thasNewMail = true;\n }\n\n if (t.elapsed() >= 200) { \/\/hardwired constant\n kapp->processEvents();\n t.start();\n }\n\n }\n KMBroadcastStatus::instance()->setStatusProgressEnable( false );\n KMBroadcastStatus::instance()->reset();\n\n if (addedOk)\n {\n rc = mailFolder.expunge();\n if (rc)\n KMessageBox::information( 0, i18n(\"Cannot remove mail from\\nmailbox `%1':\\n%2\").arg(mailFolder.location().arg(strerror(rc))));\n KMBroadcastStatus::instance()->setStatusMsg( i18n( \"Transmission completed.\" ));\n }\n \/\/ else warning is written already\n\n mailFolder.close();\n mFolder->close();\n mFolder->quiet(FALSE);\n\n emit finishedCheck(hasNewMail);\n\n return;\n}\n\n\n\/\/-----------------------------------------------------------------------------\nvoid KMAcctLocal::readConfig(KConfig& config)\n{\n KMAcctLocalInherited::readConfig(config);\n mLocation = config.readEntry(\"Location\", mLocation);\n QString locktype = config.readEntry(\"LockType\", \"procmail_lockfile\" );\n\n if( locktype == \"procmail_lockfile\" ) {\n mLock = procmail_lockfile;\n mProcmailLockFileName = config.readEntry(\"ProcmailLockFile\",\n mLocation + \".lock\");\n } else if( locktype == \"mutt_dotlock\" )\n mLock = mutt_dotlock;\n else if( locktype == \"mutt_dotlock_privileged\" )\n mLock = mutt_dotlock_privileged;\n else if( locktype == \"none\" )\n mLock = None;\n else mLock = FCNTL;\n}\n\n\n\/\/-----------------------------------------------------------------------------\nvoid KMAcctLocal::writeConfig(KConfig& config)\n{\n KMAcctLocalInherited::writeConfig(config);\n\n config.writeEntry(\"Location\", mLocation);\n\n QString st = \"fcntl\";\n if (mLock == procmail_lockfile) st = \"procmail_lockfile\";\n else if (mLock == mutt_dotlock) st = \"mutt_dotlock\";\n else if (mLock == mutt_dotlock_privileged) st = \"mutt_dotlock_privileged\";\n else if (mLock == None) st = \"none\";\n config.writeEntry(\"LockType\", st);\n\n if (mLock == procmail_lockfile) {\n config.writeEntry(\"ProcmailLockFile\", mProcmailLockFileName);\n }\n\n}\n\n\n\/\/-----------------------------------------------------------------------------\nvoid KMAcctLocal::setLocation(const QString& aLocation)\n{\n mLocation = aLocation;\n}\n\nvoid\nKMAcctLocal::setProcmailLockFileName(QString s)\n{\n if (s && !s.isEmpty())\n mProcmailLockFileName = s;\n else\n mProcmailLockFileName = mLocation + \".lock\";\n}\n\n<commit_msg>Found another bug, while cleaning up data types. - KMessageBox::information( 0, i18n(\"Cannot remove mail from\\nmailbox `%1':\\n%2\").arg(mailFolder.location().arg(strerror(rc)))); + KMessageBox::information( 0, i18n(\"Cannot remove mail from\\nmailbox `%1':\\n%2\").arg(mailFolder.location()).arg(strerror(rc)));<commit_after>#undef QT_NO_ASCII_CAST\n\/\/ kmacctlocal.cpp\n\n#ifdef HAVE_CONFIG_H\n#include <config.h>\n#endif\n\n#include <qdatetime.h>\n#include <qfileinfo.h>\n#include \"kmacctlocal.h\"\n#include \"kmfolder.h\"\n#include \"kmmessage.h\"\n#include \"kmacctfolder.h\"\n#include \"kmglobal.h\"\n#include \"kmbroadcaststatus.h\"\n\n#include <kapp.h>\n#include <kconfig.h>\n\n#include <stdlib.h>\n#include <stdio.h>\n#include <errno.h>\n#include <klocale.h>\n#include <kmessagebox.h>\n#include <kdebug.h>\n\n#ifdef HAVE_PATHS_H\n#include <paths.h>\t\/* defines _PATH_MAILDIR *\/\n#endif\n\n#ifndef _PATH_MAILDIR\n#define _PATH_MAILDIR \"\/var\/spool\/mail\"\n#endif\n#undef None\n\n\/\/-----------------------------------------------------------------------------\nKMAcctLocal::KMAcctLocal(KMAcctMgr* aOwner, const char* aAccountName):\n KMAcctLocalInherited(aOwner, aAccountName)\n{\n mLock = procmail_lockfile;\n}\n\n\n\/\/-----------------------------------------------------------------------------\nKMAcctLocal::~KMAcctLocal()\n{\n mLocation = \"\";\n}\n\n\n\/\/-----------------------------------------------------------------------------\nconst char* KMAcctLocal::type(void) const\n{\n return \"local\";\n}\n\n\n\/\/-----------------------------------------------------------------------------\nvoid KMAcctLocal::init(void)\n{\n mLocation = getenv(\"MAIL\");\n if (mLocation.isNull()) {\n mLocation = _PATH_MAILDIR;\n mLocation += \"\/\";\n mLocation += getenv(\"USER\");\n }\n setProcmailLockFileName(\"\");\n}\n\n\n\/\/-----------------------------------------------------------------------------\nvoid KMAcctLocal::pseudoAssign(KMAccount *account)\n{\n assert(account->type() == \"local\");\n KMAcctLocal *acct = static_cast<KMAcctLocal*>(account);\n setName(acct->name());\n setLocation(acct->location());\n setCheckInterval(acct->checkInterval());\n setCheckExclude(acct->checkExclude());\n setLockType(acct->lockType());\n setProcmailLockFileName(acct->procmailLockFileName());\n setFolder(acct->folder());\n setPrecommand(acct->precommand());\n}\n\n\/\/-----------------------------------------------------------------------------\nvoid KMAcctLocal::processNewMail(bool)\n{\n QTime t;\n hasNewMail = false;\n\n if ( precommand().isEmpty() ) {\n QFileInfo fi( location() );\n if ( fi.size() == 0 ) {\n emit finishedCheck(hasNewMail);\n return;\n }\n }\n\n KMFolder mailFolder(NULL, location());\n mailFolder.setLockType( mLock );\n if ( mLock == procmail_lockfile)\n mailFolder.setProcmailLockFileName( mProcmailLockFileName );\n\n long num = 0;\n long i;\n int rc;\n KMMessage* msg;\n bool addedOk;\n\n if (!mFolder) {\n emit finishedCheck(hasNewMail);\n return;\n }\n\n KMBroadcastStatus::instance()->reset();\n KMBroadcastStatus::instance()->setStatusMsg(\n\ti18n(\"Preparing transmission from %1...\").arg(mailFolder.name()));\n\n \/\/ run the precommand\n if (!runPrecommand(precommand()))\n {\n perror(\"cannot run precommand \"+precommand());\n\temit finishedCheck(hasNewMail);\n }\n\n mailFolder.setAutoCreateIndex(FALSE);\n\n rc = mailFolder.open();\n if (rc)\n {\n QString aStr;\n aStr = i18n(\"Cannot open file:\");\n aStr += mailFolder.path()+\"\/\"+mailFolder.name();\n KMessageBox::sorry(0, aStr);\n perror(\"cannot open file \"+mailFolder.path()+\"\/\"+mailFolder.name());\n emit finishedCheck(hasNewMail);\n KMBroadcastStatus::instance()->setStatusMsg( i18n( \"Transmission completed.\" ));\n return;\n }\n\n if (mailFolder.isReadOnly()) { \/\/ mailFolder is locked\n kdDebug() << \"mailFolder could not be locked\" << endl;\n mailFolder.close();\n emit finishedCheck(hasNewMail);\n KMBroadcastStatus::instance()->setStatusMsg( i18n( \"Transmission completed.\" ));\n return;\n }\n\n mFolder->quiet(TRUE);\n mFolder->open();\n\t\t\n\n num = mailFolder.count();\n\n addedOk = true;\n t.start();\n\n KMBroadcastStatus::instance()->setStatusProgressEnable( true );\n for (i=0; i<num; i++)\n {\n\n if (!addedOk) break;\n if (KMBroadcastStatus::instance()->abortRequested()) break;\n\n KMBroadcastStatus::instance()->setStatusMsg( i18n(\"Message \") +\n\t\t\t QString(\"%1\/%2\").arg(i).arg(num) );\n KMBroadcastStatus::instance()->setStatusProgressPercent( (i*100) \/ num );\n\n msg = mailFolder.take(0);\n if (msg)\n {\n msg->setStatus(msg->headerField(\"Status\"), msg->headerField(\"X-Status\"));\n addedOk = processNewMsg(msg);\n if (addedOk)\n\thasNewMail = true;\n }\n\n if (t.elapsed() >= 200) { \/\/hardwired constant\n kapp->processEvents();\n t.start();\n }\n\n }\n KMBroadcastStatus::instance()->setStatusProgressEnable( false );\n KMBroadcastStatus::instance()->reset();\n\n if (addedOk)\n {\n rc = mailFolder.expunge();\n if (rc)\n KMessageBox::information( 0, i18n(\"Cannot remove mail from\\nmailbox `%1':\\n%2\").arg(mailFolder.location()).arg(strerror(rc)));\n KMBroadcastStatus::instance()->setStatusMsg( i18n( \"Transmission completed.\" ));\n }\n \/\/ else warning is written already\n\n mailFolder.close();\n mFolder->close();\n mFolder->quiet(FALSE);\n\n emit finishedCheck(hasNewMail);\n\n return;\n}\n\n\n\/\/-----------------------------------------------------------------------------\nvoid KMAcctLocal::readConfig(KConfig& config)\n{\n KMAcctLocalInherited::readConfig(config);\n mLocation = config.readEntry(\"Location\", mLocation);\n QString locktype = config.readEntry(\"LockType\", \"procmail_lockfile\" );\n\n if( locktype == \"procmail_lockfile\" ) {\n mLock = procmail_lockfile;\n mProcmailLockFileName = config.readEntry(\"ProcmailLockFile\",\n mLocation + \".lock\");\n } else if( locktype == \"mutt_dotlock\" )\n mLock = mutt_dotlock;\n else if( locktype == \"mutt_dotlock_privileged\" )\n mLock = mutt_dotlock_privileged;\n else if( locktype == \"none\" )\n mLock = None;\n else mLock = FCNTL;\n}\n\n\n\/\/-----------------------------------------------------------------------------\nvoid KMAcctLocal::writeConfig(KConfig& config)\n{\n KMAcctLocalInherited::writeConfig(config);\n\n config.writeEntry(\"Location\", mLocation);\n\n QString st = \"fcntl\";\n if (mLock == procmail_lockfile) st = \"procmail_lockfile\";\n else if (mLock == mutt_dotlock) st = \"mutt_dotlock\";\n else if (mLock == mutt_dotlock_privileged) st = \"mutt_dotlock_privileged\";\n else if (mLock == None) st = \"none\";\n config.writeEntry(\"LockType\", st);\n\n if (mLock == procmail_lockfile) {\n config.writeEntry(\"ProcmailLockFile\", mProcmailLockFileName);\n }\n\n}\n\n\n\/\/-----------------------------------------------------------------------------\nvoid KMAcctLocal::setLocation(const QString& aLocation)\n{\n mLocation = aLocation;\n}\n\nvoid\nKMAcctLocal::setProcmailLockFileName(QString s)\n{\n if (s && !s.isEmpty())\n mProcmailLockFileName = s;\n else\n mProcmailLockFileName = mLocation + \".lock\";\n}\n\n<|endoftext|>"} {"text":"<commit_before><commit_msg>Create 1072 - Interval 2.cpp<commit_after><|endoftext|>"} {"text":"<commit_before><commit_msg>default value for tau_beta vector now has 2 elements for consistency<commit_after><|endoftext|>"} {"text":"<commit_before>\/\/\n\/\/ Name:\t canvas.cpp\n\/\/ Purpose:\t Implements the canvas class for the wxWindows application.\n\/\/\n\/\/ Copyright (c) 2001 Virtual Terrain Project\n\/\/ Free for all uses, see license.txt for details.\n\/\/\n\n\/\/ For compilers that support precompilation, includes \"wx.h\".\n#include \"wx\/wxprec.h\"\n\n#ifndef WX_PRECOMP\n#include \"wx\/wx.h\"\n#endif\n\n#include \"vtlib\/vtlib.h\"\n#include \"vtlib\/core\/TimeEngines.h\"\n#include \"vtlib\/core\/TerrainScene.h\"\n#include \"vtdata\/vtLog.h\"\n#include \"..\/Enviro.h\"\t\t\t\/\/ for g_App, GetTerrainScene\n#include \"canvas.h\"\n#include \"frame.h\"\n#include \"app.h\"\n\nDECLARE_APP(vtApp)\n\n\/*\n * vtGLCanvas implementation\n *\/\n\tBEGIN_EVENT_TABLE(vtGLCanvas, wxGLCanvas)\nEVT_CLOSE(vtGLCanvas::OnClose)\nEVT_SIZE(vtGLCanvas::OnSize)\nEVT_PAINT(vtGLCanvas::OnPaint)\nEVT_CHAR(vtGLCanvas::OnChar)\nEVT_MOUSE_EVENTS(vtGLCanvas::OnMouseEvent)\nEVT_ERASE_BACKGROUND(vtGLCanvas::OnEraseBackground)\nEND_EVENT_TABLE()\n\nstatic vtGLCanvas *s_canvas = NULL;\n\n\nvtGLCanvas::vtGLCanvas(wxWindow *parent, wxWindowID id,\n\tconst wxPoint& pos, const wxSize& size, long style, const wxString& name, int* gl_attrib):\nwxGLCanvas(parent, id, pos, size, style, name, gl_attrib)\n{\n\tVTLOG(\"Constructing vtGLCanvas\\n\");\n\tparent->Show(TRUE);\n\tSetCurrent();\n\n\tm_StatusTimer.SetFrame((wxFrame *)parent);\n\tm_StatusTimer.Start(1000);\n\n\tm_bPainting = false;\n\tm_bRunning = true;\n\tm_bShowFrameRateChart = false;\n\n\ts_canvas = this;\n}\n\n\nvtGLCanvas::~vtGLCanvas(void)\n{\n\tVTLOG(\"Deleting Canvas\\n\");\n}\n\nvoid EnableContinuousRendering(bool bTrue)\n{\n\tVTLOG(\"EnableContinuousRendering %d\\n\", bTrue);\n\tif (!s_canvas)\n\t\treturn;\n\n\tbool bNeedRefresh = (s_canvas->m_bRunning == false && bTrue == true);\n\ts_canvas->m_bRunning = bTrue;\n\tif (bNeedRefresh)\n\t\ts_canvas->Refresh(FALSE);\n}\n\nvoid vtGLCanvas::QueueRefresh(bool eraseBackground)\n\t\/\/ A Refresh routine we can call from inside OnPaint.\n\t\/\/ (queues the events rather than dispatching them immediately).\n{\n\t\/\/ With wxGTK, you can't do a Refresh() in OnPaint because it doesn't\n\t\/\/ queue (post) a Refresh event for later. Rather it dispatches\n\t\/\/ (processes) the underlying events immediately via ProcessEvent\n\t\/\/ (read, recursive call). See the wxPostEvent docs and Refresh code\n\t\/\/ for more details.\n\tif ( eraseBackground ) \n\t{\n\t\twxEraseEvent eevent( GetId() );\n\t\teevent.SetEventObject( this );\n\t\twxPostEvent( GetEventHandler(), eevent );\n\t}\n\n\twxPaintEvent event( GetId() );\n\tevent.SetEventObject( this );\n\twxPostEvent( GetEventHandler(), event );\n}\n\nvoid StatusTimer::Notify()\n{\n\tif (!m_pFrame || !m_pFrame->GetStatusBar()) return;\n\n\tvtScene *scene = vtGetScene();\n\tif (!scene) return;\n\n\twxString str, str2;\n\n\t\/\/ get framerate\n\tfloat fps = scene->GetFrameRate();\n\n\t\/\/ only show 3 significant digits\n\tif (fps < 10)\n\t\tstr.Printf(_T(\"fps %1.2f, \"), fps);\n\telse if (fps < 80)\n\t\tstr.Printf(_T(\"fps %2.1f, \"), fps);\n\telse\n\t\tstr.Printf(_T(\"fps %3.0f, \"), fps);\n\n\t\/\/ get time of day\n\tTimeEngine *te = GetTerrainScene()->GetTimeEngine();\n\tif (te && te->GetEnabled())\n\t{\n\t\tint hr, min, sec;\n\t\tte->GetTime(hr, min, sec);\n\n\t\tstr2.Printf(_T(\"time %02d:%02d:%02d, \"), hr, min, sec);\n\t\tstr += str2;\n\t}\n\n\tvtString vs;\n\tg_App.DescribeCoordinates(vs);\n\tstr += wxString::FromAscii((const char *)vs);\n\n\t\/\/ get CLOD triangle counts, if appropriate\n\tg_App.DescribeCLOD(vs);\n\tstr += wxString::FromAscii((const char *)vs);\n\n\tstr += wxString::FromAscii((const char *)g_App.m_strMessage);\n\n\tm_pFrame->SetStatusText(str);\n}\n\n\nvoid vtGLCanvas::OnPaint( wxPaintEvent& event )\n{\n\tvtScene *pScene = vtGetScene();\n\n\tif (!pScene->HasWinInfo())\n\t{\n\t\tVTLOG(\"First OnPaint message.\\n\");\n#ifdef WIN32\n\t\tHWND handle = (HWND) GetHandle();\n\t\tpScene->SetWinInfo(handle, m_glContext);\n#else\n\t\tpScene->SetWinInfo(NULL, NULL);\n#endif\n\/\/\t\tCreateScene();\n\t}\n\n\t\/\/ place the dc inside a scope, to delete it before the end of function\n\tif (1)\n\t{\n\t\t\/\/ This is a dummy, to avoid an endless succession of paint messages.\n\t\t\/\/ OnPaint handlers must always create a wxPaintDC.\n\t\twxPaintDC dc(this);\n#ifdef __WXMSW__\n\t\tif (!GetContext()) return;\n#endif\n\n\t\tif (m_bPainting || !m_bRunning) return;\n\n#if !VTLIB_PSM\n\t\tm_bPainting = true;\n\n\t\t\/\/ Render the Scene Graph\n\t\tvtGetScene()->DoUpdate();\n\n\t\tif (m_bShowFrameRateChart)\n\t\t\tvtGetScene()->DrawFrameRateChart();\n\n\t\tSwapBuffers();\n\n#ifdef WIN32\n\t\t\/\/ Call Refresh again for continuous rendering,\n\t\tif (m_bRunning)\n\t\t\tRefresh(FALSE);\n#else\n\t\t\/\/ Queue another refresh for continuous rendering.\n\t\t\/\/ (Yield first so we don't starve out keyboard & mouse events.)\n\t\t\/\/\n\t\t\/\/ FIXME: We may want to use a frame timer instead of immediate-\n\t\t\/\/ redraw so we don't eat so much CPU on machines that can\n\t\t\/\/ easily handle the frame rate.\n\t\twxYield();\n\t\tQueueRefresh(FALSE);\n#endif\n\n\t\t\/\/ update the status bar every 1\/10 of a second\n\t\tstatic float last_stat = 0.0f;\n\t\tstatic vtString last_msg;\n\t\tfloat cur = vtGetTime();\n\t\tif (cur - last_stat > 0.1f || g_App.GetMessage() != last_msg)\n\t\t{\n\t\t\tlast_msg = g_App.GetMessage();\n\t\t\tlast_stat = cur;\n\t\t\tm_StatusTimer.Notify();\n\t\t}\n\n\t\tm_bPainting = false;\n#endif \/\/ VTLIB_PSM\n\t}\n\n\t\/\/ Must allow some idle processing to occur - or the toolbars will not\n\t\/\/ update, and the close box will not respond!\n\tbool go = true;\n\twhile (go)\n\t{\n\t\tgo = wxGetApp().ProcessIdle();\n\t}\n}\n\nvoid vtGLCanvas::OnClose(wxCloseEvent& event)\n{\n\tm_bRunning = false;\n}\n\nvoid vtGLCanvas::OnSize(wxSizeEvent& event)\n{\n \/\/ Presumably this is a wxMSWism. \n \/\/ For wxGTK & wxMotif, all canvas resize events occur before the context\n \/\/ is set. So ignore this context check and grab the window width\/height\n \/\/ when we get it so it (and derived values such as aspect ratio and\n \/\/ viewport parms) are computed correctly.\n#ifdef __WXMSW__\n\tif (!GetContext()) return;\n#endif\n\n\tSetCurrent();\n\tint width, height;\n\tGetClientSize(& width, & height);\n\n\tvtGetScene()->SetWindowSize(width, height);\n\n\twxGLCanvas::OnSize(event);\n}\n\nvoid vtGLCanvas::OnChar(wxKeyEvent& event)\n{\n\tlong key = event.KeyCode();\n\n\t\/\/ pass the char to the frame for it to do \"accelerator\" shortcuts\n\tvtFrame *frame = (vtFrame*) GetParent();\n\tframe->OnChar(event);\n\n\tint flags = 0;\n\n\tif (event.ControlDown())\n\t\tflags |= VT_CONTROL;\n\n\tif (event.ShiftDown())\n\t\tflags |= VT_SHIFT;\n\n\tif (event.AltDown())\n\t\tflags |= VT_ALT;\n\n\t\/\/ pass the char to the vtlib Scene\n\tvtGetScene()->OnKey(key, flags);\n}\n\nvoid vtGLCanvas::OnMouseEvent(wxMouseEvent& event1)\n{\n\tstatic bool bCapture = false;\n\n\t\/\/ turn WX mouse event into a VT mouse event\n\tvtMouseEvent event;\n\twxEventType ev = event1.GetEventType();\n\tif (ev == wxEVT_LEFT_DOWN) {\n\t\tevent.type = VT_DOWN;\n\t\tevent.button = VT_LEFT;\n\t} else if (ev == wxEVT_LEFT_UP) {\n\t\tevent.type = VT_UP;\n\t\tevent.button = VT_LEFT;\n\t} else if (ev == wxEVT_MIDDLE_DOWN) {\n\t\tevent.type = VT_DOWN;\n\t\tevent.button = VT_MIDDLE;\n\t} else if (ev == wxEVT_MIDDLE_UP) {\n\t\tevent.type = VT_UP;\n\t\tevent.button = VT_MIDDLE;\n\t} else if (ev == wxEVT_RIGHT_DOWN) {\n\t\tevent.type = VT_DOWN;\n\t\tevent.button = VT_RIGHT;\n\t} else if (ev == wxEVT_RIGHT_UP) {\n\t\tevent.type = VT_UP;\n\t\tevent.button = VT_RIGHT;\n\t} else if (ev == wxEVT_MOTION) {\n\t\tevent.type = VT_MOVE;\n\t\tevent.button = VT_NONE;\n\t} else {\n\t\t\/\/ ignored mouse events, such as wxEVT_LEAVE_WINDOW\n\t\treturn;\n\t}\n\n\tif (ev == wxEVT_LEFT_DOWN || ev == wxEVT_MIDDLE_DOWN || ev == wxEVT_RIGHT_DOWN)\n\t{\n\/\/\t\tVTLOG(\"DOWN: capture %d\", bCapture);\n\t\tif (!bCapture)\n\t\t{\n\t\t\tCaptureMouse();\n\t\t\tbCapture = true;\n\/\/\t\t\tVTLOG(\" -> true\");\n\t\t}\n\/\/\t\tVTLOG(\"\\n\");\n\t}\n\tif (ev == wxEVT_LEFT_UP || ev == wxEVT_MIDDLE_UP || ev == wxEVT_RIGHT_UP)\n\t{\n\/\/\t\tVTLOG(\" UP: capture %d\", bCapture);\n\t\tif (bCapture)\n\t\t{\n\t\t\tReleaseMouse();\n\t\t\tbCapture = false;\n\/\/\t\t\tVTLOG(\" -> false\");\n\t\t}\n\/\/\t\tVTLOG(\"\\n\");\n\t}\n\n\tevent.flags = 0;\n\twxCoord xpos, ypos;\n\tevent1.GetPosition(&xpos, &ypos);\n\tevent.pos.Set(xpos, ypos);\n\n\tif (event1.ControlDown())\n\t\tevent.flags |= VT_CONTROL;\n\n\tif (event1.ShiftDown())\n\t\tevent.flags |= VT_SHIFT;\n\n\tif (event1.AltDown())\n\t\tevent.flags |= VT_ALT;\n\n\t\/\/ inform Enviro app\n\tg_App.OnMouse(event);\n\n\tvtGetScene()->OnMouse(event);\n}\n\nvoid vtGLCanvas::OnEraseBackground(wxEraseEvent& event)\n{\n\t\/\/ Do nothing, to avoid flashing.\n}\n<commit_msg>allow single refreshes even when not actively running (hope this don't break much)<commit_after>\/\/\n\/\/ Name:\t canvas.cpp\n\/\/ Purpose:\t Implements the canvas class for the wxWindows application.\n\/\/\n\/\/ Copyright (c) 2001 Virtual Terrain Project\n\/\/ Free for all uses, see license.txt for details.\n\/\/\n\n\/\/ For compilers that support precompilation, includes \"wx.h\".\n#include \"wx\/wxprec.h\"\n\n#ifndef WX_PRECOMP\n#include \"wx\/wx.h\"\n#endif\n\n#include \"vtlib\/vtlib.h\"\n#include \"vtlib\/core\/TimeEngines.h\"\n#include \"vtlib\/core\/TerrainScene.h\"\n#include \"vtdata\/vtLog.h\"\n#include \"..\/Enviro.h\"\t\t\t\/\/ for g_App, GetTerrainScene\n#include \"canvas.h\"\n#include \"frame.h\"\n#include \"app.h\"\n\nDECLARE_APP(vtApp)\n\n\/*\n * vtGLCanvas implementation\n *\/\n\tBEGIN_EVENT_TABLE(vtGLCanvas, wxGLCanvas)\nEVT_CLOSE(vtGLCanvas::OnClose)\nEVT_SIZE(vtGLCanvas::OnSize)\nEVT_PAINT(vtGLCanvas::OnPaint)\nEVT_CHAR(vtGLCanvas::OnChar)\nEVT_MOUSE_EVENTS(vtGLCanvas::OnMouseEvent)\nEVT_ERASE_BACKGROUND(vtGLCanvas::OnEraseBackground)\nEND_EVENT_TABLE()\n\nstatic vtGLCanvas *s_canvas = NULL;\n\n\nvtGLCanvas::vtGLCanvas(wxWindow *parent, wxWindowID id,\n\tconst wxPoint& pos, const wxSize& size, long style, const wxString& name, int* gl_attrib):\nwxGLCanvas(parent, id, pos, size, style, name, gl_attrib)\n{\n\tVTLOG(\"Constructing vtGLCanvas\\n\");\n\tparent->Show(TRUE);\n\tSetCurrent();\n\n\tm_StatusTimer.SetFrame((wxFrame *)parent);\n\tm_StatusTimer.Start(1000);\n\n\tm_bPainting = false;\n\tm_bRunning = true;\n\tm_bShowFrameRateChart = false;\n\n\ts_canvas = this;\n}\n\n\nvtGLCanvas::~vtGLCanvas(void)\n{\n\tVTLOG(\"Deleting Canvas\\n\");\n}\n\nvoid EnableContinuousRendering(bool bTrue)\n{\n\tVTLOG(\"EnableContinuousRendering %d\\n\", bTrue);\n\tif (!s_canvas)\n\t\treturn;\n\n\tbool bNeedRefresh = (s_canvas->m_bRunning == false && bTrue == true);\n\ts_canvas->m_bRunning = bTrue;\n\tif (bNeedRefresh)\n\t\ts_canvas->Refresh(FALSE);\n}\n\nvoid vtGLCanvas::QueueRefresh(bool eraseBackground)\n\t\/\/ A Refresh routine we can call from inside OnPaint.\n\t\/\/ (queues the events rather than dispatching them immediately).\n{\n\t\/\/ With wxGTK, you can't do a Refresh() in OnPaint because it doesn't\n\t\/\/ queue (post) a Refresh event for later. Rather it dispatches\n\t\/\/ (processes) the underlying events immediately via ProcessEvent\n\t\/\/ (read, recursive call). See the wxPostEvent docs and Refresh code\n\t\/\/ for more details.\n\tif ( eraseBackground ) \n\t{\n\t\twxEraseEvent eevent( GetId() );\n\t\teevent.SetEventObject( this );\n\t\twxPostEvent( GetEventHandler(), eevent );\n\t}\n\n\twxPaintEvent event( GetId() );\n\tevent.SetEventObject( this );\n\twxPostEvent( GetEventHandler(), event );\n}\n\nvoid StatusTimer::Notify()\n{\n\tif (!m_pFrame || !m_pFrame->GetStatusBar()) return;\n\n\tvtScene *scene = vtGetScene();\n\tif (!scene) return;\n\n\twxString str, str2;\n\n\t\/\/ get framerate\n\tfloat fps = scene->GetFrameRate();\n\n\t\/\/ only show 3 significant digits\n\tif (fps < 10)\n\t\tstr.Printf(_T(\"fps %1.2f, \"), fps);\n\telse if (fps < 80)\n\t\tstr.Printf(_T(\"fps %2.1f, \"), fps);\n\telse\n\t\tstr.Printf(_T(\"fps %3.0f, \"), fps);\n\n\t\/\/ get time of day\n\tTimeEngine *te = GetTerrainScene()->GetTimeEngine();\n\tif (te && te->GetEnabled())\n\t{\n\t\tint hr, min, sec;\n\t\tte->GetTime(hr, min, sec);\n\n\t\tstr2.Printf(_T(\"time %02d:%02d:%02d, \"), hr, min, sec);\n\t\tstr += str2;\n\t}\n\n\tvtString vs;\n\tg_App.DescribeCoordinates(vs);\n\tstr += wxString::FromAscii((const char *)vs);\n\n\t\/\/ get CLOD triangle counts, if appropriate\n\tg_App.DescribeCLOD(vs);\n\tstr += wxString::FromAscii((const char *)vs);\n\n\tstr += wxString::FromAscii((const char *)g_App.m_strMessage);\n\n\tm_pFrame->SetStatusText(str);\n}\n\n\nvoid vtGLCanvas::OnPaint( wxPaintEvent& event )\n{\n\tvtScene *pScene = vtGetScene();\n\n\tif (!pScene->HasWinInfo())\n\t{\n\t\tVTLOG(\"First OnPaint message.\\n\");\n#ifdef WIN32\n\t\tHWND handle = (HWND) GetHandle();\n\t\tpScene->SetWinInfo(handle, m_glContext);\n#else\n\t\tpScene->SetWinInfo(NULL, NULL);\n#endif\n\/\/\t\tCreateScene();\n\t}\n\n\t\/\/ place the dc inside a scope, to delete it before the end of function\n\tif (1)\n\t{\n\t\t\/\/ This is a dummy, to avoid an endless succession of paint messages.\n\t\t\/\/ OnPaint handlers must always create a wxPaintDC.\n\t\twxPaintDC dc(this);\n#ifdef __WXMSW__\n\t\tif (!GetContext()) return;\n#endif\n\n\t\tif (m_bPainting) return;\n\n#if !VTLIB_PSM\n\t\tm_bPainting = true;\n\n\t\t\/\/ Render the Scene Graph\n\t\tvtGetScene()->DoUpdate();\n\n\t\tif (m_bShowFrameRateChart)\n\t\t\tvtGetScene()->DrawFrameRateChart();\n\n\t\tSwapBuffers();\n\n#ifdef WIN32\n\t\t\/\/ Call Refresh again for continuous rendering,\n\t\tif (m_bRunning)\n\t\t\tRefresh(FALSE);\n#else\n\t\t\/\/ Queue another refresh for continuous rendering.\n\t\t\/\/ (Yield first so we don't starve out keyboard & mouse events.)\n\t\t\/\/\n\t\t\/\/ FIXME: We may want to use a frame timer instead of immediate-\n\t\t\/\/ redraw so we don't eat so much CPU on machines that can\n\t\t\/\/ easily handle the frame rate.\n\t\twxYield();\n\t\tQueueRefresh(FALSE);\n#endif\n\n\t\t\/\/ update the status bar every 1\/10 of a second\n\t\tstatic float last_stat = 0.0f;\n\t\tstatic vtString last_msg;\n\t\tfloat cur = vtGetTime();\n\t\tif (cur - last_stat > 0.1f || g_App.GetMessage() != last_msg)\n\t\t{\n\t\t\tlast_msg = g_App.GetMessage();\n\t\t\tlast_stat = cur;\n\t\t\tm_StatusTimer.Notify();\n\t\t}\n\n\t\tm_bPainting = false;\n#endif \/\/ VTLIB_PSM\n\t}\n\n\t\/\/ Must allow some idle processing to occur - or the toolbars will not\n\t\/\/ update, and the close box will not respond!\n\tbool go = true;\n\twhile (go)\n\t{\n\t\tgo = wxGetApp().ProcessIdle();\n\t}\n}\n\nvoid vtGLCanvas::OnClose(wxCloseEvent& event)\n{\n\tm_bRunning = false;\n}\n\nvoid vtGLCanvas::OnSize(wxSizeEvent& event)\n{\n \/\/ Presumably this is a wxMSWism. \n \/\/ For wxGTK & wxMotif, all canvas resize events occur before the context\n \/\/ is set. So ignore this context check and grab the window width\/height\n \/\/ when we get it so it (and derived values such as aspect ratio and\n \/\/ viewport parms) are computed correctly.\n#ifdef __WXMSW__\n\tif (!GetContext()) return;\n#endif\n\n\tSetCurrent();\n\tint width, height;\n\tGetClientSize(& width, & height);\n\n\tvtGetScene()->SetWindowSize(width, height);\n\n\twxGLCanvas::OnSize(event);\n}\n\nvoid vtGLCanvas::OnChar(wxKeyEvent& event)\n{\n\tlong key = event.KeyCode();\n\n\t\/\/ pass the char to the frame for it to do \"accelerator\" shortcuts\n\tvtFrame *frame = (vtFrame*) GetParent();\n\tframe->OnChar(event);\n\n\tint flags = 0;\n\n\tif (event.ControlDown())\n\t\tflags |= VT_CONTROL;\n\n\tif (event.ShiftDown())\n\t\tflags |= VT_SHIFT;\n\n\tif (event.AltDown())\n\t\tflags |= VT_ALT;\n\n\t\/\/ pass the char to the vtlib Scene\n\tvtGetScene()->OnKey(key, flags);\n}\n\nvoid vtGLCanvas::OnMouseEvent(wxMouseEvent& event1)\n{\n\tstatic bool bCapture = false;\n\n\t\/\/ turn WX mouse event into a VT mouse event\n\tvtMouseEvent event;\n\twxEventType ev = event1.GetEventType();\n\tif (ev == wxEVT_LEFT_DOWN) {\n\t\tevent.type = VT_DOWN;\n\t\tevent.button = VT_LEFT;\n\t} else if (ev == wxEVT_LEFT_UP) {\n\t\tevent.type = VT_UP;\n\t\tevent.button = VT_LEFT;\n\t} else if (ev == wxEVT_MIDDLE_DOWN) {\n\t\tevent.type = VT_DOWN;\n\t\tevent.button = VT_MIDDLE;\n\t} else if (ev == wxEVT_MIDDLE_UP) {\n\t\tevent.type = VT_UP;\n\t\tevent.button = VT_MIDDLE;\n\t} else if (ev == wxEVT_RIGHT_DOWN) {\n\t\tevent.type = VT_DOWN;\n\t\tevent.button = VT_RIGHT;\n\t} else if (ev == wxEVT_RIGHT_UP) {\n\t\tevent.type = VT_UP;\n\t\tevent.button = VT_RIGHT;\n\t} else if (ev == wxEVT_MOTION) {\n\t\tevent.type = VT_MOVE;\n\t\tevent.button = VT_NONE;\n\t} else {\n\t\t\/\/ ignored mouse events, such as wxEVT_LEAVE_WINDOW\n\t\treturn;\n\t}\n\n\tif (ev == wxEVT_LEFT_DOWN || ev == wxEVT_MIDDLE_DOWN || ev == wxEVT_RIGHT_DOWN)\n\t{\n\/\/\t\tVTLOG(\"DOWN: capture %d\", bCapture);\n\t\tif (!bCapture)\n\t\t{\n\t\t\tCaptureMouse();\n\t\t\tbCapture = true;\n\/\/\t\t\tVTLOG(\" -> true\");\n\t\t}\n\/\/\t\tVTLOG(\"\\n\");\n\t}\n\tif (ev == wxEVT_LEFT_UP || ev == wxEVT_MIDDLE_UP || ev == wxEVT_RIGHT_UP)\n\t{\n\/\/\t\tVTLOG(\" UP: capture %d\", bCapture);\n\t\tif (bCapture)\n\t\t{\n\t\t\tReleaseMouse();\n\t\t\tbCapture = false;\n\/\/\t\t\tVTLOG(\" -> false\");\n\t\t}\n\/\/\t\tVTLOG(\"\\n\");\n\t}\n\n\tevent.flags = 0;\n\twxCoord xpos, ypos;\n\tevent1.GetPosition(&xpos, &ypos);\n\tevent.pos.Set(xpos, ypos);\n\n\tif (event1.ControlDown())\n\t\tevent.flags |= VT_CONTROL;\n\n\tif (event1.ShiftDown())\n\t\tevent.flags |= VT_SHIFT;\n\n\tif (event1.AltDown())\n\t\tevent.flags |= VT_ALT;\n\n\t\/\/ inform Enviro app\n\tg_App.OnMouse(event);\n\n\tvtGetScene()->OnMouse(event);\n}\n\nvoid vtGLCanvas::OnEraseBackground(wxEraseEvent& event)\n{\n\t\/\/ Do nothing, to avoid flashing.\n}\n<|endoftext|>"} {"text":"<commit_before>\/\/\n\/\/ Helper.cpp - various helper functions used by the classes\n\/\/\n\/\/ Copyright (c) 2001-2004 Virtual Terrain Project\n\/\/ Free for all uses, see license.txt for details.\n\/\/\n\n#include \"wx\/wxprec.h\"\n\n#ifndef WX_PRECOMP\n#include \"wx\/wx.h\"\n#endif\n\n#include \"wx\/progdlg.h\"\n#include \"Frame.h\"\n#include \"BuilderView.h\"\n#include \"Helper.h\"\n#include \"vtdata\/vtLog.h\"\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nstatic bool s_bOpen = false;\nwxProgressDialog *g_pProg = NULL;\n\nbool progress_callback(int amount)\n{\n\tbool value = false;\n\tif (g_pProg)\n\t\tvalue = (g_pProg->Update(amount) == false);\n\treturn value;\n}\n\nvoid OpenProgressDialog(const wxString &title, bool bCancellable)\n{\n\tif (s_bOpen)\n\t\treturn;\n\n\tBuilderView *pView = GetMainFrame()->GetView();\n\n\t\/\/ force the window to be wider by giving a dummy string\n\twxString message = _T(\"___________________________________\");\n\tint style = wxPD_AUTO_HIDE | wxPD_APP_MODAL;\n\tif (bCancellable)\n\t\tstyle |= wxPD_CAN_ABORT;\n\n\ts_bOpen = true;\n\tg_pProg = new wxProgressDialog(title, message, 100, pView, style);\n\tg_pProg->Show(true);\n\tg_pProg->Update(0, _T(\" \"));\n}\n\nvoid CloseProgressDialog()\n{\n\tif (g_pProg)\n\t{\n\t\tg_pProg->Destroy();\n\t\tg_pProg = NULL;\n\t\ts_bOpen = false;\n\t}\n}\n\nvoid ResumeProgressDialog()\n{\n\tif (g_pProg)\n\t\tg_pProg->Resume();\n}\n\n\/\/\n\/\/ returns true if the user pressed the \"Cancel\" button\n\/\/\nbool UpdateProgressDialog(int amount, const wxString& newmsg)\n{\n\tbool value = false;\n\tif (g_pProg)\n\t\tvalue = (g_pProg->Update(amount, newmsg) == false);\n\treturn value;\n}\n\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nvoid IncreaseRect(wxRect &rect, int adjust)\n{\n\trect.y -= adjust;\n\trect.height += (adjust<<1);\n\trect.x -= adjust;\n\trect.width += (adjust<<1);\n}\n\nvoid DrawRectangle(wxDC* pDC, const wxRect &rect)\n{\n\tint left = rect.x;\n\tint right = rect.x + rect.GetWidth();\n\tint top = rect.y;\n\tint bottom = rect.y + rect.GetHeight();\n\twxPoint p[5];\n\tp[0].x = left;\n\tp[0].y = bottom;\n\n\tp[1].x = left;\n\tp[1].y = top;\n\n\tp[2].x = right;\n\tp[2].y = top;\n\n\tp[3].x = right;\n\tp[3].y = bottom;\n\n\tp[4].x = left;\n\tp[4].y = bottom;\n\tpDC->DrawLines(5, p);\n\n\tpDC->DrawLine(left, bottom, right, top);\n\tpDC->DrawLine(left, top, right, bottom);\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nint GuessZoneFromGeo(const DPoint2 &pos)\n{\n\tint zone = (int) (((pos.x + 180.0) \/ 6.0) + 1.0);\n\tif (pos.y < 0)\n\t\tzone = -zone;\n\treturn zone;\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n\/\/\n\/\/ Display a message to the user, and also send it to the log file.\n\/\/\nvoid DisplayAndLog(const char *pFormat, ...)\n{\n\tva_list va;\n\tva_start(va, pFormat);\n\n\tchar ach[2048];\n\tvsprintf(ach, pFormat, va);\n\n\twxString2 msg = ach;\n\twxMessageBox(msg);\n\n\tstrcat(ach, \"\\n\");\n\tg_Log._Log(ach);\n}\n\n#if SUPPORT_WSTRING\n\/\/\n\/\/ Also wide-character version of the same function.\n\/\/\nvoid DisplayAndLog(const wchar_t *pFormat, ...)\n{\n\/\/#ifdef UNICODE\n\/\/\t\/\/ Try to translate the string\n\/\/\twxString2 trans = wxGetTranslation(pFormat);\n\/\/\tpFormat = trans.c_str();\n\/\/#endif\n\n\tva_list va;\n\tva_start(va, pFormat);\n\n\t\/\/ Use wide characters\n\twchar_t ach[2048];\n#ifdef _MSC_VER\n\tvswprintf(ach, pFormat, va);\n#else\n\t\/\/ apparently on non-MSVC platforms this takes 4 arguments (safer)\n\tvswprintf(ach, 2048, pFormat, va);\n#endif\n\n\twxString2 msg = ach;\n\twxMessageBox(msg);\n\n\tg_Log._Log(ach);\n\tg_Log._Log(\"\\n\");\n}\n#endif \/\/ SUPPORT_WSTRING\n\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n#if WIN32\n\n\/\/\n\/\/ Win32 allows us to do a real StrectBlt operation, although it still won't\n\/\/ do a StretchBlt with a mask.\n\/\/\nvoid wxDC2::StretchBlit(const wxBitmap &bmp,\n\t\t\t\t\t\twxCoord x, wxCoord y,\n\t\t\t\t\t\twxCoord width, wxCoord height,\n\t\t\t\t\t\twxCoord src_x, wxCoord src_y,\n\t\t\t\t\t\twxCoord src_width, wxCoord src_height)\n{\n\twxCHECK_RET( bmp.Ok(), _T(\"invalid bitmap in wxDC::DrawBitmap\") );\n\n\tHDC cdc = ((HDC)GetHDC());\n\tHDC memdc = ::CreateCompatibleDC( cdc );\n\tHBITMAP hbitmap = (HBITMAP) bmp.GetHBITMAP( );\n\n\tCOLORREF old_textground = ::GetTextColor(cdc);\n\tCOLORREF old_background = ::GetBkColor(cdc);\n\tif (m_textForegroundColour.Ok())\n\t{\n\t\t::SetTextColor(cdc, m_textForegroundColour.GetPixel() );\n\t}\n\tif (m_textBackgroundColour.Ok())\n\t{\n\t\t::SetBkColor(cdc, m_textBackgroundColour.GetPixel() );\n\t}\n\n\tHGDIOBJ hOldBitmap = ::SelectObject( memdc, hbitmap );\n\n\/\/\tint bwidth = bmp.GetWidth(), bheight = bmp.GetHeight();\n\t::StretchBlt( cdc, x, y, width, height, memdc, src_x, src_y, src_width, src_height, SRCCOPY);\n\n\t::SelectObject( memdc, hOldBitmap );\n\t::DeleteDC( memdc );\n\n\t::SetTextColor(cdc, old_textground);\n\t::SetBkColor(cdc, old_background);\n}\n\n#endif \/\/ WIN32\n\n<commit_msg>added comment<commit_after>\/\/\n\/\/ Helper.cpp - various helper functions used by the classes\n\/\/\n\/\/ Copyright (c) 2001-2004 Virtual Terrain Project\n\/\/ Free for all uses, see license.txt for details.\n\/\/\n\n#include \"wx\/wxprec.h\"\n\n#ifndef WX_PRECOMP\n#include \"wx\/wx.h\"\n#endif\n\n#include \"wx\/progdlg.h\"\n#include \"Frame.h\"\n#include \"BuilderView.h\"\n#include \"Helper.h\"\n#include \"vtdata\/vtLog.h\"\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nstatic bool s_bOpen = false;\nwxProgressDialog *g_pProg = NULL;\n\nbool progress_callback(int amount)\n{\n\tbool value = false;\n\t\/\/ Update() returns false if the Cancel button has been pushed\n\t\/\/ but this functions return _true_ if user wants to cancel\n\tif (g_pProg)\n\t\tvalue = (g_pProg->Update(amount) == false);\n\treturn value;\n}\n\nvoid OpenProgressDialog(const wxString &title, bool bCancellable)\n{\n\tif (s_bOpen)\n\t\treturn;\n\n\tBuilderView *pView = GetMainFrame()->GetView();\n\n\t\/\/ force the window to be wider by giving a dummy string\n\twxString message = _T(\"___________________________________\");\n\tint style = wxPD_AUTO_HIDE | wxPD_APP_MODAL;\n\tif (bCancellable)\n\t\tstyle |= wxPD_CAN_ABORT;\n\n\ts_bOpen = true;\n\tg_pProg = new wxProgressDialog(title, message, 100, pView, style);\n\tg_pProg->Show(true);\n\tg_pProg->Update(0, _T(\" \"));\n}\n\nvoid CloseProgressDialog()\n{\n\tif (g_pProg)\n\t{\n\t\tg_pProg->Destroy();\n\t\tg_pProg = NULL;\n\t\ts_bOpen = false;\n\t}\n}\n\nvoid ResumeProgressDialog()\n{\n\tif (g_pProg)\n\t\tg_pProg->Resume();\n}\n\n\/\/\n\/\/ returns true if the user pressed the \"Cancel\" button\n\/\/\nbool UpdateProgressDialog(int amount, const wxString& newmsg)\n{\n\tbool value = false;\n\tif (g_pProg)\n\t\tvalue = (g_pProg->Update(amount, newmsg) == false);\n\treturn value;\n}\n\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nvoid IncreaseRect(wxRect &rect, int adjust)\n{\n\trect.y -= adjust;\n\trect.height += (adjust<<1);\n\trect.x -= adjust;\n\trect.width += (adjust<<1);\n}\n\nvoid DrawRectangle(wxDC* pDC, const wxRect &rect)\n{\n\tint left = rect.x;\n\tint right = rect.x + rect.GetWidth();\n\tint top = rect.y;\n\tint bottom = rect.y + rect.GetHeight();\n\twxPoint p[5];\n\tp[0].x = left;\n\tp[0].y = bottom;\n\n\tp[1].x = left;\n\tp[1].y = top;\n\n\tp[2].x = right;\n\tp[2].y = top;\n\n\tp[3].x = right;\n\tp[3].y = bottom;\n\n\tp[4].x = left;\n\tp[4].y = bottom;\n\tpDC->DrawLines(5, p);\n\n\tpDC->DrawLine(left, bottom, right, top);\n\tpDC->DrawLine(left, top, right, bottom);\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nint GuessZoneFromGeo(const DPoint2 &pos)\n{\n\tint zone = (int) (((pos.x + 180.0) \/ 6.0) + 1.0);\n\tif (pos.y < 0)\n\t\tzone = -zone;\n\treturn zone;\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n\/\/\n\/\/ Display a message to the user, and also send it to the log file.\n\/\/\nvoid DisplayAndLog(const char *pFormat, ...)\n{\n\tva_list va;\n\tva_start(va, pFormat);\n\n\tchar ach[2048];\n\tvsprintf(ach, pFormat, va);\n\n\twxString2 msg = ach;\n\twxMessageBox(msg);\n\n\tstrcat(ach, \"\\n\");\n\tg_Log._Log(ach);\n}\n\n#if SUPPORT_WSTRING\n\/\/\n\/\/ Also wide-character version of the same function.\n\/\/\nvoid DisplayAndLog(const wchar_t *pFormat, ...)\n{\n\/\/#ifdef UNICODE\n\/\/\t\/\/ Try to translate the string\n\/\/\twxString2 trans = wxGetTranslation(pFormat);\n\/\/\tpFormat = trans.c_str();\n\/\/#endif\n\n\tva_list va;\n\tva_start(va, pFormat);\n\n\t\/\/ Use wide characters\n\twchar_t ach[2048];\n#ifdef _MSC_VER\n\tvswprintf(ach, pFormat, va);\n#else\n\t\/\/ apparently on non-MSVC platforms this takes 4 arguments (safer)\n\tvswprintf(ach, 2048, pFormat, va);\n#endif\n\n\twxString2 msg = ach;\n\twxMessageBox(msg);\n\n\tg_Log._Log(ach);\n\tg_Log._Log(\"\\n\");\n}\n#endif \/\/ SUPPORT_WSTRING\n\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n#if WIN32\n\n\/\/\n\/\/ Win32 allows us to do a real StrectBlt operation, although it still won't\n\/\/ do a StretchBlt with a mask.\n\/\/\nvoid wxDC2::StretchBlit(const wxBitmap &bmp,\n\t\t\t\t\t\twxCoord x, wxCoord y,\n\t\t\t\t\t\twxCoord width, wxCoord height,\n\t\t\t\t\t\twxCoord src_x, wxCoord src_y,\n\t\t\t\t\t\twxCoord src_width, wxCoord src_height)\n{\n\twxCHECK_RET( bmp.Ok(), _T(\"invalid bitmap in wxDC::DrawBitmap\") );\n\n\tHDC cdc = ((HDC)GetHDC());\n\tHDC memdc = ::CreateCompatibleDC( cdc );\n\tHBITMAP hbitmap = (HBITMAP) bmp.GetHBITMAP( );\n\n\tCOLORREF old_textground = ::GetTextColor(cdc);\n\tCOLORREF old_background = ::GetBkColor(cdc);\n\tif (m_textForegroundColour.Ok())\n\t{\n\t\t::SetTextColor(cdc, m_textForegroundColour.GetPixel() );\n\t}\n\tif (m_textBackgroundColour.Ok())\n\t{\n\t\t::SetBkColor(cdc, m_textBackgroundColour.GetPixel() );\n\t}\n\n\tHGDIOBJ hOldBitmap = ::SelectObject( memdc, hbitmap );\n\n\/\/\tint bwidth = bmp.GetWidth(), bheight = bmp.GetHeight();\n\t::StretchBlt( cdc, x, y, width, height, memdc, src_x, src_y, src_width, src_height, SRCCOPY);\n\n\t::SelectObject( memdc, hOldBitmap );\n\t::DeleteDC( memdc );\n\n\t::SetTextColor(cdc, old_textground);\n\t::SetBkColor(cdc, old_background);\n}\n\n#endif \/\/ WIN32\n\n<|endoftext|>"} {"text":"<commit_before>\/\/\n\/\/ VegDlg.h\n\/\/\n\/\/ Copyright (c) 2001 Virtual Terrain Project\n\/\/ Free for all uses, see license.txt for details.\n\/\/\n\n#include <wx\/wxprec.h>\n\n#ifndef WX_PRECOMP\n#include \"wx\/wx.h\"\n#endif\n\n#include \"VegDlg.h\"\n#include \"Frame.h\"\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nBEGIN_EVENT_TABLE(PlantListCtrl, wxListCtrl)\n\tEVT_LIST_ITEM_SELECTED(WID_PSTABLE,\tPlantListCtrl::OnSelect)\nEND_EVENT_TABLE()\n\n\nvoid PlantListCtrl::OnSelect(wxListEvent &event)\n{\n\t\/\/ Get index of that item\n\tint idx = event.GetIndex();\n\n\t\/\/ Clear all item data from the Appearance table on right.\n\twxListCtrl *apps = GetMainFrame()->m_PlantListDlg->m_PATable;\n\tapps->DeleteAllItems();\n\n\t\/\/ Get species that was selected from left table.\n\tvtPlantSpecies* ps = GetMainFrame()->GetPlantList()->GetSpecies(idx);\n\n\t\/\/ Display appearance in right table of selected species from left table.\n\tfor (int j = 0; j < ps->NumAppearances(); j++)\n\t{\n\t\tvtPlantAppearance* app = ps->GetAppearance(j);\n\t\twxString str1;\n\t\tlong item1;\n\t\tstr1.Printf(\"%d\", app->m_eType == AT_BILLBOARD);\n\t\titem1 = apps->InsertItem(j, str1, 0);\n\t\tstr1 = app->m_filename;\n\t\titem1 = apps->SetItem(j, 1, str1);\n\t\tstr1.Printf(\"%4.2f\", app->m_width);\n\t\titem1 = apps->SetItem(j, 2, str1);\n\t\tstr1.Printf(\"%4.2f\", app->m_height);\n\t\titem1 = apps->SetItem(j, 3, str1);\n\t\tstr1.Printf(\"%4.2f\", app->m_shadow_radius);\n\t\titem1 = apps->SetItem(j, 4, str1);\n\t\tstr1.Printf(\"%4.2f\", app->m_shadow_darkness);\n\t\titem1 = apps->SetItem(j, 5, str1);\n\t}\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nvoid PlantListDlg::OnInitDialog(wxInitDialogEvent& event)\n{\n\t\/\/ Setup Splitter Window.\n\tm_PSplitter = new wxSplitterWindow(this, WID_PSPLITTER, wxPoint(0,0), wxSize(950,400),\n\t\twxSP_FULLSASH | wxSP_NOBORDER, \"Plant List Dialog Splitter\");\n\t\n\tint z = 0;\n\n\t\/\/ Setup left side with common name and max height per species.\n\tm_PSTable = new PlantListCtrl(m_PSplitter, WID_PSTABLE, wxPoint(0, 0), wxSize(400, 400),\n\t\twxLC_REPORT | wxLC_ALIGN_TOP);\n\tm_PSTable->ClearAll();\n\tm_PSTable->SetSingleStyle(wxLC_REPORT);\n\tm_PSTable->InsertColumn(0, \"SID\");\n\tm_PSTable->SetColumnWidth(0, 30);\n\tm_PSTable->InsertColumn(1, \"Common Name\");\n\tm_PSTable->SetColumnWidth(1, 110);\n\tm_PSTable->InsertColumn(2, \"Scientific Name\");\n\tm_PSTable->SetColumnWidth(2, 150);\n\tm_PSTable->InsertColumn(3, \"Max Height\");\n\tm_PSTable->SetColumnWidth(3, 80);\n\n\t\/\/ Setup right side with each plant appearance's attributes.\n\tm_PATable = new wxListCtrl(m_PSplitter, WID_PATABLE, wxPoint(0, 0), wxSize(550, 400),\n\t\twxLC_REPORT | wxLC_ALIGN_TOP);\n\tm_PATable->ClearAll();\n\tm_PATable->SetSingleStyle(wxLC_REPORT);\n\tm_PATable->InsertColumn(0, \"Billboard\");\n\tm_PATable->SetColumnWidth(0, 60);\n\tm_PATable->InsertColumn(1, \"FileName\");\n\tm_PATable->SetColumnWidth(1, 150);\n\tm_PATable->InsertColumn(2, \"Width\");\n\tm_PATable->SetColumnWidth(2, 60);\n\tm_PATable->InsertColumn(3, \"Height\");\n\tm_PATable->SetColumnWidth(3, 60);\n\tm_PATable->InsertColumn(4, \"Shadow Radius\");\n\tm_PATable->SetColumnWidth(4, 100);\n\tm_PATable->InsertColumn(5, \"Shadow Darkness\");\n\tm_PATable->SetColumnWidth(5, 100);\n\n\t\/\/ Initialize the splitter window.\n\tm_PATable->Show(FALSE);\n\tm_PSplitter->Initialize(m_PSTable);\n\n\tvtPlantList* pl = GetMainFrame()->GetPlantList();\n\n\t\/\/ Read data imported from plantlist file and display in tables.\n\tfor (int i = 0; i < pl->NumSpecies(); i++)\n\t{\n\t\t\/\/ Display species and max height in left table.\n\t\twxString str;\n\t\tlong item;\n\t\tvtPlantSpecies *spe = pl->GetSpecies(i);\n\n\t\tstr.Printf(\"%d\", spe->GetSpecieID() );\n item = m_PSTable->InsertItem(i, str, 0);\n\t\tstr.Printf(\"%s\", spe->GetCommonName() );\n item = m_PSTable->SetItem(i, 1, str);\n\t\tstr.Printf(\"%s\", spe->GetSciName() );\n item = m_PSTable->SetItem(i, 2, str);\n\t\tstr.Printf(\"%4.2f m\", spe->GetMaxHeight() );\n item = m_PSTable->SetItem(i, 3, str);\n\t\t\n\t\t\/\/ Display plant appearances per species in right table.\n\t\tfor (int j = 0; j < pl->GetSpecies(i)->NumAppearances(); j++)\n\t\t{\n\t\t\tvtPlantAppearance* app = spe->GetAppearance(j);\n\t\t\twxString str1;\n\t\t\tlong item1;\n\n\t\t\tstr1.Printf(\"%d\", app->m_eType == AT_BILLBOARD);\n\t\t\titem1 = m_PATable->InsertItem(j, str1, 0);\n\t\t\tstr1 = app->m_filename;\n\t\t\titem1 = m_PATable->SetItem(j, 1, str1);\n\t\t\tstr1.Printf(\"%4.2f\", app->m_width);\n\t\t\titem1 = m_PATable->SetItem(j, 2, str1);\n\t\t\tstr1.Printf(\"%4.2f\", app->m_height);\n\t\t\titem1 = m_PATable->SetItem(j, 3, str1);\n\t\t\tstr1.Printf(\"%4.2f\", app->m_shadow_radius);\n\t\t\titem1 = m_PATable->SetItem(j, 4, str1);\n\t\t\tstr1.Printf(\"%4.2f\", app->m_shadow_darkness);\n\t\t\titem1 = m_PATable->SetItem(j, 5, str1);\n\t\t}\n\t}\n\t\/\/ Show all windows.\n\tm_PSTable->Show(TRUE);\n\tm_PATable->Show(TRUE);\n\tm_PSplitter->SplitVertically(m_PSTable, m_PATable, 400);\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nvoid BioRegionDlg::OnInitDialog(wxInitDialogEvent& event)\n{\n\t\/\/ Create tree control window as child of dialog.\n\tint width, height;\n\tGetClientSize(&width, &height);\n\tm_BTree = new wxTreeCtrl(this, WID_BIOREGIONTREE, wxPoint(10, 10), \n\t\twxSize(width - 20, height - 20), wxTR_EDIT_LABELS | wxTR_MULTIPLE);\n\n\t\/\/ Create root of tree.\n\twxTreeItemId rootId;\n\trootId = m_BTree->AddRoot(\"BioRegions\");\n\tm_BTree->SetItemBold(rootId);\n\n\tvtBioRegion *br = GetMainFrame()->GetBioRegion();\n\n\t\/\/ Read data imported from bioregion file and display on tree.\n\tint numregions = br->m_Types.GetSize();\n\tfor (int i = 0; i < numregions; i++)\n\t{\n\t\t\/\/ Display biotype as level 1 of tree.\n\t\twxTreeItemId region;\n\t\twxString bt;\n\t\tbt.Printf(\"Type %d\", i+1);\n\t\tregion = m_BTree->AppendItem(rootId, bt);\n\n\t\tint numspecies = br->m_Types[i]->m_Densities.GetSize();\n\t\tfor (int j = 0; j < numspecies; j++)\n\t\t{\n\t\t\t\/\/ Display all species and it's density under each biotype as level 2 of tree.\n\t\t\twxString s;\n\t\t\ts.Printf(\"%s (%1.4f \/m^2)\",\n\t\t\t\t(const char *) br->m_Types[i]->m_Densities[j]->m_common_name,\n\t\t\t\tbr->m_Types[i]->m_Densities[j]->m_plant_per_m2);\n\n\t\t\twxTreeItemId specie = m_BTree->AppendItem(region, s);\n\t\t\tm_BTree->Expand(specie);\n\t\t}\n\n\t\tm_BTree->Expand(region);\n\t}\n\n\tm_BTree->Expand(rootId);\n\tShow(TRUE);\n}\n<commit_msg>fixed displayed biotype numbers to match internal value<commit_after>\/\/\n\/\/ VegDlg.h\n\/\/\n\/\/ Copyright (c) 2001 Virtual Terrain Project\n\/\/ Free for all uses, see license.txt for details.\n\/\/\n\n#include <wx\/wxprec.h>\n\n#ifndef WX_PRECOMP\n#include \"wx\/wx.h\"\n#endif\n\n#include \"VegDlg.h\"\n#include \"Frame.h\"\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nBEGIN_EVENT_TABLE(PlantListCtrl, wxListCtrl)\n\tEVT_LIST_ITEM_SELECTED(WID_PSTABLE,\tPlantListCtrl::OnSelect)\nEND_EVENT_TABLE()\n\n\nvoid PlantListCtrl::OnSelect(wxListEvent &event)\n{\n\t\/\/ Get index of that item\n\tint idx = event.GetIndex();\n\n\t\/\/ Clear all item data from the Appearance table on right.\n\twxListCtrl *apps = GetMainFrame()->m_PlantListDlg->m_PATable;\n\tapps->DeleteAllItems();\n\n\t\/\/ Get species that was selected from left table.\n\tvtPlantSpecies* ps = GetMainFrame()->GetPlantList()->GetSpecies(idx);\n\n\t\/\/ Display appearance in right table of selected species from left table.\n\tfor (int j = 0; j < ps->NumAppearances(); j++)\n\t{\n\t\tvtPlantAppearance* app = ps->GetAppearance(j);\n\t\twxString str1;\n\t\tlong item1;\n\t\tstr1.Printf(\"%d\", app->m_eType == AT_BILLBOARD);\n\t\titem1 = apps->InsertItem(j, str1, 0);\n\t\tstr1 = app->m_filename;\n\t\titem1 = apps->SetItem(j, 1, str1);\n\t\tstr1.Printf(\"%4.2f\", app->m_width);\n\t\titem1 = apps->SetItem(j, 2, str1);\n\t\tstr1.Printf(\"%4.2f\", app->m_height);\n\t\titem1 = apps->SetItem(j, 3, str1);\n\t\tstr1.Printf(\"%4.2f\", app->m_shadow_radius);\n\t\titem1 = apps->SetItem(j, 4, str1);\n\t\tstr1.Printf(\"%4.2f\", app->m_shadow_darkness);\n\t\titem1 = apps->SetItem(j, 5, str1);\n\t}\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nvoid PlantListDlg::OnInitDialog(wxInitDialogEvent& event)\n{\n\t\/\/ Setup Splitter Window.\n\tm_PSplitter = new wxSplitterWindow(this, WID_PSPLITTER, wxPoint(0,0), wxSize(950,400),\n\t\twxSP_FULLSASH | wxSP_NOBORDER, \"Plant List Dialog Splitter\");\n\t\n\tint z = 0;\n\n\t\/\/ Setup left side with common name and max height per species.\n\tm_PSTable = new PlantListCtrl(m_PSplitter, WID_PSTABLE, wxPoint(0, 0), wxSize(400, 400),\n\t\twxLC_REPORT | wxLC_ALIGN_TOP);\n\tm_PSTable->ClearAll();\n\tm_PSTable->SetSingleStyle(wxLC_REPORT);\n\tm_PSTable->InsertColumn(0, \"SID\");\n\tm_PSTable->SetColumnWidth(0, 30);\n\tm_PSTable->InsertColumn(1, \"Common Name\");\n\tm_PSTable->SetColumnWidth(1, 110);\n\tm_PSTable->InsertColumn(2, \"Scientific Name\");\n\tm_PSTable->SetColumnWidth(2, 150);\n\tm_PSTable->InsertColumn(3, \"Max Height\");\n\tm_PSTable->SetColumnWidth(3, 80);\n\n\t\/\/ Setup right side with each plant appearance's attributes.\n\tm_PATable = new wxListCtrl(m_PSplitter, WID_PATABLE, wxPoint(0, 0), wxSize(550, 400),\n\t\twxLC_REPORT | wxLC_ALIGN_TOP);\n\tm_PATable->ClearAll();\n\tm_PATable->SetSingleStyle(wxLC_REPORT);\n\tm_PATable->InsertColumn(0, \"Billboard\");\n\tm_PATable->SetColumnWidth(0, 60);\n\tm_PATable->InsertColumn(1, \"FileName\");\n\tm_PATable->SetColumnWidth(1, 150);\n\tm_PATable->InsertColumn(2, \"Width\");\n\tm_PATable->SetColumnWidth(2, 60);\n\tm_PATable->InsertColumn(3, \"Height\");\n\tm_PATable->SetColumnWidth(3, 60);\n\tm_PATable->InsertColumn(4, \"Shadow Radius\");\n\tm_PATable->SetColumnWidth(4, 100);\n\tm_PATable->InsertColumn(5, \"Shadow Darkness\");\n\tm_PATable->SetColumnWidth(5, 100);\n\n\t\/\/ Initialize the splitter window.\n\tm_PATable->Show(FALSE);\n\tm_PSplitter->Initialize(m_PSTable);\n\n\tvtPlantList* pl = GetMainFrame()->GetPlantList();\n\n\t\/\/ Read data imported from plantlist file and display in tables.\n\tfor (int i = 0; i < pl->NumSpecies(); i++)\n\t{\n\t\t\/\/ Display species and max height in left table.\n\t\twxString str;\n\t\tlong item;\n\t\tvtPlantSpecies *spe = pl->GetSpecies(i);\n\n\t\tstr.Printf(\"%d\", spe->GetSpecieID() );\n item = m_PSTable->InsertItem(i, str, 0);\n\t\tstr.Printf(\"%s\", spe->GetCommonName() );\n item = m_PSTable->SetItem(i, 1, str);\n\t\tstr.Printf(\"%s\", spe->GetSciName() );\n item = m_PSTable->SetItem(i, 2, str);\n\t\tstr.Printf(\"%4.2f m\", spe->GetMaxHeight() );\n item = m_PSTable->SetItem(i, 3, str);\n\t\t\n\t\t\/\/ Display plant appearances per species in right table.\n\t\tfor (int j = 0; j < pl->GetSpecies(i)->NumAppearances(); j++)\n\t\t{\n\t\t\tvtPlantAppearance* app = spe->GetAppearance(j);\n\t\t\twxString str1;\n\t\t\tlong item1;\n\n\t\t\tstr1.Printf(\"%d\", app->m_eType == AT_BILLBOARD);\n\t\t\titem1 = m_PATable->InsertItem(j, str1, 0);\n\t\t\tstr1 = app->m_filename;\n\t\t\titem1 = m_PATable->SetItem(j, 1, str1);\n\t\t\tstr1.Printf(\"%4.2f\", app->m_width);\n\t\t\titem1 = m_PATable->SetItem(j, 2, str1);\n\t\t\tstr1.Printf(\"%4.2f\", app->m_height);\n\t\t\titem1 = m_PATable->SetItem(j, 3, str1);\n\t\t\tstr1.Printf(\"%4.2f\", app->m_shadow_radius);\n\t\t\titem1 = m_PATable->SetItem(j, 4, str1);\n\t\t\tstr1.Printf(\"%4.2f\", app->m_shadow_darkness);\n\t\t\titem1 = m_PATable->SetItem(j, 5, str1);\n\t\t}\n\t}\n\t\/\/ Show all windows.\n\tm_PSTable->Show(TRUE);\n\tm_PATable->Show(TRUE);\n\tm_PSplitter->SplitVertically(m_PSTable, m_PATable, 400);\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nvoid BioRegionDlg::OnInitDialog(wxInitDialogEvent& event)\n{\n\t\/\/ Create tree control window as child of dialog.\n\tint width, height;\n\tGetClientSize(&width, &height);\n\tm_BTree = new wxTreeCtrl(this, WID_BIOREGIONTREE, wxPoint(10, 10), \n\t\twxSize(width - 20, height - 20), wxTR_EDIT_LABELS | wxTR_MULTIPLE);\n\n\t\/\/ Create root of tree.\n\twxTreeItemId rootId;\n\trootId = m_BTree->AddRoot(\"BioRegions\");\n\tm_BTree->SetItemBold(rootId);\n\n\tvtBioRegion *br = GetMainFrame()->GetBioRegion();\n\n\t\/\/ Read data imported from bioregion file and display on tree.\n\tint numregions = br->m_Types.GetSize();\n\tfor (int i = 0; i < numregions; i++)\n\t{\n\t\t\/\/ Display biotype as level 1 of tree.\n\t\twxTreeItemId region;\n\t\twxString bt;\n\t\tbt.Printf(\"Type %d\", i);\n\t\tregion = m_BTree->AppendItem(rootId, bt);\n\n\t\tint numspecies = br->m_Types[i]->m_Densities.GetSize();\n\t\tfor (int j = 0; j < numspecies; j++)\n\t\t{\n\t\t\t\/\/ Display all species and it's density under each biotype as level 2 of tree.\n\t\t\twxString s;\n\t\t\ts.Printf(\"%s (%1.4f \/m^2)\",\n\t\t\t\t(const char *) br->m_Types[i]->m_Densities[j]->m_common_name,\n\t\t\t\tbr->m_Types[i]->m_Densities[j]->m_plant_per_m2);\n\n\t\t\twxTreeItemId specie = m_BTree->AppendItem(region, s);\n\t\t\tm_BTree->Expand(specie);\n\t\t}\n\n\t\tm_BTree->Expand(region);\n\t}\n\n\tm_BTree->Expand(rootId);\n\tShow(TRUE);\n}\n<|endoftext|>"} {"text":"<commit_before><commit_msg>avoid possible problems with zero values in tone mapping algorithms (http:\/\/code.opencv.org\/issues\/4020)<commit_after><|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\/\/ PCL\n#include <boost\/thread\/thread.hpp>\n#include <Eigen\/Geometry>\n#include <pcl\/common\/common.h>\n#include <pcl\/io\/pcd_io.h>\n#include <pcl\/io\/openni_grabber.h>\n#include <cfloat>\n#include <pcl\/visualization\/point_cloud_handlers.h>\n#include <pcl\/visualization\/pcl_visualizer.h>\n#include <pcl\/visualization\/histogram_visualizer.h>\n#include <pcl\/console\/print.h>\n#include <pcl\/console\/parse.h>\n#include <pcl\/console\/time.h>\n\nusing pcl::console::print_color;\nusing pcl::console::print_error;\nusing pcl::console::print_error;\nusing pcl::console::print_warn;\nusing pcl::console::print_info;\nusing pcl::console::print_debug;\nusing pcl::console::print_value;\nusing pcl::console::print_highlight;\nusing pcl::console::TT_BRIGHT;\nusing pcl::console::TT_RED;\nusing pcl::console::TT_GREEN;\nusing pcl::console::TT_BLUE;\n\ntypedef pcl::visualization::PointCloudColorHandler<pcl::PointCloud<pcl::PointXYZ> > ColorHandler;\ntypedef ColorHandler::Ptr ColorHandlerPtr;\ntypedef ColorHandler::ConstPtr ColorHandlerConstPtr;\n\ntypedef pcl::visualization::PointCloudGeometryHandler<pcl::PointCloud<pcl::PointXYZ> > GeometryHandler;\ntypedef GeometryHandler::Ptr GeometryHandlerPtr;\ntypedef GeometryHandler::ConstPtr GeometryHandlerConstPtr;\nboost::mutex mutex_;\npcl::PointCloud<pcl::PointXYZ>::ConstPtr g_cloud;\nbool new_cloud = false;\n\n#define NORMALS_SCALE 0.01\n#define PC_SCALE 0.001\n\nvoid\nprintHelp (int argc, 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 (\" -dev device_id = device to be used\\n\");\n print_info (\" maybe \\\"#n\\\", with n being the number of the device in device list.\\n\");\n print_info (\" maybe \\\"bus@addr\\\", with bus and addr being the usb bus and address where device is connected.\\n\");\n print_info (\" maybe \\\"serial\\\", with serial being the serial number of the device.\\n\");\n print_info (\" -bc r,g,b = background color\\n\");\n print_info (\" -fc r,g,b = foreground color\\n\");\n print_info (\" -ps X = point size (\");\n print_value (\"1..64\");\n print_info (\") \\n\");\n print_info (\" -opaque X = rendered point cloud opacity (\");\n print_value (\"0..1\");\n print_info (\")\\n\");\n\n print_info (\" -ax \");\n print_value (\"n\");\n print_info (\" = enable on-screen display of \");\n print_color (stdout, TT_BRIGHT, TT_RED, \"X\");\n print_color (stdout, TT_BRIGHT, TT_GREEN, \"Y\");\n print_color (stdout, TT_BRIGHT, TT_BLUE, \"Z\");\n print_info (\" axes and scale them to \");\n print_value (\"n\\n\");\n print_info (\" -ax_pos X,Y,Z = if axes are enabled, set their X,Y,Z position in space (default \");\n print_value (\"0,0,0\");\n print_info (\")\\n\");\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 print_info (\"\\n\");\n print_info (\" -multiview 0\/1 = enable\/disable auto-multi viewport rendering (default \");\n print_value (\"disabled\");\n print_info (\")\\n\");\n print_info (\"\\n\");\n\n print_info (\"\\n\");\n print_info (\" -normals 0\/X = disable\/enable the display of every Xth point's surface normal as lines (default \");\n print_value (\"disabled\");\n print_info (\")\\n\");\n print_info (\" -normals_scale X = resize the normal unit vector size to X (default \");\n print_value (\"0.02\");\n print_info (\")\\n\");\n print_info (\"\\n\");\n print_info (\" -pc 0\/X = disable\/enable the display of every Xth point's principal curvatures as lines (default \");\n print_value (\"disabled\");\n print_info (\")\\n\");\n print_info (\" -pc_scale X = resize the principal curvatures vectors size to X (default \");\n print_value (\"0.02\");\n print_info (\")\\n\");\n print_info (\"\\n\");\n\n print_info (\"\\n(Note: for multiple .pcd files, provide multiple -{fc,ps,opaque} parameters; they will be automatically assigned to the right file)\\n\");\n}\n\n\/\/ Create the PCLVisualizer object\nboost::shared_ptr<pcl::visualization::PCLVisualizer> p;\nColorHandlerPtr color_handler;\nGeometryHandlerPtr geometry_handler;\nstd::vector<double> fcolor_r, fcolor_b, fcolor_g;\nbool fcolorparam = false;\n\nstruct EventHelper\n{\n void cloud_cb (const pcl::PointCloud<pcl::PointXYZ>::ConstPtr & cloud)\n {\n if (mutex_.try_lock ())\n {\n g_cloud = cloud;\n new_cloud = true;\n mutex_.unlock ();\n }\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 p.reset (new pcl::visualization::PCLVisualizer (argc, argv, \"PCD viewer\"));\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 p->setBackgroundColor (bcolor[0], bcolor[1], bcolor[2]);\n\n\n\n \/\/boost::signals2::connection c = interface->registerCallback (boost::bind (&bla::blatestpointcloudrgb, *this, _1));\n \/\/boost::function<void (boost::shared_ptr<pcl::PointCloud<pcl::PointXYZRGB> >)> f = boost::bind (&bla::blatestpointcloudrgb, this, _1);\n \/\/boost::signals2::connection c =\n \/\/ interface->registerCallback <void(boost::shared_ptr<pcl::PointCloud<pcl::PointXYZRGB> >)> (boost::bind (&bla::blatestpointcloudrgb, *this, _1).);\n\n \/\/ Read axes settings\n double axes = 0.0;\n pcl::console::parse_argument (argc, argv, \"-ax\", axes);\n if (axes != 0.0 && p)\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 p->addCoordinateSystem (axes, ax_x, ax_y, ax_z);\n }\n\n\n std::string device_id = \"\";\n pcl::console::parse_argument (argc, argv, \"-dev\", device_id);\n\n pcl::Grabber* interface = new pcl::OpenNIGrabber (device_id);\n\n EventHelper h;\n boost::function<void(const pcl::PointCloud<pcl::PointXYZ>::ConstPtr&) > f = boost::bind (&EventHelper::cloud_cb, &h, _1);\n boost::signals2::connection c1 = interface->registerCallback (f);\n\n interface->start ();\n while (!p->wasStopped ())\n {\n p->spinOnce ();\n if (new_cloud && mutex_.try_lock ())\n {\n new_cloud = false;\n if (g_cloud)\n {\n p->removePointCloud (\"OpenNICloud\");\n p->addPointCloud (g_cloud, \"OpenNICloud\");\n }\n mutex_.unlock ();\n }\n else\n boost::this_thread::sleep (boost::posix_time::microseconds (1000));\n }\n\n interface->stop ();\n}\n\/* ]--- *\/\n<commit_msg>updated openni_viewer that uses @updatePointCloud@ instead of @removePointCloud@\/@addPointCloud@<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\/\/ PCL\n#include <boost\/thread\/thread.hpp>\n#include <Eigen\/Geometry>\n#include <pcl\/common\/common.h>\n#define MEASURE_FUNCTION_TIME\n#include <pcl\/common\/time.h> \/\/fps calculations\n#include <pcl\/io\/pcd_io.h>\n#include <pcl\/io\/openni_grabber.h>\n#include <cfloat>\n#include <pcl\/visualization\/point_cloud_handlers.h>\n#include <pcl\/visualization\/pcl_visualizer.h>\n#include <pcl\/visualization\/histogram_visualizer.h>\n#include <pcl\/console\/print.h>\n#include <pcl\/console\/parse.h>\n#include <pcl\/console\/time.h>\n\n#define SHOW_FPS 1\n#if SHOW_FPS\n#define FPS_CALC(_WHAT_) \\\ndo \\\n{ \\\n static unsigned count = 0;\\\n static double last = pcl::getTime ();\\\n if (++count == 100) \\\n { \\\n double now = pcl::getTime (); \\\n std::cout << \"Average framerate(\"<< _WHAT_ << \"): \" << double(count)\/double(now - last) << \" Hz\" << std::endl; \\\n count = 0; \\\n last = now; \\\n } \\\n}while(false)\n#else\n#define FPS_CALC(_WHAT_) \\\ndo \\\n{ \\\n}while(false)\n#endif\n\nusing pcl::console::print_color;\nusing pcl::console::print_error;\nusing pcl::console::print_error;\nusing pcl::console::print_warn;\nusing pcl::console::print_info;\nusing pcl::console::print_debug;\nusing pcl::console::print_value;\nusing pcl::console::print_highlight;\nusing pcl::console::TT_BRIGHT;\nusing pcl::console::TT_RED;\nusing pcl::console::TT_GREEN;\nusing pcl::console::TT_BLUE;\n\nboost::mutex mutex_;\npcl::PointCloud<pcl::PointXYZ>::ConstPtr g_cloud;\nbool new_cloud = false;\n\nvoid\nprintHelp (int argc, 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 (\" -dev device_id = device to be used\\n\");\n print_info (\" maybe \\\"#n\\\", with n being the number of the device in device list.\\n\");\n print_info (\" maybe \\\"bus@addr\\\", with bus and addr being the usb bus and address where device is connected.\\n\");\n print_info (\" maybe \\\"serial\\\", with serial being the serial number of the device.\\n\");\n print_info (\"\\n\");\n}\n\n\/\/ Create the PCLVisualizer object\nboost::shared_ptr<pcl::visualization::PCLVisualizer> p;\n\nstruct EventHelper\n{\n void \n cloud_cb (const pcl::PointCloud<pcl::PointXYZ>::ConstPtr & cloud)\n {\n FPS_CALC (\"callback\");\n if (mutex_.try_lock ())\n {\n g_cloud = cloud;\n new_cloud = true;\n mutex_.unlock ();\n }\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 p.reset (new pcl::visualization::PCLVisualizer (argc, argv, \"OpenNI Viewer\"));\n\n std::string device_id = \"\";\n pcl::console::parse_argument (argc, argv, \"-dev\", device_id);\n\n pcl::Grabber* interface = new pcl::OpenNIGrabber (device_id);\n\n EventHelper h;\n boost::function<void(const pcl::PointCloud<pcl::PointXYZ>::ConstPtr&) > f = boost::bind (&EventHelper::cloud_cb, &h, _1);\n boost::signals2::connection c1 = interface->registerCallback (f);\n\n bool first = true;\n interface->start ();\n while (!p->wasStopped ())\n {\n p->spinOnce ();\n if (new_cloud && mutex_.try_lock ())\n {\n new_cloud = false;\n if (g_cloud)\n {\n FPS_CALC (\"drawing\");\n if (first)\n {\n p->addPointCloud (g_cloud, \"OpenNICloud\");\n first = false;\n }\n p->updatePointCloud (g_cloud, \"OpenNICloud\");\n }\n mutex_.unlock ();\n }\n else\n boost::this_thread::sleep (boost::posix_time::microseconds (1000));\n }\n\n interface->stop ();\n}\n\/* ]--- *\/\n<|endoftext|>"} {"text":"<commit_before>\/\/ Time: O(nlogn)\n\/\/ Space: O(n)\n\nclass Solution {\npublic:\n bool containsNearbyAlmostDuplicate(vector<int>& nums, int k, int t) {\n deque<int64_t> window_deq;\n multiset<int64_t> window;\n for (int i = 0; i < nums.size(); ++i) {\n \/\/ Only keep at most k elements.\n if (window.size() > k) {\n int num = window_deq.front();\n window_deq.pop_front();\n window.erase(window.find(num));\n }\n \/\/ Every search costs time: O(logn).\n const auto it = window.lower_bound(nums[i] - t);\n if (it == window.cend() || (*it - nums[i]) > t) {\n \/\/ Not found.\n window_deq.emplace_back(nums[i]);\n window.emplace(nums[i]);\n } else {\n return true;\n }\n }\n return false;\n }\n};\n<commit_msg>Update contains-duplicate-iii.cpp<commit_after>\/\/ Time: O(nlogn)\n\/\/ Space: O(n)\n\nclass Solution {\npublic:\n bool containsNearbyAlmostDuplicate(vector<int>& nums, int k, int t) {\n deque<int64_t> window;\n multiset<int64_t> bst;\n for (int i = 0; i < nums.size(); ++i) {\n \/\/ Only keep at most k elements.\n if (bst.size() > k) {\n int num = window.front();\n window.pop_front();\n bst.erase(bst.find(num));\n }\n \/\/ Every search costs time: O(logn).\n const auto it = bst.lower_bound(nums[i] - t);\n if (it == bst.cend() || (*it - nums[i]) > t) {\n \/\/ Not found.\n window.emplace_back(nums[i]);\n bst.emplace(nums[i]);\n } else {\n return true;\n }\n }\n return false;\n }\n};\n<|endoftext|>"} {"text":"<commit_before>\/\/ Copyright © 2011, Université catholique de Louvain\n\/\/ All rights 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\/\/\n\/\/ THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS \"AS IS\"\n\/\/ AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE\n\/\/ IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE\n\/\/ ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE\n\/\/ LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR\n\/\/ CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF\n\/\/ SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS\n\/\/ INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN\n\/\/ CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)\n\/\/ ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE\n\/\/ POSSIBILITY OF SUCH DAMAGE.\n\n#ifndef __MODCOMPILERSUPPORT_H\n#define __MODCOMPILERSUPPORT_H\n\n#include \"..\/mozartcore.hh\"\n\n#ifndef MOZART_GENERATOR\n\nnamespace mozart {\n\nnamespace builtins {\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ CompilerSupport module \/\/\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nclass ModCompilerSupport: public Module {\npublic:\n ModCompilerSupport(): Module(\"CompilerSupport\") {}\n\n class NewCodeArea: public Builtin<NewCodeArea> {\n public:\n NewCodeArea(): Builtin(\"newCodeArea\") {}\n\n OpResult operator()(VM vm, In byteCodeList, In XCount, In KsList,\n Out result) {\n \/\/ Read byte code\n std::vector<ByteCode> byteCode;\n\n ozListForEach(vm, byteCodeList,\n [&] (nativeint elem) -> OpResult {\n if ((elem < std::numeric_limits<ByteCode>::min()) ||\n (elem > std::numeric_limits<ByteCode>::max())) {\n return raiseTypeError(vm, MOZART_STR(\"Byte code element\"),\n build(vm, elem));\n } else {\n byteCode.push_back((ByteCode) elem);\n return OpResult::proceed();\n }\n },\n MOZART_STR(\"List of byte code elements\")\n );\n\n \/\/ Read X count\n nativeint intXCount = 0;\n MOZART_GET_ARG(intXCount, XCount, MOZART_STR(\"positive integer\"));\n\n \/\/ Read number of K registers\n size_t KCount = 0;\n MOZART_CHECK_OPRESULT(ozListLength(vm, KsList, KCount));\n\n \/\/ Create the code area\n result = CodeArea::build(vm, KCount, &byteCode.front(),\n byteCode.size() * sizeof(ByteCode),\n intXCount);\n\n \/\/ Fill the K registers\n ArrayInitializer KInitializer = result;\n size_t index = 0;\n\n ozListForEach(vm, KsList,\n [&] (UnstableNode& elem) -> OpResult {\n KInitializer.initElement(vm, index, elem);\n index++;\n return OpResult::proceed();\n },\n MOZART_STR(\"list\")\n );\n\n return OpResult::proceed();\n }\n };\n\n class NewAbstraction: public Builtin<NewAbstraction> {\n public:\n NewAbstraction(): Builtin(\"newAbstraction\") {}\n\n OpResult operator()(VM vm, In arity, In body, In GsList, Out result) {\n \/\/ Read arity\n nativeint intArity = 0;\n MOZART_GET_ARG(intArity, arity, MOZART_STR(\"positive integer\"));\n\n \/\/ Check the type of the code area\n bool bodyIsCodeArea = false;\n MOZART_CHECK_OPRESULT(\n CodeAreaProvider(body).isCodeAreaProvider(vm, bodyIsCodeArea));\n if (!bodyIsCodeArea) {\n return raiseTypeError(vm, MOZART_STR(\"Code area\"), body);\n }\n\n \/\/ Read number of G registers\n size_t GCount = 0;\n MOZART_CHECK_OPRESULT(ozListLength(vm, GsList, GCount));\n\n \/\/ Create the abstraction\n result = Abstraction::build(vm, GCount, intArity, body);\n\n \/\/ Fill the G registers\n ArrayInitializer GInitializer = result;\n size_t index = 0;\n\n ozListForEach(vm, GsList,\n [&] (UnstableNode& elem) -> OpResult {\n GInitializer.initElement(vm, index, elem);\n index++;\n return OpResult::proceed();\n },\n MOZART_STR(\"list\")\n );\n\n return OpResult::proceed();\n }\n };\n\n class IsBuiltin: public Builtin<IsBuiltin> {\n public:\n IsBuiltin(): Builtin(\"isBuiltin\") {}\n\n OpResult operator()(VM vm, In value, Out result) {\n bool boolResult = false;\n MOZART_CHECK_OPRESULT(BuiltinCallable(value).isBuiltin(vm, boolResult));\n\n result = Boolean::build(vm, boolResult);\n return OpResult::proceed();\n }\n };\n\n class GetBuiltinInfo: public Builtin<GetBuiltinInfo> {\n public:\n GetBuiltinInfo(): Builtin(\"getBuiltinInfo\") {}\n\n OpResult operator()(VM vm, In value, Out result) {\n BaseBuiltin* builtin = nullptr;\n MOZART_CHECK_OPRESULT(BuiltinCallable(value).getBuiltin(vm, builtin));\n\n UnstableNode name = builtin->getNameAtom(vm);\n UnstableNode arity = build(vm, builtin->getArity());\n\n UnstableNode params = build(vm, vm->coreatoms.nil);\n for (size_t i = builtin->getArity(); i > 0; i--) {\n auto& paramInfo = builtin->getParams(i-1);\n UnstableNode param = buildRecord(\n vm, buildArity(vm, MOZART_STR(\"param\"), MOZART_STR(\"kind\")),\n paramInfo.kind == ParamInfo::Kind::pkIn ?\n MOZART_STR(\"in\") : MOZART_STR(\"out\"));\n params = buildCons(vm, std::move(param), std::move(params));\n }\n\n UnstableNode inlineAs;\n if (builtin->getInlineAs() < 0)\n inlineAs = build(vm, MOZART_STR(\"none\"));\n else\n inlineAs = buildTuple(vm, MOZART_STR(\"some\"), builtin->getInlineAs());\n\n result = buildRecord(\n vm, buildArity(vm,\n MOZART_STR(\"builtin\"),\n MOZART_STR(\"arity\"),\n MOZART_STR(\"inlineAs\"),\n MOZART_STR(\"name\"),\n MOZART_STR(\"params\")),\n std::move(arity), std::move(inlineAs), std::move(name),\n std::move(params));\n\n return OpResult::proceed();\n }\n };\n};\n\n}\n\n}\n\n#endif \/\/ MOZART_GENERATOR\n\n#endif \/\/ __MODCOMPILERSUPPORT_H\n<commit_msg>Added things needed by the compiler in CompilerSupport.<commit_after>\/\/ Copyright © 2011, Université catholique de Louvain\n\/\/ All rights 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\/\/\n\/\/ THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS \"AS IS\"\n\/\/ AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE\n\/\/ IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE\n\/\/ ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE\n\/\/ LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR\n\/\/ CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF\n\/\/ SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS\n\/\/ INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN\n\/\/ CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)\n\/\/ ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE\n\/\/ POSSIBILITY OF SUCH DAMAGE.\n\n#ifndef __MODCOMPILERSUPPORT_H\n#define __MODCOMPILERSUPPORT_H\n\n#include \"..\/mozartcore.hh\"\n\n#ifndef MOZART_GENERATOR\n\nnamespace mozart {\n\nnamespace builtins {\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ CompilerSupport module \/\/\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nclass ModCompilerSupport: public Module {\npublic:\n ModCompilerSupport(): Module(\"CompilerSupport\") {}\n\n class FeatureLess: public Builtin<FeatureLess> {\n public:\n FeatureLess(): Builtin(\"featureLess\") {}\n\n OpResult operator()(VM vm, In lhs, In rhs, Out result) {\n MOZART_REQUIRE_FEATURE(lhs);\n MOZART_REQUIRE_FEATURE(rhs);\n\n result = build(vm, compareFeatures(vm, lhs, rhs) < 0);\n return OpResult::proceed();\n }\n };\n\n class NewCodeArea: public Builtin<NewCodeArea> {\n public:\n NewCodeArea(): Builtin(\"newCodeArea\") {}\n\n OpResult operator()(VM vm, In byteCodeList, In XCount, In KsList,\n Out result) {\n \/\/ Read byte code\n std::vector<ByteCode> byteCode;\n\n ozListForEach(vm, byteCodeList,\n [&] (nativeint elem) -> OpResult {\n if ((elem < std::numeric_limits<ByteCode>::min()) ||\n (elem > std::numeric_limits<ByteCode>::max())) {\n return raiseTypeError(vm, MOZART_STR(\"Byte code element\"),\n build(vm, elem));\n } else {\n byteCode.push_back((ByteCode) elem);\n return OpResult::proceed();\n }\n },\n MOZART_STR(\"List of byte code elements\")\n );\n\n \/\/ Read X count\n nativeint intXCount = 0;\n MOZART_GET_ARG(intXCount, XCount, MOZART_STR(\"positive integer\"));\n\n \/\/ Read number of K registers\n size_t KCount = 0;\n MOZART_CHECK_OPRESULT(ozListLength(vm, KsList, KCount));\n\n \/\/ Create the code area\n result = CodeArea::build(vm, KCount, &byteCode.front(),\n byteCode.size() * sizeof(ByteCode),\n intXCount);\n\n \/\/ Fill the K registers\n ArrayInitializer KInitializer = result;\n size_t index = 0;\n\n ozListForEach(vm, KsList,\n [&] (UnstableNode& elem) -> OpResult {\n KInitializer.initElement(vm, index, elem);\n index++;\n return OpResult::proceed();\n },\n MOZART_STR(\"list\")\n );\n\n return OpResult::proceed();\n }\n };\n\n class NewAbstraction: public Builtin<NewAbstraction> {\n public:\n NewAbstraction(): Builtin(\"newAbstraction\") {}\n\n OpResult operator()(VM vm, In arity, In body, In GsList, Out result) {\n \/\/ Read arity\n nativeint intArity = 0;\n MOZART_GET_ARG(intArity, arity, MOZART_STR(\"positive integer\"));\n\n \/\/ Check the type of the code area\n bool bodyIsCodeArea = false;\n MOZART_CHECK_OPRESULT(\n CodeAreaProvider(body).isCodeAreaProvider(vm, bodyIsCodeArea));\n if (!bodyIsCodeArea) {\n return raiseTypeError(vm, MOZART_STR(\"Code area\"), body);\n }\n\n \/\/ Read number of G registers\n size_t GCount = 0;\n MOZART_CHECK_OPRESULT(ozListLength(vm, GsList, GCount));\n\n \/\/ Create the abstraction\n result = Abstraction::build(vm, GCount, intArity, body);\n\n \/\/ Fill the G registers\n ArrayInitializer GInitializer = result;\n size_t index = 0;\n\n ozListForEach(vm, GsList,\n [&] (UnstableNode& elem) -> OpResult {\n GInitializer.initElement(vm, index, elem);\n index++;\n return OpResult::proceed();\n },\n MOZART_STR(\"list\")\n );\n\n return OpResult::proceed();\n }\n };\n\n class IsBuiltin: public Builtin<IsBuiltin> {\n public:\n IsBuiltin(): Builtin(\"isBuiltin\") {}\n\n OpResult operator()(VM vm, In value, Out result) {\n bool boolResult = false;\n MOZART_CHECK_OPRESULT(BuiltinCallable(value).isBuiltin(vm, boolResult));\n\n result = Boolean::build(vm, boolResult);\n return OpResult::proceed();\n }\n };\n\n class GetBuiltinInfo: public Builtin<GetBuiltinInfo> {\n public:\n GetBuiltinInfo(): Builtin(\"getBuiltinInfo\") {}\n\n OpResult operator()(VM vm, In value, Out result) {\n BaseBuiltin* builtin = nullptr;\n MOZART_CHECK_OPRESULT(BuiltinCallable(value).getBuiltin(vm, builtin));\n\n UnstableNode name = builtin->getNameAtom(vm);\n UnstableNode arity = build(vm, builtin->getArity());\n\n UnstableNode params = build(vm, vm->coreatoms.nil);\n for (size_t i = builtin->getArity(); i > 0; i--) {\n auto& paramInfo = builtin->getParams(i-1);\n UnstableNode param = buildRecord(\n vm, buildArity(vm, MOZART_STR(\"param\"), MOZART_STR(\"kind\")),\n paramInfo.kind == ParamInfo::Kind::pkIn ?\n MOZART_STR(\"in\") : MOZART_STR(\"out\"));\n params = buildCons(vm, std::move(param), std::move(params));\n }\n\n UnstableNode inlineAs;\n if (builtin->getInlineAs() < 0)\n inlineAs = build(vm, MOZART_STR(\"none\"));\n else\n inlineAs = buildTuple(vm, MOZART_STR(\"some\"), builtin->getInlineAs());\n\n result = buildRecord(\n vm, buildArity(vm,\n MOZART_STR(\"builtin\"),\n MOZART_STR(\"arity\"),\n MOZART_STR(\"inlineAs\"),\n MOZART_STR(\"name\"),\n MOZART_STR(\"params\")),\n std::move(arity), std::move(inlineAs), std::move(name),\n std::move(params));\n\n return OpResult::proceed();\n }\n };\n\n class IsUniqueName: public Builtin<IsUniqueName> {\n public:\n IsUniqueName(): Builtin(\"isUniqueName\") {}\n\n OpResult operator()(VM vm, In value, Out result) {\n if (value.isTransient())\n return OpResult::waitFor(vm, value);\n\n result = build(vm, value.is<UniqueName>());\n return OpResult::proceed();\n }\n };\n};\n\n}\n\n}\n\n#endif \/\/ MOZART_GENERATOR\n\n#endif \/\/ __MODCOMPILERSUPPORT_H\n<|endoftext|>"} {"text":"<commit_before>#include <iostream>\n\nusing namespace std;\n\nint iterative_power_function(int m, int n){\t\n\tif(m < 0 || n < 0){\n\t\tcout << \"Input not valid\" << endl;\n\t\treturn -1;\n\t}else{\n\t\tint product = 1;\n\t\tfor(int x=0; x<n; x++){\n\t\t\tproduct *= m;\n\t\t}\n\treturn product;\n\t}\n}\n\nint iterative_factorial_function(int n){\n\tif( n<=0){\n\t\tcout << \"Input not valid\" << endl;\n\t\treturn -1;\n\t}else{\n\t\tint product = 1;\n\t\tfor(int x = 1; x <= n; x++){\n\t\t\tproduct *= x;\n\t\t}\n\treturn product;\n\t}\n}\n\nint main(){\n\tint temp;\n\tcin >> temp;\n\tcout << \"BASIC CONDITIONAL STATEMENT\" << endl;\n\tif(temp < 25){\n\t\tcout << \"It is too cold\" << endl;\n\t}else if(temp > 50){\n\t\tcout << \"It is too warm\" << endl;\n\t}else{\n\t\tcout << \"The temperature is perfect\" << endl;\n\t}\n\t\n\tcout << \"NESTED CONDITIONAL STATEMENTS\" << endl;\n\tif(temp >= 25){\n\t\tif(temp <= 50){\n\t\t\tcout << \"The temperature is perfect\" << endl;\n\t\t}else{\n\t\t\tcout << \"the temperature is not perfect\" << endl;\n\t\t}\n\t}else{\n\t\tcout << \"The temperature is not perfect\" << endl;\n\t}\n\t\n\tcout << \"CONDITIONAL STATEMENTS WITH THE AND OPERATOR\" << endl;\n\tif(temp >= 25 && temp <= 50){\n\t\tcout << \"The temperature is perfect\" << endl;\n\t}else{\n\t\tcout << \"The temperature is not perfect\" << endl;\n\t}\n\t\n\tcout << \"CONDITIONAL STATEMENTS WITH THE OR OPERATOR\" << endl;\n\tif(temp < 25 || temp > 50){\n\t\tcout << \"The temperature is not perfect\" << endl;\n\t}else{ \n\t\tcout << \"The temperature is perfect\" << endl; \n\t}\n\t\n\tcout << \"WHILE LOOP\" << endl;\n\tif(temp < 25){\n\t\tcout << \"It is too cold\" << endl;\n\t\tint counter = temp;\n\t\twhile(counter < 25){\n\t\t\tcounter++;\n\t\t\tcout << \"The temperature has been increased to \" << counter << \" degrees\" << endl;\n\t\t}\n\t\tcout << \"The temperature is now perfect\";\n\t}else if(temp > 50){\n\t\tcout << \"It is too warm\" << endl;\n\t\tint counter = temp;\n\t\twhile(counter >= 50){\n\t\t\tcounter--;\n\t\t\tcout << \"The temperature has been decreased to \" << temp << \" degrees\" << endl;\n\t\t}\n\t\tcout << \"The temperature is now perfect\" << endl;\n\t}else{\n\t\tcout << \"The temperature is perfect\" << endl;\n\t}\n\tcout << \"FOR LOOP\" << endl;\n\tif(temp < 25){\n\t\tcout << \"It is too cold\" << endl;\n\t\tfor(int counter = temp; counter < 25; ++counter){\n\t\t\tcout << \"The temperature has been increased to \" << counter << \" degrees\" << endl;\n\t\t}\n\t\tcout << \"The temperature is now perfect\";\n\t}else if(temp > 50){\n\t\tcout << \"It is too warm\" << endl;\n\t\tfor(int counter = temp; counter >50; --counter){\n\t\t\tcout << \"The temperature has been decreased to \" << counter << \" degrees\" << endl;\n\t\t}\n\t\tcout << \"The temperature is now perfect\";\n\t}else{\n\t\tcout << \"The temperature is perfect\" << endl;\n\t}\n\treturn 0;\n\n}\n<commit_msg>Update Sample.cpp<commit_after>#include <iostream>\n\nusing namespace std;\n\/\/Practice Problem 1\nint iterative_power_function(int m, int n){\t\n\tif(m < 0 || n < 0){\n\t\tcout << \"Input not valid\" << endl;\n\t\treturn -1;\n\t}else{\n\t\tint product = 1;\n\t\tfor(int x=0; x<n; x++){\n\t\t\tproduct *= m;\n\t\t}\n\treturn product;\n\t}\n}\n\/\/Practice Problem 2\nint iterative_factorial_function(int n){\n\tif( n<=0){\n\t\tcout << \"Input not valid\" << endl;\n\t\treturn -1;\n\t}else{\n\t\tint product = 1;\n\t\tfor(int x = 1; x <= n; x++){\n\t\t\tproduct *= x;\n\t\t}\n\treturn product;\n\t}\n}\n\nint main(){\n\tint temp;\n\tcin >> temp;\n\tcout << \"BASIC CONDITIONAL STATEMENT\" << endl;\n\tif(temp < 25){\n\t\tcout << \"It is too cold\" << endl;\n\t}else if(temp > 50){\n\t\tcout << \"It is too warm\" << endl;\n\t}else{\n\t\tcout << \"The temperature is perfect\" << endl;\n\t}\n\t\n\tcout << \"NESTED CONDITIONAL STATEMENTS\" << endl;\n\tif(temp >= 25){\n\t\tif(temp <= 50){\n\t\t\tcout << \"The temperature is perfect\" << endl;\n\t\t}else{\n\t\t\tcout << \"the temperature is not perfect\" << endl;\n\t\t}\n\t}else{\n\t\tcout << \"The temperature is not perfect\" << endl;\n\t}\n\t\n\tcout << \"CONDITIONAL STATEMENTS WITH THE AND OPERATOR\" << endl;\n\tif(temp >= 25 && temp <= 50){\n\t\tcout << \"The temperature is perfect\" << endl;\n\t}else{\n\t\tcout << \"The temperature is not perfect\" << endl;\n\t}\n\t\n\tcout << \"CONDITIONAL STATEMENTS WITH THE OR OPERATOR\" << endl;\n\tif(temp < 25 || temp > 50){\n\t\tcout << \"The temperature is not perfect\" << endl;\n\t}else{ \n\t\tcout << \"The temperature is perfect\" << endl; \n\t}\n\t\n\tcout << \"WHILE LOOP\" << endl;\n\tif(temp < 25){\n\t\tcout << \"It is too cold\" << endl;\n\t\tint counter = temp;\n\t\twhile(counter < 25){\n\t\t\tcounter++;\n\t\t\tcout << \"The temperature has been increased to \" << counter << \" degrees\" << endl;\n\t\t}\n\t\tcout << \"The temperature is now perfect\";\n\t}else if(temp > 50){\n\t\tcout << \"It is too warm\" << endl;\n\t\tint counter = temp;\n\t\twhile(counter >= 50){\n\t\t\tcounter--;\n\t\t\tcout << \"The temperature has been decreased to \" << temp << \" degrees\" << endl;\n\t\t}\n\t\tcout << \"The temperature is now perfect\" << endl;\n\t}else{\n\t\tcout << \"The temperature is perfect\" << endl;\n\t}\n\tcout << \"FOR LOOP\" << endl;\n\tif(temp < 25){\n\t\tcout << \"It is too cold\" << endl;\n\t\tfor(int counter = temp; counter < 25; ++counter){\n\t\t\tcout << \"The temperature has been increased to \" << counter << \" degrees\" << endl;\n\t\t}\n\t\tcout << \"The temperature is now perfect\";\n\t}else if(temp > 50){\n\t\tcout << \"It is too warm\" << endl;\n\t\tfor(int counter = temp; counter >50; --counter){\n\t\t\tcout << \"The temperature has been decreased to \" << counter << \" degrees\" << endl;\n\t\t}\n\t\tcout << \"The temperature is now perfect\";\n\t}else{\n\t\tcout << \"The temperature is perfect\" << endl;\n\t}\n\treturn 0;\n\n}\n<|endoftext|>"} {"text":"<commit_before>\/*****************************************************************************\n * x266.cpp: WC Encoder Functions\n *****************************************************************************\n * Copyright (C) 2015-2020 x266 project\n *\n * Authors: Min Chen <chenm003@163.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;\n *\n * This program is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the\n * 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 02111, USA.\n *\n * This program is also available under a commercial proprietary license.\n * For more information, contact us at chenm003@163.com.\n *****************************************************************************\/\n\n#define _CRT_SECURE_NO_WARNINGS\n#include <stdio.h>\n#include <stdlib.h>\n#include <string.h>\n#include <stdint.h>\n#include <assert.h>\n\n \/*****************************************************************************\n *****************************************************************************\/\n#define MAX_WIDTH (4096)\n#define MAX_HEIGHT (2048)\n#define REF_BLOCK_SZ (16)\n#define REF_FRAME_STRD (MAX_WIDTH \/ REF_BLOCK_SZ)\n\n\/\/ Thanks to https:\/\/gist.github.com\/PhilCK\/1534763\r\n#ifdef __GNUC__\r\n#define PACKED( class_to_pack ) class_to_pack __attribute__((__packed__))\r\n#else\r\n#define PACKED( class_to_pack ) __pragma( pack(push, 1) ) class_to_pack __pragma( pack(pop) )\r\n#endif\r\n\n\/*****************************************************************************\n *****************************************************************************\/\n\r\nPACKED(struct _ref_block_t\n{\n \/\/ REF_BLOCK_SZ=16\n uint8_t m_Y[16*16]; \/\/ 256 bytes - Y\n uint8_t m_C[2*8*8]; \/\/ 128 bytes - UV\n uint8_t m_I[128]; \/\/ 128 bytes - Info\n});\ntypedef struct _ref_block_t ref_block_t;\n\ntypedef struct _codec_t\n{\n ref_block_t *m_frames[3]; \/\/ [0]=Cur, [1..N]=References\n intptr_t m_frames_strd;\n} codec_t;\n\n\/*****************************************************************************\n *****************************************************************************\/\nvoid xConvInputFmt(ref_block_t *pBlock,\n const uint8_t *inpY,\n const intptr_t strdY,\n const uint8_t *inpU,\n const uint8_t *inpV,\n const intptr_t strdC,\n const int width,\n const int height)\n{\n assert(!(width % REF_BLOCK_SZ) && \"width is not multiple of 16\");\n assert(!(height % REF_BLOCK_SZ) && \"height is not multiple of 16\");\n\n int i, j, x, y;\n for(y = 0; y < height; y += REF_BLOCK_SZ)\n {\n for(x = 0; x < width; x += REF_BLOCK_SZ)\n {\n \/\/ Y\n for(i = 0; i < REF_BLOCK_SZ; i++)\n {\n memcpy(&pBlock->m_Y[i * REF_BLOCK_SZ],\n &inpY[(y+i)*strdY + x],\n REF_BLOCK_SZ*sizeof(uint8_t));\n }\n\n \/\/ UV - 420SP\n for(i = 0; i < REF_BLOCK_SZ\/2; i++)\n {\n for(j = 0; j < REF_BLOCK_SZ\/2; j++)\n {\n pBlock->m_C[i*REF_BLOCK_SZ + j*2 + 0] = inpU[((y>>1)+i)*strdC + ((x>>1)+j)];\n pBlock->m_C[i*REF_BLOCK_SZ + j*2 + 1] = inpV[((y>>1)+i)*strdC + ((x>>1)+j)];\n }\n }\n pBlock++;\n }\n }\n}\n\n \/*****************************************************************************\n *****************************************************************************\/\nint main(int argc, char *argv[])\n{\n if(argc < 5)\n {\n fprintf(stderr, \"Usage: %s -i in_file -o out_file -w width -h height -f frames\\n\", argv[0]);\n return 0;\n }\n\n \/\/ Encoder parameters\n FILE *fpi = NULL;\n FILE *fpo = NULL;\n int nWidth = 0;\n int nHeight = 0;\n int nFrames = 0;\n\n int i;\n for(i = 1; i < argc; i++)\n {\n if(!_stricmp(argv[i], \"-i\"))\n {\n fpi = fopen(argv[++i], \"rb\");\n }\n else if(!_stricmp(argv[i], \"-o\"))\n {\n fpo = fopen(argv[++i], \"wb\");\n }\n else if(!_stricmp(argv[i], \"-w\"))\n {\n nWidth = atoi(argv[++i]);\n }\n else if(!_stricmp(argv[i], \"-h\"))\n {\n nHeight = atoi(argv[++i]);\n }\n else if(!_stricmp(argv[i], \"-f\"))\n {\n nFrames = atoi(argv[++i]);\n }\n }\n\n int ret = 0;\n\n \/\/ Validate parameters\n if(nWidth == 0 || nWidth > MAX_WIDTH ||\n nHeight == 0 || nHeight > MAX_HEIGHT ||\n fpi == NULL || fpo == NULL)\n {\n fprintf(stderr, \"Parameters check failed\\n\");\n ret = -1;\n goto _cleanup;\n }\n\n \/\/ Unit Tests\n#if TEST_xConvInputFmt\n {\n int i, j;\n uint8_t tmp[32*16+2*32*16\/4];\n memset(tmp, 0xCC, sizeof(tmp));\n\n for(i = 0; i < 32*16+2*32*16\/4; i++)\n {\n tmp[i] = i;\n }\n\n ref_block_t blocks[2];\n memset(blocks, 0xCD, sizeof(blocks));\n\n xConvInputFmt(blocks, &tmp[0], 32, &tmp[256], &tmp[320], 16, 32, 16);\n printf(\"xConvFmt Done\\n\");\n }\n#endif\n\n \/\/ Encode\n\n \/\/ Prepare input frame\n\n \/\/ Cleanup\n_cleanup:\n if(fpi)\n fclose(fpi);\n if(fpo)\n fclose(fpo);\n\n return ret;\n}\n\n<commit_msg>[x266] xConvOutput420 for convert internal YUV420SP into YUV420<commit_after>\/*****************************************************************************\n * x266.cpp: WC Encoder Functions\n *****************************************************************************\n * Copyright (C) 2015-2020 x266 project\n *\n * Authors: Min Chen <chenm003@163.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;\n *\n * This program is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the\n * 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 02111, USA.\n *\n * This program is also available under a commercial proprietary license.\n * For more information, contact us at chenm003@163.com.\n *****************************************************************************\/\n\n#define _CRT_SECURE_NO_WARNINGS\n#include <stdio.h>\n#include <stdlib.h>\n#include <string.h>\n#include <stdint.h>\n#include <assert.h>\n\n \/*****************************************************************************\n *****************************************************************************\/\n#define MAX_WIDTH (4096)\n#define MAX_HEIGHT (2048)\n#define REF_BLOCK_SZ (16)\n#define REF_FRAME_STRD (MAX_WIDTH \/ REF_BLOCK_SZ)\n\n\/\/ Thanks to https:\/\/gist.github.com\/PhilCK\/1534763\n#ifdef __GNUC__\n#define PACKED( class_to_pack ) class_to_pack __attribute__((__packed__))\n#else\n#define PACKED( class_to_pack ) __pragma( pack(push, 1) ) class_to_pack __pragma( pack(pop) )\n#endif\n\n#define ASIZE(x) (sizeof(x) \/ sizeof((x)[0]))\n\n\/*****************************************************************************\n *****************************************************************************\/\n\nPACKED(struct _ref_block_t\n{\n \/\/ REF_BLOCK_SZ=16\n uint8_t m_Y[16*16]; \/\/ 256 bytes - Y\n uint8_t m_C[2*8*8]; \/\/ 128 bytes - UV\n uint8_t m_I[128]; \/\/ 128 bytes - Info\n});\ntypedef struct _ref_block_t ref_block_t;\n\ntypedef struct _codec_t\n{\n ref_block_t *m_frames[3]; \/\/ [0]=Cur, [1..N]=References\n intptr_t m_frames_strd;\n} codec_t;\n\n\/*****************************************************************************\n *****************************************************************************\/\nvoid xConvInputFmt(ref_block_t *pBlock,\n const uint8_t *inpY,\n const intptr_t strdY,\n const uint8_t *inpU,\n const uint8_t *inpV,\n const intptr_t strdC,\n const int width,\n const int height)\n{\n assert(!(width % REF_BLOCK_SZ) && \"width is not multiple of 16\");\n assert(!(height % REF_BLOCK_SZ) && \"height is not multiple of 16\");\n\n int i, j, x, y;\n for(y = 0; y < height; y += REF_BLOCK_SZ)\n {\n for(x = 0; x < width; x += REF_BLOCK_SZ)\n {\n \/\/ Y\n for(i = 0; i < REF_BLOCK_SZ; i++)\n {\n memcpy(&pBlock->m_Y[i * REF_BLOCK_SZ],\n &inpY[(y+i)*strdY + x],\n REF_BLOCK_SZ*sizeof(uint8_t));\n }\n\n \/\/ UV - 420SP\n for(i = 0; i < REF_BLOCK_SZ\/2; i++)\n {\n for(j = 0; j < REF_BLOCK_SZ\/2; j++)\n {\n pBlock->m_C[i*REF_BLOCK_SZ + j*2 + 0] = inpU[((y>>1)+i)*strdC + ((x>>1)+j)];\n pBlock->m_C[i*REF_BLOCK_SZ + j*2 + 1] = inpV[((y>>1)+i)*strdC + ((x>>1)+j)];\n }\n }\n pBlock++;\n }\n }\n}\n\nvoid xConvOutput420(const ref_block_t *pBlock,\n uint8_t *outY,\n const intptr_t strdY,\n uint8_t *outU,\n uint8_t *outV,\n intptr_t strdC,\n const int width,\n const int height)\n{\n assert(!(width % REF_BLOCK_SZ) && \"width is not multiple of 16\");\n assert(!(height % REF_BLOCK_SZ) && \"height is not multiple of 16\");\n\n int i, j, x, y;\n for(y = 0; y < height; y += REF_BLOCK_SZ)\n {\n for(x = 0; x < width; x += REF_BLOCK_SZ)\n {\n \/\/ Y\n for(i = 0; i < REF_BLOCK_SZ; i++)\n {\n memcpy(&outY[(y+i)*strdY + x],\n &pBlock->m_Y[i * REF_BLOCK_SZ],\n REF_BLOCK_SZ*sizeof(uint8_t));\n }\n\n \/\/ UV - 420SP\n for(i = 0; i < REF_BLOCK_SZ\/2; i++)\n {\n for(j = 0; j < REF_BLOCK_SZ\/2; j++)\n {\n outU[((y>>1)+i)*strdC + ((x>>1)+j)] = pBlock->m_C[i*REF_BLOCK_SZ + j*2 + 0];\n outV[((y>>1)+i)*strdC + ((x>>1)+j)] = pBlock->m_C[i*REF_BLOCK_SZ + j*2 + 1];\n }\n }\n pBlock++;\n }\n }\n}\n\n \/*****************************************************************************\n *****************************************************************************\/\nint main(int argc, char *argv[])\n{\n if(argc < 5)\n {\n fprintf(stderr, \"Usage: %s -i in_file -o out_file -w width -h height -f frames\\n\", argv[0]);\n return 0;\n }\n\n \/\/ Encoder parameters\n FILE *fpi = NULL;\n FILE *fpo = NULL;\n uint32_t nWidth = 0;\n uint32_t nHeight = 0;\n int nFrames = 0;\n uint8_t *frameBuf = NULL;\n\n int i;\n for(i = 1; i < argc; i++)\n {\n if(!_stricmp(argv[i], \"-i\"))\n {\n fpi = fopen(argv[++i], \"rb\");\n }\n else if(!_stricmp(argv[i], \"-o\"))\n {\n fpo = fopen(argv[++i], \"wb\");\n }\n else if(!_stricmp(argv[i], \"-w\"))\n {\n nWidth = atoi(argv[++i]);\n }\n else if(!_stricmp(argv[i], \"-h\"))\n {\n nHeight = atoi(argv[++i]);\n }\n else if(!_stricmp(argv[i], \"-f\"))\n {\n nFrames = atoi(argv[++i]);\n }\n }\n\n int ret = 0;\n\n \/\/ Validate parameters\n if(nWidth == 0 || nWidth > MAX_WIDTH ||\n nHeight == 0 || nHeight > MAX_HEIGHT ||\n fpi == NULL || fpo == NULL)\n {\n fprintf(stderr, \"Parameters check failed\\n\");\n ret = -1;\n goto _cleanup;\n }\n\n \/\/ Unit Tests\n#if TEST_xConvInputFmt\n {\n int i, j;\n uint8_t tmp[32*16+2*32*16\/4];\n memset(tmp, 0xCC, sizeof(tmp));\n\n for(i = 0; i < 32*16+2*32*16\/4; i++)\n {\n tmp[i] = i;\n }\n\n ref_block_t blocks[2];\n memset(blocks, 0xCD, sizeof(blocks));\n\n xConvInputFmt(blocks, &tmp[0], 32, &tmp[256], &tmp[320], 16, 32, 16);\n printf(\"xConvFmt Done\\n\");\n }\n#endif\n\n \/\/ Initialize codec\n const uint32_t frameSize = nWidth * nHeight * 3 \/ 2;\n frameBuf = (uint8_t*)_aligned_malloc(frameSize * sizeof(uint8_t), 4096);\n assert(frameBuf && \"Memory allocate failed\\n\");\n\n codec_t codec;\n memset(&codec, 0, sizeof(codec));\n\n codec.m_frames_strd = nWidth \/ REF_BLOCK_SZ;\n for(i = 0; i < ASIZE(codec.m_frames); i++)\n {\n codec.m_frames[i] = (ref_block_t *)_aligned_malloc(nWidth * nHeight \/ (REF_BLOCK_SZ * REF_BLOCK_SZ) * sizeof(ref_block_t), 4096);\n }\n\n \/\/ Encode loop\n for(i = 0; i < nFrames; i++)\n {\n \/\/ Prepare input frame\n if(frameSize != fread(frameBuf, 1, frameSize, fpi))\n {\n fprintf(stderr, \"Read file failed\\n\");\n goto _cleanup;\n }\n\n xConvInputFmt(codec.m_frames[0],\n frameBuf,\n nWidth,\n frameBuf + nWidth * nHeight,\n frameBuf + nWidth * nHeight * 5 \/ 4,\n nWidth \/ 2,\n nWidth,\n nHeight);\n\n \/\/ for test only\n memset(frameBuf, 0xCD, nWidth * nHeight * 3 \/ 2 * sizeof(uint8_t));\n xConvOutput420(codec.m_frames[0],\n frameBuf,\n nWidth,\n frameBuf + nWidth * nHeight,\n frameBuf + nWidth * nHeight * 5 \/ 4,\n nWidth \/ 2,\n nWidth,\n nHeight);\n\n fwrite(frameBuf, 1, frameSize, fpo);\n }\n printf(\"Encode %d frames done\\n\", i);\n\n \/\/ Cleanup\n_cleanup:\n if(fpi)\n fclose(fpi);\n if(fpo)\n fclose(fpo);\n if(frameBuf)\n _aligned_free(frameBuf);\n\n for(i = 0; i < ASIZE(codec.m_frames); i++)\n {\n if(codec.m_frames[i])\n _aligned_free((codec.m_frames[i]));\n }\n\n return ret;\n}\n\n<|endoftext|>"} {"text":"<commit_before>#include \"pstream.hh\"\n\n#include <string.h>\n\nstatic void\nstreamnum (print_stream *s, unsigned long long num,\n bool neg = false, unsigned base = 10, int width = 0, char pad = 0,\n bool alt = false)\n{\n char buf[68], *x = buf + sizeof(buf);\n\n if (num == 0)\n *--x = '0';\n else {\n for (; num; num \/= base)\n *--x = \"0123456789abcdef\"[num % base];\n if (alt) {\n if (base == 16 && pad != '0') {\n *--x = 'x';\n *--x = '0';\n } else if (base == 8) {\n *--x = '0';\n }\n }\n if (neg)\n *--x = '-';\n }\n\n size_t len = buf + sizeof(buf) - x;\n\n if (alt && base == 16 && pad == '0') {\n \/\/ Special case. Otherwise, this would print like 0000x1\n to_stream(s, \"0x\");\n if (width >= 2)\n width -= 2;\n }\n\n for (; width > len; width--)\n to_stream(s, pad);\n to_stream(s, sbuf(x, len));\n for (; width < 0; width++)\n to_stream(s, pad);\n}\n\n#define INT_TO_STREAM(typ) \\\n void to_stream(print_stream *s, unsigned typ v) \\\n { \\\n streamnum(s, v); \\\n } \\\n \\\n void to_stream(print_stream *s, typ v) \\\n { \\\n if (v < 0) \\\n streamnum(s, -v, true); \\\n else \\\n streamnum(s, v, false); \\\n } \\\n static_assert(true, \"need a semicolon\")\n\nINT_TO_STREAM(int);\nINT_TO_STREAM(long);\nINT_TO_STREAM(long long);\n\nvoid to_stream(print_stream *s, const char *str)\n{\n to_stream(s, sbuf(str, strlen(str)));\n}\n\nvoid to_stream(print_stream *s, void *ptr)\n{\n to_stream(s, sbuf(\"0x\", 2));\n streamnum(s, (unsigned long long)ptr, false, 16);\n}\n\nvoid to_stream(print_stream *s, const integer_formatter &n)\n{\n streamnum(s, n.val_, n.neg_, n.base_, n.width_, n.pad_, n.alt_);\n}\n\nvoid to_stream(print_stream *s, const sflags &f)\n{\n unsigned long long rem = f.val_;\n bool first = true;\n for (auto &flag : f.flags_) {\n if ((f.val_ & flag.mask_) == flag.test_) {\n if (!first)\n to_stream(s, '|');\n to_stream(s, flag.name_);\n rem &= ~flag.mask_;\n first = false;\n }\n }\n if (rem) {\n if (!first)\n to_stream(s, '|');\n to_stream(s, shex(rem));\n }\n}\n\nvoid to_stream(print_stream *s, const senum &f)\n{\n unsigned long long cur = ~0;\n for (auto &value : f.values_) {\n if (value.next_)\n cur++;\n else\n cur = value.value_;\n if (f.val_ == cur) {\n to_stream(s, value.name_);\n return;\n }\n }\n to_stream(s, f.val_);\n}\n\nvoid to_stream(print_stream *s, const shexdump &f)\n{\n \/\/ Compute common prefix of all addresses\n uintptr_t addr = f.start_;\n uintptr_t end_addr = f.start_ + f.len_;\n int common = 0;\n while (addr != end_addr) {\n common += 8;\n addr >>= 8;\n end_addr >>= 8;\n }\n\n \/\/ Print the prefix just once (otherwise 64-bit addresses cause\n \/\/ lines to exceed 80 columns)\n if (addr)\n s->print(shex(addr << common), \"+\\n\");\n\n \/\/ Compute width of distinct suffix\n uintptr_t mask = (1ull << common) - 1;\n int width = common \/ 4;\n\n \/\/ Round down starting address\n addr = f.start_ & ~15;\n const uint8_t *p = (const uint8_t*)f.base_ - (f.start_ - addr);\n\n \/\/ Round up ending address\n end_addr = ((f.start_ + f.len_) | 15) + 1;\n\n \/\/ Hex dump\n char ascii[16];\n for (; addr < end_addr; addr++, p++) {\n if (addr % 16 == 0)\n s->print(sfmt(addr & mask).base(16).width(width).pad(), \": \");\n\n if (addr < f.start_ || addr >= f.start_ + f.len_) {\n to_stream(s, \" \");\n ascii[addr % 16] = ' ';\n } else {\n to_stream(s, sfmt(*p).base(16).width(2).pad());\n if (*p < ' ' || *p > '~')\n ascii[addr % 16] = '.';\n else\n ascii[addr % 16] = *p;\n }\n\n if (addr % 16 == 15)\n s->print(\" \", sbuf(ascii, sizeof ascii), '\\n');\n else if (addr % 16 == 7)\n to_stream(s, \" \");\n else\n to_stream(s, ' ');\n }\n}\n<commit_msg>pstream: Compute hexdump prefix in nibbles rather than bytes<commit_after>#include \"pstream.hh\"\n\n#include <string.h>\n\nstatic void\nstreamnum (print_stream *s, unsigned long long num,\n bool neg = false, unsigned base = 10, int width = 0, char pad = 0,\n bool alt = false)\n{\n char buf[68], *x = buf + sizeof(buf);\n\n if (num == 0)\n *--x = '0';\n else {\n for (; num; num \/= base)\n *--x = \"0123456789abcdef\"[num % base];\n if (alt) {\n if (base == 16 && pad != '0') {\n *--x = 'x';\n *--x = '0';\n } else if (base == 8) {\n *--x = '0';\n }\n }\n if (neg)\n *--x = '-';\n }\n\n size_t len = buf + sizeof(buf) - x;\n\n if (alt && base == 16 && pad == '0') {\n \/\/ Special case. Otherwise, this would print like 0000x1\n to_stream(s, \"0x\");\n if (width >= 2)\n width -= 2;\n }\n\n for (; width > len; width--)\n to_stream(s, pad);\n to_stream(s, sbuf(x, len));\n for (; width < 0; width++)\n to_stream(s, pad);\n}\n\n#define INT_TO_STREAM(typ) \\\n void to_stream(print_stream *s, unsigned typ v) \\\n { \\\n streamnum(s, v); \\\n } \\\n \\\n void to_stream(print_stream *s, typ v) \\\n { \\\n if (v < 0) \\\n streamnum(s, -v, true); \\\n else \\\n streamnum(s, v, false); \\\n } \\\n static_assert(true, \"need a semicolon\")\n\nINT_TO_STREAM(int);\nINT_TO_STREAM(long);\nINT_TO_STREAM(long long);\n\nvoid to_stream(print_stream *s, const char *str)\n{\n to_stream(s, sbuf(str, strlen(str)));\n}\n\nvoid to_stream(print_stream *s, void *ptr)\n{\n to_stream(s, sbuf(\"0x\", 2));\n streamnum(s, (unsigned long long)ptr, false, 16);\n}\n\nvoid to_stream(print_stream *s, const integer_formatter &n)\n{\n streamnum(s, n.val_, n.neg_, n.base_, n.width_, n.pad_, n.alt_);\n}\n\nvoid to_stream(print_stream *s, const sflags &f)\n{\n unsigned long long rem = f.val_;\n bool first = true;\n for (auto &flag : f.flags_) {\n if ((f.val_ & flag.mask_) == flag.test_) {\n if (!first)\n to_stream(s, '|');\n to_stream(s, flag.name_);\n rem &= ~flag.mask_;\n first = false;\n }\n }\n if (rem) {\n if (!first)\n to_stream(s, '|');\n to_stream(s, shex(rem));\n }\n}\n\nvoid to_stream(print_stream *s, const senum &f)\n{\n unsigned long long cur = ~0;\n for (auto &value : f.values_) {\n if (value.next_)\n cur++;\n else\n cur = value.value_;\n if (f.val_ == cur) {\n to_stream(s, value.name_);\n return;\n }\n }\n to_stream(s, f.val_);\n}\n\nvoid to_stream(print_stream *s, const shexdump &f)\n{\n \/\/ Compute common prefix of all addresses\n uintptr_t addr = f.start_;\n uintptr_t end_addr = f.start_ + f.len_;\n int common = 0;\n while (addr != end_addr) {\n common += 4;\n addr >>= 4;\n end_addr >>= 4;\n }\n\n \/\/ Print the prefix just once (otherwise 64-bit addresses cause\n \/\/ lines to exceed 80 columns)\n if (addr)\n s->print(shex(addr << common), \"+\\n\");\n\n \/\/ Compute width of distinct suffix\n uintptr_t mask = (1ull << common) - 1;\n int width = common \/ 4;\n\n \/\/ Round down starting address\n addr = f.start_ & ~15;\n const uint8_t *p = (const uint8_t*)f.base_ - (f.start_ - addr);\n\n \/\/ Round up ending address\n end_addr = ((f.start_ + f.len_) | 15) + 1;\n\n \/\/ Hex dump\n char ascii[16];\n for (; addr < end_addr; addr++, p++) {\n if (addr % 16 == 0)\n s->print(sfmt(addr & mask).base(16).width(width).pad(), \": \");\n\n if (addr < f.start_ || addr >= f.start_ + f.len_) {\n to_stream(s, \" \");\n ascii[addr % 16] = ' ';\n } else {\n to_stream(s, sfmt(*p).base(16).width(2).pad());\n if (*p < ' ' || *p > '~')\n ascii[addr % 16] = '.';\n else\n ascii[addr % 16] = *p;\n }\n\n if (addr % 16 == 15)\n s->print(\" \", sbuf(ascii, sizeof ascii), '\\n');\n else if (addr % 16 == 7)\n to_stream(s, \" \");\n else\n to_stream(s, ' ');\n }\n}\n<|endoftext|>"} {"text":"<commit_before>#include \"swrd.hpp\"\n#include \"..\/parser\/swrdParser.hpp\"\n#include <fstream>\n#include \"flex.hpp\"\n\nnamespace wrd {\n\n WRD_DEF_ME(sinterpreter)\n\n tstr<sobj> me::interp(const wchar* script) {\n YY_BUFFER_STATE buffer = yy_scan_string(script);\n tstr<sobj> ret = _runParser();\n yy_delete_buffer(buffer);\n return ret;\n }\n tstr<sobj> me::interp(const std::string& script) {\n return interp(script.c_str());\n }\n tstr<sobj> me::interpFile(const wchar* path) {\n yyin = fopen(path, \"r\");\n if(!yyin)\n return WRD_E(\"invalid file path %s.\", path), tstr<sobj>();\n\n std::string fileName = _extractFileName(path);\n WRD_I(\"interpreting file '%s'...\", fileName.c_str());\n\n tstr<sobj> ret = _runParser();\n\n ret->setName(fileName);\n fclose(yyin);\n WRD_I(\"%s swrd file interpreted.\", fileName.c_str());\n return ret;\n }\n tstr<sobj> me::interpFile(const std::string& path) {\n return interpFile(path.c_str());\n }\n\n tstr<sobj> me::_runParser() {\n int res = yyparse();\n if(res)\n return WRD_E(\"interpretion has been failed. res=%d\", res), tstr<sobj>();\n if(!root)\n WRD_E(\"nothing interpreted.\");\n\n return tstr<sobj>(root);\n }\n\n std::string me::_extractFileName(const std::string& path) {\n size_t atSlash = path.find_last_of(\"\\\\\/\");\n if(atSlash < 0) return \"\";\n\n return path.substr(atSlash + 1);\n }\n}\n<commit_msg>swrd: fix: couldn't interpreter file after reading a buffer<commit_after>#include \"swrd.hpp\"\n#include \"..\/parser\/swrdParser.hpp\"\n#include <fstream>\n#include \"flex.hpp\"\n\nvoid yyrestart(FILE*);\n\nnamespace wrd {\n\n WRD_DEF_ME(sinterpreter)\n\n tstr<sobj> me::interp(const wchar* script) {\n YY_BUFFER_STATE buffer = yy_scan_string(script);\n tstr<sobj> ret = _runParser();\n yy_delete_buffer(buffer);\n return ret;\n }\n tstr<sobj> me::interp(const std::string& script) {\n return interp(script.c_str());\n }\n tstr<sobj> me::interpFile(const wchar* path) {\n yyin = fopen(path, \"r\");\n yyrestart(yyin);\n if(!yyin)\n return WRD_E(\"invalid file path %s.\", path), tstr<sobj>();\n\n std::string fileName = _extractFileName(path);\n WRD_I(\"interpreting file '%s'...\", fileName.c_str());\n\n tstr<sobj> ret = _runParser();\n\n ret->setName(fileName);\n fclose(yyin);\n WRD_I(\"%s swrd file interpreted.\", fileName.c_str());\n return ret;\n }\n tstr<sobj> me::interpFile(const std::string& path) {\n return interpFile(path.c_str());\n }\n\n tstr<sobj> me::_runParser() {\n int res = yyparse();\n if(res)\n return WRD_E(\"interpretion has been failed. res=%d\", res), tstr<sobj>();\n if(!root)\n WRD_E(\"nothing interpreted.\");\n\n return tstr<sobj>(root);\n }\n\n std::string me::_extractFileName(const std::string& path) {\n size_t atSlash = path.find_last_of(\"\\\\\/\");\n if(atSlash < 0) return \"\";\n\n return path.substr(atSlash + 1);\n }\n}\n<|endoftext|>"} {"text":"<commit_before>\/*\n * Copyright (C) 2006, 2007 Apple Inc. All rights reserved.\n *\n * Redistribution and use in source and binary forms, with or without\n * modification, are permitted provided that the following conditions\n * are met:\n * 1. Redistributions of source code must retain the above copyright\n * notice, this list of conditions and the following disclaimer.\n * 2. Redistributions in binary form must reproduce the above copyright\n * notice, this list of conditions and the following disclaimer in the\n * documentation and\/or other materials provided with the distribution.\n *\n * THIS SOFTWARE IS PROVIDED BY APPLE COMPUTER, INC. ``AS IS'' AND ANY\n * EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE\n * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR\n * PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL APPLE COMPUTER, INC. OR\n * CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,\n * EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,\n * PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR\n * PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY\n * OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT\n * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE\n * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. \n *\/\n\n#include \"config.h\"\n#include \"FocusController.h\"\n\n#include \"AXObjectCache.h\"\n#include \"Chrome.h\"\n#include \"Document.h\"\n#include \"Editor.h\"\n#include \"EditorClient.h\"\n#include \"Element.h\"\n#include \"Event.h\"\n#include \"EventHandler.h\"\n#include \"EventNames.h\"\n#include \"Frame.h\"\n#include \"FrameView.h\"\n#include \"FrameTree.h\"\n#include \"HTMLFrameOwnerElement.h\"\n#include \"HTMLNames.h\"\n#include \"KeyboardEvent.h\"\n#include \"Page.h\"\n#include \"Range.h\"\n#include \"RenderObject.h\"\n#include \"RenderWidget.h\"\n#include \"SelectionController.h\"\n#include \"Widget.h\"\n#include <wtf\/Platform.h>\n\nnamespace WebCore {\n\nusing namespace EventNames;\nusing namespace HTMLNames;\n\nFocusController::FocusController(Page* page)\n : m_page(page)\n , m_isActive(false)\n{\n}\n\nvoid FocusController::setFocusedFrame(PassRefPtr<Frame> frame)\n{\n if (m_focusedFrame == frame)\n return;\n\n if (m_focusedFrame && m_focusedFrame->view())\n m_focusedFrame->selection()->setFocused(false);\n\n m_focusedFrame = frame;\n\n if (m_focusedFrame m_focusedFrame->view())\n m_focusedFrame->selection()->setFocused(true);\n}\n\nFrame* FocusController::focusedOrMainFrame()\n{\n if (Frame* frame = focusedFrame())\n return frame;\n return m_page->mainFrame();\n}\n\nstatic Node* deepFocusableNode(FocusDirection direction, Node* node, KeyboardEvent* event)\n{\n \/\/ The node we found might be a HTMLFrameOwnerElement, so descend down the frame tree until we find either:\n \/\/ 1) a focusable node, or\n \/\/ 2) the deepest-nested HTMLFrameOwnerElement\n while (node && node->isFrameOwnerElement()) {\n HTMLFrameOwnerElement* owner = static_cast<HTMLFrameOwnerElement*>(node);\n if (!owner->contentFrame())\n break;\n\n Document* document = owner->contentFrame()->document();\n if (!document)\n break;\n\n node = (direction == FocusDirectionForward)\n ? document->nextFocusableNode(0, event)\n : document->previousFocusableNode(0, event);\n if (!node) {\n node = owner;\n break;\n }\n }\n\n return node;\n}\n\nbool FocusController::setInitialFocus(FocusDirection direction, KeyboardEvent* event)\n{\n return advanceFocus(direction, event, true);\n}\n\nbool FocusController::advanceFocus(FocusDirection direction, KeyboardEvent* event, bool initialFocus)\n{\n Frame* frame = focusedOrMainFrame();\n ASSERT(frame);\n Document* document = frame->document();\n if (!document)\n return false;\n\n Node* node = (direction == FocusDirectionForward)\n ? document->nextFocusableNode(document->focusedNode(), event)\n : document->previousFocusableNode(document->focusedNode(), event);\n \n \/\/ If there's no focusable node to advance to, move up the frame tree until we find one.\n while (!node && frame) {\n Frame* parentFrame = frame->tree()->parent();\n if (!parentFrame)\n break;\n\n Document* parentDocument = parentFrame->document();\n if (!parentDocument)\n break;\n\n HTMLFrameOwnerElement* owner = frame->ownerElement();\n if (!owner)\n break;\n\n node = (direction == FocusDirectionForward)\n ? parentDocument->nextFocusableNode(owner, event)\n : parentDocument->previousFocusableNode(owner, event);\n\n frame = parentFrame;\n }\n\n node = deepFocusableNode(direction, node, event);\n\n if (!node) {\n \/\/ We didn't find a node to focus, so we should try to pass focus to Chrome.\n if (!initialFocus && m_page->chrome()->canTakeFocus(direction)) {\n document->setFocusedNode(0);\n setFocusedFrame(0);\n m_page->chrome()->takeFocus(direction);\n return true;\n }\n\n \/\/ Chrome doesn't want focus, so we should wrap focus.\n if (Document* d = m_page->mainFrame()->document())\n node = (direction == FocusDirectionForward)\n ? d->nextFocusableNode(0, event)\n : d->previousFocusableNode(0, event);\n\n node = deepFocusableNode(direction, node, event);\n\n if (!node)\n return false;\n }\n\n ASSERT(node);\n\n if (node == document->focusedNode())\n \/\/ Focus wrapped around to the same node.\n return true;\n\n if (!node->isElementNode())\n \/\/ FIXME: May need a way to focus a document here.\n return false;\n\n if (node->isFrameOwnerElement()) {\n \/\/ We focus frames rather than frame owners.\n \/\/ FIXME: We should not focus frames that have no scrollbars, as focusing them isn't useful to the user.\n HTMLFrameOwnerElement* owner = static_cast<HTMLFrameOwnerElement*>(node);\n if (!owner->contentFrame())\n return false;\n\n document->setFocusedNode(0);\n setFocusedFrame(owner->contentFrame());\n return true;\n }\n \n \/\/ FIXME: It would be nice to just be able to call setFocusedNode(node) here, but we can't do\n \/\/ that because some elements (e.g. HTMLInputElement and HTMLTextAreaElement) do extra work in\n \/\/ their focus() methods.\n\n Document* newDocument = node->document();\n\n if (newDocument != document)\n \/\/ Focus is going away from this document, so clear the focused node.\n document->setFocusedNode(0);\n\n if (newDocument)\n setFocusedFrame(newDocument->frame());\n\n static_cast<Element*>(node)->focus(false);\n return true;\n}\n\nstatic bool relinquishesEditingFocus(Node *node)\n{\n ASSERT(node);\n ASSERT(node->isContentEditable());\n\n Node* root = node->rootEditableElement();\n Frame* frame = node->document()->frame();\n if (!frame || !root)\n return false;\n\n return frame->editor()->shouldEndEditing(rangeOfContents(root).get());\n}\n\nstatic void clearSelectionIfNeeded(Frame* oldFocusedFrame, Frame* newFocusedFrame, Node* newFocusedNode)\n{\n if (!oldFocusedFrame || !newFocusedFrame)\n return;\n \n if (oldFocusedFrame->document() != newFocusedFrame->document())\n return;\n \n SelectionController* s = oldFocusedFrame->selection();\n if (s->isNone())\n return;\n \n Node* selectionStartNode = s->selection().start().node();\n if (selectionStartNode == newFocusedNode || selectionStartNode->isDescendantOf(newFocusedNode) || selectionStartNode->shadowAncestorNode() == newFocusedNode)\n return;\n \n if (Node* mousePressNode = newFocusedFrame->eventHandler()->mousePressNode())\n if (mousePressNode->renderer() && !mousePressNode->canStartSelection())\n if (Node* root = s->rootEditableElement())\n if (Node* shadowAncestorNode = root->shadowAncestorNode())\n \/\/ Don't do this for textareas and text fields, when they lose focus their selections should be cleared\n \/\/ and then restored when they regain focus, to match other browsers.\n if (!shadowAncestorNode->hasTagName(inputTag) && !shadowAncestorNode->hasTagName(textareaTag))\n return;\n \n s->clear();\n}\n\nbool FocusController::setFocusedNode(Node* node, PassRefPtr<Frame> newFocusedFrame)\n{\n RefPtr<Frame> oldFocusedFrame = focusedFrame();\n RefPtr<Document> oldDocument = oldFocusedFrame ? oldFocusedFrame->document() : 0;\n \n Node* oldFocusedNode = oldDocument ? oldDocument->focusedNode() : 0;\n if (oldFocusedNode == node)\n return true;\n \n if (oldFocusedNode && oldFocusedNode->rootEditableElement() == oldFocusedNode && !relinquishesEditingFocus(oldFocusedNode))\n return false;\n \n clearSelectionIfNeeded(oldFocusedFrame.get(), newFocusedFrame.get(), node);\n \n if (!node) {\n if (oldDocument)\n oldDocument->setFocusedNode(0);\n m_page->editorClient()->setInputMethodState(false);\n return true;\n }\n \n RefPtr<Document> newDocument = node ? node->document() : 0;\n \n if (newDocument && newDocument->focusedNode() == node) {\n m_page->editorClient()->setInputMethodState(node->shouldUseInputMethod());\n return true;\n }\n \n if (oldDocument && oldDocument != newDocument)\n oldDocument->setFocusedNode(0);\n \n setFocusedFrame(newFocusedFrame);\n \n if (newDocument)\n newDocument->setFocusedNode(node);\n \n m_page->editorClient()->setInputMethodState(node->shouldUseInputMethod());\n\n return true;\n}\n\nvoid FocusController::setActive(bool active)\n{\n if (m_isActive == active)\n return;\n\n m_isActive = active;\n\n \/\/ FIXME: It would be nice to make Mac use this implementation someday.\n \/\/ Right now Mac calls updateControlTints from within WebKit, and moving\n \/\/ the call to here is not simple.\n#if !PLATFORM(MAC) && !PLATFORM(WX)\n if (FrameView* view = m_page->mainFrame()->view()) {\n view->layoutIfNeededRecursive();\n view->updateControlTints();\n }\n#endif\n\n focusedOrMainFrame()->selection()->pageActivationChanged();\n}\n\n} \/\/ namespace WebCore\n<commit_msg><commit_after>\/*\n * Copyright (C) 2006, 2007 Apple Inc. All rights reserved.\n *\n * Redistribution and use in source and binary forms, with or without\n * modification, are permitted provided that the following conditions\n * are met:\n * 1. Redistributions of source code must retain the above copyright\n * notice, this list of conditions and the following disclaimer.\n * 2. Redistributions in binary form must reproduce the above copyright\n * notice, this list of conditions and the following disclaimer in the\n * documentation and\/or other materials provided with the distribution.\n *\n * THIS SOFTWARE IS PROVIDED BY APPLE COMPUTER, INC. ``AS IS'' AND ANY\n * EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE\n * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR\n * PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL APPLE COMPUTER, INC. OR\n * CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,\n * EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,\n * PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR\n * PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY\n * OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT\n * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE\n * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. \n *\/\n\n#include \"config.h\"\n#include \"FocusController.h\"\n\n#include \"AXObjectCache.h\"\n#include \"Chrome.h\"\n#include \"Document.h\"\n#include \"Editor.h\"\n#include \"EditorClient.h\"\n#include \"Element.h\"\n#include \"Event.h\"\n#include \"EventHandler.h\"\n#include \"EventNames.h\"\n#include \"Frame.h\"\n#include \"FrameView.h\"\n#include \"FrameTree.h\"\n#include \"HTMLFrameOwnerElement.h\"\n#include \"HTMLNames.h\"\n#include \"KeyboardEvent.h\"\n#include \"Page.h\"\n#include \"Range.h\"\n#include \"RenderObject.h\"\n#include \"RenderWidget.h\"\n#include \"SelectionController.h\"\n#include \"Widget.h\"\n#include <wtf\/Platform.h>\n\nnamespace WebCore {\n\nusing namespace EventNames;\nusing namespace HTMLNames;\n\nFocusController::FocusController(Page* page)\n : m_page(page)\n , m_isActive(false)\n{\n}\n\nvoid FocusController::setFocusedFrame(PassRefPtr<Frame> frame)\n{\n if (m_focusedFrame == frame)\n return;\n\n if (m_focusedFrame && m_focusedFrame->view())\n m_focusedFrame->selection()->setFocused(false);\n\n m_focusedFrame = frame;\n\n if (m_focusedFrame && m_focusedFrame->view())\n m_focusedFrame->selection()->setFocused(true);\n}\n\nFrame* FocusController::focusedOrMainFrame()\n{\n if (Frame* frame = focusedFrame())\n return frame;\n return m_page->mainFrame();\n}\n\nstatic Node* deepFocusableNode(FocusDirection direction, Node* node, KeyboardEvent* event)\n{\n \/\/ The node we found might be a HTMLFrameOwnerElement, so descend down the frame tree until we find either:\n \/\/ 1) a focusable node, or\n \/\/ 2) the deepest-nested HTMLFrameOwnerElement\n while (node && node->isFrameOwnerElement()) {\n HTMLFrameOwnerElement* owner = static_cast<HTMLFrameOwnerElement*>(node);\n if (!owner->contentFrame())\n break;\n\n Document* document = owner->contentFrame()->document();\n if (!document)\n break;\n\n node = (direction == FocusDirectionForward)\n ? document->nextFocusableNode(0, event)\n : document->previousFocusableNode(0, event);\n if (!node) {\n node = owner;\n break;\n }\n }\n\n return node;\n}\n\nbool FocusController::setInitialFocus(FocusDirection direction, KeyboardEvent* event)\n{\n return advanceFocus(direction, event, true);\n}\n\nbool FocusController::advanceFocus(FocusDirection direction, KeyboardEvent* event, bool initialFocus)\n{\n Frame* frame = focusedOrMainFrame();\n ASSERT(frame);\n Document* document = frame->document();\n if (!document)\n return false;\n\n Node* node = (direction == FocusDirectionForward)\n ? document->nextFocusableNode(document->focusedNode(), event)\n : document->previousFocusableNode(document->focusedNode(), event);\n \n \/\/ If there's no focusable node to advance to, move up the frame tree until we find one.\n while (!node && frame) {\n Frame* parentFrame = frame->tree()->parent();\n if (!parentFrame)\n break;\n\n Document* parentDocument = parentFrame->document();\n if (!parentDocument)\n break;\n\n HTMLFrameOwnerElement* owner = frame->ownerElement();\n if (!owner)\n break;\n\n node = (direction == FocusDirectionForward)\n ? parentDocument->nextFocusableNode(owner, event)\n : parentDocument->previousFocusableNode(owner, event);\n\n frame = parentFrame;\n }\n\n node = deepFocusableNode(direction, node, event);\n\n if (!node) {\n \/\/ We didn't find a node to focus, so we should try to pass focus to Chrome.\n if (!initialFocus && m_page->chrome()->canTakeFocus(direction)) {\n document->setFocusedNode(0);\n setFocusedFrame(0);\n m_page->chrome()->takeFocus(direction);\n return true;\n }\n\n \/\/ Chrome doesn't want focus, so we should wrap focus.\n if (Document* d = m_page->mainFrame()->document())\n node = (direction == FocusDirectionForward)\n ? d->nextFocusableNode(0, event)\n : d->previousFocusableNode(0, event);\n\n node = deepFocusableNode(direction, node, event);\n\n if (!node)\n return false;\n }\n\n ASSERT(node);\n\n if (node == document->focusedNode())\n \/\/ Focus wrapped around to the same node.\n return true;\n\n if (!node->isElementNode())\n \/\/ FIXME: May need a way to focus a document here.\n return false;\n\n if (node->isFrameOwnerElement()) {\n \/\/ We focus frames rather than frame owners.\n \/\/ FIXME: We should not focus frames that have no scrollbars, as focusing them isn't useful to the user.\n HTMLFrameOwnerElement* owner = static_cast<HTMLFrameOwnerElement*>(node);\n if (!owner->contentFrame())\n return false;\n\n document->setFocusedNode(0);\n setFocusedFrame(owner->contentFrame());\n return true;\n }\n \n \/\/ FIXME: It would be nice to just be able to call setFocusedNode(node) here, but we can't do\n \/\/ that because some elements (e.g. HTMLInputElement and HTMLTextAreaElement) do extra work in\n \/\/ their focus() methods.\n\n Document* newDocument = node->document();\n\n if (newDocument != document)\n \/\/ Focus is going away from this document, so clear the focused node.\n document->setFocusedNode(0);\n\n if (newDocument)\n setFocusedFrame(newDocument->frame());\n\n static_cast<Element*>(node)->focus(false);\n return true;\n}\n\nstatic bool relinquishesEditingFocus(Node *node)\n{\n ASSERT(node);\n ASSERT(node->isContentEditable());\n\n Node* root = node->rootEditableElement();\n Frame* frame = node->document()->frame();\n if (!frame || !root)\n return false;\n\n return frame->editor()->shouldEndEditing(rangeOfContents(root).get());\n}\n\nstatic void clearSelectionIfNeeded(Frame* oldFocusedFrame, Frame* newFocusedFrame, Node* newFocusedNode)\n{\n if (!oldFocusedFrame || !newFocusedFrame)\n return;\n \n if (oldFocusedFrame->document() != newFocusedFrame->document())\n return;\n \n SelectionController* s = oldFocusedFrame->selection();\n if (s->isNone())\n return;\n \n Node* selectionStartNode = s->selection().start().node();\n if (selectionStartNode == newFocusedNode || selectionStartNode->isDescendantOf(newFocusedNode) || selectionStartNode->shadowAncestorNode() == newFocusedNode)\n return;\n \n if (Node* mousePressNode = newFocusedFrame->eventHandler()->mousePressNode())\n if (mousePressNode->renderer() && !mousePressNode->canStartSelection())\n if (Node* root = s->rootEditableElement())\n if (Node* shadowAncestorNode = root->shadowAncestorNode())\n \/\/ Don't do this for textareas and text fields, when they lose focus their selections should be cleared\n \/\/ and then restored when they regain focus, to match other browsers.\n if (!shadowAncestorNode->hasTagName(inputTag) && !shadowAncestorNode->hasTagName(textareaTag))\n return;\n \n s->clear();\n}\n\nbool FocusController::setFocusedNode(Node* node, PassRefPtr<Frame> newFocusedFrame)\n{\n RefPtr<Frame> oldFocusedFrame = focusedFrame();\n RefPtr<Document> oldDocument = oldFocusedFrame ? oldFocusedFrame->document() : 0;\n \n Node* oldFocusedNode = oldDocument ? oldDocument->focusedNode() : 0;\n if (oldFocusedNode == node)\n return true;\n \n if (oldFocusedNode && oldFocusedNode->rootEditableElement() == oldFocusedNode && !relinquishesEditingFocus(oldFocusedNode))\n return false;\n \n clearSelectionIfNeeded(oldFocusedFrame.get(), newFocusedFrame.get(), node);\n \n if (!node) {\n if (oldDocument)\n oldDocument->setFocusedNode(0);\n m_page->editorClient()->setInputMethodState(false);\n return true;\n }\n \n RefPtr<Document> newDocument = node ? node->document() : 0;\n \n if (newDocument && newDocument->focusedNode() == node) {\n m_page->editorClient()->setInputMethodState(node->shouldUseInputMethod());\n return true;\n }\n \n if (oldDocument && oldDocument != newDocument)\n oldDocument->setFocusedNode(0);\n \n setFocusedFrame(newFocusedFrame);\n \n if (newDocument)\n newDocument->setFocusedNode(node);\n \n m_page->editorClient()->setInputMethodState(node->shouldUseInputMethod());\n\n return true;\n}\n\nvoid FocusController::setActive(bool active)\n{\n if (m_isActive == active)\n return;\n\n m_isActive = active;\n\n \/\/ FIXME: It would be nice to make Mac use this implementation someday.\n \/\/ Right now Mac calls updateControlTints from within WebKit, and moving\n \/\/ the call to here is not simple.\n#if !PLATFORM(MAC) && !PLATFORM(WX)\n if (FrameView* view = m_page->mainFrame()->view()) {\n view->layoutIfNeededRecursive();\n view->updateControlTints();\n }\n#endif\n\n focusedOrMainFrame()->selection()->pageActivationChanged();\n}\n\n} \/\/ namespace WebCore\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.6 $\n *\n * last change: $Author: rt $ $Date: 2008-03-12 11:42:56 $\n *\n * The Contents of this file are made available subject to\n * the terms of GNU Lesser General Public License Version 2.1.\n *\n *\n * GNU Lesser General Public License Version 2.1\n * =============================================\n * Copyright 2005 by Sun Microsystems, Inc.\n * 901 San Antonio Road, Palo Alto, CA 94303, USA\n *\n * This library is free software; you can redistribute it and\/or\n * modify it under the terms of the GNU Lesser General Public\n * License version 2.1, as published by the Free Software Foundation.\n *\n * This library is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU\n * Lesser General Public License for more details.\n *\n * You should have received a copy of the GNU Lesser General Public\n * License along with this library; if not, write to the Free Software\n * Foundation, Inc., 59 Temple Place, Suite 330, Boston,\n * MA 02111-1307 USA\n *\n ************************************************************************\/\n\n#ifndef SD_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 <boost\/scoped_ptr.hpp>\n#include <boost\/shared_ptr.hpp>\n#include <boost\/enable_shared_from_this.hpp>\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 : public ::boost::enable_shared_from_this<ToolBarManager>\n{\npublic:\n \/** Use this method instead of the constructor to create new objects of\n this class.\n *\/\n static ::boost::shared_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 const static ::rtl::OUString msTableObjectBar; \/\/ RID_DRAW_TABLE_TOOLBOX\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(const ::boost::shared_ptr<ToolBarManager>& rpManager)\n : mpManager(rpManager) { mpManager->LockUpdate(); }\n ~UpdateLock(void) { mpManager->UnlockUpdate(); }\n private:\n ::boost::shared_ptr<ToolBarManager> mpManager;\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 ::boost::scoped_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 presenterview (1.4.20); FILE MERGED 2008\/03\/26 10:45:36 cl 1.4.20.3: RESYNC: (1.5-1.6); FILE MERGED 2007\/07\/11 09:05:56 af 1.4.20.2: RESYNC: (1.4-1.5); FILE MERGED 2007\/07\/10 14:27:27 af 1.4.20.1: #i18486# Converted several members of ViewShellBase to shared_ptrs.<commit_after>\/*************************************************************************\n *\n * OpenOffice.org - a multi-platform office productivity suite\n *\n * $RCSfile: ToolBarManager.hxx,v $\n *\n * $Revision: 1.7 $\n *\n * last change: $Author: kz $ $Date: 2008-04-03 13:58: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 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 <boost\/scoped_ptr.hpp>\n#include <boost\/shared_ptr.hpp>\n#include <boost\/enable_shared_from_this.hpp>\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 : public ::boost::enable_shared_from_this<ToolBarManager>\n{\npublic:\n \/** Use this method instead of the constructor to create new objects of\n this class.\n *\/\n static ::boost::shared_ptr<ToolBarManager> Create (\n ViewShellBase& rBase,\n const ::boost::shared_ptr<tools::EventMultiplexer>& rpMultiplexer,\n const ::boost::shared_ptr<ViewShellManager>& rpViewShellManager);\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 const static ::rtl::OUString msTableObjectBar; \/\/ RID_DRAW_TABLE_TOOLBOX\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(const ::boost::shared_ptr<ToolBarManager>& rpManager)\n : mpManager(rpManager) { mpManager->LockUpdate(); }\n ~UpdateLock(void) { mpManager->UnlockUpdate(); }\n private:\n ::boost::shared_ptr<ToolBarManager> mpManager;\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 ::boost::scoped_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\n This file is part of the GLC-lib library.\n Copyright (C) 2005-2008 Laurent Ribon (laumaya@users.sourceforge.net)\n Version 1.0.0, packaged on August, 2008.\n\n http:\/\/glc-lib.sourceforge.net\n\n GLC-lib is free software; you can redistribute it and\/or modify\n it under the terms of the GNU General Public License as published by\n the Free Software Foundation; either version 2 of the License, or\n (at your option) any later version.\n\n GLC-lib is distributed in the hope that it will be useful,\n but WITHOUT ANY WARRANTY; without even the implied warranty of\n MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the\n GNU General Public License for more details.\n\n You should have received a copy of the GNU General Public License\n along with GLC-lib; if not, write to the Free Software\n Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA\n\n*****************************************************************************\/\n\n\/\/! \\file glc_enum.cpp implementation of usefull utilities\n\n#include \"glc_enum.h\"\n\nGLC_uint glc::GLC_GenID(void)\n{\n\tstatic GLC_uint Id= 0;\n\treturn Id++;\n}\n<commit_msg>Start ID from 1 instead of 0.<commit_after>\/****************************************************************************\n\n This file is part of the GLC-lib library.\n Copyright (C) 2005-2008 Laurent Ribon (laumaya@users.sourceforge.net)\n Version 1.0.0, packaged on August, 2008.\n\n http:\/\/glc-lib.sourceforge.net\n\n GLC-lib is free software; you can redistribute it and\/or modify\n it under the terms of the GNU General Public License as published by\n the Free Software Foundation; either version 2 of the License, or\n (at your option) any later version.\n\n GLC-lib is distributed in the hope that it will be useful,\n but WITHOUT ANY WARRANTY; without even the implied warranty of\n MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the\n GNU General Public License for more details.\n\n You should have received a copy of the GNU General Public License\n along with GLC-lib; if not, write to the Free Software\n Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA\n\n*****************************************************************************\/\n\n\/\/! \\file glc_enum.cpp implementation of usefull utilities\n\n#include \"glc_enum.h\"\n\nGLC_uint glc::GLC_GenID(void)\n{\n\tstatic GLC_uint Id= 1;\n\treturn Id++;\n}\n<|endoftext|>"} {"text":"<commit_before><commit_msg>fdo#46926: fix UNO struct comparison in Python 2<commit_after><|endoftext|>"} {"text":"<commit_before>\/*************************************************************************\n *\n * OpenOffice.org - a multi-platform office productivity suite\n *\n * $RCSfile: TestMenu.cxx,v $\n *\n * $Revision: 1.5 $\n *\n * last change: $Author: obo $ $Date: 2006-09-16 19:15: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_sd.hxx\"\n\n#include \"TestMenu.hxx\"\n\n#include \"taskpane\/TaskPaneControlFactory.hxx\"\n\n#include <vcl\/image.hxx>\n#include <vcl\/svapp.hxx>\n\nnamespace sd { namespace toolpanel {\n\n\/** This factory class is used to create instances of ColorMenu. It can be\n extended so that its constructor stores arguments that later are passed\n to new ColorMenu objects.\n*\/\nclass ColorMenuFactory\n : public ControlFactory\n{\nprotected:\n virtual TreeNode* InternalCreateControl (TreeNode* pTreeNode)\n {\n return new ColorMenu (pTreeNode);\n }\n};\n\n\nColorMenu::ColorMenu (TreeNode* pParent)\n : Window (pParent->GetWindow()),\n TreeNode(pParent),\n maSet (this),\n mnPreferredColumnCount(2)\n{\n WinBits aStyle =\n WB_ITEMBORDER\n | WB_DOUBLEBORDER\n | WB_NAMEFIELD\n | WB_FLATVALUESET\n | WB_TABSTOP\n | WB_VSCROLL;\n\n maSet.SetStyle (maSet.GetStyle() | aStyle);\n maSet.SetExtraSpacing(2);\n\n Fill ();\n maSet.Show();\n pParent->RequestResize();\n}\n\n\n\n\nColorMenu::~ColorMenu (void)\n{\n}\n\n\n\n\n::std::auto_ptr<ControlFactory> ColorMenu::CreateControlFactory (void)\n{\n return ::std::auto_ptr<ControlFactory>(new ColorMenuFactory());\n}\n\n\n\n\n\/** The preferred size depends on the preferred number of columns, the\n number of items, and the size of the items.\n*\/\nSize ColorMenu::GetPreferredSize (void)\n{\n Size aItemSize = maSet.CalcItemSizePixel (Size());\n Size aPreferredWindowSize = maSet.CalcWindowSizePixel (\n aItemSize,\n mnPreferredColumnCount,\n CalculateRowCount (aItemSize, mnPreferredColumnCount));\n return aPreferredWindowSize;\n}\n\n\n\n\nsal_Int32 ColorMenu::GetPreferredWidth (sal_Int32 nHeight)\n{\n sal_Int32 nPreferredWidth = 0;\n if (maSet.GetItemCount() > 0)\n {\n Image aImage = maSet.GetItemImage(maSet.GetItemId(0));\n Size aItemSize = maSet.CalcItemSizePixel (aImage.GetSizePixel());\n if (nHeight>0 && aItemSize.Height()>0)\n {\n int nRowCount = nHeight \/ aItemSize.Height();\n if (nRowCount <= 0)\n nRowCount = 1;\n int nColumnCount = (maSet.GetItemCount() + nRowCount-1)\n \/ nRowCount;\n nPreferredWidth = nColumnCount * aItemSize.Width();\n }\n }\n\n return nPreferredWidth;\n}\n\n\n\n\nsal_Int32 ColorMenu::GetPreferredHeight (sal_Int32 nWidth)\n{\n sal_Int32 nPreferredHeight = 0;\n if (maSet.GetItemCount()>0)\n {\n Image aImage = maSet.GetItemImage(maSet.GetItemId(0));\n Size aItemSize = maSet.CalcItemSizePixel (aImage.GetSizePixel());\n if (nWidth>0 && aItemSize.Width()>0)\n {\n int nColumnCount = nWidth \/ aItemSize.Width();\n if (nColumnCount <= 0)\n nColumnCount = 1;\n else if (nColumnCount > 4)\n nColumnCount = 4;\n int nRowCount = (maSet.GetItemCount() + nColumnCount-1)\n \/ nColumnCount;\n nPreferredHeight = nRowCount * aItemSize.Height();\n }\n }\n return nPreferredHeight;\n}\n\n\n\n\nbool ColorMenu::IsResizable (void)\n{\n return true;\n}\n\n\n\n\n::Window* ColorMenu::GetWindow (void)\n{\n return this;\n}\n\n\n\n\nvoid ColorMenu::Resize (void)\n{\n ::Window::Resize();\n Size aWindowSize = GetOutputSizePixel();\n maSet.SetPosSizePixel (Point(0,0), aWindowSize);\n if (IsVisible() && aWindowSize.Width() > 0)\n {\n \/\/ maSet.SetPosSizePixel (\n \/\/ Point (0,0),\n \/\/ aWindowSize);\n\n \/\/ Calculate the number of rows and columns.\n if (maSet.GetItemCount() > 0)\n {\n Image aImage = maSet.GetItemImage(maSet.GetItemId(0));\n Size aItemSize = maSet.CalcItemSizePixel (\n aImage.GetSizePixel());\n int nColumnCount = aWindowSize.Width() \/ 30;\n if (nColumnCount < 1)\n nColumnCount = 1;\n else if (nColumnCount > 4)\n nColumnCount = 4;\n\n int nRowCount = CalculateRowCount (aItemSize, nColumnCount);\n\n maSet.SetColCount (nColumnCount);\n maSet.SetLineCount (nRowCount);\n }\n }\n\n}\n\n\n\n\nint ColorMenu::CalculateRowCount (const Size& rItemSize, int nColumnCount)\n{\n int nRowCount = 0;\n\n if (maSet.GetItemCount()>0 && nColumnCount>0)\n {\n nRowCount = GetOutputSizePixel().Height() \/ 30;\n if (nRowCount < 1)\n nRowCount = 1;\n }\n\n return nRowCount;\n}\n\n\n\n\nvoid ColorMenu::Fill (void)\n{\n const StyleSettings& rSettings (\n Application::GetSettings().GetStyleSettings());\n maSet.Clear();\n maSet.SetItemWidth (30);\n maSet.SetItemHeight (30);\n int i = 0;\n maSet.InsertItem (++i, rSettings.GetFaceColor());\n maSet.SetItemText (i, String::CreateFromAscii(\"FaceColor\"));\n maSet.InsertItem (++i, rSettings.GetCheckedColor());\n maSet.SetItemText (i, String::CreateFromAscii(\"CheckedColor\"));\n maSet.InsertItem (++i, rSettings.GetLightColor());\n maSet.SetItemText (i, String::CreateFromAscii(\"LightColor\"));\n maSet.InsertItem (++i, rSettings.GetLightBorderColor());\n maSet.SetItemText (i, String::CreateFromAscii(\"LightBorderColor\"));\n maSet.InsertItem (++i, rSettings.GetShadowColor());\n maSet.SetItemText (i, String::CreateFromAscii(\"ShadowColor\"));\n maSet.InsertItem (++i, rSettings.GetDarkShadowColor());\n maSet.SetItemText (i, String::CreateFromAscii(\"DarkShadowColor\"));\n maSet.InsertItem (++i, rSettings.GetButtonTextColor());\n maSet.SetItemText (i, String::CreateFromAscii(\"ButtonTextColor\"));\n maSet.InsertItem (++i, rSettings.GetRadioCheckTextColor());\n maSet.SetItemText (i, String::CreateFromAscii(\"RadioCheckTextColor\"));\n maSet.InsertItem (++i, rSettings.GetGroupTextColor());\n maSet.SetItemText (i, String::CreateFromAscii(\"GroupTextColor\"));\n maSet.InsertItem (++i, rSettings.GetLabelTextColor());\n maSet.SetItemText (i, String::CreateFromAscii(\"LabelTextColor\"));\n maSet.InsertItem (++i, rSettings.GetInfoTextColor());\n maSet.SetItemText (i, String::CreateFromAscii(\"InfoTextColor\"));\n maSet.InsertItem (++i, rSettings.GetWindowColor());\n maSet.SetItemText (i, String::CreateFromAscii(\"WindowColor\"));\n maSet.InsertItem (++i, rSettings.GetWindowTextColor());\n maSet.SetItemText (i, String::CreateFromAscii(\"WindowTextColor\"));\n maSet.InsertItem (++i, rSettings.GetDialogColor());\n maSet.SetItemText (i, String::CreateFromAscii(\"DialogColor\"));\n maSet.InsertItem (++i, rSettings.GetDialogTextColor());\n maSet.SetItemText (i, String::CreateFromAscii(\"DialogTextColor\"));\n maSet.InsertItem (++i, rSettings.GetWorkspaceColor());\n maSet.SetItemText (i, String::CreateFromAscii(\"WorkspaceColor\"));\n maSet.InsertItem (++i, rSettings.GetFieldColor());\n maSet.SetItemText (i, String::CreateFromAscii(\"FieldColor\"));\n maSet.InsertItem (++i, rSettings.GetFieldTextColor());\n maSet.SetItemText (i, String::CreateFromAscii(\"FieldTextColor\"));\n maSet.InsertItem (++i, rSettings.GetActiveColor());\n maSet.SetItemText (i, String::CreateFromAscii(\"ActiveColor\"));\n maSet.InsertItem (++i, rSettings.GetActiveColor2());\n maSet.SetItemText (i, String::CreateFromAscii(\"ActiveColor2\"));\n maSet.InsertItem (++i, rSettings.GetActiveTextColor());\n maSet.SetItemText (i, String::CreateFromAscii(\"ActiveTextColor\"));\n maSet.InsertItem (++i, rSettings.GetActiveBorderColor());\n maSet.SetItemText (i, String::CreateFromAscii(\"ActiveBorderColor\"));\n maSet.InsertItem (++i, rSettings.GetDeactiveColor());\n maSet.SetItemText (i, String::CreateFromAscii(\"DeactiveColor\"));\n maSet.InsertItem (++i, rSettings.GetDeactiveColor2());\n maSet.SetItemText (i, String::CreateFromAscii(\"DeactiveColor2\"));\n maSet.InsertItem (++i, rSettings.GetDeactiveTextColor());\n maSet.SetItemText (i, String::CreateFromAscii(\"DeactiveTextColor\"));\n maSet.InsertItem (++i, rSettings.GetDeactiveBorderColor());\n maSet.SetItemText (i, String::CreateFromAscii(\"DeactiveBorderColor\"));\n maSet.InsertItem (++i, rSettings.GetHighlightColor());\n maSet.SetItemText (i, String::CreateFromAscii(\"HighlightColor\"));\n maSet.InsertItem (++i, rSettings.GetHighlightTextColor());\n maSet.SetItemText (i, String::CreateFromAscii(\"HighlightTextColor\"));\n maSet.InsertItem (++i, rSettings.GetDisableColor());\n maSet.SetItemText (i, String::CreateFromAscii(\"DisableColor\"));\n maSet.InsertItem (++i, rSettings.GetHelpColor());\n maSet.SetItemText (i, String::CreateFromAscii(\"HelpColor\"));\n maSet.InsertItem (++i, rSettings.GetHelpTextColor());\n maSet.SetItemText (i, String::CreateFromAscii(\"HelpTextColor\"));\n maSet.InsertItem (++i, rSettings.GetMenuColor());\n maSet.SetItemText (i, String::CreateFromAscii(\"MenuColor\"));\n maSet.InsertItem (++i, rSettings.GetMenuBarColor());\n maSet.SetItemText (i, String::CreateFromAscii(\"MenuBarColor\"));\n maSet.InsertItem (++i, rSettings.GetMenuBorderColor());\n maSet.SetItemText (i, String::CreateFromAscii(\"MenuBorderColor\"));\n maSet.InsertItem (++i, rSettings.GetMenuTextColor());\n maSet.SetItemText (i, String::CreateFromAscii(\"MenuTextColor\"));\n maSet.InsertItem (++i, rSettings.GetMenuHighlightColor());\n maSet.SetItemText (i, String::CreateFromAscii(\"MenuHighlightColor\"));\n maSet.InsertItem (++i, rSettings.GetMenuHighlightTextColor());\n maSet.SetItemText (i, String::CreateFromAscii(\"MenuHighlightTextColor\"));\n maSet.InsertItem (++i, rSettings.GetLinkColor());\n maSet.SetItemText (i, String::CreateFromAscii(\"LinkColor\"));\n maSet.InsertItem (++i, rSettings.GetVisitedLinkColor());\n maSet.SetItemText (i, String::CreateFromAscii(\"VisitedLinkColor\"));\n maSet.InsertItem (++i, rSettings.GetHighlightLinkColor());\n maSet.SetItemText (i, String::CreateFromAscii(\"HighlightLinkColor\"));\n maSet.InsertItem (++i, rSettings.GetFontColor());\n maSet.SetItemText (i, String::CreateFromAscii(\"FontColor\"));\n}\n\n} } \/\/ end of namespace ::sd::toolpanel\n<commit_msg>INTEGRATION: CWS sdwarningsbegone (1.5.38); FILE MERGED 2006\/11\/27 16:31:00 cl 1.5.38.3: #i69285# warning free code changes for sd project 2006\/11\/27 15:15:04 cl 1.5.38.2: #i69285# warning free code changes for sd project 2006\/11\/22 12:42:15 cl 1.5.38.1: #i69285# warning free code changes for unxlngi6.pro<commit_after>\/*************************************************************************\n *\n * OpenOffice.org - a multi-platform office productivity suite\n *\n * $RCSfile: TestMenu.cxx,v $\n *\n * $Revision: 1.6 $\n *\n * last change: $Author: kz $ $Date: 2006-12-12 18:43: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_sd.hxx\"\n\n#include \"TestMenu.hxx\"\n\n#include \"taskpane\/TaskPaneControlFactory.hxx\"\n\n#include <vcl\/image.hxx>\n#include <vcl\/svapp.hxx>\n\nnamespace sd { namespace toolpanel {\n\n\/** This factory class is used to create instances of ColorMenu. It can be\n extended so that its constructor stores arguments that later are passed\n to new ColorMenu objects.\n*\/\nclass ColorMenuFactory\n : public ControlFactory\n{\nprotected:\n virtual TreeNode* InternalCreateControl (TreeNode* pTreeNode)\n {\n return new ColorMenu (pTreeNode);\n }\n};\n\n\nColorMenu::ColorMenu (TreeNode* pParent)\n : Window (pParent->GetWindow()),\n TreeNode(pParent),\n maSet (this),\n mnPreferredColumnCount(2)\n{\n WinBits aStyle =\n WB_ITEMBORDER\n | WB_DOUBLEBORDER\n | WB_NAMEFIELD\n | WB_FLATVALUESET\n | WB_TABSTOP\n | WB_VSCROLL;\n\n maSet.SetStyle (maSet.GetStyle() | aStyle);\n maSet.SetExtraSpacing(2);\n\n Fill ();\n maSet.Show();\n pParent->RequestResize();\n}\n\n\n\n\nColorMenu::~ColorMenu (void)\n{\n}\n\n\n\n\n::std::auto_ptr<ControlFactory> ColorMenu::CreateControlFactory (void)\n{\n return ::std::auto_ptr<ControlFactory>(new ColorMenuFactory());\n}\n\n\n\n\n\/** The preferred size depends on the preferred number of columns, the\n number of items, and the size of the items.\n*\/\nSize ColorMenu::GetPreferredSize (void)\n{\n Size aItemSize = maSet.CalcItemSizePixel (Size());\n Size aPreferredWindowSize = maSet.CalcWindowSizePixel (\n aItemSize,\n (USHORT)mnPreferredColumnCount,\n (USHORT)CalculateRowCount (aItemSize, (USHORT)mnPreferredColumnCount));\n return aPreferredWindowSize;\n}\n\n\n\n\nsal_Int32 ColorMenu::GetPreferredWidth (sal_Int32 nHeight)\n{\n sal_Int32 nPreferredWidth = 0;\n if (maSet.GetItemCount() > 0)\n {\n Image aImage = maSet.GetItemImage(maSet.GetItemId(0));\n Size aItemSize = maSet.CalcItemSizePixel (aImage.GetSizePixel());\n if (nHeight>0 && aItemSize.Height()>0)\n {\n int nRowCount = nHeight \/ aItemSize.Height();\n if (nRowCount <= 0)\n nRowCount = 1;\n int nColumnCount = (maSet.GetItemCount() + nRowCount-1)\n \/ nRowCount;\n nPreferredWidth = nColumnCount * aItemSize.Width();\n }\n }\n\n return nPreferredWidth;\n}\n\n\n\n\nsal_Int32 ColorMenu::GetPreferredHeight (sal_Int32 nWidth)\n{\n sal_Int32 nPreferredHeight = 0;\n if (maSet.GetItemCount()>0)\n {\n Image aImage = maSet.GetItemImage(maSet.GetItemId(0));\n Size aItemSize = maSet.CalcItemSizePixel (aImage.GetSizePixel());\n if (nWidth>0 && aItemSize.Width()>0)\n {\n int nColumnCount = nWidth \/ aItemSize.Width();\n if (nColumnCount <= 0)\n nColumnCount = 1;\n else if (nColumnCount > 4)\n nColumnCount = 4;\n int nRowCount = (maSet.GetItemCount() + nColumnCount-1)\n \/ nColumnCount;\n nPreferredHeight = nRowCount * aItemSize.Height();\n }\n }\n return nPreferredHeight;\n}\n\n\n\n\nbool ColorMenu::IsResizable (void)\n{\n return true;\n}\n\n\n\n\n::Window* ColorMenu::GetWindow (void)\n{\n return this;\n}\n\n\n\n\nvoid ColorMenu::Resize (void)\n{\n ::Window::Resize();\n Size aWindowSize = GetOutputSizePixel();\n maSet.SetPosSizePixel (Point(0,0), aWindowSize);\n if (IsVisible() && aWindowSize.Width() > 0)\n {\n \/\/ maSet.SetPosSizePixel (\n \/\/ Point (0,0),\n \/\/ aWindowSize);\n\n \/\/ Calculate the number of rows and columns.\n if (maSet.GetItemCount() > 0)\n {\n Image aImage = maSet.GetItemImage(maSet.GetItemId(0));\n Size aItemSize = maSet.CalcItemSizePixel (\n aImage.GetSizePixel());\n int nColumnCount = aWindowSize.Width() \/ 30;\n if (nColumnCount < 1)\n nColumnCount = 1;\n else if (nColumnCount > 4)\n nColumnCount = 4;\n\n USHORT nRowCount = (USHORT)CalculateRowCount (aItemSize, nColumnCount);\n\n maSet.SetColCount ((USHORT)nColumnCount);\n maSet.SetLineCount (nRowCount);\n }\n }\n\n}\n\n\n\n\nint ColorMenu::CalculateRowCount (const Size&, int nColumnCount)\n{\n int nRowCount = 0;\n\n if (maSet.GetItemCount()>0 && nColumnCount>0)\n {\n nRowCount = GetOutputSizePixel().Height() \/ 30;\n if (nRowCount < 1)\n nRowCount = 1;\n }\n\n return nRowCount;\n}\n\n\n\n\nvoid ColorMenu::Fill (void)\n{\n const StyleSettings& rSettings (\n Application::GetSettings().GetStyleSettings());\n maSet.Clear();\n maSet.SetItemWidth (30);\n maSet.SetItemHeight (30);\n USHORT i = 0;\n maSet.InsertItem (++i, rSettings.GetFaceColor());\n maSet.SetItemText (i, String::CreateFromAscii(\"FaceColor\"));\n maSet.InsertItem (++i, rSettings.GetCheckedColor());\n maSet.SetItemText (i, String::CreateFromAscii(\"CheckedColor\"));\n maSet.InsertItem (++i, rSettings.GetLightColor());\n maSet.SetItemText (i, String::CreateFromAscii(\"LightColor\"));\n maSet.InsertItem (++i, rSettings.GetLightBorderColor());\n maSet.SetItemText (i, String::CreateFromAscii(\"LightBorderColor\"));\n maSet.InsertItem (++i, rSettings.GetShadowColor());\n maSet.SetItemText (i, String::CreateFromAscii(\"ShadowColor\"));\n maSet.InsertItem (++i, rSettings.GetDarkShadowColor());\n maSet.SetItemText (i, String::CreateFromAscii(\"DarkShadowColor\"));\n maSet.InsertItem (++i, rSettings.GetButtonTextColor());\n maSet.SetItemText (i, String::CreateFromAscii(\"ButtonTextColor\"));\n maSet.InsertItem (++i, rSettings.GetRadioCheckTextColor());\n maSet.SetItemText (i, String::CreateFromAscii(\"RadioCheckTextColor\"));\n maSet.InsertItem (++i, rSettings.GetGroupTextColor());\n maSet.SetItemText (i, String::CreateFromAscii(\"GroupTextColor\"));\n maSet.InsertItem (++i, rSettings.GetLabelTextColor());\n maSet.SetItemText (i, String::CreateFromAscii(\"LabelTextColor\"));\n maSet.InsertItem (++i, rSettings.GetInfoTextColor());\n maSet.SetItemText (i, String::CreateFromAscii(\"InfoTextColor\"));\n maSet.InsertItem (++i, rSettings.GetWindowColor());\n maSet.SetItemText (i, String::CreateFromAscii(\"WindowColor\"));\n maSet.InsertItem (++i, rSettings.GetWindowTextColor());\n maSet.SetItemText (i, String::CreateFromAscii(\"WindowTextColor\"));\n maSet.InsertItem (++i, rSettings.GetDialogColor());\n maSet.SetItemText (i, String::CreateFromAscii(\"DialogColor\"));\n maSet.InsertItem (++i, rSettings.GetDialogTextColor());\n maSet.SetItemText (i, String::CreateFromAscii(\"DialogTextColor\"));\n maSet.InsertItem (++i, rSettings.GetWorkspaceColor());\n maSet.SetItemText (i, String::CreateFromAscii(\"WorkspaceColor\"));\n maSet.InsertItem (++i, rSettings.GetFieldColor());\n maSet.SetItemText (i, String::CreateFromAscii(\"FieldColor\"));\n maSet.InsertItem (++i, rSettings.GetFieldTextColor());\n maSet.SetItemText (i, String::CreateFromAscii(\"FieldTextColor\"));\n maSet.InsertItem (++i, rSettings.GetActiveColor());\n maSet.SetItemText (i, String::CreateFromAscii(\"ActiveColor\"));\n maSet.InsertItem (++i, rSettings.GetActiveColor2());\n maSet.SetItemText (i, String::CreateFromAscii(\"ActiveColor2\"));\n maSet.InsertItem (++i, rSettings.GetActiveTextColor());\n maSet.SetItemText (i, String::CreateFromAscii(\"ActiveTextColor\"));\n maSet.InsertItem (++i, rSettings.GetActiveBorderColor());\n maSet.SetItemText (i, String::CreateFromAscii(\"ActiveBorderColor\"));\n maSet.InsertItem (++i, rSettings.GetDeactiveColor());\n maSet.SetItemText (i, String::CreateFromAscii(\"DeactiveColor\"));\n maSet.InsertItem (++i, rSettings.GetDeactiveColor2());\n maSet.SetItemText (i, String::CreateFromAscii(\"DeactiveColor2\"));\n maSet.InsertItem (++i, rSettings.GetDeactiveTextColor());\n maSet.SetItemText (i, String::CreateFromAscii(\"DeactiveTextColor\"));\n maSet.InsertItem (++i, rSettings.GetDeactiveBorderColor());\n maSet.SetItemText (i, String::CreateFromAscii(\"DeactiveBorderColor\"));\n maSet.InsertItem (++i, rSettings.GetHighlightColor());\n maSet.SetItemText (i, String::CreateFromAscii(\"HighlightColor\"));\n maSet.InsertItem (++i, rSettings.GetHighlightTextColor());\n maSet.SetItemText (i, String::CreateFromAscii(\"HighlightTextColor\"));\n maSet.InsertItem (++i, rSettings.GetDisableColor());\n maSet.SetItemText (i, String::CreateFromAscii(\"DisableColor\"));\n maSet.InsertItem (++i, rSettings.GetHelpColor());\n maSet.SetItemText (i, String::CreateFromAscii(\"HelpColor\"));\n maSet.InsertItem (++i, rSettings.GetHelpTextColor());\n maSet.SetItemText (i, String::CreateFromAscii(\"HelpTextColor\"));\n maSet.InsertItem (++i, rSettings.GetMenuColor());\n maSet.SetItemText (i, String::CreateFromAscii(\"MenuColor\"));\n maSet.InsertItem (++i, rSettings.GetMenuBarColor());\n maSet.SetItemText (i, String::CreateFromAscii(\"MenuBarColor\"));\n maSet.InsertItem (++i, rSettings.GetMenuBorderColor());\n maSet.SetItemText (i, String::CreateFromAscii(\"MenuBorderColor\"));\n maSet.InsertItem (++i, rSettings.GetMenuTextColor());\n maSet.SetItemText (i, String::CreateFromAscii(\"MenuTextColor\"));\n maSet.InsertItem (++i, rSettings.GetMenuHighlightColor());\n maSet.SetItemText (i, String::CreateFromAscii(\"MenuHighlightColor\"));\n maSet.InsertItem (++i, rSettings.GetMenuHighlightTextColor());\n maSet.SetItemText (i, String::CreateFromAscii(\"MenuHighlightTextColor\"));\n maSet.InsertItem (++i, rSettings.GetLinkColor());\n maSet.SetItemText (i, String::CreateFromAscii(\"LinkColor\"));\n maSet.InsertItem (++i, rSettings.GetVisitedLinkColor());\n maSet.SetItemText (i, String::CreateFromAscii(\"VisitedLinkColor\"));\n maSet.InsertItem (++i, rSettings.GetHighlightLinkColor());\n maSet.SetItemText (i, String::CreateFromAscii(\"HighlightLinkColor\"));\n maSet.InsertItem (++i, rSettings.GetFontColor());\n maSet.SetItemText (i, String::CreateFromAscii(\"FontColor\"));\n}\n\n} } \/\/ end of namespace ::sd::toolpanel\n<|endoftext|>"} {"text":"<commit_before>#include <iostream>\n#include <bits\/stdc++.h>\nusing namespace std;\n\nint main() {\n\tchar s;\n\tcin>>s;\n\tif((s>'a' && s<'z') || (s>'A' && s<'Z')) cout<<\"Alphabet\";\n\telse cout<<\"Not an alphabet\";\n\treturn 0;\n}\n<commit_msg>rm unnecessary header<commit_after>#include <iostream>\nusing namespace std;\n\nint main() {\n\tchar s;\n\tcin>>s;\n\tif((s>'a' && s<'z') || (s>'A' && s<'Z')) cout<<\"Alphabet\";\n\telse cout<<\"Not an alphabet\";\n\treturn 0;\n}\n<|endoftext|>"} {"text":"<commit_before>\/\/\/ \\file urbi\/ustarter.hh\n\n\/\/ This file is part of UObject Component Architecture\n\/\/ Copyright (c) 2007, 2008 Gostai S.A.S.\n\/\/\n\/\/ Permission to use, copy, modify, and redistribute this software for\n\/\/ non-commercial use is hereby granted.\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\/\/ For more information, comments, bug reports: http:\/\/www.urbiforge.com\n\n#ifndef URBI_STARTER_HH\n# define URBI_STARTER_HH\n\n# include <algorithm>\n# include <string>\n\n# include <urbi\/fwd.hh>\n# include <urbi\/export.hh>\n\n\/\/\/ This macro must be called once for every UObject class.\n# define UStartRename(Type, Name) \\\n ::urbi::URBIStarter<Type> \\\n Name ## ____URBI_object(std::string(#Name), ::urbi::objectlist)\n\n\/\/\/ Append connectionID to object name\n# define UStartWithID(X)\t\t\t\t\t\t\\\n ::urbi::URBIStarter<X> X ## ____URBI_object(std::string(#X),\t\t\\\n\t\t\t\t\t ::urbi::objectlist,\t\\\n\t\t\t\t\t true)\n\n\/\/\/ This macro must be called once for every UObject class.\n# define UStart(Type)\t\t\t\t\t\t\t\\\n UStartRename(Type, Type)\n\n\/\/\/ This macro must be called once for each UObjectHub class.\n# define UStartHub(Type) \\\n ::urbi::URBIStarterHub<Type> \\\n Type ## ____URBI_object(std::string(#Type), ::urbi::objecthublist)\n\nnamespace urbi\n{\n\n typedef std::list<baseURBIStarter*> UStartlist;\n typedef std::list<baseURBIStarterHub*> UStartlistHub;\n\n \/\/ Two singleton lists to handle the object and hubobject registration.\n EXTERN_STATIC_INSTANCE_EX(UStartlist, objectlist, URBI_SDK_API);\n EXTERN_STATIC_INSTANCE_EX(UStartlistHub, objecthublist, URBI_SDK_API);\n\n \/\/\/ URBIStarter base class used to store heterogeneous template\n \/\/\/ class objects in starterlist.\n class URBI_SDK_API baseURBIStarter\n {\n public:\n baseURBIStarter(const std::string& name, bool local);\n virtual ~baseURBIStarter();\n\n virtual UObject* getUObject() = 0;\n\n \/\/\/ Called before deletion.\n virtual void clean() = 0;\n \/\/\/ Used to provide a wrapper to initialize objects in starterlist.\n virtual void init(const std::string&) = 0;\n \/\/\/ Used to provide a copy of a C++ object based on its name.\n virtual void copy(const std::string&) = 0;\n std::string name;\n bool local;\n };\n\n \/\/! This is the class containing URBI starters\n \/** A starter is a class whose job is to start an instance of a particular\n * UObject subclass, resulting in the initialization of this object\n * (registration to the kernel)\n *\/\n template <class T>\n class URBIStarter\n : public baseURBIStarter\n {\n public:\n URBIStarter(const std::string& name, UStartlist& _slist, bool local);\n\n virtual ~URBIStarter();\n\n virtual void clean();\n\n virtual void copy(const std::string& objname);\n\n \/\/\/ Access to the object from the outside.\n virtual UObject* getUObject();\n\n protected:\n \/\/\/ Called when the object is ready to be initialized.\n virtual void init(const std::string& objname);\n\n UStartlist& slist_;\n T* object;\n };\n\n\n\n#define SETBACKCASTCTOR(T)\t\t\t\\\n inline\t\t\t\t\t\\\n UValue\t\t\t\t\t\\\n back_cast(T& t)\t\t\t\t\\\n {\t\t\t\t\t\t\\\n return UValue(t);\t\t\t\t\\\n }\n\nSETBACKCASTCTOR(bool)\nSETBACKCASTCTOR(int)\nSETBACKCASTCTOR(long)\nSETBACKCASTCTOR(ufloat)\nSETBACKCASTCTOR(UValue)\nSETBACKCASTCTOR(char*)\nSETBACKCASTCTOR(void*)\nSETBACKCASTCTOR(const std::string)\nSETBACKCASTCTOR(std::string)\nSETBACKCASTCTOR(const UBinary)\nSETBACKCASTCTOR(const UList)\nSETBACKCASTCTOR(const UObjectStruct)\nSETBACKCASTCTOR(const USound)\nSETBACKCASTCTOR(const UImage)\n\n\n\n \/\/\/ URBIStarter base class used to store heterogeneous template\n \/\/\/ class objects in starterlist\n class URBI_SDK_API baseURBIStarterHub\n {\n public:\n baseURBIStarterHub(const std::string& name);\n virtual ~baseURBIStarterHub();\n\n \/\/\/ Used to provide a wrapper to initialize objects in starterlist.\n virtual void init(const std::string&) = 0;\n virtual UObjectHub* getUObjectHub() = 0;\n std::string name;\n };\n\n \/\/! This is the class containing URBI starters\n \/** A starter is a class whose job is to start an instance of a particular\n * UObject subclass, resulting in the initialization of this object\n * (registration to the kernel)\n *\/\n template <class T>\n class URBIStarterHub\n : public baseURBIStarterHub\n {\n public:\n URBIStarterHub(const std::string& name, UStartlistHub& slist);\n virtual ~URBIStarterHub();\n\n protected:\n \/\/\/ Called when the object is ready to be initialized.\n virtual void init(const std::string& objname);\n\n \/\/\/ Access to the object from the outside.\n virtual UObjectHub* getUObjectHub();\n\n UStartlistHub& slist_;\n T* object;\n };\n\n} \/\/ end namespace urbi\n\n# include <urbi\/ustarter.hxx>\n\n#endif \/\/ ! URBI_STARTER_HH\n<commit_msg>UStarter, Add missing default values.<commit_after>\/\/\/ \\file urbi\/ustarter.hh\n\n\/\/ This file is part of UObject Component Architecture\n\/\/ Copyright (c) 2007, 2008 Gostai S.A.S.\n\/\/\n\/\/ Permission to use, copy, modify, and redistribute this software for\n\/\/ non-commercial use is hereby granted.\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\/\/ For more information, comments, bug reports: http:\/\/www.urbiforge.com\n\n#ifndef URBI_STARTER_HH\n# define URBI_STARTER_HH\n\n# include <algorithm>\n# include <string>\n\n# include <urbi\/fwd.hh>\n# include <urbi\/export.hh>\n\n\/\/\/ This macro must be called once for every UObject class.\n# define UStartRename(Type, Name) \\\n ::urbi::URBIStarter<Type> \\\n Name ## ____URBI_object(std::string(#Name), ::urbi::objectlist)\n\n\/\/\/ Append connectionID to object name\n# define UStartWithID(X)\t\t\t\t\t\t\\\n ::urbi::URBIStarter<X> X ## ____URBI_object(std::string(#X),\t\t\\\n\t\t\t\t\t ::urbi::objectlist,\t\\\n\t\t\t\t\t true)\n\n\/\/\/ This macro must be called once for every UObject class.\n# define UStart(Type)\t\t\t\t\t\t\t\\\n UStartRename(Type, Type)\n\n\/\/\/ This macro must be called once for each UObjectHub class.\n# define UStartHub(Type) \\\n ::urbi::URBIStarterHub<Type> \\\n Type ## ____URBI_object(std::string(#Type), ::urbi::objecthublist)\n\nnamespace urbi\n{\n\n typedef std::list<baseURBIStarter*> UStartlist;\n typedef std::list<baseURBIStarterHub*> UStartlistHub;\n\n \/\/ Two singleton lists to handle the object and hubobject registration.\n EXTERN_STATIC_INSTANCE_EX(UStartlist, objectlist, URBI_SDK_API);\n EXTERN_STATIC_INSTANCE_EX(UStartlistHub, objecthublist, URBI_SDK_API);\n\n \/\/\/ URBIStarter base class used to store heterogeneous template\n \/\/\/ class objects in starterlist.\n class URBI_SDK_API baseURBIStarter\n {\n public:\n baseURBIStarter(const std::string& name, bool local = false);\n virtual ~baseURBIStarter();\n\n virtual UObject* getUObject() = 0;\n\n \/\/\/ Called before deletion.\n virtual void clean() = 0;\n \/\/\/ Used to provide a wrapper to initialize objects in starterlist.\n virtual void init(const std::string&) = 0;\n \/\/\/ Used to provide a copy of a C++ object based on its name.\n virtual void copy(const std::string&) = 0;\n std::string name;\n bool local;\n };\n\n \/\/! This is the class containing URBI starters\n \/** A starter is a class whose job is to start an instance of a particular\n * UObject subclass, resulting in the initialization of this object\n * (registration to the kernel)\n *\/\n template <class T>\n class URBIStarter\n : public baseURBIStarter\n {\n public:\n URBIStarter(const std::string& name, UStartlist& _slist, bool local = false);\n\n virtual ~URBIStarter();\n\n virtual void clean();\n\n virtual void copy(const std::string& objname);\n\n \/\/\/ Access to the object from the outside.\n virtual UObject* getUObject();\n\n protected:\n \/\/\/ Called when the object is ready to be initialized.\n virtual void init(const std::string& objname);\n\n UStartlist& slist_;\n T* object;\n };\n\n\n\n#define SETBACKCASTCTOR(T)\t\t\t\\\n inline\t\t\t\t\t\\\n UValue\t\t\t\t\t\\\n back_cast(T& t)\t\t\t\t\\\n {\t\t\t\t\t\t\\\n return UValue(t);\t\t\t\t\\\n }\n\nSETBACKCASTCTOR(bool)\nSETBACKCASTCTOR(int)\nSETBACKCASTCTOR(long)\nSETBACKCASTCTOR(ufloat)\nSETBACKCASTCTOR(UValue)\nSETBACKCASTCTOR(char*)\nSETBACKCASTCTOR(void*)\nSETBACKCASTCTOR(const std::string)\nSETBACKCASTCTOR(std::string)\nSETBACKCASTCTOR(const UBinary)\nSETBACKCASTCTOR(const UList)\nSETBACKCASTCTOR(const UObjectStruct)\nSETBACKCASTCTOR(const USound)\nSETBACKCASTCTOR(const UImage)\n\n\n\n \/\/\/ URBIStarter base class used to store heterogeneous template\n \/\/\/ class objects in starterlist\n class URBI_SDK_API baseURBIStarterHub\n {\n public:\n baseURBIStarterHub(const std::string& name);\n virtual ~baseURBIStarterHub();\n\n \/\/\/ Used to provide a wrapper to initialize objects in starterlist.\n virtual void init(const std::string&) = 0;\n virtual UObjectHub* getUObjectHub() = 0;\n std::string name;\n };\n\n \/\/! This is the class containing URBI starters\n \/** A starter is a class whose job is to start an instance of a particular\n * UObject subclass, resulting in the initialization of this object\n * (registration to the kernel)\n *\/\n template <class T>\n class URBIStarterHub\n : public baseURBIStarterHub\n {\n public:\n URBIStarterHub(const std::string& name, UStartlistHub& slist);\n virtual ~URBIStarterHub();\n\n protected:\n \/\/\/ Called when the object is ready to be initialized.\n virtual void init(const std::string& objname);\n\n \/\/\/ Access to the object from the outside.\n virtual UObjectHub* getUObjectHub();\n\n UStartlistHub& slist_;\n T* object;\n };\n\n} \/\/ end namespace urbi\n\n# include <urbi\/ustarter.hxx>\n\n#endif \/\/ ! URBI_STARTER_HH\n<|endoftext|>"} {"text":"<commit_before>#include <string>\n#include \"gtest\/gtest.h\"\n#include \"StatechartEntryAndExitActions.h\"\n#include \"sc_runner.h\"\n#include \"sc_types.h\"\n\nnamespace {\n\nvoid entryActionsAreExecutedOnEnteringStatechartOnlyIfGuardIsTrue();\nvoid exitActionsAreExecutedOnEnteringStatechartOnlyIfGuardIsTrue();\nstatechartactions::StatechartEntryAndExitActions* statechart;\n\n\n\n\/\/! The timers are managed by a timer service. *\/\nstatic SctUnitRunner * runner;\n\nclass StatechartEntryExitActions : public ::testing::Test{\n\tprotected:\n\tvirtual void SetUp() {\n\t\tstatechart = new statechartactions::StatechartEntryAndExitActions();\n\t\tstatechart->init();\n\t\trunner = new SctUnitRunner(\n\t\t\tstatechart,\n\t\t\tfalse,\n\t\t\t200\n\t\t);\n\t}\n\tvirtual void TearDown() {\n\t\tdelete statechart;\n\t\tdelete runner;\n\t}\n};\n\nvoid entryActionsAreExecutedOnEnteringStatechartOnlyIfGuardIsTrue(){\n\tEXPECT_TRUE(statechart->getDefaultSCI()->get_x()== 0l);\n\t\n\tEXPECT_TRUE(statechart->getDefaultSCI()->get_y()== 0l);\n\t\n\tstatechart->getDefaultSCI()->set_b(false);\n\t\n\tstatechart->enter();\n\t\n\tEXPECT_TRUE(statechart->getDefaultSCI()->get_x()== 2l);\n\t\n\tEXPECT_TRUE(statechart->getDefaultSCI()->get_y()== 3l);\n\t\n\t\n}\nvoid exitActionsAreExecutedOnEnteringStatechartOnlyIfGuardIsTrue(){\n\tstatechart->enter();\n\t\n\tstatechart->exit();\n\t\n\tEXPECT_TRUE(statechart->getDefaultSCI()->get_x()== 8l);\n\t\n\tEXPECT_TRUE(statechart->getDefaultSCI()->get_y()== 2l);\n\t\n\t\n}\n\nTEST_F(StatechartEntryExitActions, entryActionsAreExecutedOnEnteringStatechart) {\n\t\n\tEXPECT_TRUE(statechart->getDefaultSCI()->get_x()== 0l);\n\t\n\tEXPECT_TRUE(statechart->getDefaultSCI()->get_y()== 0l);\n\t\n\tstatechart->getDefaultSCI()->set_b(true);\n\t\n\tstatechart->enter();\n\t\n\tEXPECT_TRUE(statechart->getDefaultSCI()->get_x()== 5l);\n\t\n\tEXPECT_TRUE(statechart->getDefaultSCI()->get_y()== 3l);\n\t\n\t\n}\nTEST_F(StatechartEntryExitActions, exitActionsAreExecutedOnEnteringStatechart) {\n\t\n\tstatechart->enter();\n\t\n\tstatechart->exit();\n\t\n\tEXPECT_TRUE(statechart->getDefaultSCI()->get_x()== 6l);\n\t\n\tEXPECT_TRUE(statechart->getDefaultSCI()->get_y()== 2l);\n\t\n\t\n}\n\n\n}\n\n<commit_msg>Update StatechartEntryExitActions.cc<commit_after>#include <string>\n#include \"gtest\/gtest.h\"\n#include \"StatechartEntryAndExitActions.h\"\n#include \"sc_runner.h\"\n#include \"sc_types.h\"\n\nnamespace {\n\nvoid entryActionsAreExecutedOnEnteringStatechartOnlyIfGuardIsTrue();\nvoid exitActionsAreExecutedOnEnteringStatechartOnlyIfGuardIsTrue();\nstatechartactions::StatechartEntryAndExitActions* statechart;\n\n\n\n\/\/! The timers are managed by a timer service. *\/\nstatic SctUnitRunner * runner;\n\nclass StatechartEntryExitActions : public ::testing::Test{\n\tprotected:\n\tvirtual void SetUp() {\n\t\tstatechart = new statechartactions::StatechartEntryAndExitActions();\n\t\tstatechart->init();\n\t\trunner = new SctUnitRunner(\n\t\t\tstatechart,\n\t\t\tfalse,\n\t\t\t200\n\t\t);\n\t}\n\tvirtual void TearDown() {\n\t\tdelete statechart;\n\t\tdelete runner;\n\t}\n};\n\nvoid entryActionsAreExecutedOnEnteringStatechartOnlyIfGuardIsTrue(){\n\tEXPECT_TRUE(statechart->getDefaultSCI()->get_x()== 0l);\n\t\n\tEXPECT_TRUE(statechart->getDefaultSCI()->get_y()== 0l);\n\t\n\tstatechart->getDefaultSCI()->set_b(false);\n\t\n\tstatechart->enter();\n\t\n\tEXPECT_TRUE(statechart->getDefaultSCI()->get_x()== 2l);\n\t\n\tEXPECT_TRUE(statechart->getDefaultSCI()->get_y()== 3l);\n\t\n\t\n}\nvoid exitActionsAreExecutedOnEnteringStatechartOnlyIfGuardIsTrue(){\n\tstatechart->enter();\n\t\n\tstatechart->exit();\n\t\n\tEXPECT_TRUE(statechart->getDefaultSCI()->get_x()== 8l);\n\t\n\tEXPECT_TRUE(statechart->getDefaultSCI()->get_y()== 2l);\n\t\n\t\n}\n\nTEST_F(StatechartEntryExitActions, entryActionsAreExecutedOnEnteringStatechart) {\n\t\n\tEXPECT_TRUE(statechart->getDefaultSCI()->get_x()== 0l);\n\t\n\tEXPECT_TRUE(statechart->getDefaultSCI()->get_y()== 0l);\n\t\n\tstatechart->getDefaultSCI()->set_b(true);\n\t\n\tstatechart->enter();\n\t\n\tEXPECT_TRUE(statechart->getDefaultSCI()->get_x()== 5l);\n\t\n\tEXPECT_TRUE(statechart->getDefaultSCI()->get_y()== 3l);\n\t\n\t\n}\nTEST_F(StatechartEntryExitActions, exitActionsAreExecutedOnEnteringStatechart) {\n\t\n\tstatechart->enter();\n\t\n\tstatechart->exit();\n\t\n\tEXPECT_TRUE(statechart->getDefaultSCI()->get_x()== 6l);\n\t\n\tEXPECT_TRUE(statechart->getDefaultSCI()->get_y()== 2l);\n\t\n\t\n}\n\n}\n\n<|endoftext|>"} {"text":"<commit_before>\/\/===- Version.cpp - Clang Version Number -----------------------*- 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 several version-related utility functions for Clang.\n\/\/\n\/\/===----------------------------------------------------------------------===\/\/\n#include <cstring>\n#include <cstdlib>\nusing namespace std;\n\nnamespace clang {\n \nconst char *getClangSubversionPath() {\n static const char *Path = 0;\n if (Path)\n return Path;\n \n static char URL[] = \"$URL$\";\n char *End = strstr(URL, \"\/lib\/Basic\");\n if (End)\n *End = 0;\n \n char *Begin = strstr(URL, \"cfe\/\");\n if (Begin) {\n Path = Begin + 4;\n return Path;\n }\n \n Path = URL;\n return Path;\n}\n\n\nunsigned getClangSubversionRevision() {\n#ifndef SVN_REVISION\n \/\/ Subversion was not available at build time?\n return 0;\n#else\n return strtol(SVN_REVISION, 0, 10);\n#endif\n}\n\n} \/\/ end namespace clang\n<commit_msg>Strip off the \/clang\/tools\/clang at the end of the Subversion URL, if it's there<commit_after>\/\/===- Version.cpp - Clang Version Number -----------------------*- 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 several version-related utility functions for Clang.\n\/\/\n\/\/===----------------------------------------------------------------------===\/\/\n#include <cstring>\n#include <cstdlib>\nusing namespace std;\n\nnamespace clang {\n \nconst char *getClangSubversionPath() {\n static const char *Path = 0;\n if (Path)\n return Path;\n \n static char URL[] = \"$URL$\";\n char *End = strstr(URL, \"\/lib\/Basic\");\n if (End)\n *End = 0;\n \n End = strstr(URL, \"\/clang\/tools\/clang\");\n if (End)\n *End = 0;\n \n char *Begin = strstr(URL, \"cfe\/\");\n if (Begin) {\n Path = Begin + 4;\n return Path;\n }\n \n Path = URL;\n return Path;\n}\n\n\nunsigned getClangSubversionRevision() {\n#ifndef SVN_REVISION\n \/\/ Subversion was not available at build time?\n return 0;\n#else\n return strtol(SVN_REVISION, 0, 10);\n#endif\n}\n\n} \/\/ end namespace clang\n<|endoftext|>"} {"text":"<commit_before><commit_msg>Format<commit_after><|endoftext|>"} {"text":"<commit_before><commit_msg>Create CoupledPotential.C<commit_after><|endoftext|>"} {"text":"<commit_before><commit_msg>Fixing a small typo in get_ros_params.cpp<commit_after><|endoftext|>"} {"text":"<commit_before>\/\/===--- TBDGen.cpp - Swift TBD Generation --------------------------------===\/\/\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 file implements the entrypoints into TBD file generation.\n\/\/\n\/\/===----------------------------------------------------------------------===\/\/\n\n#include \"swift\/TBDGen\/TBDGen.h\"\n\n#include \"swift\/AST\/ASTMangler.h\"\n#include \"swift\/AST\/ASTVisitor.h\"\n#include \"swift\/AST\/Module.h\"\n#include \"swift\/Basic\/LLVM.h\"\n#include \"swift\/IRGen\/LinkEntity.h\"\n#include \"swift\/SIL\/FormalLinkage.h\"\n#include \"swift\/SIL\/SILDeclRef.h\"\n#include \"llvm\/ADT\/StringSet.h\"\n\nusing namespace swift;\nusing StringSet = llvm::StringSet<>;\n\nstatic bool isPrivateDecl(ValueDecl *VD) {\n return getDeclLinkage(VD) != FormalLinkage::PublicUnique;\n}\n\nnamespace {\nclass TBDGenVisitor : public ASTVisitor<TBDGenVisitor> {\n StringSet &Symbols;\n\n void addSymbol(StringRef name) {\n assert(Symbols.insert(name).second && \"already inserted\");\n }\n\n void visitValueTypeDecl(NominalTypeDecl *NTD) {\n assert(isa<StructDecl>(NTD) || isa<EnumDecl>(NTD));\n if (isPrivateDecl(NTD))\n return;\n\n auto declaredType = NTD->getDeclaredType()->getCanonicalType();\n\n auto vwt = irgen::LinkEntity::forValueWitnessTable(declaredType);\n addSymbol(vwt.mangleAsString());\n\n visitNominalTypeDecl(NTD);\n }\n\npublic:\n TBDGenVisitor(StringSet &symbols) : Symbols(symbols) {}\n\n void visitMembers(Decl *D) {\n SmallVector<Decl *, 4> members;\n auto addMembers = [&](DeclRange range) {\n for (auto member : range)\n members.push_back(member);\n };\n if (auto ED = dyn_cast<ExtensionDecl>(D))\n addMembers(ED->getMembers());\n else if (auto NTD = dyn_cast<NominalTypeDecl>(D))\n addMembers(NTD->getMembers());\n\n for (auto member : members) {\n ASTVisitor::visit(member);\n }\n }\n void visitValueDecl(ValueDecl *VD) {\n if (isPrivateDecl(VD))\n return;\n\n auto declRef = SILDeclRef(VD);\n addSymbol(declRef.mangle());\n\n visitMembers(VD);\n }\n void visitTypeAliasDecl(TypeAliasDecl *TAD) {\n \/\/ any information here is encoded elsewhere\n }\n void visitNominalTypeDecl(NominalTypeDecl *NTD) {\n auto declaredType = NTD->getDeclaredType()->getCanonicalType();\n\n auto ntDescriptor = irgen::LinkEntity::forNominalTypeDescriptor(NTD);\n addSymbol(ntDescriptor.mangleAsString());\n\n auto tmd = irgen::LinkEntity::forTypeMetadata(\n declaredType, irgen::TypeMetadataAddress::AddressPoint,\n \/*isPattern=*\/false);\n addSymbol(tmd.mangleAsString());\n auto tmda = irgen::LinkEntity::forTypeMetadataAccessFunction(declaredType);\n addSymbol(tmda.mangleAsString());\n\n if (isPrivateDecl(NTD))\n return;\n\n visitMembers(NTD);\n }\n void visitClassDecl(ClassDecl *CD) {\n if (isPrivateDecl(CD))\n return;\n\n auto declaredType = CD->getDeclaredType()->getCanonicalType();\n\n auto tmlcv =\n irgen::LinkEntity::forTypeMetadataLazyCacheVariable(declaredType);\n addSymbol(tmlcv.mangleAsString());\n\n visitNominalTypeDecl(CD);\n }\n\n void visitStructDecl(StructDecl *SD) { visitValueTypeDecl(SD); }\n void visitEnumDecl(EnumDecl *ED) { visitValueTypeDecl(ED); }\n void visitProtocolDecl(ProtocolDecl *PD) {\n if (isPrivateDecl(PD))\n return;\n\n auto pDescriptor = irgen::LinkEntity::forProtocolDescriptor(PD);\n addSymbol(pDescriptor.mangleAsString());\n\n \/\/ There's no relevant information about members of a protocol at individual\n \/\/ protocols, each conforming type has to handle them individually.\n }\n\n void visitVarDecl(VarDecl *VD);\n\n void visitDecl(Decl *D) { visitMembers(D); }\n};\n}\n\nvoid TBDGenVisitor::visitVarDecl(VarDecl *VD) {\n if (isPrivateDecl(VD))\n return;\n\n \/\/ statically\/globally stored variables have some special handling.\n if (VD->hasStorage() &&\n (VD->isStatic() || VD->getDeclContext()->isModuleScopeContext())) {\n \/\/ The actual variable has a symbol, even when private.\n Mangle::ASTMangler mangler;\n addSymbol(mangler.mangleEntity(VD, false));\n\n auto accessor = SILDeclRef(VD, SILDeclRef::Kind::GlobalAccessor);\n addSymbol(accessor.mangle());\n }\n\n visitMembers(VD);\n}\n\nvoid swift::enumeratePublicSymbols(FileUnit *file, StringSet &symbols) {\n SmallVector<Decl *, 16> decls;\n file->getTopLevelDecls(decls);\n\n TBDGenVisitor visitor(symbols);\n for (auto d : decls)\n visitor.visit(d);\n}\n<commit_msg>[TBDGen] Side-effects and asserts don't mix.<commit_after>\/\/===--- TBDGen.cpp - Swift TBD Generation --------------------------------===\/\/\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 file implements the entrypoints into TBD file generation.\n\/\/\n\/\/===----------------------------------------------------------------------===\/\/\n\n#include \"swift\/TBDGen\/TBDGen.h\"\n\n#include \"swift\/AST\/ASTMangler.h\"\n#include \"swift\/AST\/ASTVisitor.h\"\n#include \"swift\/AST\/Module.h\"\n#include \"swift\/Basic\/LLVM.h\"\n#include \"swift\/IRGen\/LinkEntity.h\"\n#include \"swift\/SIL\/FormalLinkage.h\"\n#include \"swift\/SIL\/SILDeclRef.h\"\n#include \"llvm\/ADT\/StringSet.h\"\n\nusing namespace swift;\nusing StringSet = llvm::StringSet<>;\n\nstatic bool isPrivateDecl(ValueDecl *VD) {\n return getDeclLinkage(VD) != FormalLinkage::PublicUnique;\n}\n\nnamespace {\nclass TBDGenVisitor : public ASTVisitor<TBDGenVisitor> {\n StringSet &Symbols;\n\n void addSymbol(StringRef name) {\n auto isNewValue = Symbols.insert(name).second;\n (void)isNewValue;\n assert(isNewValue && \"already inserted\");\n }\n\n void visitValueTypeDecl(NominalTypeDecl *NTD) {\n assert(isa<StructDecl>(NTD) || isa<EnumDecl>(NTD));\n if (isPrivateDecl(NTD))\n return;\n\n auto declaredType = NTD->getDeclaredType()->getCanonicalType();\n\n auto vwt = irgen::LinkEntity::forValueWitnessTable(declaredType);\n addSymbol(vwt.mangleAsString());\n\n visitNominalTypeDecl(NTD);\n }\n\npublic:\n TBDGenVisitor(StringSet &symbols) : Symbols(symbols) {}\n\n void visitMembers(Decl *D) {\n SmallVector<Decl *, 4> members;\n auto addMembers = [&](DeclRange range) {\n for (auto member : range)\n members.push_back(member);\n };\n if (auto ED = dyn_cast<ExtensionDecl>(D))\n addMembers(ED->getMembers());\n else if (auto NTD = dyn_cast<NominalTypeDecl>(D))\n addMembers(NTD->getMembers());\n\n for (auto member : members) {\n ASTVisitor::visit(member);\n }\n }\n void visitValueDecl(ValueDecl *VD) {\n if (isPrivateDecl(VD))\n return;\n\n auto declRef = SILDeclRef(VD);\n addSymbol(declRef.mangle());\n\n visitMembers(VD);\n }\n void visitTypeAliasDecl(TypeAliasDecl *TAD) {\n \/\/ any information here is encoded elsewhere\n }\n void visitNominalTypeDecl(NominalTypeDecl *NTD) {\n auto declaredType = NTD->getDeclaredType()->getCanonicalType();\n\n auto ntDescriptor = irgen::LinkEntity::forNominalTypeDescriptor(NTD);\n addSymbol(ntDescriptor.mangleAsString());\n\n auto tmd = irgen::LinkEntity::forTypeMetadata(\n declaredType, irgen::TypeMetadataAddress::AddressPoint,\n \/*isPattern=*\/false);\n addSymbol(tmd.mangleAsString());\n auto tmda = irgen::LinkEntity::forTypeMetadataAccessFunction(declaredType);\n addSymbol(tmda.mangleAsString());\n\n if (isPrivateDecl(NTD))\n return;\n\n visitMembers(NTD);\n }\n void visitClassDecl(ClassDecl *CD) {\n if (isPrivateDecl(CD))\n return;\n\n auto declaredType = CD->getDeclaredType()->getCanonicalType();\n\n auto tmlcv =\n irgen::LinkEntity::forTypeMetadataLazyCacheVariable(declaredType);\n addSymbol(tmlcv.mangleAsString());\n\n visitNominalTypeDecl(CD);\n }\n\n void visitStructDecl(StructDecl *SD) { visitValueTypeDecl(SD); }\n void visitEnumDecl(EnumDecl *ED) { visitValueTypeDecl(ED); }\n void visitProtocolDecl(ProtocolDecl *PD) {\n if (isPrivateDecl(PD))\n return;\n\n auto pDescriptor = irgen::LinkEntity::forProtocolDescriptor(PD);\n addSymbol(pDescriptor.mangleAsString());\n\n \/\/ There's no relevant information about members of a protocol at individual\n \/\/ protocols, each conforming type has to handle them individually.\n }\n\n void visitVarDecl(VarDecl *VD);\n\n void visitDecl(Decl *D) { visitMembers(D); }\n};\n}\n\nvoid TBDGenVisitor::visitVarDecl(VarDecl *VD) {\n if (isPrivateDecl(VD))\n return;\n\n \/\/ statically\/globally stored variables have some special handling.\n if (VD->hasStorage() &&\n (VD->isStatic() || VD->getDeclContext()->isModuleScopeContext())) {\n \/\/ The actual variable has a symbol, even when private.\n Mangle::ASTMangler mangler;\n addSymbol(mangler.mangleEntity(VD, false));\n\n auto accessor = SILDeclRef(VD, SILDeclRef::Kind::GlobalAccessor);\n addSymbol(accessor.mangle());\n }\n\n visitMembers(VD);\n}\n\nvoid swift::enumeratePublicSymbols(FileUnit *file, StringSet &symbols) {\n SmallVector<Decl *, 16> decls;\n file->getTopLevelDecls(decls);\n\n TBDGenVisitor visitor(symbols);\n for (auto d : decls)\n visitor.visit(d);\n}\n<|endoftext|>"} {"text":"<commit_before>\/*=========================================================================\n\n Program: ORFEO Toolbox\n Language: C++\n Date: $Date$\n Version: $Revision$\n\n\n Copyright (c) Centre National d'Etudes Spatiales. All rights reserved.\n See OTBCopyright.txt for details.\n\n\n This software is distributed WITHOUT ANY WARRANTY; without even\n the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR\n PURPOSE. See the above copyright notices for more information.\n\n=========================================================================*\/\n\n\n\/\/ Software Guide : BeginCommandLineArgs\n\/\/ INPUTS: {MSLabeledOutput.tif}\n\/\/ OUTPUTS: {OBIAShapeAttribute.txt}\n\/\/ Software Guide : EndCommandLineArgs\n\n\/\/ Software Guide : BeginLatex\n\/\/\n\/\/ This example shows the\n\/\/\n\/\/ Software Guide : EndLatex\n\n\/\/ Software Guide : BeginCodeSnippet\n\n\n\/\/ Software Guide : EndCodeSnippet\n#include \"itkImageFileReader.h\"\n#include \"itkImageFileWriter.h\"\n#include \"itkSimpleFilterWatcher.h\"\n\n\/\/#include \"itkLabelStatisticsKeepNObjectsImageFilter.h\"\n\n#include \"itkLabelImageToLabelMapFilter.h\"\n#include \"itkStatisticsLabelObject.h\"\n#include \"itkStatisticsLabelMapFilter.h\"\n#include \"itkStatisticsKeepNObjectsLabelMapFilter.h\"\n#include \"itkLabelMapToLabelImageFilter.h\"\n\n\n\nint main(int argc, char * argv[])\n{\n\n if( argc != 8 )\n {\n std::cerr << \"usage: \" << argv[0] << \" input input output background nb reverseOrdering attribute\" << std::endl;\n \/\/ std::cerr << \" : \" << std::endl;\n exit(1);\n }\n\n const int dim = 3;\n\n typedef unsigned char PixelType;\n typedef itk::Image< PixelType, dim > IType;\n\n typedef itk::ImageFileReader< IType > ReaderType;\n ReaderType::Pointer reader = ReaderType::New();\n reader->SetFileName( argv[1] );\n \n ReaderType::Pointer reader2 = ReaderType::New();\n reader2->SetFileName( argv[2] );\n\n typedef itk::StatisticsLabelObject<PixelType, dim> LabelObjectType;\n typedef itk::LabelMap< LabelObjectType > LabelMapType;\n typedef itk::LabelImageToLabelMapFilter< IType, LabelMapType > LabelizerType;\n\n typedef itk::StatisticsLabelMapFilter< LabelMapType, IType > LabelObjectValuatorType;\n typedef LabelObjectType::AttributeType AttributeType;\n typedef itk::StatisticsKeepNObjectsLabelMapFilter< LabelMapType > KeepNObjectsType;\n typedef itk::LabelMapToLabelImageFilter< LabelMapType, IType > BinarizerType;\n\n LabelizerType::Pointer labelizer = LabelizerType::New();\n labelizer->SetInput( reader->GetOutput() );\n labelizer->SetBackgroundValue( atoi(argv[4]) );\n \n LabelObjectValuatorType::Pointer valuator = LabelObjectValuatorType::New();\n valuator->SetInput( labelizer->GetOutput() );\n valuator->SetFeatureImage( reader2->GetOutput() );\n valuator->SetLabelImage( reader->GetOutput() );\n valuator->SetComputeHistogram( false );\n \n KeepNObjectsType::Pointer opening = KeepNObjectsType::New();\n opening->SetInput( valuator->GetOutput() );\n opening->SetNumberOfObjects( atoi(argv[5]) );\n opening->SetReverseOrdering( atoi(argv[6]) );\n opening->SetAttribute( argv[7] );\n \n BinarizerType::Pointer binarizer = BinarizerType::New();\n binarizer->SetInput( opening->GetOutput() );\n\n \/*\n typedef itk::LabelStatisticsKeepNObjectsImageFilter< IType, IType > LabelOpeningType;\n LabelOpeningType::Pointer opening = LabelOpeningType::New();\n opening->SetInput( reader->GetOutput() );\n opening->SetFeatureImage( reader2->GetOutput() );\n opening->SetBackgroundValue( atoi(argv[4]) );\n opening->SetNumberOfObjects( atoi(argv[5]) );\n opening->SetReverseOrdering( atoi(argv[6]) );\n opening->SetAttribute( argv[7] );\n itk::SimpleFilterWatcher watcher(opening, \"filter\");\n*\/\n typedef itk::ImageFileWriter< IType > WriterType;\n WriterType::Pointer writer = WriterType::New();\n writer->SetInput( binarizer->GetOutput() );\n writer->SetFileName( argv[3] );\n writer->Update();\n return 0;\n}\n\n<commit_msg>COMP: Fixing conflicting names in Software Guide Generation<commit_after>\/*=========================================================================\n\n Program: ORFEO Toolbox\n Language: C++\n Date: $Date$\n Version: $Revision$\n\n\n Copyright (c) Centre National d'Etudes Spatiales. All rights reserved.\n See OTBCopyright.txt for details.\n\n\n This software is distributed WITHOUT ANY WARRANTY; without even\n the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR\n PURPOSE. See the above copyright notices for more information.\n\n=========================================================================*\/\n\n\n\/\/ Software Guide : BeginCommandLineArgs\n\/\/ INPUTS: {MSLabeledOutput.tif}\n\/\/ OUTPUTS: {OBIAShapeAttribute1.txt}\n\/\/ Software Guide : EndCommandLineArgs\n\n\/\/ Software Guide : BeginLatex\n\/\/\n\/\/ This example shows the\n\/\/\n\/\/ Software Guide : EndLatex\n\n\/\/ Software Guide : BeginCodeSnippet\n\n\n\/\/ Software Guide : EndCodeSnippet\n#include \"itkImageFileReader.h\"\n#include \"itkImageFileWriter.h\"\n#include \"itkSimpleFilterWatcher.h\"\n\n\/\/#include \"itkLabelStatisticsKeepNObjectsImageFilter.h\"\n\n#include \"itkLabelImageToLabelMapFilter.h\"\n#include \"itkStatisticsLabelObject.h\"\n#include \"itkStatisticsLabelMapFilter.h\"\n#include \"itkStatisticsKeepNObjectsLabelMapFilter.h\"\n#include \"itkLabelMapToLabelImageFilter.h\"\n\n\n\nint main(int argc, char * argv[])\n{\n\n if( argc != 8 )\n {\n std::cerr << \"usage: \" << argv[0] << \" input input output background nb reverseOrdering attribute\" << std::endl;\n \/\/ std::cerr << \" : \" << std::endl;\n exit(1);\n }\n\n const int dim = 3;\n\n typedef unsigned char PixelType;\n typedef itk::Image< PixelType, dim > IType;\n\n typedef itk::ImageFileReader< IType > ReaderType;\n ReaderType::Pointer reader = ReaderType::New();\n reader->SetFileName( argv[1] );\n \n ReaderType::Pointer reader2 = ReaderType::New();\n reader2->SetFileName( argv[2] );\n\n typedef itk::StatisticsLabelObject<PixelType, dim> LabelObjectType;\n typedef itk::LabelMap< LabelObjectType > LabelMapType;\n typedef itk::LabelImageToLabelMapFilter< IType, LabelMapType > LabelizerType;\n\n typedef itk::StatisticsLabelMapFilter< LabelMapType, IType > LabelObjectValuatorType;\n typedef LabelObjectType::AttributeType AttributeType;\n typedef itk::StatisticsKeepNObjectsLabelMapFilter< LabelMapType > KeepNObjectsType;\n typedef itk::LabelMapToLabelImageFilter< LabelMapType, IType > BinarizerType;\n\n LabelizerType::Pointer labelizer = LabelizerType::New();\n labelizer->SetInput( reader->GetOutput() );\n labelizer->SetBackgroundValue( atoi(argv[4]) );\n \n LabelObjectValuatorType::Pointer valuator = LabelObjectValuatorType::New();\n valuator->SetInput( labelizer->GetOutput() );\n valuator->SetFeatureImage( reader2->GetOutput() );\n valuator->SetLabelImage( reader->GetOutput() );\n valuator->SetComputeHistogram( false );\n \n KeepNObjectsType::Pointer opening = KeepNObjectsType::New();\n opening->SetInput( valuator->GetOutput() );\n opening->SetNumberOfObjects( atoi(argv[5]) );\n opening->SetReverseOrdering( atoi(argv[6]) );\n opening->SetAttribute( argv[7] );\n \n BinarizerType::Pointer binarizer = BinarizerType::New();\n binarizer->SetInput( opening->GetOutput() );\n\n \/*\n typedef itk::LabelStatisticsKeepNObjectsImageFilter< IType, IType > LabelOpeningType;\n LabelOpeningType::Pointer opening = LabelOpeningType::New();\n opening->SetInput( reader->GetOutput() );\n opening->SetFeatureImage( reader2->GetOutput() );\n opening->SetBackgroundValue( atoi(argv[4]) );\n opening->SetNumberOfObjects( atoi(argv[5]) );\n opening->SetReverseOrdering( atoi(argv[6]) );\n opening->SetAttribute( argv[7] );\n itk::SimpleFilterWatcher watcher(opening, \"filter\");\n*\/\n typedef itk::ImageFileWriter< IType > WriterType;\n WriterType::Pointer writer = WriterType::New();\n writer->SetInput( binarizer->GetOutput() );\n writer->SetFileName( argv[3] );\n writer->Update();\n return 0;\n}\n\n<|endoftext|>"} {"text":"<commit_before>\/*=========================================================================\n\n Program: Visualization Toolkit\n Module: vtkAbstractGraph.cxx\n\n Copyright (c) Ken Martin, Will Schroeder, Bill Lorensen\n All rights reserved.\n See Copyright.txt or http:\/\/www.kitware.com\/Copyright.htm for details.\n\n This software is distributed WITHOUT ANY WARRANTY; without even\n the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR\n PURPOSE. See the above copyright notice for more information.\n\n=========================================================================*\/\n\/*----------------------------------------------------------------------------\n Copyright (c) Sandia Corporation\n See Copyright.txt or http:\/\/www.paraview.org\/HTML\/Copyright.html for details.\n----------------------------------------------------------------------------*\/\n\n#include \"vtkAbstractGraph.h\"\n#include \"vtkCellData.h\"\n#include \"vtkGenericCell.h\"\n#include \"vtkGraphIdList.h\"\n#include \"vtkIdList.h\"\n#include \"vtkIdTypeArray.h\"\n#include \"vtkInformation.h\"\n#include \"vtkInformationVector.h\"\n#include \"vtkLine.h\"\n#include \"vtkVertexLinks.h\"\n#include \"vtkPointData.h\"\n#include \"vtkPointLocator.h\"\n#include \"vtkPoints.h\"\n\n#include <vtkstd\/algorithm> \/\/ for sorting\n\n\/\/ \n\/\/ Standard functions\n\/\/\n\ndouble vtkAbstractGraph::DefaultPoint[3] = {0, 0, 0};\n\nvtkCxxRevisionMacro(vtkAbstractGraph, \"1.6\");\n\n\/\/----------------------------------------------------------------------------\nvtkAbstractGraph::vtkAbstractGraph()\n{\n this->Line = vtkLine::New();\n\n this->Information->Set(vtkDataObject::DATA_EXTENT_TYPE(), VTK_PIECES_EXTENT);\n this->Information->Set(vtkDataObject::DATA_PIECE_NUMBER(), -1);\n this->Information->Set(vtkDataObject::DATA_NUMBER_OF_PIECES(), 1);\n this->Information->Set(vtkDataObject::DATA_NUMBER_OF_GHOST_LEVELS(), 0);\n}\n\n\/\/----------------------------------------------------------------------------\nvtkAbstractGraph::~vtkAbstractGraph()\n{\n if (this->Line)\n {\n this->Line->Delete();\n this->Line = NULL;\n }\n}\n\n\/\/----------------------------------------------------------------------------\nvoid vtkAbstractGraph::Initialize()\n{\n this->Line->Delete();\n this->Line = vtkLine::New();\n}\n\nvoid vtkAbstractGraph::PrintSelf(ostream& os, vtkIndent indent)\n{\n this->Superclass::PrintSelf(os, indent);\n}\n\n\/\/----------------------------------------------------------------------------\nvoid vtkAbstractGraph::ShallowCopy(vtkDataObject *dataObject)\n{\n \/\/ Do superclass\n this->Superclass::ShallowCopy(dataObject);\n}\n\n\/\/----------------------------------------------------------------------------\nvoid vtkAbstractGraph::DeepCopy(vtkDataObject *dataObject)\n{\n \/\/ Do superclass\n this->Superclass::DeepCopy(dataObject);\n}\n\n\/\/----------------------------------------------------------------------------\ndouble* vtkAbstractGraph::GetPoint(vtkIdType ptId)\n{\n if (this->Points)\n {\n return this->Points->GetPoint(ptId);\n }\n return this->DefaultPoint;\n}\n\n\/\/----------------------------------------------------------------------------\nvoid vtkAbstractGraph::GetPoint(vtkIdType ptId, double x[3])\n{\n if (this->Points)\n {\n this->Points->GetPoint(ptId, x);\n }\n else\n {\n for (int i = 0; i < 3; i++)\n {\n x[i] = this->DefaultPoint[i];\n }\n }\n}\n\n\/\/----------------------------------------------------------------------------\nvtkPoints* vtkAbstractGraph::GetPoints()\n{\n if (!this->Points)\n {\n this->Points = vtkPoints::New();\n }\n if (this->Points->GetNumberOfPoints() != this->GetNumberOfVertices())\n {\n this->Points->SetNumberOfPoints(this->GetNumberOfVertices());\n for (vtkIdType i = 0; i < this->GetNumberOfVertices(); i++)\n {\n this->Points->SetPoint(i, 0, 0, 0);\n }\n }\n return this->Points;\n}\n\n\/\/----------------------------------------------------------------------------\nvtkCell* vtkAbstractGraph::GetCell(vtkIdType cellId)\n{\n double x[3];\n this->GetPoint(this->GetSourceVertex(cellId), x);\n this->Line->Points->SetPoint(0, x);\n this->GetPoint(this->GetTargetVertex(cellId), x);\n this->Line->Points->SetPoint(1, x);\n\n this->Line->PointIds->SetId(0, this->GetSourceVertex(cellId));\n this->Line->PointIds->SetId(1, this->GetTargetVertex(cellId));\n return this->Line;\n}\n\n\/\/----------------------------------------------------------------------------\nvoid vtkAbstractGraph::GetCell(vtkIdType cellId, vtkGenericCell * cell)\n{\n cell->SetCellType(VTK_LINE);\n\n cell->Points->SetNumberOfPoints(2);\n double x[3];\n this->GetPoint(this->GetSourceVertex(cellId), x);\n cell->Points->SetPoint(0, x);\n this->GetPoint(this->GetTargetVertex(cellId), x);\n cell->Points->SetPoint(1, x);\n\n cell->PointIds->SetNumberOfIds(2);\n cell->PointIds->SetId(0, this->GetSourceVertex(cellId));\n cell->PointIds->SetId(1, this->GetTargetVertex(cellId));\n}\n\n\/\/----------------------------------------------------------------------------\nint vtkAbstractGraph::GetCellType(vtkIdType vtkNotUsed(cellId))\n{\n return VTK_LINE;\n}\n\n\n\/\/----------------------------------------------------------------------------\nvoid vtkAbstractGraph::GetCellPoints(vtkIdType cellId, vtkIdList* ptIds)\n{\n ptIds->Reset();\n ptIds->InsertNextId(this->GetSourceVertex(cellId));\n ptIds->InsertNextId(this->GetTargetVertex(cellId));\n}\n\nvoid vtkAbstractGraph::GetPointCells(vtkIdType ptId, vtkIdList* cellIds)\n{\n cellIds->Reset();\n vtkGraphIdList* graphIds = vtkGraphIdList::New();\n this->GetIncidentEdges(ptId, graphIds);\n for (vtkIdType i = 0; i < graphIds->GetNumberOfIds(); i++)\n {\n cellIds->InsertNextId(graphIds->GetId(i));\n }\n}\n\n\/\/----------------------------------------------------------------------------\nvtkAbstractGraph* vtkAbstractGraph::GetData(vtkInformation* info)\n{\n return info? vtkAbstractGraph::SafeDownCast(info->Get(DATA_OBJECT())) : 0;\n}\n\n\/\/----------------------------------------------------------------------------\nvtkAbstractGraph* vtkAbstractGraph::GetData(vtkInformationVector* v, int i)\n{\n return vtkAbstractGraph::GetData(v->GetInformationObject(i));\n}\n\n<commit_msg>BUG: vtkAbstractGraph Initialize() should call parent class's Initialize().<commit_after>\/*=========================================================================\n\n Program: Visualization Toolkit\n Module: vtkAbstractGraph.cxx\n\n Copyright (c) Ken Martin, Will Schroeder, Bill Lorensen\n All rights reserved.\n See Copyright.txt or http:\/\/www.kitware.com\/Copyright.htm for details.\n\n This software is distributed WITHOUT ANY WARRANTY; without even\n the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR\n PURPOSE. See the above copyright notice for more information.\n\n=========================================================================*\/\n\/*----------------------------------------------------------------------------\n Copyright (c) Sandia Corporation\n See Copyright.txt or http:\/\/www.paraview.org\/HTML\/Copyright.html for details.\n----------------------------------------------------------------------------*\/\n\n#include \"vtkAbstractGraph.h\"\n#include \"vtkCellData.h\"\n#include \"vtkGenericCell.h\"\n#include \"vtkGraphIdList.h\"\n#include \"vtkIdList.h\"\n#include \"vtkIdTypeArray.h\"\n#include \"vtkInformation.h\"\n#include \"vtkInformationVector.h\"\n#include \"vtkLine.h\"\n#include \"vtkVertexLinks.h\"\n#include \"vtkPointData.h\"\n#include \"vtkPointLocator.h\"\n#include \"vtkPoints.h\"\n\n#include <vtkstd\/algorithm> \/\/ for sorting\n\n\/\/ \n\/\/ Standard functions\n\/\/\n\ndouble vtkAbstractGraph::DefaultPoint[3] = {0, 0, 0};\n\nvtkCxxRevisionMacro(vtkAbstractGraph, \"1.7\");\n\n\/\/----------------------------------------------------------------------------\nvtkAbstractGraph::vtkAbstractGraph()\n{\n this->Line = vtkLine::New();\n\n this->Information->Set(vtkDataObject::DATA_EXTENT_TYPE(), VTK_PIECES_EXTENT);\n this->Information->Set(vtkDataObject::DATA_PIECE_NUMBER(), -1);\n this->Information->Set(vtkDataObject::DATA_NUMBER_OF_PIECES(), 1);\n this->Information->Set(vtkDataObject::DATA_NUMBER_OF_GHOST_LEVELS(), 0);\n}\n\n\/\/----------------------------------------------------------------------------\nvtkAbstractGraph::~vtkAbstractGraph()\n{\n if (this->Line)\n {\n this->Line->Delete();\n this->Line = NULL;\n }\n}\n\n\/\/----------------------------------------------------------------------------\nvoid vtkAbstractGraph::Initialize()\n{\n this->Superclass::Initialize();\n this->Line->Delete();\n this->Line = vtkLine::New();\n}\n\nvoid vtkAbstractGraph::PrintSelf(ostream& os, vtkIndent indent)\n{\n this->Superclass::PrintSelf(os, indent);\n}\n\n\/\/----------------------------------------------------------------------------\nvoid vtkAbstractGraph::ShallowCopy(vtkDataObject *dataObject)\n{\n \/\/ Do superclass\n this->Superclass::ShallowCopy(dataObject);\n}\n\n\/\/----------------------------------------------------------------------------\nvoid vtkAbstractGraph::DeepCopy(vtkDataObject *dataObject)\n{\n \/\/ Do superclass\n this->Superclass::DeepCopy(dataObject);\n}\n\n\/\/----------------------------------------------------------------------------\ndouble* vtkAbstractGraph::GetPoint(vtkIdType ptId)\n{\n if (this->Points)\n {\n return this->Points->GetPoint(ptId);\n }\n return this->DefaultPoint;\n}\n\n\/\/----------------------------------------------------------------------------\nvoid vtkAbstractGraph::GetPoint(vtkIdType ptId, double x[3])\n{\n if (this->Points)\n {\n this->Points->GetPoint(ptId, x);\n }\n else\n {\n for (int i = 0; i < 3; i++)\n {\n x[i] = this->DefaultPoint[i];\n }\n }\n}\n\n\/\/----------------------------------------------------------------------------\nvtkPoints* vtkAbstractGraph::GetPoints()\n{\n if (!this->Points)\n {\n this->Points = vtkPoints::New();\n }\n if (this->Points->GetNumberOfPoints() != this->GetNumberOfVertices())\n {\n this->Points->SetNumberOfPoints(this->GetNumberOfVertices());\n for (vtkIdType i = 0; i < this->GetNumberOfVertices(); i++)\n {\n this->Points->SetPoint(i, 0, 0, 0);\n }\n }\n return this->Points;\n}\n\n\/\/----------------------------------------------------------------------------\nvtkCell* vtkAbstractGraph::GetCell(vtkIdType cellId)\n{\n double x[3];\n this->GetPoint(this->GetSourceVertex(cellId), x);\n this->Line->Points->SetPoint(0, x);\n this->GetPoint(this->GetTargetVertex(cellId), x);\n this->Line->Points->SetPoint(1, x);\n\n this->Line->PointIds->SetId(0, this->GetSourceVertex(cellId));\n this->Line->PointIds->SetId(1, this->GetTargetVertex(cellId));\n return this->Line;\n}\n\n\/\/----------------------------------------------------------------------------\nvoid vtkAbstractGraph::GetCell(vtkIdType cellId, vtkGenericCell * cell)\n{\n cell->SetCellType(VTK_LINE);\n\n cell->Points->SetNumberOfPoints(2);\n double x[3];\n this->GetPoint(this->GetSourceVertex(cellId), x);\n cell->Points->SetPoint(0, x);\n this->GetPoint(this->GetTargetVertex(cellId), x);\n cell->Points->SetPoint(1, x);\n\n cell->PointIds->SetNumberOfIds(2);\n cell->PointIds->SetId(0, this->GetSourceVertex(cellId));\n cell->PointIds->SetId(1, this->GetTargetVertex(cellId));\n}\n\n\/\/----------------------------------------------------------------------------\nint vtkAbstractGraph::GetCellType(vtkIdType vtkNotUsed(cellId))\n{\n return VTK_LINE;\n}\n\n\n\/\/----------------------------------------------------------------------------\nvoid vtkAbstractGraph::GetCellPoints(vtkIdType cellId, vtkIdList* ptIds)\n{\n ptIds->Reset();\n ptIds->InsertNextId(this->GetSourceVertex(cellId));\n ptIds->InsertNextId(this->GetTargetVertex(cellId));\n}\n\nvoid vtkAbstractGraph::GetPointCells(vtkIdType ptId, vtkIdList* cellIds)\n{\n cellIds->Reset();\n vtkGraphIdList* graphIds = vtkGraphIdList::New();\n this->GetIncidentEdges(ptId, graphIds);\n for (vtkIdType i = 0; i < graphIds->GetNumberOfIds(); i++)\n {\n cellIds->InsertNextId(graphIds->GetId(i));\n }\n}\n\n\/\/----------------------------------------------------------------------------\nvtkAbstractGraph* vtkAbstractGraph::GetData(vtkInformation* info)\n{\n return info? vtkAbstractGraph::SafeDownCast(info->Get(DATA_OBJECT())) : 0;\n}\n\n\/\/----------------------------------------------------------------------------\nvtkAbstractGraph* vtkAbstractGraph::GetData(vtkInformationVector* v, int i)\n{\n return vtkAbstractGraph::GetData(v->GetInformationObject(i));\n}\n\n<|endoftext|>"} {"text":"<commit_before>#include \"Maze.h\"\n\n#include <cstdlib>\n#include <fstream>\n#include <iostream>\n#include <iterator>\n#include <sstream>\n#include <time.h>\n#include <queue>\n#include <vector>\n\n#include \"Constants.h\"\n#include \"Parameters.h\"\n#include \"Tile.h\"\n\nnamespace sim {\n\nMaze::Maze(int width, int height, std::string mazeFileDirPath, std::string mazeFile) {\n\n \/\/ Misc errand - seed the random number generator\n srand(time(NULL));\n \n \/\/ Initialize the tile positions\n for (int x = 0; x < width; x++){\n std::vector<Tile> col;\n for (int y = 0; y < height; y++){\n Tile tile;\n tile.setPos(x, y);\n col.push_back(tile);\n }\n m_maze.push_back(col);\n }\n \n \/\/ Initialize the tile wall values and tile neighbors by either loading\n \/\/ an existing maze file or randomly generating a valid maze\n if (mazeFile == \"\") {\n\n std::cout << \"No maze file provided. Generating random maze...\" << std::endl;\n\n randomize();\n while (!(solveShortestPath().at(0) && solveShortestPath().at(1))) {\n randomize();\n }\n\n \/\/ Optional - can be used to generate more maze files\n saveMaze(mazeFileDirPath += \"\/auto_generated_maze.maz\");\n }\n else {\n\n \/\/ Complete path to the given mazefile\n std::string path = mazeFileDirPath += mazeFile;\n\n \/\/ Check to see if the file exists\n std::fstream file(path.c_str());\n\n if (file){\n\n \/\/ Load the maze given by mazefile\n loadMaze(path);\n\n \/\/ Ensures that the maze is solvable\n if (!solveShortestPath().at(0)){\n std::cout << \"Unsolvable Maze detected. Generating solvable maze...\" << std::endl;\n while (!(solveShortestPath().at(0) && solveShortestPath().at(1))) {\n randomize();\n }\n }\n }\n else{\n\n \/\/ If the file doesn't exist, generate a random maze file\n std::cout << \"File \\\"\" << path << \"\\\" not found. Generating random maze...\" << std::endl;\n randomize();\n while (!(solveShortestPath().at(0) && solveShortestPath().at(1))){\n randomize();\n }\n }\n }\n \n \/\/ Increment the passes for the starting position\n m_maze.at(0).at(0).incrementPasses();\n}\n\nMaze::~Maze()\n{ }\n\nint Maze::getWidth(){\n return m_maze.size();\n}\n\nint Maze::getHeight(){\n if (m_maze.size() > 0){\n return m_maze.at(0).size();\n }\n return 0;\n}\n\nTile* Maze::getTile(int x, int y){\n return &m_maze.at(x).at(y);\n}\n\nvoid Maze::resetColors(int curX, int curY){\n for (int x = 0; x < getWidth(); x++){\n for (int y = 0; y < getHeight(); y++){\n getTile(x, y)->resetPasses();\n }\n }\n getTile(curX, curY)->incrementPasses();\n}\n\nvoid Maze::randomize(){\n \n \/\/ Declare width and height locally to reduce function calls\n int width = getWidth();\n int height = getHeight();\n\n \/\/ Percentage chance any one wall will exist\n float wallProb = 0.40;\n\n for (int x = 0; x < width; x++){\n for (int y = 0; y < height; y++){\n for (int k = 0; k < 4; k++){\n bool wallExists = (rand() <= (RAND_MAX * wallProb));\n switch (k){\n case NORTH:\n if (y + 1 < height){\n getTile(x, y+1)->setWall(SOUTH, wallExists);\n getTile(x, y)->setWall(NORTH, wallExists);\n }\n else {\n getTile(x, y)->setWall(NORTH, true);\n }\n break;\n case EAST:\n if (x + 1 < width){\n getTile(x+1, y)->setWall(WEST, wallExists);\n getTile(x, y)->setWall(EAST, wallExists);\n }\n else {\n getTile(x, y)->setWall(EAST, true);\n }\n break;\n case SOUTH:\n if (y > 0){\n getTile(x, y-1)->setWall(NORTH, wallExists);\n getTile(x, y)->setWall(SOUTH, wallExists);\n }\n else {\n getTile(x, y)->setWall(SOUTH, true);\n }\n break;\n case WEST:\n if (x > 0){\n getTile(x-1, y)->setWall(EAST, wallExists);\n getTile(x, y)->setWall(WEST, wallExists);\n }\n else {\n getTile(x, y)->setWall(WEST, true);\n }\n break;\n }\n }\n }\n }\n\n\tfor (int x = 0; x < width-1; x++){ \/\/ Go Through all the pegs and make sure at least one wall\n\t\t\t\t\t\t\t\t\t \/\/ exists per peg. Makes the maze more regulation compliant\n\t\tfor (int y = 0; y < height-1; y++){\n\t\t\tif (!getTile(x, y)->isWall(NORTH) &&\n\t\t\t\t!getTile(x, y)->isWall(EAST) &&\t\t\t\/\/ If wall does not exist up, down, left, right\n\t\t\t\t!getTile(x + 1, y + 1)->isWall(WEST) && \/\/ from peg, add a peg in a random direction\n\t\t\t\t!getTile(x + 1, y + 1)->isWall(SOUTH)){\n\t\t\t\tswitch (rand() \/ (RAND_MAX \/ 4 + 1)){\n\t\t\t\t\tcase NORTH:\n\t\t\t\t\t\tgetTile(x+1, y+1)->setWall(WEST, 1);\n\t\t\t\t\t\tgetTile(x, y + 1)->setWall(EAST, 1);\n\t\t\t\t\t\tbreak;\n\t\t\t\t\tcase EAST:\n\t\t\t\t\t\tgetTile(x + 1, y + 1)->setWall(SOUTH, 1);\n\t\t\t\t\t\tgetTile(x + 1, y)->setWall(NORTH, 1);\n\t\t\t\t\t\tbreak;\n\t\t\t\t\tcase SOUTH:\n\t\t\t\t\t\tgetTile(x,y)->setWall(EAST, 1);\n\t\t\t\t\t\tgetTile(x+1,y)->setWall(WEST, 1);\n\t\t\t\t\t\tbreak;\n\t\t\t\t\tcase WEST:\n\t\t\t\t\t\tgetTile(x, y)->setWall(NORTH, 1);\n\t\t\t\t\t\tgetTile(x, y + 1)->setWall(SOUTH, 1);\n\t\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\n \/\/ Ensures that the middle is hallowed out\n if (width % 2 == 0){\n if (height % 2 == 0){\n getTile(width\/2-1, height\/2-1)->setWall(NORTH, false);\n getTile(width\/2-1, height\/2)->setWall(SOUTH, false);\n getTile(width\/2, height\/2-1)->setWall(NORTH, false);\n getTile(width\/2, height\/2)->setWall(SOUTH, false);\n getTile(width\/2-1, height\/2-1)->setWall(EAST, false);\n getTile(width\/2, height\/2-1)->setWall(WEST, false);\n }\n getTile(width\/2-1, height\/2)->setWall(EAST, false);\n getTile(width\/2, height\/2)->setWall(WEST, false);\n \n }\n if (height % 2 == 0){\n getTile(width\/2, height\/2-1)->setWall(NORTH, false);\n getTile(width\/2, height\/2)->setWall(SOUTH, false);\n }\n\n \/\/ Once the walls are assigned, we can assign neighbors\n assignNeighbors();\n}\n\nvoid Maze::saveMaze(std::string mazeFile){\n \n \/\/ Create the stream\n std::ofstream file(mazeFile.c_str());\n\n if (file.is_open()){\n\n \/\/ Very primitive, but will work\n for (int x = 0; x < getWidth(); x++){\n for (int y = 0; y < getHeight(); y++){\n file << x << \" \" << y;\n for (int k = 0; k < 4; k++){\n file << \" \" << (getTile(x, y)->isWall(k) ? 1 : 0);\n }\n file << std::endl;\n }\n }\n\n file.close();\n }\n}\n\nvoid Maze::loadMaze(std::string mazeFile){\n\n \/\/ Create the stream\n std::ifstream file(mazeFile.c_str());\n\n \/\/ Initialize a string variable\n std::string line(\"\");\n\n if (file.is_open()){\n\n \/\/ Very primitive, but will work\n while (getline(file, line)){\n std::istringstream iss(line);\n std::vector<std::string> tokens;\n copy(std::istream_iterator<std::string>(iss), std::istream_iterator<std::string>(),\n std::back_inserter<std::vector<std::string> >(tokens));\n for (int i = 0; i < 4; i++){ \/\/ Set the values of all of the walls\n getTile(atoi(tokens.at(0).c_str()), atoi(tokens.at(1).c_str()))\n ->setWall(i, atoi(tokens.at(2+i).c_str()));\n }\n }\n \n file.close();\n\n \/\/ Once the walls are assigned, we can assign neighbors\n assignNeighbors();\n }\n}\n\nvoid Maze::assignNeighbors(){\n for (int x = 0; x < getWidth(); x++){\n for (int y = 0; y < getHeight(); y++){\n\n Tile* tile = getTile(x, y);\n\n \/\/ First we ensure that we have a fresh (empty) list\n tile->resetNeighbors();\n\n \/\/ Then we assign new neighbors\n if (!tile->isWall(NORTH)){\n tile->addNeighbor(getTile(x, y+1));\n }\n if (!tile->isWall(EAST)){\n tile->addNeighbor(getTile(x+1, y));\n }\n if (!tile->isWall(SOUTH)){\n tile->addNeighbor(getTile(x, y-1));\n }\n if (!tile->isWall(WEST)){\n tile->addNeighbor(getTile(x-1, y));\n }\n } \n } \n}\n\nvoid Maze::printDistances(){\n std::cout << std::endl;\n for (int y = getHeight()-1; y >= 0; y--){\n for (int x = 0; x < getWidth(); x++){\n if (getTile(x, y)->getDistance() < 100){\n std::cout << \" \";\n if (getTile(x, y)->getDistance() < 10){\n std::cout << \" \";\n }\n }\n std::cout << getTile(x, y)->getDistance() << \" \";\n }\n std::cout << std::endl;\n }\n}\n\nstd::vector<bool> Maze::solveShortestPath(){\n\n \/\/ Solves the maze, assigns tiles that are part of the shortest path\n std::vector<Tile*> sp = findPathToCenter();\n for (int i = 0; i < sp.size(); i++){\n getTile(sp.at(i)->getX(), sp.at(i)->getY())->setPosp(true);\n }\n\n \/\/ Returns whether or not the maze is solvable and whether or not\n \/\/ it satisfies the minimum number of steps\n std::vector<bool> conditions;\n conditions.push_back(getClosestCenterTile()->getDistance() < MAX_DISTANCE);\n conditions.push_back(getClosestCenterTile()->getDistance() > MIN_MAZE_STEPS);\n return conditions;\n}\n\nstd::vector<Tile*> Maze::findPath(int x1, int y1, int x2, int y2){\n setDistancesFrom(x1, x2);\n return backtrace(getTile(x2, y2));\n}\n\nstd::vector<Tile*> Maze::findPathToCenter(){\n setDistancesFrom(0, 0);\n return backtrace(getClosestCenterTile());\n}\n\nstd::vector<Tile*> Maze::backtrace(Tile* end){\n\n \/\/ The vector to hold the solution nodes\n std::vector<Tile*> path;\n\n \/\/ Start at the ending node and simply trace back through the values\n std::queue<Tile*> queue;\n queue.push(end);\n path.push_back(end);\n\n while (!queue.empty()){\n Tile* node = queue.front();\n queue.pop(); \/\/ Removes the element\n std::vector<Tile*> neighbors = node->getNeighbors();\n for (int i = 0; i < neighbors.size(); i++){\n if (neighbors.at(i)->getDistance() == node->getDistance() - 1){\n path.push_back(neighbors.at(i));\n queue.push(neighbors.at(i));\n }\n }\n }\n\n return path;\n}\n\nvoid Maze::setDistancesFrom(int x, int y){\n \n \/\/ Ensure that the nodes are fresh every time this function is called\n for (int x = 0; x < getWidth(); x++){\n for (int y = 0; y < getHeight(); y++){\n Tile* tile = getTile(x, y);\n tile->setDistance(MAX_DISTANCE);\n tile->setExplored(false);\n tile->setPosp(false);\n }\n }\n\n \/\/ Queue for BFS\n std::queue<Tile*> queue;\n queue.push(getTile(x, y));\n getTile(x, y)->setDistance(0);\n getTile(x, y)->setExplored(true);\n\n while (!queue.empty()){\n Tile* node = queue.front();\n queue.pop(); \/\/ Removes the element\n std::vector<Tile*> neighbors = node->getNeighbors();\n for (int i = 0; i < neighbors.size(); i++){\n if (!neighbors.at(i)->getExplored()){\n neighbors.at(i)->setDistance(node->getDistance() + 1); \n queue.push(neighbors.at(i));\n neighbors.at(i)->setExplored(true);\n }\n }\n }\n}\n\nTile* Maze::getClosestCenterTile(){\n\n if (getWidth() > 0 && getHeight() > 0){\n \n int midWidth = getWidth()\/2;\n int midHeight = getHeight()\/2;\n Tile* closest = getTile(midWidth, midHeight);\n\n if (getWidth() % 2 == 0){\n if (getTile(midWidth-1, midHeight)->getDistance() < closest->getDistance()){\n closest = getTile(midWidth-1, midHeight);\n }\n }\n if (getHeight() % 2 == 0){\n if (getTile(midWidth, midHeight-1)->getDistance() < closest->getDistance()){\n closest = getTile(midWidth, midHeight-1);\n }\n }\n if (getWidth() % 2 == 0 && getHeight() % 2 == 0){\n if (getTile(midWidth-1, midHeight-1)->getDistance() < closest->getDistance()){\n closest = getTile(midWidth-1, midHeight-1);\n }\n }\n \n return closest;\n }\n \n \/\/ If either the width or the height is zero return NULL\n return NULL;\n}\n\n} \/\/ namespace sim\n<commit_msg>Made change to be more like surrounding code<commit_after>#include \"Maze.h\"\n\n#include <cstdlib>\n#include <fstream>\n#include <iostream>\n#include <iterator>\n#include <sstream>\n#include <time.h>\n#include <queue>\n#include <vector>\n\n#include \"Constants.h\"\n#include \"Parameters.h\"\n#include \"Tile.h\"\n\nnamespace sim {\n\nMaze::Maze(int width, int height, std::string mazeFileDirPath, std::string mazeFile) {\n\n \/\/ Misc errand - seed the random number generator\n srand(time(NULL));\n \n \/\/ Initialize the tile positions\n for (int x = 0; x < width; x++){\n std::vector<Tile> col;\n for (int y = 0; y < height; y++){\n Tile tile;\n tile.setPos(x, y);\n col.push_back(tile);\n }\n m_maze.push_back(col);\n }\n \n \/\/ Initialize the tile wall values and tile neighbors by either loading\n \/\/ an existing maze file or randomly generating a valid maze\n if (mazeFile == \"\") {\n\n std::cout << \"No maze file provided. Generating random maze...\" << std::endl;\n\n randomize();\n while (!(solveShortestPath().at(0) && solveShortestPath().at(1))) {\n randomize();\n }\n\n \/\/ Optional - can be used to generate more maze files\n saveMaze(mazeFileDirPath += \"\/auto_generated_maze.maz\");\n }\n else {\n\n \/\/ Complete path to the given mazefile\n std::string path = mazeFileDirPath += mazeFile;\n\n \/\/ Check to see if the file exists\n std::fstream file(path.c_str());\n\n if (file){\n\n \/\/ Load the maze given by mazefile\n loadMaze(path);\n\n \/\/ Ensures that the maze is solvable\n if (!solveShortestPath().at(0)){\n std::cout << \"Unsolvable Maze detected. Generating solvable maze...\" << std::endl;\n while (!(solveShortestPath().at(0) && solveShortestPath().at(1))) {\n randomize();\n }\n }\n }\n else{\n\n \/\/ If the file doesn't exist, generate a random maze file\n std::cout << \"File \\\"\" << path << \"\\\" not found. Generating random maze...\" << std::endl;\n randomize();\n while (!(solveShortestPath().at(0) && solveShortestPath().at(1))){\n randomize();\n }\n }\n }\n \n \/\/ Increment the passes for the starting position\n m_maze.at(0).at(0).incrementPasses();\n}\n\nMaze::~Maze()\n{ }\n\nint Maze::getWidth(){\n return m_maze.size();\n}\n\nint Maze::getHeight(){\n if (m_maze.size() > 0){\n return m_maze.at(0).size();\n }\n return 0;\n}\n\nTile* Maze::getTile(int x, int y){\n return &m_maze.at(x).at(y);\n}\n\nvoid Maze::resetColors(int curX, int curY){\n for (int x = 0; x < getWidth(); x++){\n for (int y = 0; y < getHeight(); y++){\n getTile(x, y)->resetPasses();\n }\n }\n getTile(curX, curY)->incrementPasses();\n}\n\nvoid Maze::randomize(){\n \n \/\/ Declare width and height locally to reduce function calls\n int width = getWidth();\n int height = getHeight();\n\n \/\/ Percentage chance any one wall will exist\n float wallProb = 0.40;\n\n for (int x = 0; x < width; x++){\n for (int y = 0; y < height; y++){\n for (int k = 0; k < 4; k++){\n bool wallExists = (rand() <= (RAND_MAX * wallProb));\n switch (k){\n case NORTH:\n if (y + 1 < height){\n getTile(x, y+1)->setWall(SOUTH, wallExists);\n getTile(x, y)->setWall(NORTH, wallExists);\n }\n else {\n getTile(x, y)->setWall(NORTH, true);\n }\n break;\n case EAST:\n if (x + 1 < width){\n getTile(x+1, y)->setWall(WEST, wallExists);\n getTile(x, y)->setWall(EAST, wallExists);\n }\n else {\n getTile(x, y)->setWall(EAST, true);\n }\n break;\n case SOUTH:\n if (y > 0){\n getTile(x, y-1)->setWall(NORTH, wallExists);\n getTile(x, y)->setWall(SOUTH, wallExists);\n }\n else {\n getTile(x, y)->setWall(SOUTH, true);\n }\n break;\n case WEST:\n if (x > 0){\n getTile(x-1, y)->setWall(EAST, wallExists);\n getTile(x, y)->setWall(WEST, wallExists);\n }\n else {\n getTile(x, y)->setWall(WEST, true);\n }\n break;\n }\n }\n }\n }\n\n\tfor (int x = 0; x < width-1; x++){ \/\/ Go Through all the pegs and make sure at least one wall\n\t\t\t\t\t\t\t\t\t \/\/ exists per peg. Makes the maze more regulation compliant\n\t\tfor (int y = 0; y < height-1; y++){\n\t\t\tif (!getTile(x, y)->isWall(NORTH) &&\n\t\t\t\t!getTile(x, y)->isWall(EAST) &&\t\t\t\/\/ If wall does not exist up, down, left, right\n\t\t\t\t!getTile(x + 1, y + 1)->isWall(WEST) && \/\/ from peg, add a peg in a random direction\n\t\t\t\t!getTile(x + 1, y + 1)->isWall(SOUTH)){\n\t\t\t\tswitch (rand() \/ (RAND_MAX \/ 4 + 1)){\n\t\t\t\t\tcase NORTH:\n\t\t\t\t\t\tgetTile(x + 1, y + 1)->setWall(WEST, true);\n\t\t\t\t\t\tgetTile(x, y + 1)->setWall(EAST, true);\n\t\t\t\t\t\tbreak;\n\t\t\t\t\tcase EAST:\n\t\t\t\t\t\tgetTile(x + 1, y + 1)->setWall(SOUTH, true);\n\t\t\t\t\t\tgetTile(x + 1, y)->setWall(NORTH, true);\n\t\t\t\t\t\tbreak;\n\t\t\t\t\tcase SOUTH:\n\t\t\t\t\t\tgetTile(x,y)->setWall(EAST, true);\n\t\t\t\t\t\tgetTile(x + 1,y)->setWall(WEST, true);\n\t\t\t\t\t\tbreak;\n\t\t\t\t\tcase WEST:\n\t\t\t\t\t\tgetTile(x, y)->setWall(NORTH, true);\n\t\t\t\t\t\tgetTile(x, y + 1)->setWall(SOUTH, true);\n\t\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\n \/\/ Ensures that the middle is hallowed out\n if (width % 2 == 0){\n if (height % 2 == 0){\n getTile(width\/2-1, height\/2-1)->setWall(NORTH, false);\n getTile(width\/2-1, height\/2)->setWall(SOUTH, false);\n getTile(width\/2, height\/2-1)->setWall(NORTH, false);\n getTile(width\/2, height\/2)->setWall(SOUTH, false);\n getTile(width\/2-1, height\/2-1)->setWall(EAST, false);\n getTile(width\/2, height\/2-1)->setWall(WEST, false);\n }\n getTile(width\/2-1, height\/2)->setWall(EAST, false);\n getTile(width\/2, height\/2)->setWall(WEST, false);\n \n }\n if (height % 2 == 0){\n getTile(width\/2, height\/2-1)->setWall(NORTH, false);\n getTile(width\/2, height\/2)->setWall(SOUTH, false);\n }\n\n \/\/ Once the walls are assigned, we can assign neighbors\n assignNeighbors();\n}\n\nvoid Maze::saveMaze(std::string mazeFile){\n \n \/\/ Create the stream\n std::ofstream file(mazeFile.c_str());\n\n if (file.is_open()){\n\n \/\/ Very primitive, but will work\n for (int x = 0; x < getWidth(); x++){\n for (int y = 0; y < getHeight(); y++){\n file << x << \" \" << y;\n for (int k = 0; k < 4; k++){\n file << \" \" << (getTile(x, y)->isWall(k) ? 1 : 0);\n }\n file << std::endl;\n }\n }\n\n file.close();\n }\n}\n\nvoid Maze::loadMaze(std::string mazeFile){\n\n \/\/ Create the stream\n std::ifstream file(mazeFile.c_str());\n\n \/\/ Initialize a string variable\n std::string line(\"\");\n\n if (file.is_open()){\n\n \/\/ Very primitive, but will work\n while (getline(file, line)){\n std::istringstream iss(line);\n std::vector<std::string> tokens;\n copy(std::istream_iterator<std::string>(iss), std::istream_iterator<std::string>(),\n std::back_inserter<std::vector<std::string> >(tokens));\n for (int i = 0; i < 4; i++){ \/\/ Set the values of all of the walls\n getTile(atoi(tokens.at(0).c_str()), atoi(tokens.at(1).c_str()))\n ->setWall(i, atoi(tokens.at(2+i).c_str()));\n }\n }\n \n file.close();\n\n \/\/ Once the walls are assigned, we can assign neighbors\n assignNeighbors();\n }\n}\n\nvoid Maze::assignNeighbors(){\n for (int x = 0; x < getWidth(); x++){\n for (int y = 0; y < getHeight(); y++){\n\n Tile* tile = getTile(x, y);\n\n \/\/ First we ensure that we have a fresh (empty) list\n tile->resetNeighbors();\n\n \/\/ Then we assign new neighbors\n if (!tile->isWall(NORTH)){\n tile->addNeighbor(getTile(x, y+1));\n }\n if (!tile->isWall(EAST)){\n tile->addNeighbor(getTile(x+1, y));\n }\n if (!tile->isWall(SOUTH)){\n tile->addNeighbor(getTile(x, y-1));\n }\n if (!tile->isWall(WEST)){\n tile->addNeighbor(getTile(x-1, y));\n }\n } \n } \n}\n\nvoid Maze::printDistances(){\n std::cout << std::endl;\n for (int y = getHeight()-1; y >= 0; y--){\n for (int x = 0; x < getWidth(); x++){\n if (getTile(x, y)->getDistance() < 100){\n std::cout << \" \";\n if (getTile(x, y)->getDistance() < 10){\n std::cout << \" \";\n }\n }\n std::cout << getTile(x, y)->getDistance() << \" \";\n }\n std::cout << std::endl;\n }\n}\n\nstd::vector<bool> Maze::solveShortestPath(){\n\n \/\/ Solves the maze, assigns tiles that are part of the shortest path\n std::vector<Tile*> sp = findPathToCenter();\n for (int i = 0; i < sp.size(); i++){\n getTile(sp.at(i)->getX(), sp.at(i)->getY())->setPosp(true);\n }\n\n \/\/ Returns whether or not the maze is solvable and whether or not\n \/\/ it satisfies the minimum number of steps\n std::vector<bool> conditions;\n conditions.push_back(getClosestCenterTile()->getDistance() < MAX_DISTANCE);\n conditions.push_back(getClosestCenterTile()->getDistance() > MIN_MAZE_STEPS);\n return conditions;\n}\n\nstd::vector<Tile*> Maze::findPath(int x1, int y1, int x2, int y2){\n setDistancesFrom(x1, x2);\n return backtrace(getTile(x2, y2));\n}\n\nstd::vector<Tile*> Maze::findPathToCenter(){\n setDistancesFrom(0, 0);\n return backtrace(getClosestCenterTile());\n}\n\nstd::vector<Tile*> Maze::backtrace(Tile* end){\n\n \/\/ The vector to hold the solution nodes\n std::vector<Tile*> path;\n\n \/\/ Start at the ending node and simply trace back through the values\n std::queue<Tile*> queue;\n queue.push(end);\n path.push_back(end);\n\n while (!queue.empty()){\n Tile* node = queue.front();\n queue.pop(); \/\/ Removes the element\n std::vector<Tile*> neighbors = node->getNeighbors();\n for (int i = 0; i < neighbors.size(); i++){\n if (neighbors.at(i)->getDistance() == node->getDistance() - 1){\n path.push_back(neighbors.at(i));\n queue.push(neighbors.at(i));\n }\n }\n }\n\n return path;\n}\n\nvoid Maze::setDistancesFrom(int x, int y){\n \n \/\/ Ensure that the nodes are fresh every time this function is called\n for (int x = 0; x < getWidth(); x++){\n for (int y = 0; y < getHeight(); y++){\n Tile* tile = getTile(x, y);\n tile->setDistance(MAX_DISTANCE);\n tile->setExplored(false);\n tile->setPosp(false);\n }\n }\n\n \/\/ Queue for BFS\n std::queue<Tile*> queue;\n queue.push(getTile(x, y));\n getTile(x, y)->setDistance(0);\n getTile(x, y)->setExplored(true);\n\n while (!queue.empty()){\n Tile* node = queue.front();\n queue.pop(); \/\/ Removes the element\n std::vector<Tile*> neighbors = node->getNeighbors();\n for (int i = 0; i < neighbors.size(); i++){\n if (!neighbors.at(i)->getExplored()){\n neighbors.at(i)->setDistance(node->getDistance() + 1); \n queue.push(neighbors.at(i));\n neighbors.at(i)->setExplored(true);\n }\n }\n }\n}\n\nTile* Maze::getClosestCenterTile(){\n\n if (getWidth() > 0 && getHeight() > 0){\n \n int midWidth = getWidth()\/2;\n int midHeight = getHeight()\/2;\n Tile* closest = getTile(midWidth, midHeight);\n\n if (getWidth() % 2 == 0){\n if (getTile(midWidth-1, midHeight)->getDistance() < closest->getDistance()){\n closest = getTile(midWidth-1, midHeight);\n }\n }\n if (getHeight() % 2 == 0){\n if (getTile(midWidth, midHeight-1)->getDistance() < closest->getDistance()){\n closest = getTile(midWidth, midHeight-1);\n }\n }\n if (getWidth() % 2 == 0 && getHeight() % 2 == 0){\n if (getTile(midWidth-1, midHeight-1)->getDistance() < closest->getDistance()){\n closest = getTile(midWidth-1, midHeight-1);\n }\n }\n \n return closest;\n }\n \n \/\/ If either the width or the height is zero return NULL\n return NULL;\n}\n\n} \/\/ namespace sim\n<|endoftext|>"} {"text":"<commit_before>\/**\n * \\file dcs\/system\/posix_process.hpp\n *\n * \\brief Class to create and manage a process in POSIX-compliant systems.\n *\n * \\author Marco Guazzone (marco.guazzone@gmail.com)\n *\n * <hr\/>\n *\n * Copyright (C) 2012 Marco Guazzone\n * [Distributed Computing System (DCS) Group,\n * Computer Science Institute,\n * Department of Science and Technological Innovation,\n * University of Piemonte Orientale,\n * Alessandria (Italy)]\n *\n * This file is part of dcsxx-commons.\n *\n * dcsxx-commons is free software: you can redistribute it and\/or modify\n * it under the terms of the GNU General Public License as published\n * by the Free Software Foundation, either version 3 of the License, or\n * (at your option) any later version.\n *\n * dcsxx-commons is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the\n * GNU General Public License for more details.\n *\n * You should have received a copy of the GNU General Public License\n * along with dcsxx-commons. If not, see <http:\/\/www.gnu.org\/licenses\/>.\n *\/\n\n#ifndef DCS_SYSTEM_POSIX_PROCESS_HPP\n#define DCS_SYSTEM_POSIX_PROCESS_HPP\n\n\n\/\/TODO: How to check for a POSIX-compliant system?\n\/\/\n\/\/FIXME: It seems this is not the best way to check for a POSIX-compliant system\n\/\/#if _POSIX_C_SOURCE < 1 && !_XOPEN_SOURCE && !_POSIX_SOURCE\n\/\/# error \"Unable to find a POSIX compliant system.\"\n\/\/#endif \/\/ _POSIX_C_SOURCE\n\n\n#include <cerrno>\n#include <cstddef>\n#include <cstring>\n#include <dcs\/debug.hpp>\n#include <dcs\/exception.hpp>\n#include <dcs\/logging.hpp>\n#include <dcs\/system\/process_status_category.hpp>\n#include <fcntl.h>\n#include <iterator>\n#include <sstream>\n#include <stdexcept>\n#include <string>\n#include <sys\/resource.h>\n#include <sys\/time.h>\n#include <sys\/types.h>\n#include <sys\/wait.h>\n#include <unistd.h>\n#include <vector>\n\n\n\nnamespace dcs { namespace system {\n\nclass posix_process\n{\n\tprivate: static const unsigned int zzz_secs_ = 5;\n\n\n\tpublic: explicit posix_process(::std::string const& cmd)\n\t: cmd_(cmd),\n\/\/\t args_(),\n\t async_(false),\n\t pid_(-1),\n\t status_(undefined_process_status),\n\t sig_(-1),\n\t exit_status_(EXIT_SUCCESS)\n\t{\n\t}\n\n\/\/\tpublic: template <typename FwdIterT>\n\/\/\t\t\tposix_process(::std::string const& cmd, FwdIterT arg_first, FwdIterT arg_last)\n\/\/\t: cmd_(cmd),\n\/\/\t args_(arg_first, arg_last),\n\/\/\t async_(false),\n\/\/\t status_(undefined_status),\n\/\/\t sig_(-1),\n\/\/\t exit_status_(EXIT_SUCCESS)\n\/\/\t{\n\/\/\t}\n\n\tpublic: ~posix_process()\n\t{\n\t\t\/\/ Wait for child termination to prevent zombies\n\t\ttry\n\t\t{\n\t\t\tthis->wait();\n\t\t}\n\t\tcatch (...)\n\t\t{\n\t\t\t::std::ostringstream oss;\n\t\t\toss << \"Failed to wait for command '\" << cmd_ << \"'\";\n\t\t\tdcs::log_error(DCS_LOGGING_AT, oss.str());\n\t\t}\n\t}\n\n\tpublic: void asynch(bool val)\n\t{\n\t\tasync_ = val;\n\t}\n\n\tpublic: template <typename FwdIterT>\n\t\t\tvoid run(FwdIterT arg_first, FwdIterT arg_last)\n\t{\n\t\t::pid_t pid = ::fork();\n\n\t\tif (pid == -1)\n\t\t{\n\t\t\t::std::ostringstream oss;\n\t\t\toss << \"Call to fork(2) failed for command '\" << cmd_ << \"': \" << ::strerror(errno);\n\n\t\t\tDCS_EXCEPTION_THROW(::std::runtime_error, oss.str());\n\t\t}\n\n\t\tif (pid == 0)\n\t\t{\n\t\t\t\/\/ The child\n\n\t\t\t\/\/ Get the maximum number of files this process is allowed to open\n#if defined(F_MAXFD)\n\t\t\tint maxdescs = ::fcntl(-1, F_MAXFD, 0);\n\t\t\tif (maxdescs == -1)\n\t\t\t{\n# if defined(_SC_OPEN_MAX)\n \tmaxdescs = ::sysconf(_SC_OPEN_MAX);\n# else \/\/ _SC_OPEN_MAX\n\t\t\t\t::rlimit limit;\n\t\t\t\tif (::getrlimit(RLIMIT_NOFILE, &limit) < 0)\n\t\t\t\t{\n\t\t\t\t\t::std::ostringstream oss;\n\t\t\t\t\toss << \"Call to getrlimit(2) failed for command '\" << cmd_ << \"': \" << ::strerror(errno);\n\n\t\t\t\t\tDCS_EXCEPTION_THROW(::std::runtime_error, oss.str());\n\t\t\t\t}\n\t\t\t\tmaxdescs = limit.rlim_cur;\n# endif \/\/ _SC_OPEN_MAX\n\t\t\t}\n#else \/\/ F_MAXFD\n# if defined(_SC_OPEN_MAX)\n\t\t\tint maxdescs = ::sysconf(_SC_OPEN_MAX);\n# else \/\/ _SC_OPEN_MAX\n\t\t\t::rlimit limit;\n\t\t\tif (::getrlimit(RLIMIT_NOFILE, &limit) < 0)\n\t\t\t{\n\t\t\t\t::std::ostringstream oss;\n\t\t\t\toss << \"Call to getrlimit(2) failed for command '\" << cmd_ << \"': \" << ::strerror(errno);\n\n\t\t\t\tDCS_EXCEPTION_THROW(::std::runtime_error, oss.str());\n\t\t\t}\n\t\t\tmaxdescs = limit.rlim_cur;\n# endif \/\/ _SC_OPEN_MAX\n#endif \/\/ F_MAXFD\n\t\t\tif (maxdescs == -1)\n\t\t\t{\n\t\t\t\tmaxdescs = 1024;\n\t\t\t}\n\n\t\t\t\/\/ Check if the command already has path information\n\t\t\t::std::string cmd_path;\n\t\t\t::std::string cmd_name;\n\t\t\ttypename ::std::string::size_type pos;\n\t\t\tpos = cmd_.find_last_of('\/');\n\t\t\tif (pos != ::std::string::npos)\n\t\t\t{\n\t\t\t\tcmd_path = cmd_.substr(0, pos);\n\t\t\t\tcmd_name = cmd_.substr(pos+1);\n\t\t\t}\n\n\n\t\t\t\/\/ Populate the argument list\n\t\t\t::std::size_t nargs = ::std::distance(arg_first, arg_last)+2;\n\t\t\tchar** argv = new char*[nargs];\n\t\t\targv[0] = new char[cmd_name.size()+1];\n\t\t\t::std::strncpy(argv[0], cmd_name.c_str(), cmd_name.size()+1); \/\/ by convention, the first argument is always the command name\n\t\t\t::std::size_t i(1);\n\t\t\twhile (arg_first != arg_last)\n\t\t\t{\n\t\t\t\targv[i] = new char[arg_first->size()+1];\n\t\t\t\t::std::strncpy(argv[i], arg_first->c_str(), arg_first->size()+1);\n\t\t\t\t++arg_first;\n\t\t\t\t++i;\n\t\t\t}\n\t\t\targv[i] = 0; \/\/ The array of pointers must be terminated by a NULL pointer.\n\n\t\t\t\/\/ Close unused file descriptors\n\t\t\tfor (int fd = 0; fd < maxdescs; ++fd)\n\t\t\t{\n#ifdef DCS_DEBUG\n\t\t\t\t\/\/ Keep standard error open for debug\n\t\t\t\tif (fd != STDERR_FILENO)\n\t\t\t\t{\n\t\t\t\t\t::close(fd);\n\t\t\t\t}\n#else \/\/ DCS_DEBUG\n\t\t\t\t::close(fd);\n#endif \/\/ DCS_DEBUG\n\t\t\t}\n\n\t\t\t\/\/ Run the command\n\t\t\t::execvp(cmd_.c_str(), argv);\n\n\t\t\t\/\/ Actually we should delete argv and envp data. As we must not\n\t\t\t\/\/ call any non-async-signal-safe functions though we simply exit.\n\t\t\t::write(STDERR_FILENO, \"execvp() failed\\n\", 17);\n\t\t\t_exit(EXIT_FAILURE);\n\t\t}\n\n\t\t\/\/ The parent\n\n\t\tpid_ = pid;\n\t\tstatus_ = running_process_status;\n\n\t\tif (!async_)\n\t\t{\n\t\t\tthis->wait();\n\t\t}\n\t}\n\n\tpublic: void wait()\n\t{\n\t\tint wstatus;\n\n\t\tif (::waitpid(pid_, &wstatus, WUNTRACED | WCONTINUED) == -1)\n\t\t{\n\t\t\t::std::ostringstream oss;\n\t\t\toss << \"Call to waitpid(2) failed for command '\" << cmd_ << \"': \" << ::strerror(errno);\n\n\t\t\tDCS_EXCEPTION_THROW(::std::runtime_error, oss.str());\n\t\t}\n\n\t\tif (WIFEXITED(wstatus))\n\t\t{\n\t\t\texit_status_ = WEXITSTATUS(wstatus);\n\t\t\tif (exit_status_ != EXIT_SUCCESS)\n\t\t\t{\n\t\t\t\tstatus_ = failed_process_status;\n\n\t\t\t\t::std::ostringstream oss;\n\t\t\t\toss << \"Command '\" << cmd_ << \"' exited with status: \" << exit_status_;\n\t\t\t\tdcs::log_warn(DCS_LOGGING_AT, oss.str());\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\tstatus_ = terminated_process_status;\n\t\t\t}\n\t\t}\n\t\telse if (WIFSTOPPED(wstatus))\n\t\t{\n\t\t\tstatus_ = stopped_process_status;\n\t\t\tsig_ = WSTOPSIG(wstatus);\n\t\t}\n\t\telse if (WIFCONTINUED(wstatus))\n\t\t{\n\t\t\tstatus_ = resumed_process_status;\n\t\t}\n\t\telse if (WIFSIGNALED(wstatus))\n\t\t{\n\t\t\tsig_ = WTERMSIG(wstatus);\n\t\t\tstatus_ = aborted_process_status;\n\n\t\t\t::std::ostringstream oss;\n\t\t\toss << \"Command '\" << cmd_ << \"' signaled with signal: \" << sig_;\n\t\t\tdcs::log_warn(DCS_LOGGING_AT, oss.str());\n\t\t}\n\t\telse\n\t\t{\n\t\t\tstatus_ = aborted_process_status;\n\n\t\t\t::std::ostringstream oss;\n\t\t\toss << \"Command '\" << cmd_ << \"' failed for an unknown reason\";\n\t\t\tdcs::log_error(DCS_LOGGING_AT, oss.str());\n\t\t}\n\t}\n\n\tpublic: process_status_category status() const\n\t{\n\t\treturn status_;\n\t}\n\n\tpublic: void stop()\n\t{\n\t\t\/\/ pre: process must be running\n\t\tDCS_ASSERT(status_ == running_process_status,\n\t\t\t\t DCS_EXCEPTION_THROW(::std::runtime_error,\n\t\t\t\t\t\t\t\t\t \"Cannot stop a process that is not running\"));\n\n\t\tthis->kill(SIGSTOP);\n\t}\n\n\tpublic: void resume()\n\t{\n\t\t\/\/ pre: process must have been stopped\n\t\tDCS_ASSERT(status_ == stopped_process_status,\n\t\t\t\t DCS_EXCEPTION_THROW(::std::runtime_error,\n\t\t\t\t\t\t\t\t\t \"Cannot resume a process that has not been stopped\"));\n\n\t\tthis->kill(SIGCONT);\n\t}\n\n\tpublic: void terminate()\n\t{\n\t\t\/\/ pre: process must be running\n\t\tDCS_ASSERT(status_ == running_process_status,\n\t\t\t\t DCS_EXCEPTION_THROW(::std::runtime_error,\n\t\t\t\t\t\t\t\t\t \"Cannot stop a process that is not running\"));\n\n\t\tthis->kill(SIGTERM);\n\t\t::sleep(zzz_secs_);\n\t\tif (this->alive())\n\t\t{\n\t\t\tthis->kill(SIGKILL);\n\t\t}\n\t\tthis->wait();\n\t}\n\n\tpublic: bool alive() const\n\t{\n\t\tif (::kill(pid_, 0) == -1)\n\t\t{\n\t\t\tif (errno != ESRCH)\n\t\t\t{\n\t\t\t\t::std::ostringstream oss;\n\t\t\t\toss << \"Call to kill(2) failed for command '\" << cmd_ << \"' and signal 0: \" << ::strerror(errno);\n\n\t\t\t\tDCS_EXCEPTION_THROW(::std::runtime_error, oss.str());\n\t\t\t}\n\n\t\t\treturn false;\n\t\t}\n\n\t\treturn true;\n\t}\n\n\tpublic: void kill(int sig)\n\t{\n\t\t\/\/ pre: sig >= 0\n\t\tDCS_ASSERT(sig >= 0,\n\t\t\t\t DCS_EXCEPTION_THROW(::std::invalid_argument,\n\t\t\t\t\t\t\t\t\t \"Invalid signal number\"));\n\n\t\t\/\/ signal 0 has a special meaning: it can be used to check if a process\n\t\t\/\/ exists without actually sending any signal to it.\n\t\t\/\/ To send such a signal, use method \\c exist.\n\t\tif (sig == 0)\n\t\t{\n\t\t\treturn;\n\t\t}\n\n\t\tif (::kill(pid_, sig) == -1)\n\t\t{\n\t\t\t::std::ostringstream oss;\n\t\t\toss << \"Call to kill(2) failed for command '\" << cmd_ << \"' and signal \" << sig << \": \" << ::strerror(errno);\n\n\t\t\tDCS_EXCEPTION_THROW(::std::runtime_error, oss.str());\n\t\t}\n\n\t\tsig_ = sig;\n\t\tswitch (sig)\n\t\t{\n\t\t\tcase SIGCONT:\n\t\t\t\tstatus_ = resumed_process_status;\n\t\t\t\tbreak;\n\t\t\tcase SIGSTOP:\n\t\t\t\tstatus_ = stopped_process_status;\n\t\t\t\tbreak;\n\t\t\tcase SIGTERM:\n\t\t\tcase SIGKILL:\n\t\t\t\tstatus_ = terminated_process_status;\n\t\t\t\tbreak;\n\t\t\tcase SIGINT:\n\t\t\t\tstatus_ = aborted_process_status;\n\t\t\t\tbreak;\n\t\t\tdefault:\n\t\t\t\t::sleep(zzz_secs_);\n\t\t\t\tif (!this->alive())\n\t\t\t\t{\n\t\t\t\t\tstatus_ = aborted_process_status;\n\t\t\t\t}\n\t\t\t\tbreak;\n\t\t}\n\t}\n\n\n\tprivate: ::std::string cmd_; \/\/\/< The command path\n\/\/\tprivate: ::std::vector< ::std::string > args_; \/\/\/< The list of command arguments\n\tprivate: bool async_; \/\/\/< A \\c true value means that the parent does not block to wait for child termination\n\tprivate: ::pid_t pid_; \/\/\/< The process identifier\n\tprivate: process_status_category status_; \/\/\/< The current status of this process\n\tprivate: int sig_; \/\/\/< The last signal sent to this process\n\tprivate: int exit_status_; \/\/\/< The exit status of this process\n}; \/\/ posix_process\n\n}} \/\/ Namespace dcs::system\n\n\n#endif \/\/ DCS_SYSTEM_POSIX_PROCESS_HPP\n<commit_msg>(change:minor) Improved error message in case of execution failure.<commit_after>\/**\n * \\file dcs\/system\/posix_process.hpp\n *\n * \\brief Class to create and manage a process in POSIX-compliant systems.\n *\n * \\author Marco Guazzone (marco.guazzone@gmail.com)\n *\n * <hr\/>\n *\n * Copyright (C) 2012 Marco Guazzone\n * [Distributed Computing System (DCS) Group,\n * Computer Science Institute,\n * Department of Science and Technological Innovation,\n * University of Piemonte Orientale,\n * Alessandria (Italy)]\n *\n * This file is part of dcsxx-commons.\n *\n * dcsxx-commons is free software: you can redistribute it and\/or modify\n * it under the terms of the GNU General Public License as published\n * by the Free Software Foundation, either version 3 of the License, or\n * (at your option) any later version.\n *\n * dcsxx-commons is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the\n * GNU General Public License for more details.\n *\n * You should have received a copy of the GNU General Public License\n * along with dcsxx-commons. If not, see <http:\/\/www.gnu.org\/licenses\/>.\n *\/\n\n#ifndef DCS_SYSTEM_POSIX_PROCESS_HPP\n#define DCS_SYSTEM_POSIX_PROCESS_HPP\n\n\n\/\/TODO: How to check for a POSIX-compliant system?\n\/\/\n\/\/FIXME: It seems this is not the best way to check for a POSIX-compliant system\n\/\/#if _POSIX_C_SOURCE < 1 && !_XOPEN_SOURCE && !_POSIX_SOURCE\n\/\/# error \"Unable to find a POSIX compliant system.\"\n\/\/#endif \/\/ _POSIX_C_SOURCE\n\n\n#include <cerrno>\n#include <cstddef>\n#include <cstring>\n#include <dcs\/debug.hpp>\n#include <dcs\/exception.hpp>\n#include <dcs\/logging.hpp>\n#include <dcs\/system\/process_status_category.hpp>\n#include <fcntl.h>\n#include <iterator>\n#include <sstream>\n#include <stdexcept>\n#include <string>\n#include <sys\/resource.h>\n#include <sys\/time.h>\n#include <sys\/types.h>\n#include <sys\/wait.h>\n#include <unistd.h>\n#include <vector>\n\n\n\nnamespace dcs { namespace system {\n\nclass posix_process\n{\n\tprivate: static const unsigned int zzz_secs_ = 5;\n\n\n\tpublic: explicit posix_process(::std::string const& cmd)\n\t: cmd_(cmd),\n\/\/\t args_(),\n\t async_(false),\n\t pid_(-1),\n\t status_(undefined_process_status),\n\t sig_(-1),\n\t exit_status_(EXIT_SUCCESS)\n\t{\n\t}\n\n\/\/\tpublic: template <typename FwdIterT>\n\/\/\t\t\tposix_process(::std::string const& cmd, FwdIterT arg_first, FwdIterT arg_last)\n\/\/\t: cmd_(cmd),\n\/\/\t args_(arg_first, arg_last),\n\/\/\t async_(false),\n\/\/\t status_(undefined_status),\n\/\/\t sig_(-1),\n\/\/\t exit_status_(EXIT_SUCCESS)\n\/\/\t{\n\/\/\t}\n\n\tpublic: ~posix_process()\n\t{\n\t\t\/\/ Wait for child termination to prevent zombies\n\t\ttry\n\t\t{\n\t\t\tthis->wait();\n\t\t}\n\t\tcatch (...)\n\t\t{\n\t\t\t::std::ostringstream oss;\n\t\t\toss << \"Failed to wait for command '\" << cmd_ << \"'\";\n\t\t\tdcs::log_error(DCS_LOGGING_AT, oss.str());\n\t\t}\n\t}\n\n\tpublic: void asynch(bool val)\n\t{\n\t\tasync_ = val;\n\t}\n\n\tpublic: template <typename FwdIterT>\n\t\t\tvoid run(FwdIterT arg_first, FwdIterT arg_last)\n\t{\n\t\t::pid_t pid = ::fork();\n\n\t\tif (pid == -1)\n\t\t{\n\t\t\t::std::ostringstream oss;\n\t\t\toss << \"Call to fork(2) failed for command '\" << cmd_ << \"': \" << ::strerror(errno);\n\n\t\t\tDCS_EXCEPTION_THROW(::std::runtime_error, oss.str());\n\t\t}\n\n\t\tif (pid == 0)\n\t\t{\n\t\t\t\/\/ The child\n\n\t\t\t\/\/ Get the maximum number of files this process is allowed to open\n#if defined(F_MAXFD)\n\t\t\tint maxdescs = ::fcntl(-1, F_MAXFD, 0);\n\t\t\tif (maxdescs == -1)\n\t\t\t{\n# if defined(_SC_OPEN_MAX)\n \tmaxdescs = ::sysconf(_SC_OPEN_MAX);\n# else \/\/ _SC_OPEN_MAX\n\t\t\t\t::rlimit limit;\n\t\t\t\tif (::getrlimit(RLIMIT_NOFILE, &limit) < 0)\n\t\t\t\t{\n\t\t\t\t\t::std::ostringstream oss;\n\t\t\t\t\toss << \"Call to getrlimit(2) failed for command '\" << cmd_ << \"': \" << ::strerror(errno);\n\n\t\t\t\t\tDCS_EXCEPTION_THROW(::std::runtime_error, oss.str());\n\t\t\t\t}\n\t\t\t\tmaxdescs = limit.rlim_cur;\n# endif \/\/ _SC_OPEN_MAX\n\t\t\t}\n#else \/\/ F_MAXFD\n# if defined(_SC_OPEN_MAX)\n\t\t\tint maxdescs = ::sysconf(_SC_OPEN_MAX);\n# else \/\/ _SC_OPEN_MAX\n\t\t\t::rlimit limit;\n\t\t\tif (::getrlimit(RLIMIT_NOFILE, &limit) < 0)\n\t\t\t{\n\t\t\t\t::std::ostringstream oss;\n\t\t\t\toss << \"Call to getrlimit(2) failed for command '\" << cmd_ << \"': \" << ::strerror(errno);\n\n\t\t\t\tDCS_EXCEPTION_THROW(::std::runtime_error, oss.str());\n\t\t\t}\n\t\t\tmaxdescs = limit.rlim_cur;\n# endif \/\/ _SC_OPEN_MAX\n#endif \/\/ F_MAXFD\n\t\t\tif (maxdescs == -1)\n\t\t\t{\n\t\t\t\tmaxdescs = 1024;\n\t\t\t}\n\n\t\t\t\/\/ Check if the command already has path information\n\t\t\t::std::string cmd_path;\n\t\t\t::std::string cmd_name;\n\t\t\ttypename ::std::string::size_type pos;\n\t\t\tpos = cmd_.find_last_of('\/');\n\t\t\tif (pos != ::std::string::npos)\n\t\t\t{\n\t\t\t\tcmd_path = cmd_.substr(0, pos);\n\t\t\t\tcmd_name = cmd_.substr(pos+1);\n\t\t\t}\n\n\n\t\t\t\/\/ Populate the argument list\n\t\t\t::std::size_t nargs = ::std::distance(arg_first, arg_last)+2;\n\t\t\tchar** argv = new char*[nargs];\n\t\t\targv[0] = new char[cmd_name.size()+1];\n\t\t\t::std::strncpy(argv[0], cmd_name.c_str(), cmd_name.size()+1); \/\/ by convention, the first argument is always the command name\n\t\t\t::std::size_t i(1);\n\t\t\twhile (arg_first != arg_last)\n\t\t\t{\n\t\t\t\targv[i] = new char[arg_first->size()+1];\n\t\t\t\t::std::strncpy(argv[i], arg_first->c_str(), arg_first->size()+1);\n\t\t\t\t++arg_first;\n\t\t\t\t++i;\n\t\t\t}\n\t\t\targv[i] = 0; \/\/ The array of pointers must be terminated by a NULL pointer.\n\n\t\t\t\/\/ Close unused file descriptors\n\t\t\tfor (int fd = 0; fd < maxdescs; ++fd)\n\t\t\t{\n#ifdef DCS_DEBUG\n\t\t\t\t\/\/ Keep standard error open for debug\n\t\t\t\tif (fd != STDERR_FILENO)\n\t\t\t\t{\n\t\t\t\t\t::close(fd);\n\t\t\t\t}\n#else \/\/ DCS_DEBUG\n\t\t\t\t::close(fd);\n#endif \/\/ DCS_DEBUG\n\t\t\t}\n\n\t\t\t\/\/ Run the command\n\t\t\tDCS_DEBUG_TRACE(\"Going to run: \" << cmd_ << ::dcs::debug::to_string(argv, argv+nargs-1) );\n\t\t\t::execvp(cmd_.c_str(), argv);\n\n\t\t\t\/\/ Actually we should delete argv and envp data. As we must not\n\t\t\t\/\/ call any non-async-signal-safe functions though we simply exit.\n\t\t\t::std::ostringstream oss;\n\t\t\toss << \"Call to execvp(3) failed for command '\" << cmd_ << \"': \" << ::strerror(errno) << ::std::endl;\n\t\t\t::std::size_t count(oss.str().size());\n\t\t\t::write(STDERR_FILENO, oss.str().c_str(), count);\n\t\t\t::_exit(EXIT_FAILURE);\n\t\t}\n\n\t\t\/\/ The parent\n\n\t\tpid_ = pid;\n\t\tstatus_ = running_process_status;\n\n\t\tif (!async_)\n\t\t{\n\t\t\tthis->wait();\n\t\t}\n\t}\n\n\tpublic: void wait()\n\t{\n\t\tint wstatus;\n\n\t\tif (::waitpid(pid_, &wstatus, WUNTRACED | WCONTINUED) == -1)\n\t\t{\n\t\t\t::std::ostringstream oss;\n\t\t\toss << \"Call to waitpid(2) failed for command '\" << cmd_ << \"': \" << ::strerror(errno);\n\n\t\t\tDCS_EXCEPTION_THROW(::std::runtime_error, oss.str());\n\t\t}\n\n\t\tif (WIFEXITED(wstatus))\n\t\t{\n\t\t\texit_status_ = WEXITSTATUS(wstatus);\n\t\t\tif (exit_status_ != EXIT_SUCCESS)\n\t\t\t{\n\t\t\t\tstatus_ = failed_process_status;\n\n\t\t\t\t::std::ostringstream oss;\n\t\t\t\toss << \"Command '\" << cmd_ << \"' exited with status: \" << exit_status_;\n\t\t\t\tdcs::log_warn(DCS_LOGGING_AT, oss.str());\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\tstatus_ = terminated_process_status;\n\t\t\t}\n\t\t}\n\t\telse if (WIFSTOPPED(wstatus))\n\t\t{\n\t\t\tstatus_ = stopped_process_status;\n\t\t\tsig_ = WSTOPSIG(wstatus);\n\t\t}\n\t\telse if (WIFCONTINUED(wstatus))\n\t\t{\n\t\t\tstatus_ = resumed_process_status;\n\t\t}\n\t\telse if (WIFSIGNALED(wstatus))\n\t\t{\n\t\t\tsig_ = WTERMSIG(wstatus);\n\t\t\tstatus_ = aborted_process_status;\n\n\t\t\t::std::ostringstream oss;\n\t\t\toss << \"Command '\" << cmd_ << \"' signaled with signal: \" << sig_;\n\t\t\tdcs::log_warn(DCS_LOGGING_AT, oss.str());\n\t\t}\n\t\telse\n\t\t{\n\t\t\tstatus_ = aborted_process_status;\n\n\t\t\t::std::ostringstream oss;\n\t\t\toss << \"Command '\" << cmd_ << \"' failed for an unknown reason\";\n\t\t\tdcs::log_error(DCS_LOGGING_AT, oss.str());\n\t\t}\n\t}\n\n\tpublic: process_status_category status() const\n\t{\n\t\treturn status_;\n\t}\n\n\tpublic: void stop()\n\t{\n\t\t\/\/ pre: process must be running\n\t\tDCS_ASSERT(status_ == running_process_status,\n\t\t\t\t DCS_EXCEPTION_THROW(::std::runtime_error,\n\t\t\t\t\t\t\t\t\t \"Cannot stop a process that is not running\"));\n\n\t\tthis->kill(SIGSTOP);\n\t}\n\n\tpublic: void resume()\n\t{\n\t\t\/\/ pre: process must have been stopped\n\t\tDCS_ASSERT(status_ == stopped_process_status,\n\t\t\t\t DCS_EXCEPTION_THROW(::std::runtime_error,\n\t\t\t\t\t\t\t\t\t \"Cannot resume a process that has not been stopped\"));\n\n\t\tthis->kill(SIGCONT);\n\t}\n\n\tpublic: void terminate()\n\t{\n\t\t\/\/ pre: process must be running\n\t\tDCS_ASSERT(status_ == running_process_status,\n\t\t\t\t DCS_EXCEPTION_THROW(::std::runtime_error,\n\t\t\t\t\t\t\t\t\t \"Cannot stop a process that is not running\"));\n\n\t\tthis->kill(SIGTERM);\n\t\t::sleep(zzz_secs_);\n\t\tif (this->alive())\n\t\t{\n\t\t\tthis->kill(SIGKILL);\n\t\t}\n\t\tthis->wait();\n\t}\n\n\tpublic: bool alive() const\n\t{\n\t\tif (::kill(pid_, 0) == -1)\n\t\t{\n\t\t\tif (errno != ESRCH)\n\t\t\t{\n\t\t\t\t::std::ostringstream oss;\n\t\t\t\toss << \"Call to kill(2) failed for command '\" << cmd_ << \"' and signal 0: \" << ::strerror(errno);\n\n\t\t\t\tDCS_EXCEPTION_THROW(::std::runtime_error, oss.str());\n\t\t\t}\n\n\t\t\treturn false;\n\t\t}\n\n\t\treturn true;\n\t}\n\n\tpublic: void kill(int sig)\n\t{\n\t\t\/\/ pre: sig >= 0\n\t\tDCS_ASSERT(sig >= 0,\n\t\t\t\t DCS_EXCEPTION_THROW(::std::invalid_argument,\n\t\t\t\t\t\t\t\t\t \"Invalid signal number\"));\n\n\t\t\/\/ signal 0 has a special meaning: it can be used to check if a process\n\t\t\/\/ exists without actually sending any signal to it.\n\t\t\/\/ To send such a signal, use method \\c exist.\n\t\tif (sig == 0)\n\t\t{\n\t\t\treturn;\n\t\t}\n\n\t\tif (::kill(pid_, sig) == -1)\n\t\t{\n\t\t\t::std::ostringstream oss;\n\t\t\toss << \"Call to kill(2) failed for command '\" << cmd_ << \"' and signal \" << sig << \": \" << ::strerror(errno);\n\n\t\t\tDCS_EXCEPTION_THROW(::std::runtime_error, oss.str());\n\t\t}\n\n\t\tsig_ = sig;\n\t\tswitch (sig)\n\t\t{\n\t\t\tcase SIGCONT:\n\t\t\t\tstatus_ = resumed_process_status;\n\t\t\t\tbreak;\n\t\t\tcase SIGSTOP:\n\t\t\t\tstatus_ = stopped_process_status;\n\t\t\t\tbreak;\n\t\t\tcase SIGTERM:\n\t\t\tcase SIGKILL:\n\t\t\t\tstatus_ = terminated_process_status;\n\t\t\t\tbreak;\n\t\t\tcase SIGINT:\n\t\t\t\tstatus_ = aborted_process_status;\n\t\t\t\tbreak;\n\t\t\tdefault:\n\t\t\t\t::sleep(zzz_secs_);\n\t\t\t\tif (!this->alive())\n\t\t\t\t{\n\t\t\t\t\tstatus_ = aborted_process_status;\n\t\t\t\t}\n\t\t\t\tbreak;\n\t\t}\n\t}\n\n\n\tprivate: ::std::string cmd_; \/\/\/< The command path\n\/\/\tprivate: ::std::vector< ::std::string > args_; \/\/\/< The list of command arguments\n\tprivate: bool async_; \/\/\/< A \\c true value means that the parent does not block to wait for child termination\n\tprivate: ::pid_t pid_; \/\/\/< The process identifier\n\tprivate: process_status_category status_; \/\/\/< The current status of this process\n\tprivate: int sig_; \/\/\/< The last signal sent to this process\n\tprivate: int exit_status_; \/\/\/< The exit status of this process\n}; \/\/ posix_process\n\n}} \/\/ Namespace dcs::system\n\n\n#endif \/\/ DCS_SYSTEM_POSIX_PROCESS_HPP\n<|endoftext|>"} {"text":"<commit_before>\/\/ Copyright (C) 2014 Jérôme Leclercq\n\/\/ This file is part of the \"Nazara Engine - Utility module\"\n\/\/ For conditions of distribution and use, see copyright notice in Config.hpp\n\n\/\/ Interface inspirée de la SFML par Laurent Gomila\n\n#pragma once\n\n#ifndef NAZARA_EVENT_HPP\n#define NAZARA_EVENT_HPP\n\n#include <Nazara\/Utility\/Keyboard.hpp>\n#include <Nazara\/Utility\/Mouse.hpp>\n\nstruct NzEvent\n{\n\t\/\/ Utilisé par:\n\t\/\/ -nzEventType_KeyPressed\n\t\/\/ -nzEventType_KeyReleased\n\tstruct KeyEvent\n\t{\n\t\tNzKeyboard::Key code;\n\t\tbool alt;\n\t\tbool control;\n\t\tbool repeated;\n\t\tbool shift;\n\t\tbool system;\n\t};\n\n\t\/\/ Utilisé par:\n\t\/\/ -nzEventType_MouseButtonDoubleClicked\n\t\/\/ -nzEventType_MouseButtonPressed\n\tstruct MouseButtonEvent\n\t{\n\t\tNzMouse::Button button;\n\t\tunsigned int x;\n\t\tunsigned int y;\n\t};\n\n\t\/\/ Utilisé par:\n\t\/\/ -nzEventType_MouseMoved\n\tstruct MouseMoveEvent\n\t{\n\t\tint deltaX;\n\t\tint deltaY;\n\t\tunsigned int x;\n\t\tunsigned int y;\n\t};\n\n\t\/\/ Utilisé par:\n\t\/\/ -nzEventType_MouseWheelMoved\n\tstruct MouseWheelEvent\n\t{\n\t\tfloat delta;\n\t};\n\n\t\/\/ Utilisé par:\n\t\/\/ -nzEventType_Moved\n\tstruct PositionEvent\n\t{\n\t\tint x;\n\t\tint y;\n\t};\n\n\t\/\/ Utilisé par:\n\t\/\/ -nzEventType_Resized\n\tstruct SizeEvent\n\t{\n\t\tunsigned int height;\n\t\tunsigned int width;\n\t};\n\n\t\/\/ Utilisé par:\n\t\/\/ -nzEventType_TextEntered\n\tstruct TextEvent\n\t{\n\t\tbool repeated;\n\t\tchar32_t character;\n\t};\n\n\tnzEventType type;\n\n\tunion\n\t{\n\t\t\/\/ Utilisé par:\n\t\t\/\/ -nzEventType_KeyPressed\n\t\t\/\/ -nzEventType_KeyReleased\n\t\tKeyEvent key;\n\n\t\t\/\/ Utilisé par:\n\t\t\/\/ -nzEventType_MouseButtonDoubleClicked\n\t\t\/\/ -nzEventType_MouseButtonPressed\n\t\tMouseButtonEvent mouseButton;\n\n\t\t\/\/ Utilisé par:\n\t\t\/\/ -nzEventType_MouseMoved\n\t\tMouseMoveEvent mouseMove;\n\n\t\t\/\/ Utilisé par:\n\t\t\/\/ -nzEventType_MouseWheelMoved\n\t\tMouseWheelEvent mouseWheel;\n\n\t\t\/\/ Utilisé par:\n\t\t\/\/ -nzEventType_Moved\n\t\tPositionEvent position;\n\n\t\t\/\/ Utilisé par:\n\t\t\/\/ -nzEventType_Resized\n\t\tSizeEvent size;\n\n\t\t\/\/ Utilisé par:\n\t\t\/\/ -nzEventType_TextEntered\n\t\tTextEvent text;\n\t};\n};\n\n#endif \/\/ NAZARA_EVENT_HPP\n<commit_msg>Fixed missing include<commit_after>\/\/ Copyright (C) 2014 Jérôme Leclercq\n\/\/ This file is part of the \"Nazara Engine - Utility module\"\n\/\/ For conditions of distribution and use, see copyright notice in Config.hpp\n\n\/\/ Interface inspirée de la SFML par Laurent Gomila\n\n#pragma once\n\n#ifndef NAZARA_EVENT_HPP\n#define NAZARA_EVENT_HPP\n\n#include <Nazara\/Utility\/Enums.hpp>\n#include <Nazara\/Utility\/Keyboard.hpp>\n#include <Nazara\/Utility\/Mouse.hpp>\n\nstruct NzEvent\n{\n\t\/\/ Utilisé par:\n\t\/\/ -nzEventType_KeyPressed\n\t\/\/ -nzEventType_KeyReleased\n\tstruct KeyEvent\n\t{\n\t\tNzKeyboard::Key code;\n\t\tbool alt;\n\t\tbool control;\n\t\tbool repeated;\n\t\tbool shift;\n\t\tbool system;\n\t};\n\n\t\/\/ Utilisé par:\n\t\/\/ -nzEventType_MouseButtonDoubleClicked\n\t\/\/ -nzEventType_MouseButtonPressed\n\tstruct MouseButtonEvent\n\t{\n\t\tNzMouse::Button button;\n\t\tunsigned int x;\n\t\tunsigned int y;\n\t};\n\n\t\/\/ Utilisé par:\n\t\/\/ -nzEventType_MouseMoved\n\tstruct MouseMoveEvent\n\t{\n\t\tint deltaX;\n\t\tint deltaY;\n\t\tunsigned int x;\n\t\tunsigned int y;\n\t};\n\n\t\/\/ Utilisé par:\n\t\/\/ -nzEventType_MouseWheelMoved\n\tstruct MouseWheelEvent\n\t{\n\t\tfloat delta;\n\t};\n\n\t\/\/ Utilisé par:\n\t\/\/ -nzEventType_Moved\n\tstruct PositionEvent\n\t{\n\t\tint x;\n\t\tint y;\n\t};\n\n\t\/\/ Utilisé par:\n\t\/\/ -nzEventType_Resized\n\tstruct SizeEvent\n\t{\n\t\tunsigned int height;\n\t\tunsigned int width;\n\t};\n\n\t\/\/ Utilisé par:\n\t\/\/ -nzEventType_TextEntered\n\tstruct TextEvent\n\t{\n\t\tbool repeated;\n\t\tchar32_t character;\n\t};\n\n\tnzEventType type;\n\n\tunion\n\t{\n\t\t\/\/ Utilisé par:\n\t\t\/\/ -nzEventType_KeyPressed\n\t\t\/\/ -nzEventType_KeyReleased\n\t\tKeyEvent key;\n\n\t\t\/\/ Utilisé par:\n\t\t\/\/ -nzEventType_MouseButtonDoubleClicked\n\t\t\/\/ -nzEventType_MouseButtonPressed\n\t\tMouseButtonEvent mouseButton;\n\n\t\t\/\/ Utilisé par:\n\t\t\/\/ -nzEventType_MouseMoved\n\t\tMouseMoveEvent mouseMove;\n\n\t\t\/\/ Utilisé par:\n\t\t\/\/ -nzEventType_MouseWheelMoved\n\t\tMouseWheelEvent mouseWheel;\n\n\t\t\/\/ Utilisé par:\n\t\t\/\/ -nzEventType_Moved\n\t\tPositionEvent position;\n\n\t\t\/\/ Utilisé par:\n\t\t\/\/ -nzEventType_Resized\n\t\tSizeEvent size;\n\n\t\t\/\/ Utilisé par:\n\t\t\/\/ -nzEventType_TextEntered\n\t\tTextEvent text;\n\t};\n};\n\n#endif \/\/ NAZARA_EVENT_HPP\n<|endoftext|>"} {"text":"<commit_before>#pragma once\r\n#include <map>\r\n#include \"string_utils.hpp\"\r\n#include \"request.hpp\"\r\n#include \"utils.hpp\"\r\n#include <boost\/lexical_cast.hpp>\r\nclass token_parser\r\n{\r\n\tstd::vector<std::string> v_; \/\/解析之后，v_的第一个元素为函数名，后面的元素均为参数.\r\n\tstd::map<std::string, std::vector<std::string>> map_;\r\npublic:\r\n\t\/*\r\n\tget(\"\/hello\/:name\", (request, response) -> {\r\n\t\treturn \"Hello: \" + request.params(\":name\");\r\n\t});\r\n\thello\/a\/b->hello\/a\/b();hello\/a(b);hello(a, b);\r\n\t*\/\r\n\t\/\/token_parser(std::string& s, char seperator)\r\n\t\/\/{\r\n\t\/\/\tv_ = StringUtil::split(s, seperator);\r\n\t\/\/}\r\n\r\n\ttoken_parser() = default;\r\n\r\n\tvoid add(const std::string& path, std::vector<std::string>& v)\r\n\t{\r\n\t\tmap_.emplace(path, std::move(v));\r\n\t}\r\n\r\n\tconst std::map<std::string, std::vector<std::string>>& get_map()\r\n\t{\r\n\t\treturn map_;\r\n\t}\r\n\r\n\tvoid parse(cinatra::Request& req, const std::map<std::string, std::vector<std::string>>& kv)\r\n\t{\r\n\t\tstring path = req.path();\r\n \t\tif (kv.empty())\r\n \t\t{\r\n\t\t\tif (path == \"\/\")\r\n\t\t\t{\r\n\t\t\t\tv_.push_back(std::move(path));\r\n\t\t\t\treturn;\r\n\t\t\t}\r\n\r\n \t\t\tv_ = StringUtil::split(path, '\/', 1);\r\n \t\t\treturn;\r\n \t\t}\r\n\r\n\t\tv_.push_back(std::move(path));\r\n\t\tfor (auto it : kv)\r\n\t\t{\r\n\t\t\tif (it.second.size() != req.query().size())\r\n\t\t\t\tcontinue;\r\n\t\t\t\r\n\t\t\tfor (auto& itv : it.second)\r\n\t\t\t{\r\n\t\t\t\tauto& val = req.query().get_val(itv);\r\n\t\t\t\tif (val.empty())\r\n\t\t\t\t\tbreak;\r\n\r\n\t\t\t\tv_.push_back(val);\r\n\t\t\t}\r\n\r\n\t\t\tbreak;\r\n\t\t}\r\n\t}\r\n\r\n\tvoid parse(std::string& params)\r\n\t{\r\n\t\tv_ = StringUtil::split(params, '\/');\r\n\t}\r\n\r\npublic:\r\n\tstd::string get_function_name()\r\n\t{\r\n\t\tif (v_.empty())\r\n\t\t\treturn \"\";\r\n\r\n\t\tauto it = v_.begin();\r\n\t\tstd::string name = *it;\r\n\t\tv_.erase(it);\r\n\t\treturn name;\r\n\t}\r\n\r\n\ttemplate<typename RequestedType>\r\n\tbool get(typename std::decay<RequestedType>::type& param)\r\n\t{\r\n\t\tif (v_.empty())\r\n\t\t{\r\n\t\t\tLOG_DBG << \"Params is invalid \";\r\n\t\t\treturn false;\r\n\t\t}\r\n\r\n\t\ttry\r\n\t\t{\r\n\t\t\ttypedef typename std::decay<RequestedType>::type result_type;\r\n\t\t\tauto const & v = v_.back();\r\n\t\t\tparam = boost::lexical_cast<typename std::decay<result_type>::type>(v);\r\n\t\t\tv_.pop_back();\r\n\t\t\treturn true;\r\n\t\t}\r\n\t\tcatch (std::exception& e)\r\n\t\t{\r\n\t\t\tLOG_DBG << \"Error in param converting: \" << e.what();\r\n\t\t}\r\n\t\treturn false;\r\n\t}\r\n\r\n\tbool empty(){ return v_.empty(); }\r\n\r\n\tsize_t size() const\r\n\t{\r\n\t\treturn v_.size();\r\n\t}\r\n};\r\n<commit_msg>修改parse<commit_after>#pragma once\r\n#include <map>\r\n#include \"string_utils.hpp\"\r\n#include \"request.hpp\"\r\n#include \"utils.hpp\"\r\n#include <boost\/lexical_cast.hpp>\r\nclass token_parser\r\n{\r\n\tstd::vector<std::string> v_; \/\/解析之后，v_的第一个元素为函数名，后面的元素均为参数.\r\n\tstd::map<std::string, std::vector<std::string>> map_;\r\npublic:\r\n\t\/*\r\n\tget(\"\/hello\/:name\", (request, response) -> {\r\n\t\treturn \"Hello: \" + request.params(\":name\");\r\n\t});\r\n\thello\/a\/b->hello\/a\/b();hello\/a(b);hello(a, b);\r\n\t*\/\r\n\t\/\/token_parser(std::string& s, char seperator)\r\n\t\/\/{\r\n\t\/\/\tv_ = StringUtil::split(s, seperator);\r\n\t\/\/}\r\n\r\n\ttoken_parser() = default;\r\n\r\n\tvoid add(const std::string& path, std::vector<std::string>& v)\r\n\t{\r\n\t\tmap_.emplace(path, std::move(v));\r\n\t}\r\n\r\n\tconst std::map<std::string, std::vector<std::string>>& get_map()\r\n\t{\r\n\t\treturn map_;\r\n\t}\r\n\r\n\tvoid parse(cinatra::Request& req, const std::map<std::string, std::vector<std::string>>& kv)\r\n\t{\r\n\t\tstring path = req.path();\r\n \t\tif (kv.empty())\r\n \t\t{\r\n\t\t\tif (path == \"\/\")\r\n\t\t\t{\r\n\t\t\t\tv_.push_back(std::move(path));\r\n\t\t\t\treturn;\r\n\t\t\t}\r\n\r\n\t\t\tif (req.query().empty())\r\n \t\t\t\tv_ = StringUtil::split(path, '\/', 1);\r\n\r\n \t\t\treturn;\r\n \t\t}\r\n\r\n\t\tv_.push_back(std::move(path));\r\n\t\tfor (auto it : kv)\r\n\t\t{\r\n\t\t\tif (it.second.size() != req.query().size())\r\n\t\t\t\tcontinue;\r\n\t\t\t\r\n\t\t\tfor (auto& itv : it.second)\r\n\t\t\t{\r\n\t\t\t\tauto& val = req.query().get_val(itv);\r\n\t\t\t\tif (val.empty())\r\n\t\t\t\t\tbreak;\r\n\r\n\t\t\t\tv_.push_back(val);\r\n\t\t\t}\r\n\r\n\t\t\tbreak;\r\n\t\t}\r\n\t}\r\n\r\n\tvoid parse(std::string& params)\r\n\t{\r\n\t\tv_ = StringUtil::split(params, '\/');\r\n\t}\r\n\r\npublic:\r\n\tstd::string get_function_name()\r\n\t{\r\n\t\tif (v_.empty())\r\n\t\t\treturn \"\";\r\n\r\n\t\tauto it = v_.begin();\r\n\t\tstd::string name = *it;\r\n\t\tv_.erase(it);\r\n\t\treturn name;\r\n\t}\r\n\r\n\ttemplate<typename RequestedType>\r\n\tbool get(typename std::decay<RequestedType>::type& param)\r\n\t{\r\n\t\tif (v_.empty())\r\n\t\t{\r\n\t\t\tLOG_DBG << \"Params is invalid \";\r\n\t\t\treturn false;\r\n\t\t}\r\n\r\n\t\ttry\r\n\t\t{\r\n\t\t\ttypedef typename std::decay<RequestedType>::type result_type;\r\n\t\t\tauto const & v = v_.back();\r\n\t\t\tparam = boost::lexical_cast<typename std::decay<result_type>::type>(v);\r\n\t\t\tv_.pop_back();\r\n\t\t\treturn true;\r\n\t\t}\r\n\t\tcatch (std::exception& e)\r\n\t\t{\r\n\t\t\tLOG_DBG << \"Error in param converting: \" << e.what();\r\n\t\t}\r\n\t\treturn false;\r\n\t}\r\n\r\n\tbool empty(){ return v_.empty(); }\r\n\r\n\tsize_t size() const\r\n\t{\r\n\t\treturn v_.size();\r\n\t}\r\n};\r\n<|endoftext|>"} {"text":"<commit_before>#ifndef TIMER_HPP_\n#define TIMER_HPP_\n\n#include <boost\/chrono\/chrono.hpp>\n#include <boost\/chrono\/chrono_io.hpp>\n#include <boost\/chrono\/system_clocks.hpp>\n\nnamespace clotho {\nnamespace utility {\n\ntypedef boost::chrono::high_resolution_clock clock_type;\ntypedef clock_type::time_point time_point_type;\ntypedef clock_type::duration duration_type;\n\n\/*! Basic timer class *\/\nclass timer {\npublic:\n\n static constexpr double hertz = (double)clock_type::period::num\/clock_type::period::den;\n timer() : m_start( clock_type::now() ), m_end( time_point_type::max() ) {}\n\n \/**\n * (re)start the timer\n *\/\n inline void start() {\n m_end = time_point_type::max();\n m_start = clock_type::now();\n }\n\n \/**\n * stop the timer\n *\/\n inline void stop() {\n m_end = clock_type::now();\n }\n\n \/**\n * Calculates the elapsed time\n *\n * If the timer has been stopped, then the elasped time is stop - start.\n * Otherwise, the elapsed time is the time between \"now\" and the last start.\n *\n * \\return elasped time\n * \\note This does not stop a running timer\n *\/\n duration_type elapsed() const {\n time_point_type t = ((m_end == time_point_type::max()) ? clock_type::now() : m_end);\n return (t - m_start);\n }\n\n virtual ~timer() {}\nprotected:\n time_point_type m_start, m_end;\n};\n\n} \/\/ namespace utility\n} \/\/ namespace clotho\n#endif \/\/ TIMER_HPP_\n<commit_msg>Added method to get count directly from computed duration<commit_after>#ifndef TIMER_HPP_\n#define TIMER_HPP_\n\n#include <boost\/chrono\/chrono.hpp>\n#include <boost\/chrono\/chrono_io.hpp>\n#include <boost\/chrono\/system_clocks.hpp>\n\nnamespace clotho {\nnamespace utility {\n\ntypedef boost::chrono::high_resolution_clock clock_type;\ntypedef clock_type::time_point time_point_type;\ntypedef clock_type::duration duration_type;\n\n\/*! Basic timer class *\/\nclass timer {\npublic:\n\n static constexpr double hertz = (double)clock_type::period::num\/clock_type::period::den;\n timer() : m_start( clock_type::now() ), m_end( time_point_type::max() ) {}\n\n \/**\n * (re)start the timer\n *\/\n inline void start() {\n m_end = time_point_type::max();\n m_start = clock_type::now();\n }\n\n \/**\n * stop the timer\n *\/\n inline void stop() {\n m_end = clock_type::now();\n }\n\n \/**\n * Calculates the elapsed time\n *\n * If the timer has been stopped, then the elasped time is stop - start.\n * Otherwise, the elapsed time is the time between \"now\" and the last start.\n *\n * \\return elasped time\n * \\note This does not stop a running timer\n *\/\n duration_type elapsed() const {\n time_point_type t = ((m_end == time_point_type::max()) ? clock_type::now() : m_end);\n return (t - m_start);\n }\n\n unsigned long elapsed_long() const {\n time_point_type t = ((m_end == time_point_type::max()) ? clock_type::now() : m_end);\n return (t - m_start).count();\n }\n\n virtual ~timer() {}\nprotected:\n time_point_type m_start, m_end;\n};\n\n} \/\/ namespace utility\n} \/\/ namespace clotho\n#endif \/\/ TIMER_HPP_\n<|endoftext|>"} {"text":"<commit_before>\/\/=======================================================================\n\/\/ Copyright (c) 2014-2015 Baptiste Wicht\n\/\/ Distributed under the terms of the MIT License.\n\/\/ (See accompanying file LICENSE or copy at\n\/\/ http:\/\/opensource.org\/licenses\/MIT)\n\/\/=======================================================================\n\n#pragma once\n\n#include \"cuda_runtime.h\"\n\nnamespace etl {\n\nnamespace impl {\n\nnamespace cuda {\n\ntemplate <typename T>\nstruct cuda_memory {\n T* memory;\n\n cuda_memory(T* memory) : memory(memory) {}\n\n \/\/Delete copy operations\n cuda_memory(cuda_memory& rhs){\n cpp_assert(!is_set(), \"copy of cuda_memory is only possible when not allocated\");\n cpp_assert(!rhs.is_set(), \"copy of cuda_memory is only possible when not allocated\");\n }\n\n cuda_memory& operator=(cuda_memory& rhs){\n cpp_assert(!is_set(), \"copy of cuda_memory is only possible when not allocated\");\n cpp_assert(!rhs.is_set(), \"copy of cuda_memory is only possible when not allocated\");\n\n return *this;\n }\n\n cuda_memory(cuda_memory&& rhs) : memory(rhs.memory){\n rhs.memory = nullptr;\n }\n\n cuda_memory& operator=(cuda_memory&& rhs){\n if(memory){\n cudaFree(memory);\n }\n\n memory = rhs.memory;\n rhs.memory = nullptr;\n\n return *this;\n }\n\n cuda_memory& operator=(T* new_memory){\n if(memory){\n cudaFree(memory);\n }\n\n memory = new_memory;\n\n return *this;\n }\n\n T* get() const {\n return memory;\n }\n\n bool is_set() const {\n return memory;\n }\n\n void reset(){\n if(memory){\n cudaFree(memory);\n }\n\n memory = nullptr;\n }\n\n ~cuda_memory() {\n if(memory){\n cudaFree(memory);\n }\n }\n};\n\ntemplate <typename E>\nauto cuda_allocate(const E& expr, bool copy = false) -> cuda_memory<value_t<E>> {\n value_t<E>* memory;\n\n auto cuda_status = cudaMalloc(&memory, etl::size(expr) * sizeof(value_t<E>));\n\n if (cuda_status != cudaSuccess) {\n std::cout << \"cuda: Failed to allocate GPU memory: \" << cudaGetErrorString(cuda_status) << std::endl;\n std::cout << \" Tried to allocate \" << etl::size(expr) * sizeof(value_t<E>) << \"B\" << std::endl;\n exit(EXIT_FAILURE);\n }\n\n if (copy) {\n cudaMemcpy(memory, expr.memory_start(), etl::size(expr) * sizeof(value_t<E>), cudaMemcpyHostToDevice);\n }\n\n return {memory};\n}\n\ntemplate <typename E>\nauto cuda_allocate_copy(const E& expr) -> cuda_memory<value_t<E>> {\n return cuda_allocate(expr, true);\n}\n\ntemplate <typename E>\nauto cuda_allocate(E* ptr, std::size_t n, bool copy = false) -> cuda_memory<E> {\n E* memory;\n\n auto cuda_status = cudaMalloc(&memory, n * sizeof(E));\n\n if (cuda_status != cudaSuccess) {\n std::cout << \"cuda: Failed to allocate GPU memory: \" << cudaGetErrorString(cuda_status) << std::endl;\n std::cout << \" Tried to allocate \" << n * sizeof(E) << \"B\" << std::endl;\n exit(EXIT_FAILURE);\n }\n\n if (copy) {\n cudaMemcpy(memory, ptr, n * sizeof(E), cudaMemcpyHostToDevice);\n }\n\n return {memory};\n}\n\ntemplate <typename E>\nauto cuda_allocate_copy(E* ptr, std::size_t n) -> cuda_memory<E> {\n return cuda_allocate(ptr, n, true);\n}\n\n} \/\/end of namespace cublas\n\n} \/\/end of namespace impl\n\n} \/\/end of namespace etl\n<commit_msg>Fix constness<commit_after>\/\/=======================================================================\n\/\/ Copyright (c) 2014-2015 Baptiste Wicht\n\/\/ Distributed under the terms of the MIT License.\n\/\/ (See accompanying file LICENSE or copy at\n\/\/ http:\/\/opensource.org\/licenses\/MIT)\n\/\/=======================================================================\n\n#pragma once\n\n#include \"cuda_runtime.h\"\n\nnamespace etl {\n\nnamespace impl {\n\nnamespace cuda {\n\ntemplate <typename T>\nstruct cuda_memory {\n T* memory;\n\n cuda_memory(T* memory) : memory(memory) {}\n\n \/\/Delete copy operations\n cuda_memory(const cuda_memory& rhs){\n cpp_assert(!is_set(), \"copy of cuda_memory is only possible when not allocated\");\n cpp_assert(!rhs.is_set(), \"copy of cuda_memory is only possible when not allocated\");\n }\n\n cuda_memory& operator=(const cuda_memory& rhs){\n cpp_assert(!is_set(), \"copy of cuda_memory is only possible when not allocated\");\n cpp_assert(!rhs.is_set(), \"copy of cuda_memory is only possible when not allocated\");\n\n return *this;\n }\n\n cuda_memory(cuda_memory&& rhs) : memory(rhs.memory){\n rhs.memory = nullptr;\n }\n\n cuda_memory& operator=(cuda_memory&& rhs){\n if(memory){\n cudaFree(memory);\n }\n\n memory = rhs.memory;\n rhs.memory = nullptr;\n\n return *this;\n }\n\n cuda_memory& operator=(T* new_memory){\n if(memory){\n cudaFree(memory);\n }\n\n memory = new_memory;\n\n return *this;\n }\n\n T* get() const {\n return memory;\n }\n\n bool is_set() const {\n return memory;\n }\n\n void reset(){\n if(memory){\n cudaFree(memory);\n }\n\n memory = nullptr;\n }\n\n ~cuda_memory() {\n if(memory){\n cudaFree(memory);\n }\n }\n};\n\ntemplate <typename E>\nauto cuda_allocate(const E& expr, bool copy = false) -> cuda_memory<value_t<E>> {\n value_t<E>* memory;\n\n auto cuda_status = cudaMalloc(&memory, etl::size(expr) * sizeof(value_t<E>));\n\n if (cuda_status != cudaSuccess) {\n std::cout << \"cuda: Failed to allocate GPU memory: \" << cudaGetErrorString(cuda_status) << std::endl;\n std::cout << \" Tried to allocate \" << etl::size(expr) * sizeof(value_t<E>) << \"B\" << std::endl;\n exit(EXIT_FAILURE);\n }\n\n if (copy) {\n cudaMemcpy(memory, expr.memory_start(), etl::size(expr) * sizeof(value_t<E>), cudaMemcpyHostToDevice);\n }\n\n return {memory};\n}\n\ntemplate <typename E>\nauto cuda_allocate_copy(const E& expr) -> cuda_memory<value_t<E>> {\n return cuda_allocate(expr, true);\n}\n\ntemplate <typename E>\nauto cuda_allocate(E* ptr, std::size_t n, bool copy = false) -> cuda_memory<E> {\n E* memory;\n\n auto cuda_status = cudaMalloc(&memory, n * sizeof(E));\n\n if (cuda_status != cudaSuccess) {\n std::cout << \"cuda: Failed to allocate GPU memory: \" << cudaGetErrorString(cuda_status) << std::endl;\n std::cout << \" Tried to allocate \" << n * sizeof(E) << \"B\" << std::endl;\n exit(EXIT_FAILURE);\n }\n\n if (copy) {\n cudaMemcpy(memory, ptr, n * sizeof(E), cudaMemcpyHostToDevice);\n }\n\n return {memory};\n}\n\ntemplate <typename E>\nauto cuda_allocate_copy(E* ptr, std::size_t n) -> cuda_memory<E> {\n return cuda_allocate(ptr, n, true);\n}\n\n} \/\/end of namespace cublas\n\n} \/\/end of namespace impl\n\n} \/\/end of namespace etl\n<|endoftext|>"} {"text":"<commit_before><commit_msg>Register chrome-extension as a secure scheme so that adding resources from an extension doesn't trip the mixed content sensor.<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#if defined(OS_MACOSX)\n#include <signal.h>\n#include <unistd.h>\n#endif \/\/ OS_MACOSX\n\n#include \"base\/command_line.h\"\n#include \"base\/debug\/trace_event.h\"\n#include \"base\/i18n\/rtl.h\"\n#include \"base\/mac\/scoped_nsautorelease_pool.h\"\n#include \"base\/metrics\/field_trial.h\"\n#include \"base\/message_loop.h\"\n#include \"base\/metrics\/histogram.h\"\n#include \"base\/metrics\/stats_counters.h\"\n#include \"base\/path_service.h\"\n#include \"base\/process_util.h\"\n#include \"base\/string_util.h\"\n#include \"base\/threading\/platform_thread.h\"\n#include \"chrome\/common\/chrome_constants.h\"\n#include \"chrome\/common\/chrome_counters.h\"\n#include \"chrome\/common\/chrome_switches.h\"\n#include \"chrome\/common\/gfx_resource_provider.h\"\n#include \"chrome\/common\/logging_chrome.h\"\n#include \"chrome\/common\/net\/net_resource_provider.h\"\n#include \"chrome\/common\/pepper_plugin_registry.h\"\n#include \"chrome\/renderer\/renderer_main_platform_delegate.h\"\n#include \"chrome\/renderer\/render_process_impl.h\"\n#include \"chrome\/renderer\/render_thread.h\"\n#include \"content\/common\/main_function_params.h\"\n#include \"content\/common\/hi_res_timer_manager.h\"\n#include \"grit\/generated_resources.h\"\n#include \"net\/base\/net_module.h\"\n#include \"ui\/base\/system_monitor\/system_monitor.h\"\n#include \"ui\/base\/ui_base_switches.h\"\n#include \"ui\/gfx\/gfx_module.h\"\n\n#if defined(OS_MACOSX)\n#include \"base\/eintr_wrapper.h\"\n#include \"chrome\/app\/breakpad_mac.h\"\n#include \"third_party\/WebKit\/Source\/WebKit\/chromium\/public\/WebView.h\"\n#endif \/\/ OS_MACOSX\n\n#if defined(OS_MACOSX)\nnamespace {\n\n\/\/ TODO(viettrungluu): crbug.com\/28547: The following signal handling is needed,\n\/\/ as a stopgap, to avoid leaking due to not releasing Breakpad properly.\n\/\/ Without this problem, this could all be eliminated. Remove when Breakpad is\n\/\/ fixed?\n\/\/ TODO(viettrungluu): Code taken from browser_main.cc (with a bit of editing).\n\/\/ The code should be properly shared (or this code should be eliminated).\nint g_shutdown_pipe_write_fd = -1;\n\nvoid SIGTERMHandler(int signal) {\n RAW_CHECK(signal == SIGTERM);\n RAW_LOG(INFO, \"Handling SIGTERM in renderer.\");\n\n \/\/ Reinstall the default handler. We had one shot at graceful shutdown.\n struct sigaction action;\n memset(&action, 0, sizeof(action));\n action.sa_handler = SIG_DFL;\n CHECK(sigaction(signal, &action, NULL) == 0);\n\n RAW_CHECK(g_shutdown_pipe_write_fd != -1);\n size_t bytes_written = 0;\n do {\n int rv = HANDLE_EINTR(\n write(g_shutdown_pipe_write_fd,\n reinterpret_cast<const char*>(&signal) + bytes_written,\n sizeof(signal) - bytes_written));\n RAW_CHECK(rv >= 0);\n bytes_written += rv;\n } while (bytes_written < sizeof(signal));\n\n RAW_LOG(INFO, \"Wrote signal to shutdown pipe.\");\n}\n\nclass ShutdownDetector : public base::PlatformThread::Delegate {\n public:\n explicit ShutdownDetector(int shutdown_fd) : shutdown_fd_(shutdown_fd) {\n CHECK(shutdown_fd_ != -1);\n }\n\n virtual void ThreadMain() {\n int signal;\n size_t bytes_read = 0;\n ssize_t ret;\n do {\n ret = HANDLE_EINTR(\n read(shutdown_fd_,\n reinterpret_cast<char*>(&signal) + bytes_read,\n sizeof(signal) - bytes_read));\n if (ret < 0) {\n NOTREACHED() << \"Unexpected error: \" << strerror(errno);\n break;\n } else if (ret == 0) {\n NOTREACHED() << \"Unexpected closure of shutdown pipe.\";\n break;\n }\n bytes_read += ret;\n } while (bytes_read < sizeof(signal));\n\n if (bytes_read == sizeof(signal))\n VLOG(1) << \"Handling shutdown for signal \" << signal << \".\";\n else\n VLOG(1) << \"Handling shutdown for unknown signal.\";\n\n \/\/ Clean up Breakpad if necessary.\n if (IsCrashReporterEnabled()) {\n VLOG(1) << \"Cleaning up Breakpad.\";\n DestructCrashReporter();\n } else {\n VLOG(1) << \"Breakpad not enabled; no clean-up needed.\";\n }\n\n \/\/ Something went seriously wrong, so get out.\n if (bytes_read != sizeof(signal)) {\n LOG(WARNING) << \"Failed to get signal. Quitting ungracefully.\";\n _exit(1);\n }\n\n \/\/ Re-raise the signal.\n kill(getpid(), signal);\n\n \/\/ The signal may be handled on another thread. Give that a chance to\n \/\/ happen.\n sleep(3);\n\n \/\/ We really should be dead by now. For whatever reason, we're not. Exit\n \/\/ immediately, with the exit status set to the signal number with bit 8\n \/\/ set. On the systems that we care about, this exit status is what is\n \/\/ normally used to indicate an exit by this signal's default handler.\n \/\/ This mechanism isn't a de jure standard, but even in the worst case, it\n \/\/ should at least result in an immediate exit.\n LOG(WARNING) << \"Still here, exiting really ungracefully.\";\n _exit(signal | (1 << 7));\n }\n\n private:\n const int shutdown_fd_;\n\n DISALLOW_COPY_AND_ASSIGN(ShutdownDetector);\n};\n\n} \/\/ namespace\n#endif \/\/ OS_MACOSX\n\n\/\/ This function provides some ways to test crash and assertion handling\n\/\/ behavior of the renderer.\nstatic void HandleRendererErrorTestParameters(const CommandLine& command_line) {\n \/\/ This parameter causes an assertion.\n if (command_line.HasSwitch(switches::kRendererAssertTest)) {\n DCHECK(false);\n }\n\n\n#if !defined(OFFICIAL_BUILD)\n \/\/ This parameter causes an assertion too.\n if (command_line.HasSwitch(switches::kRendererCheckFalseTest)) {\n CHECK(false);\n }\n#endif \/\/ !defined(OFFICIAL_BUILD)\n\n\n \/\/ This parameter causes a null pointer crash (crash reporter trigger).\n if (command_line.HasSwitch(switches::kRendererCrashTest)) {\n int* bad_pointer = NULL;\n *bad_pointer = 0;\n }\n\n if (command_line.HasSwitch(switches::kRendererStartupDialog)) {\n ChildProcess::WaitForDebugger(\"Renderer\");\n }\n}\n\n\/\/ mainline routine for running as the Renderer process\nint RendererMain(const MainFunctionParams& parameters) {\n TRACE_EVENT_BEGIN(\"RendererMain\", 0, \"\");\n\n const CommandLine& parsed_command_line = parameters.command_line_;\n base::mac::ScopedNSAutoreleasePool* pool = parameters.autorelease_pool_;\n\n#if defined(OS_MACOSX)\n \/\/ TODO(viettrungluu): Code taken from browser_main.cc.\n int pipefd[2];\n int ret = pipe(pipefd);\n if (ret < 0) {\n PLOG(DFATAL) << \"Failed to create pipe\";\n } else {\n int shutdown_pipe_read_fd = pipefd[0];\n g_shutdown_pipe_write_fd = pipefd[1];\n const size_t kShutdownDetectorThreadStackSize = 4096;\n if (!base::PlatformThread::CreateNonJoinable(\n kShutdownDetectorThreadStackSize,\n new ShutdownDetector(shutdown_pipe_read_fd))) {\n LOG(DFATAL) << \"Failed to create shutdown detector task.\";\n }\n }\n\n \/\/ crbug.com\/28547: When Breakpad is in use, handle SIGTERM to avoid leaking\n \/\/ Mach ports.\n struct sigaction action;\n memset(&action, 0, sizeof(action));\n action.sa_handler = SIGTERMHandler;\n CHECK(sigaction(SIGTERM, &action, NULL) == 0);\n#endif \/\/ OS_MACOSX\n\n#if defined(OS_CHROMEOS)\n \/\/ As Zygote process starts up earlier than browser process gets its own\n \/\/ locale (at login time for Chrome OS), we have to set the ICU default\n \/\/ locale for renderer process here.\n \/\/ ICU locale will be used for fallback font selection etc.\n if (parsed_command_line.HasSwitch(switches::kLang)) {\n const std::string locale =\n parsed_command_line.GetSwitchValueASCII(switches::kLang);\n base::i18n::SetICUDefaultLocale(locale);\n }\n#endif\n\n \/\/ Configure modules that need access to resources.\n net::NetModule::SetResourceProvider(chrome_common_net::NetResourceProvider);\n gfx::GfxModule::SetResourceProvider(chrome::GfxResourceProvider);\n\n \/\/ This function allows pausing execution using the --renderer-startup-dialog\n \/\/ flag allowing us to attach a debugger.\n \/\/ Do not move this function down since that would mean we can't easily debug\n \/\/ whatever occurs before it.\n HandleRendererErrorTestParameters(parsed_command_line);\n\n RendererMainPlatformDelegate platform(parameters);\n\n base::StatsScope<base::StatsCounterTimer>\n startup_timer(chrome::Counters::renderer_main());\n\n#if defined(OS_MACOSX)\n \/\/ As long as we use Cocoa in the renderer (for the forseeable future as of\n \/\/ now; see http:\/\/crbug.com\/13890 for info) we need to have a UI loop.\n MessageLoop main_message_loop(MessageLoop::TYPE_UI);\n#else\n \/\/ The main message loop of the renderer services doesn't have IO or UI tasks,\n \/\/ unless in-process-plugins is used.\n MessageLoop main_message_loop(RenderProcessImpl::InProcessPlugins() ?\n MessageLoop::TYPE_UI : MessageLoop::TYPE_DEFAULT);\n#endif\n\n base::PlatformThread::SetName(\"CrRendererMain\");\n\n ui::SystemMonitor system_monitor;\n HighResolutionTimerManager hi_res_timer_manager;\n\n platform.PlatformInitialize();\n\n bool no_sandbox = parsed_command_line.HasSwitch(switches::kNoSandbox);\n platform.InitSandboxTests(no_sandbox);\n\n \/\/ Initialize histogram statistics gathering system.\n \/\/ Don't create StatisticsRecorder in the single process mode.\n scoped_ptr<base::StatisticsRecorder> statistics;\n if (!base::StatisticsRecorder::IsActive()) {\n statistics.reset(new base::StatisticsRecorder());\n }\n\n \/\/ Initialize statistical testing infrastructure.\n base::FieldTrialList field_trial;\n \/\/ Ensure any field trials in browser are reflected into renderer.\n if (parsed_command_line.HasSwitch(switches::kForceFieldTestNameAndValue)) {\n std::string persistent = parsed_command_line.GetSwitchValueASCII(\n switches::kForceFieldTestNameAndValue);\n bool ret = field_trial.CreateTrialsInChildProcess(persistent);\n DCHECK(ret);\n }\n\n \/\/ Load pepper plugins before engaging the sandbox.\n PepperPluginRegistry::GetInstance();\n\n {\n#if !defined(OS_LINUX)\n \/\/ TODO(markus): Check if it is OK to unconditionally move this\n \/\/ instruction down.\n RenderProcessImpl render_process;\n render_process.set_main_thread(new RenderThread());\n#endif\n bool run_loop = true;\n if (!no_sandbox) {\n run_loop = platform.EnableSandbox();\n } else {\n LOG(ERROR) << \"Running without renderer sandbox\";\n }\n#if defined(OS_LINUX)\n RenderProcessImpl render_process;\n render_process.set_main_thread(new RenderThread());\n#endif\n\n platform.RunSandboxTests();\n\n startup_timer.Stop(); \/\/ End of Startup Time Measurement.\n\n if (run_loop) {\n if (pool)\n pool->Recycle();\n TRACE_EVENT_BEGIN(\"RendererMain.START_MSG_LOOP\", 0, 0);\n MessageLoop::current()->Run();\n TRACE_EVENT_END(\"RendererMain.START_MSG_LOOP\", 0, 0);\n }\n }\n platform.PlatformUninitialize();\n TRACE_EVENT_END(\"RendererMain\", 0, \"\");\n return 0;\n}\n<commit_msg>Add a histogram to measure task execution time for the render thread.<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_MACOSX)\n#include <signal.h>\n#include <unistd.h>\n#endif \/\/ OS_MACOSX\n\n#include \"base\/command_line.h\"\n#include \"base\/debug\/trace_event.h\"\n#include \"base\/i18n\/rtl.h\"\n#include \"base\/mac\/scoped_nsautorelease_pool.h\"\n#include \"base\/metrics\/field_trial.h\"\n#include \"base\/message_loop.h\"\n#include \"base\/metrics\/histogram.h\"\n#include \"base\/metrics\/stats_counters.h\"\n#include \"base\/path_service.h\"\n#include \"base\/process_util.h\"\n#include \"base\/ref_counted.h\"\n#include \"base\/string_util.h\"\n#include \"base\/threading\/platform_thread.h\"\n#include \"base\/time.h\"\n#include \"chrome\/common\/chrome_constants.h\"\n#include \"chrome\/common\/chrome_counters.h\"\n#include \"chrome\/common\/chrome_switches.h\"\n#include \"chrome\/common\/gfx_resource_provider.h\"\n#include \"chrome\/common\/logging_chrome.h\"\n#include \"chrome\/common\/net\/net_resource_provider.h\"\n#include \"chrome\/common\/pepper_plugin_registry.h\"\n#include \"chrome\/renderer\/renderer_main_platform_delegate.h\"\n#include \"chrome\/renderer\/render_process_impl.h\"\n#include \"chrome\/renderer\/render_thread.h\"\n#include \"content\/common\/main_function_params.h\"\n#include \"content\/common\/hi_res_timer_manager.h\"\n#include \"grit\/generated_resources.h\"\n#include \"net\/base\/net_module.h\"\n#include \"ui\/base\/system_monitor\/system_monitor.h\"\n#include \"ui\/base\/ui_base_switches.h\"\n#include \"ui\/gfx\/gfx_module.h\"\n\n#if defined(OS_MACOSX)\n#include \"base\/eintr_wrapper.h\"\n#include \"chrome\/app\/breakpad_mac.h\"\n#include \"third_party\/WebKit\/Source\/WebKit\/chromium\/public\/WebView.h\"\n#endif \/\/ OS_MACOSX\n\n#if defined(OS_MACOSX)\nnamespace {\n\n\/\/ TODO(viettrungluu): crbug.com\/28547: The following signal handling is needed,\n\/\/ as a stopgap, to avoid leaking due to not releasing Breakpad properly.\n\/\/ Without this problem, this could all be eliminated. Remove when Breakpad is\n\/\/ fixed?\n\/\/ TODO(viettrungluu): Code taken from browser_main.cc (with a bit of editing).\n\/\/ The code should be properly shared (or this code should be eliminated).\nint g_shutdown_pipe_write_fd = -1;\n\nvoid SIGTERMHandler(int signal) {\n RAW_CHECK(signal == SIGTERM);\n RAW_LOG(INFO, \"Handling SIGTERM in renderer.\");\n\n \/\/ Reinstall the default handler. We had one shot at graceful shutdown.\n struct sigaction action;\n memset(&action, 0, sizeof(action));\n action.sa_handler = SIG_DFL;\n CHECK(sigaction(signal, &action, NULL) == 0);\n\n RAW_CHECK(g_shutdown_pipe_write_fd != -1);\n size_t bytes_written = 0;\n do {\n int rv = HANDLE_EINTR(\n write(g_shutdown_pipe_write_fd,\n reinterpret_cast<const char*>(&signal) + bytes_written,\n sizeof(signal) - bytes_written));\n RAW_CHECK(rv >= 0);\n bytes_written += rv;\n } while (bytes_written < sizeof(signal));\n\n RAW_LOG(INFO, \"Wrote signal to shutdown pipe.\");\n}\n\nclass ShutdownDetector : public base::PlatformThread::Delegate {\n public:\n explicit ShutdownDetector(int shutdown_fd) : shutdown_fd_(shutdown_fd) {\n CHECK(shutdown_fd_ != -1);\n }\n\n virtual void ThreadMain() {\n int signal;\n size_t bytes_read = 0;\n ssize_t ret;\n do {\n ret = HANDLE_EINTR(\n read(shutdown_fd_,\n reinterpret_cast<char*>(&signal) + bytes_read,\n sizeof(signal) - bytes_read));\n if (ret < 0) {\n NOTREACHED() << \"Unexpected error: \" << strerror(errno);\n break;\n } else if (ret == 0) {\n NOTREACHED() << \"Unexpected closure of shutdown pipe.\";\n break;\n }\n bytes_read += ret;\n } while (bytes_read < sizeof(signal));\n\n if (bytes_read == sizeof(signal))\n VLOG(1) << \"Handling shutdown for signal \" << signal << \".\";\n else\n VLOG(1) << \"Handling shutdown for unknown signal.\";\n\n \/\/ Clean up Breakpad if necessary.\n if (IsCrashReporterEnabled()) {\n VLOG(1) << \"Cleaning up Breakpad.\";\n DestructCrashReporter();\n } else {\n VLOG(1) << \"Breakpad not enabled; no clean-up needed.\";\n }\n\n \/\/ Something went seriously wrong, so get out.\n if (bytes_read != sizeof(signal)) {\n LOG(WARNING) << \"Failed to get signal. Quitting ungracefully.\";\n _exit(1);\n }\n\n \/\/ Re-raise the signal.\n kill(getpid(), signal);\n\n \/\/ The signal may be handled on another thread. Give that a chance to\n \/\/ happen.\n sleep(3);\n\n \/\/ We really should be dead by now. For whatever reason, we're not. Exit\n \/\/ immediately, with the exit status set to the signal number with bit 8\n \/\/ set. On the systems that we care about, this exit status is what is\n \/\/ normally used to indicate an exit by this signal's default handler.\n \/\/ This mechanism isn't a de jure standard, but even in the worst case, it\n \/\/ should at least result in an immediate exit.\n LOG(WARNING) << \"Still here, exiting really ungracefully.\";\n _exit(signal | (1 << 7));\n }\n\n private:\n const int shutdown_fd_;\n\n DISALLOW_COPY_AND_ASSIGN(ShutdownDetector);\n};\n\n} \/\/ namespace\n#endif \/\/ OS_MACOSX\n\n\/\/ This function provides some ways to test crash and assertion handling\n\/\/ behavior of the renderer.\nstatic void HandleRendererErrorTestParameters(const CommandLine& command_line) {\n \/\/ This parameter causes an assertion.\n if (command_line.HasSwitch(switches::kRendererAssertTest)) {\n DCHECK(false);\n }\n\n\n#if !defined(OFFICIAL_BUILD)\n \/\/ This parameter causes an assertion too.\n if (command_line.HasSwitch(switches::kRendererCheckFalseTest)) {\n CHECK(false);\n }\n#endif \/\/ !defined(OFFICIAL_BUILD)\n\n\n \/\/ This parameter causes a null pointer crash (crash reporter trigger).\n if (command_line.HasSwitch(switches::kRendererCrashTest)) {\n int* bad_pointer = NULL;\n *bad_pointer = 0;\n }\n\n if (command_line.HasSwitch(switches::kRendererStartupDialog)) {\n ChildProcess::WaitForDebugger(\"Renderer\");\n }\n}\n\n\/\/ This is a simplified version of the browser Jankometer, which measures\n\/\/ the processing time of tasks on the render thread.\nclass RendererMessageLoopObserver : public MessageLoop::TaskObserver {\n public:\n RendererMessageLoopObserver()\n : process_times_(base::Histogram::FactoryGet(\n \"Chrome.ProcMsgL RenderThread\",\n 1, 3600000, 50, base::Histogram::kUmaTargetedHistogramFlag)) {}\n virtual ~RendererMessageLoopObserver() {}\n\n virtual void WillProcessTask(const Task* task) {\n begin_process_message_ = base::TimeTicks::Now();\n }\n\n virtual void DidProcessTask(const Task* task) {\n if (begin_process_message_ != base::TimeTicks())\n process_times_->AddTime(base::TimeTicks::Now() - begin_process_message_);\n }\n\n private:\n base::TimeTicks begin_process_message_;\n scoped_refptr<base::Histogram> process_times_;\n DISALLOW_COPY_AND_ASSIGN(RendererMessageLoopObserver);\n};\n\n\/\/ mainline routine for running as the Renderer process\nint RendererMain(const MainFunctionParams& parameters) {\n TRACE_EVENT_BEGIN(\"RendererMain\", 0, \"\");\n\n const CommandLine& parsed_command_line = parameters.command_line_;\n base::mac::ScopedNSAutoreleasePool* pool = parameters.autorelease_pool_;\n\n#if defined(OS_MACOSX)\n \/\/ TODO(viettrungluu): Code taken from browser_main.cc.\n int pipefd[2];\n int ret = pipe(pipefd);\n if (ret < 0) {\n PLOG(DFATAL) << \"Failed to create pipe\";\n } else {\n int shutdown_pipe_read_fd = pipefd[0];\n g_shutdown_pipe_write_fd = pipefd[1];\n const size_t kShutdownDetectorThreadStackSize = 4096;\n if (!base::PlatformThread::CreateNonJoinable(\n kShutdownDetectorThreadStackSize,\n new ShutdownDetector(shutdown_pipe_read_fd))) {\n LOG(DFATAL) << \"Failed to create shutdown detector task.\";\n }\n }\n\n \/\/ crbug.com\/28547: When Breakpad is in use, handle SIGTERM to avoid leaking\n \/\/ Mach ports.\n struct sigaction action;\n memset(&action, 0, sizeof(action));\n action.sa_handler = SIGTERMHandler;\n CHECK(sigaction(SIGTERM, &action, NULL) == 0);\n#endif \/\/ OS_MACOSX\n\n#if defined(OS_CHROMEOS)\n \/\/ As Zygote process starts up earlier than browser process gets its own\n \/\/ locale (at login time for Chrome OS), we have to set the ICU default\n \/\/ locale for renderer process here.\n \/\/ ICU locale will be used for fallback font selection etc.\n if (parsed_command_line.HasSwitch(switches::kLang)) {\n const std::string locale =\n parsed_command_line.GetSwitchValueASCII(switches::kLang);\n base::i18n::SetICUDefaultLocale(locale);\n }\n#endif\n\n \/\/ Configure modules that need access to resources.\n net::NetModule::SetResourceProvider(chrome_common_net::NetResourceProvider);\n gfx::GfxModule::SetResourceProvider(chrome::GfxResourceProvider);\n\n \/\/ This function allows pausing execution using the --renderer-startup-dialog\n \/\/ flag allowing us to attach a debugger.\n \/\/ Do not move this function down since that would mean we can't easily debug\n \/\/ whatever occurs before it.\n HandleRendererErrorTestParameters(parsed_command_line);\n\n RendererMainPlatformDelegate platform(parameters);\n\n base::StatsScope<base::StatsCounterTimer>\n startup_timer(chrome::Counters::renderer_main());\n\n RendererMessageLoopObserver task_observer;\n#if defined(OS_MACOSX)\n \/\/ As long as we use Cocoa in the renderer (for the forseeable future as of\n \/\/ now; see http:\/\/crbug.com\/13890 for info) we need to have a UI loop.\n MessageLoop main_message_loop(MessageLoop::TYPE_UI);\n#else\n \/\/ The main message loop of the renderer services doesn't have IO or UI tasks,\n \/\/ unless in-process-plugins is used.\n MessageLoop main_message_loop(RenderProcessImpl::InProcessPlugins() ?\n MessageLoop::TYPE_UI : MessageLoop::TYPE_DEFAULT);\n#endif\n main_message_loop.AddTaskObserver(&task_observer);\n\n base::PlatformThread::SetName(\"CrRendererMain\");\n\n ui::SystemMonitor system_monitor;\n HighResolutionTimerManager hi_res_timer_manager;\n\n platform.PlatformInitialize();\n\n bool no_sandbox = parsed_command_line.HasSwitch(switches::kNoSandbox);\n platform.InitSandboxTests(no_sandbox);\n\n \/\/ Initialize histogram statistics gathering system.\n \/\/ Don't create StatisticsRecorder in the single process mode.\n scoped_ptr<base::StatisticsRecorder> statistics;\n if (!base::StatisticsRecorder::IsActive()) {\n statistics.reset(new base::StatisticsRecorder());\n }\n\n \/\/ Initialize statistical testing infrastructure.\n base::FieldTrialList field_trial;\n \/\/ Ensure any field trials in browser are reflected into renderer.\n if (parsed_command_line.HasSwitch(switches::kForceFieldTestNameAndValue)) {\n std::string persistent = parsed_command_line.GetSwitchValueASCII(\n switches::kForceFieldTestNameAndValue);\n bool ret = field_trial.CreateTrialsInChildProcess(persistent);\n DCHECK(ret);\n }\n\n \/\/ Load pepper plugins before engaging the sandbox.\n PepperPluginRegistry::GetInstance();\n\n {\n#if !defined(OS_LINUX)\n \/\/ TODO(markus): Check if it is OK to unconditionally move this\n \/\/ instruction down.\n RenderProcessImpl render_process;\n render_process.set_main_thread(new RenderThread());\n#endif\n bool run_loop = true;\n if (!no_sandbox) {\n run_loop = platform.EnableSandbox();\n } else {\n LOG(ERROR) << \"Running without renderer sandbox\";\n }\n#if defined(OS_LINUX)\n RenderProcessImpl render_process;\n render_process.set_main_thread(new RenderThread());\n#endif\n\n platform.RunSandboxTests();\n\n startup_timer.Stop(); \/\/ End of Startup Time Measurement.\n\n if (run_loop) {\n if (pool)\n pool->Recycle();\n TRACE_EVENT_BEGIN(\"RendererMain.START_MSG_LOOP\", 0, 0);\n MessageLoop::current()->Run();\n TRACE_EVENT_END(\"RendererMain.START_MSG_LOOP\", 0, 0);\n }\n }\n platform.PlatformUninitialize();\n TRACE_EVENT_END(\"RendererMain\", 0, \"\");\n return 0;\n}\n<|endoftext|>"} {"text":"<commit_before>#include \"line.hpp\"\n#include <glm\/glm.hpp>\n#include <glm\/gtc\/matrix_transform.hpp>\n#include <glm\/gtc\/type_ptr.hpp>\n#include \"matrixstacksingleton.hpp\"\n#include \"logicstate.hpp\"\n\nLine::Line(){\n\tvertices = 0;\n}\nvoid Line::setStartEnd(const glm::vec3 a, const glm::vec3 b){\n\tif(vertices == 0 || vertexSize != 6){\n\t\tvertices = new GLfloat[6];\n\t}\n\tvertices[0] = a[0];\n\tvertices[1] = a[1];\n\tvertices[2] = a[2];\n\n\tvertices[3] = b[0];\n\tvertices[4] = b[1];\n\tvertices[5] = b[2];\n\tsetVertices(vertices, 2*3);\n\n}\nvoid Line::setVertices(GLfloat vertices[], unsigned int size){\n\tthis->vertices = vertices;\n\tvertexSize = size;\n}\nGLfloat* Line::getVertices(){\n\treturn vertices;\n}\nvoid Line::buildStatic(){\n\tglGenBuffers(1, &vboID[0]);\n}\nvoid Line::setShaderLocations(GLuint vertShaderLocation){\n\tthis->vertShaderLocation = vertShaderLocation;\n}\nvoid Line::draw(struct LogicContext* state){\n\tglBindBuffer(GL_ARRAY_BUFFER, vboID[0]);\n\n\tglBufferData(GL_ARRAY_BUFFER, vertexSize * sizeof(GLfloat), vertices, GL_DYNAMIC_DRAW);\n\n\tglUniformMatrix4fv(state->uloc_modelview, 1, GL_FALSE, glm::value_ptr(model_matrix));\n\tglEnableVertexAttribArray(vertShaderLocation);\n\n\tglVertexAttribPointer(\n\t\t\tvertShaderLocation,\n\t\t\t3, \/\/size of attribute\n\t\t\tGL_FLOAT,\n\t\t\tGL_FALSE,\n\t\t\t0, \/\/stride\n\t\t\t(void*)0 \/\/Pointer to the off of the first component of the first element\n\t\t\t);\n\tglDrawArrays(\n\t\t\tGL_LINES,\n\t\t\t0,\n\t\t\tvertexSize \/\/Amount of vertices to draw\n\t\t\t);\n\tglBindBuffer(GL_ARRAY_BUFFER, 0);\n\tglDisableVertexAttribArray(vertShaderLocation);\n\tmodel_matrix = (MatrixStackSingleton::instance())->pop();\n\n}\nvoid Line::update(struct LogicContext* state){\n\tMatrixStackSingleton* instance = MatrixStackSingleton::instance();\n\n\tinstance->push(model_matrix);\n\tmodel_matrix = state->modelview * model_matrix;\n\n}\nvoid Line::translate(glm::vec3 moveBy){\n\tmodel_matrix = glm::translate(model_matrix, moveBy);\n}\nvoid Line::rotate(glm::vec3 rotateAround, float rotateBy){\n\tmodel_matrix = glm::rotate(model_matrix, rotateBy, rotateAround);\n}\nglm::mat4* Line::getModelMatrix(){\n\treturn &model_matrix;\n\n}\nLine::~Line(){\n\tdelete vertices;\n}\n<commit_msg>Fixed creating and deleting vertices<commit_after>#include \"line.hpp\"\n#include <glm\/glm.hpp>\n#include <glm\/gtc\/matrix_transform.hpp>\n#include <glm\/gtc\/type_ptr.hpp>\n#include \"matrixstacksingleton.hpp\"\n#include \"logicstate.hpp\"\n\nLine::Line(){\n\tvertices = new GLfloat[6];\n}\nvoid Line::setStartEnd(const glm::vec3 a, const glm::vec3 b){\n\tvertices[0] = a[0];\n\tvertices[1] = a[1];\n\tvertices[2] = a[2];\n\n\tvertices[3] = b[0];\n\tvertices[4] = b[1];\n\tvertices[5] = b[2];\n\tsetVertices(vertices, 2*3);\n\n}\nvoid Line::setVertices(GLfloat vertices[], unsigned int size){\n\tthis->vertices = vertices;\n\tvertexSize = size;\n}\nGLfloat* Line::getVertices(){\n\treturn vertices;\n}\nvoid Line::buildStatic(){\n\tglGenBuffers(1, &vboID[0]);\n}\nvoid Line::setShaderLocations(GLuint vertShaderLocation){\n\tthis->vertShaderLocation = vertShaderLocation;\n}\nvoid Line::draw(struct LogicContext* state){\n\tglBindBuffer(GL_ARRAY_BUFFER, vboID[0]);\n\n\tglBufferData(GL_ARRAY_BUFFER, vertexSize * sizeof(GLfloat), vertices, GL_DYNAMIC_DRAW);\n\n\tglUniformMatrix4fv(state->uloc_modelview, 1, GL_FALSE, glm::value_ptr(model_matrix));\n\tglEnableVertexAttribArray(vertShaderLocation);\n\n\tglVertexAttribPointer(\n\t\t\tvertShaderLocation,\n\t\t\t3, \/\/size of attribute\n\t\t\tGL_FLOAT,\n\t\t\tGL_FALSE,\n\t\t\t0, \/\/stride\n\t\t\t(void*)0 \/\/Pointer to the off of the first component of the first element\n\t\t\t);\n\tglDrawArrays(\n\t\t\tGL_LINES,\n\t\t\t0,\n\t\t\tvertexSize \/\/Amount of vertices to draw\n\t\t\t);\n\tglBindBuffer(GL_ARRAY_BUFFER, 0);\n\tglDisableVertexAttribArray(vertShaderLocation);\n\tmodel_matrix = (MatrixStackSingleton::instance())->pop();\n\n}\nvoid Line::update(struct LogicContext* state){\n\tMatrixStackSingleton* instance = MatrixStackSingleton::instance();\n\n\tinstance->push(model_matrix);\n\tmodel_matrix = state->modelview * model_matrix;\n\n}\nvoid Line::translate(glm::vec3 moveBy){\n\tmodel_matrix = glm::translate(model_matrix, moveBy);\n}\nvoid Line::rotate(glm::vec3 rotateAround, float rotateBy){\n\tmodel_matrix = glm::rotate(model_matrix, rotateBy, rotateAround);\n}\nglm::mat4* Line::getModelMatrix(){\n\treturn &model_matrix;\n\n}\nLine::~Line(){\n\tdelete[] vertices;\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) 2016 ScyllaDB\n *\/\n\n#pragma once\n\n#include <boost\/intrusive\/list.hpp>\n\nnamespace seastar {\n\n\/\/\/ A non-owning reference to an object.\n\/\/\/\n\/\/\/ weak_ptr allows one to keep a non-owning reference to an object. When the\n\/\/\/ object is destroyed, it notifies all weak_ptr instances pointing to it.\n\/\/\/ A weak_ptr instance pointing to a destroyed object is equivalent to a\n\/\/\/ `nullptr`.\n\/\/\/\n\/\/\/ The referenced object must inherit from weakly_referencable.\n\/\/\/ weak_ptr instances can only be obtained by calling weak_from_this() on\n\/\/\/ the to-be-referenced object.\n\/\/\/\n\/\/\/ \\see weakly_referencable\ntemplate<typename T>\nclass weak_ptr {\n template<typename U>\n friend class weakly_referencable;\nprivate:\n using hook_type = boost::intrusive::list_member_hook<boost::intrusive::link_mode<boost::intrusive::auto_unlink>>;\n hook_type _hook;\n T* _ptr = nullptr;\n weak_ptr(T* p) noexcept : _ptr(p) {}\npublic:\n weak_ptr() noexcept = default;\n weak_ptr(std::nullptr_t) noexcept : weak_ptr() {}\n weak_ptr(weak_ptr&& o) noexcept\n : _ptr(o._ptr)\n {\n _hook.swap_nodes(o._hook);\n o._ptr = nullptr;\n }\n weak_ptr& operator=(weak_ptr&& o) noexcept {\n if (this != &o) {\n this->~weak_ptr();\n new (this) weak_ptr(std::move(o));\n }\n return *this;\n }\n explicit operator bool() const noexcept { return _ptr != nullptr; }\n T* operator->() const noexcept { return _ptr; }\n T& operator*() const noexcept { return *_ptr; }\n T* get() const noexcept { return _ptr; }\n bool operator==(const weak_ptr& o) const noexcept { return _ptr == o._ptr; }\n bool operator!=(const weak_ptr& o) const noexcept { return _ptr != o._ptr; }\n};\n\n\/\/\/ Allows obtaining a non-owning reference (weak_ptr) to the object.\n\/\/\/\n\/\/\/ A live weak_ptr object doesn't prevent the referenced object form being destroyed.\n\/\/\/\n\/\/\/ The underlying pointer held by weak_ptr is valid as long as the referenced object is alive.\n\/\/\/ When the object dies, all weak_ptr objects associated with it are emptied.\n\/\/\/\n\/\/\/ A weak reference is obtained like this:\n\/\/\/\n\/\/\/ class X : public weakly_referencable<X> {};\n\/\/\/ auto x = std::make_unique<X>();\n\/\/\/ weak_ptr<X> ptr = x->weak_from_this();\n\/\/\/\n\/\/\/ The user of weak_ptr can check if it still holds a valid pointer like this:\n\/\/\/\n\/\/\/ if (ptr) ptr->do_something();\n\/\/\/\ntemplate<typename T>\nclass weakly_referencable {\n boost::intrusive::list<weak_ptr<T>,\n boost::intrusive::member_hook<weak_ptr<T>, typename weak_ptr<T>::hook_type, &weak_ptr<T>::_hook>,\n boost::intrusive::constant_time_size<false>> _ptr_list;\npublic:\n weakly_referencable() noexcept = default;\n weakly_referencable(weakly_referencable&&) = delete; \/\/ pointer to this is captured and passed to weak_ptr\n weakly_referencable(const weakly_referencable&) = delete;\n ~weakly_referencable() noexcept {\n _ptr_list.clear_and_dispose([] (weak_ptr<T>* wp) noexcept {\n wp->_ptr = nullptr;\n });\n }\n weak_ptr<T> weak_from_this() noexcept {\n weak_ptr<T> ptr(static_cast<T*>(this));\n _ptr_list.push_back(ptr);\n return ptr;\n }\n};\n\n}\n\n<commit_msg>core: weak_ptr, weakly_referencable: implement empty default constructor<commit_after>\/*\n * This file is open source software, licensed to you under the terms\n * of the Apache License, Version 2.0 (the \"License\"). See the NOTICE file\n * distributed with this work for additional information regarding copyright\n * ownership. You may not use this file except in compliance with the License.\n *\n * You may obtain a copy of the License at\n *\n * http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing,\n * software distributed under the License is distributed on an\n * \"AS IS\" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY\n * KIND, either express or implied. See the License for the\n * specific language governing permissions and limitations\n * under the License.\n *\/\n\/*\n * Copyright (C) 2016 ScyllaDB\n *\/\n\n#pragma once\n\n#include <boost\/intrusive\/list.hpp>\n\nnamespace seastar {\n\n\/\/\/ A non-owning reference to an object.\n\/\/\/\n\/\/\/ weak_ptr allows one to keep a non-owning reference to an object. When the\n\/\/\/ object is destroyed, it notifies all weak_ptr instances pointing to it.\n\/\/\/ A weak_ptr instance pointing to a destroyed object is equivalent to a\n\/\/\/ `nullptr`.\n\/\/\/\n\/\/\/ The referenced object must inherit from weakly_referencable.\n\/\/\/ weak_ptr instances can only be obtained by calling weak_from_this() on\n\/\/\/ the to-be-referenced object.\n\/\/\/\n\/\/\/ \\see weakly_referencable\ntemplate<typename T>\nclass weak_ptr {\n template<typename U>\n friend class weakly_referencable;\nprivate:\n using hook_type = boost::intrusive::list_member_hook<boost::intrusive::link_mode<boost::intrusive::auto_unlink>>;\n hook_type _hook;\n T* _ptr = nullptr;\n weak_ptr(T* p) noexcept : _ptr(p) {}\npublic:\n \/\/ Note: The default constructor's body is implemented as no-op\n \/\/ rather than `noexcept = default` due to a bug with gcc 9.3.1\n \/\/ that deletes the constructor since boost::intrusive::list_member_hook\n \/\/ is not default_nothrow_constructible.\n weak_ptr() noexcept {}\n weak_ptr(std::nullptr_t) noexcept : weak_ptr() {}\n weak_ptr(weak_ptr&& o) noexcept\n : _ptr(o._ptr)\n {\n _hook.swap_nodes(o._hook);\n o._ptr = nullptr;\n }\n weak_ptr& operator=(weak_ptr&& o) noexcept {\n if (this != &o) {\n this->~weak_ptr();\n new (this) weak_ptr(std::move(o));\n }\n return *this;\n }\n explicit operator bool() const noexcept { return _ptr != nullptr; }\n T* operator->() const noexcept { return _ptr; }\n T& operator*() const noexcept { return *_ptr; }\n T* get() const noexcept { return _ptr; }\n bool operator==(const weak_ptr& o) const noexcept { return _ptr == o._ptr; }\n bool operator!=(const weak_ptr& o) const noexcept { return _ptr != o._ptr; }\n};\n\n\/\/\/ Allows obtaining a non-owning reference (weak_ptr) to the object.\n\/\/\/\n\/\/\/ A live weak_ptr object doesn't prevent the referenced object form being destroyed.\n\/\/\/\n\/\/\/ The underlying pointer held by weak_ptr is valid as long as the referenced object is alive.\n\/\/\/ When the object dies, all weak_ptr objects associated with it are emptied.\n\/\/\/\n\/\/\/ A weak reference is obtained like this:\n\/\/\/\n\/\/\/ class X : public weakly_referencable<X> {};\n\/\/\/ auto x = std::make_unique<X>();\n\/\/\/ weak_ptr<X> ptr = x->weak_from_this();\n\/\/\/\n\/\/\/ The user of weak_ptr can check if it still holds a valid pointer like this:\n\/\/\/\n\/\/\/ if (ptr) ptr->do_something();\n\/\/\/\ntemplate<typename T>\nclass weakly_referencable {\n boost::intrusive::list<weak_ptr<T>,\n boost::intrusive::member_hook<weak_ptr<T>, typename weak_ptr<T>::hook_type, &weak_ptr<T>::_hook>,\n boost::intrusive::constant_time_size<false>> _ptr_list;\npublic:\n \/\/ Note: The default constructor's body is implemented as no-op\n \/\/ rather than `noexcept = default` due to a bug with gcc 9.3.1\n \/\/ that deletes the constructor since boost::intrusive::member_hook\n \/\/ is not default_nothrow_constructible.\n weakly_referencable() noexcept {}\n weakly_referencable(weakly_referencable&&) = delete; \/\/ pointer to this is captured and passed to weak_ptr\n weakly_referencable(const weakly_referencable&) = delete;\n ~weakly_referencable() noexcept {\n _ptr_list.clear_and_dispose([] (weak_ptr<T>* wp) noexcept {\n wp->_ptr = nullptr;\n });\n }\n weak_ptr<T> weak_from_this() noexcept {\n weak_ptr<T> ptr(static_cast<T*>(this));\n _ptr_list.push_back(ptr);\n return ptr;\n }\n};\n\n}\n\n<|endoftext|>"} {"text":"<commit_before>\/*\n * This file is open source software, licensed to you under the terms\n * of the Apache License, Version 2.0 (the \"License\"). See the NOTICE file\n * distributed with this work for additional information regarding copyright\n * ownership. You may not use this file except in compliance with the License.\n *\n * You may obtain a copy of the License at\n *\n * http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing,\n * software distributed under the License is distributed on an\n * \"AS IS\" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY\n * KIND, either express or implied. See the License for the\n * specific language governing permissions and limitations\n * under the License.\n *\/\n\/*\n * Copyright (C) 2015 Cloudius Systems, Ltd.\n *\/\n\n#pragma once\n\n#include <seastar\/net\/api.hh>\n#include <stdexcept>\n#include <string>\n#include <boost\/any.hpp>\n#include <boost\/type.hpp>\n#include <seastar\/util\/std-compat.hh>\n#include <seastar\/util\/variant_utils.hh>\n#include <seastar\/core\/timer.hh>\n#include <seastar\/core\/circular_buffer.hh>\n#include <seastar\/core\/simple-stream.hh>\n#include <seastar\/core\/lowres_clock.hh>\n#include <boost\/functional\/hash.hpp>\n#include <seastar\/core\/sharded.hh>\n\nnamespace seastar {\n\nnamespace rpc {\n\nusing rpc_clock_type = lowres_clock;\n\n\/\/ used to tag a type for serializers\ntemplate<typename T>\nusing type = boost::type<T>;\n\nstruct stats {\n using counter_type = uint64_t;\n counter_type replied = 0;\n counter_type pending = 0;\n counter_type exception_received = 0;\n counter_type sent_messages = 0;\n counter_type wait_reply = 0;\n counter_type timeout = 0;\n};\n\n\nstruct client_info {\n socket_address addr;\n std::unordered_map<sstring, boost::any> user_data;\n template <typename T>\n void attach_auxiliary(const sstring& key, T&& object) {\n user_data.emplace(key, boost::any(std::forward<T>(object)));\n }\n template <typename T>\n T& retrieve_auxiliary(const sstring& key) {\n auto it = user_data.find(key);\n assert(it != user_data.end());\n return boost::any_cast<T&>(it->second);\n }\n template <typename T>\n typename std::add_const<T>::type& retrieve_auxiliary(const sstring& key) const {\n return const_cast<client_info*>(this)->retrieve_auxiliary<typename std::add_const<T>::type>(key);\n }\n};\n\nclass error : public std::runtime_error {\npublic:\n error(const std::string& msg) : std::runtime_error(msg) {}\n};\n\nclass closed_error : public error {\npublic:\n closed_error() : error(\"connection is closed\") {}\n};\n\nclass timeout_error : public error {\npublic:\n timeout_error() : error(\"rpc call timed out\") {}\n};\n\nclass unknown_verb_error : public error {\npublic:\n uint64_t type;\n unknown_verb_error(uint64_t type_) : error(\"unknown verb\"), type(type_) {}\n};\n\nclass unknown_exception_error : public error {\npublic:\n unknown_exception_error() : error(\"unknown exception\") {}\n};\n\nclass rpc_protocol_error : public error {\npublic:\n rpc_protocol_error() : error(\"rpc protocol exception\") {}\n};\n\nclass canceled_error : public error {\npublic:\n canceled_error() : error(\"rpc call was canceled\") {}\n};\n\nclass stream_closed : public error {\npublic:\n stream_closed() : error(\"rpc stream was closed by peer\") {}\n};\n\nstruct no_wait_type {};\n\n\/\/ return this from a callback if client does not want to waiting for a reply\nextern no_wait_type no_wait;\n\n\/\/\/ \\addtogroup rpc\n\/\/\/ @{\n\ntemplate <typename T>\nclass optional : public compat::optional<T> {\npublic:\n using compat::optional<T>::optional;\n};\n\nclass opt_time_point : public compat::optional<rpc_clock_type::time_point> {\npublic:\n using compat::optional<rpc_clock_type::time_point>::optional;\n opt_time_point(compat::optional<rpc_clock_type::time_point> time_point) {\n static_cast<compat::optional<rpc_clock_type::time_point>&>(*this) = time_point;\n }\n};\n\n\/\/\/ @}\n\nstruct cancellable {\n std::function<void()> cancel_send;\n std::function<void()> cancel_wait;\n cancellable** send_back_pointer = nullptr;\n cancellable** wait_back_pointer = nullptr;\n cancellable() = default;\n cancellable(cancellable&& x) : cancel_send(std::move(x.cancel_send)), cancel_wait(std::move(x.cancel_wait)), send_back_pointer(x.send_back_pointer), wait_back_pointer(x.wait_back_pointer) {\n if (send_back_pointer) {\n *send_back_pointer = this;\n x.send_back_pointer = nullptr;\n }\n if (wait_back_pointer) {\n *wait_back_pointer = this;\n x.wait_back_pointer = nullptr;\n }\n }\n cancellable& operator=(cancellable&& x) {\n if (&x != this) {\n this->~cancellable();\n new (this) cancellable(std::move(x));\n }\n return *this;\n }\n void cancel() {\n if (cancel_send) {\n cancel_send();\n }\n if (cancel_wait) {\n cancel_wait();\n }\n }\n ~cancellable() {\n cancel();\n }\n};\n\nstruct rcv_buf {\n uint32_t size = 0;\n compat::optional<semaphore_units<>> su;\n compat::variant<std::vector<temporary_buffer<char>>, temporary_buffer<char>> bufs;\n using iterator = std::vector<temporary_buffer<char>>::iterator;\n rcv_buf() {}\n explicit rcv_buf(size_t size_) : size(size_) {}\n explicit rcv_buf(temporary_buffer<char> b) : size(b.size()), bufs(std::move(b)) {};\n explicit rcv_buf(std::vector<temporary_buffer<char>> bufs, size_t size)\n : size(size), bufs(std::move(bufs)) {};\n};\n\nstruct snd_buf {\n \/\/ Preferred, but not required, chunk size.\n static constexpr size_t chunk_size = 128*1024;\n uint32_t size = 0;\n compat::variant<std::vector<temporary_buffer<char>>, temporary_buffer<char>> bufs;\n using iterator = std::vector<temporary_buffer<char>>::iterator;\n snd_buf() {}\n explicit snd_buf(size_t size_);\n explicit snd_buf(temporary_buffer<char> b) : size(b.size()), bufs(std::move(b)) {};\n\n explicit snd_buf(std::vector<temporary_buffer<char>> bufs, size_t size)\n : size(size), bufs(std::move(bufs)) {};\n\n temporary_buffer<char>& front();\n};\n\nstatic inline memory_input_stream<rcv_buf::iterator> make_deserializer_stream(rcv_buf& input) {\n auto* b = compat::get_if<temporary_buffer<char>>(&input.bufs);\n if (b) {\n return memory_input_stream<rcv_buf::iterator>(memory_input_stream<rcv_buf::iterator>::simple(b->begin(), b->size()));\n } else {\n auto& ar = compat::get<std::vector<temporary_buffer<char>>>(input.bufs);\n return memory_input_stream<rcv_buf::iterator>(memory_input_stream<rcv_buf::iterator>::fragmented(ar.begin(), input.size));\n }\n}\n\nclass compressor {\npublic:\n virtual ~compressor() {}\n \/\/ compress data and leave head_space bytes at the beginning of returned buffer\n virtual snd_buf compress(size_t head_space, snd_buf data) = 0;\n \/\/ decompress data\n virtual rcv_buf decompress(rcv_buf data) = 0;\n\n \/\/ factory to create compressor for a connection\n class factory {\n public:\n virtual ~factory() {}\n \/\/ return feature string that will be sent as part of protocol negotiation\n virtual const sstring& supported() const = 0;\n \/\/ negotiate compress algorithm\n virtual std::unique_ptr<compressor> negotiate(sstring feature, bool is_server) const = 0;\n };\n};\n\nclass connection;\n\nstruct connection_id {\n uint64_t id;\n bool operator==(const connection_id& o) const {\n return id == o.id;\n }\n operator bool() const {\n return shard() != 0xffff;\n }\n size_t shard() const {\n return size_t(id & 0xffff);\n }\n constexpr static connection_id make_invalid_id(uint64_t id = 0) {\n return make_id(id, 0xffff);\n }\n constexpr static connection_id make_id(uint64_t id, uint16_t shard) {\n return {id << 16 | shard};\n }\n};\n\nconstexpr connection_id invalid_connection_id = connection_id::make_invalid_id();\n\nstd::ostream& operator<<(std::ostream&, const connection_id&);\n\nusing xshard_connection_ptr = lw_shared_ptr<foreign_ptr<shared_ptr<connection>>>;\nconstexpr size_t max_queued_stream_buffers = 50;\nconstexpr size_t max_stream_buffers_memory = 100 * 1024;\n\n\/\/\/ \\addtogroup rpc\n\/\/\/ @{\n\n\/\/ send data Out...\ntemplate<typename... Out>\nclass sink {\npublic:\n class impl {\n protected:\n xshard_connection_ptr _con;\n semaphore _sem;\n std::exception_ptr _ex;\n impl(xshard_connection_ptr con) : _con(std::move(con)), _sem(max_stream_buffers_memory) {}\n public:\n virtual ~impl() {};\n virtual future<> operator()(const Out&... args) = 0;\n virtual future<> close() = 0;\n virtual future<> flush() = 0;\n friend sink;\n };\n\nprivate:\n shared_ptr<impl> _impl;\n\npublic:\n sink(shared_ptr<impl> impl) : _impl(std::move(impl)) {}\n future<> operator()(const Out&... args) {\n return _impl->operator()(args...);\n }\n future<> close() {\n return _impl->close();\n }\n \/\/ Calling this function makes sure that any data buffered\n \/\/ by the stream sink will be flushed to the network.\n \/\/ It does not mean the data was received by the corresponding\n \/\/ source.\n future<> flush() {\n return _impl->flush();\n }\n connection_id get_id() const;\n};\n\n\/\/ receive data In...\ntemplate<typename... In>\nclass source {\npublic:\n class impl {\n protected:\n xshard_connection_ptr _con;\n circular_buffer<foreign_ptr<std::unique_ptr<rcv_buf>>> _bufs;\n impl(xshard_connection_ptr con) : _con(std::move(con)) {\n _bufs.reserve(max_queued_stream_buffers);\n }\n public:\n virtual ~impl() {}\n virtual future<compat::optional<std::tuple<In...>>> operator()() = 0;\n friend source;\n };\nprivate:\n shared_ptr<impl> _impl;\n\npublic:\n source(shared_ptr<impl> impl) : _impl(std::move(impl)) {}\n future<compat::optional<std::tuple<In...>>> operator()() {\n return _impl->operator()();\n };\n connection_id get_id() const;\n template<typename Serializer, typename... Out> sink<Out...> make_sink();\n};\n\n\/\/\/ Used to return multiple values in rpc without variadic futures\n\/\/\/\n\/\/\/ If you wish to return multiple values from an rpc procedure, use a\n\/\/\/ signature `future<rpc::tuple<return type list> (argument list)>>`. This\n\/\/\/ will be marshalled by rpc, so you do not need to have your Serializer\n\/\/\/ serialize\/deserialize this tuple type. The serialization format is\n\/\/\/ compatible with the deprecated variadic future support, and is compatible\n\/\/\/ with adding new return types in a backwards compatible way provided new\n\/\/\/ parameters are appended only, and wrapped with rpc::optional:\n\/\/\/ `future<rpc::tuple<existing return type list, rpc::optional<new_return_type>>> (argument list)`\n\/\/\/\n\/\/\/ You may also use another tuple type, such as std::tuple. In this case,\n\/\/\/ your Serializer type must recognize your tuple type and provide serialization\n\/\/\/ and deserialization for it.\ntemplate <typename... T>\nclass tuple : public std::tuple<T...> {\npublic:\n using std::tuple<T...>::tuple;\n tuple(std::tuple<T...>&& x) : std::tuple<T...>(std::move(x)) {}\n};\n\n\/\/\/ @}\n\n#if __cplusplus >= 201703L\n\ntemplate <typename... T>\ntuple(T&&...) -> tuple<T...>;\n\n#endif\n\n} \/\/ namespace rpc\n\n}\n\nnamespace std {\ntemplate<>\nstruct hash<seastar::rpc::connection_id> {\n size_t operator()(const seastar::rpc::connection_id& id) const {\n size_t h = 0;\n boost::hash_combine(h, std::hash<uint64_t>{}(id.id));\n return h;\n }\n};\n\ntemplate <typename... T>\nstruct tuple_size<seastar::rpc::tuple<T...>> : tuple_size<tuple<T...>> {\n};\n\ntemplate <size_t I, typename... T>\nstruct tuple_element<I, seastar::rpc::tuple<T...>> : tuple_element<I, tuple<T...>> {\n};\n\n}\n<commit_msg>rpc: Delete __cplusplus check<commit_after>\/*\n * This file is open source software, licensed to you under the terms\n * of the Apache License, Version 2.0 (the \"License\"). See the NOTICE file\n * distributed with this work for additional information regarding copyright\n * ownership. You may not use this file except in compliance with the License.\n *\n * You may obtain a copy of the License at\n *\n * http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing,\n * software distributed under the License is distributed on an\n * \"AS IS\" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY\n * KIND, either express or implied. See the License for the\n * specific language governing permissions and limitations\n * under the License.\n *\/\n\/*\n * Copyright (C) 2015 Cloudius Systems, Ltd.\n *\/\n\n#pragma once\n\n#include <seastar\/net\/api.hh>\n#include <stdexcept>\n#include <string>\n#include <boost\/any.hpp>\n#include <boost\/type.hpp>\n#include <seastar\/util\/std-compat.hh>\n#include <seastar\/util\/variant_utils.hh>\n#include <seastar\/core\/timer.hh>\n#include <seastar\/core\/circular_buffer.hh>\n#include <seastar\/core\/simple-stream.hh>\n#include <seastar\/core\/lowres_clock.hh>\n#include <boost\/functional\/hash.hpp>\n#include <seastar\/core\/sharded.hh>\n\nnamespace seastar {\n\nnamespace rpc {\n\nusing rpc_clock_type = lowres_clock;\n\n\/\/ used to tag a type for serializers\ntemplate<typename T>\nusing type = boost::type<T>;\n\nstruct stats {\n using counter_type = uint64_t;\n counter_type replied = 0;\n counter_type pending = 0;\n counter_type exception_received = 0;\n counter_type sent_messages = 0;\n counter_type wait_reply = 0;\n counter_type timeout = 0;\n};\n\n\nstruct client_info {\n socket_address addr;\n std::unordered_map<sstring, boost::any> user_data;\n template <typename T>\n void attach_auxiliary(const sstring& key, T&& object) {\n user_data.emplace(key, boost::any(std::forward<T>(object)));\n }\n template <typename T>\n T& retrieve_auxiliary(const sstring& key) {\n auto it = user_data.find(key);\n assert(it != user_data.end());\n return boost::any_cast<T&>(it->second);\n }\n template <typename T>\n typename std::add_const<T>::type& retrieve_auxiliary(const sstring& key) const {\n return const_cast<client_info*>(this)->retrieve_auxiliary<typename std::add_const<T>::type>(key);\n }\n};\n\nclass error : public std::runtime_error {\npublic:\n error(const std::string& msg) : std::runtime_error(msg) {}\n};\n\nclass closed_error : public error {\npublic:\n closed_error() : error(\"connection is closed\") {}\n};\n\nclass timeout_error : public error {\npublic:\n timeout_error() : error(\"rpc call timed out\") {}\n};\n\nclass unknown_verb_error : public error {\npublic:\n uint64_t type;\n unknown_verb_error(uint64_t type_) : error(\"unknown verb\"), type(type_) {}\n};\n\nclass unknown_exception_error : public error {\npublic:\n unknown_exception_error() : error(\"unknown exception\") {}\n};\n\nclass rpc_protocol_error : public error {\npublic:\n rpc_protocol_error() : error(\"rpc protocol exception\") {}\n};\n\nclass canceled_error : public error {\npublic:\n canceled_error() : error(\"rpc call was canceled\") {}\n};\n\nclass stream_closed : public error {\npublic:\n stream_closed() : error(\"rpc stream was closed by peer\") {}\n};\n\nstruct no_wait_type {};\n\n\/\/ return this from a callback if client does not want to waiting for a reply\nextern no_wait_type no_wait;\n\n\/\/\/ \\addtogroup rpc\n\/\/\/ @{\n\ntemplate <typename T>\nclass optional : public compat::optional<T> {\npublic:\n using compat::optional<T>::optional;\n};\n\nclass opt_time_point : public compat::optional<rpc_clock_type::time_point> {\npublic:\n using compat::optional<rpc_clock_type::time_point>::optional;\n opt_time_point(compat::optional<rpc_clock_type::time_point> time_point) {\n static_cast<compat::optional<rpc_clock_type::time_point>&>(*this) = time_point;\n }\n};\n\n\/\/\/ @}\n\nstruct cancellable {\n std::function<void()> cancel_send;\n std::function<void()> cancel_wait;\n cancellable** send_back_pointer = nullptr;\n cancellable** wait_back_pointer = nullptr;\n cancellable() = default;\n cancellable(cancellable&& x) : cancel_send(std::move(x.cancel_send)), cancel_wait(std::move(x.cancel_wait)), send_back_pointer(x.send_back_pointer), wait_back_pointer(x.wait_back_pointer) {\n if (send_back_pointer) {\n *send_back_pointer = this;\n x.send_back_pointer = nullptr;\n }\n if (wait_back_pointer) {\n *wait_back_pointer = this;\n x.wait_back_pointer = nullptr;\n }\n }\n cancellable& operator=(cancellable&& x) {\n if (&x != this) {\n this->~cancellable();\n new (this) cancellable(std::move(x));\n }\n return *this;\n }\n void cancel() {\n if (cancel_send) {\n cancel_send();\n }\n if (cancel_wait) {\n cancel_wait();\n }\n }\n ~cancellable() {\n cancel();\n }\n};\n\nstruct rcv_buf {\n uint32_t size = 0;\n compat::optional<semaphore_units<>> su;\n compat::variant<std::vector<temporary_buffer<char>>, temporary_buffer<char>> bufs;\n using iterator = std::vector<temporary_buffer<char>>::iterator;\n rcv_buf() {}\n explicit rcv_buf(size_t size_) : size(size_) {}\n explicit rcv_buf(temporary_buffer<char> b) : size(b.size()), bufs(std::move(b)) {};\n explicit rcv_buf(std::vector<temporary_buffer<char>> bufs, size_t size)\n : size(size), bufs(std::move(bufs)) {};\n};\n\nstruct snd_buf {\n \/\/ Preferred, but not required, chunk size.\n static constexpr size_t chunk_size = 128*1024;\n uint32_t size = 0;\n compat::variant<std::vector<temporary_buffer<char>>, temporary_buffer<char>> bufs;\n using iterator = std::vector<temporary_buffer<char>>::iterator;\n snd_buf() {}\n explicit snd_buf(size_t size_);\n explicit snd_buf(temporary_buffer<char> b) : size(b.size()), bufs(std::move(b)) {};\n\n explicit snd_buf(std::vector<temporary_buffer<char>> bufs, size_t size)\n : size(size), bufs(std::move(bufs)) {};\n\n temporary_buffer<char>& front();\n};\n\nstatic inline memory_input_stream<rcv_buf::iterator> make_deserializer_stream(rcv_buf& input) {\n auto* b = compat::get_if<temporary_buffer<char>>(&input.bufs);\n if (b) {\n return memory_input_stream<rcv_buf::iterator>(memory_input_stream<rcv_buf::iterator>::simple(b->begin(), b->size()));\n } else {\n auto& ar = compat::get<std::vector<temporary_buffer<char>>>(input.bufs);\n return memory_input_stream<rcv_buf::iterator>(memory_input_stream<rcv_buf::iterator>::fragmented(ar.begin(), input.size));\n }\n}\n\nclass compressor {\npublic:\n virtual ~compressor() {}\n \/\/ compress data and leave head_space bytes at the beginning of returned buffer\n virtual snd_buf compress(size_t head_space, snd_buf data) = 0;\n \/\/ decompress data\n virtual rcv_buf decompress(rcv_buf data) = 0;\n\n \/\/ factory to create compressor for a connection\n class factory {\n public:\n virtual ~factory() {}\n \/\/ return feature string that will be sent as part of protocol negotiation\n virtual const sstring& supported() const = 0;\n \/\/ negotiate compress algorithm\n virtual std::unique_ptr<compressor> negotiate(sstring feature, bool is_server) const = 0;\n };\n};\n\nclass connection;\n\nstruct connection_id {\n uint64_t id;\n bool operator==(const connection_id& o) const {\n return id == o.id;\n }\n operator bool() const {\n return shard() != 0xffff;\n }\n size_t shard() const {\n return size_t(id & 0xffff);\n }\n constexpr static connection_id make_invalid_id(uint64_t id = 0) {\n return make_id(id, 0xffff);\n }\n constexpr static connection_id make_id(uint64_t id, uint16_t shard) {\n return {id << 16 | shard};\n }\n};\n\nconstexpr connection_id invalid_connection_id = connection_id::make_invalid_id();\n\nstd::ostream& operator<<(std::ostream&, const connection_id&);\n\nusing xshard_connection_ptr = lw_shared_ptr<foreign_ptr<shared_ptr<connection>>>;\nconstexpr size_t max_queued_stream_buffers = 50;\nconstexpr size_t max_stream_buffers_memory = 100 * 1024;\n\n\/\/\/ \\addtogroup rpc\n\/\/\/ @{\n\n\/\/ send data Out...\ntemplate<typename... Out>\nclass sink {\npublic:\n class impl {\n protected:\n xshard_connection_ptr _con;\n semaphore _sem;\n std::exception_ptr _ex;\n impl(xshard_connection_ptr con) : _con(std::move(con)), _sem(max_stream_buffers_memory) {}\n public:\n virtual ~impl() {};\n virtual future<> operator()(const Out&... args) = 0;\n virtual future<> close() = 0;\n virtual future<> flush() = 0;\n friend sink;\n };\n\nprivate:\n shared_ptr<impl> _impl;\n\npublic:\n sink(shared_ptr<impl> impl) : _impl(std::move(impl)) {}\n future<> operator()(const Out&... args) {\n return _impl->operator()(args...);\n }\n future<> close() {\n return _impl->close();\n }\n \/\/ Calling this function makes sure that any data buffered\n \/\/ by the stream sink will be flushed to the network.\n \/\/ It does not mean the data was received by the corresponding\n \/\/ source.\n future<> flush() {\n return _impl->flush();\n }\n connection_id get_id() const;\n};\n\n\/\/ receive data In...\ntemplate<typename... In>\nclass source {\npublic:\n class impl {\n protected:\n xshard_connection_ptr _con;\n circular_buffer<foreign_ptr<std::unique_ptr<rcv_buf>>> _bufs;\n impl(xshard_connection_ptr con) : _con(std::move(con)) {\n _bufs.reserve(max_queued_stream_buffers);\n }\n public:\n virtual ~impl() {}\n virtual future<compat::optional<std::tuple<In...>>> operator()() = 0;\n friend source;\n };\nprivate:\n shared_ptr<impl> _impl;\n\npublic:\n source(shared_ptr<impl> impl) : _impl(std::move(impl)) {}\n future<compat::optional<std::tuple<In...>>> operator()() {\n return _impl->operator()();\n };\n connection_id get_id() const;\n template<typename Serializer, typename... Out> sink<Out...> make_sink();\n};\n\n\/\/\/ Used to return multiple values in rpc without variadic futures\n\/\/\/\n\/\/\/ If you wish to return multiple values from an rpc procedure, use a\n\/\/\/ signature `future<rpc::tuple<return type list> (argument list)>>`. This\n\/\/\/ will be marshalled by rpc, so you do not need to have your Serializer\n\/\/\/ serialize\/deserialize this tuple type. The serialization format is\n\/\/\/ compatible with the deprecated variadic future support, and is compatible\n\/\/\/ with adding new return types in a backwards compatible way provided new\n\/\/\/ parameters are appended only, and wrapped with rpc::optional:\n\/\/\/ `future<rpc::tuple<existing return type list, rpc::optional<new_return_type>>> (argument list)`\n\/\/\/\n\/\/\/ You may also use another tuple type, such as std::tuple. In this case,\n\/\/\/ your Serializer type must recognize your tuple type and provide serialization\n\/\/\/ and deserialization for it.\ntemplate <typename... T>\nclass tuple : public std::tuple<T...> {\npublic:\n using std::tuple<T...>::tuple;\n tuple(std::tuple<T...>&& x) : std::tuple<T...>(std::move(x)) {}\n};\n\n\/\/\/ @}\n\ntemplate <typename... T>\ntuple(T&&...) -> tuple<T...>;\n\n} \/\/ namespace rpc\n\n}\n\nnamespace std {\ntemplate<>\nstruct hash<seastar::rpc::connection_id> {\n size_t operator()(const seastar::rpc::connection_id& id) const {\n size_t h = 0;\n boost::hash_combine(h, std::hash<uint64_t>{}(id.id));\n return h;\n }\n};\n\ntemplate <typename... T>\nstruct tuple_size<seastar::rpc::tuple<T...>> : tuple_size<tuple<T...>> {\n};\n\ntemplate <size_t I, typename... T>\nstruct tuple_element<I, seastar::rpc::tuple<T...>> : tuple_element<I, tuple<T...>> {\n};\n\n}\n<|endoftext|>"} {"text":"<commit_before>\/\/============================================================================\n\/\/ include\/vsmc\/internal\/config.hpp\n\/\/----------------------------------------------------------------------------\n\/\/\n\/\/ vSMC: Scalable Monte Carlo\n\/\/\n\/\/ This file is distribured under the 2-clauses BSD License.\n\/\/ See LICENSE for details.\n\/\/============================================================================\n\n#ifndef VSMC_INTERNAL_CONFIG_HPP\n#define VSMC_INTERNAL_CONFIG_HPP\n\n#include <vsmc\/internal\/compiler.hpp>\n\n#ifndef VSMC_NO_STATIC_ASSERT\n#define VSMC_NO_STATIC_ASSERT 0\n#endif\n\n#ifndef VSMC_NO_RUNTIME_ASSERT\n#ifndef NDEBUG\n#define VSMC_NO_RUNTIME_ASSERT 0\n#else\n#define VSMC_NO_RUNTIME_ASSERT 1\n#endif\n#endif\n\n#ifndef VSMC_NO_RUNTIME_WARNING\n#ifndef NDEBUG\n#define VSMC_NO_RUNTIME_WARNING 0\n#else\n#define VSMC_NO_RUNTIME_WARNING 1\n#endif\n#endif\n\n\/\/\/ \\brief Turn vSMC runtime assertions into exceptions\n\/\/\/ \\ingroup Config\n#ifndef VSMC_RUNTIME_ASSERT_AS_EXCEPTION\n#define VSMC_RUNTIME_ASSERT_AS_EXCEPTION 0\n#endif\n\n\/\/\/ \\brief Turn vSMC runtime warnings into exceptions\n\/\/\/ \\ingroup Config\n#ifndef VSMC_RUNTIME_WARNING_AS_EXCEPTION\n#define VSMC_RUNTIME_WARNING_AS_EXCEPTION 0\n#endif\n\n#ifndef VSMC_USE_AES_NI\n#define VSMC_USE_AES_NI 0\n#endif\n\n#ifndef VSMC_USE_RD_RAND\n#define VSMC_USE_RD_RAND 0\n#endif\n\n#ifndef VSMC_USE_RD_SEED\n#define VSMC_USE_RD_SEED 0\n#endif\n\n#ifndef VSMC_USE_CXX11LIB_FUTURE\n#define VSMC_USE_CXX11LIB_FUTURE VSMC_HAS_CXX11LIB_FUTURE\n#endif\n\n#ifndef VSMC_USE_MPI\n#define VSMC_USE_MPI 0\n#endif\n\n#ifndef VSMC_USE_OPENCL\n#define VSMC_USE_OPENCL 0\n#endif\n\n#ifndef VSMC_USE_MKL\n#define VSMC_USE_MKL 0\n#endif\n\n#ifndef VSMC_USE_MKL_CBLAS\n#define VSMC_USE_MKL_CBLAS VSMC_USE_MKL\n#endif\n\n#ifndef VSMC_USE_MKL_VML\n#define VSMC_USE_MKL_VML VSMC_USE_MKL\n#endif\n\n#ifndef VSMC_USE_MKL_VSL\n#define VSMC_USE_MKL_VSL VSMC_USE_MKL\n#endif\n\n#ifndef VSMC_USE_VECLIB\n#if VSMC_MAC_VERSION_MIN_REQUIRED(VSMC_MAC_10_4)\n#define VSMC_USE_VECLIB 1\n#else\n#define VSMC_USE_VECLIB 0\n#endif\n\n#ifndef VSMC_USE_VECLIB_CBLAS\n#define VSMC_USE_VECLIB_CBLAS VSMC_USE_VECLIB\n#endif\n\n#ifndef VSMC_USE_VECLIB_VFORCE\n#define VSMC_USE_VECLIB_VFORCE VSMC_USE_VECLIB\n#endif\n\n#ifndef VSMC_USE_CILK\n#if defined(__INTEL_COMPILER) && __INTEL_COMPILER >= 1210\n#define VSMC_USE_CILK 1\n#else\n#define VSMC_USE_CILK 0\n#endif\n#endif\n\n#ifndef VSMC_USE_GCD\n#if VSMC_MAC_VERSION_MIN_REQUIRED(VSMC_MAC_10_6)\n#define VSMC_USE_GCD 1\n#else\n#define VSMC_USE_GCD 0\n#endif\n#endif\n\n#ifndef VSMC_USE_GCD_LION\n#if VSMC_MAC_VERSION_MIN_REQUIRED(VSMC_MAC_10_7)\n#define VSMC_USE_GCD_LION 1\n#else\n#define VSMC_USE_GCD_LION 0\n#endif\n#endif\n\n#ifndef VSMC_USE_OMP\n#ifdef _OPENMP\n#define VSMC_USE_OMP 1\n#else\n#define VSMC_USE_OMP 0\n#endif\n#endif\n\n#ifndef VSMC_USE_PPL\n#if defined(_MSC_VER) && _MSC_VER >= 1600\n#define VSMC_USE_PPL 1\n#else\n#define VSMC_USE_PPL 0\n#endif\n#endif\n\n#ifndef VSMC_USE_TBB\n#define VSMC_USE_TBB 0\n#endif\n\n#ifndef VSMC_USE_HDF5\n#define VSMC_USE_HDF5 0\n#endif\n\n#endif \/\/ VSMC_INTERNAL_CONFIG_HPP\n<commit_msg>fix config<commit_after>\/\/============================================================================\n\/\/ include\/vsmc\/internal\/config.hpp\n\/\/----------------------------------------------------------------------------\n\/\/\n\/\/ vSMC: Scalable Monte Carlo\n\/\/\n\/\/ This file is distribured under the 2-clauses BSD License.\n\/\/ See LICENSE for details.\n\/\/============================================================================\n\n#ifndef VSMC_INTERNAL_CONFIG_HPP\n#define VSMC_INTERNAL_CONFIG_HPP\n\n#include <vsmc\/internal\/compiler.hpp>\n\n#ifndef VSMC_NO_STATIC_ASSERT\n#define VSMC_NO_STATIC_ASSERT 0\n#endif\n\n#ifndef VSMC_NO_RUNTIME_ASSERT\n#ifndef NDEBUG\n#define VSMC_NO_RUNTIME_ASSERT 0\n#else\n#define VSMC_NO_RUNTIME_ASSERT 1\n#endif\n#endif\n\n#ifndef VSMC_NO_RUNTIME_WARNING\n#ifndef NDEBUG\n#define VSMC_NO_RUNTIME_WARNING 0\n#else\n#define VSMC_NO_RUNTIME_WARNING 1\n#endif\n#endif\n\n\/\/\/ \\brief Turn vSMC runtime assertions into exceptions\n\/\/\/ \\ingroup Config\n#ifndef VSMC_RUNTIME_ASSERT_AS_EXCEPTION\n#define VSMC_RUNTIME_ASSERT_AS_EXCEPTION 0\n#endif\n\n\/\/\/ \\brief Turn vSMC runtime warnings into exceptions\n\/\/\/ \\ingroup Config\n#ifndef VSMC_RUNTIME_WARNING_AS_EXCEPTION\n#define VSMC_RUNTIME_WARNING_AS_EXCEPTION 0\n#endif\n\n#ifndef VSMC_USE_AES_NI\n#define VSMC_USE_AES_NI 0\n#endif\n\n#ifndef VSMC_USE_RD_RAND\n#define VSMC_USE_RD_RAND 0\n#endif\n\n#ifndef VSMC_USE_RD_SEED\n#define VSMC_USE_RD_SEED 0\n#endif\n\n#ifndef VSMC_USE_CXX11LIB_FUTURE\n#define VSMC_USE_CXX11LIB_FUTURE VSMC_HAS_CXX11LIB_FUTURE\n#endif\n\n#ifndef VSMC_USE_MPI\n#define VSMC_USE_MPI 0\n#endif\n\n#ifndef VSMC_USE_OPENCL\n#define VSMC_USE_OPENCL 0\n#endif\n\n#ifndef VSMC_USE_MKL\n#define VSMC_USE_MKL 0\n#endif\n\n#ifndef VSMC_USE_MKL_CBLAS\n#define VSMC_USE_MKL_CBLAS VSMC_USE_MKL\n#endif\n\n#ifndef VSMC_USE_MKL_VML\n#define VSMC_USE_MKL_VML VSMC_USE_MKL\n#endif\n\n#ifndef VSMC_USE_MKL_VSL\n#define VSMC_USE_MKL_VSL VSMC_USE_MKL\n#endif\n\n#ifndef VSMC_USE_VECLIB\n#if VSMC_MAC_VERSION_MIN_REQUIRED(VSMC_MAC_10_4)\n#define VSMC_USE_VECLIB 1\n#else\n#define VSMC_USE_VECLIB 0\n#endif\n#endif\n\n#ifndef VSMC_USE_VECLIB_CBLAS\n#define VSMC_USE_VECLIB_CBLAS VSMC_USE_VECLIB\n#endif\n\n#ifndef VSMC_USE_VECLIB_VFORCE\n#define VSMC_USE_VECLIB_VFORCE VSMC_USE_VECLIB\n#endif\n\n#ifndef VSMC_USE_CILK\n#if defined(__INTEL_COMPILER) && __INTEL_COMPILER >= 1210\n#define VSMC_USE_CILK 1\n#else\n#define VSMC_USE_CILK 0\n#endif\n#endif\n\n#ifndef VSMC_USE_GCD\n#if VSMC_MAC_VERSION_MIN_REQUIRED(VSMC_MAC_10_6)\n#define VSMC_USE_GCD 1\n#else\n#define VSMC_USE_GCD 0\n#endif\n#endif\n\n#ifndef VSMC_USE_GCD_LION\n#if VSMC_MAC_VERSION_MIN_REQUIRED(VSMC_MAC_10_7)\n#define VSMC_USE_GCD_LION 1\n#else\n#define VSMC_USE_GCD_LION 0\n#endif\n#endif\n\n#ifndef VSMC_USE_OMP\n#ifdef _OPENMP\n#define VSMC_USE_OMP 1\n#else\n#define VSMC_USE_OMP 0\n#endif\n#endif\n\n#ifndef VSMC_USE_PPL\n#if defined(_MSC_VER) && _MSC_VER >= 1600\n#define VSMC_USE_PPL 1\n#else\n#define VSMC_USE_PPL 0\n#endif\n#endif\n\n#ifndef VSMC_USE_TBB\n#define VSMC_USE_TBB 0\n#endif\n\n#ifndef VSMC_USE_HDF5\n#define VSMC_USE_HDF5 0\n#endif\n\n#endif \/\/ VSMC_INTERNAL_CONFIG_HPP\n<|endoftext|>"} {"text":"<commit_before>#include <set>\n#include <map>\n#include <queue>\n#include <fstream>\n#include <exception>\n#include <stdexcept>\n#include <sstream>\n\n#ifdef DEBUG\n#include <iostream>\n#define DEBUG_PRINT(...) std::cout << __VA_ARGS__ << std::endl\n#else\n#define DEBUG_PRINT(...)\n#endif\n\n\/\/ Maximum config file line length\n#define LINE_LENGTH 1024\n\n\/\/ forward declaring the classes\nclass Conf;\nclass CommQueue;\nclass Throttle;\n\n\/\/---------------------------------------------\n\/\/ Class for reading in the configuration file\n\/\/---------------------------------------------\nclass Conf {\npublic:\n\tConf(const char *config_fn);\n\ttemplate<typename T>\n\t\tvoid GetAttr(const std::string &name, T *output) const;\n\nprivate:\n\ttemplate<typename T> static void parse(const std::string &str, T *ret);\n\ttemplate<typename T> static void parse(const std::string &str, std::set<T> *ret);\n\n\t\/\/ attributes\n\tstd::map<std::string, std::string> attributes;\n};\n\n\/\/ IMPLEMENTATION OF THE TEMPLATES\ntemplate<typename T> void Conf::GetAttr(const std::string &name, T* output) const\n{\n\tauto attr = attributes.find(name);\n\tif (attr != attributes.end())\n\t\tparse(attr->second, output);\n\telse\n\t\tthrow std::runtime_error(\"No such attribute: \" + name);\n}\n\n\/\/ Well, let's try something general first\ntemplate<typename T> void Conf::parse(const std::string &str, T *ret)\n{\n\tstd::istringstream stream(str);\n\tstream >> *ret;\n}\n\n\/\/ ... but we might want to specialize\ntemplate<> inline void Conf::parse<std::string>(const std::string &str, std::string *ret)\n{\n\t*ret = str;\n}\n\n\/\/ For sets we do something completely different\ntemplate<typename T> void Conf::parse(const std::string &str, std::set<T> *ret)\n{\n\tstd::istringstream stream(str);\n\tT cur;\n\n\twhile (stream >> cur)\n\t\tret->insert(cur);\n}\n\n\/\/----------------------------------\n\/\/ Class handling the command queue\n\/\/----------------------------------\nclass CommQueue {\npublic:\n\tCommQueue(Throttle *parent, const char *pipe_fn);\n\t~CommQueue();\n\tvoid update();\n\nprivate:\n\t\/\/ where we write to\n\tThrottle *Throt;\n\n\t\/\/ look for input and process\n\tvoid processCommand(const std::string &comm);\n\n\t\/\/ command pipe file descriptor\n\tint comm_file;\n\n\t\/\/ commands\n\tenum Command {\n\t\tDEFAULT = 0,\n\t\tSET_MAX,\n\t\tSET_MIN,\n\t\tSET_FREQ,\n\t\tRESET\n\t};\n\n\tstatic const std::map<std::string, Command> translate;\n};\n\n\/\/---------------------------------------\n\/\/ Main class controlling the throttling\n\/\/---------------------------------------\nclass Throttle {\npublic:\n\tThrottle(const char *config_fn, const char* pipe_fn);\n\tvoid operator()();\n\n\t\/**\n\t * Set new override frequency in MHz or reset (with freq=0).\n\t *\/\n\tvoid setOverrideFreq(int freq)\n\t{\n\t\toverride_freq = freq*1000;\n\t\tstabilize = 0;\n\t}\n\n\t\/**\n\t * Set minimum temperature in degrees Celsius.\n\t *\/\n\tvoid setMinTemp(int temp) { temp_min = temp*1000; }\n\n\t\/**\n\t * Set maximum temperature in degrees Celsius.\n\t *\/\n\tvoid setMaxTemp(int temp) { temp_max = temp*1000; }\n\nprivate:\n\tvoid adjust();\n\tint readTemp() const;\n\tvoid writeFreq() const;\n\n\t\/\/ SETTINGS\n\t\/\/ number of cores\n\tint cores;\n\n\t\/\/ files\n\tstd::string temp_fn;\n\tstd::string freq_fn_prefix, freq_fn_suffix;\n\n\t\/\/ temperature thresholds\n\tint temp_max, temp_min;\n\n\t\/\/ frequencies\n\tstd::set<int> freqs;\n\tint freq;\n\n\t\/\/ dynamics\n\tint wait_after_adjust;\n\n\t\/\/ Set to +wait_after_adjust after increasing frequency, to -wait_after_adjust after decreasing it.\n\t\/\/ Then it is diminished in absolute value after each step of adjusting.\n\tint stabilize;\n\n\t\/\/ STATUS & Override mechanics\n\tCommQueue queue;\n\tint override_freq;\t\/\/ 0 = no override\n};\n<commit_msg>Add header guards for throttle.hpp<commit_after>#ifndef THROTTLE_HPP\n#define THROTTLE_HPP\n\n#include <set>\n#include <map>\n#include <queue>\n#include <fstream>\n#include <exception>\n#include <stdexcept>\n#include <sstream>\n\n#ifdef DEBUG\n#include <iostream>\n#define DEBUG_PRINT(...) std::cout << __VA_ARGS__ << std::endl\n#else\n#define DEBUG_PRINT(...)\n#endif\n\n\/\/ Maximum config file line length\n#define LINE_LENGTH 1024\n\n\/\/ forward declaring the classes\nclass Conf;\nclass CommQueue;\nclass Throttle;\n\n\/\/---------------------------------------------\n\/\/ Class for reading in the configuration file\n\/\/---------------------------------------------\nclass Conf {\npublic:\n\tConf(const char *config_fn);\n\ttemplate<typename T>\n\t\tvoid GetAttr(const std::string &name, T *output) const;\n\nprivate:\n\ttemplate<typename T> static void parse(const std::string &str, T *ret);\n\ttemplate<typename T> static void parse(const std::string &str, std::set<T> *ret);\n\n\t\/\/ attributes\n\tstd::map<std::string, std::string> attributes;\n};\n\n\/\/ IMPLEMENTATION OF THE TEMPLATES\ntemplate<typename T> void Conf::GetAttr(const std::string &name, T* output) const\n{\n\tauto attr = attributes.find(name);\n\tif (attr != attributes.end())\n\t\tparse(attr->second, output);\n\telse\n\t\tthrow std::runtime_error(\"No such attribute: \" + name);\n}\n\n\/\/ Well, let's try something general first\ntemplate<typename T> void Conf::parse(const std::string &str, T *ret)\n{\n\tstd::istringstream stream(str);\n\tstream >> *ret;\n}\n\n\/\/ ... but we might want to specialize\ntemplate<> inline void Conf::parse<std::string>(const std::string &str, std::string *ret)\n{\n\t*ret = str;\n}\n\n\/\/ For sets we do something completely different\ntemplate<typename T> void Conf::parse(const std::string &str, std::set<T> *ret)\n{\n\tstd::istringstream stream(str);\n\tT cur;\n\n\twhile (stream >> cur)\n\t\tret->insert(cur);\n}\n\n\/\/----------------------------------\n\/\/ Class handling the command queue\n\/\/----------------------------------\nclass CommQueue {\npublic:\n\tCommQueue(Throttle *parent, const char *pipe_fn);\n\t~CommQueue();\n\tvoid update();\n\nprivate:\n\t\/\/ where we write to\n\tThrottle *Throt;\n\n\t\/\/ look for input and process\n\tvoid processCommand(const std::string &comm);\n\n\t\/\/ command pipe file descriptor\n\tint comm_file;\n\n\t\/\/ commands\n\tenum Command {\n\t\tDEFAULT = 0,\n\t\tSET_MAX,\n\t\tSET_MIN,\n\t\tSET_FREQ,\n\t\tRESET\n\t};\n\n\tstatic const std::map<std::string, Command> translate;\n};\n\n\/\/---------------------------------------\n\/\/ Main class controlling the throttling\n\/\/---------------------------------------\nclass Throttle {\npublic:\n\tThrottle(const char *config_fn, const char* pipe_fn);\n\tvoid operator()();\n\n\t\/**\n\t * Set new override frequency in MHz or reset (with freq=0).\n\t *\/\n\tvoid setOverrideFreq(int freq)\n\t{\n\t\toverride_freq = freq*1000;\n\t\tstabilize = 0;\n\t}\n\n\t\/**\n\t * Set minimum temperature in degrees Celsius.\n\t *\/\n\tvoid setMinTemp(int temp) { temp_min = temp*1000; }\n\n\t\/**\n\t * Set maximum temperature in degrees Celsius.\n\t *\/\n\tvoid setMaxTemp(int temp) { temp_max = temp*1000; }\n\nprivate:\n\tvoid adjust();\n\tint readTemp() const;\n\tvoid writeFreq() const;\n\n\t\/\/ SETTINGS\n\t\/\/ number of cores\n\tint cores;\n\n\t\/\/ files\n\tstd::string temp_fn;\n\tstd::string freq_fn_prefix, freq_fn_suffix;\n\n\t\/\/ temperature thresholds\n\tint temp_max, temp_min;\n\n\t\/\/ frequencies\n\tstd::set<int> freqs;\n\tint freq;\n\n\t\/\/ dynamics\n\tint wait_after_adjust;\n\n\t\/\/ Set to +wait_after_adjust after increasing frequency, to -wait_after_adjust after decreasing it.\n\t\/\/ Then it is diminished in absolute value after each step of adjusting.\n\tint stabilize;\n\n\t\/\/ STATUS & Override mechanics\n\tCommQueue queue;\n\tint override_freq;\t\/\/ 0 = no override\n};\n\n#endif\n<|endoftext|>"} {"text":"<commit_before>\/\/ Copyright (c) 2014-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#if defined(HAVE_CONFIG_H)\n#include <config\/syscoin-config.h>\n#endif\n\n#include <timedata.h>\n\n#include <netaddress.h>\n#include <sync.h>\n#include <ui_interface.h>\n#include <util\/system.h>\n#include <util\/translation.h>\n#include <warnings.h>\n\n\nstatic Mutex g_timeoffset_mutex;\nstatic int64_t nTimeOffset GUARDED_BY(g_timeoffset_mutex) = 0;\n\n\/**\n * \"Never go to sea with two chronometers; take one or three.\"\n * Our three time sources are:\n * - System clock\n * - Median of other nodes clocks\n * - The user (asking the user to fix the system clock if the first two disagree)\n *\/\nint64_t GetTimeOffset()\n{\n LOCK(g_timeoffset_mutex);\n return nTimeOffset;\n}\n\nint64_t GetAdjustedTime()\n{\n return GetTime() + GetTimeOffset();\n}\n\nstatic int64_t abs64(int64_t n)\n{\n return (n >= 0 ? n : -n);\n}\n\n#define SYSCOIN_TIMEDATA_MAX_SAMPLES 200\n\nvoid AddTimeData(const CNetAddr& ip, int64_t nOffsetSample)\n{\n LOCK(g_timeoffset_mutex);\n \/\/ Ignore duplicates\n static std::set<CNetAddr> setKnown;\n if (setKnown.size() == SYSCOIN_TIMEDATA_MAX_SAMPLES)\n return;\n if (!setKnown.insert(ip).second)\n return;\n\n \/\/ Add data\n static CMedianFilter<int64_t> vTimeOffsets(SYSCOIN_TIMEDATA_MAX_SAMPLES, 0);\n vTimeOffsets.input(nOffsetSample);\n LogPrint(BCLog::NET,\"added time data, samples %d, offset %+d (%+d minutes)\\n\", vTimeOffsets.size(), nOffsetSample, nOffsetSample\/60);\n\n \/\/ There is a known issue here (see issue #4521):\n \/\/\n \/\/ - The structure vTimeOffsets contains up to 200 elements, after which\n \/\/ any new element added to it will not increase its size, replacing the\n \/\/ oldest element.\n \/\/\n \/\/ - The condition to update nTimeOffset includes checking whether the\n \/\/ number of elements in vTimeOffsets is odd, which will never happen after\n \/\/ there are 200 elements.\n \/\/\n \/\/ But in this case the 'bug' is protective against some attacks, and may\n \/\/ actually explain why we've never seen attacks which manipulate the\n \/\/ clock offset.\n \/\/\n \/\/ So we should hold off on fixing this and clean it up as part of\n \/\/ a timing cleanup that strengthens it in a number of other ways.\n \/\/\n if (vTimeOffsets.size() >= 5 && vTimeOffsets.size() % 2 == 1)\n {\n int64_t nMedian = vTimeOffsets.median();\n std::vector<int64_t> vSorted = vTimeOffsets.sorted();\n \/\/ Only let other nodes change our time by so much\n if (abs64(nMedian) <= std::max<int64_t>(0, gArgs.GetArg(\"-maxtimeadjustment\", DEFAULT_MAX_TIME_ADJUSTMENT)))\n {\n nTimeOffset = nMedian;\n }\n else\n {\n nTimeOffset = 0;\n\n static bool fDone;\n if (!fDone)\n {\n \/\/ If nobody has a time different than ours but within 5 minutes of ours, give a warning\n bool fMatch = false;\n for (const int64_t nOffset : vSorted)\n if (nOffset != 0 && abs64(nOffset) < 5 * 60)\n fMatch = true;\n\n if (!fMatch)\n {\n fDone = true;\n bilingual_str strMessage = strprintf(_(\"Please check that your computer's date and time are correct! If your clock is wrong, %s will not work properly.\"), PACKAGE_NAME);\n SetMiscWarning(strMessage.translated);\n uiInterface.ThreadSafeMessageBox(strMessage, \"\", CClientUIInterface::MSG_WARNING);\n }\n }\n }\n\n if (LogAcceptCategory(BCLog::NET)) {\n for (const int64_t n : vSorted) {\n LogPrint(BCLog::NET, \"%+d \", n); \/* Continued *\/\n }\n LogPrint(BCLog::NET, \"| \"); \/* Continued *\/\n\n LogPrint(BCLog::NET, \"nTimeOffset = %+d (%+d minutes)\\n\", nTimeOffset, nTimeOffset\/60);\n }\n }\n}\n<commit_msg>refactor: Fix formatting of timedata.cpp<commit_after>\/\/ Copyright (c) 2014-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#if defined(HAVE_CONFIG_H)\n#include <config\/syscoin-config.h>\n#endif\n\n#include <timedata.h>\n\n#include <netaddress.h>\n#include <sync.h>\n#include <ui_interface.h>\n#include <util\/system.h>\n#include <util\/translation.h>\n#include <warnings.h>\n\nstatic Mutex g_timeoffset_mutex;\nstatic int64_t nTimeOffset GUARDED_BY(g_timeoffset_mutex) = 0;\n\n\/**\n * \"Never go to sea with two chronometers; take one or three.\"\n * Our three time sources are:\n * - System clock\n * - Median of other nodes clocks\n * - The user (asking the user to fix the system clock if the first two disagree)\n *\/\nint64_t GetTimeOffset()\n{\n LOCK(g_timeoffset_mutex);\n return nTimeOffset;\n}\n\nint64_t GetAdjustedTime()\n{\n return GetTime() + GetTimeOffset();\n}\n\nstatic int64_t abs64(int64_t n)\n{\n return (n >= 0 ? n : -n);\n}\n\n#define SYSCOIN_TIMEDATA_MAX_SAMPLES 200\n\nvoid AddTimeData(const CNetAddr& ip, int64_t nOffsetSample)\n{\n LOCK(g_timeoffset_mutex);\n \/\/ Ignore duplicates\n static std::set<CNetAddr> setKnown;\n if (setKnown.size() == SYSCOIN_TIMEDATA_MAX_SAMPLES)\n return;\n if (!setKnown.insert(ip).second)\n return;\n\n \/\/ Add data\n static CMedianFilter<int64_t> vTimeOffsets(SYSCOIN_TIMEDATA_MAX_SAMPLES, 0);\n vTimeOffsets.input(nOffsetSample);\n LogPrint(BCLog::NET, \"added time data, samples %d, offset %+d (%+d minutes)\\n\", vTimeOffsets.size(), nOffsetSample, nOffsetSample \/ 60);\n\n \/\/ There is a known issue here (see issue #4521):\n \/\/\n \/\/ - The structure vTimeOffsets contains up to 200 elements, after which\n \/\/ any new element added to it will not increase its size, replacing the\n \/\/ oldest element.\n \/\/\n \/\/ - The condition to update nTimeOffset includes checking whether the\n \/\/ number of elements in vTimeOffsets is odd, which will never happen after\n \/\/ there are 200 elements.\n \/\/\n \/\/ But in this case the 'bug' is protective against some attacks, and may\n \/\/ actually explain why we've never seen attacks which manipulate the\n \/\/ clock offset.\n \/\/\n \/\/ So we should hold off on fixing this and clean it up as part of\n \/\/ a timing cleanup that strengthens it in a number of other ways.\n \/\/\n if (vTimeOffsets.size() >= 5 && vTimeOffsets.size() % 2 == 1) {\n int64_t nMedian = vTimeOffsets.median();\n std::vector<int64_t> vSorted = vTimeOffsets.sorted();\n \/\/ Only let other nodes change our time by so much\n if (abs64(nMedian) <= std::max<int64_t>(0, gArgs.GetArg(\"-maxtimeadjustment\", DEFAULT_MAX_TIME_ADJUSTMENT))) {\n nTimeOffset = nMedian;\n } else {\n nTimeOffset = 0;\n\n static bool fDone;\n if (!fDone) {\n \/\/ If nobody has a time different than ours but within 5 minutes of ours, give a warning\n bool fMatch = false;\n for (const int64_t nOffset : vSorted) {\n if (nOffset != 0 && abs64(nOffset) < 5 * 60) fMatch = true;\n }\n\n if (!fMatch) {\n fDone = true;\n bilingual_str strMessage = strprintf(_(\"Please check that your computer's date and time are correct! If your clock is wrong, %s will not work properly.\"), PACKAGE_NAME);\n SetMiscWarning(strMessage.translated);\n uiInterface.ThreadSafeMessageBox(strMessage, \"\", CClientUIInterface::MSG_WARNING);\n }\n }\n }\n\n if (LogAcceptCategory(BCLog::NET)) {\n for (const int64_t n : vSorted) {\n LogPrint(BCLog::NET, \"%+d \", n); \/* Continued *\/\n }\n LogPrint(BCLog::NET, \"| \"); \/* Continued *\/\n LogPrint(BCLog::NET, \"nTimeOffset = %+d (%+d minutes)\\n\", nTimeOffset, nTimeOffset \/ 60);\n }\n }\n}\n<|endoftext|>"} {"text":"<commit_before>\/*\n * Copyright (c) 2015-2018 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 \"traceback.h\"\n\n#include \"config.h\" \/\/ for XAPIAND_TRACEBACKS\n\n#include <mutex> \/\/ for std::mutex, std::lock_guard\n#include <cstdlib> \/\/ for free\n#include <cxxabi.h> \/\/ for abi::__cxa_demangle\n#include <dlfcn.h> \/\/ for dladdr\n\n#include \"likely.h\"\n\n#ifndef NDEBUG\n#ifndef XAPIAND_TRACEBACKS\n#define XAPIAND_TRACEBACKS 1\n#endif\n#endif\n\n#define BUFFER_SIZE 1024\n\n#ifdef __APPLE__\n#include <util.h> \/\/ for forkpty\n#include <unistd.h> \/\/ for execlp\n#include <termios.h> \/\/ for termios, cfmakeraw\n#ifdef HAVE_POLL\n#include <poll.h> \/\/ for poll\n#else\n#include <sys\/select.h> \/\/ for select\n#endif\n\/* Use `atos` to do symbol lookup, can lookup non-dynamic symbols and also line\n * numbers. This function is more complicated than you'd expect because `atos`\n * doesn't flush after each line, so plain pipe() or socketpair() won't work\n * until we close the write side. But the whole point is we want to keep `atos`\n * around so we don't have to reprocess the symbol table over and over. What we\n * wind up doing is using `forkpty()` to make a new pseudoterminal for atos to\n * run in, and thus will use line-buffering for stdout, and then we can get\n * each line.\n *\/\nstatic std::string\natos(const void* address)\n{\n\tstatic std::mutex mtx;\n\tstd::lock_guard lk(mtx);\n\n\tchar tmp[20];\n\tstatic int fd = -1;\n\tif (fd == -1) {\n\t\tDl_info info;\n\t\tmemset(&info, 0, sizeof(Dl_info));\n\t\tif (dladdr(reinterpret_cast<const void*>(&atos), &info) == 0) {\n\t\t\tperror(\"Could not get base address for `atos`.\");\n\t\t\treturn \"\";\n\t\t}\n\n\t\tstruct termios term_opts;\n\t\tcfmakeraw(&term_opts); \/\/ have to set this first, otherwise queries echo until child kicks in\n\t\tpid_t childpid;\n\t\tif unlikely((childpid = forkpty(&fd, nullptr, &term_opts, nullptr)) < 0) {\n\t\t\tperror(\"Could not forkpty for `atos` call.\");\n\t\t\treturn \"\";\n\t\t}\n\n\t\tif (childpid == 0) {\n\t\t\tsnprintf(tmp, sizeof(tmp), \"%p\", static_cast<const void *>(info.dli_fbase));\n\t\t\texeclp(\"\/usr\/bin\/atos\", \"atos\", \"-o\", info.dli_fname, \"-l\", tmp, nullptr);\n\t\t\tfprintf(stderr,\"Could not exec `atos` for stack trace!\\n\");\n\t\t\texit(1);\n\t\t}\n\n\t\tint size = snprintf(tmp, sizeof(tmp), \"%p\\n\", address);\n\t\twrite(fd, tmp, size);\n\n\t\t\/\/ atos can take a while to parse symbol table on first request, which\n\t\t\/\/ is why we leave it running if we see a delay, explain what's going on...\n\t\tint err = 0;\n\n#ifdef HAVE_POLL\n\t\tstruct pollfd fds;\n\t\tfds.fd = fd;\n\t\tfds.events = POLLIN;\n\t\terr = poll(&fds, 1, 3000);\n#else\n\t\tif (fdin < FD_SETSIZE) {\n\t\t\tfd_set fds;\n\t\t\tFD_ZERO(&fds);\n\t\t\tFD_SET(fd, &fds);\n\t\t\tstruct timeval tv = {3, 0};\n\t\t\terr = select(fd + 1, &fds, nullptr, nullptr, &tv);\n\t\t}\n#endif\n\t\tif unlikely(err < 0) {\n\t\t\tperror(\"Generating... first call takes some time for `atos` to cache the symbol table.\");\n\t\t} else if (err == 0) { \/\/ timeout\n\t\t\tfprintf(stderr, \"Generating... first call takes some time for `atos` to cache the symbol table.\\n\");\n\t\t}\n\t} else {\n\t\tint size = snprintf(tmp, sizeof(tmp), \"%p\\n\", address);\n\t\twrite(fd, tmp, size);\n\t}\n\n\tconst unsigned int MAXLINE = 1024;\n\tchar line[MAXLINE];\n\tchar c = '\\0';\n\tsize_t nread = 0;\n\twhile (c != '\\n' && nread < MAXLINE) {\n\t\tif unlikely(read(fd, &c, 1) <= 0) {\n\t\t\tperror(\"Lost `atos` connection.\");\n\t\t\tclose(fd);\n\t\t\tfd = -1;\n\t\t\treturn \"\";\n\t\t}\n\t\tif (c != '\\n') {\n\t\t\tline[nread++] = c;\n\t\t}\n\t}\n\tif (nread < MAXLINE) {\n\t\treturn std::string(line, nread);\n\t}\n\tfprintf(stderr, \"Line read from `atos` was too long.\\n\");\n\treturn \"\";\n}\n#else\nstatic inline std::string\natos(const void*)\n{\n\treturn \"\";\n}\n#endif\n\n\nstd::string\ntraceback(const char* function, const char* filename, int line, const std::vector<void*>& callstack, int skip)\n{\n\tchar tmp[20];\n\n\tstd::string tb = \"\\n== Traceback (most recent call first): \";\n\ttb.append(filename);\n\ttb.push_back(':');\n\ttb.append(std::to_string(line));\n\ttb.append(\" at \");\n\ttb.append(function);\n\n\tint frames = callstack.size();\n\n\tif (frames == 0) {\n\t\ttb.append(\":\\n <empty traceback>\");\n\t\treturn tb;\n\t}\n\n\tif (frames < 2) {\n\t\ttb.append(\":\\n <no traceback>\");\n\t\treturn tb;\n\t}\n\n\ttb.push_back(':');\n\n\t\/\/ Iterate over the callstack. Skip the first, it is the address of this function.\n\tstd::string result;\n\tfor (int i = skip; i < frames; ++i) {\n\t\tauto address = callstack[i];\n\n\t\tresult.assign(std::to_string(frames - i - 1));\n\t\tresult.push_back(' ');\n\n\t\tauto address_string = atos(address);\n\t\tif (address_string.size() > 2 && address_string.compare(0, 2, \"0x\") != 0) {\n\t\t\tresult.append(address_string);\n\t\t} else {\n\t\t\tDl_info info;\n\t\t\tmemset(&info, 0, sizeof(Dl_info));\n\t\t\tif (dladdr(address, &info) != 0) {\n\t\t\t\t\/\/ Address:\n\t\t\t\tsnprintf(tmp, sizeof(tmp), \"%p \", address);\n\t\t\t\tresult.append(tmp);\n\t\t\t\t\/\/ Symbol name:\n\t\t\t\tif (info.dli_sname != nullptr) {\n\t\t\t\t\tint status = 0;\n\t\t\t\t\tchar* unmangled = abi::__cxa_demangle(info.dli_sname, nullptr, nullptr, &status);\n\t\t\t\t\tif (status != 0) {\n\t\t\t\t\t\tresult.append(info.dli_sname);\n\t\t\t\t\t} else {\n\t\t\t\t\t\ttry {\n\t\t\t\t\t\t\tresult.append(unmangled);\n\t\t\t\t\t\t\tfree(unmangled);\n\t\t\t\t\t\t} catch(...) {\n\t\t\t\t\t\t\tfree(unmangled);\n\t\t\t\t\t\t\tthrow;\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t} else {\n\t\t\t\t\tresult.append(\"[unknown symbol]\");\n\t\t\t\t}\n\t\t\t\t\/\/ Offset:\n\t\t\t\tsnprintf(tmp, sizeof(tmp), \" + %zu\", static_cast<const char*>(address) - static_cast<const char*>(info.dli_saddr));\n\t\t\t\tresult.append(tmp);\n\t\t\t} else {\n\t\t\t\tsnprintf(tmp, sizeof(tmp), \"%p [unknown symbol]\", address);\n\t\t\t\tresult.append(tmp);\n\t\t\t}\n\t\t}\n\t\ttb.append(\"\\n \");\n\t\ttb.append(result);\n\t}\n\n\treturn tb;\n}\n\n\nstd::string\ntraceback(const char* function, const char* filename, int line, int skip)\n{\n\tstd::vector<void*> callstack;\n\n\t\/\/ retrieve current stack addresses\n\tcallstack.resize(128);\n\tcallstack.resize(backtrace(callstack.data(), callstack.size()));\n\tcallstack.shrink_to_fit();\n\n\tauto tb = traceback(function, filename, line, callstack, skip);\n\n\treturn tb;\n}\n\n\nextern \"C\" void\n__assert_tb(const char* function, const char* filename, unsigned int line, const char* expression)\n{\n#ifdef XAPIAND_TRACEBACKS\n\t(void)fprintf(stderr, \"Assertion failed: %s in %s %s:%u%s\\n\",\n\t\texpression, function, filename, line, traceback(function, filename, line, 2).c_str());\n#else\n\t(void)fprintf(stderr, \"Assertion failed: %s in %s %s:%u\\n\",\n\t\texpression, function, filename, line);\n#endif\n\tabort();\n}\n<commit_msg>Added missing include for memset<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 \"traceback.h\"\n\n#include \"config.h\" \/\/ for XAPIAND_TRACEBACKS\n\n#include <cstdlib> \/\/ for std::free, std::exit\n#include <cstdio> \/\/ for std::perror, std::snprintf, std::fprintf\n#include <cstring> \/\/ for std::memset\n#include <cxxabi.h> \/\/ for abi::__cxa_demangle\n#include <dlfcn.h> \/\/ for dladdr\n#include <mutex> \/\/ for std::mutex, std::lock_guard\n\n#include \"likely.h\"\n\n#ifndef NDEBUG\n#ifndef XAPIAND_TRACEBACKS\n#define XAPIAND_TRACEBACKS 1\n#endif\n#endif\n\n#define BUFFER_SIZE 1024\n\n#ifdef __APPLE__\n#include <util.h> \/\/ for forkpty\n#include <unistd.h> \/\/ for execlp\n#include <termios.h> \/\/ for termios, cfmakeraw\n#ifdef HAVE_POLL\n#include <poll.h> \/\/ for poll\n#else\n#include <sys\/select.h> \/\/ for select\n#endif\n\/* Use `atos` to do symbol lookup, can lookup non-dynamic symbols and also line\n * numbers. This function is more complicated than you'd expect because `atos`\n * doesn't flush after each line, so plain pipe() or socketpair() won't work\n * until we close the write side. But the whole point is we want to keep `atos`\n * around so we don't have to reprocess the symbol table over and over. What we\n * wind up doing is using `forkpty()` to make a new pseudoterminal for atos to\n * run in, and thus will use line-buffering for stdout, and then we can get\n * each line.\n *\/\nstatic std::string\natos(const void* address)\n{\n\tstatic std::mutex mtx;\n\tstd::lock_guard lk(mtx);\n\n\tchar tmp[20];\n\tstatic int fd = -1;\n\tif (fd == -1) {\n\t\tDl_info info;\n\t\tstd::memset(&info, 0, sizeof(Dl_info));\n\t\tif (dladdr(reinterpret_cast<const void*>(&atos), &info) == 0) {\n\t\t\tstd::perror(\"Could not get base address for `atos`.\");\n\t\t\treturn \"\";\n\t\t}\n\n\t\tstruct termios term_opts;\n\t\tcfmakeraw(&term_opts); \/\/ have to set this first, otherwise queries echo until child kicks in\n\t\tpid_t childpid;\n\t\tif unlikely((childpid = forkpty(&fd, nullptr, &term_opts, nullptr)) < 0) {\n\t\t\tstd::perror(\"Could not forkpty for `atos` call.\");\n\t\t\treturn \"\";\n\t\t}\n\n\t\tif (childpid == 0) {\n\t\t\tstd::snprintf(tmp, sizeof(tmp), \"%p\", static_cast<const void *>(info.dli_fbase));\n\t\t\texeclp(\"\/usr\/bin\/atos\", \"atos\", \"-o\", info.dli_fname, \"-l\", tmp, nullptr);\n\t\t\tstd::fprintf(stderr,\"Could not exec `atos` for stack trace!\\n\");\n\t\t\tstd::exit(1);\n\t\t}\n\n\t\tint size = std::snprintf(tmp, sizeof(tmp), \"%p\\n\", address);\n\t\twrite(fd, tmp, size);\n\n\t\t\/\/ atos can take a while to parse symbol table on first request, which\n\t\t\/\/ is why we leave it running if we see a delay, explain what's going on...\n\t\tint err = 0;\n\n#ifdef HAVE_POLL\n\t\tstruct pollfd fds;\n\t\tfds.fd = fd;\n\t\tfds.events = POLLIN;\n\t\terr = poll(&fds, 1, 3000);\n#else\n\t\tif (fdin < FD_SETSIZE) {\n\t\t\tfd_set fds;\n\t\t\tFD_ZERO(&fds);\n\t\t\tFD_SET(fd, &fds);\n\t\t\tstruct timeval tv = {3, 0};\n\t\t\terr = select(fd + 1, &fds, nullptr, nullptr, &tv);\n\t\t}\n#endif\n\t\tif unlikely(err < 0) {\n\t\t\tstd::perror(\"Generating... first call takes some time for `atos` to cache the symbol table.\");\n\t\t} else if (err == 0) { \/\/ timeout\n\t\t\tstd::fprintf(stderr, \"Generating... first call takes some time for `atos` to cache the symbol table.\\n\");\n\t\t}\n\t} else {\n\t\tint size = std::snprintf(tmp, sizeof(tmp), \"%p\\n\", address);\n\t\twrite(fd, tmp, size);\n\t}\n\n\tconst unsigned int MAXLINE = 1024;\n\tchar line[MAXLINE];\n\tchar c = '\\0';\n\tsize_t nread = 0;\n\twhile (c != '\\n' && nread < MAXLINE) {\n\t\tif unlikely(read(fd, &c, 1) <= 0) {\n\t\t\tstd::perror(\"Lost `atos` connection.\");\n\t\t\tclose(fd);\n\t\t\tfd = -1;\n\t\t\treturn \"\";\n\t\t}\n\t\tif (c != '\\n') {\n\t\t\tline[nread++] = c;\n\t\t}\n\t}\n\tif (nread < MAXLINE) {\n\t\treturn std::string(line, nread);\n\t}\n\tstd::fprintf(stderr, \"Line read from `atos` was too long.\\n\");\n\treturn \"\";\n}\n#else\nstatic inline std::string\natos(const void*)\n{\n\treturn \"\";\n}\n#endif\n\n\nstd::string\ntraceback(const char* function, const char* filename, int line, const std::vector<void*>& callstack, int skip)\n{\n\tchar tmp[20];\n\n\tstd::string tb = \"\\n== Traceback (most recent call first): \";\n\ttb.append(filename);\n\ttb.push_back(':');\n\ttb.append(std::to_string(line));\n\ttb.append(\" at \");\n\ttb.append(function);\n\n\tint frames = callstack.size();\n\n\tif (frames == 0) {\n\t\ttb.append(\":\\n <empty traceback>\");\n\t\treturn tb;\n\t}\n\n\tif (frames < 2) {\n\t\ttb.append(\":\\n <no traceback>\");\n\t\treturn tb;\n\t}\n\n\ttb.push_back(':');\n\n\t\/\/ Iterate over the callstack. Skip the first, it is the address of this function.\n\tstd::string result;\n\tfor (int i = skip; i < frames; ++i) {\n\t\tauto address = callstack[i];\n\n\t\tresult.assign(std::to_string(frames - i - 1));\n\t\tresult.push_back(' ');\n\n\t\tauto address_string = atos(address);\n\t\tif (address_string.size() > 2 && address_string.compare(0, 2, \"0x\") != 0) {\n\t\t\tresult.append(address_string);\n\t\t} else {\n\t\t\tDl_info info;\n\t\t\tstd::memset(&info, 0, sizeof(Dl_info));\n\t\t\tif (dladdr(address, &info) != 0) {\n\t\t\t\t\/\/ Address:\n\t\t\t\tstd::snprintf(tmp, sizeof(tmp), \"%p \", address);\n\t\t\t\tresult.append(tmp);\n\t\t\t\t\/\/ Symbol name:\n\t\t\t\tif (info.dli_sname != nullptr) {\n\t\t\t\t\tint status = 0;\n\t\t\t\t\tchar* unmangled = abi::__cxa_demangle(info.dli_sname, nullptr, nullptr, &status);\n\t\t\t\t\tif (status != 0) {\n\t\t\t\t\t\tresult.append(info.dli_sname);\n\t\t\t\t\t} else {\n\t\t\t\t\t\ttry {\n\t\t\t\t\t\t\tresult.append(unmangled);\n\t\t\t\t\t\t\tstd::free(unmangled);\n\t\t\t\t\t\t} catch(...) {\n\t\t\t\t\t\t\tstd::free(unmangled);\n\t\t\t\t\t\t\tthrow;\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t} else {\n\t\t\t\t\tresult.append(\"[unknown symbol]\");\n\t\t\t\t}\n\t\t\t\t\/\/ Offset:\n\t\t\t\tstd::snprintf(tmp, sizeof(tmp), \" + %zu\", static_cast<const char*>(address) - static_cast<const char*>(info.dli_saddr));\n\t\t\t\tresult.append(tmp);\n\t\t\t} else {\n\t\t\t\tstd::snprintf(tmp, sizeof(tmp), \"%p [unknown symbol]\", address);\n\t\t\t\tresult.append(tmp);\n\t\t\t}\n\t\t}\n\t\ttb.append(\"\\n \");\n\t\ttb.append(result);\n\t}\n\n\treturn tb;\n}\n\n\nstd::string\ntraceback(const char* function, const char* filename, int line, int skip)\n{\n\tstd::vector<void*> callstack;\n\n\t\/\/ retrieve current stack addresses\n\tcallstack.resize(128);\n\tcallstack.resize(backtrace(callstack.data(), callstack.size()));\n\tcallstack.shrink_to_fit();\n\n\tauto tb = traceback(function, filename, line, callstack, skip);\n\n\treturn tb;\n}\n\n\nextern \"C\" void\n__assert_tb(const char* function, const char* filename, unsigned int line, const char* expression)\n{\n#ifdef XAPIAND_TRACEBACKS\n\t(void)std::fprintf(stderr, \"Assertion failed: %s in %s %s:%u%s\\n\",\n\t\texpression, function, filename, line, traceback(function, filename, line, 2).c_str());\n#else\n\t(void)std::fprintf(stderr, \"Assertion failed: %s in %s %s:%u\\n\",\n\t\texpression, function, filename, line);\n#endif\n\tabort();\n}\n<|endoftext|>"} {"text":"<commit_before>\r\n#include \"CPipelineState.h\"\r\n\r\n#include <glad\/glad.h>\r\n\r\n\r\nnamespace ion\r\n{\r\n\tnamespace Graphics\r\n\t{\r\n\t\tnamespace GL\r\n\t\t{\r\n\t\t\tCPipelineState::CPipelineState(CWindow * Window)\r\n\t\t\t{\r\n\t\t\t\tthis->Window = Window;\r\n\t\t\t}\r\n\r\n\t\t\tCPipelineState::~CPipelineState()\r\n\t\t\t{\r\n\t\t\t}\r\n\r\n\t\t\tvoid CPipelineState::SetProgram(SharedPointer<IShaderProgram> inShaderProgram)\r\n\t\t\t{\r\n\t\t\t\tif (inShaderProgram)\r\n\t\t\t\t{\r\n\t\t\t\t\tShaderProgram = std::dynamic_pointer_cast<CShaderProgram>(inShaderProgram);\r\n\t\t\t\t\tif (! ShaderProgram->Linked)\r\n\t\t\t\t\t{\r\n\t\t\t\t\t\tShaderProgram->Link();\r\n\r\n\t\t\t\t\t\tif (! ShaderProgram->Linked)\r\n\t\t\t\t\t\t{\r\n\t\t\t\t\t\t\tLog::Error(\"Failed to link shader prograg in PipelineState creation, unsetting shader.\");\r\n\t\t\t\t\t\t\tShaderProgram = nullptr;\r\n\t\t\t\t\t\t\treturn;\r\n\t\t\t\t\t\t}\r\n\t\t\t\t\t}\r\n\r\n\t\t\t\t\tUnboundUniforms = KeySet(ShaderProgram->Uniforms);\r\n\t\t\t\t\tUnboundAttributes = KeySet(ShaderProgram->Attributes);\r\n\r\n\t\t\t\t\tLoaded = false;\r\n\t\t\t\t}\r\n\t\t\t}\r\n\r\n\t\t\tvoid CPipelineState::SetVertexBuffer(uint const Index, SharedPointer<IVertexBuffer> inVertexBuffer)\r\n\t\t\t{\r\n\t\t\t\tif (Index >= VertexBuffers.size())\r\n\t\t\t\t{\r\n\t\t\t\t\tVertexBuffers.resize(Index + 1);\r\n\t\t\t\t}\r\n\r\n\t\t\t\tVertexBuffers[Index] = std::dynamic_pointer_cast<CVertexBuffer>(inVertexBuffer);\r\n\t\t\t\t\/\/ Bound VBOs are not part of VAO state\r\n\r\n\t\t\t\tLoaded = false;\r\n\t\t\t}\r\n\r\n\t\t\tvoid CPipelineState::SetIndexBuffer(SharedPointer<IIndexBuffer> inIndexBuffer)\r\n\t\t\t{\r\n\t\t\t\tIndexBuffer = std::dynamic_pointer_cast<CIndexBuffer>(inIndexBuffer);\r\n\t\t\t\tWindow->MakeContextCurrent();\r\n\t\t\t\tSafeGLCall(glBindVertexArray, (VertexArrayHandle));\r\n\t\t\t\tSafeGLCall(glBindBuffer, (GL_ELEMENT_ARRAY_BUFFER, IndexBuffer->Handle));\r\n\t\t\t\tSafeGLCall(glBindVertexArray, (0));\r\n\r\n\t\t\t\tLoaded = false;\r\n\t\t\t}\r\n\r\n\t\t\tvoid CPipelineState::SetUniform(string const & Name, SharedPointer<IUniform> Uniform)\r\n\t\t\t{\r\n\t\t\t\tif (! ShaderProgram)\r\n\t\t\t\t{\r\n\t\t\t\t\tLog::Error(\"Cannot set uniforms or textures on a PipelineState with no specified shader program.\");\r\n\t\t\t\t\treturn;\r\n\t\t\t\t}\r\n\r\n\t\t\t\tif (Uniform)\r\n\t\t\t\t{\r\n\t\t\t\t\tif (UnboundUniforms.count(Name) == 1)\r\n\t\t\t\t\t{\r\n\t\t\t\t\t\tUniforms[Name] = Uniform;\r\n\t\t\t\t\t\tUnboundUniforms.erase(Name);\r\n\t\t\t\t\t}\r\n\t\t\t\t\telse\r\n\t\t\t\t\t{\r\n\t\t\t\t\t\tLog::Warn(\"Attempting to set uniform or texture '%s' that is not required by shader, ignoring.\", Name);\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\tif (Uniforms.erase(Name) == 1)\r\n\t\t\t\t\t{\r\n\t\t\t\t\t\tUnboundUniforms.insert(Name);\r\n\t\t\t\t\t}\r\n\t\t\t\t\telse\r\n\t\t\t\t\t{\r\n\t\t\t\t\t\tLog::Error(\"Attempting to remove uniform or texture '%s' that was never specified, ignoring.\", Name);\r\n\t\t\t\t\t}\r\n\t\t\t\t}\r\n\t\t\t}\r\n\r\n\t\t\tvoid CPipelineState::SetTexture(string const & Name, SharedPointer<ITexture> Texture)\r\n\t\t\t{\r\n\t\t\t\tif (! ShaderProgram)\r\n\t\t\t\t{\r\n\t\t\t\t\tLog::Error(\"Cannot set uniforms or textures on a PipelineState with no specified shader program.\");\r\n\t\t\t\t\treturn;\r\n\t\t\t\t}\r\n\r\n\t\t\t\tif (Texture)\r\n\t\t\t\t{\r\n\t\t\t\t\tif (UnboundUniforms.count(Name) == 1)\r\n\t\t\t\t\t{\r\n\t\t\t\t\t\tTextures[Name] = Texture;\r\n\t\t\t\t\t\tUnboundUniforms.erase(Name);\r\n\t\t\t\t\t}\r\n\t\t\t\t\telse\r\n\t\t\t\t\t{\r\n\t\t\t\t\t\tLog::Warn(\"Attempting to set uniform or texture '%s' that is not required by shader, ignoring.\", Name);\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\tif (Textures.erase(Name) == 1)\r\n\t\t\t\t\t{\r\n\t\t\t\t\t\tUnboundUniforms.insert(Name);\r\n\t\t\t\t\t}\r\n\t\t\t\t\telse\r\n\t\t\t\t\t{\r\n\t\t\t\t\t\tLog::Error(\"Attempting to remove uniform or texture '%s' that was never specified, ignoring.\", Name);\r\n\t\t\t\t\t}\r\n\t\t\t\t}\r\n\t\t\t}\r\n\r\n\t\t\tvoid CPipelineState::SetFeatureEnabled(EDrawFeature const Feature, bool const Enabled)\r\n\t\t\t{\r\n\t\t\t\tswitch (Feature)\r\n\t\t\t\t{\r\n\t\t\t\tcase EDrawFeature::Wireframe:\r\n\t\t\t\t\tDrawWireframe = Enabled;\r\n\t\t\t\t\tbreak;\r\n\t\t\t\tcase EDrawFeature::CullFront:\r\n\t\t\t\t\tCullFront = Enabled;\r\n\t\t\t\t\tbreak;\r\n\t\t\t\tcase EDrawFeature::CullBack:\r\n\t\t\t\t\tCullBack = Enabled;\r\n\t\t\t\t\tbreak;\r\n\t\t\t\tcase EDrawFeature::DisableDepthTest:\r\n\t\t\t\t\tDisableDepthTest = Enabled;\r\n\t\t\t\t\tbreak;\r\n\t\t\t\tcase EDrawFeature::DisableDepthWrite:\r\n\t\t\t\t\tDisableDepthWrite = Enabled;\r\n\t\t\t\t\tbreak;\r\n\t\t\t\t}\r\n\t\t\t}\r\n\r\n\t\t\tvoid CPipelineState::SetBlendMode(EBlendMode const BlendMode)\r\n\t\t\t{\r\n\t\t\t\tthis->BlendMode = BlendMode;\r\n\t\t\t}\r\n\r\n\t\t\tvoid CPipelineState::OfferUniform(string const & Name, SharedPointer<IUniform> Uniform)\r\n\t\t\t{\r\n\t\t\t\tif (! ShaderProgram)\r\n\t\t\t\t{\r\n\t\t\t\t\tLog::Error(\"Cannot set uniforms or textures on a PipelineState with no specified shader program.\");\r\n\t\t\t\t\treturn;\r\n\t\t\t\t}\r\n\r\n\t\t\t\tif (! Uniform)\r\n\t\t\t\t{\r\n\t\t\t\t\tLog::Error(\"Invalid paramter to CPipelineState::OfferUniform: expected non-null Uniform\");\r\n\t\t\t\t\treturn;\r\n\t\t\t\t}\r\n\r\n\t\t\t\tif (UnboundUniforms.count(Name) == 1)\r\n\t\t\t\t{\r\n\t\t\t\t\tUniforms[Name] = Uniform;\r\n\t\t\t\t\tUnboundUniforms.erase(Name);\r\n\t\t\t\t}\r\n\t\t\t}\r\n\r\n\t\t\tvoid CPipelineState::OfferTexture(string const & Name, SharedPointer<ITexture> Texture)\r\n\t\t\t{\r\n\t\t\t\tif (! ShaderProgram)\r\n\t\t\t\t{\r\n\t\t\t\t\tLog::Error(\"Cannot set uniforms or textures on a PipelineState with no specified shader program.\");\r\n\t\t\t\t\treturn;\r\n\t\t\t\t}\r\n\r\n\t\t\t\tif (! Texture)\r\n\t\t\t\t{\r\n\t\t\t\t\tLog::Error(\"Invalid paramter to CPipelineState::OfferUniform: expected non-null Uniform\");\r\n\t\t\t\t\treturn;\r\n\t\t\t\t}\r\n\r\n\t\t\t\tif (UnboundUniforms.count(Name) == 1)\r\n\t\t\t\t{\r\n\t\t\t\t\tTextures[Name] = Texture;\r\n\t\t\t\t\tUnboundUniforms.erase(Name);\r\n\t\t\t\t}\r\n\t\t\t}\r\n\r\n\t\t\tset<string> CPipelineState::GetUnboundUniforms() const\r\n\t\t\t{\r\n\t\t\t\treturn UnboundUniforms;\r\n\t\t\t}\r\n\r\n\t\t\tvoid CPipelineState::Load()\r\n\t\t\t{\r\n\t\t\t\tif (! ShaderProgram || VertexBuffers.empty() || ! IndexBuffer)\r\n\t\t\t\t{\r\n\t\t\t\t\tLog::Error(\"Attempting to load an invalid PipelineState\");\r\n\t\t\t\t\treturn;\r\n\t\t\t\t}\r\n\r\n\t\t\t\tWindow->MakeContextCurrent();\r\n\t\t\t\tCheckedGLCall(glUseProgram(ShaderProgram->Handle));\r\n\t\t\t\tCheckedGLCall(glBindVertexArray(VertexArrayHandle));\r\n\r\n\t\t\t\tfor (auto & VertexBuffer : VertexBuffers)\r\n\t\t\t\t{\r\n\r\n\t\t\t\t\tCheckedGLCall(glBindBuffer(GL_ARRAY_BUFFER, VertexBuffer->Handle));\r\n\r\n\t\t\t\t\t\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\r\n\t\t\t\t\t\/\/ Set up VBOs (attributes) \/\/\r\n\t\t\t\t\t\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\r\n\r\n\t\t\t\t\t\/\/ Calculate stride of VBO data\r\n\t\t\t\t\tsize_t TotalStride = 0;\r\n\t\t\t\t\tfor (auto & InputLayoutElement : VertexBuffer->InputLayout)\r\n\t\t\t\t\t{\r\n\t\t\t\t\t\tTotalStride += GetAttributeTypeSize(InputLayoutElement.Type) * InputLayoutElement.Components;\r\n\t\t\t\t\t}\r\n\r\n\t\t\t\t\tsize_t CurrentOffset = 0;\r\n\t\t\t\t\tfor (auto & InputLayoutElement : VertexBuffer->InputLayout)\r\n\t\t\t\t\t{\r\n\t\t\t\t\t\tpair<uint, uint> AttributeInfo;\r\n\t\t\t\t\t\tif (TryMapAccess(ShaderProgram->Attributes, InputLayoutElement.Name, AttributeInfo))\r\n\t\t\t\t\t\t{\r\n\t\t\t\t\t\t\tuint const AttributeLocation = AttributeInfo.first;\r\n\t\t\t\t\t\t\tuint const AttributeType = AttributeInfo.second;\r\n\r\n\t\t\t\t\t\t\t\/\/ Validate Attribute Type (does the VBO layout match what the shader wants?)\r\n\t\t\t\t\t\t\t{\r\n\t\t\t\t\t\t\t\tbool IsAttributeTypeCorrect = false;\r\n\t\t\t\t\t\t\t\tstring ShaderAttributeTypeString = \"Unknown\";\r\n\t\t\t\t\t\t\t\tswitch (AttributeType)\r\n\t\t\t\t\t\t\t\t{\r\n\t\t\t\t\t\t\t\tdefault:\r\n\t\t\t\t\t\t\t\t\tLog::Error(\"Unexpected type for attribute %s: %u\", InputLayoutElement.Name, AttributeType);\r\n\t\t\t\t\t\t\t\t\tbreak;\r\n\t\t\t\t\t\t\t\tcase GL_FLOAT:\r\n\t\t\t\t\t\t\t\t\tIsAttributeTypeCorrect = (InputLayoutElement.Type == EAttributeType::Float && InputLayoutElement.Components == 1);\r\n\t\t\t\t\t\t\t\t\tShaderAttributeTypeString = \"GL_FLOAT\";\r\n\t\t\t\t\t\t\t\t\tbreak;\r\n\t\t\t\t\t\t\t\tcase GL_FLOAT_VEC2:\r\n\t\t\t\t\t\t\t\t\tIsAttributeTypeCorrect = (InputLayoutElement.Type == EAttributeType::Float && InputLayoutElement.Components == 2);\r\n\t\t\t\t\t\t\t\t\tShaderAttributeTypeString = \"GL_FLOAT_VEC2\";\r\n\t\t\t\t\t\t\t\t\tbreak;\r\n\t\t\t\t\t\t\t\tcase GL_FLOAT_VEC3:\r\n\t\t\t\t\t\t\t\t\tIsAttributeTypeCorrect = (InputLayoutElement.Type == EAttributeType::Float && InputLayoutElement.Components == 3);\r\n\t\t\t\t\t\t\t\t\tShaderAttributeTypeString = \"GL_FLOAT_VEC3\";\r\n\t\t\t\t\t\t\t\t\tbreak;\r\n\t\t\t\t\t\t\t\tcase GL_FLOAT_VEC4:\r\n\t\t\t\t\t\t\t\t\tIsAttributeTypeCorrect = (InputLayoutElement.Type == EAttributeType::Float && InputLayoutElement.Components == 4);\r\n\t\t\t\t\t\t\t\t\tShaderAttributeTypeString = \"GL_FLOAT_VEC4\";\r\n\t\t\t\t\t\t\t\t\tbreak;\r\n\t\t\t\t\t\t\t\tcase GL_INT:\r\n\t\t\t\t\t\t\t\t\tIsAttributeTypeCorrect = (InputLayoutElement.Type == EAttributeType::Int && InputLayoutElement.Components == 1);\r\n\t\t\t\t\t\t\t\t\tShaderAttributeTypeString = \"GL_INT\";\r\n\t\t\t\t\t\t\t\t\tbreak;\r\n\t\t\t\t\t\t\t\tcase GL_INT_VEC2:\r\n\t\t\t\t\t\t\t\t\tIsAttributeTypeCorrect = (InputLayoutElement.Type == EAttributeType::Int && InputLayoutElement.Components == 2);\r\n\t\t\t\t\t\t\t\t\tShaderAttributeTypeString = \"GL_INT_VEC2\";\r\n\t\t\t\t\t\t\t\t\tbreak;\r\n\t\t\t\t\t\t\t\tcase GL_INT_VEC3:\r\n\t\t\t\t\t\t\t\t\tIsAttributeTypeCorrect = (InputLayoutElement.Type == EAttributeType::Int && InputLayoutElement.Components == 3);\r\n\t\t\t\t\t\t\t\t\tShaderAttributeTypeString = \"GL_INT_VEC3\";\r\n\t\t\t\t\t\t\t\t\tbreak;\r\n\t\t\t\t\t\t\t\tcase GL_INT_VEC4:\r\n\t\t\t\t\t\t\t\t\tIsAttributeTypeCorrect = (InputLayoutElement.Type == EAttributeType::Int && InputLayoutElement.Components == 4);\r\n\t\t\t\t\t\t\t\t\tShaderAttributeTypeString = \"GL_INT_VEC4\";\r\n\t\t\t\t\t\t\t\t\tbreak;\r\n\t\t\t\t\t\t\t\t}\r\n\r\n\t\t\t\t\t\t\t\tif (! IsAttributeTypeCorrect)\r\n\t\t\t\t\t\t\t\t{\r\n\t\t\t\t\t\t\t\t\tLog::Error(\"Mistmatch for attribute type '%s': VBO supplied %d components of type %s but shader expected '%s'\",\r\n\t\t\t\t\t\t\t\t\t\tInputLayoutElement.Name,\r\n\t\t\t\t\t\t\t\t\t\tInputLayoutElement.Components,\r\n\t\t\t\t\t\t\t\t\t\tGetAttributeTypeString(InputLayoutElement.Type),\r\n\t\t\t\t\t\t\t\t\t\tShaderAttributeTypeString);\r\n\t\t\t\t\t\t\t\t}\r\n\t\t\t\t\t\t\t}\r\n\r\n\t\t\t\t\t\t\tCheckedGLCall(glEnableVertexAttribArray(AttributeLocation));\r\n\r\n\t\t\t\t\t\t\tswitch (AttributeType)\r\n\t\t\t\t\t\t\t{\r\n\t\t\t\t\t\t\tcase GL_FLOAT:\r\n\t\t\t\t\t\t\tcase GL_FLOAT_VEC2:\r\n\t\t\t\t\t\t\tcase GL_FLOAT_VEC3:\r\n\t\t\t\t\t\t\tcase GL_FLOAT_VEC4:\r\n\t\t\t\t\t\t\t\tCheckedGLCall(glVertexAttribPointer(\r\n\t\t\t\t\t\t\t\t\tAttributeLocation,\r\n\t\t\t\t\t\t\t\t\tInputLayoutElement.Components,\r\n\t\t\t\t\t\t\t\t\tGetAttributeTypeOpenGLEnum(InputLayoutElement.Type),\r\n\t\t\t\t\t\t\t\t\tGL_FALSE,\r\n\t\t\t\t\t\t\t\t\t(int) TotalStride,\r\n\t\t\t\t\t\t\t\t\t(void *) CurrentOffset));\r\n\t\t\t\t\t\t\t\tbreak;\r\n\t\t\t\t\t\t\tcase GL_INT:\r\n\t\t\t\t\t\t\tcase GL_INT_VEC2:\r\n\t\t\t\t\t\t\tcase GL_INT_VEC3:\r\n\t\t\t\t\t\t\tcase GL_INT_VEC4:\r\n\t\t\t\t\t\t\t\tCheckedGLCall(glVertexAttribIPointer(\r\n\t\t\t\t\t\t\t\t\tAttributeLocation,\r\n\t\t\t\t\t\t\t\t\tInputLayoutElement.Components,\r\n\t\t\t\t\t\t\t\t\tGetAttributeTypeOpenGLEnum(InputLayoutElement.Type),\r\n\t\t\t\t\t\t\t\t\t(int) TotalStride,\r\n\t\t\t\t\t\t\t\t\t(void *) CurrentOffset));\r\n\t\t\t\t\t\t\t\tbreak;\r\n\t\t\t\t\t\t\t}\r\n\r\n\t\t\t\t\t\t\tif (VertexBuffer->Instancing)\r\n\t\t\t\t\t\t\t{\r\n\t\t\t\t\t\t\t\tCheckedGLCall(glVertexAttribDivisor(AttributeLocation, 1));\r\n\t\t\t\t\t\t\t}\r\n\r\n\t\t\t\t\t\t\tUnboundAttributes.erase(InputLayoutElement.Name);\r\n\t\t\t\t\t\t}\r\n\r\n\t\t\t\t\t\tCurrentOffset += GetAttributeTypeSize(InputLayoutElement.Type) * InputLayoutElement.Components;\r\n\t\t\t\t\t}\r\n\r\n\t\t\t\t\tCheckedGLCall(glBindBuffer(GL_ARRAY_BUFFER, 0)); \/\/ Remember, VBOs are not part of VAO state (that's why we never leave them set in the VAO)\r\n\t\t\t\t}\r\n\r\n\t\t\t\tstd::for_each(UnboundAttributes.begin(), UnboundAttributes.end(), [](string const & Attribuite)\r\n\t\t\t\t{\r\n\t\t\t\t\tLog::Error(\"Attribute expected by shader but not provided by VBO: %s\", Attribuite);\r\n\t\t\t\t});\r\n\r\n\t\t\t\tCheckedGLCall(glBindVertexArray(0));\r\n\t\t\t\tCheckedGLCall(glUseProgram(0));\r\n\r\n\r\n\t\t\t\t\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\r\n\t\t\t\t\/\/ Set up Uniforms \/\/\r\n\t\t\t\t\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\r\n\r\n\t\t\t\tBoundUniforms.clear();\r\n\t\t\t\tfor (auto const & it : Uniforms)\r\n\t\t\t\t{\r\n\t\t\t\t\tuint Handle = 0;\r\n\t\t\t\t\tif (TryMapAccess(ShaderProgram->Uniforms, it.first, Handle))\r\n\t\t\t\t\t{\r\n\t\t\t\t\t\tBoundUniforms[Handle] = it.second;\r\n\t\t\t\t\t}\r\n\t\t\t\t}\r\n\t\t\t\tfor (auto const & it : Textures)\r\n\t\t\t\t{\r\n\t\t\t\t\tuint Handle = 0;\r\n\t\t\t\t\tif (TryMapAccess(ShaderProgram->Uniforms, it.first, Handle))\r\n\t\t\t\t\t{\r\n\t\t\t\t\t\tBoundTextures[Handle] = it.second;\r\n\t\t\t\t\t}\r\n\t\t\t\t}\r\n\r\n\t\t\t\tstd::for_each(UnboundUniforms.begin(), UnboundUniforms.end(), [](string const & Uniform)\r\n\t\t\t\t{\r\n\t\t\t\t\tLog::Error(\"Uniform expected by shader but not provided by PSO: %s\", Uniform);\r\n\t\t\t\t});\r\n\r\n\t\t\t\tLoaded = true;\r\n\t\t\t}\r\n\r\n\t\t}\r\n\t}\r\n}\r\n<commit_msg>[ionGraphics] Fix incorrect error message in CPipelineState::OfferTexture<commit_after>\r\n#include \"CPipelineState.h\"\r\n\r\n#include <glad\/glad.h>\r\n\r\n\r\nnamespace ion\r\n{\r\n\tnamespace Graphics\r\n\t{\r\n\t\tnamespace GL\r\n\t\t{\r\n\t\t\tCPipelineState::CPipelineState(CWindow * Window)\r\n\t\t\t{\r\n\t\t\t\tthis->Window = Window;\r\n\t\t\t}\r\n\r\n\t\t\tCPipelineState::~CPipelineState()\r\n\t\t\t{\r\n\t\t\t}\r\n\r\n\t\t\tvoid CPipelineState::SetProgram(SharedPointer<IShaderProgram> inShaderProgram)\r\n\t\t\t{\r\n\t\t\t\tif (inShaderProgram)\r\n\t\t\t\t{\r\n\t\t\t\t\tShaderProgram = std::dynamic_pointer_cast<CShaderProgram>(inShaderProgram);\r\n\t\t\t\t\tif (! ShaderProgram->Linked)\r\n\t\t\t\t\t{\r\n\t\t\t\t\t\tShaderProgram->Link();\r\n\r\n\t\t\t\t\t\tif (! ShaderProgram->Linked)\r\n\t\t\t\t\t\t{\r\n\t\t\t\t\t\t\tLog::Error(\"Failed to link shader prograg in PipelineState creation, unsetting shader.\");\r\n\t\t\t\t\t\t\tShaderProgram = nullptr;\r\n\t\t\t\t\t\t\treturn;\r\n\t\t\t\t\t\t}\r\n\t\t\t\t\t}\r\n\r\n\t\t\t\t\tUnboundUniforms = KeySet(ShaderProgram->Uniforms);\r\n\t\t\t\t\tUnboundAttributes = KeySet(ShaderProgram->Attributes);\r\n\r\n\t\t\t\t\tLoaded = false;\r\n\t\t\t\t}\r\n\t\t\t}\r\n\r\n\t\t\tvoid CPipelineState::SetVertexBuffer(uint const Index, SharedPointer<IVertexBuffer> inVertexBuffer)\r\n\t\t\t{\r\n\t\t\t\tif (Index >= VertexBuffers.size())\r\n\t\t\t\t{\r\n\t\t\t\t\tVertexBuffers.resize(Index + 1);\r\n\t\t\t\t}\r\n\r\n\t\t\t\tVertexBuffers[Index] = std::dynamic_pointer_cast<CVertexBuffer>(inVertexBuffer);\r\n\t\t\t\t\/\/ Bound VBOs are not part of VAO state\r\n\r\n\t\t\t\tLoaded = false;\r\n\t\t\t}\r\n\r\n\t\t\tvoid CPipelineState::SetIndexBuffer(SharedPointer<IIndexBuffer> inIndexBuffer)\r\n\t\t\t{\r\n\t\t\t\tIndexBuffer = std::dynamic_pointer_cast<CIndexBuffer>(inIndexBuffer);\r\n\t\t\t\tWindow->MakeContextCurrent();\r\n\t\t\t\tSafeGLCall(glBindVertexArray, (VertexArrayHandle));\r\n\t\t\t\tSafeGLCall(glBindBuffer, (GL_ELEMENT_ARRAY_BUFFER, IndexBuffer->Handle));\r\n\t\t\t\tSafeGLCall(glBindVertexArray, (0));\r\n\r\n\t\t\t\tLoaded = false;\r\n\t\t\t}\r\n\r\n\t\t\tvoid CPipelineState::SetUniform(string const & Name, SharedPointer<IUniform> Uniform)\r\n\t\t\t{\r\n\t\t\t\tif (! ShaderProgram)\r\n\t\t\t\t{\r\n\t\t\t\t\tLog::Error(\"Cannot set uniforms or textures on a PipelineState with no specified shader program.\");\r\n\t\t\t\t\treturn;\r\n\t\t\t\t}\r\n\r\n\t\t\t\tif (Uniform)\r\n\t\t\t\t{\r\n\t\t\t\t\tif (UnboundUniforms.count(Name) == 1)\r\n\t\t\t\t\t{\r\n\t\t\t\t\t\tUniforms[Name] = Uniform;\r\n\t\t\t\t\t\tUnboundUniforms.erase(Name);\r\n\t\t\t\t\t}\r\n\t\t\t\t\telse\r\n\t\t\t\t\t{\r\n\t\t\t\t\t\tLog::Warn(\"Attempting to set uniform or texture '%s' that is not required by shader, ignoring.\", Name);\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\tif (Uniforms.erase(Name) == 1)\r\n\t\t\t\t\t{\r\n\t\t\t\t\t\tUnboundUniforms.insert(Name);\r\n\t\t\t\t\t}\r\n\t\t\t\t\telse\r\n\t\t\t\t\t{\r\n\t\t\t\t\t\tLog::Error(\"Attempting to remove uniform or texture '%s' that was never specified, ignoring.\", Name);\r\n\t\t\t\t\t}\r\n\t\t\t\t}\r\n\t\t\t}\r\n\r\n\t\t\tvoid CPipelineState::SetTexture(string const & Name, SharedPointer<ITexture> Texture)\r\n\t\t\t{\r\n\t\t\t\tif (! ShaderProgram)\r\n\t\t\t\t{\r\n\t\t\t\t\tLog::Error(\"Cannot set uniforms or textures on a PipelineState with no specified shader program.\");\r\n\t\t\t\t\treturn;\r\n\t\t\t\t}\r\n\r\n\t\t\t\tif (Texture)\r\n\t\t\t\t{\r\n\t\t\t\t\tif (UnboundUniforms.count(Name) == 1)\r\n\t\t\t\t\t{\r\n\t\t\t\t\t\tTextures[Name] = Texture;\r\n\t\t\t\t\t\tUnboundUniforms.erase(Name);\r\n\t\t\t\t\t}\r\n\t\t\t\t\telse\r\n\t\t\t\t\t{\r\n\t\t\t\t\t\tLog::Warn(\"Attempting to set uniform or texture '%s' that is not required by shader, ignoring.\", Name);\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\tif (Textures.erase(Name) == 1)\r\n\t\t\t\t\t{\r\n\t\t\t\t\t\tUnboundUniforms.insert(Name);\r\n\t\t\t\t\t}\r\n\t\t\t\t\telse\r\n\t\t\t\t\t{\r\n\t\t\t\t\t\tLog::Error(\"Attempting to remove uniform or texture '%s' that was never specified, ignoring.\", Name);\r\n\t\t\t\t\t}\r\n\t\t\t\t}\r\n\t\t\t}\r\n\r\n\t\t\tvoid CPipelineState::SetFeatureEnabled(EDrawFeature const Feature, bool const Enabled)\r\n\t\t\t{\r\n\t\t\t\tswitch (Feature)\r\n\t\t\t\t{\r\n\t\t\t\tcase EDrawFeature::Wireframe:\r\n\t\t\t\t\tDrawWireframe = Enabled;\r\n\t\t\t\t\tbreak;\r\n\t\t\t\tcase EDrawFeature::CullFront:\r\n\t\t\t\t\tCullFront = Enabled;\r\n\t\t\t\t\tbreak;\r\n\t\t\t\tcase EDrawFeature::CullBack:\r\n\t\t\t\t\tCullBack = Enabled;\r\n\t\t\t\t\tbreak;\r\n\t\t\t\tcase EDrawFeature::DisableDepthTest:\r\n\t\t\t\t\tDisableDepthTest = Enabled;\r\n\t\t\t\t\tbreak;\r\n\t\t\t\tcase EDrawFeature::DisableDepthWrite:\r\n\t\t\t\t\tDisableDepthWrite = Enabled;\r\n\t\t\t\t\tbreak;\r\n\t\t\t\t}\r\n\t\t\t}\r\n\r\n\t\t\tvoid CPipelineState::SetBlendMode(EBlendMode const BlendMode)\r\n\t\t\t{\r\n\t\t\t\tthis->BlendMode = BlendMode;\r\n\t\t\t}\r\n\r\n\t\t\tvoid CPipelineState::OfferUniform(string const & Name, SharedPointer<IUniform> Uniform)\r\n\t\t\t{\r\n\t\t\t\tif (! ShaderProgram)\r\n\t\t\t\t{\r\n\t\t\t\t\tLog::Error(\"Cannot set uniforms or textures on a PipelineState with no specified shader program.\");\r\n\t\t\t\t\treturn;\r\n\t\t\t\t}\r\n\r\n\t\t\t\tif (! Uniform)\r\n\t\t\t\t{\r\n\t\t\t\t\tLog::Error(\"Invalid paramter to CPipelineState::OfferUniform: expected non-null Uniform\");\r\n\t\t\t\t\treturn;\r\n\t\t\t\t}\r\n\r\n\t\t\t\tif (UnboundUniforms.count(Name) == 1)\r\n\t\t\t\t{\r\n\t\t\t\t\tUniforms[Name] = Uniform;\r\n\t\t\t\t\tUnboundUniforms.erase(Name);\r\n\t\t\t\t}\r\n\t\t\t}\r\n\r\n\t\t\tvoid CPipelineState::OfferTexture(string const & Name, SharedPointer<ITexture> Texture)\r\n\t\t\t{\r\n\t\t\t\tif (! ShaderProgram)\r\n\t\t\t\t{\r\n\t\t\t\t\tLog::Error(\"Cannot set uniforms or textures on a PipelineState with no specified shader program.\");\r\n\t\t\t\t\treturn;\r\n\t\t\t\t}\r\n\r\n\t\t\t\tif (! Texture)\r\n\t\t\t\t{\r\n\t\t\t\t\tLog::Error(\"Invalid paramter to CPipelineState::OfferTexture: expected non-null Texture\");\r\n\t\t\t\t\treturn;\r\n\t\t\t\t}\r\n\r\n\t\t\t\tif (UnboundUniforms.count(Name) == 1)\r\n\t\t\t\t{\r\n\t\t\t\t\tTextures[Name] = Texture;\r\n\t\t\t\t\tUnboundUniforms.erase(Name);\r\n\t\t\t\t}\r\n\t\t\t}\r\n\r\n\t\t\tset<string> CPipelineState::GetUnboundUniforms() const\r\n\t\t\t{\r\n\t\t\t\treturn UnboundUniforms;\r\n\t\t\t}\r\n\r\n\t\t\tvoid CPipelineState::Load()\r\n\t\t\t{\r\n\t\t\t\tif (! ShaderProgram || VertexBuffers.empty() || ! IndexBuffer)\r\n\t\t\t\t{\r\n\t\t\t\t\tLog::Error(\"Attempting to load an invalid PipelineState\");\r\n\t\t\t\t\treturn;\r\n\t\t\t\t}\r\n\r\n\t\t\t\tWindow->MakeContextCurrent();\r\n\t\t\t\tCheckedGLCall(glUseProgram(ShaderProgram->Handle));\r\n\t\t\t\tCheckedGLCall(glBindVertexArray(VertexArrayHandle));\r\n\r\n\t\t\t\tfor (auto & VertexBuffer : VertexBuffers)\r\n\t\t\t\t{\r\n\r\n\t\t\t\t\tCheckedGLCall(glBindBuffer(GL_ARRAY_BUFFER, VertexBuffer->Handle));\r\n\r\n\t\t\t\t\t\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\r\n\t\t\t\t\t\/\/ Set up VBOs (attributes) \/\/\r\n\t\t\t\t\t\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\r\n\r\n\t\t\t\t\t\/\/ Calculate stride of VBO data\r\n\t\t\t\t\tsize_t TotalStride = 0;\r\n\t\t\t\t\tfor (auto & InputLayoutElement : VertexBuffer->InputLayout)\r\n\t\t\t\t\t{\r\n\t\t\t\t\t\tTotalStride += GetAttributeTypeSize(InputLayoutElement.Type) * InputLayoutElement.Components;\r\n\t\t\t\t\t}\r\n\r\n\t\t\t\t\tsize_t CurrentOffset = 0;\r\n\t\t\t\t\tfor (auto & InputLayoutElement : VertexBuffer->InputLayout)\r\n\t\t\t\t\t{\r\n\t\t\t\t\t\tpair<uint, uint> AttributeInfo;\r\n\t\t\t\t\t\tif (TryMapAccess(ShaderProgram->Attributes, InputLayoutElement.Name, AttributeInfo))\r\n\t\t\t\t\t\t{\r\n\t\t\t\t\t\t\tuint const AttributeLocation = AttributeInfo.first;\r\n\t\t\t\t\t\t\tuint const AttributeType = AttributeInfo.second;\r\n\r\n\t\t\t\t\t\t\t\/\/ Validate Attribute Type (does the VBO layout match what the shader wants?)\r\n\t\t\t\t\t\t\t{\r\n\t\t\t\t\t\t\t\tbool IsAttributeTypeCorrect = false;\r\n\t\t\t\t\t\t\t\tstring ShaderAttributeTypeString = \"Unknown\";\r\n\t\t\t\t\t\t\t\tswitch (AttributeType)\r\n\t\t\t\t\t\t\t\t{\r\n\t\t\t\t\t\t\t\tdefault:\r\n\t\t\t\t\t\t\t\t\tLog::Error(\"Unexpected type for attribute %s: %u\", InputLayoutElement.Name, AttributeType);\r\n\t\t\t\t\t\t\t\t\tbreak;\r\n\t\t\t\t\t\t\t\tcase GL_FLOAT:\r\n\t\t\t\t\t\t\t\t\tIsAttributeTypeCorrect = (InputLayoutElement.Type == EAttributeType::Float && InputLayoutElement.Components == 1);\r\n\t\t\t\t\t\t\t\t\tShaderAttributeTypeString = \"GL_FLOAT\";\r\n\t\t\t\t\t\t\t\t\tbreak;\r\n\t\t\t\t\t\t\t\tcase GL_FLOAT_VEC2:\r\n\t\t\t\t\t\t\t\t\tIsAttributeTypeCorrect = (InputLayoutElement.Type == EAttributeType::Float && InputLayoutElement.Components == 2);\r\n\t\t\t\t\t\t\t\t\tShaderAttributeTypeString = \"GL_FLOAT_VEC2\";\r\n\t\t\t\t\t\t\t\t\tbreak;\r\n\t\t\t\t\t\t\t\tcase GL_FLOAT_VEC3:\r\n\t\t\t\t\t\t\t\t\tIsAttributeTypeCorrect = (InputLayoutElement.Type == EAttributeType::Float && InputLayoutElement.Components == 3);\r\n\t\t\t\t\t\t\t\t\tShaderAttributeTypeString = \"GL_FLOAT_VEC3\";\r\n\t\t\t\t\t\t\t\t\tbreak;\r\n\t\t\t\t\t\t\t\tcase GL_FLOAT_VEC4:\r\n\t\t\t\t\t\t\t\t\tIsAttributeTypeCorrect = (InputLayoutElement.Type == EAttributeType::Float && InputLayoutElement.Components == 4);\r\n\t\t\t\t\t\t\t\t\tShaderAttributeTypeString = \"GL_FLOAT_VEC4\";\r\n\t\t\t\t\t\t\t\t\tbreak;\r\n\t\t\t\t\t\t\t\tcase GL_INT:\r\n\t\t\t\t\t\t\t\t\tIsAttributeTypeCorrect = (InputLayoutElement.Type == EAttributeType::Int && InputLayoutElement.Components == 1);\r\n\t\t\t\t\t\t\t\t\tShaderAttributeTypeString = \"GL_INT\";\r\n\t\t\t\t\t\t\t\t\tbreak;\r\n\t\t\t\t\t\t\t\tcase GL_INT_VEC2:\r\n\t\t\t\t\t\t\t\t\tIsAttributeTypeCorrect = (InputLayoutElement.Type == EAttributeType::Int && InputLayoutElement.Components == 2);\r\n\t\t\t\t\t\t\t\t\tShaderAttributeTypeString = \"GL_INT_VEC2\";\r\n\t\t\t\t\t\t\t\t\tbreak;\r\n\t\t\t\t\t\t\t\tcase GL_INT_VEC3:\r\n\t\t\t\t\t\t\t\t\tIsAttributeTypeCorrect = (InputLayoutElement.Type == EAttributeType::Int && InputLayoutElement.Components == 3);\r\n\t\t\t\t\t\t\t\t\tShaderAttributeTypeString = \"GL_INT_VEC3\";\r\n\t\t\t\t\t\t\t\t\tbreak;\r\n\t\t\t\t\t\t\t\tcase GL_INT_VEC4:\r\n\t\t\t\t\t\t\t\t\tIsAttributeTypeCorrect = (InputLayoutElement.Type == EAttributeType::Int && InputLayoutElement.Components == 4);\r\n\t\t\t\t\t\t\t\t\tShaderAttributeTypeString = \"GL_INT_VEC4\";\r\n\t\t\t\t\t\t\t\t\tbreak;\r\n\t\t\t\t\t\t\t\t}\r\n\r\n\t\t\t\t\t\t\t\tif (! IsAttributeTypeCorrect)\r\n\t\t\t\t\t\t\t\t{\r\n\t\t\t\t\t\t\t\t\tLog::Error(\"Mistmatch for attribute type '%s': VBO supplied %d components of type %s but shader expected '%s'\",\r\n\t\t\t\t\t\t\t\t\t\tInputLayoutElement.Name,\r\n\t\t\t\t\t\t\t\t\t\tInputLayoutElement.Components,\r\n\t\t\t\t\t\t\t\t\t\tGetAttributeTypeString(InputLayoutElement.Type),\r\n\t\t\t\t\t\t\t\t\t\tShaderAttributeTypeString);\r\n\t\t\t\t\t\t\t\t}\r\n\t\t\t\t\t\t\t}\r\n\r\n\t\t\t\t\t\t\tCheckedGLCall(glEnableVertexAttribArray(AttributeLocation));\r\n\r\n\t\t\t\t\t\t\tswitch (AttributeType)\r\n\t\t\t\t\t\t\t{\r\n\t\t\t\t\t\t\tcase GL_FLOAT:\r\n\t\t\t\t\t\t\tcase GL_FLOAT_VEC2:\r\n\t\t\t\t\t\t\tcase GL_FLOAT_VEC3:\r\n\t\t\t\t\t\t\tcase GL_FLOAT_VEC4:\r\n\t\t\t\t\t\t\t\tCheckedGLCall(glVertexAttribPointer(\r\n\t\t\t\t\t\t\t\t\tAttributeLocation,\r\n\t\t\t\t\t\t\t\t\tInputLayoutElement.Components,\r\n\t\t\t\t\t\t\t\t\tGetAttributeTypeOpenGLEnum(InputLayoutElement.Type),\r\n\t\t\t\t\t\t\t\t\tGL_FALSE,\r\n\t\t\t\t\t\t\t\t\t(int) TotalStride,\r\n\t\t\t\t\t\t\t\t\t(void *) CurrentOffset));\r\n\t\t\t\t\t\t\t\tbreak;\r\n\t\t\t\t\t\t\tcase GL_INT:\r\n\t\t\t\t\t\t\tcase GL_INT_VEC2:\r\n\t\t\t\t\t\t\tcase GL_INT_VEC3:\r\n\t\t\t\t\t\t\tcase GL_INT_VEC4:\r\n\t\t\t\t\t\t\t\tCheckedGLCall(glVertexAttribIPointer(\r\n\t\t\t\t\t\t\t\t\tAttributeLocation,\r\n\t\t\t\t\t\t\t\t\tInputLayoutElement.Components,\r\n\t\t\t\t\t\t\t\t\tGetAttributeTypeOpenGLEnum(InputLayoutElement.Type),\r\n\t\t\t\t\t\t\t\t\t(int) TotalStride,\r\n\t\t\t\t\t\t\t\t\t(void *) CurrentOffset));\r\n\t\t\t\t\t\t\t\tbreak;\r\n\t\t\t\t\t\t\t}\r\n\r\n\t\t\t\t\t\t\tif (VertexBuffer->Instancing)\r\n\t\t\t\t\t\t\t{\r\n\t\t\t\t\t\t\t\tCheckedGLCall(glVertexAttribDivisor(AttributeLocation, 1));\r\n\t\t\t\t\t\t\t}\r\n\r\n\t\t\t\t\t\t\tUnboundAttributes.erase(InputLayoutElement.Name);\r\n\t\t\t\t\t\t}\r\n\r\n\t\t\t\t\t\tCurrentOffset += GetAttributeTypeSize(InputLayoutElement.Type) * InputLayoutElement.Components;\r\n\t\t\t\t\t}\r\n\r\n\t\t\t\t\tCheckedGLCall(glBindBuffer(GL_ARRAY_BUFFER, 0)); \/\/ Remember, VBOs are not part of VAO state (that's why we never leave them set in the VAO)\r\n\t\t\t\t}\r\n\r\n\t\t\t\tstd::for_each(UnboundAttributes.begin(), UnboundAttributes.end(), [](string const & Attribuite)\r\n\t\t\t\t{\r\n\t\t\t\t\tLog::Error(\"Attribute expected by shader but not provided by VBO: %s\", Attribuite);\r\n\t\t\t\t});\r\n\r\n\t\t\t\tCheckedGLCall(glBindVertexArray(0));\r\n\t\t\t\tCheckedGLCall(glUseProgram(0));\r\n\r\n\r\n\t\t\t\t\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\r\n\t\t\t\t\/\/ Set up Uniforms \/\/\r\n\t\t\t\t\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\r\n\r\n\t\t\t\tBoundUniforms.clear();\r\n\t\t\t\tfor (auto const & it : Uniforms)\r\n\t\t\t\t{\r\n\t\t\t\t\tuint Handle = 0;\r\n\t\t\t\t\tif (TryMapAccess(ShaderProgram->Uniforms, it.first, Handle))\r\n\t\t\t\t\t{\r\n\t\t\t\t\t\tBoundUniforms[Handle] = it.second;\r\n\t\t\t\t\t}\r\n\t\t\t\t}\r\n\t\t\t\tfor (auto const & it : Textures)\r\n\t\t\t\t{\r\n\t\t\t\t\tuint Handle = 0;\r\n\t\t\t\t\tif (TryMapAccess(ShaderProgram->Uniforms, it.first, Handle))\r\n\t\t\t\t\t{\r\n\t\t\t\t\t\tBoundTextures[Handle] = it.second;\r\n\t\t\t\t\t}\r\n\t\t\t\t}\r\n\r\n\t\t\t\tstd::for_each(UnboundUniforms.begin(), UnboundUniforms.end(), [](string const & Uniform)\r\n\t\t\t\t{\r\n\t\t\t\t\tLog::Error(\"Uniform expected by shader but not provided by PSO: %s\", Uniform);\r\n\t\t\t\t});\r\n\r\n\t\t\t\tLoaded = true;\r\n\t\t\t}\r\n\r\n\t\t}\r\n\t}\r\n}\r\n<|endoftext|>"} {"text":"<commit_before>\/**\n * Convert a set of aperiodic Wang tiles to an aperiodic set of \"action\" tiles.\n * A set of action tiles has 2 properties:\n * 1. The tiles are SE-identical.\n * - South and east edge colors are the same.\n * 2. The set is W-disabling.\n * - No two tiles having the same west edge color\n * can be placed directly above\/below each other\n * (i.e., the north color of one tile differs from\n * the south color of the other tile, and vice-versa).\n *\n * This particular tile set is NW-deterministic, and therefore the action\n * tiles can be used to create a deterministic unidirectional ring protocol\n * that always terminates from any initial state on any ring size,\n * but it is quite hard to prove!\n *\n * This reduction is tweaked from my paper:\n * \"Verifying Livelock Freedom on Parameterized Rings and Chains\"\n * http:\/\/dx.doi.org\/10.1007\/978-3-319-03089-0_12\n * See the paper or tech report for details about problem significance,\n * but see the comment above ReduceToActionTiles() for the new reduction.\n * It will eventually appear in a journal version.\n *\n **\/\nextern \"C\" {\n#include \"cx\/syscx.h\"\n}\n#include \"cx\/synhax.hh\"\n\n#include \"cx\/alphatab.hh\"\n#include \"cx\/map.hh\"\n#include \"cx\/ofile.hh\"\n#include \"cx\/set.hh\"\n#include \"cx\/table.hh\"\n#include \"cx\/tuple.hh\"\n\nusing Cx::mk_Tuple;\n\n\/\/ Tile set originally from:\n\/\/ Grunbaum and Shephard's 1986 book \"Tilings and Patterns\".\n\/\/ I pulled it from:\n\/\/ Hurd, Kari, and Culik's 1992 paper \"The Topological Entropy of Cellular Automata is Uncomputable\".\n\/\/ It's also on Wikipedia as the size 16 set:\n\/\/ https:\/\/en.wikipedia.org\/wiki\/List_of_aperiodic_sets_of_tiles\n\/\/ Edge colors are listed in order: west, north, south, east.\nstatic const uint TileSet[][4] = {\n\/\/ W N S E\n { 1, 1, 2, 2 },\n { 1, 5, 4, 1 },\n { 2, 3, 6, 2 },\n { 2, 4, 6, 1 },\n { 2, 5, 3, 1 },\n { 3, 2, 2, 6 },\n { 3, 3, 4, 4 },\n { 3, 4, 4, 5 },\n { 3, 6, 4, 3 },\n { 4, 2, 1, 6 },\n { 4, 3, 5, 4 },\n { 4, 4, 5, 5 },\n { 5, 1, 1, 4 },\n { 5, 2, 1, 3 },\n { 6, 3, 3, 4 },\n { 6, 6, 3, 3 }\n};\n\n\/** Lookup\/create a unique id for a symbol.\n *\n * A symbol is an array of color values from the input Wang tile set.\n **\/\nstatic\n uint\nLookupSymId (Cx::Map< Cx::Table<uint>, uint >& idmap, const Cx::Table<uint>& key)\n{\n return idmap.ensure(key, idmap.sz());\n}\n\n\/** Populate {ret_acts}, return domain size.\n *\n * Each input Wang tile is converted to some action tiles by the following transformation:\n * ________ ________\n * | b1 | $ |\n * ________ | | |\n * | b | |a0 abcd|abcd d0|\n * | | | | |\n * |a d| --> |__abcd__|___d0___|\n * | | | abcd | d0 |\n * |____c___| | | |\n * |$ c1|c1 $|\n * | | |\n * |___c1___|____$___|\n **\/\nstatic\n uint\nReduceToActionTiles (Cx::Table< Cx::Tuple<uint,3> >& ret_acts, const Cx::Table< Cx::Tuple<uint,4> >& tiles)\n{\n Cx::Map< Cx::Table<uint>, uint > idmap;\n Cx::Set< Cx::Tuple<uint,3> > acts;\n\n \/\/ This is the $ symbol.\n const uint blank = LookupSymId (idmap, Cx::Table<uint>());\n\n \/\/ Reserve low symbol ids (i.e., action tile colors) in the action tile set\n \/\/ for those corresponding to Wang tile colors.\n {\n Cx::Set<uint> ri_colors, up_colors;\n for (uint tile_idx = 0; tile_idx < tiles.sz(); ++tile_idx) {\n const Cx::Tuple<uint,4>& tile = tiles[tile_idx];\n up_colors << tile[0] << tile[3];\n ri_colors << tile[1] << tile[2];\n }\n Cx::Set<uint>::const_iterator it;\n for (it = ri_colors.begin(); it != ri_colors.end(); ++it) {\n Cx::Table<uint> sym;\n LookupSymId (idmap, (sym << *it << 0));\n }\n for (it = up_colors.begin(); it != up_colors.end(); ++it) {\n Cx::Table<uint> sym;\n LookupSymId (idmap, (sym << *it << 1));\n }\n }\n\n for (uint tile_idx = 0; tile_idx < tiles.sz(); ++tile_idx) {\n const Cx::Tuple<uint,4>& tile = tiles[tile_idx];\n Cx::Table<uint> sym;\n\n sym << tile[0] << tile[1] << tile[2] << tile[3];\n const uint actcolor = LookupSymId (idmap, sym);\n\n sym.flush() << tile[0] << 0;\n const uint a_ri = LookupSymId (idmap, sym);\n\n sym.flush() << tile[1] << 1;\n const uint b_up = LookupSymId (idmap, sym);\n\n sym.flush() << tile[2] << 1;\n const uint c_up = LookupSymId (idmap, sym);\n\n sym.flush() << tile[3] << 0;\n const uint d_ri = LookupSymId (idmap, sym);\n\n acts << mk_Tuple(a_ri, b_up, actcolor);\n acts << mk_Tuple(blank, actcolor, c_up);\n acts << mk_Tuple(actcolor, blank, d_ri);\n acts << mk_Tuple(c_up, d_ri, blank);\n }\n acts.fill(ret_acts);\n return idmap.sz();\n}\n\n\/** Execute me now!**\/\nint main (int argc, char** argv)\n{\n int argi = init_sysCx (&argc, &argv);\n const char* arg = argv[argi];\n\n if (argi+1 != argc || eq_cstr(\"-h\", arg)) {\n failout_sysCx (\"Expect one argument of: -gv, -list, -pml, -prot\");\n return 1;\n }\n\n Cx::Table< Cx::Tuple<uint,4> > wtiles;\n for (uint i = 0; i < ArraySz(TileSet); ++i) {\n const uint* t = TileSet[i];\n wtiles << mk_Tuple(t[0], t[1], t[2], t[3]);\n }\n\n \/\/ Compute equivalent action tiles.\n Cx::Table< Cx::Tuple<uint,3> > acts;\n const uint domsz = ReduceToActionTiles(acts, wtiles);\n\n Cx::OFile ofile(stdout_OFile ());\n if (eq_cstr (\"-list\", arg)) {\n for (uint i = 0; i < acts.sz(); ++i) {\n ofile.printf (\"%3u %3u %3u\\n\", acts[i][0], acts[i][1], acts[i][2]);\n }\n }\n else if (eq_cstr (\"-gv\", arg)) {\n Cx::Map<Cx::Tuple<uint,2>, Cx::String> edges;\n for (uint i = 0; i < acts.sz(); ++i) {\n edges[mk_Tuple(acts[i][0], acts[i][2])].push_delim(\"|\") << acts[i][1];\n }\n\n ofile << \"digraph {\";\n Cx::Map<Cx::Tuple<uint,2>, Cx::String>::const_iterator it;\n for (it = edges.begin(); it != edges.end(); ++it) {\n const Cx::Tuple<uint,2> edge = it->first;\n const Cx::String label = it->second;\n ofile.printf (\"\\n %3u -> %3u [label = \\\"%s\\\"];\", edge[0], edge[1], label.ccstr());\n }\n ofile << \"\\n}\\n\";\n }\n else if (eq_cstr (\"-pml\", arg)) {\n ofile\n << \"\/\/ Promela file. For better quality, use Protocon to create this.\"\n << \"\\n#define N 4\"\n << \"\\nbyte x[N];\"\n << \"\\nbyte initializing = N;\"\n << \"\\n#define x_sc x[(_pid+N-1)%N]\"\n << \"\\n#define x_id x[_pid]\"\n << \"\\n#define UniAct(a,b,c) atomic { (x_sc == a) && (x_id == b) -> x_id = c; }\"\n << \"\\nactive[N] proctype P()\"\n << \"\\n{\"\n << \"\\n atomic {\"\n << \"\\n byte tmp;\"\n ;\n ofile.printf(\"\\n select(tmp : 0..%u);\", domsz-1);\n ofile\n << \"\\n x_id = tmp;\"\n << \"\\n initializing --;\"\n << \"\\n }\"\n << \"\\n (initializing==0);\"\n << \"\\nend_P:\"\n << \"\\n do\"\n ;\n\n for (uint i = 0; i < acts.sz(); ++i) {\n ofile.printf (\"\\n :: UniAct( %3u, %3u, %3u )\",\n acts[i][0], acts[i][1], acts[i][2]);\n }\n ofile\n << \"\\n od;\"\n << \"\\n}\\n\"\n ;\n }\n else if (eq_cstr (\"-prot\", arg)) {\n ofile\n << \"\/\/ Protocon file.\"\n << \"\\nconstant N := 3;\"\n ;\n ofile.printf (\"\\nconstant M := %u;\", domsz);\n ofile.printf (\"\\nconstant NActs := %u;\", acts.sz());\n for (uint abc = 0; abc < 3; ++abc) {\n ofile << \"\\nconstant \" << (char)('a' + abc) << \" := ( \";\n for (uint i = 0; i < acts.sz(); ++i) {\n if (i > 0) ofile << \", \";\n ofile << acts[i][abc];\n }\n ofile << \" );\";\n }\n\n ofile\n << \"\\nvariable x[Nat % N] <- Nat % M;\"\n << \"\\nprocess P[i <- Nat % N]\"\n << \"\\n{\"\n << \"\\n read: x[i-1];\"\n << \"\\n write: x[i];\"\n << \"\\n (future & silent)\"\n << \"\\n (forall j <- Nat % NActs : !(x[i-1]==a[j] && x[i]==b[j]));\"\n << \"\\n puppet:\"\n ;\n for (uint i = 0; i < acts.sz(); ++i) {\n ofile.printf (\"\\n ( x[i-1]==a[%u] && x[i]==b[%u] --> x[i]:=c[%u]; )\", i, i, i);\n }\n ofile\n << \"\\n ;\"\n << \"\\n}\\n\";\n }\n\n lose_sysCx ();\n return 0;\n}\n\n<commit_msg>Simplify some variable names in {unidomino}<commit_after>\/**\n * Convert a set of aperiodic Wang tiles to an aperiodic set of \"action\" tiles.\n * A set of action tiles has 2 properties:\n * 1. The tiles are SE-identical.\n * - South and east edge colors are the same.\n * 2. The set is W-disabling.\n * - No two tiles having the same west edge color\n * can be placed directly above\/below each other\n * (i.e., the north color of one tile differs from\n * the south color of the other tile, and vice-versa).\n *\n * This particular tile set is NW-deterministic, and therefore the action\n * tiles can be used to create a deterministic unidirectional ring protocol\n * that always terminates from any initial state on any ring size,\n * but it is quite hard to prove!\n *\n * This reduction is tweaked from my paper:\n * \"Verifying Livelock Freedom on Parameterized Rings and Chains\"\n * http:\/\/dx.doi.org\/10.1007\/978-3-319-03089-0_12\n * See the paper or tech report for details about problem significance,\n * but see the comment above ReduceToActionTiles() for the new reduction.\n * It will eventually appear in a journal version.\n *\n **\/\nextern \"C\" {\n#include \"cx\/syscx.h\"\n}\n#include \"cx\/synhax.hh\"\n\n#include \"cx\/alphatab.hh\"\n#include \"cx\/map.hh\"\n#include \"cx\/ofile.hh\"\n#include \"cx\/set.hh\"\n#include \"cx\/table.hh\"\n#include \"cx\/tuple.hh\"\n\nusing Cx::mk_Tuple;\n\n\/\/ Tile set originally from:\n\/\/ Grunbaum and Shephard's 1986 book \"Tilings and Patterns\".\n\/\/ I pulled it from:\n\/\/ Hurd, Kari, and Culik's 1992 paper \"The Topological Entropy of Cellular Automata is Uncomputable\".\n\/\/ It's also on Wikipedia as the size 16 set:\n\/\/ https:\/\/en.wikipedia.org\/wiki\/List_of_aperiodic_sets_of_tiles\n\/\/ Edge colors are listed in order: west, north, south, east.\nstatic const uint TileSet[][4] = {\n\/\/ W N S E\n { 1, 1, 2, 2 },\n { 1, 5, 4, 1 },\n { 2, 3, 6, 2 },\n { 2, 4, 6, 1 },\n { 2, 5, 3, 1 },\n { 3, 2, 2, 6 },\n { 3, 3, 4, 4 },\n { 3, 4, 4, 5 },\n { 3, 6, 4, 3 },\n { 4, 2, 1, 6 },\n { 4, 3, 5, 4 },\n { 4, 4, 5, 5 },\n { 5, 1, 1, 4 },\n { 5, 2, 1, 3 },\n { 6, 3, 3, 4 },\n { 6, 6, 3, 3 }\n};\n\n\/** Lookup\/create a unique id for a symbol.\n *\n * A symbol is an array of color values from the input Wang tile set.\n **\/\nstatic\n uint\nLookupSymId (Cx::Map< Cx::Table<uint>, uint >& idmap, const Cx::Table<uint>& key)\n{\n return idmap.ensure(key, idmap.sz());\n}\n\n\/** Populate {ret_acts}, return domain size.\n *\n * Each input Wang tile is converted to some action tiles by the following transformation:\n * ________ ________\n * | b1 | $ |\n * ________ | | |\n * | b | |a0 abcd|abcd d0|\n * | | | | |\n * |a d| --> |__abcd__|___d0___|\n * | | | abcd | d0 |\n * |____c___| | | |\n * |$ c1|c1 $|\n * | | |\n * |___c1___|____$___|\n **\/\nstatic\n uint\nReduceToActionTiles (Cx::Table< Cx::Tuple<uint,3> >& ret_acts, const Cx::Table< Cx::Tuple<uint,4> >& tiles)\n{\n Cx::Map< Cx::Table<uint>, uint > idmap;\n Cx::Set< Cx::Tuple<uint,3> > acts;\n\n \/\/ This is the $ symbol.\n const uint blank = LookupSymId (idmap, Cx::Table<uint>());\n\n \/\/ Reserve low symbol ids (i.e., action tile colors) in the action tile set\n \/\/ for those corresponding to Wang tile colors.\n {\n Cx::Set<uint> ri_colors, up_colors;\n for (uint tile_idx = 0; tile_idx < tiles.sz(); ++tile_idx) {\n const Cx::Tuple<uint,4>& tile = tiles[tile_idx];\n up_colors << tile[0] << tile[3];\n ri_colors << tile[1] << tile[2];\n }\n Cx::Set<uint>::const_iterator it;\n for (it = ri_colors.begin(); it != ri_colors.end(); ++it) {\n Cx::Table<uint> sym;\n LookupSymId (idmap, (sym << *it << 0));\n }\n for (it = up_colors.begin(); it != up_colors.end(); ++it) {\n Cx::Table<uint> sym;\n LookupSymId (idmap, (sym << *it << 1));\n }\n }\n\n for (uint tile_idx = 0; tile_idx < tiles.sz(); ++tile_idx) {\n const Cx::Tuple<uint,4>& tile = tiles[tile_idx];\n Cx::Table<uint> sym;\n\n sym << tile[0] << tile[1] << tile[2] << tile[3];\n const uint abcd = LookupSymId (idmap, sym);\n\n sym.flush() << tile[0] << 0;\n const uint a0 = LookupSymId (idmap, sym);\n\n sym.flush() << tile[1] << 1;\n const uint b1 = LookupSymId (idmap, sym);\n\n sym.flush() << tile[2] << 1;\n const uint c1 = LookupSymId (idmap, sym);\n\n sym.flush() << tile[3] << 0;\n const uint d0 = LookupSymId (idmap, sym);\n\n acts << mk_Tuple( a0 , b1 , abcd );\n acts << mk_Tuple( blank , abcd , c1 );\n acts << mk_Tuple( abcd , blank , d0 );\n acts << mk_Tuple( c1 , d0 , blank );\n }\n acts.fill(ret_acts);\n return idmap.sz();\n}\n\n\/** Execute me now!**\/\nint main (int argc, char** argv)\n{\n int argi = init_sysCx (&argc, &argv);\n const char* arg = argv[argi];\n\n if (argi+1 != argc || eq_cstr(\"-h\", arg)) {\n failout_sysCx (\"Expect one argument of: -gv, -list, -pml, -prot\");\n return 1;\n }\n\n Cx::Table< Cx::Tuple<uint,4> > wtiles;\n for (uint i = 0; i < ArraySz(TileSet); ++i) {\n const uint* t = TileSet[i];\n wtiles << mk_Tuple(t[0], t[1], t[2], t[3]);\n }\n\n \/\/ Compute equivalent action tiles.\n Cx::Table< Cx::Tuple<uint,3> > acts;\n const uint domsz = ReduceToActionTiles(acts, wtiles);\n\n Cx::OFile ofile(stdout_OFile ());\n if (eq_cstr (\"-list\", arg)) {\n for (uint i = 0; i < acts.sz(); ++i) {\n ofile.printf (\"%3u %3u %3u\\n\", acts[i][0], acts[i][1], acts[i][2]);\n }\n }\n else if (eq_cstr (\"-gv\", arg)) {\n Cx::Map<Cx::Tuple<uint,2>, Cx::String> edges;\n for (uint i = 0; i < acts.sz(); ++i) {\n edges[mk_Tuple(acts[i][0], acts[i][2])].push_delim(\"|\") << acts[i][1];\n }\n\n ofile << \"digraph {\";\n Cx::Map<Cx::Tuple<uint,2>, Cx::String>::const_iterator it;\n for (it = edges.begin(); it != edges.end(); ++it) {\n const Cx::Tuple<uint,2> edge = it->first;\n const Cx::String label = it->second;\n ofile.printf (\"\\n %3u -> %3u [label = \\\"%s\\\"];\", edge[0], edge[1], label.ccstr());\n }\n ofile << \"\\n}\\n\";\n }\n else if (eq_cstr (\"-pml\", arg)) {\n ofile\n << \"\/\/ Promela file. For better quality, use Protocon to create this.\"\n << \"\\n#define N 4\"\n << \"\\nbyte x[N];\"\n << \"\\nbyte initializing = N;\"\n << \"\\n#define x_sc x[(_pid+N-1)%N]\"\n << \"\\n#define x_id x[_pid]\"\n << \"\\n#define UniAct(a,b,c) atomic { (x_sc == a) && (x_id == b) -> x_id = c; }\"\n << \"\\nactive[N] proctype P()\"\n << \"\\n{\"\n << \"\\n atomic {\"\n << \"\\n byte tmp;\"\n ;\n ofile.printf(\"\\n select(tmp : 0..%u);\", domsz-1);\n ofile\n << \"\\n x_id = tmp;\"\n << \"\\n initializing --;\"\n << \"\\n }\"\n << \"\\n (initializing==0);\"\n << \"\\nend_P:\"\n << \"\\n do\"\n ;\n\n for (uint i = 0; i < acts.sz(); ++i) {\n ofile.printf (\"\\n :: UniAct( %3u, %3u, %3u )\",\n acts[i][0], acts[i][1], acts[i][2]);\n }\n ofile\n << \"\\n od;\"\n << \"\\n}\\n\"\n ;\n }\n else if (eq_cstr (\"-prot\", arg)) {\n ofile\n << \"\/\/ Protocon file.\"\n << \"\\nconstant N := 3;\"\n ;\n ofile.printf (\"\\nconstant M := %u;\", domsz);\n ofile.printf (\"\\nconstant NActs := %u;\", acts.sz());\n for (uint abc = 0; abc < 3; ++abc) {\n ofile << \"\\nconstant \" << (char)('a' + abc) << \" := ( \";\n for (uint i = 0; i < acts.sz(); ++i) {\n if (i > 0) ofile << \", \";\n ofile << acts[i][abc];\n }\n ofile << \" );\";\n }\n\n ofile\n << \"\\nvariable x[Nat % N] <- Nat % M;\"\n << \"\\nprocess P[i <- Nat % N]\"\n << \"\\n{\"\n << \"\\n read: x[i-1];\"\n << \"\\n write: x[i];\"\n << \"\\n (future & silent)\"\n << \"\\n (forall j <- Nat % NActs : !(x[i-1]==a[j] && x[i]==b[j]));\"\n << \"\\n puppet:\"\n ;\n for (uint i = 0; i < acts.sz(); ++i) {\n ofile.printf (\"\\n ( x[i-1]==a[%u] && x[i]==b[%u] --> x[i]:=c[%u]; )\", i, i, i);\n }\n ofile\n << \"\\n ;\"\n << \"\\n}\\n\";\n }\n\n lose_sysCx ();\n return 0;\n}\n\n<|endoftext|>"} {"text":"<commit_before>\/\/===-- ARMAsmBackend.cpp - ARM Assembler Backend -------------------------===\/\/\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\/Target\/TargetAsmBackend.h\"\n#include \"ARM.h\"\n#include \"ARMFixupKinds.h\"\n#include \"llvm\/ADT\/Twine.h\"\n#include \"llvm\/MC\/ELFObjectWriter.h\"\n#include \"llvm\/MC\/MCAssembler.h\"\n#include \"llvm\/MC\/MCExpr.h\"\n#include \"llvm\/MC\/MCObjectFormat.h\"\n#include \"llvm\/MC\/MCObjectWriter.h\"\n#include \"llvm\/MC\/MCSectionELF.h\"\n#include \"llvm\/MC\/MCSectionMachO.h\"\n#include \"llvm\/MC\/MachObjectWriter.h\"\n#include \"llvm\/Support\/ELF.h\"\n#include \"llvm\/Support\/MachO.h\"\n#include \"llvm\/Support\/ErrorHandling.h\"\n#include \"llvm\/Support\/raw_ostream.h\"\n#include \"llvm\/Target\/TargetRegistry.h\"\n#include \"llvm\/Target\/TargetAsmBackend.h\"\nusing namespace llvm;\n\nnamespace {\nclass ARMAsmBackend : public TargetAsmBackend {\npublic:\n ARMAsmBackend(const Target &T)\n : TargetAsmBackend(T) {\n }\n\n bool MayNeedRelaxation(const MCInst &Inst) const;\n\n void RelaxInstruction(const MCInst &Inst, MCInst &Res) const;\n\n bool WriteNopData(uint64_t Count, MCObjectWriter *OW) const;\n\n unsigned getPointerSize() const {\n return 4;\n }\n};\n\nbool ARMAsmBackend::MayNeedRelaxation(const MCInst &Inst) const {\n \/\/ FIXME: Thumb targets, different move constant targets..\n return false;\n}\n\nvoid ARMAsmBackend::RelaxInstruction(const MCInst &Inst, MCInst &Res) const {\n assert(0 && \"ARMAsmBackend::RelaxInstruction() unimplemented\");\n return;\n}\n\nbool ARMAsmBackend::WriteNopData(uint64_t Count, MCObjectWriter *OW) const {\n if ((Count % 4) != 0) {\n \/\/ Fixme: % 2 for Thumb?\n return false;\n }\n return true;\n}\n} \/\/ end anonymous namespace\n\nnamespace {\n\/\/ FIXME: This should be in a separate file.\n\/\/ ELF is an ELF of course...\nclass ELFARMAsmBackend : public ARMAsmBackend {\n MCELFObjectFormat Format;\n\npublic:\n Triple::OSType OSType;\n ELFARMAsmBackend(const Target &T, Triple::OSType _OSType)\n : ARMAsmBackend(T), OSType(_OSType) {\n HasScatteredSymbols = true;\n }\n\n virtual const MCObjectFormat &getObjectFormat() const {\n return Format;\n }\n\n void ApplyFixup(const MCFixup &Fixup, MCDataFragment &DF,\n uint64_t Value) const;\n\n bool isVirtualSection(const MCSection &Section) const {\n const MCSectionELF &SE = static_cast<const MCSectionELF&>(Section);\n return SE.getType() == MCSectionELF::SHT_NOBITS;\n }\n\n MCObjectWriter *createObjectWriter(raw_ostream &OS) const {\n return new ELFObjectWriter(OS, \/*Is64Bit=*\/false,\n OSType, ELF::EM_ARM,\n \/*IsLittleEndian=*\/true,\n \/*HasRelocationAddend=*\/false);\n }\n};\n\n\/\/ Fixme: can we raise this to share code between Darwin and ELF?\nvoid ELFARMAsmBackend::ApplyFixup(const MCFixup &Fixup, MCDataFragment &DF,\n uint64_t Value) const {\n assert(0 && \"ELFARMAsmBackend::ApplyFixup() unimplemented\");\n}\n\n\/\/ FIXME: This should be in a separate file.\nclass DarwinARMAsmBackend : public ARMAsmBackend {\n MCMachOObjectFormat Format;\n\npublic:\n DarwinARMAsmBackend(const Target &T)\n : ARMAsmBackend(T) {\n HasScatteredSymbols = true;\n }\n\n virtual const MCObjectFormat &getObjectFormat() const {\n return Format;\n }\n\n void ApplyFixup(const MCFixup &Fixup, MCDataFragment &DF,\n uint64_t Value) const;\n\n bool isVirtualSection(const MCSection &Section) const {\n const MCSectionMachO &SMO = static_cast<const MCSectionMachO&>(Section);\n return (SMO.getType() == MCSectionMachO::S_ZEROFILL ||\n SMO.getType() == MCSectionMachO::S_GB_ZEROFILL ||\n SMO.getType() == MCSectionMachO::S_THREAD_LOCAL_ZEROFILL);\n }\n\n MCObjectWriter *createObjectWriter(raw_ostream &OS) const {\n \/\/ FIXME: Subtarget info should be derived. Force v7 for now.\n return new MachObjectWriter(OS, \/*Is64Bit=*\/false, MachO::CPUTypeARM,\n MachO::CPUSubType_ARM_V7);\n }\n\n virtual bool doesSectionRequireSymbols(const MCSection &Section) const {\n return false;\n }\n};\n\nstatic unsigned getFixupKindLog2Size(unsigned Kind) {\n switch (Kind) {\n default: llvm_unreachable(\"Unknown fixup kind!\");\n case FK_Data_4: return 2;\n case ARM::fixup_arm_pcrel_12: return 2;\n case ARM::fixup_arm_vfp_pcrel_12: return 1;\n }\n}\n\nstatic unsigned adjustFixupValue(unsigned Kind, uint64_t Value) {\n switch (Kind) {\n default:\n llvm_unreachable(\"Unknown fixup kind!\");\n case FK_Data_4:\n case ARM::fixup_arm_pcrel_12:\n \/\/ ARM PC-relative values are offset by 8.\n return Value - 8;\n case ARM::fixup_arm_vfp_pcrel_12:\n \/\/ The VFP ld\/st immediate value doesn't encode the low two bits since\n \/\/ they're always zero. Offset by 8 just as above.\n return (Value - 8) >> 2;\n }\n}\n\nvoid DarwinARMAsmBackend::ApplyFixup(const MCFixup &Fixup, MCDataFragment &DF,\n uint64_t Value) const {\n unsigned NumBytes = getFixupKindLog2Size(Fixup.getKind());\n Value = adjustFixupValue(Fixup.getKind(), Value);\n\n assert(Fixup.getOffset() + NumBytes <= DF.getContents().size() &&\n \"Invalid fixup offset!\");\n \/\/ For each byte of the fragment that the fixup touches, mask in the\n \/\/ bits from the fixup value.\n for (unsigned i = 0; i != NumBytes; ++i)\n DF.getContents()[Fixup.getOffset() + i] |= uint8_t(Value >> (i * 8));\n}\n} \/\/ end anonymous namespace\n\nTargetAsmBackend *llvm::createARMAsmBackend(const Target &T,\n const std::string &TT) {\n switch (Triple(TT).getOS()) {\n case Triple::Darwin:\n return new DarwinARMAsmBackend(T);\n case Triple::MinGW32:\n case Triple::Cygwin:\n case Triple::Win32:\n assert(0 && \"Windows not supported on ARM\");\n default:\n return new ELFARMAsmBackend(T, Triple(TT).getOS());\n }\n}\n<commit_msg>ARM .word data fixups don't need an adjustment.<commit_after>\/\/===-- ARMAsmBackend.cpp - ARM Assembler Backend -------------------------===\/\/\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\/Target\/TargetAsmBackend.h\"\n#include \"ARM.h\"\n#include \"ARMFixupKinds.h\"\n#include \"llvm\/ADT\/Twine.h\"\n#include \"llvm\/MC\/ELFObjectWriter.h\"\n#include \"llvm\/MC\/MCAssembler.h\"\n#include \"llvm\/MC\/MCExpr.h\"\n#include \"llvm\/MC\/MCObjectFormat.h\"\n#include \"llvm\/MC\/MCObjectWriter.h\"\n#include \"llvm\/MC\/MCSectionELF.h\"\n#include \"llvm\/MC\/MCSectionMachO.h\"\n#include \"llvm\/MC\/MachObjectWriter.h\"\n#include \"llvm\/Support\/ELF.h\"\n#include \"llvm\/Support\/MachO.h\"\n#include \"llvm\/Support\/ErrorHandling.h\"\n#include \"llvm\/Support\/raw_ostream.h\"\n#include \"llvm\/Target\/TargetRegistry.h\"\n#include \"llvm\/Target\/TargetAsmBackend.h\"\nusing namespace llvm;\n\nnamespace {\nclass ARMAsmBackend : public TargetAsmBackend {\npublic:\n ARMAsmBackend(const Target &T)\n : TargetAsmBackend(T) {\n }\n\n bool MayNeedRelaxation(const MCInst &Inst) const;\n\n void RelaxInstruction(const MCInst &Inst, MCInst &Res) const;\n\n bool WriteNopData(uint64_t Count, MCObjectWriter *OW) const;\n\n unsigned getPointerSize() const {\n return 4;\n }\n};\n\nbool ARMAsmBackend::MayNeedRelaxation(const MCInst &Inst) const {\n \/\/ FIXME: Thumb targets, different move constant targets..\n return false;\n}\n\nvoid ARMAsmBackend::RelaxInstruction(const MCInst &Inst, MCInst &Res) const {\n assert(0 && \"ARMAsmBackend::RelaxInstruction() unimplemented\");\n return;\n}\n\nbool ARMAsmBackend::WriteNopData(uint64_t Count, MCObjectWriter *OW) const {\n if ((Count % 4) != 0) {\n \/\/ Fixme: % 2 for Thumb?\n return false;\n }\n return true;\n}\n} \/\/ end anonymous namespace\n\nnamespace {\n\/\/ FIXME: This should be in a separate file.\n\/\/ ELF is an ELF of course...\nclass ELFARMAsmBackend : public ARMAsmBackend {\n MCELFObjectFormat Format;\n\npublic:\n Triple::OSType OSType;\n ELFARMAsmBackend(const Target &T, Triple::OSType _OSType)\n : ARMAsmBackend(T), OSType(_OSType) {\n HasScatteredSymbols = true;\n }\n\n virtual const MCObjectFormat &getObjectFormat() const {\n return Format;\n }\n\n void ApplyFixup(const MCFixup &Fixup, MCDataFragment &DF,\n uint64_t Value) const;\n\n bool isVirtualSection(const MCSection &Section) const {\n const MCSectionELF &SE = static_cast<const MCSectionELF&>(Section);\n return SE.getType() == MCSectionELF::SHT_NOBITS;\n }\n\n MCObjectWriter *createObjectWriter(raw_ostream &OS) const {\n return new ELFObjectWriter(OS, \/*Is64Bit=*\/false,\n OSType, ELF::EM_ARM,\n \/*IsLittleEndian=*\/true,\n \/*HasRelocationAddend=*\/false);\n }\n};\n\n\/\/ Fixme: can we raise this to share code between Darwin and ELF?\nvoid ELFARMAsmBackend::ApplyFixup(const MCFixup &Fixup, MCDataFragment &DF,\n uint64_t Value) const {\n assert(0 && \"ELFARMAsmBackend::ApplyFixup() unimplemented\");\n}\n\n\/\/ FIXME: This should be in a separate file.\nclass DarwinARMAsmBackend : public ARMAsmBackend {\n MCMachOObjectFormat Format;\n\npublic:\n DarwinARMAsmBackend(const Target &T)\n : ARMAsmBackend(T) {\n HasScatteredSymbols = true;\n }\n\n virtual const MCObjectFormat &getObjectFormat() const {\n return Format;\n }\n\n void ApplyFixup(const MCFixup &Fixup, MCDataFragment &DF,\n uint64_t Value) const;\n\n bool isVirtualSection(const MCSection &Section) const {\n const MCSectionMachO &SMO = static_cast<const MCSectionMachO&>(Section);\n return (SMO.getType() == MCSectionMachO::S_ZEROFILL ||\n SMO.getType() == MCSectionMachO::S_GB_ZEROFILL ||\n SMO.getType() == MCSectionMachO::S_THREAD_LOCAL_ZEROFILL);\n }\n\n MCObjectWriter *createObjectWriter(raw_ostream &OS) const {\n \/\/ FIXME: Subtarget info should be derived. Force v7 for now.\n return new MachObjectWriter(OS, \/*Is64Bit=*\/false, MachO::CPUTypeARM,\n MachO::CPUSubType_ARM_V7);\n }\n\n virtual bool doesSectionRequireSymbols(const MCSection &Section) const {\n return false;\n }\n};\n\nstatic unsigned getFixupKindLog2Size(unsigned Kind) {\n switch (Kind) {\n default: llvm_unreachable(\"Unknown fixup kind!\");\n case FK_Data_4: return 2;\n case ARM::fixup_arm_pcrel_12: return 2;\n case ARM::fixup_arm_vfp_pcrel_12: return 1;\n }\n}\n\nstatic unsigned adjustFixupValue(unsigned Kind, uint64_t Value) {\n switch (Kind) {\n default:\n llvm_unreachable(\"Unknown fixup kind!\");\n case FK_Data_4:\n return Value;\n case ARM::fixup_arm_pcrel_12:\n \/\/ ARM PC-relative values are offset by 8.\n return Value - 8;\n case ARM::fixup_arm_vfp_pcrel_12:\n \/\/ The VFP ld\/st immediate value doesn't encode the low two bits since\n \/\/ they're always zero. Offset by 8 just as above.\n return (Value - 8) >> 2;\n }\n}\n\nvoid DarwinARMAsmBackend::ApplyFixup(const MCFixup &Fixup, MCDataFragment &DF,\n uint64_t Value) const {\n unsigned NumBytes = getFixupKindLog2Size(Fixup.getKind());\n Value = adjustFixupValue(Fixup.getKind(), Value);\n\n assert(Fixup.getOffset() + NumBytes <= DF.getContents().size() &&\n \"Invalid fixup offset!\");\n \/\/ For each byte of the fragment that the fixup touches, mask in the\n \/\/ bits from the fixup value.\n for (unsigned i = 0; i != NumBytes; ++i)\n DF.getContents()[Fixup.getOffset() + i] |= uint8_t(Value >> (i * 8));\n}\n} \/\/ end anonymous namespace\n\nTargetAsmBackend *llvm::createARMAsmBackend(const Target &T,\n const std::string &TT) {\n switch (Triple(TT).getOS()) {\n case Triple::Darwin:\n return new DarwinARMAsmBackend(T);\n case Triple::MinGW32:\n case Triple::Cygwin:\n case Triple::Win32:\n assert(0 && \"Windows not supported on ARM\");\n default:\n return new ELFARMAsmBackend(T, Triple(TT).getOS());\n }\n}\n<|endoftext|>"} {"text":"<commit_before>\/\/===-- asan_test_main.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\/\/===----------------------------------------------------------------------===\/\/\n#include \"asan_test_utils.h\"\n\nint main(int argc, char **argv) {\n testing::GTEST_FLAG(death_test_style) = \"threadsafe\";\n testing::InitGoogleTest(&argc, argv);\n return RUN_ALL_TESTS();\n}\n<commit_msg>[asan] Speed up ASan unit tests by turning off symbolication<commit_after>\/\/===-- asan_test_main.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\/\/===----------------------------------------------------------------------===\/\/\n#include \"asan_test_utils.h\"\n\n\/\/ Default ASAN_OPTIONS for the unit tests. Let's turn symbolication off to\n\/\/ speed up testing (unit tests don't use it anyway).\nextern \"C\" const char* __asan_default_options() {\n return \"symbolize=false\";\n}\n\nint main(int argc, char **argv) {\n testing::GTEST_FLAG(death_test_style) = \"threadsafe\";\n testing::InitGoogleTest(&argc, argv);\n return RUN_ALL_TESTS();\n}\n<|endoftext|>"} {"text":"<commit_before>\/*\n kmime_charfreq.cpp\n\n KMime, the KDE internet mail\/usenet news message library.\n Copyright (c) 2001-2002 Marc Mutz <mutz@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; version 2 of the License.\n You should have received a copy of the GNU General Public License\n along with this program; if not, write to the Free Software Foundation,\n Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307, US\n*\/\n\n#include \"kmime_charfreq.h\"\n\nnamespace KMime {\n\nCharFreq::CharFreq( const QByteArray & buf )\n : NUL(0),\n CTL(0),\n CR(0), LF(0),\n CRLF(0),\n printable(0),\n eightBit(0),\n total(0),\n lineMin(0xffffffff),\n lineMax(0),\n mTrailingWS(false),\n mLeadingFrom(false)\n{\n if ( !buf.isEmpty() )\n count( buf.data(), buf.size() );\n}\n\nCharFreq::CharFreq( const char * buf, size_t len )\n : NUL(0),\n CTL(0),\n CR(0), LF(0),\n CRLF(0),\n printable(0),\n eightBit(0),\n total(0),\n lineMin(0xffffffff),\n lineMax(0),\n mTrailingWS(false),\n mLeadingFrom(false)\n{\n if ( buf && len > 0 )\n count( buf, len );\n}\n\nstatic inline bool isWS( char ch ) { return ( ch == '\\t' || ch == ' ' ); }\n\nvoid CharFreq::count( const char * it, size_t len ) {\n\n const char * end = it + len;\n uint currentLineLength = 0;\n \/\/ initialize the prevChar with LF so that From_ detection works w\/o\n \/\/ special-casing:\n char prevChar = '\\n';\n char prevPrevChar = 0;\n\n for ( ; it != end ; ++it ) {\n ++currentLineLength;\n switch ( *it ) {\n case '\\0': ++NUL; break;\n case '\\r': ++CR; break;\n case '\\n': ++LF;\n if ( prevChar == '\\r' ) { --currentLineLength; ++CRLF; }\n if ( currentLineLength >= lineMax ) lineMax = currentLineLength-1;\n if ( currentLineLength <= lineMin ) lineMin = currentLineLength-1;\n if ( !mTrailingWS )\n\tif ( isWS( prevChar ) || ( prevChar == '\\r' && isWS( prevPrevChar ) ) )\n\t mTrailingWS = true;\n currentLineLength = 0;\n break;\n case 'F': \/\/ check for lines starting with From_ if not found already:\n if ( !mLeadingFrom )\n\tif ( prevChar == '\\n' && end - it >= 5 && !qstrncmp( \"From \", it, 5 ) )\n\t mLeadingFrom = true;\n ++printable;\n break;\n default:\n {\n\tuchar c = *it;\n\tif ( c == '\\t' || c >= ' ' && c <= '~' )\n\t ++printable;\n\telse if ( c == 127 || c < ' ' )\n\t ++CTL;\n\telse\n\t ++eightBit;\n }\n }\n prevPrevChar = prevChar;\n prevChar = *it;\n }\n\n \/\/ check whether the last character is tab or space\n if ( isWS( prevChar ) )\n mTrailingWS = true;\n\n total = len;\n}\n\nbool CharFreq::isEightBitData() const {\n return type() == EightBitData;\n}\n\nbool CharFreq::isEightBitText() const {\n return type() == EightBitText;\n}\n\nbool CharFreq::isSevenBitData() const {\n return type() == SevenBitData;\n}\n\nbool CharFreq::isSevenBitText() const {\n return type() == SevenBitText;\n}\n\nbool CharFreq::hasTrailingWhitespace() const {\n return mTrailingWS;\n}\n\nbool CharFreq::hasLeadingFrom() const {\n return mLeadingFrom;\n}\n\nCharFreq::Type CharFreq::type() const {\n#if 0\n qDebug( \"Total: %d; NUL: %d; CTL: %d;\\n\"\n\t \"CR: %d; LF: %d; CRLF: %d;\\n\"\n\t \"lineMin: %d; lineMax: %d;\\n\"\n\t \"printable: %d; eightBit: %d;\\n\"\n \"trailing whitespace: %s;\\n\"\n \"leading 'From ': %s;\\n\",\n\t total, NUL, CTL, CR, LF, CRLF, lineMin, lineMax,\n\t printable, eightBit,\n\t mTrailingWS ? \"yes\" : \"no\" , mLeadingFrom ? \"yes\" : \"no\" );\n#endif\n if ( NUL ) \/\/ must be binary\n return Binary;\n\n \/\/ doesn't contain NUL's:\n if ( eightBit ) {\n if ( lineMax > 988 ) return EightBitData; \/\/ not allowed in 8bit\n if ( CR != CRLF || controlCodesRatio() > 0.2 ) return EightBitData;\n return EightBitText;\n }\n\n \/\/ doesn't contain NUL's, nor 8bit chars:\n if ( lineMax > 988 ) return SevenBitData;\n if ( CR != CRLF || controlCodesRatio() > 0.2 ) return SevenBitData;\n\n \/\/ no NUL, no 8bit chars, no excessive CTLs and no lines > 998 chars:\n return SevenBitText;\n}\n\nfloat CharFreq::printableRatio() const {\n if ( total ) return float(printable) \/ float(total);\n else return 0;\n}\n\nfloat CharFreq::controlCodesRatio() const {\n if ( total ) return float(CTL) \/ float(total);\n else return 0;\n}\n\n} \/\/ namespace KMime\n\n\n<commit_msg>Backport fix for bug 74254 (attaching files with long lines causes message loss).<commit_after>\/*\n kmime_charfreq.cpp\n\n KMime, the KDE internet mail\/usenet news message library.\n Copyright (c) 2001-2002 Marc Mutz <mutz@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; version 2 of the License.\n You should have received a copy of the GNU General Public License\n along with this program; if not, write to the Free Software Foundation,\n Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307, US\n*\/\n\n#include \"kmime_charfreq.h\"\n\nnamespace KMime {\n\nCharFreq::CharFreq( const QByteArray & buf )\n : NUL(0),\n CTL(0),\n CR(0), LF(0),\n CRLF(0),\n printable(0),\n eightBit(0),\n total(0),\n lineMin(0xffffffff),\n lineMax(0),\n mTrailingWS(false),\n mLeadingFrom(false)\n{\n if ( !buf.isEmpty() )\n count( buf.data(), buf.size() );\n}\n\nCharFreq::CharFreq( const char * buf, size_t len )\n : NUL(0),\n CTL(0),\n CR(0), LF(0),\n CRLF(0),\n printable(0),\n eightBit(0),\n total(0),\n lineMin(0xffffffff),\n lineMax(0),\n mTrailingWS(false),\n mLeadingFrom(false)\n{\n if ( buf && len > 0 )\n count( buf, len );\n}\n\nstatic inline bool isWS( char ch ) { return ( ch == '\\t' || ch == ' ' ); }\n\nvoid CharFreq::count( const char * it, size_t len ) {\n\n const char * end = it + len;\n uint currentLineLength = 0;\n \/\/ initialize the prevChar with LF so that From_ detection works w\/o\n \/\/ special-casing:\n char prevChar = '\\n';\n char prevPrevChar = 0;\n\n for ( ; it != end ; ++it ) {\n ++currentLineLength;\n switch ( *it ) {\n case '\\0': ++NUL; break;\n case '\\r': ++CR; break;\n case '\\n': ++LF;\n if ( prevChar == '\\r' ) { --currentLineLength; ++CRLF; }\n if ( currentLineLength >= lineMax ) lineMax = currentLineLength-1;\n if ( currentLineLength <= lineMin ) lineMin = currentLineLength-1;\n if ( !mTrailingWS )\n\tif ( isWS( prevChar ) || ( prevChar == '\\r' && isWS( prevPrevChar ) ) )\n\t mTrailingWS = true;\n currentLineLength = 0;\n break;\n case 'F': \/\/ check for lines starting with From_ if not found already:\n if ( !mLeadingFrom )\n\tif ( prevChar == '\\n' && end - it >= 5 && !qstrncmp( \"From \", it, 5 ) )\n\t mLeadingFrom = true;\n ++printable;\n break;\n default:\n {\n\tuchar c = *it;\n\tif ( c == '\\t' || c >= ' ' && c <= '~' )\n\t ++printable;\n\telse if ( c == 127 || c < ' ' )\n\t ++CTL;\n\telse\n\t ++eightBit;\n }\n }\n prevPrevChar = prevChar;\n prevChar = *it;\n }\n\n \/\/ consider the length of the last line\n if ( currentLineLength >= lineMax ) lineMax = currentLineLength;\n if ( currentLineLength <= lineMin ) lineMin = currentLineLength;\n\n \/\/ check whether the last character is tab or space\n if ( isWS( prevChar ) )\n mTrailingWS = true;\n\n total = len;\n}\n\nbool CharFreq::isEightBitData() const {\n return type() == EightBitData;\n}\n\nbool CharFreq::isEightBitText() const {\n return type() == EightBitText;\n}\n\nbool CharFreq::isSevenBitData() const {\n return type() == SevenBitData;\n}\n\nbool CharFreq::isSevenBitText() const {\n return type() == SevenBitText;\n}\n\nbool CharFreq::hasTrailingWhitespace() const {\n return mTrailingWS;\n}\n\nbool CharFreq::hasLeadingFrom() const {\n return mLeadingFrom;\n}\n\nCharFreq::Type CharFreq::type() const {\n#if 0\n qDebug( \"Total: %d; NUL: %d; CTL: %d;\\n\"\n\t \"CR: %d; LF: %d; CRLF: %d;\\n\"\n\t \"lineMin: %d; lineMax: %d;\\n\"\n\t \"printable: %d; eightBit: %d;\\n\"\n \"trailing whitespace: %s;\\n\"\n \"leading 'From ': %s;\\n\",\n\t total, NUL, CTL, CR, LF, CRLF, lineMin, lineMax,\n\t printable, eightBit,\n\t mTrailingWS ? \"yes\" : \"no\" , mLeadingFrom ? \"yes\" : \"no\" );\n#endif\n if ( NUL ) \/\/ must be binary\n return Binary;\n\n \/\/ doesn't contain NUL's:\n if ( eightBit ) {\n if ( lineMax > 988 ) return EightBitData; \/\/ not allowed in 8bit\n if ( CR != CRLF || controlCodesRatio() > 0.2 ) return EightBitData;\n return EightBitText;\n }\n\n \/\/ doesn't contain NUL's, nor 8bit chars:\n if ( lineMax > 988 ) return SevenBitData;\n if ( CR != CRLF || controlCodesRatio() > 0.2 ) return SevenBitData;\n\n \/\/ no NUL, no 8bit chars, no excessive CTLs and no lines > 998 chars:\n return SevenBitText;\n}\n\nfloat CharFreq::printableRatio() const {\n if ( total ) return float(printable) \/ float(total);\n else return 0;\n}\n\nfloat CharFreq::controlCodesRatio() const {\n if ( total ) return float(CTL) \/ float(total);\n else return 0;\n}\n\n} \/\/ namespace KMime\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\/\/ C++ includes\n\n\n\/\/ Local Includes\n#include \"libmesh\/mesh_function.h\"\n#include \"libmesh\/dense_vector.h\"\n#include \"libmesh\/equation_systems.h\"\n#include \"libmesh\/numeric_vector.h\"\n#include \"libmesh\/dof_map.h\"\n#include \"libmesh\/point_locator_tree.h\"\n#include \"libmesh\/fe_base.h\"\n#include \"libmesh\/fe_interface.h\"\n#include \"libmesh\/fe_compute_data.h\"\n#include \"libmesh\/mesh_base.h\"\n#include \"libmesh\/point.h\"\n\nnamespace libMesh\n{\n\n\n\/\/------------------------------------------------------------------\n\/\/ MeshFunction methods\nMeshFunction::MeshFunction (const EquationSystems& eqn_systems,\n\t\t\t const NumericVector<Number>& vec,\n\t\t\t const DofMap& dof_map,\n\t\t\t const std::vector<unsigned int>& vars,\n\t\t\t const FunctionBase<Number>* master) :\n FunctionBase<Number> (master),\n _eqn_systems (eqn_systems),\n _vector (vec),\n _dof_map (dof_map),\n _system_vars (vars),\n _point_locator (NULL),\n _out_of_mesh_mode (false),\n _out_of_mesh_value ()\n{\n}\n\n\n\nMeshFunction::MeshFunction (const EquationSystems& eqn_systems,\n\t\t\t const NumericVector<Number>& vec,\n\t\t\t const DofMap& dof_map,\n\t\t\t const unsigned int var,\n\t\t\t const FunctionBase<Number>* master) :\n FunctionBase<Number> (master),\n _eqn_systems (eqn_systems),\n _vector (vec),\n _dof_map (dof_map),\n _system_vars (1,var),\n _point_locator (NULL),\n _out_of_mesh_mode (false),\n _out_of_mesh_value ()\n{\n\/\/ std::vector<unsigned int> buf (1);\n\/\/ buf[0] = var;\n\/\/ _system_vars (buf);\n}\n\n\n\n\n\n\n\nMeshFunction::~MeshFunction ()\n{\n \/\/ only delete the point locator when we are the master\n if ((this->_point_locator != NULL) && (this->_master == NULL))\n delete this->_point_locator;\n}\n\n\n\n\nvoid MeshFunction::init (const Trees::BuildType \/*point_locator_build_type*\/)\n{\n \/\/ are indices of the desired variable(s) provided?\n libmesh_assert_greater (this->_system_vars.size(), 0);\n\n \/\/ Don't do twice...\n if (this->_initialized)\n {\n libmesh_assert(this->_point_locator);\n return;\n }\n\n \/*\n * set up the PointLocator: either someone else\n * is the master (go and get the address of his\n * point locator) or this object is the master\n * (build the point locator on our own).\n *\/\n if (this->_master != NULL)\n {\n \/\/ we aren't the master\n const MeshFunction* master =\n\tlibmesh_cast_ptr<const MeshFunction*>(this->_master);\n\n if (master->_point_locator == NULL)\n {\n\t libMesh::err << \"ERROR: When the master-servant concept is used,\"\n\t\t << std::endl\n\t\t << \" the master has to be initialized first!\"\n\t\t << std::endl;\n\t libmesh_error();\n\t}\n else\n {\n\t this->_point_locator = master->_point_locator;\n\t}\n }\n else\n {\n \/\/ we are the master: build the point locator\n\n \/\/ constant reference to the other mesh\n const MeshBase& mesh = this->_eqn_systems.get_mesh();\n\n \/\/ build the point locator. Only \\p TREE version available\n \/\/AutoPtr<PointLocatorBase> ap (PointLocatorBase::build (TREE, mesh));\n \/\/this->_point_locator = ap.release();\n \/\/ this->_point_locator = new PointLocatorTree (mesh, point_locator_build_type);\n this->_point_locator = mesh.sub_point_locator().release();\n\n \/\/ Point locator no longer needs to be initialized.\n \/\/ this->_point_locator->init();\n }\n\n\n \/\/ ready for use\n this->_initialized = true;\n}\n\n\nvoid\nMeshFunction::clear ()\n{\n \/\/ only delete the point locator when we are the master\n if ((this->_point_locator != NULL) && (this->_master == NULL))\n {\n delete this->_point_locator;\n this->_point_locator = NULL;\n }\n this->_initialized = false;\n}\n\n\n\nAutoPtr<FunctionBase<Number> > MeshFunction::clone () const\n{\n return AutoPtr<FunctionBase<Number> >\n (new MeshFunction\n (_eqn_systems, _vector, _dof_map, _system_vars, this));\n}\n\n\n\nNumber MeshFunction::operator() (const Point& p,\n\t\t\t\t const Real time)\n{\n libmesh_assert (this->initialized());\n \/\/ At the moment the function we call ignores the time\n libmesh_assert_equal_to (time, 0.);\n\n DenseVector<Number> buf (1);\n this->operator() (p, time, buf);\n return buf(0);\n}\n\n\n\nGradient MeshFunction::gradient (const Point& p,\n\t\t\t\t const Real time)\n{\n libmesh_assert (this->initialized());\n \/\/ At the moment the function we call ignores the time\n libmesh_assert_equal_to (time, 0.);\n\n std::vector<Gradient> buf (1);\n this->gradient(p, time, buf);\n return buf[0];\n}\n\n\n\n#ifdef LIBMESH_ENABLE_SECOND_DERIVATIVES\nTensor MeshFunction::hessian (const Point& p,\n\t\t\t const Real time)\n{\n libmesh_assert (this->initialized());\n \/\/ At the moment the function we call ignores the time\n libmesh_assert_equal_to (time, 0.);\n\n std::vector<Tensor> buf (1);\n this->hessian(p, time, buf);\n return buf[0];\n}\n#endif\n\n\n\nvoid MeshFunction::operator() (const Point& p,\n\t\t\t const Real,\n\t\t\t DenseVector<Number>& output)\n{\n libmesh_assert (this->initialized());\n\n \/* Ensure that in the case of a master mesh function, the\n out-of-mesh mode is enabled either for both or for none. This is\n important because the out-of-mesh mode is also communicated to\n the point locator. Since this is time consuming, enable it only\n in debug mode. *\/\n#ifdef DEBUG\n if (this->_master != NULL)\n {\n const MeshFunction* master =\n\tlibmesh_cast_ptr<const MeshFunction*>(this->_master);\n if(_out_of_mesh_mode!=master->_out_of_mesh_mode)\n\t{\n\t libMesh::err << \"ERROR: If you use out-of-mesh-mode in connection with master mesh functions, you must enable out-of-mesh mode for both the master and the slave mesh function.\" << std::endl;\n\t libmesh_error();\n\t}\n }\n#endif\n\n \/\/ locate the point in the other mesh\n const Elem* element = this->_point_locator->operator()(p);\n\n if(element==NULL)\n {\n output = _out_of_mesh_value;\n }\n else\n {\n \/\/ resize the output vector to the number of output values\n \/\/ that the user told us\n output.resize (this->_system_vars.size());\n\n\n {\n\tconst unsigned int dim = this->_eqn_systems.get_mesh().mesh_dimension();\n\n\n\t\/*\n\t * Get local coordinates to feed these into compute_data().\n\t * Note that the fe_type can safely be used from the 0-variable,\n\t * since the inverse mapping is the same for all FEFamilies\n\t *\/\n\tconst Point mapped_point (FEInterface::inverse_map (dim,\n\t\t\t\t\t\t\t this->_dof_map.variable_type(0),\n\t\t\t\t\t\t\t element,\n\t\t\t\t\t\t\t p));\n\n\n\t\/\/ loop over all vars\n\tfor (unsigned int index=0; index < this->_system_vars.size(); index++)\n\t {\n\t \/*\n\t * the data for this variable\n\t *\/\n\t const unsigned int var = _system_vars[index];\n\t const FEType& fe_type = this->_dof_map.variable_type(var);\n\n\t \/**\n\t * Build an FEComputeData that contains both input and output data\n\t * for the specific compute_data method.\n\t *\/\n\t {\n\t FEComputeData data (this->_eqn_systems, mapped_point);\n\n\t FEInterface::compute_data (dim, fe_type, element, data);\n\n\t \/\/ where the solution values for the var-th variable are stored\n\t std::vector<unsigned int> dof_indices;\n\t this->_dof_map.dof_indices (element, dof_indices, var);\n\n\t \/\/ interpolate the solution\n\t {\n\t\tNumber value = 0.;\n\n\t\tfor (unsigned int i=0; i<dof_indices.size(); i++)\n\t\t value += this->_vector(dof_indices[i]) * data.shape[i];\n\n\t\toutput(index) = value;\n\t }\n\n\t }\n\n\t \/\/ next variable\n\t }\n }\n }\n\n \/\/ all done\n return;\n}\n\n\n\nvoid MeshFunction::gradient (const Point& p,\n\t\t\t const Real,\n\t\t\t std::vector<Gradient>& output)\n{\n libmesh_assert (this->initialized());\n\n \/* Ensure that in the case of a master mesh function, the\n out-of-mesh mode is enabled either for both or for none. This is\n important because the out-of-mesh mode is also communicated to\n the point locator. Since this is time consuming, enable it only\n in debug mode. *\/\n#ifdef DEBUG\n if (this->_master != NULL)\n {\n const MeshFunction* master =\n\tlibmesh_cast_ptr<const MeshFunction*>(this->_master);\n if(_out_of_mesh_mode!=master->_out_of_mesh_mode)\n\t{\n\t libMesh::err << \"ERROR: If you use out-of-mesh-mode in connection with master mesh functions, you must enable out-of-mesh mode for both the master and the slave mesh function.\" << std::endl;\n\t libmesh_error();\n\t}\n }\n#endif\n\n \/\/ locate the point in the other mesh\n const Elem* element = this->_point_locator->operator()(p);\n\n if(element==NULL)\n {\n output.resize(0);\n }\n else\n {\n \/\/ resize the output vector to the number of output values\n \/\/ that the user told us\n output.resize (this->_system_vars.size());\n\n\n {\n\tconst unsigned int dim = this->_eqn_systems.get_mesh().mesh_dimension();\n\n\n\t\/*\n\t * Get local coordinates to feed these into compute_data().\n\t * Note that the fe_type can safely be used from the 0-variable,\n\t * since the inverse mapping is the same for all FEFamilies\n\t *\/\n\tconst Point mapped_point (FEInterface::inverse_map (dim,\n\t\t\t\t\t\t\t this->_dof_map.variable_type(0),\n\t\t\t\t\t\t\t element,\n\t\t\t\t\t\t\t p));\n\n std::vector<Point> point_list (1, mapped_point);\n\n\t\/\/ loop over all vars\n\tfor (unsigned int index=0; index < this->_system_vars.size(); index++)\n\t {\n\t \/*\n\t * the data for this variable\n\t *\/\n\t const unsigned int var = _system_vars[index];\n\t const FEType& fe_type = this->_dof_map.variable_type(var);\n\n AutoPtr<FEBase> point_fe (FEBase::build(dim, fe_type));\n const std::vector<std::vector<RealGradient> >& dphi = point_fe->get_dphi();\n point_fe->reinit(element, &point_list);\n\n\t \/\/ where the solution values for the var-th variable are stored\n\t std::vector<unsigned int> dof_indices;\n\t this->_dof_map.dof_indices (element, dof_indices, var);\n\n\t \/\/ interpolate the solution\n\t Gradient grad(0.);\n\n\t for (unsigned int i=0; i<dof_indices.size(); i++)\n\t grad.add_scaled(dphi[i][0], this->_vector(dof_indices[i]));\n\n\t output[index] = grad;\n\t }\n }\n }\n\n \/\/ all done\n return;\n}\n\n\n\n#ifdef LIBMESH_ENABLE_SECOND_DERIVATIVES\nvoid MeshFunction::hessian (const Point& p,\n\t\t\t const Real,\n\t\t\t std::vector<Tensor>& output)\n{\n libmesh_assert (this->initialized());\n\n \/* Ensure that in the case of a master mesh function, the\n out-of-mesh mode is enabled either for both or for none. This is\n important because the out-of-mesh mode is also communicated to\n the point locator. Since this is time consuming, enable it only\n in debug mode. *\/\n#ifdef DEBUG\n if (this->_master != NULL)\n {\n const MeshFunction* master =\n\tlibmesh_cast_ptr<const MeshFunction*>(this->_master);\n if(_out_of_mesh_mode!=master->_out_of_mesh_mode)\n\t{\n\t libMesh::err << \"ERROR: If you use out-of-mesh-mode in connection with master mesh functions, you must enable out-of-mesh mode for both the master and the slave mesh function.\" << std::endl;\n\t libmesh_error();\n\t}\n }\n#endif\n\n \/\/ locate the point in the other mesh\n const Elem* element = this->_point_locator->operator()(p);\n\n if(element==NULL)\n {\n output.resize(0);\n }\n else\n {\n \/\/ resize the output vector to the number of output values\n \/\/ that the user told us\n output.resize (this->_system_vars.size());\n\n\n {\n\tconst unsigned int dim = this->_eqn_systems.get_mesh().mesh_dimension();\n\n\n\t\/*\n\t * Get local coordinates to feed these into compute_data().\n\t * Note that the fe_type can safely be used from the 0-variable,\n\t * since the inverse mapping is the same for all FEFamilies\n\t *\/\n\tconst Point mapped_point (FEInterface::inverse_map (dim,\n\t\t\t\t\t\t\t this->_dof_map.variable_type(0),\n\t\t\t\t\t\t\t element,\n\t\t\t\t\t\t\t p));\n\n std::vector<Point> point_list (1, mapped_point);\n\n\t\/\/ loop over all vars\n\tfor (unsigned int index=0; index < this->_system_vars.size(); index++)\n\t {\n\t \/*\n\t * the data for this variable\n\t *\/\n\t const unsigned int var = _system_vars[index];\n\t const FEType& fe_type = this->_dof_map.variable_type(var);\n\n AutoPtr<FEBase> point_fe (FEBase::build(dim, fe_type));\n const std::vector<std::vector<RealTensor> >& d2phi =\n\t\t\t point_fe->get_d2phi();\n point_fe->reinit(element, &point_list);\n\n\t \/\/ where the solution values for the var-th variable are stored\n\t std::vector<unsigned int> dof_indices;\n\t this->_dof_map.dof_indices (element, dof_indices, var);\n\n\t \/\/ interpolate the solution\n\t Tensor hess;\n\n\t for (unsigned int i=0; i<dof_indices.size(); i++)\n\t hess.add_scaled(d2phi[i][0], this->_vector(dof_indices[i]));\n\n\t output[index] = hess;\n\t }\n }\n }\n\n \/\/ all done\n return;\n}\n#endif\n\n\n\nconst PointLocatorBase& MeshFunction::get_point_locator (void) const\n{\n libmesh_assert (this->initialized());\n return *_point_locator;\n}\n\nvoid MeshFunction::enable_out_of_mesh_mode(const DenseVector<Number>& value)\n{\n libmesh_assert (this->initialized());\n _point_locator->enable_out_of_mesh_mode();\n _out_of_mesh_mode = true;\n _out_of_mesh_value = value;\n}\n\nvoid MeshFunction::enable_out_of_mesh_mode(const Number& value)\n{\n DenseVector<Number> v(1);\n v(0) = value;\n this->enable_out_of_mesh_mode(v);\n}\n\nvoid MeshFunction::disable_out_of_mesh_mode(void)\n{\n libmesh_assert (this->initialized());\n _point_locator->disable_out_of_mesh_mode();\n _out_of_mesh_mode = false;\n}\n\n} \/\/ namespace libMesh\n\n<commit_msg>These solutions could be overzealous in the common \"system1.time == system2.time\" usage case<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\/\/ C++ includes\n\n\n\/\/ Local Includes\n#include \"libmesh\/mesh_function.h\"\n#include \"libmesh\/dense_vector.h\"\n#include \"libmesh\/equation_systems.h\"\n#include \"libmesh\/numeric_vector.h\"\n#include \"libmesh\/dof_map.h\"\n#include \"libmesh\/point_locator_tree.h\"\n#include \"libmesh\/fe_base.h\"\n#include \"libmesh\/fe_interface.h\"\n#include \"libmesh\/fe_compute_data.h\"\n#include \"libmesh\/mesh_base.h\"\n#include \"libmesh\/point.h\"\n\nnamespace libMesh\n{\n\n\n\/\/------------------------------------------------------------------\n\/\/ MeshFunction methods\nMeshFunction::MeshFunction (const EquationSystems& eqn_systems,\n\t\t\t const NumericVector<Number>& vec,\n\t\t\t const DofMap& dof_map,\n\t\t\t const std::vector<unsigned int>& vars,\n\t\t\t const FunctionBase<Number>* master) :\n FunctionBase<Number> (master),\n _eqn_systems (eqn_systems),\n _vector (vec),\n _dof_map (dof_map),\n _system_vars (vars),\n _point_locator (NULL),\n _out_of_mesh_mode (false),\n _out_of_mesh_value ()\n{\n}\n\n\n\nMeshFunction::MeshFunction (const EquationSystems& eqn_systems,\n\t\t\t const NumericVector<Number>& vec,\n\t\t\t const DofMap& dof_map,\n\t\t\t const unsigned int var,\n\t\t\t const FunctionBase<Number>* master) :\n FunctionBase<Number> (master),\n _eqn_systems (eqn_systems),\n _vector (vec),\n _dof_map (dof_map),\n _system_vars (1,var),\n _point_locator (NULL),\n _out_of_mesh_mode (false),\n _out_of_mesh_value ()\n{\n\/\/ std::vector<unsigned int> buf (1);\n\/\/ buf[0] = var;\n\/\/ _system_vars (buf);\n}\n\n\n\n\n\n\n\nMeshFunction::~MeshFunction ()\n{\n \/\/ only delete the point locator when we are the master\n if ((this->_point_locator != NULL) && (this->_master == NULL))\n delete this->_point_locator;\n}\n\n\n\n\nvoid MeshFunction::init (const Trees::BuildType \/*point_locator_build_type*\/)\n{\n \/\/ are indices of the desired variable(s) provided?\n libmesh_assert_greater (this->_system_vars.size(), 0);\n\n \/\/ Don't do twice...\n if (this->_initialized)\n {\n libmesh_assert(this->_point_locator);\n return;\n }\n\n \/*\n * set up the PointLocator: either someone else\n * is the master (go and get the address of his\n * point locator) or this object is the master\n * (build the point locator on our own).\n *\/\n if (this->_master != NULL)\n {\n \/\/ we aren't the master\n const MeshFunction* master =\n\tlibmesh_cast_ptr<const MeshFunction*>(this->_master);\n\n if (master->_point_locator == NULL)\n {\n\t libMesh::err << \"ERROR: When the master-servant concept is used,\"\n\t\t << std::endl\n\t\t << \" the master has to be initialized first!\"\n\t\t << std::endl;\n\t libmesh_error();\n\t}\n else\n {\n\t this->_point_locator = master->_point_locator;\n\t}\n }\n else\n {\n \/\/ we are the master: build the point locator\n\n \/\/ constant reference to the other mesh\n const MeshBase& mesh = this->_eqn_systems.get_mesh();\n\n \/\/ build the point locator. Only \\p TREE version available\n \/\/AutoPtr<PointLocatorBase> ap (PointLocatorBase::build (TREE, mesh));\n \/\/this->_point_locator = ap.release();\n \/\/ this->_point_locator = new PointLocatorTree (mesh, point_locator_build_type);\n this->_point_locator = mesh.sub_point_locator().release();\n\n \/\/ Point locator no longer needs to be initialized.\n \/\/ this->_point_locator->init();\n }\n\n\n \/\/ ready for use\n this->_initialized = true;\n}\n\n\nvoid\nMeshFunction::clear ()\n{\n \/\/ only delete the point locator when we are the master\n if ((this->_point_locator != NULL) && (this->_master == NULL))\n {\n delete this->_point_locator;\n this->_point_locator = NULL;\n }\n this->_initialized = false;\n}\n\n\n\nAutoPtr<FunctionBase<Number> > MeshFunction::clone () const\n{\n return AutoPtr<FunctionBase<Number> >\n (new MeshFunction\n (_eqn_systems, _vector, _dof_map, _system_vars, this));\n}\n\n\n\nNumber MeshFunction::operator() (const Point& p,\n\t\t\t\t const Real time)\n{\n libmesh_assert (this->initialized());\n\n DenseVector<Number> buf (1);\n this->operator() (p, time, buf);\n return buf(0);\n}\n\n\n\nGradient MeshFunction::gradient (const Point& p,\n\t\t\t\t const Real time)\n{\n libmesh_assert (this->initialized());\n\n std::vector<Gradient> buf (1);\n this->gradient(p, time, buf);\n return buf[0];\n}\n\n\n\n#ifdef LIBMESH_ENABLE_SECOND_DERIVATIVES\nTensor MeshFunction::hessian (const Point& p,\n\t\t\t const Real time)\n{\n libmesh_assert (this->initialized());\n\n std::vector<Tensor> buf (1);\n this->hessian(p, time, buf);\n return buf[0];\n}\n#endif\n\n\n\nvoid MeshFunction::operator() (const Point& p,\n\t\t\t const Real,\n\t\t\t DenseVector<Number>& output)\n{\n libmesh_assert (this->initialized());\n\n \/* Ensure that in the case of a master mesh function, the\n out-of-mesh mode is enabled either for both or for none. This is\n important because the out-of-mesh mode is also communicated to\n the point locator. Since this is time consuming, enable it only\n in debug mode. *\/\n#ifdef DEBUG\n if (this->_master != NULL)\n {\n const MeshFunction* master =\n\tlibmesh_cast_ptr<const MeshFunction*>(this->_master);\n if(_out_of_mesh_mode!=master->_out_of_mesh_mode)\n\t{\n\t libMesh::err << \"ERROR: If you use out-of-mesh-mode in connection with master mesh functions, you must enable out-of-mesh mode for both the master and the slave mesh function.\" << std::endl;\n\t libmesh_error();\n\t}\n }\n#endif\n\n \/\/ locate the point in the other mesh\n const Elem* element = this->_point_locator->operator()(p);\n\n if(element==NULL)\n {\n output = _out_of_mesh_value;\n }\n else\n {\n \/\/ resize the output vector to the number of output values\n \/\/ that the user told us\n output.resize (this->_system_vars.size());\n\n\n {\n\tconst unsigned int dim = this->_eqn_systems.get_mesh().mesh_dimension();\n\n\n\t\/*\n\t * Get local coordinates to feed these into compute_data().\n\t * Note that the fe_type can safely be used from the 0-variable,\n\t * since the inverse mapping is the same for all FEFamilies\n\t *\/\n\tconst Point mapped_point (FEInterface::inverse_map (dim,\n\t\t\t\t\t\t\t this->_dof_map.variable_type(0),\n\t\t\t\t\t\t\t element,\n\t\t\t\t\t\t\t p));\n\n\n\t\/\/ loop over all vars\n\tfor (unsigned int index=0; index < this->_system_vars.size(); index++)\n\t {\n\t \/*\n\t * the data for this variable\n\t *\/\n\t const unsigned int var = _system_vars[index];\n\t const FEType& fe_type = this->_dof_map.variable_type(var);\n\n\t \/**\n\t * Build an FEComputeData that contains both input and output data\n\t * for the specific compute_data method.\n\t *\/\n\t {\n\t FEComputeData data (this->_eqn_systems, mapped_point);\n\n\t FEInterface::compute_data (dim, fe_type, element, data);\n\n\t \/\/ where the solution values for the var-th variable are stored\n\t std::vector<unsigned int> dof_indices;\n\t this->_dof_map.dof_indices (element, dof_indices, var);\n\n\t \/\/ interpolate the solution\n\t {\n\t\tNumber value = 0.;\n\n\t\tfor (unsigned int i=0; i<dof_indices.size(); i++)\n\t\t value += this->_vector(dof_indices[i]) * data.shape[i];\n\n\t\toutput(index) = value;\n\t }\n\n\t }\n\n\t \/\/ next variable\n\t }\n }\n }\n\n \/\/ all done\n return;\n}\n\n\n\nvoid MeshFunction::gradient (const Point& p,\n\t\t\t const Real,\n\t\t\t std::vector<Gradient>& output)\n{\n libmesh_assert (this->initialized());\n\n \/* Ensure that in the case of a master mesh function, the\n out-of-mesh mode is enabled either for both or for none. This is\n important because the out-of-mesh mode is also communicated to\n the point locator. Since this is time consuming, enable it only\n in debug mode. *\/\n#ifdef DEBUG\n if (this->_master != NULL)\n {\n const MeshFunction* master =\n\tlibmesh_cast_ptr<const MeshFunction*>(this->_master);\n if(_out_of_mesh_mode!=master->_out_of_mesh_mode)\n\t{\n\t libMesh::err << \"ERROR: If you use out-of-mesh-mode in connection with master mesh functions, you must enable out-of-mesh mode for both the master and the slave mesh function.\" << std::endl;\n\t libmesh_error();\n\t}\n }\n#endif\n\n \/\/ locate the point in the other mesh\n const Elem* element = this->_point_locator->operator()(p);\n\n if(element==NULL)\n {\n output.resize(0);\n }\n else\n {\n \/\/ resize the output vector to the number of output values\n \/\/ that the user told us\n output.resize (this->_system_vars.size());\n\n\n {\n\tconst unsigned int dim = this->_eqn_systems.get_mesh().mesh_dimension();\n\n\n\t\/*\n\t * Get local coordinates to feed these into compute_data().\n\t * Note that the fe_type can safely be used from the 0-variable,\n\t * since the inverse mapping is the same for all FEFamilies\n\t *\/\n\tconst Point mapped_point (FEInterface::inverse_map (dim,\n\t\t\t\t\t\t\t this->_dof_map.variable_type(0),\n\t\t\t\t\t\t\t element,\n\t\t\t\t\t\t\t p));\n\n std::vector<Point> point_list (1, mapped_point);\n\n\t\/\/ loop over all vars\n\tfor (unsigned int index=0; index < this->_system_vars.size(); index++)\n\t {\n\t \/*\n\t * the data for this variable\n\t *\/\n\t const unsigned int var = _system_vars[index];\n\t const FEType& fe_type = this->_dof_map.variable_type(var);\n\n AutoPtr<FEBase> point_fe (FEBase::build(dim, fe_type));\n const std::vector<std::vector<RealGradient> >& dphi = point_fe->get_dphi();\n point_fe->reinit(element, &point_list);\n\n\t \/\/ where the solution values for the var-th variable are stored\n\t std::vector<unsigned int> dof_indices;\n\t this->_dof_map.dof_indices (element, dof_indices, var);\n\n\t \/\/ interpolate the solution\n\t Gradient grad(0.);\n\n\t for (unsigned int i=0; i<dof_indices.size(); i++)\n\t grad.add_scaled(dphi[i][0], this->_vector(dof_indices[i]));\n\n\t output[index] = grad;\n\t }\n }\n }\n\n \/\/ all done\n return;\n}\n\n\n\n#ifdef LIBMESH_ENABLE_SECOND_DERIVATIVES\nvoid MeshFunction::hessian (const Point& p,\n\t\t\t const Real,\n\t\t\t std::vector<Tensor>& output)\n{\n libmesh_assert (this->initialized());\n\n \/* Ensure that in the case of a master mesh function, the\n out-of-mesh mode is enabled either for both or for none. This is\n important because the out-of-mesh mode is also communicated to\n the point locator. Since this is time consuming, enable it only\n in debug mode. *\/\n#ifdef DEBUG\n if (this->_master != NULL)\n {\n const MeshFunction* master =\n\tlibmesh_cast_ptr<const MeshFunction*>(this->_master);\n if(_out_of_mesh_mode!=master->_out_of_mesh_mode)\n\t{\n\t libMesh::err << \"ERROR: If you use out-of-mesh-mode in connection with master mesh functions, you must enable out-of-mesh mode for both the master and the slave mesh function.\" << std::endl;\n\t libmesh_error();\n\t}\n }\n#endif\n\n \/\/ locate the point in the other mesh\n const Elem* element = this->_point_locator->operator()(p);\n\n if(element==NULL)\n {\n output.resize(0);\n }\n else\n {\n \/\/ resize the output vector to the number of output values\n \/\/ that the user told us\n output.resize (this->_system_vars.size());\n\n\n {\n\tconst unsigned int dim = this->_eqn_systems.get_mesh().mesh_dimension();\n\n\n\t\/*\n\t * Get local coordinates to feed these into compute_data().\n\t * Note that the fe_type can safely be used from the 0-variable,\n\t * since the inverse mapping is the same for all FEFamilies\n\t *\/\n\tconst Point mapped_point (FEInterface::inverse_map (dim,\n\t\t\t\t\t\t\t this->_dof_map.variable_type(0),\n\t\t\t\t\t\t\t element,\n\t\t\t\t\t\t\t p));\n\n std::vector<Point> point_list (1, mapped_point);\n\n\t\/\/ loop over all vars\n\tfor (unsigned int index=0; index < this->_system_vars.size(); index++)\n\t {\n\t \/*\n\t * the data for this variable\n\t *\/\n\t const unsigned int var = _system_vars[index];\n\t const FEType& fe_type = this->_dof_map.variable_type(var);\n\n AutoPtr<FEBase> point_fe (FEBase::build(dim, fe_type));\n const std::vector<std::vector<RealTensor> >& d2phi =\n\t\t\t point_fe->get_d2phi();\n point_fe->reinit(element, &point_list);\n\n\t \/\/ where the solution values for the var-th variable are stored\n\t std::vector<unsigned int> dof_indices;\n\t this->_dof_map.dof_indices (element, dof_indices, var);\n\n\t \/\/ interpolate the solution\n\t Tensor hess;\n\n\t for (unsigned int i=0; i<dof_indices.size(); i++)\n\t hess.add_scaled(d2phi[i][0], this->_vector(dof_indices[i]));\n\n\t output[index] = hess;\n\t }\n }\n }\n\n \/\/ all done\n return;\n}\n#endif\n\n\n\nconst PointLocatorBase& MeshFunction::get_point_locator (void) const\n{\n libmesh_assert (this->initialized());\n return *_point_locator;\n}\n\nvoid MeshFunction::enable_out_of_mesh_mode(const DenseVector<Number>& value)\n{\n libmesh_assert (this->initialized());\n _point_locator->enable_out_of_mesh_mode();\n _out_of_mesh_mode = true;\n _out_of_mesh_value = value;\n}\n\nvoid MeshFunction::enable_out_of_mesh_mode(const Number& value)\n{\n DenseVector<Number> v(1);\n v(0) = value;\n this->enable_out_of_mesh_mode(v);\n}\n\nvoid MeshFunction::disable_out_of_mesh_mode(void)\n{\n libmesh_assert (this->initialized());\n _point_locator->disable_out_of_mesh_mode();\n _out_of_mesh_mode = false;\n}\n\n} \/\/ namespace libMesh\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 \"config.h\"\n#include \"bindings\/core\/v8\/ScriptStreamer.h\"\n\n#include \"bindings\/core\/v8\/ScriptStreamerThread.h\"\n#include \"bindings\/core\/v8\/V8ScriptRunner.h\"\n#include \"core\/dom\/Document.h\"\n#include \"core\/dom\/Element.h\"\n#include \"core\/dom\/PendingScript.h\"\n#include \"core\/fetch\/ScriptResource.h\"\n#include \"core\/frame\/Settings.h\"\n#include \"platform\/SharedBuffer.h\"\n#include \"wtf\/MainThread.h\"\n#include \"wtf\/text\/TextEncodingRegistry.h\"\n\nnamespace blink {\n\n\/\/ For passing data between the main thread (producer) and the streamer thread\n\/\/ (consumer). The main thread prepares the data (copies it from Resource) and\n\/\/ the streamer thread feeds it to V8.\nclass SourceStreamDataQueue {\n WTF_MAKE_NONCOPYABLE(SourceStreamDataQueue);\npublic:\n SourceStreamDataQueue()\n : m_finished(false) { }\n\n ~SourceStreamDataQueue()\n {\n while (!m_data.isEmpty()) {\n std::pair<const uint8_t*, size_t> next_data = m_data.takeFirst();\n delete[] next_data.first;\n }\n }\n\n void produce(const uint8_t* data, size_t length)\n {\n MutexLocker locker(m_mutex);\n m_data.append(std::make_pair(data, length));\n m_haveData.signal();\n }\n\n void finish()\n {\n MutexLocker locker(m_mutex);\n m_finished = true;\n m_haveData.signal();\n }\n\n void consume(const uint8_t** data, size_t* length)\n {\n MutexLocker locker(m_mutex);\n while (!tryGetData(data, length))\n m_haveData.wait(m_mutex);\n }\n\nprivate:\n bool tryGetData(const uint8_t** data, size_t* length)\n {\n if (!m_data.isEmpty()) {\n std::pair<const uint8_t*, size_t> next_data = m_data.takeFirst();\n *data = next_data.first;\n *length = next_data.second;\n return true;\n }\n if (m_finished) {\n *length = 0;\n return true;\n }\n return false;\n }\n\n WTF::Deque<std::pair<const uint8_t*, size_t> > m_data;\n bool m_finished;\n Mutex m_mutex;\n ThreadCondition m_haveData;\n};\n\n\n\/\/ SourceStream implements the streaming interface towards V8. The main\n\/\/ functionality is preparing the data to give to V8 on main thread, and\n\/\/ actually giving the data (via GetMoreData which is called on a background\n\/\/ thread).\nclass SourceStream : public v8::ScriptCompiler::ExternalSourceStream {\n WTF_MAKE_NONCOPYABLE(SourceStream);\npublic:\n SourceStream(ScriptStreamer* streamer)\n : v8::ScriptCompiler::ExternalSourceStream()\n , m_streamer(streamer)\n , m_cancelled(false)\n , m_dataPosition(0) { }\n\n virtual ~SourceStream() { }\n\n \/\/ Called by V8 on a background thread. Should block until we can return\n \/\/ some data.\n virtual size_t GetMoreData(const uint8_t** src) OVERRIDE\n {\n ASSERT(!isMainThread());\n {\n MutexLocker locker(m_mutex);\n if (m_cancelled)\n return 0;\n }\n size_t length = 0;\n \/\/ This will wait until there is data.\n m_dataQueue.consume(src, &length);\n {\n MutexLocker locker(m_mutex);\n if (m_cancelled)\n return 0;\n }\n return length;\n }\n\n void didFinishLoading()\n {\n ASSERT(isMainThread());\n m_dataQueue.finish();\n }\n\n void didReceiveData()\n {\n ASSERT(isMainThread());\n prepareDataOnMainThread();\n }\n\n void cancel()\n {\n ASSERT(isMainThread());\n \/\/ The script is no longer needed by the upper layers. Stop streaming\n \/\/ it. The next time GetMoreData is called (or woken up), it will return\n \/\/ 0, which will be interpreted as EOS by V8 and the parsing will\n \/\/ fail. ScriptStreamer::streamingComplete will be called, and at that\n \/\/ point we will release the references to SourceStream.\n {\n MutexLocker locker(m_mutex);\n m_cancelled = true;\n }\n m_dataQueue.finish();\n }\n\nprivate:\n void prepareDataOnMainThread()\n {\n ASSERT(isMainThread());\n \/\/ The Resource must still be alive; otherwise we should've cancelled\n \/\/ the streaming (if we have cancelled, the background thread is not\n \/\/ waiting).\n ASSERT(m_streamer->resource());\n\n if (m_streamer->resource()->cachedMetadata(V8ScriptRunner::tagForCodeCache())) {\n \/\/ The resource has a code cache, so it's unnecessary to stream and\n \/\/ parse the code. Cancel the streaming and resume the non-streaming\n \/\/ code path.\n m_streamer->suppressStreaming();\n {\n MutexLocker locker(m_mutex);\n m_cancelled = true;\n }\n m_dataQueue.finish();\n return;\n }\n\n if (!m_resourceBuffer) {\n \/\/ We don't have a buffer yet. Try to get it from the resource.\n SharedBuffer* buffer = m_streamer->resource()->resourceBuffer();\n if (!buffer)\n return;\n m_resourceBuffer = RefPtr<SharedBuffer>(buffer);\n }\n\n \/\/ Get as much data from the ResourceBuffer as we can.\n const char* data = 0;\n Vector<const char*> chunks;\n Vector<unsigned> chunkLengths;\n size_t dataLength = 0;\n while (unsigned length = m_resourceBuffer->getSomeData(data, m_dataPosition)) {\n \/\/ FIXME: Here we can limit based on the total length, if it turns\n \/\/ out that we don't want to give all the data we have (memory\n \/\/ vs. speed).\n chunks.append(data);\n chunkLengths.append(length);\n dataLength += length;\n m_dataPosition += length;\n }\n \/\/ Copy the data chunks into a new buffer, since we're going to give the\n \/\/ data to a background thread.\n if (dataLength > 0) {\n uint8_t* copiedData = new uint8_t[dataLength];\n unsigned offset = 0;\n for (size_t i = 0; i < chunks.size(); ++i) {\n memcpy(copiedData + offset, chunks[i], chunkLengths[i]);\n offset += chunkLengths[i];\n }\n m_dataQueue.produce(copiedData, dataLength);\n }\n }\n\n ScriptStreamer* m_streamer;\n\n \/\/ For coordinating between the main thread and background thread tasks.\n \/\/ Guarded by m_mutex.\n bool m_cancelled;\n Mutex m_mutex;\n\n unsigned m_dataPosition; \/\/ Only used by the main thread.\n RefPtr<SharedBuffer> m_resourceBuffer; \/\/ Only used by the main thread.\n SourceStreamDataQueue m_dataQueue; \/\/ Thread safe.\n};\n\nsize_t ScriptStreamer::kSmallScriptThreshold = 30 * 1024;\n\nbool ScriptStreamer::startStreaming(PendingScript& script, Settings* settings, ScriptState* scriptState)\n{\n ASSERT(isMainThread());\n if (!settings || !settings->v8ScriptStreamingEnabled())\n return false;\n ScriptResource* resource = script.resource();\n ASSERT(!resource->isLoaded());\n if (!resource->url().protocolIsInHTTPFamily())\n return false;\n if (resource->resourceToRevalidate()) {\n \/\/ This happens e.g., during reloads. We're actually not going to load\n \/\/ the current Resource of the PendingScript but switch to another\n \/\/ Resource -> don't stream.\n return false;\n }\n \/\/ We cannot filter out short scripts, even if we wait for the HTTP headers\n \/\/ to arrive. In general, the web servers don't seem to send the\n \/\/ Content-Length HTTP header for scripts.\n\n WTF::TextEncoding textEncoding(resource->encoding());\n const char* encodingName = textEncoding.name();\n\n \/\/ Here's a list of encodings we can use for streaming. These are\n \/\/ the canonical names.\n v8::ScriptCompiler::StreamedSource::Encoding encoding;\n if (strcmp(encodingName, \"windows-1252\") == 0\n || strcmp(encodingName, \"ISO-8859-1\") == 0\n || strcmp(encodingName, \"US-ASCII\") == 0) {\n encoding = v8::ScriptCompiler::StreamedSource::ONE_BYTE;\n } else if (strcmp(encodingName, \"UTF-8\") == 0) {\n encoding = v8::ScriptCompiler::StreamedSource::UTF8;\n } else {\n \/\/ We don't stream other encodings; especially we don't stream two byte\n \/\/ scripts to avoid the handling of byte order marks. Most scripts are\n \/\/ Latin1 or UTF-8 anyway, so this should be enough for most real world\n \/\/ purposes.\n return false;\n }\n\n if (scriptState->contextIsValid())\n return false;\n ScriptState::Scope scope(scriptState);\n\n \/\/ The Resource might go out of scope if the script is no longer needed. We\n \/\/ will soon call PendingScript::setStreamer, which makes the PendingScript\n \/\/ notify the ScriptStreamer when it is destroyed.\n RefPtr<ScriptStreamer> streamer = adoptRef(new ScriptStreamer(resource, encoding));\n\n \/\/ Decide what kind of cached data we should produce while streaming. By\n \/\/ default, we generate the parser cache for streamed scripts, to emulate\n \/\/ the non-streaming behavior (see V8ScriptRunner::compileScript).\n v8::ScriptCompiler::CompileOptions compileOption = v8::ScriptCompiler::kProduceParserCache;\n if (settings->v8CacheOptions() == V8CacheOptionsCode)\n compileOption = v8::ScriptCompiler::kProduceCodeCache;\n v8::ScriptCompiler::ScriptStreamingTask* scriptStreamingTask = v8::ScriptCompiler::StartStreamingScript(scriptState->isolate(), &(streamer->m_source), compileOption);\n if (scriptStreamingTask) {\n streamer->m_task = scriptStreamingTask;\n \/\/ ScriptStreamer needs to stay alive as long as the background task is\n \/\/ running. This is taken care of with a manual ref() & deref() pair;\n \/\/ the corresponding deref() is in streamingComplete.\n streamer->ref();\n script.setStreamer(streamer.release());\n return true;\n }\n \/\/ Otherwise, V8 cannot stream the script.\n return false;\n}\n\nvoid ScriptStreamer::streamingComplete()\n{\n ASSERT(isMainThread());\n \/\/ It's possible that the corresponding Resource was deleted before V8\n \/\/ finished streaming. In that case, the data or the notification is not\n \/\/ needed. In addition, if the streaming is suppressed, the non-streaming\n \/\/ code path will resume after the resource has loaded, before the\n \/\/ background task finishes.\n if (m_detached || m_streamingSuppressed) {\n deref();\n return;\n }\n\n \/\/ We have now streamed the whole script to V8 and it has parsed the\n \/\/ script. We're ready for the next step: compiling and executing the\n \/\/ script.\n m_parsingFinished = true;\n\n notifyFinishedToClient();\n\n \/\/ The background thread no longer holds an implicit reference.\n deref();\n}\n\nvoid ScriptStreamer::cancel()\n{\n ASSERT(isMainThread());\n \/\/ The upper layer doesn't need the script any more, but streaming might\n \/\/ still be ongoing. Tell SourceStream to try to cancel it whenever it gets\n \/\/ the control the next time. It can also be that V8 has already completed\n \/\/ its operations and streamingComplete will be called soon.\n m_detached = true;\n m_resource = 0;\n m_stream->cancel();\n}\n\nvoid ScriptStreamer::suppressStreaming()\n{\n ASSERT(!m_parsingFinished);\n ASSERT(!m_loadingFinished);\n m_streamingSuppressed = true;\n}\n\nvoid ScriptStreamer::notifyAppendData(ScriptResource* resource)\n{\n ASSERT(isMainThread());\n ASSERT(m_resource == resource);\n if (m_streamingSuppressed)\n return;\n if (!m_firstDataChunkReceived) {\n m_firstDataChunkReceived = true;\n \/\/ Check the size of the first data chunk. The expectation is that if\n \/\/ the first chunk is small, there won't be a second one. In those\n \/\/ cases, it doesn't make sense to stream at all.\n if (resource->resourceBuffer()->size() < kSmallScriptThreshold) {\n suppressStreaming();\n return;\n }\n if (ScriptStreamerThread::shared()->isRunningTask()) {\n \/\/ At the moment we only have one thread for running the tasks. A\n \/\/ new task shouldn't be queued before the running task completes,\n \/\/ because the running task can block and wait for data from the\n \/\/ network. At the moment we are only streaming parser blocking\n \/\/ scripts, but this code can still be hit when multiple frames are\n \/\/ loading simultaneously.\n suppressStreaming();\n return;\n }\n ScriptStreamingTask* task = new ScriptStreamingTask(m_task, this);\n ScriptStreamerThread::shared()->postTask(task);\n m_task = 0;\n }\n m_stream->didReceiveData();\n}\n\nvoid ScriptStreamer::notifyFinished(Resource* resource)\n{\n ASSERT(isMainThread());\n ASSERT(m_resource == resource);\n \/\/ A special case: empty scripts. We didn't receive any data before this\n \/\/ notification. In that case, there won't be a \"parsing complete\"\n \/\/ notification either, and we should not wait for it.\n if (!m_firstDataChunkReceived)\n suppressStreaming();\n m_stream->didFinishLoading();\n m_loadingFinished = true;\n notifyFinishedToClient();\n}\n\nScriptStreamer::ScriptStreamer(ScriptResource* resource, v8::ScriptCompiler::StreamedSource::Encoding encoding)\n : m_resource(resource)\n , m_detached(false)\n , m_stream(new SourceStream(this))\n , m_source(m_stream, encoding) \/\/ m_source takes ownership of m_stream.\n , m_client(0)\n , m_task(0)\n , m_loadingFinished(false)\n , m_parsingFinished(false)\n , m_firstDataChunkReceived(false)\n , m_streamingSuppressed(false)\n{\n}\n\nvoid ScriptStreamer::notifyFinishedToClient()\n{\n ASSERT(isMainThread());\n \/\/ Usually, the loading will be finished first, and V8 will still need some\n \/\/ time to catch up. But the other way is possible too: if V8 detects a\n \/\/ parse error, the V8 side can complete before loading has finished. Send\n \/\/ the notification after both loading and V8 side operations have\n \/\/ completed. Here we also check that we have a client: it can happen that a\n \/\/ function calling notifyFinishedToClient was already scheduled in the task\n \/\/ queue and the upper layer decided that it's not interested in the script\n \/\/ and called removeClient.\n if (isFinished() && m_client)\n m_client->notifyFinished(m_resource);\n}\n\n} \/\/ namespace blink\n<commit_msg>Script streaming fix: don't ref() ScriptStreamer too early.<commit_after>\/\/ Copyright 2014 The Chromium Authors. All rights reserved.\n\/\/ Use of this source code is governed by a BSD-style license that can be\n\/\/ found in the LICENSE file.\n\n#include \"config.h\"\n#include \"bindings\/core\/v8\/ScriptStreamer.h\"\n\n#include \"bindings\/core\/v8\/ScriptStreamerThread.h\"\n#include \"bindings\/core\/v8\/V8ScriptRunner.h\"\n#include \"core\/dom\/Document.h\"\n#include \"core\/dom\/Element.h\"\n#include \"core\/dom\/PendingScript.h\"\n#include \"core\/fetch\/ScriptResource.h\"\n#include \"core\/frame\/Settings.h\"\n#include \"platform\/SharedBuffer.h\"\n#include \"wtf\/MainThread.h\"\n#include \"wtf\/text\/TextEncodingRegistry.h\"\n\nnamespace blink {\n\n\/\/ For passing data between the main thread (producer) and the streamer thread\n\/\/ (consumer). The main thread prepares the data (copies it from Resource) and\n\/\/ the streamer thread feeds it to V8.\nclass SourceStreamDataQueue {\n WTF_MAKE_NONCOPYABLE(SourceStreamDataQueue);\npublic:\n SourceStreamDataQueue()\n : m_finished(false) { }\n\n ~SourceStreamDataQueue()\n {\n while (!m_data.isEmpty()) {\n std::pair<const uint8_t*, size_t> next_data = m_data.takeFirst();\n delete[] next_data.first;\n }\n }\n\n void produce(const uint8_t* data, size_t length)\n {\n MutexLocker locker(m_mutex);\n m_data.append(std::make_pair(data, length));\n m_haveData.signal();\n }\n\n void finish()\n {\n MutexLocker locker(m_mutex);\n m_finished = true;\n m_haveData.signal();\n }\n\n void consume(const uint8_t** data, size_t* length)\n {\n MutexLocker locker(m_mutex);\n while (!tryGetData(data, length))\n m_haveData.wait(m_mutex);\n }\n\nprivate:\n bool tryGetData(const uint8_t** data, size_t* length)\n {\n if (!m_data.isEmpty()) {\n std::pair<const uint8_t*, size_t> next_data = m_data.takeFirst();\n *data = next_data.first;\n *length = next_data.second;\n return true;\n }\n if (m_finished) {\n *length = 0;\n return true;\n }\n return false;\n }\n\n WTF::Deque<std::pair<const uint8_t*, size_t> > m_data;\n bool m_finished;\n Mutex m_mutex;\n ThreadCondition m_haveData;\n};\n\n\n\/\/ SourceStream implements the streaming interface towards V8. The main\n\/\/ functionality is preparing the data to give to V8 on main thread, and\n\/\/ actually giving the data (via GetMoreData which is called on a background\n\/\/ thread).\nclass SourceStream : public v8::ScriptCompiler::ExternalSourceStream {\n WTF_MAKE_NONCOPYABLE(SourceStream);\npublic:\n SourceStream(ScriptStreamer* streamer)\n : v8::ScriptCompiler::ExternalSourceStream()\n , m_streamer(streamer)\n , m_cancelled(false)\n , m_dataPosition(0) { }\n\n virtual ~SourceStream() { }\n\n \/\/ Called by V8 on a background thread. Should block until we can return\n \/\/ some data.\n virtual size_t GetMoreData(const uint8_t** src) OVERRIDE\n {\n ASSERT(!isMainThread());\n {\n MutexLocker locker(m_mutex);\n if (m_cancelled)\n return 0;\n }\n size_t length = 0;\n \/\/ This will wait until there is data.\n m_dataQueue.consume(src, &length);\n {\n MutexLocker locker(m_mutex);\n if (m_cancelled)\n return 0;\n }\n return length;\n }\n\n void didFinishLoading()\n {\n ASSERT(isMainThread());\n m_dataQueue.finish();\n }\n\n void didReceiveData()\n {\n ASSERT(isMainThread());\n prepareDataOnMainThread();\n }\n\n void cancel()\n {\n ASSERT(isMainThread());\n \/\/ The script is no longer needed by the upper layers. Stop streaming\n \/\/ it. The next time GetMoreData is called (or woken up), it will return\n \/\/ 0, which will be interpreted as EOS by V8 and the parsing will\n \/\/ fail. ScriptStreamer::streamingComplete will be called, and at that\n \/\/ point we will release the references to SourceStream.\n {\n MutexLocker locker(m_mutex);\n m_cancelled = true;\n }\n m_dataQueue.finish();\n }\n\nprivate:\n void prepareDataOnMainThread()\n {\n ASSERT(isMainThread());\n \/\/ The Resource must still be alive; otherwise we should've cancelled\n \/\/ the streaming (if we have cancelled, the background thread is not\n \/\/ waiting).\n ASSERT(m_streamer->resource());\n\n if (m_streamer->resource()->cachedMetadata(V8ScriptRunner::tagForCodeCache())) {\n \/\/ The resource has a code cache, so it's unnecessary to stream and\n \/\/ parse the code. Cancel the streaming and resume the non-streaming\n \/\/ code path.\n m_streamer->suppressStreaming();\n {\n MutexLocker locker(m_mutex);\n m_cancelled = true;\n }\n m_dataQueue.finish();\n return;\n }\n\n if (!m_resourceBuffer) {\n \/\/ We don't have a buffer yet. Try to get it from the resource.\n SharedBuffer* buffer = m_streamer->resource()->resourceBuffer();\n if (!buffer)\n return;\n m_resourceBuffer = RefPtr<SharedBuffer>(buffer);\n }\n\n \/\/ Get as much data from the ResourceBuffer as we can.\n const char* data = 0;\n Vector<const char*> chunks;\n Vector<unsigned> chunkLengths;\n size_t dataLength = 0;\n while (unsigned length = m_resourceBuffer->getSomeData(data, m_dataPosition)) {\n \/\/ FIXME: Here we can limit based on the total length, if it turns\n \/\/ out that we don't want to give all the data we have (memory\n \/\/ vs. speed).\n chunks.append(data);\n chunkLengths.append(length);\n dataLength += length;\n m_dataPosition += length;\n }\n \/\/ Copy the data chunks into a new buffer, since we're going to give the\n \/\/ data to a background thread.\n if (dataLength > 0) {\n uint8_t* copiedData = new uint8_t[dataLength];\n unsigned offset = 0;\n for (size_t i = 0; i < chunks.size(); ++i) {\n memcpy(copiedData + offset, chunks[i], chunkLengths[i]);\n offset += chunkLengths[i];\n }\n m_dataQueue.produce(copiedData, dataLength);\n }\n }\n\n ScriptStreamer* m_streamer;\n\n \/\/ For coordinating between the main thread and background thread tasks.\n \/\/ Guarded by m_mutex.\n bool m_cancelled;\n Mutex m_mutex;\n\n unsigned m_dataPosition; \/\/ Only used by the main thread.\n RefPtr<SharedBuffer> m_resourceBuffer; \/\/ Only used by the main thread.\n SourceStreamDataQueue m_dataQueue; \/\/ Thread safe.\n};\n\nsize_t ScriptStreamer::kSmallScriptThreshold = 30 * 1024;\n\nbool ScriptStreamer::startStreaming(PendingScript& script, Settings* settings, ScriptState* scriptState)\n{\n ASSERT(isMainThread());\n if (!settings || !settings->v8ScriptStreamingEnabled())\n return false;\n ScriptResource* resource = script.resource();\n ASSERT(!resource->isLoaded());\n if (!resource->url().protocolIsInHTTPFamily())\n return false;\n if (resource->resourceToRevalidate()) {\n \/\/ This happens e.g., during reloads. We're actually not going to load\n \/\/ the current Resource of the PendingScript but switch to another\n \/\/ Resource -> don't stream.\n return false;\n }\n \/\/ We cannot filter out short scripts, even if we wait for the HTTP headers\n \/\/ to arrive. In general, the web servers don't seem to send the\n \/\/ Content-Length HTTP header for scripts.\n\n WTF::TextEncoding textEncoding(resource->encoding());\n const char* encodingName = textEncoding.name();\n\n \/\/ Here's a list of encodings we can use for streaming. These are\n \/\/ the canonical names.\n v8::ScriptCompiler::StreamedSource::Encoding encoding;\n if (strcmp(encodingName, \"windows-1252\") == 0\n || strcmp(encodingName, \"ISO-8859-1\") == 0\n || strcmp(encodingName, \"US-ASCII\") == 0) {\n encoding = v8::ScriptCompiler::StreamedSource::ONE_BYTE;\n } else if (strcmp(encodingName, \"UTF-8\") == 0) {\n encoding = v8::ScriptCompiler::StreamedSource::UTF8;\n } else {\n \/\/ We don't stream other encodings; especially we don't stream two byte\n \/\/ scripts to avoid the handling of byte order marks. Most scripts are\n \/\/ Latin1 or UTF-8 anyway, so this should be enough for most real world\n \/\/ purposes.\n return false;\n }\n\n if (scriptState->contextIsValid())\n return false;\n ScriptState::Scope scope(scriptState);\n\n \/\/ The Resource might go out of scope if the script is no longer needed. We\n \/\/ will soon call PendingScript::setStreamer, which makes the PendingScript\n \/\/ notify the ScriptStreamer when it is destroyed.\n RefPtr<ScriptStreamer> streamer = adoptRef(new ScriptStreamer(resource, encoding));\n\n \/\/ Decide what kind of cached data we should produce while streaming. By\n \/\/ default, we generate the parser cache for streamed scripts, to emulate\n \/\/ the non-streaming behavior (see V8ScriptRunner::compileScript).\n v8::ScriptCompiler::CompileOptions compileOption = v8::ScriptCompiler::kProduceParserCache;\n if (settings->v8CacheOptions() == V8CacheOptionsCode)\n compileOption = v8::ScriptCompiler::kProduceCodeCache;\n v8::ScriptCompiler::ScriptStreamingTask* scriptStreamingTask = v8::ScriptCompiler::StartStreamingScript(scriptState->isolate(), &(streamer->m_source), compileOption);\n if (scriptStreamingTask) {\n streamer->m_task = scriptStreamingTask;\n script.setStreamer(streamer.release());\n return true;\n }\n \/\/ Otherwise, V8 cannot stream the script.\n return false;\n}\n\nvoid ScriptStreamer::streamingComplete()\n{\n ASSERT(isMainThread());\n \/\/ It's possible that the corresponding Resource was deleted before V8\n \/\/ finished streaming. In that case, the data or the notification is not\n \/\/ needed. In addition, if the streaming is suppressed, the non-streaming\n \/\/ code path will resume after the resource has loaded, before the\n \/\/ background task finishes.\n if (m_detached || m_streamingSuppressed) {\n deref();\n return;\n }\n\n \/\/ We have now streamed the whole script to V8 and it has parsed the\n \/\/ script. We're ready for the next step: compiling and executing the\n \/\/ script.\n m_parsingFinished = true;\n\n notifyFinishedToClient();\n\n \/\/ The background thread no longer holds an implicit reference.\n deref();\n}\n\nvoid ScriptStreamer::cancel()\n{\n ASSERT(isMainThread());\n \/\/ The upper layer doesn't need the script any more, but streaming might\n \/\/ still be ongoing. Tell SourceStream to try to cancel it whenever it gets\n \/\/ the control the next time. It can also be that V8 has already completed\n \/\/ its operations and streamingComplete will be called soon.\n m_detached = true;\n m_resource = 0;\n m_stream->cancel();\n}\n\nvoid ScriptStreamer::suppressStreaming()\n{\n ASSERT(!m_parsingFinished);\n ASSERT(!m_loadingFinished);\n m_streamingSuppressed = true;\n}\n\nvoid ScriptStreamer::notifyAppendData(ScriptResource* resource)\n{\n ASSERT(isMainThread());\n ASSERT(m_resource == resource);\n if (m_streamingSuppressed)\n return;\n if (!m_firstDataChunkReceived) {\n m_firstDataChunkReceived = true;\n \/\/ Check the size of the first data chunk. The expectation is that if\n \/\/ the first chunk is small, there won't be a second one. In those\n \/\/ cases, it doesn't make sense to stream at all.\n if (resource->resourceBuffer()->size() < kSmallScriptThreshold) {\n suppressStreaming();\n return;\n }\n if (ScriptStreamerThread::shared()->isRunningTask()) {\n \/\/ At the moment we only have one thread for running the tasks. A\n \/\/ new task shouldn't be queued before the running task completes,\n \/\/ because the running task can block and wait for data from the\n \/\/ network. At the moment we are only streaming parser blocking\n \/\/ scripts, but this code can still be hit when multiple frames are\n \/\/ loading simultaneously.\n suppressStreaming();\n return;\n }\n ASSERT(m_task);\n \/\/ ScriptStreamer needs to stay alive as long as the background task is\n \/\/ running. This is taken care of with a manual ref() & deref() pair;\n \/\/ the corresponding deref() is in streamingComplete.\n ref();\n ScriptStreamingTask* task = new ScriptStreamingTask(m_task, this);\n ScriptStreamerThread::shared()->postTask(task);\n m_task = 0;\n }\n m_stream->didReceiveData();\n}\n\nvoid ScriptStreamer::notifyFinished(Resource* resource)\n{\n ASSERT(isMainThread());\n ASSERT(m_resource == resource);\n \/\/ A special case: empty scripts. We didn't receive any data before this\n \/\/ notification. In that case, there won't be a \"parsing complete\"\n \/\/ notification either, and we should not wait for it.\n if (!m_firstDataChunkReceived)\n suppressStreaming();\n m_stream->didFinishLoading();\n m_loadingFinished = true;\n notifyFinishedToClient();\n}\n\nScriptStreamer::ScriptStreamer(ScriptResource* resource, v8::ScriptCompiler::StreamedSource::Encoding encoding)\n : m_resource(resource)\n , m_detached(false)\n , m_stream(new SourceStream(this))\n , m_source(m_stream, encoding) \/\/ m_source takes ownership of m_stream.\n , m_client(0)\n , m_task(0)\n , m_loadingFinished(false)\n , m_parsingFinished(false)\n , m_firstDataChunkReceived(false)\n , m_streamingSuppressed(false)\n{\n}\n\nvoid ScriptStreamer::notifyFinishedToClient()\n{\n ASSERT(isMainThread());\n \/\/ Usually, the loading will be finished first, and V8 will still need some\n \/\/ time to catch up. But the other way is possible too: if V8 detects a\n \/\/ parse error, the V8 side can complete before loading has finished. Send\n \/\/ the notification after both loading and V8 side operations have\n \/\/ completed. Here we also check that we have a client: it can happen that a\n \/\/ function calling notifyFinishedToClient was already scheduled in the task\n \/\/ queue and the upper layer decided that it's not interested in the script\n \/\/ and called removeClient.\n if (isFinished() && m_client)\n m_client->notifyFinished(m_resource);\n}\n\n} \/\/ namespace blink\n<|endoftext|>"} {"text":"<commit_before>#include \"DebugDraw.h\"\r\n#include \"..\/..\/Graphics\/GraphicsManager.h\"\r\n#include \"..\/..\/Logger.h\"\r\n#include \"..\/AARect.h\"\r\n#include \"..\/Rect.h\"\r\n#include \"..\/Helpers.h\"\r\n\r\nnamespace star\r\n{\r\n\tDebugDraw * DebugDraw::m_InstancePtr = nullptr;\r\n\r\n\tDebugDraw::DebugDraw()\r\n\t\t: m_PointSize(1.0f)\r\n\t\t, m_Shader(nullptr)\r\n\t\t, m_ColorLocation(0)\r\n\t\t, m_MVPLocation(0)\r\n\t\t, m_PositionLocation(0)\r\n\t\t, m_CircleSegments(16)\r\n\t\t, m_DrawOpTriangles(0.5f)\r\n\t\t, m_DrawOpLines(1.0f)\r\n\t\t, m_DrawOpPoints(1.0f)\r\n\t{\r\n\t\t\r\n\t}\r\n\r\n\tDebugDraw* DebugDraw::GetInstance()\r\n\t{\r\n\t\tif(m_InstancePtr == nullptr)\r\n\t\t{\r\n\t\t\tm_InstancePtr = new DebugDraw();\r\n\t\t}\r\n\t\treturn m_InstancePtr;\r\n\t}\r\n\r\n\tDebugDraw::~DebugDraw()\r\n\t{\r\n\t\tdelete m_Shader;\r\n\t}\r\n\r\n\tvoid DebugDraw::SetDrawOpacityTriangles(float opacity)\r\n\t{\r\n\t\tm_DrawOpTriangles = opacity;\r\n\t}\r\n\r\n\tvoid DebugDraw::SetDrawOpacityLines(float opacity)\r\n\t{\r\n\t\tm_DrawOpLines = opacity;\r\n\t}\r\n\r\n\tvoid DebugDraw::SetDrawOpacityPoints(float opacity)\r\n\t{\r\n\t\tm_DrawOpPoints = opacity;\r\n\t}\r\n\r\n\tvoid DebugDraw::SetCircleSegements(uint32 segments)\r\n\t{\r\n\t\tm_CircleSegments = segments;\r\n\t}\r\n\r\n\tvoid DebugDraw::Initialize()\r\n\t{\r\n\t\tstatic const GLchar* vertexShader = \"\\\r\n\t\t\tuniform mat4 MVP;\\\r\n\t\t\tattribute vec2 position;\\\r\n\t\t\tvoid main() {\\\r\n\t\t\t vec4 NewPosition = vec4(position, 0.0, 1.0);\\\r\n\t\t\t NewPosition *= MVP;\\\r\n\t\t\t gl_Position = NewPosition;\\\r\n\t\t\t}\\\r\n\t\t\t\";\r\n\r\n\t\tstatic const GLchar* fragmentShader = \"\\\r\n\t\t\tprecision mediump float; \\\r\n\t\t\tuniform vec4 color;\\\r\n\t\t\tvoid main() { \\\r\n\t\t\t gl_FragColor = color; \\\r\n\t\t\t} \\\r\n\t\t\t\";\r\n\r\n\t\t\/\/ create program\r\n\t\tm_Shader = new Shader();\r\n\t\tm_Shader->Init(vertexShader, fragmentShader);\r\n\r\n\t\tm_ColorLocation = m_Shader->GetUniformLocation(\"color\");\r\n\t\tm_MVPLocation = m_Shader->GetUniformLocation(\"MVP\");\r\n\t\tm_PositionLocation = m_Shader->GetAttribLocation(\"position\");\r\n\t}\r\n\r\n\tvoid DebugDraw::DrawPolygon(const vec2* vertices, int32 vertexCount, const Color& color)\r\n\t{\r\n\t\tCreatePolygonVertices(vertices, vertexCount);\r\n\t\tDrawPrimitives(Lines, vertexCount, color);\r\n\t}\r\n\r\n\tvoid DebugDraw::DrawSolidPolygon(const vec2* vertices, int32 vertexCount, const Color& color)\r\n\t{\r\n\t\tCreatePolygonVertices(vertices, vertexCount);\r\n\t\tDrawPrimitives(Triangles + Lines, vertexCount, color);\r\n\t}\r\n\r\n\tvoid DebugDraw::DrawCircle(const vec2& center, float radius, const Color& color)\r\n\t{\r\n\t\tCreateCircleVertices(center, radius);\r\n\t\tDrawPrimitives(Lines, m_CircleSegments, color);\r\n\t}\r\n\r\n\tvoid DebugDraw::DrawSolidCircle(const vec2& center, float radius,\r\n\t\t\tconst Color& color)\r\n\t{\r\n\t\tCreateCircleVertices(center, radius);\r\n\t\tDrawPrimitives(Triangles + Lines, m_CircleSegments, color);\r\n\t}\r\n\r\n\tvoid DebugDraw::DrawSegment(const vec2& pos1, const vec2& pos2, const Color& color)\r\n\t{\r\n\t\tm_Vertices[0].x = pos1.x;\r\n\t\tm_Vertices[0].x = pos1.y;\r\n\t\tm_Vertices[1].y = pos2.x;\r\n\t\tm_Vertices[1].y = pos2.y;\r\n\t\tDrawPrimitives(Lines, 2, color);\r\n\t}\r\n\r\n\tvoid DebugDraw::DrawPoint(const vec2& pos, float size, const Color& color)\r\n\t{\r\n\t\tm_PointSize = size;\r\n\r\n\t\tm_Vertices[0].x = pos.x;\r\n\t\tm_Vertices[0].y = pos.y;\r\n\t\tDrawPrimitives(Points, 1, color);\r\n\t}\r\n\r\n\tvoid DebugDraw::DrawLine(const vec2& pos1, const vec2& pos2, const Color& color)\r\n\t{\r\n\t\tm_Vertices[0].x = pos1.x;\r\n\t\tm_Vertices[0].y = pos1.y;\r\n\t\tm_Vertices[1].x = pos2.x;\r\n\t\tm_Vertices[1].y = pos2.y;\r\n\t\tDrawPrimitives(Lines,2,color);\r\n\t}\r\n\r\n\tvoid DebugDraw::DrawString(int aX, int aY, const tstring& text)\r\n\t{\r\n\t\t\/\/[TODO] Implement this through the font manager, draw text on screen on given pos.\r\n\t\tLogger::GetInstance()->Log(LogLevel::Warning, _T(\"DebugDraw::DrawString is not yet implemented!\"));\r\n\t}\r\n\r\n\tvoid DebugDraw::DrawRect(const AARect& rect, const Color& color)\r\n\t{\r\n\t\tm_Vertices[0].x = float(rect.GetLeft());\r\n\t\tm_Vertices[0].y = float(rect.GetBottom());\r\n\t\tm_Vertices[1].x = float(rect.GetRight());\r\n\t\tm_Vertices[1].y = float(rect.GetBottom());\r\n\t\tm_Vertices[2].x = float(rect.GetRight());\r\n\t\tm_Vertices[2].y = float(rect.GetTop());\r\n\t\tm_Vertices[3].x = float(rect.GetLeft());\r\n\t\tm_Vertices[3].y = float(rect.GetTop());\r\n\t\tDrawPrimitives(Lines, 4, color);\r\n\t}\r\n\r\n\tvoid DebugDraw::DrawRect(const Rect& rect, const Color& color)\r\n\t{\r\n\t\tm_Vertices[0] = rect.GetLeftBottom();\r\n\t\tm_Vertices[1] = rect.GetRightBottom();\r\n\t\tm_Vertices[2] = rect.GetRightTop();\r\n\t\tm_Vertices[3] = rect.GetLeftTop();\r\n\t\tDrawPrimitives(Lines, 4, color);\r\n\t}\r\n\r\n\tvoid DebugDraw::DrawSolidRect(const AARect& rect, const Color& color)\r\n\t{\r\n\t\tm_Vertices[0].x = float(rect.GetLeft());\r\n\t\tm_Vertices[0].y = float(rect.GetBottom());\r\n\t\tm_Vertices[1].x = float(rect.GetRight());\r\n\t\tm_Vertices[1].y = float(rect.GetBottom());\r\n\t\tm_Vertices[2].x = float(rect.GetRight());\r\n\t\tm_Vertices[2].y = float(rect.GetTop());\r\n\t\tm_Vertices[3].x = float(rect.GetLeft()); \r\n\t\tm_Vertices[3].y = float(rect.GetTop());\r\n\t\tDrawPrimitives(Triangles + Lines, 4, color);\r\n\t}\r\n\r\n\tvoid DebugDraw::DrawSolidRect(const Rect& rect, const Color& color)\r\n\t{\r\n\t\tm_Vertices[0] = rect.GetLeftBottom();\r\n\t\tm_Vertices[1] = rect.GetRightBottom();\r\n\t\tm_Vertices[2] = rect.GetRightTop();\r\n\t\tm_Vertices[3] = rect.GetLeftTop();\r\n\t\tDrawPrimitives(Triangles + Lines, 4, color);\r\n\t}\r\n\r\n\tvoid DebugDraw::CreatePolygonVertices(const vec2* vertices, uint32 vertexCount)\r\n\t{\r\n\t\tASSERT(vertexCount <= MAX_VERTICES, _T(\"more vertices than allocated space\"));\r\n\t\t\/\/ASSERT(vertexCount <= MAX_VERTICES, _T(\"more vertices then allocated space\"));\r\n\r\n\t\tfor (uint32 i = 0; i < vertexCount; i++)\r\n\t\t{\r\n\t\t\tm_Vertices[i].x = vertices[i].x;\r\n\t\t\tm_Vertices[i].y = vertices[i].y;\r\n\t\t}\r\n\t}\r\n\r\n\tvoid DebugDraw::CreateCircleVertices(const vec2& center, float radius)\r\n\t{\r\n\t\t\/\/ [TODO] Fix this bug in eclipse: (undefined reference to 'star::DebugDraw::MAX_VERTICES')\r\n\t\t\/\/ASSERT(m_CircleSegments < MAX_VERTICES, tstring(_T(\"You can only draw \") \r\n\t\t\/\/\t+ string_cast<tstring>(MAX_VERTICES) + _T(\" vertices per primitive\")).c_str());\r\n\t\tconst float increment = float(2.0 * PI \/ m_CircleSegments);\r\n\t\tfloat theta = 0.0f;\r\n\r\n\t\tfor (uint32 i = 0; i < m_CircleSegments; ++i)\r\n\t\t{\r\n\t\t\tvec2 v = center + radius * vec2(glm::cos(theta), glm::sin(theta));\r\n\r\n\t\t\tm_Vertices[i].x = v.x;\r\n\t\t\tm_Vertices[i].y = v.y;\r\n\t\t\ttheta += increment;\r\n\t\t}\r\n\t}\r\n\r\n\tvoid DebugDraw::DrawPrimitives(uint32 primitiveTypes, uint32 count, const Color& color)\r\n\t{\r\n#ifdef DESKTOP\r\n\t\tglUseProgram(m_Shader->GetID());\r\n\r\n\t\tglUniformMatrix4fv(m_MVPLocation,\r\n\t\t\t\t1, GL_FALSE, glm::value_ptr(GraphicsManager::GetInstance()->GetViewProjectionMatrix()));\r\n\r\n\t\tglEnableVertexAttribArray(m_PositionLocation);\r\n\t\tglVertexAttribPointer(m_PositionLocation, 2, GL_FLOAT, GL_FALSE, 0, (GLfloat*) m_Vertices);\r\n\r\n\t\tif (primitiveTypes & Triangles)\r\n\t\t{\r\n\t\t\tglUniform4f(m_ColorLocation, color.r, color.g, color.b, m_DrawOpTriangles);\r\n\t\t\tglDrawArrays(GL_TRIANGLE_FAN, 0, count);\r\n\t\t}\r\n\r\n\t\tif (primitiveTypes & Lines)\r\n\t\t{\r\n\t\t\tglUniform4f(m_ColorLocation, color.r, color.g, color.b, m_DrawOpLines);\r\n\t\t\tglDrawArrays(GL_LINE_LOOP, 0, count);\r\n\t\t}\r\n\r\n\t\tif (primitiveTypes & Points)\r\n\t\t{\r\n\t\t\tglUniform4f(m_ColorLocation, color.r, color.g, color.b, m_DrawOpPoints);\r\n\t\t\t\/\/[TODO] only works for windows..\r\n#ifdef DESKTOP\r\n\t\t\tglPointSize(m_PointSize);\r\n#endif\r\n\t\t\tglDrawArrays(GL_POINTS, 0, count);\r\n\t\t}\r\n\r\n\t\tglDisableVertexAttribArray(m_PositionLocation);\r\n\t\tglUseProgram(0);\r\n#endif\r\n\t}\r\n\r\n}\r\n<commit_msg>Debug drawing functions also get correctly scaled now.<commit_after>#include \"DebugDraw.h\"\r\n#include \"..\/..\/Graphics\/GraphicsManager.h\"\r\n#include \"..\/..\/Graphics\/ScaleSystem.h\"\r\n#include \"..\/..\/Logger.h\"\r\n#include \"..\/AARect.h\"\r\n#include \"..\/Rect.h\"\r\n#include \"..\/Helpers.h\"\r\n\r\nnamespace star\r\n{\r\n\tDebugDraw * DebugDraw::m_InstancePtr = nullptr;\r\n\r\n\tDebugDraw::DebugDraw()\r\n\t\t: m_PointSize(1.0f)\r\n\t\t, m_Shader(nullptr)\r\n\t\t, m_ColorLocation(0)\r\n\t\t, m_MVPLocation(0)\r\n\t\t, m_PositionLocation(0)\r\n\t\t, m_CircleSegments(16)\r\n\t\t, m_DrawOpTriangles(0.5f)\r\n\t\t, m_DrawOpLines(1.0f)\r\n\t\t, m_DrawOpPoints(1.0f)\r\n\t{\r\n\t\t\r\n\t}\r\n\r\n\tDebugDraw* DebugDraw::GetInstance()\r\n\t{\r\n\t\tif(m_InstancePtr == nullptr)\r\n\t\t{\r\n\t\t\tm_InstancePtr = new DebugDraw();\r\n\t\t}\r\n\t\treturn m_InstancePtr;\r\n\t}\r\n\r\n\tDebugDraw::~DebugDraw()\r\n\t{\r\n\t\tdelete m_Shader;\r\n\t}\r\n\r\n\tvoid DebugDraw::SetDrawOpacityTriangles(float opacity)\r\n\t{\r\n\t\tm_DrawOpTriangles = opacity;\r\n\t}\r\n\r\n\tvoid DebugDraw::SetDrawOpacityLines(float opacity)\r\n\t{\r\n\t\tm_DrawOpLines = opacity;\r\n\t}\r\n\r\n\tvoid DebugDraw::SetDrawOpacityPoints(float opacity)\r\n\t{\r\n\t\tm_DrawOpPoints = opacity;\r\n\t}\r\n\r\n\tvoid DebugDraw::SetCircleSegements(uint32 segments)\r\n\t{\r\n\t\tm_CircleSegments = segments;\r\n\t}\r\n\r\n\tvoid DebugDraw::Initialize()\r\n\t{\r\n\t\tstatic const GLchar* vertexShader = \"\\\r\n\t\t\tuniform mat4 MVP;\\\r\n\t\t\tattribute vec2 position;\\\r\n\t\t\tvoid main() {\\\r\n\t\t\t vec4 NewPosition = vec4(position, 0.0, 1.0);\\\r\n\t\t\t NewPosition *= MVP;\\\r\n\t\t\t gl_Position = NewPosition;\\\r\n\t\t\t}\\\r\n\t\t\t\";\r\n\r\n\t\tstatic const GLchar* fragmentShader = \"\\\r\n\t\t\tprecision mediump float; \\\r\n\t\t\tuniform vec4 color;\\\r\n\t\t\tvoid main() { \\\r\n\t\t\t gl_FragColor = color; \\\r\n\t\t\t} \\\r\n\t\t\t\";\r\n\r\n\t\t\/\/ create program\r\n\t\tm_Shader = new Shader();\r\n\t\tm_Shader->Init(vertexShader, fragmentShader);\r\n\r\n\t\tm_ColorLocation = m_Shader->GetUniformLocation(\"color\");\r\n\t\tm_MVPLocation = m_Shader->GetUniformLocation(\"MVP\");\r\n\t\tm_PositionLocation = m_Shader->GetAttribLocation(\"position\");\r\n\t}\r\n\r\n\tvoid DebugDraw::DrawPolygon(const vec2* vertices, int32 vertexCount, const Color& color)\r\n\t{\r\n\t\tCreatePolygonVertices(vertices, vertexCount);\r\n\t\tDrawPrimitives(Lines, vertexCount, color);\r\n\t}\r\n\r\n\tvoid DebugDraw::DrawSolidPolygon(const vec2* vertices, int32 vertexCount, const Color& color)\r\n\t{\r\n\t\tCreatePolygonVertices(vertices, vertexCount);\r\n\t\tDrawPrimitives(Triangles + Lines, vertexCount, color);\r\n\t}\r\n\r\n\tvoid DebugDraw::DrawCircle(const vec2& center, float radius, const Color& color)\r\n\t{\r\n\t\tCreateCircleVertices(center, radius);\r\n\t\tDrawPrimitives(Lines, m_CircleSegments, color);\r\n\t}\r\n\r\n\tvoid DebugDraw::DrawSolidCircle(const vec2& center, float radius,\r\n\t\t\tconst Color& color)\r\n\t{\r\n\t\tCreateCircleVertices(center, radius);\r\n\t\tDrawPrimitives(Triangles + Lines, m_CircleSegments, color);\r\n\t}\r\n\r\n\tvoid DebugDraw::DrawSegment(const vec2& pos1, const vec2& pos2, const Color& color)\r\n\t{\r\n\t\tm_Vertices[0].x = pos1.x;\r\n\t\tm_Vertices[0].x = pos1.y;\r\n\t\tm_Vertices[1].y = pos2.x;\r\n\t\tm_Vertices[1].y = pos2.y;\r\n\t\tDrawPrimitives(Lines, 2, color);\r\n\t}\r\n\r\n\tvoid DebugDraw::DrawPoint(const vec2& pos, float size, const Color& color)\r\n\t{\r\n\t\tm_PointSize = size;\r\n\r\n\t\tm_Vertices[0].x = pos.x;\r\n\t\tm_Vertices[0].y = pos.y;\r\n\t\tDrawPrimitives(Points, 1, color);\r\n\t}\r\n\r\n\tvoid DebugDraw::DrawLine(const vec2& pos1, const vec2& pos2, const Color& color)\r\n\t{\r\n\t\tm_Vertices[0].x = pos1.x;\r\n\t\tm_Vertices[0].y = pos1.y;\r\n\t\tm_Vertices[1].x = pos2.x;\r\n\t\tm_Vertices[1].y = pos2.y;\r\n\t\tDrawPrimitives(Lines,2,color);\r\n\t}\r\n\r\n\tvoid DebugDraw::DrawString(int aX, int aY, const tstring& text)\r\n\t{\r\n\t\t\/\/[TODO] Implement this through the font manager, draw text on screen on given pos.\r\n\t\tLogger::GetInstance()->Log(LogLevel::Warning, _T(\"DebugDraw::DrawString is not yet implemented!\"));\r\n\t}\r\n\r\n\tvoid DebugDraw::DrawRect(const AARect& rect, const Color& color)\r\n\t{\r\n\t\tm_Vertices[0].x = float(rect.GetLeft());\r\n\t\tm_Vertices[0].y = float(rect.GetBottom());\r\n\t\tm_Vertices[1].x = float(rect.GetRight());\r\n\t\tm_Vertices[1].y = float(rect.GetBottom());\r\n\t\tm_Vertices[2].x = float(rect.GetRight());\r\n\t\tm_Vertices[2].y = float(rect.GetTop());\r\n\t\tm_Vertices[3].x = float(rect.GetLeft());\r\n\t\tm_Vertices[3].y = float(rect.GetTop());\r\n\t\tDrawPrimitives(Lines, 4, color);\r\n\t}\r\n\r\n\tvoid DebugDraw::DrawRect(const Rect& rect, const Color& color)\r\n\t{\r\n\t\tm_Vertices[0] = rect.GetLeftBottom();\r\n\t\tm_Vertices[1] = rect.GetRightBottom();\r\n\t\tm_Vertices[2] = rect.GetRightTop();\r\n\t\tm_Vertices[3] = rect.GetLeftTop();\r\n\t\tDrawPrimitives(Lines, 4, color);\r\n\t}\r\n\r\n\tvoid DebugDraw::DrawSolidRect(const AARect& rect, const Color& color)\r\n\t{\r\n\t\tm_Vertices[0].x = float(rect.GetLeft());\r\n\t\tm_Vertices[0].y = float(rect.GetBottom());\r\n\t\tm_Vertices[1].x = float(rect.GetRight());\r\n\t\tm_Vertices[1].y = float(rect.GetBottom());\r\n\t\tm_Vertices[2].x = float(rect.GetRight());\r\n\t\tm_Vertices[2].y = float(rect.GetTop());\r\n\t\tm_Vertices[3].x = float(rect.GetLeft()); \r\n\t\tm_Vertices[3].y = float(rect.GetTop());\r\n\t\tDrawPrimitives(Triangles + Lines, 4, color);\r\n\t}\r\n\r\n\tvoid DebugDraw::DrawSolidRect(const Rect& rect, const Color& color)\r\n\t{\r\n\t\tm_Vertices[0] = rect.GetLeftBottom();\r\n\t\tm_Vertices[1] = rect.GetRightBottom();\r\n\t\tm_Vertices[2] = rect.GetRightTop();\r\n\t\tm_Vertices[3] = rect.GetLeftTop();\r\n\t\tDrawPrimitives(Triangles + Lines, 4, color);\r\n\t}\r\n\r\n\tvoid DebugDraw::CreatePolygonVertices(const vec2* vertices, uint32 vertexCount)\r\n\t{\r\n\t\tASSERT(vertexCount <= MAX_VERTICES, _T(\"more vertices than allocated space\"));\r\n\t\t\/\/ASSERT(vertexCount <= MAX_VERTICES, _T(\"more vertices then allocated space\"));\r\n\r\n\t\tfor (uint32 i = 0; i < vertexCount; i++)\r\n\t\t{\r\n\t\t\tm_Vertices[i].x = vertices[i].x;\r\n\t\t\tm_Vertices[i].y = vertices[i].y;\r\n\t\t}\r\n\t}\r\n\r\n\tvoid DebugDraw::CreateCircleVertices(const vec2& center, float radius)\r\n\t{\r\n\t\t\/\/ [TODO] Fix this bug in eclipse: (undefined reference to 'star::DebugDraw::MAX_VERTICES')\r\n\t\t\/\/ASSERT(m_CircleSegments < MAX_VERTICES, tstring(_T(\"You can only draw \") \r\n\t\t\/\/\t+ string_cast<tstring>(MAX_VERTICES) + _T(\" vertices per primitive\")).c_str());\r\n\t\tconst float increment = float(2.0 * PI \/ m_CircleSegments);\r\n\t\tfloat theta = 0.0f;\r\n\r\n\t\tfor (uint32 i = 0; i < m_CircleSegments; ++i)\r\n\t\t{\r\n\t\t\tvec2 v = center + radius * vec2(glm::cos(theta), glm::sin(theta));\r\n\r\n\t\t\tm_Vertices[i].x = v.x;\r\n\t\t\tm_Vertices[i].y = v.y;\r\n\t\t\ttheta += increment;\r\n\t\t}\r\n\t}\r\n\r\n\tvoid DebugDraw::DrawPrimitives(uint32 primitiveTypes, uint32 count, const Color& color)\r\n\t{\r\n#ifdef DESKTOP\r\n\t\tglUseProgram(m_Shader->GetID());\r\n\t\t\r\n\t\tfloat scaleValue = ScaleSystem::GetInstance()->GetScale();\r\n\t\tmat4x4 scaleMat = glm::scale<float>(scaleValue, scaleValue, 1.0f);\r\n\r\n\t\tglUniformMatrix4fv(m_MVPLocation,\r\n\t\t\t1, GL_FALSE,\r\n\t\t\tglm::value_ptr(\r\n\t\t\t\tscaleMat *\r\n\t\t\t\tGraphicsManager::GetInstance()->GetViewProjectionMatrix()\r\n\t\t\t)\r\n\t\t);\r\n\r\n\t\tglEnableVertexAttribArray(m_PositionLocation);\r\n\t\tglVertexAttribPointer(m_PositionLocation, 2, GL_FLOAT, GL_FALSE, 0, (GLfloat*) m_Vertices);\r\n\r\n\t\tif (primitiveTypes & Triangles)\r\n\t\t{\r\n\t\t\tglUniform4f(m_ColorLocation, color.r, color.g, color.b, m_DrawOpTriangles);\r\n\t\t\tglDrawArrays(GL_TRIANGLE_FAN, 0, count);\r\n\t\t}\r\n\r\n\t\tif (primitiveTypes & Lines)\r\n\t\t{\r\n\t\t\tglUniform4f(m_ColorLocation, color.r, color.g, color.b, m_DrawOpLines);\r\n\t\t\tglDrawArrays(GL_LINE_LOOP, 0, count);\r\n\t\t}\r\n\r\n\t\tif (primitiveTypes & Points)\r\n\t\t{\r\n\t\t\tglUniform4f(m_ColorLocation, color.r, color.g, color.b, m_DrawOpPoints);\r\n\t\t\t\/\/[TODO] only works for windows..\r\n#ifdef DESKTOP\r\n\t\t\tglPointSize(m_PointSize);\r\n#endif\r\n\t\t\tglDrawArrays(GL_POINTS, 0, count);\r\n\t\t}\r\n\r\n\t\tglDisableVertexAttribArray(m_PositionLocation);\r\n\t\tglUseProgram(0);\r\n#endif\r\n\t}\r\n\r\n}\r\n<|endoftext|>"} {"text":"<commit_before>\n\n#include \"mfem.hpp\"\n#include \"integ_algoim.hpp\"\n\n\nusing namespace mfem;\n\n\/\/level set function for sphere in 3D and circle in 2D\ndouble sphere_ls(const Vector &x)\n{\n double r2= x*x;\n return sqrt(r2)-0.5;\/\/the radius is 0.5\n}\n\n\nint main(int argc, char *argv[])\n{\n \/\/ Parse command-line options\n const char *mesh_file = \"..\/..\/data\/beam-tet.mesh\";\n int ser_ref_levels = 1;\n int order = 2;\n bool visualization = true;\n int newton_iter = 10;\n int print_level = 0;\n\n\n OptionsParser args(argc, argv);\n args.AddOption(&mesh_file, \"-m\", \"--mesh\", \"Mesh file to use.\");\n args.AddOption(&ser_ref_levels,\n \"-rs\",\n \"--refine-serial\",\n \"Number of times to refine the mesh uniformly in serial.\");\n args.AddOption(&order,\n \"-o\",\n \"--order\",\n \"Order (degree) of the finite elements.\");\n args.AddOption(&visualization,\n \"-vis\",\n \"--visualization\",\n \"-no-vis\",\n \"--no-visualization\",\n \"Enable or disable GLVis visualization.\");\n args.AddOption((&print_level), \"-prt\", \"--print-level\", \"Print level.\");\n args.Parse();\n if (!args.Good())\n {\n args.PrintUsage(std::cout);\n return 1;\n }\n args.PrintOptions(std::cout);\n\n \/\/ Read the (serial) mesh from the given mesh file.\n Mesh *mesh = new Mesh(mesh_file, 1, 1);\n int dim = mesh->Dimension();\n \/\/ Refine the mesh in serial to increase the resolution. In this example\n \/\/ we do 'ser_ref_levels' of uniform refinement, where 'ser_ref_levels' is\n \/\/ a command-line parameter.\n for (int lev = 0; lev < ser_ref_levels; lev++)\n {\n mesh->UniformRefinement();\n }\n\n\n \/\/ Define the finite element spaces for the solution\n H1_FECollection fec(order, dim);\n FiniteElementSpace fespace(mesh, &fec, 1, Ordering::byVDIM);\n int glob_size = fespace.GetTrueVSize();\n std::cout << \"Number of finite element unknowns: \" << glob_size << std::endl;\n\n \/\/ Define the level set grid function\n GridFunction x(&fespace);\n Vector lsvec; \/\/true levelset vector\n\n\n \/\/ Define the level set coefficient\n Coefficient *ls_coeff = nullptr;\n ls_coeff=new FunctionCoefficient(sphere_ls);\n \/\/ Project the coefficient onto the LS grid function\n x.ProjectCoefficient(*ls_coeff);\n \/\/ Extract the true vector from the grid function\n x.GetTrueDofs(lsvec);\n\n Vector lsfun; \/\/level set function restricted to an element\n DofTransformation *doftrans;\n ElementTransformation *trans;\n Array<int> vdofs;\n AlgoimIntegrationRule *air;\n\n DenseMatrix bmat; \/\/gradients of the shape functions in isoparametric space\n DenseMatrix pmat; \/\/gradients of the shape functions in physical space\n Vector inormal; \/\/normal to the level set in isoparametric space\n Vector tnormal; \/\/normal to the level set in physical space\n double w;\n const IntegrationRule* ir=nullptr;\n\n \/\/ loop over the elements\n double vol=0.0;\n double area=0.0;\n\n#ifdef MFEM_USE_ALGOIM\n const int num_gauss_points=4;\n for(int i=0;i<fespace.GetNE();i++)\n {\n const FiniteElement* el=fespace.GetFE(i);\n \/\/get the element transformation\n trans = fespace.GetElementTransformation(i);\n\n \/\/extract the element vector from the level-set\n doftrans = fespace.GetElementVDofs(i,vdofs);\n lsvec.GetSubVector(vdofs, lsfun);\n\n \/\/contruct Algoim integration object\n AlgoimIntegrationRule* air=new AlgoimIntegrationRule(num_gauss_points,*el,*trans,lsfun);\n\n \/\/compute the volume contribution from the element\n ir=air->GetVolumeIntegrationRule();\n for (int i = 0; i < ir->GetNPoints(); i++)\n {\n const IntegrationPoint &ip = ir->IntPoint(i);\n trans->SetIntPoint(&ip);\n w = trans->Weight();\n w = ip.weight * w;\n vol=vol+w;\n }\n\n \/\/compute the perimeter\/area contribution from the element\n bmat.SetSize(el->GetDof(),el->GetDim());\n pmat.SetSize(el->GetDof(),el->GetDim());\n inormal.SetSize(el->GetDim());\n tnormal.SetSize(el->GetDim());\n\n ir=air->GetSurfaceIntegrationRule();\n for (int i = 0; i < ir->GetNPoints(); i++)\n {\n const IntegrationPoint &ip = ir->IntPoint(i);\n trans->SetIntPoint(&ip);\n\n el->CalcDShape(ip,bmat);\n Mult(bmat, trans->AdjugateJacobian(), pmat);\n \/\/compute the normal to the LS in isoparametric space\n bmat.MultTranspose(lsfun,inormal);\n \/\/compute the normal to the LS in physicsl space\n pmat.MultTranspose(lsfun,tnormal);\n w = ip.weight*tnormal.Norml2()\/inormal.Norml2();\n area=area+w;\n }\n\n \/\/delete the Algoim integration rule object\n \/\/the integration rules are constructed for the\n \/\/particular element and level set\n delete air;\n }\n#endif\n std::cout<<\"Volume=\"<<vol<<std::endl;\n std::cout<<\"Area=\"<<area<<std::endl;\n\n\n ParaViewDataCollection dacol(\"ParaViewDistance\", mesh);\n dacol.SetLevelsOfDetail(order);\n dacol.RegisterField(\"dist\",&x);\n dacol.SetTime(1.0);\n dacol.SetCycle(1);\n dacol.Save();\n\n\n delete ls_coeff;\n delete mesh;\n\n return 0;\n}\n<commit_msg>modified the input mesh<commit_after>\n\n#include \"mfem.hpp\"\n#include \"integ_algoim.hpp\"\n\n\nusing namespace mfem;\n\n\/\/level set function for sphere in 3D and circle in 2D\ndouble sphere_ls(const Vector &x)\n{\n double r2= x*x;\n return -sqrt(r2)+0.5;\/\/the radius is 0.5\n}\n\n\nint main(int argc, char *argv[])\n{\n \/\/ Parse command-line options\n const char *mesh_file = \"..\/..\/data\/star-q3.mesh\";\n int ser_ref_levels = 1;\n int order = 2;\n bool visualization = true;\n int newton_iter = 10;\n int print_level = 0;\n\n\n OptionsParser args(argc, argv);\n args.AddOption(&mesh_file, \"-m\", \"--mesh\", \"Mesh file to use.\");\n args.AddOption(&ser_ref_levels,\n \"-rs\",\n \"--refine-serial\",\n \"Number of times to refine the mesh uniformly in serial.\");\n args.AddOption(&order,\n \"-o\",\n \"--order\",\n \"Order (degree) of the finite elements.\");\n args.AddOption(&visualization,\n \"-vis\",\n \"--visualization\",\n \"-no-vis\",\n \"--no-visualization\",\n \"Enable or disable GLVis visualization.\");\n args.AddOption((&print_level), \"-prt\", \"--print-level\", \"Print level.\");\n args.Parse();\n if (!args.Good())\n {\n args.PrintUsage(std::cout);\n return 1;\n }\n args.PrintOptions(std::cout);\n\n \/\/ Read the (serial) mesh from the given mesh file.\n Mesh *mesh = new Mesh(mesh_file, 1, 1);\n int dim = mesh->Dimension();\n \/\/ Refine the mesh in serial to increase the resolution. In this example\n \/\/ we do 'ser_ref_levels' of uniform refinement, where 'ser_ref_levels' is\n \/\/ a command-line parameter.\n for (int lev = 0; lev < ser_ref_levels; lev++)\n {\n mesh->UniformRefinement();\n }\n\n\n \/\/ Define the finite element spaces for the solution\n H1_FECollection fec(order, dim);\n FiniteElementSpace fespace(mesh, &fec, 1, Ordering::byVDIM);\n int glob_size = fespace.GetTrueVSize();\n std::cout << \"Number of finite element unknowns: \" << glob_size << std::endl;\n\n \/\/ Define the level set grid function\n GridFunction x(&fespace);\n Vector lsvec; \/\/true levelset vector\n\n\n \/\/ Define the level set coefficient\n Coefficient *ls_coeff = nullptr;\n ls_coeff=new FunctionCoefficient(sphere_ls);\n \/\/ Project the coefficient onto the LS grid function\n x.ProjectCoefficient(*ls_coeff);\n \/\/ Extract the true vector from the grid function\n x.GetTrueDofs(lsvec);\n\n Vector lsfun; \/\/level set function restricted to an element\n DofTransformation *doftrans;\n ElementTransformation *trans;\n Array<int> vdofs;\n AlgoimIntegrationRule *air;\n\n DenseMatrix bmat; \/\/gradients of the shape functions in isoparametric space\n DenseMatrix pmat; \/\/gradients of the shape functions in physical space\n Vector inormal; \/\/normal to the level set in isoparametric space\n Vector tnormal; \/\/normal to the level set in physical space\n double w;\n const IntegrationRule* ir=nullptr;\n\n \/\/ loop over the elements\n double vol=0.0;\n double area=0.0;\n\n#ifdef MFEM_USE_ALGOIM\n const int num_gauss_points=4;\n for(int i=0;i<fespace.GetNE();i++)\n {\n const FiniteElement* el=fespace.GetFE(i);\n \/\/get the element transformation\n trans = fespace.GetElementTransformation(i);\n\n \/\/extract the element vector from the level-set\n doftrans = fespace.GetElementVDofs(i,vdofs);\n lsvec.GetSubVector(vdofs, lsfun);\n\n \/\/contruct Algoim integration object\n AlgoimIntegrationRule* air=new AlgoimIntegrationRule(num_gauss_points,*el,*trans,lsfun);\n\n \/\/compute the volume contribution from the element\n ir=air->GetVolumeIntegrationRule();\n for (int i = 0; i < ir->GetNPoints(); i++)\n {\n const IntegrationPoint &ip = ir->IntPoint(i);\n trans->SetIntPoint(&ip);\n w = trans->Weight();\n w = ip.weight * w;\n vol=vol+w;\n }\n\n \/\/compute the perimeter\/area contribution from the element\n bmat.SetSize(el->GetDof(),el->GetDim());\n pmat.SetSize(el->GetDof(),el->GetDim());\n inormal.SetSize(el->GetDim());\n tnormal.SetSize(el->GetDim());\n\n ir=air->GetSurfaceIntegrationRule();\n for (int i = 0; i < ir->GetNPoints(); i++)\n {\n const IntegrationPoint &ip = ir->IntPoint(i);\n trans->SetIntPoint(&ip);\n\n el->CalcDShape(ip,bmat);\n Mult(bmat, trans->AdjugateJacobian(), pmat);\n \/\/compute the normal to the LS in isoparametric space\n bmat.MultTranspose(lsfun,inormal);\n \/\/compute the normal to the LS in physicsl space\n pmat.MultTranspose(lsfun,tnormal);\n w = ip.weight*tnormal.Norml2()\/inormal.Norml2();\n area=area+w;\n }\n\n \/\/delete the Algoim integration rule object\n \/\/the integration rules are constructed for the\n \/\/particular element and level set\n delete air;\n }\n#endif\n std::cout<<\"Volume=\"<<vol<<std::endl;\n std::cout<<\"Area=\"<<area<<std::endl;\n\n\n ParaViewDataCollection dacol(\"ParaViewDistance\", mesh);\n dacol.SetLevelsOfDetail(order);\n dacol.RegisterField(\"dist\",&x);\n dacol.SetTime(1.0);\n dacol.SetCycle(1);\n dacol.Save();\n\n\n delete ls_coeff;\n delete mesh;\n\n return 0;\n}\n<|endoftext|>"} {"text":"<commit_before>\/\/\n\/\/ Copyright (C) 2016 Clifford Wolf <clifford@clifford.at>\n\/\/\n\/\/ Permission to use, copy, modify, and\/or distribute this software for any\n\/\/ purpose with or without fee is hereby granted, provided that the above\n\/\/ copyright notice and this permission notice appear in all copies.\n\/\/\n\/\/ THE SOFTWARE IS PROVIDED \"AS IS\" AND THE AUTHOR DISCLAIMS ALL WARRANTIES\n\/\/ WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF\n\/\/ MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR\n\/\/ ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES\n\/\/ WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN\n\/\/ ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF\n\/\/ OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE.\n\/\/\n\n#include <stdio.h>\n#include <stdlib.h>\n#include <unistd.h>\n#include <string.h>\n#include <assert.h>\n#include <stdint.h>\n#include <sys\/time.h>\n\n#include <map>\n#include <vector>\n#include <string>\n#include <fstream>\n#include <iostream>\n\nusing std::map;\nusing std::pair;\nusing std::vector;\nusing std::string;\nusing std::ifstream;\nusing std::getline;\n\nuint64_t x;\nuint64_t xorshift64star(void) {\n\tx ^= x >> 12; \/\/ a\n\tx ^= x << 25; \/\/ b\n\tx ^= x >> 27; \/\/ c\n\treturn x * UINT64_C(2685821657736338717);\n}\n\nvoid parse_hexfile_line(const char *filename, int linenr, vector<vector<bool>> &hexfile, string &line)\n{\n\tvector<int> digits;\n\n\tfor (char c : line) {\n\t\tif ('0' <= c && c <= '9')\n\t\t\tdigits.push_back(c - '0');\n\t\telse if ('a' <= c && c <= 'f')\n\t\t\tdigits.push_back(10 + c - 'a');\n\t\telse if ('A' <= c && c <= 'F')\n\t\t\tdigits.push_back(10 + c - 'A');\n\t\telse goto error;\n\t}\n\n\thexfile.push_back(vector<bool>(digits.size() * 4));\n\n\tfor (int i = 0; i < int(digits.size()) * 4; i++)\n\t\tif ((digits.at(digits.size() - i\/4 -1) & (1 << (i%4))) != 0)\n\t\t\thexfile.back().at(i) = true;\n\n\treturn;\n\nerror:\n\tfprintf(stderr, \"Can't parse line %d of %s: %s\\n\", linenr, filename, line.c_str());\n\texit(1);\n}\n\nvoid help(const char *cmd)\n{\n\tprintf(\"\\n\");\n\tprintf(\"Usage: %s [options] <from_hexfile> <to_hexfile>\\n\", cmd);\n\tprintf(\" %s [options] -g <width> <depth>\\n\", cmd);\n\tprintf(\"\\n\");\n\tprintf(\"Replace BRAM initialization data in a .asc file. This can be used\\n\");\n\tprintf(\"for example to replace firmware images without re-running synthesis\\n\");\n\tprintf(\"and place&route.\\n\");\n\tprintf(\"\\n\");\n\tprintf(\" -g\\n\");\n\tprintf(\" generate a hex file with random contents.\\n\");\n\tprintf(\" use this to generate the hex file used during synthesis, then\\n\");\n\tprintf(\" use the same file as <from_hexfile> later.\\n\");\n\tprintf(\"\\n\");\n\tprintf(\" -v\\n\");\n\tprintf(\" verbose output\\n\");\n\tprintf(\"\\n\");\n\texit(1);\n}\n\nint main(int argc, char **argv)\n{\n\tbool verbose = false;\n\tbool generate = false;\n\n\tint opt;\n\twhile ((opt = getopt(argc, argv, \"vg\")) != -1)\n\t{\n\t\tswitch (opt)\n\t\t{\n\t\tcase 'v':\n\t\t\tverbose = true;\n\t\t\tbreak;\n\t\tcase 'g':\n\t\t\tgenerate = true;\n\t\t\tbreak;\n\t\tdefault:\n\t\t\thelp(argv[0]);\n\t\t}\n\t}\n\n\tif (generate)\n\t{\n\t\tif (optind+2 != argc)\n\t\t\thelp(argv[0]);\n\n\t\tint width = atoi(argv[optind]);\n\t\tint depth = atoi(argv[optind+1]);\n\n\t\tif (width <= 0 || width % 4 != 0) {\n\t\t\tfprintf(stderr, \"Hexfile width (%d bits) is not divisible by 4 or nonpositive!\\n\", width);\n\t\t\texit(1);\n\t\t}\n\n\t\tif (depth <= 0 || depth % 256 != 0) {\n\t\t\tfprintf(stderr, \"Hexfile number of words (%d) is not divisible by 256 or nonpositive!\\n\", depth);\n\t\t\texit(1);\n\t\t}\n\n\t\tx = uint64_t(getpid()) << 32;\n\t\tx ^= uint64_t(depth) << 16;\n\t\tx ^= uint64_t(width) << 10;\n\n\t\txorshift64star();\n\t\txorshift64star();\n\t\txorshift64star();\n\n\t\tstruct timeval tv;\n\t\tgettimeofday(&tv, NULL);\n\t\tx ^= uint64_t(tv.tv_sec) << 20;\n\t\tx ^= uint64_t(tv.tv_usec);\n\n\t\txorshift64star();\n\t\txorshift64star();\n\t\txorshift64star();\n\n\t\tfor (int i = 0; i < depth; i++) {\n\t\t\tfor (int j = 0; j < width \/ 4; j++) {\n\t\t\t\tint digit = xorshift64star() & 15;\n\t\t\t\tstd::cout << \"0123456789abcdef\"[digit];\n\t\t\t}\n\t\t\tstd::cout << std::endl;\n\t\t}\n\n\t\texit(0);\n\t}\n\n\tif (optind+2 != argc)\n\t\thelp(argv[0]);\n\n\n\t\/\/ -------------------------------------------------------\n\t\/\/ Load from_hexfile and to_hexfile\n\n\tconst char *from_hexfile_n = argv[optind];\n\tifstream from_hexfile_f(from_hexfile_n);\n\tvector<vector<bool>> from_hexfile;\n\n\tconst char *to_hexfile_n = argv[optind+1];\n\tifstream to_hexfile_f(to_hexfile_n);\n\tvector<vector<bool>> to_hexfile;\n\n\tstring line;\n\n\tfor (int i = 1; getline(from_hexfile_f, line); i++)\n\t\tparse_hexfile_line(from_hexfile_n, i, from_hexfile, line);\n\n\tfor (int i = 1; getline(to_hexfile_f, line); i++)\n\t\tparse_hexfile_line(to_hexfile_n, i, to_hexfile, line);\n\n\tif (from_hexfile.size() != to_hexfile.size()) {\n\t\tfprintf(stderr, \"Hexfiles have different number of words! (%d vs. %d)\\n\", int(from_hexfile.size()), int(to_hexfile.size()));\n\t\texit(1);\n\t}\n\n\tif (from_hexfile.size() % 256 != 0) {\n\t\tfprintf(stderr, \"Hexfile number of words (%d) is not divisible by 256!\\n\", int(from_hexfile.size()));\n\t\texit(1);\n\t}\n\n\tfor (size_t i = 1; i < from_hexfile.size(); i++)\n\t\tif (from_hexfile.at(i-1).size() != from_hexfile.at(i).size()) {\n\t\t\tfprintf(stderr, \"Inconsistent word width at line %d of %s!\\n\", int(i), from_hexfile_n);\n\t\t\texit(1);\n\t\t}\n\n\tfor (size_t i = 1; i < to_hexfile.size(); i++) {\n\t\twhile (to_hexfile.at(i-1).size() > to_hexfile.at(i).size())\n\t\t\tto_hexfile.at(i).push_back(false);\n\t\tif (to_hexfile.at(i-1).size() != to_hexfile.at(i).size()) {\n\t\t\tfprintf(stderr, \"Inconsistent word width at line %d of %s!\\n\", int(i+1), to_hexfile_n);\n\t\t\texit(1);\n\t\t}\n\t}\n\n\tif (from_hexfile.size() == 0 || from_hexfile.at(0).size() == 0) {\n\t\tfprintf(stderr, \"Empty from\/to hexfiles!\\n\");\n\t\texit(1);\n\t}\n\n\tif (verbose)\n\t\tfprintf(stderr, \"Loaded pattern for %d bits wide and %d words deep memory.\\n\", int(from_hexfile.at(0).size()), int(from_hexfile.size()));\n\n\n\t\/\/ -------------------------------------------------------\n\t\/\/ Create bitslices from pattern data\n\n\tmap<vector<bool>, pair<vector<bool>, int>> pattern;\n\n\tfor (int i = 0; i < int(from_hexfile.at(0).size()); i++)\n\t{\n\t\tvector<bool> pattern_from, pattern_to;\n\n\t\tfor (int j = 0; j < int(from_hexfile.size()); j++)\n\t\t{\n\t\t\tpattern_from.push_back(from_hexfile.at(j).at(i));\n\t\t\tpattern_to.push_back(to_hexfile.at(j).at(i));\n\n\t\t\tif (pattern_from.size() == 256) {\n\t\t\t\tif (pattern.count(pattern_from)) {\n\t\t\t\t\tfprintf(stderr, \"Conflicting from pattern for bit slice from_hexfile[%d:%d][%d]!\\n\", j, j-255, i);\n\t\t\t\t\texit(1);\n\t\t\t\t}\n\t\t\t\tpattern[pattern_from] = std::make_pair(pattern_to, 0);\n\t\t\t\tpattern_from.clear(), pattern_to.clear();\n\t\t\t}\n\t\t}\n\n\t\tassert(pattern_from.empty());\n\t\tassert(pattern_to.empty());\n\t}\n\n\tif (verbose)\n\t\tfprintf(stderr, \"Extracted %d bit slices from from\/to hexfile data.\\n\", int(pattern.size()));\n\n\n\t\/\/ -------------------------------------------------------\n\t\/\/ Read ascfile from stdin\n\n\tvector<string> ascfile_lines;\n\tmap<string, vector<vector<bool>>> ascfile_hexdata;\n\n\tfor (int i = 1; getline(std::cin, line); i++)\n\t{\n\tnext_asc_stmt:\n\t\tascfile_lines.push_back(line);\n\n\t\tif (line.substr(0, 9) == \".ram_data\")\n\t\t{\n\t\t\tauto &hexdata = ascfile_hexdata[line];\n\n\t\t\tfor (; getline(std::cin, line); i++) {\n\t\t\t\tif (line.substr(0, 1) == \".\")\n\t\t\t\t\tgoto next_asc_stmt;\n\t\t\t\tparse_hexfile_line(\"stdin\", i, hexdata, line);\n\t\t\t}\n\t\t}\n\t}\n\n\tif (verbose)\n\t\tfprintf(stderr, \"Found %d initialized bram cells in asc file.\\n\", int(ascfile_hexdata.size()));\n\n\n\t\/\/ -------------------------------------------------------\n\t\/\/ Replace bram data\n\n\tint max_replace_cnt = 0;\n\n\tfor (auto &bram_it : ascfile_hexdata)\n\t{\n\t\tauto &bram_data = bram_it.second;\n\n\t\tfor (int i = 0; i < 16; i++)\n\t\t{\n\t\t\tvector<bool> from_bitslice;\n\n\t\t\tfor (int j = 0; j < 256; j++)\n\t\t\t\tfrom_bitslice.push_back(bram_data.at(j \/ 16).at(16 * (j % 16) + i));\n\n\t\t\tauto p = pattern.find(from_bitslice);\n\t\t\tif (p != pattern.end())\n\t\t\t{\n\t\t\t\tauto &to_bitslice = p->second.first;\n\n\t\t\t\tfor (int j = 0; j < 256; j++)\n\t\t\t\t\tbram_data.at(j \/ 16).at(16 * (j % 16) + i) = to_bitslice.at(j);\n\n\t\t\t\tmax_replace_cnt = std::max(++p->second.second, max_replace_cnt);\n\t\t\t}\n\t\t}\n\t}\n\n\tint min_replace_cnt = max_replace_cnt;\n\tfor (auto &it : pattern)\n\t\tmin_replace_cnt = std::min(min_replace_cnt, it.second.second);\n\n\tif (min_replace_cnt != max_replace_cnt) {\n\t\tfprintf(stderr, \"Found some bitslices up to %d times, others only %d times!\\n\", max_replace_cnt, min_replace_cnt);\n\t\texit(1);\n\t}\n\n\tif (verbose)\n\t\tfprintf(stderr, \"Found and replaced %d instances of the memory.\\n\", max_replace_cnt);\n\n\n\t\/\/ -------------------------------------------------------\n\t\/\/ Write ascfile to stdout\n\n\tfor (size_t i = 0; i < ascfile_lines.size(); i++) {\n\t\tauto &line = ascfile_lines.at(i);\n\t\tstd::cout << line << std::endl;\n\t\tif (ascfile_hexdata.count(line)) {\n\t\t\tfor (auto &word : ascfile_hexdata.at(line)) {\n\t\t\t\tfor (int k = word.size()-4; k >= 0; k -= 4) {\n\t\t\t\t\tint digit = (word[k+3] ? 8 : 0) + (word[k+2] ? 4 : 0) + (word[k+1] ? 2 : 0) + (word[k] ? 1 : 0);\n\t\t\t\t\tstd::cout << \"0123456789abcdef\"[digit];\n\t\t\t\t}\n\t\t\t\tstd::cout << std::endl;\n\t\t\t}\n\t\t}\n\t}\n\n\treturn 0;\n}\n<commit_msg>Improve input parsing of icebram<commit_after>\/\/\n\/\/ Copyright (C) 2016 Clifford Wolf <clifford@clifford.at>\n\/\/\n\/\/ Permission to use, copy, modify, and\/or distribute this software for any\n\/\/ purpose with or without fee is hereby granted, provided that the above\n\/\/ copyright notice and this permission notice appear in all copies.\n\/\/\n\/\/ THE SOFTWARE IS PROVIDED \"AS IS\" AND THE AUTHOR DISCLAIMS ALL WARRANTIES\n\/\/ WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF\n\/\/ MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR\n\/\/ ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES\n\/\/ WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN\n\/\/ ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF\n\/\/ OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE.\n\/\/\n\n#include <stdio.h>\n#include <stdlib.h>\n#include <unistd.h>\n#include <string.h>\n#include <assert.h>\n#include <stdint.h>\n#include <sys\/time.h>\n\n#include <map>\n#include <vector>\n#include <string>\n#include <fstream>\n#include <iostream>\n\nusing std::map;\nusing std::pair;\nusing std::vector;\nusing std::string;\nusing std::ifstream;\nusing std::getline;\n\nuint64_t x;\nuint64_t xorshift64star(void) {\n\tx ^= x >> 12; \/\/ a\n\tx ^= x << 25; \/\/ b\n\tx ^= x >> 27; \/\/ c\n\treturn x * UINT64_C(2685821657736338717);\n}\n\nvoid push_back_bitvector(vector<vector<bool>> &hexfile, const vector<int> &digits)\n{\n\tif (digits.empty())\n\t\treturn;\n\n\thexfile.push_back(vector<bool>(digits.size() * 4));\n\n\tfor (int i = 0; i < int(digits.size()) * 4; i++)\n\t\tif ((digits.at(digits.size() - i\/4 -1) & (1 << (i%4))) != 0)\n\t\t\thexfile.back().at(i) = true;\n}\n\nvoid parse_hexfile_line(const char *filename, int linenr, vector<vector<bool>> &hexfile, string &line)\n{\n\tvector<int> digits;\n\n\tfor (char c : line) {\n\t\tif ('0' <= c && c <= '9')\n\t\t\tdigits.push_back(c - '0');\n\t\telse if ('a' <= c && c <= 'f')\n\t\t\tdigits.push_back(10 + c - 'a');\n\t\telse if ('A' <= c && c <= 'F')\n\t\t\tdigits.push_back(10 + c - 'A');\n\t\telse if ('x' == c || 'X' == c ||\n\t\t\t 'z' == c || 'Z' == c)\n\t\t\tdigits.push_back(0);\n\t\telse if ('_' == c)\n\t\t\t;\n\t\telse if (' ' == c || '\\t' == c || '\\r' == c) {\n\t\t\tpush_back_bitvector(hexfile, digits);\n\t\t\tdigits.clear();\n\t\t} else goto error;\n\t}\n\n\tpush_back_bitvector(hexfile, digits);\n\n\treturn;\n\nerror:\n\tfprintf(stderr, \"Can't parse line %d of %s: %s\\n\", linenr, filename, line.c_str());\n\texit(1);\n}\n\nvoid help(const char *cmd)\n{\n\tprintf(\"\\n\");\n\tprintf(\"Usage: %s [options] <from_hexfile> <to_hexfile>\\n\", cmd);\n\tprintf(\" %s [options] -g <width> <depth>\\n\", cmd);\n\tprintf(\"\\n\");\n\tprintf(\"Replace BRAM initialization data in a .asc file. This can be used\\n\");\n\tprintf(\"for example to replace firmware images without re-running synthesis\\n\");\n\tprintf(\"and place&route.\\n\");\n\tprintf(\"\\n\");\n\tprintf(\" -g\\n\");\n\tprintf(\" generate a hex file with random contents.\\n\");\n\tprintf(\" use this to generate the hex file used during synthesis, then\\n\");\n\tprintf(\" use the same file as <from_hexfile> later.\\n\");\n\tprintf(\"\\n\");\n\tprintf(\" -v\\n\");\n\tprintf(\" verbose output\\n\");\n\tprintf(\"\\n\");\n\texit(1);\n}\n\nint main(int argc, char **argv)\n{\n\tbool verbose = false;\n\tbool generate = false;\n\n\tint opt;\n\twhile ((opt = getopt(argc, argv, \"vg\")) != -1)\n\t{\n\t\tswitch (opt)\n\t\t{\n\t\tcase 'v':\n\t\t\tverbose = true;\n\t\t\tbreak;\n\t\tcase 'g':\n\t\t\tgenerate = true;\n\t\t\tbreak;\n\t\tdefault:\n\t\t\thelp(argv[0]);\n\t\t}\n\t}\n\n\tif (generate)\n\t{\n\t\tif (optind+2 != argc)\n\t\t\thelp(argv[0]);\n\n\t\tint width = atoi(argv[optind]);\n\t\tint depth = atoi(argv[optind+1]);\n\n\t\tif (width <= 0 || width % 4 != 0) {\n\t\t\tfprintf(stderr, \"Hexfile width (%d bits) is not divisible by 4 or nonpositive!\\n\", width);\n\t\t\texit(1);\n\t\t}\n\n\t\tif (depth <= 0 || depth % 256 != 0) {\n\t\t\tfprintf(stderr, \"Hexfile number of words (%d) is not divisible by 256 or nonpositive!\\n\", depth);\n\t\t\texit(1);\n\t\t}\n\n\t\tx = uint64_t(getpid()) << 32;\n\t\tx ^= uint64_t(depth) << 16;\n\t\tx ^= uint64_t(width) << 10;\n\n\t\txorshift64star();\n\t\txorshift64star();\n\t\txorshift64star();\n\n\t\tstruct timeval tv;\n\t\tgettimeofday(&tv, NULL);\n\t\tx ^= uint64_t(tv.tv_sec) << 20;\n\t\tx ^= uint64_t(tv.tv_usec);\n\n\t\txorshift64star();\n\t\txorshift64star();\n\t\txorshift64star();\n\n\t\tfor (int i = 0; i < depth; i++) {\n\t\t\tfor (int j = 0; j < width \/ 4; j++) {\n\t\t\t\tint digit = xorshift64star() & 15;\n\t\t\t\tstd::cout << \"0123456789abcdef\"[digit];\n\t\t\t}\n\t\t\tstd::cout << std::endl;\n\t\t}\n\n\t\texit(0);\n\t}\n\n\tif (optind+2 != argc)\n\t\thelp(argv[0]);\n\n\n\t\/\/ -------------------------------------------------------\n\t\/\/ Load from_hexfile and to_hexfile\n\n\tconst char *from_hexfile_n = argv[optind];\n\tifstream from_hexfile_f(from_hexfile_n);\n\tvector<vector<bool>> from_hexfile;\n\n\tconst char *to_hexfile_n = argv[optind+1];\n\tifstream to_hexfile_f(to_hexfile_n);\n\tvector<vector<bool>> to_hexfile;\n\n\tstring line;\n\n\tfor (int i = 1; getline(from_hexfile_f, line); i++)\n\t\tparse_hexfile_line(from_hexfile_n, i, from_hexfile, line);\n\n\tfor (int i = 1; getline(to_hexfile_f, line); i++)\n\t\tparse_hexfile_line(to_hexfile_n, i, to_hexfile, line);\n\n\tif (to_hexfile.size() > 0 && from_hexfile.size() > to_hexfile.size()) {\n\t\tif (verbose)\n\t\t\tfprintf(stderr, \"Padding to_hexfile from %d words to %d\\n\",\n\t\t\t\tint(to_hexfile.size()), int(from_hexfile.size()));\n\t\tdo\n\t\t\tto_hexfile.push_back(vector<bool>(to_hexfile.at(0).size()));\n\t\twhile (from_hexfile.size() > to_hexfile.size());\n\t}\n\n\tif (from_hexfile.size() != to_hexfile.size()) {\n\t\tfprintf(stderr, \"Hexfiles have different number of words! (%d vs. %d)\\n\", int(from_hexfile.size()), int(to_hexfile.size()));\n\t\texit(1);\n\t}\n\n\tif (from_hexfile.size() % 256 != 0) {\n\t\tfprintf(stderr, \"Hexfile number of words (%d) is not divisible by 256!\\n\", int(from_hexfile.size()));\n\t\texit(1);\n\t}\n\n\tfor (size_t i = 1; i < from_hexfile.size(); i++)\n\t\tif (from_hexfile.at(i-1).size() != from_hexfile.at(i).size()) {\n\t\t\tfprintf(stderr, \"Inconsistent word width at line %d of %s!\\n\", int(i), from_hexfile_n);\n\t\t\texit(1);\n\t\t}\n\n\tfor (size_t i = 1; i < to_hexfile.size(); i++) {\n\t\twhile (to_hexfile.at(i-1).size() > to_hexfile.at(i).size())\n\t\t\tto_hexfile.at(i).push_back(false);\n\t\tif (to_hexfile.at(i-1).size() != to_hexfile.at(i).size()) {\n\t\t\tfprintf(stderr, \"Inconsistent word width at line %d of %s!\\n\", int(i+1), to_hexfile_n);\n\t\t\texit(1);\n\t\t}\n\t}\n\n\tif (from_hexfile.size() == 0 || from_hexfile.at(0).size() == 0) {\n\t\tfprintf(stderr, \"Empty from\/to hexfiles!\\n\");\n\t\texit(1);\n\t}\n\n\tif (verbose)\n\t\tfprintf(stderr, \"Loaded pattern for %d bits wide and %d words deep memory.\\n\", int(from_hexfile.at(0).size()), int(from_hexfile.size()));\n\n\n\t\/\/ -------------------------------------------------------\n\t\/\/ Create bitslices from pattern data\n\n\tmap<vector<bool>, pair<vector<bool>, int>> pattern;\n\n\tfor (int i = 0; i < int(from_hexfile.at(0).size()); i++)\n\t{\n\t\tvector<bool> pattern_from, pattern_to;\n\n\t\tfor (int j = 0; j < int(from_hexfile.size()); j++)\n\t\t{\n\t\t\tpattern_from.push_back(from_hexfile.at(j).at(i));\n\t\t\tpattern_to.push_back(to_hexfile.at(j).at(i));\n\n\t\t\tif (pattern_from.size() == 256) {\n\t\t\t\tif (pattern.count(pattern_from)) {\n\t\t\t\t\tfprintf(stderr, \"Conflicting from pattern for bit slice from_hexfile[%d:%d][%d]!\\n\", j, j-255, i);\n\t\t\t\t\texit(1);\n\t\t\t\t}\n\t\t\t\tpattern[pattern_from] = std::make_pair(pattern_to, 0);\n\t\t\t\tpattern_from.clear(), pattern_to.clear();\n\t\t\t}\n\t\t}\n\n\t\tassert(pattern_from.empty());\n\t\tassert(pattern_to.empty());\n\t}\n\n\tif (verbose)\n\t\tfprintf(stderr, \"Extracted %d bit slices from from\/to hexfile data.\\n\", int(pattern.size()));\n\n\n\t\/\/ -------------------------------------------------------\n\t\/\/ Read ascfile from stdin\n\n\tvector<string> ascfile_lines;\n\tmap<string, vector<vector<bool>>> ascfile_hexdata;\n\n\tfor (int i = 1; getline(std::cin, line); i++)\n\t{\n\tnext_asc_stmt:\n\t\tascfile_lines.push_back(line);\n\n\t\tif (line.substr(0, 9) == \".ram_data\")\n\t\t{\n\t\t\tauto &hexdata = ascfile_hexdata[line];\n\n\t\t\tfor (; getline(std::cin, line); i++) {\n\t\t\t\tif (line.substr(0, 1) == \".\")\n\t\t\t\t\tgoto next_asc_stmt;\n\t\t\t\tparse_hexfile_line(\"stdin\", i, hexdata, line);\n\t\t\t}\n\t\t}\n\t}\n\n\tif (verbose)\n\t\tfprintf(stderr, \"Found %d initialized bram cells in asc file.\\n\", int(ascfile_hexdata.size()));\n\n\n\t\/\/ -------------------------------------------------------\n\t\/\/ Replace bram data\n\n\tint max_replace_cnt = 0;\n\n\tfor (auto &bram_it : ascfile_hexdata)\n\t{\n\t\tauto &bram_data = bram_it.second;\n\n\t\tfor (int i = 0; i < 16; i++)\n\t\t{\n\t\t\tvector<bool> from_bitslice;\n\n\t\t\tfor (int j = 0; j < 256; j++)\n\t\t\t\tfrom_bitslice.push_back(bram_data.at(j \/ 16).at(16 * (j % 16) + i));\n\n\t\t\tauto p = pattern.find(from_bitslice);\n\t\t\tif (p != pattern.end())\n\t\t\t{\n\t\t\t\tauto &to_bitslice = p->second.first;\n\n\t\t\t\tfor (int j = 0; j < 256; j++)\n\t\t\t\t\tbram_data.at(j \/ 16).at(16 * (j % 16) + i) = to_bitslice.at(j);\n\n\t\t\t\tmax_replace_cnt = std::max(++p->second.second, max_replace_cnt);\n\t\t\t}\n\t\t}\n\t}\n\n\tint min_replace_cnt = max_replace_cnt;\n\tfor (auto &it : pattern)\n\t\tmin_replace_cnt = std::min(min_replace_cnt, it.second.second);\n\n\tif (min_replace_cnt != max_replace_cnt) {\n\t\tfprintf(stderr, \"Found some bitslices up to %d times, others only %d times!\\n\", max_replace_cnt, min_replace_cnt);\n\t\texit(1);\n\t}\n\n\tif (verbose)\n\t\tfprintf(stderr, \"Found and replaced %d instances of the memory.\\n\", max_replace_cnt);\n\n\n\t\/\/ -------------------------------------------------------\n\t\/\/ Write ascfile to stdout\n\n\tfor (size_t i = 0; i < ascfile_lines.size(); i++) {\n\t\tauto &line = ascfile_lines.at(i);\n\t\tstd::cout << line << std::endl;\n\t\tif (ascfile_hexdata.count(line)) {\n\t\t\tfor (auto &word : ascfile_hexdata.at(line)) {\n\t\t\t\tfor (int k = word.size()-4; k >= 0; k -= 4) {\n\t\t\t\t\tint digit = (word[k+3] ? 8 : 0) + (word[k+2] ? 4 : 0) + (word[k+1] ? 2 : 0) + (word[k] ? 1 : 0);\n\t\t\t\t\tstd::cout << \"0123456789abcdef\"[digit];\n\t\t\t\t}\n\t\t\t\tstd::cout << std::endl;\n\t\t\t}\n\t\t}\n\t}\n\n\treturn 0;\n}\n<|endoftext|>"} {"text":"<commit_before>\/\/ @(#)root\/memstat:$Id$\n\/\/ Author: Anar Manafov (A.Manafov@gsi.de) 2008-03-02\n\n\/*************************************************************************\n* Copyright (C) 1995-2010, 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\/\/ STD\n#include <cstdlib>\n\/\/ ROOT\n#include \"TSystem.h\"\n#include \"TEnv.h\"\n#include \"TError.h\"\n#include \"Riostream.h\"\n#include \"TObject.h\"\n#include \"TFile.h\"\n#include \"TTree.h\"\n#include \"TArrayL64.h\"\n#include \"TH1.h\"\n#include \"TMD5.h\"\n\/\/ Memstat\n#include \"TMemStatBacktrace.h\"\n#include \"TMemStatMng.h\"\n\nusing namespace memstat;\n\nClassImp(TMemStatMng)\n\nTMemStatMng* TMemStatMng::fgInstance = NULL;\n\n\/\/****************************************************************************\/\/\n\/\/\n\/\/****************************************************************************\/\/\n\nTMemStatMng::TMemStatMng():\n TObject(),\n#if !defined(__APPLE__)\n fPreviousMallocHook(TMemStatHook::GetMallocHook()),\n fPreviousFreeHook(TMemStatHook::GetFreeHook()),\n#endif\n fDumpTree(NULL),\n fUseGNUBuiltinBacktrace(kFALSE),\n fBeginTime(0),\n fPos(0),\n fTimems(0),\n fNBytes(0),\n fN(0),\n fBtID(0),\n fBTCount(0)\n{\n \/\/ Default constructor\n}\n\n\/\/______________________________________________________________________________\nvoid TMemStatMng::Init()\n{\n \/\/Initialize MemStat manager - used only by instance method\n\n fBeginTime = fTimeStamp.AsDouble();\n\n \/\/fDumpFile = new TFile(Form(\"yams_%d.root\", gSystem->GetPid()), \"recreate\");\n fDumpFile = new TFile(g_cszFileName, \"recreate\");\n Int_t opt = 200000;\n if(!fDumpTree) {\n fDumpTree = new TTree(\"T\", \"Memory Statistics\");\n fDumpTree->Branch(\"pos\", &fPos, \"pos\/l\", opt);\n fDumpTree->Branch(\"time\", &fTimems, \"time\/I\", opt);\n fDumpTree->Branch(\"nbytes\", &fNBytes, \"nbytes\/I\", opt);\n fDumpTree->Branch(\"btid\", &fBtID, \"btid\/I\", opt);\n }\n\n fBTCount = 0;\n\n fBTIDCount = 0;\n\n fFAddrsList = new TObjArray();\n fFAddrsList->SetOwner(kTRUE);\n\n fHbtids = new TH1I(\"btids\", \"table of btids\", 10000, 0, 1); \/\/where fHbtids is a member of the manager class\n fHbtids->SetDirectory(0);\n \/\/ save the histogram to a tree header\n fDumpTree->GetUserInfo()->Add(fHbtids);\n}\n\n\/\/______________________________________________________________________________\nTMemStatMng* TMemStatMng::GetInstance()\n{\n \/\/ GetInstance - a static function\n \/\/ Initialize a singleton of MemStat manager\n\n if(!fgInstance) {\n fgInstance = new TMemStatMng;\n fgInstance->Init();\n }\n return fgInstance;\n}\n\n\/\/______________________________________________________________________________\nvoid TMemStatMng::Close()\n{\n \/\/ Close - a static function\n \/\/ This method stops the manager,\n \/\/ flashes all the buffered data and closes the output tree.\n\n \/\/ TODO: This is a temporary solution until we find a properalgorithm for SaveData\n fgInstance->fDumpFile->WriteObject(fgInstance->fFAddrsList, \"FAddrsList\");\n\n \/\/ to be documented\n fgInstance->fDumpTree->AutoSave();\n\n delete fgInstance->fFAddrsList;\n\n delete fgInstance;\n fgInstance = NULL;\n}\n\n\/\/______________________________________________________________________________\nTMemStatMng::~TMemStatMng()\n{\n \/\/ if an instance is destructed - the hooks are reseted to old hooks\n\n if(this != TMemStatMng::GetInstance())\n return;\n\n Info(\"~TMemStatMng\", \">>> All free\/malloc calls count: %d\", fBTIDCount);\n Info(\"~TMemStatMng\", \">>> Unique BTIDs count: %zu\", fBTChecksums.size());\n\n Disable();\n}\n\n\/\/______________________________________________________________________________\nvoid TMemStatMng::Enable()\n{\n \/\/ Enable memory hooks\n\n if(this != GetInstance())\n return;\n#if defined(__APPLE__)\n TMemStatHook::trackZoneMalloc(MacAllocHook, MacFreeHook);\n#else\n \/\/ set hook to our functions\n TMemStatHook::SetMallocHook(AllocHook);\n TMemStatHook::SetFreeHook(FreeHook);\n#endif\n}\n\n\/\/______________________________________________________________________________\nvoid TMemStatMng::Disable()\n{\n \/\/ Disble memory hooks\n\n if(this != GetInstance())\n return;\n#if defined(__APPLE__)\n TMemStatHook::untrackZoneMalloc();\n#else\n \/\/ set hook to our functions\n TMemStatHook::SetMallocHook(fPreviousMallocHook);\n TMemStatHook::SetFreeHook(fPreviousFreeHook);\n#endif\n}\n\n\/\/______________________________________________________________________________\nvoid TMemStatMng::MacAllocHook(void *ptr, size_t size)\n{\n \/\/ AllocHook - a static function\n \/\/ a special memory hook for Mac OS X memory zones.\n \/\/ Triggered when memory is allocated.\n\n TMemStatMng* instance = TMemStatMng::GetInstance();\n \/\/ Restore all old hooks\n instance->Disable();\n\n \/\/ Call our routine\n instance->AddPointer(ptr, Int_t(size));\n\n \/\/ Restore our own hooks\n instance->Enable();\n}\n\n\/\/______________________________________________________________________________\nvoid TMemStatMng::MacFreeHook(void *ptr)\n{\n \/\/ AllocHook - a static function\n \/\/ a special memory hook for Mac OS X memory zones.\n \/\/ Triggered when memory is deallocated.\n\n TMemStatMng* instance = TMemStatMng::GetInstance();\n \/\/ Restore all old hooks\n instance->Disable();\n\n \/\/ Call our routine\n instance->AddPointer(ptr, -1);\n\n \/\/ Restore our own hooks\n instance->Enable();\n}\n\n\/\/______________________________________________________________________________\nvoid *TMemStatMng::AllocHook(size_t size, const void* \/*caller*\/)\n{\n \/\/ AllocHook - a static function\n \/\/ A glibc memory allocation hook.\n\n TMemStatMng* instance = TMemStatMng::GetInstance();\n \/\/ Restore all old hooks\n instance->Disable();\n\n \/\/ Call recursively\n void *result = malloc(size);\n \/\/ Call our routine\n instance->AddPointer(result, Int_t(size));\n \/\/ TTimer::SingleShot(0, \"TYamsMemMng\", instance, \"SaveData()\");\n\n \/\/ Restore our own hooks\n instance->Enable();\n\n return result;\n}\n\n\/\/______________________________________________________________________________\nvoid TMemStatMng::FreeHook(void* ptr, const void* \/*caller*\/)\n{\n \/\/ FreeHook - a static function\n \/\/ A glibc memory deallocation hook.\n\n TMemStatMng* instance = TMemStatMng::GetInstance();\n \/\/ Restore all old hooks\n instance->Disable();\n\n \/\/ Call recursively\n free(ptr);\n\n \/\/ Call our routine\n instance->AddPointer(ptr, -1);\n\n \/\/ Restore our own hooks\n instance->Enable();\n}\n\n\/\/______________________________________________________________________________\nvoid TMemStatMng::AddPointer(void *ptr, Int_t size)\n{\n \/\/ Add pointer to table.\n \/\/ This method is called every time when any of the hooks are triggered.\n \/\/ The memory de-\/allocation information will is recorded.\n\n void *stptr[g_BTStackLevel + 1];\n const int stackentries = getBacktrace(stptr, g_BTStackLevel, fUseGNUBuiltinBacktrace);\n\n \/\/ save only unique BTs\n TMD5 md5;\n md5.Update(reinterpret_cast<UChar_t*>(stptr), sizeof(void*) * stackentries);\n md5.Final();\n string crc_digest(md5.AsString());\n\n \/\/ for Debug. A counter of all (de)allacations.\n ++fBTIDCount;\n\n CRCSet_t::const_iterator found = fBTChecksums.find(crc_digest);\n \/\/ TODO: define a proper default value\n Int_t btid = -1;\n if(fBTChecksums.end() == found) {\n\n \/\/ check the size of the BT array container\n const int nbins = fHbtids->GetNbinsX();\n \/\/check that the current allocation in fHbtids is enough, otherwise expend it with\n if(fBTCount + stackentries + 1 >= nbins) {\n fHbtids->SetBins(nbins * 2, 0, 1);\n }\n\n int *btids = fHbtids->GetArray();\n \/\/ A first value is a number of entries in a given stack\n btids[fBTCount++] = stackentries;\n btid = fBTCount;\n if(stackentries <= 0) {\n Warning(\"AddPointer\",\n \"A number of stack entries is equal or less than zero. For btid %d\", btid);\n }\n\n \/\/ add new BT's CRC value\n pair<CRCSet_t::iterator, bool> res = fBTChecksums.insert(CRCSet_t::value_type(crc_digest, btid));\n if(!res.second)\n Error(\"AddPointer\", \"Can't added a new BTID to the container.\");\n\n \/\/ save all symbols of this BT\n for(int i = 0; i < stackentries; ++i) {\n pointer_t func_addr = reinterpret_cast<pointer_t>(stptr[i]);\n\n Int_t idx = fFAddrs.find(func_addr);\n \/\/ check, whether it's a new symbol\n if(idx < 0) {\n TString strFuncAddr;\n strFuncAddr += func_addr;\n TString strSymbolInfo;\n getSymbolFullInfo(stptr[i], &strSymbolInfo);\n\n TNamed *nm = new TNamed(strFuncAddr, strSymbolInfo);\n fFAddrsList->Add(nm);\n idx = fFAddrsList->GetSize() - 1;\n \/\/ TODO: more detailed error message...\n if(!fFAddrs.add(func_addr, idx))\n Error(\"AddPointer\", \"Can't add a function return address to the container\");\n }\n\n \/\/TODO: in the error code prtint the address.\n \/\/ Acutally there must not be a case, when we can't find an index\n if(idx < 0)\n Error(\"AddPointer\", \"There is no index for a given BT function return address.\");\n \/\/ even if we have -1 as an index we add it to the container\n btids[fBTCount++] = idx;\n }\n\n } else {\n \/\/ reuse an existing BT\n btid = found->second;\n }\n\n if(btid <= 0)\n Error(\"AddPointer\", \"bad BT id\");\n\n fTimeStamp.Set();\n Double_t CurTime = fTimeStamp.AsDouble();\n fTimems = Int_t(10000.*(CurTime - fBeginTime));\n fPos = reinterpret_cast<pointer_t>(ptr);\n fNBytes = size;\n fN = 0;\n fBtID = btid;\n fDumpTree->Fill();\n}\n\n<commit_msg>removed a legacy code<commit_after>\/\/ @(#)root\/memstat:$Id$\n\/\/ Author: Anar Manafov (A.Manafov@gsi.de) 2008-03-02\n\n\/*************************************************************************\n* Copyright (C) 1995-2010, 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\/\/ STD\n#include <cstdlib>\n\/\/ ROOT\n#include \"TSystem.h\"\n#include \"TEnv.h\"\n#include \"TError.h\"\n#include \"Riostream.h\"\n#include \"TObject.h\"\n#include \"TFile.h\"\n#include \"TTree.h\"\n#include \"TArrayL64.h\"\n#include \"TH1.h\"\n#include \"TMD5.h\"\n\/\/ Memstat\n#include \"TMemStatBacktrace.h\"\n#include \"TMemStatMng.h\"\n\nusing namespace memstat;\n\nClassImp(TMemStatMng)\n\nTMemStatMng* TMemStatMng::fgInstance = NULL;\n\n\/\/****************************************************************************\/\/\n\/\/\n\/\/****************************************************************************\/\/\n\nTMemStatMng::TMemStatMng():\n TObject(),\n#if !defined(__APPLE__)\n fPreviousMallocHook(TMemStatHook::GetMallocHook()),\n fPreviousFreeHook(TMemStatHook::GetFreeHook()),\n#endif\n fDumpTree(NULL),\n fUseGNUBuiltinBacktrace(kFALSE),\n fBeginTime(0),\n fPos(0),\n fTimems(0),\n fNBytes(0),\n fN(0),\n fBtID(0),\n fBTCount(0)\n{\n \/\/ Default constructor\n}\n\n\/\/______________________________________________________________________________\nvoid TMemStatMng::Init()\n{\n \/\/Initialize MemStat manager - used only by instance method\n\n fBeginTime = fTimeStamp.AsDouble();\n\n \/\/fDumpFile = new TFile(Form(\"yams_%d.root\", gSystem->GetPid()), \"recreate\");\n fDumpFile = new TFile(g_cszFileName, \"recreate\");\n Int_t opt = 200000;\n if(!fDumpTree) {\n fDumpTree = new TTree(\"T\", \"Memory Statistics\");\n fDumpTree->Branch(\"pos\", &fPos, \"pos\/l\", opt);\n fDumpTree->Branch(\"time\", &fTimems, \"time\/I\", opt);\n fDumpTree->Branch(\"nbytes\", &fNBytes, \"nbytes\/I\", opt);\n fDumpTree->Branch(\"btid\", &fBtID, \"btid\/I\", opt);\n }\n\n fBTCount = 0;\n\n fBTIDCount = 0;\n\n fFAddrsList = new TObjArray();\n fFAddrsList->SetOwner(kTRUE);\n\n fHbtids = new TH1I(\"btids\", \"table of btids\", 10000, 0, 1); \/\/where fHbtids is a member of the manager class\n fHbtids->SetDirectory(0);\n \/\/ save the histogram to a tree header\n fDumpTree->GetUserInfo()->Add(fHbtids);\n}\n\n\/\/______________________________________________________________________________\nTMemStatMng* TMemStatMng::GetInstance()\n{\n \/\/ GetInstance - a static function\n \/\/ Initialize a singleton of MemStat manager\n\n if(!fgInstance) {\n fgInstance = new TMemStatMng;\n fgInstance->Init();\n }\n return fgInstance;\n}\n\n\/\/______________________________________________________________________________\nvoid TMemStatMng::Close()\n{\n \/\/ Close - a static function\n \/\/ This method stops the manager,\n \/\/ flashes all the buffered data and closes the output tree.\n\n \/\/ TODO: This is a temporary solution until we find a properalgorithm for SaveData\n fgInstance->fDumpFile->WriteObject(fgInstance->fFAddrsList, \"FAddrsList\");\n\n \/\/ to be documented\n fgInstance->fDumpTree->AutoSave();\n\n delete fgInstance->fFAddrsList;\n\n delete fgInstance;\n fgInstance = NULL;\n}\n\n\/\/______________________________________________________________________________\nTMemStatMng::~TMemStatMng()\n{\n \/\/ if an instance is destructed - the hooks are reseted to old hooks\n\n if(this != TMemStatMng::GetInstance())\n return;\n\n Info(\"~TMemStatMng\", \">>> All free\/malloc calls count: %d\", fBTIDCount);\n Info(\"~TMemStatMng\", \">>> Unique BTIDs count: %zu\", fBTChecksums.size());\n\n Disable();\n}\n\n\/\/______________________________________________________________________________\nvoid TMemStatMng::Enable()\n{\n \/\/ Enable memory hooks\n\n if(this != GetInstance())\n return;\n#if defined(__APPLE__)\n TMemStatHook::trackZoneMalloc(MacAllocHook, MacFreeHook);\n#else\n \/\/ set hook to our functions\n TMemStatHook::SetMallocHook(AllocHook);\n TMemStatHook::SetFreeHook(FreeHook);\n#endif\n}\n\n\/\/______________________________________________________________________________\nvoid TMemStatMng::Disable()\n{\n \/\/ Disble memory hooks\n\n if(this != GetInstance())\n return;\n#if defined(__APPLE__)\n TMemStatHook::untrackZoneMalloc();\n#else\n \/\/ set hook to our functions\n TMemStatHook::SetMallocHook(fPreviousMallocHook);\n TMemStatHook::SetFreeHook(fPreviousFreeHook);\n#endif\n}\n\n\/\/______________________________________________________________________________\nvoid TMemStatMng::MacAllocHook(void *ptr, size_t size)\n{\n \/\/ AllocHook - a static function\n \/\/ a special memory hook for Mac OS X memory zones.\n \/\/ Triggered when memory is allocated.\n\n TMemStatMng* instance = TMemStatMng::GetInstance();\n \/\/ Restore all old hooks\n instance->Disable();\n\n \/\/ Call our routine\n instance->AddPointer(ptr, Int_t(size));\n\n \/\/ Restore our own hooks\n instance->Enable();\n}\n\n\/\/______________________________________________________________________________\nvoid TMemStatMng::MacFreeHook(void *ptr)\n{\n \/\/ AllocHook - a static function\n \/\/ a special memory hook for Mac OS X memory zones.\n \/\/ Triggered when memory is deallocated.\n\n TMemStatMng* instance = TMemStatMng::GetInstance();\n \/\/ Restore all old hooks\n instance->Disable();\n\n \/\/ Call our routine\n instance->AddPointer(ptr, -1);\n\n \/\/ Restore our own hooks\n instance->Enable();\n}\n\n\/\/______________________________________________________________________________\nvoid *TMemStatMng::AllocHook(size_t size, const void* \/*caller*\/)\n{\n \/\/ AllocHook - a static function\n \/\/ A glibc memory allocation hook.\n\n TMemStatMng* instance = TMemStatMng::GetInstance();\n \/\/ Restore all old hooks\n instance->Disable();\n\n \/\/ Call recursively\n void *result = malloc(size);\n \/\/ Call our routine\n instance->AddPointer(result, Int_t(size));\n \/\/ TTimer::SingleShot(0, \"TYamsMemMng\", instance, \"SaveData()\");\n\n \/\/ Restore our own hooks\n instance->Enable();\n\n return result;\n}\n\n\/\/______________________________________________________________________________\nvoid TMemStatMng::FreeHook(void* ptr, const void* \/*caller*\/)\n{\n \/\/ FreeHook - a static function\n \/\/ A glibc memory deallocation hook.\n\n TMemStatMng* instance = TMemStatMng::GetInstance();\n \/\/ Restore all old hooks\n instance->Disable();\n\n \/\/ Call recursively\n free(ptr);\n\n \/\/ Call our routine\n instance->AddPointer(ptr, -1);\n\n \/\/ Restore our own hooks\n instance->Enable();\n}\n\n\/\/______________________________________________________________________________\nvoid TMemStatMng::AddPointer(void *ptr, Int_t size)\n{\n \/\/ Add pointer to table.\n \/\/ This method is called every time when any of the hooks are triggered.\n \/\/ The memory de-\/allocation information will is recorded.\n\n void *stptr[g_BTStackLevel + 1];\n const int stackentries = getBacktrace(stptr, g_BTStackLevel, fUseGNUBuiltinBacktrace);\n\n \/\/ save only unique BTs\n TMD5 md5;\n md5.Update(reinterpret_cast<UChar_t*>(stptr), sizeof(void*) * stackentries);\n md5.Final();\n string crc_digest(md5.AsString());\n\n \/\/ for Debug. A counter of all (de)allacations.\n ++fBTIDCount;\n\n CRCSet_t::const_iterator found = fBTChecksums.find(crc_digest);\n \/\/ TODO: define a proper default value\n Int_t btid = -1;\n if(fBTChecksums.end() == found) {\n\n \/\/ check the size of the BT array container\n const int nbins = fHbtids->GetNbinsX();\n \/\/check that the current allocation in fHbtids is enough, otherwise expend it with\n if(fBTCount + stackentries + 1 >= nbins) {\n fHbtids->SetBins(nbins * 2, 0, 1);\n }\n\n int *btids = fHbtids->GetArray();\n \/\/ A first value is a number of entries in a given stack\n btids[fBTCount++] = stackentries;\n btid = fBTCount;\n if(stackentries <= 0) {\n Warning(\"AddPointer\",\n \"A number of stack entries is equal or less than zero. For btid %d\", btid);\n }\n\n \/\/ add new BT's CRC value\n pair<CRCSet_t::iterator, bool> res = fBTChecksums.insert(CRCSet_t::value_type(crc_digest, btid));\n if(!res.second)\n Error(\"AddPointer\", \"Can't added a new BTID to the container.\");\n\n \/\/ save all symbols of this BT\n for(int i = 0; i < stackentries; ++i) {\n pointer_t func_addr = reinterpret_cast<pointer_t>(stptr[i]);\n\n Int_t idx = fFAddrs.find(func_addr);\n \/\/ check, whether it's a new symbol\n if(idx < 0) {\n TString strFuncAddr;\n strFuncAddr += func_addr;\n TString strSymbolInfo;\n getSymbolFullInfo(stptr[i], &strSymbolInfo);\n\n TNamed *nm = new TNamed(strFuncAddr, strSymbolInfo);\n fFAddrsList->Add(nm);\n idx = fFAddrsList->GetSize() - 1;\n \/\/ TODO: more detailed error message...\n if(!fFAddrs.add(func_addr, idx))\n Error(\"AddPointer\", \"Can't add a function return address to the container\");\n }\n\n \/\/ even if we have -1 as an index we add it to the container\n btids[fBTCount++] = idx;\n }\n\n } else {\n \/\/ reuse an existing BT\n btid = found->second;\n }\n\n if(btid <= 0)\n Error(\"AddPointer\", \"bad BT id\");\n\n fTimeStamp.Set();\n Double_t CurTime = fTimeStamp.AsDouble();\n fTimems = Int_t(10000.*(CurTime - fBeginTime));\n fPos = reinterpret_cast<pointer_t>(ptr);\n fNBytes = size;\n fN = 0;\n fBtID = btid;\n fDumpTree->Fill();\n}\n\n<|endoftext|>"} {"text":"<commit_before>#ifndef MJOLNIR_LOCAL_FORCE_FIELD\n#define MJOLNIR_LOCAL_FORCE_FIELD\n#include \"LocalInteractionBase.hpp\"\n#include <utility>\n#include <vector>\n#include <array>\n#include <memory>\n\nnamespace mjolnir\n{\n\ntemplate<typename traitsT>\nclass LocalForceField\n{\n public:\n typedef traitsT traits_type;\n typedef typename traits_type::time_type time_type;\n typedef typename traits_type::real_type real_type;\n typedef typename traits_type::coordinate_type coordinate_type;\n typedef Particle<coordinate_type> particle_type;\n typedef ParticleContainer<traits_type> particle_container_type;\n typedef LocalInteractionBase<traitsT> interaction_type;\n typedef std::unique_ptr<interaction_type> interaction_ptr;\n typedef std::vector<interaction_ptr> container_type;\n\n public:\n\n LocalForceField() = default;\n ~LocalForceField() = default;\n LocalForceField(LocalForceField const&) = delete;\n LocalForceField(LocalForceField&&) = default;\n LocalForceField& operator=(LocalForceField const&) = delete;\n LocalForceField& operator=(LocalForceField&&) = default;\n\n void emplace(interaction_ptr&& interaction);\n\n void calc_force(particle_container_type& pcon);\n real_type calc_energy(const particle_container_type& pcon) const;\n\n void reset_parameter(const std::string&, const real_type);\n\n private:\n\n container_type interactions_;\n};\n\ntemplate<typename traitsT>\ninline void LocalForceField<traitsT>::emplace(\n interaction_ptr&& interaction)\n{\n interactions_.emplace_back(std::forward<interaction_ptr>(interaction));\n return;\n}\n\ntemplate<typename traitsT>\nvoid LocalForceField<traitsT>::calc_force(particle_container_type& pcon)\n{\n for(auto iter = interactions_.cbegin(); iter != interactions_.cend(); ++iter)\n (*iter)->calc_force(pcon);\n return;\n}\n\ntemplate<typename traitsT>\ntypename LocalForceField<traitsT>::real_type\nLocalForceField<traitsT>::calc_energy(const particle_container_type& pcon) const\n{\n real_type energy = 0.0;\n for(auto iter = interactions_.cbegin(); iter != interactions_.cend(); ++iter)\n energy += (*iter)->calc_energy(pcon);\n return energy;\n}\n\ntemplate<typename traitsT>\nvoid LocalForceField<traitsT>::reset_parameter(\n const std::string& name, const real_type val)\n{\n for(auto iter = interactions_.begin(); iter != interactions_.end(); ++iter)\n (*iter)->reset_parameter(name, val);\n return;\n}\n\n} \/\/ mjolnir\n#endif \/* MJOLNIR_LOCAL_FORCE_FIELD *\/\n<commit_msg>add LOG output to LocalForceField<commit_after>#ifndef MJOLNIR_LOCAL_FORCE_FIELD\n#define MJOLNIR_LOCAL_FORCE_FIELD\n#include \"LocalInteractionBase.hpp\"\n#include <mjolnir\/util\/logger.hpp>\n#include <utility>\n#include <vector>\n#include <array>\n#include <memory>\n\nnamespace mjolnir\n{\n\ntemplate<typename traitsT>\nclass LocalForceField\n{\n public:\n typedef traitsT traits_type;\n typedef typename traits_type::time_type time_type;\n typedef typename traits_type::real_type real_type;\n typedef typename traits_type::coordinate_type coordinate_type;\n typedef Particle<coordinate_type> particle_type;\n typedef ParticleContainer<traits_type> particle_container_type;\n typedef LocalInteractionBase<traitsT> interaction_type;\n typedef std::unique_ptr<interaction_type> interaction_ptr;\n typedef std::vector<interaction_ptr> container_type;\n\n public:\n\n LocalForceField() = default;\n ~LocalForceField() = default;\n LocalForceField(LocalForceField const&) = delete;\n LocalForceField(LocalForceField&&) = default;\n LocalForceField& operator=(LocalForceField const&) = delete;\n LocalForceField& operator=(LocalForceField&&) = default;\n\n void emplace(interaction_ptr&& interaction);\n\n void calc_force(particle_container_type& pcon);\n real_type calc_energy(const particle_container_type& pcon) const;\n\n void reset_parameter(const std::string&, const real_type);\n\n private:\n\n container_type interactions_;\n static\n Logger& logger_;\n};\n\ntemplate<typename traitsT>\nLogger& LocalForceField<traitsT>::logger_ =\n LoggerManager<char>::get_logger(\"LocalForceField\");\n\ntemplate<typename traitsT>\ninline void LocalForceField<traitsT>::emplace(\n interaction_ptr&& interaction)\n{\n interactions_.emplace_back(std::forward<interaction_ptr>(interaction));\n return;\n}\n\ntemplate<typename traitsT>\nvoid LocalForceField<traitsT>::calc_force(particle_container_type& pcon)\n{\n for(auto iter = interactions_.cbegin(); iter != interactions_.cend(); ++iter)\n (*iter)->calc_force(pcon);\n return;\n}\n\ntemplate<typename traitsT>\ntypename LocalForceField<traitsT>::real_type\nLocalForceField<traitsT>::calc_energy(const particle_container_type& pcon) const\n{\n real_type energy = 0.0;\n for(auto iter = interactions_.cbegin(); iter != interactions_.cend(); ++iter)\n {\n const real_type e = (*iter)->calc_energy(pcon);\n MJOLNIR_LOG_DEBUG(\"calculate energy\", e);\n energy += e;\n }\n return energy;\n}\n\ntemplate<typename traitsT>\nvoid LocalForceField<traitsT>::reset_parameter(\n const std::string& name, const real_type val)\n{\n for(auto iter = interactions_.begin(); iter != interactions_.end(); ++iter)\n (*iter)->reset_parameter(name, val);\n return;\n}\n\n} \/\/ mjolnir\n#endif \/* MJOLNIR_LOCAL_FORCE_FIELD *\/\n<|endoftext|>"} {"text":"<commit_before>#ifndef MJOLNIR_DEFAULT_TRAITS\n#define MJOLNIR_DEFAULT_TRAITS\n#include <mjolnir\/math\/Vector.hpp>\n\nnamespace mjolnir\n{\n\ntemplate<typename realT, typename boundaryT>\nstruct SimulatorTraitsBase\n{\n typedef realT real_type;\n typedef Vector<real_type, 3> coordinate_type;\n typedef coordinate_type position_type;\n typedef boundaryT boundary_type;\n};\n\n} \/\/ mjolnir\n#endif \/* MJOLNIR_DEFAULT_TRAITS *\/\n<commit_msg>assume number of template argument of boundary_type<commit_after>#ifndef MJOLNIR_DEFAULT_TRAITS\n#define MJOLNIR_DEFAULT_TRAITS\n#include <mjolnir\/math\/Vector.hpp>\n\nnamespace mjolnir\n{\n\ntemplate<typename realT, template<typename, typename> class boundaryT>\nstruct SimulatorTraitsBase\n{\n typedef realT real_type;\n typedef Vector<real_type, 3> coordinate_type;\n typedef coordinate_type position_type;\n typedef boundaryT<real_type, coordinate_type> boundary_type;\n};\n\n} \/\/ mjolnir\n#endif \/* MJOLNIR_DEFAULT_TRAITS *\/\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\/renderer\/gpu\/gpu_channel_host.h\"\n\n#include \"base\/message_loop.h\"\n#include \"base\/message_loop_proxy.h\"\n#include \"content\/common\/child_process.h\"\n#include \"content\/common\/gpu\/gpu_messages.h\"\n#include \"content\/renderer\/gpu\/command_buffer_proxy.h\"\n#include \"content\/renderer\/gpu\/transport_texture_service.h\"\n#include \"content\/renderer\/render_process.h\"\n#include \"content\/renderer\/render_thread.h\"\n#include \"googleurl\/src\/gurl.h\"\n#include \"ipc\/ipc_sync_message_filter.h\"\n\nusing base::AutoLock;\nusing base::MessageLoopProxy;\n\nGpuChannelHost::Listener::Listener(\n base::WeakPtr<IPC::Channel::Listener> listener,\n scoped_refptr<base::MessageLoopProxy> loop)\n : listener_(listener),\n loop_(loop) {\n\n}\n\nGpuChannelHost::Listener::~Listener() {\n\n}\n\nvoid GpuChannelHost::Listener::DispatchMessage(const IPC::Message& msg) {\n if (listener_.get())\n listener_->OnMessageReceived(msg);\n}\n\nvoid GpuChannelHost::Listener::DispatchError() {\n if (listener_.get())\n listener_->OnChannelError();\n}\n\nGpuChannelHost::MessageFilter::MessageFilter(GpuChannelHost* parent)\n : parent_(parent) {\n}\n\nGpuChannelHost::MessageFilter::~MessageFilter() {\n\n}\n\nvoid GpuChannelHost::MessageFilter::AddRoute(\n int route_id,\n base::WeakPtr<IPC::Channel::Listener> listener,\n scoped_refptr<MessageLoopProxy> loop) {\n DCHECK(MessageLoop::current() == ChildProcess::current()->io_message_loop());\n DCHECK(listeners_.find(route_id) == listeners_.end());\n listeners_[route_id] = new GpuChannelHost::Listener(listener, loop);\n}\n\nvoid GpuChannelHost::MessageFilter::RemoveRoute(int route_id) {\n DCHECK(MessageLoop::current() == ChildProcess::current()->io_message_loop());\n ListenerMap::iterator it = listeners_.find(route_id);\n if (it != listeners_.end())\n listeners_.erase(it);\n}\n\nbool GpuChannelHost::MessageFilter::OnMessageReceived(\n const IPC::Message& message) {\n DCHECK(MessageLoop::current() == ChildProcess::current()->io_message_loop());\n \/\/ Never handle sync message replies or we will deadlock here.\n if (message.is_reply())\n return false;\n\n DCHECK(message.routing_id() != MSG_ROUTING_CONTROL);\n\n ListenerMap::iterator it = listeners_.find(message.routing_id());\n\n if (it != listeners_.end()) {\n const scoped_refptr<GpuChannelHost::Listener>& listener = it->second;\n listener->loop()->PostTask(\n FROM_HERE,\n NewRunnableMethod(\n listener.get(),\n &GpuChannelHost::Listener::DispatchMessage,\n message));\n }\n\n return true;\n}\n\nvoid GpuChannelHost::MessageFilter::OnChannelError() {\n DCHECK(MessageLoop::current() == ChildProcess::current()->io_message_loop());\n \/\/ Inform all the proxies that an error has occurred. This will be reported\n \/\/ via OpenGL as a lost context.\n for (ListenerMap::iterator it = listeners_.begin();\n it != listeners_.end();\n it++) {\n const scoped_refptr<GpuChannelHost::Listener>& listener = it->second;\n listener->loop()->PostTask(\n FROM_HERE,\n NewRunnableMethod(\n listener.get(),\n &GpuChannelHost::Listener::DispatchError));\n }\n\n listeners_.clear();\n\n ChildThread* main_thread = RenderProcess::current()->main_thread();\n MessageLoop* main_loop = main_thread->message_loop();\n main_loop->PostTask(FROM_HERE,\n NewRunnableMethod(parent_,\n &GpuChannelHost::OnChannelError));\n}\n\nGpuChannelHost::GpuChannelHost()\n : state_(kUnconnected),\n transport_texture_service_(new TransportTextureService()) {\n}\n\nGpuChannelHost::~GpuChannelHost() {\n}\n\nvoid GpuChannelHost::Connect(\n const IPC::ChannelHandle& channel_handle,\n base::ProcessHandle renderer_process_for_gpu) {\n DCHECK(RenderThread::current());\n \/\/ Open a channel to the GPU process. We pass NULL as the main listener here\n \/\/ since we need to filter everything to route it to the right thread.\n channel_.reset(new IPC::SyncChannel(\n channel_handle, IPC::Channel::MODE_CLIENT, NULL,\n ChildProcess::current()->io_message_loop_proxy(), true,\n ChildProcess::current()->GetShutDownEvent()));\n\n sync_filter_ = new IPC::SyncMessageFilter(\n ChildProcess::current()->GetShutDownEvent());\n\n channel_->AddFilter(sync_filter_.get());\n\n channel_->AddFilter(transport_texture_service_.get());\n\n channel_filter_ = new MessageFilter(this);\n\n \/\/ Install the filter last, because we intercept all leftover\n \/\/ messages.\n channel_->AddFilter(channel_filter_.get());\n\n \/\/ It is safe to send IPC messages before the channel completes the connection\n \/\/ and receives the hello message from the GPU process. The messages get\n \/\/ cached.\n state_ = kConnected;\n\n \/\/ Notify the GPU process of our process handle. This gives it the ability\n \/\/ to map renderer handles into the GPU process.\n Send(new GpuChannelMsg_Initialize(renderer_process_for_gpu));\n}\n\nvoid GpuChannelHost::set_gpu_info(const GPUInfo& gpu_info) {\n gpu_info_ = gpu_info;\n}\n\nconst GPUInfo& GpuChannelHost::gpu_info() const {\n return gpu_info_;\n}\n\nvoid GpuChannelHost::SetStateLost() {\n state_ = kLost;\n}\n\nvoid GpuChannelHost::OnChannelError() {\n state_ = kLost;\n\n \/\/ Channel is invalid and will be reinitialized if this host is requested\n \/\/ again.\n channel_.reset();\n}\n\nbool GpuChannelHost::Send(IPC::Message* message) {\n \/\/ The GPU process never sends synchronous IPCs so clear the unblock flag to\n \/\/ preserve order.\n message->set_unblock(false);\n\n \/\/ Unfortunately a sync filter cannot be used on the main (listener) thread.\n \/\/ TODO: Is that true even when we don't install a listener?\n if (RenderThread::current()) {\n if (channel_.get())\n return channel_->Send(message);\n } else {\n return sync_filter_->Send(message);\n }\n\n \/\/ Callee takes ownership of message, regardless of whether Send is\n \/\/ successful. See IPC::Message::Sender.\n delete message;\n return false;\n}\n\nCommandBufferProxy* GpuChannelHost::CreateViewCommandBuffer(\n int render_view_id,\n CommandBufferProxy* share_group,\n const std::string& allowed_extensions,\n const std::vector<int32>& attribs,\n const GURL& active_url) {\n#if defined(ENABLE_GPU)\n AutoLock lock(context_lock_);\n \/\/ An error occurred. Need to get the host again to reinitialize it.\n if (!channel_.get())\n return NULL;\n\n GPUCreateCommandBufferConfig init_params;\n init_params.share_group_id =\n share_group ? share_group->route_id() : MSG_ROUTING_NONE;\n init_params.allowed_extensions = allowed_extensions;\n init_params.attribs = attribs;\n init_params.active_url = active_url;\n int32 route_id;\n if (!RenderThread::current()->Send(\n new GpuHostMsg_CreateViewCommandBuffer(\n render_view_id,\n init_params,\n &route_id))) {\n return NULL;\n }\n\n if (route_id == MSG_ROUTING_NONE)\n return NULL;\n\n CommandBufferProxy* command_buffer = new CommandBufferProxy(this, route_id);\n AddRoute(route_id, command_buffer->AsWeakPtr());\n proxies_[route_id] = command_buffer;\n return command_buffer;\n#else\n return NULL;\n#endif\n}\n\nGpuVideoDecodeAcceleratorHost* GpuChannelHost::CreateVideoDecoder(\n int command_buffer_route_id,\n media::VideoDecodeAccelerator::Profile profile,\n media::VideoDecodeAccelerator::Client* client) {\n AutoLock lock(context_lock_);\n ProxyMap::iterator it = proxies_.find(command_buffer_route_id);\n DCHECK(it != proxies_.end());\n CommandBufferProxy* proxy = it->second;\n return proxy->CreateVideoDecoder(profile, client);\n}\n\nCommandBufferProxy* GpuChannelHost::CreateOffscreenCommandBuffer(\n const gfx::Size& size,\n CommandBufferProxy* share_group,\n const std::string& allowed_extensions,\n const std::vector<int32>& attribs,\n const GURL& active_url) {\n#if defined(ENABLE_GPU)\n AutoLock lock(context_lock_);\n \/\/ An error occurred. Need to get the host again to reinitialize it.\n if (!channel_.get())\n return NULL;\n\n GPUCreateCommandBufferConfig init_params;\n init_params.share_group_id =\n share_group ? share_group->route_id() : MSG_ROUTING_NONE;\n init_params.allowed_extensions = allowed_extensions;\n init_params.attribs = attribs;\n init_params.active_url = active_url;\n int32 route_id;\n if (!Send(new GpuChannelMsg_CreateOffscreenCommandBuffer(size,\n init_params,\n &route_id))) {\n return NULL;\n }\n\n if (route_id == MSG_ROUTING_NONE)\n return NULL;\n\n CommandBufferProxy* command_buffer = new CommandBufferProxy(this, route_id);\n AddRoute(route_id, command_buffer->AsWeakPtr());\n proxies_[route_id] = command_buffer;\n return command_buffer;\n#else\n return NULL;\n#endif\n}\n\nvoid GpuChannelHost::DestroyCommandBuffer(CommandBufferProxy* command_buffer) {\n#if defined(ENABLE_GPU)\n AutoLock lock(context_lock_);\n Send(new GpuChannelMsg_DestroyCommandBuffer(command_buffer->route_id()));\n\n \/\/ Check the proxy has not already been removed after a channel error.\n int route_id = command_buffer->route_id();\n if (proxies_.find(command_buffer->route_id()) != proxies_.end())\n proxies_.erase(route_id);\n RemoveRoute(route_id);\n delete command_buffer;\n#endif\n}\n\nvoid GpuChannelHost::AddRoute(\n int route_id, base::WeakPtr<IPC::Channel::Listener> listener) {\n DCHECK(MessageLoopProxy::current());\n\n MessageLoopProxy* io_loop = RenderProcess::current()->io_message_loop_proxy();\n io_loop->PostTask(FROM_HERE,\n NewRunnableMethod(\n channel_filter_.get(),\n &GpuChannelHost::MessageFilter::AddRoute,\n route_id, listener, MessageLoopProxy::current()));\n}\n\nvoid GpuChannelHost::RemoveRoute(int route_id) {\n MessageLoopProxy* io_loop = RenderProcess::current()->io_message_loop_proxy();\n io_loop->PostTask(FROM_HERE,\n NewRunnableMethod(\n channel_filter_.get(),\n &GpuChannelHost::MessageFilter::RemoveRoute,\n route_id));\n}\n<commit_msg>Fix logic in GpuChannelHost::Send() during shutdown.<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\/renderer\/gpu\/gpu_channel_host.h\"\n\n#include \"base\/message_loop.h\"\n#include \"base\/message_loop_proxy.h\"\n#include \"content\/common\/child_process.h\"\n#include \"content\/common\/gpu\/gpu_messages.h\"\n#include \"content\/renderer\/gpu\/command_buffer_proxy.h\"\n#include \"content\/renderer\/gpu\/transport_texture_service.h\"\n#include \"content\/renderer\/render_process.h\"\n#include \"content\/renderer\/render_thread.h\"\n#include \"googleurl\/src\/gurl.h\"\n#include \"ipc\/ipc_sync_message_filter.h\"\n\nusing base::AutoLock;\nusing base::MessageLoopProxy;\n\nGpuChannelHost::Listener::Listener(\n base::WeakPtr<IPC::Channel::Listener> listener,\n scoped_refptr<base::MessageLoopProxy> loop)\n : listener_(listener),\n loop_(loop) {\n\n}\n\nGpuChannelHost::Listener::~Listener() {\n\n}\n\nvoid GpuChannelHost::Listener::DispatchMessage(const IPC::Message& msg) {\n if (listener_.get())\n listener_->OnMessageReceived(msg);\n}\n\nvoid GpuChannelHost::Listener::DispatchError() {\n if (listener_.get())\n listener_->OnChannelError();\n}\n\nGpuChannelHost::MessageFilter::MessageFilter(GpuChannelHost* parent)\n : parent_(parent) {\n}\n\nGpuChannelHost::MessageFilter::~MessageFilter() {\n\n}\n\nvoid GpuChannelHost::MessageFilter::AddRoute(\n int route_id,\n base::WeakPtr<IPC::Channel::Listener> listener,\n scoped_refptr<MessageLoopProxy> loop) {\n DCHECK(MessageLoop::current() == ChildProcess::current()->io_message_loop());\n DCHECK(listeners_.find(route_id) == listeners_.end());\n listeners_[route_id] = new GpuChannelHost::Listener(listener, loop);\n}\n\nvoid GpuChannelHost::MessageFilter::RemoveRoute(int route_id) {\n DCHECK(MessageLoop::current() == ChildProcess::current()->io_message_loop());\n ListenerMap::iterator it = listeners_.find(route_id);\n if (it != listeners_.end())\n listeners_.erase(it);\n}\n\nbool GpuChannelHost::MessageFilter::OnMessageReceived(\n const IPC::Message& message) {\n DCHECK(MessageLoop::current() == ChildProcess::current()->io_message_loop());\n \/\/ Never handle sync message replies or we will deadlock here.\n if (message.is_reply())\n return false;\n\n DCHECK(message.routing_id() != MSG_ROUTING_CONTROL);\n\n ListenerMap::iterator it = listeners_.find(message.routing_id());\n\n if (it != listeners_.end()) {\n const scoped_refptr<GpuChannelHost::Listener>& listener = it->second;\n listener->loop()->PostTask(\n FROM_HERE,\n NewRunnableMethod(\n listener.get(),\n &GpuChannelHost::Listener::DispatchMessage,\n message));\n }\n\n return true;\n}\n\nvoid GpuChannelHost::MessageFilter::OnChannelError() {\n DCHECK(MessageLoop::current() == ChildProcess::current()->io_message_loop());\n \/\/ Inform all the proxies that an error has occurred. This will be reported\n \/\/ via OpenGL as a lost context.\n for (ListenerMap::iterator it = listeners_.begin();\n it != listeners_.end();\n it++) {\n const scoped_refptr<GpuChannelHost::Listener>& listener = it->second;\n listener->loop()->PostTask(\n FROM_HERE,\n NewRunnableMethod(\n listener.get(),\n &GpuChannelHost::Listener::DispatchError));\n }\n\n listeners_.clear();\n\n ChildThread* main_thread = RenderProcess::current()->main_thread();\n MessageLoop* main_loop = main_thread->message_loop();\n main_loop->PostTask(FROM_HERE,\n NewRunnableMethod(parent_,\n &GpuChannelHost::OnChannelError));\n}\n\nGpuChannelHost::GpuChannelHost()\n : state_(kUnconnected),\n transport_texture_service_(new TransportTextureService()) {\n}\n\nGpuChannelHost::~GpuChannelHost() {\n}\n\nvoid GpuChannelHost::Connect(\n const IPC::ChannelHandle& channel_handle,\n base::ProcessHandle renderer_process_for_gpu) {\n DCHECK(RenderThread::current());\n \/\/ Open a channel to the GPU process. We pass NULL as the main listener here\n \/\/ since we need to filter everything to route it to the right thread.\n channel_.reset(new IPC::SyncChannel(\n channel_handle, IPC::Channel::MODE_CLIENT, NULL,\n ChildProcess::current()->io_message_loop_proxy(), true,\n ChildProcess::current()->GetShutDownEvent()));\n\n sync_filter_ = new IPC::SyncMessageFilter(\n ChildProcess::current()->GetShutDownEvent());\n\n channel_->AddFilter(sync_filter_.get());\n\n channel_->AddFilter(transport_texture_service_.get());\n\n channel_filter_ = new MessageFilter(this);\n\n \/\/ Install the filter last, because we intercept all leftover\n \/\/ messages.\n channel_->AddFilter(channel_filter_.get());\n\n \/\/ It is safe to send IPC messages before the channel completes the connection\n \/\/ and receives the hello message from the GPU process. The messages get\n \/\/ cached.\n state_ = kConnected;\n\n \/\/ Notify the GPU process of our process handle. This gives it the ability\n \/\/ to map renderer handles into the GPU process.\n Send(new GpuChannelMsg_Initialize(renderer_process_for_gpu));\n}\n\nvoid GpuChannelHost::set_gpu_info(const GPUInfo& gpu_info) {\n gpu_info_ = gpu_info;\n}\n\nconst GPUInfo& GpuChannelHost::gpu_info() const {\n return gpu_info_;\n}\n\nvoid GpuChannelHost::SetStateLost() {\n state_ = kLost;\n}\n\nvoid GpuChannelHost::OnChannelError() {\n state_ = kLost;\n\n \/\/ Channel is invalid and will be reinitialized if this host is requested\n \/\/ again.\n channel_.reset();\n}\n\nbool GpuChannelHost::Send(IPC::Message* message) {\n \/\/ The GPU process never sends synchronous IPCs so clear the unblock flag to\n \/\/ preserve order.\n message->set_unblock(false);\n\n \/\/ Currently we need to choose between two different mechanisms for sending.\n \/\/ On the main thread we use the regular channel Send() method, on another\n \/\/ thread we use SyncMessageFilter. We also have to be careful interpreting\n \/\/ RenderThread::current() since it might return NULL during shutdown, while\n \/\/ we are actually calling from the main thread (discard message then).\n \/\/\n \/\/ TODO: Can we just always use sync_filter_ since we setup the channel\n \/\/ without a main listener?\n if (RenderThread::current()) {\n if (channel_.get())\n return channel_->Send(message);\n } else if (MessageLoop::current()) {\n return sync_filter_->Send(message);\n }\n\n \/\/ Callee takes ownership of message, regardless of whether Send is\n \/\/ successful. See IPC::Message::Sender.\n delete message;\n return false;\n}\n\nCommandBufferProxy* GpuChannelHost::CreateViewCommandBuffer(\n int render_view_id,\n CommandBufferProxy* share_group,\n const std::string& allowed_extensions,\n const std::vector<int32>& attribs,\n const GURL& active_url) {\n#if defined(ENABLE_GPU)\n AutoLock lock(context_lock_);\n \/\/ An error occurred. Need to get the host again to reinitialize it.\n if (!channel_.get())\n return NULL;\n\n GPUCreateCommandBufferConfig init_params;\n init_params.share_group_id =\n share_group ? share_group->route_id() : MSG_ROUTING_NONE;\n init_params.allowed_extensions = allowed_extensions;\n init_params.attribs = attribs;\n init_params.active_url = active_url;\n int32 route_id;\n if (!RenderThread::current()->Send(\n new GpuHostMsg_CreateViewCommandBuffer(\n render_view_id,\n init_params,\n &route_id))) {\n return NULL;\n }\n\n if (route_id == MSG_ROUTING_NONE)\n return NULL;\n\n CommandBufferProxy* command_buffer = new CommandBufferProxy(this, route_id);\n AddRoute(route_id, command_buffer->AsWeakPtr());\n proxies_[route_id] = command_buffer;\n return command_buffer;\n#else\n return NULL;\n#endif\n}\n\nGpuVideoDecodeAcceleratorHost* GpuChannelHost::CreateVideoDecoder(\n int command_buffer_route_id,\n media::VideoDecodeAccelerator::Profile profile,\n media::VideoDecodeAccelerator::Client* client) {\n AutoLock lock(context_lock_);\n ProxyMap::iterator it = proxies_.find(command_buffer_route_id);\n DCHECK(it != proxies_.end());\n CommandBufferProxy* proxy = it->second;\n return proxy->CreateVideoDecoder(profile, client);\n}\n\nCommandBufferProxy* GpuChannelHost::CreateOffscreenCommandBuffer(\n const gfx::Size& size,\n CommandBufferProxy* share_group,\n const std::string& allowed_extensions,\n const std::vector<int32>& attribs,\n const GURL& active_url) {\n#if defined(ENABLE_GPU)\n AutoLock lock(context_lock_);\n \/\/ An error occurred. Need to get the host again to reinitialize it.\n if (!channel_.get())\n return NULL;\n\n GPUCreateCommandBufferConfig init_params;\n init_params.share_group_id =\n share_group ? share_group->route_id() : MSG_ROUTING_NONE;\n init_params.allowed_extensions = allowed_extensions;\n init_params.attribs = attribs;\n init_params.active_url = active_url;\n int32 route_id;\n if (!Send(new GpuChannelMsg_CreateOffscreenCommandBuffer(size,\n init_params,\n &route_id))) {\n return NULL;\n }\n\n if (route_id == MSG_ROUTING_NONE)\n return NULL;\n\n CommandBufferProxy* command_buffer = new CommandBufferProxy(this, route_id);\n AddRoute(route_id, command_buffer->AsWeakPtr());\n proxies_[route_id] = command_buffer;\n return command_buffer;\n#else\n return NULL;\n#endif\n}\n\nvoid GpuChannelHost::DestroyCommandBuffer(CommandBufferProxy* command_buffer) {\n#if defined(ENABLE_GPU)\n AutoLock lock(context_lock_);\n Send(new GpuChannelMsg_DestroyCommandBuffer(command_buffer->route_id()));\n\n \/\/ Check the proxy has not already been removed after a channel error.\n int route_id = command_buffer->route_id();\n if (proxies_.find(command_buffer->route_id()) != proxies_.end())\n proxies_.erase(route_id);\n RemoveRoute(route_id);\n delete command_buffer;\n#endif\n}\n\nvoid GpuChannelHost::AddRoute(\n int route_id, base::WeakPtr<IPC::Channel::Listener> listener) {\n DCHECK(MessageLoopProxy::current());\n\n MessageLoopProxy* io_loop = RenderProcess::current()->io_message_loop_proxy();\n io_loop->PostTask(FROM_HERE,\n NewRunnableMethod(\n channel_filter_.get(),\n &GpuChannelHost::MessageFilter::AddRoute,\n route_id, listener, MessageLoopProxy::current()));\n}\n\nvoid GpuChannelHost::RemoveRoute(int route_id) {\n MessageLoopProxy* io_loop = RenderProcess::current()->io_message_loop_proxy();\n io_loop->PostTask(FROM_HERE,\n NewRunnableMethod(\n channel_filter_.get(),\n &GpuChannelHost::MessageFilter::RemoveRoute,\n route_id));\n}\n<|endoftext|>"} {"text":"<commit_before>\/\/-----------------------------------------------\n\/\/\n\/\/\tThis file is part of the Siv3D Engine.\n\/\/\n\/\/\tCopyright (c) 2008-2019 Ryo Suzuki\n\/\/\tCopyright (c) 2016-2019 OpenSiv3D Project\n\/\/\n\/\/\tLicensed under the MIT License.\n\/\/\n\/\/-----------------------------------------------\n\n# include <Siv3D\/Camera3D.hpp>\n# include <Siv3D\/Print.hpp>\n\nnamespace s3d::experimental\n{\n\tBasicCamera3D::BasicCamera3D(const Size& sceneSize, const double fov, const Vec3& eyePosition, const Vec3& focusPosition, const Vec3& upDirection) noexcept\n\t\t: m_eyePosition(eyePosition)\n\t\t, m_focusPosition(focusPosition)\n\t\t, m_upDirection(upDirection)\n\t\t, m_sceneSize(sceneSize)\n\t\t, m_fov(fov)\n\t{\n\t\tupdateProj();\n\t\tupdateView();\n\t\tupdateViewProj();\n\t}\n\n\tvoid BasicCamera3D::setProjection(const Size& sceneSize, const double fov, const double nearClip, const double farClip)\n\t{\n\t\tm_sceneSize\t= sceneSize;\n\t\tm_fov\t\t= fov;\n\t\tm_nearClip\t= nearClip;\n\t\tm_farClip\t= farClip;\n\n\t\tupdateProj();\n\t\tupdateViewProj();\n\t}\n\n\tvoid BasicCamera3D::setView(const Vec3& eyePosition, const Vec3& focusPosition, const Vec3& upDirection) noexcept\n\t{\n\t\tm_eyePosition\t= eyePosition;\n\t\tm_focusPosition\t= focusPosition;\n\t\tm_upDirection\t= upDirection;\n\n\t\tupdateView();\n\t\tupdateViewProj();\n\t}\n\n\tFloat3 BasicCamera3D::worldToScreenPoint(const Float3& pos) const noexcept\n\t{\n\t\tFloat3 v = SIMD::Vector3TransformCoord(SIMD_Float4(pos, 0.0f), m_viewProj).xyz();\n\t\tv.x += 1.0f;\n\t\tv.y += 1.0f;\n\t\tv.x *= 0.5f * m_sceneSize.x;\n\t\tv.y *= 0.5f;\n\t\tv.y = 1.0f - v.y;\n\t\tv.y *= m_sceneSize.y;\n\t\treturn v;\n\t}\n\n\tFloat3 BasicCamera3D::screenToWorldPoint(const Float2& pos, float depth) const noexcept\n\t{\n\t\tFloat3 v(pos, depth);\n\t\tv.x \/= (m_sceneSize.x * 0.5f);\n\t\tv.y \/= (m_sceneSize.y * 0.5f);\n\t\tv.x -= 1.0f;\n\t\tv.y -= 1.0f;\n\t\tv.y *= -1.0f;\n\n\t\tconst __m128 worldPos = SIMD::Vector3TransformCoord(SIMD_Float4(v, 0.0f), m_invViewProj);\n\n\t\tFloat3 result;\n\t\tSIMD::StoreFloat3(&result, worldPos);\n\n\t\treturn result;\n\t}\n\n\tRay BasicCamera3D::screenToRay(const Vec2& pos) const noexcept\n\t{\n\t\tconst Vec3 rayEnd = screenToWorldPoint(pos, 0.9f);\n\t\n\t\treturn Ray(m_eyePosition, (rayEnd - m_eyePosition).normalized());\n\t}\n\n\tvoid BasicCamera3D::updateProj()\n\t{\n\t\tconst float aspectRatio\t= static_cast<float>(m_sceneSize.x) \/ m_sceneSize.y;\n\t\tconst float fov\t\t\t= static_cast<float>(m_fov);\n\t\tconst float nearClip\t= static_cast<float>(m_nearClip);\n\t\tconst float farClip\t\t= static_cast<float>(m_farClip);\n\t\tm_proj = Mat4x4::PerspectiveFovLH_ZO(fov, aspectRatio, nearClip, farClip);\n\t}\n\n\tvoid BasicCamera3D::updateView()\n\t{\n\t\tconst SIMD_Float4 eyePosition(m_eyePosition, 0.0f);\n\t\tconst SIMD_Float4 focusPosition(m_focusPosition, 0.0f);\n\t\tconst SIMD_Float4 upDirection(m_upDirection, 0.0f);\n\t\tm_view = Mat4x4::LookAtLH(eyePosition, focusPosition, upDirection);\n\t}\n\n\tvoid BasicCamera3D::updateViewProj()\n\t{\n\t\tm_viewProj = m_view * m_proj;\n\t\tm_invViewProj = m_viewProj.inverse();\n\t}\n}\n<commit_msg>fix warning<commit_after>\/\/-----------------------------------------------\n\/\/\n\/\/\tThis file is part of the Siv3D Engine.\n\/\/\n\/\/\tCopyright (c) 2008-2019 Ryo Suzuki\n\/\/\tCopyright (c) 2016-2019 OpenSiv3D Project\n\/\/\n\/\/\tLicensed under the MIT License.\n\/\/\n\/\/-----------------------------------------------\n\n# include <Siv3D\/Camera3D.hpp>\n# include <Siv3D\/Print.hpp>\n\nnamespace s3d::experimental\n{\n\tBasicCamera3D::BasicCamera3D(const Size& sceneSize, const double fov, const Vec3& eyePosition, const Vec3& focusPosition, const Vec3& upDirection) noexcept\n\t\t: m_sceneSize(sceneSize)\n\t\t, m_fov(fov)\n\t\t, m_eyePosition(eyePosition)\n\t\t, m_focusPosition(focusPosition)\n\t\t, m_upDirection(upDirection)\n\t{\n\t\tupdateProj();\n\t\tupdateView();\n\t\tupdateViewProj();\n\t}\n\n\tvoid BasicCamera3D::setProjection(const Size& sceneSize, const double fov, const double nearClip, const double farClip)\n\t{\n\t\tm_sceneSize\t= sceneSize;\n\t\tm_fov\t\t= fov;\n\t\tm_nearClip\t= nearClip;\n\t\tm_farClip\t= farClip;\n\n\t\tupdateProj();\n\t\tupdateViewProj();\n\t}\n\n\tvoid BasicCamera3D::setView(const Vec3& eyePosition, const Vec3& focusPosition, const Vec3& upDirection) noexcept\n\t{\n\t\tm_eyePosition\t= eyePosition;\n\t\tm_focusPosition\t= focusPosition;\n\t\tm_upDirection\t= upDirection;\n\n\t\tupdateView();\n\t\tupdateViewProj();\n\t}\n\n\tFloat3 BasicCamera3D::worldToScreenPoint(const Float3& pos) const noexcept\n\t{\n\t\tFloat3 v = SIMD::Vector3TransformCoord(SIMD_Float4(pos, 0.0f), m_viewProj).xyz();\n\t\tv.x += 1.0f;\n\t\tv.y += 1.0f;\n\t\tv.x *= 0.5f * m_sceneSize.x;\n\t\tv.y *= 0.5f;\n\t\tv.y = 1.0f - v.y;\n\t\tv.y *= m_sceneSize.y;\n\t\treturn v;\n\t}\n\n\tFloat3 BasicCamera3D::screenToWorldPoint(const Float2& pos, float depth) const noexcept\n\t{\n\t\tFloat3 v(pos, depth);\n\t\tv.x \/= (m_sceneSize.x * 0.5f);\n\t\tv.y \/= (m_sceneSize.y * 0.5f);\n\t\tv.x -= 1.0f;\n\t\tv.y -= 1.0f;\n\t\tv.y *= -1.0f;\n\n\t\tconst __m128 worldPos = SIMD::Vector3TransformCoord(SIMD_Float4(v, 0.0f), m_invViewProj);\n\n\t\tFloat3 result;\n\t\tSIMD::StoreFloat3(&result, worldPos);\n\n\t\treturn result;\n\t}\n\n\tRay BasicCamera3D::screenToRay(const Vec2& pos) const noexcept\n\t{\n\t\tconst Vec3 rayEnd = screenToWorldPoint(pos, 0.9f);\n\t\n\t\treturn Ray(m_eyePosition, (rayEnd - m_eyePosition).normalized());\n\t}\n\n\tvoid BasicCamera3D::updateProj()\n\t{\n\t\tconst float aspectRatio\t= static_cast<float>(m_sceneSize.x) \/ m_sceneSize.y;\n\t\tconst float fov\t\t\t= static_cast<float>(m_fov);\n\t\tconst float nearClip\t= static_cast<float>(m_nearClip);\n\t\tconst float farClip\t\t= static_cast<float>(m_farClip);\n\t\tm_proj = Mat4x4::PerspectiveFovLH_ZO(fov, aspectRatio, nearClip, farClip);\n\t}\n\n\tvoid BasicCamera3D::updateView()\n\t{\n\t\tconst SIMD_Float4 eyePosition(m_eyePosition, 0.0f);\n\t\tconst SIMD_Float4 focusPosition(m_focusPosition, 0.0f);\n\t\tconst SIMD_Float4 upDirection(m_upDirection, 0.0f);\n\t\tm_view = Mat4x4::LookAtLH(eyePosition, focusPosition, upDirection);\n\t}\n\n\tvoid BasicCamera3D::updateViewProj()\n\t{\n\t\tm_viewProj = m_view * m_proj;\n\t\tm_invViewProj = m_viewProj.inverse();\n\t}\n}\n<|endoftext|>"} {"text":"<commit_before>#include <algorithm>\n#include <map>\n#include <math.h>\n#include <mpi.h>\n#include <stdio.h>\n#include <stdlib.h>\n#include <sys\/time.h>\n#include <time.h>\n\n#include <fj_tool\/fapp.h>\n#include <fjcoll.h>\n\nusing namespace std;\n\n#include \"pearson-3d.h\"\n\nbool EXTEND_MISSION=false;\nint T_MAX;\nint T_MONITOR;\nint mpi_my_rank;\nconst double PI=3.14159265358979323846;\n\n\nfloat frand() {\n return rand() \/ float(RAND_MAX);\n}\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 void init() {\n for(int ix = navi.lower_x; ix < navi.upper_x; ++ix) {\n for(int iy = navi.lower_y; iy < navi.upper_y; ++iy) {\n for(int iz = navi.lower_z; iz < navi.upper_z; ++iz) {\n double x = double(navi.offset_x + ix)\/NX;\n double y = double(navi.offset_y + iy)\/NY;\n double z = double(navi.offset_z + iz)\/NZ;\n U[ix][iy][iz] = 1.0;\n V[ix][iy][iz] = 0.0;\n if (z > 0.49 && z < 0.51 && x > 0.4 && x < 0.6) {\n U[ix][iy][iz] = 0.5;\n V[ix][iy][iz] = 0.25;\n }\n }\n }\n }\n }*\/\n\n\ndouble gaussian(double x, double y,double z) {\n return exp(- (x*x+y*y+z*z) \/ 25.0);\n}\n\ntypedef pair<int,pair<int,int> > Key;\nvoid init() {\n if (NZ<500){\n for(int ix = navi.lower_x; ix < navi.upper_x; ++ix) {\n for(int iy = navi.lower_y; iy < navi.upper_y; ++iy) {\n for(int iz = navi.lower_z; iz < navi.upper_z; ++iz) {\n U[ix][iy][iz] = 1.0;\n V[ix][iy][iz] = 0.0;\n int oy = 131;\n double g\n = gaussian(iz-50, ix-230 ,iy-oy)\n + gaussian(iz-80, ix-80 ,iy-oy)\n + gaussian(iz-120,ix-40 ,iy-oy)\n + gaussian(iz-190,ix-170 ,iy-oy);\n\n U[ix][iy][iz] -= 0.5 *g;\n V[ix][iy][iz] += 0.5 *g*(1 + 0.01*frand());\n\n }\n }\n }\n }else{\n map<Key ,double> seeds;\n for(int ix = navi.lower_x; ix < navi.upper_x; ++ix) {\n for(int iy = navi.lower_y; iy < navi.upper_y; ++iy) {\n for(int iz = navi.lower_z; iz < navi.upper_z; ++iz) {\n Key k (ix\/16, pair<int,int>(iy\/16, iz\/16));\n U[ix][iy][iz] = 1.0;\n V[ix][iy][iz] = 0.0;\n double s = seeds[k];\n if (s==0) {\n s = frand();\n seeds[k]=s;\n }\n if (s < 0.1 ) {\n U[ix][iy][iz] = 0.5;\n V[ix][iy][iz] = 0.25;\n }\n }\n }\n }\n }\n}\nvoid write_monitor() {\n int global_position[6];\n global_position[0] = navi.offset_x + navi.lower_x;\n global_position[1] = navi.offset_y + navi.lower_y;\n global_position[2] = navi.offset_z + navi.lower_z;\n global_position[3] = navi.upper_x - navi.lower_x;\n global_position[4] = navi.upper_y - navi.lower_y;\n global_position[5] = navi.upper_z - navi.lower_z;\n int x_size = navi.upper_x - navi.lower_x;\n int y_size = navi.upper_y - navi.lower_y;\n int z_size = navi.upper_z - navi.lower_z;\n\n if (navi.offset_x + navi.lower_x == 0) {\n char fn[256];\n sprintf(fn, \"out\/monitorX-%06d-%d.txt\", navi.time_step, mpi_my_rank);\n\n FILE *fp = fopen(fn,\"wb\");\n fwrite(global_position, sizeof(int), 6, fp);\n {\n const int x=navi.lower_x + x_size\/2;\n for(int y = navi.lower_y; y < navi.upper_y; ++y) fwrite(U[x][y]+navi.lower_z, sizeof(double),z_size, fp);\n for(int y = navi.lower_y; y < navi.upper_y; ++y) fwrite(V[x][y]+navi.lower_z, sizeof(double),z_size, fp);\n }\n fclose(fp);\n }\n\n\n if (navi.offset_y + navi.lower_y == 0) {\n char fn[256];\n sprintf(fn, \"out\/monitorY-%06d-%d.txt\", navi.time_step, mpi_my_rank);\n\n FILE *fp = fopen(fn,\"wb\");\n fwrite(global_position, sizeof(int), 6, fp);\n {\n const int y=navi.lower_y + y_size\/2;\n for(int x = navi.lower_x; x < navi.upper_x; ++x) fwrite(U[x][y]+navi.lower_z, sizeof(double),z_size, fp);\n for(int x = navi.lower_x; x < navi.upper_x; ++x) fwrite(V[x][y]+navi.lower_z, sizeof(double),z_size, fp);\n }\n fclose(fp);\n }\n\n}\n\n\nint main (int argc, char **argv) {\n MPI_Init(&argc, &argv);\n Formura_Init(&navi, MPI_COMM_WORLD);\n MPI_Comm_rank(MPI_COMM_WORLD, &mpi_my_rank);\n srand(time(NULL)+mpi_my_rank*65537);\n\n\n\n if (argc <= 1) {\n T_MAX=8192;\n }else{\n sscanf(argv[1], \"%d\", &T_MAX);\n }\n if (argc <= 2) {\n T_MONITOR=8192;\n }else{\n sscanf(argv[2], \"%d\", &T_MONITOR);\n }\n if (argc >= 4) {\n EXTEND_MISSION = true;\n }\n\n init();\n\n double t_begin = wctime(), t_end;\n\n int last_monitor_t = -T_MONITOR;\n char benchmark_name[256];\n sprintf(benchmark_name,\"main\");\n for(;;){\n double t = wctime();\n bool monitor_flag = navi.time_step >= last_monitor_t + T_MONITOR;\n if(monitor_flag || navi.time_step <= 3 * T_MONITOR ) {\n if(mpi_my_rank==0){\n printf(\"marked %d step @ %lf sec\\n\", navi.time_step, t-t_begin);\n }\n }\n if(monitor_flag) {\n write_monitor();\n if(mpi_my_rank==0){\n printf(\"monitor %d step @ %lf sec\\n\", navi.time_step, t-t_begin);\n }\n }\n if(monitor_flag) {\n last_monitor_t += T_MONITOR;\n }\n\n if (navi.time_step >= T_MAX) {\n if (EXTEND_MISSION){\n T_MAX*=2;\n T_MONITOR*=2;\n sprintf(benchmark_name,\"extend-%d\",T_MAX);\n \/\/start_collection(benchmark_name);\n fapp_start(benchmark_name, 0,0);\n }else{\n break;\n }\n\n }\n if (navi.time_step == 0) {\n t_begin = wctime();\n \/\/start_collection(benchmark_name);\n fapp_start(benchmark_name, 0,0);\n }\n\n Formura_Forward(&navi); \/\/ navi.time_step increases\n MPI_Barrier(MPI_COMM_WORLD); \/\/ TODO: test the effect of synchronization\n\n\n if (navi.time_step >= T_MAX) {\n t_end = wctime();\n \/\/stop_collection(benchmark_name);\n fapp_stop(benchmark_name, 0,0);\n }\n }\n \/\/printf(\"total wct = %lf sec\\n\",t_end - t_begin);\n\n MPI_Barrier(MPI_COMM_WORLD);\n MPI_Finalize();\n}\n<commit_msg>make the initial colony bigger<commit_after>#include <algorithm>\n#include <map>\n#include <math.h>\n#include <mpi.h>\n#include <stdio.h>\n#include <stdlib.h>\n#include <sys\/time.h>\n#include <time.h>\n\n#include <fj_tool\/fapp.h>\n#include <fjcoll.h>\n\nusing namespace std;\n\n#include \"pearson-3d.h\"\n\nbool EXTEND_MISSION=false;\nint T_MAX;\nint T_MONITOR;\nint mpi_my_rank;\nconst double PI=3.14159265358979323846;\n\n\nfloat frand() {\n return rand() \/ float(RAND_MAX);\n}\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 void init() {\n for(int ix = navi.lower_x; ix < navi.upper_x; ++ix) {\n for(int iy = navi.lower_y; iy < navi.upper_y; ++iy) {\n for(int iz = navi.lower_z; iz < navi.upper_z; ++iz) {\n double x = double(navi.offset_x + ix)\/NX;\n double y = double(navi.offset_y + iy)\/NY;\n double z = double(navi.offset_z + iz)\/NZ;\n U[ix][iy][iz] = 1.0;\n V[ix][iy][iz] = 0.0;\n if (z > 0.49 && z < 0.51 && x > 0.4 && x < 0.6) {\n U[ix][iy][iz] = 0.5;\n V[ix][iy][iz] = 0.25;\n }\n }\n }\n }\n }*\/\n\n\ndouble gaussian(double x, double y,double z) {\n return exp(- (x*x+y*y+z*z) \/ 100.0);\n}\n\ntypedef pair<int,pair<int,int> > Key;\nvoid init() {\n if (NZ<500){\n for(int ix = navi.lower_x; ix < navi.upper_x; ++ix) {\n for(int iy = navi.lower_y; iy < navi.upper_y; ++iy) {\n for(int iz = navi.lower_z; iz < navi.upper_z; ++iz) {\n U[ix][iy][iz] = 1.0;\n V[ix][iy][iz] = 0.0;\n int oy = 131;\n double g\n = gaussian(iz-50, ix-230 ,iy-oy)\n + gaussian(iz-80, ix-80 ,iy-oy)\n + gaussian(iz-120,ix-40 ,iy-oy)\n + gaussian(iz-190,ix-170 ,iy-oy);\n\n U[ix][iy][iz] -= 0.5 *g;\n V[ix][iy][iz] += 0.5 *g*(1 + 0.01*frand());\n\n }\n }\n }\n }else{\n map<Key ,double> seeds;\n for(int ix = navi.lower_x; ix < navi.upper_x; ++ix) {\n for(int iy = navi.lower_y; iy < navi.upper_y; ++iy) {\n for(int iz = navi.lower_z; iz < navi.upper_z; ++iz) {\n Key k (ix\/16, pair<int,int>(iy\/16, iz\/16));\n U[ix][iy][iz] = 1.0;\n V[ix][iy][iz] = 0.0;\n double s = seeds[k];\n if (s==0) {\n s = frand();\n seeds[k]=s;\n }\n if (s < 0.1 ) {\n U[ix][iy][iz] = 0.5;\n V[ix][iy][iz] = 0.25;\n }\n }\n }\n }\n }\n}\nvoid write_monitor() {\n int global_position[6];\n global_position[0] = navi.offset_x + navi.lower_x;\n global_position[1] = navi.offset_y + navi.lower_y;\n global_position[2] = navi.offset_z + navi.lower_z;\n global_position[3] = navi.upper_x - navi.lower_x;\n global_position[4] = navi.upper_y - navi.lower_y;\n global_position[5] = navi.upper_z - navi.lower_z;\n int x_size = navi.upper_x - navi.lower_x;\n int y_size = navi.upper_y - navi.lower_y;\n int z_size = navi.upper_z - navi.lower_z;\n\n if (navi.offset_x + navi.lower_x == 0) {\n char fn[256];\n sprintf(fn, \"out\/monitorX-%06d-%d.txt\", navi.time_step, mpi_my_rank);\n\n FILE *fp = fopen(fn,\"wb\");\n fwrite(global_position, sizeof(int), 6, fp);\n {\n const int x=navi.lower_x + x_size\/2;\n for(int y = navi.lower_y; y < navi.upper_y; ++y) fwrite(U[x][y]+navi.lower_z, sizeof(double),z_size, fp);\n for(int y = navi.lower_y; y < navi.upper_y; ++y) fwrite(V[x][y]+navi.lower_z, sizeof(double),z_size, fp);\n }\n fclose(fp);\n }\n\n\n if (navi.offset_y + navi.lower_y == 0) {\n char fn[256];\n sprintf(fn, \"out\/monitorY-%06d-%d.txt\", navi.time_step, mpi_my_rank);\n\n FILE *fp = fopen(fn,\"wb\");\n fwrite(global_position, sizeof(int), 6, fp);\n {\n const int y=navi.lower_y + y_size\/2;\n for(int x = navi.lower_x; x < navi.upper_x; ++x) fwrite(U[x][y]+navi.lower_z, sizeof(double),z_size, fp);\n for(int x = navi.lower_x; x < navi.upper_x; ++x) fwrite(V[x][y]+navi.lower_z, sizeof(double),z_size, fp);\n }\n fclose(fp);\n }\n\n}\n\n\nint main (int argc, char **argv) {\n MPI_Init(&argc, &argv);\n Formura_Init(&navi, MPI_COMM_WORLD);\n MPI_Comm_rank(MPI_COMM_WORLD, &mpi_my_rank);\n srand(time(NULL)+mpi_my_rank*65537);\n\n\n\n if (argc <= 1) {\n T_MAX=8192;\n }else{\n sscanf(argv[1], \"%d\", &T_MAX);\n }\n if (argc <= 2) {\n T_MONITOR=8192;\n }else{\n sscanf(argv[2], \"%d\", &T_MONITOR);\n }\n if (argc >= 4) {\n EXTEND_MISSION = true;\n }\n\n init();\n\n double t_begin = wctime(), t_end;\n\n int last_monitor_t = -T_MONITOR;\n char benchmark_name[256];\n sprintf(benchmark_name,\"main\");\n for(;;){\n double t = wctime();\n bool monitor_flag = navi.time_step >= last_monitor_t + T_MONITOR;\n if(monitor_flag || navi.time_step <= 3 * T_MONITOR ) {\n if(mpi_my_rank==0){\n printf(\"marked %d step @ %lf sec\\n\", navi.time_step, t-t_begin);\n }\n }\n if(monitor_flag) {\n write_monitor();\n if(mpi_my_rank==0){\n printf(\"monitor %d step @ %lf sec\\n\", navi.time_step, t-t_begin);\n }\n }\n if(monitor_flag) {\n last_monitor_t += T_MONITOR;\n }\n\n if (navi.time_step >= T_MAX) {\n if (EXTEND_MISSION){\n T_MAX*=2;\n T_MONITOR*=2;\n sprintf(benchmark_name,\"extend-%d\",T_MAX);\n \/\/start_collection(benchmark_name);\n fapp_start(benchmark_name, 0,0);\n }else{\n break;\n }\n\n }\n if (navi.time_step == 0) {\n t_begin = wctime();\n \/\/start_collection(benchmark_name);\n fapp_start(benchmark_name, 0,0);\n }\n\n Formura_Forward(&navi); \/\/ navi.time_step increases\n MPI_Barrier(MPI_COMM_WORLD); \/\/ TODO: test the effect of synchronization\n\n\n if (navi.time_step >= T_MAX) {\n t_end = wctime();\n \/\/stop_collection(benchmark_name);\n fapp_stop(benchmark_name, 0,0);\n }\n }\n \/\/printf(\"total wct = %lf sec\\n\",t_end - t_begin);\n\n MPI_Barrier(MPI_COMM_WORLD);\n MPI_Finalize();\n}\n<|endoftext|>"} {"text":"<commit_before>#include \"Python.h\"\n#include \"sqlite3.h\"\n#include <cstdint>\n#include <pybind11\/pybind11.h>\n\nnamespace py = pybind11;\n\n\/\/ Assume the pysqlite_Connection object's first non-PyObject member is the\n\/\/ sqlite3 database\nstruct Connection {\n PyObject_HEAD sqlite3 *db;\n};\n\nPYBIND11_MODULE(cslumba, m) {\n m.attr(\"SQLITE_NULL\") = SQLITE_NULL;\n m.attr(\"SQLITE_OK\") = SQLITE_OK;\n m.attr(\"SQLITE_DETERMINISTIC\") = SQLITE_DETERMINISTIC;\n m.attr(\"SQLITE_UTF8\") = SQLITE_UTF8;\n m.attr(\"SQLITE_VERSION\") = SQLITE_VERSION;\n\n m.def(\n \"get_sqlite_db\",\n [](py::object connection) {\n return reinterpret_cast<std::intptr_t>(\n reinterpret_cast<Connection *>(connection.ptr())->db);\n },\n \"Get the address of the sqlite3* db instance\", py::arg(\"connection\"));\n}\n<commit_msg>fix: fix the pointer type of the connection pointer<commit_after>#include \"Python.h\"\n#include \"sqlite3.h\"\n#include <cstdint>\n#include <pybind11\/pybind11.h>\n\nnamespace py = pybind11;\n\n\/\/ Assume the pysqlite_Connection object's first non-PyObject member is the\n\/\/ sqlite3 database\nstruct Connection {\n PyObject_HEAD sqlite3 *db;\n};\n\nPYBIND11_MODULE(cslumba, m) {\n m.attr(\"SQLITE_NULL\") = SQLITE_NULL;\n m.attr(\"SQLITE_OK\") = SQLITE_OK;\n m.attr(\"SQLITE_DETERMINISTIC\") = SQLITE_DETERMINISTIC;\n m.attr(\"SQLITE_UTF8\") = SQLITE_UTF8;\n m.attr(\"SQLITE_VERSION\") = SQLITE_VERSION;\n\n m.def(\n \"get_sqlite_db\",\n [](py::object connection) {\n return reinterpret_cast<std::uintptr_t>(\n reinterpret_cast<Connection *>(connection.ptr())->db);\n },\n \"Get the address of the sqlite3* db instance\", py::arg(\"connection\"));\n}\n<|endoftext|>"} {"text":"<commit_before>\/*\n * Copyright (C) 2014-2015 Pavel Dolgov\n *\n * See the LICENSE file for terms of use.\n *\/\n\n#ifndef CONSTANTS_HPP_\n#define CONSTANTS_HPP_\n\n\/** Minimum width\/length of game board *\/\nconst int MIN_WIDTH = 3;\n\n\/** Maximum width\/length of game board *\/\nconst int MAX_WIDTH = 16;\n\n#endif\n<commit_msg>Add min\/max number of minutes; score to constants<commit_after>\/*\n * Copyright (C) 2014-2015 Pavel Dolgov\n *\n * See the LICENSE file for terms of use.\n *\/\n\n#ifndef CONSTANTS_HPP_\n#define CONSTANTS_HPP_\n\n\/** Minimum width\/length of game board *\/\nconst int MIN_WIDTH = 3;\n\n\/** Maximum width\/length of game board *\/\nconst int MAX_WIDTH = 16;\n\n\/** Minimum number of minutes to play *\/\nconst int MIN_TIME = 1;\n\n\/** Maximum number of minutes to play *\/\nconst int MAX_TIME = 1000;\n\n\/** Minimum winning score *\/\nconst int MIN_SCORE = 10;\n\n\/** Maximum winning score *\/\nconst int MAX_SCORE = 9999999;\n\n#endif\n<|endoftext|>"} {"text":"<commit_before><commit_msg>Enable configuration checkbox \"Warn if my sender address is not in included in the certificate I want to use for signing.<commit_after><|endoftext|>"} {"text":"<commit_before>\/\/ Copyright (c) 2022 Ultimaker B.V.\n\/\/ CuraEngine is released under the terms of the AGPLv3 or higher.\n\n#include \"WallsComputation.h\" \/\/Unit under test.\n#include \"InsetOrderOptimizer.h\" \/\/Unit also under test.\n#include \"settings\/Settings.h\" \/\/Settings to generate walls with.\n#include \"sliceDataStorage.h\" \/\/Sl\n#include \"utils\/polygon.h\" \/\/To create example polygons.\n#include <gtest\/gtest.h>\n#include <unordered_set>\n\n#ifdef WALLS_COMPUTATION_TEST_SVG_OUTPUT\n#include \"utils\/SVG.h\"\n#include \"utils\/polygon.h\"\n#include <cstdlib>\n#endif \/\/ WALLS_COMPUTATION_TEST_SVG_OUTPUT\n\n\/\/ NOLINTBEGIN(*-magic-numbers)\nnamespace cura\n{\n\/*!\n * Fixture that provides a basis for testing wall computation.\n *\/\nclass WallsComputationTest : public testing::Test\n{\npublic:\n \/*!\n * Settings to slice with. This is linked in the walls_computation fixture.\n *\/\n Settings settings;\n\n \/*!\n * WallsComputation instance to test with. The layer index will be 100.\n *\/\n WallsComputation walls_computation;\n\n \/*!\n * Basic 10x10mm square shape to work with.\n *\/\n Polygons square_shape;\n\n \/*!\n * A rectangle enclosing two triangular holes;\n *\/\n Polygons ff_holes;\n\n WallsComputationTest() : walls_computation(settings, LayerIndex(100))\n {\n square_shape.emplace_back();\n square_shape.back().emplace_back(0, 0);\n square_shape.back().emplace_back(MM2INT(10), 0);\n square_shape.back().emplace_back(MM2INT(10), MM2INT(10));\n square_shape.back().emplace_back(0, MM2INT(10));\n\n ff_holes.emplace_back();\n ff_holes.back().emplace_back(0, 0);\n ff_holes.back().emplace_back(10000, 0);\n ff_holes.back().emplace_back(10000, 5000);\n ff_holes.back().emplace_back(0, 5000);\n ff_holes.emplace_back();\n ff_holes.back().emplace_back(1000, 1000);\n ff_holes.back().emplace_back(1000, 4000);\n ff_holes.back().emplace_back(4000, 2500);\n ff_holes.emplace_back();\n ff_holes.back().emplace_back(6000, 1000);\n ff_holes.back().emplace_back(6000, 4000);\n ff_holes.back().emplace_back(9000, 2500);\n\n \/\/ Settings for a simple 2 walls, about as basic as possible.\n settings.add(\"alternate_extra_perimeter\", \"false\");\n settings.add(\"fill_outline_gaps\", \"false\");\n settings.add(\"initial_layer_line_width_factor\", \"100\");\n settings.add(\"magic_spiralize\", \"false\");\n settings.add(\"meshfix_maximum_deviation\", \"0.1\");\n settings.add(\"meshfix_maximum_extrusion_area_deviation\", \"0.01\");\n settings.add(\"meshfix_maximum_resolution\", \"0.01\");\n settings.add(\"min_bead_width\", \"0\");\n settings.add(\"min_feature_size\", \"0\");\n settings.add(\"wall_0_extruder_nr\", \"0\");\n settings.add(\"wall_0_inset\", \"0\");\n settings.add(\"wall_line_count\", \"2\");\n settings.add(\"wall_line_width_0\", \"0.4\");\n settings.add(\"wall_line_width_x\", \"0.4\");\n settings.add(\"wall_transition_angle\", \"10\");\n settings.add(\"wall_transition_filter_distance\", \"1\");\n settings.add(\"wall_transition_filter_deviation\", \".2\");\n settings.add(\"wall_transition_length\", \"1\");\n settings.add(\"wall_x_extruder_nr\", \"0\");\n settings.add(\"wall_distribution_count\", \"2\");\n }\n};\n\n\/*!\n * Tests if something is generated in the basic happy case.\n *\/\nTEST_F(WallsComputationTest, GenerateWallsForLayerSinglePart)\n{\n SliceLayer layer;\n layer.parts.emplace_back();\n SliceLayerPart& part = layer.parts.back();\n part.outline.add(square_shape);\n\n \/\/ Run the test.\n walls_computation.generateWalls(&layer);\n\n \/\/ Verify that something was generated.\n EXPECT_FALSE(part.wall_toolpaths.empty()) << \"There must be some walls.\";\n EXPECT_GT(part.print_outline.area(), 0) << \"The print outline must encompass the outer wall, so it must be more than 0.\";\n EXPECT_LE(part.print_outline.area(), square_shape.area()) << \"The print outline must stay within the bounds of the original part.\";\n EXPECT_GT(part.inner_area.area(), 0) << \"The inner area must be within the innermost wall. There are not enough walls to fill the entire part, so there is a positive inner area.\";\n EXPECT_EQ(layer.parts.size(), 1) << \"There is still just 1 part.\";\n}\n\n\/*!\n * Tests if the inner area is properly set.\n *\/\nTEST_F(WallsComputationTest, GenerateWallsZeroWalls)\n{\n settings.add(\"wall_line_count\", \"0\");\n SliceLayer layer;\n layer.parts.emplace_back();\n SliceLayerPart& part = layer.parts.back();\n part.outline.add(square_shape);\n\n \/\/ Run the test.\n walls_computation.generateWalls(&layer);\n\n \/\/ Verify that there is still an inner area, outline and parts.\n EXPECT_EQ(part.inner_area.area(), square_shape.area()) << \"There are no walls, so the inner area (for infill\/skin) needs to be the entire part.\";\n EXPECT_EQ(part.print_outline.area(), square_shape.area()) << \"There are no walls, so the print outline encompasses the inner area exactly.\";\n EXPECT_EQ(part.outline.area(), square_shape.area()) << \"The outline is not modified.\";\n EXPECT_EQ(layer.parts.size(), 1) << \"There is still just 1 part.\";\n}\n\n\/*!\n * Tests if the inner area is properly set.\n *\/\nTEST_F(WallsComputationTest, WallToolPathsGetWeakOrder)\n{\n settings.add(\"wall_line_count\", \"5\");\n SliceLayer layer;\n layer.parts.emplace_back();\n SliceLayerPart& part = layer.parts.back();\n part.outline.add(ff_holes);\n\n \/\/ Run the test.\n walls_computation.generateWalls(&layer);\n\n const bool outer_to_inner = false;\n std::vector<const ExtrusionLine*> all_paths;\n for (auto& inset : part.wall_toolpaths)\n {\n for (auto& line : inset)\n {\n all_paths.emplace_back(&line);\n }\n }\n std::unordered_set<std::pair<const ExtrusionLine*, const ExtrusionLine*>> order = InsetOrderOptimizer::getRegionOrder(all_paths, outer_to_inner);\n\n \/\/ Verify that something was generated.\n EXPECT_FALSE(part.wall_toolpaths.empty()) << \"There must be some walls.\";\n EXPECT_GT(part.print_outline.area(), 0) << \"The print outline must encompass the outer wall, so it must be more than 0.\";\n EXPECT_LE(part.print_outline.area(), ff_holes.area()) << \"The print outline must stay within the bounds of the original part.\";\n EXPECT_GE(part.inner_area.area(), 0) << \"The inner area can never have negative area.\";\n EXPECT_EQ(layer.parts.size(), 1) << \"There is still just 1 part.\";\n\n#ifdef WALLS_COMPUTATION_TEST_SVG_OUTPUT\n {\n SVG svg(\"\/tmp\/wall_order.svg\", AABB(part.outline));\n for (const VariableWidthLines& inset : part.wall_toolpaths)\n {\n for (const ExtrusionLine& line : inset)\n {\n if (line.is_odd)\n {\n svg.writePolyline(line.toPolygon(), SVG::Color::YELLOW);\n svg.writePoints(line.toPolygon(), true);\n }\n else\n svg.writePolygon(line.toPolygon(), SVG::Color::GREEN);\n }\n }\n svg.writePolygons(part.outline, SVG::Color::RED);\n svg.writePolygons(part.inner_area, SVG::Color::YELLOW);\n svg.nextLayer();\n for (auto [first, second] : order)\n {\n if (! second->is_odd)\n svg.writeArrow(first->front().p, (++second->begin())->p, SVG::Color::BLUE);\n }\n svg.nextLayer();\n for (auto [first, second] : order)\n {\n if (second->is_odd)\n svg.writeArrow(first->front().p, (++second->begin())->p, SVG::Color::MAGENTA);\n }\n }\n#endif \/\/ WALLS_COMPUTATION_TEST_SVG_OUTPUT\n\n size_t n_paths = 0;\n for (auto& lines : part.wall_toolpaths)\n {\n for (auto& line : lines)\n {\n if (! line.empty())\n {\n n_paths++;\n }\n }\n }\n EXPECT_GT(order.size(), 0) << \"There should be ordered pairs!\";\n std::unordered_set<const ExtrusionLine*> has_order_info(part.wall_toolpaths.size());\n for (auto [from, to] : order)\n {\n EXPECT_FALSE(from->is_odd) << \"Odd gap filler lines are never required to go before anything.\";\n has_order_info.emplace(from);\n has_order_info.emplace(to);\n }\n EXPECT_EQ(has_order_info.size(), n_paths) << \"Every path should have order information.\";\n}\n\n} \/\/ namespace cura\n\/\/ NOLINTEND(*-magic-numbers)\n<commit_msg>Fix unit test: Different settings for same calculation.<commit_after>\/\/ Copyright (c) 2022 Ultimaker B.V.\n\/\/ CuraEngine is released under the terms of the AGPLv3 or higher.\n\n#include \"WallsComputation.h\" \/\/Unit under test.\n#include \"InsetOrderOptimizer.h\" \/\/Unit also under test.\n#include \"settings\/Settings.h\" \/\/Settings to generate walls with.\n#include \"sliceDataStorage.h\" \/\/Sl\n#include \"utils\/polygon.h\" \/\/To create example polygons.\n#include <gtest\/gtest.h>\n#include <unordered_set>\n\n#ifdef WALLS_COMPUTATION_TEST_SVG_OUTPUT\n#include \"utils\/SVG.h\"\n#include \"utils\/polygon.h\"\n#include <cstdlib>\n#endif \/\/ WALLS_COMPUTATION_TEST_SVG_OUTPUT\n\n\/\/ NOLINTBEGIN(*-magic-numbers)\nnamespace cura\n{\n\/*!\n * Fixture that provides a basis for testing wall computation.\n *\/\nclass WallsComputationTest : public testing::Test\n{\npublic:\n \/*!\n * Settings to slice with. This is linked in the walls_computation fixture.\n *\/\n Settings settings;\n\n \/*!\n * WallsComputation instance to test with. The layer index will be 100.\n *\/\n WallsComputation walls_computation;\n\n \/*!\n * Basic 10x10mm square shape to work with.\n *\/\n Polygons square_shape;\n\n \/*!\n * A rectangle enclosing two triangular holes;\n *\/\n Polygons ff_holes;\n\n WallsComputationTest() : walls_computation(settings, LayerIndex(100))\n {\n square_shape.emplace_back();\n square_shape.back().emplace_back(0, 0);\n square_shape.back().emplace_back(MM2INT(10), 0);\n square_shape.back().emplace_back(MM2INT(10), MM2INT(10));\n square_shape.back().emplace_back(0, MM2INT(10));\n\n ff_holes.emplace_back();\n ff_holes.back().emplace_back(0, 0);\n ff_holes.back().emplace_back(10000, 0);\n ff_holes.back().emplace_back(10000, 5000);\n ff_holes.back().emplace_back(0, 5000);\n ff_holes.emplace_back();\n ff_holes.back().emplace_back(1000, 1000);\n ff_holes.back().emplace_back(1000, 4000);\n ff_holes.back().emplace_back(4000, 2500);\n ff_holes.emplace_back();\n ff_holes.back().emplace_back(6000, 1000);\n ff_holes.back().emplace_back(6000, 4000);\n ff_holes.back().emplace_back(9000, 2500);\n\n \/\/ Settings for a simple 2 walls, about as basic as possible.\n settings.add(\"alternate_extra_perimeter\", \"false\");\n settings.add(\"fill_outline_gaps\", \"false\");\n settings.add(\"initial_layer_line_width_factor\", \"100\");\n settings.add(\"magic_spiralize\", \"false\");\n settings.add(\"meshfix_maximum_deviation\", \"0.1\");\n settings.add(\"meshfix_maximum_extrusion_area_deviation\", \"0.01\");\n settings.add(\"meshfix_maximum_resolution\", \"0.01\");\n settings.add(\"min_bead_width\", \"0\");\n settings.add(\"min_feature_size\", \"0\");\n settings.add(\"wall_0_extruder_nr\", \"0\");\n settings.add(\"wall_0_inset\", \"0\");\n settings.add(\"wall_line_count\", \"2\");\n settings.add(\"wall_line_width_0\", \"0.4\");\n settings.add(\"wall_line_width_x\", \"0.4\");\n settings.add(\"min_even_wall_line_width\", \"0.34\");\n settings.add(\"min_odd_wall_line_width\", \"0.34\");\n settings.add(\"wall_transition_angle\", \"10\");\n settings.add(\"wall_transition_filter_distance\", \"1\");\n settings.add(\"wall_transition_filter_deviation\", \".2\");\n settings.add(\"wall_transition_length\", \"1\");\n settings.add(\"wall_x_extruder_nr\", \"0\");\n settings.add(\"wall_distribution_count\", \"2\");\n }\n};\n\n\/*!\n * Tests if something is generated in the basic happy case.\n *\/\nTEST_F(WallsComputationTest, GenerateWallsForLayerSinglePart)\n{\n SliceLayer layer;\n layer.parts.emplace_back();\n SliceLayerPart& part = layer.parts.back();\n part.outline.add(square_shape);\n\n \/\/ Run the test.\n walls_computation.generateWalls(&layer);\n\n \/\/ Verify that something was generated.\n EXPECT_FALSE(part.wall_toolpaths.empty()) << \"There must be some walls.\";\n EXPECT_GT(part.print_outline.area(), 0) << \"The print outline must encompass the outer wall, so it must be more than 0.\";\n EXPECT_LE(part.print_outline.area(), square_shape.area()) << \"The print outline must stay within the bounds of the original part.\";\n EXPECT_GT(part.inner_area.area(), 0) << \"The inner area must be within the innermost wall. There are not enough walls to fill the entire part, so there is a positive inner area.\";\n EXPECT_EQ(layer.parts.size(), 1) << \"There is still just 1 part.\";\n}\n\n\/*!\n * Tests if the inner area is properly set.\n *\/\nTEST_F(WallsComputationTest, GenerateWallsZeroWalls)\n{\n settings.add(\"wall_line_count\", \"0\");\n SliceLayer layer;\n layer.parts.emplace_back();\n SliceLayerPart& part = layer.parts.back();\n part.outline.add(square_shape);\n\n \/\/ Run the test.\n walls_computation.generateWalls(&layer);\n\n \/\/ Verify that there is still an inner area, outline and parts.\n EXPECT_EQ(part.inner_area.area(), square_shape.area()) << \"There are no walls, so the inner area (for infill\/skin) needs to be the entire part.\";\n EXPECT_EQ(part.print_outline.area(), square_shape.area()) << \"There are no walls, so the print outline encompasses the inner area exactly.\";\n EXPECT_EQ(part.outline.area(), square_shape.area()) << \"The outline is not modified.\";\n EXPECT_EQ(layer.parts.size(), 1) << \"There is still just 1 part.\";\n}\n\n\/*!\n * Tests if the inner area is properly set.\n *\/\nTEST_F(WallsComputationTest, WallToolPathsGetWeakOrder)\n{\n settings.add(\"wall_line_count\", \"5\");\n SliceLayer layer;\n layer.parts.emplace_back();\n SliceLayerPart& part = layer.parts.back();\n part.outline.add(ff_holes);\n\n \/\/ Run the test.\n walls_computation.generateWalls(&layer);\n\n const bool outer_to_inner = false;\n std::vector<const ExtrusionLine*> all_paths;\n for (auto& inset : part.wall_toolpaths)\n {\n for (auto& line : inset)\n {\n all_paths.emplace_back(&line);\n }\n }\n std::unordered_set<std::pair<const ExtrusionLine*, const ExtrusionLine*>> order = InsetOrderOptimizer::getRegionOrder(all_paths, outer_to_inner);\n\n \/\/ Verify that something was generated.\n EXPECT_FALSE(part.wall_toolpaths.empty()) << \"There must be some walls.\";\n EXPECT_GT(part.print_outline.area(), 0) << \"The print outline must encompass the outer wall, so it must be more than 0.\";\n EXPECT_LE(part.print_outline.area(), ff_holes.area()) << \"The print outline must stay within the bounds of the original part.\";\n EXPECT_GE(part.inner_area.area(), 0) << \"The inner area can never have negative area.\";\n EXPECT_EQ(layer.parts.size(), 1) << \"There is still just 1 part.\";\n\n#ifdef WALLS_COMPUTATION_TEST_SVG_OUTPUT\n {\n SVG svg(\"\/tmp\/wall_order.svg\", AABB(part.outline));\n for (const VariableWidthLines& inset : part.wall_toolpaths)\n {\n for (const ExtrusionLine& line : inset)\n {\n if (line.is_odd)\n {\n svg.writePolyline(line.toPolygon(), SVG::Color::YELLOW);\n svg.writePoints(line.toPolygon(), true);\n }\n else\n svg.writePolygon(line.toPolygon(), SVG::Color::GREEN);\n }\n }\n svg.writePolygons(part.outline, SVG::Color::RED);\n svg.writePolygons(part.inner_area, SVG::Color::YELLOW);\n svg.nextLayer();\n for (auto [first, second] : order)\n {\n if (! second->is_odd)\n svg.writeArrow(first->front().p, (++second->begin())->p, SVG::Color::BLUE);\n }\n svg.nextLayer();\n for (auto [first, second] : order)\n {\n if (second->is_odd)\n svg.writeArrow(first->front().p, (++second->begin())->p, SVG::Color::MAGENTA);\n }\n }\n#endif \/\/ WALLS_COMPUTATION_TEST_SVG_OUTPUT\n\n size_t n_paths = 0;\n for (auto& lines : part.wall_toolpaths)\n {\n for (auto& line : lines)\n {\n if (! line.empty())\n {\n n_paths++;\n }\n }\n }\n EXPECT_GT(order.size(), 0) << \"There should be ordered pairs!\";\n std::unordered_set<const ExtrusionLine*> has_order_info(part.wall_toolpaths.size());\n for (auto [from, to] : order)\n {\n EXPECT_FALSE(from->is_odd) << \"Odd gap filler lines are never required to go before anything.\";\n has_order_info.emplace(from);\n has_order_info.emplace(to);\n }\n EXPECT_EQ(has_order_info.size(), n_paths) << \"Every path should have order information.\";\n}\n\n} \/\/ namespace cura\n\/\/ NOLINTEND(*-magic-numbers)\n<|endoftext|>"} {"text":"<commit_before>\/\/ @(#)root\/auth:$Id$\n\/\/ Author: G. Ganis 08\/07\/2005\n\n\/*************************************************************************\n * Copyright (C) 1995-2005, Rene Brun and Fons Rademakers. *\n * All rights reserved. *\n * *\n * For the licensing terms see $ROOTSYS\/LICENSE. *\n * For the list of contributors see $ROOTSYS\/README\/CREDITS. *\n *************************************************************************\/\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ \/\/\n\/\/ TRootSecContext \/\/\n\/\/ \/\/\n\/\/ Special implementation of TSecContext \/\/\n\/\/ \/\/\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n#include \"RConfigure.h\"\n\n#include <stdlib.h>\n\n#include \"TError.h\"\n#include \"TRootSecContext.h\"\n#include \"TROOT.h\"\n#include \"TSocket.h\"\n#include \"TUrl.h\"\n#include \"TVirtualMutex.h\"\n\nClassImp(TRootSecContext);\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\/ Ctor for SecContext object.\n\n TRootSecContext::TRootSecContext(const char *user, const char *host, Int_t meth,\n Int_t offset, const char *id,\n const char *token, TDatime expdate,\n void *ctx, Int_t key)\n : TSecContext(user, host, meth, offset, id, token, expdate, ctx)\n{\n R__ASSERT(gROOT);\n\n fRSAKey = key;\n fMethodName = TAuthenticate::GetAuthMethod(fMethod);\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\/ Ctor for SecContext object.\n\/\/\/ User and host from url = user@host .\n\nTRootSecContext::TRootSecContext(const char *url, Int_t meth, Int_t offset,\n const char *id, const char *token,\n TDatime expdate, void *ctx, Int_t key)\n : TSecContext(url, meth, offset, id, token, expdate, ctx)\n{\n R__ASSERT(gROOT);\n\n fRSAKey = key;\n fMethodName = TAuthenticate::GetAuthMethod(fMethod);\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\/ Dtor: delete (deActivate, local\/remote cleanup, list removal)\n\/\/\/ all what is still active\n\nTRootSecContext::~TRootSecContext()\n{\n TSecContext::Cleanup();\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\/ Set OffSet to -1 and expiring Date to default\n\/\/\/ Remove from the list\n\/\/\/ If globus, cleanup local stuff\n\/\/\/ If Opt contains \"C\" or \"c\", ask for remote cleanup\n\/\/\/ If Opt contains \"R\" or \"r\", remove from the list\n\/\/\/ Default Opt=\"CR\"\n\nvoid TRootSecContext::DeActivate(Option_t *Opt)\n{\n \/\/ Ask remote cleanup of this context\n Bool_t clean = (strstr(Opt,\"C\") || strstr(Opt,\"c\"));\n if (clean && fOffSet > -1)\n CleanupSecContext(kFALSE);\n\n \/\/ Cleanup TPwdCtx object fro UsrPwd and SRP\n if (fMethod == TAuthenticate::kClear ||\n fMethod == TAuthenticate::kSRP)\n if (fContext) {\n delete (TPwdCtx *)fContext;\n fContext = 0;\n }\n\n \/\/ Cleanup globus security context if needed\n if (fMethod == TAuthenticate::kGlobus && fContext) {\n GlobusAuth_t globusAuthHook = TAuthenticate::GetGlobusAuthHook();\n if (globusAuthHook != 0) {\n TString det(\"context\");\n TString us(\"-1\");\n (*globusAuthHook)((TAuthenticate *)fContext,us,det);\n fContext = 0;\n }\n }\n\n Bool_t remove = (strstr(Opt,\"R\") || strstr(Opt,\"r\"));\n if (remove && fOffSet > -1){\n R__LOCKGUARD(gROOTMutex);\n \/\/ Remove from the global list\n gROOT->GetListOfSecContexts()->Remove(this);\n \/\/ Remove also from local lists in THostAuth objects\n TAuthenticate::RemoveSecContext(this);\n }\n\n \/\/ Set inactive\n fOffSet = -1;\n fExpDate = kROOTTZERO;\n\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\/ Ask remote client to cleanup security context 'ctx'\n\/\/\/ If 'all', all sec context with the same host as ctx\n\/\/\/ are cleaned.\n\nBool_t TRootSecContext::CleanupSecContext(Bool_t all)\n{\n Bool_t cleaned = kFALSE;\n\n \/\/ Nothing to do if inactive ...\n if (!IsActive())\n return kTRUE;\n\n \/\/ Contact remote services that used this context,\n \/\/ starting from the last ...\n TIter last(fCleanup,kIterBackward);\n TSecContextCleanup *nscc = 0;\n while ((nscc = (TSecContextCleanup *)last()) && !cleaned) {\n\n \/\/ First check if remote daemon supports cleaning\n Int_t srvtyp = nscc->GetType();\n Int_t rproto = nscc->GetProtocol();\n Int_t level = 2;\n if ((srvtyp == TSocket::kROOTD && rproto < 10) ||\n (srvtyp == TSocket::kPROOFD && rproto < 9))\n level = 1;\n if ((srvtyp == TSocket::kROOTD && rproto < 8) ||\n (srvtyp == TSocket::kPROOFD && rproto < 7))\n level = 0;\n if (level) {\n Int_t port = nscc->GetPort();\n\n TSocket *news = new TSocket(fHost.Data(),port,-1);\n\n if (news && news->IsValid()) {\n if (srvtyp == TSocket::kPROOFD) {\n news->SetOption(kNoDelay, 1);\n news->Send(\"cleaning request\");\n } else\n news->SetOption(kNoDelay, 0);\n\n \/\/ Backward compatibility: send socket size\n if (srvtyp == TSocket::kROOTD && level == 1)\n news->Send((Int_t)0, (Int_t)0);\n\n if (all || level == 1) {\n news->Send(Form(\"%d\",TAuthenticate::fgProcessID), kROOTD_CLEANUP);\n cleaned = kTRUE;\n } else {\n news->Send(Form(\"%d %d %d %s\", TAuthenticate::fgProcessID, fMethod,\n fOffSet, fUser.Data()), kROOTD_CLEANUP);\n if (TAuthenticate::SecureSend(news, 1, fRSAKey,\n (char *)(fToken.Data())) == -1) {\n Info(\"CleanupSecContext\", \"problems secure-sending token\");\n } else {\n cleaned = kTRUE;\n }\n }\n if (cleaned && gDebug > 2) {\n char srvname[3][10] = {\"sockd\", \"rootd\", \"proofd\"};\n Info(\"CleanupSecContext\",\n \"remote %s notified for cleanup (%s,%d)\",\n srvname[srvtyp],fHost.Data(),port);\n }\n }\n SafeDelete(news);\n }\n }\n\n if (!cleaned)\n if (gDebug > 2)\n Info(\"CleanupSecContext\",\n \"unable to open valid socket for cleanup for %s\", fHost.Data());\n\n return cleaned;\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\/ If opt is \"F\" (default) print object content.\n\/\/\/ If opt is \"<number>\" print in special form for calls within THostAuth\n\/\/\/ with cardinality <number>\n\/\/\/ If opt is \"S\" prints short in-line form for calls within TFTP,\n\/\/\/ TSlave, TProof ...\n\nvoid TRootSecContext::Print(Option_t *opt) const\n{\n \/\/ Check if option is numeric\n Int_t ord = -1, i = 0;\n for (; i < (Int_t)strlen(opt); i++) {\n if (opt[i] < 48 || opt[i] > 57) {\n ord = -2;\n break;\n }\n }\n \/\/ If numeric get the cardinality and prepare the strings\n if (ord == -1)\n ord = atoi(opt);\n\n if (!strncasecmp(opt,\"F\",1)) {\n Info(\"Print\",\n \"+------------------------------------------------------+\");\n Info(\"Print\",\n \"+ Host:%s Method:%d (%s) User:'%s'\",\n GetHost(), fMethod, GetMethodName(),\n fUser.Data());\n Info(\"Print\",\n \"+ OffSet:%d Id: '%s'\", fOffSet, fID.Data());\n if (fOffSet > -1)\n Info(\"Print\",\n \"+ Expiration time: %s\",fExpDate.AsString());\n Info(\"Print\",\n \"+------------------------------------------------------+\");\n } else if (!strncasecmp(opt,\"S\",1)) {\n if (fOffSet > -1) {\n if (fID.BeginsWith(\"AFS\"))\n Printf(\"Security context: Method: AFS, not reusable\");\n else\n Printf(\"Security context: Method: %d (%s) expiring on %s\",\n fMethod, GetMethodName(),\n fExpDate.AsString());\n } else {\n Printf(\"Security context: Method: %d (%s) not reusable\",\n fMethod, GetMethodName());\n }\n } else {\n \/\/ special printing form for THostAuth\n Info(\"PrintEstblshed\",\"+ %d \\t h:%s met:%d (%s) us:'%s'\",\n ord, GetHost(), fMethod, GetMethodName(),\n fUser.Data());\n Info(\"PrintEstblshed\",\"+ \\t offset:%d id: '%s'\", fOffSet, fID.Data());\n if (fOffSet > -1)\n Info(\"PrintEstblshed\",\"+ \\t expiring: %s\",fExpDate.AsString());\n }\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\/ Returns short string with relevant information about this\n\/\/\/ security context\n\nconst char *TRootSecContext::AsString(TString &out)\n{\n if (fOffSet > -1) {\n if (fID.BeginsWith(\"AFS\"))\n out = Form(\"Method: AFS, not reusable\");\n else {\n char expdate[32];\n out = Form(\"Method: %d (%s) expiring on %s\",\n fMethod, GetMethodName(), fExpDate.AsString(expdate));\n }\n } else {\n if (fOffSet == -1)\n out = Form(\"Method: %d (%s) not reusable\", fMethod, GetMethodName());\n else if (fOffSet == -3)\n out = Form(\"Method: %d (%s) authorized by \/etc\/hosts.equiv or $HOME\/.rhosts\",\n fMethod, GetMethodName());\n else if (fOffSet == -4)\n out = Form(\"No authentication required remotely\");\n }\n return out.Data();\n}\n<commit_msg>define kROOTTZERO at TRootSecContext as well<commit_after>\/\/ @(#)root\/auth:$Id$\n\/\/ Author: G. Ganis 08\/07\/2005\n\n\/*************************************************************************\n * Copyright (C) 1995-2005, Rene Brun and Fons Rademakers. *\n * All rights reserved. *\n * *\n * For the licensing terms see $ROOTSYS\/LICENSE. *\n * For the list of contributors see $ROOTSYS\/README\/CREDITS. *\n *************************************************************************\/\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ \/\/\n\/\/ TRootSecContext \/\/\n\/\/ \/\/\n\/\/ Special implementation of TSecContext \/\/\n\/\/ \/\/\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n#include \"RConfigure.h\"\n\n#include <stdlib.h>\n\n#include \"TError.h\"\n#include \"TRootSecContext.h\"\n#include \"TROOT.h\"\n#include \"TSocket.h\"\n#include \"TUrl.h\"\n#include \"TVirtualMutex.h\"\n\nconst TDatime kROOTTZERO = 788914800;\n\nClassImp(TRootSecContext);\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\/ Ctor for SecContext object.\n\n TRootSecContext::TRootSecContext(const char *user, const char *host, Int_t meth,\n Int_t offset, const char *id,\n const char *token, TDatime expdate,\n void *ctx, Int_t key)\n : TSecContext(user, host, meth, offset, id, token, expdate, ctx)\n{\n R__ASSERT(gROOT);\n\n fRSAKey = key;\n fMethodName = TAuthenticate::GetAuthMethod(fMethod);\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\/ Ctor for SecContext object.\n\/\/\/ User and host from url = user@host .\n\nTRootSecContext::TRootSecContext(const char *url, Int_t meth, Int_t offset,\n const char *id, const char *token,\n TDatime expdate, void *ctx, Int_t key)\n : TSecContext(url, meth, offset, id, token, expdate, ctx)\n{\n R__ASSERT(gROOT);\n\n fRSAKey = key;\n fMethodName = TAuthenticate::GetAuthMethod(fMethod);\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\/ Dtor: delete (deActivate, local\/remote cleanup, list removal)\n\/\/\/ all what is still active\n\nTRootSecContext::~TRootSecContext()\n{\n TSecContext::Cleanup();\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\/ Set OffSet to -1 and expiring Date to default\n\/\/\/ Remove from the list\n\/\/\/ If globus, cleanup local stuff\n\/\/\/ If Opt contains \"C\" or \"c\", ask for remote cleanup\n\/\/\/ If Opt contains \"R\" or \"r\", remove from the list\n\/\/\/ Default Opt=\"CR\"\n\nvoid TRootSecContext::DeActivate(Option_t *Opt)\n{\n \/\/ Ask remote cleanup of this context\n Bool_t clean = (strstr(Opt,\"C\") || strstr(Opt,\"c\"));\n if (clean && fOffSet > -1)\n CleanupSecContext(kFALSE);\n\n \/\/ Cleanup TPwdCtx object fro UsrPwd and SRP\n if (fMethod == TAuthenticate::kClear ||\n fMethod == TAuthenticate::kSRP)\n if (fContext) {\n delete (TPwdCtx *)fContext;\n fContext = 0;\n }\n\n \/\/ Cleanup globus security context if needed\n if (fMethod == TAuthenticate::kGlobus && fContext) {\n GlobusAuth_t globusAuthHook = TAuthenticate::GetGlobusAuthHook();\n if (globusAuthHook != 0) {\n TString det(\"context\");\n TString us(\"-1\");\n (*globusAuthHook)((TAuthenticate *)fContext,us,det);\n fContext = 0;\n }\n }\n\n Bool_t remove = (strstr(Opt,\"R\") || strstr(Opt,\"r\"));\n if (remove && fOffSet > -1){\n R__LOCKGUARD(gROOTMutex);\n \/\/ Remove from the global list\n gROOT->GetListOfSecContexts()->Remove(this);\n \/\/ Remove also from local lists in THostAuth objects\n TAuthenticate::RemoveSecContext(this);\n }\n\n \/\/ Set inactive\n fOffSet = -1;\n fExpDate = kROOTTZERO;\n\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\/ Ask remote client to cleanup security context 'ctx'\n\/\/\/ If 'all', all sec context with the same host as ctx\n\/\/\/ are cleaned.\n\nBool_t TRootSecContext::CleanupSecContext(Bool_t all)\n{\n Bool_t cleaned = kFALSE;\n\n \/\/ Nothing to do if inactive ...\n if (!IsActive())\n return kTRUE;\n\n \/\/ Contact remote services that used this context,\n \/\/ starting from the last ...\n TIter last(fCleanup,kIterBackward);\n TSecContextCleanup *nscc = 0;\n while ((nscc = (TSecContextCleanup *)last()) && !cleaned) {\n\n \/\/ First check if remote daemon supports cleaning\n Int_t srvtyp = nscc->GetType();\n Int_t rproto = nscc->GetProtocol();\n Int_t level = 2;\n if ((srvtyp == TSocket::kROOTD && rproto < 10) ||\n (srvtyp == TSocket::kPROOFD && rproto < 9))\n level = 1;\n if ((srvtyp == TSocket::kROOTD && rproto < 8) ||\n (srvtyp == TSocket::kPROOFD && rproto < 7))\n level = 0;\n if (level) {\n Int_t port = nscc->GetPort();\n\n TSocket *news = new TSocket(fHost.Data(),port,-1);\n\n if (news && news->IsValid()) {\n if (srvtyp == TSocket::kPROOFD) {\n news->SetOption(kNoDelay, 1);\n news->Send(\"cleaning request\");\n } else\n news->SetOption(kNoDelay, 0);\n\n \/\/ Backward compatibility: send socket size\n if (srvtyp == TSocket::kROOTD && level == 1)\n news->Send((Int_t)0, (Int_t)0);\n\n if (all || level == 1) {\n news->Send(Form(\"%d\",TAuthenticate::fgProcessID), kROOTD_CLEANUP);\n cleaned = kTRUE;\n } else {\n news->Send(Form(\"%d %d %d %s\", TAuthenticate::fgProcessID, fMethod,\n fOffSet, fUser.Data()), kROOTD_CLEANUP);\n if (TAuthenticate::SecureSend(news, 1, fRSAKey,\n (char *)(fToken.Data())) == -1) {\n Info(\"CleanupSecContext\", \"problems secure-sending token\");\n } else {\n cleaned = kTRUE;\n }\n }\n if (cleaned && gDebug > 2) {\n char srvname[3][10] = {\"sockd\", \"rootd\", \"proofd\"};\n Info(\"CleanupSecContext\",\n \"remote %s notified for cleanup (%s,%d)\",\n srvname[srvtyp],fHost.Data(),port);\n }\n }\n SafeDelete(news);\n }\n }\n\n if (!cleaned)\n if (gDebug > 2)\n Info(\"CleanupSecContext\",\n \"unable to open valid socket for cleanup for %s\", fHost.Data());\n\n return cleaned;\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\/ If opt is \"F\" (default) print object content.\n\/\/\/ If opt is \"<number>\" print in special form for calls within THostAuth\n\/\/\/ with cardinality <number>\n\/\/\/ If opt is \"S\" prints short in-line form for calls within TFTP,\n\/\/\/ TSlave, TProof ...\n\nvoid TRootSecContext::Print(Option_t *opt) const\n{\n \/\/ Check if option is numeric\n Int_t ord = -1, i = 0;\n for (; i < (Int_t)strlen(opt); i++) {\n if (opt[i] < 48 || opt[i] > 57) {\n ord = -2;\n break;\n }\n }\n \/\/ If numeric get the cardinality and prepare the strings\n if (ord == -1)\n ord = atoi(opt);\n\n if (!strncasecmp(opt,\"F\",1)) {\n Info(\"Print\",\n \"+------------------------------------------------------+\");\n Info(\"Print\",\n \"+ Host:%s Method:%d (%s) User:'%s'\",\n GetHost(), fMethod, GetMethodName(),\n fUser.Data());\n Info(\"Print\",\n \"+ OffSet:%d Id: '%s'\", fOffSet, fID.Data());\n if (fOffSet > -1)\n Info(\"Print\",\n \"+ Expiration time: %s\",fExpDate.AsString());\n Info(\"Print\",\n \"+------------------------------------------------------+\");\n } else if (!strncasecmp(opt,\"S\",1)) {\n if (fOffSet > -1) {\n if (fID.BeginsWith(\"AFS\"))\n Printf(\"Security context: Method: AFS, not reusable\");\n else\n Printf(\"Security context: Method: %d (%s) expiring on %s\",\n fMethod, GetMethodName(),\n fExpDate.AsString());\n } else {\n Printf(\"Security context: Method: %d (%s) not reusable\",\n fMethod, GetMethodName());\n }\n } else {\n \/\/ special printing form for THostAuth\n Info(\"PrintEstblshed\",\"+ %d \\t h:%s met:%d (%s) us:'%s'\",\n ord, GetHost(), fMethod, GetMethodName(),\n fUser.Data());\n Info(\"PrintEstblshed\",\"+ \\t offset:%d id: '%s'\", fOffSet, fID.Data());\n if (fOffSet > -1)\n Info(\"PrintEstblshed\",\"+ \\t expiring: %s\",fExpDate.AsString());\n }\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\/ Returns short string with relevant information about this\n\/\/\/ security context\n\nconst char *TRootSecContext::AsString(TString &out)\n{\n if (fOffSet > -1) {\n if (fID.BeginsWith(\"AFS\"))\n out = Form(\"Method: AFS, not reusable\");\n else {\n char expdate[32];\n out = Form(\"Method: %d (%s) expiring on %s\",\n fMethod, GetMethodName(), fExpDate.AsString(expdate));\n }\n } else {\n if (fOffSet == -1)\n out = Form(\"Method: %d (%s) not reusable\", fMethod, GetMethodName());\n else if (fOffSet == -3)\n out = Form(\"Method: %d (%s) authorized by \/etc\/hosts.equiv or $HOME\/.rhosts\",\n fMethod, GetMethodName());\n else if (fOffSet == -4)\n out = Form(\"No authentication required remotely\");\n }\n return out.Data();\n}\n<|endoftext|>"} {"text":"<commit_before>\/****************** <VPR heading BEGIN do not edit this line> *****************\n *\n * VR Juggler Portable Runtime\n *\n * Original Authors:\n * Allen Bierbaum, Patrick Hartling, Kevin Meinert, Carolina Cruz-Neira\n *\n * -----------------------------------------------------------------\n * File: $RCSfile$\n * Date modified: $Date$\n * Version: $Revision$\n * -----------------------------------------------------------------\n *\n ****************** <VPR heading END do not edit this line> ******************\/\n\n\/*************** <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 *************** <auto-copyright.pl END do not edit this line> ***************\/\n\n#include <vpr\/vprConfig.h>\n\n#if defined(HAVE_BACKTRACE)\n#include <sys\/types.h>\n#include <unistd.h>\n#include <execinfo.h>\n\n#include <string>\n#include <sstream>\n#endif\n\n#if (! defined(__INTEL_COMPILER) && defined(__GNUC__) && \\\n ((__GNUC__ == 3 && __GNUC_MINOR__ >= 3) || __GNUC__ > 3)) || \\\n (defined(__INTEL_COMPILER) && __INTEL_COMPILER >= 810 && defined(__GNUC__))\n\n#define USE_CXA_DEMANGLE 1\n#include <cxxabi.h>\n\n#endif\n\n#include <vpr\/SystemBase.h>\n\nnamespace\n{\n\nstd::string demangleTraceString(char* traceLine)\n{\n#ifdef USE_CXA_DEMANGLE\n \/\/ Try to extract the mangled name from the line (if it exists)\n \/\/ and replace it with a demangled version of the name.\n \/\/ Example: build.linux\/stuff\/classfile(_ZN4vpr11Someing33methodEv+0xd3) [0x80cfa29]\n\n std::string trace_line(traceLine);\n std::string mangled_name, demangled_name;\n\n unsigned start(std::string::npos), end(std::string::npos);\n start = trace_line.find(\"(_\");\n if(std::string::npos != start)\n {\n end = trace_line.find_first_of(\"+)\",start);\n }\n\n if(std::string::npos != end)\n {\n mangled_name.assign(trace_line, start+1, end-start-1);\n int status;\n char* demangled_buf = abi::__cxa_demangle(mangled_name.c_str(), NULL,\n NULL, &status);\n if(0==status)\n {\n demangled_name = std::string(demangled_buf);\n free(demangled_buf);\n\n trace_line.replace(start+1, (end-start-1), demangled_name);\n }\n else if(-1==status)\n {\n\/\/ std::cerr << \"vpr::SystemBase::dmangleTraceString: \"\n\/\/ << \"A memory allocation failiure occurred.\\n\";\n }\n else if(-2 == status)\n {\n\/\/ std::cerr << \"vpr::SystemBase::demangleTraceString: mangled_name \"\n\/\/ << \"is not a valid name under the C++ ABI mangling '\n\/\/ << \"rules.\\n\";\n }\n else if(-3 == status)\n {\n\/\/ std::cerr << \"vpr::SystemBase::demangleTraceString: One of the \"\n\/\/ << \"arguments is invalid.\\n\";\n }\n }\n\n\/\/ trace_line += std::string(\" mangle:\") + mangled_name +\n\/\/ std::string(\" demangled:\") + demangled_name;\n return trace_line;\n\n#else\n return std::string(traceLine);\n#endif\n}\n\n}\n\nnamespace vpr\n{\n\nstd::string SystemBase::getCallStack()\n{\n std::string ret_stack(\"Stack trace:\\n <Call stack printing not supported>\\n\");\n\n#if defined(HAVE_BACKTRACE)\n void* trace_syms[100];\n size_t size;\n char** strings;\n\n pid_t cur_pid = getpid();\n size = backtrace(trace_syms, 100);\n strings = backtrace_symbols(trace_syms, size);\n\n std::ostringstream trace_stream;\n trace_stream << \"Stack trace: thread: \" << cur_pid << std::endl;\n\n for (size_t i = 0; i < size; ++i)\n {\n trace_stream << \" \" << i << \":\" << demangleTraceString(strings[i])\n << std::endl;\n }\n\n free(strings);\n\n ret_stack = trace_stream.str();\n#endif\n\n return ret_stack;\n}\n\n}\n<commit_msg>Staticize demangleTraceString() since nothing else is using it.<commit_after>\/****************** <VPR heading BEGIN do not edit this line> *****************\n *\n * VR Juggler Portable Runtime\n *\n * Original Authors:\n * Allen Bierbaum, Patrick Hartling, Kevin Meinert, Carolina Cruz-Neira\n *\n * -----------------------------------------------------------------\n * File: $RCSfile$\n * Date modified: $Date$\n * Version: $Revision$\n * -----------------------------------------------------------------\n *\n ****************** <VPR heading END do not edit this line> ******************\/\n\n\/*************** <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 *************** <auto-copyright.pl END do not edit this line> ***************\/\n\n#include <vpr\/vprConfig.h>\n\n#if defined(HAVE_BACKTRACE)\n#include <sys\/types.h>\n#include <unistd.h>\n#include <execinfo.h>\n\n#include <string>\n#include <sstream>\n#endif\n\n#if (! defined(__INTEL_COMPILER) && defined(__GNUC__) && \\\n ((__GNUC__ == 3 && __GNUC_MINOR__ >= 3) || __GNUC__ > 3)) || \\\n (defined(__INTEL_COMPILER) && __INTEL_COMPILER >= 810 && defined(__GNUC__))\n\n#define USE_CXA_DEMANGLE 1\n#include <cxxabi.h>\n\n#endif\n\n#include <vpr\/SystemBase.h>\n\nnamespace\n{\n\nstatic std::string demangleTraceString(char* traceLine)\n{\n#ifdef USE_CXA_DEMANGLE\n \/\/ Try to extract the mangled name from the line (if it exists)\n \/\/ and replace it with a demangled version of the name.\n \/\/ Example: build.linux\/stuff\/classfile(_ZN4vpr11Someing33methodEv+0xd3) [0x80cfa29]\n\n std::string trace_line(traceLine);\n std::string mangled_name, demangled_name;\n\n unsigned start(std::string::npos), end(std::string::npos);\n start = trace_line.find(\"(_\");\n if(std::string::npos != start)\n {\n end = trace_line.find_first_of(\"+)\",start);\n }\n\n if(std::string::npos != end)\n {\n mangled_name.assign(trace_line, start+1, end-start-1);\n int status;\n char* demangled_buf = abi::__cxa_demangle(mangled_name.c_str(), NULL,\n NULL, &status);\n if(0==status)\n {\n demangled_name = std::string(demangled_buf);\n free(demangled_buf);\n\n trace_line.replace(start+1, (end-start-1), demangled_name);\n }\n else if(-1==status)\n {\n\/\/ std::cerr << \"vpr::SystemBase::dmangleTraceString: \"\n\/\/ << \"A memory allocation failiure occurred.\\n\";\n }\n else if(-2 == status)\n {\n\/\/ std::cerr << \"vpr::SystemBase::demangleTraceString: mangled_name \"\n\/\/ << \"is not a valid name under the C++ ABI mangling '\n\/\/ << \"rules.\\n\";\n }\n else if(-3 == status)\n {\n\/\/ std::cerr << \"vpr::SystemBase::demangleTraceString: One of the \"\n\/\/ << \"arguments is invalid.\\n\";\n }\n }\n\n\/\/ trace_line += std::string(\" mangle:\") + mangled_name +\n\/\/ std::string(\" demangled:\") + demangled_name;\n return trace_line;\n\n#else\n return std::string(traceLine);\n#endif\n}\n\n}\n\nnamespace vpr\n{\n\nstd::string SystemBase::getCallStack()\n{\n std::string ret_stack(\"Stack trace:\\n <Call stack printing not supported>\\n\");\n\n#if defined(HAVE_BACKTRACE)\n void* trace_syms[100];\n size_t size;\n char** strings;\n\n pid_t cur_pid = getpid();\n size = backtrace(trace_syms, 100);\n strings = backtrace_symbols(trace_syms, size);\n\n std::ostringstream trace_stream;\n trace_stream << \"Stack trace: thread: \" << cur_pid << std::endl;\n\n for (size_t i = 0; i < size; ++i)\n {\n trace_stream << \" \" << i << \":\" << demangleTraceString(strings[i])\n << std::endl;\n }\n\n free(strings);\n\n ret_stack = trace_stream.str();\n#endif\n\n return ret_stack;\n}\n\n}\n<|endoftext|>"} {"text":"<commit_before><commit_msg>Don't hang during DiskCacheEntryTest.CancelSparseIO on infinitely fast disks.<commit_after><|endoftext|>"} {"text":"<commit_before>#include \"musicquerytablewidget.h\"\n#include \"musicdownloadqueryfactory.h\"\n#include \"musicitemdelegate.h\"\n#include \"musicgiflabelwidget.h\"\n\n#include <QActionGroup>\n\nMusicQueryTableWidget::MusicQueryTableWidget(QWidget *parent)\n : MusicFillItemTableWidget(parent)\n{\n m_downLoadManager = nullptr;\n}\n\nMusicQueryTableWidget::~MusicQueryTableWidget()\n{\n delete m_downLoadManager;\n}\n\nQString MusicQueryTableWidget::getClassName()\n{\n return staticMetaObject.className();\n}\n\nvoid MusicQueryTableWidget::setQueryInput(MusicDownLoadQueryThreadAbstract *query)\n{\n delete m_downLoadManager;\n m_downLoadManager = query;\n connect(m_downLoadManager, SIGNAL(clearAllItems()), SLOT(clearAllItems()));\n connect(m_downLoadManager, SIGNAL(createSearchedItems(QString,QString,QString)),\n SLOT(createSearchedItems(QString,QString,QString)));\n}\n\nvoid MusicQueryTableWidget::contextMenuEvent(QContextMenuEvent *event)\n{\n Q_UNUSED(event);\n}\n\n\n\nMusicQueryItemTableWidget::MusicQueryItemTableWidget(QWidget *parent)\n : MusicQueryTableWidget(parent)\n{\n m_loadingLabel = new MusicGifLabelWidget(MusicGifLabelWidget::Gif_Cicle_Blue, this);\n m_actionGroup = new QActionGroup(this);\n m_labelDelegate = new MusicLabelDelegate(this);\n connect(m_actionGroup, SIGNAL(triggered(QAction*)), SLOT(actionGroupClick(QAction*)));\n connect(this, SIGNAL(cellDoubleClicked(int,int)), SLOT(itemDoubleClicked(int,int)));\n}\n\nMusicQueryItemTableWidget::~MusicQueryItemTableWidget()\n{\n delete m_loadingLabel;\n delete m_actionGroup;\n delete m_labelDelegate;\n}\n\nQString MusicQueryItemTableWidget::getClassName()\n{\n return staticMetaObject.className();\n}\n\nvoid MusicQueryItemTableWidget::startSearchQuery(const QString &text)\n{\n Q_UNUSED(text);\n MusicDownLoadQueryThreadAbstract *d = M_DOWNLOAD_QUERY_PTR->getQueryThread(this);\n connect(d, SIGNAL(downLoadDataChanged(QString)), SLOT(createFinishedItem()));\n setQueryInput( d );\n}\n\nvoid MusicQueryItemTableWidget::clearAllItems()\n{\n if(rowCount() > 0)\n {\n setItemDelegateForRow(rowCount() - 1, nullptr);\n }\n MusicAbstractTableWidget::clear();\n}\n\nvoid MusicQueryItemTableWidget::actionGroupClick(QAction *action)\n{\n int row = currentRow();\n if( row < 0 || (row >= rowCount() - 1))\n {\n return;\n }\n\n QString songName = (row != -1 && rowCount() > 0) ? item(row, 1)->toolTip() : QString();\n QString artistName = (row != -1 && rowCount() > 0) ? item(row, 2)->toolTip() : QString();\n\n switch( action->data().toInt() )\n {\n case 0: musicDownloadLocal(row); break;\n case 1: emit restartSearchQuery(songName); break;\n case 2: emit restartSearchQuery(artistName); break;\n case 3: emit restartSearchQuery(songName + \"-\" + artistName); break;\n }\n}\n\nvoid MusicQueryItemTableWidget::createFinishedItem()\n{\n m_loadingLabel->hide();\n m_loadingLabel->stop();\n\n if(rowCount() <= 0)\n {\n setRowCount(1);\n }\n\n int count = rowCount() - 1;\n setSpan(count, 0, 1, columnCount());\n\n for(int i=0; i<columnCount(); ++i)\n {\n setItem(count, i, new QTableWidgetItem);\n }\n\n QTableWidgetItem *it = item(count, 0);\n if(it)\n {\n it->setData(MUSIC_TEXTS_ROLE, tr(\"No More Data\"));\n setItemDelegateForRow(count, m_labelDelegate);\n }\n}\n\nvoid MusicQueryItemTableWidget::createContextMenu(QMenu &menu)\n{\n menu.setStyleSheet(MusicUIObject::MMenuStyle02);\n m_actionGroup->addAction(menu.addAction(tr(\"musicDownload\")))->setData(0);\n\n menu.addSeparator();\n\n QString songName = currentRow() != -1 && rowCount() > 0 ?\n item(currentRow(), 1)->toolTip() : QString();\n QString artistName = currentRow() != -1 && rowCount() > 0 ?\n item(currentRow(), 2)->toolTip() : QString();\n m_actionGroup->addAction(menu.addAction(tr(\"search '%1'\").arg(songName)))->setData(1);\n m_actionGroup->addAction(menu.addAction(tr(\"search '%1'\").arg(artistName)))->setData(2);\n m_actionGroup->addAction(menu.addAction(tr(\"search '%1 - %2'\").arg(songName).arg(artistName)))->setData(3);\n}\n\nvoid MusicQueryItemTableWidget::resizeEvent(QResizeEvent *event)\n{\n MusicQueryTableWidget::resizeEvent(event);\n m_loadingLabel->move((width() - m_loadingLabel->width())\/2, (height() - m_loadingLabel->height())\/2);\n}\n<commit_msg>Optimized the query item label[800156]<commit_after>#include \"musicquerytablewidget.h\"\n#include \"musicdownloadqueryfactory.h\"\n#include \"musicitemdelegate.h\"\n#include \"musicgiflabelwidget.h\"\n\n#include <QActionGroup>\n\nMusicQueryTableWidget::MusicQueryTableWidget(QWidget *parent)\n : MusicFillItemTableWidget(parent)\n{\n m_downLoadManager = nullptr;\n}\n\nMusicQueryTableWidget::~MusicQueryTableWidget()\n{\n delete m_downLoadManager;\n}\n\nQString MusicQueryTableWidget::getClassName()\n{\n return staticMetaObject.className();\n}\n\nvoid MusicQueryTableWidget::setQueryInput(MusicDownLoadQueryThreadAbstract *query)\n{\n delete m_downLoadManager;\n m_downLoadManager = query;\n connect(m_downLoadManager, SIGNAL(clearAllItems()), SLOT(clearAllItems()));\n connect(m_downLoadManager, SIGNAL(createSearchedItems(QString,QString,QString)),\n SLOT(createSearchedItems(QString,QString,QString)));\n}\n\nvoid MusicQueryTableWidget::contextMenuEvent(QContextMenuEvent *event)\n{\n Q_UNUSED(event);\n}\n\n\n\nMusicQueryItemTableWidget::MusicQueryItemTableWidget(QWidget *parent)\n : MusicQueryTableWidget(parent)\n{\n m_loadingLabel = new MusicGifLabelWidget(MusicGifLabelWidget::Gif_Cicle_Blue, this);\n m_actionGroup = new QActionGroup(this);\n m_labelDelegate = new MusicLabelDelegate(this);\n connect(m_actionGroup, SIGNAL(triggered(QAction*)), SLOT(actionGroupClick(QAction*)));\n connect(this, SIGNAL(cellDoubleClicked(int,int)), SLOT(itemDoubleClicked(int,int)));\n}\n\nMusicQueryItemTableWidget::~MusicQueryItemTableWidget()\n{\n delete m_loadingLabel;\n delete m_actionGroup;\n delete m_labelDelegate;\n}\n\nQString MusicQueryItemTableWidget::getClassName()\n{\n return staticMetaObject.className();\n}\n\nvoid MusicQueryItemTableWidget::startSearchQuery(const QString &text)\n{\n Q_UNUSED(text);\n MusicDownLoadQueryThreadAbstract *d = M_DOWNLOAD_QUERY_PTR->getQueryThread(this);\n connect(d, SIGNAL(downLoadDataChanged(QString)), SLOT(createFinishedItem()));\n setQueryInput( d );\n}\n\nvoid MusicQueryItemTableWidget::clearAllItems()\n{\n if(rowCount() > 0)\n {\n setItemDelegateForRow(rowCount() - 1, nullptr);\n }\n MusicAbstractTableWidget::clear();\n}\n\nvoid MusicQueryItemTableWidget::actionGroupClick(QAction *action)\n{\n int row = currentRow();\n if( row < 0 || (row >= rowCount() - 1))\n {\n return;\n }\n\n QString songName = (row != -1 && rowCount() > 0) ? item(row, 1)->toolTip() : QString();\n QString artistName = (row != -1 && rowCount() > 0) ? item(row, 2)->toolTip() : QString();\n\n switch( action->data().toInt() )\n {\n case 0: musicDownloadLocal(row); break;\n case 1: emit restartSearchQuery(songName); break;\n case 2: emit restartSearchQuery(artistName); break;\n case 3: emit restartSearchQuery(songName + \"-\" + artistName); break;\n }\n}\n\nvoid MusicQueryItemTableWidget::createFinishedItem()\n{\n m_loadingLabel->hide();\n m_loadingLabel->stop();\n\n setRowCount(rowCount() + 1);\n int count = rowCount() - 1;\n for(int i=0; i<columnCount(); ++i)\n {\n setItem(count, i, new QTableWidgetItem);\n }\n setSpan(count, 0, 1, columnCount());\n\n QTableWidgetItem *it = item(count, 0);\n if(it)\n {\n it->setData(MUSIC_TEXTS_ROLE, tr(\"No More Data\"));\n setItemDelegateForRow(count, m_labelDelegate);\n }\n}\n\nvoid MusicQueryItemTableWidget::createContextMenu(QMenu &menu)\n{\n menu.setStyleSheet(MusicUIObject::MMenuStyle02);\n m_actionGroup->addAction(menu.addAction(tr(\"musicDownload\")))->setData(0);\n\n menu.addSeparator();\n\n QString songName = currentRow() != -1 && rowCount() > 0 ?\n item(currentRow(), 1)->toolTip() : QString();\n QString artistName = currentRow() != -1 && rowCount() > 0 ?\n item(currentRow(), 2)->toolTip() : QString();\n m_actionGroup->addAction(menu.addAction(tr(\"search '%1'\").arg(songName)))->setData(1);\n m_actionGroup->addAction(menu.addAction(tr(\"search '%1'\").arg(artistName)))->setData(2);\n m_actionGroup->addAction(menu.addAction(tr(\"search '%1 - %2'\").arg(songName).arg(artistName)))->setData(3);\n}\n\nvoid MusicQueryItemTableWidget::resizeEvent(QResizeEvent *event)\n{\n MusicQueryTableWidget::resizeEvent(event);\n m_loadingLabel->move((width() - m_loadingLabel->width())\/2, (height() - m_loadingLabel->height())\/2);\n}\n<|endoftext|>"} {"text":"<commit_before>\/** @file gsBlockOp.cpp\n\n @brief Simple class create a block preconditioner structure.\n\n This file is part of the G+Smo library.\n\n This Source Code Form is subject to the terms of the Mozilla Public\n License, v. 2.0. If a copy of the MPL was not distributed with this\n file, You can obtain one at http:\/\/mozilla.org\/MPL\/2.0\/.\n\n Author(s): J. Sogn\n*\/\n#include <gsSolver\/gsBlockPreconditioner.h>\n\nnamespace gismo\n{\n\n\ngsBlockOp::gsBlockOp(index_t nRows, index_t nCols)\n{\n blockPrec.resize(nRows, nCols);\n blockTargetPositions.setZero(nCols);\n blockInputPositions.setZero(nRows);\n \/\/ Fill up all block entries with null pointers.\n for (index_t i = 0; i < nRows; ++i)\n for (index_t j = 0; j < nCols; ++j)\n blockPrec(i,j).reset();\n}\n\n\nvoid gsBlockOp::addOperator(index_t row, index_t col, const BasePtr& op)\n{\n GISMO_ASSERT( row >= 0 && row < blockPrec.rows(), \"The given row is not feasible.\" );\n GISMO_ASSERT( col >= 0 && col < blockPrec.cols(), \"The given column is not feasible.\" );\n GISMO_ASSERT( op->rows() == blockTargetPositions[row] || blockTargetPositions[row] == 0,\n \"The size of the given preconditioner does not fit to the other preconditioners in the same row.\" );\n GISMO_ASSERT( op->cols() == blockTargetPositions[col] || blockTargetPositions[col] == 0,\n \"The size of the given preconditioner does not fit to the other preconditioners in the same column.\" );\n \n blockPrec(row, col) = op;\n blockTargetPositions[row] = op->rows();\n blockInputPositions[col] = op->cols();\n}\n\n\nvoid gsBlockOp::apply(const gsMatrix<real_t> & input, gsMatrix<real_t> & result) const\n{\n result.setZero(blockTargetPositions.sum(), input.cols());\n gsVector<index_t> singleCol(1);\n singleCol << input.cols();\n gsMatrix<real_t>::BlockView resultBlocks= result.blockView(blockTargetPositions, singleCol);\n\n for (index_t i = 0; i < blockPrec.rows() ; ++i)\n {\n index_t inputIndex = 0;\n for (index_t j = 0; j < blockPrec.cols(); ++j)\n {\n if (!blockPrec(i,j))\/\/ if the block is a null pointer\n {\n inputIndex += blockInputPositions(j);\n continue;\n }\n\n gsMatrix<real_t> tmp_result;\n blockPrec(i,j)->apply(input.block(inputIndex,0,blockInputPositions(j),input.cols()),tmp_result);\n resultBlocks(i) += tmp_result;\n inputIndex += blockInputPositions(j);\n }\n }\n}\n\nconst gsBlockOp::BasePtr & gsBlockOp::getOperator(index_t row, index_t col) const\n{\n GISMO_ASSERT(blockPrec(row, col)!=NULL, \"No linear operator exists in this block\");\n return blockPrec(row,col);\n}\n\n}\n\n<commit_msg>small fix<commit_after>\/** @file gsBlockOp.cpp\n\n @brief Simple class create a block preconditioner structure.\n\n This file is part of the G+Smo library.\n\n This Source Code Form is subject to the terms of the Mozilla Public\n License, v. 2.0. If a copy of the MPL was not distributed with this\n file, You can obtain one at http:\/\/mozilla.org\/MPL\/2.0\/.\n\n Author(s): J. Sogn\n*\/\n#include <gsSolver\/gsBlockPreconditioner.h>\n\nnamespace gismo\n{\n\n\ngsBlockOp::gsBlockOp(index_t nRows, index_t nCols)\n{\n blockPrec.resize(nRows, nCols);\n blockTargetPositions.setZero(nCols);\n blockInputPositions.setZero(nRows);\n \/\/ Fill up all block entries with null pointers.\n for (index_t i = 0; i < nRows; ++i)\n for (index_t j = 0; j < nCols; ++j)\n blockPrec(i,j).reset();\n}\n\n\nvoid gsBlockOp::addOperator(index_t row, index_t col, const BasePtr& op)\n{\n GISMO_ASSERT( row >= 0 && row < blockPrec.rows(), \"The given row is not feasible.\" );\n GISMO_ASSERT( col >= 0 && col < blockPrec.cols(), \"The given column is not feasible.\" );\n GISMO_ASSERT( op->rows() == blockTargetPositions[row] || blockTargetPositions[row] == 0,\n \"The size of the given preconditioner does not fit to the other preconditioners in the same row.\" );\n GISMO_ASSERT( op->cols() == blockTargetPositions[col] || blockTargetPositions[col] == 0,\n \"The size of the given preconditioner does not fit to the other preconditioners in the same column.\" );\n \n blockPrec(row, col) = op;\n blockTargetPositions[row] = op->rows();\n blockInputPositions[col] = op->cols();\n}\n\n\nvoid gsBlockOp::apply(const gsMatrix<real_t> & input, gsMatrix<real_t> & result) const\n{\n result.setZero(blockTargetPositions.sum(), input.cols());\n gsVector<index_t> singleCol(1);\n singleCol << input.cols();\n gsMatrix<real_t>::BlockView resultBlocks= result.blockView(blockTargetPositions, singleCol);\n\n for (index_t i = 0; i < blockPrec.rows() ; ++i)\n {\n index_t inputIndex = 0;\n for (index_t j = 0; j < blockPrec.cols(); ++j)\n {\n if (!blockPrec(i,j))\/\/ if the block is a null pointer\n {\n inputIndex += blockInputPositions(j);\n continue;\n }\n\n gsMatrix<real_t> tmp_result;\n blockPrec(i,j)->apply(input.block(inputIndex,0,blockInputPositions(j),input.cols()),tmp_result);\n resultBlocks(i) += tmp_result;\n inputIndex += blockInputPositions(j);\n }\n }\n}\n\nconst gsBlockOp::BasePtr & gsBlockOp::getOperator(index_t row, index_t col) const\n{\n GISMO_ASSERT((bool)blockPrec(row, col)!=0, \"No linear operator exists in this block\");\n return blockPrec(row,col);\n}\n\n}\n\n<|endoftext|>"} {"text":"<commit_before><commit_msg>[Second attempt]<commit_after><|endoftext|>"} {"text":"<commit_before>\/\/ Copyright (c) 2019 Chris Ohk, Youngjoong Kim, SeungHyun Jeon\n\n\/\/ We are making my contributions\/submissions to this project solely in our\n\/\/ personal capacity and are not conveying any rights to any intellectual\n\/\/ property of any third parties.\n\n#include <Utils\/CardSetUtils.hpp>\n\n#include <Rosetta\/Actions\/Draw.hpp>\n#include <Rosetta\/Cards\/Cards.hpp>\n\nusing namespace RosettaStone;\nusing namespace PlayerTasks;\nusing namespace SimpleTasks;\n\nTEST(Expert1CardsGen, CS2_028)\n{\n GameConfig config;\n config.player1Class = CardClass::MAGE;\n config.player2Class = CardClass::PALADIN;\n config.startPlayer = PlayerType::PLAYER1;\n config.doFillDecks = true;\n config.autoRun = false;\n\n Game game(config);\n game.StartGame();\n\n Player& curPlayer = game.GetCurrentPlayer();\n Player& opPlayer = game.GetOpponentPlayer();\n curPlayer.SetTotalMana(10);\n curPlayer.SetUsedMana(0);\n opPlayer.SetTotalMana(10);\n opPlayer.SetUsedMana(0);\n\n auto& opField = opPlayer.GetField();\n\n const auto card1 = Generic::DrawCard(\n curPlayer, Cards::GetInstance().FindCardByName(\"Blizzard\"));\n const auto card2 = Generic::DrawCard(\n opPlayer, Cards::GetInstance().FindCardByName(\"Boulderfist Ogre\"));\n const auto card3 = Generic::DrawCard(\n opPlayer, Cards::GetInstance().FindCardByName(\"Wolfrider\"));\n\n Task::Run(curPlayer, EndTurnTask());\n game.ProcessUntil(Step::MAIN_START);\n\n Task::Run(opPlayer, PlayCardTask::Minion(opPlayer, card2));\n Task::Run(opPlayer, PlayCardTask::Minion(opPlayer, card3));\n EXPECT_EQ(opField.GetNumOfMinions(), 2u);\n\n Task::Run(opPlayer, EndTurnTask());\n game.ProcessUntil(Step::MAIN_START);\n\n Task::Run(curPlayer, PlayCardTask::Spell(curPlayer, card1));\n EXPECT_EQ(opField.GetNumOfMinions(), 1u);\n EXPECT_EQ(opField.GetMinion(0)->GetHealth(), 5);\n EXPECT_EQ(opField.GetMinion(0)->GetGameTag(GameTag::FROZEN), 1);\n EXPECT_EQ(opPlayer.GetHero()->GetHealth(), 30);\n EXPECT_EQ(opPlayer.GetHero()->GetGameTag(GameTag::FROZEN), 0);\n}\n\nTEST(Expert1CardsGen, CS2_151)\n{\n GameConfig config;\n config.player1Class = CardClass::PALADIN;\n config.player2Class = CardClass::WARRIOR;\n config.startPlayer = PlayerType::PLAYER1;\n config.doFillDecks = true;\n config.autoRun = false;\n\n Game game(config);\n game.StartGame();\n game.ProcessUntil(Step::MAIN_START);\n\n Player& curPlayer = game.GetCurrentPlayer();\n Player& opPlayer = game.GetOpponentPlayer();\n curPlayer.SetTotalMana(10);\n curPlayer.SetUsedMana(0);\n opPlayer.SetTotalMana(10);\n opPlayer.SetUsedMana(0);\n\n auto& curField = curPlayer.GetField();\n\n const auto card1 = Generic::DrawCard(\n curPlayer, Cards::GetInstance().FindCardByName(\"Silver Hand Knight\"));\n\n Task::Run(curPlayer, PlayCardTask::Minion(curPlayer, card1));\n EXPECT_EQ(curField.GetMinion(0)->GetAttack(), 4);\n EXPECT_EQ(curField.GetMinion(0)->GetHealth(), 4);\n EXPECT_EQ(curField.GetMinion(1)->GetAttack(), 2);\n EXPECT_EQ(curField.GetMinion(1)->GetHealth(), 2);\n}\n\nTEST(Expert1CardsGen, CS2_117)\n{\n GameConfig config;\n config.player1Class = CardClass::PALADIN;\n config.player2Class = CardClass::WARRIOR;\n config.startPlayer = PlayerType::PLAYER1;\n config.doFillDecks = true;\n config.autoRun = false;\n\n Game game(config);\n game.StartGame();\n game.ProcessUntil(Step::MAIN_START);\n\n Player& curPlayer = game.GetCurrentPlayer();\n Player& opPlayer = game.GetOpponentPlayer();\n curPlayer.SetTotalMana(10);\n curPlayer.SetUsedMana(0);\n opPlayer.SetTotalMana(10);\n opPlayer.SetUsedMana(0);\n curPlayer.GetHero()->SetDamage(10);\n\n auto& opField = opPlayer.GetField();\n\n const auto card1 = Generic::DrawCard(\n curPlayer, Cards::GetInstance().FindCardByName(\"Earthen Ring Farseer\"));\n const auto card2 = Generic::DrawCard(\n curPlayer, Cards::GetInstance().FindCardByName(\"Earthen Ring Farseer\"));\n const auto card3 = Generic::DrawCard(\n opPlayer, Cards::GetInstance().FindCardByName(\"Acidic Swamp Ooze\"));\n\n Task::Run(curPlayer, EndTurnTask());\n game.ProcessUntil(Step::MAIN_START);\n\n Task::Run(opPlayer, PlayCardTask::Minion(opPlayer, card3));\n opField.GetMinion(0)->SetDamage(1);\n\n Task::Run(opPlayer, EndTurnTask());\n game.ProcessUntil(Step::MAIN_START);\n\n Task::Run(curPlayer, PlayCardTask::MinionTarget(curPlayer, card1,\n curPlayer.GetHero()));\n EXPECT_EQ(curPlayer.GetHero()->GetHealth(), 23);\n\n Task::Run(curPlayer, PlayCardTask::MinionTarget(curPlayer, card2, card3));\n EXPECT_EQ(opField.GetMinion(0)->GetHealth(), 2);\n}\n\nTEST(Expert1CardsGen, EX1_012)\n{\n GameConfig config;\n config.player1Class = CardClass::MAGE;\n config.player2Class = CardClass::PALADIN;\n config.startPlayer = PlayerType::PLAYER1;\n config.doFillDecks = true;\n config.autoRun = false;\n\n Game game(config);\n game.StartGame();\n game.ProcessUntil(Step::MAIN_START);\n\n Player& curPlayer = game.GetCurrentPlayer();\n Player& opPlayer = game.GetOpponentPlayer();\n curPlayer.SetTotalMana(10);\n curPlayer.SetUsedMana(0);\n opPlayer.SetTotalMana(10);\n opPlayer.SetUsedMana(0);\n\n auto& curField = curPlayer.GetField();\n auto& opField = opPlayer.GetField();\n\n const auto card1 = Generic::DrawCard(\n curPlayer, Cards::GetInstance().FindCardByName(\"Bloodmage Thalnos\"));\n const auto card2 = Generic::DrawCard(\n curPlayer, Cards::GetInstance().FindCardByName(\"Blizzard\"));\n const auto card3 = Generic::DrawCard(\n opPlayer, Cards::GetInstance().FindCardByName(\"Boulderfist Ogre\"));\n const auto card4 = Generic::DrawCard(\n opPlayer, Cards::GetInstance().FindCardByName(\"Wolfrider\"));\n const auto card5 = Generic::DrawCard(\n opPlayer, Cards::GetInstance().FindCardByName(\"Wolfrider\"));\n\n Task::Run(curPlayer, EndTurnTask());\n game.ProcessUntil(Step::MAIN_START);\n\n Task::Run(opPlayer, PlayCardTask::Minion(opPlayer, card3));\n Task::Run(opPlayer, PlayCardTask::Minion(opPlayer, card4));\n EXPECT_EQ(opField.GetNumOfMinions(), 2u);\n\n Task::Run(opPlayer, EndTurnTask());\n game.ProcessUntil(Step::MAIN_START);\n\n Task::Run(curPlayer, PlayCardTask::Minion(curPlayer, card1));\n EXPECT_EQ(curPlayer.currentSpellPower, 1);\n\n Task::Run(curPlayer, PlayCardTask::Spell(curPlayer, card2));\n EXPECT_EQ(opField.GetNumOfMinions(), 1u);\n EXPECT_EQ(opField.GetMinion(0)->GetHealth(), 4);\n EXPECT_EQ(opField.GetMinion(0)->GetGameTag(GameTag::FROZEN), 1);\n\n Task::Run(curPlayer, EndTurnTask());\n game.ProcessUntil(Step::MAIN_START);\n\n Task::Run(opPlayer, PlayCardTask::Minion(opPlayer, card5));\n Task::Run(opPlayer, AttackTask(card5, card1));\n EXPECT_EQ(curField.GetNumOfMinions(), 0u);\n EXPECT_EQ(curPlayer.currentSpellPower, 0);\n EXPECT_EQ(curPlayer.GetHand().GetNumOfCards(), 6u);\n}<commit_msg>test: Add test code for checking frozen state<commit_after>\/\/ Copyright (c) 2019 Chris Ohk, Youngjoong Kim, SeungHyun Jeon\n\n\/\/ We are making my contributions\/submissions to this project solely in our\n\/\/ personal capacity and are not conveying any rights to any intellectual\n\/\/ property of any third parties.\n\n#include <Utils\/CardSetUtils.hpp>\n\n#include <Rosetta\/Actions\/Draw.hpp>\n#include <Rosetta\/Cards\/Cards.hpp>\n\nusing namespace RosettaStone;\nusing namespace PlayerTasks;\nusing namespace SimpleTasks;\n\nTEST(Expert1CardsGen, CS2_028)\n{\n GameConfig config;\n config.player1Class = CardClass::MAGE;\n config.player2Class = CardClass::PALADIN;\n config.startPlayer = PlayerType::PLAYER1;\n config.doFillDecks = true;\n config.autoRun = false;\n\n Game game(config);\n game.StartGame();\n\n Player& curPlayer = game.GetCurrentPlayer();\n Player& opPlayer = game.GetOpponentPlayer();\n curPlayer.SetTotalMana(10);\n curPlayer.SetUsedMana(0);\n opPlayer.SetTotalMana(10);\n opPlayer.SetUsedMana(0);\n\n auto& opField = opPlayer.GetField();\n\n const auto card1 = Generic::DrawCard(\n curPlayer, Cards::GetInstance().FindCardByName(\"Blizzard\"));\n const auto card2 = Generic::DrawCard(\n opPlayer, Cards::GetInstance().FindCardByName(\"Boulderfist Ogre\"));\n const auto card3 = Generic::DrawCard(\n opPlayer, Cards::GetInstance().FindCardByName(\"Wolfrider\"));\n\n Task::Run(curPlayer, EndTurnTask());\n game.ProcessUntil(Step::MAIN_START);\n\n Task::Run(opPlayer, PlayCardTask::Minion(opPlayer, card2));\n Task::Run(opPlayer, PlayCardTask::Minion(opPlayer, card3));\n EXPECT_EQ(opField.GetNumOfMinions(), 2u);\n\n Task::Run(opPlayer, EndTurnTask());\n game.ProcessUntil(Step::MAIN_START);\n\n Task::Run(curPlayer, PlayCardTask::Spell(curPlayer, card1));\n EXPECT_EQ(opField.GetNumOfMinions(), 1u);\n EXPECT_EQ(opField.GetMinion(0)->GetHealth(), 5);\n EXPECT_EQ(opField.GetMinion(0)->GetGameTag(GameTag::FROZEN), 1);\n EXPECT_EQ(opPlayer.GetHero()->GetHealth(), 30);\n EXPECT_EQ(opPlayer.GetHero()->GetGameTag(GameTag::FROZEN), 0);\n\n Task::Run(curPlayer, EndTurnTask());\n game.ProcessUntil(Step::MAIN_START);\n\n Task::Run(opPlayer, AttackTask(card2, curPlayer.GetHero()));\n EXPECT_EQ(opField.GetMinion(0)->GetGameTag(GameTag::FROZEN), 1);\n EXPECT_EQ(curPlayer.GetHero()->GetHealth(), 30);\n\n Task::Run(opPlayer, EndTurnTask());\n game.ProcessUntil(Step::MAIN_START);\n\n EXPECT_EQ(opField.GetMinion(0)->GetGameTag(GameTag::FROZEN), 0);\n}\n\nTEST(Expert1CardsGen, CS2_151)\n{\n GameConfig config;\n config.player1Class = CardClass::PALADIN;\n config.player2Class = CardClass::WARRIOR;\n config.startPlayer = PlayerType::PLAYER1;\n config.doFillDecks = true;\n config.autoRun = false;\n\n Game game(config);\n game.StartGame();\n game.ProcessUntil(Step::MAIN_START);\n\n Player& curPlayer = game.GetCurrentPlayer();\n Player& opPlayer = game.GetOpponentPlayer();\n curPlayer.SetTotalMana(10);\n curPlayer.SetUsedMana(0);\n opPlayer.SetTotalMana(10);\n opPlayer.SetUsedMana(0);\n\n auto& curField = curPlayer.GetField();\n\n const auto card1 = Generic::DrawCard(\n curPlayer, Cards::GetInstance().FindCardByName(\"Silver Hand Knight\"));\n\n Task::Run(curPlayer, PlayCardTask::Minion(curPlayer, card1));\n EXPECT_EQ(curField.GetMinion(0)->GetAttack(), 4);\n EXPECT_EQ(curField.GetMinion(0)->GetHealth(), 4);\n EXPECT_EQ(curField.GetMinion(1)->GetAttack(), 2);\n EXPECT_EQ(curField.GetMinion(1)->GetHealth(), 2);\n}\n\nTEST(Expert1CardsGen, CS2_117)\n{\n GameConfig config;\n config.player1Class = CardClass::PALADIN;\n config.player2Class = CardClass::WARRIOR;\n config.startPlayer = PlayerType::PLAYER1;\n config.doFillDecks = true;\n config.autoRun = false;\n\n Game game(config);\n game.StartGame();\n game.ProcessUntil(Step::MAIN_START);\n\n Player& curPlayer = game.GetCurrentPlayer();\n Player& opPlayer = game.GetOpponentPlayer();\n curPlayer.SetTotalMana(10);\n curPlayer.SetUsedMana(0);\n opPlayer.SetTotalMana(10);\n opPlayer.SetUsedMana(0);\n curPlayer.GetHero()->SetDamage(10);\n\n auto& opField = opPlayer.GetField();\n\n const auto card1 = Generic::DrawCard(\n curPlayer, Cards::GetInstance().FindCardByName(\"Earthen Ring Farseer\"));\n const auto card2 = Generic::DrawCard(\n curPlayer, Cards::GetInstance().FindCardByName(\"Earthen Ring Farseer\"));\n const auto card3 = Generic::DrawCard(\n opPlayer, Cards::GetInstance().FindCardByName(\"Acidic Swamp Ooze\"));\n\n Task::Run(curPlayer, EndTurnTask());\n game.ProcessUntil(Step::MAIN_START);\n\n Task::Run(opPlayer, PlayCardTask::Minion(opPlayer, card3));\n opField.GetMinion(0)->SetDamage(1);\n\n Task::Run(opPlayer, EndTurnTask());\n game.ProcessUntil(Step::MAIN_START);\n\n Task::Run(curPlayer, PlayCardTask::MinionTarget(curPlayer, card1,\n curPlayer.GetHero()));\n EXPECT_EQ(curPlayer.GetHero()->GetHealth(), 23);\n\n Task::Run(curPlayer, PlayCardTask::MinionTarget(curPlayer, card2, card3));\n EXPECT_EQ(opField.GetMinion(0)->GetHealth(), 2);\n}\n\nTEST(Expert1CardsGen, EX1_012)\n{\n GameConfig config;\n config.player1Class = CardClass::MAGE;\n config.player2Class = CardClass::PALADIN;\n config.startPlayer = PlayerType::PLAYER1;\n config.doFillDecks = true;\n config.autoRun = false;\n\n Game game(config);\n game.StartGame();\n game.ProcessUntil(Step::MAIN_START);\n\n Player& curPlayer = game.GetCurrentPlayer();\n Player& opPlayer = game.GetOpponentPlayer();\n curPlayer.SetTotalMana(10);\n curPlayer.SetUsedMana(0);\n opPlayer.SetTotalMana(10);\n opPlayer.SetUsedMana(0);\n\n auto& curField = curPlayer.GetField();\n auto& opField = opPlayer.GetField();\n\n const auto card1 = Generic::DrawCard(\n curPlayer, Cards::GetInstance().FindCardByName(\"Bloodmage Thalnos\"));\n const auto card2 = Generic::DrawCard(\n curPlayer, Cards::GetInstance().FindCardByName(\"Blizzard\"));\n const auto card3 = Generic::DrawCard(\n opPlayer, Cards::GetInstance().FindCardByName(\"Boulderfist Ogre\"));\n const auto card4 = Generic::DrawCard(\n opPlayer, Cards::GetInstance().FindCardByName(\"Wolfrider\"));\n const auto card5 = Generic::DrawCard(\n opPlayer, Cards::GetInstance().FindCardByName(\"Wolfrider\"));\n\n Task::Run(curPlayer, EndTurnTask());\n game.ProcessUntil(Step::MAIN_START);\n\n Task::Run(opPlayer, PlayCardTask::Minion(opPlayer, card3));\n Task::Run(opPlayer, PlayCardTask::Minion(opPlayer, card4));\n EXPECT_EQ(opField.GetNumOfMinions(), 2u);\n\n Task::Run(opPlayer, EndTurnTask());\n game.ProcessUntil(Step::MAIN_START);\n\n Task::Run(curPlayer, PlayCardTask::Minion(curPlayer, card1));\n EXPECT_EQ(curPlayer.currentSpellPower, 1);\n\n Task::Run(curPlayer, PlayCardTask::Spell(curPlayer, card2));\n EXPECT_EQ(opField.GetNumOfMinions(), 1u);\n EXPECT_EQ(opField.GetMinion(0)->GetHealth(), 4);\n EXPECT_EQ(opField.GetMinion(0)->GetGameTag(GameTag::FROZEN), 1);\n\n Task::Run(curPlayer, EndTurnTask());\n game.ProcessUntil(Step::MAIN_START);\n\n Task::Run(opPlayer, PlayCardTask::Minion(opPlayer, card5));\n Task::Run(opPlayer, AttackTask(card5, card1));\n EXPECT_EQ(curField.GetNumOfMinions(), 0u);\n EXPECT_EQ(curPlayer.currentSpellPower, 0);\n EXPECT_EQ(curPlayer.GetHand().GetNumOfCards(), 6u);\n}<|endoftext|>"} {"text":"<commit_before>#include <windows.h>\n#include <string>\n#include <sstream>\n#include <vector>\n#include <codecvt>\n#include <iostream>\n#include <fstream>\n#include <cstdio>\n\n#include <iostream>\n#include <fstream>\nusing namespace std;\n\ninline wstring s2ws(const std::string& str)\n{\n typedef codecvt_utf8<wchar_t> convert_typeX;\n wstring_convert<convert_typeX, wchar_t> converterX;\n return converterX.from_bytes(str);\n}\n\n#define BUFSIZE 4096\nint main(int argc, char** argv)\n{\n char chBuf[BUFSIZE];\n unsigned long dwRead = 1;\n BOOL fSuccess = true;\n HANDLE hStdin;\n bool writeToConsole;\n bool writeToFile;\n string consoleName;\n HANDLE out;\n HANDLE fileHandle;\n WORD color;\n\n if(argc > 4)\n {\n consoleName = string(argv[1]);\n color = atoi(argv[2]);\n writeToConsole = atoi(argv[3]);\n writeToFile = atoi(argv[4]);\n\n \/\/ For some reason this represents the pipe, gg\n hStdin = GetStdHandle(STD_INPUT_HANDLE);\n if(hStdin == INVALID_HANDLE_VALUE)\n {\n ExitProcess(1);\n }\n }\n else\n {\n return 1;\n }\n\n if(writeToConsole)\n {\n out = CreateFile(TEXT(\"CONOUT$\"), GENERIC_WRITE, FILE_SHARE_READ, 0, OPEN_EXISTING, 0, 0);\n\n if(out == INVALID_HANDLE_VALUE)\n {\n return 1;\n }\n SetConsoleTitle(s2ws(consoleName).c_str());\n SetConsoleTextAttribute(out, color);\n }\n else\n {\n FreeConsole();\n }\n\n if(writeToFile)\n {\n \/\/ Create log folder\n CreateDirectory(L\"logs\", NULL);\n\n \/\/ Build logfilename\n struct tm now;\n time_t time_create = time(NULL);\n localtime_s(&now, &time_create);\n consoleName = string(\"logs\/\" + std::to_string(now.tm_hour) + \".\" + std::to_string(now.tm_min) + \"-\" + consoleName);\n consoleName.append(\".txt\");\n\n \/\/ Create the file\n fileHandle = CreateFile(s2ws(consoleName).c_str(), GENERIC_WRITE, FILE_SHARE_READ, 0, OPEN_ALWAYS, 0, 0);\n if(fileHandle == INVALID_HANDLE_VALUE)\n {\n return 1;\n }\n }\n\n while(true)\n {\n if(!fSuccess || !dwRead)\n {\n break;\n }\n fSuccess = ReadFile(hStdin, chBuf, BUFSIZE, &dwRead, NULL);\n\n if(writeToConsole)\n {\n WriteFile(out, chBuf, dwRead, &dwRead, 0);\n }\n\n if(writeToFile)\n {\n WriteFile(fileHandle, chBuf, dwRead, &dwRead, 0);\n }\n }\n return 1;\n}<commit_msg>Better logfilename and some code cleanup<commit_after>#include <windows.h>\n#include <string>\n#include <sstream>\n#include <vector>\n#include <codecvt>\n#include <iostream>\n#include <fstream>\n#include <cstdio>\n\n#include <iostream>\n#include <fstream>\nusing namespace std;\n\ninline wstring s2ws(const std::string& str)\n{\n typedef codecvt_utf8<wchar_t> convert_typeX;\n wstring_convert<convert_typeX, wchar_t> converterX;\n return converterX.from_bytes(str);\n}\n\ninline string getTwoDigit(const int& value)\n{\n if(value < 10)\n {\n return string(\"0\" + value);\n }\n return to_string(value);\n}\n\ninline string buildLogFileName(const string& p_consoleName)\n{\n struct tm now;\n time_t time_create = time(NULL);\n localtime_s(&now, &time_create);\n\n string fileName = string(\"logs\/\");\n fileName.append(getTwoDigit(now.tm_year + 1900) + \"-\");\n fileName.append(getTwoDigit(now.tm_mon + 1) + \"-\");\n fileName.append(getTwoDigit(now.tm_mday) + \"_\");\n fileName.append(getTwoDigit(now.tm_hour) + \".\");\n fileName.append(getTwoDigit(now.tm_min));\n fileName.append(\"__\" + p_consoleName);\n fileName.append(\".txt\");\n return fileName;\n}\n\n#define BUFSIZE 4096\nint main(int argc, char** argv)\n{\n char chBuf[BUFSIZE];\n unsigned long dwRead = 1;\n BOOL fSuccess = true;\n HANDLE hStdin;\n bool writeToConsole;\n bool writeToFile;\n string consoleName;\n HANDLE out;\n HANDLE fileHandle;\n WORD color;\n\n if(argc > 4)\n {\n \/\/ TODORT Handle client and server logs\n consoleName = string(argv[1]);\n color = atoi(argv[2]);\n writeToConsole = atoi(argv[3]);\n writeToFile = atoi(argv[4]);\n\n \/\/ For some reason this represents the pipe, gg\n hStdin = GetStdHandle(STD_INPUT_HANDLE);\n if(hStdin == INVALID_HANDLE_VALUE)\n {\n#ifdef _DEBUG\n system(\"pause\");\n#endif\n ExitProcess(1); \/\/ TODORT more info\n }\n }\n else\n {\n#ifdef _DEBUG\n system(\"pause\");\n#endif\n ExitProcess(1); \/\/ TODORT more info\n }\n\n if(writeToConsole)\n {\n out = CreateFile(TEXT(\"CONOUT$\"), GENERIC_WRITE, FILE_SHARE_READ, 0, OPEN_EXISTING, 0, 0);\n\n if(out == INVALID_HANDLE_VALUE)\n {\n writeToConsole = false;\n }\n SetConsoleTitle(s2ws(consoleName).c_str());\n SetConsoleTextAttribute(out, color);\n }\n else\n {\n FreeConsole();\n }\n\n if(writeToFile)\n {\n \/\/ Create log folder\n CreateDirectory(L\"logs\", NULL);\n\n \/\/ Build logfilename\n const string& fileName = buildLogFileName(consoleName);\n\n \/\/ Create the file\n fileHandle = CreateFile(s2ws(fileName).c_str(), GENERIC_WRITE, FILE_SHARE_READ, 0, OPEN_ALWAYS, 0, 0);\n \/\/ TODO Add check to create another logfile if one already exists, because two clients may be runned at the same computer.\n\n if(fileHandle == INVALID_HANDLE_VALUE)\n {\n writeToFile = false;\n }\n }\n\n if(!writeToFile || !writeToConsole)\n {\n#ifdef _DEBUG\n system(\"pause\");\n#endif\n ExitProcess(1); \/\/ TODORT more info\n }\n\n while(true)\n {\n if(!fSuccess || !dwRead)\n {\n break;\n }\n fSuccess = ReadFile(hStdin, chBuf, BUFSIZE, &dwRead, NULL);\n\n if(writeToConsole)\n {\n WriteFile(out, chBuf, dwRead, &dwRead, 0);\n }\n\n if(writeToFile)\n {\n WriteFile(fileHandle, chBuf, dwRead, &dwRead, 0);\n }\n }\n return 0;\n}<|endoftext|>"} {"text":"<commit_before>#include \"cinder\/app\/App.h\"\n#include \"cinder\/app\/RendererGl.h\"\n#include \"cinder\/gl\/gl.h\"\n\n#include \"GridMesh.h\"\n#include \"CameraLandscape.h\"\n#include \"cinder\/MotionManager.h\"\n#include \"cinder\/Capture.h\"\n#include \"cinder\/Log.h\"\n#include \"GridTexture.h\"\n\nusing namespace ci;\nusing namespace ci::app;\nusing namespace std;\n\nusing namespace soso;\n\nclass GridSpaceApp : public App {\npublic:\n\tvoid setup() override;\n\tvoid mouseDown( MouseEvent event ) override;\n\tvoid update() override;\n\tvoid draw() override;\n\n\tvoid blurInput();\nprivate:\n\tGridMesh\t\t\t\tmesh;\n\tCameraLandscape landscape;\n\tCaptureRef\t\t\tcapture;\n\tCameraPersp\t\t\tcamera;\n\tGridTextureRef\tgridTexture;\n\tgl::FboRef\t\t\tblurredBuffer;\n\tgl::GlslProgRef\tdownsampleProg;\n};\n\nvoid GridSpaceApp::setup()\n{\n\tmesh.setup();\n\n\tMotionManager::enable();\n\n\tGLint size;\n\tglGetIntegerv( GL_MAX_TEXTURE_SIZE, &size );\n\tCI_LOG_I( \"Max texture size: \" << size );\n\n\tauto target = vec3( 50, 5, 50 );\n\tcamera.lookAt( vec3( 0 ), target, vec3( 0, 1, 0 ) );\n\tcamera.setPerspective( 60, getWindowAspectRatio(), 0.1f, 1000 );\n\n\ttry {\n\t\tauto front_facing_camera = ([] {\n\t\t\tauto &devices = Capture::getDevices();\n\t\t\tauto first_device = devices.front();\n\t\t\tfor( auto device : devices ) {\n\t\t\t\tif( device->isFrontFacing() ) {\n\t\t\t\t\treturn device;\n\t\t\t\t}\n\t\t\t}\n\t\t\treturn first_device;\n\t\t}());\n\n\t\tcapture = Capture::create( 480, 360, front_facing_camera );\n\t\tcapture->start();\n\t\tconst auto divisions = 8;\n\t\tconst auto size = divisions * capture->getSize();\n\t\tgridTexture = make_shared<GridTexture>( size.x, size.y, divisions );\n\n\t\tauto color_format = gl::Texture::Format();\n\t\tauto fbo_format = gl::Fbo::Format().disableDepth().colorTexture( color_format );\n\t\tblurredBuffer = gl::Fbo::create( size.x \/ (divisions * 2), size.y \/ (divisions * 2), fbo_format );\n\t}\n\tcatch( ci::Exception &exc ) {\n\t\tCI_LOG_E( \"Error using device camera: \" << exc.what() );\n\t}\n\n\tdownsampleProg = gl::GlslProg::create( loadAsset( \"blur.vs\" ), loadAsset( \"blur.fs\" ) );\n\/\/\tlandscape.setup( gridTexture->getTexture() );\n\tlandscape.setup( blurredBuffer->getColorTexture() );\n}\n\nvoid GridSpaceApp::mouseDown( MouseEvent event )\n{\n}\n\nvoid GridSpaceApp::update()\n{\n\tif( MotionManager::isDataAvailable() ) {\n\t\tauto r = MotionManager::getRotation();\n\t\tcamera.setOrientation( r );\n\t}\n\n\tif( capture->checkNewFrame() ) {\n\t\tgridTexture->update( *capture->getSurface() );\n\t\tblurInput();\n\t}\n}\n\nvoid GridSpaceApp::blurInput()\n{\n\tauto index = gridTexture->getCurrentIndex();\n\tauto size = blurredBuffer->getSize() \/ 8;\n\n\tgl::ScopedMatrices matrices;\n\tgl::ScopedTextureBind tex0( gridTexture->getTexture(), 0 );\n\tgl::ScopedGlslProg prog( downsampleProg );\n\tgl::ScopedViewport view( gridTexture->getIndexOffset( size, index ), size );\n\tgl::ScopedFramebuffer fbo( blurredBuffer );\n\n\tdownsampleProg->uniform( \"uSampler\", 0 );\n\tdownsampleProg->uniform( \"uFrameIndex\", (float)index );\n\n\tgl::drawSolidRect( Rectf( -1, -1, 1, 1 ), vec2( 0, 0 ), vec2( 1, 1 ) );\n}\n\nvoid GridSpaceApp::draw()\n{\n\tgl::clear( Color( 0, 0, 0 ) );\n\tgl::enableDepthRead();\n\tgl::enableDepthWrite();\n\n\tgl::setMatrices( camera );\n\tlandscape.draw( gridTexture->getCurrentIndex() );\n\tmesh.draw();\n\n\tif( gridTexture->getTexture() ) {\n\t\tauto size = vec2(192, 108) * 0.8f;\n\t\tgl::ScopedMatrices mat;\n\t\tgl::setMatricesWindow( app::getWindowSize() );\n\t\tgl::draw( gridTexture->getTexture(), Rectf( vec2(0), size ) );\n\n\t\tgl::translate( size * vec2(1, 0) );\n\t\tgl::draw( blurredBuffer->getColorTexture(), Rectf( vec2(0), size ) );\n\t}\n}\n\nCINDER_APP( GridSpaceApp, RendererGl )\n<commit_msg>Fix popping issue.<commit_after>#include \"cinder\/app\/App.h\"\n#include \"cinder\/app\/RendererGl.h\"\n#include \"cinder\/gl\/gl.h\"\n\n#include \"GridMesh.h\"\n#include \"CameraLandscape.h\"\n#include \"cinder\/MotionManager.h\"\n#include \"cinder\/Capture.h\"\n#include \"cinder\/Log.h\"\n#include \"GridTexture.h\"\n\nusing namespace ci;\nusing namespace ci::app;\nusing namespace std;\n\nusing namespace soso;\n\nclass GridSpaceApp : public App {\npublic:\n\tvoid setup() override;\n\tvoid mouseDown( MouseEvent event ) override;\n\tvoid update() override;\n\tvoid draw() override;\n\n\tvoid blurInput();\nprivate:\n\tGridMesh\t\t\t\tmesh;\n\tCameraLandscape landscape;\n\tCaptureRef\t\t\tcapture;\n\tCameraPersp\t\t\tcamera;\n\tGridTextureRef\tgridTexture;\n\tgl::FboRef\t\t\tblurredBuffer;\n\tgl::GlslProgRef\tdownsampleProg;\n};\n\nvoid GridSpaceApp::setup()\n{\n\tmesh.setup();\n\n\tMotionManager::enable();\n\n\tGLint size;\n\tglGetIntegerv( GL_MAX_TEXTURE_SIZE, &size );\n\tCI_LOG_I( \"Max texture size: \" << size );\n\n\tauto target = vec3( 50, 5, 50 );\n\tcamera.lookAt( vec3( 0 ), target, vec3( 0, 1, 0 ) );\n\tcamera.setPerspective( 60, getWindowAspectRatio(), 0.1f, 1000 );\n\n\ttry {\n\t\tauto front_facing_camera = ([] {\n\t\t\tauto &devices = Capture::getDevices();\n\t\t\tauto first_device = devices.front();\n\t\t\tfor( auto device : devices ) {\n\t\t\t\tif( device->isFrontFacing() ) {\n\t\t\t\t\treturn device;\n\t\t\t\t}\n\t\t\t}\n\t\t\treturn first_device;\n\t\t}());\n\n\t\tcapture = Capture::create( 480, 360, front_facing_camera );\n\t\tcapture->start();\n\t\tconst auto divisions = 8;\n\t\tconst auto size = divisions * capture->getSize();\n\t\tgridTexture = make_shared<GridTexture>( size.x, size.y, divisions );\n\n\t\tauto color_format = gl::Texture::Format();\n\t\tauto fbo_format = gl::Fbo::Format().disableDepth().colorTexture( color_format );\n\t\tblurredBuffer = gl::Fbo::create( size.x \/ (divisions), size.y \/ (divisions), fbo_format );\n\t}\n\tcatch( ci::Exception &exc ) {\n\t\tCI_LOG_E( \"Error using device camera: \" << exc.what() );\n\t}\n\n\tdownsampleProg = gl::GlslProg::create( loadAsset( \"blur.vs\" ), loadAsset( \"blur.fs\" ) );\n\/\/\tlandscape.setup( gridTexture->getTexture() );\n\tlandscape.setup( blurredBuffer->getColorTexture() );\n}\n\nvoid GridSpaceApp::mouseDown( MouseEvent event )\n{\n}\n\nvoid GridSpaceApp::update()\n{\n\tif( MotionManager::isDataAvailable() ) {\n\t\tauto r = MotionManager::getRotation();\n\t\tcamera.setOrientation( r );\n\t}\n\n\tif( capture->checkNewFrame() ) {\n\t\tgridTexture->update( *capture->getSurface() );\n\t\tblurInput();\n\t}\n}\n\nvoid GridSpaceApp::blurInput()\n{\n\tauto index = gridTexture->getCurrentIndex();\n\tauto size = blurredBuffer->getSize() \/ 8;\n\n\tgl::ScopedMatrices matrices;\n\tgl::ScopedTextureBind tex0( gridTexture->getTexture(), 0 );\n\tgl::ScopedGlslProg prog( downsampleProg );\n\tgl::ScopedViewport view( gridTexture->getIndexOffset( size, index ), size );\n\tgl::ScopedFramebuffer fbo( blurredBuffer );\n\n\tdownsampleProg->uniform( \"uSampler\", 0 );\n\tdownsampleProg->uniform( \"uFrameIndex\", (float)index );\n\n\tgl::drawSolidRect( Rectf( -1, -1, 1, 1 ), vec2( 0, 0 ), vec2( 1, 1 ) );\n}\n\nvoid GridSpaceApp::draw()\n{\n\tgl::clear( Color( 0, 0, 0 ) );\n\tgl::enableDepthRead();\n\tgl::enableDepthWrite();\n\n\tgl::setMatrices( camera );\n\tlandscape.draw( gridTexture->getCurrentIndex() );\n\tmesh.draw();\n\n\tif( gridTexture->getTexture() ) {\n\t\tauto size = vec2(192, 108) * 0.8f;\n\t\tgl::ScopedMatrices mat;\n\t\tgl::setMatricesWindow( app::getWindowSize() );\n\t\tgl::draw( gridTexture->getTexture(), Rectf( vec2(0), size ) );\n\n\t\tgl::translate( size * vec2(1, 0) );\n\t\tgl::draw( blurredBuffer->getColorTexture(), Rectf( vec2(0), size ) );\n\t}\n}\n\nCINDER_APP( GridSpaceApp, RendererGl )\n<|endoftext|>"} {"text":"<commit_before>#include \"core_include\/api.h\"\r\n#include \"core_include\/rect.h\"\r\n#include \"core_include\/cmd_target.h\"\r\n#include \"core_include\/wnd.h\"\r\n#include \"core_include\/surface.h\"\r\n#include \"core_include\/resource.h\"\r\n#include \"core_include\/word.h\"\r\n#include \"core_include\/msg.h\"\r\n#include \"core_include\/display.h\"\r\n#include \"core_include\/theme.h\"\r\n#include \"widgets_include\/label.h\"\r\n#include \"widgets_include\/button.h\"\r\n#include <stdlib.h>\r\n#include <stdio.h>\r\n\r\nconst int UI_WIDTH = 240;\r\nconst int UI_HEIGHT = 320;\r\n\r\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/ define widgets & map message \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\r\nenum WND_ID\r\n{\r\n\tID_ROOT = 1,\r\n\tID_LABEL1,\r\n\tID_LABEL2,\r\n\tID_LABEL3,\r\n\tID_BUTTON1,\r\n\tID_BUTTON2,\r\n\tID_BUTTON3\r\n};\r\n\r\nclass c_myUI : public c_wnd\r\n{\r\n\tvirtual c_wnd* clone() { return new c_myUI(); }\r\n\tvirtual void on_paint(void)\r\n\t{\r\n\t\tc_rect rect;\r\n\t\tget_screen_rect(rect);\r\n\t\tm_surface->fill_rect(rect, GL_RGB(0, 0, 0), m_z_order);\r\n\t}\r\n\tvoid on_clicked(unsigned int ctrl_id) {\r\n\t\tstatic int sum1, sum2, sum3;\r\n\t\tstatic char str1[8], str2[8], str3[8];\r\n\t\tc_button* button = (c_button*)get_wnd_ptr(ctrl_id);\r\n\t\tswitch (ctrl_id)\r\n\t\t{\r\n\t\tcase ID_BUTTON1:\r\n\t\t\tsprintf(str1, \"%d\", ++sum1);\r\n\t\t\tbutton->set_str(str1);\r\n\t\t\tbreak;\r\n\t\tcase ID_BUTTON2:\r\n\t\t\tsprintf(str2, \"%d\", ++sum2);\r\n\t\t\tbutton->set_str(str2);\r\n\t\t\tbreak;\r\n\t\tcase ID_BUTTON3:\r\n\t\t\tsprintf(str3, \"%d\", ++sum3);\r\n\t\t\tbutton->set_str(str3);\r\n\t\t\tbreak;\r\n\t\t}\r\n\t\tbutton->show_window();\r\n\t}\r\n\tGL_DECLARE_MESSAGE_MAP()\/\/delcare message\r\n};\r\n\r\n\/\/map message\r\nGL_BEGIN_MESSAGE_MAP(c_myUI)\r\nON_GL_BN_CLICKED(ID_BUTTON1, c_myUI::on_clicked)\r\nON_GL_BN_CLICKED(ID_BUTTON2, c_myUI::on_clicked)\r\nON_GL_BN_CLICKED(ID_BUTTON3, c_myUI::on_clicked)\r\nGL_END_MESSAGE_MAP()\r\n\r\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/ layout UI \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\r\nstatic c_myUI s_myUI;\r\nstatic c_label s_label1, s_label2, s_label3;\r\nstatic c_button s_button1, s_button2, s_button3;\r\nstatic WND_TREE s_myUI_children[] =\r\n{\r\n\t{&s_label1, ID_LABEL1, \"a: <<\", 20, 20, 80, 40, NULL},\r\n\t{&s_label2, ID_LABEL2, \"d: >>\", 20, 140, 80, 40, NULL},\r\n\t{&s_label3, ID_LABEL3, \"s: click\", 20, 260, 80, 40, NULL},\r\n\r\n\t{&s_button1, ID_BUTTON1, \"0\", 140, 20, 80, 40, NULL},\r\n\t{&s_button2, ID_BUTTON2, \"0\", 140, 140, 80, 40, NULL},\r\n\t{&s_button3, ID_BUTTON3, \"0\", 140, 260, 80, 40, NULL},\r\n\t{ NULL,0,0,0,0,0,0 }\r\n};\r\n\r\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/ start UI \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\r\nextern const FONT_INFO Consolas_28;\r\nvoid load_resource()\r\n{\r\n\tc_theme::add_font(FONT_DEFAULT, &Consolas_28);\r\n\t\/\/for button\r\n\tc_theme::add_color(COLOR_WND_FONT, GL_RGB(0, 0, 0));\r\n\tc_theme::add_color(COLOR_WND_NORMAL, GL_RGB(255, 255, 255));\r\n\tc_theme::add_color(COLOR_WND_PUSHED, GL_RGB(128, 128, 128));\r\n\tc_theme::add_color(COLOR_WND_FOCUS, GL_RGB(0, 255, 0));\r\n\tc_theme::add_color(COLOR_WND_BORDER, GL_RGB(0, 255, 0));\r\n}\r\n\r\nstatic c_display* s_display;\r\nvoid create_ui(void* phy_fb, int screen_width, int screen_height, int color_bytes, struct EXTERNAL_GFX_OP* gfx_op)\r\n{\r\n\tload_resource();\r\n\ts_display = new c_display(phy_fb, screen_width, screen_height, UI_WIDTH, UI_HEIGHT, color_bytes, 1, gfx_op);\r\n\tc_surface* surface = s_display->alloc_surface(&s_myUI, Z_ORDER_LEVEL_0);\r\n\tsurface->set_active(true);\r\n\ts_myUI.set_surface(surface);\r\n\ts_myUI.connect(NULL, ID_ROOT, 0, 0, 0, UI_WIDTH, UI_HEIGHT, s_myUI_children);\r\n\ts_myUI.show_window();\r\n}\r\n\r\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/ interface for all platform \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\r\nextern \"C\" void startHelloNoTouch(void* phy_fb, int width, int height, int color_bytes, struct EXTERNAL_GFX_OP* gfx_op)\r\n{\r\n\tcreate_ui(phy_fb, width, height, color_bytes, gfx_op);\r\n}\r\n\r\nextern \"C\" void sendTouch2HelloNoTouch(int x, int y, bool is_down)\r\n{\r\n\tis_down ? s_myUI.on_touch(x, y, TOUCH_DOWN) : s_myUI.on_touch(x, y, TOUCH_UP);\r\n}\r\n\r\nextern \"C\" void sendKey2HelloNoTouch(unsigned int key)\r\n{\r\n\ts_myUI.on_key(KEY_TYPE(key));\r\n}\r\n\r\nint captureUiOfHelloNoTouch()\r\n{\r\n\treturn s_display->snap_shot(\"snap_short.bmp\");\r\n}\r\n<commit_msg>fix color configure for HelloNoTouch<commit_after>#include \"core_include\/api.h\"\r\n#include \"core_include\/rect.h\"\r\n#include \"core_include\/cmd_target.h\"\r\n#include \"core_include\/wnd.h\"\r\n#include \"core_include\/surface.h\"\r\n#include \"core_include\/resource.h\"\r\n#include \"core_include\/word.h\"\r\n#include \"core_include\/msg.h\"\r\n#include \"core_include\/display.h\"\r\n#include \"core_include\/theme.h\"\r\n#include \"widgets_include\/label.h\"\r\n#include \"widgets_include\/button.h\"\r\n#include <stdlib.h>\r\n#include <stdio.h>\r\n\r\nconst int UI_WIDTH = 240;\r\nconst int UI_HEIGHT = 320;\r\n\r\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/ define widgets & map message \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\r\nenum WND_ID\r\n{\r\n\tID_ROOT = 1,\r\n\tID_LABEL1,\r\n\tID_LABEL2,\r\n\tID_LABEL3,\r\n\tID_BUTTON1,\r\n\tID_BUTTON2,\r\n\tID_BUTTON3\r\n};\r\n\r\nclass c_myUI : public c_wnd\r\n{\r\n\tvirtual c_wnd* clone() { return new c_myUI(); }\r\n\tvirtual void on_paint(void)\r\n\t{\r\n\t\tc_rect rect;\r\n\t\tget_screen_rect(rect);\r\n\t\tm_surface->fill_rect(rect, GL_RGB(0, 0, 0), m_z_order);\r\n\t}\r\n\tvoid on_clicked(unsigned int ctrl_id) {\r\n\t\tstatic int sum1, sum2, sum3;\r\n\t\tstatic char str1[8], str2[8], str3[8];\r\n\t\tc_button* button = (c_button*)get_wnd_ptr(ctrl_id);\r\n\t\tswitch (ctrl_id)\r\n\t\t{\r\n\t\tcase ID_BUTTON1:\r\n\t\t\tsprintf(str1, \"%d\", ++sum1);\r\n\t\t\tbutton->set_str(str1);\r\n\t\t\tbreak;\r\n\t\tcase ID_BUTTON2:\r\n\t\t\tsprintf(str2, \"%d\", ++sum2);\r\n\t\t\tbutton->set_str(str2);\r\n\t\t\tbreak;\r\n\t\tcase ID_BUTTON3:\r\n\t\t\tsprintf(str3, \"%d\", ++sum3);\r\n\t\t\tbutton->set_str(str3);\r\n\t\t\tbreak;\r\n\t\t}\r\n\t\tbutton->show_window();\r\n\t}\r\n\tGL_DECLARE_MESSAGE_MAP()\/\/delcare message\r\n};\r\n\r\n\/\/map message\r\nGL_BEGIN_MESSAGE_MAP(c_myUI)\r\nON_GL_BN_CLICKED(ID_BUTTON1, c_myUI::on_clicked)\r\nON_GL_BN_CLICKED(ID_BUTTON2, c_myUI::on_clicked)\r\nON_GL_BN_CLICKED(ID_BUTTON3, c_myUI::on_clicked)\r\nGL_END_MESSAGE_MAP()\r\n\r\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/ layout UI \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\r\nstatic c_myUI s_myUI;\r\nstatic c_label s_label1, s_label2, s_label3;\r\nstatic c_button s_button1, s_button2, s_button3;\r\nstatic WND_TREE s_myUI_children[] =\r\n{\r\n\t{&s_label1, ID_LABEL1, \"a: <<\", 20, 20, 80, 40, NULL},\r\n\t{&s_label2, ID_LABEL2, \"d: >>\", 20, 140, 80, 40, NULL},\r\n\t{&s_label3, ID_LABEL3, \"s: click\", 20, 260, 80, 40, NULL},\r\n\r\n\t{&s_button1, ID_BUTTON1, \"0\", 140, 20, 80, 40, NULL},\r\n\t{&s_button2, ID_BUTTON2, \"0\", 140, 140, 80, 40, NULL},\r\n\t{&s_button3, ID_BUTTON3, \"0\", 140, 260, 80, 40, NULL},\r\n\t{ NULL,0,0,0,0,0,0 }\r\n};\r\n\r\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/ start UI \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\r\nextern const FONT_INFO Consolas_28;\r\nvoid load_resource()\r\n{\r\n\tc_theme::add_font(FONT_DEFAULT, &Consolas_28);\r\n\t\/\/for button\r\n\tc_theme::add_color(COLOR_WND_FONT, GL_RGB(255, 255, 243));\r\n\tc_theme::add_color(COLOR_WND_NORMAL, GL_RGB(59, 75, 94));\r\n\tc_theme::add_color(COLOR_WND_PUSHED, GL_RGB(33, 42, 53));\r\n\tc_theme::add_color(COLOR_WND_FOCUS, GL_RGB(78, 198, 76));\r\n\tc_theme::add_color(COLOR_WND_BORDER, GL_RGB(46, 59, 73));\r\n}\r\n\r\nstatic c_display* s_display;\r\nvoid create_ui(void* phy_fb, int screen_width, int screen_height, int color_bytes, struct EXTERNAL_GFX_OP* gfx_op)\r\n{\r\n\tload_resource();\r\n\ts_display = new c_display(phy_fb, screen_width, screen_height, UI_WIDTH, UI_HEIGHT, color_bytes, 1, gfx_op);\r\n\tc_surface* surface = s_display->alloc_surface(&s_myUI, Z_ORDER_LEVEL_0);\r\n\tsurface->set_active(true);\r\n\ts_myUI.set_surface(surface);\r\n\ts_myUI.connect(NULL, ID_ROOT, 0, 0, 0, UI_WIDTH, UI_HEIGHT, s_myUI_children);\r\n\ts_myUI.show_window();\r\n}\r\n\r\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/ interface for all platform \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\r\nextern \"C\" void startHelloNoTouch(void* phy_fb, int width, int height, int color_bytes, struct EXTERNAL_GFX_OP* gfx_op)\r\n{\r\n\tcreate_ui(phy_fb, width, height, color_bytes, gfx_op);\r\n}\r\n\r\nextern \"C\" void sendTouch2HelloNoTouch(int x, int y, bool is_down)\r\n{\r\n\tis_down ? s_myUI.on_touch(x, y, TOUCH_DOWN) : s_myUI.on_touch(x, y, TOUCH_UP);\r\n}\r\n\r\nextern \"C\" void sendKey2HelloNoTouch(unsigned int key)\r\n{\r\n\ts_myUI.on_key(KEY_TYPE(key));\r\n}\r\n\r\nint captureUiOfHelloNoTouch()\r\n{\r\n\treturn s_display->snap_shot(\"snap_short.bmp\");\r\n}\r\n<|endoftext|>"} {"text":"<commit_before>#include \"indexer.h\"\n\n#include <gflags\/gflags.h>\n\n#include <stdarg.h>\n\nDEFINE_bool(debug_index, false, \"Debug the index query generator.\");\n\nstatic void debug(const char *format, ...) {\n if (!FLAGS_debug_index)\n return;\n va_list ap;\n\n va_start(ap, format);\n vprintf(format, ap);\n va_end(ap);\n}\n\nusing namespace re2;\nusing namespace std;\n\nconst unsigned kMinWeight = 16;\nconst int kMaxFilters = 32;\n\ndouble IndexKey::selectivity() {\n if (keys.size() == 0)\n return 1.0;\n\n double s = 0.0;\n for (vector<string>::const_iterator it = keys.begin();\n it != keys.end(); ++it)\n s += pow(1.\/64, min(it->size(), size_t(4)));\n\n return s;\n}\n\nunsigned IndexKey::weight() {\n return 1\/selectivity();\n}\n\nstring IndexKey::ToString() {\n string out;\n for (vector<string>::const_iterator it = keys.begin();\n it != keys.end(); ++it) {\n out += *it;\n out += \",\";\n }\n out += \"|\";\n if (anchor & kAnchorLeft)\n out += \"<\";\n if (anchor & kAnchorRight)\n out += \">\";\n return out;\n}\n\nclass IndexWalker : public Regexp::Walker<IndexKey*> {\npublic:\n IndexWalker() { }\n virtual IndexKey *\n PostVisit(Regexp* re, IndexKey *parent_arg,\n IndexKey *pre_arg,\n IndexKey **child_args, int nchild_args);\n\n virtual IndexKey *\n ShortVisit(Regexp* re,\n IndexKey *parent_arg);\n\nprivate:\n IndexWalker(const IndexWalker&);\n void operator=(const IndexWalker&);\n};\n\nnamespace {\n string RuneToString(Rune r) {\n char buf[UTFmax];\n int n = runetochar(buf, &r);\n return string(buf, n);\n }\n\n IndexKey *Any() {\n return new IndexKey(kAnchorNone);\n }\n\n IndexKey *Empty() {\n return new IndexKey(kAnchorBoth);\n }\n\n\n IndexKey *Literal(Rune r) {\n IndexKey *k = new IndexKey;\n k->keys.push_back(RuneToString(r));\n k->anchor = kAnchorBoth;\n return k;\n }\n\n IndexKey *Literal(Rune *runes, int nrunes) {\n IndexKey *k = new IndexKey;\n string lit;\n\n for (int i = 0; i < nrunes; i++) {\n lit.append(RuneToString(runes[i]));\n }\n\n k->keys.push_back(lit);\n k->anchor = kAnchorBoth;\n\n return k;\n }\n\n IndexKey *CClass(CharClass *cc) {\n if (cc->size() > kMaxFilters)\n return Any();\n\n IndexKey *k = new IndexKey();\n\n for (CharClass::iterator i = cc->begin(); i != cc->end(); ++i)\n for (Rune r = i->lo; r <= i->hi; r++)\n k->keys.push_back(RuneToString(r));\n\n k->anchor = kAnchorBoth;\n\n return k;\n }\n\n IndexKey *Concat(IndexKey *lhs, IndexKey *rhs) {\n IndexKey *out = 0;\n\n debug(\"Concat([%s](%d), [%s](%d)) = \",\n lhs->ToString().c_str(),\n lhs->weight(),\n rhs->ToString().c_str(),\n rhs->weight());\n\n if ((lhs->anchor & kAnchorRight) &&\n (rhs->anchor & kAnchorLeft) &&\n lhs->keys.size() && rhs->keys.size() &&\n lhs->keys.size() * rhs->keys.size() <= kMaxFilters) {\n out = new IndexKey;\n for (vector<string>::iterator lit = lhs->keys.begin();\n lit != lhs->keys.end(); ++lit)\n for (vector<string>::iterator rit = rhs->keys.begin();\n rit != rhs->keys.end(); ++rit)\n out->keys.push_back(*lit + *rit);\n out->anchor = (lhs->anchor & kAnchorLeft) | (rhs->anchor & kAnchorRight);\n }\n\n if (!out || lhs->weight() > out->weight()) {\n delete out;\n out = lhs;\n out->anchor &= ~kAnchorRight;\n } else {\n delete lhs;\n }\n\n if (rhs->weight() > out->weight()) {\n delete out;\n out = rhs;\n out->anchor &= ~kAnchorLeft;\n } else {\n delete rhs;\n }\n\n debug(\"[%s]\\n\", out->ToString().c_str());\n\n return out;\n }\n\n IndexKey *Alternate(IndexKey *lhs, IndexKey *rhs) {\n if (lhs->keys.size() + rhs->keys.size() < kMaxFilters) {\n lhs->keys.insert(lhs->keys.end(), rhs->keys.begin(), rhs->keys.end());\n lhs->anchor &= rhs->anchor;\n\n delete rhs;\n return lhs;\n }\n delete lhs;\n delete rhs;\n\n return Any();\n }\n\n};\n\nunique_ptr<IndexKey> indexRE(const re2::RE2 &re) {\n IndexWalker walk;\n\n unique_ptr<IndexKey> key(walk.Walk(re.Regexp(), 0));\n\n if (key->weight() < kMinWeight)\n key->keys.clear();\n return key;\n}\n\nIndexKey *IndexWalker::PostVisit(Regexp* re, IndexKey *parent_arg,\n IndexKey *pre_arg,\n IndexKey **child_args, int nchild_args) {\n IndexKey *key;\n\n switch (re->op()) {\n case kRegexpNoMatch:\n case kRegexpEmptyMatch: \/\/ anywhere\n case kRegexpBeginLine: \/\/ at beginning of line\n case kRegexpEndLine: \/\/ at end of line\n case kRegexpBeginText: \/\/ at beginning of text\n case kRegexpEndText: \/\/ at end of text\n case kRegexpWordBoundary: \/\/ at word boundary\n case kRegexpNoWordBoundary: \/\/ not at word boundary\n key = Empty();\n break;\n\n case kRegexpAnyChar:\n case kRegexpAnyByte:\n key = Any();\n break;\n\n case kRegexpLiteral:\n key = Literal(re->rune());\n break;\n\n case kRegexpCharClass:\n key = CClass(re->cc());\n break;\n\n case kRegexpLiteralString:\n key = Literal(re->runes(), re->nrunes());\n break;\n\n case kRegexpConcat:\n key = Empty();\n for (int i = 0; i < nchild_args; i++)\n key = Concat(key, child_args[i]);\n break;\n\n case kRegexpAlternate:\n key = child_args[0];\n for (int i = 1; i < nchild_args; i++)\n key = Alternate(key, child_args[i]);\n break;\n\n case kRegexpStar:\n case kRegexpQuest:\n delete child_args[0];\n key = Any();\n break;\n\n case kRegexpCapture:\n key = child_args[0];\n break;\n\n case kRegexpRepeat:\n case kRegexpPlus:\n key = child_args[0];\n if (key->anchor == kAnchorBoth)\n key->anchor &= ~kAnchorRight;\n break;\n\n default:\n assert(false);\n }\n\n debug(\" %s -> [%s](%d)\\n\",\n re->ToString().c_str(),\n key->ToString().c_str(),\n key->weight());\n\n return key;\n}\n\nIndexKey *IndexWalker::ShortVisit(Regexp* re, IndexKey *parent_arg) {\n return Any();\n}\n<commit_msg>Tweak the selectivity heuristic for the indexer.<commit_after>#include \"indexer.h\"\n\n#include <gflags\/gflags.h>\n\n#include <stdarg.h>\n\nDEFINE_bool(debug_index, false, \"Debug the index query generator.\");\n\nstatic void debug(const char *format, ...) {\n if (!FLAGS_debug_index)\n return;\n va_list ap;\n\n va_start(ap, format);\n vprintf(format, ap);\n va_end(ap);\n}\n\nusing namespace re2;\nusing namespace std;\n\nconst unsigned kMinWeight = 16;\nconst int kMaxFilters = 32;\n\ndouble IndexKey::selectivity() {\n if (keys.size() == 0)\n return 1.0;\n\n double s = 0.0;\n for (vector<string>::const_iterator it = keys.begin();\n it != keys.end(); ++it)\n s += pow(1.\/(it->size() + 1), 8);\n\n return s;\n}\n\nunsigned IndexKey::weight() {\n return 1\/selectivity();\n}\n\nstring IndexKey::ToString() {\n string out;\n for (vector<string>::const_iterator it = keys.begin();\n it != keys.end(); ++it) {\n out += *it;\n out += \",\";\n }\n out += \"|\";\n if (anchor & kAnchorLeft)\n out += \"<\";\n if (anchor & kAnchorRight)\n out += \">\";\n return out;\n}\n\nclass IndexWalker : public Regexp::Walker<IndexKey*> {\npublic:\n IndexWalker() { }\n virtual IndexKey *\n PostVisit(Regexp* re, IndexKey *parent_arg,\n IndexKey *pre_arg,\n IndexKey **child_args, int nchild_args);\n\n virtual IndexKey *\n ShortVisit(Regexp* re,\n IndexKey *parent_arg);\n\nprivate:\n IndexWalker(const IndexWalker&);\n void operator=(const IndexWalker&);\n};\n\nnamespace {\n string RuneToString(Rune r) {\n char buf[UTFmax];\n int n = runetochar(buf, &r);\n return string(buf, n);\n }\n\n IndexKey *Any() {\n return new IndexKey(kAnchorNone);\n }\n\n IndexKey *Empty() {\n return new IndexKey(kAnchorBoth);\n }\n\n\n IndexKey *Literal(Rune r) {\n IndexKey *k = new IndexKey;\n k->keys.push_back(RuneToString(r));\n k->anchor = kAnchorBoth;\n return k;\n }\n\n IndexKey *Literal(Rune *runes, int nrunes) {\n IndexKey *k = new IndexKey;\n string lit;\n\n for (int i = 0; i < nrunes; i++) {\n lit.append(RuneToString(runes[i]));\n }\n\n k->keys.push_back(lit);\n k->anchor = kAnchorBoth;\n\n return k;\n }\n\n IndexKey *CClass(CharClass *cc) {\n if (cc->size() > kMaxFilters)\n return Any();\n\n IndexKey *k = new IndexKey();\n\n for (CharClass::iterator i = cc->begin(); i != cc->end(); ++i)\n for (Rune r = i->lo; r <= i->hi; r++)\n k->keys.push_back(RuneToString(r));\n\n k->anchor = kAnchorBoth;\n\n return k;\n }\n\n IndexKey *Concat(IndexKey *lhs, IndexKey *rhs) {\n IndexKey *out = 0;\n\n debug(\"Concat([%s](%d), [%s](%d)) = \",\n lhs->ToString().c_str(),\n lhs->weight(),\n rhs->ToString().c_str(),\n rhs->weight());\n\n if ((lhs->anchor & kAnchorRight) &&\n (rhs->anchor & kAnchorLeft) &&\n lhs->keys.size() && rhs->keys.size() &&\n lhs->keys.size() * rhs->keys.size() <= kMaxFilters) {\n out = new IndexKey;\n for (vector<string>::iterator lit = lhs->keys.begin();\n lit != lhs->keys.end(); ++lit)\n for (vector<string>::iterator rit = rhs->keys.begin();\n rit != rhs->keys.end(); ++rit)\n out->keys.push_back(*lit + *rit);\n out->anchor = (lhs->anchor & kAnchorLeft) | (rhs->anchor & kAnchorRight);\n }\n\n if (!out || lhs->weight() > out->weight()) {\n delete out;\n out = lhs;\n out->anchor &= ~kAnchorRight;\n } else {\n delete lhs;\n }\n\n if (rhs->weight() > out->weight()) {\n delete out;\n out = rhs;\n out->anchor &= ~kAnchorLeft;\n } else {\n delete rhs;\n }\n\n debug(\"[%s]\\n\", out->ToString().c_str());\n\n return out;\n }\n\n IndexKey *Alternate(IndexKey *lhs, IndexKey *rhs) {\n if (lhs->keys.size() + rhs->keys.size() < kMaxFilters) {\n lhs->keys.insert(lhs->keys.end(), rhs->keys.begin(), rhs->keys.end());\n lhs->anchor &= rhs->anchor;\n\n delete rhs;\n return lhs;\n }\n delete lhs;\n delete rhs;\n\n return Any();\n }\n\n};\n\nunique_ptr<IndexKey> indexRE(const re2::RE2 &re) {\n IndexWalker walk;\n\n unique_ptr<IndexKey> key(walk.Walk(re.Regexp(), 0));\n\n if (key->weight() < kMinWeight)\n key->keys.clear();\n return key;\n}\n\nIndexKey *IndexWalker::PostVisit(Regexp* re, IndexKey *parent_arg,\n IndexKey *pre_arg,\n IndexKey **child_args, int nchild_args) {\n IndexKey *key;\n\n switch (re->op()) {\n case kRegexpNoMatch:\n case kRegexpEmptyMatch: \/\/ anywhere\n case kRegexpBeginLine: \/\/ at beginning of line\n case kRegexpEndLine: \/\/ at end of line\n case kRegexpBeginText: \/\/ at beginning of text\n case kRegexpEndText: \/\/ at end of text\n case kRegexpWordBoundary: \/\/ at word boundary\n case kRegexpNoWordBoundary: \/\/ not at word boundary\n key = Empty();\n break;\n\n case kRegexpAnyChar:\n case kRegexpAnyByte:\n key = Any();\n break;\n\n case kRegexpLiteral:\n key = Literal(re->rune());\n break;\n\n case kRegexpCharClass:\n key = CClass(re->cc());\n break;\n\n case kRegexpLiteralString:\n key = Literal(re->runes(), re->nrunes());\n break;\n\n case kRegexpConcat:\n key = Empty();\n for (int i = 0; i < nchild_args; i++)\n key = Concat(key, child_args[i]);\n break;\n\n case kRegexpAlternate:\n key = child_args[0];\n for (int i = 1; i < nchild_args; i++)\n key = Alternate(key, child_args[i]);\n break;\n\n case kRegexpStar:\n case kRegexpQuest:\n delete child_args[0];\n key = Any();\n break;\n\n case kRegexpCapture:\n key = child_args[0];\n break;\n\n case kRegexpRepeat:\n case kRegexpPlus:\n key = child_args[0];\n if (key->anchor == kAnchorBoth)\n key->anchor &= ~kAnchorRight;\n break;\n\n default:\n assert(false);\n }\n\n debug(\" %s -> [%s](%d)\\n\",\n re->ToString().c_str(),\n key->ToString().c_str(),\n key->weight());\n\n return key;\n}\n\nIndexKey *IndexWalker::ShortVisit(Regexp* re, IndexKey *parent_arg) {\n return Any();\n}\n<|endoftext|>"} {"text":"<commit_before>\/****************************************************************************\n**\n** Copyright (C) 2014 Jolla Ltd.\n** Contact: Raine Makelainen <raine.makelainen@jolla.com>\n**\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 file,\n * You can obtain one at http:\/\/mozilla.org\/MPL\/2.0\/. *\/\n\n#include \"webpages.h\"\n#include \"declarativewebcontainer.h\"\n#include \"declarativewebpage.h\"\n#include \"qmozcontext.h\"\n\n#include <QDateTime>\n#include <QDBusConnection>\n#include <QQmlComponent>\n#include <QQmlEngine>\n#include <QQmlContext>\n#include <QMapIterator>\n#include <QRectF>\n#include <qqmlinfo.h>\n\n#ifndef DEBUG_LOGS\n#define DEBUG_LOGS 0\n#endif\n\n#if DEBUG_LOGS\n#include <QDebug>\n#endif\n\nstatic const qint64 gMemoryPressureTimeout = 600 * 1000; \/\/ 600 sec\n\/\/ In normal cases gLowMemoryEnabled is true. Can be disabled e.g. for test runs.\nstatic const bool gLowMemoryEnabled = qgetenv(\"LOW_MEMORY_DISABLED\").isEmpty();\n\nWebPages::WebPages(QObject *parent)\n : QObject(parent)\n , m_backgroundTimestamp(0)\n{\n if (gLowMemoryEnabled) {\n QDBusConnection::systemBus().connect(\"com.nokia.mce\", \"\/com\/nokia\/mce\/signal\",\n \"com.nokia.mce.signal\", \"sig_memory_level_ind\",\n this, SLOT(handleMemNotify(QString)));\n }\n}\n\nWebPages::~WebPages()\n{\n}\n\nvoid WebPages::initialize(DeclarativeWebContainer *webContainer, QQmlComponent *webPageComponent)\n{\n if (!m_webContainer || !m_webPageComponent) {\n m_webContainer = webContainer;\n m_webPageComponent = webPageComponent;\n }\n\n connect(webContainer, SIGNAL(foregroundChanged()), this, SLOT(updateBackgroundTimestamp()));\n}\n\nvoid WebPages::updateBackgroundTimestamp()\n{\n if (!m_webContainer->foreground()) {\n m_backgroundTimestamp = QDateTime::currentMSecsSinceEpoch();\n }\n}\n\nbool WebPages::initialized() const\n{\n return m_webContainer && m_webPageComponent;\n}\n\nint WebPages::count() const\n{\n return m_activePages.count();\n}\n\nbool WebPages::setMaxLivePages(int count)\n{\n return m_activePages.setMaxLivePages(count);\n}\n\nint WebPages::maxLivePages() const\n{\n return m_activePages.maxLivePages();\n}\n\nbool WebPages::alive(int tabId) const\n{\n return m_activePages.alive(tabId);\n}\n\nWebPageActivationData WebPages::page(int tabId, int parentId)\n{\n if (!m_webPageComponent) {\n qWarning() << \"TabModel not initialized!\";\n return WebPageActivationData(0, false);\n }\n\n if (m_activePages.active(tabId)) {\n DeclarativeWebPage *activePage = m_activePages.activeWebPage();\n activePage->resumeView();\n return WebPageActivationData(activePage, false);\n }\n\n#if DEBUG_LOGS\n qDebug() << \"about to create a new tab or activate old:\" << tabId;\n#endif\n\n DeclarativeWebPage *webPage = 0;\n DeclarativeWebPage *oldActiveWebPage = m_activePages.activeWebPage();\n if (!m_activePages.alive(tabId)) {\n QQmlContext *creationContext = m_webPageComponent->creationContext();\n QQmlContext *context = new QQmlContext(creationContext ? creationContext : QQmlEngine::contextForObject(m_webContainer));\n QObject *object = m_webPageComponent->beginCreate(context);\n if (object) {\n context->setParent(object);\n object->setParent(m_webContainer);\n webPage = qobject_cast<DeclarativeWebPage *>(object);\n if (webPage) {\n\/\/ webPage->setParentItem(m_webContainer);\n webPage->setParentID(parentId);\n webPage->setPrivateMode(m_webContainer->privateMode());\n webPage->setTabId(tabId);\n webPage->setContainer(m_webContainer);\n m_webPageComponent->completeCreate();\n#if DEBUG_LOGS\n qDebug() << \"New view id:\" << webPage->uniqueID() << \"parentId:\" << webPage->parentId() << \"tab id:\" << webPage->tabId();\n#endif\n m_activePages.prepend(tabId, webPage);\n QQmlEngine::setObjectOwnership(webPage, QQmlEngine::CppOwnership);\n } else {\n qmlInfo(m_webContainer) << \"webPage component must be a WebPage component\";\n }\n } else {\n qmlInfo(m_webContainer) << \"Creation of the web page failed. Error: \" << m_webPageComponent->errorString();\n delete object;\n object = 0;\n }\n }\n\n DeclarativeWebPage *newActiveWebPage = m_activePages.activate(tabId);\n updateStates(oldActiveWebPage, newActiveWebPage);\n\n#if DEBUG_LOGS\n dumpPages();\n#endif\n\n return WebPageActivationData(newActiveWebPage, true);\n}\n\nvoid WebPages::release(int tabId, bool virtualize)\n{\n m_activePages.release(tabId, virtualize);\n}\n\nvoid WebPages::clear()\n{\n m_activePages.clear();\n}\n\nint WebPages::parentTabId(int tabId) const\n{\n return m_activePages.parentTabId(tabId);\n}\n\nvoid WebPages::updateStates(DeclarativeWebPage *oldActivePage, DeclarativeWebPage *newActivePage)\n{\n if (oldActivePage) {\n \/\/ Allow suspending only the current active page if it is not the creator (parent).\n if (newActivePage->parentId() != (int)oldActivePage->uniqueID()) {\n if (oldActivePage->loading()) {\n oldActivePage->stop();\n }\n oldActivePage->suspendView();\n }\n }\n\n if (newActivePage) {\n newActivePage->resumeView();\n }\n}\n\nvoid WebPages::dumpPages() const\n{\n m_activePages.dumpPages();\n}\n\nvoid WebPages::handleMemNotify(const QString &memoryLevel)\n{\n if (!m_webContainer || !m_webContainer->completed()) {\n return;\n }\n\n if (memoryLevel == QString(\"warning\") || memoryLevel == QString(\"critical\")) {\n m_activePages.virtualizeInactive();\n\n if (!m_webContainer->foreground() &&\n (QDateTime::currentMSecsSinceEpoch() - m_backgroundTimestamp) > gMemoryPressureTimeout) {\n m_backgroundTimestamp = QDateTime::currentMSecsSinceEpoch();\n QMozContext::GetInstance()->sendObserve(QString(\"memory-pressure\"), QString(\"heap-minimize\"));\n }\n }\n}\n<commit_msg>[sailfish-browser] Call initialize to complete instantiation. Contributes JB#27557<commit_after>\/****************************************************************************\n**\n** Copyright (C) 2014 Jolla Ltd.\n** Contact: Raine Makelainen <raine.makelainen@jolla.com>\n**\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 file,\n * You can obtain one at http:\/\/mozilla.org\/MPL\/2.0\/. *\/\n\n#include \"webpages.h\"\n#include \"declarativewebcontainer.h\"\n#include \"declarativewebpage.h\"\n#include \"qmozcontext.h\"\n\n#include <QDateTime>\n#include <QDBusConnection>\n#include <QQmlComponent>\n#include <QQmlEngine>\n#include <QQmlContext>\n#include <QMapIterator>\n#include <QRectF>\n#include <qqmlinfo.h>\n\n#ifndef DEBUG_LOGS\n#define DEBUG_LOGS 0\n#endif\n\n#if DEBUG_LOGS\n#include <QDebug>\n#endif\n\nstatic const qint64 gMemoryPressureTimeout = 600 * 1000; \/\/ 600 sec\n\/\/ In normal cases gLowMemoryEnabled is true. Can be disabled e.g. for test runs.\nstatic const bool gLowMemoryEnabled = qgetenv(\"LOW_MEMORY_DISABLED\").isEmpty();\n\nWebPages::WebPages(QObject *parent)\n : QObject(parent)\n , m_backgroundTimestamp(0)\n{\n if (gLowMemoryEnabled) {\n QDBusConnection::systemBus().connect(\"com.nokia.mce\", \"\/com\/nokia\/mce\/signal\",\n \"com.nokia.mce.signal\", \"sig_memory_level_ind\",\n this, SLOT(handleMemNotify(QString)));\n }\n}\n\nWebPages::~WebPages()\n{\n}\n\nvoid WebPages::initialize(DeclarativeWebContainer *webContainer, QQmlComponent *webPageComponent)\n{\n if (!m_webContainer || !m_webPageComponent) {\n m_webContainer = webContainer;\n m_webPageComponent = webPageComponent;\n }\n\n connect(webContainer, SIGNAL(foregroundChanged()), this, SLOT(updateBackgroundTimestamp()));\n}\n\nvoid WebPages::updateBackgroundTimestamp()\n{\n if (!m_webContainer->foreground()) {\n m_backgroundTimestamp = QDateTime::currentMSecsSinceEpoch();\n }\n}\n\nbool WebPages::initialized() const\n{\n return m_webContainer && m_webPageComponent;\n}\n\nint WebPages::count() const\n{\n return m_activePages.count();\n}\n\nbool WebPages::setMaxLivePages(int count)\n{\n return m_activePages.setMaxLivePages(count);\n}\n\nint WebPages::maxLivePages() const\n{\n return m_activePages.maxLivePages();\n}\n\nbool WebPages::alive(int tabId) const\n{\n return m_activePages.alive(tabId);\n}\n\nWebPageActivationData WebPages::page(int tabId, int parentId)\n{\n if (!m_webPageComponent) {\n qWarning() << \"TabModel not initialized!\";\n return WebPageActivationData(0, false);\n }\n\n if (m_activePages.active(tabId)) {\n DeclarativeWebPage *activePage = m_activePages.activeWebPage();\n activePage->resumeView();\n return WebPageActivationData(activePage, false);\n }\n\n#if DEBUG_LOGS\n qDebug() << \"about to create a new tab or activate old:\" << tabId;\n#endif\n\n DeclarativeWebPage *webPage = 0;\n DeclarativeWebPage *oldActiveWebPage = m_activePages.activeWebPage();\n if (!m_activePages.alive(tabId)) {\n QQmlContext *creationContext = m_webPageComponent->creationContext();\n QQmlContext *context = new QQmlContext(creationContext ? creationContext : QQmlEngine::contextForObject(m_webContainer));\n QObject *object = m_webPageComponent->beginCreate(context);\n if (object) {\n context->setParent(object);\n object->setParent(m_webContainer);\n webPage = qobject_cast<DeclarativeWebPage *>(object);\n if (webPage) {\n webPage->setParentID(parentId);\n webPage->setPrivateMode(m_webContainer->privateMode());\n webPage->setTabId(tabId);\n webPage->setContainer(m_webContainer);\n webPage->initialize();\n m_webPageComponent->completeCreate();\n#if DEBUG_LOGS\n qDebug() << \"New view id:\" << webPage->uniqueID() << \"parentId:\" << webPage->parentId() << \"tab id:\" << webPage->tabId();\n#endif\n m_activePages.prepend(tabId, webPage);\n QQmlEngine::setObjectOwnership(webPage, QQmlEngine::CppOwnership);\n } else {\n qmlInfo(m_webContainer) << \"webPage component must be a WebPage component\";\n }\n } else {\n qmlInfo(m_webContainer) << \"Creation of the web page failed. Error: \" << m_webPageComponent->errorString();\n delete object;\n object = 0;\n }\n }\n\n DeclarativeWebPage *newActiveWebPage = m_activePages.activate(tabId);\n updateStates(oldActiveWebPage, newActiveWebPage);\n\n#if DEBUG_LOGS\n dumpPages();\n#endif\n\n return WebPageActivationData(newActiveWebPage, true);\n}\n\nvoid WebPages::release(int tabId, bool virtualize)\n{\n m_activePages.release(tabId, virtualize);\n}\n\nvoid WebPages::clear()\n{\n m_activePages.clear();\n}\n\nint WebPages::parentTabId(int tabId) const\n{\n return m_activePages.parentTabId(tabId);\n}\n\nvoid WebPages::updateStates(DeclarativeWebPage *oldActivePage, DeclarativeWebPage *newActivePage)\n{\n if (oldActivePage) {\n \/\/ Allow suspending only the current active page if it is not the creator (parent).\n if (newActivePage->parentId() != (int)oldActivePage->uniqueID()) {\n if (oldActivePage->loading()) {\n oldActivePage->stop();\n }\n oldActivePage->suspendView();\n }\n }\n\n if (newActivePage) {\n newActivePage->resumeView();\n }\n}\n\nvoid WebPages::dumpPages() const\n{\n m_activePages.dumpPages();\n}\n\nvoid WebPages::handleMemNotify(const QString &memoryLevel)\n{\n if (!m_webContainer || !m_webContainer->completed()) {\n return;\n }\n\n if (memoryLevel == QString(\"warning\") || memoryLevel == QString(\"critical\")) {\n m_activePages.virtualizeInactive();\n\n if (!m_webContainer->foreground() &&\n (QDateTime::currentMSecsSinceEpoch() - m_backgroundTimestamp) > gMemoryPressureTimeout) {\n m_backgroundTimestamp = QDateTime::currentMSecsSinceEpoch();\n QMozContext::GetInstance()->sendObserve(QString(\"memory-pressure\"), QString(\"heap-minimize\"));\n }\n }\n}\n<|endoftext|>"} {"text":"<commit_before>#pragma once\n\n#include <new>\n#include <utility>\n#include \"_types.hh\"\n\nnamespace zbs {\n\ntemplate <typename T> class func;\n\ntemplate <typename R, typename ...Args>\nclass func<R (Args...)> {\n\tstatic R _invoke_func(void *data, Args &&...args) {\n\t\tauto fp = reinterpret_cast<R (*)(Args...)>(data);\n\t\treturn (*fp)(std::forward<Args>(args)...);\n\t}\n\n\ttemplate <typename T>\n\tstatic R _invoke_obj(void *data, Args &&...args) {\n\t\tauto obj = reinterpret_cast<T*>(data);\n\t\treturn (*obj)(std::forward<Args>(args)...);\n\t}\n\n\ttemplate <typename T>\n\tstatic R _invoke_const_obj(void *data, Args &&...args) {\n\t\tauto obj = reinterpret_cast<const T*>(data);\n\t\treturn (*obj)(std::forward<Args>(args)...);\n\t}\n\n\tR (*_invoker)(void*, Args&&...);\n\tvoid *_data;\n\npublic:\n\ttemplate <typename T>\n\tfunc(T &obj): _invoker(_invoke_obj<T>),\n\t\t_data(reinterpret_cast<void*>(&obj)) {}\n\ttemplate <typename T>\n\tfunc(const T &obj): _invoker(_invoke_const_obj<T>),\n\t\t_data(reinterpret_cast<void*>(const_cast<T*>(&obj))) {}\n\tfunc(R (*fp)(Args...)): _invoker(_invoke_func),\n\t\t_data(reinterpret_cast<void*>(fp)) {}\n\tfunc(const func&) = default;\n\tfunc(func&&) = default;\n\tfunc &operator=(const func&) = default;\n\tfunc &operator=(func&&) = default;\n\tR operator()(Args ...args) const {\n\t\treturn (*_invoker)(_data, std::forward<Args>(args)...);\n\t}\n};\n\n} \/\/ namespace zbs\n<commit_msg>Remove two unused headers from _func.hh.<commit_after>#pragma once\n\n#include <utility>\n\nnamespace zbs {\n\ntemplate <typename T> class func;\n\ntemplate <typename R, typename ...Args>\nclass func<R (Args...)> {\n\tstatic R _invoke_func(void *data, Args &&...args) {\n\t\tauto fp = reinterpret_cast<R (*)(Args...)>(data);\n\t\treturn (*fp)(std::forward<Args>(args)...);\n\t}\n\n\ttemplate <typename T>\n\tstatic R _invoke_obj(void *data, Args &&...args) {\n\t\tauto obj = reinterpret_cast<T*>(data);\n\t\treturn (*obj)(std::forward<Args>(args)...);\n\t}\n\n\ttemplate <typename T>\n\tstatic R _invoke_const_obj(void *data, Args &&...args) {\n\t\tauto obj = reinterpret_cast<const T*>(data);\n\t\treturn (*obj)(std::forward<Args>(args)...);\n\t}\n\n\tR (*_invoker)(void*, Args&&...);\n\tvoid *_data;\n\npublic:\n\ttemplate <typename T>\n\tfunc(T &obj): _invoker(_invoke_obj<T>),\n\t\t_data(reinterpret_cast<void*>(&obj)) {}\n\ttemplate <typename T>\n\tfunc(const T &obj): _invoker(_invoke_const_obj<T>),\n\t\t_data(reinterpret_cast<void*>(const_cast<T*>(&obj))) {}\n\tfunc(R (*fp)(Args...)): _invoker(_invoke_func),\n\t\t_data(reinterpret_cast<void*>(fp)) {}\n\tfunc(const func&) = default;\n\tfunc(func&&) = default;\n\tfunc &operator=(const func&) = default;\n\tfunc &operator=(func&&) = default;\n\tR operator()(Args ...args) const {\n\t\treturn (*_invoker)(_data, std::forward<Args>(args)...);\n\t}\n};\n\n} \/\/ namespace zbs\n<|endoftext|>"} {"text":"<commit_before>\/****************************************************************\n * *\n * zpar.lib.cpp - a library that can be used by python *\n * *\n * Author: Nitin Madnani *\n * Educational Testing Service, Princeton, NJ *\n * *\n ****************************************************************\/\n\n#define SIMPLE_HASH\n\n#include \"definitions.h\"\n#include \"options.h\"\n#include \"tagger.h\"\n#include \"conparser.h\"\n#include \"depparser.h\"\n#include \"reader.h\"\n#include \"writer.h\"\n#include \"stdlib.h\"\n#include <iterator>\n#include <sstream>\n\nusing namespace english;\n\n#define MAX_SENTENCE_SIZE 512\n\n\n\/\/ define a container structure with a container and a destructor\nstruct zparModel_t\n{\n void *tagger;\n void *conparser;\n void *depparser;\n char *output_buffer;\n\n zparModel_t() {\n tagger = NULL;\n conparser = NULL;\n depparser = NULL;\n output_buffer = NULL;\n };\n\n ~zparModel_t() {\n if (tagger)\n delete (CTagger *)tagger;\n if (conparser)\n delete (CConParser *)conparser;\n if (depparser)\n delete (CDepParser *)depparser;\n if (output_buffer) {\n free(output_buffer);\n }\n };\n};\n\n\/\/ instantiate the container\nzparModel_t *zpm = new zparModel_t();\n\n\/\/ a utility function to output tagged data in the usual\n\/\/ \"WORD\/TAG\" format as expected\nconst char *format_tagged_vector(CTwoStringVector *tagged_sent)\n{\n\n CTwoStringVector::const_iterator it;\n CStringVector formatted_tagged_sent[1];\n for (it = tagged_sent->begin(); it != tagged_sent->end(); ++it)\n {\n std::stringstream tmpss;\n tmpss << it->first << \"\/\" << it->second;\n std::string tmpstr(tmpss.str());\n formatted_tagged_sent->push_back(tmpstr);\n }\n\n int i;\n std::stringstream oss;\n for (i = 0; i < formatted_tagged_sent->size(); ++i)\n {\n oss << formatted_tagged_sent->at(i);\n if (i != formatted_tagged_sent->size() - 1)\n {\n oss << \" \";\n }\n }\n\n std::string outstr(oss.str());\n return outstr.c_str();\n\n}\n\n\/\/ A utility function to format the dependncy output\n\/\/ in CoNLL format\nconst char *format_dependency_tree(CDependencyParse *parsed_sent)\n{\n\n int i;\n std::stringstream oss;\n std::copy(parsed_sent->begin(), parsed_sent->end(), std::ostream_iterator<CLabeledDependencyTreeNode>(oss, \"\\n\"));\n\n std::string outstr(oss.str());\n return outstr.c_str();\n\n}\n\n\/\/ The function to load the tagger model\nextern \"C\" int load_tagger(const char *sFeaturePath) {\n\n CTagger *tagger;\n std::string sTaggerFeatureFile = std::string(sFeaturePath) + \"\/tagger\";\n std::cerr << \"Loading tagger from \" << sTaggerFeatureFile << std::endl;\n if (!FileExists(sTaggerFeatureFile)) {\n return 1;\n }\n tagger = new CTagger(sTaggerFeatureFile, false);\n zpm->tagger = (void *)tagger;\n return 0;\n\n}\n\n\/\/ The function to load the constituency parser model\nextern \"C\" int load_parser(const char *sFeaturePath) {\n\n \/\/ If the tagger is not already loaded, then we need to load\n \/\/ it since the parser requires the tagger\n if (!zpm->tagger) {\n if (load_tagger(sFeaturePath)) {\n return 1;\n }\n }\n\n CConParser *conparser;\n std::string sConParserFeatureFile = std::string(sFeaturePath) + \"\/conparser\";\n std::cerr << \"Loading constituency parser from \" << sConParserFeatureFile << std::endl;\n if (!FileExists(sConParserFeatureFile)) {\n return 1;\n }\n conparser = new CConParser(sConParserFeatureFile, false);\n zpm->conparser = (void *)conparser;\n return 0;\n}\n\n\/\/ The function to load the dependency parser model\nextern \"C\" int load_depparser(const char *sFeaturePath) {\n\n CDepParser *depparser;\n std::string sDepParserFeatureFile = std::string(sFeaturePath) + \"\/depparser\";\n std::cerr << \"Loading dependency parser from \" << sDepParserFeatureFile << std::endl;\n if (!FileExists(sDepParserFeatureFile)) {\n return 1;\n }\n depparser = new CDepParser(sDepParserFeatureFile, false);\n zpm->depparser = (void *)depparser;\n return 0;\n}\n\n\/\/ The function to load all three models\nextern \"C\" int load_models(const char *sFeaturePath) {\n if (load_tagger(sFeaturePath)) {\n return 1;\n }\n if (load_parser(sFeaturePath)) {\n return 1;\n }\n if (load_depparser(sFeaturePath)) {\n return 1;\n }\n return 0;\n}\n\n\/\/ Function to tag a sentence\nextern \"C\" const char* tag_sentence(const char *input_sentence)\n{\n\n \/\/ create a temporary string stream from the input char *\n CSentenceReader input_reader(std::string(input_sentence), false);\n\n \/\/ tokenize the sentence\n CStringVector input_sent[1];\n input_reader.readSegmentedSentenceAndTokenize(input_sent);\n\n \/\/ initialize the variable that will hold the tagged sentence\n CTwoStringVector tagged_sent[1];\n\n CBitArray prunes(MAX_SENTENCE_SIZE);\n\n \/\/ get the tagger that was stored earlier\n CTagger *tagger = (CTagger *)zpm->tagger;\n\n \/\/ tag the sentence\n tagger->tag(input_sent, tagged_sent);\n\n \/\/ format the tagged sentence properly and return\n return format_tagged_vector(tagged_sent);\n}\n\n\/\/ Function to constituency parse a sentence\nextern \"C\" char* parse_sentence(const char *input_sentence)\n{\n\n \/\/ create a temporary string stream from the input char *\n CSentenceReader input_reader(std::string(input_sentence), false);\n\n \/\/ tokenize the sentence\n CStringVector input_sent[1];\n input_reader.readSegmentedSentenceAndTokenize(input_sent);\n\n \/\/ initialize the variable that will hold the tagged sentence\n CTwoStringVector tagged_sent[1];\n english::CCFGTree parsed_sent[1];\n\n CBitArray prunes(MAX_SENTENCE_SIZE);\n\n \/\/ get the tagger that was stored earlier\n CTagger *tagger = (CTagger *)zpm->tagger;\n CConParser *conparser = (CConParser *)zpm->conparser;\n\n \/\/ tag the sentence\n tagger->tag(input_sent, tagged_sent);\n conparser->parse(*tagged_sent, parsed_sent);\n\n \/\/ now put the tagged_sent into a string stream\n const char * parse;\n parse = parsed_sent->str_unbinarized().c_str();\n if (zpm->output_buffer != NULL) {\n free(zpm->output_buffer);\n }\n zpm->output_buffer = new char[strlen(parse)+1];\n strcpy(zpm->output_buffer, parse);\n return zpm->output_buffer;\n}\n\n\/\/ Function to dependency parse a sentence\nextern \"C\" const char* dep_parse_sentence(const char *input_sentence)\n{\n\n \/\/ create a temporary string stream from the input char *\n CSentenceReader input_reader(std::string(input_sentence), false);\n\n \/\/ tokenize the sentence\n CStringVector input_sent[1];\n input_reader.readSegmentedSentenceAndTokenize(input_sent);\n\n \/\/ initialize the variable that will hold the tagged sentence\n CTwoStringVector tagged_sent[1];\n CDependencyParse parsed_sent[1];\n\n CBitArray prunes(MAX_SENTENCE_SIZE);\n\n \/\/ get the tagger that was stored earlier\n CTagger *tagger = (CTagger *)zpm->tagger;\n CDepParser *depparser = (CDepParser *)zpm->depparser;\n\n \/\/ tag the sentence\n tagger->tag(input_sent, tagged_sent);\n depparser->parse(*tagged_sent, parsed_sent);\n\n \/\/ now output the formatted dependency tree\n return format_dependency_tree(parsed_sent);\n\n}\n\n\/\/ Function to tag all sentence in the given input file\n\/\/ and write tagged sentences to the given output file\nextern \"C\" void tag_file(const char *sInputFile, const char *sOutputFile)\n{\n\n std::cerr << \"Processing file \" << sInputFile << std::endl;\n\n \/\/ initialize the input reader\n CSentenceReader input_reader(sInputFile);\n\n \/\/ open the output file\n FILE *outfp = NULL;\n outfp = fopen(sOutputFile, \"w\");\n\n \/\/ initialize the temporary sentence variables\n CStringVector input_sent[1];\n CTwoStringVector tagged_sent[1];\n\n CBitArray prunes(MAX_SENTENCE_SIZE);\n\n \/\/ get the tagger and the parser that were stored earlier\n CTagger *tagger = (CTagger *)zpm->tagger;\n\n \/\/ read in and tokenize the given input file\n while ( input_reader.readSegmentedSentenceAndTokenize(input_sent) )\n {\n if ( input_sent->back() == \"\\n\" )\n {\n input_sent->pop_back();\n }\n\n \/\/ tag the sentence\n tagger->tag(input_sent, tagged_sent);\n\n \/\/ write the formatted sentence to the output file\n fprintf(outfp, \"%s\\n\", format_tagged_vector(tagged_sent));\n }\n\n \/\/ close the output file\n std::cerr << \"Wrote output to \" << sOutputFile << std::endl;\n fclose(outfp);\n}\n\n\/\/ Function to constituency parse all sentence in the given input file\n\/\/ and write parsed sentences to the given output file\nextern \"C\" void parse_file(const char *sInputFile, const char *sOutputFile)\n{\n\n std::cerr << \"Processing file \" << sInputFile << std::endl;\n\n \/\/ initialize the input reader\n CSentenceReader input_reader(sInputFile);\n\n \/\/ open the output file\n FILE *outfp = NULL;\n outfp = fopen(sOutputFile, \"w\");\n\n \/\/ initialize the temporary sentence variables\n CStringVector input_sent[1];\n CTwoStringVector tagged_sent[1];\n english::CCFGTree parsed_sent[1];\n\n CBitArray prunes(MAX_SENTENCE_SIZE);\n\n \/\/ get the tagger and the parser that were stored earlier\n CTagger *tagger = (CTagger *)zpm->tagger;\n CConParser *conparser = (CConParser *)zpm->conparser;\n\n \/\/ read in and tokenize the given input file\n while ( input_reader.readSegmentedSentenceAndTokenize(input_sent) )\n {\n if ( input_sent->back() == \"\\n\" )\n {\n input_sent->pop_back();\n }\n\n tagger->tag(input_sent, tagged_sent);\n conparser->parse(*tagged_sent, parsed_sent);\n\n fprintf(outfp, \"%s\\n\", parsed_sent->str_unbinarized().c_str());\n }\n\n \/\/ close the output file\n std::cerr << \"Wrote output to \" << sOutputFile << std::endl;\n fclose(outfp);\n}\n\n\/\/ Function to dependency parse all sentence in the given input file\n\/\/ and write parsed sentences to the given output file\nextern \"C\" void dep_parse_file(const char *sInputFile, const char *sOutputFile)\n{\n\n std::cerr << \"Processing file \" << sInputFile << std::endl;\n\n \/\/ initialize the input reader\n CSentenceReader input_reader(sInputFile);\n\n \/\/ open the output file\n FILE *outfp = NULL;\n outfp = fopen(sOutputFile, \"w\");\n\n \/\/ initialize the temporary sentence variables\n CStringVector input_sent[1];\n CTwoStringVector tagged_sent[1];\n CDependencyParse parsed_sent[1];\n\n CBitArray prunes(MAX_SENTENCE_SIZE);\n\n \/\/ get the tagger and the parser that were stored earlier\n CTagger *tagger = (CTagger *)zpm->tagger;\n CDepParser *depparser = (CDepParser *)zpm->depparser;\n\n \/\/ read in and tokenize the given input file\n while ( input_reader.readSegmentedSentenceAndTokenize(input_sent) )\n {\n if ( input_sent->back() == \"\\n\" )\n {\n input_sent->pop_back();\n }\n\n tagger->tag(input_sent, tagged_sent);\n depparser->parse(*tagged_sent, parsed_sent);\n\n fprintf(outfp, \"%s\\n\", format_dependency_tree(parsed_sent));\n }\n\n \/\/ close the output file\n std::cerr << \"Wrote output to \" << sOutputFile << std::endl;\n fclose(outfp);\n}\n\n\/\/ Function to unload all the models\nextern \"C\" void unload_models()\n{\n\n \/\/ just delete the container itself and its destructor\n \/\/ will take care of everything else\n delete zpm;\n}\n\n\/\/ A main function for testing\n\/\/ extern \"C\" int main(int argc, char *argv[])\n\/\/ {\n\/\/ load_tagger(\"\/scratch\/nmadnani\/zpar\/english\");\n\/\/ load_depparser(\"\/scratch\/nmadnani\/zpar\/english\");\n\/\/ std::cout << std::string(dep_parse_sentence(\"I am going to the market.\\n\")) << std::endl;\n\/\/ dep_parse_file(\"\/scratch\/nmadnani\/zpar\/test.txt\", \"\/scratch\/nmadnani\/zpar\/test.dep\");\n\/\/ unload_models();\n\n\/\/ return 0;\n\/\/ }\n<commit_msg>Some more fixes<commit_after>\/****************************************************************\n * *\n * zpar.lib.cpp - a library that can be used by python *\n * *\n * Author: Nitin Madnani *\n * Educational Testing Service, Princeton, NJ *\n * *\n ****************************************************************\/\n\n#define SIMPLE_HASH\n\n#include \"definitions.h\"\n#include \"options.h\"\n#include \"tagger.h\"\n#include \"conparser.h\"\n#include \"depparser.h\"\n#include \"reader.h\"\n#include \"writer.h\"\n#include \"stdlib.h\"\n#include <cstring>\n#include <iterator>\n#include <sstream>\n\nusing namespace english;\n\n#define MAX_SENTENCE_SIZE 512\n\n\n\/\/ define a container structure with a container and a destructor\nstruct zparModel_t\n{\n void *tagger;\n void *conparser;\n void *depparser;\n char *output_buffer;\n\n zparModel_t() {\n tagger = NULL;\n conparser = NULL;\n depparser = NULL;\n output_buffer = NULL;\n };\n\n ~zparModel_t() {\n if (tagger)\n delete (CTagger *)tagger;\n if (conparser)\n delete (CConParser *)conparser;\n if (depparser)\n delete (CDepParser *)depparser;\n if (output_buffer) {\n free(output_buffer);\n }\n };\n};\n\n\/\/ instantiate the container\nzparModel_t *zpm = new zparModel_t();\n\n\/\/ a utility function to output tagged data in the usual\n\/\/ \"WORD\/TAG\" format as expected\nconst char *format_tagged_vector(CTwoStringVector *tagged_sent)\n{\n\n CTwoStringVector::const_iterator it;\n CStringVector formatted_tagged_sent[1];\n for (it = tagged_sent->begin(); it != tagged_sent->end(); ++it)\n {\n std::stringstream tmpss;\n tmpss << it->first << \"\/\" << it->second;\n std::string tmpstr(tmpss.str());\n formatted_tagged_sent->push_back(tmpstr);\n }\n\n int i;\n std::stringstream oss;\n for (i = 0; i < formatted_tagged_sent->size(); ++i)\n {\n oss << formatted_tagged_sent->at(i);\n if (i != formatted_tagged_sent->size() - 1)\n {\n oss << \" \";\n }\n }\n\n std::string outstr(oss.str());\n return outstr.c_str();\n\n}\n\n\/\/ A utility function to format the dependncy output\n\/\/ in CoNLL format\nconst char *format_dependency_tree(CDependencyParse *parsed_sent)\n{\n\n int i;\n std::stringstream oss;\n std::copy(parsed_sent->begin(), parsed_sent->end(), std::ostream_iterator<CLabeledDependencyTreeNode>(oss, \"\\n\"));\n\n std::string outstr(oss.str());\n return outstr.c_str();\n\n}\n\n\/\/ The function to load the tagger model\nextern \"C\" int load_tagger(const char *sFeaturePath) {\n\n CTagger *tagger;\n std::string sTaggerFeatureFile = std::string(sFeaturePath) + \"\/tagger\";\n std::cerr << \"Loading tagger from \" << sTaggerFeatureFile << std::endl;\n if (!FileExists(sTaggerFeatureFile)) {\n return 1;\n }\n tagger = new CTagger(sTaggerFeatureFile, false);\n zpm->tagger = (void *)tagger;\n return 0;\n\n}\n\n\/\/ The function to load the constituency parser model\nextern \"C\" int load_parser(const char *sFeaturePath) {\n\n \/\/ If the tagger is not already loaded, then we need to load\n \/\/ it since the parser requires the tagger\n if (!zpm->tagger) {\n if (load_tagger(sFeaturePath)) {\n return 1;\n }\n }\n\n CConParser *conparser;\n std::string sConParserFeatureFile = std::string(sFeaturePath) + \"\/conparser\";\n std::cerr << \"Loading constituency parser from \" << sConParserFeatureFile << std::endl;\n if (!FileExists(sConParserFeatureFile)) {\n return 1;\n }\n conparser = new CConParser(sConParserFeatureFile, false);\n zpm->conparser = (void *)conparser;\n return 0;\n}\n\n\/\/ The function to load the dependency parser model\nextern \"C\" int load_depparser(const char *sFeaturePath) {\n\n CDepParser *depparser;\n std::string sDepParserFeatureFile = std::string(sFeaturePath) + \"\/depparser\";\n std::cerr << \"Loading dependency parser from \" << sDepParserFeatureFile << std::endl;\n if (!FileExists(sDepParserFeatureFile)) {\n return 1;\n }\n depparser = new CDepParser(sDepParserFeatureFile, false);\n zpm->depparser = (void *)depparser;\n return 0;\n}\n\n\/\/ The function to load all three models\nextern \"C\" int load_models(const char *sFeaturePath) {\n if (load_tagger(sFeaturePath)) {\n return 1;\n }\n if (load_parser(sFeaturePath)) {\n return 1;\n }\n if (load_depparser(sFeaturePath)) {\n return 1;\n }\n return 0;\n}\n\n\/\/ Function to tag a sentence\nextern \"C\" const char* tag_sentence(const char *input_sentence)\n{\n\n \/\/ create a temporary string stream from the input char *\n CSentenceReader input_reader(std::string(input_sentence), false);\n\n \/\/ tokenize the sentence\n CStringVector input_sent[1];\n input_reader.readSegmentedSentenceAndTokenize(input_sent);\n\n \/\/ initialize the variable that will hold the tagged sentence\n CTwoStringVector tagged_sent[1];\n\n CBitArray prunes(MAX_SENTENCE_SIZE);\n\n \/\/ get the tagger that was stored earlier\n CTagger *tagger = (CTagger *)zpm->tagger;\n\n \/\/ tag the sentence\n tagger->tag(input_sent, tagged_sent);\n\n \/\/ format the tagged sentence properly and return\n return format_tagged_vector(tagged_sent);\n}\n\n\/\/ Function to constituency parse a sentence\nextern \"C\" char* parse_sentence(const char *input_sentence)\n{\n\n \/\/ create a temporary string stream from the input char *\n CSentenceReader input_reader(std::string(input_sentence), false);\n\n \/\/ tokenize the sentence\n CStringVector input_sent[1];\n input_reader.readSegmentedSentenceAndTokenize(input_sent);\n\n \/\/ initialize the variable that will hold the tagged sentence\n CTwoStringVector tagged_sent[1];\n english::CCFGTree parsed_sent[1];\n\n CBitArray prunes(MAX_SENTENCE_SIZE);\n\n \/\/ get the tagger that was stored earlier\n CTagger *tagger = (CTagger *)zpm->tagger;\n CConParser *conparser = (CConParser *)zpm->conparser;\n\n \/\/ tag the sentence\n tagger->tag(input_sent, tagged_sent);\n conparser->parse(*tagged_sent, parsed_sent);\n\n \/\/ now put the tagged_sent into a string stream\n const char * parse;\n parse = parsed_sent->str_unbinarized().c_str();\n if (zpm->output_buffer != NULL) {\n free(zpm->output_buffer);\n zpm->output_buffer = NULL;\n }\n zpm->output_buffer = new char[strlen(parse) + 1];\n strcpy(zpm->output_buffer, parse);\n return zpm->output_buffer;\n}\n\n\/\/ Function to dependency parse a sentence\nextern \"C\" const char* dep_parse_sentence(const char *input_sentence)\n{\n\n \/\/ create a temporary string stream from the input char *\n CSentenceReader input_reader(std::string(input_sentence), false);\n\n \/\/ tokenize the sentence\n CStringVector input_sent[1];\n input_reader.readSegmentedSentenceAndTokenize(input_sent);\n\n \/\/ initialize the variable that will hold the tagged sentence\n CTwoStringVector tagged_sent[1];\n CDependencyParse parsed_sent[1];\n\n CBitArray prunes(MAX_SENTENCE_SIZE);\n\n \/\/ get the tagger that was stored earlier\n CTagger *tagger = (CTagger *)zpm->tagger;\n CDepParser *depparser = (CDepParser *)zpm->depparser;\n\n \/\/ tag the sentence\n tagger->tag(input_sent, tagged_sent);\n depparser->parse(*tagged_sent, parsed_sent);\n\n \/\/ now output the formatted dependency tree\n return format_dependency_tree(parsed_sent);\n\n}\n\n\/\/ Function to tag all sentence in the given input file\n\/\/ and write tagged sentences to the given output file\nextern \"C\" void tag_file(const char *sInputFile, const char *sOutputFile)\n{\n\n std::cerr << \"Processing file \" << sInputFile << std::endl;\n\n \/\/ initialize the input reader\n CSentenceReader input_reader(sInputFile);\n\n \/\/ open the output file\n FILE *outfp = NULL;\n outfp = fopen(sOutputFile, \"w\");\n\n \/\/ initialize the temporary sentence variables\n CStringVector input_sent[1];\n CTwoStringVector tagged_sent[1];\n\n CBitArray prunes(MAX_SENTENCE_SIZE);\n\n \/\/ get the tagger and the parser that were stored earlier\n CTagger *tagger = (CTagger *)zpm->tagger;\n\n \/\/ read in and tokenize the given input file\n while ( input_reader.readSegmentedSentenceAndTokenize(input_sent) )\n {\n if ( input_sent->back() == \"\\n\" )\n {\n input_sent->pop_back();\n }\n\n \/\/ tag the sentence\n tagger->tag(input_sent, tagged_sent);\n\n \/\/ write the formatted sentence to the output file\n fprintf(outfp, \"%s\\n\", format_tagged_vector(tagged_sent));\n }\n\n \/\/ close the output file\n std::cerr << \"Wrote output to \" << sOutputFile << std::endl;\n fclose(outfp);\n}\n\n\/\/ Function to constituency parse all sentence in the given input file\n\/\/ and write parsed sentences to the given output file\nextern \"C\" void parse_file(const char *sInputFile, const char *sOutputFile)\n{\n\n std::cerr << \"Processing file \" << sInputFile << std::endl;\n\n \/\/ initialize the input reader\n CSentenceReader input_reader(sInputFile);\n\n \/\/ open the output file\n FILE *outfp = NULL;\n outfp = fopen(sOutputFile, \"w\");\n\n \/\/ initialize the temporary sentence variables\n CStringVector input_sent[1];\n CTwoStringVector tagged_sent[1];\n english::CCFGTree parsed_sent[1];\n\n CBitArray prunes(MAX_SENTENCE_SIZE);\n\n \/\/ get the tagger and the parser that were stored earlier\n CTagger *tagger = (CTagger *)zpm->tagger;\n CConParser *conparser = (CConParser *)zpm->conparser;\n\n \/\/ read in and tokenize the given input file\n while ( input_reader.readSegmentedSentenceAndTokenize(input_sent) )\n {\n if ( input_sent->back() == \"\\n\" )\n {\n input_sent->pop_back();\n }\n\n tagger->tag(input_sent, tagged_sent);\n conparser->parse(*tagged_sent, parsed_sent);\n\n fprintf(outfp, \"%s\\n\", parsed_sent->str_unbinarized().c_str());\n }\n\n \/\/ close the output file\n std::cerr << \"Wrote output to \" << sOutputFile << std::endl;\n fclose(outfp);\n}\n\n\/\/ Function to dependency parse all sentence in the given input file\n\/\/ and write parsed sentences to the given output file\nextern \"C\" void dep_parse_file(const char *sInputFile, const char *sOutputFile)\n{\n\n std::cerr << \"Processing file \" << sInputFile << std::endl;\n\n \/\/ initialize the input reader\n CSentenceReader input_reader(sInputFile);\n\n \/\/ open the output file\n FILE *outfp = NULL;\n outfp = fopen(sOutputFile, \"w\");\n\n \/\/ initialize the temporary sentence variables\n CStringVector input_sent[1];\n CTwoStringVector tagged_sent[1];\n CDependencyParse parsed_sent[1];\n\n CBitArray prunes(MAX_SENTENCE_SIZE);\n\n \/\/ get the tagger and the parser that were stored earlier\n CTagger *tagger = (CTagger *)zpm->tagger;\n CDepParser *depparser = (CDepParser *)zpm->depparser;\n\n \/\/ read in and tokenize the given input file\n while ( input_reader.readSegmentedSentenceAndTokenize(input_sent) )\n {\n if ( input_sent->back() == \"\\n\" )\n {\n input_sent->pop_back();\n }\n\n tagger->tag(input_sent, tagged_sent);\n depparser->parse(*tagged_sent, parsed_sent);\n\n fprintf(outfp, \"%s\\n\", format_dependency_tree(parsed_sent));\n }\n\n \/\/ close the output file\n std::cerr << \"Wrote output to \" << sOutputFile << std::endl;\n fclose(outfp);\n}\n\n\/\/ Function to unload all the models\nextern \"C\" void unload_models()\n{\n\n \/\/ just delete the container itself and its destructor\n \/\/ will take care of everything else\n delete zpm;\n}\n\n\/\/ A main function for testing\n\/\/ extern \"C\" int main(int argc, char *argv[])\n\/\/ {\n\/\/ load_tagger(\"\/scratch\/nmadnani\/zpar\/english\");\n\/\/ load_depparser(\"\/scratch\/nmadnani\/zpar\/english\");\n\/\/ std::cout << std::string(dep_parse_sentence(\"I am going to the market.\\n\")) << std::endl;\n\/\/ dep_parse_file(\"\/scratch\/nmadnani\/zpar\/test.txt\", \"\/scratch\/nmadnani\/zpar\/test.dep\");\n\/\/ unload_models();\n\n\/\/ return 0;\n\/\/ }\n<|endoftext|>"} {"text":"<commit_before>#ifndef ZSTD_WRAP_H\n#define ZSTD_WRAP_H\n\n#include <nan.h>\n#include <zstd.h>\n\nclass ZSTDWrap : public Nan::ObjectWrap {\n public:\n static NAN_MODULE_INIT(Init) {\n v8::Local<v8::FunctionTemplate> tpl = Nan::New<v8::FunctionTemplate>(New);\n tpl->SetClassName(Nan::New(\"ZSTD\").ToLocalChecked());\n tpl->InstanceTemplate()->SetInternalFieldCount(1);\n\n SetPrototypeMethod(tpl, \"compress\", Compress);\n SetPrototypeMethod(tpl, \"decompress\", Decompress);\n\n constructor().Reset(Nan::GetFunction(tpl).ToLocalChecked());\n Nan::Set(target, Nan::New(\"ZSTD\").ToLocalChecked(),\n Nan::GetFunction(tpl).ToLocalChecked());\n }\n\n private:\n static NAN_METHOD(New) {\n if (info.IsConstructCall()) {\n ZSTDWrap *obj = new ZSTDWrap();\n obj->Wrap(info.This());\n info.GetReturnValue().Set(info.This());\n } else {\n v8::Local<v8::Function> cons = Nan::New<v8::Function>(constructor);\n info.GetReturnValue().Set(cons->NewInstance(0, NULL));\n }\n }\n\n static NAN_METHOD(Compress) {\n ZSTDWrap *obj = ObjectWrap::Unwrap<ZSTDWrap>(info.Holder());\n\n if (info.Length() < 1 || !node::Buffer::HasInstance(info[0])) {\n return Nan::ThrowError(\"First argument should be a buffer\");\n }\n\n v8::Local<v8::Object> buf = info[0]->ToObject();\n char *src = node::Buffer::Data(buf);\n size_t srcSize = node::Buffer::Length(buf);\n\n size_t dstCapacity = ZSTD_compressBound(srcSize);\n char *dst = (char*)malloc(dstCapacity);\n if (NULL == dst) {\n return Nan::ThrowError(\"Too large, Out of memory!\");\n }\n\n int compressionLevel = 1;\n if (info.Length() == 2) {\n compressionLevel = info[1]->IsUndefined() ? 0 : info[1]->NumberValue();\n }\n\n size_t cSize = ZSTD_compress(dst, dstCapacity, src, srcSize, compressionLevel);\n if (ZSTD_isError(cSize)) {\n return Nan::ThrowError(\"Compress failed!\");\n }\n\n v8::Local<v8::Object> dstBuf = Nan::NewBuffer(dst, cSize);\n free(dst);\n\n return info.GetReturnValue().Set(dstBuf);\n }\n\n static NAN_METHOD(Decompress) {\n ZSTDWrap *obj = ObjectWrap::Unwrap<ZSTDWrap>(info.Holder());\n\n if (info.Length() < 1 || !node::Buffer::HasInstance(info[0])) {\n return Nan::ThrowError(\"First argument should be a buffer\");\n }\n\n v8::Local<v8::Object> buf = info[0]->ToObject();\n char *src = node::Buffer::Data(buf);\n size_t srcSize = node::Buffer::Length(buf);\n\n size_t dstCapacity = ZSTD_getDecompressedSize(src, srcSize);\n if (0 == dstCapacity) {\n return Nan::ThrowError(\"Compressed size unknown\");\n }\n\n char *dst = (char*)malloc(dstCapacity);\n if (NULL == dst) {\n return Nan::ThrowError(\"Too large, Out of memory!\");\n }\n\n size_t dSize = ZSTD_decompress(dst, dstCapacity, src, srcSize);\n if (ZSTD_isError(dSize)) {\n return Nan::ThrowError(\"Decompress failed!\");\n }\n\n v8::Local<v8::Object> dstBuf = Nan::NewBuffer(dst, dSize);\n free(dst);\n\n return info.GetReturnValue().Set(dstBuf);\n }\n\n static inline Nan::Persistent<v8::Function> & constructor() {\n static Nan::Persistent<v8::Function> _constructor;\n return _constructor;\n }\n};\n\nNODE_MODULE(node_zstd, ZSTDWrap::Init)\n\n#endif\n<commit_msg>refactor<zstd_wrap>: remove class<commit_after>#include <nan.h>\n#include <zstd.h>\n\nstatic NAN_METHOD(Compress) {\n\n if (info.Length() < 1 || !node::Buffer::HasInstance(info[0])) {\n return Nan::ThrowError(\"First argument should be a buffer\");\n }\n\n v8::Local<v8::Object> buf = info[0]->ToObject();\n char *src = node::Buffer::Data(buf);\n size_t srcSize = node::Buffer::Length(buf);\n\n size_t dstCapacity = ZSTD_compressBound(srcSize);\n char *dst = (char*)malloc(dstCapacity);\n if (NULL == dst) {\n return Nan::ThrowError(\"Too large, Out of memory!\");\n }\n\n int compressionLevel = 1;\n if (info.Length() == 2) {\n compressionLevel = info[1]->IsUndefined() ? 0 : info[1]->NumberValue();\n }\n\n size_t cSize = ZSTD_compress(dst, dstCapacity, src, srcSize, compressionLevel);\n if (ZSTD_isError(cSize)) {\n return Nan::ThrowError(\"Compress failed!\");\n }\n\n Nan::MaybeLocal<v8::Object> dstBuf = Nan::NewBuffer(dst, cSize);\n free(dst);\n\n return info.GetReturnValue().Set(dstBuf.ToLocalChecked());\n}\n\nstatic NAN_METHOD(Decompress) {\n\n if (info.Length() < 1 || !node::Buffer::HasInstance(info[0])) {\n return Nan::ThrowError(\"First argument should be a buffer\");\n }\n\n v8::Local<v8::Object> buf = info[0]->ToObject();\n char *src = node::Buffer::Data(buf);\n size_t srcSize = node::Buffer::Length(buf);\n\n size_t dstCapacity = ZSTD_getDecompressedSize(src, srcSize);\n if (0 == dstCapacity) {\n return Nan::ThrowError(\"Compressed size unknown\");\n }\n\n char *dst = (char*)malloc(dstCapacity);\n if (NULL == dst) {\n return Nan::ThrowError(\"Too large, Out of memory!\");\n }\n\n size_t dSize = ZSTD_decompress(dst, dstCapacity, src, srcSize);\n if (ZSTD_isError(dSize)) {\n return Nan::ThrowError(\"Decompress failed!\");\n }\n\n Nan::MaybeLocal<v8::Object> dstBuf = Nan::NewBuffer(dst, dSize);\n free(dst);\n\n return info.GetReturnValue().Set(dstBuf.ToLocalChecked());\n}\n\nNAN_MODULE_INIT(Init) {\n NAN_EXPORT(target, Compress);\n NAN_EXPORT(target, Decompress);\n}\n<|endoftext|>"} {"text":"<commit_before>#include <iostream>\n#include <string>\n#include <functional>\n#include <cassert>\n\n#include \"calc\\calculator.h\"\n\nconst float DELTA = 0.001f;\n\nbool equal(float a, float b) {\n\treturn (a + DELTA > b) && (a - DELTA < b);\n}\n\nfloat addTwo(float a, float notUsed) {\n\treturn a + 2;\n}\n\nfloat multiply(float a, float b) {\n\treturn a * b;\n}\n\nint main() {\n\t\/\/ Test 1.\n\t\/\/ Expression is evaluated.\n\t{\n\t\tcalc::Calculator calculator;\n\t\tstd::string expression = \"2.1+~3.2*5^(3-1)\/(2*3.14 - 1)\";\n\t\tconst float answer = -13.0515151515151515f;\n\t\tfloat value = calculator.excecute(expression);\n\t\tstd::cout << expression << \"=\" << value << \"\\n\";\n\t\t\/\/ Test expression!\n\t\tassert(equal(answer, value));\n\t}\n\t\n\t\/\/ Test 2.\n\t\/\/ Expression is evaluated with added constants.\n\t{\n\t\tcalc::Calculator calculator;\n\t\tcalculator.addVariable(\"PI\", 3.14f);\n\t\tcalculator.addVariable(\"TWO\", 2);\n\t\tcalculator.addVariable(\"FIVE\", 5);\t\t\n\t\tstd::string expression = \"2.1+~3.2*FIVE^(3-1)\/(TWO*PI - 1)\";\n\t\tconst float answer = -13.0515151515151515f;\n\t\tfloat value = calculator.excecute(expression);\n\t\tstd::cout << expression << \"=\" << value << \"\\n\";\n\t\t\/\/ Test expression!\n\t\tassert(equal(answer, value));\n\t}\n\n\t\/\/ Test 2.\n\t\/\/ Expression is evaluated with added constants and functions.\n\t{\n\t\tcalc::Calculator calculator;\n\t\tcalculator.addVariable(\"PI\", 3.14f);\n\t\tcalculator.addVariable(\"TWO\", 2);\n\t\tcalculator.addVariable(\"FIVE\", 5);\n\t\tcalculator.addFunction(\"addTwo\", 1, std::bind(addTwo, std::placeholders::_1, std::placeholders::_2));\n\t\tcalculator.addFunction(\"multiply\", 2, std::bind(multiply, std::placeholders::_1, std::placeholders::_2));\n\n\t\tstd::string expression = \"multiply(addTwo(2.1+~3.2*FIVE^(3-1)\/(TWO*PI - 1)), 8.1)\";\n\t\tconst float answer = (-13.0515151515151515f + 2)*8.1f;\n\t\tfloat value = calculator.excecute(expression);\n\t\tstd::cout << expression << \"=\" << value << \"\\n\";\n\t\t\/\/ Test expression!\n\t\tassert(equal(answer, value));\n\t}\n\n\tstd::cout << \"\\nAll tests succeeded!\\n\";\n\n\treturn 0;\n}<commit_msg>Added some tests.<commit_after>#include <iostream>\n#include <string>\n#include <functional>\n#include <cassert>\n\n#include \"calc\\calculator.h\"\n\nconst float DELTA = 0.001f;\n\nbool equal(float a, float b) {\n\treturn (a + DELTA > b) && (a - DELTA < b);\n}\n\nfloat addTwo(float a, float notUsed) {\n\treturn a + 2;\n}\n\nfloat multiply(float a, float b) {\n\treturn a * b;\n}\n\nint main() {\n\t\/\/ Test 1.\n\t\/\/ Expression is evaluated.\n\t{\n\t\tcalc::Calculator calculator;\n\t\tstd::string expression = \"2.1+~3.2*5^(3-1)\/(2*3.14 - 1)\";\n\t\tconst float answer = -13.0515151515151515f;\n\t\tfloat value = calculator.excecute(expression);\n\t\tstd::cout << expression << \"=\" << value << \"\\n\";\n\t\t\/\/ Test expression!\n\t\tassert(equal(answer, value));\n\t}\n\t\n\t\/\/ Test 2.\n\t\/\/ Expression is evaluated with added constants.\n\t{\n\t\tcalc::Calculator calculator;\n\t\tcalculator.addVariable(\"PI\", 3.14f);\n\t\tcalculator.addVariable(\"TWO\", 2);\n\t\tcalculator.addVariable(\"FIVE\", 5);\t\t\n\t\tstd::string expression = \"2.1+~3.2*FIVE^(3-1)\/(TWO*PI - 1)\";\n\t\tconst float answer = -13.0515151515151515f;\n\t\tfloat value = calculator.excecute(expression);\n\t\tstd::cout << expression << \"=\" << value << \"\\n\";\n\t\t\/\/ Test expression!\n\t\tassert(equal(answer, value));\n\t}\n\n\t\/\/ Test 2.\n\t\/\/ Expression is evaluated with added constants and functions.\n\t{\n\t\tcalc::Calculator calculator;\n\t\tcalculator.addVariable(\"PI\", 3.14f);\n\t\tcalculator.addVariable(\"TWO\", 2);\n\t\tcalculator.addVariable(\"FIVE\", 5);\n\t\tcalculator.addFunction(\"addTwo\", 1, std::bind(addTwo, std::placeholders::_1, std::placeholders::_2));\n\t\tcalculator.addFunction(\"multiply\", 2, std::bind(multiply, std::placeholders::_1, std::placeholders::_2));\n\n\t\tstd::string expression = \"multiply(addTwo(2.1+~3.2*FIVE^(3-1)\/(TWO*PI - 1)), 8.1)\";\n\t\tconst float answer = (-13.0515151515151515f + 2)*8.1f;\n\t\tfloat value = calculator.excecute(expression);\n\t\tstd::cout << expression << \"=\" << value << \"\\n\";\n\t\t\/\/ Test expression!\n\t\tassert(equal(answer, value));\n\t}\n\n\t\/\/ Test 2.\n\t\/\/ Expression is evaluated with added constants and functions.\n\t{\n\t\tcalc::Calculator calculator;\n\t\tcalculator.addVariable(\"pi\", 3.14159265359f);\n\t\tcalculator.addFunction(\"exp\", 1, [](float a, float b) {\n\t\t\treturn std::exp(a);\n\t\t});\n\t\tcalculator.addFunction(\"sin\", 1, [](float a, float b) {\n\t\t\treturn std::sin(a);\n\t\t});\n\t\tcalculator.addFunction(\"cos\", 1, [](float a, float b) {\n\t\t\treturn std::cos(a);\n\t\t});\n\t\tcalculator.addFunction(\"ln\", 1, [](float a, float b) {\n\t\t\treturn std::log(a);\n\t\t});\t\t\n\t\tcalculator.addFunction(\"log\", 1, [](float a, float b) {\n\t\t\treturn std::log10(a);\n\t\t});\n\t\tcalculator.addFunction(\"pow\", 2, [](float a, float b) {\n\t\t\treturn std::pow(a,b);\n\t\t});\n\n\t\tassert(equal(calculator.excecute(\"exp(1.11)\"), 3.034358f));\n\t\t\n\t\tassert(equal(calculator.excecute(\"sin( cos(90*pi \/ 180))\"), 0.000001f));\n\t\tassert(equal(calculator.excecute(\"34.5*(23+1.5)\/2\"), 422.625000f));\n\t\t\n\t\tassert(equal(calculator.excecute(\"5 + ((1 + 2) * 4) - 3\"), 14));\n\t\tassert(equal(calculator.excecute(\"( 1 + 2 ) * ( 3 \/ 4 ) ^ ( 5 + 6 )\"), 0.126705f));\n\t\tassert(equal(calculator.excecute(\"3\/2 + 4*(12+3)\"), 61.5f));\n\t\t\n\t\tassert(equal(calculator.excecute(\"pi*pow(9\/2,2)\"), 63.617197f));\n\t\tassert(equal(calculator.excecute(\"((2*(6-1))\/2)*4\"), 20));\n\t\t\n\t\t\n\t\tassert(equal(calculator.excecute(\"ln(2)+3^5\"), 243.693147f));\n\t\t\n\t\tassert(equal(calculator.excecute(\"11 ^ -7\"), 5.13158f*std::pow(10.f, -8.f)));\t\t\n\t\tassert(equal(calculator.excecute(\"cos ( ( 1.3 + 1 ) ^ ( 1 \/ 3 ) ) - log ( ~2 * 3 \/ ~14 )\"), 0.616143f));\n\t\tassert(equal(calculator.excecute(\"1 * ~sin( pi \/ 2) \"), -1));\n\t\tassert(equal(calculator.excecute(\"~8 + 5\"), -3));\n\t\tassert(equal(calculator.excecute(\"1 - (~(2^2)) - 1\"), 4));\n\t}\n\n\tstd::cout << \"\\nAll tests succeeded!\\n\";\n\n\treturn 0;\n}\n<|endoftext|>"} {"text":"<commit_before>\/* -*- mode: C++; c-basic-offset: 2; indent-tabs-mode: nil -*- *\/\n\n#include <gecode\/driver.hh>\n#include <gecode\/int.hh>\n#include <gecode\/minimodel.hh>\n\nusing namespace Gecode;\n\n\/\/\n\/\/ g++ -g simple_dependency.cpp -lgecodesupport -lgecodekernel -lgecodeint -lgecodesearch -lgecodedriver -lpthread -ldl -lstdc++ -o simple_dependency\n\/\/\n\n\nclass SimpleDependency : public MinimizeScript {\nprotected:\n static const int PKG_COUNT = 11;\n \n IntVarArray package_versions;\n IntArgs disabled_package_weights; \n BoolVarArray disabled_package_variables;\n IntVar total_disabled;\npublic:\n \/\/\/ Actual model\n SimpleDependency(const Options& opt) : \n package_versions(*this, PKG_COUNT, -1, 10), \n disabled_package_variables(*this, PKG_COUNT, 0, 1),\n total_disabled(*this, 0, 10*PKG_COUNT) \n {\n Problem2();\n\n branch(*this, package_versions, INT_VAR_SIZE_MIN, INT_VAL_MAX);\n branch(*this, disabled_package_variables, INT_VAR_SIZE_MIN, INT_VAL_MIN);\n branch(*this, total_disabled, INT_VAL_MIN);\n }\n\n void Problem1() {\n \/\/ Add version constraints for pkg 0\n dom(*this, package_versions[0], -1, 0);\n dom(*this, package_versions[1], -1, 0);\n dom(*this, package_versions[2], -1, 0);\n dom(*this, package_versions[3], -1, 1);\n dom(*this, package_versions[4], -1, 0);\n dom(*this, package_versions[5], -1, 0);\n dom(*this, package_versions[6], -1, 2);\n dom(*this, package_versions[7], -1, 0);\n dom(*this, package_versions[8], -1, 0);\n dom(*this, package_versions[9], -1, -1);\n dom(*this, package_versions[10], 0, 0);\n\n AddVersionConstraint(0, 0, 1, 0, 1);\n AddVersionConstraint(2, 0, 1, 0, 0);\n AddVersionConstraint(1, 0, 3, 0, 1);\n AddVersionConstraint(1, 0, 4, 0, 0);\n AddVersionConstraint(1, 1, 3, 1, 1);\n AddVersionConstraint(1, 1, 5, 0, 0);\n AddVersionConstraint(7, 0, 3, -2, -2);\n AddVersionConstraint(8, 0, 9, -2, -2);\n AddVersionConstraint(10, 0, 7, 0, 0);\n \n IntArgs package_weights(PKG_COUNT, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10 );\n\n std::cout << \"Package versions: \" << package_versions << std::endl;\n std::cout << \"Disabled package variables: \" << disabled_package_variables << std::endl;\n std::cout << \"Package weights \" << package_weights << std::endl;\n std::cout << \"Total disabled: \" << total_disabled << std::endl;\n\n linear(*this, disabled_package_variables, IRT_EQ, total_disabled);\n }\n\n\n void Problem2() {\n \/\/ Add version constraints for pkg 0\n dom(*this, package_versions[0], -1, 0);\n dom(*this, package_versions[1], -1, 0);\n dom(*this, package_versions[2], -1, 0);\n dom(*this, package_versions[3], -1, 1);\n dom(*this, package_versions[4], -1, 0);\n dom(*this, package_versions[5], -1, 0);\n dom(*this, package_versions[6], -1, 2);\n dom(*this, package_versions[7], -1, 0);\n dom(*this, package_versions[8], -1, 0);\n dom(*this, package_versions[9], -1, -1);\n dom(*this, package_versions[10], 0, 0);\n\n AddVersionConstraint(0, 0, 1, 0, 1);\n AddVersionConstraint(2, 0, 1, 0, 0);\n AddVersionConstraint(1, 0, 3, 0, 1);\n AddVersionConstraint(1, 0, 4, 0, 0);\n AddVersionConstraint(1, 1, 3, 1, 1);\n AddVersionConstraint(1, 1, 5, 0, 0);\n AddVersionConstraint(7, 0, 3, -2, -2);\n AddVersionConstraint(8, 0, 9, -2, -2);\n AddVersionConstraint(10, 0, 7, 0, 0);\n \n IntArgs package_weights(PKG_COUNT, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10 );\n\n std::cout << \"Package versions: \" << package_versions << std::endl;\n std::cout << \"Disabled package variables: \" << disabled_package_variables << std::endl;\n std::cout << \"Package weights \" << package_weights << std::endl;\n std::cout << \"Total disabled: \" << total_disabled << std::endl;\n\n linear(*this, package_weights, disabled_package_variables, IRT_EQ, total_disabled);\n }\n\n\n bool AddVersionConstraint(int packageId, int version, \n\t\t\t int dependentPackageId, int minDependentVersion, int maxDependentVersion) \n {\n BoolVar version_match(*this, 0, 1);\n BoolVar depend_match(*this, 0, 1);\n BoolVar predicated_depend_match(*this, 0, 1);\n \n std::cout << \"Add VC for \" << packageId << \" @ \" << version << \" depPkg \" << dependentPackageId;\n std::cout << \" [ \" << minDependentVersion << \", \" << maxDependentVersion << \" ]\" << std::endl;\n std::cout.flush();\n\n \/\/version_flags << version_match;\n \/\/ Constrain pred to reify package @ version\n rel(*this, package_versions[packageId], IRT_EQ, version, version_match);\n \/\/ Add the predicated version constraints imposed on dependent package\n dom(*this, package_versions[dependentPackageId], minDependentVersion, maxDependentVersion, depend_match);\n \/\/ disabled_package_variables[dependentPackageId] OR depend_match <=> version_match\n \n rel(*this, disabled_package_variables[dependentPackageId], BOT_OR, depend_match, predicated_depend_match);\n rel(*this, version_match, BOT_IMP, predicated_depend_match, 1); \n }\n \n \n \/\/\/ Print solution\n virtual void\n print(std::ostream& os) const {\n os << \"\\t\" << package_versions << std::endl;\n os << \"\\t\" << disabled_package_variables << std::endl;\n os << \"\\t\" << total_disabled << std::endl;\n }\n virtual IntVar cost() const {\n return total_disabled;\n }\n\n \/\/\/ Constructor for cloning \\a s\n SimpleDependency(bool share, SimpleDependency& s) : \n MinimizeScript(share,s),\n package_versions(s.package_versions), \n disabled_package_variables(s.disabled_package_variables),\n total_disabled(s.total_disabled) \n {\n package_versions.update(*this, share, s.package_versions);\n disabled_package_variables.update(*this, share, s.disabled_package_variables);\n total_disabled.update(*this, share, s.total_disabled);\n }\n \/\/\/ Copy during cloning\n virtual Space*\n copy(bool share) {\n return new SimpleDependency(share,*this);\n }\n};\n\n\/** \\brief Main-function\n * \\relates Money\n *\/\nint\nmain(int argc, char* argv[]) {\n Options opt(\"Solve dependency\");\n opt.solutions(0);\n opt.iterations(20000);\n opt.parse(argc,argv);\n MaximizeScript::run<SimpleDependency,Restart,Options>(opt);\n return 0;\n}\n\n\/\/ STATISTICS: example-any\n\n<commit_msg>Make weights work. <commit_after>\/* -*- mode: C++; c-basic-offset: 2; indent-tabs-mode: nil -*- *\/\n\n#include <gecode\/driver.hh>\n#include <gecode\/int.hh>\n#include <gecode\/minimodel.hh>\n\nusing namespace Gecode;\n\n\/\/\n\/\/ g++ -g simple_dependency.cpp -lgecodesupport -lgecodekernel -lgecodeint -lgecodesearch -lgecodedriver -lpthread -ldl -lstdc++ -o simple_dependency\n\/\/\n\n\nclass SimpleDependency : public MinimizeScript {\nprotected:\n static const int PKG_COUNT = 11;\n \n IntVarArray package_versions;\n IntArgs disabled_package_weights; \n BoolVarArray disabled_package_variables;\n IntVar total_disabled;\npublic:\n \/\/\/ Actual model\n SimpleDependency(const Options& opt) : \n package_versions(*this, PKG_COUNT, -1, 10), \n disabled_package_variables(*this, PKG_COUNT, 0, 1),\n total_disabled(*this, 0, 10*PKG_COUNT) \n {\n Problem2();\n\n branch(*this, package_versions, INT_VAR_SIZE_MIN, INT_VAL_MAX);\n branch(*this, disabled_package_variables, INT_VAR_SIZE_MIN, INT_VAL_MIN);\n branch(*this, total_disabled, INT_VAL_MIN);\n }\n\n void Problem1() {\n \/\/ Add version constraints for pkg 0\n dom(*this, package_versions[0], -1, 0);\n dom(*this, package_versions[1], -1, 0);\n dom(*this, package_versions[2], -1, 0);\n dom(*this, package_versions[3], -1, 1);\n dom(*this, package_versions[4], -1, 0);\n dom(*this, package_versions[5], -1, 0);\n dom(*this, package_versions[6], -1, 2);\n dom(*this, package_versions[7], -1, 0);\n dom(*this, package_versions[8], -1, 0);\n dom(*this, package_versions[9], -1, -1);\n dom(*this, package_versions[10], 0, 0);\n\n AddVersionConstraint(0, 0, 1, 0, 1);\n AddVersionConstraint(2, 0, 1, 0, 0);\n AddVersionConstraint(1, 0, 3, 0, 1);\n AddVersionConstraint(1, 0, 4, 0, 0);\n AddVersionConstraint(1, 1, 3, 1, 1);\n AddVersionConstraint(1, 1, 5, 0, 0);\n AddVersionConstraint(7, 0, 3, -2, -2);\n AddVersionConstraint(8, 0, 9, -2, -2);\n AddVersionConstraint(10, 0, 7, 0, 0);\n \n IntArgs package_weights(PKG_COUNT, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10 );\n\n std::cout << \"Package versions: \" << package_versions << std::endl;\n std::cout << \"Disabled package variables: \" << disabled_package_variables << std::endl;\n std::cout << \"Package weights \" << package_weights << std::endl;\n std::cout << \"Total disabled: \" << total_disabled << std::endl;\n\n linear(*this, package_weights, disabled_package_variables, IRT_EQ, total_disabled);\n }\n\n\n void Problem2() {\n \/\/ Add version constraints for pkg 0\n dom(*this, package_versions[0], -1, 0);\n dom(*this, package_versions[1], -1, 0);\n dom(*this, package_versions[2], -1, 0);\n dom(*this, package_versions[3], -1, 1);\n dom(*this, package_versions[4], -1, 0);\n dom(*this, package_versions[5], -1, 0);\n dom(*this, package_versions[6], -1, 2);\n dom(*this, package_versions[7], -1, 0);\n dom(*this, package_versions[8], -1, 0);\n dom(*this, package_versions[9], -1, -1);\n dom(*this, package_versions[10], 0, 0);\n\n AddVersionConstraint(0, 0, 1, 0, 1);\n AddVersionConstraint(2, 0, 1, 0, 0);\n AddVersionConstraint(1, 0, 3, 0, 1);\n AddVersionConstraint(1, 0, 4, 0, 0);\n AddVersionConstraint(1, 1, 3, 1, 1);\n AddVersionConstraint(1, 1, 5, 0, 0);\n AddVersionConstraint(7, 0, 3, -2, -2);\n AddVersionConstraint(8, 0, 9, -2, -2);\n AddVersionConstraint(10, 0, 7, 0, 0);\n \n IntArgs package_weights(PKG_COUNT, 10, 10, 10, 10, 10, 10, 10, 5, 10, 10 );\n\n std::cout << \"Package versions: \" << package_versions << std::endl;\n std::cout << \"Disabled package variables: \" << disabled_package_variables << std::endl;\n std::cout << \"Package weights \" << package_weights << std::endl;\n std::cout << \"Total disabled: \" << total_disabled << std::endl;\n\n linear(*this, package_weights, disabled_package_variables, IRT_EQ, total_disabled);\n }\n\n\n bool AddVersionConstraint(int packageId, int version, \n\t\t\t int dependentPackageId, int minDependentVersion, int maxDependentVersion) \n {\n BoolVar version_match(*this, 0, 1);\n BoolVar depend_match(*this, 0, 1);\n BoolVar predicated_depend_match(*this, 0, 1);\n \n std::cout << \"Add VC for \" << packageId << \" @ \" << version << \" depPkg \" << dependentPackageId;\n std::cout << \" [ \" << minDependentVersion << \", \" << maxDependentVersion << \" ]\" << std::endl;\n std::cout.flush();\n\n \/\/version_flags << version_match;\n \/\/ Constrain pred to reify package @ version\n rel(*this, package_versions[packageId], IRT_EQ, version, version_match);\n \/\/ Add the predicated version constraints imposed on dependent package\n dom(*this, package_versions[dependentPackageId], minDependentVersion, maxDependentVersion, depend_match);\n \/\/ disabled_package_variables[dependentPackageId] OR depend_match <=> version_match\n \n rel(*this, disabled_package_variables[dependentPackageId], BOT_OR, depend_match, predicated_depend_match);\n rel(*this, version_match, BOT_IMP, predicated_depend_match, 1); \n }\n \n \n \/\/\/ Print solution\n virtual void\n print(std::ostream& os) const {\n os << \"\\t\" << package_versions << std::endl;\n os << \"\\t\" << disabled_package_variables << std::endl;\n os << \"\\t\" << total_disabled << std::endl;\n }\n virtual IntVar cost() const {\n return total_disabled;\n }\n\n \/\/\/ Constructor for cloning \\a s\n SimpleDependency(bool share, SimpleDependency& s) : \n MinimizeScript(share,s),\n package_versions(s.package_versions), \n disabled_package_variables(s.disabled_package_variables),\n total_disabled(s.total_disabled) \n {\n package_versions.update(*this, share, s.package_versions);\n disabled_package_variables.update(*this, share, s.disabled_package_variables);\n total_disabled.update(*this, share, s.total_disabled);\n }\n \/\/\/ Copy during cloning\n virtual Space*\n copy(bool share) {\n return new SimpleDependency(share,*this);\n }\n};\n\n\/** \\brief Main-function\n * \\relates Money\n *\/\nint\nmain(int argc, char* argv[]) {\n Options opt(\"Solve dependency\");\n opt.solutions(0);\n opt.iterations(20000);\n opt.parse(argc,argv);\n MaximizeScript::run<SimpleDependency,Restart,Options>(opt);\n return 0;\n}\n\n\/\/ STATISTICS: example-any\n\n<|endoftext|>"} {"text":"<commit_before>\/\/ Copyright (c) 2006-2008 The Chromium Authors. All rights reserved.\n\/\/ Use of this source code is governed by a BSD-style license that can be\n\/\/ found in the LICENSE file.\n\n#include \"net\/base\/x509_certificate.h\"\n\n#include <CommonCrypto\/CommonDigest.h>\n#include <time.h>\n\n#include \"base\/histogram.h\"\n#include \"base\/logging.h\"\n#include \"base\/pickle.h\"\n#include \"net\/base\/cert_status_flags.h\"\n#include \"net\/base\/ev_root_ca_metadata.h\"\n\nnamespace net {\n\nnamespace {\n\n\/\/ Calculates the SHA-1 fingerprint of the certificate. Returns an empty\n\/\/ (all zero) fingerprint on failure.\nX509Certificate::Fingerprint CalculateFingerprint(\n X509Certificate::OSCertHandle cert) {\n X509Certificate::Fingerprint sha1;\n memset(sha1.data, 0, sizeof(sha1.data));\n \n CSSM_DATA cert_data;\n OSStatus status = SecCertificateGetData(cert, &cert_data);\n if (status)\n return sha1;\n \n DCHECK(NULL != cert_data.Data);\n DCHECK(0 != cert_data.Length);\n \n CC_SHA1(cert_data.Data, cert_data.Length, sha1.data);\n\n return sha1;\n}\n\ninline bool CSSMOIDEqual(const CSSM_OID* oid1, const CSSM_OID* oid2) {\n return oid1->Length == oid2->Length &&\n (memcmp(oid1->Data, oid2->Data, oid1->Length) == 0);\n}\n\nvoid ParsePrincipal(const CSSM_X509_NAME* name,\n X509Certificate::Principal* principal) {\n std::vector<std::string> common_names, locality_names, state_names,\n country_names;\n\n \/\/ TODO(jcampan): add business_category and serial_number.\n const CSSM_OID* kOIDs[] = { &CSSMOID_CommonName,\n &CSSMOID_LocalityName,\n &CSSMOID_StateProvinceName,\n &CSSMOID_CountryName,\n &CSSMOID_StreetAddress,\n &CSSMOID_OrganizationName,\n &CSSMOID_OrganizationalUnitName,\n &CSSMOID_DNQualifier }; \/\/ This should be \"DC\"\n \/\/ but is undoubtedly\n \/\/ wrong. TODO(avi):\n \/\/ Find the right OID.\n\n std::vector<std::string>* values[] = {\n &common_names, &locality_names,\n &state_names, &country_names,\n &(principal->street_addresses),\n &(principal->organization_names),\n &(principal->organization_unit_names),\n &(principal->domain_components) };\n DCHECK(arraysize(kOIDs) == arraysize(values));\n\n for (size_t rdn = 0; rdn < name->numberOfRDNs; ++rdn) {\n CSSM_X509_RDN rdn_struct = name->RelativeDistinguishedName[rdn];\n for (size_t pair = 0; pair < rdn_struct.numberOfPairs; ++pair) {\n CSSM_X509_TYPE_VALUE_PAIR pair_struct =\n rdn_struct.AttributeTypeAndValue[pair];\n for (size_t oid = 0; oid < arraysize(kOIDs); ++oid) {\n if (CSSMOIDEqual(&pair_struct.type, kOIDs[oid])) {\n std::string value =\n std::string(reinterpret_cast<std::string::value_type*>\n (pair_struct.value.Data),\n pair_struct.value.Length);\n values[oid]->push_back(value);\n break;\n }\n }\n }\n }\n\n \/\/ We don't expect to have more than one CN, L, S, and C.\n std::vector<std::string>* single_value_lists[4] = {\n &common_names, &locality_names, &state_names, &country_names };\n std::string* single_values[4] = {\n &principal->common_name, &principal->locality_name,\n &principal->state_or_province_name, &principal->country_name };\n for (size_t i = 0; i < arraysize(single_value_lists); ++i) {\n DCHECK(single_value_lists[i]->size() <= 1);\n if (single_value_lists[i]->size() > 0)\n *(single_values[i]) = (*(single_value_lists[i]))[0];\n }\n}\n\nOSStatus GetCertFieldsForOID(X509Certificate::OSCertHandle cert_handle,\n CSSM_OID oid, uint32* num_of_fields,\n CSSM_FIELD_PTR* fields) {\n *num_of_fields = 0;\n *fields = NULL;\n \n CSSM_DATA cert_data;\n OSStatus status = SecCertificateGetData(cert_handle, &cert_data);\n if (status)\n return status;\n \n CSSM_CL_HANDLE cl_handle;\n status = SecCertificateGetCLHandle(cert_handle, &cl_handle);\n if (status)\n return status;\n \n status = CSSM_CL_CertGetAllFields(cl_handle, &cert_data, num_of_fields,\n fields);\n return status;\n} \n\nvoid GetCertGeneralNamesForOID(X509Certificate::OSCertHandle cert_handle,\n CSSM_OID oid, CE_GeneralNameType name_type,\n std::vector<std::string>* result) {\n uint32 num_of_fields;\n CSSM_FIELD_PTR fields;\n OSStatus status = GetCertFieldsForOID(cert_handle, oid, &num_of_fields,\n &fields);\n if (status)\n return;\n \n for (size_t field = 0; field < num_of_fields; ++field) {\n if (CSSMOIDEqual(&fields[field].FieldOid, &oid)) {\n CSSM_X509_EXTENSION_PTR cssm_ext =\n (CSSM_X509_EXTENSION_PTR)fields[field].FieldValue.Data;\n CE_GeneralNames* alt_name =\n (CE_GeneralNames*) cssm_ext->value.parsedValue;\n \n for (size_t name = 0; name < alt_name->numNames; ++name) {\n const CE_GeneralName& name_struct = alt_name->generalName[name];\n \/\/ For future extension: We're assuming that these values are of types\n \/\/ GNT_RFC822Name, GNT_DNSName or GNT_URI, all of which are encoded as\n \/\/ IA5String. In general, we should be switching off\n \/\/ |name_struct.nameType| and doing type-appropriate conversions. See\n \/\/ certextensions.h and the comment immediately preceding\n \/\/ CE_GeneralNameType for more information.\n if (name_struct.nameType == name_type) {\n const CSSM_DATA& name_data = name_struct.name;\n std::string value =\n std::string(reinterpret_cast<std::string::value_type*>\n (name_data.Data),\n name_data.Length);\n result->push_back(value);\n }\n }\n }\n }\n}\n\nvoid GetCertDateForOID(X509Certificate::OSCertHandle cert_handle,\n CSSM_OID oid, Time* result) {\n uint32 num_of_fields;\n CSSM_FIELD_PTR fields;\n OSStatus status = GetCertFieldsForOID(cert_handle, oid, &num_of_fields,\n &fields);\n if (status)\n return;\n \n for (size_t field = 0; field < num_of_fields; ++field) {\n if (CSSMOIDEqual(&fields[field].FieldOid, &oid)) {\n CSSM_X509_TIME* x509_time =\n reinterpret_cast<CSSM_X509_TIME *>(fields[field].FieldValue.Data);\n std::string time_string =\n std::string(reinterpret_cast<std::string::value_type*>\n (x509_time->time.Data),\n x509_time->time.Length);\n \n struct tm time;\n const char* parse_string;\n if (x509_time->timeType == BER_TAG_UTC_TIME)\n parse_string = \"%y%m%d%H%M%SZ\";\n else if (x509_time->timeType == BER_TAG_GENERALIZED_TIME)\n parse_string = \"%y%m%d%H%M%SZ\";\n \/\/ else log?\n \n strptime(time_string.c_str(), parse_string, &time);\n \n Time::Exploded exploded;\n exploded.year = time.tm_year + 1900;\n exploded.month = time.tm_mon + 1;\n exploded.day_of_week = time.tm_wday;\n exploded.day_of_month = time.tm_mday;\n exploded.hour = time.tm_hour;\n exploded.minute = time.tm_min;\n exploded.second = time.tm_sec;\n exploded.millisecond = 0;\n \n *result = Time::FromUTCExploded(exploded);\n }\n }\n}\n\n} \/\/ namespace\n\nvoid X509Certificate::Initialize() {\n const CSSM_X509_NAME* name;\n OSStatus status = SecCertificateGetSubject(cert_handle_, &name);\n if (!status) {\n ParsePrincipal(name, &subject_);\n }\n status = SecCertificateGetIssuer(cert_handle_, &name);\n if (!status) {\n ParsePrincipal(name, &issuer_);\n }\n \n GetCertDateForOID(cert_handle_, CSSMOID_X509V1ValidityNotBefore,\n &valid_start_);\n GetCertDateForOID(cert_handle_, CSSMOID_X509V1ValidityNotAfter,\n &valid_expiry_);\n \n fingerprint_ = CalculateFingerprint(cert_handle_);\n\n \/\/ Store the certificate in the cache in case we need it later.\n X509Certificate::Cache::GetInstance()->Insert(this);\n}\n\n\/\/ static\nX509Certificate* X509Certificate::CreateFromHandle(OSCertHandle cert_handle) {\n DCHECK(cert_handle);\n\n \/\/ Check if we already have this certificate in memory.\n X509Certificate::Cache* cache = X509Certificate::Cache::GetInstance();\n X509Certificate* cert = cache->Find(CalculateFingerprint(cert_handle));\n if (cert) {\n \/\/ We've found a certificate with the same fingerprint in our cache. We own\n \/\/ the |cert_handle|, which makes it our job to free it.\n CFRelease(cert_handle);\n DHISTOGRAM_COUNTS(L\"X509CertificateReuseCount\", 1);\n return cert;\n }\n \/\/ Otherwise, allocate a new object.\n return new X509Certificate(cert_handle);\n}\n\n\/\/ static\nX509Certificate* X509Certificate::CreateFromBytes(const char* data,\n int length) {\n CSSM_DATA cert_data;\n cert_data.Data = const_cast<uint8*>(reinterpret_cast<const uint8*>(data));\n cert_data.Length = length;\n\n OSCertHandle cert_handle = NULL;\n OSStatus status = SecCertificateCreateFromData(&cert_data,\n CSSM_CERT_X_509v3,\n CSSM_CERT_ENCODING_BER,\n &cert_handle);\n if (status)\n return NULL;\n\n return CreateFromHandle(cert_handle);\n}\n\n\/\/ static\nX509Certificate* X509Certificate::CreateFromPickle(const Pickle& pickle,\n void** pickle_iter) {\n const char* data;\n int length;\n if (!pickle.ReadData(pickle_iter, &data, &length))\n return NULL;\n \n return CreateFromBytes(data, length);\n}\n\nX509Certificate::X509Certificate(OSCertHandle cert_handle)\n : cert_handle_(cert_handle) {\n Initialize();\n}\n\nX509Certificate::X509Certificate(std::string subject, std::string issuer,\n Time start_date, Time expiration_date)\n : subject_(subject),\n issuer_(issuer),\n valid_start_(start_date),\n valid_expiry_(expiration_date),\n cert_handle_(NULL) {\n memset(fingerprint_.data, 0, sizeof(fingerprint_.data));\n}\n\nvoid X509Certificate::Persist(Pickle* pickle) {\n CSSM_DATA cert_data;\n OSStatus status = SecCertificateGetData(cert_handle_, &cert_data);\n if (status) {\n NOTREACHED();\n return;\n }\n\n pickle->WriteData(reinterpret_cast<char*>(cert_data.Data), cert_data.Length);\n}\n\nX509Certificate::~X509Certificate() {\n \/\/ We might not be in the cache, but it is safe to remove ourselves anyway.\n X509Certificate::Cache::GetInstance()->Remove(this);\n if (cert_handle_)\n CFRelease(cert_handle_);\n}\n\nvoid X509Certificate::GetDNSNames(std::vector<std::string>* dns_names) const {\n dns_names->clear();\n \n GetCertGeneralNamesForOID(cert_handle_, CSSMOID_SubjectAltName, GNT_DNSName,\n dns_names);\n \n if (dns_names->empty())\n dns_names->push_back(subject_.common_name);\n}\n \n\/\/ Returns true if the certificate is an extended-validation certificate.\n\/\/\n\/\/ The certificate has already been verified by the HTTP library. cert_status\n\/\/ represents the result of that verification. This function performs\n\/\/ additional checks of the certificatePolicies extensions of the certificates\n\/\/ in the certificate chain according to Section 7 (pp. 11-12) of the EV\n\/\/ Certificate Guidelines Version 1.0 at\n\/\/ http:\/\/cabforum.org\/EV_Certificate_Guidelines.pdf.\nbool X509Certificate::IsEV(int cert_status) const {\n \/\/ TODO(avi): implement this\n NOTIMPLEMENTED();\n return false;\n}\n\n} \/\/ namespace net\n<commit_msg>Some quick changes suggested by wtc in review.<commit_after>\/\/ Copyright (c) 2006-2008 The Chromium Authors. All rights reserved.\n\/\/ Use of this source code is governed by a BSD-style license that can be\n\/\/ found in the LICENSE file.\n\n#include \"net\/base\/x509_certificate.h\"\n\n#include <CommonCrypto\/CommonDigest.h>\n#include <time.h>\n\n#include \"base\/histogram.h\"\n#include \"base\/logging.h\"\n#include \"base\/pickle.h\"\n#include \"net\/base\/cert_status_flags.h\"\n#include \"net\/base\/ev_root_ca_metadata.h\"\n\nnamespace net {\n\nnamespace {\n\n\/\/ Calculates the SHA-1 fingerprint of the certificate. Returns an empty\n\/\/ (all zero) fingerprint on failure.\nX509Certificate::Fingerprint CalculateFingerprint(\n X509Certificate::OSCertHandle cert) {\n X509Certificate::Fingerprint sha1;\n memset(sha1.data, 0, sizeof(sha1.data));\n \n CSSM_DATA cert_data;\n OSStatus status = SecCertificateGetData(cert, &cert_data);\n if (status)\n return sha1;\n \n DCHECK(NULL != cert_data.Data);\n DCHECK(0 != cert_data.Length);\n \n CC_SHA1(cert_data.Data, cert_data.Length, sha1.data);\n\n return sha1;\n}\n\ninline bool CSSMOIDEqual(const CSSM_OID* oid1, const CSSM_OID* oid2) {\n return oid1->Length == oid2->Length &&\n (memcmp(oid1->Data, oid2->Data, oid1->Length) == 0);\n}\n\nvoid ParsePrincipal(const CSSM_X509_NAME* name,\n X509Certificate::Principal* principal) {\n std::vector<std::string> common_names, locality_names, state_names,\n country_names;\n\n \/\/ TODO(jcampan): add business_category and serial_number.\n const CSSM_OID* kOIDs[] = { &CSSMOID_CommonName,\n &CSSMOID_LocalityName,\n &CSSMOID_StateProvinceName,\n &CSSMOID_CountryName,\n &CSSMOID_StreetAddress,\n &CSSMOID_OrganizationName,\n &CSSMOID_OrganizationalUnitName,\n &CSSMOID_DNQualifier }; \/\/ This should be \"DC\"\n \/\/ but is undoubtedly\n \/\/ wrong. TODO(avi):\n \/\/ Find the right OID.\n\n std::vector<std::string>* values[] = {\n &common_names, &locality_names,\n &state_names, &country_names,\n &(principal->street_addresses),\n &(principal->organization_names),\n &(principal->organization_unit_names),\n &(principal->domain_components) };\n DCHECK(arraysize(kOIDs) == arraysize(values));\n\n for (size_t rdn = 0; rdn < name->numberOfRDNs; ++rdn) {\n CSSM_X509_RDN rdn_struct = name->RelativeDistinguishedName[rdn];\n for (size_t pair = 0; pair < rdn_struct.numberOfPairs; ++pair) {\n CSSM_X509_TYPE_VALUE_PAIR pair_struct =\n rdn_struct.AttributeTypeAndValue[pair];\n for (size_t oid = 0; oid < arraysize(kOIDs); ++oid) {\n if (CSSMOIDEqual(&pair_struct.type, kOIDs[oid])) {\n std::string value =\n std::string(reinterpret_cast<std::string::value_type*>\n (pair_struct.value.Data),\n pair_struct.value.Length);\n values[oid]->push_back(value);\n break;\n }\n }\n }\n }\n\n \/\/ We don't expect to have more than one CN, L, S, and C.\n std::vector<std::string>* single_value_lists[4] = {\n &common_names, &locality_names, &state_names, &country_names };\n std::string* single_values[4] = {\n &principal->common_name, &principal->locality_name,\n &principal->state_or_province_name, &principal->country_name };\n for (size_t i = 0; i < arraysize(single_value_lists); ++i) {\n DCHECK(single_value_lists[i]->size() <= 1);\n if (single_value_lists[i]->size() > 0)\n *(single_values[i]) = (*(single_value_lists[i]))[0];\n }\n}\n\nOSStatus GetCertFieldsForOID(X509Certificate::OSCertHandle cert_handle,\n CSSM_OID oid, uint32* num_of_fields,\n CSSM_FIELD_PTR* fields) {\n *num_of_fields = 0;\n *fields = NULL;\n \n CSSM_DATA cert_data;\n OSStatus status = SecCertificateGetData(cert_handle, &cert_data);\n if (status)\n return status;\n \n CSSM_CL_HANDLE cl_handle;\n status = SecCertificateGetCLHandle(cert_handle, &cl_handle);\n if (status)\n return status;\n \n status = CSSM_CL_CertGetAllFields(cl_handle, &cert_data, num_of_fields,\n fields);\n return status;\n} \n\nvoid GetCertGeneralNamesForOID(X509Certificate::OSCertHandle cert_handle,\n CSSM_OID oid, CE_GeneralNameType name_type,\n std::vector<std::string>* result) {\n uint32 num_of_fields;\n CSSM_FIELD_PTR fields;\n OSStatus status = GetCertFieldsForOID(cert_handle, oid, &num_of_fields,\n &fields);\n if (status)\n return;\n \n for (size_t field = 0; field < num_of_fields; ++field) {\n if (CSSMOIDEqual(&fields[field].FieldOid, &oid)) {\n CSSM_X509_EXTENSION_PTR cssm_ext =\n (CSSM_X509_EXTENSION_PTR)fields[field].FieldValue.Data;\n CE_GeneralNames* alt_name =\n (CE_GeneralNames*) cssm_ext->value.parsedValue;\n \n for (size_t name = 0; name < alt_name->numNames; ++name) {\n const CE_GeneralName& name_struct = alt_name->generalName[name];\n \/\/ For future extension: We're assuming that these values are of types\n \/\/ GNT_RFC822Name, GNT_DNSName or GNT_URI, all of which are encoded as\n \/\/ IA5String. In general, we should be switching off\n \/\/ |name_struct.nameType| and doing type-appropriate conversions. See\n \/\/ certextensions.h and the comment immediately preceding\n \/\/ CE_GeneralNameType for more information.\n DCHECK(name_struct.nameType == GNT_RFC822Name ||\n name_struct.nameType == GNT_DNSName ||\n name_struct.nameType == GNT_URI);\n if (name_struct.nameType == name_type) {\n const CSSM_DATA& name_data = name_struct.name;\n std::string value =\n std::string(reinterpret_cast<std::string::value_type*>\n (name_data.Data),\n name_data.Length);\n result->push_back(value);\n }\n }\n }\n }\n}\n\nvoid GetCertDateForOID(X509Certificate::OSCertHandle cert_handle,\n CSSM_OID oid, Time* result) {\n *result = Time::Time(); \n \n uint32 num_of_fields;\n CSSM_FIELD_PTR fields;\n OSStatus status = GetCertFieldsForOID(cert_handle, oid, &num_of_fields,\n &fields);\n if (status)\n return;\n \n for (size_t field = 0; field < num_of_fields; ++field) {\n if (CSSMOIDEqual(&fields[field].FieldOid, &oid)) {\n CSSM_X509_TIME* x509_time =\n reinterpret_cast<CSSM_X509_TIME *>(fields[field].FieldValue.Data);\n std::string time_string =\n std::string(reinterpret_cast<std::string::value_type*>\n (x509_time->time.Data),\n x509_time->time.Length);\n \n DCHECK(x509_time->timeType == BER_TAG_UTC_TIME ||\n x509_time->timeType == BER_TAG_GENERALIZED_TIME);\n \n struct tm time;\n const char* parse_string;\n if (x509_time->timeType == BER_TAG_UTC_TIME)\n parse_string = \"%y%m%d%H%M%SZ\";\n else if (x509_time->timeType == BER_TAG_GENERALIZED_TIME)\n parse_string = \"%y%m%d%H%M%SZ\";\n else {\n \/\/ Those are the only two BER tags for time; if neither are used then\n \/\/ this is a rather broken cert.\n return;\n }\n \n strptime(time_string.c_str(), parse_string, &time);\n \n Time::Exploded exploded;\n exploded.year = time.tm_year + 1900;\n exploded.month = time.tm_mon + 1;\n exploded.day_of_week = time.tm_wday;\n exploded.day_of_month = time.tm_mday;\n exploded.hour = time.tm_hour;\n exploded.minute = time.tm_min;\n exploded.second = time.tm_sec;\n exploded.millisecond = 0;\n \n *result = Time::FromUTCExploded(exploded);\n break;\n }\n }\n}\n\n} \/\/ namespace\n\nvoid X509Certificate::Initialize() {\n const CSSM_X509_NAME* name;\n OSStatus status = SecCertificateGetSubject(cert_handle_, &name);\n if (!status) {\n ParsePrincipal(name, &subject_);\n }\n status = SecCertificateGetIssuer(cert_handle_, &name);\n if (!status) {\n ParsePrincipal(name, &issuer_);\n }\n \n GetCertDateForOID(cert_handle_, CSSMOID_X509V1ValidityNotBefore,\n &valid_start_);\n GetCertDateForOID(cert_handle_, CSSMOID_X509V1ValidityNotAfter,\n &valid_expiry_);\n \n fingerprint_ = CalculateFingerprint(cert_handle_);\n\n \/\/ Store the certificate in the cache in case we need it later.\n X509Certificate::Cache::GetInstance()->Insert(this);\n}\n\n\/\/ static\nX509Certificate* X509Certificate::CreateFromHandle(OSCertHandle cert_handle) {\n DCHECK(cert_handle);\n\n \/\/ Check if we already have this certificate in memory.\n X509Certificate::Cache* cache = X509Certificate::Cache::GetInstance();\n X509Certificate* cert = cache->Find(CalculateFingerprint(cert_handle));\n if (cert) {\n \/\/ We've found a certificate with the same fingerprint in our cache. We own\n \/\/ the |cert_handle|, which makes it our job to free it.\n CFRelease(cert_handle);\n DHISTOGRAM_COUNTS(L\"X509CertificateReuseCount\", 1);\n return cert;\n }\n \/\/ Otherwise, allocate a new object.\n return new X509Certificate(cert_handle);\n}\n\n\/\/ static\nX509Certificate* X509Certificate::CreateFromBytes(const char* data,\n int length) {\n CSSM_DATA cert_data;\n cert_data.Data = const_cast<uint8*>(reinterpret_cast<const uint8*>(data));\n cert_data.Length = length;\n\n OSCertHandle cert_handle = NULL;\n OSStatus status = SecCertificateCreateFromData(&cert_data,\n CSSM_CERT_X_509v3,\n CSSM_CERT_ENCODING_BER,\n &cert_handle);\n if (status)\n return NULL;\n\n return CreateFromHandle(cert_handle);\n}\n\n\/\/ static\nX509Certificate* X509Certificate::CreateFromPickle(const Pickle& pickle,\n void** pickle_iter) {\n const char* data;\n int length;\n if (!pickle.ReadData(pickle_iter, &data, &length))\n return NULL;\n \n return CreateFromBytes(data, length);\n}\n\nX509Certificate::X509Certificate(OSCertHandle cert_handle)\n : cert_handle_(cert_handle) {\n Initialize();\n}\n\nX509Certificate::X509Certificate(std::string subject, std::string issuer,\n Time start_date, Time expiration_date)\n : subject_(subject),\n issuer_(issuer),\n valid_start_(start_date),\n valid_expiry_(expiration_date),\n cert_handle_(NULL) {\n memset(fingerprint_.data, 0, sizeof(fingerprint_.data));\n}\n\nvoid X509Certificate::Persist(Pickle* pickle) {\n CSSM_DATA cert_data;\n OSStatus status = SecCertificateGetData(cert_handle_, &cert_data);\n if (status) {\n NOTREACHED();\n return;\n }\n\n pickle->WriteData(reinterpret_cast<char*>(cert_data.Data), cert_data.Length);\n}\n\nX509Certificate::~X509Certificate() {\n \/\/ We might not be in the cache, but it is safe to remove ourselves anyway.\n X509Certificate::Cache::GetInstance()->Remove(this);\n if (cert_handle_)\n CFRelease(cert_handle_);\n}\n\nvoid X509Certificate::GetDNSNames(std::vector<std::string>* dns_names) const {\n dns_names->clear();\n \n GetCertGeneralNamesForOID(cert_handle_, CSSMOID_SubjectAltName, GNT_DNSName,\n dns_names);\n \n if (dns_names->empty())\n dns_names->push_back(subject_.common_name);\n}\n \n\/\/ Returns true if the certificate is an extended-validation certificate.\n\/\/\n\/\/ The certificate has already been verified by the HTTP library. cert_status\n\/\/ represents the result of that verification. This function performs\n\/\/ additional checks of the certificatePolicies extensions of the certificates\n\/\/ in the certificate chain according to Section 7 (pp. 11-12) of the EV\n\/\/ Certificate Guidelines Version 1.0 at\n\/\/ http:\/\/cabforum.org\/EV_Certificate_Guidelines.pdf.\nbool X509Certificate::IsEV(int cert_status) const {\n \/\/ TODO(avi): implement this\n NOTIMPLEMENTED();\n return false;\n}\n\n} \/\/ namespace net\n<|endoftext|>"} {"text":"<commit_before>\/\/ Copyright (c) 2006-2008 The Chromium Authors. All rights reserved.\n\/\/ Use of this source code is governed by a BSD-style license that can be\n\/\/ found in the LICENSE file.\n\n#include \"net\/base\/x509_certificate.h\"\n\n\/\/ Work around https:\/\/bugzilla.mozilla.org\/show_bug.cgi?id=455424\n\/\/ until NSS 3.12.2 comes out and we update to it.\n#define Lock FOO_NSS_Lock\n#include <cert.h>\n#include <prtime.h>\n#include <secder.h>\n#include <sechash.h>\n#undef Lock\n\n#include \"base\/logging.h\"\n#include \"base\/pickle.h\"\n#include \"base\/time.h\"\n#include \"base\/nss_init.h\"\n#include \"net\/base\/net_errors.h\"\n\nnamespace net {\n\nnamespace {\n\n\/\/ TODO(port): Implement this more simply, and put it in the right place\nbase::Time PRTimeToBaseTime(PRTime prtime) {\n PRExplodedTime prxtime;\n PR_ExplodeTime(prtime, PR_GMTParameters, &prxtime);\n\n base::Time::Exploded exploded;\n exploded.year = prxtime.tm_year;\n exploded.month = prxtime.tm_month + 1;\n exploded.day_of_week = prxtime.tm_wday;\n exploded.day_of_month = prxtime.tm_mday;\n exploded.hour = prxtime.tm_hour;\n exploded.minute = prxtime.tm_min;\n exploded.second = prxtime.tm_sec;\n exploded.millisecond = prxtime.tm_usec \/ 1000;\n\n return base::Time::FromUTCExploded(exploded);\n}\n\nvoid ParsePrincipal(SECItem* der_name,\n X509Certificate::Principal* principal) {\n\n CERTName name;\n PRArenaPool* arena = NULL;\n\n arena = PORT_NewArena(DER_DEFAULT_CHUNKSIZE);\n DCHECK(arena != NULL);\n if (arena == NULL)\n return;\n\n \/\/ TODO(dkegel): is CERT_NameTemplate what we always want here?\n SECStatus rv;\n rv = SEC_QuickDERDecodeItem(arena, &name, CERT_NameTemplate, der_name);\n DCHECK(rv == SECSuccess);\n if ( rv != SECSuccess ) {\n PORT_FreeArena(arena, PR_FALSE);\n return;\n }\n\n std::vector<std::string> common_names, locality_names, state_names,\n country_names;\n\n \/\/ TODO(jcampan): add business_category and serial_number.\n static const SECOidTag kOIDs[] = {\n SEC_OID_AVA_COMMON_NAME,\n SEC_OID_AVA_LOCALITY,\n SEC_OID_AVA_STATE_OR_PROVINCE,\n SEC_OID_AVA_COUNTRY_NAME,\n SEC_OID_AVA_STREET_ADDRESS,\n SEC_OID_AVA_ORGANIZATION_NAME,\n SEC_OID_AVA_ORGANIZATIONAL_UNIT_NAME,\n SEC_OID_AVA_DC };\n\n std::vector<std::string>* values[] = {\n &common_names, &locality_names,\n &state_names, &country_names,\n &principal->street_addresses,\n &principal->organization_names,\n &principal->organization_unit_names,\n &principal->domain_components };\n DCHECK(arraysize(kOIDs) == arraysize(values));\n\n CERTRDN** rdns = name.rdns;\n for (size_t rdn = 0; rdns[rdn]; ++rdn) {\n CERTAVA** avas = rdns[rdn]->avas;\n for (size_t pair = 0; avas[pair] != 0; ++pair) {\n SECOidTag tag = CERT_GetAVATag(avas[pair]);\n for (size_t oid = 0; oid < arraysize(kOIDs); ++oid) {\n if (kOIDs[oid] == tag) {\n SECItem* decode_item = CERT_DecodeAVAValue(&avas[pair]->value);\n if (!decode_item)\n break;\n std::string value(reinterpret_cast<char*>(decode_item->data),\n decode_item->len);\n values[oid]->push_back(value);\n SECITEM_FreeItem(decode_item, PR_TRUE);\n break;\n }\n }\n }\n }\n\n \/\/ We don't expect to have more than one CN, L, S, and C.\n std::vector<std::string>* single_value_lists[4] = {\n &common_names, &locality_names, &state_names, &country_names };\n std::string* single_values[4] = {\n &principal->common_name, &principal->locality_name,\n &principal->state_or_province_name, &principal->country_name };\n for (size_t i = 0; i < arraysize(single_value_lists); ++i) {\n DCHECK(single_value_lists[i]->size() <= 1);\n if (single_value_lists[i]->size() > 0)\n *(single_values[i]) = (*(single_value_lists[i]))[0];\n }\n PORT_FreeArena(arena, PR_FALSE);\n}\n\nvoid ParseDate(SECItem* der_date, base::Time* result) {\n PRTime prtime;\n SECStatus rv = DER_DecodeTimeChoice(&prtime, der_date);\n DCHECK(rv == SECSuccess);\n *result = PRTimeToBaseTime(prtime);\n}\n\nvoid GetCertSubjectAltNamesOfType(X509Certificate::OSCertHandle cert_handle,\n CERTGeneralNameType name_type,\n std::vector<std::string>* result) {\n\n SECItem alt_name;\n SECStatus rv = CERT_FindCertExtension(cert_handle,\n SEC_OID_X509_SUBJECT_ALT_NAME, &alt_name);\n if (rv != SECSuccess)\n return;\n\n PRArenaPool* arena = PORT_NewArena(DER_DEFAULT_CHUNKSIZE);\n DCHECK(arena != NULL);\n\n CERTGeneralName* alt_name_list;\n alt_name_list = CERT_DecodeAltNameExtension(arena, &alt_name);\n\n CERTGeneralName* name = alt_name_list;\n while (name) {\n \/\/ For future extension: We're assuming that these values are of types\n \/\/ RFC822Name, DNSName or URI. See the mac code for notes.\n DCHECK(name->type == certRFC822Name ||\n name->type == certDNSName ||\n name->type == certURI);\n if (name->type == name_type) {\n unsigned char* p = name->name.other.data;\n int len = name->name.other.len;\n std::string value = std::string(reinterpret_cast<char*>(p), len);\n result->push_back(value);\n }\n name = CERT_GetNextGeneralName(name);\n if (name == alt_name_list)\n break;\n }\n PORT_FreeArena(arena, PR_FALSE);\n PORT_Free(alt_name.data);\n}\n\n} \/\/ namespace\n\nvoid X509Certificate::Initialize() {\n ParsePrincipal(&cert_handle_->derSubject, &subject_);\n ParsePrincipal(&cert_handle_->derIssuer, &issuer_);\n\n ParseDate(&cert_handle_->validity.notBefore, &valid_start_);\n ParseDate(&cert_handle_->validity.notAfter, &valid_expiry_);\n\n fingerprint_ = CalculateFingerprint(cert_handle_);\n\n \/\/ Store the certificate in the cache in case we need it later.\n X509Certificate::Cache::GetInstance()->Insert(this);\n}\n\n\/\/ static\nX509Certificate* X509Certificate::CreateFromPickle(const Pickle& pickle,\n void** pickle_iter) {\n const char* data;\n int length;\n if (!pickle.ReadData(pickle_iter, &data, &length))\n return NULL;\n\n return CreateFromBytes(data, length);\n}\n\nvoid X509Certificate::Persist(Pickle* pickle) {\n pickle->WriteData(reinterpret_cast<const char*>(cert_handle_->derCert.data),\n cert_handle_->derCert.len);\n}\n\nvoid X509Certificate::GetDNSNames(std::vector<std::string>* dns_names) const {\n dns_names->clear();\n\n \/\/ Compare with CERT_VerifyCertName().\n GetCertSubjectAltNamesOfType(cert_handle_, certDNSName, dns_names);\n\n \/\/ TODO(port): suppress nss's support of the obsolete extension\n \/\/ SEC_OID_NS_CERT_EXT_SSL_SERVER_NAME\n \/\/ by providing our own authCertificate callback.\n\n if (dns_names->empty())\n dns_names->push_back(subject_.common_name);\n}\n\nbool X509Certificate::HasExpired() const {\n NOTIMPLEMENTED();\n return false;\n}\n\nint X509Certificate::Verify(const std::string& hostname,\n bool rev_checking_enabled,\n CertVerifyResult* verify_result) const {\n NOTIMPLEMENTED();\n return ERR_NOT_IMPLEMENTED;\n}\n\n\/\/ static\nX509Certificate::OSCertHandle X509Certificate::CreateOSCertHandleFromBytes(\n const char* data, int length) {\n base::EnsureNSSInit();\n\n SECItem der_cert;\n der_cert.data = reinterpret_cast<unsigned char*>(const_cast<char*>(data));\n der_cert.len = length;\n return CERT_NewTempCertificate(CERT_GetDefaultCertDB(), &der_cert,\n NULL, PR_FALSE, PR_TRUE);\n}\n\n\/\/ static\nvoid X509Certificate::FreeOSCertHandle(OSCertHandle cert_handle) {\n CERT_DestroyCertificate(cert_handle);\n}\n\n\/\/ static\nX509Certificate::Fingerprint X509Certificate::CalculateFingerprint(\n OSCertHandle cert) {\n Fingerprint sha1;\n memset(sha1.data, 0, sizeof(sha1.data));\n\n DCHECK(NULL != cert->derCert.data);\n DCHECK(0 != cert->derCert.len);\n\n SECStatus rv = HASH_HashBuf(HASH_AlgSHA1, sha1.data,\n cert->derCert.data, cert->derCert.len);\n DCHECK(rv == SECSuccess);\n\n return sha1;\n}\n\n\/\/ TODO(port): Implement properly on Linux.\nbool X509Certificate::IsEV(int status) const {\n NOTIMPLEMENTED();\n return false;\n}\n\n} \/\/ namespace net\n<commit_msg>Remove another NOTIMPLEMENTED<commit_after>\/\/ Copyright (c) 2006-2008 The Chromium Authors. All rights reserved.\n\/\/ Use of this source code is governed by a BSD-style license that can be\n\/\/ found in the LICENSE file.\n\n#include \"net\/base\/x509_certificate.h\"\n\n\/\/ Work around https:\/\/bugzilla.mozilla.org\/show_bug.cgi?id=455424\n\/\/ until NSS 3.12.2 comes out and we update to it.\n#define Lock FOO_NSS_Lock\n#include <cert.h>\n#include <prtime.h>\n#include <secder.h>\n#include <sechash.h>\n#undef Lock\n\n#include \"base\/logging.h\"\n#include \"base\/pickle.h\"\n#include \"base\/time.h\"\n#include \"base\/nss_init.h\"\n#include \"net\/base\/net_errors.h\"\n\nnamespace net {\n\nnamespace {\n\n\/\/ TODO(port): Implement this more simply, and put it in the right place\nbase::Time PRTimeToBaseTime(PRTime prtime) {\n PRExplodedTime prxtime;\n PR_ExplodeTime(prtime, PR_GMTParameters, &prxtime);\n\n base::Time::Exploded exploded;\n exploded.year = prxtime.tm_year;\n exploded.month = prxtime.tm_month + 1;\n exploded.day_of_week = prxtime.tm_wday;\n exploded.day_of_month = prxtime.tm_mday;\n exploded.hour = prxtime.tm_hour;\n exploded.minute = prxtime.tm_min;\n exploded.second = prxtime.tm_sec;\n exploded.millisecond = prxtime.tm_usec \/ 1000;\n\n return base::Time::FromUTCExploded(exploded);\n}\n\nvoid ParsePrincipal(SECItem* der_name,\n X509Certificate::Principal* principal) {\n\n CERTName name;\n PRArenaPool* arena = NULL;\n\n arena = PORT_NewArena(DER_DEFAULT_CHUNKSIZE);\n DCHECK(arena != NULL);\n if (arena == NULL)\n return;\n\n \/\/ TODO(dkegel): is CERT_NameTemplate what we always want here?\n SECStatus rv;\n rv = SEC_QuickDERDecodeItem(arena, &name, CERT_NameTemplate, der_name);\n DCHECK(rv == SECSuccess);\n if ( rv != SECSuccess ) {\n PORT_FreeArena(arena, PR_FALSE);\n return;\n }\n\n std::vector<std::string> common_names, locality_names, state_names,\n country_names;\n\n \/\/ TODO(jcampan): add business_category and serial_number.\n static const SECOidTag kOIDs[] = {\n SEC_OID_AVA_COMMON_NAME,\n SEC_OID_AVA_LOCALITY,\n SEC_OID_AVA_STATE_OR_PROVINCE,\n SEC_OID_AVA_COUNTRY_NAME,\n SEC_OID_AVA_STREET_ADDRESS,\n SEC_OID_AVA_ORGANIZATION_NAME,\n SEC_OID_AVA_ORGANIZATIONAL_UNIT_NAME,\n SEC_OID_AVA_DC };\n\n std::vector<std::string>* values[] = {\n &common_names, &locality_names,\n &state_names, &country_names,\n &principal->street_addresses,\n &principal->organization_names,\n &principal->organization_unit_names,\n &principal->domain_components };\n DCHECK(arraysize(kOIDs) == arraysize(values));\n\n CERTRDN** rdns = name.rdns;\n for (size_t rdn = 0; rdns[rdn]; ++rdn) {\n CERTAVA** avas = rdns[rdn]->avas;\n for (size_t pair = 0; avas[pair] != 0; ++pair) {\n SECOidTag tag = CERT_GetAVATag(avas[pair]);\n for (size_t oid = 0; oid < arraysize(kOIDs); ++oid) {\n if (kOIDs[oid] == tag) {\n SECItem* decode_item = CERT_DecodeAVAValue(&avas[pair]->value);\n if (!decode_item)\n break;\n std::string value(reinterpret_cast<char*>(decode_item->data),\n decode_item->len);\n values[oid]->push_back(value);\n SECITEM_FreeItem(decode_item, PR_TRUE);\n break;\n }\n }\n }\n }\n\n \/\/ We don't expect to have more than one CN, L, S, and C.\n std::vector<std::string>* single_value_lists[4] = {\n &common_names, &locality_names, &state_names, &country_names };\n std::string* single_values[4] = {\n &principal->common_name, &principal->locality_name,\n &principal->state_or_province_name, &principal->country_name };\n for (size_t i = 0; i < arraysize(single_value_lists); ++i) {\n DCHECK(single_value_lists[i]->size() <= 1);\n if (single_value_lists[i]->size() > 0)\n *(single_values[i]) = (*(single_value_lists[i]))[0];\n }\n PORT_FreeArena(arena, PR_FALSE);\n}\n\nvoid ParseDate(SECItem* der_date, base::Time* result) {\n PRTime prtime;\n SECStatus rv = DER_DecodeTimeChoice(&prtime, der_date);\n DCHECK(rv == SECSuccess);\n *result = PRTimeToBaseTime(prtime);\n}\n\nvoid GetCertSubjectAltNamesOfType(X509Certificate::OSCertHandle cert_handle,\n CERTGeneralNameType name_type,\n std::vector<std::string>* result) {\n\n SECItem alt_name;\n SECStatus rv = CERT_FindCertExtension(cert_handle,\n SEC_OID_X509_SUBJECT_ALT_NAME, &alt_name);\n if (rv != SECSuccess)\n return;\n\n PRArenaPool* arena = PORT_NewArena(DER_DEFAULT_CHUNKSIZE);\n DCHECK(arena != NULL);\n\n CERTGeneralName* alt_name_list;\n alt_name_list = CERT_DecodeAltNameExtension(arena, &alt_name);\n\n CERTGeneralName* name = alt_name_list;\n while (name) {\n \/\/ For future extension: We're assuming that these values are of types\n \/\/ RFC822Name, DNSName or URI. See the mac code for notes.\n DCHECK(name->type == certRFC822Name ||\n name->type == certDNSName ||\n name->type == certURI);\n if (name->type == name_type) {\n unsigned char* p = name->name.other.data;\n int len = name->name.other.len;\n std::string value = std::string(reinterpret_cast<char*>(p), len);\n result->push_back(value);\n }\n name = CERT_GetNextGeneralName(name);\n if (name == alt_name_list)\n break;\n }\n PORT_FreeArena(arena, PR_FALSE);\n PORT_Free(alt_name.data);\n}\n\n} \/\/ namespace\n\nvoid X509Certificate::Initialize() {\n ParsePrincipal(&cert_handle_->derSubject, &subject_);\n ParsePrincipal(&cert_handle_->derIssuer, &issuer_);\n\n ParseDate(&cert_handle_->validity.notBefore, &valid_start_);\n ParseDate(&cert_handle_->validity.notAfter, &valid_expiry_);\n\n fingerprint_ = CalculateFingerprint(cert_handle_);\n\n \/\/ Store the certificate in the cache in case we need it later.\n X509Certificate::Cache::GetInstance()->Insert(this);\n}\n\n\/\/ static\nX509Certificate* X509Certificate::CreateFromPickle(const Pickle& pickle,\n void** pickle_iter) {\n const char* data;\n int length;\n if (!pickle.ReadData(pickle_iter, &data, &length))\n return NULL;\n\n return CreateFromBytes(data, length);\n}\n\nvoid X509Certificate::Persist(Pickle* pickle) {\n pickle->WriteData(reinterpret_cast<const char*>(cert_handle_->derCert.data),\n cert_handle_->derCert.len);\n}\n\nvoid X509Certificate::GetDNSNames(std::vector<std::string>* dns_names) const {\n dns_names->clear();\n\n \/\/ Compare with CERT_VerifyCertName().\n GetCertSubjectAltNamesOfType(cert_handle_, certDNSName, dns_names);\n\n \/\/ TODO(port): suppress nss's support of the obsolete extension\n \/\/ SEC_OID_NS_CERT_EXT_SSL_SERVER_NAME\n \/\/ by providing our own authCertificate callback.\n\n if (dns_names->empty())\n dns_names->push_back(subject_.common_name);\n}\n\nbool X509Certificate::HasExpired() const {\n NOTIMPLEMENTED();\n return false;\n}\n\nint X509Certificate::Verify(const std::string& hostname,\n bool rev_checking_enabled,\n CertVerifyResult* verify_result) const {\n NOTIMPLEMENTED();\n return ERR_NOT_IMPLEMENTED;\n}\n\n\/\/ static\nX509Certificate::OSCertHandle X509Certificate::CreateOSCertHandleFromBytes(\n const char* data, int length) {\n base::EnsureNSSInit();\n\n SECItem der_cert;\n der_cert.data = reinterpret_cast<unsigned char*>(const_cast<char*>(data));\n der_cert.len = length;\n return CERT_NewTempCertificate(CERT_GetDefaultCertDB(), &der_cert,\n NULL, PR_FALSE, PR_TRUE);\n}\n\n\/\/ static\nvoid X509Certificate::FreeOSCertHandle(OSCertHandle cert_handle) {\n CERT_DestroyCertificate(cert_handle);\n}\n\n\/\/ static\nX509Certificate::Fingerprint X509Certificate::CalculateFingerprint(\n OSCertHandle cert) {\n Fingerprint sha1;\n memset(sha1.data, 0, sizeof(sha1.data));\n\n DCHECK(NULL != cert->derCert.data);\n DCHECK(0 != cert->derCert.len);\n\n SECStatus rv = HASH_HashBuf(HASH_AlgSHA1, sha1.data,\n cert->derCert.data, cert->derCert.len);\n DCHECK(rv == SECSuccess);\n\n return sha1;\n}\n\n\/\/ TODO(port): Implement properly on Linux.\nbool X509Certificate::IsEV(int status) const {\n \/\/ http:\/\/code.google.com\/p\/chromium\/issues\/detail?id=10911\n return false;\n}\n\n} \/\/ namespace net\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 \"net\/http\/http_network_session.h\"\n\n#include <utility>\n\n#include \"base\/logging.h\"\n#include \"base\/stl_util-inl.h\"\n#include \"base\/string_util.h\"\n#include \"net\/http\/http_auth_handler_factory.h\"\n#include \"net\/http\/url_security_manager.h\"\n#include \"net\/spdy\/spdy_session_pool.h\"\n\nnamespace net {\n\nnamespace {\n\n\/\/ Total limit of sockets.\nint g_max_sockets = 256;\n\n\/\/ Default to allow up to 6 connections per host. Experiment and tuning may\n\/\/ try other values (greater than 0). Too large may cause many problems, such\n\/\/ as home routers blocking the connections!?!? See http:\/\/crbug.com\/12066.\nint g_max_sockets_per_group = 6;\n\n\/\/ The max number of sockets to allow per proxy server. This applies both to\n\/\/ http and SOCKS proxies. See http:\/\/crbug.com\/12066 for details about proxy\n\/\/ server connection limits.\nint g_max_sockets_per_proxy_server = 15;\n\nuint16 g_fixed_http_port = 0;\nuint16 g_fixed_https_port = 0;\n\n} \/\/ namespace\n\nHttpNetworkSession::HttpNetworkSession(\n NetworkChangeNotifier* network_change_notifier,\n HostResolver* host_resolver,\n ProxyService* proxy_service,\n ClientSocketFactory* client_socket_factory,\n SSLConfigService* ssl_config_service,\n SpdySessionPool* spdy_session_pool,\n HttpAuthHandlerFactory* http_auth_handler_factory)\n : network_change_notifier_(network_change_notifier),\n \/\/ TODO(vandebo) when we've completely converted to pools, the base TCP\n \/\/ pool name should get changed to TCP instead of Transport.\n tcp_pool_histograms_(new ClientSocketPoolHistograms(\"Transport\")),\n http_proxy_pool_histograms_(new ClientSocketPoolHistograms(\"HTTPProxy\")),\n tcp_for_socks_pool_histograms_(\n new ClientSocketPoolHistograms(\"TCPforSOCKS\")),\n socks_pool_histograms_(new ClientSocketPoolHistograms(\"SOCK\")),\n tcp_socket_pool_(new TCPClientSocketPool(\n g_max_sockets, g_max_sockets_per_group, tcp_pool_histograms_,\n host_resolver, client_socket_factory, network_change_notifier_)),\n socket_factory_(client_socket_factory),\n host_resolver_(host_resolver),\n proxy_service_(proxy_service),\n ssl_config_service_(ssl_config_service),\n spdy_session_pool_(spdy_session_pool),\n http_auth_handler_factory_(http_auth_handler_factory) {\n DCHECK(proxy_service);\n DCHECK(ssl_config_service);\n}\n\nHttpNetworkSession::~HttpNetworkSession() {\n}\n\nconst scoped_refptr<TCPClientSocketPool>&\nHttpNetworkSession::GetSocketPoolForHTTPProxy(const HostPortPair& http_proxy) {\n HTTPProxySocketPoolMap::const_iterator it =\n http_proxy_socket_pool_.find(http_proxy);\n if (it != http_proxy_socket_pool_.end())\n return it->second;\n\n std::pair<HTTPProxySocketPoolMap::iterator, bool> ret =\n http_proxy_socket_pool_.insert(\n std::make_pair(\n http_proxy,\n new TCPClientSocketPool(\n g_max_sockets_per_proxy_server, g_max_sockets_per_group,\n http_proxy_pool_histograms_, host_resolver_, socket_factory_,\n network_change_notifier_)));\n\n return ret.first->second;\n}\n\nconst scoped_refptr<SOCKSClientSocketPool>&\nHttpNetworkSession::GetSocketPoolForSOCKSProxy(\n const HostPortPair& socks_proxy) {\n SOCKSSocketPoolMap::const_iterator it = socks_socket_pool_.find(socks_proxy);\n if (it != socks_socket_pool_.end())\n return it->second;\n\n std::pair<SOCKSSocketPoolMap::iterator, bool> ret =\n socks_socket_pool_.insert(\n std::make_pair(\n socks_proxy,\n new SOCKSClientSocketPool(\n g_max_sockets_per_proxy_server, g_max_sockets_per_group,\n socks_pool_histograms_, host_resolver_,\n new TCPClientSocketPool(g_max_sockets_per_proxy_server,\n g_max_sockets_per_group,\n tcp_for_socks_pool_histograms_,\n host_resolver_, socket_factory_,\n network_change_notifier_),\n network_change_notifier_)));\n\n return ret.first->second;\n}\n\n\/\/ static\nvoid HttpNetworkSession::set_max_sockets_per_group(int socket_count) {\n DCHECK_LT(0, socket_count);\n \/\/ The following is a sanity check... but we should NEVER be near this value.\n DCHECK_GT(100, socket_count);\n g_max_sockets_per_group = socket_count;\n}\n\n\/\/ static\nuint16 HttpNetworkSession::fixed_http_port() {\n return g_fixed_http_port;\n}\n\n\/\/ static\nvoid HttpNetworkSession::set_fixed_http_port(uint16 port) {\n g_fixed_http_port = port;\n}\n\n\/\/ static\nuint16 HttpNetworkSession::fixed_https_port() {\n return g_fixed_https_port;\n}\n\n\/\/ static\nvoid HttpNetworkSession::set_fixed_https_port(uint16 port) {\n g_fixed_https_port = port;\n}\n\nvoid HttpNetworkSession::ReplaceTCPSocketPool() {\n tcp_socket_pool_ = new TCPClientSocketPool(g_max_sockets,\n g_max_sockets_per_group,\n tcp_pool_histograms_,\n host_resolver_,\n socket_factory_,\n network_change_notifier_);\n}\n\n} \/\/ namespace net\n<commit_msg>Increase the socket limit for proxy servers to 32. BUG=44501<commit_after>\/\/ Copyright (c) 2010 The Chromium Authors. All rights reserved.\n\/\/ Use of this source code is governed by a BSD-style license that can be\n\/\/ found in the LICENSE file.\n\n#include \"net\/http\/http_network_session.h\"\n\n#include <utility>\n\n#include \"base\/logging.h\"\n#include \"base\/stl_util-inl.h\"\n#include \"base\/string_util.h\"\n#include \"net\/http\/http_auth_handler_factory.h\"\n#include \"net\/http\/url_security_manager.h\"\n#include \"net\/spdy\/spdy_session_pool.h\"\n\nnamespace net {\n\nnamespace {\n\n\/\/ Total limit of sockets.\nint g_max_sockets = 256;\n\n\/\/ Default to allow up to 6 connections per host. Experiment and tuning may\n\/\/ try other values (greater than 0). Too large may cause many problems, such\n\/\/ as home routers blocking the connections!?!? See http:\/\/crbug.com\/12066.\nint g_max_sockets_per_group = 6;\n\n\/\/ The max number of sockets to allow per proxy server. This applies both to\n\/\/ http and SOCKS proxies. See http:\/\/crbug.com\/12066 and\n\/\/ http:\/\/crbug.com\/44501 for details about proxy server connection limits.\nint g_max_sockets_per_proxy_server = 32;\n\nuint16 g_fixed_http_port = 0;\nuint16 g_fixed_https_port = 0;\n\n} \/\/ namespace\n\nHttpNetworkSession::HttpNetworkSession(\n NetworkChangeNotifier* network_change_notifier,\n HostResolver* host_resolver,\n ProxyService* proxy_service,\n ClientSocketFactory* client_socket_factory,\n SSLConfigService* ssl_config_service,\n SpdySessionPool* spdy_session_pool,\n HttpAuthHandlerFactory* http_auth_handler_factory)\n : network_change_notifier_(network_change_notifier),\n \/\/ TODO(vandebo) when we've completely converted to pools, the base TCP\n \/\/ pool name should get changed to TCP instead of Transport.\n tcp_pool_histograms_(new ClientSocketPoolHistograms(\"Transport\")),\n http_proxy_pool_histograms_(new ClientSocketPoolHistograms(\"HTTPProxy\")),\n tcp_for_socks_pool_histograms_(\n new ClientSocketPoolHistograms(\"TCPforSOCKS\")),\n socks_pool_histograms_(new ClientSocketPoolHistograms(\"SOCK\")),\n tcp_socket_pool_(new TCPClientSocketPool(\n g_max_sockets, g_max_sockets_per_group, tcp_pool_histograms_,\n host_resolver, client_socket_factory, network_change_notifier_)),\n socket_factory_(client_socket_factory),\n host_resolver_(host_resolver),\n proxy_service_(proxy_service),\n ssl_config_service_(ssl_config_service),\n spdy_session_pool_(spdy_session_pool),\n http_auth_handler_factory_(http_auth_handler_factory) {\n DCHECK(proxy_service);\n DCHECK(ssl_config_service);\n}\n\nHttpNetworkSession::~HttpNetworkSession() {\n}\n\nconst scoped_refptr<TCPClientSocketPool>&\nHttpNetworkSession::GetSocketPoolForHTTPProxy(const HostPortPair& http_proxy) {\n HTTPProxySocketPoolMap::const_iterator it =\n http_proxy_socket_pool_.find(http_proxy);\n if (it != http_proxy_socket_pool_.end())\n return it->second;\n\n std::pair<HTTPProxySocketPoolMap::iterator, bool> ret =\n http_proxy_socket_pool_.insert(\n std::make_pair(\n http_proxy,\n new TCPClientSocketPool(\n g_max_sockets_per_proxy_server, g_max_sockets_per_group,\n http_proxy_pool_histograms_, host_resolver_, socket_factory_,\n network_change_notifier_)));\n\n return ret.first->second;\n}\n\nconst scoped_refptr<SOCKSClientSocketPool>&\nHttpNetworkSession::GetSocketPoolForSOCKSProxy(\n const HostPortPair& socks_proxy) {\n SOCKSSocketPoolMap::const_iterator it = socks_socket_pool_.find(socks_proxy);\n if (it != socks_socket_pool_.end())\n return it->second;\n\n std::pair<SOCKSSocketPoolMap::iterator, bool> ret =\n socks_socket_pool_.insert(\n std::make_pair(\n socks_proxy,\n new SOCKSClientSocketPool(\n g_max_sockets_per_proxy_server, g_max_sockets_per_group,\n socks_pool_histograms_, host_resolver_,\n new TCPClientSocketPool(g_max_sockets_per_proxy_server,\n g_max_sockets_per_group,\n tcp_for_socks_pool_histograms_,\n host_resolver_, socket_factory_,\n network_change_notifier_),\n network_change_notifier_)));\n\n return ret.first->second;\n}\n\n\/\/ static\nvoid HttpNetworkSession::set_max_sockets_per_group(int socket_count) {\n DCHECK_LT(0, socket_count);\n \/\/ The following is a sanity check... but we should NEVER be near this value.\n DCHECK_GT(100, socket_count);\n g_max_sockets_per_group = socket_count;\n}\n\n\/\/ static\nuint16 HttpNetworkSession::fixed_http_port() {\n return g_fixed_http_port;\n}\n\n\/\/ static\nvoid HttpNetworkSession::set_fixed_http_port(uint16 port) {\n g_fixed_http_port = port;\n}\n\n\/\/ static\nuint16 HttpNetworkSession::fixed_https_port() {\n return g_fixed_https_port;\n}\n\n\/\/ static\nvoid HttpNetworkSession::set_fixed_https_port(uint16 port) {\n g_fixed_https_port = port;\n}\n\nvoid HttpNetworkSession::ReplaceTCPSocketPool() {\n tcp_socket_pool_ = new TCPClientSocketPool(g_max_sockets,\n g_max_sockets_per_group,\n tcp_pool_histograms_,\n host_resolver_,\n socket_factory_,\n network_change_notifier_);\n}\n\n} \/\/ namespace net\n<|endoftext|>"} {"text":"<commit_before>\/*\n\tCopyright (C) 2015 Claude SIMON (http:\/\/q37.info\/contact\/).\n\n\tThis file is part of dmnzq.\n\n dmnzq is free software: you can redistribute it and\/or\n\tmodify it 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 dmnzq is distributed in the hope that it will be useful,\n but WITHOUT ANY WARRANTY; without even the implied warranty of\n MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU\n\tAffero General Public License for more details.\n\n You should have received a copy of the GNU Affero General Public License\n along with dmnzq. If not, see <http:\/\/www.gnu.org\/licenses\/>\n*\/\n\n#include \"registry.h\"\n\n#include \"scltool.h\"\n#include \"sclerror.h\"\n\n#include \"csdlec.h\"\n#include \"csdbns.h\"\n#include \"csdsns.h\"\n\n#include \"err.h\"\n#include \"cio.h\"\n#include \"epsmsc.h\"\n#include \"xpp.h\"\n#include \"fnm.h\"\n#include \"flf.h\"\n\nusing cio::CErr;\nusing cio::COut;\nusing cio::CIn;\n\n# define NAME_MC\t\t\t\"dmnzq\"\n# define NAME_LC\t\t\t\"dmnzq\"\n# define NAME_UC\t\t\t\"DMNZQ\"\n# define WEBSITE_URL\t\t\"http:\/\/q37.info\/\"\n# define AUTHOR_NAME\t\t\"Claude SIMON\"\n# define AUTHOR_CONTACT\t\t\"http:\/\/q37.info\/contact\/\"\n# define OWNER_NAME\t\t\t\"Claude SIMON\"\n# define OWNER_CONTACT\t\t\"http:\/\/q37.info\/contact\/\"\n# define COPYRIGHT\t\t\tCOPYRIGHT_YEARS \" \" OWNER_NAME \" (\" OWNER_CONTACT \")\"\t\n\nstatic void PrintHeader_( void )\n{\n\tCOut << NAME_MC \" V\" VERSION << \" (\" WEBSITE_URL \")\" << txf::nl;\n\tCOut << \"Copyright (C) \" COPYRIGHT << txf::nl;\n\tCOut << txf::pad << \"Build : \" __DATE__ \" \" __TIME__ << \" (\" << cpe::GetDescription() << ')' << txf::nl;\n}\n\n#define C( name )\\\n\telse if ( Command == #name )\\\n\t\tname##_()\n\nnamespace {\n\tcsdlec::library_embedded_client_core__ *Core_ = NULL;\n\n\tvoid ExitFunction_( void )\n\t{\n\tqRH\n\t\tstr::string Message;\n\tqRB\n\t\tif ( Core_ != NULL ) {\n\t\t\tMessage.Init();\n\t\t\tCOut << sclmisc::GetBaseTranslation( \"TerminatingModule\", Message ) << txf::nl << txf::commit;\n\t\t\tdelete Core_;\n\t\t\tCOut << sclmisc::GetBaseTranslation( \"ModuleTerminated\", Message ) << txf::nl << txf::commit;\n\t\t}\n\n\t\tCore_ = NULL;\n\tqRR\n\tqRT\n\tqRE\n\t}\n\n\tE_ENUM( log_file_handling ) {\n\t\tlfhAppend,\t\/\/ New log are appended to the current ones.\n\t\tlfhDrop,\t\t\/\/ Old logs are destroyed.\n\t\tlfh_amount,\n\t\tlfh_Undefined,\n\t};\n\n\tlog_file_handling__ GetLogFileHandling_( void )\n\t{\n\t\tlog_file_handling__ Handling = lfh_Undefined;\n\tqRH\n\t\tstr::string Value;\n\tqRB\n\t\tValue.Init();\n\n\t\tregistry::GetRawModuleLogMode( Value );\n\n\t\tif ( ( Value.Amount() == 0 ) ||( Value == \"Append\" ) )\n\t\t\tHandling = lfhAppend;\n\t\telse if ( Value == \"Drop\" )\n\t\t\tHandling = lfhDrop;\n\t\telse\n\t\t\tsclrgstry::ReportBadOrNoValueForEntryErrorAndAbort( registry::ModuleLogMode );\n\tqRR\n\tqRT\n\tqRE\n\t\treturn Handling;\n\t}\n\n\tinline csdbns::port__ GetService_( void )\n\t{\n\t\treturn registry::GetRawModuleService();\n\t}\n\n\tE_ENUM( module_connection_type ) {\n\t\tmctStraight,\t\n\t\tmctSwitched,\n\t\tmct_amount,\n\t\tmct_Undefined\n\t};\n\n\tmodule_connection_type__ GetModuleConnectionType_( void )\n\t{\n\t\tmodule_connection_type__ Type = mct_Undefined;\n\tqRH\n\t\tstr::string Value;\n\tqRB\n\t\tValue.Init();\n\n\t\tregistry::GetRawModuleServiceType( Value );\n\n\t\tif ( Value == \"Straight\" )\n\t\t\tType = mctStraight;\n\t\telse if ( Value == \"Switched\" )\n\t\t\tType = mctSwitched;\n\t\telse\n\t\t\tsclrgstry::ReportBadOrNoValueForEntryErrorAndAbort( registry::ModuleServiceType );\n\tqRR\n\tqRT\n\tqRE\n\t\treturn Type;\n\t}\n\n\tvoid UseStraightConnections_(\n\t\tcsdscb::callback__ &Callback,\n\t\tconst bso::char__ *Module,\n\t\tcsdbns::port__ Port )\n\t{\n\tqRH\n\t\tcsdbns::server___ Server;\n\tqRB\n\t\tServer.Init( Port, Callback );\n\n\t\tServer.Process();\n\tqRR\n\tqRT\n\tqRE\n\t}\n\n\tvoid UseSwitchingConnections_(\n\t\tcsdscb::callback__ &Callback,\n\t\tcsdsns::log_functions__ &LogFunctions,\n\t\tcsdbns::port__ Port )\n\t{\n\tqRH\n\t\tcsdsns::server___ Server;\n\tqRB\n\t\tServer.Init( Port, Callback, LogFunctions );\n\n\t\tServer.Process();\n\tqRR\n\tqRT\n\tqRE\n\t}\n\n\ttypedef csdsns::log_functions__ _log_functions__;\n\n\tclass log_functions__\n\t: public _log_functions__\n\t{\n\tprivate:\n\t\ttxf::text_oflow__ *_Flow;\n\tprotected:\n\t\tvirtual void CSDSNSLog(\n\t\t\tcsdsns::log__ Log,\n\t\t\tcsdsns::id__ Id,\n\t\t\tvoid *UP,\n\t\t\tsdr::size__ Amount )\n\t\t{\n\t\t\ttol::buffer__ Buffer;\n\n\t\t\tif ( _Flow == NULL )\n\t\t\t\tqRGnr();\n\n\t\t\t*_Flow << '[' << tol::DateAndTime( Buffer ) << \"] \" << csdsns::GetLogLabel( Log ) << ' ' << Id << '\/' << Amount << txf::nl << txf::commit;\n\t\t}\n\tpublic:\n\t\tvoid reset( bso::bool__ P = true )\n\t\t{\n\t\t\t_log_functions__::reset( P );\n\t\t\t_Flow = NULL;\n\t\t}\n\t\tlog_functions__( void )\n\t\t{\n\t\t\treset( false );\n\t\t}\n\t\t~log_functions__( void )\n\t\t{\n\t\t\treset();\n\t\t}\n\t\tvoid Init( txf::text_oflow__ &Flow )\n\t\t{\n\t\t\t_log_functions__::Init();\n\t\t\t_Flow = &Flow;\n\t\t}\n\t};\n\n\tvoid UseSwitchingConnections_(\n\t\tcsdscb::callback__ &Callback,\n\t\tconst char *LogFileName,\n\t\tlog_file_handling__ LogFileHandling,\n\t\tcsdbns::port__ Port )\n\t{\n\tqRH\n\t\tflf::file_oflow___ FFlow;\n\t\ttxf::text_oflow__ TFlow;\n\t\tlog_functions__ LogFunctions;\n\t\tfil::mode__ Mode = fil::m_Undefined;\n\t\tlcl::meaning ErrorMeaning;\n\t\tstr::string ErrorTranslation;\n\tqRB\n\n\t\tif ( LogFileName != NULL ) {\n\t\t\tswitch ( LogFileHandling ) {\n\t\t\tcase lfhAppend:\n\t\t\t\tMode = fil::mAppend;\n\t\t\t\tbreak;\n\t\t\tcase lfhDrop:\n\t\t\t\tMode = fil::mRemove;\n\t\t\t\tbreak;\n\t\t\tdefault:\n\t\t\t\tif ( LogFileName != NULL )\n\t\t\t\t\tqRGnr();\n\t\t\t\tbreak;\n\t\t\t}\n\n\t\t\tif ( FFlow.Init( LogFileName, Mode, err::hUserDefined ) != tol::rSuccess ) {\n\t\t\t\tErrorMeaning.Init();\n\t\t\t\tErrorMeaning.SetValue( \"UnableToOpenLogFileError\" );\n\t\t\t\tErrorMeaning.AddTag( LogFileName );\n\n\t\t\t\tErrorTranslation.Init();\n\t\t\t\tCErr << sclmisc::GetBaseTranslation( ErrorMeaning, ErrorTranslation ) << txf::nl << txf::commit;\n\t\t\t\tLogFileName = NULL;\t\/\/ To notify no to use log functions.\n\t\t\t} else\n\t\t\t\tTFlow.Init( FFlow );\n\t\t}\n\n\t\tUseSwitchingConnections_( Callback, LogFileName == NULL ? *(csdsns::log_functions__ *)NULL : LogFunctions, Port );\n\tqRR\n\tqRT\n\tqRE\n\t}\n\n\tvoid Process_(\n\t\tconst bso::char__ *ModuleFilename,\n\t\tcsdbns::port__ Port,\n\t\tmodule_connection_type__ ConnectionType,\n\t\tconst char *LogFileName,\n\t\tlog_file_handling__ LogFileHandling )\n\t{\n\tqRH\n\t\tlcl::locale SharedLocale;\n\t\trgstry::registry SharedRegistry;\n\t\tcsdlec::library_data__ LibraryData;\n\t\tlcl::meaning Meaning, MeaningBuffer;\n\t\tstr::string Translation;\n\t\terr::buffer__ ErrBuffer;\n\tqRB\n\t\tSharedLocale.Init();\n\t\tSharedRegistry.Init();\n\n\t\tLibraryData.Init( csdleo::cRegular, ModuleFilename, err::qRRor, sclerror::SCLERRORError, csdleo::mRemote );\n\n\t\tif ( ( Core_ = new csdlec::library_embedded_client_core__ ) == NULL )\n\t\t\tqRAlc();\n\n\t\tif ( !Core_->Init( ModuleFilename, LibraryData, err::hUserDefined ) ) {\n\t\t\tMeaning.Init();\n\t\t\tMeaning.SetValue( \"UnableToLoadModule\" );\n\t\t\tMeaning.AddTag( ModuleFilename );\n\t\t\tsclerror::SetMeaning( Meaning );\n\t\t\tqRAbort();\n\t\t}\n\n\t\tswitch ( ConnectionType ) {\n\t\tcase mctStraight:\n\t\t\tUseStraightConnections_( Core_->GetCallback(), ModuleFilename, Port );\n\t\t\tbreak;\n\t\tcase mctSwitched:\n\t\t\tUseSwitchingConnections_( Core_->GetCallback(), LogFileName, LogFileHandling, Port );\n\t\t\tbreak;\n\t\tdefault:\n\t\t\tqRGnr();\n\t\t\tbreak;\n\t\t}\n\tqRR\n\t\tMeaning.Init();\n\t\tMeaning.SetValue( \"ModuleError\" );\n\t\tMeaning.SetValue( ModuleFilename );\n\n\t\tif ( ERRType >= err::t_amount ) {\n\t\t\tif ( sclerror::IsErrorPending() ) {\n\t\t\t\tMeaningBuffer.Init();\n\t\t\t\tMeaning.AddTag( sclerror::GetMeaning( MeaningBuffer ) );\n\t\t\t} else {\n\t\t\t\tTranslation.Init();\n\t\t\t\tMeaning.AddTag( sclmisc::GetBaseTranslation( \"UnkonwnError\", Translation ) );\n\t\t\t}\n\t\t} else {\n\t\t\tMeaning.AddTag( err::Message( ErrBuffer ) );\n\t\t}\n\n\t\tTranslation.Init();\n\t\tsclmisc::GetBaseTranslation( Meaning, Translation );\n\n\t\tcio::CErr << Translation << txf::nl << txf::commit;\n\tqRT\n\tqRE\n\t}\n\n\tvoid Process_(\n\t\tconst char *LogFileName,\n\t\tlog_file_handling__ LogFileHandling )\n\t{\n\tqRH\n\t\tstr::string ModuleFileName;\n\t\tTOL_CBUFFER___ Buffer;\n\tqRB\n\t\tModuleFileName.Init();\n\n\t\tProcess_( registry::GetModuleFileName( ModuleFileName ).Convert( Buffer ), GetService_(), GetModuleConnectionType_(), LogFileName, LogFileHandling );\n\tqRR\n\tqRT\n\tqRE\n\t}\n\n\tvoid Process_( void )\n\t{\n\tqRH\n\t\tTOL_CBUFFER___ Buffer;\n\tqRB\n\t\tatexit( ExitFunction_ );\n\n\t\tcio::COut.Commit();\n\n\t\tProcess_( registry::GetModuleLogFilename( Buffer ), GetLogFileHandling_() );\n\tqRR\n\tqRT\n\tqRE\n\t}\n}\n\nint scltool::SCLTOOLMain(\n\tconst str::string_ &Command,\n\tconst scltool::oddities__ &Oddities )\n{\n\tint ExitValue = EXIT_FAILURE;\nqRH\nqRB\n\tif ( Command == \"Version\" )\n\t\tPrintHeader_();\n\telse if ( Command == \"License\" )\n\t\tepsmsc::PrintLicense( NAME_MC );\n\tC( Process );\n\telse\n\t\tqRGnr();\n\n\tExitValue = EXIT_SUCCESS;\nqRR\nqRT\nqRE\n\treturn ExitValue;\n}\n\nconst char *sclmisc::SCLMISCTargetName = NAME_LC;\n\n<commit_msg>06\/07\/2016 21:32:47<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 \"net\/http\/http_network_session.h\"\n\n#include \"base\/logging.h\"\n#include \"net\/http\/http_auth_handler_factory.h\"\n#include \"net\/http\/url_security_manager.h\"\n#include \"net\/spdy\/spdy_session_pool.h\"\n\nnamespace net {\n\n\/\/ static\nint HttpNetworkSession::max_sockets_ = 100;\n\n\/\/ static\nint HttpNetworkSession::max_sockets_per_group_ = 6;\n\n\/\/ static\nuint16 HttpNetworkSession::g_fixed_http_port = 0;\nuint16 HttpNetworkSession::g_fixed_https_port = 0;\n\n\/\/ TODO(vandebo) when we've completely converted to pools, the base TCP\n\/\/ pool name should get changed to TCP instead of Transport.\nHttpNetworkSession::HttpNetworkSession(\n NetworkChangeNotifier* network_change_notifier,\n HostResolver* host_resolver,\n ProxyService* proxy_service,\n ClientSocketFactory* client_socket_factory,\n SSLConfigService* ssl_config_service,\n SpdySessionPool* spdy_session_pool,\n HttpAuthHandlerFactory* http_auth_handler_factory)\n : network_change_notifier_(network_change_notifier),\n tcp_socket_pool_(new TCPClientSocketPool(\n max_sockets_, max_sockets_per_group_, \"Transport\",\n host_resolver, client_socket_factory, network_change_notifier_)),\n socks_socket_pool_(new SOCKSClientSocketPool(\n max_sockets_, max_sockets_per_group_, \"SOCKS\", host_resolver,\n new TCPClientSocketPool(max_sockets_, max_sockets_per_group_,\n \"TCPForSOCKS\", host_resolver,\n client_socket_factory,\n network_change_notifier_),\n network_change_notifier_)),\n socket_factory_(client_socket_factory),\n host_resolver_(host_resolver),\n proxy_service_(proxy_service),\n ssl_config_service_(ssl_config_service),\n spdy_session_pool_(spdy_session_pool),\n http_auth_handler_factory_(http_auth_handler_factory) {\n DCHECK(proxy_service);\n DCHECK(ssl_config_service);\n}\n\nHttpNetworkSession::~HttpNetworkSession() {\n}\n\n\/\/ static\nvoid HttpNetworkSession::set_max_sockets_per_group(int socket_count) {\n DCHECK(0 < socket_count);\n \/\/ The following is a sanity check... but we should NEVER be near this value.\n DCHECK(100 > socket_count);\n max_sockets_per_group_ = socket_count;\n}\n\n\/\/ TODO(vandebo) when we've completely converted to pools, the base TCP\n\/\/ pool name should get changed to TCP instead of Transport.\nvoid HttpNetworkSession::ReplaceTCPSocketPool() {\n tcp_socket_pool_ = new TCPClientSocketPool(max_sockets_,\n max_sockets_per_group_,\n \"Transport\",\n host_resolver_,\n socket_factory_,\n network_change_notifier_);\n}\n\n} \/\/ namespace net\n<commit_msg>Increase the global TCP socket limit. It's too low. wtc likes powers of 2, so I chose 256 as we discussed earlier. We need to experiment more in the future. BUG=41289<commit_after>\/\/ Copyright (c) 2010 The Chromium Authors. All rights reserved.\n\/\/ Use of this source code is governed by a BSD-style license that can be\n\/\/ found in the LICENSE file.\n\n#include \"net\/http\/http_network_session.h\"\n\n#include \"base\/logging.h\"\n#include \"net\/http\/http_auth_handler_factory.h\"\n#include \"net\/http\/url_security_manager.h\"\n#include \"net\/spdy\/spdy_session_pool.h\"\n\nnamespace net {\n\n\/\/ static\nint HttpNetworkSession::max_sockets_ = 256;\n\n\/\/ static\nint HttpNetworkSession::max_sockets_per_group_ = 6;\n\n\/\/ static\nuint16 HttpNetworkSession::g_fixed_http_port = 0;\nuint16 HttpNetworkSession::g_fixed_https_port = 0;\n\n\/\/ TODO(vandebo) when we've completely converted to pools, the base TCP\n\/\/ pool name should get changed to TCP instead of Transport.\nHttpNetworkSession::HttpNetworkSession(\n NetworkChangeNotifier* network_change_notifier,\n HostResolver* host_resolver,\n ProxyService* proxy_service,\n ClientSocketFactory* client_socket_factory,\n SSLConfigService* ssl_config_service,\n SpdySessionPool* spdy_session_pool,\n HttpAuthHandlerFactory* http_auth_handler_factory)\n : network_change_notifier_(network_change_notifier),\n tcp_socket_pool_(new TCPClientSocketPool(\n max_sockets_, max_sockets_per_group_, \"Transport\",\n host_resolver, client_socket_factory, network_change_notifier_)),\n socks_socket_pool_(new SOCKSClientSocketPool(\n max_sockets_, max_sockets_per_group_, \"SOCKS\", host_resolver,\n new TCPClientSocketPool(max_sockets_, max_sockets_per_group_,\n \"TCPForSOCKS\", host_resolver,\n client_socket_factory,\n network_change_notifier_),\n network_change_notifier_)),\n socket_factory_(client_socket_factory),\n host_resolver_(host_resolver),\n proxy_service_(proxy_service),\n ssl_config_service_(ssl_config_service),\n spdy_session_pool_(spdy_session_pool),\n http_auth_handler_factory_(http_auth_handler_factory) {\n DCHECK(proxy_service);\n DCHECK(ssl_config_service);\n}\n\nHttpNetworkSession::~HttpNetworkSession() {\n}\n\n\/\/ static\nvoid HttpNetworkSession::set_max_sockets_per_group(int socket_count) {\n DCHECK(0 < socket_count);\n \/\/ The following is a sanity check... but we should NEVER be near this value.\n DCHECK(100 > socket_count);\n max_sockets_per_group_ = socket_count;\n}\n\n\/\/ TODO(vandebo) when we've completely converted to pools, the base TCP\n\/\/ pool name should get changed to TCP instead of Transport.\nvoid HttpNetworkSession::ReplaceTCPSocketPool() {\n tcp_socket_pool_ = new TCPClientSocketPool(max_sockets_,\n max_sockets_per_group_,\n \"Transport\",\n host_resolver_,\n socket_factory_,\n network_change_notifier_);\n}\n\n} \/\/ namespace net\n<|endoftext|>"} {"text":"<commit_before>\/*=========================================================================\n\nProgram: Visualization Toolkit\nModule: vtkOrderStatistics.cxx\n\nCopyright (c) Ken Martin, Will Schroeder, Bill Lorensen\nAll rights reserved.\nSee Copyright.txt or http:\/\/www.kitware.com\/Copyright.htm for details.\n\nThis software is distributed WITHOUT ANY WARRANTY; without even\nthe implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR\nPURPOSE. See the above copyright notice for more information.\n\n=========================================================================*\/\n\/*-------------------------------------------------------------------------\n Copyright 2008 Sandia Corporation.\n Under the terms of Contract DE-AC04-94AL85000 with Sandia Corporation,\n the U.S. Government retains certain rights in this software.\n -------------------------------------------------------------------------*\/\n\n#include \"vtkToolkits.h\"\n\n#include \"vtkOrderStatistics.h\"\n#include \"vtkUnivariateStatisticsAlgorithmPrivate.h\"\n\n#include \"vtkDoubleArray.h\"\n#include \"vtkIdTypeArray.h\"\n#include \"vtkInformation.h\"\n#include \"vtkInformationVector.h\"\n#include \"vtkObjectFactory.h\"\n#include \"vtkStringArray.h\"\n#include \"vtkTable.h\"\n#include \"vtkVariantArray.h\"\n\n#include <vtkstd\/vector>\n#include <vtkstd\/map>\n#include <vtkstd\/set>\n\nvtkCxxRevisionMacro(vtkOrderStatistics, \"1.19\");\nvtkStandardNewMacro(vtkOrderStatistics);\n\n\/\/ ----------------------------------------------------------------------\nvtkOrderStatistics::vtkOrderStatistics()\n{\n this->QuantileDefinition = vtkOrderStatistics::InverseCDFAveragedSteps;\n this->NumberOfIntervals = 4; \/\/ By default, calculate 5-points statistics\n}\n\n\/\/ ----------------------------------------------------------------------\nvtkOrderStatistics::~vtkOrderStatistics()\n{\n}\n\n\/\/ ----------------------------------------------------------------------\nvoid vtkOrderStatistics::PrintSelf( ostream &os, vtkIndent indent )\n{\n this->Superclass::PrintSelf( os, indent );\n os << indent << \"NumberOfIntervals: \" << this->NumberOfIntervals << endl;\n os << indent << \"QuantileDefinition: \" << this->QuantileDefinition << endl;\n}\n\n\/\/ ----------------------------------------------------------------------\nvoid vtkOrderStatistics::ExecuteLearn( vtkTable* dataset,\n vtkTable* output,\n bool finalize )\n{\n vtkIdType nCol = dataset->GetNumberOfColumns();\n if ( ! nCol )\n {\n this->SampleSize = 0;\n return;\n }\n\n this->SampleSize = dataset->GetNumberOfRows();\n if ( ! this->SampleSize )\n {\n return;\n }\n\n this->Internals->EffectColumnBuffer();\n this->SetColumnSelection( dataset );\n if ( ! this->Internals->SelectedColumns.size() )\n {\n return;\n }\n\n vtkStringArray* stringCol = vtkStringArray::New();\n stringCol->SetName( \"Variable\" );\n output->AddColumn( stringCol );\n stringCol->Delete();\n\n if ( finalize )\n {\n if ( this->NumberOfIntervals < 1 )\n {\n return;\n }\n \n vtkDoubleArray* doubleCol;\n double dq = 1. \/ static_cast<double>( this->NumberOfIntervals );\n for ( int i = 0; i <= this->NumberOfIntervals; ++ i )\n {\n doubleCol = vtkDoubleArray::New();\n if ( ! i )\n {\n doubleCol->SetName( \"Minimum\" );\n }\n else \n {\n if ( i == this->NumberOfIntervals )\n {\n doubleCol->SetName( \"Maximum\" );\n }\n else\n {\n doubleCol->SetName( vtkStdString( vtkVariant( i * dq ).ToString() + \"-quantile\" ).c_str() );\n }\n }\n\n output->AddColumn( doubleCol );\n doubleCol->Delete();\n }\n }\n else\n {\n vtkWarningMacro( \"Parallel implementation: not implemented yet.\" );\n return;\n }\n\n for ( vtkstd::set<vtkStdString>::iterator it = this->Internals->SelectedColumns.begin(); \n it != this->Internals->SelectedColumns.end(); ++ it )\n {\n vtkStdString col = *it;\n if ( ! dataset->GetColumnByName( col ) )\n {\n vtkWarningMacro( \"Dataset table does not have a column \"<<col.c_str()<<\". Ignoring it.\" );\n continue;\n }\n\n vtkstd::map<double,vtkIdType> distr;\n for ( vtkIdType r = 0; r < this->SampleSize; ++ r )\n {\n ++ distr[dataset->GetValueByName( r, col ).ToDouble()];\n }\n\n vtkVariantArray* row = vtkVariantArray::New();\n\n if ( finalize )\n {\n row->SetNumberOfValues( this->NumberOfIntervals + 2 );\n\n int i = 0;\n row->SetValue( i ++, col );\n\n vtkstd::vector<double> quantileThresholds;\n double dh = this->SampleSize \/ static_cast<double>( this->NumberOfIntervals );\n for ( int j = 0; j < this->NumberOfIntervals; ++ j )\n {\n quantileThresholds.push_back( j * dh );\n }\n\n double sum = 0;\n vtkstd::vector<double>::iterator qit = quantileThresholds.begin();\n for ( vtkstd::map<double,vtkIdType>::iterator mit = distr.begin();\n mit != distr.end(); ++ mit )\n {\n for ( sum += mit->second; qit != quantileThresholds.end() && sum >= *qit; ++ qit )\n {\n if ( sum == *qit\n && this->QuantileDefinition == vtkOrderStatistics::InverseCDFAveragedSteps )\n {\n vtkstd::map<double,vtkIdType>::iterator nit = mit;\n row->SetValue( i ++, ( (++ nit)->first + mit->first ) * .5 );\n }\n else\n {\n row->SetValue( i ++, mit->first );\n }\n }\n }\n \n row->SetValue( i, distr.rbegin()->first );\n }\n else\n {\n vtkWarningMacro( \"Parallel implementation: not implemented yet.\" );\n return;\n }\n\n output->InsertNextRow( row );\n\n row->Delete();\n }\n\n return;\n}\n\n\/\/ ----------------------------------------------------------------------\nvoid vtkOrderStatistics::ExecuteValidate( vtkTable*,\n vtkTable*,\n vtkTable* )\n{\n \/\/ Not implemented for this statistical engine\n}\n\n\/\/ ----------------------------------------------------------------------\nvoid vtkOrderStatistics::ExecuteEvince( vtkTable* dataset,\n vtkTable* params,\n vtkTable* output)\n{\n vtkIdType nColD = dataset->GetNumberOfColumns();\n if ( ! nColD )\n {\n return;\n }\n\n vtkIdType nRowD = dataset->GetNumberOfRows();\n if ( ! nRowD )\n {\n return;\n }\n\n vtkIdType nColP = params->GetNumberOfColumns();\n if ( nColP != 3 )\n {\n vtkWarningMacro( \"Parameter table has \" \n << nColP\n << \" != 3 columns. Doing nothing.\" );\n return;\n }\n\n vtkIdType nRowP = params->GetNumberOfRows();\n if ( ! nRowP )\n {\n return;\n }\n\n this->Internals->EffectColumnBuffer();\n this->SetColumnSelection( dataset );\n if ( ! this->Internals->SelectedColumns.size() )\n {\n return;\n }\n\n vtkStringArray* stringCol = vtkStringArray::New();\n stringCol->SetName( \"Variable\" );\n output->AddColumn( stringCol );\n stringCol->Delete();\n\n vtkIdTypeArray* idTypeCol = vtkIdTypeArray::New();\n idTypeCol->SetName( \"Row\" );\n output->AddColumn( idTypeCol );\n idTypeCol->Delete();\n\n vtkDoubleArray* doubleCol = vtkDoubleArray::New();\n doubleCol->SetName( \"Relative Deviation\" );\n output->AddColumn( doubleCol );\n doubleCol->Delete();\n\n vtkVariantArray* row = vtkVariantArray::New();\n row->SetNumberOfValues( 3 );\n\n for ( vtkstd::set<vtkStdString>::iterator it = this->Internals->SelectedColumns.begin(); \n it != this->Internals->SelectedColumns.end(); ++ it )\n {\n vtkStdString col = *it;\n if ( ! dataset->GetColumnByName( col ) )\n {\n vtkWarningMacro( \"Dataset table does not have a column \"<<col.c_str()<<\". Ignoring it.\" );\n continue;\n }\n \n bool unfound = true;\n for ( int i = 0; i < nRowP; ++ i )\n {\n if ( params->GetValue( i, 0 ).ToString() == col )\n {\n unfound = false;\n\n double center = params->GetValue( i, 1 ).ToDouble();\n double radius = params->GetValue( i, 2 ).ToDouble();\n double minimum = center - radius;\n double maximum = center + radius;\n\n double value;\n for ( vtkIdType r = 0; r < nRowD; ++ r )\n {\n value = dataset->GetValueByName( r, col ).ToDouble();\n if ( value < minimum || value > maximum )\n {\n row->SetValue( 0, col );\n row->SetValue( 1, r );\n row->SetValue( 2, ( value - center ) \/ radius );\n\n output->InsertNextRow( row );\n }\n }\n\n break;\n }\n }\n\n if ( unfound )\n {\n vtkWarningMacro( \"Parameter table does not have a row for dataset table column \"\n <<col.c_str()\n <<\". Ignoring it.\" );\n continue;\n }\n }\n row->Delete();\n\n return;\n}\n\n\/\/ ----------------------------------------------------------------------\nvoid vtkOrderStatistics::SetQuantileDefinition( vtkIdType qd )\n{\n switch ( qd )\n {\n case vtkOrderStatistics::InverseCDF:\n break;\n case vtkOrderStatistics::InverseCDFAveragedSteps:\n break;\n default:\n vtkWarningMacro( \"Incorrect type of quantile definition: \"\n <<qd\n <<\". Ignoring it.\" );\n return;\n }\n \n this->QuantileDefinition = static_cast<vtkOrderStatistics::QuantileDefinitionType>( qd );\n this->Modified();\n\n return;\n}\n<commit_msg>ENH: provide specific labels for special quantiles (quartiles, median).<commit_after>\/*=========================================================================\n\nProgram: Visualization Toolkit\nModule: vtkOrderStatistics.cxx\n\nCopyright (c) Ken Martin, Will Schroeder, Bill Lorensen\nAll rights reserved.\nSee Copyright.txt or http:\/\/www.kitware.com\/Copyright.htm for details.\n\nThis software is distributed WITHOUT ANY WARRANTY; without even\nthe implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR\nPURPOSE. See the above copyright notice for more information.\n\n=========================================================================*\/\n\/*-------------------------------------------------------------------------\n Copyright 2008 Sandia Corporation.\n Under the terms of Contract DE-AC04-94AL85000 with Sandia Corporation,\n the U.S. Government retains certain rights in this software.\n -------------------------------------------------------------------------*\/\n\n#include \"vtkToolkits.h\"\n\n#include \"vtkOrderStatistics.h\"\n#include \"vtkUnivariateStatisticsAlgorithmPrivate.h\"\n\n#include \"vtkDoubleArray.h\"\n#include \"vtkIdTypeArray.h\"\n#include \"vtkInformation.h\"\n#include \"vtkInformationVector.h\"\n#include \"vtkObjectFactory.h\"\n#include \"vtkStringArray.h\"\n#include \"vtkTable.h\"\n#include \"vtkVariantArray.h\"\n\n#include <vtkstd\/vector>\n#include <vtkstd\/map>\n#include <vtkstd\/set>\n\nvtkCxxRevisionMacro(vtkOrderStatistics, \"1.20\");\nvtkStandardNewMacro(vtkOrderStatistics);\n\n\/\/ ----------------------------------------------------------------------\nvtkOrderStatistics::vtkOrderStatistics()\n{\n this->QuantileDefinition = vtkOrderStatistics::InverseCDFAveragedSteps;\n this->NumberOfIntervals = 4; \/\/ By default, calculate 5-points statistics\n}\n\n\/\/ ----------------------------------------------------------------------\nvtkOrderStatistics::~vtkOrderStatistics()\n{\n}\n\n\/\/ ----------------------------------------------------------------------\nvoid vtkOrderStatistics::PrintSelf( ostream &os, vtkIndent indent )\n{\n this->Superclass::PrintSelf( os, indent );\n os << indent << \"NumberOfIntervals: \" << this->NumberOfIntervals << endl;\n os << indent << \"QuantileDefinition: \" << this->QuantileDefinition << endl;\n}\n\n\/\/ ----------------------------------------------------------------------\nvoid vtkOrderStatistics::ExecuteLearn( vtkTable* dataset,\n vtkTable* output,\n bool finalize )\n{\n vtkIdType nCol = dataset->GetNumberOfColumns();\n if ( ! nCol )\n {\n this->SampleSize = 0;\n return;\n }\n\n this->SampleSize = dataset->GetNumberOfRows();\n if ( ! this->SampleSize )\n {\n return;\n }\n\n this->Internals->EffectColumnBuffer();\n this->SetColumnSelection( dataset );\n if ( ! this->Internals->SelectedColumns.size() )\n {\n return;\n }\n\n vtkStringArray* stringCol = vtkStringArray::New();\n stringCol->SetName( \"Variable\" );\n output->AddColumn( stringCol );\n stringCol->Delete();\n\n if ( finalize )\n {\n if ( this->NumberOfIntervals < 1 )\n {\n return;\n }\n \n vtkDoubleArray* doubleCol;\n double dq = 1. \/ static_cast<double>( this->NumberOfIntervals );\n for ( int i = 0; i <= this->NumberOfIntervals; ++ i )\n {\n doubleCol = vtkDoubleArray::New();\n div_t q = div( i << 2, this->NumberOfIntervals );\n\n if ( q.rem )\n {\n doubleCol->SetName( vtkStdString( vtkVariant( i * dq ).ToString() + \"-quantile\" ).c_str() );\n }\n else\n {\n switch ( q.quot )\n {\n case 0:\n doubleCol->SetName( \"Minimum\" );\n break;\n case 1:\n doubleCol->SetName( \"First Quartile\" );\n break;\n case 2:\n doubleCol->SetName( \"Median\" );\n break;\n case 3:\n doubleCol->SetName( \"Third Quartile\" );\n break;\n case 4:\n doubleCol->SetName( \"Maximum\" );\n break;\n default:\n doubleCol->SetName( vtkStdString( vtkVariant( i * dq ).ToString() + \"-quantile\" ).c_str() );\n break;\n }\n }\n output->AddColumn( doubleCol );\n doubleCol->Delete();\n }\n }\n else\n {\n vtkWarningMacro( \"Parallel implementation: not implemented yet.\" );\n return;\n }\n\n for ( vtkstd::set<vtkStdString>::iterator it = this->Internals->SelectedColumns.begin(); \n it != this->Internals->SelectedColumns.end(); ++ it )\n {\n vtkStdString col = *it;\n if ( ! dataset->GetColumnByName( col ) )\n {\n vtkWarningMacro( \"Dataset table does not have a column \"<<col.c_str()<<\". Ignoring it.\" );\n continue;\n }\n\n vtkstd::map<double,vtkIdType> distr;\n for ( vtkIdType r = 0; r < this->SampleSize; ++ r )\n {\n ++ distr[dataset->GetValueByName( r, col ).ToDouble()];\n }\n\n vtkVariantArray* row = vtkVariantArray::New();\n\n if ( finalize )\n {\n row->SetNumberOfValues( this->NumberOfIntervals + 2 );\n\n int i = 0;\n row->SetValue( i ++, col );\n\n vtkstd::vector<double> quantileThresholds;\n double dh = this->SampleSize \/ static_cast<double>( this->NumberOfIntervals );\n for ( int j = 0; j < this->NumberOfIntervals; ++ j )\n {\n quantileThresholds.push_back( j * dh );\n }\n\n double sum = 0;\n vtkstd::vector<double>::iterator qit = quantileThresholds.begin();\n for ( vtkstd::map<double,vtkIdType>::iterator mit = distr.begin();\n mit != distr.end(); ++ mit )\n {\n for ( sum += mit->second; qit != quantileThresholds.end() && sum >= *qit; ++ qit )\n {\n if ( sum == *qit\n && this->QuantileDefinition == vtkOrderStatistics::InverseCDFAveragedSteps )\n {\n vtkstd::map<double,vtkIdType>::iterator nit = mit;\n row->SetValue( i ++, ( (++ nit)->first + mit->first ) * .5 );\n }\n else\n {\n row->SetValue( i ++, mit->first );\n }\n }\n }\n \n row->SetValue( i, distr.rbegin()->first );\n }\n else\n {\n vtkWarningMacro( \"Parallel implementation: not implemented yet.\" );\n return;\n }\n\n output->InsertNextRow( row );\n\n row->Delete();\n }\n\n return;\n}\n\n\/\/ ----------------------------------------------------------------------\nvoid vtkOrderStatistics::ExecuteValidate( vtkTable*,\n vtkTable*,\n vtkTable* )\n{\n \/\/ Not implemented for this statistical engine\n}\n\n\/\/ ----------------------------------------------------------------------\nvoid vtkOrderStatistics::ExecuteEvince( vtkTable* dataset,\n vtkTable* params,\n vtkTable* output)\n{\n vtkIdType nColD = dataset->GetNumberOfColumns();\n if ( ! nColD )\n {\n return;\n }\n\n vtkIdType nRowD = dataset->GetNumberOfRows();\n if ( ! nRowD )\n {\n return;\n }\n\n vtkIdType nColP = params->GetNumberOfColumns();\n if ( nColP != 3 )\n {\n vtkWarningMacro( \"Parameter table has \" \n << nColP\n << \" != 3 columns. Doing nothing.\" );\n return;\n }\n\n vtkIdType nRowP = params->GetNumberOfRows();\n if ( ! nRowP )\n {\n return;\n }\n\n this->Internals->EffectColumnBuffer();\n this->SetColumnSelection( dataset );\n if ( ! this->Internals->SelectedColumns.size() )\n {\n return;\n }\n\n vtkStringArray* stringCol = vtkStringArray::New();\n stringCol->SetName( \"Variable\" );\n output->AddColumn( stringCol );\n stringCol->Delete();\n\n vtkIdTypeArray* idTypeCol = vtkIdTypeArray::New();\n idTypeCol->SetName( \"Row\" );\n output->AddColumn( idTypeCol );\n idTypeCol->Delete();\n\n vtkDoubleArray* doubleCol = vtkDoubleArray::New();\n doubleCol->SetName( \"Relative Deviation\" );\n output->AddColumn( doubleCol );\n doubleCol->Delete();\n\n vtkVariantArray* row = vtkVariantArray::New();\n row->SetNumberOfValues( 3 );\n\n for ( vtkstd::set<vtkStdString>::iterator it = this->Internals->SelectedColumns.begin(); \n it != this->Internals->SelectedColumns.end(); ++ it )\n {\n vtkStdString col = *it;\n if ( ! dataset->GetColumnByName( col ) )\n {\n vtkWarningMacro( \"Dataset table does not have a column \"<<col.c_str()<<\". Ignoring it.\" );\n continue;\n }\n \n bool unfound = true;\n for ( int i = 0; i < nRowP; ++ i )\n {\n if ( params->GetValue( i, 0 ).ToString() == col )\n {\n unfound = false;\n\n double center = params->GetValue( i, 1 ).ToDouble();\n double radius = params->GetValue( i, 2 ).ToDouble();\n double minimum = center - radius;\n double maximum = center + radius;\n\n double value;\n for ( vtkIdType r = 0; r < nRowD; ++ r )\n {\n value = dataset->GetValueByName( r, col ).ToDouble();\n if ( value < minimum || value > maximum )\n {\n row->SetValue( 0, col );\n row->SetValue( 1, r );\n row->SetValue( 2, ( value - center ) \/ radius );\n\n output->InsertNextRow( row );\n }\n }\n\n break;\n }\n }\n\n if ( unfound )\n {\n vtkWarningMacro( \"Parameter table does not have a row for dataset table column \"\n <<col.c_str()\n <<\". Ignoring it.\" );\n continue;\n }\n }\n row->Delete();\n\n return;\n}\n\n\/\/ ----------------------------------------------------------------------\nvoid vtkOrderStatistics::SetQuantileDefinition( vtkIdType qd )\n{\n switch ( qd )\n {\n case vtkOrderStatistics::InverseCDF:\n break;\n case vtkOrderStatistics::InverseCDFAveragedSteps:\n break;\n default:\n vtkWarningMacro( \"Incorrect type of quantile definition: \"\n <<qd\n <<\". Ignoring it.\" );\n return;\n }\n \n this->QuantileDefinition = static_cast<vtkOrderStatistics::QuantileDefinitionType>( qd );\n this->Modified();\n\n return;\n}\n<|endoftext|>"} {"text":"<commit_before>\/*\n * See ffx.h for details.\n *\n * References:\n * [FFX2] http:\/\/csrc.nist.gov\/groups\/ST\/toolkit\/BCM\/documents\/proposedmodes\/ffx\/ffx-spec2.pdf\n *\/\n\n#include \"ffx\/ffx.h\"\n\n#include <math.h>\n\n#include <string>\n\n#include \"third_party\/aes\/aes.h\"\n\nnamespace ffx {\n\nstatic bool ValidateKey(const std::string & key) {\n if (key.length() != kFfxKeyLengthInNibbles) {\n return false;\n }\n for (uint32_t i = 0; i < key.length(); ++i) {\n if (isxdigit(key[i])) {\n continue;\n } else {\n return false;\n }\n }\n return true;\n}\n\n\/*\n * This function has an unfortunate number of input parameters.\n * However, this is a direct implementation of the round-function algorithm\n * F_K(n,T,i,B) defined in [FFX2].\n *\/\nbool Ffx::RoundFunction(uint32_t n,\n const mpz_class & tweak,\n uint32_t tweak_len_in_bits,\n uint32_t i,\n const mpz_class & B,\n uint32_t B_len,\n mpz_class * retval) {\n\n \/\/ [FFX2] pg 3., line 31\n uint32_t t = (tweak_len_in_bits + 7) >> 3;\n uint32_t beta = (n + 1) >> 1;\n uint32_t b = (beta + 7) >> 3;\n uint32_t d = 4 * ((b + 3) >> 2);\n\n\n \/\/ [FFX2] pg 3., line 32\n uint32_t m = 0;\n if ((i & 1) == 0) {\n m = n >> 1;\n } else {\n m = (n + 1) >> 1;\n }\n\n \/\/ [FFX2] pg 3., line 33\n mpz_class P = 0;\n uint32_t P_len = (1 + 1 + 1 + 3 + 1 + 1 + 4 + 4) * 8;\n P += mpz_class(1) << (1 + 1 + 3 + 1 + 1 + 4 + 4) * 8;\n P += mpz_class(2) << (1 + 3 + 1 + 1 + 4 + 4) * 8;\n P += mpz_class(1) << (3 + 1 + 1 + 4 + 4) * 8;\n P += mpz_class(2) << (1 + 1 + 4 + 4) * 8;\n P += mpz_class(10) << (1 + 4 + 4) * 8;\n P += mpz_class(n \/ 2) << (4 + 4) * 8;\n P += mpz_class(n) << (4) * 8;\n P += t;\n\n uint32_t B_bits = b * 8;\n\n \/\/ [FFX2] pg 3., line 34\n mpz_class Q = 0;\n uint32_t T_offset = ((((-1 * t) - b - 1) % 16) * 8);\n T_offset += 8;\n T_offset += B_bits;\n\n uint32_t Q_len = tweak_len_in_bits + T_offset;\n Q += mpz_class(tweak) << T_offset;\n Q += mpz_class(i) << B_bits;\n Q += B;\n\n mpz_class Y = 0;\n\n \/\/ [FFX2] pg 3., line 35\n bool cbc_success = AesCbcMac((P << Q_len) + Q, P_len + Q_len, &Y);\n if (!cbc_success) {\n return false;\n }\n\n \/\/ [FFX2] pg 3., line 36\n mpz_class Z = Y;\n uint32_t Z_len = 16;\n mpz_class counter = 1;\n mpz_class ctxt = 0;\n while (Z_len < (d + 4)) {\n ctxt = 0;\n AesEcbEncrypt((Y + counter), 128, &ctxt);\n Z_len += 16;\n Z <<= 128;\n mpz_add(Z.get_mpz_t(), Z.get_mpz_t(), ctxt.get_mpz_t());\n ++counter;\n }\n\n \/\/ [FFX2] pg 3., line 37\n BitMask(Z, Z_len * 8, 0, ((d + 4) * 8) - 1, &Y);\n\n \/\/ [FFX2] pg 3., line 38\n mpz_class modulus = 0;\n mpz_ui_pow_ui(modulus.get_mpz_t(), 2, m);\n Y = Y % modulus;\n\n \/\/ [FFX2] pg 3., line 39\n *retval = Y;\n\n return true;\n}\n\nbool Ffx::Encrypt(const mpz_class & tweak,\n uint32_t tweak_len_in_bits,\n const mpz_class & plaintext,\n uint32_t plaintext_len_in_bits,\n mpz_class * ciphertext) {\n\n mpz_class & retval = *ciphertext;\n\n \/\/ [FFX2] pg 3., line 14-15\n uint32_t n = plaintext_len_in_bits;\n uint32_t l = plaintext_len_in_bits \/ 2;\n uint32_t r = kDefaultFfxRounds;\n mpz_class A, B;\n BitMask(plaintext, plaintext_len_in_bits, 0, l - 1, &A);\n BitMask(plaintext, plaintext_len_in_bits, l, n - 1, &B);\n uint32_t B_len = n - l;\n mpz_class C = 0;\n mpz_class D = 0;\n uint32_t m = 0;\n mpz_class modulus = 0;\n\n \/\/ [FFX2] pg 3., line 16\n for (uint32_t i = 0; i <= (r - 1); ++i) {\n if ((i & 1) == 0) {\n m = n \/ 2;\n } else {\n m = (n+1) \/ 2;\n }\n mpz_ui_pow_ui(modulus.get_mpz_t(), 2, m);\n\n RoundFunction(n, tweak, tweak_len_in_bits, i, B, m, &D);\n mpz_add(C.get_mpz_t(),\n A.get_mpz_t(),\n D.get_mpz_t());\n\n C = C % modulus;\n A = B;\n B = C;\n }\n\n \/\/ [FFX2] pg 3., line 19\n retval = (A << B_len) + B;\n\n mpz_ui_pow_ui(modulus.get_mpz_t(), 2, plaintext_len_in_bits);\n retval = retval % modulus;\n\n return true;\n}\n\nbool Ffx::Decrypt(const mpz_class & tweak,\n uint32_t tweak_len_in_bits,\n const mpz_class & ciphertext,\n uint32_t ciphertext_len_bits,\n mpz_class * plaintext) {\n\n mpz_class & retval = *plaintext;\n\n \/\/ [FFX2] pg 3., line 24-25\n uint32_t n = ciphertext_len_bits;\n uint32_t l = ciphertext_len_bits \/ 2;\n uint32_t r = kDefaultFfxRounds;\n mpz_class A, B;\n BitMask(ciphertext, ciphertext_len_bits, 0, l - 1, &A);\n BitMask(ciphertext, ciphertext_len_bits, l, n - 1, &B);\n uint32_t B_len = n - l;\n mpz_class C = 0;\n mpz_class D = 0;\n uint32_t m = 0;\n mpz_class modulus = 0;\n\n \/\/ [FFX2] pg 3., line 26\n for (int32_t i = r - 1; i >= 0; --i) {\n if ((i & 1) == 0) {\n m = n \/ 2;\n } else {\n m = (n+1) \/ 2;\n }\n mpz_ui_pow_ui(modulus.get_mpz_t(), 2, m);\n\n C = B;\n B = A;\n RoundFunction(n, tweak, tweak_len_in_bits, i, B, m, &D);\n mpz_sub(A.get_mpz_t(),\n C.get_mpz_t(),\n D.get_mpz_t());\n\n while(A < 0) A += modulus;\n A = A % modulus;\n }\n\n \/\/ [FFX2] pg 3., line 29\n retval = (A << B_len) + B;\n\n mpz_ui_pow_ui(modulus.get_mpz_t(), 2, ciphertext_len_bits);\n retval = retval % modulus;\n\n return true;\n}\n\n\/*\n * These are the main entry points with NULL tweaks.\n *\/\nbool Ffx::Encrypt(const mpz_class & plaintext,\n uint32_t plaintext_len_in_bits,\n mpz_class * ciphertext) {\n return Ffx::Encrypt(0, 0, plaintext, plaintext_len_in_bits, ciphertext);\n}\n\nbool Ffx::Decrypt(const mpz_class & ciphertext,\n uint32_t ciphertext_len_in_bits,\n mpz_class * plaintext) {\n return Ffx::Decrypt(0, 0, ciphertext, ciphertext_len_in_bits, plaintext);\n}\n\nbool Ffx::SetKey(const std::string & key) {\n \/\/ [FFX2] pg 3., line 21\n if (!ValidateKey(key)) {\n return false;\n }\n\n uint32_t key_length_in_bytes = (key.length() + 1) \/ 2;\n key_ = new unsigned char[key_length_in_bytes];\n Base16ToBase256(key, key_length_in_bytes, key_);\n\n AesEcbSetKey(key_);\n AesCbcSetKey(key_);\n\n return true;\n}\n\nFfx::Ffx()\n : radix_(kDefaultFfxRadix)\n , key_(NULL) {\n}\n\nFfx::Ffx(const uint32_t radix)\n : radix_(radix)\n , key_(NULL) {\n\n}\n\n} \/\/ namespace ffx\n<commit_msg>Issue #18: small perf. improvements<commit_after>\/*\n * See ffx.h for details.\n *\n * References:\n * [FFX2] http:\/\/csrc.nist.gov\/groups\/ST\/toolkit\/BCM\/documents\/proposedmodes\/ffx\/ffx-spec2.pdf\n *\/\n\n#include \"ffx\/ffx.h\"\n\n#include <math.h>\n\n#include <string>\n\n#include \"third_party\/aes\/aes.h\"\n\nnamespace ffx {\n\nstatic bool ValidateKey(const std::string & key) {\n if (key.length() != kFfxKeyLengthInNibbles) {\n return false;\n }\n for (uint32_t i = 0; i < key.length(); ++i) {\n if (isxdigit(key[i])) {\n continue;\n } else {\n return false;\n }\n }\n return true;\n}\n\n\/*\n * This function has an unfortunate number of input parameters.\n * However, this is a direct implementation of the round-function algorithm\n * F_K(n,T,i,B) defined in [FFX2].\n *\/\nbool Ffx::RoundFunction(uint32_t n,\n const mpz_class & tweak,\n uint32_t tweak_len_in_bits,\n uint32_t i,\n const mpz_class & B,\n uint32_t B_len,\n mpz_class * retval) {\n\n \/\/ [FFX2] pg 3., line 31\n uint32_t t = (tweak_len_in_bits + 7) >> 3;\n uint32_t beta = (n + 1) >> 1;\n uint32_t b = (beta + 7) >> 3;\n uint32_t d = 4 * ((b + 3) >> 2);\n\n\n \/\/ [FFX2] pg 3., line 32\n uint32_t m = 0;\n if ((i & 1) == 0) {\n m = n >> 1;\n } else {\n m = (n + 1) >> 1;\n }\n\n \/\/ [FFX2] pg 3., line 33\n mpz_class P = 0;\n uint32_t P_len = (1 + 1 + 1 + 3 + 1 + 1 + 4 + 4) * 8;\n P += mpz_class(1) << (1 + 1 + 3 + 1 + 1 + 4 + 4) * 8;\n P += mpz_class(2) << (1 + 3 + 1 + 1 + 4 + 4) * 8;\n P += mpz_class(1) << (3 + 1 + 1 + 4 + 4) * 8;\n P += mpz_class(2) << (1 + 1 + 4 + 4) * 8;\n P += mpz_class(10) << (1 + 4 + 4) * 8;\n P += mpz_class(n \/ 2) << (4 + 4) * 8;\n P += mpz_class(n) << (4) * 8;\n P += t;\n\n uint32_t B_bits = b * 8;\n\n \/\/ [FFX2] pg 3., line 34\n mpz_class Q = 0;\n uint32_t T_offset = ((((-1 * t) - b - 1) % 16) * 8);\n T_offset += 8;\n T_offset += B_bits;\n\n uint32_t Q_len = tweak_len_in_bits + T_offset;\n Q += mpz_class(tweak) << T_offset;\n Q += mpz_class(i) << B_bits;\n Q += B;\n\n mpz_class Y = 0;\n\n \/\/ [FFX2] pg 3., line 35\n bool cbc_success = AesCbcMac((P << Q_len) + Q, P_len + Q_len, &Y);\n if (!cbc_success) {\n return false;\n }\n\n \/\/ [FFX2] pg 3., line 36\n mpz_class Z = Y;\n uint32_t Z_len = 16;\n mpz_class counter = 1;\n mpz_class ctxt = 0;\n while (Z_len < (d + 4)) {\n ctxt = 0;\n AesEcbEncrypt((Y + counter), 128, &ctxt);\n Z_len += 16;\n Z <<= 128;\n mpz_add(Z.get_mpz_t(), Z.get_mpz_t(), ctxt.get_mpz_t());\n ++counter;\n }\n\n \/\/ [FFX2] pg 3., line 37\n BitMask(Z, Z_len * 8, 0, ((d + 4) * 8) - 1, &Y);\n\n \/\/ [FFX2] pg 3., line 38\n mpz_class modulus = 0;\n mpz_ui_pow_ui(modulus.get_mpz_t(), 2, m);\n Y = Y % modulus;\n\n \/\/ [FFX2] pg 3., line 39\n *retval = Y;\n\n return true;\n}\n\nbool Ffx::Encrypt(const mpz_class & tweak,\n uint32_t tweak_len_in_bits,\n const mpz_class & plaintext,\n uint32_t plaintext_len_in_bits,\n mpz_class * ciphertext) {\n\n mpz_class & retval = *ciphertext;\n\n \/\/ [FFX2] pg 3., line 14-15\n uint32_t n = plaintext_len_in_bits;\n uint32_t l = plaintext_len_in_bits \/ 2;\n uint32_t r = kDefaultFfxRounds;\n mpz_class A, B;\n BitMask(plaintext, plaintext_len_in_bits, 0, l - 1, &A);\n BitMask(plaintext, plaintext_len_in_bits, l, n - 1, &B);\n uint32_t B_len = n - l;\n mpz_class C = 0;\n mpz_class D = 0;\n uint32_t m = 0;\n mpz_class modulus = 0;\n\n \/\/ [FFX2] pg 3., line 16\n for (uint32_t i = 0; i <= (r - 1); ++i) {\n if ((i & 1) == 0) {\n m = n >> 1;\n } else {\n m = (n+1) >> 1;\n }\n mpz_ui_pow_ui(modulus.get_mpz_t(), 2, m);\n\n RoundFunction(n, tweak, tweak_len_in_bits, i, B, m, &D);\n mpz_add(C.get_mpz_t(),\n A.get_mpz_t(),\n D.get_mpz_t());\n\n C = C % modulus;\n A = B;\n B = C;\n }\n\n \/\/ [FFX2] pg 3., line 19\n retval = (A << B_len) + B;\n\n mpz_ui_pow_ui(modulus.get_mpz_t(), 2, plaintext_len_in_bits);\n retval = retval % modulus;\n\n return true;\n}\n\nbool Ffx::Decrypt(const mpz_class & tweak,\n uint32_t tweak_len_in_bits,\n const mpz_class & ciphertext,\n uint32_t ciphertext_len_bits,\n mpz_class * plaintext) {\n\n mpz_class & retval = *plaintext;\n\n \/\/ [FFX2] pg 3., line 24-25\n uint32_t n = ciphertext_len_bits;\n uint32_t l = ciphertext_len_bits \/ 2;\n uint32_t r = kDefaultFfxRounds;\n mpz_class A, B;\n BitMask(ciphertext, ciphertext_len_bits, 0, l - 1, &A);\n BitMask(ciphertext, ciphertext_len_bits, l, n - 1, &B);\n uint32_t B_len = n - l;\n mpz_class C = 0;\n mpz_class D = 0;\n uint32_t m = 0;\n mpz_class modulus = 0;\n\n \/\/ [FFX2] pg 3., line 26\n for (int32_t i = r - 1; i >= 0; --i) {\n if ((i & 1) == 0) {\n m = n >> 1;\n } else {\n m = (n+1) >> 1;\n }\n mpz_ui_pow_ui(modulus.get_mpz_t(), 2, m);\n\n C = B;\n B = A;\n RoundFunction(n, tweak, tweak_len_in_bits, i, B, m, &D);\n mpz_sub(A.get_mpz_t(),\n C.get_mpz_t(),\n D.get_mpz_t());\n\n while(A < 0) A += modulus;\n A = A % modulus;\n }\n\n \/\/ [FFX2] pg 3., line 29\n retval = (A << B_len) + B;\n\n mpz_ui_pow_ui(modulus.get_mpz_t(), 2, ciphertext_len_bits);\n retval = retval % modulus;\n\n return true;\n}\n\n\/*\n * These are the main entry points with NULL tweaks.\n *\/\nbool Ffx::Encrypt(const mpz_class & plaintext,\n uint32_t plaintext_len_in_bits,\n mpz_class * ciphertext) {\n return Ffx::Encrypt(0, 0, plaintext, plaintext_len_in_bits, ciphertext);\n}\n\nbool Ffx::Decrypt(const mpz_class & ciphertext,\n uint32_t ciphertext_len_in_bits,\n mpz_class * plaintext) {\n return Ffx::Decrypt(0, 0, ciphertext, ciphertext_len_in_bits, plaintext);\n}\n\nbool Ffx::SetKey(const std::string & key) {\n \/\/ [FFX2] pg 3., line 21\n if (!ValidateKey(key)) {\n return false;\n }\n\n uint32_t key_length_in_bytes = (key.length() + 1) \/ 2;\n key_ = new unsigned char[key_length_in_bytes];\n Base16ToBase256(key, key_length_in_bytes, key_);\n\n AesEcbSetKey(key_);\n AesCbcSetKey(key_);\n\n return true;\n}\n\nFfx::Ffx()\n : radix_(kDefaultFfxRadix)\n , key_(NULL) {\n}\n\nFfx::Ffx(const uint32_t radix)\n : radix_(radix)\n , key_(NULL) {\n\n}\n\n} \/\/ namespace ffx\n<|endoftext|>"} {"text":"<commit_before>#include <mart-netlib\/udp.hpp>\n\n#include <mart-common\/PrintWrappers.h>\n\n#include <catch2\/catch.hpp>\n\n#include <iostream>\nTEST_CASE( \"udp_socket_simple_member_check1\", \"[net]\" )\n{\n\tusing namespace mart::nw::ip;\n\tudp::endpoint e1 = {mart::nw::ip::address_any, mart::nw::ip::port_nr {1573}};\n\tudp::endpoint e2 = {mart::nw::ip::address_local_host, mart::nw::ip::port_nr {1455}};\n\tudp::endpoint e3 {\"127.0.0.1:3435\"};\n\tudp::Socket s1;\n\n\tudp::Socket s2 {};\n\n\tudp::Socket s3( e1, e3 );\n\ts3.close();\n\tudp::Socket s4( std::move( s1 ) );\n\ts2 = std::move( s4 );\n\n\t[[maybe_unused]] mart::nw::socks::RaiiSocket& raw_socket = s2.getRawSocket();\n\n\ts2.bind( e1 );\n\t\/\/ socket can't be rebinded to a different one\n\tCHECK( !s2.try_bind( e1 ) );\n\tCHECK_NOTHROW( s2.connect( e2 ) );\n\tCHECK( s2.getLocalEndpoint() == e1 );\n\tCHECK( s2.getRemoteEndpoint() == e2 );\n\n\tCHECK( s2.try_connect( e3 ) );\n\n\tCHECK( s2.getLocalEndpoint() == e1 );\n\tCHECK( s2.getRemoteEndpoint() == e3 );\n\n\tCHECK_NOTHROW( s2.send( mart::view_bytes( 5 ) ) );\n\tCHECK_NOTHROW( s2.sendto( mart::view_bytes( 5 ), e2 ) );\n\n\tCHECK_THROWS( s2.sendto( mart::view_bytes( 5 ), e1 ) ); \/\/ invalid target address\n}\n\nnamespace {\ntemplate<class Rep, class Period>\nstd::ostream& operator<<( std::ostream& out, std::chrono::duration<Rep, Period> dur )\n{\n\tout << mart::sformat( dur );\n\treturn out;\n}\n\n} \/\/ namespace\n\nTEST_CASE( \"udp_socket_simple_member_check2\", \"[net]\" )\n{\n\tusing namespace mart::nw::ip;\n\tudp::Socket s {};\n\n\tCHECK( s.is_blocking() );\n\n\tCHECK_NOTHROW( s.bind( udp::endpoint {\"127.0.0.1:3446\"} ) );\n\tusing namespace std::chrono_literals;\n\tCHECK( s.set_rx_timeout( 1ms ) );\n\tCHECK( s.set_tx_timeout( 2ms ) );\n\tCHECK( s.get_tx_timeout() == 2ms );\n\tCHECK( s.get_rx_timeout() == 1ms );\n\n\tint buffer = 0;\n\tCHECK( !s.try_recv( mart::view_bytes_mutable( buffer ) ).isValid() );\n\n\n\tCHECK( s.try_send( mart::view_bytes( buffer ) ).size() != 0 );\n\tCHECK_THROWS( s.send( mart::view_bytes( buffer ) ).isValid() );\n\t{\n\t\tudp::endpoint e4 {};\n\t\tCHECK( s.try_sendto( mart::view_bytes( buffer ), e4 ).size() != 0 );\n\t\tCHECK_THROWS( s.sendto( mart::view_bytes( buffer ), e4 ).isValid() );\n\t}\n\n\tCHECK( !s.try_recv( mart::view_bytes_mutable( buffer ) ).isValid() );\n\tCHECK( !s.try_recvfrom( mart::view_bytes_mutable( buffer ) ).data.isValid() );\n\n\tCHECK( !s.recv( mart::view_bytes_mutable( buffer ) ).isValid() );\n\tCHECK( !s.recvfrom( mart::view_bytes_mutable( buffer ) ).data.isValid() );\n\n\n\ts.clearRxBuff();\n\n\tCHECK( s.set_blocking( false ) );\n\tCHECK( !s.is_blocking() );\n\n\ts.close();\n\tCHECK( !s.is_valid() );\n}\n\nTEST_CASE( \"invalid_endpoint_strings_fail\" )\n{\n\tusing namespace mart::nw::ip;\n\tCHECK_THROWS( udp::endpoint {\"127.0.0.1\"} );\n\tCHECK_THROWS( udp::endpoint {\"127.0.0:5\"} );\n\tCHECK_THROWS( udp::endpoint {\"127005\"} );\n\tCHECK_THROWS( udp::endpoint {\"127.0.0.1:66999\"} );\n\tCHECK_THROWS( udp::endpoint {\"1.333.0.1:669\"} );\n}\n<commit_msg>[netlib\/tests] Remove unnecessary stream operator in test<commit_after>#include <mart-netlib\/udp.hpp>\n\n#include <mart-common\/PrintWrappers.h>\n\n#include <catch2\/catch.hpp>\n\nTEST_CASE( \"udp_socket_simple_member_check1\", \"[net]\" )\n{\n\tusing namespace mart::nw::ip;\n\tudp::endpoint e1 = {mart::nw::ip::address_any, mart::nw::ip::port_nr {1573}};\n\tudp::endpoint e2 = {mart::nw::ip::address_local_host, mart::nw::ip::port_nr {1455}};\n\tudp::endpoint e3 {\"127.0.0.1:3435\"};\n\tudp::Socket s1;\n\n\tudp::Socket s2 {};\n\n\tudp::Socket s3( e1, e3 );\n\ts3.close();\n\tudp::Socket s4( std::move( s1 ) );\n\ts2 = std::move( s4 );\n\n\t[[maybe_unused]] mart::nw::socks::RaiiSocket& raw_socket = s2.getRawSocket();\n\n\ts2.bind( e1 );\n\t\/\/ socket can't be rebinded to a different one\n\tCHECK( !s2.try_bind( e1 ) );\n\tCHECK_NOTHROW( s2.connect( e2 ) );\n\tCHECK( s2.getLocalEndpoint() == e1 );\n\tCHECK( s2.getRemoteEndpoint() == e2 );\n\n\tCHECK( s2.try_connect( e3 ) );\n\n\tCHECK( s2.getLocalEndpoint() == e1 );\n\tCHECK( s2.getRemoteEndpoint() == e3 );\n\n\tCHECK_NOTHROW( s2.send( mart::view_bytes( 5 ) ) );\n\tCHECK_NOTHROW( s2.sendto( mart::view_bytes( 5 ), e2 ) );\n\n\tCHECK_THROWS( s2.sendto( mart::view_bytes( 5 ), e1 ) ); \/\/ invalid target address\n}\n\nTEST_CASE( \"udp_socket_simple_member_check2\", \"[net]\" )\n{\n\tusing namespace mart::nw::ip;\n\tudp::Socket s {};\n\n\tCHECK( s.is_blocking() );\n\n\tCHECK_NOTHROW( s.bind( udp::endpoint {\"127.0.0.1:3446\"} ) );\n\tusing namespace std::chrono_literals;\n\tCHECK( s.set_rx_timeout( 1ms ) );\n\tCHECK( s.set_tx_timeout( 2ms ) );\n\tCHECK( s.get_tx_timeout() == 2ms );\n\tCHECK( s.get_rx_timeout() == 1ms );\n\n\tint buffer = 0;\n\tCHECK( !s.try_recv( mart::view_bytes_mutable( buffer ) ).isValid() );\n\n\n\tCHECK( s.try_send( mart::view_bytes( buffer ) ).size() != 0 );\n\tCHECK_THROWS( s.send( mart::view_bytes( buffer ) ).isValid() );\n\t{\n\t\tudp::endpoint e4 {};\n\t\tCHECK( s.try_sendto( mart::view_bytes( buffer ), e4 ).size() != 0 );\n\t\tCHECK_THROWS( s.sendto( mart::view_bytes( buffer ), e4 ).isValid() );\n\t}\n\n\tCHECK( !s.try_recv( mart::view_bytes_mutable( buffer ) ).isValid() );\n\tCHECK( !s.try_recvfrom( mart::view_bytes_mutable( buffer ) ).data.isValid() );\n\n\tCHECK( !s.recv( mart::view_bytes_mutable( buffer ) ).isValid() );\n\tCHECK( !s.recvfrom( mart::view_bytes_mutable( buffer ) ).data.isValid() );\n\n\n\ts.clearRxBuff();\n\n\tCHECK( s.set_blocking( false ) );\n\tCHECK( !s.is_blocking() );\n\n\ts.close();\n\tCHECK( !s.is_valid() );\n}\n\nTEST_CASE( \"invalid_endpoint_strings_fail\" )\n{\n\tusing namespace mart::nw::ip;\n\tCHECK_THROWS( udp::endpoint {\"127.0.0.1\"} );\n\tCHECK_THROWS( udp::endpoint {\"127.0.0:5\"} );\n\tCHECK_THROWS( udp::endpoint {\"127005\"} );\n\tCHECK_THROWS( udp::endpoint {\"127.0.0.1:66999\"} );\n\tCHECK_THROWS( udp::endpoint {\"1.333.0.1:669\"} );\n}\n<|endoftext|>"} {"text":"<commit_before>#include \"Edge.hpp\"\n#include \"Node.hpp\"\n#include \"PathNode.hpp\"\n#include \"..\/util\/Vector2fAdapter.hpp\"\n\n#include <cassert>\n\n\/\/ Christopher D. Canfield\n\/\/ October 2013\n\/\/ Edge.cpp\n\nusing cdc::Edge;\nusing cdc::Node;\nusing cdc::PathNode;\n\n\nEdge::Edge(cdc::Node& startNode) :\n\tstartNode(&startNode),\n\tendNode(nullptr), \n\tcost(999999),\n\tnextPheromoneReduction(0)\n{\n\tvertices.setPrimitiveType(sf::Lines);\n}\n\nEdge::Edge(cdc::Node& startNode, cdc::Node& endNode, float cost) :\n\tstartNode(&startNode),\n\tendNode(&endNode), \n\tcost(cost),\n\tnextPheromoneReduction(0)\n{\n\tsetVertices(startNode, endNode);\n}\n\nEdge::Edge(Node& startNode, Node& endNode, int cost) :\n\tstartNode(&startNode),\n\tendNode(&endNode),\n\tcost(static_cast<float>(cost)),\n\tnextPheromoneReduction(0)\n{\n\tsetVertices(startNode, endNode);\n}\n\nvoid Edge::setVertices(Node& startNode, Node& endNode)\n{\n\tvertices.setPrimitiveType(sf::Lines);\n\n\tvertices.append(sf::Vertex(\n\t\t\tVector2fAdapter(startNode.getPixelX<uint>(), startNode.getPixelY<uint>()), \n\t\t\tsf::Color(0, 0, 255)));\n\n\tvertices.append(sf::Vertex(\n\t\t\tVector2fAdapter(endNode.getPixelX<uint>(), endNode.getPixelY<uint>()), \n\t\t\tsf::Color(0, 0, 255)));\n\n\tpheromoneStrongVertices.setPrimitiveType(sf::Lines);\n\tsf::Vector2f startPoint(startNode.getPixelX<float>(), startNode.getPixelY<float>());\n\tsf::Vector2f endPoint(endNode.getPixelX<float>(), endNode.getPixelY<float>());\n\tpheromoneStrongVertices.append(sf::Vertex(startPoint, sf::Color(255, 0, 0)));\n\tpheromoneStrongVertices.append(sf::Vertex(endPoint, sf::Color(255, 0, 0)));\n\n\tpheromoneMediumVertices.setPrimitiveType(sf::Lines);\n\tsf::Vector2f startPoint2(startNode.getPixelX<float>(), startNode.getPixelY<float>());\n\tsf::Vector2f endPoint2(endNode.getPixelX<float>(), endNode.getPixelY<float>());\n\tpheromoneMediumVertices.append(sf::Vertex(startPoint2, sf::Color(255, 145, 0)));\n\tpheromoneMediumVertices.append(sf::Vertex(endPoint2, sf::Color(255, 145, 0)));\n\n\tpheromoneWeakVertices.setPrimitiveType(sf::Lines);\n\tsf::Vector2f startPoint3(startNode.getPixelX<float>(), startNode.getPixelY<float>());\n\tsf::Vector2f endPoint3(endNode.getPixelX<float>(), endNode.getPixelY<float>());\n\tpheromoneWeakVertices.append(sf::Vertex(startPoint3, sf::Color(255, 195, 0)));\n\tpheromoneWeakVertices.append(sf::Vertex(endPoint3, sf::Color(255, 195, 0)));\n}\n\nNode* Edge::getNode1() const\n{\n\treturn startNode;\n}\n\nNode* Edge::getNode2() const\n{\n\treturn endNode;\n}\n\nNode* Edge::getOppositeNode(const Node& node) const\n{\n\tif (*startNode == node)\n\t{\n\t\treturn endNode;\n\t}\n\telse if (*endNode == node)\n\t{\n\t\treturn startNode;\n\t}\n\treturn nullptr;\n}\n\nNode* Edge::getOppositeNode(PathNode node) const\n{\n\treturn getOppositeNode(node.getNode());\n}\n\nfloat Edge::getCost() const\n{\n\treturn cost;\n}\n\nuint Edge::getPheromone() const\n{\n\treturn pheromone.getStrength();\n}\n\nvoid Edge::increasePheromone()\n{\n\tpheromone.increase();\n}\n\nvoid Edge::increasePheromoneToMax()\n{\n\tpheromone.increaseToMax();\n}\n\nvoid Edge::decreasePheromone()\n{\n\tpheromone.decrease();\n}\n\nvoid Edge::setPheromoneNextNode(Node& node, uint ticks)\n{\n\tpheromone.setNextNode(node, ticks);\n}\n\nuint Edge::getPheromoneNextNodeTickTime() const\n{\n\treturn pheromone.getNextNodeTickTime();\n}\n\nNode* Edge::getPheromoneNextNode() const\n{\n\treturn pheromone.getNextNode();\n}\n\nvoid Edge::update(uint ticks)\n{\n\tconst int pheromoneReducationRate = 200;\n\n\tif (ticks >= nextPheromoneReduction)\n\t{\n\t\tpheromone.decrease();\n\t\tnextPheromoneReduction += pheromoneReducationRate;\n\t}\n}\n\nvoid Edge::draw(sf::RenderTarget& target, sf::RenderStates states) const\n{\n\tif (endNode != nullptr)\n\t{\n\t\ttarget.draw(vertices, states);\n\t}\n}\n\nvoid Edge::draw(sf::RenderTarget &target, sf::RenderStates states, sf::Color color) const\n{\n\tusing namespace sf;\n\n\tif (endNode != nullptr)\n\t{\n\t\tVertexArray path;\n\t\tpath.setPrimitiveType(sf::Lines);\n\n\t\tpath.append(Vertex(Vector2f(startNode->getPixelX<float>(), startNode->getPixelY<float>()), color));\n\t\tpath.append(Vertex(Vector2f(endNode->getPixelX<float>(), endNode->getPixelY<float>()), color));\n\n\t\ttarget.draw(path, states);\n\t}\n}\n\nvoid Edge::drawPheromone(sf::RenderTarget& target, sf::RenderStates states)\n{\n\tauto pheromoneStrength = getPheromone();\n\t\n\tif (pheromoneStrength > 6)\n\t{\n\t\ttarget.draw(pheromoneStrongVertices, states);\n\t}\n\telse if (pheromoneStrength > 3)\n\t{\n\t\ttarget.draw(pheromoneMediumVertices, states);\n\t}\n\telse if (pheromoneStrength > 0)\n\t{\n\t\ttarget.draw(pheromoneWeakVertices, states);\n\t}\n}\n\nbool Edge::operator==(const Edge& other) const\n{\n\treturn (this->getCost() == other.getCost() &&\n\t\t\tthis->getNode1() == other.getNode1() &&\n\t\t\tthis->getNode2() == other.getNode2() &&\n\t\t\tthis->getPheromone() == other.getPheromone());\n}\n\nbool Edge::operator!=(const Edge& other) const\n{\n\treturn !(*this == other);\n}<commit_msg>Increased pheromone decay rate<commit_after>#include \"Edge.hpp\"\n#include \"Node.hpp\"\n#include \"PathNode.hpp\"\n#include \"..\/util\/Vector2fAdapter.hpp\"\n\n#include <cassert>\n\n\/\/ Christopher D. Canfield\n\/\/ October 2013\n\/\/ Edge.cpp\n\nusing cdc::Edge;\nusing cdc::Node;\nusing cdc::PathNode;\n\n\nEdge::Edge(cdc::Node& startNode) :\n\tstartNode(&startNode),\n\tendNode(nullptr), \n\tcost(999999),\n\tnextPheromoneReduction(0)\n{\n\tvertices.setPrimitiveType(sf::Lines);\n}\n\nEdge::Edge(cdc::Node& startNode, cdc::Node& endNode, float cost) :\n\tstartNode(&startNode),\n\tendNode(&endNode), \n\tcost(cost),\n\tnextPheromoneReduction(0)\n{\n\tsetVertices(startNode, endNode);\n}\n\nEdge::Edge(Node& startNode, Node& endNode, int cost) :\n\tstartNode(&startNode),\n\tendNode(&endNode),\n\tcost(static_cast<float>(cost)),\n\tnextPheromoneReduction(0)\n{\n\tsetVertices(startNode, endNode);\n}\n\nvoid Edge::setVertices(Node& startNode, Node& endNode)\n{\n\tvertices.setPrimitiveType(sf::Lines);\n\n\tvertices.append(sf::Vertex(\n\t\t\tVector2fAdapter(startNode.getPixelX<uint>(), startNode.getPixelY<uint>()), \n\t\t\tsf::Color(0, 0, 255)));\n\n\tvertices.append(sf::Vertex(\n\t\t\tVector2fAdapter(endNode.getPixelX<uint>(), endNode.getPixelY<uint>()), \n\t\t\tsf::Color(0, 0, 255)));\n\n\tpheromoneStrongVertices.setPrimitiveType(sf::Lines);\n\tsf::Vector2f startPoint(startNode.getPixelX<float>(), startNode.getPixelY<float>());\n\tsf::Vector2f endPoint(endNode.getPixelX<float>(), endNode.getPixelY<float>());\n\tpheromoneStrongVertices.append(sf::Vertex(startPoint, sf::Color(255, 0, 0)));\n\tpheromoneStrongVertices.append(sf::Vertex(endPoint, sf::Color(255, 0, 0)));\n\n\tpheromoneMediumVertices.setPrimitiveType(sf::Lines);\n\tsf::Vector2f startPoint2(startNode.getPixelX<float>(), startNode.getPixelY<float>());\n\tsf::Vector2f endPoint2(endNode.getPixelX<float>(), endNode.getPixelY<float>());\n\tpheromoneMediumVertices.append(sf::Vertex(startPoint2, sf::Color(255, 145, 0)));\n\tpheromoneMediumVertices.append(sf::Vertex(endPoint2, sf::Color(255, 145, 0)));\n\n\tpheromoneWeakVertices.setPrimitiveType(sf::Lines);\n\tsf::Vector2f startPoint3(startNode.getPixelX<float>(), startNode.getPixelY<float>());\n\tsf::Vector2f endPoint3(endNode.getPixelX<float>(), endNode.getPixelY<float>());\n\tpheromoneWeakVertices.append(sf::Vertex(startPoint3, sf::Color(255, 195, 0)));\n\tpheromoneWeakVertices.append(sf::Vertex(endPoint3, sf::Color(255, 195, 0)));\n}\n\nNode* Edge::getNode1() const\n{\n\treturn startNode;\n}\n\nNode* Edge::getNode2() const\n{\n\treturn endNode;\n}\n\nNode* Edge::getOppositeNode(const Node& node) const\n{\n\tif (*startNode == node)\n\t{\n\t\treturn endNode;\n\t}\n\telse if (*endNode == node)\n\t{\n\t\treturn startNode;\n\t}\n\treturn nullptr;\n}\n\nNode* Edge::getOppositeNode(PathNode node) const\n{\n\treturn getOppositeNode(node.getNode());\n}\n\nfloat Edge::getCost() const\n{\n\treturn cost;\n}\n\nuint Edge::getPheromone() const\n{\n\treturn pheromone.getStrength();\n}\n\nvoid Edge::increasePheromone()\n{\n\tpheromone.increase();\n}\n\nvoid Edge::increasePheromoneToMax()\n{\n\tpheromone.increaseToMax();\n}\n\nvoid Edge::decreasePheromone()\n{\n\tpheromone.decrease();\n}\n\nvoid Edge::setPheromoneNextNode(Node& node, uint ticks)\n{\n\tpheromone.setNextNode(node, ticks);\n}\n\nuint Edge::getPheromoneNextNodeTickTime() const\n{\n\treturn pheromone.getNextNodeTickTime();\n}\n\nNode* Edge::getPheromoneNextNode() const\n{\n\treturn pheromone.getNextNode();\n}\n\nvoid Edge::update(uint ticks)\n{\n\tconst int pheromoneReducationRate = 100;\n\n\tif (ticks >= nextPheromoneReduction)\n\t{\n\t\tpheromone.decrease();\n\t\tnextPheromoneReduction += pheromoneReducationRate;\n\t}\n}\n\nvoid Edge::draw(sf::RenderTarget& target, sf::RenderStates states) const\n{\n\tif (endNode != nullptr)\n\t{\n\t\ttarget.draw(vertices, states);\n\t}\n}\n\nvoid Edge::draw(sf::RenderTarget &target, sf::RenderStates states, sf::Color color) const\n{\n\tusing namespace sf;\n\n\tif (endNode != nullptr)\n\t{\n\t\tVertexArray path;\n\t\tpath.setPrimitiveType(sf::Lines);\n\n\t\tpath.append(Vertex(Vector2f(startNode->getPixelX<float>(), startNode->getPixelY<float>()), color));\n\t\tpath.append(Vertex(Vector2f(endNode->getPixelX<float>(), endNode->getPixelY<float>()), color));\n\n\t\ttarget.draw(path, states);\n\t}\n}\n\nvoid Edge::drawPheromone(sf::RenderTarget& target, sf::RenderStates states)\n{\n\tauto pheromoneStrength = getPheromone();\n\t\n\tif (pheromoneStrength > 6)\n\t{\n\t\ttarget.draw(pheromoneStrongVertices, states);\n\t}\n\telse if (pheromoneStrength > 3)\n\t{\n\t\ttarget.draw(pheromoneMediumVertices, states);\n\t}\n\telse if (pheromoneStrength > 0)\n\t{\n\t\ttarget.draw(pheromoneWeakVertices, states);\n\t}\n}\n\nbool Edge::operator==(const Edge& other) const\n{\n\treturn (this->getCost() == other.getCost() &&\n\t\t\tthis->getNode1() == other.getNode1() &&\n\t\t\tthis->getNode2() == other.getNode2() &&\n\t\t\tthis->getPheromone() == other.getPheromone());\n}\n\nbool Edge::operator!=(const Edge& other) const\n{\n\treturn !(*this == other);\n}<|endoftext|>"} {"text":"<commit_before>\/\/ Petter Strandmark 2013.\n\/\/\n\/\/ The code in this file will be incorporated in the main API\n\/\/ when more compilers support C++14 generic lambdas.\n\/\/\n\n#include <cmath>\n#include <limits>\n#include <random>\n\n\/\/ Check if we’re using November 2013 CTP (or newer).\n#ifdef _MSC_FULL_VER\n\t#if _MSC_FULL_VER > 180021005 \/\/ 180021005 is RTM, I believe.\n\t\t#define USE_GENERIC_LAMBDAS\n\t#endif\n#endif\n\n#define CATCH_CONFIG_MAIN\n#include <catch.hpp>\n\n#ifdef USE_GENERIC_LAMBDAS\n\n#include <spii\/auto_diff_term.h>\n#include <spii\/solver.h>\n#include <spii\/transformations.h>\nusing namespace spii;\n\n\/\/ Creates a differentiable term from a generic lambda and\n\/\/ argument sizes.\n\/\/\n\/\/ Examples: \n\/\/\n\/\/\tauto lambda_a =\n\/\/\t\t[](auto x)\n\/\/\t\t{\n\/\/\t\t\tauto d0 = x[1] - x[0]*x[0];\n\/\/\t\t\tauto d1 = 1 - x[0];\n\/\/\t\t\treturn 100 * d0*d0 + d1*d1;\n\/\/\t\t};\n\/\/\n\/\/\tauto term_a = make_term<2>(lambda_a);\n\/\/\n\/\/\n\/\/\tauto lambda_b =\n\/\/\t\t[](auto x, auto y)\n\/\/\t\t{\n\/\/\t\t\tauto d0 = y[0] - x[0]*x[0];\n\/\/\t\t\tauto d1 = 1 - x[0];\n\/\/\t\t\treturn 100 * d0*d0 + d1*d1;\n\/\/\t\t};\n\/\/\n\/\/\tauto term_b = make_term<1, 1>(lambda);\n\/\/ \ntemplate<int... arg_sizes, typename GenericLambda>\nstd::shared_ptr<Term> make_term(const GenericLambda& lambda)\n{\n\ttypedef spii::AutoDiffTerm<GenericLambda, arg_sizes...> TermType;\n\treturn std::make_shared<TermType>(lambda);\n}\n\nTEST_CASE(\"make_term_2\")\n{\n\tFunction function;\n\tstd::vector<double> x = {0, 0};\n\t\n\tauto lambda =\n\t\t[](auto x)\n\t\t{\n\t\t\tauto d0 = x[1] - x[0]*x[0];\n\t\t\tauto d1 = 1 - x[0];\n\t\t\treturn 100 * d0*d0 + d1*d1;\n\t\t};\n\n\tauto term = make_term<2>(lambda);\n\n\tfunction.add_term(term, x.data());\n\n\tNewtonSolver solver;\n\tstd::stringstream sout;\n\tsolver.log_function =\n\t\t[&sout](auto str)\n\t\t{\n\t\t\tsout << str << std::endl;\n\t\t};\n\n\tSolverResults results;\n\tsolver.solve(function, &results);\n\tINFO(sout.str());\n\tCHECK(std::abs(x[0] - 1.0) < 1e-8);\n\tCHECK(std::abs(x[1] - 1.0) < 1e-8);\n\tCHECK(results.exit_success());\n}\n\nTEST_CASE(\"make_term_1_1\")\n{\n\tFunction function;\n\tdouble x;\n\tdouble y;\n\t\n\tauto lambda =\n\t\t[](auto x, auto y)\n\t\t{\n\t\t\tauto d0 = y[0] - x[0]*x[0];\n\t\t\tauto d1 = 1 - x[0];\n\t\t\treturn 100 * d0*d0 + d1*d1;\n\t\t};\n\n\tauto term = make_term<1, 1>(lambda);\n\n\tfunction.add_term(term, &x, &y);\n\n\tNewtonSolver solver;\n\tstd::stringstream sout;\n\tsolver.log_function =\n\t\t[&sout](auto str)\n\t\t{\n\t\t\tsout << str << std::endl;\n\t\t};\n\n\tSolverResults results;\n\tsolver.solve(function, &results);\n\tINFO(sout.str());\n\tCHECK(std::abs(x - 1.0) < 1e-8);\n\tCHECK(std::abs(y - 1.0) < 1e-8);\n\tCHECK(results.exit_success());\n}\n\n#endif \/\/ USE_GENERIC_LAMBDAS.\n<commit_msg>Test dynamic sizes for AutoDiffTerm with generic lambdas.<commit_after>\/\/ Petter Strandmark 2013.\n\/\/\n\/\/ The code in this file will be incorporated in the main API\n\/\/ when more compilers support C++14 generic lambdas.\n\/\/\n\n#include <cmath>\n#include <limits>\n#include <random>\n\n\/\/ Check if we’re using November 2013 CTP (or newer).\n#ifdef _MSC_FULL_VER\n\t#if _MSC_FULL_VER > 180021005 \/\/ 180021005 is RTM, I believe.\n\t\t#define USE_GENERIC_LAMBDAS\n\t#endif\n#endif\n\n#define CATCH_CONFIG_MAIN\n#include <catch.hpp>\n\n#ifdef USE_GENERIC_LAMBDAS\n\n#include <spii\/auto_diff_term.h>\n#include <spii\/dynamic_auto_diff_term.h>\n#include <spii\/solver.h>\n#include <spii\/transformations.h>\nusing namespace spii;\n\n\/\/ Creates a differentiable term from a generic lambda and\n\/\/ argument sizes.\n\/\/\n\/\/ Examples: \n\/\/\n\/\/\tauto lambda_a =\n\/\/\t\t[](auto x)\n\/\/\t\t{\n\/\/\t\t\tauto d0 = x[1] - x[0]*x[0];\n\/\/\t\t\tauto d1 = 1 - x[0];\n\/\/\t\t\treturn 100 * d0*d0 + d1*d1;\n\/\/\t\t};\n\/\/\n\/\/\tauto term_a = make_term<2>(lambda_a);\n\/\/\n\/\/\n\/\/\tauto lambda_b =\n\/\/\t\t[](auto x, auto y)\n\/\/\t\t{\n\/\/\t\t\tauto d0 = y[0] - x[0]*x[0];\n\/\/\t\t\tauto d1 = 1 - x[0];\n\/\/\t\t\treturn 100 * d0*d0 + d1*d1;\n\/\/\t\t};\n\/\/\n\/\/\tauto term_b = make_term<1, 1>(lambda);\n\/\/ \ntemplate<int... arg_sizes, typename GenericLambda, typename... Ints>\nstd::shared_ptr<Term> make_term(const GenericLambda& lambda, Ints... dimensions)\n{\n\ttypedef spii::AutoDiffTerm<GenericLambda, arg_sizes...> TermType;\n\treturn std::make_shared<TermType>(dimensions..., lambda);\n}\n\nTEST_CASE(\"make_term_2\")\n{\n\tFunction function;\n\tstd::vector<double> x = {0, 0};\n\t\n\tauto lambda =\n\t\t[](auto x)\n\t\t{\n\t\t\tauto d0 = x[1] - x[0]*x[0];\n\t\t\tauto d1 = 1 - x[0];\n\t\t\treturn 100 * d0*d0 + d1*d1;\n\t\t};\n\n\tauto term = make_term<2>(lambda);\n\n\tfunction.add_term(term, x.data());\n\n\tNewtonSolver solver;\n\tstd::stringstream sout;\n\tsolver.log_function =\n\t\t[&sout](auto str)\n\t\t{\n\t\t\tsout << str << std::endl;\n\t\t};\n\n\tSolverResults results;\n\tsolver.solve(function, &results);\n\tINFO(sout.str());\n\tCHECK(std::abs(x[0] - 1.0) < 1e-8);\n\tCHECK(std::abs(x[1] - 1.0) < 1e-8);\n\tCHECK(results.exit_success());\n}\n\nTEST_CASE(\"make_term_1_1\")\n{\n\tFunction function;\n\tdouble x;\n\tdouble y;\n\t\n\tauto lambda =\n\t\t[](auto x, auto y)\n\t\t{\n\t\t\tauto d0 = y[0] - x[0]*x[0];\n\t\t\tauto d1 = 1 - x[0];\n\t\t\treturn 100 * d0*d0 + d1*d1;\n\t\t};\n\n\tauto term = make_term<1, 1>(lambda);\n\n\tfunction.add_term(term, &x, &y);\n\n\tNewtonSolver solver;\n\tstd::stringstream sout;\n\tsolver.log_function =\n\t\t[&sout](auto str)\n\t\t{\n\t\t\tsout << str << std::endl;\n\t\t};\n\n\tSolverResults results;\n\tsolver.solve(function, &results);\n\tINFO(sout.str());\n\tCHECK(std::abs(x - 1.0) < 1e-8);\n\tCHECK(std::abs(y - 1.0) < 1e-8);\n\tCHECK(results.exit_success());\n}\n\nTEST_CASE(\"make_dynamic_term_1_1\")\n{\n\tFunction function;\n\tdouble x;\n\tdouble y;\n\n\tauto lambda =\n\t\t[](auto x, auto y)\n\t{\n\t\tauto d0 = y[0] - x[0] * x[0];\n\t\tauto d1 = 1 - x[0];\n\t\treturn 100 * d0*d0 + d1*d1;\n\t};\n\n\tauto term = make_term<Dynamic, Dynamic>(lambda, 1, 1);\n\n\tfunction.add_term(term, &x, &y);\n\n\tNewtonSolver solver;\n\tstd::stringstream sout;\n\tsolver.log_function =\n\t\t[&sout](auto str)\n\t{\n\t\tsout << str << std::endl;\n\t};\n\n\tSolverResults results;\n\tsolver.solve(function, &results);\n\tINFO(sout.str());\n\tCHECK(std::abs(x - 1.0) < 1e-8);\n\tCHECK(std::abs(y - 1.0) < 1e-8);\n\tCHECK(results.exit_success());\n}\n\n#endif \/\/ USE_GENERIC_LAMBDAS.\n<|endoftext|>"} {"text":"<commit_before>\/\/ @(#)root\/thread:$Id$\n\/\/ Author: Xavier Valls March 2016\n\n\/*************************************************************************\n * Copyright (C) 1995-2006, Rene Brun and Fons Rademakers. *\n * All rights reserved. *\n * *\n * For the licensing terms see $ROOTSYS\/LICENSE. *\n * For the list of contributors see $ROOTSYS\/README\/CREDITS. *\n *************************************************************************\/\n\n#ifndef ROOT_TThreadExecutor\n#define ROOT_TThreadExecutor\n\n#include \"RConfigure.h\"\n\n\/\/ exclude in case ROOT does not have IMT support\n#ifndef R__USE_IMT\n\/\/ No need to error out for dictionaries.\n# if !defined(__ROOTCLING__) && !defined(G__DICTIONARY)\n# error \"Cannot use ROOT::TThreadExecutor without defining R__USE_IMT.\"\n# endif\n#else\n\n#include \"ROOT\/TExecutor.hxx\"\n#include <functional>\n#include <memory>\n#include <numeric>\n\nnamespace tbb { class task_scheduler_init;}\n\nnamespace ROOT {\n\nclass TThreadExecutor: public TExecutor<TThreadExecutor> {\ntemplate<class T>\nfriend class ParallelReductionResolver;\n\npublic:\n explicit TThreadExecutor();\n\n explicit TThreadExecutor(size_t nThreads);\n\n TThreadExecutor(TThreadExecutor &) = delete;\n TThreadExecutor & operator=(TThreadExecutor &) = delete;\n\n ~TThreadExecutor();\n\n template<class F, class Cond = noReferenceCond<F>>\n auto Map(F func, unsigned nTimes) -> std::vector<typename std::result_of<F()>::type>;\n \/\/\/ \\cond\n template<class F, class INTEGER, class Cond = noReferenceCond<F, INTEGER>>\n auto Map(F func, ROOT::TSeq<INTEGER> args) -> std::vector<typename std::result_of<F(INTEGER)>::type>;\n template<class F, class T, class Cond = noReferenceCond<F, T>>\n auto Map(F func, std::vector<T> &args) -> std::vector<typename std::result_of<F(T)>::type>;\n \/\/ \/ \\endcond\n using TExecutor<TThreadExecutor>::Map;\n\n \/\/ \/\/ MapReduce\n \/\/ \/\/ the late return types also check at compile-time whether redfunc is compatible with func,\n \/\/ \/\/ other than checking that func is compatible with the type of arguments.\n \/\/ \/\/ a static_assert check in TThreadExecutor::Reduce is used to check that redfunc is compatible with the type returned by func\n template<class F, class R, class Cond = noReferenceCond<F>>\n auto MapReduce(F func, unsigned nTimes, R redfunc, unsigned nChunks) -> typename std::result_of<F()>::type;\n template<class F, class INTEGER, class R, class Cond = noReferenceCond<F, INTEGER>>\n auto MapReduce(F func, ROOT::TSeq<INTEGER> args, R redfunc, unsigned nChunks) -> typename std::result_of<F(INTEGER)>::type;\n \/\/ \/\/\/ \\cond doxygen should ignore these methods\n template<class F, class T, class R, class Cond = noReferenceCond<F, T>>\n auto MapReduce(F func, std::initializer_list<T> args, R redfunc, unsigned nChunks) -> typename std::result_of<F(T)>::type;\n template<class F, class T, class R, class Cond = noReferenceCond<F, T>>\n auto MapReduce(F func, std::vector<T> &args, R redfunc, unsigned nChunks) -> typename std::result_of<F(T)>::type;\n \/\/ \/\/\/ \\endcond\n using TExecutor<TThreadExecutor>::MapReduce;\n \n template<class T, class BINARYOP> auto Reduce(const std::vector<T> &objs, BINARYOP redfunc) -> decltype(redfunc(objs.front(), objs.front()));\n template<class T, class R> auto Reduce(const std::vector<T> &objs, R redfunc) -> decltype(redfunc(objs));\n using TExecutor<TThreadExecutor>::Reduce;\n\nprotected:\n\n template<class F, class R, class Cond = noReferenceCond<F>>\n auto Map(F func, unsigned nTimes, R redfunc, unsigned nChunks) -> std::vector<typename std::result_of<F()>::type>;\n template<class F, class INTEGER, class R, class Cond = noReferenceCond<F, INTEGER>>\n auto Map(F func, ROOT::TSeq<INTEGER> args, R redfunc, unsigned nChunks) -> std::vector<typename std::result_of<F(INTEGER)>::type>;\n template<class F, class T, class R, class Cond = noReferenceCond<F, T>>\n auto Map(F func, std::vector<T> &args, R redfunc, unsigned nChunks) -> std::vector<typename std::result_of<F(T)>::type>;\n template<class F, class T, class R, class Cond = noReferenceCond<F, T>>\n auto Map(F func, std::initializer_list<T> args, R redfunc, unsigned nChunks) -> std::vector<typename std::result_of<F(T)>::type>;\n\nprivate:\n void ParallelFor(unsigned start, unsigned end, unsigned step, const std::function<void(unsigned int i)> &f);\n double ParallelReduce(const std::vector<double> &objs, const std::function<double(double a, double b)> &redfunc);\n float ParallelReduce(const std::vector<float> &objs, const std::function<float(float a, float b)> &redfunc);\n template<class T, class R> \n auto SeqReduce(const std::vector<T> &objs, R redfunc) -> decltype(redfunc(objs));\n\n std::unique_ptr<tbb::task_scheduler_init> fInitTBB;\n};\n\n\/************ TEMPLATE METHODS IMPLEMENTATION ******************\/\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\/ Execute func (with no arguments) nTimes in parallel.\n\/\/\/ A vector containg executions' results is returned.\n\/\/\/ Functions that take more than zero arguments can be executed (with\n\/\/\/ fixed arguments) by wrapping them in a lambda or with std::bind.\ntemplate<class F, class Cond>\nauto TThreadExecutor::Map(F func, unsigned nTimes) -> std::vector<typename std::result_of<F()>::type>\n{\n using retType = decltype(func());\n std::vector<retType> reslist(nTimes);\n auto lambda = [&](unsigned int i){\n reslist[i] = func();\n };\n ParallelFor(0U, nTimes, 1, lambda);\n\n return reslist;\n}\n\ntemplate<class F, class R, class Cond>\nauto TThreadExecutor::Map(F func, unsigned nTimes, R redfunc, unsigned nChunks) -> std::vector<typename std::result_of<F()>::type>\n{\n if(nChunks == 0){\n return Map(func, nTimes);\n }\n\n using retType = decltype(func());\n std::vector<retType> reslist(nChunks);\n unsigned step = nChunks==0? 1 : (nTimes+nChunks-1)\/nChunks;\n auto lambda = [&](unsigned int i){\n std::vector<retType> partialResults(step);\n for(unsigned j=0; j<step && (i+j)<nTimes; j++){\n partialResults[j] = func();\n }\n reslist[i\/step]=redfunc(partialResults);\n };\n ParallelFor(0U, nTimes, step, lambda);\n\n return reslist;\n}\n\ntemplate<class F, class INTEGER, class Cond>\nauto TThreadExecutor::Map(F func, ROOT::TSeq<INTEGER> args) -> std::vector<typename std::result_of<F(INTEGER)>::type>\n{\n unsigned start = *args.begin();\n unsigned end = *args.end();\n\n using retType = decltype(func(start));\n std::vector<retType> reslist(end-start);\n auto lambda = [&](unsigned int i){\n reslist[i]+=func(i);\n };\n ParallelFor(start, end, 1, lambda);\n\n return reslist;\n}\n\ntemplate<class F, class INTEGER, class R, class Cond>\nauto TThreadExecutor::Map(F func, ROOT::TSeq<INTEGER> args, R redfunc, unsigned nChunks) -> std::vector<typename std::result_of<F(INTEGER)>::type>\n{\n if(nChunks == 0){\n return Map(func, args);\n }\n\n unsigned start = *args.begin();\n unsigned end = *args.end();\n unsigned step = nChunks==0? 1 :(end-start+nChunks-1)\/nChunks; \/\/ceiling the division\n\n using retType = decltype(func(start));\n std::vector<retType> reslist(nChunks);\n auto lambda = [&](unsigned int i){\n std::vector<retType> partialResults(step);\n for(unsigned j=0; j<step && (i+j)<end; j++){\n partialResults[j] = func(i+j);\n }\n reslist[i\/step]=redfunc(partialResults);\n };\n ParallelFor(start, end, step, lambda);\n\n return reslist;\n}\n\n\n\/\/ tell doxygen to ignore this (\\endcond closes the statement)\n\/\/\/ \\cond\n\n\/\/ actual implementation of the Map method. all other calls with arguments eventually\n\/\/ call this one\ntemplate<class F, class T, class Cond>\nauto TThreadExecutor::Map(F func, std::vector<T> &args) -> std::vector<typename std::result_of<F(T)>::type>\n{\n \/\/ \/\/check whether func is callable\n using retType = decltype(func(args.front()));\n\n unsigned int fNToProcess = args.size();\n std::vector<retType> reslist(fNToProcess);\n\n auto lambda = [&](unsigned int i){\n reslist[i] = func(args[i]);\n };\n\n ParallelFor(0U, fNToProcess, 1, lambda);\n\n return reslist;\n}\n\ntemplate<class F, class T, class R, class Cond>\nauto TThreadExecutor::Map(F func, std::vector<T> &args, R redfunc, unsigned nChunks) -> std::vector<typename std::result_of<F(T)>::type>\n{\n if(nChunks == 0){\n return Map(func, args);\n }\n \/\/ \/\/check whether func is callable\n using retType = decltype(func(args.front()));\n\n unsigned int fNToProcess = args.size();\n std::vector<retType> reslist(nChunks);\n unsigned step = (fNToProcess+nChunks-1)\/nChunks; \/\/ceiling the division\n\n auto lambda = [&](unsigned int i){\n std::vector<T> partialResults(step);\n for(unsigned j=0; j<step && (i+j)<fNToProcess; j++){\n partialResults[j] = func(args[i+j]);\n }\n reslist[i\/step]=redfunc(partialResults);\n };\n\n ParallelFor(0U, fNToProcess, step, lambda);\n\n return reslist;\n}\n\n\ntemplate<class F, class T, class R, class Cond>\nauto TThreadExecutor::Map(F func, std::initializer_list<T> args, R redfunc, unsigned nChunks) -> std::vector<typename std::result_of<F(T)>::type>\n{\n std::vector<T> vargs(std::move(args));\n const auto &reslist = Map(func, vargs, redfunc, nChunks);\n return reslist;\n}\n\n\/\/ \/\/ tell doxygen to stop ignoring code\n\/\/ \/\/\/ \\endcond\n\n\/\/ \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ \/\/\/ This method behaves just like Map, but an additional redfunc function\n\/\/ \/\/\/ must be provided. redfunc is applied to the vector Map would return and\n\/\/ \/\/\/ must return the same type as func. In practice, redfunc can be used to\n\/\/ \/\/\/ \"squash\" the vector returned by Map into a single object by merging,\n\/\/ \/\/\/ adding, mixing the elements of the vector.\ntemplate<class F, class R, class Cond>\nauto TThreadExecutor::MapReduce(F func, unsigned nTimes, R redfunc, unsigned nChunks) -> typename std::result_of<F()>::type\n{\n return Reduce(Map(func, nTimes, redfunc, nChunks), redfunc);\n}\n\n\/\/\/ \\cond doxygen should ignore these methods\ntemplate<class F, class INTEGER, class R, class Cond>\nauto TThreadExecutor::MapReduce(F func, ROOT::TSeq<INTEGER> args, R redfunc, unsigned nChunks) -> typename std::result_of<F(INTEGER)>::type\n{\n return Reduce(Map(func, args, redfunc, nChunks), redfunc);\n}\n\ntemplate<class F, class T, class R, class Cond>\nauto TThreadExecutor::MapReduce(F func, std::initializer_list<T> args, R redfunc, unsigned nChunks) -> typename std::result_of<F(T)>::type\n{\n return Reduce(Map(func, args, redfunc, nChunks), redfunc);\n}\n\ntemplate<class F, class T, class R, class Cond>\nauto TThreadExecutor::MapReduce(F func, std::vector<T> &args, R redfunc, unsigned nChunks) -> typename std::result_of<F(T)>::type\n{\n return Reduce(Map(func, args, redfunc, nChunks), redfunc);\n}\n\n\/\/\/ Check that redfunc has the right signature and call it on objs\ntemplate<class T, class BINARYOP>\nauto TThreadExecutor::Reduce(const std::vector<T> &objs, BINARYOP redfunc) -> decltype(redfunc(objs.front(), objs.front()))\n{\n \/\/ check we can apply reduce to objs\n static_assert(std::is_same<decltype(redfunc(objs.front(), objs.front())), T>::value, \"redfunc does not have the correct signature\");\n return ParallelReduce(objs, redfunc);\n}\n\ntemplate<class T, class R>\nauto TThreadExecutor::Reduce(const std::vector<T> &objs, R redfunc) -> decltype(redfunc(objs))\n{\n \/\/ check we can apply reduce to objs\n static_assert(std::is_same<decltype(redfunc(objs)), T>::value, \"redfunc does not have the correct signature\");\n return SeqReduce(objs, redfunc);\n}\n\ntemplate<class T, class R>\nauto TThreadExecutor::SeqReduce(const std::vector<T> &objs, R redfunc) -> decltype(redfunc(objs))\n{\n return redfunc(objs);\n}\n\n} \/\/ namespace ROOT\n\n#endif \/\/ R__USE_IMT\n#endif\n<commit_msg>Fix storing mapped elements in TThreadExecutor<commit_after>\/\/ @(#)root\/thread:$Id$\n\/\/ Author: Xavier Valls March 2016\n\n\/*************************************************************************\n * Copyright (C) 1995-2006, Rene Brun and Fons Rademakers. *\n * All rights reserved. *\n * *\n * For the licensing terms see $ROOTSYS\/LICENSE. *\n * For the list of contributors see $ROOTSYS\/README\/CREDITS. *\n *************************************************************************\/\n\n#ifndef ROOT_TThreadExecutor\n#define ROOT_TThreadExecutor\n\n#include \"RConfigure.h\"\n\n\/\/ exclude in case ROOT does not have IMT support\n#ifndef R__USE_IMT\n\/\/ No need to error out for dictionaries.\n# if !defined(__ROOTCLING__) && !defined(G__DICTIONARY)\n# error \"Cannot use ROOT::TThreadExecutor without defining R__USE_IMT.\"\n# endif\n#else\n\n#include \"ROOT\/TExecutor.hxx\"\n#include <functional>\n#include <memory>\n#include <numeric>\n\nnamespace tbb { class task_scheduler_init;}\n\nnamespace ROOT {\n\nclass TThreadExecutor: public TExecutor<TThreadExecutor> {\ntemplate<class T>\nfriend class ParallelReductionResolver;\n\npublic:\n explicit TThreadExecutor();\n\n explicit TThreadExecutor(size_t nThreads);\n\n TThreadExecutor(TThreadExecutor &) = delete;\n TThreadExecutor & operator=(TThreadExecutor &) = delete;\n\n ~TThreadExecutor();\n\n template<class F, class Cond = noReferenceCond<F>>\n auto Map(F func, unsigned nTimes) -> std::vector<typename std::result_of<F()>::type>;\n \/\/\/ \\cond\n template<class F, class INTEGER, class Cond = noReferenceCond<F, INTEGER>>\n auto Map(F func, ROOT::TSeq<INTEGER> args) -> std::vector<typename std::result_of<F(INTEGER)>::type>;\n template<class F, class T, class Cond = noReferenceCond<F, T>>\n auto Map(F func, std::vector<T> &args) -> std::vector<typename std::result_of<F(T)>::type>;\n \/\/ \/ \\endcond\n using TExecutor<TThreadExecutor>::Map;\n\n \/\/ \/\/ MapReduce\n \/\/ \/\/ the late return types also check at compile-time whether redfunc is compatible with func,\n \/\/ \/\/ other than checking that func is compatible with the type of arguments.\n \/\/ \/\/ a static_assert check in TThreadExecutor::Reduce is used to check that redfunc is compatible with the type returned by func\n template<class F, class R, class Cond = noReferenceCond<F>>\n auto MapReduce(F func, unsigned nTimes, R redfunc, unsigned nChunks) -> typename std::result_of<F()>::type;\n template<class F, class INTEGER, class R, class Cond = noReferenceCond<F, INTEGER>>\n auto MapReduce(F func, ROOT::TSeq<INTEGER> args, R redfunc, unsigned nChunks) -> typename std::result_of<F(INTEGER)>::type;\n \/\/ \/\/\/ \\cond doxygen should ignore these methods\n template<class F, class T, class R, class Cond = noReferenceCond<F, T>>\n auto MapReduce(F func, std::initializer_list<T> args, R redfunc, unsigned nChunks) -> typename std::result_of<F(T)>::type;\n template<class F, class T, class R, class Cond = noReferenceCond<F, T>>\n auto MapReduce(F func, std::vector<T> &args, R redfunc, unsigned nChunks) -> typename std::result_of<F(T)>::type;\n \/\/ \/\/\/ \\endcond\n using TExecutor<TThreadExecutor>::MapReduce;\n \n template<class T, class BINARYOP> auto Reduce(const std::vector<T> &objs, BINARYOP redfunc) -> decltype(redfunc(objs.front(), objs.front()));\n template<class T, class R> auto Reduce(const std::vector<T> &objs, R redfunc) -> decltype(redfunc(objs));\n using TExecutor<TThreadExecutor>::Reduce;\n\nprotected:\n\n template<class F, class R, class Cond = noReferenceCond<F>>\n auto Map(F func, unsigned nTimes, R redfunc, unsigned nChunks) -> std::vector<typename std::result_of<F()>::type>;\n template<class F, class INTEGER, class R, class Cond = noReferenceCond<F, INTEGER>>\n auto Map(F func, ROOT::TSeq<INTEGER> args, R redfunc, unsigned nChunks) -> std::vector<typename std::result_of<F(INTEGER)>::type>;\n template<class F, class T, class R, class Cond = noReferenceCond<F, T>>\n auto Map(F func, std::vector<T> &args, R redfunc, unsigned nChunks) -> std::vector<typename std::result_of<F(T)>::type>;\n template<class F, class T, class R, class Cond = noReferenceCond<F, T>>\n auto Map(F func, std::initializer_list<T> args, R redfunc, unsigned nChunks) -> std::vector<typename std::result_of<F(T)>::type>;\n\nprivate:\n void ParallelFor(unsigned start, unsigned end, unsigned step, const std::function<void(unsigned int i)> &f);\n double ParallelReduce(const std::vector<double> &objs, const std::function<double(double a, double b)> &redfunc);\n float ParallelReduce(const std::vector<float> &objs, const std::function<float(float a, float b)> &redfunc);\n template<class T, class R> \n auto SeqReduce(const std::vector<T> &objs, R redfunc) -> decltype(redfunc(objs));\n\n std::unique_ptr<tbb::task_scheduler_init> fInitTBB;\n};\n\n\/************ TEMPLATE METHODS IMPLEMENTATION ******************\/\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\/ Execute func (with no arguments) nTimes in parallel.\n\/\/\/ A vector containg executions' results is returned.\n\/\/\/ Functions that take more than zero arguments can be executed (with\n\/\/\/ fixed arguments) by wrapping them in a lambda or with std::bind.\ntemplate<class F, class Cond>\nauto TThreadExecutor::Map(F func, unsigned nTimes) -> std::vector<typename std::result_of<F()>::type>\n{\n using retType = decltype(func());\n std::vector<retType> reslist(nTimes);\n auto lambda = [&](unsigned int i){\n reslist[i] = func();\n };\n ParallelFor(0U, nTimes, 1, lambda);\n\n return reslist;\n}\n\ntemplate<class F, class R, class Cond>\nauto TThreadExecutor::Map(F func, unsigned nTimes, R redfunc, unsigned nChunks) -> std::vector<typename std::result_of<F()>::type>\n{\n if(nChunks == 0){\n return Map(func, nTimes);\n }\n\n using retType = decltype(func());\n std::vector<retType> reslist(nChunks);\n unsigned step = nChunks==0? 1 : (nTimes+nChunks-1)\/nChunks;\n auto lambda = [&](unsigned int i){\n std::vector<retType> partialResults(step);\n for(unsigned j=0; j<step && (i+j)<nTimes; j++){\n partialResults[j] = func();\n }\n reslist[i\/step]=redfunc(partialResults);\n };\n ParallelFor(0U, nTimes, step, lambda);\n\n return reslist;\n}\n\ntemplate<class F, class INTEGER, class Cond>\nauto TThreadExecutor::Map(F func, ROOT::TSeq<INTEGER> args) -> std::vector<typename std::result_of<F(INTEGER)>::type>\n{\n unsigned start = *args.begin();\n unsigned end = *args.end();\n\n using retType = decltype(func(start));\n std::vector<retType> reslist(end-start);\n auto lambda = [&](unsigned int i){\n reslist[i] = func(i);\n };\n ParallelFor(start, end, 1, lambda);\n\n return reslist;\n}\n\ntemplate<class F, class INTEGER, class R, class Cond>\nauto TThreadExecutor::Map(F func, ROOT::TSeq<INTEGER> args, R redfunc, unsigned nChunks) -> std::vector<typename std::result_of<F(INTEGER)>::type>\n{\n if(nChunks == 0){\n return Map(func, args);\n }\n\n unsigned start = *args.begin();\n unsigned end = *args.end();\n unsigned step = nChunks==0? 1 :(end-start+nChunks-1)\/nChunks; \/\/ceiling the division\n\n using retType = decltype(func(start));\n std::vector<retType> reslist(nChunks);\n auto lambda = [&](unsigned int i){\n std::vector<retType> partialResults(step);\n for(unsigned j=0; j<step && (i+j)<end; j++){\n partialResults[j] = func(i+j);\n }\n reslist[i\/step]=redfunc(partialResults);\n };\n ParallelFor(start, end, step, lambda);\n\n return reslist;\n}\n\n\n\/\/ tell doxygen to ignore this (\\endcond closes the statement)\n\/\/\/ \\cond\n\n\/\/ actual implementation of the Map method. all other calls with arguments eventually\n\/\/ call this one\ntemplate<class F, class T, class Cond>\nauto TThreadExecutor::Map(F func, std::vector<T> &args) -> std::vector<typename std::result_of<F(T)>::type>\n{\n \/\/ \/\/check whether func is callable\n using retType = decltype(func(args.front()));\n\n unsigned int fNToProcess = args.size();\n std::vector<retType> reslist(fNToProcess);\n\n auto lambda = [&](unsigned int i){\n reslist[i] = func(args[i]);\n };\n\n ParallelFor(0U, fNToProcess, 1, lambda);\n\n return reslist;\n}\n\ntemplate<class F, class T, class R, class Cond>\nauto TThreadExecutor::Map(F func, std::vector<T> &args, R redfunc, unsigned nChunks) -> std::vector<typename std::result_of<F(T)>::type>\n{\n if(nChunks == 0){\n return Map(func, args);\n }\n \/\/ \/\/check whether func is callable\n using retType = decltype(func(args.front()));\n\n unsigned int fNToProcess = args.size();\n std::vector<retType> reslist(nChunks);\n unsigned step = (fNToProcess+nChunks-1)\/nChunks; \/\/ceiling the division\n\n auto lambda = [&](unsigned int i){\n std::vector<T> partialResults(step);\n for(unsigned j=0; j<step && (i+j)<fNToProcess; j++){\n partialResults[j] = func(args[i+j]);\n }\n reslist[i\/step]=redfunc(partialResults);\n };\n\n ParallelFor(0U, fNToProcess, step, lambda);\n\n return reslist;\n}\n\n\ntemplate<class F, class T, class R, class Cond>\nauto TThreadExecutor::Map(F func, std::initializer_list<T> args, R redfunc, unsigned nChunks) -> std::vector<typename std::result_of<F(T)>::type>\n{\n std::vector<T> vargs(std::move(args));\n const auto &reslist = Map(func, vargs, redfunc, nChunks);\n return reslist;\n}\n\n\/\/ \/\/ tell doxygen to stop ignoring code\n\/\/ \/\/\/ \\endcond\n\n\/\/ \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ \/\/\/ This method behaves just like Map, but an additional redfunc function\n\/\/ \/\/\/ must be provided. redfunc is applied to the vector Map would return and\n\/\/ \/\/\/ must return the same type as func. In practice, redfunc can be used to\n\/\/ \/\/\/ \"squash\" the vector returned by Map into a single object by merging,\n\/\/ \/\/\/ adding, mixing the elements of the vector.\ntemplate<class F, class R, class Cond>\nauto TThreadExecutor::MapReduce(F func, unsigned nTimes, R redfunc, unsigned nChunks) -> typename std::result_of<F()>::type\n{\n return Reduce(Map(func, nTimes, redfunc, nChunks), redfunc);\n}\n\n\/\/\/ \\cond doxygen should ignore these methods\ntemplate<class F, class INTEGER, class R, class Cond>\nauto TThreadExecutor::MapReduce(F func, ROOT::TSeq<INTEGER> args, R redfunc, unsigned nChunks) -> typename std::result_of<F(INTEGER)>::type\n{\n return Reduce(Map(func, args, redfunc, nChunks), redfunc);\n}\n\ntemplate<class F, class T, class R, class Cond>\nauto TThreadExecutor::MapReduce(F func, std::initializer_list<T> args, R redfunc, unsigned nChunks) -> typename std::result_of<F(T)>::type\n{\n return Reduce(Map(func, args, redfunc, nChunks), redfunc);\n}\n\ntemplate<class F, class T, class R, class Cond>\nauto TThreadExecutor::MapReduce(F func, std::vector<T> &args, R redfunc, unsigned nChunks) -> typename std::result_of<F(T)>::type\n{\n return Reduce(Map(func, args, redfunc, nChunks), redfunc);\n}\n\n\/\/\/ Check that redfunc has the right signature and call it on objs\ntemplate<class T, class BINARYOP>\nauto TThreadExecutor::Reduce(const std::vector<T> &objs, BINARYOP redfunc) -> decltype(redfunc(objs.front(), objs.front()))\n{\n \/\/ check we can apply reduce to objs\n static_assert(std::is_same<decltype(redfunc(objs.front(), objs.front())), T>::value, \"redfunc does not have the correct signature\");\n return ParallelReduce(objs, redfunc);\n}\n\ntemplate<class T, class R>\nauto TThreadExecutor::Reduce(const std::vector<T> &objs, R redfunc) -> decltype(redfunc(objs))\n{\n \/\/ check we can apply reduce to objs\n static_assert(std::is_same<decltype(redfunc(objs)), T>::value, \"redfunc does not have the correct signature\");\n return SeqReduce(objs, redfunc);\n}\n\ntemplate<class T, class R>\nauto TThreadExecutor::SeqReduce(const std::vector<T> &objs, R redfunc) -> decltype(redfunc(objs))\n{\n return redfunc(objs);\n}\n\n} \/\/ namespace ROOT\n\n#endif \/\/ R__USE_IMT\n#endif\n<|endoftext|>"} {"text":"<commit_before>#include \"line.hpp\"\n\n\/\/ Include standard headers\n#include <cmath> \/\/ NAN, std::isnan, std::pow\n#include <string> \/\/ std::string\n#include <vector> \/\/ std::vector\n\nnamespace geometry\n{\n \/\/ constructor.\n \/\/ can be used for creating n-dimensional lines.\n Line::Line(const std::vector<float> point1, const std::vector<float> point2)\n {\n if (point1 == point2 || point1.size() != point2.size())\n {\n this->is_valid = false; \/\/ two identical points do not define a line.\n this->general_form_coefficients.push_back(NAN);\n this->general_form_constant = NAN;\n }\n else\n {\n this->is_valid = true; \/\/ two distinct points define a line.\n this->are_points_defined = true;\n this->point1 = point1;\n this->point2 = point2;\n }\n }\n\n \/\/ constructor.\n \/\/ can be used for creating n-dimensional lines.\n Line::Line(const std::vector<float> general_form_coefficients, const float general_form_constant)\n {\n this->general_form_coefficients = general_form_coefficients;\n this->general_form_constant = general_form_constant;\n }\n\n std::string Line::get_general_form_equation()\n {\n \/\/ TODO: implement this function!\n std::string line_equation;\n return line_equation;\n }\n}\n<commit_msg>Bugfix `Line::Line`: always initialize `general_form_constant`.<commit_after>#include \"line.hpp\"\n\n\/\/ Include standard headers\n#include <cmath> \/\/ NAN, std::isnan, std::pow\n#include <string> \/\/ std::string\n#include <vector> \/\/ std::vector\n\nnamespace geometry\n{\n \/\/ constructor.\n \/\/ can be used for creating n-dimensional lines.\n Line::Line(const std::vector<float> point1, const std::vector<float> point2)\n {\n this->general_form_constant = NAN;\n\n if (point1 == point2 || point1.size() != point2.size())\n {\n this->is_valid = false; \/\/ two identical points do not define a line.\n this->general_form_coefficients.push_back(NAN);\n }\n else\n {\n this->is_valid = true; \/\/ two distinct points define a line.\n this->are_points_defined = true;\n this->point1 = point1;\n this->point2 = point2;\n }\n }\n\n \/\/ constructor.\n \/\/ can be used for creating n-dimensional lines.\n Line::Line(const std::vector<float> general_form_coefficients, const float general_form_constant)\n {\n this->general_form_coefficients = general_form_coefficients;\n this->general_form_constant = general_form_constant;\n }\n\n std::string Line::get_general_form_equation()\n {\n \/\/ TODO: implement this function!\n std::string line_equation;\n return line_equation;\n }\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 <iostream>\n#include <Chaos\/Memory\/MemoryPool.h>\n#include \"object.h\"\n#include \"ref_memory.h\"\n\nnamespace gc {\n\nvoid* RefMemory::alloc(std::size_t n) {\n return Chaos::MemoryPool::get_instance().alloc(n);\n}\n\nvoid RefMemory::dealloc(BaseObject* obj) {\n if (obj->is_int())\n Chaos::MemoryPool::get_instance().dealloc(obj, sizeof(Int));\n else if (obj->is_pair())\n Chaos::MemoryPool::get_instance().dealloc(obj, sizeof(Pair));\n}\n\nvoid RefMemory::inc(BaseObject* ref) {\n if (ref != nullptr)\n inc_objects_.push(ref);\n}\n\nvoid RefMemory::dec(BaseObject* ref) {\n if (ref != nullptr)\n dec_objects_.push(ref);\n}\n\nvoid RefMemory::write(BaseObject* target, BaseObject* obj, bool is_first) {\n \/\/ only for pair object\n auto* pair = as_pair(target);\n inc(obj);\n if (is_first) {\n dec(pair->first());\n pair->set_first(obj);\n }\n else {\n dec(pair->second());\n pair->set_second(obj);\n }\n}\n\nvoid RefMemory::apply_increments(void) {\n while (!inc_objects_.empty()) {\n auto* obj = inc_objects_.top();\n inc_objects_.pop();\n obj->inc_ref();\n }\n}\n\nvoid RefMemory::scan_counting(void) {\n while (!dec_objects_.empty()) {\n auto* obj = dec_objects_.top();\n dec_objects_.pop();\n if (obj->dec_def() == 0 && obj->is_pair()) {\n auto append_fn = [this](BaseObject* ob) {\n if (ob != nullptr)\n dec_objects_.push(ob);\n };\n\n append_fn(as_pair(obj)->first());\n append_fn(as_pair(obj)->second());\n }\n }\n}\n\nvoid RefMemory::sweep_counting(void) {\n for (auto it = objects_.begin(); it != objects_.end();) {\n if ((*it)->ref() == 0) {\n dealloc(*it);\n objects_.erase(it++);\n }\n else {\n ++it;\n }\n }\n}\n\nRefMemory& RefMemory::get_instance(void) {\n static RefMemory ins;\n return ins;\n}\n\nvoid RefMemory::collect_counting(void) {\n auto old_count = objects_.size();\n\n apply_increments();\n scan_counting();\n sweep_counting();\n\n std::cout\n << \"[\" << old_count - objects_.size() << \"] objects collected, \"\n << \"[\" << objects_.size() << \"] objects remaining.\" << std::endl;\n}\n\nBaseObject* RefMemory::create_int(int value) {\n if (objects_.size() >= kMaxObjects)\n collect_counting();\n\n auto* obj = new (alloc(sizeof(Int))) Int();\n obj->set_value(value);\n\n roots_.push_back(obj);\n objects_.push_back(obj);\n inc(obj);\n\n return obj;\n}\n\nBaseObject* RefMemory::create_pair(BaseObject* first, BaseObject* second) {\n if (objects_.size() >= kMaxObjects)\n collect_counting();\n\n auto* obj = new (alloc(sizeof(Pair))) Pair();\n if (first != nullptr)\n write(obj->first(), first, true);\n if (second != nullptr)\n write(obj->second(), second, false);\n\n roots_.push_back(obj);\n objects_.push_back(obj);\n inc(obj);\n\n return obj;\n}\n\nBaseObject* RefMemory::release_object(void) {\n auto* obj = roots_.back();\n roots_.pop_back();\n dec(obj);\n return obj;\n}\n\n}\n<commit_msg>:bug: fix(RefMemory): fixed update attribute method for reference counting gc with memory pool<commit_after>\/\/ Copyright (c) 2017 ASMlover. All rights reserved.\n\/\/\n\/\/ Redistribution and use in source and binary forms, with or without\n\/\/ modification, are permitted provided that the following conditions\n\/\/ are met:\n\/\/\n\/\/ * Redistributions of source code must retain the above copyright\n\/\/ notice, this list ofconditions and the following disclaimer.\n\/\/\n\/\/ * Redistributions in binary form must reproduce the above copyright\n\/\/ notice, this list of conditions and the following disclaimer in\n\/\/ the documentation and\/or other materialsprovided with the\n\/\/ distribution.\n\/\/\n\/\/ THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS\n\/\/ \"AS IS\" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT\n\/\/ LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS\n\/\/ FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE\n\/\/ COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT,\n\/\/ INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING,\n\/\/ BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;\n\/\/ LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER\n\/\/ CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT\n\/\/ LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN\n\/\/ ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE\n\/\/ POSSIBILITY OF SUCH DAMAGE.\n#include <iostream>\n#include <Chaos\/Memory\/MemoryPool.h>\n#include \"object.h\"\n#include \"ref_memory.h\"\n\nnamespace gc {\n\nvoid* RefMemory::alloc(std::size_t n) {\n return Chaos::MemoryPool::get_instance().alloc(n);\n}\n\nvoid RefMemory::dealloc(BaseObject* obj) {\n if (obj->is_int())\n Chaos::MemoryPool::get_instance().dealloc(obj, sizeof(Int));\n else if (obj->is_pair())\n Chaos::MemoryPool::get_instance().dealloc(obj, sizeof(Pair));\n}\n\nvoid RefMemory::inc(BaseObject* ref) {\n if (ref != nullptr)\n inc_objects_.push(ref);\n}\n\nvoid RefMemory::dec(BaseObject* ref) {\n if (ref != nullptr)\n dec_objects_.push(ref);\n}\n\nvoid RefMemory::write(BaseObject* target, BaseObject* obj, bool is_first) {\n \/\/ only for pair object\n auto* pair = as_pair(target);\n inc(obj);\n if (is_first) {\n dec(pair->first());\n pair->set_first(obj);\n }\n else {\n dec(pair->second());\n pair->set_second(obj);\n }\n}\n\nvoid RefMemory::apply_increments(void) {\n while (!inc_objects_.empty()) {\n auto* obj = inc_objects_.top();\n inc_objects_.pop();\n obj->inc_ref();\n }\n}\n\nvoid RefMemory::scan_counting(void) {\n while (!dec_objects_.empty()) {\n auto* obj = dec_objects_.top();\n dec_objects_.pop();\n if (obj->dec_def() == 0 && obj->is_pair()) {\n auto append_fn = [this](BaseObject* ob) {\n if (ob != nullptr)\n dec_objects_.push(ob);\n };\n\n append_fn(as_pair(obj)->first());\n append_fn(as_pair(obj)->second());\n }\n }\n}\n\nvoid RefMemory::sweep_counting(void) {\n for (auto it = objects_.begin(); it != objects_.end();) {\n if ((*it)->ref() == 0) {\n dealloc(*it);\n objects_.erase(it++);\n }\n else {\n ++it;\n }\n }\n}\n\nRefMemory& RefMemory::get_instance(void) {\n static RefMemory ins;\n return ins;\n}\n\nvoid RefMemory::collect_counting(void) {\n auto old_count = objects_.size();\n\n apply_increments();\n scan_counting();\n sweep_counting();\n\n std::cout\n << \"[\" << old_count - objects_.size() << \"] objects collected, \"\n << \"[\" << objects_.size() << \"] objects remaining.\" << std::endl;\n}\n\nBaseObject* RefMemory::create_int(int value) {\n if (objects_.size() >= kMaxObjects)\n collect_counting();\n\n auto* obj = new (alloc(sizeof(Int))) Int();\n obj->set_value(value);\n\n roots_.push_back(obj);\n objects_.push_back(obj);\n inc(obj);\n\n return obj;\n}\n\nBaseObject* RefMemory::create_pair(BaseObject* first, BaseObject* second) {\n if (objects_.size() >= kMaxObjects)\n collect_counting();\n\n auto* obj = new (alloc(sizeof(Pair))) Pair();\n if (first != nullptr)\n write(obj, first, true);\n if (second != nullptr)\n write(obj, second, false);\n\n roots_.push_back(obj);\n objects_.push_back(obj);\n inc(obj);\n\n return obj;\n}\n\nBaseObject* RefMemory::release_object(void) {\n auto* obj = roots_.back();\n roots_.pop_back();\n dec(obj);\n return obj;\n}\n\n}\n<|endoftext|>"} {"text":"<commit_before>#include <memory>\n\n#include <SmurffCpp\/Types.h>\n#include <SmurffCpp\/Types.h>\n\n#include <SmurffCpp\/Utils\/counters.h>\n#include <SmurffCpp\/Utils\/StateFile.h>\n#include <SmurffCpp\/Utils\/MatrixUtils.h>\n#include <SmurffCpp\/result.h>\n#include <SmurffCpp\/ResultItem.h>\n\n#include <SmurffCpp\/Model.h>\n\n#include <SmurffCpp\/Predict\/PredictSession.h>\n\nnamespace smurff\n{\n\nPredictSession::PredictSession(const std::string &model_file)\n : ISession(Config()) \/\/FIXME\n , m_model_file(StateFile(model_file))\n , m_pred_savefile()\n , m_has_config(false)\n , m_num_latent(-1)\n , m_dims(PVec<>(0))\n{\n m_stepfiles = m_model_file.openSampleSteps();\n}\n\nPredictSession::PredictSession(const Config &config)\n : ISession(config)\n , m_model_file(StateFile(config.getRestoreName()))\n , m_pred_savefile(std::make_unique<StateFile>(config.getSaveName()))\n , m_has_config(true)\n , m_num_latent(-1)\n , m_dims(PVec<>(0))\n{\n m_stepfiles = m_model_file.openSampleSteps();\n}\n\nvoid PredictSession::run()\n{\n THROWERROR_ASSERT(m_has_config);\n\n\n if (getConfig().getTest().hasData())\n {\n init();\n while (step())\n ;\n\n return;\n }\n else\n {\n std::pair<int, const DataConfig &> side_info =\n (getConfig().getRowFeatures().hasData()) ?\n std::make_pair(0, getConfig().getRowFeatures()) :\n std::make_pair(1, getConfig().getColFeatures()) ;\n\n THROWERROR_ASSERT_MSG(!side_info.second.hasData(), \"Need either test, row features or col features\");\n\n if (side_info.second.isDense())\n {\n const auto &dense_matrix = side_info.second.getDenseMatrixData();\n predict(side_info.first, dense_matrix, getConfig().getSaveFreq());\n }\n else\n {\n const auto &sparse_matrix = side_info.second.getSparseMatrixData();\n predict(side_info.first, sparse_matrix, getConfig().getSaveFreq());\n }\n }\n}\n\nvoid PredictSession::init()\n{\n THROWERROR_ASSERT(m_has_config);\n THROWERROR_ASSERT(getConfig().getTest().hasData());\n m_result = Result(getConfig().getTest(), getConfig().getNSamples());\n\n m_pos = m_stepfiles.rbegin();\n m_iter = 0;\n m_is_init = true;\n\n THROWERROR_ASSERT_MSG(getConfig().getSaveName() != m_model_file.getPath(),\n \"Cannot have same output file for model and predictions - both have \" + getConfig().getSaveName());\n\n if (getConfig().getSaveFreq())\n {\n \/\/ create save file\n m_pred_savefile = std::make_unique<StateFile>(getConfig().getSaveName(), true);\n }\n\n if (getConfig().getVerbose())\n info(std::cout, \"\");\n}\n\nbool PredictSession::step()\n{\n THROWERROR_ASSERT(m_has_config);\n THROWERROR_ASSERT(m_is_init);\n THROWERROR_ASSERT(m_pos != m_stepfiles.rend());\n\n double start = tick();\n Model model;\n restoreModel(model, *m_pos);\n m_result.update(model, false);\n double stop = tick();\n m_iter++;\n m_secs_per_iter = stop - start;\n m_secs_total += m_secs_per_iter;\n\n if (getConfig().getVerbose())\n std::cout << getStatus().asString() << std::endl;\n\n if (getConfig().getSaveFreq() > 0 && (m_iter % getConfig().getSaveFreq()) == 0)\n save();\n\n auto next_pos = m_pos;\n next_pos++;\n bool last_iter = next_pos == m_stepfiles.rend();\n\n \/\/save last iter\n if (last_iter && getConfig().getSaveFreq() == -1)\n save();\n\n m_pos++;\n return !last_iter;\n}\n\nvoid PredictSession::save()\n{\n \/\/save this iteration\n SaveState saveState = m_pred_savefile->createSampleStep(m_iter, false);\n\n if (getConfig().getVerbose())\n {\n std::cout << \"-- Saving predictions into '\" << m_pred_savefile->getPath() << \"'.\" << std::endl;\n }\n\n m_result.save(saveState);\n}\n\nStatusItem PredictSession::getStatus() const\n{\n StatusItem ret;\n ret.phase = \"Predict\";\n ret.iter = m_pos->getIsample();\n ret.phase_iter = m_stepfiles.size();\n\n ret.train_rmse = NAN;\n\n ret.rmse_avg = m_result.rmse_avg;\n ret.rmse_1sample = m_result.rmse_1sample;\n\n ret.auc_avg = m_result.auc_avg;\n ret.auc_1sample = m_result.auc_1sample;\n\n ret.elapsed_iter = m_secs_per_iter;\n ret.elapsed_total = m_secs_total;\n\n return ret;\n}\n\nconst Result &PredictSession::getResult() const\n{\n return m_result;\n}\n\nstd::ostream &PredictSession::info(std::ostream &os, std::string indent) const\n{\n os << indent << \"PredictSession {\\n\";\n os << indent << \" Model {\\n\";\n os << indent << \" model-file: \" << m_model_file.getPath() << \"\\n\";\n os << indent << \" num-samples: \" << getNumSteps() << \"\\n\";\n os << indent << \" num-latent: \" << getNumLatent() << \"\\n\";\n os << indent << \" dimensions: \" << getModelDims() << \"\\n\";\n os << indent << \" }\\n\";\n os << indent << \" Predictions {\\n\";\n m_result.info(os, indent + \" \");\n if (getConfig().getSaveFreq() > 0)\n {\n os << indent << \" Save predictions: every \" << getConfig().getSaveFreq() << \" iteration\\n\";\n os << indent << \" Output file: \" << getConfig().getSaveName() << \"\\n\";\n }\n else if (getConfig().getSaveFreq() < 0)\n {\n os << indent << \" Save predictions after last iteration\\n\";\n os << indent << \" Output file: \" << getConfig().getSaveName() << \"\\n\";\n }\n else\n {\n os << indent << \" Don't save predictions\\n\";\n }\n os << indent << \" }\" << std::endl;\n os << indent << \"}\\n\";\n return os;\n}\n\nvoid PredictSession::restoreModel(Model &model, const SaveState &sf, int skip_mode)\n{\n model.restore(sf, skip_mode);\n\n if (m_num_latent <= 0)\n {\n m_num_latent = model.nlatent();\n m_dims = model.getDims();\n }\n else\n {\n THROWERROR_ASSERT(m_num_latent == model.nlatent());\n THROWERROR_ASSERT(m_dims == model.getDims());\n }\n\n THROWERROR_ASSERT(m_num_latent > 0);\n}\n\nvoid PredictSession::restoreModel(Model &model, int i, int skip_mode)\n{\n restoreModel(model, m_stepfiles.at(i), skip_mode);\n}\n\n\/\/ predict one element\nResultItem PredictSession::predict(PVec<> pos, const SaveState &sf)\n{\n ResultItem ret{pos};\n predict(ret, sf);\n return ret;\n}\n\n\/\/ predict one element\nvoid PredictSession::predict(ResultItem &res, const SaveState &sf)\n{\n Model model;\n model.restore(sf);\n auto pred = model.predict(res.coords);\n res.update(pred);\n}\n\n\/\/ predict one element\nvoid PredictSession::predict(ResultItem &res)\n{\n auto stepfiles = m_model_file.openSampleSteps();\n\n for (const auto &sf : stepfiles)\n predict(res, sf);\n}\n\nResultItem PredictSession::predict(PVec<> pos)\n{\n ResultItem ret{pos};\n predict(ret);\n return ret;\n}\n\n\/\/ predict all elements in Ytest\nstd::shared_ptr<Result> PredictSession::predict(const DataConfig &Y)\n{\n auto res = std::make_shared<Result>(Y, getNumSteps());\n\n for (const auto &s : m_stepfiles)\n {\n Model model;\n restoreModel(model, s);\n res->update(model, false);\n }\n\n return res;\n}\n\nSparseMatrix predict_matrix(const SparseMatrix &coords, const std::vector<Matrix> &latents)\n{\n THROWERROR_ASSERT(latents.size() == 2);\n\n const Matrix &U = latents.at(0);\n const Matrix &V = latents.at(1);\n\n SparseMatrix result = coords;\n #pragma omp parallel for collapse(2)\n for (int k = 0; k < result.outerSize(); ++k)\n for (SparseMatrix::InnerIterator it(result, k); it; ++it)\n it.valueRef() = U.row(it.row()).dot(V.row(it.col()));\n\n return result;\n}\n\nSparseTensor predict_tensor(const SparseTensor &coords, const std::vector<Matrix> &latents)\n{\n THROWERROR_ASSERT(latents.size() == coords.getNModes());\n\n unsigned num_latent = latents.at(0).cols();\n\n SparseTensor result = coords;\n #pragma omp parallel for \n for (std::size_t k = 0; k < result.getNNZ(); ++k)\n {\n Array1D P = Array1D::Ones(num_latent);\n auto pos = result.get(k).first; \/\/ pos\n\n for(uint32_t d = 0; d < coords.getNModes(); ++d)\n P *= latents.at(d).row(pos.at(d)).array();\n\n result.getValues().at(k) = P.sum();\n }\n\n return result;\n}\n\n\n} \/\/ end namespace smurff\n<commit_msg>FIX: simpler OpenMP for older compilers<commit_after>#include <memory>\n\n#include <SmurffCpp\/Types.h>\n#include <SmurffCpp\/Types.h>\n\n#include <SmurffCpp\/Utils\/counters.h>\n#include <SmurffCpp\/Utils\/StateFile.h>\n#include <SmurffCpp\/Utils\/MatrixUtils.h>\n#include <SmurffCpp\/result.h>\n#include <SmurffCpp\/ResultItem.h>\n\n#include <SmurffCpp\/Model.h>\n\n#include <SmurffCpp\/Predict\/PredictSession.h>\n\nnamespace smurff\n{\n\nPredictSession::PredictSession(const std::string &model_file)\n : ISession(Config()) \/\/FIXME\n , m_model_file(StateFile(model_file))\n , m_pred_savefile()\n , m_has_config(false)\n , m_num_latent(-1)\n , m_dims(PVec<>(0))\n{\n m_stepfiles = m_model_file.openSampleSteps();\n}\n\nPredictSession::PredictSession(const Config &config)\n : ISession(config)\n , m_model_file(StateFile(config.getRestoreName()))\n , m_pred_savefile(std::make_unique<StateFile>(config.getSaveName()))\n , m_has_config(true)\n , m_num_latent(-1)\n , m_dims(PVec<>(0))\n{\n m_stepfiles = m_model_file.openSampleSteps();\n}\n\nvoid PredictSession::run()\n{\n THROWERROR_ASSERT(m_has_config);\n\n\n if (getConfig().getTest().hasData())\n {\n init();\n while (step())\n ;\n\n return;\n }\n else\n {\n std::pair<int, const DataConfig &> side_info =\n (getConfig().getRowFeatures().hasData()) ?\n std::make_pair(0, getConfig().getRowFeatures()) :\n std::make_pair(1, getConfig().getColFeatures()) ;\n\n THROWERROR_ASSERT_MSG(!side_info.second.hasData(), \"Need either test, row features or col features\");\n\n if (side_info.second.isDense())\n {\n const auto &dense_matrix = side_info.second.getDenseMatrixData();\n predict(side_info.first, dense_matrix, getConfig().getSaveFreq());\n }\n else\n {\n const auto &sparse_matrix = side_info.second.getSparseMatrixData();\n predict(side_info.first, sparse_matrix, getConfig().getSaveFreq());\n }\n }\n}\n\nvoid PredictSession::init()\n{\n THROWERROR_ASSERT(m_has_config);\n THROWERROR_ASSERT(getConfig().getTest().hasData());\n m_result = Result(getConfig().getTest(), getConfig().getNSamples());\n\n m_pos = m_stepfiles.rbegin();\n m_iter = 0;\n m_is_init = true;\n\n THROWERROR_ASSERT_MSG(getConfig().getSaveName() != m_model_file.getPath(),\n \"Cannot have same output file for model and predictions - both have \" + getConfig().getSaveName());\n\n if (getConfig().getSaveFreq())\n {\n \/\/ create save file\n m_pred_savefile = std::make_unique<StateFile>(getConfig().getSaveName(), true);\n }\n\n if (getConfig().getVerbose())\n info(std::cout, \"\");\n}\n\nbool PredictSession::step()\n{\n THROWERROR_ASSERT(m_has_config);\n THROWERROR_ASSERT(m_is_init);\n THROWERROR_ASSERT(m_pos != m_stepfiles.rend());\n\n double start = tick();\n Model model;\n restoreModel(model, *m_pos);\n m_result.update(model, false);\n double stop = tick();\n m_iter++;\n m_secs_per_iter = stop - start;\n m_secs_total += m_secs_per_iter;\n\n if (getConfig().getVerbose())\n std::cout << getStatus().asString() << std::endl;\n\n if (getConfig().getSaveFreq() > 0 && (m_iter % getConfig().getSaveFreq()) == 0)\n save();\n\n auto next_pos = m_pos;\n next_pos++;\n bool last_iter = next_pos == m_stepfiles.rend();\n\n \/\/save last iter\n if (last_iter && getConfig().getSaveFreq() == -1)\n save();\n\n m_pos++;\n return !last_iter;\n}\n\nvoid PredictSession::save()\n{\n \/\/save this iteration\n SaveState saveState = m_pred_savefile->createSampleStep(m_iter, false);\n\n if (getConfig().getVerbose())\n {\n std::cout << \"-- Saving predictions into '\" << m_pred_savefile->getPath() << \"'.\" << std::endl;\n }\n\n m_result.save(saveState);\n}\n\nStatusItem PredictSession::getStatus() const\n{\n StatusItem ret;\n ret.phase = \"Predict\";\n ret.iter = m_pos->getIsample();\n ret.phase_iter = m_stepfiles.size();\n\n ret.train_rmse = NAN;\n\n ret.rmse_avg = m_result.rmse_avg;\n ret.rmse_1sample = m_result.rmse_1sample;\n\n ret.auc_avg = m_result.auc_avg;\n ret.auc_1sample = m_result.auc_1sample;\n\n ret.elapsed_iter = m_secs_per_iter;\n ret.elapsed_total = m_secs_total;\n\n return ret;\n}\n\nconst Result &PredictSession::getResult() const\n{\n return m_result;\n}\n\nstd::ostream &PredictSession::info(std::ostream &os, std::string indent) const\n{\n os << indent << \"PredictSession {\\n\";\n os << indent << \" Model {\\n\";\n os << indent << \" model-file: \" << m_model_file.getPath() << \"\\n\";\n os << indent << \" num-samples: \" << getNumSteps() << \"\\n\";\n os << indent << \" num-latent: \" << getNumLatent() << \"\\n\";\n os << indent << \" dimensions: \" << getModelDims() << \"\\n\";\n os << indent << \" }\\n\";\n os << indent << \" Predictions {\\n\";\n m_result.info(os, indent + \" \");\n if (getConfig().getSaveFreq() > 0)\n {\n os << indent << \" Save predictions: every \" << getConfig().getSaveFreq() << \" iteration\\n\";\n os << indent << \" Output file: \" << getConfig().getSaveName() << \"\\n\";\n }\n else if (getConfig().getSaveFreq() < 0)\n {\n os << indent << \" Save predictions after last iteration\\n\";\n os << indent << \" Output file: \" << getConfig().getSaveName() << \"\\n\";\n }\n else\n {\n os << indent << \" Don't save predictions\\n\";\n }\n os << indent << \" }\" << std::endl;\n os << indent << \"}\\n\";\n return os;\n}\n\nvoid PredictSession::restoreModel(Model &model, const SaveState &sf, int skip_mode)\n{\n model.restore(sf, skip_mode);\n\n if (m_num_latent <= 0)\n {\n m_num_latent = model.nlatent();\n m_dims = model.getDims();\n }\n else\n {\n THROWERROR_ASSERT(m_num_latent == model.nlatent());\n THROWERROR_ASSERT(m_dims == model.getDims());\n }\n\n THROWERROR_ASSERT(m_num_latent > 0);\n}\n\nvoid PredictSession::restoreModel(Model &model, int i, int skip_mode)\n{\n restoreModel(model, m_stepfiles.at(i), skip_mode);\n}\n\n\/\/ predict one element\nResultItem PredictSession::predict(PVec<> pos, const SaveState &sf)\n{\n ResultItem ret{pos};\n predict(ret, sf);\n return ret;\n}\n\n\/\/ predict one element\nvoid PredictSession::predict(ResultItem &res, const SaveState &sf)\n{\n Model model;\n model.restore(sf);\n auto pred = model.predict(res.coords);\n res.update(pred);\n}\n\n\/\/ predict one element\nvoid PredictSession::predict(ResultItem &res)\n{\n auto stepfiles = m_model_file.openSampleSteps();\n\n for (const auto &sf : stepfiles)\n predict(res, sf);\n}\n\nResultItem PredictSession::predict(PVec<> pos)\n{\n ResultItem ret{pos};\n predict(ret);\n return ret;\n}\n\n\/\/ predict all elements in Ytest\nstd::shared_ptr<Result> PredictSession::predict(const DataConfig &Y)\n{\n auto res = std::make_shared<Result>(Y, getNumSteps());\n\n for (const auto &s : m_stepfiles)\n {\n Model model;\n restoreModel(model, s);\n res->update(model, false);\n }\n\n return res;\n}\n\nSparseMatrix predict_matrix(const SparseMatrix &coords, const std::vector<Matrix> &latents)\n{\n THROWERROR_ASSERT(latents.size() == 2);\n\n const Matrix &U = latents.at(0);\n const Matrix &V = latents.at(1);\n\n SparseMatrix result = coords;\n #pragma omp parallel for\n for (int k = 0; k < result.outerSize(); ++k)\n for (SparseMatrix::InnerIterator it(result, k); it; ++it)\n it.valueRef() = U.row(it.row()).dot(V.row(it.col()));\n\n return result;\n}\n\nSparseTensor predict_tensor(const SparseTensor &coords, const std::vector<Matrix> &latents)\n{\n THROWERROR_ASSERT(latents.size() == coords.getNModes());\n\n unsigned num_latent = latents.at(0).cols();\n\n SparseTensor result = coords;\n #pragma omp parallel for \n for (std::size_t k = 0; k < result.getNNZ(); ++k)\n {\n Array1D P = Array1D::Ones(num_latent);\n auto pos = result.get(k).first; \/\/ pos\n\n for(uint32_t d = 0; d < coords.getNModes(); ++d)\n P *= latents.at(d).row(pos.at(d)).array();\n\n result.getValues().at(k) = P.sum();\n }\n\n return result;\n}\n\n\n} \/\/ end namespace smurff\n<|endoftext|>"} {"text":"<commit_before>#ifndef PACKET_HPP\n#define PACKET_HPP\n\n#include <SFML\/Network\/Packet.hpp>\n#include <vector>\n#include <array>\n#include <crc32.hpp>\n#include <variadic.hpp>\n#include <sorted_vector.hpp>\n#include \"serialized_packet.hpp\"\n\nstruct color32;\n\nnamespace sf {\n \/\/ Extend sf::Packet to handle 64bit types\n #ifdef HAS_UINT64_T\n packet_t::base& operator << (packet_t::base& p, std::uint64_t data);\n packet_t::base& operator >> (packet_t::base& p, std::uint64_t& data);\n #else\n struct impl_u64 {\n std::uint32_t lo, hi;\n bool operator < (const impl_u64& i) const;\n };\n packet_t::base& operator << (packet_t::base& p, impl_u64 data);\n packet_t::base& operator >> (packet_t::base& p, impl_u64& data);\n #endif\n\n template<typename T, typename enable = typename std::enable_if<std::is_enum<T>::value>::type>\n packet_t::base& operator >> (packet_t::base& p, T& t) {\n return p >> reinterpret_cast<typename std::underlying_type<T>::type&>(t);\n }\n\n template<typename T, typename enable = typename std::enable_if<std::is_enum<T>::value>::type>\n packet_t::base& operator << (packet_t::base& p, T t) {\n return p << static_cast<typename std::underlying_type<T>::type>(t);\n }\n\n packet_t::base& operator << (packet_t::base& o, ctl::empty_t);\n packet_t::base& operator >> (packet_t::base& i, ctl::empty_t);\n\n template<typename T>\n packet_t::base& operator >> (packet_t::base& p, std::vector<T>& t) {\n std::uint32_t s;\n p >> s;\n std::uint32_t i0 = t.size();\n t.resize(i0 + s);\n for (std::uint32_t i = 0; i < s; ++i) {\n p >> t[i0+i];\n }\n return p;\n }\n\n template<typename T>\n packet_t::base& operator << (packet_t::base& p, const std::vector<T>& t) {\n p << (std::uint32_t)t.size();\n for (auto& i : t) {\n p << i;\n }\n return p;\n }\n\n template<typename T, typename C>\n packet_t::base& operator >> (packet_t::base& p, ctl::sorted_vector<T,C>& t) {\n std::uint32_t s; p >> s;\n for (std::uint32_t i = 0; i < s; ++i) {\n T tmp;\n p >> tmp;\n t.insert(std::move(tmp));\n }\n return p;\n }\n\n template<typename T, typename C>\n packet_t::base& operator << (packet_t::base& p, const ctl::sorted_vector<T,C>& t) {\n p << (std::uint32_t)t.size();\n for (auto& i : t) {\n p << i;\n }\n return p;\n }\n\n template<typename T, std::size_t N>\n packet_t::base& operator >> (packet_t::base& p, std::array<T,N>& t) {\n for (std::size_t i = 0; i < N; ++i) {\n p >> t[i];\n }\n return p;\n }\n\n template<typename T, std::size_t N>\n packet_t::base& operator << (packet_t::base& p, const std::array<T,N>& t) {\n for (auto& i : t) {\n p << i;\n }\n return p;\n }\n\n packet_t::base& operator << (packet_t::base& s, const color32& c);\n packet_t::base& operator >> (packet_t::base& s, color32& c);\n}\n\n\/\/\/ Physical type of a packet identifier.\nusing packet_id_t = std::uint32_t;\n\n\/\/\/ Return a user readable name for a given packet.\nstd::string get_packet_name(packet_id_t id);\n\n\/\/\/ Check if the provided ID matches that of a real packet.\nbool is_packet_id(packet_id_t id);\n\nnamespace packet_impl {\n template<typename T>\n struct packet_builder;\n}\n\n\/\/\/ Create a packet and set its elements.\ntemplate<typename T, typename ... Args>\nT make_packet(Args&& ... args) {\n return packet_impl::packet_builder<T>()(std::forward<Args>(args)...);\n}\n\n\/\/\/ Write a list of objects into a packet.\ntemplate<typename P>\nvoid packet_write(P& p) {}\n\ntemplate<typename P, typename T, typename ... Args>\nvoid packet_write(P& p, T&& t, Args&& ... args) {\n p << std::forward<T>(t);\n packet_write(p, std::forward<Args>(args)...);\n}\n\n\/\/\/ Read a list of objects from a packet.\ntemplate<typename P>\nvoid packet_read(P& p) {}\n\ntemplate<typename P, typename T, typename ... Args>\nvoid packet_read(P& p, T& t, Args& ... args) {\n p >> t;\n packet_read(p, args...);\n}\n\nnamespace packet_impl {\n struct base_ {};\n\n template<packet_id_t ID>\n struct base : base_ {\n static const packet_id_t packet_id__ = ID;\n static const char* packet_name__;\n };\n\n template<packet_id_t ID>\n const packet_id_t base<ID>::packet_id__;\n\n template<typename T>\n using is_packet = std::is_base_of<base_, T>;\n}\n\n#define NETCOM_PACKET(name) \\\n struct name : packet_impl::base<#name ## _crc32>\n\n#endif\n<commit_msg>Added serialization for std::atomic types.<commit_after>#ifndef PACKET_HPP\n#define PACKET_HPP\n\n#include <SFML\/Network\/Packet.hpp>\n#include <vector>\n#include <atomic>\n#include <array>\n#include <crc32.hpp>\n#include <variadic.hpp>\n#include <sorted_vector.hpp>\n#include \"serialized_packet.hpp\"\n\nstruct color32;\n\nnamespace sf {\n \/\/ Extend sf::Packet to handle 64bit types\n #ifdef HAS_UINT64_T\n packet_t::base& operator << (packet_t::base& p, std::uint64_t data);\n packet_t::base& operator >> (packet_t::base& p, std::uint64_t& data);\n #else\n struct impl_u64 {\n std::uint32_t lo, hi;\n bool operator < (const impl_u64& i) const;\n };\n packet_t::base& operator << (packet_t::base& p, impl_u64 data);\n packet_t::base& operator >> (packet_t::base& p, impl_u64& data);\n #endif\n\n template<typename T, typename enable = typename std::enable_if<std::is_enum<T>::value>::type>\n packet_t::base& operator >> (packet_t::base& p, T& t) {\n return p >> reinterpret_cast<typename std::underlying_type<T>::type&>(t);\n }\n\n template<typename T, typename enable = typename std::enable_if<std::is_enum<T>::value>::type>\n packet_t::base& operator << (packet_t::base& p, T t) {\n return p << static_cast<typename std::underlying_type<T>::type>(t);\n }\n\n packet_t::base& operator << (packet_t::base& o, ctl::empty_t);\n packet_t::base& operator >> (packet_t::base& i, ctl::empty_t);\n\n template<typename T>\n packet_t::base& operator >> (packet_t::base& p, std::vector<T>& t) {\n std::uint32_t s;\n p >> s;\n std::uint32_t i0 = t.size();\n t.resize(i0 + s);\n for (std::uint32_t i = 0; i < s; ++i) {\n p >> t[i0+i];\n }\n return p;\n }\n\n template<typename T>\n packet_t::base& operator << (packet_t::base& p, const std::vector<T>& t) {\n p << (std::uint32_t)t.size();\n for (auto& i : t) {\n p << i;\n }\n return p;\n }\n\n template<typename T, typename C>\n packet_t::base& operator >> (packet_t::base& p, ctl::sorted_vector<T,C>& t) {\n std::uint32_t s; p >> s;\n for (std::uint32_t i = 0; i < s; ++i) {\n T tmp;\n p >> tmp;\n t.insert(std::move(tmp));\n }\n return p;\n }\n\n template<typename T, typename C>\n packet_t::base& operator << (packet_t::base& p, const ctl::sorted_vector<T,C>& t) {\n p << (std::uint32_t)t.size();\n for (auto& i : t) {\n p << i;\n }\n return p;\n }\n\n template<typename T, std::size_t N>\n packet_t::base& operator >> (packet_t::base& p, std::array<T,N>& t) {\n for (std::size_t i = 0; i < N; ++i) {\n p >> t[i];\n }\n return p;\n }\n\n template<typename T, std::size_t N>\n packet_t::base& operator << (packet_t::base& p, const std::array<T,N>& t) {\n for (auto& i : t) {\n p << i;\n }\n return p;\n }\n\n template<typename T>\n packet_t::base& operator >> (packet_t::base& p, std::atomic<T>& t) {\n T tmp; p >> tmp;\n t = tmp;\n return p;\n }\n\n template<typename T, typename C>\n packet_t::base& operator << (packet_t::base& p, const std::atomic<T>& t) {\n p << t.load();\n return p;\n }\n\n packet_t::base& operator << (packet_t::base& s, const color32& c);\n packet_t::base& operator >> (packet_t::base& s, color32& c);\n}\n\n\/\/\/ Physical type of a packet identifier.\nusing packet_id_t = std::uint32_t;\n\n\/\/\/ Return a user readable name for a given packet.\nstd::string get_packet_name(packet_id_t id);\n\n\/\/\/ Check if the provided ID matches that of a real packet.\nbool is_packet_id(packet_id_t id);\n\nnamespace packet_impl {\n template<typename T>\n struct packet_builder;\n}\n\n\/\/\/ Create a packet and set its elements.\ntemplate<typename T, typename ... Args>\nT make_packet(Args&& ... args) {\n return packet_impl::packet_builder<T>()(std::forward<Args>(args)...);\n}\n\n\/\/\/ Write a list of objects into a packet.\ntemplate<typename P>\nvoid packet_write(P& p) {}\n\ntemplate<typename P, typename T, typename ... Args>\nvoid packet_write(P& p, T&& t, Args&& ... args) {\n p << std::forward<T>(t);\n packet_write(p, std::forward<Args>(args)...);\n}\n\n\/\/\/ Read a list of objects from a packet.\ntemplate<typename P>\nvoid packet_read(P& p) {}\n\ntemplate<typename P, typename T, typename ... Args>\nvoid packet_read(P& p, T& t, Args& ... args) {\n p >> t;\n packet_read(p, args...);\n}\n\nnamespace packet_impl {\n struct base_ {};\n\n template<packet_id_t ID>\n struct base : base_ {\n static const packet_id_t packet_id__ = ID;\n static const char* packet_name__;\n };\n\n template<packet_id_t ID>\n const packet_id_t base<ID>::packet_id__;\n\n template<typename T>\n using is_packet = std::is_base_of<base_, T>;\n}\n\n#define NETCOM_PACKET(name) \\\n struct name : packet_impl::base<#name ## _crc32>\n\n#endif\n<|endoftext|>"} {"text":"<commit_before>#include \"helper.h\"\n\n#ifndef S_ISDIR\n#define S_ISDIR(m) (((m)&S_IFMT) == S_IFDIR)\n#endif\n\nuint32_t _ntohl(uint8_t *val) {\n return (uint32_t(val[0]) << 24) + (uint32_t(val[1]) << 16) +\n (uint32_t(val[2]) << 8) + (uint32_t(val[3]));\n}\n\nuint8_t clamp(int32_t val) {\n if (val < 0) {\n return 0;\n }\n if (val > 255) {\n return 255;\n }\n return (uint8_t)val;\n}\n\nbool isNumeric(const char *str) {\n if (str[0] == '-' && str[1] != '\\0') {\n ++str;\n }\n while (*str != '\\0') {\n if (*str < '0' || *str > '9') {\n return false;\n }\n ++str;\n }\n return true;\n}\n\nvoid splitCoords(const Coordinates<int32_t> &original,\n Coordinates<int32_t> *subCoords, const uint16_t count) {\n \/\/ Split the coordinates of the entire terrain in `count` terrain fragments\n\n for (uint16_t index = 0; index < count; index++) {\n \/\/ Initialization with the original's values\n subCoords[index] = Coordinates(original);\n\n \/\/ The first fragment begins at the terrain's beginning, the other fragments\n \/\/ begin one block behind the last fragment\n subCoords[index].minX =\n (index ? subCoords[index - 1].maxX + 1 : original.minX);\n\n \/\/ Each fragment has a fixed size\n subCoords[index].maxX =\n subCoords[index].minX + (original.maxX - original.minX + 1) \/ count - 1;\n\n \/\/ Adjust the last terrain fragment to make sure the terrain is fully\n \/\/ covered\n if (index == count - 1)\n subCoords[index].maxX = original.maxX;\n }\n}\n<commit_msg>Image size warning<commit_after>#include \"helper.h\"\n\n#ifndef S_ISDIR\n#define S_ISDIR(m) (((m)&S_IFMT) == S_IFDIR)\n#endif\n\nuint32_t _ntohl(uint8_t *val) {\n return (uint32_t(val[0]) << 24) + (uint32_t(val[1]) << 16) +\n (uint32_t(val[2]) << 8) + (uint32_t(val[3]));\n}\n\nuint8_t clamp(int32_t val) {\n if (val < 0) {\n return 0;\n }\n if (val > 255) {\n return 255;\n }\n return (uint8_t)val;\n}\n\nbool isNumeric(const char *str) {\n if (str[0] == '-' && str[1] != '\\0') {\n ++str;\n }\n while (*str != '\\0') {\n if (*str < '0' || *str > '9') {\n return false;\n }\n ++str;\n }\n return true;\n}\n\nvoid splitCoords(const Coordinates<int32_t> &original,\n Coordinates<int32_t> *subCoords, const uint16_t count) {\n \/\/ Split the coordinates of the entire terrain in `count` terrain fragments\n uint32_t width = (original.sizeX() + original.sizeZ()) * 2;\n uint32_t height = original.sizeX() + original.sizeZ() +\n (original.maxY - original.minY + 1) * 3 - 1;\n logger::debug(\"Rendering map {} requires a {}x{} image of {}MB\\n\",\n original.to_string(), width, height,\n width * height * 4 \/ (1024 * 1024));\n\n for (uint16_t index = 0; index < count; index++) {\n \/\/ Initialization with the original's values\n subCoords[index] = Coordinates(original);\n\n \/\/ The first fragment begins at the terrain's beginning, the other fragments\n \/\/ begin one block behind the last fragment\n subCoords[index].minX =\n (index ? subCoords[index - 1].maxX + 1 : original.minX);\n\n \/\/ Each fragment has a fixed size\n subCoords[index].maxX =\n subCoords[index].minX + (original.maxX - original.minX + 1) \/ count - 1;\n\n \/\/ Adjust the last terrain fragment to make sure the terrain is fully\n \/\/ covered\n if (index == count - 1)\n subCoords[index].maxX = original.maxX;\n }\n\n if (count > 1) {\n width = (subCoords[0].sizeX() + subCoords[0].sizeZ()) * 2;\n height = subCoords[0].sizeX() + subCoords[0].sizeZ() +\n (subCoords[0].maxY - subCoords[0].minY + 1) * 3 - 1;\n logger::debug(\"Splitting into {} maps requiring {} {}x{} images of {}MB\\n\",\n count, count, width, height,\n width * height * 4 \/ (1024 * 1024));\n }\n}\n<|endoftext|>"} {"text":"<commit_before>#include \"stack.hpp\"\n#include <catch.hpp>\n#include <iostream>\nusing namespace std;\n\nSCENARIO(\"count\", \"[count]\"){\n stack<int> s;\n s.push(1);\n REQUIRE(s.count()==1);\n}\n\nSCENARIO(\"push\", \"[push]\"){\n stack<int> s;\n s.push(1);\n REQUIRE(s.count()==1);\n REQUIRE(s.top()==1);\n}\n\nSCENARIO(\"pop\", \"[pop]\"){\n stack<int> s;\n s.push(1); s.pop();\n REQUIRE(s.count()==0);\n}\n\nSCENARIO(\"cop\", \"[cop]\"){\n stack<int> s;\n s.push(1);\n stack<int> s2=s;\n REQUIRE(s2.count()==1);\n REQUIRE(s2.top()==1);\n}\n\nSCENARIO(\"top\", \"[top]\"){\n stack<int> s;\n s.push(1);\n REQUIRE(s.top()==1);\n}\n\nSCENARIO(\"empty\", \"[empty]\"){\n stack<int> s1, s2;\n s1.push(1);\n REQUIRE(!s1.empty());\n REQUIRE(s2.empty());\n}\n\n<commit_msg>Update init.cpp<commit_after>#include \"stack.hpp\"\n#include <catch.hpp>\n#include <iostream>\nusing namespace std;\n\nSCENARIO(\"count\", \"[count]\"){\n stack<int> s;\n s.push(1);\n REQUIRE(s.count()==1);\n}\n\nSCENARIO(\"push\", \"[push]\"){\n stack<int> s;\n s.push(1);\n REQUIRE(s.count()==1);\n REQUIRE(s.top()==1);\n}\n\nSCENARIO(\"pop\", \"[pop]\"){\n stack<int> s;\n s.push(1); s.pop();\n REQUIRE(s.count()==0);\n}\n\nSCENARIO(\"cop\", \"[cop]\"){\n stack<int> s;\n s.push(1);\n stack<int> s2=s;\n REQUIRE(s.count()==1);\n REQUIRE(s.top()==1);\n}\n\nSCENARIO(\"top\", \"[top]\"){\n stack<int> s;\n s.push(1);\n REQUIRE(s.top()==1);\n}\n\nSCENARIO(\"empty\", \"[empty]\"){\n stack<int> s1, s2;\n s1.push(1);\n REQUIRE(!s1.empty());\n REQUIRE(s2.empty());\n}\n\n<|endoftext|>"} {"text":"<commit_before>#include <matrix.hpp>\n#include <catch.hpp>\n#include <iostream>\n\nusing namespace std;\n\nSCENARIO(\"matrix init\", \"[init]\") {\n\tMatrix matrix;\n\tREQUIRE(matrix.rows() == 0);\n\tREQUIRE(matrix.columns() == 0);\n}\n\nSCENARIO(\"params init\", \"[init with params]\") {\n\tint init = 5;\n\tMatrix matrix(init, init);\n\tREQUIRE(matrix.rows() == 5);\n\tREQUIRE(matrix.columns() == 5);\n}\n\nSCENARIO(\"copy\", \"[copy]\")\n{\n\tint init = 2;\n\tMatrix m1(init, init);\n\tMatrix copy(m1);\n\tREQUIRE(copy.rows() == 2);\n\tREQUIRE(copy.columns() == 2);\n}\n\nSCENARIO(\"m+\", \"[m+]\")\n{\n\tMatrix A(2, 2);\n\tMatrix B(2, 2);\n\tMatrix C(2, 2);\n\tstd::ifstream (\"f1.txt\") >> A;\n\tstd::ifstream (\"f2.txt\") >> B;\n\tstd::ifstream (\"f3.txt\") >> C;\n\tREQUIRE((A + B) == C);\n}\n\nSCENARIO(\"m*\", \"[m*]\")\n{\n\tMatrix A (2, 2);\n\tMatrix B (2, 2);\n\tMatrix C (2, 2);\n\tstd::ifstream(\"f1.txt\") >> A;\n\tstd::ifstream(\"f2.txt\") >> B;\n\tstd::ifstream(\"f4.txt\") >> C;\n\tREQUIRE((A*B) == C);\n}\n\nSCENARIO(\"m=\", \"[m=]\")\n{\n\tMatrix A(2, 2);\n\tMatrix B = A;\n\tREQUIRE(B == A);\n}\n\nSCENARIO(\"read\", \"[read]\")\n{\n\tMatrix A(2, 2);\n\tMatrix B (2, 2);\n\tstd::ifstream(\"f1.txt\") >> A;\n\tstd::ofstream(\"f5.txt\") << A;\n\tstd::ifstream(\"f5.txt\") >> B;\n\tREQUIRE(B == A);\n}\n<commit_msg>Update init.cpp<commit_after>#include <matrix.hpp>\n#include <catch.hpp>\n#include <iostream>\n\nusing namespace std;\n\nSCENARIO(\"matrix init\", \"[init]\") {\n\tMatrix matrix;\n\tREQUIRE(matrix.rows() == 0);\n\tREQUIRE(matrix.columns() == 0);\n}\n\nSCENARIO(\"params init\", \"[init with params]\") {\n\tint init = 5;\n\tMatrix matrix(init, init);\n\tREQUIRE(matrix.rows() == 5);\n\tREQUIRE(matrix.columns() == 5);\n}\n\nSCENARIO(\"copy\", \"[copy]\")\n{\n\tint init = 2;\n\tMatrix m1(init, init);\n\tMatrix copy(m1);\n\tREQUIRE(copy.rows() == 2);\n\tREQUIRE(copy.columns() == 2);\n}\n\nSCENARIO(\"m+\", \"[m+]\")\n{\n\tMatrix A(2, 2);\n\tMatrix B(2, 2);\n\tMatrix C(2, 2);\n\tstd::ifstream (\"f1.txt\") >> A;\n\tstd::ifstream (\"f2.txt\") >> B;\n\tstd::ifstream (\"f3.txt\") >> C;\n\tREQUIRE((A + B) == C);\n}\n\nSCENARIO(\"m*\", \"[m*]\")\n{\n\tMatrix A (2, 2);\n\tMatrix B (2, 2);\n\tMatrix C (2, 2);\n\tstd::ifstream(\"f1.txt\") >> A;\n\tstd::ifstream(\"f2.txt\") >> B;\n\tstd::ifstream(\"f4.txt\") >> C;\n\tREQUIRE((A*B) == C);\n}\n\nSCENARIO(\"m=\", \"[m=]\")\n{\n\tMatrix A(2, 2);\n\tMatrix B = A;\n\tREQUIRE(B == A);\n}\n\n\n<|endoftext|>"} {"text":"<commit_before>\/* This file is part of the Vc library.\n\n Copyright (C) 2009-2012 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 \"unittest.h\"\n#include <iostream>\n\nusing namespace Vc;\n\ntemplate<typename T> static constexpr T min(T a, T b) { return a < b ? a : b; }\n\ntemplate<typename Vec> constexpr unsigned long alignmentMask()\n{\n return Vec::Size == 1 ? (\n \/\/ on 32bit the maximal alignment is 4 Bytes, even for 8-Byte doubles.\n min(sizeof(void*), sizeof(typename Vec::EntryType)) - 1\n ) : (\n \/\/ AVX::VectorAlignment is too large\n min<size_t>(sizeof(Vec), VectorAlignment) - 1\n );\n}\n\ntemplate<typename Vec> void checkAlignment()\n{\n unsigned char i = 1;\n Vec a[10];\n unsigned long mask = alignmentMask<Vec>();\n for (i = 0; i < 10; ++i) {\n VERIFY((reinterpret_cast<size_t>(&a[i]) & mask) == 0) << \"a = \" << a << \", mask = \" << mask;\n }\n const char *data = reinterpret_cast<const char *>(&a[0]);\n for (i = 0; i < 10; ++i) {\n VERIFY(&data[i * sizeof(Vec)] == reinterpret_cast<const char *>(&a[i]));\n }\n}\n\nvoid *hack_to_put_b_on_the_stack = 0;\n\ntemplate<typename Vec> void checkMemoryAlignment()\n{\n typedef typename Vec::EntryType T;\n const T *b = 0;\n Vc::Memory<Vec, 10> a;\n b = a;\n hack_to_put_b_on_the_stack = &b;\n size_t mask = memory_alignment<Vec>::value - 1;\n for (int i = 0; i < 10; ++i) {\n VERIFY((reinterpret_cast<size_t>(&b[i * Vec::Size]) & mask) == 0) << \"b = \" << b << \", mask = \" << mask;\n }\n}\n\ntemplate<typename Vec> void loadArray()\n{\n typedef typename Vec::EntryType T;\n typedef typename Vec::IndexType I;\n\n enum loadArrayEnum { count = 256 * 1024 \/ sizeof(T) };\n Vc::Memory<Vec, count> array;\n for (int i = 0; i < count; ++i) {\n array[i] = i;\n }\n\n const I indexesFromZero(IndexesFromZero);\n\n const Vec offsets(indexesFromZero);\n for (int i = 0; i < count; i += Vec::Size) {\n const T *const addr = &array[i];\n Vec ii(i);\n ii += offsets;\n\n Vec a(addr, Vc::Aligned);\n COMPARE(a, ii);\n\n Vec b = Vec::Zero();\n b.load(addr, Vc::Aligned);\n COMPARE(b, ii);\n }\n\n \/\/ check that Vc allows construction from objects that auto-convert to T*\n Vec tmp0(array, Vc::Aligned);\n tmp0.load(array, Vc::Aligned);\n}\n\nenum Enum {\n loadArrayShortCount = 32 * 1024,\n streamingLoadCount = 1024\n};\ntemplate<typename Vec> void loadArrayShort()\n{\n typedef typename Vec::EntryType T;\n\n Vc::Memory<Vec, loadArrayShortCount> array;\n for (int i = 0; i < loadArrayShortCount; ++i) {\n array[i] = i;\n }\n\n const Vec &offsets = static_cast<Vec>(ushort_v::IndexesFromZero());\n for (int i = 0; i < loadArrayShortCount; i += Vec::Size) {\n const T *const addr = &array[i];\n Vec ii(i);\n ii += offsets;\n\n Vec a(addr, Vc::Aligned);\n COMPARE(a, ii);\n\n Vec b = Vec::Zero();\n b.load(addr, Vc::Aligned);\n COMPARE(b, ii);\n }\n}\n\ntemplate<typename Vec> void streamingLoad()\n{\n typedef typename Vec::EntryType T;\n\n Vc::Memory<Vec, streamingLoadCount> data;\n data[0] = static_cast<T>(-streamingLoadCount\/2);\n for (int i = 1; i < streamingLoadCount; ++i) {\n data[i] = data[i - 1];\n ++data[i];\n }\n\n Vec ref = data.firstVector();\n for (size_t i = 0; i < streamingLoadCount - Vec::Size; ++i, ++ref) {\n Vec v1, v2;\n if (0 == i % Vec::Size) {\n v1 = Vec(&data[i], Vc::Aligned | Vc::Streaming);\n v2.load (&data[i], Vc::Aligned | Vc::Streaming);\n } else {\n v1 = Vec(&data[i], Vc::Streaming | Vc::Unaligned);\n v2.load (&data[i], Vc::Unaligned | Vc::Streaming);\n }\n COMPARE(v1, ref) << \", i = \" << i;\n COMPARE(v2, ref) << \", i = \" << i;\n }\n}\n\ntemplate<typename T> struct TypeInfo;\ntemplate<> struct TypeInfo<double > { static const char *string() { return \"double\"; } };\ntemplate<> struct TypeInfo<float > { static const char *string() { return \"float\"; } };\ntemplate<> struct TypeInfo<int > { static const char *string() { return \"int\"; } };\ntemplate<> struct TypeInfo<unsigned int > { static const char *string() { return \"uint\"; } };\ntemplate<> struct TypeInfo<short > { static const char *string() { return \"short\"; } };\ntemplate<> struct TypeInfo<unsigned short> { static const char *string() { return \"ushort\"; } };\ntemplate<> struct TypeInfo<signed char > { static const char *string() { return \"schar\"; } };\ntemplate<> struct TypeInfo<unsigned char > { static const char *string() { return \"uchar\"; } };\ntemplate<> struct TypeInfo<double_v > { static const char *string() { return \"double_v\"; } };\ntemplate<> struct TypeInfo<float_v > { static const char *string() { return \"float_v\"; } };\ntemplate<> struct TypeInfo<int_v > { static const char *string() { return \"int_v\"; } };\ntemplate<> struct TypeInfo<uint_v > { static const char *string() { return \"uint_v\"; } };\ntemplate<> struct TypeInfo<short_v > { static const char *string() { return \"short_v\"; } };\ntemplate<> struct TypeInfo<ushort_v > { static const char *string() { return \"ushort_v\"; } };\n\ntemplate<typename T, typename Current = void> struct SupportedConversions { typedef void Next; };\ntemplate<> struct SupportedConversions<float, void> { typedef double Next; };\ntemplate<> struct SupportedConversions<float, double> { typedef int Next; };\ntemplate<> struct SupportedConversions<float, int> { typedef unsigned int Next; };\ntemplate<> struct SupportedConversions<float, unsigned int> { typedef short Next; };\ntemplate<> struct SupportedConversions<float, short> { typedef unsigned short Next; };\ntemplate<> struct SupportedConversions<float, unsigned short> { typedef signed char Next; };\ntemplate<> struct SupportedConversions<float, signed char> { typedef unsigned char Next; };\ntemplate<> struct SupportedConversions<float, unsigned char> { typedef void Next; };\ntemplate<> struct SupportedConversions<int , void > { typedef unsigned int Next; };\ntemplate<> struct SupportedConversions<int , unsigned int > { typedef short Next; };\ntemplate<> struct SupportedConversions<int , short > { typedef unsigned short Next; };\ntemplate<> struct SupportedConversions<int , unsigned short> { typedef signed char Next; };\ntemplate<> struct SupportedConversions<int , signed char > { typedef unsigned char Next; };\ntemplate<> struct SupportedConversions<int , unsigned char > { typedef void Next; };\ntemplate<> struct SupportedConversions<unsigned int, void > { typedef unsigned short Next; };\ntemplate<> struct SupportedConversions<unsigned int, unsigned short> { typedef unsigned char Next; };\ntemplate<> struct SupportedConversions<unsigned int, unsigned char > { typedef void Next; };\ntemplate<> struct SupportedConversions<unsigned short, void > { typedef unsigned char Next; };\ntemplate<> struct SupportedConversions<unsigned short, unsigned char > { typedef void Next; };\ntemplate<> struct SupportedConversions< short, void > { typedef unsigned char Next; };\ntemplate<> struct SupportedConversions< short, unsigned char > { typedef signed char Next; };\ntemplate<> struct SupportedConversions< short, signed char > { typedef void Next; };\n\ntemplate<typename Vec, typename MemT> struct LoadCvt {\n static void test() {\n typedef typename Vec::EntryType VecT;\n MemT *data = Vc::malloc<MemT, Vc::AlignOnCacheline>(128);\n for (size_t i = 0; i < 128; ++i) {\n data[i] = static_cast<MemT>(i - 64);\n }\n\n for (size_t i = 0; i < 128 - Vec::Size + 1; ++i) {\n Vec v;\n if (i % (2 * Vec::Size) == 0) {\n v = Vec(&data[i]);\n } else if (i % Vec::Size == 0) {\n v = Vec(&data[i], Vc::Aligned);\n } else {\n v = Vec(&data[i], Vc::Unaligned);\n }\n for (size_t j = 0; j < Vec::Size; ++j) {\n COMPARE(v[j], static_cast<VecT>(data[i + j])) << \" \" << TypeInfo<MemT>::string();\n }\n }\n for (size_t i = 0; i < 128 - Vec::Size + 1; ++i) {\n Vec v;\n if (i % (2 * Vec::Size) == 0) {\n v.load(&data[i]);\n } else if (i % Vec::Size == 0) {\n v.load(&data[i], Vc::Aligned);\n } else {\n v.load(&data[i], Vc::Unaligned);\n }\n for (size_t j = 0; j < Vec::Size; ++j) {\n COMPARE(v[j], static_cast<VecT>(data[i + j])) << \" \" << TypeInfo<MemT>::string();\n }\n }\n for (size_t i = 0; i < 128 - Vec::Size + 1; ++i) {\n Vec v;\n if (i % (2 * Vec::Size) == 0) {\n v = Vec(&data[i], Vc::Streaming);\n } else if (i % Vec::Size == 0) {\n v = Vec(&data[i], Vc::Streaming | Vc::Aligned);\n } else {\n v = Vec(&data[i], Vc::Streaming | Vc::Unaligned);\n }\n for (size_t j = 0; j < Vec::Size; ++j) {\n COMPARE(v[j], static_cast<VecT>(data[i + j])) << \" \" << TypeInfo<MemT>::string();\n }\n }\n\n ADD_PASS() << \"loadCvt: load \" << TypeInfo<MemT>::string() << \"* as \" << TypeInfo<Vec>::string();\n LoadCvt<Vec, typename SupportedConversions<VecT, MemT>::Next>::test();\n }\n};\ntemplate<typename Vec> struct LoadCvt<Vec, void> { static void test() {} };\n\ntemplate<typename Vec> void loadCvt()\n{\n typedef typename Vec::EntryType T;\n LoadCvt<Vec, typename SupportedConversions<T>::Next>::test();\n}\n\nvoid testmain()\n{\n runTest(checkAlignment<int_v>);\n runTest(checkAlignment<uint_v>);\n runTest(checkAlignment<float_v>);\n runTest(checkAlignment<double_v>);\n runTest(checkAlignment<short_v>);\n runTest(checkAlignment<ushort_v>);\n testAllTypes(checkMemoryAlignment);\n runTest(loadArray<int_v>);\n runTest(loadArray<uint_v>);\n runTest(loadArray<float_v>);\n runTest(loadArray<double_v>);\n runTest(loadArrayShort<short_v>);\n runTest(loadArrayShort<ushort_v>);\n\n testAllTypes(streamingLoad);\n\n testAllTypes(loadCvt);\n}\n<commit_msg>convert to new unittest macros<commit_after>\/* This file is part of the Vc library.\n\n Copyright (C) 2009-2012 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#define VC_NEWTEST\n#include \"unittest.h\"\n#include <iostream>\n\nusing namespace Vc;\n\ntemplate<typename T> static constexpr T min(T a, T b) { return a < b ? a : b; }\n\ntemplate<typename Vec> constexpr unsigned long alignmentMask()\n{\n return Vec::Size == 1 ? (\n \/\/ on 32bit the maximal alignment is 4 Bytes, even for 8-Byte doubles.\n min(sizeof(void*), sizeof(typename Vec::EntryType)) - 1\n ) : (\n \/\/ AVX::VectorAlignment is too large\n min<size_t>(sizeof(Vec), VectorAlignment) - 1\n );\n}\n\nTEST_ALL_V(Vec, checkAlignment)\n{\n unsigned char i = 1;\n Vec a[10];\n unsigned long mask = alignmentMask<Vec>();\n for (i = 0; i < 10; ++i) {\n VERIFY((reinterpret_cast<size_t>(&a[i]) & mask) == 0) << \"a = \" << a << \", mask = \" << mask;\n }\n const char *data = reinterpret_cast<const char *>(&a[0]);\n for (i = 0; i < 10; ++i) {\n VERIFY(&data[i * sizeof(Vec)] == reinterpret_cast<const char *>(&a[i]));\n }\n}\n\nvoid *hack_to_put_b_on_the_stack = 0;\n\nTEST_ALL_V(Vec, checkMemoryAlignment)\n{\n typedef typename Vec::EntryType T;\n const T *b = 0;\n Vc::Memory<Vec, 10> a;\n b = a;\n hack_to_put_b_on_the_stack = &b;\n size_t mask = memory_alignment<Vec>::value - 1;\n for (int i = 0; i < 10; ++i) {\n VERIFY((reinterpret_cast<size_t>(&b[i * Vec::Size]) & mask) == 0) << \"b = \" << b << \", mask = \" << mask;\n }\n}\n\nenum Enum {\n loadArrayShortCount = 32 * 1024,\n streamingLoadCount = 1024\n};\ntemplate<typename Vec> void loadArrayShort()\n{\n typedef typename Vec::EntryType T;\n\n Vc::Memory<Vec, loadArrayShortCount> array;\n for (int i = 0; i < loadArrayShortCount; ++i) {\n array[i] = i;\n }\n\n const Vec offsets(IndexesFromZero);\n for (int i = 0; i < loadArrayShortCount; i += Vec::Size) {\n const T *const addr = &array[i];\n Vec ii(i);\n ii += offsets;\n\n Vec a(addr, Vc::Aligned);\n COMPARE(a, ii);\n\n Vec b = Vec::Zero();\n b.load(addr, Vc::Aligned);\n COMPARE(b, ii);\n }\n}\n\nTEST_ALL_V(Vec, loadArray)\n{\n typedef typename Vec::EntryType T;\n typedef typename Vec::IndexType I;\n if (sizeof(T) < 32) {\n loadArrayShort<Vec>();\n return;\n }\n\n enum loadArrayEnum { count = 256 * 1024 \/ sizeof(T) };\n Vc::Memory<Vec, count> array;\n for (int i = 0; i < count; ++i) {\n array[i] = i;\n }\n\n const Vec offsets(IndexesFromZero);\n for (int i = 0; i < count; i += Vec::Size) {\n const T *const addr = &array[i];\n Vec ii(i);\n ii += offsets;\n\n Vec a(addr, Vc::Aligned);\n COMPARE(a, ii);\n\n Vec b = Vec::Zero();\n b.load(addr, Vc::Aligned);\n COMPARE(b, ii);\n }\n\n \/\/ check that Vc allows construction from objects that auto-convert to T*\n Vec tmp0(array, Vc::Aligned);\n tmp0.load(array, Vc::Aligned);\n}\n\nTEST_ALL_V(Vec, streamingLoad)\n{\n typedef typename Vec::EntryType T;\n\n Vc::Memory<Vec, streamingLoadCount> data;\n data[0] = static_cast<T>(-streamingLoadCount\/2);\n for (int i = 1; i < streamingLoadCount; ++i) {\n data[i] = data[i - 1];\n ++data[i];\n }\n\n Vec ref = data.firstVector();\n for (size_t i = 0; i < streamingLoadCount - Vec::Size; ++i, ++ref) {\n Vec v1, v2;\n if (0 == i % Vec::Size) {\n v1 = Vec(&data[i], Vc::Aligned | Vc::Streaming);\n v2.load (&data[i], Vc::Aligned | Vc::Streaming);\n } else {\n v1 = Vec(&data[i], Vc::Streaming | Vc::Unaligned);\n v2.load (&data[i], Vc::Unaligned | Vc::Streaming);\n }\n COMPARE(v1, ref) << \", i = \" << i;\n COMPARE(v2, ref) << \", i = \" << i;\n }\n}\n\ntemplate<typename T> struct TypeInfo;\ntemplate<> struct TypeInfo<double > { static const char *string() { return \"double\"; } };\ntemplate<> struct TypeInfo<float > { static const char *string() { return \"float\"; } };\ntemplate<> struct TypeInfo<int > { static const char *string() { return \"int\"; } };\ntemplate<> struct TypeInfo<unsigned int > { static const char *string() { return \"uint\"; } };\ntemplate<> struct TypeInfo<short > { static const char *string() { return \"short\"; } };\ntemplate<> struct TypeInfo<unsigned short> { static const char *string() { return \"ushort\"; } };\ntemplate<> struct TypeInfo<signed char > { static const char *string() { return \"schar\"; } };\ntemplate<> struct TypeInfo<unsigned char > { static const char *string() { return \"uchar\"; } };\ntemplate<> struct TypeInfo<double_v > { static const char *string() { return \"double_v\"; } };\ntemplate<> struct TypeInfo<float_v > { static const char *string() { return \"float_v\"; } };\ntemplate<> struct TypeInfo<int_v > { static const char *string() { return \"int_v\"; } };\ntemplate<> struct TypeInfo<uint_v > { static const char *string() { return \"uint_v\"; } };\ntemplate<> struct TypeInfo<short_v > { static const char *string() { return \"short_v\"; } };\ntemplate<> struct TypeInfo<ushort_v > { static const char *string() { return \"ushort_v\"; } };\n\ntemplate<typename T, typename Current = void> struct SupportedConversions { typedef void Next; };\ntemplate<> struct SupportedConversions<float, void> { typedef double Next; };\ntemplate<> struct SupportedConversions<float, double> { typedef int Next; };\ntemplate<> struct SupportedConversions<float, int> { typedef unsigned int Next; };\ntemplate<> struct SupportedConversions<float, unsigned int> { typedef short Next; };\ntemplate<> struct SupportedConversions<float, short> { typedef unsigned short Next; };\ntemplate<> struct SupportedConversions<float, unsigned short> { typedef signed char Next; };\ntemplate<> struct SupportedConversions<float, signed char> { typedef unsigned char Next; };\ntemplate<> struct SupportedConversions<float, unsigned char> { typedef void Next; };\ntemplate<> struct SupportedConversions<int , void > { typedef unsigned int Next; };\ntemplate<> struct SupportedConversions<int , unsigned int > { typedef short Next; };\ntemplate<> struct SupportedConversions<int , short > { typedef unsigned short Next; };\ntemplate<> struct SupportedConversions<int , unsigned short> { typedef signed char Next; };\ntemplate<> struct SupportedConversions<int , signed char > { typedef unsigned char Next; };\ntemplate<> struct SupportedConversions<int , unsigned char > { typedef void Next; };\ntemplate<> struct SupportedConversions<unsigned int, void > { typedef unsigned short Next; };\ntemplate<> struct SupportedConversions<unsigned int, unsigned short> { typedef unsigned char Next; };\ntemplate<> struct SupportedConversions<unsigned int, unsigned char > { typedef void Next; };\ntemplate<> struct SupportedConversions<unsigned short, void > { typedef unsigned char Next; };\ntemplate<> struct SupportedConversions<unsigned short, unsigned char > { typedef void Next; };\ntemplate<> struct SupportedConversions< short, void > { typedef unsigned char Next; };\ntemplate<> struct SupportedConversions< short, unsigned char > { typedef signed char Next; };\ntemplate<> struct SupportedConversions< short, signed char > { typedef void Next; };\n\ntemplate<typename Vec, typename MemT> struct LoadCvt {\n static void test() {\n typedef typename Vec::EntryType VecT;\n MemT *data = Vc::malloc<MemT, Vc::AlignOnCacheline>(128);\n for (size_t i = 0; i < 128; ++i) {\n data[i] = static_cast<MemT>(i - 64);\n }\n\n for (size_t i = 0; i < 128 - Vec::Size + 1; ++i) {\n Vec v;\n if (i % (2 * Vec::Size) == 0) {\n v = Vec(&data[i]);\n } else if (i % Vec::Size == 0) {\n v = Vec(&data[i], Vc::Aligned);\n } else {\n v = Vec(&data[i], Vc::Unaligned);\n }\n for (size_t j = 0; j < Vec::Size; ++j) {\n COMPARE(v[j], static_cast<VecT>(data[i + j])) << \" \" << TypeInfo<MemT>::string();\n }\n }\n for (size_t i = 0; i < 128 - Vec::Size + 1; ++i) {\n Vec v;\n if (i % (2 * Vec::Size) == 0) {\n v.load(&data[i]);\n } else if (i % Vec::Size == 0) {\n v.load(&data[i], Vc::Aligned);\n } else {\n v.load(&data[i], Vc::Unaligned);\n }\n for (size_t j = 0; j < Vec::Size; ++j) {\n COMPARE(v[j], static_cast<VecT>(data[i + j])) << \" \" << TypeInfo<MemT>::string();\n }\n }\n for (size_t i = 0; i < 128 - Vec::Size + 1; ++i) {\n Vec v;\n if (i % (2 * Vec::Size) == 0) {\n v = Vec(&data[i], Vc::Streaming);\n } else if (i % Vec::Size == 0) {\n v = Vec(&data[i], Vc::Streaming | Vc::Aligned);\n } else {\n v = Vec(&data[i], Vc::Streaming | Vc::Unaligned);\n }\n for (size_t j = 0; j < Vec::Size; ++j) {\n COMPARE(v[j], static_cast<VecT>(data[i + j])) << \" \" << TypeInfo<MemT>::string();\n }\n }\n\n ADD_PASS() << \"loadCvt: load \" << TypeInfo<MemT>::string() << \"* as \" << TypeInfo<Vec>::string();\n LoadCvt<Vec, typename SupportedConversions<VecT, MemT>::Next>::test();\n }\n};\ntemplate<typename Vec> struct LoadCvt<Vec, void> { static void test() {} };\n\nTEST_ALL_V(Vec, loadCvt)\n{\n typedef typename Vec::EntryType T;\n LoadCvt<Vec, typename SupportedConversions<T>::Next>::test();\n}\n\n<|endoftext|>"} {"text":"<commit_before>\/* This file is part of the Vc library. {{{\nCopyright © 2009-2015 Matthias Kretz <kretz@kde.org>\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 names of contributing organizations 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 THE 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#include \"unittest.h\"\n\nusing namespace Vc;\n\n#define ALL_TYPES (ALL_VECTORS)\n\ntemplate<typename T> static constexpr T min(T a, T b) { return a < b ? a : b; }\n\ntemplate<typename Vec> constexpr unsigned long alignmentMask()\n{\n return Vec::Size == 1 ? (\n \/\/ on 32bit the maximal alignment is 4 Bytes, even for 8-Byte doubles.\n min(sizeof(void*), sizeof(typename Vec::EntryType)) - 1\n ) : (\n \/\/ AVX::VectorAlignment is too large\n min(sizeof(Vec), alignof(Vec)) - 1\n );\n}\n\nTEST_TYPES(Vec, checkAlignment, ALL_TYPES)\n{\n unsigned char i = 1;\n Vec a[10];\n unsigned long mask = alignmentMask<Vec>();\n for (i = 0; i < 10; ++i) {\n VERIFY((reinterpret_cast<size_t>(&a[i]) & mask) == 0) << \"a = \" << a << \", mask = \" << mask;\n }\n const char *data = reinterpret_cast<const char *>(&a[0]);\n for (i = 0; i < 10; ++i) {\n VERIFY(&data[i * sizeof(Vec)] == reinterpret_cast<const char *>(&a[i]));\n }\n}\n\nvoid *hack_to_put_b_on_the_stack = 0;\n\nTEST_TYPES(Vec, checkMemoryAlignment, ALL_TYPES)\n{\n typedef typename Vec::EntryType T;\n const T *b = 0;\n Vc::Memory<Vec, 10> a;\n b = a;\n hack_to_put_b_on_the_stack = &b;\n size_t mask = memory_alignment<Vec>::value - 1;\n for (int i = 0; i < 10; ++i) {\n VERIFY((reinterpret_cast<size_t>(&b[i * Vec::Size]) & mask) == 0) << \"b = \" << b << \", mask = \" << mask;\n }\n}\n\nenum Enum {\n loadArrayShortCount = 32 * 1024,\n streamingLoadCount = 1024\n};\nTEST_TYPES(Vec, loadArrayShort, (short_v, ushort_v, SimdArray<short, 32>, SimdArray<unsigned short, 32>))\n{\n typedef typename Vec::EntryType T;\n\n Vc::Memory<Vec, loadArrayShortCount> array;\n for (int i = 0; i < loadArrayShortCount; ++i) {\n array[i] = i;\n }\n\n const Vec offsets(IndexesFromZero);\n for (int i = 0; i < loadArrayShortCount; i += Vec::Size) {\n const T *const addr = &array[i];\n Vec ii(i);\n ii += offsets;\n\n Vec a(addr, Vc::Aligned);\n COMPARE(a, ii);\n\n Vec b = Vec::Zero();\n b.load(addr, Vc::Aligned);\n COMPARE(b, ii);\n }\n}\n\nTEST_TYPES(Vec, loadArray, ALL_TYPES)\n{\n typedef typename Vec::EntryType T;\n if (sizeof(T) < 4) {\n return;\n }\n\n enum loadArrayEnum { count = 256 * 1024 \/ sizeof(T) };\n Vc::Memory<Vec, count> array;\n for (int i = 0; i < count; ++i) {\n array[i] = i;\n }\n\n const Vec offsets(IndexesFromZero);\n for (int i = 0; i < count; i += Vec::Size) {\n const T *const addr = &array[i];\n Vec ii(i);\n ii += offsets;\n\n Vec a(addr, Vc::Aligned);\n COMPARE(a, ii);\n\n Vec b = Vec::Zero();\n b.load(addr, Vc::Aligned);\n COMPARE(b, ii);\n }\n\n \/\/ check that Vc allows construction from objects that auto-convert to T*\n Vec tmp0(array, Vc::Aligned);\n tmp0.load(array, Vc::Aligned);\n}\n\nTEST_TYPES(Vec, streamingLoad, ALL_TYPES)\n{\n typedef typename Vec::EntryType T;\n\n Vc::Memory<Vec, streamingLoadCount> data;\n data[0] = static_cast<T>(-streamingLoadCount\/2);\n for (int i = 1; i < streamingLoadCount; ++i) {\n data[i] = data[i - 1];\n ++data[i];\n }\n\n Vec ref = data.firstVector();\n for (size_t i = 0; i < streamingLoadCount - Vec::Size; ++i, ++ref) {\n Vec v1, v2;\n if (0 == i % Vec::Size) {\n v1 = Vec(&data[i], Vc::Aligned | Vc::Streaming);\n v2.load (&data[i], Vc::Aligned | Vc::Streaming);\n } else {\n v1 = Vec(&data[i], Vc::Streaming | Vc::Unaligned);\n v2.load (&data[i], Vc::Unaligned | Vc::Streaming);\n }\n COMPARE(v1, ref) << \", i = \" << i;\n COMPARE(v2, ref) << \", i = \" << i;\n }\n}\n\nTEST_TYPES(\n Pair, loadCvt,\n (concat<\n outer_product<Typelist<float>,\n Typelist<double, int, unsigned int, short, unsigned short,\n signed char, unsigned char>>,\n outer_product<Typelist<int>, Typelist<unsigned int, short, unsigned short,\n signed char, unsigned char>>,\n outer_product<Typelist<unsigned int>, Typelist<unsigned short, unsigned char>>,\n outer_product<Typelist<short>, Typelist<unsigned char, unsigned char>>,\n outer_product<Typelist<unsigned short>, Typelist<unsigned char>>>))\n{\n using Vec = Vector<typename Pair::template at<0>>;\n using MemT = typename Pair::template at<1>;\n\n typedef typename Vec::EntryType VecT;\n MemT *data = Vc::malloc<MemT, Vc::AlignOnCacheline>(128);\n for (size_t i = 0; i < 128; ++i) {\n data[i] = static_cast<MemT>(i - 64);\n }\n\n for (size_t i = 0; i < 128 - Vec::Size + 1; ++i) {\n Vec v;\n if (i % (2 * Vec::Size) == 0) {\n v = Vec(&data[i]);\n } else if (i % Vec::Size == 0) {\n v = Vec(&data[i], Vc::Aligned);\n } else {\n v = Vec(&data[i], Vc::Unaligned);\n }\n for (size_t j = 0; j < Vec::Size; ++j) {\n COMPARE(v[j], static_cast<VecT>(data[i + j]));\n }\n }\n for (size_t i = 0; i < 128 - Vec::Size + 1; ++i) {\n Vec v;\n if (i % (2 * Vec::Size) == 0) {\n v.load(&data[i]);\n } else if (i % Vec::Size == 0) {\n v.load(&data[i], Vc::Aligned);\n } else {\n v.load(&data[i], Vc::Unaligned);\n }\n for (size_t j = 0; j < Vec::Size; ++j) {\n COMPARE(v[j], static_cast<VecT>(data[i + j]));\n }\n }\n for (size_t i = 0; i < 128 - Vec::Size + 1; ++i) {\n Vec v;\n if (i % (2 * Vec::Size) == 0) {\n v = Vec(&data[i], Vc::Streaming);\n } else if (i % Vec::Size == 0) {\n v = Vec(&data[i], Vc::Streaming | Vc::Aligned);\n } else {\n v = Vec(&data[i], Vc::Streaming | Vc::Unaligned);\n }\n for (size_t j = 0; j < Vec::Size; ++j) {\n COMPARE(v[j], static_cast<VecT>(data[i + j]));\n }\n }\n}\n<commit_msg>Tests: Clang bug workaround: print index on failure<commit_after>\/* This file is part of the Vc library. {{{\nCopyright © 2009-2015 Matthias Kretz <kretz@kde.org>\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 names of contributing organizations 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 THE 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#include \"unittest.h\"\n\nusing namespace Vc;\n\n#define ALL_TYPES (ALL_VECTORS)\n\ntemplate<typename T> static constexpr T min(T a, T b) { return a < b ? a : b; }\n\ntemplate<typename Vec> constexpr unsigned long alignmentMask()\n{\n return Vec::Size == 1 ? (\n \/\/ on 32bit the maximal alignment is 4 Bytes, even for 8-Byte doubles.\n min(sizeof(void*), sizeof(typename Vec::EntryType)) - 1\n ) : (\n \/\/ AVX::VectorAlignment is too large\n min(sizeof(Vec), alignof(Vec)) - 1\n );\n}\n\nTEST_TYPES(Vec, checkAlignment, ALL_TYPES)\n{\n unsigned char i = 1;\n Vec a[10];\n unsigned long mask = alignmentMask<Vec>();\n for (i = 0; i < 10; ++i) {\n VERIFY((reinterpret_cast<size_t>(&a[i]) & mask) == 0) << \"a = \" << a << \", mask = \" << mask;\n }\n const char *data = reinterpret_cast<const char *>(&a[0]);\n for (i = 0; i < 10; ++i) {\n VERIFY(&data[i * sizeof(Vec)] == reinterpret_cast<const char *>(&a[i]));\n }\n}\n\nvoid *hack_to_put_b_on_the_stack = 0;\n\nTEST_TYPES(Vec, checkMemoryAlignment, ALL_TYPES)\n{\n typedef typename Vec::EntryType T;\n const T *b = 0;\n Vc::Memory<Vec, 10> a;\n b = a;\n hack_to_put_b_on_the_stack = &b;\n size_t mask = memory_alignment<Vec>::value - 1;\n for (int i = 0; i < 10; ++i) {\n VERIFY((reinterpret_cast<size_t>(&b[i * Vec::Size]) & mask) == 0) << \"b = \" << b << \", mask = \" << mask;\n }\n}\n\nenum Enum {\n loadArrayShortCount = 32 * 1024,\n streamingLoadCount = 1024\n};\nTEST_TYPES(Vec, loadArrayShort, (short_v, ushort_v, SimdArray<short, 32>, SimdArray<unsigned short, 32>))\n{\n typedef typename Vec::EntryType T;\n\n Vc::Memory<Vec, loadArrayShortCount> array;\n for (int i = 0; i < loadArrayShortCount; ++i) {\n array[i] = i;\n }\n\n const Vec offsets(IndexesFromZero);\n for (int i = 0; i < loadArrayShortCount; i += Vec::Size) {\n const T *const addr = &array[i];\n Vec ii(i);\n ii += offsets;\n\n Vec a(addr, Vc::Aligned);\n COMPARE(a, ii);\n\n Vec b = Vec::Zero();\n b.load(addr, Vc::Aligned);\n COMPARE(b, ii);\n }\n}\n\nTEST_TYPES(Vec, loadArray, ALL_TYPES)\n{\n typedef typename Vec::EntryType T;\n if (sizeof(T) < 4) {\n return;\n }\n\n enum loadArrayEnum { count = 256 * 1024 \/ sizeof(T) };\n Vc::Memory<Vec, count> array;\n for (int i = 0; i < count; ++i) {\n array[i] = i;\n }\n\n const Vec offsets(IndexesFromZero);\n for (int i = 0; i < count; i += Vec::Size) {\n const T *const addr = &array[i];\n Vec ii(i);\n ii += offsets;\n\n Vec a(addr, Vc::Aligned);\n COMPARE(a, ii);\n\n Vec b = Vec::Zero();\n b.load(addr, Vc::Aligned);\n COMPARE(b, ii);\n }\n\n \/\/ check that Vc allows construction from objects that auto-convert to T*\n Vec tmp0(array, Vc::Aligned);\n tmp0.load(array, Vc::Aligned);\n}\n\nTEST_TYPES(Vec, streamingLoad, ALL_TYPES)\n{\n typedef typename Vec::EntryType T;\n\n Vc::Memory<Vec, streamingLoadCount> data;\n data[0] = static_cast<T>(-streamingLoadCount\/2);\n for (int i = 1; i < streamingLoadCount; ++i) {\n data[i] = data[i - 1];\n ++data[i];\n }\n\n Vec ref = data.firstVector();\n for (size_t i = 0; i < streamingLoadCount - Vec::Size; ++i, ++ref) {\n Vec v1, v2;\n if (0 == i % Vec::Size) {\n v1 = Vec(&data[i], Vc::Aligned | Vc::Streaming);\n v2.load (&data[i], Vc::Aligned | Vc::Streaming);\n } else {\n v1 = Vec(&data[i], Vc::Streaming | Vc::Unaligned);\n v2.load (&data[i], Vc::Unaligned | Vc::Streaming);\n }\n COMPARE(v1, ref) << \", i = \" << i;\n COMPARE(v2, ref) << \", i = \" << i;\n }\n}\n\nTEST_TYPES(\n Pair, loadCvt,\n (concat<\n outer_product<Typelist<float>,\n Typelist<double, int, unsigned int, short, unsigned short,\n signed char, unsigned char>>,\n outer_product<Typelist<int>, Typelist<unsigned int, short, unsigned short,\n signed char, unsigned char>>,\n outer_product<Typelist<unsigned int>, Typelist<unsigned short, unsigned char>>,\n outer_product<Typelist<short>, Typelist<unsigned char, unsigned char>>,\n outer_product<Typelist<unsigned short>, Typelist<unsigned char>>>))\n{\n using Vec = Vector<typename Pair::template at<0>>;\n using MemT = typename Pair::template at<1>;\n\n typedef typename Vec::EntryType VecT;\n MemT *data = Vc::malloc<MemT, Vc::AlignOnCacheline>(128);\n for (size_t i = 0; i < 128; ++i) {\n data[i] = static_cast<MemT>(i - 64);\n }\n\n for (size_t i = 0; i < 128 - Vec::Size + 1; ++i) {\n Vec v;\n if (i % (2 * Vec::Size) == 0) {\n v = Vec(&data[i]);\n } else if (i % Vec::Size == 0) {\n v = Vec(&data[i], Vc::Aligned);\n } else {\n v = Vec(&data[i], Vc::Unaligned);\n }\n for (size_t j = 0; j < Vec::Size; ++j) {\n COMPARE(v[j], static_cast<VecT>(data[i + j])) << \"j: \" << j;\n }\n }\n for (size_t i = 0; i < 128 - Vec::Size + 1; ++i) {\n Vec v;\n if (i % (2 * Vec::Size) == 0) {\n v.load(&data[i]);\n } else if (i % Vec::Size == 0) {\n v.load(&data[i], Vc::Aligned);\n } else {\n v.load(&data[i], Vc::Unaligned);\n }\n for (size_t j = 0; j < Vec::Size; ++j) {\n COMPARE(v[j], static_cast<VecT>(data[i + j])) << \"j: \" << j;\n }\n }\n for (size_t i = 0; i < 128 - Vec::Size + 1; ++i) {\n Vec v;\n if (i % (2 * Vec::Size) == 0) {\n v = Vec(&data[i], Vc::Streaming);\n } else if (i % Vec::Size == 0) {\n v = Vec(&data[i], Vc::Streaming | Vc::Aligned);\n } else {\n v = Vec(&data[i], Vc::Streaming | Vc::Unaligned);\n }\n for (size_t j = 0; j < Vec::Size; ++j) {\n COMPARE(v[j], static_cast<VecT>(data[i + j])) << \"j: \" << j;\n }\n }\n}\n<|endoftext|>"} {"text":"<commit_before>\/*\n* Copyright (C) 2007-2013 German Aerospace Center (DLR\/SC)\n*\n* Created: 2012-10-17 Markus Litz <Markus.Litz@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#include \"gtest\/gtest.h\"\n#include \"CTiglLogging.h\"\n#include <tixi.h>\n\n#ifdef HAVE_VLD\n#include <vld.h>\n#endif\n\n\/\/ make tixi quiet\nvoid tixiSilentMessage(MessageType , const char *, ...){}\n\nint main(int argc, char **argv)\n{\n ::testing::InitGoogleTest(&argc, argv);\n tigl::CTiglLogging::Instance().SetTimeIdInFilenameEnabled(false);\n \/\/ disable any console logging\n tigl::CTiglLogging::Instance().SetConsoleVerbosity(TILOG_SILENT);\n tigl::CTiglLogging::Instance().LogToFile(\"tigltest\");\n \/\/ disable tixi output\n tixiSetPrintMsgFunc(tixiSilentMessage);\n int retval = RUN_ALL_TESTS();\n tixiCleanup();\n return retval;\n}\n<commit_msg>Fixed build with tixi 2.2.1<commit_after>\/*\n* Copyright (C) 2007-2013 German Aerospace Center (DLR\/SC)\n*\n* Created: 2012-10-17 Markus Litz <Markus.Litz@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#include \"gtest\/gtest.h\"\n#include \"CTiglLogging.h\"\n#include <tixi.h>\n\n#ifdef HAVE_VLD\n#include <vld.h>\n#endif\n\n\/\/ make tixi quiet\nvoid tixiSilentMessage(MessageType , const char *){}\n\nint main(int argc, char **argv)\n{\n ::testing::InitGoogleTest(&argc, argv);\n tigl::CTiglLogging::Instance().SetTimeIdInFilenameEnabled(false);\n \/\/ disable any console logging\n tigl::CTiglLogging::Instance().SetConsoleVerbosity(TILOG_SILENT);\n tigl::CTiglLogging::Instance().LogToFile(\"tigltest\");\n \/\/ disable tixi output\n tixiSetPrintMsgFunc(tixiSilentMessage);\n int retval = RUN_ALL_TESTS();\n tixiCleanup();\n return retval;\n}\n<|endoftext|>"} {"text":"<commit_before>\/*\n C++ interface test\n*\/\n#include \"libmemcached\/memcached.hh\"\n\n#include <assert.h>\n#include <stdio.h>\n#include <stdlib.h>\n#include <string.h>\n#include <sys\/time.h>\n#include <sys\/types.h>\n#include <sys\/stat.h>\n#include <unistd.h>\n#include <time.h>\n#include \"server.h\"\n\n#include \"test.h\"\n\n#include <string>\n\nusing namespace std;\n\nextern \"C\" {\n test_return basic_test(memcached_st *memc);\n test_return increment_test(memcached_st *memc);\n test_return basic_master_key_test(memcached_st *memc);\n test_return mget_result_function(memcached_st *memc);\n test_return mget_test(memcached_st *memc);\n memcached_return callback_counter(memcached_st *,\n memcached_result_st *, \n void *context);\n void *world_create(void);\n void world_destroy(void *p);\n}\n\ntest_return basic_test(memcached_st *memc)\n{\n Memcached foo(memc);\n const string value_set(\"This is some data\");\n string value;\n size_t value_length;\n\n foo.set(\"mine\", value_set, 0, 0);\n value= foo.get(\"mine\", &value_length);\n\n assert((memcmp(value.c_str(), value_set.c_str(), value_length) == 0));\n\n return TEST_SUCCESS;\n}\n\ntest_return increment_test(memcached_st *memc)\n{\n Memcached mcach(memc);\n bool rc;\n const string key(\"inctest\");\n const string inc_value(\"1\");\n string ret_value;\n uint64_t int_inc_value;\n uint64_t int_ret_value;\n size_t value_length;\n\n mcach.set(key, inc_value, 0, 0);\n ret_value= mcach.get(key, &value_length);\n printf(\"\\nretvalue %s\\n\",ret_value.c_str());\n int_inc_value= uint64_t(atol(inc_value.c_str()));\n int_ret_value= uint64_t(atol(ret_value.c_str()));\n assert(int_ret_value == int_inc_value); \n\n rc= mcach.increment(key, 1, &int_ret_value);\n assert(rc == true);\n assert(int_ret_value == 2);\n\n rc= mcach.increment(key, 1, &int_ret_value);\n assert(rc == true);\n assert(int_ret_value == 3);\n\n rc= mcach.increment(key, 5, &int_ret_value);\n assert(rc == true);\n assert(int_ret_value == 8);\n\n return TEST_SUCCESS;\n}\n\ntest_return basic_master_key_test(memcached_st *memc)\n{\n Memcached foo(memc);\n const string value_set(\"Data for server A\");\n const string master_key_a(\"server-a\");\n const string master_key_b(\"server-b\");\n const string key(\"xyz\");\n string value;\n size_t value_length;\n\n foo.set_by_key(master_key_a, key, value_set, 0, 0);\n value= foo.get_by_key(master_key_a, key, &value_length);\n\n assert((memcmp(value.c_str(), value_set.c_str(), value_length) == 0));\n\n value= foo.get_by_key(master_key_b, key, &value_length);\n assert((memcmp(value.c_str(), value_set.c_str(), value_length) == 0));\n\n return TEST_SUCCESS;\n}\n\n\/* Count the results *\/\nmemcached_return callback_counter(memcached_st *,\n memcached_result_st *, \n void *context)\n{\n unsigned int *counter= static_cast<unsigned int *>(context);\n\n *counter= *counter + 1;\n\n return MEMCACHED_SUCCESS;\n}\n\ntest_return mget_result_function(memcached_st *memc)\n{\n Memcached mc(memc);\n bool rc;\n string key1(\"fudge\");\n string key2(\"son\");\n string key3(\"food\");\n vector<string> keys;\n keys.reserve(3);\n keys.push_back(key1);\n keys.push_back(key2);\n keys.push_back(key3);\n unsigned int counter;\n memcached_execute_function callbacks[1];\n\n \/* We need to empty the server before we continue the test *\/\n rc= mc.flush(0);\n rc= mc.set_all(keys, keys, 50, 9);\n assert(rc == true);\n\n rc= mc.mget(keys);\n assert(rc == true);\n\n callbacks[0]= &callback_counter;\n counter= 0;\n rc= mc.fetch_execute(callbacks, static_cast<void *>(&counter), 1); \n\n assert(counter == 3);\n\n return TEST_SUCCESS;\n}\n\ntest_return mget_test(memcached_st *memc)\n{\n Memcached mc(memc);\n bool rc;\n memcached_return mc_rc;\n vector<string> keys;\n keys.reserve(3);\n keys.push_back(\"fudge\");\n keys.push_back(\"son\");\n keys.push_back(\"food\");\n uint32_t flags;\n\n string return_key;\n size_t return_key_length;\n string return_value;\n size_t return_value_length;\n\n \/* We need to empty the server before we continue the test *\/\n rc= mc.flush(0);\n assert(rc == true);\n\n rc= mc.mget(keys);\n assert(rc == true);\n\n while (mc.fetch(return_key, return_value, &return_key_length, \n &return_value_length, &flags, &mc_rc))\n {\n assert(return_value.length() != 0);\n }\n assert(return_value_length == 0);\n assert(mc_rc == MEMCACHED_END);\n\n rc= mc.set_all(keys, keys, 50, 9);\n assert(rc == true);\n\n rc= mc.mget(keys);\n assert(rc == true);\n\n while ((mc.fetch(return_key, return_value, &return_key_length, \n &return_value_length, &flags, &mc_rc)))\n {\n assert(return_value.length() != 0);\n assert(mc_rc == MEMCACHED_SUCCESS);\n assert(return_key_length == return_value_length);\n assert(!memcmp(return_value.c_str(), return_key.c_str(), return_value_length));\n }\n\n return TEST_SUCCESS;\n}\n\ntest_st tests[] ={\n { \"basic\", 0, basic_test },\n { \"basic_master_key\", 0, basic_master_key_test },\n { \"increment_test\", 0, increment_test },\n { \"mget\", 1, mget_test },\n { \"mget_result_function\", 1, mget_result_function },\n {0, 0, 0}\n};\n\ncollection_st collection[] ={\n {\"block\", 0, 0, tests},\n {0, 0, 0, 0}\n};\n\n#define SERVERS_TO_CREATE 1\n\nextern \"C\" void *world_create(void)\n{\n server_startup_st *construct;\n\n construct= (server_startup_st *)malloc(sizeof(server_startup_st));\n memset(construct, 0, sizeof(server_startup_st));\n\n construct->count= SERVERS_TO_CREATE;\n server_startup(construct);\n\n return construct;\n}\n\nvoid world_destroy(void *p)\n{\n server_startup_st *construct= static_cast<server_startup_st *>(p);\n memcached_server_st *servers=\n static_cast<memcached_server_st *>(construct->servers);\n memcached_server_list_free(servers);\n\n server_shutdown(construct);\n free(construct);\n}\n\nvoid get_world(world_st *world)\n{\n world->collections= collection;\n world->create= world_create;\n world->destroy= world_destroy;\n}\n<commit_msg>Updating the C++ test case file after making changes to the C++ interface.<commit_after>\/*\n C++ interface test\n*\/\n#include \"libmemcached\/memcached.hh\"\n\n#include <assert.h>\n#include <stdio.h>\n#include <stdlib.h>\n#include <string.h>\n#include <sys\/time.h>\n#include <sys\/types.h>\n#include <sys\/stat.h>\n#include <unistd.h>\n#include <time.h>\n#include \"server.h\"\n\n#include \"test.h\"\n\n#include <string>\n\nusing namespace std;\n\nextern \"C\" {\n test_return basic_test(memcached_st *memc);\n test_return increment_test(memcached_st *memc);\n test_return basic_master_key_test(memcached_st *memc);\n test_return mget_result_function(memcached_st *memc);\n test_return mget_test(memcached_st *memc);\n memcached_return callback_counter(memcached_st *,\n memcached_result_st *, \n void *context);\n void *world_create(void);\n void world_destroy(void *p);\n}\n\ntest_return basic_test(memcached_st *memc)\n{\n Memcached foo(memc);\n const string value_set(\"This is some data\");\n string value;\n size_t value_length;\n\n foo.set(\"mine\", value_set, 0, 0);\n value= foo.get(\"mine\", &value_length);\n\n assert((memcmp(value.c_str(), value_set.c_str(), value_length) == 0));\n\n return TEST_SUCCESS;\n}\n\ntest_return increment_test(memcached_st *memc)\n{\n Memcached mcach(memc);\n bool rc;\n const string key(\"inctest\");\n const string inc_value(\"1\");\n string ret_value;\n uint64_t int_inc_value;\n uint64_t int_ret_value;\n size_t value_length;\n\n mcach.set(key, inc_value, 0, 0);\n ret_value= mcach.get(key, &value_length);\n printf(\"\\nretvalue %s\\n\",ret_value.c_str());\n int_inc_value= uint64_t(atol(inc_value.c_str()));\n int_ret_value= uint64_t(atol(ret_value.c_str()));\n assert(int_ret_value == int_inc_value); \n\n rc= mcach.increment(key, 1, &int_ret_value);\n assert(rc == true);\n assert(int_ret_value == 2);\n\n rc= mcach.increment(key, 1, &int_ret_value);\n assert(rc == true);\n assert(int_ret_value == 3);\n\n rc= mcach.increment(key, 5, &int_ret_value);\n assert(rc == true);\n assert(int_ret_value == 8);\n\n return TEST_SUCCESS;\n}\n\ntest_return basic_master_key_test(memcached_st *memc)\n{\n Memcached foo(memc);\n const string value_set(\"Data for server A\");\n const string master_key_a(\"server-a\");\n const string master_key_b(\"server-b\");\n const string key(\"xyz\");\n string value;\n size_t value_length;\n\n foo.setByKey(master_key_a, key, value_set, 0, 0);\n value= foo.getByKey(master_key_a, key, &value_length);\n\n assert((memcmp(value.c_str(), value_set.c_str(), value_length) == 0));\n\n value= foo.getByKey(master_key_b, key, &value_length);\n assert((memcmp(value.c_str(), value_set.c_str(), value_length) == 0));\n\n return TEST_SUCCESS;\n}\n\n\/* Count the results *\/\nmemcached_return callback_counter(memcached_st *,\n memcached_result_st *, \n void *context)\n{\n unsigned int *counter= static_cast<unsigned int *>(context);\n\n *counter= *counter + 1;\n\n return MEMCACHED_SUCCESS;\n}\n\ntest_return mget_result_function(memcached_st *memc)\n{\n Memcached mc(memc);\n bool rc;\n string key1(\"fudge\");\n string key2(\"son\");\n string key3(\"food\");\n vector<string> keys;\n keys.reserve(3);\n keys.push_back(key1);\n keys.push_back(key2);\n keys.push_back(key3);\n unsigned int counter;\n memcached_execute_function callbacks[1];\n\n \/* We need to empty the server before we continue the test *\/\n rc= mc.flush(0);\n rc= mc.setAll(keys, keys, 50, 9);\n assert(rc == true);\n\n rc= mc.mget(keys);\n assert(rc == true);\n\n callbacks[0]= &callback_counter;\n counter= 0;\n rc= mc.fetchExecute(callbacks, static_cast<void *>(&counter), 1); \n\n assert(counter == 3);\n\n return TEST_SUCCESS;\n}\n\ntest_return mget_test(memcached_st *memc)\n{\n Memcached mc(memc);\n bool rc;\n memcached_return mc_rc;\n vector<string> keys;\n keys.reserve(3);\n keys.push_back(\"fudge\");\n keys.push_back(\"son\");\n keys.push_back(\"food\");\n uint32_t flags;\n\n string return_key;\n size_t return_key_length;\n string return_value;\n size_t return_value_length;\n\n \/* We need to empty the server before we continue the test *\/\n rc= mc.flush(0);\n assert(rc == true);\n\n rc= mc.mget(keys);\n assert(rc == true);\n\n while (mc.fetch(return_key, return_value, &return_key_length, \n &return_value_length, &flags, &mc_rc))\n {\n assert(return_value.length() != 0);\n }\n assert(return_value_length == 0);\n assert(mc_rc == MEMCACHED_END);\n\n rc= mc.setAll(keys, keys, 50, 9);\n assert(rc == true);\n\n rc= mc.mget(keys);\n assert(rc == true);\n\n while ((mc.fetch(return_key, return_value, &return_key_length, \n &return_value_length, &flags, &mc_rc)))\n {\n assert(return_value.length() != 0);\n assert(mc_rc == MEMCACHED_SUCCESS);\n assert(return_key_length == return_value_length);\n assert(!memcmp(return_value.c_str(), return_key.c_str(), return_value_length));\n }\n\n return TEST_SUCCESS;\n}\n\ntest_st tests[] ={\n { \"basic\", 0, basic_test },\n { \"basic_master_key\", 0, basic_master_key_test },\n { \"increment_test\", 0, increment_test },\n { \"mget\", 1, mget_test },\n { \"mget_result_function\", 1, mget_result_function },\n {0, 0, 0}\n};\n\ncollection_st collection[] ={\n {\"block\", 0, 0, tests},\n {0, 0, 0, 0}\n};\n\n#define SERVERS_TO_CREATE 1\n\nextern \"C\" void *world_create(void)\n{\n server_startup_st *construct;\n\n construct= (server_startup_st *)malloc(sizeof(server_startup_st));\n memset(construct, 0, sizeof(server_startup_st));\n\n construct->count= SERVERS_TO_CREATE;\n server_startup(construct);\n\n return construct;\n}\n\nvoid world_destroy(void *p)\n{\n server_startup_st *construct= static_cast<server_startup_st *>(p);\n memcached_server_st *servers=\n static_cast<memcached_server_st *>(construct->servers);\n memcached_server_list_free(servers);\n\n server_shutdown(construct);\n free(construct);\n}\n\nvoid get_world(world_st *world)\n{\n world->collections= collection;\n world->create= world_create;\n world->destroy= world_destroy;\n}\n<|endoftext|>"} {"text":"<commit_before>#include <iostream>\nusing namespace std;\nint& test(int& inval){\n return inval;\n}\nauto test2(int& inval) -> decltype(test(inval)){\n return test(inval);\n}\nint main(){\n int x = 1;\n cout<<x<<endl;\n int& try1=test(x);\n cout<<try1<<endl;\n x=2;\n cout<<try1<<endl;\n x=1;\n int &try2=test2(x);\n cout<<try2<<endl;\n x=2;\n cout<<try2<<endl;\n try2=3;\n cout<<x<<endl;\n return 0;\n}\n<commit_msg>Added documentation on input language<commit_after><|endoftext|>"} {"text":"<commit_before>\/*\n\tThis file is part of the CVD Library.\n\n\tCopyright (C) 2005 The Authors\n\n\tThis library is free software; you can redistribute it and\/or\n\tmodify it under the terms of the GNU Lesser General Public\n\tLicense as published by the Free Software Foundation; either\n\tversion 2.1 of the License, or (at your option) any later version.\n\n\tThis library is distributed in the hope that it will be useful,\n\tbut WITHOUT ANY WARRANTY; without even the implied warranty of\n\tMERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU\n\tLesser General Public License for more details.\n\n\tYou should have received a copy of the GNU Lesser General Public\n\tLicense along with this library; if not, write to the Free Software\n\tFoundation, Inc.,\n 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA\n*\/\ninline ImageRef::ImageRef()\n{\n\tx=y=0;\n}\n\ninline ImageRef::ImageRef(int xp, int yp)\n:x(xp),y(yp)\n{}\n\ninline ImageRef::ImageRef(std::istream& is)\n{\n\tis.read((char*)&x,sizeof(int));\n\tis.read((char*)&y,sizeof(int));\n}\n\n\t\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\t\/\/ the following cryptic pieces of rubbish are because inline functions \/\/\n\t\/\/ must have their one and only return function as the last call \/\/\n\t\/\/ so this code makes use of the fact that expressions to the right \/\/\n\t\/\/ of || are only evaluated when the left hand side is false \/\/\n\t\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\ninline bool ImageRef::next(const ImageRef& max)\t\/\/ move on to the next value\n{\n\treturn(++x != max.x || (x=0, ++y != max.y) || (y=0, false));\n}\n\ninline bool ImageRef::next(const ImageRef& min, const ImageRef& max)\n{\n\treturn (++x != max.x || (x=min.x, ++y != max.y) || (y=min.y, false));\n}\n\ninline bool ImageRef::prev(const ImageRef& max)\t\/\/ move back to the previous value\n{\n\treturn(--x != -1 || (x=max.x-1, --y != -1) || (y=max.y-1, false));\n}\n\ninline bool ImageRef::prev(const ImageRef& min, const ImageRef& max)\n{\n\treturn (--x != min.x-1 || (x=max.x-1, --y != min.y-1) || (y=max.y-1, false));\n}\n\ninline void ImageRef::home()\n{\n\tx=y=0;\n}\n\ninline void ImageRef::end(const ImageRef& size)\n{\n\tx=size.x-1;\n\ty=size.y-1;\n}\n\ninline ImageRef& ImageRef::operator=(const ImageRef& ref)\n{\n\tx=ref.x;\n\ty=ref.y;\n\treturn *this;\n}\n\ninline bool ImageRef::operator ==(const ImageRef& ref) const\n{\n\treturn (x==ref.x && y==ref.y);\n}\n\ninline bool ImageRef::operator !=(const ImageRef& ref) const\n{\n\treturn (x!=ref.x || y!=ref.y);\n}\n\ninline ImageRef ImageRef::operator-() const\n{\n ImageRef v(-x, -y);\n return v;\n}\n\ninline ImageRef& ImageRef::operator*=(const double scale)\n{\n x=(int)(x*scale);\n y=(int)(y*scale);\n return *this;\n}\n\ninline ImageRef& ImageRef::operator\/=(const double scale)\n{\n\tx=(int)(x\/scale);\n\ty=(int)(y\/scale);\n\treturn *this;\n}\n\ninline ImageRef& ImageRef::operator+=(const ImageRef rhs)\n{\n\tx+=rhs.x;\n\ty+=rhs.y;\n\treturn *this;\n}\n\ninline ImageRef& ImageRef::operator-=(const ImageRef rhs)\n{\n\tx-=rhs.x;\n\ty-=rhs.y;\n\treturn *this;\n}\n\ninline ImageRef ImageRef::operator*(const double scale) const\n{\n\tImageRef v((int)(x*scale),(int)(y*scale));\n\treturn v;\n}\n\ninline ImageRef ImageRef::operator\/(const double scale) const\n{\n\tImageRef v((int)(x\/scale),(int)(y\/scale));\n\treturn v;\n}\n\ninline ImageRef ImageRef::operator+(const ImageRef rhs) const\n{\n\tImageRef v(x+rhs.x, y+rhs.y);\n\treturn v;\n}\n\ninline ImageRef ImageRef::operator-(const ImageRef rhs) const\n{\n\tImageRef v(x-rhs.x, y-rhs.y);\n\treturn v;\n}\n\ninline ImageRef& ImageRef::operator<<=(int i)\n{\n\tx = x << i;\n\ty=y << i;\n\treturn *this;\n}\n\ninline ImageRef& ImageRef::operator>>=(int i)\n{\n\tx = x >> i;\n\ty=y >> i;\n\treturn *this;\n}\n\ninline ImageRef ImageRef::shiftl(int i) const\n{\n\tImageRef result;\n\tresult.x = x << i;\n\tresult.y=y << i;\n\treturn result;\n}\n\ninline ImageRef ImageRef::shiftr(int i) const\n{\n\tImageRef result;\n\tresult.x = x >> i;\n\tresult.y=y >> i;\n\treturn result;\n}\n\ninline ImageRef ImageRef::operator<<(int i) const\n{\n\treturn shiftl(i);\n}\n\ninline ImageRef ImageRef::operator>>(int i) const\n{\n\treturn shiftr(i);\n}\n\n\ninline ImageRef operator*(const int scale, const ImageRef& ref)\n{\n\treturn ImageRef(ref.x*scale, ref.y*scale);\n}\n\ninline bool ImageRef::operator<(const ImageRef & other) const\n{\n\treturn x < other.x || ( x == other.x && y < other.y);\n}\n\n\ninline int& ImageRef::operator[](int i)\n{\n if(i==0)\n return x;\n if(i==1)\n return y;\n throw Exceptions::BadSubscript();\n}\n\ninline unsigned int ImageRef::mag_squared() const\n{\n return (unsigned int) (x*x + y*y);\n}\n<commit_msg>Minor change to mag_squared(), to make it a little less likely to overflow.<commit_after>\/*\n\tThis file is part of the CVD Library.\n\n\tCopyright (C) 2005 The Authors\n\n\tThis library is free software; you can redistribute it and\/or\n\tmodify it under the terms of the GNU Lesser General Public\n\tLicense as published by the Free Software Foundation; either\n\tversion 2.1 of the License, or (at your option) any later version.\n\n\tThis library is distributed in the hope that it will be useful,\n\tbut WITHOUT ANY WARRANTY; without even the implied warranty of\n\tMERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU\n\tLesser General Public License for more details.\n\n\tYou should have received a copy of the GNU Lesser General Public\n\tLicense along with this library; if not, write to the Free Software\n\tFoundation, Inc.,\n 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA\n*\/\ninline ImageRef::ImageRef()\n{\n\tx=y=0;\n}\n\ninline ImageRef::ImageRef(int xp, int yp)\n:x(xp),y(yp)\n{}\n\ninline ImageRef::ImageRef(std::istream& is)\n{\n\tis.read((char*)&x,sizeof(int));\n\tis.read((char*)&y,sizeof(int));\n}\n\n\t\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\t\/\/ the following cryptic pieces of rubbish are because inline functions \/\/\n\t\/\/ must have their one and only return function as the last call \/\/\n\t\/\/ so this code makes use of the fact that expressions to the right \/\/\n\t\/\/ of || are only evaluated when the left hand side is false \/\/\n\t\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\ninline bool ImageRef::next(const ImageRef& max)\t\/\/ move on to the next value\n{\n\treturn(++x != max.x || (x=0, ++y != max.y) || (y=0, false));\n}\n\ninline bool ImageRef::next(const ImageRef& min, const ImageRef& max)\n{\n\treturn (++x != max.x || (x=min.x, ++y != max.y) || (y=min.y, false));\n}\n\ninline bool ImageRef::prev(const ImageRef& max)\t\/\/ move back to the previous value\n{\n\treturn(--x != -1 || (x=max.x-1, --y != -1) || (y=max.y-1, false));\n}\n\ninline bool ImageRef::prev(const ImageRef& min, const ImageRef& max)\n{\n\treturn (--x != min.x-1 || (x=max.x-1, --y != min.y-1) || (y=max.y-1, false));\n}\n\ninline void ImageRef::home()\n{\n\tx=y=0;\n}\n\ninline void ImageRef::end(const ImageRef& size)\n{\n\tx=size.x-1;\n\ty=size.y-1;\n}\n\ninline ImageRef& ImageRef::operator=(const ImageRef& ref)\n{\n\tx=ref.x;\n\ty=ref.y;\n\treturn *this;\n}\n\ninline bool ImageRef::operator ==(const ImageRef& ref) const\n{\n\treturn (x==ref.x && y==ref.y);\n}\n\ninline bool ImageRef::operator !=(const ImageRef& ref) const\n{\n\treturn (x!=ref.x || y!=ref.y);\n}\n\ninline ImageRef ImageRef::operator-() const\n{\n ImageRef v(-x, -y);\n return v;\n}\n\ninline ImageRef& ImageRef::operator*=(const double scale)\n{\n x=(int)(x*scale);\n y=(int)(y*scale);\n return *this;\n}\n\ninline ImageRef& ImageRef::operator\/=(const double scale)\n{\n\tx=(int)(x\/scale);\n\ty=(int)(y\/scale);\n\treturn *this;\n}\n\ninline ImageRef& ImageRef::operator+=(const ImageRef rhs)\n{\n\tx+=rhs.x;\n\ty+=rhs.y;\n\treturn *this;\n}\n\ninline ImageRef& ImageRef::operator-=(const ImageRef rhs)\n{\n\tx-=rhs.x;\n\ty-=rhs.y;\n\treturn *this;\n}\n\ninline ImageRef ImageRef::operator*(const double scale) const\n{\n\tImageRef v((int)(x*scale),(int)(y*scale));\n\treturn v;\n}\n\ninline ImageRef ImageRef::operator\/(const double scale) const\n{\n\tImageRef v((int)(x\/scale),(int)(y\/scale));\n\treturn v;\n}\n\ninline ImageRef ImageRef::operator+(const ImageRef rhs) const\n{\n\tImageRef v(x+rhs.x, y+rhs.y);\n\treturn v;\n}\n\ninline ImageRef ImageRef::operator-(const ImageRef rhs) const\n{\n\tImageRef v(x-rhs.x, y-rhs.y);\n\treturn v;\n}\n\ninline ImageRef& ImageRef::operator<<=(int i)\n{\n\tx = x << i;\n\ty=y << i;\n\treturn *this;\n}\n\ninline ImageRef& ImageRef::operator>>=(int i)\n{\n\tx = x >> i;\n\ty=y >> i;\n\treturn *this;\n}\n\ninline ImageRef ImageRef::shiftl(int i) const\n{\n\tImageRef result;\n\tresult.x = x << i;\n\tresult.y=y << i;\n\treturn result;\n}\n\ninline ImageRef ImageRef::shiftr(int i) const\n{\n\tImageRef result;\n\tresult.x = x >> i;\n\tresult.y=y >> i;\n\treturn result;\n}\n\ninline ImageRef ImageRef::operator<<(int i) const\n{\n\treturn shiftl(i);\n}\n\ninline ImageRef ImageRef::operator>>(int i) const\n{\n\treturn shiftr(i);\n}\n\n\ninline ImageRef operator*(const int scale, const ImageRef& ref)\n{\n\treturn ImageRef(ref.x*scale, ref.y*scale);\n}\n\ninline bool ImageRef::operator<(const ImageRef & other) const\n{\n\treturn x < other.x || ( x == other.x && y < other.y);\n}\n\n\ninline int& ImageRef::operator[](int i)\n{\n if(i==0)\n return x;\n if(i==1)\n return y;\n throw Exceptions::BadSubscript();\n}\n\ninline unsigned int ImageRef::mag_squared() const\n{\n typedef unsigned int uint;\n return uint(x*x) + uint(y*y);\n}\n<|endoftext|>"} {"text":"<commit_before>\/* -*- Mode: C; tab-width: 4; indent-tabs-mode: nil; c-basic-offset: 4 -*-\n\n * Copyright (C) 2013 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 <stdlib.h>\n#include <fnmatch.h>\n#include \"dnf-reldep.h\"\n#include \"dnf-sack-private.hpp\"\n#include \"hy-subject.h\"\n#include \"hy-iutil-private.hpp\"\n#include \"nevra.hpp\"\n#include \"nsvcap.hpp\"\n#include \"hy-types.h\"\n#include \"hy-query-private.hpp\"\n#include \"hy-selector.h\"\n#include \"hy-util-private.hpp\"\n#include \"sack\/packageset.hpp\"\n\n\/\/ most specific to least\nconst HyForm HY_FORMS_MOST_SPEC[] = {\n HY_FORM_NEVRA, HY_FORM_NA, HY_FORM_NAME, HY_FORM_NEVR, HY_FORM_NEV, _HY_FORM_STOP_ };\n\nconst HyModuleForm HY_MODULE_FORMS_MOST_SPEC[] = {\n HY_MODULE_FORM_NSVCAP,\n HY_MODULE_FORM_NSVCA,\n HY_MODULE_FORM_NSVAP,\n HY_MODULE_FORM_NSVA,\n HY_MODULE_FORM_NSAP,\n HY_MODULE_FORM_NSA,\n HY_MODULE_FORM_NSVCP,\n HY_MODULE_FORM_NSVP,\n HY_MODULE_FORM_NSVC,\n HY_MODULE_FORM_NSV,\n HY_MODULE_FORM_NSP,\n HY_MODULE_FORM_NS,\n HY_MODULE_FORM_NAP,\n HY_MODULE_FORM_NA,\n HY_MODULE_FORM_NP,\n HY_MODULE_FORM_N,\n _HY_MODULE_FORM_STOP_};\n\nHySubject\nhy_subject_create(const char * pattern)\n{\n return g_strdup(pattern);\n}\n\nvoid\nhy_subject_free(HySubject subject)\n{\n g_free(subject);\n}\n\n\/* Given a subject, attempt to create a query choose the first one, and update\n * the query to try to match it.\n *\n * Since then, it was amended to add a `with_src` flag to avoid finding source packages\n * from provides.\n *\/\nHyQuery\nhy_subject_get_best_solution(HySubject subject, DnfSack *sack, HyForm *forms, HyNevra *out_nevra,\n gboolean icase, gboolean with_nevra, gboolean with_provides,\n gboolean with_filenames, gboolean with_src)\n{\n if (with_nevra) {\n libdnf::Nevra nevraObj;\n const auto tryForms = !forms ? HY_FORMS_MOST_SPEC : forms;\n for (std::size_t i = 0; tryForms[i] != _HY_FORM_STOP_; ++i) {\n if (nevraObj.parse(subject, tryForms[i])) {\n auto query = hy_query_from_nevra(&nevraObj, sack, icase);\n if (!with_src)\n hy_query_filter(query, HY_PKG_ARCH, HY_NEQ, \"src\");\n if (!hy_query_is_empty(query)) {\n *out_nevra = new libdnf::Nevra(std::move(nevraObj));\n return query;\n }\n hy_query_free(query);\n }\n }\n *out_nevra = nullptr;\n if (!forms) {\n auto query = hy_query_create(sack);\n if (!with_src)\n hy_query_filter(query, HY_PKG_ARCH, HY_NEQ, \"src\");\n hy_query_filter(query, HY_PKG_NEVRA, HY_GLOB, subject);\n if (!hy_query_is_empty(query))\n return query;\n hy_query_free(query);\n }\n }\n\n if (with_provides) {\n auto query = hy_query_create(sack);\n if (!with_src)\n hy_query_filter(query, HY_PKG_ARCH, HY_NEQ, \"src\");\n hy_query_filter(query, HY_PKG_PROVIDES, HY_GLOB, subject);\n if (!hy_query_is_empty(query))\n return query;\n hy_query_free(query);\n }\n\n if (with_filenames && hy_is_file_pattern(subject)) {\n auto query = hy_query_create(sack);\n if (!with_src)\n hy_query_filter(query, HY_PKG_ARCH, HY_NEQ, \"src\");\n hy_query_filter(query, HY_PKG_FILE, HY_GLOB, subject);\n return query;\n }\n\n auto query = hy_query_create(sack);\n hy_query_filter_empty(query);\n return query;\n}\n\n\nHySelector\nhy_subject_get_best_selector(HySubject subject, DnfSack *sack, HyForm *forms, bool obsoletes,\n const char *reponame)\n{\n HyNevra nevra{nullptr};\n HyQuery query = hy_subject_get_best_solution(subject, sack, forms, &nevra, FALSE, TRUE, TRUE,\n TRUE, false);\n if (!hy_query_is_empty(query)) {\n if (obsoletes && nevra && nevra->hasJustName()) {\n DnfPackageSet *pset;\n pset = hy_query_run_set(query);\n HyQuery query_obsoletes = hy_query_clone(query);\n hy_query_filter_package_in(query_obsoletes, HY_PKG_OBSOLETES, HY_EQ, pset);\n delete pset;\n hy_query_union(query, query_obsoletes);\n hy_query_free(query_obsoletes);\n }\n if (reponame != NULL) {\n HyQuery installed_query = hy_query_clone(query);\n hy_query_filter(installed_query, HY_PKG_REPONAME, HY_EQ, HY_SYSTEM_REPO_NAME);\n hy_query_filter(query, HY_PKG_REPONAME, HY_EQ, reponame);\n hy_query_union(query, installed_query);\n hy_query_free(installed_query);\n }\n }\n delete nevra;\n HySelector selector = hy_query_to_selector(query);\n hy_query_free(query);\n return selector;\n}\n<commit_msg>Apply src filtering more efficiently<commit_after>\/* -*- Mode: C; tab-width: 4; indent-tabs-mode: nil; c-basic-offset: 4 -*-\n\n * Copyright (C) 2013 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 <stdlib.h>\n#include <fnmatch.h>\n#include \"dnf-reldep.h\"\n#include \"dnf-sack-private.hpp\"\n#include \"hy-subject.h\"\n#include \"hy-iutil-private.hpp\"\n#include \"nevra.hpp\"\n#include \"nsvcap.hpp\"\n#include \"hy-types.h\"\n#include \"hy-query-private.hpp\"\n#include \"hy-selector.h\"\n#include \"hy-util-private.hpp\"\n#include \"sack\/packageset.hpp\"\n\n\/\/ most specific to least\nconst HyForm HY_FORMS_MOST_SPEC[] = {\n HY_FORM_NEVRA, HY_FORM_NA, HY_FORM_NAME, HY_FORM_NEVR, HY_FORM_NEV, _HY_FORM_STOP_ };\n\nconst HyModuleForm HY_MODULE_FORMS_MOST_SPEC[] = {\n HY_MODULE_FORM_NSVCAP,\n HY_MODULE_FORM_NSVCA,\n HY_MODULE_FORM_NSVAP,\n HY_MODULE_FORM_NSVA,\n HY_MODULE_FORM_NSAP,\n HY_MODULE_FORM_NSA,\n HY_MODULE_FORM_NSVCP,\n HY_MODULE_FORM_NSVP,\n HY_MODULE_FORM_NSVC,\n HY_MODULE_FORM_NSV,\n HY_MODULE_FORM_NSP,\n HY_MODULE_FORM_NS,\n HY_MODULE_FORM_NAP,\n HY_MODULE_FORM_NA,\n HY_MODULE_FORM_NP,\n HY_MODULE_FORM_N,\n _HY_MODULE_FORM_STOP_};\n\nHySubject\nhy_subject_create(const char * pattern)\n{\n return g_strdup(pattern);\n}\n\nvoid\nhy_subject_free(HySubject subject)\n{\n g_free(subject);\n}\n\n\/* Given a subject, attempt to create a query choose the first one, and update\n * the query to try to match it.\n *\n * Since then, it was amended to add a `with_src` flag to avoid finding source packages\n * from provides.\n *\/\nHyQuery\nhy_subject_get_best_solution(HySubject subject, DnfSack *sack, HyForm *forms, HyNevra *out_nevra,\n gboolean icase, gboolean with_nevra, gboolean with_provides,\n gboolean with_filenames, gboolean with_src)\n{\n libdnf::Query baseQuery(sack);\n if (!with_src) {\n baseQuery.addFilter(HY_PKG_ARCH, HY_NEQ, \"src\");\n }\n baseQuery.apply();\n if (with_nevra) {\n libdnf::Nevra nevraObj;\n const auto tryForms = !forms ? HY_FORMS_MOST_SPEC : forms;\n for (std::size_t i = 0; tryForms[i] != _HY_FORM_STOP_; ++i) {\n if (nevraObj.parse(subject, tryForms[i])) {\n auto query = std::unique_ptr<libdnf::Query>(new libdnf::Query(baseQuery));\n query->addFilter(&nevraObj, icase);\n if (!query->empty()) {\n *out_nevra = new libdnf::Nevra(std::move(nevraObj));\n return query.release();\n }\n }\n }\n *out_nevra = nullptr;\n if (!forms) {\n auto query = std::unique_ptr<libdnf::Query>(new libdnf::Query(baseQuery));\n query->addFilter(HY_PKG_NEVRA, HY_GLOB, subject);\n if (!query->empty())\n return query.release();\n }\n }\n\n if (with_provides) {\n auto query = std::unique_ptr<libdnf::Query>(new libdnf::Query(baseQuery));\n query->addFilter(HY_PKG_PROVIDES, HY_GLOB, subject);\n if (!query->empty())\n return query.release();\n }\n\n if (with_filenames && hy_is_file_pattern(subject)) {\n auto query = std::unique_ptr<libdnf::Query>(new libdnf::Query(baseQuery));\n query->addFilter(HY_PKG_FILE, HY_GLOB, subject);\n return query.release();\n }\n\n auto query = std::unique_ptr<libdnf::Query>(new libdnf::Query(baseQuery));\n query->addFilter(HY_PKG_EMPTY, HY_EQ, 1);\n return query.release();\n}\n\n\nHySelector\nhy_subject_get_best_selector(HySubject subject, DnfSack *sack, HyForm *forms, bool obsoletes,\n const char *reponame)\n{\n HyNevra nevra{nullptr};\n HyQuery query = hy_subject_get_best_solution(subject, sack, forms, &nevra, FALSE, TRUE, TRUE,\n TRUE, false);\n if (!hy_query_is_empty(query)) {\n if (obsoletes && nevra && nevra->hasJustName()) {\n DnfPackageSet *pset;\n pset = hy_query_run_set(query);\n HyQuery query_obsoletes = hy_query_clone(query);\n hy_query_filter_package_in(query_obsoletes, HY_PKG_OBSOLETES, HY_EQ, pset);\n delete pset;\n hy_query_union(query, query_obsoletes);\n hy_query_free(query_obsoletes);\n }\n if (reponame != NULL) {\n HyQuery installed_query = hy_query_clone(query);\n hy_query_filter(installed_query, HY_PKG_REPONAME, HY_EQ, HY_SYSTEM_REPO_NAME);\n hy_query_filter(query, HY_PKG_REPONAME, HY_EQ, reponame);\n hy_query_union(query, installed_query);\n hy_query_free(installed_query);\n }\n }\n delete nevra;\n HySelector selector = hy_query_to_selector(query);\n hy_query_free(query);\n return selector;\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 Ethash.cpp\n * @author Gav Wood <i@gavwood.com>\n * @date 2014\n *\/\n\n#include \"Ethash.h\"\n\n#include <boost\/detail\/endian.hpp>\n#include <boost\/filesystem.hpp>\n#include <boost\/algorithm\/string.hpp>\n#include <chrono>\n#include <array>\n#include <thread>\n#include <random>\n#include <thread>\n#include <libdevcore\/Guards.h>\n#include <libdevcore\/Log.h>\n#include <libdevcore\/Common.h>\n#include <libdevcore\/CommonIO.h>\n#include <libdevcrypto\/CryptoPP.h>\n#include <libdevcore\/FileSystem.h>\n#include <libethash\/ethash.h>\n#include <libethash\/internal.h>\n#if ETH_ETHASHCL || !ETH_TRUE\n#include <libethash-cl\/ethash_cl_miner.h>\n#endif\n#if ETH_CPUID || !ETH_TRUE\n#define HAVE_STDINT_H\n#include <libcpuid\/libcpuid.h>\n#endif\n#include \"BlockInfo.h\"\n#include \"EthashAux.h\"\nusing namespace std;\nusing namespace std::chrono;\n\nnamespace dev\n{\nnamespace eth\n{\n\nconst Ethash::WorkPackage Ethash::NullWorkPackage = Ethash::WorkPackage();\n\nstd::string Ethash::name()\n{\n\treturn \"Ethash\";\n}\n\nunsigned Ethash::revision()\n{\n\treturn ETHASH_REVISION;\n}\n\nEthash::WorkPackage Ethash::package(BlockInfo const& _bi)\n{\n\tWorkPackage ret;\n\tret.boundary = _bi.boundary();\n\tret.headerHash = _bi.headerHash(WithoutNonce);\n\tret.seedHash = _bi.seedHash();\n\treturn ret;\n}\n\nvoid Ethash::ensurePrecomputed(unsigned _number)\n{\n\tif (_number % ETHASH_EPOCH_LENGTH > ETHASH_EPOCH_LENGTH * 9 \/ 10)\n\t\t\/\/ 90% of the way to the new epoch\n\t\tEthashAux::computeFull(EthashAux::seedHash(_number + ETHASH_EPOCH_LENGTH), true);\n}\n\nvoid Ethash::prep(BlockInfo const& _header, std::function<int(unsigned)> const& _f)\n{\n\tEthashAux::full(_header.seedHash(), true, _f);\n}\n\nbool Ethash::preVerify(BlockInfo const& _header)\n{\n\tif (_header.number >= ETHASH_EPOCH_LENGTH * 2048)\n\t\treturn false;\n\n\th256 boundary = u256((bigint(1) << 256) \/ _header.difficulty);\n\n\tbool ret = !!ethash_quick_check_difficulty(\n\t\t\t(ethash_h256_t const*)_header.headerHash(WithoutNonce).data(),\n\t\t\t(uint64_t)(u64)_header.nonce,\n\t\t\t(ethash_h256_t const*)_header.mixHash.data(),\n\t\t\t(ethash_h256_t const*)boundary.data());\n\n\treturn ret;\n}\n\nbool Ethash::verify(BlockInfo const& _header)\n{\n\tbool pre = preVerify(_header);\n#if !ETH_DEBUG\n\tif (!pre)\n\t{\n\t\tcdebug << \"Fail on preVerify\";\n\t\treturn false;\n\t}\n#endif\n\n\tauto result = EthashAux::eval(_header);\n\tbool slow = result.value <= _header.boundary() && result.mixHash == _header.mixHash;\n\n\/\/\tcdebug << (slow ? \"VERIFY\" : \"VERYBAD\");\n\/\/\tcdebug << result.value.hex() << _header.boundary().hex();\n\/\/\tcdebug << result.mixHash.hex() << _header.mixHash.hex();\n\n#if ETH_DEBUG || !ETH_TRUE\n\tif (!pre && slow)\n\t{\n\t\tcwarn << \"WARNING: evaluated result gives true whereas ethash_quick_check_difficulty gives false.\";\n\t\tcwarn << \"headerHash:\" << _header.headerHash(WithoutNonce);\n\t\tcwarn << \"nonce:\" << _header.nonce;\n\t\tcwarn << \"mixHash:\" << _header.mixHash;\n\t\tcwarn << \"difficulty:\" << _header.difficulty;\n\t\tcwarn << \"boundary:\" << _header.boundary();\n\t\tcwarn << \"result.value:\" << result.value;\n\t\tcwarn << \"result.mixHash:\" << result.mixHash;\n\t}\n#endif\n\n\treturn slow;\n}\n\nunsigned Ethash::CPUMiner::s_numInstances = 0;\n\nvoid Ethash::CPUMiner::workLoop()\n{\n\tauto tid = std::this_thread::get_id();\n\tstatic std::mt19937_64 s_eng((time(0) + std::hash<decltype(tid)>()(tid)));\n\n\tuint64_t tryNonce = (uint64_t)(u64)Nonce::random(s_eng);\n\tethash_return_value ethashReturn;\n\n\tWorkPackage w = work();\n\n\tEthashAux::FullType dag;\n\twhile (!shouldStop() && !dag)\n\t{\n\t\twhile (!shouldStop() && EthashAux::computeFull(w.seedHash, true) != 100)\n\t\t\tthis_thread::sleep_for(chrono::milliseconds(500));\n\t\tdag = EthashAux::full(w.seedHash, false);\n\t}\n\n\th256 boundary = w.boundary;\n\tunsigned hashCount = 1;\n\tfor (; !shouldStop(); tryNonce++, hashCount++)\n\t{\n\t\tethashReturn = ethash_full_compute(dag->full, *(ethash_h256_t*)w.headerHash.data(), tryNonce);\n\t\th256 value = h256((uint8_t*)ðashReturn.result, h256::ConstructFromPointer);\n\t\tif (value <= boundary && submitProof(Solution{(Nonce)(u64)tryNonce, h256((uint8_t*)ðashReturn.mix_hash, h256::ConstructFromPointer)}))\n\t\t\tbreak;\n\t\tif (!(hashCount % 100))\n\t\t\taccumulateHashes(100);\n\t}\n}\n\nstatic string jsonEncode(map<string, string> const& _m)\n{\n\tstring ret = \"{\";\n\n\tfor (auto const& i: _m)\n\t{\n\t\tstring k = boost::replace_all_copy(boost::replace_all_copy(i.first, \"\\\\\", \"\\\\\\\\\"), \"'\", \"\\\\'\");\n\t\tstring v = boost::replace_all_copy(boost::replace_all_copy(i.second, \"\\\\\", \"\\\\\\\\\"), \"'\", \"\\\\'\");\n\t\tif (ret.size() > 1)\n\t\t\tret += \", \";\n\t\tret += \"\\\"\" + k + \"\\\":\\\"\" + v + \"\\\"\";\n\t}\n\n\treturn ret + \"}\";\n}\n\nstd::string Ethash::CPUMiner::platformInfo()\n{\n\tstring baseline = toString(std::thread::hardware_concurrency()) + \"-thread CPU\";\n#if ETH_CPUID || !ETH_TRUE\n\tif (!cpuid_present())\n\t\treturn baseline;\n\tstruct cpu_raw_data_t raw;\n\tstruct cpu_id_t data;\n\tif (cpuid_get_raw_data(&raw) < 0)\n\t\treturn baseline;\n\tif (cpu_identify(&raw, &data) < 0)\n\t\treturn baseline;\n\tmap<string, string> m;\n\tm[\"vendor\"] = data.vendor_str;\n\tm[\"codename\"] = data.cpu_codename;\n\tm[\"brand\"] = data.brand_str;\n\tm[\"L1 cache\"] = toString(data.l1_data_cache);\n\tm[\"L2 cache\"] = toString(data.l2_cache);\n\tm[\"L3 cache\"] = toString(data.l3_cache);\n\tm[\"cores\"] = toString(data.num_cores);\n\tm[\"threads\"] = toString(data.num_logical_cpus);\n\tm[\"clocknominal\"] = toString(cpu_clock_by_os());\n\tm[\"clocktested\"] = toString(cpu_clock_measure(200, 0));\n\t\/*\n\tprintf(\" MMX : %s\\n\", data.flags[CPU_FEATURE_MMX] ? \"present\" : \"absent\");\n\tprintf(\" MMX-extended: %s\\n\", data.flags[CPU_FEATURE_MMXEXT] ? \"present\" : \"absent\");\n\tprintf(\" SSE : %s\\n\", data.flags[CPU_FEATURE_SSE] ? \"present\" : \"absent\");\n\tprintf(\" SSE2 : %s\\n\", data.flags[CPU_FEATURE_SSE2] ? \"present\" : \"absent\");\n\tprintf(\" 3DNow! : %s\\n\", data.flags[CPU_FEATURE_3DNOW] ? \"present\" : \"absent\");\n\t*\/\n\treturn jsonEncode(m);\n#else\n\treturn baseline;\n#endif\n}\n\n#if ETH_ETHASHCL || !ETH_TRUE\n\nclass EthashCLHook: public ethash_cl_miner::search_hook\n{\npublic:\n\tEthashCLHook(Ethash::GPUMiner* _owner): m_owner(_owner) {}\n\n\tvoid abort()\n\t{\n\t\tGuard l(x_all);\n\t\tif (m_aborted)\n\t\t\treturn;\n\/\/\t\tcdebug << \"Attempting to abort\";\n\t\tm_abort = true;\n\t\tfor (unsigned timeout = 0; timeout < 100 && !m_aborted; ++timeout)\n\t\t\tstd::this_thread::sleep_for(chrono::milliseconds(30));\n\/\/\t\tif (!m_aborted)\n\/\/\t\t\tcwarn << \"Couldn't abort. Abandoning OpenCL process.\";\n\t}\n\n\tvoid reset()\n\t{\n\t\tm_aborted = m_abort = false;\n\t}\n\nprotected:\n\tvirtual bool found(uint64_t const* _nonces, uint32_t _count) override\n\t{\n\/\/\t\tdev::operator <<(std::cerr << \"Found nonces: \", vector<uint64_t>(_nonces, _nonces + _count)) << std::endl;\n\t\tfor (uint32_t i = 0; i < _count; ++i)\n\t\t{\n\t\t\tif (m_owner->report(_nonces[i]))\n\t\t\t{\n\t\t\t\tm_aborted = true;\n\t\t\t\treturn true;\n\t\t\t}\n\t\t}\n\t\treturn m_owner->shouldStop();\n\t}\n\n\tvirtual bool searched(uint64_t _startNonce, uint32_t _count) override\n\t{\n\t\tGuard l(x_all);\n\/\/\t\tstd::cerr << \"Searched \" << _count << \" from \" << _startNonce << std::endl;\n\t\tm_owner->accumulateHashes(_count);\n\t\tm_last = _startNonce + _count;\n\t\tif (m_abort || m_owner->shouldStop())\n\t\t{\n\t\t\tm_aborted = true;\n\t\t\treturn true;\n\t\t}\n\t\treturn false;\n\t}\n\nprivate:\n\tMutex x_all;\n\tuint64_t m_last;\n\tbool m_abort = false;\n\tbool m_aborted = true;\n\tEthash::GPUMiner* m_owner = nullptr;\n};\n\nunsigned Ethash::GPUMiner::s_platformId = 0;\nunsigned Ethash::GPUMiner::s_deviceId = 0;\nunsigned Ethash::GPUMiner::s_numInstances = 0;\n\nEthash::GPUMiner::GPUMiner(ConstructionInfo const& _ci):\n\tMiner(_ci),\n\tWorker(\"gpuminer\" + toString(index())),\n\tm_hook(new EthashCLHook(this))\n{\n}\n\nEthash::GPUMiner::~GPUMiner()\n{\n\tpause();\n\tdelete m_miner;\n\tdelete m_hook;\n}\n\nbool Ethash::GPUMiner::report(uint64_t _nonce)\n{\n\tNonce n = (Nonce)(u64)_nonce;\n\tResult r = EthashAux::eval(work().seedHash, work().headerHash, n);\n\tif (r.value < work().boundary)\n\t\treturn submitProof(Solution{n, r.mixHash});\n\treturn false;\n}\n\nvoid Ethash::GPUMiner::kickOff()\n{\n\tm_hook->reset();\n\tstartWorking();\n}\n\nvoid Ethash::GPUMiner::workLoop()\n{\n\t\/\/ take local copy of work since it may end up being overwritten by kickOff\/pause.\n\ttry {\n\t\tWorkPackage w = work();\n\t\tcnote << \"workLoop\" << !!m_miner << m_minerSeed << w.seedHash;\n\t\tif (!m_miner || m_minerSeed != w.seedHash)\n\t\t{\n\t\t\tcnote << \"Initialising miner...\";\n\t\t\tm_minerSeed = w.seedHash;\n\n\t\t\tdelete m_miner;\n\t\t\tm_miner = new ethash_cl_miner;\n\n\t\t\tunsigned device = instances() > 1 ? index() : s_deviceId;\n\n\t\t\tEthashAux::FullType dag;\n\t\t\twhile (true)\n\t\t\t{\n\t\t\t\tif ((dag = EthashAux::full(w.seedHash, true)))\n\t\t\t\t\tbreak;\n\t\t\t\tif (shouldStop())\n\t\t\t\t{\n\t\t\t\t\tdelete m_miner;\n\t\t\t\t\tm_miner = nullptr;\n\t\t\t\t\treturn;\n\t\t\t\t}\n\t\t\t\tcnote << \"Awaiting DAG\";\n\t\t\t\tthis_thread::sleep_for(chrono::milliseconds(500));\n\t\t\t}\n\t\t\tbytesConstRef dagData = dag->data();\n\t\t\tm_miner->init(dagData.data(), dagData.size(), 32, s_platformId, device);\n\t\t}\n\n\t\tuint64_t upper64OfBoundary = (uint64_t)(u64)((u256)w.boundary >> 192);\n\t\tm_miner->search(w.headerHash.data(), upper64OfBoundary, *m_hook);\n\t}\n\tcatch (cl::Error const& _e)\n\t{\n\t\tdelete m_miner;\n\t\tm_miner = nullptr;\n\t\tcwarn << \"Error GPU mining: \" << _e.what() << \"(\" << _e.err() << \")\";\n\t}\n}\n\nvoid Ethash::GPUMiner::pause()\n{\n\tm_hook->abort();\n\tstopWorking();\n}\n\nstd::string Ethash::GPUMiner::platformInfo()\n{\n\treturn ethash_cl_miner::platform_info(s_platformId, s_deviceId);\n}\n\nunsigned Ethash::GPUMiner::getNumDevices()\n{\n\treturn ethash_cl_miner::getNumDevices(s_platformId);\n}\n\nvoid Ethash::GPUMiner::listDevices()\n{\n\treturn ethash_cl_miner::listDevices();\n}\n\nbool Ethash::GPUMiner::configureGPU(\n\tunsigned _platformId,\n\tunsigned _deviceId,\n\tbool _allowCPU,\n\tunsigned _extraGPUMemory,\n\tbool _forceSingleChunk,\n\tboost::optional<uint64_t> _currentBlock\n)\n{\n\ts_platformId = _platformId;\n\ts_deviceId = _deviceId;\n\treturn ethash_cl_miner::configureGPU(_allowCPU, _extraGPUMemory, _forceSingleChunk, _currentBlock);\n}\n\n#endif\n\n}\n}\n<commit_msg>Switch to warning.<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 Ethash.cpp\n * @author Gav Wood <i@gavwood.com>\n * @date 2014\n *\/\n\n#include \"Ethash.h\"\n\n#include <boost\/detail\/endian.hpp>\n#include <boost\/filesystem.hpp>\n#include <boost\/algorithm\/string.hpp>\n#include <chrono>\n#include <array>\n#include <thread>\n#include <random>\n#include <thread>\n#include <libdevcore\/Guards.h>\n#include <libdevcore\/Log.h>\n#include <libdevcore\/Common.h>\n#include <libdevcore\/CommonIO.h>\n#include <libdevcrypto\/CryptoPP.h>\n#include <libdevcore\/FileSystem.h>\n#include <libethash\/ethash.h>\n#include <libethash\/internal.h>\n#if ETH_ETHASHCL || !ETH_TRUE\n#include <libethash-cl\/ethash_cl_miner.h>\n#endif\n#if ETH_CPUID || !ETH_TRUE\n#define HAVE_STDINT_H\n#include <libcpuid\/libcpuid.h>\n#endif\n#include \"BlockInfo.h\"\n#include \"EthashAux.h\"\nusing namespace std;\nusing namespace std::chrono;\n\nnamespace dev\n{\nnamespace eth\n{\n\nconst Ethash::WorkPackage Ethash::NullWorkPackage = Ethash::WorkPackage();\n\nstd::string Ethash::name()\n{\n\treturn \"Ethash\";\n}\n\nunsigned Ethash::revision()\n{\n\treturn ETHASH_REVISION;\n}\n\nEthash::WorkPackage Ethash::package(BlockInfo const& _bi)\n{\n\tWorkPackage ret;\n\tret.boundary = _bi.boundary();\n\tret.headerHash = _bi.headerHash(WithoutNonce);\n\tret.seedHash = _bi.seedHash();\n\treturn ret;\n}\n\nvoid Ethash::ensurePrecomputed(unsigned _number)\n{\n\tif (_number % ETHASH_EPOCH_LENGTH > ETHASH_EPOCH_LENGTH * 9 \/ 10)\n\t\t\/\/ 90% of the way to the new epoch\n\t\tEthashAux::computeFull(EthashAux::seedHash(_number + ETHASH_EPOCH_LENGTH), true);\n}\n\nvoid Ethash::prep(BlockInfo const& _header, std::function<int(unsigned)> const& _f)\n{\n\tEthashAux::full(_header.seedHash(), true, _f);\n}\n\nbool Ethash::preVerify(BlockInfo const& _header)\n{\n\tif (_header.number >= ETHASH_EPOCH_LENGTH * 2048)\n\t\treturn false;\n\n\th256 boundary = u256((bigint(1) << 256) \/ _header.difficulty);\n\n\tbool ret = !!ethash_quick_check_difficulty(\n\t\t\t(ethash_h256_t const*)_header.headerHash(WithoutNonce).data(),\n\t\t\t(uint64_t)(u64)_header.nonce,\n\t\t\t(ethash_h256_t const*)_header.mixHash.data(),\n\t\t\t(ethash_h256_t const*)boundary.data());\n\n\treturn ret;\n}\n\nbool Ethash::verify(BlockInfo const& _header)\n{\n\tbool pre = preVerify(_header);\n#if !ETH_DEBUG\n\tif (!pre)\n\t{\n\t\tcwarn << \"Fail on preVerify\";\n\t\treturn false;\n\t}\n#endif\n\n\tauto result = EthashAux::eval(_header);\n\tbool slow = result.value <= _header.boundary() && result.mixHash == _header.mixHash;\n\n\/\/\tcdebug << (slow ? \"VERIFY\" : \"VERYBAD\");\n\/\/\tcdebug << result.value.hex() << _header.boundary().hex();\n\/\/\tcdebug << result.mixHash.hex() << _header.mixHash.hex();\n\n#if ETH_DEBUG || !ETH_TRUE\n\tif (!pre && slow)\n\t{\n\t\tcwarn << \"WARNING: evaluated result gives true whereas ethash_quick_check_difficulty gives false.\";\n\t\tcwarn << \"headerHash:\" << _header.headerHash(WithoutNonce);\n\t\tcwarn << \"nonce:\" << _header.nonce;\n\t\tcwarn << \"mixHash:\" << _header.mixHash;\n\t\tcwarn << \"difficulty:\" << _header.difficulty;\n\t\tcwarn << \"boundary:\" << _header.boundary();\n\t\tcwarn << \"result.value:\" << result.value;\n\t\tcwarn << \"result.mixHash:\" << result.mixHash;\n\t}\n#endif\n\n\treturn slow;\n}\n\nunsigned Ethash::CPUMiner::s_numInstances = 0;\n\nvoid Ethash::CPUMiner::workLoop()\n{\n\tauto tid = std::this_thread::get_id();\n\tstatic std::mt19937_64 s_eng((time(0) + std::hash<decltype(tid)>()(tid)));\n\n\tuint64_t tryNonce = (uint64_t)(u64)Nonce::random(s_eng);\n\tethash_return_value ethashReturn;\n\n\tWorkPackage w = work();\n\n\tEthashAux::FullType dag;\n\twhile (!shouldStop() && !dag)\n\t{\n\t\twhile (!shouldStop() && EthashAux::computeFull(w.seedHash, true) != 100)\n\t\t\tthis_thread::sleep_for(chrono::milliseconds(500));\n\t\tdag = EthashAux::full(w.seedHash, false);\n\t}\n\n\th256 boundary = w.boundary;\n\tunsigned hashCount = 1;\n\tfor (; !shouldStop(); tryNonce++, hashCount++)\n\t{\n\t\tethashReturn = ethash_full_compute(dag->full, *(ethash_h256_t*)w.headerHash.data(), tryNonce);\n\t\th256 value = h256((uint8_t*)ðashReturn.result, h256::ConstructFromPointer);\n\t\tif (value <= boundary && submitProof(Solution{(Nonce)(u64)tryNonce, h256((uint8_t*)ðashReturn.mix_hash, h256::ConstructFromPointer)}))\n\t\t\tbreak;\n\t\tif (!(hashCount % 100))\n\t\t\taccumulateHashes(100);\n\t}\n}\n\nstatic string jsonEncode(map<string, string> const& _m)\n{\n\tstring ret = \"{\";\n\n\tfor (auto const& i: _m)\n\t{\n\t\tstring k = boost::replace_all_copy(boost::replace_all_copy(i.first, \"\\\\\", \"\\\\\\\\\"), \"'\", \"\\\\'\");\n\t\tstring v = boost::replace_all_copy(boost::replace_all_copy(i.second, \"\\\\\", \"\\\\\\\\\"), \"'\", \"\\\\'\");\n\t\tif (ret.size() > 1)\n\t\t\tret += \", \";\n\t\tret += \"\\\"\" + k + \"\\\":\\\"\" + v + \"\\\"\";\n\t}\n\n\treturn ret + \"}\";\n}\n\nstd::string Ethash::CPUMiner::platformInfo()\n{\n\tstring baseline = toString(std::thread::hardware_concurrency()) + \"-thread CPU\";\n#if ETH_CPUID || !ETH_TRUE\n\tif (!cpuid_present())\n\t\treturn baseline;\n\tstruct cpu_raw_data_t raw;\n\tstruct cpu_id_t data;\n\tif (cpuid_get_raw_data(&raw) < 0)\n\t\treturn baseline;\n\tif (cpu_identify(&raw, &data) < 0)\n\t\treturn baseline;\n\tmap<string, string> m;\n\tm[\"vendor\"] = data.vendor_str;\n\tm[\"codename\"] = data.cpu_codename;\n\tm[\"brand\"] = data.brand_str;\n\tm[\"L1 cache\"] = toString(data.l1_data_cache);\n\tm[\"L2 cache\"] = toString(data.l2_cache);\n\tm[\"L3 cache\"] = toString(data.l3_cache);\n\tm[\"cores\"] = toString(data.num_cores);\n\tm[\"threads\"] = toString(data.num_logical_cpus);\n\tm[\"clocknominal\"] = toString(cpu_clock_by_os());\n\tm[\"clocktested\"] = toString(cpu_clock_measure(200, 0));\n\t\/*\n\tprintf(\" MMX : %s\\n\", data.flags[CPU_FEATURE_MMX] ? \"present\" : \"absent\");\n\tprintf(\" MMX-extended: %s\\n\", data.flags[CPU_FEATURE_MMXEXT] ? \"present\" : \"absent\");\n\tprintf(\" SSE : %s\\n\", data.flags[CPU_FEATURE_SSE] ? \"present\" : \"absent\");\n\tprintf(\" SSE2 : %s\\n\", data.flags[CPU_FEATURE_SSE2] ? \"present\" : \"absent\");\n\tprintf(\" 3DNow! : %s\\n\", data.flags[CPU_FEATURE_3DNOW] ? \"present\" : \"absent\");\n\t*\/\n\treturn jsonEncode(m);\n#else\n\treturn baseline;\n#endif\n}\n\n#if ETH_ETHASHCL || !ETH_TRUE\n\nclass EthashCLHook: public ethash_cl_miner::search_hook\n{\npublic:\n\tEthashCLHook(Ethash::GPUMiner* _owner): m_owner(_owner) {}\n\n\tvoid abort()\n\t{\n\t\tGuard l(x_all);\n\t\tif (m_aborted)\n\t\t\treturn;\n\/\/\t\tcdebug << \"Attempting to abort\";\n\t\tm_abort = true;\n\t\tfor (unsigned timeout = 0; timeout < 100 && !m_aborted; ++timeout)\n\t\t\tstd::this_thread::sleep_for(chrono::milliseconds(30));\n\/\/\t\tif (!m_aborted)\n\/\/\t\t\tcwarn << \"Couldn't abort. Abandoning OpenCL process.\";\n\t}\n\n\tvoid reset()\n\t{\n\t\tm_aborted = m_abort = false;\n\t}\n\nprotected:\n\tvirtual bool found(uint64_t const* _nonces, uint32_t _count) override\n\t{\n\/\/\t\tdev::operator <<(std::cerr << \"Found nonces: \", vector<uint64_t>(_nonces, _nonces + _count)) << std::endl;\n\t\tfor (uint32_t i = 0; i < _count; ++i)\n\t\t{\n\t\t\tif (m_owner->report(_nonces[i]))\n\t\t\t{\n\t\t\t\tm_aborted = true;\n\t\t\t\treturn true;\n\t\t\t}\n\t\t}\n\t\treturn m_owner->shouldStop();\n\t}\n\n\tvirtual bool searched(uint64_t _startNonce, uint32_t _count) override\n\t{\n\t\tGuard l(x_all);\n\/\/\t\tstd::cerr << \"Searched \" << _count << \" from \" << _startNonce << std::endl;\n\t\tm_owner->accumulateHashes(_count);\n\t\tm_last = _startNonce + _count;\n\t\tif (m_abort || m_owner->shouldStop())\n\t\t{\n\t\t\tm_aborted = true;\n\t\t\treturn true;\n\t\t}\n\t\treturn false;\n\t}\n\nprivate:\n\tMutex x_all;\n\tuint64_t m_last;\n\tbool m_abort = false;\n\tbool m_aborted = true;\n\tEthash::GPUMiner* m_owner = nullptr;\n};\n\nunsigned Ethash::GPUMiner::s_platformId = 0;\nunsigned Ethash::GPUMiner::s_deviceId = 0;\nunsigned Ethash::GPUMiner::s_numInstances = 0;\n\nEthash::GPUMiner::GPUMiner(ConstructionInfo const& _ci):\n\tMiner(_ci),\n\tWorker(\"gpuminer\" + toString(index())),\n\tm_hook(new EthashCLHook(this))\n{\n}\n\nEthash::GPUMiner::~GPUMiner()\n{\n\tpause();\n\tdelete m_miner;\n\tdelete m_hook;\n}\n\nbool Ethash::GPUMiner::report(uint64_t _nonce)\n{\n\tNonce n = (Nonce)(u64)_nonce;\n\tResult r = EthashAux::eval(work().seedHash, work().headerHash, n);\n\tif (r.value < work().boundary)\n\t\treturn submitProof(Solution{n, r.mixHash});\n\treturn false;\n}\n\nvoid Ethash::GPUMiner::kickOff()\n{\n\tm_hook->reset();\n\tstartWorking();\n}\n\nvoid Ethash::GPUMiner::workLoop()\n{\n\t\/\/ take local copy of work since it may end up being overwritten by kickOff\/pause.\n\ttry {\n\t\tWorkPackage w = work();\n\t\tcnote << \"workLoop\" << !!m_miner << m_minerSeed << w.seedHash;\n\t\tif (!m_miner || m_minerSeed != w.seedHash)\n\t\t{\n\t\t\tcnote << \"Initialising miner...\";\n\t\t\tm_minerSeed = w.seedHash;\n\n\t\t\tdelete m_miner;\n\t\t\tm_miner = new ethash_cl_miner;\n\n\t\t\tunsigned device = instances() > 1 ? index() : s_deviceId;\n\n\t\t\tEthashAux::FullType dag;\n\t\t\twhile (true)\n\t\t\t{\n\t\t\t\tif ((dag = EthashAux::full(w.seedHash, true)))\n\t\t\t\t\tbreak;\n\t\t\t\tif (shouldStop())\n\t\t\t\t{\n\t\t\t\t\tdelete m_miner;\n\t\t\t\t\tm_miner = nullptr;\n\t\t\t\t\treturn;\n\t\t\t\t}\n\t\t\t\tcnote << \"Awaiting DAG\";\n\t\t\t\tthis_thread::sleep_for(chrono::milliseconds(500));\n\t\t\t}\n\t\t\tbytesConstRef dagData = dag->data();\n\t\t\tm_miner->init(dagData.data(), dagData.size(), 32, s_platformId, device);\n\t\t}\n\n\t\tuint64_t upper64OfBoundary = (uint64_t)(u64)((u256)w.boundary >> 192);\n\t\tm_miner->search(w.headerHash.data(), upper64OfBoundary, *m_hook);\n\t}\n\tcatch (cl::Error const& _e)\n\t{\n\t\tdelete m_miner;\n\t\tm_miner = nullptr;\n\t\tcwarn << \"Error GPU mining: \" << _e.what() << \"(\" << _e.err() << \")\";\n\t}\n}\n\nvoid Ethash::GPUMiner::pause()\n{\n\tm_hook->abort();\n\tstopWorking();\n}\n\nstd::string Ethash::GPUMiner::platformInfo()\n{\n\treturn ethash_cl_miner::platform_info(s_platformId, s_deviceId);\n}\n\nunsigned Ethash::GPUMiner::getNumDevices()\n{\n\treturn ethash_cl_miner::getNumDevices(s_platformId);\n}\n\nvoid Ethash::GPUMiner::listDevices()\n{\n\treturn ethash_cl_miner::listDevices();\n}\n\nbool Ethash::GPUMiner::configureGPU(\n\tunsigned _platformId,\n\tunsigned _deviceId,\n\tbool _allowCPU,\n\tunsigned _extraGPUMemory,\n\tbool _forceSingleChunk,\n\tboost::optional<uint64_t> _currentBlock\n)\n{\n\ts_platformId = _platformId;\n\ts_deviceId = _deviceId;\n\treturn ethash_cl_miner::configureGPU(_allowCPU, _extraGPUMemory, _forceSingleChunk, _currentBlock);\n}\n\n#endif\n\n}\n}\n<|endoftext|>"} {"text":"<commit_before>\n#pragma GCC diagnostic ignored \"-Wconversion\"\n#include <libdevcrypto\/SHA3.h>\n#include <libethcore\/Params.h>\n#include <libevm\/ExtVMFace.h>\n\n#include \"Utils.h\"\n\nextern \"C\"\n{\n\t#ifdef _MSC_VER\n\t\t#define EXPORT __declspec(dllexport)\n\t#else\n\t\t#define EXPORT\n\t#endif\n\n\tusing namespace dev;\n\tusing namespace dev::eth;\n\tusing jit::i256;\n\n\tEXPORT void env_sload(ExtVMFace* _env, i256* _index, i256* o_value)\n\t{\n\t\tauto index = llvm2eth(*_index);\n\t\tauto value = _env->store(index); \/\/ Interface uses native endianness\n\t\t*o_value = eth2llvm(value);\n\t}\n\n\tEXPORT void env_sstore(ExtVMFace* _env, i256* _index, i256* _value)\n\t{\n\t\tauto index = llvm2eth(*_index);\n\t\tauto value = llvm2eth(*_value);\n\n\t\tif (value == 0 && _env->store(index) != 0)\t\/\/ If delete\n\t\t\t_env->sub.refunds += c_sstoreRefundGas;\t\/\/ Increase refund counter\n\n\t\t_env->setStore(index, value);\t\/\/ Interface uses native endianness\n\t}\n\n\tEXPORT void env_balance(ExtVMFace* _env, h256* _address, i256* o_value)\n\t{\n\t\tauto u = _env->balance(right160(*_address));\n\t\t*o_value = eth2llvm(u);\n\t}\n\n\tEXPORT void env_blockhash(ExtVMFace* _env, i256* _number, h256* o_hash)\n\t{\n\t\t*o_hash = _env->blockhash(llvm2eth(*_number));\n\t}\n\n\tEXPORT void env_create(ExtVMFace* _env, int64_t* io_gas, i256* _endowment, byte* _initBeg, uint64_t _initSize, h256* o_address)\n\t{\n\t\tauto endowment = llvm2eth(*_endowment);\n\t\tif (_env->balance(_env->myAddress) >= endowment && _env->depth < 1024)\n\t\t{\n\t\t\tu256 gas = *io_gas;\n\t\t\th256 address(_env->create(endowment, gas, {_initBeg, _initSize}, {}), h256::AlignRight);\n\t\t\t*io_gas = static_cast<int64_t>(gas);\n\t\t\t*o_address = address;\n\t\t}\n\t\telse\n\t\t\t*o_address = {};\n\t}\n\n\tEXPORT bool env_call(ExtVMFace* _env, int64_t* io_gas, int64_t _callGas, h256* _receiveAddress, i256* _value, byte* _inBeg, uint64_t _inSize, byte* _outBeg, uint64_t _outSize, h256* _codeAddress)\n\t{\n\t\tauto value = llvm2eth(*_value);\n\t\tauto receiveAddress = right160(*_receiveAddress);\n\t\tauto codeAddress = right160(*_codeAddress);\n\t\tconst auto isCall = receiveAddress == codeAddress; \/\/ OPT: The same address pointer can be used if not CODECALL\n\n\t\t*io_gas -= _callGas;\n\t\tif (*io_gas < 0)\n\t\t\treturn false;\n\n\t\tif (isCall && !_env->exists(receiveAddress))\n\t\t\t*io_gas -= static_cast<int64_t>(c_callNewAccountGas); \/\/ no underflow, *io_gas non-negative before\n\n\t\tif (value > 0) \/\/ value transfer\n\t\t{\n\t\t\t\/*static*\/ assert(c_callValueTransferGas > c_callStipend && \"Overflow possible\");\n\t\t\t*io_gas -= static_cast<int64_t>(c_callValueTransferGas); \/\/ no underflow\n\t\t\t_callGas += static_cast<int64_t>(c_callStipend); \/\/ overflow possibility, but in the same time *io_gas < 0\n\t\t}\n\n\t\tif (*io_gas < 0)\n\t\t\treturn false;\n\n\t\tauto ret = false;\n\t\tauto callGas = u256{_callGas};\n\t\tif (_env->balance(_env->myAddress) >= value && _env->depth < 1024)\n\t\t\tret = _env->call(receiveAddress, value, {_inBeg, _inSize}, callGas, {_outBeg, _outSize}, {}, {}, codeAddress);\n\n\t\t*io_gas += static_cast<int64_t>(callGas); \/\/ it is never more than initial _callGas\n\t\treturn ret;\n\t}\n\n\tEXPORT void env_sha3(byte* _begin, uint64_t _size, h256* o_hash)\n\t{\n\t\tauto hash = sha3({_begin, _size});\n\t\t*o_hash = hash;\n\t}\n\n\tEXPORT byte const* env_extcode(ExtVMFace* _env, h256* _addr256, uint64_t* o_size)\n\t{\n\t\tauto addr = right160(*_addr256);\n\t\tauto& code = _env->codeAt(addr);\n\t\t*o_size = code.size();\n\t\treturn code.data();\n\t}\n\n\tEXPORT void env_log(ExtVMFace* _env, byte* _beg, uint64_t _size, h256* _topic1, h256* _topic2, h256* _topic3, h256* _topic4)\n\t{\n\t\tdev::h256s topics;\n\n\t\tif (_topic1)\n\t\t\ttopics.push_back(*_topic1);\n\n\t\tif (_topic2)\n\t\t\ttopics.push_back(*_topic2);\n\n\t\tif (_topic3)\n\t\t\ttopics.push_back(*_topic3);\n\n\t\tif (_topic4)\n\t\t\ttopics.push_back(*_topic4);\n\n\t\t_env->log(std::move(topics), {_beg, _size});\n\t}\n}\n\n<commit_msg>Move assembly related files to libevmasm and Params.h\/.cpp to libevmcore.<commit_after>\n#pragma GCC diagnostic ignored \"-Wconversion\"\n#include <libdevcrypto\/SHA3.h>\n#include <libevmcore\/Params.h>\n#include <libevm\/ExtVMFace.h>\n\n#include \"Utils.h\"\n\nextern \"C\"\n{\n\t#ifdef _MSC_VER\n\t\t#define EXPORT __declspec(dllexport)\n\t#else\n\t\t#define EXPORT\n\t#endif\n\n\tusing namespace dev;\n\tusing namespace dev::eth;\n\tusing jit::i256;\n\n\tEXPORT void env_sload(ExtVMFace* _env, i256* _index, i256* o_value)\n\t{\n\t\tauto index = llvm2eth(*_index);\n\t\tauto value = _env->store(index); \/\/ Interface uses native endianness\n\t\t*o_value = eth2llvm(value);\n\t}\n\n\tEXPORT void env_sstore(ExtVMFace* _env, i256* _index, i256* _value)\n\t{\n\t\tauto index = llvm2eth(*_index);\n\t\tauto value = llvm2eth(*_value);\n\n\t\tif (value == 0 && _env->store(index) != 0)\t\/\/ If delete\n\t\t\t_env->sub.refunds += c_sstoreRefundGas;\t\/\/ Increase refund counter\n\n\t\t_env->setStore(index, value);\t\/\/ Interface uses native endianness\n\t}\n\n\tEXPORT void env_balance(ExtVMFace* _env, h256* _address, i256* o_value)\n\t{\n\t\tauto u = _env->balance(right160(*_address));\n\t\t*o_value = eth2llvm(u);\n\t}\n\n\tEXPORT void env_blockhash(ExtVMFace* _env, i256* _number, h256* o_hash)\n\t{\n\t\t*o_hash = _env->blockhash(llvm2eth(*_number));\n\t}\n\n\tEXPORT void env_create(ExtVMFace* _env, int64_t* io_gas, i256* _endowment, byte* _initBeg, uint64_t _initSize, h256* o_address)\n\t{\n\t\tauto endowment = llvm2eth(*_endowment);\n\t\tif (_env->balance(_env->myAddress) >= endowment && _env->depth < 1024)\n\t\t{\n\t\t\tu256 gas = *io_gas;\n\t\t\th256 address(_env->create(endowment, gas, {_initBeg, _initSize}, {}), h256::AlignRight);\n\t\t\t*io_gas = static_cast<int64_t>(gas);\n\t\t\t*o_address = address;\n\t\t}\n\t\telse\n\t\t\t*o_address = {};\n\t}\n\n\tEXPORT bool env_call(ExtVMFace* _env, int64_t* io_gas, int64_t _callGas, h256* _receiveAddress, i256* _value, byte* _inBeg, uint64_t _inSize, byte* _outBeg, uint64_t _outSize, h256* _codeAddress)\n\t{\n\t\tauto value = llvm2eth(*_value);\n\t\tauto receiveAddress = right160(*_receiveAddress);\n\t\tauto codeAddress = right160(*_codeAddress);\n\t\tconst auto isCall = receiveAddress == codeAddress; \/\/ OPT: The same address pointer can be used if not CODECALL\n\n\t\t*io_gas -= _callGas;\n\t\tif (*io_gas < 0)\n\t\t\treturn false;\n\n\t\tif (isCall && !_env->exists(receiveAddress))\n\t\t\t*io_gas -= static_cast<int64_t>(c_callNewAccountGas); \/\/ no underflow, *io_gas non-negative before\n\n\t\tif (value > 0) \/\/ value transfer\n\t\t{\n\t\t\t\/*static*\/ assert(c_callValueTransferGas > c_callStipend && \"Overflow possible\");\n\t\t\t*io_gas -= static_cast<int64_t>(c_callValueTransferGas); \/\/ no underflow\n\t\t\t_callGas += static_cast<int64_t>(c_callStipend); \/\/ overflow possibility, but in the same time *io_gas < 0\n\t\t}\n\n\t\tif (*io_gas < 0)\n\t\t\treturn false;\n\n\t\tauto ret = false;\n\t\tauto callGas = u256{_callGas};\n\t\tif (_env->balance(_env->myAddress) >= value && _env->depth < 1024)\n\t\t\tret = _env->call(receiveAddress, value, {_inBeg, _inSize}, callGas, {_outBeg, _outSize}, {}, {}, codeAddress);\n\n\t\t*io_gas += static_cast<int64_t>(callGas); \/\/ it is never more than initial _callGas\n\t\treturn ret;\n\t}\n\n\tEXPORT void env_sha3(byte* _begin, uint64_t _size, h256* o_hash)\n\t{\n\t\tauto hash = sha3({_begin, _size});\n\t\t*o_hash = hash;\n\t}\n\n\tEXPORT byte const* env_extcode(ExtVMFace* _env, h256* _addr256, uint64_t* o_size)\n\t{\n\t\tauto addr = right160(*_addr256);\n\t\tauto& code = _env->codeAt(addr);\n\t\t*o_size = code.size();\n\t\treturn code.data();\n\t}\n\n\tEXPORT void env_log(ExtVMFace* _env, byte* _beg, uint64_t _size, h256* _topic1, h256* _topic2, h256* _topic3, h256* _topic4)\n\t{\n\t\tdev::h256s topics;\n\n\t\tif (_topic1)\n\t\t\ttopics.push_back(*_topic1);\n\n\t\tif (_topic2)\n\t\t\ttopics.push_back(*_topic2);\n\n\t\tif (_topic3)\n\t\t\ttopics.push_back(*_topic3);\n\n\t\tif (_topic4)\n\t\t\ttopics.push_back(*_topic4);\n\n\t\t_env->log(std::move(topics), {_beg, _size});\n\t}\n}\n\n<|endoftext|>"} {"text":"<commit_before>\n#pragma GCC diagnostic ignored \"-Wconversion\"\n#include <libdevcore\/SHA3.h>\n#include <libevmcore\/Params.h>\n#include <libevm\/ExtVMFace.h>\n#include <evmjit\/DataTypes.h>\n\n#include \"Utils.h\"\n\nextern \"C\"\n{\n\t#ifdef _MSC_VER\n\t\t#define EXPORT __declspec(dllexport)\n\t#else\n\t\t#define EXPORT\n\t#endif\n\n\tusing namespace dev;\n\tusing namespace dev::eth;\n\tusing evmjit::i256;\n\n\tEXPORT void env_sload(ExtVMFace* _env, i256* _index, i256* o_value)\n\t{\n\t\tauto index = llvm2eth(*_index);\n\t\tauto value = _env->store(index); \/\/ Interface uses native endianness\n\t\t*o_value = eth2llvm(value);\n\t}\n\n\tEXPORT void env_sstore(ExtVMFace* _env, i256* _index, i256* _value)\n\t{\n\t\tauto index = llvm2eth(*_index);\n\t\tauto value = llvm2eth(*_value);\n\n\t\tif (value == 0 && _env->store(index) != 0)\t\/\/ If delete\n\t\t\t_env->sub.refunds += c_sstoreRefundGas;\t\/\/ Increase refund counter\n\n\t\t_env->setStore(index, value);\t\/\/ Interface uses native endianness\n\t}\n\n\tEXPORT void env_balance(ExtVMFace* _env, h256* _address, i256* o_value)\n\t{\n\t\tauto u = _env->balance(right160(*_address));\n\t\t*o_value = eth2llvm(u);\n\t}\n\n\tEXPORT void env_blockhash(ExtVMFace* _env, i256* _number, h256* o_hash)\n\t{\n\t\t*o_hash = _env->blockhash(llvm2eth(*_number));\n\t}\n\n\tEXPORT void env_create(ExtVMFace* _env, int64_t* io_gas, i256* _endowment, byte* _initBeg, uint64_t _initSize, h256* o_address)\n\t{\n\t\tauto endowment = llvm2eth(*_endowment);\n\t\tif (_env->balance(_env->myAddress) >= endowment && _env->depth < 1024)\n\t\t{\n\t\t\tu256 gas = *io_gas;\n\t\t\th256 address(_env->create(endowment, gas, {_initBeg, _initSize}, {}), h256::AlignRight);\n\t\t\t*io_gas = static_cast<int64_t>(gas);\n\t\t\t*o_address = address;\n\t\t}\n\t\telse\n\t\t\t*o_address = {};\n\t}\n\n\tEXPORT bool env_call(ExtVMFace* _env, int64_t* io_gas, int64_t _callGas, h256* _receiveAddress, i256* _value, byte* _inBeg, uint64_t _inSize, byte* _outBeg, uint64_t _outSize, h256* _codeAddress)\n\t{\n\t\tCallParameters params;\n\t\tparams.value = llvm2eth(*_value);\n\t\tparams.senderAddress = _env->myAddress;\n\t\tparams.receiveAddress = right160(*_receiveAddress);\n\t\tparams.codeAddress = right160(*_codeAddress);\n\t\tparams.data = {_inBeg, _inSize};\n\t\tparams.out = {_outBeg, _outSize};\n\t\tparams.onOp = {};\n\t\tconst auto isCall = params.receiveAddress == params.codeAddress; \/\/ OPT: The same address pointer can be used if not CODECALL\n\n\t\t*io_gas -= _callGas;\n\t\tif (*io_gas < 0)\n\t\t\treturn false;\n\n\t\tif (isCall && !_env->exists(params.receiveAddress))\n\t\t\t*io_gas -= static_cast<int64_t>(c_callNewAccountGas); \/\/ no underflow, *io_gas non-negative before\n\n\t\tif (params.value > 0) \/\/ value transfer\n\t\t{\n\t\t\t\/*static*\/ assert(c_callValueTransferGas > c_callStipend && \"Overflow possible\");\n\t\t\t*io_gas -= static_cast<int64_t>(c_callValueTransferGas); \/\/ no underflow\n\t\t\t_callGas += static_cast<int64_t>(c_callStipend); \/\/ overflow possibility, but in the same time *io_gas < 0\n\t\t}\n\n\t\tif (*io_gas < 0)\n\t\t\treturn false;\n\n\t\tauto ret = false;\n\t\tparams.gas = u256{_callGas};\n\t\tif (_env->balance(_env->myAddress) >= params.value && _env->depth < 1024)\n\t\t\tret = _env->call(params);\n\n\t\t*io_gas += static_cast<int64_t>(params.gas); \/\/ it is never more than initial _callGas\n\t\treturn ret;\n\t}\n\n\tEXPORT void env_sha3(byte* _begin, uint64_t _size, h256* o_hash)\n\t{\n\t\tauto hash = sha3({_begin, _size});\n\t\t*o_hash = hash;\n\t}\n\n\tEXPORT byte const* env_extcode(ExtVMFace* _env, h256* _addr256, uint64_t* o_size)\n\t{\n\t\tauto addr = right160(*_addr256);\n\t\tauto& code = _env->codeAt(addr);\n\t\t*o_size = code.size();\n\t\treturn code.data();\n\t}\n\n\tEXPORT void env_log(ExtVMFace* _env, byte* _beg, uint64_t _size, h256* _topic1, h256* _topic2, h256* _topic3, h256* _topic4)\n\t{\n\t\tdev::h256s topics;\n\n\t\tif (_topic1)\n\t\t\ttopics.push_back(*_topic1);\n\n\t\tif (_topic2)\n\t\t\ttopics.push_back(*_topic2);\n\n\t\tif (_topic3)\n\t\t\ttopics.push_back(*_topic3);\n\n\t\tif (_topic4)\n\t\t\ttopics.push_back(*_topic4);\n\n\t\t_env->log(std::move(topics), {_beg, _size});\n\t}\n}\n\n<commit_msg>evmJit warnings fix<commit_after>\n#pragma GCC diagnostic ignored \"-Wconversion\"\n#include <libdevcore\/SHA3.h>\n#include <libevmcore\/Params.h>\n#include <libevm\/ExtVMFace.h>\n#include <evmjit\/DataTypes.h>\n\n#include \"Utils.h\"\n\nextern \"C\"\n{\n\t#ifdef _MSC_VER\n\t\t#define EXPORT __declspec(dllexport)\n\t#else\n\t\t#define EXPORT\n\t#endif\n\n\tusing namespace dev;\n\tusing namespace dev::eth;\n\tusing evmjit::i256;\n\n\tEXPORT void env_sload(ExtVMFace* _env, i256* _index, i256* o_value)\n\t{\n\t\tauto index = llvm2eth(*_index);\n\t\tauto value = _env->store(index); \/\/ Interface uses native endianness\n\t\t*o_value = eth2llvm(value);\n\t}\n\n\tEXPORT void env_sstore(ExtVMFace* _env, i256* _index, i256* _value)\n\t{\n\t\tauto index = llvm2eth(*_index);\n\t\tauto value = llvm2eth(*_value);\n\n\t\tif (value == 0 && _env->store(index) != 0)\t\/\/ If delete\n\t\t\t_env->sub.refunds += c_sstoreRefundGas;\t\/\/ Increase refund counter\n\n\t\t_env->setStore(index, value);\t\/\/ Interface uses native endianness\n\t}\n\n\tEXPORT void env_balance(ExtVMFace* _env, h256* _address, i256* o_value)\n\t{\n\t\tauto u = _env->balance(right160(*_address));\n\t\t*o_value = eth2llvm(u);\n\t}\n\n\tEXPORT void env_blockhash(ExtVMFace* _env, i256* _number, h256* o_hash)\n\t{\n\t\t*o_hash = _env->blockhash(llvm2eth(*_number));\n\t}\n\n\tEXPORT void env_create(ExtVMFace* _env, int64_t* io_gas, i256* _endowment, byte* _initBeg, uint64_t _initSize, h256* o_address)\n\t{\n\t\tauto endowment = llvm2eth(*_endowment);\n\t\tif (_env->balance(_env->myAddress) >= endowment && _env->depth < 1024)\n\t\t{\n\t\t\tu256 gas = *io_gas;\n\t\t\th256 address(_env->create(endowment, gas, {_initBeg, (size_t)_initSize}, {}), h256::AlignRight);\n\t\t\t*io_gas = static_cast<int64_t>(gas);\n\t\t\t*o_address = address;\n\t\t}\n\t\telse\n\t\t\t*o_address = {};\n\t}\n\n\tEXPORT bool env_call(ExtVMFace* _env, int64_t* io_gas, int64_t _callGas, h256* _receiveAddress, i256* _value, byte* _inBeg, uint64_t _inSize, byte* _outBeg, uint64_t _outSize, h256* _codeAddress)\n\t{\n\t\tCallParameters params;\n\t\tparams.value = llvm2eth(*_value);\n\t\tparams.senderAddress = _env->myAddress;\n\t\tparams.receiveAddress = right160(*_receiveAddress);\n\t\tparams.codeAddress = right160(*_codeAddress);\n\t\tparams.data = {_inBeg, (size_t)_inSize};\n\t\tparams.out = {_outBeg, (size_t)_outSize};\n\t\tparams.onOp = {};\n\t\tconst auto isCall = params.receiveAddress == params.codeAddress; \/\/ OPT: The same address pointer can be used if not CODECALL\n\n\t\t*io_gas -= _callGas;\n\t\tif (*io_gas < 0)\n\t\t\treturn false;\n\n\t\tif (isCall && !_env->exists(params.receiveAddress))\n\t\t\t*io_gas -= static_cast<int64_t>(c_callNewAccountGas); \/\/ no underflow, *io_gas non-negative before\n\n\t\tif (params.value > 0) \/\/ value transfer\n\t\t{\n\t\t\t\/*static*\/ assert(c_callValueTransferGas > c_callStipend && \"Overflow possible\");\n\t\t\t*io_gas -= static_cast<int64_t>(c_callValueTransferGas); \/\/ no underflow\n\t\t\t_callGas += static_cast<int64_t>(c_callStipend); \/\/ overflow possibility, but in the same time *io_gas < 0\n\t\t}\n\n\t\tif (*io_gas < 0)\n\t\t\treturn false;\n\n\t\tauto ret = false;\n\t\tparams.gas = u256{_callGas};\n\t\tif (_env->balance(_env->myAddress) >= params.value && _env->depth < 1024)\n\t\t\tret = _env->call(params);\n\n\t\t*io_gas += static_cast<int64_t>(params.gas); \/\/ it is never more than initial _callGas\n\t\treturn ret;\n\t}\n\n\tEXPORT void env_sha3(byte* _begin, uint64_t _size, h256* o_hash)\n\t{\n\t\tauto hash = sha3({_begin, (size_t)_size});\n\t\t*o_hash = hash;\n\t}\n\n\tEXPORT byte const* env_extcode(ExtVMFace* _env, h256* _addr256, uint64_t* o_size)\n\t{\n\t\tauto addr = right160(*_addr256);\n\t\tauto& code = _env->codeAt(addr);\n\t\t*o_size = code.size();\n\t\treturn code.data();\n\t}\n\n\tEXPORT void env_log(ExtVMFace* _env, byte* _beg, uint64_t _size, h256* _topic1, h256* _topic2, h256* _topic3, h256* _topic4)\n\t{\n\t\tdev::h256s topics;\n\n\t\tif (_topic1)\n\t\t\ttopics.push_back(*_topic1);\n\n\t\tif (_topic2)\n\t\t\ttopics.push_back(*_topic2);\n\n\t\tif (_topic3)\n\t\t\ttopics.push_back(*_topic3);\n\n\t\tif (_topic4)\n\t\t\ttopics.push_back(*_topic4);\n\n\t\t_env->log(std::move(topics), {_beg, (size_t)_size});\n\t}\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 <kglobal.h>\n#include <klocale.h>\n#include <kdebug.h>\n\n#include \"calformat.h\"\n\n#include \"incidence.h\"\n\nusing namespace KCal;\n\nIncidence::Incidence() :\n IncidenceBase(),\n mRelatedTo(0), mStatus(StatusNone), mSecrecy(SecrecyPublic),\n mPriority(3), mRecurrence(0)\n{\n recreate();\n\n mAlarms.setAutoDelete(true);\n mAttachments.setAutoDelete(true);\n}\n\nIncidence::Incidence( const Incidence &i ) : IncidenceBase( i )\n{\n\/\/ TODO: reenable attributes currently commented out.\n mRevision = i.mRevision;\n mCreated = i.mCreated;\n mDescription = i.mDescription;\n mSummary = i.mSummary;\n mCategories = i.mCategories;\n\/\/ Incidence *mRelatedTo; Incidence *mRelatedTo;\n mRelatedTo = 0;\n mRelatedToUid = i.mRelatedToUid;\n\/\/ Incidence::List mRelations; Incidence::List mRelations;\n mExDates = i.mExDates;\n mExDateTimes = i.mExDateTimes;\n mAttachments = i.mAttachments;\n mResources = i.mResources;\n mStatusString = i.mStatusString;\n mStatus = i.mStatus;\n mSecrecy = i.mSecrecy;\n mPriority = i.mPriority;\n mLocation = i.mLocation;\n\n Alarm::List::ConstIterator it;\n for( it = i.mAlarms.begin(); it != i.mAlarms.end(); ++it ) {\n Alarm *b = new Alarm( **it );\n b->setParent( this );\n mAlarms.append( b );\n }\n mAlarms.setAutoDelete(true);\n\n if (i.mRecurrence)\n mRecurrence = new Recurrence( *(i.mRecurrence), this );\n else\n mRecurrence = 0;\n}\n\nIncidence::~Incidence()\n{\n Incidence::List Relations = mRelations;\n List::ConstIterator it;\n for ( it = Relations.begin(); it != Relations.end(); ++it ) {\n if ( (*it)->relatedTo() == this ) (*it)->setRelatedTo( 0 );\n }\n if ( relatedTo() ) relatedTo()->removeRelation( this );\n\n delete mRecurrence;\n}\n\n\/\/ A string comparison that considers that null and empty are the same\nstatic bool stringCompare( const QString& s1, const QString& s2 )\n{\n if ( s1.isEmpty() && s2.isEmpty() )\n return true;\n return s1 == s2;\n}\n\nbool Incidence::operator==( const Incidence& i2 ) const\n{\n if( alarms().count() != i2.alarms().count() ) {\n return false; \/\/ no need to check further\n }\n\n Alarm::List::ConstIterator a1 = alarms().begin();\n Alarm::List::ConstIterator a2 = i2.alarms().begin();\n for( ; a1 != alarms().end() && a2 != i2.alarms().end(); ++a1, ++a2 )\n if( **a1 == **a2 )\n continue;\n else {\n return false;\n }\n\n if ( !IncidenceBase::operator==(i2) )\n return false;\n\n bool recurrenceEqual = ( mRecurrence == 0 && i2.mRecurrence == 0 );\n if ( !recurrenceEqual )\n {\n recurrenceEqual = mRecurrence != 0 &&\n i2.mRecurrence != 0 &&\n *mRecurrence == *i2.mRecurrence;\n }\n\n return\n recurrenceEqual &&\n created() == i2.created() &&\n stringCompare( description(), i2.description() ) &&\n stringCompare( summary(), i2.summary() ) &&\n categories() == i2.categories() &&\n \/\/ no need to compare mRelatedTo\n stringCompare( relatedToUid(), i2.relatedToUid() ) &&\n relations() == i2.relations() &&\n exDates() == i2.exDates() &&\n exDateTimes() == i2.exDateTimes() &&\n attachments() == i2.attachments() &&\n resources() == i2.resources() &&\n mStatus == i2.mStatus &&\n ( mStatus == StatusNone || stringCompare( mStatusString, i2.mStatusString ) ) &&\n secrecy() == i2.secrecy() &&\n priority() == i2.priority() &&\n stringCompare( location(), i2.location() );\n}\n\n\nvoid Incidence::recreate()\n{\n setCreated(QDateTime::currentDateTime());\n\n setUid(CalFormat::createUniqueId());\n\n setRevision(0);\n\n setLastModified(QDateTime::currentDateTime());\n}\n\nvoid Incidence::setReadOnly( bool readOnly )\n{\n IncidenceBase::setReadOnly( readOnly );\n if (mRecurrence)\n mRecurrence->setRecurReadOnly(readOnly);\n}\n\nvoid Incidence::setCreated( const QDateTime &created )\n{\n if (mReadOnly) return;\n mCreated = created;\n}\n\nQDateTime Incidence::created() const\n{\n return mCreated;\n}\n\nvoid Incidence::setRevision( int rev )\n{\n if (mReadOnly) return;\n mRevision = rev;\n\n updated();\n}\n\nint Incidence::revision() const\n{\n return mRevision;\n}\n\nvoid Incidence::setDtStart(const QDateTime &dtStart)\n{\n if (mRecurrence)\n mRecurrence->setRecurStart( dtStart );\n IncidenceBase::setDtStart( dtStart );\n}\n\nvoid Incidence::setDescription(const QString &description)\n{\n if (mReadOnly) return;\n mDescription = description;\n updated();\n}\n\nQString Incidence::description() const\n{\n return mDescription;\n}\n\n\nvoid Incidence::setSummary(const QString &summary)\n{\n if (mReadOnly) return;\n mSummary = summary;\n updated();\n}\n\nQString Incidence::summary() const\n{\n return mSummary;\n}\n\nvoid Incidence::setCategories(const QStringList &categories)\n{\n if (mReadOnly) return;\n mCategories = categories;\n updated();\n}\n\n\/\/ TODO: remove setCategories(QString) function\nvoid Incidence::setCategories(const QString &catStr)\n{\n if (mReadOnly) return;\n mCategories.clear();\n\n if (catStr.isEmpty()) return;\n\n mCategories = QStringList::split(\",\",catStr);\n\n QStringList::Iterator it;\n for(it = mCategories.begin();it != mCategories.end(); ++it) {\n *it = (*it).stripWhiteSpace();\n }\n\n updated();\n}\n\nQStringList Incidence::categories() const\n{\n return mCategories;\n}\n\nQString Incidence::categoriesStr() const\n{\n return mCategories.join(\",\");\n}\n\nvoid Incidence::setRelatedToUid(const QString &relatedToUid)\n{\n if (mReadOnly) return;\n mRelatedToUid = relatedToUid;\n}\n\nQString Incidence::relatedToUid() const\n{\n return mRelatedToUid;\n}\n\nvoid Incidence::setRelatedTo(Incidence *relatedTo)\n{\n if (mReadOnly || mRelatedTo == relatedTo) return;\n if(mRelatedTo)\n mRelatedTo->removeRelation(this);\n mRelatedTo = relatedTo;\n if (mRelatedTo) mRelatedTo->addRelation(this);\n}\n\nIncidence *Incidence::relatedTo() const\n{\n return mRelatedTo;\n}\n\nIncidence::List Incidence::relations() const\n{\n return mRelations;\n}\n\nvoid Incidence::addRelation( Incidence *event )\n{\n if ( mRelations.find( event ) == mRelations.end() ) {\n mRelations.append( event );\n updated();\n }\n}\n\nvoid Incidence::removeRelation(Incidence *event)\n{\n mRelations.removeRef(event);\n\/\/ if (event->getRelatedTo() == this) event->setRelatedTo(0);\n}\n\nbool Incidence::recursOn(const QDate &qd) const\n{\n return (mRecurrence && mRecurrence->recursOnPure(qd) && !isException(qd));\n}\n\nbool Incidence::recursAt(const QDateTime &qdt) const\n{\n return (mRecurrence && mRecurrence->recursAtPure(qdt) && !isException(qdt.date()) && !isException(qdt));\n}\n\nvoid Incidence::setExDates(const DateList &exDates)\n{\n if (mReadOnly) return;\n mExDates = exDates;\n updated();\n}\n\nvoid Incidence::setExDateTimes(const DateTimeList &exDateTimes)\n{\n if (mReadOnly) return;\n mExDateTimes = exDateTimes;\n updated();\n}\n\nvoid Incidence::addExDate(const QDate &date)\n{\n if (mReadOnly) return;\n mExDates.append(date);\n updated();\n}\n\nvoid Incidence::addExDateTime(const QDateTime &dateTime)\n{\n if (mReadOnly) return;\n mExDateTimes.append(dateTime);\n updated();\n}\n\nDateList Incidence::exDates() const\n{\n return mExDates;\n}\n\nDateTimeList Incidence::exDateTimes() const\n{\n return mExDateTimes;\n}\n\nbool Incidence::isException(const QDate &date) const\n{\n DateList::ConstIterator it;\n for( it = mExDates.begin(); it != mExDates.end(); ++it ) {\n if ( (*it) == date ) {\n return true;\n }\n }\n\n return false;\n}\n\nbool Incidence::isException(const QDateTime &dateTime) const\n{\n DateTimeList::ConstIterator it;\n for( it = mExDateTimes.begin(); it != mExDateTimes.end(); ++it ) {\n if ( (*it) == dateTime ) {\n return true;\n }\n }\n\n return false;\n}\n\nvoid Incidence::addAttachment(Attachment *attachment)\n{\n if (mReadOnly || !attachment) return;\n mAttachments.append(attachment);\n updated();\n}\n\nvoid Incidence::deleteAttachment(Attachment *attachment)\n{\n mAttachments.removeRef(attachment);\n}\n\nvoid Incidence::deleteAttachments( const QString &mime )\n{\n Attachment::List::Iterator it = mAttachments.begin();\n while( it != mAttachments.end() ) {\n if ( (*it)->mimeType() == mime ) mAttachments.remove( it );\n else ++it;\n }\n}\n\nAttachment::List Incidence::attachments() const\n{\n return mAttachments;\n}\n\nAttachment::List Incidence::attachments(const QString& mime) const\n{\n Attachment::List attachments;\n Attachment::List::ConstIterator it;\n for( it = mAttachments.begin(); it != mAttachments.end(); ++it ) {\n if ( (*it)->mimeType() == mime ) attachments.append( *it );\n }\n\n return attachments;\n}\n\nvoid Incidence::clearAttachments()\n{\n mAttachments.clear();\n}\n\nvoid Incidence::setResources(const QStringList &resources)\n{\n if (mReadOnly) return;\n mResources = resources;\n updated();\n}\n\nQStringList Incidence::resources() const\n{\n return mResources;\n}\n\n\nvoid Incidence::setPriority(int priority)\n{\n if (mReadOnly) return;\n mPriority = priority;\n updated();\n}\n\nint Incidence::priority() const\n{\n return mPriority;\n}\n\nvoid Incidence::setStatus(Incidence::Status status)\n{\n if (mReadOnly || status == StatusX) return;\n mStatus = status;\n mStatusString = QString::null;\n updated();\n}\n\nvoid Incidence::setCustomStatus(const QString &status)\n{\n if (mReadOnly) return;\n mStatus = status.isEmpty() ? StatusNone : StatusX;\n mStatusString = status;\n updated();\n}\n\nIncidence::Status Incidence::status() const\n{\n return mStatus;\n}\n\nQString Incidence::statusStr() const\n{\n if (mStatus == StatusX)\n return mStatusString;\n return statusName(mStatus);\n}\n\nQString Incidence::statusName(Incidence::Status status)\n{\n switch (status) {\n case StatusTentative: return i18n(\"Tentative\");\n case StatusConfirmed: return i18n(\"Confirmed\");\n case StatusCompleted: return i18n(\"Completed\");\n case StatusNeedsAction: return i18n(\"Needs-Action\");\n case StatusCanceled: return i18n(\"Canceled\");\n case StatusInProcess: return i18n(\"In-Process\");\n case StatusDraft: return i18n(\"Draft\");\n case StatusFinal: return i18n(\"Final\");\n case StatusX:\n case StatusNone:\n default: return QString::null;\n }\n}\n\nvoid Incidence::setSecrecy(int sec)\n{\n if (mReadOnly) return;\n mSecrecy = sec;\n updated();\n}\n\nint Incidence::secrecy() const\n{\n return mSecrecy;\n}\n\nQString Incidence::secrecyStr() const\n{\n return secrecyName(mSecrecy);\n}\n\nQString Incidence::secrecyName(int secrecy)\n{\n switch (secrecy) {\n case SecrecyPublic:\n return i18n(\"Public\");\n case SecrecyPrivate:\n return i18n(\"Private\");\n case SecrecyConfidential:\n return i18n(\"Confidential\");\n default:\n return i18n(\"Undefined\");\n }\n}\n\nQStringList Incidence::secrecyList()\n{\n QStringList list;\n list << secrecyName(SecrecyPublic);\n list << secrecyName(SecrecyPrivate);\n list << secrecyName(SecrecyConfidential);\n\n return list;\n}\n\n\nconst Alarm::List &Incidence::alarms() const\n{\n return mAlarms;\n}\n\nAlarm* Incidence::newAlarm()\n{\n Alarm* alarm = new Alarm(this);\n mAlarms.append(alarm);\n\/\/ updated();\n return alarm;\n}\n\nvoid Incidence::addAlarm(Alarm *alarm)\n{\n mAlarms.append(alarm);\n updated();\n}\n\nvoid Incidence::removeAlarm(Alarm *alarm)\n{\n mAlarms.removeRef(alarm);\n updated();\n}\n\nvoid Incidence::clearAlarms()\n{\n mAlarms.clear();\n updated();\n}\n\nbool Incidence::isAlarmEnabled() const\n{\n Alarm::List::ConstIterator it;\n for( it = mAlarms.begin(); it != mAlarms.end(); ++it ) {\n if ( (*it)->enabled() ) return true;\n }\n return false;\n}\n\nRecurrence *Incidence::recurrence() const\n{\n if (!mRecurrence)\n {\n const_cast<KCal::Incidence*>(this)->mRecurrence = new Recurrence(const_cast<KCal::Incidence*>(this));\n mRecurrence->setRecurReadOnly(mReadOnly);\n mRecurrence->setRecurStart(dtStart());\n }\n\n return mRecurrence;\n}\n\nvoid Incidence::setLocation(const QString &location)\n{\n if (mReadOnly) return;\n mLocation = location;\n updated();\n}\n\nQString Incidence::location() const\n{\n return mLocation;\n}\n\nushort Incidence::doesRecur() const\n{\n if ( mRecurrence ) return mRecurrence->doesRecur();\n else return Recurrence::rNone;\n}\n<commit_msg>If we clone an incidence, we also need to reset the pilot id. Otherwise we'll have two items with the same pilot id, which will prevent incidences copied in korganizer to be synced (unless you do a first sync).<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 <kglobal.h>\n#include <klocale.h>\n#include <kdebug.h>\n\n#include \"calformat.h\"\n\n#include \"incidence.h\"\n\nusing namespace KCal;\n\nIncidence::Incidence() :\n IncidenceBase(),\n mRelatedTo(0), mStatus(StatusNone), mSecrecy(SecrecyPublic),\n mPriority(3), mRecurrence(0)\n{\n recreate();\n\n mAlarms.setAutoDelete(true);\n mAttachments.setAutoDelete(true);\n}\n\nIncidence::Incidence( const Incidence &i ) : IncidenceBase( i )\n{\n\/\/ TODO: reenable attributes currently commented out.\n mRevision = i.mRevision;\n mCreated = i.mCreated;\n mDescription = i.mDescription;\n mSummary = i.mSummary;\n mCategories = i.mCategories;\n\/\/ Incidence *mRelatedTo; Incidence *mRelatedTo;\n mRelatedTo = 0;\n mRelatedToUid = i.mRelatedToUid;\n\/\/ Incidence::List mRelations; Incidence::List mRelations;\n mExDates = i.mExDates;\n mExDateTimes = i.mExDateTimes;\n mAttachments = i.mAttachments;\n mResources = i.mResources;\n mStatusString = i.mStatusString;\n mStatus = i.mStatus;\n mSecrecy = i.mSecrecy;\n mPriority = i.mPriority;\n mLocation = i.mLocation;\n\n Alarm::List::ConstIterator it;\n for( it = i.mAlarms.begin(); it != i.mAlarms.end(); ++it ) {\n Alarm *b = new Alarm( **it );\n b->setParent( this );\n mAlarms.append( b );\n }\n mAlarms.setAutoDelete(true);\n\n if (i.mRecurrence)\n mRecurrence = new Recurrence( *(i.mRecurrence), this );\n else\n mRecurrence = 0;\n}\n\nIncidence::~Incidence()\n{\n Incidence::List Relations = mRelations;\n List::ConstIterator it;\n for ( it = Relations.begin(); it != Relations.end(); ++it ) {\n if ( (*it)->relatedTo() == this ) (*it)->setRelatedTo( 0 );\n }\n if ( relatedTo() ) relatedTo()->removeRelation( this );\n\n delete mRecurrence;\n}\n\n\/\/ A string comparison that considers that null and empty are the same\nstatic bool stringCompare( const QString& s1, const QString& s2 )\n{\n if ( s1.isEmpty() && s2.isEmpty() )\n return true;\n return s1 == s2;\n}\n\nbool Incidence::operator==( const Incidence& i2 ) const\n{\n if( alarms().count() != i2.alarms().count() ) {\n return false; \/\/ no need to check further\n }\n\n Alarm::List::ConstIterator a1 = alarms().begin();\n Alarm::List::ConstIterator a2 = i2.alarms().begin();\n for( ; a1 != alarms().end() && a2 != i2.alarms().end(); ++a1, ++a2 )\n if( **a1 == **a2 )\n continue;\n else {\n return false;\n }\n\n if ( !IncidenceBase::operator==(i2) )\n return false;\n\n bool recurrenceEqual = ( mRecurrence == 0 && i2.mRecurrence == 0 );\n if ( !recurrenceEqual )\n {\n recurrenceEqual = mRecurrence != 0 &&\n i2.mRecurrence != 0 &&\n *mRecurrence == *i2.mRecurrence;\n }\n\n return\n recurrenceEqual &&\n created() == i2.created() &&\n stringCompare( description(), i2.description() ) &&\n stringCompare( summary(), i2.summary() ) &&\n categories() == i2.categories() &&\n \/\/ no need to compare mRelatedTo\n stringCompare( relatedToUid(), i2.relatedToUid() ) &&\n relations() == i2.relations() &&\n exDates() == i2.exDates() &&\n exDateTimes() == i2.exDateTimes() &&\n attachments() == i2.attachments() &&\n resources() == i2.resources() &&\n mStatus == i2.mStatus &&\n ( mStatus == StatusNone || stringCompare( mStatusString, i2.mStatusString ) ) &&\n secrecy() == i2.secrecy() &&\n priority() == i2.priority() &&\n stringCompare( location(), i2.location() );\n}\n\n\nvoid Incidence::recreate()\n{\n setCreated(QDateTime::currentDateTime());\n\n setUid(CalFormat::createUniqueId());\n\n setRevision(0);\n\n setLastModified(QDateTime::currentDateTime());\n setPilotId( 0 );\n setSyncStatus( SYNCNONE );\n}\n\nvoid Incidence::setReadOnly( bool readOnly )\n{\n IncidenceBase::setReadOnly( readOnly );\n if (mRecurrence)\n mRecurrence->setRecurReadOnly(readOnly);\n}\n\nvoid Incidence::setCreated( const QDateTime &created )\n{\n if (mReadOnly) return;\n mCreated = created;\n}\n\nQDateTime Incidence::created() const\n{\n return mCreated;\n}\n\nvoid Incidence::setRevision( int rev )\n{\n if (mReadOnly) return;\n mRevision = rev;\n\n updated();\n}\n\nint Incidence::revision() const\n{\n return mRevision;\n}\n\nvoid Incidence::setDtStart(const QDateTime &dtStart)\n{\n if (mRecurrence)\n mRecurrence->setRecurStart( dtStart );\n IncidenceBase::setDtStart( dtStart );\n}\n\nvoid Incidence::setDescription(const QString &description)\n{\n if (mReadOnly) return;\n mDescription = description;\n updated();\n}\n\nQString Incidence::description() const\n{\n return mDescription;\n}\n\n\nvoid Incidence::setSummary(const QString &summary)\n{\n if (mReadOnly) return;\n mSummary = summary;\n updated();\n}\n\nQString Incidence::summary() const\n{\n return mSummary;\n}\n\nvoid Incidence::setCategories(const QStringList &categories)\n{\n if (mReadOnly) return;\n mCategories = categories;\n updated();\n}\n\n\/\/ TODO: remove setCategories(QString) function\nvoid Incidence::setCategories(const QString &catStr)\n{\n if (mReadOnly) return;\n mCategories.clear();\n\n if (catStr.isEmpty()) return;\n\n mCategories = QStringList::split(\",\",catStr);\n\n QStringList::Iterator it;\n for(it = mCategories.begin();it != mCategories.end(); ++it) {\n *it = (*it).stripWhiteSpace();\n }\n\n updated();\n}\n\nQStringList Incidence::categories() const\n{\n return mCategories;\n}\n\nQString Incidence::categoriesStr() const\n{\n return mCategories.join(\",\");\n}\n\nvoid Incidence::setRelatedToUid(const QString &relatedToUid)\n{\n if (mReadOnly) return;\n mRelatedToUid = relatedToUid;\n}\n\nQString Incidence::relatedToUid() const\n{\n return mRelatedToUid;\n}\n\nvoid Incidence::setRelatedTo(Incidence *relatedTo)\n{\n if (mReadOnly || mRelatedTo == relatedTo) return;\n if(mRelatedTo)\n mRelatedTo->removeRelation(this);\n mRelatedTo = relatedTo;\n if (mRelatedTo) mRelatedTo->addRelation(this);\n}\n\nIncidence *Incidence::relatedTo() const\n{\n return mRelatedTo;\n}\n\nIncidence::List Incidence::relations() const\n{\n return mRelations;\n}\n\nvoid Incidence::addRelation( Incidence *event )\n{\n if ( mRelations.find( event ) == mRelations.end() ) {\n mRelations.append( event );\n updated();\n }\n}\n\nvoid Incidence::removeRelation(Incidence *event)\n{\n mRelations.removeRef(event);\n\/\/ if (event->getRelatedTo() == this) event->setRelatedTo(0);\n}\n\nbool Incidence::recursOn(const QDate &qd) const\n{\n return (mRecurrence && mRecurrence->recursOnPure(qd) && !isException(qd));\n}\n\nbool Incidence::recursAt(const QDateTime &qdt) const\n{\n return (mRecurrence && mRecurrence->recursAtPure(qdt) && !isException(qdt.date()) && !isException(qdt));\n}\n\nvoid Incidence::setExDates(const DateList &exDates)\n{\n if (mReadOnly) return;\n mExDates = exDates;\n updated();\n}\n\nvoid Incidence::setExDateTimes(const DateTimeList &exDateTimes)\n{\n if (mReadOnly) return;\n mExDateTimes = exDateTimes;\n updated();\n}\n\nvoid Incidence::addExDate(const QDate &date)\n{\n if (mReadOnly) return;\n mExDates.append(date);\n updated();\n}\n\nvoid Incidence::addExDateTime(const QDateTime &dateTime)\n{\n if (mReadOnly) return;\n mExDateTimes.append(dateTime);\n updated();\n}\n\nDateList Incidence::exDates() const\n{\n return mExDates;\n}\n\nDateTimeList Incidence::exDateTimes() const\n{\n return mExDateTimes;\n}\n\nbool Incidence::isException(const QDate &date) const\n{\n DateList::ConstIterator it;\n for( it = mExDates.begin(); it != mExDates.end(); ++it ) {\n if ( (*it) == date ) {\n return true;\n }\n }\n\n return false;\n}\n\nbool Incidence::isException(const QDateTime &dateTime) const\n{\n DateTimeList::ConstIterator it;\n for( it = mExDateTimes.begin(); it != mExDateTimes.end(); ++it ) {\n if ( (*it) == dateTime ) {\n return true;\n }\n }\n\n return false;\n}\n\nvoid Incidence::addAttachment(Attachment *attachment)\n{\n if (mReadOnly || !attachment) return;\n mAttachments.append(attachment);\n updated();\n}\n\nvoid Incidence::deleteAttachment(Attachment *attachment)\n{\n mAttachments.removeRef(attachment);\n}\n\nvoid Incidence::deleteAttachments( const QString &mime )\n{\n Attachment::List::Iterator it = mAttachments.begin();\n while( it != mAttachments.end() ) {\n if ( (*it)->mimeType() == mime ) mAttachments.remove( it );\n else ++it;\n }\n}\n\nAttachment::List Incidence::attachments() const\n{\n return mAttachments;\n}\n\nAttachment::List Incidence::attachments(const QString& mime) const\n{\n Attachment::List attachments;\n Attachment::List::ConstIterator it;\n for( it = mAttachments.begin(); it != mAttachments.end(); ++it ) {\n if ( (*it)->mimeType() == mime ) attachments.append( *it );\n }\n\n return attachments;\n}\n\nvoid Incidence::clearAttachments()\n{\n mAttachments.clear();\n}\n\nvoid Incidence::setResources(const QStringList &resources)\n{\n if (mReadOnly) return;\n mResources = resources;\n updated();\n}\n\nQStringList Incidence::resources() const\n{\n return mResources;\n}\n\n\nvoid Incidence::setPriority(int priority)\n{\n if (mReadOnly) return;\n mPriority = priority;\n updated();\n}\n\nint Incidence::priority() const\n{\n return mPriority;\n}\n\nvoid Incidence::setStatus(Incidence::Status status)\n{\n if (mReadOnly || status == StatusX) return;\n mStatus = status;\n mStatusString = QString::null;\n updated();\n}\n\nvoid Incidence::setCustomStatus(const QString &status)\n{\n if (mReadOnly) return;\n mStatus = status.isEmpty() ? StatusNone : StatusX;\n mStatusString = status;\n updated();\n}\n\nIncidence::Status Incidence::status() const\n{\n return mStatus;\n}\n\nQString Incidence::statusStr() const\n{\n if (mStatus == StatusX)\n return mStatusString;\n return statusName(mStatus);\n}\n\nQString Incidence::statusName(Incidence::Status status)\n{\n switch (status) {\n case StatusTentative: return i18n(\"Tentative\");\n case StatusConfirmed: return i18n(\"Confirmed\");\n case StatusCompleted: return i18n(\"Completed\");\n case StatusNeedsAction: return i18n(\"Needs-Action\");\n case StatusCanceled: return i18n(\"Canceled\");\n case StatusInProcess: return i18n(\"In-Process\");\n case StatusDraft: return i18n(\"Draft\");\n case StatusFinal: return i18n(\"Final\");\n case StatusX:\n case StatusNone:\n default: return QString::null;\n }\n}\n\nvoid Incidence::setSecrecy(int sec)\n{\n if (mReadOnly) return;\n mSecrecy = sec;\n updated();\n}\n\nint Incidence::secrecy() const\n{\n return mSecrecy;\n}\n\nQString Incidence::secrecyStr() const\n{\n return secrecyName(mSecrecy);\n}\n\nQString Incidence::secrecyName(int secrecy)\n{\n switch (secrecy) {\n case SecrecyPublic:\n return i18n(\"Public\");\n case SecrecyPrivate:\n return i18n(\"Private\");\n case SecrecyConfidential:\n return i18n(\"Confidential\");\n default:\n return i18n(\"Undefined\");\n }\n}\n\nQStringList Incidence::secrecyList()\n{\n QStringList list;\n list << secrecyName(SecrecyPublic);\n list << secrecyName(SecrecyPrivate);\n list << secrecyName(SecrecyConfidential);\n\n return list;\n}\n\n\nconst Alarm::List &Incidence::alarms() const\n{\n return mAlarms;\n}\n\nAlarm* Incidence::newAlarm()\n{\n Alarm* alarm = new Alarm(this);\n mAlarms.append(alarm);\n\/\/ updated();\n return alarm;\n}\n\nvoid Incidence::addAlarm(Alarm *alarm)\n{\n mAlarms.append(alarm);\n updated();\n}\n\nvoid Incidence::removeAlarm(Alarm *alarm)\n{\n mAlarms.removeRef(alarm);\n updated();\n}\n\nvoid Incidence::clearAlarms()\n{\n mAlarms.clear();\n updated();\n}\n\nbool Incidence::isAlarmEnabled() const\n{\n Alarm::List::ConstIterator it;\n for( it = mAlarms.begin(); it != mAlarms.end(); ++it ) {\n if ( (*it)->enabled() ) return true;\n }\n return false;\n}\n\nRecurrence *Incidence::recurrence() const\n{\n if (!mRecurrence)\n {\n const_cast<KCal::Incidence*>(this)->mRecurrence = new Recurrence(const_cast<KCal::Incidence*>(this));\n mRecurrence->setRecurReadOnly(mReadOnly);\n mRecurrence->setRecurStart(dtStart());\n }\n\n return mRecurrence;\n}\n\nvoid Incidence::setLocation(const QString &location)\n{\n if (mReadOnly) return;\n mLocation = location;\n updated();\n}\n\nQString Incidence::location() const\n{\n return mLocation;\n}\n\nushort Incidence::doesRecur() const\n{\n if ( mRecurrence ) return mRecurrence->doesRecur();\n else return Recurrence::rNone;\n}\n<|endoftext|>"} {"text":"<commit_before>\/*\n This file is part of libkcal.\n\n Copyright (c) 2001,2004 Cornelius Schumacher <schumacher@kde.org>\n Copyright (C) 2004 Reinhold Kainhofer <reinhold@kainhofer.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 <klocale.h>\n#include <kdebug.h>\n#include <kstandarddirs.h>\n\n#include \"event.h\"\n#include \"todo.h\"\n#include \"freebusy.h\"\n#include \"icalformat.h\"\n#include \"calendar.h\"\n#include \"freebusycache.h\"\n\n#include \"scheduler.h\"\n\nusing namespace KCal;\n\nScheduleMessage::ScheduleMessage(IncidenceBase *incidence,int method,ScheduleMessage::Status status)\n{\n mIncidence = incidence;\n mMethod = method;\n mStatus = status;\n}\n\nQString ScheduleMessage::statusName(ScheduleMessage::Status status)\n{\n switch (status) {\n case PublishUpdate:\n return i18n(\"Updated Publish\");\n case PublishNew:\n return i18n(\"Publish\");\n case Obsolete:\n return i18n(\"Obsolete\");\n case RequestNew:\n return i18n(\"New Request\");\n case RequestUpdate:\n return i18n(\"Updated Request\");\n default:\n return i18n(\"Unknown Status: %1\").arg(QString::number(status));\n }\n}\n\nstruct Scheduler::Private\n{\n Private() : mFreeBusyCache( 0 ) {}\n\n FreeBusyCache *mFreeBusyCache;\n};\n\nScheduler::Scheduler(Calendar *calendar)\n{\n mCalendar = calendar;\n mFormat = new ICalFormat();\n mFormat->setTimeZone( calendar->timeZoneId(), !calendar->isLocalTime() );\n\n d = new Private;\n}\n\nScheduler::~Scheduler()\n{\n delete d;\n\n delete mFormat;\n}\n\nvoid Scheduler::setFreeBusyCache( FreeBusyCache *c )\n{\n d->mFreeBusyCache = c;\n}\n\nFreeBusyCache *Scheduler::freeBusyCache() const\n{\n return d->mFreeBusyCache;\n}\n\nbool Scheduler::acceptTransaction(IncidenceBase *incidence,Method method,ScheduleMessage::Status status)\n{\n kdDebug(5800) << \"Scheduler::acceptTransaction, method=\"\n << methodName( method ) << endl;\n\n switch (method) {\n case Publish:\n return acceptPublish(incidence, status, method);\n case Request:\n return acceptRequest(incidence, status);\n case Add:\n return acceptAdd(incidence, status);\n case Cancel:\n return acceptCancel(incidence, status);\n case Declinecounter:\n return acceptDeclineCounter(incidence, status);\n case Reply:\n return acceptReply(incidence, status, method);\n case Refresh:\n return acceptRefresh(incidence, status);\n case Counter:\n return acceptCounter(incidence, status);\n default:\n break;\n }\n deleteTransaction(incidence);\n return false;\n}\n\nQString Scheduler::methodName(Method method)\n{\n switch (method) {\n case Publish:\n return QString::fromLatin1(\"Publish\");\n case Request:\n return QString::fromLatin1(\"Request\");\n case Refresh:\n return QString::fromLatin1(\"Refresh\");\n case Cancel:\n return QString::fromLatin1(\"Cancel\");\n case Add:\n return QString::fromLatin1(\"Add\");\n case Reply:\n return QString::fromLatin1(\"Reply\");\n case Counter:\n return QString::fromLatin1(\"Counter\");\n case Declinecounter:\n return QString::fromLatin1(\"Decline Counter\");\n default:\n return QString::fromLatin1(\"Unknown\");\n }\n}\n\nQString Scheduler::translatedMethodName(Method method)\n{\n switch (method) {\n case Publish:\n return i18n(\"Publish\");\n case Request:\n return i18n(\"Request\");\n case Refresh:\n return i18n(\"Refresh\");\n case Cancel:\n return i18n(\"Cancel\");\n case Add:\n return i18n(\"Add\");\n case Reply:\n return i18n(\"Reply\");\n case Counter:\n return i18n(\"counter proposal\",\"Counter\");\n case Declinecounter:\n return i18n(\"decline counter proposal\",\"Decline Counter\");\n default:\n return i18n(\"Unknown\");\n }\n}\n\nbool Scheduler::deleteTransaction(IncidenceBase *)\n{\n return true;\n}\n\nbool Scheduler::acceptPublish( IncidenceBase *newIncBase,\n ScheduleMessage::Status status, Method method )\n{\n if( newIncBase->type() == \"FreeBusy\" ) {\n return acceptFreeBusy( newIncBase, method );\n }\n\n bool res = false;\n kdDebug(5800) << \"Scheduler::acceptPublish, status=\"\n << ScheduleMessage::statusName( status ) << endl;\n Incidence *newInc = static_cast<Incidence *>( newIncBase );\n Incidence *calInc = mCalendar->incidence( newIncBase->uid() );\n switch ( status ) {\n case ScheduleMessage::Unknown:\n case ScheduleMessage::PublishNew:\n case ScheduleMessage::PublishUpdate:\n res = true;\n if ( calInc ) {\n if ( (newInc->revision() > calInc->revision()) ||\n (newInc->revision() == calInc->revision() &&\n newInc->lastModified() > calInc->lastModified() ) ) {\n mCalendar->deleteIncidence( calInc );\n } else\n res = false;\n }\n if ( res )\n mCalendar->addIncidence( newInc );\n break;\n case ScheduleMessage::Obsolete:\n res = true;\n break;\n default:\n break;\n }\n deleteTransaction( newIncBase );\n return res;\n}\n\nbool Scheduler::acceptRequest(IncidenceBase *newIncBase, ScheduleMessage::Status \/* status *\/)\n{\n if (newIncBase->type()==\"FreeBusy\") {\n \/\/ reply to this request is handled in korganizer's incomingdialog\n return true;\n }\n Incidence *newInc = dynamic_cast<Incidence *>( newIncBase );\n if ( newInc ) {\n bool res = true;\n Incidence *exInc = mCalendar->incidenceFromSchedulingID( newIncBase->uid() );\n if ( exInc ) {\n res = false;\n if ( (newInc->revision() > exInc->revision()) ||\n (newInc->revision() == exInc->revision() &&\n newInc->lastModified()>exInc->lastModified()) ) {\n mCalendar->deleteIncidence( exInc );\n res = true;\n }\n }\n if ( res ) {\n \/\/ Move the uid to be the schedulingID and make a unique UID\n newInc->setSchedulingID( newInc->uid() );\n newInc->setUid( CalFormat::createUniqueId() );\n\n mCalendar->addIncidence(newInc);\n }\n deleteTransaction( newIncBase );\n return res;\n }\n return false;\n}\n\nbool Scheduler::acceptAdd(IncidenceBase *incidence,ScheduleMessage::Status \/* status *\/)\n{\n deleteTransaction(incidence);\n return false;\n}\n\nbool Scheduler::acceptCancel(IncidenceBase *incidence,ScheduleMessage::Status \/* status *\/)\n{\n bool ret = false;\n const IncidenceBase *toDelete = mCalendar->incidenceFromSchedulingID( incidence->uid() );\n Event *even = mCalendar->event(toDelete->uid());\n if (even) {\n mCalendar->deleteEvent(even);\n ret = true;\n } else {\n Todo *todo = mCalendar->todo(toDelete->uid());\n if (todo) {\n mCalendar->deleteTodo(todo);\n ret = true;\n }\n }\n deleteTransaction(incidence);\n return ret;\n}\n\nbool Scheduler::acceptDeclineCounter(IncidenceBase *incidence,ScheduleMessage::Status \/* status *\/)\n{\n deleteTransaction(incidence);\n return false;\n}\n\n\/\/bool Scheduler::acceptFreeBusy(Incidence *incidence,ScheduleMessage::Status status)\n\/\/{\n\/\/ deleteTransaction(incidence);\n\/\/ return false;\n\/\/}\n\nbool Scheduler::acceptReply(IncidenceBase *incidence,ScheduleMessage::Status \/* status *\/, Method method)\n{\n if(incidence->type()==\"FreeBusy\") {\n return acceptFreeBusy(incidence, method);\n }\n bool ret = false;\n Event *ev = mCalendar->event(incidence->uid());\n Todo *to = mCalendar->todo(incidence->uid());\n if (ev || to) {\n \/\/get matching attendee in calendar\n kdDebug(5800) << \"Scheduler::acceptTransaction match found!\" << endl;\n Attendee::List attendeesIn = incidence->attendees();\n Attendee::List attendeesEv;\n if (ev) attendeesEv = ev->attendees();\n if (to) attendeesEv = to->attendees();\n Attendee::List::ConstIterator inIt;\n Attendee::List::ConstIterator evIt;\n for ( inIt = attendeesIn.begin(); inIt != attendeesIn.end(); ++inIt ) {\n Attendee *attIn = *inIt;\n for ( evIt = attendeesEv.begin(); evIt != attendeesEv.end(); ++evIt ) {\n Attendee *attEv = *evIt;\n if (attIn->email().lower()==attEv->email().lower()) {\n \/\/update attendee-info\n kdDebug(5800) << \"Scheduler::acceptTransaction update attendee\" << endl;\n attEv->setStatus(attIn->status());\n ret = true;\n }\n }\n }\n if ( ret ) {\n \/\/ We set at least one of the attendees, so the incidence changed\n \/\/ Note: This should not result in a sequence number bump\n if ( ev )\n ev->updated();\n else if ( to )\n to->updated();\n }\n if ( to ) {\n \/\/ for VTODO a REPLY can be used to update the completion status of \n \/\/ a task. see RFC2446 3.4.3\n Todo *update = dynamic_cast<Todo*> ( incidence );\n Q_ASSERT( update );\n if ( update && ( to->percentComplete() != update->percentComplete() ) ) {\n to->setPercentComplete( update->percentComplete() );\n to->updated();\n }\n }\n } else\n kdError(5800) << \"No incidence for scheduling\\n\";\n if (ret) deleteTransaction(incidence);\n return ret;\n}\n\nbool Scheduler::acceptRefresh(IncidenceBase *incidence,ScheduleMessage::Status \/* status *\/)\n{\n \/\/ handled in korganizer's IncomingDialog\n deleteTransaction(incidence);\n return false;\n}\n\nbool Scheduler::acceptCounter(IncidenceBase *incidence,ScheduleMessage::Status \/* status *\/)\n{\n deleteTransaction(incidence);\n return false;\n}\n\nbool Scheduler::acceptFreeBusy(IncidenceBase *incidence, Method method)\n{\n if ( !d->mFreeBusyCache ) {\n kdError() << \"KCal::Scheduler: no FreeBusyCache.\" << endl;\n return false;\n }\n\n FreeBusy *freebusy = static_cast<FreeBusy *>(incidence);\n\n kdDebug(5800) << \"acceptFreeBusy:: freeBusyDirName: \" << freeBusyDir() << endl;\n\n Person from;\n if(method == Scheduler::Publish) {\n from = freebusy->organizer();\n }\n if((method == Scheduler::Reply) && (freebusy->attendeeCount() == 1)) {\n Attendee *attendee = freebusy->attendees().first();\n from = attendee->email();\n }\n\n if ( !d->mFreeBusyCache->saveFreeBusy( freebusy, from ) ) return false;\n\n deleteTransaction(incidence);\n return true;\n}\n<commit_msg>Don't crash when non-existing incidences are canceled.<commit_after>\/*\n This file is part of libkcal.\n\n Copyright (c) 2001,2004 Cornelius Schumacher <schumacher@kde.org>\n Copyright (C) 2004 Reinhold Kainhofer <reinhold@kainhofer.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 <klocale.h>\n#include <kdebug.h>\n#include <kstandarddirs.h>\n\n#include \"event.h\"\n#include \"todo.h\"\n#include \"freebusy.h\"\n#include \"icalformat.h\"\n#include \"calendar.h\"\n#include \"freebusycache.h\"\n\n#include \"scheduler.h\"\n\nusing namespace KCal;\n\nScheduleMessage::ScheduleMessage(IncidenceBase *incidence,int method,ScheduleMessage::Status status)\n{\n mIncidence = incidence;\n mMethod = method;\n mStatus = status;\n}\n\nQString ScheduleMessage::statusName(ScheduleMessage::Status status)\n{\n switch (status) {\n case PublishUpdate:\n return i18n(\"Updated Publish\");\n case PublishNew:\n return i18n(\"Publish\");\n case Obsolete:\n return i18n(\"Obsolete\");\n case RequestNew:\n return i18n(\"New Request\");\n case RequestUpdate:\n return i18n(\"Updated Request\");\n default:\n return i18n(\"Unknown Status: %1\").arg(QString::number(status));\n }\n}\n\nstruct Scheduler::Private\n{\n Private() : mFreeBusyCache( 0 ) {}\n\n FreeBusyCache *mFreeBusyCache;\n};\n\nScheduler::Scheduler(Calendar *calendar)\n{\n mCalendar = calendar;\n mFormat = new ICalFormat();\n mFormat->setTimeZone( calendar->timeZoneId(), !calendar->isLocalTime() );\n\n d = new Private;\n}\n\nScheduler::~Scheduler()\n{\n delete d;\n\n delete mFormat;\n}\n\nvoid Scheduler::setFreeBusyCache( FreeBusyCache *c )\n{\n d->mFreeBusyCache = c;\n}\n\nFreeBusyCache *Scheduler::freeBusyCache() const\n{\n return d->mFreeBusyCache;\n}\n\nbool Scheduler::acceptTransaction(IncidenceBase *incidence,Method method,ScheduleMessage::Status status)\n{\n kdDebug(5800) << \"Scheduler::acceptTransaction, method=\"\n << methodName( method ) << endl;\n\n switch (method) {\n case Publish:\n return acceptPublish(incidence, status, method);\n case Request:\n return acceptRequest(incidence, status);\n case Add:\n return acceptAdd(incidence, status);\n case Cancel:\n return acceptCancel(incidence, status);\n case Declinecounter:\n return acceptDeclineCounter(incidence, status);\n case Reply:\n return acceptReply(incidence, status, method);\n case Refresh:\n return acceptRefresh(incidence, status);\n case Counter:\n return acceptCounter(incidence, status);\n default:\n break;\n }\n deleteTransaction(incidence);\n return false;\n}\n\nQString Scheduler::methodName(Method method)\n{\n switch (method) {\n case Publish:\n return QString::fromLatin1(\"Publish\");\n case Request:\n return QString::fromLatin1(\"Request\");\n case Refresh:\n return QString::fromLatin1(\"Refresh\");\n case Cancel:\n return QString::fromLatin1(\"Cancel\");\n case Add:\n return QString::fromLatin1(\"Add\");\n case Reply:\n return QString::fromLatin1(\"Reply\");\n case Counter:\n return QString::fromLatin1(\"Counter\");\n case Declinecounter:\n return QString::fromLatin1(\"Decline Counter\");\n default:\n return QString::fromLatin1(\"Unknown\");\n }\n}\n\nQString Scheduler::translatedMethodName(Method method)\n{\n switch (method) {\n case Publish:\n return i18n(\"Publish\");\n case Request:\n return i18n(\"Request\");\n case Refresh:\n return i18n(\"Refresh\");\n case Cancel:\n return i18n(\"Cancel\");\n case Add:\n return i18n(\"Add\");\n case Reply:\n return i18n(\"Reply\");\n case Counter:\n return i18n(\"counter proposal\",\"Counter\");\n case Declinecounter:\n return i18n(\"decline counter proposal\",\"Decline Counter\");\n default:\n return i18n(\"Unknown\");\n }\n}\n\nbool Scheduler::deleteTransaction(IncidenceBase *)\n{\n return true;\n}\n\nbool Scheduler::acceptPublish( IncidenceBase *newIncBase,\n ScheduleMessage::Status status, Method method )\n{\n if( newIncBase->type() == \"FreeBusy\" ) {\n return acceptFreeBusy( newIncBase, method );\n }\n\n bool res = false;\n kdDebug(5800) << \"Scheduler::acceptPublish, status=\"\n << ScheduleMessage::statusName( status ) << endl;\n Incidence *newInc = static_cast<Incidence *>( newIncBase );\n Incidence *calInc = mCalendar->incidence( newIncBase->uid() );\n switch ( status ) {\n case ScheduleMessage::Unknown:\n case ScheduleMessage::PublishNew:\n case ScheduleMessage::PublishUpdate:\n res = true;\n if ( calInc ) {\n if ( (newInc->revision() > calInc->revision()) ||\n (newInc->revision() == calInc->revision() &&\n newInc->lastModified() > calInc->lastModified() ) ) {\n mCalendar->deleteIncidence( calInc );\n } else\n res = false;\n }\n if ( res )\n mCalendar->addIncidence( newInc );\n break;\n case ScheduleMessage::Obsolete:\n res = true;\n break;\n default:\n break;\n }\n deleteTransaction( newIncBase );\n return res;\n}\n\nbool Scheduler::acceptRequest(IncidenceBase *newIncBase, ScheduleMessage::Status \/* status *\/)\n{\n if (newIncBase->type()==\"FreeBusy\") {\n \/\/ reply to this request is handled in korganizer's incomingdialog\n return true;\n }\n Incidence *newInc = dynamic_cast<Incidence *>( newIncBase );\n if ( newInc ) {\n bool res = true;\n Incidence *exInc = mCalendar->incidenceFromSchedulingID( newIncBase->uid() );\n if ( exInc ) {\n res = false;\n if ( (newInc->revision() > exInc->revision()) ||\n (newInc->revision() == exInc->revision() &&\n newInc->lastModified()>exInc->lastModified()) ) {\n mCalendar->deleteIncidence( exInc );\n res = true;\n }\n }\n if ( res ) {\n \/\/ Move the uid to be the schedulingID and make a unique UID\n newInc->setSchedulingID( newInc->uid() );\n newInc->setUid( CalFormat::createUniqueId() );\n\n mCalendar->addIncidence(newInc);\n }\n deleteTransaction( newIncBase );\n return res;\n }\n return false;\n}\n\nbool Scheduler::acceptAdd(IncidenceBase *incidence,ScheduleMessage::Status \/* status *\/)\n{\n deleteTransaction(incidence);\n return false;\n}\n\nbool Scheduler::acceptCancel(IncidenceBase *incidence,ScheduleMessage::Status \/* status *\/)\n{\n bool ret = false;\n const IncidenceBase *toDelete = mCalendar->incidenceFromSchedulingID( incidence->uid() );\n if ( toDelete ) {\n Event *even = mCalendar->event(toDelete->uid());\n if (even) {\n mCalendar->deleteEvent(even);\n ret = true;\n } else {\n Todo *todo = mCalendar->todo(toDelete->uid());\n if (todo) {\n mCalendar->deleteTodo(todo);\n ret = true;\n }\n }\n }\n deleteTransaction(incidence);\n return ret;\n}\n\nbool Scheduler::acceptDeclineCounter(IncidenceBase *incidence,ScheduleMessage::Status \/* status *\/)\n{\n deleteTransaction(incidence);\n return false;\n}\n\n\/\/bool Scheduler::acceptFreeBusy(Incidence *incidence,ScheduleMessage::Status status)\n\/\/{\n\/\/ deleteTransaction(incidence);\n\/\/ return false;\n\/\/}\n\nbool Scheduler::acceptReply(IncidenceBase *incidence,ScheduleMessage::Status \/* status *\/, Method method)\n{\n if(incidence->type()==\"FreeBusy\") {\n return acceptFreeBusy(incidence, method);\n }\n bool ret = false;\n Event *ev = mCalendar->event(incidence->uid());\n Todo *to = mCalendar->todo(incidence->uid());\n if (ev || to) {\n \/\/get matching attendee in calendar\n kdDebug(5800) << \"Scheduler::acceptTransaction match found!\" << endl;\n Attendee::List attendeesIn = incidence->attendees();\n Attendee::List attendeesEv;\n if (ev) attendeesEv = ev->attendees();\n if (to) attendeesEv = to->attendees();\n Attendee::List::ConstIterator inIt;\n Attendee::List::ConstIterator evIt;\n for ( inIt = attendeesIn.begin(); inIt != attendeesIn.end(); ++inIt ) {\n Attendee *attIn = *inIt;\n for ( evIt = attendeesEv.begin(); evIt != attendeesEv.end(); ++evIt ) {\n Attendee *attEv = *evIt;\n if (attIn->email().lower()==attEv->email().lower()) {\n \/\/update attendee-info\n kdDebug(5800) << \"Scheduler::acceptTransaction update attendee\" << endl;\n attEv->setStatus(attIn->status());\n ret = true;\n }\n }\n }\n if ( ret ) {\n \/\/ We set at least one of the attendees, so the incidence changed\n \/\/ Note: This should not result in a sequence number bump\n if ( ev )\n ev->updated();\n else if ( to )\n to->updated();\n }\n if ( to ) {\n \/\/ for VTODO a REPLY can be used to update the completion status of \n \/\/ a task. see RFC2446 3.4.3\n Todo *update = dynamic_cast<Todo*> ( incidence );\n Q_ASSERT( update );\n if ( update && ( to->percentComplete() != update->percentComplete() ) ) {\n to->setPercentComplete( update->percentComplete() );\n to->updated();\n }\n }\n } else\n kdError(5800) << \"No incidence for scheduling\\n\";\n if (ret) deleteTransaction(incidence);\n return ret;\n}\n\nbool Scheduler::acceptRefresh(IncidenceBase *incidence,ScheduleMessage::Status \/* status *\/)\n{\n \/\/ handled in korganizer's IncomingDialog\n deleteTransaction(incidence);\n return false;\n}\n\nbool Scheduler::acceptCounter(IncidenceBase *incidence,ScheduleMessage::Status \/* status *\/)\n{\n deleteTransaction(incidence);\n return false;\n}\n\nbool Scheduler::acceptFreeBusy(IncidenceBase *incidence, Method method)\n{\n if ( !d->mFreeBusyCache ) {\n kdError() << \"KCal::Scheduler: no FreeBusyCache.\" << endl;\n return false;\n }\n\n FreeBusy *freebusy = static_cast<FreeBusy *>(incidence);\n\n kdDebug(5800) << \"acceptFreeBusy:: freeBusyDirName: \" << freeBusyDir() << endl;\n\n Person from;\n if(method == Scheduler::Publish) {\n from = freebusy->organizer();\n }\n if((method == Scheduler::Reply) && (freebusy->attendeeCount() == 1)) {\n Attendee *attendee = freebusy->attendees().first();\n from = attendee->email();\n }\n\n if ( !d->mFreeBusyCache->saveFreeBusy( freebusy, from ) ) return false;\n\n deleteTransaction(incidence);\n return true;\n}\n<|endoftext|>"} {"text":"<commit_before>#include <qpdf\/QPDFParser.hh>\n\n#include <qpdf\/QPDF.hh>\n#include <qpdf\/QPDFObjectHandle.hh>\n#include <qpdf\/QPDF_Array.hh>\n#include <qpdf\/QTC.hh>\n#include <qpdf\/QUtil.hh>\n#include <qpdf\/SparseOHArray.hh>\n\nnamespace\n{\n struct StackFrame\n {\n StackFrame(std::shared_ptr<InputSource> input) :\n offset(input->tell()),\n contents_string(\"\"),\n contents_offset(-1)\n {\n }\n\n std::vector<QPDFObjectHandle> olist;\n qpdf_offset_t offset;\n std::string contents_string;\n qpdf_offset_t contents_offset;\n };\n} \/\/ namespace\n\nQPDFObjectHandle\nQPDFParser::parse(bool& empty, bool content_stream)\n{\n \/\/ This method must take care not to resolve any objects. Don't\n \/\/ check the type of any object without first ensuring that it is\n \/\/ a direct object. Otherwise, doing so may have the side effect\n \/\/ of reading the object and changing the file pointer. If you do\n \/\/ this, it will cause a logic error to be thrown from\n \/\/ QPDF::inParse().\n\n QPDF::ParseGuard pg(context);\n\n empty = false;\n\n QPDFObjectHandle object;\n bool set_offset = false;\n\n std::vector<StackFrame> stack;\n stack.push_back(StackFrame(input));\n std::vector<parser_state_e> state_stack;\n state_stack.push_back(st_top);\n qpdf_offset_t offset;\n bool done = false;\n int bad_count = 0;\n int good_count = 0;\n bool b_contents = false;\n\n while (!done) {\n bool bad = false;\n auto& frame = stack.back();\n auto& olist = frame.olist;\n parser_state_e state = state_stack.back();\n offset = frame.offset;\n\n object = QPDFObjectHandle();\n set_offset = false;\n\n QPDFTokenizer::Token token =\n tokenizer.readToken(input, object_description, true);\n std::string const& token_error_message = token.getErrorMessage();\n if (!token_error_message.empty()) {\n \/\/ Tokens other than tt_bad can still generate warnings.\n warn(token_error_message);\n }\n\n switch (token.getType()) {\n case QPDFTokenizer::tt_eof:\n if (!content_stream) {\n QTC::TC(\"qpdf\", \"QPDFParser eof in parse\");\n warn(\"unexpected EOF\");\n }\n bad = true;\n state = st_eof;\n break;\n\n case QPDFTokenizer::tt_bad:\n QTC::TC(\"qpdf\", \"QPDFParser bad token in parse\");\n bad = true;\n object = QPDFObjectHandle::newNull();\n break;\n\n case QPDFTokenizer::tt_brace_open:\n case QPDFTokenizer::tt_brace_close:\n QTC::TC(\"qpdf\", \"QPDFParser bad brace\");\n warn(\"treating unexpected brace token as null\");\n bad = true;\n object = QPDFObjectHandle::newNull();\n break;\n\n case QPDFTokenizer::tt_array_close:\n if (state == st_array) {\n state = st_stop;\n } else {\n QTC::TC(\"qpdf\", \"QPDFParser bad array close\");\n warn(\"treating unexpected array close token as null\");\n bad = true;\n object = QPDFObjectHandle::newNull();\n }\n break;\n\n case QPDFTokenizer::tt_dict_close:\n if (state == st_dictionary) {\n state = st_stop;\n } else {\n QTC::TC(\"qpdf\", \"QPDFParser bad dictionary close\");\n warn(\"unexpected dictionary close token\");\n bad = true;\n object = QPDFObjectHandle::newNull();\n }\n break;\n\n case QPDFTokenizer::tt_array_open:\n case QPDFTokenizer::tt_dict_open:\n if (stack.size() > 500) {\n QTC::TC(\"qpdf\", \"QPDFParser too deep\");\n warn(\"ignoring excessively deeply nested data structure\");\n bad = true;\n object = QPDFObjectHandle::newNull();\n state = st_top;\n } else {\n state = st_start;\n state_stack.push_back(\n (token.getType() == QPDFTokenizer::tt_array_open)\n ? st_array\n : st_dictionary);\n b_contents = false;\n stack.push_back(StackFrame(input));\n }\n break;\n\n case QPDFTokenizer::tt_bool:\n object = QPDFObjectHandle::newBool((token.getValue() == \"true\"));\n break;\n\n case QPDFTokenizer::tt_null:\n object = QPDFObjectHandle::newNull();\n break;\n\n case QPDFTokenizer::tt_integer:\n object = QPDFObjectHandle::newInteger(\n QUtil::string_to_ll(token.getValue().c_str()));\n break;\n\n case QPDFTokenizer::tt_real:\n object = QPDFObjectHandle::newReal(token.getValue());\n break;\n\n case QPDFTokenizer::tt_name:\n {\n std::string name = token.getValue();\n object = QPDFObjectHandle::newName(name);\n\n if (name == \"\/Contents\") {\n b_contents = true;\n } else {\n b_contents = false;\n }\n }\n break;\n\n case QPDFTokenizer::tt_word:\n {\n std::string const& value = token.getValue();\n auto size = olist.size();\n if (content_stream) {\n object = QPDFObjectHandle::newOperator(value);\n } else if (\n (value == \"R\") && (state != st_top) && (size >= 2) &&\n (!olist.back().isIndirect()) &&\n (olist.back().isInteger()) &&\n (!olist.at(size - 2).isIndirect()) &&\n (olist.at(size - 2).isInteger())) {\n if (context == nullptr) {\n QTC::TC(\"qpdf\", \"QPDFParser indirect without context\");\n throw std::logic_error(\n \"QPDFObjectHandle::parse called without context\"\n \" on an object with indirect references\");\n }\n \/\/ Try to resolve indirect objects\n object = QPDFObjectHandle::newIndirect(\n context,\n QPDFObjGen(\n olist.at(size - 2).getIntValueAsInt(),\n olist.back().getIntValueAsInt()));\n olist.pop_back();\n olist.pop_back();\n } else if ((value == \"endobj\") && (state == st_top)) {\n \/\/ We just saw endobj without having read\n \/\/ anything. Treat this as a null and do not move\n \/\/ the input source's offset.\n object = QPDFObjectHandle::newNull();\n input->seek(input->getLastOffset(), SEEK_SET);\n empty = true;\n } else {\n QTC::TC(\"qpdf\", \"QPDFParser treat word as string\");\n warn(\"unknown token while reading object;\"\n \" treating as string\");\n bad = true;\n object = QPDFObjectHandle::newString(value);\n }\n }\n break;\n\n case QPDFTokenizer::tt_string:\n {\n std::string val = token.getValue();\n if (decrypter) {\n if (b_contents) {\n frame.contents_string = val;\n frame.contents_offset = input->getLastOffset();\n b_contents = false;\n }\n decrypter->decryptString(val);\n }\n object = QPDFObjectHandle::newString(val);\n }\n\n break;\n\n default:\n warn(\"treating unknown token type as null while \"\n \"reading object\");\n bad = true;\n object = QPDFObjectHandle::newNull();\n break;\n }\n\n if ((!object.isInitialized()) &&\n (!((state == st_start) || (state == st_stop) ||\n (state == st_eof)))) {\n throw std::logic_error(\"QPDFObjectHandle::parseInternal: \"\n \"unexpected uninitialized object\");\n object = QPDFObjectHandle::newNull();\n }\n\n if (bad) {\n ++bad_count;\n good_count = 0;\n } else {\n ++good_count;\n if (good_count > 3) {\n bad_count = 0;\n }\n }\n if (bad_count > 5) {\n \/\/ We had too many consecutive errors without enough\n \/\/ intervening successful objects. Give up.\n warn(\"too many errors; giving up on reading object\");\n state = st_top;\n object = QPDFObjectHandle::newNull();\n }\n\n switch (state) {\n case st_eof:\n if (state_stack.size() > 1) {\n warn(\"parse error while reading object\");\n }\n done = true;\n \/\/ In content stream mode, leave object uninitialized to\n \/\/ indicate EOF\n if (!content_stream) {\n object = QPDFObjectHandle::newNull();\n }\n break;\n\n case st_dictionary:\n case st_array:\n setDescriptionFromInput(object, input->getLastOffset());\n object.setParsedOffset(input->getLastOffset());\n set_offset = true;\n olist.push_back(object);\n break;\n\n case st_top:\n done = true;\n break;\n\n case st_start:\n break;\n\n case st_stop:\n if ((state_stack.size() < 2) || (stack.size() < 2)) {\n throw std::logic_error(\n \"QPDFObjectHandle::parseInternal: st_stop encountered\"\n \" with insufficient elements in stack\");\n }\n parser_state_e old_state = state_stack.back();\n state_stack.pop_back();\n if (old_state == st_array) {\n object = QPDFObjectHandle::newArray(olist);\n setDescriptionFromInput(object, offset);\n \/\/ The `offset` points to the next of \"[\". Set the rewind\n \/\/ offset to point to the beginning of \"[\". This has been\n \/\/ explicitly tested with whitespace surrounding the array start\n \/\/ delimiter. getLastOffset points to the array end token and\n \/\/ therefore can't be used here.\n object.setParsedOffset(offset - 1);\n set_offset = true;\n } else if (old_state == st_dictionary) {\n \/\/ Convert list to map. Alternating elements are keys. Attempt\n \/\/ to recover more or less gracefully from invalid dictionaries.\n std::set<std::string> names;\n size_t n_elements = olist.size();\n for (size_t i = 0; i < n_elements; ++i) {\n QPDFObjectHandle oh = olist.at(i);\n if ((!oh.isIndirect()) && oh.isName()) {\n names.insert(oh.getName());\n }\n }\n\n std::map<std::string, QPDFObjectHandle> dict;\n int next_fake_key = 1;\n for (unsigned int i = 0; i < n_elements; ++i) {\n QPDFObjectHandle key_obj = olist.at(i);\n QPDFObjectHandle val;\n if (key_obj.isIndirect() || (!key_obj.isName())) {\n bool found_fake = false;\n std::string candidate;\n while (!found_fake) {\n candidate = \"\/QPDFFake\" +\n QUtil::int_to_string(next_fake_key++);\n found_fake = (names.count(candidate) == 0);\n QTC::TC(\n \"qpdf\",\n \"QPDFParser found fake\",\n (found_fake ? 0 : 1));\n }\n warn(\n offset,\n \"expected dictionary key but found\"\n \" non-name object; inserting key \" +\n candidate);\n val = key_obj;\n key_obj = QPDFObjectHandle::newName(candidate);\n } else if (i + 1 >= olist.size()) {\n QTC::TC(\"qpdf\", \"QPDFParser no val for last key\");\n warn(\n offset,\n \"dictionary ended prematurely; \"\n \"using null as value for last key\");\n val = QPDFObjectHandle::newNull();\n setDescriptionFromInput(val, offset);\n } else {\n val = olist.at(++i);\n }\n std::string key = key_obj.getName();\n if (dict.count(key) > 0) {\n QTC::TC(\"qpdf\", \"QPDFParser duplicate dict key\");\n warn(\n offset,\n \"dictionary has duplicated key \" + key +\n \"; last occurrence overrides earlier \"\n \"ones\");\n }\n dict[key] = val;\n }\n if (!frame.contents_string.empty() && dict.count(\"\/Type\") &&\n dict[\"\/Type\"].isNameAndEquals(\"\/Sig\") &&\n dict.count(\"\/ByteRange\") && dict.count(\"\/Contents\") &&\n dict[\"\/Contents\"].isString()) {\n dict[\"\/Contents\"] =\n QPDFObjectHandle::newString(frame.contents_string);\n dict[\"\/Contents\"].setParsedOffset(frame.contents_offset);\n }\n object = QPDFObjectHandle::newDictionary(dict);\n setDescriptionFromInput(object, offset);\n \/\/ The `offset` points to the next of \"<<\". Set the rewind\n \/\/ offset to point to the beginning of \"<<\". This has been\n \/\/ explicitly tested with whitespace surrounding the dictionary\n \/\/ start delimiter. getLastOffset points to the dictionary end\n \/\/ token and therefore can't be used here.\n object.setParsedOffset(offset - 2);\n set_offset = true;\n }\n stack.pop_back();\n if (state_stack.back() == st_top) {\n done = true;\n } else {\n stack.back().olist.push_back(object);\n }\n }\n }\n\n if (!set_offset) {\n setDescriptionFromInput(object, offset);\n object.setParsedOffset(offset);\n }\n return object;\n}\n\nvoid\nQPDFParser::setDescriptionFromInput(\n QPDFObjectHandle oh, qpdf_offset_t offset) const\n{\n oh.setObjectDescription(\n context,\n (input->getName() + \", \" + object_description + \" at offset \" +\n QUtil::int_to_string(offset)));\n}\n\nvoid\nQPDFParser::warn(QPDF* qpdf, QPDFExc const& e)\n{\n \/\/ If parsing on behalf of a QPDF object and want to give a\n \/\/ warning, we can warn through the object. If parsing for some\n \/\/ other reason, such as an explicit creation of an object from a\n \/\/ string, then just throw the exception.\n if (qpdf) {\n qpdf->warn(e);\n } else {\n throw e;\n }\n}\n\nvoid\nQPDFParser::warn(qpdf_offset_t offset, std::string const& msg) const\n{\n warn(\n context,\n QPDFExc(\n qpdf_e_damaged_pdf,\n input->getName(),\n object_description,\n offset,\n msg));\n}\n\nvoid\nQPDFParser::warn(std::string const& msg) const\n{\n warn(input->getLastOffset(), msg);\n}\n<commit_msg>Avoid setting descriptions \/ offsets for direct nulls in QPDFParser::parse<commit_after>#include <qpdf\/QPDFParser.hh>\n\n#include <qpdf\/QPDF.hh>\n#include <qpdf\/QPDFObjectHandle.hh>\n#include <qpdf\/QPDF_Array.hh>\n#include <qpdf\/QTC.hh>\n#include <qpdf\/QUtil.hh>\n#include <qpdf\/SparseOHArray.hh>\n\nnamespace\n{\n struct StackFrame\n {\n StackFrame(std::shared_ptr<InputSource> input) :\n offset(input->tell()),\n contents_string(\"\"),\n contents_offset(-1)\n {\n }\n\n std::vector<QPDFObjectHandle> olist;\n qpdf_offset_t offset;\n std::string contents_string;\n qpdf_offset_t contents_offset;\n };\n} \/\/ namespace\n\nQPDFObjectHandle\nQPDFParser::parse(bool& empty, bool content_stream)\n{\n \/\/ This method must take care not to resolve any objects. Don't\n \/\/ check the type of any object without first ensuring that it is\n \/\/ a direct object. Otherwise, doing so may have the side effect\n \/\/ of reading the object and changing the file pointer. If you do\n \/\/ this, it will cause a logic error to be thrown from\n \/\/ QPDF::inParse().\n\n QPDF::ParseGuard pg(context);\n\n empty = false;\n\n QPDFObjectHandle object;\n bool set_offset = false;\n\n std::vector<StackFrame> stack;\n stack.push_back(StackFrame(input));\n std::vector<parser_state_e> state_stack;\n state_stack.push_back(st_top);\n qpdf_offset_t offset;\n bool done = false;\n int bad_count = 0;\n int good_count = 0;\n bool b_contents = false;\n\n while (!done) {\n bool bad = false;\n auto& frame = stack.back();\n auto& olist = frame.olist;\n parser_state_e state = state_stack.back();\n offset = frame.offset;\n\n object = QPDFObjectHandle();\n set_offset = false;\n\n QPDFTokenizer::Token token =\n tokenizer.readToken(input, object_description, true);\n std::string const& token_error_message = token.getErrorMessage();\n if (!token_error_message.empty()) {\n \/\/ Tokens other than tt_bad can still generate warnings.\n warn(token_error_message);\n }\n\n switch (token.getType()) {\n case QPDFTokenizer::tt_eof:\n if (!content_stream) {\n QTC::TC(\"qpdf\", \"QPDFParser eof in parse\");\n warn(\"unexpected EOF\");\n }\n bad = true;\n state = st_eof;\n break;\n\n case QPDFTokenizer::tt_bad:\n QTC::TC(\"qpdf\", \"QPDFParser bad token in parse\");\n bad = true;\n object = QPDFObjectHandle::newNull();\n break;\n\n case QPDFTokenizer::tt_brace_open:\n case QPDFTokenizer::tt_brace_close:\n QTC::TC(\"qpdf\", \"QPDFParser bad brace\");\n warn(\"treating unexpected brace token as null\");\n bad = true;\n object = QPDFObjectHandle::newNull();\n break;\n\n case QPDFTokenizer::tt_array_close:\n if (state == st_array) {\n state = st_stop;\n } else {\n QTC::TC(\"qpdf\", \"QPDFParser bad array close\");\n warn(\"treating unexpected array close token as null\");\n bad = true;\n object = QPDFObjectHandle::newNull();\n }\n break;\n\n case QPDFTokenizer::tt_dict_close:\n if (state == st_dictionary) {\n state = st_stop;\n } else {\n QTC::TC(\"qpdf\", \"QPDFParser bad dictionary close\");\n warn(\"unexpected dictionary close token\");\n bad = true;\n object = QPDFObjectHandle::newNull();\n }\n break;\n\n case QPDFTokenizer::tt_array_open:\n case QPDFTokenizer::tt_dict_open:\n if (stack.size() > 500) {\n QTC::TC(\"qpdf\", \"QPDFParser too deep\");\n warn(\"ignoring excessively deeply nested data structure\");\n bad = true;\n object = QPDFObjectHandle::newNull();\n state = st_top;\n } else {\n state = st_start;\n state_stack.push_back(\n (token.getType() == QPDFTokenizer::tt_array_open)\n ? st_array\n : st_dictionary);\n b_contents = false;\n stack.push_back(StackFrame(input));\n }\n break;\n\n case QPDFTokenizer::tt_bool:\n object = QPDFObjectHandle::newBool((token.getValue() == \"true\"));\n break;\n\n case QPDFTokenizer::tt_null:\n object = QPDFObjectHandle::newNull();\n break;\n\n case QPDFTokenizer::tt_integer:\n object = QPDFObjectHandle::newInteger(\n QUtil::string_to_ll(token.getValue().c_str()));\n break;\n\n case QPDFTokenizer::tt_real:\n object = QPDFObjectHandle::newReal(token.getValue());\n break;\n\n case QPDFTokenizer::tt_name:\n {\n std::string name = token.getValue();\n object = QPDFObjectHandle::newName(name);\n\n if (name == \"\/Contents\") {\n b_contents = true;\n } else {\n b_contents = false;\n }\n }\n break;\n\n case QPDFTokenizer::tt_word:\n {\n std::string const& value = token.getValue();\n auto size = olist.size();\n if (content_stream) {\n object = QPDFObjectHandle::newOperator(value);\n } else if (\n (value == \"R\") && (state != st_top) && (size >= 2) &&\n (!olist.back().isIndirect()) &&\n (olist.back().isInteger()) &&\n (!olist.at(size - 2).isIndirect()) &&\n (olist.at(size - 2).isInteger())) {\n if (context == nullptr) {\n QTC::TC(\"qpdf\", \"QPDFParser indirect without context\");\n throw std::logic_error(\n \"QPDFObjectHandle::parse called without context\"\n \" on an object with indirect references\");\n }\n \/\/ Try to resolve indirect objects\n object = QPDFObjectHandle::newIndirect(\n context,\n QPDFObjGen(\n olist.at(size - 2).getIntValueAsInt(),\n olist.back().getIntValueAsInt()));\n olist.pop_back();\n olist.pop_back();\n } else if ((value == \"endobj\") && (state == st_top)) {\n \/\/ We just saw endobj without having read\n \/\/ anything. Treat this as a null and do not move\n \/\/ the input source's offset.\n object = QPDFObjectHandle::newNull();\n input->seek(input->getLastOffset(), SEEK_SET);\n empty = true;\n } else {\n QTC::TC(\"qpdf\", \"QPDFParser treat word as string\");\n warn(\"unknown token while reading object;\"\n \" treating as string\");\n bad = true;\n object = QPDFObjectHandle::newString(value);\n }\n }\n break;\n\n case QPDFTokenizer::tt_string:\n {\n std::string val = token.getValue();\n if (decrypter) {\n if (b_contents) {\n frame.contents_string = val;\n frame.contents_offset = input->getLastOffset();\n b_contents = false;\n }\n decrypter->decryptString(val);\n }\n object = QPDFObjectHandle::newString(val);\n }\n\n break;\n\n default:\n warn(\"treating unknown token type as null while \"\n \"reading object\");\n bad = true;\n object = QPDFObjectHandle::newNull();\n break;\n }\n\n if ((!object.isInitialized()) &&\n (!((state == st_start) || (state == st_stop) ||\n (state == st_eof)))) {\n throw std::logic_error(\"QPDFObjectHandle::parseInternal: \"\n \"unexpected uninitialized object\");\n object = QPDFObjectHandle::newNull();\n }\n\n if (bad) {\n ++bad_count;\n good_count = 0;\n } else {\n ++good_count;\n if (good_count > 3) {\n bad_count = 0;\n }\n }\n if (bad_count > 5) {\n \/\/ We had too many consecutive errors without enough\n \/\/ intervening successful objects. Give up.\n warn(\"too many errors; giving up on reading object\");\n state = st_top;\n object = QPDFObjectHandle::newNull();\n }\n\n switch (state) {\n case st_eof:\n if (state_stack.size() > 1) {\n warn(\"parse error while reading object\");\n }\n done = true;\n \/\/ In content stream mode, leave object uninitialized to\n \/\/ indicate EOF\n if (!content_stream) {\n object = QPDFObjectHandle::newNull();\n }\n break;\n\n case st_dictionary:\n case st_array:\n if (!object.isDirectNull()) {\n \/\/ No need to set description for direct nulls- they will\n \/\/ become implicit.\n setDescriptionFromInput(object, input->getLastOffset());\n object.setParsedOffset(input->getLastOffset());\n }\n set_offset = true;\n olist.push_back(object);\n break;\n\n case st_top:\n done = true;\n break;\n\n case st_start:\n break;\n\n case st_stop:\n if ((state_stack.size() < 2) || (stack.size() < 2)) {\n throw std::logic_error(\n \"QPDFObjectHandle::parseInternal: st_stop encountered\"\n \" with insufficient elements in stack\");\n }\n parser_state_e old_state = state_stack.back();\n state_stack.pop_back();\n if (old_state == st_array) {\n object = QPDFObjectHandle::newArray(olist);\n setDescriptionFromInput(object, offset);\n \/\/ The `offset` points to the next of \"[\". Set the rewind\n \/\/ offset to point to the beginning of \"[\". This has been\n \/\/ explicitly tested with whitespace surrounding the array start\n \/\/ delimiter. getLastOffset points to the array end token and\n \/\/ therefore can't be used here.\n object.setParsedOffset(offset - 1);\n set_offset = true;\n } else if (old_state == st_dictionary) {\n \/\/ Convert list to map. Alternating elements are keys. Attempt\n \/\/ to recover more or less gracefully from invalid dictionaries.\n std::set<std::string> names;\n size_t n_elements = olist.size();\n for (size_t i = 0; i < n_elements; ++i) {\n QPDFObjectHandle oh = olist.at(i);\n if ((!oh.isIndirect()) && oh.isName()) {\n names.insert(oh.getName());\n }\n }\n\n std::map<std::string, QPDFObjectHandle> dict;\n int next_fake_key = 1;\n for (unsigned int i = 0; i < n_elements; ++i) {\n QPDFObjectHandle key_obj = olist.at(i);\n QPDFObjectHandle val;\n if (key_obj.isIndirect() || (!key_obj.isName())) {\n bool found_fake = false;\n std::string candidate;\n while (!found_fake) {\n candidate = \"\/QPDFFake\" +\n QUtil::int_to_string(next_fake_key++);\n found_fake = (names.count(candidate) == 0);\n QTC::TC(\n \"qpdf\",\n \"QPDFParser found fake\",\n (found_fake ? 0 : 1));\n }\n warn(\n offset,\n \"expected dictionary key but found\"\n \" non-name object; inserting key \" +\n candidate);\n val = key_obj;\n key_obj = QPDFObjectHandle::newName(candidate);\n } else if (i + 1 >= olist.size()) {\n QTC::TC(\"qpdf\", \"QPDFParser no val for last key\");\n warn(\n offset,\n \"dictionary ended prematurely; \"\n \"using null as value for last key\");\n val = QPDFObjectHandle::newNull();\n setDescriptionFromInput(val, offset);\n } else {\n val = olist.at(++i);\n }\n std::string key = key_obj.getName();\n if (dict.count(key) > 0) {\n QTC::TC(\"qpdf\", \"QPDFParser duplicate dict key\");\n warn(\n offset,\n \"dictionary has duplicated key \" + key +\n \"; last occurrence overrides earlier \"\n \"ones\");\n }\n dict[key] = val;\n }\n if (!frame.contents_string.empty() && dict.count(\"\/Type\") &&\n dict[\"\/Type\"].isNameAndEquals(\"\/Sig\") &&\n dict.count(\"\/ByteRange\") && dict.count(\"\/Contents\") &&\n dict[\"\/Contents\"].isString()) {\n dict[\"\/Contents\"] =\n QPDFObjectHandle::newString(frame.contents_string);\n dict[\"\/Contents\"].setParsedOffset(frame.contents_offset);\n }\n object = QPDFObjectHandle::newDictionary(dict);\n setDescriptionFromInput(object, offset);\n \/\/ The `offset` points to the next of \"<<\". Set the rewind\n \/\/ offset to point to the beginning of \"<<\". This has been\n \/\/ explicitly tested with whitespace surrounding the dictionary\n \/\/ start delimiter. getLastOffset points to the dictionary end\n \/\/ token and therefore can't be used here.\n object.setParsedOffset(offset - 2);\n set_offset = true;\n }\n stack.pop_back();\n if (state_stack.back() == st_top) {\n done = true;\n } else {\n stack.back().olist.push_back(object);\n }\n }\n }\n\n if (!set_offset) {\n setDescriptionFromInput(object, offset);\n object.setParsedOffset(offset);\n }\n return object;\n}\n\nvoid\nQPDFParser::setDescriptionFromInput(\n QPDFObjectHandle oh, qpdf_offset_t offset) const\n{\n oh.setObjectDescription(\n context,\n (input->getName() + \", \" + object_description + \" at offset \" +\n QUtil::int_to_string(offset)));\n}\n\nvoid\nQPDFParser::warn(QPDF* qpdf, QPDFExc const& e)\n{\n \/\/ If parsing on behalf of a QPDF object and want to give a\n \/\/ warning, we can warn through the object. If parsing for some\n \/\/ other reason, such as an explicit creation of an object from a\n \/\/ string, then just throw the exception.\n if (qpdf) {\n qpdf->warn(e);\n } else {\n throw e;\n }\n}\n\nvoid\nQPDFParser::warn(qpdf_offset_t offset, std::string const& msg) const\n{\n warn(\n context,\n QPDFExc(\n qpdf_e_damaged_pdf,\n input->getName(),\n object_description,\n offset,\n msg));\n}\n\nvoid\nQPDFParser::warn(std::string const& msg) const\n{\n warn(input->getLastOffset(), msg);\n}\n<|endoftext|>"} {"text":"<commit_before>#include <qpdf\/QPDF_Array.hh>\n#include <stdexcept>\n\nQPDF_Array::QPDF_Array(std::vector<QPDFObjectHandle> const& items) :\n items(items)\n{\n}\n\nQPDF_Array::~QPDF_Array()\n{\n}\n\nvoid\nQPDF_Array::releaseResolved()\n{\n for (std::vector<QPDFObjectHandle>::iterator iter = this->items.begin();\n\t iter != this->items.end(); ++iter)\n {\n\tQPDFObjectHandle::ReleaseResolver::releaseResolved(*iter);\n }\n}\n\nstd::string\nQPDF_Array::unparse()\n{\n std::string result = \"[ \";\n for (std::vector<QPDFObjectHandle>::iterator iter = this->items.begin();\n\t iter != this->items.end(); ++iter)\n {\n\tresult += (*iter).unparse();\n\tresult += \" \";\n }\n result += \"]\";\n return result;\n}\n\nint\nQPDF_Array::getNItems() const\n{\n return (int)this->items.size();\n}\n\nQPDFObjectHandle\nQPDF_Array::getItem(int n) const\n{\n if ((n < 0) || (n >= (int)this->items.size()))\n {\n\tthrow std::logic_error(\n\t \"INTERNAL ERROR: bounds array accessing QPDF_Array element\");\n }\n return this->items[n];\n}\n\nstd::vector<QPDFObjectHandle> const&\nQPDF_Array::getAsVector() const\n{\n return this->items;\n}\n\nvoid\nQPDF_Array::setItem(int n, QPDFObjectHandle const& oh)\n{\n \/\/ Call getItem for bounds checking\n (void) getItem(n);\n this->items[n] = oh;\n}\n<commit_msg>Fix wording error in error message<commit_after>#include <qpdf\/QPDF_Array.hh>\n#include <stdexcept>\n\nQPDF_Array::QPDF_Array(std::vector<QPDFObjectHandle> const& items) :\n items(items)\n{\n}\n\nQPDF_Array::~QPDF_Array()\n{\n}\n\nvoid\nQPDF_Array::releaseResolved()\n{\n for (std::vector<QPDFObjectHandle>::iterator iter = this->items.begin();\n\t iter != this->items.end(); ++iter)\n {\n\tQPDFObjectHandle::ReleaseResolver::releaseResolved(*iter);\n }\n}\n\nstd::string\nQPDF_Array::unparse()\n{\n std::string result = \"[ \";\n for (std::vector<QPDFObjectHandle>::iterator iter = this->items.begin();\n\t iter != this->items.end(); ++iter)\n {\n\tresult += (*iter).unparse();\n\tresult += \" \";\n }\n result += \"]\";\n return result;\n}\n\nint\nQPDF_Array::getNItems() const\n{\n return (int)this->items.size();\n}\n\nQPDFObjectHandle\nQPDF_Array::getItem(int n) const\n{\n if ((n < 0) || (n >= (int)this->items.size()))\n {\n\tthrow std::logic_error(\n\t \"INTERNAL ERROR: bounds error accessing QPDF_Array element\");\n }\n return this->items[n];\n}\n\nstd::vector<QPDFObjectHandle> const&\nQPDF_Array::getAsVector() const\n{\n return this->items;\n}\n\nvoid\nQPDF_Array::setItem(int n, QPDFObjectHandle const& oh)\n{\n \/\/ Call getItem for bounds checking\n (void) getItem(n);\n this->items[n] = oh;\n}\n<|endoftext|>"} {"text":"<commit_before>\/*\n * Copyright (C) 2016 deipi.com LLC and contributors. 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\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 \"utils.h\"\n\n\nbool write_file_contents(const std::string& filename, const std::string& contents) {\n\tstd::ofstream of(filename.data(), std::ios::out | std::ios::binary);\n\tif (of.bad()) {\n\t\treturn false;\n\t}\n\tof.write(contents.data(), contents.size());\n\treturn true;\n}\n\n\nbool read_file_contents(const std::string& filename, std::string* contents) {\n\tstd::ifstream in(filename.data(), std::ios::in | std::ios::binary);\n\tif (in.bad()) {\n\t\treturn false;\n\t}\n\n\tin.seekg(0, std::ios::end);\n\tcontents->resize(static_cast<size_t>(in.tellg()));\n\tin.seekg(0, std::ios::beg);\n\tin.read(&(*contents)[0], contents->size());\n\tin.close();\n\treturn true;\n}\n\n\nDB_Test::DB_Test(const std::string& db_name, const std::vector<std::string>& docs, int flags, const std::string& ct_type)\n\t: name_database(db_name)\n{\n\t\/\/ Delete database to create new db.\n\tdelete_files(name_database);\n\tcreate_manager();\n\n\tendpoints.add(create_endpoint(name_database));\n\n\tdb_handler.reset(endpoints, flags, HTTP_GET);\n\n\t\/\/ Index documents in the database.\n\tsize_t i = 1;\n\tfor (const auto& doc : docs) {\n\t\tstd::string buffer;\n\t\ttry {\n\t\t\tif (!read_file_contents(doc, &buffer)) {\n\t\t\t\tdestroy();\n\t\t\t\tL_ERR(nullptr, \"Can not read the file %s\", doc.c_str());\n\t\t\t} else if (db_handler.index(std::to_string(i++), false, get_body(buffer, ct_type).second, true, ct_type).first == 0) {\n\t\t\t\tdestroy();\n\t\t\t\tTHROW(Error, \"File %s can not index\", doc.c_str());\n\t\t\t}\n\t\t} catch (const std::exception& e) {\n\t\t\tdestroy();\n\t\t\tTHROW(Error, \"File %s can not index [%s]\", doc.c_str(), e.what());\n\t\t}\n\t}\n}\n\n\nDB_Test::~DB_Test()\n{\n\tdestroy();\n}\n\n\nvoid\nDB_Test::destroy()\n{\n\tXapiandManager::manager.reset();\n\tdelete_files(name_database);\n}\n\n\nvoid\nDB_Test::create_manager()\n{\n\tif (!XapiandManager::manager) {\n\t\topts_t opts = {\n\t\t\tTEST_VERBOSITY, TEST_DETACH, TEST_CHERT, TEST_SOLO, TEST_STRICT, TEST_OPTIMAL, TEST_DATABASE,\n\t\t\tTEST_CLUSTER_NAME, TEST_NODE_NAME, XAPIAND_HTTP_SERVERPORT, XAPIAND_BINARY_SERVERPORT,\n\t\t\tXAPIAND_DISCOVERY_SERVERPORT, XAPIAND_RAFT_SERVERPORT, TEST_PIDFILE,\n\t\t\tTEST_LOGFILE, TEST_UID, TEST_GID, TEST_DISCOVERY_GROUP, TEST_RAFT_GROUP,\n\t\t\tTEST_NUM_SERVERS, TEST_DBPOOL_SIZE, TEST_NUM_REPLICATORS, TEST_THREADPOOL_SIZE,\n\t\t\tTEST_ENDPOINT_LIST_SIZE, TEST_NUM_COMMITERS, NUM_FSYNCHERS, TEST_MAX_CLIENTS,\n\t\t\tMAX_DATABASES, TEST_MAX_FILES, TEST_EV_FLAG\n\t\t};\n\n\t\tev::default_loop default_loop(opts.ev_flags);\n\t\tXapiandManager::manager = Worker::make_shared<XapiandManager>(&default_loop, opts.ev_flags, opts);\n\t}\n}\n\n\nstd::pair<std::string, MsgPack>\nDB_Test::get_body(const std::string& body, const std::string& ct_type)\n{\n\tMsgPack msgpack;\n\trapidjson::Document rdoc;\n\tswitch (xxh64::hash(ct_type)) {\n\t\tcase xxh64::hash(FORM_URLENCODED_CONTENT_TYPE):\n\t\t\ttry {\n\t\t\t\tjson_load(rdoc, body);\n\t\t\t\tmsgpack = MsgPack(rdoc);\n\t\t\t} catch (const std::exception&) {\n\t\t\t\tmsgpack = MsgPack(body);\n\t\t\t}\n\t\t\tbreak;\n\t\tcase xxh64::hash(JSON_CONTENT_TYPE):\n\t\t\tjson_load(rdoc, body);\n\t\t\tmsgpack = MsgPack(rdoc);\n\t\t\tbreak;\n\t\tcase xxh64::hash(MSGPACK_CONTENT_TYPE):\n\t\tcase xxh64::hash(X_MSGPACK_CONTENT_TYPE):\n\t\t\tmsgpack = MsgPack::unserialise(body);\n\t\t\tbreak;\n\t\tdefault:\n\t\t\tmsgpack = MsgPack(body);\n\t\t\tbreak;\n\t}\n\n\treturn std::make_pair(ct_type, msgpack);\n}\n<commit_msg>Fixing bug in tests\/utils.cc<commit_after>\/*\n * Copyright (C) 2016 deipi.com LLC and contributors. 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\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 \"utils.h\"\n\n\nbool write_file_contents(const std::string& filename, const std::string& contents) {\n\tstd::ofstream of(filename.data(), std::ios::out | std::ios::binary);\n\tif (of.bad()) {\n\t\treturn false;\n\t}\n\tof.write(contents.data(), contents.size());\n\treturn true;\n}\n\n\nbool read_file_contents(const std::string& filename, std::string* contents) {\n\tstd::ifstream in(filename.data(), std::ios::in | std::ios::binary);\n\tif (in.bad()) {\n\t\treturn false;\n\t}\n\n\tin.seekg(0, std::ios::end);\n\tcontents->resize(static_cast<size_t>(in.tellg()));\n\tin.seekg(0, std::ios::beg);\n\tin.read(&(*contents)[0], contents->size());\n\tin.close();\n\treturn true;\n}\n\n\nDB_Test::DB_Test(const std::string& db_name, const std::vector<std::string>& docs, int flags, const std::string& ct_type)\n\t: name_database(db_name)\n{\n\t\/\/ Delete database to create new db.\n\tdelete_files(name_database);\n\tcreate_manager();\n\n\tendpoints.add(create_endpoint(name_database));\n\n\tdb_handler.reset(endpoints, flags, HTTP_GET);\n\n\t\/\/ Index documents in the database.\n\tsize_t i = 1;\n\tfor (const auto& doc : docs) {\n\t\tstd::string buffer;\n\t\ttry {\n\t\t\tif (!read_file_contents(doc, &buffer)) {\n\t\t\t\tdestroy();\n\t\t\t\tL_ERR(nullptr, \"Can not read the file %s\", doc.c_str());\n\t\t\t} else if (db_handler.index(std::to_string(i++), false, get_body(buffer, ct_type).second, true, ct_type_t(ct_type)).first == 0) {\n\t\t\t\tdestroy();\n\t\t\t\tTHROW(Error, \"File %s can not index\", doc.c_str());\n\t\t\t}\n\t\t} catch (const std::exception& e) {\n\t\t\tdestroy();\n\t\t\tTHROW(Error, \"File %s can not index [%s]\", doc.c_str(), e.what());\n\t\t}\n\t}\n}\n\n\nDB_Test::~DB_Test()\n{\n\tdestroy();\n}\n\n\nvoid\nDB_Test::destroy()\n{\n\tXapiandManager::manager.reset();\n\tdelete_files(name_database);\n}\n\n\nvoid\nDB_Test::create_manager()\n{\n\tif (!XapiandManager::manager) {\n\t\topts_t opts = {\n\t\t\tTEST_VERBOSITY, TEST_DETACH, TEST_CHERT, TEST_SOLO, TEST_STRICT, TEST_OPTIMAL, TEST_DATABASE,\n\t\t\tTEST_CLUSTER_NAME, TEST_NODE_NAME, XAPIAND_HTTP_SERVERPORT, XAPIAND_BINARY_SERVERPORT,\n\t\t\tXAPIAND_DISCOVERY_SERVERPORT, XAPIAND_RAFT_SERVERPORT, TEST_PIDFILE,\n\t\t\tTEST_LOGFILE, TEST_UID, TEST_GID, TEST_DISCOVERY_GROUP, TEST_RAFT_GROUP,\n\t\t\tTEST_NUM_SERVERS, TEST_DBPOOL_SIZE, TEST_NUM_REPLICATORS, TEST_THREADPOOL_SIZE,\n\t\t\tTEST_ENDPOINT_LIST_SIZE, TEST_NUM_COMMITERS, NUM_FSYNCHERS, TEST_MAX_CLIENTS,\n\t\t\tMAX_DATABASES, TEST_MAX_FILES, TEST_EV_FLAG\n\t\t};\n\n\t\tev::default_loop default_loop(opts.ev_flags);\n\t\tXapiandManager::manager = Worker::make_shared<XapiandManager>(&default_loop, opts.ev_flags, opts);\n\t}\n}\n\n\nstd::pair<std::string, MsgPack>\nDB_Test::get_body(const std::string& body, const std::string& ct_type)\n{\n\tMsgPack msgpack;\n\trapidjson::Document rdoc;\n\tswitch (xxh64::hash(ct_type)) {\n\t\tcase xxh64::hash(FORM_URLENCODED_CONTENT_TYPE):\n\t\t\ttry {\n\t\t\t\tjson_load(rdoc, body);\n\t\t\t\tmsgpack = MsgPack(rdoc);\n\t\t\t} catch (const std::exception&) {\n\t\t\t\tmsgpack = MsgPack(body);\n\t\t\t}\n\t\t\tbreak;\n\t\tcase xxh64::hash(JSON_CONTENT_TYPE):\n\t\t\tjson_load(rdoc, body);\n\t\t\tmsgpack = MsgPack(rdoc);\n\t\t\tbreak;\n\t\tcase xxh64::hash(MSGPACK_CONTENT_TYPE):\n\t\tcase xxh64::hash(X_MSGPACK_CONTENT_TYPE):\n\t\t\tmsgpack = MsgPack::unserialise(body);\n\t\t\tbreak;\n\t\tdefault:\n\t\t\tmsgpack = MsgPack(body);\n\t\t\tbreak;\n\t}\n\n\treturn std::make_pair(ct_type, msgpack);\n}\n<|endoftext|>"} {"text":"<commit_before>695afefc-2e4e-11e5-9284-b827eb9e62be<commit_msg>69602896-2e4e-11e5-9284-b827eb9e62be<commit_after>69602896-2e4e-11e5-9284-b827eb9e62be<|endoftext|>"} {"text":"<commit_before>df320690-2e4c-11e5-9284-b827eb9e62be<commit_msg>df36f394-2e4c-11e5-9284-b827eb9e62be<commit_after>df36f394-2e4c-11e5-9284-b827eb9e62be<|endoftext|>"} {"text":"<commit_before>9fb3faa4-2e4d-11e5-9284-b827eb9e62be<commit_msg>9fb8e8c0-2e4d-11e5-9284-b827eb9e62be<commit_after>9fb8e8c0-2e4d-11e5-9284-b827eb9e62be<|endoftext|>"} {"text":"<commit_before>e2f4d320-2e4c-11e5-9284-b827eb9e62be<commit_msg>e2f9d35c-2e4c-11e5-9284-b827eb9e62be<commit_after>e2f9d35c-2e4c-11e5-9284-b827eb9e62be<|endoftext|>"} {"text":"<commit_before>621d9744-2e4e-11e5-9284-b827eb9e62be<commit_msg>6222a932-2e4e-11e5-9284-b827eb9e62be<commit_after>6222a932-2e4e-11e5-9284-b827eb9e62be<|endoftext|>"} {"text":"<commit_before>f2c7cb8e-2e4e-11e5-9284-b827eb9e62be<commit_msg>f2ccc684-2e4e-11e5-9284-b827eb9e62be<commit_after>f2ccc684-2e4e-11e5-9284-b827eb9e62be<|endoftext|>"} {"text":"<commit_before><commit_msg>warning C4702: unreachable code<commit_after><|endoftext|>"} {"text":"<commit_before>800710b0-2e4d-11e5-9284-b827eb9e62be<commit_msg>800c0610-2e4d-11e5-9284-b827eb9e62be<commit_after>800c0610-2e4d-11e5-9284-b827eb9e62be<|endoftext|>"} {"text":"<commit_before>96105a56-2e4d-11e5-9284-b827eb9e62be<commit_msg>96156afa-2e4d-11e5-9284-b827eb9e62be<commit_after>96156afa-2e4d-11e5-9284-b827eb9e62be<|endoftext|>"} {"text":"<commit_before>\/\/----------------------------------*-C++-*----------------------------------\/\/\n\/*!\n * \\file cxx11\/tstLoops.cc\n * \\author Thomas M. Evans\n * \\date Wed May 07 22:49:15 2014\n * \\brief C++-11 Loop testing.\n * \\note Copyright (C) 2014 Oak Ridge National Laboratory, UT-Battelle, LLC.\n *\/\n\/\/---------------------------------------------------------------------------\/\/\n\n#include <vector>\n\n#include \"gtest\/utils_gtest.hh\"\n\n\/\/---------------------------------------------------------------------------\/\/\n\/\/ TESTS\n\/\/---------------------------------------------------------------------------\/\/\n\nTEST(Loops, begin_end)\n{\n int x[] = {1, 2, 3, 4};\n\n int n = 1;\n for (auto i = std::begin(x); i != std::end(x); ++i)\n {\n EXPECT_EQ(n, *i);\n ++n;\n }\n EXPECT_EQ(5, n);\n}\n\n\/\/---------------------------------------------------------------------------\/\/\n\nTEST(Loops, const_range)\n{\n int x[] = {1, 2, 3, 4};\n std::vector<int> y(3);\n y[0] = 10; y[1] = 11; y[2] = 12;\n\n int n = 1;\n for (auto i : x)\n {\n EXPECT_EQ(n, i);\n ++n;\n }\n EXPECT_EQ(5, n);\n\n n = 10;\n for (auto i : y)\n {\n EXPECT_EQ(n, i);\n ++n;\n }\n EXPECT_EQ(13, n);\n}\n\n\/\/---------------------------------------------------------------------------\/\/\n\nTEST(Loops, mutable_range)\n{\n int x[] = {1, 2, 3, 4};\n std::vector<int> y(3);\n y[0] = 10; y[1] = 11; y[2] = 12;\n\n for (auto &i : x)\n {\n i += 10;\n }\n\n for (auto i : y)\n {\n i += 10;\n }\n\n EXPECT_EQ(11, x[0]);\n EXPECT_EQ(12, x[1]);\n EXPECT_EQ(13, x[2]);\n EXPECT_EQ(14, x[3]);\n\n EXPECT_EQ(10, y[0]);\n EXPECT_EQ(11, y[1]);\n EXPECT_EQ(12, y[2]);\n\n for (auto &i : y)\n {\n i += 10;\n }\n\n EXPECT_EQ(20, y[0]);\n EXPECT_EQ(21, y[1]);\n EXPECT_EQ(22, y[2]);\n\n for (int i = 0; i < 3; ++i)\n {\n y[i] += 1;\n }\n\n EXPECT_EQ(21, y[0]);\n EXPECT_EQ(22, y[1]);\n EXPECT_EQ(23, y[2]);\n}\n\n\/\/---------------------------------------------------------------------------\/\/\n\/\/ end of tstLoops.cc\n\/\/---------------------------------------------------------------------------\/\/\n<commit_msg>Added vec-bool test.<commit_after>\/\/----------------------------------*-C++-*----------------------------------\/\/\n\/*!\n * \\file cxx11\/tstLoops.cc\n * \\author Thomas M. Evans\n * \\date Wed May 07 22:49:15 2014\n * \\brief C++-11 Loop testing.\n * \\note Copyright (C) 2014 Oak Ridge National Laboratory, UT-Battelle, LLC.\n *\/\n\/\/---------------------------------------------------------------------------\/\/\n\n#include <vector>\n\n#include \"gtest\/utils_gtest.hh\"\n\n\/\/---------------------------------------------------------------------------\/\/\n\/\/ TESTS\n\/\/---------------------------------------------------------------------------\/\/\n\nTEST(Loops, begin_end)\n{\n int x[] = {1, 2, 3, 4};\n\n int n = 1;\n for (auto i = std::begin(x); i != std::end(x); ++i)\n {\n EXPECT_EQ(n, *i);\n ++n;\n }\n EXPECT_EQ(5, n);\n}\n\n\/\/---------------------------------------------------------------------------\/\/\n\nTEST(Loops, const_range)\n{\n int x[] = {1, 2, 3, 4};\n std::vector<int> y(3);\n y[0] = 10; y[1] = 11; y[2] = 12;\n\n int n = 1;\n for (auto i : x)\n {\n EXPECT_EQ(n, i);\n ++n;\n }\n EXPECT_EQ(5, n);\n\n n = 10;\n for (auto i : y)\n {\n EXPECT_EQ(n, i);\n ++n;\n }\n EXPECT_EQ(13, n);\n}\n\n\/\/---------------------------------------------------------------------------\/\/\n\nTEST(Loops, mutable_range)\n{\n int x[] = {1, 2, 3, 4};\n std::vector<int> y(3);\n y[0] = 10; y[1] = 11; y[2] = 12;\n\n for (auto &i : x)\n {\n i += 10;\n }\n\n for (auto i : y)\n {\n i += 10;\n }\n\n EXPECT_EQ(11, x[0]);\n EXPECT_EQ(12, x[1]);\n EXPECT_EQ(13, x[2]);\n EXPECT_EQ(14, x[3]);\n\n EXPECT_EQ(10, y[0]);\n EXPECT_EQ(11, y[1]);\n EXPECT_EQ(12, y[2]);\n\n for (auto &i : y)\n {\n i += 10;\n }\n\n EXPECT_EQ(20, y[0]);\n EXPECT_EQ(21, y[1]);\n EXPECT_EQ(22, y[2]);\n\n for (int i = 0; i < 3; ++i)\n {\n y[i] += 1;\n }\n\n EXPECT_EQ(21, y[0]);\n EXPECT_EQ(22, y[1]);\n EXPECT_EQ(23, y[2]);\n}\n\n\/\/---------------------------------------------------------------------------\/\/\n\nTEST(Loops, vector_bool)\n{\n \/\/ vector<bool>'s are special because they are packed, thus they return a\n \/\/ *proxy* iterator\n\n bool v[] = {true, false, false, true};\n\n std::vector<bool> vb(std::begin(v), std::end(v));\n EXPECT_TRUE(vb[0]);\n EXPECT_FALSE(vb[1]);\n EXPECT_FALSE(vb[2]);\n EXPECT_TRUE(vb[3]);\n\n vb[1] = true;\n vb[2] = true;\n\n \/\/ only changes local value\n for (auto &&b : vb)\n {\n EXPECT_TRUE(b);\n b = false;\n }\n\n EXPECT_FALSE(vb[0]);\n EXPECT_FALSE(vb[1]);\n EXPECT_FALSE(vb[2]);\n EXPECT_FALSE(vb[3]);\n}\n\n\/\/---------------------------------------------------------------------------\/\/\n\/\/ end of tstLoops.cc\n\/\/---------------------------------------------------------------------------\/\/\n<|endoftext|>"} {"text":"<commit_before>\/\/===-LTOCodeGenerator.cpp - LLVM Link Time Optimizer ---------------------===\/\/\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 Link Time Optimization library. This library is\n\/\/ intended to be used by linker to optimize code at link time.\n\/\/\n\/\/===----------------------------------------------------------------------===\/\/\n\n#include \"LTOCodeGenerator.h\"\n#include \"LTOModule.h\"\n#include \"llvm\/Constants.h\"\n#include \"llvm\/DerivedTypes.h\"\n#include \"llvm\/Linker.h\"\n#include \"llvm\/LLVMContext.h\"\n#include \"llvm\/Module.h\"\n#include \"llvm\/PassManager.h\"\n#include \"llvm\/ADT\/StringExtras.h\"\n#include \"llvm\/ADT\/Triple.h\"\n#include \"llvm\/Analysis\/Passes.h\"\n#include \"llvm\/Analysis\/Verifier.h\"\n#include \"llvm\/Bitcode\/ReaderWriter.h\"\n#include \"llvm\/MC\/MCAsmInfo.h\"\n#include \"llvm\/MC\/MCContext.h\"\n#include \"llvm\/MC\/SubtargetFeature.h\"\n#include \"llvm\/Target\/Mangler.h\"\n#include \"llvm\/Target\/TargetOptions.h\"\n#include \"llvm\/Target\/TargetData.h\"\n#include \"llvm\/Target\/TargetMachine.h\"\n#include \"llvm\/Target\/TargetRegisterInfo.h\"\n#include \"llvm\/Support\/CommandLine.h\"\n#include \"llvm\/Support\/ErrorHandling.h\"\n#include \"llvm\/Support\/FormattedStream.h\"\n#include \"llvm\/Support\/MemoryBuffer.h\"\n#include \"llvm\/Support\/SystemUtils.h\"\n#include \"llvm\/Support\/ToolOutputFile.h\"\n#include \"llvm\/Support\/Host.h\"\n#include \"llvm\/Support\/Program.h\"\n#include \"llvm\/Support\/Signals.h\"\n#include \"llvm\/Support\/TargetRegistry.h\"\n#include \"llvm\/Support\/TargetSelect.h\"\n#include \"llvm\/Support\/system_error.h\"\n#include \"llvm\/Config\/config.h\"\n#include \"llvm\/Transforms\/IPO.h\"\n#include \"llvm\/Transforms\/IPO\/PassManagerBuilder.h\"\n#include <cstdlib>\n#include <unistd.h>\n#include <fcntl.h>\nusing namespace llvm;\n\nstatic cl::opt<bool> DisableInline(\"disable-inlining\",\n cl::desc(\"Do not run the inliner pass\"));\n\nconst char* LTOCodeGenerator::getVersionString() {\n#ifdef LLVM_VERSION_INFO\n return PACKAGE_NAME \" version \" PACKAGE_VERSION \", \" LLVM_VERSION_INFO;\n#else\n return PACKAGE_NAME \" version \" PACKAGE_VERSION;\n#endif\n}\n\nLTOCodeGenerator::LTOCodeGenerator()\n : _context(getGlobalContext()),\n _linker(\"LinkTimeOptimizer\", \"ld-temp.o\", _context), _target(NULL),\n _emitDwarfDebugInfo(false), _scopeRestrictionsDone(false),\n _codeModel(LTO_CODEGEN_PIC_MODEL_DYNAMIC),\n _nativeObjectFile(NULL)\n{\n InitializeAllTargets();\n InitializeAllTargetMCs();\n InitializeAllAsmPrinters();\n}\n\nLTOCodeGenerator::~LTOCodeGenerator() {\n delete _target;\n delete _nativeObjectFile;\n\n for (std::vector<char*>::iterator I = _codegenOptions.begin(),\n E = _codegenOptions.end(); I != E; ++I)\n free(*I);\n}\n\nbool LTOCodeGenerator::addModule(LTOModule* mod, std::string& errMsg)\n{\n bool ret = _linker.LinkInModule(mod->getLLVVMModule(), &errMsg);\n\n const std::vector<const char*> &undefs = mod->getAsmUndefinedRefs();\n for (int i = 0, e = undefs.size(); i != e; ++i)\n _asmUndefinedRefs[undefs[i]] = 1;\n\n return ret;\n}\n\n\nbool LTOCodeGenerator::setDebugInfo(lto_debug_model debug, std::string& errMsg)\n{\n switch (debug) {\n case LTO_DEBUG_MODEL_NONE:\n _emitDwarfDebugInfo = false;\n return false;\n\n case LTO_DEBUG_MODEL_DWARF:\n _emitDwarfDebugInfo = true;\n return false;\n }\n llvm_unreachable(\"Unknown debug format!\");\n}\n\n\nbool LTOCodeGenerator::setCodePICModel(lto_codegen_model model,\n std::string& errMsg)\n{\n switch (model) {\n case LTO_CODEGEN_PIC_MODEL_STATIC:\n case LTO_CODEGEN_PIC_MODEL_DYNAMIC:\n case LTO_CODEGEN_PIC_MODEL_DYNAMIC_NO_PIC:\n _codeModel = model;\n return false;\n }\n llvm_unreachable(\"Unknown PIC model!\");\n}\n\nvoid LTOCodeGenerator::setCpu(const char* mCpu)\n{\n _mCpu = mCpu;\n}\n\nvoid LTOCodeGenerator::addMustPreserveSymbol(const char* sym)\n{\n _mustPreserveSymbols[sym] = 1;\n}\n\n\nbool LTOCodeGenerator::writeMergedModules(const char *path,\n std::string &errMsg) {\n if (determineTarget(errMsg))\n return true;\n\n \/\/ mark which symbols can not be internalized\n applyScopeRestrictions();\n\n \/\/ create output file\n std::string ErrInfo;\n tool_output_file Out(path, ErrInfo,\n raw_fd_ostream::F_Binary);\n if (!ErrInfo.empty()) {\n errMsg = \"could not open bitcode file for writing: \";\n errMsg += path;\n return true;\n }\n\n \/\/ write bitcode to it\n WriteBitcodeToFile(_linker.getModule(), Out.os());\n Out.os().close();\n\n if (Out.os().has_error()) {\n errMsg = \"could not write bitcode file: \";\n errMsg += path;\n Out.os().clear_error();\n return true;\n }\n\n Out.keep();\n return false;\n}\n\n\nbool LTOCodeGenerator::compile_to_file(const char** name, std::string& errMsg)\n{\n \/\/ make unique temp .o file to put generated object file\n sys::PathWithStatus uniqueObjPath(\"lto-llvm.o\");\n if ( uniqueObjPath.createTemporaryFileOnDisk(false, &errMsg) ) {\n uniqueObjPath.eraseFromDisk();\n return true;\n }\n sys::RemoveFileOnSignal(uniqueObjPath);\n\n \/\/ generate object file\n bool genResult = false;\n tool_output_file objFile(uniqueObjPath.c_str(), errMsg);\n if (!errMsg.empty())\n return true;\n genResult = this->generateObjectFile(objFile.os(), errMsg);\n objFile.os().close();\n if (objFile.os().has_error()) {\n objFile.os().clear_error();\n return true;\n }\n objFile.keep();\n if ( genResult ) {\n uniqueObjPath.eraseFromDisk();\n return true;\n }\n\n _nativeObjectPath = uniqueObjPath.str();\n *name = _nativeObjectPath.c_str();\n return false;\n}\n\nconst void* LTOCodeGenerator::compile(size_t* length, std::string& errMsg)\n{\n const char *name;\n if (compile_to_file(&name, errMsg))\n return NULL;\n\n \/\/ remove old buffer if compile() called twice\n delete _nativeObjectFile;\n\n \/\/ read .o file into memory buffer\n OwningPtr<MemoryBuffer> BuffPtr;\n if (error_code ec = MemoryBuffer::getFile(name, BuffPtr, -1, false)) {\n errMsg = ec.message();\n return NULL;\n }\n _nativeObjectFile = BuffPtr.take();\n\n \/\/ remove temp files\n sys::Path(_nativeObjectPath).eraseFromDisk();\n\n \/\/ return buffer, unless error\n if ( _nativeObjectFile == NULL )\n return NULL;\n *length = _nativeObjectFile->getBufferSize();\n return _nativeObjectFile->getBufferStart();\n}\n\nbool LTOCodeGenerator::determineTarget(std::string& errMsg)\n{\n if ( _target == NULL ) {\n std::string Triple = _linker.getModule()->getTargetTriple();\n if (Triple.empty())\n Triple = sys::getDefaultTargetTriple();\n\n \/\/ create target machine from info for merged modules\n const Target *march = TargetRegistry::lookupTarget(Triple, errMsg);\n if ( march == NULL )\n return true;\n\n \/\/ The relocation model is actually a static member of TargetMachine\n \/\/ and needs to be set before the TargetMachine is instantiated.\n Reloc::Model RelocModel = Reloc::Default;\n switch( _codeModel ) {\n case LTO_CODEGEN_PIC_MODEL_STATIC:\n RelocModel = Reloc::Static;\n break;\n case LTO_CODEGEN_PIC_MODEL_DYNAMIC:\n RelocModel = Reloc::PIC_;\n break;\n case LTO_CODEGEN_PIC_MODEL_DYNAMIC_NO_PIC:\n RelocModel = Reloc::DynamicNoPIC;\n break;\n }\n\n \/\/ construct LTOModule, hand over ownership of module and target\n SubtargetFeatures Features;\n Features.getDefaultSubtargetFeatures(llvm::Triple(Triple));\n std::string FeatureStr = Features.getString();\n TargetOptions Options;\n _target = march->createTargetMachine(Triple, _mCpu, FeatureStr, Options,\n RelocModel);\n }\n return false;\n}\n\nvoid LTOCodeGenerator::applyRestriction(GlobalValue &GV,\n std::vector<const char*> &mustPreserveList,\n SmallPtrSet<GlobalValue*, 8> &asmUsed,\n Mangler &mangler) {\n SmallString<64> Buffer;\n mangler.getNameWithPrefix(Buffer, &GV, false);\n\n if (GV.isDeclaration())\n return;\n if (_mustPreserveSymbols.count(Buffer))\n mustPreserveList.push_back(GV.getName().data());\n if (_asmUndefinedRefs.count(Buffer))\n asmUsed.insert(&GV);\n}\n\nstatic void findUsedValues(GlobalVariable *LLVMUsed,\n SmallPtrSet<GlobalValue*, 8> &UsedValues) {\n if (LLVMUsed == 0) return;\n\n ConstantArray *Inits = dyn_cast<ConstantArray>(LLVMUsed->getInitializer());\n if (Inits == 0) return;\n\n for (unsigned i = 0, e = Inits->getNumOperands(); i != e; ++i)\n if (GlobalValue *GV =\n dyn_cast<GlobalValue>(Inits->getOperand(i)->stripPointerCasts()))\n UsedValues.insert(GV);\n}\n\nvoid LTOCodeGenerator::applyScopeRestrictions() {\n if (_scopeRestrictionsDone) return;\n Module *mergedModule = _linker.getModule();\n\n \/\/ Start off with a verification pass.\n PassManager passes;\n passes.add(createVerifierPass());\n\n \/\/ mark which symbols can not be internalized\n MCContext Context(*_target->getMCAsmInfo(), *_target->getRegisterInfo(), NULL);\n Mangler mangler(Context, *_target->getTargetData());\n std::vector<const char*> mustPreserveList;\n SmallPtrSet<GlobalValue*, 8> asmUsed;\n\n for (Module::iterator f = mergedModule->begin(),\n e = mergedModule->end(); f != e; ++f)\n applyRestriction(*f, mustPreserveList, asmUsed, mangler);\n for (Module::global_iterator v = mergedModule->global_begin(),\n e = mergedModule->global_end(); v != e; ++v)\n applyRestriction(*v, mustPreserveList, asmUsed, mangler);\n for (Module::alias_iterator a = mergedModule->alias_begin(),\n e = mergedModule->alias_end(); a != e; ++a)\n applyRestriction(*a, mustPreserveList, asmUsed, mangler);\n\n GlobalVariable *LLVMCompilerUsed =\n mergedModule->getGlobalVariable(\"llvm.compiler.used\");\n findUsedValues(LLVMCompilerUsed, asmUsed);\n if (LLVMCompilerUsed)\n LLVMCompilerUsed->eraseFromParent();\n\n llvm::Type *i8PTy = llvm::Type::getInt8PtrTy(_context);\n std::vector<Constant*> asmUsed2;\n for (SmallPtrSet<GlobalValue*, 16>::const_iterator i = asmUsed.begin(),\n e = asmUsed.end(); i !=e; ++i) {\n GlobalValue *GV = *i;\n Constant *c = ConstantExpr::getBitCast(GV, i8PTy);\n asmUsed2.push_back(c);\n }\n\n llvm::ArrayType *ATy = llvm::ArrayType::get(i8PTy, asmUsed2.size());\n LLVMCompilerUsed =\n new llvm::GlobalVariable(*mergedModule, ATy, false,\n llvm::GlobalValue::AppendingLinkage,\n llvm::ConstantArray::get(ATy, asmUsed2),\n \"llvm.compiler.used\");\n\n LLVMCompilerUsed->setSection(\"llvm.metadata\");\n\n passes.add(createInternalizePass(mustPreserveList));\n\n \/\/ apply scope restrictions\n passes.run(*mergedModule);\n\n _scopeRestrictionsDone = true;\n}\n\n\/\/\/ Optimize merged modules using various IPO passes\nbool LTOCodeGenerator::generateObjectFile(raw_ostream &out,\n std::string &errMsg) {\n if ( this->determineTarget(errMsg) )\n return true;\n\n \/\/ mark which symbols can not be internalized\n this->applyScopeRestrictions();\n\n Module* mergedModule = _linker.getModule();\n\n \/\/ if options were requested, set them\n if ( !_codegenOptions.empty() )\n cl::ParseCommandLineOptions(_codegenOptions.size(),\n const_cast<char **>(&_codegenOptions[0]));\n\n \/\/ Instantiate the pass manager to organize the passes.\n PassManager passes;\n\n \/\/ Start off with a verification pass.\n passes.add(createVerifierPass());\n\n \/\/ Add an appropriate TargetData instance for this module...\n passes.add(new TargetData(*_target->getTargetData()));\n\n PassManagerBuilder().populateLTOPassManager(passes, \/*Internalize=*\/ false,\n !DisableInline);\n\n \/\/ Make sure everything is still good.\n passes.add(createVerifierPass());\n\n FunctionPassManager *codeGenPasses = new FunctionPassManager(mergedModule);\n\n codeGenPasses->add(new TargetData(*_target->getTargetData()));\n\n formatted_raw_ostream Out(out);\n\n if (_target->addPassesToEmitFile(*codeGenPasses, Out,\n TargetMachine::CGFT_ObjectFile,\n CodeGenOpt::Aggressive)) {\n errMsg = \"target file type not supported\";\n return true;\n }\n\n \/\/ Run our queue of passes all at once now, efficiently.\n passes.run(*mergedModule);\n\n \/\/ Run the code generator, and write assembly file\n codeGenPasses->doInitialization();\n\n for (Module::iterator\n it = mergedModule->begin(), e = mergedModule->end(); it != e; ++it)\n if (!it->isDeclaration())\n codeGenPasses->run(*it);\n\n codeGenPasses->doFinalization();\n delete codeGenPasses;\n\n return false; \/\/ success\n}\n\n\/\/\/ setCodeGenDebugOptions - Set codegen debugging options to aid in debugging\n\/\/\/ LTO problems.\nvoid LTOCodeGenerator::setCodeGenDebugOptions(const char *options) {\n for (std::pair<StringRef, StringRef> o = getToken(options);\n !o.first.empty(); o = getToken(o.second)) {\n \/\/ ParseCommandLineOptions() expects argv[0] to be program name. Lazily add\n \/\/ that.\n if ( _codegenOptions.empty() )\n _codegenOptions.push_back(strdup(\"libLTO\"));\n _codegenOptions.push_back(strdup(o.first.str().c_str()));\n }\n}\n<commit_msg>Indent according to LLVM's style guide.<commit_after>\/\/===-LTOCodeGenerator.cpp - LLVM Link Time Optimizer ---------------------===\/\/\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 Link Time Optimization library. This library is\n\/\/ intended to be used by linker to optimize code at link time.\n\/\/\n\/\/===----------------------------------------------------------------------===\/\/\n\n#include \"LTOCodeGenerator.h\"\n#include \"LTOModule.h\"\n#include \"llvm\/Constants.h\"\n#include \"llvm\/DerivedTypes.h\"\n#include \"llvm\/Linker.h\"\n#include \"llvm\/LLVMContext.h\"\n#include \"llvm\/Module.h\"\n#include \"llvm\/PassManager.h\"\n#include \"llvm\/Analysis\/Passes.h\"\n#include \"llvm\/Analysis\/Verifier.h\"\n#include \"llvm\/Bitcode\/ReaderWriter.h\"\n#include \"llvm\/Config\/config.h\"\n#include \"llvm\/MC\/MCAsmInfo.h\"\n#include \"llvm\/MC\/MCContext.h\"\n#include \"llvm\/MC\/SubtargetFeature.h\"\n#include \"llvm\/Target\/Mangler.h\"\n#include \"llvm\/Target\/TargetOptions.h\"\n#include \"llvm\/Target\/TargetData.h\"\n#include \"llvm\/Target\/TargetMachine.h\"\n#include \"llvm\/Target\/TargetRegisterInfo.h\"\n#include \"llvm\/Transforms\/IPO.h\"\n#include \"llvm\/Transforms\/IPO\/PassManagerBuilder.h\"\n#include \"llvm\/Support\/CommandLine.h\"\n#include \"llvm\/Support\/ErrorHandling.h\"\n#include \"llvm\/Support\/FormattedStream.h\"\n#include \"llvm\/Support\/MemoryBuffer.h\"\n#include \"llvm\/Support\/SystemUtils.h\"\n#include \"llvm\/Support\/ToolOutputFile.h\"\n#include \"llvm\/Support\/Host.h\"\n#include \"llvm\/Support\/Program.h\"\n#include \"llvm\/Support\/Signals.h\"\n#include \"llvm\/Support\/TargetRegistry.h\"\n#include \"llvm\/Support\/TargetSelect.h\"\n#include \"llvm\/Support\/system_error.h\"\n#include \"llvm\/ADT\/StringExtras.h\"\n#include \"llvm\/ADT\/Triple.h\"\n#include <cstdlib>\n#include <unistd.h>\n#include <fcntl.h>\nusing namespace llvm;\n\nstatic cl::opt<bool> DisableInline(\"disable-inlining\",\n cl::desc(\"Do not run the inliner pass\"));\n\nconst char* LTOCodeGenerator::getVersionString() {\n#ifdef LLVM_VERSION_INFO\n return PACKAGE_NAME \" version \" PACKAGE_VERSION \", \" LLVM_VERSION_INFO;\n#else\n return PACKAGE_NAME \" version \" PACKAGE_VERSION;\n#endif\n}\n\nLTOCodeGenerator::LTOCodeGenerator()\n : _context(getGlobalContext()),\n _linker(\"LinkTimeOptimizer\", \"ld-temp.o\", _context), _target(NULL),\n _emitDwarfDebugInfo(false), _scopeRestrictionsDone(false),\n _codeModel(LTO_CODEGEN_PIC_MODEL_DYNAMIC),\n _nativeObjectFile(NULL) {\n InitializeAllTargets();\n InitializeAllTargetMCs();\n InitializeAllAsmPrinters();\n}\n\nLTOCodeGenerator::~LTOCodeGenerator() {\n delete _target;\n delete _nativeObjectFile;\n\n for (std::vector<char*>::iterator I = _codegenOptions.begin(),\n E = _codegenOptions.end(); I != E; ++I)\n free(*I);\n}\n\nbool LTOCodeGenerator::addModule(LTOModule* mod, std::string& errMsg) {\n bool ret = _linker.LinkInModule(mod->getLLVVMModule(), &errMsg);\n\n const std::vector<const char*> &undefs = mod->getAsmUndefinedRefs();\n for (int i = 0, e = undefs.size(); i != e; ++i)\n _asmUndefinedRefs[undefs[i]] = 1;\n\n return ret;\n}\n\nbool LTOCodeGenerator::setDebugInfo(lto_debug_model debug,\n std::string& errMsg) {\n switch (debug) {\n case LTO_DEBUG_MODEL_NONE:\n _emitDwarfDebugInfo = false;\n return false;\n\n case LTO_DEBUG_MODEL_DWARF:\n _emitDwarfDebugInfo = true;\n return false;\n }\n llvm_unreachable(\"Unknown debug format!\");\n}\n\nbool LTOCodeGenerator::setCodePICModel(lto_codegen_model model,\n std::string& errMsg) {\n switch (model) {\n case LTO_CODEGEN_PIC_MODEL_STATIC:\n case LTO_CODEGEN_PIC_MODEL_DYNAMIC:\n case LTO_CODEGEN_PIC_MODEL_DYNAMIC_NO_PIC:\n _codeModel = model;\n return false;\n }\n llvm_unreachable(\"Unknown PIC model!\");\n}\n\nvoid LTOCodeGenerator::setCpu(const char* mCpu) {\n _mCpu = mCpu;\n}\n\nvoid LTOCodeGenerator::addMustPreserveSymbol(const char* sym) {\n _mustPreserveSymbols[sym] = 1;\n}\n\nbool LTOCodeGenerator::writeMergedModules(const char *path,\n std::string &errMsg) {\n if (determineTarget(errMsg))\n return true;\n\n \/\/ mark which symbols can not be internalized\n applyScopeRestrictions();\n\n \/\/ create output file\n std::string ErrInfo;\n tool_output_file Out(path, ErrInfo,\n raw_fd_ostream::F_Binary);\n if (!ErrInfo.empty()) {\n errMsg = \"could not open bitcode file for writing: \";\n errMsg += path;\n return true;\n }\n\n \/\/ write bitcode to it\n WriteBitcodeToFile(_linker.getModule(), Out.os());\n Out.os().close();\n\n if (Out.os().has_error()) {\n errMsg = \"could not write bitcode file: \";\n errMsg += path;\n Out.os().clear_error();\n return true;\n }\n\n Out.keep();\n return false;\n}\n\nbool LTOCodeGenerator::compile_to_file(const char** name, std::string& errMsg) {\n \/\/ make unique temp .o file to put generated object file\n sys::PathWithStatus uniqueObjPath(\"lto-llvm.o\");\n if ( uniqueObjPath.createTemporaryFileOnDisk(false, &errMsg) ) {\n uniqueObjPath.eraseFromDisk();\n return true;\n }\n sys::RemoveFileOnSignal(uniqueObjPath);\n\n \/\/ generate object file\n bool genResult = false;\n tool_output_file objFile(uniqueObjPath.c_str(), errMsg);\n if (!errMsg.empty())\n return true;\n\n genResult = this->generateObjectFile(objFile.os(), errMsg);\n objFile.os().close();\n if (objFile.os().has_error()) {\n objFile.os().clear_error();\n return true;\n }\n\n objFile.keep();\n if ( genResult ) {\n uniqueObjPath.eraseFromDisk();\n return true;\n }\n\n _nativeObjectPath = uniqueObjPath.str();\n *name = _nativeObjectPath.c_str();\n return false;\n}\n\nconst void* LTOCodeGenerator::compile(size_t* length, std::string& errMsg) {\n const char *name;\n if (compile_to_file(&name, errMsg))\n return NULL;\n\n \/\/ remove old buffer if compile() called twice\n delete _nativeObjectFile;\n\n \/\/ read .o file into memory buffer\n OwningPtr<MemoryBuffer> BuffPtr;\n if (error_code ec = MemoryBuffer::getFile(name, BuffPtr, -1, false)) {\n errMsg = ec.message();\n return NULL;\n }\n _nativeObjectFile = BuffPtr.take();\n\n \/\/ remove temp files\n sys::Path(_nativeObjectPath).eraseFromDisk();\n\n \/\/ return buffer, unless error\n if ( _nativeObjectFile == NULL )\n return NULL;\n *length = _nativeObjectFile->getBufferSize();\n return _nativeObjectFile->getBufferStart();\n}\n\nbool LTOCodeGenerator::determineTarget(std::string& errMsg) {\n if ( _target == NULL ) {\n std::string Triple = _linker.getModule()->getTargetTriple();\n if (Triple.empty())\n Triple = sys::getDefaultTargetTriple();\n\n \/\/ create target machine from info for merged modules\n const Target *march = TargetRegistry::lookupTarget(Triple, errMsg);\n if ( march == NULL )\n return true;\n\n \/\/ The relocation model is actually a static member of TargetMachine and\n \/\/ needs to be set before the TargetMachine is instantiated.\n Reloc::Model RelocModel = Reloc::Default;\n switch( _codeModel ) {\n case LTO_CODEGEN_PIC_MODEL_STATIC:\n RelocModel = Reloc::Static;\n break;\n case LTO_CODEGEN_PIC_MODEL_DYNAMIC:\n RelocModel = Reloc::PIC_;\n break;\n case LTO_CODEGEN_PIC_MODEL_DYNAMIC_NO_PIC:\n RelocModel = Reloc::DynamicNoPIC;\n break;\n }\n\n \/\/ construct LTOModule, hand over ownership of module and target\n SubtargetFeatures Features;\n Features.getDefaultSubtargetFeatures(llvm::Triple(Triple));\n std::string FeatureStr = Features.getString();\n TargetOptions Options;\n _target = march->createTargetMachine(Triple, _mCpu, FeatureStr, Options,\n RelocModel);\n }\n return false;\n}\n\nvoid LTOCodeGenerator::\napplyRestriction(GlobalValue &GV,\n std::vector<const char*> &mustPreserveList,\n SmallPtrSet<GlobalValue*, 8> &asmUsed,\n Mangler &mangler) {\n SmallString<64> Buffer;\n mangler.getNameWithPrefix(Buffer, &GV, false);\n\n if (GV.isDeclaration())\n return;\n if (_mustPreserveSymbols.count(Buffer))\n mustPreserveList.push_back(GV.getName().data());\n if (_asmUndefinedRefs.count(Buffer))\n asmUsed.insert(&GV);\n}\n\nstatic void findUsedValues(GlobalVariable *LLVMUsed,\n SmallPtrSet<GlobalValue*, 8> &UsedValues) {\n if (LLVMUsed == 0) return;\n\n ConstantArray *Inits = dyn_cast<ConstantArray>(LLVMUsed->getInitializer());\n if (Inits == 0) return;\n\n for (unsigned i = 0, e = Inits->getNumOperands(); i != e; ++i)\n if (GlobalValue *GV =\n dyn_cast<GlobalValue>(Inits->getOperand(i)->stripPointerCasts()))\n UsedValues.insert(GV);\n}\n\nvoid LTOCodeGenerator::applyScopeRestrictions() {\n if (_scopeRestrictionsDone) return;\n Module *mergedModule = _linker.getModule();\n\n \/\/ Start off with a verification pass.\n PassManager passes;\n passes.add(createVerifierPass());\n\n \/\/ mark which symbols can not be internalized\n MCContext Context(*_target->getMCAsmInfo(), *_target->getRegisterInfo(),NULL);\n Mangler mangler(Context, *_target->getTargetData());\n std::vector<const char*> mustPreserveList;\n SmallPtrSet<GlobalValue*, 8> asmUsed;\n\n for (Module::iterator f = mergedModule->begin(),\n e = mergedModule->end(); f != e; ++f)\n applyRestriction(*f, mustPreserveList, asmUsed, mangler);\n for (Module::global_iterator v = mergedModule->global_begin(),\n e = mergedModule->global_end(); v != e; ++v)\n applyRestriction(*v, mustPreserveList, asmUsed, mangler);\n for (Module::alias_iterator a = mergedModule->alias_begin(),\n e = mergedModule->alias_end(); a != e; ++a)\n applyRestriction(*a, mustPreserveList, asmUsed, mangler);\n\n GlobalVariable *LLVMCompilerUsed =\n mergedModule->getGlobalVariable(\"llvm.compiler.used\");\n findUsedValues(LLVMCompilerUsed, asmUsed);\n if (LLVMCompilerUsed)\n LLVMCompilerUsed->eraseFromParent();\n\n llvm::Type *i8PTy = llvm::Type::getInt8PtrTy(_context);\n std::vector<Constant*> asmUsed2;\n for (SmallPtrSet<GlobalValue*, 16>::const_iterator i = asmUsed.begin(),\n e = asmUsed.end(); i !=e; ++i) {\n GlobalValue *GV = *i;\n Constant *c = ConstantExpr::getBitCast(GV, i8PTy);\n asmUsed2.push_back(c);\n }\n\n llvm::ArrayType *ATy = llvm::ArrayType::get(i8PTy, asmUsed2.size());\n LLVMCompilerUsed =\n new llvm::GlobalVariable(*mergedModule, ATy, false,\n llvm::GlobalValue::AppendingLinkage,\n llvm::ConstantArray::get(ATy, asmUsed2),\n \"llvm.compiler.used\");\n\n LLVMCompilerUsed->setSection(\"llvm.metadata\");\n\n passes.add(createInternalizePass(mustPreserveList));\n\n \/\/ apply scope restrictions\n passes.run(*mergedModule);\n\n _scopeRestrictionsDone = true;\n}\n\n\/\/\/ Optimize merged modules using various IPO passes\nbool LTOCodeGenerator::generateObjectFile(raw_ostream &out,\n std::string &errMsg) {\n if ( this->determineTarget(errMsg) )\n return true;\n\n \/\/ mark which symbols can not be internalized\n this->applyScopeRestrictions();\n\n Module* mergedModule = _linker.getModule();\n\n \/\/ if options were requested, set them\n if ( !_codegenOptions.empty() )\n cl::ParseCommandLineOptions(_codegenOptions.size(),\n const_cast<char **>(&_codegenOptions[0]));\n\n \/\/ Instantiate the pass manager to organize the passes.\n PassManager passes;\n\n \/\/ Start off with a verification pass.\n passes.add(createVerifierPass());\n\n \/\/ Add an appropriate TargetData instance for this module...\n passes.add(new TargetData(*_target->getTargetData()));\n\n PassManagerBuilder().populateLTOPassManager(passes, \/*Internalize=*\/ false,\n !DisableInline);\n\n \/\/ Make sure everything is still good.\n passes.add(createVerifierPass());\n\n FunctionPassManager *codeGenPasses = new FunctionPassManager(mergedModule);\n\n codeGenPasses->add(new TargetData(*_target->getTargetData()));\n\n formatted_raw_ostream Out(out);\n\n if (_target->addPassesToEmitFile(*codeGenPasses, Out,\n TargetMachine::CGFT_ObjectFile,\n CodeGenOpt::Aggressive)) {\n errMsg = \"target file type not supported\";\n return true;\n }\n\n \/\/ Run our queue of passes all at once now, efficiently.\n passes.run(*mergedModule);\n\n \/\/ Run the code generator, and write assembly file\n codeGenPasses->doInitialization();\n\n for (Module::iterator\n it = mergedModule->begin(), e = mergedModule->end(); it != e; ++it)\n if (!it->isDeclaration())\n codeGenPasses->run(*it);\n\n codeGenPasses->doFinalization();\n delete codeGenPasses;\n\n return false; \/\/ success\n}\n\n\/\/\/ setCodeGenDebugOptions - Set codegen debugging options to aid in debugging\n\/\/\/ LTO problems.\nvoid LTOCodeGenerator::setCodeGenDebugOptions(const char *options) {\n for (std::pair<StringRef, StringRef> o = getToken(options);\n !o.first.empty(); o = getToken(o.second)) {\n \/\/ ParseCommandLineOptions() expects argv[0] to be program name. Lazily add\n \/\/ that.\n if ( _codegenOptions.empty() )\n _codegenOptions.push_back(strdup(\"libLTO\"));\n _codegenOptions.push_back(strdup(o.first.str().c_str()));\n }\n}\n<|endoftext|>"} {"text":"<commit_before>\/*\n * Copyright 2012 Google Inc.\n *\n * Use of this source code is governed by a BSD-style license that can be\n * found in the LICENSE file.\n *\/\n\n#include \"CopyTilesRenderer.h\"\n#include \"SkBitmap.h\"\n#include \"SkDevice.h\"\n#include \"SkCommandLineFlags.h\"\n#include \"SkGraphics.h\"\n#include \"SkImageDecoder.h\"\n#include \"SkImageEncoder.h\"\n#include \"SkMath.h\"\n#include \"SkOSFile.h\"\n#include \"SkPicture.h\"\n#include \"SkStream.h\"\n#include \"SkString.h\"\n#include \"PictureRenderer.h\"\n#include \"PictureRenderingFlags.h\"\n#include \"picture_utils.h\"\n\n\/\/ Flags used by this file, alphabetically:\nDEFINE_int32(clone, 0, \"Clone the picture n times before rendering.\");\nDECLARE_bool(deferImageDecoding);\nDEFINE_int32(maxComponentDiff, 256, \"Maximum diff on a component, 0 - 256. Components that differ \"\n \"by more than this amount are considered errors, though all diffs are reported. \"\n \"Requires --validate.\");\nDECLARE_string(readPath);\nDEFINE_string2(writePath, w, \"\", \"Directory to write the rendered images.\");\nDEFINE_bool(writeWholeImage, false, \"In tile mode, write the entire rendered image to a \"\n \"file, instead of an image for each tile.\");\nDEFINE_bool(validate, false, \"Verify that the rendered image contains the same pixels as \"\n \"the picture rendered in simple mode. When used in conjunction with --bbh, results \"\n \"are validated against the picture rendered in the same mode, but without the bbh.\");\n\nstatic void make_output_filepath(SkString* path, const SkString& dir,\n const SkString& name) {\n sk_tools::make_filepath(path, dir, name);\n \/\/ Remove \".skp\"\n path->remove(path->size() - 4, 4);\n}\n\n\/\/ Defined in PictureRenderingFlags.cpp\nextern bool lazy_decode_bitmap(const void* buffer, size_t size, SkBitmap* bitmap);\n\nstatic bool render_picture(const SkString& inputPath, const SkString* outputDir,\n sk_tools::PictureRenderer& renderer,\n SkBitmap** out) {\n SkString inputFilename;\n sk_tools::get_basename(&inputFilename, inputPath);\n\n SkFILEStream inputStream;\n inputStream.setPath(inputPath.c_str());\n if (!inputStream.isValid()) {\n SkDebugf(\"Could not open file %s\\n\", inputPath.c_str());\n return false;\n }\n\n bool success = false;\n SkPicture* picture;\n if (FLAGS_deferImageDecoding) {\n picture = SkNEW_ARGS(SkPicture, (&inputStream, &success, &lazy_decode_bitmap));\n } else {\n picture = SkNEW_ARGS(SkPicture, (&inputStream, &success, &SkImageDecoder::DecodeMemory));\n }\n if (!success) {\n SkDebugf(\"Could not read an SkPicture from %s\\n\", inputPath.c_str());\n return false;\n }\n\n for (int i = 0; i < FLAGS_clone; ++i) {\n SkPicture* clone = picture->clone();\n SkDELETE(picture);\n picture = clone;\n }\n\n SkDebugf(\"drawing... [%i %i] %s\\n\", picture->width(), picture->height(),\n inputPath.c_str());\n\n renderer.init(picture);\n renderer.setup();\n\n SkString* outputPath = NULL;\n if (NULL != outputDir && outputDir->size() > 0) {\n outputPath = SkNEW(SkString);\n make_output_filepath(outputPath, *outputDir, inputFilename);\n }\n\n success = renderer.render(outputPath, out);\n if (outputPath) {\n if (!success) {\n SkDebugf(\"Could not write to file %s\\n\", outputPath->c_str());\n }\n SkDELETE(outputPath);\n }\n\n renderer.end();\n\n SkDELETE(picture);\n return success;\n}\n\nstatic inline int getByte(uint32_t value, int index) {\n SkASSERT(0 <= index && index < 4);\n return (value >> (index * 8)) & 0xFF;\n}\n\nstatic int MaxByteDiff(uint32_t v1, uint32_t v2) {\n return SkMax32(SkMax32(abs(getByte(v1, 0) - getByte(v2, 0)), abs(getByte(v1, 1) - getByte(v2, 1))),\n SkMax32(abs(getByte(v1, 2) - getByte(v2, 2)), abs(getByte(v1, 3) - getByte(v2, 3))));\n}\n\nnamespace {\nclass AutoRestoreBbhType {\npublic:\n AutoRestoreBbhType() {\n fRenderer = NULL;\n fSavedBbhType = sk_tools::PictureRenderer::kNone_BBoxHierarchyType;\n }\n\n void set(sk_tools::PictureRenderer* renderer,\n sk_tools::PictureRenderer::BBoxHierarchyType bbhType) {\n fRenderer = renderer;\n fSavedBbhType = renderer->getBBoxHierarchyType();\n renderer->setBBoxHierarchyType(bbhType);\n }\n\n ~AutoRestoreBbhType() {\n if (NULL != fRenderer) {\n fRenderer->setBBoxHierarchyType(fSavedBbhType);\n }\n }\n\nprivate:\n sk_tools::PictureRenderer* fRenderer;\n sk_tools::PictureRenderer::BBoxHierarchyType fSavedBbhType;\n};\n}\n\nstatic bool render_picture(const SkString& inputPath, const SkString* outputDir,\n sk_tools::PictureRenderer& renderer) {\n int diffs[256] = {0};\n SkBitmap* bitmap = NULL;\n bool success = render_picture(inputPath,\n FLAGS_writeWholeImage ? NULL : outputDir,\n renderer,\n FLAGS_validate || FLAGS_writeWholeImage ? &bitmap : NULL);\n\n if (!success || ((FLAGS_validate || FLAGS_writeWholeImage) && bitmap == NULL)) {\n SkDebugf(\"Failed to draw the picture.\\n\");\n SkDELETE(bitmap);\n return false;\n }\n\n if (FLAGS_validate) {\n SkBitmap* referenceBitmap = NULL;\n sk_tools::PictureRenderer* referenceRenderer;\n \/\/ If the renderer uses a BBoxHierarchy, then the reference renderer\n \/\/ will be the same renderer, without the bbh.\n AutoRestoreBbhType arbbh;\n if (sk_tools::PictureRenderer::kNone_BBoxHierarchyType !=\n renderer.getBBoxHierarchyType()) {\n referenceRenderer = &renderer;\n referenceRenderer->ref(); \/\/ to match auto unref below\n arbbh.set(referenceRenderer, sk_tools::PictureRenderer::kNone_BBoxHierarchyType);\n } else {\n referenceRenderer = SkNEW(sk_tools::SimplePictureRenderer);\n }\n SkAutoTUnref<sk_tools::PictureRenderer> aurReferenceRenderer(referenceRenderer);\n\n success = render_picture(inputPath, NULL, *referenceRenderer,\n &referenceBitmap);\n\n if (!success || NULL == referenceBitmap || NULL == referenceBitmap->getPixels()) {\n SkDebugf(\"Failed to draw the reference picture.\\n\");\n SkDELETE(bitmap);\n SkDELETE(referenceBitmap);\n return false;\n }\n\n if (success && (bitmap->width() != referenceBitmap->width())) {\n SkDebugf(\"Expected image width: %i, actual image width %i.\\n\",\n referenceBitmap->width(), bitmap->width());\n SkDELETE(bitmap);\n SkDELETE(referenceBitmap);\n return false;\n }\n if (success && (bitmap->height() != referenceBitmap->height())) {\n SkDebugf(\"Expected image height: %i, actual image height %i\",\n referenceBitmap->height(), bitmap->height());\n SkDELETE(bitmap);\n SkDELETE(referenceBitmap);\n return false;\n }\n\n for (int y = 0; success && y < bitmap->height(); y++) {\n for (int x = 0; success && x < bitmap->width(); x++) {\n int diff = MaxByteDiff(*referenceBitmap->getAddr32(x, y),\n *bitmap->getAddr32(x, y));\n SkASSERT(diff >= 0 && diff <= 255);\n diffs[diff]++;\n\n if (diff > FLAGS_maxComponentDiff) {\n SkDebugf(\"Expected pixel at (%i %i) exceedds maximum \"\n \"component diff of %i: 0x%x, actual 0x%x\\n\",\n x, y, FLAGS_maxComponentDiff,\n *referenceBitmap->getAddr32(x, y),\n *bitmap->getAddr32(x, y));\n SkDELETE(bitmap);\n SkDELETE(referenceBitmap);\n return false;\n }\n }\n }\n SkDELETE(referenceBitmap);\n\n for (int i = 1; i <= 255; ++i) {\n if(diffs[i] > 0) {\n SkDebugf(\"Number of pixels with max diff of %i is %i\\n\", i, diffs[i]);\n }\n }\n }\n\n if (FLAGS_writeWholeImage) {\n sk_tools::force_all_opaque(*bitmap);\n if (NULL != outputDir && FLAGS_writeWholeImage) {\n SkString inputFilename;\n sk_tools::get_basename(&inputFilename, inputPath);\n SkString outputPath;\n make_output_filepath(&outputPath, *outputDir, inputFilename);\n outputPath.append(\".png\");\n if (!SkImageEncoder::EncodeFile(outputPath.c_str(), *bitmap,\n SkImageEncoder::kPNG_Type, 100)) {\n SkDebugf(\"Failed to draw the picture.\\n\");\n success = false;\n }\n }\n }\n SkDELETE(bitmap);\n\n return success;\n}\n\n\nstatic int process_input(const char* input, const SkString* outputDir,\n sk_tools::PictureRenderer& renderer) {\n SkOSFile::Iter iter(input, \"skp\");\n SkString inputFilename;\n int failures = 0;\n SkDebugf(\"process_input, %s\\n\", input);\n if (iter.next(&inputFilename)) {\n do {\n SkString inputPath;\n SkString inputAsSkString(input);\n sk_tools::make_filepath(&inputPath, inputAsSkString, inputFilename);\n if (!render_picture(inputPath, outputDir, renderer)) {\n ++failures;\n }\n } while(iter.next(&inputFilename));\n } else if (SkStrEndsWith(input, \".skp\")) {\n SkString inputPath(input);\n if (!render_picture(inputPath, outputDir, renderer)) {\n ++failures;\n }\n } else {\n SkString warning;\n warning.printf(\"Warning: skipping %s\\n\", input);\n SkDebugf(warning.c_str());\n }\n return failures;\n}\n\nint tool_main(int argc, char** argv);\nint tool_main(int argc, char** argv) {\n SkCommandLineFlags::SetUsage(\"Render .skp files.\");\n SkCommandLineFlags::Parse(argc, argv);\n\n if (FLAGS_readPath.isEmpty()) {\n SkDebugf(\".skp files or directories are required.\\n\");\n exit(-1);\n }\n\n if (FLAGS_maxComponentDiff < 0 || FLAGS_maxComponentDiff > 256) {\n SkDebugf(\"--maxComponentDiff must be between 0 and 256\\n\");\n exit(-1);\n }\n\n if (FLAGS_maxComponentDiff != 256 && !FLAGS_validate) {\n SkDebugf(\"--maxComponentDiff requires --validate\\n\");\n exit(-1);\n }\n\n if (FLAGS_clone < 0) {\n SkDebugf(\"--clone must be >= 0. Was %i\\n\", FLAGS_clone);\n exit(-1);\n }\n\n SkString errorString;\n SkAutoTUnref<sk_tools::PictureRenderer> renderer(parseRenderer(errorString,\n kRender_PictureTool));\n if (errorString.size() > 0) {\n SkDebugf(\"%s\\n\", errorString.c_str());\n }\n\n if (renderer.get() == NULL) {\n exit(-1);\n }\n\n SkAutoGraphics ag;\n\n SkString outputDir;\n if (FLAGS_writePath.count() == 1) {\n outputDir.set(FLAGS_writePath[0]);\n }\n\n int failures = 0;\n for (int i = 0; i < FLAGS_readPath.count(); i ++) {\n failures += process_input(FLAGS_readPath[i], &outputDir, *renderer.get());\n }\n if (failures != 0) {\n SkDebugf(\"Failed to render %i pictures.\\n\", failures);\n return 1;\n }\n#if SK_SUPPORT_GPU\n#if GR_CACHE_STATS\n if (renderer->isUsingGpuDevice()) {\n GrContext* ctx = renderer->getGrContext();\n\n ctx->printCacheStats();\n }\n#endif\n#endif\n return 0;\n}\n\n#if !defined SK_BUILD_FOR_IOS\nint main(int argc, char * const argv[]) {\n return tool_main(argc, (char**) argv);\n}\n#endif\n<commit_msg>Add a new mode to render_pictures.<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 \"CopyTilesRenderer.h\"\n#include \"SkBitmap.h\"\n#include \"SkDevice.h\"\n#include \"SkCommandLineFlags.h\"\n#include \"SkGraphics.h\"\n#include \"SkImageDecoder.h\"\n#include \"SkImageEncoder.h\"\n#include \"SkMath.h\"\n#include \"SkOSFile.h\"\n#include \"SkPicture.h\"\n#include \"SkStream.h\"\n#include \"SkString.h\"\n#include \"PictureRenderer.h\"\n#include \"PictureRenderingFlags.h\"\n#include \"picture_utils.h\"\n\n\/\/ Flags used by this file, alphabetically:\nDEFINE_int32(clone, 0, \"Clone the picture n times before rendering.\");\nDECLARE_bool(deferImageDecoding);\nDEFINE_int32(maxComponentDiff, 256, \"Maximum diff on a component, 0 - 256. Components that differ \"\n \"by more than this amount are considered errors, though all diffs are reported. \"\n \"Requires --validate.\");\nDECLARE_string(readPath);\nDEFINE_bool(writeEncodedImages, false, \"Any time the skp contains an encoded image, write it to a \"\n \"file rather than decoding it. Requires writePath to be set. Skips drawing the full \"\n \"skp to a file. Not compatible with deferImageDecoding.\");\nDEFINE_string2(writePath, w, \"\", \"Directory to write the rendered images.\");\nDEFINE_bool(writeWholeImage, false, \"In tile mode, write the entire rendered image to a \"\n \"file, instead of an image for each tile.\");\nDEFINE_bool(validate, false, \"Verify that the rendered image contains the same pixels as \"\n \"the picture rendered in simple mode. When used in conjunction with --bbh, results \"\n \"are validated against the picture rendered in the same mode, but without the bbh.\");\n\nstatic void make_output_filepath(SkString* path, const SkString& dir,\n const SkString& name) {\n sk_tools::make_filepath(path, dir, name);\n \/\/ Remove \".skp\"\n path->remove(path->size() - 4, 4);\n}\n\n\/\/ Defined in PictureRenderingFlags.cpp\nextern bool lazy_decode_bitmap(const void* buffer, size_t size, SkBitmap* bitmap);\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n\/**\n * Table for translating from format of data to a suffix.\n *\/\nstruct Format {\n SkImageDecoder::Format fFormat;\n const char* fSuffix;\n};\nstatic const Format gFormats[] = {\n { SkImageDecoder::kBMP_Format, \".bmp\" },\n { SkImageDecoder::kGIF_Format, \".gif\" },\n { SkImageDecoder::kICO_Format, \".ico\" },\n { SkImageDecoder::kJPEG_Format, \".jpg\" },\n { SkImageDecoder::kPNG_Format, \".png\" },\n { SkImageDecoder::kWBMP_Format, \".wbmp\" },\n { SkImageDecoder::kWEBP_Format, \".webp\" },\n { SkImageDecoder::kUnknown_Format, \"\" },\n};\n\n\/**\n * Get an appropriate suffix for an image format.\n *\/\nstatic const char* get_suffix_from_format(SkImageDecoder::Format format) {\n for (size_t i = 0; i < SK_ARRAY_COUNT(gFormats); i++) {\n if (gFormats[i].fFormat == format) {\n return gFormats[i].fSuffix;\n }\n }\n return \"\";\n}\n\n\/**\n * Base name for an image file created from the encoded data in an skp.\n *\/\nstatic SkString gInputFileName;\n\n\/**\n * Number to be appended to the image file name so that it is unique.\n *\/\nstatic uint32_t gImageNo;\n\n\/**\n * Set up the name for writing encoded data to a file.\n * Sets gInputFileName to name, minus any extension \".*\"\n * Sets gImageNo to 0, so images from file \"X.skp\" will\n * look like \"X_<gImageNo>.<suffix>\", beginning with 0\n * for each new skp.\n *\/\nstatic void reset_image_file_base_name(const SkString& name) {\n gImageNo = 0;\n \/\/ Remove \".skp\"\n const char* cName = name.c_str();\n const char* dot = strrchr(cName, '.');\n if (dot != NULL) {\n gInputFileName.set(cName, dot - cName);\n } else {\n gInputFileName.set(name);\n }\n}\n\n\/**\n * Write the raw encoded bitmap data to a file.\n *\/\nstatic bool write_image_to_file(const void* buffer, size_t size, SkBitmap* bitmap) {\n SkASSERT(!FLAGS_writePath.isEmpty());\n SkMemoryStream memStream(buffer, size);\n SkString outPath;\n SkImageDecoder::Format format = SkImageDecoder::GetStreamFormat(&memStream);\n SkString name = SkStringPrintf(\"%s_%d%s\", gInputFileName.c_str(), gImageNo++,\n get_suffix_from_format(format));\n SkString dir(FLAGS_writePath[0]);\n sk_tools::make_filepath(&outPath, dir, name);\n SkFILEWStream fileStream(outPath.c_str());\n if (!(fileStream.isValid() && fileStream.write(buffer, size))) {\n SkDebugf(\"Failed to write encoded data to \\\"%s\\\"\\n\", outPath.c_str());\n }\n \/\/ Put in a dummy bitmap.\n return SkImageDecoder::DecodeStream(&memStream, bitmap, SkBitmap::kNo_Config,\n SkImageDecoder::kDecodeBounds_Mode);\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nstatic bool render_picture(const SkString& inputPath, const SkString* outputDir,\n sk_tools::PictureRenderer& renderer,\n SkBitmap** out) {\n SkString inputFilename;\n sk_tools::get_basename(&inputFilename, inputPath);\n\n SkFILEStream inputStream;\n inputStream.setPath(inputPath.c_str());\n if (!inputStream.isValid()) {\n SkDebugf(\"Could not open file %s\\n\", inputPath.c_str());\n return false;\n }\n\n bool success = false;\n SkPicture* picture;\n if (FLAGS_deferImageDecoding) {\n picture = SkNEW_ARGS(SkPicture, (&inputStream, &success, &lazy_decode_bitmap));\n } else if (FLAGS_writeEncodedImages) {\n SkASSERT(!FLAGS_writePath.isEmpty());\n reset_image_file_base_name(inputFilename);\n picture = SkNEW_ARGS(SkPicture, (&inputStream, &success, &write_image_to_file));\n } else {\n picture = SkNEW_ARGS(SkPicture, (&inputStream, &success, &SkImageDecoder::DecodeMemory));\n }\n\n if (!success) {\n SkDebugf(\"Could not read an SkPicture from %s\\n\", inputPath.c_str());\n return false;\n }\n\n for (int i = 0; i < FLAGS_clone; ++i) {\n SkPicture* clone = picture->clone();\n SkDELETE(picture);\n picture = clone;\n }\n\n SkDebugf(\"drawing... [%i %i] %s\\n\", picture->width(), picture->height(),\n inputPath.c_str());\n\n renderer.init(picture);\n renderer.setup();\n\n SkString* outputPath = NULL;\n if (NULL != outputDir && outputDir->size() > 0 && !FLAGS_writeEncodedImages) {\n outputPath = SkNEW(SkString);\n make_output_filepath(outputPath, *outputDir, inputFilename);\n }\n\n success = renderer.render(outputPath, out);\n if (outputPath) {\n if (!success) {\n SkDebugf(\"Could not write to file %s\\n\", outputPath->c_str());\n }\n SkDELETE(outputPath);\n }\n\n renderer.end();\n\n SkDELETE(picture);\n return success;\n}\n\nstatic inline int getByte(uint32_t value, int index) {\n SkASSERT(0 <= index && index < 4);\n return (value >> (index * 8)) & 0xFF;\n}\n\nstatic int MaxByteDiff(uint32_t v1, uint32_t v2) {\n return SkMax32(SkMax32(abs(getByte(v1, 0) - getByte(v2, 0)), abs(getByte(v1, 1) - getByte(v2, 1))),\n SkMax32(abs(getByte(v1, 2) - getByte(v2, 2)), abs(getByte(v1, 3) - getByte(v2, 3))));\n}\n\nnamespace {\nclass AutoRestoreBbhType {\npublic:\n AutoRestoreBbhType() {\n fRenderer = NULL;\n fSavedBbhType = sk_tools::PictureRenderer::kNone_BBoxHierarchyType;\n }\n\n void set(sk_tools::PictureRenderer* renderer,\n sk_tools::PictureRenderer::BBoxHierarchyType bbhType) {\n fRenderer = renderer;\n fSavedBbhType = renderer->getBBoxHierarchyType();\n renderer->setBBoxHierarchyType(bbhType);\n }\n\n ~AutoRestoreBbhType() {\n if (NULL != fRenderer) {\n fRenderer->setBBoxHierarchyType(fSavedBbhType);\n }\n }\n\nprivate:\n sk_tools::PictureRenderer* fRenderer;\n sk_tools::PictureRenderer::BBoxHierarchyType fSavedBbhType;\n};\n}\n\nstatic bool render_picture(const SkString& inputPath, const SkString* outputDir,\n sk_tools::PictureRenderer& renderer) {\n int diffs[256] = {0};\n SkBitmap* bitmap = NULL;\n bool success = render_picture(inputPath,\n FLAGS_writeWholeImage ? NULL : outputDir,\n renderer,\n FLAGS_validate || FLAGS_writeWholeImage ? &bitmap : NULL);\n\n if (!success || ((FLAGS_validate || FLAGS_writeWholeImage) && bitmap == NULL)) {\n SkDebugf(\"Failed to draw the picture.\\n\");\n SkDELETE(bitmap);\n return false;\n }\n\n if (FLAGS_validate) {\n SkBitmap* referenceBitmap = NULL;\n sk_tools::PictureRenderer* referenceRenderer;\n \/\/ If the renderer uses a BBoxHierarchy, then the reference renderer\n \/\/ will be the same renderer, without the bbh.\n AutoRestoreBbhType arbbh;\n if (sk_tools::PictureRenderer::kNone_BBoxHierarchyType !=\n renderer.getBBoxHierarchyType()) {\n referenceRenderer = &renderer;\n referenceRenderer->ref(); \/\/ to match auto unref below\n arbbh.set(referenceRenderer, sk_tools::PictureRenderer::kNone_BBoxHierarchyType);\n } else {\n referenceRenderer = SkNEW(sk_tools::SimplePictureRenderer);\n }\n SkAutoTUnref<sk_tools::PictureRenderer> aurReferenceRenderer(referenceRenderer);\n\n success = render_picture(inputPath, NULL, *referenceRenderer,\n &referenceBitmap);\n\n if (!success || NULL == referenceBitmap || NULL == referenceBitmap->getPixels()) {\n SkDebugf(\"Failed to draw the reference picture.\\n\");\n SkDELETE(bitmap);\n SkDELETE(referenceBitmap);\n return false;\n }\n\n if (success && (bitmap->width() != referenceBitmap->width())) {\n SkDebugf(\"Expected image width: %i, actual image width %i.\\n\",\n referenceBitmap->width(), bitmap->width());\n SkDELETE(bitmap);\n SkDELETE(referenceBitmap);\n return false;\n }\n if (success && (bitmap->height() != referenceBitmap->height())) {\n SkDebugf(\"Expected image height: %i, actual image height %i\",\n referenceBitmap->height(), bitmap->height());\n SkDELETE(bitmap);\n SkDELETE(referenceBitmap);\n return false;\n }\n\n for (int y = 0; success && y < bitmap->height(); y++) {\n for (int x = 0; success && x < bitmap->width(); x++) {\n int diff = MaxByteDiff(*referenceBitmap->getAddr32(x, y),\n *bitmap->getAddr32(x, y));\n SkASSERT(diff >= 0 && diff <= 255);\n diffs[diff]++;\n\n if (diff > FLAGS_maxComponentDiff) {\n SkDebugf(\"Expected pixel at (%i %i) exceedds maximum \"\n \"component diff of %i: 0x%x, actual 0x%x\\n\",\n x, y, FLAGS_maxComponentDiff,\n *referenceBitmap->getAddr32(x, y),\n *bitmap->getAddr32(x, y));\n SkDELETE(bitmap);\n SkDELETE(referenceBitmap);\n return false;\n }\n }\n }\n SkDELETE(referenceBitmap);\n\n for (int i = 1; i <= 255; ++i) {\n if(diffs[i] > 0) {\n SkDebugf(\"Number of pixels with max diff of %i is %i\\n\", i, diffs[i]);\n }\n }\n }\n\n if (FLAGS_writeWholeImage) {\n sk_tools::force_all_opaque(*bitmap);\n if (NULL != outputDir && FLAGS_writeWholeImage) {\n SkString inputFilename;\n sk_tools::get_basename(&inputFilename, inputPath);\n SkString outputPath;\n make_output_filepath(&outputPath, *outputDir, inputFilename);\n outputPath.append(\".png\");\n if (!SkImageEncoder::EncodeFile(outputPath.c_str(), *bitmap,\n SkImageEncoder::kPNG_Type, 100)) {\n SkDebugf(\"Failed to draw the picture.\\n\");\n success = false;\n }\n }\n }\n SkDELETE(bitmap);\n\n return success;\n}\n\n\nstatic int process_input(const char* input, const SkString* outputDir,\n sk_tools::PictureRenderer& renderer) {\n SkOSFile::Iter iter(input, \"skp\");\n SkString inputFilename;\n int failures = 0;\n SkDebugf(\"process_input, %s\\n\", input);\n if (iter.next(&inputFilename)) {\n do {\n SkString inputPath;\n SkString inputAsSkString(input);\n sk_tools::make_filepath(&inputPath, inputAsSkString, inputFilename);\n if (!render_picture(inputPath, outputDir, renderer)) {\n ++failures;\n }\n } while(iter.next(&inputFilename));\n } else if (SkStrEndsWith(input, \".skp\")) {\n SkString inputPath(input);\n if (!render_picture(inputPath, outputDir, renderer)) {\n ++failures;\n }\n } else {\n SkString warning;\n warning.printf(\"Warning: skipping %s\\n\", input);\n SkDebugf(warning.c_str());\n }\n return failures;\n}\n\nint tool_main(int argc, char** argv);\nint tool_main(int argc, char** argv) {\n SkCommandLineFlags::SetUsage(\"Render .skp files.\");\n SkCommandLineFlags::Parse(argc, argv);\n\n if (FLAGS_readPath.isEmpty()) {\n SkDebugf(\".skp files or directories are required.\\n\");\n exit(-1);\n }\n\n if (FLAGS_maxComponentDiff < 0 || FLAGS_maxComponentDiff > 256) {\n SkDebugf(\"--maxComponentDiff must be between 0 and 256\\n\");\n exit(-1);\n }\n\n if (FLAGS_maxComponentDiff != 256 && !FLAGS_validate) {\n SkDebugf(\"--maxComponentDiff requires --validate\\n\");\n exit(-1);\n }\n\n if (FLAGS_clone < 0) {\n SkDebugf(\"--clone must be >= 0. Was %i\\n\", FLAGS_clone);\n exit(-1);\n }\n\n if (FLAGS_writeEncodedImages) {\n if (FLAGS_writePath.isEmpty()) {\n SkDebugf(\"--writeEncodedImages requires --writePath\\n\");\n exit(-1);\n }\n if (FLAGS_deferImageDecoding) {\n SkDebugf(\"--writeEncodedImages is not compatible with --deferImageDecoding\\n\");\n exit(-1);\n }\n }\n\n SkString errorString;\n SkAutoTUnref<sk_tools::PictureRenderer> renderer(parseRenderer(errorString,\n kRender_PictureTool));\n if (errorString.size() > 0) {\n SkDebugf(\"%s\\n\", errorString.c_str());\n }\n\n if (renderer.get() == NULL) {\n exit(-1);\n }\n\n SkAutoGraphics ag;\n\n SkString outputDir;\n if (FLAGS_writePath.count() == 1) {\n outputDir.set(FLAGS_writePath[0]);\n }\n\n int failures = 0;\n for (int i = 0; i < FLAGS_readPath.count(); i ++) {\n failures += process_input(FLAGS_readPath[i], &outputDir, *renderer.get());\n }\n if (failures != 0) {\n SkDebugf(\"Failed to render %i pictures.\\n\", failures);\n return 1;\n }\n#if SK_SUPPORT_GPU\n#if GR_CACHE_STATS\n if (renderer->isUsingGpuDevice()) {\n GrContext* ctx = renderer->getGrContext();\n\n ctx->printCacheStats();\n }\n#endif\n#endif\n return 0;\n}\n\n#if !defined SK_BUILD_FOR_IOS\nint main(int argc, char * const argv[]) {\n return tool_main(argc, (char**) argv);\n}\n#endif\n<|endoftext|>"} {"text":"<commit_before>\/*************************************************************************\n *\n * $RCSfile: tempfile.cxx,v $\n *\n * $Revision: 1.5 $\n *\n * last change: $Author: hro $ $Date: 2002-07-08 09:01:45 $\n *\n * The Contents of this file are made available subject to the terms of\n * either of the following licenses\n *\n * - GNU Lesser General Public License Version 2.1\n * - Sun Industry Standards Source License Version 1.1\n *\n * Sun Microsystems Inc., October, 2000\n *\n * GNU Lesser General Public License Version 2.1\n * =============================================\n * Copyright 2000 by Sun Microsystems, Inc.\n * 901 San Antonio Road, Palo Alto, CA 94303, USA\n *\n * This library is free software; you can redistribute it and\/or\n * modify it under the terms of the GNU Lesser General Public\n * License version 2.1, as published by the Free Software Foundation.\n *\n * This library is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU\n * Lesser General Public License for more details.\n *\n * You should have received a copy of the GNU Lesser General Public\n * License along with this library; if not, write to the Free Software\n * Foundation, Inc., 59 Temple Place, Suite 330, Boston,\n * MA 02111-1307 USA\n *\n *\n * Sun Industry Standards Source License Version 1.1\n * =================================================\n * The contents of this file are subject to the Sun Industry Standards\n * Source License Version 1.1 (the \"License\"); You may not use this file\n * except in compliance with the License. You may obtain a copy of the\n * License at http:\/\/www.openoffice.org\/license.html.\n *\n * Software provided under this License is provided on an \"AS IS\" basis,\n * WITHOUT WARRANTY OF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING,\n * WITHOUT LIMITATION, WARRANTIES THAT THE SOFTWARE IS FREE OF DEFECTS,\n * MERCHANTABLE, FIT FOR A PARTICULAR PURPOSE, OR NON-INFRINGING.\n * See the License for the specific provisions governing your rights and\n * obligations concerning the Software.\n *\n * The Initial Developer of the Original Code is: Sun Microsystems, Inc.\n *\n * Copyright: 2000 by Sun Microsystems, Inc.\n *\n * All Rights Reserved.\n *\n * Contributor(s): _______________________________________\n *\n *\n ************************************************************************\/\n\n#include \"tempfile.hxx\"\n#include \"comdep.hxx\"\n\n#include <rtl\/ustring.hxx>\n#ifndef _OSL_FILE_HXX_\n#include <osl\/file.hxx>\n#endif\n#ifndef _TOOLS_TIME_HXX\n#include <time.hxx>\n#endif\n#include <debug.hxx>\n#include <stdio.h>\n\n#ifdef UNX\n#define _MAX_PATH 260\n#endif\n\nusing namespace osl;\n\nstatic ::rtl::OUString aTempNameBase_Impl;\n\nstruct TempFile_Impl\n{\n String aName;\n sal_Bool bIsDirectory;\n};\n\nString GetSystemTempDir_Impl()\n{\n char sBuf[_MAX_PATH];\n const char *pDir = TempDirImpl(sBuf);\n\n ::rtl::OString aTmpA( pDir );\n ::rtl::OUString aTmp = ::rtl::OStringToOUString( aTmpA, osl_getThreadTextEncoding() );\n rtl::OUString aRet;\n FileBase::getFileURLFromSystemPath( aTmp, aRet );\n String aName = aRet;\n sal_Int32 i = aName.Len();\n if( aName.GetChar(i-1) != '\/' )\n aName += '\/';\n return aName;\n}\n\n#define TMPNAME_SIZE ( 1 + 5 + 5 + 4 + 1 )\nString ConstructTempDir_Impl( const String* pParent )\n{\n String aName;\n if ( pParent && pParent->Len() )\n {\n \/\/ if parent given try to use it\n rtl::OUString aTmp( *pParent );\n rtl::OUString aRet;\n\n \/\/ test for valid filename\n {\n ::osl::DirectoryItem aItem;\n sal_Int32 i = aRet.getLength();\n if ( aRet[i-1] == '\/' )\n i--;\n\n if ( DirectoryItem::get( ::rtl::OUString( aRet, i ), aItem ) == FileBase::E_None )\n aName = aRet;\n }\n }\n\n if ( !aName.Len() )\n {\n \/\/ if no parent or invalid parent : use system directory\n if ( !aTempNameBase_Impl.getLength() )\n aTempNameBase_Impl = GetSystemTempDir_Impl();\n aName = aTempNameBase_Impl;\n }\n\n \/\/ Make sure that directory ends with a separator\n sal_Int32 i = aName.Len();\n if( i>0 && aName.GetChar(i-1) != '\/' )\n aName += '\/';\n\n return aName;\n}\n\nvoid CreateTempName_Impl( String& rName, sal_Bool bKeep, sal_Bool bDir = sal_True )\n{\n \/\/ add a suitable tempname\n \/\/ Prefix can have 5 chars, leaving 3 for numbers. 26 ** 3 == 17576\n \/\/ ER 13.07.00 why not radix 36 [0-9A-Z] ?!?\n const unsigned nRadix = 26;\n String aName( rName );\n aName += String::CreateFromAscii( \"sv\" );\n sal_Int32 i = aName.Len();\n\n rName.Erase();\n static unsigned long u = Time::GetSystemTicks();\n for ( unsigned long nOld = u; ++u != nOld; )\n {\n u %= (nRadix*nRadix*nRadix);\n String aTmp( aName );\n aTmp += String::CreateFromInt32( (sal_Int32) (unsigned) u, nRadix );\n aTmp += String::CreateFromAscii( \".tmp\" );\n\n if ( bDir )\n {\n FileBase::RC err = Directory::create( aTmp );\n if ( err == FileBase::E_None )\n {\n \/\/ !bKeep: only for creating a name, not a file or directory\n if ( bKeep || Directory::remove( aTmp ) == FileBase::E_None )\n rName = aTmp;\n break;\n }\n else if ( err != FileBase::E_EXIST )\n {\n \/\/ if f.e. name contains invalid chars stop trying to create dirs\n break;\n }\n }\n else\n {\n DBG_ASSERT( bKeep, \"Too expensive, use directory for creating name!\" );\n File aFile( aTmp );\n FileBase::RC err = aFile.open(osl_File_OpenFlag_Create);\n if ( err == FileBase::E_None )\n {\n rName = aTmp;\n aFile.close();\n break;\n }\n else if ( err != FileBase::E_EXIST )\n {\n \/\/ if f.e. name contains invalid chars stop trying to create files\n break;\n }\n }\n }\n}\n\nString TempFile::CreateTempName( const String* pParent )\n{\n \/\/ get correct directory\n String aName = ConstructTempDir_Impl( pParent );\n\n \/\/ get TempFile name with default naming scheme\n CreateTempName_Impl( aName, sal_False );\n\n \/\/ convert to file URL\n rtl::OUString aTmp;\n if ( aName.Len() )\n aTmp = aName;\n return aTmp;\n}\n\nTempFile::TempFile( const String* pParent, sal_Bool bDirectory )\n : pImp( new TempFile_Impl )\n , bKillingFileEnabled( sal_False )\n{\n pImp->bIsDirectory = bDirectory;\n\n \/\/ get correct directory\n pImp->aName = ConstructTempDir_Impl( pParent );\n\n \/\/ get TempFile with default naming scheme\n CreateTempName_Impl( pImp->aName, sal_True, bDirectory );\n}\n\nTempFile::TempFile( const String& rLeadingChars, const String* pExtension, const String* pParent, sal_Bool bDirectory )\n : pImp( new TempFile_Impl )\n , bKillingFileEnabled( sal_False )\n{\n pImp->bIsDirectory = bDirectory;\n\n \/\/ get correct directory\n String aName = ConstructTempDir_Impl( pParent );\n\n \/\/ now use special naming scheme ( name takes leading chars and an index counting up from zero\n aName += rLeadingChars;\n for ( sal_Int32 i=0;; i++ )\n {\n String aTmp( aName );\n aTmp += String::CreateFromInt32( i );\n if ( pExtension )\n aTmp += *pExtension;\n else\n aTmp += String::CreateFromAscii( \".tmp\" );\n if ( bDirectory )\n {\n FileBase::RC err = Directory::create( aTmp );\n if ( err == FileBase::E_None )\n {\n pImp->aName = aTmp;\n break;\n }\n else if ( err != FileBase::E_EXIST )\n \/\/ if f.e. name contains invalid chars stop trying to create dirs\n break;\n }\n else\n {\n File aFile( aTmp );\n FileBase::RC err = aFile.open(osl_File_OpenFlag_Create);\n if ( err == FileBase::E_None )\n {\n pImp->aName = aTmp;\n aFile.close();\n break;\n }\n else if ( err != FileBase::E_EXIST )\n \/\/ if f.e. name contains invalid chars stop trying to create dirs\n break;\n }\n }\n}\n\nTempFile::~TempFile()\n{\n if ( bKillingFileEnabled )\n {\n if ( pImp->bIsDirectory )\n {\n \/\/ at the moment no recursiv algorithm present\n Directory::remove( pImp->aName );\n }\n else\n {\n File::remove( pImp->aName );\n }\n }\n\n delete pImp;\n}\n\nsal_Bool TempFile::IsValid() const\n{\n return pImp->aName.Len() != 0;\n}\n\nString TempFile::GetName() const\n{\n rtl::OUString aTmp;\n aTmp = pImp->aName;\n return aTmp;\n}\n\nString TempFile::SetTempNameBaseDirectory( const String &rBaseName )\n{\n\/\/ if ( !aTempNameBase_Impl.getLength() )\n\/\/ aTempNameBase_Impl = GetSystemTempDir_Impl();\n\/\/ String aName( aTempNameBase_Impl );\n\/\/ aName += rBaseName;\n\n String aName( rBaseName );\n\n FileBase::RC err= Directory::create( aName );\n if ( err == FileBase::E_None || err == FileBase::E_EXIST )\n {\n aTempNameBase_Impl = aName;\n aTempNameBase_Impl += ::rtl::OUString( '\/' );\n\n TempFile aBase( NULL, sal_True );\n if ( aBase.IsValid() )\n aTempNameBase_Impl = aBase.pImp->aName;\n }\n\n rtl::OUString aTmp;\n aTmp = aTempNameBase_Impl;\n return aTmp;\n}\n\nString TempFile::GetTempNameBaseDirectory()\n{\n if ( !aTempNameBase_Impl.getLength() )\n aTempNameBase_Impl = GetSystemTempDir_Impl();\n\n rtl::OUString aTmp;\n aTmp = aTempNameBase_Impl;\n return aTmp;\n}\n\n<commit_msg>INTEGRATION: CWS tune04 (1.5.246); FILE MERGED 2004\/06\/10 12:08:29 cmc 1.5.246.1: #i29636# turn global objects into local static data protected with swishy double-locked templated template<commit_after>\/*************************************************************************\n *\n * $RCSfile: tempfile.cxx,v $\n *\n * $Revision: 1.6 $\n *\n * last change: $Author: hjs $ $Date: 2004-06-25 17:11:36 $\n *\n * The Contents of this file are made available subject to the terms of\n * either of the following licenses\n *\n * - GNU Lesser General Public License Version 2.1\n * - Sun Industry Standards Source License Version 1.1\n *\n * Sun Microsystems Inc., October, 2000\n *\n * GNU Lesser General Public License Version 2.1\n * =============================================\n * Copyright 2000 by Sun Microsystems, Inc.\n * 901 San Antonio Road, Palo Alto, CA 94303, USA\n *\n * This library is free software; you can redistribute it and\/or\n * modify it under the terms of the GNU Lesser General Public\n * License version 2.1, as published by the Free Software Foundation.\n *\n * This library is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU\n * Lesser General Public License for more details.\n *\n * You should have received a copy of the GNU Lesser General Public\n * License along with this library; if not, write to the Free Software\n * Foundation, Inc., 59 Temple Place, Suite 330, Boston,\n * MA 02111-1307 USA\n *\n *\n * Sun Industry Standards Source License Version 1.1\n * =================================================\n * The contents of this file are subject to the Sun Industry Standards\n * Source License Version 1.1 (the \"License\"); You may not use this file\n * except in compliance with the License. You may obtain a copy of the\n * License at http:\/\/www.openoffice.org\/license.html.\n *\n * Software provided under this License is provided on an \"AS IS\" basis,\n * WITHOUT WARRANTY OF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING,\n * WITHOUT LIMITATION, WARRANTIES THAT THE SOFTWARE IS FREE OF DEFECTS,\n * MERCHANTABLE, FIT FOR A PARTICULAR PURPOSE, OR NON-INFRINGING.\n * See the License for the specific provisions governing your rights and\n * obligations concerning the Software.\n *\n * The Initial Developer of the Original Code is: Sun Microsystems, Inc.\n *\n * Copyright: 2000 by Sun Microsystems, Inc.\n *\n * All Rights Reserved.\n *\n * Contributor(s): _______________________________________\n *\n *\n ************************************************************************\/\n\n#include \"tempfile.hxx\"\n#include \"comdep.hxx\"\n\n#include <rtl\/ustring.hxx>\n#ifndef _OSL_FILE_HXX_\n#include <osl\/file.hxx>\n#endif\n#ifndef INCLUDED_RTL_INSTANCE_HXX\n#include <rtl\/instance.hxx>\n#endif\n#ifndef _TOOLS_TIME_HXX\n#include <time.hxx>\n#endif\n#include <debug.hxx>\n#include <stdio.h>\n\n#ifdef UNX\n#define _MAX_PATH 260\n#endif\n\nusing namespace osl;\n\nnamespace { struct TempNameBase_Impl : public rtl::Static< ::rtl::OUString, TempNameBase_Impl > {}; }\n\nstruct TempFile_Impl\n{\n String aName;\n sal_Bool bIsDirectory;\n};\n\nString GetSystemTempDir_Impl()\n{\n char sBuf[_MAX_PATH];\n const char *pDir = TempDirImpl(sBuf);\n\n ::rtl::OString aTmpA( pDir );\n ::rtl::OUString aTmp = ::rtl::OStringToOUString( aTmpA, osl_getThreadTextEncoding() );\n rtl::OUString aRet;\n FileBase::getFileURLFromSystemPath( aTmp, aRet );\n String aName = aRet;\n sal_Int32 i = aName.Len();\n if( aName.GetChar(i-1) != '\/' )\n aName += '\/';\n return aName;\n}\n\n#define TMPNAME_SIZE ( 1 + 5 + 5 + 4 + 1 )\nString ConstructTempDir_Impl( const String* pParent )\n{\n String aName;\n if ( pParent && pParent->Len() )\n {\n \/\/ if parent given try to use it\n rtl::OUString aTmp( *pParent );\n rtl::OUString aRet;\n\n \/\/ test for valid filename\n {\n ::osl::DirectoryItem aItem;\n sal_Int32 i = aRet.getLength();\n if ( aRet[i-1] == '\/' )\n i--;\n\n if ( DirectoryItem::get( ::rtl::OUString( aRet, i ), aItem ) == FileBase::E_None )\n aName = aRet;\n }\n }\n\n if ( !aName.Len() )\n {\n \/\/ if no parent or invalid parent : use system directory\n ::rtl::OUString& rTempNameBase_Impl = TempNameBase_Impl::get();\n if ( !rTempNameBase_Impl.getLength() )\n rTempNameBase_Impl = GetSystemTempDir_Impl();\n aName = rTempNameBase_Impl;\n }\n\n \/\/ Make sure that directory ends with a separator\n sal_Int32 i = aName.Len();\n if( i>0 && aName.GetChar(i-1) != '\/' )\n aName += '\/';\n\n return aName;\n}\n\nvoid CreateTempName_Impl( String& rName, sal_Bool bKeep, sal_Bool bDir = sal_True )\n{\n \/\/ add a suitable tempname\n \/\/ Prefix can have 5 chars, leaving 3 for numbers. 26 ** 3 == 17576\n \/\/ ER 13.07.00 why not radix 36 [0-9A-Z] ?!?\n const unsigned nRadix = 26;\n String aName( rName );\n aName += String::CreateFromAscii( \"sv\" );\n sal_Int32 i = aName.Len();\n\n rName.Erase();\n static unsigned long u = Time::GetSystemTicks();\n for ( unsigned long nOld = u; ++u != nOld; )\n {\n u %= (nRadix*nRadix*nRadix);\n String aTmp( aName );\n aTmp += String::CreateFromInt32( (sal_Int32) (unsigned) u, nRadix );\n aTmp += String::CreateFromAscii( \".tmp\" );\n\n if ( bDir )\n {\n FileBase::RC err = Directory::create( aTmp );\n if ( err == FileBase::E_None )\n {\n \/\/ !bKeep: only for creating a name, not a file or directory\n if ( bKeep || Directory::remove( aTmp ) == FileBase::E_None )\n rName = aTmp;\n break;\n }\n else if ( err != FileBase::E_EXIST )\n {\n \/\/ if f.e. name contains invalid chars stop trying to create dirs\n break;\n }\n }\n else\n {\n DBG_ASSERT( bKeep, \"Too expensive, use directory for creating name!\" );\n File aFile( aTmp );\n FileBase::RC err = aFile.open(osl_File_OpenFlag_Create);\n if ( err == FileBase::E_None )\n {\n rName = aTmp;\n aFile.close();\n break;\n }\n else if ( err != FileBase::E_EXIST )\n {\n \/\/ if f.e. name contains invalid chars stop trying to create files\n break;\n }\n }\n }\n}\n\nString TempFile::CreateTempName( const String* pParent )\n{\n \/\/ get correct directory\n String aName = ConstructTempDir_Impl( pParent );\n\n \/\/ get TempFile name with default naming scheme\n CreateTempName_Impl( aName, sal_False );\n\n \/\/ convert to file URL\n rtl::OUString aTmp;\n if ( aName.Len() )\n aTmp = aName;\n return aTmp;\n}\n\nTempFile::TempFile( const String* pParent, sal_Bool bDirectory )\n : pImp( new TempFile_Impl )\n , bKillingFileEnabled( sal_False )\n{\n pImp->bIsDirectory = bDirectory;\n\n \/\/ get correct directory\n pImp->aName = ConstructTempDir_Impl( pParent );\n\n \/\/ get TempFile with default naming scheme\n CreateTempName_Impl( pImp->aName, sal_True, bDirectory );\n}\n\nTempFile::TempFile( const String& rLeadingChars, const String* pExtension, const String* pParent, sal_Bool bDirectory )\n : pImp( new TempFile_Impl )\n , bKillingFileEnabled( sal_False )\n{\n pImp->bIsDirectory = bDirectory;\n\n \/\/ get correct directory\n String aName = ConstructTempDir_Impl( pParent );\n\n \/\/ now use special naming scheme ( name takes leading chars and an index counting up from zero\n aName += rLeadingChars;\n for ( sal_Int32 i=0;; i++ )\n {\n String aTmp( aName );\n aTmp += String::CreateFromInt32( i );\n if ( pExtension )\n aTmp += *pExtension;\n else\n aTmp += String::CreateFromAscii( \".tmp\" );\n if ( bDirectory )\n {\n FileBase::RC err = Directory::create( aTmp );\n if ( err == FileBase::E_None )\n {\n pImp->aName = aTmp;\n break;\n }\n else if ( err != FileBase::E_EXIST )\n \/\/ if f.e. name contains invalid chars stop trying to create dirs\n break;\n }\n else\n {\n File aFile( aTmp );\n FileBase::RC err = aFile.open(osl_File_OpenFlag_Create);\n if ( err == FileBase::E_None )\n {\n pImp->aName = aTmp;\n aFile.close();\n break;\n }\n else if ( err != FileBase::E_EXIST )\n \/\/ if f.e. name contains invalid chars stop trying to create dirs\n break;\n }\n }\n}\n\nTempFile::~TempFile()\n{\n if ( bKillingFileEnabled )\n {\n if ( pImp->bIsDirectory )\n {\n \/\/ at the moment no recursiv algorithm present\n Directory::remove( pImp->aName );\n }\n else\n {\n File::remove( pImp->aName );\n }\n }\n\n delete pImp;\n}\n\nsal_Bool TempFile::IsValid() const\n{\n return pImp->aName.Len() != 0;\n}\n\nString TempFile::GetName() const\n{\n rtl::OUString aTmp;\n aTmp = pImp->aName;\n return aTmp;\n}\n\nString TempFile::SetTempNameBaseDirectory( const String &rBaseName )\n{\n String aName( rBaseName );\n\n ::rtl::OUString& rTempNameBase_Impl = TempNameBase_Impl::get();\n\n FileBase::RC err= Directory::create( aName );\n if ( err == FileBase::E_None || err == FileBase::E_EXIST )\n {\n rTempNameBase_Impl = aName;\n rTempNameBase_Impl += ::rtl::OUString( '\/' );\n\n TempFile aBase( NULL, sal_True );\n if ( aBase.IsValid() )\n rTempNameBase_Impl = aBase.pImp->aName;\n }\n\n rtl::OUString aTmp;\n aTmp = rTempNameBase_Impl;\n return aTmp;\n}\n\nString TempFile::GetTempNameBaseDirectory()\n{\n ::rtl::OUString& rTempNameBase_Impl = TempNameBase_Impl::get();\n if ( !rTempNameBase_Impl.getLength() )\n rTempNameBase_Impl = GetSystemTempDir_Impl();\n\n rtl::OUString aTmp;\n aTmp = rTempNameBase_Impl;\n return aTmp;\n}\n\n<|endoftext|>"} {"text":"<commit_before><commit_msg>-Werror,-Wunused-function<commit_after><|endoftext|>"} {"text":"<commit_before>#include \"TEntryListArray.h\"\n#include \"TLeaf.h\"\n#include \"TROOT.h\"\n#include \"TTree.h\"\n#include \"TTreeReader.h\"\n#include \"TTreeReaderValue.h\"\n#include \"TTreeReaderArray.h\"\n\n#include \"gtest\/gtest.h\"\n\nTTree* MakeTree() {\n double x[3]{};\n float z = 0.;\n struct {\n unsigned int ny;\n int* y = nullptr;\n } yData;\n\n TTree* tree = new TTree(\"T\", \"test tree\");\n tree->Branch(\"one\", &x, \"x[3]\/D\");\n tree->Branch(\"two\", &yData, \"ny\/i:y[ny]\/I\");\n tree->Branch(\"three\", &z, \"z\");\n\n x[1] = 42.;\n yData.ny = 42;\n yData.y = new int[42]{};\n yData.y[0] = 17;\n tree->Fill();\n\n x[2] = 43.;\n yData.ny = 5;\n yData.y[4] = 7;\n tree->Fill();\n\n for (int entry = 2; entry < 20; ++entry) {\n z = entry * (1 - 2 * (entry % 2)); \/\/ +entry for even, -entry for odd\n tree->Fill();\n }\n\n delete [] yData.y;\n\n tree->ResetBranchAddresses();\n\n return tree;\n}\n\nTEST(TTreeReaderBasic, Interfaces) {\n TTree* tree = MakeTree();\n\n TTreeReader tr(tree);\n TTreeReaderArray<double> x(tr, \"one.x\");\n TTreeReaderArray<int> y(tr, \"two.y\");\n TTreeReaderValue<unsigned int> ny(tr, \"two.ny\");\n\n \/\/ Before reading data:\n EXPECT_NE(tr.begin(), tr.end());\n \/\/MISSING: EXPECT_EQ(2, tr.end() - tr.begin());\n EXPECT_EQ(-1, tr.GetCurrentEntry());\n EXPECT_EQ(20, tr.GetEntries(false));\n EXPECT_EQ(TTreeReader::kEntryNotLoaded, tr.GetEntryStatus());\n EXPECT_EQ(tree, tr.GetTree());\n EXPECT_FALSE(tr.IsChain());\n\n EXPECT_EQ(nullptr, ny.GetAddress());\n EXPECT_FALSE(ny.IsValid());\n EXPECT_STREQ(\"two.ny\", ny.GetBranchName());\n EXPECT_EQ(ROOT::Internal::TTreeReaderValueBase::kReadNothingYet, ny.GetReadStatus());\n EXPECT_EQ(ROOT::Internal::TTreeReaderValueBase::kSetupNotSetup, ny.GetSetupStatus());\n EXPECT_EQ(ROOT::Internal::TTreeReaderValueBase::kReadNothingYet, ny.ProxyRead());\n\n \/\/ Skip to second entry:\n EXPECT_TRUE(tr.Next());\n EXPECT_TRUE(tr.Next());\n\n EXPECT_NE(tr.begin(), tr.end());\n \/\/MISSING: EXPECT_EQ(2, tr.end() - tr.begin());\n EXPECT_EQ(1, tr.GetCurrentEntry());\n EXPECT_EQ(20, tr.GetEntries(false));\n\n\n EXPECT_EQ(5u, *ny);\n EXPECT_NE(nullptr, ny.GetAddress());\n EXPECT_TRUE(ny.IsValid());\n EXPECT_EQ(ny.GetAddress(), ny.Get());\n EXPECT_STREQ(\"two\", ny.GetBranchName());\n EXPECT_STREQ(\"ny\", ny.GetLeaf()->GetName());\n EXPECT_EQ(ROOT::Internal::TTreeReaderValueBase::kReadSuccess, ny.GetReadStatus());\n EXPECT_EQ(ROOT::Internal::TTreeReaderValueBase::kSetupMatch, ny.GetSetupStatus());\n EXPECT_EQ(ROOT::Internal::TTreeReaderValueBase::kReadSuccess, ny.ProxyRead());\n\n EXPECT_EQ(3u, x.GetSize());\n EXPECT_EQ(5u, y.GetSize());\n EXPECT_DOUBLE_EQ(43., x[2]);\n \/\/FAILS: EXPECT_EQ(7, y[4]);\n\n for (int entry = 2; entry < 20; ++entry)\n EXPECT_TRUE(tr.Next());\n\n EXPECT_FALSE(tr.Next());\n \/\/FAILS: EXPECT_FALSE(ny.IsValid());\n}\n\n\nTEST(TTreeReaderBasic, ErrorProbing) {\n TTreeReader tr(\"doesNotExist\", gROOT);\n EXPECT_EQ(TTreeReader::kEntryNoTree, tr.GetEntryStatus());\n EXPECT_EQ(nullptr, tr.GetTree());\n\n tr.SetTree(nullptr);\n EXPECT_EQ(TTreeReader::kEntryNoTree, tr.GetEntryStatus());\n EXPECT_EQ(nullptr, tr.GetTree());\n\n TTreeReaderValue<double> val;\n EXPECT_FALSE(val.IsValid());\n}\n\n\nTEST(TTreeReaderBasic, Range) {\n TTree* tree = MakeTree();\n TTreeReader tr(tree);\n\n EXPECT_EQ(TTreeReader::kEntryValid, tr.SetEntriesRange(5, 8));\n\n EXPECT_TRUE(tr.Next());\n EXPECT_EQ(5, tr.GetCurrentEntry());\n EXPECT_EQ(TTreeReader::kEntryValid, tr.GetEntryStatus());\n\n EXPECT_TRUE(tr.Next());\n EXPECT_EQ(6, tr.GetCurrentEntry());\n EXPECT_EQ(TTreeReader::kEntryValid, tr.GetEntryStatus());\n\n EXPECT_TRUE(tr.Next());\n EXPECT_EQ(7, tr.GetCurrentEntry());\n EXPECT_EQ(TTreeReader::kEntryValid, tr.GetEntryStatus());\n\n \/\/ Reached end:\n EXPECT_FALSE(tr.Next());\n EXPECT_EQ(8, tr.GetCurrentEntry());\n EXPECT_EQ(TTreeReader::kEntryBeyondEnd, tr.GetEntryStatus());\n\n \/\/ Read beyond end:\n EXPECT_FALSE(tr.Next());\n EXPECT_EQ(TTreeReader::kEntryBeyondEnd, tr.GetEntryStatus());\n EXPECT_EQ(9, tr.GetCurrentEntry());\n}\n\nTEST(TTreeReaderBasic, InvalidRange) {\n TTree *tree = MakeTree();\n TTreeReader tr(tree);\n\n EXPECT_EQ(TTreeReader::kEntryNotFound, tr.SetEntriesRange(tree->GetEntries(), 0));\n\n \/\/ Is SetEntriesRange() simply ignored as it should be?\n EXPECT_TRUE(tr.Next());\n EXPECT_EQ(0, tr.GetCurrentEntry());\n EXPECT_EQ(TTreeReader::kEntryValid, tr.GetEntryStatus());\n}\n\n\nTEST(TTreeReaderBasic, OneEntryRange) {\n TTree* tree = MakeTree();\n TTreeReader tr(tree);\n\n EXPECT_EQ(TTreeReader::kEntryValid, tr.SetEntriesRange(1, 2));\n\n EXPECT_TRUE(tr.Next());\n EXPECT_EQ(1, tr.GetCurrentEntry());\n EXPECT_EQ(TTreeReader::kEntryValid, tr.GetEntryStatus());\n\n \/\/ Read beyond end:\n EXPECT_FALSE(tr.Next());\n EXPECT_EQ(TTreeReader::kEntryBeyondEnd, tr.GetEntryStatus());\n EXPECT_EQ(2, tr.GetCurrentEntry());\n\n for (int entry = 2; entry < tree->GetEntries(); ++entry)\n EXPECT_FALSE(tr.Next());\n}\n\n\nTEST(TTreeReaderBasic, ZeroEntryRange) {\n TTree* tree = MakeTree();\n TTreeReader tr(tree);\n\n \/\/ end is ignored:\n EXPECT_EQ(TTreeReader::kEntryValid, tr.SetEntriesRange(18, 18));\n\n EXPECT_TRUE(tr.Next());\n EXPECT_EQ(18, tr.GetCurrentEntry());\n EXPECT_EQ(TTreeReader::kEntryValid, tr.GetEntryStatus());\n\n EXPECT_TRUE(tr.Next());\n EXPECT_EQ(19, tr.GetCurrentEntry());\n EXPECT_EQ(TTreeReader::kEntryValid, tr.GetEntryStatus());\n\n \/\/ Read beyond end:\n EXPECT_FALSE(tr.Next());\n \/\/ As the TTree only has up to entry 19, 20 is kEntryNotFound:\n EXPECT_EQ(TTreeReader::kEntryNotFound, tr.GetEntryStatus());\n EXPECT_EQ(20, tr.GetCurrentEntry());\n}\n\n\nTEST(TTreeReaderBasic, InvertedEntryRange) {\n TTree* tree = MakeTree();\n TTreeReader tr(tree);\n\n EXPECT_EQ(TTreeReader::kEntryValid, tr.SetEntriesRange(18, 3));\n\n EXPECT_TRUE(tr.Next());\n EXPECT_EQ(18, tr.GetCurrentEntry());\n EXPECT_EQ(TTreeReader::kEntryValid, tr.GetEntryStatus());\n\n EXPECT_TRUE(tr.Next());\n EXPECT_EQ(19, tr.GetCurrentEntry());\n EXPECT_EQ(TTreeReader::kEntryValid, tr.GetEntryStatus());\n\n \/\/ Read beyond end:\n EXPECT_FALSE(tr.Next());\n \/\/ As the TTree only has up to entry 19, 20 is kEntryNotFound:\n EXPECT_EQ(TTreeReader::kEntryNotFound, tr.GetEntryStatus());\n EXPECT_EQ(20, tr.GetCurrentEntry());\n}\n\n\nTEST(TTreeReaderBasic, EntryList) {\n \/\/ See https:\/\/root.cern.ch\/phpBB3\/viewtopic.php?f=3&t=22850&p=100796\n TTree* tree = MakeTree();\n EXPECT_EQ(9, tree->Draw(\">>negZ\",\"three.z<0\", \"entrylistarray\"));\n TEntryListArray* selected = (TEntryListArray*)gDirectory->Get(\"negZ\");\n TTreeReader aReader(tree, selected);\n\n EXPECT_EQ(9, aReader.GetEntries(false));\n\n TTreeReaderValue<float> z(aReader, \"three.z\");\n\n int count = 0;\n while (aReader.Next()) {\n \/\/ Make sure all Next()-ed entries have z<0 as selected by the entry list.\n EXPECT_LT(*z, 0);\n ++count;\n }\n EXPECT_EQ(9, count);\n}\n\nTEST(TTreeReaderBasic, EntryListBeyondEnd) {\n TTree* tree = MakeTree();\n TEntryList selected;\n \/\/ Add the last valid entry; a subsequent Next() must return false.\n selected.Enter(tree->GetEntries() - 1);\n\n TTreeReader aReader(tree, &selected);\n\n EXPECT_EQ(1, aReader.GetEntries(false));\n\n EXPECT_TRUE(aReader.Next());\n EXPECT_EQ(0, aReader.GetCurrentEntry());\n EXPECT_EQ(TTreeReader::kEntryValid, aReader.GetEntryStatus());\n\n EXPECT_FALSE(aReader.Next());\n EXPECT_EQ(1, aReader.GetCurrentEntry());\n EXPECT_EQ(TTreeReader::kEntryNotFound, aReader.GetEntryStatus());\n}\n<commit_msg>Make call unambiguous.<commit_after>#include \"TEntryListArray.h\"\n#include \"TLeaf.h\"\n#include \"TROOT.h\"\n#include \"TTree.h\"\n#include \"TTreeReader.h\"\n#include \"TTreeReaderValue.h\"\n#include \"TTreeReaderArray.h\"\n\n#include \"gtest\/gtest.h\"\n\nTTree* MakeTree() {\n double x[3]{};\n float z = 0.;\n struct {\n unsigned int ny;\n int* y = nullptr;\n } yData;\n\n TTree* tree = new TTree(\"T\", \"test tree\");\n tree->Branch(\"one\", &x, \"x[3]\/D\");\n tree->Branch(\"two\", &yData, \"ny\/i:y[ny]\/I\");\n tree->Branch(\"three\", &z, \"z\");\n\n x[1] = 42.;\n yData.ny = 42;\n yData.y = new int[42]{};\n yData.y[0] = 17;\n tree->Fill();\n\n x[2] = 43.;\n yData.ny = 5;\n yData.y[4] = 7;\n tree->Fill();\n\n for (int entry = 2; entry < 20; ++entry) {\n z = entry * (1 - 2 * (entry % 2)); \/\/ +entry for even, -entry for odd\n tree->Fill();\n }\n\n delete [] yData.y;\n\n tree->ResetBranchAddresses();\n\n return tree;\n}\n\nTEST(TTreeReaderBasic, Interfaces) {\n TTree* tree = MakeTree();\n\n TTreeReader tr(tree);\n TTreeReaderArray<double> x(tr, \"one.x\");\n TTreeReaderArray<int> y(tr, \"two.y\");\n TTreeReaderValue<unsigned int> ny(tr, \"two.ny\");\n\n \/\/ Before reading data:\n EXPECT_NE(tr.begin(), tr.end());\n \/\/MISSING: EXPECT_EQ(2, tr.end() - tr.begin());\n EXPECT_EQ(-1, tr.GetCurrentEntry());\n EXPECT_EQ(20, tr.GetEntries(false));\n EXPECT_EQ(TTreeReader::kEntryNotLoaded, tr.GetEntryStatus());\n EXPECT_EQ(tree, tr.GetTree());\n EXPECT_FALSE(tr.IsChain());\n\n EXPECT_EQ(nullptr, ny.GetAddress());\n EXPECT_FALSE(ny.IsValid());\n EXPECT_STREQ(\"two.ny\", ny.GetBranchName());\n EXPECT_EQ(ROOT::Internal::TTreeReaderValueBase::kReadNothingYet, ny.GetReadStatus());\n EXPECT_EQ(ROOT::Internal::TTreeReaderValueBase::kSetupNotSetup, ny.GetSetupStatus());\n EXPECT_EQ(ROOT::Internal::TTreeReaderValueBase::kReadNothingYet, ny.ProxyRead());\n\n \/\/ Skip to second entry:\n EXPECT_TRUE(tr.Next());\n EXPECT_TRUE(tr.Next());\n\n EXPECT_NE(tr.begin(), tr.end());\n \/\/MISSING: EXPECT_EQ(2, tr.end() - tr.begin());\n EXPECT_EQ(1, tr.GetCurrentEntry());\n EXPECT_EQ(20, tr.GetEntries(false));\n\n\n EXPECT_EQ(5u, *ny);\n EXPECT_NE(nullptr, ny.GetAddress());\n EXPECT_TRUE(ny.IsValid());\n EXPECT_EQ(ny.GetAddress(), ny.Get());\n EXPECT_STREQ(\"two\", ny.GetBranchName());\n EXPECT_STREQ(\"ny\", ny.GetLeaf()->GetName());\n EXPECT_EQ(ROOT::Internal::TTreeReaderValueBase::kReadSuccess, ny.GetReadStatus());\n EXPECT_EQ(ROOT::Internal::TTreeReaderValueBase::kSetupMatch, ny.GetSetupStatus());\n EXPECT_EQ(ROOT::Internal::TTreeReaderValueBase::kReadSuccess, ny.ProxyRead());\n\n EXPECT_EQ(3u, x.GetSize());\n EXPECT_EQ(5u, y.GetSize());\n EXPECT_DOUBLE_EQ(43., x[2]);\n \/\/FAILS: EXPECT_EQ(7, y[4]);\n\n for (int entry = 2; entry < 20; ++entry)\n EXPECT_TRUE(tr.Next());\n\n EXPECT_FALSE(tr.Next());\n \/\/FAILS: EXPECT_FALSE(ny.IsValid());\n}\n\n\nTEST(TTreeReaderBasic, ErrorProbing) {\n TTreeReader tr(\"doesNotExist\", gROOT);\n EXPECT_EQ(TTreeReader::kEntryNoTree, tr.GetEntryStatus());\n EXPECT_EQ(nullptr, tr.GetTree());\n\n tr.SetTree((TTree*)nullptr);\n EXPECT_EQ(TTreeReader::kEntryNoTree, tr.GetEntryStatus());\n EXPECT_EQ(nullptr, tr.GetTree());\n\n TTreeReaderValue<double> val;\n EXPECT_FALSE(val.IsValid());\n}\n\n\nTEST(TTreeReaderBasic, Range) {\n TTree* tree = MakeTree();\n TTreeReader tr(tree);\n\n EXPECT_EQ(TTreeReader::kEntryValid, tr.SetEntriesRange(5, 8));\n\n EXPECT_TRUE(tr.Next());\n EXPECT_EQ(5, tr.GetCurrentEntry());\n EXPECT_EQ(TTreeReader::kEntryValid, tr.GetEntryStatus());\n\n EXPECT_TRUE(tr.Next());\n EXPECT_EQ(6, tr.GetCurrentEntry());\n EXPECT_EQ(TTreeReader::kEntryValid, tr.GetEntryStatus());\n\n EXPECT_TRUE(tr.Next());\n EXPECT_EQ(7, tr.GetCurrentEntry());\n EXPECT_EQ(TTreeReader::kEntryValid, tr.GetEntryStatus());\n\n \/\/ Reached end:\n EXPECT_FALSE(tr.Next());\n EXPECT_EQ(8, tr.GetCurrentEntry());\n EXPECT_EQ(TTreeReader::kEntryBeyondEnd, tr.GetEntryStatus());\n\n \/\/ Read beyond end:\n EXPECT_FALSE(tr.Next());\n EXPECT_EQ(TTreeReader::kEntryBeyondEnd, tr.GetEntryStatus());\n EXPECT_EQ(9, tr.GetCurrentEntry());\n}\n\nTEST(TTreeReaderBasic, InvalidRange) {\n TTree *tree = MakeTree();\n TTreeReader tr(tree);\n\n EXPECT_EQ(TTreeReader::kEntryNotFound, tr.SetEntriesRange(tree->GetEntries(), 0));\n\n \/\/ Is SetEntriesRange() simply ignored as it should be?\n EXPECT_TRUE(tr.Next());\n EXPECT_EQ(0, tr.GetCurrentEntry());\n EXPECT_EQ(TTreeReader::kEntryValid, tr.GetEntryStatus());\n}\n\n\nTEST(TTreeReaderBasic, OneEntryRange) {\n TTree* tree = MakeTree();\n TTreeReader tr(tree);\n\n EXPECT_EQ(TTreeReader::kEntryValid, tr.SetEntriesRange(1, 2));\n\n EXPECT_TRUE(tr.Next());\n EXPECT_EQ(1, tr.GetCurrentEntry());\n EXPECT_EQ(TTreeReader::kEntryValid, tr.GetEntryStatus());\n\n \/\/ Read beyond end:\n EXPECT_FALSE(tr.Next());\n EXPECT_EQ(TTreeReader::kEntryBeyondEnd, tr.GetEntryStatus());\n EXPECT_EQ(2, tr.GetCurrentEntry());\n\n for (int entry = 2; entry < tree->GetEntries(); ++entry)\n EXPECT_FALSE(tr.Next());\n}\n\n\nTEST(TTreeReaderBasic, ZeroEntryRange) {\n TTree* tree = MakeTree();\n TTreeReader tr(tree);\n\n \/\/ end is ignored:\n EXPECT_EQ(TTreeReader::kEntryValid, tr.SetEntriesRange(18, 18));\n\n EXPECT_TRUE(tr.Next());\n EXPECT_EQ(18, tr.GetCurrentEntry());\n EXPECT_EQ(TTreeReader::kEntryValid, tr.GetEntryStatus());\n\n EXPECT_TRUE(tr.Next());\n EXPECT_EQ(19, tr.GetCurrentEntry());\n EXPECT_EQ(TTreeReader::kEntryValid, tr.GetEntryStatus());\n\n \/\/ Read beyond end:\n EXPECT_FALSE(tr.Next());\n \/\/ As the TTree only has up to entry 19, 20 is kEntryNotFound:\n EXPECT_EQ(TTreeReader::kEntryNotFound, tr.GetEntryStatus());\n EXPECT_EQ(20, tr.GetCurrentEntry());\n}\n\n\nTEST(TTreeReaderBasic, InvertedEntryRange) {\n TTree* tree = MakeTree();\n TTreeReader tr(tree);\n\n EXPECT_EQ(TTreeReader::kEntryValid, tr.SetEntriesRange(18, 3));\n\n EXPECT_TRUE(tr.Next());\n EXPECT_EQ(18, tr.GetCurrentEntry());\n EXPECT_EQ(TTreeReader::kEntryValid, tr.GetEntryStatus());\n\n EXPECT_TRUE(tr.Next());\n EXPECT_EQ(19, tr.GetCurrentEntry());\n EXPECT_EQ(TTreeReader::kEntryValid, tr.GetEntryStatus());\n\n \/\/ Read beyond end:\n EXPECT_FALSE(tr.Next());\n \/\/ As the TTree only has up to entry 19, 20 is kEntryNotFound:\n EXPECT_EQ(TTreeReader::kEntryNotFound, tr.GetEntryStatus());\n EXPECT_EQ(20, tr.GetCurrentEntry());\n}\n\n\nTEST(TTreeReaderBasic, EntryList) {\n \/\/ See https:\/\/root.cern.ch\/phpBB3\/viewtopic.php?f=3&t=22850&p=100796\n TTree* tree = MakeTree();\n EXPECT_EQ(9, tree->Draw(\">>negZ\",\"three.z<0\", \"entrylistarray\"));\n TEntryListArray* selected = (TEntryListArray*)gDirectory->Get(\"negZ\");\n TTreeReader aReader(tree, selected);\n\n EXPECT_EQ(9, aReader.GetEntries(false));\n\n TTreeReaderValue<float> z(aReader, \"three.z\");\n\n int count = 0;\n while (aReader.Next()) {\n \/\/ Make sure all Next()-ed entries have z<0 as selected by the entry list.\n EXPECT_LT(*z, 0);\n ++count;\n }\n EXPECT_EQ(9, count);\n}\n\nTEST(TTreeReaderBasic, EntryListBeyondEnd) {\n TTree* tree = MakeTree();\n TEntryList selected;\n \/\/ Add the last valid entry; a subsequent Next() must return false.\n selected.Enter(tree->GetEntries() - 1);\n\n TTreeReader aReader(tree, &selected);\n\n EXPECT_EQ(1, aReader.GetEntries(false));\n\n EXPECT_TRUE(aReader.Next());\n EXPECT_EQ(0, aReader.GetCurrentEntry());\n EXPECT_EQ(TTreeReader::kEntryValid, aReader.GetEntryStatus());\n\n EXPECT_FALSE(aReader.Next());\n EXPECT_EQ(1, aReader.GetCurrentEntry());\n EXPECT_EQ(TTreeReader::kEntryNotFound, aReader.GetEntryStatus());\n}\n<|endoftext|>"} {"text":"<commit_before>#pragma once\n#include \"stdafx.h\"\n\n\/*\nstatic std::map<std::string,void*> s_InitializationMap;\t\t\/\/ʼֵ\n\ninline void InitInitializationMap()\t\t\t\/\/ʼʼֵ\n{\n\ts_InitializationMap[typeid(int).name()] = new int(0);\n\ts_InitializationMap[typeid(float).name()] = new float(0.00f);\n\ts_InitializationMap[typeid(double).name()] = new double(0.00f);\n\ts_InitializationMap[typeid(char).name()] = new char(char(0));\n\ts_InitializationMap[typeid(bool).name()] = new bool(false);\n}\n\ninline void ReleaseInitializationMap()\t\t\/\/ͷųʼֵ\n{\n\tfor (auto i : s_InitializationMap)\n\t{\n\t\tdelete i.second;\n\t}\n}\ntemplate <typename T>\ninline void GetInitialization(T** c)\t\t\/\/ȡ͵ijʼֵ\n{\n\tauto i = find(s_InitializationMap.begin(), s_InitializationMap.end(), typeid(*(*c)).name());\n\tif (i != s_InitializationMap.end())\n\t{\n\t\tmemcpy(*c, (*i).second, sizeof(T));\n\t}\n\telse\n\t{\n\t\ts_InitializationMap.insert(std::make_pair(typeid(T).name(), new T()));\n\t\tmemcpy(*c, s_InitializationMap[typeid(T).name()], sizeof(T));\n\t}\n}\n*\/\n\nstruct MemoryBlock\t\/\/ڴϢ\n{\n\tvoid* m_Address;\n\tsize_t m_Size;\n\tMemoryBlock()\n\t{\n\t\tm_Address = NULL;\n\t\tm_Size = 0;\n\t}\n\tMemoryBlock(void* address, size_t size)\n\t{\n\t\tm_Address = address;\n\t\tm_Size = size;\n\t}\n};\n\nvoid CleanMemoryBlock(const MemoryBlock& mb)\n{\n\tmemset(mb.m_Address, NULL, mb.m_Size);\n}\n\nclass MemoryManager\t\t\/\/ڴջΨһģ\n{\nprotected:\n\tsize_t m_Top;\n\tvoid* m_Memory;\n\tstd::vector<MemoryBlock> m_MemoryBlocks;\n\tstd::vector<MemoryBlock> m_FreeMemoryBlocks;\npublic:\n\tstatic const size_t m_MemorySize = 0xffff;\n\tMemoryManager()\n\t{\n\t\tm_Memory = malloc(m_MemorySize);\n\t\tm_Top = 0;\n\/\/\t\tInitInitializationMap();\n\t}\n\n\t~MemoryManager()\n\t{\n\t\tfree(m_Memory);\n\t\tm_Memory = NULL;\n\/\/\t\tReleaseInitializationMap();\n\t}\n\n\ttemplate<typename T>\n\tbool ReuseMemory(T** dest)\n\t{\n\t\tif (m_FreeMemoryBlocks.size() == 0)\n\t\t\treturn false;\n\t\telse\n\t\t{\n\t\t\tfor (std::vector<MemoryBlock>::iterator i = m_FreeMemoryBlocks.begin(); i != m_FreeMemoryBlocks.end(); i += 1)\n\t\t\t{\n\t\t\t\tif ((*i).m_Size >= sizeof(T))\n\t\t\t\t{\n\t\t\t\t\tm_MemoryBlocks.push_back(MemoryBlock((*i).m_Address, sizeof(T)));\n\t\t\t\t\t*dest = (T*)((*i).m_Address);\n\t\t\t\t\tCleanMemoryBlock(m_MemoryBlocks[m_MemoryBlocks.size() - 1]);\n\/\/\t\t\t\t\tGetInitialization(dest);\n\t\t\t\t\tif ((*i).m_Size == sizeof(T))\n\t\t\t\t\t{\n\t\t\t\t\t\tm_FreeMemoryBlocks.erase(i);\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(*i).m_Address = *dest + sizeof(T);\n\t\t\t\t\t\t(*i).m_Size -= sizeof(T);\n\t\t\t\t\t}\n\t\t\t\t\treturn true;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\treturn false;\n\t}\n\n\ttemplate<typename T>\n\tbool ReuseMemory(std::pair<T**, size_t> c)\n\t{\n\t\tif (m_FreeMemoryBlocks.size() == 0)\n\t\t\treturn false;\n\t\telse\n\t\t{\n\t\t\tfor (vector<MemoryBlock>::iterator i = m_FreeMemoryBlocks.begin(); i != m_FreeMemoryBlocks.end(); i += 1)\n\t\t\t{\n\t\t\t\tif ((*i).m_Size >= c.second * sizeof(T))\n\t\t\t\t{\n\t\t\t\t\tm_MemoryBlocks.push_back(MemoryBlock((*i).m_Address, c.second * sizeof(T)));\n\t\t\t\t\t*c.first = (T*)((*i).m_Address);\n\t\t\t\t\tCleanMemoryBlock(m_MemoryBlocks[m_MemoryBlocks.size() - 1]);\n\/\/\t\t\t\t\tGetInitialization(dest);\n\t\t\t\t\tif ((*i).m_Size == c.second * sizeof(T))\n\t\t\t\t\t{\n\t\t\t\t\t\tm_FreeMemoryBlocks.erase(i);\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(*i).m_Address = *c.first + c.second * sizeof(T);\n\t\t\t\t\t\t(*i).m_Size -= c.second * sizeof(T);\n\t\t\t\t\t}\n\t\t\t\t\treturn true;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\treturn false;\n\t}\n\n\ttemplate<typename T>\n\tvoid NewObject(T** dest)\n\t{\n\t\tif (!ReuseMemory(dest))\n\t\t{\n\t\t\tm_MemoryBlocks.push_back(MemoryBlock((void*)((char*)m_Memory + m_Top), sizeof(T)));\n\t\t\t*dest = (T*)((char*)m_Memory + m_Top);\n\t\t\tCleanMemoryBlock(m_MemoryBlocks[m_MemoryBlocks.size() - 1]);\n\/\/\t\t\tGetInitialization(dest);\n\t\t\tm_Top += sizeof(T);\n\t\t}\n\t}\n\n\ttemplate<typename T, typename... TS>\n\tvoid NewObject(T** dest, TS**... ts)\n\t{\n\t\tNewObject(dest);\n\t\tNewObject(ts...);\n\t}\n\n\ttemplate<typename T>\n\tvoid NewObject(std::pair<T**, size_t> c)\n\t{\n\t\tif (!ReuseMemory(c))\n\t\t{\n\t\t\tm_MemoryBlocks.push_back(MemoryBlock(m_Memory + m_Top, c.second * sizeof(T)));\n\t\t\t*c.first = (T*)(m_Memory + m_Top);\n\t\t\tCleanMemoryBlock(m_MemoryBlocks[m_MemoryBlocks.size() - 1]);\n\/\/\t\t\tGetInitialization(dest);\n\t\t\tm_Top += c.second * sizeof(T);\n\t\t}\n\t}\n\n\ttemplate<typename T>\n\tbool ReleaseObject(T** dest)\n\t{\n\t\tfor (std::vector<MemoryBlock>::iterator i = m_MemoryBlocks.begin(); i != m_MemoryBlocks.end(); i += 1)\n\t\t{\n\t\t\tif ((*i).m_Address == *dest)\n\t\t\t{\n\t\t\t\tm_FreeMemoryBlocks.push_back(*i);\n\t\t\t\tm_MemoryBlocks.erase(i);\n\t\t\t\t*dest = NULL;\n\t\t\t\treturn true;\n\t\t\t}\n\t\t}\n\t\treturn false;\n\t}\n\n\ttemplate<typename T, typename... TS>\n\tbool ReleaseObject(T** dest, TS**... ts)\n\t{\n\t\treturn (Release(dest)&Release(ts...));\n\t}\n};\n\ntemplate<typename T>\nclass Pointer\t\t\t\/\/ʹڴָ\n{\nprotected:\n\tMemoryManager& m_MemoryManager;\n\tT* m_pContent;\npublic:\n\tPointer(MemoryManager& m) :m_MemoryManager(m),m_pContent(NULL){}\n\t~Pointer()\n\t{\n\t\tif (m_pContent)\n\t\t\tm_MemoryManager.ReleaseObject(&m_pContent);\n\t}\n\tvoid InitUnit()\n\t{\n\t\tm_MemoryManager.NewObject(&m_pContent);\n\t}\n\tvoid InitArray(size_t size)\n\t{\n\t\tm_MemoryManager.NewObject(make_pair(&m_pContent, size));\n\t}\n\tbool operator = (const Pointer&) = delete;\n\tT& operator * ()\n\t{\n\t\treturn *m_pContent;\n\t}\n};\n\ntemplate<typename T>\nclass UnitPointer :public Pointer<T>\t\/\/ָ򵥸ָ\n{\npublic:\n\tUnitPointer(MemoryManager& m) :Pointer(m)\n\t{\n\t\tPointer<T>::InitUnit();\n\t}\n};\n\ntemplate<typename T>\nclass ArrayPointer :public Pointer<T>\t\/\/ָγɵָ\n{\npublic:\n\tArrayPointer(MemoryManager& m,size_t size) :Pointer(m)\n\t{\n\t\tPointer<T>::InitArray(size);\n\t}\n};<commit_msg>solve the bug<commit_after>#pragma once\n#include \"stdafx.h\"\n\nstatic std::map<std::string,void*> s_InitializationMap;\t\t\/\/ʼֵ\n\ninline void InitInitializationMap()\t\t\t\/\/ʼʼֵ\n{\n\ts_InitializationMap[typeid(int).name()] = new int(0);\n\ts_InitializationMap[typeid(float).name()] = new float(0.00f);\n\ts_InitializationMap[typeid(double).name()] = new double(0.00f);\n\ts_InitializationMap[typeid(char).name()] = new char(char(0));\n\ts_InitializationMap[typeid(bool).name()] = new bool(false);\n}\n\ninline void ReleaseInitializationMap()\t\t\/\/ͷųʼֵ\n{\n\tfor (auto i : s_InitializationMap)\n\t{\n\t\tdelete i.second;\n\t}\n}\ntemplate <typename T>\ninline void GetInitialization(T** c)\t\t\/\/ȡ͵ijʼֵ\n{\n\tauto i = s_InitializationMap.find(typeid(*(*c)).name());\n\tif (i != s_InitializationMap.end())\n\t{\n\t\tmemcpy(*c, (*i).second, sizeof(T));\n\t}\n\telse\n\t{\n\t\ts_InitializationMap.insert(std::make_pair(typeid(T).name(), new T()));\n\t\tmemcpy(*c, s_InitializationMap[typeid(T).name()], sizeof(T));\n\t}\n}\n\n\nstruct MemoryBlock\t\/\/ڴϢ\n{\n\tvoid* m_Address;\n\tsize_t m_Size;\n\tMemoryBlock()\n\t{\n\t\tm_Address = NULL;\n\t\tm_Size = 0;\n\t}\n\tMemoryBlock(void* address, size_t size)\n\t{\n\t\tm_Address = address;\n\t\tm_Size = size;\n\t}\n};\n\nvoid CleanMemoryBlock(const MemoryBlock& mb)\n{\n\tmemset(mb.m_Address, NULL, mb.m_Size);\n}\n\nclass MemoryManager\t\t\/\/ڴջΨһģ\n{\nprotected:\n\tsize_t m_Top;\n\tvoid* m_Memory;\n\tstd::vector<MemoryBlock> m_MemoryBlocks;\n\tstd::vector<MemoryBlock> m_FreeMemoryBlocks;\npublic:\n\tstatic const size_t m_MemorySize = 0xffff;\n\tMemoryManager()\n\t{\n\t\tm_Memory = malloc(m_MemorySize);\n\t\tm_Top = 0;\n\t\tInitInitializationMap();\n\t}\n\n\t~MemoryManager()\n\t{\n\t\tfree(m_Memory);\n\t\tm_Memory = NULL;\n\t\tReleaseInitializationMap();\n\t}\n\n\ttemplate<typename T>\n\tbool ReuseMemory(T** dest)\n\t{\n\t\tif (m_FreeMemoryBlocks.size() == 0)\n\t\t\treturn false;\n\t\telse\n\t\t{\n\t\t\tfor (std::vector<MemoryBlock>::iterator i = m_FreeMemoryBlocks.begin(); i != m_FreeMemoryBlocks.end(); i += 1)\n\t\t\t{\n\t\t\t\tif ((*i).m_Size >= sizeof(T))\n\t\t\t\t{\n\t\t\t\t\tm_MemoryBlocks.push_back(MemoryBlock((*i).m_Address, sizeof(T)));\n\t\t\t\t\t*dest = (T*)((*i).m_Address);\n\t\t\t\t\tCleanMemoryBlock(m_MemoryBlocks[m_MemoryBlocks.size() - 1]);\n\t\t\t\t\tGetInitialization(dest);\n\t\t\t\t\tif ((*i).m_Size == sizeof(T))\n\t\t\t\t\t{\n\t\t\t\t\t\tm_FreeMemoryBlocks.erase(i);\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(*i).m_Address = *dest + sizeof(T);\n\t\t\t\t\t\t(*i).m_Size -= sizeof(T);\n\t\t\t\t\t}\n\t\t\t\t\treturn true;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\treturn false;\n\t}\n\n\ttemplate<typename T>\n\tbool ReuseMemory(std::pair<T**, size_t> c)\n\t{\n\t\tif (m_FreeMemoryBlocks.size() == 0)\n\t\t\treturn false;\n\t\telse\n\t\t{\n\t\t\tfor (vector<MemoryBlock>::iterator i = m_FreeMemoryBlocks.begin(); i != m_FreeMemoryBlocks.end(); i += 1)\n\t\t\t{\n\t\t\t\tif ((*i).m_Size >= c.second * sizeof(T))\n\t\t\t\t{\n\t\t\t\t\tm_MemoryBlocks.push_back(MemoryBlock((*i).m_Address, c.second * sizeof(T)));\n\t\t\t\t\t*c.first = (T*)((*i).m_Address);\n\t\t\t\t\tCleanMemoryBlock(m_MemoryBlocks[m_MemoryBlocks.size() - 1]);\n\t\t\t\t\tGetInitialization(dest);\n\t\t\t\t\tif ((*i).m_Size == c.second * sizeof(T))\n\t\t\t\t\t{\n\t\t\t\t\t\tm_FreeMemoryBlocks.erase(i);\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(*i).m_Address = *c.first + c.second * sizeof(T);\n\t\t\t\t\t\t(*i).m_Size -= c.second * sizeof(T);\n\t\t\t\t\t}\n\t\t\t\t\treturn true;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\treturn false;\n\t}\n\n\ttemplate<typename T>\n\tvoid NewObject(T** dest)\n\t{\n\t\tif (!ReuseMemory(dest))\n\t\t{\n\t\t\tm_MemoryBlocks.push_back(MemoryBlock((void*)((char*)m_Memory + m_Top), sizeof(T)));\n\t\t\t*dest = (T*)((char*)m_Memory + m_Top);\n\t\t\tCleanMemoryBlock(m_MemoryBlocks[m_MemoryBlocks.size() - 1]);\n\t\t\tGetInitialization(dest);\n\t\t\tm_Top += sizeof(T);\n\t\t}\n\t}\n\n\ttemplate<typename T, typename... TS>\n\tvoid NewObject(T** dest, TS**... ts)\n\t{\n\t\tNewObject(dest);\n\t\tNewObject(ts...);\n\t}\n\n\ttemplate<typename T>\n\tvoid NewObject(std::pair<T**, size_t> c)\n\t{\n\t\tif (!ReuseMemory(c))\n\t\t{\n\t\t\tm_MemoryBlocks.push_back(MemoryBlock(m_Memory + m_Top, c.second * sizeof(T)));\n\t\t\t*c.first = (T*)(m_Memory + m_Top);\n\t\t\tCleanMemoryBlock(m_MemoryBlocks[m_MemoryBlocks.size() - 1]);\n\t\t\tGetInitialization(dest);\n\t\t\tm_Top += c.second * sizeof(T);\n\t\t}\n\t}\n\n\ttemplate<typename T>\n\tbool ReleaseObject(T** dest)\n\t{\n\t\tfor (std::vector<MemoryBlock>::iterator i = m_MemoryBlocks.begin(); i != m_MemoryBlocks.end(); i += 1)\n\t\t{\n\t\t\tif ((*i).m_Address == *dest)\n\t\t\t{\n\t\t\t\tm_FreeMemoryBlocks.push_back(*i);\n\t\t\t\tm_MemoryBlocks.erase(i);\n\t\t\t\t*dest = NULL;\n\t\t\t\treturn true;\n\t\t\t}\n\t\t}\n\t\treturn false;\n\t}\n\n\ttemplate<typename T, typename... TS>\n\tbool ReleaseObject(T** dest, TS**... ts)\n\t{\n\t\treturn (Release(dest)&Release(ts...));\n\t}\n};\n\ntemplate<typename T>\nclass Pointer\t\t\t\/\/ʹڴָ\n{\nprotected:\n\tMemoryManager& m_MemoryManager;\n\tT* m_pContent;\npublic:\n\tPointer(MemoryManager& m) :m_MemoryManager(m),m_pContent(NULL){}\n\t~Pointer()\n\t{\n\t\tif (m_pContent)\n\t\t\tm_MemoryManager.ReleaseObject(&m_pContent);\n\t}\n\tvoid InitUnit()\n\t{\n\t\tm_MemoryManager.NewObject(&m_pContent);\n\t}\n\tvoid InitArray(size_t size)\n\t{\n\t\tm_MemoryManager.NewObject(make_pair(&m_pContent, size));\n\t}\n\tbool operator = (const Pointer&) = delete;\n\tT& operator * ()\n\t{\n\t\treturn *m_pContent;\n\t}\n};\n\ntemplate<typename T>\nclass UnitPointer :public Pointer<T>\t\/\/ָ򵥸ָ\n{\npublic:\n\tUnitPointer(MemoryManager& m) :Pointer(m)\n\t{\n\t\tPointer<T>::InitUnit();\n\t}\n};\n\ntemplate<typename T>\nclass ArrayPointer :public Pointer<T>\t\/\/ָγɵָ\n{\npublic:\n\tArrayPointer(MemoryManager& m,size_t size) :Pointer(m)\n\t{\n\t\tPointer<T>::InitArray(size);\n\t}\n};<|endoftext|>"} {"text":"<commit_before>\/******************************************************************************\\\n* File: lexers.cpp\n* Purpose: Implementation of wxExLexers classes\n* Author: Anton van Wezenbeek\n* RCS-ID: $Id$\n*\n* Copyright (c) 2008-2009 Anton van Wezenbeek\n* All rights are reserved. Reproduction in whole or part is prohibited\n* without the written consent of the copyright owner.\n\\******************************************************************************\/\n\n#include <wx\/config.h>\n#include <wx\/tokenzr.h>\n#include <wx\/stc\/stc.h>\n#include <wx\/textfile.h>\n#include <wx\/extension\/lexers.h>\n#include <wx\/extension\/util.h> \/\/ for wxExMatchesOneOf\n\nwxExLexers::wxExLexers(const wxFileName& filename)\n : m_FileName(filename)\n{\n}\n\nconst wxString wxExLexers::BuildWildCards(const wxFileName& filename) const\n{\n const wxString allfiles_wildcard =\n _(\"All Files\") + wxString::Format(\" (%s)|%s\",\n wxFileSelectorDefaultWildcardStr,\n wxFileSelectorDefaultWildcardStr);\n\n wxString wildcards = allfiles_wildcard;\n\n \/\/ Build the wildcard string using all available lexers.\n for (\n std::vector<wxExLexer>::const_iterator it = m_Lexers.begin();\n it != m_Lexers.end();\n ++it)\n {\n if (!it->GetAssociations().empty())\n {\n const wxString wildcard =\n it->GetScintillaLexer() +\n \" (\" + it->GetAssociations() + \") |\" +\n it->GetAssociations();\n\n if (wxExMatchesOneOf(filename, it->GetAssociations()))\n {\n wildcards = wildcard + \"|\" + wildcards;\n }\n else\n {\n wildcards = wildcards + \"|\" + wildcard;\n }\n }\n }\n\n return wildcards;\n}\n\nconst wxExLexer wxExLexers::FindByFileName(const wxFileName& filename) const\n{\n if (!filename.IsOk())\n {\n return wxExLexer();\n }\n\n for (\n std::vector<wxExLexer>::const_iterator it = m_Lexers.begin();\n it != m_Lexers.end();\n ++it)\n {\n if (wxExMatchesOneOf(filename, it->GetAssociations()))\n {\n return *it;\n }\n }\n\n return wxExLexer();\n}\n\nconst wxExLexer wxExLexers::FindByName(\n const wxString& name,\n bool fail_if_not_found) const\n{\n for (\n std::vector<wxExLexer>::const_iterator it = m_Lexers.begin();\n it != m_Lexers.end();\n ++it)\n {\n if (name == it->GetScintillaLexer())\n {\n return *it;\n }\n }\n\n if (!m_Lexers.empty() && fail_if_not_found)\n {\n wxFAIL;\n }\n\n return wxExLexer();\n}\n\nconst wxExLexer wxExLexers::FindByText(const wxString& text) const\n{\n \/\/ Add automatic lexers if text starts with some special tokens.\n const wxString text_lowercase = text.Lower();\n\n if (text_lowercase.StartsWith(\"#\") ||\n \/\/ .po files that do not have comment headers, start with msgid, so set them\n text_lowercase.StartsWith(\"msgid\"))\n {\n return FindByName(\"bash\", false); \/\/ don't show error\n }\n else if (text_lowercase.StartsWith(\"<html>\") ||\n text_lowercase.StartsWith(\"<?php\"))\n {\n return FindByName(\"hypertext\", false); \/\/ don't show error\n }\n else if (text_lowercase.StartsWith(\"<?xml\"))\n {\n return FindByName(\"xml\", false); \/\/ don't show error\n }\n \/\/ cpp files like #include <map> really do not have a .h extension (e.g. \/usr\/include\/c++\/3.3.5\/map)\n \/\/ so add here.\n else if (text_lowercase.StartsWith(\"\/\/\"))\n {\n return FindByName(\"cpp\", false); \/\/ don't show error\n }\n\n return wxExLexer();\n}\n\nconst wxString wxExLexers::GetLexerAssociations() const\n{\n wxString text;\n\n for (\n std::vector<wxExLexer>::const_iterator it = m_Lexers.begin();\n it != m_Lexers.end();\n ++it)\n {\n if (!it->GetAssociations().empty())\n {\n if (!text.empty())\n {\n text += \",\";\n }\n\n text += it->GetAssociations();\n }\n }\n\n return text;\n}\n\nconst wxString wxExLexers::ParseTagColourings(const wxXmlNode* node) const\n{\n wxString text;\n\n wxXmlNode* child = node->GetChildren();\n\n while (child)\n {\n if (child->GetName() == \"colouring\")\n {\n text +=\n child->GetAttribute(\"no\", \"0\") + \"=\" +\n child->GetNodeContent().Strip(wxString::both) + wxTextFile::GetEOL();\n }\n else if (child->GetName() == \"comment\")\n {\n \/\/ Ignore comments.\n }\n else\n {\n wxLogError(\"Undefined colourings tag: %s on: %d\",\n child->GetName().c_str(), child->GetLineNumber());\n }\n\n child = child->GetNext();\n }\n\n return text;\n}\n\nvoid wxExLexers::ParseTagGlobal(const wxXmlNode* node)\n{\n wxXmlNode* child = node->GetChildren();\n\n while (child)\n {\n if (child->GetName() == \"comment\")\n {\n \/\/ Ignore comments.\n }\n else if (child->GetName() == \"hex\")\n {\n m_StylesHex.push_back(\n child->GetAttribute(\"no\", \"0\") + \"=\" +\n child->GetNodeContent().Strip(wxString::both));\n }\n else if (child->GetName() == \"indicator\")\n {\n m_Indicators.insert(std::make_pair(\n atoi(child->GetAttribute(\"no\", \"0\").c_str()),\n atoi(child->GetNodeContent().Strip(wxString::both).c_str())));\n }\n else if (child->GetName() == \"marker\")\n {\n const wxExMarker marker(ParseTagMarker(\n child->GetAttribute(\"no\", \"0\"),\n child->GetNodeContent().Strip(wxString::both)));\n\n if (marker.GetMarkerNumber() < wxSTC_STYLE_MAX &&\n marker.GetMarkerSymbol() < wxSTC_STYLE_MAX)\n {\n m_Markers.push_back(marker);\n }\n else\n {\n wxLogError(\"Illegal marker number: %d or symbol: %d on: %d\",\n marker.GetMarkerNumber(),\n marker.GetMarkerSymbol(),\n child->GetLineNumber());\n }\n }\n else if (child->GetName() == \"style\")\n {\n m_Styles.push_back(\n child->GetAttribute(\"no\", \"0\") + \"=\" +\n child->GetNodeContent().Strip(wxString::both));\n }\n else\n {\n wxLogError(\"Undefined global tag: %s on: %d\",\n child->GetName().c_str(), child->GetLineNumber());\n }\n\n child = child->GetNext();\n }\n}\n\nconst wxExLexer wxExLexers::ParseTagLexer(const wxXmlNode* node) const\n{\n wxExLexer lexer;\n lexer.m_ScintillaLexer = node->GetAttribute(\"name\", \"\");\n lexer.m_Associations = node->GetAttribute(\"extensions\", \"\");\n\n wxXmlNode *child = node->GetChildren();\n\n while (child)\n {\n if (child->GetName() == \"colourings\")\n {\n lexer.m_Colourings = ParseTagColourings(child);\n }\n else if (child->GetName() == \"keywords\")\n {\n if (!lexer.SetKeywords(child->GetNodeContent().Strip(wxString::both)))\n {\n wxLogError(\"Keywords could not be set on: %d\", child->GetLineNumber());\n }\n }\n else if (child->GetName() == \"properties\")\n {\n lexer.m_Properties = ParseTagProperties(child);\n }\n else if (child->GetName() == \"comments\")\n {\n lexer.m_CommentBegin = child->GetAttribute(\"begin1\", \"\");\n lexer.m_CommentEnd = child->GetAttribute(\"end1\", \"\");\n lexer.m_CommentBegin2 = child->GetAttribute(\"begin2\", \"\");\n lexer.m_CommentEnd2 = child->GetAttribute(\"end2\", \"\");\n }\n else if (child->GetName() == \"comment\")\n {\n \/\/ Ignore comments.\n }\n else\n {\n wxLogError(\"Undefined lexer tag: %s on: %d\",\n child->GetName().c_str(), child->GetLineNumber());\n }\n\n child = child->GetNext();\n }\n\n return lexer;\n}\n\nconst wxExMarker wxExLexers::ParseTagMarker(\n const wxString& number,\n const wxString& props) const\n{\n wxStringTokenizer prop_fields(props, \",\");\n\n const wxString symbol = prop_fields.GetNextToken();\n\n wxColour foreground;\n wxColour background;\n\n if (prop_fields.HasMoreTokens())\n {\n foreground = prop_fields.GetNextToken();\n\n if (prop_fields.HasMoreTokens())\n {\n background = prop_fields.GetNextToken();\n }\n }\n\n const int no = atoi(number.c_str());\n const int symbol_no = atoi(symbol.c_str());\n\n if (no <= wxSTC_MARKER_MAX && symbol_no <= wxSTC_MARKER_MAX)\n {\n return wxExMarker(no, symbol_no, foreground, background);\n }\n else\n {\n wxLogError(\"Illegal marker number: %d or symbol: %d\", no, symbol_no);\n return wxExMarker(0, 0, foreground, background);\n }\n}\n\nconst wxString wxExLexers::ParseTagProperties(const wxXmlNode* node) const\n{\n wxString text;\n\n wxXmlNode *child = node->GetChildren();\n\n while (child)\n {\n if (child->GetName() == \"property\")\n {\n text +=\n child->GetAttribute(\"name\", \"0\") + \"=\" +\n child->GetNodeContent().Strip(wxString::both) + wxTextFile::GetEOL();\n }\n else if (child->GetName() == \"comment\")\n {\n \/\/ Ignore comments.\n }\n else\n {\n wxLogError(\"Undefined properties tag: %s on %d\",\n child->GetName().c_str(), child->GetLineNumber());\n }\n\n child = child->GetNext();\n }\n\n return text;\n}\n\nvoid wxExLexers::Read()\n{\n \/\/ This test is to prevent showing an error if the lexers file does not exist,\n \/\/ as this is not required.\n if (!m_FileName.FileExists())\n {\n return;\n } \n\n wxXmlDocument doc;\n\n if (!doc.Load(m_FileName.GetFullPath()))\n {\n return;\n }\n\n \/\/ Initialize members.\n m_Indicators.clear();\n m_Lexers.clear();\n m_Markers.clear();\n m_Styles.clear();\n m_StylesHex.clear();\n\n wxXmlNode* child = doc.GetRoot()->GetChildren();\n\n while (child)\n {\n if (child->GetName() == \"global\")\n {\n ParseTagGlobal(child);\n }\n else if (child->GetName() == \"lexer\")\n {\n const wxExLexer& lexer = ParseTagLexer(child);\n\n if (!lexer.GetScintillaLexer().empty())\n {\n if (lexer.GetScintillaLexer() == \"hypertext\")\n {\n \/\/ As our lexers.xml files cannot use xml comments,\n \/\/ add them here.\n wxExLexer l(lexer);\n l.m_CommentBegin = \"<!--\";\n l.m_CommentEnd = \"-->\";\n m_Lexers.push_back(l);\n }\n else\n {\n m_Lexers.push_back(lexer);\n }\n }\n }\n\n child = child->GetNext();\n }\n\n \/\/ Initialize the config.\n if (!wxConfigBase::Get()->Exists(_(\"In files\")))\n {\n wxConfigBase::Get()->Write(_(\"In files\"), GetLexerAssociations());\n }\n\n if (!wxConfigBase::Get()->Exists(_(\"Add what\")))\n {\n wxConfigBase::Get()->Read(_(\"Add what\"), GetLexerAssociations());\n }\n}\n\nbool wxExLexers::ShowDialog(\n wxWindow* parent,\n wxExLexer& lexer,\n const wxString& caption) const\n{\n wxArrayString aChoices;\n int choice = -1;\n int index = 0;\n\n for (\n std::vector<wxExLexer>::const_iterator it = m_Lexers.begin();\n it != m_Lexers.end();\n ++it)\n {\n aChoices.Add(it->GetScintillaLexer());\n\n if (lexer.GetScintillaLexer() == it->GetScintillaLexer())\n {\n choice = index;\n }\n\n index++;\n }\n\n \/\/ Add the <none> lexer (index is already incremented).\n const wxString no_lexer = _(\"<none>\");\n\n aChoices.Add(no_lexer);\n\n \/\/ And set the choice if we do not have a lexer.\n if (lexer.GetScintillaLexer().empty())\n {\n choice = index;\n }\n \n wxSingleChoiceDialog dlg(parent, _(\"Input\") + \":\", caption, aChoices);\n \n if (choice != -1)\n {\n dlg.SetSelection(choice);\n }\n\n if (dlg.ShowModal() == wxID_CANCEL)\n {\n return false;\n }\n\n const wxString sel = dlg.GetStringSelection();\n\n if (sel == no_lexer)\n {\n lexer = wxExLexer();\n }\n else\n {\n lexer = FindByName(sel);\n }\n\n return true;\n}\n<commit_msg>fixed error Read into Write<commit_after>\/******************************************************************************\\\n* File: lexers.cpp\n* Purpose: Implementation of wxExLexers classes\n* Author: Anton van Wezenbeek\n* RCS-ID: $Id$\n*\n* Copyright (c) 2008-2009 Anton van Wezenbeek\n* All rights are reserved. Reproduction in whole or part is prohibited\n* without the written consent of the copyright owner.\n\\******************************************************************************\/\n\n#include <wx\/config.h>\n#include <wx\/tokenzr.h>\n#include <wx\/stc\/stc.h>\n#include <wx\/textfile.h>\n#include <wx\/extension\/lexers.h>\n#include <wx\/extension\/util.h> \/\/ for wxExMatchesOneOf\n\nwxExLexers::wxExLexers(const wxFileName& filename)\n : m_FileName(filename)\n{\n}\n\nconst wxString wxExLexers::BuildWildCards(const wxFileName& filename) const\n{\n const wxString allfiles_wildcard =\n _(\"All Files\") + wxString::Format(\" (%s)|%s\",\n wxFileSelectorDefaultWildcardStr,\n wxFileSelectorDefaultWildcardStr);\n\n wxString wildcards = allfiles_wildcard;\n\n \/\/ Build the wildcard string using all available lexers.\n for (\n std::vector<wxExLexer>::const_iterator it = m_Lexers.begin();\n it != m_Lexers.end();\n ++it)\n {\n if (!it->GetAssociations().empty())\n {\n const wxString wildcard =\n it->GetScintillaLexer() +\n \" (\" + it->GetAssociations() + \") |\" +\n it->GetAssociations();\n\n if (wxExMatchesOneOf(filename, it->GetAssociations()))\n {\n wildcards = wildcard + \"|\" + wildcards;\n }\n else\n {\n wildcards = wildcards + \"|\" + wildcard;\n }\n }\n }\n\n return wildcards;\n}\n\nconst wxExLexer wxExLexers::FindByFileName(const wxFileName& filename) const\n{\n if (!filename.IsOk())\n {\n return wxExLexer();\n }\n\n for (\n std::vector<wxExLexer>::const_iterator it = m_Lexers.begin();\n it != m_Lexers.end();\n ++it)\n {\n if (wxExMatchesOneOf(filename, it->GetAssociations()))\n {\n return *it;\n }\n }\n\n return wxExLexer();\n}\n\nconst wxExLexer wxExLexers::FindByName(\n const wxString& name,\n bool fail_if_not_found) const\n{\n for (\n std::vector<wxExLexer>::const_iterator it = m_Lexers.begin();\n it != m_Lexers.end();\n ++it)\n {\n if (name == it->GetScintillaLexer())\n {\n return *it;\n }\n }\n\n if (!m_Lexers.empty() && fail_if_not_found)\n {\n wxFAIL;\n }\n\n return wxExLexer();\n}\n\nconst wxExLexer wxExLexers::FindByText(const wxString& text) const\n{\n \/\/ Add automatic lexers if text starts with some special tokens.\n const wxString text_lowercase = text.Lower();\n\n if (text_lowercase.StartsWith(\"#\") ||\n \/\/ .po files that do not have comment headers, start with msgid, so set them\n text_lowercase.StartsWith(\"msgid\"))\n {\n return FindByName(\"bash\", false); \/\/ don't show error\n }\n else if (text_lowercase.StartsWith(\"<html>\") ||\n text_lowercase.StartsWith(\"<?php\"))\n {\n return FindByName(\"hypertext\", false); \/\/ don't show error\n }\n else if (text_lowercase.StartsWith(\"<?xml\"))\n {\n return FindByName(\"xml\", false); \/\/ don't show error\n }\n \/\/ cpp files like #include <map> really do not have a .h extension (e.g. \/usr\/include\/c++\/3.3.5\/map)\n \/\/ so add here.\n else if (text_lowercase.StartsWith(\"\/\/\"))\n {\n return FindByName(\"cpp\", false); \/\/ don't show error\n }\n\n return wxExLexer();\n}\n\nconst wxString wxExLexers::GetLexerAssociations() const\n{\n wxString text;\n\n for (\n std::vector<wxExLexer>::const_iterator it = m_Lexers.begin();\n it != m_Lexers.end();\n ++it)\n {\n if (!it->GetAssociations().empty())\n {\n if (!text.empty())\n {\n text += \",\";\n }\n\n text += it->GetAssociations();\n }\n }\n\n return text;\n}\n\nconst wxString wxExLexers::ParseTagColourings(const wxXmlNode* node) const\n{\n wxString text;\n\n wxXmlNode* child = node->GetChildren();\n\n while (child)\n {\n if (child->GetName() == \"colouring\")\n {\n text +=\n child->GetAttribute(\"no\", \"0\") + \"=\" +\n child->GetNodeContent().Strip(wxString::both) + wxTextFile::GetEOL();\n }\n else if (child->GetName() == \"comment\")\n {\n \/\/ Ignore comments.\n }\n else\n {\n wxLogError(\"Undefined colourings tag: %s on: %d\",\n child->GetName().c_str(), child->GetLineNumber());\n }\n\n child = child->GetNext();\n }\n\n return text;\n}\n\nvoid wxExLexers::ParseTagGlobal(const wxXmlNode* node)\n{\n wxXmlNode* child = node->GetChildren();\n\n while (child)\n {\n if (child->GetName() == \"comment\")\n {\n \/\/ Ignore comments.\n }\n else if (child->GetName() == \"hex\")\n {\n m_StylesHex.push_back(\n child->GetAttribute(\"no\", \"0\") + \"=\" +\n child->GetNodeContent().Strip(wxString::both));\n }\n else if (child->GetName() == \"indicator\")\n {\n m_Indicators.insert(std::make_pair(\n atoi(child->GetAttribute(\"no\", \"0\").c_str()),\n atoi(child->GetNodeContent().Strip(wxString::both).c_str())));\n }\n else if (child->GetName() == \"marker\")\n {\n const wxExMarker marker(ParseTagMarker(\n child->GetAttribute(\"no\", \"0\"),\n child->GetNodeContent().Strip(wxString::both)));\n\n if (marker.GetMarkerNumber() < wxSTC_STYLE_MAX &&\n marker.GetMarkerSymbol() < wxSTC_STYLE_MAX)\n {\n m_Markers.push_back(marker);\n }\n else\n {\n wxLogError(\"Illegal marker number: %d or symbol: %d on: %d\",\n marker.GetMarkerNumber(),\n marker.GetMarkerSymbol(),\n child->GetLineNumber());\n }\n }\n else if (child->GetName() == \"style\")\n {\n m_Styles.push_back(\n child->GetAttribute(\"no\", \"0\") + \"=\" +\n child->GetNodeContent().Strip(wxString::both));\n }\n else\n {\n wxLogError(\"Undefined global tag: %s on: %d\",\n child->GetName().c_str(), child->GetLineNumber());\n }\n\n child = child->GetNext();\n }\n}\n\nconst wxExLexer wxExLexers::ParseTagLexer(const wxXmlNode* node) const\n{\n wxExLexer lexer;\n lexer.m_ScintillaLexer = node->GetAttribute(\"name\", \"\");\n lexer.m_Associations = node->GetAttribute(\"extensions\", \"\");\n\n wxXmlNode *child = node->GetChildren();\n\n while (child)\n {\n if (child->GetName() == \"colourings\")\n {\n lexer.m_Colourings = ParseTagColourings(child);\n }\n else if (child->GetName() == \"keywords\")\n {\n if (!lexer.SetKeywords(child->GetNodeContent().Strip(wxString::both)))\n {\n wxLogError(\"Keywords could not be set on: %d\", child->GetLineNumber());\n }\n }\n else if (child->GetName() == \"properties\")\n {\n lexer.m_Properties = ParseTagProperties(child);\n }\n else if (child->GetName() == \"comments\")\n {\n lexer.m_CommentBegin = child->GetAttribute(\"begin1\", \"\");\n lexer.m_CommentEnd = child->GetAttribute(\"end1\", \"\");\n lexer.m_CommentBegin2 = child->GetAttribute(\"begin2\", \"\");\n lexer.m_CommentEnd2 = child->GetAttribute(\"end2\", \"\");\n }\n else if (child->GetName() == \"comment\")\n {\n \/\/ Ignore comments.\n }\n else\n {\n wxLogError(\"Undefined lexer tag: %s on: %d\",\n child->GetName().c_str(), child->GetLineNumber());\n }\n\n child = child->GetNext();\n }\n\n return lexer;\n}\n\nconst wxExMarker wxExLexers::ParseTagMarker(\n const wxString& number,\n const wxString& props) const\n{\n wxStringTokenizer prop_fields(props, \",\");\n\n const wxString symbol = prop_fields.GetNextToken();\n\n wxColour foreground;\n wxColour background;\n\n if (prop_fields.HasMoreTokens())\n {\n foreground = prop_fields.GetNextToken();\n\n if (prop_fields.HasMoreTokens())\n {\n background = prop_fields.GetNextToken();\n }\n }\n\n const int no = atoi(number.c_str());\n const int symbol_no = atoi(symbol.c_str());\n\n if (no <= wxSTC_MARKER_MAX && symbol_no <= wxSTC_MARKER_MAX)\n {\n return wxExMarker(no, symbol_no, foreground, background);\n }\n else\n {\n wxLogError(\"Illegal marker number: %d or symbol: %d\", no, symbol_no);\n return wxExMarker(0, 0, foreground, background);\n }\n}\n\nconst wxString wxExLexers::ParseTagProperties(const wxXmlNode* node) const\n{\n wxString text;\n\n wxXmlNode *child = node->GetChildren();\n\n while (child)\n {\n if (child->GetName() == \"property\")\n {\n text +=\n child->GetAttribute(\"name\", \"0\") + \"=\" +\n child->GetNodeContent().Strip(wxString::both) + wxTextFile::GetEOL();\n }\n else if (child->GetName() == \"comment\")\n {\n \/\/ Ignore comments.\n }\n else\n {\n wxLogError(\"Undefined properties tag: %s on %d\",\n child->GetName().c_str(), child->GetLineNumber());\n }\n\n child = child->GetNext();\n }\n\n return text;\n}\n\nvoid wxExLexers::Read()\n{\n \/\/ This test is to prevent showing an error if the lexers file does not exist,\n \/\/ as this is not required.\n if (!m_FileName.FileExists())\n {\n return;\n } \n\n wxXmlDocument doc;\n\n if (!doc.Load(m_FileName.GetFullPath()))\n {\n return;\n }\n\n \/\/ Initialize members.\n m_Indicators.clear();\n m_Lexers.clear();\n m_Markers.clear();\n m_Styles.clear();\n m_StylesHex.clear();\n\n wxXmlNode* child = doc.GetRoot()->GetChildren();\n\n while (child)\n {\n if (child->GetName() == \"global\")\n {\n ParseTagGlobal(child);\n }\n else if (child->GetName() == \"lexer\")\n {\n const wxExLexer& lexer = ParseTagLexer(child);\n\n if (!lexer.GetScintillaLexer().empty())\n {\n if (lexer.GetScintillaLexer() == \"hypertext\")\n {\n \/\/ As our lexers.xml files cannot use xml comments,\n \/\/ add them here.\n wxExLexer l(lexer);\n l.m_CommentBegin = \"<!--\";\n l.m_CommentEnd = \"-->\";\n m_Lexers.push_back(l);\n }\n else\n {\n m_Lexers.push_back(lexer);\n }\n }\n }\n\n child = child->GetNext();\n }\n\n \/\/ Initialize the config.\n if (!wxConfigBase::Get()->Exists(_(\"In files\")))\n {\n wxConfigBase::Get()->Write(_(\"In files\"), GetLexerAssociations());\n }\n\n if (!wxConfigBase::Get()->Exists(_(\"Add what\")))\n {\n wxConfigBase::Get()->Write(_(\"Add what\"), GetLexerAssociations());\n }\n}\n\nbool wxExLexers::ShowDialog(\n wxWindow* parent,\n wxExLexer& lexer,\n const wxString& caption) const\n{\n wxArrayString aChoices;\n int choice = -1;\n int index = 0;\n\n for (\n std::vector<wxExLexer>::const_iterator it = m_Lexers.begin();\n it != m_Lexers.end();\n ++it)\n {\n aChoices.Add(it->GetScintillaLexer());\n\n if (lexer.GetScintillaLexer() == it->GetScintillaLexer())\n {\n choice = index;\n }\n\n index++;\n }\n\n \/\/ Add the <none> lexer (index is already incremented).\n const wxString no_lexer = _(\"<none>\");\n\n aChoices.Add(no_lexer);\n\n \/\/ And set the choice if we do not have a lexer.\n if (lexer.GetScintillaLexer().empty())\n {\n choice = index;\n }\n \n wxSingleChoiceDialog dlg(parent, _(\"Input\") + \":\", caption, aChoices);\n \n if (choice != -1)\n {\n dlg.SetSelection(choice);\n }\n\n if (dlg.ShowModal() == wxID_CANCEL)\n {\n return false;\n }\n\n const wxString sel = dlg.GetStringSelection();\n\n if (sel == no_lexer)\n {\n lexer = wxExLexer();\n }\n else\n {\n lexer = FindByName(sel);\n }\n\n return true;\n}\n<|endoftext|>"} {"text":"<commit_before>\/**\n * @{\n * \\copyright TU Dresden ZIH. All rights reserved.\n * \\authors Martin Flehmig, Marc Hartung, Marcus Walther\n * \\date Oct 2015\n *\/\n\n#ifndef INCLUDE_STDAFX_HPP_\n#define INCLUDE_STDAFX_HPP_\n\n\n#include <cstring>\n#include <cmath>\n\n#include <string>\n#include <sstream>\n#include <fstream>\n#include <iostream>\n\n#include <list>\n#include <deque>\n#include <vector>\n#include <map>\n#include <set>\n#include <unordered_map>\n#include <tuple>\n#include <memory>\n#include <stdexcept>\n#include <iomanip>\n#include <limits>\n#include <assert.h>\n#include <type_traits>\n#include <utility>\n\nusing std::list;\nusing std::deque;\nusing std::unordered_map;\nusing std::map;\nusing std::tuple;\nusing std::pair;\nusing std::vector;\nusing std::set;\nusing std::copy;\nusing std::shared_ptr;\nusing std::weak_ptr;\nusing std::ios;\nusing std::iostream;\nusing std::ostream;\nusing std::fstream;\nusing std::stringstream;\nusing std::cerr;\nusing std::cout;\nusing std::endl;\nusing std::exception;\nusing std::runtime_error;\nusing std::to_string;\nusing std::signbit;\nusing std::get;\nusing std::function;\nusing std::make_tuple;\nusing std::max;\nusing std::string;\n\n#include \"BasicTypedefs.hpp\"\n#include \"util\/Logger.hpp\"\n#include \"util\/StringHelper.hpp\"\n\n#endif \/* INCLUDE_STDAFX_HPP_ *\/\n\/**\n * @}\n *\/\n<commit_msg>Make make_shared usable without namespace<commit_after>\/**\n * @{\n * \\copyright TU Dresden ZIH. All rights reserved.\n * \\authors Martin Flehmig, Marc Hartung, Marcus Walther\n * \\date Oct 2015\n *\/\n\n#ifndef INCLUDE_STDAFX_HPP_\n#define INCLUDE_STDAFX_HPP_\n\n\n#include <cstring>\n#include <cmath>\n\n#include <string>\n#include <sstream>\n#include <fstream>\n#include <iostream>\n\n#include <list>\n#include <deque>\n#include <vector>\n#include <map>\n#include <set>\n#include <unordered_map>\n#include <tuple>\n#include <memory>\n#include <stdexcept>\n#include <iomanip>\n#include <limits>\n#include <assert.h>\n#include <type_traits>\n#include <utility>\n\nusing std::list;\nusing std::deque;\nusing std::unordered_map;\nusing std::map;\nusing std::tuple;\nusing std::pair;\nusing std::vector;\nusing std::set;\nusing std::copy;\nusing std::shared_ptr;\nusing std::weak_ptr;\nusing std::ios;\nusing std::iostream;\nusing std::ostream;\nusing std::fstream;\nusing std::stringstream;\nusing std::cerr;\nusing std::cout;\nusing std::endl;\nusing std::exception;\nusing std::runtime_error;\nusing std::to_string;\nusing std::signbit;\nusing std::get;\nusing std::function;\nusing std::make_tuple;\nusing std::max;\nusing std::string;\nusing std::make_shared;\n\n#include \"BasicTypedefs.hpp\"\n#include \"util\/Logger.hpp\"\n#include \"util\/StringHelper.hpp\"\n\n#endif \/* INCLUDE_STDAFX_HPP_ *\/\n\/**\n * @}\n *\/\n<|endoftext|>"} {"text":"<commit_before>\/\/=======================================================================\n\/\/ Copyright Baptiste Wicht 2011-2014.\n\/\/ Distributed under the MIT License.\n\/\/ (See accompanying file LICENSE or copy at\n\/\/ http:\/\/opensource.org\/licenses\/MIT)\n\/\/=======================================================================\n\n#ifndef STRUCT_H\n#define STRUCT_H\n\n#include <memory>\n#include <string>\n#include <vector>\n\nnamespace eddic {\n\nclass Type;\n\n\/*!\n * \\class Member\n * \\brief A member of a struct. \n *\/\nstruct Member {\n std::string name;\n std::shared_ptr<const Type> type;\n\n Member(const std::string& n, std::shared_ptr<const Type> t);\n\n \/*!\n * Increment the reference counter of the member. \n *\/\n void add_reference();\n \n \/*!\n * Return the reference counter of the member. \n * \\return The reference counter of the member. \n *\/\n unsigned int get_references();\n\n private:\n unsigned int references = 0;\n};\n\n\/*!\n * \\class Struct\n * \\brief A structure entry in the function table. \n *\/\nstruct Struct {\n std::string name;\n std::vector<Member> members;\n std::shared_ptr<const Type> parent_type;\n \n Struct(const std::string& n);\n\n \/*!\n * Indicates if the specified member exists in this structure. \n * \\param name The name of the member to search for. \n * \\return true if the member exists, otherwise false. \n *\/\n bool member_exists(const std::string& name);\n \n \/*!\n * Return the member with the specified name. \n * \\param name The name of the member to search for. \n * \\return A pointer to the member with the given name. \n *\/\n Member& operator[](const std::string& name);\n\n \/*!\n * Increment the reference counter of the structure. \n *\/\n void add_reference();\n \n \/*!\n * Return the reference counter of the member. \n * \\return The reference counter of the member. \n *\/\n unsigned int get_references();\n\n private:\n unsigned int references = 0;\n};\n\n} \/\/end of eddic\n\n#endif\n<commit_msg>Cleanup<commit_after>\/\/=======================================================================\n\/\/ Copyright Baptiste Wicht 2011-2014.\n\/\/ Distributed under the MIT License.\n\/\/ (See accompanying file LICENSE or copy at\n\/\/ http:\/\/opensource.org\/licenses\/MIT)\n\/\/=======================================================================\n\n#ifndef STRUCT_H\n#define STRUCT_H\n\n#include <memory>\n#include <string>\n#include <vector>\n\nnamespace eddic {\n\nclass Type;\n\n\/*!\n * \\class Member\n * \\brief A member of a struct. \n *\/\nstruct Member {\n std::string name;\n std::shared_ptr<const Type> type;\n\n Member(const std::string& n, std::shared_ptr<const Type> t);\n\n Member(const Member& rhs) = default;\n Member& operator=(const Member& rhs) = default;\n\n Member(Member&& rhs) = default;\n Member& operator=(Member&& rhs) = default;\n\n \/*!\n * Increment the reference counter of the member. \n *\/\n void add_reference();\n \n \/*!\n * Return the reference counter of the member. \n * \\return The reference counter of the member. \n *\/\n unsigned int get_references();\n\n private:\n unsigned int references = 0;\n};\n\n\/*!\n * \\class Struct\n * \\brief A structure entry in the function table. \n *\/\nstruct Struct {\n std::string name;\n std::vector<Member> members;\n std::shared_ptr<const Type> parent_type;\n \n Struct(const std::string& n);\n\n Struct(const Struct& rhs) = default;\n Struct& operator=(const Struct& rhs) = default;\n\n Struct(Struct&& rhs) = default;\n Struct& operator=(Struct&& rhs) = default;\n\n \/*!\n * Indicates if the specified member exists in this structure. \n * \\param name The name of the member to search for. \n * \\return true if the member exists, otherwise false. \n *\/\n bool member_exists(const std::string& name);\n \n \/*!\n * Return the member with the specified name. \n * \\param name The name of the member to search for. \n * \\return A pointer to the member with the given name. \n *\/\n Member& operator[](const std::string& name);\n\n \/*!\n * Increment the reference counter of the structure. \n *\/\n void add_reference();\n \n \/*!\n * Return the reference counter of the member. \n * \\return The reference counter of the member. \n *\/\n unsigned int get_references();\n\n private:\n unsigned int references = 0;\n};\n\n} \/\/end of eddic\n\n#endif\n<|endoftext|>"} {"text":"<commit_before>\/*\n * MPT C++ buffer implementation\n *\/\n\n#include <cerrno>\n\n#include <sys\/uio.h>\n\n#include \"message.h\"\n#include \"convert.h\"\n\n#include \"..\/mptio\/stream.h\"\n\n#include \"array.h\"\n\n__MPT_NAMESPACE_BEGIN\n\n\/\/ buffer instance\nBuffer::Buffer(array const &a)\n{\n _d = a;\n _state.done = _d.length();\n}\nBuffer::~Buffer()\n{ }\n\/\/ reference interface\nvoid Buffer::unref()\n{\n delete this;\n}\n\/\/ metatype interface\nBuffer *Buffer::clone() const\n{\n if (_enc) {\n if (_state.scratch || _state._ctx) {\n return 0;\n }\n }\n Buffer *b = new Buffer(_d);\n b->_state = _state;\n b->_enc = _enc;\n return b;\n}\nint Buffer::conv(int type, void *ptr) const\n{\n int me;\n if ((me = IODevice::typeIdentifier()) < 0) {\n me = metatype::Type;\n }\n if (!type) {\n static const char types[] = { metatype::Type, iterator::Type, MPT_value_toVector('c'), 's', 0 };\n if (ptr) *((const char **) ptr) = types;\n return me;\n }\n if (type == metatype::Type) {\n if (ptr) *static_cast<const metatype **>(ptr) = this;\n return me;\n }\n if (type == iterator::Type) {\n if (ptr) *static_cast<const iterator **>(ptr) = this;\n return me;\n }\n if (type == MPT_value_toVector('c')) {\n struct iovec *vec;\n if ((vec = static_cast<struct iovec *>(ptr))) {\n Slice<uint8_t> d = data();\n vec->iov_base = d.base();\n vec->iov_len = d.length();\n }\n return me;\n }\n if (type == 's') {\n Slice<uint8_t> d = data();\n if (!memchr(d.begin(), 0, d.length())) {\n return BadValue;\n }\n if (ptr) *static_cast<const uint8_t **>(ptr) = d.begin();\n return me;\n }\n return BadType;\n}\n\/\/ iterator interface\nint Buffer::get(int type, void *ptr)\n{\n if (!type) {\n int me;\n if ((me = IODevice::typeIdentifier()) < 0) {\n me = array::Type;\n }\n mpt_slice_get(0, type, ptr);\n return me;\n }\n if (_state.scratch) {\n return MessageInProgress;\n }\n size_t off = _d.length() - _state.done;\n slice s(_d);\n s.shift(off);\n if ((type = mpt_slice_get(&s, type, ptr)) < 0) {\n return type;\n }\n int me = IODevice::typeIdentifier();\n return me < 0 ? metatype::Type : me;\n}\nint Buffer::advance()\n{\n if (!_state.done) {\n return MissingData;\n }\n Slice<uint8_t> d = data();\n uint8_t *end;\n if (!(end = (uint8_t *) memchr(d.base(), 0, d.length()))) {\n return BadValue;\n }\n shift((end + 1) - d.base());\n return _state.done ? 's' : 0;\n}\nint Buffer::reset()\n{\n _state.done = _d.length() - _state.scratch;\n return _state.done;\n}\n\n\/\/ I\/O device interface\nssize_t Buffer::read(size_t nblk, void *dest, size_t esze)\n{\n Slice<uint8_t> d = data();\n if (!esze) {\n if ((size_t) d.length() < nblk) return -2;\n if (dest) memcpy(dest, d.base(), nblk);\n return nblk;\n }\n size_t avail = d.length() \/ esze;\n\n if (nblk > avail) nblk = avail;\n\n if (!nblk) return 0;\n\n avail = nblk * esze;\n if (dest) memcpy(dest, d.base(), avail);\n\n shift(avail);\n\n return nblk;\n}\nssize_t Buffer::write(size_t nblk, const void *from, size_t esze)\n{\n if (!nblk) {\n return push(0, 0);\n }\n if ((SIZE_MAX \/ nblk) < esze) {\n errno = ERANGE;\n return -2;\n }\n if (!esze) {\n return 0;\n }\n size_t left = nblk;\n while (nblk) {\n bool wait = _state.scratch;\n if (!push(esze, from)) {\n break;\n }\n if (!wait && !_enc) push(0, 0);\n from = ((uint8_t *) from) + esze;\n --nblk;\n }\n return left - nblk;\n\n}\nint64_t Buffer::pos()\n{\n size_t len = _state.done + _state.scratch;\n return _d.length() - len;\n}\nbool Buffer::seek(int64_t pos)\n{\n if (pos >= 0) {\n if ((size_t) pos > _state.done) {\n return false;\n }\n _state.done -= pos;\n return true;\n }\n ssize_t off = _state.done + _state.scratch;\n\n pos = -pos;\n if (off < pos) {\n return false;\n }\n _state.done += pos;\n\n return true;\n}\nSlice<uint8_t> Buffer::peek(size_t)\n{\n return encode_array::data();\n}\n\n__MPT_NAMESPACE_END\n<commit_msg>fix: buffer metatype iterator end detection<commit_after>\/*\n * MPT C++ buffer implementation\n *\/\n\n#include <cerrno>\n\n#include <sys\/uio.h>\n\n#include \"message.h\"\n#include \"convert.h\"\n\n#include \"..\/mptio\/stream.h\"\n\n#include \"array.h\"\n\n__MPT_NAMESPACE_BEGIN\n\n\/\/ buffer instance\nBuffer::Buffer(array const &a)\n{\n _d = a;\n _state.done = _d.length();\n}\nBuffer::~Buffer()\n{ }\n\/\/ reference interface\nvoid Buffer::unref()\n{\n delete this;\n}\n\/\/ metatype interface\nBuffer *Buffer::clone() const\n{\n if (_enc) {\n if (_state.scratch || _state._ctx) {\n return 0;\n }\n }\n Buffer *b = new Buffer(_d);\n b->_state = _state;\n b->_enc = _enc;\n return b;\n}\nint Buffer::conv(int type, void *ptr) const\n{\n int me;\n if ((me = IODevice::typeIdentifier()) < 0) {\n me = metatype::Type;\n }\n if (!type) {\n static const char types[] = { metatype::Type, iterator::Type, MPT_value_toVector('c'), 's', 0 };\n if (ptr) *((const char **) ptr) = types;\n return me;\n }\n if (type == metatype::Type) {\n if (ptr) *static_cast<const metatype **>(ptr) = this;\n return me;\n }\n if (type == iterator::Type) {\n if (ptr) *static_cast<const iterator **>(ptr) = this;\n return me;\n }\n if (type == MPT_value_toVector('c')) {\n struct iovec *vec;\n if ((vec = static_cast<struct iovec *>(ptr))) {\n Slice<uint8_t> d = data();\n vec->iov_base = d.base();\n vec->iov_len = d.length();\n }\n return me;\n }\n if (type == 's') {\n Slice<uint8_t> d = data();\n if (!memchr(d.begin(), 0, d.length())) {\n return BadValue;\n }\n if (ptr) *static_cast<const uint8_t **>(ptr) = d.begin();\n return me;\n }\n return BadType;\n}\n\/\/ iterator interface\nint Buffer::get(int type, void *ptr)\n{\n if (!type) {\n int me;\n if ((me = IODevice::typeIdentifier()) < 0) {\n me = array::Type;\n }\n mpt_slice_get(0, type, ptr);\n return me;\n }\n if (_state.scratch) {\n return MessageInProgress;\n }\n size_t off = _d.length() - _state.done;\n slice s(_d);\n s.shift(off);\n if ((type = mpt_slice_get(&s, type, ptr)) <= 0) {\n return type;\n }\n int me = IODevice::typeIdentifier();\n return me < 0 ? metatype::Type : me;\n}\nint Buffer::advance()\n{\n if (!_state.done) {\n return MissingData;\n }\n Slice<uint8_t> d = data();\n uint8_t *end;\n if (!(end = (uint8_t *) memchr(d.base(), 0, d.length()))) {\n return BadValue;\n }\n shift((end + 1) - d.base());\n return _state.done ? 's' : 0;\n}\nint Buffer::reset()\n{\n _state.done = _d.length() - _state.scratch;\n return _state.done;\n}\n\n\/\/ I\/O device interface\nssize_t Buffer::read(size_t nblk, void *dest, size_t esze)\n{\n Slice<uint8_t> d = data();\n if (!esze) {\n if ((size_t) d.length() < nblk) return -2;\n if (dest) memcpy(dest, d.base(), nblk);\n return nblk;\n }\n size_t avail = d.length() \/ esze;\n\n if (nblk > avail) nblk = avail;\n\n if (!nblk) return 0;\n\n avail = nblk * esze;\n if (dest) memcpy(dest, d.base(), avail);\n\n shift(avail);\n\n return nblk;\n}\nssize_t Buffer::write(size_t nblk, const void *from, size_t esze)\n{\n if (!nblk) {\n return push(0, 0);\n }\n if ((SIZE_MAX \/ nblk) < esze) {\n errno = ERANGE;\n return -2;\n }\n if (!esze) {\n return 0;\n }\n size_t left = nblk;\n while (nblk) {\n bool wait = _state.scratch;\n if (!push(esze, from)) {\n break;\n }\n if (!wait && !_enc) push(0, 0);\n from = ((uint8_t *) from) + esze;\n --nblk;\n }\n return left - nblk;\n\n}\nint64_t Buffer::pos()\n{\n size_t len = _state.done + _state.scratch;\n return _d.length() - len;\n}\nbool Buffer::seek(int64_t pos)\n{\n if (pos >= 0) {\n if ((size_t) pos > _state.done) {\n return false;\n }\n _state.done -= pos;\n return true;\n }\n ssize_t off = _state.done + _state.scratch;\n\n pos = -pos;\n if (off < pos) {\n return false;\n }\n _state.done += pos;\n\n return true;\n}\nSlice<uint8_t> Buffer::peek(size_t)\n{\n return encode_array::data();\n}\n\n__MPT_NAMESPACE_END\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: plugin.hpp 39 2005-04-10 20:39:53Z pavlenko $\n\n#ifndef PLUGIN_HPP\n#define PLUGIN_HPP\n\n#include <ltdl.h>\n#include <string>\n\nnamespace mapnik\n{\n class PluginInfo\n {\n private:\n\tstd::string name_;\n\tlt_dlhandle module_;\n\t\n public:\n\tPluginInfo (const std::string& name,const lt_dlhandle module);\n\t~PluginInfo();\n\tconst std::string& name() const;\n\tlt_dlhandle handle() const;\n private:\n\tPluginInfo(const PluginInfo&);\n\tPluginInfo& operator=(const PluginInfo&);\n };\n}\n\n#endif \/\/PLUGIN_HPP\n<commit_msg>use boost::noncopyable<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: plugin.hpp 39 2005-04-10 20:39:53Z pavlenko $\n\n#ifndef PLUGIN_HPP\n#define PLUGIN_HPP\n\n#include <ltdl.h>\n#include <string>\n#include <boost\/utility.hpp>\n\nnamespace mapnik\n{\n class PluginInfo : boost::noncopyable\n {\n private:\n\tstd::string name_;\n\tlt_dlhandle module_;\n\t\n public:\n\tPluginInfo (const std::string& name,const lt_dlhandle module);\n\t~PluginInfo();\n\tconst std::string& name() const;\n\tlt_dlhandle handle() const;\n };\n}\n\n#endif \/\/PLUGIN_HPP\n<|endoftext|>"} {"text":"<commit_before>\/*!\n * MPT C++ stream implementation\n *\/\n\n#include <inttypes.h>\n\n#include <cstring>\n\n#include <cstdio>\n#include <cerrno>\n\n#include <poll.h>\n\n#include <sys\/uio.h>\n\n#include \"queue.h\"\n#include \"array.h\"\n#include \"message.h\"\n\n#include \"output.h\"\n#include \"meta.h\"\n\n#include \"stream.h\"\n\n__MPT_NAMESPACE_BEGIN\n\n\/\/ streaminfo access\nstreaminfo::~streaminfo()\n{\n _mpt_stream_setfile(this, -1, -1);\n}\nbool streaminfo::setFlags(int fl)\n{\n if (fl & ~0xf0) return false;\n _fd |= fl;\n return true;\n}\n\n\/\/ stream data operations\nstream::stream() : _mlen(0)\n{ }\nstream::~stream()\n{\n mpt_stream_close(this);\n}\nint stream::flags() const\n{\n return mpt_stream_flags(&this->_info) & 0xff;\n}\nint stream::errors() const {\n return MPT_stream_errors(mpt_stream_flags(&this->_info));\n}\nvoid stream::setError(int err)\n{\n return mpt_stream_seterror(&this->_info, err);\n}\nbool stream::endline()\n{\n int nl = (mpt_stream_flags(&this->_info) & 0xc000) >> 14;\n \n switch (nl) {\n case NewlineMac: return mpt_stream_write(this, 1, \"\\r\", 1);\n case NewlineUnix: return mpt_stream_write(this, 1, \"\\n\", 1);\n case NewlineNet: return mpt_stream_write(this, 1, \"\\r\\n\", 2);\n default: return false;\n }\n}\nvoid stream::setNewline(int nl, int what)\n{\n return mpt_stream_setnewline(&this->_info, nl, what);\n}\nbool stream::open(const char *fn, const char *mode)\n{\n if (!fn) { mpt_stream_close(this); return true; }\n return mpt_stream_open(this, fn, mode) < 0 ? false : true;\n}\n\n\/\/ stream class\nStream::Stream(const streaminfo *from) : _inputFile(-1)\n{\n if (!from) return;\n _srm = new stream;\n _mpt_stream_setfile(&_srm->_info, _mpt_stream_fread(from), _mpt_stream_fwrite(from));\n int flags = mpt_stream_flags(from);\n mpt_stream_setmode(_srm, flags & 0xff);\n _srm->setNewline(MPT_stream_newline_read(flags), _srm->Read);\n _srm->setNewline(MPT_stream_newline_write(flags), _srm->Write);\n}\nStream::~Stream()\n{ }\n\n\/\/ metatype interface\nvoid Stream::unref()\n{\n if (_srm) delete _srm;\n delete this;\n}\nint Stream::assign(const value *val)\n{\n if (val) {\n return setProperty(0, 0);\n } else {\n return mpt_object_pset(this, 0, val);\n }\n}\nint Stream::conv(int type, void *ptr)\n{\n static const char fmt[] = { output::Type, input::Type, IODevice::Type, 0 };\n const void *addr = 0;\n switch (type) {\n case 0: addr = fmt; type = Type;\n case metatype::Type: addr = static_cast<metatype *>(this); break;\n case output::Type: addr = static_cast<output *>(this); break;\n case input::Type: addr = static_cast<input *>(this); break;\n case IODevice::Type: addr = static_cast<IODevice *>(this); break;\n default: return BadType;\n }\n if (ptr) *reinterpret_cast<const void **>(ptr) = addr;\n return type;\n}\n\/\/ object interface\nint Stream::property(struct property *pr) const\n{\n if (!pr) {\n return Type;\n }\n const char *name;\n intptr_t pos;\n\n if (!(name = pr->name)) {\n if (((pos = (intptr_t) pr->desc) < 0)) {\n errno = EINVAL;\n return BadValue;\n }\n }\n else {\n \/\/ get stream interface types\n if (!*name) {\n static const char fmt[] = { output::Type, input::Type, IODevice::Type, 0 };\n pr->name = \"stream\";\n pr->desc = \"interfaces to stream data\";\n pr->val.fmt = fmt;\n pr->val.ptr = 0;\n return _srm ? mpt_stream_flags(&_srm->_info) : 0;\n }\n }\n intptr_t id = 0;\n if (name ? !strcasecmp(name, \"idlen\") : (pos == id++)) {\n pr->name = \"idlen\";\n pr->desc = \"message id length\";\n pr->val.fmt = \"y\";\n pr->val.ptr = &_idlen;\n return id;\n }\n return BadArgument;\n}\nint Stream::setProperty(const char *pr, metatype *src)\n{\n if (!pr) {\n return _srm ? mpt_stream_setter(_srm, src) : BadOperation;\n }\n if (strcasecmp(pr, \"idlen\")) {\n if (_inputFile >= 0) {\n return BadOperation;\n }\n int ret;\n uint8_t l;\n\n if (!src) {\n ret = l = 0;\n } else {\n if ((ret = src->conv('y', &l)) < 0) return ret;\n if (l > sizeof(uintptr_t)) {\n return BadValue;\n }\n }\n _idlen = l;\n return ret;\n }\n return BadArgument;\n}\nbool Stream::open(const char *dest, const char *type)\n{\n if (_inputFile >= 0) return false;\n if (!_srm) _srm = new stream;\n return mpt_stream_open(_srm, dest, type) < 0 ? false : true;\n}\nbool Stream::open(void *base, size_t len, int mode)\n{\n if (_inputFile >= 0) {\n return false;\n }\n if (len && !base) {\n return false;\n }\n struct iovec data = { base, len };\n int ret;\n if (!_srm) _srm = new stream;\n switch (mode) {\n case stream::Read: ret = mpt_stream_memory(_srm, &data, 0); break;\n case stream::Write: ret = mpt_stream_memory(_srm, 0, &data); break;\n default: return false;\n }\n if (ret < 0) {\n return false;\n }\n return true;\n}\n\/\/ IODevice interface\nssize_t Stream::write(size_t len, const void *data, size_t part)\n{\n if (!_srm) {\n return BadArgument;\n }\n return mpt_stream_write(_srm, len, data, part);\n}\nssize_t Stream::read(size_t len, void *data, size_t part)\n{\n if (!_srm) {\n return BadArgument;\n }\n return mpt_stream_read(_srm, len, data, part);\n}\nint64_t Stream::pos()\n{\n if (!_srm) {\n return BadArgument;\n }\n return mpt_stream_seek(_srm, 0, SEEK_CUR);\n}\nbool Stream::seek(int64_t pos)\n{\n if (!_srm) {\n return BadArgument;\n }\n return mpt_stream_seek(_srm, pos, SEEK_SET) >= 0 ? true : false;\n}\n\/\/ input interface\nint Stream::next(int what)\n{\n if (!_srm) {\n return BadArgument;\n }\n int ret = mpt_stream_poll(_srm, what, 0);\n if (ret < 0) {\n _inputFile = -1;\n }\n return ret;\n}\nclass Stream::Dispatch\n{\npublic:\n Dispatch(Stream &s, EventHandler c, void *a) : srm(s), cmd(c), arg(a)\n { }\n int dispatch(const struct message *msg)\n {\n static const char _func[] = \"mpt::Stream::dispatch\";\n struct event ev;\n uint8_t idlen;\n\n if (!msg || !(idlen = srm._idlen)) {\n return cmd(arg, &ev);\n }\n uint8_t id[__UINT8_MAX__];\n int ret;\n\n struct message tmp = *msg;\n if (tmp.read(idlen, id) < idlen) {\n error(_func, \"%s\", MPT_tr(\"message id incomplete\"));\n }\n if (id[0] & 0x80) {\n command *ans;\n uint64_t rid;\n id[0] &= 0x7f;\n if ((ret = mpt_message_buf2id(id, idlen, &rid)) < 0 || ret > (int) sizeof(ans->id)) {\n error(_func, \"%s\", MPT_tr(\"bad reply id\"));\n return BadValue;\n }\n if ((ans = srm._wait.get(rid))) {\n return ans->cmd(ans->arg, &tmp);\n }\n error(_func, \"%s (id = %08\" PRIx64 \")\", MPT_tr(\"unknown reply id\"), rid);\n return BadValue;\n }\n reply_data::context *rc = 0;\n for (uint8_t i = 0; i < idlen; ++i) {\n if (!id[i]) {\n continue;\n }\n if (!(rc = srm._ctx.pointer())) {\n warning(_func, \"%s\", MPT_tr(\"no reply context\"));\n break;\n }\n if (!rc->setData(idlen, id)) {\n error(_func, \"%s\", MPT_tr(\"reply context unusable\"));\n return BadOperation;\n }\n break;\n }\n ev.reply = rc;\n ret = cmd(arg, &ev);\n if (rc && rc->active()) {\n struct msgtype mt(MessageAnswer, ret);\n struct message msg(&mt, sizeof(mt));\n id[0] |= 0x80;\n mpt_stream_reply(srm._srm, &msg, idlen, id);\n }\n return ret;\n }\nprotected:\n Stream &srm;\n EventHandler cmd;\n void *arg;\n};\nstatic int streamDispatch(void *ptr, const struct message *msg)\n{\n Stream::Dispatch *sd = reinterpret_cast<Stream::Dispatch *>(ptr);\n return sd->dispatch(msg);\n}\nint Stream::dispatch(EventHandler cmd, void *arg)\n{\n if (!_srm) {\n return BadArgument;\n }\n if (_srm->_mlen < 0\n && (_srm->_mlen = mpt_queue_recv(&_srm->_rd)) < 0) {\n if (_mpt_stream_fread(&_srm->_info) < 0) {\n return BadArgument;\n }\n return 0;\n }\n class Dispatch sd(*this, cmd, arg);\n return mpt_stream_dispatch(_srm, streamDispatch, &sd);\n}\nint Stream::_file()\n{\n if (_inputFile >= 0) {\n return _inputFile;\n }\n if (!_srm) {\n return BadArgument;\n }\n if ((_inputFile = _mpt_stream_fread(&_srm->_info)) >= 0) {\n return _inputFile;\n }\n return _inputFile = _mpt_stream_fwrite(&_srm->_info);\n}\n\nssize_t Stream::push(size_t len, const void *src)\n{\n if (!_srm) {\n return BadArgument;\n }\n ssize_t curr;\n if (_idlen && !(_srm->flags() & MessageInProgress)) {\n uint8_t id[__UINT8_MAX__];\n mpt_message_id2buf(_cid, id, _idlen);\n if (mpt_stream_push(_srm, _idlen, id) < _idlen) {\n push(1, 0);\n }\n }\n if ((curr = mpt_stream_push(_srm, len, src)) < 0) {\n return curr;\n }\n if (!len) {\n _cid = 0;\n }\n else if (!src && _cid) {\n command *c;\n if ((c = _wait.get(_cid))) {\n c->cmd(c->arg, 0);\n }\n }\n return curr;\n}\nint Stream::sync(int timeout)\n{\n if (!_srm || !_idlen) {\n return BadArgument;\n }\n return mpt_stream_sync(_srm, _idlen, &_wait, timeout);\n}\n\nint Stream::await(int (*rctl)(void *, const struct message *), void *rpar)\n{\n if (!_idlen) {\n return BadArgument;\n }\n struct command *cmd;\n\n if (mpt_stream_flags(&_srm->_info) & _srm->MesgActive) {\n return MessageInProgress;\n }\n if (!rctl) {\n return 0;\n }\n if (!(cmd = _wait.next(_idlen))) {\n return BadOperation;\n }\n _cid = cmd->id;\n cmd->cmd = (int (*)(void *, void *)) rctl;\n cmd->arg = rpar;\n return 1;\n}\n\nint Stream::getchar()\n{\n if (!_srm || _srm->_rd.encoded()) {\n return BadArgument;\n }\n if (_srm->_rd.len) {\n uint8_t *base = (uint8_t *) _srm->_rd.base;\n if (_srm->_rd.off >= _srm->_rd.max) {\n _srm->_rd.off = 0;\n }\n --_srm->_rd.len;\n return base[_srm->_rd.off++];\n }\n return IODevice::getchar();\n}\n\n__MPT_NAMESPACE_END\n\n\n<commit_msg>fix: uninitialized members mpt::Stream constructor<commit_after>\/*!\n * MPT C++ stream implementation\n *\/\n\n#include <inttypes.h>\n\n#include <cstring>\n\n#include <cstdio>\n#include <cerrno>\n\n#include <poll.h>\n\n#include <sys\/uio.h>\n\n#include \"queue.h\"\n#include \"array.h\"\n#include \"message.h\"\n\n#include \"output.h\"\n#include \"meta.h\"\n\n#include \"stream.h\"\n\n__MPT_NAMESPACE_BEGIN\n\n\/\/ streaminfo access\nstreaminfo::~streaminfo()\n{\n _mpt_stream_setfile(this, -1, -1);\n}\nbool streaminfo::setFlags(int fl)\n{\n if (fl & ~0xf0) return false;\n _fd |= fl;\n return true;\n}\n\n\/\/ stream data operations\nstream::stream() : _mlen(0)\n{ }\nstream::~stream()\n{\n mpt_stream_close(this);\n}\nint stream::flags() const\n{\n return mpt_stream_flags(&this->_info) & 0xff;\n}\nint stream::errors() const {\n return MPT_stream_errors(mpt_stream_flags(&this->_info));\n}\nvoid stream::setError(int err)\n{\n return mpt_stream_seterror(&this->_info, err);\n}\nbool stream::endline()\n{\n int nl = (mpt_stream_flags(&this->_info) & 0xc000) >> 14;\n \n switch (nl) {\n case NewlineMac: return mpt_stream_write(this, 1, \"\\r\", 1);\n case NewlineUnix: return mpt_stream_write(this, 1, \"\\n\", 1);\n case NewlineNet: return mpt_stream_write(this, 1, \"\\r\\n\", 2);\n default: return false;\n }\n}\nvoid stream::setNewline(int nl, int what)\n{\n return mpt_stream_setnewline(&this->_info, nl, what);\n}\nbool stream::open(const char *fn, const char *mode)\n{\n if (!fn) { mpt_stream_close(this); return true; }\n return mpt_stream_open(this, fn, mode) < 0 ? false : true;\n}\n\n\/\/ stream class\nStream::Stream(const streaminfo *from) : _srm(0), _cid(0), _inputFile(-1), _idlen(0)\n{\n if (!from) return;\n _srm = new stream;\n _mpt_stream_setfile(&_srm->_info, _mpt_stream_fread(from), _mpt_stream_fwrite(from));\n int flags = mpt_stream_flags(from);\n mpt_stream_setmode(_srm, flags & 0xff);\n _srm->setNewline(MPT_stream_newline_read(flags), _srm->Read);\n _srm->setNewline(MPT_stream_newline_write(flags), _srm->Write);\n}\nStream::~Stream()\n{ }\n\n\/\/ metatype interface\nvoid Stream::unref()\n{\n if (_srm) delete _srm;\n delete this;\n}\nint Stream::assign(const value *val)\n{\n if (val) {\n return setProperty(0, 0);\n } else {\n return mpt_object_pset(this, 0, val);\n }\n}\nint Stream::conv(int type, void *ptr)\n{\n static const char fmt[] = { output::Type, input::Type, IODevice::Type, 0 };\n const void *addr = 0;\n switch (type) {\n case 0: addr = fmt; type = Type;\n case metatype::Type: addr = static_cast<metatype *>(this); break;\n case output::Type: addr = static_cast<output *>(this); break;\n case input::Type: addr = static_cast<input *>(this); break;\n case IODevice::Type: addr = static_cast<IODevice *>(this); break;\n default: return BadType;\n }\n if (ptr) *reinterpret_cast<const void **>(ptr) = addr;\n return type;\n}\n\/\/ object interface\nint Stream::property(struct property *pr) const\n{\n if (!pr) {\n return Type;\n }\n const char *name;\n intptr_t pos;\n\n if (!(name = pr->name)) {\n if (((pos = (intptr_t) pr->desc) < 0)) {\n errno = EINVAL;\n return BadValue;\n }\n }\n else {\n \/\/ get stream interface types\n if (!*name) {\n static const char fmt[] = { output::Type, input::Type, IODevice::Type, 0 };\n pr->name = \"stream\";\n pr->desc = \"interfaces to stream data\";\n pr->val.fmt = fmt;\n pr->val.ptr = 0;\n return _srm ? mpt_stream_flags(&_srm->_info) : 0;\n }\n }\n intptr_t id = 0;\n if (name ? !strcasecmp(name, \"idlen\") : (pos == id++)) {\n pr->name = \"idlen\";\n pr->desc = \"message id length\";\n pr->val.fmt = \"y\";\n pr->val.ptr = &_idlen;\n return id;\n }\n return BadArgument;\n}\nint Stream::setProperty(const char *pr, metatype *src)\n{\n if (!pr) {\n return _srm ? mpt_stream_setter(_srm, src) : BadOperation;\n }\n if (strcasecmp(pr, \"idlen\")) {\n if (_inputFile >= 0) {\n return BadOperation;\n }\n int ret;\n uint8_t l;\n\n if (!src) {\n ret = l = 0;\n } else {\n if ((ret = src->conv('y', &l)) < 0) return ret;\n if (l > sizeof(uintptr_t)) {\n return BadValue;\n }\n }\n _idlen = l;\n return ret;\n }\n return BadArgument;\n}\nbool Stream::open(const char *dest, const char *type)\n{\n if (_inputFile >= 0) return false;\n if (!_srm) _srm = new stream;\n return mpt_stream_open(_srm, dest, type) < 0 ? false : true;\n}\nbool Stream::open(void *base, size_t len, int mode)\n{\n if (_inputFile >= 0) {\n return false;\n }\n if (len && !base) {\n return false;\n }\n struct iovec data = { base, len };\n int ret;\n if (!_srm) _srm = new stream;\n switch (mode) {\n case stream::Read: ret = mpt_stream_memory(_srm, &data, 0); break;\n case stream::Write: ret = mpt_stream_memory(_srm, 0, &data); break;\n default: return false;\n }\n if (ret < 0) {\n return false;\n }\n return true;\n}\n\/\/ IODevice interface\nssize_t Stream::write(size_t len, const void *data, size_t part)\n{\n if (!_srm) {\n return BadArgument;\n }\n return mpt_stream_write(_srm, len, data, part);\n}\nssize_t Stream::read(size_t len, void *data, size_t part)\n{\n if (!_srm) {\n return BadArgument;\n }\n return mpt_stream_read(_srm, len, data, part);\n}\nint64_t Stream::pos()\n{\n if (!_srm) {\n return BadArgument;\n }\n return mpt_stream_seek(_srm, 0, SEEK_CUR);\n}\nbool Stream::seek(int64_t pos)\n{\n if (!_srm) {\n return BadArgument;\n }\n return mpt_stream_seek(_srm, pos, SEEK_SET) >= 0 ? true : false;\n}\n\/\/ input interface\nint Stream::next(int what)\n{\n if (!_srm) {\n return BadArgument;\n }\n int ret = mpt_stream_poll(_srm, what, 0);\n if (ret < 0) {\n _inputFile = -1;\n }\n return ret;\n}\nclass Stream::Dispatch\n{\npublic:\n Dispatch(Stream &s, EventHandler c, void *a) : srm(s), cmd(c), arg(a)\n { }\n int dispatch(const struct message *msg)\n {\n static const char _func[] = \"mpt::Stream::dispatch\";\n struct event ev;\n uint8_t idlen;\n\n if (!msg || !(idlen = srm._idlen)) {\n return cmd(arg, &ev);\n }\n uint8_t id[__UINT8_MAX__];\n int ret;\n\n struct message tmp = *msg;\n if (tmp.read(idlen, id) < idlen) {\n error(_func, \"%s\", MPT_tr(\"message id incomplete\"));\n }\n if (id[0] & 0x80) {\n command *ans;\n uint64_t rid;\n id[0] &= 0x7f;\n if ((ret = mpt_message_buf2id(id, idlen, &rid)) < 0 || ret > (int) sizeof(ans->id)) {\n error(_func, \"%s\", MPT_tr(\"bad reply id\"));\n return BadValue;\n }\n if ((ans = srm._wait.get(rid))) {\n return ans->cmd(ans->arg, &tmp);\n }\n error(_func, \"%s (id = %08\" PRIx64 \")\", MPT_tr(\"unknown reply id\"), rid);\n return BadValue;\n }\n reply_data::context *rc = 0;\n for (uint8_t i = 0; i < idlen; ++i) {\n if (!id[i]) {\n continue;\n }\n if (!(rc = srm._ctx.pointer())) {\n warning(_func, \"%s\", MPT_tr(\"no reply context\"));\n break;\n }\n if (!rc->setData(idlen, id)) {\n error(_func, \"%s\", MPT_tr(\"reply context unusable\"));\n return BadOperation;\n }\n break;\n }\n ev.reply = rc;\n ret = cmd(arg, &ev);\n if (rc && rc->active()) {\n struct msgtype mt(MessageAnswer, ret);\n struct message msg(&mt, sizeof(mt));\n id[0] |= 0x80;\n mpt_stream_reply(srm._srm, &msg, idlen, id);\n }\n return ret;\n }\nprotected:\n Stream &srm;\n EventHandler cmd;\n void *arg;\n};\nstatic int streamDispatch(void *ptr, const struct message *msg)\n{\n Stream::Dispatch *sd = reinterpret_cast<Stream::Dispatch *>(ptr);\n return sd->dispatch(msg);\n}\nint Stream::dispatch(EventHandler cmd, void *arg)\n{\n if (!_srm) {\n return BadArgument;\n }\n if (_srm->_mlen < 0\n && (_srm->_mlen = mpt_queue_recv(&_srm->_rd)) < 0) {\n if (_mpt_stream_fread(&_srm->_info) < 0) {\n return BadArgument;\n }\n return 0;\n }\n class Dispatch sd(*this, cmd, arg);\n return mpt_stream_dispatch(_srm, streamDispatch, &sd);\n}\nint Stream::_file()\n{\n if (_inputFile >= 0) {\n return _inputFile;\n }\n if (!_srm) {\n return BadArgument;\n }\n if ((_inputFile = _mpt_stream_fread(&_srm->_info)) >= 0) {\n return _inputFile;\n }\n return _inputFile = _mpt_stream_fwrite(&_srm->_info);\n}\n\nssize_t Stream::push(size_t len, const void *src)\n{\n if (!_srm) {\n return BadArgument;\n }\n ssize_t curr;\n if (_idlen && !(_srm->flags() & MessageInProgress)) {\n uint8_t id[__UINT8_MAX__];\n mpt_message_id2buf(_cid, id, _idlen);\n if (mpt_stream_push(_srm, _idlen, id) < _idlen) {\n push(1, 0);\n }\n }\n if ((curr = mpt_stream_push(_srm, len, src)) < 0) {\n return curr;\n }\n if (!len) {\n _cid = 0;\n }\n else if (!src && _cid) {\n command *c;\n if ((c = _wait.get(_cid))) {\n c->cmd(c->arg, 0);\n }\n }\n return curr;\n}\nint Stream::sync(int timeout)\n{\n if (!_srm || !_idlen) {\n return BadArgument;\n }\n return mpt_stream_sync(_srm, _idlen, &_wait, timeout);\n}\n\nint Stream::await(int (*rctl)(void *, const struct message *), void *rpar)\n{\n if (!_idlen) {\n return BadArgument;\n }\n struct command *cmd;\n\n if (mpt_stream_flags(&_srm->_info) & _srm->MesgActive) {\n return MessageInProgress;\n }\n if (!rctl) {\n return 0;\n }\n if (!(cmd = _wait.next(_idlen))) {\n return BadOperation;\n }\n _cid = cmd->id;\n cmd->cmd = (int (*)(void *, void *)) rctl;\n cmd->arg = rpar;\n return 1;\n}\n\nint Stream::getchar()\n{\n if (!_srm || _srm->_rd.encoded()) {\n return BadArgument;\n }\n if (_srm->_rd.len) {\n uint8_t *base = (uint8_t *) _srm->_rd.base;\n if (_srm->_rd.off >= _srm->_rd.max) {\n _srm->_rd.off = 0;\n }\n --_srm->_rd.len;\n return base[_srm->_rd.off++];\n }\n return IODevice::getchar();\n}\n\n__MPT_NAMESPACE_END\n\n\n<|endoftext|>"} {"text":"<commit_before>\/\/******************************************************************\n\/\/\n\/\/ Copyright 2014 Intel Mobile Communications GmbH All Rights Reserved.\n\/\/\n\/\/-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=\n\/\/\n\/\/ Licensed under the Apache License, Version 2.0 (the \"License\");\n\/\/ you may not use this file except in compliance with the License.\n\/\/ You may obtain a copy of the License at\n\/\/\n\/\/ http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n\/\/\n\/\/ Unless required by applicable law or agreed to in writing, software\n\/\/ distributed under the License is distributed on an \"AS IS\" BASIS,\n\/\/ WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n\/\/ See the License for the specific language governing permissions and\n\/\/ limitations under the License.\n\/\/\n\/\/-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=\n\n\/\/******************************************************************\n\/\/ File name:\n\/\/ OCPlatform_impl.cpp\n\/\/\n\/\/ Description: Implementation of the OCPlatform functionality. It contains\n\/\/ a singleton interface that is used only by the OCPlatform namespace and is the\n\/\/ central entrance to the stack.\n\/\/\n\/\/\n\/\/\n\/\/*********************************************************************\n\n#include \"OCPlatform_impl.h\"\n\n#include <random>\n#include <utility>\n#include <functional>\n\n#include \"ocstack.h\"\n\n#include \"OCPlatform.h\"\n#include \"OCApi.h\"\n#include \"OCException.h\"\n#include \"OCUtilities.h\"\n\n#include \"oc_logger.hpp\"\n\nnamespace OC\n{\n\n PlatformConfig& OCPlatform_impl::globalConfig()\n {\n static PlatformConfig s_config;\n return s_config;\n }\n\n void OCPlatform_impl::Configure(const PlatformConfig& config)\n {\n globalConfig() = config;\n }\n\n OCPlatform_impl& OCPlatform_impl::Instance()\n {\n static OCPlatform_impl platform(globalConfig());\n return platform;\n }\n\n void OCPlatform_impl::init(const PlatformConfig& config)\n {\n switch(config.mode)\n {\n case ModeType::Server:\n m_server = m_WrapperInstance->CreateServerWrapper(m_csdkLock, config);\n break;\n\n case ModeType::Client:\n m_client = m_WrapperInstance->CreateClientWrapper(m_csdkLock, config);\n break;\n\n case ModeType::Both:\n m_server = m_WrapperInstance->CreateServerWrapper(m_csdkLock, config);\n m_client = m_WrapperInstance->CreateClientWrapper(m_csdkLock, config);\n break;\n }\n }\n\n OCPlatform_impl::OCPlatform_impl(const PlatformConfig& config)\n : m_cfg { config },\n m_WrapperInstance { make_unique<WrapperFactory>() },\n m_csdkLock { std::make_shared<std::recursive_mutex>() }\n {\n init(m_cfg);\n }\n\n OCPlatform_impl::~OCPlatform_impl(void)\n {\n }\n\n OCStackResult OCPlatform_impl::setDefaultDeviceEntityHandler(EntityHandler entityHandler)\n {\n return checked_guard(m_server, &IServerWrapper::setDefaultDeviceEntityHandler,\n entityHandler);\n }\n\n OCStackResult OCPlatform_impl::notifyAllObservers(OCResourceHandle resourceHandle,\n QualityOfService QoS)\n {\n return result_guard(OCNotifyAllObservers(resourceHandle,\n static_cast<OCQualityOfService>(QoS)));\n }\n\n OCStackResult OCPlatform_impl::notifyAllObservers(OCResourceHandle resourceHandle)\n {\n return notifyAllObservers(resourceHandle, m_cfg.QoS);\n }\n\n OCStackResult OCPlatform_impl::notifyListOfObservers(OCResourceHandle resourceHandle,\n ObservationIds& observationIds,\n const std::shared_ptr<OCResourceResponse> pResponse)\n {\n return notifyListOfObservers(resourceHandle, observationIds, pResponse, m_cfg.QoS);\n }\n\n OCStackResult OCPlatform_impl::notifyListOfObservers(OCResourceHandle resourceHandle,\n ObservationIds& observationIds,\n const std::shared_ptr<OCResourceResponse> pResponse,\n QualityOfService QoS)\n {\n if(!pResponse)\n {\n return result_guard(OC_STACK_ERROR);\n }\n\n std::string payload(pResponse->getResourceRepresentation().getJSONRepresentation());\n\n return result_guard(\n OCNotifyListOfObservers(resourceHandle,\n &observationIds[0], observationIds.size(),\n payload.c_str(),\n static_cast<OCQualityOfService>(QoS)));\n }\n\n OCResource::Ptr OCPlatform_impl::constructResourceObject(const std::string& host,\n const std::string& uri,\n OCConnectivityType connectivityType,\n bool isObservable,\n const std::vector<std::string>& resourceTypes,\n const std::vector<std::string>& interfaces)\n {\n if(!m_client)\n {\n return std::shared_ptr<OCResource>();\n }\n\n return std::shared_ptr<OCResource>(new OCResource(m_client,\n host,\n uri, \"\", connectivityType,\n isObservable,\n resourceTypes,\n interfaces));\n }\n\n OCStackResult OCPlatform_impl::findResource(const std::string& host,\n const std::string& resourceName,\n OCConnectivityType connectivityType,\n FindCallback resourceHandler)\n {\n return findResource(host, resourceName, connectivityType, resourceHandler, m_cfg.QoS);\n }\n\n OCStackResult OCPlatform_impl::findResource(const std::string& host,\n const std::string& resourceName,\n OCConnectivityType connectivityType,\n FindCallback resourceHandler,\n QualityOfService QoS)\n {\n return checked_guard(m_client, &IClientWrapper::ListenForResource,\n host, resourceName, connectivityType, resourceHandler, QoS);\n }\n\n OCStackResult OCPlatform_impl::getDeviceInfo(const std::string& host,\n const std::string& deviceURI,\n OCConnectivityType connectivityType,\n FindDeviceCallback deviceInfoHandler)\n {\n return result_guard(getDeviceInfo(host, deviceURI, connectivityType,\n deviceInfoHandler, m_cfg.QoS));\n }\n\n OCStackResult OCPlatform_impl::getDeviceInfo(const std::string& host,\n const std::string& deviceURI,\n OCConnectivityType connectivityType,\n FindDeviceCallback deviceInfoHandler,\n QualityOfService QoS)\n {\n return checked_guard(m_client, &IClientWrapper::ListenForDevice,\n host, deviceURI, connectivityType, deviceInfoHandler, QoS);\n }\n\n OCStackResult OCPlatform_impl::getPlatformInfo(const std::string& host,\n const std::string& platformURI,\n OCConnectivityType connectivityType,\n FindPlatformCallback platformInfoHandler)\n {\n return result_guard(getPlatformInfo(host, platformURI, connectivityType,\n platformInfoHandler, m_cfg.QoS));\n }\n\n OCStackResult OCPlatform_impl::getPlatformInfo(const std::string& host,\n const std::string& platformURI,\n OCConnectivityType connectivityType,\n FindPlatformCallback platformInfoHandler,\n QualityOfService QoS)\n {\n return checked_guard(m_client, &IClientWrapper::ListenForDevice,\n host, platformURI, connectivityType, platformInfoHandler, QoS);\n }\n\n OCStackResult OCPlatform_impl::registerResource(OCResourceHandle& resourceHandle,\n std::string& resourceURI,\n const std::string& resourceTypeName,\n const std::string& resourceInterface,\n EntityHandler entityHandler,\n uint8_t resourceProperty)\n {\n return checked_guard(m_server, &IServerWrapper::registerResource,\n std::ref(resourceHandle), resourceURI, resourceTypeName,\n resourceInterface, entityHandler, resourceProperty);\n }\n\n OCStackResult OCPlatform_impl::registerDeviceInfo(const OCDeviceInfo deviceInfo)\n {\n return checked_guard(m_server, &IServerWrapper::registerDeviceInfo, deviceInfo);\n }\n\n OCStackResult OCPlatform_impl::registerPlatformInfo(const OCPlatformInfo platformInfo)\n {\n return checked_guard(m_server, &IServerWrapper::registerPlatformInfo, platformInfo);\n }\n\n OCStackResult OCPlatform_impl::registerResource(OCResourceHandle& resourceHandle,\n const std::shared_ptr< OCResource > resource)\n {\n uint8_t resourceProperty = OC_DISCOVERABLE | OC_OBSERVABLE;\n std::vector<std::string> resourceTypes = resource->getResourceTypes();\n\n return checked_guard(m_server, &IServerWrapper::registerResource,\n std::ref(resourceHandle), resource->uri(),\n resourceTypes[0]\/*\"core.remote\"*\/, DEFAULT_INTERFACE,\n (EntityHandler) nullptr, resourceProperty);\n }\n\n OCStackResult OCPlatform_impl::unregisterResource(const OCResourceHandle& resourceHandle) const\n {\n return checked_guard(m_server, &IServerWrapper::unregisterResource,\n resourceHandle);\n }\n\n OCStackResult OCPlatform_impl::unbindResource(OCResourceHandle collectionHandle,\n OCResourceHandle resourceHandle)\n {\n return result_guard(OCUnBindResource(std::ref(collectionHandle), std::ref(resourceHandle)));\n }\n\n OCStackResult OCPlatform_impl::unbindResources(const OCResourceHandle collectionHandle,\n const std::vector<OCResourceHandle>& resourceHandles)\n {\n for(const auto& h : resourceHandles)\n {\n OCStackResult r;\n\n if(OC_STACK_OK != (r = result_guard(OCUnBindResource(collectionHandle, h))))\n {\n return r;\n }\n }\n\n return OC_STACK_OK;\n }\n\n OCStackResult OCPlatform_impl::bindResource(const OCResourceHandle collectionHandle,\n const OCResourceHandle resourceHandle)\n {\n return result_guard(OCBindResource(collectionHandle, resourceHandle));\n }\n\n OCStackResult OCPlatform_impl::bindResources(const OCResourceHandle collectionHandle,\n const std::vector<OCResourceHandle>& resourceHandles)\n {\n for(const auto& h : resourceHandles)\n {\n OCStackResult r;\n\n if(OC_STACK_OK != (r = result_guard(OCBindResource(collectionHandle, h))))\n {\n return r;\n }\n }\n\n return OC_STACK_OK;\n }\n\n OCStackResult OCPlatform_impl::bindTypeToResource(const OCResourceHandle& resourceHandle,\n const std::string& resourceTypeName) const\n {\n return checked_guard(m_server, &IServerWrapper::bindTypeToResource,\n resourceHandle, resourceTypeName);\n }\n\n OCStackResult OCPlatform_impl::bindInterfaceToResource(const OCResourceHandle& resourceHandle,\n const std::string& resourceInterfaceName) const\n {\n return checked_guard(m_server, &IServerWrapper::bindInterfaceToResource,\n resourceHandle, resourceInterfaceName);\n }\n\n OCStackResult OCPlatform_impl::startPresence(const unsigned int announceDurationSeconds)\n {\n return checked_guard(m_server, &IServerWrapper::startPresence,\n announceDurationSeconds);\n }\n\n OCStackResult OCPlatform_impl::stopPresence()\n {\n return checked_guard(m_server, &IServerWrapper::stopPresence);\n }\n\n OCStackResult OCPlatform_impl::subscribePresence(OCPresenceHandle& presenceHandle,\n const std::string& host,\n OCConnectivityType connectivityType,\n SubscribeCallback presenceHandler)\n {\n return subscribePresence(presenceHandle, host, \"\", connectivityType, presenceHandler);\n }\n\n\n OCStackResult OCPlatform_impl::subscribePresence(OCPresenceHandle& presenceHandle,\n const std::string& host,\n const std::string& resourceType,\n OCConnectivityType connectivityType,\n SubscribeCallback presenceHandler)\n {\n return checked_guard(m_client, &IClientWrapper::SubscribePresence,\n &presenceHandle, host, resourceType, connectivityType,\n presenceHandler);\n }\n\n OCStackResult OCPlatform_impl::unsubscribePresence(OCPresenceHandle presenceHandle)\n {\n return checked_guard(m_client, &IClientWrapper::UnsubscribePresence,\n std::ref(presenceHandle));\n }\n\n OCStackResult OCPlatform_impl::sendResponse(const std::shared_ptr<OCResourceResponse> pResponse)\n {\n return checked_guard(m_server, &IServerWrapper::sendResponse,\n pResponse);\n }\n} \/\/namespace OC\n\n<commit_msg>Fix issue the previous CreateResourceWithHost change<commit_after>\/\/******************************************************************\n\/\/\n\/\/ Copyright 2014 Intel Mobile Communications GmbH All Rights Reserved.\n\/\/\n\/\/-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=\n\/\/\n\/\/ Licensed under the Apache License, Version 2.0 (the \"License\");\n\/\/ you may not use this file except in compliance with the License.\n\/\/ You may obtain a copy of the License at\n\/\/\n\/\/ http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n\/\/\n\/\/ Unless required by applicable law or agreed to in writing, software\n\/\/ distributed under the License is distributed on an \"AS IS\" BASIS,\n\/\/ WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n\/\/ See the License for the specific language governing permissions and\n\/\/ limitations under the License.\n\/\/\n\/\/-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=\n\n\/\/******************************************************************\n\/\/ File name:\n\/\/ OCPlatform_impl.cpp\n\/\/\n\/\/ Description: Implementation of the OCPlatform functionality. It contains\n\/\/ a singleton interface that is used only by the OCPlatform namespace and is the\n\/\/ central entrance to the stack.\n\/\/\n\/\/\n\/\/\n\/\/*********************************************************************\n\n#include \"OCPlatform_impl.h\"\n\n#include <random>\n#include <utility>\n#include <functional>\n\n#include \"ocstack.h\"\n\n#include \"OCPlatform.h\"\n#include \"OCApi.h\"\n#include \"OCException.h\"\n#include \"OCUtilities.h\"\n\n#include \"oc_logger.hpp\"\n\nnamespace OC\n{\n\n PlatformConfig& OCPlatform_impl::globalConfig()\n {\n static PlatformConfig s_config;\n return s_config;\n }\n\n void OCPlatform_impl::Configure(const PlatformConfig& config)\n {\n globalConfig() = config;\n }\n\n OCPlatform_impl& OCPlatform_impl::Instance()\n {\n static OCPlatform_impl platform(globalConfig());\n return platform;\n }\n\n void OCPlatform_impl::init(const PlatformConfig& config)\n {\n switch(config.mode)\n {\n case ModeType::Server:\n m_server = m_WrapperInstance->CreateServerWrapper(m_csdkLock, config);\n break;\n\n case ModeType::Client:\n m_client = m_WrapperInstance->CreateClientWrapper(m_csdkLock, config);\n break;\n\n case ModeType::Both:\n m_server = m_WrapperInstance->CreateServerWrapper(m_csdkLock, config);\n m_client = m_WrapperInstance->CreateClientWrapper(m_csdkLock, config);\n break;\n }\n }\n\n OCPlatform_impl::OCPlatform_impl(const PlatformConfig& config)\n : m_cfg { config },\n m_WrapperInstance { make_unique<WrapperFactory>() },\n m_csdkLock { std::make_shared<std::recursive_mutex>() }\n {\n init(m_cfg);\n }\n\n OCPlatform_impl::~OCPlatform_impl(void)\n {\n }\n\n OCStackResult OCPlatform_impl::setDefaultDeviceEntityHandler(EntityHandler entityHandler)\n {\n return checked_guard(m_server, &IServerWrapper::setDefaultDeviceEntityHandler,\n entityHandler);\n }\n\n OCStackResult OCPlatform_impl::notifyAllObservers(OCResourceHandle resourceHandle,\n QualityOfService QoS)\n {\n return result_guard(OCNotifyAllObservers(resourceHandle,\n static_cast<OCQualityOfService>(QoS)));\n }\n\n OCStackResult OCPlatform_impl::notifyAllObservers(OCResourceHandle resourceHandle)\n {\n return notifyAllObservers(resourceHandle, m_cfg.QoS);\n }\n\n OCStackResult OCPlatform_impl::notifyListOfObservers(OCResourceHandle resourceHandle,\n ObservationIds& observationIds,\n const std::shared_ptr<OCResourceResponse> pResponse)\n {\n return notifyListOfObservers(resourceHandle, observationIds, pResponse, m_cfg.QoS);\n }\n\n OCStackResult OCPlatform_impl::notifyListOfObservers(OCResourceHandle resourceHandle,\n ObservationIds& observationIds,\n const std::shared_ptr<OCResourceResponse> pResponse,\n QualityOfService QoS)\n {\n if(!pResponse)\n {\n return result_guard(OC_STACK_ERROR);\n }\n\n std::string payload(pResponse->getResourceRepresentation().getJSONRepresentation());\n\n return result_guard(\n OCNotifyListOfObservers(resourceHandle,\n &observationIds[0], observationIds.size(),\n payload.c_str(),\n static_cast<OCQualityOfService>(QoS)));\n }\n\n OCResource::Ptr OCPlatform_impl::constructResourceObject(const std::string& host,\n const std::string& uri,\n OCConnectivityType connectivityType,\n bool isObservable,\n const std::vector<std::string>& resourceTypes,\n const std::vector<std::string>& interfaces)\n {\n if(!m_client)\n {\n return std::shared_ptr<OCResource>();\n }\n\n return std::shared_ptr<OCResource>(new OCResource(m_client,\n host,\n uri, \"\", connectivityType,\n isObservable,\n resourceTypes,\n interfaces));\n }\n\n OCStackResult OCPlatform_impl::findResource(const std::string& host,\n const std::string& resourceName,\n OCConnectivityType connectivityType,\n FindCallback resourceHandler)\n {\n return findResource(host, resourceName, connectivityType, resourceHandler, m_cfg.QoS);\n }\n\n OCStackResult OCPlatform_impl::findResource(const std::string& host,\n const std::string& resourceName,\n OCConnectivityType connectivityType,\n FindCallback resourceHandler,\n QualityOfService QoS)\n {\n return checked_guard(m_client, &IClientWrapper::ListenForResource,\n host, resourceName, connectivityType, resourceHandler, QoS);\n }\n\n OCStackResult OCPlatform_impl::getDeviceInfo(const std::string& host,\n const std::string& deviceURI,\n OCConnectivityType connectivityType,\n FindDeviceCallback deviceInfoHandler)\n {\n return result_guard(getDeviceInfo(host, deviceURI, connectivityType,\n deviceInfoHandler, m_cfg.QoS));\n }\n\n OCStackResult OCPlatform_impl::getDeviceInfo(const std::string& host,\n const std::string& deviceURI,\n OCConnectivityType connectivityType,\n FindDeviceCallback deviceInfoHandler,\n QualityOfService QoS)\n {\n return checked_guard(m_client, &IClientWrapper::ListenForDevice,\n host, deviceURI, connectivityType, deviceInfoHandler, QoS);\n }\n\n OCStackResult OCPlatform_impl::getPlatformInfo(const std::string& host,\n const std::string& platformURI,\n OCConnectivityType connectivityType,\n FindPlatformCallback platformInfoHandler)\n {\n return result_guard(getPlatformInfo(host, platformURI, connectivityType,\n platformInfoHandler, m_cfg.QoS));\n }\n\n OCStackResult OCPlatform_impl::getPlatformInfo(const std::string& host,\n const std::string& platformURI,\n OCConnectivityType connectivityType,\n FindPlatformCallback platformInfoHandler,\n QualityOfService QoS)\n {\n return checked_guard(m_client, &IClientWrapper::ListenForDevice,\n host, platformURI, connectivityType, platformInfoHandler, QoS);\n }\n\n OCStackResult OCPlatform_impl::registerResource(OCResourceHandle& resourceHandle,\n std::string& resourceURI,\n const std::string& resourceTypeName,\n const std::string& resourceInterface,\n EntityHandler entityHandler,\n uint8_t resourceProperty)\n {\n return checked_guard(m_server, &IServerWrapper::registerResource,\n std::ref(resourceHandle), resourceURI, resourceTypeName,\n resourceInterface, entityHandler, resourceProperty);\n }\n\n OCStackResult OCPlatform_impl::registerDeviceInfo(const OCDeviceInfo deviceInfo)\n {\n return checked_guard(m_server, &IServerWrapper::registerDeviceInfo, deviceInfo);\n }\n\n OCStackResult OCPlatform_impl::registerPlatformInfo(const OCPlatformInfo platformInfo)\n {\n return checked_guard(m_server, &IServerWrapper::registerPlatformInfo, platformInfo);\n }\n\n OCStackResult OCPlatform_impl::registerResource(OCResourceHandle& resourceHandle,\n const std::shared_ptr< OCResource > resource)\n {\n uint8_t resourceProperty = OC_DISCOVERABLE | OC_OBSERVABLE;\n std::vector<std::string> resourceTypes = resource->getResourceTypes();\n\n return checked_guard(m_server, &IServerWrapper::registerResource,\n std::ref(resourceHandle), resource->host() + resource->uri(),\n resourceTypes[0]\/*\"core.remote\"*\/, DEFAULT_INTERFACE,\n (EntityHandler) nullptr, resourceProperty);\n }\n\n OCStackResult OCPlatform_impl::unregisterResource(const OCResourceHandle& resourceHandle) const\n {\n return checked_guard(m_server, &IServerWrapper::unregisterResource,\n resourceHandle);\n }\n\n OCStackResult OCPlatform_impl::unbindResource(OCResourceHandle collectionHandle,\n OCResourceHandle resourceHandle)\n {\n return result_guard(OCUnBindResource(std::ref(collectionHandle), std::ref(resourceHandle)));\n }\n\n OCStackResult OCPlatform_impl::unbindResources(const OCResourceHandle collectionHandle,\n const std::vector<OCResourceHandle>& resourceHandles)\n {\n for(const auto& h : resourceHandles)\n {\n OCStackResult r;\n\n if(OC_STACK_OK != (r = result_guard(OCUnBindResource(collectionHandle, h))))\n {\n return r;\n }\n }\n\n return OC_STACK_OK;\n }\n\n OCStackResult OCPlatform_impl::bindResource(const OCResourceHandle collectionHandle,\n const OCResourceHandle resourceHandle)\n {\n return result_guard(OCBindResource(collectionHandle, resourceHandle));\n }\n\n OCStackResult OCPlatform_impl::bindResources(const OCResourceHandle collectionHandle,\n const std::vector<OCResourceHandle>& resourceHandles)\n {\n for(const auto& h : resourceHandles)\n {\n OCStackResult r;\n\n if(OC_STACK_OK != (r = result_guard(OCBindResource(collectionHandle, h))))\n {\n return r;\n }\n }\n\n return OC_STACK_OK;\n }\n\n OCStackResult OCPlatform_impl::bindTypeToResource(const OCResourceHandle& resourceHandle,\n const std::string& resourceTypeName) const\n {\n return checked_guard(m_server, &IServerWrapper::bindTypeToResource,\n resourceHandle, resourceTypeName);\n }\n\n OCStackResult OCPlatform_impl::bindInterfaceToResource(const OCResourceHandle& resourceHandle,\n const std::string& resourceInterfaceName) const\n {\n return checked_guard(m_server, &IServerWrapper::bindInterfaceToResource,\n resourceHandle, resourceInterfaceName);\n }\n\n OCStackResult OCPlatform_impl::startPresence(const unsigned int announceDurationSeconds)\n {\n return checked_guard(m_server, &IServerWrapper::startPresence,\n announceDurationSeconds);\n }\n\n OCStackResult OCPlatform_impl::stopPresence()\n {\n return checked_guard(m_server, &IServerWrapper::stopPresence);\n }\n\n OCStackResult OCPlatform_impl::subscribePresence(OCPresenceHandle& presenceHandle,\n const std::string& host,\n OCConnectivityType connectivityType,\n SubscribeCallback presenceHandler)\n {\n return subscribePresence(presenceHandle, host, \"\", connectivityType, presenceHandler);\n }\n\n\n OCStackResult OCPlatform_impl::subscribePresence(OCPresenceHandle& presenceHandle,\n const std::string& host,\n const std::string& resourceType,\n OCConnectivityType connectivityType,\n SubscribeCallback presenceHandler)\n {\n return checked_guard(m_client, &IClientWrapper::SubscribePresence,\n &presenceHandle, host, resourceType, connectivityType,\n presenceHandler);\n }\n\n OCStackResult OCPlatform_impl::unsubscribePresence(OCPresenceHandle presenceHandle)\n {\n return checked_guard(m_client, &IClientWrapper::UnsubscribePresence,\n std::ref(presenceHandle));\n }\n\n OCStackResult OCPlatform_impl::sendResponse(const std::shared_ptr<OCResourceResponse> pResponse)\n {\n return checked_guard(m_server, &IServerWrapper::sendResponse,\n pResponse);\n }\n} \/\/namespace OC\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** 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 <QtDeclarative\/qdeclarativeextensionplugin.h>\n#include <QtDeclarative\/qdeclarative.h>\n\n#include \"qdeclarativebatteryinfo_p.h\"\n#include \"qdeclarativedeviceinfo_p.h\"\n#include <qdeviceprofile.h>\n#include <qdisplayinfo.h>\n#include <qinputdeviceinfo.h>\n#include \"qdeclarativenetworkinfo_p.h\"\n#include <qscreensaver.h>\n#include \"qdeclarativestorageinfo_p.h\"\n\nQT_BEGIN_NAMESPACE\n\nclass QSystemInfoDeclarativeModule : public QDeclarativeExtensionPlugin\n{\n Q_OBJECT\n\npublic:\n virtual void registerTypes(const char *uri)\n {\n Q_ASSERT(QLatin1String(uri) == QLatin1String(\"QtSystemInfo\"));\n\n int major = 5;\n int minor = 0;\n qmlRegisterType<QDeclarativeBatteryInfo>(uri, major, minor, \"BatteryInfo\");\n qmlRegisterType<QDeclarativeDeviceInfo>(uri, major, minor, \"DeviceInfo\");\n qmlRegisterType<QDeviceProfile>(uri, major, minor, \"DeviceProfile\");\n qmlRegisterType<QDisplayInfo>(uri, major, minor, \"DisplayInfo\");\n qmlRegisterType<QInputDeviceInfo>(uri, major, minor, \"InputDeviceInfo\");\n qmlRegisterType<QDeclarativeNetworkInfo>(uri, major, minor, \"NetworkInfo\");\n qmlRegisterType<QScreenSaver>(uri, major, minor, \"ScreenSaver\");\n qmlRegisterType<QDeclarativeStorageInfo>(uri, major, minor, \"StorageInfo\");\n }\n};\n\nQT_END_NAMESPACE\n\n#include \"qsysteminfo.moc\"\n\nQ_EXPORT_PLUGIN2(qsysteminfodeclarativemodule, QT_PREPEND_NAMESPACE(QSystemInfoDeclarativeModule))\n\n\/*!\n \\qmlclass ScreenSaver QScreenSaver\n \\inmodule QtSystemInfo\n \\ingroup qml-systeminfo\n \\brief The ScreenSaver element provides information of the screen saver.\n*\/\n\n\/*!\n \\qmlproperty bool ScreenSaver::screenSaverEnabled\n\n This property holds whether or not the screen saver is enabled.\n\n On certain platforms, if screen saver is disabled, deep system sleep won't be automatically triggered,\n and the display won't be automatically turned off, etc.\n *\/\n<commit_msg>Add the doc for QML DeviceProfile element.<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** 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 <QtDeclarative\/qdeclarativeextensionplugin.h>\n#include <QtDeclarative\/qdeclarative.h>\n\n#include \"qdeclarativebatteryinfo_p.h\"\n#include \"qdeclarativedeviceinfo_p.h\"\n#include <qdeviceprofile.h>\n#include <qdisplayinfo.h>\n#include <qinputdeviceinfo.h>\n#include \"qdeclarativenetworkinfo_p.h\"\n#include <qscreensaver.h>\n#include \"qdeclarativestorageinfo_p.h\"\n\nQT_BEGIN_NAMESPACE\n\nclass QSystemInfoDeclarativeModule : public QDeclarativeExtensionPlugin\n{\n Q_OBJECT\n\npublic:\n virtual void registerTypes(const char *uri)\n {\n Q_ASSERT(QLatin1String(uri) == QLatin1String(\"QtSystemInfo\"));\n\n int major = 5;\n int minor = 0;\n qmlRegisterType<QDeclarativeBatteryInfo>(uri, major, minor, \"BatteryInfo\");\n qmlRegisterType<QDeclarativeDeviceInfo>(uri, major, minor, \"DeviceInfo\");\n qmlRegisterType<QDeviceProfile>(uri, major, minor, \"DeviceProfile\");\n qmlRegisterType<QDisplayInfo>(uri, major, minor, \"DisplayInfo\");\n qmlRegisterType<QInputDeviceInfo>(uri, major, minor, \"InputDeviceInfo\");\n qmlRegisterType<QDeclarativeNetworkInfo>(uri, major, minor, \"NetworkInfo\");\n qmlRegisterType<QScreenSaver>(uri, major, minor, \"ScreenSaver\");\n qmlRegisterType<QDeclarativeStorageInfo>(uri, major, minor, \"StorageInfo\");\n }\n};\n\nQT_END_NAMESPACE\n\n#include \"qsysteminfo.moc\"\n\nQ_EXPORT_PLUGIN2(qsysteminfodeclarativemodule, QT_PREPEND_NAMESPACE(QSystemInfoDeclarativeModule))\n\n\/*!\n \\qmlclass ScreenSaver QScreenSaver\n \\inmodule QtSystemInfo\n \\ingroup qml-systeminfo\n \\brief The ScreenSaver element provides information of the screen saver.\n*\/\n\n\/*!\n \\qmlproperty bool ScreenSaver::screenSaverEnabled\n\n This property holds whether or not the screen saver is enabled.\n\n On certain platforms, if screen saver is disabled, deep system sleep won't be automatically triggered,\n and the display won't be automatically turned off, etc.\n *\/\n\n\n\/*!\n \\qmlclass DeviceProfile QDeviceProfile\n \\inmodule QtSystemInfo\n \\ingroup qml-systeminfo\n \\brief The DeviceProfile element provides information for the profile of the device.\n*\/\n\n\/*!\n \\qmlmethod bool DeviceProfile::isVibrationActivated()\n\n Returns true if the vibration is currently activated, or false otherwise.\n *\/\n\n\/*!\n \\qmlmethod int DeviceProfile::messageRingtoneVolume()\n\n Returns the current message ringtone volume, from 0 to 100. If this information is unknown, or\n error occurs, -1 is returned.\n *\/\n\n\/*!\n \\qmlmethod int DeviceProfile::voiceRingtoneVolume()\n\n Returns the current voice ringtone volume, from 0 to 100. If this information is unknown, or error\n occurs, -1 is returned.\n *\/\n\n\/*!\n \\qmlproperty enum DeviceProfile::profileType()\n\n Returns the type of the current profile, possible types are:\n \\list\n \\o UnknownProfile Profile unknown or on error.\n \\o SilentProfile Neither sound nor vibration is on.\n \\o NormalProfile Normal sound is on.\n \\o VibrationProfile Only vibration is on, and sound is off.\n \\o BeepProfile Only beep is on.\n \\endlist\n *\/\n<|endoftext|>"} {"text":"<commit_before>#include <iostream>\n\n#include \"occa.hpp\"\n\n\nint main(int argc, char **argv){\n\n int entries = 5;\n\n float *a = new float[entries];\n float *b = new float[entries];\n float *ab = new float[entries];\n\n for(int i = 0; i < entries; ++i){\n a[i] = (float) i;\n b[i] = (float) (1 - i);\n ab[i] = 0;\n }\n\n int int_size = sizeof(int);\n int pointer_size = sizeof(void*);\n int size_t_size = sizeof(size_t);\n int long_size = sizeof(long);\n std::cout << \"Hello from addVectors: \"\n << \" integer size: \" << int_size\n\t << \" long size: \" << long_size\n << \" pointer size: \" << pointer_size\n\t << \" size_t size: \" << size_t_size << std::endl;\n \n\n\n \/\/ occa::availableDevices<occa::OpenCL>();\n \n std::string mode = \"OpenMP\";\n\n<<<<<<< HEAD\n std::string mode = \"OpenMP\";\n=======\n>>>>>>> 4faa48ec859b34cebcf89c9c3d1df76f8c94cd5b\n int platformID = 0;\n int deviceID = 0;\n \n occa::device device;\n occa::kernel addVectors;\n occa::memory o_a, o_b, o_ab;\n\n device.setup(mode, platformID, deviceID);\n \n o_a = device.malloc(entries*sizeof(float));\n o_b = device.malloc(entries*sizeof(float));\n o_ab = device.malloc(entries*sizeof(float));\n\n char *occaDir_ = getenv(\"OCCA_DIR\");\n std::string addVectors_occa(\"addVectors.occa\");\n if(occaDir_ != NULL) {\n\t std::string occaDir(occaDir_);\n\t addVectors_occa = occaDir + \"\/examples\/addVectors\/\" + addVectors_occa;\n }\n\n addVectors = device.buildKernelFromSource(addVectors_occa.c_str(),\n \"addVectors\");\n\n int dims = 1;\n int itemsPerGroup(2);\n int groups((entries + itemsPerGroup - 1)\/itemsPerGroup);\n\n addVectors.setWorkingDims(dims, itemsPerGroup, groups);\n\n o_a.copyFrom(a);\n o_b.copyFrom(b);\n\n addVectors(entries, o_a, o_b, o_ab);\n\n o_ab.copyTo(ab);\n\n for(int i = 0; i < 5; ++i)\n std::cout << i << \": \" << ab[i] << '\\n';\n\n delete [] a;\n delete [] b;\n delete [] ab;\n\n addVectors.free();\n o_a.free();\n o_b.free();\n o_ab.free();\n device.free();\n \n}\n<commit_msg>b4 merge<commit_after>#include <iostream>\n\n#include \"occa.hpp\"\n\n\nint main(int argc, char **argv){\n\n int entries = 5;\n\n float *a = new float[entries];\n float *b = new float[entries];\n float *ab = new float[entries];\n\n for(int i = 0; i < entries; ++i){\n a[i] = (float) i;\n b[i] = (float) (1 - i);\n ab[i] = 0;\n }\n\n int int_size = sizeof(int);\n int pointer_size = sizeof(void*);\n int size_t_size = sizeof(size_t);\n int long_size = sizeof(long);\n std::cout << \"Hello from addVectors: \"\n << \" integer size: \" << int_size\n\t << \" long size: \" << long_size\n << \" pointer size: \" << pointer_size\n\t << \" size_t size: \" << size_t_size << std::endl;\n \n\n\n \/\/ occa::availableDevices<occa::OpenCL>();\n \n std::string mode = \"OpenMP\";\n int platformID = 0;\n int deviceID = 0;\n \n occa::device device;\n occa::kernel addVectors;\n occa::memory o_a, o_b, o_ab;\n\n device.setup(mode, platformID, deviceID);\n \n o_a = device.malloc(entries*sizeof(float));\n o_b = device.malloc(entries*sizeof(float));\n o_ab = device.malloc(entries*sizeof(float));\n\n char *occaDir_ = getenv(\"OCCA_DIR\");\n std::string addVectors_occa(\"addVectors.occa\");\n if(occaDir_ != NULL) {\n\t std::string occaDir(occaDir_);\n\t addVectors_occa = occaDir + \"\/examples\/addVectors\/\" + addVectors_occa;\n }\n\n \/\/device.setCompilerEnvScript(\n\n addVectors = device.buildKernelFromSource(addVectors_occa.c_str(),\n \"addVectors\");\n\n int dims = 1;\n int itemsPerGroup(2);\n int groups((entries + itemsPerGroup - 1)\/itemsPerGroup);\n\n addVectors.setWorkingDims(dims, itemsPerGroup, groups);\n\n o_a.copyFrom(a);\n o_b.copyFrom(b);\n\n addVectors(entries, o_a, o_b, o_ab);\n\n o_ab.copyTo(ab);\n\n for(int i = 0; i < 5; ++i)\n std::cout << i << \": \" << ab[i] << '\\n';\n\n delete [] a;\n delete [] b;\n delete [] ab;\n\n addVectors.free();\n o_a.free();\n o_b.free();\n o_ab.free();\n device.free();\n \n}\n<|endoftext|>"} {"text":"<commit_before>#pragma once\n\/\/ blas_utils.hpp : include file containing templated utilities to work with vectors and matrices\n\/\/\n\/\/ Copyright (C) 2017-2018 Stillwater Supercomputing, Inc.\n\/\/\n\/\/ This file is part of the universal numbers project, which is released under an MIT Open Source license.\n#include <random>\n\n\/\/ initialize a vector\ntemplate<typename Vector, typename Scalar>\nvoid init(Vector& x, const Scalar& value) {\n\tfor (size_t i = 0; i < x.size(); ++i) x[i] = value;\n}\n\n\/\/ These functions print matrices and vectors in a nice format\ntemplate<typename Ty>\nvoid printMatrix(std::ostream& ostr, const std::string& name, const std::vector<Ty>& m) {\n\tsize_t d = size_t(std::sqrt(m.size()));\n\tostr << \"Matrix: \" << name << \" is \" << d << \"x\" << d << std::endl;\n\tstd::streamsize prec = ostr.precision();\n\tostr << std::setprecision(17);\n\tfor (size_t i = 0; i<d; ++i) {\n\t\tfor (size_t j = 0; j<d; ++j) std::cout << std::setw(20) << m[i*d + j] << \" \";\n\t\tostr << std::endl;\n\t}\n\tostr << std::setprecision(prec);\n}\n\ntemplate<typename Ty>\nvoid printVector(std::ostream& ostr, const std::string& name, const std::vector<Ty>& v) {\n\tsize_t d = v.size();\n\tostr << \"Vector: \" << name << \" is of size \" << d << \" elements\" << std::endl;\n\tstd::streamsize prec = ostr.precision();\n\tostr << std::setprecision(17);\n\tfor (size_t j = 0; j<d; ++j) std::cout << std::setw(20) << v[j] << \" \";\n\tostr << std::setprecision(prec) << std::endl;\n}\n\n\/\/ print a vector\ntemplate<typename vector_T>\nvoid print(std::ostream& ostr, size_t n, vector_T& x, size_t incx = 1) {\n\tsize_t cnt, ix;\n\tfor (cnt = 0, ix = 0; cnt < n && ix < x.size(); ++cnt, ix += incx) {\n\t\tcnt == 0 ? ostr << \"[\" << x[ix] : ostr << \", \" << x[ix];\n\t}\n\tostr << \"]\";\n}\n\n\/\/ generate a vector of random permutations around 1.0\n\/\/ contraction is a right shift of the mantissa causing smaller fluctuations\ntemplate<typename element_T>\nvoid randomVectorFillAroundOneEPS(size_t n, std::vector<element_T>& vec, size_t contraction = 6) {\n\t\/\/ Use random_device to generate a seed for Mersenne twister engine.\n\tstd::random_device rd{};\n\t\/\/ Use Mersenne twister engine to generate pseudo-random numbers.\n\tstd::mt19937 engine{ rd() };\n\t\/\/ \"Filter\" MT engine's output to generate pseudo-random double values,\n\t\/\/ **uniformly distributed** on the closed interval [0, 1].\n\t\/\/ (Note that the range is [inclusive, inclusive].)\n\tstd::uniform_real_distribution<double> dist{ 0.0, 1.0 };\n\t\/\/ Pattern to generate pseudo-random number.\n\t\/\/ double rnd_value = dist(engine);\n\n\tdouble scale = std::pow(2, double(0.0-contraction));\n\tfor (size_t i = 0; i < n; ++i) {\n\t\t\/\/ generate random value between [-0.5, 0.5], and contract\n\t\tdouble eps = (dist(engine) - 0.5) * scale;\n\t\tdouble v = 1.0 + eps;\n\t\tvec[i] = (element_T)v;\n\t}\n}\n\n\/\/ generate a vector of random permutations around 1.0\n\/\/ contraction is a right shift of the mantissa causing smaller fluctuations\ntemplate<typename element_T>\nvoid randomVectorFillAroundZeroEPS(size_t n, std::vector<element_T>& vec, size_t contraction = 6) {\n\t\/\/ Use random_device to generate a seed for Mersenne twister engine.\n\tstd::random_device rd{};\n\t\/\/ Use Mersenne twister engine to generate pseudo-random numbers.\n\tstd::mt19937 engine{ rd() };\n\t\/\/ \"Filter\" MT engine's output to generate pseudo-random double values,\n\t\/\/ **uniformly distributed** on the closed interval [0, 1].\n\t\/\/ (Note that the range is [inclusive, inclusive].)\n\tstd::uniform_real_distribution<double> dist{ 0.0, 1.0 };\n\t\/\/ Pattern to generate pseudo-random number.\n\t\/\/ double rnd_value = dist(engine);\n\n\tdouble scale = std::pow(2, double(0.0 - contraction));\n\tfor (size_t i = 0; i < n; ++i) {\n\t\t\/\/ generate random value between [-0.5, 0.5], and contract\n\t\tdouble eps = (dist(engine) - 0.5) * scale;\n\t\tdouble v = 0.0 + eps;\n\t\tvec[i] = (element_T)v;\n\t}\n}\n\n\/\/ print a sampling of the provided vector\n\/\/ if samples is set to 0, all elements of the vector are printed\ntemplate<typename element_T>\nvoid sampleVector(std::string vec_name, std::vector<element_T>& vec, uint32_t start = 0, uint32_t incr = 1, uint32_t nrSamples = 0) {\n\tstd::cout << \"Vector sample is: \" << '\\n';\n\tstd::streamsize prec = std::cout.precision();\n\tif (nrSamples) {\n\t\tuint32_t printed = 0;\n\t\tfor (uint32_t i = start; i < vec.size(); i += incr) {\n\t\t\tif (printed < nrSamples) {\n\t\t\t\tprinted++;\n\t\t\t\tstd::cout << vec_name << \"[\" << std::setw(3) << i << \"] = \" << std::setprecision(15) << vec[i] << '\\n';\n\t\t\t}\n\t\t}\n\t}\n\telse {\n\t\tfor (uint32_t i = start; i < vec.size(); i += incr) {\n\t\t\tstd::cout << vec_name << \"[\" << std::setw(3) << i << \"] = \" << std::setprecision(15) << vec[i] << '\\n';\n\t\t}\n\t}\n\tstd::cout << std::setprecision(prec) << std::endl;\n}\n\ntemplate<typename Scalar>\nvoid GenerateHilbertMatrix(int N, std::vector<Scalar>& m) {\n\tassert(N*N == m.size());\n\tfor (int i = 1; i <= N; ++i) {\n\t\tfor (int j = 1; j <= N; ++j) {\n\t\t\tm[(i-1)*N + (j-1)] = Scalar(1.0) \/ Scalar(i + j - 1);\n\t\t}\n\t}\n}\n\nuint64_t factorial(uint64_t n) {\n\treturn (n == 0 || n == 1) ? 1 : factorial(n - 1) * n;\n}\n\n\/\/ (n over k) = n! \/ k!(n-k)!\ntemplate<typename Scalar>\nScalar BinomialCoefficient(uint64_t n, uint64_t k) {\n\tScalar numerator = Scalar(factorial(n));\n\tScalar denominator = Scalar(factorial(k)*factorial(n - k));\n\tScalar coef = numerator \/ denominator;\n\/\/\tstd::cout << numerator << \" \/ \" << denominator << \" = \" << coef << std::endl;\n\tif (coef * denominator != numerator) std::cout << \"FAIL: (\" << n << \" over \" << k << \")\" << std::endl;\n\treturn coef;\n}\n\ntemplate<typename Scalar>\nvoid GenerateHilbertMatrixInverse(int N, std::vector<Scalar>& m) {\n\tassert(N*N == m.size());\n\tfor (int i = 1; i <= N; ++i) {\n\t\tfor (int j = 1; j <= N; ++j) {\n\t\t\tScalar sign = ((i + j) % 2) ? Scalar(-1) : Scalar(1);\n\t\t\tScalar factor1 = Scalar(i + j - 1);\n\t\t\tScalar factor2 = BinomialCoefficient<Scalar>(N + i - 1, N - j);\n\t\t\tScalar factor3 = BinomialCoefficient<Scalar>(N + j - 1, N - i);\n\t\t\tScalar factor4 = BinomialCoefficient<Scalar>(i + j - 2, i - 1);\n\t\t\tm[(i - 1)*N + (j - 1)] = Scalar(sign * factor1 * factor2 * factor3 * factor4 * factor4);\n\t\t}\n\t}\n}<commit_msg>Scaling the Hilbert matrix to make the presentation easier to judge<commit_after>#pragma once\n\/\/ blas_utils.hpp : include file containing templated utilities to work with vectors and matrices\n\/\/\n\/\/ Copyright (C) 2017-2018 Stillwater Supercomputing, Inc.\n\/\/\n\/\/ This file is part of the universal numbers project, which is released under an MIT Open Source license.\n#include <random>\n\n\/\/ initialize a vector\ntemplate<typename Vector, typename Scalar>\nvoid init(Vector& x, const Scalar& value) {\n\tfor (size_t i = 0; i < x.size(); ++i) x[i] = value;\n}\n\n\/\/ These functions print matrices and vectors in a nice format\ntemplate<typename Ty>\nvoid printMatrix(std::ostream& ostr, const std::string& name, const std::vector<Ty>& m) {\n\tsize_t d = size_t(std::sqrt(m.size()));\n\tostr << \"Matrix: \" << name << \" is \" << d << \"x\" << d << std::endl;\n\tstd::streamsize prec = ostr.precision();\n\tostr << std::setprecision(17);\n\tfor (size_t i = 0; i<d; ++i) {\n\t\tfor (size_t j = 0; j<d; ++j) std::cout << std::setw(20) << m[i*d + j] << \" \";\n\t\tostr << std::endl;\n\t}\n\tostr << std::setprecision(prec);\n}\n\ntemplate<typename Ty>\nvoid printVector(std::ostream& ostr, const std::string& name, const std::vector<Ty>& v) {\n\tsize_t d = v.size();\n\tostr << \"Vector: \" << name << \" is of size \" << d << \" elements\" << std::endl;\n\tstd::streamsize prec = ostr.precision();\n\tostr << std::setprecision(17);\n\tfor (size_t j = 0; j<d; ++j) std::cout << std::setw(20) << v[j] << \" \";\n\tostr << std::setprecision(prec) << std::endl;\n}\n\n\/\/ print a vector\ntemplate<typename vector_T>\nvoid print(std::ostream& ostr, size_t n, vector_T& x, size_t incx = 1) {\n\tsize_t cnt, ix;\n\tfor (cnt = 0, ix = 0; cnt < n && ix < x.size(); ++cnt, ix += incx) {\n\t\tcnt == 0 ? ostr << \"[\" << x[ix] : ostr << \", \" << x[ix];\n\t}\n\tostr << \"]\";\n}\n\n\/\/ generate a vector of random permutations around 1.0\n\/\/ contraction is a right shift of the mantissa causing smaller fluctuations\ntemplate<typename element_T>\nvoid randomVectorFillAroundOneEPS(size_t n, std::vector<element_T>& vec, size_t contraction = 6) {\n\t\/\/ Use random_device to generate a seed for Mersenne twister engine.\n\tstd::random_device rd{};\n\t\/\/ Use Mersenne twister engine to generate pseudo-random numbers.\n\tstd::mt19937 engine{ rd() };\n\t\/\/ \"Filter\" MT engine's output to generate pseudo-random double values,\n\t\/\/ **uniformly distributed** on the closed interval [0, 1].\n\t\/\/ (Note that the range is [inclusive, inclusive].)\n\tstd::uniform_real_distribution<double> dist{ 0.0, 1.0 };\n\t\/\/ Pattern to generate pseudo-random number.\n\t\/\/ double rnd_value = dist(engine);\n\n\tdouble scale = std::pow(2, double(0.0-contraction));\n\tfor (size_t i = 0; i < n; ++i) {\n\t\t\/\/ generate random value between [-0.5, 0.5], and contract\n\t\tdouble eps = (dist(engine) - 0.5) * scale;\n\t\tdouble v = 1.0 + eps;\n\t\tvec[i] = (element_T)v;\n\t}\n}\n\n\/\/ generate a vector of random permutations around 1.0\n\/\/ contraction is a right shift of the mantissa causing smaller fluctuations\ntemplate<typename element_T>\nvoid randomVectorFillAroundZeroEPS(size_t n, std::vector<element_T>& vec, size_t contraction = 6) {\n\t\/\/ Use random_device to generate a seed for Mersenne twister engine.\n\tstd::random_device rd{};\n\t\/\/ Use Mersenne twister engine to generate pseudo-random numbers.\n\tstd::mt19937 engine{ rd() };\n\t\/\/ \"Filter\" MT engine's output to generate pseudo-random double values,\n\t\/\/ **uniformly distributed** on the closed interval [0, 1].\n\t\/\/ (Note that the range is [inclusive, inclusive].)\n\tstd::uniform_real_distribution<double> dist{ 0.0, 1.0 };\n\t\/\/ Pattern to generate pseudo-random number.\n\t\/\/ double rnd_value = dist(engine);\n\n\tdouble scale = std::pow(2, double(0.0 - contraction));\n\tfor (size_t i = 0; i < n; ++i) {\n\t\t\/\/ generate random value between [-0.5, 0.5], and contract\n\t\tdouble eps = (dist(engine) - 0.5) * scale;\n\t\tdouble v = 0.0 + eps;\n\t\tvec[i] = (element_T)v;\n\t}\n}\n\n\/\/ print a sampling of the provided vector\n\/\/ if samples is set to 0, all elements of the vector are printed\ntemplate<typename element_T>\nvoid sampleVector(std::string vec_name, std::vector<element_T>& vec, uint32_t start = 0, uint32_t incr = 1, uint32_t nrSamples = 0) {\n\tstd::cout << \"Vector sample is: \" << '\\n';\n\tstd::streamsize prec = std::cout.precision();\n\tif (nrSamples) {\n\t\tuint32_t printed = 0;\n\t\tfor (uint32_t i = start; i < vec.size(); i += incr) {\n\t\t\tif (printed < nrSamples) {\n\t\t\t\tprinted++;\n\t\t\t\tstd::cout << vec_name << \"[\" << std::setw(3) << i << \"] = \" << std::setprecision(15) << vec[i] << '\\n';\n\t\t\t}\n\t\t}\n\t}\n\telse {\n\t\tfor (uint32_t i = start; i < vec.size(); i += incr) {\n\t\t\tstd::cout << vec_name << \"[\" << std::setw(3) << i << \"] = \" << std::setprecision(15) << vec[i] << '\\n';\n\t\t}\n\t}\n\tstd::cout << std::setprecision(prec) << std::endl;\n}\n\ntemplate<typename Scalar>\nvoid GenerateHilbertMatrix(int N, std::vector<Scalar>& m) {\n\tassert(N*N == m.size());\n\tfor (int i = 1; i <= N; ++i) {\n\t\tfor (int j = 1; j <= N; ++j) {\n\t\t\tm[(i-1)*N + (j-1)] = Scalar(5*7*9) \/ Scalar(i + j - 1);\n\t\t}\n\t}\n}\n\nuint64_t factorial(uint64_t n) {\n\treturn (n == 0 || n == 1) ? 1 : factorial(n - 1) * n;\n}\n\n\/\/ (n over k) = n! \/ k!(n-k)!\ntemplate<typename Scalar>\nScalar BinomialCoefficient(uint64_t n, uint64_t k) {\n\tScalar numerator = Scalar(factorial(n));\n\tScalar denominator = Scalar(factorial(k)*factorial(n - k));\n\tScalar coef = numerator \/ denominator;\n\/\/\tstd::cout << numerator << \" \/ \" << denominator << \" = \" << coef << std::endl;\n\tif (coef * denominator != numerator) std::cout << \"FAIL: (\" << n << \" over \" << k << \")\" << std::endl;\n\treturn coef;\n}\n\ntemplate<typename Scalar>\nvoid GenerateHilbertMatrixInverse(int N, std::vector<Scalar>& m) {\n\tassert(N*N == m.size());\n\tfor (int i = 1; i <= N; ++i) {\n\t\tfor (int j = 1; j <= N; ++j) {\n\t\t\tScalar sign = ((i + j) % 2) ? Scalar(-1) : Scalar(1);\n\t\t\tScalar factor1 = Scalar(i + j - 1);\n\t\t\tScalar factor2 = BinomialCoefficient<Scalar>(N + i - 1, N - j);\n\t\t\tScalar factor3 = BinomialCoefficient<Scalar>(N + j - 1, N - i);\n\t\t\tScalar factor4 = BinomialCoefficient<Scalar>(i + j - 2, i - 1);\n\t\t\tm[(i - 1)*N + (j - 1)] = Scalar(sign * factor1 * factor2 * factor3 * factor4 * factor4);\n\t\t}\n\t}\n}<|endoftext|>"} {"text":"<commit_before>\/\/\n\/\/ Created by tag on 03\/01\/17.\n\/\/\n\n#include \"networktools.h\"\n\n\/* A simple server in the internet domain using TCP\n The port number is passed as an argument *\/\n#include <stdio.h>\n#include <stdlib.h>\n#include <string.h>\n#include <unistd.h>\n#include <sys\/types.h> \n#include <sys\/socket.h>\n#include <netinet\/in.h>\n\n\n\n\nvoid error(const char *msg)\n{\n perror(msg);\n exit(1);\n}\n\nint sockfd=-1, newsockfd=-1, portno;\nsocklen_t clilen;\nchar buffer[256];\nstruct sockaddr_in serv_addr, cli_addr;\nint n;\nint tour=0;\n\n\n\nint init_connection( char *port)\n{\n \n \n if (argc < 2) {\n fprintf(stderr,\"ERROR, no port provided\\n\");\n exit(1);\n }\n portno = atoi(port);\n\t\n\t sockfd = socket(AF_INET, SOCK_STREAM, 0);\n if (sockfd < 0) \n error(\"ERROR opening\\n\");\n \n \/\/if (setsockopt(sockfd, SOL_SOCKET, SO_REUSEADDR, (int *)0 +1, sizeof(int)) < 0)\n \/\/\terror(\"setsockopt(SO_REUSEADDR) failed\");\n bzero((char *) &serv_addr, sizeof(serv_addr));\n \n serv_addr.sin_family = AF_INET;\n serv_addr.sin_addr.s_addr = INADDR_ANY;\n serv_addr.sin_port = htons(portno);\n\t if (bind(sockfd, (struct sockaddr *) &serv_addr,\n sizeof(serv_addr)) < 0)\n \terror(\"ERROR on binding\\n\");\n \n return 0;\n}\n \n \n \n \n \nchar* wait_connection(char *reponse, int longueur){\n tour++;\n usleep(20000);\n \t\n listen(sockfd,5);\n clilen = sizeof(cli_addr);\n newsockfd = accept(sockfd, \n (struct sockaddr *) &cli_addr, \n &clilen);\n if (newsockfd < 0){\n printf(\"ERROR on accept\\n\");\n return NULL;\n }\n \t\n bzero(buffer,256);\n n = read(newsockfd,buffer,255);\n \t\n \/\/printf(\"Here is the message: %s\\n\",buffer);\n \/\/sprintf(reponse, \"I got your message %d\",tour);\n n = write(newsockfd,reponse,longueur);\n \n close(newsockfd);\n \n return buffer;\n}\n \nvoid close_connection(){\n close(sockfd);\n}\n<commit_msg>correction d'un bug<commit_after>\/\/\n\/\/ Created by tag on 03\/01\/17.\n\/\/\n\n#include \"networktools.h\"\n\n\/* A simple server in the internet domain using TCP\n The port number is passed as an argument *\/\n#include <stdio.h>\n#include <stdlib.h>\n#include <string.h>\n#include <unistd.h>\n#include <sys\/types.h> \n#include <sys\/socket.h>\n#include <netinet\/in.h>\n\n\n\n\nvoid error(const char *msg)\n{\n perror(msg);\n exit(1);\n}\n\nint sockfd=-1, newsockfd=-1, portno;\nsocklen_t clilen;\nchar buffer[256];\nstruct sockaddr_in serv_addr, cli_addr;\nint n;\nint tour=0;\n\n\n\nint init_connection( char *port)\n{\n \n \n portno = atoi(port);\n\t\n\t sockfd = socket(AF_INET, SOCK_STREAM, 0);\n if (sockfd < 0) \n error(\"ERROR opening\\n\");\n \n \/\/if (setsockopt(sockfd, SOL_SOCKET, SO_REUSEADDR, (int *)0 +1, sizeof(int)) < 0)\n \/\/\terror(\"setsockopt(SO_REUSEADDR) failed\");\n bzero((char *) &serv_addr, sizeof(serv_addr));\n \n serv_addr.sin_family = AF_INET;\n serv_addr.sin_addr.s_addr = INADDR_ANY;\n serv_addr.sin_port = htons(portno);\n\t if (bind(sockfd, (struct sockaddr *) &serv_addr,\n sizeof(serv_addr)) < 0)\n \terror(\"ERROR on binding\\n\");\n \n return 0;\n}\n \n \n \n \n \nchar* wait_connection(char *reponse, int longueur){\n tour++;\n usleep(20000);\n \t\n listen(sockfd,5);\n clilen = sizeof(cli_addr);\n newsockfd = accept(sockfd, \n (struct sockaddr *) &cli_addr, \n &clilen);\n if (newsockfd < 0){\n printf(\"ERROR on accept\\n\");\n return NULL;\n }\n \t\n bzero(buffer,256);\n n = read(newsockfd,buffer,255);\n \t\n \/\/printf(\"Here is the message: %s\\n\",buffer);\n \/\/sprintf(reponse, \"I got your message %d\",tour);\n n = write(newsockfd,reponse,longueur);\n \n close(newsockfd);\n \n return buffer;\n}\n \nvoid close_connection(){\n close(sockfd);\n}\n<|endoftext|>"} {"text":"<commit_before>#pragma once\n\n#include <agency\/detail\/config.hpp>\n#include <agency\/detail\/factory.hpp>\n#include <agency\/detail\/optional.hpp>\n#include <agency\/detail\/index_cast.hpp>\n#include <agency\/detail\/shape_cast.hpp>\n#include <utility>\n#include <type_traits>\n\nnamespace agency\n{\nnamespace detail\n{\n\n\ntemplate<class Index, class Function, class Shape>\nstruct project_index_and_invoke\n{\n using index_type = Index;\n using shape_type = Shape;\n\n using projected_index_type = decltype(\n detail::project_index(std::declval<index_type>(), std::declval<shape_type>())\n );\n\n using projected_shape_type = decltype(\n project_shape(std::declval<shape_type>())\n );\n\n Function f_;\n shape_type shape_;\n projected_shape_type projected_shape_;\n\n __AGENCY_ANNOTATION\n project_index_and_invoke(const Function& f, shape_type shape, projected_shape_type projected_shape)\n : f_(f),\n shape_(shape),\n projected_shape_(projected_shape)\n {}\n\n \/\/ this type stores the result of f_(index)\n template<class T>\n struct value_and_index\n {\n T value;\n projected_index_type index;\n };\n\n template<class T>\n __AGENCY_ANNOTATION\n value_and_index<typename std::decay<T>::type> make_value_and_index(T&& value, projected_index_type idx)\n {\n return value_and_index<typename std::decay<T>::type>{std::forward<T>(value), idx};\n }\n\n \/\/ this is the type of result returned by f_\n template<class... Args>\n using result_of_function_t = typename std::result_of<Function(projected_index_type,Args...)>::type;\n\n template<class T>\n using void_or_optionally_value_and_index_t = typename std::conditional<\n std::is_void<T>::value,\n void,\n optional<value_and_index<T>>\n >::type;\n\n \/\/ this is the type of result returned by this functor\n template<class... Args>\n using result_t = void_or_optionally_value_and_index_t<result_of_function_t<Args...>>;\n\n \/\/ when f_(idx) has no result, we just return void\n template<class... Args,\n class = typename std::enable_if<\n std::is_void<\n result_of_function_t<Args&&...>\n >::value\n >::type\n >\n __AGENCY_ANNOTATION\n void impl(const Index& idx, Args&&... args)\n {\n auto projected_idx = detail::project_index(idx, shape_);\n\n if(projected_idx < projected_shape_)\n {\n f_(projected_idx, std::forward<Args>(args)...);\n }\n }\n\n \/\/ when f_(idx) has a result, we optionally return f_'s result and the index,\n \/\/ but only at points where f_(idx) is defined\n template<class... Args,\n class = typename std::enable_if<\n !std::is_void<\n result_of_function_t<Args&&...>\n >::value\n >::type\n >\n __AGENCY_ANNOTATION\n result_t<Args&&...>\n impl(const Index& idx, Args&&... args)\n {\n auto projected_idx = detail::project_index(idx, shape_);\n\n if(projected_idx < projected_shape_)\n {\n return make_value_and_index(f_(projected_idx, std::forward<Args>(args)...), projected_idx);\n }\n\n return nullopt;\n }\n\n \/\/ this overload implements the functor for then_execute() when the dependency future is void\n template<class T>\n __AGENCY_ANNOTATION\n result_t<T&>\n operator()(const Index& idx, T& outer_shared_parameter, unit)\n {\n return impl(idx, outer_shared_parameter);\n }\n\n \/\/ this overload implements the functor for then_execute() when the dependency future is not void\n template<class T1, class T2>\n __AGENCY_ANNOTATION\n result_t<T1&,T2&>\n operator()(const Index& idx, T1& past_parameter, T2& outer_shared_parameter, unit)\n {\n return impl(idx, past_parameter, outer_shared_parameter);\n }\n};\n\n\ntemplate<class Index, class Function, class Shape>\n__AGENCY_ANNOTATION\nproject_index_and_invoke<Index,Function,Shape>\n make_project_index_and_invoke(Function f,\n Shape higher_dimensional_shape,\n typename project_index_and_invoke<Index,Function,Shape>::projected_shape_type lower_dimensional_shape)\n{\n return project_index_and_invoke<Index,Function,Shape>{f,higher_dimensional_shape,lower_dimensional_shape};\n}\n\n\n} \/\/ end detail\n} \/\/ end agency\n\n<commit_msg>Make project_index_and_invoke's member functions const<commit_after>#pragma once\n\n#include <agency\/detail\/config.hpp>\n#include <agency\/detail\/factory.hpp>\n#include <agency\/detail\/optional.hpp>\n#include <agency\/detail\/index_cast.hpp>\n#include <agency\/detail\/shape_cast.hpp>\n#include <utility>\n#include <type_traits>\n\nnamespace agency\n{\nnamespace detail\n{\n\n\ntemplate<class Index, class Function, class Shape>\nstruct project_index_and_invoke\n{\n using index_type = Index;\n using shape_type = Shape;\n\n using projected_index_type = decltype(\n detail::project_index(std::declval<index_type>(), std::declval<shape_type>())\n );\n\n using projected_shape_type = decltype(\n project_shape(std::declval<shape_type>())\n );\n\n mutable Function f_;\n shape_type shape_;\n projected_shape_type projected_shape_;\n\n __AGENCY_ANNOTATION\n project_index_and_invoke(const Function& f, shape_type shape, projected_shape_type projected_shape)\n : f_(f),\n shape_(shape),\n projected_shape_(projected_shape)\n {}\n\n \/\/ this type stores the result of f_(index)\n template<class T>\n struct value_and_index\n {\n T value;\n projected_index_type index;\n };\n\n template<class T>\n __AGENCY_ANNOTATION\n value_and_index<typename std::decay<T>::type> make_value_and_index(T&& value, projected_index_type idx) const\n {\n return value_and_index<typename std::decay<T>::type>{std::forward<T>(value), idx};\n }\n\n \/\/ this is the type of result returned by f_\n template<class... Args>\n using result_of_function_t = typename std::result_of<Function(projected_index_type,Args...)>::type;\n\n template<class T>\n using void_or_optionally_value_and_index_t = typename std::conditional<\n std::is_void<T>::value,\n void,\n optional<value_and_index<T>>\n >::type;\n\n \/\/ this is the type of result returned by this functor\n template<class... Args>\n using result_t = void_or_optionally_value_and_index_t<result_of_function_t<Args...>>;\n\n \/\/ when f_(idx) has no result, we just return void\n template<class... Args,\n class = typename std::enable_if<\n std::is_void<\n result_of_function_t<Args&&...>\n >::value\n >::type\n >\n __AGENCY_ANNOTATION\n void impl(const Index& idx, Args&&... args) const\n {\n auto projected_idx = detail::project_index(idx, shape_);\n\n if(projected_idx < projected_shape_)\n {\n f_(projected_idx, std::forward<Args>(args)...);\n }\n }\n\n \/\/ when f_(idx) has a result, we optionally return f_'s result and the index,\n \/\/ but only at points where f_(idx) is defined\n template<class... Args,\n class = typename std::enable_if<\n !std::is_void<\n result_of_function_t<Args&&...>\n >::value\n >::type\n >\n __AGENCY_ANNOTATION\n result_t<Args&&...>\n impl(const Index& idx, Args&&... args) const\n {\n auto projected_idx = detail::project_index(idx, shape_);\n\n if(projected_idx < projected_shape_)\n {\n return make_value_and_index(f_(projected_idx, std::forward<Args>(args)...), projected_idx);\n }\n\n return nullopt;\n }\n\n \/\/ this overload implements the functor for then_execute() when the dependency future is void\n template<class T>\n __AGENCY_ANNOTATION\n result_t<T&>\n operator()(const Index& idx, T& outer_shared_parameter, unit) const\n {\n return impl(idx, outer_shared_parameter);\n }\n\n \/\/ this overload implements the functor for then_execute() when the dependency future is not void\n template<class T1, class T2>\n __AGENCY_ANNOTATION\n result_t<T1&,T2&>\n operator()(const Index& idx, T1& past_parameter, T2& outer_shared_parameter, unit) const\n {\n return impl(idx, past_parameter, outer_shared_parameter);\n }\n};\n\n\ntemplate<class Index, class Function, class Shape>\n__AGENCY_ANNOTATION\nproject_index_and_invoke<Index,Function,Shape>\n make_project_index_and_invoke(Function f,\n Shape higher_dimensional_shape,\n typename project_index_and_invoke<Index,Function,Shape>::projected_shape_type lower_dimensional_shape)\n{\n return project_index_and_invoke<Index,Function,Shape>{f,higher_dimensional_shape,lower_dimensional_shape};\n}\n\n\n} \/\/ end detail\n} \/\/ end agency\n\n<|endoftext|>"} {"text":"<commit_before>\/* ==================================================================================================\n# Copyright 2014 vpon, Inc.\n# --------------------------------------------------------------------------------------------------\n# Licensed under the Apache License, Version 2.0 (the \"License\");\n# you may not use this work except in compliance with the License.\n# You may obtain a copy of the License in the LICENSE file, or at:\n#\n# http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n#\n# Unless required by applicable law or agreed to in writing, software\n# distributed under the License is distributed on an \"AS IS\" BASIS,\n# WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n# See the License for the specific language governing permissions and\n# limitations under the License.\n# ================================================================================================== *\/\n\n#include <unistd.h>\n#include <stdio.h>\n#include <string>\n#include <vector>\n#include <fstream>\n#include \"producer\/capture.h\"\n#include \"agent\/els.h\"\n#include \"public\/daemonize.h\"\n#include \"err\/err.h\"\n#include \"log\/log.h\"\n\nusing std::string;\nusing std::vector;\nusing std::ofstream;\nusing log2esd::producer::Capture;\nusing log2esd::agent::ELS;\nusing log2esd::pub::Daemon;\nusing log2esd::log::FileHandle;\nusing log2esd::ERR_ELS_PUSH_DOC_NO_RESPONSE;\n\nstruct AppConfig {\n string host_;\n string log_home_;\n string level_;\n string daemon_log_;\n string pid_file_;\n string written_file_;\n string rm_;\n string index_prefix_;\n int lines_;\n int line_size_;\n int interval_;\n int divisor_;\n AppConfig() : host_(\"localhost:9200\"), log_home_(\".\/log\"), level_(\"INFO\"), daemon_log_(\"\/data\/logs\/log2esd\/\"), pid_file_(\"\"), written_file_(\".written_file.txt\"), rm_(\"yes\"), index_prefix_(\"\"), lines_(2), line_size_(2048), interval_(10), divisor_(2) {}\n};\n\nvoid Help(char ** argv) {\n printf(\"##########################################\\n\\n\");\n printf(\"Usage: %s -p <file.ini>\"\n \"\\n\"\n \"Options:\\n\"\n \"-h <192.168.0.1:9200> els service (default: localhost:9200)\\n\"\n \"-s <app_logs> directory of app's logs (default: .\/log)\\n\"\n \"-x <index_prefix> index prefix (default: empty)\\n\"\n \"-v <index_divisor> index divisor, must be (2,3,4,6,8,12,24) (default: 2)\\n\"\n \"-n <lines> lines of read once (default: 2)\\n\"\n \"-b <line_size> size of line (default: 2048)\\n\"\n \"-i <interval> waiting interval (default: 10)\\n\"\n \"-w <daemon log> directory of daemon logs (default: \/data\/logs\/log2esd)\\n\"\n \"-l <level> level of daemon logs (default: INFO)\\n\"\n \"-r <yes\/no> remove log file after send all datas (default yes)\\n\"\n \"-d <pid_file> daemonize log2esd\\n\"\n \"-H Show this help\\n\"\n \"\\n\",\n argv[0]\n );\n printf(\"##########################################\\n\\n\");\n}\n\nvoid GetParam(AppConfig * conf, int argc, char ** argv) {\n char opt;\n while (-1 != (opt = ::getopt(argc, argv, \"h:s:x:v:d:n:b:i:w:l:r:H\"))) {\n switch (opt) {\n case 'h':\n if (NULL != optarg) {\n conf->host_ = optarg;\n }\n break;\n\n case 's':\n if (NULL != optarg) {\n conf->log_home_ = optarg;\n }\n break;\n\n case 'x':\n if (NULL != optarg) {\n conf->index_prefix_ = optarg;\n }\n break;\n\n case 'v':\n if (NULL != optarg) {\n conf->divisor_ = ::atoi(optarg);\n }\n break;\n\n case 'd':\n if (NULL != optarg) {\n conf->pid_file_ = optarg;\n }\n break;\n\n case 'n':\n if (NULL != optarg) {\n conf->lines_ = ::atoi(optarg);\n }\n break;\n\n case 'b':\n if (NULL != optarg) {\n conf->line_size_ = ::atoi(optarg);\n }\n break;\n\n case 'i':\n if (NULL != optarg) {\n conf->interval_ = ::atoi(optarg);\n }\n break;\n\n case 'w':\n if (NULL != optarg) {\n conf->daemon_log_ = optarg;\n }\n break;\n\n case 'l':\n if (NULL != optarg) {\n conf->level_ = optarg;\n }\n break;\n\n case 'r':\n if (NULL != optarg) {\n conf->rm_ = optarg;\n }\n break;\n\n case 'H':\n default:\n Help(argv);\n ::_exit(0);\n break;\n }\n }\n\n printf(\"###########################################\\n\");\n printf(\"host:%s\\n\", conf->host_.c_str());\n printf(\"log home:%s\\n\", conf->log_home_.c_str());\n printf(\"index prefix:%s\\n\", conf->index_prefix_.c_str());\n printf(\"index divisor:%d\\n\", conf->divisor_);\n printf(\"read lines:%d\\n\", conf->lines_);\n printf(\"line size:%d\\n\", conf->line_size_);\n printf(\"waiting interval:%d\\n\", conf->interval_);\n printf(\"deamon log:%s\\n\", conf->daemon_log_.c_str());\n printf(\"log level:%s\\n\", conf->level_.c_str());\n printf(\"pid file:%s\\n\", conf->pid_file_.c_str());\n printf(\"remove log file: %s\\n\", conf->rm_.c_str());\n printf(\"###########################################\\n\");\n\n return;\n}\n\nint ReadLines(Capture & capture, int lines, char * block, int max_size) {\n int used = 0;\n while (lines) {\n int unused = max_size - used;\n int cmd_size = capture.EncodeCmd(block + used, unused);\n if (0 >= cmd_size) {\n break;\n }\n used += cmd_size;\n unused = max_size - used;\n int size = capture.GetLine(block + used, unused);\n if (0 < size) {\n used += size;\n unused = max_size - used;\n\n lines--;\n } else {\n used -= cmd_size;\n\n break;\n }\n }\n\n return used;\n}\n\nint PushToELS(ELS & els, const string & data) {\n return els.PushDocs(data);\n}\n\nint RetryPush(ELS & els, const string & data, int times, int interval) {\n while (times) {\n if (0 == PushToELS(els, data)) {\n return 0;\n }\n\n --times;\n\n LOG_WARN(\"retry push to els times \" << times);\n\n ::sleep(interval);\n }\n\n return -1;\n}\n\nvoid LogToErrDoc(const string & log_home, const string & json) {\n uint now = ::time(NULL);\n ::srand(now);\n int random = ::rand()%1000;\n char file[1024] = {0};\n ::snprintf(file, sizeof(file) - 1, \".written_error_%u_%d.json\", now, random);\n const string path = log_home + \"\/\" + file;\n int result = ::access(path.c_str(), F_OK);\n if (0 == result) {\n LOG_WARN(\"agent log to err doc file name is exists\");\n }\n\n ofstream os(path.c_str());\n if (os.is_open()) {\n os << json;\n os.flush();\n os.close();\n }\n}\n\nint main(int argc, char ** argv) {\n if (1 >= argc) {\n Help(argv);\n ::_exit(0);\n }\n\n AppConfig conf;\n GetParam(&conf, argc, argv);\n if (0 == conf.divisor_ || 0 != 24 % conf.divisor_) {\n Help(argv);\n printf(\"\\nindex divisor is invalid\\n\");\n ::_exit(0);\n }\n\n int block_size = conf.lines_*conf.line_size_;\n\n FileHandle * logger = FileHandle::Instance(conf.daemon_log_, FileHandle::GetLevel(conf.level_));\n if (NULL == logger) {\n printf(\"log2esd initial log failed\");\n return -1;\n }\n LOG_DEBUG(\"log2esd initial log successed\");\n\n if (conf.pid_file_.length()) {\n if (0 != Daemon::Daemonize(1, 1, false, conf.pid_file_.c_str())) {\n printf(\"log2esd daemonize failed\");\n ::_exit(-1);\n }\n }\n LOG_DEBUG(\"log2esd daemonize successed\");\n\n vector<char> mem(block_size);\n char * block = &mem.front();\n\n bool rm = true;\n if (0 == ::strncasecmp(\"no\", conf.rm_.c_str(), 2)) {\n rm = false;\n }\n Capture capture(conf.log_home_, conf.index_prefix_, conf.divisor_, conf.written_file_, rm);\n LOG_DEBUG(\"log2esd initial capture successed\");\n\n capture.FindLogs();\n LOG_DEBUG(\"log2esd search log files successed\");\n\n ELS els(conf.host_);\n LOG_DEBUG(\"log2esd initial els successed\");\n\n while (true) {\n int size = 0;\n if (0 >= (size = ReadLines(capture, conf.lines_, block, block_size))) {\n ::sleep(conf.interval_);\n continue;\n }\n\n block[size] = 0x00;\n\n if (5 > conf.lines_) {\n LOG_DEBUG(\"send to els:\" << block);\n }\n int result = PushToELS(els, block);\n if (0 == result) {\n capture.Flush();\n } else if (ERR_ELS_PUSH_DOC_NO_RESPONSE == result) {\n if (0 != RetryPush(els, block, 3*600 , 2)) {\n LogToErrDoc(conf.log_home_, block);\n }\n } else {\n LOG_WARN(\"log to els failed data size:\" << size);\n\n LogToErrDoc(conf.log_home_, block);\n\n ::sleep(60);\n }\n }\n\n vector<char>().swap(mem);\n\n delete logger;\n\n return 0;\n}\n<commit_msg>add help info<commit_after>\/* ==================================================================================================\n# Copyright 2014 vpon, Inc.\n# --------------------------------------------------------------------------------------------------\n# Licensed under the Apache License, Version 2.0 (the \"License\");\n# you may not use this work except in compliance with the License.\n# You may obtain a copy of the License in the LICENSE file, or at:\n#\n# http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n#\n# Unless required by applicable law or agreed to in writing, software\n# distributed under the License is distributed on an \"AS IS\" BASIS,\n# WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n# See the License for the specific language governing permissions and\n# limitations under the License.\n# ================================================================================================== *\/\n\n#include <unistd.h>\n#include <stdio.h>\n#include <string>\n#include <vector>\n#include <fstream>\n#include \"producer\/capture.h\"\n#include \"agent\/els.h\"\n#include \"public\/daemonize.h\"\n#include \"err\/err.h\"\n#include \"log\/log.h\"\n\nusing std::string;\nusing std::vector;\nusing std::ofstream;\nusing log2esd::producer::Capture;\nusing log2esd::agent::ELS;\nusing log2esd::pub::Daemon;\nusing log2esd::log::FileHandle;\nusing log2esd::ERR_ELS_PUSH_DOC_NO_RESPONSE;\n\nstruct AppConfig {\n string host_;\n string log_home_;\n string level_;\n string daemon_log_;\n string pid_file_;\n string written_file_;\n string rm_;\n string index_prefix_;\n int lines_;\n int line_size_;\n int interval_;\n int divisor_;\n AppConfig() : host_(\"localhost:9200\"), log_home_(\".\/log\"), level_(\"INFO\"), daemon_log_(\"\/data\/logs\/log2esd\/\"), pid_file_(\"\"), written_file_(\".written_file.txt\"), rm_(\"yes\"), index_prefix_(\"\"), lines_(2), line_size_(2048), interval_(10), divisor_(2) {}\n};\n\nvoid Help(char ** argv) {\n printf(\"##########################################\\n\\n\");\n printf(\"Usage: %s -p <file.ini>\"\n \"\\n\"\n \"Options:\\n\"\n \"-h <192.168.0.1:9200> els service (default: localhost:9200)\\n\"\n \"-s <app_logs> directory of app's logs (default: .\/log)\\n\"\n \"-x <index_prefix> index prefix (default: empty)\\n\"\n \"-v <index_divisor> index divisor, must be (2,3,4,6,8,12,24) (default: 2)\\n\"\n \"-n <lines> lines of read once (default: 2)\\n\"\n \"-b <line_size> size of line (default: 2048)\\n\"\n \"-i <interval> waiting interval (default: 10)\\n\"\n \"-w <daemon log> directory of daemon logs (default: \/data\/logs\/log2esd)\\n\"\n \"-l <level> level of daemon logs (default: INFO)\\n\"\n \"-r <yes\/no> remove log file after send all datas (default yes)\\n\"\n \"-d <pid_file> daemonize log2esd\\n\"\n \"-H Show this help\\n\"\n \"\\n\",\n argv[0]\n );\n printf(\"##########################################\\n\\n\");\n}\n\nvoid GetParam(AppConfig * conf, int argc, char ** argv) {\n char opt;\n while (-1 != (opt = ::getopt(argc, argv, \"h:s:x:v:d:n:b:i:w:l:r:H\"))) {\n switch (opt) {\n case 'h':\n if (NULL != optarg) {\n conf->host_ = optarg;\n }\n break;\n\n case 's':\n if (NULL != optarg) {\n conf->log_home_ = optarg;\n }\n break;\n\n case 'x':\n if (NULL != optarg) {\n conf->index_prefix_ = optarg;\n }\n break;\n\n case 'v':\n if (NULL != optarg) {\n conf->divisor_ = ::atoi(optarg);\n }\n break;\n\n case 'd':\n if (NULL != optarg) {\n conf->pid_file_ = optarg;\n }\n break;\n\n case 'n':\n if (NULL != optarg) {\n conf->lines_ = ::atoi(optarg);\n }\n break;\n\n case 'b':\n if (NULL != optarg) {\n conf->line_size_ = ::atoi(optarg);\n }\n break;\n\n case 'i':\n if (NULL != optarg) {\n conf->interval_ = ::atoi(optarg);\n }\n break;\n\n case 'w':\n if (NULL != optarg) {\n conf->daemon_log_ = optarg;\n }\n break;\n\n case 'l':\n if (NULL != optarg) {\n conf->level_ = optarg;\n }\n break;\n\n case 'r':\n if (NULL != optarg) {\n conf->rm_ = optarg;\n }\n break;\n\n case 'H':\n default:\n Help(argv);\n ::_exit(0);\n break;\n }\n }\n\n printf(\"###########################################\\n\");\n printf(\"host:%s\\n\", conf->host_.c_str());\n printf(\"log home:%s\\n\", conf->log_home_.c_str());\n printf(\"index prefix:%s\\n\", conf->index_prefix_.c_str());\n printf(\"index divisor:%d\\n\", conf->divisor_);\n printf(\"read lines:%d\\n\", conf->lines_);\n printf(\"line size:%d\\n\", conf->line_size_);\n printf(\"waiting interval:%d\\n\", conf->interval_);\n printf(\"deamon log:%s\\n\", conf->daemon_log_.c_str());\n printf(\"log level:%s\\n\", conf->level_.c_str());\n printf(\"pid file:%s\\n\", conf->pid_file_.c_str());\n printf(\"remove log file: %s\\n\", conf->rm_.c_str());\n printf(\"###########################################\\n\");\n\n return;\n}\n\nint ReadLines(Capture & capture, int lines, char * block, int max_size) {\n int used = 0;\n while (lines) {\n int unused = max_size - used;\n int cmd_size = capture.EncodeCmd(block + used, unused);\n if (0 >= cmd_size) {\n break;\n }\n used += cmd_size;\n unused = max_size - used;\n int size = capture.GetLine(block + used, unused);\n if (0 < size) {\n used += size;\n unused = max_size - used;\n\n lines--;\n } else {\n used -= cmd_size;\n\n break;\n }\n }\n\n return used;\n}\n\nint PushToELS(ELS & els, const string & data) {\n return els.PushDocs(data);\n}\n\nint RetryPush(ELS & els, const string & data, int times, int interval) {\n while (times) {\n if (0 == PushToELS(els, data)) {\n return 0;\n }\n\n --times;\n\n LOG_WARN(\"retry push to els times \" << times);\n\n ::sleep(interval);\n }\n\n return -1;\n}\n\nvoid LogToErrDoc(const string & log_home, const string & json) {\n uint now = ::time(NULL);\n ::srand(now);\n int random = ::rand()%1000;\n char file[1024] = {0};\n ::snprintf(file, sizeof(file) - 1, \".written_error_%u_%d.json\", now, random);\n const string path = log_home + \"\/\" + file;\n int result = ::access(path.c_str(), F_OK);\n if (0 == result) {\n LOG_WARN(\"agent log to err doc file name is exists\");\n }\n\n ofstream os(path.c_str());\n if (os.is_open()) {\n os << json;\n os.flush();\n os.close();\n }\n}\n\nint main(int argc, char ** argv) {\n if (1 >= argc) {\n Help(argv);\n ::_exit(0);\n }\n\n AppConfig conf;\n GetParam(&conf, argc, argv);\n if (0 >= conf.divisor_ || 24 < conf.divisor_ || 0 != 24 % conf.divisor_) {\n Help(argv);\n printf(\"\\nindex divisor is invalid\\n\");\n ::_exit(0);\n }\n\n int block_size = conf.lines_*conf.line_size_;\n\n FileHandle * logger = FileHandle::Instance(conf.daemon_log_, FileHandle::GetLevel(conf.level_));\n if (NULL == logger) {\n printf(\"log2esd initial log failed\");\n return -1;\n }\n LOG_DEBUG(\"log2esd initial log successed\");\n\n if (conf.pid_file_.length()) {\n if (0 != Daemon::Daemonize(1, 1, false, conf.pid_file_.c_str())) {\n printf(\"log2esd daemonize failed\");\n ::_exit(-1);\n }\n }\n LOG_DEBUG(\"log2esd daemonize successed\");\n\n vector<char> mem(block_size);\n char * block = &mem.front();\n\n bool rm = true;\n if (0 == ::strncasecmp(\"no\", conf.rm_.c_str(), 2)) {\n rm = false;\n }\n Capture capture(conf.log_home_, conf.index_prefix_, conf.divisor_, conf.written_file_, rm);\n LOG_DEBUG(\"log2esd initial capture successed\");\n\n capture.FindLogs();\n LOG_DEBUG(\"log2esd search log files successed\");\n\n ELS els(conf.host_);\n LOG_DEBUG(\"log2esd initial els successed\");\n\n while (true) {\n int size = 0;\n if (0 >= (size = ReadLines(capture, conf.lines_, block, block_size))) {\n ::sleep(conf.interval_);\n continue;\n }\n\n block[size] = 0x00;\n\n if (5 > conf.lines_) {\n LOG_DEBUG(\"send to els:\" << block);\n }\n int result = PushToELS(els, block);\n if (0 == result) {\n capture.Flush();\n } else if (ERR_ELS_PUSH_DOC_NO_RESPONSE == result) {\n if (0 != RetryPush(els, block, 3*600 , 2)) {\n LogToErrDoc(conf.log_home_, block);\n }\n } else {\n LOG_WARN(\"log to els failed data size:\" << size);\n\n LogToErrDoc(conf.log_home_, block);\n\n ::sleep(60);\n }\n }\n\n vector<char>().swap(mem);\n\n delete logger;\n\n return 0;\n}\n<|endoftext|>"} {"text":"<commit_before>\/*******************************************************************************\r\n Copyright (c) 2016, Manuel Freiberger\r\n All rights reserved.\r\n\r\n Redistribution and use in source and binary forms, with or without\r\n modification, are permitted provided that the following conditions are met:\r\n\r\n * Redistributions of source code must retain the above copyright notice, this\r\n list of conditions and the following disclaimer.\r\n\r\n * Redistributions in binary form must reproduce the above copyright notice,\r\n this list of conditions and the following disclaimer in the documentation\r\n and\/or other materials provided with the distribution.\r\n\r\n THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS \"AS IS\"\r\n AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE\r\n IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE\r\n DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE\r\n FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL\r\n DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR\r\n SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER\r\n CAUSED 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 THE USE\r\n OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.\r\n*******************************************************************************\/\r\n\r\n#include \"logger.hpp\"\r\n#include \"sink.hpp\"\r\n\r\n#include <cstdint>\r\n#include <cstring>\r\n\r\n#ifdef LOG11_USE_WEOS\r\n#include <weos\/thread.hpp>\r\n#else\r\n#include <thread>\r\n#endif \/\/ LOG11_USE_WEOS\r\n\r\n\r\nusing namespace std;\r\n\r\nnamespace log11\r\n{\r\nusing namespace log11_detail;\r\n\r\n\/\/ ----=====================================================================----\r\n\/\/ Converter\r\n\/\/ ----=====================================================================----\r\n\r\nclass Converter : public Visitor\r\n{\r\npublic:\r\n Converter(Logger& logger)\r\n : m_logger(logger)\r\n {\r\n }\r\n\r\n virtual void visit(bool value)\r\n {\r\n if (value)\r\n m_logger.m_sink.load()->putString(\"true\", 4);\r\n else\r\n m_logger.m_sink.load()->putString(\"false\", 5);\r\n }\r\n\r\n virtual void visit(char value)\r\n {\r\n m_logger.m_sink.load()->putChar(value);\r\n }\r\n\r\n virtual void visit(signed char value)\r\n {\r\n auto length = snprintf(m_logger.m_conversionBuffer, sizeof(m_logger.m_conversionBuffer),\r\n \"%d\", value);\r\n m_logger.m_sink.load()->putString(m_logger.m_conversionBuffer, length);\r\n }\r\n\r\n virtual void visit(unsigned char value)\r\n {\r\n auto length = snprintf(m_logger.m_conversionBuffer, sizeof(m_logger.m_conversionBuffer),\r\n \"%u\", value);\r\n m_logger.m_sink.load()->putString(m_logger.m_conversionBuffer, length);\r\n }\r\n\r\n virtual void visit(short value)\r\n {\r\n auto length = snprintf(m_logger.m_conversionBuffer, sizeof(m_logger.m_conversionBuffer),\r\n \"%d\", value);\r\n m_logger.m_sink.load()->putString(m_logger.m_conversionBuffer, length);\r\n }\r\n\r\n virtual void visit(unsigned short value)\r\n {\r\n auto length = snprintf(m_logger.m_conversionBuffer, sizeof(m_logger.m_conversionBuffer),\r\n \"%u\", value);\r\n m_logger.m_sink.load()->putString(m_logger.m_conversionBuffer, length);\r\n }\r\n\r\n virtual void visit(int value)\r\n {\r\n auto length = snprintf(m_logger.m_conversionBuffer, sizeof(m_logger.m_conversionBuffer),\r\n \"%d\", value);\r\n m_logger.m_sink.load()->putString(m_logger.m_conversionBuffer, length);\r\n }\r\n\r\n virtual void visit(unsigned value)\r\n {\r\n auto length = snprintf(m_logger.m_conversionBuffer, sizeof(m_logger.m_conversionBuffer),\r\n \"%u\", value);\r\n m_logger.m_sink.load()->putString(m_logger.m_conversionBuffer, length);\r\n }\r\n\r\n virtual void visit(long value)\r\n {\r\n auto length = snprintf(m_logger.m_conversionBuffer, sizeof(m_logger.m_conversionBuffer),\r\n \"%ld\", value);\r\n m_logger.m_sink.load()->putString(m_logger.m_conversionBuffer, length);\r\n }\r\n\r\n virtual void visit(unsigned long value)\r\n {\r\n auto length = snprintf(m_logger.m_conversionBuffer, sizeof(m_logger.m_conversionBuffer),\r\n \"%lu\", value);\r\n m_logger.m_sink.load()->putString(m_logger.m_conversionBuffer, length);\r\n }\r\n\r\n virtual void visit(long long value)\r\n {\r\n auto length = snprintf(m_logger.m_conversionBuffer, sizeof(m_logger.m_conversionBuffer),\r\n \"%lld\", value);\r\n m_logger.m_sink.load()->putString(m_logger.m_conversionBuffer, length);\r\n }\r\n\r\n virtual void visit(unsigned long long value)\r\n {\r\n auto length = snprintf(m_logger.m_conversionBuffer, sizeof(m_logger.m_conversionBuffer),\r\n \"%llu\", value);\r\n m_logger.m_sink.load()->putString(m_logger.m_conversionBuffer, length);\r\n }\r\n\r\n virtual void visit(float value)\r\n {\r\n auto length = snprintf(m_logger.m_conversionBuffer, sizeof(m_logger.m_conversionBuffer),\r\n \"%f\", value);\r\n m_logger.m_sink.load()->putString(m_logger.m_conversionBuffer, length);\r\n }\r\n\r\n virtual void visit(double value)\r\n {\r\n auto length = snprintf(m_logger.m_conversionBuffer, sizeof(m_logger.m_conversionBuffer),\r\n \"%f\", value);\r\n m_logger.m_sink.load()->putString(m_logger.m_conversionBuffer, length);\r\n }\r\n\r\n virtual void visit(long double value)\r\n {\r\n auto length = snprintf(m_logger.m_conversionBuffer, sizeof(m_logger.m_conversionBuffer),\r\n \"%Lf\", value);\r\n m_logger.m_sink.load()->putString(m_logger.m_conversionBuffer, length);\r\n }\r\n\r\n virtual void visit(const void* value) override\r\n {\r\n auto length = snprintf(m_logger.m_conversionBuffer, sizeof(m_logger.m_conversionBuffer),\r\n \"0x%08lx\", uintptr_t(value));\r\n m_logger.m_sink.load()->putString(m_logger.m_conversionBuffer, length);\r\n }\r\n\r\n virtual void visit(const char* value) override\r\n {\r\n m_logger.m_sink.load()->putString(value, std::strlen(value));\r\n }\r\n\r\n virtual void visit(const StringRef& s1, const StringRef& s2)\r\n {\r\n Sink* sink = m_logger.m_sink;\r\n if (s1.size())\r\n sink->putString(s1.data(), s1.size());\r\n if (s2.size())\r\n sink->putString(s2.data(), s2.size());\r\n }\r\n\r\n virtual void outOfBounds()\r\n {\r\n m_logger.m_sink.load()->putString(\"?!\", 2);\r\n }\r\n\r\nprivate:\r\n Logger& m_logger;\r\n};\r\n\r\n\/\/ ----=====================================================================----\r\n\/\/ LogStatement\r\n\/\/ ----=====================================================================----\r\n\r\nLogStatement::LogStatement(Severity severity, const char* msg)\r\n : m_timeStamp(LOG11_STD::chrono::high_resolution_clock::now().time_since_epoch().count()),\r\n m_message(msg),\r\n m_extensionSize(0),\r\n m_extensionType(0),\r\n m_severity(static_cast<int>(severity))\r\n{\r\n}\r\n\r\n\/\/ ----=====================================================================----\r\n\/\/ Logger\r\n\/\/ ----=====================================================================----\r\n\r\n#ifdef LOG11_USE_WEOS\r\nLogger::Logger(const weos::thread_attributes& attrs, std::size_t bufferSize)\r\n#else\r\nLogger::Logger(std::size_t bufferSize)\r\n#endif \/\/ LOG11_USE_WEOS\r\n : m_messageFifo(sizeof(LogStatement), bufferSize),\r\n m_flags(AppendNewLine),\r\n m_sink{nullptr},\r\n m_severityThreshold{Severity::Info}\r\n{\r\n#ifdef LOG11_USE_WEOS\r\n weos::thread(attrs, &Logger::consumeFifoEntries, this).detach();\r\n#else\r\n std::thread(&Logger::consumeFifoEntries, this).detach();\r\n#endif \/\/ LOG11_USE_WEOS\r\n}\r\n\r\nLogger::~Logger()\r\n{\r\n m_flags |= StopRequest;\r\n \/\/ Signal the consumer thread.\r\n auto claimed = m_messageFifo.claim(1);\r\n new (m_messageFifo[claimed.begin]) LogStatement(Severity::Debug, nullptr);\r\n m_messageFifo.publish(claimed);\r\n}\r\n\r\nvoid Logger::setSeverityThreshold(Severity severity) noexcept\r\n{\r\n m_severityThreshold = severity;\r\n}\r\n\r\nvoid Logger::setAutomaticNewLine(bool enable) noexcept\r\n{\r\n if (enable)\r\n {\r\n int flag = m_flags;\r\n while (!m_flags.compare_exchange_weak(flag, flag | AppendNewLine));\r\n }\r\n else\r\n {\r\n int flag = m_flags;\r\n while (!m_flags.compare_exchange_weak(flag, flag & ~AppendNewLine));\r\n }\r\n}\r\n\r\nvoid Logger::setSink(Sink* sink) noexcept\r\n{\r\n m_sink = sink;\r\n}\r\n\r\nvoid Logger::doLog(ClaimPolicy policy, Severity severity, const char* message)\r\n{\r\n if (severity < m_severityThreshold)\r\n return;\r\n\r\n auto claimed = policy == Block ? m_messageFifo.claim(1)\r\n : m_messageFifo.tryClaim(1, policy == Truncate);\r\n if (claimed.length == 0)\r\n return;\r\n\r\n new (m_messageFifo[claimed.begin]) LogStatement(severity, message);\r\n\r\n if (policy == Block)\r\n m_messageFifo.publish(claimed);\r\n else\r\n m_messageFifo.tryPublish(claimed);\r\n}\r\n\r\nvoid Logger::consumeFifoEntries()\r\n{\r\n Converter converter(*this);\r\n\r\n while ((m_flags & StopRequest) == 0)\r\n {\r\n auto available = m_messageFifo.available();\r\n while ((m_flags & StopRequest) == 0 && available.length)\r\n {\r\n \/\/ If no sink is attached to the logger, consume all FIFO entries.\r\n Sink* sink = m_sink;\r\n if (!sink)\r\n {\r\n m_messageFifo.consume(available.length);\r\n break;\r\n }\r\n\r\n auto stmt = static_cast<LogStatement*>(m_messageFifo[available.begin]);\r\n if (!stmt->m_message)\r\n return;\r\n\r\n sink->beginLogEntry(static_cast<Severity>(stmt->m_severity));\r\n printHeader(stmt);\r\n\r\n if (stmt->m_extensionType == 0)\r\n {\r\n sink->putString(stmt->m_message, std::strlen(stmt->m_message));\r\n\r\n ++available.begin;\r\n --available.length;\r\n m_messageFifo.consume(1);\r\n }\r\n else\r\n {\r\n SerdesBase* serdes\r\n = stmt->m_extensionSize\r\n ? *static_cast<SerdesBase**>(m_messageFifo[available.begin + 1])\r\n : nullptr;\r\n auto byteRange = m_messageFifo.byteRange(\r\n RingBuffer::Range(available.begin + 1,\r\n stmt->m_extensionSize));\r\n\r\n \/\/ Interpret the format string.\r\n unsigned argCounter = 0;\r\n const char* beginPos = stmt->m_message;\r\n const char* iter = beginPos;\r\n for (; *iter; ++iter)\r\n {\r\n if (*iter == '{')\r\n {\r\n if (iter != beginPos)\r\n sink->putString(beginPos, iter - beginPos);\r\n\r\n \/\/ Loop to the end of the format specifier (or the end of the string).\r\n beginPos = ++iter;\r\n while (*iter && *iter != '}')\r\n ++iter;\r\n if (!*iter)\r\n {\r\n beginPos = iter;\r\n break;\r\n }\r\n ++argCounter;\r\n if (serdes)\r\n serdes->apply(m_messageFifo, byteRange, argCounter, converter);\r\n else\r\n converter.outOfBounds();\r\n\r\n beginPos = iter + 1;\r\n }\r\n }\r\n if (iter != beginPos)\r\n sink->putString(beginPos, iter - beginPos);\r\n\r\n available.begin += 1 + stmt->m_extensionSize;\r\n available.length -= 1 + stmt->m_extensionSize;\r\n m_messageFifo.consume(1 + stmt->m_extensionSize);\r\n }\r\n\r\n if (m_flags & AppendNewLine)\r\n sink->putChar('\\n');\r\n sink->endLogEntry();\r\n }\r\n }\r\n}\r\n\r\n\r\nint numDecimalDigits(uint64_t x)\r\n{\r\n unsigned digits = 1;\r\n while (true)\r\n {\r\n if (x < 10)\r\n return digits;\r\n if (x < 100)\r\n return digits + 1;\r\n if (x < 1000)\r\n return digits + 2;\r\n if (x < 10000)\r\n return digits + 3;\r\n x \/= 10000;\r\n digits += 4;\r\n }\r\n}\r\n\r\ntemplate <typename T>\r\nvoid printDecimal(T x, char* buffer, unsigned numDigits)\r\n{\r\n buffer += numDigits;\r\n while (numDigits--)\r\n {\r\n *--buffer = static_cast<char>('0' + (x % 10));\r\n x \/= 10;\r\n }\r\n}\r\n\r\nvoid Logger::printHeader(LogStatement* stmt)\r\n{\r\n static const char* severity_texts[] = {\r\n \"TRACE\",\r\n \"DEBUG\",\r\n \"INFO \",\r\n \"WARN \",\r\n \"ERROR\"\r\n };\r\n\r\n using namespace LOG11_STD::chrono;\r\n\r\n Sink* sink = m_sink;\r\n if (!sink)\r\n return;\r\n\r\n auto t = duration_cast<microseconds>(\r\n high_resolution_clock::duration(stmt->m_timeStamp)).count();\r\n\r\n auto secs = t \/ 1000000;\r\n auto mins = secs \/ 60;\r\n auto hours = mins \/ 60;\r\n unsigned days = (hours \/ 24) % 10000;\r\n\r\n memset(m_conversionBuffer, ' ', 29);\r\n m_conversionBuffer[0] = '[';\r\n m_conversionBuffer[27] = ']';\r\n m_conversionBuffer[8] = ':';\r\n m_conversionBuffer[11] = ':';\r\n m_conversionBuffer[14] = '.';\r\n auto digits = numDecimalDigits(days);\r\n printDecimal(days, m_conversionBuffer + 5 - digits, digits);\r\n printDecimal(unsigned(hours % 24), m_conversionBuffer + 6, 2);\r\n printDecimal(unsigned(mins % 60), m_conversionBuffer + 9, 2);\r\n printDecimal(unsigned(secs % 60), m_conversionBuffer + 12, 2);\r\n printDecimal(unsigned(t % 1000000), m_conversionBuffer + 15, 6);\r\n memcpy(m_conversionBuffer + 22, severity_texts[stmt->m_severity], 5);\r\n\r\n sink->putString(m_conversionBuffer, 29);\r\n}\r\n\r\n} \/\/ namespace log11\r\n<commit_msg>Better output for nullptr.<commit_after>\/*******************************************************************************\r\n Copyright (c) 2016, Manuel Freiberger\r\n All rights reserved.\r\n\r\n Redistribution and use in source and binary forms, with or without\r\n modification, are permitted provided that the following conditions are met:\r\n\r\n * Redistributions of source code must retain the above copyright notice, this\r\n list of conditions and the following disclaimer.\r\n\r\n * Redistributions in binary form must reproduce the above copyright notice,\r\n this list of conditions and the following disclaimer in the documentation\r\n and\/or other materials provided with the distribution.\r\n\r\n THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS \"AS IS\"\r\n AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE\r\n IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE\r\n DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE\r\n FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL\r\n DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR\r\n SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER\r\n CAUSED 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 THE USE\r\n OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.\r\n*******************************************************************************\/\r\n\r\n#include \"logger.hpp\"\r\n#include \"sink.hpp\"\r\n\r\n#include <cstdint>\r\n#include <cstring>\r\n\r\n#ifdef LOG11_USE_WEOS\r\n#include <weos\/thread.hpp>\r\n#else\r\n#include <thread>\r\n#endif \/\/ LOG11_USE_WEOS\r\n\r\n\r\nusing namespace std;\r\n\r\nnamespace log11\r\n{\r\nusing namespace log11_detail;\r\n\r\n\/\/ ----=====================================================================----\r\n\/\/ Converter\r\n\/\/ ----=====================================================================----\r\n\r\nclass Converter : public Visitor\r\n{\r\npublic:\r\n Converter(Logger& logger)\r\n : m_logger(logger)\r\n {\r\n }\r\n\r\n virtual void visit(bool value)\r\n {\r\n if (value)\r\n m_logger.m_sink.load()->putString(\"true\", 4);\r\n else\r\n m_logger.m_sink.load()->putString(\"false\", 5);\r\n }\r\n\r\n virtual void visit(char value)\r\n {\r\n m_logger.m_sink.load()->putChar(value);\r\n }\r\n\r\n virtual void visit(signed char value)\r\n {\r\n auto length = snprintf(m_logger.m_conversionBuffer, sizeof(m_logger.m_conversionBuffer),\r\n \"%d\", value);\r\n m_logger.m_sink.load()->putString(m_logger.m_conversionBuffer, length);\r\n }\r\n\r\n virtual void visit(unsigned char value)\r\n {\r\n auto length = snprintf(m_logger.m_conversionBuffer, sizeof(m_logger.m_conversionBuffer),\r\n \"%u\", value);\r\n m_logger.m_sink.load()->putString(m_logger.m_conversionBuffer, length);\r\n }\r\n\r\n virtual void visit(short value)\r\n {\r\n auto length = snprintf(m_logger.m_conversionBuffer, sizeof(m_logger.m_conversionBuffer),\r\n \"%d\", value);\r\n m_logger.m_sink.load()->putString(m_logger.m_conversionBuffer, length);\r\n }\r\n\r\n virtual void visit(unsigned short value)\r\n {\r\n auto length = snprintf(m_logger.m_conversionBuffer, sizeof(m_logger.m_conversionBuffer),\r\n \"%u\", value);\r\n m_logger.m_sink.load()->putString(m_logger.m_conversionBuffer, length);\r\n }\r\n\r\n virtual void visit(int value)\r\n {\r\n auto length = snprintf(m_logger.m_conversionBuffer, sizeof(m_logger.m_conversionBuffer),\r\n \"%d\", value);\r\n m_logger.m_sink.load()->putString(m_logger.m_conversionBuffer, length);\r\n }\r\n\r\n virtual void visit(unsigned value)\r\n {\r\n auto length = snprintf(m_logger.m_conversionBuffer, sizeof(m_logger.m_conversionBuffer),\r\n \"%u\", value);\r\n m_logger.m_sink.load()->putString(m_logger.m_conversionBuffer, length);\r\n }\r\n\r\n virtual void visit(long value)\r\n {\r\n auto length = snprintf(m_logger.m_conversionBuffer, sizeof(m_logger.m_conversionBuffer),\r\n \"%ld\", value);\r\n m_logger.m_sink.load()->putString(m_logger.m_conversionBuffer, length);\r\n }\r\n\r\n virtual void visit(unsigned long value)\r\n {\r\n auto length = snprintf(m_logger.m_conversionBuffer, sizeof(m_logger.m_conversionBuffer),\r\n \"%lu\", value);\r\n m_logger.m_sink.load()->putString(m_logger.m_conversionBuffer, length);\r\n }\r\n\r\n virtual void visit(long long value)\r\n {\r\n auto length = snprintf(m_logger.m_conversionBuffer, sizeof(m_logger.m_conversionBuffer),\r\n \"%lld\", value);\r\n m_logger.m_sink.load()->putString(m_logger.m_conversionBuffer, length);\r\n }\r\n\r\n virtual void visit(unsigned long long value)\r\n {\r\n auto length = snprintf(m_logger.m_conversionBuffer, sizeof(m_logger.m_conversionBuffer),\r\n \"%llu\", value);\r\n m_logger.m_sink.load()->putString(m_logger.m_conversionBuffer, length);\r\n }\r\n\r\n virtual void visit(float value)\r\n {\r\n auto length = snprintf(m_logger.m_conversionBuffer, sizeof(m_logger.m_conversionBuffer),\r\n \"%f\", value);\r\n m_logger.m_sink.load()->putString(m_logger.m_conversionBuffer, length);\r\n }\r\n\r\n virtual void visit(double value)\r\n {\r\n auto length = snprintf(m_logger.m_conversionBuffer, sizeof(m_logger.m_conversionBuffer),\r\n \"%f\", value);\r\n m_logger.m_sink.load()->putString(m_logger.m_conversionBuffer, length);\r\n }\r\n\r\n virtual void visit(long double value)\r\n {\r\n auto length = snprintf(m_logger.m_conversionBuffer, sizeof(m_logger.m_conversionBuffer),\r\n \"%Lf\", value);\r\n m_logger.m_sink.load()->putString(m_logger.m_conversionBuffer, length);\r\n }\r\n\r\n virtual void visit(const void* value) override\r\n {\r\n if (value)\r\n {\r\n auto length = snprintf(m_logger.m_conversionBuffer, sizeof(m_logger.m_conversionBuffer),\r\n \"0x%08lx\", uintptr_t(value));\r\n m_logger.m_sink.load()->putString(m_logger.m_conversionBuffer, length);\r\n }\r\n else\r\n {\r\n m_logger.m_sink.load()->putString(\"<null>\", 6);\r\n }\r\n }\r\n\r\n virtual void visit(const char* value) override\r\n {\r\n if (value)\r\n {\r\n m_logger.m_sink.load()->putString(value, std::strlen(value));\r\n }\r\n else\r\n {\r\n m_logger.m_sink.load()->putString(\"<null>\", 6);\r\n }\r\n }\r\n\r\n virtual void visit(const StringRef& s1, const StringRef& s2)\r\n {\r\n Sink* sink = m_logger.m_sink;\r\n if (s1.size())\r\n sink->putString(s1.data(), s1.size());\r\n if (s2.size())\r\n sink->putString(s2.data(), s2.size());\r\n }\r\n\r\n virtual void outOfBounds()\r\n {\r\n m_logger.m_sink.load()->putString(\"?!\", 2);\r\n }\r\n\r\nprivate:\r\n Logger& m_logger;\r\n};\r\n\r\n\/\/ ----=====================================================================----\r\n\/\/ LogStatement\r\n\/\/ ----=====================================================================----\r\n\r\nLogStatement::LogStatement(Severity severity, const char* msg)\r\n : m_timeStamp(LOG11_STD::chrono::high_resolution_clock::now().time_since_epoch().count()),\r\n m_message(msg),\r\n m_extensionSize(0),\r\n m_extensionType(0),\r\n m_severity(static_cast<int>(severity))\r\n{\r\n}\r\n\r\n\/\/ ----=====================================================================----\r\n\/\/ Logger\r\n\/\/ ----=====================================================================----\r\n\r\n#ifdef LOG11_USE_WEOS\r\nLogger::Logger(const weos::thread_attributes& attrs, std::size_t bufferSize)\r\n#else\r\nLogger::Logger(std::size_t bufferSize)\r\n#endif \/\/ LOG11_USE_WEOS\r\n : m_messageFifo(sizeof(LogStatement), bufferSize),\r\n m_flags(AppendNewLine),\r\n m_sink{nullptr},\r\n m_severityThreshold{Severity::Info}\r\n{\r\n#ifdef LOG11_USE_WEOS\r\n weos::thread(attrs, &Logger::consumeFifoEntries, this).detach();\r\n#else\r\n std::thread(&Logger::consumeFifoEntries, this).detach();\r\n#endif \/\/ LOG11_USE_WEOS\r\n}\r\n\r\nLogger::~Logger()\r\n{\r\n m_flags |= StopRequest;\r\n \/\/ Signal the consumer thread.\r\n auto claimed = m_messageFifo.claim(1);\r\n new (m_messageFifo[claimed.begin]) LogStatement(Severity::Debug, nullptr);\r\n m_messageFifo.publish(claimed);\r\n}\r\n\r\nvoid Logger::setSeverityThreshold(Severity severity) noexcept\r\n{\r\n m_severityThreshold = severity;\r\n}\r\n\r\nvoid Logger::setAutomaticNewLine(bool enable) noexcept\r\n{\r\n if (enable)\r\n {\r\n int flag = m_flags;\r\n while (!m_flags.compare_exchange_weak(flag, flag | AppendNewLine));\r\n }\r\n else\r\n {\r\n int flag = m_flags;\r\n while (!m_flags.compare_exchange_weak(flag, flag & ~AppendNewLine));\r\n }\r\n}\r\n\r\nvoid Logger::setSink(Sink* sink) noexcept\r\n{\r\n m_sink = sink;\r\n}\r\n\r\nvoid Logger::doLog(ClaimPolicy policy, Severity severity, const char* message)\r\n{\r\n if (severity < m_severityThreshold)\r\n return;\r\n\r\n auto claimed = policy == Block ? m_messageFifo.claim(1)\r\n : m_messageFifo.tryClaim(1, policy == Truncate);\r\n if (claimed.length == 0)\r\n return;\r\n\r\n new (m_messageFifo[claimed.begin]) LogStatement(severity, message);\r\n\r\n if (policy == Block)\r\n m_messageFifo.publish(claimed);\r\n else\r\n m_messageFifo.tryPublish(claimed);\r\n}\r\n\r\nvoid Logger::consumeFifoEntries()\r\n{\r\n Converter converter(*this);\r\n\r\n while ((m_flags & StopRequest) == 0)\r\n {\r\n auto available = m_messageFifo.available();\r\n while ((m_flags & StopRequest) == 0 && available.length)\r\n {\r\n \/\/ If no sink is attached to the logger, consume all FIFO entries.\r\n Sink* sink = m_sink;\r\n if (!sink)\r\n {\r\n m_messageFifo.consume(available.length);\r\n break;\r\n }\r\n\r\n auto stmt = static_cast<LogStatement*>(m_messageFifo[available.begin]);\r\n if (!stmt->m_message)\r\n return;\r\n\r\n sink->beginLogEntry(static_cast<Severity>(stmt->m_severity));\r\n printHeader(stmt);\r\n\r\n if (stmt->m_extensionType == 0)\r\n {\r\n sink->putString(stmt->m_message, std::strlen(stmt->m_message));\r\n\r\n ++available.begin;\r\n --available.length;\r\n m_messageFifo.consume(1);\r\n }\r\n else\r\n {\r\n SerdesBase* serdes\r\n = stmt->m_extensionSize\r\n ? *static_cast<SerdesBase**>(m_messageFifo[available.begin + 1])\r\n : nullptr;\r\n auto byteRange = m_messageFifo.byteRange(\r\n RingBuffer::Range(available.begin + 1,\r\n stmt->m_extensionSize));\r\n\r\n \/\/ Interpret the format string.\r\n unsigned argCounter = 0;\r\n const char* beginPos = stmt->m_message;\r\n const char* iter = beginPos;\r\n for (; *iter; ++iter)\r\n {\r\n if (*iter == '{')\r\n {\r\n if (iter != beginPos)\r\n sink->putString(beginPos, iter - beginPos);\r\n\r\n \/\/ Loop to the end of the format specifier (or the end of the string).\r\n beginPos = ++iter;\r\n while (*iter && *iter != '}')\r\n ++iter;\r\n if (!*iter)\r\n {\r\n beginPos = iter;\r\n break;\r\n }\r\n ++argCounter;\r\n if (serdes)\r\n serdes->apply(m_messageFifo, byteRange, argCounter, converter);\r\n else\r\n converter.outOfBounds();\r\n\r\n beginPos = iter + 1;\r\n }\r\n }\r\n if (iter != beginPos)\r\n sink->putString(beginPos, iter - beginPos);\r\n\r\n available.begin += 1 + stmt->m_extensionSize;\r\n available.length -= 1 + stmt->m_extensionSize;\r\n m_messageFifo.consume(1 + stmt->m_extensionSize);\r\n }\r\n\r\n if (m_flags & AppendNewLine)\r\n sink->putChar('\\n');\r\n sink->endLogEntry();\r\n }\r\n }\r\n}\r\n\r\n\r\nint numDecimalDigits(uint64_t x)\r\n{\r\n unsigned digits = 1;\r\n while (true)\r\n {\r\n if (x < 10)\r\n return digits;\r\n if (x < 100)\r\n return digits + 1;\r\n if (x < 1000)\r\n return digits + 2;\r\n if (x < 10000)\r\n return digits + 3;\r\n x \/= 10000;\r\n digits += 4;\r\n }\r\n}\r\n\r\ntemplate <typename T>\r\nvoid printDecimal(T x, char* buffer, unsigned numDigits)\r\n{\r\n buffer += numDigits;\r\n while (numDigits--)\r\n {\r\n *--buffer = static_cast<char>('0' + (x % 10));\r\n x \/= 10;\r\n }\r\n}\r\n\r\nvoid Logger::printHeader(LogStatement* stmt)\r\n{\r\n static const char* severity_texts[] = {\r\n \"TRACE\",\r\n \"DEBUG\",\r\n \"INFO \",\r\n \"WARN \",\r\n \"ERROR\"\r\n };\r\n\r\n using namespace LOG11_STD::chrono;\r\n\r\n Sink* sink = m_sink;\r\n if (!sink)\r\n return;\r\n\r\n auto t = duration_cast<microseconds>(\r\n high_resolution_clock::duration(stmt->m_timeStamp)).count();\r\n\r\n auto secs = t \/ 1000000;\r\n auto mins = secs \/ 60;\r\n auto hours = mins \/ 60;\r\n unsigned days = (hours \/ 24) % 10000;\r\n\r\n memset(m_conversionBuffer, ' ', 29);\r\n m_conversionBuffer[0] = '[';\r\n m_conversionBuffer[27] = ']';\r\n m_conversionBuffer[8] = ':';\r\n m_conversionBuffer[11] = ':';\r\n m_conversionBuffer[14] = '.';\r\n auto digits = numDecimalDigits(days);\r\n printDecimal(days, m_conversionBuffer + 5 - digits, digits);\r\n printDecimal(unsigned(hours % 24), m_conversionBuffer + 6, 2);\r\n printDecimal(unsigned(mins % 60), m_conversionBuffer + 9, 2);\r\n printDecimal(unsigned(secs % 60), m_conversionBuffer + 12, 2);\r\n printDecimal(unsigned(t % 1000000), m_conversionBuffer + 15, 6);\r\n memcpy(m_conversionBuffer + 22, severity_texts[stmt->m_severity], 5);\r\n\r\n sink->putString(m_conversionBuffer, 29);\r\n}\r\n\r\n} \/\/ namespace log11\r\n<|endoftext|>"} {"text":"<commit_before>\/*\n * PolygonParser.cpp\n *\n * Created on: 22 Aug 2015\n * Author: makrai\n *\/\n\n#include \"PolygonParser.h\"\n\n#include <fstream>\n#include <stdlib.h>\n#include <cmath>\n\n#ifdef _DEBUG_\n#include <iostream>\nusing namespace std;\n#endif\n\nvoid PolygonParser::parse(const char* fileName, unsigned char* buffer, int bufferSize, PolygonStore* polygonStore) {\n\tFILE* source = fopen(fileName, \"r\");\n\n\tint state = 0;\n\n\tint var1 = 0;\n\tint var2 = 0;\n\n\tchar XChar[32];\n\tchar YChar[32];\n\n\tdouble ax;\n\tdouble ay;\n\tdouble bx;\n\tdouble by;\n\tdouble cx;\n\tdouble cy;\n\n\twhile (!feof(source)) {\n\t\tint readedBytes = fread(buffer, 1, bufferSize, source);\n\t\tfor (int i = 0; i < readedBytes; ++i) {\n\t\t\tif (state == 0 && buffer[i] != ':') {\n\t\t\t\tstate =1;\n\t\t\t} else if (state == 1 && buffer[i] == '>') {\n\t\t\t\tstate = 2;\n\t\t\t} else if (state == 2 && buffer[i] == '>') {\n\t\t\t\tstate = 3;\n\t\t\t} else if (state == 3 && buffer[i] == '>') {\n\t\t\t\tstate = 4;\n\t\t\t} else if (state == 4 && buffer[i] == '>') {\n\t\t\t\tstate = 5;\n\t\t\t} else if (state == 5 && buffer[i] != ',') {\n\t\t\t\tXChar[var1] = buffer[i];\n\t\t\t\t++var1;\n\t\t\t} else if (state == 5) {\n\t\t\t\tXChar[var1] = 0;\n\t\t\t\tstate = 6;\n\t\t\t\tvar1 = 0;\n\t\t\t} else if (state == 6 && buffer[i] != ' ' && buffer[i] != '<') {\n\t\t\t\tYChar[var1] = buffer[i];\n\t\t\t\t++var1;\n\t\t\t} else if (state == 6) {\n\t\t\t\tYChar[var1] = 0;\n\t\t\t\tvar1 = 0;\n\t\t\t\tstate = 5;\n\n\t\t\t\tif (var2 == 0) {\n\t\t\t\t\tax = atof(XChar);\n\t\t\t\t\tay = atof(YChar);\n\t\t\t\t\tvar2 = 1;\n\t\t\t\t} else if (var2 == 1) {\n\t\t\t\t\tbx = atof(XChar);\n\t\t\t\t\tby = atof(YChar);\n\t\t\t\t\tvar2 = 2;\n\t\t\t\t} else {\n\t\t\t\t\tcx = atof(XChar);\n\t\t\t\t\tcy = atof(YChar);\n\n\t\t\t\t\tif (fabs(ax - cx) + fabs(ay - cy) > 0.000001) {\n\t\t\t\t\t\tpolygonStore->addPolygon(ax, ay, bx, by, cx, cy);\n\t#ifdef _PDEBUG_\n\t\t\t\t\t\tcout << \"add polygon: ax:\" << ax << \",ay:\" << ay << \",bx:\" << bx << \",by:\" << by << \",cx:\" << cx << \",cy:\" << cy << endl;\n\t\t\t\t\t\tbx = cx;\n\t\t\t\t\t\tby = cy;\n\t#endif\n\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\tif (buffer[i] == '<') {\n\t\t\t\t\tstate = 10;\n\t\t\t\t}\n\t\t\t} else if (state == 10 && buffer[i] == 10) {\n\t\t\t\tvar1 = 0;\n\t\t\t\tvar2 = 0;\n\t\t\t\tstate = 0;\n\t\t\t}\n\t\t}\n\t}\n\n\tfclose(source);\n\n}\n\n<commit_msg>initialising some variables in PolygonParser<commit_after>\/*\n * PolygonParser.cpp\n *\n * Created on: 22 Aug 2015\n * Author: makrai\n *\/\n\n#include \"PolygonParser.h\"\n\n#include <fstream>\n#include <stdlib.h>\n#include <cmath>\n\n#ifdef _DEBUG_\n#include <iostream>\nusing namespace std;\n#endif\n\nvoid PolygonParser::parse(const char* fileName, unsigned char* buffer, int bufferSize, PolygonStore* polygonStore) {\n\tFILE* source = fopen(fileName, \"r\");\n\n\tint state = 0;\n\n\tint var1 = 0;\n\tint var2 = 0;\n\n\tchar XChar[32];\n\tchar YChar[32];\n\n\tdouble ax = 0.0;\n\tdouble ay = 0.0;\n\tdouble bx = 0.0;\n\tdouble by = 0.0;\n\tdouble cx = 0.0;\n\tdouble cy = 0.0;\n\n\twhile (!feof(source)) {\n\t\tint readedBytes = fread(buffer, 1, bufferSize, source);\n\t\tfor (int i = 0; i < readedBytes; ++i) {\n\t\t\tif (state == 0 && buffer[i] != ':') {\n\t\t\t\tstate =1;\n\t\t\t} else if (state == 1 && buffer[i] == '>') {\n\t\t\t\tstate = 2;\n\t\t\t} else if (state == 2 && buffer[i] == '>') {\n\t\t\t\tstate = 3;\n\t\t\t} else if (state == 3 && buffer[i] == '>') {\n\t\t\t\tstate = 4;\n\t\t\t} else if (state == 4 && buffer[i] == '>') {\n\t\t\t\tstate = 5;\n\t\t\t} else if (state == 5 && buffer[i] != ',') {\n\t\t\t\tXChar[var1] = buffer[i];\n\t\t\t\t++var1;\n\t\t\t} else if (state == 5) {\n\t\t\t\tXChar[var1] = 0;\n\t\t\t\tstate = 6;\n\t\t\t\tvar1 = 0;\n\t\t\t} else if (state == 6 && buffer[i] != ' ' && buffer[i] != '<') {\n\t\t\t\tYChar[var1] = buffer[i];\n\t\t\t\t++var1;\n\t\t\t} else if (state == 6) {\n\t\t\t\tYChar[var1] = 0;\n\t\t\t\tvar1 = 0;\n\t\t\t\tstate = 5;\n\n\t\t\t\tif (var2 == 0) {\n\t\t\t\t\tax = atof(XChar);\n\t\t\t\t\tay = atof(YChar);\n\t\t\t\t\tvar2 = 1;\n\t\t\t\t} else if (var2 == 1) {\n\t\t\t\t\tbx = atof(XChar);\n\t\t\t\t\tby = atof(YChar);\n\t\t\t\t\tvar2 = 2;\n\t\t\t\t} else {\n\t\t\t\t\tcx = atof(XChar);\n\t\t\t\t\tcy = atof(YChar);\n\n\t\t\t\t\tif (fabs(ax - cx) + fabs(ay - cy) > 0.000001) {\n\t\t\t\t\t\tpolygonStore->addPolygon(ax, ay, bx, by, cx, cy);\n\t#ifdef _PDEBUG_\n\t\t\t\t\t\tcout << \"add polygon: ax:\" << ax << \",ay:\" << ay << \",bx:\" << bx << \",by:\" << by << \",cx:\" << cx << \",cy:\" << cy << endl;\n\t\t\t\t\t\tbx = cx;\n\t\t\t\t\t\tby = cy;\n\t#endif\n\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\tif (buffer[i] == '<') {\n\t\t\t\t\tstate = 10;\n\t\t\t\t}\n\t\t\t} else if (state == 10 && buffer[i] == 10) {\n\t\t\t\tvar1 = 0;\n\t\t\t\tvar2 = 0;\n\t\t\t\tstate = 0;\n\t\t\t}\n\t\t}\n\t}\n\n\tfclose(source);\n\n}\n\n<|endoftext|>"} {"text":"<commit_before>\/\/=============================================================================\n\/\/File Name: ITG3200_ADXL345.cpp\n\/\/Description: Implements a Kalman filter with the I2C IMU with the ITG3200\n\/\/ 3-axis gyro and the ADXL345 3-axis accelerometer\n\/\/Author: FRC Team 3512, Spartatroniks\n\/\/=============================================================================\n\n#include \"ITG3200_ADXL345.hpp\"\n\n#include <DigitalModule.h>\n#include <I2C.h>\n\nITG3200_ADXL345::ITG3200_ADXL345( UINT32 slot , UINT32 gyroAddress , UINT32 accelAddress )\n: m_gyro( NULL ) , m_accel( NULL ) {\n DigitalModule* module = DigitalModule::GetInstance( slot );\n\n if ( module != NULL ) {\n m_gyro = module->GetI2C( gyroAddress );\n m_accel = module->GetI2C( accelAddress );\n }\n\n if ( m_gyro != NULL ) {\n m_gyro->Write( 0x16 , 0x1A ); \/\/ Sets gyro at +-2000deg\/sec and 98Hz Low pass filter\n m_gyro->Write( 0x15 , 0x09 ); \/\/ Sets gyro at 100Hz sample rate\n }\n\n if ( m_accel != NULL ) {\n m_accel->Write( 0x31 , 0x09 ); \/\/ Full resolution mode\n m_accel->Write( 0x2D , 0x08 ); \/\/ Setup ADXL345 for constant measurement mode\n }\n}\n\nITG3200_ADXL345::~ITG3200_ADXL345() {\n delete m_gyro;\n delete m_accel;\n}\n\n\/\/ Actually measures y-axis of gyro for consistency with accelerometer\nint ITG3200_ADXL345::readGyroX() {\n uint8_t* data = NULL;\n\n m_gyro->Read( 0x1F , 2 , data );\n\n return (data[0] << 8) | data[1];\n}\n\n\/\/ Actually measures x-axis of gyro for consistency with accelerometer\nint ITG3200_ADXL345::readGyroY() {\n uint8_t* data = NULL;\n\n m_gyro->Read( 0x1D , 2 , data );\n\n return (data[0] << 8) | data[1];\n}\n\nint ITG3200_ADXL345::readGyroZ() {\n uint8_t* data = NULL;\n\n m_gyro->Read( 0x21 , 2 , data );\n\n return (data[0] << 8) | data[1];\n}\n\nint ITG3200_ADXL345::readAccelX() {\n uint8_t* data = NULL;\n\n m_accel->Read( 0x32 , 2 , data );\n\n return data[0] | (data[1] << 8);\n}\n\nint ITG3200_ADXL345::readAccelY() {\n uint8_t* data = NULL;\n\n m_accel->Read( 0x34 , 2 , data );\n\n return data[0] | (data[1] << 8);\n}\n\nint ITG3200_ADXL345::readAccelZ() {\n uint8_t* data = NULL;\n\n m_accel->Read( 0x36 , 2 , data );\n\n return data[0] | (data[1] << 8);\n}\n\ndouble ITG3200_ADXL345::getGyroXzero() {\n return 52.3;\n}\n\ndouble ITG3200_ADXL345::getGyroYzero() {\n return -18.5;\n}\n\ndouble ITG3200_ADXL345::getGyroZzero() {\n return 0.0; \/\/ TODO Find gyro's real z-axis zero\n}\n\ndouble ITG3200_ADXL345::getAccelXzero() {\n return -200;\n}\n\ndouble ITG3200_ADXL345::getAccelYzero() {\n return 44;\n}\n\ndouble ITG3200_ADXL345::getAccelZzero() {\n return 660;\n}\n\ndouble ITG3200_ADXL345::getGyroLSBsPerUnit() {\n return 14.375;\n}\n\nvoid ITG3200_ADXL345::callCalcAngle() {\n calcAngle( getAccelXangle() , getGyroXrate() );\n}\n<commit_msg>Removed null dereferences in I2C reads<commit_after>\/\/=============================================================================\n\/\/File Name: ITG3200_ADXL345.cpp\n\/\/Description: Implements a Kalman filter with the I2C IMU with the ITG3200\n\/\/ 3-axis gyro and the ADXL345 3-axis accelerometer\n\/\/Author: FRC Team 3512, Spartatroniks\n\/\/=============================================================================\n\n#include \"ITG3200_ADXL345.hpp\"\n\n#include <DigitalModule.h>\n#include <I2C.h>\n\nITG3200_ADXL345::ITG3200_ADXL345( UINT32 slot , UINT32 gyroAddress , UINT32 accelAddress )\n: m_gyro( NULL ) , m_accel( NULL ) {\n DigitalModule* module = DigitalModule::GetInstance( slot );\n\n if ( module != NULL ) {\n m_gyro = module->GetI2C( gyroAddress );\n m_accel = module->GetI2C( accelAddress );\n }\n\n if ( m_gyro != NULL ) {\n m_gyro->Write( 0x16 , 0x1A ); \/\/ Sets gyro at +-2000deg\/sec and 98Hz Low pass filter\n m_gyro->Write( 0x15 , 0x09 ); \/\/ Sets gyro at 100Hz sample rate\n }\n\n if ( m_accel != NULL ) {\n m_accel->Write( 0x31 , 0x09 ); \/\/ Full resolution mode\n m_accel->Write( 0x2D , 0x08 ); \/\/ Setup ADXL345 for constant measurement mode\n }\n}\n\nITG3200_ADXL345::~ITG3200_ADXL345() {\n delete m_gyro;\n delete m_accel;\n}\n\n\/\/ Actually measures y-axis of gyro for consistency with accelerometer\nint ITG3200_ADXL345::readGyroX() {\n uint8_t data[2];\n\n if ( m_gyro != NULL ) {\n m_gyro->Read( 0x1F , 2 , data );\n return (data[0] << 8) | data[1];\n }\n else {\n return 0;\n }\n}\n\n\/\/ Actually measures x-axis of gyro for consistency with accelerometer\nint ITG3200_ADXL345::readGyroY() {\n uint8_t data[2];\n\n if ( m_gyro != NULL ) {\n m_gyro->Read( 0x1D , 2 , data );\n return (data[0] << 8) | data[1];\n }\n else {\n return 0;\n }\n}\n\nint ITG3200_ADXL345::readGyroZ() {\n uint8_t data[2];\n\n if ( m_gyro != NULL ) {\n m_gyro->Read( 0x21 , 2 , data );\n return (data[0] << 8) | data[1];\n }\n else {\n return 0;\n }\n}\n\nint ITG3200_ADXL345::readAccelX() {\n uint8_t data[2];\n\n if ( m_accel != NULL ) {\n m_accel->Read( 0x32 , 2 , data );\n return (data[0] << 8) | data[1];\n }\n else {\n return 0;\n }\n}\n\nint ITG3200_ADXL345::readAccelY() {\n uint8_t data[2];\n\n if ( m_accel != NULL ) {\n m_accel->Read( 0x34 , 2 , data );\n return data[0] | (data[1] << 8);\n }\n else {\n return 0;\n }\n}\n\nint ITG3200_ADXL345::readAccelZ() {\n uint8_t data[2];\n\n if ( m_accel != NULL ) {\n m_accel->Read( 0x36 , 2 , data );\n return (data[0] << 8) | data[1];\n }\n else {\n return 0;\n }\n}\n\ndouble ITG3200_ADXL345::getGyroXzero() {\n return 52.3;\n}\n\ndouble ITG3200_ADXL345::getGyroYzero() {\n return -18.5;\n}\n\ndouble ITG3200_ADXL345::getGyroZzero() {\n return 0.0; \/\/ TODO Find gyro's real z-axis zero\n}\n\ndouble ITG3200_ADXL345::getAccelXzero() {\n return -200;\n}\n\ndouble ITG3200_ADXL345::getAccelYzero() {\n return 44;\n}\n\ndouble ITG3200_ADXL345::getAccelZzero() {\n return 660;\n}\n\ndouble ITG3200_ADXL345::getGyroLSBsPerUnit() {\n return 14.375;\n}\n\nvoid ITG3200_ADXL345::callCalcAngle() {\n calcAngle( getAccelXangle() , getGyroXrate() );\n}\n<|endoftext|>"} {"text":"<commit_before>#include <cstdlib>\n#include <iostream>\n#include <stdio.h>\n#include <fstream>\n#include <vector>\n#include <unistd.h>\nusing namespace std;\n\n#include \"bgzf.h\"\n#include \"grabix.h\"\n\nint usage()\n{\n cout << \"usage: grabix index bgzf_file \" << endl;\n cout << \" grabix grab bgzf_file line_start [line_end] \" << endl;\n cout << endl;\n cout << \"examples:\" << endl;\n cout << \" # create a grabix index (big.vcf.gz.gbi)\" << endl;\n cout << \" grabix index big.vcf.gz\" << endl;\n cout << endl;\n cout << \" # extract the 100th line.\" << endl;\n cout << \" grabix grab big.vcf.gz 100 [line_end] \" << endl;\n cout << endl;\n cout << \" # extract the 100th through the 200th lines.\" << endl;\n cout << \" grabix grab big.vcf.gz 100 200 \" << endl;\n cout << endl;\n cout << \" # extract the 100 random lines.\" << endl;\n cout << \" grabix random big.vcf.gz 100\" << endl;\n cout << endl;\n cout << \" # Is the file bgzipped?\" << endl;\n cout << \" grabix check big.vcf.gz\" << endl;\n cout << endl;\n cout << \" # get total number of lines in the file (minus the header).\" << endl;\n cout << \" grabix size big.vcf.gz\" << endl;\n cout << \"version: \" << VERSION << \"\\n\";\n cout << endl;\n return EXIT_SUCCESS;\n}\n\n\nbool bgzf_getline_counting(BGZF * stream)\n{\n int c = -1;\n while (true)\n {\n c = bgzf_getc (stream);\n if (c == -1)\n return true;\n else if (c == 10) \/\/ \\n\n return false;\n }\n}\n\n\/*\nCreate a gbi index for the file to facilitate\nrandom access via the BGZF seek utility\n*\/\nint create_grabix_index(string bgzf_file)\n{\n if (!bgzf_is_bgzf(bgzf_file.c_str()))\n {\n cerr << \"[grabix] \" << bgzf_file << \" doesn't exist or wasn't compressed with bgzip\" << endl;\n exit (1);\n }\n\n BGZF *bgzf_fp = bgzf_open(bgzf_file.c_str(), \"r\");\n if (bgzf_fp == NULL)\n {\n cerr << \"[grabix] could not open file: \" << bgzf_file << endl;\n exit (1);\n }\n\n \/\/ create an index for writing\n string index_file_name = bgzf_file + \".gbi.tmp\";\n ofstream index_file(index_file_name.c_str(), ios::out);\n\n \/\/ add the offset for the end of the header to the index\n\n int status;\n kstring_t *line = new kstring_t;\n line->s = '\\0';\n line->l = 0;\n line->m = 0;\n\n int64_t prev_offset = 0;\n int64_t offset = 0;\n while ((status = bgzf_getline(bgzf_fp, '\\n', line)) >= 0)\n {\n offset = bgzf_tell(bgzf_fp);\n if (line->s[0] != '#')\n break;\n prev_offset = offset;\n }\n index_file << prev_offset << endl;\n\n \/\/ add the offsets for each CHUNK_SIZE\n \/\/ set of records to the index\n size_t chunk_count = 0;\n int64_t total_lines = 1;\n vector<int64_t> chunk_positions;\n chunk_positions.push_back (prev_offset);\n int eof = 1;\n while (true)\n {\n \/\/ grab the next line and store the offset\n eof = bgzf_getline(bgzf_fp, '\\n', line);\n offset = bgzf_tell(bgzf_fp);\n chunk_count++;\n \/\/ stop if we have encountered an empty line\n if (eof < 0 || offset == prev_offset)\n {\n if (bgzf_check_EOF(bgzf_fp) == 1) {\n if (offset > prev_offset) {\n total_lines++;\n prev_offset = offset;\n }\n break;\n }\n break;\n }\n \/\/ store the offset of this chunk start\n else if (chunk_count == CHUNK_SIZE)\n {\n chunk_positions.push_back(prev_offset);\n chunk_count = 0;\n }\n total_lines++;\n prev_offset = offset;\n }\n chunk_positions.push_back (prev_offset);\n bgzf_close(bgzf_fp);\n\n index_file << total_lines << endl;\n for (size_t i = 0; i < chunk_positions.size(); ++i)\n {\n index_file << chunk_positions[i] << endl;\n }\n index_file.close();\n\n return std::rename((bgzf_file + \".gbi.tmp\").c_str(), (bgzf_file + \".gbi\").c_str());\n}\n\n\/*\nLoad an existing gbi index for the file to facilitate\nrandom access via the BGZF seek utility\n*\/\nvoid load_index(string bgzf_file, index_info &index)\n{\n string index_file_name = bgzf_file + \".gbi\";\n \/\/ open the index file for reading\n ifstream index_file(index_file_name.c_str(), ios::in);\n\n if ( !index_file ) {\n cerr << \"[grabix] could not find index file: \" << index_file_name << \". Exiting!\" << endl;\n exit (1);\n }\n else {\n string line;\n getline (index_file, line);\n index.header_end = atol(line.c_str());\n\n getline (index_file, line);\n index.num_lines = atol(line.c_str());\n\n while (index_file >> line)\n {\n index.chunk_offsets.push_back(atol(line.c_str()));\n }\n }\n index_file.close();\n}\n\n\n\/*\nExtract lines [FROM, TO] from file.\n*\/\nint grab(string bgzf_file, int64_t from_line, int64_t to_line)\n{\n \/\/ load index into vector of offsets\n index_info index;\n load_index(bgzf_file, index);\n\n if (((int) from_line > index.num_lines)\n ||\n ((int) to_line > index.num_lines))\n {\n cerr << \"[grabix] requested lines exceed the number of lines in the file.\" << endl;\n exit(1);\n }\n else if (from_line < 0)\n {\n cerr << \"[grabix] indexes must be positive numbers.\" << endl;\n exit(1);\n }\n else if (from_line > to_line)\n {\n cerr << \"[grabix] requested end line is less than the requested begin line.\" << endl;\n exit(1);\n }\n else {\n\n \/\/ load the BGZF file\n BGZF *bgzf_fp = bgzf_open(bgzf_file.c_str(), \"r\");\n if (bgzf_fp == NULL)\n {\n cerr << \"[grabix] could not open file: \" << bgzf_file << endl;\n exit (1);\n }\n\n \/\/ dump the header if there is one\n int status;\n kstring_t *line = new kstring_t;\n line->s = '\\0';\n line->l = 0;\n line->m = 0;\n\n while ((status = bgzf_getline(bgzf_fp, '\\n', line)) > 0)\n {\n if (line->s[0] == '#')\n printf(\"%s\\n\", line->s);\n else break;\n }\n\n \/\/ easier to work in 0-based space\n int64_t from_line_0 = from_line - 1;\n \/\/ get the chunk index for the requested line\n int64_t requested_chunk = from_line_0 \/ CHUNK_SIZE;\n \/\/ derive the first line in that chunk\n int64_t chunk_line_start = (requested_chunk * CHUNK_SIZE);\n\n \/\/ jump to the correct offset for the relevant chunk\n \/\/ and fast forward until we find the requested line\n bgzf_seek (bgzf_fp, index.chunk_offsets[requested_chunk], SEEK_SET);\n while (chunk_line_start <= from_line_0)\n {\n status = bgzf_getline(bgzf_fp, '\\n', line);\n chunk_line_start++;\n }\n \/\/ now, print each line until we reach the end of the requested block\n do\n {\n printf(\"%s\\n\", line->s);\n status = bgzf_getline(bgzf_fp, '\\n', line);\n chunk_line_start++;\n } while (chunk_line_start <= to_line);\n }\n return EXIT_SUCCESS;\n}\n\n\n\/*\nExtract K random lines from file using reservoir sampling\n*\/\nint random(string bgzf_file, uint64_t K)\n{\n \/\/ load index into vector of offsets\n index_info index;\n load_index(bgzf_file, index);\n\n if ((int64_t) K > index.num_lines)\n {\n cerr << \"[grabix] warning: requested more lines than in the file.\" << endl;\n exit(1);\n }\n else {\n \/\/ load the BGZF file\n BGZF *bgzf_fp = bgzf_open(bgzf_file.c_str(), \"r\");\n if (bgzf_fp == NULL)\n {\n cerr << \"[grabix] could not open file: \" << bgzf_file << endl;\n exit (1);\n }\n\n \/\/ seed our random number generator\n size_t seed = (unsigned)time(0)+(unsigned)getpid();\n srand(seed);\n\n \/\/ reservoir sample\n uint64_t s = 0;\n uint64_t N = 0;\n uint64_t result_size = 0;\n vector<string> sample;\n int status;\n kstring_t *line = new kstring_t;\n line->s = '\\0';\n line->l = 0;\n line->m = 0;\n\n while ((status = bgzf_getline(bgzf_fp, '\\n', line)) != 0)\n {\n if (line->s[0] == '#')\n printf(\"%s\\n\", line->s);\n else break;\n }\n\n while ((status = bgzf_getline(bgzf_fp, '\\n', line)) != 0)\n {\n N++;\n\n if (status < 0)\n break;\n\n if (result_size < K)\n {\n sample.push_back(line->s);\n result_size++;\n }\n else\n {\n s = (int) ((double)rand()\/(double)RAND_MAX * N);\n if (s < K)\n sample[s] = line->s;\n }\n }\n bgzf_close(bgzf_fp);\n\n \/\/ report the sample\n for (size_t i = 0; i < sample.size(); ++i)\n printf(\"%s\\n\", sample[i].c_str());\n\n }\n return EXIT_SUCCESS;\n}\n\n\/*\nReturn the total number of records in the index.\n*\/\nint size(string bgzf_file)\n{\n index_info index;\n load_index(bgzf_file, index);\n\n return index.num_lines;\n}\n<commit_msg>Eliminate compile time warning<commit_after>#include <cstdlib>\n#include <iostream>\n#include <stdio.h>\n#include <fstream>\n#include <vector>\n#include <unistd.h>\nusing namespace std;\n\n#include \"bgzf.h\"\n#include \"grabix.h\"\n\nint usage()\n{\n cout << \"usage: grabix index bgzf_file \" << endl;\n cout << \" grabix grab bgzf_file line_start [line_end] \" << endl;\n cout << endl;\n cout << \"examples:\" << endl;\n cout << \" # create a grabix index (big.vcf.gz.gbi)\" << endl;\n cout << \" grabix index big.vcf.gz\" << endl;\n cout << endl;\n cout << \" # extract the 100th line.\" << endl;\n cout << \" grabix grab big.vcf.gz 100 [line_end] \" << endl;\n cout << endl;\n cout << \" # extract the 100th through the 200th lines.\" << endl;\n cout << \" grabix grab big.vcf.gz 100 200 \" << endl;\n cout << endl;\n cout << \" # extract the 100 random lines.\" << endl;\n cout << \" grabix random big.vcf.gz 100\" << endl;\n cout << endl;\n cout << \" # Is the file bgzipped?\" << endl;\n cout << \" grabix check big.vcf.gz\" << endl;\n cout << endl;\n cout << \" # get total number of lines in the file (minus the header).\" << endl;\n cout << \" grabix size big.vcf.gz\" << endl;\n cout << \"version: \" << VERSION << \"\\n\";\n cout << endl;\n return EXIT_SUCCESS;\n}\n\n\nbool bgzf_getline_counting(BGZF * stream)\n{\n int c = -1;\n while (true)\n {\n c = bgzf_getc (stream);\n if (c == -1)\n return true;\n else if (c == 10) \/\/ \\n\n return false;\n }\n}\n\n\/*\nCreate a gbi index for the file to facilitate\nrandom access via the BGZF seek utility\n*\/\nint create_grabix_index(string bgzf_file)\n{\n if (!bgzf_is_bgzf(bgzf_file.c_str()))\n {\n cerr << \"[grabix] \" << bgzf_file << \" doesn't exist or wasn't compressed with bgzip\" << endl;\n exit (1);\n }\n\n BGZF *bgzf_fp = bgzf_open(bgzf_file.c_str(), \"r\");\n if (bgzf_fp == NULL)\n {\n cerr << \"[grabix] could not open file: \" << bgzf_file << endl;\n exit (1);\n }\n\n \/\/ create an index for writing\n string index_file_name = bgzf_file + \".gbi.tmp\";\n ofstream index_file(index_file_name.c_str(), ios::out);\n\n \/\/ add the offset for the end of the header to the index\n\n int status;\n kstring_t *line = new kstring_t;\n line->s = '\\0';\n line->l = 0;\n line->m = 0;\n\n int64_t prev_offset = 0;\n int64_t offset = 0;\n while ((status = bgzf_getline(bgzf_fp, '\\n', line)) >= 0)\n {\n offset = bgzf_tell(bgzf_fp);\n if (line->s[0] != '#')\n break;\n prev_offset = offset;\n }\n index_file << prev_offset << endl;\n\n \/\/ add the offsets for each CHUNK_SIZE\n \/\/ set of records to the index\n size_t chunk_count = 0;\n int64_t total_lines = 1;\n vector<int64_t> chunk_positions;\n chunk_positions.push_back (prev_offset);\n int eof = 1;\n while (true)\n {\n \/\/ grab the next line and store the offset\n eof = bgzf_getline(bgzf_fp, '\\n', line);\n offset = bgzf_tell(bgzf_fp);\n chunk_count++;\n \/\/ stop if we have encountered an empty line\n if (eof < 0 || offset == prev_offset)\n {\n if (bgzf_check_EOF(bgzf_fp) == 1) {\n if (offset > prev_offset) {\n total_lines++;\n prev_offset = offset;\n }\n break;\n }\n break;\n }\n \/\/ store the offset of this chunk start\n else if (chunk_count == CHUNK_SIZE)\n {\n chunk_positions.push_back(prev_offset);\n chunk_count = 0;\n }\n total_lines++;\n prev_offset = offset;\n }\n chunk_positions.push_back (prev_offset);\n bgzf_close(bgzf_fp);\n\n index_file << total_lines << endl;\n for (size_t i = 0; i < chunk_positions.size(); ++i)\n {\n index_file << chunk_positions[i] << endl;\n }\n index_file.close();\n\n return std::rename((bgzf_file + \".gbi.tmp\").c_str(), (bgzf_file + \".gbi\").c_str());\n}\n\n\/*\nLoad an existing gbi index for the file to facilitate\nrandom access via the BGZF seek utility\n*\/\nvoid load_index(string bgzf_file, index_info &index)\n{\n string index_file_name = bgzf_file + \".gbi\";\n \/\/ open the index file for reading\n ifstream index_file(index_file_name.c_str(), ios::in);\n\n if ( !index_file ) {\n cerr << \"[grabix] could not find index file: \" << index_file_name << \". Exiting!\" << endl;\n exit (1);\n }\n else {\n string line;\n getline (index_file, line);\n index.header_end = atol(line.c_str());\n\n getline (index_file, line);\n index.num_lines = atol(line.c_str());\n\n while (index_file >> line)\n {\n index.chunk_offsets.push_back(atol(line.c_str()));\n }\n }\n index_file.close();\n}\n\n\n\/*\nExtract lines [FROM, TO] from file.\n*\/\nint grab(string bgzf_file, int64_t from_line, int64_t to_line)\n{\n \/\/ load index into vector of offsets\n index_info index;\n load_index(bgzf_file, index);\n\n if (((int) from_line > index.num_lines)\n ||\n ((int) to_line > index.num_lines))\n {\n cerr << \"[grabix] requested lines exceed the number of lines in the file.\" << endl;\n exit(1);\n }\n else if (from_line < 0)\n {\n cerr << \"[grabix] indexes must be positive numbers.\" << endl;\n exit(1);\n }\n else if (from_line > to_line)\n {\n cerr << \"[grabix] requested end line is less than the requested begin line.\" << endl;\n exit(1);\n }\n else {\n\n \/\/ load the BGZF file\n BGZF *bgzf_fp = bgzf_open(bgzf_file.c_str(), \"r\");\n if (bgzf_fp == NULL)\n {\n cerr << \"[grabix] could not open file: \" << bgzf_file << endl;\n exit (1);\n }\n\n \/\/ dump the header if there is one\n int status;\n kstring_t *line = new kstring_t;\n line->s = '\\0';\n line->l = 0;\n line->m = 0;\n\n while ((status = bgzf_getline(bgzf_fp, '\\n', line)) > 0)\n {\n if (line->s[0] == '#')\n printf(\"%s\\n\", line->s);\n else break;\n }\n\n \/\/ easier to work in 0-based space\n int64_t from_line_0 = from_line - 1;\n \/\/ get the chunk index for the requested line\n int64_t requested_chunk = from_line_0 \/ CHUNK_SIZE;\n \/\/ derive the first line in that chunk\n int64_t chunk_line_start = (requested_chunk * CHUNK_SIZE);\n\n \/\/ jump to the correct offset for the relevant chunk\n \/\/ and fast forward until we find the requested line\n bgzf_seek (bgzf_fp, index.chunk_offsets[requested_chunk], SEEK_SET);\n while (chunk_line_start <= from_line_0)\n {\n status = bgzf_getline(bgzf_fp, '\\n', line);\n chunk_line_start++;\n }\n \/\/ now, print each line until we reach the end of the requested block\n do\n {\n printf(\"%s\\n\", line->s);\n status = bgzf_getline(bgzf_fp, '\\n', line);\n chunk_line_start++;\n } while (chunk_line_start <= to_line);\n }\n return EXIT_SUCCESS;\n}\n\n\n\/*\nExtract K random lines from file using reservoir sampling\n*\/\nint random(string bgzf_file, uint64_t K)\n{\n \/\/ load index into vector of offsets\n index_info index;\n load_index(bgzf_file, index);\n\n if ((int64_t) K > index.num_lines)\n {\n cerr << \"[grabix] warning: requested more lines than in the file.\" << endl;\n exit(1);\n }\n else {\n \/\/ load the BGZF file\n BGZF *bgzf_fp = bgzf_open(bgzf_file.c_str(), \"r\");\n if (bgzf_fp == NULL)\n {\n cerr << \"[grabix] could not open file: \" << bgzf_file << endl;\n exit (1);\n }\n\n \/\/ seed our random number generator\n size_t seed = (unsigned)time(0)+(unsigned)getpid();\n srand(seed);\n\n \/\/ reservoir sample\n uint64_t N = 0;\n uint64_t result_size = 0;\n vector<string> sample;\n int status;\n kstring_t *line = new kstring_t;\n line->s = '\\0';\n line->l = 0;\n line->m = 0;\n\n while ((status = bgzf_getline(bgzf_fp, '\\n', line)) != 0)\n {\n if (line->s[0] == '#')\n printf(\"%s\\n\", line->s);\n else break;\n }\n\n while ((status = bgzf_getline(bgzf_fp, '\\n', line)) != 0)\n {\n N++;\n\n if (status < 0)\n break;\n\n if (result_size < K)\n {\n sample.push_back(line->s);\n result_size++;\n }\n else\n {\n uint64_t s = (uint64_t) ((double)rand()\/(double)RAND_MAX * N);\n if (s < K)\n sample[s] = line->s;\n }\n }\n bgzf_close(bgzf_fp);\n\n \/\/ report the sample\n for (size_t i = 0; i < sample.size(); ++i)\n printf(\"%s\\n\", sample[i].c_str());\n\n }\n return EXIT_SUCCESS;\n}\n\n\/*\nReturn the total number of records in the index.\n*\/\nint size(string bgzf_file)\n{\n index_info index;\n load_index(bgzf_file, index);\n\n return index.num_lines;\n}\n<|endoftext|>"} {"text":"<commit_before>\/*****************************************************************************\n * Project: BaBar detector at the SLAC PEP-II B-factory\n * Package: RooFitCore\n * File: $Id: RooGenContext.cc,v 1.21 2001\/10\/17 05:03:59 verkerke Exp $\n * Authors:\n * DK, David Kirkby, Stanford University, kirkby@hep.stanford.edu\n * History:\n * 16-May-2000 DK Created initial version\n *\n * Copyright (C) 2001 Stanford University\n *****************************************************************************\/\n\n\/\/ -- CLASS DESCRIPTION [AUX] --\n\/\/ A class description belongs here...\n\n\/\/ #include \"BaBar\/BaBar.hh\"\n\n#include \"RooFitCore\/RooGenContext.hh\"\n#include \"RooFitCore\/RooAbsPdf.hh\"\n#include \"RooFitCore\/RooDataSet.hh\"\n#include \"RooFitCore\/RooRealIntegral.hh\"\n#include \"RooFitCore\/RooAcceptReject.hh\"\n\n#include \"TString.h\"\n#include \"TIterator.h\"\n\nClassImp(RooGenContext)\n ;\n\nstatic const char rcsid[] =\n\"$Id: RooGenContext.cc,v 1.21 2001\/10\/17 05:03:59 verkerke Exp $\";\n\nRooGenContext::RooGenContext(const RooAbsPdf &model, const RooArgSet &vars,\n\t\t\t const RooDataSet *prototype, Bool_t verbose,\n\t\t\t const RooArgSet* forceDirect) : \n RooAbsGenContext(model,vars,prototype,verbose),\n _cloneSet(0), _pdfClone(0), _acceptRejectFunc(0), _generator(0)\n{\n \/\/ Initialize a new context for generating events with the specified\n \/\/ variables, using the specified PDF model. A prototype dataset (if provided)\n \/\/ is not cloned and still belongs to the caller. The contents and shape\n \/\/ of this dataset can be changed between calls to generate() as long as the\n \/\/ expected columns to be copied to the generated dataset are present.\n\n \/\/ Clone the model and all nodes that it depends on so that this context\n \/\/ is independent of any existing objects.\n RooArgSet nodes(model,model.GetName());\n _cloneSet= (RooArgSet*) nodes.snapshot(kTRUE);\n\n \/\/ Find the clone in the snapshot list\n _pdfClone = (RooAbsPdf*)_cloneSet->find(model.GetName());\n\n \/\/ Analyze the list of variables to generate...\n _isValid= kTRUE;\n TIterator *iterator= vars.createIterator();\n TIterator *servers= _pdfClone->serverIterator();\n const RooAbsArg *tmp(0),*arg(0);\n while(_isValid && (tmp= (const RooAbsArg*)iterator->Next())) {\n \/\/ is this argument derived?\n if(tmp->isDerived()) {\n cout << ClassName() << \"::\" << GetName() << \": cannot generate values for derived \\\"\"\n\t << tmp->GetName() << \"\\\"\" << endl;\n _isValid= kFALSE;\n continue;\n }\n \/\/ lookup this argument in the cloned set of PDF dependents\n arg= (const RooAbsArg*)_cloneSet->find(tmp->GetName());\n if(0 == arg) {\n cout << ClassName() << \"::\" << GetName() << \":WARNING: model does not depend on \\\"\"\n\t << tmp->GetName() << \"\\\" which will have uniform distribution\" << endl;\n _uniformVars.add(*tmp);\n }\n else {\n \/\/ does the model depend on this variable directly, ie, like \"x\" in\n \/\/ f(x) or f(x,g(x,y)) or even f(x,x) ?\n RooAbsArg *direct= _pdfClone->findServer(arg->GetName());\n if(direct) {\n\n\tif (forceDirect==0 || !forceDirect->find(direct->GetName())) {\n\t \/\/ is this the only way that the model depends on this variable?\n\t servers->Reset();\n\t const RooAbsArg *server(0);\n\t while(direct && (server= (const RooAbsArg*)servers->Next())) {\n\t if(server == direct) continue;\n\t if(server->dependsOn(*arg)) direct= 0;\n\t }\n\t}\n\n\tif(direct) {\n\t _directVars.add(*arg);\n\t}\n\telse {\n\t _otherVars.add(*arg);\n\t}\n }\n else {\n\t\/\/ does the model depend indirectly on this variable through an lvalue chain?\n\t\n\t\/\/ otherwise, this variable will have to be generated with accept\/reject\n\t_otherVars.add(*arg);\n }\n }\n }\n delete servers;\n delete iterator;\n if(!isValid()) {\n cout << ClassName() << \"::\" << GetName() << \": constructor failed with errors\" << endl;\n return;\n }\n\n \/\/ Can the model generate any of the direct variables itself?\n RooArgSet generatedVars;\n _code= _pdfClone->getGenerator(_directVars,generatedVars);\n\n \/\/ Move variables which cannot be generated into the list to be generated with accept\/reject\n _directVars.remove(generatedVars);\n _otherVars.add(_directVars);\n\n \/\/ Update _directVars to only include variables that will actually be directly generated\n _directVars.removeAll();\n _directVars.add(generatedVars);\n\n \/\/ initialize the accept-reject generator\n RooArgSet *depList= _pdfClone->getDependents(_theEvent);\n depList->remove(_otherVars);\n TString nname(_pdfClone->GetName()) ;\n nname.Append(\"Reduced\") ;\n TString ntitle(_pdfClone->GetTitle()) ;\n ntitle.Append(\" (Accept\/Reject)\") ;\n _acceptRejectFunc= new RooRealIntegral(nname,ntitle,*_pdfClone,*depList,&vars);\n delete depList;\n _otherVars.add(_uniformVars);\n _generator= new RooAcceptReject(*_acceptRejectFunc,_otherVars,_verbose);\n}\n\nRooGenContext::~RooGenContext() {\n \/\/ Destructor.\n\n \/\/ Clean up the cloned objects used in this context.\n delete _cloneSet;\n \/\/ Clean up our accept\/reject generator\n delete _generator;\n delete _acceptRejectFunc;\n}\n\nvoid RooGenContext::initGenerator(const RooArgSet &theEvent) {\n\n \/\/ Attach the cloned model to the event buffer we will be filling.\n _pdfClone->recursiveRedirectServers(theEvent,kFALSE);\n\n \/\/ Reset the cloned model's error counters.\n _pdfClone->resetErrorCounters();\n}\n\nvoid RooGenContext::generateEvent(RooArgSet &theEvent, Int_t remaining) {\n \/\/ Generate variables for a new event.\n\n if(_otherVars.getSize() > 0) {\n \/\/ call the accept-reject generator to generate its variables\n const RooArgSet *subEvent= _generator->generateEvent(remaining);\n if(0 == subEvent) {\n cout << ClassName() << \"::\" << GetName() << \":generate: accept\/reject generator failed.\" << endl;\n return;\n }\n theEvent= *subEvent;\n }\n\n \/\/ Use the model's optimized generator, if one is available.\n \/\/ The generator writes directly into our local 'event' since we attached it above.\n if(_directVars.getSize() > 0) {\n _pdfClone->generateEvent(_code);\n }\n}\n\nvoid RooGenContext::printToStream(ostream &os, PrintOption opt, TString indent) const\n{\n RooAbsGenContext::printToStream(os,opt,indent);\n if(opt >= Standard) {\n PrintOption less= lessVerbose(opt);\n TString deeper(indent);\n indent.Append(\" \");\n os << indent << \"Using PDF \";\n _pdfClone->printToStream(os,less,deeper);\n if(opt >= Verbose) {\n os << indent << \"Use PDF generator for \";\n _directVars.printToStream(os,less,deeper);\n os << indent << \"Use accept\/reject for \";\n _otherVars.printToStream(os,less,deeper);\n }\n }\n}\n<commit_msg><commit_after>\/*****************************************************************************\n * Project: BaBar detector at the SLAC PEP-II B-factory\n * Package: RooFitCore\n * File: $Id: RooGenContext.cc,v 1.22 2001\/10\/19 21:32:22 david Exp $\n * Authors:\n * DK, David Kirkby, Stanford University, kirkby@hep.stanford.edu\n * History:\n * 16-May-2000 DK Created initial version\n *\n * Copyright (C) 2001 Stanford University\n *****************************************************************************\/\n\n\/\/ -- CLASS DESCRIPTION [AUX] --\n\/\/ A class description belongs here...\n\n\/\/ #include \"BaBar\/BaBar.hh\"\n\n#include \"RooFitCore\/RooGenContext.hh\"\n#include \"RooFitCore\/RooAbsPdf.hh\"\n#include \"RooFitCore\/RooDataSet.hh\"\n#include \"RooFitCore\/RooRealIntegral.hh\"\n#include \"RooFitCore\/RooAcceptReject.hh\"\n\n#include \"TString.h\"\n#include \"TIterator.h\"\n\nClassImp(RooGenContext)\n ;\n\nstatic const char rcsid[] =\n\"$Id: RooGenContext.cc,v 1.22 2001\/10\/19 21:32:22 david Exp $\";\n\nRooGenContext::RooGenContext(const RooAbsPdf &model, const RooArgSet &vars,\n\t\t\t const RooDataSet *prototype, Bool_t verbose,\n\t\t\t const RooArgSet* forceDirect) : \n RooAbsGenContext(model,vars,prototype,verbose),\n _cloneSet(0), _pdfClone(0), _acceptRejectFunc(0), _generator(0)\n{\n \/\/ Initialize a new context for generating events with the specified\n \/\/ variables, using the specified PDF model. A prototype dataset (if provided)\n \/\/ is not cloned and still belongs to the caller. The contents and shape\n \/\/ of this dataset can be changed between calls to generate() as long as the\n \/\/ expected columns to be copied to the generated dataset are present.\n\n \/\/ Clone the model and all nodes that it depends on so that this context\n \/\/ is independent of any existing objects.\n RooArgSet nodes(model,model.GetName());\n _cloneSet= (RooArgSet*) nodes.snapshot(kTRUE);\n\n \/\/ Find the clone in the snapshot list\n _pdfClone = (RooAbsPdf*)_cloneSet->find(model.GetName());\n\n \/\/ Analyze the list of variables to generate...\n _isValid= kTRUE;\n TIterator *iterator= vars.createIterator();\n TIterator *servers= _pdfClone->serverIterator();\n const RooAbsArg *tmp(0),*arg(0);\n while(_isValid && (tmp= (const RooAbsArg*)iterator->Next())) {\n \/\/ is this argument derived?\n if(tmp->isDerived()) {\n cout << ClassName() << \"::\" << GetName() << \": cannot generate values for derived \\\"\"\n\t << tmp->GetName() << \"\\\"\" << endl;\n _isValid= kFALSE;\n continue;\n }\n \/\/ lookup this argument in the cloned set of PDF dependents\n arg= (const RooAbsArg*)_cloneSet->find(tmp->GetName());\n if(0 == arg) {\n cout << ClassName() << \"::\" << GetName() << \":WARNING: model does not depend on \\\"\"\n\t << tmp->GetName() << \"\\\" which will have uniform distribution\" << endl;\n _uniformVars.add(*tmp);\n }\n else {\n \/\/ does the model depend on this variable directly, ie, like \"x\" in\n \/\/ f(x) or f(x,g(x,y)) or even f(x,x) ?\n RooAbsArg *direct= _pdfClone->findServer(arg->GetName());\n if(direct) {\n\n\tif (forceDirect==0 || !forceDirect->find(direct->GetName())) {\n\t \/\/ is this the only way that the model depends on this variable?\n\t servers->Reset();\n\t const RooAbsArg *server(0);\n\t while(direct && (server= (const RooAbsArg*)servers->Next())) {\n\t if(server == direct) continue;\n\t if(server->dependsOn(*arg)) direct= 0;\n\t }\n\t}\n\n\tif(direct) {\n\t _directVars.add(*arg);\n\t}\n\telse {\n\t _otherVars.add(*arg);\n\t}\n }\n else {\n\t\/\/ does the model depend indirectly on this variable through an lvalue chain?\n\t\n\t\/\/ otherwise, this variable will have to be generated with accept\/reject\n\t_otherVars.add(*arg);\n }\n }\n }\n delete servers;\n delete iterator;\n if(!isValid()) {\n cout << ClassName() << \"::\" << GetName() << \": constructor failed with errors\" << endl;\n return;\n }\n\n \/\/ Can the model generate any of the direct variables itself?\n RooArgSet generatedVars;\n _code= _pdfClone->getGenerator(_directVars,generatedVars);\n\n \/\/ Move variables which cannot be generated into the list to be generated with accept\/reject\n _directVars.remove(generatedVars);\n _otherVars.add(_directVars);\n\n \/\/ Update _directVars to only include variables that will actually be directly generated\n _directVars.removeAll();\n _directVars.add(generatedVars);\n\n \/\/ initialize the accept-reject generator\n RooArgSet *depList= _pdfClone->getDependents(_theEvent);\n depList->remove(_otherVars);\n\n TString nname(_pdfClone->GetName()) ;\n nname.Append(\"Reduced\") ;\n TString ntitle(_pdfClone->GetTitle()) ;\n ntitle.Append(\" (Accept\/Reject)\") ;\n _acceptRejectFunc= new RooRealIntegral(nname,ntitle,*_pdfClone,*depList,&vars);\n delete depList;\n _otherVars.add(_uniformVars);\n _generator= new RooAcceptReject(*_acceptRejectFunc,_otherVars,0,_verbose);\n}\n\nRooGenContext::~RooGenContext() {\n \/\/ Destructor.\n\n \/\/ Clean up the cloned objects used in this context.\n delete _cloneSet;\n \/\/ Clean up our accept\/reject generator\n delete _generator;\n delete _acceptRejectFunc;\n}\n\nvoid RooGenContext::initGenerator(const RooArgSet &theEvent) {\n\n \/\/ Attach the cloned model to the event buffer we will be filling.\n _pdfClone->recursiveRedirectServers(theEvent,kFALSE);\n\n \/\/ Reset the cloned model's error counters.\n _pdfClone->resetErrorCounters();\n}\n\nvoid RooGenContext::generateEvent(RooArgSet &theEvent, Int_t remaining) {\n \/\/ Generate variables for a new event.\n\n if(_otherVars.getSize() > 0) {\n \/\/ call the accept-reject generator to generate its variables\n const RooArgSet *subEvent= _generator->generateEvent(remaining);\n if(0 == subEvent) {\n cout << ClassName() << \"::\" << GetName() << \":generate: accept\/reject generator failed.\" << endl;\n return;\n }\n theEvent= *subEvent;\n }\n\n \/\/ Use the model's optimized generator, if one is available.\n \/\/ The generator writes directly into our local 'event' since we attached it above.\n if(_directVars.getSize() > 0) {\n _pdfClone->generateEvent(_code);\n }\n}\n\nvoid RooGenContext::printToStream(ostream &os, PrintOption opt, TString indent) const\n{\n RooAbsGenContext::printToStream(os,opt,indent);\n if(opt >= Standard) {\n PrintOption less= lessVerbose(opt);\n TString deeper(indent);\n indent.Append(\" \");\n os << indent << \"Using PDF \";\n _pdfClone->printToStream(os,less,deeper);\n if(opt >= Verbose) {\n os << indent << \"Use PDF generator for \";\n _directVars.printToStream(os,less,deeper);\n os << indent << \"Use accept\/reject for \";\n _otherVars.printToStream(os,less,deeper);\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 <algorithm>\n#include <string>\n#include <vector>\n\n#include \"base\/bind.h\"\n#include \"base\/memory\/scoped_ptr.h\"\n#include \"base\/message_loop.h\"\n#include \"base\/stl_util.h\"\n#include \"base\/test\/test_timeouts.h\"\n#include \"base\/threading\/thread.h\"\n#include \"base\/threading\/thread_restrictions.h\"\n#include \"dbus\/bus.h\"\n#include \"dbus\/message.h\"\n#include \"dbus\/object_proxy.h\"\n#include \"dbus\/test_service.h\"\n#include \"testing\/gtest\/include\/gtest\/gtest.h\"\n\n\/\/ The end-to-end test exercises the asynchronous APIs in ObjectProxy and\n\/\/ ExportedObject.\nclass EndToEndAsyncTest : public testing::Test {\n public:\n EndToEndAsyncTest() {\n }\n\n virtual void SetUp() {\n \/\/ Make the main thread not to allow IO.\n base::ThreadRestrictions::SetIOAllowed(false);\n\n \/\/ Start the D-Bus thread.\n dbus_thread_.reset(new base::Thread(\"D-Bus Thread\"));\n base::Thread::Options thread_options;\n thread_options.message_loop_type = MessageLoop::TYPE_IO;\n ASSERT_TRUE(dbus_thread_->StartWithOptions(thread_options));\n\n \/\/ Start the test service, using the D-Bus thread.\n dbus::TestService::Options options;\n options.dbus_thread_message_loop_proxy = dbus_thread_->message_loop_proxy();\n test_service_.reset(new dbus::TestService(options));\n ASSERT_TRUE(test_service_->StartService());\n ASSERT_TRUE(test_service_->WaitUntilServiceIsStarted());\n ASSERT_TRUE(test_service_->HasDBusThread());\n\n \/\/ Create the client, using the D-Bus thread.\n dbus::Bus::Options bus_options;\n bus_options.bus_type = dbus::Bus::SESSION;\n bus_options.connection_type = dbus::Bus::PRIVATE;\n bus_options.dbus_thread_message_loop_proxy =\n dbus_thread_->message_loop_proxy();\n bus_ = new dbus::Bus(bus_options);\n object_proxy_ = bus_->GetObjectProxy(\"org.chromium.TestService\",\n \"\/org\/chromium\/TestObject\");\n ASSERT_TRUE(bus_->HasDBusThread());\n\n \/\/ Connect to the \"Test\" signal of \"org.chromium.TestInterface\" from\n \/\/ the remote object.\n object_proxy_->ConnectToSignal(\n \"org.chromium.TestInterface\",\n \"Test\",\n base::Bind(&EndToEndAsyncTest::OnTestSignal,\n base::Unretained(this)),\n base::Bind(&EndToEndAsyncTest::OnConnected,\n base::Unretained(this)));\n \/\/ Connect to the \"Test2\" signal of \"org.chromium.TestInterface\" from\n \/\/ the remote object. There was a bug where we were emitting error\n \/\/ messages like \"Requested to remove an unknown match rule: ...\" at\n \/\/ the shutdown of Bus when an object proxy is connected to more than\n \/\/ one signal of the same interface. See crosbug.com\/23382 for details.\n object_proxy_->ConnectToSignal(\n \"org.chromium.TestInterface\",\n \"Test2\",\n base::Bind(&EndToEndAsyncTest::OnTest2Signal,\n base::Unretained(this)),\n base::Bind(&EndToEndAsyncTest::OnConnected,\n base::Unretained(this)));\n \/\/ Wait until the object proxy is connected to the signal.\n message_loop_.Run();\n }\n\n virtual void TearDown() {\n bus_->ShutdownOnDBusThreadAndBlock();\n\n \/\/ Shut down the service.\n test_service_->ShutdownAndBlock();\n\n \/\/ Reset to the default.\n base::ThreadRestrictions::SetIOAllowed(true);\n\n \/\/ Stopping a thread is considered an IO operation, so do this after\n \/\/ allowing IO.\n test_service_->Stop();\n }\n\n protected:\n \/\/ Calls the method asynchronously. OnResponse() will be called once the\n \/\/ response is received.\n void CallMethod(dbus::MethodCall* method_call,\n int timeout_ms) {\n object_proxy_->CallMethod(method_call,\n timeout_ms,\n base::Bind(&EndToEndAsyncTest::OnResponse,\n base::Unretained(this)));\n }\n\n \/\/ Wait for the give number of responses.\n void WaitForResponses(size_t num_responses) {\n while (response_strings_.size() < num_responses) {\n message_loop_.Run();\n }\n }\n\n \/\/ Called when the response is received.\n void OnResponse(dbus::Response* response) {\n \/\/ |response| will be deleted on exit of the function. Copy the\n \/\/ payload to |response_strings_|.\n if (response) {\n dbus::MessageReader reader(response);\n std::string response_string;\n ASSERT_TRUE(reader.PopString(&response_string));\n response_strings_.push_back(response_string);\n } else {\n response_strings_.push_back(\"\");\n }\n message_loop_.Quit();\n };\n\n \/\/ Called when the \"Test\" signal is received, in the main thread.\n \/\/ Copy the string payload to |test_signal_string_|.\n void OnTestSignal(dbus::Signal* signal) {\n dbus::MessageReader reader(signal);\n ASSERT_TRUE(reader.PopString(&test_signal_string_));\n message_loop_.Quit();\n }\n\n \/\/ Called when the \"Test2\" signal is received, in the main thread.\n void OnTest2Signal(dbus::Signal* signal) {\n dbus::MessageReader reader(signal);\n message_loop_.Quit();\n }\n\n \/\/ Called when connected to the signal.\n void OnConnected(const std::string& interface_name,\n const std::string& signal_name,\n bool success) {\n ASSERT_TRUE(success);\n message_loop_.Quit();\n }\n\n \/\/ Wait for the hey signal to be received.\n void WaitForTestSignal() {\n \/\/ OnTestSignal() will quit the message loop.\n message_loop_.Run();\n }\n\n MessageLoop message_loop_;\n std::vector<std::string> response_strings_;\n scoped_ptr<base::Thread> dbus_thread_;\n scoped_refptr<dbus::Bus> bus_;\n dbus::ObjectProxy* object_proxy_;\n scoped_ptr<dbus::TestService> test_service_;\n \/\/ Text message from \"Test\" signal.\n std::string test_signal_string_;\n};\n\nTEST_F(EndToEndAsyncTest, Echo) {\n const char* kHello = \"hello\";\n\n \/\/ Create the method call.\n dbus::MethodCall method_call(\"org.chromium.TestInterface\", \"Echo\");\n dbus::MessageWriter writer(&method_call);\n writer.AppendString(kHello);\n\n \/\/ Call the method.\n const int timeout_ms = dbus::ObjectProxy::TIMEOUT_USE_DEFAULT;\n CallMethod(&method_call, timeout_ms);\n\n \/\/ Check the response.\n WaitForResponses(1);\n EXPECT_EQ(kHello, response_strings_[0]);\n}\n\n\/\/ Call Echo method three times.\nTEST_F(EndToEndAsyncTest, EchoThreeTimes) {\n const char* kMessages[] = { \"foo\", \"bar\", \"baz\" };\n\n for (size_t i = 0; i < arraysize(kMessages); ++i) {\n \/\/ Create the method call.\n dbus::MethodCall method_call(\"org.chromium.TestInterface\", \"Echo\");\n dbus::MessageWriter writer(&method_call);\n writer.AppendString(kMessages[i]);\n\n \/\/ Call the method.\n const int timeout_ms = dbus::ObjectProxy::TIMEOUT_USE_DEFAULT;\n CallMethod(&method_call, timeout_ms);\n }\n\n \/\/ Check the responses.\n WaitForResponses(3);\n \/\/ Sort as the order of the returned messages is not deterministic.\n std::sort(response_strings_.begin(), response_strings_.end());\n EXPECT_EQ(\"bar\", response_strings_[0]);\n EXPECT_EQ(\"baz\", response_strings_[1]);\n EXPECT_EQ(\"foo\", response_strings_[2]);\n}\n\nTEST_F(EndToEndAsyncTest, Timeout) {\n const char* kHello = \"hello\";\n\n \/\/ Create the method call.\n dbus::MethodCall method_call(\"org.chromium.TestInterface\", \"SlowEcho\");\n dbus::MessageWriter writer(&method_call);\n writer.AppendString(kHello);\n\n \/\/ Call the method with timeout of 0ms.\n const int timeout_ms = 0;\n CallMethod(&method_call, timeout_ms);\n WaitForResponses(1);\n\n \/\/ Should fail because of timeout.\n ASSERT_EQ(\"\", response_strings_[0]);\n}\n\n\/\/ Tests calling a method that sends its reply asynchronously.\nTEST_F(EndToEndAsyncTest, AsyncEcho) {\n const char* kHello = \"hello\";\n\n \/\/ Create the method call.\n dbus::MethodCall method_call(\"org.chromium.TestInterface\", \"AsyncEcho\");\n dbus::MessageWriter writer(&method_call);\n writer.AppendString(kHello);\n\n \/\/ Call the method.\n const int timeout_ms = dbus::ObjectProxy::TIMEOUT_USE_DEFAULT;\n CallMethod(&method_call, timeout_ms);\n\n \/\/ Check the response.\n WaitForResponses(1);\n EXPECT_EQ(kHello, response_strings_[0]);\n}\n\nTEST_F(EndToEndAsyncTest, NonexistentMethod) {\n dbus::MethodCall method_call(\"org.chromium.TestInterface\", \"Nonexistent\");\n\n const int timeout_ms = dbus::ObjectProxy::TIMEOUT_USE_DEFAULT;\n CallMethod(&method_call, timeout_ms);\n WaitForResponses(1);\n\n \/\/ Should fail because the method is nonexistent.\n ASSERT_EQ(\"\", response_strings_[0]);\n}\n\nTEST_F(EndToEndAsyncTest, BrokenMethod) {\n dbus::MethodCall method_call(\"org.chromium.TestInterface\", \"BrokenMethod\");\n\n const int timeout_ms = dbus::ObjectProxy::TIMEOUT_USE_DEFAULT;\n CallMethod(&method_call, timeout_ms);\n WaitForResponses(1);\n\n \/\/ Should fail because the method is broken.\n ASSERT_EQ(\"\", response_strings_[0]);\n}\n\nTEST_F(EndToEndAsyncTest, EmptyResponseCallback) {\n const char* kHello = \"hello\";\n\n \/\/ Create the method call.\n dbus::MethodCall method_call(\"org.chromium.TestInterface\", \"Echo\");\n dbus::MessageWriter writer(&method_call);\n writer.AppendString(kHello);\n\n \/\/ Call the method with an empty callback.\n const int timeout_ms = dbus::ObjectProxy::TIMEOUT_USE_DEFAULT;\n object_proxy_->CallMethod(&method_call,\n timeout_ms,\n dbus::ObjectProxy::EmptyResponseCallback());\n \/\/ Post a delayed task to quit the message loop.\n message_loop_.PostDelayedTask(FROM_HERE,\n MessageLoop::QuitClosure(),\n TestTimeouts::tiny_timeout_ms());\n message_loop_.Run();\n \/\/ We cannot tell if the empty callback is called, but at least we can\n \/\/ check if the test does not crash.\n}\n\n\/\/ Flaky, http:\/\/crbug.com\/107301\nTEST_F(EndToEndAsyncTest, FLAKY_TestSignal) {\n const char kMessage[] = \"hello, world\";\n \/\/ Send the test signal from the exported object.\n test_service_->SendTestSignal(kMessage);\n \/\/ Receive the signal with the object proxy. The signal is handled in\n \/\/ EndToEndAsyncTest::OnTestSignal() in the main thread.\n WaitForTestSignal();\n ASSERT_EQ(kMessage, test_signal_string_);\n}\n\n\/\/ Flaky, http:\/\/crbug.com\/106796\nTEST_F(EndToEndAsyncTest, FLAKY_TestSignalFromRoot) {\n const char kMessage[] = \"hello, world\";\n \/\/ Send the test signal from the root object path, to see if we can\n \/\/ handle signals sent from \"\/\", like dbus-send does.\n test_service_->SendTestSignalFromRoot(kMessage);\n \/\/ Receive the signal with the object proxy. The signal is handled in\n \/\/ EndToEndAsyncTest::OnTestSignal() in the main thread.\n WaitForTestSignal();\n ASSERT_EQ(kMessage, test_signal_string_);\n}\n<commit_msg>Fix flaky tests in EndToEndAsyncTest in dbus_unittests.<commit_after>\/\/ Copyright (c) 2011 The Chromium Authors. All rights reserved.\n\/\/ Use of this source code is governed by a BSD-style license that can be\n\/\/ found in the LICENSE file.\n\n#include <algorithm>\n#include <string>\n#include <vector>\n\n#include \"base\/bind.h\"\n#include \"base\/memory\/scoped_ptr.h\"\n#include \"base\/message_loop.h\"\n#include \"base\/stl_util.h\"\n#include \"base\/test\/test_timeouts.h\"\n#include \"base\/threading\/thread.h\"\n#include \"base\/threading\/thread_restrictions.h\"\n#include \"dbus\/bus.h\"\n#include \"dbus\/message.h\"\n#include \"dbus\/object_proxy.h\"\n#include \"dbus\/test_service.h\"\n#include \"testing\/gtest\/include\/gtest\/gtest.h\"\n\n\/\/ The end-to-end test exercises the asynchronous APIs in ObjectProxy and\n\/\/ ExportedObject.\nclass EndToEndAsyncTest : public testing::Test {\n public:\n EndToEndAsyncTest() {\n }\n\n virtual void SetUp() {\n \/\/ Make the main thread not to allow IO.\n base::ThreadRestrictions::SetIOAllowed(false);\n\n \/\/ Start the D-Bus thread.\n dbus_thread_.reset(new base::Thread(\"D-Bus Thread\"));\n base::Thread::Options thread_options;\n thread_options.message_loop_type = MessageLoop::TYPE_IO;\n ASSERT_TRUE(dbus_thread_->StartWithOptions(thread_options));\n\n \/\/ Start the test service, using the D-Bus thread.\n dbus::TestService::Options options;\n options.dbus_thread_message_loop_proxy = dbus_thread_->message_loop_proxy();\n test_service_.reset(new dbus::TestService(options));\n ASSERT_TRUE(test_service_->StartService());\n ASSERT_TRUE(test_service_->WaitUntilServiceIsStarted());\n ASSERT_TRUE(test_service_->HasDBusThread());\n\n \/\/ Create the client, using the D-Bus thread.\n dbus::Bus::Options bus_options;\n bus_options.bus_type = dbus::Bus::SESSION;\n bus_options.connection_type = dbus::Bus::PRIVATE;\n bus_options.dbus_thread_message_loop_proxy =\n dbus_thread_->message_loop_proxy();\n bus_ = new dbus::Bus(bus_options);\n object_proxy_ = bus_->GetObjectProxy(\"org.chromium.TestService\",\n \"\/org\/chromium\/TestObject\");\n ASSERT_TRUE(bus_->HasDBusThread());\n\n \/\/ Connect to the \"Test\" signal of \"org.chromium.TestInterface\" from\n \/\/ the remote object.\n object_proxy_->ConnectToSignal(\n \"org.chromium.TestInterface\",\n \"Test\",\n base::Bind(&EndToEndAsyncTest::OnTestSignal,\n base::Unretained(this)),\n base::Bind(&EndToEndAsyncTest::OnConnected,\n base::Unretained(this)));\n \/\/ Wait until the object proxy is connected to the signal.\n message_loop_.Run();\n\n \/\/ Connect to the \"Test2\" signal of \"org.chromium.TestInterface\" from\n \/\/ the remote object. There was a bug where we were emitting error\n \/\/ messages like \"Requested to remove an unknown match rule: ...\" at\n \/\/ the shutdown of Bus when an object proxy is connected to more than\n \/\/ one signal of the same interface. See crosbug.com\/23382 for details.\n object_proxy_->ConnectToSignal(\n \"org.chromium.TestInterface\",\n \"Test2\",\n base::Bind(&EndToEndAsyncTest::OnTest2Signal,\n base::Unretained(this)),\n base::Bind(&EndToEndAsyncTest::OnConnected,\n base::Unretained(this)));\n \/\/ Wait until the object proxy is connected to the signal.\n message_loop_.Run();\n }\n\n virtual void TearDown() {\n bus_->ShutdownOnDBusThreadAndBlock();\n\n \/\/ Shut down the service.\n test_service_->ShutdownAndBlock();\n\n \/\/ Reset to the default.\n base::ThreadRestrictions::SetIOAllowed(true);\n\n \/\/ Stopping a thread is considered an IO operation, so do this after\n \/\/ allowing IO.\n test_service_->Stop();\n }\n\n protected:\n \/\/ Calls the method asynchronously. OnResponse() will be called once the\n \/\/ response is received.\n void CallMethod(dbus::MethodCall* method_call,\n int timeout_ms) {\n object_proxy_->CallMethod(method_call,\n timeout_ms,\n base::Bind(&EndToEndAsyncTest::OnResponse,\n base::Unretained(this)));\n }\n\n \/\/ Wait for the give number of responses.\n void WaitForResponses(size_t num_responses) {\n while (response_strings_.size() < num_responses) {\n message_loop_.Run();\n }\n }\n\n \/\/ Called when the response is received.\n void OnResponse(dbus::Response* response) {\n \/\/ |response| will be deleted on exit of the function. Copy the\n \/\/ payload to |response_strings_|.\n if (response) {\n dbus::MessageReader reader(response);\n std::string response_string;\n ASSERT_TRUE(reader.PopString(&response_string));\n response_strings_.push_back(response_string);\n } else {\n response_strings_.push_back(\"\");\n }\n message_loop_.Quit();\n };\n\n \/\/ Called when the \"Test\" signal is received, in the main thread.\n \/\/ Copy the string payload to |test_signal_string_|.\n void OnTestSignal(dbus::Signal* signal) {\n dbus::MessageReader reader(signal);\n ASSERT_TRUE(reader.PopString(&test_signal_string_));\n message_loop_.Quit();\n }\n\n \/\/ Called when the \"Test2\" signal is received, in the main thread.\n void OnTest2Signal(dbus::Signal* signal) {\n dbus::MessageReader reader(signal);\n message_loop_.Quit();\n }\n\n \/\/ Called when connected to the signal.\n void OnConnected(const std::string& interface_name,\n const std::string& signal_name,\n bool success) {\n ASSERT_TRUE(success);\n message_loop_.Quit();\n }\n\n \/\/ Wait for the hey signal to be received.\n void WaitForTestSignal() {\n \/\/ OnTestSignal() will quit the message loop.\n message_loop_.Run();\n }\n\n MessageLoop message_loop_;\n std::vector<std::string> response_strings_;\n scoped_ptr<base::Thread> dbus_thread_;\n scoped_refptr<dbus::Bus> bus_;\n dbus::ObjectProxy* object_proxy_;\n scoped_ptr<dbus::TestService> test_service_;\n \/\/ Text message from \"Test\" signal.\n std::string test_signal_string_;\n};\n\nTEST_F(EndToEndAsyncTest, Echo) {\n const char* kHello = \"hello\";\n\n \/\/ Create the method call.\n dbus::MethodCall method_call(\"org.chromium.TestInterface\", \"Echo\");\n dbus::MessageWriter writer(&method_call);\n writer.AppendString(kHello);\n\n \/\/ Call the method.\n const int timeout_ms = dbus::ObjectProxy::TIMEOUT_USE_DEFAULT;\n CallMethod(&method_call, timeout_ms);\n\n \/\/ Check the response.\n WaitForResponses(1);\n EXPECT_EQ(kHello, response_strings_[0]);\n}\n\n\/\/ Call Echo method three times.\nTEST_F(EndToEndAsyncTest, EchoThreeTimes) {\n const char* kMessages[] = { \"foo\", \"bar\", \"baz\" };\n\n for (size_t i = 0; i < arraysize(kMessages); ++i) {\n \/\/ Create the method call.\n dbus::MethodCall method_call(\"org.chromium.TestInterface\", \"Echo\");\n dbus::MessageWriter writer(&method_call);\n writer.AppendString(kMessages[i]);\n\n \/\/ Call the method.\n const int timeout_ms = dbus::ObjectProxy::TIMEOUT_USE_DEFAULT;\n CallMethod(&method_call, timeout_ms);\n }\n\n \/\/ Check the responses.\n WaitForResponses(3);\n \/\/ Sort as the order of the returned messages is not deterministic.\n std::sort(response_strings_.begin(), response_strings_.end());\n EXPECT_EQ(\"bar\", response_strings_[0]);\n EXPECT_EQ(\"baz\", response_strings_[1]);\n EXPECT_EQ(\"foo\", response_strings_[2]);\n}\n\nTEST_F(EndToEndAsyncTest, Timeout) {\n const char* kHello = \"hello\";\n\n \/\/ Create the method call.\n dbus::MethodCall method_call(\"org.chromium.TestInterface\", \"SlowEcho\");\n dbus::MessageWriter writer(&method_call);\n writer.AppendString(kHello);\n\n \/\/ Call the method with timeout of 0ms.\n const int timeout_ms = 0;\n CallMethod(&method_call, timeout_ms);\n WaitForResponses(1);\n\n \/\/ Should fail because of timeout.\n ASSERT_EQ(\"\", response_strings_[0]);\n}\n\n\/\/ Tests calling a method that sends its reply asynchronously.\nTEST_F(EndToEndAsyncTest, AsyncEcho) {\n const char* kHello = \"hello\";\n\n \/\/ Create the method call.\n dbus::MethodCall method_call(\"org.chromium.TestInterface\", \"AsyncEcho\");\n dbus::MessageWriter writer(&method_call);\n writer.AppendString(kHello);\n\n \/\/ Call the method.\n const int timeout_ms = dbus::ObjectProxy::TIMEOUT_USE_DEFAULT;\n CallMethod(&method_call, timeout_ms);\n\n \/\/ Check the response.\n WaitForResponses(1);\n EXPECT_EQ(kHello, response_strings_[0]);\n}\n\nTEST_F(EndToEndAsyncTest, NonexistentMethod) {\n dbus::MethodCall method_call(\"org.chromium.TestInterface\", \"Nonexistent\");\n\n const int timeout_ms = dbus::ObjectProxy::TIMEOUT_USE_DEFAULT;\n CallMethod(&method_call, timeout_ms);\n WaitForResponses(1);\n\n \/\/ Should fail because the method is nonexistent.\n ASSERT_EQ(\"\", response_strings_[0]);\n}\n\nTEST_F(EndToEndAsyncTest, BrokenMethod) {\n dbus::MethodCall method_call(\"org.chromium.TestInterface\", \"BrokenMethod\");\n\n const int timeout_ms = dbus::ObjectProxy::TIMEOUT_USE_DEFAULT;\n CallMethod(&method_call, timeout_ms);\n WaitForResponses(1);\n\n \/\/ Should fail because the method is broken.\n ASSERT_EQ(\"\", response_strings_[0]);\n}\n\nTEST_F(EndToEndAsyncTest, EmptyResponseCallback) {\n const char* kHello = \"hello\";\n\n \/\/ Create the method call.\n dbus::MethodCall method_call(\"org.chromium.TestInterface\", \"Echo\");\n dbus::MessageWriter writer(&method_call);\n writer.AppendString(kHello);\n\n \/\/ Call the method with an empty callback.\n const int timeout_ms = dbus::ObjectProxy::TIMEOUT_USE_DEFAULT;\n object_proxy_->CallMethod(&method_call,\n timeout_ms,\n dbus::ObjectProxy::EmptyResponseCallback());\n \/\/ Post a delayed task to quit the message loop.\n message_loop_.PostDelayedTask(FROM_HERE,\n MessageLoop::QuitClosure(),\n TestTimeouts::tiny_timeout_ms());\n message_loop_.Run();\n \/\/ We cannot tell if the empty callback is called, but at least we can\n \/\/ check if the test does not crash.\n}\n\nTEST_F(EndToEndAsyncTest, TestSignal) {\n const char kMessage[] = \"hello, world\";\n \/\/ Send the test signal from the exported object.\n test_service_->SendTestSignal(kMessage);\n \/\/ Receive the signal with the object proxy. The signal is handled in\n \/\/ EndToEndAsyncTest::OnTestSignal() in the main thread.\n WaitForTestSignal();\n ASSERT_EQ(kMessage, test_signal_string_);\n}\n\nTEST_F(EndToEndAsyncTest, TestSignalFromRoot) {\n const char kMessage[] = \"hello, world\";\n \/\/ Send the test signal from the root object path, to see if we can\n \/\/ handle signals sent from \"\/\", like dbus-send does.\n test_service_->SendTestSignalFromRoot(kMessage);\n \/\/ Receive the signal with the object proxy. The signal is handled in\n \/\/ EndToEndAsyncTest::OnTestSignal() in the main thread.\n WaitForTestSignal();\n ASSERT_EQ(kMessage, test_signal_string_);\n}\n<|endoftext|>"} {"text":"<commit_before>\/*=========================================================================\n\n Program: Visualization Toolkit\n Module: TestISIReader.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 \"vtkISIReader.h\"\n#include \"vtkSmartPointer.h\"\n#include \"vtkStdString.h\"\n#include \"vtkTable.h\"\n#include \"vtkTestUtilities.h\"\n#include \"vtkVariant.h\"\n\ntemplate<typename value_t>\nvoid TestValue(const value_t& Value, const value_t& ExpectedValue, const vtkStdString& ValueDescription, int& ErrorCount)\n{\n if(Value == ExpectedValue)\n return;\n\n cerr << ValueDescription << \" is [\" << Value << \"] - expected [\" << ExpectedValue << \"]\" << endl;\n\n ++ErrorCount;\n}\n\nint TestISIReader(int argc, char* argv[])\n{\n char* file = vtkTestUtilities::ExpandDataFileName(argc, argv, \"Data\/Infovis\/eg2.isi\");\n\n cerr << \"file: \" << file << endl;\n\n vtkSmartPointer<vtkISIReader> reader = vtkSmartPointer<vtkISIReader>::New();\n reader->SetFileName(file);\n\n reader->Update(); \n vtkTable* const table = reader->GetOutput();\n\n int error_count = 0; \n\n \/\/ Test the size of the output table ...\n TestValue(table->GetNumberOfColumns(), vtkIdType(37), \"Column count\", error_count);\n TestValue(table->GetNumberOfRows(), vtkIdType(501), \"Row count\", error_count);\n \n \/\/ Test a sampling of the table columns ...\n TestValue(vtkStdString(table->GetColumnName(0)), vtkStdString(\"PT\"), \"Column 0\", error_count);\n TestValue(vtkStdString(table->GetColumnName(1)), vtkStdString(\"AU\"), \"Column 1\", error_count);\n TestValue(vtkStdString(table->GetColumnName(2)), vtkStdString(\"TI\"), \"Column 2\", error_count);\n TestValue(vtkStdString(table->GetColumnName(20)), vtkStdString(\"PD\"), \"Column 20\", error_count);\n TestValue(vtkStdString(table->GetColumnName(21)), vtkStdString(\"PY\"), \"Column 21\", error_count);\n TestValue(vtkStdString(table->GetColumnName(22)), vtkStdString(\"VL\"), \"Column 22\", error_count);\n TestValue(vtkStdString(table->GetColumnName(34)), vtkStdString(\"DE\"), \"Column 34\", error_count);\n TestValue(vtkStdString(table->GetColumnName(35)), vtkStdString(\"SI\"), \"Column 35\", error_count);\n TestValue(vtkStdString(table->GetColumnName(36)), vtkStdString(\"PN\"), \"Column 36\", error_count);\n\n \/\/ Test a sampling of the table values ...\n TestValue(table->GetValue(0, 0).ToString(), vtkStdString(\"J\"), \"Value 0, 0\", error_count);\n TestValue(table->GetValue(0, 1).ToString(), vtkStdString(\"Arantes, GM;Chaimovich, H\"), \"Value 0, 1\", error_count);\n TestValue(table->GetValue(0, 2).ToString(), vtkStdString(\"Thiolysis and alcoholysis of phosphate tri- and monoesters with alkyl;and aryl leaving groups. An ab initio study in the gas phase\"), \"Value 0, 2\", error_count);\n\n TestValue(table->GetValue(499, 20).ToString(), vtkStdString(\"JAN 30\"), \"value 499, 20\", error_count);\n TestValue(table->GetValue(499, 21).ToString(), vtkStdString(\"1996\"), \"value 499, 21\", error_count);\n TestValue(table->GetValue(499, 22).ToString(), vtkStdString(\"17\"), \"value 499, 22\", error_count);\n \n return error_count;\n}\n<commit_msg>BUG:Fixed memory leak<commit_after>\/*=========================================================================\n\n Program: Visualization Toolkit\n Module: TestISIReader.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 \"vtkISIReader.h\"\n#include \"vtkSmartPointer.h\"\n#include \"vtkStdString.h\"\n#include \"vtkTable.h\"\n#include \"vtkTestUtilities.h\"\n#include \"vtkVariant.h\"\n\ntemplate<typename value_t>\nvoid TestValue(const value_t& Value, const value_t& ExpectedValue, const vtkStdString& ValueDescription, int& ErrorCount)\n{\n if(Value == ExpectedValue)\n return;\n\n cerr << ValueDescription << \" is [\" << Value << \"] - expected [\" << ExpectedValue << \"]\" << endl;\n\n ++ErrorCount;\n}\n\nint TestISIReader(int argc, char* argv[])\n{\n char* file = vtkTestUtilities::ExpandDataFileName(argc, argv, \"Data\/Infovis\/eg2.isi\");\n\n cerr << \"file: \" << file << endl;\n\n vtkSmartPointer<vtkISIReader> reader = vtkSmartPointer<vtkISIReader>::New();\n reader->SetFileName(file);\n delete[] file;\n reader->Update(); \n vtkTable* const table = reader->GetOutput();\n\n int error_count = 0; \n\n \/\/ Test the size of the output table ...\n TestValue(table->GetNumberOfColumns(), vtkIdType(37), \"Column count\", error_count);\n TestValue(table->GetNumberOfRows(), vtkIdType(501), \"Row count\", error_count);\n \n \/\/ Test a sampling of the table columns ...\n TestValue(vtkStdString(table->GetColumnName(0)), vtkStdString(\"PT\"), \"Column 0\", error_count);\n TestValue(vtkStdString(table->GetColumnName(1)), vtkStdString(\"AU\"), \"Column 1\", error_count);\n TestValue(vtkStdString(table->GetColumnName(2)), vtkStdString(\"TI\"), \"Column 2\", error_count);\n TestValue(vtkStdString(table->GetColumnName(20)), vtkStdString(\"PD\"), \"Column 20\", error_count);\n TestValue(vtkStdString(table->GetColumnName(21)), vtkStdString(\"PY\"), \"Column 21\", error_count);\n TestValue(vtkStdString(table->GetColumnName(22)), vtkStdString(\"VL\"), \"Column 22\", error_count);\n TestValue(vtkStdString(table->GetColumnName(34)), vtkStdString(\"DE\"), \"Column 34\", error_count);\n TestValue(vtkStdString(table->GetColumnName(35)), vtkStdString(\"SI\"), \"Column 35\", error_count);\n TestValue(vtkStdString(table->GetColumnName(36)), vtkStdString(\"PN\"), \"Column 36\", error_count);\n\n \/\/ Test a sampling of the table values ...\n TestValue(table->GetValue(0, 0).ToString(), vtkStdString(\"J\"), \"Value 0, 0\", error_count);\n TestValue(table->GetValue(0, 1).ToString(), vtkStdString(\"Arantes, GM;Chaimovich, H\"), \"Value 0, 1\", error_count);\n TestValue(table->GetValue(0, 2).ToString(), vtkStdString(\"Thiolysis and alcoholysis of phosphate tri- and monoesters with alkyl;and aryl leaving groups. An ab initio study in the gas phase\"), \"Value 0, 2\", error_count);\n\n TestValue(table->GetValue(499, 20).ToString(), vtkStdString(\"JAN 30\"), \"value 499, 20\", error_count);\n TestValue(table->GetValue(499, 21).ToString(), vtkStdString(\"1996\"), \"value 499, 21\", error_count);\n TestValue(table->GetValue(499, 22).ToString(), vtkStdString(\"17\"), \"value 499, 22\", error_count);\n \n return error_count;\n}\n<|endoftext|>"} {"text":"<commit_before>#include \"client.h\"\n#include \"settings.h\"\n#include \"trafficbudgetmanager.h\"\n#include \"network\/networkmanager.h\"\n#include \"log\/logger.h\"\n\n#include <QReadLocker>\n#include <QWriteLocker>\n#include <QTimer>\n\nLOGGER(TrafficBudgetManager);\n\n\nclass TrafficBudgetManager::Private : public QObject\n{\n Q_OBJECT\n\npublic:\n Private(TrafficBudgetManager *q)\n : q(q)\n {\n connect(&timer, SIGNAL(timeout()), this, SLOT(timeout()));\n timer.setSingleShot(true);\n }\n\n TrafficBudgetManager *q;\n quint32 availableTraffic;\n quint32 usedTraffic;\n quint32 availableMobileTraffic;\n quint32 usedMobileTraffic;\n QReadWriteLock lock;\n bool active;\n QTimer timer;\n\n void startResetTimer();\n\npublic slots:\n void timeout();\n};\n\nvoid TrafficBudgetManager::Private::startResetTimer()\n{\n QDate today = QDateTime::currentDateTime().date();\n QDateTime nextRun;\n nextRun.setTime(QTime(0,1,0));\n\n \/\/ take december into account\n if (today.month() == 12)\n {\n nextRun.setDate(QDate(today.year()+1, 1, 1));\n }\n else\n {\n nextRun.setDate(QDate(today.year(), today.month() + 1, 1));\n }\n\n timer.start(QDateTime::currentDateTime().msecsTo(nextRun));\n}\n\nvoid TrafficBudgetManager::Private::timeout()\n{\n if (active)\n {\n LOG_INFO(\"Reset traffic budget for new month\");\n LOG_INFO(QString(\"Traffic: Used %1 of %2 MB\").arg(usedTraffic\/(1024*1024)).arg(availableTraffic\/(1024*1024)));\n LOG_INFO(QString(\"Traffic (mobile): Used %1 of %2 MB\").arg(usedMobileTraffic\/(1024*1024)).arg(availableMobileTraffic\/(1024*1024)));\n }\n\n q->reset();\n\n startResetTimer();\n}\n\nTrafficBudgetManager::TrafficBudgetManager(QObject *parent)\n: QObject(parent)\n, d(new Private(this))\n{\n}\n\nTrafficBudgetManager::~TrafficBudgetManager()\n{\n delete d;\n}\n\nvoid TrafficBudgetManager::init()\n{\n d->availableMobileTraffic = Client::instance()->settings()->availableMobileTraffic();\n d->availableTraffic = Client::instance()->settings()->availableTraffic();\n d->usedMobileTraffic = Client::instance()->settings()->usedMobileTraffic();\n d->usedTraffic = Client::instance()->settings()->usedTraffic();\n d->active = Client::instance()->settings()->trafficBudgetManagerActive();\n\n LOG_INFO(QString(\"Traffic budget manager is %1\").arg(d->active ? \"enabled\" : \"disabled\"));\n\n if (d->active)\n {\n LOG_INFO(QString(\"Traffic: Used %1 of %2 MB\").arg(d->usedTraffic\/(1024*1024)).arg(d->availableTraffic\/(1024*1024)));\n LOG_INFO(QString(\"Traffic (mobile): Used %1 of %2 MB\").arg(d->usedMobileTraffic\/(1024*1024)).arg(d->availableMobileTraffic\/(1024*1024)));\n }\n}\n\nvoid TrafficBudgetManager::saveTraffic()\n{\n if (Client::instance()->networkManager()->onMobileConnection())\n {\n Client::instance()->settings()->setAvailableMobileTraffic(d->availableMobileTraffic);\n Client::instance()->settings()->setUsedMobileTraffic(d->usedMobileTraffic);\n }\n else\n {\n Client::instance()->settings()->setAvailableTraffic(d->availableTraffic);\n Client::instance()->settings()->setUsedTraffic(d->usedTraffic);\n }\n}\n\nquint32 TrafficBudgetManager::availableTraffic() const\n{\n QReadLocker locker(&d->lock);\n\n return Client::instance()->networkManager()->onMobileConnection() ? d->availableMobileTraffic :\n d->availableTraffic;\n}\n\nbool TrafficBudgetManager::addUsedTraffic(quint32 traffic)\n{\n QWriteLocker locker(&d->lock);\n\n if (Client::instance()->networkManager()->onMobileConnection())\n {\n if (d->availableMobileTraffic >= traffic)\n {\n d->usedMobileTraffic += traffic;\n saveTraffic();\n return true;\n }\n }\n else\n {\n if (d->availableTraffic >= traffic)\n {\n d->usedTraffic += traffic;\n saveTraffic();\n return true;\n }\n }\n\n \/\/ start timer to reset the used traffic on the first of each month\n d->startResetTimer();\n\n return !d->active;\n}\n\nquint32 TrafficBudgetManager::usedTraffic() const\n{\n QReadLocker locker(&d->lock);\n\n return Client::instance()->networkManager()->onMobileConnection() ? d->usedMobileTraffic : d->usedTraffic;\n}\n\nvoid TrafficBudgetManager::reset()\n{\n d->usedMobileTraffic = 0;\n d->usedTraffic = 0;\n}\n\n#include \"trafficbudgetmanager.moc\"\n<commit_msg>Use own Timer and CalendarTiming for TBM<commit_after>#include \"client.h\"\n#include \"settings.h\"\n#include \"trafficbudgetmanager.h\"\n#include \"network\/networkmanager.h\"\n#include \"log\/logger.h\"\n#include \"timing\/calendartiming.h\"\n#include \"timing\/timer.h\"\n\n#include <QReadLocker>\n#include <QWriteLocker>\n\nLOGGER(TrafficBudgetManager);\n\n\nclass TrafficBudgetManager::Private : public QObject\n{\n Q_OBJECT\n\npublic:\n Private(TrafficBudgetManager *q)\n : q(q)\n , resetTiming(new CalendarTiming(QDateTime(), QDateTime(), CalendarTiming::AllMonths, CalendarTiming::AllDaysOfWeek, QList<int>()<<1, QList<int>()<<0, QList<int>()<<1, QList<int>()<<0))\n , timer(resetTiming)\n {\n connect(&timer, SIGNAL(timeout()), this, SLOT(timeout()));\n }\n\n TrafficBudgetManager *q;\n Settings *settings;\n quint32 availableTraffic;\n quint32 usedTraffic;\n quint32 availableMobileTraffic;\n quint32 usedMobileTraffic;\n QReadWriteLock lock;\n bool active;\n QSharedPointer<CalendarTiming> resetTiming;\n Timer timer;\n\npublic slots:\n void timeout();\n};\n\nvoid TrafficBudgetManager::Private::timeout()\n{\n if (active)\n {\n LOG_INFO(\"Reset traffic budget for new month\");\n LOG_INFO(QString(\"Traffic: Used %1 of %2 MB\").arg(usedTraffic\/(1024*1024)).arg(availableTraffic\/(1024*1024)));\n LOG_INFO(QString(\"Traffic (mobile): Used %1 of %2 MB\").arg(usedMobileTraffic\/(1024*1024)).arg(availableMobileTraffic\/(1024*1024)));\n }\n\n q->reset();\n}\n\nTrafficBudgetManager::TrafficBudgetManager(QObject *parent)\n: QObject(parent)\n, d(new Private(this))\n{\n}\n\nTrafficBudgetManager::~TrafficBudgetManager()\n{\n delete d;\n}\n\nvoid TrafficBudgetManager::init()\n{\n d->settings = Client::instance()->settings();\n d->availableMobileTraffic = d->settings->availableMobileTraffic();\n d->availableTraffic = d->settings->availableTraffic();\n d->usedMobileTraffic = d->settings->usedMobileTraffic();\n d->usedTraffic = d->settings->usedTraffic();\n d->active = d->settings->trafficBudgetManagerActive();\n\n LOG_INFO(QString(\"Traffic budget manager is %1\").arg(d->active ? \"enabled\" : \"disabled\"));\n\n if (d->active)\n {\n LOG_INFO(QString(\"Traffic: Used %1 of %2 MB\").arg(d->usedTraffic\/(1024*1024)).arg(d->availableTraffic\/(1024*1024)));\n LOG_INFO(QString(\"Traffic (mobile): Used %1 of %2 MB\").arg(d->usedMobileTraffic\/(1024*1024)).arg(d->availableMobileTraffic\/(1024*1024)));\n }\n\n d->timer.start();\n}\n\nvoid TrafficBudgetManager::saveTraffic()\n{\n if (Client::instance()->networkManager()->onMobileConnection())\n {\n d->settings->setAvailableMobileTraffic(d->availableMobileTraffic);\n d->settings->setUsedMobileTraffic(d->usedMobileTraffic);\n }\n else\n {\n d->settings->setAvailableTraffic(d->availableTraffic);\n d->settings->setUsedTraffic(d->usedTraffic);\n }\n}\n\nquint32 TrafficBudgetManager::availableTraffic() const\n{\n QReadLocker locker(&d->lock);\n\n return Client::instance()->networkManager()->onMobileConnection() ? d->availableMobileTraffic :\n d->availableTraffic;\n}\n\nbool TrafficBudgetManager::addUsedTraffic(quint32 traffic)\n{\n QWriteLocker locker(&d->lock);\n\n if (Client::instance()->networkManager()->onMobileConnection())\n {\n if (d->availableMobileTraffic >= traffic)\n {\n d->usedMobileTraffic += traffic;\n saveTraffic();\n return true;\n }\n }\n else\n {\n if (d->availableTraffic >= traffic)\n {\n d->usedTraffic += traffic;\n saveTraffic();\n return true;\n }\n }\n\n return !d->active;\n}\n\nquint32 TrafficBudgetManager::usedTraffic() const\n{\n QReadLocker locker(&d->lock);\n\n return Client::instance()->networkManager()->onMobileConnection() ? d->usedMobileTraffic : d->usedTraffic;\n}\n\nvoid TrafficBudgetManager::reset()\n{\n d->usedMobileTraffic = 0;\n d->usedTraffic = 0;\n}\n\n#include \"trafficbudgetmanager.moc\"\n<|endoftext|>"} {"text":"<commit_before>\/*\n KControl Module for general Telepathy integration configs\n Copyright (C) 2011 Martin Klapetek <martin.klapetek@gmail.com>\n\n This library is free software; you can redistribute it and\/or\n modify it under the terms of the GNU Lesser General Public\n License as published by the Free Software Foundation; either\n version 2.1 of the License, or (at your option) any later version.\n\n This library is distributed in the hope that it will be useful,\n but WITHOUT ANY WARRANTY; without even the implied warranty of\n MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU\n Lesser General Public License for more details.\n\n You should have received a copy of the GNU Lesser General Public\n License along with this library; if not, write to the Free Software\n Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA\n*\/\n\n\n#include \"telepathy-kded-config.h\"\n#include \"ui_telepathy-kded-config.h\"\n\n#include <KPluginFactory>\n#include <KLocalizedString>\n#include <QDBusMessage>\n#include <QDBusConnection>\n\nK_PLUGIN_FACTORY(KCMTelepathyKDEDModuleConfigFactory, registerPlugin<TelepathyKDEDConfig>();)\nK_EXPORT_PLUGIN(KCMTelepathyKDEDModuleConfigFactory(\"telepathy_kded_module_config\", \"kcm_telepathy_kded_module_config\"))\n\n\nTelepathyKDEDConfig::TelepathyKDEDConfig(QWidget *parent, const QVariantList& args)\n : KCModule(KCMTelepathyKDEDModuleConfigFactory::componentData(), parent, args),\n ui(new Ui::TelepathyKDEDUi())\n{\n ui->setupUi(this);\n\n \/\/FIXME: figure out how to use i18ncp without argument for suffix\n ui->m_awayMins->setSuffix(i18nc(\"Unit after number in spinbox, denotes time unit 'minutes', keep the leading whitespace!\",\n \" minutes\"));\n\n ui->m_xaMins->setSuffix(i18nc(\"Unit after number in spinbox, denotes time unit 'minutes', keep the leading whitespace!\",\n \" minutes\"));\n\n connect(ui->m_awayCheckBox, SIGNAL(clicked(bool)),\n this, SLOT(autoAwayChecked(bool)));\n\n connect(ui->m_xaCheckBox, SIGNAL(stateChanged(int)),\n this, SLOT(settingsHasChanged()));\n\n connect(ui->m_awayMins, SIGNAL(valueChanged(int)),\n this, SLOT(settingsHasChanged()));\n\n connect(ui->m_xaMins, SIGNAL(valueChanged(int)),\n this, SLOT(settingsHasChanged()));\n\n connect(ui->m_nowPlayingCheckBox, SIGNAL(stateChanged(int)),\n this, SLOT(settingsHasChanged()));\n}\n\nTelepathyKDEDConfig::~TelepathyKDEDConfig()\n{\n\n}\n\nvoid TelepathyKDEDConfig::load()\n{\n KSharedConfigPtr config = KSharedConfig::openConfig(QLatin1String(\"ktelepathyrc\"));\n KConfigGroup kdedConfig = config->group(\"KDED\");\n\n \/\/check if auto-away is enabled\n bool autoAwayEnabled = kdedConfig.readEntry(\"autoAwayEnabled\", true);\n\n \/\/default away time is 5 minutes\n int awayTime = kdedConfig.readEntry(\"awayAfter\", 5);\n\n ui->m_awayCheckBox->setChecked(autoAwayEnabled);\n ui->m_awayMins->setValue(awayTime);\n ui->m_awayMins->setEnabled(autoAwayEnabled);\n\n \/\/check for x-away\n bool autoXAEnabled = kdedConfig.readEntry(\"autoXAEnabled\", true);\n\n \/\/default x-away time is 15 minutes\n int xaTime = kdedConfig.readEntry(\"xaAfter\", 15);\n\n \/\/enable auto-x-away only if auto-away is enabled\n ui->m_xaCheckBox->setChecked(autoXAEnabled && autoAwayEnabled);\n ui->m_xaMins->setValue(xaTime);\n ui->m_xaMins->setEnabled(autoXAEnabled && autoAwayEnabled);\n\n \/\/check if 'Now playing..' is enabled\n bool nowPlayingEnabled = kdedConfig.readEntry(\"nowPlayingEnabled\", true);\n\n ui->m_nowPlayingCheckBox->setChecked(nowPlayingEnabled);\n}\n\nvoid TelepathyKDEDConfig::save()\n{\n KSharedConfigPtr config = KSharedConfig::openConfig(QLatin1String(\"ktelepathyrc\"));\n KConfigGroup kdedConfig = config->group(\"KDED\");\n\n kdedConfig.writeEntry(\"autoAwayEnabled\", ui->m_awayCheckBox->isChecked());\n kdedConfig.writeEntry(\"awayAfter\", ui->m_awayMins->value());\n kdedConfig.writeEntry(\"autoXAEnabled\", ui->m_xaCheckBox->isChecked());\n kdedConfig.writeEntry(\"xaAfter\", ui->m_xaMins->value());\n kdedConfig.writeEntry(\"nowPlayingEnabled\", ui->m_nowPlayingCheckBox->isChecked());\n kdedConfig.sync();\n\n QDBusMessage message = QDBusMessage::createSignal(\"\/Telepathy\", \"org.kde.Telepathy\", \"settingsChange\");\n QDBusConnection::sessionBus().send(message);\n}\n\nvoid TelepathyKDEDConfig::autoAwayChecked(bool checked)\n{\n ui->m_xaCheckBox->setEnabled(checked);\n ui->m_xaMins->setEnabled(checked);\n\n ui->m_awayMins->setEnabled(checked);\n\n Q_EMIT changed(true);\n}\n\nvoid TelepathyKDEDConfig::settingsHasChanged()\n{\n Q_EMIT changed(true);\n}\n<commit_msg>Disable auto-xa checkbox on load if auto-away is disabled<commit_after>\/*\n KControl Module for general Telepathy integration configs\n Copyright (C) 2011 Martin Klapetek <martin.klapetek@gmail.com>\n\n This library is free software; you can redistribute it and\/or\n modify it under the terms of the GNU Lesser General Public\n License as published by the Free Software Foundation; either\n version 2.1 of the License, or (at your option) any later version.\n\n This library is distributed in the hope that it will be useful,\n but WITHOUT ANY WARRANTY; without even the implied warranty of\n MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU\n Lesser General Public License for more details.\n\n You should have received a copy of the GNU Lesser General Public\n License along with this library; if not, write to the Free Software\n Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA\n*\/\n\n\n#include \"telepathy-kded-config.h\"\n#include \"ui_telepathy-kded-config.h\"\n\n#include <KPluginFactory>\n#include <KLocalizedString>\n#include <QDBusMessage>\n#include <QDBusConnection>\n\nK_PLUGIN_FACTORY(KCMTelepathyKDEDModuleConfigFactory, registerPlugin<TelepathyKDEDConfig>();)\nK_EXPORT_PLUGIN(KCMTelepathyKDEDModuleConfigFactory(\"telepathy_kded_module_config\", \"kcm_telepathy_kded_module_config\"))\n\n\nTelepathyKDEDConfig::TelepathyKDEDConfig(QWidget *parent, const QVariantList& args)\n : KCModule(KCMTelepathyKDEDModuleConfigFactory::componentData(), parent, args),\n ui(new Ui::TelepathyKDEDUi())\n{\n ui->setupUi(this);\n\n \/\/FIXME: figure out how to use i18ncp without argument for suffix\n ui->m_awayMins->setSuffix(i18nc(\"Unit after number in spinbox, denotes time unit 'minutes', keep the leading whitespace!\",\n \" minutes\"));\n\n ui->m_xaMins->setSuffix(i18nc(\"Unit after number in spinbox, denotes time unit 'minutes', keep the leading whitespace!\",\n \" minutes\"));\n\n connect(ui->m_awayCheckBox, SIGNAL(clicked(bool)),\n this, SLOT(autoAwayChecked(bool)));\n\n connect(ui->m_xaCheckBox, SIGNAL(stateChanged(int)),\n this, SLOT(settingsHasChanged()));\n\n connect(ui->m_awayMins, SIGNAL(valueChanged(int)),\n this, SLOT(settingsHasChanged()));\n\n connect(ui->m_xaMins, SIGNAL(valueChanged(int)),\n this, SLOT(settingsHasChanged()));\n\n connect(ui->m_nowPlayingCheckBox, SIGNAL(stateChanged(int)),\n this, SLOT(settingsHasChanged()));\n}\n\nTelepathyKDEDConfig::~TelepathyKDEDConfig()\n{\n\n}\n\nvoid TelepathyKDEDConfig::load()\n{\n KSharedConfigPtr config = KSharedConfig::openConfig(QLatin1String(\"ktelepathyrc\"));\n KConfigGroup kdedConfig = config->group(\"KDED\");\n\n \/\/check if auto-away is enabled\n bool autoAwayEnabled = kdedConfig.readEntry(\"autoAwayEnabled\", true);\n\n \/\/default away time is 5 minutes\n int awayTime = kdedConfig.readEntry(\"awayAfter\", 5);\n\n ui->m_awayCheckBox->setChecked(autoAwayEnabled);\n ui->m_awayMins->setValue(awayTime);\n ui->m_awayMins->setEnabled(autoAwayEnabled);\n\n \/\/check for x-away\n bool autoXAEnabled = kdedConfig.readEntry(\"autoXAEnabled\", true);\n\n \/\/default x-away time is 15 minutes\n int xaTime = kdedConfig.readEntry(\"xaAfter\", 15);\n\n \/\/enable auto-x-away only if auto-away is enabled\n ui->m_xaCheckBox->setChecked(autoXAEnabled && autoAwayEnabled);\n ui->m_xaCheckBox->setEnabled(autoAwayEnabled);\n ui->m_xaMins->setValue(xaTime);\n ui->m_xaMins->setEnabled(autoXAEnabled && autoAwayEnabled);\n\n \/\/check if 'Now playing..' is enabled\n bool nowPlayingEnabled = kdedConfig.readEntry(\"nowPlayingEnabled\", true);\n\n ui->m_nowPlayingCheckBox->setChecked(nowPlayingEnabled);\n}\n\nvoid TelepathyKDEDConfig::save()\n{\n KSharedConfigPtr config = KSharedConfig::openConfig(QLatin1String(\"ktelepathyrc\"));\n KConfigGroup kdedConfig = config->group(\"KDED\");\n\n kdedConfig.writeEntry(\"autoAwayEnabled\", ui->m_awayCheckBox->isChecked());\n kdedConfig.writeEntry(\"awayAfter\", ui->m_awayMins->value());\n kdedConfig.writeEntry(\"autoXAEnabled\", ui->m_xaCheckBox->isChecked());\n kdedConfig.writeEntry(\"xaAfter\", ui->m_xaMins->value());\n kdedConfig.writeEntry(\"nowPlayingEnabled\", ui->m_nowPlayingCheckBox->isChecked());\n kdedConfig.sync();\n\n QDBusMessage message = QDBusMessage::createSignal(\"\/Telepathy\", \"org.kde.Telepathy\", \"settingsChange\");\n QDBusConnection::sessionBus().send(message);\n}\n\nvoid TelepathyKDEDConfig::autoAwayChecked(bool checked)\n{\n ui->m_xaCheckBox->setEnabled(checked);\n ui->m_xaMins->setEnabled(checked);\n\n ui->m_awayMins->setEnabled(checked);\n\n Q_EMIT changed(true);\n}\n\nvoid TelepathyKDEDConfig::settingsHasChanged()\n{\n Q_EMIT changed(true);\n}\n<|endoftext|>"} {"text":"<commit_before>\/*************************************************************************\n *\n * $RCSfile: cmtree.cxx,v $\n *\n * $Revision: 1.32 $\n *\n * last change: $Author: hr $ $Date: 2003-03-19 16:19: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#include <stdio.h>\n\n#include \"subtree.hxx\"\n#ifndef CONFIGMGR_CHANGE_HXX\n#include \"change.hxx\"\n#endif\n#ifndef CONFIGMGR_TREECHANGELIST_HXX\n#include \"treechangelist.hxx\"\n#endif\n\n#ifndef CONFIGMGR_TREEPROVIDER_HXX\n#include \"treeprovider.hxx\"\n#endif\n\n\/\/#include \"treeactions.hxx\"\n\n#ifndef _RTL_STRING_HXX_\n#include <rtl\/string.hxx>\n#endif\n#ifndef _RTL_USTRING_HXX_\n#include <rtl\/ustring.hxx>\n#endif\n\n#ifndef _OSL_DIAGNOSE_H_\n#include <osl\/diagnose.h>\n#endif\n\n#ifndef INCLUDED_DEQUE\n#include <deque>\n#define INCLUDED_DEQUE\n#endif\n#ifndef INCLUDED_VECTOR\n#include <vector>\n#define INCLUDED_VECTOR\n#endif\n#ifndef INCLUDED_IOSTREAM\n#include <iostream>\n#define INCLUDED_IOSTREAM\n#endif\n#ifndef INCLUDED_EXCEPTION\n#include <exception>\n#define INCLUDED_EXCEPTION\n#endif\n#ifndef INCLUDED_SET\n#include <set>\n#define INCLUDED_SET\n#endif\n\nusing namespace std;\nusing namespace rtl;\nusing namespace com::sun::star::uno;\n\nnamespace configmgr\n{\n\n\/\/ ------------------------ ChildListSet implementations ------------------------\n ChildListSet::ChildListSet(ChildListSet const& aSet, treeop::DeepChildCopy)\n {\n for(ChildList::iterator it = aSet.GetSet().begin();\n it != aSet.GetSet().end();\n ++it)\n {\n INode* pOrg = *it;\n std::auto_ptr<INode> aCopy = pOrg->clone();\n m_aChildList.insert(m_aChildList.end(), aCopy.release());\n }\n }\n ChildListSet::~ChildListSet()\n {\n for(ChildList::iterator it = m_aChildList.begin();\n it != m_aChildList.end();\n ++it)\n delete *it;\n }\n\n\n\/\/ ---------------------------- Node implementation ----------------------------\n\n INode::INode(node::Attributes _aAttr):m_aAttributes(_aAttr){}\n INode::INode(OUString const& aName, node::Attributes _aAttr)\n :m_aName(aName)\n ,m_aAttributes(_aAttr){}\n \/\/ CopyCTor will be create automatically\n\n INode::~INode() {}\n\n ISubtree* INode::asISubtree(){return NULL;}\n ISubtree const* INode::asISubtree() const {return NULL;}\n ValueNode* INode::asValueNode() {return NULL;}\n ValueNode const* INode::asValueNode() const {return NULL;}\n\n void INode::modifyState(node::State _eNewState)\n {\n m_aAttributes.setState(_eNewState);\n }\n\n void INode::modifyAccess(bool _bWritable,bool _bFinalized)\n {\n \/\/ this state can only occurs a s a result of (?)\n OSL_ENSURE( _bWritable || !_bFinalized,\"Invalid access state: Node is both read-only and finalized\");\n\n m_aAttributes.bWritable = _bWritable;\n m_aAttributes.bFinalized = _bFinalized;\n }\n\n void INode::forceWritableToFinalized()\n {\n if (!m_aAttributes.bWritable)\n {\n m_aAttributes.bFinalized = true;\n m_aAttributes.bWritable = true;\n }\n }\n\n\/\/ ------------------------- SearchNode implementation -------------------------\n SearchNode::SearchNode():INode(node::Attributes()){}\n SearchNode::SearchNode(OUString const& aName)\n :INode(aName, node::Attributes()){}\n\n std::auto_ptr<INode> SearchNode::clone() const {return std::auto_ptr<INode>(new SearchNode(*this));}\n\n SearchNode::~SearchNode(){}\n\n \/\/==========================================================================\n \/\/= OPropagateLevels\n \/\/==========================================================================\n \/** fills a subtree with the correct level informations\n *\/\n struct OPropagateLevels : public NodeModification\n {\n public:\n typedef sal_Int16 Level;\n OPropagateLevels(Level _nParentLevel, Level _nParentDefaultLevel)\n : m_nLevel ( childLevel(_nParentLevel) )\n , m_nDefaultLevel ( childLevel(_nParentDefaultLevel) )\n {\n }\n virtual void handle(ValueNode&) { \/* not interested in value nodes *\/ }\n virtual void handle(ISubtree& _rSubtree)\n {\n _rSubtree.setLevels(m_nLevel, m_nDefaultLevel);\n }\n\n static Level childLevel(Level _nLevel)\n {\n OSL_ASSERT(0 > treeop::ALL_LEVELS);\n return (_nLevel > 0) ? _nLevel-1 : _nLevel;\n }\n protected:\n Level m_nLevel;\n Level m_nDefaultLevel;\n };\n\n\n\/\/ -------------------------- ISubtree implementation --------------------------\n ISubtree* ISubtree::asISubtree() {return this;}\n ISubtree const* ISubtree::asISubtree() const {return this;}\n\n \/\/--------------------------------------------------------------------------\n static inline bool adjustLevel(sal_Int16& _rLevel, sal_Int16 _nNewLevel)\n {\n if (_rLevel == treeop::ALL_LEVELS) return false;\n if (_nNewLevel <= _rLevel &&\n _nNewLevel != treeop::ALL_LEVELS) return false;\n\n _rLevel = _nNewLevel;\n return true;\n }\n\n \/\/--------------------------------------------------------------------------\n void ISubtree::setLevels(sal_Int16 _nLevel, sal_Int16 _nDefaultLevels)\n {\n bool bActive = false;\n\n if (_nLevel && adjustLevel(m_nLevel, _nLevel))\n bActive = true;\n\n if (_nDefaultLevels && adjustLevel(m_nDefaultLevels, _nDefaultLevels))\n bActive = true;\n\n \/\/ forward the level numbers to any child subtrees we have\n if (bActive)\n {\n OPropagateLevels aPropagate(_nLevel,_nDefaultLevels);\n aPropagate.applyToChildren(*this);\n }\n }\n\n\/\/ --------------------------- Subtree implementation ---------------------------\n std::auto_ptr<INode> Subtree::clone() const\n {\n return std::auto_ptr<INode>(new Subtree(*this, treeop::DeepChildCopy()));\n }\n\n INode* Subtree::doGetChild(OUString const& aName) const\n {\n SearchNode searchObj(aName);\n\n#ifdef DEBUG\n for (ChildList::iterator it2 = m_aChildren.GetSet().begin();\n it2 != m_aChildren.GetSet().end();\n ++it2)\n {\n INode* pINode = *it2;\n OUString aName2 = pINode->getName();\n volatile int dummy = 0;\n }\n#endif\n\n ChildList::iterator it = m_aChildren.GetSet().find(&searchObj);\n if (it == m_aChildren.GetSet().end())\n return NULL;\n else\n return *it;\n }\n\n INode* Subtree::addChild(std::auto_ptr<INode> aNode) \/\/ takes ownership\n {\n OUString aName = aNode->getName();\n std::pair<ChildList::iterator, bool> aInserted =\n m_aChildren.GetSet().insert(aNode.get());\n if (aInserted.second)\n aNode.release();\n return *aInserted.first;\n }\n\n ::std::auto_ptr<INode> Subtree::removeChild(OUString const& aName)\n {\n SearchNode searchObj(aName);\n ChildList::const_iterator it = m_aChildren.GetSet().find(&searchObj);\n\n ::std::auto_ptr<INode> aReturn;\n if (m_aChildren.GetSet().end() != it)\n {\n aReturn = ::std::auto_ptr<INode>(*it);\n m_aChildren.GetSet().erase(it);\n }\n return aReturn;\n }\n\/\/ \/\/ -------------------------- ValueNode implementation --------------------------\n\n void Subtree::forEachChild(NodeAction& anAction) const\n {\n for(ChildList::const_iterator it = m_aChildren.GetSet().begin();\n it != m_aChildren.GetSet().end();\n ++it)\n (**it).dispatch(anAction);\n }\n\n void Subtree::forEachChild(NodeModification& anAction)\n {\n ChildList::iterator it = m_aChildren.GetSet().begin();\n while( it != m_aChildren.GetSet().end() )\n {\n \/\/ modification-safe iteration\n (**it++).dispatch(anAction);\n }\n }\n\n\/\/ \/\/ -------------------------- ValueNode implementation --------------------------\n bool ValueNode::setValueType(uno::Type const& _aType)\n {\n if (_aType == this->getValueType()) return true;\n\n if (!this->isNull()) return false;\n\n uno::TypeClass eTC = this->getValueType().getTypeClass();\n if (eTC != uno::TypeClass_VOID && eTC != uno::TypeClass_ANY)\n return false;\n\n m_aValuePair = AnyPair(_aType);\n\n OSL_ASSERT(_aType == this->getValueType());\n\n return true;\n }\n bool ValueNode::setValue(Any const& _aValue)\n {\n sal_Bool bRet = m_aValuePair.setFirst(_aValue);\n if (bRet) this->markAsDefault(false);\n return !! bRet;\n }\n\n bool ValueNode::changeDefault(Any const& _aValue)\n {\n return !! m_aValuePair.setSecond(_aValue);\n }\n\n void ValueNode::setDefault()\n {\n OSL_PRECOND( hasUsableDefault(), \"No default value to set for value node\");\n m_aValuePair.clear( selectValue() );\n this->markAsDefault();\n OSL_POSTCOND( isDefault(), \"Could not set value node to default\");\n }\n\n void ValueNode::promoteToDefault()\n {\n if (!isDefault())\n {\n if (m_aValuePair.hasFirst())\n {\n OSL_VERIFY( m_aValuePair.setSecond(m_aValuePair.getFirst()) );\n m_aValuePair.clear( selectValue() );\n }\n else\n {\n m_aValuePair.clear( selectDeflt() );\n OSL_ASSERT( m_aValuePair.isNull() );\n }\n\n this->markAsDefault();\n\n OSL_ENSURE( !m_aValuePair.hasFirst(), \"Leaving orphaned value in after promoting to default\");\n }\n else\n OSL_ENSURE( !m_aValuePair.hasFirst(), \"Orphaned value in default node won't be promoted\");\n\n OSL_POSTCOND( isDefault(), \"Could not promote value node to default\");\n }\n\n std::auto_ptr<INode> ValueNode::clone() const\n {\n return std::auto_ptr<INode>(new ValueNode(*this));\n }\n\n ValueNode* ValueNode::asValueNode() {return this;}\n ValueNode const* ValueNode::asValueNode() const {return this;}\n\n} \/\/ namespace configmgr\n\n\n<commit_msg>INTEGRATION: CWS cfg01 (1.31.10.1.4); FILE MERGED 2003\/03\/13 15:09:12 jb 1.31.10.1.4.4: #107404# Further clean up of node::Attributes interface 2003\/02\/28 16:33:35 ssmith 1.31.10.1.4.3: #107403# #107403# adding support for mandatory flag and changing dynamic properties semantics 2003\/02\/25 11:39:51 jb 1.31.10.1.4.2: RESYNC: (1.31.10.1-1.31.10.2); FILE MERGED 2003\/02\/17 15:57:34 ssmith 1.31.10.1.4.1: #107404# refactoring code to support encapsulation<commit_after>\/*************************************************************************\n *\n * $RCSfile: cmtree.cxx,v $\n *\n * $Revision: 1.33 $\n *\n * last change: $Author: vg $ $Date: 2003-04-01 13:36:29 $\n *\n * The Contents of this file are made available subject to the terms of\n * either of the following licenses\n *\n * - GNU Lesser General Public License Version 2.1\n * - Sun Industry Standards Source License Version 1.1\n *\n * Sun Microsystems Inc., October, 2000\n *\n * GNU Lesser General Public License Version 2.1\n * =============================================\n * Copyright 2000 by Sun Microsystems, Inc.\n * 901 San Antonio Road, Palo Alto, CA 94303, USA\n *\n * This library is free software; you can redistribute it and\/or\n * modify it under the terms of the GNU Lesser General Public\n * License version 2.1, as published by the Free Software Foundation.\n *\n * This library is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU\n * Lesser General Public License for more details.\n *\n * You should have received a copy of the GNU Lesser General Public\n * License along with this library; if not, write to the Free Software\n * Foundation, Inc., 59 Temple Place, Suite 330, Boston,\n * MA 02111-1307 USA\n *\n *\n * Sun Industry Standards Source License Version 1.1\n * =================================================\n * The contents of this file are subject to the Sun Industry Standards\n * Source License Version 1.1 (the \"License\"); You may not use this file\n * except in compliance with the License. You may obtain a copy of the\n * License at http:\/\/www.openoffice.org\/license.html.\n *\n * Software provided under this License is provided on an \"AS IS\" basis,\n * WITHOUT WARRANTY OF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING,\n * WITHOUT LIMITATION, WARRANTIES THAT THE SOFTWARE IS FREE OF DEFECTS,\n * MERCHANTABLE, FIT FOR A PARTICULAR PURPOSE, OR NON-INFRINGING.\n * See the License for the specific provisions governing your rights and\n * obligations concerning the Software.\n *\n * The Initial Developer of the Original Code is: Sun Microsystems, Inc.\n *\n * Copyright: 2000 by Sun Microsystems, Inc.\n *\n * All Rights Reserved.\n *\n * Contributor(s): _______________________________________\n *\n *\n ************************************************************************\/\n\n#include <stdio.h>\n\n#include \"subtree.hxx\"\n#ifndef CONFIGMGR_CHANGE_HXX\n#include \"change.hxx\"\n#endif\n#ifndef CONFIGMGR_TREECHANGELIST_HXX\n#include \"treechangelist.hxx\"\n#endif\n\n#ifndef CONFIGMGR_TREEPROVIDER_HXX\n#include \"treeprovider.hxx\"\n#endif\n\n\/\/#include \"treeactions.hxx\"\n\n#ifndef _RTL_STRING_HXX_\n#include <rtl\/string.hxx>\n#endif\n#ifndef _RTL_USTRING_HXX_\n#include <rtl\/ustring.hxx>\n#endif\n\n#ifndef _OSL_DIAGNOSE_H_\n#include <osl\/diagnose.h>\n#endif\n\n#ifndef INCLUDED_DEQUE\n#include <deque>\n#define INCLUDED_DEQUE\n#endif\n#ifndef INCLUDED_VECTOR\n#include <vector>\n#define INCLUDED_VECTOR\n#endif\n#ifndef INCLUDED_IOSTREAM\n#include <iostream>\n#define INCLUDED_IOSTREAM\n#endif\n#ifndef INCLUDED_EXCEPTION\n#include <exception>\n#define INCLUDED_EXCEPTION\n#endif\n#ifndef INCLUDED_SET\n#include <set>\n#define INCLUDED_SET\n#endif\n\nusing namespace std;\nusing namespace rtl;\nusing namespace com::sun::star::uno;\n\nnamespace configmgr\n{\n\n\/\/ ------------------------ ChildListSet implementations ------------------------\n ChildListSet::ChildListSet(ChildListSet const& aSet, treeop::DeepChildCopy)\n {\n for(ChildList::iterator it = aSet.GetSet().begin();\n it != aSet.GetSet().end();\n ++it)\n {\n INode* pOrg = *it;\n std::auto_ptr<INode> aCopy = pOrg->clone();\n m_aChildList.insert(m_aChildList.end(), aCopy.release());\n }\n }\n ChildListSet::~ChildListSet()\n {\n for(ChildList::iterator it = m_aChildList.begin();\n it != m_aChildList.end();\n ++it)\n delete *it;\n }\n\n\n\/\/ ---------------------------- Node implementation ----------------------------\n\n INode::INode(node::Attributes _aAttr):m_aAttributes(_aAttr){}\n INode::INode(OUString const& aName, node::Attributes _aAttr)\n :m_aName(aName)\n ,m_aAttributes(_aAttr){}\n \/\/ CopyCTor will be create automatically\n\n INode::~INode() {}\n\n ISubtree* INode::asISubtree(){return NULL;}\n ISubtree const* INode::asISubtree() const {return NULL;}\n ValueNode* INode::asValueNode() {return NULL;}\n ValueNode const* INode::asValueNode() const {return NULL;}\n\n void INode::modifyState(node::State _eNewState)\n {\n m_aAttributes.setState(_eNewState);\n }\n\n void INode::modifyAccess(node::Access _aAccessLevel)\n {\n OSL_ENSURE( node::accessWritable <= _aAccessLevel && _aAccessLevel <= node::accessReadonly,\"Invalid access level for Node\");\n\n m_aAttributes.setAccess(_aAccessLevel);\n }\n\n void INode::markMandatory()\n {\n m_aAttributes.markMandatory();\n }\n\n void INode::markRemovable()\n {\n m_aAttributes.markRemovable();\n }\n\n void INode::promoteAccessToDefault()\n {\n if (m_aAttributes.isFinalized())\n m_aAttributes.setAccess(node::accessReadonly);\n\n if ( m_aAttributes.isMandatory())\n m_aAttributes.setRemovability(false,false);\n }\n\n void INode::forceReadonlyToFinalized()\n {\n if (m_aAttributes.isReadonly())\n {\n m_aAttributes.setAccess(node::accessFinal);\n }\n }\n\n\/\/ ------------------------- SearchNode implementation -------------------------\n SearchNode::SearchNode():INode(node::Attributes()){}\n SearchNode::SearchNode(OUString const& aName)\n :INode(aName, node::Attributes()){}\n\n std::auto_ptr<INode> SearchNode::clone() const {return std::auto_ptr<INode>(new SearchNode(*this));}\n\n SearchNode::~SearchNode(){}\n\n \/\/==========================================================================\n \/\/= OPropagateLevels\n \/\/==========================================================================\n \/** fills a subtree with the correct level informations\n *\/\n struct OPropagateLevels : public NodeModification\n {\n public:\n typedef sal_Int16 Level;\n OPropagateLevels(Level _nParentLevel, Level _nParentDefaultLevel)\n : m_nLevel ( childLevel(_nParentLevel) )\n , m_nDefaultLevel ( childLevel(_nParentDefaultLevel) )\n {\n }\n virtual void handle(ValueNode&) { \/* not interested in value nodes *\/ }\n virtual void handle(ISubtree& _rSubtree)\n {\n _rSubtree.setLevels(m_nLevel, m_nDefaultLevel);\n }\n\n static Level childLevel(Level _nLevel)\n {\n OSL_ASSERT(0 > treeop::ALL_LEVELS);\n return (_nLevel > 0) ? _nLevel-1 : _nLevel;\n }\n protected:\n Level m_nLevel;\n Level m_nDefaultLevel;\n };\n\n\n\/\/ -------------------------- ISubtree implementation --------------------------\n ISubtree* ISubtree::asISubtree() {return this;}\n ISubtree const* ISubtree::asISubtree() const {return this;}\n\n \/\/--------------------------------------------------------------------------\n static inline bool adjustLevel(sal_Int16& _rLevel, sal_Int16 _nNewLevel)\n {\n if (_rLevel == treeop::ALL_LEVELS) return false;\n if (_nNewLevel <= _rLevel &&\n _nNewLevel != treeop::ALL_LEVELS) return false;\n\n _rLevel = _nNewLevel;\n return true;\n }\n\n \/\/--------------------------------------------------------------------------\n void ISubtree::setLevels(sal_Int16 _nLevel, sal_Int16 _nDefaultLevels)\n {\n bool bActive = false;\n\n if (_nLevel && adjustLevel(m_nLevel, _nLevel))\n bActive = true;\n\n if (_nDefaultLevels && adjustLevel(m_nDefaultLevels, _nDefaultLevels))\n bActive = true;\n\n \/\/ forward the level numbers to any child subtrees we have\n if (bActive)\n {\n OPropagateLevels aPropagate(_nLevel,_nDefaultLevels);\n aPropagate.applyToChildren(*this);\n }\n }\n\n\/\/ --------------------------- Subtree implementation ---------------------------\n std::auto_ptr<INode> Subtree::clone() const\n {\n return std::auto_ptr<INode>(new Subtree(*this, treeop::DeepChildCopy()));\n }\n\n INode* Subtree::doGetChild(OUString const& aName) const\n {\n SearchNode searchObj(aName);\n\n#ifdef DEBUG\n for (ChildList::iterator it2 = m_aChildren.GetSet().begin();\n it2 != m_aChildren.GetSet().end();\n ++it2)\n {\n INode* pINode = *it2;\n OUString aName2 = pINode->getName();\n volatile int dummy = 0;\n }\n#endif\n\n ChildList::iterator it = m_aChildren.GetSet().find(&searchObj);\n if (it == m_aChildren.GetSet().end())\n return NULL;\n else\n return *it;\n }\n\n INode* Subtree::addChild(std::auto_ptr<INode> aNode) \/\/ takes ownership\n {\n OUString aName = aNode->getName();\n std::pair<ChildList::iterator, bool> aInserted =\n m_aChildren.GetSet().insert(aNode.get());\n if (aInserted.second)\n aNode.release();\n return *aInserted.first;\n }\n\n ::std::auto_ptr<INode> Subtree::removeChild(OUString const& aName)\n {\n SearchNode searchObj(aName);\n ChildList::const_iterator it = m_aChildren.GetSet().find(&searchObj);\n\n ::std::auto_ptr<INode> aReturn;\n if (m_aChildren.GetSet().end() != it)\n {\n aReturn = ::std::auto_ptr<INode>(*it);\n m_aChildren.GetSet().erase(it);\n }\n return aReturn;\n }\n\/\/ \/\/ -------------------------- ValueNode implementation --------------------------\n\n void Subtree::forEachChild(NodeAction& anAction) const\n {\n for(ChildList::const_iterator it = m_aChildren.GetSet().begin();\n it != m_aChildren.GetSet().end();\n ++it)\n (**it).dispatch(anAction);\n }\n\n void Subtree::forEachChild(NodeModification& anAction)\n {\n ChildList::iterator it = m_aChildren.GetSet().begin();\n while( it != m_aChildren.GetSet().end() )\n {\n \/\/ modification-safe iteration\n (**it++).dispatch(anAction);\n }\n }\n\n\/\/ \/\/ -------------------------- ValueNode implementation --------------------------\n bool ValueNode::setValueType(uno::Type const& _aType)\n {\n if (_aType == this->getValueType()) return true;\n\n if (!this->isNull()) return false;\n\n uno::TypeClass eTC = this->getValueType().getTypeClass();\n if (eTC != uno::TypeClass_VOID && eTC != uno::TypeClass_ANY)\n return false;\n\n m_aValuePair = AnyPair(_aType);\n\n OSL_ASSERT(_aType == this->getValueType());\n\n return true;\n }\n bool ValueNode::setValue(Any const& _aValue)\n {\n sal_Bool bRet = m_aValuePair.setFirst(_aValue);\n if (bRet) this->markAsDefault(false);\n return !! bRet;\n }\n\n bool ValueNode::changeDefault(Any const& _aValue)\n {\n return !! m_aValuePair.setSecond(_aValue);\n }\n\n void ValueNode::setDefault()\n {\n OSL_PRECOND( hasUsableDefault(), \"No default value to set for value node\");\n m_aValuePair.clear( selectValue() );\n this->markAsDefault();\n OSL_POSTCOND( isDefault(), \"Could not set value node to default\");\n }\n\n void ValueNode::promoteToDefault()\n {\n if (!isDefault())\n {\n if (m_aValuePair.hasFirst())\n {\n OSL_VERIFY( m_aValuePair.setSecond(m_aValuePair.getFirst()) );\n m_aValuePair.clear( selectValue() );\n }\n else\n {\n m_aValuePair.clear( selectDeflt() );\n OSL_ASSERT( m_aValuePair.isNull() );\n }\n\n this->markAsDefault();\n\n OSL_ENSURE( !m_aValuePair.hasFirst(), \"Leaving orphaned value in after promoting to default\");\n }\n else\n OSL_ENSURE( !m_aValuePair.hasFirst(), \"Orphaned value in default node won't be promoted\");\n\n OSL_POSTCOND( isDefault(), \"Could not promote value node to default\");\n }\n\n std::auto_ptr<INode> ValueNode::clone() const\n {\n return std::auto_ptr<INode>(new ValueNode(*this));\n }\n\n ValueNode* ValueNode::asValueNode() {return this;}\n ValueNode const* ValueNode::asValueNode() const {return this;}\n\n} \/\/ namespace configmgr\n\n\n<|endoftext|>"} {"text":"<commit_before>\/* go_account.cc\n Michael Burkat, 9 February 2015\n Copyright (c) 2015 Datacratic Inc. All rights reserved.\n\n Go account implementation.\n*\/\n\n#include \"go_account.h\"\n\nusing namespace std;\n\nnamespace RTBKIT {\n\n\/\/ Go Account\nGoAccount::GoAccount(const AccountKey &key, GoAccountType type)\n :type(type)\n{\n switch (type) {\n case ROUTER:\n router = make_shared<GoRouterAccount>(key);\n break;\n case POST_AUCTION:\n pal = make_shared<GoPostAuctionAccount>(key);\n break;\n };\n}\n\nGoAccount::GoAccount(Json::Value &json)\n{\n AccountKey key(json[\"name\"].asString());\n string accType = json[\"type\"].asString();\n\n if (accType == \"Router\") {\n type = ROUTER;\n router = make_shared<GoRouterAccount>(json);\n } else if (accType == \"PostAuction\") {\n type = POST_AUCTION;\n pal = make_shared<GoPostAuctionAccount>(json);\n } else {\n cout << \"Go account type error.\" << endl;\n }\n}\n\nbool\nGoAccount::bid(Amount bidPrice)\n{\n if (type == ROUTER) return router->bid(bidPrice);\n else throw ML::Exception(\"GoAccounts::bid: attempt bid on non ROUTER account\");\n return false;\n}\n\nbool\nGoAccount::win(Amount winPrice)\n{\n if (type == POST_AUCTION) return pal->win(winPrice);\n else throw ML::Exception(\"GoAccounts::updateBalance: attempt update on non ROUTER account\");\n return false;\n}\n\nJson::Value\nGoAccount::toJson()\n{\n Json::Value account(Json::objectValue);\n switch (type) {\n case ROUTER:\n account[\"type\"] = \"Router\";\n router->toJson(account);\n break;\n case POST_AUCTION:\n account[\"type\"] = \"PostAuction\";\n pal->toJson(account);\n break;\n };\n return account;\n}\n\n\/\/ Router Account\nGoRouterAccount::GoRouterAccount(const AccountKey &key)\n : GoBaseAccount(key)\n{\n rate = Amount(MicroUSD(0));\n balance = Amount(MicroUSD(0));\n}\n\nGoRouterAccount::GoRouterAccount(Json::Value &json)\n : GoBaseAccount(json)\n{\n if (json.isMember(\"rate\")) rate = Amount(MicroUSD(json[\"rate\"].asInt()));\n else rate = Amount(MicroUSD(0));\n\n if (json.isMember(\"balance\")) balance = Amount(MicroUSD(json[\"balance\"].asInt()));\n else balance = Amount(MicroUSD(0));\n}\n\nbool\nGoRouterAccount::bid(Amount bidPrice)\n{\n if (balance >= bidPrice) {\n balance -= bidPrice;\n return true;\n }\n return false;\n}\n\nvoid\nGoRouterAccount::toJson(Json::Value &account)\n{\n account[\"rate\"] = rate.value;\n account[\"balance\"] = balance.value;\n GoBaseAccount::toJson(account);\n}\n\n\/\/ Post Auction Account\nGoPostAuctionAccount::GoPostAuctionAccount(const AccountKey &key)\n : GoBaseAccount(key)\n{\n imp = 0;\n spend = Amount(MicroUSD(0));\n}\n\nGoPostAuctionAccount::GoPostAuctionAccount(Json::Value &json)\n : GoBaseAccount(json)\n{\n if (json.isMember(\"imp\")) imp = json[\"imp\"].asInt();\n else imp = 0;\n\n if (json.isMember(\"spend\")) spend = Amount(MicroUSD(json[\"spend\"].asInt()));\n else spend = Amount(MicroUSD(0));\n}\n\nbool\nGoPostAuctionAccount::win(Amount winPrice)\n{\n spend += winPrice;\n imp += 1;\n return true;\n}\n\nvoid\nGoPostAuctionAccount::toJson(Json::Value &account)\n{\n account[\"imp\"] = int64_t(imp);\n account[\"spend\"] = spend.value;\n GoBaseAccount::toJson(account);\n}\n\n\/\/Account Base\n\nGoBaseAccount::GoBaseAccount(const AccountKey &key)\n : name(key.toString()), parent(key.parent().toString())\n{\n}\n\nGoBaseAccount::GoBaseAccount(Json::Value &json)\n{\n if (json.isMember(\"name\")) name = json[\"name\"].asString();\n else name = \"\"; \/\/ TODO: throw error instead?\n\n if (json.isMember(\"parent\")) parent = json[\"parent\"].asString();\n else parent = \"\";\n}\n\nvoid\nGoBaseAccount::toJson(Json::Value &account)\n{\n account[\"name\"] = name;\n account[\"parent\"] = parent;\n}\n\n\/\/ Accounts\n\nGoAccounts::GoAccounts() : accounts{}\n{\n}\n\nvoid\nGoAccounts::add(const AccountKey &key, GoAccountType type)\n{\n if (exists(key)) return;\n std::lock_guard<std::mutex> guard(this->mutex);\n accounts.insert( pair<AccountKey, GoAccount>(key, GoAccount(key, type)) );\n}\n\nvoid\nGoAccounts::addFromJsonString(std::string jsonAccount)\n{\n Json::Value json = Json::parse(jsonAccount);\n if (json.isMember(\"type\") && json.isMember(\"name\")) {\n string name = json[\"name\"].asString();\n const AccountKey key(name);\n if (exists(key)) return;\n\n std::lock_guard<std::mutex> guard(this->mutex);\n GoAccount account(json);\n accounts.insert( pair<AccountKey, GoAccount>(key, account) );\n \/\/cout << \"account in map: \" << accounts[key].toJson() << endl;\n } else {\n cout << \"error: type or name not parsed\" << endl;\n }\n}\n\nvoid\nGoAccounts::updateBalance(const AccountKey &key, Amount newBalance)\n{\n if (!exists(key)) return;\n std::lock_guard<std::mutex> guard(this->mutex);\n auto account = get(key);\n account->router->balance = newBalance;\n}\n\nAmount\nGoAccounts::getBalance(const AccountKey &key)\n{\n if (!exists(key)) return Amount(MicroUSD(0));\n std::lock_guard<std::mutex> guard(this->mutex);\n auto account = get(key);\n return account->router->balance;\n}\n\nbool\nGoAccounts::bid(const AccountKey &key, Amount bidPrice)\n{\n if (!exists(key)) return false;\n\n std::lock_guard<std::mutex> guard(this->mutex);\n auto account = get(key);\n if (account->type != ROUTER) {\n throw ML::Exception(\"GoAccounts::bid: attempt bid on non ROUTER account\");\n }\n\n return account->bid(bidPrice);\n}\n\nbool\nGoAccounts::win(const AccountKey &key, Amount winPrice)\n{\n if (!exists(key)) {\n cout << \"account not found, unaccounted win: \" << key.toString()\n << \" \" << winPrice.toString() << endl;\n return false;\n }\n\n std::lock_guard<std::mutex> guard(this->mutex);\n auto account = get(key);\n if (account->type != POST_AUCTION) {\n throw ML::Exception(\"GoAccounts::win: attempt win on non POST_AUCTION account\");\n }\n\n return account->win(winPrice);\n}\n\nbool\nGoAccounts::exists(const AccountKey &key)\n{\n std::lock_guard<std::mutex> guard(this->mutex);\n bool exists = accounts.find(key) != accounts.end();\n return exists;\n}\n\nGoAccount*\nGoAccounts::get(const AccountKey &key)\n{\n auto account = accounts.find(key);\n if (account == accounts.end()) {\n throw ML::Exception(\"GoAccounts::get: account '\" + key.toString() + \"' not found\");\n } else {\n return &account->second;\n }\n}\n\n} \/\/ namspace RTBKIT\n<commit_msg>fixed Amount calls<commit_after>\/* go_account.cc\n Michael Burkat, 9 February 2015\n Copyright (c) 2015 Datacratic Inc. All rights reserved.\n\n Go account implementation.\n*\/\n\n#include \"go_account.h\"\n\nusing namespace std;\n\nnamespace RTBKIT {\n\n\/\/ Go Account\nGoAccount::GoAccount(const AccountKey &key, GoAccountType type)\n :type(type)\n{\n switch (type) {\n case ROUTER:\n router = make_shared<GoRouterAccount>(key);\n break;\n case POST_AUCTION:\n pal = make_shared<GoPostAuctionAccount>(key);\n break;\n };\n}\n\nGoAccount::GoAccount(Json::Value &json)\n{\n AccountKey key(json[\"name\"].asString());\n string accType = json[\"type\"].asString();\n\n if (accType == \"Router\") {\n type = ROUTER;\n router = make_shared<GoRouterAccount>(json);\n } else if (accType == \"PostAuction\") {\n type = POST_AUCTION;\n pal = make_shared<GoPostAuctionAccount>(json);\n } else {\n cout << \"Go account type error.\" << endl;\n }\n}\n\nbool\nGoAccount::bid(Amount bidPrice)\n{\n if (type == ROUTER) return router->bid(bidPrice);\n else throw ML::Exception(\"GoAccounts::bid: attempt bid on non ROUTER account\");\n return false;\n}\n\nbool\nGoAccount::win(Amount winPrice)\n{\n if (type == POST_AUCTION) return pal->win(winPrice);\n else throw ML::Exception(\"GoAccounts::updateBalance: attempt update on non ROUTER account\");\n return false;\n}\n\nJson::Value\nGoAccount::toJson()\n{\n Json::Value account(Json::objectValue);\n switch (type) {\n case ROUTER:\n account[\"type\"] = \"Router\";\n router->toJson(account);\n break;\n case POST_AUCTION:\n account[\"type\"] = \"PostAuction\";\n pal->toJson(account);\n break;\n };\n return account;\n}\n\n\/\/ Router Account\nGoRouterAccount::GoRouterAccount(const AccountKey &key)\n : GoBaseAccount(key)\n{\n rate = MicroUSD(0);\n balance = MicroUSD(0);\n}\n\nGoRouterAccount::GoRouterAccount(Json::Value &json)\n : GoBaseAccount(json)\n{\n if (json.isMember(\"rate\")) rate = MicroUSD(json[\"rate\"].asInt());\n else rate = MicroUSD(0);\n\n if (json.isMember(\"balance\")) balance = MicroUSD(json[\"balance\"].asInt());\n else balance = MicroUSD(0);\n}\n\nbool\nGoRouterAccount::bid(Amount bidPrice)\n{\n if (balance >= bidPrice) {\n balance -= bidPrice;\n return true;\n }\n return false;\n}\n\nvoid\nGoRouterAccount::toJson(Json::Value &account)\n{\n account[\"rate\"] = rate.value;\n account[\"balance\"] = balance.value;\n GoBaseAccount::toJson(account);\n}\n\n\/\/ Post Auction Account\nGoPostAuctionAccount::GoPostAuctionAccount(const AccountKey &key)\n : GoBaseAccount(key)\n{\n imp = 0;\n spend = MicroUSD(0);\n}\n\nGoPostAuctionAccount::GoPostAuctionAccount(Json::Value &json)\n : GoBaseAccount(json)\n{\n if (json.isMember(\"imp\")) imp = json[\"imp\"].asInt();\n else imp = 0;\n\n if (json.isMember(\"spend\")) spend = MicroUSD(json[\"spend\"].asInt());\n else spend = MicroUSD(0);\n}\n\nbool\nGoPostAuctionAccount::win(Amount winPrice)\n{\n spend += winPrice;\n imp += 1;\n return true;\n}\n\nvoid\nGoPostAuctionAccount::toJson(Json::Value &account)\n{\n account[\"imp\"] = int64_t(imp);\n account[\"spend\"] = spend.value;\n GoBaseAccount::toJson(account);\n}\n\n\/\/Account Base\n\nGoBaseAccount::GoBaseAccount(const AccountKey &key)\n : name(key.toString()), parent(key.parent().toString())\n{\n}\n\nGoBaseAccount::GoBaseAccount(Json::Value &json)\n{\n if (json.isMember(\"name\")) name = json[\"name\"].asString();\n else name = \"\"; \/\/ TODO: throw error instead?\n\n if (json.isMember(\"parent\")) parent = json[\"parent\"].asString();\n else parent = \"\";\n}\n\nvoid\nGoBaseAccount::toJson(Json::Value &account)\n{\n account[\"name\"] = name;\n account[\"parent\"] = parent;\n}\n\n\/\/ Accounts\n\nGoAccounts::GoAccounts() : accounts{}\n{\n}\n\nvoid\nGoAccounts::add(const AccountKey &key, GoAccountType type)\n{\n if (exists(key)) return;\n std::lock_guard<std::mutex> guard(this->mutex);\n accounts.insert( pair<AccountKey, GoAccount>(key, GoAccount(key, type)) );\n}\n\nvoid\nGoAccounts::addFromJsonString(std::string jsonAccount)\n{\n Json::Value json = Json::parse(jsonAccount);\n if (json.isMember(\"type\") && json.isMember(\"name\")) {\n string name = json[\"name\"].asString();\n const AccountKey key(name);\n if (exists(key)) return;\n\n std::lock_guard<std::mutex> guard(this->mutex);\n GoAccount account(json);\n accounts.insert( pair<AccountKey, GoAccount>(key, account) );\n \/\/cout << \"account in map: \" << accounts[key].toJson() << endl;\n } else {\n cout << \"error: type or name not parsed\" << endl;\n }\n}\n\nvoid\nGoAccounts::updateBalance(const AccountKey &key, Amount newBalance)\n{\n if (!exists(key)) return;\n std::lock_guard<std::mutex> guard(this->mutex);\n auto account = get(key);\n account->router->balance = newBalance;\n}\n\nAmount\nGoAccounts::getBalance(const AccountKey &key)\n{\n if (!exists(key)) return MicroUSD(0);\n std::lock_guard<std::mutex> guard(this->mutex);\n auto account = get(key);\n return account->router->balance;\n}\n\nbool\nGoAccounts::bid(const AccountKey &key, Amount bidPrice)\n{\n if (!exists(key)) return false;\n\n std::lock_guard<std::mutex> guard(this->mutex);\n auto account = get(key);\n if (account->type != ROUTER) {\n throw ML::Exception(\"GoAccounts::bid: attempt bid on non ROUTER account\");\n }\n\n return account->bid(bidPrice);\n}\n\nbool\nGoAccounts::win(const AccountKey &key, Amount winPrice)\n{\n if (!exists(key)) {\n cout << \"account not found, unaccounted win: \" << key.toString()\n << \" \" << winPrice.toString() << endl;\n return false;\n }\n\n std::lock_guard<std::mutex> guard(this->mutex);\n auto account = get(key);\n if (account->type != POST_AUCTION) {\n throw ML::Exception(\"GoAccounts::win: attempt win on non POST_AUCTION account\");\n }\n\n return account->win(winPrice);\n}\n\nbool\nGoAccounts::exists(const AccountKey &key)\n{\n std::lock_guard<std::mutex> guard(this->mutex);\n bool exists = accounts.find(key) != accounts.end();\n return exists;\n}\n\nGoAccount*\nGoAccounts::get(const AccountKey &key)\n{\n auto account = accounts.find(key);\n if (account == accounts.end()) {\n throw ML::Exception(\"GoAccounts::get: account '\" + key.toString() + \"' not found\");\n } else {\n return &account->second;\n }\n}\n\n} \/\/ namspace RTBKIT\n<|endoftext|>"} {"text":"<commit_before>\/\/ Copyright (c) 2015, the Dart project authors. Please see the AUTHORS file\n\/\/ for details. All rights reserved. Use of this source code is governed by a\n\/\/ BSD-style license that can be found in the LICENSE file.\n\n#include \"bin\/vmservice_dartium.h\"\n\n#include \"bin\/builtin.h\"\n#include \"bin\/dartutils.h\"\n#include \"bin\/eventhandler.h\"\n#include \"bin\/platform.h\"\n#include \"bin\/thread.h\"\n#include \"bin\/utils.h\"\n#include \"bin\/vmservice_impl.h\"\n#include \"zlib\/zlib.h\"\n\nnamespace dart {\nnamespace bin {\n\n#define CHECK_RESULT(result) \\\n if (Dart_IsError(result)) { \\\n fprintf(stderr, \"CHECK_RESULT failed: %s\", Dart_GetError(result)); \\\n Dart_ExitScope(); \\\n Dart_ShutdownIsolate(); \\\n return 0; \\\n } \\\n\n\n\nstatic const char* DEFAULT_VM_SERVICE_SERVER_IP = \"127.0.0.1\";\nstatic const int DEFAULT_VM_SERVICE_SERVER_PORT = 0;\n\nvoid VmServiceServer::Bootstrap() {\n if (!Platform::Initialize()) {\n fprintf(stderr, \"Platform::Initialize() failed\\n\");\n }\n DartUtils::SetOriginalWorkingDirectory();\n Thread::InitOnce();\n TimerUtils::InitOnce();\n EventHandler::Start();\n}\n\n\nDart_Isolate VmServiceServer::CreateIsolate(const uint8_t* snapshot_buffer) {\n ASSERT(snapshot_buffer != NULL);\n \/\/ Create the isolate.\n IsolateData* isolate_data = new IsolateData(DART_VM_SERVICE_ISOLATE_NAME,\n NULL,\n NULL);\n char* error = 0;\n Dart_Isolate isolate = Dart_CreateIsolate(DART_VM_SERVICE_ISOLATE_NAME,\n \"main\",\n snapshot_buffer,\n NULL,\n isolate_data,\n &error);\n if (!isolate) {\n fprintf(stderr, \"Dart_CreateIsolate failed: %s\\n\", error);\n return 0;\n }\n\n Dart_EnterScope();\n Builtin::SetNativeResolver(Builtin::kBuiltinLibrary);\n Builtin::SetNativeResolver(Builtin::kIOLibrary);\n\n Dart_Handle result;\n\n \/\/ Prepare for script loading by setting up the 'print' and 'timer'\n \/\/ closures and setting up 'package root' for URI resolution.\n result = DartUtils::PrepareForScriptLoading(true, false);\n CHECK_RESULT(result);\n\n ASSERT(Dart_IsServiceIsolate(isolate));\n if (!VmService::Setup(DEFAULT_VM_SERVICE_SERVER_IP,\n DEFAULT_VM_SERVICE_SERVER_PORT,\n false \/* running_precompiled *\/)) {\n fprintf(stderr,\n \"Vmservice::Setup failed: %s\\n\", VmService::GetErrorMessage());\n isolate = NULL;\n }\n Dart_ExitScope();\n Dart_ExitIsolate();\n return isolate;\n}\n\n\nconst char* VmServiceServer::GetServerIP() {\n return VmService::GetServerIP();\n}\n\n\nintptr_t VmServiceServer::GetServerPort() {\n return VmService::GetServerPort();\n}\n\n\nvoid VmServiceServer::DecompressAssets(const uint8_t* input,\n unsigned int input_len,\n uint8_t** output,\n unsigned int* output_length) {\n ASSERT(input != NULL);\n ASSERT(input_len > 0);\n ASSERT(output != NULL);\n ASSERT(output_length != NULL);\n\n \/\/ Initialize output.\n *output = NULL;\n *output_length = 0;\n\n const unsigned int kChunkSize = 256 * 1024;\n uint8_t chunk_out[kChunkSize];\n z_stream strm;\n strm.zalloc = Z_NULL;\n strm.zfree = Z_NULL;\n strm.opaque = Z_NULL;\n strm.avail_in = 0;\n strm.next_in = 0;\n int ret = inflateInit2(&strm, 32 + MAX_WBITS);\n ASSERT(ret == Z_OK);\n\n unsigned int input_cursor = 0;\n unsigned int output_cursor = 0;\n do {\n \/\/ Setup input.\n unsigned int size_in = input_len - input_cursor;\n if (size_in > kChunkSize) {\n size_in = kChunkSize;\n }\n strm.avail_in = size_in;\n strm.next_in = const_cast<uint8_t*>(&input[input_cursor]);\n\n \/\/ Inflate until we've exhausted the current input chunk.\n do {\n \/\/ Setup output.\n strm.avail_out = kChunkSize;\n strm.next_out = &chunk_out[0];\n \/\/ Inflate.\n ret = inflate(&strm, Z_SYNC_FLUSH);\n \/\/ We either hit the end of the stream or made forward progress.\n ASSERT((ret == Z_STREAM_END) || (ret == Z_OK));\n \/\/ Grow output buffer size.\n unsigned int size_out = kChunkSize - strm.avail_out;\n *output_length += size_out;\n *output = reinterpret_cast<uint8_t*>(realloc(*output, *output_length));\n \/\/ Copy output.\n memmove(&((*output)[output_cursor]), &chunk_out[0], size_out);\n output_cursor += size_out;\n } while (strm.avail_out == 0);\n\n \/\/ We've processed size_in bytes.\n input_cursor += size_in;\n\n \/\/ We're finished decompressing when zlib tells us.\n } while (ret != Z_STREAM_END);\n\n inflateEnd(&strm);\n}\n\n\/* DISALLOW_ALLOCATION *\/\nvoid VmServiceServer::operator delete(void* pointer) {\n fprintf(stderr, \"unreachable code\\n\");\n abort();\n}\n\n} \/\/ namespace bin\n} \/\/ namespace dart\n<commit_msg>Remove apparent duplicate call to PrepareForScriptLoading in Dartium<commit_after>\/\/ Copyright (c) 2015, the Dart project authors. Please see the AUTHORS file\n\/\/ for details. All rights reserved. Use of this source code is governed by a\n\/\/ BSD-style license that can be found in the LICENSE file.\n\n#include \"bin\/vmservice_dartium.h\"\n\n#include \"bin\/builtin.h\"\n#include \"bin\/dartutils.h\"\n#include \"bin\/eventhandler.h\"\n#include \"bin\/platform.h\"\n#include \"bin\/thread.h\"\n#include \"bin\/utils.h\"\n#include \"bin\/vmservice_impl.h\"\n#include \"zlib\/zlib.h\"\n\nnamespace dart {\nnamespace bin {\n\n#define CHECK_RESULT(result) \\\n if (Dart_IsError(result)) { \\\n fprintf(stderr, \"CHECK_RESULT failed: %s\", Dart_GetError(result)); \\\n Dart_ExitScope(); \\\n Dart_ShutdownIsolate(); \\\n return 0; \\\n } \\\n\n\n\nstatic const char* DEFAULT_VM_SERVICE_SERVER_IP = \"127.0.0.1\";\nstatic const int DEFAULT_VM_SERVICE_SERVER_PORT = 0;\n\nvoid VmServiceServer::Bootstrap() {\n if (!Platform::Initialize()) {\n fprintf(stderr, \"Platform::Initialize() failed\\n\");\n }\n DartUtils::SetOriginalWorkingDirectory();\n Thread::InitOnce();\n TimerUtils::InitOnce();\n EventHandler::Start();\n}\n\n\nDart_Isolate VmServiceServer::CreateIsolate(const uint8_t* snapshot_buffer) {\n ASSERT(snapshot_buffer != NULL);\n \/\/ Create the isolate.\n IsolateData* isolate_data = new IsolateData(DART_VM_SERVICE_ISOLATE_NAME,\n NULL,\n NULL);\n char* error = 0;\n Dart_Isolate isolate = Dart_CreateIsolate(DART_VM_SERVICE_ISOLATE_NAME,\n \"main\",\n snapshot_buffer,\n NULL,\n isolate_data,\n &error);\n if (!isolate) {\n fprintf(stderr, \"Dart_CreateIsolate failed: %s\\n\", error);\n return 0;\n }\n\n Dart_EnterScope();\n Builtin::SetNativeResolver(Builtin::kBuiltinLibrary);\n Builtin::SetNativeResolver(Builtin::kIOLibrary);\n\n Dart_Handle result;\n\n ASSERT(Dart_IsServiceIsolate(isolate));\n if (!VmService::Setup(DEFAULT_VM_SERVICE_SERVER_IP,\n DEFAULT_VM_SERVICE_SERVER_PORT,\n false \/* running_precompiled *\/)) {\n fprintf(stderr,\n \"Vmservice::Setup failed: %s\\n\", VmService::GetErrorMessage());\n isolate = NULL;\n }\n Dart_ExitScope();\n Dart_ExitIsolate();\n return isolate;\n}\n\n\nconst char* VmServiceServer::GetServerIP() {\n return VmService::GetServerIP();\n}\n\n\nintptr_t VmServiceServer::GetServerPort() {\n return VmService::GetServerPort();\n}\n\n\nvoid VmServiceServer::DecompressAssets(const uint8_t* input,\n unsigned int input_len,\n uint8_t** output,\n unsigned int* output_length) {\n ASSERT(input != NULL);\n ASSERT(input_len > 0);\n ASSERT(output != NULL);\n ASSERT(output_length != NULL);\n\n \/\/ Initialize output.\n *output = NULL;\n *output_length = 0;\n\n const unsigned int kChunkSize = 256 * 1024;\n uint8_t chunk_out[kChunkSize];\n z_stream strm;\n strm.zalloc = Z_NULL;\n strm.zfree = Z_NULL;\n strm.opaque = Z_NULL;\n strm.avail_in = 0;\n strm.next_in = 0;\n int ret = inflateInit2(&strm, 32 + MAX_WBITS);\n ASSERT(ret == Z_OK);\n\n unsigned int input_cursor = 0;\n unsigned int output_cursor = 0;\n do {\n \/\/ Setup input.\n unsigned int size_in = input_len - input_cursor;\n if (size_in > kChunkSize) {\n size_in = kChunkSize;\n }\n strm.avail_in = size_in;\n strm.next_in = const_cast<uint8_t*>(&input[input_cursor]);\n\n \/\/ Inflate until we've exhausted the current input chunk.\n do {\n \/\/ Setup output.\n strm.avail_out = kChunkSize;\n strm.next_out = &chunk_out[0];\n \/\/ Inflate.\n ret = inflate(&strm, Z_SYNC_FLUSH);\n \/\/ We either hit the end of the stream or made forward progress.\n ASSERT((ret == Z_STREAM_END) || (ret == Z_OK));\n \/\/ Grow output buffer size.\n unsigned int size_out = kChunkSize - strm.avail_out;\n *output_length += size_out;\n *output = reinterpret_cast<uint8_t*>(realloc(*output, *output_length));\n \/\/ Copy output.\n memmove(&((*output)[output_cursor]), &chunk_out[0], size_out);\n output_cursor += size_out;\n } while (strm.avail_out == 0);\n\n \/\/ We've processed size_in bytes.\n input_cursor += size_in;\n\n \/\/ We're finished decompressing when zlib tells us.\n } while (ret != Z_STREAM_END);\n\n inflateEnd(&strm);\n}\n\n\/* DISALLOW_ALLOCATION *\/\nvoid VmServiceServer::operator delete(void* pointer) {\n fprintf(stderr, \"unreachable code\\n\");\n abort();\n}\n\n} \/\/ namespace bin\n} \/\/ namespace dart\n<|endoftext|>"} {"text":"<commit_before>\/*************************************************************************\n *\n * $RCSfile: morebtn.cxx,v $\n *\n * $Revision: 1.4 $\n *\n * last change: $Author: obo $ $Date: 2005-01-03 17:40: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 _SV_MOREBTN_HXX\n#include <morebtn.hxx>\n#endif\n\n#ifndef _SV_RD_H\n#include <tools\/rc.h>\n#endif\n\n\n\n\/\/ =======================================================================\n\n\/\/ Muss mit der Laenge der folgenden Texte uebereinstimmen\n#define EXTRA_TEXTLEN 3\n\nstatic sal_Char const aImplMoreOpen[] = \" >>\";\nstatic sal_Char const aImplMoreClose[] = \" <<\";\n\nDECLARE_LIST( ImplMoreWindowList, Window* );\n\n\/\/ =======================================================================\n\nvoid MoreButton::ImplInit( Window* pParent, WinBits nStyle )\n{\n mpItemList = NULL;\n mnDelta = 0;\n meUnit = MAP_PIXEL;\n mbState = FALSE;\n\n PushButton::ImplInit( pParent, nStyle );\n\n SetText( Button::GetStandardText( BUTTON_MORE ) );\n SetHelpText( Button::GetStandardHelpText( BUTTON_MORE ) );\n}\n\n\/\/ -----------------------------------------------------------------------\n\nMoreButton::MoreButton( Window* pParent, WinBits nStyle ) :\n PushButton( WINDOW_MOREBUTTON )\n{\n ImplInit( pParent, nStyle );\n}\n\n\/\/ -----------------------------------------------------------------------\n\nMoreButton::MoreButton( Window* pParent, const ResId& rResId ) :\n PushButton( WINDOW_MOREBUTTON )\n{\n rResId.SetRT( RSC_MOREBUTTON );\n WinBits nStyle = ImplInitRes( rResId );\n ImplInit( pParent, nStyle );\n ImplLoadRes( rResId );\n\n if ( !(nStyle & WB_HIDE) )\n Show();\n}\n\n\/\/ -----------------------------------------------------------------------\n\nvoid MoreButton::ImplLoadRes( const ResId& rResId )\n{\n PushButton::ImplLoadRes( rResId );\n\n ULONG nObjMask = ReadLongRes();\n\n if ( nObjMask & RSC_MOREBUTTON_STATE )\n {\n \/\/ Nicht Methode rufen, da Dialog nicht umgeschaltet werden soll\n mbState = (BOOL)ReadShortRes();\n SetText( GetText() );\n }\n if ( nObjMask & RSC_MOREBUTTON_MAPUNIT )\n meUnit = (MapUnit)ReadLongRes();\n if ( nObjMask & RSC_MOREBUTTON_DELTA )\n \/\/ Groesse fuer Erweitern des Dialogs\n mnDelta = ReadShortRes();\n}\n\n\/\/ -----------------------------------------------------------------------\n\nMoreButton::~MoreButton()\n{\n if ( mpItemList )\n delete mpItemList;\n}\n\n\/\/ -----------------------------------------------------------------------\n\nvoid MoreButton::Click()\n{\n Window* pParent = GetParent();\n Size aSize( pParent->GetSizePixel() );\n Window* pWindow = (mpItemList) ? mpItemList->First() : NULL;\n long nDeltaPixel = LogicToPixel( Size( 0, mnDelta ), meUnit ).Height();\n\n \/\/ Status aendern\n XubString aText = GetText();\n mbState = !mbState;\n SetText( aText );\n\n \/\/ Hier den Click-Handler rufen, damit vorher die Controls initialisiert\n \/\/ werden koennen\n PushButton::Click();\n\n \/\/ Je nach Status die Fenster updaten\n if ( mbState )\n {\n \/\/ Fenster anzeigen\n while ( pWindow )\n {\n pWindow->Show();\n pWindow = mpItemList->Next();\n }\n\n \/\/ Dialogbox anpassen\n Point aPos( pParent->GetPosPixel() );\n Rectangle aDeskRect( pParent->ImplGetFrameWindow()->GetDesktopRectPixel() );\n\n aSize.Height() += nDeltaPixel;\n if ( (aPos.Y()+aSize.Height()) > aDeskRect.Bottom() )\n {\n aPos.Y() = aDeskRect.Bottom()-aSize.Height();\n\n if ( aPos.Y() < aDeskRect.Top() )\n aPos.Y() = aDeskRect.Top();\n\n pParent->SetPosSizePixel( aPos, aSize );\n }\n else\n pParent->SetSizePixel( aSize );\n }\n else\n {\n \/\/ Dialogbox anpassen\n aSize.Height() -= nDeltaPixel;\n pParent->SetSizePixel( aSize );\n\n \/\/ Fenster nicht mehr anzeigen\n while ( pWindow )\n {\n pWindow->Hide();\n pWindow = mpItemList->Next();\n }\n }\n}\n\n\/\/ -----------------------------------------------------------------------\n\nvoid MoreButton::AddWindow( Window* pWindow )\n{\n if ( !mpItemList )\n mpItemList = new ImplMoreWindowList( 1024, 16, 16 );\n\n mpItemList->Insert( pWindow, LIST_APPEND );\n\n if ( mbState )\n pWindow->Show();\n else\n pWindow->Hide();\n}\n\n\/\/ -----------------------------------------------------------------------\n\nvoid MoreButton::RemoveWindow( Window* pWindow )\n{\n if ( mpItemList )\n mpItemList->Remove( pWindow );\n}\n\n\/\/ -----------------------------------------------------------------------\n\nvoid MoreButton::SetText( const XubString& rText )\n{\n XubString aText = rText;\n\n if ( !mbState )\n aText.AppendAscii( aImplMoreOpen );\n else\n aText.AppendAscii( aImplMoreClose );\n\n PushButton::SetText( aText );\n}\n\n\/\/ -----------------------------------------------------------------------\n\nXubString MoreButton::GetText() const\n{\n XubString aText = PushButton::GetText();\n\n XubString aSubText = aText.Copy( aText.Len()-EXTRA_TEXTLEN, EXTRA_TEXTLEN );\n if ( !mbState )\n {\n if ( aSubText.EqualsAscii( aImplMoreOpen ) )\n aText.Erase( aText.Len()-EXTRA_TEXTLEN, EXTRA_TEXTLEN );\n }\n else\n {\n if ( aSubText.EqualsAscii( aImplMoreClose ) )\n aText.Erase( aText.Len()-EXTRA_TEXTLEN, EXTRA_TEXTLEN );\n }\n\n return aText;\n}\n<commit_msg>INTEGRATION: CWS pbfinal01 (1.4.52); FILE MERGED 2005\/02\/16 13:57:48 pb 1.4.52.1: fix: #i39798# MoreButton with image<commit_after>\/*************************************************************************\n *\n * $RCSfile: morebtn.cxx,v $\n *\n * $Revision: 1.5 $\n *\n * last change: $Author: vg $ $Date: 2005-02-25 13:11:09 $\n *\n * The Contents of this file are made available subject to the terms of\n * either of the following licenses\n *\n * - GNU Lesser General Public License Version 2.1\n * - Sun Industry Standards Source License Version 1.1\n *\n * Sun Microsystems Inc., October, 2000\n *\n * GNU Lesser General Public License Version 2.1\n * =============================================\n * Copyright 2000 by Sun Microsystems, Inc.\n * 901 San Antonio Road, Palo Alto, CA 94303, USA\n *\n * This library is free software; you can redistribute it and\/or\n * modify it under the terms of the GNU Lesser General Public\n * License version 2.1, as published by the Free Software Foundation.\n *\n * This library is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU\n * Lesser General Public License for more details.\n *\n * You should have received a copy of the GNU Lesser General Public\n * License along with this library; if not, write to the Free Software\n * Foundation, Inc., 59 Temple Place, Suite 330, Boston,\n * MA 02111-1307 USA\n *\n *\n * Sun Industry Standards Source License Version 1.1\n * =================================================\n * The contents of this file are subject to the Sun Industry Standards\n * Source License Version 1.1 (the \"License\"); You may not use this file\n * except in compliance with the License. You may obtain a copy of the\n * License at http:\/\/www.openoffice.org\/license.html.\n *\n * Software provided under this License is provided on an \"AS IS\" basis,\n * WITHOUT WARRANTY OF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING,\n * WITHOUT LIMITATION, WARRANTIES THAT THE SOFTWARE IS FREE OF DEFECTS,\n * MERCHANTABLE, FIT FOR A PARTICULAR PURPOSE, OR NON-INFRINGING.\n * See the License for the specific provisions governing your rights and\n * obligations concerning the Software.\n *\n * The Initial Developer of the Original Code is: Sun Microsystems, Inc.\n *\n * Copyright: 2000 by Sun Microsystems, Inc.\n *\n * All Rights Reserved.\n *\n * Contributor(s): _______________________________________\n *\n *\n ************************************************************************\/\n\n#ifndef _SV_MOREBTN_HXX\n#include <morebtn.hxx>\n#endif\n\n#ifndef _SV_RD_H\n#include <tools\/rc.h>\n#endif\n\n\n\n\/\/ =======================================================================\n\nDECLARE_LIST( ImplMoreWindowList, Window* );\n\nstruct ImplMoreButtonData\n{\n ImplMoreWindowList *mpItemList;\n XubString maMoreText;\n XubString maLessText;\n};\n\n\/\/ =======================================================================\n\nvoid MoreButton::ImplInit( Window* pParent, WinBits nStyle )\n{\n mpMBData = new ImplMoreButtonData;\n mnDelta = 0;\n meUnit = MAP_PIXEL;\n mbState = FALSE;\n\n mpMBData->mpItemList = NULL;\n\n PushButton::ImplInit( pParent, nStyle );\n\n mpMBData->maMoreText = Button::GetStandardText( BUTTON_MORE );\n mpMBData->maLessText = Button::GetStandardText( BUTTON_LESS );\n\n SetHelpText( Button::GetStandardHelpText( BUTTON_MORE ) );\n\n ShowState();\n\n SetSymbolAlign( SYMBOLALIGN_RIGHT );\n ImplSetSmallSymbol( TRUE );\n\n if ( ! ( nStyle & ( WB_RIGHT | WB_LEFT ) ) )\n {\n nStyle |= WB_CENTER;\n SetStyle( nStyle );\n }\n}\n\n\/\/ -----------------------------------------------------------------------\nvoid MoreButton::ShowState()\n{\n if ( mbState )\n {\n SetSymbol( SYMBOL_PAGEUP );\n SetText( mpMBData->maLessText );\n }\n else\n {\n SetSymbol( SYMBOL_PAGEDOWN );\n SetText( mpMBData->maMoreText );\n }\n}\n\n\/\/ -----------------------------------------------------------------------\n\nMoreButton::MoreButton( Window* pParent, WinBits nStyle ) :\n PushButton( WINDOW_MOREBUTTON )\n{\n ImplInit( pParent, nStyle );\n}\n\n\/\/ -----------------------------------------------------------------------\n\nMoreButton::MoreButton( Window* pParent, const ResId& rResId ) :\n PushButton( WINDOW_MOREBUTTON )\n{\n rResId.SetRT( RSC_MOREBUTTON );\n WinBits nStyle = ImplInitRes( rResId );\n ImplInit( pParent, nStyle );\n ImplLoadRes( rResId );\n\n if ( !(nStyle & WB_HIDE) )\n Show();\n}\n\n\/\/ -----------------------------------------------------------------------\n\nvoid MoreButton::ImplLoadRes( const ResId& rResId )\n{\n PushButton::ImplLoadRes( rResId );\n\n ULONG nObjMask = ReadLongRes();\n\n if ( nObjMask & RSC_MOREBUTTON_STATE )\n {\n \/\/ Nicht Methode rufen, da Dialog nicht umgeschaltet werden soll\n mbState = (BOOL)ReadShortRes();\n \/\/ SetText( GetText() );\n ShowState();\n }\n if ( nObjMask & RSC_MOREBUTTON_MAPUNIT )\n meUnit = (MapUnit)ReadLongRes();\n if ( nObjMask & RSC_MOREBUTTON_DELTA )\n \/\/ Groesse fuer Erweitern des Dialogs\n mnDelta = ReadShortRes();\n}\n\n\/\/ -----------------------------------------------------------------------\n\nMoreButton::~MoreButton()\n{\n if ( mpMBData->mpItemList )\n delete mpMBData->mpItemList;\n delete mpMBData;\n}\n\n\/\/ -----------------------------------------------------------------------\n\nvoid MoreButton::Click()\n{\n Window* pParent = GetParent();\n Size aSize( pParent->GetSizePixel() );\n Window* pWindow = (mpMBData->mpItemList) ? mpMBData->mpItemList->First() : NULL;\n long nDeltaPixel = LogicToPixel( Size( 0, mnDelta ), meUnit ).Height();\n\n \/\/ Status aendern\n mbState = !mbState;\n ShowState();\n\n \/\/ Hier den Click-Handler rufen, damit vorher die Controls initialisiert\n \/\/ werden koennen\n PushButton::Click();\n\n \/\/ Je nach Status die Fenster updaten\n if ( mbState )\n {\n \/\/ Fenster anzeigen\n while ( pWindow )\n {\n pWindow->Show();\n pWindow = mpMBData->mpItemList->Next();\n }\n\n \/\/ Dialogbox anpassen\n Point aPos( pParent->GetPosPixel() );\n Rectangle aDeskRect( pParent->ImplGetFrameWindow()->GetDesktopRectPixel() );\n\n aSize.Height() += nDeltaPixel;\n if ( (aPos.Y()+aSize.Height()) > aDeskRect.Bottom() )\n {\n aPos.Y() = aDeskRect.Bottom()-aSize.Height();\n\n if ( aPos.Y() < aDeskRect.Top() )\n aPos.Y() = aDeskRect.Top();\n\n pParent->SetPosSizePixel( aPos, aSize );\n }\n else\n pParent->SetSizePixel( aSize );\n }\n else\n {\n \/\/ Dialogbox anpassen\n aSize.Height() -= nDeltaPixel;\n pParent->SetSizePixel( aSize );\n\n \/\/ Fenster nicht mehr anzeigen\n while ( pWindow )\n {\n pWindow->Hide();\n pWindow = mpMBData->mpItemList->Next();\n }\n }\n}\n\n\/\/ -----------------------------------------------------------------------\n\nvoid MoreButton::AddWindow( Window* pWindow )\n{\n if ( !mpMBData->mpItemList )\n mpMBData->mpItemList = new ImplMoreWindowList( 1024, 16, 16 );\n\n mpMBData->mpItemList->Insert( pWindow, LIST_APPEND );\n\n if ( mbState )\n pWindow->Show();\n else\n pWindow->Hide();\n}\n\n\/\/ -----------------------------------------------------------------------\n\nvoid MoreButton::RemoveWindow( Window* pWindow )\n{\n if ( mpMBData->mpItemList )\n mpMBData->mpItemList->Remove( pWindow );\n}\n\n\/\/ -----------------------------------------------------------------------\n\nvoid MoreButton::SetText( const XubString& rText )\n{\n PushButton::SetText( rText );\n}\n\n\/\/ -----------------------------------------------------------------------\n\nXubString MoreButton::GetText() const\n{\n return PushButton::GetText();\n}\n\n\/\/ -----------------------------------------------------------------------\nvoid MoreButton::SetMoreText( const XubString& rText )\n{\n if ( mpMBData )\n mpMBData->maMoreText = rText;\n\n if ( !mbState )\n SetText( rText );\n}\n\n\/\/ -----------------------------------------------------------------------\nXubString MoreButton::GetMoreText() const\n{\n if ( mpMBData )\n return mpMBData->maMoreText;\n else\n return PushButton::GetText();\n}\n\n\/\/ -----------------------------------------------------------------------\nvoid MoreButton::SetLessText( const XubString& rText )\n{\n if ( mpMBData )\n mpMBData->maLessText = rText;\n\n if ( mbState )\n SetText( rText );\n}\n\n\/\/ -----------------------------------------------------------------------\nXubString MoreButton::GetLessText() const\n{\n if ( mpMBData )\n return mpMBData->maLessText;\n else\n return PushButton::GetText();\n}\n\n<|endoftext|>"} {"text":"<commit_before>\/*************************************************************************\n *\n * OpenOffice.org - a multi-platform office productivity suite\n *\n * $RCSfile: spinbtn.cxx,v $\n *\n * $Revision: 1.9 $\n *\n * last change: $Author: hr $ $Date: 2006-01-26 18:08: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 _TOOLS_RCID_H\n#include <tools\/rcid.h>\n#endif\n#ifndef _SV_SPIN_H\n#include <spin.h>\n#endif\n#ifndef _SV_EVENT_HXX\n#include <event.hxx>\n#endif\n#ifndef _SV_SPIN_HXX\n#include <spin.hxx>\n#endif\n\n\/\/ =======================================================================\n\nvoid SpinButton::ImplInit( Window* pParent, WinBits nStyle )\n{\n mbUpperIn = FALSE;\n mbLowerIn = FALSE;\n mbInitialUp = FALSE;\n mbInitialDown = FALSE;\n\n mnMinRange = 0;\n mnMaxRange = 100;\n mnValue = 0;\n mnValueStep = 1;\n\n maRepeatTimer.SetTimeout( GetSettings().GetMouseSettings().GetButtonStartRepeat() );\n maRepeatTimer.SetTimeoutHdl( LINK( this, SpinButton, ImplTimeout ) );\n\n mbRepeat = 0 != ( nStyle & WB_REPEAT );\n\n if ( nStyle & WB_HSCROLL )\n mbHorz = TRUE;\n else\n mbHorz = FALSE;\n\n Control::ImplInit( pParent, nStyle, NULL );\n}\n\n\/\/ -----------------------------------------------------------------------\n\nSpinButton::SpinButton( Window* pParent, WinBits nStyle )\n :Control( WINDOW_SPINBUTTON )\n ,mbUpperIsFocused( FALSE )\n{\n ImplInit( pParent, nStyle );\n}\n\n\/\/ -----------------------------------------------------------------------\n\nSpinButton::SpinButton( Window* pParent, const ResId& rResId )\n :Control( WINDOW_SPINBUTTON )\n ,mbUpperIsFocused( FALSE )\n{\n rResId.SetRT( RSC_SPINBUTTON );\n ImplInit( pParent, ImplInitRes( rResId ) );\n ImplLoadRes( rResId );\n Resize();\n}\n\n\/\/ -----------------------------------------------------------------------\n\nSpinButton::~SpinButton()\n{\n}\n\n\/\/ -----------------------------------------------------------------------\n\nIMPL_LINK( SpinButton, ImplTimeout, Timer*, pTimer )\n{\n if ( pTimer->GetTimeout() == GetSettings().GetMouseSettings().GetButtonStartRepeat() )\n {\n pTimer->SetTimeout( GetSettings().GetMouseSettings().GetButtonRepeat() );\n pTimer->Start();\n }\n else\n {\n if ( mbInitialUp )\n Up();\n else\n Down();\n }\n\n return 0;\n}\n\n\/\/ -----------------------------------------------------------------------\n\nvoid SpinButton::Up()\n{\n if ( ImplIsUpperEnabled() )\n {\n mnValue += mnValueStep;\n StateChanged( STATE_CHANGE_DATA );\n\n ImplMoveFocus( TRUE );\n }\n\n ImplCallEventListenersAndHandler( VCLEVENT_SPINBUTTON_UP, maUpHdlLink, this );\n}\n\n\/\/ -----------------------------------------------------------------------\n\nvoid SpinButton::Down()\n{\n if ( ImplIsLowerEnabled() )\n {\n mnValue -= mnValueStep;\n StateChanged( STATE_CHANGE_DATA );\n\n ImplMoveFocus( FALSE );\n }\n\n ImplCallEventListenersAndHandler( VCLEVENT_SPINBUTTON_DOWN, maDownHdlLink, this );\n}\n\n\/\/ -----------------------------------------------------------------------\n\nvoid SpinButton::Resize()\n{\n Control::Resize();\n\n Size aSize( GetOutputSizePixel() );\n Point aTmpPoint;\n Rectangle aRect( aTmpPoint, aSize );\n if ( mbHorz )\n {\n maLowerRect = Rectangle( 0, 0, aSize.Width()\/2, aSize.Height()-1 );\n maUpperRect = Rectangle( maLowerRect.TopRight(), aRect.BottomRight() );\n }\n else\n {\n maUpperRect = Rectangle( 0, 0, aSize.Width()-1, aSize.Height()\/2 );\n maLowerRect = Rectangle( maUpperRect.BottomLeft(), aRect.BottomRight() );\n }\n\n ImplCalcFocusRect( ImplIsUpperEnabled() || !ImplIsLowerEnabled() );\n\n Invalidate();\n}\n\n\/\/ -----------------------------------------------------------------------\n\nvoid SpinButton::Draw( OutputDevice* pDev, const Point& rPos, const Size& rSize, ULONG nFlags )\n{\n Point aPos = pDev->LogicToPixel( rPos );\n Size aSize = pDev->LogicToPixel( rSize );\n\n pDev->Push();\n pDev->SetMapMode();\n if ( !(nFlags & WINDOW_DRAW_MONO) )\n {\n \/\/ DecoView uses the FaceColor...\n AllSettings aSettings = pDev->GetSettings();\n StyleSettings aStyleSettings = aSettings.GetStyleSettings();\n if ( IsControlBackground() )\n aStyleSettings.SetFaceColor( GetControlBackground() );\n else\n aStyleSettings.SetFaceColor( GetSettings().GetStyleSettings().GetFaceColor() );\n\n aSettings.SetStyleSettings( aStyleSettings );\n pDev->SetSettings( aSettings );\n }\n\n Rectangle aRect( Point( 0, 0 ), aSize );\n Rectangle aLowerRect, aUpperRect;\n if ( mbHorz )\n {\n aLowerRect = Rectangle( 0, 0, aSize.Width()\/2, aSize.Height()-1 );\n aUpperRect = Rectangle( aLowerRect.TopRight(), aRect.BottomRight() );\n }\n else\n {\n aUpperRect = Rectangle( 0, 0, aSize.Width()-1, aSize.Height()\/2 );\n aLowerRect = Rectangle( aUpperRect.BottomLeft(), aRect.BottomRight() );\n }\n\n aUpperRect += aPos;\n aLowerRect += aPos;\n\n ImplDrawSpinButton( pDev, aUpperRect, aLowerRect, FALSE, FALSE,\n IsEnabled() && ImplIsUpperEnabled(),\n IsEnabled() && ImplIsLowerEnabled(), mbHorz, TRUE );\n pDev->Pop();\n}\n\n\nvoid SpinButton::Paint( const Rectangle& )\n{\n HideFocus();\n\n BOOL bEnable = IsEnabled();\n ImplDrawSpinButton( this, maUpperRect, maLowerRect, mbUpperIn, mbLowerIn,\n bEnable && ImplIsUpperEnabled(),\n bEnable && ImplIsLowerEnabled(), mbHorz, TRUE );\n\n if ( HasFocus() )\n ShowFocus( maFocusRect );\n}\n\n\/\/ -----------------------------------------------------------------------\n\nvoid SpinButton::MouseButtonDown( const MouseEvent& rMEvt )\n{\n if ( maUpperRect.IsInside( rMEvt.GetPosPixel() ) && ( ImplIsUpperEnabled() ) )\n {\n mbUpperIn = TRUE;\n mbInitialUp = TRUE;\n Invalidate( maUpperRect );\n }\n else if ( maLowerRect.IsInside( rMEvt.GetPosPixel() ) && ( ImplIsLowerEnabled() ) )\n {\n mbLowerIn = TRUE;\n mbInitialDown = TRUE;\n Invalidate( maLowerRect );\n }\n\n if ( mbUpperIn || mbLowerIn )\n {\n Update();\n CaptureMouse();\n if ( mbRepeat )\n maRepeatTimer.Start();\n }\n}\n\n\/\/ -----------------------------------------------------------------------\n\nvoid SpinButton::MouseButtonUp( const MouseEvent& )\n{\n ReleaseMouse();\n if ( mbRepeat )\n {\n maRepeatTimer.Stop();\n maRepeatTimer.SetTimeout(GetSettings().GetMouseSettings().GetButtonStartRepeat() );\n }\n\n if ( mbUpperIn )\n {\n mbUpperIn = FALSE;\n Invalidate( maUpperRect );\n Update();\n Up();\n }\n else if ( mbLowerIn )\n {\n mbLowerIn = FALSE;\n Invalidate( maLowerRect );\n Update();\n Down();\n }\n\n mbInitialUp = mbInitialDown = FALSE;\n}\n\n\/\/ -----------------------------------------------------------------------\n\nvoid SpinButton::MouseMove( const MouseEvent& rMEvt )\n{\n if ( !rMEvt.IsLeft() || (!mbInitialUp && !mbInitialDown) )\n return;\n\n if ( !maUpperRect.IsInside( rMEvt.GetPosPixel() ) &&\n mbUpperIn && mbInitialUp )\n {\n mbUpperIn = FALSE;\n maRepeatTimer.Stop();\n Invalidate( maUpperRect );\n Update();\n }\n else if ( !maLowerRect.IsInside( rMEvt.GetPosPixel() ) &&\n mbLowerIn & mbInitialDown )\n {\n mbLowerIn = FALSE;\n maRepeatTimer.Stop();\n Invalidate( maLowerRect );\n Update();\n }\n else if ( maUpperRect.IsInside( rMEvt.GetPosPixel() ) &&\n !mbUpperIn && mbInitialUp )\n {\n mbUpperIn = TRUE;\n if ( mbRepeat )\n maRepeatTimer.Start();\n Invalidate( maUpperRect );\n Update();\n }\n else if ( maLowerRect.IsInside( rMEvt.GetPosPixel() ) &&\n !mbLowerIn && mbInitialDown )\n {\n mbLowerIn = TRUE;\n if ( mbRepeat )\n maRepeatTimer.Start();\n Invalidate( maLowerRect );\n Update();\n }\n}\n\n\/\/ -----------------------------------------------------------------------\n\nvoid SpinButton::KeyInput( const KeyEvent& rKEvt )\n{\n KeyCode aCode = rKEvt.GetKeyCode();\n\n if ( !rKEvt.GetKeyCode().GetModifier() )\n {\n switch ( rKEvt.GetKeyCode().GetCode() )\n {\n case KEY_LEFT:\n case KEY_RIGHT:\n {\n BOOL bUp = KEY_RIGHT == rKEvt.GetKeyCode().GetCode();\n if ( mbHorz && !ImplMoveFocus( bUp ) )\n bUp ? Up() : Down();\n }\n break;\n\n case KEY_UP:\n case KEY_DOWN:\n {\n BOOL bUp = KEY_UP == rKEvt.GetKeyCode().GetCode();\n if ( !mbHorz && !ImplMoveFocus( KEY_UP == rKEvt.GetKeyCode().GetCode() ) )\n bUp ? Up() : Down();\n }\n break;\n\n case KEY_SPACE:\n mbUpperIsFocused ? Up() : Down();\n break;\n\n default:\n Control::KeyInput( rKEvt );\n break;\n }\n }\n else\n Control::KeyInput( rKEvt );\n}\n\n\/\/ -----------------------------------------------------------------------\n\nvoid SpinButton::StateChanged( StateChangedType nType )\n{\n switch ( nType )\n {\n case STATE_CHANGE_DATA:\n case STATE_CHANGE_ENABLE:\n Invalidate();\n break;\n\n case STATE_CHANGE_STYLE:\n {\n BOOL bNewRepeat = 0 != ( GetStyle() & WB_REPEAT );\n if ( bNewRepeat != mbRepeat )\n {\n if ( maRepeatTimer.IsActive() )\n {\n maRepeatTimer.Stop();\n maRepeatTimer.SetTimeout( GetSettings().GetMouseSettings().GetButtonStartRepeat() );\n }\n mbRepeat = bNewRepeat;\n }\n\n BOOL bNewHorz = 0 != ( GetStyle() & WB_HSCROLL );\n if ( bNewHorz != mbHorz )\n {\n mbHorz = bNewHorz;\n Resize();\n }\n }\n break;\n }\n\n Control::StateChanged( nType );\n}\n\n\/\/ -----------------------------------------------------------------------\n\nvoid SpinButton::SetRangeMin( long nNewRange )\n{\n SetRange( Range( nNewRange, GetRangeMax() ) );\n}\n\n\/\/ -----------------------------------------------------------------------\n\nvoid SpinButton::SetRangeMax( long nNewRange )\n{\n SetRange( Range( GetRangeMin(), nNewRange ) );\n}\n\n\/\/ -----------------------------------------------------------------------\n\nvoid SpinButton::SetRange( const Range& rRange )\n{\n \/\/ adjust rage\n Range aRange = rRange;\n aRange.Justify();\n long nNewMinRange = aRange.Min();\n long nNewMaxRange = aRange.Max();\n\n \/\/ do something only if old and new range differ\n if ( (mnMinRange != nNewMinRange) ||\n (mnMaxRange != nNewMaxRange) )\n {\n mnMinRange = nNewMinRange;\n mnMaxRange = nNewMaxRange;\n\n \/\/ adjust value to new range, if necessary\n if ( mnValue > mnMaxRange )\n mnValue = mnMaxRange;\n if ( mnValue < mnMinRange )\n mnValue = mnMinRange;\n\n StateChanged( STATE_CHANGE_DATA );\n }\n}\n\n\/\/ -----------------------------------------------------------------------\n\nvoid SpinButton::SetValue( long nValue )\n{\n \/\/ adjust, if necessary\n if ( nValue > mnMaxRange )\n nValue = mnMaxRange;\n if ( nValue < mnMinRange )\n nValue = mnMinRange;\n\n if ( mnValue != nValue )\n {\n mnValue = nValue;\n StateChanged( STATE_CHANGE_DATA );\n }\n}\n\n\/\/ -----------------------------------------------------------------------\n\nvoid SpinButton::GetFocus()\n{\n ShowFocus( maFocusRect );\n Control::GetFocus();\n}\n\n\/\/ -----------------------------------------------------------------------\n\nvoid SpinButton::LoseFocus()\n{\n HideFocus();\n Control::LoseFocus();\n}\n\n\/\/ -----------------------------------------------------------------------\n\nBOOL SpinButton::ImplMoveFocus( BOOL _bUpper )\n{\n if ( _bUpper == mbUpperIsFocused )\n return FALSE;\n\n HideFocus();\n ImplCalcFocusRect( _bUpper );\n if ( HasFocus() )\n ShowFocus( maFocusRect );\n return TRUE;\n}\n\n\/\/ -----------------------------------------------------------------------\n\nvoid SpinButton::ImplCalcFocusRect( BOOL _bUpper )\n{\n maFocusRect = _bUpper ? maUpperRect : maLowerRect;\n \/\/ inflate by some pixels\n maFocusRect.Left() += 2;\n maFocusRect.Top() += 2;\n maFocusRect.Right() -= 2;\n maFocusRect.Bottom() -= 2;\n mbUpperIsFocused = _bUpper;\n}\n\n\/\/ -----------------------------------------------------------------------\n\nRectangle* SpinButton::ImplFindPartRect( const Point& rPt )\n{\n if( maUpperRect.IsInside( rPt ) )\n return &maUpperRect;\n else if( maLowerRect.IsInside( rPt ) )\n return &maLowerRect;\n else\n return NULL;\n}\n\nlong SpinButton::PreNotify( NotifyEvent& rNEvt )\n{\n long nDone = 0;\n const MouseEvent* pMouseEvt = NULL;\n\n if( (rNEvt.GetType() == EVENT_MOUSEMOVE) && (pMouseEvt = rNEvt.GetMouseEvent()) )\n {\n if( !pMouseEvt->GetButtons() && !pMouseEvt->IsSynthetic() && !pMouseEvt->IsModifierChanged() )\n {\n \/\/ trigger redraw if mouse over state has changed\n if( IsNativeControlSupported(CTRL_SPINBOX, PART_ENTIRE_CONTROL) ||\n IsNativeControlSupported(CTRL_SPINBOX, PART_ALL_BUTTONS) )\n {\n Rectangle* pRect = ImplFindPartRect( GetPointerPosPixel() );\n Rectangle* pLastRect = ImplFindPartRect( GetLastPointerPosPixel() );\n if( pRect != pLastRect || (pMouseEvt->IsLeaveWindow() || pMouseEvt->IsEnterWindow()) )\n {\n Region aRgn( GetActiveClipRegion() );\n if( pLastRect )\n {\n SetClipRegion( *pLastRect );\n Paint( *pLastRect );\n SetClipRegion( aRgn );\n }\n if( pRect )\n {\n SetClipRegion( *pRect );\n Paint( *pRect );\n SetClipRegion( aRgn );\n }\n }\n }\n }\n }\n\n return nDone ? nDone : Control::PreNotify(rNEvt);\n}\n\n\/\/ -----------------------------------------------------------------------\n<commit_msg>INTEGRATION: CWS warnings01 (1.8.70); FILE MERGED 2006\/04\/07 18:47:52 sb 1.8.70.2: RESYNC: (1.8-1.9); FILE MERGED 2006\/03\/17 16:12:41 pl 1.8.70.1: #i55991# removed warnings for windows platform<commit_after>\/*************************************************************************\n *\n * OpenOffice.org - a multi-platform office productivity suite\n *\n * $RCSfile: spinbtn.cxx,v $\n *\n * $Revision: 1.10 $\n *\n * last change: $Author: hr $ $Date: 2006-06-19 19:19: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#ifndef _TOOLS_RCID_H\n#include <tools\/rcid.h>\n#endif\n#ifndef _SV_SPIN_H\n#include <spin.h>\n#endif\n#ifndef _SV_EVENT_HXX\n#include <event.hxx>\n#endif\n#ifndef _SV_SPIN_HXX\n#include <spin.hxx>\n#endif\n\n\/\/ =======================================================================\n\nvoid SpinButton::ImplInit( Window* pParent, WinBits nStyle )\n{\n mbUpperIn = FALSE;\n mbLowerIn = FALSE;\n mbInitialUp = FALSE;\n mbInitialDown = FALSE;\n\n mnMinRange = 0;\n mnMaxRange = 100;\n mnValue = 0;\n mnValueStep = 1;\n\n maRepeatTimer.SetTimeout( GetSettings().GetMouseSettings().GetButtonStartRepeat() );\n maRepeatTimer.SetTimeoutHdl( LINK( this, SpinButton, ImplTimeout ) );\n\n mbRepeat = 0 != ( nStyle & WB_REPEAT );\n\n if ( nStyle & WB_HSCROLL )\n mbHorz = TRUE;\n else\n mbHorz = FALSE;\n\n Control::ImplInit( pParent, nStyle, NULL );\n}\n\n\/\/ -----------------------------------------------------------------------\n\nSpinButton::SpinButton( Window* pParent, WinBits nStyle )\n :Control( WINDOW_SPINBUTTON )\n ,mbUpperIsFocused( FALSE )\n{\n ImplInit( pParent, nStyle );\n}\n\n\/\/ -----------------------------------------------------------------------\n\nSpinButton::SpinButton( Window* pParent, const ResId& rResId )\n :Control( WINDOW_SPINBUTTON )\n ,mbUpperIsFocused( FALSE )\n{\n rResId.SetRT( RSC_SPINBUTTON );\n ImplInit( pParent, ImplInitRes( rResId ) );\n ImplLoadRes( rResId );\n Resize();\n}\n\n\/\/ -----------------------------------------------------------------------\n\nSpinButton::~SpinButton()\n{\n}\n\n\/\/ -----------------------------------------------------------------------\n\nIMPL_LINK( SpinButton, ImplTimeout, Timer*, pTimer )\n{\n if ( pTimer->GetTimeout() == GetSettings().GetMouseSettings().GetButtonStartRepeat() )\n {\n pTimer->SetTimeout( GetSettings().GetMouseSettings().GetButtonRepeat() );\n pTimer->Start();\n }\n else\n {\n if ( mbInitialUp )\n Up();\n else\n Down();\n }\n\n return 0;\n}\n\n\/\/ -----------------------------------------------------------------------\n\nvoid SpinButton::Up()\n{\n if ( ImplIsUpperEnabled() )\n {\n mnValue += mnValueStep;\n StateChanged( STATE_CHANGE_DATA );\n\n ImplMoveFocus( TRUE );\n }\n\n ImplCallEventListenersAndHandler( VCLEVENT_SPINBUTTON_UP, maUpHdlLink, this );\n}\n\n\/\/ -----------------------------------------------------------------------\n\nvoid SpinButton::Down()\n{\n if ( ImplIsLowerEnabled() )\n {\n mnValue -= mnValueStep;\n StateChanged( STATE_CHANGE_DATA );\n\n ImplMoveFocus( FALSE );\n }\n\n ImplCallEventListenersAndHandler( VCLEVENT_SPINBUTTON_DOWN, maDownHdlLink, this );\n}\n\n\/\/ -----------------------------------------------------------------------\n\nvoid SpinButton::Resize()\n{\n Control::Resize();\n\n Size aSize( GetOutputSizePixel() );\n Point aTmpPoint;\n Rectangle aRect( aTmpPoint, aSize );\n if ( mbHorz )\n {\n maLowerRect = Rectangle( 0, 0, aSize.Width()\/2, aSize.Height()-1 );\n maUpperRect = Rectangle( maLowerRect.TopRight(), aRect.BottomRight() );\n }\n else\n {\n maUpperRect = Rectangle( 0, 0, aSize.Width()-1, aSize.Height()\/2 );\n maLowerRect = Rectangle( maUpperRect.BottomLeft(), aRect.BottomRight() );\n }\n\n ImplCalcFocusRect( ImplIsUpperEnabled() || !ImplIsLowerEnabled() );\n\n Invalidate();\n}\n\n\/\/ -----------------------------------------------------------------------\n\nvoid SpinButton::Draw( OutputDevice* pDev, const Point& rPos, const Size& rSize, ULONG nFlags )\n{\n Point aPos = pDev->LogicToPixel( rPos );\n Size aSize = pDev->LogicToPixel( rSize );\n\n pDev->Push();\n pDev->SetMapMode();\n if ( !(nFlags & WINDOW_DRAW_MONO) )\n {\n \/\/ DecoView uses the FaceColor...\n AllSettings aSettings = pDev->GetSettings();\n StyleSettings aStyleSettings = aSettings.GetStyleSettings();\n if ( IsControlBackground() )\n aStyleSettings.SetFaceColor( GetControlBackground() );\n else\n aStyleSettings.SetFaceColor( GetSettings().GetStyleSettings().GetFaceColor() );\n\n aSettings.SetStyleSettings( aStyleSettings );\n pDev->SetSettings( aSettings );\n }\n\n Rectangle aRect( Point( 0, 0 ), aSize );\n Rectangle aLowerRect, aUpperRect;\n if ( mbHorz )\n {\n aLowerRect = Rectangle( 0, 0, aSize.Width()\/2, aSize.Height()-1 );\n aUpperRect = Rectangle( aLowerRect.TopRight(), aRect.BottomRight() );\n }\n else\n {\n aUpperRect = Rectangle( 0, 0, aSize.Width()-1, aSize.Height()\/2 );\n aLowerRect = Rectangle( aUpperRect.BottomLeft(), aRect.BottomRight() );\n }\n\n aUpperRect += aPos;\n aLowerRect += aPos;\n\n ImplDrawSpinButton( pDev, aUpperRect, aLowerRect, FALSE, FALSE,\n IsEnabled() && ImplIsUpperEnabled(),\n IsEnabled() && ImplIsLowerEnabled(), mbHorz, TRUE );\n pDev->Pop();\n}\n\n\nvoid SpinButton::Paint( const Rectangle& )\n{\n HideFocus();\n\n BOOL bEnable = IsEnabled();\n ImplDrawSpinButton( this, maUpperRect, maLowerRect, mbUpperIn, mbLowerIn,\n bEnable && ImplIsUpperEnabled(),\n bEnable && ImplIsLowerEnabled(), mbHorz, TRUE );\n\n if ( HasFocus() )\n ShowFocus( maFocusRect );\n}\n\n\/\/ -----------------------------------------------------------------------\n\nvoid SpinButton::MouseButtonDown( const MouseEvent& rMEvt )\n{\n if ( maUpperRect.IsInside( rMEvt.GetPosPixel() ) && ( ImplIsUpperEnabled() ) )\n {\n mbUpperIn = TRUE;\n mbInitialUp = TRUE;\n Invalidate( maUpperRect );\n }\n else if ( maLowerRect.IsInside( rMEvt.GetPosPixel() ) && ( ImplIsLowerEnabled() ) )\n {\n mbLowerIn = TRUE;\n mbInitialDown = TRUE;\n Invalidate( maLowerRect );\n }\n\n if ( mbUpperIn || mbLowerIn )\n {\n Update();\n CaptureMouse();\n if ( mbRepeat )\n maRepeatTimer.Start();\n }\n}\n\n\/\/ -----------------------------------------------------------------------\n\nvoid SpinButton::MouseButtonUp( const MouseEvent& )\n{\n ReleaseMouse();\n if ( mbRepeat )\n {\n maRepeatTimer.Stop();\n maRepeatTimer.SetTimeout(GetSettings().GetMouseSettings().GetButtonStartRepeat() );\n }\n\n if ( mbUpperIn )\n {\n mbUpperIn = FALSE;\n Invalidate( maUpperRect );\n Update();\n Up();\n }\n else if ( mbLowerIn )\n {\n mbLowerIn = FALSE;\n Invalidate( maLowerRect );\n Update();\n Down();\n }\n\n mbInitialUp = mbInitialDown = FALSE;\n}\n\n\/\/ -----------------------------------------------------------------------\n\nvoid SpinButton::MouseMove( const MouseEvent& rMEvt )\n{\n if ( !rMEvt.IsLeft() || (!mbInitialUp && !mbInitialDown) )\n return;\n\n if ( !maUpperRect.IsInside( rMEvt.GetPosPixel() ) &&\n mbUpperIn && mbInitialUp )\n {\n mbUpperIn = FALSE;\n maRepeatTimer.Stop();\n Invalidate( maUpperRect );\n Update();\n }\n else if ( !maLowerRect.IsInside( rMEvt.GetPosPixel() ) &&\n mbLowerIn & mbInitialDown )\n {\n mbLowerIn = FALSE;\n maRepeatTimer.Stop();\n Invalidate( maLowerRect );\n Update();\n }\n else if ( maUpperRect.IsInside( rMEvt.GetPosPixel() ) &&\n !mbUpperIn && mbInitialUp )\n {\n mbUpperIn = TRUE;\n if ( mbRepeat )\n maRepeatTimer.Start();\n Invalidate( maUpperRect );\n Update();\n }\n else if ( maLowerRect.IsInside( rMEvt.GetPosPixel() ) &&\n !mbLowerIn && mbInitialDown )\n {\n mbLowerIn = TRUE;\n if ( mbRepeat )\n maRepeatTimer.Start();\n Invalidate( maLowerRect );\n Update();\n }\n}\n\n\/\/ -----------------------------------------------------------------------\n\nvoid SpinButton::KeyInput( const KeyEvent& rKEvt )\n{\n KeyCode aCode = rKEvt.GetKeyCode();\n\n if ( !rKEvt.GetKeyCode().GetModifier() )\n {\n switch ( rKEvt.GetKeyCode().GetCode() )\n {\n case KEY_LEFT:\n case KEY_RIGHT:\n {\n BOOL bUp = KEY_RIGHT == rKEvt.GetKeyCode().GetCode();\n if ( mbHorz && !ImplMoveFocus( bUp ) )\n bUp ? Up() : Down();\n }\n break;\n\n case KEY_UP:\n case KEY_DOWN:\n {\n BOOL bUp = KEY_UP == rKEvt.GetKeyCode().GetCode();\n if ( !mbHorz && !ImplMoveFocus( KEY_UP == rKEvt.GetKeyCode().GetCode() ) )\n bUp ? Up() : Down();\n }\n break;\n\n case KEY_SPACE:\n mbUpperIsFocused ? Up() : Down();\n break;\n\n default:\n Control::KeyInput( rKEvt );\n break;\n }\n }\n else\n Control::KeyInput( rKEvt );\n}\n\n\/\/ -----------------------------------------------------------------------\n\nvoid SpinButton::StateChanged( StateChangedType nType )\n{\n switch ( nType )\n {\n case STATE_CHANGE_DATA:\n case STATE_CHANGE_ENABLE:\n Invalidate();\n break;\n\n case STATE_CHANGE_STYLE:\n {\n BOOL bNewRepeat = 0 != ( GetStyle() & WB_REPEAT );\n if ( bNewRepeat != mbRepeat )\n {\n if ( maRepeatTimer.IsActive() )\n {\n maRepeatTimer.Stop();\n maRepeatTimer.SetTimeout( GetSettings().GetMouseSettings().GetButtonStartRepeat() );\n }\n mbRepeat = bNewRepeat;\n }\n\n BOOL bNewHorz = 0 != ( GetStyle() & WB_HSCROLL );\n if ( bNewHorz != mbHorz )\n {\n mbHorz = bNewHorz;\n Resize();\n }\n }\n break;\n }\n\n Control::StateChanged( nType );\n}\n\n\/\/ -----------------------------------------------------------------------\n\nvoid SpinButton::SetRangeMin( long nNewRange )\n{\n SetRange( Range( nNewRange, GetRangeMax() ) );\n}\n\n\/\/ -----------------------------------------------------------------------\n\nvoid SpinButton::SetRangeMax( long nNewRange )\n{\n SetRange( Range( GetRangeMin(), nNewRange ) );\n}\n\n\/\/ -----------------------------------------------------------------------\n\nvoid SpinButton::SetRange( const Range& rRange )\n{\n \/\/ adjust rage\n Range aRange = rRange;\n aRange.Justify();\n long nNewMinRange = aRange.Min();\n long nNewMaxRange = aRange.Max();\n\n \/\/ do something only if old and new range differ\n if ( (mnMinRange != nNewMinRange) ||\n (mnMaxRange != nNewMaxRange) )\n {\n mnMinRange = nNewMinRange;\n mnMaxRange = nNewMaxRange;\n\n \/\/ adjust value to new range, if necessary\n if ( mnValue > mnMaxRange )\n mnValue = mnMaxRange;\n if ( mnValue < mnMinRange )\n mnValue = mnMinRange;\n\n StateChanged( STATE_CHANGE_DATA );\n }\n}\n\n\/\/ -----------------------------------------------------------------------\n\nvoid SpinButton::SetValue( long nValue )\n{\n \/\/ adjust, if necessary\n if ( nValue > mnMaxRange )\n nValue = mnMaxRange;\n if ( nValue < mnMinRange )\n nValue = mnMinRange;\n\n if ( mnValue != nValue )\n {\n mnValue = nValue;\n StateChanged( STATE_CHANGE_DATA );\n }\n}\n\n\/\/ -----------------------------------------------------------------------\n\nvoid SpinButton::GetFocus()\n{\n ShowFocus( maFocusRect );\n Control::GetFocus();\n}\n\n\/\/ -----------------------------------------------------------------------\n\nvoid SpinButton::LoseFocus()\n{\n HideFocus();\n Control::LoseFocus();\n}\n\n\/\/ -----------------------------------------------------------------------\n\nBOOL SpinButton::ImplMoveFocus( BOOL _bUpper )\n{\n if ( _bUpper == mbUpperIsFocused )\n return FALSE;\n\n HideFocus();\n ImplCalcFocusRect( _bUpper );\n if ( HasFocus() )\n ShowFocus( maFocusRect );\n return TRUE;\n}\n\n\/\/ -----------------------------------------------------------------------\n\nvoid SpinButton::ImplCalcFocusRect( BOOL _bUpper )\n{\n maFocusRect = _bUpper ? maUpperRect : maLowerRect;\n \/\/ inflate by some pixels\n maFocusRect.Left() += 2;\n maFocusRect.Top() += 2;\n maFocusRect.Right() -= 2;\n maFocusRect.Bottom() -= 2;\n mbUpperIsFocused = _bUpper;\n}\n\n\/\/ -----------------------------------------------------------------------\n\nRectangle* SpinButton::ImplFindPartRect( const Point& rPt )\n{\n if( maUpperRect.IsInside( rPt ) )\n return &maUpperRect;\n else if( maLowerRect.IsInside( rPt ) )\n return &maLowerRect;\n else\n return NULL;\n}\n\nlong SpinButton::PreNotify( NotifyEvent& rNEvt )\n{\n long nDone = 0;\n const MouseEvent* pMouseEvt = NULL;\n\n if( (rNEvt.GetType() == EVENT_MOUSEMOVE) && (pMouseEvt = rNEvt.GetMouseEvent()) != NULL )\n {\n if( !pMouseEvt->GetButtons() && !pMouseEvt->IsSynthetic() && !pMouseEvt->IsModifierChanged() )\n {\n \/\/ trigger redraw if mouse over state has changed\n if( IsNativeControlSupported(CTRL_SPINBOX, PART_ENTIRE_CONTROL) ||\n IsNativeControlSupported(CTRL_SPINBOX, PART_ALL_BUTTONS) )\n {\n Rectangle* pRect = ImplFindPartRect( GetPointerPosPixel() );\n Rectangle* pLastRect = ImplFindPartRect( GetLastPointerPosPixel() );\n if( pRect != pLastRect || (pMouseEvt->IsLeaveWindow() || pMouseEvt->IsEnterWindow()) )\n {\n Region aRgn( GetActiveClipRegion() );\n if( pLastRect )\n {\n SetClipRegion( *pLastRect );\n Paint( *pLastRect );\n SetClipRegion( aRgn );\n }\n if( pRect )\n {\n SetClipRegion( *pRect );\n Paint( *pRect );\n SetClipRegion( aRgn );\n }\n }\n }\n }\n }\n\n return nDone ? nDone : Control::PreNotify(rNEvt);\n}\n\n\/\/ -----------------------------------------------------------------------\n<|endoftext|>"} {"text":"<commit_before>\/*************************************************************************\n *\n * $RCSfile: threadex.cxx,v $\n *\n * $Revision: 1.1.1.1 $\n *\n * last change: $Author: hr $ $Date: 2000-09-18 17:05:39 $\n *\n * The Contents of this file are made available subject to the terms of\n * either of the following licenses\n *\n * - GNU Lesser General Public License Version 2.1\n * - Sun Industry Standards Source License Version 1.1\n *\n * Sun Microsystems Inc., October, 2000\n *\n * GNU Lesser General Public License Version 2.1\n * =============================================\n * Copyright 2000 by Sun Microsystems, Inc.\n * 901 San Antonio Road, Palo Alto, CA 94303, USA\n *\n * This library is free software; you can redistribute it and\/or\n * modify it under the terms of the GNU Lesser General Public\n * License version 2.1, as published by the Free Software Foundation.\n *\n * This library is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU\n * Lesser General Public License for more details.\n *\n * You should have received a copy of the GNU Lesser General Public\n * License along with this library; if not, write to the Free Software\n * Foundation, Inc., 59 Temple Place, Suite 330, Boston,\n * MA 02111-1307 USA\n *\n *\n * Sun Industry Standards Source License Version 1.1\n * =================================================\n * The contents of this file are subject to the Sun Industry Standards\n * Source License Version 1.1 (the \"License\"); You may not use this file\n * except in compliance with the License. You may obtain a copy of the\n * License at http:\/\/www.openoffice.org\/license.html.\n *\n * Software provided under this License is provided on an \"AS IS\" basis,\n * WITHOUT WARRANTY OF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING,\n * WITHOUT LIMITATION, WARRANTIES THAT THE SOFTWARE IS FREE OF DEFECTS,\n * MERCHANTABLE, FIT FOR A PARTICULAR PURPOSE, OR NON-INFRINGING.\n * See the License for the specific provisions governing your rights and\n * obligations concerning the Software.\n *\n * The Initial Developer of the Original Code is: Sun Microsystems, Inc.\n *\n * Copyright: 2000 by Sun Microsystems, Inc.\n *\n * All Rights Reserved.\n *\n * Contributor(s): _______________________________________\n *\n *\n ************************************************************************\/\n\n#include <threadex.hxx>\n#include <svapp.hxx>\n\nusing namespace vcl;\n\nThreadExecutor::ThreadExecutor()\n{\n m_aFinish = osl_createCondition();\n m_aThread = NULL;\n}\n\nThreadExecutor::~ThreadExecutor()\n{\n osl_destroyCondition( m_aFinish );\n if( m_aThread )\n osl_freeThreadHandle( m_aThread );\n}\n\nvoid ThreadExecutor::worker( void* pInstance )\n{\n ThreadExecutor* pThis = ((ThreadExecutor*)pInstance);\n pThis->m_nReturn = pThis->doIt();\n osl_setCondition( pThis->m_aFinish );\n}\n\nlong ThreadExecutor::execute()\n{\n osl_resetCondition( m_aFinish );\n if( m_aThread )\n osl_freeThreadHandle( m_aThread ), m_aThread = NULL;\n m_aThread = osl_createThread( worker, this );\n while( ! osl_checkCondition( m_aFinish ) )\n Application::Reschedule();\n return m_nReturn;\n}\n\n\nSolarThreadExecutor::SolarThreadExecutor()\n{\n m_aFinish = osl_createCondition();\n}\n\nSolarThreadExecutor::~SolarThreadExecutor()\n{\n osl_destroyCondition( m_aFinish );\n}\n\nIMPL_LINK( SolarThreadExecutor, worker, void*, pDummy )\n{\n m_nReturn = doIt();\n osl_setCondition( m_aFinish );\n return m_nReturn;\n}\n\nlong SolarThreadExecutor::execute()\n{\n if( ::vos::OThread::getCurrentIdentifier() == Application::GetMainThreadIdentifier() )\n {\n m_nReturn = doIt();\n osl_setCondition( m_aFinish );\n }\n else\n {\n osl_resetCondition( m_aFinish );\n Application::PostUserEvent( LINK( this, SolarThreadExecutor, worker ) );\n osl_waitCondition( m_aFinish, NULL );\n }\n return m_nReturn;\n}\n<commit_msg>changed SolarThreadExecutor to release SolarMutex temporarily to avoid deadlocks<commit_after>\/*************************************************************************\n *\n * $RCSfile: threadex.cxx,v $\n *\n * $Revision: 1.2 $\n *\n * last change: $Author: pl $ $Date: 2000-12-05 20:14: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#include <threadex.hxx>\n#include <svapp.hxx>\n\nusing namespace vcl;\n\nThreadExecutor::ThreadExecutor()\n{\n m_aFinish = osl_createCondition();\n m_aThread = NULL;\n}\n\nThreadExecutor::~ThreadExecutor()\n{\n osl_destroyCondition( m_aFinish );\n if( m_aThread )\n osl_freeThreadHandle( m_aThread );\n}\n\nvoid ThreadExecutor::worker( void* pInstance )\n{\n ThreadExecutor* pThis = ((ThreadExecutor*)pInstance);\n pThis->m_nReturn = pThis->doIt();\n osl_setCondition( pThis->m_aFinish );\n}\n\nlong ThreadExecutor::execute()\n{\n osl_resetCondition( m_aFinish );\n if( m_aThread )\n osl_freeThreadHandle( m_aThread ), m_aThread = NULL;\n m_aThread = osl_createThread( worker, this );\n while( ! osl_checkCondition( m_aFinish ) )\n Application::Reschedule();\n return m_nReturn;\n}\n\n\nSolarThreadExecutor::SolarThreadExecutor()\n{\n m_aFinish = osl_createCondition();\n}\n\nSolarThreadExecutor::~SolarThreadExecutor()\n{\n osl_destroyCondition( m_aFinish );\n}\n\nIMPL_LINK( SolarThreadExecutor, worker, void*, pDummy )\n{\n m_nReturn = doIt();\n osl_setCondition( m_aFinish );\n return m_nReturn;\n}\n\nlong SolarThreadExecutor::execute()\n{\n if( ::vos::OThread::getCurrentIdentifier() == Application::GetMainThreadIdentifier() )\n {\n m_nReturn = doIt();\n osl_setCondition( m_aFinish );\n }\n else\n {\n osl_resetCondition( m_aFinish );\n ULONG nSolarMutexCount = Application::ReleaseSolarMutex();\n Application::PostUserEvent( LINK( this, SolarThreadExecutor, worker ) );\n osl_waitCondition( m_aFinish, NULL );\n if( nSolarMutexCount )\n Application::AcquireSolarMutex( nSolarMutexCount );\n }\n return m_nReturn;\n}\n<|endoftext|>"} {"text":"<commit_before><commit_msg>refactor PrintDialog to use RenderContex<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\/\/ MARKER(update_precomp.py): autogen include statement, do not remove\n#include \"precompiled_vcl.hxx\"\n\n#include <svsys.h>\n#include <rtl\/process.h>\n#include <rtl\/ref.hxx>\n#include <tools\/rc.h>\n#include <vcl\/window.h>\n#include <vcl\/salinst.hxx>\n#include <vcl\/salframe.hxx>\n#include <vcl\/window.hxx>\n#include <vcl\/salobj.hxx>\n#include <vcl\/svdata.hxx>\n#include <vcl\/sysdata.hxx>\n#include <vcl\/svapp.hxx>\n#include <vcl\/syschild.hxx>\n#include <vcl\/unohelp.hxx>\n\n#ifdef SOLAR_JAVA\n#include <jni.h>\n#endif\n\n#include <comphelper\/processfactory.hxx>\n#include <jvmaccess\/virtualmachine.hxx>\n#include <com\/sun\/star\/java\/XJavaVM.hpp>\n#include <com\/sun\/star\/java\/XJavaThreadRegister_11.hpp>\n#include <com\/sun\/star\/lang\/XMultiServiceFactory.hpp>\n\n#include <vcl\/syschild.hxx>\n\nusing namespace ::com::sun::star;\n\n\/\/ =======================================================================\n\nlong ImplSysChildProc( void* pInst, SalObject* \/* pObject *\/,\n sal_uInt16 nEvent, const void* \/* pEvent *\/ )\n{\n SystemChildWindow* pWindow = (SystemChildWindow*)pInst;\n long nRet = 0;\n\n ImplDelData aDogTag( pWindow );\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 = sal_True;\n pWindow->ImplGetFrameData()->mbInSysObjToTopHdl = sal_True;\n pWindow->ToTop( TOTOP_NOGRABFOCUS );\n if( aDogTag.IsDead() )\n break;\n pWindow->ImplGetFrameData()->mbInSysObjToTopHdl = sal_False;\n pWindow->ImplGetFrameData()->mbInSysObjFocusHdl = sal_True;\n pWindow->GrabFocus();\n if( aDogTag.IsDead() )\n break;\n pWindow->ImplGetFrameData()->mbInSysObjFocusHdl = sal_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 = sal_False;\n if ( !pWindow->ImplGetFrameData()->mnFocusId )\n {\n pWindow->ImplGetFrameData()->mbStartFocusState = sal_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 = sal_True;\n if ( !Application::GetFocusWindow() || pWindow->HasChildPathFocus() )\n pWindow->ToTop( TOTOP_NOGRABFOCUS );\n else\n pWindow->ToTop();\n if( aDogTag.IsDead() )\n break;\n pWindow->GrabFocus();\n if( aDogTag.IsDead() )\n break;\n pWindow->ImplGetFrameData()->mbInSysObjToTopHdl = sal_False;\n break;\n }\n\n return nRet;\n}\n\n\/\/ =======================================================================\n\nvoid SystemChildWindow::ImplInitSysChild( Window* pParent, WinBits nStyle, SystemWindowData *pData, sal_Bool bShow )\n{\n mpWindowImpl->mpSysObj = ImplGetSVData()->mpDefInst->CreateObject( pParent->ImplGetFrame(), pData, bShow );\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 ImplInitSysChild( pParent, nStyle, NULL );\n}\n\n\/\/ -----------------------------------------------------------------------\n\nSystemChildWindow::SystemChildWindow( Window* pParent, WinBits nStyle, SystemWindowData *pData, sal_Bool bShow ) :\n Window( WINDOW_SYSTEMCHILDWINDOW )\n{\n ImplInitSysChild( pParent, nStyle, pData, bShow );\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 ImplInitSysChild( pParent, nStyle, NULL );\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\/\/ -----------------------------------------------------------------------\n\nvoid SystemChildWindow::EnableEraseBackground( sal_Bool bEnable )\n{\n if ( mpWindowImpl->mpSysObj )\n mpWindowImpl->mpSysObj->EnableEraseBackground( bEnable );\n}\n\n\/\/ -----------------------------------------------------------------------\n\nsal_Bool SystemChildWindow::IsEraseBackgroundEnabled()\n{\n if ( mpWindowImpl->mpSysObj )\n return mpWindowImpl->mpSysObj->IsEraseBackgroundEnabled();\n else\n return sal_False;\n}\n\n\/\/ -----------------------------------------------------------------------\n\nvoid SystemChildWindow::ImplTestJavaException( void* pEnv )\n{\n#ifdef SOLAR_JAVA\n JNIEnv* pJavaEnv = reinterpret_cast< JNIEnv* >( pEnv );\n jthrowable jtThrowable = pJavaEnv->ExceptionOccurred();\n\n if( jtThrowable )\n { \/\/ is it a java exception ?\n#if OSL_DEBUG_LEVEL > 1\n pJavaEnv->ExceptionDescribe();\n#endif \/\/ OSL_DEBUG_LEVEL > 1\n pJavaEnv->ExceptionClear();\n\n jclass jcThrowable = pJavaEnv->FindClass(\"java\/lang\/Throwable\");\n jmethodID jmThrowable_getMessage = pJavaEnv->GetMethodID(jcThrowable, \"getMessage\", \"()Ljava\/lang\/String;\");\n jstring jsMessage = (jstring) pJavaEnv->CallObjectMethod(jtThrowable, jmThrowable_getMessage);\n ::rtl::OUString ouMessage;\n\n if(jsMessage)\n {\n const jchar * jcMessage = pJavaEnv->GetStringChars(jsMessage, NULL);\n ouMessage = ::rtl::OUString(jcMessage);\n pJavaEnv->ReleaseStringChars(jsMessage, jcMessage);\n }\n\n throw uno::RuntimeException(ouMessage, uno::Reference<uno::XInterface>());\n }\n#endif \/\/ SOLAR_JAVA\n}\n\nvoid SystemChildWindow::SetForwardKey( sal_Bool bEnable )\n{\n if ( mpWindowImpl->mpSysObj )\n mpWindowImpl->mpSysObj->SetForwardKey( bEnable );\n}\n\n\/\/ -----------------------------------------------------------------------\n\nsal_IntPtr SystemChildWindow::GetParentWindowHandle( sal_Bool bUseJava )\n{\n sal_IntPtr nRet = 0;\n\n#if defined WNT\n nRet = reinterpret_cast< sal_IntPtr >( GetSystemData()->hWnd );\n#elif defined QUARTZ\n \/\/ FIXME: this is wrong\n nRet = reinterpret_cast< sal_IntPtr >( GetSystemData()->pView );\n#elif defined UNX\n if( !bUseJava )\n {\n nRet = (sal_IntPtr) GetSystemData()->aWindow;\n }\n#ifdef SOLAR_JAVA\n else\n {\n uno::Reference< lang::XMultiServiceFactory > xFactory( vcl::unohelper::GetMultiServiceFactory() );\n\n if( xFactory.is() && ( GetSystemData()->aWindow > 0 ) )\n {\n try\n {\n ::rtl::Reference< ::jvmaccess::VirtualMachine > xVM;\n uno::Reference< java::XJavaVM > xJavaVM( xFactory->createInstance( rtl::OUString(RTL_CONSTASCII_USTRINGPARAM(\"com.sun.star.java.JavaVirtualMachine\") ) ), uno::UNO_QUERY );\n uno::Sequence< sal_Int8 > aProcessID( 17 );\n\n rtl_getGlobalProcessId( (sal_uInt8*) aProcessID.getArray() );\n aProcessID[ 16 ] = 0;\n OSL_ENSURE(sizeof (sal_Int64) >= sizeof (jvmaccess::VirtualMachine *), \"Pointer cannot be represented as sal_Int64\");\n sal_Int64 nPointer = reinterpret_cast< sal_Int64 >( static_cast< jvmaccess::VirtualMachine * >(0));\n xJavaVM->getJavaVM(aProcessID) >>= nPointer;\n xVM = reinterpret_cast< jvmaccess::VirtualMachine * >(nPointer);\n\n if( xVM.is() )\n {\n try\n {\n ::jvmaccess::VirtualMachine::AttachGuard aVMAttachGuard( xVM );\n JNIEnv* pEnv = aVMAttachGuard.getEnvironment();\n\n jclass jcToolkit = pEnv->FindClass(\"java\/awt\/Toolkit\");\n ImplTestJavaException(pEnv);\n\n jmethodID jmToolkit_getDefaultToolkit = pEnv->GetStaticMethodID( jcToolkit, \"getDefaultToolkit\", \"()Ljava\/awt\/Toolkit;\" );\n ImplTestJavaException(pEnv);\n\n pEnv->CallStaticObjectMethod(jcToolkit, jmToolkit_getDefaultToolkit);\n ImplTestJavaException(pEnv);\n\n jclass jcMotifAppletViewer = pEnv->FindClass(\"sun\/plugin\/navig\/motif\/MotifAppletViewer\");\n if( pEnv->ExceptionOccurred() )\n {\n pEnv->ExceptionClear();\n\n jcMotifAppletViewer = pEnv->FindClass( \"sun\/plugin\/viewer\/MNetscapePluginContext\");\n ImplTestJavaException(pEnv);\n }\n\n jclass jcClassLoader = pEnv->FindClass(\"java\/lang\/ClassLoader\");\n ImplTestJavaException(pEnv);\n\n jmethodID jmClassLoader_loadLibrary = pEnv->GetStaticMethodID( jcClassLoader, \"loadLibrary\", \"(Ljava\/lang\/Class;Ljava\/lang\/String;Z)V\");\n ImplTestJavaException(pEnv);\n\n jstring jsplugin = pEnv->NewStringUTF(\"javaplugin_jni\");\n ImplTestJavaException(pEnv);\n\n pEnv->CallStaticVoidMethod(jcClassLoader, jmClassLoader_loadLibrary, jcMotifAppletViewer, jsplugin, JNI_FALSE);\n ImplTestJavaException(pEnv);\n\n jmethodID jmMotifAppletViewer_getWidget = pEnv->GetStaticMethodID( jcMotifAppletViewer, \"getWidget\", \"(IIIII)I\" );\n ImplTestJavaException(pEnv);\n\n const Size aSize( GetOutputSizePixel() );\n jint ji_widget = pEnv->CallStaticIntMethod( jcMotifAppletViewer, jmMotifAppletViewer_getWidget,\n GetSystemData()->aWindow, 0, 0, aSize.Width(), aSize.Height() );\n ImplTestJavaException(pEnv);\n\n nRet = static_cast< sal_IntPtr >( ji_widget );\n }\n catch( uno::RuntimeException& )\n {\n }\n\n if( !nRet )\n nRet = static_cast< sal_IntPtr >( GetSystemData()->aWindow );\n }\n }\n catch( ... )\n {\n }\n }\n }\n#endif \/\/ SOLAR_JAVA\n#else \/\/ WNT || QUARTZ || UNX\n#endif\n\n return nRet;\n}\n\n\/* vim:set shiftwidth=4 softtabstop=4 expandtab: *\/\n<commit_msg>WaE: silence some warnings<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_vcl.hxx\"\n\n#include <svsys.h>\n#include <rtl\/process.h>\n#include <rtl\/ref.hxx>\n#include <tools\/rc.h>\n#include <vcl\/window.h>\n#include <vcl\/salinst.hxx>\n#include <vcl\/salframe.hxx>\n#include <vcl\/window.hxx>\n#include <vcl\/salobj.hxx>\n#include <vcl\/svdata.hxx>\n#include <vcl\/sysdata.hxx>\n#include <vcl\/svapp.hxx>\n#include <vcl\/syschild.hxx>\n#include <vcl\/unohelp.hxx>\n\n#ifdef SOLAR_JAVA\n#include <jni.h>\n#endif\n\n#include <comphelper\/processfactory.hxx>\n#include <jvmaccess\/virtualmachine.hxx>\n#include <com\/sun\/star\/java\/XJavaVM.hpp>\n#include <com\/sun\/star\/java\/XJavaThreadRegister_11.hpp>\n#include <com\/sun\/star\/lang\/XMultiServiceFactory.hpp>\n\n#include <vcl\/syschild.hxx>\n\nusing namespace ::com::sun::star;\n\n\/\/ =======================================================================\n\nlong ImplSysChildProc( void* pInst, SalObject* \/* pObject *\/,\n sal_uInt16 nEvent, const void* \/* pEvent *\/ )\n{\n SystemChildWindow* pWindow = (SystemChildWindow*)pInst;\n long nRet = 0;\n\n ImplDelData aDogTag( pWindow );\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 = sal_True;\n pWindow->ImplGetFrameData()->mbInSysObjToTopHdl = sal_True;\n pWindow->ToTop( TOTOP_NOGRABFOCUS );\n if( aDogTag.IsDead() )\n break;\n pWindow->ImplGetFrameData()->mbInSysObjToTopHdl = sal_False;\n pWindow->ImplGetFrameData()->mbInSysObjFocusHdl = sal_True;\n pWindow->GrabFocus();\n if( aDogTag.IsDead() )\n break;\n pWindow->ImplGetFrameData()->mbInSysObjFocusHdl = sal_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 = sal_False;\n if ( !pWindow->ImplGetFrameData()->mnFocusId )\n {\n pWindow->ImplGetFrameData()->mbStartFocusState = sal_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 = sal_True;\n if ( !Application::GetFocusWindow() || pWindow->HasChildPathFocus() )\n pWindow->ToTop( TOTOP_NOGRABFOCUS );\n else\n pWindow->ToTop();\n if( aDogTag.IsDead() )\n break;\n pWindow->GrabFocus();\n if( aDogTag.IsDead() )\n break;\n pWindow->ImplGetFrameData()->mbInSysObjToTopHdl = sal_False;\n break;\n }\n\n return nRet;\n}\n\n\/\/ =======================================================================\n\nvoid SystemChildWindow::ImplInitSysChild( Window* pParent, WinBits nStyle, SystemWindowData *pData, sal_Bool bShow )\n{\n mpWindowImpl->mpSysObj = ImplGetSVData()->mpDefInst->CreateObject( pParent->ImplGetFrame(), pData, bShow );\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 ImplInitSysChild( pParent, nStyle, NULL );\n}\n\n\/\/ -----------------------------------------------------------------------\n\nSystemChildWindow::SystemChildWindow( Window* pParent, WinBits nStyle, SystemWindowData *pData, sal_Bool bShow ) :\n Window( WINDOW_SYSTEMCHILDWINDOW )\n{\n ImplInitSysChild( pParent, nStyle, pData, bShow );\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 ImplInitSysChild( pParent, nStyle, NULL );\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\/\/ -----------------------------------------------------------------------\n\nvoid SystemChildWindow::EnableEraseBackground( sal_Bool bEnable )\n{\n if ( mpWindowImpl->mpSysObj )\n mpWindowImpl->mpSysObj->EnableEraseBackground( bEnable );\n}\n\n\/\/ -----------------------------------------------------------------------\n\nsal_Bool SystemChildWindow::IsEraseBackgroundEnabled()\n{\n if ( mpWindowImpl->mpSysObj )\n return mpWindowImpl->mpSysObj->IsEraseBackgroundEnabled();\n else\n return sal_False;\n}\n\n\/\/ -----------------------------------------------------------------------\n\nvoid SystemChildWindow::ImplTestJavaException( void* pEnv )\n{\n#ifdef SOLAR_JAVA\n JNIEnv* pJavaEnv = reinterpret_cast< JNIEnv* >( pEnv );\n jthrowable jtThrowable = pJavaEnv->ExceptionOccurred();\n\n if( jtThrowable )\n { \/\/ is it a java exception ?\n#if OSL_DEBUG_LEVEL > 1\n pJavaEnv->ExceptionDescribe();\n#endif \/\/ OSL_DEBUG_LEVEL > 1\n pJavaEnv->ExceptionClear();\n\n jclass jcThrowable = pJavaEnv->FindClass(\"java\/lang\/Throwable\");\n jmethodID jmThrowable_getMessage = pJavaEnv->GetMethodID(jcThrowable, \"getMessage\", \"()Ljava\/lang\/String;\");\n jstring jsMessage = (jstring) pJavaEnv->CallObjectMethod(jtThrowable, jmThrowable_getMessage);\n ::rtl::OUString ouMessage;\n\n if(jsMessage)\n {\n const jchar * jcMessage = pJavaEnv->GetStringChars(jsMessage, NULL);\n ouMessage = ::rtl::OUString(jcMessage);\n pJavaEnv->ReleaseStringChars(jsMessage, jcMessage);\n }\n\n throw uno::RuntimeException(ouMessage, uno::Reference<uno::XInterface>());\n }\n#else\n (void)pEnv;\n#endif \/\/ SOLAR_JAVA\n}\n\nvoid SystemChildWindow::SetForwardKey( sal_Bool bEnable )\n{\n if ( mpWindowImpl->mpSysObj )\n mpWindowImpl->mpSysObj->SetForwardKey( bEnable );\n}\n\n\/\/ -----------------------------------------------------------------------\n\nsal_IntPtr SystemChildWindow::GetParentWindowHandle( sal_Bool bUseJava )\n{\n sal_IntPtr nRet = 0;\n\n#if defined WNT\n nRet = reinterpret_cast< sal_IntPtr >( GetSystemData()->hWnd );\n#elif defined QUARTZ\n \/\/ FIXME: this is wrong\n nRet = reinterpret_cast< sal_IntPtr >( GetSystemData()->pView );\n#elif defined UNX\n if( !bUseJava )\n {\n nRet = (sal_IntPtr) GetSystemData()->aWindow;\n }\n#ifdef SOLAR_JAVA\n else\n {\n uno::Reference< lang::XMultiServiceFactory > xFactory( vcl::unohelper::GetMultiServiceFactory() );\n\n if( xFactory.is() && ( GetSystemData()->aWindow > 0 ) )\n {\n try\n {\n ::rtl::Reference< ::jvmaccess::VirtualMachine > xVM;\n uno::Reference< java::XJavaVM > xJavaVM( xFactory->createInstance( rtl::OUString(RTL_CONSTASCII_USTRINGPARAM(\"com.sun.star.java.JavaVirtualMachine\") ) ), uno::UNO_QUERY );\n uno::Sequence< sal_Int8 > aProcessID( 17 );\n\n rtl_getGlobalProcessId( (sal_uInt8*) aProcessID.getArray() );\n aProcessID[ 16 ] = 0;\n OSL_ENSURE(sizeof (sal_Int64) >= sizeof (jvmaccess::VirtualMachine *), \"Pointer cannot be represented as sal_Int64\");\n sal_Int64 nPointer = reinterpret_cast< sal_Int64 >( static_cast< jvmaccess::VirtualMachine * >(0));\n xJavaVM->getJavaVM(aProcessID) >>= nPointer;\n xVM = reinterpret_cast< jvmaccess::VirtualMachine * >(nPointer);\n\n if( xVM.is() )\n {\n try\n {\n ::jvmaccess::VirtualMachine::AttachGuard aVMAttachGuard( xVM );\n JNIEnv* pEnv = aVMAttachGuard.getEnvironment();\n\n jclass jcToolkit = pEnv->FindClass(\"java\/awt\/Toolkit\");\n ImplTestJavaException(pEnv);\n\n jmethodID jmToolkit_getDefaultToolkit = pEnv->GetStaticMethodID( jcToolkit, \"getDefaultToolkit\", \"()Ljava\/awt\/Toolkit;\" );\n ImplTestJavaException(pEnv);\n\n pEnv->CallStaticObjectMethod(jcToolkit, jmToolkit_getDefaultToolkit);\n ImplTestJavaException(pEnv);\n\n jclass jcMotifAppletViewer = pEnv->FindClass(\"sun\/plugin\/navig\/motif\/MotifAppletViewer\");\n if( pEnv->ExceptionOccurred() )\n {\n pEnv->ExceptionClear();\n\n jcMotifAppletViewer = pEnv->FindClass( \"sun\/plugin\/viewer\/MNetscapePluginContext\");\n ImplTestJavaException(pEnv);\n }\n\n jclass jcClassLoader = pEnv->FindClass(\"java\/lang\/ClassLoader\");\n ImplTestJavaException(pEnv);\n\n jmethodID jmClassLoader_loadLibrary = pEnv->GetStaticMethodID( jcClassLoader, \"loadLibrary\", \"(Ljava\/lang\/Class;Ljava\/lang\/String;Z)V\");\n ImplTestJavaException(pEnv);\n\n jstring jsplugin = pEnv->NewStringUTF(\"javaplugin_jni\");\n ImplTestJavaException(pEnv);\n\n pEnv->CallStaticVoidMethod(jcClassLoader, jmClassLoader_loadLibrary, jcMotifAppletViewer, jsplugin, JNI_FALSE);\n ImplTestJavaException(pEnv);\n\n jmethodID jmMotifAppletViewer_getWidget = pEnv->GetStaticMethodID( jcMotifAppletViewer, \"getWidget\", \"(IIIII)I\" );\n ImplTestJavaException(pEnv);\n\n const Size aSize( GetOutputSizePixel() );\n jint ji_widget = pEnv->CallStaticIntMethod( jcMotifAppletViewer, jmMotifAppletViewer_getWidget,\n GetSystemData()->aWindow, 0, 0, aSize.Width(), aSize.Height() );\n ImplTestJavaException(pEnv);\n\n nRet = static_cast< sal_IntPtr >( ji_widget );\n }\n catch( uno::RuntimeException& )\n {\n }\n\n if( !nRet )\n nRet = static_cast< sal_IntPtr >( GetSystemData()->aWindow );\n }\n }\n catch( ... )\n {\n }\n }\n }\n#endif \/\/ SOLAR_JAVA\n#else \/\/ WNT || QUARTZ || UNX\n#endif\n\n return nRet;\n}\n\n\/* vim:set shiftwidth=4 softtabstop=4 expandtab: *\/\n<|endoftext|>"} {"text":"<commit_before>#include <string>\n#include <obs-module.h>\n#include \"nicookie.h\"\n#include \"nico-live-api.hpp\"\n#include \"nicolive-errno.h\"\n#include \"nicolive-log.h\"\n\nnamespace\n{\nchar *acquired_session = nullptr;\ninline void nicolive_api_set_session(const char *str)\n{\n\tif (acquired_session != nullptr) {\n\t\tbfree(acquired_session);\n\t}\n\tacquired_session = bstrdup(str);\n}\ninline void nicolive_api_set_session(const std::string &str)\n{\n\tnicolive_api_set_session(str.c_str());\n}\ninline const std::string nicolive_api_get_session_nla(const NicoLiveApi &nla)\n{\n\treturn nla.getCookie(\"user_session\");\n}\n}\n\nextern \"C\" void nicolive_api_clear_session()\n{\n\tif (acquired_session != nullptr) {\n\t\tbfree(acquired_session);\n\t\tacquired_session = nullptr;\n\t}\n}\n\nextern \"C\" const char *nicolive_api_get_session() { return acquired_session; }\nextern \"C\" const char *nicolive_api_get_session_login(\n const char *mail, const char *password)\n{\n\tif (mail == nullptr) {\n\t\tnicolive_errno = NICOLIVE_ERROR_NO_MAIL_ADDRESS;\n\t\treturn nullptr;\n\t}\n\tif (mail[0] == '\\0') {\n\t\tnicolive_errno = NICOLIVE_ERROR_EMPTY_MAIL_ADDRESS;\n\t\treturn nullptr;\n\t}\n\tif (password == nullptr) {\n\t\tnicolive_errno = NICOLIVE_ERROR_NO_PASSWORD;\n\t\treturn nullptr;\n\t}\n\tif (password[0] == '\\0') {\n\t\tnicolive_errno = NICOLIVE_ERROR_EMPTY_PASSWORD;\n\t\treturn nullptr;\n\t}\n\n\tstd::string mail_str(mail);\n\tstd::string password_str(password);\n\tNicoLiveApi nla;\n\tif (nla.loginSiteNicolive(mail_str, password_str)) {\n\t\tnicolive_errno = NICOLIVE_ERROR_LOGIN_SUCCESSFUL;\n\t\tnicolive_api_set_session(nicolive_api_get_session_nla(nla));\n\t} else {\n\t\tnicolive_errno = NICOLIVE_ERROR_LOGIN_FAILURE;\n\t\tnicolive_api_clear_session();\n\t}\n\treturn acquired_session;\n}\nextern \"C\" const char *nicolive_api_get_session_app(int app)\n{\n\tnicookie_errno = 0;\n\tconst char *session = nicookie_get_session(app);\n\tif (session != nullptr) {\n\t\tnicolive_errno = NICOLIVE_ERROR_COOKIE_ACQUISITION_SUCCESSFUL;\n\t\tnicolive_api_set_session(session);\n\t} else {\n\t\tnicolive_errno = NICOLIVE_ERROR_NICOOKIE | nicookie_errno;\n\t\tnicolive_api_clear_session();\n\t}\n\treturn acquired_session;\n}\n\nextern \"C\" bool nicolive_api_check_session(const char *session)\n{\n\tif (session == nullptr) {\n\t\tnicolive_errno = NICOLIVE_ERROR_NO_USER_SESSION;\n\t\treturn false;\n\t}\n\tif (session[0] == '\\0') {\n\t\tnicolive_errno = NICOLIVE_ERROR_EMPTY_USER_SESSION;\n\t\treturn false;\n\t}\n\n\tstd::string session_str(session);\n\tNicoLiveApi nla;\n\tnla.setCookie(\"user_session\", session_str);\n\tconst std::string statusXpath = \"\/getpublishstatus\/@status\";\n\tconst std::string errorCodeXpath =\n\t \"\/getpublishstatus\/error\/code\/text()\";\n\tstd::unordered_map<std::string, std::vector<std::string>> data;\n\tdata[statusXpath] = std::vector<std::string>();\n\tdata[errorCodeXpath] = std::vector<std::string>();\n\tbool result = nla.getPublishStatus(&data);\n\n\tif (!result) return false;\n\tif (data[statusXpath].empty()) return false;\n\tstd::string &status = data[statusXpath][0];\n\tif (status == \"ok\") return true;\n\tif (status == \"fail\" && !data[errorCodeXpath].empty() &&\n\t data[errorCodeXpath][0] == \"notfound\")\n\t\treturn true;\n\treturn false;\n}\n\nextern \"C\" bool nicolive_api_check_login(const char *mail, const char *password)\n{\n\tconst char *session = nicolive_api_get_session_login(mail, password);\n\tif (session != nullptr) {\n\t\treturn nicolive_api_check_session(session);\n\t} else {\n\t\treturn false;\n\t}\n}\n\nextern \"C\" bool nicolive_api_check_app(int app)\n{\n\tconst char *session = nicolive_api_get_session_app(app);\n\tif (session != nullptr) {\n\t\treturn nicolive_api_check_session(session);\n\t} else {\n\t\treturn false;\n\t}\n}\n<commit_msg>エラーセットを追加<commit_after>#include <string>\n#include <obs-module.h>\n#include \"nicookie.h\"\n#include \"nico-live-api.hpp\"\n#include \"nicolive-errno.h\"\n#include \"nicolive-log.h\"\n\nnamespace\n{\nchar *acquired_session = nullptr;\ninline void nicolive_api_set_session(const char *str)\n{\n\tif (acquired_session != nullptr) {\n\t\tbfree(acquired_session);\n\t}\n\tacquired_session = bstrdup(str);\n}\ninline void nicolive_api_set_session(const std::string &str)\n{\n\tnicolive_api_set_session(str.c_str());\n}\ninline const std::string nicolive_api_get_session_nla(const NicoLiveApi &nla)\n{\n\treturn nla.getCookie(\"user_session\");\n}\n}\n\nextern \"C\" void nicolive_api_clear_session()\n{\n\tif (acquired_session != nullptr) {\n\t\tbfree(acquired_session);\n\t\tacquired_session = nullptr;\n\t}\n}\n\nextern \"C\" const char *nicolive_api_get_session() { return acquired_session; }\nextern \"C\" const char *nicolive_api_get_session_login(\n const char *mail, const char *password)\n{\n\tif (mail == nullptr) {\n\t\tnicolive_errno = NICOLIVE_ERROR_NO_MAIL_ADDRESS;\n\t\treturn nullptr;\n\t}\n\tif (mail[0] == '\\0') {\n\t\tnicolive_errno = NICOLIVE_ERROR_EMPTY_MAIL_ADDRESS;\n\t\treturn nullptr;\n\t}\n\tif (password == nullptr) {\n\t\tnicolive_errno = NICOLIVE_ERROR_NO_PASSWORD;\n\t\treturn nullptr;\n\t}\n\tif (password[0] == '\\0') {\n\t\tnicolive_errno = NICOLIVE_ERROR_EMPTY_PASSWORD;\n\t\treturn nullptr;\n\t}\n\n\tstd::string mail_str(mail);\n\tstd::string password_str(password);\n\tNicoLiveApi nla;\n\tif (nla.loginSiteNicolive(mail_str, password_str)) {\n\t\tnicolive_errno = NICOLIVE_ERROR_LOGIN_SUCCESSFUL;\n\t\tnicolive_api_set_session(nicolive_api_get_session_nla(nla));\n\t} else {\n\t\tnicolive_errno = NICOLIVE_ERROR_LOGIN_FAILURE;\n\t\tnicolive_api_clear_session();\n\t}\n\treturn acquired_session;\n}\nextern \"C\" const char *nicolive_api_get_session_app(int app)\n{\n\tnicookie_errno = 0;\n\tconst char *session = nicookie_get_session(app);\n\tif (session != nullptr) {\n\t\tnicolive_errno = NICOLIVE_ERROR_COOKIE_ACQUISITION_SUCCESSFUL;\n\t\tnicolive_api_set_session(session);\n\t} else {\n\t\tnicolive_errno = NICOLIVE_ERROR_NICOOKIE | nicookie_errno;\n\t\tnicolive_api_clear_session();\n\t}\n\treturn acquired_session;\n}\n\nextern \"C\" bool nicolive_api_check_session(const char *session)\n{\n\tif (session == nullptr) {\n\t\tnicolive_errno = NICOLIVE_ERROR_NO_USER_SESSION;\n\t\treturn false;\n\t}\n\tif (session[0] == '\\0') {\n\t\tnicolive_errno = NICOLIVE_ERROR_EMPTY_USER_SESSION;\n\t\treturn false;\n\t}\n\n\tstd::string session_str(session);\n\tNicoLiveApi nla;\n\tnla.setCookie(\"user_session\", session_str);\n\tconst std::string statusXpath = \"\/getpublishstatus\/@status\";\n\tconst std::string errorCodeXpath =\n\t \"\/getpublishstatus\/error\/code\/text()\";\n\tstd::unordered_map<std::string, std::vector<std::string>> data;\n\tdata[statusXpath] = std::vector<std::string>();\n\tdata[errorCodeXpath] = std::vector<std::string>();\n\tbool result = nla.getPublishStatus(&data);\n\n\tif (!result) {\n\t\tnicolive_errno = NICOLIVE_ERROR_ACCESS_ERROR;\n\t\treturn false;\n\t}\n\tif (data[statusXpath].empty()) {\n\t\t\/\/ FIXME: access error? service down?\n\t\tnicolive_errno = NICOLIVE_ERROR_ACCESS_ERROR;\n\t\treturn false;\n\t}\n\n\tstd::string &status = data[statusXpath].front();\n\n\tif (status == \"ok\") {\n\t\tnicolive_errno = NICOLIVE_ERROR_VALID_USER_SESSION;\n\t\treturn true;\n\t}\n\n\tif (status == \"fail\") {\n\t\tstd::string error_code(data[errorCodeXpath].empty()\n\t\t\t\t\t ? data[errorCodeXpath].front()\n\t\t\t\t\t : \"\");\n\t\tif (error_code == \"notfound\" ||\n\t\t error_code == \"permison_denied\") {\n\t\t\tnicolive_errno = NICOLIVE_ERROR_VALID_USER_SESSION;\n\t\t\treturn true;\n\t\t}\n\t}\n\tnicolive_errno = NICOLIVE_ERROR_INVALID_USER_SESSION;\n\treturn false;\n}\n\nextern \"C\" bool nicolive_api_check_login(const char *mail, const char *password)\n{\n\tconst char *session = nicolive_api_get_session_login(mail, password);\n\tif (session != nullptr) {\n\t\treturn nicolive_api_check_session(session);\n\t} else {\n\t\treturn false;\n\t}\n}\n\nextern \"C\" bool nicolive_api_check_app(int app)\n{\n\tconst char *session = nicolive_api_get_session_app(app);\n\tif (session != nullptr) {\n\t\treturn nicolive_api_check_session(session);\n\t} else {\n\t\treturn false;\n\t}\n}\n<|endoftext|>"} {"text":"<commit_before>\/**\n * Clever programming language\n * Copyright (c) Clever Team\n *\n * This file is distributed under the MIT license. See LICENSE for details.\n *\/\n\n#include \"core\/value.h\"\n#include \"core\/vm.h\"\n#include \"types\/array.h\"\n#include \"types\/function.h\"\n\nnamespace clever {\n\nvoid* ArrayType::allocData(CLEVER_TYPE_CTOR_ARGS) const\n{\n\tArrayObject* arr = new ArrayObject();\n\tValueVector& vec = arr->getData();\n\n\tfor (size_t i = 0, j = args->size(); i < j; ++i) {\n\t\tvec.push_back(args->at(i)->clone());\n\t}\n\n\treturn arr;\n}\n\nvoid ArrayType::deallocData(void* data)\n{\n\tArrayObject* arr = static_cast<ArrayObject*>(data);\n\tValueVector& vec = arr->getData();\n\n\tfor (size_t i = 0, j = vec.size(); i < j; ++i) {\n\t\tvec[i]->delRef();\n\t}\n\n\tdelete arr;\n}\n\nvoid ArrayType::dump(const void* value, std::ostream& out) const\n{\n\tValue::DataValue* data = static_cast<Value::DataValue*>(const_cast<void*>(value));\n\tValueVector& vec = (static_cast<ArrayObject*>(data->obj->getObj()))->getData();\n\n\tout << \"[\";\n\n\tfor (size_t i = 0, j = vec.size(); i < j; ++i) {\n\t\tvec.at(i)->dump(out);\n\t\tif (i < j-1) {\n\t\t\tout << \", \";\n\t\t}\n\t}\n\n\tout << \"]\";\n}\n\n\/\/ void Array::append([arg, ... ])\nCLEVER_METHOD(ArrayType::append)\n{\n\tif (args.size()) {\n\t\tValueVector& vec = (CLEVER_GET_OBJECT(ArrayObject*, CLEVER_THIS()))->getData();\n\n\t\tfor (size_t i = 0, j = args.size(); i < j; ++i) {\n\t\t\tvec.push_back(args[i]->clone());\n\t\t}\n\t}\n\tresult->setNull();\n}\n\n\/\/ int Array::size()\nCLEVER_METHOD(ArrayType::size)\n{\n\tif (!clever_check_no_args()) {\n\t\treturn;\n\t}\n\n\tresult->setInt((CLEVER_GET_OBJECT(ArrayObject*, CLEVER_THIS()))->getData().size());\n}\n\n\/\/ mixed Array::at(int position)\nCLEVER_METHOD(ArrayType::at)\n{\n\tif (!clever_check_args(\"i\")) {\n\t\treturn;\n\t}\n\n\tValueVector& arr = (CLEVER_GET_OBJECT(ArrayObject*, CLEVER_THIS()))->getData();\n\n\tif (args[0]->getInt() < 0\n\t\t|| arr.size() <= size_t(args[0]->getInt())) {\n\t\tresult->setNull();\n\t\treturn;\n\t}\n\n\tresult->copy(arr.at(args[0]->getInt()));\n}\n\n\/\/ void Array::reserve(int size)\nCLEVER_METHOD(ArrayType::reserve)\n{\n\tif (!clever_check_args(\"i\")) {\n\t\treturn;\n\t}\n\n\tArrayObject* arr = CLEVER_GET_OBJECT(ArrayObject*, CLEVER_THIS());\n\n\tresult->setNull();\n\n\tif (args[0]->getInt() < 0) {\n\t\treturn;\n\t}\n\n\tarr->getData().reserve(args[0]->getInt());\n}\n\n\/\/ Array Array::reverse()\n\/\/ Returns the reverse of this array\nCLEVER_METHOD(ArrayType::reverse)\n{\n\tValueVector& vec = (CLEVER_GET_OBJECT(ArrayObject*, CLEVER_THIS()))->getData();\n\tValueVector::reverse_iterator it(vec.rbegin()), end(vec.rend());\n\tValueVector rev;\n\n\twhile (it != end){\n\t\trev.push_back((*it));\n\t\tit++;\n\t}\n\n\tCLEVER_RETURN_ARRAY(CLEVER_ARRAY_TYPE->allocData(&rev));\n}\n\n\/\/ mixed Array.shift()\n\/\/ Removes and returns the first element of the array\nCLEVER_METHOD(ArrayType::shift)\n{\n\tValueVector& vec = (CLEVER_GET_OBJECT(ArrayObject*, CLEVER_THIS()))->getData();\n\t\n\tif (!vec.size()) {\n\t\tresult->setNull();\n\t\treturn;\n\t}\n\t\n\tresult->copy(vec[0]);\t\n\n\tValueVector(vec.begin()+1, vec.end()).swap(vec);\n}\n\n\/\/ mixed Array.pop()\n\/\/ Removes and returns the last element of the array\nCLEVER_METHOD(ArrayType::pop)\n{\n\tValueVector& vec = (CLEVER_GET_OBJECT(ArrayObject*, CLEVER_THIS()))->getData();\n\t\n\tif (!vec.size()) {\n\t\tresult->setNull();\t\n\t\treturn;\n\t}\n\t\n\tresult->copy(vec[vec.size()-1]);\t\n\n\tValueVector(vec.begin(), vec.end()-1).swap(vec);\n}\n\n\/\/ Array Array.range(int start, int end)\n\/\/ Returns a range as a new array\nCLEVER_METHOD(ArrayType::range)\n{\n\tif (!clever_check_args(\"ii\")) {\n\t\treturn;\n\t}\n\n\tValueVector& vec = (CLEVER_GET_OBJECT(ArrayObject*, CLEVER_THIS()))->getData();\n\n\tif (!vec.size()){\n\t\tresult->setNull();\n\t\treturn;\n\t}\n\n\tlong bounds[3] = {CLEVER_ARG_INT(0), CLEVER_ARG_INT(1), (long) vec.size()};\n\tValueVector ran;\n\n\tbool reverse = (bounds[0] > bounds[1]);\n\twhile((reverse ? (bounds[1] <= bounds[0]) : (bounds[0] <= bounds[1]))) {\n\t\tif ((bounds[0] < 0 || bounds[1] < 0) ||\n\t\t\t(bounds[0] > bounds[2]) || (bounds[1] > bounds[2])) {\n\t\t\tbreak;\n\t\t}\n\t\t\n\t\tran.push_back(vec[bounds[0]]);\n\t\t\n\t\tif (reverse) {\n\t\t\t--bounds[0];\n\t\t} else { ++bounds[0]; }\n\t}\n\t\n\tCLEVER_RETURN_ARRAY(CLEVER_ARRAY_TYPE->allocData(&ran));\n}\n\n\/\/ Array Array::each(function)\n\/\/ Calls function once for each element in the array, passing the element as the only parameter to function\n\/\/ The return values from function are returned in the same order as the array\nCLEVER_METHOD(ArrayType::each)\n{\n\tif (!clever_check_args(\"f\")) {\n\t\treturn;\n\t}\n\n\tFunction* func = static_cast<Function*>(args[0]->getObj());\n\tValueVector& vec = (CLEVER_GET_OBJECT(ArrayObject*, CLEVER_THIS()))->getData();\n\tValueVector results;\n\n\tfor (size_t i = 0; i < vec.size(); i++) {\n\t\tValueVector tmp_args;\n\n\t\ttmp_args.push_back(vec[i]);\n\n\t\tresults.push_back(const_cast<VM*>(vm)->runFunction(func, &tmp_args));\n\t}\n\n\tCLEVER_RETURN_ARRAY(CLEVER_ARRAY_TYPE->allocData(&results));\n\n\tfor (size_t i = 0, j = results.size(); i < j; ++i) {\n\t\tresults[i]->delRef();\n\t}\n}\n\n\/\/ mixed Array.erase(int position)\n\/\/ Removes from this array the element at position, returning the value\nCLEVER_METHOD(ArrayType::erase)\n{\n\tif (!clever_check_args(\"i\")) {\n\t\treturn;\n\t}\n\n\tsize_t length;\n\tValueVector& vec = (CLEVER_GET_OBJECT(ArrayObject*, CLEVER_THIS()))->getData();\n\t\n\tif (!(length = vec.size())) {\n\t\tresult->setNull();\n\t\treturn;\n\t}\n\n\tif ((args[0]->getInt()) >= 0 &&\n\t\t(size_t(args[0]->getInt()) < length)) {\t\n\t\t\n\t\tresult->copy(vec[args[0]->getInt()]);\n\t\t\n\t\tvec[args[0]->getInt()]->delRef();\n\n\t\tvec.erase(vec.begin()+args[0]->getInt());\n\t}\n}\n\n\/\/ Type initialization\nCLEVER_TYPE_INIT(ArrayType::init)\n{\n\taddMethod(new Function(\"append\", (MethodPtr) &ArrayType::append));\n\taddMethod(new Function(\"size\", (MethodPtr) &ArrayType::size));\n\taddMethod(new Function(\"at\", (MethodPtr) &ArrayType::at));\n\taddMethod(new Function(\"reserve\", (MethodPtr) &ArrayType::reserve));\n\taddMethod(new Function(\"reverse\", (MethodPtr) &ArrayType::reverse));\n\taddMethod(new Function(\"each\", (MethodPtr) &ArrayType::each));\n\taddMethod(new Function(\"shift\", (MethodPtr) &ArrayType::shift));\n\taddMethod(new Function(\"pop\", (MethodPtr) &ArrayType::pop));\n\taddMethod(new Function(\"range\", (MethodPtr) &ArrayType::range));\n\taddMethod(new Function(\"erase\",\t (MethodPtr) &ArrayType::erase));\n}\n\n} \/\/ clever\n<commit_msg>fix memory leak on pop\/shift<commit_after>\/**\n * Clever programming language\n * Copyright (c) Clever Team\n *\n * This file is distributed under the MIT license. See LICENSE for details.\n *\/\n\n#include \"core\/value.h\"\n#include \"core\/vm.h\"\n#include \"types\/array.h\"\n#include \"types\/function.h\"\n\nnamespace clever {\n\nvoid* ArrayType::allocData(CLEVER_TYPE_CTOR_ARGS) const\n{\n\tArrayObject* arr = new ArrayObject();\n\tValueVector& vec = arr->getData();\n\n\tfor (size_t i = 0, j = args->size(); i < j; ++i) {\n\t\tvec.push_back(args->at(i)->clone());\n\t}\n\n\treturn arr;\n}\n\nvoid ArrayType::deallocData(void* data)\n{\n\tArrayObject* arr = static_cast<ArrayObject*>(data);\n\tValueVector& vec = arr->getData();\n\n\tfor (size_t i = 0, j = vec.size(); i < j; ++i) {\n\t\tvec[i]->delRef();\n\t}\n\n\tdelete arr;\n}\n\nvoid ArrayType::dump(const void* value, std::ostream& out) const\n{\n\tValue::DataValue* data = static_cast<Value::DataValue*>(const_cast<void*>(value));\n\tValueVector& vec = (static_cast<ArrayObject*>(data->obj->getObj()))->getData();\n\n\tout << \"[\";\n\n\tfor (size_t i = 0, j = vec.size(); i < j; ++i) {\n\t\tvec.at(i)->dump(out);\n\t\tif (i < j-1) {\n\t\t\tout << \", \";\n\t\t}\n\t}\n\n\tout << \"]\";\n}\n\n\/\/ void Array::append([arg, ... ])\nCLEVER_METHOD(ArrayType::append)\n{\n\tif (args.size()) {\n\t\tValueVector& vec = (CLEVER_GET_OBJECT(ArrayObject*, CLEVER_THIS()))->getData();\n\n\t\tfor (size_t i = 0, j = args.size(); i < j; ++i) {\n\t\t\tvec.push_back(args[i]->clone());\n\t\t}\n\t}\n\tresult->setNull();\n}\n\n\/\/ int Array::size()\nCLEVER_METHOD(ArrayType::size)\n{\n\tif (!clever_check_no_args()) {\n\t\treturn;\n\t}\n\n\tresult->setInt((CLEVER_GET_OBJECT(ArrayObject*, CLEVER_THIS()))->getData().size());\n}\n\n\/\/ mixed Array::at(int position)\nCLEVER_METHOD(ArrayType::at)\n{\n\tif (!clever_check_args(\"i\")) {\n\t\treturn;\n\t}\n\n\tValueVector& arr = (CLEVER_GET_OBJECT(ArrayObject*, CLEVER_THIS()))->getData();\n\n\tif (args[0]->getInt() < 0\n\t\t|| arr.size() <= size_t(args[0]->getInt())) {\n\t\tresult->setNull();\n\t\treturn;\n\t}\n\n\tresult->copy(arr.at(args[0]->getInt()));\n}\n\n\/\/ void Array::reserve(int size)\nCLEVER_METHOD(ArrayType::reserve)\n{\n\tif (!clever_check_args(\"i\")) {\n\t\treturn;\n\t}\n\n\tArrayObject* arr = CLEVER_GET_OBJECT(ArrayObject*, CLEVER_THIS());\n\n\tresult->setNull();\n\n\tif (args[0]->getInt() < 0) {\n\t\treturn;\n\t}\n\n\tarr->getData().reserve(args[0]->getInt());\n}\n\n\/\/ Array Array::reverse()\n\/\/ Returns the reverse of this array\nCLEVER_METHOD(ArrayType::reverse)\n{\n\tValueVector& vec = (CLEVER_GET_OBJECT(ArrayObject*, CLEVER_THIS()))->getData();\n\tValueVector::reverse_iterator it(vec.rbegin()), end(vec.rend());\n\tValueVector rev;\n\n\twhile (it != end){\n\t\trev.push_back((*it));\n\t\tit++;\n\t}\n\n\tCLEVER_RETURN_ARRAY(CLEVER_ARRAY_TYPE->allocData(&rev));\n}\n\n\/\/ mixed Array.shift()\n\/\/ Removes and returns the first element of the array\nCLEVER_METHOD(ArrayType::shift)\n{\n\tValueVector& vec = (CLEVER_GET_OBJECT(ArrayObject*, CLEVER_THIS()))->getData();\n\t\n\tif (!vec.size()) {\n\t\tresult->setNull();\n\t\treturn;\n\t}\n\t\n\tresult->copy(\n\t\tvec[0]\n\t);\t\n\tvec[0]->delRef();\n\t\n\tValueVector(vec.begin()+1, vec.end()).swap(vec);\n}\n\n\/\/ mixed Array.pop()\n\/\/ Removes and returns the last element of the array\nCLEVER_METHOD(ArrayType::pop)\n{\n\tValueVector& vec = (CLEVER_GET_OBJECT(ArrayObject*, CLEVER_THIS()))->getData();\n\t\n\tif (!vec.size()) {\n\t\tresult->setNull();\t\n\t\treturn;\n\t}\n\t\n\tresult->copy(\n\t\tvec[vec.size()-1]\n\t);\t\n\tvec[vec.size()-1]->delRef();\n\t\n\tValueVector(vec.begin(), vec.end()-1).swap(vec);\n}\n\n\/\/ Array Array.range(int start, int end)\n\/\/ Returns a range as a new array\nCLEVER_METHOD(ArrayType::range)\n{\n\tif (!clever_check_args(\"ii\")) {\n\t\treturn;\n\t}\n\n\tValueVector& vec = (CLEVER_GET_OBJECT(ArrayObject*, CLEVER_THIS()))->getData();\n\n\tif (!vec.size()){\n\t\tresult->setNull();\n\t\treturn;\n\t}\n\n\tlong bounds[3] = {CLEVER_ARG_INT(0), CLEVER_ARG_INT(1), (long) vec.size()};\n\tValueVector ran;\n\n\tbool reverse = (bounds[0] > bounds[1]);\n\twhile((reverse ? (bounds[1] <= bounds[0]) : (bounds[0] <= bounds[1]))) {\n\t\tif ((bounds[0] < 0 || bounds[1] < 0) ||\n\t\t\t(bounds[0] > bounds[2]) || (bounds[1] > bounds[2])) {\n\t\t\tbreak;\n\t\t}\n\t\t\n\t\tran.push_back(vec[bounds[0]]);\n\t\t\n\t\tif (reverse) {\n\t\t\t--bounds[0];\n\t\t} else { ++bounds[0]; }\n\t}\n\t\n\tCLEVER_RETURN_ARRAY(CLEVER_ARRAY_TYPE->allocData(&ran));\n}\n\n\/\/ Array Array::each(function)\n\/\/ Calls function once for each element in the array, passing the element as the only parameter to function\n\/\/ The return values from function are returned in the same order as the array\nCLEVER_METHOD(ArrayType::each)\n{\n\tif (!clever_check_args(\"f\")) {\n\t\treturn;\n\t}\n\n\tFunction* func = static_cast<Function*>(args[0]->getObj());\n\tValueVector& vec = (CLEVER_GET_OBJECT(ArrayObject*, CLEVER_THIS()))->getData();\n\tValueVector results;\n\n\tfor (size_t i = 0; i < vec.size(); i++) {\n\t\tValueVector tmp_args;\n\n\t\ttmp_args.push_back(vec[i]);\n\n\t\tresults.push_back(const_cast<VM*>(vm)->runFunction(func, &tmp_args));\n\t}\n\n\tCLEVER_RETURN_ARRAY(CLEVER_ARRAY_TYPE->allocData(&results));\n\n\tfor (size_t i = 0, j = results.size(); i < j; ++i) {\n\t\tresults[i]->delRef();\n\t}\n}\n\n\/\/ mixed Array.erase(int position)\n\/\/ Removes from this array the element at position, returning the value\nCLEVER_METHOD(ArrayType::erase)\n{\n\tif (!clever_check_args(\"i\")) {\n\t\treturn;\n\t}\n\n\tsize_t length;\n\tValueVector& vec = (CLEVER_GET_OBJECT(ArrayObject*, CLEVER_THIS()))->getData();\n\t\n\tif (!(length = vec.size())) {\n\t\tresult->setNull();\n\t\treturn;\n\t}\n\n\tif ((args[0]->getInt()) >= 0 &&\n\t\t(size_t(args[0]->getInt()) < length)) {\t\n\t\t\n\t\tresult->copy(vec[args[0]->getInt()]);\n\t\t\n\t\tvec[args[0]->getInt()]->delRef();\n\n\t\tvec.erase(vec.begin()+args[0]->getInt());\n\t}\n}\n\n\/\/ Type initialization\nCLEVER_TYPE_INIT(ArrayType::init)\n{\n\taddMethod(new Function(\"append\", (MethodPtr) &ArrayType::append));\n\taddMethod(new Function(\"size\", (MethodPtr) &ArrayType::size));\n\taddMethod(new Function(\"at\", (MethodPtr) &ArrayType::at));\n\taddMethod(new Function(\"reserve\", (MethodPtr) &ArrayType::reserve));\n\taddMethod(new Function(\"reverse\", (MethodPtr) &ArrayType::reverse));\n\taddMethod(new Function(\"each\", (MethodPtr) &ArrayType::each));\n\taddMethod(new Function(\"shift\", (MethodPtr) &ArrayType::shift));\n\taddMethod(new Function(\"pop\", (MethodPtr) &ArrayType::pop));\n\taddMethod(new Function(\"range\", (MethodPtr) &ArrayType::range));\n\taddMethod(new Function(\"erase\",\t (MethodPtr) &ArrayType::erase));\n}\n\n} \/\/ clever\n<|endoftext|>"} {"text":"<commit_before>\/* This software is released under the BSD License.\n |\n | Copyright (c) 2014-2015, Kevin P. Barry [ta0kira@gmail.com]\n | All rights reserved.\n |\n | Redistribution and use in source and binary forms, with or without\n | modification, are permitted provided that the following conditions are met:\n |\n | - Redistributions of source code must retain the above copyright notice, 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 Locking Container Project 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 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\/* This file provides a template class that protects access to an object with\n * locks of various types. Conventional mutex-protection methods are susceptible\n * to bugs caused by forgetting (or neglecting) to lock\/unlock the mutex. This\n * class eliminates the need to remember because the only access to the\n * protected object is via a proxy object that holds the lock until the\n * reference count of the proxy reaches 0 (like a shared pointer).\n *\n * This header contains one main class 'locking_container <class, class>', where\n * the first argument is the type of object being protected, and the second is\n * the type of lock to be used. A few lock choices are provided. See\n * locks.hpp for more information.\n *\n * Each lock type has a corresponding 'lock_auth' specialization for use with\n * deadlock prevention. All of them have (somewhat) identical behavior to their\n * corresponding lock types, as far as how many read and write locks can be held\n * at a given time. See lock-auth.hpp for more information.\n *\n * If you want both deadlock prevention and the ability for threads to hold\n * a write lock plus one or more other locks at the same time, you can create a\n * 'null_container' for use by all threads when obtaining locks for any object.\n * The behavior will be transparent until a thread requests a \"multi-lock\" by\n * attempting to obtain a write lock on the 'null_container'. This will block\n * all future locks on the objects, allowing the thread in question to lock as\n * many objects as it needs to. To access this behavior, use 'get_write_multi'\n * and 'get_read_multi' instead of 'get_write_auth' and 'get_read_auth', passing\n * the 'null_container' as the first argument.\n *\n * Other notes:\n *\n * - You must enable C++11 (or higher) when using this header.\n *\n * - You might need to link your executable with libpthread after compiling.\n *\n * - To copy a container, you must first get a proxy from it, then construct\n * the copy with the corresponding object. To assign one container to\n * another, you must first get proxies to both objects. (The\n * 'try_copy_container' global functions manage the latter automatically.)\n * Because of this, you cannot copy a 'const' container because there is no\n * 'const' way to get a proxy.\n *\/\n\n\n\/*! \\file locking-container.hpp\n * \\brief C++ container for data protection in multithreaded programs.\n * \\author Kevin P. Barry\n *\/\n\n#ifndef locking_container_hpp\n#define locking_container_hpp\n\n#include <assert.h>\n\n#include \"locks.hpp\"\n#include \"lock-auth.hpp\"\n#include \"object-proxy.hpp\"\n#include \"null-container.hpp\"\n\n\n\/*! \\class locking_container_base\n \\brief Base class for \\ref locking_container.\n *\/\n\ntemplate <class Type>\nclass locking_container_base {\npublic:\n typedef Type type;\n typedef object_proxy <type> write_proxy;\n typedef object_proxy <const type> read_proxy;\n typedef lock_auth_base::auth_type auth_type;\n\n \/** @name Accessor Functions\n *\n *\/\n \/\/@{\n\n \/*! \\brief Retrieve a writable proxy to the contained object.\n *\n * @see object_proxy\n * \\attention Always check that the returned object contains a valid\n * pointer with object_proxy::operator!. The reference will always be\n * invalid if a lock hasn't been obtained.\n * \\attention The returned object should only be passed by value, and it\n * should only be passed within the same thread that\n * \\ref locking_container::get_write was called from. This is because the\n * proxy object uses reference counting that isn't reentrant.\n * \\param block Should the call block for a lock?\n *\n * \\return proxy object\n *\/\n inline write_proxy get_write(bool block = true) {\n return this->get_write_auth(NULL, block);\n }\n\n \/*! \\brief Retrieve a read-only proxy to the contained object.\n *\n * @see get_write\n * \\param block Should the call block for a lock?\n *\n * \\return proxy object\n *\/\n inline read_proxy get_read(bool block = true) {\n return this->get_read_auth(NULL, block);\n }\n\n \/*! \\brief Retrieve a writable proxy to the contained object using deadlock\n * prevention.\n *\n * @see get_write\n * \\param authorization Authorization object to prevent deadlocks.\n * \\param block Should the call block for a lock?\n *\n * \\return proxy object\n *\/\n inline write_proxy get_write_auth(auth_type &authorization, bool block = true) {\n return this->get_write_auth(authorization.get(), block);\n }\n\n \/*! \\brief Retrieve a read-only proxy to the contained object using deadlock\n * prevention.\n *\n * @see get_write\n * \\param authorization Authorization object to prevent deadlocks.\n * \\param block Should the call block for a lock?\n *\n * \\return proxy object\n *\/\n inline read_proxy get_read_auth(auth_type &authorization, bool block = true) {\n return this->get_read_auth(authorization.get(), block);\n }\n\n virtual write_proxy get_write_auth(lock_auth_base *authorization, bool block = true) = 0;\n virtual read_proxy get_read_auth(lock_auth_base *authorization, bool block = true) = 0;\n\n \/*! \\brief Retrieve a writable proxy to the contained object using deadlock\n * prevention and multiple locking functionality.\n *\n * @see get_write_auth\n * \\param multi_lock Multi-lock object to manage multiple locks.\n * \\param authorization Authorization object to prevent deadlocks.\n * \\param block Should the call block for a lock?\n *\n * \\return proxy object\n *\/\n inline write_proxy get_write_multi(null_container_base &multi_lock,\n lock_auth_base *authorization, bool block = true) {\n return this->get_write_multi(multi_lock.get_lock_object(), authorization, block);\n }\n\n \/*! \\brief Retrieve a read-only proxy to the contained object using deadlock\n * prevention and multiple locking functionality.\n *\n * @see get_write_auth\n * \\param multi_lock Multi-lock object to manage multiple locks.\n * \\param authorization Authorization object to prevent deadlocks.\n * \\param block Should the call block for a lock?\n *\n * \\return proxy object\n *\/\n inline read_proxy get_read_multi(null_container_base &multi_lock,\n lock_auth_base *authorization, bool block = true) {\n return this->get_read_multi(multi_lock.get_lock_object(), authorization, block);\n }\n\n \/*! @see get_write_multi.*\/\n inline write_proxy get_write_multi(null_container_base &multi_lock,\n auth_type &authorization, bool block = true) {\n return this->get_write_multi(multi_lock, authorization.get(), block);\n }\n\n \/*! @see get_read_multi.*\/\n inline read_proxy get_read_multi(null_container_base &multi_lock,\n auth_type &authorization, bool block = true) {\n return this->get_read_multi(multi_lock, authorization.get(), block);\n }\n\n \/\/@}\n\n virtual auth_type get_new_auth() const {\n return auth_type();\n }\n\n virtual inline ~locking_container_base() {}\n\nprotected:\n virtual write_proxy get_write_multi(lock_base *\/*multi_lock*\/,\n lock_auth_base *\/*authorization*\/, bool \/*block*\/) {\n return write_proxy();\n }\n\n virtual read_proxy get_read_multi(lock_base *\/*multi_lock*\/,\n lock_auth_base *\/*authorization*\/, bool \/*block*\/) {\n return read_proxy();\n }\n};\n\n\n\/*! \\class locking_container\n * \\brief C++ container class with automatic unlocking, concurrent reads, and\n * deadlock prevention.\n *\n * Each instance of this class contains a lock and an encapsulated object of\n * the type denoted by the template parameter. The\n * \\ref locking_container::get_write and \\ref locking_container::get_read\n * functions provide a proxy object (see \\ref object_proxy) that automatically\n * locks and unlocks the lock to simplify code that accesses the encapsulated\n * object.\n *\/\n\ntemplate <class Type, class Lock = rw_lock>\nclass locking_container : public locking_container_base <Type> {\nprivate:\n typedef lock_auth <Lock> auth_base_type;\n\npublic:\n typedef locking_container_base <Type> base;\n using typename base::type;\n using typename base::write_proxy;\n using typename base::read_proxy;\n using typename base::auth_type;\n \/\/NOTE: this is needed so that the 'lock_auth_base' variants are pulled in\n using base::get_write_auth;\n using base::get_read_auth;\n using base::get_write_multi;\n using base::get_read_multi;\n\n \/*! \\brief Constructor.\n *\n * \\param Object Object to copy as contained object.\n *\/\n explicit locking_container(const type &Object = type()) : contained(Object) {}\n\nprivate:\n locking_container(const locking_container&);\n locking_container &operator = (const locking_container&);\n\npublic:\n \/** @name Accessor Functions\n *\n *\/\n \/\/@{\n\n \/*! @see locking_container_base::get_write_auth.*\/\n inline write_proxy get_write_auth(lock_auth_base *authorization, bool block = true) {\n return this->get_write_multi(NULL, authorization, block);\n }\n\n \/*! @see locking_container_base::get_read_auth.*\/\n inline read_proxy get_read_auth(lock_auth_base *authorization, bool block = true) {\n return this->get_read_multi(NULL, authorization, block);\n }\n\n \/\/@}\n\n \/** @name New Authorization Objects\n *\n *\/\n \/\/@{\n\n \/*! Get a new authorization object.*\/\n virtual auth_type get_new_auth() const {\n return locking_container::new_auth();\n }\n\n \/*! Get a new authorization object.*\/\n static auth_type new_auth() {\n return auth_type(new auth_base_type);\n }\n\n \/\/@}\n\nprivate:\n inline write_proxy get_write_multi(lock_base *multi_lock, lock_auth_base *authorization, bool block = true) {\n \/\/NOTE: no read\/write choice is given here!\n return write_proxy(&contained, &locks, authorization, block, multi_lock);\n }\n\n inline read_proxy get_read_multi(lock_base *multi_lock, lock_auth_base *authorization,\n bool block = true) {\n return read_proxy(&contained, &locks, authorization, true, block, multi_lock);\n }\n\n type contained;\n Lock locks;\n};\n\n\n\/*! \\brief Attempt to copy one container's contents into another.\n *\n * @note This will attempt to obtain locks for both containers, and will fail if\n * either lock operation fails.\n *\n * \\param left container being assigned to\n * \\param right container being assigned\n * \\param authorization authorization object\n * \\param block whether or not to block when locking the containers\n * \\return success or failure, based entirely on locking success\n *\/\ntemplate <class Type1, class Type2>\ninline bool try_copy_container(locking_container_base <Type1> &left,\n locking_container_base <Type2> &right, lock_auth_base *authorization,\n bool block = true) {\n typename locking_container_base <Type1> ::write_proxy write =\n left.get_write_auth(authorization, block);\n if (!write) return false;\n\n typename locking_container_base <Type2> ::read_proxy read =\n right.get_read_auth(authorization, block);\n if (!read) return false;\n\n *write = *read;\n return true;\n}\n\n\n\/*! Attempt to copy one container's contents into another.*\/\ntemplate <class Type1, class Type2>\ninline bool try_copy_container(locking_container_base <Type1> &left,\n locking_container_base <Type2> &right, bool block = true) {\n return try_copy_container(left, right, NULL, block);\n}\n\n\n\/*! Attempt to copy one container's contents into another.*\/\ntemplate <class Type1, class Type2>\ninline bool try_copy_container(locking_container_base <Type1> &left,\n locking_container_base <Type2> &right, lock_auth_base::auth_type &authorization,\n bool block = true) {\n return try_copy_container(left, right, authorization.get(), block);\n}\n\n\/*! \\brief Attempt to copy one container's contents into another.\n *\n * @note This will attempt to obtain locks for both containers using the\n * \\ref null_container_base object, and will fail if either lock operation\n * fails.\n * \\attention This will only work if no other thread holds a lock on either of\n * the containers.\n * \\attention If Trymulti_lock is false, his will fail if the caller doesn't have a\n * write lock on the \\ref null_container_base passed.\n *\n * \\param left container being assigned to\n * \\param right container being assigned\n * \\param multi_lock multi-lock tracking object\n * \\param authorization authorization object\n * \\param block whether or not to block when locking the containers\n * \\param Trymulti_lock whether or not to attempt a write lock on multi_lock\n * \\return success or failure, based entirely on locking success\n *\/\ntemplate <class Type1, class Type2>\ninline bool try_copy_container(locking_container_base <Type1> &left,\n locking_container_base <Type2> &right, null_container_base &multi_lock,\n lock_auth_base *authorization, bool block = true, bool Trymulti_lock = true) {\n null_container::write_proxy multi;\n if (Trymulti_lock && !(multi = multi_lock.get_write_auth(authorization, block))) return false;\n\n typename locking_container_base <Type1> ::write_proxy write =\n left.get_write_multi(multi_lock, authorization, block);\n if (!write) return false;\n\n typename locking_container_base <Type2> ::read_proxy read =\n right.get_read_multi(multi_lock, authorization, block);\n if (!read) return false;\n\n if (Trymulti_lock) multi.clear();\n\n *write = *read;\n return true;\n}\n\n\/*! Attempt to copy one container's contents into another.*\/\ntemplate <class Type1, class Type2>\ninline bool try_copy_container(locking_container_base <Type1> &left,\n locking_container_base <Type2> &right, null_container_base &multi_lock,\n lock_auth_base::auth_type &authorization, bool block = true, bool Trymulti_lock = true) {\n return try_copy_container(left, right, multi_lock, authorization.get(), block, Trymulti_lock);\n}\n\n#endif \/\/locking_container_hpp\n<commit_msg>silly update to whitespace around commented-out argument names<commit_after>\/* This software is released under the BSD License.\n |\n | Copyright (c) 2014-2015, Kevin P. Barry [ta0kira@gmail.com]\n | All rights reserved.\n |\n | Redistribution and use in source and binary forms, with or without\n | modification, are permitted provided that the following conditions are met:\n |\n | - Redistributions of source code must retain the above copyright notice, 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 Locking Container Project 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 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\/* This file provides a template class that protects access to an object with\n * locks of various types. Conventional mutex-protection methods are susceptible\n * to bugs caused by forgetting (or neglecting) to lock\/unlock the mutex. This\n * class eliminates the need to remember because the only access to the\n * protected object is via a proxy object that holds the lock until the\n * reference count of the proxy reaches 0 (like a shared pointer).\n *\n * This header contains one main class 'locking_container <class, class>', where\n * the first argument is the type of object being protected, and the second is\n * the type of lock to be used. A few lock choices are provided. See\n * locks.hpp for more information.\n *\n * Each lock type has a corresponding 'lock_auth' specialization for use with\n * deadlock prevention. All of them have (somewhat) identical behavior to their\n * corresponding lock types, as far as how many read and write locks can be held\n * at a given time. See lock-auth.hpp for more information.\n *\n * If you want both deadlock prevention and the ability for threads to hold\n * a write lock plus one or more other locks at the same time, you can create a\n * 'null_container' for use by all threads when obtaining locks for any object.\n * The behavior will be transparent until a thread requests a \"multi-lock\" by\n * attempting to obtain a write lock on the 'null_container'. This will block\n * all future locks on the objects, allowing the thread in question to lock as\n * many objects as it needs to. To access this behavior, use 'get_write_multi'\n * and 'get_read_multi' instead of 'get_write_auth' and 'get_read_auth', passing\n * the 'null_container' as the first argument.\n *\n * Other notes:\n *\n * - You must enable C++11 (or higher) when using this header.\n *\n * - You might need to link your executable with libpthread after compiling.\n *\n * - To copy a container, you must first get a proxy from it, then construct\n * the copy with the corresponding object. To assign one container to\n * another, you must first get proxies to both objects. (The\n * 'try_copy_container' global functions manage the latter automatically.)\n * Because of this, you cannot copy a 'const' container because there is no\n * 'const' way to get a proxy.\n *\/\n\n\n\/*! \\file locking-container.hpp\n * \\brief C++ container for data protection in multithreaded programs.\n * \\author Kevin P. Barry\n *\/\n\n#ifndef locking_container_hpp\n#define locking_container_hpp\n\n#include <assert.h>\n\n#include \"locks.hpp\"\n#include \"lock-auth.hpp\"\n#include \"object-proxy.hpp\"\n#include \"null-container.hpp\"\n\n\n\/*! \\class locking_container_base\n \\brief Base class for \\ref locking_container.\n *\/\n\ntemplate <class Type>\nclass locking_container_base {\npublic:\n typedef Type type;\n typedef object_proxy <type> write_proxy;\n typedef object_proxy <const type> read_proxy;\n typedef lock_auth_base::auth_type auth_type;\n\n \/** @name Accessor Functions\n *\n *\/\n \/\/@{\n\n \/*! \\brief Retrieve a writable proxy to the contained object.\n *\n * @see object_proxy\n * \\attention Always check that the returned object contains a valid\n * pointer with object_proxy::operator!. The reference will always be\n * invalid if a lock hasn't been obtained.\n * \\attention The returned object should only be passed by value, and it\n * should only be passed within the same thread that\n * \\ref locking_container::get_write was called from. This is because the\n * proxy object uses reference counting that isn't reentrant.\n * \\param block Should the call block for a lock?\n *\n * \\return proxy object\n *\/\n inline write_proxy get_write(bool block = true) {\n return this->get_write_auth(NULL, block);\n }\n\n \/*! \\brief Retrieve a read-only proxy to the contained object.\n *\n * @see get_write\n * \\param block Should the call block for a lock?\n *\n * \\return proxy object\n *\/\n inline read_proxy get_read(bool block = true) {\n return this->get_read_auth(NULL, block);\n }\n\n \/*! \\brief Retrieve a writable proxy to the contained object using deadlock\n * prevention.\n *\n * @see get_write\n * \\param authorization Authorization object to prevent deadlocks.\n * \\param block Should the call block for a lock?\n *\n * \\return proxy object\n *\/\n inline write_proxy get_write_auth(auth_type &authorization, bool block = true) {\n return this->get_write_auth(authorization.get(), block);\n }\n\n \/*! \\brief Retrieve a read-only proxy to the contained object using deadlock\n * prevention.\n *\n * @see get_write\n * \\param authorization Authorization object to prevent deadlocks.\n * \\param block Should the call block for a lock?\n *\n * \\return proxy object\n *\/\n inline read_proxy get_read_auth(auth_type &authorization, bool block = true) {\n return this->get_read_auth(authorization.get(), block);\n }\n\n virtual write_proxy get_write_auth(lock_auth_base *authorization, bool block = true) = 0;\n virtual read_proxy get_read_auth(lock_auth_base *authorization, bool block = true) = 0;\n\n \/*! \\brief Retrieve a writable proxy to the contained object using deadlock\n * prevention and multiple locking functionality.\n *\n * @see get_write_auth\n * \\param multi_lock Multi-lock object to manage multiple locks.\n * \\param authorization Authorization object to prevent deadlocks.\n * \\param block Should the call block for a lock?\n *\n * \\return proxy object\n *\/\n inline write_proxy get_write_multi(null_container_base &multi_lock,\n lock_auth_base *authorization, bool block = true) {\n return this->get_write_multi(multi_lock.get_lock_object(), authorization, block);\n }\n\n \/*! \\brief Retrieve a read-only proxy to the contained object using deadlock\n * prevention and multiple locking functionality.\n *\n * @see get_write_auth\n * \\param multi_lock Multi-lock object to manage multiple locks.\n * \\param authorization Authorization object to prevent deadlocks.\n * \\param block Should the call block for a lock?\n *\n * \\return proxy object\n *\/\n inline read_proxy get_read_multi(null_container_base &multi_lock,\n lock_auth_base *authorization, bool block = true) {\n return this->get_read_multi(multi_lock.get_lock_object(), authorization, block);\n }\n\n \/*! @see get_write_multi.*\/\n inline write_proxy get_write_multi(null_container_base &multi_lock,\n auth_type &authorization, bool block = true) {\n return this->get_write_multi(multi_lock, authorization.get(), block);\n }\n\n \/*! @see get_read_multi.*\/\n inline read_proxy get_read_multi(null_container_base &multi_lock,\n auth_type &authorization, bool block = true) {\n return this->get_read_multi(multi_lock, authorization.get(), block);\n }\n\n \/\/@}\n\n virtual auth_type get_new_auth() const {\n return auth_type();\n }\n\n virtual inline ~locking_container_base() {}\n\nprotected:\n virtual write_proxy get_write_multi(lock_base* \/*multi_lock*\/,\n lock_auth_base* \/*authorization*\/, bool \/*block*\/) {\n return write_proxy();\n }\n\n virtual read_proxy get_read_multi(lock_base* \/*multi_lock*\/,\n lock_auth_base* \/*authorization*\/, bool \/*block*\/) {\n return read_proxy();\n }\n};\n\n\n\/*! \\class locking_container\n * \\brief C++ container class with automatic unlocking, concurrent reads, and\n * deadlock prevention.\n *\n * Each instance of this class contains a lock and an encapsulated object of\n * the type denoted by the template parameter. The\n * \\ref locking_container::get_write and \\ref locking_container::get_read\n * functions provide a proxy object (see \\ref object_proxy) that automatically\n * locks and unlocks the lock to simplify code that accesses the encapsulated\n * object.\n *\/\n\ntemplate <class Type, class Lock = rw_lock>\nclass locking_container : public locking_container_base <Type> {\nprivate:\n typedef lock_auth <Lock> auth_base_type;\n\npublic:\n typedef locking_container_base <Type> base;\n using typename base::type;\n using typename base::write_proxy;\n using typename base::read_proxy;\n using typename base::auth_type;\n \/\/NOTE: this is needed so that the 'lock_auth_base' variants are pulled in\n using base::get_write_auth;\n using base::get_read_auth;\n using base::get_write_multi;\n using base::get_read_multi;\n\n \/*! \\brief Constructor.\n *\n * \\param Object Object to copy as contained object.\n *\/\n explicit locking_container(const type &Object = type()) : contained(Object) {}\n\nprivate:\n locking_container(const locking_container&);\n locking_container &operator = (const locking_container&);\n\npublic:\n \/** @name Accessor Functions\n *\n *\/\n \/\/@{\n\n \/*! @see locking_container_base::get_write_auth.*\/\n inline write_proxy get_write_auth(lock_auth_base *authorization, bool block = true) {\n return this->get_write_multi(NULL, authorization, block);\n }\n\n \/*! @see locking_container_base::get_read_auth.*\/\n inline read_proxy get_read_auth(lock_auth_base *authorization, bool block = true) {\n return this->get_read_multi(NULL, authorization, block);\n }\n\n \/\/@}\n\n \/** @name New Authorization Objects\n *\n *\/\n \/\/@{\n\n \/*! Get a new authorization object.*\/\n virtual auth_type get_new_auth() const {\n return locking_container::new_auth();\n }\n\n \/*! Get a new authorization object.*\/\n static auth_type new_auth() {\n return auth_type(new auth_base_type);\n }\n\n \/\/@}\n\nprivate:\n inline write_proxy get_write_multi(lock_base *multi_lock, lock_auth_base *authorization, bool block = true) {\n \/\/NOTE: no read\/write choice is given here!\n return write_proxy(&contained, &locks, authorization, block, multi_lock);\n }\n\n inline read_proxy get_read_multi(lock_base *multi_lock, lock_auth_base *authorization,\n bool block = true) {\n return read_proxy(&contained, &locks, authorization, true, block, multi_lock);\n }\n\n type contained;\n Lock locks;\n};\n\n\n\/*! \\brief Attempt to copy one container's contents into another.\n *\n * @note This will attempt to obtain locks for both containers, and will fail if\n * either lock operation fails.\n *\n * \\param left container being assigned to\n * \\param right container being assigned\n * \\param authorization authorization object\n * \\param block whether or not to block when locking the containers\n * \\return success or failure, based entirely on locking success\n *\/\ntemplate <class Type1, class Type2>\ninline bool try_copy_container(locking_container_base <Type1> &left,\n locking_container_base <Type2> &right, lock_auth_base *authorization,\n bool block = true) {\n typename locking_container_base <Type1> ::write_proxy write =\n left.get_write_auth(authorization, block);\n if (!write) return false;\n\n typename locking_container_base <Type2> ::read_proxy read =\n right.get_read_auth(authorization, block);\n if (!read) return false;\n\n *write = *read;\n return true;\n}\n\n\n\/*! Attempt to copy one container's contents into another.*\/\ntemplate <class Type1, class Type2>\ninline bool try_copy_container(locking_container_base <Type1> &left,\n locking_container_base <Type2> &right, bool block = true) {\n return try_copy_container(left, right, NULL, block);\n}\n\n\n\/*! Attempt to copy one container's contents into another.*\/\ntemplate <class Type1, class Type2>\ninline bool try_copy_container(locking_container_base <Type1> &left,\n locking_container_base <Type2> &right, lock_auth_base::auth_type &authorization,\n bool block = true) {\n return try_copy_container(left, right, authorization.get(), block);\n}\n\n\/*! \\brief Attempt to copy one container's contents into another.\n *\n * @note This will attempt to obtain locks for both containers using the\n * \\ref null_container_base object, and will fail if either lock operation\n * fails.\n * \\attention This will only work if no other thread holds a lock on either of\n * the containers.\n * \\attention If Trymulti_lock is false, his will fail if the caller doesn't have a\n * write lock on the \\ref null_container_base passed.\n *\n * \\param left container being assigned to\n * \\param right container being assigned\n * \\param multi_lock multi-lock tracking object\n * \\param authorization authorization object\n * \\param block whether or not to block when locking the containers\n * \\param Trymulti_lock whether or not to attempt a write lock on multi_lock\n * \\return success or failure, based entirely on locking success\n *\/\ntemplate <class Type1, class Type2>\ninline bool try_copy_container(locking_container_base <Type1> &left,\n locking_container_base <Type2> &right, null_container_base &multi_lock,\n lock_auth_base *authorization, bool block = true, bool Trymulti_lock = true) {\n null_container::write_proxy multi;\n if (Trymulti_lock && !(multi = multi_lock.get_write_auth(authorization, block))) return false;\n\n typename locking_container_base <Type1> ::write_proxy write =\n left.get_write_multi(multi_lock, authorization, block);\n if (!write) return false;\n\n typename locking_container_base <Type2> ::read_proxy read =\n right.get_read_multi(multi_lock, authorization, block);\n if (!read) return false;\n\n if (Trymulti_lock) multi.clear();\n\n *write = *read;\n return true;\n}\n\n\/*! Attempt to copy one container's contents into another.*\/\ntemplate <class Type1, class Type2>\ninline bool try_copy_container(locking_container_base <Type1> &left,\n locking_container_base <Type2> &right, null_container_base &multi_lock,\n lock_auth_base::auth_type &authorization, bool block = true, bool Trymulti_lock = true) {\n return try_copy_container(left, right, multi_lock, authorization.get(), block, Trymulti_lock);\n}\n\n#endif \/\/locking_container_hpp\n<|endoftext|>"} {"text":"<commit_before>#ifndef cipClientCapi_h\n#define cipClientCapi_h\n\n\/* $Header$ *\/\n\n\/**\n * @file cipClientCapi.H\n * @brief Cronus & IP eCMD Extension\n\n * Extension Owner : Chris Engel\n*\/\n\n\/\/--------------------------------------------------------------------\n\/\/ Includes\n\/\/--------------------------------------------------------------------\n#include <ecmdReturnCodes.H>\n#include <ecmdStructs.H>\n#include <ecmdDataBuffer.H>\n#include <cipStructs.H>\n\n\/\/--------------------------------------------------------------------\n\/\/ Forward References \n\/\/--------------------------------------------------------------------\n\n\n\/* Functions in here are defined as extern C for the following reasons:\n 1) Keeps Function names small by preventing C++ \"mangling\"\n 2) Allows (C-based) perl interpreter to access these functions\n\n*\/\nextern \"C\" {\n\n\/** @name Load\/Unload Functions *\/\n\/\/@{\n\n\/**\n @brief Initialize eCMD CIP Extension DLL\n @retval ECMD_SUCCESS if successful load\n @retval ECMD_INVALID_DLL_VERSION if Dll version loaded doesn't match client version\n @retval nonzero if unsuccessful\n @post eCMD CIP Extension is initialized and version checked\n\n*\/\nuint32_t cipInitExtension();\n\n\n\/\/@}\n\n\n\/** @name Processor Functions *\/\n\/\/@{\n\n\/**\n @brief Start Instructions\n @param i_target Struct that contains chip and cage\/node\/slot\/position\/core\/thread information \n @retval ECMD_RING_CACHE_ENABLED Ring Cache enabled function - must be disabled to use this function\n @retval ECMD_TARGET_NOT_CONFIGURED if target is not available in the system\n @retval ECMD_SUCCESS if successful\n @retval nonzero if unsuccessful\n @retval ECMD_CLOCKS_IN_INVALID_STATE Chip Clocks were in an invalid state to perform the operation\n\n\n*\/\nuint32_t cipStartInstructions (ecmdChipTarget & i_target);\n\n\/**\n @brief Start Instructions on all configured processors\n @retval ECMD_RING_CACHE_ENABLED Ring Cache enabled function - must be disabled to use this function\n @retval ECMD_SUCCESS if successful\n @retval nonzero if unsuccessful\n @retval ECMD_CLOCKS_IN_INVALID_STATE Chip Clocks were in an invalid state to perform the operation\n\n*\/\nuint32_t cipStartAllInstructions ();\n\n\/**\n @brief Stop Instructions\n @param i_target Struct that contains chip and cage\/node\/slot\/position\/core\/thread information \n @retval ECMD_RING_CACHE_ENABLED Ring Cache enabled function - must be disabled to use this function\n @retval ECMD_TARGET_NOT_CONFIGURED if target is not available in the system\n @retval ECMD_SUCCESS if successful\n @retval nonzero if unsuccessful\n @retval ECMD_CLOCKS_IN_INVALID_STATE Chip Clocks were in an invalid state to perform the operation\n\n\n*\/\nuint32_t cipStopInstructions (ecmdChipTarget & i_target);\n\n\/**\n @brief Stop All Instructions\n @retval ECMD_RING_CACHE_ENABLED Ring Cache enabled function - must be disabled to use this function\n @retval ECMD_SUCCESS if successful\n @retval nonzero if unsuccessful\n @retval ECMD_CLOCKS_IN_INVALID_STATE Chip Clocks were in an invalid state to perform the operation\n\n*\/\nuint32_t cipStopAllInstructions ();\n\n\/**\n @brief Step Instructions\n @param i_target Struct that contains chip and cage\/node\/slot\/position\/core\/thread information\n @param i_steps Number of steps to execute\n @retval ECMD_RING_CACHE_ENABLED Ring Cache enabled function - must be disabled to use this function\n @retval ECMD_TARGET_NOT_CONFIGURED if target is not available in the system\n @retval ECMD_SUCCESS if successful\n @retval nonzero if unsuccessful\n @retval ECMD_CLOCKS_IN_INVALID_STATE Chip Clocks were in an invalid state to perform the operation\n\n\n*\/\nuint32_t cipStepInstructions (ecmdChipTarget & i_target, uint32_t i_steps);\n\n\/**\n @brief Set a hardware breakpoint in Processor using a real address\n @param i_target Struct that contains chip and cage\/node\/slot\/position\/core\/thread information\n @param i_address Address to set breakpoint at\n @param i_type Type of breakpoint to set\n @retval ECMD_TARGET_NOT_CONFIGURED if target is not available in the system\n @retval ECMD_RING_CACHE_ENABLED Ring Cache enabled function - must be disabled to use this function\n @retval ECMD_SUCCESS if successful\n @retval nonzero if unsuccessful\n @retval ECMD_CLOCKS_IN_INVALID_STATE Chip Clocks were in an invalid state to perform the operation\n\n\n*\/\nuint32_t cipSetBreakpoint (ecmdChipTarget & i_target, uint64_t i_address, ecmdBreakpointType_t & i_type);\n\n\/**\n @brief Clear a hardware breakpoint from Processor using a real address\n @param i_target Struct that contains chip and cage\/node\/slot\/position\/core\/thread information\n @param i_address Address to clear breakpoint at\n @param i_type Type of breakpoint to set\n @retval ECMD_TARGET_NOT_CONFIGURED if target is not available in the system\n @retval ECMD_RING_CACHE_ENABLED Ring Cache enabled function - must be disabled to use this function\n @retval ECMD_SUCCESS if successful\n @retval nonzero if unsuccessful\n @retval ECMD_CLOCKS_IN_INVALID_STATE Chip Clocks were in an invalid state to perform the operation\n\n\n*\/\nuint32_t cipClearBreakpoint (ecmdChipTarget & i_target, uint64_t i_address, ecmdBreakpointType_t & i_type);\n\n\n\/**\n @brief Reads the selected Processor Architected VMX Register (VPR) into the data buffer\n @retval ECMD_TARGET_INVALID_TYPE if target is not a processor\n @retval ECMD_TARGET_NOT_CONFIGURED if target is not available in the system\n @retval ECMD_INVALID_ARGS Vpr number is invalid\n @retval ECMD_CLOCKS_IN_INVALID_STATE Chip Clocks were in an invalid state to perform the operation\n @retval ECMD_RING_CACHE_ENABLED Ring Cache enabled function - must be disabled to use this function\n @retval ECMD_SUCCESS if successful read\n @retval nonzero if unsuccessful\n @param i_target Struct that contains chip and cage\/node\/slot\/position\/core\/thread information\n @param i_vprNum Number of vpr to read from\n @param o_data DataBuffer object that holds data read from vpr\n\n*\/\nuint32_t cipGetVpr (ecmdChipTarget & i_target, uint32_t i_vprNum, ecmdDataBuffer & o_data);\n\n\/**\n @brief Reads the selected Processor Architected VMX Register (VPR) into the data buffers\n @retval ECMD_TARGET_INVALID_TYPE if target is not a processor\n @retval ECMD_TARGET_NOT_CONFIGURED if target is not available in the system\n @retval ECMD_INVALID_ARGS Vpr number is invalid\n @retval ECMD_CLOCKS_IN_INVALID_STATE Chip Clocks were in an invalid state to perform the operation\n @retval ECMD_RING_CACHE_ENABLED Ring Cache enabled function - must be disabled to use this function\n @retval ECMD_SUCCESS if successful read\n @retval nonzero if unsuccessful\n @param i_target Struct that contains chip and cage\/node\/slot\/position\/core\/thread information\n @param io_entries List of entries to fetch ecmdIndexEntry.index field must be filled in\n\n The return value of this function is set to the first non-zero return code found when\n retrieving multiple entries. The entry that caused the failure in the list will also be marked with\n the same return code. That data and all subsequent entries in the list will not be fetched and the data\n should be considered invalid.\n\n*\/\nuint32_t cipGetVprMultiple (ecmdChipTarget & i_target, std::list<ecmdIndexEntry> & io_entries);\n\n\n\/**\n @brief Writes the data buffer into the selected Processor Architected VMX Register (VPR)\n @retval ECMD_TARGET_INVALID_TYPE if target is not a processor\n @retval ECMD_TARGET_NOT_CONFIGURED if target is not available in the system\n @retval ECMD_INVALID_ARGS Vpr number is invalid\n @retval ECMD_SUCCESS if successful\n @retval ECMD_DATA_OVERFLOW Too much data was provided for a write\n @retval ECMD_DATA_UNDERFLOW Too little data was provided to a write function\n @retval ECMD_RING_CACHE_ENABLED Ring Cache enabled function - must be disaled to use this function\n @retval ECMD_CLOCKS_IN_INVALID_STATE Chip Clocks were in an invalid state to perform the operation\n @retval nonzero if unsuccessful\n @param i_target Struct that contains chip and cage\/node\/slot\/position\/core\/thread information \n @param i_vprNum Number of vpr to write to\n @param i_data DataBuffer object that holds data to write into vpr\n\n*\/\nuint32_t cipPutVpr (ecmdChipTarget & i_target, uint32_t i_vprNum, ecmdDataBuffer & i_data);\n\n\/**\n @brief Writes the data buffer into the selected Processor Architected VMX Register (VPR)\n @retval ECMD_TARGET_INVALID_TYPE if target is not a processor\n @retval ECMD_TARGET_NOT_CONFIGURED if target is not available in the system\n @retval ECMD_INVALID_ARGS Vpr number is invalid\n @retval ECMD_SUCCESS if successful\n @retval ECMD_DATA_OVERFLOW Too much data was provided for a write\n @retval ECMD_DATA_UNDERFLOW Too little data was provided to a write function\n @retval ECMD_RING_CACHE_ENABLED Ring Cache enabled function - must be disabled to use this function\n @retval ECMD_CLOCKS_IN_INVALID_STATE Chip Clocks were in an invalid state to perform the operation\n @retval nonzero if unsuccessful\n @param i_target Struct that contains chip and cage\/node\/slot\/position\/core\/thread information \n @param i_entries List of entries to write all ecmdIndexEntry fields must be filled in\n\n\n The return value of this function is set to the first non-zero return code found when\n writing multiple entries. The function will NOT continue through all subsequent entries.\n\n*\/\nuint32_t cipPutVprMultiple (ecmdChipTarget & i_target, std::list<ecmdIndexEntry> & i_entries);\n\n\n\/\/@}\n\/* End Processor Functions *\/\n\n\n\/** @name Memory Functions *\/\n\/\/@{\n\n\/**\n @brief Reads System Mainstore through the processor chip using a real address\n @retval ECMD_TARGET_INVALID_TYPE if target is not a processor\n @retval ECMD_TARGET_NOT_CONFIGURED if target is not available in the system\n @retval ECMD_RING_CACHE_ENABLED Ring Cache enabled function - must be disabled to use this function\n @retval ECMD_CLOCKS_IN_INVALID_STATE Chip Clocks were in an invalid state to perform the operation\n @retval ECMD_SUCCESS if successful read\n @retval nonzero if unsuccessful\n @param i_target Struct that contains chip and cage\/node\/slot\/position information\n @param i_address Starting address to read from\n @param i_bytes Number of bytes to write\n @param o_data DataBuffer object that holds data read from memory\n @param o_memoryTags 1 bit of tag for every 64 bits of memory data\n\n NOTE : This function requires that the address be aligned on a 64 bit boundary\n\n*\/\nuint32_t cipGetMemProc (ecmdChipTarget & i_target, uint64_t i_address, uint32_t i_bytes, ecmdDataBuffer & o_memoryData, ecmdDataBuffer & o_memoryTags);\n\n\n\/**\n @brief Writes System Mainstore through the processor chip using a real address\n @retval ECMD_TARGET_INVALID_TYPE if target is not a processor\n @retval ECMD_TARGET_NOT_CONFIGURED if target is not available in the system\n @retval ECMD_SUCCESS if successful\n @retval ECMD_RING_CACHE_ENABLED Ring Cache enabled function - must be disabled to use this function\n @retval ECMD_CLOCKS_IN_INVALID_STATE Chip Clocks were in an invalid state to perform the operation\n @retval nonzero if unsuccessful\n @param i_target Struct that contains chip and cage\/node\/slot\/position information \n @param i_address Starting address to write to\n @param i_bytes Number of bytes to write\n @param i_data DataBuffer object that holds data to write into memory\n @param i_memoryTags 1 bit of tag for every 64 bits of memory data\n\n NOTE : This function requires that the address be aligned on a 64 bit boundary\n\n\n*\/\nuint32_t cipPutMemProc (ecmdChipTarget & i_target, uint64_t i_address, uint32_t i_bytes, ecmdDataBuffer & i_memoryData, ecmdDataBuffer & i_memoryTags);\n\n\n\/**\n @brief Reads System Mainstore through the memory controller using a real address\n @retval ECMD_TARGET_INVALID_TYPE if target is not a memory controller\n @retval ECMD_TARGET_NOT_CONFIGURED if target is not available in the system\n @retval ECMD_RING_CACHE_ENABLED Ring Cache enabled function - must be disabled to use this function\n @retval ECMD_CLOCKS_IN_INVALID_STATE Chip Clocks were in an invalid state to perform the operation\n @retval ECMD_SUCCESS if successful read\n @retval nonzero if unsuccessful\n @param i_target Struct that contains chip and cage\/node\/slot\/position information\n @param i_address Starting address to read from\n @param i_bytes Number of bytes to write\n @param o_data DataBuffer object that holds data read from memory\n @param o_memoryTags 1 bit of tag for every 64 bits of memory data\n\n NOTE : This function requires that the address be aligned on a 64 bit boundary\n\n*\/\nuint32_t cipGetMemMemCtrl (ecmdChipTarget & i_target, uint64_t i_address, uint32_t i_bytes, ecmdDataBuffer & o_memoryData, ecmdDataBuffer & o_memoryTags);\n\n\n\/**\n @brief Writes System Mainstore through the memory controller using a real address\n @retval ECMD_TARGET_INVALID_TYPE if target is not a memory controller\n @retval ECMD_TARGET_NOT_CONFIGURED if target is not available in the system\n @retval ECMD_SUCCESS if successful\n @retval ECMD_RING_CACHE_ENABLED Ring Cache enabled function - must be disabled to use this function\n @retval ECMD_CLOCKS_IN_INVALID_STATE Chip Clocks were in an invalid state to perform the operation\n @retval nonzero if unsuccessful\n @param i_target Struct that contains chip and cage\/node\/slot\/position information \n @param i_address Starting address to write to\n @param i_bytes Number of bytes to write\n @param i_data DataBuffer object that holds data to write into memory\n @param i_memoryTags 1 bit of tag for every 64 bits of memory data\n\n NOTE : This function requires that the address be aligned on a 64 bit boundary\n\n\n*\/\nuint32_t cipPutMemMemCtrl (ecmdChipTarget & i_target, uint64_t i_address, uint32_t i_bytes, ecmdDataBuffer & i_memoryData, ecmdDataBuffer & i_memoryTags);\n\n\/\/@}\n\/* End Memory Functions *\/\n\n} \/* end extern \"c\" *\/\n\n#endif \/* cipClientCapi_h *\/\n\n\/\/ Change Log *********************************************************\n\/\/ \n\/\/ Flag Reason Vers Date Coder Description \n\/\/ ---- -------- ---- -------- ----- ------------------------------- \n\/\/ cengel Initial Creation\n\/\/\n\/\/ End Change Log *****************************************************\n<commit_msg>Fixed doxygen comments<commit_after>#ifndef cipClientCapi_h\n#define cipClientCapi_h\n\n\/* $Header$ *\/\n\n\/**\n * @file cipClientCapi.H\n * @brief Cronus & IP eCMD Extension\n\n * Extension Owner : Chris Engel\n*\/\n\n\/\/--------------------------------------------------------------------\n\/\/ Includes\n\/\/--------------------------------------------------------------------\n#include <ecmdReturnCodes.H>\n#include <ecmdStructs.H>\n#include <ecmdDataBuffer.H>\n#include <cipStructs.H>\n\n\/\/--------------------------------------------------------------------\n\/\/ Forward References \n\/\/--------------------------------------------------------------------\n\n\n\/* Functions in here are defined as extern C for the following reasons:\n 1) Keeps Function names small by preventing C++ \"mangling\"\n 2) Allows (C-based) perl interpreter to access these functions\n\n*\/\nextern \"C\" {\n\n\/** @name Load\/Unload Functions *\/\n\/\/@{\n\n\/**\n @brief Initialize eCMD CIP Extension DLL\n @retval ECMD_SUCCESS if successful load\n @retval ECMD_INVALID_DLL_VERSION if Dll version loaded doesn't match client version\n @retval nonzero if unsuccessful\n @post eCMD CIP Extension is initialized and version checked\n\n*\/\nuint32_t cipInitExtension();\n\n\n\/\/@}\n\n\n\/** @name Processor Functions *\/\n\/\/@{\n\n\/**\n @brief Start Instructions\n @param i_target Struct that contains chip and cage\/node\/slot\/position\/core\/thread information \n @retval ECMD_RING_CACHE_ENABLED Ring Cache enabled function - must be disabled to use this function\n @retval ECMD_TARGET_NOT_CONFIGURED if target is not available in the system\n @retval ECMD_SUCCESS if successful\n @retval nonzero if unsuccessful\n @retval ECMD_CLOCKS_IN_INVALID_STATE Chip Clocks were in an invalid state to perform the operation\n\n\n*\/\nuint32_t cipStartInstructions (ecmdChipTarget & i_target);\n\n\/**\n @brief Start Instructions on all configured processors\n @retval ECMD_RING_CACHE_ENABLED Ring Cache enabled function - must be disabled to use this function\n @retval ECMD_SUCCESS if successful\n @retval nonzero if unsuccessful\n @retval ECMD_CLOCKS_IN_INVALID_STATE Chip Clocks were in an invalid state to perform the operation\n\n*\/\nuint32_t cipStartAllInstructions ();\n\n\/**\n @brief Stop Instructions\n @param i_target Struct that contains chip and cage\/node\/slot\/position\/core\/thread information \n @retval ECMD_RING_CACHE_ENABLED Ring Cache enabled function - must be disabled to use this function\n @retval ECMD_TARGET_NOT_CONFIGURED if target is not available in the system\n @retval ECMD_SUCCESS if successful\n @retval nonzero if unsuccessful\n @retval ECMD_CLOCKS_IN_INVALID_STATE Chip Clocks were in an invalid state to perform the operation\n\n\n*\/\nuint32_t cipStopInstructions (ecmdChipTarget & i_target);\n\n\/**\n @brief Stop All Instructions\n @retval ECMD_RING_CACHE_ENABLED Ring Cache enabled function - must be disabled to use this function\n @retval ECMD_SUCCESS if successful\n @retval nonzero if unsuccessful\n @retval ECMD_CLOCKS_IN_INVALID_STATE Chip Clocks were in an invalid state to perform the operation\n\n*\/\nuint32_t cipStopAllInstructions ();\n\n\/**\n @brief Step Instructions\n @param i_target Struct that contains chip and cage\/node\/slot\/position\/core\/thread information\n @param i_steps Number of steps to execute\n @retval ECMD_RING_CACHE_ENABLED Ring Cache enabled function - must be disabled to use this function\n @retval ECMD_TARGET_NOT_CONFIGURED if target is not available in the system\n @retval ECMD_SUCCESS if successful\n @retval nonzero if unsuccessful\n @retval ECMD_CLOCKS_IN_INVALID_STATE Chip Clocks were in an invalid state to perform the operation\n\n\n*\/\nuint32_t cipStepInstructions (ecmdChipTarget & i_target, uint32_t i_steps);\n\n\/**\n @brief Set a hardware breakpoint in Processor using a real address\n @param i_target Struct that contains chip and cage\/node\/slot\/position\/core\/thread information\n @param i_address Address to set breakpoint at\n @param i_type Type of breakpoint to set\n @retval ECMD_TARGET_NOT_CONFIGURED if target is not available in the system\n @retval ECMD_RING_CACHE_ENABLED Ring Cache enabled function - must be disabled to use this function\n @retval ECMD_SUCCESS if successful\n @retval nonzero if unsuccessful\n @retval ECMD_CLOCKS_IN_INVALID_STATE Chip Clocks were in an invalid state to perform the operation\n\n\n*\/\nuint32_t cipSetBreakpoint (ecmdChipTarget & i_target, uint64_t i_address, ecmdBreakpointType_t & i_type);\n\n\/**\n @brief Clear a hardware breakpoint from Processor using a real address\n @param i_target Struct that contains chip and cage\/node\/slot\/position\/core\/thread information\n @param i_address Address to clear breakpoint at\n @param i_type Type of breakpoint to set\n @retval ECMD_TARGET_NOT_CONFIGURED if target is not available in the system\n @retval ECMD_RING_CACHE_ENABLED Ring Cache enabled function - must be disabled to use this function\n @retval ECMD_SUCCESS if successful\n @retval nonzero if unsuccessful\n @retval ECMD_CLOCKS_IN_INVALID_STATE Chip Clocks were in an invalid state to perform the operation\n\n\n*\/\nuint32_t cipClearBreakpoint (ecmdChipTarget & i_target, uint64_t i_address, ecmdBreakpointType_t & i_type);\n\n\n\/**\n @brief Reads the selected Processor Architected VMX Register (VPR) into the data buffer\n @retval ECMD_TARGET_INVALID_TYPE if target is not a processor\n @retval ECMD_TARGET_NOT_CONFIGURED if target is not available in the system\n @retval ECMD_INVALID_ARGS Vpr number is invalid\n @retval ECMD_CLOCKS_IN_INVALID_STATE Chip Clocks were in an invalid state to perform the operation\n @retval ECMD_RING_CACHE_ENABLED Ring Cache enabled function - must be disabled to use this function\n @retval ECMD_SUCCESS if successful read\n @retval nonzero if unsuccessful\n @param i_target Struct that contains chip and cage\/node\/slot\/position\/core\/thread information\n @param i_vprNum Number of vpr to read from\n @param o_data DataBuffer object that holds data read from vpr\n\n*\/\nuint32_t cipGetVpr (ecmdChipTarget & i_target, uint32_t i_vprNum, ecmdDataBuffer & o_data);\n\n\/**\n @brief Reads the selected Processor Architected VMX Register (VPR) into the data buffers\n @retval ECMD_TARGET_INVALID_TYPE if target is not a processor\n @retval ECMD_TARGET_NOT_CONFIGURED if target is not available in the system\n @retval ECMD_INVALID_ARGS Vpr number is invalid\n @retval ECMD_CLOCKS_IN_INVALID_STATE Chip Clocks were in an invalid state to perform the operation\n @retval ECMD_RING_CACHE_ENABLED Ring Cache enabled function - must be disabled to use this function\n @retval ECMD_SUCCESS if successful read\n @retval nonzero if unsuccessful\n @param i_target Struct that contains chip and cage\/node\/slot\/position\/core\/thread information\n @param io_entries List of entries to fetch ecmdIndexEntry.index field must be filled in\n\n The return value of this function is set to the first non-zero return code found when\n retrieving multiple entries. The entry that caused the failure in the list will also be marked with\n the same return code. That data and all subsequent entries in the list will not be fetched and the data\n should be considered invalid.\n\n*\/\nuint32_t cipGetVprMultiple (ecmdChipTarget & i_target, std::list<ecmdIndexEntry> & io_entries);\n\n\n\/**\n @brief Writes the data buffer into the selected Processor Architected VMX Register (VPR)\n @retval ECMD_TARGET_INVALID_TYPE if target is not a processor\n @retval ECMD_TARGET_NOT_CONFIGURED if target is not available in the system\n @retval ECMD_INVALID_ARGS Vpr number is invalid\n @retval ECMD_SUCCESS if successful\n @retval ECMD_DATA_OVERFLOW Too much data was provided for a write\n @retval ECMD_DATA_UNDERFLOW Too little data was provided to a write function\n @retval ECMD_RING_CACHE_ENABLED Ring Cache enabled function - must be disaled to use this function\n @retval ECMD_CLOCKS_IN_INVALID_STATE Chip Clocks were in an invalid state to perform the operation\n @retval nonzero if unsuccessful\n @param i_target Struct that contains chip and cage\/node\/slot\/position\/core\/thread information \n @param i_vprNum Number of vpr to write to\n @param i_data DataBuffer object that holds data to write into vpr\n\n*\/\nuint32_t cipPutVpr (ecmdChipTarget & i_target, uint32_t i_vprNum, ecmdDataBuffer & i_data);\n\n\/**\n @brief Writes the data buffer into the selected Processor Architected VMX Register (VPR)\n @retval ECMD_TARGET_INVALID_TYPE if target is not a processor\n @retval ECMD_TARGET_NOT_CONFIGURED if target is not available in the system\n @retval ECMD_INVALID_ARGS Vpr number is invalid\n @retval ECMD_SUCCESS if successful\n @retval ECMD_DATA_OVERFLOW Too much data was provided for a write\n @retval ECMD_DATA_UNDERFLOW Too little data was provided to a write function\n @retval ECMD_RING_CACHE_ENABLED Ring Cache enabled function - must be disabled to use this function\n @retval ECMD_CLOCKS_IN_INVALID_STATE Chip Clocks were in an invalid state to perform the operation\n @retval nonzero if unsuccessful\n @param i_target Struct that contains chip and cage\/node\/slot\/position\/core\/thread information \n @param i_entries List of entries to write all ecmdIndexEntry fields must be filled in\n\n\n The return value of this function is set to the first non-zero return code found when\n writing multiple entries. The function will NOT continue through all subsequent entries.\n\n*\/\nuint32_t cipPutVprMultiple (ecmdChipTarget & i_target, std::list<ecmdIndexEntry> & i_entries);\n\n\n\/\/@}\n\/* End Processor Functions *\/\n\n\n\/** @name Memory Functions *\/\n\/\/@{\n\n\/**\n @brief Reads System Mainstore through the processor chip using a real address\n @retval ECMD_TARGET_INVALID_TYPE if target is not a processor\n @retval ECMD_TARGET_NOT_CONFIGURED if target is not available in the system\n @retval ECMD_RING_CACHE_ENABLED Ring Cache enabled function - must be disabled to use this function\n @retval ECMD_CLOCKS_IN_INVALID_STATE Chip Clocks were in an invalid state to perform the operation\n @retval ECMD_SUCCESS if successful read\n @retval nonzero if unsuccessful\n @param i_target Struct that contains chip and cage\/node\/slot\/position information\n @param i_address Starting address to read from\n @param i_bytes Number of bytes to write\n @param o_memoryData DataBuffer object that holds data read from memory\n @param o_memoryTags 1 bit of tag for every 64 bits of memory data\n\n NOTE : This function requires that the address be aligned on a 64 bit boundary\n\n*\/\nuint32_t cipGetMemProc (ecmdChipTarget & i_target, uint64_t i_address, uint32_t i_bytes, ecmdDataBuffer & o_memoryData, ecmdDataBuffer & o_memoryTags);\n\n\n\/**\n @brief Writes System Mainstore through the processor chip using a real address\n @retval ECMD_TARGET_INVALID_TYPE if target is not a processor\n @retval ECMD_TARGET_NOT_CONFIGURED if target is not available in the system\n @retval ECMD_SUCCESS if successful\n @retval ECMD_RING_CACHE_ENABLED Ring Cache enabled function - must be disabled to use this function\n @retval ECMD_CLOCKS_IN_INVALID_STATE Chip Clocks were in an invalid state to perform the operation\n @retval nonzero if unsuccessful\n @param i_target Struct that contains chip and cage\/node\/slot\/position information \n @param i_address Starting address to write to\n @param i_bytes Number of bytes to write\n @param i_memoryData DataBuffer object that holds data to write into memory\n @param i_memoryTags 1 bit of tag for every 64 bits of memory data\n\n NOTE : This function requires that the address be aligned on a 64 bit boundary\n\n\n*\/\nuint32_t cipPutMemProc (ecmdChipTarget & i_target, uint64_t i_address, uint32_t i_bytes, ecmdDataBuffer & i_memoryData, ecmdDataBuffer & i_memoryTags);\n\n\n\/**\n @brief Reads System Mainstore through the memory controller using a real address\n @retval ECMD_TARGET_INVALID_TYPE if target is not a memory controller\n @retval ECMD_TARGET_NOT_CONFIGURED if target is not available in the system\n @retval ECMD_RING_CACHE_ENABLED Ring Cache enabled function - must be disabled to use this function\n @retval ECMD_CLOCKS_IN_INVALID_STATE Chip Clocks were in an invalid state to perform the operation\n @retval ECMD_SUCCESS if successful read\n @retval nonzero if unsuccessful\n @param i_target Struct that contains chip and cage\/node\/slot\/position information\n @param i_address Starting address to read from\n @param i_bytes Number of bytes to write\n @param o_memoryData DataBuffer object that holds data read from memory\n @param o_memoryTags 1 bit of tag for every 64 bits of memory data\n\n NOTE : This function requires that the address be aligned on a 64 bit boundary\n\n*\/\nuint32_t cipGetMemMemCtrl (ecmdChipTarget & i_target, uint64_t i_address, uint32_t i_bytes, ecmdDataBuffer & o_memoryData, ecmdDataBuffer & o_memoryTags);\n\n\n\/**\n @brief Writes System Mainstore through the memory controller using a real address\n @retval ECMD_TARGET_INVALID_TYPE if target is not a memory controller\n @retval ECMD_TARGET_NOT_CONFIGURED if target is not available in the system\n @retval ECMD_SUCCESS if successful\n @retval ECMD_RING_CACHE_ENABLED Ring Cache enabled function - must be disabled to use this function\n @retval ECMD_CLOCKS_IN_INVALID_STATE Chip Clocks were in an invalid state to perform the operation\n @retval nonzero if unsuccessful\n @param i_target Struct that contains chip and cage\/node\/slot\/position information \n @param i_address Starting address to write to\n @param i_bytes Number of bytes to write\n @param i_memoryData DataBuffer object that holds data to write into memory\n @param i_memoryTags 1 bit of tag for every 64 bits of memory data\n\n NOTE : This function requires that the address be aligned on a 64 bit boundary\n\n\n*\/\nuint32_t cipPutMemMemCtrl (ecmdChipTarget & i_target, uint64_t i_address, uint32_t i_bytes, ecmdDataBuffer & i_memoryData, ecmdDataBuffer & i_memoryTags);\n\n\/\/@}\n\/* End Memory Functions *\/\n\n} \/* end extern \"c\" *\/\n\n#endif \/* cipClientCapi_h *\/\n\n\/\/ Change Log *********************************************************\n\/\/ \n\/\/ Flag Reason Vers Date Coder Description \n\/\/ ---- -------- ---- -------- ----- ------------------------------- \n\/\/ cengel Initial Creation\n\/\/\n\/\/ End Change Log *****************************************************\n<|endoftext|>"} {"text":"<commit_before>#include <stdlib.h>\n#include <stdio.h>\n#include <iostream>\n\n#include <dtkCore\/dtkPluginManager.h>\n\n#include <medSql\/medDatabaseController.h>\n#include <medSql\/medDatabaseImporter.h>\n#include <medCore\/medStorage.h>\n#include <medCore\/medDataIndex.h>\n\n#include <QtCore>\n\nbool checkDirectoryHierarchyAndThumbnails(QString dbPath, QString patientName, QString studyName, QString sessionName, unsigned int thumbnailsCount);\nint countRowsInTable(QSqlDatabase db, QString tableName);\nbool checkIfRowExists(QSqlDatabase db, QString tableName, QString columnName, QString value);\nbool checkIfRowExists(QSqlDatabase db, QString tableName, QHash<QString, QString> columnValues);\n\nint medDatabaseControllerImplTest(int argc, char* argv[])\n{\n \/\/ this test requires medinria plugins path and medinria data path\n if (argc < 3)\n return EXIT_FAILURE;\n\n \/\/ get the input directories\n QString pluginsPath = argv[1];\n QString dataDir = argv[2];\n\n \/\/ load medinria plugins, we will need data types, readers and writers\n dtkPluginManager::instance()->setPath(pluginsPath);\n dtkPluginManager::instance()->initialize();\n\n \/\/ create temporary directory for new database\n QString dbPath = QDir::tempPath() + \"\/medinria-test-db\";\n\n medStorage::setDataLocation(dbPath);\n\n QPointer<medDatabaseControllerImpl> dbc = medDatabaseController::instance();\n\n \/\/ create connection and create database schema\n if(!dbc->createConnection())\n {\n qWarning() << \"Unable to create a connection to the database\";\n return EXIT_FAILURE;\n }\n\n QString file = dataDir + QString(\"\/Clatz\/I1.nhdr\");\n QFileInfo info(file);\n bool indexWithoutCopying = false;\n\n \/\/ import\n medDatabaseImporter *importer = new medDatabaseImporter(info.absoluteFilePath(), indexWithoutCopying);\n importer->run();\n\n \/* CHECK\n * We won't do a full and exhaustive check in here, we will\n * see if the appropriate folders were created, we will\n * check thumbnails image files (only by name) and then we\n * will take a deep look at the database tables.\n *\/\n\n QString patientName = \"John Doe\";\n QString studyName = \"EmptyStudy\";\n QString sessionName = \"I11\";\n\n if(!checkDirectoryHierarchyAndThumbnails(dbPath, patientName, studyName, sessionName, 63))\n return EXIT_FAILURE;\n\n \/\/ super, so we reached a point that all the files we expect are there\n \/\/ however we didn't check the content, but still...\n \/\/ now onto db check\n\n QSqlDatabase db = *(dbc->database());\n\n \/\/ check that there is only one row in patient table\n if(1 != countRowsInTable(db, \"patient\"))\n return EXIT_FAILURE;\n\n \/\/ check that patient named John Doe exists\n \/\/ we do not check for all the other columns\n if(!checkIfRowExists(db, \"patient\", \"name\", patientName))\n return EXIT_FAILURE;\n\n \/\/ check that there is only one row in study table\n if(1 != countRowsInTable(db, \"study\"))\n return EXIT_FAILURE;\n\n \/\/ check that there is a study named EmptyStudy\n \/\/ we do not check for all the other columns\n if(!checkIfRowExists(db, \"study\", \"name\", studyName))\n return EXIT_FAILURE;\n\n \/\/ check that there is only one row in series table\n if(1 != countRowsInTable(db, \"series\"))\n return EXIT_FAILURE;\n\n \/\/ check that the proper path is in series table\n QString seriesPath = QDir::separator() + patientName + QDir::separator() + studyName + QDir::separator() + sessionName + QString(\".mha\");\n if(!checkIfRowExists(db, \"series\", \"path\", seriesPath))\n return EXIT_FAILURE;\n\n int imageCount = 64;\n\n \/\/ check that there are #imageCount rows in image table\n if (imageCount != countRowsInTable(db, \"image\"))\n return EXIT_FAILURE;\n\n \/\/ check every row\n for (int i = 0; i < imageCount ; i++)\n {\n QHash<QString, QString> columnValues;\n columnValues.insert(\"size\", QString::number(imageCount));\n columnValues.insert(\"name\", \"I1.nhdr\" + QString::number(i));\n columnValues.insert(\"path\", file);\n columnValues.insert(\"instance_path\", seriesPath);\n QString thumbnailPath = QDir::separator() + patientName + QDir::separator() + studyName + QDir::separator() + sessionName + QDir::separator() + QString::number(i) + \".png\";\n columnValues.insert(\"thumbnail\", thumbnailPath);\n\n if(!checkIfRowExists(db, \"image\", columnValues))\n return EXIT_FAILURE;\n }\n\n \/\/ clean\n medStorage::removeDir(dbPath, NULL);\n medDatabaseController::destroy();\n\n return EXIT_SUCCESS;\n}\n\nbool checkDirectoryHierarchyAndThumbnails(QString dbPath, QString patientName, QString studyName, QString sessionName, unsigned int thumbnailsCount)\n{\n \/\/ We do not check the content of the files\n \/\/ we just see whether they exist\n\n \/\/ Patient\n QString patientPath = dbPath + QDir::separator() + patientName;\n if (QDir(patientPath).exists())\n {\n QString studyPath = patientPath + QDir::separator() + studyName;\n if (QDir(studyPath).exists())\n {\n QString sessionPath = studyPath + QDir::separator() + sessionName;\n QString sessionFile = sessionPath + QString(\".mha\");\n if (QDir(sessionPath).exists() && QFile(sessionFile).exists())\n {\n \/\/ check if thumbnails exist\n for (int i = 0; i <= thumbnailsCount; i++) {\n QFile thumbnail(sessionPath + QDir::separator() + QString::number(i) + QString(\".png\"));\n if (!thumbnail.exists())\n return false;\n }\n\n \/\/ finally check ref.png\n QFile ref(sessionPath + QDir::separator() + QString(\"ref.png\"));\n if (!ref.exists())\n return false;\n\n return true;\n }\n else\n {\n return false;\n }\n }\n else\n {\n return false;\n }\n }\n else\n {\n return false;\n }\n}\n\nint countRowsInTable(QSqlDatabase db, QString tableName)\n{\n QSqlQuery query(db);\n\n query.prepare(\"SELECT COUNT(*) FROM \" + tableName);\n\n if(!query.exec())\n {\n qDebug() << DTK_COLOR_FG_RED << query.lastError() << DTK_NO_COLOR;\n return -1;\n }\n\n if(query.first()) {\n QVariant rowsCount = query.value(0);\n return rowsCount.toInt();\n }\n else\n return -1;\n}\n\nbool checkIfRowExists(QSqlDatabase db, QString tableName, QString columnName, QString value)\n{\n QSqlQuery query(db);\n\n query.prepare(\"SELECT id FROM \" + tableName + \" WHERE \" + columnName + \" = :value\");\n query.bindValue(\":value\", value);\n\n if(!query.exec())\n {\n qDebug() << DTK_COLOR_FG_RED << query.lastError() << DTK_NO_COLOR;\n return false;\n }\n\n if(query.first()) {\n QVariant patientId = query.value(0);\n return true;\n }\n else\n return false;\n}\n\nbool checkIfRowExists(QSqlDatabase db, QString tableName, QHash<QString, QString> columnValues)\n{\n \/\/ TODO this way of building the query string is just awful\n \/\/ try to find another...\n\n\tQString queryString = \"SELECT id FROM \" + tableName + \" WHERE \";\n\n\tQHashIterator<QString, QString> it(columnValues);\n bool firstTime = true;\n\n while (it.hasNext())\n {\n it.next();\n\n if (!firstTime)\n {\n queryString.append(\" AND \");\n }\n else\n firstTime = false;\n\n queryString.append(it.key()).append( \" = :\").append(it.key());\n }\n\n QSqlQuery query(db);\n query.prepare(queryString);\n\n it.toFront();\n\n while (it.hasNext())\n {\n it.next();\n query.bindValue(\":\"+it.key(), it.value());\n }\n\n if(!query.exec())\n {\n qDebug() << DTK_COLOR_FG_RED << query.lastError() << DTK_NO_COLOR;\n return false;\n }\n\n\t\n \/\/ see executed query\n\t\/\/qDebug() << query.executedQuery().toStdString().c_str();\n\n if(query.first()) {\n QVariant patientId = query.value(0);\n return true;\n }\n else\n return false;\n}\n<commit_msg>Fixed warning.<commit_after>#include <stdlib.h>\n#include <stdio.h>\n#include <iostream>\n\n#include <dtkCore\/dtkPluginManager.h>\n\n#include <medSql\/medDatabaseController.h>\n#include <medSql\/medDatabaseImporter.h>\n#include <medCore\/medStorage.h>\n#include <medCore\/medDataIndex.h>\n\n#include <QtCore>\n\nbool checkDirectoryHierarchyAndThumbnails(QString dbPath, QString patientName, QString studyName, QString sessionName, unsigned int thumbnailsCount);\nint countRowsInTable(QSqlDatabase db, QString tableName);\nbool checkIfRowExists(QSqlDatabase db, QString tableName, QString columnName, QString value);\nbool checkIfRowExists(QSqlDatabase db, QString tableName, QHash<QString, QString> columnValues);\n\nint medDatabaseControllerImplTest(int argc, char* argv[])\n{\n \/\/ this test requires medinria plugins path and medinria data path\n if (argc < 3)\n return EXIT_FAILURE;\n\n \/\/ get the input directories\n QString pluginsPath = argv[1];\n QString dataDir = argv[2];\n\n \/\/ load medinria plugins, we will need data types, readers and writers\n dtkPluginManager::instance()->setPath(pluginsPath);\n dtkPluginManager::instance()->initialize();\n\n \/\/ create temporary directory for new database\n QString dbPath = QDir::tempPath() + \"\/medinria-test-db\";\n\n medStorage::setDataLocation(dbPath);\n\n QPointer<medDatabaseControllerImpl> dbc = medDatabaseController::instance();\n\n \/\/ create connection and create database schema\n if(!dbc->createConnection())\n {\n qWarning() << \"Unable to create a connection to the database\";\n return EXIT_FAILURE;\n }\n\n QString file = dataDir + QString(\"\/Clatz\/I1.nhdr\");\n QFileInfo info(file);\n bool indexWithoutCopying = false;\n\n \/\/ import\n medDatabaseImporter *importer = new medDatabaseImporter(info.absoluteFilePath(), indexWithoutCopying);\n importer->run();\n\n \/* CHECK\n * We won't do a full and exhaustive check in here, we will\n * see if the appropriate folders were created, we will\n * check thumbnails image files (only by name) and then we\n * will take a deep look at the database tables.\n *\/\n\n QString patientName = \"John Doe\";\n QString studyName = \"EmptyStudy\";\n QString sessionName = \"I11\";\n\n if(!checkDirectoryHierarchyAndThumbnails(dbPath, patientName, studyName, sessionName, 63))\n return EXIT_FAILURE;\n\n \/\/ super, so we reached a point that all the files we expect are there\n \/\/ however we didn't check the content, but still...\n \/\/ now onto db check\n\n QSqlDatabase db = *(dbc->database());\n\n \/\/ check that there is only one row in patient table\n if(1 != countRowsInTable(db, \"patient\"))\n return EXIT_FAILURE;\n\n \/\/ check that patient named John Doe exists\n \/\/ we do not check for all the other columns\n if(!checkIfRowExists(db, \"patient\", \"name\", patientName))\n return EXIT_FAILURE;\n\n \/\/ check that there is only one row in study table\n if(1 != countRowsInTable(db, \"study\"))\n return EXIT_FAILURE;\n\n \/\/ check that there is a study named EmptyStudy\n \/\/ we do not check for all the other columns\n if(!checkIfRowExists(db, \"study\", \"name\", studyName))\n return EXIT_FAILURE;\n\n \/\/ check that there is only one row in series table\n if(1 != countRowsInTable(db, \"series\"))\n return EXIT_FAILURE;\n\n \/\/ check that the proper path is in series table\n QString seriesPath = QDir::separator() + patientName + QDir::separator() + studyName + QDir::separator() + sessionName + QString(\".mha\");\n if(!checkIfRowExists(db, \"series\", \"path\", seriesPath))\n return EXIT_FAILURE;\n\n int imageCount = 64;\n\n \/\/ check that there are #imageCount rows in image table\n if (imageCount != countRowsInTable(db, \"image\"))\n return EXIT_FAILURE;\n\n \/\/ check every row\n for (int i = 0; i < imageCount ; i++)\n {\n QHash<QString, QString> columnValues;\n columnValues.insert(\"size\", QString::number(imageCount));\n columnValues.insert(\"name\", \"I1.nhdr\" + QString::number(i));\n columnValues.insert(\"path\", file);\n columnValues.insert(\"instance_path\", seriesPath);\n QString thumbnailPath = QDir::separator() + patientName + QDir::separator() + studyName + QDir::separator() + sessionName + QDir::separator() + QString::number(i) + \".png\";\n columnValues.insert(\"thumbnail\", thumbnailPath);\n\n if(!checkIfRowExists(db, \"image\", columnValues))\n return EXIT_FAILURE;\n }\n\n \/\/ clean\n medStorage::removeDir(dbPath, NULL);\n medDatabaseController::destroy();\n\n return EXIT_SUCCESS;\n}\n\nbool checkDirectoryHierarchyAndThumbnails(QString dbPath, QString patientName, QString studyName, QString sessionName, unsigned int thumbnailsCount)\n{\n \/\/ We do not check the content of the files\n \/\/ we just see whether they exist\n\n \/\/ Patient\n QString patientPath = dbPath + QDir::separator() + patientName;\n if (QDir(patientPath).exists())\n {\n QString studyPath = patientPath + QDir::separator() + studyName;\n if (QDir(studyPath).exists())\n {\n QString sessionPath = studyPath + QDir::separator() + sessionName;\n QString sessionFile = sessionPath + QString(\".mha\");\n if (QDir(sessionPath).exists() && QFile(sessionFile).exists())\n {\n \/\/ check if thumbnails exist\n for (unsigned int i = 0; i <= thumbnailsCount; i++) {\n QFile thumbnail(sessionPath + QDir::separator() + QString::number(i) + QString(\".png\"));\n if (!thumbnail.exists())\n return false;\n }\n\n \/\/ finally check ref.png\n QFile ref(sessionPath + QDir::separator() + QString(\"ref.png\"));\n if (!ref.exists())\n return false;\n\n return true;\n }\n else\n {\n return false;\n }\n }\n else\n {\n return false;\n }\n }\n else\n {\n return false;\n }\n}\n\nint countRowsInTable(QSqlDatabase db, QString tableName)\n{\n QSqlQuery query(db);\n\n query.prepare(\"SELECT COUNT(*) FROM \" + tableName);\n\n if(!query.exec())\n {\n qDebug() << DTK_COLOR_FG_RED << query.lastError() << DTK_NO_COLOR;\n return -1;\n }\n\n if(query.first()) {\n QVariant rowsCount = query.value(0);\n return rowsCount.toInt();\n }\n else\n return -1;\n}\n\nbool checkIfRowExists(QSqlDatabase db, QString tableName, QString columnName, QString value)\n{\n QSqlQuery query(db);\n\n query.prepare(\"SELECT id FROM \" + tableName + \" WHERE \" + columnName + \" = :value\");\n query.bindValue(\":value\", value);\n\n if(!query.exec())\n {\n qDebug() << DTK_COLOR_FG_RED << query.lastError() << DTK_NO_COLOR;\n return false;\n }\n\n if(query.first()) {\n QVariant patientId = query.value(0);\n return true;\n }\n else\n return false;\n}\n\nbool checkIfRowExists(QSqlDatabase db, QString tableName, QHash<QString, QString> columnValues)\n{\n \/\/ TODO this way of building the query string is just awful\n \/\/ try to find another...\n\n\tQString queryString = \"SELECT id FROM \" + tableName + \" WHERE \";\n\n\tQHashIterator<QString, QString> it(columnValues);\n bool firstTime = true;\n\n while (it.hasNext())\n {\n it.next();\n\n if (!firstTime)\n {\n queryString.append(\" AND \");\n }\n else\n firstTime = false;\n\n queryString.append(it.key()).append( \" = :\").append(it.key());\n }\n\n QSqlQuery query(db);\n query.prepare(queryString);\n\n it.toFront();\n\n while (it.hasNext())\n {\n it.next();\n query.bindValue(\":\"+it.key(), it.value());\n }\n\n if(!query.exec())\n {\n qDebug() << DTK_COLOR_FG_RED << query.lastError() << DTK_NO_COLOR;\n return false;\n }\n\n\t\n \/\/ see executed query\n\t\/\/qDebug() << query.executedQuery().toStdString().c_str();\n\n if(query.first()) {\n QVariant patientId = query.value(0);\n return true;\n }\n else\n return false;\n}\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 \"vm\/globals.h\"\n#if defined(HOST_OS_WINDOWS)\n\n#include \"vm\/virtual_memory.h\"\n\n#include \"platform\/assert.h\"\n#include \"vm\/os.h\"\n\n#include \"vm\/isolate.h\"\n\nnamespace dart {\n\nuword VirtualMemory::page_size_ = 0;\n\nvoid VirtualMemory::InitOnce() {\n SYSTEM_INFO info;\n GetSystemInfo(&info);\n page_size_ = info.dwPageSize;\n}\n\nVirtualMemory* VirtualMemory::Allocate(intptr_t size,\n bool is_executable,\n const char* name) {\n ASSERT(Utils::IsAligned(size, page_size_));\n int prot = is_executable ? PAGE_EXECUTE_READWRITE : PAGE_READWRITE;\n void* address = VirtualAlloc(NULL, size, MEM_RESERVE | MEM_COMMIT, prot);\n if (address == NULL) {\n return NULL;\n }\n MemoryRegion region(address, size);\n return new VirtualMemory(region, region);\n}\n\nVirtualMemory* VirtualMemory::AllocateAligned(intptr_t size,\n intptr_t alignment,\n bool is_executable,\n const char* name) {\n ASSERT(Utils::IsAligned(size, page_size_));\n ASSERT(Utils::IsAligned(alignment, page_size_));\n intptr_t reserved_size = size + alignment;\n int prot = is_executable ? PAGE_EXECUTE_READWRITE : PAGE_READWRITE;\n void* address = VirtualAlloc(NULL, reserved_size, MEM_RESERVE, prot);\n if (address == NULL) {\n return NULL;\n }\n\n void* aligned_address = reinterpret_cast<void*>(\n Utils::RoundUp(reinterpret_cast<uword>(address), alignment));\n if (VirtualAlloc(aligned_address, size, MEM_COMMIT, prot) !=\n aligned_address) {\n VirtualFree(address, reserved_size, MEM_RELEASE);\n return NULL;\n }\n\n MemoryRegion region(aligned_address, size);\n MemoryRegion reserved(address, reserved_size);\n return new VirtualMemory(region, reserved);\n}\n\nVirtualMemory::~VirtualMemory() {\n if (!vm_owns_region() || (reserved_.size() == 0)) {\n return;\n }\n if (VirtualFree(reserved_.pointer(), 0, MEM_RELEASE) == 0) {\n FATAL(\"VirtualFree failed\");\n }\n}\n\nbool VirtualMemory::FreeSubSegment(void* address,\n intptr_t size) {\n \/\/ On Windows only the entire segment returned by VirtualAlloc\n \/\/ can be freed. Therefore we will have to waste these unused\n \/\/ virtual memory sub-segments.\n return false;\n}\n\nvoid VirtualMemory::Protect(void* address, intptr_t size, Protection mode) {\n ASSERT(Thread::Current()->IsMutatorThread() ||\n Isolate::Current()->mutator_thread()->IsAtSafepoint());\n uword start_address = reinterpret_cast<uword>(address);\n uword end_address = start_address + size;\n uword page_address = Utils::RoundDown(start_address, PageSize());\n DWORD prot = 0;\n switch (mode) {\n case kNoAccess:\n prot = PAGE_NOACCESS;\n break;\n case kReadOnly:\n prot = PAGE_READONLY;\n break;\n case kReadWrite:\n prot = PAGE_READWRITE;\n break;\n case kReadExecute:\n prot = PAGE_EXECUTE_READ;\n break;\n case kReadWriteExecute:\n prot = PAGE_EXECUTE_READWRITE;\n break;\n }\n DWORD old_prot = 0;\n if (VirtualProtect(reinterpret_cast<void*>(page_address),\n end_address - page_address, prot, &old_prot) == 0) {\n FATAL1(\"VirtualProtect failed %d\\n\", GetLastError());\n }\n}\n\n} \/\/ namespace dart\n\n#endif \/\/ defined(HOST_OS_WINDOWS)\n<commit_msg>[vm][windows] Implement VirtualMemory::FreeSubSegment<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 \"vm\/globals.h\"\n#if defined(HOST_OS_WINDOWS)\n\n#include \"vm\/virtual_memory.h\"\n\n#include \"platform\/assert.h\"\n#include \"vm\/os.h\"\n\n#include \"vm\/isolate.h\"\n\nnamespace dart {\n\nuword VirtualMemory::page_size_ = 0;\n\nvoid VirtualMemory::InitOnce() {\n SYSTEM_INFO info;\n GetSystemInfo(&info);\n page_size_ = info.dwPageSize;\n}\n\nVirtualMemory* VirtualMemory::Allocate(intptr_t size,\n bool is_executable,\n const char* name) {\n ASSERT(Utils::IsAligned(size, page_size_));\n int prot = is_executable ? PAGE_EXECUTE_READWRITE : PAGE_READWRITE;\n void* address = VirtualAlloc(NULL, size, MEM_RESERVE | MEM_COMMIT, prot);\n if (address == NULL) {\n return NULL;\n }\n MemoryRegion region(address, size);\n return new VirtualMemory(region, region);\n}\n\nVirtualMemory* VirtualMemory::AllocateAligned(intptr_t size,\n intptr_t alignment,\n bool is_executable,\n const char* name) {\n ASSERT(Utils::IsAligned(size, page_size_));\n ASSERT(Utils::IsAligned(alignment, page_size_));\n intptr_t reserved_size = size + alignment;\n int prot = is_executable ? PAGE_EXECUTE_READWRITE : PAGE_READWRITE;\n void* address = VirtualAlloc(NULL, reserved_size, MEM_RESERVE, prot);\n if (address == NULL) {\n return NULL;\n }\n\n void* aligned_address = reinterpret_cast<void*>(\n Utils::RoundUp(reinterpret_cast<uword>(address), alignment));\n if (VirtualAlloc(aligned_address, size, MEM_COMMIT, prot) !=\n aligned_address) {\n VirtualFree(address, reserved_size, MEM_RELEASE);\n return NULL;\n }\n\n MemoryRegion region(aligned_address, size);\n MemoryRegion reserved(address, reserved_size);\n return new VirtualMemory(region, reserved);\n}\n\nVirtualMemory::~VirtualMemory() {\n if (!vm_owns_region() || (reserved_.size() == 0)) {\n return;\n }\n if (VirtualFree(reserved_.pointer(), 0, MEM_RELEASE) == 0) {\n FATAL1(\"VirtualFree failed: Error code %d\\n\", GetLastError());\n }\n}\n\nbool VirtualMemory::FreeSubSegment(void* address,\n intptr_t size) {\n if (VirtualFree(address, size, MEM_DECOMMIT) == 0) {\n FATAL1(\"VirtualFree failed: Error code %d\\n\", GetLastError());\n }\n return true;\n}\n\nvoid VirtualMemory::Protect(void* address, intptr_t size, Protection mode) {\n ASSERT(Thread::Current()->IsMutatorThread() ||\n Isolate::Current()->mutator_thread()->IsAtSafepoint());\n uword start_address = reinterpret_cast<uword>(address);\n uword end_address = start_address + size;\n uword page_address = Utils::RoundDown(start_address, PageSize());\n DWORD prot = 0;\n switch (mode) {\n case kNoAccess:\n prot = PAGE_NOACCESS;\n break;\n case kReadOnly:\n prot = PAGE_READONLY;\n break;\n case kReadWrite:\n prot = PAGE_READWRITE;\n break;\n case kReadExecute:\n prot = PAGE_EXECUTE_READ;\n break;\n case kReadWriteExecute:\n prot = PAGE_EXECUTE_READWRITE;\n break;\n }\n DWORD old_prot = 0;\n if (VirtualProtect(reinterpret_cast<void*>(page_address),\n end_address - page_address, prot, &old_prot) == 0) {\n FATAL1(\"VirtualProtect failed %d\\n\", GetLastError());\n }\n}\n\n} \/\/ namespace dart\n\n#endif \/\/ defined(HOST_OS_WINDOWS)\n<|endoftext|>"} {"text":"<commit_before><commit_msg>Use new char[] to match the delete[]. To fix a valgrind error.<commit_after><|endoftext|>"} {"text":"<commit_before>\/\/\n\/\/ Keyboard.h\n\/\/ Clock Signal\n\/\/\n\/\/ Created by Thomas Harte on 08\/05\/2019.\n\/\/ Copyright © 2019 Thomas Harte. All rights reserved.\n\/\/\n\n#ifndef Keyboard_hpp\n#define Keyboard_hpp\n\nnamespace Apple {\nnamespace Macintosh {\n\nclass Keyboard {\n\tpublic:\n\t\tvoid set_input(bool data) {\n\t\t}\n\n\t\tbool get_clock() {\n\t\t\treturn false;\n\t\t}\n\n\t\tbool get_data() {\n\t\t\treturn false;\n\t\t}\n\n\t\t\/*!\n\t\t\tThe keyboard expects ~10 µs-frequency ticks, i.e. a clock rate of just around 100 kHz.\n\t\t*\/\n\t\tvoid run_for(HalfCycles cycle) {\n\t\t\t\/\/ TODO: something.\n\t\t}\n};\n\n\/*\n\t\"When sending data to the computer, the keyboard transmits eight cycles of 330 µS each (160 µS low, 170 µS high)\n\ton the normally high Keyboard Clock line. It places a data bit on the data line 40 µS before the falling edge of each\n\tclock cycle and maintains it for 330 µS. The VIA in the compu(er latches the data bit into its Shift register on the\n\trising edge of the Keyboard Clock signal.\"\n\n\t\"When the computer is sending data to the keyboard, the keyboard transmits eight cycles of 400 µS each (180 µS low,\n\t220 µS high) on the Keyboard Clock line. On the falling edge of each keyboard clock cycle, the Macintosh Plus places\n\ta data bit on the data line and holds it there for 400 µS. The keyboard reads the data bit 80 µS after the rising edge\n\tof the Keyboard Clock signal.\"\n*\/\n\n}\n}\n\n#endif \/* Keyboard_h *\/\n<commit_msg>Takes a first crack at the keyboard's serial protocol.<commit_after>\/\/\n\/\/ Keyboard.h\n\/\/ Clock Signal\n\/\/\n\/\/ Created by Thomas Harte on 08\/05\/2019.\n\/\/ Copyright © 2019 Thomas Harte. All rights reserved.\n\/\/\n\n#ifndef Keyboard_hpp\n#define Keyboard_hpp\n\nnamespace Apple {\nnamespace Macintosh {\n\nclass Keyboard {\n\tpublic:\n\t\tvoid set_input(bool data) {\n\t\t\tswitch(mode_) {\n\t\t\t\tcase Mode::Waiting:\n\t\t\t\t\t\/*\n\t\t\t\t\t\t\"Only the computer can initiate communication over the keyboard lines. When the computer and keyboard\n\t\t\t\t\t\tare turned on, the computer is in charge of the keyboard interface and the keyboard is passive. The\n\t\t\t\t\t\tcomputer signals that it is ready to begin communication by pulling the Keyboard Data line low.\"\n\t\t\t\t\t*\/\n\t\t\t\t\tif(!data) {\n\t\t\t\t\t\tmode_ = Mode::AcceptingCommand;\n\t\t\t\t\t\tphase_ = 0;\n\t\t\t\t\t\tcommand_ = 0;\n\t\t\t\t\t}\n\t\t\t\tbreak;\n\n\t\t\t\tcase Mode::AcceptingCommand:\n\t\t\t\t\t\/* Note value, so that it can be latched upon a clock transition. *\/\n\t\t\t\t\tdata_input_ = data;\n\t\t\t\tbreak;\n\n\t\t\t\tcase Mode::AwaitingEndOfCommand:\n\t\t\t\t\t\/*\n\t\t\t\t\t\tThe last bit of the command leaves the Keyboard Data line low; the computer then indicates that it is ready\n\t\t\t\t\t\tto receive the keyboard's response by setting the Keyboard Data line high.\n\t\t\t\t\t*\/\n\t\t\t\t\tif(data) {\n\t\t\t\t\t\tmode_ = Mode::PerformingCommand;\n\t\t\t\t\t\tphase_ = 0;\n\t\t\t\t\t}\n\t\t\t\tbreak;\n\n\t\t\t\tdefault:\n\t\t\t\tcase Mode::SendingResponse:\n\t\t\t\t\t\/* This line isn't currently an input; do nothing. *\/\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\n\t\tbool get_clock() {\n\t\t\treturn clock_output_;\n\t\t}\n\n\t\tbool get_data() {\n\t\t\treturn !!(response_ & 0x80);\n\t\t}\n\n\t\t\/*!\n\t\t\tThe keyboard expects ~10 µs-frequency ticks, i.e. a clock rate of just around 100 kHz.\n\t\t*\/\n\t\tvoid run_for(HalfCycles cycle) {\n\t\t\tswitch(mode_) {\n\t\t\t\tdefault:\n\t\t\t\tcase Mode::AwaitingEndOfCommand:\n\t\t\t\tcase Mode::Waiting: return;\n\n\t\t\t\tcase Mode::AcceptingCommand: {\n\t\t\t\t\t\/*\n\t\t\t\t\t\t\"When the computer is sending data to the keyboard, the keyboard transmits eight cycles of 400 µS each (180 µS low,\n\t\t\t\t\t\t220 µS high) on the Keyboard Clock line. On the falling edge of each keyboard clock cycle, the Macintosh Plus places\n\t\t\t\t\t\ta data bit on the data line and holds it there for 400 µS. The keyboard reads the data bit 80 µS after the rising edge\n\t\t\t\t\t\tof the Keyboard Clock signal.\"\n\t\t\t\t\t*\/\n\t\t\t\t\tconst auto offset = phase_ % 40;\n\t\t\t\t\tclock_output_ = offset >= 18;\n\n\t\t\t\t\tif(offset == 26) {\n\t\t\t\t\t\tcommand_ = (command_ << 1) | (data_input_ ? 1 : 0);\n\t\t\t\t\t}\n\n\t\t\t\t\t++phase_;\n\t\t\t\t\tif(phase_ == 8*40) {\n\t\t\t\t\t\tmode_ = Mode::AwaitingEndOfCommand;\n\t\t\t\t\t\tphase_ = 0;\n\t\t\t\t\t}\n\t\t\t\t} break;\n\n\t\t\t\tcase Mode::PerformingCommand: {\n\t\t\t\t\tresponse_ = perform_command(command_);\n\n\t\t\t\t\t\/\/ Inquiry has a 0.25-second timeout; everything else is instant.\n\t\t\t\t\t++phase_;\n\t\t\t\t\tif(phase_ == 25000 || command_ != 0x10 || response_ != 0x7b) {\n\t\t\t\t\t\tmode_ = Mode::SendingResponse;\n\t\t\t\t\t\tphase_ = 0;\n\t\t\t\t\t}\n\t\t\t\t} break;\n\n\t\t\t\tcase Mode::SendingResponse: {\n\t\t\t\t\t\/*\n\t\t\t\t\t\t\"When sending data to the computer, the keyboard transmits eight cycles of 330 µS each (160 µS low, 170 µS high)\n\t\t\t\t\t\ton the normally high Keyboard Clock line. It places a data bit on the data line 40 µS before the falling edge of each\n\t\t\t\t\t\tclock cycle and maintains it for 330 µS. The VIA in the computer latches the data bit into its shift register on the\n\t\t\t\t\t\trising edge of the Keyboard Clock signal.\"\n\t\t\t\t\t*\/\n\t\t\t\t\tconst auto offset = phase_ % 33;\n\t\t\t\t\tclock_output_ = offset >= 16;\n\n\t\t\t\t\tif(offset == 29) {\n\t\t\t\t\t\tresponse_ <<= 1;\n\t\t\t\t\t}\n\n\t\t\t\t\t++phase_;\n\t\t\t\t\tif(phase_ == 8*33) {\n\t\t\t\t\t\tmode_ = Mode::Waiting;\n\t\t\t\t\t\tphase_ = 0;\n\t\t\t\t\t}\n\t\t\t\t} break;\n\t\t\t}\n\t\t}\n\n\tprivate:\n\n\t\tint perform_command(int command) {\n\t\t\tswitch(command) {\n\t\t\t\tcase 0x10:\t\/\/ Inquiry.\n\t\t\t\tbreak;\n\n\t\t\t\tcase 0x14:\t\/\/ Instant.\n\t\t\t\tbreak;\n\n\t\t\t\tcase 0x16:\t\/\/ Model number.\n\t\t\t\treturn\n\t\t\t\t\t0x01 |\t\t\t\/\/ b0: always 1\n\t\t\t\t\t(1 << 1) |\t\t\/\/ keyboard model number\n\t\t\t\t\t(1 << 4);\t\t\/\/ next device number\n\t\t\t\t\t\t\t\t\t\/\/ (b7 not set => no next device)\n\n\t\t\t\tcase 0x36:\t\/\/ Test\n\t\t\t\treturn 0x7d;\t\t\/\/ 0x7d = ACK, 0x77 = not ACK.\n\t\t\t}\n\t\t\treturn 0x7b;\t\/\/ No key transition.\n\t\t}\n\n\t\tenum class Mode {\n\t\t\tWaiting,\n\t\t\tAcceptingCommand,\n\t\t\tAwaitingEndOfCommand,\n\t\t\tSendingResponse,\n\t\t\tPerformingCommand\n\t\t} mode_ = Mode::Waiting;\n\t\tint phase_ = 0;\n\t\tint command_ = 0;\n\t\tint response_ = 0;\n\n\t\tbool data_input_ = false;\n\t\tbool clock_output_ = false;\n};\n\n}\n}\n\n#endif \/* Keyboard_h *\/\n<|endoftext|>"} {"text":"<commit_before>#include \"AliGFWFilter.h\"\nusing namespace GFWFlags;\nAliGFWFilter::AliGFWFilter():\n fRetFlags(0),\n flTrFlag(0),\n fEventFlag(0),\n fTrackMasks({}),\n fNTrMasks(0),\n fEventMasks({}),\n fNEvMasks(0),\n fAODTrack(0),\n fEventCuts(0),\n fPtMin(0.2),\n fPtMax(3.0),\n fEtaMin(-0.8),\n fEtaMax(0.8)\n{\n};\nAliGFWFilter::~AliGFWFilter() {\n};\nvoid AliGFWFilter::CleanUp() {\n};\nBool_t AliGFWFilter::AcceptVertex(AliAODEvent *inEv, Double_t *lvtxXYZ) {\n const AliAODVertex* vtx = dynamic_cast<const AliAODVertex*>(inEv->GetPrimaryVertex());\n if(!vtx || vtx->GetNContributors() < 1)\n return kFALSE;\n const AliAODVertex* vtxSPD = dynamic_cast<const AliAODVertex*>(inEv->GetPrimaryVertexSPD());\n Double_t dMaxResol = 0.25; \/\/ suggested from DPG\n Double_t cov[6] = {0};\n vtxSPD->GetCovarianceMatrix(cov);\n Double_t zRes = TMath::Sqrt(cov[5]);\n if ( vtxSPD->IsFromVertexerZ() && (zRes > dMaxResol)) return kFALSE;\n const Double_t aodVtxZ = vtx->GetZ();\n vtx->GetXYZ(lvtxXYZ);\n return kTRUE;\n};\nvoid AliGFWFilter::CheckEvent(AliVEvent* inEv) {\n AliAODEvent *fAOD = dynamic_cast<AliAODEvent*>(inEv);\n \/\/ AliESDEvent *fESD = dynamic_cast<AliESDEvent*>(inEv); \/\/ESD not implemented yet\n if(!fRetFlags) {fRetFlags = new AliGFWFlags(); }\n else fRetFlags->CleanUp();\n if(fAOD) {\n fEventFlag=0;\n \/\/If event cuts are set, then only consider events that pass the event selection\n if(fEventCuts) { if(fEventCuts->AcceptEvent(fAOD)) AddEv(klEventCuts); else return; }\n else AddEv(klEventCuts); \/\/Otherwise, mark all as passed (assuming ES is done outside)\n Double_t vtxXYZ[3];\n if(AcceptVertex(fAOD,vtxXYZ)) AddEv(klVtxOK);\n else return; \/\/If vertex ain't accepted, no point to continue\n Double_t lvtxz = TMath::Abs(fAOD->GetPrimaryVertex()->GetZ());\n if(lvtxz<5) AddEv(klVtxZ5);\n if(lvtxz<7) AddEv(klVtxZ7);\n if(lvtxz<9) AddEv(klVtxZ9);\n if(lvtxz<10) AddEv(klVtxZ10);\n UInt_t evfl = calculateEventFlag();\n fRetFlags->SetEventFlags(evfl);\n Double_t pt, eta, trXYZ[3], trDCAxy;\n UShort_t nTPCCLSsh, nTPCcl;\n for(Int_t i=0;i<fAOD->GetNumberOfTracks();i++) {\n fAODTrack = (AliAODTrack*)fAOD->GetTrack(i);\n if(!fAODTrack) continue;\n pt = fAODTrack->Pt();\n eta = fAODTrack->Eta();\n if(pt<fPtMin || pt>fPtMax) continue;\n if(eta<fEtaMin || eta>fEtaMax) continue;\n flTrFlag=0;\n \/\/Testing filter bits:\n if(fAODTrack->TestFilterBit(32)) AddTr(klFB32);\n if(fAODTrack->TestFilterBit(64)) AddTr(klFB64);\n if(fAODTrack->TestFilterBit(256)) AddTr(klFB256);\n if(fAODTrack->TestFilterBit(512)) AddTr(klFB512);\n \/\/Testing shared clusters\n nTPCCLSsh = fAODTrack->GetTPCnclsS();\n nTPCcl = fAODTrack->GetTPCncls();\n if(nTPCCLSsh*1.0\/nTPCcl <= 0.4) AddTr(klSharedClusters);\n \/\/Testing hit on first layer SDD\n if(fAODTrack->HasPointOnITSLayer(4)) AddTr(klHitOnSDD); \/\/2xSPD, 2xSSD, 2xSDD\n if(!fAODTrack->HasPointOnITSLayer(0) && !fAODTrack->HasPointOnITSLayer(1)) AddTr(klNoSPD); \/\/No hits in SPD -> Necessary for FB 96<->768 overlap\n \/\/Calculating DCAs:\n fAODTrack->GetXYZ(trXYZ);\n trXYZ[0] -= vtxXYZ[0];\n trXYZ[1] -= vtxXYZ[1];\n trXYZ[2] -= vtxXYZ[2];\n trDCAxy = TMath::Sqrt(trXYZ[0]*trXYZ[0] + trXYZ[1]*trXYZ[1]);\n \/\/Checking DCAz:\n if(TMath::Abs(trXYZ[2])<2) AddTr(klDCAz20);\n if(TMath::Abs(trXYZ[2])<1) AddTr(klDCAz10);\n if(TMath::Abs(trXYZ[2])<0.5) AddTr(klDCAz05);\n \/\/Checking DCAxy:\n Double_t dcaCut2010 = f_DCAxy2010(pt);\n Double_t dcaCut2011 = f_DCAxy2011(pt);\n if(trDCAxy<dcaCut2010*7) AddTr(klDCAxy2010);\n if(trDCAxy<dcaCut2011*7) AddTr(klDCAxy2011);\n if(trDCAxy<dcaCut2011*4) AddTr(klDCAxy4Sigma);\n if(trDCAxy<dcaCut2011*8) AddTr(klDCAxy8Sigma);\n if(trDCAxy<dcaCut2011*10) AddTr(klDCAxy10Sigma);\n \/\/Checking TPC chi2 per cluster:\n Double_t tpcChi2PerCluster = fAODTrack->GetTPCchi2perCluster();\n if(tpcChi2PerCluster<=2.) AddTr(klTPCchi2PC20);\n if(tpcChi2PerCluster<=2.5) AddTr(klTPCchi2PC25);\n if(tpcChi2PerCluster<=3.0) AddTr(klTPCchi2PC30);\n if(tpcChi2PerCluster<=4.0) AddTr(klTPCchi2PC40);\n \/\/Checking number of TPC clusters:\n UShort_t nTPCCls = fAODTrack->GetTPCNclsF();\n if(nTPCCls>70) AddTr(klNTPCcls70);\n if(nTPCCls>80) AddTr(klNTPCcls80);\n if(nTPCCls>90) AddTr(klNTPCcls90);\n if(nTPCCls>100) AddTr(klNTPCcls100);\n \/\/Derived track cuts -- only for diff. modifications of filter bits, where OR is required\n if(TSB(klFB32)||TSB(klFB64)) AddTr(klFB96);\n if(TSB(klFB96)&&TSB(klSharedClusters)) AddTr(klFB96Tuned); \/\/Tuned to overlap with 768 (modified)\n if(TSB(klFB256)||TSB(klFB512)) AddTr(klFB768);\n if(TSB(klFB256)||TB(klFB512+klNoSPD+klHitOnSDD)) AddTr(klFB768Tuned); \/\/Tuned to overlap with 96 (modified). Second part is that only second part requires hit in SDD\n UInt_t flagToAdd = calculateTrackFlag();\n if(flagToAdd) fRetFlags->AddTrackFlags(i,flagToAdd); \/\/Only count ones that pass any cuts\n };\n };\n};\n\/\/klFB32, klFB64, klFB256, klFB512, klFB96, klFB96Tuned, klFB768, klFB768Tuned,\n\/\/klSharedClusters, klHitOnSDD, -- included in *Tuned fb's already\n\/\/klDCAz20, klDCAz10, klDCAz05,\n\/\/klDCAxy2010, klDCAxy2011, klDCAxy8Sigma, klDCAxy4Sigma, klDCAxy10Sigma,\n\/\/klTPCchi2PC25, klTPCchi2PC20, klTPCchi2PC30, klTPCchi2PC40\n\/\/klNTPCcls70, klNTPCcls80, klNTPCcls90, klNTPCcls100\nvoid AliGFWFilter::CreateStandardCutMasks(kLocalTrackFlags lStandardChi2Cut) {\n \/\/Standard cuts:\n \/\/Nominal -- FB96:\n fTrackMasks.push_back(klFB96 + klDCAz20 + klDCAxy2011 + lStandardChi2Cut + klNTPCcls70);\n \/\/FB768:\n fTrackMasks.push_back(klFB768 + lStandardChi2Cut + klNTPCcls70);\n \/\/FB96, |dcaZ| < 1:\n fTrackMasks.push_back(klFB96 + klDCAz10 + klDCAxy2011 + lStandardChi2Cut + klNTPCcls70);\n \/\/FB96, |dcaZ| < 0.5:\n fTrackMasks.push_back(klFB96 + klDCAz05 + klDCAxy2011 + lStandardChi2Cut + klNTPCcls70);\n \/\/FB96, |DCAxy| 4 sigma:\n fTrackMasks.push_back(klFB96 + klDCAz20 + klDCAxy4Sigma + lStandardChi2Cut + klNTPCcls70);\n \/\/FB96, |DCAxy| 10 sigma:\n fTrackMasks.push_back(klFB96 + klDCAz20 + klDCAxy10Sigma + lStandardChi2Cut + klNTPCcls70);\n \/\/FB96, chi2 per cluster <2:\n fTrackMasks.push_back(klFB96 + klDCAz20 + klDCAxy2011 + klTPCchi2PC20 + klNTPCcls70);\n \/\/FB96, chi2 per cluster <3:\n fTrackMasks.push_back(klFB96 + klDCAz20 + klDCAxy2011 + klTPCchi2PC30 + klNTPCcls70);\n \/\/FB96, Ntpc clusters > 80:\n fTrackMasks.push_back(klFB96 + klDCAz20 + klDCAxy2011 + lStandardChi2Cut + klNTPCcls80);\n \/\/FB96, Ntpc clusters > 90:\n fTrackMasks.push_back(klFB96 + klDCAz20 + klDCAxy2011 + lStandardChi2Cut + klNTPCcls90);\n \/\/FB96, Ntpc clusters > 100:\n fTrackMasks.push_back(klFB96 + klDCAz20 + klDCAxy2011 + lStandardChi2Cut + klNTPCcls100);\n \/\/More reasonable ones:\n \/\/Nominal, tuned to overlap with 768\n fTrackMasks.push_back(klFB96Tuned + klDCAz20 + klDCAxy2011 + lStandardChi2Cut + klNTPCcls70);\n \/\/FB768 tuned to overlap with 96\n fTrackMasks.push_back(klFB768Tuned + klDCAz20 + klDCAxy2011 + lStandardChi2Cut + klNTPCcls70);\n \/\/FB768 tuned, smaller DCAz cut\n fTrackMasks.push_back(klFB768Tuned + klDCAz05 + klDCAxy2011 + lStandardChi2Cut + klNTPCcls70);\n \/\/FB768 tuned, DCAxy 4 sigma\n fTrackMasks.push_back(klFB768Tuned + klDCAz20 + klDCAxy4Sigma + lStandardChi2Cut + klNTPCcls70);\n \/\/FB768 tuned, DCAxy 10 sigma\n fTrackMasks.push_back(klFB768Tuned + klDCAz20 + klDCAxy10Sigma + lStandardChi2Cut + klNTPCcls70);\n \/\/FB768tunes tuned, TPC chi2 <2\n fTrackMasks.push_back(klFB768Tuned + klDCAz20 + klDCAxy2011 + klTPCchi2PC20 + klNTPCcls70);\n \/\/FB768tunes tuned, TPC chi2 <3\n fTrackMasks.push_back(klFB768Tuned + klDCAz20 + klDCAxy2011 + klTPCchi2PC30 + klNTPCcls70);\n \/\/FB768tunes tuned, nTPC clusters >90\n fTrackMasks.push_back(klFB768Tuned + klDCAz20 + klDCAxy2011 + lStandardChi2Cut + klNTPCcls90);\n \/\/FB96 with 2010 AND 2011 DCAxy\n fTrackMasks.push_back(klFB96 + klDCAz20 + klDCAxy2010 + klDCAxy2011 + lStandardChi2Cut + klNTPCcls70);\n\n \/\/Event cuts:\n \/\/ if(!fEventMasks) fEventMasks = new UInt_t[gNEventFlags];\n \/\/Nominal:\n fEventMasks.push_back(klVtxZ10 + klEventCuts);\n \/\/vtx z<9\n fEventMasks.push_back(klVtxZ9 + klEventCuts);\n \/\/vtx z<7\n fEventMasks.push_back(klVtxZ7 + klEventCuts);\n \/\/vtx z<5\n fEventMasks.push_back(klVtxZ5 + klEventCuts);\n\n fNTrMasks = (Int_t)fTrackMasks.size(); \/\/fetch number of track cuts actually added, also so that we don't need to check the size for each track\n fNEvMasks = (Int_t)fEventMasks.size(); \/\/same as above, but for events\n};\nvoid AliGFWFilter::AddCustomCuts(Bool_t cleanFirst, UInt_t lEv, UInt_t lTr) {\n if(cleanFirst) {fEventMasks.clear(); fTrackMasks.clear(); };\n fTrackMasks.push_back(lTr);\n fEventMasks.push_back(lEv);\n fNTrMasks = (Int_t)fTrackMasks.size(); \/\/fetch number of track cuts actually added, also so that we don't need to check the size for each track\n fNEvMasks = (Int_t)fEventMasks.size(); \/\/same as above, but for events\n}\nUInt_t AliGFWFilter::calculateEventFlag() {\n UInt_t retFlag = 0;\n for(Int_t i=0;i<fNEvMasks;i++) if(EB(fEventMasks[i])) retFlag|=(1<<i);\n return retFlag;\n};\nUInt_t AliGFWFilter::calculateTrackFlag() {\n UInt_t retFlag = 0;\n for(Int_t i=0;i<fNTrMasks;i++) if(TB(fTrackMasks[i])) retFlag|=(1<<i);\n return retFlag;\n}\n<commit_msg>GFWFilter: nTPCCluster cut is not >=70, as opposed to >70 (or any other number)<commit_after>#include \"AliGFWFilter.h\"\nusing namespace GFWFlags;\nAliGFWFilter::AliGFWFilter():\n fRetFlags(0),\n flTrFlag(0),\n fEventFlag(0),\n fTrackMasks({}),\n fNTrMasks(0),\n fEventMasks({}),\n fNEvMasks(0),\n fAODTrack(0),\n fEventCuts(0),\n fPtMin(0.2),\n fPtMax(3.0),\n fEtaMin(-0.8),\n fEtaMax(0.8)\n{\n};\nAliGFWFilter::~AliGFWFilter() {\n};\nvoid AliGFWFilter::CleanUp() {\n};\nBool_t AliGFWFilter::AcceptVertex(AliAODEvent *inEv, Double_t *lvtxXYZ) {\n const AliAODVertex* vtx = dynamic_cast<const AliAODVertex*>(inEv->GetPrimaryVertex());\n if(!vtx || vtx->GetNContributors() < 1)\n return kFALSE;\n const AliAODVertex* vtxSPD = dynamic_cast<const AliAODVertex*>(inEv->GetPrimaryVertexSPD());\n Double_t dMaxResol = 0.25; \/\/ suggested from DPG\n Double_t cov[6] = {0};\n vtxSPD->GetCovarianceMatrix(cov);\n Double_t zRes = TMath::Sqrt(cov[5]);\n if ( vtxSPD->IsFromVertexerZ() && (zRes > dMaxResol)) return kFALSE;\n const Double_t aodVtxZ = vtx->GetZ();\n vtx->GetXYZ(lvtxXYZ);\n return kTRUE;\n};\nvoid AliGFWFilter::CheckEvent(AliVEvent* inEv) {\n AliAODEvent *fAOD = dynamic_cast<AliAODEvent*>(inEv);\n \/\/ AliESDEvent *fESD = dynamic_cast<AliESDEvent*>(inEv); \/\/ESD not implemented yet\n if(!fRetFlags) {fRetFlags = new AliGFWFlags(); }\n else fRetFlags->CleanUp();\n if(fAOD) {\n fEventFlag=0;\n \/\/If event cuts are set, then only consider events that pass the event selection\n if(fEventCuts) { if(fEventCuts->AcceptEvent(fAOD)) AddEv(klEventCuts); else return; }\n else AddEv(klEventCuts); \/\/Otherwise, mark all as passed (assuming ES is done outside)\n Double_t vtxXYZ[3];\n if(AcceptVertex(fAOD,vtxXYZ)) AddEv(klVtxOK);\n else return; \/\/If vertex ain't accepted, no point to continue\n Double_t lvtxz = TMath::Abs(fAOD->GetPrimaryVertex()->GetZ());\n if(lvtxz<5) AddEv(klVtxZ5);\n if(lvtxz<7) AddEv(klVtxZ7);\n if(lvtxz<9) AddEv(klVtxZ9);\n if(lvtxz<10) AddEv(klVtxZ10);\n UInt_t evfl = calculateEventFlag();\n fRetFlags->SetEventFlags(evfl);\n Double_t pt, eta, trXYZ[3], trDCAxy;\n UShort_t nTPCCLSsh, nTPCcl;\n for(Int_t i=0;i<fAOD->GetNumberOfTracks();i++) {\n fAODTrack = (AliAODTrack*)fAOD->GetTrack(i);\n if(!fAODTrack) continue;\n pt = fAODTrack->Pt();\n eta = fAODTrack->Eta();\n if(pt<fPtMin || pt>fPtMax) continue;\n if(eta<fEtaMin || eta>fEtaMax) continue;\n flTrFlag=0;\n \/\/Testing filter bits:\n if(fAODTrack->TestFilterBit(32)) AddTr(klFB32);\n if(fAODTrack->TestFilterBit(64)) AddTr(klFB64);\n if(fAODTrack->TestFilterBit(256)) AddTr(klFB256);\n if(fAODTrack->TestFilterBit(512)) AddTr(klFB512);\n \/\/Testing shared clusters\n nTPCCLSsh = fAODTrack->GetTPCnclsS();\n nTPCcl = fAODTrack->GetTPCncls();\n if(nTPCCLSsh*1.0\/nTPCcl <= 0.4) AddTr(klSharedClusters);\n \/\/Testing hit on first layer SDD\n if(fAODTrack->HasPointOnITSLayer(4)) AddTr(klHitOnSDD); \/\/2xSPD, 2xSSD, 2xSDD\n if(!fAODTrack->HasPointOnITSLayer(0) && !fAODTrack->HasPointOnITSLayer(1)) AddTr(klNoSPD); \/\/No hits in SPD -> Necessary for FB 96<->768 overlap\n \/\/Calculating DCAs:\n fAODTrack->GetXYZ(trXYZ);\n trXYZ[0] -= vtxXYZ[0];\n trXYZ[1] -= vtxXYZ[1];\n trXYZ[2] -= vtxXYZ[2];\n trDCAxy = TMath::Sqrt(trXYZ[0]*trXYZ[0] + trXYZ[1]*trXYZ[1]);\n \/\/Checking DCAz:\n if(TMath::Abs(trXYZ[2])<2) AddTr(klDCAz20);\n if(TMath::Abs(trXYZ[2])<1) AddTr(klDCAz10);\n if(TMath::Abs(trXYZ[2])<0.5) AddTr(klDCAz05);\n \/\/Checking DCAxy:\n Double_t dcaCut2010 = f_DCAxy2010(pt);\n Double_t dcaCut2011 = f_DCAxy2011(pt);\n if(trDCAxy<dcaCut2010*7) AddTr(klDCAxy2010);\n if(trDCAxy<dcaCut2011*7) AddTr(klDCAxy2011);\n if(trDCAxy<dcaCut2011*4) AddTr(klDCAxy4Sigma);\n if(trDCAxy<dcaCut2011*8) AddTr(klDCAxy8Sigma);\n if(trDCAxy<dcaCut2011*10) AddTr(klDCAxy10Sigma);\n \/\/Checking TPC chi2 per cluster:\n Double_t tpcChi2PerCluster = fAODTrack->GetTPCchi2perCluster();\n if(tpcChi2PerCluster<=2.) AddTr(klTPCchi2PC20);\n if(tpcChi2PerCluster<=2.5) AddTr(klTPCchi2PC25);\n if(tpcChi2PerCluster<=3.0) AddTr(klTPCchi2PC30);\n if(tpcChi2PerCluster<=4.0) AddTr(klTPCchi2PC40);\n \/\/Checking number of TPC clusters:\n UShort_t nTPCCls = fAODTrack->GetTPCNclsF();\n if(nTPCCls>=70) AddTr(klNTPCcls70);\n if(nTPCCls>=80) AddTr(klNTPCcls80);\n if(nTPCCls>=90) AddTr(klNTPCcls90);\n if(nTPCCls>=100) AddTr(klNTPCcls100);\n \/\/Derived track cuts -- only for diff. modifications of filter bits, where OR is required\n if(TSB(klFB32)||TSB(klFB64)) AddTr(klFB96);\n if(TSB(klFB96)&&TSB(klSharedClusters)) AddTr(klFB96Tuned); \/\/Tuned to overlap with 768 (modified)\n if(TSB(klFB256)||TSB(klFB512)) AddTr(klFB768);\n if(TSB(klFB256)||TB(klFB512+klNoSPD+klHitOnSDD)) AddTr(klFB768Tuned); \/\/Tuned to overlap with 96 (modified). Second part is that only second part requires hit in SDD\n UInt_t flagToAdd = calculateTrackFlag();\n if(flagToAdd) fRetFlags->AddTrackFlags(i,flagToAdd); \/\/Only count ones that pass any cuts\n };\n };\n};\n\/\/klFB32, klFB64, klFB256, klFB512, klFB96, klFB96Tuned, klFB768, klFB768Tuned,\n\/\/klSharedClusters, klHitOnSDD, -- included in *Tuned fb's already\n\/\/klDCAz20, klDCAz10, klDCAz05,\n\/\/klDCAxy2010, klDCAxy2011, klDCAxy8Sigma, klDCAxy4Sigma, klDCAxy10Sigma,\n\/\/klTPCchi2PC25, klTPCchi2PC20, klTPCchi2PC30, klTPCchi2PC40\n\/\/klNTPCcls70, klNTPCcls80, klNTPCcls90, klNTPCcls100\nvoid AliGFWFilter::CreateStandardCutMasks(kLocalTrackFlags lStandardChi2Cut) {\n \/\/Standard cuts:\n \/\/Nominal -- FB96:\n fTrackMasks.push_back(klFB96 + klDCAz20 + klDCAxy2011 + lStandardChi2Cut + klNTPCcls70);\n \/\/FB768:\n fTrackMasks.push_back(klFB768 + lStandardChi2Cut + klNTPCcls70);\n \/\/FB96, |dcaZ| < 1:\n fTrackMasks.push_back(klFB96 + klDCAz10 + klDCAxy2011 + lStandardChi2Cut + klNTPCcls70);\n \/\/FB96, |dcaZ| < 0.5:\n fTrackMasks.push_back(klFB96 + klDCAz05 + klDCAxy2011 + lStandardChi2Cut + klNTPCcls70);\n \/\/FB96, |DCAxy| 4 sigma:\n fTrackMasks.push_back(klFB96 + klDCAz20 + klDCAxy4Sigma + lStandardChi2Cut + klNTPCcls70);\n \/\/FB96, |DCAxy| 10 sigma:\n fTrackMasks.push_back(klFB96 + klDCAz20 + klDCAxy10Sigma + lStandardChi2Cut + klNTPCcls70);\n \/\/FB96, chi2 per cluster <2:\n fTrackMasks.push_back(klFB96 + klDCAz20 + klDCAxy2011 + klTPCchi2PC20 + klNTPCcls70);\n \/\/FB96, chi2 per cluster <3:\n fTrackMasks.push_back(klFB96 + klDCAz20 + klDCAxy2011 + klTPCchi2PC30 + klNTPCcls70);\n \/\/FB96, Ntpc clusters > 80:\n fTrackMasks.push_back(klFB96 + klDCAz20 + klDCAxy2011 + lStandardChi2Cut + klNTPCcls80);\n \/\/FB96, Ntpc clusters > 90:\n fTrackMasks.push_back(klFB96 + klDCAz20 + klDCAxy2011 + lStandardChi2Cut + klNTPCcls90);\n \/\/FB96, Ntpc clusters > 100:\n fTrackMasks.push_back(klFB96 + klDCAz20 + klDCAxy2011 + lStandardChi2Cut + klNTPCcls100);\n \/\/More reasonable ones:\n \/\/Nominal, tuned to overlap with 768\n fTrackMasks.push_back(klFB96Tuned + klDCAz20 + klDCAxy2011 + lStandardChi2Cut + klNTPCcls70);\n \/\/FB768 tuned to overlap with 96\n fTrackMasks.push_back(klFB768Tuned + klDCAz20 + klDCAxy2011 + lStandardChi2Cut + klNTPCcls70);\n \/\/FB768 tuned, smaller DCAz cut\n fTrackMasks.push_back(klFB768Tuned + klDCAz05 + klDCAxy2011 + lStandardChi2Cut + klNTPCcls70);\n \/\/FB768 tuned, DCAxy 4 sigma\n fTrackMasks.push_back(klFB768Tuned + klDCAz20 + klDCAxy4Sigma + lStandardChi2Cut + klNTPCcls70);\n \/\/FB768 tuned, DCAxy 10 sigma\n fTrackMasks.push_back(klFB768Tuned + klDCAz20 + klDCAxy10Sigma + lStandardChi2Cut + klNTPCcls70);\n \/\/FB768tunes tuned, TPC chi2 <2\n fTrackMasks.push_back(klFB768Tuned + klDCAz20 + klDCAxy2011 + klTPCchi2PC20 + klNTPCcls70);\n \/\/FB768tunes tuned, TPC chi2 <3\n fTrackMasks.push_back(klFB768Tuned + klDCAz20 + klDCAxy2011 + klTPCchi2PC30 + klNTPCcls70);\n \/\/FB768tunes tuned, nTPC clusters >90\n fTrackMasks.push_back(klFB768Tuned + klDCAz20 + klDCAxy2011 + lStandardChi2Cut + klNTPCcls90);\n \/\/FB96 with 2010 AND 2011 DCAxy\n fTrackMasks.push_back(klFB96 + klDCAz20 + klDCAxy2010 + klDCAxy2011 + lStandardChi2Cut + klNTPCcls70);\n\n \/\/Event cuts:\n \/\/ if(!fEventMasks) fEventMasks = new UInt_t[gNEventFlags];\n \/\/Nominal:\n fEventMasks.push_back(klVtxZ10 + klEventCuts);\n \/\/vtx z<9\n fEventMasks.push_back(klVtxZ9 + klEventCuts);\n \/\/vtx z<7\n fEventMasks.push_back(klVtxZ7 + klEventCuts);\n \/\/vtx z<5\n fEventMasks.push_back(klVtxZ5 + klEventCuts);\n\n fNTrMasks = (Int_t)fTrackMasks.size(); \/\/fetch number of track cuts actually added, also so that we don't need to check the size for each track\n fNEvMasks = (Int_t)fEventMasks.size(); \/\/same as above, but for events\n};\nvoid AliGFWFilter::AddCustomCuts(Bool_t cleanFirst, UInt_t lEv, UInt_t lTr) {\n if(cleanFirst) {fEventMasks.clear(); fTrackMasks.clear(); };\n fTrackMasks.push_back(lTr);\n fEventMasks.push_back(lEv);\n fNTrMasks = (Int_t)fTrackMasks.size(); \/\/fetch number of track cuts actually added, also so that we don't need to check the size for each track\n fNEvMasks = (Int_t)fEventMasks.size(); \/\/same as above, but for events\n}\nUInt_t AliGFWFilter::calculateEventFlag() {\n UInt_t retFlag = 0;\n for(Int_t i=0;i<fNEvMasks;i++) if(EB(fEventMasks[i])) retFlag|=(1<<i);\n return retFlag;\n};\nUInt_t AliGFWFilter::calculateTrackFlag() {\n UInt_t retFlag = 0;\n for(Int_t i=0;i<fNTrMasks;i++) if(TB(fTrackMasks[i])) retFlag|=(1<<i);\n return retFlag;\n}\n<|endoftext|>"} {"text":"<commit_before>\/*\n \/\/\n \/\/ Function to dump recursivally in human readable format, content of the objects + example use case\n \/\/ \n \/\/\n .L $mcProd\/dumpObject.C+\n ExampleUse(); > AliTPCClusterParam.dump\n AliTPCRecoParam param; \n DumpObjectRecursive(¶m); >> AliTPCRecoParam.dump\n\n Use case examples \n 1.) compare oontent of alignent OCDB files for differnt yers\n 2.) compare ClusterParam for different periods\n \n=================================================================================================================\n \/\/ 1.)\n \/\/ Compare alignment example:\n \/\/ Compare TPC alignemnt 2013 and 2010\n \/\/\n DumpOCDBFile(\"\/cvmfs\/alice.gsi.de\/alice\/data\/2013\/OCDB\/TPC\/Align\/Data\/Run0_999999999_v1_s0.root\",\"TPCalign2013.dump\",1);\n DumpOCDBFile(\"\/cvmfs\/alice.gsi.de\/alice\/data\/2010\/OCDB\/TPC\/Align\/Data\/Run0_999999999_v1_s0.root\",\"TPCalign2010.dump\",1);\n diff TPCalign2013.dump TPCalign2010.dump > TPCalign2013_TPCalign2010.diff\n \/\/\n \/\/ \n=================================================================================================================\n\/\/ 2.) \n \/\/ Compare CluterParam OCDB etry\n \/\/\n DumpOCDBFile(\"\/cvmfs\/alice.gsi.de\/alice\/data\/2010\/OCDB\/TPC\/Calib\/ClusterParam\/Run131541_999999999_v2_s0.root\",\"2010_TPC_Calib_ClusterParam_Run131541_999999999_v2_s0.dump\",1);\n DumpOCDBFile(\"\/cvmfs\/alice.gsi.de\/alice\/data\/2010\/OCDB\/TPC\/Calib\/ClusterParam\/Run0_999999999_v1_s0.root\",\"2010_TPC_Calib_ClusterParam_Run0_999999999_v1_s0.dump\",1);\n DumpOCDBFile(\"\/cvmfs\/alice.gsi.de\/alice\/data\/2013\/OCDB\/TPC\/Calib\/ClusterParam\/Run0_999999999_v1_s0.root\",\"2013_TPC_Calib_ClusterParam_Run0_999999999_v1_s0.dump\",1);\n \n diff 2010_TPC_Calib_ClusterParam_Run131541_999999999_v2_s0.dump 2010_TPC_Calib_ClusterParam_Run0_999999999_v1_s0.dump\n\n\n*\/\n#if !defined(__CINT__) || defined(__MAKECINT__)\n#include \"TMath.h\"\n#include \"TFile.h\"\n#include \"TTree.h\"\n#include <TVectorF.h>\n#include <TLinearFitter.h>\n#include <TH1F.h>\n#include <TH3F.h>\n#include <TProfile2D.h>\n#include <TVectorD.h>\n#include <TObjArray.h>\n#include \"THnBase.h\"\n#include \"TRealData.h\"\n#include \"TDataMember.h\"\n#include \"TClass.h\"\n#include \"AliCDBEntry.h\"\n#include \"TObjArray.h\"\n#include \"TNamed.h\"\n#include \"TROOT.h\"\n#endif\n\nvoid DumpObjectRecursive(TObject *obj);\nvoid DumpObjectRecursive(TObject *obj, TString prefix, Int_t &counterRec);\n\nvoid ExampleUse(){\n \/\/\n \/\/\n \/\/\n TFile *f = TFile::Open(\"\/cvmfs\/alice.gsi.de\/alice\/simulation\/2008\/v4-15-Release\/Residual\/TPC\/Calib\/ClusterParam\/Run127712_130850_v3_s0.root\");\n \/\/TFile *f = TFile::Open(\".\/OCDB_NoClustersBelowThreshold\/TPC\/Calib\/RecoParam\/Run127712_130850_v0_s0.root\");\n AliCDBEntry * entry = (AliCDBEntry*)f->Get(\"AliCDBEntry\");\n TObject *obj = ( TObject*)entry->GetObject();\n DumpObjectRecursive(obj);\n \/\/\n \/\/\n}\n\nvoid DumpOCDBFile(const char *finput , const char *foutput, Bool_t dumpMetaData, Bool_t xml){\n \/\/\n \/\/ \n \/\/ DumpOCDBFile(\"$ALICE_ROOT\/OCDB\/ITS\/Align\/Data\/Run0_999999999_v0_s0.root\", \"ITS_Align_Data_Run0_999999999_v0_s0.dump\")\n \/\/\n if (finput==0) return ;\n TFile *falignITS = TFile::Open(finput);\n AliCDBEntry *entry = (AliCDBEntry*)falignITS->Get(\"AliCDBEntry\");\n if (!entry) return; \n TObject *obj = ((AliCDBEntry*)falignITS->Get(\"AliCDBEntry\"))->GetObject(); \n\n \/\/\n if (!xml){\n if (dumpMetaData) gROOT->ProcessLine(TString::Format(\"((TObject*)%p)->Dump(); >%s\",entry, foutput).Data());\n if (!obj) return;\n gROOT->ProcessLine(TString::Format(\"DumpObjectRecursive((TObject*)%p); >>%s\",obj, foutput).Data());\n }\n if (xml){\n TFile * f = TFile::Open(TString::Format(\"%s.xml\",foutput).Data(),\"recreate\");\n if (dumpMetaData) entry->Write(\"AliCDBEntry\");\n else obj->Write(\"AliCDBEntry\");\n f->Close();\n }\n}\n\n\n\nvoid DumpObjectRecursive(TObject *obj){\n \/\/\n \/\/\n \/\/\n Int_t counterRec=0;\n printf(\"==> Dumping object at: %p, name=%s, class=%s)\\n\", obj, obj->GetName(), (obj->IsA()->GetName()));\n DumpObjectRecursive(obj, TString(obj->IsA()->GetName())+\".\",counterRec);\n}\n \n\/\/\n\/\/\n\/\/\nvoid DumpObjectRecursive(TObject *obj, TString prefix, Int_t &counterRec){\n \/\/\n \/\/ Recursive dump of the TObject\n \/\/ Dump all basic types and follow pointers to the objects\n \/\/ current limitation:\n \/\/ a.) clases and structures not derived from TObject not followed (to fix)\n \/\/ b.) dynamic arrays not followed\n \/\/ c.) std maps,array .... not followed\n \/\/ \n \/\/\n if (!obj) return;\n \/\/\n \/\/ Special case of Collection classes\n \/\/\n if (obj->IsA()->InheritsFrom(TCollection::Class())) {\n TIter myiter((TCollection*)obj);\n TObject *arObject=0;\n Int_t counter=0;\n while ((arObject = (TObject*)myiter.Next())) {\n TString prefixArr = TString::Format(\"%s[%d]\",prefix.Data(),counter);\n DumpObjectRecursive(arObject,prefixArr,counterRec);\n counter++;\n } \n counterRec++;\n return;\n }\n\n TClass * cl = obj->IsA();\n if (!(cl->GetListOfRealData())) cl->BuildRealData();\n TRealData* rd = 0;\n TIter next(cl->GetListOfRealData()); \n while ((rd = (TRealData*) next())) {\n counterRec++;\n TDataMember* dm = rd->GetDataMember();\n TDataType* dtype = dm->GetDataType();\n Int_t offset = rd->GetThisOffset();\n char* pointer = ((char*) obj) + offset;\n \n if (dm->IsaPointer()) {\n \/\/ We have a pointer to an object or a pointer to an array of basic types.\n TClass* clobj = 0;\n if (!dm->IsBasic()) {\n\tclobj = TClass::GetClass(dm->GetTypeName());\n }\n if (clobj) {\n\t\/\/ We have a pointer to an object.\n\t\/\/\n\tif (!clobj->InheritsFrom(TObject::Class())) {\n\t \/\/ It must be a TObject object.\n\t continue; \n\t}\n\tchar** apointer = (char**) pointer;\n\tTObject* robj = (TObject*) *apointer;\n\t\/\/\t\n\tif(!robj)\n\t printf(\"M:%s%s\\n\",prefix.Data(),dm->GetName()); \/\/ Missing - 0 pointer\n\telse{\n\t printf(\"T:%s\\t%s%s\\n\", clobj->GetName(),prefix.Data(), dm->GetName());\n\t TString prefixNew=prefix;\n\t prefixNew+=dm->GetName();\n\t prefixNew+=\".\";\n\t if (robj!=obj) DumpObjectRecursive(robj,prefixNew,counterRec); \/\/ trivial check \n\t if (robj==obj){\n\t printf(\"R:%s\\t%s%s\\n\",clobj->GetName(),prefix.Data(), dm->GetName());\n\t }\n\t}\n }\n } else if (dm->IsBasic()) {\n \/\/\n \/\/ Basic data type\n \/\/\n const char* index = dm->GetArrayIndex();\n if (dm->GetArrayDim()==0){\n\tprintf(\"B:\\t%s%s\\t%s\\n\", prefix.Data(),rd->GetName(), dtype->AsString(pointer));\n }\n \/\/\n \/\/ Basic array - fixed length\n \/\/\n \/\/ if (dm->GetArrayDim()>0 && strlen(index) != 0){\n if (dm->GetArrayDim()>0 ){\n\tprintf(\"A:\\t%s%s\\t\",prefix.Data(),rd->GetName());\n\tInt_t counter=0;\n\tfor (Int_t idim=0; idim<dm->GetArrayDim(); idim++){\n\t \/\/printf(\"A:%d\\t%d\\n\", dm->GetArrayDim(),dm->GetMaxIndex(idim));\n\t for (Int_t j=0; j<dm->GetMaxIndex(idim); j++){\n\t printf(\"%s\\t\",dtype->AsString(pointer+dm->GetUnitSize()*counter));\n\t counter++;\n\t if (counter%5==0) printf(\"\\nA:\\t%s%s\\t\",prefix.Data(),rd->GetName());\n\t }\n\t}\n\tprintf(\"\\n\");\n }\n \/\/\n \/\/ Basic array - dynamic length\n \/\/\n if (dm->GetArrayDim()>0 && strlen(index) != 0){\n\t\/\/\n\t\/\/ Dump first only for the moment\n\t\/\/ \n\tprintf(\"B:\\t%s%s\\t%s\\n\",prefix.Data(),rd->GetName(), dtype->AsString(pointer));\n }\n } else {\n }\n }\n} \n\n\/\/\n\/\/ Small checks to test the TRealData and TDataType\n\/\/\n\n\n\nvoid DumpDataSimple(){\n \/\/\n \/\/ Dump example for elenatr data types \n \/\/\n TObject *obj = new TVectorD(20);\n TClass * cl = obj->IsA();\n if (!cl->GetListOfRealData()) cl->BuildRealData();\n \/\/\n TRealData* rd = 0;\n rd = (TRealData*)(cl->GetListOfRealData()->FindObject(\"fNrows\"));\n TDataMember* dm = rd->GetDataMember();\n TDataType* dtype = dm->GetDataType();\n \/\/\n Int_t offset = rd->GetThisOffset();\n char* pointer = ((char*) obj) + offset;\n printf(\"%s\\n\",dtype->AsString(pointer));\n \n}\n\nvoid DumpDataArray(){\n \/\/\n \/\/ print array example\n \/\/ \n TObject *obj = new TVectorD(20);\n TClass * cl = obj->IsA();\n if (!cl->GetListOfRealData()) cl->BuildRealData();\n TRealData* rd = 0;\n rd = (TRealData*)(cl->GetListOfRealData()->FindObject(\"*fElements\"));\n TDataMember* dm = rd->GetDataMember();\n TDataType* dtype = dm->GetDataType();\n dtype->Print();\n \/\/\n Int_t offset = rd->GetThisOffset();\n char* pointer = ((char*) obj) + offset; \n printf(\"%s\\n\",dtype->AsString(pointer));\n}\n\nvoid DumpTObjectArray(){\n \/\/\n \/\/\n \/\/\n TObjArray *array = new TObjArray(10);\n for (Int_t i=0; i<10; i++) array->AddLast(new TNamed(Form(\"n%d\",i), Form(\"n%d\",i))); \n DumpObjectRecursive(array);\n \/\/\n \/\/\n TObject *obj = array;\n TClass * cl = obj->IsA();\n if (!cl->GetListOfRealData()) cl->BuildRealData();\n TRealData* rd = 0;\n rd = (TRealData*)(cl->GetListOfRealData()->FindObject(\"*fCont\"));\n TDataMember* dm = rd->GetDataMember();\n TDataType* dtype = dm->GetDataType();\n \/\/\n Int_t offset = rd->GetThisOffset();\n char* pointer = ((char*) obj) + offset;\n char** apointer = (char**) pointer;\n \/\/we have pointer to pointer here\n TObject** ppobj = (TObject**) *apointer;\n (*ppobj)->Print();\n \/\/\n TIter myiter(array);\n TObject *arObject; \n dtype->Print();\n while ((arObject = (TObject*)myiter.Next())) {\n DumpObjectRecursive(arObject);\n } \n\n\n}\n<commit_msg>Equivalent code in the official AliRoot<commit_after><|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 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<commit_msg>Remove useless affectation<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 ++size_;\n return {x, true \/* insertion *\/};\n }\n};\n\n\/*------------------------------------------------------------------------------------------------*\/\n\n}} \/\/ namespace sdd::mem\n<|endoftext|>"} {"text":"<commit_before>\/\/ cpsm - fuzzy path matcher\n\/\/ Copyright (C) 2015 Jamie Liu\n\/\/\n\/\/ Licensed under the Apache License, Version 2.0 (the \"License\");\n\/\/ you may not use this file except in compliance with the License.\n\/\/ You may obtain a copy of the License at\n\/\/\n\/\/ http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n\/\/\n\/\/ Unless required by applicable law or agreed to in writing, software\n\/\/ distributed under the License is distributed on an \"AS IS\" BASIS,\n\/\/ WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n\/\/ See the License for the specific language governing permissions and\n\/\/ limitations under the License.\n\n#include \"matcher.h\"\n\n#include <algorithm>\n#include <cstdint>\n#include <limits>\n#include <utility>\n\n#include <boost\/range\/adaptor\/reversed.hpp>\n\n#include \"path_util.h\"\n#include \"str_util.h\"\n\nnamespace cpsm {\n\nMatcher::Matcher(boost::string_ref const query, MatcherOpts opts,\n StringHandler strings)\n : opts_(std::move(opts)), strings_(std::move(strings)) {\n strings_.decode(query, query_);\n if (opts_.is_path) {\n \/\/ Store the index of the first character after the rightmost path\n \/\/ separator in the query. (Store an index rather than an iterator to keep\n \/\/ Matcher copyable\/moveable.)\n query_key_begin_index_ =\n std::find(query_.crbegin(), query_.crend(), path_separator()).base() -\n query_.cbegin();\n switch (opts_.query_path_mode) {\n case MatcherOpts::QueryPathMode::NORMAL:\n require_full_part_ = false;\n break;\n case MatcherOpts::QueryPathMode::STRICT:\n require_full_part_ = true;\n break;\n case MatcherOpts::QueryPathMode::AUTO:\n require_full_part_ =\n (query.find_first_of(path_separator()) != std::string::npos);\n break;\n }\n } else {\n query_key_begin_index_ = 0;\n require_full_part_ = false;\n }\n\n \/\/ Queries are smartcased (case-sensitive only if any uppercase appears in the\n \/\/ query).\n is_case_sensitive_ =\n std::any_of(query_.begin(), query_.end(),\n [&](char32_t const c) { return strings_.is_uppercase(c); });\n\n cur_file_parts_ = path_components_of(opts_.cur_file);\n if (!cur_file_parts_.empty()) {\n cur_file_key_ = cur_file_parts_.back();\n \/\/ Strip the extension from cur_file_key_, if any (but not the trailing .)\n auto const ext_sep_pos = cur_file_key_.find_last_of('.');\n if (ext_sep_pos != boost::string_ref::npos) {\n cur_file_key_ = cur_file_key_.substr(0, ext_sep_pos + 1);\n }\n }\n}\n\nbool Matcher::match_base(boost::string_ref const item, MatchBase& m,\n std::set<CharCount>* match_positions,\n std::vector<char32_t>* const buf,\n std::vector<char32_t>* const buf2) const {\n m = MatchBase();\n\n std::vector<char32_t> key_chars_local;\n std::vector<char32_t>& key_chars = buf ? *buf : key_chars_local;\n std::vector<char32_t> temp_chars_local;\n std::vector<char32_t>& temp_chars = buf2 ? *buf2 : temp_chars_local;\n std::vector<CharCount> key_char_positions;\n std::vector<CharCount> temp_char_positions;\n\n std::vector<boost::string_ref> item_parts;\n if (opts_.is_path) {\n item_parts = path_components_of(item);\n } else {\n item_parts.push_back(item);\n }\n if (!item_parts.empty()) {\n m.unmatched_len = item_parts.back().size();\n }\n\n if (query_.empty()) {\n match_path(item_parts, m);\n return true;\n }\n\n \/\/ Since for paths (the common case) we prefer rightmost path components, we\n \/\/ scan path components right-to-left.\n auto query_it = query_.crbegin();\n auto const query_end = query_.crend();\n auto query_key_begin = query_.cend();\n \/\/ Index into item_parts, counting from the right.\n CharCount item_part_index = 0;\n \/\/ Offset of the beginning of the current item part from the beginning of the\n \/\/ item, in bytes.\n CharCount item_part_first_byte = item.size();\n for (boost::string_ref const item_part :\n boost::adaptors::reverse(item_parts)) {\n if (query_it == query_end) {\n break;\n }\n\n std::vector<char32_t>& item_part_chars =\n (item_part_index == 0) ? key_chars : temp_chars;\n item_part_chars.clear();\n std::vector<CharCount>* item_part_char_positions = nullptr;\n if (match_positions) {\n item_part_char_positions =\n (item_part_index == 0) ? &key_char_positions : &temp_char_positions;\n item_part_char_positions->clear();\n item_part_first_byte -= item_part.size();\n }\n strings_.decode(item_part, item_part_chars, item_part_char_positions);\n\n \/\/ Since path components are matched right-to-left, query characters must be\n \/\/ consumed greedily right-to-left.\n auto query_prev = query_it;\n std::set<CharCount> match_part_positions;\n for (std::size_t i = item_part_chars.size(); i > 0; i--) {\n char32_t const c = item_part_chars[i-1];\n if (match_char(c, *query_it)) {\n \/\/ Don't store match positions for the key yet, since match_key will\n \/\/ refine them.\n if (match_positions && item_part_index != 0) {\n CharCount begin = (*item_part_char_positions)[i - 1];\n CharCount end;\n if (i == item_part_chars.size()) {\n end = item_part.size();\n } else {\n end = (*item_part_char_positions)[i];\n }\n for (; begin < end; begin++) {\n match_part_positions.insert(item_part_first_byte + begin);\n }\n }\n ++query_it;\n if (query_it == query_end) {\n break;\n }\n }\n }\n\n \/\/ If strict query path mode is on, the match must have run to a path\n \/\/ separator. If not, discard the match.\n if (require_full_part_ &&\n !((query_it == query_end) || (*query_it == path_separator()))) {\n query_it = query_prev;\n continue;\n }\n\n m.part_index_sum += item_part_index;\n if (item_part_index == 0) {\n query_key_begin = query_it.base();\n }\n item_part_index++;\n if (match_positions) {\n for (auto const pos : match_part_positions) {\n match_positions->insert(pos);\n }\n }\n }\n\n \/\/ Did all characters match?\n if (query_it != query_end) {\n return false;\n }\n\n \/\/ Fill path match data.\n match_path(item_parts, m);\n\n \/\/ Now do more refined matching on the key (the rightmost path component of\n \/\/ the item for a path match, and just the full item otherwise).\n if (match_positions) {\n \/\/ Adjust key_char_positions to be relative to the beginning of the string\n \/\/ rather than the beginning of the key. item_parts can't be empty because\n \/\/ query is non-empty and matching was successful.\n CharCount const item_key_first_byte =\n item.size() - item_parts.back().size();\n for (auto& pos : key_char_positions) {\n pos += item_key_first_byte;\n }\n \/\/ Push item.size() to simplify key_char_positions indexing in match_key\n \/\/ and save an extra parameter.\n key_char_positions.push_back(item.size());\n }\n match_key(key_chars, query_key_begin, m, match_positions, key_char_positions);\n return true;\n}\n\nvoid Matcher::match_path(std::vector<boost::string_ref> const& item_parts,\n MatchBase& m) const {\n if (!opts_.is_path) {\n return;\n }\n m.path_distance = path_distance_between(cur_file_parts_, item_parts);\n \/\/ We don't want to exclude cur_file as a match, but we also don't want it\n \/\/ to be the top match, so force cur_file_prefix_len to 0 for cur_file (i.e.\n \/\/ if path_distance is 0).\n if (m.path_distance != 0 && !item_parts.empty()) {\n m.cur_file_prefix_len = common_prefix(cur_file_key_, item_parts.back());\n }\n}\n\nvoid Matcher::match_key(\n std::vector<char32_t> const& key,\n std::vector<char32_t>::const_iterator const query_key, MatchBase& m,\n std::set<CharCount>* const match_positions,\n std::vector<CharCount> const& key_char_positions) const {\n auto const query_key_end = query_.cend();\n if (query_key == query_key_end) {\n return;\n }\n \/\/ key can't be empty since [query_key, query_.end()) is non-empty.\n const auto is_word_prefix = [&](std::size_t const i) -> bool {\n if (i == 0) {\n return true;\n }\n if (strings_.is_alphanumeric(key[i]) &&\n !strings_.is_alphanumeric(key[i - 1])) {\n return true;\n }\n if (strings_.is_uppercase(key[i]) && !strings_.is_uppercase(key[i - 1])) {\n return true;\n }\n return false;\n };\n\n \/\/ Attempt two matches. In the first pass, only match word prefixes and\n \/\/ non-alphanumeric characters to try and get a word prefix-only match. In\n \/\/ the second pass, match greedily.\n for (int pass = 0; pass < 2; pass++) {\n auto query_it = query_key;\n CharCount word_index = 0;\n CharCount2 word_index_sum = 0;\n CharCount word_prefix_len = 0;\n bool is_partial_prefix = false;\n bool at_word_start = true;\n bool word_matched = false;\n std::set<CharCount> match_positions_pass;\n for (std::size_t i = 0; i < key.size(); i++) {\n if (is_word_prefix(i)) {\n word_index++;\n at_word_start = true;\n word_matched = false;\n }\n if (pass == 0 && strings_.is_alphanumeric(*query_it) && !at_word_start) {\n continue;\n }\n if (match_char(key[i], *query_it)) {\n if (at_word_start) {\n word_prefix_len++;\n }\n if (!word_matched) {\n word_index_sum += word_index;\n word_matched = true;\n }\n if (i == 0 && query_it == query_key) {\n is_partial_prefix = true;\n }\n if (match_positions) {\n auto const query_key_begin = query_.cbegin() + query_key_begin_index_;\n std::size_t base = query_key - query_key_begin;\n CharCount begin = key_char_positions[i];\n CharCount const end = key_char_positions[i+1];\n for (; begin < end; begin++) {\n match_positions_pass.insert(base + begin);\n }\n }\n ++query_it;\n if (query_it == query_key_end) {\n auto const query_key_begin = query_.cbegin() + query_key_begin_index_;\n if (query_key != query_key_begin) {\n m.prefix_score = std::numeric_limits<CharCount2>::max();\n } else if ((i + 1) == std::size_t(query_key_end - query_key_begin)) {\n m.prefix_score = 0;\n } else if (pass == 0) {\n m.prefix_score = word_index_sum;\n } else if (is_partial_prefix) {\n m.prefix_score = std::numeric_limits<CharCount2>::max() - 2;\n } else {\n m.prefix_score = std::numeric_limits<CharCount2>::max() - 1;\n }\n m.word_prefix_len = word_prefix_len;\n m.unmatched_len = key.size() - (i + 1);\n if (match_positions) {\n for (auto const pos : match_positions_pass) {\n match_positions->insert(pos);\n }\n }\n return;\n }\n } else {\n at_word_start = false;\n }\n }\n }\n}\n\nbool Matcher::match_char(char32_t item, char32_t const query) const {\n if (!is_case_sensitive_) {\n \/\/ The query must not contain any uppercase letters since otherwise the\n \/\/ query would be case-sensitive, so just force all uppercase characters to\n \/\/ lowercase.\n if (strings_.is_uppercase(item)) {\n item = strings_.to_lowercase(item);\n }\n }\n return item == query;\n}\n\n} \/\/ namespace cpsm\n<commit_msg>Fix non-initial highlighting in item key<commit_after>\/\/ cpsm - fuzzy path matcher\n\/\/ Copyright (C) 2015 Jamie Liu\n\/\/\n\/\/ Licensed under the Apache License, Version 2.0 (the \"License\");\n\/\/ you may not use this file except in compliance with the License.\n\/\/ You may obtain a copy of the License at\n\/\/\n\/\/ http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n\/\/\n\/\/ Unless required by applicable law or agreed to in writing, software\n\/\/ distributed under the License is distributed on an \"AS IS\" BASIS,\n\/\/ WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n\/\/ See the License for the specific language governing permissions and\n\/\/ limitations under the License.\n\n#include \"matcher.h\"\n\n#include <algorithm>\n#include <cstdint>\n#include <limits>\n#include <utility>\n\n#include <boost\/range\/adaptor\/reversed.hpp>\n\n#include \"path_util.h\"\n#include \"str_util.h\"\n\nnamespace cpsm {\n\nMatcher::Matcher(boost::string_ref const query, MatcherOpts opts,\n StringHandler strings)\n : opts_(std::move(opts)), strings_(std::move(strings)) {\n strings_.decode(query, query_);\n if (opts_.is_path) {\n \/\/ Store the index of the first character after the rightmost path\n \/\/ separator in the query. (Store an index rather than an iterator to keep\n \/\/ Matcher copyable\/moveable.)\n query_key_begin_index_ =\n std::find(query_.crbegin(), query_.crend(), path_separator()).base() -\n query_.cbegin();\n switch (opts_.query_path_mode) {\n case MatcherOpts::QueryPathMode::NORMAL:\n require_full_part_ = false;\n break;\n case MatcherOpts::QueryPathMode::STRICT:\n require_full_part_ = true;\n break;\n case MatcherOpts::QueryPathMode::AUTO:\n require_full_part_ =\n (query.find_first_of(path_separator()) != std::string::npos);\n break;\n }\n } else {\n query_key_begin_index_ = 0;\n require_full_part_ = false;\n }\n\n \/\/ Queries are smartcased (case-sensitive only if any uppercase appears in the\n \/\/ query).\n is_case_sensitive_ =\n std::any_of(query_.begin(), query_.end(),\n [&](char32_t const c) { return strings_.is_uppercase(c); });\n\n cur_file_parts_ = path_components_of(opts_.cur_file);\n if (!cur_file_parts_.empty()) {\n cur_file_key_ = cur_file_parts_.back();\n \/\/ Strip the extension from cur_file_key_, if any (but not the trailing .)\n auto const ext_sep_pos = cur_file_key_.find_last_of('.');\n if (ext_sep_pos != boost::string_ref::npos) {\n cur_file_key_ = cur_file_key_.substr(0, ext_sep_pos + 1);\n }\n }\n}\n\nbool Matcher::match_base(boost::string_ref const item, MatchBase& m,\n std::set<CharCount>* match_positions,\n std::vector<char32_t>* const buf,\n std::vector<char32_t>* const buf2) const {\n m = MatchBase();\n\n std::vector<char32_t> key_chars_local;\n std::vector<char32_t>& key_chars = buf ? *buf : key_chars_local;\n std::vector<char32_t> temp_chars_local;\n std::vector<char32_t>& temp_chars = buf2 ? *buf2 : temp_chars_local;\n std::vector<CharCount> key_char_positions;\n std::vector<CharCount> temp_char_positions;\n\n std::vector<boost::string_ref> item_parts;\n if (opts_.is_path) {\n item_parts = path_components_of(item);\n } else {\n item_parts.push_back(item);\n }\n if (!item_parts.empty()) {\n m.unmatched_len = item_parts.back().size();\n }\n\n if (query_.empty()) {\n match_path(item_parts, m);\n return true;\n }\n\n \/\/ Since for paths (the common case) we prefer rightmost path components, we\n \/\/ scan path components right-to-left.\n auto query_it = query_.crbegin();\n auto const query_end = query_.crend();\n auto query_key_begin = query_.cend();\n \/\/ Index into item_parts, counting from the right.\n CharCount item_part_index = 0;\n \/\/ Offset of the beginning of the current item part from the beginning of the\n \/\/ item, in bytes.\n CharCount item_part_first_byte = item.size();\n for (boost::string_ref const item_part :\n boost::adaptors::reverse(item_parts)) {\n if (query_it == query_end) {\n break;\n }\n\n std::vector<char32_t>& item_part_chars =\n (item_part_index == 0) ? key_chars : temp_chars;\n item_part_chars.clear();\n std::vector<CharCount>* item_part_char_positions = nullptr;\n if (match_positions) {\n item_part_char_positions =\n (item_part_index == 0) ? &key_char_positions : &temp_char_positions;\n item_part_char_positions->clear();\n item_part_first_byte -= item_part.size();\n }\n strings_.decode(item_part, item_part_chars, item_part_char_positions);\n\n \/\/ Since path components are matched right-to-left, query characters must be\n \/\/ consumed greedily right-to-left.\n auto query_prev = query_it;\n std::set<CharCount> match_part_positions;\n for (std::size_t i = item_part_chars.size(); i > 0; i--) {\n char32_t const c = item_part_chars[i-1];\n if (match_char(c, *query_it)) {\n \/\/ Don't store match positions for the key yet, since match_key will\n \/\/ refine them.\n if (match_positions && item_part_index != 0) {\n CharCount begin = (*item_part_char_positions)[i - 1];\n CharCount end;\n if (i == item_part_chars.size()) {\n end = item_part.size();\n } else {\n end = (*item_part_char_positions)[i];\n }\n for (; begin < end; begin++) {\n match_part_positions.insert(item_part_first_byte + begin);\n }\n }\n ++query_it;\n if (query_it == query_end) {\n break;\n }\n }\n }\n\n \/\/ If strict query path mode is on, the match must have run to a path\n \/\/ separator. If not, discard the match.\n if (require_full_part_ &&\n !((query_it == query_end) || (*query_it == path_separator()))) {\n query_it = query_prev;\n continue;\n }\n\n m.part_index_sum += item_part_index;\n if (item_part_index == 0) {\n query_key_begin = query_it.base();\n }\n item_part_index++;\n if (match_positions) {\n for (auto const pos : match_part_positions) {\n match_positions->insert(pos);\n }\n }\n }\n\n \/\/ Did all characters match?\n if (query_it != query_end) {\n return false;\n }\n\n \/\/ Fill path match data.\n match_path(item_parts, m);\n\n \/\/ Now do more refined matching on the key (the rightmost path component of\n \/\/ the item for a path match, and just the full item otherwise).\n if (match_positions) {\n \/\/ Adjust key_char_positions to be relative to the beginning of the string\n \/\/ rather than the beginning of the key. item_parts can't be empty because\n \/\/ query is non-empty and matching was successful.\n CharCount const item_key_first_byte =\n item.size() - item_parts.back().size();\n for (auto& pos : key_char_positions) {\n pos += item_key_first_byte;\n }\n \/\/ Push item.size() to simplify key_char_positions indexing in match_key\n \/\/ and save an extra parameter.\n key_char_positions.push_back(item.size());\n }\n match_key(key_chars, query_key_begin, m, match_positions, key_char_positions);\n return true;\n}\n\nvoid Matcher::match_path(std::vector<boost::string_ref> const& item_parts,\n MatchBase& m) const {\n if (!opts_.is_path) {\n return;\n }\n m.path_distance = path_distance_between(cur_file_parts_, item_parts);\n \/\/ We don't want to exclude cur_file as a match, but we also don't want it\n \/\/ to be the top match, so force cur_file_prefix_len to 0 for cur_file (i.e.\n \/\/ if path_distance is 0).\n if (m.path_distance != 0 && !item_parts.empty()) {\n m.cur_file_prefix_len = common_prefix(cur_file_key_, item_parts.back());\n }\n}\n\nvoid Matcher::match_key(\n std::vector<char32_t> const& key,\n std::vector<char32_t>::const_iterator const query_key, MatchBase& m,\n std::set<CharCount>* const match_positions,\n std::vector<CharCount> const& key_char_positions) const {\n auto const query_key_end = query_.cend();\n if (query_key == query_key_end) {\n return;\n }\n \/\/ key can't be empty since [query_key, query_.end()) is non-empty.\n const auto is_word_prefix = [&](std::size_t const i) -> bool {\n if (i == 0) {\n return true;\n }\n if (strings_.is_alphanumeric(key[i]) &&\n !strings_.is_alphanumeric(key[i - 1])) {\n return true;\n }\n if (strings_.is_uppercase(key[i]) && !strings_.is_uppercase(key[i - 1])) {\n return true;\n }\n return false;\n };\n\n \/\/ Attempt two matches. In the first pass, only match word prefixes and\n \/\/ non-alphanumeric characters to try and get a word prefix-only match. In\n \/\/ the second pass, match greedily.\n for (int pass = 0; pass < 2; pass++) {\n auto query_it = query_key;\n CharCount word_index = 0;\n CharCount2 word_index_sum = 0;\n CharCount word_prefix_len = 0;\n bool is_partial_prefix = false;\n bool at_word_start = true;\n bool word_matched = false;\n std::set<CharCount> match_positions_pass;\n for (std::size_t i = 0; i < key.size(); i++) {\n if (is_word_prefix(i)) {\n word_index++;\n at_word_start = true;\n word_matched = false;\n }\n if (pass == 0 && strings_.is_alphanumeric(*query_it) && !at_word_start) {\n continue;\n }\n if (match_char(key[i], *query_it)) {\n if (at_word_start) {\n word_prefix_len++;\n }\n if (!word_matched) {\n word_index_sum += word_index;\n word_matched = true;\n }\n if (i == 0 && query_it == query_key) {\n is_partial_prefix = true;\n }\n if (match_positions) {\n CharCount begin = key_char_positions[i];\n CharCount const end = key_char_positions[i+1];\n for (; begin < end; begin++) {\n match_positions_pass.insert(begin);\n }\n }\n ++query_it;\n if (query_it == query_key_end) {\n auto const query_key_begin = query_.cbegin() + query_key_begin_index_;\n if (query_key != query_key_begin) {\n m.prefix_score = std::numeric_limits<CharCount2>::max();\n } else if ((i + 1) == std::size_t(query_key_end - query_key_begin)) {\n m.prefix_score = 0;\n } else if (pass == 0) {\n m.prefix_score = word_index_sum;\n } else if (is_partial_prefix) {\n m.prefix_score = std::numeric_limits<CharCount2>::max() - 2;\n } else {\n m.prefix_score = std::numeric_limits<CharCount2>::max() - 1;\n }\n m.word_prefix_len = word_prefix_len;\n m.unmatched_len = key.size() - (i + 1);\n if (match_positions) {\n for (auto const pos : match_positions_pass) {\n match_positions->insert(pos);\n }\n }\n return;\n }\n } else {\n at_word_start = false;\n }\n }\n }\n}\n\nbool Matcher::match_char(char32_t item, char32_t const query) const {\n if (!is_case_sensitive_) {\n \/\/ The query must not contain any uppercase letters since otherwise the\n \/\/ query would be case-sensitive, so just force all uppercase characters to\n \/\/ lowercase.\n if (strings_.is_uppercase(item)) {\n item = strings_.to_lowercase(item);\n }\n }\n return item == query;\n}\n\n} \/\/ namespace cpsm\n<|endoftext|>"} {"text":"<commit_before>\/*\n * Copyright (C) 2012 by Glenn Hickey (hickey@soe.ucsc.edu)\n *\n * Released under the MIT license, see LICENSE.txt\n *\/\n\n#include <cstdlib>\n#include <iostream>\n#include <cassert>\n#include <fstream>\n\n#include \"sgbuilder.h\"\n#include \"sgsql.h\"\n\nusing namespace std;\nusing namespace hal;\n\n\n\nstatic CLParserPtr initParser()\n{\n CLParserPtr optionsParser = hdf5CLParserInstance();\n optionsParser->addArgument(\"halFile\", \"input hal file\");\n optionsParser->addArgument(\"fastaFile\", \"Output FASTA sequences\");\n optionsParser->addArgument(\"sqlFile\", \"SQL inserts written here\");\n optionsParser->addOption(\"refGenome\", \n \"name of reference genome (root if empty)\", \n \"\\\"\\\"\");\n optionsParser->addOption(\"refSequence\",\n \"name of reference sequence within reference genome\"\n \" (all sequences if empty)\",\n \"\\\"\\\"\");\n optionsParser->addOption(\"start\",\n \"coordinate within reference genome (or sequence\"\n \" if specified) to start at\",\n 0);\n optionsParser->addOption(\"length\",\n \"length of the reference genome (or sequence\"\n \" if specified) to convert. If set to 0,\"\n \" the entire thing is converted\",\n 0);\n optionsParser->addOption(\"rootGenome\", \n \"name of root genome (none if empty)\", \n \"\\\"\\\"\");\n optionsParser->addOption(\"targetGenomes\",\n \"comma-separated (no spaces) list of target genomes \"\n \"(others are excluded) (vist all if empty)\",\n \"\\\"\\\"\");\n optionsParser->addOptionFlag(\"noAncestors\", \n \"don't write ancestral sequences. IMPORTANT: \"\n \"Must be used in conjunction with --refGenome\"\n \" to set a non-ancestral genome as the reference\"\n \" because the default reference is the root.\", \n false);\n\n optionsParser->setDescription(\"Convert hal database to GA4GH Side Graph\");\n return optionsParser;\n}\n\nint main(int argc, char** argv)\n{\n CLParserPtr optionsParser = initParser();\n string halPath;\n string fastaPath;\n string sqlPath;\n string refGenomeName;\n string rootGenomeName;\n string targetGenomes;\n string refSequenceName;\n hal_index_t start;\n hal_size_t length;\n bool noAncestors;\n try\n {\n optionsParser->parseOptions(argc, argv);\n halPath = optionsParser->getArgument<string>(\"halFile\");\n fastaPath = optionsParser->getArgument<string>(\"fastaFile\");\n sqlPath = optionsParser->getArgument<string>(\"sqlFile\");\n refGenomeName = optionsParser->getOption<string>(\"refGenome\");\n rootGenomeName = optionsParser->getOption<string>(\"rootGenome\");\n targetGenomes = optionsParser->getOption<string>(\"targetGenomes\");\n refSequenceName = optionsParser->getOption<string>(\"refSequence\"); \n start = optionsParser->getOption<hal_index_t>(\"start\");\n length = optionsParser->getOption<hal_size_t>(\"length\");\n noAncestors = optionsParser->getFlag(\"noAncestors\");\n\n if (rootGenomeName != \"\\\"\\\"\" && targetGenomes != \"\\\"\\\"\")\n {\n throw hal_exception(\"--rootGenome and --targetGenomes options are \"\n \"mutually exclusive\");\n }\n }\n catch(exception& e)\n {\n cerr << e.what() << endl;\n optionsParser->printUsage(cerr);\n exit(1);\n }\n try\n {\n ofstream fastaStream(fastaPath.c_str());\n if (!fastaStream)\n {\n throw hal_exception(\"error opening output fasta file \" + fastaPath);\n }\n fastaStream.close();\n \n ofstream sqlStream(sqlPath.c_str());\n if (!sqlStream)\n {\n throw hal_exception(\"error opening output sql file \" + sqlPath);\n }\n sqlStream.close();\n \n AlignmentConstPtr alignment = openHalAlignmentReadOnly(halPath, \n optionsParser);\n if (alignment->getNumGenomes() == 0)\n {\n throw hal_exception(\"hal alignmenet is empty\");\n }\n\n \/\/ root is specified either by the parameter or as the alignment root\n \/\/ by default\n const Genome* rootGenome = NULL;\n if (rootGenomeName != \"\\\"\\\"\")\n {\n rootGenome = alignment->openGenome(rootGenomeName);\n }\n else\n {\n rootGenome = alignment->openGenome(alignment->getRootName());\n }\n if (rootGenome == NULL)\n {\n throw hal_exception(string(\"Root genome, \") + rootGenomeName + \n \", not found in alignment\");\n }\n\n \/\/ target genomes pulled from tree traversal (using optional root\n \/\/ parameter)\n vector<const Genome*> targetVec;\n if (targetGenomes == \"\\\"\\\"\")\n {\n set<const Genome*> targetSet;\n getGenomesInSubTree(rootGenome, targetSet);\n for (set<const Genome*>::iterator i = targetSet.begin();\n i != targetSet.end(); ++i)\n {\n if (noAncestors == false || (*i)->getNumChildren() == 0)\n {\n targetVec.push_back(*i);\n }\n }\n }\n \/\/ target genomes pulled from list. \n else\n {\n vector<string> targetNames = chopString(targetGenomes, \",\");\n for (size_t i = 0; i < targetNames.size(); ++i)\n {\n const Genome* tgtGenome = alignment->openGenome(targetNames[i]);\n if (tgtGenome == NULL)\n {\n throw hal_exception(string(\"Target genome, \") + targetNames[i] + \n \", not found in alignment\");\n }\n targetVec.push_back(tgtGenome);\n }\n \n }\n\n \/\/ open the reference genome (root genome if unspecified)\n const Genome* refGenome = NULL;\n if (refGenomeName != \"\\\"\\\"\")\n {\n refGenome = alignment->openGenome(refGenomeName);\n if (refGenome == NULL)\n {\n throw hal_exception(string(\"Reference genome, \") + refGenomeName + \n \", not found in alignment\");\n }\n set<const Genome*> genomeSet;\n genomeSet.insert(refGenome);\n genomeSet.insert(rootGenome);\n if (getLowestCommonAncestor(genomeSet) != rootGenome)\n {\n throw hal_exception(string(\"reference genome must be under root\"));\n }\n }\n else\n {\n refGenome = rootGenome;\n }\n\n \/\/ optionally specify a sequence in the ref genome\n const Sequence* refSequence = NULL;\n if (refSequenceName != \"\\\"\\\"\")\n {\n refSequence = refGenome->getSequence(refSequenceName);\n if (refSequence == NULL)\n {\n throw hal_exception(string(\"Reference sequence, \") + refSequenceName + \n \", not found in reference genome, \" + \n refGenome->getName());\n }\n }\n\n \/\/ make sure refGenome not in target genomes\n for (vector<const Genome*>::iterator i = targetVec.begin();\n i != targetVec.end(); ++i)\n {\n if (*i == refGenome)\n {\n targetVec.erase(i);\n break;\n }\n }\n\n SGBuilder sgbuild;\n sgbuild.init(alignment, rootGenome, false, true);\n \/\/ add the reference genome\n sgbuild.addGenome(refGenome, refSequence, start, length);\n\n \/\/ add the other genomes\n for (size_t i = 0; i < targetVec.size(); ++i)\n {\n sgbuild.addGenome(targetVec[i]);\n }\n \n \/\/cout << *sgbuild.getSideGraph() << endl;\n\n SGSQL sqlWriter;\n sqlWriter.writeDb(&sgbuild, sqlPath, fastaPath, halPath);\n\n }\n\/* catch(hal_exception& e)\n {\n cerr << \"hal exception caught: \" << e.what() << endl;\n return 1;\n }\n catch(exception& e)\n {\n cerr << \"Exception caught: \" << e.what() << endl;\n return 1;\n }\n*\/\n catch(int e) {}\n return 0;\n}\n<commit_msg>disable options that arent implemented properly yet to avoid future confusion<commit_after>\/*\n * Copyright (C) 2012 by Glenn Hickey (hickey@soe.ucsc.edu)\n *\n * Released under the MIT license, see LICENSE.txt\n *\/\n\n#include <cstdlib>\n#include <iostream>\n#include <cassert>\n#include <fstream>\n\n#include \"sgbuilder.h\"\n#include \"sgsql.h\"\n\nusing namespace std;\nusing namespace hal;\n\n\n\nstatic CLParserPtr initParser()\n{\n CLParserPtr optionsParser = hdf5CLParserInstance();\n optionsParser->addArgument(\"halFile\", \"input hal file\");\n optionsParser->addArgument(\"fastaFile\", \"Output FASTA sequences\");\n optionsParser->addArgument(\"sqlFile\", \"SQL inserts written here\");\n optionsParser->addOption(\"refGenome\", \n \"name of reference genome (root if empty)\", \n \"\\\"\\\"\");\n optionsParser->addOption(\"refSequence\",\n \"name of reference sequence within reference genome\"\n \" (all sequences if empty)\",\n \"\\\"\\\"\");\n optionsParser->addOption(\"start\",\n \"coordinate within reference genome (or sequence\"\n \" if specified) to start at\",\n 0);\n optionsParser->addOption(\"length\",\n \"length of the reference genome (or sequence\"\n \" if specified) to convert. If set to 0,\"\n \" the entire thing is converted\",\n 0);\n optionsParser->addOption(\"rootGenome\", \n \"name of root genome (none if empty)\", \n \"\\\"\\\"\");\n optionsParser->addOption(\"targetGenomes\",\n \"comma-separated (no spaces) list of target genomes \"\n \"(others are excluded) (vist all if empty)\",\n \"\\\"\\\"\");\n optionsParser->addOptionFlag(\"noAncestors\", \n \"don't write ancestral sequences. IMPORTANT: \"\n \"Must be used in conjunction with --refGenome\"\n \" to set a non-ancestral genome as the reference\"\n \" because the default reference is the root.\", \n false);\n\n optionsParser->setDescription(\"Convert hal database to GA4GH Side Graph\");\n return optionsParser;\n}\n\nint main(int argc, char** argv)\n{\n CLParserPtr optionsParser = initParser();\n string halPath;\n string fastaPath;\n string sqlPath;\n string refGenomeName;\n string rootGenomeName;\n string targetGenomes;\n string refSequenceName;\n hal_index_t start;\n hal_size_t length;\n bool noAncestors;\n try\n {\n optionsParser->parseOptions(argc, argv);\n halPath = optionsParser->getArgument<string>(\"halFile\");\n fastaPath = optionsParser->getArgument<string>(\"fastaFile\");\n sqlPath = optionsParser->getArgument<string>(\"sqlFile\");\n refGenomeName = optionsParser->getOption<string>(\"refGenome\");\n rootGenomeName = optionsParser->getOption<string>(\"rootGenome\");\n targetGenomes = optionsParser->getOption<string>(\"targetGenomes\");\n refSequenceName = optionsParser->getOption<string>(\"refSequence\"); \n start = optionsParser->getOption<hal_index_t>(\"start\");\n length = optionsParser->getOption<hal_size_t>(\"length\");\n noAncestors = optionsParser->getFlag(\"noAncestors\");\n\n if (rootGenomeName != \"\\\"\\\"\" && targetGenomes != \"\\\"\\\"\")\n {\n throw hal_exception(\"--rootGenome and --targetGenomes options are \"\n \"mutually exclusive\");\n } \n }\n catch(exception& e)\n {\n cerr << e.what() << endl;\n optionsParser->printUsage(cerr);\n exit(1);\n }\n try\n {\n \/\/ TEMP\n if (refGenomeName != \"\\\"\\\"\" || rootGenomeName != \"\\\"\\\"\" ||\n refSequenceName != \"\\\"\\\"\" ||\n start != 0 || length != 0 || noAncestors == true)\n {\n throw hal_exception(\"The following options are disabled in this release:\"\n \"\\n--refGenome\\n--rootGenome\\n--refSeqeunce\\n--start\"\n \"\\n--length\\n--noAncestors\");\n }\n \n ofstream fastaStream(fastaPath.c_str());\n if (!fastaStream)\n {\n throw hal_exception(\"error opening output fasta file \" + fastaPath);\n }\n fastaStream.close();\n \n ofstream sqlStream(sqlPath.c_str());\n if (!sqlStream)\n {\n throw hal_exception(\"error opening output sql file \" + sqlPath);\n }\n sqlStream.close();\n \n AlignmentConstPtr alignment = openHalAlignmentReadOnly(halPath, \n optionsParser);\n if (alignment->getNumGenomes() == 0)\n {\n throw hal_exception(\"hal alignmenet is empty\");\n }\n\n \/\/ root is specified either by the parameter or as the alignment root\n \/\/ by default\n const Genome* rootGenome = NULL;\n if (rootGenomeName != \"\\\"\\\"\")\n {\n rootGenome = alignment->openGenome(rootGenomeName);\n }\n else\n {\n rootGenome = alignment->openGenome(alignment->getRootName());\n }\n if (rootGenome == NULL)\n {\n throw hal_exception(string(\"Root genome, \") + rootGenomeName + \n \", not found in alignment\");\n }\n\n \/\/ target genomes pulled from tree traversal (using optional root\n \/\/ parameter)\n vector<const Genome*> targetVec;\n if (targetGenomes == \"\\\"\\\"\")\n {\n set<const Genome*> targetSet;\n getGenomesInSubTree(rootGenome, targetSet);\n for (set<const Genome*>::iterator i = targetSet.begin();\n i != targetSet.end(); ++i)\n {\n if (noAncestors == false || (*i)->getNumChildren() == 0)\n {\n targetVec.push_back(*i);\n }\n }\n }\n \/\/ target genomes pulled from list. \n else\n {\n vector<string> targetNames = chopString(targetGenomes, \",\");\n for (size_t i = 0; i < targetNames.size(); ++i)\n {\n const Genome* tgtGenome = alignment->openGenome(targetNames[i]);\n if (tgtGenome == NULL)\n {\n throw hal_exception(string(\"Target genome, \") + targetNames[i] + \n \", not found in alignment\");\n }\n targetVec.push_back(tgtGenome);\n }\n \n }\n\n \/\/ open the reference genome (root genome if unspecified)\n const Genome* refGenome = NULL;\n if (refGenomeName != \"\\\"\\\"\")\n {\n refGenome = alignment->openGenome(refGenomeName);\n if (refGenome == NULL)\n {\n throw hal_exception(string(\"Reference genome, \") + refGenomeName + \n \", not found in alignment\");\n }\n set<const Genome*> genomeSet;\n genomeSet.insert(refGenome);\n genomeSet.insert(rootGenome);\n if (getLowestCommonAncestor(genomeSet) != rootGenome)\n {\n throw hal_exception(string(\"reference genome must be under root\"));\n }\n }\n else\n {\n refGenome = rootGenome;\n }\n\n \/\/ optionally specify a sequence in the ref genome\n const Sequence* refSequence = NULL;\n if (refSequenceName != \"\\\"\\\"\")\n {\n refSequence = refGenome->getSequence(refSequenceName);\n if (refSequence == NULL)\n {\n throw hal_exception(string(\"Reference sequence, \") + refSequenceName + \n \", not found in reference genome, \" + \n refGenome->getName());\n }\n }\n\n \/\/ make sure refGenome not in target genomes\n for (vector<const Genome*>::iterator i = targetVec.begin();\n i != targetVec.end(); ++i)\n {\n if (*i == refGenome)\n {\n targetVec.erase(i);\n break;\n }\n }\n\n SGBuilder sgbuild;\n sgbuild.init(alignment, rootGenome, false, true);\n \/\/ add the reference genome\n sgbuild.addGenome(refGenome, refSequence, start, length);\n\n \/\/ add the other genomes\n for (size_t i = 0; i < targetVec.size(); ++i)\n {\n sgbuild.addGenome(targetVec[i]);\n }\n \n \/\/cout << *sgbuild.getSideGraph() << endl;\n\n SGSQL sqlWriter;\n sqlWriter.writeDb(&sgbuild, sqlPath, fastaPath, halPath);\n\n }\n\/* catch(hal_exception& e)\n {\n cerr << \"hal exception caught: \" << e.what() << endl;\n return 1;\n }\n catch(exception& e)\n {\n cerr << \"Exception caught: \" << e.what() << endl;\n return 1;\n }\n*\/\n catch(int e) {}\n return 0;\n}\n<|endoftext|>"} {"text":"<commit_before>\/*\n\nCopyright (c) 2006, Arvid Norberg\nAll rights reserved.\n\nRedistribution and use in source and binary forms, with or without\nmodification, are permitted provided that the following conditions\nare met:\n\n * Redistributions of source code must retain the above copyright\n notice, this list of conditions and the following disclaimer.\n * Redistributions in binary form must reproduce the above copyright\n notice, this list of conditions and the following disclaimer in\n the documentation and\/or other materials provided with the distribution.\n * Neither the name of the author nor the names of its\n contributors may be used to endorse or promote products derived\n from this software without specific prior written permission.\n\nTHIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS \"AS IS\"\nAND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE\nIMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE\nARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE\nLIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR\nCONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF\nSUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS\nINTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN\nCONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)\nARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE\nPOSSIBILITY OF SUCH DAMAGE.\n\n*\/\n\n#include \"libtorrent\/pch.hpp\"\n\n#include \"libtorrent\/file_pool.hpp\"\n\n#include <iostream>\n\nnamespace libtorrent\n{\n\tusing boost::multi_index::nth_index;\n\tusing boost::multi_index::get;\n\n\tboost::shared_ptr<file> file_pool::open_file(void* st, fs::path const& p, file::open_mode m)\n\t{\n\t\tassert(st != 0);\n\t\tassert(p.is_complete());\n\t\tboost::mutex::scoped_lock l(m_mutex);\n\t\ttypedef nth_index<file_set, 0>::type path_view;\n\t\tpath_view& pt = get<0>(m_files);\n\t\tpath_view::iterator i = pt.find(p);\n\t\tif (i != pt.end())\n\t\t{\n\t\t\tlru_file_entry e = *i;\n\t\t\te.last_use = time_now();\n\n\t\t\t\/\/ if you hit this assert, you probably have more than one\n\t\t\t\/\/ storage\/torrent using the same file at the same time!\n\t\t\tassert(e.key == st);\n\n\t\t\te.key = st;\n\t\t\tif ((e.mode & m) != m)\n\t\t\t{\n\t\t\t\t\/\/ close the file before we open it with\n\t\t\t\t\/\/ the new read\/write privilages\n\t\t\t\ti->file_ptr.reset();\n\t\t\t\tassert(e.file_ptr.unique());\n\t\t\t\te.file_ptr.reset();\n\t\t\t\te.file_ptr.reset(new file(p, m));\n\t\t\t\te.mode = m;\n\t\t\t}\n\t\t\tpt.replace(i, e);\n\t\t\treturn e.file_ptr;\n\t\t}\n\t\t\/\/ the file is not in our cache\n\t\tif ((int)m_files.size() >= m_size)\n\t\t{\n\t\t\t\/\/ the file cache is at its maximum size, close\n\t\t\t\/\/ the least recently used (lru) file from it\n\t\t\ttypedef nth_index<file_set, 1>::type lru_view;\n\t\t\tlru_view& lt = get<1>(m_files);\n\t\t\tlru_view::iterator i = lt.begin();\n\t\t\t\/\/ the first entry in this view is the least recently used\n\t\t\tassert(lt.size() == 1 || (i->last_use <= boost::next(i)->last_use));\n\t\t\tlt.erase(i);\n\t\t}\n\t\tlru_file_entry e(boost::shared_ptr<file>(new file(p, m)));\n\t\te.mode = m;\n\t\te.key = st;\n\t\te.file_path = p;\n\t\tpt.insert(e);\n\t\treturn e.file_ptr;\n\t}\n\n\tvoid file_pool::release(void* st)\n\t{\n\t\tboost::mutex::scoped_lock l(m_mutex);\n\t\tassert(st != 0);\n\t\tusing boost::tie;\n\n\t\ttypedef nth_index<file_set, 2>::type key_view;\n\t\tkey_view& kt = get<2>(m_files);\n\n\t\tkey_view::iterator start, end;\n\t\ttie(start, end) = kt.equal_range(st);\n\t\tkt.erase(start, end);\n\t}\n\n\tvoid file_pool::resize(int size)\n\t{\n\t\tassert(size > 0);\n\t\tif (size == m_size) return;\n\t\tboost::mutex::scoped_lock l(m_mutex);\n\t\tm_size = size;\n\t\tif (int(m_files.size()) <= m_size) return;\n\n\t\t\/\/ close the least recently used files\n\t\ttypedef nth_index<file_set, 1>::type lru_view;\n\t\tlru_view& lt = get<1>(m_files);\n\t\tlru_view::iterator i = lt.begin();\n\t\twhile (int(m_files.size()) > m_size)\n\t\t{\n\t\t\t\/\/ the first entry in this view is the least recently used\n\t\t\tassert(lt.size() == 1 || (i->last_use <= boost::next(i)->last_use));\n\t\t\tlt.erase(i++);\n\t\t}\n\t}\n\n}\n<commit_msg>turned file collisions into a runtime error rather than an assert. fixes #14<commit_after>\/*\n\nCopyright (c) 2006, Arvid Norberg\nAll rights reserved.\n\nRedistribution and use in source and binary forms, with or without\nmodification, are permitted provided that the following conditions\nare met:\n\n * Redistributions of source code must retain the above copyright\n notice, this list of conditions and the following disclaimer.\n * Redistributions in binary form must reproduce the above copyright\n notice, this list of conditions and the following disclaimer in\n the documentation and\/or other materials provided with the distribution.\n * Neither the name of the author nor the names of its\n contributors may be used to endorse or promote products derived\n from this software without specific prior written permission.\n\nTHIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS \"AS IS\"\nAND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE\nIMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE\nARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE\nLIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR\nCONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF\nSUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS\nINTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN\nCONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)\nARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE\nPOSSIBILITY OF SUCH DAMAGE.\n\n*\/\n\n#include \"libtorrent\/pch.hpp\"\n\n#include \"libtorrent\/file_pool.hpp\"\n\n#include <iostream>\n\nnamespace libtorrent\n{\n\tusing boost::multi_index::nth_index;\n\tusing boost::multi_index::get;\n\n\tboost::shared_ptr<file> file_pool::open_file(void* st, fs::path const& p, file::open_mode m)\n\t{\n\t\tassert(st != 0);\n\t\tassert(p.is_complete());\n\t\tboost::mutex::scoped_lock l(m_mutex);\n\t\ttypedef nth_index<file_set, 0>::type path_view;\n\t\tpath_view& pt = get<0>(m_files);\n\t\tpath_view::iterator i = pt.find(p);\n\t\tif (i != pt.end())\n\t\t{\n\t\t\tlru_file_entry e = *i;\n\t\t\te.last_use = time_now();\n\n\t\t\tif (e.key != st)\n\t\t\t{\n\t\t\t\t\/\/ this means that another instance of the storage\n\t\t\t\t\/\/ is using the exact same file.\n\t\t\t\tthrow file_error(\"torrent uses the same file as another torrent \"\n\t\t\t\t\t\"(\" + p.string() + \")\");\n\t\t\t}\n\n\t\t\te.key = st;\n\t\t\tif ((e.mode & m) != m)\n\t\t\t{\n\t\t\t\t\/\/ close the file before we open it with\n\t\t\t\t\/\/ the new read\/write privilages\n\t\t\t\ti->file_ptr.reset();\n\t\t\t\tassert(e.file_ptr.unique());\n\t\t\t\te.file_ptr.reset();\n\t\t\t\te.file_ptr.reset(new file(p, m));\n\t\t\t\te.mode = m;\n\t\t\t}\n\t\t\tpt.replace(i, e);\n\t\t\treturn e.file_ptr;\n\t\t}\n\t\t\/\/ the file is not in our cache\n\t\tif ((int)m_files.size() >= m_size)\n\t\t{\n\t\t\t\/\/ the file cache is at its maximum size, close\n\t\t\t\/\/ the least recently used (lru) file from it\n\t\t\ttypedef nth_index<file_set, 1>::type lru_view;\n\t\t\tlru_view& lt = get<1>(m_files);\n\t\t\tlru_view::iterator i = lt.begin();\n\t\t\t\/\/ the first entry in this view is the least recently used\n\t\t\tassert(lt.size() == 1 || (i->last_use <= boost::next(i)->last_use));\n\t\t\tlt.erase(i);\n\t\t}\n\t\tlru_file_entry e(boost::shared_ptr<file>(new file(p, m)));\n\t\te.mode = m;\n\t\te.key = st;\n\t\te.file_path = p;\n\t\tpt.insert(e);\n\t\treturn e.file_ptr;\n\t}\n\n\tvoid file_pool::release(void* st)\n\t{\n\t\tboost::mutex::scoped_lock l(m_mutex);\n\t\tassert(st != 0);\n\t\tusing boost::tie;\n\n\t\ttypedef nth_index<file_set, 2>::type key_view;\n\t\tkey_view& kt = get<2>(m_files);\n\n\t\tkey_view::iterator start, end;\n\t\ttie(start, end) = kt.equal_range(st);\n\t\tkt.erase(start, end);\n\t}\n\n\tvoid file_pool::resize(int size)\n\t{\n\t\tassert(size > 0);\n\t\tif (size == m_size) return;\n\t\tboost::mutex::scoped_lock l(m_mutex);\n\t\tm_size = size;\n\t\tif (int(m_files.size()) <= m_size) return;\n\n\t\t\/\/ close the least recently used files\n\t\ttypedef nth_index<file_set, 1>::type lru_view;\n\t\tlru_view& lt = get<1>(m_files);\n\t\tlru_view::iterator i = lt.begin();\n\t\twhile (int(m_files.size()) > m_size)\n\t\t{\n\t\t\t\/\/ the first entry in this view is the least recently used\n\t\t\tassert(lt.size() == 1 || (i->last_use <= boost::next(i)->last_use));\n\t\t\tlt.erase(i++);\n\t\t}\n\t}\n\n}\n<|endoftext|>"} {"text":"<commit_before>\/*\n\nCopyright (c) 2006, Arvid Norberg\nAll rights reserved.\n\nRedistribution and use in source and binary forms, with or without\nmodification, are permitted provided that the following conditions\nare met:\n\n * Redistributions of source code must retain the above copyright\n notice, this list of conditions and the following disclaimer.\n * Redistributions in binary form must reproduce the above copyright\n notice, this list of conditions and the following disclaimer in\n the documentation and\/or other materials provided with the distribution.\n * Neither the name of the author nor the names of its\n contributors may be used to endorse or promote products derived\n from this software without specific prior written permission.\n\nTHIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS \"AS IS\"\nAND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE\nIMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE\nARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE\nLIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR\nCONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF\nSUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS\nINTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN\nCONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)\nARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE\nPOSSIBILITY OF SUCH DAMAGE.\n\n*\/\n\n#include <boost\/version.hpp>\n#include <boost\/bind.hpp>\n#include \"libtorrent\/pch.hpp\"\n#include \"libtorrent\/assert.hpp\"\n#include \"libtorrent\/file_pool.hpp\"\n#include \"libtorrent\/error_code.hpp\"\n\nnamespace libtorrent\n{\n\tboost::shared_ptr<file> file_pool::open_file(void* st, std::string const& p\n\t\t, int m, error_code& ec)\n\t{\n\t\tTORRENT_ASSERT(st != 0);\n\t\tTORRENT_ASSERT(is_complete(p));\n\t\tTORRENT_ASSERT((m & file::rw_mask) == file::read_only\n\t\t\t|| (m & file::rw_mask) == file::read_write);\n\t\tmutex::scoped_lock l(m_mutex);\n\t\tfile_set::iterator i = m_files.find(p);\n\t\tif (i != m_files.end())\n\t\t{\n\t\t\tlru_file_entry& e = i->second;\n\t\t\te.last_use = time_now();\n\n\t\t\tif (e.key != st && ((e.mode & file::rw_mask) != file::read_only\n\t\t\t\t|| (m & file::rw_mask) != file::read_only))\n\t\t\t{\n\t\t\t\t\/\/ this means that another instance of the storage\n\t\t\t\t\/\/ is using the exact same file.\n#if BOOST_VERSION >= 103500\n\t\t\t\tec = errors::file_collision;\n#endif\n\t\t\t\treturn boost::shared_ptr<file>();\n\t\t\t}\n\n\t\t\te.key = st;\n\t\t\t\/\/ if we asked for a file in write mode,\n\t\t\t\/\/ and the cached file is is not opened in\n\t\t\t\/\/ write mode, re-open it\n\t\t\tif (((e.mode & file::rw_mask) != file::read_write)\n\t\t\t\t&& ((m & file::rw_mask) == file::read_write))\n\t\t\t{\n\t\t\t\t\/\/ close the file before we open it with\n\t\t\t\t\/\/ the new read\/write privilages\n\t\t\t\tTORRENT_ASSERT(e.file_ptr.unique());\n\t\t\t\te.file_ptr->close();\n\t\t\t\tif (!e.file_ptr->open(p, m, ec))\n\t\t\t\t{\n\t\t\t\t\tm_files.erase(i);\n\t\t\t\t\treturn boost::shared_ptr<file>();\n\t\t\t\t}\n#ifdef TORRENT_WINDOWS\n\t\t\t\tif (m_low_prio_io)\n\t\t\t\t{\n\t\t\t\t\tFILE_IO_PRIORITY_HINT_INFO priorityHint;\n\t\t\t\t\tpriorityHint.PriorityHint = IoPriorityHintLow;\n\t\t\t\t\tresult = SetFileInformationByHandle(e.file_ptr->native_handle(),\n\t\t\t\t\t\tFileIoPriorityHintInfo, &priorityHint, sizeof(PriorityHint));\n\t\t\t\t}\n#endif\n\t\t\t\tTORRENT_ASSERT(e.file_ptr->is_open());\n\t\t\t\te.mode = m;\n\t\t\t}\n\t\t\tTORRENT_ASSERT((e.mode & file::no_buffer) == (m & file::no_buffer));\n\t\t\treturn e.file_ptr;\n\t\t}\n\t\t\/\/ the file is not in our cache\n\t\tif ((int)m_files.size() >= m_size)\n\t\t{\n\t\t\t\/\/ the file cache is at its maximum size, close\n\t\t\t\/\/ the least recently used (lru) file from it\n\t\t\tremove_oldest();\n\t\t}\n\t\tlru_file_entry e;\n\t\te.file_ptr.reset(new (std::nothrow)file);\n\t\tif (!e.file_ptr)\n\t\t{\n\t\t\tec = error_code(ENOMEM, get_posix_category());\n\t\t\treturn e.file_ptr;\n\t\t}\n\t\tif (!e.file_ptr->open(p, m, ec))\n\t\t\treturn boost::shared_ptr<file>();\n\t\te.mode = m;\n\t\te.key = st;\n\t\tm_files.insert(std::make_pair(p, e));\n\t\tTORRENT_ASSERT(e.file_ptr->is_open());\n\t\treturn e.file_ptr;\n\t}\n\n\tvoid file_pool::remove_oldest()\n\t{\n\t\tfile_set::iterator i = std::min_element(m_files.begin(), m_files.end()\n\t\t\t, boost::bind(&lru_file_entry::last_use, boost::bind(&file_set::value_type::second, _1))\n\t\t\t\t< boost::bind(&lru_file_entry::last_use, boost::bind(&file_set::value_type::second, _2)));\n\t\tif (i == m_files.end()) return;\n\t\tm_files.erase(i);\n\t}\n\n\tvoid file_pool::release(std::string const& p)\n\t{\n\t\tmutex::scoped_lock l(m_mutex);\n\n\t\tfile_set::iterator i = m_files.find(p);\n\t\tif (i != m_files.end()) m_files.erase(i);\n\t}\n\n\t\/\/ closes files belonging to the specified\n\t\/\/ storage. If 0 is passed, all files are closed\n\tvoid file_pool::release(void* st)\n\t{\n\t\tmutex::scoped_lock l(m_mutex);\n\t\tif (st == 0)\n\t\t{\n\t\t\tm_files.clear();\n\t\t\treturn;\n\t\t}\n\n\t\tfor (file_set::iterator i = m_files.begin();\n\t\t\ti != m_files.end();)\n\t\t{\n\t\t\tif (i->second.key == st)\n\t\t\t\tm_files.erase(i++);\n\t\t\telse\n\t\t\t\t++i;\n\t\t}\n\t}\n\n\tvoid file_pool::resize(int size)\n\t{\n\t\tTORRENT_ASSERT(size > 0);\n\t\tif (size == m_size) return;\n\t\tmutex::scoped_lock l(m_mutex);\n\t\tm_size = size;\n\t\tif (int(m_files.size()) <= m_size) return;\n\n\t\t\/\/ close the least recently used files\n\t\twhile (int(m_files.size()) > m_size)\n\t\t\tremove_oldest();\n\t}\n\n}\n<commit_msg>fixed windows unit tests<commit_after>\/*\n\nCopyright (c) 2006, Arvid Norberg\nAll rights reserved.\n\nRedistribution and use in source and binary forms, with or without\nmodification, are permitted provided that the following conditions\nare met:\n\n * Redistributions of source code must retain the above copyright\n notice, this list of conditions and the following disclaimer.\n * Redistributions in binary form must reproduce the above copyright\n notice, this list of conditions and the following disclaimer in\n the documentation and\/or other materials provided with the distribution.\n * Neither the name of the author nor the names of its\n contributors may be used to endorse or promote products derived\n from this software without specific prior written permission.\n\nTHIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS \"AS IS\"\nAND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE\nIMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE\nARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE\nLIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR\nCONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF\nSUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS\nINTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN\nCONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)\nARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE\nPOSSIBILITY OF SUCH DAMAGE.\n\n*\/\n\n#include <boost\/version.hpp>\n#include <boost\/bind.hpp>\n#include \"libtorrent\/pch.hpp\"\n#include \"libtorrent\/assert.hpp\"\n#include \"libtorrent\/file_pool.hpp\"\n#include \"libtorrent\/error_code.hpp\"\n\nnamespace libtorrent\n{\n\tboost::shared_ptr<file> file_pool::open_file(void* st, std::string const& p\n\t\t, int m, error_code& ec)\n\t{\n\t\tTORRENT_ASSERT(st != 0);\n\t\tTORRENT_ASSERT(is_complete(p));\n\t\tTORRENT_ASSERT((m & file::rw_mask) == file::read_only\n\t\t\t|| (m & file::rw_mask) == file::read_write);\n\t\tmutex::scoped_lock l(m_mutex);\n\t\tfile_set::iterator i = m_files.find(p);\n\t\tif (i != m_files.end())\n\t\t{\n\t\t\tlru_file_entry& e = i->second;\n\t\t\te.last_use = time_now();\n\n\t\t\tif (e.key != st && ((e.mode & file::rw_mask) != file::read_only\n\t\t\t\t|| (m & file::rw_mask) != file::read_only))\n\t\t\t{\n\t\t\t\t\/\/ this means that another instance of the storage\n\t\t\t\t\/\/ is using the exact same file.\n#if BOOST_VERSION >= 103500\n\t\t\t\tec = errors::file_collision;\n#endif\n\t\t\t\treturn boost::shared_ptr<file>();\n\t\t\t}\n\n\t\t\te.key = st;\n\t\t\t\/\/ if we asked for a file in write mode,\n\t\t\t\/\/ and the cached file is is not opened in\n\t\t\t\/\/ write mode, re-open it\n\t\t\tif (((e.mode & file::rw_mask) != file::read_write)\n\t\t\t\t&& ((m & file::rw_mask) == file::read_write))\n\t\t\t{\n\t\t\t\t\/\/ close the file before we open it with\n\t\t\t\t\/\/ the new read\/write privilages\n\t\t\t\tTORRENT_ASSERT(e.file_ptr.unique());\n\t\t\t\te.file_ptr->close();\n\t\t\t\tif (!e.file_ptr->open(p, m, ec))\n\t\t\t\t{\n\t\t\t\t\tm_files.erase(i);\n\t\t\t\t\treturn boost::shared_ptr<file>();\n\t\t\t\t}\n#ifdef TORRENT_WINDOWS\n\/\/ file prio is supported on vista and up\n#if _WIN32_WINNT >= 0x0600\n\t\t\t\tif (m_low_prio_io)\n\t\t\t\t{\n\t\t\t\t\tFILE_IO_PRIORITY_HINT_INFO priorityHint;\n\t\t\t\t\tpriorityHint.PriorityHint = IoPriorityHintLow;\n\t\t\t\t\tresult = SetFileInformationByHandle(e.file_ptr->native_handle(),\n\t\t\t\t\t\tFileIoPriorityHintInfo, &priorityHint, sizeof(PriorityHint));\n\t\t\t\t}\n#endif\n#endif\n\t\t\t\tTORRENT_ASSERT(e.file_ptr->is_open());\n\t\t\t\te.mode = m;\n\t\t\t}\n\t\t\tTORRENT_ASSERT((e.mode & file::no_buffer) == (m & file::no_buffer));\n\t\t\treturn e.file_ptr;\n\t\t}\n\t\t\/\/ the file is not in our cache\n\t\tif ((int)m_files.size() >= m_size)\n\t\t{\n\t\t\t\/\/ the file cache is at its maximum size, close\n\t\t\t\/\/ the least recently used (lru) file from it\n\t\t\tremove_oldest();\n\t\t}\n\t\tlru_file_entry e;\n\t\te.file_ptr.reset(new (std::nothrow)file);\n\t\tif (!e.file_ptr)\n\t\t{\n\t\t\tec = error_code(ENOMEM, get_posix_category());\n\t\t\treturn e.file_ptr;\n\t\t}\n\t\tif (!e.file_ptr->open(p, m, ec))\n\t\t\treturn boost::shared_ptr<file>();\n\t\te.mode = m;\n\t\te.key = st;\n\t\tm_files.insert(std::make_pair(p, e));\n\t\tTORRENT_ASSERT(e.file_ptr->is_open());\n\t\treturn e.file_ptr;\n\t}\n\n\tvoid file_pool::remove_oldest()\n\t{\n\t\tfile_set::iterator i = std::min_element(m_files.begin(), m_files.end()\n\t\t\t, boost::bind(&lru_file_entry::last_use, boost::bind(&file_set::value_type::second, _1))\n\t\t\t\t< boost::bind(&lru_file_entry::last_use, boost::bind(&file_set::value_type::second, _2)));\n\t\tif (i == m_files.end()) return;\n\t\tm_files.erase(i);\n\t}\n\n\tvoid file_pool::release(std::string const& p)\n\t{\n\t\tmutex::scoped_lock l(m_mutex);\n\n\t\tfile_set::iterator i = m_files.find(p);\n\t\tif (i != m_files.end()) m_files.erase(i);\n\t}\n\n\t\/\/ closes files belonging to the specified\n\t\/\/ storage. If 0 is passed, all files are closed\n\tvoid file_pool::release(void* st)\n\t{\n\t\tmutex::scoped_lock l(m_mutex);\n\t\tif (st == 0)\n\t\t{\n\t\t\tm_files.clear();\n\t\t\treturn;\n\t\t}\n\n\t\tfor (file_set::iterator i = m_files.begin();\n\t\t\ti != m_files.end();)\n\t\t{\n\t\t\tif (i->second.key == st)\n\t\t\t\tm_files.erase(i++);\n\t\t\telse\n\t\t\t\t++i;\n\t\t}\n\t}\n\n\tvoid file_pool::resize(int size)\n\t{\n\t\tTORRENT_ASSERT(size > 0);\n\t\tif (size == m_size) return;\n\t\tmutex::scoped_lock l(m_mutex);\n\t\tm_size = size;\n\t\tif (int(m_files.size()) <= m_size) return;\n\n\t\t\/\/ close the least recently used files\n\t\twhile (int(m_files.size()) > m_size)\n\t\t\tremove_oldest();\n\t}\n\n}\n<|endoftext|>"} {"text":"<commit_before>#include \"drake\/systems\/plants\/BotVisualizer.h\"\n#include \"drake\/systems\/plants\/RigidBodySystem.h\"\n#include \"drake\/systems\/LCMSystem.h\"\n#include \"drake\/systems\/LinearSystem.h\"\n\n#include \"QuadrotorControl.h\"\n#include \"QuadrotorState.h\"\n\nusing namespace std;\nusing namespace Drake;\nusing namespace Eigen;\n\nint main(int argc, char* argv[]) {\n shared_ptr<lcm::LCM> lcm = make_shared<lcm::LCM>();\n if(!lcm->good())\n return 1;\n\n DrakeJoint::FloatingBaseType floating_base_type = DrakeJoint::QUATERNION;\n auto rigid_body_sys = make_shared<RigidBodySystem>(getDrakePath()+\"\/examples\/Quadrotor\/quadrotor.urdf\",floating_base_type);\n auto const & tree = rigid_body_sys->getRigidBodyTree();\n\n double box_width = 1000;\n double box_depth = 10;\n DrakeShapes::Box geom(Vector3d(box_width, box_width, box_depth));\n Isometry3d T_element_to_link = Isometry3d::Identity();\n T_element_to_link.translation() << 0,0,-box_depth\/2; \/\/ top of the box is at z=0\n auto & world = tree->bodies[0];\n Vector4d color; color << 0.9297, 0.7930, 0.6758, 1; \/\/ was hex2dec({'ee','cb','ad'})'\/256 in matlab\n world->addVisualElement(DrakeShapes::VisualElement(geom,T_element_to_link,color));\n tree->addCollisionElement(RigidBody::CollisionElement(geom,T_element_to_link,world),world,\"terrain\");\n tree->updateStaticCollisionElements();\n \n auto visualizer = make_shared<BotVisualizer<RigidBodySystem::StateVector>>(lcm,tree);\n \n auto quad_control_to_rbsys_input = make_shared<Gain<QuadrotorControl, RigidBodySystem::InputVector>>(Eigen::Matrix4d::Identity());\n auto rbsys_output_to_quad_state = make_shared<Gain<RigidBodySystem::StateVector, QuadrotorState>>(Eigen::Matrix<double, 13, 13>::Identity());\n \n auto sys_with_lcm_input = cascade(quad_control_to_rbsys_input, rigid_body_sys);\n \n auto sys_with_vis = cascade(sys_with_lcm_input, visualizer);\n\n SimulationOptions options = default_simulation_options;\n options.realtime_factor = 1.0;\n options.initial_step_size = 0.0025;\n\n VectorXd x0 = VectorXd::Zero(rigid_body_sys->getNumStates());\n x0.head(tree->num_positions) = tree->getZeroConfiguration();\n \n auto lcmio_with_vis = cascade(sys_with_vis, rbsys_output_to_quad_state);\n\n x0(2) = 1;\n\n runLCM(lcmio_with_vis, lcm,0,std::numeric_limits<double>::infinity(),x0,options);\n \n}\n<commit_msg>quadrotor sim now takes simulation time as an argument<commit_after>#include \"drake\/systems\/plants\/BotVisualizer.h\"\n#include \"drake\/systems\/plants\/RigidBodySystem.h\"\n#include \"drake\/systems\/LCMSystem.h\"\n#include \"drake\/systems\/LinearSystem.h\"\n\n#include \"QuadrotorControl.h\"\n#include \"QuadrotorState.h\"\n\nusing namespace std;\nusing namespace Drake;\nusing namespace Eigen;\n\nint main(int argc, char* argv[]) {\n \n double final_time = argc >= 2 ? atof(argv[1]) : std::numeric_limits<double>::infinity();\n cout << \"Running simulation for \" << final_time << \" seconds.\" << endl;\n shared_ptr<lcm::LCM> lcm = make_shared<lcm::LCM>();\n if(!lcm->good())\n return 1;\n\n DrakeJoint::FloatingBaseType floating_base_type = DrakeJoint::QUATERNION;\n auto rigid_body_sys = make_shared<RigidBodySystem>(getDrakePath()+\"\/examples\/Quadrotor\/quadrotor.urdf\",floating_base_type);\n auto const & tree = rigid_body_sys->getRigidBodyTree();\n\n double box_width = 1000;\n double box_depth = 10;\n DrakeShapes::Box geom(Vector3d(box_width, box_width, box_depth));\n Isometry3d T_element_to_link = Isometry3d::Identity();\n T_element_to_link.translation() << 0,0,-box_depth\/2; \/\/ top of the box is at z=0\n auto & world = tree->bodies[0];\n Vector4d color; color << 0.9297, 0.7930, 0.6758, 1; \/\/ was hex2dec({'ee','cb','ad'})'\/256 in matlab\n world->addVisualElement(DrakeShapes::VisualElement(geom,T_element_to_link,color));\n tree->addCollisionElement(RigidBody::CollisionElement(geom,T_element_to_link,world),world,\"terrain\");\n tree->updateStaticCollisionElements();\n \n auto visualizer = make_shared<BotVisualizer<RigidBodySystem::StateVector>>(lcm,tree);\n \n auto quad_control_to_rbsys_input = make_shared<Gain<QuadrotorControl, RigidBodySystem::InputVector>>(Eigen::Matrix4d::Identity());\n auto rbsys_output_to_quad_state = make_shared<Gain<RigidBodySystem::StateVector, QuadrotorState>>(Eigen::Matrix<double, 13, 13>::Identity());\n \n auto sys_with_lcm_input = cascade(quad_control_to_rbsys_input, rigid_body_sys);\n \n auto sys_with_vis = cascade(sys_with_lcm_input, visualizer);\n\n SimulationOptions options = default_simulation_options;\n options.realtime_factor = 1.0;\n options.initial_step_size = 0.0025;\n\n VectorXd x0 = VectorXd::Zero(rigid_body_sys->getNumStates());\n x0.head(tree->num_positions) = tree->getZeroConfiguration();\n \n auto lcmio_with_vis = cascade(sys_with_vis, rbsys_output_to_quad_state);\n\n x0(2) = 1;\n\n runLCM(lcmio_with_vis, lcm, 0, final_time, x0, options);\n \n}\n<|endoftext|>"} {"text":"<commit_before>\/*************************************************************************\n *\n * $RCSfile: lotform.hxx,v $\n *\n * $Revision: 1.3 $\n *\n * last change: $Author: rt $ $Date: 2004-11-26 13:48: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\n\n#ifndef _LOTFORM_HXX\n#define _LOTFORM_HXX\n\n#ifndef _FORMEL_HXX\n#include \"formel.hxx\"\n#endif\n#ifndef _STRING_HXX\n#include <tools\/string.hxx>\n#endif\n\n\n\n\nenum FUNC_TYPE\n{\n FT_Return = 0, \/\/ End Formula\n FT_FuncFix0, \/\/ Funktion, 0 Parameter\n FT_FuncFix1, \/\/ Funktion, 0 Parameter\n FT_FuncFix2, \/\/ Funktion, 0 Parameter\n FT_FuncFix3, \/\/ Funktion, 0 Parameter\n FT_FuncFix4, \/\/ Funktion, 0 Parameter\n FT_FuncVar, \/\/ ~, var. P.\n FT_Neg, \/\/ Negierung\n FT_Op, \/\/ Operator\n FT_NotImpl, \/\/ nicht implementiert\n FT_ConstFloat, \/\/ Double (8-Byte)\n FT_Variable, \/\/ Single Ref\n FT_Range, \/\/ Double Ref\n FT_Braces, \/\/ Klammmern\n FT_ConstInt, \/\/ Integer\n FT_ConstString, \/\/ String\n FT_NOP, \/\/ nichts\n \/\/ zusaetzlich ab WK3\n FT_Cref, \/\/ Cell Reference\n FT_Rref, \/\/ Range Reference\n FT_Nrref, \/\/ Named range reference\n FT_Absnref, \/\/ Absolut named range\n FT_Erref, \/\/ Err range reference\n FT_Ecref, \/\/ Err cell reference\n FT_Econstant, \/\/ Err constant\n FT_Splfunc, \/\/ SPLfunction\n FT_Const10Float,\/\/ Float (10-Byte)\n FT_Snum \/\/ Const Short Num\n \/\/ fuer 'Problemfaelle' beim Import\n};\n\n\n\n\nclass LotusToSc : public LotusConverterBase\n{\nprivate:\n CharSet eSrcChar;\n TokenId nAddToken; \/\/ ')+1.0'\n TokenId nSubToken; \/\/ ~\n TokenId n0Token; \/\/ '0.0';\n \/\/ ---------------------------------------------------------------\n static FUNC_TYPE IndexToType( BYTE );\n static DefTokenId IndexToToken( BYTE );\n static FUNC_TYPE IndexToTypeWK123( BYTE );\n static DefTokenId IndexToTokenWK123( BYTE );\n void DoFunc( DefTokenId eOc, BYTE nAnz, const sal_Char* pExtName );\n void LotusRelToScRel( UINT16 nCol, UINT16 nRow,\n SingleRefData& rSRD );\n BOOL bWK3; \/\/ alternative Codeumsetzung statt fuer < WK1\n BOOL bWK123; \/\/ alternative for 123\n \/\/ -------------------------------------------------------------------\n void ReadSRD( SingleRefData& rSRD, BYTE nFlags );\n inline void ReadCRD( ComplRefData& rCRD, BYTE nFlags );\n void IncToken( TokenId &rParam );\n \/\/ ACHTUNG: hier wird die aktuelle Token-Kette im Pool\n \/\/ mit '(<rParam>)+1' fortgeschrieben und mit\n \/\/ Store() abgeschlossen!\n void DecToken( TokenId& rParam );\n \/\/ ACHTUNG: ~\n void NegToken( TokenId& rParam );\n \/\/ ACHTUNG: wie ~, nur wird '-(<rParam>)' gebildet\npublic:\n LotusToSc( SvStream& aStr, CharSet eSrc, BOOL b );\n virtual ConvErr Convert( const ScTokenArray*& rpErg, INT32& nRest,\n const FORMULA_TYPE eFT = FT_CellFormula );\n\n void Reset( ScAddress aEingPos );\n inline void SetWK3( void );\n};\n\n\ninline void LotusToSc::ReadCRD( ComplRefData& rCRD, BYTE nRelBit )\n{\n \/\/ erster Teil\n ReadSRD( rCRD.Ref1, nRelBit );\n\n \/\/ zweiter Teil\n ReadSRD( rCRD.Ref2, nRelBit >> 3 );\n}\n\n\ninline void LotusToSc::SetWK3( void )\n{\n bWK3 = TRUE;\n}\n\n\n\n#endif\n\n<commit_msg>INTEGRATION: CWS ooo19126 (1.3.236); FILE MERGED 2005\/09\/05 15:02:44 rt 1.3.236.1: #i54170# Change license header: remove SISSL<commit_after>\/*************************************************************************\n *\n * OpenOffice.org - a multi-platform office productivity suite\n *\n * $RCSfile: lotform.hxx,v $\n *\n * $Revision: 1.4 $\n *\n * last change: $Author: rt $ $Date: 2005-09-08 19:21: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\n#ifndef _LOTFORM_HXX\n#define _LOTFORM_HXX\n\n#ifndef _FORMEL_HXX\n#include \"formel.hxx\"\n#endif\n#ifndef _STRING_HXX\n#include <tools\/string.hxx>\n#endif\n\n\n\n\nenum FUNC_TYPE\n{\n FT_Return = 0, \/\/ End Formula\n FT_FuncFix0, \/\/ Funktion, 0 Parameter\n FT_FuncFix1, \/\/ Funktion, 0 Parameter\n FT_FuncFix2, \/\/ Funktion, 0 Parameter\n FT_FuncFix3, \/\/ Funktion, 0 Parameter\n FT_FuncFix4, \/\/ Funktion, 0 Parameter\n FT_FuncVar, \/\/ ~, var. P.\n FT_Neg, \/\/ Negierung\n FT_Op, \/\/ Operator\n FT_NotImpl, \/\/ nicht implementiert\n FT_ConstFloat, \/\/ Double (8-Byte)\n FT_Variable, \/\/ Single Ref\n FT_Range, \/\/ Double Ref\n FT_Braces, \/\/ Klammmern\n FT_ConstInt, \/\/ Integer\n FT_ConstString, \/\/ String\n FT_NOP, \/\/ nichts\n \/\/ zusaetzlich ab WK3\n FT_Cref, \/\/ Cell Reference\n FT_Rref, \/\/ Range Reference\n FT_Nrref, \/\/ Named range reference\n FT_Absnref, \/\/ Absolut named range\n FT_Erref, \/\/ Err range reference\n FT_Ecref, \/\/ Err cell reference\n FT_Econstant, \/\/ Err constant\n FT_Splfunc, \/\/ SPLfunction\n FT_Const10Float,\/\/ Float (10-Byte)\n FT_Snum \/\/ Const Short Num\n \/\/ fuer 'Problemfaelle' beim Import\n};\n\n\n\n\nclass LotusToSc : public LotusConverterBase\n{\nprivate:\n CharSet eSrcChar;\n TokenId nAddToken; \/\/ ')+1.0'\n TokenId nSubToken; \/\/ ~\n TokenId n0Token; \/\/ '0.0';\n \/\/ ---------------------------------------------------------------\n static FUNC_TYPE IndexToType( BYTE );\n static DefTokenId IndexToToken( BYTE );\n static FUNC_TYPE IndexToTypeWK123( BYTE );\n static DefTokenId IndexToTokenWK123( BYTE );\n void DoFunc( DefTokenId eOc, BYTE nAnz, const sal_Char* pExtName );\n void LotusRelToScRel( UINT16 nCol, UINT16 nRow,\n SingleRefData& rSRD );\n BOOL bWK3; \/\/ alternative Codeumsetzung statt fuer < WK1\n BOOL bWK123; \/\/ alternative for 123\n \/\/ -------------------------------------------------------------------\n void ReadSRD( SingleRefData& rSRD, BYTE nFlags );\n inline void ReadCRD( ComplRefData& rCRD, BYTE nFlags );\n void IncToken( TokenId &rParam );\n \/\/ ACHTUNG: hier wird die aktuelle Token-Kette im Pool\n \/\/ mit '(<rParam>)+1' fortgeschrieben und mit\n \/\/ Store() abgeschlossen!\n void DecToken( TokenId& rParam );\n \/\/ ACHTUNG: ~\n void NegToken( TokenId& rParam );\n \/\/ ACHTUNG: wie ~, nur wird '-(<rParam>)' gebildet\npublic:\n LotusToSc( SvStream& aStr, CharSet eSrc, BOOL b );\n virtual ConvErr Convert( const ScTokenArray*& rpErg, INT32& nRest,\n const FORMULA_TYPE eFT = FT_CellFormula );\n\n void Reset( ScAddress aEingPos );\n inline void SetWK3( void );\n};\n\n\ninline void LotusToSc::ReadCRD( ComplRefData& rCRD, BYTE nRelBit )\n{\n \/\/ erster Teil\n ReadSRD( rCRD.Ref1, nRelBit );\n\n \/\/ zweiter Teil\n ReadSRD( rCRD.Ref2, nRelBit >> 3 );\n}\n\n\ninline void LotusToSc::SetWK3( void )\n{\n bWK3 = TRUE;\n}\n\n\n\n#endif\n\n<|endoftext|>"} {"text":"<commit_before>\/*************************************************************************\n *\n * $RCSfile: xmltabi.cxx,v $\n *\n * $Revision: 1.33 $\n *\n * last change: $Author: vg $ $Date: 2005-02-21 16:00: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#ifdef PCH\n#include \"filt_pch.hxx\"\n#endif\n\n#pragma hdrstop\n\n\/\/ INCLUDE ---------------------------------------------------------------\n\n#include \"xmltabi.hxx\"\n#include \"xmlimprt.hxx\"\n#include \"xmlrowi.hxx\"\n#include \"xmlcoli.hxx\"\n#include \"xmlsceni.hxx\"\n#include \"document.hxx\"\n#include \"docuno.hxx\"\n#include \"olinetab.hxx\"\n\n#ifndef _SC_XMLCONVERTER_HXX\n#include \"XMLConverter.hxx\"\n#endif\n#ifndef _SC_XMLTABLESHAPESCONTEXT_HXX\n#include \"XMLTableShapesContext.hxx\"\n#endif\n#ifndef _SC_XMLTABLESOURCECONTEXT_HXX\n#include \"XMLTableSourceContext.hxx\"\n#endif\n#ifndef _SC_XMLSTYLESIMPORTHELPER_HXX\n#include \"XMLStylesImportHelper.hxx\"\n#endif\n\n#include <xmloff\/xmltkmap.hxx>\n#include <xmloff\/nmspmap.hxx>\n#ifndef _XMLOFF_FORMSIMP_HXX\n#include <xmloff\/formsimp.hxx>\n#endif\n#ifndef _XMLOFF_XMLTOKEN_HXX\n#include <xmloff\/xmltoken.hxx>\n#endif\n\n#include <com\/sun\/star\/sheet\/XSpreadsheetDocument.hpp>\n#include <com\/sun\/star\/sheet\/XSpreadsheets.hpp>\n#include <com\/sun\/star\/sheet\/XSpreadsheet.hpp>\n#include <com\/sun\/star\/sheet\/XPrintAreas.hpp>\n#include <com\/sun\/star\/table\/CellAddress.hpp>\n\nusing namespace com::sun::star;\nusing namespace xmloff::token;\n\n\/\/------------------------------------------------------------------\n\nScXMLTableContext::ScXMLTableContext( ScXMLImport& rImport,\n USHORT nPrfx,\n const ::rtl::OUString& rLName,\n const ::com::sun::star::uno::Reference<\n ::com::sun::star::xml::sax::XAttributeList>& xAttrList,\n const sal_Bool bTempIsSubTable,\n const sal_Int32 nSpannedCols) :\n SvXMLImportContext( rImport, nPrfx, rLName ),\n bStartFormPage(sal_False),\n bPrintEntireSheet(sal_True)\n{\n if (!bTempIsSubTable)\n {\n sal_Bool bProtection(sal_False);\n rtl::OUString sName;\n rtl::OUString sStyleName;\n rtl::OUString sPassword;\n sal_Int16 nAttrCount = xAttrList.is() ? xAttrList->getLength() : 0;\n const SvXMLTokenMap& rAttrTokenMap = GetScImport().GetTableAttrTokenMap();\n for( sal_Int16 i=0; i < nAttrCount; i++ )\n {\n rtl::OUString sAttrName = xAttrList->getNameByIndex( i );\n rtl::OUString aLocalName;\n USHORT nPrefix = GetScImport().GetNamespaceMap().GetKeyByAttrName(\n sAttrName, &aLocalName );\n rtl::OUString sValue = xAttrList->getValueByIndex( i );\n\n switch( rAttrTokenMap.Get( nPrefix, aLocalName ) )\n {\n case XML_TOK_TABLE_NAME:\n sName = sValue;\n break;\n case XML_TOK_TABLE_STYLE_NAME:\n sStyleName = sValue;\n break;\n case XML_TOK_TABLE_PROTECTION:\n bProtection = IsXMLToken(sValue, XML_TRUE);\n break;\n case XML_TOK_TABLE_PRINT_RANGES:\n sPrintRanges = sValue;\n break;\n case XML_TOK_TABLE_PASSWORD:\n sPassword = sValue;\n break;\n case XML_TOK_TABLE_PRINT:\n {\n if (IsXMLToken(sValue, XML_FALSE))\n bPrintEntireSheet = sal_False;\n }\n break;\n }\n }\n GetScImport().GetTables().NewSheet(sName, sStyleName, bProtection, sPassword);\n }\n else\n {\n GetScImport().GetTables().NewTable(nSpannedCols);\n }\n}\n\nScXMLTableContext::~ScXMLTableContext()\n{\n}\n\nSvXMLImportContext *ScXMLTableContext::CreateChildContext( USHORT nPrefix,\n const ::rtl::OUString& rLName,\n const ::com::sun::star::uno::Reference<\n ::com::sun::star::xml::sax::XAttributeList>& xAttrList )\n{\n SvXMLImportContext *pContext = 0;\n\n const SvXMLTokenMap& rTokenMap = GetScImport().GetTableElemTokenMap();\n switch( rTokenMap.Get( nPrefix, rLName ) )\n {\n case XML_TOK_TABLE_COL_GROUP:\n pContext = new ScXMLTableColsContext( GetScImport(), nPrefix,\n rLName, xAttrList,\n sal_False, sal_True );\n break;\n case XML_TOK_TABLE_HEADER_COLS:\n pContext = new ScXMLTableColsContext( GetScImport(), nPrefix,\n rLName, xAttrList,\n sal_True, sal_False );\n break;\n case XML_TOK_TABLE_COLS:\n pContext = new ScXMLTableColsContext( GetScImport(), nPrefix,\n rLName, xAttrList,\n sal_False, sal_False );\n break;\n case XML_TOK_TABLE_COL:\n pContext = new ScXMLTableColContext( GetScImport(), nPrefix,\n rLName, xAttrList );\n break;\n case XML_TOK_TABLE_ROW_GROUP:\n pContext = new ScXMLTableRowsContext( GetScImport(), nPrefix,\n rLName, xAttrList,\n sal_False, sal_True );\n break;\n case XML_TOK_TABLE_HEADER_ROWS:\n pContext = new ScXMLTableRowsContext( GetScImport(), nPrefix,\n rLName, xAttrList,\n sal_True, sal_False );\n break;\n case XML_TOK_TABLE_ROWS:\n pContext = new ScXMLTableRowsContext( GetScImport(), nPrefix,\n rLName, xAttrList,\n sal_False, sal_False );\n break;\n case XML_TOK_TABLE_ROW:\n pContext = new ScXMLTableRowContext( GetScImport(), nPrefix,\n rLName, xAttrList\/\/,\n \/\/this\n );\n break;\n case XML_TOK_TABLE_SOURCE:\n pContext = new ScXMLTableSourceContext( GetScImport(), nPrefix, rLName, xAttrList);\n break;\n case XML_TOK_TABLE_SCENARIO:\n pContext = new ScXMLTableScenarioContext( GetScImport(), nPrefix, rLName, xAttrList);\n break;\n case XML_TOK_TABLE_SHAPES:\n pContext = new ScXMLTableShapesContext( GetScImport(), nPrefix, rLName, xAttrList);\n break;\n case XML_TOK_TABLE_FORMS:\n {\n GetScImport().GetFormImport()->startPage(GetScImport().GetTables().GetCurrentXDrawPage());\n bStartFormPage = sal_True;\n pContext = GetScImport().GetFormImport()->createOfficeFormsContext( GetScImport(), nPrefix, rLName );\n }\n break;\n }\n\n if( !pContext )\n pContext = new SvXMLImportContext( GetImport(), nPrefix, rLName );\n\n return pContext;\n}\n\nvoid ScXMLTableContext::EndElement()\n{\n GetScImport().LockSolarMutex();\n GetScImport().GetStylesImportHelper()->EndTable();\n ScDocument* pDoc = GetScImport().GetDocument();\n if (pDoc)\n {\n if (sPrintRanges.getLength())\n {\n uno::Reference< sheet::XSpreadsheet > xTable = GetScImport().GetTables().GetCurrentXSheet();\n if( xTable.is() )\n {\n uno::Reference< sheet::XPrintAreas > xPrintAreas( xTable, uno::UNO_QUERY );\n if( xPrintAreas.is() )\n {\n uno::Sequence< table::CellRangeAddress > aRangeList;\n ScXMLConverter::GetRangeListFromString( aRangeList, sPrintRanges, pDoc );\n xPrintAreas->setPrintAreas( aRangeList );\n }\n }\n }\n else if (bPrintEntireSheet) pDoc->SetPrintEntireSheet(static_cast<SCTAB>(GetScImport().GetTables().GetCurrentSheet()));\n\n ScOutlineTable* pOutlineTable = pDoc->GetOutlineTable(static_cast<SCTAB>(GetScImport().GetTables().GetCurrentSheet()), sal_False);\n if (pOutlineTable)\n {\n ScOutlineArray* pColArray = pOutlineTable->GetColArray();\n sal_Int32 nDepth = pColArray->GetDepth();\n sal_Int32 i;\n\n for ( i = 0; i < nDepth; i++)\n {\n sal_Int32 nCount = pColArray->GetCount(static_cast<USHORT>(i));\n sal_Bool bChanged(sal_False);\n for (sal_Int32 j = 0; j < nCount && !bChanged; j++)\n {\n ScOutlineEntry* pEntry = pColArray->GetEntry(static_cast<USHORT>(i), static_cast<USHORT>(j));\n if (pEntry->IsHidden())\n {\n pColArray->SetVisibleBelow(static_cast<USHORT>(i), static_cast<USHORT>(j), sal_False);\n bChanged = sal_True;\n }\n }\n }\n ScOutlineArray* pRowArray = pOutlineTable->GetRowArray();\n nDepth = pRowArray->GetDepth();\n for (i = 0; i < nDepth; i++)\n {\n sal_Int32 nCount = pRowArray->GetCount(static_cast<USHORT>(i));\n sal_Bool bChanged(sal_False);\n for (sal_Int32 j = 0; j < nCount && !bChanged; j++)\n {\n ScOutlineEntry* pEntry = pRowArray->GetEntry(static_cast<USHORT>(i), static_cast<USHORT>(j));\n if (pEntry->IsHidden())\n {\n pRowArray->SetVisibleBelow(static_cast<USHORT>(i), static_cast<USHORT>(j), sal_False);\n bChanged = sal_True;\n }\n }\n }\n }\n if (GetScImport().GetTables().HasDrawPage())\n {\n if (GetScImport().GetTables().HasXShapes())\n {\n GetScImport().GetShapeImport()->popGroupAndSort();\n uno::Reference<drawing::XShapes> xXShapes(GetScImport().GetTables().GetCurrentXShapes());\n GetScImport().GetShapeImport()->endPage(xXShapes);\n }\n if (bStartFormPage)\n GetScImport().GetFormImport()->endPage();\n }\n\n GetScImport().GetTables().DeleteTable();\n GetScImport().GetProgressBarHelper()->Increment();\n }\n GetScImport().UnlockSolarMutex();\n}\n\n<commit_msg>INTEGRATION: CWS calcuno01 (1.30.10); FILE MERGED 2005\/03\/04 16:24:51 sab 1.30.10.6: RESYNC: (1.32-1.33); FILE MERGED 2005\/01\/06 12:36:17 sab 1.30.10.5: RESYNC: (1.31-1.32); FILE MERGED 2004\/10\/13 12:46:34 sab 1.30.10.4: RESYNC: (1.30-1.31); FILE MERGED 2004\/03\/26 09:32:13 dr 1.30.10.3: #100000# for scope 2004\/01\/07 14:05:35 sab 1.30.10.2: #i22706#; fix linux compiler problems 2004\/01\/05 11:57:30 sab 1.30.10.1: #i22706#; improve API using<commit_after>\/*************************************************************************\n *\n * $RCSfile: xmltabi.cxx,v $\n *\n * $Revision: 1.34 $\n *\n * last change: $Author: vg $ $Date: 2005-03-23 13:03:55 $\n *\n * The Contents of this file are made available subject to the terms of\n * either of the following licenses\n *\n * - GNU Lesser General Public License Version 2.1\n * - Sun Industry Standards Source License Version 1.1\n *\n * Sun Microsystems Inc., October, 2000\n *\n * GNU Lesser General Public License Version 2.1\n * =============================================\n * Copyright 2000 by Sun Microsystems, Inc.\n * 901 San Antonio Road, Palo Alto, CA 94303, USA\n *\n * This library is free software; you can redistribute it and\/or\n * modify it under the terms of the GNU Lesser General Public\n * License version 2.1, as published by the Free Software Foundation.\n *\n * This library is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU\n * Lesser General Public License for more details.\n *\n * You should have received a copy of the GNU Lesser General Public\n * License along with this library; if not, write to the Free Software\n * Foundation, Inc., 59 Temple Place, Suite 330, Boston,\n * MA 02111-1307 USA\n *\n *\n * Sun Industry Standards Source License Version 1.1\n * =================================================\n * The contents of this file are subject to the Sun Industry Standards\n * Source License Version 1.1 (the \"License\"); You may not use this file\n * except in compliance with the License. You may obtain a copy of the\n * License at http:\/\/www.openoffice.org\/license.html.\n *\n * Software provided under this License is provided on an \"AS IS\" basis,\n * WITHOUT WARRANTY OF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING,\n * WITHOUT LIMITATION, WARRANTIES THAT THE SOFTWARE IS FREE OF DEFECTS,\n * MERCHANTABLE, FIT FOR A PARTICULAR PURPOSE, OR NON-INFRINGING.\n * See the License for the specific provisions governing your rights and\n * obligations concerning the Software.\n *\n * The Initial Developer of the Original Code is: Sun Microsystems, Inc.\n *\n * Copyright: 2000 by Sun Microsystems, Inc.\n *\n * All Rights Reserved.\n *\n * Contributor(s): _______________________________________\n *\n *\n ************************************************************************\/\n\n#ifdef PCH\n#include \"filt_pch.hxx\"\n#endif\n\n#pragma hdrstop\n\n\/\/ INCLUDE ---------------------------------------------------------------\n\n#include \"xmltabi.hxx\"\n#include \"xmlimprt.hxx\"\n#include \"xmlrowi.hxx\"\n#include \"xmlcoli.hxx\"\n#include \"xmlsceni.hxx\"\n#include \"document.hxx\"\n#include \"docuno.hxx\"\n#include \"olinetab.hxx\"\n\n#ifndef _SC_XMLCONVERTER_HXX\n#include \"XMLConverter.hxx\"\n#endif\n#ifndef _SC_XMLTABLESHAPESCONTEXT_HXX\n#include \"XMLTableShapesContext.hxx\"\n#endif\n#ifndef _SC_XMLTABLESOURCECONTEXT_HXX\n#include \"XMLTableSourceContext.hxx\"\n#endif\n#ifndef _SC_XMLSTYLESIMPORTHELPER_HXX\n#include \"XMLStylesImportHelper.hxx\"\n#endif\n\n#include <xmloff\/xmltkmap.hxx>\n#include <xmloff\/nmspmap.hxx>\n#ifndef _XMLOFF_FORMSIMP_HXX\n#include <xmloff\/formsimp.hxx>\n#endif\n#ifndef _XMLOFF_XMLTOKEN_HXX\n#include <xmloff\/xmltoken.hxx>\n#endif\n\n#include <com\/sun\/star\/sheet\/XSpreadsheetDocument.hpp>\n#include <com\/sun\/star\/sheet\/XSpreadsheets.hpp>\n#include <com\/sun\/star\/sheet\/XSpreadsheet.hpp>\n#include <com\/sun\/star\/sheet\/XPrintAreas.hpp>\n#include <com\/sun\/star\/table\/CellAddress.hpp>\n\nusing namespace com::sun::star;\nusing namespace xmloff::token;\n\n\/\/------------------------------------------------------------------\n\nScXMLTableContext::ScXMLTableContext( ScXMLImport& rImport,\n USHORT nPrfx,\n const ::rtl::OUString& rLName,\n const ::com::sun::star::uno::Reference<\n ::com::sun::star::xml::sax::XAttributeList>& xAttrList,\n const sal_Bool bTempIsSubTable,\n const sal_Int32 nSpannedCols) :\n SvXMLImportContext( rImport, nPrfx, rLName ),\n bStartFormPage(sal_False),\n bPrintEntireSheet(sal_True)\n{\n if (!bTempIsSubTable)\n {\n sal_Bool bProtection(sal_False);\n rtl::OUString sName;\n rtl::OUString sStyleName;\n rtl::OUString sPassword;\n sal_Int16 nAttrCount(xAttrList.is() ? xAttrList->getLength() : 0);\n const SvXMLTokenMap& rAttrTokenMap = GetScImport().GetTableAttrTokenMap();\n for( sal_Int16 i=0; i < nAttrCount; ++i )\n {\n const rtl::OUString& sAttrName(xAttrList->getNameByIndex( i ));\n rtl::OUString aLocalName;\n USHORT nPrefix(GetScImport().GetNamespaceMap().GetKeyByAttrName(\n sAttrName, &aLocalName ));\n const rtl::OUString& sValue(xAttrList->getValueByIndex( i ));\n\n switch( rAttrTokenMap.Get( nPrefix, aLocalName ) )\n {\n case XML_TOK_TABLE_NAME:\n sName = sValue;\n break;\n case XML_TOK_TABLE_STYLE_NAME:\n sStyleName = sValue;\n break;\n case XML_TOK_TABLE_PROTECTION:\n bProtection = IsXMLToken(sValue, XML_TRUE);\n break;\n case XML_TOK_TABLE_PRINT_RANGES:\n sPrintRanges = sValue;\n break;\n case XML_TOK_TABLE_PASSWORD:\n sPassword = sValue;\n break;\n case XML_TOK_TABLE_PRINT:\n {\n if (IsXMLToken(sValue, XML_FALSE))\n bPrintEntireSheet = sal_False;\n }\n break;\n }\n }\n GetScImport().GetTables().NewSheet(sName, sStyleName, bProtection, sPassword);\n }\n else\n {\n GetScImport().GetTables().NewTable(nSpannedCols);\n }\n}\n\nScXMLTableContext::~ScXMLTableContext()\n{\n}\n\nSvXMLImportContext *ScXMLTableContext::CreateChildContext( USHORT nPrefix,\n const ::rtl::OUString& rLName,\n const ::com::sun::star::uno::Reference<\n ::com::sun::star::xml::sax::XAttributeList>& xAttrList )\n{\n SvXMLImportContext *pContext(0);\n\n const SvXMLTokenMap& rTokenMap(GetScImport().GetTableElemTokenMap());\n switch( rTokenMap.Get( nPrefix, rLName ) )\n {\n case XML_TOK_TABLE_COL_GROUP:\n pContext = new ScXMLTableColsContext( GetScImport(), nPrefix,\n rLName, xAttrList,\n sal_False, sal_True );\n break;\n case XML_TOK_TABLE_HEADER_COLS:\n pContext = new ScXMLTableColsContext( GetScImport(), nPrefix,\n rLName, xAttrList,\n sal_True, sal_False );\n break;\n case XML_TOK_TABLE_COLS:\n pContext = new ScXMLTableColsContext( GetScImport(), nPrefix,\n rLName, xAttrList,\n sal_False, sal_False );\n break;\n case XML_TOK_TABLE_COL:\n pContext = new ScXMLTableColContext( GetScImport(), nPrefix,\n rLName, xAttrList );\n break;\n case XML_TOK_TABLE_ROW_GROUP:\n pContext = new ScXMLTableRowsContext( GetScImport(), nPrefix,\n rLName, xAttrList,\n sal_False, sal_True );\n break;\n case XML_TOK_TABLE_HEADER_ROWS:\n pContext = new ScXMLTableRowsContext( GetScImport(), nPrefix,\n rLName, xAttrList,\n sal_True, sal_False );\n break;\n case XML_TOK_TABLE_ROWS:\n pContext = new ScXMLTableRowsContext( GetScImport(), nPrefix,\n rLName, xAttrList,\n sal_False, sal_False );\n break;\n case XML_TOK_TABLE_ROW:\n pContext = new ScXMLTableRowContext( GetScImport(), nPrefix,\n rLName, xAttrList\/\/,\n \/\/this\n );\n break;\n case XML_TOK_TABLE_SOURCE:\n pContext = new ScXMLTableSourceContext( GetScImport(), nPrefix, rLName, xAttrList);\n break;\n case XML_TOK_TABLE_SCENARIO:\n pContext = new ScXMLTableScenarioContext( GetScImport(), nPrefix, rLName, xAttrList);\n break;\n case XML_TOK_TABLE_SHAPES:\n pContext = new ScXMLTableShapesContext( GetScImport(), nPrefix, rLName, xAttrList);\n break;\n case XML_TOK_TABLE_FORMS:\n {\n GetScImport().GetFormImport()->startPage(GetScImport().GetTables().GetCurrentXDrawPage());\n bStartFormPage = sal_True;\n pContext = GetScImport().GetFormImport()->createOfficeFormsContext( GetScImport(), nPrefix, rLName );\n }\n break;\n }\n\n if( !pContext )\n pContext = new SvXMLImportContext( GetImport(), nPrefix, rLName );\n\n return pContext;\n}\n\nvoid ScXMLTableContext::EndElement()\n{\n GetScImport().LockSolarMutex();\n GetScImport().GetStylesImportHelper()->EndTable();\n ScDocument* pDoc(GetScImport().GetDocument());\n if (pDoc)\n {\n if (sPrintRanges.getLength())\n {\n uno::Reference< sheet::XPrintAreas > xPrintAreas( GetScImport().GetTables().GetCurrentXSheet(), uno::UNO_QUERY );\n if( xPrintAreas.is() )\n {\n uno::Sequence< table::CellRangeAddress > aRangeList;\n ScXMLConverter::GetRangeListFromString( aRangeList, sPrintRanges, pDoc );\n xPrintAreas->setPrintAreas( aRangeList );\n }\n }\n else if (bPrintEntireSheet) pDoc->SetPrintEntireSheet(static_cast<SCTAB>(GetScImport().GetTables().GetCurrentSheet()));\n\n ScOutlineTable* pOutlineTable(pDoc->GetOutlineTable(static_cast<SCTAB>(GetScImport().GetTables().GetCurrentSheet()), sal_False));\n if (pOutlineTable)\n {\n ScOutlineArray* pColArray(pOutlineTable->GetColArray());\n sal_Int32 nDepth(pColArray->GetDepth());\n sal_Int32 i;\n for (i = 0; i < nDepth; ++i)\n {\n sal_Int32 nCount(pColArray->GetCount(static_cast<USHORT>(i)));\n sal_Bool bChanged(sal_False);\n for (sal_Int32 j = 0; j < nCount && !bChanged; ++j)\n {\n ScOutlineEntry* pEntry(pColArray->GetEntry(static_cast<USHORT>(i), static_cast<USHORT>(j)));\n if (pEntry->IsHidden())\n {\n pColArray->SetVisibleBelow(static_cast<USHORT>(i), static_cast<USHORT>(j), sal_False);\n bChanged = sal_True;\n }\n }\n }\n ScOutlineArray* pRowArray(pOutlineTable->GetRowArray());\n nDepth = pRowArray->GetDepth();\n for (i = 0; i < nDepth; ++i)\n {\n sal_Int32 nCount(pRowArray->GetCount(static_cast<USHORT>(i)));\n sal_Bool bChanged(sal_False);\n for (sal_Int32 j = 0; j < nCount && !bChanged; ++j)\n {\n ScOutlineEntry* pEntry(pRowArray->GetEntry(static_cast<USHORT>(i), static_cast<USHORT>(j)));\n if (pEntry->IsHidden())\n {\n pRowArray->SetVisibleBelow(static_cast<USHORT>(i), static_cast<USHORT>(j), sal_False);\n bChanged = sal_True;\n }\n }\n }\n }\n if (GetScImport().GetTables().HasDrawPage())\n {\n if (GetScImport().GetTables().HasXShapes())\n {\n GetScImport().GetShapeImport()->popGroupAndSort();\n uno::Reference < drawing::XShapes > xTempShapes(GetScImport().GetTables().GetCurrentXShapes());\n GetScImport().GetShapeImport()->endPage(xTempShapes);\n }\n if (bStartFormPage)\n GetScImport().GetFormImport()->endPage();\n }\n\n GetScImport().GetTables().DeleteTable();\n GetScImport().GetProgressBarHelper()->Increment();\n }\n GetScImport().UnlockSolarMutex();\n}\n\n<|endoftext|>"} {"text":"<commit_before>\/\/ The libMesh Finite Element Library.\n\/\/ Copyright (C) 2002-2017 Benjamin S. Kirk, John W. Peterson, Roy H. Stogner\n\n\/\/ This library is free software; you can redistribute it and\/or\n\/\/ modify it under the terms of the GNU Lesser General Public\n\/\/ License as published by the Free Software Foundation; either\n\/\/ version 2.1 of the License, or (at your option) any later version.\n\n\/\/ This library is distributed in the hope that it will be useful,\n\/\/ but WITHOUT ANY WARRANTY; without even the implied warranty of\n\/\/ MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU\n\/\/ Lesser General Public License for more details.\n\n\/\/ You should have received a copy of the GNU Lesser General Public\n\/\/ License along with this library; if not, write to the Free Software\n\/\/ Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA\n\n\n\n\/\/ <h1>FEMSystem Example 3 - Unsteady Linear Elasticity with\n\/\/ FEMSystem<\/h1>\n\/\/ \\author Paul Bauman\n\/\/ \\date 2015\n\/\/\n\/\/ This example shows how to solve the three-dimensional transient\n\/\/ linear elasticity equations using the DifferentiableSystem class framework.\n\/\/ This is just Systems of Equations Example 6 recast.\n\n\/\/ C++ includes\n#include <iomanip>\n\n\/\/ Basic include files\n#include \"libmesh\/equation_systems.h\"\n#include \"libmesh\/error_vector.h\"\n#include \"libmesh\/getpot.h\"\n#include \"libmesh\/exodusII_io.h\"\n#include \"libmesh\/kelly_error_estimator.h\"\n#include \"libmesh\/mesh.h\"\n#include \"libmesh\/mesh_generation.h\"\n\n\/\/ The systems and solvers we may use\n#include \"elasticity_system.h\"\n#include \"libmesh\/diff_solver.h\"\n#include \"libmesh\/newmark_solver.h\"\n#include \"libmesh\/steady_solver.h\"\n#include \"libmesh\/euler_solver.h\"\n#include \"libmesh\/euler2_solver.h\"\n#include \"libmesh\/elem.h\"\n#include \"libmesh\/newton_solver.h\"\n#include \"libmesh\/eigen_sparse_linear_solver.h\"\n\n#define x_scaling 1.3\n\n\/\/ Bring in everything from the libMesh namespace\nusing namespace libMesh;\n\n\/\/ The main program.\nint main (int argc, char ** argv)\n{\n \/\/ Initialize libMesh.\n LibMeshInit init (argc, argv);\n\n \/\/ Parse the input file\n GetPot infile(\"fem_system_ex3.in\");\n\n \/\/ Override input file arguments from the commannd line\n infile.parse_command_line(argc, argv);\n\n \/\/ Read in parameters from the input file\n const Real deltat = infile(\"deltat\", 0.25);\n unsigned int n_timesteps = infile(\"n_timesteps\", 1);\n\n#ifdef LIBMESH_HAVE_EXODUS_API\n const unsigned int write_interval = infile(\"write_interval\", 1);\n#endif\n\n \/\/ Initialize the cantilever mesh\n const unsigned int dim = 3;\n\n \/\/ Make sure libMesh was compiled for 3D\n libmesh_example_requires(dim == LIBMESH_DIM, \"3D support\");\n\n \/\/ Create a 3D mesh distributed across the default MPI communicator.\n Mesh mesh(init.comm(), dim);\n MeshTools::Generation::build_cube (mesh,\n 32,\n 8,\n 4,\n 0., 1.*x_scaling,\n 0., 0.3,\n 0., 0.1,\n HEX8);\n\n\n \/\/ Print information about the mesh to the screen.\n mesh.print_info();\n\n \/\/ Let's add some node and edge boundary conditions.\n \/\/ Each processor should know about each boundary condition it can\n \/\/ see, so we loop over all elements, not just local elements.\n MeshBase::const_element_iterator el = mesh.elements_begin();\n const MeshBase::const_element_iterator end_el = mesh.elements_end();\n for ( ; el != end_el; ++el)\n {\n const Elem * elem = *el;\n\n unsigned int\n side_max_x = 0, side_min_y = 0,\n side_max_y = 0, side_max_z = 0;\n bool\n found_side_max_x = false, found_side_max_y = false,\n found_side_min_y = false, found_side_max_z = false;\n for (unsigned int side=0; side<elem->n_sides(); side++)\n {\n if (mesh.get_boundary_info().has_boundary_id(elem, side, BOUNDARY_ID_MAX_X))\n {\n side_max_x = side;\n found_side_max_x = true;\n }\n\n if (mesh.get_boundary_info().has_boundary_id(elem, side, BOUNDARY_ID_MIN_Y))\n {\n side_min_y = side;\n found_side_min_y = true;\n }\n\n if (mesh.get_boundary_info().has_boundary_id(elem, side, BOUNDARY_ID_MAX_Y))\n {\n side_max_y = side;\n found_side_max_y = true;\n }\n\n if (mesh.get_boundary_info().has_boundary_id(elem, side, BOUNDARY_ID_MAX_Z))\n {\n side_max_z = side;\n found_side_max_z = true;\n }\n }\n\n \/\/ If elem has sides on boundaries\n \/\/ BOUNDARY_ID_MAX_X, BOUNDARY_ID_MAX_Y, BOUNDARY_ID_MAX_Z\n \/\/ then let's set a node boundary condition\n if (found_side_max_x && found_side_max_y && found_side_max_z)\n for (unsigned int n=0; n<elem->n_nodes(); n++)\n if (elem->is_node_on_side(n, side_max_x) &&\n elem->is_node_on_side(n, side_max_y) &&\n elem->is_node_on_side(n, side_max_z))\n mesh.get_boundary_info().add_node(elem->node_ptr(n), NODE_BOUNDARY_ID);\n\n \/\/ If elem has sides on boundaries\n \/\/ BOUNDARY_ID_MAX_X and BOUNDARY_ID_MIN_Y\n \/\/ then let's set an edge boundary condition\n if (found_side_max_x && found_side_min_y)\n for (unsigned int e=0; e<elem->n_edges(); e++)\n if (elem->is_edge_on_side(e, side_max_x) &&\n elem->is_edge_on_side(e, side_min_y))\n mesh.get_boundary_info().add_edge(elem, e, EDGE_BOUNDARY_ID);\n }\n\n \/\/ Create an equation systems object.\n EquationSystems equation_systems (mesh);\n\n \/\/ Declare the system \"Navier-Stokes\" and its variables.\n ElasticitySystem & system =\n equation_systems.add_system<ElasticitySystem> (\"Linear Elasticity\");\n\n \/\/ Solve this as a time-dependent or steady system\n std::string time_solver = infile(\"time_solver\",\"DIE!\");\n\n ExplicitSystem * v_system;\n ExplicitSystem * a_system;\n\n if( time_solver == std::string(\"newmark\") )\n {\n \/\/ Create ExplicitSystem to help output velocity\n v_system = &equation_systems.add_system<ExplicitSystem> (\"Velocity\");\n v_system->add_variable(\"u_vel\", FIRST, LAGRANGE);\n v_system->add_variable(\"v_vel\", FIRST, LAGRANGE);\n v_system->add_variable(\"w_vel\", FIRST, LAGRANGE);\n\n \/\/ Create ExplicitSystem to help output acceleration\n a_system = &equation_systems.add_system<ExplicitSystem> (\"Acceleration\");\n a_system->add_variable(\"u_accel\", FIRST, LAGRANGE);\n a_system->add_variable(\"v_accel\", FIRST, LAGRANGE);\n a_system->add_variable(\"w_accel\", FIRST, LAGRANGE);\n }\n\n if( time_solver == std::string(\"newmark\"))\n system.time_solver.reset(new NewmarkSolver(system));\n\n else if( time_solver == std::string(\"euler\") )\n {\n system.time_solver.reset(new EulerSolver(system));\n EulerSolver & euler_solver = libmesh_cast_ref<EulerSolver &>(*(system.time_solver.get()));\n euler_solver.theta = infile(\"theta\", 1.0);\n }\n\n else if( time_solver == std::string(\"euler2\") )\n {\n system.time_solver.reset(new Euler2Solver(system));\n Euler2Solver & euler_solver = libmesh_cast_ref<Euler2Solver &>(*(system.time_solver.get()));\n euler_solver.theta = infile(\"theta\", 1.0);\n }\n\n else if( time_solver == std::string(\"steady\"))\n {\n system.time_solver.reset(new SteadySolver(system));\n libmesh_assert_equal_to (n_timesteps, 1);\n }\n else\n libmesh_error_msg(std::string(\"ERROR: invalud time_solver \")+time_solver);\n\n \/\/ Initialize the system\n equation_systems.init ();\n\n \/\/ Set the time stepping options\n system.deltat = deltat;\n\n \/\/ And the nonlinear solver options\n DiffSolver & solver = *(system.time_solver->diff_solver().get());\n solver.quiet = infile(\"solver_quiet\", true);\n solver.verbose = !solver.quiet;\n solver.max_nonlinear_iterations = infile(\"max_nonlinear_iterations\", 15);\n solver.relative_step_tolerance = infile(\"relative_step_tolerance\", 1.e-3);\n solver.relative_residual_tolerance = infile(\"relative_residual_tolerance\", 0.0);\n solver.absolute_residual_tolerance = infile(\"absolute_residual_tolerance\", 0.0);\n\n \/\/ And the linear solver options\n solver.max_linear_iterations = infile(\"max_linear_iterations\", 50000);\n solver.initial_linear_tolerance = infile(\"initial_linear_tolerance\", 1.e-3);\n\n \/\/ Print information about the system to the screen.\n equation_systems.print_info();\n\n \/\/ If we're using EulerSolver or Euler2Solver, and we're using EigenSparseLinearSolver,\n \/\/ then we need to reset the EigenSparseLinearSolver to use SPARSELU because BICGSTAB\n \/\/ chokes on the Jacobian matrix we give it and Eigen's GMRES currently doesn't work.\n NewtonSolver * newton_solver = dynamic_cast<NewtonSolver *>( &solver );\n if( newton_solver &&\n (time_solver == std::string(\"euler\") || time_solver == std::string(\"euler2\") ) )\n {\n LinearSolver<Number> & linear_solver = newton_solver->get_linear_solver();\n EigenSparseLinearSolver<Number> * eigen_linear_solver =\n dynamic_cast<EigenSparseLinearSolver<Number> *>(&linear_solver);\n\n if( eigen_linear_solver )\n eigen_linear_solver->set_solver_type(SPARSELU);\n }\n\n if( time_solver == std::string(\"newmark\") )\n {\n NewmarkSolver * newmark = cast_ptr<NewmarkSolver*>(system.time_solver.get());\n newmark->compute_initial_accel();\n\n \/\/ Copy over initial velocity and acceleration for output.\n \/\/ Note we can do this because of the matching variables\/FE spaces\n *(v_system->solution) = system.get_vector(\"_old_solution_rate\");\n *(a_system->solution) = system.get_vector(\"_old_solution_accel\");\n }\n\n#ifdef LIBMESH_HAVE_EXODUS_API\n \/\/ Output initial state\n {\n std::ostringstream file_name;\n\n \/\/ We write the file in the ExodusII format.\n file_name << std::string(\"out.\")+time_solver+std::string(\".e-s.\")\n << std::setw(3)\n << std::setfill('0')\n << std::right\n << 0;\n\n ExodusII_IO(mesh).write_timestep(file_name.str(),\n equation_systems,\n 1, \/\/ This number indicates how many time steps\n \/\/ are being written to the file\n system.time);\n }\n#endif \/\/ #ifdef LIBMESH_HAVE_EXODUS_API\n\n \/\/ Now we begin the timestep loop to compute the time-accurate\n \/\/ solution of the equations.\n for (unsigned int t_step=0; t_step != n_timesteps; ++t_step)\n {\n \/\/ A pretty update message\n libMesh::out << \"\\n\\nSolving time step \"\n << t_step\n << \", time = \"\n << system.time\n << std::endl;\n\n system.solve();\n\n \/\/ Advance to the next timestep in a transient problem\n system.time_solver->advance_timestep();\n\n \/\/ Copy over updated velocity and acceleration for output.\n \/\/ Note we can do this because of the matching variables\/FE spaces\n if( time_solver == std::string(\"newmark\") )\n {\n *(v_system->solution) = system.get_vector(\"_old_solution_rate\");\n *(a_system->solution) = system.get_vector(\"_old_solution_accel\");\n }\n\n#ifdef LIBMESH_HAVE_EXODUS_API\n \/\/ Write out this timestep if we're requested to\n if ((t_step+1)%write_interval == 0)\n {\n std::ostringstream file_name;\n\n \/\/ We write the file in the ExodusII format.\n file_name << std::string(\"out.\")+time_solver+std::string(\".e-s.\")\n << std::setw(3)\n << std::setfill('0')\n << std::right\n << t_step+1;\n\n ExodusII_IO(mesh).write_timestep(file_name.str(),\n equation_systems,\n 1, \/\/ This number indicates how many time steps\n \/\/ are being written to the file\n system.time);\n }\n#endif \/\/ #ifdef LIBMESH_HAVE_EXODUS_API\n }\n\n \/\/ All done.\n return 0;\n}\n<commit_msg>fix for --disable-optional && make installcheck<commit_after>\/\/ The libMesh Finite Element Library.\n\/\/ Copyright (C) 2002-2017 Benjamin S. Kirk, John W. Peterson, Roy H. Stogner\n\n\/\/ This library is free software; you can redistribute it and\/or\n\/\/ modify it under the terms of the GNU Lesser General Public\n\/\/ License as published by the Free Software Foundation; either\n\/\/ version 2.1 of the License, or (at your option) any later version.\n\n\/\/ This library is distributed in the hope that it will be useful,\n\/\/ but WITHOUT ANY WARRANTY; without even the implied warranty of\n\/\/ MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU\n\/\/ Lesser General Public License for more details.\n\n\/\/ You should have received a copy of the GNU Lesser General Public\n\/\/ License along with this library; if not, write to the Free Software\n\/\/ Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA\n\n\n\n\/\/ <h1>FEMSystem Example 3 - Unsteady Linear Elasticity with\n\/\/ FEMSystem<\/h1>\n\/\/ \\author Paul Bauman\n\/\/ \\date 2015\n\/\/\n\/\/ This example shows how to solve the three-dimensional transient\n\/\/ linear elasticity equations using the DifferentiableSystem class framework.\n\/\/ This is just Systems of Equations Example 6 recast.\n\n\/\/ C++ includes\n#include <iomanip>\n\n\/\/ Basic include files\n#include \"libmesh\/equation_systems.h\"\n#include \"libmesh\/error_vector.h\"\n#include \"libmesh\/getpot.h\"\n#include \"libmesh\/exodusII_io.h\"\n#include \"libmesh\/kelly_error_estimator.h\"\n#include \"libmesh\/mesh.h\"\n#include \"libmesh\/mesh_generation.h\"\n\n\/\/ The systems and solvers we may use\n#include \"elasticity_system.h\"\n#include \"libmesh\/diff_solver.h\"\n#include \"libmesh\/newmark_solver.h\"\n#include \"libmesh\/steady_solver.h\"\n#include \"libmesh\/euler_solver.h\"\n#include \"libmesh\/euler2_solver.h\"\n#include \"libmesh\/elem.h\"\n#include \"libmesh\/newton_solver.h\"\n#include \"libmesh\/eigen_sparse_linear_solver.h\"\n\n#define x_scaling 1.3\n\n\/\/ Bring in everything from the libMesh namespace\nusing namespace libMesh;\n\n\/\/ The main program.\nint main (int argc, char ** argv)\n{\n \/\/ Initialize libMesh.\n LibMeshInit init (argc, argv);\n\n \/\/ Parse the input file\n GetPot infile(\"fem_system_ex3.in\");\n\n \/\/ Override input file arguments from the commannd line\n infile.parse_command_line(argc, argv);\n\n \/\/ Read in parameters from the input file\n const Real deltat = infile(\"deltat\", 0.25);\n unsigned int n_timesteps = infile(\"n_timesteps\", 1);\n\n#ifdef LIBMESH_HAVE_EXODUS_API\n const unsigned int write_interval = infile(\"write_interval\", 1);\n#endif\n\n \/\/ Initialize the cantilever mesh\n const unsigned int dim = 3;\n\n \/\/ Make sure libMesh was compiled for 3D\n libmesh_example_requires(dim == LIBMESH_DIM, \"3D support\");\n\n \/\/ Create a 3D mesh distributed across the default MPI communicator.\n Mesh mesh(init.comm(), dim);\n MeshTools::Generation::build_cube (mesh,\n 32,\n 8,\n 4,\n 0., 1.*x_scaling,\n 0., 0.3,\n 0., 0.1,\n HEX8);\n\n\n \/\/ Print information about the mesh to the screen.\n mesh.print_info();\n\n \/\/ Let's add some node and edge boundary conditions.\n \/\/ Each processor should know about each boundary condition it can\n \/\/ see, so we loop over all elements, not just local elements.\n MeshBase::const_element_iterator el = mesh.elements_begin();\n const MeshBase::const_element_iterator end_el = mesh.elements_end();\n for ( ; el != end_el; ++el)\n {\n const Elem * elem = *el;\n\n unsigned int\n side_max_x = 0, side_min_y = 0,\n side_max_y = 0, side_max_z = 0;\n bool\n found_side_max_x = false, found_side_max_y = false,\n found_side_min_y = false, found_side_max_z = false;\n for (unsigned int side=0; side<elem->n_sides(); side++)\n {\n if (mesh.get_boundary_info().has_boundary_id(elem, side, BOUNDARY_ID_MAX_X))\n {\n side_max_x = side;\n found_side_max_x = true;\n }\n\n if (mesh.get_boundary_info().has_boundary_id(elem, side, BOUNDARY_ID_MIN_Y))\n {\n side_min_y = side;\n found_side_min_y = true;\n }\n\n if (mesh.get_boundary_info().has_boundary_id(elem, side, BOUNDARY_ID_MAX_Y))\n {\n side_max_y = side;\n found_side_max_y = true;\n }\n\n if (mesh.get_boundary_info().has_boundary_id(elem, side, BOUNDARY_ID_MAX_Z))\n {\n side_max_z = side;\n found_side_max_z = true;\n }\n }\n\n \/\/ If elem has sides on boundaries\n \/\/ BOUNDARY_ID_MAX_X, BOUNDARY_ID_MAX_Y, BOUNDARY_ID_MAX_Z\n \/\/ then let's set a node boundary condition\n if (found_side_max_x && found_side_max_y && found_side_max_z)\n for (unsigned int n=0; n<elem->n_nodes(); n++)\n if (elem->is_node_on_side(n, side_max_x) &&\n elem->is_node_on_side(n, side_max_y) &&\n elem->is_node_on_side(n, side_max_z))\n mesh.get_boundary_info().add_node(elem->node_ptr(n), NODE_BOUNDARY_ID);\n\n \/\/ If elem has sides on boundaries\n \/\/ BOUNDARY_ID_MAX_X and BOUNDARY_ID_MIN_Y\n \/\/ then let's set an edge boundary condition\n if (found_side_max_x && found_side_min_y)\n for (unsigned int e=0; e<elem->n_edges(); e++)\n if (elem->is_edge_on_side(e, side_max_x) &&\n elem->is_edge_on_side(e, side_min_y))\n mesh.get_boundary_info().add_edge(elem, e, EDGE_BOUNDARY_ID);\n }\n\n \/\/ Create an equation systems object.\n EquationSystems equation_systems (mesh);\n\n \/\/ Declare the system \"Navier-Stokes\" and its variables.\n ElasticitySystem & system =\n equation_systems.add_system<ElasticitySystem> (\"Linear Elasticity\");\n\n \/\/ Solve this as a time-dependent or steady system\n std::string time_solver = infile(\"time_solver\",\"DIE!\");\n\n ExplicitSystem * v_system;\n ExplicitSystem * a_system;\n\n if( time_solver == std::string(\"newmark\") )\n {\n \/\/ Create ExplicitSystem to help output velocity\n v_system = &equation_systems.add_system<ExplicitSystem> (\"Velocity\");\n v_system->add_variable(\"u_vel\", FIRST, LAGRANGE);\n v_system->add_variable(\"v_vel\", FIRST, LAGRANGE);\n v_system->add_variable(\"w_vel\", FIRST, LAGRANGE);\n\n \/\/ Create ExplicitSystem to help output acceleration\n a_system = &equation_systems.add_system<ExplicitSystem> (\"Acceleration\");\n a_system->add_variable(\"u_accel\", FIRST, LAGRANGE);\n a_system->add_variable(\"v_accel\", FIRST, LAGRANGE);\n a_system->add_variable(\"w_accel\", FIRST, LAGRANGE);\n }\n\n if( time_solver == std::string(\"newmark\"))\n system.time_solver.reset(new NewmarkSolver(system));\n\n else if( time_solver == std::string(\"euler\") )\n {\n system.time_solver.reset(new EulerSolver(system));\n EulerSolver & euler_solver = libmesh_cast_ref<EulerSolver &>(*(system.time_solver.get()));\n euler_solver.theta = infile(\"theta\", 1.0);\n }\n\n else if( time_solver == std::string(\"euler2\") )\n {\n system.time_solver.reset(new Euler2Solver(system));\n Euler2Solver & euler_solver = libmesh_cast_ref<Euler2Solver &>(*(system.time_solver.get()));\n euler_solver.theta = infile(\"theta\", 1.0);\n }\n\n else if( time_solver == std::string(\"steady\"))\n {\n system.time_solver.reset(new SteadySolver(system));\n libmesh_assert_equal_to (n_timesteps, 1);\n }\n else\n libmesh_error_msg(std::string(\"ERROR: invalud time_solver \")+time_solver);\n\n \/\/ Initialize the system\n equation_systems.init ();\n\n \/\/ Set the time stepping options\n system.deltat = deltat;\n\n \/\/ And the nonlinear solver options\n DiffSolver & solver = *(system.time_solver->diff_solver().get());\n solver.quiet = infile(\"solver_quiet\", true);\n solver.verbose = !solver.quiet;\n solver.max_nonlinear_iterations = infile(\"max_nonlinear_iterations\", 15);\n solver.relative_step_tolerance = infile(\"relative_step_tolerance\", 1.e-3);\n solver.relative_residual_tolerance = infile(\"relative_residual_tolerance\", 0.0);\n solver.absolute_residual_tolerance = infile(\"absolute_residual_tolerance\", 0.0);\n\n \/\/ And the linear solver options\n solver.max_linear_iterations = infile(\"max_linear_iterations\", 50000);\n solver.initial_linear_tolerance = infile(\"initial_linear_tolerance\", 1.e-3);\n\n \/\/ Print information about the system to the screen.\n equation_systems.print_info();\n\n \/\/ If we're using EulerSolver or Euler2Solver, and we're using EigenSparseLinearSolver,\n \/\/ then we need to reset the EigenSparseLinearSolver to use SPARSELU because BICGSTAB\n \/\/ chokes on the Jacobian matrix we give it and Eigen's GMRES currently doesn't work.\n NewtonSolver * newton_solver = dynamic_cast<NewtonSolver *>( &solver );\n if( newton_solver &&\n (time_solver == std::string(\"euler\") || time_solver == std::string(\"euler2\") ) )\n {\n LinearSolver<Number> & linear_solver = newton_solver->get_linear_solver();\n#ifdef LIBMESH_HAVE_EIGEN_SPARSE\n EigenSparseLinearSolver<Number> * eigen_linear_solver =\n dynamic_cast<EigenSparseLinearSolver<Number> *>(&linear_solver);\n\n if( eigen_linear_solver )\n eigen_linear_solver->set_solver_type(SPARSELU);\n#endif\n }\n\n if( time_solver == std::string(\"newmark\") )\n {\n NewmarkSolver * newmark = cast_ptr<NewmarkSolver*>(system.time_solver.get());\n newmark->compute_initial_accel();\n\n \/\/ Copy over initial velocity and acceleration for output.\n \/\/ Note we can do this because of the matching variables\/FE spaces\n *(v_system->solution) = system.get_vector(\"_old_solution_rate\");\n *(a_system->solution) = system.get_vector(\"_old_solution_accel\");\n }\n\n#ifdef LIBMESH_HAVE_EXODUS_API\n \/\/ Output initial state\n {\n std::ostringstream file_name;\n\n \/\/ We write the file in the ExodusII format.\n file_name << std::string(\"out.\")+time_solver+std::string(\".e-s.\")\n << std::setw(3)\n << std::setfill('0')\n << std::right\n << 0;\n\n ExodusII_IO(mesh).write_timestep(file_name.str(),\n equation_systems,\n 1, \/\/ This number indicates how many time steps\n \/\/ are being written to the file\n system.time);\n }\n#endif \/\/ #ifdef LIBMESH_HAVE_EXODUS_API\n\n \/\/ Now we begin the timestep loop to compute the time-accurate\n \/\/ solution of the equations.\n for (unsigned int t_step=0; t_step != n_timesteps; ++t_step)\n {\n \/\/ A pretty update message\n libMesh::out << \"\\n\\nSolving time step \"\n << t_step\n << \", time = \"\n << system.time\n << std::endl;\n\n system.solve();\n\n \/\/ Advance to the next timestep in a transient problem\n system.time_solver->advance_timestep();\n\n \/\/ Copy over updated velocity and acceleration for output.\n \/\/ Note we can do this because of the matching variables\/FE spaces\n if( time_solver == std::string(\"newmark\") )\n {\n *(v_system->solution) = system.get_vector(\"_old_solution_rate\");\n *(a_system->solution) = system.get_vector(\"_old_solution_accel\");\n }\n\n#ifdef LIBMESH_HAVE_EXODUS_API\n \/\/ Write out this timestep if we're requested to\n if ((t_step+1)%write_interval == 0)\n {\n std::ostringstream file_name;\n\n \/\/ We write the file in the ExodusII format.\n file_name << std::string(\"out.\")+time_solver+std::string(\".e-s.\")\n << std::setw(3)\n << std::setfill('0')\n << std::right\n << t_step+1;\n\n ExodusII_IO(mesh).write_timestep(file_name.str(),\n equation_systems,\n 1, \/\/ This number indicates how many time steps\n \/\/ are being written to the file\n system.time);\n }\n#endif \/\/ #ifdef LIBMESH_HAVE_EXODUS_API\n }\n\n \/\/ All done.\n return 0;\n}\n<|endoftext|>"} {"text":"<commit_before>\/*************************************************************************\n *\n * $RCSfile: plugcon.hxx,v $\n *\n * $Revision: 1.4 $\n *\n * last change: $Author: svesik $ $Date: 2001-11-12 12:41: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#ifndef _PLUGCON_HXX\n#define _PLUGCON_HXX\n\n#include <stdarg.h>\n#include <string.h>\n\n#include <list>\n\n#ifndef _LIST_HXX\n#include <tools\/list.hxx>\n#endif\n\n#ifndef _MEDIATOR_HXX\n#include <plugin\/unx\/mediator.hxx>\n#endif\n\n#if defined SOLARIS\n#define USE_MOTIF\n#endif\n\n#define Window XLIB_Window\n#define Font XLIB_Font\n#define KeyCode XLIB_KeyCode\n#define Time XLIB_Time\n#define Cursor XLIB_Cursor\n#define Region XLIB_Region\n#define String XLIB_String\n#define Boolean XLIB_Boolean\n#define XPointer XLIB_XPointer\n#include <X11\/Xlib.h>\n#include <X11\/Intrinsic.h>\n#include <X11\/Shell.h>\n#include <X11\/IntrinsicP.h> \/* Intrinsics Definitions*\/\n#include <X11\/StringDefs.h> \/* Standard Name-String definitions*\/\n#if defined USE_MOTIF\n#include <Xm\/DrawingA.h>\n#else\n#include <X11\/Xaw\/Label.h>\n#endif\n#include <X11\/Xatom.h>\n#define XP_UNIX\n#include <stdio.h>\n#ifndef _NPAPI_H_\n#include <npsdk\/npupp.h>\n#include <npsdk\/npapi.h>\n#endif\n#undef Window\n#undef Font\n#undef KeyCode\n#undef Time\n#undef Cursor\n#undef String\n#undef Region\n#undef Boolean\n#undef XPointer\n\nclass ConnectorInstance\n{\npublic:\n NPP instance;\n NPWindow window;\n NPSetWindowCallbackStruct ws_info;\n char* pMimeType;\n void* pShell;\n void* pWidget;\n\n int nArg;\n char** argn;\n char** argv;\n char* pArgnBuf;\n char* pArgvBuf;\n NPSavedData aData;\n\n ConnectorInstance( NPP inst, char* type,\n int args, char* pargnbuf, ULONG nargnbytes,\n char* pargvbuf, ULONG nargvbytes,\n char* savedata, ULONG savebytes );\n ~ConnectorInstance();\n};\n\nclass PluginConnector;\n\nDECLARE_LIST( NPStreamList, NPStream* );\nDECLARE_LIST( InstanceList, ConnectorInstance* );\nDECLARE_LIST( PluginConnectorList, PluginConnector* );\n\nclass PluginConnector : public Mediator\n{\n friend NPError NPN_DestroyStream( NPP, NPStream*, NPError );\n friend NPError NPN_NewStream( NPP, NPMIMEType, const char*,\n NPStream** );\nprotected:\n NAMESPACE_VOS(OMutex) m_aUserEventMutex;\n\n static PluginConnectorList allConnectors;\n\n DECL_LINK( NewMessageHdl, Mediator* );\n DECL_LINK( WorkOnNewMessageHdl, Mediator* );\n\n NPStreamList m_aNPWrapStreams;\n InstanceList m_aInstances;\n\n ULONG FillBuffer( char*&, char*, ULONG, va_list );\npublic:\n PluginConnector( int nSocket );\n ~PluginConnector();\n\n virtual MediatorMessage* WaitForAnswer( ULONG nMessageID );\n MediatorMessage* Transact( char*, ULONG, ... );\n MediatorMessage* Transact( UINT32, ... );\n void Respond( ULONG nID, char*, ULONG, ... );\n ULONG Send( UINT32, ... );\n\n UINT32 GetStreamID( NPStream* pStream );\n UINT32 GetNPPID( NPP );\n\n NPError GetNPError( MediatorMessage* pMes )\n {\n NPError* pErr = (NPError*)pMes->GetBytes();\n NPError aErr = *pErr;\n delete pErr;\n return aErr;\n }\n\n void CallWorkHandler()\n {\n LINK( this, PluginConnector, WorkOnNewMessageHdl ).\n Call( (Mediator*)this );\n }\n};\n\nenum CommandAtoms\n{\n eNPN_GetURL,\n eNPN_GetURLNotify,\n eNPN_DestroyStream,\n eNPN_NewStream,\n eNPN_PostURLNotify,\n eNPN_PostURL,\n eNPN_RequestRead,\n eNPN_Status,\n eNPN_Version,\n eNPN_Write,\n eNPN_UserAgent,\n\n eNPP_DestroyStream,\n eNPP_Destroy,\n eNPP_NewStream,\n eNPP_New,\n eNPP_SetWindow,\n eNPP_StreamAsFile,\n eNPP_URLNotify,\n eNPP_WriteReady,\n eNPP_Write,\n eNPP_GetMIMEDescription,\n eNPP_Initialize,\n eNPP_Shutdown,\n\n eMaxCommand\n};\n\nchar* GetCommandName( CommandAtoms );\nvoid resizePlugin( NPP, UINT32, UINT32 );\n\n#define POST_STRING( x ) x ? x : const_cast<char*>(\"\"), x ? strlen(x) : 1\n\n#endif \/\/ _PLUGCON_HXX\n<commit_msg>INTEGRATION: CWS vcl09 (1.4.102); FILE MERGED 2003\/05\/08 18:46:19 pl 1.4.102.1: #109426# make rpnp.so work on Linux<commit_after>\/*************************************************************************\n *\n * $RCSfile: plugcon.hxx,v $\n *\n * $Revision: 1.5 $\n *\n * last change: $Author: vg $ $Date: 2003-05-28 12:38: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#ifndef _PLUGCON_HXX\n#define _PLUGCON_HXX\n\n#include <stdarg.h>\n#include <string.h>\n\n#include <list>\n\n#ifndef _LIST_HXX\n#include <tools\/list.hxx>\n#endif\n\n#ifndef _MEDIATOR_HXX\n#include <plugin\/unx\/mediator.hxx>\n#endif\n\n#if defined SOLARIS\n#define USE_MOTIF\n#endif\n\n#define Window XLIB_Window\n#define Font XLIB_Font\n#define KeyCode XLIB_KeyCode\n#define Time XLIB_Time\n#define Cursor XLIB_Cursor\n#define Region XLIB_Region\n#define String XLIB_String\n#define Boolean XLIB_Boolean\n#define XPointer XLIB_XPointer\n#include <X11\/Xlib.h>\n#include <X11\/Intrinsic.h>\n#include <X11\/Shell.h>\n#include <X11\/IntrinsicP.h> \/* Intrinsics Definitions*\/\n#include <X11\/StringDefs.h> \/* Standard Name-String definitions*\/\n#if defined USE_MOTIF\n#include <Xm\/DrawingA.h>\n#else\n#include <X11\/Xaw\/Label.h>\n#endif\n#include <X11\/Xatom.h>\n#define XP_UNIX\n#include <stdio.h>\n#ifndef _NPAPI_H_\n#include <npsdk\/npupp.h>\n#include <npsdk\/npapi.h>\n#endif\n#undef Window\n#undef Font\n#undef KeyCode\n#undef Time\n#undef Cursor\n#undef String\n#undef Region\n#undef Boolean\n#undef XPointer\n\nclass ConnectorInstance\n{\npublic:\n NPP instance;\n NPWindow window;\n NPSetWindowCallbackStruct ws_info;\n char* pMimeType;\n void* pShell;\n void* pWidget;\n\n int nArg;\n char** argn;\n char** argv;\n char* pArgnBuf;\n char* pArgvBuf;\n NPSavedData aData;\n\n ConnectorInstance( NPP inst, char* type,\n int args, char* pargnbuf, ULONG nargnbytes,\n char* pargvbuf, ULONG nargvbytes,\n char* savedata, ULONG savebytes );\n ~ConnectorInstance();\n};\n\nclass PluginConnector;\n\nDECLARE_LIST( NPStreamList, NPStream* );\nDECLARE_LIST( InstanceList, ConnectorInstance* );\nDECLARE_LIST( PluginConnectorList, PluginConnector* );\n\nclass PluginConnector : public Mediator\n{\n friend NPError NPN_DestroyStream( NPP, NPStream*, NPError );\n friend NPError NPN_NewStream( NPP, NPMIMEType, const char*,\n NPStream** );\nprotected:\n NAMESPACE_VOS(OMutex) m_aUserEventMutex;\n\n static PluginConnectorList allConnectors;\n\n DECL_LINK( NewMessageHdl, Mediator* );\n DECL_LINK( WorkOnNewMessageHdl, Mediator* );\n\n NPStreamList m_aNPWrapStreams;\n InstanceList m_aInstances;\n\n ULONG FillBuffer( char*&, char*, ULONG, va_list );\npublic:\n PluginConnector( int nSocket );\n ~PluginConnector();\n\n virtual MediatorMessage* WaitForAnswer( ULONG nMessageID );\n MediatorMessage* Transact( char*, ULONG, ... );\n MediatorMessage* Transact( UINT32, ... );\n void Respond( ULONG nID, char*, ULONG, ... );\n ULONG Send( UINT32, ... );\n\n UINT32 GetStreamID( NPStream* pStream );\n UINT32 GetNPPID( NPP );\n\n NPError GetNPError( MediatorMessage* pMes )\n {\n NPError* pErr = (NPError*)pMes->GetBytes();\n NPError aErr = *pErr;\n delete [] pErr;\n return aErr;\n }\n\n void CallWorkHandler()\n {\n LINK( this, PluginConnector, WorkOnNewMessageHdl ).\n Call( (Mediator*)this );\n }\n};\n\nenum CommandAtoms\n{\n eNPN_GetURL,\n eNPN_GetURLNotify,\n eNPN_DestroyStream,\n eNPN_NewStream,\n eNPN_PostURLNotify,\n eNPN_PostURL,\n eNPN_RequestRead,\n eNPN_Status,\n eNPN_Version,\n eNPN_Write,\n eNPN_UserAgent,\n\n eNPP_DestroyStream,\n eNPP_Destroy,\n eNPP_NewStream,\n eNPP_New,\n eNPP_SetWindow,\n eNPP_StreamAsFile,\n eNPP_URLNotify,\n eNPP_WriteReady,\n eNPP_Write,\n eNPP_GetMIMEDescription,\n eNPP_Initialize,\n eNPP_Shutdown,\n\n eMaxCommand\n};\n\nchar* GetCommandName( CommandAtoms );\n\n#define POST_STRING( x ) x ? x : const_cast<char*>(\"\"), x ? strlen(x) : 1\n\n#endif \/\/ _PLUGCON_HXX\n<|endoftext|>"} {"text":"<commit_before>\/*\n This file is part of libakonadi.\n\n Copyright (c) 2006 Till Adam <adam@kde.org>\n Copyright (c) 2007 Volker Krause <vkrause@kde.org>\n Copyright (c) 2007 Bruno Virlet <bruno.virlet@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 \"agentbase.h\"\n#include \"agentbase_p.h\"\n\n#include \"agent.h\"\n#include \"kcrash.h\"\n#include \"agentadaptor.h\"\n#include \"monitor_p.h\"\n#include \"xdgbasedirs.h\"\n\n#include <libakonadi\/session.h>\n#include <libakonadi\/changerecorder.h>\n#include <libakonadi\/itemfetchjob.h>\n\n#include <kaboutdata.h>\n#include <kcmdlineargs.h>\n#include <kdebug.h>\n#include <klocale.h>\n\n#include <QtCore\/QDir>\n#include <QtCore\/QTimer>\n#include <QtGui\/QApplication>\n#include <QtDBus\/QtDBus>\n\n#include <signal.h>\n#include <stdlib.h>\n\nusing namespace Akonadi;\n\nstatic AgentBase *sAgentBase = 0;\n\n\/* FIXME Already defined in ResourceBase: which one to keep ?\nvoid crashHandler( int signal )\n{\n if ( sAgentBase )\n sAgentBase->crashHandler( signal );\n\n exit( 255 );\n}*\/\n\nAgentBasePrivate::AgentBasePrivate( AgentBase *parent )\n : q_ptr( parent ),\n mSettings( 0 )\n{\n}\n\nAgentBasePrivate::~AgentBasePrivate()\n{\n monitor->setConfig( 0 );\n delete mSettings;\n}\n\nvoid AgentBasePrivate::init()\n{\n Q_Q( AgentBase );\n mTracer = new org::kde::Akonadi::Tracer( QLatin1String( \"org.kde.Akonadi\" ), QLatin1String( \"\/tracing\" ),\n QDBusConnection::sessionBus(), q );\n\n if ( !QDBusConnection::sessionBus().registerService( QLatin1String( \"org.kde.Akonadi.Agent.\" ) + mId ) )\n q->error( QString::fromLatin1( \"Unable to register service at dbus: %1\" ).arg( QDBusConnection::sessionBus().lastError().message() ) );\n\n new AgentAdaptor( q );\n if ( !QDBusConnection::sessionBus().registerObject( QLatin1String( \"\/\" ), q, QDBusConnection::ExportAdaptors ) )\n q->error( QString::fromLatin1( \"Unable to register object at dbus: %1\" ).arg( QDBusConnection::sessionBus().lastError().message() ) );\n\n mSettings = new QSettings( QString::fromLatin1( \"%1\/agent_config_%2\" ).arg( XdgBaseDirs::saveDir( \"config\", QLatin1String( \"akonadi\" ) ), mId ), QSettings::IniFormat );\n\n session = new Session( mId.toLatin1(), q );\n monitor = new ChangeRecorder( q );\n monitor->ignoreSession( session );\n monitor->setConfig( mSettings );\n\n q->connect( monitor, SIGNAL( itemAdded( const Akonadi::Item&, const Akonadi::Collection& ) ),\n q, SLOT( itemAdded( const Akonadi::Item&, const Akonadi::Collection& ) ) );\n q->connect( monitor, SIGNAL( itemChanged( const Akonadi::Item&, const QStringList& ) ),\n q, SLOT( itemChanged( const Akonadi::Item&, const QStringList& ) ) );\n q->connect( monitor, SIGNAL( itemRemoved( const Akonadi::DataReference& ) ),\n q, SLOT( itemRemoved( const Akonadi::DataReference& ) ) );\n q->connect( monitor, SIGNAL(collectionAdded(Akonadi::Collection,Akonadi::Collection)),\n q, SLOT(collectionAdded(Akonadi::Collection,Akonadi::Collection)) );\n q->connect( monitor, SIGNAL( collectionChanged( const Akonadi::Collection& ) ),\n q, SLOT( collectionChanged( const Akonadi::Collection& ) ) );\n q->connect( monitor, SIGNAL( collectionRemoved( int, const QString& ) ),\n q, SLOT( collectionRemoved( int, const QString& ) ) );\n\n \/\/ initial configuration\n bool initialized = mSettings->value( QLatin1String( \"Agent\/Initialized\" ), false ).toBool();\n if ( !initialized ) {\n QTimer::singleShot( 0, q, SLOT(configure()) ); \/\/ finish construction first\n mSettings->setValue( QLatin1String( \"Agent\/Initialized\" ), true );\n }\n}\n\n\nAgentBase::AgentBase( const QString & id )\n : d_ptr( new AgentBasePrivate( this ) )\n{\n KCrash::init();\n \/\/ FIXME See above KCrash::setEmergencyMethod( ::crashHandler );\n sAgentBase = this;\n d_ptr->mId = id;\n d_ptr->init();\n}\n\nAgentBase::AgentBase( AgentBasePrivate* d, const QString &id ) :\n d_ptr( d )\n{\n KCrash::init();\n \/\/ FIXME See above KCrash::setEmergencyMethod( ::crashHandler );\n sAgentBase = this;\n d_ptr->mId = id;\n d_ptr->init();\n}\n\nAgentBase::~AgentBase()\n{\n delete d_ptr;\n}\n\nstatic char* sAppName = 0;\n\nQString AgentBase::parseArguments( int argc, char **argv )\n{\n QString identifier;\n if ( argc < 3 ) {\n kDebug( 5250 ) << \"Not enough arguments passed...\";\n exit( 1 );\n }\n\n for ( int i = 1; i < argc - 1; ++i ) {\n if ( QLatin1String( argv[ i ] ) == QLatin1String( \"--identifier\" ) )\n identifier = QLatin1String( argv[ i + 1 ] );\n }\n\n if ( identifier.isEmpty() ) {\n kDebug( 5250 ) << \"Identifier argument missing\";\n exit( 1 );\n }\n\n sAppName = qstrdup( identifier.toLatin1().constData() );\n KCmdLineArgs::init( argc, argv, sAppName, 0, ki18n(\"Akonadi Agent\"),\"0.1\" ,\n ki18n(\"Akonadi Agent\") );\n\n KCmdLineOptions options;\n options.add(\"identifier <argument>\", ki18n(\"Agent identifier\"));\n KCmdLineArgs::addCmdLineOptions( options );\n\n return identifier;\n}\n\nint AgentBase::init( AgentBase *r )\n{\n QApplication::setQuitOnLastWindowClosed( false );\n int rv = kapp->exec();\n delete r;\n delete[] sAppName;\n return rv;\n}\n\nvoid AgentBase::configure()\n{\n}\n\nvoid AgentBase::quit()\n{\n Q_D( AgentBase );\n aboutToQuit();\n\n if ( d->mSettings ) {\n d->monitor->setConfig( 0 );\n d->mSettings->sync();\n }\n\n QCoreApplication::exit( 0 );\n}\n\nvoid AgentBase::aboutToQuit()\n{\n}\n\nvoid AgentBase::cleanup()\n{\n Q_D( AgentBase );\n const QString fileName = d->mSettings->fileName();\n\n \/**\n * First destroy the settings object...\n *\/\n d->monitor->setConfig( 0 );\n delete d->mSettings;\n d->mSettings = 0;\n\n \/**\n * ... then remove the file from hd.\n *\/\n QFile::remove( fileName );\n\n QCoreApplication::exit( 0 );\n}\n\nvoid AgentBase::crashHandler( int signal )\n{\n \/**\n * If we retrieved a SIGINT or SIGTERM we close normally\n *\/\n if ( signal == SIGINT || signal == SIGTERM )\n quit();\n}\n\nQString AgentBase::identifier() const\n{\n return d_ptr->mId;\n}\n\nvoid AgentBase::itemAdded( const Item &item, const Collection &collection )\n{\n Q_UNUSED( item );\n Q_UNUSED( collection );\n}\n\nvoid AgentBase::itemChanged( const Item &item, const QStringList &partIdentifiers )\n{\n Q_UNUSED( item );\n Q_UNUSED( partIdentifiers );\n}\n\nvoid AgentBase::itemRemoved( const DataReference &ref )\n{\n Q_UNUSED( ref );\n}\n\nvoid AgentBase::collectionAdded( const Akonadi::Collection &collection, const Akonadi::Collection &parent )\n{\n Q_UNUSED( collection );\n}\n\nvoid AgentBase::collectionChanged( const Collection &collection )\n{\n Q_UNUSED( collection );\n}\n\nvoid AgentBase::collectionRemoved( int id, const QString &remoteId )\n{\n Q_UNUSED( id );\n Q_UNUSED( remoteId );\n}\n\nQSettings* AgentBase::settings()\n{\n return d_ptr->mSettings;\n}\n\nSession* AgentBase::session()\n{\n return d_ptr->session;\n}\n\nvoid AgentBase::warning( const QString& message )\n{\n Q_D( AgentBase );\n d->mTracer->warning( QString::fromLatin1( \"AgentBase(%1)\" ).arg( d->mId ), message );\n}\n\nvoid AgentBase::error( const QString& message )\n{\n Q_D( AgentBase );\n d->mTracer->error( QString::fromLatin1( \"AgentBase(%1)\" ).arg( d->mId ), message );\n}\n\nChangeRecorder * AgentBase::monitor() const\n{\n return d_ptr->monitor;\n}\n\n#include \"agent.moc\"\n#include \"agentbase.moc\"\n<commit_msg>Dirty hack to finally fix the \"notification don't work anymore after adding\/removing an agent\" bug.<commit_after>\/*\n This file is part of libakonadi.\n\n Copyright (c) 2006 Till Adam <adam@kde.org>\n Copyright (c) 2007 Volker Krause <vkrause@kde.org>\n Copyright (c) 2007 Bruno Virlet <bruno.virlet@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 \"agentbase.h\"\n#include \"agentbase_p.h\"\n\n#include \"agent.h\"\n#include \"kcrash.h\"\n#include \"agentadaptor.h\"\n#include \"monitor_p.h\"\n#include \"xdgbasedirs.h\"\n\n#include <libakonadi\/session.h>\n#include <libakonadi\/changerecorder.h>\n#include <libakonadi\/itemfetchjob.h>\n\n#include <kaboutdata.h>\n#include <kcmdlineargs.h>\n#include <kdebug.h>\n#include <klocale.h>\n\n#include <QtCore\/QDir>\n#include <QtCore\/QTimer>\n#include <QtGui\/QApplication>\n#include <QtDBus\/QtDBus>\n\n#include <signal.h>\n#include <stdlib.h>\n\nusing namespace Akonadi;\n\nstatic AgentBase *sAgentBase = 0;\n\n\/* FIXME Already defined in ResourceBase: which one to keep ?\nvoid crashHandler( int signal )\n{\n if ( sAgentBase )\n sAgentBase->crashHandler( signal );\n\n exit( 255 );\n}*\/\n\nAgentBasePrivate::AgentBasePrivate( AgentBase *parent )\n : q_ptr( parent ),\n mSettings( 0 )\n{\n}\n\nAgentBasePrivate::~AgentBasePrivate()\n{\n monitor->setConfig( 0 );\n delete mSettings;\n}\n\nvoid AgentBasePrivate::init()\n{\n Q_Q( AgentBase );\n mTracer = new org::kde::Akonadi::Tracer( QLatin1String( \"org.kde.Akonadi\" ), QLatin1String( \"\/tracing\" ),\n QDBusConnection::sessionBus(), q );\n\n if ( !QDBusConnection::sessionBus().registerService( QLatin1String( \"org.kde.Akonadi.Agent.\" ) + mId ) )\n q->error( QString::fromLatin1( \"Unable to register service at dbus: %1\" ).arg( QDBusConnection::sessionBus().lastError().message() ) );\n\n new AgentAdaptor( q );\n if ( !QDBusConnection::sessionBus().registerObject( QLatin1String( \"\/\" ), q, QDBusConnection::ExportAdaptors ) )\n q->error( QString::fromLatin1( \"Unable to register object at dbus: %1\" ).arg( QDBusConnection::sessionBus().lastError().message() ) );\n\n mSettings = new QSettings( QString::fromLatin1( \"%1\/agent_config_%2\" ).arg( XdgBaseDirs::saveDir( \"config\", QLatin1String( \"akonadi\" ) ), mId ), QSettings::IniFormat );\n\n session = new Session( mId.toLatin1(), q );\n monitor = new ChangeRecorder( q );\n monitor->ignoreSession( session );\n monitor->setConfig( mSettings );\n\n q->connect( monitor, SIGNAL( itemAdded( const Akonadi::Item&, const Akonadi::Collection& ) ),\n q, SLOT( itemAdded( const Akonadi::Item&, const Akonadi::Collection& ) ) );\n q->connect( monitor, SIGNAL( itemChanged( const Akonadi::Item&, const QStringList& ) ),\n q, SLOT( itemChanged( const Akonadi::Item&, const QStringList& ) ) );\n q->connect( monitor, SIGNAL( itemRemoved( const Akonadi::DataReference& ) ),\n q, SLOT( itemRemoved( const Akonadi::DataReference& ) ) );\n q->connect( monitor, SIGNAL(collectionAdded(Akonadi::Collection,Akonadi::Collection)),\n q, SLOT(collectionAdded(Akonadi::Collection,Akonadi::Collection)) );\n q->connect( monitor, SIGNAL( collectionChanged( const Akonadi::Collection& ) ),\n q, SLOT( collectionChanged( const Akonadi::Collection& ) ) );\n q->connect( monitor, SIGNAL( collectionRemoved( int, const QString& ) ),\n q, SLOT( collectionRemoved( int, const QString& ) ) );\n\n \/\/ initial configuration\n bool initialized = mSettings->value( QLatin1String( \"Agent\/Initialized\" ), false ).toBool();\n if ( !initialized ) {\n QTimer::singleShot( 0, q, SLOT(configure()) ); \/\/ finish construction first\n mSettings->setValue( QLatin1String( \"Agent\/Initialized\" ), true );\n }\n}\n\n\nAgentBase::AgentBase( const QString & id )\n : d_ptr( new AgentBasePrivate( this ) )\n{\n KCrash::init();\n \/\/ FIXME See above KCrash::setEmergencyMethod( ::crashHandler );\n sAgentBase = this;\n d_ptr->mId = id;\n d_ptr->init();\n}\n\nAgentBase::AgentBase( AgentBasePrivate* d, const QString &id ) :\n d_ptr( d )\n{\n KCrash::init();\n \/\/ FIXME See above KCrash::setEmergencyMethod( ::crashHandler );\n sAgentBase = this;\n d_ptr->mId = id;\n d_ptr->init();\n}\n\nAgentBase::~AgentBase()\n{\n delete d_ptr;\n}\n\nstatic char* sAppName = 0;\n\nQString AgentBase::parseArguments( int argc, char **argv )\n{\n QString identifier;\n if ( argc < 3 ) {\n kDebug( 5250 ) << \"Not enough arguments passed...\";\n exit( 1 );\n }\n\n for ( int i = 1; i < argc - 1; ++i ) {\n if ( QLatin1String( argv[ i ] ) == QLatin1String( \"--identifier\" ) )\n identifier = QLatin1String( argv[ i + 1 ] );\n }\n\n if ( identifier.isEmpty() ) {\n kDebug( 5250 ) << \"Identifier argument missing\";\n exit( 1 );\n }\n\n sAppName = qstrdup( identifier.toLatin1().constData() );\n KCmdLineArgs::init( argc, argv, sAppName, 0, ki18n(\"Akonadi Agent\"),\"0.1\" ,\n ki18n(\"Akonadi Agent\") );\n\n KCmdLineOptions options;\n options.add(\"identifier <argument>\", ki18n(\"Agent identifier\"));\n KCmdLineArgs::addCmdLineOptions( options );\n\n return identifier;\n}\n\nint AgentBase::init( AgentBase *r )\n{\n QApplication::setQuitOnLastWindowClosed( false );\n int rv = kapp->exec();\n delete r;\n delete[] sAppName;\n return rv;\n}\n\nvoid AgentBase::configure()\n{\n}\n\nvoid AgentBase::quit()\n{\n Q_D( AgentBase );\n aboutToQuit();\n\n if ( d->mSettings ) {\n d->monitor->setConfig( 0 );\n d->mSettings->sync();\n }\n\n QCoreApplication::exit( 0 );\n}\n\nvoid AgentBase::aboutToQuit()\n{\n}\n\nvoid AgentBase::cleanup()\n{\n Q_D( AgentBase );\n const QString fileName = d->mSettings->fileName();\n\n \/**\n * First destroy the settings object...\n *\/\n d->monitor->setConfig( 0 );\n delete d->mSettings;\n d->mSettings = 0;\n\n \/**\n * ... then remove the file from hd.\n *\/\n QFile::remove( fileName );\n\n \/\/ ### HACK FIXME\n \/\/ Using QCoreApplication::quit() breaks change notifications\n \/\/ for some clients\/agents, no idea why\n\/\/ QCoreApplication::quit();\n exit( 0 );\n}\n\nvoid AgentBase::crashHandler( int signal )\n{\n \/**\n * If we retrieved a SIGINT or SIGTERM we close normally\n *\/\n if ( signal == SIGINT || signal == SIGTERM )\n quit();\n}\n\nQString AgentBase::identifier() const\n{\n return d_ptr->mId;\n}\n\nvoid AgentBase::itemAdded( const Item &item, const Collection &collection )\n{\n Q_UNUSED( item );\n Q_UNUSED( collection );\n}\n\nvoid AgentBase::itemChanged( const Item &item, const QStringList &partIdentifiers )\n{\n Q_UNUSED( item );\n Q_UNUSED( partIdentifiers );\n}\n\nvoid AgentBase::itemRemoved( const DataReference &ref )\n{\n Q_UNUSED( ref );\n}\n\nvoid AgentBase::collectionAdded( const Akonadi::Collection &collection, const Akonadi::Collection &parent )\n{\n Q_UNUSED( collection );\n}\n\nvoid AgentBase::collectionChanged( const Collection &collection )\n{\n Q_UNUSED( collection );\n}\n\nvoid AgentBase::collectionRemoved( int id, const QString &remoteId )\n{\n Q_UNUSED( id );\n Q_UNUSED( remoteId );\n}\n\nQSettings* AgentBase::settings()\n{\n return d_ptr->mSettings;\n}\n\nSession* AgentBase::session()\n{\n return d_ptr->session;\n}\n\nvoid AgentBase::warning( const QString& message )\n{\n Q_D( AgentBase );\n d->mTracer->warning( QString::fromLatin1( \"AgentBase(%1)\" ).arg( d->mId ), message );\n}\n\nvoid AgentBase::error( const QString& message )\n{\n Q_D( AgentBase );\n d->mTracer->error( QString::fromLatin1( \"AgentBase(%1)\" ).arg( d->mId ), message );\n}\n\nChangeRecorder * AgentBase::monitor() const\n{\n return d_ptr->monitor;\n}\n\n#include \"agent.moc\"\n#include \"agentbase.moc\"\n<|endoftext|>"} {"text":"<commit_before>#include \"movegen.h\"\n#include \"board.h\"\n#include \"defs.h\"\n#include <iostream>\n\nMoveGen::MoveGen(Board board) {\n setBoard(board);\n}\n\nMoveGen::MoveGen() {\n Board board;\n setBoard(board);\n}\n\nvoid MoveGen::setBoard(Board board) {\n _moves = MoveList();\n _board = board;\n genMoves();\n}\n\nMoveList MoveGen::getMoves() {\n return _moves;\n}\n\nvoid MoveGen::genMoves() {\n if (_board.WHITE_TO_MOVE) {\n genWhiteMoves();\n } else {\n genBlackMoves();\n }\n}\n\nvoid MoveGen::genWhiteMoves() {\n genWhitePawnMoves();\n genWhiteRookMoves();\n genWhiteKnightMoves();\n genWhiteBishopMoves();\n genWhiteKingMoves();\n genWhiteQueenMoves();\n}\n\nvoid MoveGen::genBlackMoves() {\n genBlackPawnMoves();\n genBlackRookMoves();\n genBlackKnightMoves();\n genBlackBishopMoves();\n genBlackKingMoves();\n genBlackQueenMoves();\n}\n\nvoid MoveGen::printMoves() {\n for(auto move : getMoves()) {\n std::cout << move.getNotation() << std::endl;\n }\n}\n\nvoid MoveGen::genPawnPromotions(unsigned int from, unsigned int to, unsigned int flags) {\n _moves.push_back(CMove(from, to, flags | CMove::QUEEN_PROMOTION));\n _moves.push_back(CMove(from, to, flags | CMove::KNIGHT_PROMOTION));\n _moves.push_back(CMove(from, to, flags | CMove::ROOK_PROMOTION));\n _moves.push_back(CMove(from, to, flags | CMove::BISHOP_PROMOTION));\n}\n\nvoid MoveGen::genWhitePawnMoves() {\n U64 movedPawns1 = _board.WHITE_PAWNS << 8;\n U64 movedPawns2 = (_board.WHITE_PAWNS & RANK_2) << 16;\n\n U64 leftAttacks = (_board.WHITE_PAWNS << 7) & (~FILE_H);\n U64 rightAttacks = (_board.WHITE_PAWNS << 9) & (~FILE_A);\n\n U64 attackablePieces = _board.BLACK_ATTACKABLE | _board.EN_PASSANT;\n\n for(U64 i=0;i<64;i++) {\n U64 square = static_cast<U64>(1) << i;\n\n if ((movedPawns1 & square) && (square & _board.NOT_OCCUPIED)) {\n if (square & RANK_8) {\n genPawnPromotions(i-8, i);\n } else {\n _moves.push_back(CMove(i-8, i));\n }\n }\n\n if ((movedPawns2 & square) && (square & _board.NOT_OCCUPIED) && ((square >> 8) & _board.NOT_OCCUPIED)) {\n _moves.push_back(CMove(i-16, i));\n }\n\n if ((leftAttacks & square) && (square & attackablePieces)) {\n if (square & RANK_8) {\n genPawnPromotions(i-7, i, CMove::CAPTURE);\n } else {\n _moves.push_back(CMove(i-7, i, CMove::CAPTURE));\n }\n }\n\n if ((rightAttacks & square) && (square & attackablePieces)) {\n if (square & RANK_8) {\n genPawnPromotions(i-9, i, CMove::CAPTURE);\n } else {\n _moves.push_back(CMove(i-9, i, CMove::CAPTURE));\n }\n }\n }\n}\n\nvoid MoveGen::genBlackPawnMoves() {\n U64 movedPawns1 = _board.BLACK_PAWNS >> 8;\n U64 movedPawns2 = (_board.BLACK_PAWNS & RANK_7) >> 16;\n\n U64 leftAttacks = (_board.BLACK_PAWNS >> 9) & (~FILE_H);\n U64 rightAttacks = (_board.BLACK_PAWNS >> 7) & (~FILE_A);\n\n U64 attackablePieces = _board.WHITE_ATTACKABLE | _board.EN_PASSANT;\n\n for(U64 i=0;i<64;i++) {\n U64 square = static_cast<U64>(1) << i;\n\n if ((movedPawns1 & square) && (square & _board.NOT_OCCUPIED)) {\n if (square & RANK_1) {\n genPawnPromotions(i+8, i);\n } else {\n _moves.push_back(CMove(i+8, i));\n }\n }\n\n if ((movedPawns2 & square) && (square & _board.NOT_OCCUPIED) && ((square << 8) & _board.NOT_OCCUPIED)) {\n _moves.push_back(CMove(i+16, i));\n }\n\n\n if ((leftAttacks & square) && (square & attackablePieces)) {\n if (square & RANK_1) {\n genPawnPromotions(i+9, i, CMove::CAPTURE);\n } else {\n _moves.push_back(CMove(i+9, i, CMove::CAPTURE));\n }\n }\n\n if ((rightAttacks & square) && (square & attackablePieces)) {\n if (square & RANK_1) {\n genPawnPromotions(i+7, i, CMove::CAPTURE);\n } else {\n _moves.push_back(CMove(i+7, i, CMove::CAPTURE));\n }\n }\n }\n}\n\nvoid MoveGen::genWhiteKingMoves() {\n genKingMoves(_board.WHITE_KING, _board.WHITE_PIECES, _board.BLACK_ATTACKABLE);\n\n if (_board.whiteCanCastleKs()) {\n _moves.push_back(CMove(e1, g1, CMove::KSIDE_CASTLE));\n }\n if (_board.whiteCanCastleQs()) {\n _moves.push_back(CMove(e1, b1, CMove::QSIDE_CASTLE));\n }\n}\n\nvoid MoveGen::genBlackKingMoves() {\n genKingMoves(_board.BLACK_KING, _board.BLACK_PIECES, _board.WHITE_ATTACKABLE);\n\n if (_board.blackCanCastleKs()) {\n _moves.push_back(CMove(e8, h8, CMove::KSIDE_CASTLE));\n }\n if (_board.blackCanCastleQs()) {\n _moves.push_back(CMove(e8, c8, CMove::QSIDE_CASTLE));\n }\n}\n\nvoid MoveGen::genKingMoves(U64 king, U64 own, U64 attackable) {\n if (king == 0) {\n return;\n }\n\n int kingIndex = __builtin_ffsll(king) - 1;\n\n U64 moves = _board.getKingAttacksForSquare(kingIndex, own);\n\n addMoves(kingIndex, moves, attackable);\n}\n\nvoid MoveGen::genWhiteKnightMoves() {\n genKnightMoves(_board.WHITE_KNIGHTS, _board.WHITE_PIECES, _board.BLACK_ATTACKABLE);\n}\n\nvoid MoveGen::genBlackKnightMoves() {\n genKnightMoves(_board.BLACK_KNIGHTS, _board.BLACK_PIECES, _board.WHITE_ATTACKABLE);\n}\n\nvoid MoveGen::genKnightMoves(U64 knights, U64 own, U64 attackable) {\n for(int from=0;from<64;from++) {\n U64 fromSquare = static_cast<U64>(1) << from;\n if ((fromSquare & knights) == 0) {\n continue;\n }\n\n U64 moves = _board.getKnightAttacksForSquare(from, own);\n\n addMoves(from, moves, attackable);\n }\n}\n\nvoid MoveGen::genWhiteBishopMoves() {\n genBishopMoves(_board.WHITE_BISHOPS, _board.WHITE_PIECES, _board.BLACK_PIECES);\n}\n\nvoid MoveGen::genBlackBishopMoves() {\n genBishopMoves(_board.BLACK_BISHOPS, _board.BLACK_PIECES, _board.BLACK_PIECES);\n}\n\nvoid MoveGen::genBishopMoves(U64 bishops, U64 own, U64 attackable) {\n for(int from=0;from<64;from++) {\n U64 fromSquare = U64(1) << from;\n if((fromSquare & bishops) == 0) {\n continue;\n }\n\n U64 moves = _board.getBishopAttacksForSquare(from, own);\n\n addMoves(from, moves, attackable);\n }\n}\n\nvoid MoveGen::genWhiteRookMoves() {\n genRookMoves(_board.WHITE_ROOKS, _board.WHITE_PIECES, _board.BLACK_ATTACKABLE);\n}\n\nvoid MoveGen::genBlackRookMoves() {\n genRookMoves(_board.BLACK_ROOKS, _board.BLACK_PIECES, _board.WHITE_ATTACKABLE);\n}\n\nvoid MoveGen::genRookMoves(U64 rooks, U64 own, U64 attackable) {\n for(int from=0;from<64;from++) {\n U64 fromSquare = U64(1) << from;\n if((fromSquare & rooks) == 0) {\n continue;\n }\n\n U64 moves = _board.getRookAttacksForSquare(from, own);\n\n addMoves(from, moves, attackable);\n }\n}\n\nvoid MoveGen::genWhiteQueenMoves() {\n genQueenMoves(_board.WHITE_QUEENS, _board.WHITE_PIECES, _board.BLACK_ATTACKABLE);\n}\n\nvoid MoveGen::genBlackQueenMoves() {\n genQueenMoves(_board.BLACK_QUEENS, _board.BLACK_PIECES, _board.WHITE_ATTACKABLE);\n}\n\nvoid MoveGen::genQueenMoves(U64 queens, U64 own, U64 attackable) {\n for(int from=0;from<64;from++) {\n U64 fromSquare = U64(1) << from;\n if((fromSquare & queens) == 0) {\n continue;\n }\n\n U64 moves = _board.getQueenAttacksForSquare(from, own);\n\n addMoves(from, moves, attackable);\n }\n}\n\nvoid MoveGen::addMoves(int from, U64 moves, U64 attackable) {\n for(int to=0;to<64;to++) {\n U64 toSquare = U64(1) << to;\n if ((toSquare & moves) == 0) {\n continue;\n }\n\n \/\/ Ignore any moves to squares occupied by kings\n if ((toSquare & (_board.WHITE_KING | _board.BLACK_KING))) {\n continue;\n }\n\n if(toSquare & attackable) {\n _moves.push_back(CMove(from, to, CMove::CAPTURE));\n } else {\n _moves.push_back(CMove(from, to));\n }\n }\n}\n<commit_msg>Fix pieces attacking kings<commit_after>#include \"movegen.h\"\n#include \"board.h\"\n#include \"defs.h\"\n#include <iostream>\n\nMoveGen::MoveGen(Board board) {\n setBoard(board);\n}\n\nMoveGen::MoveGen() {\n Board board;\n setBoard(board);\n}\n\nvoid MoveGen::setBoard(Board board) {\n _moves = MoveList();\n _board = board;\n genMoves();\n}\n\nMoveList MoveGen::getMoves() {\n return _moves;\n}\n\nvoid MoveGen::genMoves() {\n if (_board.WHITE_TO_MOVE) {\n genWhiteMoves();\n } else {\n genBlackMoves();\n }\n}\n\nvoid MoveGen::genWhiteMoves() {\n genWhitePawnMoves();\n genWhiteRookMoves();\n genWhiteKnightMoves();\n genWhiteBishopMoves();\n genWhiteKingMoves();\n genWhiteQueenMoves();\n}\n\nvoid MoveGen::genBlackMoves() {\n genBlackPawnMoves();\n genBlackRookMoves();\n genBlackKnightMoves();\n genBlackBishopMoves();\n genBlackKingMoves();\n genBlackQueenMoves();\n}\n\nvoid MoveGen::printMoves() {\n for(auto move : getMoves()) {\n std::cout << move.getNotation() << std::endl;\n }\n}\n\nvoid MoveGen::genPawnPromotions(unsigned int from, unsigned int to, unsigned int flags) {\n _moves.push_back(CMove(from, to, flags | CMove::QUEEN_PROMOTION));\n _moves.push_back(CMove(from, to, flags | CMove::KNIGHT_PROMOTION));\n _moves.push_back(CMove(from, to, flags | CMove::ROOK_PROMOTION));\n _moves.push_back(CMove(from, to, flags | CMove::BISHOP_PROMOTION));\n}\n\nvoid MoveGen::genWhitePawnMoves() {\n U64 movedPawns1 = _board.WHITE_PAWNS << 8;\n U64 movedPawns2 = (_board.WHITE_PAWNS & RANK_2) << 16;\n\n U64 leftAttacks = (_board.WHITE_PAWNS << 7) & (~FILE_H);\n U64 rightAttacks = (_board.WHITE_PAWNS << 9) & (~FILE_A);\n\n U64 attackablePieces = _board.BLACK_ATTACKABLE | _board.EN_PASSANT;\n\n for(U64 i=0;i<64;i++) {\n U64 square = static_cast<U64>(1) << i;\n\n if ((movedPawns1 & square) && (square & _board.NOT_OCCUPIED)) {\n if (square & RANK_8) {\n genPawnPromotions(i-8, i);\n } else {\n _moves.push_back(CMove(i-8, i));\n }\n }\n\n if ((movedPawns2 & square) && (square & _board.NOT_OCCUPIED) && ((square >> 8) & _board.NOT_OCCUPIED)) {\n _moves.push_back(CMove(i-16, i));\n }\n\n if ((leftAttacks & square) && (square & attackablePieces)) {\n if (square & RANK_8) {\n genPawnPromotions(i-7, i, CMove::CAPTURE);\n } else {\n _moves.push_back(CMove(i-7, i, CMove::CAPTURE));\n }\n }\n\n if ((rightAttacks & square) && (square & attackablePieces)) {\n if (square & RANK_8) {\n genPawnPromotions(i-9, i, CMove::CAPTURE);\n } else {\n _moves.push_back(CMove(i-9, i, CMove::CAPTURE));\n }\n }\n }\n}\n\nvoid MoveGen::genBlackPawnMoves() {\n U64 movedPawns1 = _board.BLACK_PAWNS >> 8;\n U64 movedPawns2 = (_board.BLACK_PAWNS & RANK_7) >> 16;\n\n U64 leftAttacks = (_board.BLACK_PAWNS >> 9) & (~FILE_H);\n U64 rightAttacks = (_board.BLACK_PAWNS >> 7) & (~FILE_A);\n\n U64 attackablePieces = _board.WHITE_ATTACKABLE | _board.EN_PASSANT;\n\n for(U64 i=0;i<64;i++) {\n U64 square = static_cast<U64>(1) << i;\n\n if ((movedPawns1 & square) && (square & _board.NOT_OCCUPIED)) {\n if (square & RANK_1) {\n genPawnPromotions(i+8, i);\n } else {\n _moves.push_back(CMove(i+8, i));\n }\n }\n\n if ((movedPawns2 & square) && (square & _board.NOT_OCCUPIED) && ((square << 8) & _board.NOT_OCCUPIED)) {\n _moves.push_back(CMove(i+16, i));\n }\n\n\n if ((leftAttacks & square) && (square & attackablePieces)) {\n if (square & RANK_1) {\n genPawnPromotions(i+9, i, CMove::CAPTURE);\n } else {\n _moves.push_back(CMove(i+9, i, CMove::CAPTURE));\n }\n }\n\n if ((rightAttacks & square) && (square & attackablePieces)) {\n if (square & RANK_1) {\n genPawnPromotions(i+7, i, CMove::CAPTURE);\n } else {\n _moves.push_back(CMove(i+7, i, CMove::CAPTURE));\n }\n }\n }\n}\n\nvoid MoveGen::genWhiteKingMoves() {\n genKingMoves(_board.WHITE_KING, _board.WHITE_PIECES, _board.BLACK_ATTACKABLE);\n\n if (_board.whiteCanCastleKs()) {\n _moves.push_back(CMove(e1, g1, CMove::KSIDE_CASTLE));\n }\n if (_board.whiteCanCastleQs()) {\n _moves.push_back(CMove(e1, b1, CMove::QSIDE_CASTLE));\n }\n}\n\nvoid MoveGen::genBlackKingMoves() {\n genKingMoves(_board.BLACK_KING, _board.BLACK_PIECES, _board.WHITE_ATTACKABLE);\n\n if (_board.blackCanCastleKs()) {\n _moves.push_back(CMove(e8, h8, CMove::KSIDE_CASTLE));\n }\n if (_board.blackCanCastleQs()) {\n _moves.push_back(CMove(e8, c8, CMove::QSIDE_CASTLE));\n }\n}\n\nvoid MoveGen::genKingMoves(U64 king, U64 own, U64 attackable) {\n if (king == 0) {\n return;\n }\n\n int kingIndex = __builtin_ffsll(king) - 1;\n\n U64 moves = _board.getKingAttacksForSquare(kingIndex, own);\n\n addMoves(kingIndex, moves, attackable);\n}\n\nvoid MoveGen::genWhiteKnightMoves() {\n genKnightMoves(_board.WHITE_KNIGHTS, _board.WHITE_PIECES, _board.BLACK_ATTACKABLE);\n}\n\nvoid MoveGen::genBlackKnightMoves() {\n genKnightMoves(_board.BLACK_KNIGHTS, _board.BLACK_PIECES, _board.WHITE_ATTACKABLE);\n}\n\nvoid MoveGen::genKnightMoves(U64 knights, U64 own, U64 attackable) {\n for(int from=0;from<64;from++) {\n U64 fromSquare = static_cast<U64>(1) << from;\n if ((fromSquare & knights) == 0) {\n continue;\n }\n\n U64 moves = _board.getKnightAttacksForSquare(from, own);\n\n addMoves(from, moves, attackable);\n }\n}\n\nvoid MoveGen::genWhiteBishopMoves() {\n genBishopMoves(_board.WHITE_BISHOPS, _board.WHITE_PIECES, _board.BLACK_ATTACKABLE);\n}\n\nvoid MoveGen::genBlackBishopMoves() {\n genBishopMoves(_board.BLACK_BISHOPS, _board.BLACK_PIECES, _board.WHITE_ATTACKABLE);\n}\n\nvoid MoveGen::genBishopMoves(U64 bishops, U64 own, U64 attackable) {\n for(int from=0;from<64;from++) {\n U64 fromSquare = U64(1) << from;\n if((fromSquare & bishops) == 0) {\n continue;\n }\n\n U64 moves = _board.getBishopAttacksForSquare(from, own);\n\n addMoves(from, moves, attackable);\n }\n}\n\nvoid MoveGen::genWhiteRookMoves() {\n genRookMoves(_board.WHITE_ROOKS, _board.WHITE_PIECES, _board.BLACK_ATTACKABLE);\n}\n\nvoid MoveGen::genBlackRookMoves() {\n genRookMoves(_board.BLACK_ROOKS, _board.BLACK_PIECES, _board.WHITE_ATTACKABLE);\n}\n\nvoid MoveGen::genRookMoves(U64 rooks, U64 own, U64 attackable) {\n for(int from=0;from<64;from++) {\n U64 fromSquare = U64(1) << from;\n if((fromSquare & rooks) == 0) {\n continue;\n }\n\n U64 moves = _board.getRookAttacksForSquare(from, own);\n\n addMoves(from, moves, attackable);\n }\n}\n\nvoid MoveGen::genWhiteQueenMoves() {\n genQueenMoves(_board.WHITE_QUEENS, _board.WHITE_PIECES, _board.BLACK_ATTACKABLE);\n}\n\nvoid MoveGen::genBlackQueenMoves() {\n genQueenMoves(_board.BLACK_QUEENS, _board.BLACK_PIECES, _board.WHITE_ATTACKABLE);\n}\n\nvoid MoveGen::genQueenMoves(U64 queens, U64 own, U64 attackable) {\n for(int from=0;from<64;from++) {\n U64 fromSquare = U64(1) << from;\n if((fromSquare & queens) == 0) {\n continue;\n }\n\n U64 moves = _board.getQueenAttacksForSquare(from, own);\n\n addMoves(from, moves, attackable);\n }\n}\n\nvoid MoveGen::addMoves(int from, U64 moves, U64 attackable) {\n for(int to=0;to<64;to++) {\n U64 toSquare = U64(1) << to;\n if ((toSquare & moves) == 0) {\n continue;\n }\n\n \/\/ Ignore any moves to squares occupied by kings\n if ((toSquare & (_board.WHITE_KING | _board.BLACK_KING))) {\n continue;\n }\n\n if(toSquare & attackable) {\n _moves.push_back(CMove(from, to, CMove::CAPTURE));\n } else {\n _moves.push_back(CMove(from, to));\n }\n }\n}\n<|endoftext|>"} {"text":"<commit_before>#include <iostream>\n#include <fstream>\n#include <string>\n#include <vector>\n#include <typeinfo>\n#include <cstdlib>\n#include <stdlib.h>\n#include \"Persona.h\"\n#include \"Administrador.h\"\n#include \"Repartidor.h\"\n#include \"Baraja.h\"\n#include \"Carta.h\"\n#include \"Jugador.h\"\n#include \"Mesa.h\"\n\nusing namespace std;\n\nint main(){\n\tvector<Persona*> vPersona;\n\tvector<Mesa*> vMesa;\n\tAdministrador* adminDefecto=new Administrador(\"admin\",23,\"1234\",5,\"Gerente Tiempo Completo\",10000);\n\tvPersona.push_back(adminDefecto);\n\tbool salir=false;\n\tdo{\n\t\/\/Login\n\t\tPersona* personaActual;\n\t\tstring Nombre;\n\t\tstring ID;\n\t\tcout<<\"Bienvenido al programa.\"<<endl;\n\t\tcout<<\"Ingrese (salir) en nombre o identidad para salir\"<<endl;\n\t\tcout<<\"Ingrese nombre: \";\n\t\tcin>>Nombre;\n\t\tcout<<\"Ingrese identidad: \";\n\t\tcin>>ID;\n\t\tif (Nombre.compare(\"salir\")==0||ID.compare(\"salir\")==0){\n\t\t\tbreak;\n\t\t}\n\t\tbool existeUsuario=false;\n\t\tfor (int i = 0; i < vPersona.size(); ++i){\n\t\t\tif (Nombre.compare(vPersona[i]->getNombre())==0){\n\t\t\t\tif (ID.compare(vPersona[i]->getID())==0){\n\t\t\t\t\tpersonaActual=vPersona[i];\n\t\t\t\t\texisteUsuario=true;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tif (existeUsuario==false){\n\t\t\tcout<<\"No existe el usuario\"<<endl;\n\t\t}\n\t\t\/\/Si es un administrador\n\t\tif (personaActual->getTipo().compare(\"Administrador\")==0){\n\t\t\tint opcMenu;\n\t\t\tdo{\n\t\t\t\tcout<<\"Menú\"<<endl;\n\t\t\t\tcout<<\"1. Agregar\"<<endl;\n\t\t\t\tcout<<\"2. Listar\"<<endl;\n\t\t\t\tcout<<\"3. Modificar\"<<endl;\n\t\t\t\tcout<<\"4. Eliminar\"<<endl;\n\t\t\t\tcout<<\"5. Salir\"<<endl;\n\t\t\t\tcout<<\"Ingrese opción: \"<<endl;\n\t\t\t\tcin>>opcMenu;\n\t\t\t\tswitch(opcMenu){\n\t\t\t\t\tcase 1:{\n\t\t\t\t\t\tcout<<\"Menú agregar\"<<endl;\n\t\t\t\t\t\tcout<<\"1. Administrador\"<<endl;\n\t\t\t\t\t\tcout<<\"2. Repartidor\"<<endl;\n\t\t\t\t\t\tcout<<\"3. Jugador\"<<endl;\n\t\t\t\t\t\tcout<<\"4. Mesa\"<<endl;\n\t\t\t\t\t\tint opcAgregar;\n\t\t\t\t\t\tcout<<\"Ingrese la opción: \";\n\t\t\t\t\t\tcin>>opcAgregar;\n\t\t\t\t\t\tswitch(opcAgregar){\n\t\t\t\t\t\t\tcase 1:{\n\t\t\t\t\t\t\t\tstring nombre;\n\t\t\t\t\t\t\t\tcout<<\"Ingrese nombre: \";\n\t\t\t\t\t\t\t\tcin>>nombre;\n\t\t\t\t\t\t\t\tint edad;\n\t\t\t\t\t\t\t\tcout<<\"Ingrese edad: \";\n\t\t\t\t\t\t\t\tcin>>edad;\n\t\t\t\t\t\t\t\tstring id;\n\t\t\t\t\t\t\t\tcout<<\"Ingrese id: \";\n\t\t\t\t\t\t\t\tcin>>id;\n\t\t\t\t\t\t\t\tint experiencia;\n\t\t\t\t\t\t\t\tcout<<\"Ingrese experiencia: \";\n\t\t\t\t\t\t\t\tcin>>experiencia;\n\t\t\t\t\t\t\t\tstring rango;\n\t\t\t\t\t\t\t\tcout<<\"Ingrese rango: \";\n\t\t\t\t\t\t\t\tcin>>rango;\n\t\t\t\t\t\t\t\tdouble sueldo;\n\t\t\t\t\t\t\t\tcout<<\"Ingrese sueldo: \";\n\t\t\t\t\t\t\t\tcin>>sueldo;\n\t\t\t\t\t\t\t\tAdministrador* temporal=new Administrador(nombre,edad,id,experiencia,rango,sueldo);\n\t\t\t\t\t\t\t\tvPersona.push_back(temporal);\n\t\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\tcase 2:{\n\t\t\t\t\t\t\t\tstring nombre;\n\t\t\t\t\t\t\t\tcout<<\"Ingrese nombre: \";\n\t\t\t\t\t\t\t\tcin>>nombre;\n\t\t\t\t\t\t\t\tint edad;\n\t\t\t\t\t\t\t\tcout<<\"Ingrese edad: \";\n\t\t\t\t\t\t\t\tcin>>edad;\n\t\t\t\t\t\t\t\tstring id;\n\t\t\t\t\t\t\t\tcout<<\"Ingrese id: \";\n\t\t\t\t\t\t\t\tcin>>id;\n\t\t\t\t\t\t\t\tdouble dificultad;\n\t\t\t\t\t\t\t\tcout<<\"Ingrese dificultad: \";\n\t\t\t\t\t\t\t\tcin>>dificultad;\n\t\t\t\t\t\t\t\tRepartidor* temporal=new Repartidor(nombre,edad,id,dificultad);\n\t\t\t\t\t\t\t\tvPersona.push_back(temporal);\n\t\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\tcase 3:{\n\t\t\t\t\t\t\t\tstring nombre;\n\t\t\t\t\t\t\t\tcout<<\"Ingrese nombre: \";\n\t\t\t\t\t\t\t\tcin>>nombre;\n\t\t\t\t\t\t\t\tint edad;\n\t\t\t\t\t\t\t\tcout<<\"Ingrese edad: \";\n\t\t\t\t\t\t\t\tcin>>edad;\n\t\t\t\t\t\t\t\tstring id;\n\t\t\t\t\t\t\t\tcout<<\"Ingrese id: \";\n\t\t\t\t\t\t\t\tcin>>id;\n\t\t\t\t\t\t\t\tstring procedencia;\n\t\t\t\t\t\t\t\tcout<<\"Ingrese procedencia: \";\n\t\t\t\t\t\t\t\tcin>>procedencia;\n\t\t\t\t\t\t\t\tstring apodo;\n\t\t\t\t\t\t\t\tcout<<\"Ingrese apodo: \";\n\t\t\t\t\t\t\t\tcin>>apodo;\n\t\t\t\t\t\t\t\tdouble dinero;\n\t\t\t\t\t\t\t\tcout<<\"Ingrese dinero: \";\n\t\t\t\t\t\t\t\tcin>>dinero;\n\t\t\t\t\t\t\t\tJugador* temporal=new Jugador(nombre,edad,id,procedencia,apodo,dinero);\n\t\t\t\t\t\t\t\tvPersona.push_back(temporal);\n\t\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\tcase 4:{\n\t\t\t\t\t\t\t\tint numero;\n\t\t\t\t\t\t\t\tcout<<\"Ingrese numero de mesa: \";\n\t\t\t\t\t\t\t\tcin>>numero;\n\t\t\t\t\t\t\t\tstring tipo;\n\t\t\t\t\t\t\t\tcout<<\"Ingrese tipo (vip,clasica,viajero): \";\n\t\t\t\t\t\t\t\tcin>>tipo;\n\t\t\t\t\t\t\t\tint pos;\n\t\t\t\t\t\t\t\tMesa* temporal=new Mesa(numero,tipo);\n\t\t\t\t\t\t\t\tdo{\n\t\t\t\t\t\t\t\t\tfor(int i=0;i<vPersona.size();i++){\n\t\t\t\t\t\t\t\t\t\tif (vPersona[i]->getTipo().compare(\"Jugador\")==0){\n\t\t\t\t\t\t\t\t\t\t\tcout<<\"Nombre: \"<<\" = \"<<vPersona[i]->getNombre()<<endl;\n\t\t\t\t\t\t\t\t\t\t\tcout<<\"Edad: \"<<\" = \"<<vPersona[i]->getEdad()<<endl;\n\t\t\t\t\t\t\t\t\t\t\tcout<<\"ID: \"<<\" = \"<<vPersona[i]->getID()<<endl;\n\t\t\t\t\t\t\t\t\t\t\tJugador* temporal=dynamic_cast<Jugador*>(vPersona[i]);\n\t\t\t\t\t\t\t\t\t\t\tcout<<\"Procedencia: \"<<\" = \"<<temporal->getProcedencia()<<endl;\n\t\t\t\t\t\t\t\t\t\t\tcout<<\"Apodo: \"<<\" = \"<<temporal->getApodo()<<endl;\n\t\t\t\t\t\t\t\t\t\t\tcout<<\"Dinero: \"<<\" = \"<<temporal->getDinero()<<endl;\n\t\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t\tcout<<endl;\n\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\tint pos;\n\t\t\t\t\t\t\t\t\tcout<<\"Ingrese posicion del jugador o (-1) para salir: \";\n\t\t\t\t\t\t\t\t\tcin>>pos;\n\t\t\t\t\t\t\t\t\tJugador* jugadorTemporal=dynamic_cast<Jugador*>(vPersona[pos]);\n\t\t\t\t\t\t\t\t\ttemporal->Jugadores.push_back(jugadorTemporal);\n\t\t\t\t\t\t\t\t}while(pos!=-1);\n\t\t\t\t\t\t\t\tfor(int i=0;i<vPersona.size();i++){\n\t\t\t\t\t\t\t\t\tif (vPersona[i]->getTipo().compare(\"Repartidor\")==0){\n\t\t\t\t\t\t\t\t\t\tcout<<\"Nombre: \"<<\" = \"<<vPersona[i]->getNombre()<<endl;\n\t\t\t\t\t\t\t\t\t\tcout<<\"Edad: \"<<\" = \"<<vPersona[i]->getEdad()<<endl;\n\t\t\t\t\t\t\t\t\t\tcout<<\"ID: \"<<\" = \"<<vPersona[i]->getID()<<endl;\n\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\tcout<<endl;\n\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\tint pos1;\n\t\t\t\t\t\t\t\tcout<<\"Ingrese posicion del jugador: \";\n\t\t\t\t\t\t\t\tcin>>pos1;\n\t\t\t\t\t\t\t\tRepartidor* repartidorTemporal=dynamic_cast<Repartidor*>(vPersona[pos1]);\n\t\t\t\t\t\t\t\ttemporal->repartidor=repartidorTemporal;\n\t\t\t\t\t\t\t\tvMesa.push_back(temporal);\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\tbreak;\n\t\t\t\t\t}\/\/fin agregar\n\t\t\t\t\tcase 2:{\n\t\t\t\t\t\tcout<<\"Menú listar\"<<endl;\n\t\t\t\t\t\tcout<<\"1. Personas\"<<endl;\n\t\t\t\t\t\tcout<<\"2. Mesas\"<<endl;\n\t\t\t\t\t\tint opcListar;\n\t\t\t\t\t\tcout<<\"Ingrese la opción: \";\n\t\t\t\t\t\tcin>>opcListar;\n\t\t\t\t\t\tcout<<endl;\n\t\t\t\t\t\tswitch(opcListar){\n\t\t\t\t\t\t\tcase 1:{\n\t\t\t\t\t\t\t\tfor(int i=0;i<vPersona.size();i++){\n\t\t\t\t\t\t\t\t\tcout<<\"Nombre: \"<<\" = \"<<vPersona[i]->getNombre()<<endl;\n\t\t\t\t\t\t\t\t\tcout<<\"Edad: \"<<\" = \"<<vPersona[i]->getEdad()<<endl;\n\t\t\t\t\t\t\t\t\tcout<<\"ID: \"<<\" = \"<<vPersona[i]->getID()<<endl;\n\t\t\t\t\t\t\t\t\tif (vPersona[i]->getTipo().compare(\"Administrador\")==0){\n\t\t\t\t\t\t\t\t\t\tAdministrador* temporal=dynamic_cast<Administrador*>(vPersona[i]);\n\t\t\t\t\t\t\t\t\t\tcout<<\"Experiencia: \"<<\" = \"<<temporal->getExperiencia()<<endl;\n\t\t\t\t\t\t\t\t\t\tcout<<\"Rango: \"<<\" = \"<<temporal->getRango()<<endl;\n\t\t\t\t\t\t\t\t\t\tcout<<\"Sueldo: \"<<\" = \"<<temporal->getSueldo()<<endl; \n\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\tif (vPersona[i]->getTipo().compare(\"Repartidor\")==0){\n\t\t\t\t\t\t\t\t\t\tRepartidor* temporal=dynamic_cast<Repartidor*>(vPersona[i]);\n\t\t\t\t\t\t\t\t\t\tcout<<\"Dificultad: \"<<\" = \"<<temporal->getDificultad()<<endl;\n\t\t\t\t\t\t\t\t\t\tcout<<\"Dinero del casino: \"<<\" = \"<<temporal->getDineroCasino()<<endl;\n\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\tif (vPersona[i]->getTipo().compare(\"Jugador\")==0){\n\t\t\t\t\t\t\t\t\t\tJugador* temporal=dynamic_cast<Jugador*>(vPersona[i]);\n\t\t\t\t\t\t\t\t\t\tcout<<\"Procedencia: \"<<\" = \"<<temporal->getProcedencia()<<endl;\n\t\t\t\t\t\t\t\t\t\tcout<<\"Apodo: \"<<\" = \"<<temporal->getApodo()<<endl;\n\t\t\t\t\t\t\t\t\t\tcout<<\"Dinero: \"<<\" = \"<<temporal->getDinero()<<endl;\n\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\tcout<<endl;\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}\n\t\t\t\t\t\t\tcase 2:{\n\t\t\t\t\t\t\t\tfor(int i=0;i<vMesa.size();i++){\n\t\t\t\t\t\t\t\t\tcout<<\"Numero: \"<<\" = \"<<vMesa[i]->getNumero()<<endl;\n\t\t\t\t\t\t\t\t\tcout<<\"Tipo: \"<<\" = \"<<vMesa[i]->getTipo()<<endl;\n\t\t\t\t\t\t\t\t\tcout<<endl;\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}\n\t\t\t\t\t\t\tcase 3:{\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}\/\/fin listar\n\t\t\t\t\tcase 3:{\n\n\t\t\t\t\t}\/\/fin modificar\n\t\t\t\t\tcase 4:{\n\t\t\t\t\t\tcout<<\"Ingrese a listar para ver las posiciones\"<<endl;\n\t\t\t\t\t\tcout<<\"Desea eliminar\"<<endl;\n\t\t\t\t\t\tcout<<\"1. Persona\"<<endl;\n\t\t\t\t\t\tcout<<\"2. Mesa\"<<endl;\n\t\t\t\t\t\tint respuesta;\n\t\t\t\t\t\tcout<<\"Ingrese opcion: \";\n\t\t\t\t\t\tcin>>respuesta;\n\t\t\t\t\t\tif (respuesta==1){\n\t\t\t\t\t\t\tcout<<\"Ingrese posicion: \";\n\t\t\t\t\t\t\tint posPersona;\n\t\t\t\t\t\t\tcin>>posPersona;\n\t\t\t\t\t\t\tvPersona.erase(vPersona.begin()+posPersona);\n\t\t\t\t\t\t\tcout<<\"Eliminado\"<<endl;\n\t\t\t\t\t\t}\n\t\t\t\t\t\tif (respuesta==2){\n\t\t\t\t\t\t\tcout<<\"Ingrese posicion: \";\n\t\t\t\t\t\t\tint posPersona;\n\t\t\t\t\t\t\tcin>>posPersona;\n\t\t\t\t\t\t\tvMesa.erase(vMesa.begin()+posPersona);\n\t\t\t\t\t\t\tcout<<\"Eliminado\"<<endl;\n\t\t\t\t\t\t}\n\t\t\t\t\t}\/\/fin eliminar\n\t\t\t\t}\n\t\t\t}while(opcMenu!=5);\n\t\t}\n\t\t\/\/Si es un repartidor\n\t\tif (personaActual->getTipo().compare(\"Repartidor\")==0){\n\t\t\tcout<<\"No se puede jugar con un repartidor\"<<endl;\n\t\t}\n\t\t\/\/Si es un jugador\n\t\tif (personaActual->getTipo().compare(\"Jugador\")==0){\n\t\t\tvector<int> posiciones;\n\t\t\tbool existeCarta;\n\t\t\tdo{\n\t\t\t\texisteCarta=false;\n\t\t\t\tint x=rand()%52;\n\t\t\t\tfor (int i = 0; i < 52; ++i){\n\t\t\t\t}\n\t\t\t} while (existeCarta==true);\n\t\t}\n\t\tcout<<endl;\n\t}while(salir==false);\n\t\n\t\/\/Deletes\n\tfor (int i = 0; i < vPersona.size(); ++i){\n\t\tdelete vPersona[i];\n\t}\n\tfor (int i = 0; i < vMesa.size(); ++i){\n\t\tdelete vMesa[i];\n\t}\n}\n<commit_msg>Se finalizó el proyecto<commit_after>#include <iostream>\n#include <fstream>\n#include <string>\n#include <vector>\n#include <typeinfo>\n#include <cstdlib>\n#include <stdlib.h>\n#include \"Persona.h\"\n#include \"Administrador.h\"\n#include \"Repartidor.h\"\n#include \"Baraja.h\"\n#include \"Carta.h\"\n#include \"Jugador.h\"\n#include \"Mesa.h\"\n\nusing namespace std;\n\nint main(){\n\tvector<Persona*> vPersona;\n\tvector<Mesa*> vMesa;\n\tAdministrador* adminDefecto=new Administrador(\"admin\",23,\"1234\",5,\"Gerente Tiempo Completo\",10000);\n\tvPersona.push_back(adminDefecto);\n\tbool salir=false;\n\tdo{\n\t\/\/Login\n\t\tPersona* personaActual;\n\t\tstring Nombre;\n\t\tstring ID;\n\t\tcout<<\"Bienvenido al programa.\"<<endl;\n\t\tcout<<\"Ingrese (salir) en nombre o identidad para salir\"<<endl;\n\t\tcout<<\"Ingrese nombre: \";\n\t\tcin>>Nombre;\n\t\tcout<<\"Ingrese identidad: \";\n\t\tcin>>ID;\n\t\tif (Nombre.compare(\"salir\")==0||ID.compare(\"salir\")==0){\n\t\t\tbreak;\n\t\t}\n\t\tbool existeUsuario=false;\n\t\tfor (int i = 0; i < vPersona.size(); ++i){\n\t\t\tif (Nombre.compare(vPersona[i]->getNombre())==0){\n\t\t\t\tif (ID.compare(vPersona[i]->getID())==0){\n\t\t\t\t\tpersonaActual=vPersona[i];\n\t\t\t\t\texisteUsuario=true;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tif (existeUsuario==false){\n\t\t\tcout<<\"No existe el usuario\"<<endl;\n\t\t}\n\t\t\/\/Si es un administrador\n\t\tif (personaActual->getTipo().compare(\"Administrador\")==0){\n\t\t\tint opcMenu;\n\t\t\tdo{\n\t\t\t\tcout<<\"Menú\"<<endl;\n\t\t\t\tcout<<\"1. Agregar\"<<endl;\n\t\t\t\tcout<<\"2. Listar\"<<endl;\n\t\t\t\tcout<<\"3. Modificar\"<<endl;\n\t\t\t\tcout<<\"4. Eliminar\"<<endl;\n\t\t\t\tcout<<\"5. Salir\"<<endl;\n\t\t\t\tcout<<\"Ingrese opción: \"<<endl;\n\t\t\t\tcin>>opcMenu;\n\t\t\t\tswitch(opcMenu){\n\t\t\t\t\tcase 1:{\n\t\t\t\t\t\tcout<<\"Menú agregar\"<<endl;\n\t\t\t\t\t\tcout<<\"1. Administrador\"<<endl;\n\t\t\t\t\t\tcout<<\"2. Repartidor\"<<endl;\n\t\t\t\t\t\tcout<<\"3. Jugador\"<<endl;\n\t\t\t\t\t\tcout<<\"4. Mesa\"<<endl;\n\t\t\t\t\t\tint opcAgregar;\n\t\t\t\t\t\tcout<<\"Ingrese la opción: \";\n\t\t\t\t\t\tcin>>opcAgregar;\n\t\t\t\t\t\tswitch(opcAgregar){\n\t\t\t\t\t\t\tcase 1:{\n\t\t\t\t\t\t\t\tstring nombre;\n\t\t\t\t\t\t\t\tcout<<\"Ingrese nombre: \";\n\t\t\t\t\t\t\t\tcin>>nombre;\n\t\t\t\t\t\t\t\tint edad;\n\t\t\t\t\t\t\t\tcout<<\"Ingrese edad: \";\n\t\t\t\t\t\t\t\tcin>>edad;\n\t\t\t\t\t\t\t\tstring id;\n\t\t\t\t\t\t\t\tcout<<\"Ingrese id: \";\n\t\t\t\t\t\t\t\tcin>>id;\n\t\t\t\t\t\t\t\tint experiencia;\n\t\t\t\t\t\t\t\tcout<<\"Ingrese experiencia: \";\n\t\t\t\t\t\t\t\tcin>>experiencia;\n\t\t\t\t\t\t\t\tstring rango;\n\t\t\t\t\t\t\t\tcout<<\"Ingrese rango: \";\n\t\t\t\t\t\t\t\tcin>>rango;\n\t\t\t\t\t\t\t\tdouble sueldo;\n\t\t\t\t\t\t\t\tcout<<\"Ingrese sueldo: \";\n\t\t\t\t\t\t\t\tcin>>sueldo;\n\t\t\t\t\t\t\t\tAdministrador* temporal=new Administrador(nombre,edad,id,experiencia,rango,sueldo);\n\t\t\t\t\t\t\t\tvPersona.push_back(temporal);\n\t\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\tcase 2:{\n\t\t\t\t\t\t\t\tstring nombre;\n\t\t\t\t\t\t\t\tcout<<\"Ingrese nombre: \";\n\t\t\t\t\t\t\t\tcin>>nombre;\n\t\t\t\t\t\t\t\tint edad;\n\t\t\t\t\t\t\t\tcout<<\"Ingrese edad: \";\n\t\t\t\t\t\t\t\tcin>>edad;\n\t\t\t\t\t\t\t\tstring id;\n\t\t\t\t\t\t\t\tcout<<\"Ingrese id: \";\n\t\t\t\t\t\t\t\tcin>>id;\n\t\t\t\t\t\t\t\tdouble dificultad;\n\t\t\t\t\t\t\t\tcout<<\"Ingrese dificultad: \";\n\t\t\t\t\t\t\t\tcin>>dificultad;\n\t\t\t\t\t\t\t\tRepartidor* temporal=new Repartidor(nombre,edad,id,dificultad);\n\t\t\t\t\t\t\t\tvPersona.push_back(temporal);\n\t\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\tcase 3:{\n\t\t\t\t\t\t\t\tstring nombre;\n\t\t\t\t\t\t\t\tcout<<\"Ingrese nombre: \";\n\t\t\t\t\t\t\t\tcin>>nombre;\n\t\t\t\t\t\t\t\tint edad;\n\t\t\t\t\t\t\t\tcout<<\"Ingrese edad: \";\n\t\t\t\t\t\t\t\tcin>>edad;\n\t\t\t\t\t\t\t\tstring id;\n\t\t\t\t\t\t\t\tcout<<\"Ingrese id: \";\n\t\t\t\t\t\t\t\tcin>>id;\n\t\t\t\t\t\t\t\tstring procedencia;\n\t\t\t\t\t\t\t\tcout<<\"Ingrese procedencia: \";\n\t\t\t\t\t\t\t\tcin>>procedencia;\n\t\t\t\t\t\t\t\tstring apodo;\n\t\t\t\t\t\t\t\tcout<<\"Ingrese apodo: \";\n\t\t\t\t\t\t\t\tcin>>apodo;\n\t\t\t\t\t\t\t\tdouble dinero;\n\t\t\t\t\t\t\t\tcout<<\"Ingrese dinero: \";\n\t\t\t\t\t\t\t\tcin>>dinero;\n\t\t\t\t\t\t\t\tJugador* temporal=new Jugador(nombre,edad,id,procedencia,apodo,dinero);\n\t\t\t\t\t\t\t\tvPersona.push_back(temporal);\n\t\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\tcase 4:{\n\t\t\t\t\t\t\t\tint numero;\n\t\t\t\t\t\t\t\tcout<<\"Ingrese numero de mesa: \";\n\t\t\t\t\t\t\t\tcin>>numero;\n\t\t\t\t\t\t\t\tstring tipo;\n\t\t\t\t\t\t\t\tcout<<\"Ingrese tipo (vip,clasica,viajero): \";\n\t\t\t\t\t\t\t\tcin>>tipo;\n\t\t\t\t\t\t\t\tint pos;\n\t\t\t\t\t\t\t\tMesa* temporal=new Mesa(numero,tipo);\n\t\t\t\t\t\t\t\tdo{\n\t\t\t\t\t\t\t\t\tfor(int i=0;i<vPersona.size();i++){\n\t\t\t\t\t\t\t\t\t\tif (vPersona[i]->getTipo().compare(\"Jugador\")==0){\n\t\t\t\t\t\t\t\t\t\t\tcout<<\"Nombre: \"<<\" = \"<<vPersona[i]->getNombre()<<endl;\n\t\t\t\t\t\t\t\t\t\t\tcout<<\"Edad: \"<<\" = \"<<vPersona[i]->getEdad()<<endl;\n\t\t\t\t\t\t\t\t\t\t\tcout<<\"ID: \"<<\" = \"<<vPersona[i]->getID()<<endl;\n\t\t\t\t\t\t\t\t\t\t\tJugador* temporal=dynamic_cast<Jugador*>(vPersona[i]);\n\t\t\t\t\t\t\t\t\t\t\tcout<<\"Procedencia: \"<<\" = \"<<temporal->getProcedencia()<<endl;\n\t\t\t\t\t\t\t\t\t\t\tcout<<\"Apodo: \"<<\" = \"<<temporal->getApodo()<<endl;\n\t\t\t\t\t\t\t\t\t\t\tcout<<\"Dinero: \"<<\" = \"<<temporal->getDinero()<<endl;\n\t\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t\tcout<<endl;\n\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\tint pos;\n\t\t\t\t\t\t\t\t\tcout<<\"Ingrese posicion del jugador o (-1) para salir: \";\n\t\t\t\t\t\t\t\t\tcin>>pos;\n\t\t\t\t\t\t\t\t\tJugador* jugadorTemporal=dynamic_cast<Jugador*>(vPersona[pos]);\n\t\t\t\t\t\t\t\t\ttemporal->Jugadores.push_back(jugadorTemporal);\n\t\t\t\t\t\t\t\t}while(pos!=-1);\n\t\t\t\t\t\t\t\tfor(int i=0;i<vPersona.size();i++){\n\t\t\t\t\t\t\t\t\tif (vPersona[i]->getTipo().compare(\"Repartidor\")==0){\n\t\t\t\t\t\t\t\t\t\tcout<<\"Nombre: \"<<\" = \"<<vPersona[i]->getNombre()<<endl;\n\t\t\t\t\t\t\t\t\t\tcout<<\"Edad: \"<<\" = \"<<vPersona[i]->getEdad()<<endl;\n\t\t\t\t\t\t\t\t\t\tcout<<\"ID: \"<<\" = \"<<vPersona[i]->getID()<<endl;\n\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\tcout<<endl;\n\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\tint pos1;\n\t\t\t\t\t\t\t\tcout<<\"Ingrese posicion del jugador: \";\n\t\t\t\t\t\t\t\tcin>>pos1;\n\t\t\t\t\t\t\t\tRepartidor* repartidorTemporal=dynamic_cast<Repartidor*>(vPersona[pos1]);\n\t\t\t\t\t\t\t\ttemporal->repartidor=repartidorTemporal;\n\t\t\t\t\t\t\t\tvMesa.push_back(temporal);\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\tbreak;\n\t\t\t\t\t}\/\/fin agregar\n\t\t\t\t\tcase 2:{\n\t\t\t\t\t\tcout<<\"Menú listar\"<<endl;\n\t\t\t\t\t\tcout<<\"1. Personas\"<<endl;\n\t\t\t\t\t\tcout<<\"2. Mesas\"<<endl;\n\t\t\t\t\t\tint opcListar;\n\t\t\t\t\t\tcout<<\"Ingrese la opción: \";\n\t\t\t\t\t\tcin>>opcListar;\n\t\t\t\t\t\tcout<<endl;\n\t\t\t\t\t\tswitch(opcListar){\n\t\t\t\t\t\t\tcase 1:{\n\t\t\t\t\t\t\t\tfor(int i=0;i<vPersona.size();i++){\n\t\t\t\t\t\t\t\t\tcout<<\"Nombre: \"<<\" = \"<<vPersona[i]->getNombre()<<endl;\n\t\t\t\t\t\t\t\t\tcout<<\"Edad: \"<<\" = \"<<vPersona[i]->getEdad()<<endl;\n\t\t\t\t\t\t\t\t\tcout<<\"ID: \"<<\" = \"<<vPersona[i]->getID()<<endl;\n\t\t\t\t\t\t\t\t\tif (vPersona[i]->getTipo().compare(\"Administrador\")==0){\n\t\t\t\t\t\t\t\t\t\tAdministrador* temporal=dynamic_cast<Administrador*>(vPersona[i]);\n\t\t\t\t\t\t\t\t\t\tcout<<\"Experiencia: \"<<\" = \"<<temporal->getExperiencia()<<endl;\n\t\t\t\t\t\t\t\t\t\tcout<<\"Rango: \"<<\" = \"<<temporal->getRango()<<endl;\n\t\t\t\t\t\t\t\t\t\tcout<<\"Sueldo: \"<<\" = \"<<temporal->getSueldo()<<endl; \n\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\tif (vPersona[i]->getTipo().compare(\"Repartidor\")==0){\n\t\t\t\t\t\t\t\t\t\tRepartidor* temporal=dynamic_cast<Repartidor*>(vPersona[i]);\n\t\t\t\t\t\t\t\t\t\tcout<<\"Dificultad: \"<<\" = \"<<temporal->getDificultad()<<endl;\n\t\t\t\t\t\t\t\t\t\tcout<<\"Dinero del casino: \"<<\" = \"<<temporal->getDineroCasino()<<endl;\n\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\tif (vPersona[i]->getTipo().compare(\"Jugador\")==0){\n\t\t\t\t\t\t\t\t\t\tJugador* temporal=dynamic_cast<Jugador*>(vPersona[i]);\n\t\t\t\t\t\t\t\t\t\tcout<<\"Procedencia: \"<<\" = \"<<temporal->getProcedencia()<<endl;\n\t\t\t\t\t\t\t\t\t\tcout<<\"Apodo: \"<<\" = \"<<temporal->getApodo()<<endl;\n\t\t\t\t\t\t\t\t\t\tcout<<\"Dinero: \"<<\" = \"<<temporal->getDinero()<<endl;\n\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\tcout<<endl;\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}\n\t\t\t\t\t\t\tcase 2:{\n\t\t\t\t\t\t\t\tfor(int i=0;i<vMesa.size();i++){\n\t\t\t\t\t\t\t\t\tcout<<\"Numero: \"<<\" = \"<<vMesa[i]->getNumero()<<endl;\n\t\t\t\t\t\t\t\t\tcout<<\"Tipo: \"<<\" = \"<<vMesa[i]->getTipo()<<endl;\n\t\t\t\t\t\t\t\t\tcout<<endl;\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}\n\t\t\t\t\t\t\tcase 3:{\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\tbreak;\n\t\t\t\t\t}\/\/fin listar\n\t\t\t\t\tcase 3:{\n\n\t\t\t\t\t}\/\/fin modificar\n\t\t\t\t\tcase 4:{\n\t\t\t\t\t\tcout<<\"Ingrese a listar para ver las posiciones\"<<endl;\n\t\t\t\t\t\tcout<<\"Desea eliminar\"<<endl;\n\t\t\t\t\t\tcout<<\"1. Persona\"<<endl;\n\t\t\t\t\t\tcout<<\"2. Mesa\"<<endl;\n\t\t\t\t\t\tint respuesta;\n\t\t\t\t\t\tcout<<\"Ingrese opcion: \";\n\t\t\t\t\t\tcin>>respuesta;\n\t\t\t\t\t\tif (respuesta==1){\n\t\t\t\t\t\t\tcout<<\"Ingrese posicion: \";\n\t\t\t\t\t\t\tint posPersona;\n\t\t\t\t\t\t\tcin>>posPersona;\n\t\t\t\t\t\t\tvPersona.erase(vPersona.begin()+posPersona);\n\t\t\t\t\t\t\tcout<<\"Eliminado\"<<endl;\n\t\t\t\t\t\t}\n\t\t\t\t\t\tif (respuesta==2){\n\t\t\t\t\t\t\tcout<<\"Ingrese posicion: \";\n\t\t\t\t\t\t\tint posPersona;\n\t\t\t\t\t\t\tcin>>posPersona;\n\t\t\t\t\t\t\tvMesa.erase(vMesa.begin()+posPersona);\n\t\t\t\t\t\t\tcout<<\"Eliminado\"<<endl;\n\t\t\t\t\t\t}\n\t\t\t\t\t}\/\/fin eliminar\n\t\t\t\t}\n\t\t\t}while(opcMenu!=5);\n\t\t}\n\t\t\/\/Si es un repartidor\n\t\tif (personaActual->getTipo().compare(\"Repartidor\")==0){\n\t\t\tcout<<\"No se puede jugar con un repartidor\"<<endl;\n\t\t}\n\t\t\/\/Si es un jugador\n\t\tif (personaActual->getTipo().compare(\"Jugador\")==0){\n\t\t\t\n\t\t\tvector<int> posiciones;\n\t\t\tbool existeCarta;\n\t\t\tdo{\n\t\t\t\texisteCarta=false;\n\t\t\t\tint x=rand()%52;\n\t\t\t\tfor (int i = 0; i < 52; ++i){\n\n\t\t\t\t}\n\t\t\t} while (existeCarta==true);\n\t\t}\n\t\tcout<<endl;\n\t}while(salir==false);\n\t\n\t\/\/Deletes\n\tfor (int i = 0; i < vPersona.size(); ++i){\n\t\tdelete vPersona[i];\n\t}\n\tfor (int i = 0; i < vMesa.size(); ++i){\n\t\tdelete vMesa[i];\n\t}\n}\n<|endoftext|>"} {"text":"<commit_before><commit_msg>Create main.cpp<commit_after><|endoftext|>"} {"text":"<commit_before><commit_msg>-adapted to changes<commit_after><|endoftext|>"} {"text":"<commit_before>\/\/ -*- mode:C++; tab-width:8; c-basic-offset:2; indent-tabs-mode:t -*- \n\/\/ vim: ts=8 sw=2 smarttab\n\n#include \"tcp.h\"\n\n\/******************\n * tcp crap\n *\/\n\n\/*\ninlined, see tcp.h\n\n\nbool tcp_read(int sd, char *buf, int len)\n{\n while (len > 0) {\n int got = ::recv( sd, buf, len, 0 );\n if (got == 0) {\n generic_dout(18) << \"tcp_read socket \" << sd << \" closed\" << dendl;\n return false;\n }\n if (got < 0) {\n generic_dout(18) << \"tcp_read bailing with \" << got << dendl;\n return false;\n }\n assert(got >= 0);\n len -= got;\n buf += got;\n \/\/generic_dout(DBL) << \"tcp_read got \" << got << \", \" << len << \" left\" << dendl;\n }\n return true;\n}\n\nint tcp_write(int sd, char *buf, int len)\n{\n \/\/generic_dout(DBL) << \"tcp_write writing \" << len << dendl;\n assert(len > 0);\n while (len > 0) {\n int did = ::send( sd, buf, len, 0 );\n if (did < 0) {\n generic_dout(1) << \"tcp_write error did = \" << did << \" errno \" << errno << \" \" << strerror(errno) << dendl;\n \/\/derr(0) << \"tcp_write error did = \" << did << \" errno \" << errno << \" \" << strerror(errno) << dendl;\n }\n \/\/assert(did >= 0);\n if (did < 0) return did;\n len -= did;\n buf += did;\n \/\/generic_dout(DBL) << \"tcp_write did \" << did << \", \" << len << \" left\" << dendl;\n }\n return 0;\n}\n*\/\n\nint tcp_read(int sd, char *buf, int len) {\n while (len > 0) {\n int got = ::recv( sd, buf, len, 0 );\n if (got <= 0) {\n \/\/generic_dout(18) << \"tcp_read socket \" << sd << \" closed\" << dendl;\n return -1;\n }\n len -= got;\n buf += got;\n \/\/generic_dout(DBL) << \"tcp_read got \" << got << \", \" << len << \" left\" << dendl;\n }\n return len;\n}\n\nint tcp_write(int sd, const char *buf, int len) {\n \/\/generic_dout(DBL) << \"tcp_write writing \" << len << dendl;\n assert(len > 0);\n while (len > 0) {\n int did = ::send( sd, buf, len, 0 );\n if (did < 0) {\n \/\/generic_dout(1) << \"tcp_write error did = \" << did << \" errno \" << errno << \" \" << strerror(errno) << dendl;\n \/\/generic_derr(1) << \"tcp_write error did = \" << did << \" errno \" << errno << \" \" << strerror(errno) << dendl;\n return did;\n }\n len -= did;\n buf += did;\n \/\/generic_dout(DBL) << \"tcp_write did \" << did << \", \" << len << \" left\" << dendl;\n }\n return 0;\n}\n\nint tcp_hostlookup(char *str, sockaddr_in& ta)\n{\n char *host = str;\n char *port = 0;\n \n for (int i=0; str[i]; i++) {\n if (str[i] == ':') {\n port = str+i+1;\n str[i] = 0;\n break;\n }\n }\n if (!port) {\n cerr << \"addr '\" << str << \"' doesn't look like 'host:port'\" << std::endl;\n return -1;\n } \n \/\/cout << \"host '\" << host << \"' port '\" << port << \"'\" << std::endl;\n\n int iport = atoi(port);\n \n struct hostent *myhostname = gethostbyname( host ); \n if (!myhostname) {\n cerr << \"host \" << host << \" not found\" << std::endl;\n return -1;\n }\n\n memset(&ta, 0, sizeof(ta));\n\n \/\/cout << \"addrtype \" << myhostname->h_addrtype << \" len \" << myhostname->h_length << std::endl;\n\n ta.sin_family = myhostname->h_addrtype;\n memcpy((char *)&ta.sin_addr,\n myhostname->h_addr, \n myhostname->h_length);\n ta.sin_port = iport;\n \n cout << \"lookup '\" << host << \":\" << port << \"' -> \" << ta << std::endl;\n\n return 0;\n}\n<commit_msg>msgr: kill dead code<commit_after>\/\/ -*- mode:C++; tab-width:8; c-basic-offset:2; indent-tabs-mode:t -*- \n\/\/ vim: ts=8 sw=2 smarttab\n\n#include \"tcp.h\"\n\n\/******************\n * tcp crap\n *\/\n\nint tcp_read(int sd, char *buf, int len) {\n while (len > 0) {\n int got = ::recv( sd, buf, len, 0 );\n if (got <= 0) {\n \/\/generic_dout(18) << \"tcp_read socket \" << sd << \" closed\" << dendl;\n return -1;\n }\n len -= got;\n buf += got;\n \/\/generic_dout(DBL) << \"tcp_read got \" << got << \", \" << len << \" left\" << dendl;\n }\n return len;\n}\n\nint tcp_write(int sd, const char *buf, int len) {\n \/\/generic_dout(DBL) << \"tcp_write writing \" << len << dendl;\n assert(len > 0);\n while (len > 0) {\n int did = ::send( sd, buf, len, 0 );\n if (did < 0) {\n \/\/generic_dout(1) << \"tcp_write error did = \" << did << \" errno \" << errno << \" \" << strerror(errno) << dendl;\n \/\/generic_derr(1) << \"tcp_write error did = \" << did << \" errno \" << errno << \" \" << strerror(errno) << dendl;\n return did;\n }\n len -= did;\n buf += did;\n \/\/generic_dout(DBL) << \"tcp_write did \" << did << \", \" << len << \" left\" << dendl;\n }\n return 0;\n}\n\nint tcp_hostlookup(char *str, sockaddr_in& ta)\n{\n char *host = str;\n char *port = 0;\n \n for (int i=0; str[i]; i++) {\n if (str[i] == ':') {\n port = str+i+1;\n str[i] = 0;\n break;\n }\n }\n if (!port) {\n cerr << \"addr '\" << str << \"' doesn't look like 'host:port'\" << std::endl;\n return -1;\n } \n \/\/cout << \"host '\" << host << \"' port '\" << port << \"'\" << std::endl;\n\n int iport = atoi(port);\n \n struct hostent *myhostname = gethostbyname( host ); \n if (!myhostname) {\n cerr << \"host \" << host << \" not found\" << std::endl;\n return -1;\n }\n\n memset(&ta, 0, sizeof(ta));\n\n \/\/cout << \"addrtype \" << myhostname->h_addrtype << \" len \" << myhostname->h_length << std::endl;\n\n ta.sin_family = myhostname->h_addrtype;\n memcpy((char *)&ta.sin_addr,\n myhostname->h_addr, \n myhostname->h_length);\n ta.sin_port = iport;\n \n cout << \"lookup '\" << host << \":\" << port << \"' -> \" << ta << std::endl;\n\n return 0;\n}\n<|endoftext|>"} {"text":"<commit_before>#include \"ncurses.hh\"\n\n#include <ncurses.h>\n#include <stdexcept>\n#include \"utf8.hh\"\n\nnamespace curses {\n\n\/\/ get an array of bytes represents a UTF-8 character from window.\nstd::string get_utf8_char(WINDOW* window)\n{\n std::array<uint8_t, 6> buf{0};\n\n auto ch0 = static_cast<uint8_t>(::wgetch(window) & 0x000000FF);\n size_t len = get_utf8_char_length(ch0);\n buf[0] = ch0;\n\n for (size_t i = 1; i < len; ++i) {\n auto ch = static_cast<uint8_t>(::wgetch(window) & 0x000000FF);\n if (!is_utf8_cont(ch)) {\n throw std::runtime_error(std::string(__FUNCTION__) + \": wrong byte exists\");\n }\n buf[i] = ch;\n }\n\n return std::string(buf.data(), buf.data() + len);\n}\n\nWindow::Window()\n{\n tty_in.reset(fopen(\"\/dev\/tty\", \"r\"));\n tty_out.reset(fopen(\"\/dev\/tty\", \"w\"));\n\n \/\/ create a new terminal\n scr = ::newterm(getenv(\"TERM\"), tty_out.get(), tty_in.get());\n win = stdscr;\n\n \/\/ setup\n ::noecho(); \/\/ do not echo back characters\n ::cbreak(); \/\/ without buffering\n ::keypad(win, true); \/\/ convert escape sequeces to key code\n ::nodelay(win, true); \/\/ set delay time\n\n \/\/ initialize colormap.\n \/\/ start_color();\n \/\/ ::init_pair(1, COLOR_RED, COLOR_WHITE);\n}\n\nWindow::~Window()\n{\n \/\/ reset current screen.\n ::endwin();\n\n \/\/ release all resources of current session.\n ::delscreen(scr);\n}\n\nvoid Window::erase() { ::werase(win); }\n\nvoid Window::refresh() { ::wrefresh(win); }\n\nstd::tuple<int, int> Window::get_size() const\n{\n int width, height;\n getmaxyx(win, height, width);\n return std::make_tuple(width, height);\n}\n\nvoid Window::add_str(int x, int y, std::string const& text) { mvwaddstr(win, y, x, text.c_str()); }\n\nvoid Window::change_attr(int x, int y, int n, int col) { mvwchgat(win, y, x, n, A_BOLD | A_UNDERLINE, col, nullptr); }\n\nEvent Window::poll_event()\n{\n int ch = ::wgetch(win);\n if (ch == 10) {\n return Event{Key::Enter};\n }\n else if (ch == 27) {\n int ch = ::wgetch(win);\n if (ch == -1) {\n return Event{Key::Esc};\n }\n else {\n return Event{Key::Alt, ch};\n }\n }\n else if (ch == KEY_UP) {\n return Event{Key::Up};\n }\n else if (ch == KEY_DOWN) {\n return Event{Key::Down};\n }\n else if (ch == KEY_LEFT) {\n return Event{Key::Left};\n }\n else if (ch == KEY_RIGHT) {\n return Event{Key::Right};\n }\n else if (ch == 9) {\n return Event{Key::Tab};\n }\n else if (ch == 127 || ch == KEY_BACKSPACE) {\n return Event{Key::Backspace};\n }\n else if (ch == 18) {\n return Event{Key::Ctrl, 'r'};\n }\n else if (is_utf8_first(ch & 0xFF)) {\n ::ungetch(ch);\n auto ch = get_utf8_char(win);\n return Event{std::move(ch)};\n }\n else {\n return Event{Key::Unknown};\n }\n}\n\n} \/\/ namespace curses;\n\n<commit_msg>add delay time<commit_after>#include \"ncurses.hh\"\n\n#include <ncurses.h>\n#include <stdexcept>\n#include \"utf8.hh\"\n\nnamespace curses {\n\n\/\/ get an array of bytes represents a UTF-8 character from window.\nstd::string get_utf8_char(WINDOW* window)\n{\n std::array<uint8_t, 6> buf{0};\n\n auto ch0 = static_cast<uint8_t>(::wgetch(window) & 0x000000FF);\n size_t len = get_utf8_char_length(ch0);\n buf[0] = ch0;\n\n for (size_t i = 1; i < len; ++i) {\n auto ch = static_cast<uint8_t>(::wgetch(window) & 0x000000FF);\n if (!is_utf8_cont(ch)) {\n throw std::runtime_error(std::string(__FUNCTION__) + \": wrong byte exists\");\n }\n buf[i] = ch;\n }\n\n return std::string(buf.data(), buf.data() + len);\n}\n\nWindow::Window()\n{\n tty_in.reset(fopen(\"\/dev\/tty\", \"r\"));\n tty_out.reset(fopen(\"\/dev\/tty\", \"w\"));\n\n \/\/ create a new terminal\n scr = ::newterm(getenv(\"TERM\"), tty_out.get(), tty_in.get());\n win = stdscr;\n\n \/\/ setup\n ::noecho(); \/\/ do not echo back characters\n ::cbreak(); \/\/ without buffering\n ::keypad(win, true); \/\/ convert escape sequeces to key code\n ::wtimeout(win, 1); \/\/ set delay time\n\n \/\/ initialize colormap.\n \/\/ start_color();\n \/\/ ::init_pair(1, COLOR_RED, COLOR_WHITE);\n}\n\nWindow::~Window()\n{\n \/\/ reset current screen.\n ::endwin();\n\n \/\/ release all resources of current session.\n ::delscreen(scr);\n}\n\nvoid Window::erase() { ::werase(win); }\n\nvoid Window::refresh() { ::wrefresh(win); }\n\nstd::tuple<int, int> Window::get_size() const\n{\n int width, height;\n getmaxyx(win, height, width);\n return std::make_tuple(width, height);\n}\n\nvoid Window::add_str(int x, int y, std::string const& text) { mvwaddstr(win, y, x, text.c_str()); }\n\nvoid Window::change_attr(int x, int y, int n, int col) { mvwchgat(win, y, x, n, A_BOLD | A_UNDERLINE, col, nullptr); }\n\nEvent Window::poll_event()\n{\n int ch = ::wgetch(win);\n if (ch == 10) {\n return Event{Key::Enter};\n }\n else if (ch == 27) {\n int ch = ::wgetch(win);\n if (ch == -1) {\n return Event{Key::Esc};\n }\n else {\n return Event{Key::Alt, ch};\n }\n }\n else if (ch == KEY_UP) {\n return Event{Key::Up};\n }\n else if (ch == KEY_DOWN) {\n return Event{Key::Down};\n }\n else if (ch == KEY_LEFT) {\n return Event{Key::Left};\n }\n else if (ch == KEY_RIGHT) {\n return Event{Key::Right};\n }\n else if (ch == 9) {\n return Event{Key::Tab};\n }\n else if (ch == 127 || ch == KEY_BACKSPACE) {\n return Event{Key::Backspace};\n }\n else if (ch == 18) {\n return Event{Key::Ctrl, 'r'};\n }\n else if (is_utf8_first(ch & 0xFF)) {\n ::ungetch(ch);\n auto ch = get_utf8_char(win);\n return Event{std::move(ch)};\n }\n else {\n return Event{Key::Unknown};\n }\n}\n\n} \/\/ namespace curses;\n\n<|endoftext|>"} {"text":"<commit_before>\/*\n * This software is distributed under BSD 3-clause license (see LICENSE file).\n *\n * Authors: Giovanni De Toni\n *\n *\/\n\n#include <shogun\/lib\/type_case.h>\n#include <shogun\/lib\/observers\/ParameterObserverLogger.h>\n\nusing namespace shogun;\n\nParameterObserverLogger::ParameterObserverLogger() {}\n\nParameterObserverLogger::ParameterObserverLogger(std::vector<std::string> ¶meters) : ParameterObserver(\n\t\tparameters) {}\n\nParameterObserverLogger::~ParameterObserverLogger() {\n\n}\n\nvoid ParameterObserverLogger::on_error(std::exception_ptr ptr) {\n\n}\n\nvoid ParameterObserverLogger::on_complete() {\n\n}\n\nvoid ParameterObserverLogger::on_next_impl(const TimedObservedValue &value) {\n\n\tauto name = value.first->get<std::string>(\"name\");\n\tauto any_val = value.first->get_any();\n\tauto print_func = [](auto v){\n\t\tSG_PRINT(\"[%l] Received a value called %s which contains: %s\", convert_to_millis(value.second),\n\t\t\t\t name, v);\n\t};\n\n\tsg_any_dispatch(any_val, sg_all_typemap, print_func, print_func, print_func);\n\n}\n<commit_msg>Fix lambda inside ParameterObserverLogger.cpp.<commit_after>\/*\n * This software is distributed under BSD 3-clause license (see LICENSE file).\n *\n * Authors: Giovanni De Toni\n *\n *\/\n\n#include <shogun\/lib\/type_case.h>\n#include <shogun\/lib\/observers\/ParameterObserverLogger.h>\n\nusing namespace shogun;\n\nParameterObserverLogger::ParameterObserverLogger() {}\n\nParameterObserverLogger::ParameterObserverLogger(std::vector<std::string> ¶meters) : ParameterObserver(\n\t\tparameters) {}\n\nParameterObserverLogger::~ParameterObserverLogger() {\n\n}\n\nvoid ParameterObserverLogger::on_error(std::exception_ptr ptr) {\n\n}\n\nvoid ParameterObserverLogger::on_complete() {\n\n}\n\nvoid ParameterObserverLogger::on_next_impl(const TimedObservedValue &value) {\n\n\tauto name = value.first->get<std::string>(\"name\");\n\tauto any_val = value.first->get_any();\n\tauto print_func = [&](auto v){\n\t\tSG_PRINT(\"[%l] Received a value called %s which contains: %s\", convert_to_millis(value.second),\n\t\t\t\t name, v);\n\t};\n\n\tsg_any_dispatch(any_val, sg_all_typemap, print_func, print_func, print_func);\n\n}\n<|endoftext|>"} {"text":"<commit_before>\/*\nCopyright libCellML Contributors\n\nLicensed under the Apache License, Version 2.0 (the \"License\");\nyou may not use this file except in compliance with the License.\nYou may obtain a copy of the License at\n\n http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n\nUnless required by applicable law or agreed to in writing, software\ndistributed under the License is distributed on an \"AS IS\" BASIS,\nWITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\nSee the License for the specific language governing permissions and\nlimitations under the License.\n*\/\n\n#include \"libcellml\/generator.h\"\n\nnamespace libcellml{\n\nusing namespace libcellml::operators;\n\nconst std::unordered_map<CXX::types, std::string, EnumClassHash> CXX::returnTypes = {\n {types::void_t,\"void \"},\n {types::double_t, \"double \"},\n {types::double_ct, \"const double \"},\n {types::double_pt, \"double* \"},\n {types::double_rt, \"double& \"}\n};\n\nconst std::unordered_map<CXX::types, std::string, EnumClassHash> CXX::argTypes = {\n {types::void_t,\"void \"},\n {types::double_t, \"double \"},\n {types::double_ct, \"const double \"},\n {types::double_pt, \"double* \"},\n {types::double_rt, \"double& \"},\n};\n\ntemplate<typename L>\nstd::string Generator::generateStateAliases()\n{\n std::string s;\n std::ostringstream oss(s);\n for (size_t i = 0; i < states.size(); i++)\n {\n oss << \" \"\n << L::argType(L::types::double_rt) << states[i] << \" = \" << L::dereferenceOp() << \"(states + \" << i\n << \")\" << L::instructionDelimiter() << std::endl;\n }\n oss << std::endl;\n return oss.str();\n}\n\ntemplate<typename L>\nstd::string Generator::generateVoiAlias()\n{\n std::string s;\n std::ostringstream oss(s);\n oss << \" \"\n << L::argType(L::types::double_ct) << voi << \" = voi\" << L::instructionDelimiter() << std::endl;\n oss << std::endl;\n return oss.str();\n}\n\ntemplate<typename L>\nstd::string Generator::generateInitConsts()\n{\n std::string s;\n std::ostringstream oss(s);\n oss << L::returnType(L::types::void_t) << \"initConsts\"\n << L::argListOp()\n << L::argType(L::types::double_pt)\n << \"constants, \"\n << L::argType(L::types::double_pt)\n << \"rates, \"\n << L::argType(L::types::double_pt)\n << \"states\"\n << L::argListCl() << std::endl\n << L::funBodyOp() << std::endl;\n\n oss << generateStateAliases() << std::endl;\n for (auto s : initialValues)\n {\n oss << \" \" << s.first << \" = \"\n << std::setprecision(16) << s.second << L::instructionDelimiter() << std::endl;\n }\n oss << std::endl << L::funBodyCl();\n return oss.str();\n}\n\ntemplate<typename L>\nstd::string Generator::generateComputeRates(std::shared_ptr<Representable> r)\n{\n std::string s;\n std::ostringstream oss(s);\n oss << L::returnType(L::types::void_t) << \"computeRates\"\n << L::argListOp()\n << L::argType(L::types::double_t)\n << \"voi, \"\n << L::argType(L::types::double_pt)\n << \"constants, \"\n << L::argType(L::types::double_pt)\n << \"rates, \"\n << L::argType(L::types::double_pt)\n << \"states, \"\n << L::argType(L::types::double_pt)\n << \"algebraic\"\n << L::argListCl() << std::endl\n << L::funBodyOp() << std::endl;\n\n oss << generateVoiAlias() << std::endl;\n oss << generateStateAliases() << std::endl;\n\n oss << \" rates[0] = \"\n << r->repr() << \";\" << std::endl;\n\n oss << std::endl\n << L::funBodyCl();\n return oss.str();\n}\n\ntemplate<typename L>\nstd::string Generator::generateComputeVariables()\n{\n std::string s;\n std::ostringstream oss(s);\n oss << L::returnType(L::types::void_t) << \"computeVariables\"\n << L::argListOp()\n << L::argType(L::types::double_t)\n << \"voi, \"\n << L::argType(L::types::double_pt)\n << \"constants, \"\n << L::argType(L::types::double_pt)\n << \"rates, \"\n << L::argType(L::types::double_pt)\n << \"states, \"\n << L::argType(L::types::double_pt)\n << \"algebraic\"\n << L::argListCl() << std::endl\n << L::funBodyOp() << std::endl\n << L::funBodyCl();\n return oss.str();\n}\n\nvoid Generator::findInitialValues(ComponentPtr c)\n{\n for (std::size_t i = 0; i < c->variableCount(); i++)\n {\n auto v = c->getVariable(i);\n if (v->getName() != voi)\n {\n initialValues[v->getName()] = std::stod(v->getInitialValue());\n }\n }\n}\n\ntemplate<typename L>\nstd::string Generator::generateCode(ModelPtr m)\n{\n ComponentPtr c = m->getComponent(0);\n\n findVOI(c->getMath());\n findInitialValues(c);\n auto r = parseMathML(c->getMath());\n \n std::string generatedCode;\n std::ostringstream oss(generatedCode);\n oss << generateInitConsts<L>() << std::endl;\n oss << generateComputeRates<L>(r) << std::endl;\n oss << generateComputeVariables<L>() << std::endl;\n\n code = oss.str();\n return code;\n}\n\nvoid Generator::writeCodeToFile(std::string filename)\n{\n if (code == \"\")\n {\n ErrorPtr err = std::make_shared<Error>();\n err->setDescription(\"No code was generated yet, you should call \"\n \"Generator::generateCode before calling this method.\");\n addError(err);\n throw CodeNotGenerated();\n }\n\n std::ofstream output(filename);\n output << code;\n output.close();\n}\n\nstd::shared_ptr<Representable> Generator::parseNode(XmlNodePtr node)\n{\n if (node->isType(\"apply\"))\n {\n return parseNode(node->getFirstChild());\n }\n else if (node->isType(\"plus\"))\n {\n auto c = std::make_shared<Addition>();\n auto s = node->getNext();\n c->setArg1(parseNode(s));\n s = s->getNext();\n if (!s->getNext())\n {\n c->setArg2(parseNode(s));\n }\n else\n {\n auto pointer0 = c;\n while (s->getNext())\n {\n auto pointer1 = std::make_shared<Addition>();\n pointer1->setArg1(parseNode(s));\n pointer0->setArg2(pointer1);\n s = s->getNext();\n pointer0 = pointer1;\n }\n pointer0->setArg2(parseNode(s));\n }\n return c;\n }\n else if (node->isType(\"minus\"))\n {\n auto c = std::make_shared<Subtraction>();\n auto s1 = node->getNext();\n c->setArg1(parseNode(s1));\n c->setArg2(parseNode(s1->getNext()));\n return c;\n }\n else if (node->isType(\"times\"))\n {\n auto c = std::make_shared<Multiplication>();\n auto s = node->getNext();\n c->setArg1(parseNode(s));\n s = s->getNext();\n if (!s->getNext())\n {\n c->setArg2(parseNode(s));\n }\n else\n {\n auto pointer0 = c;\n while (s->getNext())\n {\n auto pointer1 = std::make_shared<Multiplication>();\n pointer1->setArg1(parseNode(s));\n pointer0->setArg2(pointer1);\n s = s->getNext();\n pointer0 = pointer1;\n }\n pointer0->setArg2(parseNode(s));\n }\n return c;\n }\n else if (node->isType(\"divide\"))\n {\n auto c = std::make_shared<Division>();\n auto s1 = node->getNext();\n c->setArg1(parseNode(s1));\n c->setArg2(parseNode(s1->getNext()));\n return c;\n }\n else if (node->isType(\"power\"))\n {\n auto c = std::make_shared<Power>();\n auto s1 = node->getNext();\n c->setArg1(parseNode(s1));\n c->setArg2(parseNode(s1->getNext()));\n return c;\n }\n else if (node->isType(\"sin\"))\n {\n auto c = std::make_shared<Sine>();\n c->setArg(parseNode(node->getNext()));\n return c;\n }\n else if (node->isType(\"cos\"))\n {\n auto c = std::make_shared<Cosine>();\n c->setArg(parseNode(node->getNext()));\n return c;\n }\n else if (node->isType(\"abs\"))\n {\n auto c = std::make_shared<AbsoluteValue>();\n c->setArg(parseNode(node->getNext()));\n return c;\n }\n else if (node->isType(\"ci\"))\n {\n auto name = node->getFirstChild()->convertToString();\n auto c = std::make_shared<libcellml::operators::Variable>(name);\n if (name != voi &&\n std::find(states.begin(), states.end(), name) == states.end())\n {\n states.push_back(name);\n }\n return c;\n }\n else if (node->isType(\"cn\"))\n {\n double value;\n std::istringstream iss(node->getFirstChild()->convertToString());\n iss >> value;\n auto c = std::make_shared<Constant>(value);\n return c;\n }\n else\n {\n ErrorPtr err = std::make_shared<Error>();\n err->setDescription(\"Found node of type \"\n + node->getType() +\n \" which is currently not supported by the Generator class.\");\n addError(err);\n throw UnknownNode();\n\n return std::make_shared<Constant>(0);\n }\n}\n\nstd::shared_ptr<Representable> Generator::parseMathML(std::string math)\n{\n XmlDocPtr mathDoc = std::make_shared<XmlDoc>();\n mathDoc->parse(math);\n\n const XmlNodePtr root = mathDoc->getRootNode();\n\n XmlNodePtr childNode = root->getFirstChild();\n childNode = childNode->getFirstChild();\n childNode = childNode->getNext();\n childNode = childNode->getNext();\n\n return parseNode(childNode);\n}\n\nvoid Generator::findVOIHelper(XmlNodePtr node)\n{\n if (node->isType(\"bvar\"))\n {\n voi = node->getFirstChild()->getFirstChild()->convertToString();\n return;\n }\n else\n {\n if (node->getFirstChild())\n {\n findVOIHelper(node->getFirstChild());\n }\n if (node->getNext())\n {\n findVOIHelper(node->getNext());\n }\n }\n}\n\nvoid Generator::findVOI(std::string math)\n{\n XmlDocPtr mathDoc = std::make_shared<XmlDoc>();\n mathDoc->parse(math);\n\n const XmlNodePtr root = mathDoc->getRootNode();\n XmlNodePtr node = root->getFirstChild();\n\n findVOIHelper(node);\n}\n\nconst char * CodeNotGenerated::what () const throw ()\n{\n return \"No code was generated yet, you should call \"\n \"Generator::generateCode before calling this method.\";\n}\n\nconst char * UnknownNode::what () const throw ()\n{\n return \"Found node of unknown type\";\n}\n\ntemplate std::string Generator::generateCode<CXX>(ModelPtr m);\n\n}\n<commit_msg>Adhering to current code rules<commit_after>\/*\nCopyright libCellML Contributors\n\nLicensed under the Apache License, Version 2.0 (the \"License\");\nyou may not use this file except in compliance with the License.\nYou may obtain a copy of the License at\n\n http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n\nUnless required by applicable law or agreed to in writing, software\ndistributed under the License is distributed on an \"AS IS\" BASIS,\nWITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\nSee the License for the specific language governing permissions and\nlimitations under the License.\n*\/\n\n#include \"libcellml\/generator.h\"\n\nnamespace libcellml{\n\nusing namespace libcellml::operators;\n\nconst std::unordered_map<CXX::types, std::string, EnumClassHash> CXX::returnTypes = {\n {types::void_t,\"void \"},\n {types::double_t, \"double \"},\n {types::double_ct, \"const double \"},\n {types::double_pt, \"double *\"},\n {types::double_rt, \"double &\"}\n};\n\nconst std::unordered_map<CXX::types, std::string, EnumClassHash> CXX::argTypes = {\n {types::void_t,\"void \"},\n {types::double_t, \"double \"},\n {types::double_ct, \"const double \"},\n {types::double_pt, \"double *\"},\n {types::double_rt, \"double &\"},\n};\n\ntemplate<typename L>\nstd::string Generator::generateStateAliases()\n{\n std::string s;\n std::ostringstream oss(s);\n for (size_t i = 0; i < states.size(); i++)\n {\n oss << \" \"\n << L::argType(L::types::double_rt) << states[i] << \" = \" << L::dereferenceOp() << \"(states + \" << i\n << \")\" << L::instructionDelimiter() << std::endl;\n }\n oss << std::endl;\n return oss.str();\n}\n\ntemplate<typename L>\nstd::string Generator::generateVoiAlias()\n{\n std::string s;\n std::ostringstream oss(s);\n oss << \" \"\n << L::argType(L::types::double_ct) << voi << \" = voi\" << L::instructionDelimiter() << std::endl;\n oss << std::endl;\n return oss.str();\n}\n\ntemplate<typename L>\nstd::string Generator::generateInitConsts()\n{\n std::string s;\n std::ostringstream oss(s);\n oss << L::returnType(L::types::void_t) << \"initConsts\"\n << L::argListOp()\n << L::argType(L::types::double_pt)\n << \"constants, \"\n << L::argType(L::types::double_pt)\n << \"rates, \"\n << L::argType(L::types::double_pt)\n << \"states\"\n << L::argListCl() << std::endl\n << L::funBodyOp() << std::endl;\n\n oss << generateStateAliases() << std::endl;\n for (auto s : initialValues)\n {\n oss << \" \" << s.first << \" = \"\n << std::setprecision(16) << s.second << L::instructionDelimiter() << std::endl;\n }\n oss << std::endl << L::funBodyCl();\n return oss.str();\n}\n\ntemplate<typename L>\nstd::string Generator::generateComputeRates(std::shared_ptr<Representable> r)\n{\n std::string s;\n std::ostringstream oss(s);\n oss << L::returnType(L::types::void_t) << \"computeRates\"\n << L::argListOp()\n << L::argType(L::types::double_t)\n << \"voi, \"\n << L::argType(L::types::double_pt)\n << \"constants, \"\n << L::argType(L::types::double_pt)\n << \"rates, \"\n << L::argType(L::types::double_pt)\n << \"states, \"\n << L::argType(L::types::double_pt)\n << \"algebraic\"\n << L::argListCl() << std::endl\n << L::funBodyOp() << std::endl;\n\n oss << generateVoiAlias() << std::endl;\n oss << generateStateAliases() << std::endl;\n\n oss << \" rates[0] = \"\n << r->repr() << \";\" << std::endl;\n\n oss << std::endl\n << L::funBodyCl();\n return oss.str();\n}\n\ntemplate<typename L>\nstd::string Generator::generateComputeVariables()\n{\n std::string s;\n std::ostringstream oss(s);\n oss << L::returnType(L::types::void_t) << \"computeVariables\"\n << L::argListOp()\n << L::argType(L::types::double_t)\n << \"voi, \"\n << L::argType(L::types::double_pt)\n << \"constants, \"\n << L::argType(L::types::double_pt)\n << \"rates, \"\n << L::argType(L::types::double_pt)\n << \"states, \"\n << L::argType(L::types::double_pt)\n << \"algebraic\"\n << L::argListCl() << std::endl\n << L::funBodyOp() << std::endl\n << L::funBodyCl();\n return oss.str();\n}\n\nvoid Generator::findInitialValues(ComponentPtr c)\n{\n for (std::size_t i = 0; i < c->variableCount(); i++)\n {\n auto v = c->getVariable(i);\n if (v->getName() != voi)\n {\n initialValues[v->getName()] = std::stod(v->getInitialValue());\n }\n }\n}\n\ntemplate<typename L>\nstd::string Generator::generateCode(ModelPtr m)\n{\n ComponentPtr c = m->getComponent(0);\n\n findVOI(c->getMath());\n findInitialValues(c);\n auto r = parseMathML(c->getMath());\n \n std::string generatedCode;\n std::ostringstream oss(generatedCode);\n oss << generateInitConsts<L>() << std::endl;\n oss << generateComputeRates<L>(r) << std::endl;\n oss << generateComputeVariables<L>() << std::endl;\n\n code = oss.str();\n return code;\n}\n\nvoid Generator::writeCodeToFile(std::string filename)\n{\n if (code == \"\")\n {\n ErrorPtr err = std::make_shared<Error>();\n err->setDescription(\"No code was generated yet, you should call \"\n \"Generator::generateCode before calling this method.\");\n addError(err);\n throw CodeNotGenerated();\n }\n\n std::ofstream output(filename);\n output << code;\n output.close();\n}\n\nstd::shared_ptr<Representable> Generator::parseNode(XmlNodePtr node)\n{\n if (node->isType(\"apply\"))\n {\n return parseNode(node->getFirstChild());\n }\n else if (node->isType(\"plus\"))\n {\n auto c = std::make_shared<Addition>();\n auto s = node->getNext();\n c->setArg1(parseNode(s));\n s = s->getNext();\n if (!s->getNext())\n {\n c->setArg2(parseNode(s));\n }\n else\n {\n auto pointer0 = c;\n while (s->getNext())\n {\n auto pointer1 = std::make_shared<Addition>();\n pointer1->setArg1(parseNode(s));\n pointer0->setArg2(pointer1);\n s = s->getNext();\n pointer0 = pointer1;\n }\n pointer0->setArg2(parseNode(s));\n }\n return c;\n }\n else if (node->isType(\"minus\"))\n {\n auto c = std::make_shared<Subtraction>();\n auto s1 = node->getNext();\n c->setArg1(parseNode(s1));\n c->setArg2(parseNode(s1->getNext()));\n return c;\n }\n else if (node->isType(\"times\"))\n {\n auto c = std::make_shared<Multiplication>();\n auto s = node->getNext();\n c->setArg1(parseNode(s));\n s = s->getNext();\n if (!s->getNext())\n {\n c->setArg2(parseNode(s));\n }\n else\n {\n auto pointer0 = c;\n while (s->getNext())\n {\n auto pointer1 = std::make_shared<Multiplication>();\n pointer1->setArg1(parseNode(s));\n pointer0->setArg2(pointer1);\n s = s->getNext();\n pointer0 = pointer1;\n }\n pointer0->setArg2(parseNode(s));\n }\n return c;\n }\n else if (node->isType(\"divide\"))\n {\n auto c = std::make_shared<Division>();\n auto s1 = node->getNext();\n c->setArg1(parseNode(s1));\n c->setArg2(parseNode(s1->getNext()));\n return c;\n }\n else if (node->isType(\"power\"))\n {\n auto c = std::make_shared<Power>();\n auto s1 = node->getNext();\n c->setArg1(parseNode(s1));\n c->setArg2(parseNode(s1->getNext()));\n return c;\n }\n else if (node->isType(\"sin\"))\n {\n auto c = std::make_shared<Sine>();\n c->setArg(parseNode(node->getNext()));\n return c;\n }\n else if (node->isType(\"cos\"))\n {\n auto c = std::make_shared<Cosine>();\n c->setArg(parseNode(node->getNext()));\n return c;\n }\n else if (node->isType(\"abs\"))\n {\n auto c = std::make_shared<AbsoluteValue>();\n c->setArg(parseNode(node->getNext()));\n return c;\n }\n else if (node->isType(\"ci\"))\n {\n auto name = node->getFirstChild()->convertToString();\n auto c = std::make_shared<libcellml::operators::Variable>(name);\n if (name != voi &&\n std::find(states.begin(), states.end(), name) == states.end())\n {\n states.push_back(name);\n }\n return c;\n }\n else if (node->isType(\"cn\"))\n {\n double value;\n std::istringstream iss(node->getFirstChild()->convertToString());\n iss >> value;\n auto c = std::make_shared<Constant>(value);\n return c;\n }\n else\n {\n ErrorPtr err = std::make_shared<Error>();\n err->setDescription(\"Found node of type \"\n + node->getType() +\n \" which is currently not supported by the Generator class.\");\n addError(err);\n throw UnknownNode();\n\n return std::make_shared<Constant>(0);\n }\n}\n\nstd::shared_ptr<Representable> Generator::parseMathML(std::string math)\n{\n XmlDocPtr mathDoc = std::make_shared<XmlDoc>();\n mathDoc->parse(math);\n\n const XmlNodePtr root = mathDoc->getRootNode();\n\n XmlNodePtr childNode = root->getFirstChild();\n childNode = childNode->getFirstChild();\n childNode = childNode->getNext();\n childNode = childNode->getNext();\n\n return parseNode(childNode);\n}\n\nvoid Generator::findVOIHelper(XmlNodePtr node)\n{\n if (node->isType(\"bvar\"))\n {\n voi = node->getFirstChild()->getFirstChild()->convertToString();\n return;\n }\n else\n {\n if (node->getFirstChild())\n {\n findVOIHelper(node->getFirstChild());\n }\n if (node->getNext())\n {\n findVOIHelper(node->getNext());\n }\n }\n}\n\nvoid Generator::findVOI(std::string math)\n{\n XmlDocPtr mathDoc = std::make_shared<XmlDoc>();\n mathDoc->parse(math);\n\n const XmlNodePtr root = mathDoc->getRootNode();\n XmlNodePtr node = root->getFirstChild();\n\n findVOIHelper(node);\n}\n\nconst char * CodeNotGenerated::what () const throw ()\n{\n return \"No code was generated yet, you should call \"\n \"Generator::generateCode before calling this method.\";\n}\n\nconst char * UnknownNode::what () const throw ()\n{\n return \"Found node of unknown type\";\n}\n\ntemplate std::string Generator::generateCode<CXX>(ModelPtr m);\n\n}\n<|endoftext|>"} {"text":"<commit_before>\/\/ This file is part of the dune-gdt project:\n\/\/ https:\/\/github.com\/dune-community\/dune-gdt\n\/\/ Copyright 2010-2018 dune-gdt developers and contributors. All rights reserved.\n\/\/ License: Dual licensed as BSD 2-Clause License (http:\/\/opensource.org\/licenses\/BSD-2-Clause)\n\/\/ or GPL-2.0+ (http:\/\/opensource.org\/licenses\/gpl-license)\n\/\/ with \"runtime exception\" (http:\/\/www.dune-project.org\/license.html)\n\/\/ Authors:\n\/\/ Felix Schindler (2015 - 2017)\n\/\/ Rene Milk (2016)\n\n#ifndef DUNE_GDT_DISCRETEFUNCTION_REINTERPRET_HH\n#define DUNE_GDT_DISCRETEFUNCTION_REINTERPRET_HH\n\n#include <dune\/xt\/grid\/type_traits.hh>\n#include <dune\/xt\/functions\/reinterpret.hh>\n\n#include \"default.hh\"\n\nnamespace Dune {\nnamespace GDT {\n\n\n\/**\n * \\sa XT::Functions::ReinterpretLocalizableFunction\n * \\sa XT::Functions::reinterpret\n *\/\ntemplate <class TargetElement, class SGV, size_t r, size_t rC, class R, class V>\nXT::Functions::ReinterpretLocalizableFunction<SGV, TargetElement, r, rC, R>\nreinterpret(const DiscreteFunction<V, SGV, r, rC, R>& source)\n{\n return XT::Functions::ReinterpretLocalizableFunction<SGV, TargetElement, r, rC, R>(source,\n source.space().grid_view());\n}\n\n\n\/**\n * \\sa XT::Functions::ReinterpretLocalizableFunction\n * \\sa XT::Functions::reinterpret\n *\/\ntemplate <class SGV, size_t r, size_t rC, class R, class V, class TargetGridView>\nstd::enable_if_t<XT::Grid::is_layer<TargetGridView>::value,\n XT::Functions::\n ReinterpretLocalizableFunction<SGV, XT::Grid::extract_entity_t<TargetGridView>, r, rC, R>>\nreinterpret(const DiscreteFunction<V, SGV, r, rC, R>& source, const TargetGridView& \/*target_grid_view*\/)\n{\n return XT::Functions::ReinterpretLocalizableFunction<SGV, XT::Grid::extract_entity_t<TargetGridView>, r, rC, R>(\n source, source.space().grid_view());\n}\n\n\n} \/\/ namespace GDT\n} \/\/ namespace Dune\n\n#endif \/\/ DUNE_GDT_DISCRETEFUNCTION_REINTERPRET_HH\n<commit_msg>[discretefunction.reinterpret] fix include<commit_after>\/\/ This file is part of the dune-gdt project:\n\/\/ https:\/\/github.com\/dune-community\/dune-gdt\n\/\/ Copyright 2010-2018 dune-gdt developers and contributors. All rights reserved.\n\/\/ License: Dual licensed as BSD 2-Clause License (http:\/\/opensource.org\/licenses\/BSD-2-Clause)\n\/\/ or GPL-2.0+ (http:\/\/opensource.org\/licenses\/gpl-license)\n\/\/ with \"runtime exception\" (http:\/\/www.dune-project.org\/license.html)\n\/\/ Authors:\n\/\/ Felix Schindler (2015 - 2017)\n\/\/ Rene Milk (2016)\n\n#ifndef DUNE_GDT_DISCRETEFUNCTION_REINTERPRET_HH\n#define DUNE_GDT_DISCRETEFUNCTION_REINTERPRET_HH\n\n#include <dune\/xt\/grid\/type_traits.hh>\n#include <dune\/xt\/functions\/base\/reinterpret.hh>\n\n#include \"default.hh\"\n\nnamespace Dune {\nnamespace GDT {\n\n\n\/**\n * \\sa XT::Functions::ReinterpretLocalizableFunction\n * \\sa XT::Functions::reinterpret\n *\/\ntemplate <class TargetElement, class SGV, size_t r, size_t rC, class R, class V>\nXT::Functions::ReinterpretLocalizableFunction<SGV, TargetElement, r, rC, R>\nreinterpret(const DiscreteFunction<V, SGV, r, rC, R>& source)\n{\n return XT::Functions::ReinterpretLocalizableFunction<SGV, TargetElement, r, rC, R>(source,\n source.space().grid_view());\n}\n\n\n\/**\n * \\sa XT::Functions::ReinterpretLocalizableFunction\n * \\sa XT::Functions::reinterpret\n *\/\ntemplate <class SGV, size_t r, size_t rC, class R, class V, class TargetGridView>\nstd::enable_if_t<XT::Grid::is_layer<TargetGridView>::value,\n XT::Functions::\n ReinterpretLocalizableFunction<SGV, XT::Grid::extract_entity_t<TargetGridView>, r, rC, R>>\nreinterpret(const DiscreteFunction<V, SGV, r, rC, R>& source, const TargetGridView& \/*target_grid_view*\/)\n{\n return XT::Functions::ReinterpretLocalizableFunction<SGV, XT::Grid::extract_entity_t<TargetGridView>, r, rC, R>(\n source, source.space().grid_view());\n}\n\n\n} \/\/ namespace GDT\n} \/\/ namespace Dune\n\n#endif \/\/ DUNE_GDT_DISCRETEFUNCTION_REINTERPRET_HH\n<|endoftext|>"} {"text":"<commit_before>\/\/ This file is part of the dune-gdt project:\n\/\/ https:\/\/github.com\/dune-community\/dune-gdt\n\/\/ Copyright 2010-2018 dune-gdt developers and contributors. All rights reserved.\n\/\/ License: Dual licensed as BSD 2-Clause License (http:\/\/opensource.org\/licenses\/BSD-2-Clause)\n\/\/ or GPL-2.0+ (http:\/\/opensource.org\/licenses\/gpl-license)\n\/\/ with \"runtime exception\" (http:\/\/www.dune-project.org\/license.html)\n\/\/ Authors:\n\/\/ Felix Schindler (2019)\n\n#ifndef DUNE_GDT_TOOLS_GRID_QUALITY_ESTIMATES_HH\n#define DUNE_GDT_TOOLS_GRID_QUALITY_ESTIMATES_HH\n\n#include <limits>\n#include <vector>\n\n#include <dune\/grid\/common\/rangegenerators.hh>\n\n#include <dune\/xt\/common\/exceptions.hh>\n#include <dune\/xt\/la\/container\/common.hh>\n#include <dune\/xt\/la\/container\/conversion.hh>\n#include <dune\/xt\/la\/generalized-eigen-solver.hh>\n#include <dune\/xt\/grid\/entity.hh>\n#include <dune\/xt\/grid\/intersection.hh>\n#include <dune\/xt\/grid\/type_traits.hh>\n\n#include <dune\/gdt\/local\/bilinear-forms\/integrals.hh>\n#include <dune\/gdt\/local\/integrands\/laplace.hh>\n#include <dune\/gdt\/local\/integrands\/product.hh>\n#include <dune\/gdt\/spaces\/interface.hh>\n\nnamespace Dune {\nnamespace GDT {\n\n\ntemplate <class GV, size_t r>\ndouble estimate_inverse_inequality_constant(const SpaceInterface<GV, r>& space)\n{\n DUNE_THROW_IF(!XT::Common::Lapacke::available(), XT::Common::Exceptions::dependency_missing, \"lapacke\");\n using E = XT::Grid::extract_entity_t<GV>;\n double result = std::numeric_limits<double>::min();\n auto basis = space.basis().localize();\n for (auto&& element : elements(space.grid_view())) {\n basis->bind(element);\n const double h = XT::Grid::diameter(element);\n auto H1_product_matrix = XT::LA::convert_to<XT::LA::CommonDenseMatrix<double>>(\n LocalElementIntegralBilinearForm<E, r>(LocalLaplaceIntegrand<E, r>()).apply2(*basis, *basis));\n auto L2_product_matrix = XT::LA::convert_to<XT::LA::CommonDenseMatrix<double>>(\n LocalElementIntegralBilinearForm<E, r>(LocalElementProductIntegrand<E, r>()).apply2(*basis, *basis));\n auto evs =\n XT::LA::make_generalized_eigen_solver(H1_product_matrix,\n L2_product_matrix,\n {{\"type\", XT::LA::generalized_eigen_solver_types(H1_product_matrix)[0]},\n {\"compute_eigenvectors\", \"false\"},\n {\"assert_real_eigenvalues\", \"1e-15\"}})\n .real_eigenvalues();\n double min_ev = std::numeric_limits<double>::max();\n for (auto&& ev : evs)\n if (std::abs(ev) > 1e-7) \/\/ TODO: find a better tolerance here!\n min_ev = std::min(min_ev, ev);\n \/\/ the smalles nonzero eigenvalue is (C_I \/ h)^2\n result = std::max(result, h * std::sqrt(min_ev));\n }\n return result;\n} \/\/ ... estimate_inverse_inequality_constant(...)\n\n\ntemplate <class GV, size_t r>\ndouble estimate_combined_inverse_trace_inequality_constant(const SpaceInterface<GV, r>& space)\n{\n DUNE_THROW_IF(!XT::Common::Lapacke::available(), XT::Common::Exceptions::dependency_missing, \"lapacke\");\n using E = XT::Grid::extract_entity_t<GV>;\n using I = XT::Grid::extract_intersection_t<GV>;\n double result = std::numeric_limits<double>::min();\n auto basis = space.basis().localize();\n for (auto&& element : elements(space.grid_view())) {\n basis->bind(element);\n const double h = XT::Grid::diameter(element);\n XT::LA::CommonDenseMatrix<double> L2_face_product_matrix(basis->size(), basis->size(), 0.);\n DynamicMatrix<double> tmp_L2_face_product_matrix(basis->size(), basis->size(), 0.);\n for (auto&& intersection : intersections(space.grid_view(), element)) {\n LocalIntersectionIntegralBilinearForm<I, r>(LocalIntersectionProductIntegrand<I, r>(1.))\n .apply2(intersection, *basis, *basis, tmp_L2_face_product_matrix);\n for (size_t ii = 0; ii < basis->size(); ++ii)\n for (size_t jj = 0; jj < basis->size(); ++jj)\n L2_face_product_matrix.add_to_entry(ii, jj, tmp_L2_face_product_matrix[ii][jj]);\n }\n auto L2_element_product_matrix = XT::LA::convert_to<XT::LA::CommonDenseMatrix<double>>(\n LocalElementIntegralBilinearForm<E, r>(LocalElementProductIntegrand<E, r>(1.)).apply2(*basis, *basis));\n auto evs = XT::LA::make_generalized_eigen_solver(\n L2_face_product_matrix,\n L2_element_product_matrix,\n {{\"type\", XT::LA::generalized_eigen_solver_types(L2_face_product_matrix)[0]},\n {\"compute_eigenvectors\", \"false\"},\n {\"assert_real_eigenvalues\", \"1e-15\"}})\n .real_eigenvalues();\n double min_ev = std::numeric_limits<double>::max();\n for (auto&& ev : evs)\n if (std::abs(ev) > 1e-7) \/\/ TODO: find a better tolerance here!\n min_ev = std::min(min_ev, ev);\n \/\/ the smalles nonzero eigenvalue is (C_M (1 + C_I)) \/ h\n result = std::max(result, h * min_ev);\n }\n return result;\n} \/\/ ... estimate_combined_inverse_trace_inequality_constant(...)\n\n\ntemplate <class GV>\ndouble estimate_element_to_intersection_equivalence_constant(\n const GridView<GV>& grid_view,\n const std::function<double(const XT::Grid::extract_intersection_t<GridView<GV>>&)>& intersection_diameter =\n [](const auto& intersection) {\n if (GridView<GV>::dimension == 1) {\n if (intersection.neighbor())\n return 0.5 * (XT::Grid::diameter(intersection.inside()) + XT::Grid::diameter(intersection.outside()));\n else\n return XT::Grid::diameter(intersection.inside());\n } else\n return XT::Grid::diameter(intersection);\n })\n{\n auto result = std::numeric_limits<double>::min();\n for (auto&& element : elements(grid_view)) {\n const double h = XT::Grid::diameter(element);\n for (auto&& intersection : intersections(grid_view, element))\n result = std::max(result, intersection_diameter(intersection) \/ h);\n return result;\n }\n} \/\/ ... estimate_element_to_intersection_equivalence_constant(...)\n\n\n} \/\/ namespace GDT\n} \/\/ namespace Dune\n\n#endif \/\/ DUNE_GDT_TOOLS_GRID_QUALITY_ESTIMATES_HH\n<commit_msg>[tools] fix too early return<commit_after>\/\/ This file is part of the dune-gdt project:\n\/\/ https:\/\/github.com\/dune-community\/dune-gdt\n\/\/ Copyright 2010-2018 dune-gdt developers and contributors. All rights reserved.\n\/\/ License: Dual licensed as BSD 2-Clause License (http:\/\/opensource.org\/licenses\/BSD-2-Clause)\n\/\/ or GPL-2.0+ (http:\/\/opensource.org\/licenses\/gpl-license)\n\/\/ with \"runtime exception\" (http:\/\/www.dune-project.org\/license.html)\n\/\/ Authors:\n\/\/ Felix Schindler (2019)\n\n#ifndef DUNE_GDT_TOOLS_GRID_QUALITY_ESTIMATES_HH\n#define DUNE_GDT_TOOLS_GRID_QUALITY_ESTIMATES_HH\n\n#include <limits>\n#include <vector>\n\n#include <dune\/grid\/common\/rangegenerators.hh>\n\n#include <dune\/xt\/common\/exceptions.hh>\n#include <dune\/xt\/la\/container\/common.hh>\n#include <dune\/xt\/la\/container\/conversion.hh>\n#include <dune\/xt\/la\/generalized-eigen-solver.hh>\n#include <dune\/xt\/grid\/entity.hh>\n#include <dune\/xt\/grid\/intersection.hh>\n#include <dune\/xt\/grid\/type_traits.hh>\n\n#include <dune\/gdt\/local\/bilinear-forms\/integrals.hh>\n#include <dune\/gdt\/local\/integrands\/laplace.hh>\n#include <dune\/gdt\/local\/integrands\/product.hh>\n#include <dune\/gdt\/spaces\/interface.hh>\n\nnamespace Dune {\nnamespace GDT {\n\n\ntemplate <class GV, size_t r>\ndouble estimate_inverse_inequality_constant(const SpaceInterface<GV, r>& space)\n{\n DUNE_THROW_IF(!XT::Common::Lapacke::available(), XT::Common::Exceptions::dependency_missing, \"lapacke\");\n using E = XT::Grid::extract_entity_t<GV>;\n double result = std::numeric_limits<double>::min();\n auto basis = space.basis().localize();\n for (auto&& element : elements(space.grid_view())) {\n basis->bind(element);\n const double h = XT::Grid::diameter(element);\n auto H1_product_matrix = XT::LA::convert_to<XT::LA::CommonDenseMatrix<double>>(\n LocalElementIntegralBilinearForm<E, r>(LocalLaplaceIntegrand<E, r>()).apply2(*basis, *basis));\n auto L2_product_matrix = XT::LA::convert_to<XT::LA::CommonDenseMatrix<double>>(\n LocalElementIntegralBilinearForm<E, r>(LocalElementProductIntegrand<E, r>()).apply2(*basis, *basis));\n auto evs =\n XT::LA::make_generalized_eigen_solver(H1_product_matrix,\n L2_product_matrix,\n {{\"type\", XT::LA::generalized_eigen_solver_types(H1_product_matrix)[0]},\n {\"compute_eigenvectors\", \"false\"},\n {\"assert_real_eigenvalues\", \"1e-15\"}})\n .real_eigenvalues();\n double min_ev = std::numeric_limits<double>::max();\n for (auto&& ev : evs)\n if (std::abs(ev) > 1e-7) \/\/ TODO: find a better tolerance here!\n min_ev = std::min(min_ev, ev);\n \/\/ the smalles nonzero eigenvalue is (C_I \/ h)^2\n result = std::max(result, h * std::sqrt(min_ev));\n }\n return result;\n} \/\/ ... estimate_inverse_inequality_constant(...)\n\n\ntemplate <class GV, size_t r>\ndouble estimate_combined_inverse_trace_inequality_constant(const SpaceInterface<GV, r>& space)\n{\n DUNE_THROW_IF(!XT::Common::Lapacke::available(), XT::Common::Exceptions::dependency_missing, \"lapacke\");\n using E = XT::Grid::extract_entity_t<GV>;\n using I = XT::Grid::extract_intersection_t<GV>;\n double result = std::numeric_limits<double>::min();\n auto basis = space.basis().localize();\n for (auto&& element : elements(space.grid_view())) {\n basis->bind(element);\n const double h = XT::Grid::diameter(element);\n XT::LA::CommonDenseMatrix<double> L2_face_product_matrix(basis->size(), basis->size(), 0.);\n DynamicMatrix<double> tmp_L2_face_product_matrix(basis->size(), basis->size(), 0.);\n for (auto&& intersection : intersections(space.grid_view(), element)) {\n LocalIntersectionIntegralBilinearForm<I, r>(LocalIntersectionProductIntegrand<I, r>(1.))\n .apply2(intersection, *basis, *basis, tmp_L2_face_product_matrix);\n for (size_t ii = 0; ii < basis->size(); ++ii)\n for (size_t jj = 0; jj < basis->size(); ++jj)\n L2_face_product_matrix.add_to_entry(ii, jj, tmp_L2_face_product_matrix[ii][jj]);\n }\n auto L2_element_product_matrix = XT::LA::convert_to<XT::LA::CommonDenseMatrix<double>>(\n LocalElementIntegralBilinearForm<E, r>(LocalElementProductIntegrand<E, r>(1.)).apply2(*basis, *basis));\n auto evs = XT::LA::make_generalized_eigen_solver(\n L2_face_product_matrix,\n L2_element_product_matrix,\n {{\"type\", XT::LA::generalized_eigen_solver_types(L2_face_product_matrix)[0]},\n {\"compute_eigenvectors\", \"false\"},\n {\"assert_real_eigenvalues\", \"1e-15\"}})\n .real_eigenvalues();\n double min_ev = std::numeric_limits<double>::max();\n for (auto&& ev : evs)\n if (std::abs(ev) > 1e-7) \/\/ TODO: find a better tolerance here!\n min_ev = std::min(min_ev, ev);\n \/\/ the smalles nonzero eigenvalue is (C_M (1 + C_I)) \/ h\n result = std::max(result, h * min_ev);\n }\n return result;\n} \/\/ ... estimate_combined_inverse_trace_inequality_constant(...)\n\n\ntemplate <class GV>\ndouble estimate_element_to_intersection_equivalence_constant(\n const GridView<GV>& grid_view,\n const std::function<double(const XT::Grid::extract_intersection_t<GridView<GV>>&)>& intersection_diameter =\n [](const auto& intersection) {\n if (GridView<GV>::dimension == 1) {\n if (intersection.neighbor())\n return 0.5 * (XT::Grid::diameter(intersection.inside()) + XT::Grid::diameter(intersection.outside()));\n else\n return XT::Grid::diameter(intersection.inside());\n } else\n return XT::Grid::diameter(intersection);\n })\n{\n auto result = std::numeric_limits<double>::min();\n for (auto&& element : elements(grid_view)) {\n const double h = XT::Grid::diameter(element);\n for (auto&& intersection : intersections(grid_view, element))\n result = std::max(result, intersection_diameter(intersection) \/ h);\n }\n return result;\n} \/\/ ... estimate_element_to_intersection_equivalence_constant(...)\n\n\n} \/\/ namespace GDT\n} \/\/ namespace Dune\n\n#endif \/\/ DUNE_GDT_TOOLS_GRID_QUALITY_ESTIMATES_HH\n<|endoftext|>"} {"text":"<commit_before><commit_msg>Fixed an infinite loop when the paste destination has only one sheet.<commit_after><|endoftext|>"} {"text":"<commit_before>#include <iostream>\n#include <cstdio>\n#include <algorithm>\n#include <utility>\n#include <string>\n#include <vector>\n#include <cmath>\n#include <set>\n#include <stack>\n#include <queue>\n#include <map>\n#include <sstream>\n#include <ctime>\n#include <numeric>\n#include <cstring>\n#include <functional>\n\nusing namespace std;\n\ntypedef vector<int> VI;\ntypedef pair<int, int> PII;\ntypedef vector<PII> VPII;\ntypedef vector<string> VS;\ntypedef map<string, int> MSI;\ntypedef long long int LL;\ntypedef unsigned long long int ULL;\n\n#define REP(i, n) for (int i = 0; i < n; ++i)\n#define FOR(i, a, b) for (int i = a; i < b; ++i)\n#define FORD(i, a, b) for (int i = a-1; i >= b; --i)\n#define ALL(x) x.begin(), x.end()\n#define SIZE(x) (int)x.size()\n#define FOREACH(it, c) for (__typeof(c.begin()) it = c.begin(); it != c.end(); ++it)\n#define INF 1023456789\n#define PB push_back\n#define MP make_pair\n#define DEBUG(x) cerr<<#x<<\": \"<<x<<endl;\n#define ERR(...) fprintf(stderr, __VA_ARGS__);\n#define EPS 1e-9\n\nint main(void) {\n srand(time(NULL));\n cout << rand()%2134 << endl;\n double first = 1.4;\n DEBUG(first);\n\n return 0;\n}\n\n----------Extended GCD algorithm----------\nstruct ans {\n int x, y, gcd;\n};\n\n\/\/To find an inverse of a mod n, a must be coprime with n and we sould run\n\/\/extGcd(a, n) and take the x value of the result - this is the inverse\n\/\/a * x + b * y = gcd(a,b)\nans extGcd(int a, int b) {\n \/\/PRE: a > b ??? seems to work without it\n ans res;\n if (b == 0) {res.x=1; res.y=0; res.gcd=a;}\n else {\n\tans prev = extGcd(b, a % b);\n\tres.x = prev.y; res.y = prev.x - (a \/ b) * prev.y; res.gcd = prev.gcd;\n }\n return res;\n}\n\n----------Online LCA O(n log n)----------\n#include <vector>\n#include <algorithm>\n\nusing namespace std;\n\n#define MAX_N 1001\n#define MAX_LOG 10\n\nstruct interval {\n int in, out;\n};\n\nvector<int> graph[MAX_N];\nint pred[MAX_N][MAX_LOG];\nint depth[MAX_N];\ninterval processTimes[MAX_N];\nint n; \/\/number of vertices in the tree\n\nint dfs(int v, int time) { \n processTimes[v].in = ++time;\n for (int i=0; i<graph[v].size(); i++) {\n\tint cand = graph[v][i];\n\tif (depth[cand] == -1) {\n\t depth[cand] = depth[v] + 1;\n\t pred[cand][0] = v;\n\t time = dfs(cand, time);\n\t}\n }\n processTimes[v].out = ++time;\n return time;\n}\n\nvoid calcPredTable(void) {\n int maxDepth = 0;\n for (int i=1; i<=n; i++) maxDepth = max(depth[i], maxDepth);\n for (int dist=2, j=1; dist <= maxDepth; j++, dist*=2) {\n\tfor (int i=1; i<=n; i++) pred[i][j] = pred[pred[i][j-1]][j-1];\n }\n}\n\nvoid preprocess(int root) {\n for (int i=1; i<=n; i++) depth[i] = -1;\n depth[root] = 0; pred[root][0] = 0;\n dfs(root, 0);\n calcPredTable();\n}\n\nbool contains(interval a, interval b) {\n return (a.in < b.in && a.out > b.out);\n}\n\nint reachDepth(int v, int d) {\n if (depth[v] == d) return v;\n int i=0;\n while (depth[pred[v][i+1]] >= d) i++;\n return reachDepth(pred[v][i], d);\n}\n\nint lca(int va, int vb) {\n if (va == vb || contains(processTimes[va], processTimes[vb])) return va;\n if (contains(processTimes[vb], processTimes[va])) return vb;\n if (depth[va] > depth[vb]) va = reachDepth(va, depth[vb]);\n if (depth[va] < depth[vb]) vb = reachDepth(vb, depth[va]);\n while(va != vb) {\n\tint i=0;\n\tfor (; pred[va][i+1] != pred[vb][i+1]; i++)\n\t ;\n\tva = pred[va][i]; vb = pred[vb][i];\n }\n return va;\n}\n\n----------Maximum Flow in a directed graph (derivation of the Dinic's method) \nO(n^4) with a VERY small const----------\n\n#include <vector>\n#include <queue>\n#include <algorithm>\nusing namespace std;\n\n#define MAX_N 5001\nconst int inf = 2000000000; \n\nint begin[MAX_N];\nint dist[MAX_N];\nvector<int> graph[MAX_N];\nint c[MAX_N][MAX_N];\nbool vis[MAX_N];\nqueue<int> q;\n\nvoid bfsIn(int v) {\n for (int i=0; i<graph[v].size(); i++) {\n\tint cand = graph[v][i];\n\tif (!vis[cand] && c[v][cand] > 0) {\n\t vis[cand] = true; dist[cand] = dist[v] + 1;\n\t q.push(cand);\n\t}\n }\n}\n\nbool bfs(int s, int t) {\n for (int i=s+1; i<=t; i++) {\n\tdist[i] = 0; vis[i] = false;\n }\n vis[s]=true; dist[s]=0; q.push(s);\n while(!q.empty()) {\n\tint v = q.front(); q.pop();\n\tbfsIn(v);\n }\n return vis[t];\n}\n\nint dfs(int v, int t, int min_cap) {\n int res = 0;\n if (v == t || min_cap == 0) return min_cap;\n for (int& i=begin[v]; i<graph[v].size(); i++) {\n\tint cand = graph[v][i];\n\tif (dist[cand] == dist[v]+1 && c[v][cand] > 0) {\n\t int newFlow = dfs(cand, t, min(min_cap, c[v][cand]));\n\t c[v][cand] -= newFlow;\n\t c[cand][v] += newFlow;\n\t min_cap -= newFlow;\n\t res += newFlow;\n\t if (min_cap == 0) break;\n\t}\n }\n return res;\n}\n\nint maxFlow(int s, int t) {\n long long result = 0;\n while (bfs(s,t)) {\n for (int i=s; i<=t; i++) begin[i] = 0;\n int init_cap = inf;\n\tresult += dfs(s,t,init_cap);\n }\n return result;\n}\n\n----------Maximum matching in the bipartite graph O(n^2.5)----------\n#include <algorithm>\nusing namespace std;\n#define MAX_X 201\n#define MAX_Y 401\n\nvector<int> graph[MAX_X];\nbool vis[MAX_X];\nint matchX[MAX_X];\nint matchY[MAX_Y];\nint sizeX, sizeY;\n\nint dfs(int x) {\n vis[x] = true;\n for (int i=0; i<graph[x].size(); i++) {\n\tint y = graph[x][i];\n\tif (matchY[y] == -1 || (!vis[matchY[y]] && dfs(matchY[y]))) {\n\t matchY[y] = x;\n\t matchX[x] = y;\n\t return 1;\n\t}\n }\n return 0;\n}\n\nint maxMatching(void) {\n for (int i=1; i<=sizeX; i++) random_shuffle(graph[i].begin(), graph[i].end());\n for (int i=1; i<=sizeX; i++) matchX[i] = -1;\n for (int i=1; i<=sizeY; i++) matchY[i] = -1;\n int res = 0; bool change = true;\n while(change) {\n\tchange = false;\n\tfor (int i=1; i<=sizeX; i++) vis[i] = false;\n\tfor (int i=1; i<=sizeX; i++) {\n\t if (matchX[i] == -1 && !vis[i] && dfs(i)) { \n\t\tres++; change = true; \n\t }\n\t}\n }\n return res;\n}\n\n\n----------KMP O(n + m)-------------\n#include<string>\n#include<cstdio>\n\n#define MAX_M 1001\n\nint prefixes[MAX_M];\nstd::string t, p;\n\n\/\/compute longest prefixes of P which are proper suffixes of P_q\nint prefix() {\n prefixes[1] = 0;\n int k = 0;\n for(int q = 2; q <= p.length(); q++) {\n while (k > 0 && p[k] != p[q-1]) k = prefixes[k];\n if (p[k] == p[q-1]) k++;\n prefixes[q] = k;\n }\n}\n\/\/print out shifts for which pattern occurs in target\nvoid kmp(){\n prefix();\n int q = 0;\n for (int i = 1; i <= t.length(); i++) {\n while(q > 0 && p[q] != t[i-1]) q = prefixes[q];\n if (p[q] == t[i-1]) q++;\n if (q == p.length()) {\n printf(\"valid shift: %d\\n\", i - (int) p.length()); q = prefixes[q];\n }\n }\n}\n\n\n<commit_msg>Added implementation of KMP<commit_after>#include <iostream>\n#include <cstdio>\n#include <algorithm>\n#include <utility>\n#include <string>\n#include <vector>\n#include <cmath>\n#include <set>\n#include <stack>\n#include <queue>\n#include <map>\n#include <sstream>\n#include <ctime>\n#include <numeric>\n#include <cstring>\n#include <functional>\n\nusing namespace std;\n\ntypedef vector<int> VI;\ntypedef pair<int, int> PII;\ntypedef vector<PII> VPII;\ntypedef vector<string> VS;\ntypedef map<string, int> MSI;\ntypedef long long int LL;\ntypedef unsigned long long int ULL;\n\n#define REP(i, n) for (int i = 0; i < n; ++i)\n#define FOR(i, a, b) for (int i = a; i < b; ++i)\n#define FORD(i, a, b) for (int i = a-1; i >= b; --i)\n#define ALL(x) x.begin(), x.end()\n#define SIZE(x) (int)x.size()\n#define FOREACH(it, c) for (__typeof(c.begin()) it = c.begin(); it != c.end(); ++it)\n#define INF 1023456789\n#define PB push_back\n#define MP make_pair\n#define DEBUG(x) cerr<<#x<<\": \"<<x<<endl;\n#define ERR(...) fprintf(stderr, __VA_ARGS__);\n#define EPS 1e-9\n\nint main(void) {\n srand(time(NULL));\n cout << rand()%2134 << endl;\n double first = 1.4;\n DEBUG(first);\n\n return 0;\n}\n\n----------Extended GCD algorithm----------\nstruct ans {\n int x, y, gcd;\n};\n\n\/\/To find an inverse of a mod n, a must be coprime with n and we sould run\n\/\/extGcd(a, n) and take the x value of the result - this is the inverse\n\/\/a * x + b * y = gcd(a,b)\nans extGcd(int a, int b) {\n \/\/PRE: a > b ??? seems to work without it\n ans res;\n if (b == 0) {res.x=1; res.y=0; res.gcd=a;}\n else {\n\tans prev = extGcd(b, a % b);\n\tres.x = prev.y; res.y = prev.x - (a \/ b) * prev.y; res.gcd = prev.gcd;\n }\n return res;\n}\n\n----------Union Find algorithm with the heuristics(path compression and joining \naccording to rank) O(m alpha(n))----------\n#define MAX_N 10001\nint rank[MAX_N];\/\/upper bound on the length of the path from the root to a leaf\nint rep[MAX_N];\n\nvoid makeSet(int x) {\n rank[x] = 0;\n rep[x] = x;\n}\n\nint findSet(int x) {\n if (x != rep[x]) rep[x] = findSet(rep[x]); \/\/path compression\n return rep[x];\n}\n\nvoid link(int x, int y) {\n if (rank[x] > rank[y]) rep[y] = x;\/\/join according to rang\n else {\n\tif (rank[x] == rank[y]) rank[y]++;\n\trep[x] = y;\n }\n}\n\nvoid unionSet(int x, int y) {\n link(findSet(x), findSet(y));\n}\n\n----------Online LCA O(n log n)----------\n#include <vector>\n#include <algorithm>\n\nusing namespace std;\n\n#define MAX_N 1001\n#define MAX_LOG 10\n\nstruct interval {\n int in, out;\n};\n\nvector<int> graph[MAX_N];\nint pred[MAX_N][MAX_LOG];\nint depth[MAX_N];\ninterval processTimes[MAX_N];\nint n; \/\/number of vertices in the tree\n\nint dfs(int v, int time) { \n processTimes[v].in = ++time;\n for (int i=0; i<graph[v].size(); i++) {\n\tint cand = graph[v][i];\n\tif (depth[cand] == -1) {\n\t depth[cand] = depth[v] + 1;\n\t pred[cand][0] = v;\n\t time = dfs(cand, time);\n\t}\n }\n processTimes[v].out = ++time;\n return time;\n}\n\nvoid calcPredTable(void) {\n int maxDepth = 0;\n for (int i=1; i<=n; i++) maxDepth = max(depth[i], maxDepth);\n for (int dist=2, j=1; dist <= maxDepth; j++, dist*=2) {\n\tfor (int i=1; i<=n; i++) pred[i][j] = pred[pred[i][j-1]][j-1];\n }\n}\n\nvoid preprocess(int root) {\n for (int i=1; i<=n; i++) depth[i] = -1;\n depth[root] = 0; pred[root][0] = 0;\n dfs(root, 0);\n calcPredTable();\n}\n\nbool contains(interval a, interval b) {\n return (a.in < b.in && a.out > b.out);\n}\n\nint reachDepth(int v, int d) {\n if (depth[v] == d) return v;\n int i=0;\n while (depth[pred[v][i+1]] >= d) i++;\n return reachDepth(pred[v][i], d);\n}\n\nint lca(int va, int vb) {\n if (va == vb || contains(processTimes[va], processTimes[vb])) return va;\n if (contains(processTimes[vb], processTimes[va])) return vb;\n if (depth[va] > depth[vb]) va = reachDepth(va, depth[vb]);\n if (depth[va] < depth[vb]) vb = reachDepth(vb, depth[va]);\n while(va != vb) {\n\tint i=0;\n\tfor (; pred[va][i+1] != pred[vb][i+1]; i++)\n\t ;\n\tva = pred[va][i]; vb = pred[vb][i];\n }\n return va;\n}\n\n----------Maximum Flow in a directed graph (derivation of the Dinic's method) \nO(n^4) with a VERY small const----------\n\n#include <vector>\n#include <queue>\n#include <algorithm>\nusing namespace std;\n\n#define MAX_N 5001\nconst int inf = 2000000000; \n\nint begin[MAX_N];\nint dist[MAX_N];\nvector<int> graph[MAX_N];\nint c[MAX_N][MAX_N];\nbool vis[MAX_N];\nqueue<int> q;\n\nvoid bfsIn(int v) {\n for (int i=0; i<graph[v].size(); i++) {\n\tint cand = graph[v][i];\n\tif (!vis[cand] && c[v][cand] > 0) {\n\t vis[cand] = true; dist[cand] = dist[v] + 1;\n\t q.push(cand);\n\t}\n }\n}\n\nbool bfs(int s, int t) {\n for (int i=s+1; i<=t; i++) {\n\tdist[i] = 0; vis[i] = false;\n }\n vis[s]=true; dist[s]=0; q.push(s);\n while(!q.empty()) {\n\tint v = q.front(); q.pop();\n\tbfsIn(v);\n }\n return vis[t];\n}\n\nint dfs(int v, int t, int min_cap) {\n int res = 0;\n if (v == t || min_cap == 0) return min_cap;\n for (int& i=begin[v]; i<graph[v].size(); i++) {\n\tint cand = graph[v][i];\n\tif (dist[cand] == dist[v]+1 && c[v][cand] > 0) {\n\t int newFlow = dfs(cand, t, min(min_cap, c[v][cand]));\n\t c[v][cand] -= newFlow;\n\t c[cand][v] += newFlow;\n\t min_cap -= newFlow;\n\t res += newFlow;\n\t if (min_cap == 0) break;\n\t}\n }\n return res;\n}\n\nint maxFlow(int s, int t) {\n long long result = 0;\n while (bfs(s,t)) {\n for (int i=s; i<=t; i++) begin[i] = 0;\n int init_cap = inf;\n\tresult += dfs(s,t,init_cap);\n }\n return result;\n}\n\n----------Maximum matching in the bipartite graph O(n^2.5)----------\n#include <algorithm>\nusing namespace std;\n#define MAX_X 201\n#define MAX_Y 401\n\nvector<int> graph[MAX_X];\nbool vis[MAX_X];\nint matchX[MAX_X];\nint matchY[MAX_Y];\nint sizeX, sizeY;\n\nint dfs(int x) {\n vis[x] = true;\n for (int i=0; i<graph[x].size(); i++) {\n\tint y = graph[x][i];\n\tif (matchY[y] == -1 || (!vis[matchY[y]] && dfs(matchY[y]))) {\n\t matchY[y] = x;\n\t matchX[x] = y;\n\t return 1;\n\t}\n }\n return 0;\n}\n\nint maxMatching(void) {\n for (int i=1; i<=sizeX; i++) random_shuffle(graph[i].begin(), graph[i].end());\n for (int i=1; i<=sizeX; i++) matchX[i] = -1;\n for (int i=1; i<=sizeY; i++) matchY[i] = -1;\n int res = 0; bool change = true;\n while(change) {\n\tchange = false;\n\tfor (int i=1; i<=sizeX; i++) vis[i] = false;\n\tfor (int i=1; i<=sizeX; i++) {\n\t if (matchX[i] == -1 && !vis[i] && dfs(i)) { \n\t\tres++; change = true; \n\t }\n\t}\n }\n return res;\n}\n\n\n\n----------KMP O(n + m)-------------\n#include<string>\n#include<cstdio>\n\n#define MAX_M 1001\n\nint prefixes[MAX_M];\nstd::string t, p;\n\n\/\/compute longest prefixes of P which are proper suffixes of P_q\nint prefix() {\n prefixes[1] = 0;\n int k = 0;\n for(int q = 2; q <= p.length(); q++) {\n while (k > 0 && p[k] != p[q-1]) k = prefixes[k];\n if (p[k] == p[q-1]) k++;\n prefixes[q] = k;\n }\n}\n\/\/print out shifts for which pattern occurs in target\nvoid kmp(){\n prefix();\n int q = 0;\n for (int i = 1; i <= t.length(); i++) {\n while(q > 0 && p[q] != t[i-1]) q = prefixes[q];\n if (p[q] == t[i-1]) q++;\n if (q == p.length()) {\n printf(\"valid shift: %d\\n\", i - (int) p.length()); q = prefixes[q];\n }\n }\n}\n\n\n\n----------Shortest distance between all pairs of points O(n log n)----------\n#include <algorithm>\n#include <cmath>\n#include <vector>\nusing namespace std;\n\n#define MAX_N 50000\n#define MIN(a,b) ((a)<(b)) ? a : b \n#define MAX(a,b) ((a)>(b)) ? a : b\n\nstruct point {\n int x, y, nr;\n};\n\nstruct ans {\n long long dist;\n int index1, index2;\n void operator=(const ans& val) {\n\tdist = val.dist;\n\tindex1 = val.index1;\n\tindex2 = val.index2;\n }\n bool operator<(const ans& val) const {\n\treturn dist < val.dist;\n }\n};\n\nbool compX(const point pA, const point pB) {\n return pA.x < pB.x;\n}\n\nbool compY(const point pA, const point pB) {\n return pA.y < pB.y;\n}\n\ninline long long dist(const point pA, const point pB) {\n long long aX = static_cast<long long>(pA.x);\n long long bX = static_cast<long long>(pB.x);\n long long aY = static_cast<long long>(pA.y);\n long long bY = static_cast<long long>(pB.y);\n return ((aX - bX) * (aX - bX) + (aY - bY) * (aY - bY));\n}\n\nans minDist(point *tab, int n) {\n if (n >= 2) {\n\tans res = {dist(tab[0], tab[1]), tab[0].nr, tab[1].nr};\n\tif (n == 3) {\n\t ans cand1 = {dist(tab[0], tab[2]), tab[0].nr, tab[2].nr};\n\t res = MIN(res, cand1);\n\t ans cand2 = {dist(tab[1], tab[2]), tab[1].nr, tab[2].nr};\n\t res = MIN(res, cand2);\n\t}\n\treturn res;\n }\n}\n\nans closestPair(point *tabX, point *tabY, int n) {\n if (n <= 3) {\n\treturn minDist(tabX, n);\n }\n int m = n\/2;\n ans ansL = closestPair(tabX, tabY, m);\n ans ansR = closestPair(tabX + m, tabY + m, n - m);\n ans res = MIN(ansL, ansR);\n long long distMin = res.dist;\n vector<point> temp;\n for (int i=0; i<n; i++) {\n\tif (abs(tabY[m].x - tabY[i].x) < distMin) {\n\t temp.push_back(tabY[i]);\n\t}\n }\n for (int i=0; i<temp.size(); i++) {\n\tfor (int k=i+1; k<temp.size() && dist(temp[i],temp[k])<distMin; k++) {\n\t ans candRes = { dist(temp[i],temp[k]), temp[i].nr, temp[k].nr};\n\t res = MIN(res, candRes);\n\t}\n }\n return res;\n}\n\nans calcRes(point *tabX, point *tabY, int n) {\n sort(tabX, tabX + n, compX);\n sort(tabY, tabY + n, compY);\n return closestPair(tabX, tabY, n);\n}\n\n<|endoftext|>"} {"text":"<commit_before><commit_msg>fdo#77806: Check the boundaries before accessing an array....<commit_after><|endoftext|>"} {"text":"<commit_before>\/*************************************************************************\n *\n * OpenOffice.org - a multi-platform office productivity suite\n *\n * $RCSfile: addonstoolboxfactory.cxx,v $\n *\n * $Revision: 1.8 $\n *\n * last change: $Author: ihi $ $Date: 2007-08-17 13:33: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_framework.hxx\"\n\n#ifndef __FRAMEWORK_UIFACTORY_ADDONSTOOLBOXFACTORY_HXX_\n#include <uifactory\/addonstoolboxfactory.hxx>\n#endif\n\n\/\/_________________________________________________________________________________________________________________\n\/\/ my own includes\n\/\/_________________________________________________________________________________________________________________\n\n#ifndef __FRAMEWORK_UIELEMENT_ADDONSTOOLBARWRAPPER_HXX_\n#include <uielement\/addonstoolbarwrapper.hxx>\n#endif\n\n#ifndef __FRAMEWORK_THREADHELP_RESETABLEGUARD_HXX_\n#include <threadhelp\/resetableguard.hxx>\n#endif\n\n\/\/_________________________________________________________________________________________________________________\n\/\/ interface includes\n\/\/_________________________________________________________________________________________________________________\n\n#ifndef _COM_SUN_STAR_UTIL_XURLTRANSFORMER_HPP_\n#include <com\/sun\/star\/util\/XURLTransformer.hpp>\n#endif\n\n#ifndef _COM_SUN_STAR_FRAME_XFRAME_HPP_\n#include <com\/sun\/star\/frame\/XFrame.hpp>\n#endif\n\n#ifndef _COM_SUN_STAR_FRAME_XMODEL_HPP_\n#include <com\/sun\/star\/frame\/XModel.hpp>\n#endif\n\n#ifndef _COM_SUN_STAR_LANG_XINITIALIZATION_HPP_\n#include <com\/sun\/star\/lang\/XInitialization.hpp>\n#endif\n\n#ifndef _COM_SUN_STAR_UI_XMODULEUICONFIGURATIONMANAGERSUPPLIER_HPP_\n#include <com\/sun\/star\/ui\/XModuleUIConfigurationManagerSupplier.hpp>\n#endif\n\n#ifndef _COM_SUN_STAR_UI_XUICONFIGURATIONMANAGERSUPLLIER_HPP_\n#include <com\/sun\/star\/ui\/XUIConfigurationManagerSupplier.hpp>\n#endif\n\n\/\/_________________________________________________________________________________________________________________\n\/\/ includes of other projects\n\/\/_________________________________________________________________________________________________________________\n\n#ifndef _SV_SVAPP_HXX\n#include <vcl\/svapp.hxx>\n#endif\n#ifndef _URLOBJ_HXX\n#include <tools\/urlobj.hxx>\n#endif\n#ifndef _RTL_USTRBUF_HXX_\n#include <rtl\/ustrbuf.hxx>\n#endif\n\n\/\/_________________________________________________________________________________________________________________\n\/\/ Defines\n\/\/_________________________________________________________________________________________________________________\n\/\/\n\nusing namespace rtl;\nusing namespace com::sun::star::uno;\nusing namespace com::sun::star::lang;\nusing namespace com::sun::star::frame;\nusing namespace com::sun::star::beans;\nusing namespace com::sun::star::util;\nusing namespace ::com::sun::star::ui;\n\nnamespace framework\n{\n\n\/\/*****************************************************************************************************************\n\/\/ XInterface, XTypeProvider, XServiceInfo\n\/\/*****************************************************************************************************************\nDEFINE_XINTERFACE_3 ( AddonsToolBoxFactory ,\n OWeakObject ,\n DIRECT_INTERFACE( css::lang::XTypeProvider ),\n DIRECT_INTERFACE( css::lang::XServiceInfo ),\n DIRECT_INTERFACE( ::com::sun::star::ui::XUIElementFactory )\n )\n\nDEFINE_XTYPEPROVIDER_3 ( AddonsToolBoxFactory ,\n css::lang::XTypeProvider ,\n css::lang::XServiceInfo ,\n ::com::sun::star::ui::XUIElementFactory\n )\n\nDEFINE_XSERVICEINFO_ONEINSTANCESERVICE ( AddonsToolBoxFactory ,\n ::cppu::OWeakObject ,\n SERVICENAME_TOOLBARFACTORY ,\n IMPLEMENTATIONNAME_ADDONSTOOLBARFACTORY\n )\n\nDEFINE_INIT_SERVICE ( AddonsToolBoxFactory, {} )\n\nAddonsToolBoxFactory::AddonsToolBoxFactory(\n const ::com::sun::star::uno::Reference< ::com::sun::star::lang::XMultiServiceFactory >& xServiceManager ) :\n ThreadHelpBase( &Application::GetSolarMutex() )\n , m_xServiceManager( xServiceManager )\n , m_xModuleManager( xServiceManager->createInstance(\n OUString( RTL_CONSTASCII_USTRINGPARAM( \"com.sun.star.frame.ModuleManager\" ))),\n UNO_QUERY )\n{\n}\n\nAddonsToolBoxFactory::~AddonsToolBoxFactory()\n{\n}\n\nstatic sal_Bool IsCorrectContext( const ::rtl::OUString& rModuleIdentifier, const rtl::OUString& aContextList )\n{\n if ( aContextList.getLength() == 0 )\n return sal_True;\n\n if ( rModuleIdentifier.getLength() > 0 )\n {\n sal_Int32 nIndex = aContextList.indexOf( rModuleIdentifier );\n return ( nIndex >= 0 );\n }\n\n return sal_False;\n}\n\nsal_Bool AddonsToolBoxFactory::hasButtonsInContext(\n const Sequence< Sequence< PropertyValue > >& rPropSeqSeq,\n const Reference< XFrame >& rFrame )\n{\n ::rtl::OUString aModuleIdentifier;\n try\n {\n aModuleIdentifier = m_xModuleManager->identify( rFrame );\n }\n catch ( RuntimeException& )\n {\n throw;\n }\n catch ( Exception& )\n {\n }\n\n \/\/ Check before we create a toolbar that we have at least one button in\n \/\/ the current frame context.\n for ( sal_uInt32 i = 0; i < (sal_uInt32)rPropSeqSeq.getLength(); i++ )\n {\n sal_Bool bIsButton( sal_True );\n sal_Bool bIsCorrectContext( sal_False );\n sal_uInt32 nPropChecked( 0 );\n\n const Sequence< PropertyValue >& rPropSeq = rPropSeqSeq[i];\n for ( sal_uInt32 j = 0; j < (sal_uInt32)rPropSeq.getLength(); j++ )\n {\n if ( rPropSeq[j].Name.equalsAsciiL( \"Context\", 7 ))\n {\n OUString aContextList;\n if ( rPropSeq[j].Value >>= aContextList )\n bIsCorrectContext = IsCorrectContext( aModuleIdentifier, aContextList );\n nPropChecked++;\n }\n else if ( rPropSeq[j].Name.equalsAsciiL( \"URL\", 3 ))\n {\n OUString aURL;\n rPropSeq[j].Value >>= aURL;\n bIsButton = !aURL.equalsAsciiL( \"private:separator\", 17 );\n nPropChecked++;\n }\n\n if ( nPropChecked == 2 )\n break;\n }\n\n if ( bIsButton && bIsCorrectContext )\n return sal_True;\n }\n\n return sal_False;\n}\n\n\/\/ XUIElementFactory\nReference< XUIElement > SAL_CALL AddonsToolBoxFactory::createUIElement(\n const ::rtl::OUString& ResourceURL,\n const Sequence< PropertyValue >& Args )\nthrow ( ::com::sun::star::container::NoSuchElementException,\n ::com::sun::star::lang::IllegalArgumentException,\n ::com::sun::star::uno::RuntimeException )\n{\n \/\/ SAFE\n ResetableGuard aLock( m_aLock );\n\n Sequence< Sequence< PropertyValue > > aConfigData;\n Reference< XFrame > xFrame;\n rtl::OUString aResourceURL( ResourceURL );\n\n for ( sal_Int32 n = 0; n < Args.getLength(); n++ )\n {\n if ( Args[n].Name.equalsAscii( \"ConfigurationData\" ))\n Args[n].Value >>= aConfigData;\n else if ( Args[n].Name.equalsAscii( \"Frame\" ))\n Args[n].Value >>= xFrame;\n else if ( Args[n].Name.equalsAscii( \"ResourceURL\" ))\n Args[n].Value >>= aResourceURL;\n }\n\n if ( aResourceURL.indexOf( rtl::OUString( RTL_CONSTASCII_USTRINGPARAM( \"private:resource\/toolbar\/addon_\" ))) != 0 )\n throw IllegalArgumentException();\n\n \/\/ Identify frame and determine module identifier to look for context based buttons\n Reference< ::com::sun::star::ui::XUIElement > xToolBar;\n if ( xFrame.is() &&\n ( aConfigData.getLength()> 0 ) &&\n hasButtonsInContext( aConfigData, xFrame ))\n {\n PropertyValue aPropValue;\n Sequence< Any > aPropSeq( 3 );\n aPropValue.Name = rtl::OUString( RTL_CONSTASCII_USTRINGPARAM( \"Frame\" ));\n aPropValue.Value <<= xFrame;\n aPropSeq[0] <<= aPropValue;\n aPropValue.Name = rtl::OUString( RTL_CONSTASCII_USTRINGPARAM( \"ConfigurationData\" ));\n aPropValue.Value <<= aConfigData;\n aPropSeq[1] <<= aPropValue;\n aPropValue.Name = rtl::OUString( RTL_CONSTASCII_USTRINGPARAM( \"ResourceURL\" ));\n aPropValue.Value <<= aResourceURL;\n aPropSeq[2] <<= aPropValue;\n\n vos::OGuard aGuard( Application::GetSolarMutex() );\n AddonsToolBarWrapper* pToolBarWrapper = new AddonsToolBarWrapper( m_xServiceManager );\n xToolBar = Reference< ::com::sun::star::ui::XUIElement >( (OWeakObject *)pToolBarWrapper, UNO_QUERY );\n Reference< XInitialization > xInit( xToolBar, UNO_QUERY );\n xInit->initialize( aPropSeq );\n }\n\n return xToolBar;\n}\n\n}\n<commit_msg>INTEGRATION: CWS changefileheader (1.8.96); FILE MERGED 2008\/04\/01 15:18:51 thb 1.8.96.3: #i85898# Stripping all external header guards 2008\/04\/01 10:58:17 thb 1.8.96.2: #i85898# Stripping all external header guards 2008\/03\/28 15:35:38 rt 1.8.96.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: addonstoolboxfactory.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_framework.hxx\"\n#include <uifactory\/addonstoolboxfactory.hxx>\n\n\/\/_________________________________________________________________________________________________________________\n\/\/ my own includes\n\/\/_________________________________________________________________________________________________________________\n#include <uielement\/addonstoolbarwrapper.hxx>\n#include <threadhelp\/resetableguard.hxx>\n\n\/\/_________________________________________________________________________________________________________________\n\/\/ interface includes\n\/\/_________________________________________________________________________________________________________________\n#include <com\/sun\/star\/util\/XURLTransformer.hpp>\n#include <com\/sun\/star\/frame\/XFrame.hpp>\n#include <com\/sun\/star\/frame\/XModel.hpp>\n#include <com\/sun\/star\/lang\/XInitialization.hpp>\n#include <com\/sun\/star\/ui\/XModuleUIConfigurationManagerSupplier.hpp>\n\n#ifndef _COM_SUN_STAR_UI_XUICONFIGURATIONMANAGERSUPLLIER_HPP_\n#include <com\/sun\/star\/ui\/XUIConfigurationManagerSupplier.hpp>\n#endif\n\n\/\/_________________________________________________________________________________________________________________\n\/\/ includes of other projects\n\/\/_________________________________________________________________________________________________________________\n#include <vcl\/svapp.hxx>\n#include <tools\/urlobj.hxx>\n#include <rtl\/ustrbuf.hxx>\n\n\/\/_________________________________________________________________________________________________________________\n\/\/ Defines\n\/\/_________________________________________________________________________________________________________________\n\/\/\n\nusing namespace rtl;\nusing namespace com::sun::star::uno;\nusing namespace com::sun::star::lang;\nusing namespace com::sun::star::frame;\nusing namespace com::sun::star::beans;\nusing namespace com::sun::star::util;\nusing namespace ::com::sun::star::ui;\n\nnamespace framework\n{\n\n\/\/*****************************************************************************************************************\n\/\/ XInterface, XTypeProvider, XServiceInfo\n\/\/*****************************************************************************************************************\nDEFINE_XINTERFACE_3 ( AddonsToolBoxFactory ,\n OWeakObject ,\n DIRECT_INTERFACE( css::lang::XTypeProvider ),\n DIRECT_INTERFACE( css::lang::XServiceInfo ),\n DIRECT_INTERFACE( ::com::sun::star::ui::XUIElementFactory )\n )\n\nDEFINE_XTYPEPROVIDER_3 ( AddonsToolBoxFactory ,\n css::lang::XTypeProvider ,\n css::lang::XServiceInfo ,\n ::com::sun::star::ui::XUIElementFactory\n )\n\nDEFINE_XSERVICEINFO_ONEINSTANCESERVICE ( AddonsToolBoxFactory ,\n ::cppu::OWeakObject ,\n SERVICENAME_TOOLBARFACTORY ,\n IMPLEMENTATIONNAME_ADDONSTOOLBARFACTORY\n )\n\nDEFINE_INIT_SERVICE ( AddonsToolBoxFactory, {} )\n\nAddonsToolBoxFactory::AddonsToolBoxFactory(\n const ::com::sun::star::uno::Reference< ::com::sun::star::lang::XMultiServiceFactory >& xServiceManager ) :\n ThreadHelpBase( &Application::GetSolarMutex() )\n , m_xServiceManager( xServiceManager )\n , m_xModuleManager( xServiceManager->createInstance(\n OUString( RTL_CONSTASCII_USTRINGPARAM( \"com.sun.star.frame.ModuleManager\" ))),\n UNO_QUERY )\n{\n}\n\nAddonsToolBoxFactory::~AddonsToolBoxFactory()\n{\n}\n\nstatic sal_Bool IsCorrectContext( const ::rtl::OUString& rModuleIdentifier, const rtl::OUString& aContextList )\n{\n if ( aContextList.getLength() == 0 )\n return sal_True;\n\n if ( rModuleIdentifier.getLength() > 0 )\n {\n sal_Int32 nIndex = aContextList.indexOf( rModuleIdentifier );\n return ( nIndex >= 0 );\n }\n\n return sal_False;\n}\n\nsal_Bool AddonsToolBoxFactory::hasButtonsInContext(\n const Sequence< Sequence< PropertyValue > >& rPropSeqSeq,\n const Reference< XFrame >& rFrame )\n{\n ::rtl::OUString aModuleIdentifier;\n try\n {\n aModuleIdentifier = m_xModuleManager->identify( rFrame );\n }\n catch ( RuntimeException& )\n {\n throw;\n }\n catch ( Exception& )\n {\n }\n\n \/\/ Check before we create a toolbar that we have at least one button in\n \/\/ the current frame context.\n for ( sal_uInt32 i = 0; i < (sal_uInt32)rPropSeqSeq.getLength(); i++ )\n {\n sal_Bool bIsButton( sal_True );\n sal_Bool bIsCorrectContext( sal_False );\n sal_uInt32 nPropChecked( 0 );\n\n const Sequence< PropertyValue >& rPropSeq = rPropSeqSeq[i];\n for ( sal_uInt32 j = 0; j < (sal_uInt32)rPropSeq.getLength(); j++ )\n {\n if ( rPropSeq[j].Name.equalsAsciiL( \"Context\", 7 ))\n {\n OUString aContextList;\n if ( rPropSeq[j].Value >>= aContextList )\n bIsCorrectContext = IsCorrectContext( aModuleIdentifier, aContextList );\n nPropChecked++;\n }\n else if ( rPropSeq[j].Name.equalsAsciiL( \"URL\", 3 ))\n {\n OUString aURL;\n rPropSeq[j].Value >>= aURL;\n bIsButton = !aURL.equalsAsciiL( \"private:separator\", 17 );\n nPropChecked++;\n }\n\n if ( nPropChecked == 2 )\n break;\n }\n\n if ( bIsButton && bIsCorrectContext )\n return sal_True;\n }\n\n return sal_False;\n}\n\n\/\/ XUIElementFactory\nReference< XUIElement > SAL_CALL AddonsToolBoxFactory::createUIElement(\n const ::rtl::OUString& ResourceURL,\n const Sequence< PropertyValue >& Args )\nthrow ( ::com::sun::star::container::NoSuchElementException,\n ::com::sun::star::lang::IllegalArgumentException,\n ::com::sun::star::uno::RuntimeException )\n{\n \/\/ SAFE\n ResetableGuard aLock( m_aLock );\n\n Sequence< Sequence< PropertyValue > > aConfigData;\n Reference< XFrame > xFrame;\n rtl::OUString aResourceURL( ResourceURL );\n\n for ( sal_Int32 n = 0; n < Args.getLength(); n++ )\n {\n if ( Args[n].Name.equalsAscii( \"ConfigurationData\" ))\n Args[n].Value >>= aConfigData;\n else if ( Args[n].Name.equalsAscii( \"Frame\" ))\n Args[n].Value >>= xFrame;\n else if ( Args[n].Name.equalsAscii( \"ResourceURL\" ))\n Args[n].Value >>= aResourceURL;\n }\n\n if ( aResourceURL.indexOf( rtl::OUString( RTL_CONSTASCII_USTRINGPARAM( \"private:resource\/toolbar\/addon_\" ))) != 0 )\n throw IllegalArgumentException();\n\n \/\/ Identify frame and determine module identifier to look for context based buttons\n Reference< ::com::sun::star::ui::XUIElement > xToolBar;\n if ( xFrame.is() &&\n ( aConfigData.getLength()> 0 ) &&\n hasButtonsInContext( aConfigData, xFrame ))\n {\n PropertyValue aPropValue;\n Sequence< Any > aPropSeq( 3 );\n aPropValue.Name = rtl::OUString( RTL_CONSTASCII_USTRINGPARAM( \"Frame\" ));\n aPropValue.Value <<= xFrame;\n aPropSeq[0] <<= aPropValue;\n aPropValue.Name = rtl::OUString( RTL_CONSTASCII_USTRINGPARAM( \"ConfigurationData\" ));\n aPropValue.Value <<= aConfigData;\n aPropSeq[1] <<= aPropValue;\n aPropValue.Name = rtl::OUString( RTL_CONSTASCII_USTRINGPARAM( \"ResourceURL\" ));\n aPropValue.Value <<= aResourceURL;\n aPropSeq[2] <<= aPropValue;\n\n vos::OGuard aGuard( Application::GetSolarMutex() );\n AddonsToolBarWrapper* pToolBarWrapper = new AddonsToolBarWrapper( m_xServiceManager );\n xToolBar = Reference< ::com::sun::star::ui::XUIElement >( (OWeakObject *)pToolBarWrapper, UNO_QUERY );\n Reference< XInitialization > xInit( xToolBar, UNO_QUERY );\n xInit->initialize( aPropSeq );\n }\n\n return xToolBar;\n}\n\n}\n<|endoftext|>"} {"text":"<commit_before>\/*\nHighly Optimized Object-Oriented Molecular Dynamics (HOOMD) Open\nSource Software License\nCopyright (c) 2008 Ames Laboratory Iowa State University\nAll rights reserved.\n\nRedistribution and use of HOOMD, in source and binary forms, with or\nwithout modification, are permitted, provided that the following\nconditions are met:\n\n* Redistributions of source code must retain the above copyright notice,\nthis list of conditions and the following disclaimer.\n\n* Redistributions in binary form must reproduce the above copyright\nnotice, this list of conditions and the following disclaimer in the\ndocumentation and\/or other materials provided with the distribution.\n\n* Neither the name of the copyright holder nor the names HOOMD's\ncontributors may be used to endorse or promote products derived from this\nsoftware without specific prior written permission.\n\nDisclaimer\n\nTHIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDER AND\nCONTRIBUTORS ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES,\nINCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY\nAND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. \n\nIN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE\nFOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR\nCONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF\nSUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS\nINTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN\nCONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)\nARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF\nTHE POSSIBILITY OF SUCH DAMAGE.\n*\/\n\n\n\/\/ conditionally compile in only if boost is 1.35 or later\n#include <boost\/version.hpp>\n#if (BOOST_VERSION >= 103500)\n\n#include <iostream>\n\n\/\/! Name the unit test module\n#define BOOST_TEST_MODULE ElectrostaticShortRangeTests\n#include \"boost_utf_configure.h\"\n\n#include <boost\/test\/floating_point_comparison.hpp>\n#include <boost\/bind.hpp>\n#include <boost\/function.hpp>\n#include <boost\/shared_ptr.hpp>\n#include <boost\/math\/special_functions\/erf.hpp>\n\n#include \"ElectrostaticShortRange.h\"\n\n#include \"BinnedNeighborList.h\"\n#include \"Initializers.h\"\n\n#include <math.h>\n\n#define EWALD_F 1.128379167\nusing namespace std;\nusing namespace boost;\n\n\/*! \\file ElectrostaticShortRange_force_test.cc\n\t\\brief Implements unit tests for ElectrostaticShortRange and descendants\n\t\\ingroup unit_tests\n*\/\n\n\/\/! Helper macro for testing if two numbers are close\n#define MY_BOOST_CHECK_CLOSE(a,b,c) BOOST_CHECK_CLOSE(a,Scalar(b),Scalar(c))\n\/\/! Helper macro for testing if a number is small\n#define MY_BOOST_CHECK_SMALL(a,c) BOOST_CHECK_SMALL(a,Scalar(c))\n\n\/\/! Tolerance in percent to use for comparing various ElectrostaticShortRange to each other\n\nconst Scalar tol = Scalar(1);\n\n\n\/\/! Typedef'd ElectrostaticShortRange factory\ntypedef boost::function<shared_ptr<ElectrostaticShortRange> (shared_ptr<ParticleData> pdata, shared_ptr<NeighborList> nlist, Scalar r_cut, Scalar alpha, Scalar delta, Scalar min_value)> ElectrostaticShortRange_force_creator;\n\t\n\/\/! Test the ability of the Short Range Electrostatic force compute to actually calculate forces\n\/*! \n\t\\note With the creator as a parameter, the same code can be used to test any derived child\n\t\tof ElectrostaticShortRange\n*\/\nvoid ElectrostaticShortRange_force_accuracy_test(ElectrostaticShortRange_force_creator Elstatics_ShortRange_creator)\n\t{\n\tcout << \"Testing the accuracy of the look up table in ElectrostaticShortRange\" << endl;\n\t\/\/ Simple test to check the accuracy of the look up table\n\tshared_ptr<ParticleData> pdata_2(new ParticleData(2, BoxDim(1000.0), 1));\n\tParticleDataArrays arrays = pdata_2->acquireReadWrite();\n\tarrays.x[0] = arrays.y[0] = arrays.z[0] = 0.0; arrays.charge[0]=1.0;\n\t\/\/ A positively charged particle is located at the origin\n\tarrays.x[1] = 1.0; arrays.y[1] = arrays.z[1] = 0.0; arrays.charge[1]=1.0;\n\t\/\/ Another positive charge is located at distance 1 in the x axis\n\tpdata_2->release();\n\tshared_ptr<NeighborList> nlist_2(new NeighborList(pdata_2, Scalar(3.0), Scalar(5.0)));\n\t\/\/ The cut-off is set to 3 while the buffer size is 5\n\tScalar r_cut=Scalar(3.0);\n\t\n\tScalar delta=Scalar(0.1);\n\tScalar min_value=Scalar(0.41);\n\n\tfor(int k1=0;k1<4;k1++){\n\n\tScalar alpha=Scalar(0.3+k1);\n \/\/Test different values of alpha as well\n\tshared_ptr<ElectrostaticShortRange> fc_2=Elstatics_ShortRange_creator(pdata_2,nlist_2,r_cut,alpha,delta,min_value);\n\t\/\/ An ElectrostaticShortRange object with specified value of cut_off, alpha, delta and min_value is instantiated\n\t\/\/ now let us check how much the force differs from the exact calculation for N_p**3 points within the cut_off;\n\t\n\tint N_p=7;\n\tScalar delta_test= (r_cut-min_value)\/(sqrt(r_cut)*N_p);\n\tint j_count=0;\n\n\tfor(int jx=0;jx<N_p;jx++){\n\t\tfor(int jy=0;jy<N_p;jy++){\n\t\t\tfor(int jz=0;jz<N_p;jz++){\n\t\t\t\t\n\tarrays.x[1]=min_value+Scalar((static_cast<double>(jx))*delta_test);\n\tarrays.y[1]=min_value+Scalar((static_cast<double>(jy))*delta_test);\n arrays.z[1]=min_value+Scalar((static_cast<double>(jz))*delta_test);\n\n\tScalar dx = arrays.x[1]-arrays.x[0];\n\tScalar dy = arrays.y[1]-arrays.y[0];\n\tScalar dz = arrays.z[1]-arrays.z[0];\n\t\n\tScalar rsq = sqrt(dx*dx + dy*dy + dz*dz);\n\tScalar al_rsq=alpha*rsq;\n\n\tScalar erfc_al=boost::math::erfc(al_rsq);\n \n\tScalar fExactx=-dx*(Scalar(EWALD_F)*alpha*exp(-al_rsq*al_rsq)+erfc_al\/rsq)\/pow(rsq,2);\n Scalar fExacty=-dy*(Scalar(EWALD_F)*alpha*exp(-al_rsq*al_rsq)+erfc_al\/rsq)\/pow(rsq,2);\n\tScalar fExactz=-dz*(Scalar(EWALD_F)*alpha*exp(-al_rsq*al_rsq)+erfc_al\/rsq)\/pow(rsq,2);\n\tScalar fExactE=Scalar(0.5)*erfc_al\/rsq;\n\t\n\tfc_2->compute(j_count);\n\tj_count++;\n\n\tForceDataArrays force_arrays=fc_2->acquire();\n\n\tMY_BOOST_CHECK_CLOSE(force_arrays.fx[0],fExactx,tol);\n MY_BOOST_CHECK_CLOSE(force_arrays.fy[0],fExacty,tol);\n MY_BOOST_CHECK_CLOSE(force_arrays.fz[0],fExactz,tol);\n\tMY_BOOST_CHECK_CLOSE(force_arrays.pe[0],fExactE,tol);\n\t\n\tMY_BOOST_CHECK_CLOSE(force_arrays.fx[1],-fExactx,tol);\n MY_BOOST_CHECK_CLOSE(force_arrays.fy[1],-fExacty,tol);\n MY_BOOST_CHECK_CLOSE(force_arrays.fz[1],-fExactz,tol);\n\tMY_BOOST_CHECK_CLOSE(force_arrays.pe[1],fExactE,tol);\n\t\t\t}\n\t\t}\n\t}\n\t}\n\t}\n\n\n\/\/! ElectrostaticShortRange creator for unit tests\nshared_ptr<ElectrostaticShortRange> base_class_ShortRangeElectrostatic_creator(shared_ptr<ParticleData> pdata, shared_ptr<NeighborList> nlist, Scalar r_cut, Scalar alpha, Scalar delta, Scalar min_value)\n\t{\n\treturn shared_ptr<ElectrostaticShortRange>(new ElectrostaticShortRange(pdata, nlist, r_cut, alpha, delta,min_value));\n\t}\n\t\n\/\/! boost test case for particle test on CPU\nBOOST_AUTO_TEST_CASE(ElectrostaticShortRange_force_accuracy)\n\t{\n\tElectrostaticShortRange_force_creator ElectrostaticShortRange_creator_base = bind(base_class_ShortRangeElectrostatic_creator, _1, _2, _3, _4, _5,_6);\n\tElectrostaticShortRange_force_accuracy_test(ElectrostaticShortRange_creator_base);\n}\n\n\n#undef EWALD_F\n#else\n\/\/ We can't have the unit test passing if the code wasn't even compiled!\nBOOST_AUTO_TEST_CASE(dummy_test)\n\t{\n\tBOOST_FAIL(\"ElectrostaticShortRange not compiled\");\n\t}\n\n#endif\n\n<commit_msg>Unit test now compiles and fails when boost < 1.35 is installed. ticket #79<commit_after>\/*\nHighly Optimized Object-Oriented Molecular Dynamics (HOOMD) Open\nSource Software License\nCopyright (c) 2008 Ames Laboratory Iowa State University\nAll rights reserved.\n\nRedistribution and use of HOOMD, in source and binary forms, with or\nwithout modification, are permitted, provided that the following\nconditions are met:\n\n* Redistributions of source code must retain the above copyright notice,\nthis list of conditions and the following disclaimer.\n\n* Redistributions in binary form must reproduce the above copyright\nnotice, this list of conditions and the following disclaimer in the\ndocumentation and\/or other materials provided with the distribution.\n\n* Neither the name of the copyright holder nor the names HOOMD's\ncontributors may be used to endorse or promote products derived from this\nsoftware without specific prior written permission.\n\nDisclaimer\n\nTHIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDER AND\nCONTRIBUTORS ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES,\nINCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY\nAND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. \n\nIN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE\nFOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR\nCONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF\nSUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS\nINTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN\nCONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)\nARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF\nTHE POSSIBILITY OF SUCH DAMAGE.\n*\/\n\n#include <iostream>\n\n\/\/! Name the unit test module\n#define BOOST_TEST_MODULE ElectrostaticShortRangeTests\n#include \"boost_utf_configure.h\"\n\n\n\/\/ conditionally compile in only if boost is 1.35 or later\n#include <boost\/version.hpp>\n#if (BOOST_VERSION >= 103500)\n\n#include <boost\/test\/floating_point_comparison.hpp>\n#include <boost\/bind.hpp>\n#include <boost\/function.hpp>\n#include <boost\/shared_ptr.hpp>\n#include <boost\/math\/special_functions\/erf.hpp>\n\n#include \"ElectrostaticShortRange.h\"\n\n#include \"BinnedNeighborList.h\"\n#include \"Initializers.h\"\n\n#include <math.h>\n\n#define EWALD_F 1.128379167\nusing namespace std;\nusing namespace boost;\n\n\/*! \\file ElectrostaticShortRange_force_test.cc\n\t\\brief Implements unit tests for ElectrostaticShortRange and descendants\n\t\\ingroup unit_tests\n*\/\n\n\/\/! Helper macro for testing if two numbers are close\n#define MY_BOOST_CHECK_CLOSE(a,b,c) BOOST_CHECK_CLOSE(a,Scalar(b),Scalar(c))\n\/\/! Helper macro for testing if a number is small\n#define MY_BOOST_CHECK_SMALL(a,c) BOOST_CHECK_SMALL(a,Scalar(c))\n\n\/\/! Tolerance in percent to use for comparing various ElectrostaticShortRange to each other\n\nconst Scalar tol = Scalar(1);\n\n\n\/\/! Typedef'd ElectrostaticShortRange factory\ntypedef boost::function<shared_ptr<ElectrostaticShortRange> (shared_ptr<ParticleData> pdata, shared_ptr<NeighborList> nlist, Scalar r_cut, Scalar alpha, Scalar delta, Scalar min_value)> ElectrostaticShortRange_force_creator;\n\t\n\/\/! Test the ability of the Short Range Electrostatic force compute to actually calculate forces\n\/*! \n\t\\note With the creator as a parameter, the same code can be used to test any derived child\n\t\tof ElectrostaticShortRange\n*\/\nvoid ElectrostaticShortRange_force_accuracy_test(ElectrostaticShortRange_force_creator Elstatics_ShortRange_creator)\n\t{\n\tcout << \"Testing the accuracy of the look up table in ElectrostaticShortRange\" << endl;\n\t\/\/ Simple test to check the accuracy of the look up table\n\tshared_ptr<ParticleData> pdata_2(new ParticleData(2, BoxDim(1000.0), 1));\n\tParticleDataArrays arrays = pdata_2->acquireReadWrite();\n\tarrays.x[0] = arrays.y[0] = arrays.z[0] = 0.0; arrays.charge[0]=1.0;\n\t\/\/ A positively charged particle is located at the origin\n\tarrays.x[1] = 1.0; arrays.y[1] = arrays.z[1] = 0.0; arrays.charge[1]=1.0;\n\t\/\/ Another positive charge is located at distance 1 in the x axis\n\tpdata_2->release();\n\tshared_ptr<NeighborList> nlist_2(new NeighborList(pdata_2, Scalar(3.0), Scalar(5.0)));\n\t\/\/ The cut-off is set to 3 while the buffer size is 5\n\tScalar r_cut=Scalar(3.0);\n\t\n\tScalar delta=Scalar(0.1);\n\tScalar min_value=Scalar(0.41);\n\n\tfor(int k1=0;k1<4;k1++){\n\n\tScalar alpha=Scalar(0.3+k1);\n \/\/Test different values of alpha as well\n\tshared_ptr<ElectrostaticShortRange> fc_2=Elstatics_ShortRange_creator(pdata_2,nlist_2,r_cut,alpha,delta,min_value);\n\t\/\/ An ElectrostaticShortRange object with specified value of cut_off, alpha, delta and min_value is instantiated\n\t\/\/ now let us check how much the force differs from the exact calculation for N_p**3 points within the cut_off;\n\t\n\tint N_p=7;\n\tScalar delta_test= (r_cut-min_value)\/(sqrt(r_cut)*N_p);\n\tint j_count=0;\n\n\tfor(int jx=0;jx<N_p;jx++){\n\t\tfor(int jy=0;jy<N_p;jy++){\n\t\t\tfor(int jz=0;jz<N_p;jz++){\n\t\t\t\t\n\tarrays.x[1]=min_value+Scalar((static_cast<double>(jx))*delta_test);\n\tarrays.y[1]=min_value+Scalar((static_cast<double>(jy))*delta_test);\n arrays.z[1]=min_value+Scalar((static_cast<double>(jz))*delta_test);\n\n\tScalar dx = arrays.x[1]-arrays.x[0];\n\tScalar dy = arrays.y[1]-arrays.y[0];\n\tScalar dz = arrays.z[1]-arrays.z[0];\n\t\n\tScalar rsq = sqrt(dx*dx + dy*dy + dz*dz);\n\tScalar al_rsq=alpha*rsq;\n\n\tScalar erfc_al=boost::math::erfc(al_rsq);\n \n\tScalar fExactx=-dx*(Scalar(EWALD_F)*alpha*exp(-al_rsq*al_rsq)+erfc_al\/rsq)\/pow(rsq,2);\n Scalar fExacty=-dy*(Scalar(EWALD_F)*alpha*exp(-al_rsq*al_rsq)+erfc_al\/rsq)\/pow(rsq,2);\n\tScalar fExactz=-dz*(Scalar(EWALD_F)*alpha*exp(-al_rsq*al_rsq)+erfc_al\/rsq)\/pow(rsq,2);\n\tScalar fExactE=Scalar(0.5)*erfc_al\/rsq;\n\t\n\tfc_2->compute(j_count);\n\tj_count++;\n\n\tForceDataArrays force_arrays=fc_2->acquire();\n\n\tMY_BOOST_CHECK_CLOSE(force_arrays.fx[0],fExactx,tol);\n MY_BOOST_CHECK_CLOSE(force_arrays.fy[0],fExacty,tol);\n MY_BOOST_CHECK_CLOSE(force_arrays.fz[0],fExactz,tol);\n\tMY_BOOST_CHECK_CLOSE(force_arrays.pe[0],fExactE,tol);\n\t\n\tMY_BOOST_CHECK_CLOSE(force_arrays.fx[1],-fExactx,tol);\n MY_BOOST_CHECK_CLOSE(force_arrays.fy[1],-fExacty,tol);\n MY_BOOST_CHECK_CLOSE(force_arrays.fz[1],-fExactz,tol);\n\tMY_BOOST_CHECK_CLOSE(force_arrays.pe[1],fExactE,tol);\n\t\t\t}\n\t\t}\n\t}\n\t}\n\t}\n\n\n\/\/! ElectrostaticShortRange creator for unit tests\nshared_ptr<ElectrostaticShortRange> base_class_ShortRangeElectrostatic_creator(shared_ptr<ParticleData> pdata, shared_ptr<NeighborList> nlist, Scalar r_cut, Scalar alpha, Scalar delta, Scalar min_value)\n\t{\n\treturn shared_ptr<ElectrostaticShortRange>(new ElectrostaticShortRange(pdata, nlist, r_cut, alpha, delta,min_value));\n\t}\n\t\n\/\/! boost test case for particle test on CPU\nBOOST_AUTO_TEST_CASE(ElectrostaticShortRange_force_accuracy)\n\t{\n\tElectrostaticShortRange_force_creator ElectrostaticShortRange_creator_base = bind(base_class_ShortRangeElectrostatic_creator, _1, _2, _3, _4, _5,_6);\n\tElectrostaticShortRange_force_accuracy_test(ElectrostaticShortRange_creator_base);\n}\n\n\n#undef EWALD_F\n#else\n\/\/ We can't have the unit test passing if the code wasn't even compiled!\nBOOST_AUTO_TEST_CASE(dummy_test)\n\t{\n\tBOOST_FAIL(\"ElectrostaticShortRange not compiled\");\n\t}\n\n#endif\n\n<|endoftext|>"} {"text":"<commit_before>\/\/ For conditions of distribution and use, see copyright notice in license.txt\r\n\/\/ Based on Mesmerizer.cs in libopenmetaverse\r\n\r\n\/*\r\n * Copyright (c) 2008, openmetaverse.org\r\n * All rights reserved.\r\n *\r\n * - Redistribution and use in source and binary forms, with or without \r\n * modification, are permitted provided that the following conditions are met:\r\n *\r\n * - Redistributions of source code must retain the above copyright notice, this\r\n * list of conditions and the following disclaimer.\r\n * - Neither the name of the openmetaverse.org nor the names \r\n * of its contributors may be used to endorse or promote products derived from\r\n * this software without specific prior written permission.\r\n *\r\n * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS \"AS IS\" \r\n * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE \r\n * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE \r\n * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE \r\n * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR \r\n * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF \r\n * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS \r\n * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN \r\n * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) \r\n * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE \r\n * POSSIBILITY OF SUCH DAMAGE.\r\n * \r\n * \r\n * This code comes from the OpenSim project. Meshmerizer is written by dahlia\r\n * <dahliatrimble@gmail.com>\r\n *\/\r\n\r\n#include \"StableHeaders.h\"\r\n#include \"PrimMesher.h\"\r\n#include \"RexTypes.h\"\r\n#include \"RexLogicModule.h\"\r\n#include \"EC_OpenSimPrim.h\"\r\n#include \"..\/OgreRenderingModule\/OgreMaterialUtils.h\"\r\n\r\n#include <Ogre.h>\r\n\r\nnamespace RexLogic\r\n{\r\n void CreatePrimGeometry(Ogre::ManualObject* object, EC_OpenSimPrim& primitive)\r\n {\r\n try\r\n {\r\n float profileBegin = primitive.ProfileBegin;\r\n float profileEnd = 1.0f - primitive.ProfileEnd;\r\n float profileHollow = primitive.ProfileHollow;\r\n\r\n int sides = 4;\r\n if ((primitive.ProfileCurve & 0x07) == RexTypes::SHAPE_EQUILATERAL_TRIANGLE)\r\n sides = 3;\r\n else if ((primitive.ProfileCurve & 0x07) == RexTypes::SHAPE_CIRCLE)\r\n sides = 24;\r\n else if ((primitive.ProfileCurve & 0x07) == RexTypes::SHAPE_HALF_CIRCLE)\r\n {\r\n \/\/ half circle, prim is a sphere\r\n sides = 24;\r\n\r\n profileBegin = 0.5f * profileBegin + 0.5f;\r\n profileEnd = 0.5f * profileEnd + 0.5f;\r\n }\r\n\r\n int hollowSides = sides;\r\n if ((primitive.ProfileCurve & 0xf0) == RexTypes::HOLLOW_CIRCLE)\r\n hollowSides = 24;\r\n else if ((primitive.ProfileCurve & 0xf0) == RexTypes::HOLLOW_SQUARE)\r\n hollowSides = 4;\r\n else if ((primitive.ProfileCurve & 0xf0) == RexTypes::HOLLOW_TRIANGLE)\r\n hollowSides = 3;\r\n\r\n PrimMesher::PrimMesh primMesh(sides, profileBegin, profileEnd, profileHollow, hollowSides);\r\n primMesh.topShearX = primitive.PathShearX;\r\n primMesh.topShearY = primitive.PathShearY;\r\n primMesh.pathCutBegin = primitive.PathBegin;\r\n primMesh.pathCutEnd = 1.0f - primitive.PathEnd;\r\n\r\n if (primitive.PathCurve == RexTypes::EXTRUSION_STRAIGHT)\r\n {\r\n primMesh.twistBegin = primitive.PathTwistBegin * 180;\r\n primMesh.twistEnd = primitive.PathTwist * 180;\r\n primMesh.taperX = primitive.PathScaleX - 1.0f;\r\n primMesh.taperY = primitive.PathScaleY - 1.0f;\r\n primMesh.ExtrudeLinear();\r\n }\r\n else\r\n {\r\n primMesh.holeSizeX = (2.0f - primitive.PathScaleX);\r\n primMesh.holeSizeY = (2.0f - primitive.PathScaleY);\r\n primMesh.radius = primitive.PathRadiusOffset;\r\n primMesh.revolutions = primitive.PathRevolutions;\r\n primMesh.skew = primitive.PathSkew;\r\n primMesh.twistBegin = primitive.PathTwistBegin * 360;\r\n primMesh.twistEnd = primitive.PathTwist * 360;\r\n primMesh.taperX = primitive.PathTaperX;\r\n primMesh.taperY = primitive.PathTaperY;\r\n primMesh.ExtrudeCircular();\r\n }\r\n \r\n if (object)\r\n {\r\n object->clear();\r\n \r\n RexTypes::RexUUID tex_id;\r\n RexTypes::RexUUID prev_tex_id;\r\n \r\n Core::uint indices = 0;\r\n \r\n for (Core::uint i = 0; i < primMesh.viewerFaces.size(); ++i)\r\n {\r\n \/\/ Here we assume (again) that material name = texture UUID in text form\r\n \/\/! \\todo handle material override if prim is using material script\r\n\r\n \/\/ Try to find face's texture in texturemap, use default if not found\r\n tex_id = primitive.PrimDefaultTexture;\r\n TextureMap::const_iterator t = primitive.PrimTextures.find(primMesh.viewerFaces[i].primFaceNumber);\r\n if (t != primitive.PrimTextures.end())\r\n tex_id = t->second;\r\n \r\n if ((i == 0) || (tex_id != prev_tex_id))\r\n {\r\n \/\/ Fill the indices of previous subsection before beginning new\r\n if (indices)\r\n {\r\n for (Core::uint j = 0; j < indices; j += 3)\r\n {\r\n object->index(j);\r\n object->index(j+1);\r\n object->index(j+2);\r\n }\r\n indices = 0;\r\n object->end();\r\n }\r\n \r\n std::string mat_name = tex_id.ToString();\r\n \/\/ Actually create the material here if texture yet missing, we'll fill later\r\n OgreRenderer::GetOrCreateUnlitTexturedMaterial(mat_name.c_str());\r\n \r\n object->begin(mat_name);\r\n }\r\n prev_tex_id = tex_id;\r\n \r\n Ogre::Vector3 pos1(primMesh.viewerFaces[i].v1.X, primMesh.viewerFaces[i].v1.Y, primMesh.viewerFaces[i].v1.Z);\r\n Ogre::Vector3 pos2(primMesh.viewerFaces[i].v2.X, primMesh.viewerFaces[i].v2.Y, primMesh.viewerFaces[i].v2.Z);\r\n Ogre::Vector3 pos3(primMesh.viewerFaces[i].v3.X, primMesh.viewerFaces[i].v3.Y, primMesh.viewerFaces[i].v3.Z);\r\n\r\n Ogre::Vector3 n1(primMesh.viewerFaces[i].n1.X, primMesh.viewerFaces[i].n1.Y, primMesh.viewerFaces[i].n1.Z);\r\n Ogre::Vector3 n2(primMesh.viewerFaces[i].n2.X, primMesh.viewerFaces[i].n2.Y, primMesh.viewerFaces[i].n2.Z);\r\n Ogre::Vector3 n3(primMesh.viewerFaces[i].n3.X, primMesh.viewerFaces[i].n3.Y, primMesh.viewerFaces[i].n3.Z);\r\n \r\n Ogre::Vector2 uv1(primMesh.viewerFaces[i].uv1.U, primMesh.viewerFaces[i].uv1.V);\r\n Ogre::Vector2 uv2(primMesh.viewerFaces[i].uv2.U, primMesh.viewerFaces[i].uv2.V);\r\n Ogre::Vector2 uv3(primMesh.viewerFaces[i].uv3.U, primMesh.viewerFaces[i].uv3.V);\r\n\r\n object->position(pos1);\r\n object->normal(n1);\r\n object->textureCoord(uv1);\r\n \r\n object->position(pos2);\r\n object->normal(n2);\r\n object->textureCoord(uv2);\r\n \r\n object->position(pos3);\r\n object->normal(n3);\r\n object->textureCoord(uv3);\r\n indices += 3;\r\n }\r\n \r\n \/\/ Fill the indices of last subsection\r\n if (indices)\r\n {\r\n for (Core::uint j = 0; j < indices; j += 3)\r\n {\r\n object->index(j);\r\n object->index(j+1);\r\n object->index(j+2);\r\n }\r\n indices = 0;\r\n object->end();\r\n }\r\n }\r\n else\r\n {\r\n RexLogicModule::LogError(std::string(\"Null manualobject passed to CreatePrimGeometry\"));\r\n }\r\n }\r\n catch (Core::Exception& e)\r\n {\r\n RexLogicModule::LogError(std::string(\"Exception while creating primitive geometry: \") + e.what());\r\n }\r\n }\r\n}<commit_msg>Added todo item about probable cause of random crashes.<commit_after>\/\/ For conditions of distribution and use, see copyright notice in license.txt\r\n\/\/ Based on Mesmerizer.cs in libopenmetaverse\r\n\r\n\/*\r\n * Copyright (c) 2008, openmetaverse.org\r\n * All rights reserved.\r\n *\r\n * - Redistribution and use in source and binary forms, with or without \r\n * modification, are permitted provided that the following conditions are met:\r\n *\r\n * - Redistributions of source code must retain the above copyright notice, this\r\n * list of conditions and the following disclaimer.\r\n * - Neither the name of the openmetaverse.org nor the names \r\n * of its contributors may be used to endorse or promote products derived from\r\n * this software without specific prior written permission.\r\n *\r\n * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS \"AS IS\" \r\n * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE \r\n * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE \r\n * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE \r\n * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR \r\n * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF \r\n * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS \r\n * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN \r\n * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) \r\n * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE \r\n * POSSIBILITY OF SUCH DAMAGE.\r\n * \r\n * \r\n * This code comes from the OpenSim project. Meshmerizer is written by dahlia\r\n * <dahliatrimble@gmail.com>\r\n *\/\r\n\r\n#include \"StableHeaders.h\"\r\n#include \"PrimMesher.h\"\r\n#include \"RexTypes.h\"\r\n#include \"RexLogicModule.h\"\r\n#include \"EC_OpenSimPrim.h\"\r\n#include \"..\/OgreRenderingModule\/OgreMaterialUtils.h\"\r\n\r\n#include <Ogre.h>\r\n\r\nnamespace RexLogic\r\n{\r\n void CreatePrimGeometry(Ogre::ManualObject* object, EC_OpenSimPrim& primitive)\r\n {\r\n try\r\n {\r\n float profileBegin = primitive.ProfileBegin;\r\n float profileEnd = 1.0f - primitive.ProfileEnd;\r\n float profileHollow = primitive.ProfileHollow;\r\n\r\n int sides = 4;\r\n if ((primitive.ProfileCurve & 0x07) == RexTypes::SHAPE_EQUILATERAL_TRIANGLE)\r\n sides = 3;\r\n else if ((primitive.ProfileCurve & 0x07) == RexTypes::SHAPE_CIRCLE)\r\n sides = 24;\r\n else if ((primitive.ProfileCurve & 0x07) == RexTypes::SHAPE_HALF_CIRCLE)\r\n {\r\n \/\/ half circle, prim is a sphere\r\n sides = 24;\r\n\r\n profileBegin = 0.5f * profileBegin + 0.5f;\r\n profileEnd = 0.5f * profileEnd + 0.5f;\r\n }\r\n\r\n int hollowSides = sides;\r\n if ((primitive.ProfileCurve & 0xf0) == RexTypes::HOLLOW_CIRCLE)\r\n hollowSides = 24;\r\n else if ((primitive.ProfileCurve & 0xf0) == RexTypes::HOLLOW_SQUARE)\r\n hollowSides = 4;\r\n else if ((primitive.ProfileCurve & 0xf0) == RexTypes::HOLLOW_TRIANGLE)\r\n hollowSides = 3;\r\n\r\n RexLogicModule::LogInfo(\"PrimMesher::PrimMesh\");\r\n \/\/! \\todo probably cause of random crash -cm\r\n PrimMesher::PrimMesh primMesh(sides, profileBegin, profileEnd, profileHollow, hollowSides);\r\n primMesh.topShearX = primitive.PathShearX;\r\n primMesh.topShearY = primitive.PathShearY;\r\n primMesh.pathCutBegin = primitive.PathBegin;\r\n primMesh.pathCutEnd = 1.0f - primitive.PathEnd;\r\n\r\n if (primitive.PathCurve == RexTypes::EXTRUSION_STRAIGHT)\r\n {\r\n primMesh.twistBegin = primitive.PathTwistBegin * 180;\r\n primMesh.twistEnd = primitive.PathTwist * 180;\r\n primMesh.taperX = primitive.PathScaleX - 1.0f;\r\n primMesh.taperY = primitive.PathScaleY - 1.0f;\r\n primMesh.ExtrudeLinear();\r\n }\r\n else\r\n {\r\n primMesh.holeSizeX = (2.0f - primitive.PathScaleX);\r\n primMesh.holeSizeY = (2.0f - primitive.PathScaleY);\r\n primMesh.radius = primitive.PathRadiusOffset;\r\n primMesh.revolutions = primitive.PathRevolutions;\r\n primMesh.skew = primitive.PathSkew;\r\n primMesh.twistBegin = primitive.PathTwistBegin * 360;\r\n primMesh.twistEnd = primitive.PathTwist * 360;\r\n primMesh.taperX = primitive.PathTaperX;\r\n primMesh.taperY = primitive.PathTaperY;\r\n primMesh.ExtrudeCircular();\r\n }\r\n \/\/ Doesn't get here in case of crash, see above todo\r\n\r\n RexLogicModule::LogInfo(\"Object begin.\");\r\n \r\n if (object)\r\n {\r\n object->clear();\r\n \r\n RexTypes::RexUUID tex_id;\r\n RexTypes::RexUUID prev_tex_id;\r\n \r\n Core::uint indices = 0;\r\n \r\n for (Core::uint i = 0; i < primMesh.viewerFaces.size(); ++i)\r\n {\r\n \/\/ Here we assume (again) that material name = texture UUID in text form\r\n \/\/! \\todo handle material override if prim is using material script\r\n\r\n \/\/ Try to find face's texture in texturemap, use default if not found\r\n tex_id = primitive.PrimDefaultTexture;\r\n TextureMap::const_iterator t = primitive.PrimTextures.find(primMesh.viewerFaces[i].primFaceNumber);\r\n if (t != primitive.PrimTextures.end())\r\n tex_id = t->second;\r\n \r\n if ((i == 0) || (tex_id != prev_tex_id))\r\n {\r\n \/\/ Fill the indices of previous subsection before beginning new\r\n if (indices)\r\n {\r\n for (Core::uint j = 0; j < indices; j += 3)\r\n {\r\n object->index(j);\r\n object->index(j+1);\r\n object->index(j+2);\r\n }\r\n indices = 0;\r\n object->end();\r\n }\r\n \r\n std::string mat_name = tex_id.ToString();\r\n \/\/ Actually create the material here if texture yet missing, we'll fill later\r\n OgreRenderer::GetOrCreateUnlitTexturedMaterial(mat_name.c_str());\r\n \r\n object->begin(mat_name);\r\n }\r\n prev_tex_id = tex_id;\r\n \r\n Ogre::Vector3 pos1(primMesh.viewerFaces[i].v1.X, primMesh.viewerFaces[i].v1.Y, primMesh.viewerFaces[i].v1.Z);\r\n Ogre::Vector3 pos2(primMesh.viewerFaces[i].v2.X, primMesh.viewerFaces[i].v2.Y, primMesh.viewerFaces[i].v2.Z);\r\n Ogre::Vector3 pos3(primMesh.viewerFaces[i].v3.X, primMesh.viewerFaces[i].v3.Y, primMesh.viewerFaces[i].v3.Z);\r\n\r\n Ogre::Vector3 n1(primMesh.viewerFaces[i].n1.X, primMesh.viewerFaces[i].n1.Y, primMesh.viewerFaces[i].n1.Z);\r\n Ogre::Vector3 n2(primMesh.viewerFaces[i].n2.X, primMesh.viewerFaces[i].n2.Y, primMesh.viewerFaces[i].n2.Z);\r\n Ogre::Vector3 n3(primMesh.viewerFaces[i].n3.X, primMesh.viewerFaces[i].n3.Y, primMesh.viewerFaces[i].n3.Z);\r\n \r\n Ogre::Vector2 uv1(primMesh.viewerFaces[i].uv1.U, primMesh.viewerFaces[i].uv1.V);\r\n Ogre::Vector2 uv2(primMesh.viewerFaces[i].uv2.U, primMesh.viewerFaces[i].uv2.V);\r\n Ogre::Vector2 uv3(primMesh.viewerFaces[i].uv3.U, primMesh.viewerFaces[i].uv3.V);\r\n\r\n object->position(pos1);\r\n object->normal(n1);\r\n object->textureCoord(uv1);\r\n \r\n object->position(pos2);\r\n object->normal(n2);\r\n object->textureCoord(uv2);\r\n \r\n object->position(pos3);\r\n object->normal(n3);\r\n object->textureCoord(uv3);\r\n indices += 3;\r\n }\r\n \r\n \/\/ Fill the indices of last subsection\r\n if (indices)\r\n {\r\n for (Core::uint j = 0; j < indices; j += 3)\r\n {\r\n object->index(j);\r\n object->index(j+1);\r\n object->index(j+2);\r\n }\r\n indices = 0;\r\n object->end();\r\n }\r\n }\r\n else\r\n {\r\n RexLogicModule::LogError(std::string(\"Null manualobject passed to CreatePrimGeometry\"));\r\n }\r\n }\r\n catch (Core::Exception& e)\r\n {\r\n RexLogicModule::LogError(std::string(\"Exception while creating primitive geometry: \") + e.what());\r\n }\r\n }\r\n}<|endoftext|>"} {"text":"<commit_before>#include \"ros\/ros.h\"\n#include <math.h>\n#include \"geometry_msgs\/Twist.h\"\n#include \"std_msgs\/String.h\"\n#include \"nav_msgs\/Odometry.h\"\n#include <math.h>\n#include <string.h>\n#include <time.h>\n#include <stdlib.h> \n\n\/\/Parameters\nfloat v_max = 0.6;\nfloat a_max = 0.8;\nfloat a_max_p = 0.06;\ndouble wait_period = 20;\n\n\/\/Common\nbool bool_turn = false;\ndouble angle_diff = 45;\nbool calculate_turn = false; \nbool first_run = true; \nfloat vx_4 = v_max;\nfloat az_4 = 0.0;\ndouble time_begin_4 = 0;\ndouble z_target_4 = 0;\nchar prev_4 = '0';\nbool start_turn_4 = false;\nbool quad_top_turn_4 = false;\nbool is_turning_4 = false;\n\n\ndouble time_begin_5 = 0;\ndouble time_begin_6 = 0;\ndouble time_begin_7 = 0;\ndouble time_begin_8 = 0;\ndouble time_begin_9 = 0;\ndouble time_begin_10 = 0;\ndouble time_begin_11= 0;\ndouble time_begin_12 = 0;\ndouble time_begin_13 = 0;\n\nclass Controller\n{\n ros::NodeHandle n;\n ros::Publisher vel_pub_4;\n ros::Subscriber odom_sub_4; \n\n ros::Subscriber contact_sub;\n\n\npublic:\n Controller()\n {\n vel_pub_4 = n.advertise<geometry_msgs::Twist>(\"\/robot4\/cmd_vel\", 1);\n odom_sub_4 = n.subscribe(\"\/robot4\/odom\", 10, &Controller::odomCb,this);\n }\n ~Controller()\n {\n \n }\n\n struct Quaternionm\n {\n double w, x, y, z;\n };\n\n void GetEulerAngles(Quaternionm q, double& yaw, double& pitch, double& roll)\n {\n const double w2 = q.w*q.w;\n const double x2 = q.x*q.x;\n const double y2 = q.y*q.y;\n const double z2 = q.z*q.z;\n const double unitLength = w2 + x2 + y2 + z2; \/\/ Normalised == 1, otherwise correction divisor.\n const double abcd = q.w*q.x + q.y*q.z;\n const double eps = 1e-7; \/\/ TODO: pick from your math lib instead of hardcoding.\n const double pi = 3.14159265358979323846; \/\/ TODO: pick from your math lib instead of hardcoding.\n if (abcd > (0.5-eps)*unitLength)\n {\n yaw = 2 * atan2(q.y, q.w);\n pitch = pi;\n roll = 0;\n }\n else if (abcd < (-0.5+eps)*unitLength)\n {\n yaw = -2 * ::atan2(q.y, q.w);\n pitch = -pi;\n roll = 0;\n }\n else\n {\n const double adbc = q.w*q.z - q.x*q.y;\n const double acbd = q.w*q.y - q.x*q.z;\n yaw = ::atan2(2*adbc, 1 - 2*(z2+x2));\n pitch = ::asin(2*abcd\/unitLength);\n roll = ::atan2(2*acbd, 1 - 2*(y2+x2));\n }\n }\n\nint add_multiple_error(int times)\n {\n int error = 0;\n for (int i = 0; i<times; i++)\n {\n error += rand() % 20 - 9;\n }\n return error;\n }\n\n void publish_velocity(std::string identification)\n {\n if(identification == \"robot4\/odom\")\n {\n geometry_msgs::Twist command;\n command.linear.x = vx_4;\n command.angular.z = az_4;\n command.linear.y = command.linear.z = command.angular.x = command.angular.y = 0; \n vel_pub_4.publish(command);\n }\n \n \n }\n\n\n void odomCb(const nav_msgs::Odometry::ConstPtr& msg)\n {\n float *vx;\n double *z_target; \n float *az;\n double *time_begin;\n bool *start_turn;\n bool *quad_top_turn;\n bool *is_turning;\n\n Quaternionm myq;\n double yaw = 0;\n double pitch = 0;\n double roll = 0;\n myq.x = msg->pose.pose.orientation.x;\n myq.y = msg->pose.pose.orientation.y;\n myq.z = msg->pose.pose.orientation.z;\n myq.w = msg->pose.pose.orientation.w; \n GetEulerAngles(myq, yaw, pitch, roll);\n \n\n if(msg->header.frame_id == \"robot4\/odom\")\n {\n vx = &vx_4;\n z_target = &z_target_4;\n az = &az_4;\n time_begin = &time_begin_4;\n start_turn = &start_turn_4;\n quad_top_turn = &quad_top_turn_4;\n is_turning = &is_turning_4;\n }\n \n\n std::string Caller = \"\";\n \n \n double diff = *z_target - yaw;\n diff = fabs(diff);\n double time_present = ros::Time::now().toSec();\n \/\/ROS_INFO(\"time_present: %lf, time_begin: %lf, roll: %lf\",time_present,time_begin,diff);\n if(diff > 0.13490 && *is_turning == true)\n {\n *time_begin = time_present;\n *vx = 0;\n *az = a_max; \n }\n else if(diff < 0.13490 && *is_turning == true)\n {\n *is_turning = false;\n *vx = v_max;\n *az = 0;\n }\n\n if(!*is_turning)\n {\n *vx = v_max;\n *az = 0;\n }\n\n if((time_present - *time_begin) > wait_period)\n {\n angle_diff = 45 + add_multiple_error(4); \n calculate_turn = true;\n Caller = \"time\"; \n }\n\n if(*start_turn == true)\n {\n angle_diff = 180 + add_multiple_error(4);\n calculate_turn = true;\n *start_turn = false;\n Caller = \"base\";\n }\n\n if(*quad_top_turn == true)\n {\n angle_diff = 45 + add_multiple_error(4);\n calculate_turn = true;\n *quad_top_turn = false;\n Caller = \"top\";\n }\n\n\n if(calculate_turn)\n {\n *is_turning = true; \n \n double turn_angle = (angle_diff*3.141592)\/180;\n *z_target = yaw - turn_angle;\n if(*z_target > 3.14)\n {\n *z_target = 2*3.14 - *z_target;\n }\n else if(*z_target < -3.14)\n {\n *z_target = 2*3.14 + *z_target;\n }\n \/\/ROS_INFO(\"target: %lf\",z_target);\n *time_begin = time_present; \n calculate_turn = false;\n *vx = -v_max*5;\n }\n publish_velocity(msg->header.frame_id);\n }\n \n};\n\n\n\nint main(int argc, char** argv)\n{\n ros::init(argc, argv, \"CreateController\");\n Controller ic;\n time_begin_4 = time_begin_5 = time_begin_6 = time_begin_7 = time_begin_8 = time_begin_9 = time_begin_10 = time_begin_11 = time_begin_12 = time_begin_13 = ros::Time::now().toSec();\n srand (time(NULL));\n ros::spin();\nreturn 0;\n}\n\n<commit_msg>Delete groundbot.cpp<commit_after><|endoftext|>"} {"text":"<commit_before>#include <cmath>\n#include <algorithm>\n\n#include \"systems\/movementsystem.h\"\n#include \"cli_mousecmd.h\"\n#include \"cli_stopmoving.h\"\n#include \"cmapserver.h\"\n#include \"packetfactory.h\"\n#include \"srv_mousecmd.h\"\n#include \"srv_stopmoving.h\"\n#include \"srv_adjustposition.h\"\n#include \"srv_switchserver.h\"\n#include \"config.h\"\n#include \"cmapclient.h\"\n\nusing namespace Systems;\nusing namespace RoseCommon;\n\nMovementSystem::MovementSystem(SystemManager &manager) : System(manager) {\n manager.registerDispatcher(ePacketType::PAKCS_MOUSE_CMD, &MovementSystem::processMove);\n manager.registerDispatcher(ePacketType::PAKCS_STOP_MOVING, &MovementSystem::stopMoving);\n manager.getEntityManager().on_component_removed<Destination>([this](Entity entity, Destination *dest) {\n if (!entity) return;\n if (auto client = getClient(entity))\n manager_.SendPacket(client, CMapServer::eSendType::NEARBY,\n *makePacket<ePacketType::PAKWC_STOP_MOVING>(entity));\n \/\/ TODO: check what type entity.component<BasicInfo>()->targetId_ is and execute corresponding action (npc talk, attack, item pickup...)\n });\n manager.getEntityManager().on_component_added<Position>([this](Entity entity, Position*) {\n updatePosition(entity);\n });\n}\n\nvoid MovementSystem::update(EntityManager &es, double dt) {\n for (Entity entity : es.entities_with_components<Position, Destination, AdvancedInfo>()) {\n Position *position = entity.component<Position>();\n Destination *destination = entity.component<Destination>();\n AdvancedInfo *advanced = entity.component<AdvancedInfo>();\n float dx = destination->x_ - position->x_;\n float dy = destination->y_ - position->y_;\n float distance = std::sqrt(dx * dx + dy * dy);\n destination->dist_ = distance;\n float speed = advanced->runSpeed_;\n float ntime = distance \/ speed;\n float old_x = position->x_;\n float old_y = position->y_;\n if (ntime <= dt || distance == 0) {\n position->x_ = destination->x_;\n position->y_ = destination->y_;\n entity.remove<Destination>();\n } else {\n position->x_ += dx * dt \/ ntime;\n position->y_ += dy * dt \/ ntime;\n }\n updatePosition(entity, old_x, old_y);\n if (Entity e = is_on_warpgate(entity); e) {\n auto dest = e.component<Destination>();\n teleport(entity, dest->dist_, dest->x_, dest->y_);\n }\n }\n}\n\nvoid MovementSystem::move(Entity entity, float x, float y, uint16_t target) {\n if (!entity) return;\n auto dest = entity.component<Destination>();\n auto pos = entity.component<Position>();\n float dx = pos->x_ - x;\n float dy = pos->y_ - y;\n float dist = std::sqrt(dx * dx + dy * dy);\n if (dest) {\n dest->x_ = x;\n dest->y_ = y;\n dest->dist_ = dist;\n } else {\n entity.assign<Destination>(x, y, dist);\n }\n entity.component<BasicInfo>()->targetId_ = target;\n \/\/ FIXME: what happens if the entity is an NPC or a monster?\n if (auto client = getClient(entity))\n manager_.SendPacket(client, CMapServer::eSendType::EVERYONE, *makePacket<ePacketType::PAKWC_MOUSE_CMD>(entity));\n}\n\nvoid MovementSystem::stop(Entity entity, float x, float y) {\n if (!entity || !entity.component<BasicInfo>()) return;\n entity.remove<Destination>();\n auto position = entity.component<Position>();\n if (position) {\n float dx = position->x_ - x;\n float dy = position->y_ - y;\n if (dx * dx + dy * dy < POSITION_CHEATING) {\n position->x_ = x;\n position->y_ = y;\n } else\n logger_->warn(\"Player {} attempted to cheat his position : calculated position : ({}, {}), got ({}, {})\",\n getId(entity), position->x_, position->y_, x, y);\n }\n}\n\nvoid MovementSystem::processMove(CMapClient &, Entity entity, const CliMouseCmd &packet) {\n logger_->trace(\"MovementSystem::processMove\");\n if (!entity.component<Position>() || !entity.component<BasicInfo>()) return;\n move(entity, packet.x(), packet.y(), packet.targetId());\n}\n\nvoid MovementSystem::stopMoving(CMapClient &, Entity entity, const CliStopMoving &packet) {\n logger_->trace(\"MovementSystem::stopMoving\");\n stop(entity, packet.x(), packet.y());\n}\n\nvoid MovementSystem::teleport(Entity entity, uint16_t map_id, float x, float y) {\n logger_->trace(\"MovementSystem::teleport\");\n logger_->debug(\"Teleporting {} to {} {} {}\", getId(entity), map_id, x, y);\n entity.component<BasicInfo>()->targetId_ = 0; \/\/ to avoid doing anything in the destination callback\n entity.remove<Destination>();\n auto pos = entity.component<Position>();\n pos->x_ = x;\n pos->y_ = y;\n if (pos->map_ == map_id) {\n manager_.SendPacket(getClient(entity), CMapServer::eSendType::EVERYONE, \n *makePacket<ePacketType::PAKWC_ADJUST_POSITION>(entity));\n } else {\n if (auto client = getClient(entity)) {\n auto &config = Core::Config::getInstance();\n client->switch_server();\n client->send(*makePacket<ePacketType::PAKCC_SWITCH_SERVER>(\n config.mapServer().clientPort + map_id,\n client->get_session_id(),\n 0,\n config.serverData().ip));\n }\n }\n}\n\nnamespace {\nconstexpr std::tuple<uint16_t, uint16_t> get_grid_position(float x, float y) {\n uint16_t gx = x \/ 1000.f;\n uint16_t gy = y \/ 1000.f;\n return {gx, gy};\n}\n\nstd::tuple<uint16_t, uint16_t> get_grid_position(Entity e) {\n auto pos = e.component<Position>();\n return get_grid_position(pos->x_, pos->y_);\n}\n}\n\nbool MovementSystem::is_nearby(Entity a, Entity b) const {\n auto pos_a = get_grid_position(a);\n auto pos_b = get_grid_position(b);\n if (std::abs(std::get<0>(pos_a) - std::get<0>(pos_b)) <= 1\n && std::abs(std::get<1>(pos_a) - std::get<1>(pos_b)) <= 1)\n return true;\n return false;\n}\n\nvoid MovementSystem::updatePosition(Entity e, float old_x, float old_y) {\n if (old_x && old_y) {\n auto &list = grid[get_grid_position(old_x, old_y)];\n std::remove(list.begin(), list.end(), e);\n }\n grid[get_grid_position(e)].push_back(e);\n}\n\nEntity MovementSystem::is_on_warpgate(Entity e) {\n auto pos = e.component<Position>();\n for (auto &it : grid[get_grid_position(e)]) {\n if (it.component<Warpgate>()) continue; \/\/ skip non warpgates\n auto warp_pos = it.component<Position>();\n float dx = pos->x_ - warp_pos->x_;\n float dy = pos->x_ - warp_pos->y_;\n \/\/ FIXME: this should actually be a matrix multiplication to compute the warpgate final position\n \/\/ rot * scale * pos\n if (dx * dx + dy * dy < WARPGATE_DISTANCE) return it;\n }\n return {};\n}\n<commit_msg>Update movementsystem.cpp<commit_after>#include <cmath>\n#include <algorithm>\n\n#include \"systems\/movementsystem.h\"\n#include \"cli_mousecmd.h\"\n#include \"cli_stopmoving.h\"\n#include \"cmapserver.h\"\n#include \"packetfactory.h\"\n#include \"srv_mousecmd.h\"\n#include \"srv_stopmoving.h\"\n#include \"srv_adjustposition.h\"\n#include \"srv_switchserver.h\"\n#include \"config.h\"\n#include \"cmapclient.h\"\n\nusing namespace Systems;\nusing namespace RoseCommon;\n\nMovementSystem::MovementSystem(SystemManager &manager) : System(manager) {\n manager.registerDispatcher(ePacketType::PAKCS_MOUSE_CMD, &MovementSystem::processMove);\n manager.registerDispatcher(ePacketType::PAKCS_STOP_MOVING, &MovementSystem::stopMoving);\n manager.getEntityManager().on_component_removed<Destination>([this](Entity entity, Destination *dest) {\n if (!entity) return;\n if (auto client = getClient(entity))\n manager_.SendPacket(client, CMapServer::eSendType::NEARBY,\n *makePacket<ePacketType::PAKWC_STOP_MOVING>(entity));\n \/\/ TODO: check what type entity.component<BasicInfo>()->targetId_ is and execute corresponding action (npc talk, attack, item pickup...)\n });\n manager.getEntityManager().on_component_added<Position>([this](Entity entity, Position*) {\n updatePosition(entity);\n });\n}\n\nvoid MovementSystem::update(EntityManager &es, double dt) {\n for (Entity entity : es.entities_with_components<Position, Destination, AdvancedInfo>()) {\n Position *position = entity.component<Position>();\n Destination *destination = entity.component<Destination>();\n AdvancedInfo *advanced = entity.component<AdvancedInfo>();\n float dx = destination->x_ - position->x_;\n float dy = destination->y_ - position->y_;\n float distance = std::sqrt(dx * dx + dy * dy);\n destination->dist_ = distance;\n float speed = advanced->runSpeed_;\n float ntime = distance \/ speed;\n float old_x = position->x_;\n float old_y = position->y_;\n if (ntime <= dt || distance == 0) {\n position->x_ = destination->x_;\n position->y_ = destination->y_;\n entity.remove<Destination>();\n } else {\n position->x_ += dx * dt \/ ntime;\n position->y_ += dy * dt \/ ntime;\n }\n updatePosition(entity, old_x, old_y);\n if (Entity e = is_on_warpgate(entity); e) {\n auto dest = e.component<Destination>();\n teleport(entity, dest->dist_, dest->x_, dest->y_);\n }\n }\n}\n\nvoid MovementSystem::move(Entity entity, float x, float y, uint16_t target) {\n if (!entity) return;\n auto dest = entity.component<Destination>();\n auto pos = entity.component<Position>();\n float dx = pos->x_ - x;\n float dy = pos->y_ - y;\n float dist = std::sqrt(dx * dx + dy * dy);\n if (dest) {\n dest->x_ = x;\n dest->y_ = y;\n dest->dist_ = dist;\n } else {\n entity.assign<Destination>(x, y, dist);\n }\n entity.component<BasicInfo>()->targetId_ = target;\n \/\/ FIXME: what happens if the entity is an NPC or a monster?\n if (auto client = getClient(entity))\n manager_.SendPacket(client, CMapServer::eSendType::EVERYONE, *makePacket<ePacketType::PAKWC_MOUSE_CMD>(entity));\n}\n\nvoid MovementSystem::stop(Entity entity, float x, float y) {\n if (!entity || !entity.component<BasicInfo>()) return;\n entity.remove<Destination>();\n auto position = entity.component<Position>();\n if (position) {\n float dx = position->x_ - x;\n float dy = position->y_ - y;\n if (dx * dx + dy * dy < POSITION_CHEATING) {\n position->x_ = x;\n position->y_ = y;\n } else\n logger_->warn(\"Player {} attempted to cheat his position : calculated position : ({}, {}), got ({}, {})\",\n getId(entity), position->x_, position->y_, x, y);\n }\n}\n\nvoid MovementSystem::processMove(CMapClient &, Entity entity, const CliMouseCmd &packet) {\n logger_->trace(\"MovementSystem::processMove\");\n if (!entity.component<Position>() || !entity.component<BasicInfo>()) return;\n move(entity, packet.x(), packet.y(), packet.targetId());\n}\n\nvoid MovementSystem::stopMoving(CMapClient &, Entity entity, const CliStopMoving &packet) {\n logger_->trace(\"MovementSystem::stopMoving\");\n stop(entity, packet.x(), packet.y());\n}\n\nvoid MovementSystem::teleport(Entity entity, uint16_t map_id, float x, float y) {\n logger_->trace(\"MovementSystem::teleport\");\n logger_->debug(\"Teleporting {} to {} {} {}\", getId(entity), map_id, x, y);\n entity.component<BasicInfo>()->targetId_ = 0; \/\/ to avoid doing anything in the destination callback\n entity.remove<Destination>();\n auto pos = entity.component<Position>();\n pos->x_ = x;\n pos->y_ = y;\n if (pos->map_ == map_id) {\n manager_.SendPacket(getClient(entity), CMapServer::eSendType::EVERYONE, \n *makePacket<ePacketType::PAKWC_ADJUST_POSITION>(entity));\n } else {\n if (auto client = getClient(entity)) {\n auto &config = Core::Config::getInstance();\n client->switch_server();\n client->send(*makePacket<ePacketType::PAKCC_SWITCH_SERVER>(\n config.mapServer().clientPort + map_id,\n client->get_session_id(),\n 0,\n config.serverData().ip));\n }\n }\n}\n\nnamespace {\nconstexpr std::tuple<uint16_t, uint16_t> get_grid_position(float x, float y) {\n uint16_t gx = x \/ 1000.f;\n uint16_t gy = y \/ 1000.f;\n return {gx, gy};\n}\n\nstd::tuple<uint16_t, uint16_t> get_grid_position(Entity e) {\n auto pos = e.component<Position>();\n if (!pos) return {0, 0};\n return get_grid_position(pos->x_, pos->y_);\n}\n}\n\nbool MovementSystem::is_nearby(Entity a, Entity b) const {\n if (!a || !b) return false;\n auto pos_a = get_grid_position(a);\n auto pos_b = get_grid_position(b);\n if (std::abs(std::get<0>(pos_a) - std::get<0>(pos_b)) <= 1\n && std::abs(std::get<1>(pos_a) - std::get<1>(pos_b)) <= 1)\n return true;\n return false;\n}\n\nvoid MovementSystem::updatePosition(Entity e, float old_x, float old_y) {\n if (old_x && old_y) {\n auto &list = grid[get_grid_position(old_x, old_y)];\n std::remove(list.begin(), list.end(), e);\n }\n grid[get_grid_position(e)].push_back(e);\n}\n\nEntity MovementSystem::is_on_warpgate(Entity e) {\n auto pos = e.component<Position>();\n for (auto &it : grid[get_grid_position(e)]) {\n if (it.component<Warpgate>()) continue; \/\/ skip non warpgates\n auto warp_pos = it.component<Position>();\n float dx = pos->x_ - warp_pos->x_;\n float dy = pos->x_ - warp_pos->y_;\n \/\/ FIXME: this should actually be a matrix multiplication to compute the warpgate final position\n \/\/ rot * scale * pos\n if (dx * dx + dy * dy < WARPGATE_DISTANCE) return it;\n }\n return {};\n}\n<|endoftext|>"} {"text":"<commit_before>\/*!\n* \\brief\n*\n* \\author ddubois\n* \\date 27-Sep-16.\n*\/\n\n#include <algorithm>\n#include <easylogging++.h>\n#include <regex>\n#include \"mesh_store.h\"\n#include \"..\/..\/..\/render\/nova_renderer.h\"\n#include \"builders\/chunk_builder.h\"\n#include \"..\/utils\/io.h\"\n\nnamespace nova {\n std::vector<render_object>& mesh_store::get_meshes_for_shader(std::string shader_name) {\n return renderables_grouped_by_shader[shader_name];\n }\n\n void print_buffers(std::string texture_name, std::vector<float>& vertex_buffer, std::vector<unsigned int>& index_buffer) {\n \/\/ debug\n LOG(DEBUG) << \"texture name: \" << texture_name << std::endl;\n LOG(DEBUG) << \"new buffers:\" << std::endl;\n for(int i = 0; i + 7 < vertex_buffer.size(); i += 8) {\n std::ostringstream ss;\n ss << \" vertex \";\n for(int k = 0; k < 8; k++) {\n ss << std::setfill(' ') << std::setw(4) << i + k << \" = \" << std::setfill(' ') << std::setw(12) << std::fixed << std::setprecision(5) << vertex_buffer[i + k] << \" \";\n }\n LOG(DEBUG) << ss.str();\n }\n for(int i = 0; i + 2 < index_buffer.size(); i += 3) {\n std::ostringstream ss;\n ss << \" index \";\n for(int k = 0; k < 3; k++) {\n ss << std::setfill(' ') << std::setw(4) << i + k << \" = \" << std::setfill(' ') << std::setw(8) << index_buffer[i + k] << \" \";\n }\n LOG(DEBUG) << ss.str();\n }\n }\n\n void mesh_store::add_gui_buffers(mc_gui_send_buffer_command* command) {\n std::string texture_name(command->texture_name);\n texture_name = std::regex_replace(texture_name, std::regex(\"^textures\/\"), \"\");\n texture_name = std::regex_replace(texture_name, std::regex(\".png$\"), \"\");\n texture_name = \"minecraft:\" + texture_name;\n const texture_manager::texture_location tex_location = nova_renderer::instance->get_texture_manager().get_texture_location(texture_name);\n glm::vec2 tex_size = tex_location.max - tex_location.min;\n\n std::vector<float> vertex_buffer(command->vertex_buffer_size);\n for (int i = 0; i + 8 < command->vertex_buffer_size; i += 9) {\n vertex_buffer[i] = command->vertex_buffer[i];\n vertex_buffer[i+1] = command->vertex_buffer[i+1];\n vertex_buffer[i+2] = command->vertex_buffer[i+2];\n vertex_buffer[i+3] = command->vertex_buffer[i+3] * tex_size.x + tex_location.min.x;\n vertex_buffer[i+4] = command->vertex_buffer[i+4] * tex_size.y + tex_location.min.y;\n vertex_buffer[i+5] = command->vertex_buffer[i+5];\n vertex_buffer[i+6] = command->vertex_buffer[i+6];\n vertex_buffer[i+7] = command->vertex_buffer[i+7];\n vertex_buffer[i+8] = command->vertex_buffer[i+8];\n }\n std::vector<unsigned int> index_buffer(command->index_buffer_size);\n for(int i = 0; i < command->index_buffer_size; i++) {\n index_buffer[i] = (unsigned int)command->index_buffer[i];\n }\n\n \/\/ debug\n \/\/print_buffers(texture_name, vertex_buffer, index_buffer);\n\n mesh_definition cur_screen_buffer;\n cur_screen_buffer.vertex_data = vertex_buffer;\n cur_screen_buffer.indices = index_buffer;\n cur_screen_buffer.vertex_format = format::POS_UV_COLOR;\n\n render_object gui = {};\n gui.geometry.reset(new gl_mesh(cur_screen_buffer));\n gui.type = geometry_type::gui;\n gui.name = \"gui\";\n gui.is_solid = true;\n gui.color_texture = command->atlas_name;\n\n sort_render_object(gui);\n }\n\n void mesh_store::remove_gui_render_objects() {\n for(auto& group : renderables_grouped_by_shader) {\n auto removed_elements = std::remove_if(group.second.begin(), group.second.end(),\n [](auto& render_obj) {return render_obj.type == geometry_type::gui;});\n group.second.erase(removed_elements, group.second.end());\n }\n }\n\n void mesh_store::sort_render_object(render_object& object) {\n auto& all_shaders = shaders->get_loaded_shaders();\n for(auto& entry : all_shaders) {\n auto filter = entry.second.get_filter();\n if(filter->matches(object)) {\n renderables_grouped_by_shader[entry.first].push_back(std::move(object));\n }\n }\n }\n\n void mesh_store::remove_render_objects(std::function<bool(render_object&)> filter) {\n for(auto& group : renderables_grouped_by_shader) {\n std::remove_if(group.second.begin(), group.second.end(), filter);\n }\n }\n\n void mesh_store::set_shaderpack(std::shared_ptr<shaderpack> new_shaderpack) {\n shaders = new_shaderpack;\n\n renderables_grouped_by_shader.clear();\n for(auto& chunk : all_chunks) {\n generate_chunk_geometry(chunk);\n }\n }\n\n void mesh_store::add_or_update_chunk(mc_chunk &chunk) {\n chunk_adding_lock.lock();\n chunk.needs_update = true;\n LOG(INFO) << \"Received a chunk with id \" << chunk.chunk_id;\n all_chunks.push_back(chunk);\n chunk_adding_lock.unlock();\n }\n\n void mesh_store::generate_chunk_geometry(const mc_chunk &chunk) {\n auto render_objects_from_chunk = get_renderables_from_chunk(chunk, *shaders);\n for(auto& item : render_objects_from_chunk) {\n if(item.second) {\n renderables_grouped_by_shader[item.first].push_back(std::move(*item.second));\n }\n }\n }\n\n void mesh_store::register_model(std::string model_name, mc_simple_model &mc_model) {\n mesh_definition model = make_mesh_from_mc_model(mc_model);\n\n\t\tsimple_models[model_name] = model;\n }\n\n mesh_definition mesh_store::make_mesh_from_mc_model(mc_simple_model &model) {\n mesh_definition mesh;\n \/\/ TODO: This method needs to happen\n return mesh;\n }\n\n void mesh_store::deregister_model(std::string model_name) {\n simple_models.erase(model_name);\n }\n\n void mesh_store::generate_needed_chunk_geometry() {\n for(auto& chunk : all_chunks) {\n if(chunk.needs_update) {\n LOG(INFO) << \"Generating a geometry for chunk id \" << chunk.chunk_id;\n make_geometry_for_chunk(chunk);\n chunk.needs_update = false;\n }\n }\n }\n\n void mesh_store::make_geometry_for_chunk(const mc_chunk &chunk) {\n LOG(INFO) << \"Generating geometry for a chunk\";\n auto start_time = std::clock();\n\n remove_render_objects([&](render_object& obj) {return obj.parent_id == chunk.chunk_id;});\n LOG(INFO) << \"Removed render objects from our chunk\";\n\n auto time_after_removing_objects = std::clock();\n\n generate_chunk_geometry(chunk);\n LOG(INFO) << \"Generated chunk geometry\";\n\n auto time_after_generating_chunk_geometry = std::clock();\n\n auto total_time = float(std::clock() - start_time) * 1000 \/ CLOCKS_PER_SEC;\n total_chunks_updated += 1;\n\n if(total_chunks_updated % 10 == 0) {\n LOG(INFO) << \"We have spent:\\n\\t\"\n << float(time_after_removing_objects - start_time) * 1000 \/ CLOCKS_PER_SEC << \"ms removing old render objects\\n\\t\"\n << float(time_after_generating_chunk_geometry - time_after_removing_objects) * 1000 \/ CLOCKS_PER_SEC << \"ms generating chunk geometry\\n\\t\"\n << total_time << \"ms in total\";\n }\n }\n}\n<commit_msg>Many chunks<commit_after>\/*!\n* \\brief\n*\n* \\author ddubois\n* \\date 27-Sep-16.\n*\/\n\n#include <algorithm>\n#include <easylogging++.h>\n#include <regex>\n#include \"mesh_store.h\"\n#include \"..\/..\/..\/render\/nova_renderer.h\"\n#include \"builders\/chunk_builder.h\"\n#include \"..\/utils\/io.h\"\n\nnamespace nova {\n std::vector<render_object>& mesh_store::get_meshes_for_shader(std::string shader_name) {\n return renderables_grouped_by_shader[shader_name];\n }\n\n void print_buffers(std::string texture_name, std::vector<float>& vertex_buffer, std::vector<unsigned int>& index_buffer) {\n \/\/ debug\n LOG(DEBUG) << \"texture name: \" << texture_name << std::endl;\n LOG(DEBUG) << \"new buffers:\" << std::endl;\n for(int i = 0; i + 7 < vertex_buffer.size(); i += 8) {\n std::ostringstream ss;\n ss << \" vertex \";\n for(int k = 0; k < 8; k++) {\n ss << std::setfill(' ') << std::setw(4) << i + k << \" = \" << std::setfill(' ') << std::setw(12) << std::fixed << std::setprecision(5) << vertex_buffer[i + k] << \" \";\n }\n LOG(DEBUG) << ss.str();\n }\n for(int i = 0; i + 2 < index_buffer.size(); i += 3) {\n std::ostringstream ss;\n ss << \" index \";\n for(int k = 0; k < 3; k++) {\n ss << std::setfill(' ') << std::setw(4) << i + k << \" = \" << std::setfill(' ') << std::setw(8) << index_buffer[i + k] << \" \";\n }\n LOG(DEBUG) << ss.str();\n }\n }\n\n void mesh_store::add_gui_buffers(mc_gui_send_buffer_command* command) {\n std::string texture_name(command->texture_name);\n texture_name = std::regex_replace(texture_name, std::regex(\"^textures\/\"), \"\");\n texture_name = std::regex_replace(texture_name, std::regex(\".png$\"), \"\");\n texture_name = \"minecraft:\" + texture_name;\n const texture_manager::texture_location tex_location = nova_renderer::instance->get_texture_manager().get_texture_location(texture_name);\n glm::vec2 tex_size = tex_location.max - tex_location.min;\n\n std::vector<float> vertex_buffer(command->vertex_buffer_size);\n for (int i = 0; i + 8 < command->vertex_buffer_size; i += 9) {\n vertex_buffer[i] = command->vertex_buffer[i];\n vertex_buffer[i+1] = command->vertex_buffer[i+1];\n vertex_buffer[i+2] = command->vertex_buffer[i+2];\n vertex_buffer[i+3] = command->vertex_buffer[i+3] * tex_size.x + tex_location.min.x;\n vertex_buffer[i+4] = command->vertex_buffer[i+4] * tex_size.y + tex_location.min.y;\n vertex_buffer[i+5] = command->vertex_buffer[i+5];\n vertex_buffer[i+6] = command->vertex_buffer[i+6];\n vertex_buffer[i+7] = command->vertex_buffer[i+7];\n vertex_buffer[i+8] = command->vertex_buffer[i+8];\n }\n std::vector<unsigned int> index_buffer(command->index_buffer_size);\n for(int i = 0; i < command->index_buffer_size; i++) {\n index_buffer[i] = (unsigned int)command->index_buffer[i];\n }\n\n \/\/ debug\n \/\/print_buffers(texture_name, vertex_buffer, index_buffer);\n\n mesh_definition cur_screen_buffer;\n cur_screen_buffer.vertex_data = vertex_buffer;\n cur_screen_buffer.indices = index_buffer;\n cur_screen_buffer.vertex_format = format::POS_UV_COLOR;\n\n render_object gui = {};\n gui.geometry.reset(new gl_mesh(cur_screen_buffer));\n gui.type = geometry_type::gui;\n gui.name = \"gui\";\n gui.is_solid = true;\n gui.color_texture = command->atlas_name;\n\n sort_render_object(gui);\n }\n\n void mesh_store::remove_gui_render_objects() {\n for(auto& group : renderables_grouped_by_shader) {\n auto removed_elements = std::remove_if(group.second.begin(), group.second.end(),\n [](auto& render_obj) {return render_obj.type == geometry_type::gui;});\n group.second.erase(removed_elements, group.second.end());\n }\n }\n\n void mesh_store::sort_render_object(render_object& object) {\n auto& all_shaders = shaders->get_loaded_shaders();\n for(auto& entry : all_shaders) {\n auto filter = entry.second.get_filter();\n if(filter->matches(object)) {\n renderables_grouped_by_shader[entry.first].push_back(std::move(object));\n }\n }\n }\n\n void mesh_store::remove_render_objects(std::function<bool(render_object&)> filter) {\n for(auto& group : renderables_grouped_by_shader) {\n std::remove_if(group.second.begin(), group.second.end(), filter);\n }\n }\n\n void mesh_store::set_shaderpack(std::shared_ptr<shaderpack> new_shaderpack) {\n shaders = new_shaderpack;\n\n renderables_grouped_by_shader.clear();\n for(auto& chunk : all_chunks) {\n generate_chunk_geometry(chunk);\n }\n }\n\n void mesh_store::add_or_update_chunk(mc_chunk &chunk) {\n chunk_adding_lock.lock();\n chunk.needs_update = true;\n LOG(INFO) << \"Received a chunk with id \" << chunk.chunk_id;\n all_chunks.push_back(chunk);\n chunk_adding_lock.unlock();\n }\n\n void mesh_store::generate_chunk_geometry(const mc_chunk &chunk) {\n auto render_objects_from_chunk = get_renderables_from_chunk(chunk, *shaders);\n for(auto& item : render_objects_from_chunk) {\n if(item.second) {\n renderables_grouped_by_shader[item.first].push_back(std::move(*item.second));\n }\n }\n }\n\n void mesh_store::register_model(std::string model_name, mc_simple_model &mc_model) {\n mesh_definition model = make_mesh_from_mc_model(mc_model);\n\n\t\tsimple_models[model_name] = model;\n }\n\n mesh_definition mesh_store::make_mesh_from_mc_model(mc_simple_model &model) {\n mesh_definition mesh;\n \/\/ TODO: This method needs to happen\n return mesh;\n }\n\n void mesh_store::deregister_model(std::string model_name) {\n simple_models.erase(model_name);\n }\n\n void mesh_store::generate_needed_chunk_geometry() {\n chunk_adding_lock.lock();\n for(auto& chunk : all_chunks) {\n if(chunk.needs_update) {\n LOG(INFO) << \"Generating a geometry for chunk id \" << chunk.chunk_id;\n make_geometry_for_chunk(chunk);\n chunk.needs_update = false;\n }\n }\n chunk_adding_lock.unlock();\n }\n\n void mesh_store::make_geometry_for_chunk(const mc_chunk &chunk) {\n LOG(INFO) << \"Generating geometry for a chunk\";\n auto start_time = std::clock();\n\n remove_render_objects([&](render_object& obj) {return obj.parent_id == chunk.chunk_id;});\n LOG(INFO) << \"Removed render objects from our chunk\";\n\n auto time_after_removing_objects = std::clock();\n\n generate_chunk_geometry(chunk);\n LOG(INFO) << \"Generated chunk geometry\";\n\n auto time_after_generating_chunk_geometry = std::clock();\n\n auto total_time = float(std::clock() - start_time) * 1000 \/ CLOCKS_PER_SEC;\n total_chunks_updated += 1;\n\n if(total_chunks_updated % 10 == 0) {\n LOG(INFO) << \"We have spent:\\n\\t\"\n << float(time_after_removing_objects - start_time) * 1000 \/ CLOCKS_PER_SEC << \"ms removing old render objects\\n\\t\"\n << float(time_after_generating_chunk_geometry - time_after_removing_objects) * 1000 \/ CLOCKS_PER_SEC << \"ms generating chunk geometry\\n\\t\"\n << total_time << \"ms in total\";\n }\n }\n}\n<|endoftext|>"} {"text":"<commit_before>\/\/\n\/\/ Copyright (c) 2014-2017 Ian Godin and Kimball Thurston\n\/\/ All rights reserved.\n\/\/ Copyrights licensed under the MIT License.\n\/\/ See the accompanying LICENSE.txt file for terms\n\/\/\n\n#include <platform\/platform.h>\n#include <platform\/system.h>\n#include <platform\/dispatcher.h>\n#include <gl\/opengl.h>\n#include <gl\/api.h>\n#include <gl\/mesh.h>\n#include <gl\/png_image.h>\n#include <base\/contract.h>\n#include <base\/timer.h>\n#include <base\/math_functions.h>\n#include <draw\/path.h>\n#include <draw\/polylines.h>\n#include <draw\/text.h>\n#include <script\/font_manager.h>\n\nnamespace\n{\n\nint safemain( int \/*argc*\/, char * \/*argv*\/ [] )\n{\n\tauto sys = platform::platform::find_running();\n\n\tauto win = sys->new_window();\n\twin->resize( 400, 400 );\n\twin->set_title( \"Draw Test\" );\n\twin->acquire();\n\n\tgl::api ogl;\n\togl.setup_debugging();\n\n\tauto fm = script::font_manager::common();\n\tif ( ! fm )\n\t\tthrow std::runtime_error( \"no font manager enrolled\" );\n\n\tdraw::text samptext( fm->get_font( \"Lucida Grande\", \"Regular\", 28.0 ) );\n\tsamptext.set_text( \"Hello, world!\" );\n\tsamptext.set_position( gl::vec2( 100.F, 200.F ) );\n\tsamptext.set_color( gl::color( 1.0, 1.0, 1.0, 1.0 ) );\n\n\tgl::mesh star;\n\t{\n\t\t\/\/ Draw a star shape (with 17 points).\n\t\tdraw::path path;\n\t\tsize_t p = 17;\n\t\tsize_t q = 5;\n\t\tpath.move_to( gl::vec2::polar( 200.F, 0.F ) );\n\t\tfor ( size_t i = q % p; i != 0; i = ( i + q ) % p )\n\t\t\tpath.line_to( gl::vec2::polar( 200.F, 360.0_deg * i \/ p ) );\n\t\tpath.close();\n\n\t\t\/\/ Setup GL vertex\/element buffers.\n\t\tgl::color color;\n\t\tsize_t offset = 0;\n\t\tgl::vertex_buffer_data<gl::vec2,gl::color> pos;\n\t\tauto add_point = [&]( float x, float y )\n\t\t{\n\t\t\tpos.push_back( { x, y }, color );\n\t\t};\n\n\t\tgl::element_buffer_data tris;\n\t\tauto add_tri = [&]( size_t a, size_t b, size_t c )\n\t\t{\n\t\t\ttris.push_back( static_cast<uint32_t>( offset + a ), static_cast<uint32_t>( offset + b ), static_cast<uint32_t>( offset + c ) );\n\t\t};\n\n\t\t\/\/ Fill in the buffers\n\t\tdraw::polylines lines;\n\t\tpath.replay( lines );\n\n\t \tcolor = gl::blue;\n\t\tlines.filled( add_point, add_tri );\n\t\toffset = pos.size();\n\n\t\tcolor = gl::red;\n\t\tauto outline = lines.stroked( 2 );\n\t\toutline.filled( add_point, add_tri );\n\n\t\t\/\/ Finally setup the star mesh\n\t\tstar.get_program().set(\n\t\t\togl.new_vertex_shader( R\"SHADER(\n\t\t\t\t#version 330\n\n\t\t\t\tlayout(location = 0) in vec2 vertex_position;\n\t\t\t\tlayout(location = 1) in vec3 vertex_color;\n\n\t\t\t\tuniform mat4 matrix;\n\n\t\t\t\tout vec3 color;\n\n\t\t\t\tvoid main()\n\t\t\t\t{\n\t\t\t\t\tcolor = vertex_color;\n\t\t\t\t\tgl_Position = matrix * vec4( vertex_position, 0.0, 1.0 );\n\t\t\t\t}\n\t\t\t)SHADER\" ),\n\t\t\togl.new_fragment_shader( R\"SHADER(\n\t\t\t\t#version 330\n\n\t\t\t\tin vec3 color;\n\t\t\t\tout vec4 frag_color;\n\n\t\t\t\tvoid main()\n\t\t\t\t{\n\t\t\t\t\tfrag_color = vec4( color, 1.0 );\n\t\t\t\t}\n\t\t\t)SHADER\" )\n\t\t);\n\n\t\tauto bind = star.bind();\n\t\tbind.vertex_attribute( \"vertex_position\", pos, 0 );\n\t\tbind.vertex_attribute( \"vertex_color\", pos, 1 );\n\t\tbind.set_elements( tris );\n\n\t\tstar.add_triangles( tris.size() );\n\t}\n\n\t\/\/ View\/projection Matrix\n\tgl::matrix4 matrix;\n\tfloat angle = 0.F;\n\tgl::program::uniform matrix_loc = star.get_uniform_location( \"matrix\" );\n\tgl::matrix4 local = gl::matrix4::translation( 200, 200 );\n\n\t\/\/ Render function\n\twin->exposed = [&]( void )\n\t{\n\t\tgl::versor rotate( angle, 0.F, 0.F, 1.F );\n\t\tmatrix = gl::matrix4::ortho( 0, static_cast<float>( win->width() ), 0, static_cast<float>( win->height() ) );\n\n\t\togl.clear();\n\t\togl.viewport( 0, 0, win->width(), win->height() );\n\n\t\t{\n\t\t\tauto bound = star.bind();\n\t\t\tbound.set_uniform( matrix_loc, rotate * local * matrix );\n\t\t\tbound.draw();\n\t\t}\n\n\t\tangle += 1.0_deg;\n\t\twhile ( angle > 360.0_deg )\n\t\t\tangle -= 360.0_deg;\n\n\t\t\/\/ draw the text\n\t\togl.save_matrix();\n\t\togl.multiply( matrix );\n\t\tsamptext.draw( ogl );\n\t\togl.restore_matrix();\n\n\t\t\/\/ Cause a redraw to continue the animation\n\t\twin->invalidate( base::rect() );\n\t};\n\n\t\/\/ Key to take a screenshot.\n\twin->key_pressed = [&]( const std::shared_ptr<platform::keyboard> &, platform::scancode c )\n\t{\n\t\tif ( c == platform::scancode::KEY_S )\n\t\t{\n\t\t\twin->acquire();\n\t\t\tgl::png_write( \"\/tmp\/test.png\", static_cast<size_t>( win->width() ), static_cast<size_t>( win->height() ), 3 );\n\t\t\twin->release();\n\t\t}\n\t\telse if ( c == platform::scancode::KEY_Q )\n\t\t{\n\t\t\tsys->get_dispatcher()->exit( 0 );\n\t\t}\n\t};\n\n\twin->show();\n\n\tauto dispatch = sys->get_dispatcher();\n\treturn dispatch->execute();\n}\n\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nint main( int argc, char *argv[] )\n{\n\tint ret = -1;\n\ttry\n\t{\n\t\tret = safemain( argc, argv );\n\t}\n\tcatch ( std::exception &e )\n\t{\n\t\tbase::print_exception( std::cerr, e );\n\t}\n\treturn ret;\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n<commit_msg>Fixed missing blend in test.<commit_after>\/\/\n\/\/ Copyright (c) 2014-2017 Ian Godin and Kimball Thurston\n\/\/ All rights reserved.\n\/\/ Copyrights licensed under the MIT License.\n\/\/ See the accompanying LICENSE.txt file for terms\n\/\/\n\n#include <platform\/platform.h>\n#include <platform\/system.h>\n#include <platform\/dispatcher.h>\n#include <gl\/opengl.h>\n#include <gl\/api.h>\n#include <gl\/mesh.h>\n#include <gl\/png_image.h>\n#include <base\/contract.h>\n#include <base\/timer.h>\n#include <base\/math_functions.h>\n#include <draw\/path.h>\n#include <draw\/polylines.h>\n#include <draw\/text.h>\n#include <script\/font_manager.h>\n\nnamespace\n{\n\nint safemain( int \/*argc*\/, char * \/*argv*\/ [] )\n{\n\tauto sys = platform::platform::find_running();\n\n\tauto win = sys->new_window();\n\twin->resize( 400, 400 );\n\twin->set_title( \"Draw Test\" );\n\twin->acquire();\n\n\tgl::api ogl;\n\togl.setup_debugging();\n\n\tauto fm = script::font_manager::common();\n\tif ( ! fm )\n\t\tthrow std::runtime_error( \"no font manager enrolled\" );\n\n\tdraw::text samptext( fm->get_font( \"Lucida Grande\", \"Regular\", 28.0 ) );\n\tsamptext.set_text( \"Hello, world!\" );\n\tsamptext.set_position( gl::vec2( 100.F, 200.F ) );\n\tsamptext.set_color( gl::color( 1.0, 1.0, 1.0, 1.0 ) );\n\n\tgl::mesh star;\n\t{\n\t\t\/\/ Draw a star shape (with 17 points).\n\t\tdraw::path path;\n\t\tsize_t p = 17;\n\t\tsize_t q = 5;\n\t\tpath.move_to( gl::vec2::polar( 200.F, 0.F ) );\n\t\tfor ( size_t i = q % p; i != 0; i = ( i + q ) % p )\n\t\t\tpath.line_to( gl::vec2::polar( 200.F, 360.0_deg * i \/ p ) );\n\t\tpath.close();\n\n\t\t\/\/ Setup GL vertex\/element buffers.\n\t\tgl::color color;\n\t\tsize_t offset = 0;\n\t\tgl::vertex_buffer_data<gl::vec2,gl::color> pos;\n\t\tauto add_point = [&]( float x, float y )\n\t\t{\n\t\t\tpos.push_back( { x, y }, color );\n\t\t};\n\n\t\tgl::element_buffer_data tris;\n\t\tauto add_tri = [&]( size_t a, size_t b, size_t c )\n\t\t{\n\t\t\ttris.push_back( static_cast<uint32_t>( offset + a ), static_cast<uint32_t>( offset + b ), static_cast<uint32_t>( offset + c ) );\n\t\t};\n\n\t\t\/\/ Fill in the buffers\n\t\tdraw::polylines lines;\n\t\tpath.replay( lines );\n\n\t \tcolor = gl::blue;\n\t\tlines.filled( add_point, add_tri );\n\t\toffset = pos.size();\n\n\t\tcolor = gl::red;\n\t\tauto outline = lines.stroked( 2 );\n\t\toutline.filled( add_point, add_tri );\n\n\t\t\/\/ Finally setup the star mesh\n\t\tstar.get_program().set(\n\t\t\togl.new_vertex_shader( R\"SHADER(\n\t\t\t\t#version 330\n\n\t\t\t\tlayout(location = 0) in vec2 vertex_position;\n\t\t\t\tlayout(location = 1) in vec3 vertex_color;\n\n\t\t\t\tuniform mat4 matrix;\n\n\t\t\t\tout vec3 color;\n\n\t\t\t\tvoid main()\n\t\t\t\t{\n\t\t\t\t\tcolor = vertex_color;\n\t\t\t\t\tgl_Position = matrix * vec4( vertex_position, 0.0, 1.0 );\n\t\t\t\t}\n\t\t\t)SHADER\" ),\n\t\t\togl.new_fragment_shader( R\"SHADER(\n\t\t\t\t#version 330\n\n\t\t\t\tin vec3 color;\n\t\t\t\tout vec4 frag_color;\n\n\t\t\t\tvoid main()\n\t\t\t\t{\n\t\t\t\t\tfrag_color = vec4( color, 1.0 );\n\t\t\t\t}\n\t\t\t)SHADER\" )\n\t\t);\n\n\t\tauto bind = star.bind();\n\t\tbind.vertex_attribute( \"vertex_position\", pos, 0 );\n\t\tbind.vertex_attribute( \"vertex_color\", pos, 1 );\n\t\tbind.set_elements( tris );\n\n\t\tstar.add_triangles( tris.size() );\n\t}\n\n\t\/\/ View\/projection Matrix\n\tgl::matrix4 matrix;\n\tfloat angle = 0.F;\n\tgl::program::uniform matrix_loc = star.get_uniform_location( \"matrix\" );\n\tgl::matrix4 local = gl::matrix4::translation( 200, 200 );\n\n\t\/\/ Render function\n\twin->exposed = [&]( void )\n\t{\n\t\tgl::versor rotate( angle, 0.F, 0.F, 1.F );\n\t\tmatrix = gl::matrix4::ortho( 0, static_cast<float>( win->width() ), 0, static_cast<float>( win->height() ) );\n\n\t\togl.clear();\n\t\togl.viewport( 0, 0, win->width(), win->height() );\n\t\togl.enable( gl::capability::BLEND );\n\t\togl.blend_func( gl::blend_style::SRC_ALPHA, gl::blend_style::ONE_MINUS_SRC_ALPHA );\n\n\t\t{\n\t\t\tauto bound = star.bind();\n\t\t\tbound.set_uniform( matrix_loc, rotate * local * matrix );\n\t\t\tbound.draw();\n\t\t}\n\n\t\tangle += 1.0_deg;\n\t\twhile ( angle > 360.0_deg )\n\t\t\tangle -= 360.0_deg;\n\n\t\t\/\/ draw the text\n\t\togl.save_matrix();\n\t\togl.multiply( matrix );\n\t\tsamptext.draw( ogl );\n\t\togl.restore_matrix();\n\n\t\t\/\/ Cause a redraw to continue the animation\n\t\twin->invalidate( base::rect() );\n\t};\n\n\t\/\/ Key to take a screenshot.\n\twin->key_pressed = [&]( const std::shared_ptr<platform::keyboard> &, platform::scancode c )\n\t{\n\t\tif ( c == platform::scancode::KEY_S )\n\t\t{\n\t\t\twin->acquire();\n\t\t\tgl::png_write( \"\/tmp\/test.png\", static_cast<size_t>( win->width() ), static_cast<size_t>( win->height() ), 3 );\n\t\t\twin->release();\n\t\t}\n\t\telse if ( c == platform::scancode::KEY_Q )\n\t\t{\n\t\t\tsys->get_dispatcher()->exit( 0 );\n\t\t}\n\t};\n\n\twin->show();\n\n\tauto dispatch = sys->get_dispatcher();\n\treturn dispatch->execute();\n}\n\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nint main( int argc, char *argv[] )\n{\n\tint ret = -1;\n\ttry\n\t{\n\t\tret = safemain( argc, argv );\n\t}\n\tcatch ( std::exception &e )\n\t{\n\t\tbase::print_exception( std::cerr, e );\n\t}\n\treturn ret;\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n<|endoftext|>"} {"text":"<commit_before>\/\/ Copyright (c) 2019 Franka Emika GmbH\n\/\/ Use of this source code is governed by the Apache-2.0 license, see LICENSE\n\n#include <controller_manager\/controller_manager.h>\n#include <franka_hw\/franka_combined_hw.h>\n#include <ros\/ros.h>\n\n#include <franka\/control_tools.h>\n#include <sched.h>\n#include <string>\n\nint main(int argc, char** argv) {\n ros::init(argc, argv, \"franka_combined_control_node\");\n\n ros::AsyncSpinner spinner(4);\n spinner.start();\n\n ros::NodeHandle private_node_handle(\"~\");\n franka_hw::FrankaCombinedHW franka_control;\n if (!franka_control.init(private_node_handle, private_node_handle)) {\n ROS_ERROR(\"franka_combined_control_node:: Initialization of FrankaCombinedHW failed!\");\n return 1;\n }\n\n \/\/ set current thread to real-time priority\n std::string error_message;\n if (!franka::setCurrentThreadToHighestSchedulerPriority(&error_message)) {\n ROS_ERROR(\"franka_combined_control_node: Failed to set thread priority to real-time. Error: %s\",\n error_message.c_str());\n return 1;\n }\n\n controller_manager::ControllerManager cm(&franka_control, private_node_handle);\n ros::Duration period(0.001);\n ros::Rate rate(period);\n\n while (ros::ok()) {\n rate.sleep();\n ros::Time now = ros::Time::now();\n franka_control.read(now, period);\n cm.update(now, period, franka_control.controllerNeedsReset());\n if (!franka_control.hasError()) {\n franka_control.write(now, period);\n } else {\n ROS_INFO_THROTTLE(2,\n \"franka_combined_control_node: The HW is in error state.\"\n \"To recover, call the recovery action.\");\n }\n }\n\n return 0;\n}\n<commit_msg>make recovery print debug<commit_after>\/\/ Copyright (c) 2019 Franka Emika GmbH\n\/\/ Use of this source code is governed by the Apache-2.0 license, see LICENSE\n\n#include <controller_manager\/controller_manager.h>\n#include <franka_hw\/franka_combined_hw.h>\n#include <ros\/ros.h>\n\n#include <franka\/control_tools.h>\n#include <sched.h>\n#include <string>\n\nint main(int argc, char** argv) {\n ros::init(argc, argv, \"franka_combined_control_node\");\n\n ros::AsyncSpinner spinner(4);\n spinner.start();\n\n ros::NodeHandle private_node_handle(\"~\");\n franka_hw::FrankaCombinedHW franka_control;\n if (!franka_control.init(private_node_handle, private_node_handle)) {\n ROS_ERROR(\"franka_combined_control_node:: Initialization of FrankaCombinedHW failed!\");\n return 1;\n }\n\n \/\/ set current thread to real-time priority\n std::string error_message;\n if (!franka::setCurrentThreadToHighestSchedulerPriority(&error_message)) {\n ROS_ERROR(\"franka_combined_control_node: Failed to set thread priority to real-time. Error: %s\",\n error_message.c_str());\n return 1;\n }\n\n controller_manager::ControllerManager cm(&franka_control, private_node_handle);\n ros::Duration period(0.001);\n ros::Rate rate(period);\n\n while (ros::ok()) {\n rate.sleep();\n ros::Time now = ros::Time::now();\n franka_control.read(now, period);\n cm.update(now, period, franka_control.controllerNeedsReset());\n if (!franka_control.hasError()) {\n franka_control.write(now, period);\n } else {\n ROS_DEBUG_THROTTLE(5,\n \"franka_combined_control_node: The HW is in error state.\"\n \"To recover, call the recovery action.\");\n }\n }\n\n return 0;\n}\n<|endoftext|>"} {"text":"<commit_before>\/*\n * This file is part of the UnTech Editor Suite.\n * Copyright (c) 2016 - 2021, Marcus Rowe <undisbeliever@gmail.com>.\n * Distributed under The MIT License: https:\/\/opensource.org\/licenses\/MIT\n *\/\n\n#include \"style.h\"\n#include \"imgui-drawing.h\"\n#include \"models\/common\/clamp.h\"\n#include \"models\/common\/iterators.h\"\n#include \"models\/common\/stringbuilder.h\"\n#include \"vendor\/imgui\/imgui_internal.h\"\n\nnamespace UnTech::Gui {\n\nconst ImVec4 Style::tileCollisionTint(0.75f, 0, 0.75f, 0.5);\nconst ImVec4 Style::tilePropertiesButtonTint(0.5f, 0.5f, 0.5f, 1.0f);\nconst ImVec4 Style::tilePropertiesButtonSelectedTint(1.0f, 1.0f, 1.0f, 1.0f);\n\nconst ImVec4 Style::commentColorDark = { 0.25f, 1.0f, 0.25f, 1.0f };\nconst ImVec4 Style::commentColorLight = { 0.0f, 0.45f, 0.0f, 1.0f };\n\nZoom Style::metaSpriteAnimationZoom(600);\nZoom Style::metaSpriteZoom(600);\nZoom Style::spriteImporterZoom(600);\nZoom Style::backgroundImageZoom(200);\nZoom Style::metaTileTilesetZoom(300);\nZoom Style::metaTileScratchpadZoom(300);\nZoom Style::roomEditorZoom(300);\n\nZoomAspectRatio Style::aspectRatio = ZoomAspectRatio::Ntsc;\n\nconst std::array<std::pair<unsigned, const char*>, 19> zoomComboItems{ {\n { 25, \"25%\" },\n { 50, \"50%\" },\n { 75, \"75%\" },\n { 100, \"100%\" },\n { 150, \"150%\" },\n { 200, \"200%\" },\n { 300, \"300%\" },\n { 400, \"400%\" },\n { 500, \"500%\" },\n { 600, \"600%\" },\n { 700, \"700%\" },\n { 800, \"800%\" },\n { 900, \"900%\" },\n { 1000, \"1000%\" },\n { 1200, \"1200%\" },\n { 1400, \"1500%\" },\n { 1600, \"1600%\" },\n { 1800, \"1800%\" },\n { 2000, \"2000%\" },\n} };\n\nZoom::Zoom(unsigned z)\n{\n setZoom(z);\n}\n\nvoid Zoom::setZoom(unsigned z)\n{\n z = clamp<unsigned>(z, 5, 1800);\n\n _zoomInt = z;\n\n update();\n}\n\nstatic float aspectRatioScale(const ZoomAspectRatio ar)\n{\n \/\/ Values taken from bsnes-plus\n switch (ar) {\n case ZoomAspectRatio::Ntsc:\n return 54.0f \/ 47.0f;\n\n case ZoomAspectRatio::Pal:\n return 32.0f \/ 23.0f;\n\n case ZoomAspectRatio::Square:\n return 1.0f;\n }\n\n return 1.0f;\n}\n\nvoid Zoom::update()\n{\n const float scale = aspectRatioScale(Style::aspectRatio);\n\n _zoom.x = _zoomInt \/ 100.0f * scale;\n _zoom.y = _zoomInt \/ 100.0f;\n\n _zoomString = stringBuilder(_zoomInt, \"%\");\n}\n\nvoid Zoom::zoomCombo(const char* label)\n{\n ImGui::SetNextItemWidth(100);\n if (ImGui::BeginCombo(label, _zoomString.c_str())) {\n for (auto& [z, str] : zoomComboItems) {\n if (ImGui::Selectable(str, _zoomInt == z)) {\n setZoom(z);\n }\n }\n ImGui::EndCombo();\n }\n if (ImGui::IsItemHovered()) {\n ImGui::BeginTooltip();\n ImGui::TextUnformatted(\"Zoom\");\n ImGui::EndTooltip();\n }\n}\n\nvoid Zoom::processMouseWheel()\n{\n const auto& io = ImGui::GetIO();\n\n auto updateZoom = [&](unsigned z) {\n if (_zoomInt == z) {\n return;\n }\n\n const ImVec2 oldZoom = _zoom;\n setZoom(z);\n\n const ImVec2 windowSize = ImGui::GetWindowSize();\n const ImVec2 halfWindowSize(windowSize.x \/ 2, windowSize.y \/ 2);\n\n ImGui::SetScrollX((ImGui::GetScrollX() + halfWindowSize.x) * _zoom.x \/ oldZoom.x - halfWindowSize.x);\n ImGui::SetScrollY((ImGui::GetScrollY() + halfWindowSize.y) * _zoom.y \/ oldZoom.y - halfWindowSize.y);\n };\n\n if (ImGui::IsWindowHovered()) {\n if (io.KeyCtrl) {\n if (io.MouseWheel < 0.0f) {\n unsigned z = zoomComboItems.front().first;\n auto it = std::find_if(zoomComboItems.begin(), zoomComboItems.end(),\n [&](auto& z) { return z.first >= _zoomInt; });\n if (it != zoomComboItems.begin()) {\n it--;\n z = it->first;\n }\n updateZoom(z);\n }\n else if (io.MouseWheel > 0.0f) {\n unsigned z = zoomComboItems.back().first;\n for (const auto i : range(zoomComboItems.size() - 1)) {\n if (zoomComboItems.at(i).first >= zoomInt()) {\n z = zoomComboItems.at(i + 1).first;\n break;\n }\n }\n updateZoom(z);\n }\n }\n }\n}\n\nconst ImVec4& Style::commentColor()\n{\n const bool isDark = ImGui::GetStyleColorVec4(ImGuiCol_Text).x > 0.5f;\n return isDark ? commentColorDark : commentColorLight;\n}\n\nvoid Style::setAspectRatio(ZoomAspectRatio ar)\n{\n aspectRatio = ar;\n\n metaSpriteAnimationZoom.update();\n metaSpriteZoom.update();\n spriteImporterZoom.update();\n backgroundImageZoom.update();\n metaTileTilesetZoom.update();\n metaTileScratchpadZoom.update();\n roomEditorZoom.update();\n}\n\n}\n<commit_msg>Fix unable to zoom to the maximum zoom level<commit_after>\/*\n * This file is part of the UnTech Editor Suite.\n * Copyright (c) 2016 - 2021, Marcus Rowe <undisbeliever@gmail.com>.\n * Distributed under The MIT License: https:\/\/opensource.org\/licenses\/MIT\n *\/\n\n#include \"style.h\"\n#include \"models\/common\/clamp.h\"\n#include \"models\/common\/stringbuilder.h\"\n\nnamespace UnTech::Gui {\n\nconst ImVec4 Style::tileCollisionTint(0.75f, 0, 0.75f, 0.5);\nconst ImVec4 Style::tilePropertiesButtonTint(0.5f, 0.5f, 0.5f, 1.0f);\nconst ImVec4 Style::tilePropertiesButtonSelectedTint(1.0f, 1.0f, 1.0f, 1.0f);\n\nconst ImVec4 Style::commentColorDark = { 0.25f, 1.0f, 0.25f, 1.0f };\nconst ImVec4 Style::commentColorLight = { 0.0f, 0.45f, 0.0f, 1.0f };\n\nZoom Style::metaSpriteAnimationZoom(600);\nZoom Style::metaSpriteZoom(600);\nZoom Style::spriteImporterZoom(600);\nZoom Style::backgroundImageZoom(200);\nZoom Style::metaTileTilesetZoom(300);\nZoom Style::metaTileScratchpadZoom(300);\nZoom Style::roomEditorZoom(300);\n\nZoomAspectRatio Style::aspectRatio = ZoomAspectRatio::Ntsc;\n\nstatic constexpr std::array<std::pair<unsigned, const char*>, 19> zoomComboItems{ {\n { 25, \"25%\" },\n { 50, \"50%\" },\n { 75, \"75%\" },\n { 100, \"100%\" },\n { 150, \"150%\" },\n { 200, \"200%\" },\n { 300, \"300%\" },\n { 400, \"400%\" },\n { 500, \"500%\" },\n { 600, \"600%\" },\n { 700, \"700%\" },\n { 800, \"800%\" },\n { 900, \"900%\" },\n { 1000, \"1000%\" },\n { 1200, \"1200%\" },\n { 1400, \"1500%\" },\n { 1600, \"1600%\" },\n { 1800, \"1800%\" },\n { 2000, \"2000%\" },\n} };\n\nZoom::Zoom(unsigned z)\n{\n setZoom(z);\n}\n\nvoid Zoom::setZoom(unsigned z)\n{\n constexpr unsigned MIN_ZOOM = 5;\n constexpr unsigned MAX_ZOOM = 2500;\n\n static_assert(MIN_ZOOM <= zoomComboItems.front().first);\n static_assert(MAX_ZOOM >= zoomComboItems.back().first);\n\n z = clamp<unsigned>(z, MIN_ZOOM, MAX_ZOOM);\n\n _zoomInt = z;\n\n update();\n}\n\nstatic float aspectRatioScale(const ZoomAspectRatio ar)\n{\n \/\/ Values taken from bsnes-plus\n switch (ar) {\n case ZoomAspectRatio::Ntsc:\n return 54.0f \/ 47.0f;\n\n case ZoomAspectRatio::Pal:\n return 32.0f \/ 23.0f;\n\n case ZoomAspectRatio::Square:\n return 1.0f;\n }\n\n return 1.0f;\n}\n\nvoid Zoom::update()\n{\n const float scale = aspectRatioScale(Style::aspectRatio);\n\n _zoom.x = _zoomInt \/ 100.0f * scale;\n _zoom.y = _zoomInt \/ 100.0f;\n\n _zoomString = stringBuilder(_zoomInt, \"%\");\n}\n\nvoid Zoom::zoomCombo(const char* label)\n{\n ImGui::SetNextItemWidth(100);\n if (ImGui::BeginCombo(label, _zoomString.c_str())) {\n for (auto& [z, str] : zoomComboItems) {\n if (ImGui::Selectable(str, _zoomInt == z)) {\n setZoom(z);\n }\n }\n ImGui::EndCombo();\n }\n if (ImGui::IsItemHovered()) {\n ImGui::BeginTooltip();\n ImGui::TextUnformatted(\"Zoom\");\n ImGui::EndTooltip();\n }\n}\n\nvoid Zoom::processMouseWheel()\n{\n const auto& io = ImGui::GetIO();\n\n auto updateZoom = [&](unsigned z) {\n if (_zoomInt == z) {\n return;\n }\n\n const ImVec2 oldZoom = _zoom;\n setZoom(z);\n\n const ImVec2 windowSize = ImGui::GetWindowSize();\n const ImVec2 halfWindowSize(windowSize.x \/ 2, windowSize.y \/ 2);\n\n ImGui::SetScrollX((ImGui::GetScrollX() + halfWindowSize.x) * _zoom.x \/ oldZoom.x - halfWindowSize.x);\n ImGui::SetScrollY((ImGui::GetScrollY() + halfWindowSize.y) * _zoom.y \/ oldZoom.y - halfWindowSize.y);\n };\n\n if (ImGui::IsWindowHovered()) {\n if (io.KeyCtrl) {\n if (io.MouseWheel < 0.0f) {\n unsigned z = zoomComboItems.front().first;\n auto it = std::find_if(zoomComboItems.begin(), zoomComboItems.end(),\n [&](auto& z) { return z.first >= _zoomInt; });\n if (it != zoomComboItems.begin()) {\n it--;\n z = it->first;\n }\n updateZoom(z);\n }\n else if (io.MouseWheel > 0.0f) {\n unsigned z = zoomComboItems.back().first;\n auto it = std::find_if(zoomComboItems.begin(), zoomComboItems.end(),\n [&](auto& z) { return z.first > _zoomInt; });\n if (it != zoomComboItems.end()) {\n z = it->first;\n }\n updateZoom(z);\n }\n }\n }\n}\n\nconst ImVec4& Style::commentColor()\n{\n const bool isDark = ImGui::GetStyleColorVec4(ImGuiCol_Text).x > 0.5f;\n return isDark ? commentColorDark : commentColorLight;\n}\n\nvoid Style::setAspectRatio(ZoomAspectRatio ar)\n{\n aspectRatio = ar;\n\n metaSpriteAnimationZoom.update();\n metaSpriteZoom.update();\n spriteImporterZoom.update();\n backgroundImageZoom.update();\n metaTileTilesetZoom.update();\n metaTileScratchpadZoom.update();\n roomEditorZoom.update();\n}\n\n}\n<|endoftext|>"} {"text":"<commit_before>#ifndef _PNMC_MC_STATISTICS_SERIALIZE_HH_\n#define _PNMC_MC_STATISTICS_SERIALIZE_HH_\n\n#include <cereal\/archives\/json.hpp>\n#include <cereal\/types\/deque.hpp>\n\n#include \"conf\/configuration.hh\"\n#include \"mc\/classic\/statistics.hh\"\n\nnamespace pnmc { namespace mc { namespace classic {\n\n\/*------------------------------------------------------------------------------------------------*\/\n\ntemplate<class Archive>\nvoid\nsave(Archive& archive, const statistics& s)\n{\n if (s.conf.order_only)\n {\n archive(cereal::make_nvp(\"order only\", true));\n if (s.conf.order_ordering_force)\n {\n archive( cereal::make_nvp(\"FORCE time\", s.force_duration.count())\n , cereal::make_nvp(\"FORCE spans\", s.force_spans));\n }\n return;\n }\n archive( cereal::make_nvp(\"order only\", false)\n , cereal::make_nvp(\"interrupted\", s.interrupted)\n , cereal::make_nvp(\"time limit\", s.conf.max_time.count())\n , cereal::make_nvp(\"states\", s.nb_states)\n , cereal::make_nvp(\"states as string\", std::to_string(s.nb_states))\n , cereal::make_nvp(\"relation time\", s.relation_duration.count())\n , cereal::make_nvp(\"rewrite time\", s.rewrite_duration.count())\n , cereal::make_nvp(\"state space time\", s.state_space_duration.count())\n , cereal::make_nvp(\"sdd samples\", s.sdd_ut_size));\n if (s.conf.order_ordering_force)\n {\n archive( cereal::make_nvp(\"FORCE time\", s.force_duration.count())\n , cereal::make_nvp(\"FORCE spans\", s.force_spans));\n }\n if (s.conf.compute_dead_states)\n {\n archive( cereal::make_nvp(\"dead states relation time\", s.dead_states_relation_duration.count())\n , cereal::make_nvp(\"dead states rewrite time\", s.dead_states_rewrite_duration.count())\n , cereal::make_nvp(\"dead states time\", s.dead_states_duration.count()));\n }\n}\n\n\/*------------------------------------------------------------------------------------------------*\/\n\n}}} \/\/ namespace pnmc::mc::classic\n\n#endif \/\/ _PNMC_MC_STATISTICS_SERIALIZE_HH_\n<commit_msg>Fix JSPN output now that cereal behaves correctly for 64 bits types.<commit_after>#ifndef _PNMC_MC_STATISTICS_SERIALIZE_HH_\n#define _PNMC_MC_STATISTICS_SERIALIZE_HH_\n\n#include <cereal\/archives\/json.hpp>\n#include <cereal\/types\/deque.hpp>\n\n#include \"conf\/configuration.hh\"\n#include \"mc\/classic\/statistics.hh\"\n\nnamespace pnmc { namespace mc { namespace classic {\n\n\/*------------------------------------------------------------------------------------------------*\/\n\ntemplate<class Archive>\nvoid\nsave(Archive& archive, const statistics& s)\n{\n if (s.conf.order_only)\n {\n archive(cereal::make_nvp(\"order only\", true));\n if (s.conf.order_ordering_force)\n {\n archive( cereal::make_nvp(\"FORCE time\", s.force_duration.count())\n , cereal::make_nvp(\"FORCE spans\", s.force_spans));\n }\n return;\n }\n archive( cereal::make_nvp(\"order only\", false)\n , cereal::make_nvp(\"interrupted\", s.interrupted)\n , cereal::make_nvp(\"time limit\", s.conf.max_time.count())\n , cereal::make_nvp(\"states\", s.nb_states)\n , cereal::make_nvp(\"relation time\", s.relation_duration.count())\n , cereal::make_nvp(\"rewrite time\", s.rewrite_duration.count())\n , cereal::make_nvp(\"state space time\", s.state_space_duration.count())\n , cereal::make_nvp(\"sdd samples\", s.sdd_ut_size));\n if (s.conf.order_ordering_force)\n {\n archive( cereal::make_nvp(\"FORCE time\", s.force_duration.count())\n , cereal::make_nvp(\"FORCE spans\", s.force_spans));\n }\n if (s.conf.compute_dead_states)\n {\n archive( cereal::make_nvp(\"dead states relation time\", s.dead_states_relation_duration.count())\n , cereal::make_nvp(\"dead states rewrite time\", s.dead_states_rewrite_duration.count())\n , cereal::make_nvp(\"dead states time\", s.dead_states_duration.count()));\n }\n}\n\n\/*------------------------------------------------------------------------------------------------*\/\n\n}}} \/\/ namespace pnmc::mc::classic\n\n#endif \/\/ _PNMC_MC_STATISTICS_SERIALIZE_HH_\n<|endoftext|>"} {"text":"<commit_before>\/\/ Preprocessor directive for allowing us to do a post-initialization update.\n\n#if (BL_SPACEDIM==3)\n#ifndef do_problem_post_init\n#define do_problem_post_init\n#endif\n#endif\n\n\/\/ Preprocessor directive for allowing us to do a post-timestep update.\n\n#ifndef do_problem_post_timestep\n#define do_problem_post_timestep\n#endif\n\n\/\/ Routine for determining white dwarf masses, centers of mass and velocities.\n\nvoid wdCOM (Real time, Real& mass_p, Real& mass_s, Real* com_p, Real* com_s, Real* vel_p, Real* vel_s);\n\n\/\/ Volume within white dwarfs at a given density cutoff.\n\nvoid volInBoundary (Real time,\n\t\t Real& vol_p,\n\t\t Real& vol_s,\n Real rho_cutoff);\n\n\/\/ Calculate gravitational wave signal.\n\nvoid gwstrain (Real time,\n\t Real& h_plus_1, Real& h_cross_1,\n\t Real& h_plus_2, Real& h_cross_2,\n\t Real& h_plus_3, Real& h_cross_3);\n\n\/\/ Computes standard dot product of two three-vectors.\n\nReal dot_product(const Real a[], const Real b[]);\n\n\/\/ Computes standard cross-product of two three-vectors.\n\nvoid cross_product(const Real a[], const Real b[], Real c[]);\n\n\/\/ Computes norm of a three vector.\n\nReal norm(const Real a[]);\n\n\/\/ Problem post-initialization routine.\n\nvoid problem_post_init();\n\n\/\/ End of timestep analytics on the white dwarf properties.\n\nvoid problem_post_timestep();\n\n\n\n\n\/\/ Data we want to store, for interfacing with the Fortran\n\nstatic int problem;\n<commit_msg>Revert \"Remove unused C++ variable\"<commit_after>\/\/ Preprocessor directive for allowing us to do a post-initialization update.\n\n#if (BL_SPACEDIM==3)\n#ifndef do_problem_post_init\n#define do_problem_post_init\n#endif\n#endif\n\n\/\/ Preprocessor directive for allowing us to do a post-timestep update.\n\n#ifndef do_problem_post_timestep\n#define do_problem_post_timestep\n#endif\n\n\/\/ Routine for determining white dwarf masses, centers of mass and velocities.\n\nvoid wdCOM (Real time, Real& mass_p, Real& mass_s, Real* com_p, Real* com_s, Real* vel_p, Real* vel_s);\n\n\/\/ Volume within white dwarfs at a given density cutoff.\n\nvoid volInBoundary (Real time,\n\t\t Real& vol_p,\n\t\t Real& vol_s,\n Real rho_cutoff);\n\n\/\/ Calculate gravitational wave signal.\n\nvoid gwstrain (Real time,\n\t Real& h_plus_1, Real& h_cross_1,\n\t Real& h_plus_2, Real& h_cross_2,\n\t Real& h_plus_3, Real& h_cross_3);\n\n\/\/ Computes standard dot product of two three-vectors.\n\nReal dot_product(const Real a[], const Real b[]);\n\n\/\/ Computes standard cross-product of two three-vectors.\n\nvoid cross_product(const Real a[], const Real b[], Real c[]);\n\n\/\/ Computes norm of a three vector.\n\nReal norm(const Real a[]);\n\n\/\/ Problem post-initialization routine.\n\nvoid problem_post_init();\n\n\/\/ End of timestep analytics on the white dwarf properties.\n\nvoid problem_post_timestep();\n\n\n\n\n\/\/ Data we want to store, for interfacing with the Fortran\n\nstatic bool relaxation_is_done;\nstatic int problem;\n<|endoftext|>"} {"text":"<commit_before>\n#include \"porting.hpp\"\n#include \"config.hpp\"\n#include \"hamsterdb.hpp\"\n#include \"endian.hpp\"\n#include \"os.hpp\"\n#include \"misc.hpp\"\n\n\n\nstatic ham_u8_t aeskey[16]={ \n 0x00, 0x01, 0x02, 0x03, \n 0x04, 0x05, 0x06, 0x07, \n 0x08, 0x09, 0x0a, 0x0b, \n 0x0c, 0x0d, 0x0e, 0x0f\n};\n\nstatic int \nmy_compare_keys(ham_db_t *db,\n const ham_u8_t *lhs, ham_size_t lhs_length, \n const ham_u8_t *rhs, ham_size_t rhs_length)\n{\n unsigned ulhs, urhs;\n\n (void)db;\n\n memcpy(&ulhs, lhs, sizeof(ulhs));\n memcpy(&urhs, rhs, sizeof(urhs));\n ulhs=ham_db2h32(ulhs);\n urhs=ham_db2h32(urhs);\n\n if (ulhs<urhs)\n return -1;\n if (ulhs==urhs)\n return 0;\n return 1;\n}\n\nhamsterdb::~hamsterdb()\n{\n if (m_db) {\n ham_delete(m_db);\n m_db=0;\n }\n\n if (m_env) {\n ham_env_delete(m_env);\n m_env=0;\n }\n\n print_profile();\n}\n\nham_status_t \nhamsterdb::create()\n{\n ham_status_t st;\n ham_u32_t flags=0;\n ham_parameter_t params[6];\n\n if (!m_env) {\n st=ham_env_new(&m_env);\n if (st)\n return (st);\n }\n\n if (!m_db) {\n st=ham_new(&m_db);\n if (st)\n return (st);\n }\n\n params[0].name=HAM_PARAM_CACHESIZE;\n params[0].value=m_config->cachesize;\n params[1].name=HAM_PARAM_KEYSIZE;\n params[1].value=m_config->keysize;\n params[2].name=HAM_PARAM_PAGESIZE;\n params[2].value=m_config->pagesize;\n params[3].name=HAM_PARAM_DATA_ACCESS_MODE;\n params[3].value=m_config->data_access_mode;\n params[4].name=0;\n params[4].value=0;\n\n flags|=m_config->inmemory?HAM_IN_MEMORY_DB:0; \n flags|=m_config->no_mmap?HAM_DISABLE_MMAP:0; \n flags|=m_config->lock_excl?HAM_LOCK_EXCLUSIVE:0;\n flags|=m_config->duplicate?HAM_ENABLE_DUPLICATES:0;\n flags|=m_config->recovery?HAM_ENABLE_RECOVERY:0;\n flags|=m_config->cacheunlimited?HAM_CACHE_UNLIMITED:0;\n flags|=m_config->sort_dupes?HAM_SORT_DUPLICATES:0;\n flags|=m_config->enable_transactions?HAM_ENABLE_TRANSACTIONS:0;\n flags|=m_config->use_writethrough?HAM_WRITE_THROUGH:0;\n\n os::unlink(DB_PATH \"test-ham.db\");\n\n timer t(this, timer::misc);\n\n \/*\n * aes-encrypted databases are created in the environment\n *\n * !!\n * currently, all other parameters are ignored\n *\/\n if (m_config->aes_encrypt) {\n st=ham_env_create_ex(m_env, DB_PATH \"test-ham.db\", flags, 0664, 0);\n if (st)\n return (st);\n st=ham_env_enable_encryption(m_env, aeskey, 0);\n if (st)\n return (st);\n st=ham_env_create_db(m_env, m_db, 1, 0, 0);\n if (st)\n return (st);\n }\n else {\n st=ham_create_ex(m_db, DB_PATH \"test-ham.db\", flags, 0664, ¶ms[0]);\n if (st)\n return (st);\n }\n\n if (m_config->compression) {\n st=ham_enable_compression(m_db, 0, 0);\n if (st)\n return (st);\n }\n\n if (m_config->numeric) {\n st=ham_set_compare_func(m_db, my_compare_keys);\n if (st)\n return (st);\n }\n\n st=ham_cursor_create(m_db, 0, 0, &m_cursor);\n if (st)\n return (st);\n\n return (0);\n}\n\nham_status_t \nhamsterdb::open()\n{\n ham_status_t st;\n ham_u32_t flags=0;\n ham_parameter_t params[6];\n\n timer t(this, timer::misc);\n\n if (!m_env) {\n st=ham_env_new(&m_env);\n if (st)\n return (st);\n }\n\n if (!m_db) {\n st=ham_new(&m_db);\n if (st)\n return (st);\n }\n\n params[0].name=HAM_PARAM_DATA_ACCESS_MODE;\n params[0].value=m_config->data_access_mode;\n params[1].name=0;\n params[1].value=0;\n\n flags|=m_config->no_mmap?HAM_DISABLE_MMAP:0; \n flags|=m_config->lock_excl?HAM_LOCK_EXCLUSIVE:0;\n flags|=m_config->cacheunlimited?HAM_CACHE_UNLIMITED:0;\n flags|=m_config->sort_dupes?HAM_SORT_DUPLICATES:0;\n flags|=m_config->enable_transactions?HAM_ENABLE_TRANSACTIONS:0;\n flags|=m_config->use_writethrough?HAM_WRITE_THROUGH:0;\n\n \/*\n * aes encrypted databases are opened from an environment\n *\/\n if (m_config->aes_encrypt) {\n st=ham_env_open_ex(m_env, DB_PATH \"test-ham.db\", flags, 0);\n if (st)\n return (st);\n st=ham_env_enable_encryption(m_env, aeskey, 0);\n if (st)\n return (st);\n st=ham_env_open_db(m_env, m_db, 1, 0, ¶ms[0]);\n if (st)\n return (st);\n }\n else {\n st=ham_open_ex(m_db, DB_PATH \"test-ham.db\", flags, ¶ms[0]);\n if (st)\n return (st);\n }\n\n if (m_config->compression) {\n st=ham_enable_compression(m_db, 0, 0);\n if (st)\n return (st);\n }\n\n if (m_config->numeric) {\n st=ham_set_compare_func(m_db, my_compare_keys);\n if (st)\n return (st);\n if (m_config->sort_dupes) {\n st=ham_set_duplicate_compare_func(m_db, my_compare_keys);\n if (st)\n return (st);\n }\n }\n\n st=ham_cursor_create(m_db, 0, 0, &m_cursor);\n if (st)\n return (st);\n\n return (0);\n}\n\nham_status_t \nhamsterdb::close()\n{\n timer t(this, timer::misc);\n ham_status_t st=0;\n\n if (m_cursor) {\n st=ham_cursor_close(m_cursor);\n if (st)\n return (st);\n m_cursor=0;\n }\n\n if (m_txn) {\n st=ham_txn_commit(m_txn, 0);\n if (st)\n return (st);\n m_txn=0;\n }\n\n if (m_db) {\n st=ham_close(m_db, HAM_AUTO_CLEANUP);\n if (st)\n return (st);\n m_db=0;\n }\n\n if (m_env)\n st=ham_env_close(m_env, 0);\n return (st);\n}\n\nham_status_t \nhamsterdb::flush()\n{\n timer t(this, timer::misc);\n\n return (ham_flush(m_db, 0));\n}\n\nham_status_t \nhamsterdb::insert(ham_key_t *key, ham_record_t *record)\n{\n ham_u32_t flags=0;\n\n if (m_config->hints&HAM_HINT_RANDOM_ACCESS)\n flags|=HAM_HINT_RANDOM_ACCESS;\n if (m_config->hints&HAM_HINT_SEQUENTIAL)\n flags|=HAM_HINT_SEQUENTIAL;\n if (m_config->hints&HAM_HINT_UBER_FAST_ACCESS)\n flags|=HAM_HINT_UBER_FAST_ACCESS;\n\n if (m_config->use_cursors) {\n\n flags|=m_config->hints&HAM_HINT_APPEND;\n\n if (m_config->overwrite)\n flags|=HAM_OVERWRITE;\n else if (m_config->duplicate) {\n flags|=HAM_DUPLICATE;\n flags|=m_config->dupe_flags;\n }\n\n timer t(this, timer::cursor);\n return (ham_cursor_insert(m_cursor, key, record, flags));\n }\n else {\n if (m_config->overwrite)\n flags|=HAM_OVERWRITE;\n if (m_config->duplicate)\n flags|=HAM_DUPLICATE;\n\n timer t(this, timer::insert);\n return (ham_insert(m_db, m_txn, key, record, flags));\n }\n}\n\nham_status_t \nhamsterdb::erase(ham_key_t *key)\n{\n ham_status_t st;\n ham_u32_t flags=0;\n\n if (m_config->hints&HAM_HINT_RANDOM_ACCESS)\n flags|=HAM_HINT_RANDOM_ACCESS;\n if (m_config->hints&HAM_HINT_SEQUENTIAL)\n flags|=HAM_HINT_SEQUENTIAL;\n if (m_config->hints&HAM_HINT_UBER_FAST_ACCESS)\n flags|=HAM_HINT_UBER_FAST_ACCESS;\n\n if (m_config->use_cursors) {\n timer t(this, timer::cursor);\n st=ham_cursor_find(m_cursor, key, flags);\n if (st)\n return (st);\n return (ham_cursor_erase(m_cursor, flags));\n }\n else {\n timer t(this, timer::erase);\n return (ham_erase(m_db, m_txn, key, flags));\n }\n}\n\nham_status_t \nhamsterdb::find(ham_key_t *key, ham_record_t *record)\n{\n ham_status_t st;\n ham_u32_t flags=0;\n\n if (m_config->hints&HAM_HINT_RANDOM_ACCESS)\n flags|=HAM_HINT_RANDOM_ACCESS;\n if (m_config->hints&HAM_HINT_SEQUENTIAL)\n flags|=HAM_HINT_SEQUENTIAL;\n if (m_config->hints&HAM_HINT_UBER_FAST_ACCESS)\n flags|=HAM_HINT_UBER_FAST_ACCESS;\n\n if (m_config->direct_access && m_config->inmemory)\n flags|=HAM_DIRECT_ACCESS;\n\n if (m_config->use_cursors) {\n timer t(this, timer::cursor);\n st=ham_cursor_find(m_cursor, key, flags);\n if (st)\n return (st);\n return (ham_cursor_move(m_cursor, 0, record, flags));\n }\n else {\n timer t(this, timer::find);\n return (ham_find(m_db, m_txn, key, record, flags));\n }\n}\n\nham_status_t \nhamsterdb::txn_begin(void)\n{\n assert(m_txn==0);\n\n return (ham_txn_begin(&m_txn, m_db, 0));\n}\n\nham_status_t \nhamsterdb::txn_commit(void)\n{\n assert(m_txn!=0);\n\n ham_status_t st=ham_txn_commit(m_txn, 0);\n if (st)\n return (st);\n m_txn=0;\n return (0);\n}\n\nconst char *\nhamsterdb::get_name(void)\n{\n return (\"hamsterdb\");\n}\n\n\nham_status_t \nhamsterdb::check_integrity(void)\n{\n\treturn ham_check_integrity(m_db, 0);\n}\n\nvoid *\nhamsterdb::create_cursor(void)\n{\n ham_cursor_t *cursor;\n\n ham_status_t st=ham_cursor_create(m_db, m_txn, 0, &cursor);\n if (st) {\n TRACE((\"failed to create cursor: %d\\n\", st));\n exit(-1);\n }\n\n return ((void *)cursor);\n}\n\nham_status_t \nhamsterdb::get_previous(void *cursor, ham_key_t *key, \n ham_record_t *record, int flags)\n{\n timer t(this, timer::cursor);\n\n if (m_config->direct_access && m_config->inmemory)\n flags|=HAM_DIRECT_ACCESS;\n\n return (ham_cursor_move((ham_cursor_t *)cursor, key, record, \n HAM_CURSOR_PREVIOUS|flags));\n}\n\nham_status_t\nhamsterdb::get_next(void *cursor, ham_key_t *key, ham_record_t *record, \n int flags)\n{\n timer t(this, timer::cursor);\n\n if (m_config->direct_access && m_config->inmemory)\n flags|=HAM_DIRECT_ACCESS;\n\n return (ham_cursor_move((ham_cursor_t *)cursor, key, record, \n HAM_CURSOR_NEXT|flags));\n}\n\nvoid \nhamsterdb::close_cursor(void *cursor)\n{\n ham_status_t st=ham_cursor_close((ham_cursor_t *)cursor);\n if (st) {\n TRACE((\"failed to close cursor: %d\\n\", st));\n exit(-1);\n }\n}\n<commit_msg>now using the transaction handle when verifying the integrity<commit_after>\n#include \"porting.hpp\"\n#include \"config.hpp\"\n#include \"hamsterdb.hpp\"\n#include \"endian.hpp\"\n#include \"os.hpp\"\n#include \"misc.hpp\"\n\n\n\nstatic ham_u8_t aeskey[16]={ \n 0x00, 0x01, 0x02, 0x03, \n 0x04, 0x05, 0x06, 0x07, \n 0x08, 0x09, 0x0a, 0x0b, \n 0x0c, 0x0d, 0x0e, 0x0f\n};\n\nstatic int \nmy_compare_keys(ham_db_t *db,\n const ham_u8_t *lhs, ham_size_t lhs_length, \n const ham_u8_t *rhs, ham_size_t rhs_length)\n{\n unsigned ulhs, urhs;\n\n (void)db;\n\n memcpy(&ulhs, lhs, sizeof(ulhs));\n memcpy(&urhs, rhs, sizeof(urhs));\n ulhs=ham_db2h32(ulhs);\n urhs=ham_db2h32(urhs);\n\n if (ulhs<urhs)\n return -1;\n if (ulhs==urhs)\n return 0;\n return 1;\n}\n\nhamsterdb::~hamsterdb()\n{\n if (m_db) {\n ham_delete(m_db);\n m_db=0;\n }\n\n if (m_env) {\n ham_env_delete(m_env);\n m_env=0;\n }\n\n print_profile();\n}\n\nham_status_t \nhamsterdb::create()\n{\n ham_status_t st;\n ham_u32_t flags=0;\n ham_parameter_t params[6];\n\n if (!m_env) {\n st=ham_env_new(&m_env);\n if (st)\n return (st);\n }\n\n if (!m_db) {\n st=ham_new(&m_db);\n if (st)\n return (st);\n }\n\n params[0].name=HAM_PARAM_CACHESIZE;\n params[0].value=m_config->cachesize;\n params[1].name=HAM_PARAM_KEYSIZE;\n params[1].value=m_config->keysize;\n params[2].name=HAM_PARAM_PAGESIZE;\n params[2].value=m_config->pagesize;\n params[3].name=HAM_PARAM_DATA_ACCESS_MODE;\n params[3].value=m_config->data_access_mode;\n params[4].name=0;\n params[4].value=0;\n\n flags|=m_config->inmemory?HAM_IN_MEMORY_DB:0; \n flags|=m_config->no_mmap?HAM_DISABLE_MMAP:0; \n flags|=m_config->lock_excl?HAM_LOCK_EXCLUSIVE:0;\n flags|=m_config->duplicate?HAM_ENABLE_DUPLICATES:0;\n flags|=m_config->recovery?HAM_ENABLE_RECOVERY:0;\n flags|=m_config->cacheunlimited?HAM_CACHE_UNLIMITED:0;\n flags|=m_config->sort_dupes?HAM_SORT_DUPLICATES:0;\n flags|=m_config->enable_transactions?HAM_ENABLE_TRANSACTIONS:0;\n flags|=m_config->use_writethrough?HAM_WRITE_THROUGH:0;\n\n os::unlink(DB_PATH \"test-ham.db\");\n\n timer t(this, timer::misc);\n\n \/*\n * aes-encrypted databases are created in the environment\n *\n * !!\n * currently, all other parameters are ignored\n *\/\n if (m_config->aes_encrypt) {\n st=ham_env_create_ex(m_env, DB_PATH \"test-ham.db\", flags, 0664, 0);\n if (st)\n return (st);\n st=ham_env_enable_encryption(m_env, aeskey, 0);\n if (st)\n return (st);\n st=ham_env_create_db(m_env, m_db, 1, 0, 0);\n if (st)\n return (st);\n }\n else {\n st=ham_create_ex(m_db, DB_PATH \"test-ham.db\", flags, 0664, ¶ms[0]);\n if (st)\n return (st);\n }\n\n if (m_config->compression) {\n st=ham_enable_compression(m_db, 0, 0);\n if (st)\n return (st);\n }\n\n if (m_config->numeric) {\n st=ham_set_compare_func(m_db, my_compare_keys);\n if (st)\n return (st);\n }\n\n st=ham_cursor_create(m_db, 0, 0, &m_cursor);\n if (st)\n return (st);\n\n return (0);\n}\n\nham_status_t \nhamsterdb::open()\n{\n ham_status_t st;\n ham_u32_t flags=0;\n ham_parameter_t params[6];\n\n timer t(this, timer::misc);\n\n if (!m_env) {\n st=ham_env_new(&m_env);\n if (st)\n return (st);\n }\n\n if (!m_db) {\n st=ham_new(&m_db);\n if (st)\n return (st);\n }\n\n params[0].name=HAM_PARAM_DATA_ACCESS_MODE;\n params[0].value=m_config->data_access_mode;\n params[1].name=0;\n params[1].value=0;\n\n flags|=m_config->no_mmap?HAM_DISABLE_MMAP:0; \n flags|=m_config->lock_excl?HAM_LOCK_EXCLUSIVE:0;\n flags|=m_config->cacheunlimited?HAM_CACHE_UNLIMITED:0;\n flags|=m_config->sort_dupes?HAM_SORT_DUPLICATES:0;\n flags|=m_config->enable_transactions?HAM_ENABLE_TRANSACTIONS:0;\n flags|=m_config->use_writethrough?HAM_WRITE_THROUGH:0;\n\n \/*\n * aes encrypted databases are opened from an environment\n *\/\n if (m_config->aes_encrypt) {\n st=ham_env_open_ex(m_env, DB_PATH \"test-ham.db\", flags, 0);\n if (st)\n return (st);\n st=ham_env_enable_encryption(m_env, aeskey, 0);\n if (st)\n return (st);\n st=ham_env_open_db(m_env, m_db, 1, 0, ¶ms[0]);\n if (st)\n return (st);\n }\n else {\n st=ham_open_ex(m_db, DB_PATH \"test-ham.db\", flags, ¶ms[0]);\n if (st)\n return (st);\n }\n\n if (m_config->compression) {\n st=ham_enable_compression(m_db, 0, 0);\n if (st)\n return (st);\n }\n\n if (m_config->numeric) {\n st=ham_set_compare_func(m_db, my_compare_keys);\n if (st)\n return (st);\n if (m_config->sort_dupes) {\n st=ham_set_duplicate_compare_func(m_db, my_compare_keys);\n if (st)\n return (st);\n }\n }\n\n st=ham_cursor_create(m_db, 0, 0, &m_cursor);\n if (st)\n return (st);\n\n return (0);\n}\n\nham_status_t \nhamsterdb::close()\n{\n timer t(this, timer::misc);\n ham_status_t st=0;\n\n if (m_cursor) {\n st=ham_cursor_close(m_cursor);\n if (st)\n return (st);\n m_cursor=0;\n }\n\n if (m_txn) {\n st=ham_txn_commit(m_txn, 0);\n if (st)\n return (st);\n m_txn=0;\n }\n\n if (m_db) {\n st=ham_close(m_db, HAM_AUTO_CLEANUP);\n if (st)\n return (st);\n m_db=0;\n }\n\n if (m_env)\n st=ham_env_close(m_env, 0);\n return (st);\n}\n\nham_status_t \nhamsterdb::flush()\n{\n timer t(this, timer::misc);\n\n return (ham_flush(m_db, 0));\n}\n\nham_status_t \nhamsterdb::insert(ham_key_t *key, ham_record_t *record)\n{\n ham_u32_t flags=0;\n\n if (m_config->hints&HAM_HINT_RANDOM_ACCESS)\n flags|=HAM_HINT_RANDOM_ACCESS;\n if (m_config->hints&HAM_HINT_SEQUENTIAL)\n flags|=HAM_HINT_SEQUENTIAL;\n if (m_config->hints&HAM_HINT_UBER_FAST_ACCESS)\n flags|=HAM_HINT_UBER_FAST_ACCESS;\n\n if (m_config->use_cursors) {\n\n flags|=m_config->hints&HAM_HINT_APPEND;\n\n if (m_config->overwrite)\n flags|=HAM_OVERWRITE;\n else if (m_config->duplicate) {\n flags|=HAM_DUPLICATE;\n flags|=m_config->dupe_flags;\n }\n\n timer t(this, timer::cursor);\n return (ham_cursor_insert(m_cursor, key, record, flags));\n }\n else {\n if (m_config->overwrite)\n flags|=HAM_OVERWRITE;\n if (m_config->duplicate)\n flags|=HAM_DUPLICATE;\n\n timer t(this, timer::insert);\n return (ham_insert(m_db, m_txn, key, record, flags));\n }\n}\n\nham_status_t \nhamsterdb::erase(ham_key_t *key)\n{\n ham_status_t st;\n ham_u32_t flags=0;\n\n if (m_config->hints&HAM_HINT_RANDOM_ACCESS)\n flags|=HAM_HINT_RANDOM_ACCESS;\n if (m_config->hints&HAM_HINT_SEQUENTIAL)\n flags|=HAM_HINT_SEQUENTIAL;\n if (m_config->hints&HAM_HINT_UBER_FAST_ACCESS)\n flags|=HAM_HINT_UBER_FAST_ACCESS;\n\n if (m_config->use_cursors) {\n timer t(this, timer::cursor);\n st=ham_cursor_find(m_cursor, key, flags);\n if (st)\n return (st);\n return (ham_cursor_erase(m_cursor, flags));\n }\n else {\n timer t(this, timer::erase);\n return (ham_erase(m_db, m_txn, key, flags));\n }\n}\n\nham_status_t \nhamsterdb::find(ham_key_t *key, ham_record_t *record)\n{\n ham_status_t st;\n ham_u32_t flags=0;\n\n if (m_config->hints&HAM_HINT_RANDOM_ACCESS)\n flags|=HAM_HINT_RANDOM_ACCESS;\n if (m_config->hints&HAM_HINT_SEQUENTIAL)\n flags|=HAM_HINT_SEQUENTIAL;\n if (m_config->hints&HAM_HINT_UBER_FAST_ACCESS)\n flags|=HAM_HINT_UBER_FAST_ACCESS;\n\n if (m_config->direct_access && m_config->inmemory)\n flags|=HAM_DIRECT_ACCESS;\n\n if (m_config->use_cursors) {\n timer t(this, timer::cursor);\n st=ham_cursor_find(m_cursor, key, flags);\n if (st)\n return (st);\n return (ham_cursor_move(m_cursor, 0, record, flags));\n }\n else {\n timer t(this, timer::find);\n return (ham_find(m_db, m_txn, key, record, flags));\n }\n}\n\nham_status_t \nhamsterdb::txn_begin(void)\n{\n assert(m_txn==0);\n\n return (ham_txn_begin(&m_txn, m_db, 0));\n}\n\nham_status_t \nhamsterdb::txn_commit(void)\n{\n assert(m_txn!=0);\n\n ham_status_t st=ham_txn_commit(m_txn, 0);\n if (st)\n return (st);\n m_txn=0;\n return (0);\n}\n\nconst char *\nhamsterdb::get_name(void)\n{\n return (\"hamsterdb\");\n}\n\n\nham_status_t \nhamsterdb::check_integrity(void)\n{\n\treturn ham_check_integrity(m_db, m_txn);\n}\n\nvoid *\nhamsterdb::create_cursor(void)\n{\n ham_cursor_t *cursor;\n\n ham_status_t st=ham_cursor_create(m_db, m_txn, 0, &cursor);\n if (st) {\n TRACE((\"failed to create cursor: %d\\n\", st));\n exit(-1);\n }\n\n return ((void *)cursor);\n}\n\nham_status_t \nhamsterdb::get_previous(void *cursor, ham_key_t *key, \n ham_record_t *record, int flags)\n{\n timer t(this, timer::cursor);\n\n if (m_config->direct_access && m_config->inmemory)\n flags|=HAM_DIRECT_ACCESS;\n\n return (ham_cursor_move((ham_cursor_t *)cursor, key, record, \n HAM_CURSOR_PREVIOUS|flags));\n}\n\nham_status_t\nhamsterdb::get_next(void *cursor, ham_key_t *key, ham_record_t *record, \n int flags)\n{\n timer t(this, timer::cursor);\n\n if (m_config->direct_access && m_config->inmemory)\n flags|=HAM_DIRECT_ACCESS;\n\n return (ham_cursor_move((ham_cursor_t *)cursor, key, record, \n HAM_CURSOR_NEXT|flags));\n}\n\nvoid \nhamsterdb::close_cursor(void *cursor)\n{\n ham_status_t st=ham_cursor_close((ham_cursor_t *)cursor);\n if (st) {\n TRACE((\"failed to close cursor: %d\\n\", st));\n exit(-1);\n }\n}\n<|endoftext|>"} {"text":"<commit_before>#include \"PortalGame.h\"\n#include \"PhysicsController.h\"\n#include \"Sphere.h\"\n#include \"PhysicsCamera.h\"\n#include \"Box.h\"\n#include \"Cylinder.h\"\n#include \"Steerable3DController.h\"\n#include \"Ground.h\"\n#include \"Content.h\"\n#include <btBulletDynamicsCommon.h>\n#include <gtc\/quaternion.hpp>\n#include <gtx\/quaternion.hpp>\n#include <gtx\/euler_angles.hpp>\n#include <gtx\/norm.hpp>\n#include \"VectorDrawer.h\"\n\nusing namespace BGE;\n\n\nPortalGame::PortalGame(void)\n{\n\tphysicsFactory = NULL;\n\tdynamicsWorld = NULL;\n\tbroadphase = NULL;\n\tdispatcher = NULL;\n\tsolver = NULL;\n\tfullscreen = false;\n}\n\n\nPortalGame::~PortalGame(void)\n{\n}\n\n\nstd::shared_ptr<GameComponent> station;\n\/\/float theta = 0.0f;\n\nbool PortalGame::Initialise() \n{\n\triftEnabled = false;\n\t\/\/ Set up the collision configuration and dispatcher\n collisionConfiguration = new btDefaultCollisionConfiguration();\n dispatcher = new btCollisionDispatcher(collisionConfiguration);\n \n \/\/ The world.\n\tbtVector3 worldMin(-1000,-1000,-1000);\n\tbtVector3 worldMax(1000,1000,1000);\n\tbroadphase = new btAxisSweep3(worldMin,worldMax);\n\tsolver = new btSequentialImpulseConstraintSolver();\n\tdynamicsWorld = new btDiscreteDynamicsWorld(dispatcher,broadphase,solver,collisionConfiguration);\n dynamicsWorld->setGravity(btVector3(0,-9,0));\n\n\twidth = 800;\n\theight = 600;\n\n\tphysicsFactory = make_shared<PhysicsFactory>(dynamicsWorld);\n\n\tphysicsFactory->CreateGroundPhysics();\n\tphysicsFactory->CreateCameraPhysics();\n\n\t\/\/std::shared_ptr<GameComponent> box = make_shared<Box>(1, 1, 1);\n\t\/\/box->position = glm::vec3(0, 5, -20);\n\t\/\/Attach(box);\n\n\t\/\/non kinematic cyl\n\tshared_ptr<PhysicsController> colCyl = physicsFactory->CreateCylinder(2,1, glm::vec3(5, 0, -10), glm::quat()); \n\n\tcolCyl->tag=\"colObject1\";\n\n\t\/\/box for collision\n\tshared_ptr<PhysicsController> colBox = physicsFactory->CreateBox(1,1,1, glm::vec3(5, 0, 0), glm::quat()); \n\tcolBox->tag=\"colObject2\"; \n\n\t\/\/create walls for games\n\t\/\/left wall for box 1\n\tshared_ptr<PhysicsController> leftWall1 = physicsFactory->CreateBox(0.5,10,15, glm::vec3(-10, 0, -20), glm::quat()); \n\tleftWall1->diffuse = glm::vec3(1,0,1);\n\t\/\/leftWall1\n\n\t\/\/right wall for box 1\n\tshared_ptr<PhysicsController> rightWall1 = physicsFactory->CreateBox(0.5,10,15, glm::vec3(-2, 0, -20), glm::quat()); \n\trightWall1->diffuse = glm::vec3(1,0,1);\t\n\n\t\/\/top wall for box 1\n\tshared_ptr<PhysicsController> topWall1 = physicsFactory->CreateBox(15,0.5,15, glm::vec3(-4, 0, -20), glm::quat()); \n\ttopWall1->diffuse = glm::vec3(1,0,1);\t\n\n\n\n\n\n\t\/\/physicsFactory->CreateWall(glm::vec3(-20,0,20), 50, 10);\n\n\t \/\/Now some constraints\n\t\/*shared_ptr<PhysicsController> box1 = physicsFactory->CreateBox(1,1,4, glm::vec3(5, 5, 0), glm::quat()); \n\tshared_ptr<PhysicsController> box2 = physicsFactory->CreateBox(1,1,4, glm::vec3(5, 5, 5), glm::quat()); *\/\n\t\/\/shared_ptr<PhysicsController> cap1 = physicsFactory->CreateCapsule(1,1, glm::vec3(5, 50, 5), glm::quat()); \n\t\/\/cap1->scale = glm::vec3(0.001,0.001,0.001);\n\n\t \/\/A hinge\n\t\/\/btHingeConstraint * hinge = new btHingeConstraint(*box1->rigidBody, *box2->rigidBody, btVector3(0,0,2.5f),btVector3(0,0,-2.5f), btVector3(0,1,0), btVector3(0,1,0), true);\n\t\/\/dynamicsWorld->addConstraint(hinge);\n\n\t\/\/box1 = physicsFactory->CreateBox(1,1,4, glm::vec3(10, 5, 0), glm::quat()); \n\t\/\/box2 = physicsFactory->CreateBox(1,1,4, glm::vec3(10, 5, 5), glm::quat());\n\t\/\/cap1 = physicsFactory->CreateCapsule(5,5, glm::vec3(5, 5, 5), glm::quat());\n\n\n\n\n\n\n\t\/\/physicsFactory->CreateCylinder(10, 3, glm::vec3(0, 20, 0), glm::quat());\n\n\t\/\/\/*std::shared_ptr<GameComponent> ship = make_shared<GameComponent>();\n\t\/\/ship->ambient = glm::vec3(0.2f, 0.2, 0.2f);\n\t\/\/ship->specular = glm::vec3(1.2f, 1.2f, 1.2f);\n\t\/\/std::shared_ptr<Model> model = Content::LoadModel(\"cobramk3\", glm::rotate(glm::mat4(1), 180.0f, GameComponent::basisUp));\t\n\t\/\/std::shared_ptr<GameComponent> steerable = make_shared<Steerable3DController>(model);\n\t\/\/steerable->position = glm::vec3(20, 5, -20);\n\t\/\/std::shared_ptr<VectorDrawer> vectorDrawer = make_shared<VectorDrawer>();\n\t\/\/vectorDrawer->scale = glm::vec3(5,5,10);\n\t\/\/ship->Attach(steerable);\n\t\/\/ship->Attach(model);\n\t\/\/ship->Attach(vectorDrawer);\n\t\/\/Attach(ship);*\/\n\n\t\/\/\/\/ Create a hierarchy\n\t\/\/station = make_shared<GameComponent>();\n\t\/\/station->worldMode = world_modes::from_self;\n\t\/\/station->ambient = glm::vec3(0.2f, 0.2, 0.2f);\n\t\/\/station->specular = glm::vec3(0,0,0);\n\t\/\/station->scale = glm::vec3(2,2,2);\n\t\/\/std::shared_ptr<Model> cmodel = Content::LoadModel(\"coriolis\", glm::rotate(glm::mat4(1), 90.0f, GameComponent::basisUp));\t\n\t\/\/station->Attach(cmodel);\n\t\/\/station->Attach(make_shared<VectorDrawer>(glm::vec3(7,7,7)));\n\t\/\/station->position = glm::vec3(40, 5, -20);\n\t\/\/Attach(station);\n\n\t\/\/\/\/ Add a child to the station and update by including the parent's world transform\n\t\/\/std::shared_ptr<GameComponent> ship1 = make_shared<GameComponent>();\n\t\/\/ship1->worldMode = world_modes::from_self_with_parent;\n\t\/\/ship1->ambient = glm::vec3(0.2f, 0.2, 0.2f);\n\t\/\/ship1->specular = glm::vec3(1.2f, 1.2f, 1.2f);\n\t\/\/std::shared_ptr<Model> ana = Content::LoadModel(\"anaconda\", glm::rotate(glm::mat4(1), 180.0f, GameComponent::basisUp));\t\n\t\/\/ship1->Attach(ana);\n\t\/\/ship1->position = glm::vec3(0, 0, -10);\n\t\/\/station->Attach(ship1);\n\n\t\n\t\/\/physicsFactory->CreateVehicle(glm::vec3(0,10,-30));\n\n\t\/\/ Create Inca Pyramid\n\t\/\/position(), baseWidth, blockHeight, blockWidth, blockDepth\n \/\/physicsFactory->CreateIncaPyramid(glm::vec3(20,0,-20), 6, 1.5, 1.5, 1.5);\n\n\t\/\/Create Rag Doll\n\t\/\/physicsFactory->CreateRagDoll(glm::vec3(25,0,-50));\n\n\n\tif (!Game::Initialise()) {\n\t\treturn false;\n\t}\n\n\tcamera->GetController()->position = glm::vec3(0,10, 0);\n\n\n\treturn true;\n}\n\n\nvoid BGE::PortalGame::Update(float timeDelta)\n{\n\tdynamicsWorld->stepSimulation(timeDelta,100);\n\t\/\/station->Yaw(timeDelta * 20.0f);\n\n\t\/\/collision detection check\n\t int numManifolds = dynamicsWorld->getDispatcher()->getNumManifolds();\n for (int i=0;i<numManifolds;i++)\n {\n btPersistentManifold* contactManifold = dynamicsWorld->getDispatcher()->getManifoldByIndexInternal(i);\n btCollisionObject* obA = (btCollisionObject*)(contactManifold->getBody0());\n\t\t\t\tbtCollisionObject* obB = (btCollisionObject*)(contactManifold->getBody1());\n\t\t\t\t\/\/ btCollisionObject* obA = (btCollisionObject*)(contactManifold->colCyl = physicsFactory->CreateCylinder(2,1, glm::vec3(5, 0, -10), glm::quat()); );\n\t\t\t\t\/\/btCollisionObject* obB = (btCollisionObject*)(contactManifold->colBox = physicsFactory->CreateBox(1,1,1, glm::vec3(5, 0, 0), glm::quat()); );\n PhysicsController * pcA = reinterpret_cast<PhysicsController*>(obA->getUserPointer());\n PhysicsController * pcB = reinterpret_cast<PhysicsController*>(obB->getUserPointer());\n\n int numContacts = contactManifold->getNumContacts();\n if (numContacts > 0)\n {\n if ((pcA != nullptr) && (pcB != nullptr))\n {\n\t\t\t\t\t\t\t\/\/PrintText(\"Collision between \" + pcA->tag + \" and \" + pcB->tag);\n\t\t\t\t\t\t\tif (pcA->tag == \"colObject1\" && pcB->tag == \"colObject2\")\n {\n\t\t\t\t\t\t\t\t PrintText(\"Collision between \" + pcA->tag + \" and \" + pcB->tag);\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\/*if (pcB->tag == \"colObject1\" && pcA->tag == \"colObject2\")\n {\n\t\t\t\t\t\t\t\t PrintText(\"Collision between \" + pcA->tag + \" and \" + pcB->tag);\n\t\t\t\t\t\t\t}*\/\n }\n }\n }\n\n\tGame::Update(timeDelta);\n\n\n}\n\nvoid BGE::PortalGame::Cleanup()\n{\n\tGame::Cleanup();\n}\n<commit_msg>Added Boxes and Stands<commit_after>#include \"PortalGame.h\"\n#include \"PhysicsController.h\"\n#include \"Sphere.h\"\n#include \"PhysicsCamera.h\"\n#include \"Box.h\"\n#include \"Cylinder.h\"\n#include \"Steerable3DController.h\"\n#include \"Ground.h\"\n#include \"Content.h\"\n#include <btBulletDynamicsCommon.h>\n#include <gtc\/quaternion.hpp>\n#include <gtx\/quaternion.hpp>\n#include <gtx\/euler_angles.hpp>\n#include <gtx\/norm.hpp>\n#include \"VectorDrawer.h\"\n\nusing namespace BGE;\n\n\nPortalGame::PortalGame(void)\n{\n\tphysicsFactory = NULL;\n\tdynamicsWorld = NULL;\n\tbroadphase = NULL;\n\tdispatcher = NULL;\n\tsolver = NULL;\n\tfullscreen = false;\n}\n\n\nPortalGame::~PortalGame(void)\n{\n}\n\n\nstd::shared_ptr<GameComponent> station;\n\/\/float theta = 0.0f;\n\nbool PortalGame::Initialise() \n{\n\triftEnabled = false;\n\t\/\/ Set up the collision configuration and dispatcher\n collisionConfiguration = new btDefaultCollisionConfiguration();\n dispatcher = new btCollisionDispatcher(collisionConfiguration);\n \n \/\/ The world.\n\tbtVector3 worldMin(-1000,-1000,-1000);\n\tbtVector3 worldMax(1000,1000,1000);\n\tbroadphase = new btAxisSweep3(worldMin,worldMax);\n\tsolver = new btSequentialImpulseConstraintSolver();\n\tdynamicsWorld = new btDiscreteDynamicsWorld(dispatcher,broadphase,solver,collisionConfiguration);\n dynamicsWorld->setGravity(btVector3(0,-9,0));\n\n\twidth = 800;\n\theight = 600;\n\n\tphysicsFactory = make_shared<PhysicsFactory>(dynamicsWorld);\n\n\tphysicsFactory->CreateGroundPhysics();\n\tphysicsFactory->CreateCameraPhysics();\n\n\t\/\/std::shared_ptr<GameComponent> box = make_shared<Box>(1, 1, 1);\n\t\/\/box->position = glm::vec3(0, 5, -20);\n\t\/\/Attach(box);\n\n\t\/\/non kinematic cyl\n\tshared_ptr<PhysicsController> colCyl = physicsFactory->CreateCylinder(2,1, glm::vec3(5, 0, -10), glm::quat()); \n\n\tcolCyl->tag=\"colObject1\";\n<<<<<<< HEAD\n\n\t\/\/box for collision\n\tshared_ptr<PhysicsController> colBox = physicsFactory->CreateBox(1,1,1, glm::vec3(5, 0, 0), glm::quat()); \n\tcolBox->tag=\"colObject2\"; \n\n\t\/\/create walls for games\n\t\/\/left wall for box 1\n\tshared_ptr<PhysicsController> leftWall1 = physicsFactory->CreateBox(0.5,10,15, glm::vec3(-10, 0, -20), glm::quat()); \n\tleftWall1->diffuse = glm::vec3(1,0,1);\n\t\/\/leftWall1\n\n\t\/\/right wall for box 1\n\tshared_ptr<PhysicsController> rightWall1 = physicsFactory->CreateBox(0.5,10,15, glm::vec3(-2, 0, -20), glm::quat()); \n\trightWall1->diffuse = glm::vec3(1,0,1);\t\n\n\t\/\/top wall for box 1\n\tshared_ptr<PhysicsController> topWall1 = physicsFactory->CreateBox(15,0.5,15, glm::vec3(-4, 0, -20), glm::quat()); \n\ttopWall1->diffuse = glm::vec3(1,0,1);\t\n\n\n\n\n=======\n\n\t\/\/box for collision\n\tshared_ptr<PhysicsController> colBox = physicsFactory->CreateBox(1,1,1, glm::vec3(5, 0, 0), glm::quat()); \n\tcolBox->tag=\"colObject2\"; \n>>>>>>> parent of 8bc7c50... Added in Stands and Boxes to hit\n\n\t\/\/create walls for games\n\t\/\/left wall for box 1\n\tshared_ptr<PhysicsController> leftWall1 = physicsFactory->CreateBox(0.5,10,15, glm::vec3(-10, 0, -20), glm::quat()); \n\tleftWall1->diffuse = glm::vec3(1,0,1);\n\t\/\/leftWall1\n\n\t\/\/right wall for box 1\n\tshared_ptr<PhysicsController> rightWall1 = physicsFactory->CreateBox(0.5,10,15, glm::vec3(-2, 0, -20), glm::quat()); \n\trightWall1->diffuse = glm::vec3(1,0,1);\t\n\n\t\/\/top wall for box 1\n\tshared_ptr<PhysicsController> topWall1 = physicsFactory->CreateBox(15,0.5,15, glm::vec3(-4, 0, -20), glm::quat()); \n\ttopWall1->diffuse = glm::vec3(1,0,1);\t\n\n\n\n\n\n\t\/\/physicsFactory->CreateWall(glm::vec3(-20,0,20), 50, 10);\n\n\t \/\/Now some constraints\n\t\/*shared_ptr<PhysicsController> box1 = physicsFactory->CreateBox(1,1,4, glm::vec3(5, 5, 0), glm::quat()); \n\tshared_ptr<PhysicsController> box2 = physicsFactory->CreateBox(1,1,4, glm::vec3(5, 5, 5), glm::quat()); *\/\n\t\/\/shared_ptr<PhysicsController> cap1 = physicsFactory->CreateCapsule(1,1, glm::vec3(5, 50, 5), glm::quat()); \n\t\/\/cap1->scale = glm::vec3(0.001,0.001,0.001);\n\n\t \/\/A hinge\n\t\/\/btHingeConstraint * hinge = new btHingeConstraint(*box1->rigidBody, *box2->rigidBody, btVector3(0,0,2.5f),btVector3(0,0,-2.5f), btVector3(0,1,0), btVector3(0,1,0), true);\n\t\/\/dynamicsWorld->addConstraint(hinge);\n\n\t\/\/box1 = physicsFactory->CreateBox(1,1,4, glm::vec3(10, 5, 0), glm::quat()); \n\t\/\/box2 = physicsFactory->CreateBox(1,1,4, glm::vec3(10, 5, 5), glm::quat());\n\t\/\/cap1 = physicsFactory->CreateCapsule(5,5, glm::vec3(5, 5, 5), glm::quat());\n\n\n\n\n\n\n\t\/\/physicsFactory->CreateCylinder(10, 3, glm::vec3(0, 20, 0), glm::quat());\n\n\t\/\/\/*std::shared_ptr<GameComponent> ship = make_shared<GameComponent>();\n\t\/\/ship->ambient = glm::vec3(0.2f, 0.2, 0.2f);\n\t\/\/ship->specular = glm::vec3(1.2f, 1.2f, 1.2f);\n\t\/\/std::shared_ptr<Model> model = Content::LoadModel(\"cobramk3\", glm::rotate(glm::mat4(1), 180.0f, GameComponent::basisUp));\t\n\t\/\/std::shared_ptr<GameComponent> steerable = make_shared<Steerable3DController>(model);\n\t\/\/steerable->position = glm::vec3(20, 5, -20);\n\t\/\/std::shared_ptr<VectorDrawer> vectorDrawer = make_shared<VectorDrawer>();\n\t\/\/vectorDrawer->scale = glm::vec3(5,5,10);\n\t\/\/ship->Attach(steerable);\n\t\/\/ship->Attach(model);\n\t\/\/ship->Attach(vectorDrawer);\n\t\/\/Attach(ship);*\/\n\n\t\/\/\/\/ Create a hierarchy\n\t\/\/station = make_shared<GameComponent>();\n\t\/\/station->worldMode = world_modes::from_self;\n\t\/\/station->ambient = glm::vec3(0.2f, 0.2, 0.2f);\n\t\/\/station->specular = glm::vec3(0,0,0);\n\t\/\/station->scale = glm::vec3(2,2,2);\n\t\/\/std::shared_ptr<Model> cmodel = Content::LoadModel(\"coriolis\", glm::rotate(glm::mat4(1), 90.0f, GameComponent::basisUp));\t\n\t\/\/station->Attach(cmodel);\n\t\/\/station->Attach(make_shared<VectorDrawer>(glm::vec3(7,7,7)));\n\t\/\/station->position = glm::vec3(40, 5, -20);\n\t\/\/Attach(station);\n\n\t\/\/\/\/ Add a child to the station and update by including the parent's world transform\n\t\/\/std::shared_ptr<GameComponent> ship1 = make_shared<GameComponent>();\n\t\/\/ship1->worldMode = world_modes::from_self_with_parent;\n\t\/\/ship1->ambient = glm::vec3(0.2f, 0.2, 0.2f);\n\t\/\/ship1->specular = glm::vec3(1.2f, 1.2f, 1.2f);\n\t\/\/std::shared_ptr<Model> ana = Content::LoadModel(\"anaconda\", glm::rotate(glm::mat4(1), 180.0f, GameComponent::basisUp));\t\n\t\/\/ship1->Attach(ana);\n\t\/\/ship1->position = glm::vec3(0, 0, -10);\n\t\/\/station->Attach(ship1);\n\n\t\n\t\/\/physicsFactory->CreateVehicle(glm::vec3(0,10,-30));\n\n\t\/\/ Create Inca Pyramid\n\t\/\/position(), baseWidth, blockHeight, blockWidth, blockDepth\n \/\/physicsFactory->CreateIncaPyramid(glm::vec3(20,0,-20), 6, 1.5, 1.5, 1.5);\n\n\t\/\/Create Rag Doll\n\t\/\/physicsFactory->CreateRagDoll(glm::vec3(25,0,-50));\n\n\n\tif (!Game::Initialise()) {\n\t\treturn false;\n\t}\n\n\tcamera->GetController()->position = glm::vec3(0,10, 0);\n\n\n\treturn true;\n}\n\n\nvoid BGE::PortalGame::Update(float timeDelta)\n{\n\tdynamicsWorld->stepSimulation(timeDelta,100);\n\t\/\/station->Yaw(timeDelta * 20.0f);\n\n\t\/\/collision detection check\n\t int numManifolds = dynamicsWorld->getDispatcher()->getNumManifolds();\n for (int i=0;i<numManifolds;i++)\n {\n btPersistentManifold* contactManifold = dynamicsWorld->getDispatcher()->getManifoldByIndexInternal(i);\n btCollisionObject* obA = (btCollisionObject*)(contactManifold->getBody0());\n\t\t\t\tbtCollisionObject* obB = (btCollisionObject*)(contactManifold->getBody1());\n\t\t\t\t\/\/ btCollisionObject* obA = (btCollisionObject*)(contactManifold->colCyl = physicsFactory->CreateCylinder(2,1, glm::vec3(5, 0, -10), glm::quat()); );\n\t\t\t\t\/\/btCollisionObject* obB = (btCollisionObject*)(contactManifold->colBox = physicsFactory->CreateBox(1,1,1, glm::vec3(5, 0, 0), glm::quat()); );\n PhysicsController * pcA = reinterpret_cast<PhysicsController*>(obA->getUserPointer());\n PhysicsController * pcB = reinterpret_cast<PhysicsController*>(obB->getUserPointer());\n\n int numContacts = contactManifold->getNumContacts();\n if (numContacts > 0)\n {\n if ((pcA != nullptr) && (pcB != nullptr))\n {\n\t\t\t\t\t\t\t\/\/PrintText(\"Collision between \" + pcA->tag + \" and \" + pcB->tag);\n\t\t\t\t\t\t\tif (pcA->tag == \"colObject1\" && pcB->tag == \"colObject2\")\n {\n\t\t\t\t\t\t\t\t PrintText(\"Collision between \" + pcA->tag + \" and \" + pcB->tag);\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\/*if (pcB->tag == \"colObject1\" && pcA->tag == \"colObject2\")\n {\n\t\t\t\t\t\t\t\t PrintText(\"Collision between \" + pcA->tag + \" and \" + pcB->tag);\n\t\t\t\t\t\t\t}*\/\n }\n }\n }\n\n\tGame::Update(timeDelta);\n\n\n}\n\nvoid BGE::PortalGame::Cleanup()\n{\n\tGame::Cleanup();\n}\n<|endoftext|>"} {"text":"<commit_before>#include \"IteratorAnalysis.h\"\n\n#include \"iterators\/Dialect\/Iterators\/IR\/Iterators.h\"\n#include \"iterators\/Utils\/NameAssigner.h\"\n#include \"mlir\/Dialect\/LLVMIR\/LLVMTypes.h\"\n#include \"mlir\/IR\/BuiltinAttributes.h\"\n#include \"llvm\/ADT\/TypeSwitch.h\"\n\nusing namespace mlir;\nusing namespace mlir::iterators;\n\nusing SymbolTriple = std::tuple<SymbolRefAttr, SymbolRefAttr, SymbolRefAttr>;\n\n\/\/\/ Pre-assigns names for the Open\/Next\/Close functions of the given iterator\n\/\/\/ op. The conversion is expected to create these names in the lowering of\n\/\/\/ the corresponding op and can look them up in the lowering of downstream\n\/\/\/ iterators.\nstatic SymbolTriple assignFunctionNames(Operation *op,\n NameAssigner &nameAssigner) {\n SmallVector<SymbolRefAttr, 3> symbols;\n for (auto suffix : {\"open\", \"next\", \"close\"}) {\n \/\/ Construct base name from op type and Open\/Next\/Close.\n auto baseName = StringAttr::get(\n op->getContext(),\n (op->getName().getStringRef() + Twine(\".\") + suffix).str());\n\n \/\/ Make name unique. This may increment uniqueNumber.\n StringAttr uniqueName = nameAssigner.assignName(baseName);\n\n auto symbol = SymbolRefAttr::get(op->getContext(), uniqueName);\n symbols.push_back(symbol);\n }\n return std::make_tuple(symbols[0], symbols[1], symbols[2]);\n}\n\n\/\/\/ The state of ConstantStreamOp consists of a single number that corresponds\n\/\/\/ to the next number returned by the iterator.\nstatic LLVM::LLVMStructType computeStateType(ConstantStreamOp op) {\n MLIRContext *context = op->getContext();\n Type i32 = IntegerType::get(context, \/*width=*\/32);\n return LLVM::LLVMStructType::getNewIdentified(\n context, \"iterators.constant_stream_state\", {i32});\n}\n\n\/\/\/ The state of ReduceOp only consists of the state of its upstream iterator,\n\/\/\/ i.e., the state of the iterator that produces its input stream.\nstatic LLVM::LLVMStructType\ncomputeStateType(ReduceOp op, LLVM::LLVMStructType upstreamStateType) {\n return LLVM::LLVMStructType::getNewIdentified(\n op->getContext(), \"iterators.reduce_state\", {upstreamStateType});\n}\n\n\/\/\/ Build IteratorInfo, assigning new unique names as needed.\n\/\/\/ Takes the `LLVM::LLVMStructType` as a parameter, to ensure proper build\n\/\/\/ order (all uses are visited before any def).\nmlir::iterators::IteratorInfo::IteratorInfo(IteratorOpInterface op,\n NameAssigner &nameAssigner,\n LLVM::LLVMStructType t) {\n std::tie(openFunc, nextFunc, closeFunc) =\n assignFunctionNames(op, nameAssigner);\n stateType = t;\n}\n\nIteratorInfo mlir::iterators::IteratorAnalysis::getExpectedIteratorInfo(\n IteratorOpInterface op) const {\n auto it = opMap.find(op);\n assert(it != opMap.end() && \"analysis does not contain this op\");\n return it->getSecond();\n}\n\nvoid mlir::iterators::IteratorAnalysis::setIteratorInfo(\n IteratorOpInterface op, const IteratorInfo &info) {\n assert(info.stateType && \"state type must be computed\");\n auto inserted = opMap.insert({op, info});\n assert(inserted.second && \"IteratorInfo already present\");\n}\n\ntemplate <typename OpTy>\nstatic OpTy getSelfOrParentOfType(Operation *op) {\n auto maybe = dyn_cast<OpTy>(op);\n return maybe ? maybe : op->getParentOfType<OpTy>();\n}\n\nmlir::iterators::IteratorAnalysis::IteratorAnalysis(Operation *rootOp)\n : rootOp(rootOp), nameAssigner(getSelfOrParentOfType<ModuleOp>(rootOp)) {\n \/\/\/ This needs to be built in use-def order so that all uses are visited\n \/\/\/ before any def.\n rootOp->walk([&](IteratorOpInterface iteratorOp) {\n llvm::TypeSwitch<Operation *, void>(iteratorOp)\n \/\/\/ The state of ConstantStreamOp consists of a single number that\n \/\/\/ corresponds to the next number returned by the iterator.\n .Case<ConstantStreamOp>([&](auto op) {\n auto stateType = computeStateType(op);\n setIteratorInfo(op, IteratorInfo(op, nameAssigner, stateType));\n })\n \/\/\/ The state of ReduceOp only consists of the state of its upstream\n \/\/\/ iterator, i.e., the state of the iterator that produces its input\n \/\/\/ stream.\n \/\/ TODO: ReduceOp verifier that op.input does not come from a bbArg.\n .Case<ReduceOp>([&](auto op) {\n Operation *def = op.input().getDefiningOp();\n auto stateType =\n computeStateType(op, getExpectedIteratorInfo(def).stateType);\n setIteratorInfo(op, IteratorInfo(op, nameAssigner, stateType));\n })\n .Default([&](auto op) { assert(false && \"Unexpected op\"); });\n });\n}\n<commit_msg>[Iterators] Clarify documentation of ConstantStreamOp. (#544)<commit_after>#include \"IteratorAnalysis.h\"\n\n#include \"iterators\/Dialect\/Iterators\/IR\/Iterators.h\"\n#include \"iterators\/Utils\/NameAssigner.h\"\n#include \"mlir\/Dialect\/LLVMIR\/LLVMTypes.h\"\n#include \"mlir\/IR\/BuiltinAttributes.h\"\n#include \"llvm\/ADT\/TypeSwitch.h\"\n\nusing namespace mlir;\nusing namespace mlir::iterators;\n\nusing SymbolTriple = std::tuple<SymbolRefAttr, SymbolRefAttr, SymbolRefAttr>;\n\n\/\/\/ Pre-assigns names for the Open\/Next\/Close functions of the given iterator\n\/\/\/ op. The conversion is expected to create these names in the lowering of\n\/\/\/ the corresponding op and can look them up in the lowering of downstream\n\/\/\/ iterators.\nstatic SymbolTriple assignFunctionNames(Operation *op,\n NameAssigner &nameAssigner) {\n SmallVector<SymbolRefAttr, 3> symbols;\n for (auto suffix : {\"open\", \"next\", \"close\"}) {\n \/\/ Construct base name from op type and Open\/Next\/Close.\n auto baseName = StringAttr::get(\n op->getContext(),\n (op->getName().getStringRef() + Twine(\".\") + suffix).str());\n\n \/\/ Make name unique. This may increment uniqueNumber.\n StringAttr uniqueName = nameAssigner.assignName(baseName);\n\n auto symbol = SymbolRefAttr::get(op->getContext(), uniqueName);\n symbols.push_back(symbol);\n }\n return std::make_tuple(symbols[0], symbols[1], symbols[2]);\n}\n\n\/\/\/ The state of ConstantStreamOp consists of a single number that corresponds\n\/\/\/ to the index of the next struct returned by the iterator.\nstatic LLVM::LLVMStructType computeStateType(ConstantStreamOp op) {\n MLIRContext *context = op->getContext();\n Type i32 = IntegerType::get(context, \/*width=*\/32);\n return LLVM::LLVMStructType::getNewIdentified(\n context, \"iterators.constant_stream_state\", {i32});\n}\n\n\/\/\/ The state of ReduceOp only consists of the state of its upstream iterator,\n\/\/\/ i.e., the state of the iterator that produces its input stream.\nstatic LLVM::LLVMStructType\ncomputeStateType(ReduceOp op, LLVM::LLVMStructType upstreamStateType) {\n return LLVM::LLVMStructType::getNewIdentified(\n op->getContext(), \"iterators.reduce_state\", {upstreamStateType});\n}\n\n\/\/\/ Build IteratorInfo, assigning new unique names as needed.\n\/\/\/ Takes the `LLVM::LLVMStructType` as a parameter, to ensure proper build\n\/\/\/ order (all uses are visited before any def).\nmlir::iterators::IteratorInfo::IteratorInfo(IteratorOpInterface op,\n NameAssigner &nameAssigner,\n LLVM::LLVMStructType t) {\n std::tie(openFunc, nextFunc, closeFunc) =\n assignFunctionNames(op, nameAssigner);\n stateType = t;\n}\n\nIteratorInfo mlir::iterators::IteratorAnalysis::getExpectedIteratorInfo(\n IteratorOpInterface op) const {\n auto it = opMap.find(op);\n assert(it != opMap.end() && \"analysis does not contain this op\");\n return it->getSecond();\n}\n\nvoid mlir::iterators::IteratorAnalysis::setIteratorInfo(\n IteratorOpInterface op, const IteratorInfo &info) {\n assert(info.stateType && \"state type must be computed\");\n auto inserted = opMap.insert({op, info});\n assert(inserted.second && \"IteratorInfo already present\");\n}\n\ntemplate <typename OpTy>\nstatic OpTy getSelfOrParentOfType(Operation *op) {\n auto maybe = dyn_cast<OpTy>(op);\n return maybe ? maybe : op->getParentOfType<OpTy>();\n}\n\nmlir::iterators::IteratorAnalysis::IteratorAnalysis(Operation *rootOp)\n : rootOp(rootOp), nameAssigner(getSelfOrParentOfType<ModuleOp>(rootOp)) {\n \/\/\/ This needs to be built in use-def order so that all uses are visited\n \/\/\/ before any def.\n rootOp->walk([&](IteratorOpInterface iteratorOp) {\n llvm::TypeSwitch<Operation *, void>(iteratorOp)\n \/\/\/ The state of ConstantStreamOp consists of a single number that\n \/\/\/ corresponds to the next number returned by the iterator.\n .Case<ConstantStreamOp>([&](auto op) {\n auto stateType = computeStateType(op);\n setIteratorInfo(op, IteratorInfo(op, nameAssigner, stateType));\n })\n \/\/\/ The state of ReduceOp only consists of the state of its upstream\n \/\/\/ iterator, i.e., the state of the iterator that produces its input\n \/\/\/ stream.\n \/\/ TODO: ReduceOp verifier that op.input does not come from a bbArg.\n .Case<ReduceOp>([&](auto op) {\n Operation *def = op.input().getDefiningOp();\n auto stateType =\n computeStateType(op, getExpectedIteratorInfo(def).stateType);\n setIteratorInfo(op, IteratorInfo(op, nameAssigner, stateType));\n })\n .Default([&](auto op) { assert(false && \"Unexpected op\"); });\n });\n}\n<|endoftext|>"} {"text":"<commit_before>\/*************************************************************************\n *\n * $RCSfile: ed_ioleobject.cxx,v $\n *\n * $Revision: 1.2 $\n *\n * last change: $Author: mav $ $Date: 2003-03-10 16:10: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#include \"embeddoc.hxx\"\n\nSTDMETHODIMP EmbedDocument_Impl::SetClientSite( IOleClientSite* pSite )\n{\n m_pClientSite = pSite;\n return S_OK;\n}\n\nSTDMETHODIMP EmbedDocument_Impl::GetClientSite( IOleClientSite** pSite )\n{\n *pSite = m_pClientSite;\n return S_OK;\n}\n\nSTDMETHODIMP EmbedDocument_Impl::SetHostNames( LPCOLESTR szContainerApp, LPCOLESTR szContainerObj )\n{\n return S_OK;\n}\n\nSTDMETHODIMP EmbedDocument_Impl::Close( DWORD dwSaveOption)\n{\n return S_OK;\n}\n\nSTDMETHODIMP EmbedDocument_Impl::SetMoniker( DWORD dwWhichMoniker, IMoniker *pmk )\n{\n return E_NOTIMPL;\n}\n\nSTDMETHODIMP EmbedDocument_Impl::GetMoniker( DWORD dwAssign, DWORD dwWhichMoniker, IMoniker **ppmk )\n{\n return E_NOTIMPL;\n}\n\nSTDMETHODIMP EmbedDocument_Impl::InitFromData( IDataObject *pDataObject, BOOL fCreation, DWORD dwReserved )\n{\n return E_NOTIMPL;\n}\n\nSTDMETHODIMP EmbedDocument_Impl::GetClipboardData( DWORD dwReserved, IDataObject **ppDataObject )\n{\n return E_NOTIMPL;\n}\n\nSTDMETHODIMP EmbedDocument_Impl::DoVerb( LONG iVerb, LPMSG lpmsg, IOleClientSite *pActiveSite, LONG lindex, HWND hwndParent, LPCRECT lprcPosRect )\n{\n if ( iVerb == OLEIVERB_PRIMARY || iVerb == OLEIVERB_OPEN || iVerb == OLEIVERB_SHOW )\n {\n if ( m_pClientSite )\n {\n m_pClientSite->OnShowWindow( TRUE );\n m_pClientSite->OnShowWindow( FALSE );\n }\n\n for ( AdviseSinkHashMapIterator iAdvise = m_aAdviseHashMap.begin(); iAdvise != m_aAdviseHashMap.end(); iAdvise++ )\n {\n if ( iAdvise->second )\n iAdvise->second->OnViewChange( DVASPECT_CONTENT, -1 );\n }\n\n if ( m_pDAdviseHolder )\n m_pDAdviseHolder->SendOnDataChange( (IDataObject*)this, 0, 0 );\n\n return S_OK;\n }\n\n return E_NOTIMPL;\n}\n\nSTDMETHODIMP EmbedDocument_Impl::EnumVerbs( IEnumOLEVERB **ppEnumOleVerb )\n{\n return OLE_S_USEREG;\n}\n\nSTDMETHODIMP EmbedDocument_Impl::Update()\n{\n return S_OK;\n}\n\nSTDMETHODIMP EmbedDocument_Impl::IsUpToDate()\n{\n return S_OK;\n}\n\nSTDMETHODIMP EmbedDocument_Impl::GetUserClassID( CLSID *pClsid )\n{\n return GetClassID( pClsid );\n}\n\nSTDMETHODIMP EmbedDocument_Impl::GetUserType( DWORD dwFormOfType, LPOLESTR *pszUserType )\n{\n return OLE_S_USEREG;\n}\n\nSTDMETHODIMP EmbedDocument_Impl::SetExtent( DWORD dwDrawAspect, SIZEL *psizel )\n{\n return E_NOTIMPL;\n}\n\nSTDMETHODIMP EmbedDocument_Impl::GetExtent( DWORD dwDrawAspect, SIZEL *psizel )\n{\n if ( psizel )\n {\n psizel->cx = 10000;\n psizel->cy = 10000;\n }\n\n return S_OK;\n}\n\nSTDMETHODIMP EmbedDocument_Impl::Advise( IAdviseSink *pAdvSink, DWORD *pdwConnection )\n{\n if ( m_nAdviseNum == 0xFFFFFFFF )\n return E_OUTOFMEMORY;\n\n pAdvSink->AddRef();\n m_aAdviseHashMap.insert( ::std::pair< DWORD, IAdviseSink* >( m_nAdviseNum, pAdvSink ) );\n *pdwConnection = m_nAdviseNum++;\n\n return S_OK;\n}\n\nSTDMETHODIMP EmbedDocument_Impl::Unadvise( DWORD dwConnection )\n{\n AdviseSinkHashMapIterator iAdvise = m_aAdviseHashMap.find( dwConnection );\n if ( iAdvise != m_aAdviseHashMap.end() )\n {\n iAdvise->second->Release();\n m_aAdviseHashMap.erase( iAdvise );\n }\n else\n return OLE_E_NOCONNECTION;\n\n return S_OK;\n}\n\nSTDMETHODIMP EmbedDocument_Impl::EnumAdvise( IEnumSTATDATA **ppenumAdvise )\n{\n return E_NOTIMPL;\n}\n\nSTDMETHODIMP EmbedDocument_Impl::GetMiscStatus( DWORD dwAspect, DWORD *pdwStatus )\n{\n return OLE_S_USEREG;\n}\n\nSTDMETHODIMP EmbedDocument_Impl::SetColorScheme( LOGPALETTE *pLogpal )\n{\n return E_NOTIMPL;\n}\n\n<commit_msg>#i2822# notification on close<commit_after>\/*************************************************************************\n *\n * $RCSfile: ed_ioleobject.cxx,v $\n *\n * $Revision: 1.3 $\n *\n * last change: $Author: mav $ $Date: 2003-03-11 13:02:14 $\n *\n * The Contents of this file are made available subject to the terms of\n * either of the following licenses\n *\n * - GNU Lesser General Public License Version 2.1\n * - Sun Industry Standards Source License Version 1.1\n *\n * Sun Microsystems Inc., October, 2000\n *\n * GNU Lesser General Public License Version 2.1\n * =============================================\n * Copyright 2000 by Sun Microsystems, Inc.\n * 901 San Antonio Road, Palo Alto, CA 94303, USA\n *\n * This library is free software; you can redistribute it and\/or\n * modify it under the terms of the GNU Lesser General Public\n * License version 2.1, as published by the Free Software Foundation.\n *\n * This library is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU\n * Lesser General Public License for more details.\n *\n * You should have received a copy of the GNU Lesser General Public\n * License along with this library; if not, write to the Free Software\n * Foundation, Inc., 59 Temple Place, Suite 330, Boston,\n * MA 02111-1307 USA\n *\n *\n * Sun Industry Standards Source License Version 1.1\n * =================================================\n * The contents of this file are subject to the Sun Industry Standards\n * Source License Version 1.1 (the \"License\"); You may not use this file\n * except in compliance with the License. You may obtain a copy of the\n * License at http:\/\/www.openoffice.org\/license.html.\n *\n * Software provided under this License is provided on an \"AS IS\" basis,\n * WITHOUT WARRANTY OF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING,\n * WITHOUT LIMITATION, WARRANTIES THAT THE SOFTWARE IS FREE OF DEFECTS,\n * MERCHANTABLE, FIT FOR A PARTICULAR PURPOSE, OR NON-INFRINGING.\n * See the License for the specific provisions governing your rights and\n * obligations concerning the Software.\n *\n * The Initial Developer of the Original Code is: Sun Microsystems, Inc.\n *\n * Copyright: 2000 by Sun Microsystems, Inc.\n *\n * All Rights Reserved.\n *\n * Contributor(s): _______________________________________\n *\n *\n ************************************************************************\/\n\n#include \"embeddoc.hxx\"\n\nSTDMETHODIMP EmbedDocument_Impl::SetClientSite( IOleClientSite* pSite )\n{\n m_pClientSite = pSite;\n return S_OK;\n}\n\nSTDMETHODIMP EmbedDocument_Impl::GetClientSite( IOleClientSite** pSite )\n{\n *pSite = m_pClientSite;\n return S_OK;\n}\n\nSTDMETHODIMP EmbedDocument_Impl::SetHostNames( LPCOLESTR szContainerApp, LPCOLESTR szContainerObj )\n{\n return S_OK;\n}\n\nSTDMETHODIMP EmbedDocument_Impl::Close( DWORD dwSaveOption )\n{\n HRESULT hr = S_OK;\n\n if ( dwSaveOption && m_pClientSite )\n hr = m_pClientSite->SaveObject();\n\n if ( m_pDAdviseHolder )\n m_pDAdviseHolder->SendOnDataChange( (IDataObject*)this, 0, ADVF_DATAONSTOP );\n\n if ( m_pClientSite )\n m_pClientSite->OnShowWindow( FALSE );\n\n for ( AdviseSinkHashMapIterator iAdvise = m_aAdviseHashMap.begin(); iAdvise != m_aAdviseHashMap.end(); iAdvise++ )\n {\n if ( iAdvise->second )\n iAdvise->second->OnClose();\n }\n\n return hr;\n}\n\nSTDMETHODIMP EmbedDocument_Impl::SetMoniker( DWORD dwWhichMoniker, IMoniker *pmk )\n{\n return E_NOTIMPL;\n}\n\nSTDMETHODIMP EmbedDocument_Impl::GetMoniker( DWORD dwAssign, DWORD dwWhichMoniker, IMoniker **ppmk )\n{\n return E_NOTIMPL;\n}\n\nSTDMETHODIMP EmbedDocument_Impl::InitFromData( IDataObject *pDataObject, BOOL fCreation, DWORD dwReserved )\n{\n return E_NOTIMPL;\n}\n\nSTDMETHODIMP EmbedDocument_Impl::GetClipboardData( DWORD dwReserved, IDataObject **ppDataObject )\n{\n return E_NOTIMPL;\n}\n\nSTDMETHODIMP EmbedDocument_Impl::DoVerb( LONG iVerb, LPMSG lpmsg, IOleClientSite *pActiveSite, LONG lindex, HWND hwndParent, LPCRECT lprcPosRect )\n{\n if ( iVerb == OLEIVERB_PRIMARY || iVerb == OLEIVERB_OPEN || iVerb == OLEIVERB_SHOW )\n {\n if ( m_pClientSite )\n {\n m_pClientSite->OnShowWindow( TRUE );\n m_pClientSite->OnShowWindow( FALSE );\n }\n\n for ( AdviseSinkHashMapIterator iAdvise = m_aAdviseHashMap.begin(); iAdvise != m_aAdviseHashMap.end(); iAdvise++ )\n {\n if ( iAdvise->second )\n iAdvise->second->OnViewChange( DVASPECT_CONTENT, -1 );\n }\n\n if ( m_pDAdviseHolder )\n m_pDAdviseHolder->SendOnDataChange( (IDataObject*)this, 0, 0 );\n\n return S_OK;\n }\n\n return E_NOTIMPL;\n}\n\nSTDMETHODIMP EmbedDocument_Impl::EnumVerbs( IEnumOLEVERB **ppEnumOleVerb )\n{\n return OLE_S_USEREG;\n}\n\nSTDMETHODIMP EmbedDocument_Impl::Update()\n{\n return S_OK;\n}\n\nSTDMETHODIMP EmbedDocument_Impl::IsUpToDate()\n{\n return S_OK;\n}\n\nSTDMETHODIMP EmbedDocument_Impl::GetUserClassID( CLSID *pClsid )\n{\n return GetClassID( pClsid );\n}\n\nSTDMETHODIMP EmbedDocument_Impl::GetUserType( DWORD dwFormOfType, LPOLESTR *pszUserType )\n{\n return OLE_S_USEREG;\n}\n\nSTDMETHODIMP EmbedDocument_Impl::SetExtent( DWORD dwDrawAspect, SIZEL *psizel )\n{\n return E_NOTIMPL;\n}\n\nSTDMETHODIMP EmbedDocument_Impl::GetExtent( DWORD dwDrawAspect, SIZEL *psizel )\n{\n if ( psizel )\n {\n psizel->cx = 10000;\n psizel->cy = 10000;\n }\n\n return S_OK;\n}\n\nSTDMETHODIMP EmbedDocument_Impl::Advise( IAdviseSink *pAdvSink, DWORD *pdwConnection )\n{\n if ( m_nAdviseNum == 0xFFFFFFFF )\n return E_OUTOFMEMORY;\n\n pAdvSink->AddRef();\n m_aAdviseHashMap.insert( ::std::pair< DWORD, IAdviseSink* >( m_nAdviseNum, pAdvSink ) );\n *pdwConnection = m_nAdviseNum++;\n\n return S_OK;\n}\n\nSTDMETHODIMP EmbedDocument_Impl::Unadvise( DWORD dwConnection )\n{\n AdviseSinkHashMapIterator iAdvise = m_aAdviseHashMap.find( dwConnection );\n if ( iAdvise != m_aAdviseHashMap.end() )\n {\n iAdvise->second->Release();\n m_aAdviseHashMap.erase( iAdvise );\n }\n else\n return OLE_E_NOCONNECTION;\n\n return S_OK;\n}\n\nSTDMETHODIMP EmbedDocument_Impl::EnumAdvise( IEnumSTATDATA **ppenumAdvise )\n{\n return E_NOTIMPL;\n}\n\nSTDMETHODIMP EmbedDocument_Impl::GetMiscStatus( DWORD dwAspect, DWORD *pdwStatus )\n{\n return OLE_S_USEREG;\n}\n\nSTDMETHODIMP EmbedDocument_Impl::SetColorScheme( LOGPALETTE *pLogpal )\n{\n return E_NOTIMPL;\n}\n\n<|endoftext|>"} {"text":"<commit_before>\n\/* Copyright (c) 2016 PaddlePaddle Authors. All Rights Reserve.\n\n Licensed under the Apache License, Version 2.0 (the \"License\");\n you may not use this file except in compliance with the License.\n You may obtain a copy of the License at\n\n http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n\n Unless required by applicable law or agreed to in writing, software\n distributed under the License is distributed on an \"AS IS\" BASIS,\n WITHOUT WARRANTIES OR CONDITIONS OF 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\/operators\/rank_loss_op.h\"\n\nnamespace paddle {\nnamespace operators {\n\nclass RankLossOp : public framework::OperatorWithKernel {\n public:\n RankLossOp(const std::string &type, const framework::VariableNameMap &inputs,\n const framework::VariableNameMap &outputs,\n const framework::AttributeMap &attrs)\n : OperatorWithKernel(type, inputs, outputs, attrs) {}\n\n protected:\n void InferShape(const framework::InferShapeContext &ctx) const override {\n \/\/ input check\n PADDLE_ENFORCE_NOT_NULL(ctx.InputVar(\"P\"), \"Input(P) shouldn't be null\");\n PADDLE_ENFORCE_NOT_NULL(ctx.InputVar(\"Oi\"), \"Input(Oi) shouldn't be null\");\n PADDLE_ENFORCE_NOT_NULL(ctx.InputVar(\"Oj\"), \"Input(Oj) shouldn't be null\");\n auto p_dims = ctx.Input<framework::Tensor>(\"P\")->dims();\n auto oi_dims = ctx.Input<framework::Tensor>(\"Oi\")->dims();\n auto oj_dims = ctx.Input<framework::Tensor>(\"Oj\")->dims();\n PADDLE_ENFORCE_EQ(oi_dims, oj_dims,\n \"Input(Oi) and Input(Oj) must have the same size\");\n PADDLE_ENFORCE_EQ(\n p_dims, oi_dims,\n \"Input(P) must have the same size with Input(Oi) & Input(Oj)\");\n ctx.Output<framework::Tensor>(\"Out\")->Resize(p_dims);\n }\n};\n\nclass RankLossOpMaker : public framework::OpProtoAndCheckerMaker {\n public:\n RankLossOpMaker(framework::OpProto *proto,\n framework::OpAttrChecker *op_checker)\n : OpProtoAndCheckerMaker(proto, op_checker) {\n AddInput(\"P\", \"The first input of RankLoss operator.\");\n AddInput(\"Oi\", \"The second input of RankLoss operator.\");\n AddInput(\"Oj\", \"The third input of RankLoss operator.\");\n AddOutput(\"Out\", \"The output tensor of RankLoss operator.\");\n AddComment(R\"DOC(RankLoss operator\n\nA rank loss operator for learning to rank (LTR) task. This operator contains\nthree inputs: P, Oi, and Oj, and the rank cost can be expressed as\n\n\\f[\n C_{i,j} = -\\tilde{P_{ij}} * o_{i,j} + log(1 + e^{o_{i,j}}) \\\\\n o_{i,j} = o_i - o_j \\\\\n \\tilde{P_{i,j}} = \\left \\{0, 0.5, 1 \\right \\} \\ or \\ \\left \\{0, 1 \\right \\}\n\\f]\n\n[1]. Chris Burges, Tal Shaked, Erin Renshaw, et al. Learning to\n Rank useing Gradient Descent.\n)DOC\");\n }\n};\n\nclass RankLossGradOp : public framework::OperatorWithKernel {\n public:\n RankLossGradOp(const std::string &type,\n const framework::VariableNameMap &inputs,\n const framework::VariableNameMap &outputs,\n const framework::AttributeMap &attrs)\n : OperatorWithKernel(type, inputs, outputs, attrs) {}\n\n protected:\n void InferShape(const framework::InferShapeContext &ctx) const override {\n PADDLE_ENFORCE_NOT_NULL(ctx.InputVar(\"P\"), \"Input(P) shouldn't be null.\");\n PADDLE_ENFORCE_NOT_NULL(ctx.InputVar(\"Oi\"), \"Input(Oi) shouldn't be null.\");\n PADDLE_ENFORCE_NOT_NULL(ctx.InputVar(\"Oj\"), \"Input(Oj) shouldn't be null.\");\n PADDLE_ENFORCE_NOT_NULL(ctx.InputVar(framework::GradVarName(\"Out\")),\n \"Input(Out@GRAD) shouldn't be null.\");\n auto dims = ctx.Input<framework::Tensor>(\"P\")->dims();\n ctx.Output<framework::Tensor>(framework::GradVarName(\"P\"))->Resize(dims);\n ctx.Output<framework::Tensor>(framework::GradVarName(\"Oi\"))->Resize(dims);\n ctx.Output<framework::Tensor>(framework::GradVarName(\"Oj\"))->Resize(dims);\n }\n};\n\n} \/\/ namespace operators\n} \/\/ namespace paddle\nnamespace ops = paddle::operators;\n\nREGISTER_OP(rank_loss, ops::RankLossOp, ops::RankLossOpMaker, rank_loss_grad,\n ops::RankLossGradOp);\nREGISTER_OP_CPU_KERNEL(rank_loss,\n ops::RankLossKernel<paddle::platform::CPUPlace, float>);\nREGISTER_OP_CPU_KERNEL(\n rank_loss_grad, ops::RankLossGradKernel<paddle::platform::CPUPlace, float>);\n<commit_msg>update doc information<commit_after>\n\/* Copyright (c) 2016 PaddlePaddle Authors. All Rights Reserve.\n\n Licensed under the Apache License, Version 2.0 (the \"License\");\n you may not use this file except in compliance with the License.\n You may obtain a copy of the License at\n\n http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n\n Unless required by applicable law or agreed to in writing, software\n distributed under the License is distributed on an \"AS IS\" BASIS,\n WITHOUT WARRANTIES OR CONDITIONS OF 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\/operators\/rank_loss_op.h\"\n\nnamespace paddle {\nnamespace operators {\n\nclass RankLossOp : public framework::OperatorWithKernel {\n public:\n RankLossOp(const std::string &type, const framework::VariableNameMap &inputs,\n const framework::VariableNameMap &outputs,\n const framework::AttributeMap &attrs)\n : OperatorWithKernel(type, inputs, outputs, attrs) {}\n\n protected:\n void InferShape(const framework::InferShapeContext &ctx) const override {\n \/\/ input check\n PADDLE_ENFORCE_NOT_NULL(ctx.InputVar(\"P\"), \"Input(P) shouldn't be null\");\n PADDLE_ENFORCE_NOT_NULL(ctx.InputVar(\"Oi\"), \"Input(Oi) shouldn't be null\");\n PADDLE_ENFORCE_NOT_NULL(ctx.InputVar(\"Oj\"), \"Input(Oj) shouldn't be null\");\n auto p_dims = ctx.Input<framework::Tensor>(\"P\")->dims();\n auto oi_dims = ctx.Input<framework::Tensor>(\"Oi\")->dims();\n auto oj_dims = ctx.Input<framework::Tensor>(\"Oj\")->dims();\n PADDLE_ENFORCE_EQ(oi_dims, oj_dims,\n \"Input(Oi) and Input(Oj) must have the same size\");\n PADDLE_ENFORCE_EQ(\n p_dims, oi_dims,\n \"Input(P) must have the same size with Input(Oi) & Input(Oj)\");\n ctx.Output<framework::Tensor>(\"Out\")->Resize(p_dims);\n }\n};\n\nclass RankLossOpMaker : public framework::OpProtoAndCheckerMaker {\n public:\n RankLossOpMaker(framework::OpProto *proto,\n framework::OpAttrChecker *op_checker)\n : OpProtoAndCheckerMaker(proto, op_checker) {\n AddInput(\"P\", \"The desired target values for posteriors.\");\n AddInput(\"Oi\", \"The model output for item i.\");\n AddInput(\"Oj\", \"The model output for item j.\");\n AddOutput(\"Out\", \"The output tensor of RankLoss operator.\");\n AddComment(R\"DOC(RankLoss operator\n\nA rank loss operator for learning to rank (LTR) task. This operator contains\nthree inputs: P, Oi, and Oj, and the rank cost can be expressed as\n\n\\f[\n C_{i,j} = -\\tilde{P_{ij}} * o_{i,j} + log(1 + e^{o_{i,j}}) \\\\\n o_{i,j} = o_i - o_j \\\\\n \\tilde{P_{i,j}} = \\left \\{0, 0.5, 1 \\right \\} \\ or \\ \\left \\{0, 1 \\right \\}\n\\f]\n\nA detailed explanation about these notations can be found in\n\n[1]. Chris Burges, Tal Shaked, Erin Renshaw, et al. Learning to\n Rank useing Gradient Descent.\n)DOC\");\n }\n};\n\nclass RankLossGradOp : public framework::OperatorWithKernel {\n public:\n RankLossGradOp(const std::string &type,\n const framework::VariableNameMap &inputs,\n const framework::VariableNameMap &outputs,\n const framework::AttributeMap &attrs)\n : OperatorWithKernel(type, inputs, outputs, attrs) {}\n\n protected:\n void InferShape(const framework::InferShapeContext &ctx) const override {\n PADDLE_ENFORCE_NOT_NULL(ctx.InputVar(\"P\"), \"Input(P) shouldn't be null.\");\n PADDLE_ENFORCE_NOT_NULL(ctx.InputVar(\"Oi\"), \"Input(Oi) shouldn't be null.\");\n PADDLE_ENFORCE_NOT_NULL(ctx.InputVar(\"Oj\"), \"Input(Oj) shouldn't be null.\");\n PADDLE_ENFORCE_NOT_NULL(ctx.InputVar(framework::GradVarName(\"Out\")),\n \"Input(Out@GRAD) shouldn't be null.\");\n auto dims = ctx.Input<framework::Tensor>(\"P\")->dims();\n ctx.Output<framework::Tensor>(framework::GradVarName(\"P\"))->Resize(dims);\n ctx.Output<framework::Tensor>(framework::GradVarName(\"Oi\"))->Resize(dims);\n ctx.Output<framework::Tensor>(framework::GradVarName(\"Oj\"))->Resize(dims);\n }\n};\n\n} \/\/ namespace operators\n} \/\/ namespace paddle\nnamespace ops = paddle::operators;\n\nREGISTER_OP(rank_loss, ops::RankLossOp, ops::RankLossOpMaker, rank_loss_grad,\n ops::RankLossGradOp);\nREGISTER_OP_CPU_KERNEL(rank_loss,\n ops::RankLossKernel<paddle::platform::CPUPlace, float>);\nREGISTER_OP_CPU_KERNEL(\n rank_loss_grad, ops::RankLossGradKernel<paddle::platform::CPUPlace, float>);\n<|endoftext|>"} {"text":"<commit_before>\/*************************************************************************\n *\n * OpenOffice.org - a multi-platform office productivity suite\n *\n * $RCSfile: elementexport.hxx,v $\n *\n * $Revision: 1.17 $\n *\n * last change: $Author: kz $ $Date: 2007-05-10 09:41: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 _XMLOFF_ELEMENTEXPORT_HXX_\n#define _XMLOFF_ELEMENTEXPORT_HXX_\n\n#ifndef _COM_SUN_STAR_BEANS_XPROPERTYSET_HPP_\n#include <com\/sun\/star\/beans\/XPropertySet.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_SCRIPT_SCRIPTEVENTDESCRIPTOR_HPP_\n#include <com\/sun\/star\/script\/ScriptEventDescriptor.hpp>\n#endif\n#ifndef _XMLOFF_FORMS_PROPERTYEXPORT_HXX_\n#include \"propertyexport.hxx\"\n#endif\n#ifndef _XMLOFF_FORMS_CALLBACKS_HXX_\n#include \"callbacks.hxx\"\n#endif\n#ifndef _XMLOFF_FORMS_CONTROLELEMENT_HXX_\n#include \"controlelement.hxx\"\n#endif\n#ifndef _XMLOFF_FORMS_VALUEPROPERTIES_HXX_\n#include \"valueproperties.hxx\"\n#endif\n\nclass SvXMLElementExport;\n\/\/.........................................................................\nnamespace xmloff\n{\n\/\/.........................................................................\n\n \/\/=====================================================================\n \/\/= OElementExport\n \/\/=====================================================================\n class OElementExport : public OPropertyExport\n {\n protected:\n ::com::sun::star::uno::Sequence< ::com::sun::star::script::ScriptEventDescriptor >\n m_aEvents;\n\n SvXMLElementExport* m_pXMLElement; \/\/ XML element doing the concrete startElement etc.\n\n public:\n OElementExport(IFormsExportContext& _rContext,\n const ::com::sun::star::uno::Reference< ::com::sun::star::beans::XPropertySet >& _rxProps,\n const ::com::sun::star::uno::Sequence< ::com::sun::star::script::ScriptEventDescriptor >& _rEvents);\n virtual ~OElementExport();\n\n void doExport();\n\n protected:\n \/\/\/ get the name of the XML element\n virtual const sal_Char* getXMLElementName() const = 0;\n \/\/\/ examine the element we're exporting\n virtual void examine();\n \/\/\/ export the attributes\n virtual void exportAttributes();\n \/\/\/ export any sub tags\n virtual void exportSubTags();\n\n \/** exports the events (as script:events tag)\n *\/\n void exportEvents();\n\n \/** add the service-name attribute to the export context\n *\/\n virtual void exportServiceNameAttribute();\n\n \/\/\/ start the XML element\n virtual void implStartElement(const sal_Char* _pName);\n\n \/\/\/ ends the XML element\n virtual void implEndElement();\n };\n\n \/\/=====================================================================\n \/\/= OControlExport\n \/\/=====================================================================\n \/** Helper class for handling xml elements representing a form control\n *\/\n class OControlExport\n :public OControlElement\n ,public OValuePropertiesMetaData\n ,public OElementExport\n {\n protected:\n DECLARE_STL_STDKEY_SET(sal_Int16, Int16Set);\n \/\/ used below\n\n ::rtl::OUString m_sControlId; \/\/ the control id to use when exporting\n ::rtl::OUString m_sReferringControls; \/\/ list of referring controls (i.e. their id's)\n sal_Int16 m_nClassId; \/\/ class id of the control we're representing\n ElementType m_eType; \/\/ (XML) type of the control we're representing\n sal_Int32 m_nIncludeCommon; \/\/ common control attributes to include\n sal_Int32 m_nIncludeDatabase; \/\/ common database attributes to include\n sal_Int32 m_nIncludeSpecial; \/\/ special attributes to include\n sal_Int32 m_nIncludeEvents; \/\/ events to include\n sal_Int32 m_nIncludeBindings; \/\/ binding attributes to include\n\n SvXMLElementExport* m_pOuterElement; \/\/ XML element doing the concrete startElement etc. for the outer element\n\n public:\n \/** constructs an object capable of exporting controls\n\n <p>You need at least two pre-requisites from outside: The control to be exported needs to have a class id\n assigned, and you need the list control-ids of all the controls referring to this one as LabelControl.<br\/>\n This information can't be collected when known only the control itself and not it's complete context.<\/p>\n\n @param _rControlId\n the control id to use when exporting the control\n @param _rReferringControls\n the comma-separated list of control-ids of all the controls referring to this one as LabelControl\n *\/\n OControlExport(IFormsExportContext& _rContext,\n const ::com::sun::star::uno::Reference< ::com::sun::star::beans::XPropertySet >& _rxControl,\n const ::rtl::OUString& _rControlId,\n const ::rtl::OUString& _rReferringControls,\n const ::com::sun::star::uno::Sequence< ::com::sun::star::script::ScriptEventDescriptor >& _rxEvents);\n ~OControlExport();\n\n protected:\n \/\/\/ start the XML element\n virtual void implStartElement(const sal_Char* _pName);\n\n \/\/\/ ends the XML element\n virtual void implEndElement();\n\n \/\/\/ get the name of the outer XML element\n virtual const sal_Char* getOuterXMLElementName() const;\n\n \/\/ get the name of the XML element\n virtual const sal_Char* getXMLElementName() const;\n\n \/** examine the control. Some kind of CtorImpl.\n *\/\n virtual void examine();\n\n \/\/\/ exports the attributes for the outer element\n void exportOuterAttributes();\n\n \/\/\/ exports the attributes for the inner element\n void exportInnerAttributes();\n\n \/\/\/ export the attributes\n virtual void exportAttributes();\n\n \/** writes everything which needs to be represented as sub tag\n *\/\n void exportSubTags() throw (::com::sun::star::uno::Exception);\n\n \/** adds common control attributes to the XMLExport context given\n\n <p>The attribute list of the context is not cleared initially, this is the responsibility of the caller.<\/p>\n *\/\n void exportCommonControlAttributes();\n\n \/** adds database attributes to the XMLExport context given\n\n <p>The attribute list of the context is not cleared initially, this is the responsibility of the caller.<\/p>\n *\/\n void exportDatabaseAttributes();\n\n \/** adds the XML attributes which are related to binding controls to\n external values and\/or list sources\n *\/\n void exportBindingAtributes();\n\n \/** adds attributes which are special to a control type to the export context's attribute list\n *\/\n void exportSpecialAttributes();\n\n \/** exports the ListSource property of a control as attribute\n\n The ListSource property may be exported in different ways: For a ComboBox, it is an attribute\n of the form:combobox element.\n\n For a ListBox, it's an attribute if the ListSourceType states that the ListBox does <em>not<\/em>\n display a value list. In case of a value list, the ListSource is not exported, and the pairs of\n StringItem\/ValueItem are exported as sub-elements.\n\n This method does the attribute part: It exports the ListSource property as attribute, not caring\n about whether the object is a ComboBox or a ListBox.\n *\/\n void exportListSourceAsAttribute();\n\n \/** exports the ListSource property of a control as XML elements\n\n @see exportListSourceAsAttribute\n *\/\n void exportListSourceAsElements();\n\n \/** get's a Sequence< sal_Int16 > property value as set of sal_Int16's\n @param _rPropertyName\n the property name to use\n @param _rOut\n out parameter. The set of integers.\n *\/\n void getSequenceInt16PropertyAsSet(const ::rtl::OUString& _rPropertyName, Int16Set& _rOut);\n\n \/** exports the attribute which descrives a cell value binding of a control\n in a spreadsheet document\n *\/\n void exportCellBindingAttributes( bool _bIncludeListLinkageType );\n\n \/** exports the attribute(s) which bind this control to XForms *\/\n void exportXFormsBindAttributes();\n\n \/** exports the attribute(s) which bind the list of a list\n control to XForms *\/\n void exportXFormsListAttributes();\n\n \/** exports the attribute(s) for an XForms submission *\/\n void exportXFormsSubmissionAttributes();\n\n \/** exports the attribute which descrives a cell range which acts as list source for\n a list-like control\n *\/\n void exportCellListSourceRange( );\n\n \/** exports the attribut(s) for the ImagePosition property\n *\/\n void exportImagePositionAttributes();\n\n \/** determines whether the control we're exporting has an active data binding.\n\n Bindings which count here are:\n <ul><li>an established connection to a database field<\/li>\n <li>a binding to an external value supplier (<type scope=\"com::sun::star::form::binding\">XValueBinding<\/type>)<\/li>\n <\/ul>\n *\/\n bool controlHasActiveDataBinding() const;\n\n \/** retrieves the string specifying the ListSource of a list or combo box\n *\/\n ::rtl::OUString getScalarListSourceValue() const;\n\n \/** determines whether the list entries (of a combo or list box) are supplied by the user\n\n List entries may be\n <ul><li>specified by the user<\/li>\n <li>specified by an external list source (<type scope=\"com::sun::star::form::binding\">XListEntrySource<\/type>)<\/li>\n <li>obtained from a database query (in various ways)<\/li>\n <\/ul>\n\n In the latter two cases, this method will return <FALSE\/>\n *\/\n bool controlHasUserSuppliedListEntries() const;\n };\n\n \/\/=====================================================================\n \/\/= OColumnExport\n \/\/=====================================================================\n \/** Helper class for exporting a grid column\n *\/\n class OColumnExport : public OControlExport\n {\n public:\n \/** ctor\n @see OColumnExport::OColumnExport\n *\/\n OColumnExport(IFormsExportContext& _rContext,\n const ::com::sun::star::uno::Reference< ::com::sun::star::beans::XPropertySet >& _rxControl,\n const ::rtl::OUString& _rControlId,\n const ::com::sun::star::uno::Sequence< ::com::sun::star::script::ScriptEventDescriptor >& _rxEvents);\n\n ~OColumnExport();\n\n protected:\n \/\/ OControlExport overridables\n virtual const sal_Char* getOuterXMLElementName() const;\n virtual void exportServiceNameAttribute();\n virtual void exportAttributes();\n\n \/\/ OElementExport overridables\n virtual void examine();\n };\n\n \/\/=====================================================================\n \/\/= OFormExport\n \/\/=====================================================================\n \/** Helper class for handling xml elements representing a form\n\n <p>In opposite to the class <type>OControlExport<\/type>, OFormExport is unable to export a <em>complete<\/em>\n form. Instead the client has to care for sub elements of the form itself.<\/p>\n *\/\n class OFormExport\n :public OControlElement\n ,public OElementExport\n {\n sal_Bool m_bCreateConnectionResourceElement;\n public:\n \/** constructs an object capable of exporting controls\n *\/\n OFormExport(IFormsExportContext& _rContext,\n const ::com::sun::star::uno::Reference< ::com::sun::star::beans::XPropertySet >& _rxForm,\n const ::com::sun::star::uno::Sequence< ::com::sun::star::script::ScriptEventDescriptor >& _rxEvents\n );\n\n protected:\n virtual const sal_Char* getXMLElementName() const;\n virtual void exportSubTags();\n virtual void exportAttributes();\n };\n\/\/.........................................................................\n} \/\/ namespace xmloff\n\/\/.........................................................................\n\n#endif \/\/ _XMLOFF_ELEMENTEXPORT_HXX_\n\n<commit_msg>INTEGRATION: CWS changefileheader (1.17.206); FILE MERGED 2008\/04\/01 13:04:49 thb 1.17.206.2: #i85898# Stripping all external header guards 2008\/03\/31 16:28:11 rt 1.17.206.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: elementexport.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\n#ifndef _XMLOFF_ELEMENTEXPORT_HXX_\n#define _XMLOFF_ELEMENTEXPORT_HXX_\n\n#include <com\/sun\/star\/beans\/XPropertySet.hpp>\n#include <com\/sun\/star\/container\/XIndexAccess.hpp>\n#include <com\/sun\/star\/script\/ScriptEventDescriptor.hpp>\n#include \"propertyexport.hxx\"\n#include \"callbacks.hxx\"\n#include \"controlelement.hxx\"\n#include \"valueproperties.hxx\"\n\nclass SvXMLElementExport;\n\/\/.........................................................................\nnamespace xmloff\n{\n\/\/.........................................................................\n\n \/\/=====================================================================\n \/\/= OElementExport\n \/\/=====================================================================\n class OElementExport : public OPropertyExport\n {\n protected:\n ::com::sun::star::uno::Sequence< ::com::sun::star::script::ScriptEventDescriptor >\n m_aEvents;\n\n SvXMLElementExport* m_pXMLElement; \/\/ XML element doing the concrete startElement etc.\n\n public:\n OElementExport(IFormsExportContext& _rContext,\n const ::com::sun::star::uno::Reference< ::com::sun::star::beans::XPropertySet >& _rxProps,\n const ::com::sun::star::uno::Sequence< ::com::sun::star::script::ScriptEventDescriptor >& _rEvents);\n virtual ~OElementExport();\n\n void doExport();\n\n protected:\n \/\/\/ get the name of the XML element\n virtual const sal_Char* getXMLElementName() const = 0;\n \/\/\/ examine the element we're exporting\n virtual void examine();\n \/\/\/ export the attributes\n virtual void exportAttributes();\n \/\/\/ export any sub tags\n virtual void exportSubTags();\n\n \/** exports the events (as script:events tag)\n *\/\n void exportEvents();\n\n \/** add the service-name attribute to the export context\n *\/\n virtual void exportServiceNameAttribute();\n\n \/\/\/ start the XML element\n virtual void implStartElement(const sal_Char* _pName);\n\n \/\/\/ ends the XML element\n virtual void implEndElement();\n };\n\n \/\/=====================================================================\n \/\/= OControlExport\n \/\/=====================================================================\n \/** Helper class for handling xml elements representing a form control\n *\/\n class OControlExport\n :public OControlElement\n ,public OValuePropertiesMetaData\n ,public OElementExport\n {\n protected:\n DECLARE_STL_STDKEY_SET(sal_Int16, Int16Set);\n \/\/ used below\n\n ::rtl::OUString m_sControlId; \/\/ the control id to use when exporting\n ::rtl::OUString m_sReferringControls; \/\/ list of referring controls (i.e. their id's)\n sal_Int16 m_nClassId; \/\/ class id of the control we're representing\n ElementType m_eType; \/\/ (XML) type of the control we're representing\n sal_Int32 m_nIncludeCommon; \/\/ common control attributes to include\n sal_Int32 m_nIncludeDatabase; \/\/ common database attributes to include\n sal_Int32 m_nIncludeSpecial; \/\/ special attributes to include\n sal_Int32 m_nIncludeEvents; \/\/ events to include\n sal_Int32 m_nIncludeBindings; \/\/ binding attributes to include\n\n SvXMLElementExport* m_pOuterElement; \/\/ XML element doing the concrete startElement etc. for the outer element\n\n public:\n \/** constructs an object capable of exporting controls\n\n <p>You need at least two pre-requisites from outside: The control to be exported needs to have a class id\n assigned, and you need the list control-ids of all the controls referring to this one as LabelControl.<br\/>\n This information can't be collected when known only the control itself and not it's complete context.<\/p>\n\n @param _rControlId\n the control id to use when exporting the control\n @param _rReferringControls\n the comma-separated list of control-ids of all the controls referring to this one as LabelControl\n *\/\n OControlExport(IFormsExportContext& _rContext,\n const ::com::sun::star::uno::Reference< ::com::sun::star::beans::XPropertySet >& _rxControl,\n const ::rtl::OUString& _rControlId,\n const ::rtl::OUString& _rReferringControls,\n const ::com::sun::star::uno::Sequence< ::com::sun::star::script::ScriptEventDescriptor >& _rxEvents);\n ~OControlExport();\n\n protected:\n \/\/\/ start the XML element\n virtual void implStartElement(const sal_Char* _pName);\n\n \/\/\/ ends the XML element\n virtual void implEndElement();\n\n \/\/\/ get the name of the outer XML element\n virtual const sal_Char* getOuterXMLElementName() const;\n\n \/\/ get the name of the XML element\n virtual const sal_Char* getXMLElementName() const;\n\n \/** examine the control. Some kind of CtorImpl.\n *\/\n virtual void examine();\n\n \/\/\/ exports the attributes for the outer element\n void exportOuterAttributes();\n\n \/\/\/ exports the attributes for the inner element\n void exportInnerAttributes();\n\n \/\/\/ export the attributes\n virtual void exportAttributes();\n\n \/** writes everything which needs to be represented as sub tag\n *\/\n void exportSubTags() throw (::com::sun::star::uno::Exception);\n\n \/** adds common control attributes to the XMLExport context given\n\n <p>The attribute list of the context is not cleared initially, this is the responsibility of the caller.<\/p>\n *\/\n void exportCommonControlAttributes();\n\n \/** adds database attributes to the XMLExport context given\n\n <p>The attribute list of the context is not cleared initially, this is the responsibility of the caller.<\/p>\n *\/\n void exportDatabaseAttributes();\n\n \/** adds the XML attributes which are related to binding controls to\n external values and\/or list sources\n *\/\n void exportBindingAtributes();\n\n \/** adds attributes which are special to a control type to the export context's attribute list\n *\/\n void exportSpecialAttributes();\n\n \/** exports the ListSource property of a control as attribute\n\n The ListSource property may be exported in different ways: For a ComboBox, it is an attribute\n of the form:combobox element.\n\n For a ListBox, it's an attribute if the ListSourceType states that the ListBox does <em>not<\/em>\n display a value list. In case of a value list, the ListSource is not exported, and the pairs of\n StringItem\/ValueItem are exported as sub-elements.\n\n This method does the attribute part: It exports the ListSource property as attribute, not caring\n about whether the object is a ComboBox or a ListBox.\n *\/\n void exportListSourceAsAttribute();\n\n \/** exports the ListSource property of a control as XML elements\n\n @see exportListSourceAsAttribute\n *\/\n void exportListSourceAsElements();\n\n \/** get's a Sequence< sal_Int16 > property value as set of sal_Int16's\n @param _rPropertyName\n the property name to use\n @param _rOut\n out parameter. The set of integers.\n *\/\n void getSequenceInt16PropertyAsSet(const ::rtl::OUString& _rPropertyName, Int16Set& _rOut);\n\n \/** exports the attribute which descrives a cell value binding of a control\n in a spreadsheet document\n *\/\n void exportCellBindingAttributes( bool _bIncludeListLinkageType );\n\n \/** exports the attribute(s) which bind this control to XForms *\/\n void exportXFormsBindAttributes();\n\n \/** exports the attribute(s) which bind the list of a list\n control to XForms *\/\n void exportXFormsListAttributes();\n\n \/** exports the attribute(s) for an XForms submission *\/\n void exportXFormsSubmissionAttributes();\n\n \/** exports the attribute which descrives a cell range which acts as list source for\n a list-like control\n *\/\n void exportCellListSourceRange( );\n\n \/** exports the attribut(s) for the ImagePosition property\n *\/\n void exportImagePositionAttributes();\n\n \/** determines whether the control we're exporting has an active data binding.\n\n Bindings which count here are:\n <ul><li>an established connection to a database field<\/li>\n <li>a binding to an external value supplier (<type scope=\"com::sun::star::form::binding\">XValueBinding<\/type>)<\/li>\n <\/ul>\n *\/\n bool controlHasActiveDataBinding() const;\n\n \/** retrieves the string specifying the ListSource of a list or combo box\n *\/\n ::rtl::OUString getScalarListSourceValue() const;\n\n \/** determines whether the list entries (of a combo or list box) are supplied by the user\n\n List entries may be\n <ul><li>specified by the user<\/li>\n <li>specified by an external list source (<type scope=\"com::sun::star::form::binding\">XListEntrySource<\/type>)<\/li>\n <li>obtained from a database query (in various ways)<\/li>\n <\/ul>\n\n In the latter two cases, this method will return <FALSE\/>\n *\/\n bool controlHasUserSuppliedListEntries() const;\n };\n\n \/\/=====================================================================\n \/\/= OColumnExport\n \/\/=====================================================================\n \/** Helper class for exporting a grid column\n *\/\n class OColumnExport : public OControlExport\n {\n public:\n \/** ctor\n @see OColumnExport::OColumnExport\n *\/\n OColumnExport(IFormsExportContext& _rContext,\n const ::com::sun::star::uno::Reference< ::com::sun::star::beans::XPropertySet >& _rxControl,\n const ::rtl::OUString& _rControlId,\n const ::com::sun::star::uno::Sequence< ::com::sun::star::script::ScriptEventDescriptor >& _rxEvents);\n\n ~OColumnExport();\n\n protected:\n \/\/ OControlExport overridables\n virtual const sal_Char* getOuterXMLElementName() const;\n virtual void exportServiceNameAttribute();\n virtual void exportAttributes();\n\n \/\/ OElementExport overridables\n virtual void examine();\n };\n\n \/\/=====================================================================\n \/\/= OFormExport\n \/\/=====================================================================\n \/** Helper class for handling xml elements representing a form\n\n <p>In opposite to the class <type>OControlExport<\/type>, OFormExport is unable to export a <em>complete<\/em>\n form. Instead the client has to care for sub elements of the form itself.<\/p>\n *\/\n class OFormExport\n :public OControlElement\n ,public OElementExport\n {\n sal_Bool m_bCreateConnectionResourceElement;\n public:\n \/** constructs an object capable of exporting controls\n *\/\n OFormExport(IFormsExportContext& _rContext,\n const ::com::sun::star::uno::Reference< ::com::sun::star::beans::XPropertySet >& _rxForm,\n const ::com::sun::star::uno::Sequence< ::com::sun::star::script::ScriptEventDescriptor >& _rxEvents\n );\n\n protected:\n virtual const sal_Char* getXMLElementName() const;\n virtual void exportSubTags();\n virtual void exportAttributes();\n };\n\/\/.........................................................................\n} \/\/ namespace xmloff\n\/\/.........................................................................\n\n#endif \/\/ _XMLOFF_ELEMENTEXPORT_HXX_\n\n<|endoftext|>"} {"text":"<commit_before><commit_msg>Move all functions in include\/abaclade\/io\/binary.hxx to the end of the file to avoid forward declarations<commit_after><|endoftext|>"} {"text":"<commit_before>#include \"diagnostic.h\"\n#include \"ui.h\"\n#include \"global.h\"\n#include \"robot.h\"\n\n#include <FEHBuzzer.h>\n#include <new>\n\nnamespace G8 {\n\nnamespace Tasks {\n\n#define TASK_RESULT_QUIT 0x20000000\nTASK_RESULT Quit(Robot * const pRob)\n{\n return TASK_RESULT_SUCCESS | TASK_RESULT_QUIT;\n}\n\nTASK_RESULT RedfineConstants(Robot * const pRob)\n{\n FEHBuzzer buzz;\n\n const size_t length = CONST.GetLength() + 1;\n char const ** ppNames = new char const *[length]; \/\/ Ignore first constant; add one for Quit\n ppNames[0] = \"Quit\";\n ppNames[length - 1] = \"!!!RESET ALL!!!\";\n for(int i = 1; i < CONST.GetLength(); i++)\n {\n ppNames[i] = CONST.GetName(i);\n }\n\n while(size_t index = UI::MenuSelect(\"Select a constant\", ppNames, length))\n {\n if(index == length -1)\n {\n \/\/ Delete and rebuild constants\n CONST.~CONSTANT_SYS();\n new (&CONST) CONSTANT_SYS();\n DefineConstants();\n \/\/ Show message\n LCD.WriteLine(\"All CONSTANTS reset!\");\n Sleep(2000);\n }else{\n switch(CONST.GetType(index))\n {\n case C_TYPE_INT:\n CONST.Redefine<int>(index, UI::GetInt(CONST.GetName(index), CONST.GetVal<int>(index)));\n break;\n case C_TYPE_INT | C_TYPE_UNSIGNED:\n CONST.Redefine<unsigned int>(index, UI::GetIntU(CONST.GetName(index), CONST.GetVal<unsigned int>(index)));\n break;\n default:\n buzz.Beep();\n break;\n }\n }\n }\n\n delete ppNames;\n\n return TASK_RESULT_SUCCESS;\n}\n\nTASK_RESULT RebuildRobot(Robot * const pRob)\n{\n pRob->~Robot();\n\n if(new (pRob) Robot())\n {\n LCD.WriteLine(\"Rebuild successful\");\n Sleep(2000);\n return TASK_RESULT_SUCCESS;\n }\n\n LCD.WriteLine(\"Rebuild failed\");\n Sleep(2000);\n return TASK_RESULT_FAIL;\n}\n\nTASK_RESULT Diagnostics(Robot * const pRob)\n{\n TaskSystem sys(\"Choose a diagnostic\");\n sys.AddTask(\"Quit\", Quit);\n sys.AddTask(\"Redefine constants\", RedfineConstants);\n sys.AddTask(\"Rebuild Robot\", RebuildRobot);\n\n while(true)\n {\n TASK_RESULT r = sys.RunTaskFromMenu(pRob);\n if((r & TASK_RESULT_QUIT) == TASK_RESULT_QUIT)\n return TASK_RESULT_SUCCESS;\n else if((r & TASK_RESULT_FAIL) == TASK_RESULT_FAIL)\n return r;\n }\n\n \/\/ We shouldn't get here\n return TASK_RESULT_FAIL;\n}\n\n}\n\n} \/\/ namespace G8\n<commit_msg>Added PrintPosition and CalibrateServo diagnostics<commit_after>#include \"diagnostic.h\"\n#include \"ui.h\"\n#include \"global.h\"\n#include \"robot.h\"\n\n#include <FEHBuzzer.h>\n#include <FEHServo.h>\n#include <new>\n\nnamespace G8 {\n\nnamespace Tasks {\n\n#define TASK_RESULT_QUIT 0x20000000\nTASK_RESULT Quit(Robot * const pRob)\n{\n return TASK_RESULT_SUCCESS | TASK_RESULT_QUIT;\n}\n\nTASK_RESULT RedfineConstants(Robot * const pRob)\n{\n FEHBuzzer buzz;\n\n const size_t length = CONST.GetLength() + 1;\n char const ** ppNames = new char const *[length]; \/\/ Ignore first constant; add one for Quit\n ppNames[0] = \"Quit\";\n ppNames[length - 1] = \"!!!RESET ALL!!!\";\n for(int i = 1; i < CONST.GetLength(); i++)\n {\n ppNames[i] = CONST.GetName(i);\n }\n\n while(size_t index = UI::MenuSelect(\"Select a constant\", ppNames, length))\n {\n if(index == length -1)\n {\n \/\/ Delete and rebuild constants\n CONST.~CONSTANT_SYS();\n new (&CONST) CONSTANT_SYS();\n DefineConstants();\n \/\/ Show message\n LCD.WriteLine(\"All CONSTANTS reset!\");\n Sleep(2000);\n }else{\n switch(CONST.GetType(index))\n {\n case C_TYPE_INT:\n CONST.Redefine<int>(index, UI::GetInt(CONST.GetName(index), CONST.GetVal<int>(index)));\n break;\n case C_TYPE_INT | C_TYPE_UNSIGNED:\n CONST.Redefine<unsigned int>(index, UI::GetIntU(CONST.GetName(index), CONST.GetVal<unsigned int>(index)));\n break;\n default:\n buzz.Beep();\n break;\n }\n }\n }\n\n delete ppNames;\n\n return TASK_RESULT_SUCCESS;\n}\n\nTASK_RESULT RebuildRobot(Robot * const pRob)\n{\n pRob->~Robot();\n\n if(new (pRob) Robot())\n {\n LCD.WriteLine(\"Rebuild successful\");\n Sleep(2000);\n return TASK_RESULT_SUCCESS;\n }\n\n LCD.WriteLine(\"Rebuild failed\");\n Sleep(2000);\n return TASK_RESULT_FAIL;\n}\n\nTASK_RESULT CalibrateServo(Robot * const pRob)\n{\n unsigned int nServo = UI::GetIntU(\"Servo Port\", 0);\n\n FEHServo servo(static_cast<FEHServo::FEHServoPort>(nServo));\n servo.Calibrate();\n LCD.WriteLine(\"-Middle to quit-\");\n while (pRob->pButtons->MiddlePressed());\n Sleep(100);\n while (!pRob->pButtons->MiddlePressed());\n return TASK_RESULT_SUCCESS;\n}\n\nTASK_RESULT PrintPosition(Robot * const pRob)\n{\n LCD.WriteLine(\"Point in -Y dir.\");\n LCD.WriteLine(\"-Middle to start-\");\n while(!pRob->pButtons->MiddlePressed());\n Sleep(100);\n while(pRob->pButtons->MiddlePressed());\n\n pRob->pNav->CalibrateHeading(270);\n\n while(!pRob->pButtons->MiddlePressed())\n {\n Position p = pRob->pNav->UpdatePosition();\n\n LCD.Clear();\n LCD.Write(\"X: \");\n LCD.WriteLine(p.x);\n LCD.Write(\"Y: \");\n LCD.WriteLine(p.y);\n LCD.Write(\"H: \");\n LCD.WriteLine(p.heading);\n\n Sleep(100);\n }\n\n return TASK_RESULT_SUCCESS;\n}\n\nTASK_RESULT Diagnostics(Robot * const pRob)\n{\n TaskSystem sys(\"Choose a diagnostic\");\n sys.AddTask(\"Quit\", Quit);\n sys.AddTask(\"Redefine constants\", RedfineConstants);\n sys.AddTask(\"Rebuild Robot\", RebuildRobot);\n sys.AddTask(\"Calibrate Servo\", CalibrateServo);\n sys.AddTask(\"Print Position\", PrintPosition);\n\n while(true)\n {\n TASK_RESULT r = sys.RunTaskFromMenu(pRob);\n if((r & TASK_RESULT_QUIT) == TASK_RESULT_QUIT)\n return TASK_RESULT_SUCCESS;\n else if((r & TASK_RESULT_FAIL) == TASK_RESULT_FAIL)\n return r;\n }\n\n \/\/ We shouldn't get here\n return TASK_RESULT_FAIL;\n}\n\n}\n\n} \/\/ namespace G8\n<|endoftext|>"} {"text":"<commit_before>#include \"yaml-cpp\/value.h\"\n#include <map>\n\nint main()\n{\n\tYAML::Value value(YAML::ValueType::Sequence);\n\tfor(int i=0;i<5;i++)\n\t\tvalue.append(i);\n\t\n\tfor(YAML::const_iterator it=value.begin();it!=value.end();++it) {\n\t\tstd::cout << it->as<int>() << \"\\n\";\n\t}\n\t\n\treturn 0;\n}\n<commit_msg>Map iterator works\\!<commit_after>#include \"yaml-cpp\/value.h\"\n#include <map>\n\nint main()\n{\n\tYAML::Value value;\n\tvalue[\"seq\"] = YAML::Value(YAML::ValueType::Sequence);\n\tfor(int i=0;i<5;i++)\n\t\tvalue[\"seq\"].append(i);\n\tvalue[\"map\"][\"one\"] = \"I\";\n\tvalue[\"map\"][\"two\"] = \"II\";\n\tvalue[\"map\"][\"three\"] = \"III\";\n\tvalue[\"map\"][\"four\"] = \"IV\";\n\t\n\tfor(YAML::const_iterator it=value[\"seq\"].begin();it!=value[\"seq\"].end();++it) {\n\t\tstd::cout << it->as<int>() << \"\\n\";\n\t}\n\n\tfor(YAML::const_iterator it=value[\"map\"].begin();it!=value[\"map\"].end();++it) {\n\t\tstd::cout << it->first.as<std::string>() << \" -> \" << it->second.as<std::string>() << \"\\n\";\n\t}\n\t\n\treturn 0;\n}\n<|endoftext|>"} {"text":"<commit_before>#include \"parser.h\"\n\nint priority[128];\nbool rightassoc[128];\n\nconst std::vector<std::pair<token_type, std::string> > splitExpression(const std::string &expr)\n{\n priority[int('+')] = 0;\n priority[int('-')] = 0;\n priority[int('*')] = 1;\n priority[int('\/')] = 1;\n priority[int('%')] = 1;\n priority[int('^')] = 2;\n priority[int('_')] = 3;\n priority[int('=')] = -1;\n rightassoc[int('^')] = true;\n rightassoc[int('_')] = true;\n std::string func, num, poly;\n std::vector<std::pair<token_type, std::string> > ans;\n token_type last = TOKEN_LEFTPAR;\n for(char i : expr + ' ')\n {\n if('A' <= i && i <= 'Z')\n {\n if(func.size())\n ans.push_back({TOKEN_FUNC, func});\n if(num.size())\n ans.push_back({TOKEN_NUMBER, num});\n num = func = \"\";\n if(last == TOKEN_MATRIX || last == TOKEN_NUMBER || last == TOKEN_RIGHTPAR)\n ans.push_back({TOKEN_OP, \"*\"});\n ans.push_back({TOKEN_MATRIX, std::string() + i});\n last = TOKEN_MATRIX;\n }\n else if(i == '+' || i == '*' || i == '^' || i == '(' || i == ')' || i == '=' || i == '\/' || i == '%')\n {\n if(i == '\/' && poly.size())\n {\n poly.push_back('\/');\n continue;\n }\n if(func.size())\n ans.push_back({TOKEN_FUNC, func});\n if(num.size())\n ans.push_back({TOKEN_NUMBER, num});\n num = func = \"\";\n if(i == '(')\n {\n if(last == TOKEN_MATRIX || last == TOKEN_NUMBER || last == TOKEN_RIGHTPAR)\n ans.push_back({TOKEN_OP, \"*\"});\n ans.push_back({TOKEN_LEFTPAR, \"\"});\n }\n else if(i == ')')\n ans.push_back({TOKEN_RIGHTPAR, \"\"});\n else\n ans.push_back({TOKEN_OP, std::string() + i});\n last = ans.back().first;\n }\n else if(i == '-')\n {\n if(poly.size())\n {\n poly.push_back('-');\n continue;\n }\n if(func.size())\n ans.push_back({TOKEN_FUNC, func});\n if(num.size())\n ans.push_back({TOKEN_NUMBER, num});\n num = func = \"\";\n if(last == TOKEN_LEFTPAR || last == TOKEN_OP || last == TOKEN_COMMA)\n {\n ans.push_back({TOKEN_OP, \"_\"}); \/\/ unary\n }\n else\n {\n ans.push_back({TOKEN_OP, \"-\"});\n }\n last = TOKEN_OP;\n }\n else if(('0' <= i && i <= '9') || i == '.')\n {\n if(poly.size())\n {\n poly.push_back(i);\n continue;\n }\n if(func.size())\n ans.push_back({TOKEN_FUNC, func});\n func = \"\";\n num.push_back(i);\n last = TOKEN_NUMBER;\n }\n else if('a' <= i && i <= 'z')\n {\n if(num.size())\n ans.push_back({TOKEN_NUMBER, num});\n num = \"\";\n func.push_back(i);\n last = TOKEN_FUNC;\n }\n else if(i == ',')\n {\n if(func.size())\n ans.push_back({TOKEN_FUNC, func});\n if(num.size())\n ans.push_back({TOKEN_NUMBER, num});\n num = func = \"\";\n ans.push_back({TOKEN_COMMA, \"\"});\n last = TOKEN_COMMA;\n }\n else if(i == '$')\n {\n if(func.size())\n ans.push_back({TOKEN_FUNC, func});\n if(num.size())\n ans.push_back({TOKEN_NUMBER, num});\n num = func = \"\";\n ans.push_back({TOKEN_DOLLAR, \"\"});\n last = TOKEN_DOLLAR;\n }\n else if(i == '\"' || i == '\\'')\n {\n if(poly.size())\n {\n if(poly[0] != i)\n {\n ans.clear();\n return ans;\n }\n ans.push_back({TOKEN_POLY, poly.substr(1)});\n poly = \"\";\n last = TOKEN_POLY;\n }\n else\n {\n poly = i;\n num = func = \"\";\n }\n }\n else\n {\n if(i == ' ' && poly.size())\n {\n poly.push_back(i);\n continue;\n }\n if(func.size())\n ans.push_back({TOKEN_FUNC, func});\n if(num.size())\n ans.push_back({TOKEN_NUMBER, num});\n num = func = \"\";\n }\n }\n return ans;\n}\n<commit_msg>Число * функция<commit_after>#include \"parser.h\"\n\nint priority[128];\nbool rightassoc[128];\n\nconst std::vector<std::pair<token_type, std::string> > splitExpression(const std::string &expr)\n{\n priority[int('+')] = 0;\n priority[int('-')] = 0;\n priority[int('*')] = 1;\n priority[int('\/')] = 1;\n priority[int('%')] = 1;\n priority[int('^')] = 2;\n priority[int('_')] = 3;\n priority[int('=')] = -1;\n rightassoc[int('^')] = true;\n rightassoc[int('_')] = true;\n std::string func, num, poly;\n std::vector<std::pair<token_type, std::string> > ans;\n token_type last = TOKEN_LEFTPAR;\n for(char i : expr + ' ')\n {\n if('A' <= i && i <= 'Z')\n {\n if(func.size())\n ans.push_back({TOKEN_FUNC, func});\n if(num.size())\n ans.push_back({TOKEN_NUMBER, num});\n num = func = \"\";\n if(last == TOKEN_MATRIX || last == TOKEN_NUMBER || last == TOKEN_RIGHTPAR)\n ans.push_back({TOKEN_OP, \"*\"});\n ans.push_back({TOKEN_MATRIX, std::string() + i});\n last = TOKEN_MATRIX;\n }\n else if(i == '+' || i == '*' || i == '^' || i == '(' || i == ')' || i == '=' || i == '\/' || i == '%')\n {\n if(i == '\/' && poly.size())\n {\n poly.push_back('\/');\n continue;\n }\n if(func.size())\n ans.push_back({TOKEN_FUNC, func});\n if(num.size())\n ans.push_back({TOKEN_NUMBER, num});\n num = func = \"\";\n if(i == '(')\n {\n if(last == TOKEN_MATRIX || last == TOKEN_NUMBER || last == TOKEN_RIGHTPAR)\n ans.push_back({TOKEN_OP, \"*\"});\n ans.push_back({TOKEN_LEFTPAR, \"\"});\n }\n else if(i == ')')\n ans.push_back({TOKEN_RIGHTPAR, \"\"});\n else\n ans.push_back({TOKEN_OP, std::string() + i});\n last = ans.back().first;\n }\n else if(i == '-')\n {\n if(poly.size())\n {\n poly.push_back('-');\n continue;\n }\n if(func.size())\n ans.push_back({TOKEN_FUNC, func});\n if(num.size())\n ans.push_back({TOKEN_NUMBER, num});\n num = func = \"\";\n if(last == TOKEN_LEFTPAR || last == TOKEN_OP || last == TOKEN_COMMA)\n {\n ans.push_back({TOKEN_OP, \"_\"}); \/\/ unary\n }\n else\n {\n ans.push_back({TOKEN_OP, \"-\"});\n }\n last = TOKEN_OP;\n }\n else if(('0' <= i && i <= '9') || i == '.')\n {\n if(poly.size())\n {\n poly.push_back(i);\n continue;\n }\n if(func.size())\n ans.push_back({TOKEN_FUNC, func});\n func = \"\";\n num.push_back(i);\n last = TOKEN_NUMBER;\n }\n else if('a' <= i && i <= 'z')\n {\n if(num.size())\n ans.push_back({TOKEN_NUMBER, num});\n num = \"\";\n if(last == TOKEN_MATRIX || last == TOKEN_NUMBER || last == TOKEN_RIGHTPAR)\n ans.push_back({TOKEN_OP, \"*\"});\n func.push_back(i);\n last = TOKEN_FUNC;\n }\n else if(i == ',')\n {\n if(func.size())\n ans.push_back({TOKEN_FUNC, func});\n if(num.size())\n ans.push_back({TOKEN_NUMBER, num});\n num = func = \"\";\n ans.push_back({TOKEN_COMMA, \"\"});\n last = TOKEN_COMMA;\n }\n else if(i == '$')\n {\n if(func.size())\n ans.push_back({TOKEN_FUNC, func});\n if(num.size())\n ans.push_back({TOKEN_NUMBER, num});\n num = func = \"\";\n ans.push_back({TOKEN_DOLLAR, \"\"});\n last = TOKEN_DOLLAR;\n }\n else if(i == '\"' || i == '\\'')\n {\n if(poly.size())\n {\n if(poly[0] != i)\n {\n ans.clear();\n return ans;\n }\n ans.push_back({TOKEN_POLY, poly.substr(1)});\n poly = \"\";\n last = TOKEN_POLY;\n }\n else\n {\n poly = i;\n num = func = \"\";\n }\n }\n else\n {\n if(i == ' ' && poly.size())\n {\n poly.push_back(i);\n continue;\n }\n if(func.size())\n ans.push_back({TOKEN_FUNC, func});\n if(num.size())\n ans.push_back({TOKEN_NUMBER, num});\n num = func = \"\";\n }\n }\n return ans;\n}\n<|endoftext|>"} {"text":"<commit_before>\/*\n * Copyright 2020 Arduino SA\n * SPDX-License-Identifier: Apache-2.0\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n *\/\n\n\/** @file\n * Provides wiced fs porting to generic mbed APIs\n *\/\n\n#include <stddef.h>\n#include <stdio.h>\n#include <stdbool.h>\n#include <string.h>\n#include \"sockets.h\"\n#include \"resources.h\"\n#include \"wiced_filesystem.h\"\n#include \"wiced_bd.h\"\n#include \"QSPIFBlockDevice.h\"\n#include \"MBRBlockDevice.h\"\n#include \"FATFileSystem.h\"\n\n#define WIFI_DEFAULT_FIRMWARE_PATH \"\/wlan\/4343WA1.BIN\"\n#define WIFI_DEFAULT_MOUNT_NAME \"wlan\"\n#define WIFI_DEFAULT_PARTITION 1\n#define WIFI_DEFAULT_FS 0\n\nQSPIFBlockDevice *qspi_bd = NULL;\nMBRBlockDevice *mbr_bd = NULL;\nFATFileSystem *wifi_fs = NULL;\n\nMBED_WEAK void wiced_filesystem_mount_error(void)\n{\n WPRINT_WHD_ERROR((\"Failed to mount the filesystem containing the WiFi firmware.\\n\\r\"));\n whd_print_logbuffer();\n while (1) {}\n}\n\nMBED_WEAK void wiced_filesystem_firmware_error(void)\n{\n WPRINT_WHD_ERROR((\"Please run the \\\"PortentaWiFiFirmwareUpdater\\\" sketch once to install the WiFi firmware.\\n\\r\"));\n whd_print_logbuffer();\n while (1) {}\n}\n\nMBED_WEAK wiced_result_t whd_firmware_check_hook(const char *mounted_name, int mount_err)\n{\n DIR *dir;\n struct dirent *ent;\n std::string dir_name(mounted_name);\n if (mount_err) {\n wiced_filesystem_mount_error();\n } else {\n if ((dir = opendir(mounted_name)) != NULL) {\n \/\/ print all the files and directories within directory\n while ((ent = readdir(dir)) != NULL) {\n std::string fullname = \"\/\" + dir_name + \"\/\" + std::string(ent->d_name);\n if (fullname == WIFI_DEFAULT_FIRMWARE_PATH) {\n closedir(dir);\n return WICED_SUCCESS;\n }\n }\n closedir(dir);\n }\n wiced_filesystem_firmware_error();\n }\n return WICED_ERROR;\n}\n\nstatic wiced_result_t whd_default_firmware_restore(void)\n{\n#if MBED_CONF_APP_WIFI_FIRMWARE_RESTORE\n size_t ret;\n FILE *fp;\n\n \/\/This should only happen the firs time or if the partition table has been overwritten i.e QSPI tests\n WPRINT_WHD_DEBUG((\"MBRBlockDevice init failed, repatitioning\\n\\r\"));\n if (mbr_bd->partition(qspi_bd, 1, 0x0B, 0, 1024 * 1024) != BD_ERROR_OK) {\n return WICED_ERROR;\n }\n WPRINT_WHD_DEBUG((\"MBRBockDevice repatitioning OK, reinit\\n\\r\"));\n\n if (mbr_bd->init() != BD_ERROR_OK) {\n return WICED_ERROR;\n }\n WPRINT_WHD_DEBUG((\"MBRBockDevice init OK\\n\\r\"));\n\n wifi_fs = new FATFileSystem(WIFI_DEFAULT_MOUNT_NAME);\n\n if (wifi_fs->reformat(mbr_bd) != 0) {\n return WICED_ERROR;\n }\n WPRINT_WHD_DEBUG((\"FATFileSystem reformat and mount OK\\n\\r\"));\n\n fp = fopen(WIFI_DEFAULT_FIRMWARE_PATH, \"wb\");\n if (fp == NULL) {\n return WICED_ERROR;\n }\n ret = fwrite(wifi_firmware_image_data, wifi_firmware_image.size, 1, fp);\n if (ret != wifi_firmware_image.size) {\n return WICED_ERROR;\n }\n fclose(fp);\n\n if (mbr_bd->sync() != 0) {\n return WICED_ERROR;\n }\n WPRINT_WHD_DEBUG((\"Sync BlockDevice OK\\n\\r\"));\n\n if (wifi_fs->unmount() != 0) {\n return WICED_ERROR;\n }\n WPRINT_WHD_DEBUG((\"Unmount FS\\n\\r\"));\n wifi_fs = NULL;\n#endif\n\n return WICED_SUCCESS;\n}\n\nwiced_result_t wiced_filesystem_init(void)\n{\n if (mbr_bd == NULL && wifi_fs == NULL) {\n WPRINT_WHD_DEBUG((\"Initialize FileSystem with Mbed default settings\\n\\r\"));\n qspi_bd = new QSPIFBlockDevice(PD_11, PD_12, PF_7, PD_13, PF_10, PG_6, QSPIF_POLARITY_MODE_1, 40000000);\n\n if (qspi_bd->init() == BD_ERROR_OK) {\n mbr_bd = new MBRBlockDevice(qspi_bd, WIFI_DEFAULT_PARTITION);\n if (mbr_bd->init() == BD_ERROR_OK) {\n return WICED_SUCCESS;\n } else {\n return whd_default_firmware_restore();\n }\n }\n return WICED_ERROR;\n } else {\n WPRINT_WHD_DEBUG((\"FileSystem initialized with user settings\\n\\r\"));\n return WICED_SUCCESS;\n }\n}\n\nwiced_result_t wiced_filesystem_mount(BlockDevice *device, wiced_filesystem_handle_type_t fs_type, wiced_filesystem_t *fs_handle_out, const char *mounted_name)\n{\n wifi_fs = new FATFileSystem(mounted_name);\n\n int err = wifi_fs->mount(device);\n whd_firmware_check_hook(mounted_name, err);\n if (!err) {\n \/\/fs_handle_out = wifi_fs\n return WICED_SUCCESS;\n }\n return WICED_ERROR;\n}\n\nwiced_result_t wiced_filesystem_file_open(wiced_filesystem_t *fs_handle, wiced_file_t *file_handle_out, const char *filename, wiced_filesystem_open_mode_t mode)\n{\n \/* This is called by mbed test system *\/\n \/\/if (mbr_bd == NULL && wifi_fs == NULL) {\n \/\/ wiced_filesystem_init();\n \/\/}\n \/\/This can be called from user sketch to provide custom block device and mount point before WiFi.beginAP or WiFi.begin\n if (wifi_fs == NULL) {\n wiced_filesystem_mount(mbr_bd, WIFI_DEFAULT_FS, fs_handle, WIFI_DEFAULT_MOUNT_NAME);\n }\n\n if (wifi_fs == NULL) {\n return WICED_ERROR;\n }\n\n *file_handle_out = open(filename, mode);\n if (*file_handle_out == -1) {\n return WICED_ERROR;\n }\n return WICED_SUCCESS;\n}\n\nwiced_result_t wiced_filesystem_file_seek(wiced_file_t *file_handle, int64_t offset, wiced_filesystem_seek_type_t whence)\n{\n if (*file_handle == -1) {\n return WICED_ERROR;\n }\n lseek(*file_handle, offset, whence);\n return WICED_SUCCESS;\n}\n\nwiced_result_t wiced_filesystem_file_read(wiced_file_t *file_handle, void *data, uint64_t bytes_to_read, uint64_t *returned_bytes_count)\n{\n if (*file_handle == -1) {\n return WICED_ERROR;\n }\n *returned_bytes_count = read(*file_handle, data, bytes_to_read);\n return WICED_SUCCESS;\n}\n\nwiced_result_t wiced_filesystem_file_close(wiced_file_t *file_handle)\n{\n if (*file_handle == -1) {\n return WICED_ERROR;\n }\n close(*file_handle);\n return WICED_SUCCESS;\n}\n<commit_msg>Portenta add resource_fs_handle declaration<commit_after>\/*\n * Copyright 2020 Arduino SA\n * SPDX-License-Identifier: Apache-2.0\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n *\/\n\n\/** @file\n * Provides wiced fs porting to generic mbed APIs\n *\/\n\n#include <stddef.h>\n#include <stdio.h>\n#include <stdbool.h>\n#include <string.h>\n#include \"sockets.h\"\n#include \"resources.h\"\n#include \"wiced_filesystem.h\"\n#include \"wiced_bd.h\"\n#include \"QSPIFBlockDevice.h\"\n#include \"MBRBlockDevice.h\"\n#include \"FATFileSystem.h\"\n\n#define WIFI_DEFAULT_FIRMWARE_PATH \"\/wlan\/4343WA1.BIN\"\n#define WIFI_DEFAULT_MOUNT_NAME \"wlan\"\n#define WIFI_DEFAULT_PARTITION 1\n#define WIFI_DEFAULT_FS 0\n\nQSPIFBlockDevice *qspi_bd = NULL;\nMBRBlockDevice *mbr_bd = NULL;\nFATFileSystem *wifi_fs = NULL;\n\nwiced_filesystem_t resource_fs_handle;\n\nMBED_WEAK void wiced_filesystem_mount_error(void)\n{\n WPRINT_WHD_ERROR((\"Failed to mount the filesystem containing the WiFi firmware.\\n\\r\"));\n whd_print_logbuffer();\n while (1) {}\n}\n\nMBED_WEAK void wiced_filesystem_firmware_error(void)\n{\n WPRINT_WHD_ERROR((\"Please run the \\\"PortentaWiFiFirmwareUpdater\\\" sketch once to install the WiFi firmware.\\n\\r\"));\n whd_print_logbuffer();\n while (1) {}\n}\n\nMBED_WEAK wiced_result_t whd_firmware_check_hook(const char *mounted_name, int mount_err)\n{\n DIR *dir;\n struct dirent *ent;\n std::string dir_name(mounted_name);\n if (mount_err) {\n wiced_filesystem_mount_error();\n } else {\n if ((dir = opendir(mounted_name)) != NULL) {\n \/\/ print all the files and directories within directory\n while ((ent = readdir(dir)) != NULL) {\n std::string fullname = \"\/\" + dir_name + \"\/\" + std::string(ent->d_name);\n if (fullname == WIFI_DEFAULT_FIRMWARE_PATH) {\n closedir(dir);\n return WICED_SUCCESS;\n }\n }\n closedir(dir);\n }\n wiced_filesystem_firmware_error();\n }\n return WICED_ERROR;\n}\n\nstatic wiced_result_t whd_default_firmware_restore(void)\n{\n#if MBED_CONF_APP_WIFI_FIRMWARE_RESTORE\n size_t ret;\n FILE *fp;\n\n \/\/This should only happen the firs time or if the partition table has been overwritten i.e QSPI tests\n WPRINT_WHD_DEBUG((\"MBRBlockDevice init failed, repatitioning\\n\\r\"));\n if (mbr_bd->partition(qspi_bd, 1, 0x0B, 0, 1024 * 1024) != BD_ERROR_OK) {\n return WICED_ERROR;\n }\n WPRINT_WHD_DEBUG((\"MBRBockDevice repatitioning OK, reinit\\n\\r\"));\n\n if (mbr_bd->init() != BD_ERROR_OK) {\n return WICED_ERROR;\n }\n WPRINT_WHD_DEBUG((\"MBRBockDevice init OK\\n\\r\"));\n\n wifi_fs = new FATFileSystem(WIFI_DEFAULT_MOUNT_NAME);\n\n if (wifi_fs->reformat(mbr_bd) != 0) {\n return WICED_ERROR;\n }\n WPRINT_WHD_DEBUG((\"FATFileSystem reformat and mount OK\\n\\r\"));\n\n fp = fopen(WIFI_DEFAULT_FIRMWARE_PATH, \"wb\");\n if (fp == NULL) {\n return WICED_ERROR;\n }\n ret = fwrite(wifi_firmware_image_data, wifi_firmware_image.size, 1, fp);\n if (ret != wifi_firmware_image.size) {\n return WICED_ERROR;\n }\n fclose(fp);\n\n if (mbr_bd->sync() != 0) {\n return WICED_ERROR;\n }\n WPRINT_WHD_DEBUG((\"Sync BlockDevice OK\\n\\r\"));\n\n if (wifi_fs->unmount() != 0) {\n return WICED_ERROR;\n }\n WPRINT_WHD_DEBUG((\"Unmount FS\\n\\r\"));\n wifi_fs = NULL;\n#endif\n\n return WICED_SUCCESS;\n}\n\nwiced_result_t wiced_filesystem_init(void)\n{\n if (mbr_bd == NULL && wifi_fs == NULL) {\n WPRINT_WHD_DEBUG((\"Initialize FileSystem with Mbed default settings\\n\\r\"));\n qspi_bd = new QSPIFBlockDevice(PD_11, PD_12, PF_7, PD_13, PF_10, PG_6, QSPIF_POLARITY_MODE_1, 40000000);\n\n if (qspi_bd->init() == BD_ERROR_OK) {\n mbr_bd = new MBRBlockDevice(qspi_bd, WIFI_DEFAULT_PARTITION);\n if (mbr_bd->init() == BD_ERROR_OK) {\n return WICED_SUCCESS;\n } else {\n return whd_default_firmware_restore();\n }\n }\n return WICED_ERROR;\n } else {\n WPRINT_WHD_DEBUG((\"FileSystem initialized with user settings\\n\\r\"));\n return WICED_SUCCESS;\n }\n}\n\nwiced_result_t wiced_filesystem_mount(BlockDevice *device, wiced_filesystem_handle_type_t fs_type, wiced_filesystem_t *fs_handle_out, const char *mounted_name)\n{\n wifi_fs = new FATFileSystem(mounted_name);\n\n int err = wifi_fs->mount(device);\n whd_firmware_check_hook(mounted_name, err);\n if (!err) {\n \/\/fs_handle_out = wifi_fs\n return WICED_SUCCESS;\n }\n return WICED_ERROR;\n}\n\nwiced_result_t wiced_filesystem_file_open(wiced_filesystem_t *fs_handle, wiced_file_t *file_handle_out, const char *filename, wiced_filesystem_open_mode_t mode)\n{\n \/* This is called by mbed test system *\/\n \/\/if (mbr_bd == NULL && wifi_fs == NULL) {\n \/\/ wiced_filesystem_init();\n \/\/}\n \/\/This can be called from user sketch to provide custom block device and mount point before WiFi.beginAP or WiFi.begin\n if (wifi_fs == NULL) {\n wiced_filesystem_mount(mbr_bd, WIFI_DEFAULT_FS, fs_handle, WIFI_DEFAULT_MOUNT_NAME);\n }\n\n if (wifi_fs == NULL) {\n return WICED_ERROR;\n }\n\n *file_handle_out = open(filename, mode);\n if (*file_handle_out == -1) {\n return WICED_ERROR;\n }\n return WICED_SUCCESS;\n}\n\nwiced_result_t wiced_filesystem_file_seek(wiced_file_t *file_handle, int64_t offset, wiced_filesystem_seek_type_t whence)\n{\n if (*file_handle == -1) {\n return WICED_ERROR;\n }\n lseek(*file_handle, offset, whence);\n return WICED_SUCCESS;\n}\n\nwiced_result_t wiced_filesystem_file_read(wiced_file_t *file_handle, void *data, uint64_t bytes_to_read, uint64_t *returned_bytes_count)\n{\n if (*file_handle == -1) {\n return WICED_ERROR;\n }\n *returned_bytes_count = read(*file_handle, data, bytes_to_read);\n return WICED_SUCCESS;\n}\n\nwiced_result_t wiced_filesystem_file_close(wiced_file_t *file_handle)\n{\n if (*file_handle == -1) {\n return WICED_ERROR;\n }\n close(*file_handle);\n return WICED_SUCCESS;\n}\n<|endoftext|>"} {"text":"<commit_before><commit_msg>Overlapping rectangles area.<commit_after><|endoftext|>"} {"text":"<commit_before>\/* FasTC\n * Copyright (c) 2013 University of North Carolina at Chapel Hill.\n * All rights reserved.\n *\n * Permission to use, copy, modify, and distribute this software and its\n * documentation for educational, research, and non-profit purposes, without\n * fee, and without a written agreement is hereby granted, provided that the\n * above copyright notice, this paragraph, and the following four paragraphs\n * appear in all copies.\n *\n * Permission to incorporate this software into commercial products may be\n * obtained by contacting the authors or the Office of Technology Development\n * at the University of North Carolina at Chapel Hill <otd@unc.edu>.\n *\n * This software program and documentation are copyrighted by the University of\n * North Carolina at Chapel Hill. The software program and documentation are\n * supplied \"as is,\" without any accompanying services from the University of\n * North Carolina at Chapel Hill or the authors. The University of North\n * Carolina at Chapel Hill and the authors do not warrant that the operation of\n * the program will be uninterrupted or error-free. The end-user understands\n * that the program was developed for research purposes and is advised not to\n * rely exclusively on the program for any reason.\n *\n * IN NO EVENT SHALL THE UNIVERSITY OF NORTH CAROLINA AT CHAPEL HILL OR THE\n * AUTHORS BE LIABLE TO ANY PARTY FOR DIRECT, INDIRECT, SPECIAL, INCIDENTAL,\n * OR CONSEQUENTIAL DAMAGES, INCLUDING LOST PROFITS, ARISING OUT OF THE USE OF\n * THIS SOFTWARE AND ITS DOCUMENTATION, EVEN IF THE UNIVERSITY OF NORTH CAROLINA\n * AT CHAPEL HILL OR THE AUTHORS HAVE BEEN ADVISED OF THE POSSIBILITY OF SUCH\n * DAMAGE.\n *\n * THE UNIVERSITY OF NORTH CAROLINA AT CHAPEL HILL AND THE AUTHORS SPECIFICALLY\n * DISCLAIM ANY WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED\n * WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE AND ANY \n * STATUTORY WARRANTY OF NON-INFRINGEMENT. THE SOFTWARE PROVIDED HEREUNDER IS ON\n * AN \"AS IS\" BASIS, AND THE UNIVERSITY OF NORTH CAROLINA AT CHAPEL HILL AND\n * THE AUTHORS HAVE NO OBLIGATIONS TO PROVIDE MAINTENANCE, SUPPORT, UPDATES, \n * ENHANCEMENTS, OR MODIFICATIONS.\n *\n * Please send all BUG REPORTS to <pavel@cs.unc.edu>.\n *\n * The authors may be contacted via:\n *\n * Pavel Krajcevski\n * Dept of Computer Science\n * 201 S Columbia St\n * Frederick P. Brooks, Jr. Computer Science Bldg\n * Chapel Hill, NC 27599-3175\n * USA\n * \n * <http:\/\/gamma.cs.unc.edu\/FasTC\/>\n *\/\n\n#include \"Pixel.h\"\n\n#include <cstring>\n#include <cassert>\n#include <algorithm>\n\nnamespace FasTC {\n\n void Pixel::FromBits(const uint8 *bits,\n const uint8 channelDepth[4],\n uint8 bitOffset) {\n if(channelDepth) {\n memcpy(m_BitDepth, channelDepth, sizeof(m_BitDepth));\n } else {\n for(int i = 0; i < 4; i++) {\n m_BitDepth[i] = 8;\n }\n }\n\n uint32 nBits = bitOffset;\n for(uint32 i = 0; i < 4; i++) {\n nBits += m_BitDepth[i];\n }\n\n int32 byteIdx = 0;\n uint32 bitIdx = bitOffset;\n while(bitIdx >= 8) {\n bitIdx -= 8;\n byteIdx++;\n }\n\n for(int32 i = 0; i < 4; i++) {\n ChannelType &channel = Component(i);\n uint32 depth = m_BitDepth[i];\n\n assert(depth <= 8);\n\n channel = 0;\n if(0 == depth) {\n channel = 0xFF;\n } else if(depth + bitIdx < 8) {\n bitIdx += depth;\n channel = (bits[byteIdx] >> (8 - bitIdx)) & ((1 << depth) - 1);\n } else {\n const uint32 numLowBits = 8 - bitIdx;\n uint32 bitsLeft = depth - numLowBits;\n channel |= bits[byteIdx] & ((1 << numLowBits) - 1);\n byteIdx++;\n\n const uint8 highBitsMask = ((1 << bitsLeft) - 1);\n const uint8 highBits = (bits[byteIdx] >> (8 - bitsLeft)) & highBitsMask;\n channel <<= bitsLeft;\n channel |= highBits;\n bitIdx = bitsLeft;\n }\n }\n }\n\n void Pixel::ToBits(uint8 *bits, uint32 numBytes, uint32 bitOffset) const {\n#ifndef NDEBUG\n uint32 bitDepthSum = bitOffset;\n for(int i = 0; i < 4; i++) {\n bitDepthSum += m_BitDepth[i];\n }\n assert((bitDepthSum \/ 8) < numBytes);\n#endif\n\n uint8 byteIdx = 0;\n while(bitOffset > 8) {\n byteIdx++;\n bitOffset -= 8;\n }\n\n uint8 bitIdx = bitOffset;\n for(int i = 3; i >= 0; i--) {\n ChannelType val = Component(i);\n uint8 depth = m_BitDepth[i];\n\n if(depth + bitIdx > 8) {\n uint8 nextBitIdx = depth - (8 - bitIdx);\n uint16 v = static_cast<uint16>(val);\n bits[byteIdx++] |= (v << bitIdx) & 0xFF;\n bitIdx = nextBitIdx;\n bits[byteIdx] = (v >> (depth - bitIdx)) & 0xFF;\n } else {\n bits[byteIdx] |= (val << bitIdx) & 0xFF;\n bitIdx += depth;\n }\n\n if(bitIdx == 8) {\n bitIdx = 0;\n byteIdx++;\n }\n }\n }\n\n Pixel::ChannelType Pixel::ChangeBitDepth(Pixel::ChannelType val, uint8 oldDepth, uint8 newDepth) {\n assert(newDepth <= 8);\n assert(oldDepth <= 8);\n\n if(oldDepth == newDepth) {\n \/\/ Do nothing\n return val;\n } else if(oldDepth == 0 && newDepth != 0) {\n return (1 << newDepth) - 1;\n } else if(newDepth > oldDepth) {\n uint8 bitsLeft = newDepth;\n uint8 ret = 0;\n while(bitsLeft > oldDepth) {\n ret |= val;\n bitsLeft -= oldDepth;\n ret <<= std::min(bitsLeft, oldDepth);\n }\n\n return ret | (val >> (oldDepth - bitsLeft));\n\n } else {\n \/\/ oldDepth > newDepth\n if(newDepth == 0) {\n return 0xFF;\n } else {\n uint8 bitsWasted = oldDepth - newDepth;\n uint16 v = static_cast<uint16>(val);\n v = (v + (1 << (bitsWasted - 1))) >> bitsWasted;\n v = ::std::min<uint16>(::std::max<uint16>(0, v), (1 << newDepth) - 1);\n return static_cast<uint8>(v);\n }\n }\n\n assert(!\"We shouldn't get here.\");\n return 0;\n }\n\n void Pixel::ChangeBitDepth(const uint8 (&depth)[4]) {\n for(uint32 i = 0; i < 4; i++) {\n Component(i) = ChangeBitDepth(Component(i), m_BitDepth[i], depth[i]);\n m_BitDepth[i] = depth[i];\n }\n }\n\n float Pixel::ToIntensity() const {\n \/\/ First convert the pixel values to floats using premultiplied alpha...\n float a = ConvertChannelToFloat(A(), m_BitDepth[0]);\n float r = a * ConvertChannelToFloat(R(), m_BitDepth[1]);\n float g = a * ConvertChannelToFloat(G(), m_BitDepth[2]);\n float b = a * ConvertChannelToFloat(B(), m_BitDepth[3]);\n return r * 0.21f + g * 0.71f + b * 0.07f;\n }\n\n uint32 Pixel::Pack() const {\n Pixel eightBit(*this);\n const uint8 eightBitDepth[4] = { 8, 8, 8, 8 };\n eightBit.ChangeBitDepth(eightBitDepth);\n\n uint32 r = 0;\n r |= eightBit.A();\n r <<= 8;\n r |= eightBit.B();\n r <<= 8;\n r |= eightBit.G();\n r <<= 8;\n r |= eightBit.R();\n return r;\n }\n\n void Pixel::Unpack(uint32 rgba) {\n A() = ChangeBitDepth((rgba >> 24) & 0xFF, 8, m_BitDepth[0]);\n R() = ChangeBitDepth(rgba & 0xFF, 8, m_BitDepth[1]);\n G() = ChangeBitDepth((rgba >> 8) & 0xFF, 8, m_BitDepth[2]);\n B() = ChangeBitDepth((rgba >> 16) & 0xFF, 8, m_BitDepth[3]);\n }\n\n bool Pixel::operator==(const Pixel &other) const {\n uint8 depths[4];\n other.GetBitDepth(depths);\n\n bool ok = true;\n for(int i = 0; i < 4; i++) {\n ok = ok && m_BitDepth[i] == depths[i];\n\n uint8 mask = (1 << depths[i]) - 1;\n const ChannelType c = other.Component(i) & mask;\n ok = ok && (c == (Component(i) & mask));\n }\n return ok;\n }\n\n} \/\/ namespace FasTC\n<commit_msg>Fix Intensity calculation for pixel.<commit_after>\/* FasTC\n * Copyright (c) 2013 University of North Carolina at Chapel Hill.\n * All rights reserved.\n *\n * Permission to use, copy, modify, and distribute this software and its\n * documentation for educational, research, and non-profit purposes, without\n * fee, and without a written agreement is hereby granted, provided that the\n * above copyright notice, this paragraph, and the following four paragraphs\n * appear in all copies.\n *\n * Permission to incorporate this software into commercial products may be\n * obtained by contacting the authors or the Office of Technology Development\n * at the University of North Carolina at Chapel Hill <otd@unc.edu>.\n *\n * This software program and documentation are copyrighted by the University of\n * North Carolina at Chapel Hill. The software program and documentation are\n * supplied \"as is,\" without any accompanying services from the University of\n * North Carolina at Chapel Hill or the authors. The University of North\n * Carolina at Chapel Hill and the authors do not warrant that the operation of\n * the program will be uninterrupted or error-free. The end-user understands\n * that the program was developed for research purposes and is advised not to\n * rely exclusively on the program for any reason.\n *\n * IN NO EVENT SHALL THE UNIVERSITY OF NORTH CAROLINA AT CHAPEL HILL OR THE\n * AUTHORS BE LIABLE TO ANY PARTY FOR DIRECT, INDIRECT, SPECIAL, INCIDENTAL,\n * OR CONSEQUENTIAL DAMAGES, INCLUDING LOST PROFITS, ARISING OUT OF THE USE OF\n * THIS SOFTWARE AND ITS DOCUMENTATION, EVEN IF THE UNIVERSITY OF NORTH CAROLINA\n * AT CHAPEL HILL OR THE AUTHORS HAVE BEEN ADVISED OF THE POSSIBILITY OF SUCH\n * DAMAGE.\n *\n * THE UNIVERSITY OF NORTH CAROLINA AT CHAPEL HILL AND THE AUTHORS SPECIFICALLY\n * DISCLAIM ANY WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED\n * WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE AND ANY \n * STATUTORY WARRANTY OF NON-INFRINGEMENT. THE SOFTWARE PROVIDED HEREUNDER IS ON\n * AN \"AS IS\" BASIS, AND THE UNIVERSITY OF NORTH CAROLINA AT CHAPEL HILL AND\n * THE AUTHORS HAVE NO OBLIGATIONS TO PROVIDE MAINTENANCE, SUPPORT, UPDATES, \n * ENHANCEMENTS, OR MODIFICATIONS.\n *\n * Please send all BUG REPORTS to <pavel@cs.unc.edu>.\n *\n * The authors may be contacted via:\n *\n * Pavel Krajcevski\n * Dept of Computer Science\n * 201 S Columbia St\n * Frederick P. Brooks, Jr. Computer Science Bldg\n * Chapel Hill, NC 27599-3175\n * USA\n * \n * <http:\/\/gamma.cs.unc.edu\/FasTC\/>\n *\/\n\n#include \"Pixel.h\"\n\n#include <cstring>\n#include <cassert>\n#include <algorithm>\n\nnamespace FasTC {\n\n void Pixel::FromBits(const uint8 *bits,\n const uint8 channelDepth[4],\n uint8 bitOffset) {\n if(channelDepth) {\n memcpy(m_BitDepth, channelDepth, sizeof(m_BitDepth));\n } else {\n for(int i = 0; i < 4; i++) {\n m_BitDepth[i] = 8;\n }\n }\n\n uint32 nBits = bitOffset;\n for(uint32 i = 0; i < 4; i++) {\n nBits += m_BitDepth[i];\n }\n\n int32 byteIdx = 0;\n uint32 bitIdx = bitOffset;\n while(bitIdx >= 8) {\n bitIdx -= 8;\n byteIdx++;\n }\n\n for(int32 i = 0; i < 4; i++) {\n ChannelType &channel = Component(i);\n uint32 depth = m_BitDepth[i];\n\n assert(depth <= 8);\n\n channel = 0;\n if(0 == depth) {\n channel = 0xFF;\n } else if(depth + bitIdx < 8) {\n bitIdx += depth;\n channel = (bits[byteIdx] >> (8 - bitIdx)) & ((1 << depth) - 1);\n } else {\n const uint32 numLowBits = 8 - bitIdx;\n uint32 bitsLeft = depth - numLowBits;\n channel |= bits[byteIdx] & ((1 << numLowBits) - 1);\n byteIdx++;\n\n const uint8 highBitsMask = ((1 << bitsLeft) - 1);\n const uint8 highBits = (bits[byteIdx] >> (8 - bitsLeft)) & highBitsMask;\n channel <<= bitsLeft;\n channel |= highBits;\n bitIdx = bitsLeft;\n }\n }\n }\n\n void Pixel::ToBits(uint8 *bits, uint32 numBytes, uint32 bitOffset) const {\n#ifndef NDEBUG\n uint32 bitDepthSum = bitOffset;\n for(int i = 0; i < 4; i++) {\n bitDepthSum += m_BitDepth[i];\n }\n assert((bitDepthSum \/ 8) < numBytes);\n#endif\n\n uint8 byteIdx = 0;\n while(bitOffset > 8) {\n byteIdx++;\n bitOffset -= 8;\n }\n\n uint8 bitIdx = bitOffset;\n for(int i = 3; i >= 0; i--) {\n ChannelType val = Component(i);\n uint8 depth = m_BitDepth[i];\n\n if(depth + bitIdx > 8) {\n uint8 nextBitIdx = depth - (8 - bitIdx);\n uint16 v = static_cast<uint16>(val);\n bits[byteIdx++] |= (v << bitIdx) & 0xFF;\n bitIdx = nextBitIdx;\n bits[byteIdx] = (v >> (depth - bitIdx)) & 0xFF;\n } else {\n bits[byteIdx] |= (val << bitIdx) & 0xFF;\n bitIdx += depth;\n }\n\n if(bitIdx == 8) {\n bitIdx = 0;\n byteIdx++;\n }\n }\n }\n\n Pixel::ChannelType Pixel::ChangeBitDepth(Pixel::ChannelType val, uint8 oldDepth, uint8 newDepth) {\n assert(newDepth <= 8);\n assert(oldDepth <= 8);\n\n if(oldDepth == newDepth) {\n \/\/ Do nothing\n return val;\n } else if(oldDepth == 0 && newDepth != 0) {\n return (1 << newDepth) - 1;\n } else if(newDepth > oldDepth) {\n uint8 bitsLeft = newDepth;\n uint8 ret = 0;\n while(bitsLeft > oldDepth) {\n ret |= val;\n bitsLeft -= oldDepth;\n ret <<= std::min(bitsLeft, oldDepth);\n }\n\n return ret | (val >> (oldDepth - bitsLeft));\n\n } else {\n \/\/ oldDepth > newDepth\n if(newDepth == 0) {\n return 0xFF;\n } else {\n uint8 bitsWasted = oldDepth - newDepth;\n uint16 v = static_cast<uint16>(val);\n v = (v + (1 << (bitsWasted - 1))) >> bitsWasted;\n v = ::std::min<uint16>(::std::max<uint16>(0, v), (1 << newDepth) - 1);\n return static_cast<uint8>(v);\n }\n }\n\n assert(!\"We shouldn't get here.\");\n return 0;\n }\n\n void Pixel::ChangeBitDepth(const uint8 (&depth)[4]) {\n for(uint32 i = 0; i < 4; i++) {\n Component(i) = ChangeBitDepth(Component(i), m_BitDepth[i], depth[i]);\n m_BitDepth[i] = depth[i];\n }\n }\n\n float Pixel::ToIntensity() const {\n \/\/ First convert the pixel values to floats using premultiplied alpha...\n double a = ConvertChannelToFloat(A(), m_BitDepth[0]);\n double r = a * ConvertChannelToFloat(R(), m_BitDepth[1]);\n double g = a * ConvertChannelToFloat(G(), m_BitDepth[2]);\n double b = a * ConvertChannelToFloat(B(), m_BitDepth[3]);\n return static_cast<float>(r * 0.2126 + g * 0.7152 + b * 0.0722);\n }\n\n uint32 Pixel::Pack() const {\n Pixel eightBit(*this);\n const uint8 eightBitDepth[4] = { 8, 8, 8, 8 };\n eightBit.ChangeBitDepth(eightBitDepth);\n\n uint32 r = 0;\n r |= eightBit.A();\n r <<= 8;\n r |= eightBit.B();\n r <<= 8;\n r |= eightBit.G();\n r <<= 8;\n r |= eightBit.R();\n return r;\n }\n\n void Pixel::Unpack(uint32 rgba) {\n A() = ChangeBitDepth((rgba >> 24) & 0xFF, 8, m_BitDepth[0]);\n R() = ChangeBitDepth(rgba & 0xFF, 8, m_BitDepth[1]);\n G() = ChangeBitDepth((rgba >> 8) & 0xFF, 8, m_BitDepth[2]);\n B() = ChangeBitDepth((rgba >> 16) & 0xFF, 8, m_BitDepth[3]);\n }\n\n bool Pixel::operator==(const Pixel &other) const {\n uint8 depths[4];\n other.GetBitDepth(depths);\n\n bool ok = true;\n for(int i = 0; i < 4; i++) {\n ok = ok && m_BitDepth[i] == depths[i];\n\n uint8 mask = (1 << depths[i]) - 1;\n const ChannelType c = other.Component(i) & mask;\n ok = ok && (c == (Component(i) & mask));\n }\n return ok;\n }\n\n} \/\/ namespace FasTC\n<|endoftext|>"} {"text":"<commit_before>#include \"parser.hpp\"\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ Includes \/\/\n#include <istream>\n#include <string>\n#include <vector>\n#include <tuple>\n#include <map>\n\n#include \"parsestream.hpp\"\n#include \"streamutils.hpp\"\n#include \"json.hpp\"\n\n\/\/\/\/\/\/\/\/\/\/\n\/\/ Code \/\/\n\n\/\/ Creating a parse exception.\nParseException::ParseException(std::string type) {\n this->type = type;\n}\n\n\/\/ Returning a string to refer to this exception.\nconst char* ParseException::what() const throw() {\n return (\"Failed to parse a \" + this->type + \" piece of JSON.\").c_str();\n}\n\n\/\/ Definitions for the functions.\nJValue parseJSONObject( ParseStream&) throw (ParseException);\nJValue parseJSONArray ( ParseStream&) throw (ParseException);\nJValue parseJSONNumbe ( ParseStream&) throw (ParseException);\nJValue parseJSONString( ParseStream&) throw (ParseException);\nJValue parseJSONBool ( ParseStream&) throw (ParseException);\nJValue parseJSONNull ( ParseStream&) throw (ParseException);\n\n\/\/ Trying to specifically parse out a JSON object.\nJValue parseJSONObject(ParseStream& ps) throw(ParseException) {\n consumeWhitespace(ps);\n\n if (ps.consume() == '{') {\n std::map<std::string, JValue> valueMap;\n bool first = true;\n\n while (true) {\n consumeWhitespace(ps);\n if (first && ps.peek() == '}')\n break;\n\n std::string key = parseJSONString(ps).jString();\n consumeWhitespace(ps);\n\n if (ps.consume() != ':')\n throw ParseException(\"JObject\");\n\n consumeWhitespace(ps);\n JValue val = parseJSON(ps);\n valueMap.insert(std::pair<std::string, JValue>(key, val));\n consumeWhitespace(ps);\n\n char c = ps.consume();\n if (c == '}')\n break;\n else if (c != ',')\n throw ParseException(\"JObject\");\n }\n\n return JValue(valueMap);\n }\n\n throw ParseException(\"JObject\");\n}\n\n\/\/ Trying to specifically parse out a JSON array.\nJValue parseJSONArray(ParseStream& ps) throw(ParseException) {\n consumeWhitespace(ps);\n\n if (ps.consume() == '[') {\n std::vector<JValue> values;\n bool first = true;\n\n while (true) {\n consumeWhitespace(ps);\n if (first && ps.peek() == ']')\n break;\n\n values.push_back(parseJSON(ps));\n consumeWhitespace(ps);\n\n char c = ps.consume();\n if (c == ']')\n break;\n else if (c != ',')\n throw ParseException(\"parseJSONArray\");\n first = false;\n }\n\n return JValue(values);\n }\n\n throw ParseException(\"parseJSONArray\");\n}\n\n\/\/ Trying to specifically parse out a JSON number.\nJValue parseJSONNumber(ParseStream& ps) throw(ParseException) {\n consumeWhitespace(ps);\n\n std::string str;\n bool first = true;\n while (!ps.eof() && !isDelimiter(ps.peek())) {\n char c = ps.consume();\n\n if (first && c == '-') {\n str.push_back(c);\n first = false;\n } else if (('0' <= c && c <= '9') || c == '.')\n str.push_back(c);\n else\n throw ParseException(\"parseJSONNumber\");\n }\n\n return JValue(stod(str));\n}\n\n\/\/ Trying to specifically parse out a JSON string.\nJValue parseJSONString(ParseStream& ps) throw(ParseException) {\n consumeWhitespace(ps);\n if (ps.peek() == '\"') {\n ps.consume();\n\n std::string str;\n while (ps.peek() != '\"') {\n char c = ps.consume();\n if (c == '\\n')\n throw ParseException(\"parseJSONString\");\n\n if (c == '\\\\') {\n char c2 = ps.consume();\n\n switch (c2) {\n case '\"':\n str.push_back('\"');\n break;\n case '\\\\':\n str.push_back('\\\\');\n break;\n case '\/':\n str.push_back('\/');\n case 'b':\n str.push_back('\\b');\n break;\n case 'f':\n str.push_back('\\f');\n break;\n case 't':\n str.push_back('\\t');\n break;\n case 'r':\n str.push_back('\\r');\n break;\n case 'n':\n str.push_back('\\n');\n break;\n default:\n throw ParseException(\"parseJSONString\");\n break;\n }\n } else\n str.push_back(c);\n }\n\n ps.consume();\n return JValue(str);\n }\n\n throw ParseException(\"parseJSONString\");\n}\n\n\/\/ Trying to specifically parse out a JSON boolean.\nJValue parseJSONBool(ParseStream& ps) throw(ParseException) {\n consumeWhitespace(ps);\n std::string str;\n\n while (!ps.eof() && !isDelimiter(ps.peek()))\n str.push_back(ps.consume());\n\n if (str.compare(\"true\") == 0)\n return JValue(true);\n else if (str.compare(\"false\") == 0)\n return JValue(false);\n\n throw ParseException(\"JSONBool\");\n}\n\n\/\/ Trying to specifically parse out the null JSON value.\nJValue parseJSONNull(ParseStream& ps) throw(ParseException) {\n consumeWhitespace(ps);\n std::string str;\n\n while (!ps.eof() && !isDelimiter(ps.peek()))\n str.push_back(ps.consume());\n\n if (str.compare(\"null\") == 0)\n return JValue();\n throw ParseException(\"parseJSONNull\");\n}\n\n\/\/ Attempting to perform a parse - and then backing up on an error.\nJValue attemptParse(ParseStream& ps, JValue (*parseFn)(ParseStream&)) throw(ParseException) {\n int sl = ps.getLoc();\n try { return parseFn(ps); }\n catch (const ParseException& e) {\n ps.back(ps.getLoc() - sl);\n throw e;\n }\n}\n\n\/\/ Parsing out a block of JSON from a ParseStream.\nJValue parseJSON(ParseStream& ps) throw(ParseException) {\n std::vector<JValue (*)(ParseStream&)> fns;\n fns.push_back(&parseJSONObject);\n fns.push_back(&parseJSONArray);\n fns.push_back(&parseJSONNumber);\n fns.push_back(&parseJSONString);\n fns.push_back(&parseJSONBool);\n fns.push_back(&parseJSONNull);\n\n for (auto it = fns.begin(); it != fns.end(); it++) {\n try { return attemptParse(ps, *it); }\n catch (const ParseException& e) { }\n }\n\n throw ParseException(\"parseJSON\");\n}\n\n\/\/ Parsing out a block of JSON from a string.\nJValue parseJSON(const std::string& str) throw(ParseException) {\n ParseStream ps(str);\n return parseJSON(ps);\n}\n\n\/\/ Parsing out a block of JSON from an istream.\nJValue parseJSON(std::istream& stream) throw(ParseException) {\n std::string line, all;\n\n while (!stream.eof()) {\n std::getline(stream, line);\n all += line;\n }\n\n return parseJSON(all);\n}\n<commit_msg>Changed the exception names.<commit_after>#include \"parser.hpp\"\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ Includes \/\/\n#include <istream>\n#include <string>\n#include <vector>\n#include <tuple>\n#include <map>\n\n#include \"parsestream.hpp\"\n#include \"streamutils.hpp\"\n#include \"json.hpp\"\n\n\/\/\/\/\/\/\/\/\/\/\n\/\/ Code \/\/\n\n\/\/ Creating a parse exception.\nParseException::ParseException(std::string type) {\n this->type = type;\n}\n\n\/\/ Returning a string to refer to this exception.\nconst char* ParseException::what() const throw() {\n return (\"Failed to parse a \" + this->type + \" piece of JSON.\").c_str();\n}\n\n\/\/ Definitions for the functions.\nJValue parseJSONObject( ParseStream&) throw (ParseException);\nJValue parseJSONArray ( ParseStream&) throw (ParseException);\nJValue parseJSONNumbe ( ParseStream&) throw (ParseException);\nJValue parseJSONString( ParseStream&) throw (ParseException);\nJValue parseJSONBool ( ParseStream&) throw (ParseException);\nJValue parseJSONNull ( ParseStream&) throw (ParseException);\n\n\/\/ Trying to specifically parse out a JSON object.\nJValue parseJSONObject(ParseStream& ps) throw(ParseException) {\n consumeWhitespace(ps);\n\n if (ps.consume() == '{') {\n std::map<std::string, JValue> valueMap;\n bool first = true;\n\n while (true) {\n consumeWhitespace(ps);\n if (first && ps.peek() == '}')\n break;\n\n std::string key = parseJSONString(ps).jString();\n consumeWhitespace(ps);\n\n if (ps.consume() != ':')\n throw ParseException(\"parseJSONObject\");\n\n consumeWhitespace(ps);\n JValue val = parseJSON(ps);\n valueMap.insert(std::pair<std::string, JValue>(key, val));\n consumeWhitespace(ps);\n\n char c = ps.consume();\n if (c == '}')\n break;\n else if (c != ',')\n throw ParseException(\"parseJSONObject\");\n }\n\n return JValue(valueMap);\n }\n\n throw ParseException(\"parseJSONObject\");\n}\n\n\/\/ Trying to specifically parse out a JSON array.\nJValue parseJSONArray(ParseStream& ps) throw(ParseException) {\n consumeWhitespace(ps);\n\n if (ps.consume() == '[') {\n std::vector<JValue> values;\n bool first = true;\n\n while (true) {\n consumeWhitespace(ps);\n if (first && ps.peek() == ']')\n break;\n\n values.push_back(parseJSON(ps));\n consumeWhitespace(ps);\n\n char c = ps.consume();\n if (c == ']')\n break;\n else if (c != ',')\n throw ParseException(\"parseJSONArray\");\n first = false;\n }\n\n return JValue(values);\n }\n\n throw ParseException(\"parseJSONArray\");\n}\n\n\/\/ Trying to specifically parse out a JSON number.\nJValue parseJSONNumber(ParseStream& ps) throw(ParseException) {\n consumeWhitespace(ps);\n\n std::string str;\n bool first = true;\n while (!ps.eof() && !isDelimiter(ps.peek())) {\n char c = ps.consume();\n\n if (first && c == '-') {\n str.push_back(c);\n first = false;\n } else if (('0' <= c && c <= '9') || c == '.')\n str.push_back(c);\n else\n throw ParseException(\"parseJSONNumber\");\n }\n\n return JValue(stod(str));\n}\n\n\/\/ Trying to specifically parse out a JSON string.\nJValue parseJSONString(ParseStream& ps) throw(ParseException) {\n consumeWhitespace(ps);\n if (ps.peek() == '\"') {\n ps.consume();\n\n std::string str;\n while (ps.peek() != '\"') {\n char c = ps.consume();\n if (c == '\\n')\n throw ParseException(\"parseJSONString\");\n\n if (c == '\\\\') {\n char c2 = ps.consume();\n\n switch (c2) {\n case '\"':\n str.push_back('\"');\n break;\n case '\\\\':\n str.push_back('\\\\');\n break;\n case '\/':\n str.push_back('\/');\n case 'b':\n str.push_back('\\b');\n break;\n case 'f':\n str.push_back('\\f');\n break;\n case 't':\n str.push_back('\\t');\n break;\n case 'r':\n str.push_back('\\r');\n break;\n case 'n':\n str.push_back('\\n');\n break;\n default:\n throw ParseException(\"parseJSONString\");\n break;\n }\n } else\n str.push_back(c);\n }\n\n ps.consume();\n return JValue(str);\n }\n\n throw ParseException(\"parseJSONString\");\n}\n\n\/\/ Trying to specifically parse out a JSON boolean.\nJValue parseJSONBool(ParseStream& ps) throw(ParseException) {\n consumeWhitespace(ps);\n std::string str;\n\n while (!ps.eof() && !isDelimiter(ps.peek()))\n str.push_back(ps.consume());\n\n if (str.compare(\"true\") == 0)\n return JValue(true);\n else if (str.compare(\"false\") == 0)\n return JValue(false);\n\n throw ParseException(\"parseJSONBool\");\n}\n\n\/\/ Trying to specifically parse out the null JSON value.\nJValue parseJSONNull(ParseStream& ps) throw(ParseException) {\n consumeWhitespace(ps);\n std::string str;\n\n while (!ps.eof() && !isDelimiter(ps.peek()))\n str.push_back(ps.consume());\n\n if (str.compare(\"null\") == 0)\n return JValue();\n throw ParseException(\"parseJSONNull\");\n}\n\n\/\/ Attempting to perform a parse - and then backing up on an error.\nJValue attemptParse(ParseStream& ps, JValue (*parseFn)(ParseStream&)) throw(ParseException) {\n int sl = ps.getLoc();\n try { return parseFn(ps); }\n catch (const ParseException& e) {\n ps.back(ps.getLoc() - sl);\n throw e;\n }\n}\n\n\/\/ Parsing out a block of JSON from a ParseStream.\nJValue parseJSON(ParseStream& ps) throw(ParseException) {\n std::vector<JValue (*)(ParseStream&)> fns;\n fns.push_back(&parseJSONObject);\n fns.push_back(&parseJSONArray);\n fns.push_back(&parseJSONNumber);\n fns.push_back(&parseJSONString);\n fns.push_back(&parseJSONBool);\n fns.push_back(&parseJSONNull);\n\n for (auto it = fns.begin(); it != fns.end(); it++) {\n try { return attemptParse(ps, *it); }\n catch (const ParseException& e) { }\n }\n\n throw ParseException(\"parseJSON\");\n}\n\n\/\/ Parsing out a block of JSON from a string.\nJValue parseJSON(const std::string& str) throw(ParseException) {\n ParseStream ps(str);\n return parseJSON(ps);\n}\n\n\/\/ Parsing out a block of JSON from an istream.\nJValue parseJSON(std::istream& stream) throw(ParseException) {\n std::string line, all;\n\n while (!stream.eof()) {\n std::getline(stream, line);\n all += line;\n }\n\n return parseJSON(all);\n}\n<|endoftext|>"} {"text":"<commit_before><commit_msg>lib: reset the DBus proxy when registration failed<commit_after><|endoftext|>"} {"text":"<commit_before>\/*************************************************************************\n *\n * $RCSfile: excdefs.hxx,v $\n *\n * $Revision: 1.41 $\n *\n * last change: $Author: rt $ $Date: 2004-03-02 09:41: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 _EXCDEFS_HXX\n#define _EXCDEFS_HXX\n\n#ifndef _SAL_TYPES_H_\n#include <sal\/types.h>\n#endif\n\n\/\/ (0x001C) NOTE ==============================================================\n\n#define EXC_NOTE5_MAXTEXT 2048\n\n\/\/ (0x0031) FONT ==============================================================\n\n\/\/ color\n#define EXC_FONTCOL_IGNORE 0x7FFF\n\n\/\/ height\n#define EXC_FONTHGHT_COEFF 20.0\n\n\/\/ (0x0092) PALETTE ===========================================================\n\n\/\/ special color indices\n#define EXC_COLIND_AUTOTEXT 77\n#define EXC_COLIND_AUTOLINE 77\n#define EXC_COLIND_AUTOFILLBG 77\n#define EXC_COLIND_AUTOFILLFG 78\n\n\/\/ (0x009B, 0x009D, 0x009E) AUTOFILTER ========================================\n\n\/\/ flags\n#define EXC_AFFLAG_AND 0x0000\n#define EXC_AFFLAG_OR 0x0001\n#define EXC_AFFLAG_ANDORMASK 0x0003\n#define EXC_AFFLAG_SIMPLE1 0x0004\n#define EXC_AFFLAG_SIMPLE2 0x0008\n#define EXC_AFFLAG_TOP10 0x0010\n#define EXC_AFFLAG_TOP10TOP 0x0020\n#define EXC_AFFLAG_TOP10PERC 0x0040\n\n\/\/ data types\n#define EXC_AFTYPE_NOTUSED 0x00\n#define EXC_AFTYPE_RK 0x02\n#define EXC_AFTYPE_DOUBLE 0x04\n#define EXC_AFTYPE_STRING 0x06\n#define EXC_AFTYPE_BOOLERR 0x08\n#define EXC_AFTYPE_INVALID 0x0A\n#define EXC_AFTYPE_EMPTY 0x0C\n#define EXC_AFTYPE_NOTEMPTY 0x0E\n\n\/\/ comparison operands\n#define EXC_AFOPER_NONE 0x00\n#define EXC_AFOPER_LESS 0x01\n#define EXC_AFOPER_EQUAL 0x02\n#define EXC_AFOPER_LESSEQUAL 0x03\n#define EXC_AFOPER_GREATER 0x04\n#define EXC_AFOPER_NOTEQUAL 0x05\n#define EXC_AFOPER_GREATEREQUAL 0x06\n\n\/\/ (0x00AE, 0x00AF) SCENARIO, SCENMAN =========================================\n\n#define EXC_SCEN_MAXCELL 32\n\n\/\/ (0x00E5) CELLMERGING =======================================================\n\n#define EXC_MERGE_MAXCOUNT 1024\n\n\/\/ (0x0208) ROW ===============================================================\n\n\/\/ flags\n#define EXC_ROW_COLLAPSED 0x0010\n#define EXC_ROW_ZEROHEIGHT 0x0020\n#define EXC_ROW_UNSYNCED 0x0040\n#define EXC_ROW_GHOSTDIRTY 0x0080\n#define EXC_ROW_XFMASK 0x0FFF\n\n\/\/ outline\n#define EXC_ROW_LEVELFLAGS(nOL) (nOL & 0x0007)\n#define EXC_ROW_GETLEVEL(nFlag) (nFlag & 0x0007)\n\n\/\/ unknown, always save\n#define EXC_ROW_FLAGCOMMON 0x0100\n\n\/\/ row height\n#define EXC_ROW_VALZEROHEIGHT 0x00FF\n#define EXC_ROW_FLAGDEFHEIGHT 0x8000\n\n\/\/ (0x0236) TABLE =============================================================\n\n#define EXC_TABOP_CALCULATE 0x0003\n#define EXC_TABOP_ROW 0x0004\n#define EXC_TABOP_BOTH 0x0008\n\n\/\/ (0x023E) WINDOW2 ===========================================================\n\n#define EXC_WIN2_SHOWFORMULAS 0x0001\n#define EXC_WIN2_SHOWGRID 0x0002\n#define EXC_WIN2_SHOWHEADINGS 0x0004\n#define EXC_WIN2_FROZEN 0x0008\n#define EXC_WIN2_SHOWZEROS 0x0010\n#define EXC_WIN2_DEFAULTCOLOR 0x0020\nconst sal_uInt16 EXC_WIN2_MIRRORED = 0x0040;\n#define EXC_WIN2_OUTLINE 0x0080\n#define EXC_WIN2_FROZENNOSPLIT 0x0100\n#define EXC_WIN2_SELECTED 0x0200\n#define EXC_WIN2_DISPLAYED 0x0400\n\n\/\/ Specials for outlines ======================================================\n\n#define EXC_OUTLINE_MAX 7\n#define EXC_OUTLINE_COUNT (EXC_OUTLINE_MAX + 1)\n\n\/\/ data pilot \/ pivot tables ==================================================\n\n\/\/ subtotal functions\n#define EXC_PIVOT_SUBT_SUM 0x0000\n#define EXC_PIVOT_SUBT_COUNT 0x0001\n#define EXC_PIVOT_SUBT_AVERAGE 0x0002\n#define EXC_PIVOT_SUBT_MAX 0x0003\n#define EXC_PIVOT_SUBT_MIN 0x0004\n#define EXC_PIVOT_SUBT_PROD 0x0005\n#define EXC_PIVOT_SUBT_COUNTNUM 0x0006\n#define EXC_PIVOT_SUBT_STDDEV 0x0007\n#define EXC_PIVOT_SUBT_STDDEVP 0x0008\n#define EXC_PIVOT_SUBT_VAR 0x0009\n#define EXC_PIVOT_SUBT_VARP 0x000A\n\n\/\/ field orientation\n#define EXC_PIVOT_AXIS_NONE 0x0000\n#define EXC_PIVOT_AXIS_ROW 0x0001\n#define EXC_PIVOT_AXIS_COL 0x0002\n#define EXC_PIVOT_AXIS_PAGE 0x0004\n#define EXC_PIVOT_AXIS_DATA 0x0008\n#define EXC_PIVOT_AXIS_RCP_MASK (EXC_PIVOT_AXIS_ROW|EXC_PIVOT_AXIS_COL|EXC_PIVOT_AXIS_PAGE)\n\n\/\/ misc xcl record flags\n#define EXC_SXVIEW_COMMON 0x0208\n#define EXC_SXVIEW_ROWGRAND 0x0001\n#define EXC_SXVIEW_COLGRAND 0x0002\n\n#define EXC_SXVDEX_COMMON 0x0A00141E\n#define EXC_SXVDEX_SHOWALL 0x00000001\n\n#define EXC_SXVI_HIDDEN 0x0001\n#define EXC_SXVI_HIDEDETAIL 0x0002\n#define EXC_SXVI_FORMULA 0x0004\n#define EXC_SXVI_MISSING 0x0008\n\n#define EXC_SXVS_EXCEL 0x0001\n#define EXC_SXVS_EXTERN 0x0002\n#define EXC_SXVS_MULTICONSR 0x0004\n#define EXC_SXVS_PIVOTTAB 0x0008\n#define EXC_SXVS_SCENMAN 0x0010\n\n#define EXC_SXIVD_IDDATA 0xFFFE\n\n\/\/ pivot cache record flags\n#define EXC_SXFIELD_COMMON 0x0001\n#define EXC_SXFIELD_READLATER 0x0002\n#define EXC_SXFIELD_16BIT 0x0200\n\n#define EXC_SXITEM_\n\n\/\/ defines for change tracking ================================================\n\n\/\/ opcodes\n#define EXC_CHTR_OP_COLFLAG 0x0001\n#define EXC_CHTR_OP_DELFLAG 0x0002\n#define EXC_CHTR_OP_INSROW 0x0000\n#define EXC_CHTR_OP_INSCOL EXC_CHTR_OP_COLFLAG\n#define EXC_CHTR_OP_DELROW EXC_CHTR_OP_DELFLAG\n#define EXC_CHTR_OP_DELCOL (EXC_CHTR_OP_COLFLAG|EXC_CHTR_OP_DELFLAG)\n#define EXC_CHTR_OP_MOVE 0x0004\n#define EXC_CHTR_OP_INSTAB 0x0005\n#define EXC_CHTR_OP_CELL 0x0008\n#define EXC_CHTR_OP_RENAME 0x0009\n#define EXC_CHTR_OP_NAME 0x000A\n#define EXC_CHTR_OP_FORMAT 0x000B\n#define EXC_CHTR_OP_UNKNOWN 0xFFFF\n\n\/\/ data types\n#define EXC_CHTR_TYPE_MASK 0x0007\n#define EXC_CHTR_TYPE_FORMATMASK 0xFF00\n#define EXC_CHTR_TYPE_EMPTY 0x0000\n#define EXC_CHTR_TYPE_RK 0x0001\n#define EXC_CHTR_TYPE_DOUBLE 0x0002\n#define EXC_CHTR_TYPE_STRING 0x0003\n#define EXC_CHTR_TYPE_BOOL 0x0004\n#define EXC_CHTR_TYPE_FORMULA 0x0005\n\n\/\/ accept flags\n#define EXC_CHTR_NOTHING 0x0000\n#define EXC_CHTR_ACCEPT 0x0001\n#define EXC_CHTR_REJECT 0x0003\n\n\/\/ ============================================================================\n\n#endif \/\/ _EXCDEFS_HXX\n\n<commit_msg>INTEGRATION: CWS pagefields (1.39.156); FILE MERGED 2004\/03\/30 14:53:41 sab 1.39.156.4: RESYNC: (1.40-1.41); FILE MERGED 2004\/03\/03 10:29:52 sab 1.39.156.3: RESYNC: (1.39-1.40); FILE MERGED 2004\/02\/27 17:30:14 dr 1.39.156.2: #i22164# export of DP page field selection 2004\/02\/27 12:26:16 dr 1.39.156.1: #i22164# import of DP page field selection<commit_after>\/*************************************************************************\n *\n * $RCSfile: excdefs.hxx,v $\n *\n * $Revision: 1.42 $\n *\n * last change: $Author: hr $ $Date: 2004-04-13 12:27: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 _EXCDEFS_HXX\n#define _EXCDEFS_HXX\n\n#ifndef _SAL_TYPES_H_\n#include <sal\/types.h>\n#endif\n\n\/\/ (0x001C) NOTE ==============================================================\n\n#define EXC_NOTE5_MAXTEXT 2048\n\n\/\/ (0x0031) FONT ==============================================================\n\n\/\/ color\n#define EXC_FONTCOL_IGNORE 0x7FFF\n\n\/\/ height\n#define EXC_FONTHGHT_COEFF 20.0\n\n\/\/ (0x0092) PALETTE ===========================================================\n\n\/\/ special color indices\n#define EXC_COLIND_AUTOTEXT 77\n#define EXC_COLIND_AUTOLINE 77\n#define EXC_COLIND_AUTOFILLBG 77\n#define EXC_COLIND_AUTOFILLFG 78\n\n\/\/ (0x009B, 0x009D, 0x009E) AUTOFILTER ========================================\n\n\/\/ flags\n#define EXC_AFFLAG_AND 0x0000\n#define EXC_AFFLAG_OR 0x0001\n#define EXC_AFFLAG_ANDORMASK 0x0003\n#define EXC_AFFLAG_SIMPLE1 0x0004\n#define EXC_AFFLAG_SIMPLE2 0x0008\n#define EXC_AFFLAG_TOP10 0x0010\n#define EXC_AFFLAG_TOP10TOP 0x0020\n#define EXC_AFFLAG_TOP10PERC 0x0040\n\n\/\/ data types\n#define EXC_AFTYPE_NOTUSED 0x00\n#define EXC_AFTYPE_RK 0x02\n#define EXC_AFTYPE_DOUBLE 0x04\n#define EXC_AFTYPE_STRING 0x06\n#define EXC_AFTYPE_BOOLERR 0x08\n#define EXC_AFTYPE_INVALID 0x0A\n#define EXC_AFTYPE_EMPTY 0x0C\n#define EXC_AFTYPE_NOTEMPTY 0x0E\n\n\/\/ comparison operands\n#define EXC_AFOPER_NONE 0x00\n#define EXC_AFOPER_LESS 0x01\n#define EXC_AFOPER_EQUAL 0x02\n#define EXC_AFOPER_LESSEQUAL 0x03\n#define EXC_AFOPER_GREATER 0x04\n#define EXC_AFOPER_NOTEQUAL 0x05\n#define EXC_AFOPER_GREATEREQUAL 0x06\n\n\/\/ (0x00AE, 0x00AF) SCENARIO, SCENMAN =========================================\n\n#define EXC_SCEN_MAXCELL 32\n\n\/\/ (0x00E5) CELLMERGING =======================================================\n\n#define EXC_MERGE_MAXCOUNT 1024\n\n\/\/ (0x0208) ROW ===============================================================\n\n\/\/ flags\n#define EXC_ROW_COLLAPSED 0x0010\n#define EXC_ROW_ZEROHEIGHT 0x0020\n#define EXC_ROW_UNSYNCED 0x0040\n#define EXC_ROW_GHOSTDIRTY 0x0080\n#define EXC_ROW_XFMASK 0x0FFF\n\n\/\/ outline\n#define EXC_ROW_LEVELFLAGS(nOL) (nOL & 0x0007)\n#define EXC_ROW_GETLEVEL(nFlag) (nFlag & 0x0007)\n\n\/\/ unknown, always save\n#define EXC_ROW_FLAGCOMMON 0x0100\n\n\/\/ row height\n#define EXC_ROW_VALZEROHEIGHT 0x00FF\n#define EXC_ROW_FLAGDEFHEIGHT 0x8000\n\n\/\/ (0x0236) TABLE =============================================================\n\n#define EXC_TABOP_CALCULATE 0x0003\n#define EXC_TABOP_ROW 0x0004\n#define EXC_TABOP_BOTH 0x0008\n\n\/\/ (0x023E) WINDOW2 ===========================================================\n\n#define EXC_WIN2_SHOWFORMULAS 0x0001\n#define EXC_WIN2_SHOWGRID 0x0002\n#define EXC_WIN2_SHOWHEADINGS 0x0004\n#define EXC_WIN2_FROZEN 0x0008\n#define EXC_WIN2_SHOWZEROS 0x0010\n#define EXC_WIN2_DEFAULTCOLOR 0x0020\nconst sal_uInt16 EXC_WIN2_MIRRORED = 0x0040;\n#define EXC_WIN2_OUTLINE 0x0080\n#define EXC_WIN2_FROZENNOSPLIT 0x0100\n#define EXC_WIN2_SELECTED 0x0200\n#define EXC_WIN2_DISPLAYED 0x0400\n\n\/\/ Specials for outlines ======================================================\n\n#define EXC_OUTLINE_MAX 7\n#define EXC_OUTLINE_COUNT (EXC_OUTLINE_MAX + 1)\n\n\/\/ data pilot \/ pivot tables ==================================================\n\n\/\/ subtotal functions\n#define EXC_PIVOT_SUBT_SUM 0x0000\n#define EXC_PIVOT_SUBT_COUNT 0x0001\n#define EXC_PIVOT_SUBT_AVERAGE 0x0002\n#define EXC_PIVOT_SUBT_MAX 0x0003\n#define EXC_PIVOT_SUBT_MIN 0x0004\n#define EXC_PIVOT_SUBT_PROD 0x0005\n#define EXC_PIVOT_SUBT_COUNTNUM 0x0006\n#define EXC_PIVOT_SUBT_STDDEV 0x0007\n#define EXC_PIVOT_SUBT_STDDEVP 0x0008\n#define EXC_PIVOT_SUBT_VAR 0x0009\n#define EXC_PIVOT_SUBT_VARP 0x000A\n\n\/\/ field orientation\n#define EXC_PIVOT_AXIS_NONE 0x0000\n#define EXC_PIVOT_AXIS_ROW 0x0001\n#define EXC_PIVOT_AXIS_COL 0x0002\n#define EXC_PIVOT_AXIS_PAGE 0x0004\n#define EXC_PIVOT_AXIS_DATA 0x0008\n#define EXC_PIVOT_AXIS_RCP_MASK (EXC_PIVOT_AXIS_ROW|EXC_PIVOT_AXIS_COL|EXC_PIVOT_AXIS_PAGE)\n\n\/\/ misc xcl record flags\n#define EXC_SXVIEW_COMMON 0x0208\n#define EXC_SXVIEW_ROWGRAND 0x0001\n#define EXC_SXVIEW_COLGRAND 0x0002\n\n#define EXC_SXVDEX_COMMON 0x0A00141E\n#define EXC_SXVDEX_SHOWALL 0x00000001\n\n#define EXC_SXVI_HIDDEN 0x0001\n#define EXC_SXVI_HIDEDETAIL 0x0002\n#define EXC_SXVI_FORMULA 0x0004\n#define EXC_SXVI_MISSING 0x0008\n\n#define EXC_SXVS_EXCEL 0x0001\n#define EXC_SXVS_EXTERN 0x0002\n#define EXC_SXVS_MULTICONSR 0x0004\n#define EXC_SXVS_PIVOTTAB 0x0008\n#define EXC_SXVS_SCENMAN 0x0010\n\n#define EXC_SXIVD_IDDATA 0xFFFE\n\nconst sal_uInt16 EXC_ID_SXPI = 0x00B6;\nconst sal_uInt16 EXC_SXPI_ALLITEMS = 0x7FFD;\n\n\/\/ pivot cache record flags\n#define EXC_SXFIELD_COMMON 0x0001\n#define EXC_SXFIELD_READLATER 0x0002\n#define EXC_SXFIELD_16BIT 0x0200\n\n\/\/ defines for change tracking ================================================\n\n\/\/ opcodes\n#define EXC_CHTR_OP_COLFLAG 0x0001\n#define EXC_CHTR_OP_DELFLAG 0x0002\n#define EXC_CHTR_OP_INSROW 0x0000\n#define EXC_CHTR_OP_INSCOL EXC_CHTR_OP_COLFLAG\n#define EXC_CHTR_OP_DELROW EXC_CHTR_OP_DELFLAG\n#define EXC_CHTR_OP_DELCOL (EXC_CHTR_OP_COLFLAG|EXC_CHTR_OP_DELFLAG)\n#define EXC_CHTR_OP_MOVE 0x0004\n#define EXC_CHTR_OP_INSTAB 0x0005\n#define EXC_CHTR_OP_CELL 0x0008\n#define EXC_CHTR_OP_RENAME 0x0009\n#define EXC_CHTR_OP_NAME 0x000A\n#define EXC_CHTR_OP_FORMAT 0x000B\n#define EXC_CHTR_OP_UNKNOWN 0xFFFF\n\n\/\/ data types\n#define EXC_CHTR_TYPE_MASK 0x0007\n#define EXC_CHTR_TYPE_FORMATMASK 0xFF00\n#define EXC_CHTR_TYPE_EMPTY 0x0000\n#define EXC_CHTR_TYPE_RK 0x0001\n#define EXC_CHTR_TYPE_DOUBLE 0x0002\n#define EXC_CHTR_TYPE_STRING 0x0003\n#define EXC_CHTR_TYPE_BOOL 0x0004\n#define EXC_CHTR_TYPE_FORMULA 0x0005\n\n\/\/ accept flags\n#define EXC_CHTR_NOTHING 0x0000\n#define EXC_CHTR_ACCEPT 0x0001\n#define EXC_CHTR_REJECT 0x0003\n\n\/\/ ============================================================================\n\n#endif \/\/ _EXCDEFS_HXX\n\n<|endoftext|>"} {"text":"<commit_before>\/*************************************************************************\n *\n * $RCSfile: viewcontactofsdrmediaobj.hxx,v $\n *\n * $Revision: 1.3 $\n *\n * last change: $Author: hr $ $Date: 2004-10-12 10:04:42 $\n *\n * The Contents of this file are made available subject to the terms of\n * either of the following licenses\n *\n * - GNU Lesser General Public License Version 2.1\n * - Sun Industry Standards Source License Version 1.1\n *\n * Sun Microsystems Inc., October, 2000\n *\n * GNU Lesser General Public License Version 2.1\n * =============================================\n * Copyright 2000 by Sun Microsystems, Inc.\n * 901 San Antonio Road, Palo Alto, CA 94303, USA\n *\n * This library is free software; you can redistribute it and\/or\n * modify it under the terms of the GNU Lesser General Public\n * License version 2.1, as published by the Free Software Foundation.\n *\n * This library is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU\n * Lesser General Public License for more details.\n *\n * You should have received a copy of the GNU Lesser General Public\n * License along with this library; if not, write to the Free Software\n * Foundation, Inc., 59 Temple Place, Suite 330, Boston,\n * MA 02111-1307 USA\n *\n *\n * Sun Industry Standards Source License Version 1.1\n * =================================================\n * The contents of this file are subject to the Sun Industry Standards\n * Source License Version 1.1 (the \"License\"); You may not use this file\n * except in compliance with the License. You may obtain a copy of the\n * License at http:\/\/www.openoffice.org\/license.html.\n *\n * Software provided under this License is provided on an \"AS IS\" basis,\n * WITHOUT WARRANTY OF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING,\n * WITHOUT LIMITATION, WARRANTIES THAT THE SOFTWARE IS FREE OF DEFECTS,\n * MERCHANTABLE, FIT FOR A PARTICULAR PURPOSE, OR NON-INFRINGING.\n * See the License for the specific provisions governing your rights and\n * obligations concerning the Software.\n *\n * The Initial Developer of the Original Code is: Sun Microsystems, Inc.\n *\n * Copyright: 2000 by Sun Microsystems, Inc.\n *\n * All Rights Reserved.\n *\n * Contributor(s): _______________________________________\n *\n *\n ************************************************************************\/\n\n#ifndef _SDR_CONTACT_VIEWCONTACTOFSDRMEDIAOBJ_HXX\n#define _SDR_CONTACT_VIEWCONTACTOFSDRMEDIAOBJ_HXX\n\n#ifndef _SDR_CONTACT_VIEWCONTACTOFSDROBJ_HXX\n#include <svx\/sdr\/contact\/viewcontactofsdrobj.hxx>\n#endif\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ predeclarations\n\nclass SdrMediaObj;\nnamespace avmedia { class MediaItem; }\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nnamespace sdr\n{\n namespace contact\n {\n class ViewContactOfSdrMediaObj : public ViewContactOfSdrObj\n {\n friend class ViewObjectContactOfSdrMediaObj;\n\n public:\n\n \/\/ basic constructor, used from SdrObject.\n ViewContactOfSdrMediaObj( SdrMediaObj& rMediaObj );\n\n \/\/ The destructor. When PrepareDelete() was not called before (see there)\n \/\/ warnings will be generated in debug version if there are still contacts\n \/\/ existing.\n virtual ~ViewContactOfSdrMediaObj();\n\n \/\/ Paint this object. This is before evtl. SubObjects get painted. It needs to return\n \/\/ sal_True when something was pained and the paint output rectangle in rPaintRectangle.\n virtual sal_Bool PaintObject(DisplayInfo& rDisplayInfo, Rectangle& rPaintRectangle, const ViewObjectContact& rAssociatedVOC);\n\n public:\n\n bool hasPreferredSize() const;\n Size getPreferredSize() const;\n\n void updateMediaItem( ::avmedia::MediaItem& rItem ) const;\n void executeMediaItem( const ::avmedia::MediaItem& rItem );\n\n protected:\n\n \/\/ Create a Object-Specific ViewObjectContact, set ViewContact and\n \/\/ ObjectContact. Always needs to return something.\n virtual ViewObjectContact& CreateObjectSpecificViewObjectContact(ObjectContact& rObjectContact);\n\n \/\/ get notified if some properties have changed\n virtual void mediaPropertiesChanged( const ::avmedia::MediaItem& rNewState );\n };\n } \/\/ end of namespace contact\n} \/\/ end of namespace sdr\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n#endif \/\/_SDR_CONTACT_VIEWCONTACTOFSDRMEDIAOBJ_HXX\n<commit_msg>INTEGRATION: CWS visibility01 (1.3.8); FILE MERGED 2004\/11\/19 12:54:51 mmeeks 1.3.8.1: Issue number: #i35758# Submitted by: mnicel Reviewed by: mmeeks<commit_after>\/*************************************************************************\n *\n * $RCSfile: viewcontactofsdrmediaobj.hxx,v $\n *\n * $Revision: 1.4 $\n *\n * last change: $Author: kz $ $Date: 2005-01-21 16:21:10 $\n *\n * The Contents of this file are made available subject to the terms of\n * either of the following licenses\n *\n * - GNU Lesser General Public License Version 2.1\n * - Sun Industry Standards Source License Version 1.1\n *\n * Sun Microsystems Inc., October, 2000\n *\n * GNU Lesser General Public License Version 2.1\n * =============================================\n * Copyright 2000 by Sun Microsystems, Inc.\n * 901 San Antonio Road, Palo Alto, CA 94303, USA\n *\n * This library is free software; you can redistribute it and\/or\n * modify it under the terms of the GNU Lesser General Public\n * License version 2.1, as published by the Free Software Foundation.\n *\n * This library is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU\n * Lesser General Public License for more details.\n *\n * You should have received a copy of the GNU Lesser General Public\n * License along with this library; if not, write to the Free Software\n * Foundation, Inc., 59 Temple Place, Suite 330, Boston,\n * MA 02111-1307 USA\n *\n *\n * Sun Industry Standards Source License Version 1.1\n * =================================================\n * The contents of this file are subject to the Sun Industry Standards\n * Source License Version 1.1 (the \"License\"); You may not use this file\n * except in compliance with the License. You may obtain a copy of the\n * License at http:\/\/www.openoffice.org\/license.html.\n *\n * Software provided under this License is provided on an \"AS IS\" basis,\n * WITHOUT WARRANTY OF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING,\n * WITHOUT LIMITATION, WARRANTIES THAT THE SOFTWARE IS FREE OF DEFECTS,\n * MERCHANTABLE, FIT FOR A PARTICULAR PURPOSE, OR NON-INFRINGING.\n * See the License for the specific provisions governing your rights and\n * obligations concerning the Software.\n *\n * The Initial Developer of the Original Code is: Sun Microsystems, Inc.\n *\n * Copyright: 2000 by Sun Microsystems, Inc.\n *\n * All Rights Reserved.\n *\n * Contributor(s): _______________________________________\n *\n *\n ************************************************************************\/\n\n#ifndef _SDR_CONTACT_VIEWCONTACTOFSDRMEDIAOBJ_HXX\n#define _SDR_CONTACT_VIEWCONTACTOFSDRMEDIAOBJ_HXX\n\n#ifndef _SDR_CONTACT_VIEWCONTACTOFSDROBJ_HXX\n#include <svx\/sdr\/contact\/viewcontactofsdrobj.hxx>\n#endif\n\n#ifndef INCLUDED_SVXDLLAPI_H\n#include \"svx\/svxdllapi.h\"\n#endif\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ predeclarations\n\nclass SdrMediaObj;\nnamespace avmedia { class MediaItem; }\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nnamespace sdr\n{\n namespace contact\n {\n class SVX_DLLPUBLIC ViewContactOfSdrMediaObj : public ViewContactOfSdrObj\n {\n friend class ViewObjectContactOfSdrMediaObj;\n\n public:\n\n \/\/ basic constructor, used from SdrObject.\n ViewContactOfSdrMediaObj( SdrMediaObj& rMediaObj );\n\n \/\/ The destructor. When PrepareDelete() was not called before (see there)\n \/\/ warnings will be generated in debug version if there are still contacts\n \/\/ existing.\n virtual ~ViewContactOfSdrMediaObj();\n\n \/\/ Paint this object. This is before evtl. SubObjects get painted. It needs to return\n \/\/ sal_True when something was pained and the paint output rectangle in rPaintRectangle.\n virtual sal_Bool PaintObject(DisplayInfo& rDisplayInfo, Rectangle& rPaintRectangle, const ViewObjectContact& rAssociatedVOC);\n\n public:\n\n bool hasPreferredSize() const;\n Size getPreferredSize() const;\n\n void updateMediaItem( ::avmedia::MediaItem& rItem ) const;\n void executeMediaItem( const ::avmedia::MediaItem& rItem );\n\n protected:\n\n \/\/ Create a Object-Specific ViewObjectContact, set ViewContact and\n \/\/ ObjectContact. Always needs to return something.\n virtual ViewObjectContact& CreateObjectSpecificViewObjectContact(ObjectContact& rObjectContact);\n\n \/\/ get notified if some properties have changed\n virtual void mediaPropertiesChanged( const ::avmedia::MediaItem& rNewState );\n };\n } \/\/ end of namespace contact\n} \/\/ end of namespace sdr\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n#endif \/\/_SDR_CONTACT_VIEWCONTACTOFSDRMEDIAOBJ_HXX\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\n\/\/\/ Copy of stats from buffer_user.cpp\nclass Stats{\n public:\n unsigned int up;\n unsigned int down;\n std::string host;\n std::string connector;\n unsigned int conntime;\n Stats(){\n up = 0; down = 0; conntime = 0;\n };\n \/\/\/ Reads a stats string and parses it to the internal representation.\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\n\n\/\/\/ Gets the current system time in milliseconds.\nlong long int getNowMS(){\n timeval t;\n gettimeofday(&t, 0);\n return t.tv_sec * 1000 + t.tv_usec\/1000;\n}\/\/getNowMS\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 DTSC::File source = DTSC::File(conf.getString(\"filename\"));\n Socket::Connection in_out = Socket::Connection(fileno(stdout), fileno(stdin));\n std::string meta_str = source.getHeader();\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\n \/\/send the header\n {\n in_out.Send(\"DTSC\");\n unsigned int size = htonl(meta_str.size());\n in_out.Send((char*)&size, 4);\n in_out.Send(meta_str);\n }\n\n JSON::Value meta = JSON::fromDTMI(meta_str);\n JSON::Value last_pack;\n\n bool meta_sent = false;\n long long now, timeDiff = 0, lastTime = 0;\n Stats sts;\n\n while (in_out.connected() && std::cin.good() && std::cout.good()){\n if (in_out.spool()){\n while (in_out.Received().find('\\n') != std::string::npos){\n std::string cmd = in_out.Received().substr(0, in_out.Received().find('\\n'));\n in_out.Received().erase(0, in_out.Received().find('\\n')+1);\n if (cmd != \"\"){\n switch (cmd[0]){\n case 'P':{ \/\/Push\n #if DEBUG >= 4\n std::cerr << \"Received push - ignoring (\" << cmd << \")\" << std::endl;\n #endif\n in_out.close();\/\/pushing to VoD makes no sense\n } break;\n case 'S':{ \/\/Stats\n if (!StatsSocket.connected()){\n StatsSocket = Socket::Connection(\"\/tmp\/mist\/statistics\", true);\n }\n if (StatsSocket.connected()){\n sts = Stats(cmd.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\"] = (long long int)time(0);\n json_sts[\"vod\"][\"start\"] = (long long int)(time(0) - sts.conntime);\n if (!meta_sent){\n json_sts[\"vod\"][\"meta\"] = meta;\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 case 's':{ \/\/second-seek\n #if DEBUG >= 4\n std::cerr << \"Received ms-seek (\" << cmd << \")\" << std::endl;\n #endif\n int ms = JSON::Value(cmd.substr(2)).asInt();\n bool ret = source.seek_time(ms);\n #if DEBUG >= 4\n std::cerr << \"Second-seek completed (time \" << ms << \"ms) \" << ret << std::endl;\n #endif\n } break;\n case 'f':{ \/\/frame-seek\n #if DEBUG >= 4\n std::cerr << \"Received frame-seek (\" << cmd << \")\" << std::endl;\n #endif\n bool ret = source.seek_frame(JSON::Value(cmd.substr(2)).asInt());\n #if DEBUG >= 4\n std::cerr << \"Frame-seek completed \" << ret << std::endl;\n #endif\n } break;\n case 'p':{ \/\/play\n #if DEBUG >= 4\n std::cerr << \"Received play\" << std::endl;\n #endif\n playing = -1;\n in_out.setBlocking(false);\n } break;\n case 'o':{ \/\/once-play\n #if DEBUG >= 4\n std::cerr << \"Received once-play\" << std::endl;\n #endif\n if (playing <= 0){playing = 1;}\n ++playing;\n in_out.setBlocking(false);\n } break;\n case 'q':{ \/\/quit-playing\n #if DEBUG >= 4\n std::cerr << \"Received quit-playing\" << std::endl;\n #endif\n playing = 0;\n in_out.setBlocking(true);\n } break;\n }\n }\n }\n }\n if (playing != 0){\n now = getNowMS();\n if (playing > 0 || now - timeDiff >= lastTime || lastTime - (now - timeDiff) > 15000) {\n source.seekNext();\n lastTime = source.getJSON()[\"time\"].asInt();\n if ((now - timeDiff - lastTime) > 5000 || (now - timeDiff - lastTime < -5000)){\n timeDiff = now - lastTime;\n }\n if (source.getJSON().isMember(\"keyframe\")){\n if (playing > 0){--playing;}\n if (playing == 0){\n #if DEBUG >= 4\n std::cerr << \"Sending pause_marker\" << std::endl;\n #endif\n pausemark[\"time\"] = (long long int)now;\n pausemark.toPacked();\n in_out.Send(pausemark.toNetPacked());\n in_out.flush();\n in_out.setBlocking(true);\n }\n }\n if (playing != 0){\n \/\/insert proper header for this type of data\n in_out.Send(\"DTPD\");\n \/\/insert the packet length\n unsigned int size = htonl(source.getPacket().size());\n in_out.Send((char*)&size, 4);\n in_out.Send(source.getPacket());\n }\n } else {\n usleep(std::min(10000LL, lastTime - (now - timeDiff)) * 1000);\n }\n }\n usleep(10000);\/\/sleep 10ms\n }\n\n StatsSocket.close();\n return 0;\n}\n<commit_msg>Fixed MistPlayer not shutting down.<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\n\/\/\/ Copy of stats from buffer_user.cpp\nclass Stats{\n public:\n unsigned int up;\n unsigned int down;\n std::string host;\n std::string connector;\n unsigned int conntime;\n Stats(){\n up = 0; down = 0; conntime = 0;\n };\n \/\/\/ Reads a stats string and parses it to the internal representation.\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\n\n\/\/\/ Gets the current system time in milliseconds.\nlong long int getNowMS(){\n timeval t;\n gettimeofday(&t, 0);\n return t.tv_sec * 1000 + t.tv_usec\/1000;\n}\/\/getNowMS\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 DTSC::File source = DTSC::File(conf.getString(\"filename\"));\n Socket::Connection in_out = Socket::Connection(fileno(stdout), fileno(stdin));\n std::string meta_str = source.getHeader();\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 = time(0);\n\n \/\/send the header\n {\n in_out.Send(\"DTSC\");\n unsigned int size = htonl(meta_str.size());\n in_out.Send((char*)&size, 4);\n in_out.Send(meta_str);\n }\n\n JSON::Value meta = JSON::fromDTMI(meta_str);\n JSON::Value last_pack;\n\n bool meta_sent = false;\n long long now, timeDiff = 0, lastTime = 0;\n Stats sts;\n\n while (in_out.connected() && std::cin.good() && std::cout.good() && (time(0) - lasttime < 60)){\n if (in_out.spool()){\n while (in_out.Received().find('\\n') != std::string::npos){\n std::string cmd = in_out.Received().substr(0, in_out.Received().find('\\n'));\n in_out.Received().erase(0, in_out.Received().find('\\n')+1);\n if (cmd != \"\"){\n switch (cmd[0]){\n case 'P':{ \/\/Push\n #if DEBUG >= 4\n std::cerr << \"Received push - ignoring (\" << cmd << \")\" << std::endl;\n #endif\n in_out.close();\/\/pushing to VoD makes no sense\n } break;\n case 'S':{ \/\/Stats\n if (!StatsSocket.connected()){\n StatsSocket = Socket::Connection(\"\/tmp\/mist\/statistics\", true);\n }\n if (StatsSocket.connected()){\n sts = Stats(cmd.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\"] = (long long int)time(0);\n json_sts[\"vod\"][\"start\"] = (long long int)(time(0) - sts.conntime);\n if (!meta_sent){\n json_sts[\"vod\"][\"meta\"] = meta;\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 case 's':{ \/\/second-seek\n #if DEBUG >= 4\n std::cerr << \"Received ms-seek (\" << cmd << \")\" << std::endl;\n #endif\n int ms = JSON::Value(cmd.substr(2)).asInt();\n bool ret = source.seek_time(ms);\n #if DEBUG >= 4\n std::cerr << \"Second-seek completed (time \" << ms << \"ms) \" << ret << std::endl;\n #endif\n } break;\n case 'f':{ \/\/frame-seek\n #if DEBUG >= 4\n std::cerr << \"Received frame-seek (\" << cmd << \")\" << std::endl;\n #endif\n bool ret = source.seek_frame(JSON::Value(cmd.substr(2)).asInt());\n #if DEBUG >= 4\n std::cerr << \"Frame-seek completed \" << ret << std::endl;\n #endif\n } break;\n case 'p':{ \/\/play\n #if DEBUG >= 4\n std::cerr << \"Received play\" << std::endl;\n #endif\n playing = -1;\n in_out.setBlocking(false);\n } break;\n case 'o':{ \/\/once-play\n #if DEBUG >= 4\n std::cerr << \"Received once-play\" << std::endl;\n #endif\n if (playing <= 0){playing = 1;}\n ++playing;\n in_out.setBlocking(false);\n } break;\n case 'q':{ \/\/quit-playing\n #if DEBUG >= 4\n std::cerr << \"Received quit-playing\" << std::endl;\n #endif\n playing = 0;\n in_out.setBlocking(true);\n } break;\n }\n }\n }\n }\n if (playing != 0){\n now = getNowMS();\n if (playing > 0 || now - timeDiff >= lastTime || lastTime - (now - timeDiff) > 15000) {\n source.seekNext();\n lastTime = source.getJSON()[\"time\"].asInt();\n if ((now - timeDiff - lastTime) > 5000 || (now - timeDiff - lastTime < -5000)){\n timeDiff = now - lastTime;\n }\n if (source.getJSON().isMember(\"keyframe\")){\n if (playing > 0){--playing;}\n if (playing == 0){\n #if DEBUG >= 4\n std::cerr << \"Sending pause_marker\" << std::endl;\n #endif\n pausemark[\"time\"] = (long long int)now;\n pausemark.toPacked();\n in_out.Send(pausemark.toNetPacked());\n in_out.flush();\n in_out.setBlocking(true);\n }\n }\n if (playing != 0){\n lasttime = time(0);\n \/\/insert proper header for this type of data\n in_out.Send(\"DTPD\");\n \/\/insert the packet length\n unsigned int size = htonl(source.getPacket().size());\n in_out.Send((char*)&size, 4);\n in_out.Send(source.getPacket());\n }\n } else {\n usleep(std::min(10000LL, lastTime - (now - timeDiff)) * 1000);\n }\n }\n usleep(10000);\/\/sleep 10ms\n }\n\n StatsSocket.close();\n in_out.close();\n return 0;\n}\n<|endoftext|>"} {"text":"<commit_before>\/*\n *\n * Copyright (c) 2020 Project CHIP Authors\n * Copyright (c) 2018 Nest Labs, Inc.\n * All rights reserved.\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n *\/\n\n\/**\n * @file\n * Provides an implementation of the PlatformManager object\n * for the ESP32 platform.\n *\/\n\/* this file behaves like a config.h, comes first *\/\n#include <platform\/internal\/CHIPDeviceLayerInternal.h>\n\n#include <crypto\/CHIPCryptoPAL.h>\n#include <platform\/PlatformManager.h>\n#include <platform\/internal\/GenericPlatformManagerImpl_FreeRTOS.cpp>\n\n#include \"esp_event.h\"\n#include \"esp_heap_caps_init.h\"\n#include \"esp_log.h\"\n#include \"esp_netif.h\"\n#include \"esp_spi_flash.h\"\n#include \"esp_system.h\"\n#include \"esp_wifi.h\"\n\nnamespace chip {\nnamespace DeviceLayer {\n\nnamespace Internal {\nextern CHIP_ERROR InitLwIPCoreLock(void);\n}\n\nPlatformManagerImpl PlatformManagerImpl::sInstance;\n\nstatic int app_entropy_source(void * data, unsigned char * output, size_t len, size_t * olen)\n{\n esp_fill_random(output, len);\n *olen = len;\n return 0;\n}\n\nCHIP_ERROR PlatformManagerImpl::_InitChipStack(void)\n{\n CHIP_ERROR err;\n wifi_init_config_t cfg;\n uint8_t ap_mac[6];\n\n esp_fill_random(ap_mac, sizeof(ap_mac));\n \/* Bit 0 of the first octet of MAC Address should always be 0 *\/\n ap_mac[0] &= (uint8_t) ~0x01;\n\n \/\/ Make sure the LwIP core lock has been initialized\n err = Internal::InitLwIPCoreLock();\n SuccessOrExit(err);\n\n err = esp_netif_init();\n SuccessOrExit(err);\n\n \/\/ Arrange for the ESP event loop to deliver events into the CHIP Device layer.\n err = esp_event_loop_create_default();\n SuccessOrExit(err);\n\n esp_netif_create_default_wifi_ap();\n esp_netif_create_default_wifi_sta();\n\n esp_event_handler_register(WIFI_EVENT, ESP_EVENT_ANY_ID, PlatformManagerImpl::HandleESPSystemEvent, NULL);\n SuccessOrExit(err);\n esp_event_handler_register(IP_EVENT, ESP_EVENT_ANY_ID, PlatformManagerImpl::HandleESPSystemEvent, NULL);\n SuccessOrExit(err);\n\n \/\/ Initialize the ESP WiFi layer.\n cfg = WIFI_INIT_CONFIG_DEFAULT();\n err = esp_wifi_init(&cfg);\n SuccessOrExit(err);\n\n err = esp_wifi_set_mac(ESP_IF_WIFI_AP, ap_mac);\n SuccessOrExit(err);\n\n \/\/ Call _InitChipStack() on the generic implementation base class\n \/\/ to finish the initialization process.\n err = Internal::GenericPlatformManagerImpl_FreeRTOS<PlatformManagerImpl>::_InitChipStack();\n SuccessOrExit(err);\n\n err = chip::Crypto::add_entropy_source(app_entropy_source, NULL, 16);\n SuccessOrExit(err);\n\nexit:\n return err;\n}\n\nCHIP_ERROR PlatformManagerImpl::InitLwIPCoreLock(void)\n{\n return Internal::InitLwIPCoreLock();\n}\n\nvoid PlatformManagerImpl::HandleESPSystemEvent(void * arg, esp_event_base_t eventBase, int32_t eventId, void * eventData)\n{\n ChipDeviceEvent event;\n memset(&event, 0, sizeof(event));\n event.Type = DeviceEventType::kESPSystemEvent;\n event.Platform.ESPSystemEvent.Base = eventBase;\n event.Platform.ESPSystemEvent.Id = eventId;\n if (eventBase == IP_EVENT)\n {\n switch (eventId)\n {\n case IP_EVENT_STA_GOT_IP:\n memcpy(&event.Platform.ESPSystemEvent.Data.IpGotIp, eventData, sizeof(event.Platform.ESPSystemEvent.Data.IpGotIp));\n break;\n case IP_EVENT_GOT_IP6:\n memcpy(&event.Platform.ESPSystemEvent.Data.IpGotIp6, eventData, sizeof(event.Platform.ESPSystemEvent.Data.IpGotIp6));\n break;\n case IP_EVENT_AP_STAIPASSIGNED:\n memcpy(&event.Platform.ESPSystemEvent.Data.IpApStaIpAssigned, eventData,\n sizeof(event.Platform.ESPSystemEvent.Data.IpApStaIpAssigned));\n break;\n default:\n break;\n }\n }\n else if (eventBase == WIFI_EVENT)\n {\n switch (eventId)\n {\n case WIFI_EVENT_SCAN_DONE:\n memcpy(&event.Platform.ESPSystemEvent.Data.WifiStaScanDone, eventData,\n sizeof(event.Platform.ESPSystemEvent.Data.WifiStaScanDone));\n break;\n case WIFI_EVENT_STA_CONNECTED:\n memcpy(&event.Platform.ESPSystemEvent.Data.WifiStaConnected, eventData,\n sizeof(event.Platform.ESPSystemEvent.Data.WifiStaConnected));\n break;\n case WIFI_EVENT_STA_DISCONNECTED:\n memcpy(&event.Platform.ESPSystemEvent.Data.WifiStaDisconnected, eventData,\n sizeof(event.Platform.ESPSystemEvent.Data.WifiStaDisconnected));\n break;\n case WIFI_EVENT_STA_AUTHMODE_CHANGE:\n memcpy(&event.Platform.ESPSystemEvent.Data.WifiStaAuthModeChange, eventData,\n sizeof(event.Platform.ESPSystemEvent.Data.WifiStaAuthModeChange));\n break;\n case WIFI_EVENT_STA_WPS_ER_PIN:\n memcpy(&event.Platform.ESPSystemEvent.Data.WifiStaWpsErPin, eventData,\n sizeof(event.Platform.ESPSystemEvent.Data.WifiStaWpsErPin));\n break;\n case WIFI_EVENT_STA_WPS_ER_FAILED:\n memcpy(&event.Platform.ESPSystemEvent.Data.WifiStaWpsErFailed, eventData,\n sizeof(event.Platform.ESPSystemEvent.Data.WifiStaWpsErFailed));\n break;\n case WIFI_EVENT_AP_STACONNECTED:\n memcpy(&event.Platform.ESPSystemEvent.Data.WifiApStaConnected, eventData,\n sizeof(event.Platform.ESPSystemEvent.Data.WifiApStaConnected));\n break;\n case WIFI_EVENT_AP_STADISCONNECTED:\n memcpy(&event.Platform.ESPSystemEvent.Data.WifiApStaDisconnected, eventData,\n sizeof(event.Platform.ESPSystemEvent.Data.WifiApStaDisconnected));\n break;\n case WIFI_EVENT_AP_PROBEREQRECVED:\n memcpy(&event.Platform.ESPSystemEvent.Data.WifiApProbeReqRecved, eventData,\n sizeof(event.Platform.ESPSystemEvent.Data.WifiApProbeReqRecved));\n break;\n default:\n break;\n }\n }\n\n sInstance.PostEvent(&event);\n}\n\n} \/\/ namespace DeviceLayer\n} \/\/ namespace chip\n<commit_msg>ESP32: Fix all-clusters-app for Rendezvous BLE (#5535)<commit_after>\/*\n *\n * Copyright (c) 2020 Project CHIP Authors\n * Copyright (c) 2018 Nest Labs, Inc.\n * All rights reserved.\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n *\/\n\n\/**\n * @file\n * Provides an implementation of the PlatformManager object\n * for the ESP32 platform.\n *\/\n\/* this file behaves like a config.h, comes first *\/\n#include <platform\/internal\/CHIPDeviceLayerInternal.h>\n\n#include <crypto\/CHIPCryptoPAL.h>\n#include <platform\/PlatformManager.h>\n#include <platform\/internal\/GenericPlatformManagerImpl_FreeRTOS.cpp>\n\n#include \"esp_event.h\"\n#include \"esp_heap_caps_init.h\"\n#include \"esp_log.h\"\n#include \"esp_netif.h\"\n#include \"esp_spi_flash.h\"\n#include \"esp_system.h\"\n#include \"esp_wifi.h\"\n\nnamespace chip {\nnamespace DeviceLayer {\n\nnamespace Internal {\nextern CHIP_ERROR InitLwIPCoreLock(void);\n}\n\nPlatformManagerImpl PlatformManagerImpl::sInstance;\n\nstatic int app_entropy_source(void * data, unsigned char * output, size_t len, size_t * olen)\n{\n esp_fill_random(output, len);\n *olen = len;\n return 0;\n}\n\nCHIP_ERROR PlatformManagerImpl::_InitChipStack(void)\n{\n CHIP_ERROR err;\n wifi_init_config_t cfg;\n uint8_t ap_mac[6];\n wifi_mode_t mode;\n\n \/\/ Make sure the LwIP core lock has been initialized\n err = Internal::InitLwIPCoreLock();\n SuccessOrExit(err);\n\n err = esp_netif_init();\n SuccessOrExit(err);\n\n \/\/ Arrange for the ESP event loop to deliver events into the CHIP Device layer.\n err = esp_event_loop_create_default();\n SuccessOrExit(err);\n\n esp_netif_create_default_wifi_ap();\n esp_netif_create_default_wifi_sta();\n\n esp_event_handler_register(WIFI_EVENT, ESP_EVENT_ANY_ID, PlatformManagerImpl::HandleESPSystemEvent, NULL);\n SuccessOrExit(err);\n esp_event_handler_register(IP_EVENT, ESP_EVENT_ANY_ID, PlatformManagerImpl::HandleESPSystemEvent, NULL);\n SuccessOrExit(err);\n\n \/\/ Initialize the ESP WiFi layer.\n cfg = WIFI_INIT_CONFIG_DEFAULT();\n err = esp_wifi_init(&cfg);\n SuccessOrExit(err);\n\n esp_wifi_get_mode(&mode);\n if ((mode == WIFI_MODE_AP) || (mode == WIFI_MODE_APSTA))\n {\n esp_fill_random(ap_mac, sizeof(ap_mac));\n \/* Bit 0 of the first octet of MAC Address should always be 0 *\/\n ap_mac[0] &= (uint8_t) ~0x01;\n err = esp_wifi_set_mac(ESP_IF_WIFI_AP, ap_mac);\n SuccessOrExit(err);\n }\n\n \/\/ Call _InitChipStack() on the generic implementation base class\n \/\/ to finish the initialization process.\n err = Internal::GenericPlatformManagerImpl_FreeRTOS<PlatformManagerImpl>::_InitChipStack();\n SuccessOrExit(err);\n\n err = chip::Crypto::add_entropy_source(app_entropy_source, NULL, 16);\n SuccessOrExit(err);\n\nexit:\n return err;\n}\n\nCHIP_ERROR PlatformManagerImpl::InitLwIPCoreLock(void)\n{\n return Internal::InitLwIPCoreLock();\n}\n\nvoid PlatformManagerImpl::HandleESPSystemEvent(void * arg, esp_event_base_t eventBase, int32_t eventId, void * eventData)\n{\n ChipDeviceEvent event;\n memset(&event, 0, sizeof(event));\n event.Type = DeviceEventType::kESPSystemEvent;\n event.Platform.ESPSystemEvent.Base = eventBase;\n event.Platform.ESPSystemEvent.Id = eventId;\n if (eventBase == IP_EVENT)\n {\n switch (eventId)\n {\n case IP_EVENT_STA_GOT_IP:\n memcpy(&event.Platform.ESPSystemEvent.Data.IpGotIp, eventData, sizeof(event.Platform.ESPSystemEvent.Data.IpGotIp));\n break;\n case IP_EVENT_GOT_IP6:\n memcpy(&event.Platform.ESPSystemEvent.Data.IpGotIp6, eventData, sizeof(event.Platform.ESPSystemEvent.Data.IpGotIp6));\n break;\n case IP_EVENT_AP_STAIPASSIGNED:\n memcpy(&event.Platform.ESPSystemEvent.Data.IpApStaIpAssigned, eventData,\n sizeof(event.Platform.ESPSystemEvent.Data.IpApStaIpAssigned));\n break;\n default:\n break;\n }\n }\n else if (eventBase == WIFI_EVENT)\n {\n switch (eventId)\n {\n case WIFI_EVENT_SCAN_DONE:\n memcpy(&event.Platform.ESPSystemEvent.Data.WifiStaScanDone, eventData,\n sizeof(event.Platform.ESPSystemEvent.Data.WifiStaScanDone));\n break;\n case WIFI_EVENT_STA_CONNECTED:\n memcpy(&event.Platform.ESPSystemEvent.Data.WifiStaConnected, eventData,\n sizeof(event.Platform.ESPSystemEvent.Data.WifiStaConnected));\n break;\n case WIFI_EVENT_STA_DISCONNECTED:\n memcpy(&event.Platform.ESPSystemEvent.Data.WifiStaDisconnected, eventData,\n sizeof(event.Platform.ESPSystemEvent.Data.WifiStaDisconnected));\n break;\n case WIFI_EVENT_STA_AUTHMODE_CHANGE:\n memcpy(&event.Platform.ESPSystemEvent.Data.WifiStaAuthModeChange, eventData,\n sizeof(event.Platform.ESPSystemEvent.Data.WifiStaAuthModeChange));\n break;\n case WIFI_EVENT_STA_WPS_ER_PIN:\n memcpy(&event.Platform.ESPSystemEvent.Data.WifiStaWpsErPin, eventData,\n sizeof(event.Platform.ESPSystemEvent.Data.WifiStaWpsErPin));\n break;\n case WIFI_EVENT_STA_WPS_ER_FAILED:\n memcpy(&event.Platform.ESPSystemEvent.Data.WifiStaWpsErFailed, eventData,\n sizeof(event.Platform.ESPSystemEvent.Data.WifiStaWpsErFailed));\n break;\n case WIFI_EVENT_AP_STACONNECTED:\n memcpy(&event.Platform.ESPSystemEvent.Data.WifiApStaConnected, eventData,\n sizeof(event.Platform.ESPSystemEvent.Data.WifiApStaConnected));\n break;\n case WIFI_EVENT_AP_STADISCONNECTED:\n memcpy(&event.Platform.ESPSystemEvent.Data.WifiApStaDisconnected, eventData,\n sizeof(event.Platform.ESPSystemEvent.Data.WifiApStaDisconnected));\n break;\n case WIFI_EVENT_AP_PROBEREQRECVED:\n memcpy(&event.Platform.ESPSystemEvent.Data.WifiApProbeReqRecved, eventData,\n sizeof(event.Platform.ESPSystemEvent.Data.WifiApProbeReqRecved));\n break;\n default:\n break;\n }\n }\n\n sInstance.PostEvent(&event);\n}\n\n} \/\/ namespace DeviceLayer\n} \/\/ namespace chip\n<|endoftext|>"} {"text":"<commit_before>\/\/ \n\/\/ test-rtx-controller.cc\n\/\/\n\/\/ Created by Peter Gusev on 23 August 2017.\n\/\/ Copyright 2013-2016 Regents of the University of California\n\/\/\n\n#include <stdlib.h>\n#include <algorithm>\n#include <ctime>\n\n#include <ndn-cpp\/interest.hpp>\n#include <ndn-cpp\/name.hpp>\n#include <boost\/shared_ptr.hpp>\n\n#include \"gtest\/gtest.h\"\n#include \"tests-helpers.hpp\"\n\n#include \"mock-objects\/rtx-observer-mock.hpp\"\n#include \"mock-objects\/buffer-mock.hpp\"\n#include \"mock-objects\/playback-queue-mock.hpp\"\n\n#include \"statistics.hpp\"\n#include \"src\/frame-data.hpp\"\n#include \"src\/frame-buffer.hpp\"\n#include \"src\/rtx-controller.hpp\"\n\nusing namespace ndnrtc;\nusing namespace ndnrtc::statistics;\nusing namespace ndn;\nusing namespace testing;\n\nTEST(TestRtxController, TestRtx){\n\tboost::shared_ptr<StatisticsStorage> storage(StatisticsStorage::createConsumerStatistics());\n\tboost::shared_ptr<MockPlaybackQueue> playbackQueue(boost::make_shared<MockPlaybackQueue>());\n\n\tMockRtxObserver rtxObserverMock;\n\tRetransmissionController rtx = RetransmissionController(storage, playbackQueue);\n\trtx.attach(&rtxObserverMock);\n\n\tint nPackets = 10;\n\tstd::srand(std::time(0));\n\tstd::string frameName = \"\/ndn\/edu\/ucla\/remap\/peter\/ndncon\/instance1\/ndnrtc\/%FD%02\/video\/camera\/hi\/d\";\n\tIBufferObserver *bufferObserver = &rtx;\n\n\tstd::set<Name> rtxInterestNames;\n\tEXPECT_CALL(rtxObserverMock, onRetransmissionRequired(_))\n\t\t.Times(AtLeast(nPackets\/2))\n\t\t.WillRepeatedly(Invoke([&rtxInterestNames](const std::vector<boost::shared_ptr<const ndn::Interest>> interests){\n\t\t\tGT_PRINTF(\"RTX for %d interests\\n\", interests.size());\n\n\t\t\tfor (auto i:interests)\n\t\t\t{\n\t\t\t\tif (rtxInterestNames.find(i->getName()) != rtxInterestNames.end())\n\t\t\t\t\tFAIL() << \"RTX for already retransmitted interest\";\n\t\t\t\trtxInterestNames.insert(i->getName());\n\t\t\t}\n\t\t}));\n\n\tfor (int i = 0; i < nPackets; ++i)\n\t{\n\t\tstd::vector<boost::shared_ptr<const Interest>> interests;\n\t\tint nInterests = std::rand()%30+10;\n\t\tfor (int j = 0; j < nInterests; ++j)\n\t\t{\n\t\t\tboost::shared_ptr<Interest> interest(boost::make_shared<Interest>(Name(frameName).appendSequenceNumber(i).appendSegment(j), 1000));\n\t\t\tint nonce = 0x1234+i*10+j;\n\t\t\tinterest->setNonce(Blob((uint8_t*)&nonce, sizeof(int)));\n\t\t\tinterests.push_back(interest);\n\t\t}\n\n\t\tboost::shared_ptr<BufferSlot> slot = boost::make_shared<BufferSlot>();\n\t\tslot->segmentsRequested(interests);\n\n\t\tEXPECT_CALL(*playbackQueue, size())\n\t\t\t.Times(AtLeast(1))\n\t\t\t.WillRepeatedly(Invoke([](){ return 100; }));\n\t\tEXPECT_CALL(*playbackQueue, pendingSize())\n\t\t\t.Times(AtLeast(1))\n\t\t\t.WillRepeatedly(Invoke([](){ return 100; }));\n\n\t\tbufferObserver->onNewRequest(slot);\n\n\t\tusleep(33000);\n\t}\n}\n\n\/\/******************************************************************************\nint main(int argc, char **argv) {\n\t::testing::InitGoogleTest(&argc, argv);\n\treturn RUN_ALL_TESTS();\n}\n<commit_msg>updated RTC controller unit test<commit_after>\/\/ \n\/\/ test-rtx-controller.cc\n\/\/\n\/\/ Created by Peter Gusev on 23 August 2017.\n\/\/ Copyright 2013-2016 Regents of the University of California\n\/\/\n\n#include <stdlib.h>\n#include <algorithm>\n#include <ctime>\n\n#include <ndn-cpp\/interest.hpp>\n#include <ndn-cpp\/name.hpp>\n#include <boost\/shared_ptr.hpp>\n\n#include \"gtest\/gtest.h\"\n#include \"tests-helpers.hpp\"\n\n#include \"mock-objects\/rtx-observer-mock.hpp\"\n#include \"mock-objects\/buffer-mock.hpp\"\n#include \"mock-objects\/playback-queue-mock.hpp\"\n\n#include \"statistics.hpp\"\n#include \"src\/frame-data.hpp\"\n#include \"src\/frame-buffer.hpp\"\n#include \"src\/rtx-controller.hpp\"\n\nusing namespace ndnrtc;\nusing namespace ndnrtc::statistics;\nusing namespace ndn;\nusing namespace testing;\n\nTEST(TestRtxController, TestRtx){\n\tboost::shared_ptr<StatisticsStorage> storage(StatisticsStorage::createConsumerStatistics());\n\tboost::shared_ptr<MockPlaybackQueue> playbackQueue(boost::make_shared<MockPlaybackQueue>());\n\n\tMockRtxObserver rtxObserverMock;\n\tRetransmissionController rtx = RetransmissionController(storage, playbackQueue);\n\trtx.attach(&rtxObserverMock);\n\n\tint nPackets = 10;\n\tstd::string frameName = \"\/ndn\/edu\/ucla\/remap\/peter\/ndncon\/instance1\/ndnrtc\/%FD%02\/video\/camera\/hi\/d\";\n\tIBufferObserver *bufferObserver = &rtx;\n\n\tstd::set<Name> rtxInterestNames;\n\tEXPECT_CALL(rtxObserverMock, onRetransmissionRequired(_))\n\t\t.Times(AtLeast(nPackets\/2))\n\t\t.WillRepeatedly(Invoke([&rtxInterestNames](const std::vector<boost::shared_ptr<const ndn::Interest>> interests){\n\t\t\tGT_PRINTF(\"RTX for %d interests\\n\", interests.size());\n\n\t\t\tfor (auto i:interests)\n\t\t\t{\n\t\t\t\tif (rtxInterestNames.find(i->getName()) != rtxInterestNames.end())\n\t\t\t\t\tFAIL() << \"RTX for already retransmitted interest\";\n\t\t\t\trtxInterestNames.insert(i->getName());\n\t\t\t\tEXPECT_GE(i->getName()[-1].toSegment(), 5);\n\t\t\t}\n\t\t}));\n\n\n\tstd::vector<boost::shared_ptr<BufferSlot>> slots;\n\tfor (int i = 0; i < nPackets; ++i)\n\t{\n\t\tstd::vector<boost::shared_ptr<const Interest>> interests;\n\t\tint nInterests = std::rand()%30+10;\n\t\tfor (int j = 0; j < nInterests; ++j)\n\t\t{\n\t\t\tboost::shared_ptr<Interest> interest(boost::make_shared<Interest>(Name(frameName).appendSequenceNumber(i).appendSegment(j), 1000));\n\t\t\tint nonce = 0x1234+i*10+j;\n\t\t\tinterest->setNonce(Blob((uint8_t*)&nonce, sizeof(int)));\n\t\t\tinterests.push_back(interest);\n\t\t}\n\n\t\tboost::shared_ptr<BufferSlot> slot = boost::make_shared<BufferSlot>();\n\t\tslots.push_back(slot);\n\t\tslot->segmentsRequested(interests);\n\n\t\tEXPECT_CALL(*playbackQueue, size())\n\t\t\t.Times(AtLeast(1))\n\t\t\t.WillRepeatedly(Invoke([](){ return 100; }));\n\t\tEXPECT_CALL(*playbackQueue, pendingSize())\n\t\t\t.Times(AtLeast(1))\n\t\t\t.WillRepeatedly(Invoke([](){ return 100; }));\n\n\t\tbufferObserver->onNewRequest(slot);\n\n\t\t\/\/ add some data (5 segments) - some interests will require RTX, as we requested at least 10 segments per slot\n\t\tVideoFramePacket vp = getVideoFramePacket();\n\t\tstd::vector<VideoFrameSegment> segments = sliceFrame(vp);\n\t\n\t\tName n(frameName);\n\t\tn.appendSequenceNumber(i);\n\t\tstd::vector<boost::shared_ptr<ndn::Data>> dataObjects = dataFromSegments(n.toUri(), segments);\n\n\t\tfor (auto o:dataObjects)\n\t\t{\n\t\t\tboost::shared_ptr<const Interest> interest;\n\t\t\tfor (auto i:interests)\n\t\t\t\tif (i->getName() == o->getName())\n\t\t\t\t{\n\t\t\t\t\tinterest = i;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\tif (interest)\n\t\t\t{\n\t\t\t\tboost::shared_ptr<WireSegment> segment = boost::make_shared<WireSegment>(o, interest);\n\t\t\t\tslot->segmentReceived(segment);\n\t\t\t}\n\t\t}\n\n\t\tusleep(33000);\n\t}\n}\n\n\/\/******************************************************************************\nint main(int argc, char **argv) {\n\t::testing::InitGoogleTest(&argc, argv);\n\treturn RUN_ALL_TESTS();\n}\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_ini.h\"\n#include <regex>\n#include <limits>\n\nOpenrasp_ini openrasp_ini;\n\nZEND_INI_MH(OnUpdateOpenraspDoubleGEZero)\n{\n double tmp = zend_string_to_double(new_value, new_value_length);\n if (tmp < 0 || tmp > std::numeric_limits<double>::max())\n {\n return FAILURE;\n }\n *reinterpret_cast<double *>(mh_arg1) = tmp;\n return SUCCESS;\n}\n\nZEND_INI_MH(OnUpdateOpenraspIntGEZero)\n{\n long tmp = zend_atol(new_value, new_value_length);\n if (tmp < 0 || tmp > std::numeric_limits<unsigned int>::max())\n {\n return FAILURE;\n }\n *reinterpret_cast<int *>(mh_arg1) = tmp;\n return SUCCESS;\n}\n\nZEND_INI_MH(OnUpdateOpenraspCString)\n{\n *reinterpret_cast<char **>(mh_arg1) = new_value_length ? new_value : nullptr;\n return SUCCESS;\n}\n\nZEND_INI_MH(OnUpdateOpenraspBool)\n{\n bool *tmp = reinterpret_cast<bool *>(mh_arg1);\n *tmp = strtobool(new_value, new_value_length);\n return SUCCESS;\n}\n\nZEND_INI_MH(OnUpdateOpenraspSet)\n{\n std::unordered_set<std::string> *p = reinterpret_cast<std::unordered_set<std::string> *>(mh_arg1);\n p->clear();\n if (new_value)\n {\n std::regex re(R\"([\\s,]+)\");\n const std::cregex_token_iterator end;\n for (std::cregex_token_iterator it(new_value, new_value + new_value_length, re, -1); it != end; it++)\n {\n p->insert(it->str());\n }\n }\n return SUCCESS;\n}\n\nbool strtobool(const char *str, int len)\n{\n if (len == 2 && strcasecmp(\"on\", str) == 0)\n {\n return true;\n }\n else if (len == 3 && strcasecmp(\"yes\", str) == 0)\n {\n return true;\n }\n else if (len == 4 && strcasecmp(\"true\", str) == 0)\n {\n return true;\n }\n else\n {\n return atoi(str);\n }\n}<commit_msg>refactor(php5) OnUpdateOpenraspSet method<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_ini.h\"\n\/\/ #include <regex>\n#include <limits>\n\nOpenrasp_ini openrasp_ini;\n\nZEND_INI_MH(OnUpdateOpenraspDoubleGEZero)\n{\n double tmp = zend_string_to_double(new_value, new_value_length);\n if (tmp < 0 || tmp > std::numeric_limits<double>::max())\n {\n return FAILURE;\n }\n *reinterpret_cast<double *>(mh_arg1) = tmp;\n return SUCCESS;\n}\n\nZEND_INI_MH(OnUpdateOpenraspIntGEZero)\n{\n long tmp = zend_atol(new_value, new_value_length);\n if (tmp < 0 || tmp > std::numeric_limits<unsigned int>::max())\n {\n return FAILURE;\n }\n *reinterpret_cast<int *>(mh_arg1) = tmp;\n return SUCCESS;\n}\n\nZEND_INI_MH(OnUpdateOpenraspCString)\n{\n *reinterpret_cast<char **>(mh_arg1) = new_value_length ? new_value : nullptr;\n return SUCCESS;\n}\n\nZEND_INI_MH(OnUpdateOpenraspBool)\n{\n bool *tmp = reinterpret_cast<bool *>(mh_arg1);\n *tmp = strtobool(new_value, new_value_length);\n return SUCCESS;\n}\n\nZEND_INI_MH(OnUpdateOpenraspSet)\n{\n std::unordered_set<std::string> *p = reinterpret_cast<std::unordered_set<std::string> *>(mh_arg1);\n p->clear();\n char *tmp;\n if (new_value && (tmp = strdup(new_value)))\n {\n char *s = nullptr, *e = tmp;\n while (*e)\n {\n switch (*e)\n {\n case ' ':\n case ',':\n if (s)\n {\n *e = '\\0';\n p->insert(std::string(s, e - s));\n s = nullptr;\n }\n break;\n default:\n if (!s)\n {\n s = e;\n }\n break;\n }\n e++;\n }\n if (s)\n {\n p->insert(std::string(s, e - s));\n }\n free(tmp);\n }\n \/\/ if (new_value)\n \/\/ {\n \/\/ std::regex re(R\"([\\s,]+)\");\n \/\/ const std::cregex_token_iterator end;\n \/\/ for (std::cregex_token_iterator it(new_value, new_value + new_value_length, re, -1); it != end; it++)\n \/\/ {\n \/\/ p->insert(it->str());\n \/\/ }\n \/\/ }\n return SUCCESS;\n}\n\nbool strtobool(const char *str, int len)\n{\n if (len == 2 && strcasecmp(\"on\", str) == 0)\n {\n return true;\n }\n else if (len == 3 && strcasecmp(\"yes\", str) == 0)\n {\n return true;\n }\n else if (len == 4 && strcasecmp(\"true\", str) == 0)\n {\n return true;\n }\n else\n {\n return atoi(str);\n }\n}<|endoftext|>"} {"text":"<commit_before>\/*************************************************************************\n *\n * OpenOffice.org - a multi-platform office productivity suite\n *\n * $RCSfile: excimp8.hxx,v $\n *\n * $Revision: 1.65 $\n *\n * last change: $Author: rt $ $Date: 2006-05-05 09:40:31 $\n *\n * The Contents of this file are made available subject to\n * the terms of GNU Lesser General Public License Version 2.1.\n *\n *\n * GNU Lesser General Public License Version 2.1\n * =============================================\n * Copyright 2005 by Sun Microsystems, Inc.\n * 901 San Antonio Road, Palo Alto, CA 94303, USA\n *\n * This library is free software; you can redistribute it and\/or\n * modify it under the terms of the GNU Lesser General Public\n * License version 2.1, as published by the Free Software Foundation.\n *\n * This library is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU\n * Lesser General Public License for more details.\n *\n * You should have received a copy of the GNU Lesser General Public\n * License along with this library; if not, write to the Free Software\n * Foundation, Inc., 59 Temple Place, Suite 330, Boston,\n * MA 02111-1307 USA\n *\n ************************************************************************\/\n\n#ifndef _EXCIMP8_HXX\n#define _EXCIMP8_HXX\n\n#include <string.h>\n\n#ifndef _IMP_OP_HXX\n#include \"imp_op.hxx\"\n#endif\n#ifndef _ROOT_HXX\n#include \"root.hxx\"\n#endif\n#ifndef _EXCSCEN_HXX\n#include \"excscen.hxx\"\n#endif\n#ifndef _EXCDEFS_HXX\n#include \"excdefs.hxx\"\n#endif\n\n#ifndef SC_FTOOLS_HXX\n#include \"ftools.hxx\"\n#endif\n\nclass SotStorage;\n\nclass ScBaseCell;\nclass ScRangeList;\nclass ScDBData;\n\nclass ScfSimpleProgressBar;\n\nclass XclImpStream;\n\n\n\nclass ImportExcel8 : public ImportExcel\n{\n protected:\n ExcScenarioList aScenList;\n\n BOOL bHasBasic;\n\n void RecString( void ); \/\/ 0x07\n void Calccount( void ); \/\/ 0x0C\n void Precision( void ); \/\/ 0x0E\n void Delta( void ); \/\/ 0x10\n void Iteration( void ); \/\/ 0x11\n void Note( void ); \/\/ 0x1C\n void WinProtection( void ); \/\/ 0x19\n void Boundsheet( void ); \/\/ 0x85\n void FilterMode( void ); \/\/ 0x9B\n void AutoFilterInfo( void ); \/\/ 0x9D\n void AutoFilter( void ); \/\/ 0x9E\n void Scenman( void ); \/\/ 0xAE\n void Scenario( void ); \/\/ 0xAF\n void ReadBasic( void ); \/\/ 0xD3\n void Cellmerging( void ); \/\/ 0xE5 geraten...\n void Labelsst( void ); \/\/ 0xFD\n\n void Hlink( void ); \/\/ 0x01B8\n void Codename( BOOL bWBGlobals ); \/\/ 0x01BA\n\n virtual void EndSheet( void );\n virtual void PostDocLoad( void );\n\n public:\n ImportExcel8( XclImpRootData& rImpData, SvStream& rStrm );\n virtual ~ImportExcel8( void );\n\n virtual FltError Read( void );\n};\n\n\n\n\/\/___________________________________________________________________\n\/\/ classes AutoFilterData, AutoFilterBuffer\n\nclass XclImpAutoFilterData : private ExcRoot\n{\nprivate:\n ScDBData* pCurrDBData;\n ScQueryParam aParam;\n SCSIZE nFirstEmpty;\n BOOL bActive;\n BOOL bHasConflict;\n BOOL bCriteria;\n BOOL bAutoOrAdvanced;\n ScRange aCriteriaRange;\n String aFilterName;\n\n void CreateFromDouble( String& rStr, double fVal );\n void SetCellAttribs();\n void InsertQueryParam();\n void AmendAFName(const BOOL bUseUnNamed);\n\nprotected:\npublic:\n XclImpAutoFilterData(\n RootData* pRoot,\n const ScRange& rRange,\n const String& rName );\n\n inline bool IsActive() const { return bActive; }\n inline SCTAB Tab() const { return aParam.nTab; }\n inline SCCOL StartCol() const { return aParam.nCol1; }\n inline SCROW StartRow() const { return aParam.nRow1; }\n inline SCCOL EndCol() const { return aParam.nCol2; }\n inline SCROW EndRow() const { return aParam.nRow2; }\n\n void ReadAutoFilter( XclImpStream& rStrm );\n\n inline void Activate() { bActive = TRUE; }\n void SetAdvancedRange( const ScRange* pRange );\n void SetExtractPos( const ScAddress& rAddr );\n inline void SetAutoOrAdvanced() { bAutoOrAdvanced = TRUE; }\n void Apply( const BOOL bUseUnNamed = FALSE );\n void CreateScDBData( const BOOL bUseUnNamed );\n void EnableRemoveFilter();\n};\n\n\nclass XclImpAutoFilterBuffer : private List\n{\nprivate:\n UINT16 nAFActiveCount;\n\n inline XclImpAutoFilterData* _First() { return (XclImpAutoFilterData*) List::First(); }\n inline XclImpAutoFilterData* _Next() { return (XclImpAutoFilterData*) List::Next(); }\n\n inline void Append( XclImpAutoFilterData* pData )\n { List::Insert( pData, LIST_APPEND ); }\nprotected:\npublic:\n XclImpAutoFilterBuffer();\n virtual ~XclImpAutoFilterBuffer();\n\n void Insert( RootData* pRoot, const ScRange& rRange,\n const String& rName );\n void AddAdvancedRange( const ScRange& rRange );\n void AddExtractPos( const ScRange& rRange );\n void Apply();\n\n XclImpAutoFilterData* GetByTab( SCTAB nTab );\n inline void IncrementActiveAF() { nAFActiveCount++; }\n inline BOOL UseUnNamed() { return nAFActiveCount == 1; }\n};\n\n#endif\n\n<commit_msg>INTEGRATION: CWS calc37 (1.65.36); FILE MERGED 2006\/07\/17 14:10:12 dr 1.65.36.1: #i67106# ignore STRING record<commit_after>\/*************************************************************************\n *\n * OpenOffice.org - a multi-platform office productivity suite\n *\n * $RCSfile: excimp8.hxx,v $\n *\n * $Revision: 1.66 $\n *\n * last change: $Author: rt $ $Date: 2006-07-25 09:58: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 _EXCIMP8_HXX\n#define _EXCIMP8_HXX\n\n#include <string.h>\n\n#ifndef _IMP_OP_HXX\n#include \"imp_op.hxx\"\n#endif\n#ifndef _ROOT_HXX\n#include \"root.hxx\"\n#endif\n#ifndef _EXCSCEN_HXX\n#include \"excscen.hxx\"\n#endif\n#ifndef _EXCDEFS_HXX\n#include \"excdefs.hxx\"\n#endif\n\n#ifndef SC_FTOOLS_HXX\n#include \"ftools.hxx\"\n#endif\n\nclass SotStorage;\n\nclass ScBaseCell;\nclass ScRangeList;\nclass ScDBData;\n\nclass ScfSimpleProgressBar;\n\nclass XclImpStream;\n\n\n\nclass ImportExcel8 : public ImportExcel\n{\n protected:\n ExcScenarioList aScenList;\n\n BOOL bHasBasic;\n\n void Calccount( void ); \/\/ 0x0C\n void Precision( void ); \/\/ 0x0E\n void Delta( void ); \/\/ 0x10\n void Iteration( void ); \/\/ 0x11\n void Note( void ); \/\/ 0x1C\n void WinProtection( void ); \/\/ 0x19\n void Boundsheet( void ); \/\/ 0x85\n void FilterMode( void ); \/\/ 0x9B\n void AutoFilterInfo( void ); \/\/ 0x9D\n void AutoFilter( void ); \/\/ 0x9E\n void Scenman( void ); \/\/ 0xAE\n void Scenario( void ); \/\/ 0xAF\n void ReadBasic( void ); \/\/ 0xD3\n void Cellmerging( void ); \/\/ 0xE5 geraten...\n void Labelsst( void ); \/\/ 0xFD\n\n void Hlink( void ); \/\/ 0x01B8\n void Codename( BOOL bWBGlobals ); \/\/ 0x01BA\n\n virtual void EndSheet( void );\n virtual void PostDocLoad( void );\n\n public:\n ImportExcel8( XclImpRootData& rImpData, SvStream& rStrm );\n virtual ~ImportExcel8( void );\n\n virtual FltError Read( void );\n};\n\n\n\n\/\/___________________________________________________________________\n\/\/ classes AutoFilterData, AutoFilterBuffer\n\nclass XclImpAutoFilterData : private ExcRoot\n{\nprivate:\n ScDBData* pCurrDBData;\n ScQueryParam aParam;\n SCSIZE nFirstEmpty;\n BOOL bActive;\n BOOL bHasConflict;\n BOOL bCriteria;\n BOOL bAutoOrAdvanced;\n ScRange aCriteriaRange;\n String aFilterName;\n\n void CreateFromDouble( String& rStr, double fVal );\n void SetCellAttribs();\n void InsertQueryParam();\n void AmendAFName(const BOOL bUseUnNamed);\n\nprotected:\npublic:\n XclImpAutoFilterData(\n RootData* pRoot,\n const ScRange& rRange,\n const String& rName );\n\n inline bool IsActive() const { return bActive; }\n inline SCTAB Tab() const { return aParam.nTab; }\n inline SCCOL StartCol() const { return aParam.nCol1; }\n inline SCROW StartRow() const { return aParam.nRow1; }\n inline SCCOL EndCol() const { return aParam.nCol2; }\n inline SCROW EndRow() const { return aParam.nRow2; }\n\n void ReadAutoFilter( XclImpStream& rStrm );\n\n inline void Activate() { bActive = TRUE; }\n void SetAdvancedRange( const ScRange* pRange );\n void SetExtractPos( const ScAddress& rAddr );\n inline void SetAutoOrAdvanced() { bAutoOrAdvanced = TRUE; }\n void Apply( const BOOL bUseUnNamed = FALSE );\n void CreateScDBData( const BOOL bUseUnNamed );\n void EnableRemoveFilter();\n};\n\n\nclass XclImpAutoFilterBuffer : private List\n{\nprivate:\n UINT16 nAFActiveCount;\n\n inline XclImpAutoFilterData* _First() { return (XclImpAutoFilterData*) List::First(); }\n inline XclImpAutoFilterData* _Next() { return (XclImpAutoFilterData*) List::Next(); }\n\n inline void Append( XclImpAutoFilterData* pData )\n { List::Insert( pData, LIST_APPEND ); }\nprotected:\npublic:\n XclImpAutoFilterBuffer();\n virtual ~XclImpAutoFilterBuffer();\n\n void Insert( RootData* pRoot, const ScRange& rRange,\n const String& rName );\n void AddAdvancedRange( const ScRange& rRange );\n void AddExtractPos( const ScRange& rRange );\n void Apply();\n\n XclImpAutoFilterData* GetByTab( SCTAB nTab );\n inline void IncrementActiveAF() { nAFActiveCount++; }\n inline BOOL UseUnNamed() { return nAFActiveCount == 1; }\n};\n\n#endif\n\n<|endoftext|>"} {"text":"<commit_before>\/*\n For more information, please see: http:\/\/software.sci.utah.edu\n\n The MIT License\n\n Copyright (c) 2009 Scientific Computing and Imaging Institute,\n University of Utah.\n\n\n Permission is hereby granted, free of charge, to any person obtaining a\n copy of this software and associated documentation files (the \"Software\"),\n to deal in the Software without restriction, including without limitation\n the rights to use, copy, modify, merge, publish, distribute, sublicense,\n and\/or sell copies of the Software, and to permit persons to whom the\n Software is furnished to do so, subject to the following conditions:\n\n The above copyright notice and this permission notice shall be included\n in all copies or substantial portions of the Software.\n\n THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS\n OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\n FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL\n THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\n LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING\n FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER\n DEALINGS IN THE SOFTWARE.\n*\/\n\/**\n \\file BrickedDataset.h\n \\author Tom Fogal\n SCI Institute\n University of Utah\n*\/\n#include <cassert>\n#include <stdexcept>\n#include \"BrickedDataset.h\"\n#include \"Controller\/Controller.h\"\n\nnamespace tuvok {\n\nBrickedDataset::BrickedDataset() { }\nBrickedDataset::~BrickedDataset() { }\n\nvoid BrickedDataset::NBricksHint(size_t n) {\n\n\/\/ The following line implements bricks.reserve(n);\n\/\/ in a portable way. unordered_map does not define\n\/\/ a reserve function but is seems gcc's tr1 does\n bricks.rehash(size_t(ceil(float(n) \/ bricks.max_load_factor())));\n}\n\n\/\/\/ Adds a brick to the dataset.\nvoid BrickedDataset::AddBrick(const BrickKey& bk,\n const BrickMD& brick)\n{\n\/* MESSAGE(\"adding brick (%u, %u, %u) -> ((%g,%g,%g), (%g,%g,%g), (%u,%u,%u))\",\n static_cast<unsigned>(std::get<0>(bk)),\n static_cast<unsigned>(std::get<1>(bk)),\n static_cast<unsigned>(std::get<2>(bk)),\n brick.center[0], brick.center[1], brick.center[2],\n brick.extents[0], brick.extents[1], brick.extents[2],\n static_cast<unsigned>(brick.n_voxels[0]),\n static_cast<unsigned>(brick.n_voxels[1]),\n static_cast<unsigned>(brick.n_voxels[2]));*\/\n this->bricks.insert(std::make_pair(bk, brick));\n}\n\n\/\/\/ Looks up the spatial range of a brick.\nFLOATVECTOR3 BrickedDataset::GetBrickExtents(const BrickKey &bk) const\n{\n BrickTable::const_iterator iter = this->bricks.find(bk);\n if(iter == this->bricks.end()) {\n T_ERROR(\"Unknown brick (%u, %u, %u)\",\n static_cast<unsigned>(std::get<0>(bk)),\n static_cast<unsigned>(std::get<1>(bk)),\n static_cast<unsigned>(std::get<2>(bk)));\n return FLOATVECTOR3(0.0f, 0.0f, 0.0f);\n }\n return iter->second.extents;\n}\nUINTVECTOR3 BrickedDataset::GetBrickVoxelCounts(const BrickKey& bk) const {\n BrickTable::const_iterator iter = this->bricks.find(bk);\n if(this->bricks.end() == iter) {\n throw std::domain_error(\"unknown brick.\");\n }\n return iter->second.n_voxels;\n}\n\n\/\/\/ @return an iterator that can be used to visit every brick in the dataset.\nBrickTable::const_iterator BrickedDataset::BricksBegin() const\n{\n return this->bricks.begin();\n}\n\nBrickTable::const_iterator BrickedDataset::BricksEnd() const\n{\n return this->bricks.end();\n}\n\n\/\/\/ @return the number of bricks at the given LOD.\nBrickTable::size_type BrickedDataset::GetBrickCount(size_t lod, size_t ts) const\n{\n BrickTable::size_type count = 0;\n BrickTable::const_iterator iter = this->bricks.begin();\n for(; iter != this->bricks.end(); ++iter) {\n if(std::get<0>(iter->first) == ts &&\n std::get<1>(iter->first) == lod) {\n ++count;\n }\n }\n return count;\n}\n\nsize_t BrickedDataset::GetLargestSingleBrickLOD(size_t ts) const {\n const size_t n_lods = this->GetLODLevelCount();\n for(size_t lod=0; lod < n_lods; ++lod) {\n if(this->GetBrickCount(lod, ts) == 1) {\n return lod;\n }\n }\n assert(\"not reachable\");\n return 0;\n}\n\nuint64_t BrickedDataset::GetTotalBrickCount() const {\n return static_cast<uint64_t>(this->bricks.size());\n}\n\nconst BrickMD& BrickedDataset::GetBrickMetadata(const BrickKey& k) const\n{\n return this->bricks.find(k)->second;\n}\n\nbool\nBrickedDataset::BrickIsFirstInDimension(size_t dim, const BrickKey& k) const\n{\n assert(dim <= 3);\n const BrickMD& md = this->bricks.find(k)->second;\n for(BrickTable::const_iterator iter = this->BricksBegin();\n iter != this->BricksEnd(); ++iter) {\n if(iter->second.center[dim] < md.center[dim]) {\n return false;\n }\n }\n return true;\n}\n\nbool\nBrickedDataset::BrickIsLastInDimension(size_t dim, const BrickKey& k) const\n{\n assert(dim <= 3);\n const BrickMD& md = this->bricks.find(k)->second;\n for(BrickTable::const_iterator iter = this->BricksBegin();\n iter != this->BricksEnd(); ++iter) {\n if(iter->second.center[dim] > md.center[dim]) {\n return false;\n }\n }\n return true;\n}\n\nvoid BrickedDataset::Clear() {\n MESSAGE(\"Clearing brick metadata.\");\n bricks.clear();\n}\n\n} \/\/ namespace tuvok\n<commit_msg>Switch commented 'add' message to #if.<commit_after>\/*\n For more information, please see: http:\/\/software.sci.utah.edu\n\n The MIT License\n\n Copyright (c) 2009 Scientific Computing and Imaging Institute,\n University of Utah.\n\n\n Permission is hereby granted, free of charge, to any person obtaining a\n copy of this software and associated documentation files (the \"Software\"),\n to deal in the Software without restriction, including without limitation\n the rights to use, copy, modify, merge, publish, distribute, sublicense,\n and\/or sell copies of the Software, and to permit persons to whom the\n Software is furnished to do so, subject to the following conditions:\n\n The above copyright notice and this permission notice shall be included\n in all copies or substantial portions of the Software.\n\n THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS\n OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\n FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL\n THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\n LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING\n FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER\n DEALINGS IN THE SOFTWARE.\n*\/\n\/**\n \\file BrickedDataset.h\n \\author Tom Fogal\n SCI Institute\n University of Utah\n*\/\n#include <cassert>\n#include <stdexcept>\n#include \"BrickedDataset.h\"\n#include \"Controller\/Controller.h\"\n\nnamespace tuvok {\n\nBrickedDataset::BrickedDataset() { }\nBrickedDataset::~BrickedDataset() { }\n\nvoid BrickedDataset::NBricksHint(size_t n) {\n\n\/\/ The following line implements bricks.reserve(n);\n\/\/ in a portable way. unordered_map does not define\n\/\/ a reserve function but is seems gcc's tr1 does\n bricks.rehash(size_t(ceil(float(n) \/ bricks.max_load_factor())));\n}\n\n\/\/\/ Adds a brick to the dataset.\nvoid BrickedDataset::AddBrick(const BrickKey& bk,\n const BrickMD& brick)\n{\n#if 0\n MESSAGE(\"adding brick <%u,%u,%u> -> ((%g,%g,%g), (%g,%g,%g), (%u,%u,%u))\",\n static_cast<unsigned>(std::get<0>(bk)),\n static_cast<unsigned>(std::get<1>(bk)),\n static_cast<unsigned>(std::get<2>(bk)),\n brick.center[0], brick.center[1], brick.center[2],\n brick.extents[0], brick.extents[1], brick.extents[2],\n static_cast<unsigned>(brick.n_voxels[0]),\n static_cast<unsigned>(brick.n_voxels[1]),\n static_cast<unsigned>(brick.n_voxels[2]));\n#endif\n this->bricks.insert(std::make_pair(bk, brick));\n}\n\n\/\/\/ Looks up the spatial range of a brick.\nFLOATVECTOR3 BrickedDataset::GetBrickExtents(const BrickKey &bk) const\n{\n BrickTable::const_iterator iter = this->bricks.find(bk);\n if(iter == this->bricks.end()) {\n T_ERROR(\"Unknown brick (%u, %u, %u)\",\n static_cast<unsigned>(std::get<0>(bk)),\n static_cast<unsigned>(std::get<1>(bk)),\n static_cast<unsigned>(std::get<2>(bk)));\n return FLOATVECTOR3(0.0f, 0.0f, 0.0f);\n }\n return iter->second.extents;\n}\nUINTVECTOR3 BrickedDataset::GetBrickVoxelCounts(const BrickKey& bk) const {\n BrickTable::const_iterator iter = this->bricks.find(bk);\n if(this->bricks.end() == iter) {\n throw std::domain_error(\"unknown brick.\");\n }\n return iter->second.n_voxels;\n}\n\n\/\/\/ @return an iterator that can be used to visit every brick in the dataset.\nBrickTable::const_iterator BrickedDataset::BricksBegin() const\n{\n return this->bricks.begin();\n}\n\nBrickTable::const_iterator BrickedDataset::BricksEnd() const\n{\n return this->bricks.end();\n}\n\n\/\/\/ @return the number of bricks at the given LOD.\nBrickTable::size_type BrickedDataset::GetBrickCount(size_t lod, size_t ts) const\n{\n BrickTable::size_type count = 0;\n BrickTable::const_iterator iter = this->bricks.begin();\n for(; iter != this->bricks.end(); ++iter) {\n if(std::get<0>(iter->first) == ts &&\n std::get<1>(iter->first) == lod) {\n ++count;\n }\n }\n return count;\n}\n\nsize_t BrickedDataset::GetLargestSingleBrickLOD(size_t ts) const {\n const size_t n_lods = this->GetLODLevelCount();\n for(size_t lod=0; lod < n_lods; ++lod) {\n if(this->GetBrickCount(lod, ts) == 1) {\n return lod;\n }\n }\n assert(\"not reachable\");\n return 0;\n}\n\nuint64_t BrickedDataset::GetTotalBrickCount() const {\n return static_cast<uint64_t>(this->bricks.size());\n}\n\nconst BrickMD& BrickedDataset::GetBrickMetadata(const BrickKey& k) const\n{\n return this->bricks.find(k)->second;\n}\n\nbool\nBrickedDataset::BrickIsFirstInDimension(size_t dim, const BrickKey& k) const\n{\n assert(dim <= 3);\n const BrickMD& md = this->bricks.find(k)->second;\n for(BrickTable::const_iterator iter = this->BricksBegin();\n iter != this->BricksEnd(); ++iter) {\n if(iter->second.center[dim] < md.center[dim]) {\n return false;\n }\n }\n return true;\n}\n\nbool\nBrickedDataset::BrickIsLastInDimension(size_t dim, const BrickKey& k) const\n{\n assert(dim <= 3);\n const BrickMD& md = this->bricks.find(k)->second;\n for(BrickTable::const_iterator iter = this->BricksBegin();\n iter != this->BricksEnd(); ++iter) {\n if(iter->second.center[dim] > md.center[dim]) {\n return false;\n }\n }\n return true;\n}\n\nvoid BrickedDataset::Clear() {\n MESSAGE(\"Clearing brick metadata.\");\n bricks.clear();\n}\n\n} \/\/ namespace tuvok\n<|endoftext|>"} {"text":"<commit_before>#include \"window_handle.hpp\"\n\nWindowHandle::WindowHandle() :\n m_hasPendingUpdates(false),\n m_isUpdatesEnabled(true),\n m_needRedraw(true),\n m_stallsCount(0)\n{\n}\n\nvoid WindowHandle::setVideoTimer(VideoTimer * videoTimer)\n{\n m_videoTimer = videoTimer;\n m_frameFn = videoTimer->frameFn();\n m_videoTimer->setFrameFn(bind(&WindowHandle::checkedFrameFn, this));\n m_stallsCount = 0;\n}\n\nvoid WindowHandle::checkedFrameFn()\n{\n if (needRedraw())\n m_stallsCount = 0;\n else\n ++m_stallsCount;\n\n if (m_stallsCount >= 60)\n {\n\/\/ LOG(LINFO, (\"PausedDOWN\"));\n m_videoTimer->pause();\n }\n else\n m_frameFn();\n}\n\nWindowHandle::~WindowHandle() {}\n\nbool WindowHandle::needRedraw() const\n{\n return m_isUpdatesEnabled && m_needRedraw;\n}\n\nvoid WindowHandle::checkTimer()\n{\n switch (m_videoTimer->state())\n {\n case VideoTimer::EStopped:\n m_videoTimer->start();\n break;\n case VideoTimer::EPaused:\n\/\/ LOG(LINFO, (\"WokenUP\"));\n m_videoTimer->resume();\n break;\n default:\n break;\n }\n}\n\nvoid WindowHandle::setNeedRedraw(bool flag)\n{\n m_needRedraw = flag;\n if (m_needRedraw && m_isUpdatesEnabled)\n checkTimer();\n}\n\nshared_ptr<yg::gl::RenderContext> const & WindowHandle::renderContext()\n{\n return m_renderContext;\n}\n\nvoid WindowHandle::setRenderContext(shared_ptr<yg::gl::RenderContext> const & renderContext)\n{\n m_renderContext = renderContext;\n}\n\nbool WindowHandle::setUpdatesEnabled(bool doEnable)\n{\n bool res = false;\n\n bool wasUpdatesEnabled = m_isUpdatesEnabled;\n m_isUpdatesEnabled = doEnable;\n\n if ((!wasUpdatesEnabled) && (doEnable) && (m_hasPendingUpdates))\n {\n setNeedRedraw(true);\n m_hasPendingUpdates = false;\n res = true;\n }\n\n return res;\n}\n\nvoid WindowHandle::invalidate()\n{\n if (m_isUpdatesEnabled)\n setNeedRedraw(true);\n else\n m_hasPendingUpdates = true;\n}\n<commit_msg>stopping video timer, as the WindowHandle destroys itself.<commit_after>#include \"window_handle.hpp\"\n\nWindowHandle::WindowHandle() :\n m_hasPendingUpdates(false),\n m_isUpdatesEnabled(true),\n m_needRedraw(true),\n m_stallsCount(0)\n{\n}\n\nvoid WindowHandle::setVideoTimer(VideoTimer * videoTimer)\n{\n m_videoTimer = videoTimer;\n m_frameFn = videoTimer->frameFn();\n m_videoTimer->setFrameFn(bind(&WindowHandle::checkedFrameFn, this));\n m_stallsCount = 0;\n}\n\nvoid WindowHandle::checkedFrameFn()\n{\n if (needRedraw())\n m_stallsCount = 0;\n else\n ++m_stallsCount;\n\n if (m_stallsCount >= 60)\n {\n\/\/ LOG(LINFO, (\"PausedDOWN\"));\n m_videoTimer->pause();\n }\n else\n m_frameFn();\n}\n\nWindowHandle::~WindowHandle()\n{\n m_videoTimer->stop();\n}\n\nbool WindowHandle::needRedraw() const\n{\n return m_isUpdatesEnabled && m_needRedraw;\n}\n\nvoid WindowHandle::checkTimer()\n{\n switch (m_videoTimer->state())\n {\n case VideoTimer::EStopped:\n m_videoTimer->start();\n break;\n case VideoTimer::EPaused:\n\/\/ LOG(LINFO, (\"WokenUP\"));\n m_videoTimer->resume();\n break;\n default:\n break;\n }\n}\n\nvoid WindowHandle::setNeedRedraw(bool flag)\n{\n m_needRedraw = flag;\n if (m_needRedraw && m_isUpdatesEnabled)\n checkTimer();\n}\n\nshared_ptr<yg::gl::RenderContext> const & WindowHandle::renderContext()\n{\n return m_renderContext;\n}\n\nvoid WindowHandle::setRenderContext(shared_ptr<yg::gl::RenderContext> const & renderContext)\n{\n m_renderContext = renderContext;\n}\n\nbool WindowHandle::setUpdatesEnabled(bool doEnable)\n{\n bool res = false;\n\n bool wasUpdatesEnabled = m_isUpdatesEnabled;\n m_isUpdatesEnabled = doEnable;\n\n if ((!wasUpdatesEnabled) && (doEnable) && (m_hasPendingUpdates))\n {\n setNeedRedraw(true);\n m_hasPendingUpdates = false;\n res = true;\n }\n\n return res;\n}\n\nvoid WindowHandle::invalidate()\n{\n if (m_isUpdatesEnabled)\n setNeedRedraw(true);\n else\n m_hasPendingUpdates = true;\n}\n<|endoftext|>"} {"text":"<commit_before>void PHOSPbPbQA(const char* dataset=\"collection.xml\")\n{\n gSystem->Load(\"libTree.so\");\n gSystem->Load(\"libGeom.so\");\n gSystem->Load(\"libVMC.so\");\n gSystem->Load(\"libPhysics.so\");\n \n \/\/load analysis framework\n gSystem->Load(\"libANALYSIS\");\n gSystem->Load(\"libANALYSISalice\"); \/\/AliAnalysisTaskSE\n\n gSystem->Load(\"libPWG4UserTasks.so\");\n \n gSystem->AddIncludePath(\"-I$ALICE_ROOT\/include -I$ALICE_ROOT\/PHOS\");\n\n cout << \"PHOSPbPbQA: processing collection \" << dataset << endl;\n\n TString data = dataset;\n TChain* chain = 0;\n \n if(data.Contains(\".xml\")) {\n \n TGrid::Connect(\"alien:\/\/\");\n \n chain = new TChain(\"esdTree\");\n TGridCollection * collection = dynamic_cast<TGridCollection*>(TAlienCollection::Open(dataset));\n \n TAlienResult* result = collection->GetGridResult(\"\",0 ,0);\n TList* rawFileList = result->GetFileInfoList();\n \n for (Int_t counter=0 ; counter < rawFileList->GetEntries() ; counter++) {\n TFileInfo * fi = static_cast<TFileInfo*>(rawFileList->At(counter)) ; \n const char * rawFile = fi->GetCurrentUrl()->GetUrl() ; \n printf(\"Processing %s\\n\", rawFile) ;\n chain->Add(rawFile);\n printf(\"Chain: %d entries.\\n\",chain->GetEntries()); \n }\n }\n \n if(data.Contains(\".txt\")) {\n gROOT->LoadMacro(\"$ALICE_ROOT\/PWG0\/CreateESDChain.C\");\n chain = CreateESDChain(dataset, 300);\n }\n \n if(data.Contains(\".root\")) {\n chain = new TChain(\"esdTree\");\n chain->Add(dataset);\n }\n\n AliLog::SetGlobalLogLevel(AliLog::kError);\n \n Int_t nentr = chain->GetEntries();\n printf(\"Number of events in the collection is %d\\n\",nentr);\n\n \/\/ Make the analysis manager\n AliAnalysisManager *mgr = new AliAnalysisManager(\"Manager\", \"Manager\");\n\n \/\/ Input handler\n AliESDInputHandler *esdHandler = new AliESDInputHandler();\n mgr->SetInputEventHandler(esdHandler);\n \n \/\/ Output handler\n AliESDHandler* esdoutHandler = new AliESDHandler();\n \n \/\/ Debug level\n mgr->SetDebugLevel(0);\n \n \/\/Add centrality task!\n gROOT->LoadMacro(\"$ALICE_ROOT\/ANALYSIS\/macros\/AddTaskCentrality.C\");\n AliCentralitySelectionTask *taskCentrality = AddTaskCentrality() ;\n \/\/ taskCentrality->SetMCInput();\n\n \/\/ Add my task\n AliAnalysisTaskPHOSPbPbQA *task1 = new AliAnalysisTaskPHOSPbPbQA(\"PbPbQA\");\n mgr->AddTask(task1);\n \n \/\/ Create containers for input\/output\n AliAnalysisDataContainer *cinput = mgr->GetCommonInputContainer(); \n AliAnalysisDataContainer *coutput = mgr->CreateContainer(\"histESD\",TList::Class(),\n\t\t\t\t\t\t\t AliAnalysisManager::kOutputContainer,\n\t\t\t\t\t\t\t \"PHOSPbPbQA.root\"); \n \n \/\/ Connect input\/output for task1\n mgr->ConnectInput(task1 , 0, cinput);\n mgr->ConnectOutput(task1, 1, coutput);\n \n if (mgr->InitAnalysis()) {\n mgr->PrintStatus();\n mgr->StartAnalysis(\"local\", chain);\n }\n \n cout <<\" Analysis ended sucessfully \"<< endl ;\n \n}\n<commit_msg>Moved to macros<commit_after><|endoftext|>"} {"text":"<commit_before><commit_msg>Resolves tdf#72152: respect page orientation of Calc files in recent docs<commit_after><|endoftext|>"} {"text":"<commit_before>\/**\n * \\file\n * \\brief SignalsReceiverControlBlock class header\n *\n * \\author Copyright (C) 2015 Kamil Szczygiel http:\/\/www.distortec.com http:\/\/www.freddiechopin.info\n *\n * \\par License\n * This Source Code Form is subject to the terms of the Mozilla Public License, v. 2.0. If a copy of the MPL was not\n * distributed with this file, You can obtain one at http:\/\/mozilla.org\/MPL\/2.0\/.\n *\/\n\n#ifndef INCLUDE_DISTORTOS_INTERNAL_SYNCHRONIZATION_SIGNALSRECEIVERCONTROLBLOCK_HPP_\n#define INCLUDE_DISTORTOS_INTERNAL_SYNCHRONIZATION_SIGNALSRECEIVERCONTROLBLOCK_HPP_\n\n#include \"distortos\/SignalSet.hpp\"\n\n#include <cstdint>\n\nunion sigval;\n\nnamespace distortos\n{\n\nclass SignalAction;\nclass SignalInformation;\nclass SignalInformationQueueWrapper;\nclass SignalsCatcher;\n\nnamespace internal\n{\n\nclass SignalInformationQueue;\nclass SignalsCatcherControlBlock;\nclass ThreadControlBlock;\n\n\/\/\/ SignalsReceiverControlBlock class is a structure required by threads for \"receiving\" of signals\nclass SignalsReceiverControlBlock\n{\npublic:\n\n\t\/**\n\t * \\brief SignalsReceiverControlBlock's constructor\n\t *\n\t * \\param [in] signalInformationQueueWrapper is a pointer to SignalInformationQueueWrapper for this receiver,\n\t * nullptr to disable queuing of signals for this receiver\n\t * \\param [in] signalsCatcher is a pointer to SignalsCatcher for this receiver, nullptr if this receiver cannot\n\t * catch\/handle signals\n\t *\/\n\n\texplicit SignalsReceiverControlBlock(SignalInformationQueueWrapper* signalInformationQueueWrapper,\n\t\t\tSignalsCatcher* signalsCatcher);\n\n\t\/**\n\t * \\brief Accepts (clears) one of signals that are pending.\n\t *\n\t * This should be called when the signal is \"accepted\".\n\t *\n\t * \\param [in] signalNumber is the signal that will be accepted, [0; 31]\n\t *\n\t * \\return pair with return code (0 on success, error code otherwise) and SignalInformation object for accepted\n\t * signal; error codes:\n\t * - EAGAIN - no signal specified by \\a signalNumber was pending;\n\t * - EINVAL - \\a signalNumber value is invalid;\n\t *\/\n\n\tstd::pair<int, SignalInformation> acceptPendingSignal(uint8_t signalNumber);\n\n\t\/**\n\t * \\brief Hook function executed when delivery of signals is started.\n\t *\n\t * Calls SignalsCatcherControlBlock::deliveryOfSignalsStartedHook().\n\t *\n\t * \\attention This function should be called only by the function that delivers signals (<em>deliverSignals()<\/em>).\n\t *\n\t * \\return 0 on success, error code otherwise:\n\t * - ENOTSUP - catching\/handling of signals is disabled for this receiver;\n\t *\/\n\n\tint deliveryOfSignalsStartedHook() const;\n\n\t\/**\n\t * \\brief Generates signal for associated thread.\n\t *\n\t * Similar to pthread_kill() - http:\/\/pubs.opengroup.org\/onlinepubs\/9699919799\/functions\/pthread_kill.html\n\t *\n\t * Adds the signalNumber to set of pending signals. If associated thread is currently waiting for this signal, it\n\t * will be unblocked.\n\t *\n\t * \\param [in] signalNumber is the signal that will be generated, [0; 31]\n\t * \\param [in] threadControlBlock is a reference to associated ThreadControlBlock\n\t *\n\t * \\return 0 on success, error code otherwise:\n\t * - EINVAL - \\a signalNumber value is invalid;\n\t *\/\n\n\tint generateSignal(uint8_t signalNumber, ThreadControlBlock& threadControlBlock);\n\n\t\/**\n\t * \\return set of currently pending signals\n\t *\/\n\n\tSignalSet getPendingSignalSet() const;\n\n\t\/**\n\t * \\brief Gets SignalAction associated with given signal number.\n\t *\n\t * Similar to sigaction() - http:\/\/pubs.opengroup.org\/onlinepubs\/9699919799\/functions\/sigaction.html\n\t *\n\t * \\param [in] signalNumber is the signal for which the association is requested, [0; 31]\n\t *\n\t * \\return pair with return code (0 on success, error code otherwise) and SignalAction that is associated with\n\t * \\a signalNumber, default-constructed object if no association was found;\n\t * error codes:\n\t * - EINVAL - \\a signalNumber value is invalid;\n\t * - ENOTSUP - catching\/handling of signals is disabled for this receiver;\n\t *\/\n\n\tstd::pair<int, SignalAction> getSignalAction(uint8_t signalNumber) const;\n\n\t\/**\n\t * \\brief Gets signal mask for associated thread.\n\t *\n\t * Similar to pthread_sigmask() - http:\/\/pubs.opengroup.org\/onlinepubs\/9699919799\/functions\/pthread_sigmask.html#\n\t * \n\t * \\return SignalSet with signal mask for associated thread\n\t *\/\n\n\tSignalSet getSignalMask() const;\n\n\t\/**\n\t * \\brief Queues signal for associated thread.\n\t *\n\t * Similar to sigqueue() - http:\/\/pubs.opengroup.org\/onlinepubs\/9699919799\/functions\/sigqueue.html\n\t *\n\t * Queues the signalNumber and signal value (sigval union) in associated SignalInformationQueue object. If\n\t * associated thread is currently waiting for this signal, it will be unblocked.\n\t *\n\t * \\param [in] signalNumber is the signal that will be queued, [0; 31]\n\t * \\param [in] value is the signal value\n\t * \\param [in] threadControlBlock is a reference to associated ThreadControlBlock\n\t *\n\t * \\return 0 on success, error code otherwise:\n\t * - EAGAIN - no resources are available to queue the signal, maximal number of signals is already queued in\n\t * associated SignalInformationQueue object;\n\t * - EINVAL - \\a signalNumber value is invalid;\n\t * - ENOTSUP - queuing of signals is disabled for this receiver;\n\t *\/\n\n\tint queueSignal(uint8_t signalNumber, sigval value, ThreadControlBlock& threadControlBlock) const;\n\n\t\/**\n\t * \\brief Sets association for given signal number.\n\t *\n\t * Similar to sigaction() - http:\/\/pubs.opengroup.org\/onlinepubs\/9699919799\/functions\/sigaction.html\n\t *\n\t * \\param [in] signalNumber is the signal for which the association will be set, [0; 31]\n\t * \\param [in] signalAction is a reference to SignalAction that will be associated with given signal number, object\n\t * in internal storage is copy-constructed\n\t *\n\t * \\return pair with return code (0 on success, error code otherwise) and SignalAction that was associated with\n\t * \\a signalNumber, default-constructed object if no association was found;\n\t * error codes:\n\t * - EAGAIN - no resources are available to associate \\a signalNumber with \\a signalAction;\n\t * - EINVAL - \\a signalNumber value is invalid;\n\t * - ENOTSUP - catching\/handling of signals is disabled for this receiver;\n\t *\/\n\n\tstd::pair<int, SignalAction> setSignalAction(uint8_t signalNumber, const SignalAction& signalAction);\n\n\t\/**\n\t * \\brief Sets signal mask for associated thread.\n\t *\n\t * Similar to pthread_sigmask() - http:\/\/pubs.opengroup.org\/onlinepubs\/9699919799\/functions\/pthread_sigmask.html#\n\t *\n\t * \\param [in] signalMask is the SignalSet with new signal mask for associated thread\n\t * \\param [in] requestDelivery selects whether delivery of signals will be requested if any pending signal is\n\t * unblocked (true) or not (false)\n\t * \n\t * \\return 0 on success, error code otherwise:\n\t * - ENOTSUP - catching\/handling of signals is disabled for this receiver;\n\t *\/\n\n\tint setSignalMask(SignalSet signalMask, bool requestDelivery);\n\n\t\/**\n\t * \\param [in] signalSet is a pointer to set of signals that will be \"waited for\", nullptr when wait was terminated\n\t *\/\n\n\tvoid setWaitingSignalSet(const SignalSet* const signalSet)\n\t{\n\t\twaitingSignalSet_ = signalSet;\n\t}\n\nprivate:\n\n\t\/**\n\t * \\brief Checks whether signal is ignored.\n\t *\n\t * Signal is ignored if it has no SignalAction object associated. Signal is never ignored if catching\/handling of\n\t * signals is disabled for this receiver.\n\t *\n\t * \\param [in] signalNumber is the signal for which the check will be performed, [0; 31]\n\t *\n\t * \\return pair with return code (0 on success, error code otherwise) and boolean telling whether the signal is\n\t * ignored (true) or not (false);\n\t * error codes:\n\t * - EINVAL - \\a signalNumber value is invalid;\n\t *\/\n\n\tstd::pair<int, bool> isSignalIgnored(uint8_t signalNumber) const;\n\n\t\/**\n\t * \\brief Actions executed after signal is \"generated\" with generateSignal() or queueSignal().\n\t *\n\t * If associated thread is currently waiting for the signal that was generated, it will be unblocked.\n\t *\n\t * \\param [in] signalNumber is the signal that was generated, [0; 31]\n\t * \\param [in] threadControlBlock is a reference to associated ThreadControlBlock\n\t *\n\t * \\return 0 on success, error code otherwise:\n\t * - EINVAL - \\a signalNumber value is invalid;\n\t *\/\n\n\tint postGenerate(uint8_t signalNumber, ThreadControlBlock& threadControlBlock) const;\n\n\t\/\/\/ set of pending signals\n\tSignalSet pendingSignalSet_;\n\n\t\/\/\/ pointer to set of \"waited for\" signals, nullptr if associated thread is not waiting for any signals\n\tconst SignalSet* waitingSignalSet_;\n\n\t\/\/\/ pointer to SignalsCatcherControlBlock for this receiver, nullptr if this receiver cannot catch\/handle signals\n\tSignalsCatcherControlBlock* signalsCatcherControlBlock_;\n\n\t\/\/\/ pointer to SignalInformationQueue for this receiver, nullptr if this receiver cannot queue signals\n\tSignalInformationQueue* signalInformationQueue_;\n};\n\n}\t\/\/ namespace internal\n\n}\t\/\/ namespace distortos\n\n#endif\t\/\/ INCLUDE_DISTORTOS_INTERNAL_SYNCHRONIZATION_SIGNALSRECEIVERCONTROLBLOCK_HPP_\n<commit_msg>SignalsReceiverControlBlock.hpp: remove trailing whitespace<commit_after>\/**\n * \\file\n * \\brief SignalsReceiverControlBlock class header\n *\n * \\author Copyright (C) 2015 Kamil Szczygiel http:\/\/www.distortec.com http:\/\/www.freddiechopin.info\n *\n * \\par License\n * This Source Code Form is subject to the terms of the Mozilla Public License, v. 2.0. If a copy of the MPL was not\n * distributed with this file, You can obtain one at http:\/\/mozilla.org\/MPL\/2.0\/.\n *\/\n\n#ifndef INCLUDE_DISTORTOS_INTERNAL_SYNCHRONIZATION_SIGNALSRECEIVERCONTROLBLOCK_HPP_\n#define INCLUDE_DISTORTOS_INTERNAL_SYNCHRONIZATION_SIGNALSRECEIVERCONTROLBLOCK_HPP_\n\n#include \"distortos\/SignalSet.hpp\"\n\n#include <cstdint>\n\nunion sigval;\n\nnamespace distortos\n{\n\nclass SignalAction;\nclass SignalInformation;\nclass SignalInformationQueueWrapper;\nclass SignalsCatcher;\n\nnamespace internal\n{\n\nclass SignalInformationQueue;\nclass SignalsCatcherControlBlock;\nclass ThreadControlBlock;\n\n\/\/\/ SignalsReceiverControlBlock class is a structure required by threads for \"receiving\" of signals\nclass SignalsReceiverControlBlock\n{\npublic:\n\n\t\/**\n\t * \\brief SignalsReceiverControlBlock's constructor\n\t *\n\t * \\param [in] signalInformationQueueWrapper is a pointer to SignalInformationQueueWrapper for this receiver,\n\t * nullptr to disable queuing of signals for this receiver\n\t * \\param [in] signalsCatcher is a pointer to SignalsCatcher for this receiver, nullptr if this receiver cannot\n\t * catch\/handle signals\n\t *\/\n\n\texplicit SignalsReceiverControlBlock(SignalInformationQueueWrapper* signalInformationQueueWrapper,\n\t\t\tSignalsCatcher* signalsCatcher);\n\n\t\/**\n\t * \\brief Accepts (clears) one of signals that are pending.\n\t *\n\t * This should be called when the signal is \"accepted\".\n\t *\n\t * \\param [in] signalNumber is the signal that will be accepted, [0; 31]\n\t *\n\t * \\return pair with return code (0 on success, error code otherwise) and SignalInformation object for accepted\n\t * signal; error codes:\n\t * - EAGAIN - no signal specified by \\a signalNumber was pending;\n\t * - EINVAL - \\a signalNumber value is invalid;\n\t *\/\n\n\tstd::pair<int, SignalInformation> acceptPendingSignal(uint8_t signalNumber);\n\n\t\/**\n\t * \\brief Hook function executed when delivery of signals is started.\n\t *\n\t * Calls SignalsCatcherControlBlock::deliveryOfSignalsStartedHook().\n\t *\n\t * \\attention This function should be called only by the function that delivers signals (<em>deliverSignals()<\/em>).\n\t *\n\t * \\return 0 on success, error code otherwise:\n\t * - ENOTSUP - catching\/handling of signals is disabled for this receiver;\n\t *\/\n\n\tint deliveryOfSignalsStartedHook() const;\n\n\t\/**\n\t * \\brief Generates signal for associated thread.\n\t *\n\t * Similar to pthread_kill() - http:\/\/pubs.opengroup.org\/onlinepubs\/9699919799\/functions\/pthread_kill.html\n\t *\n\t * Adds the signalNumber to set of pending signals. If associated thread is currently waiting for this signal, it\n\t * will be unblocked.\n\t *\n\t * \\param [in] signalNumber is the signal that will be generated, [0; 31]\n\t * \\param [in] threadControlBlock is a reference to associated ThreadControlBlock\n\t *\n\t * \\return 0 on success, error code otherwise:\n\t * - EINVAL - \\a signalNumber value is invalid;\n\t *\/\n\n\tint generateSignal(uint8_t signalNumber, ThreadControlBlock& threadControlBlock);\n\n\t\/**\n\t * \\return set of currently pending signals\n\t *\/\n\n\tSignalSet getPendingSignalSet() const;\n\n\t\/**\n\t * \\brief Gets SignalAction associated with given signal number.\n\t *\n\t * Similar to sigaction() - http:\/\/pubs.opengroup.org\/onlinepubs\/9699919799\/functions\/sigaction.html\n\t *\n\t * \\param [in] signalNumber is the signal for which the association is requested, [0; 31]\n\t *\n\t * \\return pair with return code (0 on success, error code otherwise) and SignalAction that is associated with\n\t * \\a signalNumber, default-constructed object if no association was found;\n\t * error codes:\n\t * - EINVAL - \\a signalNumber value is invalid;\n\t * - ENOTSUP - catching\/handling of signals is disabled for this receiver;\n\t *\/\n\n\tstd::pair<int, SignalAction> getSignalAction(uint8_t signalNumber) const;\n\n\t\/**\n\t * \\brief Gets signal mask for associated thread.\n\t *\n\t * Similar to pthread_sigmask() - http:\/\/pubs.opengroup.org\/onlinepubs\/9699919799\/functions\/pthread_sigmask.html#\n\t *\n\t * \\return SignalSet with signal mask for associated thread\n\t *\/\n\n\tSignalSet getSignalMask() const;\n\n\t\/**\n\t * \\brief Queues signal for associated thread.\n\t *\n\t * Similar to sigqueue() - http:\/\/pubs.opengroup.org\/onlinepubs\/9699919799\/functions\/sigqueue.html\n\t *\n\t * Queues the signalNumber and signal value (sigval union) in associated SignalInformationQueue object. If\n\t * associated thread is currently waiting for this signal, it will be unblocked.\n\t *\n\t * \\param [in] signalNumber is the signal that will be queued, [0; 31]\n\t * \\param [in] value is the signal value\n\t * \\param [in] threadControlBlock is a reference to associated ThreadControlBlock\n\t *\n\t * \\return 0 on success, error code otherwise:\n\t * - EAGAIN - no resources are available to queue the signal, maximal number of signals is already queued in\n\t * associated SignalInformationQueue object;\n\t * - EINVAL - \\a signalNumber value is invalid;\n\t * - ENOTSUP - queuing of signals is disabled for this receiver;\n\t *\/\n\n\tint queueSignal(uint8_t signalNumber, sigval value, ThreadControlBlock& threadControlBlock) const;\n\n\t\/**\n\t * \\brief Sets association for given signal number.\n\t *\n\t * Similar to sigaction() - http:\/\/pubs.opengroup.org\/onlinepubs\/9699919799\/functions\/sigaction.html\n\t *\n\t * \\param [in] signalNumber is the signal for which the association will be set, [0; 31]\n\t * \\param [in] signalAction is a reference to SignalAction that will be associated with given signal number, object\n\t * in internal storage is copy-constructed\n\t *\n\t * \\return pair with return code (0 on success, error code otherwise) and SignalAction that was associated with\n\t * \\a signalNumber, default-constructed object if no association was found;\n\t * error codes:\n\t * - EAGAIN - no resources are available to associate \\a signalNumber with \\a signalAction;\n\t * - EINVAL - \\a signalNumber value is invalid;\n\t * - ENOTSUP - catching\/handling of signals is disabled for this receiver;\n\t *\/\n\n\tstd::pair<int, SignalAction> setSignalAction(uint8_t signalNumber, const SignalAction& signalAction);\n\n\t\/**\n\t * \\brief Sets signal mask for associated thread.\n\t *\n\t * Similar to pthread_sigmask() - http:\/\/pubs.opengroup.org\/onlinepubs\/9699919799\/functions\/pthread_sigmask.html#\n\t *\n\t * \\param [in] signalMask is the SignalSet with new signal mask for associated thread\n\t * \\param [in] requestDelivery selects whether delivery of signals will be requested if any pending signal is\n\t * unblocked (true) or not (false)\n\t *\n\t * \\return 0 on success, error code otherwise:\n\t * - ENOTSUP - catching\/handling of signals is disabled for this receiver;\n\t *\/\n\n\tint setSignalMask(SignalSet signalMask, bool requestDelivery);\n\n\t\/**\n\t * \\param [in] signalSet is a pointer to set of signals that will be \"waited for\", nullptr when wait was terminated\n\t *\/\n\n\tvoid setWaitingSignalSet(const SignalSet* const signalSet)\n\t{\n\t\twaitingSignalSet_ = signalSet;\n\t}\n\nprivate:\n\n\t\/**\n\t * \\brief Checks whether signal is ignored.\n\t *\n\t * Signal is ignored if it has no SignalAction object associated. Signal is never ignored if catching\/handling of\n\t * signals is disabled for this receiver.\n\t *\n\t * \\param [in] signalNumber is the signal for which the check will be performed, [0; 31]\n\t *\n\t * \\return pair with return code (0 on success, error code otherwise) and boolean telling whether the signal is\n\t * ignored (true) or not (false);\n\t * error codes:\n\t * - EINVAL - \\a signalNumber value is invalid;\n\t *\/\n\n\tstd::pair<int, bool> isSignalIgnored(uint8_t signalNumber) const;\n\n\t\/**\n\t * \\brief Actions executed after signal is \"generated\" with generateSignal() or queueSignal().\n\t *\n\t * If associated thread is currently waiting for the signal that was generated, it will be unblocked.\n\t *\n\t * \\param [in] signalNumber is the signal that was generated, [0; 31]\n\t * \\param [in] threadControlBlock is a reference to associated ThreadControlBlock\n\t *\n\t * \\return 0 on success, error code otherwise:\n\t * - EINVAL - \\a signalNumber value is invalid;\n\t *\/\n\n\tint postGenerate(uint8_t signalNumber, ThreadControlBlock& threadControlBlock) const;\n\n\t\/\/\/ set of pending signals\n\tSignalSet pendingSignalSet_;\n\n\t\/\/\/ pointer to set of \"waited for\" signals, nullptr if associated thread is not waiting for any signals\n\tconst SignalSet* waitingSignalSet_;\n\n\t\/\/\/ pointer to SignalsCatcherControlBlock for this receiver, nullptr if this receiver cannot catch\/handle signals\n\tSignalsCatcherControlBlock* signalsCatcherControlBlock_;\n\n\t\/\/\/ pointer to SignalInformationQueue for this receiver, nullptr if this receiver cannot queue signals\n\tSignalInformationQueue* signalInformationQueue_;\n};\n\n}\t\/\/ namespace internal\n\n}\t\/\/ namespace distortos\n\n#endif\t\/\/ INCLUDE_DISTORTOS_INTERNAL_SYNCHRONIZATION_SIGNALSRECEIVERCONTROLBLOCK_HPP_\n<|endoftext|>"} {"text":"<commit_before>\/*\n * Copyright (C) 2017 ScyllaDB\n *\/\n\n\/*\n * This file is part of Scylla.\n *\n * Scylla is free software: you can redistribute it and\/or modify\n * it under the terms of the GNU Affero General Public License as published by\n * the Free Software Foundation, either version 3 of the License, or\n * (at your option) any later version.\n *\n * Scylla is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the\n * GNU General Public License for more details.\n *\n * You should have received a copy of the GNU General Public License\n * along with Scylla. If not, see <http:\/\/www.gnu.org\/licenses\/>.\n *\/\n\n#pragma once\n\n#include \"partition_version.hh\"\n\nclass partition_snapshot_row_cursor;\n\n\/\/ A non-owning reference to a row inside partition_snapshot which\n\/\/ maintains it's position and thus can be kept across reference invalidation points.\nclass partition_snapshot_row_weakref final {\n mutation_partition::rows_type::iterator _it;\n partition_snapshot::change_mark _change_mark;\n position_in_partition _pos = position_in_partition::min();\npublic:\n partition_snapshot_row_weakref() = default;\n \/\/ Makes this object point to a row pointed to by given partition_snapshot_row_cursor.\n explicit partition_snapshot_row_weakref(const partition_snapshot_row_cursor&);\n explicit partition_snapshot_row_weakref(std::nullptr_t) {}\n partition_snapshot_row_weakref(partition_snapshot& snp, mutation_partition::rows_type::iterator it)\n : _it(it)\n , _change_mark(snp.get_change_mark())\n , _pos(it->position())\n { }\n partition_snapshot_row_weakref& operator=(const partition_snapshot_row_cursor&);\n partition_snapshot_row_weakref& operator=(std::nullptr_t) noexcept {\n _change_mark = {};\n return *this;\n }\n \/\/ Returns true iff the pointer is pointing at a row.\n explicit operator bool() const { return _change_mark != partition_snapshot::change_mark(); }\npublic:\n \/\/ Returns the position of the row.\n \/\/ Call only when pointing at a row.\n const position_in_partition& position() const { return _pos; }\n \/\/ Returns true iff the object is valid.\n bool valid(partition_snapshot& snp) { return snp.get_change_mark() == _change_mark; }\n \/\/ Brings the object back to validity and returns true iff the snapshot contains the row.\n \/\/ When not pointing at a row, returns false.\n bool refresh(partition_snapshot& snp) {\n auto snp_cm = snp.get_change_mark();\n if (snp_cm == _change_mark) {\n return true;\n }\n if (!_change_mark) {\n return false;\n }\n _change_mark = snp_cm;\n rows_entry::compare less(*snp.schema());\n for (auto&& v : snp.versions()) {\n auto& rows = v.partition().clustered_rows();\n _it = rows.find(_pos, less);\n if (_it != rows.end()) {\n return true;\n }\n }\n return false;\n }\n};\n\n\/\/ Allows iterating over rows of mutation_partition represented by given partition_snapshot.\n\/\/\n\/\/ The cursor initially has a position before all rows and is not pointing at any row.\n\/\/ To position the cursor, use advance_to().\n\/\/\n\/\/ All methods should be called with the region of the snapshot locked. The cursor is invalidated\n\/\/ when that lock section is left, or if the snapshot is modified.\n\/\/\n\/\/ When the cursor is invalidated, it still maintains its previous position. It can be brought\n\/\/ back to validity by calling maybe_refresh(), or advance_to().\n\/\/\n\/\/ Insertion of row entries after cursor's position invalidates the cursor.\n\/\/ Exceptions thrown from mutators invalidate the cursor.\n\/\/\nclass partition_snapshot_row_cursor final {\n friend class partition_snapshot_row_weakref;\n struct position_in_version {\n mutation_partition::rows_type::iterator it;\n mutation_partition::rows_type::iterator end;\n int version_no;\n\n struct less_compare {\n rows_entry::tri_compare _cmp;\n public:\n explicit less_compare(const schema& s) : _cmp(s) { }\n bool operator()(const position_in_version& a, const position_in_version& b) {\n auto res = _cmp(*a.it, *b.it);\n return res > 0 || (res == 0 && a.version_no > b.version_no);\n }\n };\n };\n\n const schema& _schema;\n partition_snapshot& _snp;\n std::vector<position_in_version> _heap;\n std::vector<mutation_partition::rows_type::iterator> _iterators;\n std::vector<position_in_version> _current_row;\n position_in_partition _position;\n partition_snapshot::change_mark _change_mark;\n\n \/\/ Removes the next row from _heap and puts it into _current_row\n void recreate_current_row() {\n position_in_version::less_compare heap_less(_schema);\n position_in_partition::equal_compare eq(_schema);\n do {\n boost::range::pop_heap(_heap, heap_less);\n memory::on_alloc_point();\n _current_row.push_back(_heap.back());\n _heap.pop_back();\n } while (!_heap.empty() && eq(_current_row[0].it->position(), _heap[0].it->position()));\n _position = position_in_partition(_current_row[0].it->position());\n }\npublic:\n partition_snapshot_row_cursor(const schema& s, partition_snapshot& snp)\n : _schema(s)\n , _snp(snp)\n , _position(position_in_partition::static_row_tag_t{})\n { }\n\n mutation_partition::rows_type::iterator get_iterator_in_latest_version() const {\n return _iterators[0];\n }\n\n \/\/ Returns true iff the iterators obtained since the cursor was last made valid\n \/\/ are still valid. Note that this doesn't mean that the cursor itself is valid.\n bool iterators_valid() const {\n return _snp.get_change_mark() == _change_mark;\n }\n\n \/\/ Brings back the cursor to validity.\n \/\/ Can be only called when cursor is pointing at a row.\n \/\/\n \/\/ Semantically equivalent to:\n \/\/\n \/\/ advance_to(position());\n \/\/\n \/\/ but avoids work if not necessary.\n bool maybe_refresh() {\n if (!iterators_valid()) {\n return advance_to(_position);\n }\n \/\/ Refresh latest version's iterator in case there was an insertion\n \/\/ before it and after cursor's position. There cannot be any\n \/\/ insertions for non-latest versions, so we don't have to update them.\n if (_current_row[0].version_no != 0) {\n rows_entry::compare less(_schema);\n position_in_partition::equal_compare eq(_schema);\n position_in_version::less_compare heap_less(_schema);\n auto& rows = _snp.version()->partition().clustered_rows();\n auto it = _iterators[0] = rows.lower_bound(_position, less);\n auto heap_i = boost::find_if(_heap, [](auto&& v) { return v.version_no == 0; });\n if (it == rows.end()) {\n if (heap_i != _heap.end()) {\n _heap.erase(heap_i);\n boost::range::make_heap(_heap, heap_less);\n }\n } else if (eq(_position, it->position())) {\n _current_row.insert(_current_row.begin(), position_in_version{it, rows.end(), 0});\n if (heap_i != _heap.end()) {\n _heap.erase(heap_i);\n boost::range::make_heap(_heap, heap_less);\n }\n } else {\n if (heap_i != _heap.end()) {\n heap_i->it = it;\n boost::range::make_heap(_heap, heap_less);\n } else {\n _heap.push_back({it, rows.end(), 0});\n boost::range::push_heap(_heap, heap_less);\n }\n }\n }\n return true;\n }\n\n \/\/ Moves the cursor to the first entry with position >= pos.\n \/\/\n \/\/ The caller must ensure that such entry exists.\n \/\/\n \/\/ Returns true iff there can't be any clustering row entries\n \/\/ between lower_bound (inclusive) and the entry to which the cursor\n \/\/ was advanced.\n \/\/\n \/\/ May be called when cursor is not valid.\n \/\/ The cursor is valid after the call.\n \/\/ Must be called under reclaim lock.\n \/\/ When throws, the cursor is invalidated and its position is not changed.\n bool advance_to(position_in_partition_view lower_bound) {\n memory::on_alloc_point();\n rows_entry::compare less(_schema);\n position_in_version::less_compare heap_less(_schema);\n _heap.clear();\n _current_row.clear();\n _iterators.clear();\n int version_no = 0;\n for (auto&& v : _snp.versions()) {\n auto& rows = v.partition().clustered_rows();\n auto pos = rows.lower_bound(lower_bound, less);\n auto end = rows.end();\n _iterators.push_back(pos);\n if (pos != end) {\n _heap.push_back({pos, end, version_no});\n }\n ++version_no;\n }\n boost::range::make_heap(_heap, heap_less);\n _change_mark = _snp.get_change_mark();\n bool found = no_clustering_row_between(_schema, lower_bound, _heap[0].it->position());\n recreate_current_row();\n return found;\n }\n\n \/\/ Advances the cursor to the next row.\n \/\/ If there is no next row, returns false and the cursor is no longer pointing at a row.\n \/\/ Can be only called on a valid cursor pointing at a row.\n \/\/ When throws, the cursor is invalidated and its position is not changed.\n bool next() {\n memory::on_alloc_point();\n position_in_version::less_compare heap_less(_schema);\n assert(iterators_valid());\n for (auto&& curr : _current_row) {\n ++curr.it;\n _iterators[curr.version_no] = curr.it;\n if (curr.it != curr.end) {\n _heap.push_back(curr);\n boost::range::push_heap(_heap, heap_less);\n }\n }\n _current_row.clear();\n if (_heap.empty()) {\n return false;\n }\n recreate_current_row();\n return true;\n }\n\n \/\/ Can be called only when cursor is valid and pointing at a row.\n bool continuous() const { return bool(_current_row[0].it->continuous()); }\n\n \/\/ Can be called only when cursor is valid and pointing at a row.\n bool dummy() const { return bool(_current_row[0].it->dummy()); }\n\n \/\/ Can be called only when cursor is valid and pointing at a row, and !dummy().\n const clustering_key& key() const { return _current_row[0].it->key(); }\n\n \/\/ Can be called only when cursor is valid and pointing at a row.\n mutation_fragment row() const {\n auto it = _current_row.begin();\n auto mf = mutation_fragment(clustering_row(*it->it));\n auto& cr = mf.as_mutable_clustering_row();\n for (++it; it != _current_row.end(); ++it) {\n cr.apply(_schema, *it->it);\n }\n return mf;\n }\n\n \/\/ Can be called when cursor is pointing at a row, even when invalid.\n const position_in_partition& position() const {\n return _position;\n }\n\n bool is_in_latest_version() const;\n\n \/\/ Reads the rest of the partition into a mutation_partition object.\n \/\/ There must be at least one entry ahead of the cursor.\n \/\/ The cursor must be pointing at a row and valid.\n \/\/ The cursor will not be pointing at a row after this.\n mutation_partition read_partition() {\n mutation_partition p(_schema.shared_from_this());\n do {\n p.clustered_row(_schema, position(), is_dummy(dummy()), is_continuous(continuous()))\n .apply(_schema, row().as_clustering_row());\n } while (next());\n return p;\n }\n\n friend std::ostream& operator<<(std::ostream& out, const partition_snapshot_row_cursor& cur) {\n out << \"{cursor: position=\" << cur._position << \", \";\n if (!cur.iterators_valid()) {\n return out << \" iterators invalid}\";\n }\n out << \"current=[\";\n bool first = true;\n for (auto&& v : cur._current_row) {\n if (!first) {\n out << \", \";\n }\n first = false;\n out << v.version_no;\n }\n out << \"], heap=[\";\n first = true;\n for (auto&& v : cur._heap) {\n if (!first) {\n out << \", \";\n }\n first = false;\n out << \"{v=\" << v.version_no << \", pos=\" << v.it->position() << \"}\";\n }\n out << \"], iterators=[\";\n first = true;\n auto v = cur._snp.versions().begin();\n for (auto&& i : cur._iterators) {\n if (!first) {\n out << \", \";\n }\n first = false;\n if (i == v->partition().clustered_rows().end()) {\n out << \"end\";\n } else {\n out << i->position();\n }\n ++v;\n }\n return out << \"]}\";\n };\n};\n\ninline\nbool partition_snapshot_row_cursor::is_in_latest_version() const {\n return _current_row[0].version_no == 0;\n}\n\ninline\npartition_snapshot_row_weakref::partition_snapshot_row_weakref(const partition_snapshot_row_cursor& c)\n : _it(c._current_row[0].it)\n , _change_mark(c._change_mark)\n , _pos(c._position)\n{ }\n\ninline\npartition_snapshot_row_weakref& partition_snapshot_row_weakref::operator=(const partition_snapshot_row_cursor& c) {\n auto tmp = partition_snapshot_row_weakref(c);\n this->~partition_snapshot_row_weakref();\n new (this) partition_snapshot_row_weakref(std::move(tmp));\n return *this;\n}\n<commit_msg>mvcc: partition_snapshot_row_cursor: Extract prepare_heap()<commit_after>\/*\n * Copyright (C) 2017 ScyllaDB\n *\/\n\n\/*\n * This file is part of Scylla.\n *\n * Scylla is free software: you can redistribute it and\/or modify\n * it under the terms of the GNU Affero General Public License as published by\n * the Free Software Foundation, either version 3 of the License, or\n * (at your option) any later version.\n *\n * Scylla is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the\n * GNU General Public License for more details.\n *\n * You should have received a copy of the GNU General Public License\n * along with Scylla. If not, see <http:\/\/www.gnu.org\/licenses\/>.\n *\/\n\n#pragma once\n\n#include \"partition_version.hh\"\n\nclass partition_snapshot_row_cursor;\n\n\/\/ A non-owning reference to a row inside partition_snapshot which\n\/\/ maintains it's position and thus can be kept across reference invalidation points.\nclass partition_snapshot_row_weakref final {\n mutation_partition::rows_type::iterator _it;\n partition_snapshot::change_mark _change_mark;\n position_in_partition _pos = position_in_partition::min();\npublic:\n partition_snapshot_row_weakref() = default;\n \/\/ Makes this object point to a row pointed to by given partition_snapshot_row_cursor.\n explicit partition_snapshot_row_weakref(const partition_snapshot_row_cursor&);\n explicit partition_snapshot_row_weakref(std::nullptr_t) {}\n partition_snapshot_row_weakref(partition_snapshot& snp, mutation_partition::rows_type::iterator it)\n : _it(it)\n , _change_mark(snp.get_change_mark())\n , _pos(it->position())\n { }\n partition_snapshot_row_weakref& operator=(const partition_snapshot_row_cursor&);\n partition_snapshot_row_weakref& operator=(std::nullptr_t) noexcept {\n _change_mark = {};\n return *this;\n }\n \/\/ Returns true iff the pointer is pointing at a row.\n explicit operator bool() const { return _change_mark != partition_snapshot::change_mark(); }\npublic:\n \/\/ Returns the position of the row.\n \/\/ Call only when pointing at a row.\n const position_in_partition& position() const { return _pos; }\n \/\/ Returns true iff the object is valid.\n bool valid(partition_snapshot& snp) { return snp.get_change_mark() == _change_mark; }\n \/\/ Brings the object back to validity and returns true iff the snapshot contains the row.\n \/\/ When not pointing at a row, returns false.\n bool refresh(partition_snapshot& snp) {\n auto snp_cm = snp.get_change_mark();\n if (snp_cm == _change_mark) {\n return true;\n }\n if (!_change_mark) {\n return false;\n }\n _change_mark = snp_cm;\n rows_entry::compare less(*snp.schema());\n for (auto&& v : snp.versions()) {\n auto& rows = v.partition().clustered_rows();\n _it = rows.find(_pos, less);\n if (_it != rows.end()) {\n return true;\n }\n }\n return false;\n }\n};\n\n\/\/ Allows iterating over rows of mutation_partition represented by given partition_snapshot.\n\/\/\n\/\/ The cursor initially has a position before all rows and is not pointing at any row.\n\/\/ To position the cursor, use advance_to().\n\/\/\n\/\/ All methods should be called with the region of the snapshot locked. The cursor is invalidated\n\/\/ when that lock section is left, or if the snapshot is modified.\n\/\/\n\/\/ When the cursor is invalidated, it still maintains its previous position. It can be brought\n\/\/ back to validity by calling maybe_refresh(), or advance_to().\n\/\/\n\/\/ Insertion of row entries after cursor's position invalidates the cursor.\n\/\/ Exceptions thrown from mutators invalidate the cursor.\n\/\/\nclass partition_snapshot_row_cursor final {\n friend class partition_snapshot_row_weakref;\n struct position_in_version {\n mutation_partition::rows_type::iterator it;\n mutation_partition::rows_type::iterator end;\n int version_no;\n\n struct less_compare {\n rows_entry::tri_compare _cmp;\n public:\n explicit less_compare(const schema& s) : _cmp(s) { }\n bool operator()(const position_in_version& a, const position_in_version& b) {\n auto res = _cmp(*a.it, *b.it);\n return res > 0 || (res == 0 && a.version_no > b.version_no);\n }\n };\n };\n\n const schema& _schema;\n partition_snapshot& _snp;\n std::vector<position_in_version> _heap;\n std::vector<mutation_partition::rows_type::iterator> _iterators;\n std::vector<position_in_version> _current_row;\n position_in_partition _position;\n partition_snapshot::change_mark _change_mark;\n\n \/\/ Removes the next row from _heap and puts it into _current_row\n void recreate_current_row() {\n position_in_version::less_compare heap_less(_schema);\n position_in_partition::equal_compare eq(_schema);\n do {\n boost::range::pop_heap(_heap, heap_less);\n memory::on_alloc_point();\n _current_row.push_back(_heap.back());\n _heap.pop_back();\n } while (!_heap.empty() && eq(_current_row[0].it->position(), _heap[0].it->position()));\n _position = position_in_partition(_current_row[0].it->position());\n }\n\n void prepare_heap(position_in_partition_view lower_bound) {\n memory::on_alloc_point();\n rows_entry::compare less(_schema);\n position_in_version::less_compare heap_less(_schema);\n _heap.clear();\n _current_row.clear();\n _iterators.clear();\n int version_no = 0;\n for (auto&& v : _snp.versions()) {\n auto& rows = v.partition().clustered_rows();\n auto pos = rows.lower_bound(lower_bound, less);\n auto end = rows.end();\n _iterators.push_back(pos);\n if (pos != end) {\n _heap.push_back({pos, end, version_no});\n }\n ++version_no;\n }\n boost::range::make_heap(_heap, heap_less);\n }\npublic:\n partition_snapshot_row_cursor(const schema& s, partition_snapshot& snp)\n : _schema(s)\n , _snp(snp)\n , _position(position_in_partition::static_row_tag_t{})\n { }\n\n mutation_partition::rows_type::iterator get_iterator_in_latest_version() const {\n return _iterators[0];\n }\n\n \/\/ Returns true iff the iterators obtained since the cursor was last made valid\n \/\/ are still valid. Note that this doesn't mean that the cursor itself is valid.\n bool iterators_valid() const {\n return _snp.get_change_mark() == _change_mark;\n }\n\n \/\/ Brings back the cursor to validity.\n \/\/ Can be only called when cursor is pointing at a row.\n \/\/\n \/\/ Semantically equivalent to:\n \/\/\n \/\/ advance_to(position());\n \/\/\n \/\/ but avoids work if not necessary.\n bool maybe_refresh() {\n if (!iterators_valid()) {\n return advance_to(_position);\n }\n \/\/ Refresh latest version's iterator in case there was an insertion\n \/\/ before it and after cursor's position. There cannot be any\n \/\/ insertions for non-latest versions, so we don't have to update them.\n if (_current_row[0].version_no != 0) {\n rows_entry::compare less(_schema);\n position_in_partition::equal_compare eq(_schema);\n position_in_version::less_compare heap_less(_schema);\n auto& rows = _snp.version()->partition().clustered_rows();\n auto it = _iterators[0] = rows.lower_bound(_position, less);\n auto heap_i = boost::find_if(_heap, [](auto&& v) { return v.version_no == 0; });\n if (it == rows.end()) {\n if (heap_i != _heap.end()) {\n _heap.erase(heap_i);\n boost::range::make_heap(_heap, heap_less);\n }\n } else if (eq(_position, it->position())) {\n _current_row.insert(_current_row.begin(), position_in_version{it, rows.end(), 0});\n if (heap_i != _heap.end()) {\n _heap.erase(heap_i);\n boost::range::make_heap(_heap, heap_less);\n }\n } else {\n if (heap_i != _heap.end()) {\n heap_i->it = it;\n boost::range::make_heap(_heap, heap_less);\n } else {\n _heap.push_back({it, rows.end(), 0});\n boost::range::push_heap(_heap, heap_less);\n }\n }\n }\n return true;\n }\n\n \/\/ Moves the cursor to the first entry with position >= pos.\n \/\/\n \/\/ The caller must ensure that such entry exists.\n \/\/\n \/\/ Returns true iff there can't be any clustering row entries\n \/\/ between lower_bound (inclusive) and the entry to which the cursor\n \/\/ was advanced.\n \/\/\n \/\/ May be called when cursor is not valid.\n \/\/ The cursor is valid after the call.\n \/\/ Must be called under reclaim lock.\n \/\/ When throws, the cursor is invalidated and its position is not changed.\n bool advance_to(position_in_partition_view lower_bound) {\n prepare_heap(lower_bound);\n _change_mark = _snp.get_change_mark();\n bool found = no_clustering_row_between(_schema, lower_bound, _heap[0].it->position());\n recreate_current_row();\n return found;\n }\n\n \/\/ Advances the cursor to the next row.\n \/\/ If there is no next row, returns false and the cursor is no longer pointing at a row.\n \/\/ Can be only called on a valid cursor pointing at a row.\n \/\/ When throws, the cursor is invalidated and its position is not changed.\n bool next() {\n memory::on_alloc_point();\n position_in_version::less_compare heap_less(_schema);\n assert(iterators_valid());\n for (auto&& curr : _current_row) {\n ++curr.it;\n _iterators[curr.version_no] = curr.it;\n if (curr.it != curr.end) {\n _heap.push_back(curr);\n boost::range::push_heap(_heap, heap_less);\n }\n }\n _current_row.clear();\n if (_heap.empty()) {\n return false;\n }\n recreate_current_row();\n return true;\n }\n\n \/\/ Can be called only when cursor is valid and pointing at a row.\n bool continuous() const { return bool(_current_row[0].it->continuous()); }\n\n \/\/ Can be called only when cursor is valid and pointing at a row.\n bool dummy() const { return bool(_current_row[0].it->dummy()); }\n\n \/\/ Can be called only when cursor is valid and pointing at a row, and !dummy().\n const clustering_key& key() const { return _current_row[0].it->key(); }\n\n \/\/ Can be called only when cursor is valid and pointing at a row.\n mutation_fragment row() const {\n auto it = _current_row.begin();\n auto mf = mutation_fragment(clustering_row(*it->it));\n auto& cr = mf.as_mutable_clustering_row();\n for (++it; it != _current_row.end(); ++it) {\n cr.apply(_schema, *it->it);\n }\n return mf;\n }\n\n \/\/ Can be called when cursor is pointing at a row, even when invalid.\n const position_in_partition& position() const {\n return _position;\n }\n\n bool is_in_latest_version() const;\n\n \/\/ Reads the rest of the partition into a mutation_partition object.\n \/\/ There must be at least one entry ahead of the cursor.\n \/\/ The cursor must be pointing at a row and valid.\n \/\/ The cursor will not be pointing at a row after this.\n mutation_partition read_partition() {\n mutation_partition p(_schema.shared_from_this());\n do {\n p.clustered_row(_schema, position(), is_dummy(dummy()), is_continuous(continuous()))\n .apply(_schema, row().as_clustering_row());\n } while (next());\n return p;\n }\n\n friend std::ostream& operator<<(std::ostream& out, const partition_snapshot_row_cursor& cur) {\n out << \"{cursor: position=\" << cur._position << \", \";\n if (!cur.iterators_valid()) {\n return out << \" iterators invalid}\";\n }\n out << \"current=[\";\n bool first = true;\n for (auto&& v : cur._current_row) {\n if (!first) {\n out << \", \";\n }\n first = false;\n out << v.version_no;\n }\n out << \"], heap=[\";\n first = true;\n for (auto&& v : cur._heap) {\n if (!first) {\n out << \", \";\n }\n first = false;\n out << \"{v=\" << v.version_no << \", pos=\" << v.it->position() << \"}\";\n }\n out << \"], iterators=[\";\n first = true;\n auto v = cur._snp.versions().begin();\n for (auto&& i : cur._iterators) {\n if (!first) {\n out << \", \";\n }\n first = false;\n if (i == v->partition().clustered_rows().end()) {\n out << \"end\";\n } else {\n out << i->position();\n }\n ++v;\n }\n return out << \"]}\";\n };\n};\n\ninline\nbool partition_snapshot_row_cursor::is_in_latest_version() const {\n return _current_row[0].version_no == 0;\n}\n\ninline\npartition_snapshot_row_weakref::partition_snapshot_row_weakref(const partition_snapshot_row_cursor& c)\n : _it(c._current_row[0].it)\n , _change_mark(c._change_mark)\n , _pos(c._position)\n{ }\n\ninline\npartition_snapshot_row_weakref& partition_snapshot_row_weakref::operator=(const partition_snapshot_row_cursor& c) {\n auto tmp = partition_snapshot_row_weakref(c);\n this->~partition_snapshot_row_weakref();\n new (this) partition_snapshot_row_weakref(std::move(tmp));\n return *this;\n}\n<|endoftext|>"} {"text":"<commit_before>\/*\n * (C) Copyright 2015 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#include <gst\/gst.h>\n\n#include \"loadConfig.hpp\"\n\n#include <iostream>\n#include <queue>\n#include <list>\n#include <boost\/filesystem.hpp>\n#include <boost\/foreach.hpp>\n#include <boost\/property_tree\/json_parser.hpp>\n#include <boost\/property_tree\/info_parser.hpp>\n#include <boost\/property_tree\/ini_parser.hpp>\n#include <boost\/property_tree\/xml_parser.hpp>\n#include <utility>\n\n#define GST_CAT_DEFAULT kurento_load_config\nGST_DEBUG_CATEGORY_STATIC (GST_CAT_DEFAULT);\n#define GST_DEFAULT_NAME \"KurentoLoadConfig\"\n\nnamespace kurento\n{\n\nclass ParseException : public virtual std::exception\n{\npublic:\n ParseException(std::string message) : message(std::move(message)){};\n\n ~ParseException() override = default;\n\n const char *what() const noexcept override { return message.c_str(); };\n\n const std::string &getMessage() const\n {\n return message;\n };\n\nprivate:\n std::string message;\n};\n\nstatic std::list<std::string>\nsplit (const std::string &s, char delim)\n{\n std::list<std::string> elems;\n std::stringstream ss (s);\n std::string item;\n\n while (std::getline (ss, item, delim) ) {\n elems.push_back (item);\n }\n\n return elems;\n}\n\nvoid\nmergePropertyTrees (boost::property_tree::ptree &ptMerged,\n const boost::property_tree::ptree &ptSecond, int level )\n{\n \/\/ Value or object or array\n if (level > 0 && ptSecond.empty() ) {\n \/\/ Copy value\n ptMerged = ptSecond;\n } else if (level > 0 && ptSecond.count (std::string() ) == ptSecond.size() ) {\n \/\/ Copy array\n ptMerged = ptSecond;\n } else {\n auto it = ptSecond.begin();\n\n for (; it != ptSecond.end(); ++it) {\n boost::property_tree::ptree child = ptMerged.get_child (it->first.data(),\n boost::property_tree::ptree() );\n mergePropertyTrees (child, it->second, level + 1);\n\n ptMerged.erase (it->first.data() );\n ptMerged.add_child (it->first.data(), child);\n }\n }\n}\n\nstatic std::string\nloadFile (boost::property_tree::ptree &config,\n const boost::filesystem::path &file)\n{\n boost::filesystem::path extension = file.extension();\n boost::filesystem::path extension2 = file.stem().extension();\n std::string fileName = file.filename().string();\n boost::property_tree::ptree readConfig;\n\n if (extension2.string() == \".conf\") {\n if (extension.string() == \".json\") {\n boost::property_tree::read_json (file.string(), readConfig);\n } else if (extension.string() == \".info\") {\n boost::property_tree::read_info (file.string(), readConfig);\n } else if (extension.string() == \".ini\") {\n boost::property_tree::read_ini (file.string(), readConfig);\n } else if (extension.string() == \".xml\") {\n boost::property_tree::read_xml (file.string(), readConfig);\n } else {\n throw ParseException (\"Unknonw file format\");\n }\n } else {\n throw ParseException (\"Unknonw file format\");\n }\n\n mergePropertyTrees (config, readConfig);\n\n config.put (\"configPath\", file.parent_path().string() );\n\n fileName = fileName.substr (0, fileName.size() - extension.string().size() );\n fileName = fileName.substr (0, fileName.size() - extension2.string().size() );\n\n return fileName;\n}\n\nstatic std::string\ndiffPathToKey (const boost::filesystem::path &path,\n const boost::filesystem::path &ancestorPath)\n{\n boost::filesystem::path diffpath;\n\n boost::filesystem::path tmppath = path;\n\n while (tmppath != ancestorPath) {\n diffpath = tmppath.stem() \/ diffpath;\n tmppath = tmppath.parent_path();\n }\n\n tmppath = diffpath;\n\n boost::property_tree::ptree loadedConfig;\n std::string key;\n\n for (auto it = tmppath.begin(); it != tmppath.end(); it ++) {\n if (key.empty() ) {\n key = it->string();\n } else {\n key += \".\" + it->string();\n }\n }\n\n return key;\n}\n\nstatic void\nloadModulesConfigFromDir (boost::property_tree::ptree &config,\n const boost::filesystem::path &dir, const boost::filesystem::path &parentDir)\n{\n GST_INFO (\"Looking for config files in %s\", dir.string().c_str() );\n\n if (!boost::filesystem::is_directory (dir) ) {\n GST_WARNING (\"Unable to load config files from: %s, it is not a directory\",\n dir.string().c_str() );\n return;\n }\n\n boost::filesystem::directory_iterator end_itr;\n\n for ( boost::filesystem::directory_iterator itr ( dir ); itr != end_itr;\n ++itr ) {\n if (boost::filesystem::is_regular (*itr) ) {\n try {\n boost::property_tree::ptree moduleConfig;\n std::string fileName = loadFile (moduleConfig, itr->path() );\n std::string key = diffPathToKey (itr->path().parent_path(), parentDir);\n boost::property_tree::ptree loadedConfig;\n\n key = key.empty() ? \"modules\" : \"modules.\" + key;\n key += \".\" + fileName;\n\n loadedConfig.put_child (key, moduleConfig);\n mergePropertyTrees (config, loadedConfig);\n\n GST_INFO (\"Loaded module config from: %s\", itr->path().string().c_str() );\n } catch (ParseException &e) {\n \/\/ Ignore this exceptions here\n }\n } else if (boost::filesystem::is_directory (*itr) ) {\n loadModulesConfigFromDir (config, itr->path(), parentDir);\n }\n }\n}\n\nstatic void\nloadModulesConfig (boost::property_tree::ptree &config,\n const boost::filesystem::path &configFilePath, std::string modulesConfigPath)\n{\n std::list <std::string> locations;\n\n if (modulesConfigPath.empty() ) {\n boost::filesystem::path modulesConfigDir = configFilePath.parent_path() \/\n \"modules\";\n\n modulesConfigPath = modulesConfigDir.string();\n }\n\n locations = split (modulesConfigPath, ':');\n\n for (std::string location : locations) {\n boost::filesystem::path dir (location);\n dir.normalize();\n\n loadModulesConfigFromDir (config, dir, dir);\n }\n}\n\nvoid\nloadConfig (boost::property_tree::ptree &config, const std::string &file_name,\n const std::string &modulesConfigPath)\n{\n boost::filesystem::path configFilePath (file_name);\n GST_INFO (\"Reading configuration from: %s\", file_name.c_str () );\n\n try {\n loadFile (config, configFilePath);\n } catch (ParseException &e) {\n GST_ERROR (\"Error reading configuration: %s\", e.what() );\n std::cerr << \"Error reading configuration: \" << e.what() << std::endl;\n exit (1);\n } catch (boost::property_tree::ptree_error &e) {\n GST_ERROR (\"Error reading configuration: %s\", e.what() );\n std::cerr << \"Error reading configuration: \" << e.what() << std::endl;\n exit (1);\n }\n\n loadModulesConfig (config, configFilePath, modulesConfigPath);\n\n GST_INFO (\"Configuration loaded successfully\");\n\n std::ostringstream oss;\n boost::property_tree::write_json (oss, config, true);\n std::string infoConfig = oss.str();\n\n GST_INFO (\"Loaded config in effect:\\n%s\", infoConfig.c_str() );\n}\n\n} \/* kurento *\/\n\nstatic void init_debug() __attribute__((constructor));\n\nstatic void init_debug() {\n GST_DEBUG_CATEGORY_INIT (GST_CAT_DEFAULT, GST_DEFAULT_NAME, 0,\n GST_DEFAULT_NAME);\n}\n<commit_msg>loadConfig: Catch proper exceptions on parse error<commit_after>\/*\n * (C) Copyright 2015 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#include <gst\/gst.h>\n\n#include \"loadConfig.hpp\"\n\n#include <iostream>\n#include <queue>\n#include <list>\n#include <boost\/filesystem.hpp>\n#include <boost\/foreach.hpp>\n#include <boost\/property_tree\/json_parser.hpp>\n#include <boost\/property_tree\/info_parser.hpp>\n#include <boost\/property_tree\/ini_parser.hpp>\n#include <boost\/property_tree\/xml_parser.hpp>\n#include <utility>\n\n#define GST_CAT_DEFAULT kurento_load_config\nGST_DEBUG_CATEGORY_STATIC (GST_CAT_DEFAULT);\n#define GST_DEFAULT_NAME \"KurentoLoadConfig\"\n\nnamespace kurento\n{\n\nclass ParseException : public virtual std::exception\n{\npublic:\n ParseException(std::string message) : message(std::move(message)){};\n\n ~ParseException() override = default;\n\n const char *what() const noexcept override { return message.c_str(); };\n\n const std::string &getMessage() const\n {\n return message;\n };\n\nprivate:\n std::string message;\n};\n\nstatic std::list<std::string>\nsplit (const std::string &s, char delim)\n{\n std::list<std::string> elems;\n std::stringstream ss (s);\n std::string item;\n\n while (std::getline (ss, item, delim) ) {\n elems.push_back (item);\n }\n\n return elems;\n}\n\nvoid\nmergePropertyTrees (boost::property_tree::ptree &ptMerged,\n const boost::property_tree::ptree &ptSecond, int level )\n{\n \/\/ Value or object or array\n if (level > 0 && ptSecond.empty() ) {\n \/\/ Copy value\n ptMerged = ptSecond;\n } else if (level > 0 && ptSecond.count (std::string() ) == ptSecond.size() ) {\n \/\/ Copy array\n ptMerged = ptSecond;\n } else {\n auto it = ptSecond.begin();\n\n for (; it != ptSecond.end(); ++it) {\n boost::property_tree::ptree child = ptMerged.get_child (it->first.data(),\n boost::property_tree::ptree() );\n mergePropertyTrees (child, it->second, level + 1);\n\n ptMerged.erase (it->first.data() );\n ptMerged.add_child (it->first.data(), child);\n }\n }\n}\n\nstatic std::string\nloadFile (boost::property_tree::ptree &config,\n const boost::filesystem::path &file)\n{\n boost::filesystem::path extension = file.extension();\n boost::filesystem::path extension2 = file.stem().extension();\n std::string fileName = file.filename().string();\n boost::property_tree::ptree readConfig;\n\n if (extension2.string() == \".conf\") {\n if (extension.string() == \".json\") {\n try {\n boost::property_tree::read_json (file.string(), readConfig);\n } catch (boost::property_tree::json_parser_error &e) {\n throw ParseException (std::string(\"Parse error: \") + e.what());\n }\n } else if (extension.string() == \".info\") {\n try {\n boost::property_tree::read_info (file.string(), readConfig);\n } catch (boost::property_tree::info_parser_error &e) {\n throw ParseException (std::string(\"Parse error: \") + e.what());\n }\n } else if (extension.string() == \".ini\") {\n try {\n boost::property_tree::read_ini (file.string(), readConfig);\n } catch (boost::property_tree::ini_parser_error &e) {\n throw ParseException (std::string(\"Parse error: \") + e.what());\n }\n } else if (extension.string() == \".xml\") {\n try {\n boost::property_tree::read_xml (file.string(), readConfig);\n } catch (boost::property_tree::xml_parser_error &e) {\n throw ParseException (std::string(\"Parse error: \") + e.what());\n }\n } else {\n throw ParseException (\"Unknown file format\");\n }\n } else {\n throw ParseException (\"Unknown file format\");\n }\n\n mergePropertyTrees (config, readConfig);\n\n config.put (\"configPath\", file.parent_path().string() );\n\n fileName = fileName.substr (0, fileName.size() - extension.string().size() );\n fileName = fileName.substr (0, fileName.size() - extension2.string().size() );\n\n return fileName;\n}\n\nstatic std::string\ndiffPathToKey (const boost::filesystem::path &path,\n const boost::filesystem::path &ancestorPath)\n{\n boost::filesystem::path diffpath;\n\n boost::filesystem::path tmppath = path;\n\n while (tmppath != ancestorPath) {\n diffpath = tmppath.stem() \/ diffpath;\n tmppath = tmppath.parent_path();\n }\n\n tmppath = diffpath;\n\n boost::property_tree::ptree loadedConfig;\n std::string key;\n\n for (auto it = tmppath.begin(); it != tmppath.end(); it ++) {\n if (key.empty() ) {\n key = it->string();\n } else {\n key += \".\" + it->string();\n }\n }\n\n return key;\n}\n\nstatic void\nloadModulesConfigFromDir (boost::property_tree::ptree &config,\n const boost::filesystem::path &dir, const boost::filesystem::path &parentDir)\n{\n GST_INFO (\"Looking for config files in %s\", dir.string().c_str() );\n\n if (!boost::filesystem::is_directory (dir) ) {\n GST_WARNING (\"Unable to load config files from: %s, it is not a directory\",\n dir.string().c_str() );\n return;\n }\n\n boost::filesystem::directory_iterator end_itr;\n\n for ( boost::filesystem::directory_iterator itr ( dir ); itr != end_itr;\n ++itr ) {\n if (boost::filesystem::is_regular (*itr) ) {\n try {\n boost::property_tree::ptree moduleConfig;\n std::string fileName = loadFile (moduleConfig, itr->path() );\n std::string key = diffPathToKey (itr->path().parent_path(), parentDir);\n boost::property_tree::ptree loadedConfig;\n\n key = key.empty() ? \"modules\" : \"modules.\" + key;\n key += \".\" + fileName;\n\n loadedConfig.put_child (key, moduleConfig);\n mergePropertyTrees (config, loadedConfig);\n\n GST_INFO (\"Loaded module config from: %s\", itr->path().string().c_str() );\n } catch (ParseException &e) {\n GST_ERROR (\"Error reading configuration: %s\", e.what());\n std::cerr << \"Error reading configuration: \" << e.what() << std::endl;\n }\n } else if (boost::filesystem::is_directory (*itr) ) {\n loadModulesConfigFromDir (config, itr->path(), parentDir);\n }\n }\n}\n\nstatic void\nloadModulesConfig (boost::property_tree::ptree &config,\n const boost::filesystem::path &configFilePath, std::string modulesConfigPath)\n{\n std::list <std::string> locations;\n\n if (modulesConfigPath.empty() ) {\n boost::filesystem::path modulesConfigDir = configFilePath.parent_path() \/\n \"modules\";\n\n modulesConfigPath = modulesConfigDir.string();\n }\n\n locations = split (modulesConfigPath, ':');\n\n for (std::string location : locations) {\n boost::filesystem::path dir (location);\n dir.normalize();\n\n loadModulesConfigFromDir (config, dir, dir);\n }\n}\n\nvoid\nloadConfig (boost::property_tree::ptree &config, const std::string &file_name,\n const std::string &modulesConfigPath)\n{\n boost::filesystem::path configFilePath (file_name);\n GST_INFO (\"Reading configuration from: %s\", file_name.c_str () );\n\n try {\n loadFile (config, configFilePath);\n } catch (ParseException &e) {\n GST_ERROR (\"Error reading configuration: %s\", e.what() );\n std::cerr << \"Error reading configuration: \" << e.what() << std::endl;\n exit (1);\n } catch (boost::property_tree::ptree_error &e) {\n GST_ERROR (\"Error reading configuration: %s\", e.what() );\n std::cerr << \"Error reading configuration: \" << e.what() << std::endl;\n exit (1);\n }\n\n loadModulesConfig (config, configFilePath, modulesConfigPath);\n\n GST_INFO (\"Configuration loaded successfully\");\n\n std::ostringstream oss;\n boost::property_tree::write_json (oss, config, true);\n std::string infoConfig = oss.str();\n\n GST_INFO (\"Loaded config in effect:\\n%s\", infoConfig.c_str() );\n}\n\n} \/* kurento *\/\n\nstatic void init_debug() __attribute__((constructor));\n\nstatic void init_debug() {\n GST_DEBUG_CATEGORY_INIT (GST_CAT_DEFAULT, GST_DEFAULT_NAME, 0,\n GST_DEFAULT_NAME);\n}\n<|endoftext|>"} {"text":"<commit_before><commit_msg>this return value is always true<commit_after><|endoftext|>"} {"text":"<commit_before>#include <crow.h>\n#include <json.h>\n#include <mustache.h>\n\n#include <boost\/program_options.hpp>\n\n#include <sstream>\n#include <iostream>\n#include <fstream>\n#include <map>\n#include <string>\n#include <thread>\n\nusing namespace boost::program_options;\n\nstd::map<std::string, std::string> name_pass_map;\nstd::map<std::string, int> name_money_map;\nstd::map<std::string, std::string> name_token_map;\nstd::mutex money_mutex;\n\nstd::string file_to_string(const std::string& filename) {\n std::ifstream ifs(filename.c_str());\n if (!ifs.is_open())\n throw std::runtime_error(\"could not open JSON file : \" + filename);\n return std::string(\n (std::istreambuf_iterator<char>(ifs)),\n std::istreambuf_iterator<char>());\n}\n\nstd::string token_from_header(const crow::ci_map& header) {\n std::stringstream ss;\n auto it = header.find(\"User-Agent\");\n ss << it->second;\n return ss.str();\n}\n\nvoid fill_user_pass(const crow::json::rvalue& val) {\n for (int i = 0; i < val[\"users\"].size(); ++i)\n name_pass_map.insert(\n std::make_pair(\n val[\"users\"][i][\"name\"].s(),\n val[\"users\"][i][\"pass\"].s()));\n}\n\nvoid fill_user_money(const crow::json::rvalue& val) {\n for (int i = 0; i < val[\"users\"].size(); ++i)\n name_money_map.insert(\n std::make_pair(\n val[\"users\"][i][\"name\"].s(),\n (int)val[\"users\"][i][\"money\"].d()));\n}\n\nint main(int ac, char** av)\n{\n std::string path = \".\/\";\n std::string data_file = \"data.JSON\";\n try {\n options_description desc(\"Allowed options\");\n desc.add_options()\n (\"help,h\", \"produce help message\")\n (\"input-path,i\", value<std::string>(), \"input path for files\")\n (\"data-file,d\", value<std::string>(), \"JSON data file\")\n ;\n variables_map vm;\n store(command_line_parser(ac, av).options(desc).run(), vm);\n if (vm.count(\"help\")) {\n std::cout << desc << std::endl;\n return 1;\n }\n if (vm.count(\"input-path\")) {\n path = vm[\"input-path\"].as<std::string>();\n }\n if (vm.count(\"data-file\")) {\n data_file = vm[\"data-file\"].as<std::string>();\n }\n data_file = path + data_file;\n crow::SimpleApp app;\n crow::mustache::set_base(\".\/\");\n std::string data_str = file_to_string(\".\/data.JSON\");\n crow::json::rvalue val = crow::json::load(data_str);\n fill_user_pass(val);\n fill_user_money(val);\n\n CROW_ROUTE(app, \"\/\")\n ([]{\n crow::mustache::context ctx;\n return crow::mustache::load(\"index.html\").render();\n });\n\n CROW_ROUTE(app, \"\/index.html\")\n ([]{\n crow::mustache::context ctx;\n return crow::mustache::load(\"index.html\").render();\n });\n\n CROW_ROUTE(app, \"\/do_stuff.js\")\n ([]{\n crow::mustache::context ctx;\n return crow::mustache::load(\"do_stuff.js\").render();\n });\n\n CROW_ROUTE(app, \"\/api\/list\/\")\n ([]{\n crow::json::wvalue x;\n int i = 0;\n for (auto it : name_money_map) {\n x[\"message\"][i][\"name\"] = it.first;\n x[\"message\"][i][\"money\"] = it.second;\n std::string status = \"offline\";\n if (name_token_map.find(it.first) != name_token_map.end())\n status = \"online\";\n x[\"message\"][i][\"status\"] = status;\n i++;\n }\n return x;\n });\n\n CROW_ROUTE(app, \"\/api\/whoami\/\")\n ([](const crow::request& req){\n std::string token = token_from_header(req.headers);\n for (auto ite : name_token_map) {\n if (ite.second == token) {\n return crow::response(ite.first);\n } else {\n std::cout << ite.second << \" != \" << token << std::endl;\n }\n }\n return crow::response(400, \"not logged in!\");\n });\n\n CROW_ROUTE(app, \"\/api\/login\/\")\n ([](const crow::request& req){\n std::string user_name = \"\";\n std::string user_pass = \"\";\n if (req.url_params.get(\"user\"))\n user_name = req.url_params.get(\"user\");\n else\n return crow::response(400, \"need a 'user' in the request!\");\n if (req.url_params.get(\"pass\"))\n user_pass = req.url_params.get(\"pass\");\n else\n return crow::response(400, \"need a 'pass' in the request!\");\n std::string token = token_from_header(req.headers);\n auto name_pass_it = name_pass_map.find(user_name);\n if (name_pass_it == name_pass_map.end())\n return crow::response(400, \"unknown 'user'!\");\n if (name_pass_it->second != user_pass)\n return crow::response(500, \"login failed!\");\n \/\/ register new token\n name_token_map.insert(std::make_pair(user_name, token));\n auto it = name_money_map.find(user_name);\n if (it != name_money_map.end())\n return crow::response(std::to_string(it->second));\n else\n return crow::response(\"0\");\n });\n\n CROW_ROUTE(app, \"\/api\/send\/\")\n ([](const crow::request& req){\n std::string from_name = \"\";\n std::string to_name = \"\";\n int value = 0;\n if (req.url_params.get(\"from\"))\n from_name = req.url_params.get(\"from\");\n else\n return crow::response(400, \"need a 'from' in the request!\");\n if (req.url_params.get(\"to\"))\n to_name = req.url_params.get(\"to\");\n else\n return crow::response(400, \"need a 'to' in the request!\");\n if (req.url_params.get(\"value\"))\n value = atoi(req.url_params.get(\"value\"));\n else\n return crow::response(400, \"need a 'value' in the request!\");\n \/\/ check user has right (own the account)\n std::string token = token_from_header(req.headers);\n auto token_it = name_token_map.find(from_name);\n auto from_it = name_money_map.find(from_name);\n auto to_it = name_money_map.find(to_name);\n if (token != token_it->second)\n return crow::response(500, \"invalid credential!\");\n if (from_it == name_money_map.end())\n return crow::response(400, \"unknown 'from' user\");\n if (to_it == name_money_map.end())\n return crow::response(400, \"unknown 'to' user\");\n if (value < 0)\n return crow::response(400, \"'value' cannot be negative\");\n if (from_it == to_it)\n return crow::response(400, \"'from' and 'to' are the same\");\n if (value > from_it->second)\n return crow::response(400, \"'from' doesn't have enough money\");\n money_mutex.lock();\n from_it->second -= value;\n to_it->second += value;\n money_mutex.unlock();\n std::stringstream ss;\n ss << \"sending : \" << value << \" from \" << from_name << \" to \" << to_name;\n return crow::response(ss.str());\n });\n\n app.port(8080).multithreaded().run();\n } catch (std::exception& ex) {\n std::cerr << \"exception (std) : \" << ex.what() << std::endl;\n return -1;\n }\n return 0;\n}\n<commit_msg>added seed as a cookie<commit_after>#include <crow.h>\n#include <json.h>\n#include <mustache.h>\n\n#include <boost\/program_options.hpp>\n\n#include <sstream>\n#include <iostream>\n#include <fstream>\n#include <map>\n#include <string>\n#include <thread>\n#include <random>\n\nusing namespace boost::program_options;\n\nstd::map<std::string, std::string> name_pass_map;\nstd::map<std::string, int> name_money_map;\nstd::map<std::string, std::string> name_token_map;\nstd::map<std::string, int> name_seed_map;\nstd::mutex money_mutex;\nstd::default_random_engine generator;\nstd::uniform_int_distribution<int> distribution(1, 65535);\nauto seed_value = std::bind(distribution, generator);\n\nstd::string file_to_string(const std::string& filename) {\n std::ifstream ifs(filename.c_str());\n if (!ifs.is_open())\n throw std::runtime_error(\"could not open JSON file : \" + filename);\n return std::string(\n (std::istreambuf_iterator<char>(ifs)),\n std::istreambuf_iterator<char>());\n}\n\nstd::string token_from_header(const crow::ci_map& header) {\n std::stringstream ss;\n auto it = header.find(\"User-Agent\");\n ss << it->second;\n return ss.str();\n}\n\nvoid fill_user_pass(const crow::json::rvalue& val) {\n for (int i = 0; i < val[\"users\"].size(); ++i)\n name_pass_map.insert(\n std::make_pair(\n val[\"users\"][i][\"name\"].s(),\n val[\"users\"][i][\"pass\"].s()));\n}\n\nvoid fill_user_money(const crow::json::rvalue& val) {\n for (int i = 0; i < val[\"users\"].size(); ++i)\n name_money_map.insert(\n std::make_pair(\n val[\"users\"][i][\"name\"].s(),\n (int)val[\"users\"][i][\"money\"].d()));\n}\n\nint main(int ac, char** av)\n{\n std::string path = \".\/\";\n std::string data_file = \"data.JSON\";\n try {\n options_description desc(\"Allowed options\");\n desc.add_options()\n (\"help,h\", \"produce help message\")\n (\"input-path,i\", value<std::string>(), \"input path for files\")\n (\"data-file,d\", value<std::string>(), \"JSON data file\")\n ;\n variables_map vm;\n store(command_line_parser(ac, av).options(desc).run(), vm);\n if (vm.count(\"help\")) {\n std::cout << desc << std::endl;\n return 1;\n }\n if (vm.count(\"input-path\")) {\n path = vm[\"input-path\"].as<std::string>();\n }\n if (vm.count(\"data-file\")) {\n data_file = vm[\"data-file\"].as<std::string>();\n }\n data_file = path + data_file;\n crow::SimpleApp app;\n crow::mustache::set_base(\".\/\");\n std::string data_str = file_to_string(\".\/data.JSON\");\n crow::json::rvalue val = crow::json::load(data_str);\n fill_user_pass(val);\n fill_user_money(val);\n\n CROW_ROUTE(app, \"\/\")\n ([]{\n crow::mustache::context ctx;\n return crow::mustache::load(\"index.html\").render();\n });\n\n CROW_ROUTE(app, \"\/index.html\")\n ([]{\n crow::mustache::context ctx;\n return crow::mustache::load(\"index.html\").render();\n });\n\n CROW_ROUTE(app, \"\/do_stuff.js\")\n ([]{\n crow::mustache::context ctx;\n return crow::mustache::load(\"do_stuff.js\").render();\n });\n\n CROW_ROUTE(app, \"\/api\/list\/\")\n ([]{\n crow::json::wvalue x;\n int i = 0;\n for (auto it : name_money_map) {\n x[\"message\"][i][\"name\"] = it.first;\n x[\"message\"][i][\"money\"] = it.second;\n std::string status = \"offline\";\n if (name_token_map.find(it.first) != name_token_map.end())\n status = \"online\";\n x[\"message\"][i][\"status\"] = status;\n i++;\n }\n return x;\n });\n\n CROW_ROUTE(app, \"\/api\/login\/\")\n ([](const crow::request& req){\n std::string user_name = \"\";\n std::string user_pass = \"\";\n if (req.url_params.get(\"user\"))\n user_name = req.url_params.get(\"user\");\n else\n return crow::response(400, \"need a 'user' in the request!\");\n if (req.url_params.get(\"pass\"))\n user_pass = req.url_params.get(\"pass\");\n else\n return crow::response(400, \"need a 'pass' in the request!\");\n std::string token = token_from_header(req.headers);\n auto name_pass_it = name_pass_map.find(user_name);\n if (name_pass_it == name_pass_map.end())\n return crow::response(400, \"unknown 'user'!\");\n if (name_pass_it->second != user_pass)\n return crow::response(500, \"login failed!\");\n \/\/ register new token\n name_seed_map.insert(std::make_pair(user_name, seed_value()));\n name_token_map.insert(std::make_pair(user_name, token));\n auto money_it = name_money_map.find(user_name);\n auto seed_it = name_seed_map.find(user_name);\n crow::json::wvalue jv;\n jv[\"money\"] = money_it->second;\n jv[\"seed\"] = seed_it->second;\n return crow::response(jv);\n });\n\n CROW_ROUTE(app, \"\/api\/send\/\")\n ([](const crow::request& req){\n std::string from_name = \"\";\n std::string to_name = \"\";\n int value = 0;\n int seed = 0;\n if (req.url_params.get(\"from\"))\n from_name = req.url_params.get(\"from\");\n else\n return crow::response(400, \"HACKER!!!!\");\n if (req.url_params.get(\"to\"))\n to_name = req.url_params.get(\"to\");\n else\n return crow::response(400, \"HACKER!!!!\");\n if (req.url_params.get(\"value\"))\n value = atoi(req.url_params.get(\"value\"));\n else\n return crow::response(400, \"HACKER!!!!\");\n if (req.url_params.get(\"seed\"))\n seed = atoi(req.url_params.get(\"seed\"));\n else\n return crow::response(400, \"HACKER!!!!\");\n \/\/ check user has right (own the account)\n std::string token = token_from_header(req.headers);\n auto token_it = name_token_map.find(from_name);\n auto from_it = name_money_map.find(from_name);\n auto to_it = name_money_map.find(to_name);\n auto seed_it = name_seed_map.find(from_name);\n if (seed != seed_it->second)\n return crow::response(500, \"HACKER!!!!\");\n if (token != token_it->second)\n return crow::response(500, \"invalid credential!\");\n if (from_it == name_money_map.end())\n return crow::response(400, \"HACKER!!!!\");\n if (to_it == name_money_map.end())\n return crow::response(400, \"unknown 'to' user\");\n if (value < 0)\n return crow::response(400, \"HACKER!!!!\");\n if (from_it == to_it)\n return crow::response(400, \"'from' and 'to' are the same\");\n if (value > from_it->second)\n return crow::response(400, \"'from' doesn't have enough money\");\n money_mutex.lock();\n from_it->second -= value;\n to_it->second += value;\n money_mutex.unlock();\n std::stringstream ss;\n ss << \"sending : \" << value << \" from \" << from_name << \" to \" << to_name;\n return crow::response(ss.str());\n });\n\n app.port(8080).multithreaded().run();\n } catch (std::exception& ex) {\n std::cerr << \"exception (std) : \" << ex.what() << std::endl;\n return -1;\n }\n return 0;\n}\n<|endoftext|>"} {"text":"<commit_before>#ifndef SERVER_NETCOM_HPP\n#define SERVER_NETCOM_HPP\n\n#include <netcom_base.hpp>\n#include <SFML\/Network.hpp>\n\nnamespace server {\n class netcom : public netcom_base {\n public :\n netcom();\n ~netcom();\n\n \/\/\/ Define the maximum number of simultaneously connected clients.\n \/** If the limit is decreased and there are more connected clients than what is now allowed,\n no client will be disconnected. This will only prevent new clients to connect, until the\n new client limit is reached.\n **\/\n void set_max_client(std::size_t max_client);\n\n \/\/\/ Will return true as long as the server is listening to incoming connections.\n bool is_connected() const;\n\n \/\/\/ Start the server, listening to the given port.\n void run(std::uint16_t port);\n\n \/\/\/ Shut down the server cleanly (called by the destructor).\n \/** Calling this function on a server that is not running has no effect.\n **\/\n void terminate();\n\n private :\n struct client_t {\n std::unique_ptr<sf::TcpSocket> socket;\n actor_id_t id;\n };\n\n using client_list_t = sorted_vector<client_t, mem_var_comp(&client_t::id)>;\n\n void loop_();\n bool make_id_(actor_id_t& id);\n void free_id_(actor_id_t id);\n void remove_client_(actor_id_t cid);\n void remove_client_(client_list_t::iterator ic);\n\n std::uint16_t listen_port_;\n std::size_t max_client_;\n sf::TcpListener listener_;\n sf::SocketSelector selector_;\n\n client_list_t clients_;\n sorted_vector<actor_id_t, std::greater<request_id_t>> available_ids_;\n\n std::atomic<bool> is_connected_;\n std::atomic<bool> terminate_thread_;\n sf::Thread listener_thread_;\n };\n}\n\nnamespace message {\nnamespace server {\n namespace internal {\n ID_STRUCT(cannot_listen_port) {\n using types = type_list<std::uint16_t>;\n };\n\n ID_STRUCT(start_listening_port) {\n using types = type_list<std::uint16_t>;\n };\n\n ID_STRUCT(unknown_client) {\n using types = type_list<std::uint16_t>;\n };\n\n ID_STRUCT(client_connected) {\n using types = type_list<std::uint16_t, std::string>;\n };\n\n ID_STRUCT(client_disconnected) {\n enum class reason : std::uint8_t {\n connection_lost\n };\n\n using types = type_list<std::uint16_t, reason>;\n };\n }\n\n ID_STRUCT(connection_established) {\n using types = type_list<>;\n };\n\n ID_STRUCT(connection_failed) {\n enum class reason : std::uint8_t {\n cannot_authenticate,\n disconnected,\n timed_out\n };\n\n using types = type_list<reason>;\n };\n\n ID_STRUCT(connection_denied) {\n enum class reason : std::uint8_t {\n too_many_clients,\n unexpected_packet\n };\n\n using types = type_list<reason>;\n };\n\n ID_STRUCT(connection_granted) {\n using types = type_list<>;\n };\n}\n}\n\n#endif\n<commit_msg>Fixed using std::uint16_t instead of actor_id_t.<commit_after>#ifndef SERVER_NETCOM_HPP\n#define SERVER_NETCOM_HPP\n\n#include <netcom_base.hpp>\n#include <SFML\/Network.hpp>\n\nnamespace server {\n class netcom : public netcom_base {\n public :\n netcom();\n ~netcom();\n\n \/\/\/ Define the maximum number of simultaneously connected clients.\n \/** If the limit is decreased and there are more connected clients than what is now allowed,\n no client will be disconnected. This will only prevent new clients to connect, until the\n new client limit is reached.\n **\/\n void set_max_client(std::size_t max_client);\n\n \/\/\/ Will return true as long as the server is listening to incoming connections.\n bool is_connected() const;\n\n \/\/\/ Start the server, listening to the given port.\n void run(std::uint16_t port);\n\n \/\/\/ Shut down the server cleanly (called by the destructor).\n \/** Calling this function on a server that is not running has no effect.\n **\/\n void terminate();\n\n private :\n struct client_t {\n std::unique_ptr<sf::TcpSocket> socket;\n actor_id_t id;\n };\n\n using client_list_t = sorted_vector<client_t, mem_var_comp(&client_t::id)>;\n\n void loop_();\n bool make_id_(actor_id_t& id);\n void free_id_(actor_id_t id);\n void remove_client_(actor_id_t cid);\n void remove_client_(client_list_t::iterator ic);\n\n std::uint16_t listen_port_;\n std::size_t max_client_;\n sf::TcpListener listener_;\n sf::SocketSelector selector_;\n\n client_list_t clients_;\n sorted_vector<actor_id_t, std::greater<request_id_t>> available_ids_;\n\n std::atomic<bool> is_connected_;\n std::atomic<bool> terminate_thread_;\n sf::Thread listener_thread_;\n };\n}\n\nnamespace message {\nnamespace server {\n namespace internal {\n ID_STRUCT(cannot_listen_port) {\n using types = type_list<std::uint16_t>;\n };\n\n ID_STRUCT(start_listening_port) {\n using types = type_list<std::uint16_t>;\n };\n\n ID_STRUCT(unknown_client) {\n using types = type_list<actor_id_t>;\n };\n\n ID_STRUCT(client_connected) {\n using types = type_list<actor_id_t, std::string>;\n };\n\n ID_STRUCT(client_disconnected) {\n enum class reason : std::uint8_t {\n connection_lost\n };\n\n using types = type_list<actor_id_t, reason>;\n };\n }\n\n ID_STRUCT(connection_established) {\n using types = type_list<>;\n };\n\n ID_STRUCT(connection_failed) {\n enum class reason : std::uint8_t {\n cannot_authenticate,\n disconnected,\n timed_out\n };\n\n using types = type_list<reason>;\n };\n\n ID_STRUCT(connection_denied) {\n enum class reason : std::uint8_t {\n too_many_clients,\n unexpected_packet\n };\n\n using types = type_list<reason>;\n };\n\n ID_STRUCT(connection_granted) {\n using types = type_list<>;\n };\n}\n}\n\n#endif\n<|endoftext|>"} {"text":"<commit_before>#include <dbc\/Builder.h>\n#include <dbc\/ArgsControl.h>\n\n#define ArgError(Message, ...) \\\n\tfprintf(stderr, Message, ##__VA_ARGS__); \\\n\texit(-1);\n\nint main(int argc, const char* argv[])\n{\n\tusing namespace dbc;\n#if _DEBUG || DEBUG\n\tgen::ASM6502CG Generator(false);\n\tBuilder::Build(\"test\/main.dbs\", &Generator, true, true);\n\tBuilder::SaveSourceFile(\"out.s65\");\n\tBuilder::Destoy();\n\tPAUSE;\n#else\n\tif (argc > 1)\n\t{\n\t\tbool Verbose = false;\n\t\tbool HelpPrinted = false;\n\t\tconst char* MainFile = nullptr;\n\t\tconst char* OutFile = nullptr;\n\t\tconst char* Gen = nullptr;\n\t\tCodeGenerator* Generator = nullptr;\n\t\tint Index;\n\t\tfor (Index = 1; Index < argc; ++Index)\n\t\t{\n\t\t\tArgsControl::Command Cmd = ArgsControl::GeCommand(argv[Index]);\n\t\t\tswitch (Cmd)\n\t\t\t{\n\t\t\t\tcase ArgsControl::Command::HELP:\n\t\t\t\t\tprintf(\"=======================================\\n\");\n\t\t\t\t\tprintf(\"DamnBASIC Compiler v0.0.1\\n\");\n\t\t\t\t\tprintf(\"=======================================\\n\");\n\t\t\t\t\tprintf(\"Author: Felipe Alfonso.\\n\");\n\t\t\t\t\tprintf(\"Url: https:\/\/github.com\/vptr\/DAMNBASIC\/\\n\");\n\t\t\t\t\tprintf(\"=======================================\\n\");\n\t\t\t\t\tprintf(\"Usage:\\n\");\n\t\t\t\t\tprintf(\"\\tdbc -[command] [argument]\\n\");\n\t\t\t\t\tprintf(\"\\nExample:\\n\");\n\t\t\t\t\tprintf(\"\\tdbc -i main.dbs -t 6502 -o output.asm\\n\");\n\t\t\t\t\tprintf(\"\\nCommands:\\n\");\n\t\t\t\t\tprintf(\"\\t-i Input file.\\n\");\n\t\t\t\t\tprintf(\"\\t-t Target [6502].\\n\");\n\t\t\t\t\tprintf(\"\\t-o Output file name (optional).\\n\");\n\t\t\t\t\tprintf(\"\\t-v Verbose print (optional).\\n\");\n\t\t\t\t\tHelpPrinted = true;\n\t\t\t\t\tbreak;\n\t\t\t\t\tbreak;\n\t\t\t\tcase ArgsControl::Command::ADDFILE:\n\t\t\t\t\tif (Index + 1 < argc)\n\t\t\t\t\t{\n\t\t\t\t\t\tMainFile = argv[++Index];\n\t\t\t\t\t\tcontinue;\n\t\t\t\t\t}\n\t\t\t\t\tbreak;\n\t\t\t\tcase ArgsControl::Command::VERBOSE:\n\t\t\t\t\tVerbose = true;\n\t\t\t\t\tcontinue;\n\t\t\t\t\tbreak;\n\t\t\t\tcase ArgsControl::Command::TARGET:\n\t\t\t\t\tif (Index + 1 < argc)\n\t\t\t\t\t{\n\t\t\t\t\t\tGen = argv[++Index];\n\t\t\t\t\t\tcontinue;\n\t\t\t\t\t}\n\t\t\t\tcase ArgsControl::Command::OUTPUT:\n\t\t\t\t\tif (Index + 1 < argc && OutFile == nullptr)\n\t\t\t\t\t{\n\t\t\t\t\t\tOutFile = argv[++Index];\n\t\t\t\t\t\tcontinue;\n\t\t\t\t\t}\n\t\t\t\t\tcontinue;\n\t\t\t\t\tbreak;\n\t\t\t\tcase ArgsControl::Command::NONE:\n\t\t\t\t\tArgError(\"Invalid Argument %s\", argv[Index]);\n\t\t\t\t\tbreak;\n\t\t\t\tdefault:\n\t\t\t\t\tArgError(\"Invalid Argument %s\", argv[Index]);\n\t\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t\tif (!HelpPrinted)\n\t\t{\n\t\t\tGenType GType = ArgsControl::GetGenType(Gen);\n\t\t\tGenerator = ArgsControl::GetGenerator(GType, Verbose);\n\t\t\tif (Generator == nullptr)\n\t\t\t{\n\t\t\t\tArgError(\"Invalid target\");\n\t\t\t}\n\t\t\tif (MainFile == nullptr)\n\t\t\t{\n\t\t\t\tArgError(\"Missing input file.\");\n\t\t\t}\n\t\t\tBuilder::Build(MainFile, Generator, true, Verbose);\n\t\t\tif (OutFile == nullptr)\n\t\t\t{\n\t\t\t\tBuilder::SaveSourceFile((std::string(\"out.\") + ArgsControl::GetExt(GType)).c_str());\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\tBuilder::SaveSourceFile(OutFile);\n\t\t\t}\n\t\t\tBuilder::Destoy();\n\t\t}\n\t}\n\telse\n\t{\n\t\tArgError(\"Missing Input file.\");\n\t}\n#endif\n\treturn 0;\n}<commit_msg>debug verbose<commit_after>#include <dbc\/Builder.h>\n#include <dbc\/ArgsControl.h>\n\n#define ArgError(Message, ...) \\\n\tfprintf(stderr, Message, ##__VA_ARGS__); \\\n\texit(-1);\n\nint main(int argc, const char* argv[])\n{\n\tusing namespace dbc;\n#if _DEBUG || DEBUG\n\tgen::ASM6502CG Generator(true);\n\tBuilder::Build(\"test\/main.dbs\", &Generator, true, true);\n\tBuilder::SaveSourceFile(\"out.s65\");\n\tBuilder::Destoy();\n\tPAUSE;\n#else\n\tif (argc > 1)\n\t{\n\t\tbool Verbose = false;\n\t\tbool HelpPrinted = false;\n\t\tconst char* MainFile = nullptr;\n\t\tconst char* OutFile = nullptr;\n\t\tconst char* Gen = nullptr;\n\t\tCodeGenerator* Generator = nullptr;\n\t\tint Index;\n\t\tfor (Index = 1; Index < argc; ++Index)\n\t\t{\n\t\t\tArgsControl::Command Cmd = ArgsControl::GeCommand(argv[Index]);\n\t\t\tswitch (Cmd)\n\t\t\t{\n\t\t\t\tcase ArgsControl::Command::HELP:\n\t\t\t\t\tprintf(\"=======================================\\n\");\n\t\t\t\t\tprintf(\"DamnBASIC Compiler v0.0.1\\n\");\n\t\t\t\t\tprintf(\"=======================================\\n\");\n\t\t\t\t\tprintf(\"Author: Felipe Alfonso.\\n\");\n\t\t\t\t\tprintf(\"Url: https:\/\/github.com\/vptr\/DAMNBASIC\/\\n\");\n\t\t\t\t\tprintf(\"=======================================\\n\");\n\t\t\t\t\tprintf(\"Usage:\\n\");\n\t\t\t\t\tprintf(\"\\tdbc -[command] [argument]\\n\");\n\t\t\t\t\tprintf(\"\\nExample:\\n\");\n\t\t\t\t\tprintf(\"\\tdbc -i main.dbs -t 6502 -o output.asm\\n\");\n\t\t\t\t\tprintf(\"\\nCommands:\\n\");\n\t\t\t\t\tprintf(\"\\t-i Input file.\\n\");\n\t\t\t\t\tprintf(\"\\t-t Target [6502].\\n\");\n\t\t\t\t\tprintf(\"\\t-o Output file name (optional).\\n\");\n\t\t\t\t\tprintf(\"\\t-v Verbose print (optional).\\n\");\n\t\t\t\t\tHelpPrinted = true;\n\t\t\t\t\tbreak;\n\t\t\t\t\tbreak;\n\t\t\t\tcase ArgsControl::Command::ADDFILE:\n\t\t\t\t\tif (Index + 1 < argc)\n\t\t\t\t\t{\n\t\t\t\t\t\tMainFile = argv[++Index];\n\t\t\t\t\t\tcontinue;\n\t\t\t\t\t}\n\t\t\t\t\tbreak;\n\t\t\t\tcase ArgsControl::Command::VERBOSE:\n\t\t\t\t\tVerbose = true;\n\t\t\t\t\tcontinue;\n\t\t\t\t\tbreak;\n\t\t\t\tcase ArgsControl::Command::TARGET:\n\t\t\t\t\tif (Index + 1 < argc)\n\t\t\t\t\t{\n\t\t\t\t\t\tGen = argv[++Index];\n\t\t\t\t\t\tcontinue;\n\t\t\t\t\t}\n\t\t\t\tcase ArgsControl::Command::OUTPUT:\n\t\t\t\t\tif (Index + 1 < argc && OutFile == nullptr)\n\t\t\t\t\t{\n\t\t\t\t\t\tOutFile = argv[++Index];\n\t\t\t\t\t\tcontinue;\n\t\t\t\t\t}\n\t\t\t\t\tcontinue;\n\t\t\t\t\tbreak;\n\t\t\t\tcase ArgsControl::Command::NONE:\n\t\t\t\t\tArgError(\"Invalid Argument %s\", argv[Index]);\n\t\t\t\t\tbreak;\n\t\t\t\tdefault:\n\t\t\t\t\tArgError(\"Invalid Argument %s\", argv[Index]);\n\t\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t\tif (!HelpPrinted)\n\t\t{\n\t\t\tGenType GType = ArgsControl::GetGenType(Gen);\n\t\t\tGenerator = ArgsControl::GetGenerator(GType, Verbose);\n\t\t\tif (Generator == nullptr)\n\t\t\t{\n\t\t\t\tArgError(\"Invalid target\");\n\t\t\t}\n\t\t\tif (MainFile == nullptr)\n\t\t\t{\n\t\t\t\tArgError(\"Missing input file.\");\n\t\t\t}\n\t\t\tBuilder::Build(MainFile, Generator, true, Verbose);\n\t\t\tif (OutFile == nullptr)\n\t\t\t{\n\t\t\t\tBuilder::SaveSourceFile((std::string(\"out.\") + ArgsControl::GetExt(GType)).c_str());\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\tBuilder::SaveSourceFile(OutFile);\n\t\t\t}\n\t\t\tBuilder::Destoy();\n\t\t}\n\t}\n\telse\n\t{\n\t\tArgError(\"Missing Input file.\");\n\t}\n#endif\n\treturn 0;\n}<|endoftext|>"} {"text":"<commit_before>\/*\n The MIT License (MIT)\n\n Copyright (c) 2014 Antonio SJ Musumeci <trapexit@spawn.link>\n\n Permission is hereby granted, free of charge, to any person obtaining a copy\n of this software and associated documentation files (the \"Software\"), to deal\n in the Software without restriction, including without limitation the rights\n to use, copy, modify, merge, publish, distribute, sublicense, and\/or sell\n copies of the Software, and to permit persons to whom the Software is\n furnished to do so, subject to the following conditions:\n\n The above copyright notice and this permission notice shall be included in\n all copies or substantial portions of the Software.\n\n THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\n IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\n FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE\n AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\n LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,\n OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN\n THE SOFTWARE.\n*\/\n\n#ifndef __POLICY_HPP__\n#define __POLICY_HPP__\n\n#include <string>\n#include <vector>\n#include <map>\n\n#include \"path.hpp\"\n#include \"fs.hpp\"\n#include \"category.hpp\"\n\nnamespace mergerfs\n{\n class Policy\n {\n public:\n struct Enum\n {\n enum Type\n {\n invalid = -1,\n BEGIN = 0,\n all = BEGIN,\n einval,\n enosys,\n enotsup,\n epmfs,\n erofs,\n exdev,\n ff,\n ffwp,\n fwfs,\n lfs,\n mfs,\n newest,\n rand,\n END\n };\n };\n\n struct Func\n {\n typedef std::string string;\n typedef std::size_t size_t;\n typedef std::vector<string> strvec;\n typedef const string cstring;\n typedef const size_t csize_t;\n typedef const strvec cstrvec;\n typedef const Category::Enum::Type CType;\n\n typedef int (*Ptr)(CType,cstrvec&,cstring&,csize_t,strvec&);\n\n class Action\n {\n public:\n Action(const Policy *p)\n : func(p->_func)\n {}\n\n int\n operator()(cstrvec& b,cstring& c,csize_t d,strvec& e)\n {\n return func(Category::Enum::action,b,c,d,e);\n }\n\n private:\n const Ptr func;\n };\n\n class Create\n {\n public:\n Create(const Policy *p)\n : func(p->_func)\n {}\n\n int\n operator()(cstrvec& b,cstring& c,csize_t d,strvec& e)\n {\n return func(Category::Enum::create,b,c,d,e);\n }\n\n private:\n const Ptr func;\n };\n\n class Search\n {\n public:\n Search(const Policy *p)\n : func(p->_func)\n {}\n\n int\n operator()(cstrvec& b,cstring& c,csize_t d,strvec& e)\n {\n return func(Category::Enum::search,b,c,d,e);\n }\n\n private:\n const Ptr func;\n };\n\n static int all(CType,cstrvec&,cstring&,csize_t,strvec&);\n static int einval(CType,cstrvec&,cstring&,csize_t,strvec&);\n static int enosys(CType,cstrvec&,cstring&,csize_t,strvec&);\n static int enotsup(CType,cstrvec&,cstring&,csize_t,strvec&);\n static int epmfs(CType,cstrvec&,cstring&,csize_t,strvec&);\n static int erofs(CType,cstrvec&,cstring&,csize_t,strvec&);\n static int exdev(CType,cstrvec&,cstring&,csize_t,strvec&);\n static int ff(CType,cstrvec&,cstring&,csize_t,strvec&);\n static int ffwp(CType,cstrvec&,cstring&,csize_t,strvec&);\n static int fwfs(CType,cstrvec&,cstring&,csize_t,strvec&);\n static int invalid(CType,cstrvec&,cstring&,csize_t,strvec&);\n static int lfs(CType,cstrvec&,cstring&,csize_t,strvec&);\n static int mfs(CType,cstrvec&,cstring&,csize_t,strvec&);\n static int newest(CType,cstrvec&,cstring&,csize_t,strvec&);\n static int rand(CType,cstrvec&,cstring&,csize_t,strvec&);\n };\n\n private:\n Enum::Type _enum;\n std::string _str;\n Func::Ptr _func;\n\n public:\n Policy()\n : _enum(invalid),\n _str(invalid),\n _func(invalid)\n {\n }\n\n Policy(const Enum::Type enum_,\n const std::string &str_,\n const Func::Ptr func_)\n : _enum(enum_),\n _str(str_),\n _func(func_)\n {\n }\n\n public:\n operator const Enum::Type() const { return _enum; }\n operator const std::string&() const { return _str; }\n operator const Func::Ptr() const { return _func; }\n operator const Policy*() const { return this; }\n\n bool operator==(const Enum::Type enum_) const\n { return _enum == enum_; }\n bool operator==(const std::string &str_) const\n { return _str == str_; }\n bool operator==(const Func::Ptr func_) const\n { return _func == func_; }\n\n bool operator!=(const Policy &r) const\n { return _enum != r._enum; }\n\n bool operator<(const Policy &r) const\n { return _enum < r._enum; }\n\n public:\n static const Policy &find(const std::string&);\n static const Policy &find(const Enum::Type);\n\n public:\n static const std::vector<Policy> _policies_;\n static const Policy * const policies;\n\n static const Policy &invalid;\n static const Policy &all;\n static const Policy &enosys;\n static const Policy &enotsup;\n static const Policy &epmfs;\n static const Policy &erofs;\n static const Policy &exdev;\n static const Policy &ff;\n static const Policy &ffwp;\n static const Policy &fwfs;\n static const Policy &lfs;\n static const Policy &mfs;\n static const Policy &newest;\n static const Policy &rand;\n };\n}\n\n#endif\n<commit_msg>forgot to add einval to policy<commit_after>\/*\n The MIT License (MIT)\n\n Copyright (c) 2014 Antonio SJ Musumeci <trapexit@spawn.link>\n\n Permission is hereby granted, free of charge, to any person obtaining a copy\n of this software and associated documentation files (the \"Software\"), to deal\n in the Software without restriction, including without limitation the rights\n to use, copy, modify, merge, publish, distribute, sublicense, and\/or sell\n copies of the Software, and to permit persons to whom the Software is\n furnished to do so, subject to the following conditions:\n\n The above copyright notice and this permission notice shall be included in\n all copies or substantial portions of the Software.\n\n THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\n IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\n FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE\n AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\n LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,\n OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN\n THE SOFTWARE.\n*\/\n\n#ifndef __POLICY_HPP__\n#define __POLICY_HPP__\n\n#include <string>\n#include <vector>\n#include <map>\n\n#include \"path.hpp\"\n#include \"fs.hpp\"\n#include \"category.hpp\"\n\nnamespace mergerfs\n{\n class Policy\n {\n public:\n struct Enum\n {\n enum Type\n {\n invalid = -1,\n BEGIN = 0,\n all = BEGIN,\n einval,\n enosys,\n enotsup,\n epmfs,\n erofs,\n exdev,\n ff,\n ffwp,\n fwfs,\n lfs,\n mfs,\n newest,\n rand,\n END\n };\n };\n\n struct Func\n {\n typedef std::string string;\n typedef std::size_t size_t;\n typedef std::vector<string> strvec;\n typedef const string cstring;\n typedef const size_t csize_t;\n typedef const strvec cstrvec;\n typedef const Category::Enum::Type CType;\n\n typedef int (*Ptr)(CType,cstrvec&,cstring&,csize_t,strvec&);\n\n class Action\n {\n public:\n Action(const Policy *p)\n : func(p->_func)\n {}\n\n int\n operator()(cstrvec& b,cstring& c,csize_t d,strvec& e)\n {\n return func(Category::Enum::action,b,c,d,e);\n }\n\n private:\n const Ptr func;\n };\n\n class Create\n {\n public:\n Create(const Policy *p)\n : func(p->_func)\n {}\n\n int\n operator()(cstrvec& b,cstring& c,csize_t d,strvec& e)\n {\n return func(Category::Enum::create,b,c,d,e);\n }\n\n private:\n const Ptr func;\n };\n\n class Search\n {\n public:\n Search(const Policy *p)\n : func(p->_func)\n {}\n\n int\n operator()(cstrvec& b,cstring& c,csize_t d,strvec& e)\n {\n return func(Category::Enum::search,b,c,d,e);\n }\n\n private:\n const Ptr func;\n };\n\n static int all(CType,cstrvec&,cstring&,csize_t,strvec&);\n static int einval(CType,cstrvec&,cstring&,csize_t,strvec&);\n static int enosys(CType,cstrvec&,cstring&,csize_t,strvec&);\n static int enotsup(CType,cstrvec&,cstring&,csize_t,strvec&);\n static int epmfs(CType,cstrvec&,cstring&,csize_t,strvec&);\n static int erofs(CType,cstrvec&,cstring&,csize_t,strvec&);\n static int exdev(CType,cstrvec&,cstring&,csize_t,strvec&);\n static int ff(CType,cstrvec&,cstring&,csize_t,strvec&);\n static int ffwp(CType,cstrvec&,cstring&,csize_t,strvec&);\n static int fwfs(CType,cstrvec&,cstring&,csize_t,strvec&);\n static int invalid(CType,cstrvec&,cstring&,csize_t,strvec&);\n static int lfs(CType,cstrvec&,cstring&,csize_t,strvec&);\n static int mfs(CType,cstrvec&,cstring&,csize_t,strvec&);\n static int newest(CType,cstrvec&,cstring&,csize_t,strvec&);\n static int rand(CType,cstrvec&,cstring&,csize_t,strvec&);\n };\n\n private:\n Enum::Type _enum;\n std::string _str;\n Func::Ptr _func;\n\n public:\n Policy()\n : _enum(invalid),\n _str(invalid),\n _func(invalid)\n {\n }\n\n Policy(const Enum::Type enum_,\n const std::string &str_,\n const Func::Ptr func_)\n : _enum(enum_),\n _str(str_),\n _func(func_)\n {\n }\n\n public:\n operator const Enum::Type() const { return _enum; }\n operator const std::string&() const { return _str; }\n operator const Func::Ptr() const { return _func; }\n operator const Policy*() const { return this; }\n\n bool operator==(const Enum::Type enum_) const\n { return _enum == enum_; }\n bool operator==(const std::string &str_) const\n { return _str == str_; }\n bool operator==(const Func::Ptr func_) const\n { return _func == func_; }\n\n bool operator!=(const Policy &r) const\n { return _enum != r._enum; }\n\n bool operator<(const Policy &r) const\n { return _enum < r._enum; }\n\n public:\n static const Policy &find(const std::string&);\n static const Policy &find(const Enum::Type);\n\n public:\n static const std::vector<Policy> _policies_;\n static const Policy * const policies;\n\n static const Policy &invalid;\n static const Policy &all;\n static const Policy &einval;\n static const Policy &enosys;\n static const Policy &enotsup;\n static const Policy &epmfs;\n static const Policy &erofs;\n static const Policy &exdev;\n static const Policy &ff;\n static const Policy &ffwp;\n static const Policy &fwfs;\n static const Policy &lfs;\n static const Policy &mfs;\n static const Policy &newest;\n static const Policy &rand;\n };\n}\n\n#endif\n<|endoftext|>"} {"text":"<commit_before>#include <stdio.h>\n#include <dirent.h>\n#include <sys\/stat.h>\n#include <sys\/param.h>\n#include <sys\/mount.h>\n#include <fnmatch.h>\n#include <stdarg.h>\n\n#include \"pen.h\"\n#include \"file_system.h\"\n#include \"memory.h\"\n#include \"pen_string.h\"\n\nextern pen::user_info pen_user_info;\n\n#ifdef __linux__\n#define get_mtime(s) s.st_mtime\n#else\n#define get_mtime(s) s.st_mtimespec.tv_sec\n#endif\n\nnamespace pen\n{\n pen_error filesystem_read_file_to_buffer( const char* filename, void** p_buffer, u32 &buffer_size )\n {\n *p_buffer = NULL;\n\n FILE* p_file = fopen( filename, \"rb\" );\n\n if( p_file )\n {\n fseek( p_file, 0L, SEEK_END );\n long size = ftell( p_file );\n\n fseek( p_file, 0L, SEEK_SET );\n\n buffer_size = ( u32 ) size;\n\n *p_buffer = pen::memory_alloc( buffer_size+1 );\n\n fread( *p_buffer, 1, buffer_size, p_file );\n \n ((u8*)*p_buffer)[buffer_size] = '\\0';\n\n fclose( p_file );\n\n return PEN_ERR_OK;\n }\n\n return PEN_ERR_FILE_NOT_FOUND;\n }\n \n pen_error filesystem_enum_volumes( fs_tree_node &results )\n {\n#ifndef __linux__\n struct statfs* mounts;\n int num_mounts = getmntinfo(&mounts, MNT_WAIT);\n \n results.children = (fs_tree_node*)pen::memory_alloc( sizeof(fs_tree_node) * num_mounts );\n results.num_children = num_mounts;pen_user_info\n \n static const c8* volumes_name = \"Volumes\";\n \n u32 len = pen::string_length(volumes_name);\n results.name = (c8*)pen::memory_alloc( len + 1 );\n pen::memory_cpy(results.name, volumes_name, len);\n results.name[ len ] = '\\0';\n \n for( int i = 0; i < num_mounts; ++i )\n {\n len = pen::string_length( mounts[i].f_mntonname );\n results.children[i].name = (c8*)pen::memory_alloc( len + 1 );\n \n pen::memory_cpy(results.children[i].name, mounts[i].f_mntonname, len);\n results.children[i].name[len] = '\\0';\n \n results.children[i].children = nullptr;\n results.children[i].num_children = 0;\n }\n#endif\n return PEN_ERR_OK;\n }\n \n bool match_file( struct dirent *ent, s32 num_wildcards, va_list wildcards )\n {\n if( num_wildcards <= 0 )\n {\n return true;\n }\n \n va_list wildcards_consume;\n va_copy(wildcards_consume, wildcards);\n \n if( ent->d_type != DT_DIR )\n {\n for( s32 i = 0; i < num_wildcards; ++i )\n {\n const char* ft = va_arg(wildcards_consume, const char*);\n \n if( fnmatch( ft, ent->d_name, 0) == 0 )\n {\n return true;\n }\n }\n }\n else\n {\n return true;\n }\n \n return false;\n }\n \n pen_error filesystem_enum_directory( const c8* directory, fs_tree_node &results, s32 num_wildcards, ... )\n {\n va_list wc;\n va_start ( wc, num_wildcards );\n \n pen_error res = filesystem_enum_directory( directory, results, num_wildcards, wc );\n \n va_end( wc );\n \n return res;\n }\n \n pen_error filesystem_enum_directory( const c8* directory, fs_tree_node &results, s32 num_wildcards, va_list wildcards )\n {\n DIR *dir;\n struct dirent *ent;\n \n u32 num_items = 0;\n if ((dir = opendir (directory)) != NULL)\n {\n while ((ent = readdir (dir)) != NULL)\n {\n if( match_file( ent, num_wildcards, wildcards ) )\n {\n num_items++;\n }\n }\n \n closedir (dir);\n }\n \n if( num_items == 0 )\n {\n \n return PEN_ERR_FILE_NOT_FOUND;\n }\n \n if( results.children == nullptr )\n {\n \/\/alloc new mem\n results.children = (fs_tree_node*)pen::memory_alloc( sizeof(fs_tree_node) * num_items );\n pen::memory_zero(results.children, sizeof(fs_tree_node) * num_items );\n }\n else\n {\n \/\/grow buffer\n if( results.num_children < num_items )\n {\n results.children = (fs_tree_node*)pen::memory_realloc( results.children, sizeof(fs_tree_node) * num_items );\n }\n }\n \n results.num_children = num_items;\n \n u32 i = 0;\n if ((dir = opendir (directory)) != NULL)\n {\n while ((ent = readdir (dir)) != NULL)\n {\n if( match_file( ent, num_wildcards, wildcards ) )\n {\n if( results.children[i].name == nullptr )\n {\n \/\/allocate 1024 file buffer\n results.children[i].name = (c8*)pen::memory_alloc( 1024 );\n pen::memory_zero(results.children[i].name, 1024);\n }\n \n u32 len = pen::string_length( ent->d_name );\n len = min<u32>( len, 1022 );\n \n pen::memory_cpy(results.children[i].name, ent->d_name, len);\n results.children[i].name[len] = '\\0';\n \n results.children[i].num_children = 0;\n \n ++i;\n }\n }\n \n closedir (dir);\n }\n \n return PEN_ERR_OK;\n }\n \n pen_error filesystem_enum_free_mem( fs_tree_node &tree )\n {\n for( s32 i = 0; i < tree.num_children; ++i )\n {\n filesystem_enum_free_mem( tree.children[ i ] );\n }\n \n pen::memory_free( tree.children );\n pen::memory_free( tree.name );\n \n return PEN_ERR_OK;\n }\n \n pen_error filesystem_getmtime( const c8* filename, u32& mtime_out )\n {\n struct stat stat_res;\n \n stat( filename, &stat_res);\n \n mtime_out = get_mtime(stat_res);\n \n return PEN_ERR_OK;\n }\n \n const c8** filesystem_get_user_directory( s32& directory_depth )\n {\n static const u32 max_dir_depth = 3;\n \n static c8 default_dir[max_dir_depth][1024];\n \n static c8* dir_list[max_dir_depth];\n \n pen::string_format(default_dir[0], 1024, \"\/\" );\n pen::string_format(default_dir[1], 1024, \"Users\" );\n pen::string_format(default_dir[2], 1024, \"%s\", pen_user_info.user_name );\n \n for( s32 i = 0; i < max_dir_depth; ++i )\n {\n dir_list[ i ] = &default_dir[ i ][ 0 ];\n }\n \n directory_depth = max_dir_depth;\n \n return (const c8**)&dir_list[0];\n }\n\n\ts32 filesystem_exclude_slash_depth()\n\t{\n\t\t\/\/directory depth 0 can be a slash\n\t\treturn 0;\n\t}\n}\n<commit_msg>compile fixes osx<commit_after>#include <stdio.h>\n#include <dirent.h>\n#include <sys\/stat.h>\n#include <sys\/param.h>\n#include <sys\/mount.h>\n#include <fnmatch.h>\n#include <stdarg.h>\n\n#include \"pen.h\"\n#include \"file_system.h\"\n#include \"memory.h\"\n#include \"pen_string.h\"\n\nextern pen::user_info pen_user_info;\n\n#ifdef __linux__\n#define get_mtime(s) s.st_mtime\n#else\n#define get_mtime(s) s.st_mtimespec.tv_sec\n#endif\n\nnamespace pen\n{\n pen_error filesystem_read_file_to_buffer( const char* filename, void** p_buffer, u32 &buffer_size )\n {\n *p_buffer = NULL;\n\n FILE* p_file = fopen( filename, \"rb\" );\n\n if( p_file )\n {\n fseek( p_file, 0L, SEEK_END );\n long size = ftell( p_file );\n\n fseek( p_file, 0L, SEEK_SET );\n\n buffer_size = ( u32 ) size;\n\n *p_buffer = pen::memory_alloc( buffer_size+1 );\n\n fread( *p_buffer, 1, buffer_size, p_file );\n \n ((u8*)*p_buffer)[buffer_size] = '\\0';\n\n fclose( p_file );\n\n return PEN_ERR_OK;\n }\n\n return PEN_ERR_FILE_NOT_FOUND;\n }\n \n pen_error filesystem_enum_volumes( fs_tree_node &results )\n {\n#ifndef __linux__\n struct statfs* mounts;\n int num_mounts = getmntinfo(&mounts, MNT_WAIT);\n \n results.children = (fs_tree_node*)pen::memory_alloc( sizeof(fs_tree_node) * num_mounts );\n results.num_children = num_mounts;\n \n static const c8* volumes_name = \"Volumes\";\n \n u32 len = pen::string_length(volumes_name);\n results.name = (c8*)pen::memory_alloc( len + 1 );\n pen::memory_cpy(results.name, volumes_name, len);\n results.name[ len ] = '\\0';\n \n for( int i = 0; i < num_mounts; ++i )\n {\n len = pen::string_length( mounts[i].f_mntonname );\n results.children[i].name = (c8*)pen::memory_alloc( len + 1 );\n \n pen::memory_cpy(results.children[i].name, mounts[i].f_mntonname, len);\n results.children[i].name[len] = '\\0';\n \n results.children[i].children = nullptr;\n results.children[i].num_children = 0;\n }\n#endif\n return PEN_ERR_OK;\n }\n \n bool match_file( struct dirent *ent, s32 num_wildcards, va_list wildcards )\n {\n if( num_wildcards <= 0 )\n {\n return true;\n }\n \n va_list wildcards_consume;\n va_copy(wildcards_consume, wildcards);\n \n if( ent->d_type != DT_DIR )\n {\n for( s32 i = 0; i < num_wildcards; ++i )\n {\n const char* ft = va_arg(wildcards_consume, const char*);\n \n if( fnmatch( ft, ent->d_name, 0) == 0 )\n {\n return true;\n }\n }\n }\n else\n {\n return true;\n }\n \n return false;\n }\n \n pen_error filesystem_enum_directory( const c8* directory, fs_tree_node &results, s32 num_wildcards, ... )\n {\n va_list wc;\n va_start ( wc, num_wildcards );\n \n pen_error res = filesystem_enum_directory( directory, results, num_wildcards, wc );\n \n va_end( wc );\n \n return res;\n }\n \n pen_error filesystem_enum_directory( const c8* directory, fs_tree_node &results, s32 num_wildcards, va_list wildcards )\n {\n DIR *dir;\n struct dirent *ent;\n \n u32 num_items = 0;\n if ((dir = opendir (directory)) != NULL)\n {\n while ((ent = readdir (dir)) != NULL)\n {\n if( match_file( ent, num_wildcards, wildcards ) )\n {\n num_items++;\n }\n }\n \n closedir (dir);\n }\n \n if( num_items == 0 )\n {\n \n return PEN_ERR_FILE_NOT_FOUND;\n }\n \n if( results.children == nullptr )\n {\n \/\/alloc new mem\n results.children = (fs_tree_node*)pen::memory_alloc( sizeof(fs_tree_node) * num_items );\n pen::memory_zero(results.children, sizeof(fs_tree_node) * num_items );\n }\n else\n {\n \/\/grow buffer\n if( results.num_children < num_items )\n {\n results.children = (fs_tree_node*)pen::memory_realloc( results.children, sizeof(fs_tree_node) * num_items );\n }\n }\n \n results.num_children = num_items;\n \n u32 i = 0;\n if ((dir = opendir (directory)) != NULL)\n {\n while ((ent = readdir (dir)) != NULL)\n {\n if( match_file( ent, num_wildcards, wildcards ) )\n {\n if( results.children[i].name == nullptr )\n {\n \/\/allocate 1024 file buffer\n results.children[i].name = (c8*)pen::memory_alloc( 1024 );\n pen::memory_zero(results.children[i].name, 1024);\n }\n \n u32 len = pen::string_length( ent->d_name );\n len = min<u32>( len, 1022 );\n \n pen::memory_cpy(results.children[i].name, ent->d_name, len);\n results.children[i].name[len] = '\\0';\n \n results.children[i].num_children = 0;\n \n ++i;\n }\n }\n \n closedir (dir);\n }\n \n return PEN_ERR_OK;\n }\n \n pen_error filesystem_enum_free_mem( fs_tree_node &tree )\n {\n for( s32 i = 0; i < tree.num_children; ++i )\n {\n filesystem_enum_free_mem( tree.children[ i ] );\n }\n \n pen::memory_free( tree.children );\n pen::memory_free( tree.name );\n \n return PEN_ERR_OK;\n }\n \n pen_error filesystem_getmtime( const c8* filename, u32& mtime_out )\n {\n struct stat stat_res;\n \n stat( filename, &stat_res);\n \n mtime_out = get_mtime(stat_res);\n \n return PEN_ERR_OK;\n }\n \n const c8** filesystem_get_user_directory( s32& directory_depth )\n {\n static const u32 max_dir_depth = 3;\n \n static c8 default_dir[max_dir_depth][1024];\n \n static c8* dir_list[max_dir_depth];\n \n pen::string_format(default_dir[0], 1024, \"\/\" );\n pen::string_format(default_dir[1], 1024, \"Users\" );\n pen::string_format(default_dir[2], 1024, \"%s\", pen_user_info.user_name );\n \n for( s32 i = 0; i < max_dir_depth; ++i )\n {\n dir_list[ i ] = &default_dir[ i ][ 0 ];\n }\n \n directory_depth = max_dir_depth;\n \n return (const c8**)&dir_list[0];\n }\n\n\ts32 filesystem_exclude_slash_depth()\n\t{\n\t\t\/\/directory depth 0 can be a slash\n\t\treturn 0;\n\t}\n}\n<|endoftext|>"} {"text":"<commit_before>#ifdef WIN32\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ Disable unavoidable warning messages:\n\n\/\/ 4103: used #pragma pack to change alignment\n\/\/ 4114: same type qualifier used more than once\n\/\/ 4201: nonstandard extension used : nameless struct\/union\n\/\/ 4237: \"keyword\" reserved for future use\n\/\/ 4251: class needs to have dll-interface to export class\n\/\/ 4275: non DLL-interface class used as base for DLL-interface class\n\/\/ 4290: C++ Exception Specification ignored\n\/\/ 4503: decorated name length exceeded, name was truncated\n\/\/ 4786: string too long - truncated to 255 characters\n\n#pragma warning(disable : 4103 4114 4201 4237 4251 4275 4290 4503 4335 4786)\n\n#endif \/\/ WIN32\n\n#include <osgViewer\/Viewer>\n#include <osgViewer\/StatsHandler>\n#include <osgViewer\/HelpHandler>\n#include <osgViewer\/ViewerEventHandlers>\n\n#include <osg\/Group>\n#include <osg\/Geode>\n#include <osg\/ShapeDrawable>\n#include <osg\/Texture2D>\n#include <osg\/PositionAttitudeTransform>\n#include <osg\/MatrixTransform>\n#include <osg\/CoordinateSystemNode>\n\n#include <osgDB\/FileUtils>\n#include <osgDB\/ReadFile>\n\n#include <osgText\/Text>\n\n#include <osg\/CoordinateSystemNode>\n\n#include <osgSim\/OverlayNode>\n#include <osgSim\/SphereSegment>\n\n#include <osgGA\/NodeTrackerManipulator>\n#include <osgGA\/StateSetManipulator>\n#include <osgGA\/TrackballManipulator>\n#include <osgGA\/FlightManipulator>\n#include <osgGA\/DriveManipulator>\n#include <osgGA\/KeySwitchMatrixManipulator>\n#include <osgGA\/AnimationPathManipulator>\n#include <osgGA\/TerrainManipulator>\n\n#include <iostream>\n\nosg::Node* createEarth()\n{\n osg::TessellationHints* hints = new osg::TessellationHints;\n hints->setDetailRatio(5.0f);\n\n \n osg::ShapeDrawable* sd = new osg::ShapeDrawable(new osg::Sphere(osg::Vec3(0.0,0.0,0.0), osg::WGS_84_RADIUS_POLAR), hints);\n \n osg::Geode* geode = new osg::Geode;\n geode->addDrawable(sd);\n \n std::string filename = osgDB::findDataFile(\"Images\/land_shallow_topo_2048.jpg\");\n geode->getOrCreateStateSet()->setTextureAttributeAndModes(0, new osg::Texture2D(osgDB::readImageFile(filename)));\n \n osg::CoordinateSystemNode* csn = new osg::CoordinateSystemNode;\n csn->setEllipsoidModel(new osg::EllipsoidModel());\n csn->addChild(geode);\n \n return csn;\n \n}\n\n\nclass ModelPositionCallback : public osg::NodeCallback\n{\npublic:\n\n ModelPositionCallback(double speed):\n _latitude(0.0),\n _longitude(0.0),\n _height(100000.0),\n _speed(speed)\n {\n _rotation.makeRotate(osg::DegreesToRadians(90.0),0.0,0.0,1.0);\n }\n \n void updateParameters()\n {\n _longitude += _speed * ((2.0*osg::PI)\/360.0)\/20.0;\n }\n\n\n virtual void operator()(osg::Node* node, osg::NodeVisitor* nv)\n {\n updateParameters();\n \n osg::NodePath nodePath = nv->getNodePath();\n\n osg::MatrixTransform* mt = nodePath.empty() ? 0 : dynamic_cast<osg::MatrixTransform*>(nodePath.back());\n if (mt)\n {\n osg::CoordinateSystemNode* csn = 0;\n\n \/\/ find coordinate system node from our parental chain\n unsigned int i;\n for(i=0; i<nodePath.size() && csn==0; ++i)\n {\n csn = dynamic_cast<osg::CoordinateSystemNode*>(nodePath[i]);\n }\n \n if (csn)\n {\n\n\n osg::EllipsoidModel* ellipsoid = csn->getEllipsoidModel();\n if (ellipsoid)\n {\n osg::Matrix inheritedMatrix;\n for(i+=1; i<nodePath.size()-1; ++i)\n {\n osg::Transform* transform = nodePath[i]->asTransform();\n if (transform) transform->computeLocalToWorldMatrix(inheritedMatrix, nv);\n }\n \n osg::Matrixd matrix(inheritedMatrix);\n\n \/\/osg::Matrixd matrix;\n ellipsoid->computeLocalToWorldTransformFromLatLongHeight(_latitude,_longitude,_height,matrix);\n matrix.preMult(osg::Matrix::rotate(_rotation));\n \n mt->setMatrix(matrix);\n }\n\n } \n }\n \n traverse(node,nv);\n } \n \n double _latitude;\n double _longitude;\n double _height;\n osg::Quat _rotation;\n double _speed;\n};\n\n\nclass FindNamedNodeVisitor : public osg::NodeVisitor\n{\npublic:\n FindNamedNodeVisitor(const std::string& name):\n osg::NodeVisitor(osg::NodeVisitor::TRAVERSE_ALL_CHILDREN),\n _name(name) {}\n \n virtual void apply(osg::Node& node)\n {\n if (node.getName()==_name)\n {\n _foundNodes.push_back(&node);\n }\n traverse(node);\n }\n \n typedef std::vector< osg::ref_ptr<osg::Node> > NodeList;\n\n std::string _name;\n NodeList _foundNodes;\n};\n\n\nint main(int argc, char **argv)\n{\n \/\/ use an ArgumentParser object to manage the program arguments.\n osg::ArgumentParser arguments(&argc,argv);\n \n \/\/ set up the usage document, in case we need to print out how to use this program.\n arguments.getApplicationUsage()->setDescription(arguments.getApplicationName()+\" is the example which demonstrates use of node tracker.\");\n arguments.getApplicationUsage()->setCommandLineUsage(arguments.getApplicationName());\n arguments.getApplicationUsage()->addCommandLineOption(\"-h or --help\",\"Display this information\");\n \n\n \/\/ construct the viewer.\n osgViewer::Viewer viewer;\n\n \/\/ add the state manipulator\n viewer.addEventHandler( new osgGA::StateSetManipulator(viewer.getCamera()->getOrCreateStateSet()) );\n \n \/\/ add the thread model handler\n viewer.addEventHandler(new osgViewer::ThreadingHandler);\n\n \/\/ add the window size toggle handler\n viewer.addEventHandler(new osgViewer::WindowSizeHandler);\n \n \/\/ add the stats handler\n viewer.addEventHandler(new osgViewer::StatsHandler);\n\n \/\/ add the help handler\n viewer.addEventHandler(new osgViewer::HelpHandler(arguments.getApplicationUsage()));\n\n \/\/ set the near far ration computation up.\n viewer.getCamera()->setComputeNearFarMode(osg::CullSettings::COMPUTE_NEAR_FAR_USING_PRIMITIVES);\n viewer.getCamera()->setNearFarRatio(0.00001f);\n\n\n double speed = 1.0;\n while (arguments.read(\"-f\") || arguments.read(\"--fixed\")) speed = 0.0;\n\n\n osg::Quat rotation;\n osg::Vec4 vec4;\n while (arguments.read(\"--rotate-model\",vec4[0],vec4[1],vec4[2],vec4[3]))\n {\n osg::Quat local_rotate;\n local_rotate.makeRotate(osg::DegreesToRadians(vec4[0]),vec4[1],vec4[2],vec4[3]);\n \n rotation = rotation * local_rotate;\n }\n\n osg::NodeCallback* nc = 0;\n std::string flightpath_filename;\n while (arguments.read(\"--flight-path\",flightpath_filename))\n {\n std::ifstream fin(flightpath_filename.c_str());\n if (fin)\n {\n osg::AnimationPath* path = new osg::AnimationPath;\n path->read(fin);\n nc = new osg::AnimationPathCallback(path);\n }\n }\n \n osgGA::NodeTrackerManipulator::TrackerMode trackerMode = osgGA::NodeTrackerManipulator::NODE_CENTER_AND_ROTATION;\n std::string mode;\n while (arguments.read(\"--tracker-mode\",mode))\n {\n if (mode==\"NODE_CENTER_AND_ROTATION\") trackerMode = osgGA::NodeTrackerManipulator::NODE_CENTER_AND_ROTATION;\n else if (mode==\"NODE_CENTER_AND_AZIM\") trackerMode = osgGA::NodeTrackerManipulator::NODE_CENTER_AND_AZIM;\n else if (mode==\"NODE_CENTER\") trackerMode = osgGA::NodeTrackerManipulator::NODE_CENTER;\n else\n {\n std::cout<<\"Unrecognized --tracker-mode option \"<<mode<<\", valid options are:\"<<std::endl;\n std::cout<<\" NODE_CENTER_AND_ROTATION\"<<std::endl;\n std::cout<<\" NODE_CENTER_AND_AZIM\"<<std::endl;\n std::cout<<\" NODE_CENTER\"<<std::endl;\n return 1;\n }\n }\n \n \n osgGA::NodeTrackerManipulator::RotationMode rotationMode = osgGA::NodeTrackerManipulator::TRACKBALL;\n while (arguments.read(\"--rotation-mode\",mode))\n {\n if (mode==\"TRACKBALL\") rotationMode = osgGA::NodeTrackerManipulator::TRACKBALL;\n else if (mode==\"ELEVATION_AZIM\") rotationMode = osgGA::NodeTrackerManipulator::ELEVATION_AZIM;\n else\n {\n std::cout<<\"Unrecognized --rotation-mode option \"<<mode<<\", valid options are:\"<<std::endl;\n std::cout<<\" TRACKBALL\"<<std::endl;\n std::cout<<\" ELEVATION_AZIM\"<<std::endl;\n return 1;\n }\n }\n\n bool useOverlay = true;\n while (arguments.read(\"--no-overlay\") || arguments.read(\"-n\")) useOverlay = false;\n \n osgSim::OverlayNode::OverlayTechnique technique = osgSim::OverlayNode::OBJECT_DEPENDENT_WITH_ORTHOGRAPHIC_OVERLAY;\n while (arguments.read(\"--object\")) technique = osgSim::OverlayNode::OBJECT_DEPENDENT_WITH_ORTHOGRAPHIC_OVERLAY;\n while (arguments.read(\"--ortho\") || arguments.read(\"--orthographic\")) technique = osgSim::OverlayNode::VIEW_DEPENDENT_WITH_ORTHOGRAPHIC_OVERLAY;\n while (arguments.read(\"--persp\") || arguments.read(\"--perspective\")) technique = osgSim::OverlayNode::VIEW_DEPENDENT_WITH_PERSPECTIVE_OVERLAY;\n \n\n\n \/\/ if user request help write it out to cout.\n if (arguments.read(\"-h\") || arguments.read(\"--help\"))\n {\n arguments.getApplicationUsage()->write(std::cout);\n return 1;\n }\n\n \/\/ any option left unread are converted into errors to write out later.\n arguments.reportRemainingOptionsAsUnrecognized();\n\n \/\/ report any errors if they have occured when parsing the program aguments.\n if (arguments.errors())\n {\n arguments.writeErrorMessages(std::cout);\n return 1;\n }\n \n \/\/ read the scene from the list of file specified commandline args.\n osg::ref_ptr<osg::Node> root = osgDB::readNodeFiles(arguments);\n\n if (!root) root = createEarth();\n \n if (!root) return 0;\n\n \/\/ add a viewport to the viewer and attach the scene graph.\n viewer.setSceneData(root.get());\n\n osg::ref_ptr<osgGA::NodeTrackerManipulator> tm;\n\n osg::CoordinateSystemNode* csn = dynamic_cast<osg::CoordinateSystemNode*>(root.get());\n if (csn)\n {\n\n osg::ref_ptr<osgSim::OverlayNode> overlayNode;\n if (useOverlay)\n {\n overlayNode = new osgSim::OverlayNode(technique);\n \n \/\/ insert the OverlayNode between the coordinate system node and its children.\n for(unsigned int i=0; i<csn->getNumChildren(); ++i)\n {\n overlayNode->addChild( csn->getChild(i) );\n }\n\n csn->removeChildren(0, csn->getNumChildren());\n csn->addChild(overlayNode.get());\n \n \/\/ tell the overlay node to continously update its overlay texture\n \/\/ as we know we'll be tracking a moving target.\n overlayNode->setContinuousUpdate(true);\n }\n \n \n osg::Node* cessna = osgDB::readNodeFile(\"cessna.osg\");\n if (cessna)\n {\n double s = 200000.0 \/ cessna->getBound().radius();\n \n osg::MatrixTransform* scaler = new osg::MatrixTransform;\n scaler->addChild(cessna);\n scaler->setMatrix(osg::Matrixd::scale(s,s,s)*osg::Matrixd::rotate(rotation));\n scaler->getOrCreateStateSet()->setMode(GL_RESCALE_NORMAL,osg::StateAttribute::ON); \n \n if (false)\n {\n osgSim::SphereSegment* ss = new osgSim::SphereSegment(\n osg::Vec3(0.0f,0.0f,0.0f), \/\/ center\n 19.9f, \/\/ radius\n osg::DegreesToRadians(135.0f),\n osg::DegreesToRadians(240.0f),\n osg::DegreesToRadians(-10.0f),\n osg::DegreesToRadians(30.0f),\n 60);\n \n scaler->addChild(ss);\n }\n\n osg::MatrixTransform* mt = new osg::MatrixTransform;\n mt->addChild(scaler);\n\n\n if (!nc) nc = new ModelPositionCallback(speed);\n\n mt->setUpdateCallback(nc);\n \n csn->addChild(mt);\n \n \/\/ if we are using an overaly node, use the cessna subgraph as the overlay subgraph\n if (overlayNode.valid())\n {\n overlayNode->setOverlaySubgraph(mt);\n }\n\n tm = new osgGA::NodeTrackerManipulator;\n tm->setTrackerMode(trackerMode);\n tm->setRotationMode(rotationMode);\n tm->setTrackNode(scaler);\n }\n else\n {\n std::cout<<\"Failed to read cessna.osg\"<<std::endl;\n }\n \n } \n\n\n \/\/ set up camera manipulators.\n {\n osg::ref_ptr<osgGA::KeySwitchMatrixManipulator> keyswitchManipulator = new osgGA::KeySwitchMatrixManipulator;\n\n if (tm.valid()) keyswitchManipulator->addMatrixManipulator( '0', \"Trackball\", tm.get() );\n keyswitchManipulator->addMatrixManipulator( '1', \"Trackball\", new osgGA::TrackballManipulator() );\n keyswitchManipulator->addMatrixManipulator( '2', \"Flight\", new osgGA::FlightManipulator() );\n keyswitchManipulator->addMatrixManipulator( '3', \"Drive\", new osgGA::DriveManipulator() );\n keyswitchManipulator->addMatrixManipulator( '4', \"Terrain\", new osgGA::TerrainManipulator() );\n\n viewer.setCameraManipulator( keyswitchManipulator.get() );\n }\n \n\n viewer.setThreadingModel(osgViewer::Viewer::SingleThreaded);\n\n return viewer.run();\n}\n<commit_msg>Made the near far ratio lower to allow one to be near the terrain before clipping comes in to effect<commit_after>#ifdef WIN32\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ Disable unavoidable warning messages:\n\n\/\/ 4103: used #pragma pack to change alignment\n\/\/ 4114: same type qualifier used more than once\n\/\/ 4201: nonstandard extension used : nameless struct\/union\n\/\/ 4237: \"keyword\" reserved for future use\n\/\/ 4251: class needs to have dll-interface to export class\n\/\/ 4275: non DLL-interface class used as base for DLL-interface class\n\/\/ 4290: C++ Exception Specification ignored\n\/\/ 4503: decorated name length exceeded, name was truncated\n\/\/ 4786: string too long - truncated to 255 characters\n\n#pragma warning(disable : 4103 4114 4201 4237 4251 4275 4290 4503 4335 4786)\n\n#endif \/\/ WIN32\n\n#include <osgViewer\/Viewer>\n#include <osgViewer\/StatsHandler>\n#include <osgViewer\/HelpHandler>\n#include <osgViewer\/ViewerEventHandlers>\n\n#include <osg\/Group>\n#include <osg\/Geode>\n#include <osg\/ShapeDrawable>\n#include <osg\/Texture2D>\n#include <osg\/PositionAttitudeTransform>\n#include <osg\/MatrixTransform>\n#include <osg\/CoordinateSystemNode>\n\n#include <osgDB\/FileUtils>\n#include <osgDB\/ReadFile>\n\n#include <osgText\/Text>\n\n#include <osg\/CoordinateSystemNode>\n\n#include <osgSim\/OverlayNode>\n#include <osgSim\/SphereSegment>\n\n#include <osgGA\/NodeTrackerManipulator>\n#include <osgGA\/StateSetManipulator>\n#include <osgGA\/TrackballManipulator>\n#include <osgGA\/FlightManipulator>\n#include <osgGA\/DriveManipulator>\n#include <osgGA\/KeySwitchMatrixManipulator>\n#include <osgGA\/AnimationPathManipulator>\n#include <osgGA\/TerrainManipulator>\n\n#include <iostream>\n\nosg::Node* createEarth()\n{\n osg::TessellationHints* hints = new osg::TessellationHints;\n hints->setDetailRatio(5.0f);\n\n \n osg::ShapeDrawable* sd = new osg::ShapeDrawable(new osg::Sphere(osg::Vec3(0.0,0.0,0.0), osg::WGS_84_RADIUS_POLAR), hints);\n \n osg::Geode* geode = new osg::Geode;\n geode->addDrawable(sd);\n \n std::string filename = osgDB::findDataFile(\"Images\/land_shallow_topo_2048.jpg\");\n geode->getOrCreateStateSet()->setTextureAttributeAndModes(0, new osg::Texture2D(osgDB::readImageFile(filename)));\n \n osg::CoordinateSystemNode* csn = new osg::CoordinateSystemNode;\n csn->setEllipsoidModel(new osg::EllipsoidModel());\n csn->addChild(geode);\n \n return csn;\n \n}\n\n\nclass ModelPositionCallback : public osg::NodeCallback\n{\npublic:\n\n ModelPositionCallback(double speed):\n _latitude(0.0),\n _longitude(0.0),\n _height(100000.0),\n _speed(speed)\n {\n _rotation.makeRotate(osg::DegreesToRadians(90.0),0.0,0.0,1.0);\n }\n \n void updateParameters()\n {\n _longitude += _speed * ((2.0*osg::PI)\/360.0)\/20.0;\n }\n\n\n virtual void operator()(osg::Node* node, osg::NodeVisitor* nv)\n {\n updateParameters();\n \n osg::NodePath nodePath = nv->getNodePath();\n\n osg::MatrixTransform* mt = nodePath.empty() ? 0 : dynamic_cast<osg::MatrixTransform*>(nodePath.back());\n if (mt)\n {\n osg::CoordinateSystemNode* csn = 0;\n\n \/\/ find coordinate system node from our parental chain\n unsigned int i;\n for(i=0; i<nodePath.size() && csn==0; ++i)\n {\n csn = dynamic_cast<osg::CoordinateSystemNode*>(nodePath[i]);\n }\n \n if (csn)\n {\n\n\n osg::EllipsoidModel* ellipsoid = csn->getEllipsoidModel();\n if (ellipsoid)\n {\n osg::Matrix inheritedMatrix;\n for(i+=1; i<nodePath.size()-1; ++i)\n {\n osg::Transform* transform = nodePath[i]->asTransform();\n if (transform) transform->computeLocalToWorldMatrix(inheritedMatrix, nv);\n }\n \n osg::Matrixd matrix(inheritedMatrix);\n\n \/\/osg::Matrixd matrix;\n ellipsoid->computeLocalToWorldTransformFromLatLongHeight(_latitude,_longitude,_height,matrix);\n matrix.preMult(osg::Matrix::rotate(_rotation));\n \n mt->setMatrix(matrix);\n }\n\n } \n }\n \n traverse(node,nv);\n } \n \n double _latitude;\n double _longitude;\n double _height;\n osg::Quat _rotation;\n double _speed;\n};\n\n\nclass FindNamedNodeVisitor : public osg::NodeVisitor\n{\npublic:\n FindNamedNodeVisitor(const std::string& name):\n osg::NodeVisitor(osg::NodeVisitor::TRAVERSE_ALL_CHILDREN),\n _name(name) {}\n \n virtual void apply(osg::Node& node)\n {\n if (node.getName()==_name)\n {\n _foundNodes.push_back(&node);\n }\n traverse(node);\n }\n \n typedef std::vector< osg::ref_ptr<osg::Node> > NodeList;\n\n std::string _name;\n NodeList _foundNodes;\n};\n\n\nint main(int argc, char **argv)\n{\n \/\/ use an ArgumentParser object to manage the program arguments.\n osg::ArgumentParser arguments(&argc,argv);\n \n \/\/ set up the usage document, in case we need to print out how to use this program.\n arguments.getApplicationUsage()->setDescription(arguments.getApplicationName()+\" is the example which demonstrates use of node tracker.\");\n arguments.getApplicationUsage()->setCommandLineUsage(arguments.getApplicationName());\n arguments.getApplicationUsage()->addCommandLineOption(\"-h or --help\",\"Display this information\");\n \n\n \/\/ construct the viewer.\n osgViewer::Viewer viewer;\n\n \/\/ add the state manipulator\n viewer.addEventHandler( new osgGA::StateSetManipulator(viewer.getCamera()->getOrCreateStateSet()) );\n \n \/\/ add the thread model handler\n viewer.addEventHandler(new osgViewer::ThreadingHandler);\n\n \/\/ add the window size toggle handler\n viewer.addEventHandler(new osgViewer::WindowSizeHandler);\n \n \/\/ add the stats handler\n viewer.addEventHandler(new osgViewer::StatsHandler);\n\n \/\/ add the help handler\n viewer.addEventHandler(new osgViewer::HelpHandler(arguments.getApplicationUsage()));\n\n \/\/ set the near far ration computation up.\n viewer.getCamera()->setComputeNearFarMode(osg::CullSettings::COMPUTE_NEAR_FAR_USING_PRIMITIVES);\n viewer.getCamera()->setNearFarRatio(0.000003f);\n\n\n double speed = 1.0;\n while (arguments.read(\"-f\") || arguments.read(\"--fixed\")) speed = 0.0;\n\n\n osg::Quat rotation;\n osg::Vec4 vec4;\n while (arguments.read(\"--rotate-model\",vec4[0],vec4[1],vec4[2],vec4[3]))\n {\n osg::Quat local_rotate;\n local_rotate.makeRotate(osg::DegreesToRadians(vec4[0]),vec4[1],vec4[2],vec4[3]);\n \n rotation = rotation * local_rotate;\n }\n\n osg::NodeCallback* nc = 0;\n std::string flightpath_filename;\n while (arguments.read(\"--flight-path\",flightpath_filename))\n {\n std::ifstream fin(flightpath_filename.c_str());\n if (fin)\n {\n osg::AnimationPath* path = new osg::AnimationPath;\n path->read(fin);\n nc = new osg::AnimationPathCallback(path);\n }\n }\n \n osgGA::NodeTrackerManipulator::TrackerMode trackerMode = osgGA::NodeTrackerManipulator::NODE_CENTER_AND_ROTATION;\n std::string mode;\n while (arguments.read(\"--tracker-mode\",mode))\n {\n if (mode==\"NODE_CENTER_AND_ROTATION\") trackerMode = osgGA::NodeTrackerManipulator::NODE_CENTER_AND_ROTATION;\n else if (mode==\"NODE_CENTER_AND_AZIM\") trackerMode = osgGA::NodeTrackerManipulator::NODE_CENTER_AND_AZIM;\n else if (mode==\"NODE_CENTER\") trackerMode = osgGA::NodeTrackerManipulator::NODE_CENTER;\n else\n {\n std::cout<<\"Unrecognized --tracker-mode option \"<<mode<<\", valid options are:\"<<std::endl;\n std::cout<<\" NODE_CENTER_AND_ROTATION\"<<std::endl;\n std::cout<<\" NODE_CENTER_AND_AZIM\"<<std::endl;\n std::cout<<\" NODE_CENTER\"<<std::endl;\n return 1;\n }\n }\n \n \n osgGA::NodeTrackerManipulator::RotationMode rotationMode = osgGA::NodeTrackerManipulator::TRACKBALL;\n while (arguments.read(\"--rotation-mode\",mode))\n {\n if (mode==\"TRACKBALL\") rotationMode = osgGA::NodeTrackerManipulator::TRACKBALL;\n else if (mode==\"ELEVATION_AZIM\") rotationMode = osgGA::NodeTrackerManipulator::ELEVATION_AZIM;\n else\n {\n std::cout<<\"Unrecognized --rotation-mode option \"<<mode<<\", valid options are:\"<<std::endl;\n std::cout<<\" TRACKBALL\"<<std::endl;\n std::cout<<\" ELEVATION_AZIM\"<<std::endl;\n return 1;\n }\n }\n\n bool useOverlay = true;\n while (arguments.read(\"--no-overlay\") || arguments.read(\"-n\")) useOverlay = false;\n \n osgSim::OverlayNode::OverlayTechnique technique = osgSim::OverlayNode::OBJECT_DEPENDENT_WITH_ORTHOGRAPHIC_OVERLAY;\n while (arguments.read(\"--object\")) technique = osgSim::OverlayNode::OBJECT_DEPENDENT_WITH_ORTHOGRAPHIC_OVERLAY;\n while (arguments.read(\"--ortho\") || arguments.read(\"--orthographic\")) technique = osgSim::OverlayNode::VIEW_DEPENDENT_WITH_ORTHOGRAPHIC_OVERLAY;\n while (arguments.read(\"--persp\") || arguments.read(\"--perspective\")) technique = osgSim::OverlayNode::VIEW_DEPENDENT_WITH_PERSPECTIVE_OVERLAY;\n \n\n\n \/\/ if user request help write it out to cout.\n if (arguments.read(\"-h\") || arguments.read(\"--help\"))\n {\n arguments.getApplicationUsage()->write(std::cout);\n return 1;\n }\n\n \/\/ any option left unread are converted into errors to write out later.\n arguments.reportRemainingOptionsAsUnrecognized();\n\n \/\/ report any errors if they have occured when parsing the program aguments.\n if (arguments.errors())\n {\n arguments.writeErrorMessages(std::cout);\n return 1;\n }\n \n \/\/ read the scene from the list of file specified commandline args.\n osg::ref_ptr<osg::Node> root = osgDB::readNodeFiles(arguments);\n\n if (!root) root = createEarth();\n \n if (!root) return 0;\n\n \/\/ add a viewport to the viewer and attach the scene graph.\n viewer.setSceneData(root.get());\n\n osg::ref_ptr<osgGA::NodeTrackerManipulator> tm;\n\n osg::CoordinateSystemNode* csn = dynamic_cast<osg::CoordinateSystemNode*>(root.get());\n if (csn)\n {\n\n osg::ref_ptr<osgSim::OverlayNode> overlayNode;\n if (useOverlay)\n {\n overlayNode = new osgSim::OverlayNode(technique);\n \n \/\/ insert the OverlayNode between the coordinate system node and its children.\n for(unsigned int i=0; i<csn->getNumChildren(); ++i)\n {\n overlayNode->addChild( csn->getChild(i) );\n }\n\n csn->removeChildren(0, csn->getNumChildren());\n csn->addChild(overlayNode.get());\n \n \/\/ tell the overlay node to continously update its overlay texture\n \/\/ as we know we'll be tracking a moving target.\n overlayNode->setContinuousUpdate(true);\n }\n \n \n osg::Node* cessna = osgDB::readNodeFile(\"cessna.osg\");\n if (cessna)\n {\n double s = 200000.0 \/ cessna->getBound().radius();\n \n osg::MatrixTransform* scaler = new osg::MatrixTransform;\n scaler->addChild(cessna);\n scaler->setMatrix(osg::Matrixd::scale(s,s,s)*osg::Matrixd::rotate(rotation));\n scaler->getOrCreateStateSet()->setMode(GL_RESCALE_NORMAL,osg::StateAttribute::ON); \n \n if (false)\n {\n osgSim::SphereSegment* ss = new osgSim::SphereSegment(\n osg::Vec3(0.0f,0.0f,0.0f), \/\/ center\n 19.9f, \/\/ radius\n osg::DegreesToRadians(135.0f),\n osg::DegreesToRadians(240.0f),\n osg::DegreesToRadians(-10.0f),\n osg::DegreesToRadians(30.0f),\n 60);\n \n scaler->addChild(ss);\n }\n\n osg::MatrixTransform* mt = new osg::MatrixTransform;\n mt->addChild(scaler);\n\n\n if (!nc) nc = new ModelPositionCallback(speed);\n\n mt->setUpdateCallback(nc);\n \n csn->addChild(mt);\n \n \/\/ if we are using an overaly node, use the cessna subgraph as the overlay subgraph\n if (overlayNode.valid())\n {\n overlayNode->setOverlaySubgraph(mt);\n }\n\n tm = new osgGA::NodeTrackerManipulator;\n tm->setTrackerMode(trackerMode);\n tm->setRotationMode(rotationMode);\n tm->setTrackNode(scaler);\n }\n else\n {\n std::cout<<\"Failed to read cessna.osg\"<<std::endl;\n }\n \n } \n\n\n \/\/ set up camera manipulators.\n {\n osg::ref_ptr<osgGA::KeySwitchMatrixManipulator> keyswitchManipulator = new osgGA::KeySwitchMatrixManipulator;\n\n if (tm.valid()) keyswitchManipulator->addMatrixManipulator( '0', \"Trackball\", tm.get() );\n keyswitchManipulator->addMatrixManipulator( '1', \"Trackball\", new osgGA::TrackballManipulator() );\n keyswitchManipulator->addMatrixManipulator( '2', \"Flight\", new osgGA::FlightManipulator() );\n keyswitchManipulator->addMatrixManipulator( '3', \"Drive\", new osgGA::DriveManipulator() );\n keyswitchManipulator->addMatrixManipulator( '4', \"Terrain\", new osgGA::TerrainManipulator() );\n\n viewer.setCameraManipulator( keyswitchManipulator.get() );\n }\n \n\n viewer.setThreadingModel(osgViewer::Viewer::SingleThreaded);\n\n return viewer.run();\n}\n<|endoftext|>"} {"text":"<commit_before>\/\/Abstract class for mutation operators. Lets us define any mutation operation we like.\n\n#include <random>\n#include <chrono>\n#include <string>\n#include <sstream>\n#include \"nodes\/EANode\/MutationOperation.hpp\"\n\nusing namespace std;\n\nMutationOperation::MutationOperation() {\n\tseed = chrono::system_clock::now().time_since_epoch().count();\n\tinit(0, seed);\n}\n\nMutationOperation::MutationOperation(double newMutationRate) {\n\tseed = chrono::system_clock::now().time_since_epoch().count();\n\tinit(newMutationRate, seed);\n}\n\nMutationOperation::MutationOperation(double newMutationRate, unsigned newSeed) {\n\tinit(newMutationRate, newSeed);\n}\n\nvoid MutationOperation::init(double newMutationRate, unsigned newSeed) {\n\tmutationRate = newMutationRate;\n\tseed = newSeed;\n\tgenerator = mt19937(seed);\n}\n\nGenome * MutationOperation::mutate(Genome * initialGenome) {\n\tvector<int> newGenome, existingGenome = initialGenome->getGenome();\n\tvector<Locus*> loci = initialGenome->getLoci();\n\tuniform_real_distribution<double> mutationDist(0, 1);\n\tfor (int i = 0; i < initialGenome->genomeLength(); i++) {\n\t\tif (mutationDist(this->generator) < this->mutationRate) {\n\t\t\tnewGenome.push_back(\n\t\t\t\tthis->getNewLocusValue(\n\t\t\t\t\texistingGenome[i],\n\t\t\t\t\tloci[i]->topIndex()\n\t\t\t\t)\n\t\t\t);\n\t\t} else {\n\t\t\tnewGenome.push_back(existingGenome[i]);\n\t\t}\n\t}\n\treturn new Genome(newGenome, loci);\n}\n\nstring MutationOperation::toString() {\n\tstring returnString = \"\";\n\tstringstream ss;\n\n\tss << \"Random seed: \" << seed << \"\\nMutation rate: \" << mutationRate << \"\\n\";\n\n\treturnString = ss.str();\n\n\treturn returnString;\n\n}\n<commit_msg>[MutationOperation]: Slight code cleanup<commit_after>\/\/Abstract class for mutation operators. Lets us define any mutation operation we like.\n\n#include <random>\n#include <chrono>\n#include <sstream>\n#include \"nodes\/EANode\/MutationOperation.hpp\"\n\nusing namespace std;\n\nMutationOperation::MutationOperation() {\n\tseed = chrono::system_clock::now().time_since_epoch().count();\n\tthis->init(0, seed);\n}\n\nMutationOperation::MutationOperation(double mutationRate) {\n\tseed = chrono::system_clock::now().time_since_epoch().count();\n\tthis->init(mutationRate, seed);\n}\n\nMutationOperation::MutationOperation(double mutationRate, unsigned seed) {\n\tthis->init(mutationRate, seed);\n}\n\nvoid MutationOperation::init(double mutationRate, unsigned seed) {\n\tthis->mutationRate = mutationRate;\n\tthis->seed = seed;\n\tthis->generator = mt19937(seed);\n}\n\nGenome * MutationOperation::mutate(Genome * initialGenome) {\n\tvector<int> newGenome, existingGenome = initialGenome->getGenome();\n\tvector<Locus*> loci = initialGenome->getLoci();\n\tuniform_real_distribution<double> mutationDist(0, 1);\n\tfor (int i = 0; i < initialGenome->genomeLength(); i++) {\n\t\tif (mutationDist(this->generator) < this->mutationRate) {\n\t\t\tnewGenome.push_back(\n\t\t\t\tthis->getNewLocusValue(\n\t\t\t\t\texistingGenome[i],\n\t\t\t\t\tloci[i]->topIndex()\n\t\t\t\t)\n\t\t\t);\n\t\t} else {\n\t\t\tnewGenome.push_back(existingGenome[i]);\n\t\t}\n\t}\n\treturn new Genome(newGenome, loci);\n}\n\nstring MutationOperation::toString() {\n\tstringstream ss;\n\n\tss << \"Random seed: \" << seed\n\t\t<< \"\\nMutation rate: \" << mutationRate\n\t\t<< \"\\n\";\n\n\treturn ss.str();\n\n}\n<|endoftext|>"} {"text":"<commit_before>\/*\n Copyright (c) 2008 Bruno Virlet <bvirlet@kdemail.net>\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 \"kcalmodel.h\"\n#include \"kcalmimetypevisitor.h\"\n\n#include <akonadi\/item.h>\n#include <akonadi\/itemfetchjob.h>\n#include <akonadi\/itemfetchscope.h>\n#include <akonadi\/collection.h>\n\n#include <kcal\/incidence.h>\n#include <kcal\/event.h>\n\n#include <klocale.h>\n#include <boost\/shared_ptr.hpp>\n\n#include <kiconloader.h>\n#include <QtGui\/QPixmap>\n\ntypedef boost::shared_ptr<KCal::Incidence> IncidencePtr;\n\nusing namespace Akonadi;\n\nclass KCalModel::Private\n{\n public:\n Private( KCalModel *model )\n :q( model )\n {\n }\n\n static QStringList allMimeTypes()\n {\n QStringList types;\n types << KCalMimeTypeVisitor::eventMimeType()\n << KCalMimeTypeVisitor::todoMimeType()\n << KCalMimeTypeVisitor::journalMimeType()\n << KCalMimeTypeVisitor::freeBusyMimeType();\n return types;\n }\n bool collectionMatchesMimeTypes() const\n {\n Q_FOREACH( QString type, allMimeTypes() ) {\n if ( q->collection().contentMimeTypes().contains( type ) )\n return true;\n }\n return false;\n }\n private:\n KCalModel *q;\n};\n\nKCalModel::KCalModel( QObject *parent )\n : ItemModel( parent ),\n d( new Private( this ) )\n{\n fetchScope().fetchFullPayload();\n}\n\nKCalModel::~KCalModel()\n{\n delete d;\n}\n\nQStringList KCalModel::mimeTypes() const\n{\n return QStringList()\n << QLatin1String(\"text\/uri-list\")\n << d->allMimeTypes();\n}\n\nint KCalModel::columnCount( const QModelIndex& ) const\n{\n if ( d->collectionMatchesMimeTypes() )\n return 4;\n else\n return 1;\n}\n\nint KCalModel::rowCount( const QModelIndex& ) const\n{\n if ( d->collectionMatchesMimeTypes() )\n return ItemModel::rowCount();\n else\n return 1;\n}\n\nQVariant KCalModel::data( const QModelIndex &index, int role ) const\n{\n if ( role == ItemModel::IdRole )\n return ItemModel::data( index, role );\n\n if ( !index.isValid() || index.row() >= rowCount() )\n return QVariant();\n\n \/\/ guard against use with collections that do not have the right contents\n if ( !d->collectionMatchesMimeTypes() ) {\n if ( role == Qt::DisplayRole )\n \/\/ FIXME: i18n when strings unfreeze for 4.4\n return QString::fromLatin1( \"This model can only handle event, task, journal or free-busy list folders. The current collection holds mimetypes: %1\").arg(\n collection().contentMimeTypes().join( QLatin1String(\",\") ) );\n return QVariant();\n }\n\n const Item item = itemForIndex( index );\n\n if ( !item.hasPayload<IncidencePtr>() )\n return QVariant();\n\n const IncidencePtr incidence = item.payload<IncidencePtr>();\n\n \/\/ Icon for the model entry\n switch( role ) {\n case Qt::DecorationRole:\n if ( index.column() == 0 ) {\n if ( incidence->type() == \"Todo\" ) {\n return SmallIcon( QLatin1String( \"view-pim-tasks\" ) );\n } else if ( incidence->type() == \"Journal\" ) {\n return SmallIcon( QLatin1String( \"view-pim-journal\" ) );\n } else if ( incidence->type() == \"Event\" ) {\n return SmallIcon( QLatin1String( \"view-pim-calendar\" ) );\n } else {\n return SmallIcon( QLatin1String( \"network-wired\" ) );\n }\n }\n break;\n case Qt::DisplayRole:\n switch( index.column() ) {\n case Summary:\n return incidence->summary();\n break;\n case DateTimeStart:\n return incidence->dtStart().toString();\n break;\n case DateTimeEnd:\n return incidence->dtEnd().toString();\n break;\n case Type:\n return incidence->type();\n break;\n default:\n break;\n }\n break;\n default:\n return QVariant();\n break;\n }\n\n return QVariant();\n}\n\nQVariant KCalModel::headerData( int section, Qt::Orientation orientation, int role ) const\n{\n if ( !d->collectionMatchesMimeTypes() )\n return QVariant();\n\n if ( role == Qt::DisplayRole && orientation == Qt::Horizontal ) {\n switch( section ) {\n case Summary:\n return i18nc( \"@title:column, calendar event summary\", \"Summary\" );\n case DateTimeStart:\n return i18nc( \"@title:column, calendar event start date and time\", \"Start date and time\" );\n case DateTimeEnd:\n return i18nc( \"@title:column, calendar event end date and time\", \"End date and time\" );\n case Type:\n return i18nc( \"@title:column, calendar event type\", \"Type\" );\n default:\n return QString();\n }\n }\n\n return ItemModel::headerData( section, orientation, role );\n}\n<commit_msg>Make the kcal model only report that it can only deal with calendar collections when the current collection is valid.<commit_after>\/*\n Copyright (c) 2008 Bruno Virlet <bvirlet@kdemail.net>\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 \"kcalmodel.h\"\n#include \"kcalmimetypevisitor.h\"\n\n#include <akonadi\/item.h>\n#include <akonadi\/itemfetchjob.h>\n#include <akonadi\/itemfetchscope.h>\n#include <akonadi\/collection.h>\n\n#include <kcal\/incidence.h>\n#include <kcal\/event.h>\n\n#include <klocale.h>\n#include <boost\/shared_ptr.hpp>\n\n#include <kiconloader.h>\n#include <QtGui\/QPixmap>\n\ntypedef boost::shared_ptr<KCal::Incidence> IncidencePtr;\n\nusing namespace Akonadi;\n\nclass KCalModel::Private\n{\n public:\n Private( KCalModel *model )\n :q( model )\n {\n }\n\n static QStringList allMimeTypes()\n {\n QStringList types;\n types << KCalMimeTypeVisitor::eventMimeType()\n << KCalMimeTypeVisitor::todoMimeType()\n << KCalMimeTypeVisitor::journalMimeType()\n << KCalMimeTypeVisitor::freeBusyMimeType();\n return types;\n }\n bool collectionMatchesMimeTypes() const\n {\n Q_FOREACH( QString type, allMimeTypes() ) {\n if ( q->collection().contentMimeTypes().contains( type ) )\n return true;\n }\n return false;\n }\n private:\n KCalModel *q;\n};\n\nKCalModel::KCalModel( QObject *parent )\n : ItemModel( parent ),\n d( new Private( this ) )\n{\n fetchScope().fetchFullPayload();\n}\n\nKCalModel::~KCalModel()\n{\n delete d;\n}\n\nQStringList KCalModel::mimeTypes() const\n{\n return QStringList()\n << QLatin1String(\"text\/uri-list\")\n << d->allMimeTypes();\n}\n\nint KCalModel::columnCount( const QModelIndex& ) const\n{\n if ( d->collectionMatchesMimeTypes() )\n return 4;\n else\n return 1;\n}\n\nint KCalModel::rowCount( const QModelIndex& ) const\n{\n if ( !collection().isValid() || d->collectionMatchesMimeTypes() )\n return ItemModel::rowCount();\n else\n return 1;\n}\n\nQVariant KCalModel::data( const QModelIndex &index, int role ) const\n{\n if ( role == ItemModel::IdRole )\n return ItemModel::data( index, role );\n\n if ( !index.isValid() || index.row() >= rowCount() )\n return QVariant();\n\n \/\/ guard against use with collections that do not have the right contents\n if ( !d->collectionMatchesMimeTypes() ) {\n if ( role == Qt::DisplayRole )\n \/\/ FIXME: i18n when strings unfreeze for 4.4\n return QString::fromLatin1( \"This model can only handle event, task, journal or free-busy list folders. The current collection holds mimetypes: %1\").arg(\n collection().contentMimeTypes().join( QLatin1String(\",\") ) );\n return QVariant();\n }\n\n const Item item = itemForIndex( index );\n\n if ( !item.hasPayload<IncidencePtr>() )\n return QVariant();\n\n const IncidencePtr incidence = item.payload<IncidencePtr>();\n\n \/\/ Icon for the model entry\n switch( role ) {\n case Qt::DecorationRole:\n if ( index.column() == 0 ) {\n if ( incidence->type() == \"Todo\" ) {\n return SmallIcon( QLatin1String( \"view-pim-tasks\" ) );\n } else if ( incidence->type() == \"Journal\" ) {\n return SmallIcon( QLatin1String( \"view-pim-journal\" ) );\n } else if ( incidence->type() == \"Event\" ) {\n return SmallIcon( QLatin1String( \"view-pim-calendar\" ) );\n } else {\n return SmallIcon( QLatin1String( \"network-wired\" ) );\n }\n }\n break;\n case Qt::DisplayRole:\n switch( index.column() ) {\n case Summary:\n return incidence->summary();\n break;\n case DateTimeStart:\n return incidence->dtStart().toString();\n break;\n case DateTimeEnd:\n return incidence->dtEnd().toString();\n break;\n case Type:\n return incidence->type();\n break;\n default:\n break;\n }\n break;\n default:\n return QVariant();\n break;\n }\n\n return QVariant();\n}\n\nQVariant KCalModel::headerData( int section, Qt::Orientation orientation, int role ) const\n{\n if ( !d->collectionMatchesMimeTypes() )\n return QVariant();\n\n if ( role == Qt::DisplayRole && orientation == Qt::Horizontal ) {\n switch( section ) {\n case Summary:\n return i18nc( \"@title:column, calendar event summary\", \"Summary\" );\n case DateTimeStart:\n return i18nc( \"@title:column, calendar event start date and time\", \"Start date and time\" );\n case DateTimeEnd:\n return i18nc( \"@title:column, calendar event end date and time\", \"End date and time\" );\n case Type:\n return i18nc( \"@title:column, calendar event type\", \"Type\" );\n default:\n return QString();\n }\n }\n\n return ItemModel::headerData( section, orientation, role );\n}\n<|endoftext|>"} {"text":"<commit_before>\/\/ This code is based on Sabberstone project.\n\/\/ Copyright (c) 2017-2019 SabberStone Team, darkfriend77 & rnilva\n\/\/ RosettaStone is hearthstone simulator using C++ with reinforcement learning.\n\/\/ Copyright (c) 2019 Chris Ohk, Youngjoong Kim, SeungHyun Jeon\n\n#include <Rosetta\/Actions\/Choose.hpp>\n#include <Rosetta\/Actions\/Draw.hpp>\n#include <Rosetta\/Actions\/Generic.hpp>\n#include <Rosetta\/Cards\/Cards.hpp>\n#include <Rosetta\/Commons\/Utils.hpp>\n#include <Rosetta\/Enchants\/Power.hpp>\n#include <Rosetta\/Games\/Game.hpp>\n#include <Rosetta\/Games\/GameManager.hpp>\n#include <Rosetta\/Policies\/Policy.hpp>\n#include <Rosetta\/Tasks\/PlayerTasks\/AttackTask.hpp>\n#include <Rosetta\/Tasks\/PlayerTasks\/PlayCardTask.hpp>\n#include <Rosetta\/Tasks\/Tasks.hpp>\n\n#include <effolkronium\/random.hpp>\n\n#include <algorithm>\n\nusing Random = effolkronium::random_static;\n\nnamespace RosettaStone\n{\nGame::Game(GameConfig& gameConfig) : m_gameConfig(gameConfig)\n{\n \/\/ Set game to player\n for (auto& p : m_players)\n {\n p.SetGame(this);\n }\n\n \/\/ Add hero and hero power\n GetPlayer1().AddHeroAndPower(\n Cards::GetInstance().GetHeroCard(gameConfig.player1Class),\n Cards::GetInstance().GetDefaultHeroPower(gameConfig.player1Class));\n GetPlayer2().AddHeroAndPower(\n Cards::GetInstance().GetHeroCard(gameConfig.player2Class),\n Cards::GetInstance().GetDefaultHeroPower(gameConfig.player2Class));\n\n \/\/ Set opponent player\n GetPlayer1().SetOpponent(&GetPlayer2());\n GetPlayer2().SetOpponent(&GetPlayer1());\n}\n\nPlayer& Game::GetPlayer1()\n{\n return m_players[0];\n}\n\nPlayer& Game::GetPlayer2()\n{\n return m_players[1];\n}\n\nPlayer& Game::GetCurrentPlayer() const\n{\n return *m_currentPlayer;\n}\n\nPlayer& Game::GetOpponentPlayer() const\n{\n return m_currentPlayer->GetOpponent();\n}\n\nstd::size_t Game::GetNextID()\n{\n return m_entityID++;\n}\n\nstd::size_t Game::GetNextOOP()\n{\n return m_oopIndex++;\n}\n\nvoid Game::BeginFirst()\n{\n \/\/ Set next step\n nextStep = Step::BEGIN_SHUFFLE;\n if (m_gameConfig.autoRun)\n {\n GameManager::ProcessNextStep(*this, nextStep);\n }\n}\n\nvoid Game::BeginShuffle()\n{\n \/\/ Shuffle cards in deck\n if (m_gameConfig.doShuffle)\n {\n GetPlayer1().GetDeck().Shuffle();\n GetPlayer2().GetDeck().Shuffle();\n }\n\n \/\/ Set next step\n nextStep = Step::BEGIN_DRAW;\n if (m_gameConfig.autoRun)\n {\n GameManager::ProcessNextStep(*this, nextStep);\n }\n}\n\nvoid Game::BeginDraw()\n{\n for (auto& p : m_players)\n {\n \/\/ Draw 3 cards\n Generic::Draw(p);\n Generic::Draw(p);\n Generic::Draw(p);\n\n if (&p != m_firstPlayer)\n {\n \/\/ Draw 4th card for second player\n Generic::Draw(p);\n\n \/\/ Give \"The Coin\" card to second player\n Card coin = Cards::GetInstance().FindCardByID(\"GAME_005\");\n p.GetHand().AddCard(*Entity::GetFromCard(p, std::move(coin)));\n }\n }\n\n \/\/ Set next step\n nextStep =\n m_gameConfig.skipMulligan ? Step::MAIN_BEGIN : Step::BEGIN_MULLIGAN;\n\n if (m_gameConfig.autoRun)\n {\n GameManager::ProcessNextStep(*this, nextStep);\n }\n}\n\nvoid Game::BeginMulligan()\n{\n \/\/ Start mulligan state\n GetPlayer1().mulliganState = Mulligan::INPUT;\n GetPlayer2().mulliganState = Mulligan::INPUT;\n\n \/\/ Collect cards that can redraw\n std::vector<std::size_t> p1HandIDs, p2HandIDs;\n for (auto& entity : GetPlayer1().GetHand().GetAllCards())\n {\n p1HandIDs.emplace_back(entity->id);\n }\n for (auto& entity : GetPlayer2().GetHand().GetAllCards())\n {\n p2HandIDs.emplace_back(entity->id);\n }\n\n \/\/ Create choice for each player\n Generic::CreateChoice(GetPlayer1(), ChoiceType::MULLIGAN,\n ChoiceAction::HAND, p1HandIDs);\n Generic::CreateChoice(GetPlayer2(), ChoiceType::MULLIGAN,\n ChoiceAction::HAND, p2HandIDs);\n\n Player& player1 = GetPlayer1();\n TaskMeta p1Choice = player1.GetPolicy().Require(player1, TaskID::MULLIGAN);\n Generic::ChoiceMulligan(player1,\n p1Choice.GetObject<std::vector<std::size_t>>());\n\n Player& player2 = GetPlayer2();\n TaskMeta p2Choice = player2.GetPolicy().Require(player2, TaskID::MULLIGAN);\n Generic::ChoiceMulligan(player2,\n p2Choice.GetObject<std::vector<std::size_t>>());\n\n nextStep = Step::MAIN_BEGIN;\n if (m_gameConfig.autoRun)\n {\n GameManager::ProcessNextStep(*this, nextStep);\n }\n}\n\nvoid Game::MainBegin()\n{\n \/\/ Set next step\n nextStep = Step::MAIN_READY;\n if (m_gameConfig.autoRun)\n {\n GameManager::ProcessNextStep(*this, nextStep);\n }\n}\n\nvoid Game::MainReady()\n{\n \/\/ Reset the number of attacked\n for (auto& p : m_players)\n {\n \/\/ Hero\n p.GetHero()->numAttacked = 0;\n \/\/ Field\n for (auto& m : p.GetField().GetAllMinions())\n {\n m->numAttacked = 0;\n }\n }\n\n \/\/ Reset exhaust for current player\n auto& curPlayer = GetCurrentPlayer();\n \/\/ Hero\n curPlayer.GetHero()->SetGameTag(GameTag::EXHAUSTED, 0);\n \/\/ Weapon\n if (curPlayer.GetHero()->weapon != nullptr)\n {\n curPlayer.GetHero()->weapon->SetGameTag(GameTag::EXHAUSTED, 0);\n }\n \/\/ Hero power\n curPlayer.GetHero()->heroPower->SetGameTag(GameTag::EXHAUSTED, 0);\n \/\/ Field\n for (auto& m : curPlayer.GetField().GetAllMinions())\n {\n m->SetGameTag(GameTag::EXHAUSTED, 0);\n }\n\n \/\/ Set next step\n nextStep = Step::MAIN_START_TRIGGERS;\n if (m_gameConfig.autoRun)\n {\n GameManager::ProcessNextStep(*this, nextStep);\n }\n}\n\nvoid Game::MainStartTriggers()\n{\n \/\/ Set next step\n nextStep = Step::MAIN_RESOURCE;\n if (m_gameConfig.autoRun)\n {\n GameManager::ProcessNextStep(*this, nextStep);\n }\n}\n\nvoid Game::MainResource()\n{\n auto& curPlayer = GetCurrentPlayer();\n\n \/\/ Add mana crystal to current player\n Generic::ChangeManaCrystal(curPlayer, 1, false);\n\n \/\/ Reset current mana\n curPlayer.currentMana = curPlayer.maximumMana;\n\n \/\/ Set next step\n nextStep = Step::MAIN_DRAW;\n if (m_gameConfig.autoRun)\n {\n GameManager::ProcessNextStep(*this, nextStep);\n }\n}\n\nvoid Game::MainDraw()\n{\n \/\/ Draw a card for current player\n Generic::Draw(GetCurrentPlayer());\n\n \/\/ Set next step\n nextStep = Step::MAIN_START;\n if (m_gameConfig.autoRun)\n {\n GameManager::ProcessNextStep(*this, nextStep);\n }\n}\n\nvoid Game::MainStart()\n{\n \/\/ Set next step\n nextStep = Step::MAIN_ACTION;\n if (m_gameConfig.autoRun)\n {\n GameManager::ProcessNextStep(*this, nextStep);\n }\n}\n\nvoid Game::MainAction()\n{\n auto& player = GetCurrentPlayer();\n\n TaskMeta next = player.GetPolicy().Next(*this);\n if (next.GetID() == +TaskID::END_TURN)\n {\n nextStep = Step::MAIN_END;\n if (m_gameConfig.autoRun)\n {\n GameManager::ProcessNextStep(*this, nextStep);\n }\n return;\n }\n\n TaskMeta req = player.GetPolicy().Require(player, next.GetID());\n SizedPtr<Entity*> list = req.GetObject<SizedPtr<Entity*>>();\n switch (next.GetID())\n {\n case TaskID::ATTACK:\n {\n Entity* source = list[0];\n Entity* target = list[1];\n Task::Run(player, PlayerTasks::AttackTask(source, target));\n break;\n }\n case TaskID::PLAY_CARD:\n {\n Entity* source = list[0];\n switch (source->card.cardType)\n {\n case CardType::MINION:\n Task::Run(player, PlayerTasks::PlayCardTask::Minion(\n player, source));\n break;\n case CardType::SPELL:\n if (list.size() == 1)\n {\n Task::Run(player, PlayerTasks::PlayCardTask::Spell(\n player, source));\n }\n else\n {\n Entity* target = list[1];\n Task::Run(player,\n PlayerTasks::PlayCardTask::SpellTarget(\n player, source, target));\n }\n break;\n case CardType::WEAPON:\n Task::Run(player, PlayerTasks::PlayCardTask::Weapon(\n player, source));\n break;\n default:\n throw std::invalid_argument(\n \"Game::MainAction() - Invalid card type!\");\n }\n break;\n }\n default:\n throw std::invalid_argument(\n \"Game::MainAction() - Invalid task type!\");\n }\n\n nextStep = Step::MAIN_ACTION;\n if (m_gameConfig.autoRun)\n {\n GameManager::ProcessNextStep(*this, nextStep);\n }\n return;\n}\n\nvoid Game::MainEnd()\n{\n \/\/ Set next step\n nextStep = Step::MAIN_CLEANUP;\n if (m_gameConfig.autoRun)\n {\n GameManager::ProcessNextStep(*this, nextStep);\n }\n}\n\nvoid Game::MainCleanUp()\n{\n auto& curPlayer = GetCurrentPlayer();\n\n \/\/ Unfreeze all characters they control that are Frozen, don't have\n \/\/ summoning sickness (or do have Charge) and have not attacked that turn\n \/\/ Hero\n if (curPlayer.GetHero()->GetGameTag(GameTag::FROZEN) == 1 &&\n curPlayer.GetHero()->numAttacked == 0)\n {\n curPlayer.GetHero()->SetGameTag(GameTag::FROZEN, 0);\n }\n \/\/ Field\n for (auto& m : curPlayer.GetField().GetAllMinions())\n {\n if (m->GetGameTag(GameTag::FROZEN) == 1 && m->numAttacked == 0 &&\n m->GetGameTag(GameTag::EXHAUSTED) == 0)\n {\n m->SetGameTag(GameTag::FROZEN, 0);\n }\n }\n\n \/\/ Set next step\n nextStep = Step::MAIN_NEXT;\n if (m_gameConfig.autoRun)\n {\n GameManager::ProcessNextStep(*this, nextStep);\n }\n}\n\nvoid Game::MainNext()\n{\n \/\/ Set player for next turn\n m_currentPlayer = &m_currentPlayer->GetOpponent();\n\n \/\/ Count next turn\n m_turn++;\n\n \/\/ Set next step\n nextStep = Step::MAIN_READY;\n if (m_gameConfig.autoRun)\n {\n GameManager::ProcessNextStep(*this, nextStep);\n }\n}\n\nvoid Game::FinalWrapUp()\n{\n \/\/ Set game states according by result\n for (auto& p : m_players)\n {\n if (p.playState == +PlayState::LOSING ||\n p.playState == +PlayState::CONCEDED)\n {\n p.playState = PlayState::LOST;\n p.GetOpponent().playState = PlayState::WON;\n }\n }\n\n \/\/ Set next step\n nextStep = Step::FINAL_GAMEOVER;\n if (m_gameConfig.autoRun)\n {\n GameManager::ProcessNextStep(*this, nextStep);\n }\n}\n\nvoid Game::FinalGameOver()\n{\n \/\/ Set game state to complete\n state = State::COMPLETE;\n}\n\nvoid Game::StartGame()\n{\n \/\/ Reverse card order in deck\n if (!m_gameConfig.doShuffle)\n {\n std::reverse(m_gameConfig.player1Deck.begin(),\n m_gameConfig.player1Deck.end());\n std::reverse(m_gameConfig.player2Deck.begin(),\n m_gameConfig.player2Deck.end());\n }\n\n \/\/ Set up decks\n for (auto& card : m_gameConfig.player1Deck)\n {\n if (card.cardType == +CardType::INVALID)\n {\n continue;\n }\n\n Entity* entity = Entity::GetFromCard(GetPlayer1(), std::move(card));\n GetPlayer1().GetDeck().AddCard(*entity);\n }\n for (auto& card : m_gameConfig.player2Deck)\n {\n if (card.cardType == +CardType::INVALID)\n {\n continue;\n }\n\n Entity* entity = Entity::GetFromCard(GetPlayer2(), std::move(card));\n GetPlayer2().GetDeck().AddCard(*entity);\n }\n\n \/\/ Fill cards to deck\n if (m_gameConfig.doFillDecks)\n {\n for (auto& p : m_players)\n {\n for (auto& cardID : m_gameConfig.fillCardIDs)\n {\n Card card = Cards::GetInstance().FindCardByID(cardID);\n Entity* entity = Entity::GetFromCard(p, std::move(card));\n p.GetDeck().AddCard(*entity);\n }\n }\n }\n\n \/\/ Set game states\n state = State::RUNNING;\n for (auto& p : m_players)\n {\n p.playState = PlayState::PLAYING;\n }\n\n \/\/ Determine first player\n switch (m_gameConfig.startPlayer)\n {\n case PlayerType::RANDOM:\n {\n const auto val = Random::get(0, 1);\n m_firstPlayer = &m_players[val];\n break;\n }\n case PlayerType::PLAYER1:\n m_firstPlayer = &m_players[0];\n break;\n case PlayerType::PLAYER2:\n m_firstPlayer = &m_players[1];\n break;\n }\n m_currentPlayer = m_firstPlayer;\n\n \/\/ Set first turn\n m_turn = 1;\n\n \/\/ Set next step\n nextStep = Step::BEGIN_FIRST;\n if (m_gameConfig.autoRun)\n {\n GameManager::ProcessNextStep(*this, nextStep);\n }\n}\n\nvoid Game::ProcessDestroy()\n{\n \/\/ Destroy weapons\n if (GetPlayer1().GetHero()->weapon != nullptr &&\n GetPlayer1().GetHero()->weapon->isDestroyed == true)\n {\n GetPlayer1().GetHero()->RemoveWeapon();\n }\n if (GetPlayer2().GetHero()->weapon != nullptr &&\n GetPlayer2().GetHero()->weapon->isDestroyed == true)\n {\n GetPlayer2().GetHero()->RemoveWeapon();\n }\n\n \/\/ Destroy minions\n if (deadMinions.size() > 0)\n {\n for (auto& deadMinion : deadMinions)\n {\n Minion* minion = deadMinion.second;\n\n \/\/ Process deathrattle tasks\n for (auto& power : minion->card.power.GetDeathrattleTask())\n {\n if (power == nullptr)\n {\n continue;\n }\n\n power->Run(minion->GetOwner());\n }\n\n \/\/ Remove minion from battlefield\n minion->GetOwner().GetField().RemoveMinion(*minion);\n \/\/ Add minion to graveyard\n minion->GetOwner().GetGraveyard().AddCard(*minion);\n }\n\n deadMinions.clear();\n }\n}\n\nvoid Game::ProcessUntil(Step step)\n{\n m_gameConfig.autoRun = false;\n while (nextStep != step)\n {\n GameManager::ProcessNextStep(*this, nextStep);\n }\n}\n} \/\/ namespace RosettaStone\n<commit_msg>fix: Fix duplicated variable names<commit_after>\/\/ This code is based on Sabberstone project.\n\/\/ Copyright (c) 2017-2019 SabberStone Team, darkfriend77 & rnilva\n\/\/ RosettaStone is hearthstone simulator using C++ with reinforcement learning.\n\/\/ Copyright (c) 2019 Chris Ohk, Youngjoong Kim, SeungHyun Jeon\n\n#include <Rosetta\/Actions\/Choose.hpp>\n#include <Rosetta\/Actions\/Draw.hpp>\n#include <Rosetta\/Actions\/Generic.hpp>\n#include <Rosetta\/Cards\/Cards.hpp>\n#include <Rosetta\/Commons\/Utils.hpp>\n#include <Rosetta\/Enchants\/Power.hpp>\n#include <Rosetta\/Games\/Game.hpp>\n#include <Rosetta\/Games\/GameManager.hpp>\n#include <Rosetta\/Policies\/Policy.hpp>\n#include <Rosetta\/Tasks\/PlayerTasks\/AttackTask.hpp>\n#include <Rosetta\/Tasks\/PlayerTasks\/PlayCardTask.hpp>\n#include <Rosetta\/Tasks\/Tasks.hpp>\n\n#include <effolkronium\/random.hpp>\n\n#include <algorithm>\n\nusing Random = effolkronium::random_static;\n\nnamespace RosettaStone\n{\nGame::Game(GameConfig& gameConfig) : m_gameConfig(gameConfig)\n{\n \/\/ Set game to player\n for (auto& p : m_players)\n {\n p.SetGame(this);\n }\n\n \/\/ Add hero and hero power\n GetPlayer1().AddHeroAndPower(\n Cards::GetInstance().GetHeroCard(gameConfig.player1Class),\n Cards::GetInstance().GetDefaultHeroPower(gameConfig.player1Class));\n GetPlayer2().AddHeroAndPower(\n Cards::GetInstance().GetHeroCard(gameConfig.player2Class),\n Cards::GetInstance().GetDefaultHeroPower(gameConfig.player2Class));\n\n \/\/ Set opponent player\n GetPlayer1().SetOpponent(&GetPlayer2());\n GetPlayer2().SetOpponent(&GetPlayer1());\n}\n\nPlayer& Game::GetPlayer1()\n{\n return m_players[0];\n}\n\nPlayer& Game::GetPlayer2()\n{\n return m_players[1];\n}\n\nPlayer& Game::GetCurrentPlayer() const\n{\n return *m_currentPlayer;\n}\n\nPlayer& Game::GetOpponentPlayer() const\n{\n return m_currentPlayer->GetOpponent();\n}\n\nstd::size_t Game::GetNextID()\n{\n return m_entityID++;\n}\n\nstd::size_t Game::GetNextOOP()\n{\n return m_oopIndex++;\n}\n\nvoid Game::BeginFirst()\n{\n \/\/ Set next step\n nextStep = Step::BEGIN_SHUFFLE;\n if (m_gameConfig.autoRun)\n {\n GameManager::ProcessNextStep(*this, nextStep);\n }\n}\n\nvoid Game::BeginShuffle()\n{\n \/\/ Shuffle cards in deck\n if (m_gameConfig.doShuffle)\n {\n GetPlayer1().GetDeck().Shuffle();\n GetPlayer2().GetDeck().Shuffle();\n }\n\n \/\/ Set next step\n nextStep = Step::BEGIN_DRAW;\n if (m_gameConfig.autoRun)\n {\n GameManager::ProcessNextStep(*this, nextStep);\n }\n}\n\nvoid Game::BeginDraw()\n{\n for (auto& p : m_players)\n {\n \/\/ Draw 3 cards\n Generic::Draw(p);\n Generic::Draw(p);\n Generic::Draw(p);\n\n if (&p != m_firstPlayer)\n {\n \/\/ Draw 4th card for second player\n Generic::Draw(p);\n\n \/\/ Give \"The Coin\" card to second player\n Card coin = Cards::GetInstance().FindCardByID(\"GAME_005\");\n p.GetHand().AddCard(*Entity::GetFromCard(p, std::move(coin)));\n }\n }\n\n \/\/ Set next step\n nextStep =\n m_gameConfig.skipMulligan ? Step::MAIN_BEGIN : Step::BEGIN_MULLIGAN;\n\n if (m_gameConfig.autoRun)\n {\n GameManager::ProcessNextStep(*this, nextStep);\n }\n}\n\nvoid Game::BeginMulligan()\n{\n \/\/ Start mulligan state\n GetPlayer1().mulliganState = Mulligan::INPUT;\n GetPlayer2().mulliganState = Mulligan::INPUT;\n\n \/\/ Collect cards that can redraw\n std::vector<std::size_t> p1HandIDs, p2HandIDs;\n for (auto& entity : GetPlayer1().GetHand().GetAllCards())\n {\n p1HandIDs.emplace_back(entity->id);\n }\n for (auto& entity : GetPlayer2().GetHand().GetAllCards())\n {\n p2HandIDs.emplace_back(entity->id);\n }\n\n \/\/ Create choice for each player\n Generic::CreateChoice(GetPlayer1(), ChoiceType::MULLIGAN,\n ChoiceAction::HAND, p1HandIDs);\n Generic::CreateChoice(GetPlayer2(), ChoiceType::MULLIGAN,\n ChoiceAction::HAND, p2HandIDs);\n\n Player& player1 = GetPlayer1();\n TaskMeta p1Choice = player1.GetPolicy().Require(player1, TaskID::MULLIGAN);\n Generic::ChoiceMulligan(player1,\n p1Choice.GetObject<std::vector<std::size_t>>());\n\n Player& player2 = GetPlayer2();\n TaskMeta p2Choice = player2.GetPolicy().Require(player2, TaskID::MULLIGAN);\n Generic::ChoiceMulligan(player2,\n p2Choice.GetObject<std::vector<std::size_t>>());\n\n nextStep = Step::MAIN_BEGIN;\n if (m_gameConfig.autoRun)\n {\n GameManager::ProcessNextStep(*this, nextStep);\n }\n}\n\nvoid Game::MainBegin()\n{\n \/\/ Set next step\n nextStep = Step::MAIN_READY;\n if (m_gameConfig.autoRun)\n {\n GameManager::ProcessNextStep(*this, nextStep);\n }\n}\n\nvoid Game::MainReady()\n{\n \/\/ Reset the number of attacked\n for (auto& p : m_players)\n {\n \/\/ Hero\n p.GetHero()->numAttacked = 0;\n \/\/ Field\n for (auto& m : p.GetField().GetAllMinions())\n {\n m->numAttacked = 0;\n }\n }\n\n \/\/ Reset exhaust for current player\n auto& curPlayer = GetCurrentPlayer();\n \/\/ Hero\n curPlayer.GetHero()->SetGameTag(GameTag::EXHAUSTED, 0);\n \/\/ Weapon\n if (curPlayer.GetHero()->weapon != nullptr)\n {\n curPlayer.GetHero()->weapon->SetGameTag(GameTag::EXHAUSTED, 0);\n }\n \/\/ Hero power\n curPlayer.GetHero()->heroPower->SetGameTag(GameTag::EXHAUSTED, 0);\n \/\/ Field\n for (auto& m : curPlayer.GetField().GetAllMinions())\n {\n m->SetGameTag(GameTag::EXHAUSTED, 0);\n }\n\n \/\/ Set next step\n nextStep = Step::MAIN_START_TRIGGERS;\n if (m_gameConfig.autoRun)\n {\n GameManager::ProcessNextStep(*this, nextStep);\n }\n}\n\nvoid Game::MainStartTriggers()\n{\n \/\/ Set next step\n nextStep = Step::MAIN_RESOURCE;\n if (m_gameConfig.autoRun)\n {\n GameManager::ProcessNextStep(*this, nextStep);\n }\n}\n\nvoid Game::MainResource()\n{\n auto& curPlayer = GetCurrentPlayer();\n\n \/\/ Add mana crystal to current player\n Generic::ChangeManaCrystal(curPlayer, 1, false);\n\n \/\/ Reset current mana\n curPlayer.currentMana = curPlayer.maximumMana;\n\n \/\/ Set next step\n nextStep = Step::MAIN_DRAW;\n if (m_gameConfig.autoRun)\n {\n GameManager::ProcessNextStep(*this, nextStep);\n }\n}\n\nvoid Game::MainDraw()\n{\n \/\/ Draw a card for current player\n Generic::Draw(GetCurrentPlayer());\n\n \/\/ Set next step\n nextStep = Step::MAIN_START;\n if (m_gameConfig.autoRun)\n {\n GameManager::ProcessNextStep(*this, nextStep);\n }\n}\n\nvoid Game::MainStart()\n{\n \/\/ Set next step\n nextStep = Step::MAIN_ACTION;\n if (m_gameConfig.autoRun)\n {\n GameManager::ProcessNextStep(*this, nextStep);\n }\n}\n\nvoid Game::MainAction()\n{\n auto& player = GetCurrentPlayer();\n\n TaskMeta next = player.GetPolicy().Next(*this);\n if (next.GetID() == +TaskID::END_TURN)\n {\n nextStep = Step::MAIN_END;\n if (m_gameConfig.autoRun)\n {\n GameManager::ProcessNextStep(*this, nextStep);\n }\n return;\n }\n\n TaskMeta req = player.GetPolicy().Require(player, next.GetID());\n SizedPtr<Entity*> list = req.GetObject<SizedPtr<Entity*>>();\n switch (next.GetID())\n {\n case TaskID::ATTACK:\n {\n Entity* source = list[0];\n Entity* target = list[1];\n Task::Run(player, PlayerTasks::AttackTask(source, target));\n break;\n }\n case TaskID::PLAY_CARD:\n {\n Entity* source = list[0];\n switch (source->card.cardType)\n {\n case CardType::MINION:\n Task::Run(player, PlayerTasks::PlayCardTask::Minion(\n player, source));\n break;\n case CardType::SPELL:\n if (list.size() == 1)\n {\n Task::Run(player, PlayerTasks::PlayCardTask::Spell(\n player, source));\n }\n else\n {\n Entity* target = list[1];\n Task::Run(player,\n PlayerTasks::PlayCardTask::SpellTarget(\n player, source, target));\n }\n break;\n case CardType::WEAPON:\n Task::Run(player, PlayerTasks::PlayCardTask::Weapon(\n player, source));\n break;\n default:\n throw std::invalid_argument(\n \"Game::MainAction() - Invalid card type!\");\n }\n break;\n }\n default:\n throw std::invalid_argument(\n \"Game::MainAction() - Invalid task type!\");\n }\n\n nextStep = Step::MAIN_ACTION;\n if (m_gameConfig.autoRun)\n {\n GameManager::ProcessNextStep(*this, nextStep);\n }\n return;\n}\n\nvoid Game::MainEnd()\n{\n \/\/ Set next step\n nextStep = Step::MAIN_CLEANUP;\n if (m_gameConfig.autoRun)\n {\n GameManager::ProcessNextStep(*this, nextStep);\n }\n}\n\nvoid Game::MainCleanUp()\n{\n auto& curPlayer = GetCurrentPlayer();\n\n \/\/ Unfreeze all characters they control that are Frozen, don't have\n \/\/ summoning sickness (or do have Charge) and have not attacked that turn\n \/\/ Hero\n if (curPlayer.GetHero()->GetGameTag(GameTag::FROZEN) == 1 &&\n curPlayer.GetHero()->numAttacked == 0)\n {\n curPlayer.GetHero()->SetGameTag(GameTag::FROZEN, 0);\n }\n \/\/ Field\n for (auto& m : curPlayer.GetField().GetAllMinions())\n {\n if (m->GetGameTag(GameTag::FROZEN) == 1 && m->numAttacked == 0 &&\n m->GetGameTag(GameTag::EXHAUSTED) == 0)\n {\n m->SetGameTag(GameTag::FROZEN, 0);\n }\n }\n\n \/\/ Set next step\n nextStep = Step::MAIN_NEXT;\n if (m_gameConfig.autoRun)\n {\n GameManager::ProcessNextStep(*this, nextStep);\n }\n}\n\nvoid Game::MainNext()\n{\n \/\/ Set player for next turn\n m_currentPlayer = &m_currentPlayer->GetOpponent();\n\n \/\/ Count next turn\n m_turn++;\n\n \/\/ Set next step\n nextStep = Step::MAIN_READY;\n if (m_gameConfig.autoRun)\n {\n GameManager::ProcessNextStep(*this, nextStep);\n }\n}\n\nvoid Game::FinalWrapUp()\n{\n \/\/ Set game states according by result\n for (auto& p : m_players)\n {\n if (p.playState == +PlayState::LOSING ||\n p.playState == +PlayState::CONCEDED)\n {\n p.playState = PlayState::LOST;\n p.GetOpponent().playState = PlayState::WON;\n }\n }\n\n \/\/ Set next step\n nextStep = Step::FINAL_GAMEOVER;\n if (m_gameConfig.autoRun)\n {\n GameManager::ProcessNextStep(*this, nextStep);\n }\n}\n\nvoid Game::FinalGameOver()\n{\n \/\/ Set game state to complete\n state = State::COMPLETE;\n}\n\nvoid Game::StartGame()\n{\n \/\/ Reverse card order in deck\n if (!m_gameConfig.doShuffle)\n {\n std::reverse(m_gameConfig.player1Deck.begin(),\n m_gameConfig.player1Deck.end());\n std::reverse(m_gameConfig.player2Deck.begin(),\n m_gameConfig.player2Deck.end());\n }\n\n \/\/ Set up decks\n for (auto& card : m_gameConfig.player1Deck)\n {\n if (card.cardType == +CardType::INVALID)\n {\n continue;\n }\n\n Entity* entity = Entity::GetFromCard(GetPlayer1(), std::move(card));\n GetPlayer1().GetDeck().AddCard(*entity);\n }\n for (auto& card : m_gameConfig.player2Deck)\n {\n if (card.cardType == +CardType::INVALID)\n {\n continue;\n }\n\n Entity* entity = Entity::GetFromCard(GetPlayer2(), std::move(card));\n GetPlayer2().GetDeck().AddCard(*entity);\n }\n\n \/\/ Fill cards to deck\n if (m_gameConfig.doFillDecks)\n {\n for (auto& p : m_players)\n {\n for (auto& cardID : m_gameConfig.fillCardIDs)\n {\n Card card = Cards::GetInstance().FindCardByID(cardID);\n Entity* entity = Entity::GetFromCard(p, std::move(card));\n p.GetDeck().AddCard(*entity);\n }\n }\n }\n\n \/\/ Set game states\n state = State::RUNNING;\n for (auto& p : m_players)\n {\n p.playState = PlayState::PLAYING;\n }\n\n \/\/ Determine first player\n switch (m_gameConfig.startPlayer)\n {\n case PlayerType::RANDOM:\n {\n const auto val = Random::get(0, 1);\n m_firstPlayer = &m_players[val];\n break;\n }\n case PlayerType::PLAYER1:\n m_firstPlayer = &m_players[0];\n break;\n case PlayerType::PLAYER2:\n m_firstPlayer = &m_players[1];\n break;\n }\n m_currentPlayer = m_firstPlayer;\n\n \/\/ Set first turn\n m_turn = 1;\n\n \/\/ Set next step\n nextStep = Step::BEGIN_FIRST;\n if (m_gameConfig.autoRun)\n {\n GameManager::ProcessNextStep(*this, nextStep);\n }\n}\n\nvoid Game::ProcessDestroy()\n{\n \/\/ Destroy weapons\n if (GetPlayer1().GetHero()->weapon != nullptr &&\n GetPlayer1().GetHero()->weapon->isDestroyed == true)\n {\n GetPlayer1().GetHero()->RemoveWeapon();\n }\n if (GetPlayer2().GetHero()->weapon != nullptr &&\n GetPlayer2().GetHero()->weapon->isDestroyed == true)\n {\n GetPlayer2().GetHero()->RemoveWeapon();\n }\n\n \/\/ Destroy minions\n if (deadMinions.size() > 0)\n {\n for (auto& deadMinion : deadMinions)\n {\n Minion* minion = deadMinion.second;\n\n \/\/ Process deathrattle tasks\n for (auto& power : minion->card.power.GetDeathrattleTask())\n {\n if (power == nullptr)\n {\n continue;\n }\n\n power->Run(minion->GetOwner());\n }\n\n \/\/ Remove minion from battlefield\n minion->GetOwner().GetField().RemoveMinion(*minion);\n \/\/ Add minion to graveyard\n minion->GetOwner().GetGraveyard().AddCard(*minion);\n }\n\n deadMinions.clear();\n }\n}\n\nvoid Game::ProcessUntil(Step untilStep)\n{\n m_gameConfig.autoRun = false;\n while (nextStep != untilStep)\n {\n GameManager::ProcessNextStep(*this, nextStep);\n }\n}\n} \/\/ namespace RosettaStone\n<|endoftext|>"} {"text":"<commit_before>\/\/ RUN: %clangxx_asan -O0 %s -o %t\n\/\/ RUN: %env_asan_opts=allocator_may_return_null=0 not %run %t 2>&1 | FileCheck %s\n\/\/ RUN: %env_asan_opts=allocator_may_return_null=1 %run %t 2>&1 | FileCheck %s --check-prefix=CHECK-NULL\n\n#include <stdio.h>\n#include <stdlib.h>\n\nextern void *aligned_alloc (size_t alignment, size_t size);\n\nint main() {\n void *p = aligned_alloc(17, 100);\n \/\/ CHECK: ERROR: AddressSanitizer: invalid allocation alignment: 17\n \/\/ CHECK: {{#0 0x.* in .*aligned_alloc}}\n \/\/ CHECK: {{#1 0x.* in main .*aligned_alloc-alignment.cc:}}[[@LINE-3]]\n \/\/ CHECK: SUMMARY: AddressSanitizer: invalid-allocation-alignment\n\n printf(\"pointer after failed aligned_alloc: %zd\\n\", (size_t)p);\n \/\/ CHECK-NULL: pointer after failed aligned_alloc: 0\n\n return 0;\n}\n<commit_msg>[ASan] Disable aligned_alloc-alignment.cc on Android.<commit_after>\/\/ RUN: %clangxx_asan -O0 %s -o %t\n\/\/ RUN: %env_asan_opts=allocator_may_return_null=0 not %run %t 2>&1 | FileCheck %s\n\/\/ RUN: %env_asan_opts=allocator_may_return_null=1 %run %t 2>&1 | FileCheck %s --check-prefix=CHECK-NULL\n\n\/\/ UNSUPPORTED: android\n\n#include <stdio.h>\n#include <stdlib.h>\n\nextern void *aligned_alloc(size_t alignment, size_t size);\n\nint main() {\n void *p = aligned_alloc(17, 100);\n \/\/ CHECK: ERROR: AddressSanitizer: invalid allocation alignment: 17\n \/\/ CHECK: {{#0 0x.* in .*aligned_alloc}}\n \/\/ CHECK: {{#1 0x.* in main .*aligned_alloc-alignment.cc:}}[[@LINE-3]]\n \/\/ CHECK: SUMMARY: AddressSanitizer: invalid-allocation-alignment\n\n printf(\"pointer after failed aligned_alloc: %zd\\n\", (size_t)p);\n \/\/ CHECK-NULL: pointer after failed aligned_alloc: 0\n\n return 0;\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\/Models\/Entity.hpp>\n#include <hspp\/Models\/Player.hpp>\n\nnamespace Hearthstonepp\n{\nEntity::Entity(Player& _owner, Card& _card) : card(_card), m_owner(&_owner)\n{\n for (auto& mechanic : _card.mechanics)\n {\n Entity::SetGameTag(mechanic, 1);\n }\n}\n\nEntity::Entity(const Entity& ent) : m_owner(ent.m_owner)\n{\n FreeMemory();\n\n card = ent.card;\n m_owner = ent.m_owner;\n m_gameTags = ent.m_gameTags;\n}\n\nEntity::Entity(Entity&& ent) noexcept : m_owner(ent.m_owner)\n{\n FreeMemory();\n\n card = ent.card;\n m_owner = ent.m_owner;\n m_gameTags = ent.m_gameTags;\n}\n\nEntity::~Entity()\n{\n FreeMemory();\n}\n\nEntity& Entity::operator=(const Entity& ent)\n{\n if (this == &ent)\n {\n return *this;\n }\n\n FreeMemory();\n\n card = ent.card;\n m_owner = ent.m_owner;\n m_gameTags = ent.m_gameTags;\n\n return *this;\n}\n\nEntity& Entity::operator=(Entity&& ent) noexcept\n{\n if (this == &ent)\n {\n return *this;\n }\n\n FreeMemory();\n\n card = ent.card;\n m_owner = ent.m_owner;\n m_gameTags = ent.m_gameTags;\n\n return *this;\n}\n\nPlayer& Entity::GetOwner() const\n{\n return *m_owner;\n}\n\nvoid Entity::SetOwner(Player& owner)\n{\n m_owner = &owner;\n}\n\nint Entity::GetGameTag(GameTag tag) const\n{\n if (m_gameTags.find(tag) == m_gameTags.end())\n {\n return 0;\n }\n\n return m_gameTags.at(tag);\n}\n\nvoid Entity::SetGameTag(GameTag tag, int value)\n{\n m_gameTags.insert_or_assign(tag, value);\n}\n\nvoid Entity::Destroy()\n{\n \/\/ Do nothing\n}\n\nEntity* Entity::GetFromCard(Player& player, Card card)\n{\n Entity* result;\n\n switch (card.cardType)\n {\n case +CardType::MINION:\n result = new Minion(player, card);\n break;\n case +CardType::SPELL:\n result = new Spell(player, card);\n break;\n case +CardType::WEAPON:\n result = new Weapon(player, card);\n break;\n default:\n throw std::invalid_argument(\n \"Generic::DrawCard() - Invalid card type!\");\n }\n\n return result;\n}\n\nvoid Entity::FreeMemory()\n{\n m_gameTags.clear();\n}\n} \/\/ namespace Hearthstonepp<commit_msg>[ci skip] refactor: Consider hero and hero power card<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\/Models\/Entity.hpp>\n#include <hspp\/Models\/Player.hpp>\n\nnamespace Hearthstonepp\n{\nEntity::Entity(Player& _owner, Card& _card) : card(_card), m_owner(&_owner)\n{\n for (auto& mechanic : _card.mechanics)\n {\n Entity::SetGameTag(mechanic, 1);\n }\n}\n\nEntity::Entity(const Entity& ent) : m_owner(ent.m_owner)\n{\n FreeMemory();\n\n card = ent.card;\n m_owner = ent.m_owner;\n m_gameTags = ent.m_gameTags;\n}\n\nEntity::Entity(Entity&& ent) noexcept : m_owner(ent.m_owner)\n{\n FreeMemory();\n\n card = ent.card;\n m_owner = ent.m_owner;\n m_gameTags = ent.m_gameTags;\n}\n\nEntity::~Entity()\n{\n FreeMemory();\n}\n\nEntity& Entity::operator=(const Entity& ent)\n{\n if (this == &ent)\n {\n return *this;\n }\n\n FreeMemory();\n\n card = ent.card;\n m_owner = ent.m_owner;\n m_gameTags = ent.m_gameTags;\n\n return *this;\n}\n\nEntity& Entity::operator=(Entity&& ent) noexcept\n{\n if (this == &ent)\n {\n return *this;\n }\n\n FreeMemory();\n\n card = ent.card;\n m_owner = ent.m_owner;\n m_gameTags = ent.m_gameTags;\n\n return *this;\n}\n\nPlayer& Entity::GetOwner() const\n{\n return *m_owner;\n}\n\nvoid Entity::SetOwner(Player& owner)\n{\n m_owner = &owner;\n}\n\nint Entity::GetGameTag(GameTag tag) const\n{\n if (m_gameTags.find(tag) == m_gameTags.end())\n {\n return 0;\n }\n\n return m_gameTags.at(tag);\n}\n\nvoid Entity::SetGameTag(GameTag tag, int value)\n{\n m_gameTags.insert_or_assign(tag, value);\n}\n\nvoid Entity::Destroy()\n{\n \/\/ Do nothing\n}\n\nEntity* Entity::GetFromCard(Player& player, Card card)\n{\n Entity* result;\n\n switch (card.cardType)\n {\n case +CardType::HERO:\n result = new Hero(player, card);\n break;\n case +CardType::HERO_POWER:\n result = new HeroPower(player, card);\n break;\n case +CardType::MINION:\n result = new Minion(player, card);\n break;\n case +CardType::SPELL:\n result = new Spell(player, card);\n break;\n case +CardType::WEAPON:\n result = new Weapon(player, card);\n break;\n default:\n throw std::invalid_argument(\n \"Generic::DrawCard() - Invalid card type!\");\n }\n\n return result;\n}\n\nvoid Entity::FreeMemory()\n{\n m_gameTags.clear();\n}\n} \/\/ namespace Hearthstonepp<|endoftext|>"} {"text":"<commit_before>#include \"gtest\/gtest.h\"\n\n#include \"IFile.h\"\n#include \"IFolder.h\"\n#include \"IMediaLibrary.h\"\n\nclass Folders : public testing::Test\n{\n public:\n static std::unique_ptr<IMediaLibrary> ml;\n\n protected:\n virtual void SetUp()\n {\n ml.reset( MediaLibraryFactory::create() );\n bool res = ml->initialize( \"test.db\" );\n ASSERT_TRUE( res );\n }\n\n virtual void TearDown()\n {\n ml.reset();\n unlink(\"test.db\");\n }\n};\n\nstd::unique_ptr<IMediaLibrary> Folders::ml;\n\nTEST_F( Folders, Add )\n{\n auto f = ml->addFolder( \".\" );\n ASSERT_NE( f, nullptr );\n\n auto files = ml->files();\n\n ASSERT_EQ( files.size(), 2u );\n ASSERT_FALSE( files[0]->isStandAlone() );\n}\n\nTEST_F( Folders, Delete )\n{\n auto f = ml->addFolder( \".\" );\n ASSERT_NE( f, nullptr );\n\n auto files = ml->files();\n ASSERT_EQ( files.size(), 2u );\n\n ml->deleteFolder( f );\n\n files = ml->files();\n ASSERT_EQ( files.size(), 0u );\n}\n\nTEST_F( Folders, Load )\n{\n auto f = ml->addFolder( \".\" );\n ASSERT_NE( f, nullptr );\n\n auto files = ml->files();\n ASSERT_EQ( files.size(), 2u );\n\n SetUp();\n\n files = ml->files();\n ASSERT_EQ( files.size(), 2u );\n ASSERT_FALSE( files[0]->isStandAlone() );\n ASSERT_FALSE( files[1]->isStandAlone() );\n}\n\nTEST_F( Folders, InvalidPath )\n{\n auto f = ml->addFolder( \"\/invalid\/path\" );\n ASSERT_EQ( f, nullptr );\n\n auto files = ml->files();\n ASSERT_EQ( files.size(), 0u );\n}\n<commit_msg>tests: Folders deletion: Add extra checks<commit_after>#include \"gtest\/gtest.h\"\n\n#include \"IFile.h\"\n#include \"IFolder.h\"\n#include \"IMediaLibrary.h\"\n\nclass Folders : public testing::Test\n{\n public:\n static std::unique_ptr<IMediaLibrary> ml;\n\n protected:\n virtual void SetUp()\n {\n ml.reset( MediaLibraryFactory::create() );\n bool res = ml->initialize( \"test.db\" );\n ASSERT_TRUE( res );\n }\n\n virtual void TearDown()\n {\n ml.reset();\n unlink(\"test.db\");\n }\n};\n\nstd::unique_ptr<IMediaLibrary> Folders::ml;\n\nTEST_F( Folders, Add )\n{\n auto f = ml->addFolder( \".\" );\n ASSERT_NE( f, nullptr );\n\n auto files = ml->files();\n\n ASSERT_EQ( files.size(), 2u );\n ASSERT_FALSE( files[0]->isStandAlone() );\n}\n\nTEST_F( Folders, Delete )\n{\n auto f = ml->addFolder( \".\" );\n ASSERT_NE( f, nullptr );\n\n auto folderPath = f->path();\n\n auto files = ml->files();\n ASSERT_EQ( files.size(), 2u );\n\n auto filePath = files[0]->mrl();\n\n ml->deleteFolder( f );\n\n f = ml->folder( folderPath );\n ASSERT_EQ( nullptr, f );\n\n files = ml->files();\n ASSERT_EQ( files.size(), 0u );\n\n \/\/ Check the file isn't cached anymore:\n auto file = ml->file( filePath );\n ASSERT_EQ( nullptr, file );\n\n SetUp();\n\n \/\/ Recheck folder deletion from DB:\n f = ml->folder( folderPath );\n ASSERT_EQ( nullptr, f );\n}\n\nTEST_F( Folders, Load )\n{\n auto f = ml->addFolder( \".\" );\n ASSERT_NE( f, nullptr );\n\n auto files = ml->files();\n ASSERT_EQ( files.size(), 2u );\n\n SetUp();\n\n files = ml->files();\n ASSERT_EQ( files.size(), 2u );\n ASSERT_FALSE( files[0]->isStandAlone() );\n ASSERT_FALSE( files[1]->isStandAlone() );\n}\n\nTEST_F( Folders, InvalidPath )\n{\n auto f = ml->addFolder( \"\/invalid\/path\" );\n ASSERT_EQ( f, nullptr );\n\n auto files = ml->files();\n ASSERT_EQ( files.size(), 0u );\n}\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 <map>\n#include <string>\n\n#include \"atom\/common\/crash_reporter\/crash_reporter.h\"\n#include \"atom\/common\/native_mate_converters\/file_path_converter.h\"\n#include \"base\/bind.h\"\n#include \"native_mate\/dictionary.h\"\n\n#include \"atom\/common\/node_includes.h\"\n\nusing crash_reporter::CrashReporter;\n\nnamespace mate {\n\ntemplate<>\nstruct Converter<CrashReporter::UploadReportResult> {\n static v8::Local<v8::Value> ToV8(v8::Isolate* isolate,\n const CrashReporter::UploadReportResult& reports) {\n mate::Dictionary dict(isolate, v8::Object::New(isolate));\n dict.Set(\"date\", v8::Date::New(isolate, reports.first*1000.0));\n dict.Set(\"id\", reports.second);\n return dict.GetHandle();\n }\n};\n\n} \/\/ namespace mate\n\nnamespace {\n\nvoid SetExtraParameter(const std::string& key, mate::Arguments* args) {\n std::string value;\n if (args->GetNext(&value))\n CrashReporter::GetInstance()->SetExtraParameter(key, value);\n else\n CrashReporter::GetInstance()->RemoveExtraParameter(key);\n}\n\n\nvoid Initialize(v8::Local<v8::Object> exports, v8::Local<v8::Value> unused,\n v8::Local<v8::Context> context, void* priv) {\n mate::Dictionary dict(context->GetIsolate(), exports);\n auto reporter = base::Unretained(CrashReporter::GetInstance());\n dict.SetMethod(\"start\", base::Bind(&CrashReporter::Start, reporter));\n dict.SetMethod(\"setExtraParameter\", &SetExtraParameter);\n dict.SetMethod(\"getUploadedReports\",\n base::Bind(&CrashReporter::GetUploadedReports, reporter));\n dict.SetMethod(\"setUploadToServer\",\n base::Bind(&CrashReporter::SetUploadToServer, reporter));\n dict.SetMethod(\"getUploadToServer\",\n base::Bind(&CrashReporter::GetUploadToServer, reporter));\n}\n\n} \/\/ namespace\n\nNODE_MODULE_CONTEXT_AWARE_BUILTIN(atom_common_crash_reporter, Initialize)\n<commit_msg>extrapolate removeExtraParameter into new method<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 <map>\n#include <string>\n\n#include \"atom\/common\/crash_reporter\/crash_reporter.h\"\n#include \"atom\/common\/native_mate_converters\/file_path_converter.h\"\n#include \"base\/bind.h\"\n#include \"native_mate\/dictionary.h\"\n\n#include \"atom\/common\/node_includes.h\"\n\nusing crash_reporter::CrashReporter;\n\nnamespace mate {\n\ntemplate<>\nstruct Converter<CrashReporter::UploadReportResult> {\n static v8::Local<v8::Value> ToV8(v8::Isolate* isolate,\n const CrashReporter::UploadReportResult& reports) {\n mate::Dictionary dict(isolate, v8::Object::New(isolate));\n dict.Set(\"date\", v8::Date::New(isolate, reports.first*1000.0));\n dict.Set(\"id\", reports.second);\n return dict.GetHandle();\n }\n};\n\n} \/\/ namespace mate\n\nnamespace {\n\nvoid SetExtraParameter(const std::string& key, const std::string& value) {\n CrashReporter::GetInstance()->SetExtraParameter(key, value);\n}\n\nvoid RemoveExtraParameter(const std::string& key) {\n CrashReporter::GetInstance()->RemoveExtraParameter(key);\n}\n\n\nvoid Initialize(v8::Local<v8::Object> exports, v8::Local<v8::Value> unused,\n v8::Local<v8::Context> context, void* priv) {\n mate::Dictionary dict(context->GetIsolate(), exports);\n auto reporter = base::Unretained(CrashReporter::GetInstance());\n dict.SetMethod(\"start\", base::Bind(&CrashReporter::Start, reporter));\n dict.SetMethod(\"setExtraParameter\", &SetExtraParameter);\n dict.SetMethod(\"removeExtraParameter\", &SetExtraParameter);\n dict.SetMethod(\"getUploadedReports\",\n base::Bind(&CrashReporter::GetUploadedReports, reporter));\n dict.SetMethod(\"setUploadToServer\",\n base::Bind(&CrashReporter::SetUploadToServer, reporter));\n dict.SetMethod(\"getUploadToServer\",\n base::Bind(&CrashReporter::GetUploadToServer, reporter));\n}\n\n} \/\/ namespace\n\nNODE_MODULE_CONTEXT_AWARE_BUILTIN(atom_common_crash_reporter, Initialize)\n<|endoftext|>"} {"text":"<commit_before>AliAnalysisTaskHaHFECorrel *AddTaskHaHFECorrel(Double_t period, Double_t MinPtEvent, Double_t MaxPtEvent, Bool_t TRDQA, Bool_t TagEff, Bool_t RecEff, Bool_t OneTimeCheck, Bool_t CorrHadron, Bool_t CorrLP, Bool_t MCTruth, Bool_t IsMC, Bool_t IsAOD, Bool_t IsHFE, Bool_t UseTender, Double_t EtaMax, Int_t ITSnCut, Float_t ITSSharedCluster, Int_t TPCnCut, Int_t TPCnCutdEdx, Double_t PhotElecPtCut, Int_t PhotElecTPCnCut,Bool_t PhotElecITSrefitCut, Int_t PhotCorrCase, Double_t InvmassCut, Int_t HTPCnCut, Bool_t HITSrefitCut, Bool_t HTPCrefitCut, Bool_t UseITS, Double_t SigmaITScut, Double_t SigmaTOFcut, Double_t SigmaTPCcut, const char * ID=\"\")\n{\n AliAnalysisManager *mgr = AliAnalysisManager::GetAnalysisManager();\n if (!mgr) {\n Error(\"AddTaskHaHFECorrel\", \"No analysis manager found.\");\n return 0;\n }\n\n if (!mgr->GetInputEventHandler()) {\n ::Error(\"AddTaskHaHFECorrel\", \"This task requires an input event handler\");\n return 0x0;\n }\n\n TString type = mgr->GetInputEventHandler()->GetDataType();\n\n \/*\n AliMCEventHandler* mcHand = new AliMCEventHandler();\n mgr->SetMCtruthEventHandler(mcHand);\n Bool_t MCthere=kTRUE;\n AliMCEventHandler *mcH = dynamic_cast<AliMCEventHandler*>(mgr->GetMCtruthEventHandler());\n if (!mcH) {\n MCthere=kFALSE;\n }\n *\/\n\n\n\n gROOT->LoadMacro(\"$ALICE_PHYSICS\/PWGHF\/hfe\/macros\/configs\/pp\/ConfigHaHFECorrel.C\");\n AliAnalysisTaskHaHFECorrel *taskMB = \n ConfigHaHFECorrel(period, MinPtEvent, MaxPtEvent, TRDQA, TagEff, RecEff, OneTimeCheck, CorrHadron, CorrLP, MCTruth, IsMC, IsAOD, IsHFE, UseTender,EtaMax, ITSnCut, ITSSharedCluster, TPCnCut, TPCnCutdEdx, PhotElecPtCut,PhotElecTPCnCut, PhotElecITSrefitCut, PhotCorrCase, InvmassCut, HTPCnCut, HITSrefitCut, HTPCrefitCut, UseITS, SigmaITScut, SigmaTOFcut, SigmaTPCcut, ID);\n if (!taskMB) {\n Error(\"AddTaskHaHFECorrel\", \"No task found.\");\n }\n taskMB->SelectCollisionCandidates(AliVEvent::kINT7);\n \n \/\/ Load correction weights for pi0, eta\n if (IsMC) {\n TH1::AddDirectory(kFALSE);\n printf(\"Loading Pi0EtaCorrectionFiles\\n\");\n TString CorrectPi0EtaFile;\n if (!IsHFE) CorrectPi0EtaFile=\"alien:\/\/\/alice\/cern.ch\/user\/f\/flherrma\/HaHFECorrel\/Pi0EtaWeightsMinBias.root\";\n else if (IsHFE) CorrectPi0EtaFile=\"alien:\/\/\/alice\/cern.ch\/user\/f\/flherrma\/HaHFECorrel\/Pi0EtaWeightsHFE.root\";\n TFile *CorrectPi0Eta = TFile::Open(CorrectPi0EtaFile.Data());\n if (CorrectPi0Eta) { \n TH1F * Pi0W = (TH1F*)CorrectPi0Eta->Get(\"Pi0WeightsIncl\");\n TH1F * EtaW = (TH1F*)CorrectPi0Eta->Get(\"EtaWeightsIncl\");\n if (Pi0W) taskMB->SetPi0WeightToData(*Pi0W);\n else printf(\"Could not load Pi0Weights\\n\");\n if (EtaW) taskMB->SetEtaWeightToData(*EtaW);\n else printf(\"Could not load EtaWeights\\n\");\n }\n else printf(\"Could not open Pi0Eta correction file \\n\");\n TH1::AddDirectory(kTRUE);\n }\n\n\n\n\n TH1::AddDirectory(kFALSE);\n printf(\"Loading SPDnTrAvg\\n\");\n TString SPDnTrFileName;\n if (IsMC) SPDnTrFileName=\"alien:\/\/\/alice\/cern.ch\/user\/f\/flherrma\/HaHFECorrel\/SPDnTrAvg_MC.root\";\n else SPDnTrFileName=\"alien:\/\/\/alice\/cern.ch\/user\/f\/flherrma\/HaHFECorrel\/SPDnTrAvg_Data.root\";\n TFile *SPDnTrFile = TFile::Open(SPDnTrFileName.Data());\n if (SPDnTrFile) { \n TProfile* SPDnTrAvg = (TProfile*)SPDnTrFile->Get(\"SPDnTrAvg\");\n if (SPDnTrAvg) taskMB->SetSPDnTrAvg(*SPDnTrAvg);\n else printf(\"Could not load SPDnTrAvg\\n\");\n }\n else printf(\"Could not open SPDnTrAvg correction file \\n\");\n TH1::AddDirectory(kTRUE);\n\n TH1::AddDirectory(kFALSE);\n printf(\"Loading RecEffFiles\\n\");\n TString RecEffFileName=\"alien:\/\/\/alice\/cern.ch\/user\/f\/flherrma\/HaHFECorrel\/RecEff.root\";\n TFile *RecEffFile = TFile::Open(RecEffFileName.Data());\n RecEffFile->ls();\n \/\/RecEffFile->ls();\n if (RecEffFile) { \n TH3F * HadRecEff = (TH3F*)RecEffFile->Get(\"HadRecEff\");\n TH2F * EleRecEff = (TH2F*)RecEffFile->Get(\"EleRecEff\");\n if (HadRecEff) taskMB->SetHadRecEff(*HadRecEff);\n else printf(\"Could not load HadRecEff\\n\");\n if (EleRecEff) taskMB->SetEleRecEff(*EleRecEff);\n else printf(\"Could not load EleRecEff\\n\");\n }\n else printf(\"Could not open RecEff correction file \\n\");\n TH1::AddDirectory(kTRUE);\n\n\n TH1::AddDirectory(kFALSE);\n printf(\"Loading NonTagCorr\\n\");\n TString NonTagFileName=\"alien:\/\/\/alice\/cern.ch\/user\/f\/flherrma\/HaHFECorrel\/NonTagCorrHist.root\";\n TFile *NonTagFile = TFile::Open(NonTagFileName.Data());\n NonTagFile->ls();\n if (NonTagFile) { \n TH1F * NonTagCorr = (TH1F*)NonTagFile->Get(\"NonTagCorr\");\n if (NonTagCorr) taskMB->SetNonTagCorr(*NonTagCorr);\n else printf(\"Could not load NonTagCorr\\n\");\n }\n else printf(\"Could not open NonTag correction file \\n\");\n TH1::AddDirectory(kTRUE);\n\n\n\n\n\n mgr->AddTask(taskMB);\n\n TString containerName1 = mgr->GetCommonFileName();\n containerName1 += \":PWGHF_HaHFECorrel_kINT7_\";\n containerName1 += ID;\n \n TString name1 = \"histMB_\";\n name1 += ID;\n \n TString name2 = \"Main_\";\n name2 += ID;\n TString name3 = \"LP_\";\n name3 += ID;\n TString name4 = \"Hadron_\";\n name4 += ID;\n TString name5 = \"QA_\";\n name5 += ID;\n\n\n AliAnalysisDataContainer *cinput = mgr->GetCommonInputContainer();\n AliAnalysisDataContainer *coutput1 = mgr->CreateContainer(name1.Data(), TList::Class(),AliAnalysisManager::kOutputContainer, containerName1.Data());\n AliAnalysisDataContainer *coutputMain = mgr->CreateContainer(name2.Data(), TList::Class(),AliAnalysisManager::kOutputContainer, containerName1.Data());\n AliAnalysisDataContainer *coutputLP = mgr->CreateContainer(name3.Data(), TList::Class(),AliAnalysisManager::kOutputContainer, containerName1.Data());\n AliAnalysisDataContainer *coutputHa = mgr->CreateContainer(name4.Data(), TList::Class(),AliAnalysisManager::kOutputContainer, containerName1.Data());\n AliAnalysisDataContainer *coutputQA = mgr->CreateContainer(name5.Data(), TList::Class(),AliAnalysisManager::kOutputContainer, containerName1.Data());\n\n mgr->ConnectInput(taskMB, 0, cinput);\n mgr->ConnectOutput(taskMB, 1, coutput1);\n mgr->ConnectOutput(taskMB, 2, coutputMain);\n mgr->ConnectOutput(taskMB, 3, coutputLP);\n mgr->ConnectOutput(taskMB, 4, coutputHa);\n mgr->ConnectOutput(taskMB, 5, coutputQA);\n\n\n\n return NULL;\n}\n<commit_msg>Root6 Transition<commit_after>#if defined(__CLING__)\n\n R__ADD_INCLUDE_PATH($ALICE_PHYSICS)\n #include <PWGHF\/hfe\/macros\/configs\/pp\/ConfigHaHFECorrel.C>\n\n\n#elif defined(__CINT__)\n \/\/ ROOT5-specific code here ...\n#endif\n\n\nAliAnalysisTaskHaHFECorrel *AddTaskHaHFECorrel(Double_t period, Double_t MinPtEvent, Double_t MaxPtEvent, Bool_t TRDQA, Bool_t TagEff, Bool_t RecEff, Bool_t OneTimeCheck, Bool_t CorrHadron, Bool_t CorrLP, Bool_t MCTruth, Bool_t IsMC, Bool_t IsAOD, Bool_t IsHFE, Bool_t UseTender, Double_t EtaMax, Int_t ITSnCut, Float_t ITSSharedCluster, Int_t TPCnCut, Int_t TPCnCutdEdx, Double_t PhotElecPtCut, Int_t PhotElecTPCnCut,Bool_t PhotElecITSrefitCut, Int_t PhotCorrCase, Double_t InvmassCut, Int_t HTPCnCut, Bool_t HITSrefitCut, Bool_t HTPCrefitCut, Bool_t UseITS, Double_t SigmaITScut, Double_t SigmaTOFcut, Double_t SigmaTPCcut, const char * ID=\"\")\n{\n AliAnalysisManager *mgr = AliAnalysisManager::GetAnalysisManager();\n if (!mgr) {\n Error(\"AddTaskHaHFECorrel\", \"No analysis manager found.\");\n return 0;\n }\n\n if (!mgr->GetInputEventHandler()) {\n ::Error(\"AddTaskHaHFECorrel\", \"This task requires an input event handler\");\n return 0x0;\n }\n\n TString type = mgr->GetInputEventHandler()->GetDataType();\n\n \/*\n AliMCEventHandler* mcHand = new AliMCEventHandler();\n mgr->SetMCtruthEventHandler(mcHand);\n Bool_t MCthere=kTRUE;\n AliMCEventHandler *mcH = dynamic_cast<AliMCEventHandler*>(mgr->GetMCtruthEventHandler());\n if (!mcH) {\n MCthere=kFALSE;\n }\n *\/\n\n\n\n gROOT->LoadMacro(\"$ALICE_PHYSICS\/PWGHF\/hfe\/macros\/configs\/pp\/ConfigHaHFECorrel.C\");\n AliAnalysisTaskHaHFECorrel *taskMB = \n ConfigHaHFECorrel(period, MinPtEvent, MaxPtEvent, TRDQA, TagEff, RecEff, OneTimeCheck, CorrHadron, CorrLP, MCTruth, IsMC, IsAOD, IsHFE, UseTender,EtaMax, ITSnCut, ITSSharedCluster, TPCnCut, TPCnCutdEdx, PhotElecPtCut,PhotElecTPCnCut, PhotElecITSrefitCut, PhotCorrCase, InvmassCut, HTPCnCut, HITSrefitCut, HTPCrefitCut, UseITS, SigmaITScut, SigmaTOFcut, SigmaTPCcut, ID);\n if (!taskMB) {\n Error(\"AddTaskHaHFECorrel\", \"No task found.\");\n }\n taskMB->SelectCollisionCandidates(AliVEvent::kINT7);\n \n \/\/ Load correction weights for pi0, eta\n if (IsMC) {\n TH1::AddDirectory(kFALSE);\n printf(\"Loading Pi0EtaCorrectionFiles\\n\");\n TString CorrectPi0EtaFile;\n if (!IsHFE) CorrectPi0EtaFile=\"alien:\/\/\/alice\/cern.ch\/user\/f\/flherrma\/HaHFECorrel\/Pi0EtaWeightsMinBias.root\";\n else if (IsHFE) CorrectPi0EtaFile=\"alien:\/\/\/alice\/cern.ch\/user\/f\/flherrma\/HaHFECorrel\/Pi0EtaWeightsHFE.root\";\n TFile *CorrectPi0Eta = TFile::Open(CorrectPi0EtaFile.Data());\n if (CorrectPi0Eta) { \n TH1F * Pi0W = (TH1F*)CorrectPi0Eta->Get(\"Pi0WeightsIncl\");\n TH1F * EtaW = (TH1F*)CorrectPi0Eta->Get(\"EtaWeightsIncl\");\n if (Pi0W) taskMB->SetPi0WeightToData(*Pi0W);\n else printf(\"Could not load Pi0Weights\\n\");\n if (EtaW) taskMB->SetEtaWeightToData(*EtaW);\n else printf(\"Could not load EtaWeights\\n\");\n }\n else printf(\"Could not open Pi0Eta correction file \\n\");\n TH1::AddDirectory(kTRUE);\n }\n\n\n\n\n TH1::AddDirectory(kFALSE);\n printf(\"Loading SPDnTrAvg\\n\");\n TString SPDnTrFileName;\n if (IsMC) SPDnTrFileName=\"alien:\/\/\/alice\/cern.ch\/user\/f\/flherrma\/HaHFECorrel\/SPDnTrAvg_MC.root\";\n else SPDnTrFileName=\"alien:\/\/\/alice\/cern.ch\/user\/f\/flherrma\/HaHFECorrel\/SPDnTrAvg_Data.root\";\n TFile *SPDnTrFile = TFile::Open(SPDnTrFileName.Data());\n if (SPDnTrFile) { \n TProfile* SPDnTrAvg = (TProfile*)SPDnTrFile->Get(\"SPDnTrAvg\");\n if (SPDnTrAvg) taskMB->SetSPDnTrAvg(*SPDnTrAvg);\n else printf(\"Could not load SPDnTrAvg\\n\");\n }\n else printf(\"Could not open SPDnTrAvg correction file \\n\");\n TH1::AddDirectory(kTRUE);\n\n TH1::AddDirectory(kFALSE);\n printf(\"Loading RecEffFiles\\n\");\n TString RecEffFileName=\"alien:\/\/\/alice\/cern.ch\/user\/f\/flherrma\/HaHFECorrel\/RecEff.root\";\n TFile *RecEffFile = TFile::Open(RecEffFileName.Data());\n RecEffFile->ls();\n \/\/RecEffFile->ls();\n if (RecEffFile) { \n TH3F * HadRecEff = (TH3F*)RecEffFile->Get(\"HadRecEff\");\n TH2F * EleRecEff = (TH2F*)RecEffFile->Get(\"EleRecEff\");\n if (HadRecEff) taskMB->SetHadRecEff(*HadRecEff);\n else printf(\"Could not load HadRecEff\\n\");\n if (EleRecEff) taskMB->SetEleRecEff(*EleRecEff);\n else printf(\"Could not load EleRecEff\\n\");\n }\n else printf(\"Could not open RecEff correction file \\n\");\n TH1::AddDirectory(kTRUE);\n\n\n TH1::AddDirectory(kFALSE);\n printf(\"Loading NonTagCorr\\n\");\n TString NonTagFileName=\"alien:\/\/\/alice\/cern.ch\/user\/f\/flherrma\/HaHFECorrel\/NonTagCorrHist.root\";\n TFile *NonTagFile = TFile::Open(NonTagFileName.Data());\n NonTagFile->ls();\n if (NonTagFile) { \n TH1F * NonTagCorr = (TH1F*)NonTagFile->Get(\"NonTagCorr\");\n if (NonTagCorr) taskMB->SetNonTagCorr(*NonTagCorr);\n else printf(\"Could not load NonTagCorr\\n\");\n }\n else printf(\"Could not open NonTag correction file \\n\");\n TH1::AddDirectory(kTRUE);\n\n\n\n\n\n mgr->AddTask(taskMB);\n\n TString containerName1 = mgr->GetCommonFileName();\n containerName1 += \":PWGHF_HaHFECorrel_kINT7_\";\n containerName1 += ID;\n \n TString name1 = \"histMB_\";\n name1 += ID;\n \n TString name2 = \"Main_\";\n name2 += ID;\n TString name3 = \"LP_\";\n name3 += ID;\n TString name4 = \"Hadron_\";\n name4 += ID;\n TString name5 = \"QA_\";\n name5 += ID;\n\n\n AliAnalysisDataContainer *cinput = mgr->GetCommonInputContainer();\n AliAnalysisDataContainer *coutput1 = mgr->CreateContainer(name1.Data(), TList::Class(),AliAnalysisManager::kOutputContainer, containerName1.Data());\n AliAnalysisDataContainer *coutputMain = mgr->CreateContainer(name2.Data(), TList::Class(),AliAnalysisManager::kOutputContainer, containerName1.Data());\n AliAnalysisDataContainer *coutputLP = mgr->CreateContainer(name3.Data(), TList::Class(),AliAnalysisManager::kOutputContainer, containerName1.Data());\n AliAnalysisDataContainer *coutputHa = mgr->CreateContainer(name4.Data(), TList::Class(),AliAnalysisManager::kOutputContainer, containerName1.Data());\n AliAnalysisDataContainer *coutputQA = mgr->CreateContainer(name5.Data(), TList::Class(),AliAnalysisManager::kOutputContainer, containerName1.Data());\n\n mgr->ConnectInput(taskMB, 0, cinput);\n mgr->ConnectOutput(taskMB, 1, coutput1);\n mgr->ConnectOutput(taskMB, 2, coutputMain);\n mgr->ConnectOutput(taskMB, 3, coutputLP);\n mgr->ConnectOutput(taskMB, 4, coutputHa);\n mgr->ConnectOutput(taskMB, 5, coutputQA);\n\n\n\n return NULL;\n}\n<|endoftext|>"} {"text":"<commit_before>#include <boost\/python.hpp>\n#include \"cimage.h\"\n#include \"cproc.h\"\n\n\nusing namespace boost::python;\n\n\nclass CimageWrapper\n : public Cimage\n , public wrapper<Cimage>\n{\npublic:\n CimageWrapper(size_t width, size_t height)\n : Cimage(width, height)\n {\n\n }\n\npublic:\n void info()\n {\n override f = this->get_override(\"info\");\n if (f)\n f();\n else\n Cimage::info();\n }\n};\n\n\nBOOST_PYTHON_MODULE(pymycpp)\n{\n class_<CimageWrapper, boost::noncopyable>(\n \"Cimage\", init<size_t, size_t>())\n .def(\"width\", &CimageWrapper::width)\n .def(\"height\", &CimageWrapper::height)\n .def(\"how_many_bytes\", &CimageWrapper::how_many_bytes)\n .staticmethod(\"how_many_bytes\")\n .def(\"info\", &CimageWrapper::info)\n ;\n\n class_<Cproc, boost::noncopyable>(\n \"Cproc\", init<>())\n .def(\"run\", &Cproc::run)\n ;\n}\n<commit_msg>Issue #1: exposed stop of Cproc to Python<commit_after>#include <boost\/python.hpp>\n#include \"cimage.h\"\n#include \"cproc.h\"\n\n\nusing namespace boost::python;\n\n\nclass CimageWrapper\n : public Cimage\n , public wrapper<Cimage>\n{\npublic:\n CimageWrapper(size_t width, size_t height)\n : Cimage(width, height)\n {\n\n }\n\npublic:\n void info()\n {\n override f = this->get_override(\"info\");\n if (f)\n f();\n else\n Cimage::info();\n }\n};\n\n\nBOOST_PYTHON_MODULE(pymycpp)\n{\n class_<CimageWrapper, boost::noncopyable>(\n \"Cimage\", init<size_t, size_t>())\n .def(\"width\", &CimageWrapper::width)\n .def(\"height\", &CimageWrapper::height)\n .def(\"how_many_bytes\", &CimageWrapper::how_many_bytes)\n .staticmethod(\"how_many_bytes\")\n .def(\"info\", &CimageWrapper::info)\n ;\n\n class_<Cproc, boost::noncopyable>(\n \"Cproc\", init<>())\n .def(\"run\", &Cproc::run)\n .def(\"stop\", &Cproc::stop)\n ;\n}\n<|endoftext|>"} {"text":"<commit_before>\/\/ RUN: %clangxx_asan -O0 %s -o %t\n\/\/ RUN: %env_asan_opts=allocator_may_return_null=0 not %run %t 2>&1 | FileCheck %s\n\/\/ RUN: %env_asan_opts=allocator_may_return_null=1 %run %t 2>&1 | FileCheck %s --check-prefix=CHECK-NULL\n\n#include <stdio.h>\n#include <stdlib.h>\n\nint main() {\n void *p = aligned_alloc(17, 100);\n \/\/ CHECK: ERROR: AddressSanitizer: invalid allocation alignment: 17\n \/\/ CHECK: {{#0 0x.* in .*aligned_alloc}}\n \/\/ CHECK: {{#1 0x.* in main .*aligned_alloc-alignment.cc:}}[[@LINE-3]]\n \/\/ CHECK: SUMMARY: AddressSanitizer: invalid-allocation-alignment\n\n printf(\"pointer after failed aligned_alloc: %zd\\n\", (size_t)p);\n \/\/ CHECK-NULL: pointer after failed aligned_alloc: 0\n\n return 0;\n}\n<commit_msg>[ASan] Add aligned_alloc declaration to aligned_alloc-alignment.cc test.<commit_after>\/\/ RUN: %clangxx_asan -O0 %s -o %t\n\/\/ RUN: %env_asan_opts=allocator_may_return_null=0 not %run %t 2>&1 | FileCheck %s\n\/\/ RUN: %env_asan_opts=allocator_may_return_null=1 %run %t 2>&1 | FileCheck %s --check-prefix=CHECK-NULL\n\n#include <stdio.h>\n#include <stdlib.h>\n\nextern void *aligned_alloc (size_t alignment, size_t size);\n\nint main() {\n void *p = aligned_alloc(17, 100);\n \/\/ CHECK: ERROR: AddressSanitizer: invalid allocation alignment: 17\n \/\/ CHECK: {{#0 0x.* in .*aligned_alloc}}\n \/\/ CHECK: {{#1 0x.* in main .*aligned_alloc-alignment.cc:}}[[@LINE-3]]\n \/\/ CHECK: SUMMARY: AddressSanitizer: invalid-allocation-alignment\n\n printf(\"pointer after failed aligned_alloc: %zd\\n\", (size_t)p);\n \/\/ CHECK-NULL: pointer after failed aligned_alloc: 0\n\n return 0;\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#include <string>\n#include <utility>\n\n#include <boost\/functional\/hash.hpp>\n\n#include <stout\/hashset.hpp>\n\n#include <gtest\/gtest.h>\n\n#include <gmock\/gmock.h>\n\nusing std::string;\n\n\nTEST(HashsetTest, InitializerList)\n{\n hashset<string> set{\"hello\"};\n EXPECT_EQ(1u, set.size());\n\n EXPECT_TRUE((hashset<int>{}.empty()));\n\n hashset<int> set1{1, 3, 5, 7, 11};\n EXPECT_EQ(5u, set1.size());\n EXPECT_TRUE(set1.contains(1));\n EXPECT_TRUE(set1.contains(3));\n EXPECT_TRUE(set1.contains(5));\n EXPECT_TRUE(set1.contains(7));\n EXPECT_TRUE(set1.contains(11));\n\n EXPECT_FALSE(set1.contains(2));\n}\n\n\nTEST(HashsetTest, FromStdSet)\n{\n std::set<int> set1{1, 3, 5, 7};\n\n hashset<int> set2(set1);\n\n EXPECT_EQ(set1.size(), set2.size());\n EXPECT_EQ(4u, set2.size());\n\n foreach (const auto set1_entry, set1) {\n EXPECT_TRUE(set2.contains(set1_entry));\n }\n}\n\n\nTEST(HashsetTest, FromRValueStdSet)\n{\n std::set<int> set1{1, 3};\n\n hashset<int> set2(std::move(set1));\n\n EXPECT_EQ(2u, set2.size());\n\n EXPECT_TRUE(set2.contains(1));\n EXPECT_TRUE(set2.contains(3));\n\n EXPECT_FALSE(set2.contains(2));\n}\n\n\nTEST(HashsetTest, CustomHashAndEqual)\n{\n struct CaseInsensitiveHash\n {\n size_t operator()(const string& key) const\n {\n size_t seed = 0;\n foreach (const char c, key) {\n boost::hash_combine(seed, ::tolower(c));\n }\n return seed;\n }\n };\n\n struct CaseInsensitiveEqual\n {\n bool operator()(const string& left, const string& right) const\n {\n if (left.size() != right.size()) {\n return false;\n }\n for (size_t i = 0; i < left.size(); ++i) {\n if (::tolower(left[i]) != ::tolower(right[i])) {\n return false;\n }\n }\n return true;\n }\n };\n\n hashset<string, CaseInsensitiveHash, CaseInsensitiveEqual> set;\n\n set.insert(\"abc\");\n set.insert(\"def\");\n EXPECT_TRUE(set.contains(\"Abc\"));\n EXPECT_TRUE(set.contains(\"dEf\"));\n\n EXPECT_EQ(2u, set.size());\n set.insert(\"Abc\");\n set.insert(\"DEF\");\n EXPECT_EQ(2u, set.size());\n EXPECT_TRUE(set.contains(\"abc\"));\n EXPECT_TRUE(set.contains(\"def\"));\n}\n\n\nTEST(HashsetTest, Insert)\n{\n hashset<string> hs1;\n hs1.insert(string(\"HS1\"));\n hs1.insert(string(\"HS3\"));\n\n hashset<string> hs2;\n hs2.insert(string(\"HS2\"));\n\n hs1 = hs2;\n ASSERT_EQ(1u, hs1.size());\n ASSERT_TRUE(hs1.contains(\"HS2\"));\n ASSERT_TRUE(hs1 == hs2);\n}\n\n\nTEST(HashsetTest, Union)\n{\n hashset<int> hs1;\n hs1.insert(1);\n hs1.insert(2);\n hs1.insert(3);\n\n hashset<int> hs2;\n hs2.insert(3);\n hs2.insert(4);\n hs2.insert(5);\n\n hashset<int> hs3 = hs1 | hs2;\n\n ASSERT_EQ(5u, hs3.size());\n ASSERT_TRUE(hs3.contains(1));\n ASSERT_TRUE(hs3.contains(2));\n ASSERT_TRUE(hs3.contains(3));\n ASSERT_TRUE(hs3.contains(4));\n ASSERT_TRUE(hs3.contains(5));\n\n hashset<int> hs4 = hs1;\n hs4 |= hs2;\n\n ASSERT_EQ(hs3, hs4);\n}\n<commit_msg>Added test for difference operator of hashset.<commit_after>\/\/ Licensed under the Apache License, Version 2.0 (the \"License\");\n\/\/ you may not use this file except in compliance with the License.\n\/\/ You may obtain a copy of the License at\n\/\/\n\/\/ http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n\/\/\n\/\/ Unless required by applicable law or agreed to in writing, software\n\/\/ distributed under the License is distributed on an \"AS IS\" BASIS,\n\/\/ WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n\/\/ See the License for the specific language governing permissions and\n\/\/ limitations under the License\n\n#include <string>\n#include <utility>\n\n#include <boost\/functional\/hash.hpp>\n\n#include <stout\/hashset.hpp>\n\n#include <gtest\/gtest.h>\n\n#include <gmock\/gmock.h>\n\nusing std::string;\n\n\nTEST(HashsetTest, InitializerList)\n{\n hashset<string> set{\"hello\"};\n EXPECT_EQ(1u, set.size());\n\n EXPECT_TRUE((hashset<int>{}.empty()));\n\n hashset<int> set1{1, 3, 5, 7, 11};\n EXPECT_EQ(5u, set1.size());\n EXPECT_TRUE(set1.contains(1));\n EXPECT_TRUE(set1.contains(3));\n EXPECT_TRUE(set1.contains(5));\n EXPECT_TRUE(set1.contains(7));\n EXPECT_TRUE(set1.contains(11));\n\n EXPECT_FALSE(set1.contains(2));\n}\n\n\nTEST(HashsetTest, FromStdSet)\n{\n std::set<int> set1{1, 3, 5, 7};\n\n hashset<int> set2(set1);\n\n EXPECT_EQ(set1.size(), set2.size());\n EXPECT_EQ(4u, set2.size());\n\n foreach (const auto set1_entry, set1) {\n EXPECT_TRUE(set2.contains(set1_entry));\n }\n}\n\n\nTEST(HashsetTest, FromRValueStdSet)\n{\n std::set<int> set1{1, 3};\n\n hashset<int> set2(std::move(set1));\n\n EXPECT_EQ(2u, set2.size());\n\n EXPECT_TRUE(set2.contains(1));\n EXPECT_TRUE(set2.contains(3));\n\n EXPECT_FALSE(set2.contains(2));\n}\n\n\nTEST(HashsetTest, CustomHashAndEqual)\n{\n struct CaseInsensitiveHash\n {\n size_t operator()(const string& key) const\n {\n size_t seed = 0;\n foreach (const char c, key) {\n boost::hash_combine(seed, ::tolower(c));\n }\n return seed;\n }\n };\n\n struct CaseInsensitiveEqual\n {\n bool operator()(const string& left, const string& right) const\n {\n if (left.size() != right.size()) {\n return false;\n }\n for (size_t i = 0; i < left.size(); ++i) {\n if (::tolower(left[i]) != ::tolower(right[i])) {\n return false;\n }\n }\n return true;\n }\n };\n\n hashset<string, CaseInsensitiveHash, CaseInsensitiveEqual> set;\n\n set.insert(\"abc\");\n set.insert(\"def\");\n EXPECT_TRUE(set.contains(\"Abc\"));\n EXPECT_TRUE(set.contains(\"dEf\"));\n\n EXPECT_EQ(2u, set.size());\n set.insert(\"Abc\");\n set.insert(\"DEF\");\n EXPECT_EQ(2u, set.size());\n EXPECT_TRUE(set.contains(\"abc\"));\n EXPECT_TRUE(set.contains(\"def\"));\n}\n\n\nTEST(HashsetTest, Insert)\n{\n hashset<string> hs1;\n hs1.insert(string(\"HS1\"));\n hs1.insert(string(\"HS3\"));\n\n hashset<string> hs2;\n hs2.insert(string(\"HS2\"));\n\n hs1 = hs2;\n ASSERT_EQ(1u, hs1.size());\n ASSERT_TRUE(hs1.contains(\"HS2\"));\n ASSERT_TRUE(hs1 == hs2);\n}\n\n\nTEST(HashsetTest, Union)\n{\n hashset<int> hs1;\n hs1.insert(1);\n hs1.insert(2);\n hs1.insert(3);\n\n hashset<int> hs2;\n hs2.insert(3);\n hs2.insert(4);\n hs2.insert(5);\n\n hashset<int> hs3 = hs1 | hs2;\n\n ASSERT_EQ(5u, hs3.size());\n ASSERT_TRUE(hs3.contains(1));\n ASSERT_TRUE(hs3.contains(2));\n ASSERT_TRUE(hs3.contains(3));\n ASSERT_TRUE(hs3.contains(4));\n ASSERT_TRUE(hs3.contains(5));\n\n hashset<int> hs4 = hs1;\n hs4 |= hs2;\n\n ASSERT_EQ(hs3, hs4);\n}\n\n\nTEST(HashsetTest, Difference)\n{\n hashset<int> hs1;\n hs1.insert(1);\n hs1.insert(2);\n hs1.insert(3);\n\n hashset<int> hs2;\n hs2.insert(3);\n hs2.insert(4);\n hs2.insert(5);\n\n hashset<int> hs3 = hs1 - hs2;\n\n ASSERT_EQ(2u, hs3.size());\n ASSERT_TRUE(hs3.contains(1));\n ASSERT_TRUE(hs3.contains(2));\n ASSERT_FALSE(hs3.contains(3));\n ASSERT_FALSE(hs3.contains(4));\n ASSERT_FALSE(hs3.contains(5));\n\n hashset<int> hs4 = hs1;\n hs4 -= hs2;\n\n ASSERT_EQ(hs3, hs4);\n}\n<|endoftext|>"} {"text":"<commit_before>\/\/ RUN: %check_clang_tidy %s bugprone-too-small-loop-variable %t\n\nlong size() { return 294967296l; }\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\/ Test cases correctly caught by bugprone-too-small-loop-variable.\n\nvoid voidBadForLoop() {\n for (int i = 0; i < size(); ++i) {\n \/\/ CHECK-MESSAGES: :[[@LINE-1]]:19: warning: loop variable has narrower type 'int' than iteration's upper bound 'long' [bugprone-too-small-loop-variable]\n }\n}\n\nvoid voidBadForLoop2() {\n for (int i = 0; i < size() + 10; ++i) {\n \/\/ CHECK-MESSAGES: :[[@LINE-1]]:19: warning: loop variable has narrower type 'int' than iteration's upper bound 'long' [bugprone-too-small-loop-variable]\n }\n}\n\nvoid voidBadForLoop3() {\n for (int i = 0; i <= size() - 1; ++i) {\n \/\/ CHECK-MESSAGES: :[[@LINE-1]]:19: warning: loop variable has narrower type 'int' than iteration's upper bound 'long' [bugprone-too-small-loop-variable]\n }\n}\n\nvoid voidBadForLoop4() {\n for (int i = 0; size() > i; ++i) {\n \/\/ CHECK-MESSAGES: :[[@LINE-1]]:28: warning: loop variable has narrower type 'int' than iteration's upper bound 'long' [bugprone-too-small-loop-variable]\n }\n}\n\nvoid voidBadForLoop5() {\n for (int i = 0; size() - 1 >= i; ++i) {\n \/\/ CHECK-MESSAGES: :[[@LINE-1]]:33: warning: loop variable has narrower type 'int' than iteration's upper bound 'long' [bugprone-too-small-loop-variable]\n }\n}\n\nvoid voidBadForLoop6() {\n int i = 0;\n for (; i < size(); ++i) {\n \/\/ CHECK-MESSAGES: :[[@LINE-1]]:10: warning: loop variable has narrower type 'int' than iteration's upper bound 'long' [bugprone-too-small-loop-variable]\n }\n}\n\nvoid voidForLoopUnsignedBound() {\n unsigned size = 3147483647;\n for (int i = 0; i < size; ++i) {\n \/\/ CHECK-MESSAGES: :[[@LINE-1]]:19: warning: loop variable has narrower type 'int' than iteration's upper bound 'unsigned int' [bugprone-too-small-loop-variable]\n }\n}\n\n\/\/ The iteration's upper bound has a template dependent value.\ntemplate <long size>\nvoid doSomething() {\n for (short i = 0; i < size; ++i) {\n \/\/ CHECK-MESSAGES: :[[@LINE-1]]:21: warning: loop variable has narrower type 'short' than iteration's upper bound 'long' [bugprone-too-small-loop-variable]\n }\n}\n\n\/\/ The iteration's upper bound has a template dependent type.\ntemplate <class T>\nvoid doSomething() {\n for (T i = 0; i < size(); ++i) {\n \/\/ CHECK-MESSAGES: :[[@LINE-1]]:17: warning: loop variable has narrower type 'short' than iteration's upper bound 'long' [bugprone-too-small-loop-variable]\n }\n}\n\nvoid voidForLoopInstantiation() {\n \/\/ This line does not trigger the warning.\n doSomething<long>();\n \/\/ This one triggers the warning.\n doSomething<short>();\n}\n\n\/\/ A suspicious function used in a macro.\n#define SUSPICIOUS_SIZE (size())\nvoid voidBadForLoopWithMacroBound() {\n for (short i = 0; i < SUSPICIOUS_SIZE; ++i) {\n \/\/ CHECK-MESSAGES: :[[@LINE-1]]:21: warning: loop variable has narrower type 'short' than iteration's upper bound 'long' [bugprone-too-small-loop-variable]\n }\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\/ Correct loops: we should not warn here.\n\n\/\/ A simple use case when both expressions have the same type.\nvoid voidGoodForLoop() {\n for (long i = 0; i < size(); ++i) { \/\/ no warning\n }\n}\n\n\/\/ Other use case where both expressions have the same type,\n\/\/ but short expressions are converted to int by the compare operator.\nvoid voidGoodForLoop2() {\n short loopCond = 10;\n for (short i = 0; i < loopCond; ++i) { \/\/ no warning\n }\n}\n\n\/\/ Because of the integer literal, the iteration's upper bound is int, but we suppress the warning here.\nvoid voidForLoopShortPlusLiteral() {\n short size = 30000;\n for (short i = 0; i <= (size - 1); ++i) { \/\/ no warning\n }\n}\n\n\/\/ Addition of two short variables results in an int value, but we suppress this to avoid false positives.\nvoid voidForLoopShortPlusShort() {\n short size = 256;\n short increment = 14;\n for (short i = 0; i < size + increment; ++i) { \/\/ no warning\n }\n}\n\n\/\/ In this test case we have different integer types, but here the loop variable has the bigger type.\n\/\/ The iteration's bound is cast implicitly, not the loop variable.\nvoid voidForLoopBoundImplicitCast() {\n short start = 256;\n short end = 14;\n for (int i = start; i >= end; --i) { \/\/ no warning\n }\n}\n\n\/\/ Range based loop and other iterator based loops are ignored by this check.\nvoid voidRangeBasedForLoop() {\n int array[] = {1, 2, 3, 4, 5};\n for (const int &i : array) { \/\/ no warning\n }\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\/ Future possibilites to improve the check.\n\n\/\/ False positive: because of the int literal, iteration's upper bound has int type.\nvoid voidForLoopFalsePositive() {\n short size = 30000;\n bool cond = false;\n for (short i = 0; i < (cond ? 0 : size); ++i) {\n \/\/ CHECK-MESSAGES: :[[@LINE-1]]:21: warning: loop variable has narrower type 'short' than iteration's upper bound 'int' [bugprone-too-small-loop-variable]\n }\n}\n\nvoid voidForLoopFalsePositive2() {\n short size = 30000;\n bool cond = false;\n for (short i = 0; i < (!cond ? size : 0); ++i) {\n \/\/ CHECK-MESSAGES: :[[@LINE-1]]:21: warning: loop variable has narrower type 'short' than iteration's upper bound 'int' [bugprone-too-small-loop-variable]\n }\n}\n\n\/\/ False positive: The loop bound expression contains nested binary operators.\nvoid voidForLoopFalsePositive3() {\n short number = 30000;\n for (short i = 0; i < ((number & 0x7f) + 1); ++i) {\n \/\/ CHECK-MESSAGES: :[[@LINE-1]]:21: warning: loop variable has narrower type 'short' than iteration's upper bound 'int' [bugprone-too-small-loop-variable]\n }\n}\n\n\/\/ TODO: handle while loop.\nvoid voidBadWhileLoop() {\n short i = 0;\n while (i < size()) { \/\/ missing warning\n ++i;\n }\n}\n\n\/\/ TODO: handle do-while loop.\nvoid voidBadDoWhileLoop() {\n short i = 0;\n do {\n ++i;\n } while (i < size()); \/\/ missing warning\n}\n\n\/\/ TODO: handle complex loop conditions.\nvoid voidComplexForCond() {\n bool additionalCond = true;\n for (int i = 0; i < size() && additionalCond; ++i) { \/\/ missing warning\n }\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\/ Suspicious test cases ingored by this check.\n\n\/\/ Test case with a reverse iteration.\n\/\/ This is caught by -Wimplicit-int-conversion.\nvoid voidReverseForLoop() {\n for (short i = size() - 1; i >= 0; --i) { \/\/ no warning\n }\n}\n\n\/\/ Macro defined literals are used inside the loop condition.\n#define SIZE 125\n#define SIZE2 (SIZE + 1)\nvoid voidForLoopWithMacroBound() {\n for (short i = 0; i < SIZE2; ++i) { \/\/ no warning\n }\n}\n\n\/\/ A suspicious loop is not caught if the iteration's upper bound is a literal.\nvoid voidForLoopWithLiteralBound() {\n for (short i = 0; i < 125; ++i) { \/\/ no warning\n }\n}\n\n\/\/ The used literal leads to an infinite loop.\n\/\/ This is caught by -Wtautological-constant-out-of-range-compare.\nvoid voidForLoopWithBigLiteralBound() {\n for (short i = 0; i < 294967296l; ++i) { \/\/ no warning\n }\n}\n\nenum eSizeType {\n START,\n Y,\n END\n};\n\n\/\/ A suspicious loop is not caught if the iteration's upper bound is an enum value.\nvoid voidForLoopWithEnumBound() {\n for (short i = eSizeType::START; i < eSizeType::END; ++i) { \/\/ no warning\n }\n}\n\nenum eSizeType2 : long {\n START2 = 294967296l,\n Y2,\n END2\n};\n\n\/\/ The used enum value leads to an infinite loop.\n\/\/ This is caught by -Wtautological-constant-out-of-range-compare.\nvoid voidForLoopWithBigEnumBound() {\n for (short i = eSizeType2::START2; i < eSizeType2::END2; ++i) { \/\/ no warning\n }\n}\n\n\/\/ A suspicious loop is not caught if the iteration's upper bound is a constant variable.\nvoid voidForLoopWithConstBound() {\n const long size = 252l;\n for (short i = 0; i < size; ++i) { \/\/ no warning\n }\n}\n\n\/\/ The used constant variable leads to an infinite loop.\n\/\/ This is caught by -Wtautological-constant-out-of-range-compare.\nvoid voidForLoopWithBigConstBound() {\n const long size = 294967296l;\n for (short i = 0; i < size; ++i) { \/\/ no warning\n }\n}\n<commit_msg>[clang-tidy] fix ARM tests, because int and long have same width<commit_after>\/\/ RUN: %check_clang_tidy %s bugprone-too-small-loop-variable %t -- -- --target=x86_64-linux\n\nlong size() { return 294967296l; }\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\/ Test cases correctly caught by bugprone-too-small-loop-variable.\n\nvoid voidBadForLoop() {\n for (int i = 0; i < size(); ++i) {\n \/\/ CHECK-MESSAGES: :[[@LINE-1]]:19: warning: loop variable has narrower type 'int' than iteration's upper bound 'long' [bugprone-too-small-loop-variable]\n }\n}\n\nvoid voidBadForLoop2() {\n for (int i = 0; i < size() + 10; ++i) {\n \/\/ CHECK-MESSAGES: :[[@LINE-1]]:19: warning: loop variable has narrower type 'int' than iteration's upper bound 'long' [bugprone-too-small-loop-variable]\n }\n}\n\nvoid voidBadForLoop3() {\n for (int i = 0; i <= size() - 1; ++i) {\n \/\/ CHECK-MESSAGES: :[[@LINE-1]]:19: warning: loop variable has narrower type 'int' than iteration's upper bound 'long' [bugprone-too-small-loop-variable]\n }\n}\n\nvoid voidBadForLoop4() {\n for (int i = 0; size() > i; ++i) {\n \/\/ CHECK-MESSAGES: :[[@LINE-1]]:28: warning: loop variable has narrower type 'int' than iteration's upper bound 'long' [bugprone-too-small-loop-variable]\n }\n}\n\nvoid voidBadForLoop5() {\n for (int i = 0; size() - 1 >= i; ++i) {\n \/\/ CHECK-MESSAGES: :[[@LINE-1]]:33: warning: loop variable has narrower type 'int' than iteration's upper bound 'long' [bugprone-too-small-loop-variable]\n }\n}\n\nvoid voidBadForLoop6() {\n int i = 0;\n for (; i < size(); ++i) {\n \/\/ CHECK-MESSAGES: :[[@LINE-1]]:10: warning: loop variable has narrower type 'int' than iteration's upper bound 'long' [bugprone-too-small-loop-variable]\n }\n}\n\nvoid voidForLoopUnsignedBound() {\n unsigned size = 3147483647;\n for (int i = 0; i < size; ++i) {\n \/\/ CHECK-MESSAGES: :[[@LINE-1]]:19: warning: loop variable has narrower type 'int' than iteration's upper bound 'unsigned int' [bugprone-too-small-loop-variable]\n }\n}\n\n\/\/ The iteration's upper bound has a template dependent value.\ntemplate <long size>\nvoid doSomething() {\n for (short i = 0; i < size; ++i) {\n \/\/ CHECK-MESSAGES: :[[@LINE-1]]:21: warning: loop variable has narrower type 'short' than iteration's upper bound 'long' [bugprone-too-small-loop-variable]\n }\n}\n\n\/\/ The iteration's upper bound has a template dependent type.\ntemplate <class T>\nvoid doSomething() {\n for (T i = 0; i < size(); ++i) {\n \/\/ CHECK-MESSAGES: :[[@LINE-1]]:17: warning: loop variable has narrower type 'short' than iteration's upper bound 'long' [bugprone-too-small-loop-variable]\n }\n}\n\nvoid voidForLoopInstantiation() {\n \/\/ This line does not trigger the warning.\n doSomething<long>();\n \/\/ This one triggers the warning.\n doSomething<short>();\n}\n\n\/\/ A suspicious function used in a macro.\n#define SUSPICIOUS_SIZE (size())\nvoid voidBadForLoopWithMacroBound() {\n for (short i = 0; i < SUSPICIOUS_SIZE; ++i) {\n \/\/ CHECK-MESSAGES: :[[@LINE-1]]:21: warning: loop variable has narrower type 'short' than iteration's upper bound 'long' [bugprone-too-small-loop-variable]\n }\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\/ Correct loops: we should not warn here.\n\n\/\/ A simple use case when both expressions have the same type.\nvoid voidGoodForLoop() {\n for (long i = 0; i < size(); ++i) { \/\/ no warning\n }\n}\n\n\/\/ Other use case where both expressions have the same type,\n\/\/ but short expressions are converted to int by the compare operator.\nvoid voidGoodForLoop2() {\n short loopCond = 10;\n for (short i = 0; i < loopCond; ++i) { \/\/ no warning\n }\n}\n\n\/\/ Because of the integer literal, the iteration's upper bound is int, but we suppress the warning here.\nvoid voidForLoopShortPlusLiteral() {\n short size = 30000;\n for (short i = 0; i <= (size - 1); ++i) { \/\/ no warning\n }\n}\n\n\/\/ Addition of two short variables results in an int value, but we suppress this to avoid false positives.\nvoid voidForLoopShortPlusShort() {\n short size = 256;\n short increment = 14;\n for (short i = 0; i < size + increment; ++i) { \/\/ no warning\n }\n}\n\n\/\/ In this test case we have different integer types, but here the loop variable has the bigger type.\n\/\/ The iteration's bound is cast implicitly, not the loop variable.\nvoid voidForLoopBoundImplicitCast() {\n short start = 256;\n short end = 14;\n for (int i = start; i >= end; --i) { \/\/ no warning\n }\n}\n\n\/\/ Range based loop and other iterator based loops are ignored by this check.\nvoid voidRangeBasedForLoop() {\n int array[] = {1, 2, 3, 4, 5};\n for (const int &i : array) { \/\/ no warning\n }\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\/ Future possibilites to improve the check.\n\n\/\/ False positive: because of the int literal, iteration's upper bound has int type.\nvoid voidForLoopFalsePositive() {\n short size = 30000;\n bool cond = false;\n for (short i = 0; i < (cond ? 0 : size); ++i) {\n \/\/ CHECK-MESSAGES: :[[@LINE-1]]:21: warning: loop variable has narrower type 'short' than iteration's upper bound 'int' [bugprone-too-small-loop-variable]\n }\n}\n\nvoid voidForLoopFalsePositive2() {\n short size = 30000;\n bool cond = false;\n for (short i = 0; i < (!cond ? size : 0); ++i) {\n \/\/ CHECK-MESSAGES: :[[@LINE-1]]:21: warning: loop variable has narrower type 'short' than iteration's upper bound 'int' [bugprone-too-small-loop-variable]\n }\n}\n\n\/\/ False positive: The loop bound expression contains nested binary operators.\nvoid voidForLoopFalsePositive3() {\n short number = 30000;\n for (short i = 0; i < ((number & 0x7f) + 1); ++i) {\n \/\/ CHECK-MESSAGES: :[[@LINE-1]]:21: warning: loop variable has narrower type 'short' than iteration's upper bound 'int' [bugprone-too-small-loop-variable]\n }\n}\n\n\/\/ TODO: handle while loop.\nvoid voidBadWhileLoop() {\n short i = 0;\n while (i < size()) { \/\/ missing warning\n ++i;\n }\n}\n\n\/\/ TODO: handle do-while loop.\nvoid voidBadDoWhileLoop() {\n short i = 0;\n do {\n ++i;\n } while (i < size()); \/\/ missing warning\n}\n\n\/\/ TODO: handle complex loop conditions.\nvoid voidComplexForCond() {\n bool additionalCond = true;\n for (int i = 0; i < size() && additionalCond; ++i) { \/\/ missing warning\n }\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\/ Suspicious test cases ingored by this check.\n\n\/\/ Test case with a reverse iteration.\n\/\/ This is caught by -Wimplicit-int-conversion.\nvoid voidReverseForLoop() {\n for (short i = size() - 1; i >= 0; --i) { \/\/ no warning\n }\n}\n\n\/\/ Macro defined literals are used inside the loop condition.\n#define SIZE 125\n#define SIZE2 (SIZE + 1)\nvoid voidForLoopWithMacroBound() {\n for (short i = 0; i < SIZE2; ++i) { \/\/ no warning\n }\n}\n\n\/\/ A suspicious loop is not caught if the iteration's upper bound is a literal.\nvoid voidForLoopWithLiteralBound() {\n for (short i = 0; i < 125; ++i) { \/\/ no warning\n }\n}\n\n\/\/ The used literal leads to an infinite loop.\n\/\/ This is caught by -Wtautological-constant-out-of-range-compare.\nvoid voidForLoopWithBigLiteralBound() {\n for (short i = 0; i < 294967296l; ++i) { \/\/ no warning\n }\n}\n\nenum eSizeType {\n START,\n Y,\n END\n};\n\n\/\/ A suspicious loop is not caught if the iteration's upper bound is an enum value.\nvoid voidForLoopWithEnumBound() {\n for (short i = eSizeType::START; i < eSizeType::END; ++i) { \/\/ no warning\n }\n}\n\nenum eSizeType2 : long {\n START2 = 294967296l,\n Y2,\n END2\n};\n\n\/\/ The used enum value leads to an infinite loop.\n\/\/ This is caught by -Wtautological-constant-out-of-range-compare.\nvoid voidForLoopWithBigEnumBound() {\n for (short i = eSizeType2::START2; i < eSizeType2::END2; ++i) { \/\/ no warning\n }\n}\n\n\/\/ A suspicious loop is not caught if the iteration's upper bound is a constant variable.\nvoid voidForLoopWithConstBound() {\n const long size = 252l;\n for (short i = 0; i < size; ++i) { \/\/ no warning\n }\n}\n\n\/\/ The used constant variable leads to an infinite loop.\n\/\/ This is caught by -Wtautological-constant-out-of-range-compare.\nvoid voidForLoopWithBigConstBound() {\n const long size = 294967296l;\n for (short i = 0; i < size; ++i) { \/\/ no warning\n }\n}\n<|endoftext|>"} {"text":"<commit_before>\/*\r\nThis file is part of HadesMem.\r\nCopyright (C) 2011 Joshua Boyce (a.k.a. RaptorFactor).\r\n<http:\/\/www.raptorfactor.com\/> <raptorfactor@raptorfactor.com>\r\n\r\nHadesMem is free software: you can redistribute it and\/or modify\r\nit under the terms of the GNU General Public License as published by\r\nthe Free Software Foundation, either version 3 of the License, or\r\n(at your option) any later version.\r\n\r\nHadesMem is distributed in the hope that it will be useful,\r\nbut WITHOUT ANY WARRANTY; without even the implied warranty of\r\nMERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the\r\nGNU General Public License for more details.\r\n\r\nYou should have received a copy of the GNU General Public License\r\nalong with HadesMem. If not, see <http:\/\/www.gnu.org\/licenses\/>.\r\n*\/\r\n\r\n\/\/ Hades\r\n#include <HadesMemory\/Injector.hpp>\r\n#include <HadesMemory\/Module.hpp>\r\n#include <HadesMemory\/MemoryMgr.hpp>\r\n#include <HadesCommon\/Filesystem.hpp>\r\n#include <HadesCommon\/EnsureCleanup.hpp>\r\n\r\n\/\/ Windows API\r\n#include <Windows.h>\r\n\r\n\/\/ C++ Standard Library\r\n#include <algorithm>\r\n\r\n\/\/ Boost\r\n#include <boost\/algorithm\/string.hpp>\r\n\r\n\/\/ AsmJit\r\n#ifdef HADES_MSVC\r\n#pragma warning(push, 1)\r\n#endif\r\n#ifdef HADES_GCC\r\n#pragma GCC diagnostic push\r\n#pragma GCC diagnostic ignored \"-pedantic\"\r\n#pragma GCC diagnostic ignored \"-Wattributes\"\r\n#pragma GCC diagnostic ignored \"-Wparentheses\"\r\n#pragma GCC diagnostic ignored \"-Wunused-parameter\"\r\n#endif\r\n#include <AsmJit\/AsmJit.h>\r\n#ifdef HADES_MSVC\r\n#pragma warning(pop)\r\n#endif\r\n#ifdef HADES_GCC\r\n#pragma GCC diagnostic pop\r\n#endif\r\n\r\nnamespace Hades\r\n{\r\n namespace Memory\r\n {\r\n \/\/ This routine appends the given argument to a command line such\r\n \/\/ that CommandLineToArgvW will return the argument string unchanged.\r\n \/\/ Arguments in a command line should be separated by spaces; this\r\n \/\/ function does not add these spaces.\r\n void ArgvQuote(const std::wstring& Argument, std::wstring& CommandLine, \r\n bool Force) \r\n {\r\n \/\/ Unless we're told otherwise, don't quote unless we actually\r\n \/\/ need to do so --- hopefully avoid problems if programs won't\r\n \/\/ parse quotes properly\r\n if (!Force && !Argument.empty () && Argument.find_first_of(L\" \\t\\n\\v\\\"\") \r\n == Argument.npos)\r\n {\r\n CommandLine.append(Argument);\r\n }\r\n else \r\n {\r\n CommandLine.push_back(L'\"');\r\n \r\n for (auto It = Argument.begin(); ;++It)\r\n {\r\n unsigned NumberBackslashes = 0;\r\n \r\n while (It != Argument.end () && *It == L'\\\\') \r\n {\r\n ++It;\r\n ++NumberBackslashes;\r\n }\r\n \r\n if (It == Argument.end ())\r\n {\r\n \/\/ Escape all backslashes, but let the terminating\r\n \/\/ double quotation mark we add below be interpreted\r\n \/\/ as a metacharacter.\r\n CommandLine.append(NumberBackslashes * 2, L'\\\\');\r\n break;\r\n }\r\n else if (*It == L'\"')\r\n {\r\n \/\/ Escape all backslashes and the following\r\n \/\/ double quotation mark.\r\n CommandLine.append(NumberBackslashes * 2 + 1, L'\\\\');\r\n CommandLine.push_back(*It);\r\n }\r\n else\r\n {\r\n \/\/ Backslashes aren't special here.\r\n CommandLine.append(NumberBackslashes, L'\\\\');\r\n CommandLine.push_back(*It);\r\n }\r\n }\r\n \r\n CommandLine.push_back(L'\"');\r\n }\r\n }\r\n\r\n \/\/ Create process (as suspended) and inject DLL\r\n CreateAndInjectData CreateAndInject(\r\n boost::filesystem::path const& Path, \r\n boost::filesystem::path const& WorkDir, \r\n std::vector<std::wstring> const& Args, \r\n boost::filesystem::path const& Module, \r\n std::string const& Export, \r\n Injector::InjectFlags Flags)\r\n {\r\n \/\/ Set up args for CreateProcess\r\n STARTUPINFO StartInfo;\r\n ZeroMemory(&StartInfo, sizeof(StartInfo));\r\n StartInfo.cb = sizeof(StartInfo);\r\n PROCESS_INFORMATION ProcInfo;\r\n ZeroMemory(&ProcInfo, sizeof(ProcInfo));\r\n\r\n \/\/ Construct command line.\r\n std::wstring CommandLine;\r\n ArgvQuote(Path.native(), CommandLine, false);\r\n std::for_each(Args.begin(), Args.end(), \r\n [&] (std::wstring const& Arg) \r\n {\r\n CommandLine += L' ';\r\n ArgvQuote(Arg, CommandLine, false);\r\n });\r\n \r\n \/\/ Copy command line to buffer\r\n std::vector<wchar_t> ProcArgs(CommandLine.cbegin(), CommandLine.cend());\r\n ProcArgs.push_back(L'\\0');\r\n \r\n \/\/ Set working directory\r\n boost::filesystem::path WorkDirReal;\r\n if (!WorkDir.empty())\r\n {\r\n WorkDirReal = WorkDir;\r\n }\r\n else if (Path.has_parent_path())\r\n {\r\n WorkDirReal = Path.parent_path();\r\n }\r\n else\r\n {\r\n WorkDirReal = L\".\/\";\r\n }\r\n\r\n \/\/ Attempt process creation\r\n if (!CreateProcess(Path.c_str(), ProcArgs.data(), nullptr, nullptr, FALSE, \r\n CREATE_SUSPENDED, nullptr, WorkDirReal.c_str(), &StartInfo, &ProcInfo))\r\n {\r\n DWORD const LastError = GetLastError();\r\n BOOST_THROW_EXCEPTION(Injector::Error() << \r\n ErrorFunction(\"CreateAndInject\") << \r\n ErrorString(\"Could not create process.\") << \r\n ErrorCodeWinLast(LastError));\r\n }\r\n\r\n \/\/ Ensure cleanup\r\n Windows::EnsureCloseHandle const ProcHandle(ProcInfo.hProcess);\r\n Windows::EnsureCloseHandle const ThreadHandle(ProcInfo.hThread);\r\n\r\n try\r\n {\r\n \/\/ Memory manager instance\r\n MemoryMgr const MyMemory(ProcInfo.dwProcessId);\r\n \r\n \/\/ Create Assembler.\r\n \/\/ This is used to generate a 'nullsub' function, which is called in \r\n \/\/ the context of the remote process in order to 'force' a call to \r\n \/\/ ntdll.dll!LdrInitializeThunk. This is necessary because module \r\n \/\/ enumeration will fail if LdrInitializeThunk has not been called, \r\n \/\/ and Injector::InjectDll (and the APIs it uses) depend on the \r\n \/\/ module enumeration APIs.\r\n AsmJit::Assembler MyJitFunc;\r\n\r\n#if defined(_M_AMD64) \r\n \/\/ Return\r\n MyJitFunc.ret();\r\n#elif defined(_M_IX86) \r\n \/\/ Return\r\n MyJitFunc.ret(AsmJit::Imm(0x4));\r\n#else \r\n#error \"[HadesMem] Unsupported architecture.\"\r\n#endif\r\n\r\n \/\/ Get stub size\r\n DWORD_PTR const StubSize = MyJitFunc.getCodeSize();\r\n \r\n \/\/ Allocate memory for stub buffer\r\n AllocAndFree const StubMemRemote(MyMemory, StubSize);\r\n PBYTE pRemoteStub = static_cast<PBYTE>(StubMemRemote.GetBase());\r\n DWORD_PTR pRemoteStubTemp = reinterpret_cast<DWORD_PTR>(pRemoteStub);\r\n \r\n \/\/ Create buffer to hold relocated code plus the return value address\r\n std::vector<BYTE> CodeReal(StubSize);\r\n \r\n \/\/ Generate code\r\n MyJitFunc.relocCode(CodeReal.data(), reinterpret_cast<DWORD_PTR>(\r\n pRemoteStub));\r\n \r\n \/\/ Write stub buffer to process\r\n MyMemory.Write(pRemoteStub, CodeReal);\r\n \r\n \/\/ Call stub via creating a remote thread in the target.\r\n Windows::EnsureCloseHandle const MyThread(CreateRemoteThread(\r\n MyMemory.GetProcessHandle(), nullptr, 0, \r\n reinterpret_cast<LPTHREAD_START_ROUTINE>(pRemoteStubTemp), nullptr, \r\n 0, nullptr));\r\n if (!MyThread)\r\n {\r\n DWORD const LastError = GetLastError();\r\n BOOST_THROW_EXCEPTION(Injector::Error() << \r\n ErrorFunction(\"CreateAndInject\") << \r\n ErrorString(\"Could not create remote thread.\") << \r\n ErrorCodeWinLast(LastError));\r\n }\r\n \r\n \/\/ Wait for the remote thread to terminate\r\n if (WaitForSingleObject(MyThread, INFINITE) != WAIT_OBJECT_0)\r\n {\r\n DWORD const LastError = GetLastError();\r\n BOOST_THROW_EXCEPTION(Injector::Error() << \r\n ErrorFunction(\"CreateAndInject\") << \r\n ErrorString(\"Could not wait for remote thread.\") << \r\n ErrorCodeWinLast(LastError));\r\n }\r\n\r\n \/\/ Create DLL injector\r\n Injector const MyInjector(MyMemory);\r\n\r\n \/\/ Inject DLL\r\n HMODULE const ModBase = MyInjector.InjectDll(Module, Flags);\r\n\r\n \/\/ Call export if one has been specified\r\n MemoryMgr::RemoteFunctionRet ExpRetData;\r\n if (!Export.empty())\r\n {\r\n ExpRetData = MyInjector.CallExport(Module, ModBase, Export);\r\n }\r\n\r\n \/\/ Success! Let the process continue execution.\r\n if (ResumeThread(ProcInfo.hThread) == static_cast<DWORD>(-1))\r\n {\r\n DWORD const LastError = GetLastError();\r\n BOOST_THROW_EXCEPTION(Injector::Error() << \r\n ErrorFunction(\"CreateAndInject\") << \r\n ErrorString(\"Could not resume process.\") << \r\n ErrorCodeWinLast(LastError) << \r\n ErrorCodeWinRet(ExpRetData.GetReturnValue()) << \r\n ErrorCodeWinOther(ExpRetData.GetLastError()));\r\n }\r\n\r\n \/\/ Return data to caller\r\n return CreateAndInjectData(MyMemory, ModBase, \r\n ExpRetData.GetReturnValue(), ExpRetData.GetLastError());\r\n }\r\n \/\/ Catch exceptions\r\n catch (std::exception const& \/*e*\/)\r\n {\r\n \/\/ Terminate process if injection failed\r\n TerminateProcess(ProcInfo.hProcess, 0);\r\n\r\n \/\/ Rethrow exception\r\n throw;\r\n }\r\n }\r\n\r\n \/\/ Constructor\r\n Injector::Injector(MemoryMgr const& MyMemory) \r\n : m_Memory(MyMemory)\r\n { }\r\n\r\n \/\/ Inject DLL\r\n HMODULE Injector::InjectDll(boost::filesystem::path const& Path, \r\n InjectFlags Flags) const\r\n {\r\n \/\/ Do not continue if Shim Engine is enabled for local process, \r\n \/\/ otherwise it could interfere with the address resolution.\r\n HMODULE const ShimEngMod = GetModuleHandle(L\"ShimEng.dll\");\r\n if (ShimEngMod)\r\n {\r\n BOOST_THROW_EXCEPTION(Error() << \r\n ErrorFunction(\"Injector::InjectDll\") << \r\n ErrorString(\"Shims enabled for local process.\"));\r\n }\r\n \r\n \/\/ String to hold 'real' path to module\r\n boost::filesystem::path PathReal(Path);\r\n \r\n \/\/ Check if path resolution was requested\r\n bool PathResolution = ((Flags & InjectFlag_PathResolution) == \r\n InjectFlag_PathResolution);\r\n\r\n \/\/ Check whether we need to convert the path from a relative to \r\n \/\/ an absolute\r\n if (PathResolution && PathReal.is_relative())\r\n {\r\n \/\/ Convert relative path to absolute path\r\n PathReal = boost::filesystem::absolute(PathReal, Hades::Windows::\r\n GetSelfDirPath());\r\n }\r\n\r\n \/\/ Convert path to preferred format\r\n PathReal.make_preferred();\r\n\r\n \/\/ Ensure target file exists\r\n \/\/ Note: Only performing this check when path resolution is enabled, \r\n \/\/ because otherwise we would need to perform the check in the context \r\n \/\/ of the remote process, which is not possible to do without \r\n \/\/ introducing race conditions and other potential problems. So we just \r\n \/\/ let LoadLibraryW do the check for us.\r\n if (PathResolution && !boost::filesystem::exists(PathReal))\r\n {\r\n BOOST_THROW_EXCEPTION(Error() << \r\n ErrorFunction(\"Injector::InjectDll\") << \r\n ErrorString(\"Could not find module file.\"));\r\n }\r\n\r\n \/\/ Get path as string\r\n std::wstring const PathString(PathReal.native());\r\n\r\n \/\/ Calculate the number of bytes needed for the DLL's pathname\r\n std::size_t const PathBufSize = (PathString.size() + 1) * \r\n sizeof(wchar_t);\r\n\r\n \/\/ Allocate space in the remote process for the pathname\r\n AllocAndFree const LibFileRemote(m_Memory, PathBufSize);\r\n\r\n \/\/ Copy the DLL's pathname to the remote process' address space\r\n m_Memory.Write(LibFileRemote.GetBase(), PathString);\r\n \r\n \/\/ Get address of LoadLibraryW in Kernel32.dll\r\n Module Kernel32Mod(m_Memory, L\"kernel32.dll\");\r\n FARPROC const pLoadLibraryW = m_Memory.GetRemoteProcAddress(\r\n Kernel32Mod.GetBase(), \"kernel32.dll\", \"LoadLibraryW\");\r\n DWORD_PTR pLoadLibraryWTemp = reinterpret_cast<DWORD_PTR>(pLoadLibraryW);\r\n\r\n \/\/ Load module in remote process using LoadLibraryW\r\n std::vector<PVOID> Args;\r\n Args.push_back(LibFileRemote.GetBase());\r\n MemoryMgr::RemoteFunctionRet RemoteRet = m_Memory.Call(\r\n reinterpret_cast<PVOID>(pLoadLibraryWTemp), \r\n MemoryMgr::CallConv_Default, Args);\r\n if (!RemoteRet.GetReturnValue())\r\n {\r\n BOOST_THROW_EXCEPTION(Error() << \r\n ErrorFunction(\"Injector::InjectDll\") << \r\n ErrorString(\"Call to LoadLibraryW in remote process failed.\") << \r\n ErrorCodeWinLast(RemoteRet.GetLastError()));\r\n }\r\n \r\n \/\/ Look for target module\r\n Module NewModule(m_Memory, reinterpret_cast<HMODULE>(\r\n RemoteRet.GetReturnValue()));\r\n\r\n \/\/ Return module base\r\n return NewModule.GetBase();\r\n }\r\n\r\n \/\/ Free DLL\r\n void Injector::FreeDll(HMODULE ModuleRemote) const\r\n {\r\n \/\/ Get address of FreeLibrary in Kernel32.dll\r\n Module Kernel32Mod(m_Memory, L\"kernel32.dll\");\r\n FARPROC const pFreeLibrary = m_Memory.GetRemoteProcAddress(\r\n Kernel32Mod.GetBase(), \"kernel32.dll\", \"FreeLibrary\");\r\n DWORD_PTR pFreeLibraryTemp = reinterpret_cast<DWORD_PTR>(pFreeLibrary);\r\n\r\n \/\/ Free module in remote process using FreeLibrary\r\n std::vector<PVOID> Args;\r\n Args.push_back(reinterpret_cast<PVOID>(ModuleRemote));\r\n MemoryMgr::RemoteFunctionRet RemoteRet = m_Memory.Call(\r\n reinterpret_cast<PVOID>(pFreeLibraryTemp), \r\n MemoryMgr::CallConv_Default, Args);\r\n if (!RemoteRet.GetReturnValue())\r\n {\r\n BOOST_THROW_EXCEPTION(Error() << \r\n ErrorFunction(\"Injector::FreeDll\") << \r\n ErrorString(\"Call to FreeLibrary in remote process failed.\") << \r\n ErrorCodeWinLast(RemoteRet.GetLastError()));\r\n }\r\n }\r\n\r\n \/\/ Call export\r\n MemoryMgr::RemoteFunctionRet Injector::CallExport(\r\n boost::filesystem::path const& ModulePath, \r\n HMODULE ModuleRemote, std::string const& Export) const\r\n {\r\n \/\/ Get export address\r\n FARPROC const pExportAddr = m_Memory.GetRemoteProcAddress(ModuleRemote, \r\n ModulePath, Export);\r\n DWORD_PTR const pExportAddrTemp = reinterpret_cast<DWORD_PTR>(\r\n pExportAddr);\r\n\r\n \/\/ Create a remote thread that calls the desired export\r\n std::vector<PVOID> ExportArgs;\r\n ExportArgs.push_back(ModuleRemote);\r\n return m_Memory.Call(reinterpret_cast<PVOID>(pExportAddrTemp), \r\n MemoryMgr::CallConv_Default, ExportArgs);\r\n }\r\n }\r\n}\r\n<commit_msg>* [Injector] Simplify InjectDll a little bit. (No longer need to do module enum because MemoryMgr::Call returns a 64-bit value on x64)<commit_after>\/*\r\nThis file is part of HadesMem.\r\nCopyright (C) 2011 Joshua Boyce (a.k.a. RaptorFactor).\r\n<http:\/\/www.raptorfactor.com\/> <raptorfactor@raptorfactor.com>\r\n\r\nHadesMem is free software: you can redistribute it and\/or modify\r\nit under the terms of the GNU General Public License as published by\r\nthe Free Software Foundation, either version 3 of the License, or\r\n(at your option) any later version.\r\n\r\nHadesMem is distributed in the hope that it will be useful,\r\nbut WITHOUT ANY WARRANTY; without even the implied warranty of\r\nMERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the\r\nGNU General Public License for more details.\r\n\r\nYou should have received a copy of the GNU General Public License\r\nalong with HadesMem. If not, see <http:\/\/www.gnu.org\/licenses\/>.\r\n*\/\r\n\r\n\/\/ Hades\r\n#include <HadesMemory\/Injector.hpp>\r\n#include <HadesMemory\/Module.hpp>\r\n#include <HadesMemory\/MemoryMgr.hpp>\r\n#include <HadesCommon\/Filesystem.hpp>\r\n#include <HadesCommon\/EnsureCleanup.hpp>\r\n\r\n\/\/ Windows API\r\n#include <Windows.h>\r\n\r\n\/\/ C++ Standard Library\r\n#include <algorithm>\r\n\r\n\/\/ Boost\r\n#include <boost\/algorithm\/string.hpp>\r\n\r\n\/\/ AsmJit\r\n#ifdef HADES_MSVC\r\n#pragma warning(push, 1)\r\n#endif\r\n#ifdef HADES_GCC\r\n#pragma GCC diagnostic push\r\n#pragma GCC diagnostic ignored \"-pedantic\"\r\n#pragma GCC diagnostic ignored \"-Wattributes\"\r\n#pragma GCC diagnostic ignored \"-Wparentheses\"\r\n#pragma GCC diagnostic ignored \"-Wunused-parameter\"\r\n#endif\r\n#include <AsmJit\/AsmJit.h>\r\n#ifdef HADES_MSVC\r\n#pragma warning(pop)\r\n#endif\r\n#ifdef HADES_GCC\r\n#pragma GCC diagnostic pop\r\n#endif\r\n\r\nnamespace Hades\r\n{\r\n namespace Memory\r\n {\r\n \/\/ This routine appends the given argument to a command line such\r\n \/\/ that CommandLineToArgvW will return the argument string unchanged.\r\n \/\/ Arguments in a command line should be separated by spaces; this\r\n \/\/ function does not add these spaces.\r\n void ArgvQuote(const std::wstring& Argument, std::wstring& CommandLine, \r\n bool Force) \r\n {\r\n \/\/ Unless we're told otherwise, don't quote unless we actually\r\n \/\/ need to do so --- hopefully avoid problems if programs won't\r\n \/\/ parse quotes properly\r\n if (!Force && !Argument.empty () && Argument.find_first_of(L\" \\t\\n\\v\\\"\") \r\n == Argument.npos)\r\n {\r\n CommandLine.append(Argument);\r\n }\r\n else \r\n {\r\n CommandLine.push_back(L'\"');\r\n \r\n for (auto It = Argument.begin(); ;++It)\r\n {\r\n unsigned NumberBackslashes = 0;\r\n \r\n while (It != Argument.end () && *It == L'\\\\') \r\n {\r\n ++It;\r\n ++NumberBackslashes;\r\n }\r\n \r\n if (It == Argument.end ())\r\n {\r\n \/\/ Escape all backslashes, but let the terminating\r\n \/\/ double quotation mark we add below be interpreted\r\n \/\/ as a metacharacter.\r\n CommandLine.append(NumberBackslashes * 2, L'\\\\');\r\n break;\r\n }\r\n else if (*It == L'\"')\r\n {\r\n \/\/ Escape all backslashes and the following\r\n \/\/ double quotation mark.\r\n CommandLine.append(NumberBackslashes * 2 + 1, L'\\\\');\r\n CommandLine.push_back(*It);\r\n }\r\n else\r\n {\r\n \/\/ Backslashes aren't special here.\r\n CommandLine.append(NumberBackslashes, L'\\\\');\r\n CommandLine.push_back(*It);\r\n }\r\n }\r\n \r\n CommandLine.push_back(L'\"');\r\n }\r\n }\r\n\r\n \/\/ Create process (as suspended) and inject DLL\r\n CreateAndInjectData CreateAndInject(\r\n boost::filesystem::path const& Path, \r\n boost::filesystem::path const& WorkDir, \r\n std::vector<std::wstring> const& Args, \r\n boost::filesystem::path const& Module, \r\n std::string const& Export, \r\n Injector::InjectFlags Flags)\r\n {\r\n \/\/ Set up args for CreateProcess\r\n STARTUPINFO StartInfo;\r\n ZeroMemory(&StartInfo, sizeof(StartInfo));\r\n StartInfo.cb = sizeof(StartInfo);\r\n PROCESS_INFORMATION ProcInfo;\r\n ZeroMemory(&ProcInfo, sizeof(ProcInfo));\r\n\r\n \/\/ Construct command line.\r\n std::wstring CommandLine;\r\n ArgvQuote(Path.native(), CommandLine, false);\r\n std::for_each(Args.begin(), Args.end(), \r\n [&] (std::wstring const& Arg) \r\n {\r\n CommandLine += L' ';\r\n ArgvQuote(Arg, CommandLine, false);\r\n });\r\n \r\n \/\/ Copy command line to buffer\r\n std::vector<wchar_t> ProcArgs(CommandLine.cbegin(), CommandLine.cend());\r\n ProcArgs.push_back(L'\\0');\r\n \r\n \/\/ Set working directory\r\n boost::filesystem::path WorkDirReal;\r\n if (!WorkDir.empty())\r\n {\r\n WorkDirReal = WorkDir;\r\n }\r\n else if (Path.has_parent_path())\r\n {\r\n WorkDirReal = Path.parent_path();\r\n }\r\n else\r\n {\r\n WorkDirReal = L\".\/\";\r\n }\r\n\r\n \/\/ Attempt process creation\r\n if (!CreateProcess(Path.c_str(), ProcArgs.data(), nullptr, nullptr, FALSE, \r\n CREATE_SUSPENDED, nullptr, WorkDirReal.c_str(), &StartInfo, &ProcInfo))\r\n {\r\n DWORD const LastError = GetLastError();\r\n BOOST_THROW_EXCEPTION(Injector::Error() << \r\n ErrorFunction(\"CreateAndInject\") << \r\n ErrorString(\"Could not create process.\") << \r\n ErrorCodeWinLast(LastError));\r\n }\r\n\r\n \/\/ Ensure cleanup\r\n Windows::EnsureCloseHandle const ProcHandle(ProcInfo.hProcess);\r\n Windows::EnsureCloseHandle const ThreadHandle(ProcInfo.hThread);\r\n\r\n try\r\n {\r\n \/\/ Memory manager instance\r\n MemoryMgr const MyMemory(ProcInfo.dwProcessId);\r\n \r\n \/\/ Create Assembler.\r\n \/\/ This is used to generate a 'nullsub' function, which is called in \r\n \/\/ the context of the remote process in order to 'force' a call to \r\n \/\/ ntdll.dll!LdrInitializeThunk. This is necessary because module \r\n \/\/ enumeration will fail if LdrInitializeThunk has not been called, \r\n \/\/ and Injector::InjectDll (and the APIs it uses) depend on the \r\n \/\/ module enumeration APIs.\r\n AsmJit::Assembler MyJitFunc;\r\n\r\n#if defined(_M_AMD64) \r\n \/\/ Return\r\n MyJitFunc.ret();\r\n#elif defined(_M_IX86) \r\n \/\/ Return\r\n MyJitFunc.ret(AsmJit::Imm(0x4));\r\n#else \r\n#error \"[HadesMem] Unsupported architecture.\"\r\n#endif\r\n\r\n \/\/ Get stub size\r\n DWORD_PTR const StubSize = MyJitFunc.getCodeSize();\r\n \r\n \/\/ Allocate memory for stub buffer\r\n AllocAndFree const StubMemRemote(MyMemory, StubSize);\r\n PBYTE pRemoteStub = static_cast<PBYTE>(StubMemRemote.GetBase());\r\n DWORD_PTR pRemoteStubTemp = reinterpret_cast<DWORD_PTR>(pRemoteStub);\r\n \r\n \/\/ Create buffer to hold relocated code plus the return value address\r\n std::vector<BYTE> CodeReal(StubSize);\r\n \r\n \/\/ Generate code\r\n MyJitFunc.relocCode(CodeReal.data(), reinterpret_cast<DWORD_PTR>(\r\n pRemoteStub));\r\n \r\n \/\/ Write stub buffer to process\r\n MyMemory.Write(pRemoteStub, CodeReal);\r\n \r\n \/\/ Call stub via creating a remote thread in the target.\r\n Windows::EnsureCloseHandle const MyThread(CreateRemoteThread(\r\n MyMemory.GetProcessHandle(), nullptr, 0, \r\n reinterpret_cast<LPTHREAD_START_ROUTINE>(pRemoteStubTemp), nullptr, \r\n 0, nullptr));\r\n if (!MyThread)\r\n {\r\n DWORD const LastError = GetLastError();\r\n BOOST_THROW_EXCEPTION(Injector::Error() << \r\n ErrorFunction(\"CreateAndInject\") << \r\n ErrorString(\"Could not create remote thread.\") << \r\n ErrorCodeWinLast(LastError));\r\n }\r\n \r\n \/\/ Wait for the remote thread to terminate\r\n if (WaitForSingleObject(MyThread, INFINITE) != WAIT_OBJECT_0)\r\n {\r\n DWORD const LastError = GetLastError();\r\n BOOST_THROW_EXCEPTION(Injector::Error() << \r\n ErrorFunction(\"CreateAndInject\") << \r\n ErrorString(\"Could not wait for remote thread.\") << \r\n ErrorCodeWinLast(LastError));\r\n }\r\n\r\n \/\/ Create DLL injector\r\n Injector const MyInjector(MyMemory);\r\n\r\n \/\/ Inject DLL\r\n HMODULE const ModBase = MyInjector.InjectDll(Module, Flags);\r\n\r\n \/\/ Call export if one has been specified\r\n MemoryMgr::RemoteFunctionRet ExpRetData;\r\n if (!Export.empty())\r\n {\r\n ExpRetData = MyInjector.CallExport(Module, ModBase, Export);\r\n }\r\n\r\n \/\/ Success! Let the process continue execution.\r\n if (ResumeThread(ProcInfo.hThread) == static_cast<DWORD>(-1))\r\n {\r\n DWORD const LastError = GetLastError();\r\n BOOST_THROW_EXCEPTION(Injector::Error() << \r\n ErrorFunction(\"CreateAndInject\") << \r\n ErrorString(\"Could not resume process.\") << \r\n ErrorCodeWinLast(LastError) << \r\n ErrorCodeWinRet(ExpRetData.GetReturnValue()) << \r\n ErrorCodeWinOther(ExpRetData.GetLastError()));\r\n }\r\n\r\n \/\/ Return data to caller\r\n return CreateAndInjectData(MyMemory, ModBase, \r\n ExpRetData.GetReturnValue(), ExpRetData.GetLastError());\r\n }\r\n \/\/ Catch exceptions\r\n catch (std::exception const& \/*e*\/)\r\n {\r\n \/\/ Terminate process if injection failed\r\n TerminateProcess(ProcInfo.hProcess, 0);\r\n\r\n \/\/ Rethrow exception\r\n throw;\r\n }\r\n }\r\n\r\n \/\/ Constructor\r\n Injector::Injector(MemoryMgr const& MyMemory) \r\n : m_Memory(MyMemory)\r\n { }\r\n\r\n \/\/ Inject DLL\r\n HMODULE Injector::InjectDll(boost::filesystem::path const& Path, \r\n InjectFlags Flags) const\r\n {\r\n \/\/ Do not continue if Shim Engine is enabled for local process, \r\n \/\/ otherwise it could interfere with the address resolution.\r\n HMODULE const ShimEngMod = GetModuleHandle(L\"ShimEng.dll\");\r\n if (ShimEngMod)\r\n {\r\n BOOST_THROW_EXCEPTION(Error() << \r\n ErrorFunction(\"Injector::InjectDll\") << \r\n ErrorString(\"Shims enabled for local process.\"));\r\n }\r\n \r\n \/\/ String to hold 'real' path to module\r\n boost::filesystem::path PathReal(Path);\r\n \r\n \/\/ Check if path resolution was requested\r\n bool PathResolution = ((Flags & InjectFlag_PathResolution) == \r\n InjectFlag_PathResolution);\r\n\r\n \/\/ Check whether we need to convert the path from a relative to \r\n \/\/ an absolute\r\n if (PathResolution && PathReal.is_relative())\r\n {\r\n \/\/ Convert relative path to absolute path\r\n PathReal = boost::filesystem::absolute(PathReal, Hades::Windows::\r\n GetSelfDirPath());\r\n }\r\n\r\n \/\/ Convert path to preferred format\r\n PathReal.make_preferred();\r\n\r\n \/\/ Ensure target file exists\r\n \/\/ Note: Only performing this check when path resolution is enabled, \r\n \/\/ because otherwise we would need to perform the check in the context \r\n \/\/ of the remote process, which is not possible to do without \r\n \/\/ introducing race conditions and other potential problems. So we just \r\n \/\/ let LoadLibraryW do the check for us.\r\n if (PathResolution && !boost::filesystem::exists(PathReal))\r\n {\r\n BOOST_THROW_EXCEPTION(Error() << \r\n ErrorFunction(\"Injector::InjectDll\") << \r\n ErrorString(\"Could not find module file.\"));\r\n }\r\n\r\n \/\/ Get path as string\r\n std::wstring const PathString(PathReal.native());\r\n\r\n \/\/ Calculate the number of bytes needed for the DLL's pathname\r\n std::size_t const PathBufSize = (PathString.size() + 1) * \r\n sizeof(wchar_t);\r\n\r\n \/\/ Allocate space in the remote process for the pathname\r\n AllocAndFree const LibFileRemote(m_Memory, PathBufSize);\r\n\r\n \/\/ Copy the DLL's pathname to the remote process' address space\r\n m_Memory.Write(LibFileRemote.GetBase(), PathString);\r\n \r\n \/\/ Get address of LoadLibraryW in Kernel32.dll\r\n Module Kernel32Mod(m_Memory, L\"kernel32.dll\");\r\n FARPROC const pLoadLibraryW = m_Memory.GetRemoteProcAddress(\r\n Kernel32Mod.GetBase(), \"kernel32.dll\", \"LoadLibraryW\");\r\n DWORD_PTR pLoadLibraryWTemp = reinterpret_cast<DWORD_PTR>(pLoadLibraryW);\r\n\r\n \/\/ Load module in remote process using LoadLibraryW\r\n std::vector<PVOID> Args;\r\n Args.push_back(LibFileRemote.GetBase());\r\n MemoryMgr::RemoteFunctionRet RemoteRet = m_Memory.Call(\r\n reinterpret_cast<PVOID>(pLoadLibraryWTemp), \r\n MemoryMgr::CallConv_Default, Args);\r\n if (!RemoteRet.GetReturnValue())\r\n {\r\n BOOST_THROW_EXCEPTION(Error() << \r\n ErrorFunction(\"Injector::InjectDll\") << \r\n ErrorString(\"Call to LoadLibraryW in remote process failed.\") << \r\n ErrorCodeWinLast(RemoteRet.GetLastError()));\r\n }\r\n \r\n \/\/ Return module base\r\n return reinterpret_cast<HMODULE>(RemoteRet.GetReturnValue());\r\n }\r\n\r\n \/\/ Free DLL\r\n void Injector::FreeDll(HMODULE ModuleRemote) const\r\n {\r\n \/\/ Get address of FreeLibrary in Kernel32.dll\r\n Module Kernel32Mod(m_Memory, L\"kernel32.dll\");\r\n FARPROC const pFreeLibrary = m_Memory.GetRemoteProcAddress(\r\n Kernel32Mod.GetBase(), \"kernel32.dll\", \"FreeLibrary\");\r\n DWORD_PTR pFreeLibraryTemp = reinterpret_cast<DWORD_PTR>(pFreeLibrary);\r\n\r\n \/\/ Free module in remote process using FreeLibrary\r\n std::vector<PVOID> Args;\r\n Args.push_back(reinterpret_cast<PVOID>(ModuleRemote));\r\n MemoryMgr::RemoteFunctionRet RemoteRet = m_Memory.Call(\r\n reinterpret_cast<PVOID>(pFreeLibraryTemp), \r\n MemoryMgr::CallConv_Default, Args);\r\n if (!RemoteRet.GetReturnValue())\r\n {\r\n BOOST_THROW_EXCEPTION(Error() << \r\n ErrorFunction(\"Injector::FreeDll\") << \r\n ErrorString(\"Call to FreeLibrary in remote process failed.\") << \r\n ErrorCodeWinLast(RemoteRet.GetLastError()));\r\n }\r\n }\r\n\r\n \/\/ Call export\r\n MemoryMgr::RemoteFunctionRet Injector::CallExport(\r\n boost::filesystem::path const& ModulePath, \r\n HMODULE ModuleRemote, std::string const& Export) const\r\n {\r\n \/\/ Get export address\r\n FARPROC const pExportAddr = m_Memory.GetRemoteProcAddress(ModuleRemote, \r\n ModulePath, Export);\r\n DWORD_PTR const pExportAddrTemp = reinterpret_cast<DWORD_PTR>(\r\n pExportAddr);\r\n\r\n \/\/ Create a remote thread that calls the desired export\r\n std::vector<PVOID> ExportArgs;\r\n ExportArgs.push_back(ModuleRemote);\r\n return m_Memory.Call(reinterpret_cast<PVOID>(pExportAddrTemp), \r\n MemoryMgr::CallConv_Default, ExportArgs);\r\n }\r\n }\r\n}\r\n<|endoftext|>"} {"text":"<commit_before>\/\/ Copyright (c) 2009-2010 Satoshi Nakamoto\n\/\/ Copyright (c) 2009-2016 The Bitcoin Core developers\n\/\/ Distributed under the MIT software license, see the accompanying\n\/\/ file COPYING or http:\/\/www.opensource.org\/licenses\/mit-license.php.\n\n#include <random.h>\n\n#include <crypto\/sha512.h>\n#include <support\/cleanse.h>\n#ifdef WIN32\n#include <compat.h> \/\/ for Windows API\n#include <wincrypt.h>\n#endif\n#include <util.h> \/\/ for LogPrint()\n#include <utilstrencodings.h> \/\/ for GetTime()\n\n#include <stdlib.h>\n#include <limits>\n\n#ifndef WIN32\n#include <sys\/time.h>\n#endif\n\n#ifdef HAVE_SYS_GETRANDOM\n#include <sys\/syscall.h>\n#include <linux\/random.h>\n#endif\n#ifdef HAVE_GETENTROPY\n#include <unistd.h>\n#endif\n#ifdef HAVE_SYSCTL_ARND\n#include <sys\/sysctl.h>\n#endif\n\n#include <openssl\/err.h>\n#include <openssl\/rand.h>\n\nstatic void RandFailure()\n{\n LogPrintf(\"Failed to read randomness, aborting\\n\");\n abort();\n}\n\nstatic inline int64_t GetPerformanceCounter()\n{\n int64_t nCounter = 0;\n#ifdef WIN32\n QueryPerformanceCounter((LARGE_INTEGER*)&nCounter);\n#else\n timeval t;\n gettimeofday(&t, NULL);\n nCounter = (int64_t)(t.tv_sec * 1000000 + t.tv_usec);\n#endif\n return nCounter;\n}\n\nvoid RandAddSeed()\n{\n \/\/ Seed with CPU performance counter\n int64_t nCounter = GetPerformanceCounter();\n RAND_add(&nCounter, sizeof(nCounter), 1.5);\n memory_cleanse((void*)&nCounter, sizeof(nCounter));\n}\n\nstatic void RandAddSeedPerfmon()\n{\n RandAddSeed();\n\n#ifdef WIN32\n \/\/ Don't need this on Linux, OpenSSL automatically uses \/dev\/urandom\n \/\/ Seed with the entire set of perfmon data\n\n \/\/ This can take up to 2 seconds, so only do it every 10 minutes\n static int64_t nLastPerfmon;\n if (GetTime() < nLastPerfmon + 10 * 60)\n return;\n nLastPerfmon = GetTime();\n\n std::vector<unsigned char> vData(250000, 0);\n long ret = 0;\n unsigned long nSize = 0;\n const size_t nMaxSize = 10000000; \/\/ Bail out at more than 10MB of performance data\n while (true) {\n nSize = vData.size();\n ret = RegQueryValueExA(HKEY_PERFORMANCE_DATA, \"Global\", NULL, NULL, vData.data(), &nSize);\n if (ret != ERROR_MORE_DATA || vData.size() >= nMaxSize)\n break;\n vData.resize(std::max((vData.size() * 3) \/ 2, nMaxSize)); \/\/ Grow size of buffer exponentially\n }\n RegCloseKey(HKEY_PERFORMANCE_DATA);\n if (ret == ERROR_SUCCESS) {\n RAND_add(vData.data(), nSize, nSize \/ 100.0);\n memory_cleanse(vData.data(), nSize);\n LogPrint(BCLog::RAND, \"%s: %lu bytes\\n\", __func__, nSize);\n } else {\n static bool warned = false; \/\/ Warn only once\n if (!warned) {\n LogPrintf(\"%s: Warning: RegQueryValueExA(HKEY_PERFORMANCE_DATA) failed with code %i\\n\", __func__, ret);\n warned = true;\n }\n }\n#endif\n}\n\n#ifndef WIN32\n\/** Fallback: get 32 bytes of system entropy from \/dev\/urandom. The most\n * compatible way to get cryptographic randomness on UNIX-ish platforms.\n *\/\nvoid GetDevURandom(unsigned char *ent32)\n{\n int f = open(\"\/dev\/urandom\", O_RDONLY);\n if (f == -1) {\n RandFailure();\n }\n int have = 0;\n do {\n ssize_t n = read(f, ent32 + have, NUM_OS_RANDOM_BYTES - have);\n if (n <= 0 || n + have > NUM_OS_RANDOM_BYTES) {\n RandFailure();\n }\n have += n;\n } while (have < NUM_OS_RANDOM_BYTES);\n close(f);\n}\n#endif\n\n\/** Get 32 bytes of system entropy. *\/\nvoid GetOSRand(unsigned char *ent32)\n{\n#if defined(WIN32)\n HCRYPTPROV hProvider;\n int ret = CryptAcquireContextW(&hProvider, NULL, NULL, PROV_RSA_FULL, CRYPT_VERIFYCONTEXT);\n if (!ret) {\n RandFailure();\n }\n ret = CryptGenRandom(hProvider, NUM_OS_RANDOM_BYTES, ent32);\n if (!ret) {\n RandFailure();\n }\n CryptReleaseContext(hProvider, 0);\n#elif defined(HAVE_SYS_GETRANDOM)\n \/* Linux. From the getrandom(2) man page:\n * \"If the urandom source has been initialized, reads of up to 256 bytes\n * will always return as many bytes as requested and will not be\n * interrupted by signals.\"\n *\/\n int rv = syscall(SYS_getrandom, ent32, NUM_OS_RANDOM_BYTES, 0);\n if (rv != NUM_OS_RANDOM_BYTES) {\n if (rv < 0 && errno == ENOSYS) {\n \/* Fallback for kernel <3.17: the return value will be -1 and errno\n * ENOSYS if the syscall is not available, in that case fall back\n * to \/dev\/urandom.\n *\/\n GetDevURandom(ent32);\n } else {\n RandFailure();\n }\n }\n#elif defined(HAVE_GETENTROPY)\n \/* On OpenBSD this can return up to 256 bytes of entropy, will return an\n * error if more are requested.\n * The call cannot return less than the requested number of bytes.\n *\/\n if (getentropy(ent32, NUM_OS_RANDOM_BYTES) != 0) {\n RandFailure();\n }\n#elif defined(HAVE_SYSCTL_ARND)\n \/* FreeBSD and similar. It is possible for the call to return less\n * bytes than requested, so need to read in a loop.\n *\/\n static const int name[2] = {CTL_KERN, KERN_ARND};\n int have = 0;\n do {\n size_t len = NUM_OS_RANDOM_BYTES - have;\n if (sysctl(name, ARRAYLEN(name), ent32 + have, &len, NULL, 0) != 0) {\n RandFailure();\n }\n have += len;\n } while (have < NUM_OS_RANDOM_BYTES);\n#else\n \/* Fall back to \/dev\/urandom if there is no specific method implemented to\n * get system entropy for this OS.\n *\/\n GetDevURandom(ent32);\n#endif\n}\n\nvoid GetRandBytes(unsigned char* buf, int num)\n{\n if (RAND_bytes(buf, num) != 1) {\n RandFailure();\n }\n}\n\nvoid GetStrongRandBytes(unsigned char* out, int num)\n{\n assert(num <= 32);\n CSHA512 hasher;\n unsigned char buf[64];\n\n \/\/ First source: OpenSSL's RNG\n RandAddSeedPerfmon();\n GetRandBytes(buf, 32);\n hasher.Write(buf, 32);\n\n \/\/ Second source: OS RNG\n GetOSRand(buf);\n hasher.Write(buf, 32);\n\n \/\/ Produce output\n hasher.Finalize(buf);\n memcpy(out, buf, num);\n memory_cleanse(buf, 64);\n}\n\nuint64_t GetRand(uint64_t nMax)\n{\n if (nMax == 0)\n return 0;\n\n \/\/ The range of the random source must be a multiple of the modulus\n \/\/ to give every possible output value an equal possibility\n uint64_t nRange = (std::numeric_limits<uint64_t>::max() \/ nMax) * nMax;\n uint64_t nRand = 0;\n do {\n GetRandBytes((unsigned char*)&nRand, sizeof(nRand));\n } while (nRand >= nRange);\n return (nRand % nMax);\n}\n\nint GetRandInt(int nMax)\n{\n return GetRand(nMax);\n}\n\nuint256 GetRandHash()\n{\n uint256 hash;\n GetRandBytes((unsigned char*)&hash, sizeof(hash));\n return hash;\n}\n\nvoid FastRandomContext::RandomSeed()\n{\n uint256 seed = GetRandHash();\n rng.SetKey(seed.begin(), 32);\n requires_seed = false;\n}\n\nFastRandomContext::FastRandomContext(const uint256& seed) : requires_seed(false), bytebuf_size(0), bitbuf_size(0)\n{\n rng.SetKey(seed.begin(), 32);\n}\n\nbool Random_SanityCheck()\n{\n \/* This does not measure the quality of randomness, but it does test that\n * OSRandom() overwrites all 32 bytes of the output given a maximum\n * number of tries.\n *\/\n static const ssize_t MAX_TRIES = 1024;\n uint8_t data[NUM_OS_RANDOM_BYTES];\n bool overwritten[NUM_OS_RANDOM_BYTES] = {}; \/* Tracks which bytes have been overwritten at least once *\/\n int num_overwritten;\n int tries = 0;\n \/* Loop until all bytes have been overwritten at least once, or max number tries reached *\/\n do {\n memset(data, 0, NUM_OS_RANDOM_BYTES);\n GetOSRand(data);\n for (int x=0; x < NUM_OS_RANDOM_BYTES; ++x) {\n overwritten[x] |= (data[x] != 0);\n }\n\n num_overwritten = 0;\n for (int x=0; x < NUM_OS_RANDOM_BYTES; ++x) {\n if (overwritten[x]) {\n num_overwritten += 1;\n }\n }\n\n tries += 1;\n } while (num_overwritten < NUM_OS_RANDOM_BYTES && tries < MAX_TRIES);\n return (num_overwritten == NUM_OS_RANDOM_BYTES); \/* If this failed, bailed out after too many tries *\/\n}\n\nFastRandomContext::FastRandomContext(bool fDeterministic) : requires_seed(!fDeterministic), bytebuf_size(0), bitbuf_size(0)\n{\n if (!fDeterministic) {\n return;\n }\n uint256 seed;\n rng.SetKey(seed.begin(), 32);\n}\n<commit_msg>Maintain state across GetStrongRandBytes calls<commit_after>\/\/ Copyright (c) 2009-2010 Satoshi Nakamoto\n\/\/ Copyright (c) 2009-2016 The Bitcoin Core developers\n\/\/ Distributed under the MIT software license, see the accompanying\n\/\/ file COPYING or http:\/\/www.opensource.org\/licenses\/mit-license.php.\n\n#include <random.h>\n\n#include <crypto\/sha512.h>\n#include <support\/cleanse.h>\n#ifdef WIN32\n#include <compat.h> \/\/ for Windows API\n#include <wincrypt.h>\n#endif\n#include <util.h> \/\/ for LogPrint()\n#include <utilstrencodings.h> \/\/ for GetTime()\n\n#include <stdlib.h>\n#include <limits>\n\n#ifndef WIN32\n#include <sys\/time.h>\n#endif\n\n#ifdef HAVE_SYS_GETRANDOM\n#include <sys\/syscall.h>\n#include <linux\/random.h>\n#endif\n#ifdef HAVE_GETENTROPY\n#include <unistd.h>\n#endif\n#ifdef HAVE_SYSCTL_ARND\n#include <sys\/sysctl.h>\n#endif\n\n#include <mutex>\n\n#include <openssl\/err.h>\n#include <openssl\/rand.h>\n\nstatic void RandFailure()\n{\n LogPrintf(\"Failed to read randomness, aborting\\n\");\n abort();\n}\n\nstatic inline int64_t GetPerformanceCounter()\n{\n int64_t nCounter = 0;\n#ifdef WIN32\n QueryPerformanceCounter((LARGE_INTEGER*)&nCounter);\n#else\n timeval t;\n gettimeofday(&t, NULL);\n nCounter = (int64_t)(t.tv_sec * 1000000 + t.tv_usec);\n#endif\n return nCounter;\n}\n\nvoid RandAddSeed()\n{\n \/\/ Seed with CPU performance counter\n int64_t nCounter = GetPerformanceCounter();\n RAND_add(&nCounter, sizeof(nCounter), 1.5);\n memory_cleanse((void*)&nCounter, sizeof(nCounter));\n}\n\nstatic void RandAddSeedPerfmon()\n{\n RandAddSeed();\n\n#ifdef WIN32\n \/\/ Don't need this on Linux, OpenSSL automatically uses \/dev\/urandom\n \/\/ Seed with the entire set of perfmon data\n\n \/\/ This can take up to 2 seconds, so only do it every 10 minutes\n static int64_t nLastPerfmon;\n if (GetTime() < nLastPerfmon + 10 * 60)\n return;\n nLastPerfmon = GetTime();\n\n std::vector<unsigned char> vData(250000, 0);\n long ret = 0;\n unsigned long nSize = 0;\n const size_t nMaxSize = 10000000; \/\/ Bail out at more than 10MB of performance data\n while (true) {\n nSize = vData.size();\n ret = RegQueryValueExA(HKEY_PERFORMANCE_DATA, \"Global\", NULL, NULL, vData.data(), &nSize);\n if (ret != ERROR_MORE_DATA || vData.size() >= nMaxSize)\n break;\n vData.resize(std::max((vData.size() * 3) \/ 2, nMaxSize)); \/\/ Grow size of buffer exponentially\n }\n RegCloseKey(HKEY_PERFORMANCE_DATA);\n if (ret == ERROR_SUCCESS) {\n RAND_add(vData.data(), nSize, nSize \/ 100.0);\n memory_cleanse(vData.data(), nSize);\n LogPrint(BCLog::RAND, \"%s: %lu bytes\\n\", __func__, nSize);\n } else {\n static bool warned = false; \/\/ Warn only once\n if (!warned) {\n LogPrintf(\"%s: Warning: RegQueryValueExA(HKEY_PERFORMANCE_DATA) failed with code %i\\n\", __func__, ret);\n warned = true;\n }\n }\n#endif\n}\n\n#ifndef WIN32\n\/** Fallback: get 32 bytes of system entropy from \/dev\/urandom. The most\n * compatible way to get cryptographic randomness on UNIX-ish platforms.\n *\/\nvoid GetDevURandom(unsigned char *ent32)\n{\n int f = open(\"\/dev\/urandom\", O_RDONLY);\n if (f == -1) {\n RandFailure();\n }\n int have = 0;\n do {\n ssize_t n = read(f, ent32 + have, NUM_OS_RANDOM_BYTES - have);\n if (n <= 0 || n + have > NUM_OS_RANDOM_BYTES) {\n RandFailure();\n }\n have += n;\n } while (have < NUM_OS_RANDOM_BYTES);\n close(f);\n}\n#endif\n\n\/** Get 32 bytes of system entropy. *\/\nvoid GetOSRand(unsigned char *ent32)\n{\n#if defined(WIN32)\n HCRYPTPROV hProvider;\n int ret = CryptAcquireContextW(&hProvider, NULL, NULL, PROV_RSA_FULL, CRYPT_VERIFYCONTEXT);\n if (!ret) {\n RandFailure();\n }\n ret = CryptGenRandom(hProvider, NUM_OS_RANDOM_BYTES, ent32);\n if (!ret) {\n RandFailure();\n }\n CryptReleaseContext(hProvider, 0);\n#elif defined(HAVE_SYS_GETRANDOM)\n \/* Linux. From the getrandom(2) man page:\n * \"If the urandom source has been initialized, reads of up to 256 bytes\n * will always return as many bytes as requested and will not be\n * interrupted by signals.\"\n *\/\n int rv = syscall(SYS_getrandom, ent32, NUM_OS_RANDOM_BYTES, 0);\n if (rv != NUM_OS_RANDOM_BYTES) {\n if (rv < 0 && errno == ENOSYS) {\n \/* Fallback for kernel <3.17: the return value will be -1 and errno\n * ENOSYS if the syscall is not available, in that case fall back\n * to \/dev\/urandom.\n *\/\n GetDevURandom(ent32);\n } else {\n RandFailure();\n }\n }\n#elif defined(HAVE_GETENTROPY)\n \/* On OpenBSD this can return up to 256 bytes of entropy, will return an\n * error if more are requested.\n * The call cannot return less than the requested number of bytes.\n *\/\n if (getentropy(ent32, NUM_OS_RANDOM_BYTES) != 0) {\n RandFailure();\n }\n#elif defined(HAVE_SYSCTL_ARND)\n \/* FreeBSD and similar. It is possible for the call to return less\n * bytes than requested, so need to read in a loop.\n *\/\n static const int name[2] = {CTL_KERN, KERN_ARND};\n int have = 0;\n do {\n size_t len = NUM_OS_RANDOM_BYTES - have;\n if (sysctl(name, ARRAYLEN(name), ent32 + have, &len, NULL, 0) != 0) {\n RandFailure();\n }\n have += len;\n } while (have < NUM_OS_RANDOM_BYTES);\n#else\n \/* Fall back to \/dev\/urandom if there is no specific method implemented to\n * get system entropy for this OS.\n *\/\n GetDevURandom(ent32);\n#endif\n}\n\nvoid GetRandBytes(unsigned char* buf, int num)\n{\n if (RAND_bytes(buf, num) != 1) {\n RandFailure();\n }\n}\n\nstatic std::mutex cs_rng_state;\nstatic unsigned char rng_state[32] = {0};\nstatic uint64_t rng_counter = 0;\n\nvoid GetStrongRandBytes(unsigned char* out, int num)\n{\n assert(num <= 32);\n CSHA512 hasher;\n unsigned char buf[64];\n\n \/\/ First source: OpenSSL's RNG\n RandAddSeedPerfmon();\n GetRandBytes(buf, 32);\n hasher.Write(buf, 32);\n\n \/\/ Second source: OS RNG\n GetOSRand(buf);\n hasher.Write(buf, 32);\n\n \/\/ Combine with and update state\n {\n std::unique_lock<std::mutex> lock(cs_rng_state);\n hasher.Write(rng_state, sizeof(rng_state));\n hasher.Write((const unsigned char*)&rng_counter, sizeof(rng_counter));\n ++rng_counter;\n hasher.Finalize(buf);\n memcpy(rng_state, buf + 32, 32);\n }\n\n \/\/ Produce output\n memcpy(out, buf, num);\n memory_cleanse(buf, 64);\n}\n\nuint64_t GetRand(uint64_t nMax)\n{\n if (nMax == 0)\n return 0;\n\n \/\/ The range of the random source must be a multiple of the modulus\n \/\/ to give every possible output value an equal possibility\n uint64_t nRange = (std::numeric_limits<uint64_t>::max() \/ nMax) * nMax;\n uint64_t nRand = 0;\n do {\n GetRandBytes((unsigned char*)&nRand, sizeof(nRand));\n } while (nRand >= nRange);\n return (nRand % nMax);\n}\n\nint GetRandInt(int nMax)\n{\n return GetRand(nMax);\n}\n\nuint256 GetRandHash()\n{\n uint256 hash;\n GetRandBytes((unsigned char*)&hash, sizeof(hash));\n return hash;\n}\n\nvoid FastRandomContext::RandomSeed()\n{\n uint256 seed = GetRandHash();\n rng.SetKey(seed.begin(), 32);\n requires_seed = false;\n}\n\nFastRandomContext::FastRandomContext(const uint256& seed) : requires_seed(false), bytebuf_size(0), bitbuf_size(0)\n{\n rng.SetKey(seed.begin(), 32);\n}\n\nbool Random_SanityCheck()\n{\n \/* This does not measure the quality of randomness, but it does test that\n * OSRandom() overwrites all 32 bytes of the output given a maximum\n * number of tries.\n *\/\n static const ssize_t MAX_TRIES = 1024;\n uint8_t data[NUM_OS_RANDOM_BYTES];\n bool overwritten[NUM_OS_RANDOM_BYTES] = {}; \/* Tracks which bytes have been overwritten at least once *\/\n int num_overwritten;\n int tries = 0;\n \/* Loop until all bytes have been overwritten at least once, or max number tries reached *\/\n do {\n memset(data, 0, NUM_OS_RANDOM_BYTES);\n GetOSRand(data);\n for (int x=0; x < NUM_OS_RANDOM_BYTES; ++x) {\n overwritten[x] |= (data[x] != 0);\n }\n\n num_overwritten = 0;\n for (int x=0; x < NUM_OS_RANDOM_BYTES; ++x) {\n if (overwritten[x]) {\n num_overwritten += 1;\n }\n }\n\n tries += 1;\n } while (num_overwritten < NUM_OS_RANDOM_BYTES && tries < MAX_TRIES);\n return (num_overwritten == NUM_OS_RANDOM_BYTES); \/* If this failed, bailed out after too many tries *\/\n}\n\nFastRandomContext::FastRandomContext(bool fDeterministic) : requires_seed(!fDeterministic), bytebuf_size(0), bitbuf_size(0)\n{\n if (!fDeterministic) {\n return;\n }\n uint256 seed;\n rng.SetKey(seed.begin(), 32);\n}\n<|endoftext|>"} {"text":"<commit_before>#include <condition_variable>\n#include <functional>\n#include <list>\n#include <mutex>\n#include <string>\n#include <thread>\n#include <queue>\n\n#include <gmock\/gmock.h>\n#include <gtest\/gtest.h>\n\n#include \"thread-capture.h\"\n#include \"thread-crosser.h\"\n\nusing testing::ElementsAre;\n\nnamespace {\n\nclass LogText : public ThreadCapture<LogText> {\n public:\n LogText() : cross_and_capture_to_(this) {}\n\n static void Log(std::string line) {\n if (GetCurrent()) {\n GetCurrent()->LogLine(std::move(line));\n }\n }\n\n const std::list<std::string> GetLinesUnsafe() {\n return lines_;\n }\n\n private:\n void LogLine(std::string line) {\n std::lock_guard<std::mutex> lock(data_lock_);\n lines_.emplace_back(std::move(line));\n }\n\n std::mutex data_lock_;\n std::list<std::string> lines_;\n const AutoThreadCrosser<LogText> cross_and_capture_to_;\n};\n\nclass LogValues : public ThreadCapture<LogValues> {\n public:\n LogValues() : cross_and_capture_to_(this) {}\n\n static void Count(int count) {\n if (GetCurrent()) {\n GetCurrent()->LogCount(count);\n }\n }\n\n const std::list<int> GetCountsUnsafe() {\n return counts_;\n }\n\n private:\n void LogCount(int count) {\n std::lock_guard<std::mutex> lock(data_lock_);\n counts_.emplace_back(count);\n }\n\n std::mutex data_lock_;\n std::list<int> counts_;\n const AutoThreadCrosser<LogValues> cross_and_capture_to_;\n};\n\nclass BlockingCallbackQueue {\n public:\n void Push(std::function<void()> callback) {\n std::lock_guard<std::mutex> lock(queue_lock_);\n queue_.push(std::move(callback));\n condition_.notify_all();\n }\n\n \/\/ NOTE: Calling before returning avoids a race condition if WaitUntilEmpty()\n \/\/ is used to wait until all calls complete.\n bool PopAndCall() {\n std::unique_lock<std::mutex> lock(queue_lock_);\n while (queue_.empty()) {\n condition_.wait(lock);\n }\n const bool valid = queue_.front().operator bool();\n if (valid) {\n queue_.front()();\n queue_.pop();\n condition_.notify_all();\n }\n return valid;\n }\n\n void WaitUntilEmpty() {\n std::unique_lock<std::mutex> lock(queue_lock_);\n while (!queue_.empty()) {\n condition_.wait(lock);\n }\n }\n\n private:\n std::mutex queue_lock_;\n std::condition_variable condition_;\n std::queue<std::function<void()>> queue_;\n};\n\n} \/\/ namespace\n\nTEST(ThreadCaptureTest, NoLoggerInterferenceWithDifferentTypes) {\n LogText::Log(\"not logged\");\n LogValues::Count(0);\n {\n LogText text_logger;\n LogText::Log(\"logged 1\");\n {\n LogValues count_logger;\n LogValues::Count(1);\n LogText::Log(\"logged 2\");\n EXPECT_THAT(count_logger.GetCountsUnsafe(), ElementsAre(1));\n }\n LogText::Log(\"logged 3\");\n EXPECT_THAT(text_logger.GetLinesUnsafe(),\n ElementsAre(\"logged 1\", \"logged 2\", \"logged 3\"));\n }\n}\n\nTEST(ThreadCaptureTest, SameTypeOverrides) {\n LogText text_logger1;\n LogText::Log(\"logged 1\");\n {\n LogText text_logger2;\n LogText::Log(\"logged 2\");\n EXPECT_THAT(text_logger2.GetLinesUnsafe(), ElementsAre(\"logged 2\"));\n }\n LogText::Log(\"logged 3\");\n EXPECT_THAT(text_logger1.GetLinesUnsafe(),\n ElementsAre(\"logged 1\", \"logged 3\"));\n}\n\nTEST(ThreadCaptureTest, ThreadsAreNotCrossed) {\n LogText logger;\n LogText::Log(\"logged 1\");\n\n std::thread worker([] {\n LogText::Log(\"logged 2\");\n });\n worker.join();\n\n EXPECT_THAT(logger.GetLinesUnsafe(), ElementsAre(\"logged 1\"));\n}\n\nTEST(ThreadCrosserTest, WrapCallIsFineWithoutLogger) {\n bool called = false;\n ThreadCrosser::WrapCall([&called] {\n called = true;\n LogText::Log(\"not logged\");\n })();\n EXPECT_TRUE(called);\n}\n\nTEST(ThreadCrosserTest, WrapCallWithNullCallbackIsNull) {\n EXPECT_FALSE(ThreadCrosser::WrapCall(nullptr));\n LogText logger;\n EXPECT_FALSE(ThreadCrosser::WrapCall(nullptr));\n}\n\nTEST(ThreadCrosserTest, SingleThreadCrossing) {\n LogText logger;\n LogText::Log(\"logged 1\");\n\n std::thread worker(ThreadCrosser::WrapCall([] {\n LogText::Log(\"logged 2\");\n }));\n worker.join();\n\n EXPECT_THAT(logger.GetLinesUnsafe(), ElementsAre(\"logged 1\", \"logged 2\"));\n}\n\nTEST(ThreadCrosserTest, MultipleThreadCrossingWithMultipleLoggers) {\n LogText text_logger;\n LogText::Log(\"logged 1\");\n LogValues count_logger;\n LogValues::Count(1);\n\n std::thread worker(ThreadCrosser::WrapCall([] {\n std::thread worker(ThreadCrosser::WrapCall([] {\n LogText::Log(\"logged 2\");\n LogValues::Count(2);\n }));\n worker.join();\n }));\n worker.join();\n\n EXPECT_THAT(text_logger.GetLinesUnsafe(),\n ElementsAre(\"logged 1\", \"logged 2\"));\n EXPECT_THAT(count_logger.GetCountsUnsafe(), ElementsAre(1, 2));\n}\n\nTEST(ThreadCrosserTest, MultipleThreadCrossingWithDifferentLoggerScopes) {\n LogText text_logger;\n\n std::thread worker(ThreadCrosser::WrapCall([] {\n LogValues count_logger;\n std::thread worker(ThreadCrosser::WrapCall([] {\n LogText::Log(\"logged 1\");\n LogValues::Count(1);\n }));\n worker.join();\n EXPECT_THAT(count_logger.GetCountsUnsafe(), ElementsAre(1));\n }));\n worker.join();\n\n EXPECT_THAT(text_logger.GetLinesUnsafe(), ElementsAre(\"logged 1\"));\n}\n\nTEST(ThreadCrosserTest, DifferentLoggersInSameThread) {\n BlockingCallbackQueue queue;\n\n std::thread worker([&queue] {\n while (true) {\n LogText logger;\n if (!queue.PopAndCall()) {\n break;\n }\n LogText::Log(\"logged in thread\");\n EXPECT_THAT(logger.GetLinesUnsafe(), ElementsAre(\"logged in thread\"));\n }\n });\n\n LogText logger1;\n queue.Push(ThreadCrosser::WrapCall([] {\n LogText::Log(\"logged 1\");\n }));\n queue.WaitUntilEmpty();\n EXPECT_THAT(logger1.GetLinesUnsafe(), ElementsAre(\"logged 1\"));\n\n {\n \/\/ It's important for the test case that logger2 overrides logger1, i.e.,\n \/\/ that they are both in scope at the same time.\n LogText logger2;\n queue.Push(ThreadCrosser::WrapCall([] {\n LogText::Log(\"logged 2\");\n }));\n queue.WaitUntilEmpty();\n EXPECT_THAT(logger2.GetLinesUnsafe(), ElementsAre(\"logged 2\"));\n }\n\n queue.Push(ThreadCrosser::WrapCall([] {\n LogText::Log(\"logged 3\");\n }));\n queue.WaitUntilEmpty();\n EXPECT_THAT(logger1.GetLinesUnsafe(), ElementsAre(\"logged 1\", \"logged 3\"));\n\n queue.Push(nullptr); \/\/ (Causes the thread to exit.)\n worker.join();\n}\n\nint main(int argc, char *argv[]) {\n testing::InitGoogleTest(&argc, argv);\n return RUN_ALL_TESTS();\n}\n<commit_msg>Fixes latent bug in unit test.<commit_after>#include <condition_variable>\n#include <functional>\n#include <list>\n#include <mutex>\n#include <string>\n#include <thread>\n#include <queue>\n\n#include <gmock\/gmock.h>\n#include <gtest\/gtest.h>\n\n#include \"thread-capture.h\"\n#include \"thread-crosser.h\"\n\nusing testing::ElementsAre;\n\nnamespace {\n\nclass LogText : public ThreadCapture<LogText> {\n public:\n LogText() : cross_and_capture_to_(this) {}\n\n static void Log(std::string line) {\n if (GetCurrent()) {\n GetCurrent()->LogLine(std::move(line));\n }\n }\n\n const std::list<std::string> GetLinesUnsafe() {\n return lines_;\n }\n\n private:\n void LogLine(std::string line) {\n std::lock_guard<std::mutex> lock(data_lock_);\n lines_.emplace_back(std::move(line));\n }\n\n std::mutex data_lock_;\n std::list<std::string> lines_;\n const AutoThreadCrosser<LogText> cross_and_capture_to_;\n};\n\nclass LogValues : public ThreadCapture<LogValues> {\n public:\n LogValues() : cross_and_capture_to_(this) {}\n\n static void Count(int count) {\n if (GetCurrent()) {\n GetCurrent()->LogCount(count);\n }\n }\n\n const std::list<int> GetCountsUnsafe() {\n return counts_;\n }\n\n private:\n void LogCount(int count) {\n std::lock_guard<std::mutex> lock(data_lock_);\n counts_.emplace_back(count);\n }\n\n std::mutex data_lock_;\n std::list<int> counts_;\n const AutoThreadCrosser<LogValues> cross_and_capture_to_;\n};\n\nclass BlockingCallbackQueue {\n public:\n void Push(std::function<void()> callback) {\n std::lock_guard<std::mutex> lock(queue_lock_);\n queue_.push(std::move(callback));\n condition_.notify_all();\n }\n\n \/\/ NOTE: Calling before returning avoids a race condition if WaitUntilEmpty()\n \/\/ is used to wait until all calls complete.\n bool PopAndCall() {\n std::unique_lock<std::mutex> lock(queue_lock_);\n while (queue_.empty()) {\n condition_.wait(lock);\n }\n const bool valid = queue_.front().operator bool();\n if (valid) {\n queue_.front()();\n }\n queue_.pop();\n condition_.notify_all();\n return valid;\n }\n\n void WaitUntilEmpty() {\n std::unique_lock<std::mutex> lock(queue_lock_);\n while (!queue_.empty()) {\n condition_.wait(lock);\n }\n }\n\n private:\n std::mutex queue_lock_;\n std::condition_variable condition_;\n std::queue<std::function<void()>> queue_;\n};\n\n} \/\/ namespace\n\nTEST(ThreadCaptureTest, NoLoggerInterferenceWithDifferentTypes) {\n LogText::Log(\"not logged\");\n LogValues::Count(0);\n {\n LogText text_logger;\n LogText::Log(\"logged 1\");\n {\n LogValues count_logger;\n LogValues::Count(1);\n LogText::Log(\"logged 2\");\n EXPECT_THAT(count_logger.GetCountsUnsafe(), ElementsAre(1));\n }\n LogText::Log(\"logged 3\");\n EXPECT_THAT(text_logger.GetLinesUnsafe(),\n ElementsAre(\"logged 1\", \"logged 2\", \"logged 3\"));\n }\n}\n\nTEST(ThreadCaptureTest, SameTypeOverrides) {\n LogText text_logger1;\n LogText::Log(\"logged 1\");\n {\n LogText text_logger2;\n LogText::Log(\"logged 2\");\n EXPECT_THAT(text_logger2.GetLinesUnsafe(), ElementsAre(\"logged 2\"));\n }\n LogText::Log(\"logged 3\");\n EXPECT_THAT(text_logger1.GetLinesUnsafe(),\n ElementsAre(\"logged 1\", \"logged 3\"));\n}\n\nTEST(ThreadCaptureTest, ThreadsAreNotCrossed) {\n LogText logger;\n LogText::Log(\"logged 1\");\n\n std::thread worker([] {\n LogText::Log(\"logged 2\");\n });\n worker.join();\n\n EXPECT_THAT(logger.GetLinesUnsafe(), ElementsAre(\"logged 1\"));\n}\n\nTEST(ThreadCrosserTest, WrapCallIsFineWithoutLogger) {\n bool called = false;\n ThreadCrosser::WrapCall([&called] {\n called = true;\n LogText::Log(\"not logged\");\n })();\n EXPECT_TRUE(called);\n}\n\nTEST(ThreadCrosserTest, WrapCallWithNullCallbackIsNull) {\n EXPECT_FALSE(ThreadCrosser::WrapCall(nullptr));\n LogText logger;\n EXPECT_FALSE(ThreadCrosser::WrapCall(nullptr));\n}\n\nTEST(ThreadCrosserTest, SingleThreadCrossing) {\n LogText logger;\n LogText::Log(\"logged 1\");\n\n std::thread worker(ThreadCrosser::WrapCall([] {\n LogText::Log(\"logged 2\");\n }));\n worker.join();\n\n EXPECT_THAT(logger.GetLinesUnsafe(), ElementsAre(\"logged 1\", \"logged 2\"));\n}\n\nTEST(ThreadCrosserTest, MultipleThreadCrossingWithMultipleLoggers) {\n LogText text_logger;\n LogText::Log(\"logged 1\");\n LogValues count_logger;\n LogValues::Count(1);\n\n std::thread worker(ThreadCrosser::WrapCall([] {\n std::thread worker(ThreadCrosser::WrapCall([] {\n LogText::Log(\"logged 2\");\n LogValues::Count(2);\n }));\n worker.join();\n }));\n worker.join();\n\n EXPECT_THAT(text_logger.GetLinesUnsafe(),\n ElementsAre(\"logged 1\", \"logged 2\"));\n EXPECT_THAT(count_logger.GetCountsUnsafe(), ElementsAre(1, 2));\n}\n\nTEST(ThreadCrosserTest, MultipleThreadCrossingWithDifferentLoggerScopes) {\n LogText text_logger;\n\n std::thread worker(ThreadCrosser::WrapCall([] {\n LogValues count_logger;\n std::thread worker(ThreadCrosser::WrapCall([] {\n LogText::Log(\"logged 1\");\n LogValues::Count(1);\n }));\n worker.join();\n EXPECT_THAT(count_logger.GetCountsUnsafe(), ElementsAre(1));\n }));\n worker.join();\n\n EXPECT_THAT(text_logger.GetLinesUnsafe(), ElementsAre(\"logged 1\"));\n}\n\nTEST(ThreadCrosserTest, DifferentLoggersInSameThread) {\n BlockingCallbackQueue queue;\n\n std::thread worker([&queue] {\n while (true) {\n LogText logger;\n if (!queue.PopAndCall()) {\n break;\n }\n LogText::Log(\"logged in thread\");\n EXPECT_THAT(logger.GetLinesUnsafe(), ElementsAre(\"logged in thread\"));\n }\n });\n\n LogText logger1;\n queue.Push(ThreadCrosser::WrapCall([] {\n LogText::Log(\"logged 1\");\n }));\n queue.WaitUntilEmpty();\n EXPECT_THAT(logger1.GetLinesUnsafe(), ElementsAre(\"logged 1\"));\n\n {\n \/\/ It's important for the test case that logger2 overrides logger1, i.e.,\n \/\/ that they are both in scope at the same time.\n LogText logger2;\n queue.Push(ThreadCrosser::WrapCall([] {\n LogText::Log(\"logged 2\");\n }));\n queue.WaitUntilEmpty();\n EXPECT_THAT(logger2.GetLinesUnsafe(), ElementsAre(\"logged 2\"));\n }\n\n queue.Push(ThreadCrosser::WrapCall([] {\n LogText::Log(\"logged 3\");\n }));\n queue.WaitUntilEmpty();\n EXPECT_THAT(logger1.GetLinesUnsafe(), ElementsAre(\"logged 1\", \"logged 3\"));\n\n queue.Push(nullptr); \/\/ (Causes the thread to exit.)\n worker.join();\n}\n\nint main(int argc, char *argv[]) {\n testing::InitGoogleTest(&argc, argv);\n return RUN_ALL_TESTS();\n}\n<|endoftext|>"} {"text":"<commit_before>\/\/ Copyright (c) 2009-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 \"random.h\"\n\n#include \"crypto\/sha512.h\"\n#include \"support\/cleanse.h\"\n#ifdef WIN32\n#include \"compat.h\" \/\/ for Windows API\n#include <wincrypt.h>\n#endif\n#include \"util.h\" \/\/ for LogPrint()\n#include \"utilstrencodings.h\" \/\/ for GetTime()\n\n#include <stdlib.h>\n#include <limits>\n\n#ifndef WIN32\n#include <sys\/time.h>\n#endif\n\n#ifdef HAVE_SYS_GETRANDOM\n#include <sys\/syscall.h>\n#include <linux\/random.h>\n#endif\n#ifdef HAVE_GETENTROPY\n#include <unistd.h>\n#endif\n#ifdef HAVE_SYSCTL_ARND\n#include <sys\/sysctl.h>\n#endif\n\n#include <openssl\/err.h>\n#include <openssl\/rand.h>\n\nstatic void RandFailure()\n{\n LogPrintf(\"Failed to read randomness, aborting\\n\");\n abort();\n}\n\nstatic inline int64_t GetPerformanceCounter()\n{\n int64_t nCounter = 0;\n#ifdef WIN32\n QueryPerformanceCounter((LARGE_INTEGER*)&nCounter);\n#else\n timeval t;\n gettimeofday(&t, NULL);\n nCounter = (int64_t)(t.tv_sec * 1000000 + t.tv_usec);\n#endif\n return nCounter;\n}\n\nvoid RandAddSeed()\n{\n \/\/ Seed with CPU performance counter\n int64_t nCounter = GetPerformanceCounter();\n RAND_add(&nCounter, sizeof(nCounter), 1.5);\n memory_cleanse((void*)&nCounter, sizeof(nCounter));\n}\n\nstatic void RandAddSeedPerfmon()\n{\n RandAddSeed();\n\n#ifdef WIN32\n \/\/ Don't need this on Linux, OpenSSL automatically uses \/dev\/urandom\n \/\/ Seed with the entire set of perfmon data\n\n \/\/ This can take up to 2 seconds, so only do it every 10 minutes\n static int64_t nLastPerfmon;\n if (GetTime() < nLastPerfmon + 10 * 60)\n return;\n nLastPerfmon = GetTime();\n\n std::vector<unsigned char> vData(250000, 0);\n long ret = 0;\n unsigned long nSize = 0;\n const size_t nMaxSize = 10000000; \/\/ Bail out at more than 10MB of performance data\n while (true) {\n nSize = vData.size();\n ret = RegQueryValueExA(HKEY_PERFORMANCE_DATA, \"Global\", NULL, NULL, vData.data(), &nSize);\n if (ret != ERROR_MORE_DATA || vData.size() >= nMaxSize)\n break;\n vData.resize(std::max((vData.size() * 3) \/ 2, nMaxSize)); \/\/ Grow size of buffer exponentially\n }\n RegCloseKey(HKEY_PERFORMANCE_DATA);\n if (ret == ERROR_SUCCESS) {\n RAND_add(vData.data(), nSize, nSize \/ 100.0);\n memory_cleanse(vData.data(), nSize);\n LogPrint(\"rand\", \"%s: %lu bytes\\n\", __func__, nSize);\n } else {\n static bool warned = false; \/\/ Warn only once\n if (!warned) {\n LogPrintf(\"%s: Warning: RegQueryValueExA(HKEY_PERFORMANCE_DATA) failed with code %i\\n\", __func__, ret);\n warned = true;\n }\n }\n#endif\n}\n\n\/** Get 32 bytes of system entropy. *\/\nvoid GetOSRand(unsigned char *ent32)\n{\n#if defined(WIN32)\n HCRYPTPROV hProvider;\n int ret = CryptAcquireContextW(&hProvider, NULL, NULL, PROV_RSA_FULL, CRYPT_VERIFYCONTEXT);\n if (!ret) {\n RandFailure();\n }\n ret = CryptGenRandom(hProvider, NUM_OS_RANDOM_BYTES, ent32);\n if (!ret) {\n RandFailure();\n }\n CryptReleaseContext(hProvider, 0);\n#elif defined(HAVE_SYS_GETRANDOM)\n \/* Linux. From the getrandom(2) man page:\n * \"If the urandom source has been initialized, reads of up to 256 bytes\n * will always return as many bytes as requested and will not be\n * interrupted by signals.\"\n *\/\n if (syscall(SYS_getrandom, ent32, NUM_OS_RANDOM_BYTES, 0) != NUM_OS_RANDOM_BYTES) {\n RandFailure();\n }\n#elif defined(HAVE_GETENTROPY)\n \/* On OpenBSD this can return up to 256 bytes of entropy, will return an\n * error if more are requested.\n * The call cannot return less than the requested number of bytes.\n *\/\n if (getentropy(ent32, NUM_OS_RANDOM_BYTES) != 0) {\n RandFailure();\n }\n#elif defined(HAVE_SYSCTL_ARND)\n \/* FreeBSD and similar. It is possible for the call to return less\n * bytes than requested, so need to read in a loop.\n *\/\n static const int name[2] = {CTL_KERN, KERN_ARND};\n int have = 0;\n do {\n size_t len = NUM_OS_RANDOM_BYTES - have;\n if (sysctl(name, ARRAYLEN(name), ent32 + have, &len, NULL, 0) != 0) {\n RandFailure();\n }\n have += len;\n } while (have < NUM_OS_RANDOM_BYTES);\n#else\n \/* Fall back to \/dev\/urandom if there is no specific method implemented to\n * get system entropy for this OS.\n *\/\n int f = open(\"\/dev\/urandom\", O_RDONLY);\n if (f == -1) {\n RandFailure();\n }\n int have = 0;\n do {\n ssize_t n = read(f, ent32 + have, NUM_OS_RANDOM_BYTES - have);\n if (n <= 0 || n + have > NUM_OS_RANDOM_BYTES) {\n RandFailure();\n }\n have += n;\n } while (have < NUM_OS_RANDOM_BYTES);\n close(f);\n#endif\n}\n\nvoid GetRandBytes(unsigned char* buf, int num)\n{\n if (RAND_bytes(buf, num) != 1) {\n RandFailure();\n }\n}\n\nvoid GetStrongRandBytes(unsigned char* out, int num)\n{\n assert(num <= 32);\n CSHA512 hasher;\n unsigned char buf[64];\n\n \/\/ First source: OpenSSL's RNG\n RandAddSeedPerfmon();\n GetRandBytes(buf, 32);\n hasher.Write(buf, 32);\n\n \/\/ Second source: OS RNG\n GetOSRand(buf);\n hasher.Write(buf, 32);\n\n \/\/ Produce output\n hasher.Finalize(buf);\n memcpy(out, buf, num);\n memory_cleanse(buf, 64);\n}\n\nuint64_t GetRand(uint64_t nMax)\n{\n if (nMax == 0)\n return 0;\n\n \/\/ The range of the random source must be a multiple of the modulus\n \/\/ to give every possible output value an equal possibility\n uint64_t nRange = (std::numeric_limits<uint64_t>::max() \/ nMax) * nMax;\n uint64_t nRand = 0;\n do {\n GetRandBytes((unsigned char*)&nRand, sizeof(nRand));\n } while (nRand >= nRange);\n return (nRand % nMax);\n}\n\nint GetRandInt(int nMax)\n{\n return GetRand(nMax);\n}\n\nuint256 GetRandHash()\n{\n uint256 hash;\n GetRandBytes((unsigned char*)&hash, sizeof(hash));\n return hash;\n}\n\nuint32_t insecure_rand_Rz = 11;\nuint32_t insecure_rand_Rw = 11;\nvoid seed_insecure_rand(bool fDeterministic)\n{\n \/\/ The seed values have some unlikely fixed points which we avoid.\n if (fDeterministic) {\n insecure_rand_Rz = insecure_rand_Rw = 11;\n } else {\n uint32_t tmp;\n do {\n GetRandBytes((unsigned char*)&tmp, 4);\n } while (tmp == 0 || tmp == 0x9068ffffU);\n insecure_rand_Rz = tmp;\n do {\n GetRandBytes((unsigned char*)&tmp, 4);\n } while (tmp == 0 || tmp == 0x464fffffU);\n insecure_rand_Rw = tmp;\n }\n}\n\nbool Random_SanityCheck()\n{\n \/* This does not measure the quality of randomness, but it does test that\n * OSRandom() overwrites all 32 bytes of the output given a maximum\n * number of tries.\n *\/\n static const ssize_t MAX_TRIES = 1024;\n uint8_t data[NUM_OS_RANDOM_BYTES];\n bool overwritten[NUM_OS_RANDOM_BYTES] = {}; \/* Tracks which bytes have been overwritten at least once *\/\n int num_overwritten;\n int tries = 0;\n \/* Loop until all bytes have been overwritten at least once, or max number tries reached *\/\n do {\n memset(data, 0, NUM_OS_RANDOM_BYTES);\n GetOSRand(data);\n for (int x=0; x < NUM_OS_RANDOM_BYTES; ++x) {\n overwritten[x] |= (data[x] != 0);\n }\n\n num_overwritten = 0;\n for (int x=0; x < NUM_OS_RANDOM_BYTES; ++x) {\n if (overwritten[x]) {\n num_overwritten += 1;\n }\n }\n\n tries += 1;\n } while (num_overwritten < NUM_OS_RANDOM_BYTES && tries < MAX_TRIES);\n return (num_overwritten == NUM_OS_RANDOM_BYTES); \/* If this failed, bailed out after too many tries *\/\n}\n<commit_msg>random: Add fallback if getrandom syscall not available<commit_after>\/\/ Copyright (c) 2009-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 \"random.h\"\n\n#include \"crypto\/sha512.h\"\n#include \"support\/cleanse.h\"\n#ifdef WIN32\n#include \"compat.h\" \/\/ for Windows API\n#include <wincrypt.h>\n#endif\n#include \"util.h\" \/\/ for LogPrint()\n#include \"utilstrencodings.h\" \/\/ for GetTime()\n\n#include <stdlib.h>\n#include <limits>\n\n#ifndef WIN32\n#include <sys\/time.h>\n#endif\n\n#ifdef HAVE_SYS_GETRANDOM\n#include <sys\/syscall.h>\n#include <linux\/random.h>\n#endif\n#ifdef HAVE_GETENTROPY\n#include <unistd.h>\n#endif\n#ifdef HAVE_SYSCTL_ARND\n#include <sys\/sysctl.h>\n#endif\n\n#include <openssl\/err.h>\n#include <openssl\/rand.h>\n\nstatic void RandFailure()\n{\n LogPrintf(\"Failed to read randomness, aborting\\n\");\n abort();\n}\n\nstatic inline int64_t GetPerformanceCounter()\n{\n int64_t nCounter = 0;\n#ifdef WIN32\n QueryPerformanceCounter((LARGE_INTEGER*)&nCounter);\n#else\n timeval t;\n gettimeofday(&t, NULL);\n nCounter = (int64_t)(t.tv_sec * 1000000 + t.tv_usec);\n#endif\n return nCounter;\n}\n\nvoid RandAddSeed()\n{\n \/\/ Seed with CPU performance counter\n int64_t nCounter = GetPerformanceCounter();\n RAND_add(&nCounter, sizeof(nCounter), 1.5);\n memory_cleanse((void*)&nCounter, sizeof(nCounter));\n}\n\nstatic void RandAddSeedPerfmon()\n{\n RandAddSeed();\n\n#ifdef WIN32\n \/\/ Don't need this on Linux, OpenSSL automatically uses \/dev\/urandom\n \/\/ Seed with the entire set of perfmon data\n\n \/\/ This can take up to 2 seconds, so only do it every 10 minutes\n static int64_t nLastPerfmon;\n if (GetTime() < nLastPerfmon + 10 * 60)\n return;\n nLastPerfmon = GetTime();\n\n std::vector<unsigned char> vData(250000, 0);\n long ret = 0;\n unsigned long nSize = 0;\n const size_t nMaxSize = 10000000; \/\/ Bail out at more than 10MB of performance data\n while (true) {\n nSize = vData.size();\n ret = RegQueryValueExA(HKEY_PERFORMANCE_DATA, \"Global\", NULL, NULL, vData.data(), &nSize);\n if (ret != ERROR_MORE_DATA || vData.size() >= nMaxSize)\n break;\n vData.resize(std::max((vData.size() * 3) \/ 2, nMaxSize)); \/\/ Grow size of buffer exponentially\n }\n RegCloseKey(HKEY_PERFORMANCE_DATA);\n if (ret == ERROR_SUCCESS) {\n RAND_add(vData.data(), nSize, nSize \/ 100.0);\n memory_cleanse(vData.data(), nSize);\n LogPrint(\"rand\", \"%s: %lu bytes\\n\", __func__, nSize);\n } else {\n static bool warned = false; \/\/ Warn only once\n if (!warned) {\n LogPrintf(\"%s: Warning: RegQueryValueExA(HKEY_PERFORMANCE_DATA) failed with code %i\\n\", __func__, ret);\n warned = true;\n }\n }\n#endif\n}\n\n#ifndef WIN32\n\/** Fallback: get 32 bytes of system entropy from \/dev\/urandom. The most\n * compatible way to get cryptographic randomness on UNIX-ish platforms.\n *\/\nvoid GetDevURandom(unsigned char *ent32)\n{\n int f = open(\"\/dev\/urandom\", O_RDONLY);\n if (f == -1) {\n RandFailure();\n }\n int have = 0;\n do {\n ssize_t n = read(f, ent32 + have, NUM_OS_RANDOM_BYTES - have);\n if (n <= 0 || n + have > NUM_OS_RANDOM_BYTES) {\n RandFailure();\n }\n have += n;\n } while (have < NUM_OS_RANDOM_BYTES);\n close(f);\n}\n#endif\n\n\/** Get 32 bytes of system entropy. *\/\nvoid GetOSRand(unsigned char *ent32)\n{\n#if defined(WIN32)\n HCRYPTPROV hProvider;\n int ret = CryptAcquireContextW(&hProvider, NULL, NULL, PROV_RSA_FULL, CRYPT_VERIFYCONTEXT);\n if (!ret) {\n RandFailure();\n }\n ret = CryptGenRandom(hProvider, NUM_OS_RANDOM_BYTES, ent32);\n if (!ret) {\n RandFailure();\n }\n CryptReleaseContext(hProvider, 0);\n#elif defined(HAVE_SYS_GETRANDOM)\n \/* Linux. From the getrandom(2) man page:\n * \"If the urandom source has been initialized, reads of up to 256 bytes\n * will always return as many bytes as requested and will not be\n * interrupted by signals.\"\n *\/\n int rv = syscall(SYS_getrandom, ent32, NUM_OS_RANDOM_BYTES, 0);\n if (rv != NUM_OS_RANDOM_BYTES) {\n if (rv < 0 && errno == ENOSYS) {\n \/* Fallback for kernel <3.17: the return value will be -1 and errno\n * ENOSYS if the syscall is not available, in that case fall back\n * to \/dev\/urandom.\n *\/\n GetDevURandom(ent32);\n } else {\n RandFailure();\n }\n }\n#elif defined(HAVE_GETENTROPY)\n \/* On OpenBSD this can return up to 256 bytes of entropy, will return an\n * error if more are requested.\n * The call cannot return less than the requested number of bytes.\n *\/\n if (getentropy(ent32, NUM_OS_RANDOM_BYTES) != 0) {\n RandFailure();\n }\n#elif defined(HAVE_SYSCTL_ARND)\n \/* FreeBSD and similar. It is possible for the call to return less\n * bytes than requested, so need to read in a loop.\n *\/\n static const int name[2] = {CTL_KERN, KERN_ARND};\n int have = 0;\n do {\n size_t len = NUM_OS_RANDOM_BYTES - have;\n if (sysctl(name, ARRAYLEN(name), ent32 + have, &len, NULL, 0) != 0) {\n RandFailure();\n }\n have += len;\n } while (have < NUM_OS_RANDOM_BYTES);\n#else\n \/* Fall back to \/dev\/urandom if there is no specific method implemented to\n * get system entropy for this OS.\n *\/\n GetDevURandom(ent32);\n#endif\n}\n\nvoid GetRandBytes(unsigned char* buf, int num)\n{\n if (RAND_bytes(buf, num) != 1) {\n RandFailure();\n }\n}\n\nvoid GetStrongRandBytes(unsigned char* out, int num)\n{\n assert(num <= 32);\n CSHA512 hasher;\n unsigned char buf[64];\n\n \/\/ First source: OpenSSL's RNG\n RandAddSeedPerfmon();\n GetRandBytes(buf, 32);\n hasher.Write(buf, 32);\n\n \/\/ Second source: OS RNG\n GetOSRand(buf);\n hasher.Write(buf, 32);\n\n \/\/ Produce output\n hasher.Finalize(buf);\n memcpy(out, buf, num);\n memory_cleanse(buf, 64);\n}\n\nuint64_t GetRand(uint64_t nMax)\n{\n if (nMax == 0)\n return 0;\n\n \/\/ The range of the random source must be a multiple of the modulus\n \/\/ to give every possible output value an equal possibility\n uint64_t nRange = (std::numeric_limits<uint64_t>::max() \/ nMax) * nMax;\n uint64_t nRand = 0;\n do {\n GetRandBytes((unsigned char*)&nRand, sizeof(nRand));\n } while (nRand >= nRange);\n return (nRand % nMax);\n}\n\nint GetRandInt(int nMax)\n{\n return GetRand(nMax);\n}\n\nuint256 GetRandHash()\n{\n uint256 hash;\n GetRandBytes((unsigned char*)&hash, sizeof(hash));\n return hash;\n}\n\nuint32_t insecure_rand_Rz = 11;\nuint32_t insecure_rand_Rw = 11;\nvoid seed_insecure_rand(bool fDeterministic)\n{\n \/\/ The seed values have some unlikely fixed points which we avoid.\n if (fDeterministic) {\n insecure_rand_Rz = insecure_rand_Rw = 11;\n } else {\n uint32_t tmp;\n do {\n GetRandBytes((unsigned char*)&tmp, 4);\n } while (tmp == 0 || tmp == 0x9068ffffU);\n insecure_rand_Rz = tmp;\n do {\n GetRandBytes((unsigned char*)&tmp, 4);\n } while (tmp == 0 || tmp == 0x464fffffU);\n insecure_rand_Rw = tmp;\n }\n}\n\nbool Random_SanityCheck()\n{\n \/* This does not measure the quality of randomness, but it does test that\n * OSRandom() overwrites all 32 bytes of the output given a maximum\n * number of tries.\n *\/\n static const ssize_t MAX_TRIES = 1024;\n uint8_t data[NUM_OS_RANDOM_BYTES];\n bool overwritten[NUM_OS_RANDOM_BYTES] = {}; \/* Tracks which bytes have been overwritten at least once *\/\n int num_overwritten;\n int tries = 0;\n \/* Loop until all bytes have been overwritten at least once, or max number tries reached *\/\n do {\n memset(data, 0, NUM_OS_RANDOM_BYTES);\n GetOSRand(data);\n for (int x=0; x < NUM_OS_RANDOM_BYTES; ++x) {\n overwritten[x] |= (data[x] != 0);\n }\n\n num_overwritten = 0;\n for (int x=0; x < NUM_OS_RANDOM_BYTES; ++x) {\n if (overwritten[x]) {\n num_overwritten += 1;\n }\n }\n\n tries += 1;\n } while (num_overwritten < NUM_OS_RANDOM_BYTES && tries < MAX_TRIES);\n return (num_overwritten == NUM_OS_RANDOM_BYTES); \/* If this failed, bailed out after too many tries *\/\n}\n<|endoftext|>"} {"text":"<commit_before>#include \"MenuComponent.hpp\"\n#include \"GameEngine\/GameEngine.h\"\n#include \"SpriteComponent.hpp\"\n#include \"FileSystem\/ImagePreloadingMapper.hpp\"\n#include \"Events\/UIChangeEvent.hpp\"\n#include \"Events\/UISelectEvent.hpp\"\n#include \"GameEngine\/Utilities.hpp\"\n\n\n\nnamespace ASSB\n{\n\t\/\/ Constructor\n\tMenuComponent::MenuComponent(Globals::ObjectID owner, std::string indicatorTag, bool vertical)\n\t\t: Component(owner)\n\t\t, active_(true)\n\t\t, selected_(0)\n\t\t, spacing_({ 0, -1, 0 })\n\t\t, pos_({ 0, 0, 0 })\n\t\t, selectionIndicator_()\n\t\t, interactables_()\n\t\t, vertical_(vertical)\n\t{\n\t\tselectionIndicator_ = GameEngine::Instance->CreateGameObject();\n\t\tSetIndicatorTag(indicatorTag, { 1,1,0 });\n\n\t\t\/\/ Connect Events\n\t\tConnect(this, &MenuComponent::handleKeyboardEvent);\n\t}\n\n\tvoid MenuComponent::SetVisible(bool isVisible)\n\t{\n\t\tif (isVisible == false)\n\t\t{\n\t\t\tfor (size_t i = 0; i < interactables_.size(); ++i)\n\t\t\t{\n\t\t\t\tGameEngine::Instance->GetComponent<SpriteComponent>(interactables_[i].first)\n\t\t\t\t\t->Visible = false;\n\t\t\t}\n\t\t\tGameEngine::Instance->GetComponent<SpriteComponent>(selectionIndicator_)->Visible = false;\n\t\t}\n\t\telse\n\t\t{\n\t\t\tfor (size_t i = 0; i < interactables_.size(); ++i)\n\t\t\t{\n\t\t\t\tGameEngine::Instance->GetComponent<SpriteComponent>(interactables_[i].first)\n\t\t\t\t\t->Visible = true;\n\t\t\t}\n\t\t\tGameEngine::Instance->GetComponent<SpriteComponent>(selectionIndicator_)->Visible = true;\n\t\t}\n\t}\n\n\tvoid MenuComponent::SetActive(bool isActive)\n\t{\n\t\tactive_ = isActive;\n\t}\n\n\tbool MenuComponent::IsActive()\n\t{\n\t\treturn active_;\n\t}\n\t\/\/ 0-based indexing into the array\n\tvoid MenuComponent::SetIndicated(int index)\n\t{\n\t\tif (index < 0)\n\t\t\tindex = 0;\n\t\tif (index > static_cast<int>(interactables_.size()) - 1)\n\t\t\tindex = static_cast<int>(interactables_.size()) - 1;\n\t\t\n\t\tselected_ = index;\n\t}\n\n\n\t\/\/ Selects the current index, dispatching the associated event.\n\tvoid MenuComponent::Select()\n\t{\n\t\tGlobals::EventSystemInstance.Dispatch(new UISelectEvent());\n\t\tinteractables_[static_cast<size_t>(selected_)].second->Dispatch();\n\t}\n\n\n\t\/\/ Keyboard event callback\n\tvoid MenuComponent::handleKeyboardEvent(KeyboardEvent *e)\n\t{\n\t\tif (active_)\n\t\t{\n\t\t\tif(e->Down)\n\t\t\t{\n\t\t\t\tconst Key k{ e->Key };\n\t\t\t\tif (vertical_)\n\t\t\t\t{\n\t\t\t\t\tif (k == Key::S || k == Key::Down || k == Key::Numpad_2)\n\t\t\t\t\t\tIncrementIndicated();\n\t\t\t\t\telse if (k == Key::W || k == Key::Up || k == Key::Numpad_8)\n\t\t\t\t\t\tDectementIndicated();\n\t\t\t\t}\n\t\t\t\telse \/\/ Horizontal\n\t\t\t\t{\n\t\t\t\t\tif (k == Key::D || k == Key::Right || k == Key::Numpad_6)\n\t\t\t\t\t\tIncrementIndicated();\n\t\t\t\t\telse if (k == Key::A || k == Key::Left || k == Key::Numpad_4)\n\t\t\t\t\t\tDectementIndicated();\n\t\t\t\t}\n\n\t\t\t\t\/\/ Key selected\n\t\t\t\tif (k == Key::Enter || k == Key::Space || k == Key::Numpad_Enter)\n\t\t\t\t\tSelect();\n\t\t\t}\n\t\t}\n\t}\n\n\n\t\/\/ Updates location of selection indicator to position of the new item\n\tvoid MenuComponent::updateSelectionIndicator()\n\t{\n\t\tComponentHandle<TransformComponent> indicatorLoc = GameEngine::Instance->GetComponent<TransformComponent>(selectionIndicator_);\n\t\tComponentHandle<TransformComponent> interactableLoc = GameEngine::Instance->GetComponent<TransformComponent>(interactables_[static_cast<size_t>(selected_)].first);\n\t\t\/\/!TODO: ACTIONS SYSTEM FOR INTERPOLATION\n\t\tUtilities::Instance->InterpolatePos(selectionIndicator_, interactableLoc->GetPosition(), 80);\n\t\t\/\/indicatorLoc->SetPosition(interactableLoc->GetPosition());\n\t}\n\n\n\t\/\/ Increments the position: Goes Down or Right\n\tvoid MenuComponent::IncrementIndicated()\n\t{\n\t\t++selected_;\n\t\tif (selected_ >= static_cast<int>(interactables_.size()))\n\t\t selected_ = 0;\n\n\t\tGlobals::EventSystemInstance.Dispatch(new UIChangeEvent());\n\t\tupdateSelectionIndicator();\n\t}\n\n\n\t\/\/ Decrements the positon: Goes Up or Left.\n\tvoid MenuComponent::DectementIndicated()\n\t{\n\t\t--selected_;\n\t\tif (selected_ < 0)\n\t\t\tselected_ = static_cast<int>(interactables_.size()) - 1;\n\n\t\tGlobals::EventSystemInstance.Dispatch(new UIChangeEvent());\n\t\tupdateSelectionIndicator();\n\t}\n\n\n\t\/\/ Updates the selection location\n\tvoid MenuComponent::updateSpacing()\n\t{\n\t\tfor (size_t i = 0; i < interactables_.size(); ++i)\n\t\t{\n\t\t\tGameEngine::Instance->GetComponent<TransformComponent>(interactables_[i].first)->\n\t\t\t\tSetPosition(pos_ + spacing_ * static_cast<float>(i));\n\t\t}\n\t}\n\n\t\/\/ Getters and Setters\n\tvoid MenuComponent::SetIndicatorTag(std::string indicatorTag, Graphics::Vector4 scale)\n\t{\n\t\tif (indicatorTag.size() > 0)\n\t\t{\n\t\t\tstd::string path = FileSystem::ImagePreloadingMapper::Retrieve(indicatorTag);\n\t\t\tif (path.size() > 0)\n\t\t\t{\n\t\t\t\tGameEngine::Instance->GetComponent<SpriteComponent>(selectionIndicator_)->\n\t\t\t\t\tAddPath(std::wstring(path.begin(), path.end()));\n\t\t\t\tGameEngine::Instance->GetComponent<TransformComponent>(selectionIndicator_)->\n\t\t\t\t\tSetScale(scale.X, scale.Y);\n\t\t\t}\n\t\t}\n\t}\n\tvoid MenuComponent::SetVertical(bool isVertical)\n\t{\n\t\tvertical_ = isVertical;\n\t}\n\tbool MenuComponent::IsVertical()\n\t{\n\t\treturn vertical_;\n\t}\n\tvoid MenuComponent::SetSpacing(Graphics::Vector4 spacingVal)\n\t{\n\t\tspacing_ = spacingVal;\n\t}\n\tvoid MenuComponent::SetPosition(Graphics::Vector4 newPos)\n\t{\n\t\tpos_ = newPos;\n\t}\n\tGraphics::Vector4 MenuComponent::GetPosition()\n\t{\n\t\treturn pos_;\n\t}\n\tint MenuComponent::GetIndicated()\n\t{\n\t\treturn selected_;\n\t}\n\tGraphics::Vector4 MenuComponent::GetSpacing()\n\t{\n\t\treturn spacing_;\n\t}\n}<commit_msg>+ Moved to front<commit_after>#include \"MenuComponent.hpp\"\n#include \"GameEngine\/GameEngine.h\"\n#include \"SpriteComponent.hpp\"\n#include \"FileSystem\/ImagePreloadingMapper.hpp\"\n#include \"Events\/UIChangeEvent.hpp\"\n#include \"Events\/UISelectEvent.hpp\"\n#include \"GameEngine\/Utilities.hpp\"\n\n\n\nnamespace ASSB\n{\n\t\/\/ Constructor\n\tMenuComponent::MenuComponent(Globals::ObjectID owner, std::string indicatorTag, bool vertical)\n\t\t: Component(owner)\n\t\t, active_(true)\n\t\t, selected_(0)\n\t\t, spacing_({ 0, -1, 0 })\n\t\t, pos_({ 0, 0, 0 })\n\t\t, selectionIndicator_()\n\t\t, interactables_()\n\t\t, vertical_(vertical)\n\t{\n\t\tselectionIndicator_ = GameEngine::Instance->CreateGameObject();\n\t\tSetIndicatorTag(indicatorTag, { 1,1,0 });\n\n\t\t\/\/ Connect Events\n\t\tConnect(this, &MenuComponent::handleKeyboardEvent);\n\t}\n\n\tvoid MenuComponent::SetVisible(bool isVisible)\n\t{\n\t\tif (isVisible == false)\n\t\t{\n\t\t\tfor (size_t i = 0; i < interactables_.size(); ++i)\n\t\t\t{\n\t\t\t\tGameEngine::Instance->GetComponent<SpriteComponent>(interactables_[i].first)\n\t\t\t\t\t->Visible = false;\n\t\t\t}\n\t\t\tGameEngine::Instance->GetComponent<SpriteComponent>(selectionIndicator_)->Visible = false;\n\t\t}\n\t\telse\n\t\t{\n\t\t\tfor (size_t i = 0; i < interactables_.size(); ++i)\n\t\t\t{\n\t\t\t\tGameEngine::Instance->GetComponent<SpriteComponent>(interactables_[i].first)\n\t\t\t\t\t->Visible = true;\n\t\t\t}\n\t\t\tGameEngine::Instance->GetComponent<SpriteComponent>(selectionIndicator_)->Visible = true;\n\t\t}\n\t}\n\n\tvoid MenuComponent::SetActive(bool isActive)\n\t{\n\t\tactive_ = isActive;\n\t}\n\n\tbool MenuComponent::IsActive()\n\t{\n\t\treturn active_;\n\t}\n\t\/\/ 0-based indexing into the array\n\tvoid MenuComponent::SetIndicated(int index)\n\t{\n\t\tif (index < 0)\n\t\t\tindex = 0;\n\t\tif (index > static_cast<int>(interactables_.size()) - 1)\n\t\t\tindex = static_cast<int>(interactables_.size()) - 1;\n\t\t\n\t\tselected_ = index;\n\t}\n\n\n\t\/\/ Selects the current index, dispatching the associated event.\n\tvoid MenuComponent::Select()\n\t{\n\t\tGlobals::EventSystemInstance.Dispatch(new UISelectEvent());\n\t\tinteractables_[static_cast<size_t>(selected_)].second->Dispatch();\n\t}\n\n\n\t\/\/ Keyboard event callback\n\tvoid MenuComponent::handleKeyboardEvent(KeyboardEvent *e)\n\t{\n\t\tif (active_)\n\t\t{\n\t\t\tif(e->Down)\n\t\t\t{\n\t\t\t\tconst Key k{ e->Key };\n\t\t\t\tif (vertical_)\n\t\t\t\t{\n\t\t\t\t\tif (k == Key::S || k == Key::Down || k == Key::Numpad_2)\n\t\t\t\t\t\tIncrementIndicated();\n\t\t\t\t\telse if (k == Key::W || k == Key::Up || k == Key::Numpad_8)\n\t\t\t\t\t\tDectementIndicated();\n\t\t\t\t}\n\t\t\t\telse \/\/ Horizontal\n\t\t\t\t{\n\t\t\t\t\tif (k == Key::D || k == Key::Right || k == Key::Numpad_6)\n\t\t\t\t\t\tIncrementIndicated();\n\t\t\t\t\telse if (k == Key::A || k == Key::Left || k == Key::Numpad_4)\n\t\t\t\t\t\tDectementIndicated();\n\t\t\t\t}\n\n\t\t\t\t\/\/ Key selected\n\t\t\t\tif (k == Key::Enter || k == Key::Space || k == Key::Numpad_Enter)\n\t\t\t\t\tSelect();\n\t\t\t}\n\t\t}\n\t}\n\n\n\t\/\/ Updates location of selection indicator to position of the new item\n\tvoid MenuComponent::updateSelectionIndicator()\n\t{\n\t\tComponentHandle<TransformComponent> indicatorLoc = GameEngine::Instance->GetComponent<TransformComponent>(selectionIndicator_);\n\t\tComponentHandle<TransformComponent> interactableLoc = GameEngine::Instance->GetComponent<TransformComponent>(interactables_[static_cast<size_t>(selected_)].first);\n\t\t\/\/!TODO: ACTIONS SYSTEM FOR INTERPOLATION\n\t\tUtilities::Instance->InterpolatePos(selectionIndicator_, interactableLoc->GetPosition() + Graphics::Vector4(0, 0, -0.6f), 80);\n\t\t\/\/indicatorLoc->SetPosition(interactableLoc->GetPosition());\n\t}\n\n\n\t\/\/ Increments the position: Goes Down or Right\n\tvoid MenuComponent::IncrementIndicated()\n\t{\n\t\t++selected_;\n\t\tif (selected_ >= static_cast<int>(interactables_.size()))\n\t\t selected_ = 0;\n\n\t\tGlobals::EventSystemInstance.Dispatch(new UIChangeEvent());\n\t\tupdateSelectionIndicator();\n\t}\n\n\n\t\/\/ Decrements the positon: Goes Up or Left.\n\tvoid MenuComponent::DectementIndicated()\n\t{\n\t\t--selected_;\n\t\tif (selected_ < 0)\n\t\t\tselected_ = static_cast<int>(interactables_.size()) - 1;\n\n\t\tGlobals::EventSystemInstance.Dispatch(new UIChangeEvent());\n\t\tupdateSelectionIndicator();\n\t}\n\n\n\t\/\/ Updates the selection location\n\tvoid MenuComponent::updateSpacing()\n\t{\n\t\tfor (size_t i = 0; i < interactables_.size(); ++i)\n\t\t{\n\t\t\tGameEngine::Instance->GetComponent<TransformComponent>(interactables_[i].first)->\n\t\t\t\tSetPosition(pos_ + spacing_ * static_cast<float>(i));\n\t\t}\n\t}\n\n\t\/\/ Getters and Setters\n\tvoid MenuComponent::SetIndicatorTag(std::string indicatorTag, Graphics::Vector4 scale)\n\t{\n\t\tif (indicatorTag.size() > 0)\n\t\t{\n\t\t\tstd::string path = FileSystem::ImagePreloadingMapper::Retrieve(indicatorTag);\n\t\t\tif (path.size() > 0)\n\t\t\t{\n\t\t\t\tGameEngine::Instance->GetComponent<SpriteComponent>(selectionIndicator_)->\n\t\t\t\t\tAddPath(std::wstring(path.begin(), path.end()));\n\t\t\t\tGameEngine::Instance->GetComponent<TransformComponent>(selectionIndicator_)->\n\t\t\t\t\tSetScale(scale.X, scale.Y);\n\t\t\t}\n\t\t}\n\t}\n\tvoid MenuComponent::SetVertical(bool isVertical)\n\t{\n\t\tvertical_ = isVertical;\n\t}\n\tbool MenuComponent::IsVertical()\n\t{\n\t\treturn vertical_;\n\t}\n\tvoid MenuComponent::SetSpacing(Graphics::Vector4 spacingVal)\n\t{\n\t\tspacing_ = spacingVal;\n\t}\n\tvoid MenuComponent::SetPosition(Graphics::Vector4 newPos)\n\t{\n\t\tpos_ = newPos;\n\t}\n\tGraphics::Vector4 MenuComponent::GetPosition()\n\t{\n\t\treturn pos_;\n\t}\n\tint MenuComponent::GetIndicated()\n\t{\n\t\treturn selected_;\n\t}\n\tGraphics::Vector4 MenuComponent::GetSpacing()\n\t{\n\t\treturn spacing_;\n\t}\n}<|endoftext|>"} {"text":"<commit_before>\/*\n * convey's game of life\n*\/\n\n#ifndef GOL_HPP\n#define GOL_HPP 1\n\n#include <iostream>\n#include <fstream>\n#include <cstdlib>\n\n#define GOL_WIDTH\t32\n#define\tGOL_HEIGHT\t32\n\nusing namespace std;\n\nclass gameOfLife {\n\tpublic:\n\t\tgameOfLife();\n\t\tvoid init_file (char*);\n\t\tvoid play();\n\tprivate:\n\t\tbool life[GOL_WIDTH][GOL_HEIGHT];\n\t\tvoid show();\n\t\tvoid nextgen();\n};\n\nvoid gameOfLife::show()\n{\n\tfor (int i = 0; i < GOL_HEIGHT; i++)\n\t{\n\t\tfor (int j = 0; j < GOL_WIDTH; j++)\n\t\t{\n\t\t\t(life[j][i]) ? cout << \" #\" : cout << \" \";\n\t\t}\n\t\tcout << '\\n';\n\t}\n}\n\nvoid gameOfLife::nextgen()\n{\n\t\/\/ analyze each pixel\n\tint neighbors[GOL_WIDTH][GOL_HEIGHT];\n\tfor (int i = 1; i < GOL_WIDTH - 1; i++)\n\t{\n\t\tfor (int j = 1; j < GOL_HEIGHT - 1; j++)\n\t\t{\n\t\t\t\/\/ calculate the number of neighbors of the pixel\n\t\t\t\/\/ The Moore neighborhood checks all 8 surrounding cells\n\t\t\tneighbors[i][j] = \n\t\t\t\tlife[i - 1][j - 1] +\n\t\t\t\tlife[i - 1][j] +\n\t\t\t\tlife[i - 1][j + 1] +\n\t\t\t\tlife[i][j - 1] +\n\t\t\t\tlife[i][j + 1] +\n\t\t\t\tlife[i + 1][j - 1] +\n\t\t\t\tlife[i + 1][j] +\n\t\t\t\tlife[i + 1][j + 1];\n\t\t}\n\t}\n\t\/\/ calculate the state of each pixel in the next generation\n\tfor (int i = 0; i < GOL_WIDTH; i++)\n\t\tfor (int j = 0; j < GOL_HEIGHT; j++)\n\t\t{\n\t\t\t\/\/ if it has 3 neighbors it comes to life\n\t\t\tif (neighbors[i][j] == 3)\n\t\t\t{\n\t\t\t\tlife[i][j] = true;\n\t\t\t}\n\t\t\t\/\/ if it has 2 neighbors it remains the same\n\t\t\t\/\/ every other senario it dies\n\t\t\telse if (neighbors[i][j] != 2)\n\t\t\t{\n\t\t\t\tlife[i][j] = false;\n\t\t\t}\n\t\t}\n}\n\ngameOfLife::gameOfLife()\n{\n\t\/\/ loop through every pixel and assign a random value to it\n\tsrand (time(NULL));\n\tfor (int i = 1; i < GOL_WIDTH - 1; i++)\n\t{\n\t\tfor (int j = 1; j < GOL_HEIGHT - 1; j++)\n\t\t{\n\t\t\tlife[i][j] = rand() % 2;\n\t\t}\n\t}\n}\n\nvoid gameOfLife::init_file (char* filename)\n{\n\t\/\/ loop through every non-whitespace charecter in a file and initialize the generation zero\n\tchar ch;\n\tcout << \"Initialized with \" << filename << \":\\n\";\n\tfstream fin(filename, fstream::in);\n\tfor (int j = 0; j < GOL_HEIGHT; j++)\n\t{\n\t\tfor (int i = 0; i < GOL_WIDTH; i++)\n\t\t{\n\t\t\tfin >> skipws >> ch;\n\t\t\tlife[i][j] = (ch == '#');\n\t\t}\n\t}\n}\n\nvoid gameOfLife::play()\n{\n\tfor (int gen = 0; true; gen++)\n\t{\n\t\tcout << \"Generation: \" << gen << '\\n';\n\t\tshow();\n\t\tnextgen();\n\t\t\/\/ intrupt to let the user see the results\n\t\tif (cin.get() == 'q') break;\n\t}\n}\n\n#endif\n<commit_msg>Added comments.<commit_after>\/*\n * convey's game of life\n*\/\n\n#ifndef GOL_HPP\n#define GOL_HPP 1\n\n#include <iostream>\n#include <fstream>\n#include <cstdlib>\n\n#define GOL_WIDTH\t32\n#define\tGOL_HEIGHT\t32\n\nusing namespace std;\n\nclass gameOfLife {\n\tpublic:\n\t\tgameOfLife();\n\t\tvoid init_file (char*);\n\t\tvoid play();\n\tprivate:\n\t\tbool life[GOL_WIDTH][GOL_HEIGHT];\n\t\tvoid show();\n\t\tvoid nextgen();\n};\n\nvoid gameOfLife::show()\n{\n\tfor (int i = 0; i < GOL_HEIGHT; i++)\n\t{\n\t\tfor (int j = 0; j < GOL_WIDTH; j++)\n\t\t{\n\t\t\t(life[j][i]) ? cout << \" #\" : cout << \" \";\n\t\t}\n\t\tcout << '\\n';\n\t}\n}\n\nvoid gameOfLife::nextgen()\n{\n\t\/\/ count every pixel's neighbors and store them in an array\n\tshort int neighbors[GOL_WIDTH][GOL_HEIGHT];\n\tfor (int i = 1; i < GOL_WIDTH - 1; i++)\n\t{\n\t\tfor (int j = 1; j < GOL_HEIGHT - 1; j++)\n\t\t{\n\t\t\t\/\/ calculate the number of neighbors of the pixel\n\t\t\t\/\/ The Moore neighborhood checks all 8 surrounding cells\n\t\t\tneighbors[i][j] = \n\t\t\t\tlife[i - 1][j - 1] +\n\t\t\t\tlife[i - 1][j] +\n\t\t\t\tlife[i - 1][j + 1] +\n\t\t\t\tlife[i][j - 1] +\n\t\t\t\tlife[i][j + 1] +\n\t\t\t\tlife[i + 1][j - 1] +\n\t\t\t\tlife[i + 1][j] +\n\t\t\t\tlife[i + 1][j + 1];\n\t\t}\n\t}\n\t\/\/ calculate the state of each pixel in the next generation\n\tfor (int i = 0; i < GOL_WIDTH; i++)\n\t\tfor (int j = 0; j < GOL_HEIGHT; j++)\n\t\t{\n\t\t\t\/\/ if it has 3 neighbors it comes to life\n\t\t\tif (neighbors[i][j] == 3)\n\t\t\t{\n\t\t\t\tlife[i][j] = true;\n\t\t\t}\n\t\t\t\/\/ if it has 2 neighbors it remains the same\n\t\t\t\/\/ every other senario it dies\n\t\t\telse if (neighbors[i][j] != 2)\n\t\t\t{\n\t\t\t\tlife[i][j] = false;\n\t\t\t}\n\t\t}\n}\n\ngameOfLife::gameOfLife()\n{\n\t\/\/ loop through every pixel and assign a random value to it\n\tsrand (time(NULL));\n\tfor (int i = 1; i < GOL_WIDTH - 1; i++)\n\t{\n\t\tfor (int j = 1; j < GOL_HEIGHT - 1; j++)\n\t\t{\n\t\t\tlife[i][j] = rand() % 2;\n\t\t}\n\t}\n}\n\nvoid gameOfLife::init_file (char* filename)\n{\n\t\/\/ loop through every non-whitespace charecter in a file and initialize the generation zero\n\tchar ch;\n\tcout << \"Initialized with \" << filename << \":\\n\";\n\tfstream fin(filename, fstream::in);\n\tfor (int j = 0; j < GOL_HEIGHT; j++)\n\t{\n\t\tfor (int i = 0; i < GOL_WIDTH; i++)\n\t\t{\n\t\t\tfin >> skipws >> ch;\n\t\t\tlife[i][j] = (ch == '#');\n\t\t}\n\t}\n}\n\nvoid gameOfLife::play()\n{\n\tfor (int gen = 0; true; gen++)\n\t{\n\t\tcout << \"Generation: \" << gen << '\\n';\n\t\tshow();\n\t\tnextgen();\n\t\t\/\/ intrupt to let the user see the results. enter 'q' to end the game.\n\t\tif (cin.get() == 'q') break;\n\t}\n}\n\n#endif\n<|endoftext|>"} {"text":"<commit_before>#include <iostream>\n#include <vector>\n\nusing namespace std;\n\nint main()\n{\n\tint s = 0, input = 0;\n\tvector<int> val;\n\tvector<int>::iterator ptr;\n\tcout<<\"Please enter as many integers as you like.\"<<endl;\n\tdo{\n\t\tcin>>input;\n\t\tval.push_back(input);\n\t\tcout<<\"Continue? (1 = Yes \/ 0 = No)\"<<endl;\n\t\tcin>>input;\n\t}while(input != 0);\n\tcout<<\"You have entered \"<<val.size()<<\" items.\"<<endl;\n\tcout<<\"The elements entered are:\"<<endl;\n\tfor(ptr = val.begin(); ptr != val.end(); ptr++)\n\t{\n\t\ts = s + (*ptr);\n\t\tcout<<*ptr<<endl;\n\t}\n\tcout<<\"The sum is \"<<s<<\".\"<<endl;\t \n\treturn 0;\n}<commit_msg>Update<commit_after>#include <iostream>\n#include <vector>\n\nusing namespace std;\n\nint main()\n{\n\tint s = 0, input = 0;\n\tvector<int> val;\n\tvector<int>::iterator ptr;\n\tcout<<\"Please enter as many integers as you like.Enter ESC followed by Return when you're done.\"<<endl;\n\twhile(cin>>input)\n\t\tval.push_back(input);\n\tcout<<\"You have entered \"<<val.size()<<\" items.\"<<endl;\n\tcout<<\"The elements entered are:\"<<endl;\n\tfor(ptr = val.begin(); ptr != val.end(); ptr++)\n\t{\n\t\ts = s + (*ptr);\n\t\tcout<<*ptr<<endl;\n\t}\n\tcout<<\"The sum is \"<<s<<\".\"<<endl;\t \n\treturn 0;\n}<|endoftext|>"} {"text":"<commit_before>#include <vector>\n#include <iostream>\n\nusing namespace std;\n\nint main() {\n vector<int> v(10, 0);\n vector<int>::iterator iter = v.begin();\n int counter = 7;\n for (; iter != v.end(); ++iter) {\n if (counter % 5 == 3) {\n iter = v.insert(iter, -1);\n }\n ++counter;\n }\n\n cout << v.size() << endl;\n\n for (size_t i = 0; i < v.size(); ++i) {\n cout << v[i] << \" \";\n }\n cout << endl;\n\n return 0;\n}\n<commit_msg>remove vector_test.cc<commit_after><|endoftext|>"} {"text":"<commit_before>\/*************************************************************************\n *\n * $RCSfile: ZipPackageFolder.hxx,v $\n *\n * $Revision: 1.16 $\n *\n * last change: $Author: mtg $ $Date: 2001-03-16 17:11: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): Martin Gallwey (gallwey@sun.com)\n *\n *\n ************************************************************************\/\n#ifndef _ZIP_PACKAGE_FOLDER_HXX\n#define _ZIP_PACKAGE_FOLDER_HXX\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_IO_XACTIVEDATASINK_HPP_\n#include <com\/sun\/star\/io\/XActiveDataSink.hpp>\n#endif\n\n#ifndef _COM_SUN_STAR_CONTAINER_XNAMECONTAINER_HPP_\n#include <com\/sun\/star\/container\/XNameContainer.hpp>\n#endif\n\n#ifndef _COM_SUN_STAR_CONTAINER_XENUMERATIONACCESS_HPP_\n#include <com\/sun\/star\/container\/XEnumerationAccess.hpp>\n#endif\n\n#ifndef _COM_SUN_STAR_PACKAGE_ZIPENTRY_HPP_\n#include <com\/sun\/star\/packages\/ZipEntry.hpp>\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_LANG_XUNOTUNNEl_HPP_\n#include <com\/sun\/star\/lang\/XUnoTunnel.hpp>\n#endif\n\n#ifndef _CPPUHELPER_TYPEPROVIDER_HXX_\n#include <cppuhelper\/typeprovider.hxx>\n#endif\n\n#ifndef _COM_SUN_STAR_LANG_XSINGLESERVICEFACTORY_HPP_\n#include <com\/sun\/star\/lang\/XSingleServiceFactory.hpp>\n#endif\n\n#include <hash_map>\n\nstruct eqFunc\n{\n sal_Bool operator()( const rtl::OUString &r1,\n const rtl::OUString &r2) const\n {\n return r1 == r2;\n }\n};\n\nstruct hashFunc\n{\n sal_Int32 operator()(const rtl::OUString &r1) const\n {\n return r1.hashCode();\n }\n};\ntypedef std::hash_map < rtl::OUString,\n com::sun::star::uno::Reference < com::sun::star::lang::XUnoTunnel >,\n hashFunc,\n eqFunc > TunnelHash;\n\ntypedef std::hash_map < rtl::OUString,\n com::sun::star::uno::Reference < com::sun::star::container::XNameContainer >,\n hashFunc,\n eqFunc > NameHash;\n\n\/* This include must be after the above struct and typedef declarations.\n * Ugly...but true :)\n *\/\n\n#ifndef _ZIP_PACKAGE_FOLDER_ENUMERATION_HXX\n#include \"ZipPackageFolderEnumeration.hxx\"\n#endif\n\n#ifndef _ZIP_PACKAGE_ENTRY_HXX\n#include \"ZipPackageEntry.hxx\"\n#endif\n\n#ifndef _ZIP_PACKAGE_STREAM_HXX\n#include \"ZipPackageStream.hxx\"\n#endif\n\n#ifndef _ZIP_PACKAGE_HXX\n#include \"ZipPackage.hxx\"\n#endif\n\n#ifndef _ZIP_PACKAGE_BUFFER_HXX\n#include \"ZipPackageBuffer.hxx\"\n#endif\n\n#ifndef _ZIP_OUTPUT_STREAM_HXX\n#include \"ZipOutputStream.hxx\"\n#endif\n\n#ifndef _ZIP_FILE_HXX\n#include \"ZipFile.hxx\"\n#endif\n\n#ifndef _MANIFEST_ENTRY_HXX\n#include \"ManifestEntry.hxx\"\n#endif\n\nclass ZipPackage;\nclass ZipPackageFolder : public ZipPackageEntry,\n public ::cppu::OWeakObject,\n public ::com::sun::star::container::XNameContainer,\n public ::com::sun::star::container::XEnumerationAccess\n{\nprivate:\n TunnelHash aContents;\npublic:\n ZipPackage *pPackage;\n com::sun::star::uno::Reference < com::sun::star::lang::XSingleServiceFactory > xPackage;\n\n ZipPackageFolder ( void );\n virtual ~ZipPackageFolder( void );\n\n static void copyZipEntry( com::sun::star::packages::ZipEntry &rDest, const com::sun::star::packages::ZipEntry &rSource);\n \/\/ Recursive functions\n void saveContents(rtl::OUString &rPath, std::vector < ManifestEntry * > &rManList, ZipOutputStream & rZipOut)\n throw(::com::sun::star::uno::RuntimeException);\n void updateReferences( ZipFile * pNewZipFile);\n void releaseUpwardRef( void );\n\n \/\/ XInterface\n virtual ::com::sun::star::uno::Any SAL_CALL queryInterface( const ::com::sun::star::uno::Type& rType )\n throw(::com::sun::star::uno::RuntimeException);\n virtual void SAL_CALL acquire( )\n throw();\n virtual void SAL_CALL release( )\n throw();\n\n \/\/ XNameContainer\n virtual void SAL_CALL insertByName( const ::rtl::OUString& aName, const ::com::sun::star::uno::Any& aElement )\n throw(::com::sun::star::lang::IllegalArgumentException, ::com::sun::star::container::ElementExistException, ::com::sun::star::lang::WrappedTargetException, ::com::sun::star::uno::RuntimeException);\n virtual void SAL_CALL removeByName( const ::rtl::OUString& Name )\n throw(::com::sun::star::container::NoSuchElementException, ::com::sun::star::lang::WrappedTargetException, ::com::sun::star::uno::RuntimeException);\n\n \/\/ XEnumerationAccess\n virtual ::com::sun::star::uno::Reference< ::com::sun::star::container::XEnumeration > SAL_CALL createEnumeration( )\n throw(::com::sun::star::uno::RuntimeException);\n\n \/\/ XElementAccess\n virtual ::com::sun::star::uno::Type SAL_CALL getElementType( )\n throw(::com::sun::star::uno::RuntimeException);\n virtual sal_Bool SAL_CALL hasElements( )\n throw(::com::sun::star::uno::RuntimeException);\n\n \/\/ XNameAccess\n virtual ::com::sun::star::uno::Any SAL_CALL getByName( const ::rtl::OUString& aName )\n 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( )\n throw(::com::sun::star::uno::RuntimeException);\n virtual sal_Bool SAL_CALL hasByName( const ::rtl::OUString& aName )\n throw(::com::sun::star::uno::RuntimeException);\n\n \/\/ XNameReplace\n virtual void SAL_CALL replaceByName( const ::rtl::OUString& aName, const ::com::sun::star::uno::Any& aElement )\n throw(::com::sun::star::lang::IllegalArgumentException, ::com::sun::star::container::NoSuchElementException, ::com::sun::star::lang::WrappedTargetException, ::com::sun::star::uno::RuntimeException);\n\n \/\/ XUnoTunnel\n static ::com::sun::star::uno::Sequence < sal_Int8 > getUnoTunnelImplementationId( void )\n throw(::com::sun::star::uno::RuntimeException);\n virtual sal_Int64 SAL_CALL getSomething( const ::com::sun::star::uno::Sequence< sal_Int8 >& aIdentifier )\n throw(::com::sun::star::uno::RuntimeException);\n};\n#endif\n<commit_msg>Moved header files outside of main inc directory<commit_after><|endoftext|>"} {"text":"<commit_before>\n#include \"stdafx.h\"\n#include \"dbg.h\"\n#include <chrono>\n\n\nnamespace common {\n\tnamespace dbg {\n\n\t\t\/\/ Log Thread\n\t\tcommon::cWQSemaphore g_logThread;\n\t\tstruct sLogData\n\t\t{\n\t\t\tint type; \/\/ 0:log, 1:error log, 2:log + error log, 3:others file\n\t\t\tStr256 str;\n\t\t};\n\n\t\tStrPath g_logPath = \"log.txt\";\n\t\tStrPath g_errLogPath = \"errlog.txt\";\n\n\n\/\/ make sLogData from argument list\n#define MAKE_LOGDATA(logData, logType, fmt) \\\n\t\t{\\\n\t\t\tlogData.type = logType;\\\n\t\t\tva_list args;\\\n\t\t\tva_start(args, fmt);\\\n\t\t\tvsnprintf_s(logData.str.m_str, sizeof(logData.str.m_str) - 1, _TRUNCATE, fmt, args);\\\n\t\t\tva_end(args);\\\n\t\t}\n\n\t}\n}\n\nusing namespace common;\nusing namespace dbg;\n\n\n\/\/------------------------------------------------------------------------\n\/\/ LogThread Task\nclass cLogTask : public cTask\n\t\t\t\t, public common::cMemoryPool4<cLogTask>\n{\npublic:\n\tconst char *m_fileName;\n\tsLogData m_logData;\n\tcLogTask() : cTask(0, \"cLogTask\") {}\n\tcLogTask(const sLogData &logData, const char *fileName = NULL)\n\t\t: cTask(0, \"cLogTask\"), m_logData(logData), m_fileName(fileName) {\n\t}\n\tvirtual ~cLogTask() {\n\t}\n\n\tvirtual eRunResult::Enum Run(const double deltaSeconds) override\n\t{\n\t\tconst string timeStr = common::GetCurrentDateTime();\n\n\t\tswitch (m_logData.type)\n\t\t{\n\t\tcase 0:\n\t\t{\n\t\t\tstd::ofstream ofs1(g_logPath.c_str(), std::ios::app);\n\t\t\tif (ofs1.is_open())\n\t\t\t{\n\t\t\t\tofs1 << timeStr << \" : \";\n\t\t\t\tofs1 << m_logData.str.c_str();\n\t\t\t}\n\t\t}\n\t\tbreak;\n\n\t\tcase 1:\n\t\t{\n\t\t\tstd::ofstream ofs2(g_errLogPath.c_str(), std::ios::app);\n\t\t\tif (ofs2.is_open())\n\t\t\t{\n\t\t\t\tofs2 << timeStr << \" : \";\n\t\t\t\tofs2 << m_logData.str.c_str();\n\t\t\t}\n\t\t}\n\t\tbreak;\n\n\t\tcase 2:\n\t\t{\n\t\t\tstd::ofstream ofs1(g_logPath.c_str(), std::ios::app);\n\t\t\tstd::ofstream ofs2(g_errLogPath.c_str(), std::ios::app);\n\t\t\tif (ofs1.is_open())\n\t\t\t{\n\t\t\t\tofs1 << timeStr << \" : \";\n\t\t\t\tofs1 << m_logData.str.c_str();\n\t\t\t}\n\t\t\tif (ofs2.is_open())\n\t\t\t{\n\t\t\t\tofs2 << timeStr << \" : \";\n\t\t\t\tofs2 << m_logData.str.c_str();\n\t\t\t}\n\t\t}\n\t\tbreak;\n\n\t\tcase 3:\n\t\t{\n\t\t\tstd::ofstream ofs1(m_fileName, std::ios::app);\n\t\t\tif (ofs1.is_open())\n\t\t\t{\n\t\t\t\tofs1 << m_logData.str.c_str();\n\t\t\t}\n\t\t}\n\t\tbreak;\n\n\t\tdefault: assert(!\"LogTask Error\"); break;\n\t\t}\n\t\treturn eRunResult::END;\n\t}\n};\n\/\/-----------------------------------------------------------------------\n\n\n\/\/------------------------------------------------------------------------\n\/\/ Set Log File Path\n\/\/ ex) \".\/server\/\" --> \".\/server\/log.txt\"\n\/\/ ex) \".\/client\/\" --> \".\/client\/log.txt\"\n\/\/------------------------------------------------------------------------\nvoid dbg::SetLogPath(const char *path)\n{\n\tg_logPath = StrPath(path) + g_logPath;\n}\n\n\n\/\/------------------------------------------------------------------------\n\/\/ Set ErrLog File Path\n\/\/ ex) \".\/server\/\" --> \".\/server\/errlog.txt\"\n\/\/ ex) \".\/client\/\" --> \".\/client\/errlog.txt\"\n\/\/------------------------------------------------------------------------\nvoid dbg::SetErrLogPath(const char *path)\n{\n\tg_errLogPath = StrPath(path) + g_errLogPath;\n}\n\n\n\/\/------------------------------------------------------------------------\n\/\/ â Ʈ Ѵ.\n\/\/------------------------------------------------------------------------\nvoid dbg::Print( const std::string &str)\n{\n\tOutputDebugStringA(str.c_str());\n\tOutputDebugStringA(\"\\n\");\n}\n\n\n\/\/------------------------------------------------------------------------\n\/\/ â Ʈ Ѵ. ( )\n\/\/------------------------------------------------------------------------\nvoid dbg::Print( const char* fmt, ...)\n{\n\tchar textString[ 256] = {'\\0'};\n\tva_list args;\n\tva_start ( args, fmt );\n\tvsnprintf_s( textString, sizeof(textString), _TRUNCATE, fmt, args );\n\tva_end ( args );\n\tOutputDebugStringA(textString);\n\t\/\/OutputDebugStringA(\"\\n\");\n}\n\n\nvoid dbg::Log(const char* fmt, ...)\n{\n\tchar textString[256];\n\tZeroMemory(textString, sizeof(textString));\n\n\tva_list args;\n\tva_start(args, fmt);\n\tvsnprintf_s(textString, sizeof(textString)-1, _TRUNCATE, fmt, args);\n\tva_end(args);\n\n\tstd::ofstream ofs(g_logPath.c_str(), std::ios::app);\n\tif (ofs.is_open())\n\t\tofs << textString;\n}\n\n\n\/\/ log parallel thread\nvoid dbg::Logp(const char* fmt, ...)\n{\n\tsLogData data;\n\tMAKE_LOGDATA(data, 0, fmt);\n\n\t\/\/ add string to log thread\n\tg_logThread.PushTask(new cLogTask(data));\n}\n\n\n\/\/ log specific file, parallel thread\nvoid dbg::Logp2(const char *fileName, const char* fmt, ...)\n{\n\tsLogData data;\n\tMAKE_LOGDATA(data, 3, fmt);\n\n\t\/\/ add string to log thread\n\tg_logThread.PushTask(new cLogTask(data, fileName));\n}\n\n\n\/\/ fileName Ͽ α׸ .\nvoid dbg::Log2(const char *fileName, const char* fmt, ...)\n{\n\tsLogData data;\n\tMAKE_LOGDATA(data, 0, fmt);\n\n\tFILE *fp = fopen(fileName, \"a+\");\n\tif (fp)\n\t{\n\t\tfputs(data.str.c_str(), fp);\n\t\tfclose(fp);\n\t}\n}\n\n\nvoid dbg::ErrLog(const char* fmt, ...)\n{\n\tsLogData data;\n\tMAKE_LOGDATA(data, 1, fmt);\n\n\tFILE *fp = fopen(g_errLogPath.c_str(), \"a+\");\n\tif (fp)\n\t{\n\t\tfputs(data.str.c_str(), fp);\n\t\tfclose(fp);\n\t}\n\n\t\/\/ αϿ ޼ Ѵ.\n\tLog( \"Error : %s\", data.str.c_str());\n}\n\n\n\/\/ errlog parallel \nvoid dbg::ErrLogp(const char* fmt, ...)\n{\n\tsLogData data;\n\tMAKE_LOGDATA(data, 1, fmt);\n\n\t\/\/ add string to log thread\n\tg_logThread.PushTask(new cLogTask(data));\n\n\t\/\/ αϿ ޼ Ѵ.\n\tLogp(\"Error : %s\", data.str.m_str);\n}\n\n\nvoid dbg::RemoveErrLog()\n{\n\tFILE *fp = fopen(g_errLogPath.c_str(), \"w\");\n\tif (fp)\n\t{\n\t\tfputs(\"\", fp);\n\t\tfclose(fp);\n\t}\n}\n\n\nvoid dbg::RemoveLog2(const char *fileName)\n{\n\tFILE *fp = fopen(fileName, \"w\");\n\tif (fp)\n\t{\n\t\tfputs(\"\", fp);\n\t\tfclose(fp);\n\t}\n}\n\n\nvoid dbg::RemoveLog()\n{\n\tFILE *fp = fopen(g_logPath.c_str(), \"w\");\n\tif (fp)\n\t{\n\t\tfputs(\"\", fp);\n\t\tfclose(fp);\n\t}\n}\n\n\nvoid dbg::TerminateLogThread()\n{\n\tg_logThread.Clear();\n}\n\n\n\/\/ log classfy\n\/\/ none\/log\/errlog, multithread\n\/\/\n\/\/ level 0 : none\n\/\/\t\t 1 : log\n\/\/\t\t 2 : log + err log\n\/\/\t\t 3 : log + err log + assertion\nvoid dbg::Logc(const int level, const char* fmt, ...)\n{\n\tsLogData data;\n\tMAKE_LOGDATA(data, -1, fmt);\n\n\tswitch (level)\n\t{\n\tcase 3:\n\t\t\/\/DebugBreak();\n\t\tassert(!\"dbg::Logc()\");\n\tcase 2:\n\t\tdata.type = 2;\n\tcase 1:\n\t\tif (level == 1)\n\t\t\tdata.type = 0;\n\tcase 0:\n\t\t\/\/ cout ȭ Freeze ֱ ܵ\n\t\tbreak;\n\tdefault:\n\t\tassert(!\"dbg::Logc()\");\n\t\tbreak;\n\t}\n\n\t\/\/------------------------------------------------------------------------\n\t\/\/ add string to log thread\n\tif (data.type >= 0)\n\t\tg_logThread.PushTask(new cLogTask(data));\n}\n\n\n\/\/ log classfy\n\/\/ print\/log\/errlog, multithread\n\/\/\n\/\/ level 0 : printf\n\/\/\t\t 1 : printf + log\n\/\/\t\t 2 : printf + log + err log\n\/\/\t\t 3 : printf + log + err log + assertion\nvoid dbg::Logc2(const int level, const char* fmt, ...)\n{\n\tsLogData data;\n\tMAKE_LOGDATA(data, -1, fmt);\n\n\tswitch (level)\n\t{\n\tcase 3:\n\t\t\/\/DebugBreak();\n\t\tassert(!\"dbg::Logc2()\");\n\tcase 2:\n\t\tdata.type = 2;\n\tcase 1:\n\t\tif (level == 1)\n\t\t\tdata.type = 0;\n\tcase 0:\n\t\tstd::cout << data.str.m_str;\n\t\tbreak;\n\tdefault:\n\t\tassert(!\"dbg::Logc2()\");\n\t\tbreak;\n\t}\n\n\t\/\/------------------------------------------------------------------------\n\t\/\/ add string to log thread\n\tif (data.type >= 0)\n\t\tg_logThread.PushTask(new cLogTask(data));\n}\n<commit_msg>update dbg log buffer size<commit_after>\n#include \"stdafx.h\"\n#include \"dbg.h\"\n#include <chrono>\n\n\nnamespace common {\n\tnamespace dbg {\n\n\t\t\/\/ Log Thread\n\t\tcommon::cWQSemaphore g_logThread;\n\t\tstruct sLogData\n\t\t{\n\t\t\tint type; \/\/ 0:log, 1:error log, 2:log + error log, 3:others file\n\t\t\tStr512 str;\n\t\t};\n\n\t\tStrPath g_logPath = \"log.txt\";\n\t\tStrPath g_errLogPath = \"errlog.txt\";\n\n\n\/\/ make sLogData from argument list\n#define MAKE_LOGDATA(logData, logType, fmt) \\\n\t\t{\\\n\t\t\tlogData.type = logType;\\\n\t\t\tva_list args;\\\n\t\t\tva_start(args, fmt);\\\n\t\t\tvsnprintf_s(logData.str.m_str, sizeof(logData.str.m_str) - 1, _TRUNCATE, fmt, args);\\\n\t\t\tva_end(args);\\\n\t\t}\n\n\t}\n}\n\nusing namespace common;\nusing namespace dbg;\n\n\n\/\/------------------------------------------------------------------------\n\/\/ LogThread Task\nclass cLogTask : public cTask\n\t\t\t\t, public common::cMemoryPool4<cLogTask>\n{\npublic:\n\tconst char *m_fileName;\n\tsLogData m_logData;\n\tcLogTask() : cTask(0, \"cLogTask\") {}\n\tcLogTask(const sLogData &logData, const char *fileName = NULL)\n\t\t: cTask(0, \"cLogTask\"), m_logData(logData), m_fileName(fileName) {\n\t}\n\tvirtual ~cLogTask() {\n\t}\n\n\tvirtual eRunResult::Enum Run(const double deltaSeconds) override\n\t{\n\t\tconst string timeStr = common::GetCurrentDateTime();\n\n\t\tswitch (m_logData.type)\n\t\t{\n\t\tcase 0:\n\t\t{\n\t\t\tstd::ofstream ofs1(g_logPath.c_str(), std::ios::app);\n\t\t\tif (ofs1.is_open())\n\t\t\t{\n\t\t\t\tofs1 << timeStr << \" : \";\n\t\t\t\tofs1 << m_logData.str.c_str();\n\t\t\t}\n\t\t}\n\t\tbreak;\n\n\t\tcase 1:\n\t\t{\n\t\t\tstd::ofstream ofs2(g_errLogPath.c_str(), std::ios::app);\n\t\t\tif (ofs2.is_open())\n\t\t\t{\n\t\t\t\tofs2 << timeStr << \" : \";\n\t\t\t\tofs2 << m_logData.str.c_str();\n\t\t\t}\n\t\t}\n\t\tbreak;\n\n\t\tcase 2:\n\t\t{\n\t\t\tstd::ofstream ofs1(g_logPath.c_str(), std::ios::app);\n\t\t\tstd::ofstream ofs2(g_errLogPath.c_str(), std::ios::app);\n\t\t\tif (ofs1.is_open())\n\t\t\t{\n\t\t\t\tofs1 << timeStr << \" : \";\n\t\t\t\tofs1 << m_logData.str.c_str();\n\t\t\t}\n\t\t\tif (ofs2.is_open())\n\t\t\t{\n\t\t\t\tofs2 << timeStr << \" : \";\n\t\t\t\tofs2 << m_logData.str.c_str();\n\t\t\t}\n\t\t}\n\t\tbreak;\n\n\t\tcase 3:\n\t\t{\n\t\t\tstd::ofstream ofs1(m_fileName, std::ios::app);\n\t\t\tif (ofs1.is_open())\n\t\t\t{\n\t\t\t\tofs1 << m_logData.str.c_str();\n\t\t\t}\n\t\t}\n\t\tbreak;\n\n\t\tdefault: assert(!\"LogTask Error\"); break;\n\t\t}\n\t\treturn eRunResult::END;\n\t}\n};\n\/\/-----------------------------------------------------------------------\n\n\n\/\/------------------------------------------------------------------------\n\/\/ Set Log File Path\n\/\/ ex) \".\/server\/\" --> \".\/server\/log.txt\"\n\/\/ ex) \".\/client\/\" --> \".\/client\/log.txt\"\n\/\/------------------------------------------------------------------------\nvoid dbg::SetLogPath(const char *path)\n{\n\tg_logPath = StrPath(path) + g_logPath;\n}\n\n\n\/\/------------------------------------------------------------------------\n\/\/ Set ErrLog File Path\n\/\/ ex) \".\/server\/\" --> \".\/server\/errlog.txt\"\n\/\/ ex) \".\/client\/\" --> \".\/client\/errlog.txt\"\n\/\/------------------------------------------------------------------------\nvoid dbg::SetErrLogPath(const char *path)\n{\n\tg_errLogPath = StrPath(path) + g_errLogPath;\n}\n\n\n\/\/------------------------------------------------------------------------\n\/\/ â Ʈ Ѵ.\n\/\/------------------------------------------------------------------------\nvoid dbg::Print( const std::string &str)\n{\n\tOutputDebugStringA(str.c_str());\n\tOutputDebugStringA(\"\\n\");\n}\n\n\n\/\/------------------------------------------------------------------------\n\/\/ â Ʈ Ѵ. ( )\n\/\/------------------------------------------------------------------------\nvoid dbg::Print( const char* fmt, ...)\n{\n\tchar textString[ 256] = {'\\0'};\n\tva_list args;\n\tva_start ( args, fmt );\n\tvsnprintf_s( textString, sizeof(textString), _TRUNCATE, fmt, args );\n\tva_end ( args );\n\tOutputDebugStringA(textString);\n\t\/\/OutputDebugStringA(\"\\n\");\n}\n\n\nvoid dbg::Log(const char* fmt, ...)\n{\n\tchar textString[256];\n\tZeroMemory(textString, sizeof(textString));\n\n\tva_list args;\n\tva_start(args, fmt);\n\tvsnprintf_s(textString, sizeof(textString)-1, _TRUNCATE, fmt, args);\n\tva_end(args);\n\n\tstd::ofstream ofs(g_logPath.c_str(), std::ios::app);\n\tif (ofs.is_open())\n\t\tofs << textString;\n}\n\n\n\/\/ log parallel thread\nvoid dbg::Logp(const char* fmt, ...)\n{\n\tsLogData data;\n\tMAKE_LOGDATA(data, 0, fmt);\n\n\t\/\/ add string to log thread\n\tg_logThread.PushTask(new cLogTask(data));\n}\n\n\n\/\/ log specific file, parallel thread\nvoid dbg::Logp2(const char *fileName, const char* fmt, ...)\n{\n\tsLogData data;\n\tMAKE_LOGDATA(data, 3, fmt);\n\n\t\/\/ add string to log thread\n\tg_logThread.PushTask(new cLogTask(data, fileName));\n}\n\n\n\/\/ fileName Ͽ α׸ .\nvoid dbg::Log2(const char *fileName, const char* fmt, ...)\n{\n\tsLogData data;\n\tMAKE_LOGDATA(data, 0, fmt);\n\n\tFILE *fp = fopen(fileName, \"a+\");\n\tif (fp)\n\t{\n\t\tfputs(data.str.c_str(), fp);\n\t\tfclose(fp);\n\t}\n}\n\n\nvoid dbg::ErrLog(const char* fmt, ...)\n{\n\tsLogData data;\n\tMAKE_LOGDATA(data, 1, fmt);\n\n\tFILE *fp = fopen(g_errLogPath.c_str(), \"a+\");\n\tif (fp)\n\t{\n\t\tfputs(data.str.c_str(), fp);\n\t\tfclose(fp);\n\t}\n\n\t\/\/ αϿ ޼ Ѵ.\n\tLog( \"Error : %s\", data.str.c_str());\n}\n\n\n\/\/ errlog parallel \nvoid dbg::ErrLogp(const char* fmt, ...)\n{\n\tsLogData data;\n\tMAKE_LOGDATA(data, 1, fmt);\n\n\t\/\/ add string to log thread\n\tg_logThread.PushTask(new cLogTask(data));\n\n\t\/\/ αϿ ޼ Ѵ.\n\tLogp(\"Error : %s\", data.str.m_str);\n}\n\n\nvoid dbg::RemoveErrLog()\n{\n\tFILE *fp = fopen(g_errLogPath.c_str(), \"w\");\n\tif (fp)\n\t{\n\t\tfputs(\"\", fp);\n\t\tfclose(fp);\n\t}\n}\n\n\nvoid dbg::RemoveLog2(const char *fileName)\n{\n\tFILE *fp = fopen(fileName, \"w\");\n\tif (fp)\n\t{\n\t\tfputs(\"\", fp);\n\t\tfclose(fp);\n\t}\n}\n\n\nvoid dbg::RemoveLog()\n{\n\tFILE *fp = fopen(g_logPath.c_str(), \"w\");\n\tif (fp)\n\t{\n\t\tfputs(\"\", fp);\n\t\tfclose(fp);\n\t}\n}\n\n\nvoid dbg::TerminateLogThread()\n{\n\tg_logThread.Clear();\n}\n\n\n\/\/ log classfy\n\/\/ none\/log\/errlog, multithread\n\/\/\n\/\/ level 0 : none\n\/\/\t\t 1 : log\n\/\/\t\t 2 : log + err log\n\/\/\t\t 3 : log + err log + assertion\nvoid dbg::Logc(const int level, const char* fmt, ...)\n{\n\tsLogData data;\n\tMAKE_LOGDATA(data, -1, fmt);\n\n\tswitch (level)\n\t{\n\tcase 3:\n\t\t\/\/DebugBreak();\n\t\tassert(!\"dbg::Logc()\");\n\tcase 2:\n\t\tdata.type = 2;\n\tcase 1:\n\t\tif (level == 1)\n\t\t\tdata.type = 0;\n\tcase 0:\n\t\t\/\/ cout ȭ Freeze ֱ ܵ\n\t\tbreak;\n\tdefault:\n\t\tassert(!\"dbg::Logc()\");\n\t\tbreak;\n\t}\n\n\t\/\/------------------------------------------------------------------------\n\t\/\/ add string to log thread\n\tif (data.type >= 0)\n\t\tg_logThread.PushTask(new cLogTask(data));\n}\n\n\n\/\/ log classfy\n\/\/ print\/log\/errlog, multithread\n\/\/\n\/\/ level 0 : printf\n\/\/\t\t 1 : printf + log\n\/\/\t\t 2 : printf + log + err log\n\/\/\t\t 3 : printf + log + err log + assertion\nvoid dbg::Logc2(const int level, const char* fmt, ...)\n{\n\tsLogData data;\n\tMAKE_LOGDATA(data, -1, fmt);\n\n\tswitch (level)\n\t{\n\tcase 3:\n\t\t\/\/DebugBreak();\n\t\tassert(!\"dbg::Logc2()\");\n\tcase 2:\n\t\tdata.type = 2;\n\tcase 1:\n\t\tif (level == 1)\n\t\t\tdata.type = 0;\n\tcase 0:\n\t\tstd::cout << data.str.m_str;\n\t\tbreak;\n\tdefault:\n\t\tassert(!\"dbg::Logc2()\");\n\t\tbreak;\n\t}\n\n\t\/\/------------------------------------------------------------------------\n\t\/\/ add string to log thread\n\tif (data.type >= 0)\n\t\tg_logThread.PushTask(new cLogTask(data));\n}\n<|endoftext|>"} {"text":"<commit_before>#include <string>\n#include <vector>\n#include <memory>\n#include <algorithm>\n#include \"Vec2i.h\"\n#include \"IMapElement.h\"\n#include \"CDoorway.h\"\n#include \"CActor.h\"\n#include \"CMap.h\"\n#include \"CBullKnight.h\"\n#include \"CFalconKnight.h\"\n#include \"CTurtleKnight.h\"\n#include \"CCuco.h\"\n\n#include <iostream>\n\nnamespace Knights {\n void CMap::endOfTurn() {\n for (int y = 0; y < 20; ++y) {\n for (int x = 0; x < 20; ++x) {\n if (mActors[y][x] != nullptr) {\n mActors[y][x]->endOfTurn();\n }\n }\n }\n\n actors.erase( std::remove_if( actors.begin(), actors.end(),\n [](std::shared_ptr<CActor> actor){ return !actor->isAlive();}\n ), actors.end() );\n }\n\n\n CMap::CMap(const std::string &mapData) {\n\n char element;\n std::shared_ptr<CActor> actor = nullptr;\n int id = 0;\n for (int y = 0; y < 20; ++y) {\n for (int x = 0; x < 20; ++x) {\n\n element = mapData[(y * 20) + x];\n block[y][x] = false;\n map[y][x] = nullptr;\n mElement[ y ][ x ] = element;\n\n switch (element) {\n case '0':\n case '=':\n case '_':\n case '-':\n block[y][x] = false;\n break;\n case '1':\n case '#':\n case '\/':\n case '\\\\':\n case '|':\n block[y][x] = true;\n break;\n case '~':\n block[y][x] = false;\n break;\n\n case '4':\n actor = mAvatar = std::make_shared<CBullKnight>(id++);\n mElement[ y ][ x ] = '.';\n break;\n case '9':\n case '*':\n map[y][x] = std::make_shared<CDoorway>(element == '9' ? EDoorwayFunction::kExit : EDoorwayFunction::kEntry);\n break;\n case '5':\n case '6':\n actor = std::make_shared<CCuco>(id++);\n mElement[ y ][ x ] = '.';\n break;\n }\n\n if (actor != nullptr) {\n actors.push_back(actor);\n mActors[y][x] = actor;\n actor->setPosition( { x, y } );\n actor = nullptr;\n }\n }\n }\n }\n\n\n std::shared_ptr<CActor> CMap::attack(std::shared_ptr<CActor> actor, Vec2i position, bool mutual) {\n\n std::shared_ptr<CActor> otherActor = getActorAt( position );\n\n if ( otherActor == nullptr ) {\n return nullptr;\n }\n\n if (actor->getTeam() != otherActor->getTeam()) {\n actor->performAttack(otherActor);\n\n if (mutual) {\n otherActor->performAttack(actor);\n }\n\n if (!actor->isAlive() ) {\n auto position = actor->getPosition();\n mActors[position.y][position.x] = nullptr;\n }\n\n if (!otherActor->isAlive()) {\n auto position = otherActor->getPosition();\n mActors[position.y][position.x] = nullptr;\n }\n }\n\n return otherActor;\n }\n\n\n bool CMap::attackIfNotFriendly(EDirection d, std::shared_ptr<CActor> actor, bool mutual) {\n\n std::shared_ptr<CActor> other = nullptr;\n\n auto position = actor->getPosition();\n\n switch (d) {\n\n case EDirection::kEast:\n other = attack(actor, Vec2i{position.x + 1, position.y}, mutual);\n break;\n\n case EDirection::kWest:\n other = attack(actor, Vec2i{position.x - 1, position.y}, mutual);\n break;\n\n case EDirection::kSouth:\n other = attack(actor, Vec2i{position.x, position.y + 1}, mutual);\n break;\n\n case EDirection::kNorth:\n other = attack(actor, Vec2i{position.x, position.y - 1}, mutual);\n break;\n }\n\n return (other != nullptr);\n }\n\n\n void CMap::move(EDirection d, std::shared_ptr<CActor> actor) {\n\n if (actor->canAttack() && attackIfNotFriendly(d, actor, true)) {\n return;\n }\n\n if (!actor->canMove()) {\n return;\n }\n\n\n bool moved = false;\n\n auto position = actor->getPosition();\n\n switch (d) {\n\n case EDirection::kEast:\n\n if (!isBlockAt(position.x + 1, position.y ) ) {\n moved = true;\n moveActor( position, { position.x + 1, position.y }, actor );\n }\n break;\n\n case EDirection::kWest:\n if (!isBlockAt(position.x - 1, position.y ) ) {\n moved = true;\n moveActor( position, { position.x - 1, position.y }, actor );\n }\n break;\n\n case EDirection::kSouth:\n if (!isBlockAt(position.x, position.y + 1 ) ) {\n moved = true;\n moveActor( position, { position.x, position.y + 1 }, actor );\n }\n break;\n\n case EDirection::kNorth:\n if (!isBlockAt(position.x, position.y - 1) ) {\n moved = true;\n moveActor( position, { position.x, position.y - 1}, actor );\n }\n break;\n\n }\n\n if (moved) {\n actor->onMove();\n }\n }\n\n bool CMap::isValid(int x, int y) {\n if ( x < 0 || x > 20 || y < 0 || y > 20 ) {\n return false;\n }\n return true;\n }\n\n bool CMap::isBlockAt(int x, int y) {\n\n if ( !isValid( x, y ) ) {\n return true;\n }\n\n if ( mActors[ y ][ x ] != nullptr ) {\n return true;\n }\n\n return block[ y ][ x ];\n }\n\n std::shared_ptr<CActor> CMap::getActorAt( Vec2i position ) {\n return mActors[ position.y ][ position.x ];\n }\n\n char CMap::getElementAt( int x, int y ) {\n return mElement[ y ][ x ];\n }\n\n std::vector<std::shared_ptr<CActor>> CMap::getActors() {\n return actors;\n }\n\n std::shared_ptr<CActor> CMap::getAvatar() {\n return mAvatar;\n }\n\n void CMap::setActorAt(Vec2i position, std::shared_ptr<CActor> actor) {\n mActors[position.y][position.x] = actor;\n }\n\n void CMap::moveActor(Vec2i from, Vec2i to, std::shared_ptr<CActor> actor) {\n mActors[from.y][from.x] = nullptr;\n mActors[to.y][to.x] = actor;\n actor->setPosition( to );\n }\n}<commit_msg>Add new tile types to maps<commit_after>#include <string>\n#include <vector>\n#include <memory>\n#include <algorithm>\n#include \"Vec2i.h\"\n#include \"IMapElement.h\"\n#include \"CDoorway.h\"\n#include \"CActor.h\"\n#include \"CMap.h\"\n#include \"CBullKnight.h\"\n#include \"CFalconKnight.h\"\n#include \"CTurtleKnight.h\"\n#include \"CCuco.h\"\n\n#include <iostream>\n\nnamespace Knights {\n void CMap::endOfTurn() {\n for (int y = 0; y < 20; ++y) {\n for (int x = 0; x < 20; ++x) {\n if (mActors[y][x] != nullptr) {\n mActors[y][x]->endOfTurn();\n }\n }\n }\n\n actors.erase( std::remove_if( actors.begin(), actors.end(),\n [](std::shared_ptr<CActor> actor){ return !actor->isAlive();}\n ), actors.end() );\n }\n\n\n CMap::CMap(const std::string &mapData) {\n\n char element;\n std::shared_ptr<CActor> actor = nullptr;\n int id = 0;\n for (int y = 0; y < 20; ++y) {\n for (int x = 0; x < 20; ++x) {\n\n element = mapData[(y * 20) + x];\n block[y][x] = false;\n map[y][x] = nullptr;\n mElement[ y ][ x ] = element;\n\n switch (element) {\n case '0':\n case '=':\n case '_':\n case '-':\n case '(':\n case ')':\n case '2':\n case '7':\n block[y][x] = false;\n break;\n case '1':\n case '#':\n case '\/':\n case '\\\\':\n case '%':\n case '|':\n case 'Y':\n case 'Z':\n case 'S':\n case '>':\n case '<':\n block[y][x] = true;\n break;\n case '~':\n block[y][x] = false;\n break;\n\n case '4':\n actor = mAvatar = std::make_shared<CBullKnight>(id++);\n mElement[ y ][ x ] = '.';\n break;\n case '9':\n case '*':\n map[y][x] = std::make_shared<CDoorway>(element == '9' ? EDoorwayFunction::kExit : EDoorwayFunction::kEntry);\n break;\n case '5':\n case '6':\n actor = std::make_shared<CCuco>(id++);\n mElement[ y ][ x ] = '.';\n break;\n }\n\n if (actor != nullptr) {\n actors.push_back(actor);\n mActors[y][x] = actor;\n actor->setPosition( { x, y } );\n actor = nullptr;\n }\n }\n }\n }\n\n\n std::shared_ptr<CActor> CMap::attack(std::shared_ptr<CActor> actor, Vec2i position, bool mutual) {\n\n std::shared_ptr<CActor> otherActor = getActorAt( position );\n\n if ( otherActor == nullptr ) {\n return nullptr;\n }\n\n if (actor->getTeam() != otherActor->getTeam()) {\n actor->performAttack(otherActor);\n\n if (mutual) {\n otherActor->performAttack(actor);\n }\n\n if (!actor->isAlive() ) {\n auto position = actor->getPosition();\n mActors[position.y][position.x] = nullptr;\n }\n\n if (!otherActor->isAlive()) {\n auto position = otherActor->getPosition();\n mActors[position.y][position.x] = nullptr;\n }\n }\n\n return otherActor;\n }\n\n\n bool CMap::attackIfNotFriendly(EDirection d, std::shared_ptr<CActor> actor, bool mutual) {\n\n std::shared_ptr<CActor> other = nullptr;\n\n auto position = actor->getPosition();\n\n switch (d) {\n\n case EDirection::kEast:\n other = attack(actor, Vec2i{position.x + 1, position.y}, mutual);\n break;\n\n case EDirection::kWest:\n other = attack(actor, Vec2i{position.x - 1, position.y}, mutual);\n break;\n\n case EDirection::kSouth:\n other = attack(actor, Vec2i{position.x, position.y + 1}, mutual);\n break;\n\n case EDirection::kNorth:\n other = attack(actor, Vec2i{position.x, position.y - 1}, mutual);\n break;\n }\n\n return (other != nullptr);\n }\n\n\n void CMap::move(EDirection d, std::shared_ptr<CActor> actor) {\n\n if (actor->canAttack() && attackIfNotFriendly(d, actor, true)) {\n return;\n }\n\n if (!actor->canMove()) {\n return;\n }\n\n\n bool moved = false;\n\n auto position = actor->getPosition();\n\n switch (d) {\n\n case EDirection::kEast:\n\n if (!isBlockAt(position.x + 1, position.y ) ) {\n moved = true;\n moveActor( position, { position.x + 1, position.y }, actor );\n }\n break;\n\n case EDirection::kWest:\n if (!isBlockAt(position.x - 1, position.y ) ) {\n moved = true;\n moveActor( position, { position.x - 1, position.y }, actor );\n }\n break;\n\n case EDirection::kSouth:\n if (!isBlockAt(position.x, position.y + 1 ) ) {\n moved = true;\n moveActor( position, { position.x, position.y + 1 }, actor );\n }\n break;\n\n case EDirection::kNorth:\n if (!isBlockAt(position.x, position.y - 1) ) {\n moved = true;\n moveActor( position, { position.x, position.y - 1}, actor );\n }\n break;\n\n }\n\n if (moved) {\n actor->onMove();\n }\n }\n\n bool CMap::isValid(int x, int y) {\n if ( x < 0 || x > 20 || y < 0 || y > 20 ) {\n return false;\n }\n return true;\n }\n\n bool CMap::isBlockAt(int x, int y) {\n\n if ( !isValid( x, y ) ) {\n return true;\n }\n\n if ( mActors[ y ][ x ] != nullptr ) {\n return true;\n }\n\n return block[ y ][ x ];\n }\n\n std::shared_ptr<CActor> CMap::getActorAt( Vec2i position ) {\n return mActors[ position.y ][ position.x ];\n }\n\n char CMap::getElementAt( int x, int y ) {\n return mElement[ y ][ x ];\n }\n\n std::vector<std::shared_ptr<CActor>> CMap::getActors() {\n return actors;\n }\n\n std::shared_ptr<CActor> CMap::getAvatar() {\n return mAvatar;\n }\n\n void CMap::setActorAt(Vec2i position, std::shared_ptr<CActor> actor) {\n mActors[position.y][position.x] = actor;\n }\n\n void CMap::moveActor(Vec2i from, Vec2i to, std::shared_ptr<CActor> actor) {\n mActors[from.y][from.x] = nullptr;\n mActors[to.y][to.x] = actor;\n actor->setPosition( to );\n }\n}<|endoftext|>"} {"text":"<commit_before>\/\/---------------------------------------------------------------------------\/\/\n\/*!\n * \\file tstMesh.cpp\n * \\author Stuart R. Slattery\n * \\brief Mesh unit tests.\n *\/\n\/\/---------------------------------------------------------------------------\/\/\n\n#include <iostream>\n#include <vector>\n#include <cmath>\n#include <sstream>\n#include <algorithm>\n#include <cassert>\n\n#include <DTK_Mesh.hpp>\n#include <DTK_DataSource.hpp>\n#include <DTK_CoreTypes.hpp>\n#include <DTK_NodeTraits.hpp>\n#include <DTK_ElementTraits.hpp>\n#include <DTK_FieldTraits.hpp>\n\n#include <mpi.h>\n\n#include <Teuchos_UnitTestHarness.hpp>\n#include <Teuchos_DefaultComm.hpp>\n#include <Teuchos_DefaultMpiComm.hpp>\n#include <Teuchos_RCP.hpp>\n#include <Teuchos_OpaqueWrapper.hpp>\n#include <Teuchos_TypeTraits.hpp>\n\n\/\/---------------------------------------------------------------------------\/\/\n\/\/ MPI Setup\n\/\/---------------------------------------------------------------------------\/\/\n\ntemplate<class Ordinal>\nTeuchos::RCP<const Teuchos::Comm<Ordinal> > getDefaultComm()\n{\n#ifdef HAVE_MPI\n return Teuchos::DefaultComm<Ordinal>::getComm();\n#else\n return Teuchos::rcp(new Teuchos::SerialComm<Ordinal>() );\n#endif\n}\n\n\/\/---------------------------------------------------------------------------\/\/\n\/\/ Node Implementation\n\/\/---------------------------------------------------------------------------\/\/\n\nclass MyNode\n{\n private:\n\n std::size_t d_handle;\n std::vector<double> d_coords;\n\n public:\n\n typedef int handle_type;\n typedef double coordinate_type;\n \n MyNode( double x, double y, double z, int handle )\n\t: d_handle( handle )\n {\n\td_coords.push_back(x);\n\td_coords.push_back(y);\n\td_coords.push_back(z);\n }\n\n ~MyNode()\n { \/* ... *\/ }\n\n int handle() const\n { return d_handle; }\n\n std::vector<double>::const_iterator coordsBegin() const\n { return d_coords.begin(); }\n\n std::vector<double>::const_iterator coordsEnd() const\n { return d_coords.end(); }\n};\n\n\/\/---------------------------------------------------------------------------\/\/\n\/\/ Element Implementation\n\/\/---------------------------------------------------------------------------\/\/\n\nclass MyHex\n{\n private:\n\n std::size_t d_handle;\n std::vector<int> d_connectivity;\n\n public:\n\n typedef std::size_t handle_type;\n\n MyHex( int node_0, int node_1, int node_2, int node_3,\n\t int node_4, int node_5, int node_6, int node_7,\n\t std::size_t handle )\n\t: d_handle( handle )\n {\n\td_connectivity.push_back( node_0 );\n\td_connectivity.push_back( node_1 );\n\td_connectivity.push_back( node_2 );\n\td_connectivity.push_back( node_3 );\n\td_connectivity.push_back( node_4 );\n\td_connectivity.push_back( node_5 );\n\td_connectivity.push_back( node_6 );\n\td_connectivity.push_back( node_7 );\n }\n\n ~MyHex()\n { \/* ... *\/ }\n\n int handle() const\n { return d_handle; }\n\n std::vector<int>::const_iterator connectivityBegin() const\n { return d_connectivity.begin(); }\n\n std::vector<int>::const_iterator connectivityEnd() const\n { return d_connectivity.end(); }\n};\n\n\/\/---------------------------------------------------------------------------\/\/\n\/\/ DTK Traits Specializations\n\/\/---------------------------------------------------------------------------\/\/\nnamespace DataTransferKit\n{\n\n\/\/---------------------------------------------------------------------------\/\/\n\/\/ NodeTraits specialization for the MyNode implementation.\ntemplate<>\nstruct NodeTraits<MyNode>\n{\n typedef typename MyNode::handle_type handle_type;\n typedef typename MyNode::coordinate_type coordinate_type;\n typedef typename std::vector<double>::const_iterator \n const_coordinate_iterator;\n \n static inline std::size_t dim()\n { return 3;}\n \n static inline handle_type handle( const MyNode& node ) \n { return node.handle(); }\n \n static inline const_coordinate_iterator coordsBegin( const MyNode& node ) \n { return node.coordsBegin(); }\n\n static inline const_coordinate_iterator coordsEnd( const MyNode& node ) \n { return node.coordsEnd(); }\n};\n\n\/\/---------------------------------------------------------------------------\/\/\n\/\/ ElementTraits specialization for the MyHex implementation.\ntemplate<>\nstruct ElementTraits<MyHex>\n{\n typedef typename MyHex::handle_type handle_type;\n typedef typename std::vector<int>::const_iterator \n const_connectivity_iterator;\n\n static inline std::size_t type()\n { return DTK_REGION; }\n\n static inline std::size_t topology()\n { return DTK_HEXAHEDRON; }\n\n static inline std::size_t numNodes()\n { return 8; }\n\n static inline handle_type handle( const MyHex &hex )\n { return hex.handle(); }\n\n static inline const_connectivity_iterator \n connectivityBegin( const MyHex &hex )\n { return hex.connectivityBegin(); }\n\n static inline const_connectivity_iterator \n connectivityEnd( const MyHex &hex )\n { return hex.connectivityEnd(); }\n};\n\n\/\/---------------------------------------------------------------------------\/\/\n\/\/ FieldTraits specialization for the node field.\ntemplate<>\nstruct FieldTraits< std::vector<MyNode> >\n{\n typedef MyNode value_type;\n typedef std::vector<MyNode>::iterator iterator;\n typedef std::vector<MyNode>::const_iterator const_iterator;\n \n static inline std::size_t size( const std::vector<MyNode> &node_field )\n { return node_field.size(); }\n\n static iterator begin( std::vector<MyNode> &node_field )\n { return node_field.begin(); }\n\n static const_iterator begin( const std::vector<MyNode> &node_field )\n { return node_field.begin(); }\n\n static inline iterator end( std::vector<MyNode> &node_field )\n { return node_field.end(); }\n\n static inline const_iterator end( const std::vector<MyNode> &node_field )\n { return node_field.end(); }\n\n static inline bool empty( const std::vector<MyNode> &node_field )\n { return node_field.empty(); }\n};\n\n\/\/---------------------------------------------------------------------------\/\/\n\/\/ FieldTraits specialization for the element field.\ntemplate<>\nstruct FieldTraits< std::vector<MyHex> >\n{\n typedef MyHex value_type;\n typedef std::vector<MyHex>::iterator iterator;\n typedef std::vector<MyHex>::const_iterator const_iterator;\n \n static inline std::size_t size( const std::vector<MyHex> &quad_field )\n { return quad_field.size(); }\n\n static inline iterator begin( std::vector<MyHex> &quad_field )\n { return quad_field.begin(); }\n\n static inline const_iterator begin( const std::vector<MyHex> &quad_field )\n { return quad_field.begin(); }\n\n static inline iterator end( std::vector<MyHex> &quad_field )\n { return quad_field.end(); }\n\n static inline const_iterator end( const std::vector<MyHex> &quad_field )\n { return quad_field.end(); }\n\n static inline bool empty( const std::vector<MyHex> &quad_field )\n { return quad_field.empty(); }\n};\n\n\/\/---------------------------------------------------------------------------\/\/\n\/\/ FieldTraits specialization for the data field.\ntemplate<>\nstruct FieldTraits< std::vector<double> >\n{\n typedef MyNode value_type;\n typedef std::vector<double>::iterator iterator;\n typedef std::vector<double>::const_iterator const_iterator;\n \n static inline std::size_t size( const std::vector<double> &data_field )\n { return data_field.size(); }\n\n static inline iterator begin( std::vector<double> &data_field )\n { return data_field.begin(); }\n\n static inline const_iterator begin( const std::vector<double> &data_field )\n { return data_field.begin(); }\n\n static inline iterator end( std::vector<double> &data_field )\n { return data_field.end(); }\n\n static inline const_iterator end( const std::vector<double> &data_field )\n { return data_field.end(); }\n\n static inline bool empty( const std::vector<double> &data_field )\n { return data_field.empty(); }\n};\n\n} \/\/ end namespace DataTransferKit\n\n\/\/---------------------------------------------------------------------------\/\/\n\/\/ DataSource Implementation\n\/\/---------------------------------------------------------------------------\/\/\nclass MyDataSource : public DataTransferKit::DataSource< std::vector<MyNode>,\n\t\t\t\t\t\t\t std::vector<MyHex>,\n\t\t\t\t\t\t\t std::vector<double> >\n{\n private:\n\n std::vector<MyNode> d_nodes;\n std::vector<MyHex> d_elements;\n std::vector<double> d_element_data;\n MPI_Comm d_comm;\n\n void createMesh()\n {\n\t\/\/ Make some nodes.\n\td_nodes.push_back( MyNode(0.0, 0.0, 0.0, 0) );\n\td_nodes.push_back( MyNode(1.0, 0.0, 0.0, 1) );\n\td_nodes.push_back( MyNode(1.0, 1.0, 0.0, 2) );\n\td_nodes.push_back( MyNode(0.0, 1.0, 0.0, 3) );\n\td_nodes.push_back( MyNode(0.0, 0.0, 1.0, 4) );\n\td_nodes.push_back( MyNode(1.0, 0.0, 1.0, 5) );\n\td_nodes.push_back( MyNode(1.0, 1.0, 1.0, 6) );\n\td_nodes.push_back( MyNode(0.0, 1.0, 1.0, 7) );\n\n\n\t\/\/ Make a quadrilateral.\n\td_elements.push_back( MyHex( 0, 1, 2, 3, 4, 5, 6, 7, 12 ) );\n\n\t\/\/ Add some data for the elements.\n\td_element_data.push_back( 1.5 );\n\td_element_data.push_back( 3.5 );\n\td_element_data.push_back( 5.5 );\n\td_element_data.push_back( 7.5 );\n }\n\n public:\n\n MyDataSource()\n { \n\t\/\/ Build the mesh.\n\tcreateMesh();\n\n\t\/\/ Get the raw MPI_Comm out of Teuchos.\n\tTeuchos::RCP< const Teuchos::Comm<int> > comm = getDefaultComm<int>();\n\tTeuchos::RCP< const Teuchos::MpiComm<int> > mpi_comm = \n\t Teuchos::rcp_dynamic_cast< const Teuchos::MpiComm<int> >( comm );\n\tTeuchos::RCP< const Teuchos::OpaqueWrapper<MPI_Comm> > opaque_comm = \n\t mpi_comm->getRawMpiComm();\n\td_comm = (*opaque_comm)();\n }\n\n ~MyDataSource()\n { \/* ... *\/ }\n\n const MPI_Comm& getSourceComm()\n {\n\treturn d_comm;\n }\n\n bool isFieldSupported( const std::string &field_name )\n {\n\tbool return_val = false;\n\tif ( field_name == \"MY_DATA_FIELD\" )\n\t{\n\t return_val = true;\n\t}\n\treturn return_val;\n }\n\n const std::vector<MyNode>& getSourceMeshNodes()\n {\n\treturn d_nodes;\n }\n\n const std::vector<MyHex>& getSourceMeshElements()\n {\n\treturn d_elements;\n }\n\n const std::vector<double> evaluateFieldOnTargetNodes( \n\tconst std::string &field_name,\n\tconst std::vector<MyHex::handle_type> &element_handles,\n\tconst std::vector<MyNode::coordinate_type> &node_coordinates )\n {\n\tif ( field_name == \"MY_DATA_FIELD\" )\n\t{\n\t return d_element_data;\n\t}\n\telse\n\t{\n\t std::vector<double> empty_vec;\n\t return empty_vec;\n\t}\n }\n};\n\n\/\/---------------------------------------------------------------------------\/\/\n\/\/ Tests\n\/\/---------------------------------------------------------------------------\/\/\n\n\/\/ DataSource test.\nTEUCHOS_UNIT_TEST( Mesh, mesh_test )\n{\n using namespace DataTransferKit;\n\n \/\/ Create a DataSource\n Teuchos::RCP< DataSource< std::vector<MyNode>,\n\t\t\t std::vector<MyHex>,\n\t\t\t std::vector<double> > > data_source \n\t= Teuchos::rcp( new MyDataSource() );\n\n \/\/ Create a mesh.\n Teuchos::RCP<Mesh> mesh = createMeshFromDataSource( data_source );\n\n \/\/ Write the mesh to a file.\n mesh->getMoab()->write_mesh( \"mesh_test.vtk\" );\n}\n\n\/\/---------------------------------------------------------------------------\/\/\n\/\/ end tstMesh.cpp\n\/\/---------------------------------------------------------------------------\/\/\n\n<commit_msg>Added a little more complexity to the mesh test.<commit_after>\/\/---------------------------------------------------------------------------\/\/\n\/*!\n * \\file tstMesh.cpp\n * \\author Stuart R. Slattery\n * \\brief Mesh unit tests.\n *\/\n\/\/---------------------------------------------------------------------------\/\/\n\n#include <iostream>\n#include <vector>\n#include <cmath>\n#include <sstream>\n#include <algorithm>\n#include <cassert>\n\n#include <DTK_Mesh.hpp>\n#include <DTK_DataSource.hpp>\n#include <DTK_CoreTypes.hpp>\n#include <DTK_NodeTraits.hpp>\n#include <DTK_ElementTraits.hpp>\n#include <DTK_FieldTraits.hpp>\n\n#include <mpi.h>\n\n#include <Teuchos_UnitTestHarness.hpp>\n#include <Teuchos_DefaultComm.hpp>\n#include <Teuchos_DefaultMpiComm.hpp>\n#include <Teuchos_RCP.hpp>\n#include <Teuchos_OpaqueWrapper.hpp>\n#include <Teuchos_TypeTraits.hpp>\n\n\/\/---------------------------------------------------------------------------\/\/\n\/\/ MPI Setup\n\/\/---------------------------------------------------------------------------\/\/\n\ntemplate<class Ordinal>\nTeuchos::RCP<const Teuchos::Comm<Ordinal> > getDefaultComm()\n{\n#ifdef HAVE_MPI\n return Teuchos::DefaultComm<Ordinal>::getComm();\n#else\n return Teuchos::rcp(new Teuchos::SerialComm<Ordinal>() );\n#endif\n}\n\n\/\/---------------------------------------------------------------------------\/\/\n\/\/ Node Implementation\n\/\/---------------------------------------------------------------------------\/\/\n\nclass MyNode\n{\n private:\n\n std::size_t d_handle;\n std::vector<double> d_coords;\n\n public:\n\n typedef int handle_type;\n typedef double coordinate_type;\n \n MyNode( double x, double y, double z, int handle )\n\t: d_handle( handle )\n {\n\td_coords.push_back(x);\n\td_coords.push_back(y);\n\td_coords.push_back(z);\n }\n\n ~MyNode()\n { \/* ... *\/ }\n\n int handle() const\n { return d_handle; }\n\n std::vector<double>::const_iterator coordsBegin() const\n { return d_coords.begin(); }\n\n std::vector<double>::const_iterator coordsEnd() const\n { return d_coords.end(); }\n};\n\n\/\/---------------------------------------------------------------------------\/\/\n\/\/ Element Implementation\n\/\/---------------------------------------------------------------------------\/\/\n\nclass MyHex\n{\n private:\n\n std::size_t d_handle;\n std::vector<int> d_connectivity;\n\n public:\n\n typedef std::size_t handle_type;\n\n MyHex( int node_0, int node_1, int node_2, int node_3,\n\t int node_4, int node_5, int node_6, int node_7,\n\t std::size_t handle )\n\t: d_handle( handle )\n {\n\td_connectivity.push_back( node_0 );\n\td_connectivity.push_back( node_1 );\n\td_connectivity.push_back( node_2 );\n\td_connectivity.push_back( node_3 );\n\td_connectivity.push_back( node_4 );\n\td_connectivity.push_back( node_5 );\n\td_connectivity.push_back( node_6 );\n\td_connectivity.push_back( node_7 );\n }\n\n ~MyHex()\n { \/* ... *\/ }\n\n int handle() const\n { return d_handle; }\n\n std::vector<int>::const_iterator connectivityBegin() const\n { return d_connectivity.begin(); }\n\n std::vector<int>::const_iterator connectivityEnd() const\n { return d_connectivity.end(); }\n};\n\n\/\/---------------------------------------------------------------------------\/\/\n\/\/ DTK Traits Specializations\n\/\/---------------------------------------------------------------------------\/\/\nnamespace DataTransferKit\n{\n\n\/\/---------------------------------------------------------------------------\/\/\n\/\/ NodeTraits specialization for the MyNode implementation.\ntemplate<>\nstruct NodeTraits<MyNode>\n{\n typedef typename MyNode::handle_type handle_type;\n typedef typename MyNode::coordinate_type coordinate_type;\n typedef typename std::vector<double>::const_iterator \n const_coordinate_iterator;\n \n static inline std::size_t dim()\n { return 3;}\n \n static inline handle_type handle( const MyNode& node ) \n { return node.handle(); }\n \n static inline const_coordinate_iterator coordsBegin( const MyNode& node ) \n { return node.coordsBegin(); }\n\n static inline const_coordinate_iterator coordsEnd( const MyNode& node ) \n { return node.coordsEnd(); }\n};\n\n\/\/---------------------------------------------------------------------------\/\/\n\/\/ ElementTraits specialization for the MyHex implementation.\ntemplate<>\nstruct ElementTraits<MyHex>\n{\n typedef typename MyHex::handle_type handle_type;\n typedef typename std::vector<int>::const_iterator \n const_connectivity_iterator;\n\n static inline std::size_t type()\n { return DTK_REGION; }\n\n static inline std::size_t topology()\n { return DTK_HEXAHEDRON; }\n\n static inline std::size_t numNodes()\n { return 8; }\n\n static inline handle_type handle( const MyHex &hex )\n { return hex.handle(); }\n\n static inline const_connectivity_iterator \n connectivityBegin( const MyHex &hex )\n { return hex.connectivityBegin(); }\n\n static inline const_connectivity_iterator \n connectivityEnd( const MyHex &hex )\n { return hex.connectivityEnd(); }\n};\n\n\/\/---------------------------------------------------------------------------\/\/\n\/\/ FieldTraits specialization for the node field.\ntemplate<>\nstruct FieldTraits< std::vector<MyNode> >\n{\n typedef MyNode value_type;\n typedef std::vector<MyNode>::iterator iterator;\n typedef std::vector<MyNode>::const_iterator const_iterator;\n \n static inline std::size_t size( const std::vector<MyNode> &node_field )\n { return node_field.size(); }\n\n static iterator begin( std::vector<MyNode> &node_field )\n { return node_field.begin(); }\n\n static const_iterator begin( const std::vector<MyNode> &node_field )\n { return node_field.begin(); }\n\n static inline iterator end( std::vector<MyNode> &node_field )\n { return node_field.end(); }\n\n static inline const_iterator end( const std::vector<MyNode> &node_field )\n { return node_field.end(); }\n\n static inline bool empty( const std::vector<MyNode> &node_field )\n { return node_field.empty(); }\n};\n\n\/\/---------------------------------------------------------------------------\/\/\n\/\/ FieldTraits specialization for the element field.\ntemplate<>\nstruct FieldTraits< std::vector<MyHex> >\n{\n typedef MyHex value_type;\n typedef std::vector<MyHex>::iterator iterator;\n typedef std::vector<MyHex>::const_iterator const_iterator;\n \n static inline std::size_t size( const std::vector<MyHex> &quad_field )\n { return quad_field.size(); }\n\n static inline iterator begin( std::vector<MyHex> &quad_field )\n { return quad_field.begin(); }\n\n static inline const_iterator begin( const std::vector<MyHex> &quad_field )\n { return quad_field.begin(); }\n\n static inline iterator end( std::vector<MyHex> &quad_field )\n { return quad_field.end(); }\n\n static inline const_iterator end( const std::vector<MyHex> &quad_field )\n { return quad_field.end(); }\n\n static inline bool empty( const std::vector<MyHex> &quad_field )\n { return quad_field.empty(); }\n};\n\n\/\/---------------------------------------------------------------------------\/\/\n\/\/ FieldTraits specialization for the data field.\ntemplate<>\nstruct FieldTraits< std::vector<double> >\n{\n typedef MyNode value_type;\n typedef std::vector<double>::iterator iterator;\n typedef std::vector<double>::const_iterator const_iterator;\n \n static inline std::size_t size( const std::vector<double> &data_field )\n { return data_field.size(); }\n\n static inline iterator begin( std::vector<double> &data_field )\n { return data_field.begin(); }\n\n static inline const_iterator begin( const std::vector<double> &data_field )\n { return data_field.begin(); }\n\n static inline iterator end( std::vector<double> &data_field )\n { return data_field.end(); }\n\n static inline const_iterator end( const std::vector<double> &data_field )\n { return data_field.end(); }\n\n static inline bool empty( const std::vector<double> &data_field )\n { return data_field.empty(); }\n};\n\n} \/\/ end namespace DataTransferKit\n\n\/\/---------------------------------------------------------------------------\/\/\n\/\/ DataSource Implementation\n\/\/---------------------------------------------------------------------------\/\/\nclass MyDataSource : public DataTransferKit::DataSource< std::vector<MyNode>,\n\t\t\t\t\t\t\t std::vector<MyHex>,\n\t\t\t\t\t\t\t std::vector<double> >\n{\n private:\n\n std::vector<MyNode> d_nodes;\n std::vector<MyHex> d_elements;\n std::vector<double> d_element_data;\n MPI_Comm d_comm;\n\n void createMesh()\n {\n\t\/\/ Make some nodes.\n\td_nodes.push_back( MyNode(0.0, 0.0, 0.0, 0) );\n\td_nodes.push_back( MyNode(1.0, 0.0, 0.0, 4) );\n\td_nodes.push_back( MyNode(1.0, 1.0, 0.0, 9) );\n\td_nodes.push_back( MyNode(0.0, 1.0, 0.0, 2) );\n\td_nodes.push_back( MyNode(0.0, 0.0, 1.0, 3) );\n\td_nodes.push_back( MyNode(1.0, 0.0, 1.0, 8) );\n\td_nodes.push_back( MyNode(1.0, 1.0, 1.0, 1) );\n\td_nodes.push_back( MyNode(0.0, 1.0, 1.0, 6) );\n\td_nodes.push_back( MyNode(0.0, 0.0, 2.0, 12) );\n\td_nodes.push_back( MyNode(1.0, 0.0, 2.0, 7) );\n\td_nodes.push_back( MyNode(1.0, 1.0, 2.0, 13) );\n\td_nodes.push_back( MyNode(0.0, 1.0, 2.0, 5) );\n\n\t\/\/ Make 2 hexahedrons.\n\td_elements.push_back( MyHex( 0, 4, 9, 2, 3, 8, 1, 6, 0 ) );\n\td_elements.push_back( MyHex( 3, 8, 1, 6, 12, 7, 13, 5, 1 ) ); \n\n\t\/\/ Add some data for the hexes.\n\td_element_data.push_back( 1.5 );\n\td_element_data.push_back( 3.5 );\n }\n\n public:\n\n MyDataSource()\n { \n\t\/\/ Build the mesh.\n\tcreateMesh();\n\n\t\/\/ Get the raw MPI_Comm out of Teuchos.\n\tTeuchos::RCP< const Teuchos::Comm<int> > comm = getDefaultComm<int>();\n\tTeuchos::RCP< const Teuchos::MpiComm<int> > mpi_comm = \n\t Teuchos::rcp_dynamic_cast< const Teuchos::MpiComm<int> >( comm );\n\tTeuchos::RCP< const Teuchos::OpaqueWrapper<MPI_Comm> > opaque_comm = \n\t mpi_comm->getRawMpiComm();\n\td_comm = (*opaque_comm)();\n }\n\n ~MyDataSource()\n { \/* ... *\/ }\n\n const MPI_Comm& getSourceComm()\n {\n\treturn d_comm;\n }\n\n bool isFieldSupported( const std::string &field_name )\n {\n\tbool return_val = false;\n\tif ( field_name == \"MY_DATA_FIELD\" )\n\t{\n\t return_val = true;\n\t}\n\treturn return_val;\n }\n\n const std::vector<MyNode>& getSourceMeshNodes()\n {\n\treturn d_nodes;\n }\n\n const std::vector<MyHex>& getSourceMeshElements()\n {\n\treturn d_elements;\n }\n\n const std::vector<double> evaluateFieldOnTargetNodes( \n\tconst std::string &field_name,\n\tconst std::vector<MyHex::handle_type> &element_handles,\n\tconst std::vector<MyNode::coordinate_type> &node_coordinates )\n {\n\tif ( field_name == \"MY_DATA_FIELD\" )\n\t{\n\t return d_element_data;\n\t}\n\telse\n\t{\n\t std::vector<double> empty_vec;\n\t return empty_vec;\n\t}\n }\n};\n\n\/\/---------------------------------------------------------------------------\/\/\n\/\/ Tests\n\/\/---------------------------------------------------------------------------\/\/\n\n\/\/ DataSource test.\nTEUCHOS_UNIT_TEST( Mesh, mesh_test )\n{\n using namespace DataTransferKit;\n\n \/\/ Create a DataSource\n Teuchos::RCP< DataSource< std::vector<MyNode>,\n\t\t\t std::vector<MyHex>,\n\t\t\t std::vector<double> > > data_source \n\t= Teuchos::rcp( new MyDataSource() );\n\n \/\/ Create a mesh.\n Teuchos::RCP<Mesh> mesh = createMeshFromDataSource( data_source );\n\n \/\/ Write the mesh to a file.\n mesh->getMoab()->write_mesh( \"mesh_test.vtk\" );\n}\n\n\/\/---------------------------------------------------------------------------\/\/\n\/\/ end tstMesh.cpp\n\/\/---------------------------------------------------------------------------\/\/\n\n<|endoftext|>"} {"text":"<commit_before>\/\/=======================================================================\n\/\/ Copyright (c) 2014-2017 Baptiste Wicht\n\/\/ Distributed under the terms of the MIT License.\n\/\/ (See accompanying file LICENSE or copy at\n\/\/ http:\/\/opensource.org\/licenses\/MIT)\n\/\/=======================================================================\n\n\/*!\n * \\file stochastic_gradient_descent.hpp\n * \\brief Stochastic Gradient Descent (SGD) Implementation for neural networks\n *\n * This implementations supports fully-connected layers, convolutional layers,\n * RBM layers, CRBM layers, transform layers and pooling layers.\n *\/\n\n#pragma once\n\n#include \"cpp_utils\/static_if.hpp\"\n\n#include \"dll\/util\/checks.hpp\" \/\/ For NaN checks\n#include \"dll\/util\/timers.hpp\" \/\/ For auto_timer\n#include \"dll\/dbn_traits.hpp\"\n\nnamespace dll {\n\ntemplate <typename DBN>\nstruct sgd_trainer {\n using dbn_t = DBN;\n using weight = typename dbn_t::weight;\n using this_type = sgd_trainer<dbn_t>;\n\n static constexpr const auto layers = dbn_t::layers;\n static constexpr const auto batch_size = dbn_t::batch_size;\n\n bool ae_training = false;\n\n dbn_t& dbn;\n\n \/*!\n * \\brief Indicates if the model is being trained as an auto-encoder (true) or not (false)\n *\/\n void set_autoencoder(bool ae){\n this->ae_training = ae;;\n }\n\n template<std::size_t Layer, typename Enable = void>\n struct input_layer_t {\n static constexpr const std::size_t L = Layer;\n };\n\n template<std::size_t Layer>\n struct input_layer_t<Layer, std::enable_if_t< decay_layer_traits<typename dbn_t::template layer_type<Layer>>::is_transform_layer() >> {\n static constexpr const std::size_t L = input_layer_t<Layer + 1>::L;\n };\n\n \/\/ Some Transform layers need to inherit dimensions from back\n\n template<typename L1, typename L2, cpp_enable_if(decay_layer_traits<L1>::is_transform_layer())>\n static void inherit_from_back(L1& l1, L2& l2){\n auto& ctx1 = l1.template get_sgd_context<dbn_t>();\n auto& ctx2 = l2.template get_sgd_context<dbn_t>();\n\n if (ctx1.errors.size() == 0) {\n ctx1.output = ctx2.input;\n ctx1.errors = ctx2.input;\n ctx1.input = ctx2.input;\n }\n }\n\n template<typename L1, typename L2, cpp_disable_if(decay_layer_traits<L1>::is_transform_layer())>\n static void inherit_from_back(L1& \/*l1*\/, L2& \/*l2*\/){ }\n\n \/\/ Some Transform layers need to inherit dimensions from back\n\n template<typename L1, typename L2, cpp_enable_if(decay_layer_traits<L2>::is_transform_layer())>\n static void inherit_from_front(L1& l1, L2& l2){\n auto& ctx1 = l1.template get_sgd_context<dbn_t>();\n auto& ctx2 = l2.template get_sgd_context<dbn_t>();\n\n if (ctx2.errors.size() == 0) {\n ctx2.output = ctx1.output;\n ctx2.errors = ctx1.output;\n ctx2.input = ctx1.output;\n }\n }\n\n template<typename L1, typename L2, cpp_disable_if(decay_layer_traits<L2>::is_transform_layer())>\n static void inherit_from_front(L1& \/*l1*\/, L2& \/*l2*\/){ }\n\n explicit sgd_trainer(dbn_t& dbn) : dbn(dbn) {\n \/\/ Initialize all the SGD contexts\n dbn.for_each_layer([](auto& layer) {\n layer.template init_sgd_context<dbn_t>();\n });\n\n \/\/ Inherit dimensions from back\n\n dbn.for_each_layer_rpair([](auto& l1, auto& l2) {\n constexpr bool l1_transform = decay_layer_traits<decltype(l1)>::is_transform_layer();\n constexpr bool l2_transform = decay_layer_traits<decltype(l2)>::is_transform_layer();\n\n if (l1_transform && (!l2_transform || l2.template get_sgd_context<dbn_t>().errors.size())) {\n this_type::inherit_from_back(l1, l2);\n }\n });\n\n \/\/ Inherit dimensions from front\n\n dbn.for_each_layer_pair([](auto& l1, auto& l2) {\n constexpr bool l2_transform = decay_layer_traits<decltype(l2)>::is_transform_layer();\n\n if (l2_transform) {\n this_type::inherit_from_front(l1, l2);\n }\n });\n }\n\n void init_training(std::size_t) {}\n\n template <typename D, typename It>\n void copy_inputs(D& dest, It first, It last) {\n std::size_t i = 0;\n\n while (first != last) {\n dest(i++) = *first++;\n }\n }\n\n template <typename D, typename It, cpp_enable_if(etl::decay_traits<D>::dimensions() == 2)>\n void copy_labels(D& dest, It first, It last) {\n \/\/TODO How does that work in auto encoder mode ?\n\n std::size_t i = 0;\n\n while (first != last) {\n for (std::size_t l = 0; l < etl::dim<1>(dest); ++l) {\n dest(i, l) = (*first)[l];\n }\n ++i;\n ++first;\n }\n }\n\n template <typename D, typename It, cpp_enable_if(etl::decay_traits<D>::dimensions() == 4)>\n void copy_labels(D& dest, It first, It last) {\n \/\/TODO How does that work in auto encoder mode ?\n\n std::size_t i = 0;\n\n while (first != last) {\n dest(i++) = *first++;\n }\n }\n\n \/\/ TODO: There are way too many copies going in this function\n\n template <typename Inputs, typename Labels, typename InputTransformer>\n std::pair<double, double> train_batch(std::size_t \/*epoch*\/, const Inputs& inputs, const Labels& labels, InputTransformer input_transformer) {\n dll::auto_timer timer(\"sgd::train_batch\");\n\n \/\/ Ensure that the data batch and the label batch are of the same size\n cpp_assert(etl::dim<0>(inputs) == etl::dim<0>(labels), \"Invalid sizes\");\n\n const auto n = etl::dim<0>(inputs);\n\n decltype(auto) first_layer = dbn.template layer_get<0>();\n decltype(auto) first_ctx = first_layer.template get_sgd_context<dbn_t>();\n\n decltype(auto) last_layer = dbn.template layer_get<layers - 1>();\n decltype(auto) last_ctx = last_layer.template get_sgd_context<dbn_t>();\n\n const bool full_batch = etl::dim<0>(inputs) == etl::dim<0>(first_ctx.input);\n\n \/\/Copy inputs into suitable data structure\n\n auto tilde_inputs = inputs;\n for(size_t i = 0; i < etl::dim<0>(tilde_inputs); ++i){\n input_transformer(tilde_inputs(i));\n }\n\n \/\/Feedforward pass\n\n {\n dll::auto_timer timer(\"sgd::forward\");\n\n if(cpp_unlikely(!full_batch)){\n first_ctx.input = 0;\n first_ctx.output = 0;\n\n for (size_t i = 0; i < etl::dim<0>(inputs); ++i) {\n first_ctx.input(i) = tilde_inputs(i);\n }\n } else {\n first_ctx.input = tilde_inputs;\n }\n\n first_layer.batch_activate_hidden(first_ctx.output, first_ctx.input);\n\n dbn.for_each_layer_pair([](auto& layer_1, auto& layer_2) {\n auto& ctx1 = layer_1.template get_sgd_context<dbn_t>();\n auto& ctx2 = layer_2.template get_sgd_context<dbn_t>();\n\n ctx2.input = ctx1.output;\n layer_2.batch_activate_hidden(ctx2.output, ctx2.input);\n });\n }\n\n \/\/Compute the errors of the last layer\n\n if (cpp_unlikely(!full_batch)) {\n first_ctx.input = 0;\n last_ctx.errors = 0;\n\n for (size_t i = 0; i < etl::dim<0>(inputs); ++i) {\n last_ctx.errors(i) = labels(i) - last_ctx.output(i);\n }\n } else {\n last_ctx.errors = labels - last_ctx.output;\n }\n\n \/\/ Backpropagate the error\n\n {\n dll::auto_timer timer(\"sgd::backward\");\n\n dbn.for_each_layer_rpair([](auto& r1, auto& r2) {\n auto& ctx1 = r1.template get_sgd_context<dbn_t>();\n auto& ctx2 = r2.template get_sgd_context<dbn_t>();\n\n r2.adapt_errors(ctx2);\n r2.backward_batch(ctx1.errors, ctx2);\n });\n\n first_layer.adapt_errors(first_ctx);\n }\n\n \/\/ Compute and apply the gradients\n\n {\n dll::auto_timer timer(\"sgd::grad\");\n\n dbn.for_each_layer([this, n](auto& layer) {\n \/\/ Compute the gradients\n layer.compute_gradients(layer.template get_sgd_context<dbn_t>());\n\n \/\/ Apply the gradients\n this->apply_gradients(layer, n);\n });\n }\n\n \/\/ Compute error and loss\n\n double error = 0.0;\n double loss = 0.0;\n\n {\n dll::auto_timer timer(\"sgd::error\");\n\n auto& out = last_ctx.output;\n\n if (cpp_unlikely(!full_batch)) {\n error = amean(labels - slice(out, 0, etl::dim<0>(inputs)));\n\n if (ae_training) {\n \/\/ Reconstruction Cross-Entropy Loss\n loss = -sum((labels >> log(slice(out, 0, etl::dim<0>(inputs)))) + ((1.0 - labels) >> log(1 - slice(out, 0, etl::dim<0>(inputs))))) \/ double(n);\n } else {\n \/\/ Cross-Entropy Loss\n loss = -sum(log(slice(out, 0, etl::dim<0>(inputs))) >> labels) \/ double(n);\n }\n } else {\n error = amean(labels - out);\n\n if (ae_training) {\n \/\/ Reconstruction Cross-Entropy Loss\n loss = -sum((labels >> log(out)) + ((1.0 - labels) >> log(1 - out))) \/ double(n);\n } else {\n \/\/ Cross-Entropy Loss\n loss = -sum(log(out) >> labels) \/ double(n);\n }\n }\n }\n\n return std::make_pair(error, loss);\n }\n\n template <typename L, cpp_enable_if(decay_layer_traits<L>::is_neural_layer())>\n void apply_gradients(L& layer, std::size_t n) {\n dll::auto_timer timer(\"sgd::apply_grad\");\n\n auto& context = layer.template get_sgd_context<dbn_t>();\n\n \/\/Update the gradients\n this->update_grad(layer.w, context.w_grad, w_decay(dbn_traits<dbn_t>::decay()), 0.0);\n this->update_grad(layer.b, context.b_grad, b_decay(dbn_traits<dbn_t>::decay()), 0.0);\n\n \/\/Update with momentum and learning rate\n if (dbn_traits<dbn_t>::has_momentum()) {\n auto momentum = dbn.momentum;\n auto eps = dbn.learning_rate;\n\n \/\/ Note(perf): Some performance could be gained by doing the pair of\n \/\/ operations on w in a loop to improve data locality\n\n context.w_inc = momentum * context.w_inc + (eps \/ n) * context.w_grad;\n layer.w += context.w_inc;\n\n context.b_inc = momentum * context.b_inc + (eps \/ n) * context.b_grad;\n layer.b += context.b_inc;\n } else {\n auto eps = dbn.learning_rate;\n\n layer.w += (eps \/ n) * context.w_grad;\n layer.b += (eps \/ n) * context.b_grad;\n }\n\n nan_check_deep(layer.w);\n nan_check_deep(layer.b);\n }\n\n template <typename L, cpp_disable_if(decay_layer_traits<L>::is_neural_layer())>\n void apply_gradients(L&, std::size_t) {\n \/\/Pooling and transform layers have no weights, therefore no\n \/\/gradients\n }\n\n template <typename V, typename G>\n void update_grad(const V& value, G& grad, decay_type decay, double penalty) {\n if (decay == decay_type::L1) {\n grad = grad - dbn.l1_weight_cost * abs(value) - penalty;\n } else if (decay == decay_type::L2) {\n grad = grad - dbn.l2_weight_cost * value - penalty;\n } else if (decay == decay_type::L1L2) {\n grad = grad - dbn.l1_weight_cost * abs(value) - dbn.l2_weight_cost * value - penalty;\n } else {\n if(penalty != 0.0){\n grad = grad - penalty;\n }\n }\n }\n\n static std::string name() {\n return \"Stochastic Gradient Descent\";\n }\n};\n\n} \/\/end of dll namespace\n<commit_msg>Get rid of inherit of inherit_from_back<commit_after>\/\/=======================================================================\n\/\/ Copyright (c) 2014-2017 Baptiste Wicht\n\/\/ Distributed under the terms of the MIT License.\n\/\/ (See accompanying file LICENSE or copy at\n\/\/ http:\/\/opensource.org\/licenses\/MIT)\n\/\/=======================================================================\n\n\/*!\n * \\file stochastic_gradient_descent.hpp\n * \\brief Stochastic Gradient Descent (SGD) Implementation for neural networks\n *\n * This implementations supports fully-connected layers, convolutional layers,\n * RBM layers, CRBM layers, transform layers and pooling layers.\n *\/\n\n#pragma once\n\n#include \"cpp_utils\/static_if.hpp\"\n\n#include \"dll\/util\/checks.hpp\" \/\/ For NaN checks\n#include \"dll\/util\/timers.hpp\" \/\/ For auto_timer\n\nnamespace dll {\n\ntemplate <typename DBN>\nstruct sgd_trainer {\n using dbn_t = DBN;\n using weight = typename dbn_t::weight;\n using this_type = sgd_trainer<dbn_t>;\n\n static constexpr const auto layers = dbn_t::layers;\n static constexpr const auto batch_size = dbn_t::batch_size;\n\n bool ae_training = false;\n\n dbn_t& dbn;\n\n \/*!\n * \\brief Indicates if the model is being trained as an auto-encoder (true) or not (false)\n *\/\n void set_autoencoder(bool ae){\n this->ae_training = ae;;\n }\n\n \/\/ Transform layers need to inherit dimensions from back\n\n template<typename L1, typename L2, cpp_enable_if(decay_layer_traits<L2>::is_transform_layer())>\n static void inherit_from_front(L1& l1, L2& l2){\n auto& ctx1 = l1.template get_sgd_context<dbn_t>();\n auto& ctx2 = l2.template get_sgd_context<dbn_t>();\n\n if (ctx2.errors.size() == 0) {\n ctx2.output = ctx1.output;\n ctx2.errors = ctx1.output;\n ctx2.input = ctx1.output;\n }\n }\n\n template<typename L1, typename L2, cpp_disable_if(decay_layer_traits<L2>::is_transform_layer())>\n static void inherit_from_front(L1& \/*l1*\/, L2& \/*l2*\/){ }\n\n explicit sgd_trainer(dbn_t& dbn) : dbn(dbn) {\n \/\/ Initialize all the SGD contexts\n\n dbn.for_each_layer([](auto& layer) {\n layer.template init_sgd_context<dbn_t>();\n });\n\n \/\/ Inherit dimensions from front to end (for transform layers)\n\n dbn.for_each_layer_pair([](auto& l1, auto& l2) {\n constexpr bool l2_transform = decay_layer_traits<decltype(l2)>::is_transform_layer();\n\n if (l2_transform) {\n this_type::inherit_from_front(l1, l2);\n }\n });\n }\n\n void init_training(std::size_t) {}\n\n template <typename D, typename It>\n void copy_inputs(D& dest, It first, It last) {\n std::size_t i = 0;\n\n while (first != last) {\n dest(i++) = *first++;\n }\n }\n\n template <typename D, typename It, cpp_enable_if(etl::decay_traits<D>::dimensions() == 2)>\n void copy_labels(D& dest, It first, It last) {\n \/\/TODO How does that work in auto encoder mode ?\n\n std::size_t i = 0;\n\n while (first != last) {\n for (std::size_t l = 0; l < etl::dim<1>(dest); ++l) {\n dest(i, l) = (*first)[l];\n }\n ++i;\n ++first;\n }\n }\n\n template <typename D, typename It, cpp_enable_if(etl::decay_traits<D>::dimensions() == 4)>\n void copy_labels(D& dest, It first, It last) {\n \/\/TODO How does that work in auto encoder mode ?\n\n std::size_t i = 0;\n\n while (first != last) {\n dest(i++) = *first++;\n }\n }\n\n \/\/ TODO: There are way too many copies going in this function\n\n template <typename Inputs, typename Labels, typename InputTransformer>\n std::pair<double, double> train_batch(std::size_t \/*epoch*\/, const Inputs& inputs, const Labels& labels, InputTransformer input_transformer) {\n dll::auto_timer timer(\"sgd::train_batch\");\n\n \/\/ Ensure that the data batch and the label batch are of the same size\n cpp_assert(etl::dim<0>(inputs) == etl::dim<0>(labels), \"Invalid sizes\");\n\n const auto n = etl::dim<0>(inputs);\n\n decltype(auto) first_layer = dbn.template layer_get<0>();\n decltype(auto) first_ctx = first_layer.template get_sgd_context<dbn_t>();\n\n decltype(auto) last_layer = dbn.template layer_get<layers - 1>();\n decltype(auto) last_ctx = last_layer.template get_sgd_context<dbn_t>();\n\n const bool full_batch = etl::dim<0>(inputs) == etl::dim<0>(first_ctx.input);\n\n \/\/Copy inputs into suitable data structure\n\n auto tilde_inputs = inputs;\n for(size_t i = 0; i < etl::dim<0>(tilde_inputs); ++i){\n input_transformer(tilde_inputs(i));\n }\n\n \/\/Feedforward pass\n\n {\n dll::auto_timer timer(\"sgd::forward\");\n\n if(cpp_unlikely(!full_batch)){\n first_ctx.input = 0;\n first_ctx.output = 0;\n\n for (size_t i = 0; i < etl::dim<0>(inputs); ++i) {\n first_ctx.input(i) = tilde_inputs(i);\n }\n } else {\n first_ctx.input = tilde_inputs;\n }\n\n first_layer.batch_activate_hidden(first_ctx.output, first_ctx.input);\n\n dbn.for_each_layer_pair([](auto& layer_1, auto& layer_2) {\n auto& ctx1 = layer_1.template get_sgd_context<dbn_t>();\n auto& ctx2 = layer_2.template get_sgd_context<dbn_t>();\n\n ctx2.input = ctx1.output;\n layer_2.batch_activate_hidden(ctx2.output, ctx2.input);\n });\n }\n\n \/\/Compute the errors of the last layer\n\n if (cpp_unlikely(!full_batch)) {\n first_ctx.input = 0;\n last_ctx.errors = 0;\n\n for (size_t i = 0; i < etl::dim<0>(inputs); ++i) {\n last_ctx.errors(i) = labels(i) - last_ctx.output(i);\n }\n } else {\n last_ctx.errors = labels - last_ctx.output;\n }\n\n \/\/ Backpropagate the error\n\n {\n dll::auto_timer timer(\"sgd::backward\");\n\n dbn.for_each_layer_rpair([](auto& r1, auto& r2) {\n auto& ctx1 = r1.template get_sgd_context<dbn_t>();\n auto& ctx2 = r2.template get_sgd_context<dbn_t>();\n\n r2.adapt_errors(ctx2);\n r2.backward_batch(ctx1.errors, ctx2);\n });\n\n first_layer.adapt_errors(first_ctx);\n }\n\n \/\/ Compute and apply the gradients\n\n {\n dll::auto_timer timer(\"sgd::grad\");\n\n dbn.for_each_layer([this, n](auto& layer) {\n \/\/ Compute the gradients\n layer.compute_gradients(layer.template get_sgd_context<dbn_t>());\n\n \/\/ Apply the gradients\n this->apply_gradients(layer, n);\n });\n }\n\n \/\/ Compute error and loss\n\n double error = 0.0;\n double loss = 0.0;\n\n {\n dll::auto_timer timer(\"sgd::error\");\n\n auto& out = last_ctx.output;\n\n if (cpp_unlikely(!full_batch)) {\n error = amean(labels - slice(out, 0, etl::dim<0>(inputs)));\n\n if (ae_training) {\n \/\/ Reconstruction Cross-Entropy Loss\n loss = -sum((labels >> log(slice(out, 0, etl::dim<0>(inputs)))) + ((1.0 - labels) >> log(1 - slice(out, 0, etl::dim<0>(inputs))))) \/ double(n);\n } else {\n \/\/ Cross-Entropy Loss\n loss = -sum(log(slice(out, 0, etl::dim<0>(inputs))) >> labels) \/ double(n);\n }\n } else {\n error = amean(labels - out);\n\n if (ae_training) {\n \/\/ Reconstruction Cross-Entropy Loss\n loss = -sum((labels >> log(out)) + ((1.0 - labels) >> log(1 - out))) \/ double(n);\n } else {\n \/\/ Cross-Entropy Loss\n loss = -sum(log(out) >> labels) \/ double(n);\n }\n }\n }\n\n return std::make_pair(error, loss);\n }\n\n template <typename L, cpp_enable_if(decay_layer_traits<L>::is_neural_layer())>\n void apply_gradients(L& layer, std::size_t n) {\n dll::auto_timer timer(\"sgd::apply_grad\");\n\n auto& context = layer.template get_sgd_context<dbn_t>();\n\n \/\/Update the gradients\n this->update_grad(layer.w, context.w_grad, w_decay(dbn_traits<dbn_t>::decay()), 0.0);\n this->update_grad(layer.b, context.b_grad, b_decay(dbn_traits<dbn_t>::decay()), 0.0);\n\n \/\/Update with momentum and learning rate\n if (dbn_traits<dbn_t>::has_momentum()) {\n auto momentum = dbn.momentum;\n auto eps = dbn.learning_rate;\n\n \/\/ Note(perf): Some performance could be gained by doing the pair of\n \/\/ operations on w in a loop to improve data locality\n\n context.w_inc = momentum * context.w_inc + (eps \/ n) * context.w_grad;\n layer.w += context.w_inc;\n\n context.b_inc = momentum * context.b_inc + (eps \/ n) * context.b_grad;\n layer.b += context.b_inc;\n } else {\n auto eps = dbn.learning_rate;\n\n layer.w += (eps \/ n) * context.w_grad;\n layer.b += (eps \/ n) * context.b_grad;\n }\n\n nan_check_deep(layer.w);\n nan_check_deep(layer.b);\n }\n\n template <typename L, cpp_disable_if(decay_layer_traits<L>::is_neural_layer())>\n void apply_gradients(L&, std::size_t) {\n \/\/Pooling and transform layers have no weights, therefore no\n \/\/gradients\n }\n\n template <typename V, typename G>\n void update_grad(const V& value, G& grad, decay_type decay, double penalty) {\n if (decay == decay_type::L1) {\n grad = grad - dbn.l1_weight_cost * abs(value) - penalty;\n } else if (decay == decay_type::L2) {\n grad = grad - dbn.l2_weight_cost * value - penalty;\n } else if (decay == decay_type::L1L2) {\n grad = grad - dbn.l1_weight_cost * abs(value) - dbn.l2_weight_cost * value - penalty;\n } else {\n if(penalty != 0.0){\n grad = grad - penalty;\n }\n }\n }\n\n static std::string name() {\n return \"Stochastic Gradient Descent\";\n }\n};\n\n} \/\/end of dll namespace\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#include \"WidgetPrivateData.hpp\"\n#include \"..\/TopLevelWidget.hpp\"\n#include \"..\/Window.hpp\"\n\nSTART_NAMESPACE_DGL\n\n\/\/ --------------------------------------------------------------------------------------------------------------------\n\/\/ Widget\n\nWidget::Widget(TopLevelWidget* const topLevelWidget)\n : pData(new PrivateData(this, topLevelWidget)) {}\n\nWidget::Widget(Widget* const parentWidget)\n : pData(new PrivateData(this, parentWidget)) {}\n\nWidget::~Widget()\n{\n delete pData;\n}\n\nbool Widget::isVisible() const noexcept\n{\n return pData->visible;\n}\n\nvoid Widget::setVisible(bool visible)\n{\n if (pData->visible == visible)\n return;\n\n pData->visible = visible;\n repaint();\n\n \/\/ FIXME check case of hiding a previously visible widget, does it trigger a repaint?\n}\n\nvoid Widget::show()\n{\n setVisible(true);\n}\n\nvoid Widget::hide()\n{\n setVisible(false);\n}\n\nuint Widget::getWidth() const noexcept\n{\n return pData->size.getWidth();\n}\n\nuint Widget::getHeight() const noexcept\n{\n return pData->size.getHeight();\n}\n\nconst Size<uint> Widget::getSize() const noexcept\n{\n return pData->size;\n}\n\nvoid Widget::setWidth(uint width) noexcept\n{\n if (pData->size.getWidth() == width)\n return;\n\n ResizeEvent ev;\n ev.oldSize = pData->size;\n ev.size = Size<uint>(width, pData->size.getHeight());\n\n pData->size.setWidth(width);\n onResize(ev);\n\n repaint();\n}\n\nvoid Widget::setHeight(uint height) noexcept\n{\n if (pData->size.getHeight() == height)\n return;\n\n ResizeEvent ev;\n ev.oldSize = pData->size;\n ev.size = Size<uint>(pData->size.getWidth(), height);\n\n pData->size.setHeight(height);\n onResize(ev);\n\n repaint();\n}\n\nvoid Widget::setSize(uint width, uint height) noexcept\n{\n setSize(Size<uint>(width, height));\n}\n\nvoid Widget::setSize(const Size<uint>& size) noexcept\n{\n if (pData->size == size)\n return;\n\n ResizeEvent ev;\n ev.oldSize = pData->size;\n ev.size = size;\n\n pData->size = size;\n onResize(ev);\n\n repaint();\n}\n\nApplication& Widget::getApp() const noexcept\n{\n DISTRHO_SAFE_ASSERT(pData->topLevelWidget != nullptr);\n return pData->topLevelWidget->getApp();\n}\n\nWindow& Widget::getWindow() const noexcept\n{\n DISTRHO_SAFE_ASSERT(pData->topLevelWidget != nullptr);\n return pData->topLevelWidget->getWindow();\n}\n\nconst GraphicsContext& Widget::getGraphicsContext() const noexcept\n{\n DISTRHO_SAFE_ASSERT(pData->topLevelWidget != nullptr);\n return pData->topLevelWidget->getWindow().getGraphicsContext();\n}\n\nTopLevelWidget* Widget::getTopLevelWidget() const noexcept\n{\n return pData->topLevelWidget;\n}\n\nvoid Widget::repaint() noexcept\n{\n}\n\nuint Widget::getId() const noexcept\n{\n return pData->id;\n}\n\nvoid Widget::setId(uint id) noexcept\n{\n pData->id = id;\n}\n\nbool Widget::onKeyboard(const KeyboardEvent&)\n{\n return false;\n}\n\nbool Widget::onSpecial(const SpecialEvent&)\n{\n return false;\n}\n\nbool Widget::onCharacterInput(const CharacterInputEvent&)\n{\n return false;\n}\n\nbool Widget::onMouse(const MouseEvent&)\n{\n return false;\n}\n\nbool Widget::onMotion(const MotionEvent&)\n{\n return false;\n}\n\nbool Widget::onScroll(const ScrollEvent&)\n{\n return false;\n}\n\nvoid Widget::onResize(const ResizeEvent&)\n{\n}\n\n\/\/ --------------------------------------------------------------------------------------------------------------------\n\nEND_NAMESPACE_DGL\n<commit_msg>Make widget pass events into subwidgets<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#include \"WidgetPrivateData.hpp\"\n#include \"..\/TopLevelWidget.hpp\"\n#include \"..\/Window.hpp\"\n\nSTART_NAMESPACE_DGL\n\n\/\/ --------------------------------------------------------------------------------------------------------------------\n\/\/ Widget\n\nWidget::Widget(TopLevelWidget* const topLevelWidget)\n : pData(new PrivateData(this, topLevelWidget)) {}\n\nWidget::Widget(Widget* const parentWidget)\n : pData(new PrivateData(this, parentWidget)) {}\n\nWidget::~Widget()\n{\n delete pData;\n}\n\nbool Widget::isVisible() const noexcept\n{\n return pData->visible;\n}\n\nvoid Widget::setVisible(bool visible)\n{\n if (pData->visible == visible)\n return;\n\n pData->visible = visible;\n repaint();\n\n \/\/ FIXME check case of hiding a previously visible widget, does it trigger a repaint?\n}\n\nvoid Widget::show()\n{\n setVisible(true);\n}\n\nvoid Widget::hide()\n{\n setVisible(false);\n}\n\nuint Widget::getWidth() const noexcept\n{\n return pData->size.getWidth();\n}\n\nuint Widget::getHeight() const noexcept\n{\n return pData->size.getHeight();\n}\n\nconst Size<uint> Widget::getSize() const noexcept\n{\n return pData->size;\n}\n\nvoid Widget::setWidth(uint width) noexcept\n{\n if (pData->size.getWidth() == width)\n return;\n\n ResizeEvent ev;\n ev.oldSize = pData->size;\n ev.size = Size<uint>(width, pData->size.getHeight());\n\n pData->size.setWidth(width);\n onResize(ev);\n\n repaint();\n}\n\nvoid Widget::setHeight(uint height) noexcept\n{\n if (pData->size.getHeight() == height)\n return;\n\n ResizeEvent ev;\n ev.oldSize = pData->size;\n ev.size = Size<uint>(pData->size.getWidth(), height);\n\n pData->size.setHeight(height);\n onResize(ev);\n\n repaint();\n}\n\nvoid Widget::setSize(uint width, uint height) noexcept\n{\n setSize(Size<uint>(width, height));\n}\n\nvoid Widget::setSize(const Size<uint>& size) noexcept\n{\n if (pData->size == size)\n return;\n\n ResizeEvent ev;\n ev.oldSize = pData->size;\n ev.size = size;\n\n pData->size = size;\n onResize(ev);\n\n repaint();\n}\n\nApplication& Widget::getApp() const noexcept\n{\n DISTRHO_SAFE_ASSERT(pData->topLevelWidget != nullptr);\n return pData->topLevelWidget->getApp();\n}\n\nWindow& Widget::getWindow() const noexcept\n{\n DISTRHO_SAFE_ASSERT(pData->topLevelWidget != nullptr);\n return pData->topLevelWidget->getWindow();\n}\n\nconst GraphicsContext& Widget::getGraphicsContext() const noexcept\n{\n DISTRHO_SAFE_ASSERT(pData->topLevelWidget != nullptr);\n return pData->topLevelWidget->getWindow().getGraphicsContext();\n}\n\nTopLevelWidget* Widget::getTopLevelWidget() const noexcept\n{\n return pData->topLevelWidget;\n}\n\nvoid Widget::repaint() noexcept\n{\n}\n\nuint Widget::getId() const noexcept\n{\n return pData->id;\n}\n\nvoid Widget::setId(uint id) noexcept\n{\n pData->id = id;\n}\n\nbool Widget::onKeyboard(const KeyboardEvent& ev)\n{\n return pData->giveKeyboardEventForSubWidgets(ev);\n}\n\nbool Widget::onSpecial(const SpecialEvent& ev)\n{\n return pData->giveSpecialEventForSubWidgets(ev);\n}\n\nbool Widget::onCharacterInput(const CharacterInputEvent& ev)\n{\n return pData->giveCharacterInputEventForSubWidgets(ev);\n}\n\nbool Widget::onMouse(const MouseEvent& ev)\n{\n MouseEvent rev = ev;\n return pData->giveMouseEventForSubWidgets(rev);\n}\n\nbool Widget::onMotion(const MotionEvent& ev)\n{\n MotionEvent rev = ev;\n return pData->giveMotionEventForSubWidgets(rev);\n}\n\nbool Widget::onScroll(const ScrollEvent& ev)\n{\n ScrollEvent rev = ev;\n return pData->giveScrollEventForSubWidgets(rev);\n}\n\nvoid Widget::onResize(const ResizeEvent&)\n{\n}\n\n\/\/ --------------------------------------------------------------------------------------------------------------------\n\nEND_NAMESPACE_DGL\n<|endoftext|>"} {"text":"<commit_before>\/*\n * Copyright (c) 2013-2015, Muhammad Shahzad Shafi <shahzad at voip-demos dot com>\n *\n * All rights reserved.\n *\n * Redistribution and use in source and binary forms, with or without\n * modification, are permitted per Mozilla Public License v2.0.\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 <random>\n#include <algorithm> \n\n#include \"itv_utils.h\"\n\nusing namespace::std;\n\n#ifndef _MSC_VER\n\/\/ trim string from start\nstd::string <rim(std::string &s) {\n\ts.erase(s.begin(), std::find_if(s.begin(), s.end(), std::not1(std::ptr_fun<int, int>(std::isspace))));\n\treturn s;\n};\n\n\/\/ trim string from end\nstd::string &rtrim(std::string &s) {\n\ts.erase(std::find_if(s.rbegin(), s.rend(), std::not1(std::ptr_fun<int, int>(std::isspace))).base(), s.end());\n\treturn s;\n};\n\n\/\/ trim string from both ends\nstd::string &trim(std::string &s) {\n\treturn ltrim(rtrim(s));\n};\n\n\/\/ split string into list according to given delimiter\nstd::list<std::string>* split(std::string& s, std::string& delimiter) {\n\tsize_t last = 0, next = 0;\n\tstd::list<std::string>* ret = new list<std::string>();\n\twhile ((next = s.find(delimiter, last)) != string::npos) {\n\t\tret->push_back(s.substr(last, next-last));\n\t\tlast = next + 1;\n\t};\n\tret->push_back(s.substr(last));\n\treturn ret;\n};\n#endif\n\n\/\/ generate a random number from 0 to given number\nsize_t generate_random(size_t max) {\n\treturn get_random(0, max);\n};\n\n\/\/ generate a random number within range\nsize_t get_random(size_t min, size_t max) {\n\tstd::random_device generator;\n\tstd::uniform_int_distribution<size_t> distribution(min, max);\n\treturn distribution(generator);\n};\n\n\/\/ convert codepoint to utf8 char\nstd::string to_utf8(size_t cp) {\n\tchar c[5]={ 0x00,0x00,0x00,0x00,0x00 };\n\tif\t\t(cp<=0x7F)\t\t{ c[0] = cp; }\n\telse if\t(cp<=0x7FF)\t\t{ c[0] = (cp>>6)+192; c[1] = (cp&63)+128; }\n\telse if\t(0xd800<=cp && cp<=0xdfff) { } \/\/invalid block of utf8\n\telse if\t(cp<=0xFFFF)\t{ c[0] = (cp>>12)+224; c[1]= ((cp>>6)&63)+128; c[2]=(cp&63)+128; }\n\telse if\t(cp<=0x10FFFF)\t{ c[0] = (cp>>18)+240; c[1] = ((cp>>12)&63)+128; c[2] = ((cp>>6)&63)+128; c[3]=(cp&63)+128; }\n\treturn std::string(c);\n}\n\n\/\/ convert codepoints to utf8 string\nstd::string to_utf8(std::list<size_t>& msg) {\n\tstd::string str;\n\tfor (auto i=msg.begin(); i!=msg.end(); i++) { str += to_utf8(*i); };\n\treturn str;\n};\n\n\/\/ converts utf8 string to codepoint list\nstd::list<size_t>* from_utf8(std::string& msg) {\n\tstd::list<size_t> *ret = new std::list<size_t>();\n\tstd::string::size_type len = msg.length();\n\tif (len < 1) return ret;\n\n\tfor(std::string::size_type i=0; i<len; i++) {\n\t\tunsigned char u0 = msg[i+0];\n\t\tif (u0>=0 && u0<=127)\t{ ret->push_back(u0); continue; };\n\t\tif ((i+1) < len) {\n\t\t\tunsigned char u1 = msg[++i];\n\t\t\tif (u0>=192 && u0<=223)\t{ ret->push_back((u0-192)*64 + (u1-128)); continue; };\n\t\t\tif (u0==0xed && (u1 & 0xa0) == 0xa0) { continue; }; \/\/codepoints 0xd800 to 0xdfff are not valid\n\t\t\tif ((i+2) < len) {\n\t\t\t\tunsigned char u2 = msg[++i];\n\t\t\t\tif (u0>=224 && u0<=239)\t{ ret->push_back((u0-224)*4096 + (u1-128)*64 + (u2-128)); continue; };\n\t\t\t\tif ((i+3) < len) {\n\t\t\t\t\tunsigned char u3 = msg[++i];\n\t\t\t\t\tif (u0>=240 && u0<=247)\t{ ret->push_back((u0-240)*262144 + (u1-128)*4096 + (u2-128)*64 + (u3-128)); continue; };\n\t\t\t\t};\n\t\t\t};\n\t\t};\n\t};\n\n\treturn ret;\n};\n\n<commit_msg>fixed a bug that causing wrong utf8 conversion when code point > 0x800<commit_after>\/*\n * Copyright (c) 2013-2015, Muhammad Shahzad Shafi <shahzad at voip-demos dot com>\n *\n * All rights reserved.\n *\n * Redistribution and use in source and binary forms, with or without\n * modification, are permitted per Mozilla Public License v2.0.\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 <random>\n#include <algorithm> \n\n#include \"itv_utils.h\"\n\nusing namespace::std;\n\n#ifndef _MSC_VER\n\/\/ trim string from start\nstd::string <rim(std::string &s) {\n\ts.erase(s.begin(), std::find_if(s.begin(), s.end(), std::not1(std::ptr_fun<int, int>(std::isspace))));\n\treturn s;\n};\n\n\/\/ trim string from end\nstd::string &rtrim(std::string &s) {\n\ts.erase(std::find_if(s.rbegin(), s.rend(), std::not1(std::ptr_fun<int, int>(std::isspace))).base(), s.end());\n\treturn s;\n};\n\n\/\/ trim string from both ends\nstd::string &trim(std::string &s) {\n\treturn ltrim(rtrim(s));\n};\n\n\/\/ split string into list according to given delimiter\nstd::list<std::string>* split(std::string& s, std::string& delimiter) {\n\tsize_t last = 0, next = 0;\n\tstd::list<std::string>* ret = new list<std::string>();\n\twhile ((next = s.find(delimiter, last)) != string::npos) {\n\t\tret->push_back(s.substr(last, next-last));\n\t\tlast = next + 1;\n\t};\n\tret->push_back(s.substr(last));\n\treturn ret;\n};\n#endif\n\n\/\/ generate a random number from 0 to given number\nsize_t generate_random(size_t max) {\n\treturn get_random(0, max);\n};\n\n\/\/ generate a random number within range\nsize_t get_random(size_t min, size_t max) {\n\tstd::random_device generator;\n\tstd::uniform_int_distribution<size_t> distribution(min, max);\n\treturn distribution(generator);\n};\n\n\/\/ convert codepoint to utf8 char\nstd::string to_utf8(size_t cp) {\n\tchar c[5]={ 0x00,0x00,0x00,0x00,0x00 };\n\tif\t\t(cp<=0x7F)\t\t{ c[0] = cp; }\n\telse if\t(cp<=0x7FF)\t\t{ c[0] = (cp>>6)+192; c[1] = (cp&63)+128; }\n\telse if\t(0xd800<=cp && cp<=0xdfff) { } \/\/invalid block of utf8\n\telse if\t(cp<=0xFFFF)\t{ c[0] = (cp>>12)+224; c[1]= ((cp>>6)&63)+128; c[2]=(cp&63)+128; }\n\telse if\t(cp<=0x10FFFF)\t{ c[0] = (cp>>18)+240; c[1] = ((cp>>12)&63)+128; c[2] = ((cp>>6)&63)+128; c[3]=(cp&63)+128; }\n\treturn std::string(c);\n}\n\n\/\/ convert codepoints to utf8 string\nstd::string to_utf8(std::list<size_t>& msg) {\n\tstd::string str = std::string();\n\tfor (auto i=msg.begin(); i!=msg.end(); i++) { str += to_utf8(*i); };\n\treturn str;\n};\n\n\/\/ converts utf8 string to codepoint list\nstd::list<size_t>* from_utf8(std::string& msg) {\n\tstd::list<size_t> *ret = new std::list<size_t>();\n\tstd::string::size_type len = msg.length();\n\tif (len < 1) return ret;\n\n\tfor(std::string::size_type i=0; i<len; i++) {\n\t\tunsigned char u0 = msg[i+0];\n\t\tif (u0>=0 && u0<=127)\t{ ret->push_back(u0); continue; };\n\t\tif ((i+1) < len) {\n\t\t\tunsigned char u1 = msg[++i];\n\t\t\tif (u0>=192 && u0<=223)\t{ ret->push_back((u0-192)*64 + (u1-128)); continue; };\n\t\t\tif (u0==0xed && (u1 & 0xa0) == 0xa0) { continue; }; \/\/codepoints 0xd800 to 0xdfff are not valid\n\t\t\tif ((i+1) < len) {\n\t\t\t\tunsigned char u2 = msg[++i];\n\t\t\t\tif (u0>=224 && u0<=239)\t{ ret->push_back((u0-224)*4096 + (u1-128)*64 + (u2-128)); continue; };\n\t\t\t\tif ((i+1) < len) {\n\t\t\t\t\tunsigned char u3 = msg[++i];\n\t\t\t\t\tif (u0>=240 && u0<=247)\t{ ret->push_back((u0-240)*262144 + (u1-128)*4096 + (u2-128)*64 + (u3-128)); continue; };\n\t\t\t\t};\n\t\t\t};\n\t\t};\n\t};\n\n\treturn ret;\n};\n\n<|endoftext|>"} {"text":"<commit_before>#include \"BufferManager.h\"\n\n\n#include <fcntl.h>\n#include <sys\/stat.h>\n#include <sys\/types.h>\n#include <unistd.h>\n#include <errno.h>\n#include <pthread.h>\n\nostream& operator<< (ostream &out, handshake_container_t &hand)\n{\n out << \"hand:\" << \" \";\n out << hand.valid;\n out << hand.mem_released;\n out << hand.isFirstInsn;\n out << hand.isLastInsn;\n out << hand.killThread;\n out << \" \";\n out << hand.mem_buffer.size();\n out << \" \";\n out << \"pc:\" << hand.handshake.pc << \" \"; \n out << \"coreid:\" << hand.handshake.coreID << \" \"; \n out << \"npc:\" << hand.handshake.npc << \" \"; \n out << \"tpc:\" << hand.handshake.tpc << \" \"; \n out << \"brtaken:\" << hand.handshake.brtaken << \" \"; \n out << \"ins:\" << hand.handshake.ins << \" \";\n out << \"flags:\" << hand.handshake.sleep_thread << hand.handshake.resume_thread;\n out << hand.handshake.iteration_correction << hand.handshake.real;\n out << hand.handshake.in_critical_section;\n out << \" slicenum:\" << hand.handshake.slice_num << \" \";\n out << \"feederslicelen:\" << hand.handshake.feeder_slice_length << \" \";\n out << \"feedersliceweight:\" << hand.handshake.slice_weight_times_1000 << \" \";\n out.flush();\n return out;\n}\n\nBufferManager::BufferManager()\n{ \n}\n\nhandshake_container_t* BufferManager::front(THREADID tid)\n{\n GetLock(locks_[tid], tid+1);\n checkFirstAccess(tid);\n assert(queueSizes_[tid] > 0);\n assert(consumeBuffer_[tid]->size() > 0);\n\n ReleaseLock(locks_[tid]);\n return consumeBuffer_[tid]->front();\n}\n\nhandshake_container_t* BufferManager::back(THREADID tid)\n{\n GetLock(locks_[tid], tid+1);\n checkFirstAccess(tid);\n assert(queueSizes_[tid] > 0);\n assert(produceBuffer_[tid]->size() > 0);\n ReleaseLock(locks_[tid]);\n return produceBuffer_[tid]->back();\n}\n\nbool BufferManager::empty(THREADID tid)\n{\n GetLock(locks_[tid], tid+1);\n checkFirstAccess(tid); \n bool result = queueSizes_[tid] == 0;\n ReleaseLock(locks_[tid]);\n return result;\n}\n\nvoid BufferManager::push(THREADID tid, handshake_container_t* handshake, bool fromILDJIT)\n{\n GetLock(locks_[tid], tid+1);\n checkFirstAccess(tid); \n \n handshake_container_t* free = getPooledHandshake(tid, fromILDJIT); \n bool first = free->isFirstInsn;\n *free = *handshake; \n free->isFirstInsn = first;\n\n produceBuffer_[tid]->push(free);\n queueSizes_[tid]++;\n ReleaseLock(locks_[tid]);\n}\n\nvoid BufferManager::pop(THREADID tid, handshake_container_t* handshake)\n{\n GetLock(locks_[tid], tid+1);\n checkFirstAccess(tid);\n\n assert(queueSizes_[tid] > 0);\n assert(consumeBuffer_[tid]->size() > 0);\n consumeBuffer_[tid]->pop();\n\n releasePooledHandshake(tid, handshake);\n queueSizes_[tid]--;\n ReleaseLock(locks_[tid]);\n}\n\nbool BufferManager::hasThread(THREADID tid) \n{\n GetLock(locks_[tid], tid+1);\n bool result = queueSizes_.count(tid);\n ReleaseLock(locks_[tid]);\n return (result != 0);\n}\n\nunsigned int BufferManager::size()\n{\n GetLock(locks_[tid], tid+1);\n unsigned int result = queueSizes_.size();\n ReleaseLock(locks_[tid]);\n return result;\n}\n\nvoid BufferManager::checkFirstAccess(THREADID tid)\n{\n if(queueSizes_.count(tid) == 0) {\n \n PIN_Yield();\n sleep(5);\n PIN_Yield();\n \n queueSizes_[tid] = 0;\n consumeBuffer_[tid] = new Buffer();\n produceBuffer_[tid] = new Buffer();\n \n for (int i=0; i < 50000; i++) {\n handshake_container_t* new_handshake = new handshake_container_t();\n handshake_pool_[tid].push(new_handshake); \n }\n \n locks_[tid] = new PIN_LOCK();\n InitLock(locks_[tid]);\n \n char s_tid[100];\n sprintf(s_tid, \"%d\", tid);\n\n string logName = \".\/output_ring_cache\/handshake_\" + string(s_tid) + \".log\"; \n logs_[tid] = new ofstream();\n (*(logs_[tid])).open(logName.c_str()); \n }\n}\n\nhandshake_container_t* BufferManager::getPooledHandshake(THREADID tid, bool fromILDJIT)\n{\n checkFirstAccess(tid); \n\n handshake_queue_t *pool;\n pool = &(handshake_pool_[tid]);\n\n long long int spins = 0; \n while(pool->empty()) {\n ReleaseLock(&simbuffer_lock);\n PIN_Yield();\n GetLock(&simbuffer_lock, tid+1);\n spins++;\n if(spins >= 7000000LL) {\n cerr << tid << \" [getPooledHandshake()]: That's a lot of spins!\" << endl;\n spins = 0;\n }\n }\n\n handshake_container_t* result = pool->front();\n ASSERTX(result != NULL);\n\n pool->pop();\n \n if((didFirstInsn_.count(tid) == 0) && (!fromILDJIT)) { \n result->isFirstInsn = true;\n didFirstInsn_[tid] = true;\n }\n else {\n result->isFirstInsn = false;\n }\n \n return result;\n}\n\nvoid BufferManager::releasePooledHandshake(THREADID tid, handshake_container_t* handshake)\n{\n handshake_pool_[tid].push(handshake); \n return;\n}\n\nbool BufferManager::isFirstInsn(THREADID tid)\n{\n GetLock(locks_[tid], tid+1);\n bool isFirst = (didFirstInsn_.count(tid) == 0);\n ReleaseLock(locks_[tid]);\n return isFirst;\n}\n<commit_msg>compile error fixed from last commit<commit_after>#include \"BufferManager.h\"\n\n\n#include <fcntl.h>\n#include <sys\/stat.h>\n#include <sys\/types.h>\n#include <unistd.h>\n#include <errno.h>\n#include <pthread.h>\n\nostream& operator<< (ostream &out, handshake_container_t &hand)\n{\n out << \"hand:\" << \" \";\n out << hand.valid;\n out << hand.mem_released;\n out << hand.isFirstInsn;\n out << hand.isLastInsn;\n out << hand.killThread;\n out << \" \";\n out << hand.mem_buffer.size();\n out << \" \";\n out << \"pc:\" << hand.handshake.pc << \" \"; \n out << \"coreid:\" << hand.handshake.coreID << \" \"; \n out << \"npc:\" << hand.handshake.npc << \" \"; \n out << \"tpc:\" << hand.handshake.tpc << \" \"; \n out << \"brtaken:\" << hand.handshake.brtaken << \" \"; \n out << \"ins:\" << hand.handshake.ins << \" \";\n out << \"flags:\" << hand.handshake.sleep_thread << hand.handshake.resume_thread;\n out << hand.handshake.iteration_correction << hand.handshake.real;\n out << hand.handshake.in_critical_section;\n out << \" slicenum:\" << hand.handshake.slice_num << \" \";\n out << \"feederslicelen:\" << hand.handshake.feeder_slice_length << \" \";\n out << \"feedersliceweight:\" << hand.handshake.slice_weight_times_1000 << \" \";\n out.flush();\n return out;\n}\n\nBufferManager::BufferManager()\n{ \n}\n\nhandshake_container_t* BufferManager::front(THREADID tid)\n{\n GetLock(locks_[tid], tid+1);\n checkFirstAccess(tid);\n assert(queueSizes_[tid] > 0);\n assert(consumeBuffer_[tid]->size() > 0);\n\n ReleaseLock(locks_[tid]);\n return consumeBuffer_[tid]->front();\n}\n\nhandshake_container_t* BufferManager::back(THREADID tid)\n{\n GetLock(locks_[tid], tid+1);\n checkFirstAccess(tid);\n assert(queueSizes_[tid] > 0);\n assert(produceBuffer_[tid]->size() > 0);\n ReleaseLock(locks_[tid]);\n return produceBuffer_[tid]->back();\n}\n\nbool BufferManager::empty(THREADID tid)\n{\n GetLock(locks_[tid], tid+1);\n checkFirstAccess(tid); \n bool result = queueSizes_[tid] == 0;\n ReleaseLock(locks_[tid]);\n return result;\n}\n\nvoid BufferManager::push(THREADID tid, handshake_container_t* handshake, bool fromILDJIT)\n{\n GetLock(locks_[tid], tid+1);\n checkFirstAccess(tid); \n \n handshake_container_t* free = getPooledHandshake(tid, fromILDJIT); \n bool first = free->isFirstInsn;\n *free = *handshake; \n free->isFirstInsn = first;\n\n produceBuffer_[tid]->push(free);\n queueSizes_[tid]++;\n ReleaseLock(locks_[tid]);\n}\n\nvoid BufferManager::pop(THREADID tid, handshake_container_t* handshake)\n{\n GetLock(locks_[tid], tid+1);\n checkFirstAccess(tid);\n\n assert(queueSizes_[tid] > 0);\n assert(consumeBuffer_[tid]->size() > 0);\n consumeBuffer_[tid]->pop();\n\n releasePooledHandshake(tid, handshake);\n queueSizes_[tid]--;\n ReleaseLock(locks_[tid]);\n}\n\nbool BufferManager::hasThread(THREADID tid) \n{\n GetLock(locks_[tid], tid+1);\n bool result = queueSizes_.count(tid);\n ReleaseLock(locks_[tid]);\n return (result != 0);\n}\n\nunsigned int BufferManager::size()\n{\n unsigned int result = queueSizes_.size();\n return result;\n}\n\nvoid BufferManager::checkFirstAccess(THREADID tid)\n{\n if(queueSizes_.count(tid) == 0) {\n \n PIN_Yield();\n sleep(5);\n PIN_Yield();\n \n queueSizes_[tid] = 0;\n consumeBuffer_[tid] = new Buffer();\n produceBuffer_[tid] = new Buffer();\n \n for (int i=0; i < 50000; i++) {\n handshake_container_t* new_handshake = new handshake_container_t();\n handshake_pool_[tid].push(new_handshake); \n }\n \n locks_[tid] = new PIN_LOCK();\n InitLock(locks_[tid]);\n \n char s_tid[100];\n sprintf(s_tid, \"%d\", tid);\n\n string logName = \".\/output_ring_cache\/handshake_\" + string(s_tid) + \".log\"; \n logs_[tid] = new ofstream();\n (*(logs_[tid])).open(logName.c_str()); \n }\n}\n\nhandshake_container_t* BufferManager::getPooledHandshake(THREADID tid, bool fromILDJIT)\n{\n checkFirstAccess(tid); \n\n handshake_queue_t *pool;\n pool = &(handshake_pool_[tid]);\n\n long long int spins = 0; \n while(pool->empty()) {\n ReleaseLock(&simbuffer_lock);\n PIN_Yield();\n GetLock(&simbuffer_lock, tid+1);\n spins++;\n if(spins >= 7000000LL) {\n cerr << tid << \" [getPooledHandshake()]: That's a lot of spins!\" << endl;\n spins = 0;\n }\n }\n\n handshake_container_t* result = pool->front();\n ASSERTX(result != NULL);\n\n pool->pop();\n \n if((didFirstInsn_.count(tid) == 0) && (!fromILDJIT)) { \n result->isFirstInsn = true;\n didFirstInsn_[tid] = true;\n }\n else {\n result->isFirstInsn = false;\n }\n \n return result;\n}\n\nvoid BufferManager::releasePooledHandshake(THREADID tid, handshake_container_t* handshake)\n{\n handshake_pool_[tid].push(handshake); \n return;\n}\n\nbool BufferManager::isFirstInsn(THREADID tid)\n{\n GetLock(locks_[tid], tid+1);\n bool isFirst = (didFirstInsn_.count(tid) == 0);\n ReleaseLock(locks_[tid]);\n return isFirst;\n}\n<|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 \"DeclCollector.h\"\n\n#include \"IncrementalParser.h\"\n#include \"cling\/Interpreter\/Transaction.h\"\n#include \"cling\/Utils\/AST.h\"\n\n#include \"clang\/AST\/ASTContext.h\"\n#include \"clang\/AST\/Decl.h\"\n#include \"clang\/AST\/DeclCXX.h\"\n#include \"clang\/AST\/DeclGroup.h\"\n#include \"clang\/Lex\/MacroInfo.h\"\n#include \"clang\/Lex\/Preprocessor.h\"\n#include \"clang\/Lex\/Token.h\"\n\nusing namespace clang;\n\nnamespace {\n \/\/\/\\brief Return true if this decl (which comes from an AST file) should\n \/\/\/ not be sent to CodeGen. The module is assumed to describe the contents\n \/\/\/ of a library; symbols inside the library must thus not be reemitted \/\n \/\/\/ duplicated by CodeGen.\n \/\/\/\n static bool shouldIgnore(const Decl* D) {\n \/\/ This function is called for all \"deserialized\" decls, where the\n \/\/ \"deserialized\" decl either really comes from an AST file or from\n \/\/ a header that's loaded to import the AST for a library with a dictionary\n \/\/ (the non-PCM case).\n \/\/\n \/\/ Functions that are inlined must be sent to CodeGen - they will not have a\n \/\/ symbol in the library.\n if (const FunctionDecl* FD = dyn_cast<FunctionDecl>(D)) {\n if (D->isFromASTFile()) {\n return !FD->hasBody();\n } else {\n \/\/ If the decl must be emitted then it will be in the library.\n \/\/ If not, we must expose it to CodeGen now because it might\n \/\/ not be in the library. Does this correspond to a weak symbol\n \/\/ by definition?\n return !(FD->isInlined() || FD->isTemplateInstantiation());\n }\n }\n \/\/ Don't codegen statics coming in from a module; they are already part of\n \/\/ the library.\n \/\/ We do need to expose static variables from template instantiations.\n if (const VarDecl* VD = dyn_cast<VarDecl>(D))\n if (VD->hasGlobalStorage() && !VD->getType().isConstQualified()\n && VD->getTemplateSpecializationKind() == TSK_Undeclared)\n return true;\n return false;\n }\n}\n\nnamespace cling {\n \/\/\/\\brief Serves as DeclCollector's connector to the PPCallbacks interface.\n \/\/\/\n class DeclCollector::PPAdapter : public clang::PPCallbacks {\n cling::DeclCollector* m_Parent;\n\n void MacroDirective(const clang::Token& MacroNameTok,\n const clang::MacroDirective* MD) {\n assert(m_Parent->m_CurTransaction && \"Missing transction\");\n Transaction::MacroDirectiveInfo MDE(MacroNameTok.getIdentifierInfo(), MD);\n m_Parent->m_CurTransaction->append(MDE);\n }\n\n public:\n PPAdapter(cling::DeclCollector* P) : m_Parent(P) {}\n\n \/\/\/ \\name PPCallbacks overrides\n \/\/\/ Macro support\n void MacroDefined(const clang::Token& MacroNameTok,\n const clang::MacroDirective* MD) final {\n MacroDirective(MacroNameTok, MD);\n }\n\n \/\/\/ \\name PPCallbacks overrides\n \/\/\/ Macro support\n void MacroUndefined(const clang::Token& MacroNameTok,\n const clang::MacroDefinition& MD,\n const clang::MacroDirective* Undef) final {\n if (Undef)\n MacroDirective(MacroNameTok, Undef);\n }\n };\n\n void DeclCollector::Setup(IncrementalParser* IncrParser, ASTConsumer* Consumer,\n clang::Preprocessor& PP) {\n m_IncrParser = IncrParser;\n m_Consumer = Consumer;\n PP.addPPCallbacks(std::unique_ptr<PPCallbacks>(new PPAdapter(this)));\n }\n \n bool DeclCollector::comesFromASTReader(DeclGroupRef DGR) const {\n assert(!DGR.isNull() && \"DeclGroupRef is Null!\");\n assert(m_CurTransaction && \"No current transaction when deserializing\");\n if (m_CurTransaction->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 bool DeclCollector::comesFromASTReader(const Decl* D) const {\n \/\/ The operation is const but clang::DeclGroupRef doesn't allow us to\n \/\/ express it.\n return comesFromASTReader(DeclGroupRef(const_cast<Decl*>(D)));\n }\n\n \/\/ pin the vtable here.\n DeclCollector::~DeclCollector() { }\n\n ASTTransformer::Result DeclCollector::TransformDecl(Decl* D) const {\n \/\/ We are sure it's safe to pipe it through the transformers\n \/\/ Consume late transformers init\n for (size_t i = 0; D && i < m_TransactionTransformers.size(); ++i) {\n ASTTransformer::Result NewDecl\n = m_TransactionTransformers[i]->Transform(D, m_CurTransaction);\n if (!NewDecl.getInt()) {\n m_CurTransaction->setIssuedDiags(Transaction::kErrors);\n return NewDecl;\n }\n D = NewDecl.getPointer();\n }\n if (FunctionDecl* FD = dyn_cast_or_null<FunctionDecl>(D)) {\n if (utils::Analyze::IsWrapper(FD)) {\n for (size_t i = 0; D && i < m_WrapperTransformers.size(); ++i) {\n ASTTransformer::Result NewDecl\n = m_WrapperTransformers[i]->Transform(D, m_CurTransaction);\n if (!NewDecl.getInt()) {\n m_CurTransaction->setIssuedDiags(Transaction::kErrors);\n return NewDecl;\n }\n D = NewDecl.getPointer();\n }\n }\n }\n return ASTTransformer::Result(D, true);\n }\n\n bool DeclCollector::Transform(DeclGroupRef& DGR) {\n \/\/ Do not tranform recursively, e.g. when emitting a DeclExtracted decl.\n if (m_Transforming)\n return true;\n\n struct TransformingRAII {\n bool& m_Transforming;\n TransformingRAII(bool& Transforming): m_Transforming(Transforming) {\n m_Transforming = true;\n }\n ~TransformingRAII() { m_Transforming = false; }\n } transformingUpdater(m_Transforming);\n\n llvm::SmallVector<Decl*, 4> ReplacedDecls;\n bool HaveReplacement = false;\n for (Decl* D: DGR) {\n ASTTransformer::Result NewDecl = TransformDecl(D);\n if (!NewDecl.getInt())\n return false;\n HaveReplacement |= (NewDecl.getPointer() != D);\n if (NewDecl.getPointer())\n ReplacedDecls.push_back(NewDecl.getPointer());\n }\n if (HaveReplacement)\n DGR = DeclGroupRef::Create((*DGR.begin())->getASTContext(),\n ReplacedDecls.data(), ReplacedDecls.size());\n return true;\n }\n\n bool DeclCollector::HandleTopLevelDecl(DeclGroupRef DGR) {\n if (!Transform(DGR))\n return false;\n\n if (DGR.isNull())\n return true;\n\n assert(m_CurTransaction && \"Missing transction\");\n Transaction::DelayCallInfo DCI(DGR, Transaction::kCCIHandleTopLevelDecl);\n m_CurTransaction->append(DCI);\n if (!m_Consumer\n || getTransaction()->getIssuedDiags() == Transaction::kErrors)\n return true;\n\n if (comesFromASTReader(DGR)) {\n for (DeclGroupRef::iterator DI = DGR.begin(), DE = DGR.end();\n DI != DE; ++DI) {\n DeclGroupRef SplitDGR(*DI);\n \/\/ FIXME: The special namespace treatment (not sending itself to\n \/\/ CodeGen, but only its content - if the contained decl should be\n \/\/ emitted) works around issue with the static initialization when\n \/\/ having a PCH and loading a library. We don't want to generate\n \/\/ code for the static that will come through the library.\n \/\/\n \/\/ This will be fixed with the clang::Modules. Make sure we remember.\n \/\/ assert(!getCI()->getLangOpts().Modules && \"Please revisit!\");\n if (NamespaceDecl* ND = dyn_cast<NamespaceDecl>(*DI)) {\n for (NamespaceDecl::decl_iterator NDI = ND->decls_begin(),\n EN = ND->decls_end(); NDI != EN; ++NDI) {\n \/\/ Recurse over decls inside the namespace, like\n \/\/ CodeGenModule::EmitNamespace() does.\n if (!shouldIgnore(*NDI))\n m_Consumer->HandleTopLevelDecl(DeclGroupRef(*NDI));\n }\n } else if (!shouldIgnore(*DI)) {\n m_Consumer->HandleTopLevelDecl(DeclGroupRef(*DI));\n }\n continue;\n }\n } else {\n m_Consumer->HandleTopLevelDecl(DGR);\n }\n return true;\n }\n\n void DeclCollector::HandleInterestingDecl(DeclGroupRef DGR) {\n assert(m_CurTransaction && \"Missing transction\");\n Transaction::DelayCallInfo DCI(DGR, Transaction::kCCIHandleInterestingDecl);\n m_CurTransaction->append(DCI);\n if (m_Consumer\n && (!comesFromASTReader(DGR) || !shouldIgnore(*DGR.begin())))\n m_Consumer->HandleTopLevelDecl(DGR);\n }\n\n void DeclCollector::HandleTagDeclDefinition(TagDecl* TD) {\n assert(m_CurTransaction && \"Missing transction\");\n Transaction::DelayCallInfo DCI(DeclGroupRef(TD),\n Transaction::kCCIHandleTagDeclDefinition);\n m_CurTransaction->append(DCI);\n if (m_Consumer\n && (!comesFromASTReader(DeclGroupRef(TD))\n || !shouldIgnore(TD)))\n m_Consumer->HandleTagDeclDefinition(TD);\n }\n\n void DeclCollector::HandleInvalidTagDeclDefinition(clang::TagDecl *TD){\n assert(m_CurTransaction && \"Missing transction\");\n Transaction::DelayCallInfo DCI(DeclGroupRef(TD),\n Transaction::kCCIHandleTagDeclDefinition);\n m_CurTransaction->append(DCI);\n m_CurTransaction->setIssuedDiags(Transaction::kErrors);\n if (m_Consumer\n && (!comesFromASTReader(DeclGroupRef(TD))\n || !shouldIgnore(TD)))\n m_Consumer->HandleInvalidTagDeclDefinition(TD);\n }\n\n void DeclCollector::HandleVTable(CXXRecordDecl* RD) {\n assert(m_CurTransaction && \"Missing transction\");\n Transaction::DelayCallInfo DCI(DeclGroupRef(RD),\n Transaction::kCCIHandleVTable);\n m_CurTransaction->append(DCI);\n\n if (m_Consumer\n && (!comesFromASTReader(DeclGroupRef(RD))\n || !shouldIgnore(RD)))\n m_Consumer->HandleVTable(RD);\n \/\/ Intentional no-op. It comes through Sema::DefineUsedVTables, which\n \/\/ comes either Sema::ActOnEndOfTranslationUnit or while instantiating a\n \/\/ template. In our case we will do it on transaction commit, without\n \/\/ keeping track of used vtables, because we have cases where we bypass the\n \/\/ clang\/AST and directly ask the module so that we have to generate\n \/\/ everything without extra smartness.\n }\n\n void DeclCollector::CompleteTentativeDefinition(VarDecl* VD) {\n assert(m_CurTransaction && \"Missing transction\");\n \/\/ C has tentative definitions which we might need to deal with when running\n \/\/ in C mode.\n Transaction::DelayCallInfo DCI(DeclGroupRef(VD),\n Transaction::kCCICompleteTentativeDefinition);\n m_CurTransaction->append(DCI);\n if (m_Consumer\n && (!comesFromASTReader(DeclGroupRef(VD))\n || !shouldIgnore(VD)))\n m_Consumer->CompleteTentativeDefinition(VD);\n }\n\n void DeclCollector::HandleTranslationUnit(ASTContext& Ctx) {\n \/\/if (m_Consumer)\n \/\/ m_Consumer->HandleTranslationUnit(Ctx);\n }\n\n void DeclCollector::HandleCXXImplicitFunctionInstantiation(FunctionDecl *D) {\n assert(m_CurTransaction && \"Missing transction\");\n Transaction::DelayCallInfo DCI(DeclGroupRef(D),\n Transaction::kCCIHandleCXXImplicitFunctionInstantiation);\n m_CurTransaction->append(DCI);\n if (m_Consumer\n && (!comesFromASTReader(DeclGroupRef(D))\n || !shouldIgnore(D)))\n m_Consumer->HandleCXXImplicitFunctionInstantiation(D);\n }\n\n void DeclCollector::HandleCXXStaticMemberVarInstantiation(VarDecl *D) {\n assert(m_CurTransaction && \"Missing transction\");\n Transaction::DelayCallInfo DCI(DeclGroupRef(D),\n Transaction::kCCIHandleCXXStaticMemberVarInstantiation);\n m_CurTransaction->append(DCI);\n if (m_Consumer\n && (!comesFromASTReader(DeclGroupRef(D))\n || !shouldIgnore(D)))\n m_Consumer->HandleCXXStaticMemberVarInstantiation(D);\n }\n\n} \/\/ namespace cling\n<commit_msg>[cxxmodules] Print stacktrace before aborting on a missing exception.<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 \"DeclCollector.h\"\n\n#include \"IncrementalParser.h\"\n#include \"cling\/Interpreter\/Transaction.h\"\n#include \"cling\/Utils\/AST.h\"\n\n#include \"clang\/AST\/ASTContext.h\"\n#include \"clang\/AST\/Decl.h\"\n#include \"clang\/AST\/DeclCXX.h\"\n#include \"clang\/AST\/DeclGroup.h\"\n#include \"clang\/Lex\/MacroInfo.h\"\n#include \"clang\/Lex\/Preprocessor.h\"\n#include \"clang\/Lex\/Token.h\"\n#include \"llvm\/Support\/Signals.h\"\n\nusing namespace clang;\n\nnamespace {\n \/\/\/\\brief Return true if this decl (which comes from an AST file) should\n \/\/\/ not be sent to CodeGen. The module is assumed to describe the contents\n \/\/\/ of a library; symbols inside the library must thus not be reemitted \/\n \/\/\/ duplicated by CodeGen.\n \/\/\/\n static bool shouldIgnore(const Decl* D) {\n \/\/ This function is called for all \"deserialized\" decls, where the\n \/\/ \"deserialized\" decl either really comes from an AST file or from\n \/\/ a header that's loaded to import the AST for a library with a dictionary\n \/\/ (the non-PCM case).\n \/\/\n \/\/ Functions that are inlined must be sent to CodeGen - they will not have a\n \/\/ symbol in the library.\n if (const FunctionDecl* FD = dyn_cast<FunctionDecl>(D)) {\n if (D->isFromASTFile()) {\n return !FD->hasBody();\n } else {\n \/\/ If the decl must be emitted then it will be in the library.\n \/\/ If not, we must expose it to CodeGen now because it might\n \/\/ not be in the library. Does this correspond to a weak symbol\n \/\/ by definition?\n return !(FD->isInlined() || FD->isTemplateInstantiation());\n }\n }\n \/\/ Don't codegen statics coming in from a module; they are already part of\n \/\/ the library.\n \/\/ We do need to expose static variables from template instantiations.\n if (const VarDecl* VD = dyn_cast<VarDecl>(D))\n if (VD->hasGlobalStorage() && !VD->getType().isConstQualified()\n && VD->getTemplateSpecializationKind() == TSK_Undeclared)\n return true;\n return false;\n }\n\n \/\/\/ \\brief Asserts that the given transaction is not null, otherwise prints a\n \/\/\/ stack trace to stderr and aborts execution.\n static void assertHasTransaction(const cling::Transaction* T) {\n if (!T) {\n llvm::sys::PrintStackTrace(llvm::errs());\n llvm_unreachable(\"Missing transaction during deserialization!\");\n }\n }\n}\n\nnamespace cling {\n \/\/\/\\brief Serves as DeclCollector's connector to the PPCallbacks interface.\n \/\/\/\n class DeclCollector::PPAdapter : public clang::PPCallbacks {\n cling::DeclCollector* m_Parent;\n\n void MacroDirective(const clang::Token& MacroNameTok,\n const clang::MacroDirective* MD) {\n assertHasTransaction(m_Parent->m_CurTransaction);\n Transaction::MacroDirectiveInfo MDE(MacroNameTok.getIdentifierInfo(), MD);\n m_Parent->m_CurTransaction->append(MDE);\n }\n\n public:\n PPAdapter(cling::DeclCollector* P) : m_Parent(P) {}\n\n \/\/\/ \\name PPCallbacks overrides\n \/\/\/ Macro support\n void MacroDefined(const clang::Token& MacroNameTok,\n const clang::MacroDirective* MD) final {\n MacroDirective(MacroNameTok, MD);\n }\n\n \/\/\/ \\name PPCallbacks overrides\n \/\/\/ Macro support\n void MacroUndefined(const clang::Token& MacroNameTok,\n const clang::MacroDefinition& MD,\n const clang::MacroDirective* Undef) final {\n if (Undef)\n MacroDirective(MacroNameTok, Undef);\n }\n };\n\n void DeclCollector::Setup(IncrementalParser* IncrParser, ASTConsumer* Consumer,\n clang::Preprocessor& PP) {\n m_IncrParser = IncrParser;\n m_Consumer = Consumer;\n PP.addPPCallbacks(std::unique_ptr<PPCallbacks>(new PPAdapter(this)));\n }\n \n bool DeclCollector::comesFromASTReader(DeclGroupRef DGR) const {\n assert(!DGR.isNull() && \"DeclGroupRef is Null!\");\n assertHasTransaction(m_CurTransaction);\n if (m_CurTransaction->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 bool DeclCollector::comesFromASTReader(const Decl* D) const {\n \/\/ The operation is const but clang::DeclGroupRef doesn't allow us to\n \/\/ express it.\n return comesFromASTReader(DeclGroupRef(const_cast<Decl*>(D)));\n }\n\n \/\/ pin the vtable here.\n DeclCollector::~DeclCollector() { }\n\n ASTTransformer::Result DeclCollector::TransformDecl(Decl* D) const {\n \/\/ We are sure it's safe to pipe it through the transformers\n \/\/ Consume late transformers init\n for (size_t i = 0; D && i < m_TransactionTransformers.size(); ++i) {\n ASTTransformer::Result NewDecl\n = m_TransactionTransformers[i]->Transform(D, m_CurTransaction);\n if (!NewDecl.getInt()) {\n m_CurTransaction->setIssuedDiags(Transaction::kErrors);\n return NewDecl;\n }\n D = NewDecl.getPointer();\n }\n if (FunctionDecl* FD = dyn_cast_or_null<FunctionDecl>(D)) {\n if (utils::Analyze::IsWrapper(FD)) {\n for (size_t i = 0; D && i < m_WrapperTransformers.size(); ++i) {\n ASTTransformer::Result NewDecl\n = m_WrapperTransformers[i]->Transform(D, m_CurTransaction);\n if (!NewDecl.getInt()) {\n m_CurTransaction->setIssuedDiags(Transaction::kErrors);\n return NewDecl;\n }\n D = NewDecl.getPointer();\n }\n }\n }\n return ASTTransformer::Result(D, true);\n }\n\n bool DeclCollector::Transform(DeclGroupRef& DGR) {\n \/\/ Do not tranform recursively, e.g. when emitting a DeclExtracted decl.\n if (m_Transforming)\n return true;\n\n struct TransformingRAII {\n bool& m_Transforming;\n TransformingRAII(bool& Transforming): m_Transforming(Transforming) {\n m_Transforming = true;\n }\n ~TransformingRAII() { m_Transforming = false; }\n } transformingUpdater(m_Transforming);\n\n llvm::SmallVector<Decl*, 4> ReplacedDecls;\n bool HaveReplacement = false;\n for (Decl* D: DGR) {\n ASTTransformer::Result NewDecl = TransformDecl(D);\n if (!NewDecl.getInt())\n return false;\n HaveReplacement |= (NewDecl.getPointer() != D);\n if (NewDecl.getPointer())\n ReplacedDecls.push_back(NewDecl.getPointer());\n }\n if (HaveReplacement)\n DGR = DeclGroupRef::Create((*DGR.begin())->getASTContext(),\n ReplacedDecls.data(), ReplacedDecls.size());\n return true;\n }\n\n bool DeclCollector::HandleTopLevelDecl(DeclGroupRef DGR) {\n if (!Transform(DGR))\n return false;\n\n if (DGR.isNull())\n return true;\n\n assertHasTransaction(m_CurTransaction);\n Transaction::DelayCallInfo DCI(DGR, Transaction::kCCIHandleTopLevelDecl);\n m_CurTransaction->append(DCI);\n if (!m_Consumer\n || getTransaction()->getIssuedDiags() == Transaction::kErrors)\n return true;\n\n if (comesFromASTReader(DGR)) {\n for (DeclGroupRef::iterator DI = DGR.begin(), DE = DGR.end();\n DI != DE; ++DI) {\n DeclGroupRef SplitDGR(*DI);\n \/\/ FIXME: The special namespace treatment (not sending itself to\n \/\/ CodeGen, but only its content - if the contained decl should be\n \/\/ emitted) works around issue with the static initialization when\n \/\/ having a PCH and loading a library. We don't want to generate\n \/\/ code for the static that will come through the library.\n \/\/\n \/\/ This will be fixed with the clang::Modules. Make sure we remember.\n \/\/ assert(!getCI()->getLangOpts().Modules && \"Please revisit!\");\n if (NamespaceDecl* ND = dyn_cast<NamespaceDecl>(*DI)) {\n for (NamespaceDecl::decl_iterator NDI = ND->decls_begin(),\n EN = ND->decls_end(); NDI != EN; ++NDI) {\n \/\/ Recurse over decls inside the namespace, like\n \/\/ CodeGenModule::EmitNamespace() does.\n if (!shouldIgnore(*NDI))\n m_Consumer->HandleTopLevelDecl(DeclGroupRef(*NDI));\n }\n } else if (!shouldIgnore(*DI)) {\n m_Consumer->HandleTopLevelDecl(DeclGroupRef(*DI));\n }\n continue;\n }\n } else {\n m_Consumer->HandleTopLevelDecl(DGR);\n }\n return true;\n }\n\n void DeclCollector::HandleInterestingDecl(DeclGroupRef DGR) {\n assertHasTransaction(m_CurTransaction);\n Transaction::DelayCallInfo DCI(DGR, Transaction::kCCIHandleInterestingDecl);\n m_CurTransaction->append(DCI);\n if (m_Consumer\n && (!comesFromASTReader(DGR) || !shouldIgnore(*DGR.begin())))\n m_Consumer->HandleTopLevelDecl(DGR);\n }\n\n void DeclCollector::HandleTagDeclDefinition(TagDecl* TD) {\n assertHasTransaction(m_CurTransaction);\n Transaction::DelayCallInfo DCI(DeclGroupRef(TD),\n Transaction::kCCIHandleTagDeclDefinition);\n m_CurTransaction->append(DCI);\n if (m_Consumer\n && (!comesFromASTReader(DeclGroupRef(TD))\n || !shouldIgnore(TD)))\n m_Consumer->HandleTagDeclDefinition(TD);\n }\n\n void DeclCollector::HandleInvalidTagDeclDefinition(clang::TagDecl *TD){\n assertHasTransaction(m_CurTransaction);\n Transaction::DelayCallInfo DCI(DeclGroupRef(TD),\n Transaction::kCCIHandleTagDeclDefinition);\n m_CurTransaction->append(DCI);\n m_CurTransaction->setIssuedDiags(Transaction::kErrors);\n if (m_Consumer\n && (!comesFromASTReader(DeclGroupRef(TD))\n || !shouldIgnore(TD)))\n m_Consumer->HandleInvalidTagDeclDefinition(TD);\n }\n\n void DeclCollector::HandleVTable(CXXRecordDecl* RD) {\n assertHasTransaction(m_CurTransaction);\n Transaction::DelayCallInfo DCI(DeclGroupRef(RD),\n Transaction::kCCIHandleVTable);\n m_CurTransaction->append(DCI);\n\n if (m_Consumer\n && (!comesFromASTReader(DeclGroupRef(RD))\n || !shouldIgnore(RD)))\n m_Consumer->HandleVTable(RD);\n \/\/ Intentional no-op. It comes through Sema::DefineUsedVTables, which\n \/\/ comes either Sema::ActOnEndOfTranslationUnit or while instantiating a\n \/\/ template. In our case we will do it on transaction commit, without\n \/\/ keeping track of used vtables, because we have cases where we bypass the\n \/\/ clang\/AST and directly ask the module so that we have to generate\n \/\/ everything without extra smartness.\n }\n\n void DeclCollector::CompleteTentativeDefinition(VarDecl* VD) {\n assertHasTransaction(m_CurTransaction);\n \/\/ C has tentative definitions which we might need to deal with when running\n \/\/ in C mode.\n Transaction::DelayCallInfo DCI(DeclGroupRef(VD),\n Transaction::kCCICompleteTentativeDefinition);\n m_CurTransaction->append(DCI);\n if (m_Consumer\n && (!comesFromASTReader(DeclGroupRef(VD))\n || !shouldIgnore(VD)))\n m_Consumer->CompleteTentativeDefinition(VD);\n }\n\n void DeclCollector::HandleTranslationUnit(ASTContext& Ctx) {\n \/\/if (m_Consumer)\n \/\/ m_Consumer->HandleTranslationUnit(Ctx);\n }\n\n void DeclCollector::HandleCXXImplicitFunctionInstantiation(FunctionDecl *D) {\n assertHasTransaction(m_CurTransaction);\n Transaction::DelayCallInfo DCI(DeclGroupRef(D),\n Transaction::kCCIHandleCXXImplicitFunctionInstantiation);\n m_CurTransaction->append(DCI);\n if (m_Consumer\n && (!comesFromASTReader(DeclGroupRef(D))\n || !shouldIgnore(D)))\n m_Consumer->HandleCXXImplicitFunctionInstantiation(D);\n }\n\n void DeclCollector::HandleCXXStaticMemberVarInstantiation(VarDecl *D) {\n assertHasTransaction(m_CurTransaction);\n Transaction::DelayCallInfo DCI(DeclGroupRef(D),\n Transaction::kCCIHandleCXXStaticMemberVarInstantiation);\n m_CurTransaction->append(DCI);\n if (m_Consumer\n && (!comesFromASTReader(DeclGroupRef(D))\n || !shouldIgnore(D)))\n m_Consumer->HandleCXXStaticMemberVarInstantiation(D);\n }\n\n} \/\/ namespace cling\n<|endoftext|>"} {"text":"<commit_before>\/* -*-c++-*- OpenSceneGraph - Copyright (C) 1998-2006 Robert Osfield\n *\n * This application is open source and may be redistributed and\/or modified\n * freely and without restriction, both in commercial and non commercial\n * applications, as long as this copyright notice is maintained.\n *\n * This application is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.\n *\n*\/\n\n#include <sstream>\n#include <memory>\n\n#include <osg\/Notify>\n#include <osg\/NodeVisitor>\n#include <osgDB\/ReaderWriter>\n#include <osgDB\/FileNameUtils>\n#include <osgDB\/Registry>\n#include <osgDB\/ConvertUTF>\n\n#include <OpenThreads\/ScopedLock>\n\n#include \"ReaderWriterDAE.h\"\n#include \"daeReader.h\"\n#include \"daeWriter.h\"\n\n#ifdef WIN32\n#include \"windows.h\"\n#endif\n\n#define SERIALIZER() OpenThreads::ScopedLock<OpenThreads::ReentrantMutex> lock(_serializerMutex)\n\n#if __cplusplus > 199711L\n #define smart_ptr std::unique_ptr\n#else\n #define smart_prt std::auto_ptr\n#endif\n\nosgDB::ReaderWriter::ReadResult\nReaderWriterDAE::readNode(std::istream& fin,\n const osgDB::ReaderWriter::Options* options) const\n{\n SERIALIZER();\n\n bool bOwnDAE = false;\n DAE* pDAE = NULL;\n\n \/\/ Process options\n osgDAE::daeReader::Options pluginOptions;\n if( options )\n {\n pDAE = (DAE*)options->getPluginData(\"DAE\");\n\n pluginOptions.precisionHint = options->getPrecisionHint();\n\n std::istringstream iss( options->getOptionString() );\n std::string opt;\n while (iss >> opt)\n {\n if( opt == \"StrictTransparency\") pluginOptions.strictTransparency = true;\n else if (opt == \"daeTessellateNone\") pluginOptions.tessellateMode = osgDAE::daeReader::TESSELLATE_NONE;\n else if (opt == \"daeTessellatePolygonsAsTriFans\") pluginOptions.tessellateMode = osgDAE::daeReader::TESSELLATE_POLYGONS_AS_TRIFAN;\n else if (opt == \"daeTessellatePolygons\") pluginOptions.tessellateMode = osgDAE::daeReader::TESSELLATE_POLYGONS;\n else if (opt == \"daeUsePredefinedTextureUnits\") pluginOptions.usePredefinedTextureUnits = true;\n else if (opt == \"daeUseSequencedTextureUnits\") pluginOptions.usePredefinedTextureUnits = false;\n }\n }\n\n if (NULL == pDAE)\n {\n bOwnDAE = true;\n#ifdef COLLADA_DOM_2_4_OR_LATER\n pDAE = new DAE(NULL,NULL,_specversion);\n#else\n pDAE = new DAE;\n#endif\n }\n\n smart_ptr<DAE> scopedDae(bOwnDAE ? pDAE : NULL); \/\/ Deallocates locally created structure at scope exit\n\n osgDAE::daeReader daeReader(pDAE, &pluginOptions);\n\n if ( ! daeReader.convert( fin ) )\n {\n OSG_WARN << \"Load failed in COLLADA DOM conversion\" << std::endl;\n return ReadResult::ERROR_IN_READING_FILE;\n }\n\n if ( options )\n {\n \/\/ Return the document URI\n if (options->getPluginData(\"DAE-DocumentURI\"))\n *(std::string*)options->getPluginData(\"DAE-DocumentURI\") = std::string(\"\/dev\/null\");\n \/\/ Return some additional information about the document\n if (options->getPluginData(\"DAE-AssetUnitName\"))\n *(std::string*)options->getPluginData(\"DAE-AssetUnitName\") = daeReader.getAssetUnitName();\n if (options->getPluginData(\"DAE-AssetUnitMeter\"))\n *(float*)options->getPluginData(\"DAE-AssetUnitMeter\") = daeReader.getAssetUnitMeter();\n if (options->getPluginData(\"DAE-AssetUp_axis\"))\n *(domUpAxisType*)options->getPluginData(\"DAE-AssetUp_axis\") = daeReader.getAssetUpAxis();\n }\n\n osg::Node* rootNode( daeReader.getRootNode() );\n return rootNode;\n}\n\n\nosgDB::ReaderWriter::ReadResult\nReaderWriterDAE::readNode(const std::string& fname,\n const osgDB::ReaderWriter::Options* options) const\n{\n SERIALIZER();\n\n bool bOwnDAE = false;\n DAE* pDAE = NULL;\n\n \/\/ Process options\n osgDAE::daeReader::Options pluginOptions;\n if( options )\n {\n pDAE = (DAE*)options->getPluginData(\"DAE\");\n\n pluginOptions.precisionHint = options->getPrecisionHint();\n\n std::istringstream iss( options->getOptionString() );\n std::string opt;\n while (iss >> opt)\n {\n if( opt == \"StrictTransparency\") pluginOptions.strictTransparency = true;\n else if (opt == \"daeTessellateNone\") pluginOptions.tessellateMode = osgDAE::daeReader::TESSELLATE_NONE;\n else if (opt == \"daeTessellatePolygonsAsTriFans\") pluginOptions.tessellateMode = osgDAE::daeReader::TESSELLATE_POLYGONS_AS_TRIFAN;\n else if (opt == \"daeTessellatePolygons\") pluginOptions.tessellateMode = osgDAE::daeReader::TESSELLATE_POLYGONS;\n else if (opt == \"daeUsePredefinedTextureUnits\") pluginOptions.usePredefinedTextureUnits = true;\n else if (opt == \"daeUseSequencedTextureUnits\") pluginOptions.usePredefinedTextureUnits = false;\n }\n }\n\n\n std::string ext( osgDB::getLowerCaseFileExtension(fname) );\n if( ! acceptsExtension(ext) ) return ReadResult::FILE_NOT_HANDLED;\n\n std::string fileName( osgDB::findDataFile( fname, options ) );\n if( fileName.empty() ) return ReadResult::FILE_NOT_FOUND;\n\n OSG_INFO << \"ReaderWriterDAE( \\\"\" << fileName << \"\\\" )\" << std::endl;\n\n if (NULL == pDAE)\n {\n bOwnDAE = true;\n#ifdef COLLADA_DOM_2_4_OR_LATER\n pDAE = new DAE(NULL,NULL,_specversion);\n#else\n pDAE = new DAE;\n#endif\n }\n\n smart_ptr<DAE> scopedDae(bOwnDAE ? pDAE : NULL); \/\/ Deallocates locally created structure at scope exit\n\n osgDAE::daeReader daeReader(pDAE, &pluginOptions);\n\n \/\/ Convert file name to URI\n std::string fileURI = ConvertFilePathToColladaCompatibleURI(fileName);\n\n if ( ! daeReader.convert( fileURI ) )\n {\n OSG_WARN << \"Load failed in COLLADA DOM conversion\" << std::endl;\n return ReadResult::ERROR_IN_READING_FILE;\n }\n\n if ( options )\n {\n \/\/ Return the document URI\n if (options->getPluginData(\"DAE-DocumentURI\"))\n *(std::string*)options->getPluginData(\"DAE-DocumentURI\") = fileURI;\n \/\/ Return some additional information about the document\n if (options->getPluginData(\"DAE-AssetUnitName\"))\n *(std::string*)options->getPluginData(\"DAE-AssetUnitName\") = daeReader.getAssetUnitName();\n if (options->getPluginData(\"DAE-AssetUnitMeter\"))\n *(float*)options->getPluginData(\"DAE-AssetUnitMeter\") = daeReader.getAssetUnitMeter();\n if (options->getPluginData(\"DAE-AssetUp_axis\"))\n *(domUpAxisType*)options->getPluginData(\"DAE-AssetUp_axis\") = daeReader.getAssetUpAxis();\n }\n\n osg::Node* rootNode( daeReader.getRootNode() );\n return rootNode;\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nosgDB::ReaderWriter::WriteResult\nReaderWriterDAE::writeNode( const osg::Node& node,\n const std::string& fname, const osgDB::ReaderWriter::Options* options ) const\n{\n SERIALIZER();\n\n bool bOwnDAE = false;\n DAE* pDAE = NULL;\n\n std::string ext( osgDB::getLowerCaseFileExtension(fname) );\n if( ! acceptsExtension(ext) ) return WriteResult::FILE_NOT_HANDLED;\n\n \/\/ Process options\n osgDAE::daeWriter::Options pluginOptions;\n std::string srcDirectory( osgDB::getFilePath(node.getName().empty() ? fname : node.getName()) ); \/\/ Base dir when relativising images paths\n if( options )\n {\n pDAE = (DAE*)options->getPluginData(\"DAE\");\n\n const std::string & baseDir = options->getPluginStringData(\"baseImageDir\"); \/\/ Rename \"srcModelPath\" (and call getFilePath() on it)?\n if (!baseDir.empty()) srcDirectory = baseDir;\n\n const std::string & relativiseImagesPathNbUpDirs = options->getPluginStringData(\"DAE-relativiseImagesPathNbUpDirs\");\n if (!relativiseImagesPathNbUpDirs.empty()) {\n std::istringstream iss(relativiseImagesPathNbUpDirs);\n iss >> pluginOptions.relativiseImagesPathNbUpDirs;\n }\n\n \/\/ Sukender's note: I don't know why DAE seems to accept comma-sparated options instead of space-separated options as other ReaderWriters. However, to avoid breaking compatibility, here's a workaround:\n std::string optString( options->getOptionString() );\n for(std::string::iterator it=optString.begin(); it!=optString.end(); ++it) {\n if (*it == ' ') *it = ',';\n }\n std::istringstream iss( optString );\n std::string opt;\n\n \/\/while (iss >> opt)\n while( std::getline( iss, opt, ',' ) )\n {\n if( opt == \"polygon\") pluginOptions.usePolygons = true;\n else if (opt == \"GoogleMode\") pluginOptions.googleMode = true;\n else if (opt == \"NoExtras\") pluginOptions.writeExtras = false;\n else if (opt == \"daeEarthTex\") pluginOptions.earthTex = true;\n else if (opt == \"daeZUpAxis\") {} \/\/ Nothing (old option)\n else if (opt == \"daeLinkOriginalTexturesNoForce\") { pluginOptions.linkOrignialTextures = true; pluginOptions.forceTexture = false; }\n else if (opt == \"daeLinkOriginalTexturesForce\") { pluginOptions.linkOrignialTextures = true; pluginOptions.forceTexture = true; }\n else if (opt == \"daeNamesUseCodepage\") pluginOptions.namesUseCodepage = true;\n else if (opt == \"daeRenameIds\") pluginOptions.renameIds = true;\n else if (!opt.empty())\n {\n OSG_NOTICE << std::endl << \"COLLADA dae plugin: unrecognized option \\\"\" << opt << std::endl;\n }\n }\n }\n\n if (NULL == pDAE)\n {\n bOwnDAE = true;\n#ifdef COLLADA_DOM_2_4_OR_LATER\n pDAE = new DAE(NULL,NULL,_specversion);\n#else\n pDAE = new DAE;\n#endif\n }\n smart_ptr<DAE> scopedDae(bOwnDAE ? pDAE : NULL); \/\/ Deallocates locally created structure at scope exit\n\n \/\/ Convert file name to URI\n std::string fileURI = ConvertFilePathToColladaCompatibleURI(fname);\n\n osg::NodeVisitor::TraversalMode traversalMode = pluginOptions.writeExtras ? osg::NodeVisitor::TRAVERSE_ALL_CHILDREN : osg::NodeVisitor::TRAVERSE_ACTIVE_CHILDREN;\n\n osgDAE::daeWriter daeWriter(pDAE, fileURI, osgDB::getFilePath(fname), srcDirectory, options, traversalMode, &pluginOptions);\n daeWriter.setRootNode( node );\n const_cast<osg::Node*>(&node)->accept( daeWriter );\n\n osgDB::ReaderWriter::WriteResult retVal( WriteResult::ERROR_IN_WRITING_FILE );\n if ( daeWriter.isSuccess() )\n {\n if (pDAE->write(fileURI))\n retVal = WriteResult::FILE_SAVED;\n }\n\n if ( options )\n {\n if (!bOwnDAE)\n {\n \/\/ Return the document URI used so that users of an external DAE object\n \/\/ can locate the correct database\n if (options->getPluginData(\"DAE-DocumentURI\"))\n *(std::string*)options->getPluginData(\"DAE-DocumentURI\") = fileURI;\n }\n }\n\n return retVal;\n}\n\nstatic void replace(std::string & str, const char from, const std::string & to)\n{\n \/\/ Replace for all occurrences\n for(std::string::size_type pos=str.find(from); pos!=std::string::npos; pos=str.find(from))\n {\n str.replace(pos, 1, to);\n }\n}\n\nstatic void replace(std::string & str, const std::string & from, const std::string & to)\n{\n \/\/ Replace for all occurrences\n std::size_t lenFrom = from.size();\n std::size_t lenTo = to.size();\n for(std::string::size_type pos=str.find(from); pos!=std::string::npos; pos = str.find(from, pos+lenTo))\n {\n str.replace(pos, lenFrom, to);\n }\n}\n\nstd::string ReaderWriterDAE::ConvertFilePathToColladaCompatibleURI(const std::string& FilePath)\n{\n#ifdef OSG_USE_UTF8_FILENAME\n std::string path( cdom::nativePathToUri( FilePath ) );\n#else\n std::string path( cdom::nativePathToUri( osgDB::convertStringFromCurrentCodePageToUTF8(FilePath) ) );\n#endif\n\n \/\/ Unfortunately, cdom::nativePathToUri() does not convert '#' characters to \"%23\" as expected.\n \/\/ So having \/a\/#b\/c will generate a wrong conversion, as '#' will be misinterpreted as an URI fragment.\n \/\/ Here are listed all special chars, but only # was found problematic. I (Sukender) tested #{}^~[]`;@=&$ under Windows.\n \/\/ Uncomment lines if you find issues with some other special characters.\n\n \/\/replace(path, '%', \"%25\"); \/\/ % at first\n \/\/replace(path, ' ', \"%20\");\n replace(path, '#', \"%23\");\n \/\/replace(path, '<', \"%3C\");\n \/\/replace(path, '>', \"%3E\");\n \/\/replace(path, '{', \"%7B\");\n \/\/replace(path, '}', \"%7D\");\n \/\/replace(path, '|', \"%7C\");\n \/\/replace(path, '^', \"%5E\");\n \/\/replace(path, '~', \"%7E\");\n \/\/replace(path, '[', \"%5B\");\n \/\/replace(path, '}', \"%5D\");\n \/\/replace(path, '`', \"%60\");\n \/\/replace(path, ';', \"%3B\");\n \/\/replace(path, '?', \"%3F\");\n \/\/replace(path, '@', \"%40\");\n \/\/replace(path, '=', \"%3D\");\n \/\/replace(path, '&', \"%26\");\n \/\/replace(path, '$', \"%24\");\n return path;\n}\n\nstd::string ReaderWriterDAE::ConvertColladaCompatibleURIToFilePath(const std::string& uri)\n{\n \/\/ Reciprocal of ConvertFilePathToColladaCompatibleURI()\n#ifdef OSG_USE_UTF8_FILENAME\n std::string path( cdom::uriToNativePath( uri ) );\n#else\n std::string path( osgDB::convertStringFromCurrentCodePageToUTF8( cdom::uriToNativePath(uri) ) );\n#endif\n replace(path, \"%23\", \"#\");\n return path;\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ Add ourself to the Registry to instantiate the reader\/writer.\n\nREGISTER_OSGPLUGIN(dae, ReaderWriterDAE)\n\n\/\/ vim: set sw=4 ts=8 et ic ai:\n<commit_msg>Fixed typo<commit_after>\/* -*-c++-*- OpenSceneGraph - Copyright (C) 1998-2006 Robert Osfield\n *\n * This application is open source and may be redistributed and\/or modified\n * freely and without restriction, both in commercial and non commercial\n * applications, as long as this copyright notice is maintained.\n *\n * This application is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.\n *\n*\/\n\n#include <sstream>\n#include <memory>\n\n#include <osg\/Notify>\n#include <osg\/NodeVisitor>\n#include <osgDB\/ReaderWriter>\n#include <osgDB\/FileNameUtils>\n#include <osgDB\/Registry>\n#include <osgDB\/ConvertUTF>\n\n#include <OpenThreads\/ScopedLock>\n\n#include \"ReaderWriterDAE.h\"\n#include \"daeReader.h\"\n#include \"daeWriter.h\"\n\n#ifdef WIN32\n#include \"windows.h\"\n#endif\n\n#define SERIALIZER() OpenThreads::ScopedLock<OpenThreads::ReentrantMutex> lock(_serializerMutex)\n\n#if __cplusplus > 199711L\n #define smart_ptr std::unique_ptr\n#else\n #define smart_ptr std::auto_ptr\n#endif\n\nosgDB::ReaderWriter::ReadResult\nReaderWriterDAE::readNode(std::istream& fin,\n const osgDB::ReaderWriter::Options* options) const\n{\n SERIALIZER();\n\n bool bOwnDAE = false;\n DAE* pDAE = NULL;\n\n \/\/ Process options\n osgDAE::daeReader::Options pluginOptions;\n if( options )\n {\n pDAE = (DAE*)options->getPluginData(\"DAE\");\n\n pluginOptions.precisionHint = options->getPrecisionHint();\n\n std::istringstream iss( options->getOptionString() );\n std::string opt;\n while (iss >> opt)\n {\n if( opt == \"StrictTransparency\") pluginOptions.strictTransparency = true;\n else if (opt == \"daeTessellateNone\") pluginOptions.tessellateMode = osgDAE::daeReader::TESSELLATE_NONE;\n else if (opt == \"daeTessellatePolygonsAsTriFans\") pluginOptions.tessellateMode = osgDAE::daeReader::TESSELLATE_POLYGONS_AS_TRIFAN;\n else if (opt == \"daeTessellatePolygons\") pluginOptions.tessellateMode = osgDAE::daeReader::TESSELLATE_POLYGONS;\n else if (opt == \"daeUsePredefinedTextureUnits\") pluginOptions.usePredefinedTextureUnits = true;\n else if (opt == \"daeUseSequencedTextureUnits\") pluginOptions.usePredefinedTextureUnits = false;\n }\n }\n\n if (NULL == pDAE)\n {\n bOwnDAE = true;\n#ifdef COLLADA_DOM_2_4_OR_LATER\n pDAE = new DAE(NULL,NULL,_specversion);\n#else\n pDAE = new DAE;\n#endif\n }\n\n smart_ptr<DAE> scopedDae(bOwnDAE ? pDAE : NULL); \/\/ Deallocates locally created structure at scope exit\n\n osgDAE::daeReader daeReader(pDAE, &pluginOptions);\n\n if ( ! daeReader.convert( fin ) )\n {\n OSG_WARN << \"Load failed in COLLADA DOM conversion\" << std::endl;\n return ReadResult::ERROR_IN_READING_FILE;\n }\n\n if ( options )\n {\n \/\/ Return the document URI\n if (options->getPluginData(\"DAE-DocumentURI\"))\n *(std::string*)options->getPluginData(\"DAE-DocumentURI\") = std::string(\"\/dev\/null\");\n \/\/ Return some additional information about the document\n if (options->getPluginData(\"DAE-AssetUnitName\"))\n *(std::string*)options->getPluginData(\"DAE-AssetUnitName\") = daeReader.getAssetUnitName();\n if (options->getPluginData(\"DAE-AssetUnitMeter\"))\n *(float*)options->getPluginData(\"DAE-AssetUnitMeter\") = daeReader.getAssetUnitMeter();\n if (options->getPluginData(\"DAE-AssetUp_axis\"))\n *(domUpAxisType*)options->getPluginData(\"DAE-AssetUp_axis\") = daeReader.getAssetUpAxis();\n }\n\n osg::Node* rootNode( daeReader.getRootNode() );\n return rootNode;\n}\n\n\nosgDB::ReaderWriter::ReadResult\nReaderWriterDAE::readNode(const std::string& fname,\n const osgDB::ReaderWriter::Options* options) const\n{\n SERIALIZER();\n\n bool bOwnDAE = false;\n DAE* pDAE = NULL;\n\n \/\/ Process options\n osgDAE::daeReader::Options pluginOptions;\n if( options )\n {\n pDAE = (DAE*)options->getPluginData(\"DAE\");\n\n pluginOptions.precisionHint = options->getPrecisionHint();\n\n std::istringstream iss( options->getOptionString() );\n std::string opt;\n while (iss >> opt)\n {\n if( opt == \"StrictTransparency\") pluginOptions.strictTransparency = true;\n else if (opt == \"daeTessellateNone\") pluginOptions.tessellateMode = osgDAE::daeReader::TESSELLATE_NONE;\n else if (opt == \"daeTessellatePolygonsAsTriFans\") pluginOptions.tessellateMode = osgDAE::daeReader::TESSELLATE_POLYGONS_AS_TRIFAN;\n else if (opt == \"daeTessellatePolygons\") pluginOptions.tessellateMode = osgDAE::daeReader::TESSELLATE_POLYGONS;\n else if (opt == \"daeUsePredefinedTextureUnits\") pluginOptions.usePredefinedTextureUnits = true;\n else if (opt == \"daeUseSequencedTextureUnits\") pluginOptions.usePredefinedTextureUnits = false;\n }\n }\n\n\n std::string ext( osgDB::getLowerCaseFileExtension(fname) );\n if( ! acceptsExtension(ext) ) return ReadResult::FILE_NOT_HANDLED;\n\n std::string fileName( osgDB::findDataFile( fname, options ) );\n if( fileName.empty() ) return ReadResult::FILE_NOT_FOUND;\n\n OSG_INFO << \"ReaderWriterDAE( \\\"\" << fileName << \"\\\" )\" << std::endl;\n\n if (NULL == pDAE)\n {\n bOwnDAE = true;\n#ifdef COLLADA_DOM_2_4_OR_LATER\n pDAE = new DAE(NULL,NULL,_specversion);\n#else\n pDAE = new DAE;\n#endif\n }\n\n smart_ptr<DAE> scopedDae(bOwnDAE ? pDAE : NULL); \/\/ Deallocates locally created structure at scope exit\n\n osgDAE::daeReader daeReader(pDAE, &pluginOptions);\n\n \/\/ Convert file name to URI\n std::string fileURI = ConvertFilePathToColladaCompatibleURI(fileName);\n\n if ( ! daeReader.convert( fileURI ) )\n {\n OSG_WARN << \"Load failed in COLLADA DOM conversion\" << std::endl;\n return ReadResult::ERROR_IN_READING_FILE;\n }\n\n if ( options )\n {\n \/\/ Return the document URI\n if (options->getPluginData(\"DAE-DocumentURI\"))\n *(std::string*)options->getPluginData(\"DAE-DocumentURI\") = fileURI;\n \/\/ Return some additional information about the document\n if (options->getPluginData(\"DAE-AssetUnitName\"))\n *(std::string*)options->getPluginData(\"DAE-AssetUnitName\") = daeReader.getAssetUnitName();\n if (options->getPluginData(\"DAE-AssetUnitMeter\"))\n *(float*)options->getPluginData(\"DAE-AssetUnitMeter\") = daeReader.getAssetUnitMeter();\n if (options->getPluginData(\"DAE-AssetUp_axis\"))\n *(domUpAxisType*)options->getPluginData(\"DAE-AssetUp_axis\") = daeReader.getAssetUpAxis();\n }\n\n osg::Node* rootNode( daeReader.getRootNode() );\n return rootNode;\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nosgDB::ReaderWriter::WriteResult\nReaderWriterDAE::writeNode( const osg::Node& node,\n const std::string& fname, const osgDB::ReaderWriter::Options* options ) const\n{\n SERIALIZER();\n\n bool bOwnDAE = false;\n DAE* pDAE = NULL;\n\n std::string ext( osgDB::getLowerCaseFileExtension(fname) );\n if( ! acceptsExtension(ext) ) return WriteResult::FILE_NOT_HANDLED;\n\n \/\/ Process options\n osgDAE::daeWriter::Options pluginOptions;\n std::string srcDirectory( osgDB::getFilePath(node.getName().empty() ? fname : node.getName()) ); \/\/ Base dir when relativising images paths\n if( options )\n {\n pDAE = (DAE*)options->getPluginData(\"DAE\");\n\n const std::string & baseDir = options->getPluginStringData(\"baseImageDir\"); \/\/ Rename \"srcModelPath\" (and call getFilePath() on it)?\n if (!baseDir.empty()) srcDirectory = baseDir;\n\n const std::string & relativiseImagesPathNbUpDirs = options->getPluginStringData(\"DAE-relativiseImagesPathNbUpDirs\");\n if (!relativiseImagesPathNbUpDirs.empty()) {\n std::istringstream iss(relativiseImagesPathNbUpDirs);\n iss >> pluginOptions.relativiseImagesPathNbUpDirs;\n }\n\n \/\/ Sukender's note: I don't know why DAE seems to accept comma-sparated options instead of space-separated options as other ReaderWriters. However, to avoid breaking compatibility, here's a workaround:\n std::string optString( options->getOptionString() );\n for(std::string::iterator it=optString.begin(); it!=optString.end(); ++it) {\n if (*it == ' ') *it = ',';\n }\n std::istringstream iss( optString );\n std::string opt;\n\n \/\/while (iss >> opt)\n while( std::getline( iss, opt, ',' ) )\n {\n if( opt == \"polygon\") pluginOptions.usePolygons = true;\n else if (opt == \"GoogleMode\") pluginOptions.googleMode = true;\n else if (opt == \"NoExtras\") pluginOptions.writeExtras = false;\n else if (opt == \"daeEarthTex\") pluginOptions.earthTex = true;\n else if (opt == \"daeZUpAxis\") {} \/\/ Nothing (old option)\n else if (opt == \"daeLinkOriginalTexturesNoForce\") { pluginOptions.linkOrignialTextures = true; pluginOptions.forceTexture = false; }\n else if (opt == \"daeLinkOriginalTexturesForce\") { pluginOptions.linkOrignialTextures = true; pluginOptions.forceTexture = true; }\n else if (opt == \"daeNamesUseCodepage\") pluginOptions.namesUseCodepage = true;\n else if (opt == \"daeRenameIds\") pluginOptions.renameIds = true;\n else if (!opt.empty())\n {\n OSG_NOTICE << std::endl << \"COLLADA dae plugin: unrecognized option \\\"\" << opt << std::endl;\n }\n }\n }\n\n if (NULL == pDAE)\n {\n bOwnDAE = true;\n#ifdef COLLADA_DOM_2_4_OR_LATER\n pDAE = new DAE(NULL,NULL,_specversion);\n#else\n pDAE = new DAE;\n#endif\n }\n smart_ptr<DAE> scopedDae(bOwnDAE ? pDAE : NULL); \/\/ Deallocates locally created structure at scope exit\n\n \/\/ Convert file name to URI\n std::string fileURI = ConvertFilePathToColladaCompatibleURI(fname);\n\n osg::NodeVisitor::TraversalMode traversalMode = pluginOptions.writeExtras ? osg::NodeVisitor::TRAVERSE_ALL_CHILDREN : osg::NodeVisitor::TRAVERSE_ACTIVE_CHILDREN;\n\n osgDAE::daeWriter daeWriter(pDAE, fileURI, osgDB::getFilePath(fname), srcDirectory, options, traversalMode, &pluginOptions);\n daeWriter.setRootNode( node );\n const_cast<osg::Node*>(&node)->accept( daeWriter );\n\n osgDB::ReaderWriter::WriteResult retVal( WriteResult::ERROR_IN_WRITING_FILE );\n if ( daeWriter.isSuccess() )\n {\n if (pDAE->write(fileURI))\n retVal = WriteResult::FILE_SAVED;\n }\n\n if ( options )\n {\n if (!bOwnDAE)\n {\n \/\/ Return the document URI used so that users of an external DAE object\n \/\/ can locate the correct database\n if (options->getPluginData(\"DAE-DocumentURI\"))\n *(std::string*)options->getPluginData(\"DAE-DocumentURI\") = fileURI;\n }\n }\n\n return retVal;\n}\n\nstatic void replace(std::string & str, const char from, const std::string & to)\n{\n \/\/ Replace for all occurrences\n for(std::string::size_type pos=str.find(from); pos!=std::string::npos; pos=str.find(from))\n {\n str.replace(pos, 1, to);\n }\n}\n\nstatic void replace(std::string & str, const std::string & from, const std::string & to)\n{\n \/\/ Replace for all occurrences\n std::size_t lenFrom = from.size();\n std::size_t lenTo = to.size();\n for(std::string::size_type pos=str.find(from); pos!=std::string::npos; pos = str.find(from, pos+lenTo))\n {\n str.replace(pos, lenFrom, to);\n }\n}\n\nstd::string ReaderWriterDAE::ConvertFilePathToColladaCompatibleURI(const std::string& FilePath)\n{\n#ifdef OSG_USE_UTF8_FILENAME\n std::string path( cdom::nativePathToUri( FilePath ) );\n#else\n std::string path( cdom::nativePathToUri( osgDB::convertStringFromCurrentCodePageToUTF8(FilePath) ) );\n#endif\n\n \/\/ Unfortunately, cdom::nativePathToUri() does not convert '#' characters to \"%23\" as expected.\n \/\/ So having \/a\/#b\/c will generate a wrong conversion, as '#' will be misinterpreted as an URI fragment.\n \/\/ Here are listed all special chars, but only # was found problematic. I (Sukender) tested #{}^~[]`;@=&$ under Windows.\n \/\/ Uncomment lines if you find issues with some other special characters.\n\n \/\/replace(path, '%', \"%25\"); \/\/ % at first\n \/\/replace(path, ' ', \"%20\");\n replace(path, '#', \"%23\");\n \/\/replace(path, '<', \"%3C\");\n \/\/replace(path, '>', \"%3E\");\n \/\/replace(path, '{', \"%7B\");\n \/\/replace(path, '}', \"%7D\");\n \/\/replace(path, '|', \"%7C\");\n \/\/replace(path, '^', \"%5E\");\n \/\/replace(path, '~', \"%7E\");\n \/\/replace(path, '[', \"%5B\");\n \/\/replace(path, '}', \"%5D\");\n \/\/replace(path, '`', \"%60\");\n \/\/replace(path, ';', \"%3B\");\n \/\/replace(path, '?', \"%3F\");\n \/\/replace(path, '@', \"%40\");\n \/\/replace(path, '=', \"%3D\");\n \/\/replace(path, '&', \"%26\");\n \/\/replace(path, '$', \"%24\");\n return path;\n}\n\nstd::string ReaderWriterDAE::ConvertColladaCompatibleURIToFilePath(const std::string& uri)\n{\n \/\/ Reciprocal of ConvertFilePathToColladaCompatibleURI()\n#ifdef OSG_USE_UTF8_FILENAME\n std::string path( cdom::uriToNativePath( uri ) );\n#else\n std::string path( osgDB::convertStringFromCurrentCodePageToUTF8( cdom::uriToNativePath(uri) ) );\n#endif\n replace(path, \"%23\", \"#\");\n return path;\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ Add ourself to the Registry to instantiate the reader\/writer.\n\nREGISTER_OSGPLUGIN(dae, ReaderWriterDAE)\n\n\/\/ vim: set sw=4 ts=8 et ic ai:\n<|endoftext|>"} {"text":"<commit_before>\/* -*-c++-*- OpenSceneGraph - Copyright (C) 1998-2006 Robert Osfield \n *\n * This application is open source and may be redistributed and\/or modified \n * freely and without restriction, both in commercial and non commercial\n * applications, as long as this copyright notice is maintained.\n * \n * This application is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.\n *\n*\/\n\n#include <sstream>\n#include <memory>\n\n#include <osg\/Notify>\n#include <osg\/NodeVisitor>\n#include <osgDB\/ReaderWriter>\n#include <osgDB\/FileNameUtils>\n#include <osgDB\/Registry>\n\n#include <OpenThreads\/ScopedLock>\n\n#include \"ReaderWriterDAE.h\"\n#include \"daeReader.h\"\n#include \"daeWriter.h\"\n\n#ifdef WIN32\n#include \"windows.h\"\n#endif\n\n#define SERIALIZER() OpenThreads::ScopedLock<OpenThreads::ReentrantMutex> lock(_serializerMutex) \n\nosgDB::ReaderWriter::ReadResult\nReaderWriterDAE::readNode(const std::string& fname,\n const osgDB::ReaderWriter::Options* options) const\n{\n SERIALIZER();\n\n bool bOwnDAE = false;\n DAE* pDAE = NULL;\n\n if ( options )\n pDAE = (DAE*)options->getPluginData(\"DAE\");\n\n std::string ext( osgDB::getLowerCaseFileExtension(fname) );\n if( ! acceptsExtension(ext) ) return ReadResult::FILE_NOT_HANDLED;\n\n std::string fileName( osgDB::findDataFile( fname, options ) );\n if( fileName.empty() ) return ReadResult::FILE_NOT_FOUND;\n\n OSG_INFO << \"ReaderWriterDAE( \\\"\" << fileName << \"\\\" )\" << std::endl;\n\n if (NULL == pDAE)\n {\n bOwnDAE = true;\n pDAE = new DAE;\n }\n\n osgDAE::daeReader daeReader(pDAE, options && options->getOptionString().find(\"StrictTransparency\") != std::string::npos ) ;\n\n \/\/ Convert file name to URI\n std::string fileURI = ConvertFilePathToColladaCompatibleURI(fileName);\n\n if ( ! daeReader.convert( fileURI ) )\n {\n OSG_WARN << \"Load failed in COLLADA DOM conversion\" << std::endl;\n return ReadResult::ERROR_IN_READING_FILE;\n }\n\n if ( options )\n {\n \/\/ Return the document URI\n if (options->getPluginData(\"DAE-DocumentURI\"))\n *(std::string*)options->getPluginData(\"DAE-DocumentURI\") = fileURI;\n \/\/ Return some additional information about the document\n if (options->getPluginData(\"DAE-AssetUnitName\"))\n *(std::string*)options->getPluginData(\"DAE-AssetUnitName\") = daeReader.getAssetUnitName();\n if (options->getPluginData(\"DAE-AssetUnitMeter\"))\n *(float*)options->getPluginData(\"DAE-AssetUnitMeter\") = daeReader.getAssetUnitMeter();\n if (options->getPluginData(\"DAE-AssetUp_axis\"))\n *(domUpAxisType*)options->getPluginData(\"DAE-AssetUp_axis\") = daeReader.getAssetUpAxis();\n }\n\n if (bOwnDAE)\n delete pDAE;\n\n osg::Node* rootNode( daeReader.getRootNode() );\n return rootNode;\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nosgDB::ReaderWriter::WriteResult\nReaderWriterDAE::writeNode( const osg::Node& node,\n const std::string& fname, const osgDB::ReaderWriter::Options* options ) const\n{\n SERIALIZER();\n\n bool bOwnDAE = false;\n DAE* pDAE = NULL;\n\n std::string ext( osgDB::getLowerCaseFileExtension(fname) );\n if( ! acceptsExtension(ext) ) return WriteResult::FILE_NOT_HANDLED;\n\n \/\/ Process options\n bool usePolygon(false); \/\/ Use plugin option \"polygon\" to enable\n bool googleMode(false); \/\/ Use plugin option \"GoogleMode\" to enable\n bool writeExtras(true); \/\/ Use plugin option \"NoExtras\" to disable\n bool earthTex(false); \/\/ Use plugin option \"DaeEarthTex\" to enable\n bool zUpAxis(false); \/\/ Use plugin option \"ZUpAxis\" to enable\n bool forceTexture(false); \/\/ Use plugin option \"ForceTexture\" to enable\n if( options )\n {\n pDAE = (DAE*)options->getPluginData(\"DAE\");\n \/\/ Sukender's note: I don't know why DAE seems to accept comma-sparated options instead of space-separated options as other ReaderWriters. However, to avoid breaking compatibility, here's a workaround:\n std::string optString( options->getOptionString() );\n for(std::string::iterator it=optString.begin(); it!=optString.end(); ++it) {\n if (*it == ' ') *it = ',';\n }\n std::istringstream iss( optString );\n std::string opt;\n\n \/\/while (iss >> opt)\n while( std::getline( iss, opt, ',' ) )\n {\n if( opt == \"polygon\") usePolygon = true;\n else if (opt == \"GoogleMode\") googleMode = true;\n else if (opt == \"NoExtras\") writeExtras = false;\n else if (opt == \"DaeEarthTex\") earthTex = true;\n else if (opt == \"ZUpAxis\") zUpAxis = true;\n else if (opt == \"ForceTexture\") forceTexture = true;\n else if (!opt.empty())\n {\n OSG_NOTICE << std::endl << \"COLLADA dae plugin: unrecognized option \\\"\" << opt << std::endl;\n }\n }\n }\n\n if (NULL == pDAE)\n {\n bOwnDAE = true;\n pDAE = new DAE;\n }\n\n \/\/ Convert file name to URI\n std::string fileURI = ConvertFilePathToColladaCompatibleURI(fname);\n\n osg::NodeVisitor::TraversalMode traversalMode = writeExtras ? osg::NodeVisitor::TRAVERSE_ALL_CHILDREN : osg::NodeVisitor::TRAVERSE_ACTIVE_CHILDREN;\n\n osgDAE::daeWriter daeWriter(pDAE, fileURI, usePolygon, googleMode, traversalMode, writeExtras, earthTex, zUpAxis, forceTexture);\n daeWriter.setRootNode( node );\n const_cast<osg::Node*>(&node)->accept( daeWriter );\n\n osgDB::ReaderWriter::WriteResult retVal( WriteResult::ERROR_IN_WRITING_FILE );\n if ( daeWriter.isSuccess() )\n {\n if (pDAE->write(fileURI))\n retVal = WriteResult::FILE_SAVED;\n }\n\n if ( options )\n {\n if (!bOwnDAE)\n {\n \/\/ Return the document URI used so that users of an external DAE object\n \/\/ can locate the correct database\n if (options->getPluginData(\"DAE-DocumentURI\"))\n *(std::string*)options->getPluginData(\"DAE-DocumentURI\") = fileURI;\n }\n }\n\n if (bOwnDAE)\n delete pDAE;\n\n return retVal;\n}\n\nstd::string ReaderWriterDAE::ConvertFilePathToColladaCompatibleURI(const std::string& FilePath)\n{\n return cdom::nativePathToUri(FilePath);\n}\n\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ Add ourself to the Registry to instantiate the reader\/writer.\n\nREGISTER_OSGPLUGIN(dae, ReaderWriterDAE)\n\n\/\/ vim: set sw=4 ts=8 et ic ai:\n<commit_msg>From Sukender, \"Fixed ReaderWriterDAE::ConvertFilePathToColladaCompatibleURI(): It now handles paths containing '#' character as expected.\"<commit_after>\/* -*-c++-*- OpenSceneGraph - Copyright (C) 1998-2006 Robert Osfield\n *\n * This application is open source and may be redistributed and\/or modified \n * freely and without restriction, both in commercial and non commercial\n * applications, as long as this copyright notice is maintained.\n * \n * This application is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.\n *\n*\/\n\n#include <sstream>\n#include <memory>\n\n#include <osg\/Notify>\n#include <osg\/NodeVisitor>\n#include <osgDB\/ReaderWriter>\n#include <osgDB\/FileNameUtils>\n#include <osgDB\/Registry>\n\n#include <OpenThreads\/ScopedLock>\n\n#include \"ReaderWriterDAE.h\"\n#include \"daeReader.h\"\n#include \"daeWriter.h\"\n\n#ifdef WIN32\n#include \"windows.h\"\n#endif\n\n#define SERIALIZER() OpenThreads::ScopedLock<OpenThreads::ReentrantMutex> lock(_serializerMutex) \n\nosgDB::ReaderWriter::ReadResult\nReaderWriterDAE::readNode(const std::string& fname,\n const osgDB::ReaderWriter::Options* options) const\n{\n SERIALIZER();\n\n bool bOwnDAE = false;\n DAE* pDAE = NULL;\n\n if ( options )\n pDAE = (DAE*)options->getPluginData(\"DAE\");\n\n std::string ext( osgDB::getLowerCaseFileExtension(fname) );\n if( ! acceptsExtension(ext) ) return ReadResult::FILE_NOT_HANDLED;\n\n std::string fileName( osgDB::findDataFile( fname, options ) );\n if( fileName.empty() ) return ReadResult::FILE_NOT_FOUND;\n\n OSG_INFO << \"ReaderWriterDAE( \\\"\" << fileName << \"\\\" )\" << std::endl;\n\n if (NULL == pDAE)\n {\n bOwnDAE = true;\n pDAE = new DAE;\n }\n\n osgDAE::daeReader daeReader(pDAE, options && options->getOptionString().find(\"StrictTransparency\") != std::string::npos ) ;\n\n \/\/ Convert file name to URI\n std::string fileURI = ConvertFilePathToColladaCompatibleURI(fileName);\n\n if ( ! daeReader.convert( fileURI ) )\n {\n OSG_WARN << \"Load failed in COLLADA DOM conversion\" << std::endl;\n return ReadResult::ERROR_IN_READING_FILE;\n }\n\n if ( options )\n {\n \/\/ Return the document URI\n if (options->getPluginData(\"DAE-DocumentURI\"))\n *(std::string*)options->getPluginData(\"DAE-DocumentURI\") = fileURI;\n \/\/ Return some additional information about the document\n if (options->getPluginData(\"DAE-AssetUnitName\"))\n *(std::string*)options->getPluginData(\"DAE-AssetUnitName\") = daeReader.getAssetUnitName();\n if (options->getPluginData(\"DAE-AssetUnitMeter\"))\n *(float*)options->getPluginData(\"DAE-AssetUnitMeter\") = daeReader.getAssetUnitMeter();\n if (options->getPluginData(\"DAE-AssetUp_axis\"))\n *(domUpAxisType*)options->getPluginData(\"DAE-AssetUp_axis\") = daeReader.getAssetUpAxis();\n }\n\n if (bOwnDAE)\n delete pDAE;\n\n osg::Node* rootNode( daeReader.getRootNode() );\n return rootNode;\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nosgDB::ReaderWriter::WriteResult\nReaderWriterDAE::writeNode( const osg::Node& node,\n const std::string& fname, const osgDB::ReaderWriter::Options* options ) const\n{\n SERIALIZER();\n\n bool bOwnDAE = false;\n DAE* pDAE = NULL;\n\n std::string ext( osgDB::getLowerCaseFileExtension(fname) );\n if( ! acceptsExtension(ext) ) return WriteResult::FILE_NOT_HANDLED;\n\n \/\/ Process options\n bool usePolygon(false); \/\/ Use plugin option \"polygon\" to enable\n bool googleMode(false); \/\/ Use plugin option \"GoogleMode\" to enable\n bool writeExtras(true); \/\/ Use plugin option \"NoExtras\" to disable\n bool earthTex(false); \/\/ Use plugin option \"DaeEarthTex\" to enable\n bool zUpAxis(false); \/\/ Use plugin option \"ZUpAxis\" to enable\n bool forceTexture(false); \/\/ Use plugin option \"ForceTexture\" to enable\n if( options )\n {\n pDAE = (DAE*)options->getPluginData(\"DAE\");\n \/\/ Sukender's note: I don't know why DAE seems to accept comma-sparated options instead of space-separated options as other ReaderWriters. However, to avoid breaking compatibility, here's a workaround:\n std::string optString( options->getOptionString() );\n for(std::string::iterator it=optString.begin(); it!=optString.end(); ++it) {\n if (*it == ' ') *it = ',';\n }\n std::istringstream iss( optString );\n std::string opt;\n\n \/\/while (iss >> opt)\n while( std::getline( iss, opt, ',' ) )\n {\n if( opt == \"polygon\") usePolygon = true;\n else if (opt == \"GoogleMode\") googleMode = true;\n else if (opt == \"NoExtras\") writeExtras = false;\n else if (opt == \"DaeEarthTex\") earthTex = true;\n else if (opt == \"ZUpAxis\") zUpAxis = true;\n else if (opt == \"ForceTexture\") forceTexture = true;\n else if (!opt.empty())\n {\n OSG_NOTICE << std::endl << \"COLLADA dae plugin: unrecognized option \\\"\" << opt << std::endl;\n }\n }\n }\n\n if (NULL == pDAE)\n {\n bOwnDAE = true;\n pDAE = new DAE;\n }\n\n \/\/ Convert file name to URI\n std::string fileURI = ConvertFilePathToColladaCompatibleURI(fname);\n\n osg::NodeVisitor::TraversalMode traversalMode = writeExtras ? osg::NodeVisitor::TRAVERSE_ALL_CHILDREN : osg::NodeVisitor::TRAVERSE_ACTIVE_CHILDREN;\n\n osgDAE::daeWriter daeWriter(pDAE, fileURI, usePolygon, googleMode, traversalMode, writeExtras, earthTex, zUpAxis, forceTexture);\n daeWriter.setRootNode( node );\n const_cast<osg::Node*>(&node)->accept( daeWriter );\n\n osgDB::ReaderWriter::WriteResult retVal( WriteResult::ERROR_IN_WRITING_FILE );\n if ( daeWriter.isSuccess() )\n {\n if (pDAE->write(fileURI))\n retVal = WriteResult::FILE_SAVED;\n }\n\n if ( options )\n {\n if (!bOwnDAE)\n {\n \/\/ Return the document URI used so that users of an external DAE object\n \/\/ can locate the correct database\n if (options->getPluginData(\"DAE-DocumentURI\"))\n *(std::string*)options->getPluginData(\"DAE-DocumentURI\") = fileURI;\n }\n }\n\n if (bOwnDAE)\n delete pDAE;\n\n return retVal;\n}\n\nstatic void replace(std::string & str, const char from, const std::string & to) {\n \/\/ Replace for all occurences\n for(std::string::size_type pos=str.find(from); pos!=std::string::npos; pos=str.find(from))\n {\n str.replace(pos, 1, to);\n }\n}\n\nstd::string ReaderWriterDAE::ConvertFilePathToColladaCompatibleURI(const std::string& FilePath)\n{\n std::string path( cdom::nativePathToUri(FilePath) );\n\n \/\/ Unfortunately, cdom::nativePathToUri() does not convert '#' characters to \"%23\" as expected.\n \/\/ So having \/a\/#b\/c will generate a wrong conversion, as '#' will be misinterpreted as an URI fragment.\n \/\/ Here are listed all special chars, but only # was found problematic. I (Sukender) tested #{}^~[]`;@=&$ under Windows.\n \/\/ Uncomment lines if you find issues with some other special characters.\n\n \/\/replace(path, '%', \"%25\"); \/\/ % at first\n \/\/replace(path, ' ', \"%20\");\n replace(path, '#', \"%23\");\n \/\/replace(path, '<', \"%3C\");\n \/\/replace(path, '>', \"%3E\");\n \/\/replace(path, '{', \"%7B\");\n \/\/replace(path, '}', \"%7D\");\n \/\/replace(path, '|', \"%7C\");\n \/\/replace(path, '^', \"%5E\");\n \/\/replace(path, '~', \"%7E\");\n \/\/replace(path, '[', \"%5B\");\n \/\/replace(path, '}', \"%5D\");\n \/\/replace(path, '`', \"%60\");\n \/\/replace(path, ';', \"%3B\");\n \/\/replace(path, '?', \"%3F\");\n \/\/replace(path, '@', \"%40\");\n \/\/replace(path, '=', \"%3D\");\n \/\/replace(path, '&', \"%26\");\n \/\/replace(path, '$', \"%24\");\n return path;\n}\n\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ Add ourself to the Registry to instantiate the reader\/writer.\n\nREGISTER_OSGPLUGIN(dae, ReaderWriterDAE)\n\n\/\/ vim: set sw=4 ts=8 et ic ai:\n<|endoftext|>"} {"text":"<commit_before>#include \"MatrixTransform.h\"\n#include \"Group.h\"\n\n#include <osg\/Notify>\n\n#include <osgDB\/FileNameUtils>\n#include <osgDB\/Registry>\n\nusing namespace osg;\nusing namespace osgDB;\n\nclass IVEReaderWriter : public ReaderWriter\n{\n public:\n virtual const char* className() { return \"IVE Reader\/Writer\"; }\n\n virtual bool acceptsExtension(const std::string& extension)\n {\n return equalCaseInsensitive(extension,\"ive\");\n }\n\n virtual ReadResult readNode(const std::string& fileName, const Options* options)\n {\n std::string ext = getFileExtension(fileName);\n if (!acceptsExtension(ext)) return ReadResult::FILE_NOT_HANDLED;\n \n std::ifstream istream(fileName.c_str(), std::ios::in | std::ios::binary);\n return readNode(istream,options);\n }\n \n virtual ReadResult readNode(std::istream& fin, const Options*)\n {\n\t try{\n \/\/ Create datainputstream.\n ive::DataInputStream in(&fin);\n\n return in.readNode();\n\t }\n\t catch(ive::Exception e)\n {\n\t std::cout<<\"Error reading file: \"<< e.getError()<<std::endl;\n\t return ReadResult::FILE_NOT_HANDLED;\n\t }\n return 0;\n }\n\n virtual WriteResult writeNode(const Node& node,const std::string& fileName, const osgDB::ReaderWriter::Options* options)\n {\n std::string ext = getFileExtension(fileName);\n if (!acceptsExtension(ext)) return WriteResult::FILE_NOT_HANDLED;\n\n std::ofstream fout(fileName.c_str(), std::ios::out | std::ios::binary);\n WriteResult result = writeNode(node, fout, options);\n fout.close();\n return result;\n }\n \n virtual WriteResult writeNode(const Node& node,std::ostream& fout, const osgDB::ReaderWriter::Options*)\n {\n try\n {\n ive::DataOutputStream out(&fout);\n \n out.writeNode(const_cast<osg::Node*>(&node));\n return WriteResult::FILE_SAVED;\n }\n catch(ive::Exception e)\n {\n\t osg::notify(osg::WARN)<<\"Error parsing OSG file: \"<< e.getError() << std::endl;\t\t\t\n }\n return WriteResult::FILE_NOT_HANDLED;\n\n }\n\n};\n\n\/\/ now register with Registry to instantiate the above\n\/\/ reader\/writer.\nRegisterReaderWriterProxy<IVEReaderWriter> g_IVEReaderWriterProxy;\n<commit_msg>Added #ifdef IVE_CATCH_EXCEPTIONS to allow catching of exceptions to be turned off for debugging purposes.<commit_after>#include \"MatrixTransform.h\"\n#include \"Group.h\"\n\n#include <osg\/Notify>\n\n#include <osgDB\/FileNameUtils>\n#include <osgDB\/Registry>\n\nusing namespace osg;\nusing namespace osgDB;\n\nclass IVEReaderWriter : public ReaderWriter\n{\n public:\n virtual const char* className() { return \"IVE Reader\/Writer\"; }\n\n virtual bool acceptsExtension(const std::string& extension)\n {\n return equalCaseInsensitive(extension,\"ive\");\n }\n\n virtual ReadResult readNode(const std::string& fileName, const Options* options)\n {\n std::string ext = getFileExtension(fileName);\n if (!acceptsExtension(ext)) return ReadResult::FILE_NOT_HANDLED;\n \n std::ifstream istream(fileName.c_str(), std::ios::in | std::ios::binary);\n return readNode(istream,options);\n }\n \n virtual ReadResult readNode(std::istream& fin, const Options*)\n {\n #define IVE_CATCH_EXCEPTIONS\n #ifdef IVE_CATCH_EXCEPTIONS\n\t try{\n #endif\n \/\/ Create datainputstream.\n ive::DataInputStream in(&fin);\n\n return in.readNode();\n #ifdef IVE_CATCH_EXCEPTIONS\n\t }\n\t catch(ive::Exception e)\n {\n\t std::cout<<\"Error reading file: \"<< e.getError()<<std::endl;\n\t return ReadResult::FILE_NOT_HANDLED;\n\t }\n return 0;\n #endif\n }\n\n virtual WriteResult writeNode(const Node& node,const std::string& fileName, const osgDB::ReaderWriter::Options* options)\n {\n std::string ext = getFileExtension(fileName);\n if (!acceptsExtension(ext)) return WriteResult::FILE_NOT_HANDLED;\n\n std::ofstream fout(fileName.c_str(), std::ios::out | std::ios::binary);\n WriteResult result = writeNode(node, fout, options);\n fout.close();\n return result;\n }\n \n virtual WriteResult writeNode(const Node& node,std::ostream& fout, const osgDB::ReaderWriter::Options*)\n {\n try\n {\n ive::DataOutputStream out(&fout);\n \n out.writeNode(const_cast<osg::Node*>(&node));\n return WriteResult::FILE_SAVED;\n }\n catch(ive::Exception e)\n {\n\t osg::notify(osg::WARN)<<\"Error parsing OSG file: \"<< e.getError() << std::endl;\t\t\t\n }\n return WriteResult::FILE_NOT_HANDLED;\n\n }\n\n};\n\n\/\/ now register with Registry to instantiate the above\n\/\/ reader\/writer.\nRegisterReaderWriterProxy<IVEReaderWriter> g_IVEReaderWriterProxy;\n<|endoftext|>"} {"text":"<commit_before>\/\/ The MIT License (MIT) \n\n\/\/ Copyright (c) 2013-2016 Rapptz, ThePhD and contributors\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#ifndef SOL_FUNCTION_TYPES_TEMPLATED_HPP\n#define SOL_FUNCTION_TYPES_TEMPLATED_HPP\n\n#include \"call.hpp\"\n\nnamespace sol {\n\tnamespace function_detail {\n\t\ttemplate <typename F, F fx>\n\t\tinline int call_wrapper_variable(std::false_type, lua_State* L) {\n\t\t\ttypedef meta::bind_traits<meta::unqualified_t<F>> traits_type;\n\t\t\ttypedef typename traits_type::args_list args_list;\n\t\t\ttypedef meta::tuple_types<typename traits_type::return_type> return_type;\n\t\t\treturn stack::call_into_lua(return_type(), args_list(), L, 1, fx);\n\t\t}\n\n\t\ttemplate <typename R, typename V, V, typename T>\n\t\tinline int call_set_assignable(std::false_type, T&&, lua_State* L) {\n\t\t\tlua_pop(L, 2);\n\t\t\treturn luaL_error(L, \"cannot write to this type: copy assignment\/constructor not available\");\n\t\t}\n\n\t\ttemplate <typename R, typename V, V variable, typename T>\n\t\tinline int call_set_assignable(std::true_type, lua_State* L, T&& mem) {\n\t\t\t(mem.*variable) = stack::get<R>(L, 2);\n\t\t\tlua_pop(L, 2);\n\t\t\treturn 0;\n\t\t}\n\n\t\ttemplate <typename R, typename V, V, typename T>\n\t\tinline int call_set_variable(std::false_type, lua_State* L, T&&) {\n\t\t\tlua_pop(L, 2);\n\t\t\treturn luaL_error(L, \"cannot write to a const variable\");\n\t\t}\n\n\t\ttemplate <typename R, typename V, V variable, typename T>\n\t\tinline int call_set_variable(std::true_type, lua_State* L, T&& mem) {\n\t\t\treturn call_set_assignable<R, V, variable>(std::is_assignable<std::add_lvalue_reference_t<R>, R>(), L, std::forward<T>(mem));\n\t\t}\n\n\t\ttemplate <typename V, V variable>\n\t\tinline int call_wrapper_variable(std::true_type, lua_State* L) {\n\t\t\ttypedef meta::bind_traits<meta::unqualified_t<V>> traits_type;\n\t\t\ttypedef typename traits_type::object_type T;\n\t\t\ttypedef typename traits_type::return_type R;\n\t\t\tauto& mem = stack::get<T>(L, 1);\n\t\t\tswitch (lua_gettop(L)) {\n\t\t\tcase 1: {\n\t\t\t\tdecltype(auto) r = (mem.*variable);\n\t\t\t\tlua_pop(L, 1);\n\t\t\t\tstack::push_reference(L, std::forward<decltype(r)>(r));\n\t\t\t\treturn 1; }\n\t\t\tcase 2:\n\t\t\t\treturn call_set_variable<R, V, variable>(meta::neg<std::is_const<R>>(), L, mem);\n\t\t\tdefault:\n\t\t\t\treturn luaL_error(L, \"incorrect number of arguments to member variable function call\");\n\t\t\t}\n\t\t}\n\n\t\ttemplate <typename F, F fx>\n\t\tinline int call_wrapper_function(std::false_type, lua_State* L) {\n\t\t\treturn call_wrapper_variable<F, fx>(std::is_member_object_pointer<F>(), L);\n\t\t}\n\n\t\ttemplate <typename F, F fx>\n\t\tinline int call_wrapper_function(std::true_type, lua_State* L) {\n\t\t\ttypedef meta::bind_traits<meta::unqualified_t<F>> traits_type;\n\t\t\ttypedef typename traits_type::object_type T;\n\t\t\ttypedef typename traits_type::args_list args_list;\n\t\t\ttypedef typename traits_type::return_type return_type;\n\t\t\ttypedef meta::tuple_types<return_type> return_type_list;\n\t\t\tauto mfx = [&](auto&&... args) -> typename traits_type::return_type {\n\t\t\t\tauto& member = stack::get<T>(L, 1);\n\t\t\t\treturn (member.*fx)(std::forward<decltype(args)>(args)...);\n\t\t\t};\n\t\t\tint n = stack::call_into_lua<1>(return_type_list(), args_list(), L, 2, mfx);\n\t\t\treturn n;\n\t\t}\n\n\t\ttemplate <typename F, F fx>\n\t\tint call_wrapper_entry(lua_State* L) {\n\t\t\treturn call_wrapper_function<F, fx>(std::is_member_function_pointer<meta::unqualified_t<F>>(), L);\n\t\t}\n\n\t\ttemplate <typename... Fxs>\n\t\tstruct c_call_matcher {\n\t\t\ttemplate <typename Fx, std::size_t I, typename R, typename... Args>\n\t\t\tint operator()(types<Fx>, index_value<I>, types<R>, types<Args...>, lua_State* L, int, int) const {\n\t\t\t\ttypedef meta::at_in_pack_t<I, Fxs...> target;\n\t\t\t\treturn target::call(L);\n\t\t\t}\n\t\t};\n\n\t} \/\/ function_detail\n\n\ttemplate <typename F, F fx>\n\tinline int c_call(lua_State* L) {\n#ifdef __clang__\n\t\treturn detail::trampoline(L, function_detail::call_wrapper_entry<F, fx>);\n#else\n\t\treturn detail::static_trampoline<(&function_detail::call_wrapper_entry<F, fx>)>(L);\n#endif \/\/ fuck you clang :c\n\t}\n\n\ttemplate <typename F, F f>\n\tstruct wrap {\n\t\ttypedef F type;\n\t\ttypedef wrapper<F> wrapper;\n\n\t\tstatic int call(lua_State* L) {\n\t\t\treturn c_call<type, f>(L);\n\t\t}\n\t};\n\n\ttemplate <typename... Fxs>\n\tinline int c_call(lua_State* L) {\n\t\tif (sizeof...(Fxs) < 2) {\n\t\t\treturn meta::at_in_pack_t<0, Fxs...>::call(L);\n\t\t}\n\t\telse {\n\t\t\treturn call_detail::overload_match_arity<typename Fxs::type...>(function_detail::c_call_matcher<Fxs...>(), L, lua_gettop(L), 1);\n\t\t}\n\t}\n\n} \/\/ sol\n\n#endif \/\/ SOL_FUNCTION_TYPES_TEMPLATED_HPP\n<commit_msg>SIGH name shadowing<commit_after>\/\/ The MIT License (MIT) \n\n\/\/ Copyright (c) 2013-2016 Rapptz, ThePhD and contributors\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#ifndef SOL_FUNCTION_TYPES_TEMPLATED_HPP\n#define SOL_FUNCTION_TYPES_TEMPLATED_HPP\n\n#include \"call.hpp\"\n\nnamespace sol {\n\tnamespace function_detail {\n\t\ttemplate <typename F, F fx>\n\t\tinline int call_wrapper_variable(std::false_type, lua_State* L) {\n\t\t\ttypedef meta::bind_traits<meta::unqualified_t<F>> traits_type;\n\t\t\ttypedef typename traits_type::args_list args_list;\n\t\t\ttypedef meta::tuple_types<typename traits_type::return_type> return_type;\n\t\t\treturn stack::call_into_lua(return_type(), args_list(), L, 1, fx);\n\t\t}\n\n\t\ttemplate <typename R, typename V, V, typename T>\n\t\tinline int call_set_assignable(std::false_type, T&&, lua_State* L) {\n\t\t\tlua_pop(L, 2);\n\t\t\treturn luaL_error(L, \"cannot write to this type: copy assignment\/constructor not available\");\n\t\t}\n\n\t\ttemplate <typename R, typename V, V variable, typename T>\n\t\tinline int call_set_assignable(std::true_type, lua_State* L, T&& mem) {\n\t\t\t(mem.*variable) = stack::get<R>(L, 2);\n\t\t\tlua_pop(L, 2);\n\t\t\treturn 0;\n\t\t}\n\n\t\ttemplate <typename R, typename V, V, typename T>\n\t\tinline int call_set_variable(std::false_type, lua_State* L, T&&) {\n\t\t\tlua_pop(L, 2);\n\t\t\treturn luaL_error(L, \"cannot write to a const variable\");\n\t\t}\n\n\t\ttemplate <typename R, typename V, V variable, typename T>\n\t\tinline int call_set_variable(std::true_type, lua_State* L, T&& mem) {\n\t\t\treturn call_set_assignable<R, V, variable>(std::is_assignable<std::add_lvalue_reference_t<R>, R>(), L, std::forward<T>(mem));\n\t\t}\n\n\t\ttemplate <typename V, V variable>\n\t\tinline int call_wrapper_variable(std::true_type, lua_State* L) {\n\t\t\ttypedef meta::bind_traits<meta::unqualified_t<V>> traits_type;\n\t\t\ttypedef typename traits_type::object_type T;\n\t\t\ttypedef typename traits_type::return_type R;\n\t\t\tauto& mem = stack::get<T>(L, 1);\n\t\t\tswitch (lua_gettop(L)) {\n\t\t\tcase 1: {\n\t\t\t\tdecltype(auto) r = (mem.*variable);\n\t\t\t\tlua_pop(L, 1);\n\t\t\t\tstack::push_reference(L, std::forward<decltype(r)>(r));\n\t\t\t\treturn 1; }\n\t\t\tcase 2:\n\t\t\t\treturn call_set_variable<R, V, variable>(meta::neg<std::is_const<R>>(), L, mem);\n\t\t\tdefault:\n\t\t\t\treturn luaL_error(L, \"incorrect number of arguments to member variable function call\");\n\t\t\t}\n\t\t}\n\n\t\ttemplate <typename F, F fx>\n\t\tinline int call_wrapper_function(std::false_type, lua_State* L) {\n\t\t\treturn call_wrapper_variable<F, fx>(std::is_member_object_pointer<F>(), L);\n\t\t}\n\n\t\ttemplate <typename F, F fx>\n\t\tinline int call_wrapper_function(std::true_type, lua_State* L) {\n\t\t\ttypedef meta::bind_traits<meta::unqualified_t<F>> traits_type;\n\t\t\ttypedef typename traits_type::object_type T;\n\t\t\ttypedef typename traits_type::args_list args_list;\n\t\t\ttypedef typename traits_type::return_type return_type;\n\t\t\ttypedef meta::tuple_types<return_type> return_type_list;\n\t\t\tauto mfx = [&](auto&&... args) -> typename traits_type::return_type {\n\t\t\t\tauto& member = stack::get<T>(L, 1);\n\t\t\t\treturn (member.*fx)(std::forward<decltype(args)>(args)...);\n\t\t\t};\n\t\t\tint n = stack::call_into_lua<1>(return_type_list(), args_list(), L, 2, mfx);\n\t\t\treturn n;\n\t\t}\n\n\t\ttemplate <typename F, F fx>\n\t\tint call_wrapper_entry(lua_State* L) {\n\t\t\treturn call_wrapper_function<F, fx>(std::is_member_function_pointer<meta::unqualified_t<F>>(), L);\n\t\t}\n\n\t\ttemplate <typename... Fxs>\n\t\tstruct c_call_matcher {\n\t\t\ttemplate <typename Fx, std::size_t I, typename R, typename... Args>\n\t\t\tint operator()(types<Fx>, index_value<I>, types<R>, types<Args...>, lua_State* L, int, int) const {\n\t\t\t\ttypedef meta::at_in_pack_t<I, Fxs...> target;\n\t\t\t\treturn target::call(L);\n\t\t\t}\n\t\t};\n\n\t} \/\/ function_detail\n\n\ttemplate <typename F, F fx>\n\tinline int c_call(lua_State* L) {\n#ifdef __clang__\n\t\treturn detail::trampoline(L, function_detail::call_wrapper_entry<F, fx>);\n#else\n\t\treturn detail::static_trampoline<(&function_detail::call_wrapper_entry<F, fx>)>(L);\n#endif \/\/ fuck you clang :c\n\t}\n\n\ttemplate <typename F, F f>\n\tstruct wrap {\n\t\ttypedef F type;\n\n\t\tstatic int call(lua_State* L) {\n\t\t\treturn c_call<type, f>(L);\n\t\t}\n\t};\n\n\ttemplate <typename... Fxs>\n\tinline int c_call(lua_State* L) {\n\t\tif (sizeof...(Fxs) < 2) {\n\t\t\treturn meta::at_in_pack_t<0, Fxs...>::call(L);\n\t\t}\n\t\telse {\n\t\t\treturn call_detail::overload_match_arity<typename Fxs::type...>(function_detail::c_call_matcher<Fxs...>(), L, lua_gettop(L), 1);\n\t\t}\n\t}\n\n} \/\/ sol\n\n#endif \/\/ SOL_FUNCTION_TYPES_TEMPLATED_HPP\n<|endoftext|>"} {"text":"<commit_before>\/* Copyright (c) 2012-present Advanced Micro Devices, Inc.\n\n Permission is hereby granted, free of charge, to any person obtaining a copy\n of this software and associated documentation files (the \"Software\"), to deal\n in the Software without restriction, including without limitation the rights\n to use, copy, modify, merge, publish, distribute, sublicense, and\/or sell\n copies of the Software, and to permit persons to whom the Software is\n furnished to do so, subject to the following conditions:\n\n The above copyright notice and this permission notice shall be included in\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 \"commandqueue.hpp\"\n#include \"thread\/monitor.hpp\"\n#include \"device\/device.hpp\"\n#include \"platform\/context.hpp\"\n\n\/*!\n * \\file commandQueue.cpp\n * \\brief Definitions for HostQueue object.\n *\n * \\author Laurent Morichetti\n * \\date October 2008\n *\/\n\nnamespace amd {\n\nHostQueue::HostQueue(Context& context, Device& device, cl_command_queue_properties properties,\n uint queueRTCUs, Priority priority, const std::vector<uint32_t>& cuMask)\n : CommandQueue(context, device, properties, device.info().queueProperties_, queueRTCUs,\n priority, cuMask),\n lastEnqueueCommand_(nullptr),\n head_(nullptr),\n tail_(nullptr) {\n if (AMD_DIRECT_DISPATCH) {\n \/\/ Initialize the queue\n thread_.Init(this);\n } else {\n if (thread_.state() >= Thread::INITIALIZED) {\n ScopedLock sl(queueLock_);\n thread_.start(this);\n queueLock_.wait();\n }\n }\n}\n\nbool HostQueue::terminate() {\n if (AMD_DIRECT_DISPATCH) {\n Command* marker = new Marker(*this, true);\n if (marker != nullptr) {\n marker->enqueue();\n marker->awaitCompletion();\n marker->release();\n }\n thread_.acceptingCommands_ = false;\n thread_.Release();\n } else {\n if (Os::isThreadAlive(thread_)) {\n Command* marker = nullptr;\n\n \/\/ Send a finish if the queue is still accepting commands.\n {\n ScopedLock sl(queueLock_);\n if (thread_.acceptingCommands_) {\n marker = new Marker(*this, false);\n if (marker != nullptr) {\n append(*marker);\n queueLock_.notify();\n }\n }\n }\n if (marker != nullptr) {\n marker->awaitCompletion();\n marker->release();\n }\n\n \/\/ Wake-up the command loop, so it can exit\n {\n ScopedLock sl(queueLock_);\n thread_.acceptingCommands_ = false;\n queueLock_.notify();\n }\n\n \/\/ FIXME_lmoriche: fix termination handshake\n while (thread_.state() < Thread::FINISHED) {\n Os::yield();\n }\n }\n }\n\n if (Agent::shouldPostCommandQueueEvents()) {\n Agent::postCommandQueueFree(as_cl(this->asCommandQueue()));\n }\n\n return true;\n}\n\nvoid HostQueue::finish() {\n Command* command = nullptr;\n if (IS_HIP) {\n command = getLastQueuedCommand(true);\n }\n if (nullptr == command) {\n \/\/ Send a finish to make sure we finished all commands\n command = new Marker(*this, false);\n if (command == NULL) {\n return;\n }\n ClPrint(LOG_DEBUG, LOG_CMD, \"marker is queued\");\n command->enqueue();\n }\n \/\/ Check HW status of the ROCcrl event. Note: not all ROCclr modes support HW status\n static constexpr bool kWaitCompletion = true;\n if (!device().IsHwEventReady(command->event(), kWaitCompletion)) {\n ClPrint(LOG_DEBUG, LOG_CMD, \"HW Event not ready, awaiting completion instead\");\n command->awaitCompletion();\n }\n command->release();\n if (IS_HIP) {\n ScopedLock sl(vdev()->execution());\n ScopedLock l(lastCmdLock_);\n if (lastEnqueueCommand_ != nullptr) {\n lastEnqueueCommand_->release();\n lastEnqueueCommand_ = nullptr;\n }\n }\n ClPrint(LOG_DEBUG, LOG_CMD, \"All commands finished\");\n}\n\nvoid HostQueue::loop(device::VirtualDevice* virtualDevice) {\n \/\/ Notify the caller that the queue is ready to accept commands.\n {\n ScopedLock sl(queueLock_);\n thread_.acceptingCommands_ = true;\n queueLock_.notify();\n }\n \/\/ Create a command batch with all the commands present in the queue.\n Command* head = NULL;\n Command* tail = NULL;\n while (true) {\n \/\/ Get one command from the queue\n Command* command = queue_.dequeue();\n if (command == NULL) {\n ScopedLock sl(queueLock_);\n while ((command = queue_.dequeue()) == NULL) {\n if (!thread_.acceptingCommands_) {\n return;\n }\n queueLock_.wait();\n }\n }\n\n command->retain();\n\n \/\/ Process the command's event wait list.\n const Command::EventWaitList& events = command->eventWaitList();\n bool dependencyFailed = false;\n\n for (const auto& it : events) {\n \/\/ Only wait if the command is enqueued into another queue.\n if (it->command().queue() != this) {\n \/\/ Runtime has to flush the current batch only if the dependent wait is blocking\n if (it->command().status() != CL_COMPLETE) {\n virtualDevice->flush(head, true);\n tail = head = NULL;\n dependencyFailed |= !it->awaitCompletion();\n }\n }\n }\n\n \/\/ Insert the command to the linked list.\n if (NULL == head) { \/\/ if the list is empty\n head = tail = command;\n } else {\n tail->setNext(command);\n tail = command;\n }\n\n if (dependencyFailed) {\n command->setStatus(CL_EXEC_STATUS_ERROR_FOR_EVENTS_IN_WAIT_LIST);\n continue;\n }\n\n ClPrint(LOG_DEBUG, LOG_CMD, \"command (%s) is submitted: %p\", getOclCommandKindString(command->type()), command);\n\n command->setStatus(CL_SUBMITTED);\n\n \/\/ Submit to the device queue.\n command->submit(*virtualDevice);\n\n \/\/ if this is a user invisible marker command, then flush\n if (0 == command->type()) {\n virtualDevice->flush(head);\n tail = head = NULL;\n }\n } \/\/ while (true) {\n}\n\nvoid HostQueue::append(Command& command) {\n \/\/ We retain the command here. It will be released when its status\n \/\/ changes to CL_COMPLETE\n if ((command.getWaitBits() & 0x1) != 0) {\n finish();\n }\n command.retain();\n command.setStatus(CL_QUEUED);\n queue_.enqueue(&command);\n if (!IS_HIP) {\n return;\n }\n\n if (command.waitingEvent() == nullptr) {\n \/\/ Set last submitted command\n Command* prevLastEnqueueCommand;\n command.retain();\n {\n \/\/ lastCmdLock_ ensures that lastEnqueueCommand() can retain the command before it is swapped\n \/\/ out. We want to keep this critical section as short as possible, so the command should be\n \/\/ released outside this section.\n ScopedLock l(lastCmdLock_);\n\n prevLastEnqueueCommand = lastEnqueueCommand_;\n lastEnqueueCommand_ = &command;\n }\n\n if (prevLastEnqueueCommand != nullptr) {\n prevLastEnqueueCommand->release();\n }\n }\n}\n\nbool HostQueue::isEmpty() {\n \/\/ Get a snapshot of queue size\n return queue_.empty();\n}\n\nCommand* HostQueue::getLastQueuedCommand(bool retain) {\n if (AMD_DIRECT_DISPATCH) {\n \/\/ The batch update must be lock protected to avoid a race condition\n \/\/ when multiple threads submit\/flush\/update the batch at the same time\n ScopedLock sl(vdev()->execution());\n \/\/ Since the lastCmdLock_ is acquired, it is safe to read and retain the lastEnqueueCommand.\n \/\/ It is guaranteed that the pointer will not change.\n if (retain && lastEnqueueCommand_ != nullptr) {\n lastEnqueueCommand_->retain();\n }\n return lastEnqueueCommand_;\n } else {\n \/\/ Get last submitted command\n ScopedLock l(lastCmdLock_);\n\n \/\/ Since the lastCmdLock_ is acquired, it is safe to read and retain the lastEnqueueCommand.\n \/\/ It is guaranteed that the pointer will not change.\n if (retain && lastEnqueueCommand_ != nullptr) {\n lastEnqueueCommand_->retain();\n }\n return lastEnqueueCommand_;\n }\n}\n\nDeviceQueue::~DeviceQueue() {\n delete virtualDevice_;\n ScopedLock lock(context().lock());\n context().removeDeviceQueue(device(), this);\n}\n\nbool DeviceQueue::create() {\n static const bool InteropQueue = true;\n const bool defaultDeviceQueue = properties().test(CL_QUEUE_ON_DEVICE_DEFAULT);\n bool result = false;\n\n virtualDevice_ = device().createVirtualDevice(this);\n if (virtualDevice_ != NULL) {\n result = true;\n context().addDeviceQueue(device(), this, defaultDeviceQueue);\n }\n\n return result;\n}\n\n} \/\/ namespace amd\n<commit_msg>SWDEV-292018 - Avoid marker if queue is empty<commit_after>\/* Copyright (c) 2012-present Advanced Micro Devices, Inc.\n\n Permission is hereby granted, free of charge, to any person obtaining a copy\n of this software and associated documentation files (the \"Software\"), to deal\n in the Software without restriction, including without limitation the rights\n to use, copy, modify, merge, publish, distribute, sublicense, and\/or sell\n copies of the Software, and to permit persons to whom the Software is\n furnished to do so, subject to the following conditions:\n\n The above copyright notice and this permission notice shall be included in\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 \"commandqueue.hpp\"\n#include \"thread\/monitor.hpp\"\n#include \"device\/device.hpp\"\n#include \"platform\/context.hpp\"\n\n\/*!\n * \\file commandQueue.cpp\n * \\brief Definitions for HostQueue object.\n *\n * \\author Laurent Morichetti\n * \\date October 2008\n *\/\n\nnamespace amd {\n\nHostQueue::HostQueue(Context& context, Device& device, cl_command_queue_properties properties,\n uint queueRTCUs, Priority priority, const std::vector<uint32_t>& cuMask)\n : CommandQueue(context, device, properties, device.info().queueProperties_, queueRTCUs,\n priority, cuMask),\n lastEnqueueCommand_(nullptr),\n head_(nullptr),\n tail_(nullptr) {\n if (AMD_DIRECT_DISPATCH) {\n \/\/ Initialize the queue\n thread_.Init(this);\n } else {\n if (thread_.state() >= Thread::INITIALIZED) {\n ScopedLock sl(queueLock_);\n thread_.start(this);\n queueLock_.wait();\n }\n }\n}\n\nbool HostQueue::terminate() {\n if (AMD_DIRECT_DISPATCH) {\n Command* marker = new Marker(*this, true);\n if (marker != nullptr) {\n marker->enqueue();\n marker->awaitCompletion();\n marker->release();\n }\n thread_.acceptingCommands_ = false;\n thread_.Release();\n } else {\n if (Os::isThreadAlive(thread_)) {\n Command* marker = nullptr;\n\n \/\/ Send a finish if the queue is still accepting commands.\n {\n ScopedLock sl(queueLock_);\n if (thread_.acceptingCommands_) {\n marker = new Marker(*this, false);\n if (marker != nullptr) {\n append(*marker);\n queueLock_.notify();\n }\n }\n }\n if (marker != nullptr) {\n marker->awaitCompletion();\n marker->release();\n }\n\n \/\/ Wake-up the command loop, so it can exit\n {\n ScopedLock sl(queueLock_);\n thread_.acceptingCommands_ = false;\n queueLock_.notify();\n }\n\n \/\/ FIXME_lmoriche: fix termination handshake\n while (thread_.state() < Thread::FINISHED) {\n Os::yield();\n }\n }\n }\n\n if (Agent::shouldPostCommandQueueEvents()) {\n Agent::postCommandQueueFree(as_cl(this->asCommandQueue()));\n }\n\n return true;\n}\n\nvoid HostQueue::finish() {\n Command* command = nullptr;\n if (IS_HIP) {\n command = getLastQueuedCommand(true);\n \/\/ Check if the queue has nothing to process and return\n if (command == nullptr) {\n return;\n }\n }\n if (nullptr == command) {\n \/\/ Send a finish to make sure we finished all commands\n command = new Marker(*this, false);\n if (command == NULL) {\n return;\n }\n ClPrint(LOG_DEBUG, LOG_CMD, \"marker is queued\");\n command->enqueue();\n }\n \/\/ Check HW status of the ROCcrl event. Note: not all ROCclr modes support HW status\n static constexpr bool kWaitCompletion = true;\n if (!device().IsHwEventReady(command->event(), kWaitCompletion)) {\n ClPrint(LOG_DEBUG, LOG_CMD, \"HW Event not ready, awaiting completion instead\");\n command->awaitCompletion();\n }\n command->release();\n if (IS_HIP) {\n ScopedLock sl(vdev()->execution());\n ScopedLock l(lastCmdLock_);\n if (lastEnqueueCommand_ != nullptr) {\n lastEnqueueCommand_->release();\n lastEnqueueCommand_ = nullptr;\n }\n }\n ClPrint(LOG_DEBUG, LOG_CMD, \"All commands finished\");\n}\n\nvoid HostQueue::loop(device::VirtualDevice* virtualDevice) {\n \/\/ Notify the caller that the queue is ready to accept commands.\n {\n ScopedLock sl(queueLock_);\n thread_.acceptingCommands_ = true;\n queueLock_.notify();\n }\n \/\/ Create a command batch with all the commands present in the queue.\n Command* head = NULL;\n Command* tail = NULL;\n while (true) {\n \/\/ Get one command from the queue\n Command* command = queue_.dequeue();\n if (command == NULL) {\n ScopedLock sl(queueLock_);\n while ((command = queue_.dequeue()) == NULL) {\n if (!thread_.acceptingCommands_) {\n return;\n }\n queueLock_.wait();\n }\n }\n\n command->retain();\n\n \/\/ Process the command's event wait list.\n const Command::EventWaitList& events = command->eventWaitList();\n bool dependencyFailed = false;\n\n for (const auto& it : events) {\n \/\/ Only wait if the command is enqueued into another queue.\n if (it->command().queue() != this) {\n \/\/ Runtime has to flush the current batch only if the dependent wait is blocking\n if (it->command().status() != CL_COMPLETE) {\n virtualDevice->flush(head, true);\n tail = head = NULL;\n dependencyFailed |= !it->awaitCompletion();\n }\n }\n }\n\n \/\/ Insert the command to the linked list.\n if (NULL == head) { \/\/ if the list is empty\n head = tail = command;\n } else {\n tail->setNext(command);\n tail = command;\n }\n\n if (dependencyFailed) {\n command->setStatus(CL_EXEC_STATUS_ERROR_FOR_EVENTS_IN_WAIT_LIST);\n continue;\n }\n\n ClPrint(LOG_DEBUG, LOG_CMD, \"command (%s) is submitted: %p\", getOclCommandKindString(command->type()), command);\n\n command->setStatus(CL_SUBMITTED);\n\n \/\/ Submit to the device queue.\n command->submit(*virtualDevice);\n\n \/\/ if this is a user invisible marker command, then flush\n if (0 == command->type()) {\n virtualDevice->flush(head);\n tail = head = NULL;\n }\n } \/\/ while (true) {\n}\n\nvoid HostQueue::append(Command& command) {\n \/\/ We retain the command here. It will be released when its status\n \/\/ changes to CL_COMPLETE\n if ((command.getWaitBits() & 0x1) != 0) {\n finish();\n }\n command.retain();\n command.setStatus(CL_QUEUED);\n queue_.enqueue(&command);\n if (!IS_HIP) {\n return;\n }\n\n if (command.waitingEvent() == nullptr) {\n \/\/ Set last submitted command\n Command* prevLastEnqueueCommand;\n command.retain();\n {\n \/\/ lastCmdLock_ ensures that lastEnqueueCommand() can retain the command before it is swapped\n \/\/ out. We want to keep this critical section as short as possible, so the command should be\n \/\/ released outside this section.\n ScopedLock l(lastCmdLock_);\n\n prevLastEnqueueCommand = lastEnqueueCommand_;\n lastEnqueueCommand_ = &command;\n }\n\n if (prevLastEnqueueCommand != nullptr) {\n prevLastEnqueueCommand->release();\n }\n }\n}\n\nbool HostQueue::isEmpty() {\n \/\/ Get a snapshot of queue size\n return queue_.empty();\n}\n\nCommand* HostQueue::getLastQueuedCommand(bool retain) {\n if (AMD_DIRECT_DISPATCH) {\n \/\/ The batch update must be lock protected to avoid a race condition\n \/\/ when multiple threads submit\/flush\/update the batch at the same time\n ScopedLock sl(vdev()->execution());\n \/\/ Since the lastCmdLock_ is acquired, it is safe to read and retain the lastEnqueueCommand.\n \/\/ It is guaranteed that the pointer will not change.\n if (retain && lastEnqueueCommand_ != nullptr) {\n lastEnqueueCommand_->retain();\n }\n return lastEnqueueCommand_;\n } else {\n \/\/ Get last submitted command\n ScopedLock l(lastCmdLock_);\n\n \/\/ Since the lastCmdLock_ is acquired, it is safe to read and retain the lastEnqueueCommand.\n \/\/ It is guaranteed that the pointer will not change.\n if (retain && lastEnqueueCommand_ != nullptr) {\n lastEnqueueCommand_->retain();\n }\n return lastEnqueueCommand_;\n }\n}\n\nDeviceQueue::~DeviceQueue() {\n delete virtualDevice_;\n ScopedLock lock(context().lock());\n context().removeDeviceQueue(device(), this);\n}\n\nbool DeviceQueue::create() {\n static const bool InteropQueue = true;\n const bool defaultDeviceQueue = properties().test(CL_QUEUE_ON_DEVICE_DEFAULT);\n bool result = false;\n\n virtualDevice_ = device().createVirtualDevice(this);\n if (virtualDevice_ != NULL) {\n result = true;\n context().addDeviceQueue(device(), this, defaultDeviceQueue);\n }\n\n return result;\n}\n\n} \/\/ namespace amd\n<|endoftext|>"} {"text":"<commit_before>#ifndef ref_ptr_hh_INCLUDED\n#define ref_ptr_hh_INCLUDED\n\n#include <utility>\n\nnamespace Kakoune\n{\n\nstruct WorstMatch { [[gnu::always_inline]] WorstMatch(...) {} };\n\n[[gnu::always_inline]]\ninline void ref_ptr_moved(WorstMatch, void*, void*) noexcept {}\n\ntemplate<typename T, typename TForOverload = T>\nstruct RefPtr\n{\n RefPtr() = default;\n explicit RefPtr(T* ptr) : m_ptr(ptr) { acquire(); }\n ~RefPtr() { release(); }\n RefPtr(const RefPtr& other) : m_ptr(other.m_ptr) { acquire(); }\n RefPtr(RefPtr&& other)\n noexcept(noexcept(std::declval<RefPtr>().moved(nullptr)))\n : m_ptr(other.m_ptr) { other.m_ptr = nullptr; moved(&other); }\n\n RefPtr& operator=(const RefPtr& other)\n {\n release();\n m_ptr = other.m_ptr;\n acquire();\n return *this;\n }\n RefPtr& operator=(RefPtr&& other)\n {\n release();\n m_ptr = other.m_ptr;\n other.m_ptr = nullptr;\n moved(&other);\n return *this;\n }\n\n T* operator->() const { return m_ptr; }\n T& operator*() const { return *m_ptr; }\n\n T* get() const { return m_ptr; }\n\n explicit operator bool() const { return m_ptr; }\n\n void reset(T* ptr = nullptr)\n {\n if (ptr == m_ptr)\n return;\n release();\n m_ptr = ptr;\n acquire();\n }\n\n friend bool operator==(const RefPtr& lhs, const RefPtr& rhs) { return lhs.m_ptr == rhs.m_ptr; }\n friend bool operator!=(const RefPtr& lhs, const RefPtr& rhs) { return lhs.m_ptr != rhs.m_ptr; }\n\nprivate:\n T* m_ptr = nullptr;\n\n void acquire()\n {\n if (m_ptr)\n inc_ref_count(static_cast<TForOverload*>(m_ptr), this);\n }\n\n void release()\n {\n if (m_ptr)\n dec_ref_count(static_cast<TForOverload*>(m_ptr), this);\n m_ptr = nullptr;\n }\n\n void moved(void* from)\n noexcept(noexcept(ref_ptr_moved(static_cast<TForOverload*>(nullptr), nullptr, nullptr)))\n {\n if (m_ptr)\n ref_ptr_moved(static_cast<TForOverload*>(m_ptr), from, this);\n }\n};\n\n}\n\n#endif \/\/ ref_ptr_hh_INCLUDED\n<commit_msg>Always inline RefPtr::{acquire,release,moved}<commit_after>#ifndef ref_ptr_hh_INCLUDED\n#define ref_ptr_hh_INCLUDED\n\n#include <utility>\n\nnamespace Kakoune\n{\n\nstruct WorstMatch { [[gnu::always_inline]] WorstMatch(...) {} };\n\n[[gnu::always_inline]]\ninline void ref_ptr_moved(WorstMatch, void*, void*) noexcept {}\n\ntemplate<typename T, typename TForOverload = T>\nstruct RefPtr\n{\n RefPtr() = default;\n explicit RefPtr(T* ptr) : m_ptr(ptr) { acquire(); }\n ~RefPtr() { release(); }\n RefPtr(const RefPtr& other) : m_ptr(other.m_ptr) { acquire(); }\n RefPtr(RefPtr&& other)\n noexcept(noexcept(std::declval<RefPtr>().moved(nullptr)))\n : m_ptr(other.m_ptr) { other.m_ptr = nullptr; moved(&other); }\n\n RefPtr& operator=(const RefPtr& other)\n {\n release();\n m_ptr = other.m_ptr;\n acquire();\n return *this;\n }\n RefPtr& operator=(RefPtr&& other)\n {\n release();\n m_ptr = other.m_ptr;\n other.m_ptr = nullptr;\n moved(&other);\n return *this;\n }\n\n T* operator->() const { return m_ptr; }\n T& operator*() const { return *m_ptr; }\n\n T* get() const { return m_ptr; }\n\n explicit operator bool() const { return m_ptr; }\n\n void reset(T* ptr = nullptr)\n {\n if (ptr == m_ptr)\n return;\n release();\n m_ptr = ptr;\n acquire();\n }\n\n friend bool operator==(const RefPtr& lhs, const RefPtr& rhs) { return lhs.m_ptr == rhs.m_ptr; }\n friend bool operator!=(const RefPtr& lhs, const RefPtr& rhs) { return lhs.m_ptr != rhs.m_ptr; }\n\nprivate:\n T* m_ptr = nullptr;\n\n [[gnu::always_inline]]\n void acquire()\n {\n if (m_ptr)\n inc_ref_count(static_cast<TForOverload*>(m_ptr), this);\n }\n\n [[gnu::always_inline]]\n void release()\n {\n if (m_ptr)\n dec_ref_count(static_cast<TForOverload*>(m_ptr), this);\n m_ptr = nullptr;\n }\n\n [[gnu::always_inline]]\n void moved(void* from)\n noexcept(noexcept(ref_ptr_moved(static_cast<TForOverload*>(nullptr), nullptr, nullptr)))\n {\n if (m_ptr)\n ref_ptr_moved(static_cast<TForOverload*>(m_ptr), from, this);\n }\n};\n\n}\n\n#endif \/\/ ref_ptr_hh_INCLUDED\n<|endoftext|>"} {"text":"<commit_before>\/\/=============================================================================================================\n\/**\n* @file test_mne_anonymize.cpp\n* @author Lorenz Esch <lorenzesch@hotmail.com>;\n* @version 1.0\n* @date September, 2019\n*\n* @section LICENSE\n*\n* Copyright (C) 2019, 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 Test for anonymizing a fiff raw file\n*\n*\/\n\n\n\/\/*************************************************************************************************************\n\/\/=============================================================================================================\n\/\/ INCLUDES\n\/\/=============================================================================================================\n\n#include \"..\/applications\/mne_anonymize\/fiffanonymizer.h\"\n#include \"..\/applications\/mne_anonymize\/settingscontroller.h\"\n\n\n\/\/*************************************************************************************************************\n\/\/=============================================================================================================\n\/\/ QT INCLUDES\n\/\/=============================================================================================================\n\n#include <QtTest>\n#include <QProcess>\n#include <QScopedPointer>\n\n\n\/\/*************************************************************************************************************\n\/\/=============================================================================================================\n\/\/ USED NAMESPACES\n\/\/=============================================================================================================\n\nusing namespace FIFFLIB;\nusing namespace MNEANONYMIZE;\n\n\n\/\/=============================================================================================================\n\/**\n* DECLARE CLASS TestMneAnonymize\n*\n* @brief The TestMneAnonymize class provides fiff anonymizing verification tests\n*\n*\/\nclass TestMneAnonymize: public QObject\n{\n Q_OBJECT\n\npublic:\n TestMneAnonymize();\n\nprivate slots:\n void initTestCase();\n void compareData();\n void cleanupTestCase();\n\nprivate:\n double epsilon;\n};\n\n\n\/\/*************************************************************************************************************\n\nTestMneAnonymize::TestMneAnonymize()\n: epsilon(0.000001)\n{\n}\n\n\n\/\/*************************************************************************************************************\n\nvoid TestMneAnonymize::initTestCase()\n{\n \/\/ Init testing arguments\n QString sFileIn(\".\/mne-cpp-test-data\/MEG\/sample\/sample_audvis_raw_short.fif\");\n QString sFileOut(\".\/mne-cpp-test-data\/MEG\/sample\/sample_audvis_raw_short_anonymized.fif\");\n\n qInfo() << \"TestMneAnonymize::initTestCase - sFileIn\" << sFileIn;\n qInfo() << \"TestMneAnonymize::initTestCase - sFileOut\" << sFileOut;\n\n QStringList arguments;\n arguments << \".\/mne_anonymize\";\n arguments << \"--in\" << sFileIn;\n arguments << \"--out\" << sFileOut;\n arguments << \"--verbose\";\n\n qInfo() << \"TestMneAnonymize::initTestCase - arguments\" << arguments;\n\n MNEANONYMIZE::SettingsController controller(arguments, \"MNE Anonymize\", \"1.0\");\n}\n\n\n\/\/*************************************************************************************************************\n\nvoid TestMneAnonymize::compareData()\n{\n \/\/ Open anonymized file\n QFile inFile(\".\/mne-cpp-test-data\/MEG\/sample\/sample_audvis_raw_short_anonymized.fif\");\n\n if(inFile.open(QIODevice::ReadOnly)) {\n qInfo() << \"TestMneAnonymize::compareData - Anonymized file opened correctly \" << inFile.fileName();\n } else {\n QFAIL(\"Anonymized file could not be loaded.\");\n }\n\n \/\/ Create crc checksum and compare to reference\n QByteArray inData(inFile.readAll());\n\n quint16 crc = qChecksum(inData.data(),static_cast<uint>(inData.size()));\n qInfo() << \"TestMneAnonymize::compareData - crc for anonymized file\" << crc;\n\n QVERIFY(17542 == crc);\n}\n\n\n\/\/*************************************************************************************************************\n\nvoid TestMneAnonymize::cleanupTestCase()\n{\n}\n\n\n\/\/*************************************************************************************************************\n\/\/=============================================================================================================\n\/\/ MAIN\n\/\/=============================================================================================================\n\nQTEST_APPLESS_MAIN(TestMneAnonymize)\n#include \"test_mne_anonymize.moc\"\n<commit_msg>test mne_anonymize behaviour<commit_after>\/\/=============================================================================================================\n\/**\n* @file test_mne_anonymize.cpp\n* @author Lorenz Esch <lorenzesch@hotmail.com>;\n* @version 1.0\n* @date September, 2019\n*\n* @section LICENSE\n*\n* Copyright (C) 2019, 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 Test for anonymizing a fiff raw file\n*\n*\/\n\n\n\/\/*************************************************************************************************************\n\/\/=============================================================================================================\n\/\/ INCLUDES\n\/\/=============================================================================================================\n\n#include \"..\/applications\/mne_anonymize\/fiffanonymizer.h\"\n#include \"..\/applications\/mne_anonymize\/settingscontroller.h\"\n\n\n\/\/*************************************************************************************************************\n\/\/=============================================================================================================\n\/\/ QT INCLUDES\n\/\/=============================================================================================================\n\n#include <QtTest>\n#include <QProcess>\n#include <QScopedPointer>\n\n\n\/\/*************************************************************************************************************\n\/\/=============================================================================================================\n\/\/ USED NAMESPACES\n\/\/=============================================================================================================\n\nusing namespace FIFFLIB;\nusing namespace MNEANONYMIZE;\n\n\n\/\/=============================================================================================================\n\/**\n* DECLARE CLASS TestMneAnonymize\n*\n* @brief The TestMneAnonymize class provides fiff anonymizing verification tests\n*\n*\/\nclass TestMneAnonymize: public QObject\n{\n Q_OBJECT\n\npublic:\n TestMneAnonymize();\n\nprivate slots:\n \/\/test app behaviour\n void initTestCase();\n void testDefaultOutput();\n void testDeleteInputFile();\n void testInOutSameName();\n void testInOutSameNameAndDeleteInFile();\n\n \/\/test anonymization\n void testDefaultAnonymizationOfTags();\n\n void compareBirthdayOffsetOption();\n void cleanupTestCase();\n\nprivate:\n double epsilon;\n void searchForTag(FIFFLIB::FiffStream &outStream,\n FIFFLIB::fiff_int_t ThisKind,\n FiffTag::SPtr inTag);\n void verifyCRC(const QString file,\n const quint16 validatedCRC);\n};\n\n\n\/\/*************************************************************************************************************\n\nTestMneAnonymize::TestMneAnonymize()\n: epsilon(0.000001)\n{\n}\n\n\n\/\/*************************************************************************************************************\n\nvoid TestMneAnonymize::initTestCase()\n{\n\n}\n\n\n\/\/*************************************************************************************************************\n\nvoid TestMneAnonymize::testDefaultOutput()\n{\n \/\/ Init testing arguments\n QString sFileIn(\".\/mne-cpp-test-data\/MEG\/sample\/sample_audvis_raw_short.fif\");\n QString sFileOut(\".\/mne-cpp-test-data\/MEG\/sample\/sample_audvis_raw_short_anonymized.fif\");\n\n qInfo() << \"TestMneAnonymize::initTestCase - sFileIn\" << sFileIn;\n\n QStringList arguments;\n arguments << \".\/mne_anonymize\";\n arguments << \"--in\" << sFileIn;\n\n qInfo() << \"TestMneAnonymize::initTestCase - arguments\" << arguments;\n\n MNEANONYMIZE::SettingsController controller(arguments, \"MNE Anonymize - Testing\", \"1.0\");\n\n verifyCRC(sFileOut,17542);\n\n\n}\n\n\/\/*************************************************************************************************************\n\nvoid TestMneAnonymize::testDeleteInputFile()\n{\n \/\/ Init testing arguments\n QString sFileIn(\".\/mne-cpp-test-data\/MEG\/sample\/sample_audvis_raw_short.fif\");\n QString sFileInTest(\".\/mne-cpp-test-data\/MEG\/sample\/testing.fif\");\n QString sFileOutTest(\".\/mne-cpp-test-data\/MEG\/sample\/testing_filename_output.fif\");\n\n qInfo() << \"TestMneAnonymize::testDeleteInputFile - sFileIn\" << sFileIn;\n\n QFile::copy(sFileIn,sFileInTest);\n QVERIFY(QFile::exists(sFileInTest));\n\n QStringList arguments;\n arguments << \".\/mne_anonymize\";\n arguments << \"--in\" << sFileInTest;\n arguments << \"--out\" << sFileOutTest;\n arguments << \"delete_input_file_after\";\n arguments << \"avoid_delete_confirmation\";\n\n qInfo() << \"TestMneAnonymize::initTestCase - arguments\" << arguments;\n\n MNEANONYMIZE::SettingsController controller(arguments, \"MNE Anonymize - Testing\", \"1.0\");\n\n QVERIFY(!QFile::exists(sFileInTest )); \/\/delete input file, remember?\n QVERIFY( QFile::exists(sFileOutTest));\n\n verifyCRC(sFileOutTest,17542);\n}\n\n\n\/\/*************************************************************************************************************\n\nvoid TestMneAnonymize::testInOutSameName()\n{\n \/\/ Init testing arguments\n QString sFileIn(\".\/mne-cpp-test-data\/MEG\/sample\/sample_audvis_raw_short.fif\");\n QString sFileInTest(\".\/mne-cpp-test-data\/MEG\/sample\/testing.fif\");\n QString sFileOutTest(\".\/mne-cpp-test-data\/MEG\/sample\/testing.fif\");\n\n qInfo() << \"TestMneAnonymize::testInOutSameName - sFileIn\" << sFileIn;\n\n QFile::copy(sFileIn,sFileInTest);\n QVERIFY(QFile::exists(sFileInTest));\n\n QStringList arguments;\n arguments << \".\/mne_anonymize\";\n arguments << \"--in\" << sFileInTest;\n arguments << \"--out\" << sFileOutTest;\n\n qInfo() << \"TestMneAnonymize::testInOutSameName - arguments\" << arguments;\n\n MNEANONYMIZE::SettingsController controller(arguments, \"MNE Anonymize - Testing\", \"1.0\");\n\n QVERIFY( QFile::exists(sFileOutTest));\n\n verifyCRC(sFileOutTest,17542);\n}\n\n\n\/\/*************************************************************************************************************\n\nvoid TestMneAnonymize::testInOutSameNameAndDeleteInFile()\n{\n \/\/ Init testing arguments\n QString sFileIn(\".\/mne-cpp-test-data\/MEG\/sample\/sample_audvis_raw_short.fif\");\n QString sFileInTest(\".\/mne-cpp-test-data\/MEG\/sample\/testing.fif\");\n QString sFileOutTest(\".\/mne-cpp-test-data\/MEG\/sample\/testing.fif\");\n\n qInfo() << \"TestMneAnonymize::testInOutSameNameAndDelete - sFileIn\" << sFileIn;\n\n QFile::copy(sFileIn,sFileInTest);\n QVERIFY(QFile::exists(sFileInTest));\n\n QStringList arguments;\n arguments << \".\/mne_anonymize\";\n arguments << \"--in\" << sFileInTest;\n arguments << \"--out\" << sFileOutTest;\n arguments << \"delete_input_file_after\";\n arguments << \"avoid_delete_confirmation\";\n\n qInfo() << \"TestMneAnonymize::testInOutSameNameAndDelete - arguments\" << arguments;\n\n MNEANONYMIZE::SettingsController controller(arguments, \"MNE Anonymize - Testing\", \"1.0\");\n\n QVERIFY( QFile::exists(sFileOutTest));\n\n verifyCRC(sFileOutTest,17542);\n}\n\n\n\/\/*************************************************************************************************************\n\nvoid TestMneAnonymize::testDefaultAnonymizationOfTags()\n{\n QString sFileIn(\".\/mne-cpp-test-data\/MEG\/sample\/sample_audvis_raw_short.fif\");\n QString sFileOut(\".\/mne-cpp-test-data\/MEG\/sample\/sample_audvis_raw_short_anonymized.fif\");\n qInfo() << \"TestMneAnonymize::testDefaultAnonymizationOfTags - sFileIn\" << sFileIn;\n\n QStringList arguments;\n arguments << \".\/mne_anonymize\";\n arguments << \"--in\" << sFileIn;\n\n qInfo() << \"TestMneAnonymize::testDefaultAnonymizationOfTags - arguments\" << arguments;\n\n MNEANONYMIZE::SettingsController controller(arguments, \"MNE Anonymize\", \"1.0\");\n\n QFile fFileIn(sFileIn);\n FIFFLIB::FiffStream inStream(&fFileIn);\n if(inStream.open(QIODevice::ReadOnly))\n {\n qInfo() << \"TestMneAnonymize::testDefaultAnonymizationOfTags - Input file opened correctly \" << sFileIn;\n } else {\n QFAIL(\"Input file could not be loaded.\");\n }\n\n QFile fFileOut(sFileOut);\n FIFFLIB::FiffStream outStream(&fFileOut);\n if(outStream.open(QIODevice::ReadOnly))\n {\n qInfo() << \"TestMneAnonymize::testDefaultAnonymizationOfTags - output file opened correctly \" << sFileIn;\n } else {\n QFAIL(\"Output file could not be loaded.\");\n }\n\n FiffTag::SPtr pTag = FiffTag::SPtr::create();\n searchForTag(inStream,FIFF_FILE_ID,pTag);\n\n\n\n}\n\n\n\/\/*************************************************************************************************************\n\nvoid TestMneAnonymize::compareBirthdayOffsetOption()\n{\n \/\/ Init testing arguments\n QString sFileIn(\".\/mne-cpp-test-data\/MEG\/sample\/sample_audvis_raw_short.fif\");\n QString sFileOut(\".\/mne-cpp-test-data\/MEG\/sample\/sample_audvis_raw_short_anonymized.fif\");\n\n qInfo() << \"TestMneAnonymize::initTestCase - sFileIn\" << sFileIn;\n qInfo() << \"TestMneAnonymize::initTestCase - sFileOut\" << sFileOut;\n\n QStringList arguments;\n arguments << \".\/mne_anonymize\";\n arguments << \"--in\" << sFileIn;\n arguments << \"--verbose\";\n\n qInfo() << \"TestMneAnonymize::initTestCase - arguments\" << arguments;\n\n MNEANONYMIZE::SettingsController controller(arguments, \"MNE Anonymize\", \"1.0\");\n\n}\n\n\n\/\/*************************************************************************************************************\n\nvoid TestMneAnonymize::cleanupTestCase()\n{\n\n}\n\n\n\/\/*************************************************************************************************************\n\nvoid TestMneAnonymize::verifyCRC(const QString file,\n const quint16 validatedCRC)\n{\n QFile fFileIn(file);\n\n if(fFileIn.open(QIODevice::ReadOnly)) {\n qInfo() << \"TestMneAnonymize::verifyCRC - Anonymized file opened correctly \" << fFileIn.fileName();\n } else {\n QFAIL(\"Anonymized file could not be loaded.\");\n }\n\n \/\/ Create crc checksum and compare to reference\n QByteArray inData(fFileIn.readAll());\n fFileIn.close();\n\n quint16 crc = qChecksum(inData.data(),static_cast<uint>(inData.size()));\n qInfo() << \"TestMneAnonymize::compareData - crc expected value: \" << validatedCRC;\n qInfo() << \"TestMneAnonymize::compareData - crc obtained value:\" << crc;\n\n QVERIFY(validatedCRC == crc);\n}\n\n\n\/\/*************************************************************************************************************\n\nvoid TestMneAnonymize::searchForTag(FIFFLIB::FiffStream &stream,\n FIFFLIB::fiff_int_t thisKind,\n FiffTag::SPtr pTag)\n{\n stream.device()->seek(0);\n do\n {\n stream.read_tag(pTag);\n }while(pTag->kind != thisKind);\n}\n\n\n\/\/=============================================================================================================\n\/\/ MAIN\n\/\/=============================================================================================================\n\nQTEST_APPLESS_MAIN(TestMneAnonymize)\n#include \"test_mne_anonymize.moc\"\n\n<|endoftext|>"} {"text":"<commit_before>\/\/===-- ValueObjectChild.cpp ------------------------------------*- C++ -*-===\/\/\n\/\/\n\/\/ The LLVM Compiler Infrastructure\n\/\/\n\/\/ This file is distributed under the University of Illinois Open Source\n\/\/ License. See LICENSE.TXT for details.\n\/\/\n\/\/===----------------------------------------------------------------------===\/\/\n\n#include \"lldb\/Core\/ValueObjectChild.h\"\n\n#include \"lldb\/Core\/Module.h\"\n#include \"lldb\/Core\/ValueObjectList.h\"\n\n#include \"lldb\/Symbol\/CompilerType.h\"\n#include \"lldb\/Symbol\/ObjectFile.h\"\n#include \"lldb\/Symbol\/SymbolContext.h\"\n#include \"lldb\/Symbol\/Type.h\"\n#include \"lldb\/Symbol\/Variable.h\"\n\n#include \"lldb\/Target\/ExecutionContext.h\"\n#include \"lldb\/Target\/Process.h\"\n#include \"lldb\/Target\/Target.h\"\n\nusing namespace lldb_private;\n\nValueObjectChild::ValueObjectChild\n(\n ValueObject &parent,\n const CompilerType &compiler_type,\n const ConstString &name,\n uint64_t byte_size,\n int32_t byte_offset,\n uint32_t bitfield_bit_size,\n uint32_t bitfield_bit_offset,\n bool is_base_class,\n bool is_deref_of_parent,\n AddressType child_ptr_or_ref_addr_type,\n uint64_t language_flags\n) :\n ValueObject (parent),\n m_compiler_type (compiler_type),\n m_byte_size (byte_size),\n m_byte_offset (byte_offset),\n m_bitfield_bit_size (bitfield_bit_size),\n m_bitfield_bit_offset (bitfield_bit_offset),\n m_is_base_class (is_base_class),\n m_is_deref_of_parent (is_deref_of_parent),\n m_can_update_with_invalid_exe_ctx()\n{\n m_name = name;\n SetAddressTypeOfChildren(child_ptr_or_ref_addr_type);\n SetLanguageFlags(language_flags);\n}\n\nValueObjectChild::~ValueObjectChild()\n{\n}\n\nlldb::ValueType\nValueObjectChild::GetValueType() const\n{\n return m_parent->GetValueType();\n}\n\nsize_t\nValueObjectChild::CalculateNumChildren(uint32_t max)\n{\n auto children_count = GetCompilerType().GetNumChildren (true);\n return children_count <= max ? children_count : max;\n}\n\nstatic void\nAdjustForBitfieldness(ConstString& name,\n uint8_t bitfield_bit_size)\n{\n if (name && bitfield_bit_size)\n {\n const char *compiler_type_name = name.AsCString();\n if (compiler_type_name)\n {\n std::vector<char> bitfield_type_name (strlen(compiler_type_name) + 32, 0);\n ::snprintf (&bitfield_type_name.front(), bitfield_type_name.size(), \"%s:%u\", compiler_type_name, bitfield_bit_size);\n name.SetCString(&bitfield_type_name.front());\n }\n }\n}\n\nConstString\nValueObjectChild::GetTypeName()\n{\n if (m_type_name.IsEmpty())\n {\n m_type_name = GetCompilerType().GetConstTypeName ();\n AdjustForBitfieldness(m_type_name, m_bitfield_bit_size);\n }\n return m_type_name;\n}\n\nConstString\nValueObjectChild::GetQualifiedTypeName()\n{\n ConstString qualified_name = GetCompilerType().GetConstTypeName();\n AdjustForBitfieldness(qualified_name, m_bitfield_bit_size);\n return qualified_name;\n}\n\nConstString\nValueObjectChild::GetDisplayTypeName()\n{\n ConstString display_name = GetCompilerType().GetDisplayTypeName();\n AdjustForBitfieldness(display_name, m_bitfield_bit_size);\n return display_name;\n}\n\nLazyBool\nValueObjectChild::CanUpdateWithInvalidExecutionContext ()\n{\n if (m_can_update_with_invalid_exe_ctx.hasValue())\n return m_can_update_with_invalid_exe_ctx.getValue();\n if (m_parent)\n {\n ValueObject *opinionated_parent = m_parent->FollowParentChain([] (ValueObject* valobj) -> bool {\n return (valobj->CanUpdateWithInvalidExecutionContext() == eLazyBoolCalculate);\n });\n if (opinionated_parent)\n return (m_can_update_with_invalid_exe_ctx = opinionated_parent->CanUpdateWithInvalidExecutionContext()).getValue();\n }\n return (m_can_update_with_invalid_exe_ctx = this->ValueObject::CanUpdateWithInvalidExecutionContext()).getValue();\n}\n\nbool\nValueObjectChild::UpdateValue ()\n{\n m_error.Clear();\n SetValueIsValid (false);\n ValueObject* parent = m_parent;\n if (parent)\n {\n if (parent->UpdateValueIfNeeded(false))\n {\n m_value.SetCompilerType(GetCompilerType());\n\n \/\/ Copy the parent scalar value and the scalar value type\n m_value.GetScalar() = parent->GetValue().GetScalar();\n Value::ValueType value_type = parent->GetValue().GetValueType();\n m_value.SetValueType (value_type);\n\n if (parent->GetCompilerType().ShouldTreatScalarValueAsAddress())\n {\n lldb::addr_t addr = parent->GetPointerValue ();\n m_value.GetScalar() = addr;\n\n if (addr == LLDB_INVALID_ADDRESS)\n {\n m_error.SetErrorString (\"parent address is invalid.\");\n }\n else if (addr == 0)\n {\n m_error.SetErrorString (\"parent is NULL\");\n }\n else\n {\n m_value.GetScalar() += m_byte_offset;\n AddressType addr_type = parent->GetAddressTypeOfChildren();\n \n switch (addr_type)\n {\n case eAddressTypeFile:\n {\n lldb::ProcessSP process_sp (GetProcessSP());\n if (process_sp && process_sp->IsAlive() == true)\n m_value.SetValueType (Value::eValueTypeLoadAddress);\n else\n m_value.SetValueType(Value::eValueTypeFileAddress);\n }\n break;\n case eAddressTypeLoad:\n m_value.SetValueType (Value::eValueTypeLoadAddress);\n break;\n case eAddressTypeHost:\n m_value.SetValueType(Value::eValueTypeHostAddress);\n break;\n case eAddressTypeInvalid:\n \/\/ TODO: does this make sense?\n m_value.SetValueType(Value::eValueTypeScalar);\n break;\n }\n }\n }\n else\n {\n switch (value_type)\n {\n case Value::eValueTypeLoadAddress:\n case Value::eValueTypeFileAddress:\n case Value::eValueTypeHostAddress:\n {\n lldb::addr_t addr = m_value.GetScalar().ULongLong(LLDB_INVALID_ADDRESS);\n if (addr == LLDB_INVALID_ADDRESS)\n {\n m_error.SetErrorString (\"parent address is invalid.\");\n }\n else if (addr == 0)\n {\n m_error.SetErrorString (\"parent is NULL\");\n }\n else\n {\n \/\/ Set this object's scalar value to the address of its\n \/\/ value by adding its byte offset to the parent address\n m_value.GetScalar() += GetByteOffset();\n }\n }\n break;\n\n case Value::eValueTypeScalar:\n \/\/ TODO: What if this is a register value? Do we try and\n \/\/ extract the child value from within the parent data?\n \/\/ Probably...\n default:\n m_error.SetErrorString (\"parent has invalid value.\");\n break;\n }\n }\n\n if (m_error.Success())\n {\n const bool thread_and_frame_only_if_stopped = true;\n ExecutionContext exe_ctx (GetExecutionContextRef().Lock(thread_and_frame_only_if_stopped));\n if (GetCompilerType().GetTypeInfo() & lldb::eTypeHasValue)\n m_error = m_value.GetValueAsData (&exe_ctx, m_data, 0, GetModule().get());\n else\n m_error.Clear(); \/\/ No value so nothing to read...\n }\n }\n else\n {\n m_error.SetErrorStringWithFormat(\"parent failed to evaluate: %s\", parent->GetError().AsCString());\n }\n }\n else\n {\n m_error.SetErrorString(\"ValueObjectChild has a NULL parent ValueObject.\");\n }\n \n return m_error.Success();\n}\n\n\nbool\nValueObjectChild::IsInScope ()\n{\n ValueObject* root(GetRoot());\n if (root)\n return root->IsInScope ();\n return false;\n}\n<commit_msg>More rework of the updating logic for ValueObjectChild. Still just refactoring with no feature change<commit_after>\/\/===-- ValueObjectChild.cpp ------------------------------------*- C++ -*-===\/\/\n\/\/\n\/\/ The LLVM Compiler Infrastructure\n\/\/\n\/\/ This file is distributed under the University of Illinois Open Source\n\/\/ License. See LICENSE.TXT for details.\n\/\/\n\/\/===----------------------------------------------------------------------===\/\/\n\n#include \"lldb\/Core\/ValueObjectChild.h\"\n\n#include \"lldb\/Core\/Module.h\"\n#include \"lldb\/Core\/ValueObjectList.h\"\n\n#include \"lldb\/Symbol\/CompilerType.h\"\n#include \"lldb\/Symbol\/ObjectFile.h\"\n#include \"lldb\/Symbol\/SymbolContext.h\"\n#include \"lldb\/Symbol\/Type.h\"\n#include \"lldb\/Symbol\/Variable.h\"\n\n#include \"lldb\/Target\/ExecutionContext.h\"\n#include \"lldb\/Target\/Process.h\"\n#include \"lldb\/Target\/Target.h\"\n\nusing namespace lldb_private;\n\nValueObjectChild::ValueObjectChild\n(\n ValueObject &parent,\n const CompilerType &compiler_type,\n const ConstString &name,\n uint64_t byte_size,\n int32_t byte_offset,\n uint32_t bitfield_bit_size,\n uint32_t bitfield_bit_offset,\n bool is_base_class,\n bool is_deref_of_parent,\n AddressType child_ptr_or_ref_addr_type,\n uint64_t language_flags\n) :\n ValueObject (parent),\n m_compiler_type (compiler_type),\n m_byte_size (byte_size),\n m_byte_offset (byte_offset),\n m_bitfield_bit_size (bitfield_bit_size),\n m_bitfield_bit_offset (bitfield_bit_offset),\n m_is_base_class (is_base_class),\n m_is_deref_of_parent (is_deref_of_parent),\n m_can_update_with_invalid_exe_ctx()\n{\n m_name = name;\n SetAddressTypeOfChildren(child_ptr_or_ref_addr_type);\n SetLanguageFlags(language_flags);\n}\n\nValueObjectChild::~ValueObjectChild()\n{\n}\n\nlldb::ValueType\nValueObjectChild::GetValueType() const\n{\n return m_parent->GetValueType();\n}\n\nsize_t\nValueObjectChild::CalculateNumChildren(uint32_t max)\n{\n auto children_count = GetCompilerType().GetNumChildren (true);\n return children_count <= max ? children_count : max;\n}\n\nstatic void\nAdjustForBitfieldness(ConstString& name,\n uint8_t bitfield_bit_size)\n{\n if (name && bitfield_bit_size)\n {\n const char *compiler_type_name = name.AsCString();\n if (compiler_type_name)\n {\n std::vector<char> bitfield_type_name (strlen(compiler_type_name) + 32, 0);\n ::snprintf (&bitfield_type_name.front(), bitfield_type_name.size(), \"%s:%u\", compiler_type_name, bitfield_bit_size);\n name.SetCString(&bitfield_type_name.front());\n }\n }\n}\n\nConstString\nValueObjectChild::GetTypeName()\n{\n if (m_type_name.IsEmpty())\n {\n m_type_name = GetCompilerType().GetConstTypeName ();\n AdjustForBitfieldness(m_type_name, m_bitfield_bit_size);\n }\n return m_type_name;\n}\n\nConstString\nValueObjectChild::GetQualifiedTypeName()\n{\n ConstString qualified_name = GetCompilerType().GetConstTypeName();\n AdjustForBitfieldness(qualified_name, m_bitfield_bit_size);\n return qualified_name;\n}\n\nConstString\nValueObjectChild::GetDisplayTypeName()\n{\n ConstString display_name = GetCompilerType().GetDisplayTypeName();\n AdjustForBitfieldness(display_name, m_bitfield_bit_size);\n return display_name;\n}\n\nLazyBool\nValueObjectChild::CanUpdateWithInvalidExecutionContext ()\n{\n if (m_can_update_with_invalid_exe_ctx.hasValue())\n return m_can_update_with_invalid_exe_ctx.getValue();\n if (m_parent)\n {\n ValueObject *opinionated_parent = m_parent->FollowParentChain([] (ValueObject* valobj) -> bool {\n return (valobj->CanUpdateWithInvalidExecutionContext() == eLazyBoolCalculate);\n });\n if (opinionated_parent)\n return (m_can_update_with_invalid_exe_ctx = opinionated_parent->CanUpdateWithInvalidExecutionContext()).getValue();\n }\n return (m_can_update_with_invalid_exe_ctx = this->ValueObject::CanUpdateWithInvalidExecutionContext()).getValue();\n}\n\nbool\nValueObjectChild::UpdateValue ()\n{\n m_error.Clear();\n SetValueIsValid (false);\n ValueObject* parent = m_parent;\n if (parent)\n {\n if (parent->UpdateValueIfNeeded(false))\n {\n m_value.SetCompilerType(GetCompilerType());\n \n CompilerType parent_type(parent->GetCompilerType());\n \/\/ Copy the parent scalar value and the scalar value type\n m_value.GetScalar() = parent->GetValue().GetScalar();\n Value::ValueType value_type = parent->GetValue().GetValueType();\n m_value.SetValueType (value_type);\n \n Flags parent_type_flags(parent_type.GetTypeInfo());\n const bool is_instance_ptr_base = ((m_is_base_class == true) && (parent_type_flags.AnySet(lldb::eTypeInstanceIsPointer)));\n\n if (parent->GetCompilerType().ShouldTreatScalarValueAsAddress())\n {\n lldb::addr_t addr = parent->GetPointerValue ();\n m_value.GetScalar() = addr;\n \n if (addr == LLDB_INVALID_ADDRESS)\n {\n m_error.SetErrorString (\"parent address is invalid.\");\n }\n else if (addr == 0)\n {\n m_error.SetErrorString (\"parent is NULL\");\n }\n else\n {\n m_value.GetScalar() += m_byte_offset;\n AddressType addr_type = parent->GetAddressTypeOfChildren();\n \n switch (addr_type)\n {\n case eAddressTypeFile:\n {\n lldb::ProcessSP process_sp (GetProcessSP());\n if (process_sp && process_sp->IsAlive() == true)\n m_value.SetValueType (Value::eValueTypeLoadAddress);\n else\n m_value.SetValueType(Value::eValueTypeFileAddress);\n }\n break;\n case eAddressTypeLoad:\n m_value.SetValueType (is_instance_ptr_base ? Value::eValueTypeScalar: Value::eValueTypeLoadAddress);\n break;\n case eAddressTypeHost:\n m_value.SetValueType(Value::eValueTypeHostAddress);\n break;\n case eAddressTypeInvalid:\n \/\/ TODO: does this make sense?\n m_value.SetValueType(Value::eValueTypeScalar);\n break;\n }\n }\n }\n else\n {\n switch (value_type)\n {\n case Value::eValueTypeLoadAddress:\n case Value::eValueTypeFileAddress:\n case Value::eValueTypeHostAddress:\n {\n lldb::addr_t addr = m_value.GetScalar().ULongLong(LLDB_INVALID_ADDRESS);\n if (addr == LLDB_INVALID_ADDRESS)\n {\n m_error.SetErrorString (\"parent address is invalid.\");\n }\n else if (addr == 0)\n {\n m_error.SetErrorString (\"parent is NULL\");\n }\n else\n {\n \/\/ Set this object's scalar value to the address of its\n \/\/ value by adding its byte offset to the parent address\n m_value.GetScalar() += GetByteOffset();\n }\n }\n break;\n \n case Value::eValueTypeScalar:\n \/\/ try to extract the child value from the parent's scalar value\n {\n Scalar scalar(m_value.GetScalar());\n if (m_bitfield_bit_size)\n scalar.ExtractBitfield(m_bitfield_bit_size, m_bitfield_bit_offset);\n else\n scalar.ExtractBitfield(8*m_byte_size, 8*m_byte_offset);\n m_value.GetScalar() = scalar;\n }\n break;\n default:\n m_error.SetErrorString (\"parent has invalid value.\");\n break;\n }\n }\n \n if (m_error.Success())\n {\n const bool thread_and_frame_only_if_stopped = true;\n ExecutionContext exe_ctx (GetExecutionContextRef().Lock(thread_and_frame_only_if_stopped));\n if (GetCompilerType().GetTypeInfo() & lldb::eTypeHasValue)\n {\n if (!is_instance_ptr_base)\n m_error = m_value.GetValueAsData (&exe_ctx, m_data, 0, GetModule().get());\n else\n m_error = m_parent->GetValue().GetValueAsData (&exe_ctx, m_data, 0, GetModule().get());\n }\n else\n {\n m_error.Clear(); \/\/ No value so nothing to read...\n }\n }\n \n }\n else\n {\n m_error.SetErrorStringWithFormat(\"parent failed to evaluate: %s\", parent->GetError().AsCString());\n }\n }\n else\n {\n m_error.SetErrorString(\"ValueObjectChild has a NULL parent ValueObject.\");\n }\n \n return m_error.Success();\n}\n\n\nbool\nValueObjectChild::IsInScope ()\n{\n ValueObject* root(GetRoot());\n if (root)\n return root->IsInScope ();\n return false;\n}\n<|endoftext|>"} {"text":"<commit_before>\/\/ Copyright (c) 2006-2008 The Chromium Authors. All rights reserved.\n\/\/ Use of this source code is governed by a BSD-style license that can be\n\/\/ found in the LICENSE file.\n\n#include \"config.h\"\n\n#include <objidl.h>\n\n#pragma warning(push, 0)\n#include \"ClipboardWin.h\"\n#include \"COMPtr.h\"\n#include \"DragData.h\"\n#include \"Frame.h\"\n#include \"HitTestResult.h\"\n#include \"Image.h\"\n#include \"KURL.h\"\n#pragma warning(pop)\n#undef LOG\n\n#include \"webkit\/glue\/dragclient_impl.h\"\n\n#include \"base\/logging.h\"\n#include \"base\/string_util.h\"\n#include \"webkit\/glue\/context_node_types.h\"\n#include \"webkit\/glue\/glue_util.h\"\n#include \"webkit\/glue\/webdropdata.h\"\n#include \"webkit\/glue\/webview_delegate.h\"\n#include \"webkit\/glue\/webview_impl.h\"\n\nvoid DragClientImpl::willPerformDragDestinationAction(\n WebCore::DragDestinationAction,\n WebCore::DragData*) {\n \/\/ FIXME\n}\n\nvoid DragClientImpl::willPerformDragSourceAction(\n WebCore::DragSourceAction,\n const WebCore::IntPoint&,\n WebCore::Clipboard*) {\n \/\/ FIXME\n}\n\nWebCore::DragDestinationAction DragClientImpl::actionMaskForDrag(\n WebCore::DragData*) {\n return WebCore::DragDestinationActionAny; \n}\n\nWebCore::DragSourceAction DragClientImpl::dragSourceActionMaskForPoint(\n const WebCore::IntPoint& window_point) {\n \/\/ We want to handle drag operations for all source types.\n return WebCore::DragSourceActionAny;\n}\n\nvoid DragClientImpl::startDrag(WebCore::DragImageRef drag_image,\n const WebCore::IntPoint& drag_image_origin,\n const WebCore::IntPoint& event_pos,\n WebCore::Clipboard* clipboard,\n WebCore::Frame* frame,\n bool is_link_drag) {\n \/\/ Add a ref to the frame just in case a load occurs mid-drag.\n RefPtr<WebCore::Frame> frame_protector = frame;\n\n COMPtr<IDataObject> data_object(\n static_cast<WebCore::ClipboardWin*>(clipboard)->dataObject());\n DCHECK(data_object.get());\n WebDropData drop_data;\n WebDropData::PopulateWebDropData(data_object.get(), &drop_data);\n\n webview_->StartDragging(drop_data);\n}\n\nWebCore::DragImageRef DragClientImpl::createDragImageForLink(\n WebCore::KURL&,\n const WebCore::String& label,\n WebCore::Frame*) {\n \/\/ FIXME\n return 0;\n}\n\nvoid DragClientImpl::dragControllerDestroyed() {\n delete this;\n}\n\n<commit_msg>ifdef around windows code Review URL: http:\/\/codereview.chromium.org\/249<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 \"build\/build_config.h\"\n\n#if defined(OS_WIN)\n#include <objidl.h>\n#endif\n\n#pragma warning(push, 0)\n#if defined(OS_WIN)\n#include \"ClipboardWin.h\"\n#include \"COMPtr.h\"\n#endif\n#include \"DragData.h\"\n#include \"Frame.h\"\n#include \"HitTestResult.h\"\n#include \"Image.h\"\n#include \"KURL.h\"\n#pragma warning(pop)\n#undef LOG\n\n#include \"webkit\/glue\/dragclient_impl.h\"\n\n#include \"base\/logging.h\"\n#include \"base\/string_util.h\"\n#include \"webkit\/glue\/context_node_types.h\"\n#include \"webkit\/glue\/glue_util.h\"\n#include \"webkit\/glue\/webdropdata.h\"\n#include \"webkit\/glue\/webview_delegate.h\"\n#include \"webkit\/glue\/webview_impl.h\"\n\nvoid DragClientImpl::willPerformDragDestinationAction(\n WebCore::DragDestinationAction,\n WebCore::DragData*) {\n \/\/ FIXME\n}\n\nvoid DragClientImpl::willPerformDragSourceAction(\n WebCore::DragSourceAction,\n const WebCore::IntPoint&,\n WebCore::Clipboard*) {\n \/\/ FIXME\n}\n\nWebCore::DragDestinationAction DragClientImpl::actionMaskForDrag(\n WebCore::DragData*) {\n return WebCore::DragDestinationActionAny; \n}\n\nWebCore::DragSourceAction DragClientImpl::dragSourceActionMaskForPoint(\n const WebCore::IntPoint& window_point) {\n \/\/ We want to handle drag operations for all source types.\n return WebCore::DragSourceActionAny;\n}\n\nvoid DragClientImpl::startDrag(WebCore::DragImageRef drag_image,\n const WebCore::IntPoint& drag_image_origin,\n const WebCore::IntPoint& event_pos,\n WebCore::Clipboard* clipboard,\n WebCore::Frame* frame,\n bool is_link_drag) {\n \/\/ Add a ref to the frame just in case a load occurs mid-drag.\n RefPtr<WebCore::Frame> frame_protector = frame;\n\n#if defined(OS_WIN)\n COMPtr<IDataObject> data_object(\n static_cast<WebCore::ClipboardWin*>(clipboard)->dataObject());\n DCHECK(data_object.get());\n WebDropData::PopulateWebDropData(data_object.get(), &drop_data);\n#elif defined(OS_MACOSX) || defined(OS_LINUX)\n WebDropData drop_data;\n#endif\n\n webview_->StartDragging(drop_data);\n}\n\nWebCore::DragImageRef DragClientImpl::createDragImageForLink(\n WebCore::KURL&,\n const WebCore::String& label,\n WebCore::Frame*) {\n \/\/ FIXME\n return 0;\n}\n\nvoid DragClientImpl::dragControllerDestroyed() {\n delete this;\n}\n\n<|endoftext|>"} {"text":"<commit_before>\/\/ $Id: LineBasedFile_test.C,v 1.9 2000\/10\/19 20:04:04 amoll Exp $\n#include <BALL\/CONCEPT\/classTest.h>\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n#include <BALL\/FORMAT\/lineBasedFile.h>\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nSTART_TEST(class_name, \"$Id: LineBasedFile_test.C,v 1.9 2000\/10\/19 20:04:04 amoll Exp $\")\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nusing namespace BALL;\n\n\nCHECK(BALL_CREATE(LineBasedFile))\n \/\/BAUSTELLE\nRESULT\n\nLineBasedFile* fl;\n\nCHECK(LineBasedFile() throw())\n\tfl = new LineBasedFile;\n\tTEST_NOT_EQUAL(fl, 0)\nRESULT\n\nCHECK(~LineBasedFile() throw())\n\tdelete fl;\nRESULT\n\nCHECK(LineBasedFile(const String& filename, File::OpenMode open_mode = File::IN)\n\t\t\tthrow(Exception::FileNotFound))\n\tLineBasedFile f1(\"data\/LineBasedFile_test.txt\");\n\tTEST_EQUAL(f1.getLineNumber(), 0)\n\tTEST_EQUAL(f1.getLine(), \"\")\n\tf1.readLine();\n\tTEST_EQUAL(f1.getLineNumber(), 1)\n\tTEST_EQUAL(f1.getLine(), \"line1\")\n\n\tTEST_EXCEPTION(Exception::FileNotFound, LineBasedFile f2(\"XXXXXXXX.txt\"))\nRESULT\n\nLineBasedFile fx;\n\nCHECK(LineBasedFile(const LineBasedFile& f) throw())\n\tLineBasedFile f1(\"data\/LineBasedFile_test.txt\");\n\tTEST_EQUAL(f1.readLine(), true)\n\tTEST_EQUAL(f1.getLine(), \"line1\")\n\tf1.close();\n\n\tLineBasedFile f2(f1);\n\tTEST_EQUAL(f2.getLineNumber(), 1)\n\tTEST_EQUAL(f2.getLine(), \"line1\")\n\tTEST_EQUAL(f2.readLine(), true)\n\tTEST_EQUAL(f2.getLine(), \"\/0\/ \/1\/ \/2 2\/\/3\/\")\n\n\tLineBasedFile f3;\n\tLineBasedFile f4(f3);\nRESULT\n\nCHECK(LineBasedFile& operator = (const LineBasedFile& file) throw())\n\tLineBasedFile f1(\"data\/LineBasedFile_test.txt\");\n\tf1.readLine();\n\tTEST_EQUAL(f1.getLine(), \"line1\")\n\n\tLineBasedFile f2;\n\tf2 = f1;\n\tTEST_EQUAL(f2.getLineNumber(), 1)\n\tTEST_EQUAL(f2.getLine(), \"line1\")\nRESULT\n\nCHECK(clear() throw())\n\tLineBasedFile f1(\"data\/LineBasedFile_test.txt\");\n\tf1.readLine();\n\tf1.clear();\n\tTEST_EQUAL(f1.getLineNumber(), 0)\n\tTEST_EQUAL(f1.getLine(), \"\")\n\n\tfx.clear();\nRESULT\n\nCHECK(getLineNumber() const throw())\n\tLineBasedFile f1(\"data\/LineBasedFile_test.txt\");\n\tTEST_EQUAL(f1.getLineNumber(), 0)\n\tf1.readLine();\n\tTEST_EQUAL(f1.getLineNumber(), 1)\n\n\tTEST_EQUAL(fx.getLineNumber(), 0)\nRESULT\n\nLineBasedFile f1(\"data\/LineBasedFile_test.txt\");\n\nCHECK(getLine() const throw())\n\tTEST_EQUAL(f1.getLine(), \"\")\n\tf1.readLine();\n\tTEST_EQUAL(f1.getLine(), \"line1\")\n\n\tTEST_EQUAL(fx.getLine(), \"\")\nRESULT\n\nCHECK(getField(Position pos = 0, const String& quotes = \"\", \n\t\t\tconst String& delimiters = String::CHARACTER_CLASS__WHITESPACE) \n\t\t\tconst throw(Exception::IndexUnderflow))\n\n\tTEST_EQUAL(f1.getField(), \"line1\")\n\tTEST_EQUAL(f1.getField(1), \"\")\n\tTEST_EXCEPTION(Exception::IndexUnderflow, f1.getField(-99))\n\tf1.readLine();\n\tTEST_EQUAL(f1.getField(), \"\/0\/\")\n\tTEST_EQUAL(f1.getField(1), \"\/1\/\")\n\tTEST_EQUAL(f1.getField(2), \"\/2\")\n\tTEST_EQUAL(f1.getField(0, \"\/\"), \"0\")\n\tTEST_EQUAL(f1.getField(1, \"\/\"), \"1\")\n\tTEST_EQUAL(f1.getField(2, \"\/\"), \"2 23\")\n\tTEST_EQUAL(f1.getField(3, \"\/\"), \"\")\n\n\tTEST_EQUAL(fx.getField(), \"\")\nRESULT\n\nCHECK(startsWith(const String& text) const throw())\n\tTEST_EQUAL(f1.startsWith(\"\/0\/\"), true)\n\tTEST_EQUAL(f1.startsWith(\"\/0\/ \/1\/ \/2 2\/\/3\/\"), true)\n\tTEST_EQUAL(f1.startsWith(\"\/0\/ \/1\/ \/2 2\/\/3\/X\"), false)\n\n\tTEST_EQUAL(fx.startsWith(\"\"), true)\nRESULT\n\nCHECK(has(const String& text) const throw())\n\tTEST_EQUAL(f1.has(\"\/0\/\"), true)\n\tTEST_EQUAL(f1.has(\"\/\"), true)\n\tTEST_EQUAL(f1.has(\"\/1\/\"), true)\n\tTEST_EQUAL(f1.has(\"\/3\/\"), true)\n\tTEST_EQUAL(f1.has(\"X\"), false)\n\n\tTEST_EQUAL(fx.has(\"X\"), false)\n\tTEST_EQUAL(fx.has(\"\"), true)\nRESULT\n\nCHECK(search(const String& text, bool return_to_point) throw())\n\tTEST_EQUAL(f1.search(\"line3\"), true)\n\tTEST_EQUAL(f1.search(\"line4-\"), true)\n\tTEST_EQUAL(f1.search(\"line4-\"), false)\n\tTEST_EQUAL(f1.getLine(), \"line7-\")\n f1.rewind();\n\n\tf1.skipLines(2);\n\tTEST_EQUAL(f1.getLine(), \"line3-\")\n\tTEST_EQUAL(f1.search(\"XXX\", true), false)\n\tTEST_EQUAL(f1.getLine(), \"line3-\")\n\n f1.rewind();\n\tTEST_EQUAL(f1.search(\"#\"), true)\n\tTEST_EQUAL(f1.getLine(), \"###########\")\n\n\tTEST_EXCEPTION(LineBasedFile::LineBasedFileError, fx.search(\"line4-\"))\nRESULT\n\nCHECK(search(const String& text, const String& stop, bool return_to_point) throw())\n f1.rewind();\n\tTEST_EQUAL(f1.search(\"line3\", \"line4\", true), true)\n\tTEST_EQUAL(f1.getLine(), \"line3-\")\n\tTEST_EQUAL(f1.getLineNumber(), 3)\n\n f1.rewind();\n\tTEST_EQUAL(f1.search(\"line4\", \"line3\", false), false)\n\tTEST_EQUAL(f1.getLine(), \"line3-\")\n\tTEST_EQUAL(f1.getLineNumber(), 3)\n\n f1.rewind();\n\tTEST_EQUAL(f1.search(\"\/\", \"l\", false), false)\n\tTEST_EQUAL(f1.getLine(), \"line1\")\n\tTEST_EQUAL(f1.getLineNumber(), 1)\n\n f1.rewind();\n\tf1.readLine();\n\tf1.readLine();\n\tTEST_EQUAL(f1.getLine(), \"\/0\/ \/1\/ \/2 2\/\/3\/\")\n\tbool erg = f1.search(\"line4\", \"line3\", true);\n\tTEST_EQUAL(erg, false)\n\tTEST_EQUAL(f1.getLine(), \"\/0\/ \/1\/ \/2 2\/\/3\/\")\n\tTEST_EQUAL(f1.getLineNumber(), 2)\n\n f1.rewind();\n\tf1.skipLines(2);\n\tTEST_EQUAL(f1.getLine(), \"line3-\")\n\tTEST_EQUAL(f1.search(\"XXX\", \"ZZZZZ\", true), false)\n\tTEST_EQUAL(f1.getLine(), \"line3-\")\n\n f1.rewind();\n\terg = f1.search(\"#\", \"l\", false);\n\tTEST_EQUAL(erg, false)\n\tTEST_EQUAL(f1.getLine(), \"line1\")\n\n f1.rewind();\n\terg = f1.search(\"#\", \"l\", true);\n\tTEST_EQUAL(erg, false)\n\tTEST_EQUAL(f1.getLineNumber(), 0)\n\n f1.rewind();\n\terg = f1.search(\"line7\", \"#\", false);\n\tTEST_EQUAL(erg, false)\n\tTEST_EQUAL(f1.getLine(), \"###########\")\n\n\n\tTEST_EXCEPTION(LineBasedFile::LineBasedFileError, fx.search(\"line4\", \"line3\"))\nRESULT\n\nCHECK(switchString(const std::vector<String>& data) const throw())\n f1.rewind();\n\tf1.readLine();\n\n\tvector<String> vec;\n\tvec.push_back(\"line\");\n\tvec.push_back(\"line1\");\n\tvec.push_back(\"line2\");\n\tvec.push_back(\"\");\n\n\tTEST_EQUAL(f1.switchString(vec), 1)\n\tf1.readLine();\n\tTEST_EQUAL(f1.switchString(vec), -1)\n\n\tTEST_EQUAL(fx.switchString(vec), 3)\nRESULT\n\nCHECK(test(const char* file, int line, bool condition, const String& msg)\n\t\t\tconst throw(LineBasedFileError))\n\tf1.test(__FILE__, __LINE__, true, \"test\");\n\tTEST_EXCEPTION(LineBasedFile::LineBasedFileError, f1.test(__FILE__, __LINE__, false, \"test\") )\n\tfx.test(__FILE__, __LINE__, true, \"test\");\nRESULT\n\nCHECK(readLine() throw(LineBasedFileError))\n f1.rewind();\n\tf1.readLine();\n\n\tTEST_EQUAL(f1.getLine(), \"line1\")\n\n\tTEST_EXCEPTION(LineBasedFile::LineBasedFileError, fx.readLine())\n\tTEST_EQUAL(fx.getLine(), \"\")\nRESULT\n\nCHECK(skipLines(Size number = 1) throw(Exception::IndexUnderflow, LineBasedFileError))\n f1.rewind();\n\tTEST_EQUAL(f1.skipLines(2), true)\n\tTEST_EQUAL(f1.getLine(), \"line3-\")\n\tTEST_EQUAL(f1.getLineNumber(), 3)\n\tTEST_EQUAL(f1.skipLines(5), false)\n\n\tTEST_EXCEPTION(LineBasedFile::LineBasedFileError, fx.skipLines(2))\n\tTEST_EQUAL(fx.getLine(), \"\")\n\tTEST_EQUAL(fx.getLineNumber(), 0)\nRESULT\n\nCHECK(rewind() throw(LineBasedFileError))\n f1.rewind();\n\tTEST_EQUAL(f1.getLine(), \"\")\n\tTEST_EQUAL(f1.getLineNumber(), 0)\n\n TEST_EXCEPTION(LineBasedFile::LineBasedFileError,fx.rewind())\n\tTEST_EQUAL(fx.getLine(), \"\")\n\tTEST_EQUAL(fx.getLineNumber(), 0)\nRESULT\n\nCHECK(goToLine(Position line_number) throw(LineBasedFileError))\n f1.rewind();\n\tf1.skipLines(4);\n\tTEST_EQUAL(f1.goToLine(3), true)\n\tTEST_EQUAL(f1.getLine(), \"line3-\" )\n\tTEST_EQUAL(f1.getLineNumber(), 3)\n\n\tTEST_EQUAL(f1.goToLine(5), true)\n\tTEST_EQUAL(f1.getLine(), \"line5-\" )\n\tTEST_EQUAL(f1.getLineNumber(), 5)\n\n\tTEST_EQUAL(f1.goToLine(8), false)\n\tTEST_EQUAL(f1.getLine(), \"line7-\" )\n\tTEST_EQUAL(f1.getLineNumber(), 7)\n\n TEST_EXCEPTION(LineBasedFile::LineBasedFileError,fx.goToLine(2))\n\tTEST_EQUAL(fx.getLine(), \"\")\n\tTEST_EQUAL(fx.getLineNumber(), 0)\nRESULT\n\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nEND_TEST\n<commit_msg>added: test for BALL_CREATE<commit_after>\/\/ $Id: LineBasedFile_test.C,v 1.10 2001\/02\/10 19:07:52 amoll Exp $\r\n#include <BALL\/CONCEPT\/classTest.h>\r\n\r\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\r\n#include <BALL\/FORMAT\/lineBasedFile.h>\r\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\r\n\r\nSTART_TEST(class_name, \"$Id: LineBasedFile_test.C,v 1.10 2001\/02\/10 19:07:52 amoll Exp $\")\r\n\r\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\r\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\r\n\r\nusing namespace BALL;\r\n\r\n\r\nLineBasedFile* fl;\r\n\r\nCHECK(LineBasedFile() throw())\r\n\tfl = new LineBasedFile;\r\n\tTEST_NOT_EQUAL(fl, 0)\r\nRESULT\r\n\r\nCHECK(~LineBasedFile() throw())\r\n\tdelete fl;\r\nRESULT\r\n\r\nCHECK(BALL_CREATE(LineBasedFile))\r\n\tLineBasedFile c;\r\n\tLineBasedFile* ptr = (LineBasedFile*)c.create(false, true);\r\n\tTEST_NOT_EQUAL(ptr, 0)\r\nRESULT\r\n\r\nCHECK(LineBasedFile(const String& filename, File::OpenMode open_mode = File::IN)\r\n\t\t\tthrow(Exception::FileNotFound))\r\n\tLineBasedFile f1(\"data\/LineBasedFile_test.txt\");\r\n\tTEST_EQUAL(f1.getLineNumber(), 0)\r\n\tTEST_EQUAL(f1.getLine(), \"\")\r\n\tf1.readLine();\r\n\tTEST_EQUAL(f1.getLineNumber(), 1)\r\n\tTEST_EQUAL(f1.getLine(), \"line1\")\r\n\r\n\tTEST_EXCEPTION(Exception::FileNotFound, LineBasedFile f2(\"XXXXXXXX.txt\"))\r\nRESULT\r\n\r\nLineBasedFile fx;\r\n\r\nCHECK(LineBasedFile(const LineBasedFile& f) throw())\r\n\tLineBasedFile f1(\"data\/LineBasedFile_test.txt\");\r\n\tTEST_EQUAL(f1.readLine(), true)\r\n\tTEST_EQUAL(f1.getLine(), \"line1\")\r\n\tf1.close();\r\n\r\n\tLineBasedFile f2(f1);\r\n\tTEST_EQUAL(f2.getLineNumber(), 1)\r\n\tTEST_EQUAL(f2.getLine(), \"line1\")\r\n\tTEST_EQUAL(f2.readLine(), true)\r\n\tTEST_EQUAL(f2.getLine(), \"\/0\/ \/1\/ \/2 2\/\/3\/\")\r\n\r\n\tLineBasedFile f3;\r\n\tLineBasedFile f4(f3);\r\nRESULT\r\n\r\nCHECK(LineBasedFile& operator = (const LineBasedFile& file) throw())\r\n\tLineBasedFile f1(\"data\/LineBasedFile_test.txt\");\r\n\tf1.readLine();\r\n\tTEST_EQUAL(f1.getLine(), \"line1\")\r\n\r\n\tLineBasedFile f2;\r\n\tf2 = f1;\r\n\tTEST_EQUAL(f2.getLineNumber(), 1)\r\n\tTEST_EQUAL(f2.getLine(), \"line1\")\r\nRESULT\r\n\r\nCHECK(clear() throw())\r\n\tLineBasedFile f1(\"data\/LineBasedFile_test.txt\");\r\n\tf1.readLine();\r\n\tf1.clear();\r\n\tTEST_EQUAL(f1.getLineNumber(), 0)\r\n\tTEST_EQUAL(f1.getLine(), \"\")\r\n\r\n\tfx.clear();\r\nRESULT\r\n\r\nCHECK(getLineNumber() const throw())\r\n\tLineBasedFile f1(\"data\/LineBasedFile_test.txt\");\r\n\tTEST_EQUAL(f1.getLineNumber(), 0)\r\n\tf1.readLine();\r\n\tTEST_EQUAL(f1.getLineNumber(), 1)\r\n\r\n\tTEST_EQUAL(fx.getLineNumber(), 0)\r\nRESULT\r\n\r\nLineBasedFile f1(\"data\/LineBasedFile_test.txt\");\r\n\r\nCHECK(getLine() const throw())\r\n\tTEST_EQUAL(f1.getLine(), \"\")\r\n\tf1.readLine();\r\n\tTEST_EQUAL(f1.getLine(), \"line1\")\r\n\r\n\tTEST_EQUAL(fx.getLine(), \"\")\r\nRESULT\r\n\r\nCHECK(getField(Position pos = 0, const String& quotes = \"\", \r\n\t\t\tconst String& delimiters = String::CHARACTER_CLASS__WHITESPACE) \r\n\t\t\tconst throw(Exception::IndexUnderflow))\r\n\r\n\tTEST_EQUAL(f1.getField(), \"line1\")\r\n\tTEST_EQUAL(f1.getField(1), \"\")\r\n\tTEST_EXCEPTION(Exception::IndexUnderflow, f1.getField(-99))\r\n\tf1.readLine();\r\n\tTEST_EQUAL(f1.getField(), \"\/0\/\")\r\n\tTEST_EQUAL(f1.getField(1), \"\/1\/\")\r\n\tTEST_EQUAL(f1.getField(2), \"\/2\")\r\n\tTEST_EQUAL(f1.getField(0, \"\/\"), \"0\")\r\n\tTEST_EQUAL(f1.getField(1, \"\/\"), \"1\")\r\n\tTEST_EQUAL(f1.getField(2, \"\/\"), \"2 23\")\r\n\tTEST_EQUAL(f1.getField(3, \"\/\"), \"\")\r\n\r\n\tTEST_EQUAL(fx.getField(), \"\")\r\nRESULT\r\n\r\nCHECK(startsWith(const String& text) const throw())\r\n\tTEST_EQUAL(f1.startsWith(\"\/0\/\"), true)\r\n\tTEST_EQUAL(f1.startsWith(\"\/0\/ \/1\/ \/2 2\/\/3\/\"), true)\r\n\tTEST_EQUAL(f1.startsWith(\"\/0\/ \/1\/ \/2 2\/\/3\/X\"), false)\r\n\r\n\tTEST_EQUAL(fx.startsWith(\"\"), true)\r\nRESULT\r\n\r\nCHECK(has(const String& text) const throw())\r\n\tTEST_EQUAL(f1.has(\"\/0\/\"), true)\r\n\tTEST_EQUAL(f1.has(\"\/\"), true)\r\n\tTEST_EQUAL(f1.has(\"\/1\/\"), true)\r\n\tTEST_EQUAL(f1.has(\"\/3\/\"), true)\r\n\tTEST_EQUAL(f1.has(\"X\"), false)\r\n\r\n\tTEST_EQUAL(fx.has(\"X\"), false)\r\n\tTEST_EQUAL(fx.has(\"\"), true)\r\nRESULT\r\n\r\nCHECK(search(const String& text, bool return_to_point) throw())\r\n\tTEST_EQUAL(f1.search(\"line3\"), true)\r\n\tTEST_EQUAL(f1.search(\"line4-\"), true)\r\n\tTEST_EQUAL(f1.search(\"line4-\"), false)\r\n\tTEST_EQUAL(f1.getLine(), \"line7-\")\r\n f1.rewind();\r\n\r\n\tf1.skipLines(2);\r\n\tTEST_EQUAL(f1.getLine(), \"line3-\")\r\n\tTEST_EQUAL(f1.search(\"XXX\", true), false)\r\n\tTEST_EQUAL(f1.getLine(), \"line3-\")\r\n\r\n f1.rewind();\r\n\tTEST_EQUAL(f1.search(\"#\"), true)\r\n\tTEST_EQUAL(f1.getLine(), \"###########\")\r\n\r\n\tTEST_EXCEPTION(LineBasedFile::LineBasedFileError, fx.search(\"line4-\"))\r\nRESULT\r\n\r\nCHECK(search(const String& text, const String& stop, bool return_to_point) throw())\r\n f1.rewind();\r\n\tTEST_EQUAL(f1.search(\"line3\", \"line4\", true), true)\r\n\tTEST_EQUAL(f1.getLine(), \"line3-\")\r\n\tTEST_EQUAL(f1.getLineNumber(), 3)\r\n\r\n f1.rewind();\r\n\tTEST_EQUAL(f1.search(\"line4\", \"line3\", false), false)\r\n\tTEST_EQUAL(f1.getLine(), \"line3-\")\r\n\tTEST_EQUAL(f1.getLineNumber(), 3)\r\n\r\n f1.rewind();\r\n\tTEST_EQUAL(f1.search(\"\/\", \"l\", false), false)\r\n\tTEST_EQUAL(f1.getLine(), \"line1\")\r\n\tTEST_EQUAL(f1.getLineNumber(), 1)\r\n\r\n f1.rewind();\r\n\tf1.readLine();\r\n\tf1.readLine();\r\n\tTEST_EQUAL(f1.getLine(), \"\/0\/ \/1\/ \/2 2\/\/3\/\")\r\n\tbool erg = f1.search(\"line4\", \"line3\", true);\r\n\tTEST_EQUAL(erg, false)\r\n\tTEST_EQUAL(f1.getLine(), \"\/0\/ \/1\/ \/2 2\/\/3\/\")\r\n\tTEST_EQUAL(f1.getLineNumber(), 2)\r\n\r\n f1.rewind();\r\n\tf1.skipLines(2);\r\n\tTEST_EQUAL(f1.getLine(), \"line3-\")\r\n\tTEST_EQUAL(f1.search(\"XXX\", \"ZZZZZ\", true), false)\r\n\tTEST_EQUAL(f1.getLine(), \"line3-\")\r\n\r\n f1.rewind();\r\n\terg = f1.search(\"#\", \"l\", false);\r\n\tTEST_EQUAL(erg, false)\r\n\tTEST_EQUAL(f1.getLine(), \"line1\")\r\n\r\n f1.rewind();\r\n\terg = f1.search(\"#\", \"l\", true);\r\n\tTEST_EQUAL(erg, false)\r\n\tTEST_EQUAL(f1.getLineNumber(), 0)\r\n\r\n f1.rewind();\r\n\terg = f1.search(\"line7\", \"#\", false);\r\n\tTEST_EQUAL(erg, false)\r\n\tTEST_EQUAL(f1.getLine(), \"###########\")\r\n\r\n\r\n\tTEST_EXCEPTION(LineBasedFile::LineBasedFileError, fx.search(\"line4\", \"line3\"))\r\nRESULT\r\n\r\nCHECK(switchString(const std::vector<String>& data) const throw())\r\n f1.rewind();\r\n\tf1.readLine();\r\n\r\n\tvector<String> vec;\r\n\tvec.push_back(\"line\");\r\n\tvec.push_back(\"line1\");\r\n\tvec.push_back(\"line2\");\r\n\tvec.push_back(\"\");\r\n\r\n\tTEST_EQUAL(f1.switchString(vec), 1)\r\n\tf1.readLine();\r\n\tTEST_EQUAL(f1.switchString(vec), -1)\r\n\r\n\tTEST_EQUAL(fx.switchString(vec), 3)\r\nRESULT\r\n\r\nCHECK(test(const char* file, int line, bool condition, const String& msg)\r\n\t\t\tconst throw(LineBasedFileError))\r\n\tf1.test(__FILE__, __LINE__, true, \"test\");\r\n\tTEST_EXCEPTION(LineBasedFile::LineBasedFileError, f1.test(__FILE__, __LINE__, false, \"test\") )\r\n\tfx.test(__FILE__, __LINE__, true, \"test\");\r\nRESULT\r\n\r\nCHECK(readLine() throw(LineBasedFileError))\r\n f1.rewind();\r\n\tf1.readLine();\r\n\r\n\tTEST_EQUAL(f1.getLine(), \"line1\")\r\n\r\n\tTEST_EXCEPTION(LineBasedFile::LineBasedFileError, fx.readLine())\r\n\tTEST_EQUAL(fx.getLine(), \"\")\r\nRESULT\r\n\r\nCHECK(skipLines(Size number = 1) throw(Exception::IndexUnderflow, LineBasedFileError))\r\n f1.rewind();\r\n\tTEST_EQUAL(f1.skipLines(2), true)\r\n\tTEST_EQUAL(f1.getLine(), \"line3-\")\r\n\tTEST_EQUAL(f1.getLineNumber(), 3)\r\n\tTEST_EQUAL(f1.skipLines(5), false)\r\n\r\n\tTEST_EXCEPTION(LineBasedFile::LineBasedFileError, fx.skipLines(2))\r\n\tTEST_EQUAL(fx.getLine(), \"\")\r\n\tTEST_EQUAL(fx.getLineNumber(), 0)\r\nRESULT\r\n\r\nCHECK(rewind() throw(LineBasedFileError))\r\n f1.rewind();\r\n\tTEST_EQUAL(f1.getLine(), \"\")\r\n\tTEST_EQUAL(f1.getLineNumber(), 0)\r\n\r\n TEST_EXCEPTION(LineBasedFile::LineBasedFileError,fx.rewind())\r\n\tTEST_EQUAL(fx.getLine(), \"\")\r\n\tTEST_EQUAL(fx.getLineNumber(), 0)\r\nRESULT\r\n\r\nCHECK(goToLine(Position line_number) throw(LineBasedFileError))\r\n f1.rewind();\r\n\tf1.skipLines(4);\r\n\tTEST_EQUAL(f1.goToLine(3), true)\r\n\tTEST_EQUAL(f1.getLine(), \"line3-\" )\r\n\tTEST_EQUAL(f1.getLineNumber(), 3)\r\n\r\n\tTEST_EQUAL(f1.goToLine(5), true)\r\n\tTEST_EQUAL(f1.getLine(), \"line5-\" )\r\n\tTEST_EQUAL(f1.getLineNumber(), 5)\r\n\r\n\tTEST_EQUAL(f1.goToLine(8), false)\r\n\tTEST_EQUAL(f1.getLine(), \"line7-\" )\r\n\tTEST_EQUAL(f1.getLineNumber(), 7)\r\n\r\n TEST_EXCEPTION(LineBasedFile::LineBasedFileError,fx.goToLine(2))\r\n\tTEST_EQUAL(fx.getLine(), \"\")\r\n\tTEST_EQUAL(fx.getLineNumber(), 0)\r\nRESULT\r\n\r\n\r\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\r\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\r\nEND_TEST\r\n<|endoftext|>"} {"text":"<commit_before>\/\/ -*- Mode: C++; tab-width: 2; -*-\n\/\/ vi: set ts=2:\n\/\/\n\/\/ $Id: dockWidget.C,v 1.13 2003\/09\/17 22:16:40 amoll Exp $\n\n#include <BALL\/VIEW\/WIDGETS\/dockWidget.h>\n#include <BALL\/VIEW\/KERNEL\/mainControl.h>\n#include <BALL\/VIEW\/KERNEL\/common.h>\n#include <qmenubar.h>\n#include <qlabel.h>\n\nusing std::endl;\n\nnamespace BALL\n{\n\tnamespace VIEW\n\t{\n\t\t\nDockWidget::DockWidget(QWidget* parent, const char* name)\n: QDockWindow(QDockWindow::InDock, parent),\n\tModularWidget(name),\n\tguest_(0)\n{\n\tlayout_ = new QVBoxLayout(this);\n caption_label_ = new QLabel(this, \"caption_label\");\n\tcaption_label_->resize(90, 12);\n caption_label_->setSizePolicy( QSizePolicy(QSizePolicy::Expanding, QSizePolicy::Fixed, 0, 0, false));\n caption_label_->setPaletteBackgroundColor( QColor( 255, 255, 127 ) );\n QFont caption_label_font(caption_label_->font());\n caption_label_font.setFamily( \"Helvetica\" );\n caption_label_font.setPointSize( 11 );\n caption_label_->setFont( caption_label_font ); \n caption_label_->setFrameShape(QLabel::NoFrame);\n caption_label_->setAlignment(QLabel::AlignCenter);\n\tlayout_->addWidget(caption_label_);\n\tLog.remove(std::cerr);\n\tboxLayout()->addItem(layout_);\n\tLog.insert(std::cerr);\n\n\tsetOrientation(Qt::Vertical);\n\n\tif (name != 0) \n\t{ \n\t\tsetCaption(name);\n\t\tsetName(name);\n\t\tcaption_label_->setText(name);\n\t}\n\telse \n\t{\n\t\tsetName(\"DockWidget\");\n\t}\n\n\tregisterWidget(this);\n}\n\nvoid DockWidget::setGuest(QWidget& guest)\n{\n\tQPoint p;\n\tguest.reparent(this, p, true);\n\tguest.resize(120,100);\n guest.setSizePolicy( QSizePolicy(QSizePolicy::Expanding, QSizePolicy::Expanding, 0, 0, false));\n\tlayout_->addWidget(&guest);\n\tguest_ = &guest;\n\tsetMinimumSize(20, 20);\n\tsetCloseMode(QDockWindow::Always);\n\tsetResizeEnabled(true);\n}\n\nvoid DockWidget::initializeWidget(MainControl& main_control)\n\tthrow()\n{\n\twindow_menu_entry_id_ = \n\t\tmain_control.insertMenuEntry(MainControl::WINDOWS, getIdentifier(), this, SLOT(switchShowWidget()));\n\tgetMainControl()->menuBar()->setItemChecked(window_menu_entry_id_, true);\n\tconnect(this, SIGNAL(visibilityChanged(bool)), this, SLOT(setWindowsMenuEntry(bool)));\n}\n\nvoid DockWidget::finalizeWidget(MainControl& main_control)\n\tthrow()\n{\n\tmain_control.removeMenuEntry(MainControl::WINDOWS, getIdentifier(), this, SLOT(switchShowWidget()));\n}\n\n\nvoid DockWidget::writePreferences(INIFile& inifile)\n\tthrow()\n{\n\tModularWidget::writePreferences(inifile);\n\n\tinifile.insertValue(\"WINDOWS\", getIdentifier() + \"::docked\", String(area() != 0));\n\tif (!area()) return;\n\n\tDock dock;\n\tIndex index, offset;\n\tbool newline;\n\tgetMainControl()->getLocation(this, dock, index, newline, offset);\n\tinifile.insertValue(\"WINDOWS\", getIdentifier() + \"::dockarea\", String(dock));\n\tinifile.insertValue(\"WINDOWS\", getIdentifier() + \"::dockindex\", String(index));\n\tinifile.insertValue(\"WINDOWS\", getIdentifier() + \"::dockoffset\", String(offset));\n\tinifile.insertValue(\"WINDOWS\", getIdentifier() + \"::docknewline\", String(newline));\n}\n\nvoid DockWidget::fetchPreferences(INIFile & inifile)\n\tthrow()\n{\n\tif (inifile.hasEntry(\"WINDOWS\", getIdentifier() + \"::docked\"))\n\t{\n\t\tif (!inifile.getValue(\"WINDOWS\", getIdentifier() + \"::docked\").toUnsignedInt())\n\t\t{\n\t\t\tundock();\n\t\t\tshow();\n\t\t}\n\t\telse\n\t\t{\n\t\t\tif (inifile.hasEntry(\"WINDOWS\", getIdentifier() + \"::dockarea\") &&\n\t\t\t\t\tinifile.hasEntry(\"WINDOWS\", getIdentifier() + \"::dockindex\") &&\n\t\t\t\t\tinifile.hasEntry(\"WINDOWS\", getIdentifier() + \"::dockoffset\") &&\n\t\t\t\t\tinifile.hasEntry(\"WINDOWS\", getIdentifier() + \"::docknewline\"))\n\t\t\t{\n\t\t\t\tDock dock = (Dock) inifile.getValue(\"WINDOWS\", getIdentifier() + \"::dockarea\").toUnsignedInt();\n\t\t\t\tIndex index = inifile.getValue(\"WINDOWS\", getIdentifier() + \"::dockindex\").toUnsignedInt();\n\t\t\t\tIndex offset = inifile.getValue(\"WINDOWS\", getIdentifier() + \"::dockoffset\").toUnsignedInt();\n\t\t\t\tbool newline = inifile.getValue(\"WINDOWS\", getIdentifier() + \"::docknewline\").toUnsignedInt();\n\t\t\t\tgetMainControl()->moveDockWindow(this, dock, newline, index, offset);\n\t\t\t}\n\t\t}\n\t}\n\n\tModularWidget::fetchPreferences(inifile);\n\tif (inifile.hasEntry(\"WINDOWS\", getIdentifier() + \"::height\"))\n\t{\n\t\tIndex width = inifile.getValue(\"WINDOWS\", getIdentifier() + \"::width\").toUnsignedInt();\n\t\tIndex height = inifile.getValue(\"WINDOWS\", getIdentifier() + \"::height\").toUnsignedInt();\n\n\t\tif (guest_)\n\t\t{\n\t\t\tguest_->resize(width, height);\n\t\t}\n\t}\n\n\tif (inifile.hasEntry(\"WINDOWS\", getIdentifier() + \"::on\"))\n\t{\t\n\t\tif (!inifile.getValue(\"WINDOWS\", getIdentifier() + \"::on\").toUnsignedInt())\n\t\t{\n\t\t\tswitchShowWidget();\n\t\t}\n\t}\n\telse \n\t{\n\t\tif (!default_visible_)\n\t\t{\n\t\t\tswitchShowWidget();\n\t\t}\n\t}\n\n\tif (!BALL_VIEW_DOCKWINDOWS_SHOW_LABELS) caption_label_->hide();\n}\n\nvoid DockWidget::switchShowWidget()\n\tthrow()\n{\n\tif (window_menu_entry_id_ == -1) return;\n\n\tif (!getMainControl()) \n\t{\n\t\tLog.error() << \"Problem in \" << __FILE__ << __LINE__ << std::endl;\n\t\treturn;\n\t}\n\n\tQMenuBar* menu = getMainControl()->menuBar();\n\tif (menu->isItemChecked(window_menu_entry_id_))\n\t{\n\t\thide();\n\t\tmenu->setItemChecked(window_menu_entry_id_, false);\n\t}\n\telse\n\t{\n\t\tshow();\n\t\tmenu->setItemChecked(window_menu_entry_id_, true);\n\t}\n}\n\nvoid DockWidget::setWindowsMenuEntry(bool state) \n{\n\tQMenuBar* menu = getMainControl()->menuBar();\n\tif (menu->isItemChecked(window_menu_entry_id_) != isVisible())\n\t{\n\t\tmenu->setItemChecked(window_menu_entry_id_, state);\n\t}\n}\n\nvoid DockWidget::applyPreferences(Preferences & \/* preferences *\/)\n\tthrow()\n{\n\tif (!BALL_VIEW_DOCKWINDOWS_SHOW_LABELS) caption_label_->hide();\n\telse caption_label_->show();\n}\n\n} } \/\/ namespaces\n<commit_msg>changed handling of layout to prevent warning from qt<commit_after>\/\/ -*- Mode: C++; tab-width: 2; -*-\n\/\/ vi: set ts=2:\n\/\/\n\/\/ $Id: dockWidget.C,v 1.14 2003\/09\/20 16:49:06 amoll Exp $\n\n#include <BALL\/VIEW\/WIDGETS\/dockWidget.h>\n#include <BALL\/VIEW\/KERNEL\/mainControl.h>\n#include <BALL\/VIEW\/KERNEL\/common.h>\n#include <qmenubar.h>\n#include <qlabel.h>\n\nusing std::endl;\n\nnamespace BALL\n{\n\tnamespace VIEW\n\t{\n\t\t\nDockWidget::DockWidget(QWidget* parent, const char* name)\n: QDockWindow(QDockWindow::InDock, parent),\n\tModularWidget(name),\n\tguest_(0)\n{\n\tlayout_ = new QVBoxLayout();\n caption_label_ = new QLabel(this, \"caption_label\");\n\tcaption_label_->resize(90, 12);\n caption_label_->setSizePolicy( QSizePolicy(QSizePolicy::Expanding, QSizePolicy::Fixed, 0, 0, false));\n caption_label_->setPaletteBackgroundColor( QColor( 255, 255, 127 ) );\n QFont caption_label_font(caption_label_->font());\n caption_label_font.setFamily( \"Helvetica\" );\n caption_label_font.setPointSize( 11 );\n caption_label_->setFont( caption_label_font ); \n caption_label_->setFrameShape(QLabel::NoFrame);\n caption_label_->setAlignment(QLabel::AlignCenter);\n\tlayout_->addWidget(caption_label_);\n\tLog.remove(std::cerr);\n\tboxLayout()->addLayout(layout_);\n\tLog.insert(std::cerr);\n\n\tsetOrientation(Qt::Vertical);\n\n\tif (name != 0) \n\t{ \n\t\tsetCaption(name);\n\t\tsetName(name);\n\t\tcaption_label_->setText(name);\n\t}\n\telse \n\t{\n\t\tsetName(\"DockWidget\");\n\t}\n\n\tregisterWidget(this);\n}\n\nvoid DockWidget::setGuest(QWidget& guest)\n{\n\tQPoint p;\n\tguest.reparent(this, p, true);\n\tguest.resize(120,100);\n guest.setSizePolicy( QSizePolicy(QSizePolicy::Expanding, QSizePolicy::Expanding, 0, 0, false));\n\tlayout_->addWidget(&guest);\n\tguest_ = &guest;\n\tsetMinimumSize(20, 20);\n\tsetCloseMode(QDockWindow::Always);\n\tsetResizeEnabled(true);\n}\n\nvoid DockWidget::initializeWidget(MainControl& main_control)\n\tthrow()\n{\n\twindow_menu_entry_id_ = \n\t\tmain_control.insertMenuEntry(MainControl::WINDOWS, getIdentifier(), this, SLOT(switchShowWidget()));\n\tgetMainControl()->menuBar()->setItemChecked(window_menu_entry_id_, true);\n\tconnect(this, SIGNAL(visibilityChanged(bool)), this, SLOT(setWindowsMenuEntry(bool)));\n}\n\nvoid DockWidget::finalizeWidget(MainControl& main_control)\n\tthrow()\n{\n\tmain_control.removeMenuEntry(MainControl::WINDOWS, getIdentifier(), this, SLOT(switchShowWidget()));\n}\n\n\nvoid DockWidget::writePreferences(INIFile& inifile)\n\tthrow()\n{\n\tModularWidget::writePreferences(inifile);\n\n\tinifile.insertValue(\"WINDOWS\", getIdentifier() + \"::docked\", String(area() != 0));\n\tif (!area()) return;\n\n\tDock dock;\n\tIndex index, offset;\n\tbool newline;\n\tgetMainControl()->getLocation(this, dock, index, newline, offset);\n\tinifile.insertValue(\"WINDOWS\", getIdentifier() + \"::dockarea\", String(dock));\n\tinifile.insertValue(\"WINDOWS\", getIdentifier() + \"::dockindex\", String(index));\n\tinifile.insertValue(\"WINDOWS\", getIdentifier() + \"::dockoffset\", String(offset));\n\tinifile.insertValue(\"WINDOWS\", getIdentifier() + \"::docknewline\", String(newline));\n}\n\nvoid DockWidget::fetchPreferences(INIFile & inifile)\n\tthrow()\n{\n\tif (inifile.hasEntry(\"WINDOWS\", getIdentifier() + \"::docked\"))\n\t{\n\t\tif (!inifile.getValue(\"WINDOWS\", getIdentifier() + \"::docked\").toUnsignedInt())\n\t\t{\n\t\t\tundock();\n\t\t\tshow();\n\t\t}\n\t\telse\n\t\t{\n\t\t\tif (inifile.hasEntry(\"WINDOWS\", getIdentifier() + \"::dockarea\") &&\n\t\t\t\t\tinifile.hasEntry(\"WINDOWS\", getIdentifier() + \"::dockindex\") &&\n\t\t\t\t\tinifile.hasEntry(\"WINDOWS\", getIdentifier() + \"::dockoffset\") &&\n\t\t\t\t\tinifile.hasEntry(\"WINDOWS\", getIdentifier() + \"::docknewline\"))\n\t\t\t{\n\t\t\t\tDock dock = (Dock) inifile.getValue(\"WINDOWS\", getIdentifier() + \"::dockarea\").toUnsignedInt();\n\t\t\t\tIndex index = inifile.getValue(\"WINDOWS\", getIdentifier() + \"::dockindex\").toUnsignedInt();\n\t\t\t\tIndex offset = inifile.getValue(\"WINDOWS\", getIdentifier() + \"::dockoffset\").toUnsignedInt();\n\t\t\t\tbool newline = inifile.getValue(\"WINDOWS\", getIdentifier() + \"::docknewline\").toUnsignedInt();\n\t\t\t\tgetMainControl()->moveDockWindow(this, dock, newline, index, offset);\n\t\t\t}\n\t\t}\n\t}\n\n\tModularWidget::fetchPreferences(inifile);\n\tif (inifile.hasEntry(\"WINDOWS\", getIdentifier() + \"::height\"))\n\t{\n\t\tIndex width = inifile.getValue(\"WINDOWS\", getIdentifier() + \"::width\").toUnsignedInt();\n\t\tIndex height = inifile.getValue(\"WINDOWS\", getIdentifier() + \"::height\").toUnsignedInt();\n\n\t\tif (guest_)\n\t\t{\n\t\t\tguest_->resize(width, height);\n\t\t}\n\t}\n\n\tif (inifile.hasEntry(\"WINDOWS\", getIdentifier() + \"::on\"))\n\t{\t\n\t\tif (!inifile.getValue(\"WINDOWS\", getIdentifier() + \"::on\").toUnsignedInt())\n\t\t{\n\t\t\tswitchShowWidget();\n\t\t}\n\t}\n\telse \n\t{\n\t\tif (!default_visible_)\n\t\t{\n\t\t\tswitchShowWidget();\n\t\t}\n\t}\n\n\tif (!BALL_VIEW_DOCKWINDOWS_SHOW_LABELS) caption_label_->hide();\n}\n\nvoid DockWidget::switchShowWidget()\n\tthrow()\n{\n\tif (window_menu_entry_id_ == -1) return;\n\n\tif (!getMainControl()) \n\t{\n\t\tLog.error() << \"Problem in \" << __FILE__ << __LINE__ << std::endl;\n\t\treturn;\n\t}\n\n\tQMenuBar* menu = getMainControl()->menuBar();\n\tif (menu->isItemChecked(window_menu_entry_id_))\n\t{\n\t\thide();\n\t\tmenu->setItemChecked(window_menu_entry_id_, false);\n\t}\n\telse\n\t{\n\t\tshow();\n\t\tmenu->setItemChecked(window_menu_entry_id_, true);\n\t}\n}\n\nvoid DockWidget::setWindowsMenuEntry(bool state) \n{\n\tQMenuBar* menu = getMainControl()->menuBar();\n\tif (menu->isItemChecked(window_menu_entry_id_) != isVisible())\n\t{\n\t\tmenu->setItemChecked(window_menu_entry_id_, state);\n\t}\n}\n\nvoid DockWidget::applyPreferences(Preferences & \/* preferences *\/)\n\tthrow()\n{\n\tif (!BALL_VIEW_DOCKWINDOWS_SHOW_LABELS) caption_label_->hide();\n\telse caption_label_->show();\n}\n\n} } \/\/ namespaces\n<|endoftext|>"} {"text":"<commit_before>#include \"ros\/ros.h\"\n#include <string>\n\n#include \"uinput_device.h\"\n\nconst char* DEVICE_NAME_PARAM = \"device_name\";\n\nint main(int argc, char** argv) {\n\n \/* initialize ros *\/\n\n ros::init(argc, argv, \"evdev_teleport_receiver\");\n\n ros::NodeHandle n(\"~\");\n\n \/* open the device *\/\n\n std::string device_name;\n UinputDevice *uinput_device = new UinputDevice();\n\n if (n.getParam(DEVICE_NAME_PARAM, device_name)) {\n ROS_DEBUG(\"Creating device: %s\", device_name.c_str());\n n.deleteParam(DEVICE_NAME_PARAM);\n } else {\n ROS_ERROR(\"Private parameter 'device_name' must be set\");\n ros::shutdown();\n exit(EXIT_FAILURE);\n }\n\n if (!uinput_device->CreateDevice(device_name)) {\n ROS_ERROR(\"failed to create uinput device\");\n ros::shutdown();\n exit(EXIT_FAILURE);\n }\n\n \/* begin relaying from the topic to the device *\/\n\n ros::Subscriber evdev_sub =\n n.subscribe(\"\/evdev_teleport\/event\", 1, &UinputDevice::HandleMessage, uinput_device);\n\n ros::spin();\n}\n<commit_msg>Don't delete device_name from evdev receiver<commit_after>#include \"ros\/ros.h\"\n#include <string>\n\n#include \"uinput_device.h\"\n\nconst char* DEVICE_NAME_PARAM = \"device_name\";\n\nint main(int argc, char** argv) {\n\n \/* initialize ros *\/\n\n ros::init(argc, argv, \"evdev_teleport_receiver\");\n\n ros::NodeHandle n(\"~\");\n\n \/* open the device *\/\n\n std::string device_name;\n UinputDevice *uinput_device = new UinputDevice();\n\n if (n.getParam(DEVICE_NAME_PARAM, device_name)) {\n ROS_DEBUG(\"Creating device: %s\", device_name.c_str());\n } else {\n ROS_ERROR(\"Private parameter 'device_name' must be set\");\n ros::shutdown();\n exit(EXIT_FAILURE);\n }\n\n if (!uinput_device->CreateDevice(device_name)) {\n ROS_ERROR(\"failed to create uinput device\");\n ros::shutdown();\n exit(EXIT_FAILURE);\n }\n\n \/* begin relaying from the topic to the device *\/\n\n ros::Subscriber evdev_sub =\n n.subscribe(\"\/evdev_teleport\/event\", 1, &UinputDevice::HandleMessage, uinput_device);\n\n ros::spin();\n}\n<|endoftext|>"} {"text":"<commit_before>\/\/=======================================================================\n\/\/ Copyright Baptiste Wicht 2013.\n\/\/ Distributed under the Boost Software License, Version 1.0.\n\/\/ (See accompanying file LICENSE_1_0.txt or copy at\n\/\/ http:\/\/www.boost.org\/LICENSE_1_0.txt)\n\/\/=======================================================================\n\n#include \"report.hpp\"\n#include \"expenses.hpp\"\n#include \"earnings.hpp\"\n#include \"budget_exception.hpp\"\n#include \"accounts.hpp\"\n\nusing namespace budget;\n\nnamespace {\n\nvoid render(std::vector<std::vector<std::string>>& graph){\n std::reverse(graph.begin(), graph.end());\n\n for(auto& line : graph){\n for(auto& col : line){\n std::cout << col;\n }\n std::cout << std::endl;\n }\n}\n\nvoid monthly_report(boost::gregorian::greg_year year){\n auto today = boost::gregorian::day_clock::local_day();\n\n budget::money max_expenses;\n budget::money max_earnings;\n budget::money max_balance;\n budget::money min_expenses;\n budget::money min_earnings;\n budget::money min_balance;\n\n auto sm = start_month(year);\n\n std::vector<int> expenses(13);\n std::vector<int> earnings(13);\n std::vector<int> balances(13);\n\n for(unsigned short i = sm + 1; i < today.month() + 1; ++i){\n boost::gregorian::greg_month month = i;\n\n auto accounts = all_accounts(year, month);\n\n budget::money total_expenses;\n budget::money total_earnings;\n budget::money total_balance;\n\n for(auto& account : accounts){\n auto expenses = accumulate_amount_if(all_expenses(),\n [year,month,account](budget::expense& e){return e.account == account.id && e.date.year() == year && e.date.month() == month;});\n auto earnings = accumulate_amount_if(all_earnings(),\n [year,month,account](budget::earning& e){return e.account == account.id && e.date.year() == year && e.date.month() == month;});\n\n total_expenses += expenses;\n total_earnings += earnings;\n\n auto balance = account.amount;\n balance -= expenses;\n balance += earnings;\n\n total_balance += balance;\n }\n\n expenses[month] = total_expenses.dollars();\n earnings[month] = total_earnings.dollars();\n balances[month] = total_balance.dollars();\n\n max_expenses = std::max(max_expenses, total_expenses);\n max_earnings = std::max(max_earnings, total_earnings);\n max_balance = std::max(max_balance, total_balance);\n min_expenses = std::min(min_expenses, total_expenses);\n min_earnings = std::min(min_earnings, total_earnings);\n min_balance = std::min(min_balance, total_balance);\n }\n\n auto height = terminal_height() - 9;\n auto width = terminal_width() - 6;\n\n \/\/TODO compute the scale based on the data\n unsigned int scale = 1000;\n\n int min = 0;\n if(min_expenses.negative() || min_earnings.negative() || min_balance.negative()){\n min = std::min(min_expenses, std::min(min_earnings, min_balance)).dollars();\n\n std::cout << \"real_min\" << min << std::endl;\n\n min = -1 * ((std::abs(min) \/ scale) + 1) * scale;\n\n std::cout << \"real_min\" << min << std::endl;\n }\n\n unsigned int max = std::max(max_earnings, std::max(max_expenses, max_balance)).dollars();\n max = ((max \/ scale) + 1) * scale;\n\n unsigned int levels = max \/ scale + std::abs(min) \/ scale;\n\n unsigned int step_height = height \/ levels;\n unsigned int precision = scale \/ step_height;\n\n auto graph_height = 9 + step_height * levels;\n auto graph_width = 6 + (12 - sm) * 8 + (12 - sm - 1) * 2;\n\n std::cout << graph_height << std::endl;\n std::cout << graph_width << std::endl;\n\n std::vector<std::vector<std::string>> graph(graph_height, std::vector<std::string>(graph_width, \" \"));\n\n std::cout << graph.size() << std::endl;\n std::cout << graph.at(0).size() << std::endl;\n\n unsigned int min_index = 3;\n unsigned int zero_index = min_index + 1 + (std::abs(min) \/ scale) * step_height;\n\n for(unsigned short i = sm + 1; i < today.month() + 1; ++i){\n boost::gregorian::greg_month month = i;\n\n auto col_start = 7 + 10 * (i - sm - 1);\n\n for(int j = 0; j < expenses[month] \/ precision; ++j){\n graph[zero_index + j][col_start] = \"\\033[1;41m \\033[0m\";\n graph[zero_index + j][col_start + 1] = \"\\033[1;41m \\033[0m\";\n }\n\n col_start += 3;\n\n for(int j = 0; j < earnings[month] \/ precision; ++j){\n graph[zero_index + j][col_start] = \"\\033[1;42m \\033[0m\";\n graph[zero_index + j][col_start + 1] = \"\\033[1;42m \\033[0m\";\n }\n\n col_start += 3;\n\n std::cout << \"balance\" << std::endl;\n\n if(balances[month] >= 0){\n for(int j = 0; j < balances[month] \/ precision; ++j){\n graph[zero_index + j][col_start] = \"\\033[1;44m \\033[0m\";\n graph[zero_index + j][col_start + 1] = \"\\033[1;44m \\033[0m\";\n }\n } else {\n for(int j = 0; j < std::abs(balances[month]) \/ precision; ++j){\n graph[zero_index - 1 - j][col_start] = \"\\033[1;44m \\033[0m\";\n graph[zero_index - 1 - j][col_start + 1] = \"\\033[1;44m \\033[0m\";\n }\n }\n\n std::cout << \"balance end\" << std::endl;\n }\n\n render(graph);\n}\n\n} \/\/end of anonymous namespace\n\nvoid budget::report_module::load(){\n load_accounts();\n load_expenses();\n load_earnings();\n}\n\nvoid budget::report_module::handle(const std::vector<std::string>& args){\n auto today = boost::gregorian::day_clock::local_day();\n\n if(args.size() == 1){\n monthly_report(today.year());\n } else {\n auto& subcommand = args[1];\n\n if(subcommand == \"monthly\"){\n monthly_report(today.year());\n } else {\n throw budget_exception(\"Invalid subcommand \\\"\" + subcommand + \"\\\"\");\n }\n }\n}\n<commit_msg>Add month legends and graph title<commit_after>\/\/=======================================================================\n\/\/ Copyright Baptiste Wicht 2013.\n\/\/ Distributed under the Boost Software License, Version 1.0.\n\/\/ (See accompanying file LICENSE_1_0.txt or copy at\n\/\/ http:\/\/www.boost.org\/LICENSE_1_0.txt)\n\/\/=======================================================================\n\n#include \"report.hpp\"\n#include \"expenses.hpp\"\n#include \"earnings.hpp\"\n#include \"budget_exception.hpp\"\n#include \"accounts.hpp\"\n\nusing namespace budget;\n\nnamespace {\n\ntypedef std::vector<std::vector<std::string>> graph_type;\n\nvoid render(graph_type& graph){\n std::reverse(graph.begin(), graph.end());\n\n for(auto& line : graph){\n for(auto& col : line){\n std::cout << col;\n }\n std::cout << std::endl;\n }\n}\n\nvoid write(graph_type& graph, int row, int col, const std::string& value){\n for(int i = 0; i < value.size(); ++i){\n graph[row][col + i] = value[i];\n }\n}\n\nvoid monthly_report(boost::gregorian::greg_year year){\n auto today = boost::gregorian::day_clock::local_day();\n\n budget::money max_expenses;\n budget::money max_earnings;\n budget::money max_balance;\n budget::money min_expenses;\n budget::money min_earnings;\n budget::money min_balance;\n\n auto sm = start_month(year);\n\n std::vector<int> expenses(13);\n std::vector<int> earnings(13);\n std::vector<int> balances(13);\n\n for(unsigned short i = sm + 1; i < today.month() + 1; ++i){\n boost::gregorian::greg_month month = i;\n\n auto accounts = all_accounts(year, month);\n\n budget::money total_expenses;\n budget::money total_earnings;\n budget::money total_balance;\n\n for(auto& account : accounts){\n auto expenses = accumulate_amount_if(all_expenses(),\n [year,month,account](budget::expense& e){return e.account == account.id && e.date.year() == year && e.date.month() == month;});\n auto earnings = accumulate_amount_if(all_earnings(),\n [year,month,account](budget::earning& e){return e.account == account.id && e.date.year() == year && e.date.month() == month;});\n\n total_expenses += expenses;\n total_earnings += earnings;\n\n auto balance = account.amount;\n balance -= expenses;\n balance += earnings;\n\n total_balance += balance;\n }\n\n expenses[month] = total_expenses.dollars();\n earnings[month] = total_earnings.dollars();\n balances[month] = total_balance.dollars();\n\n max_expenses = std::max(max_expenses, total_expenses);\n max_earnings = std::max(max_earnings, total_earnings);\n max_balance = std::max(max_balance, total_balance);\n min_expenses = std::min(min_expenses, total_expenses);\n min_earnings = std::min(min_earnings, total_earnings);\n min_balance = std::min(min_balance, total_balance);\n }\n\n auto height = terminal_height() - 9;\n auto width = terminal_width() - 6;\n\n \/\/TODO compute the scale based on the data\n unsigned int scale = 1000;\n\n int min = 0;\n if(min_expenses.negative() || min_earnings.negative() || min_balance.negative()){\n min = std::min(min_expenses, std::min(min_earnings, min_balance)).dollars();\n min = -1 * ((std::abs(min) \/ scale) + 1) * scale;\n }\n\n unsigned int max = std::max(max_earnings, std::max(max_expenses, max_balance)).dollars();\n max = ((max \/ scale) + 1) * scale;\n\n unsigned int levels = max \/ scale + std::abs(min) \/ scale;\n\n unsigned int step_height = height \/ levels;\n unsigned int precision = scale \/ step_height;\n\n auto graph_height = 9 + step_height * levels;\n auto graph_width = 6 + (12 - sm) * 8 + (12 - sm - 1) * 2;\n\n graph_type graph(graph_height, std::vector<std::string>(graph_width, \" \"));\n\n write(graph, graph_height - 2, 8, \"Monthly report of \" + to_string(year));\n\n unsigned int min_index = 3;\n unsigned int zero_index = min_index + 1 + (std::abs(min) \/ scale) * step_height;\n\n for(unsigned short i = sm + 1; i < today.month() + 1; ++i){\n boost::gregorian::greg_month month = i;\n\n auto col_start = 7 + 10 * (i - sm - 1);\n\n \/\/Display month legend\n auto month_str = month.as_short_string();\n write(graph, 1, col_start + 2, month_str);\n\n for(int j = 0; j < expenses[month] \/ precision; ++j){\n graph[zero_index + j][col_start] = \"\\033[1;41m \\033[0m\";\n graph[zero_index + j][col_start + 1] = \"\\033[1;41m \\033[0m\";\n }\n\n col_start += 3;\n\n for(int j = 0; j < earnings[month] \/ precision; ++j){\n graph[zero_index + j][col_start] = \"\\033[1;42m \\033[0m\";\n graph[zero_index + j][col_start + 1] = \"\\033[1;42m \\033[0m\";\n }\n\n col_start += 3;\n\n if(balances[month] >= 0){\n for(int j = 0; j < balances[month] \/ precision; ++j){\n graph[zero_index + j][col_start] = \"\\033[1;44m \\033[0m\";\n graph[zero_index + j][col_start + 1] = \"\\033[1;44m \\033[0m\";\n }\n } else {\n for(int j = 0; j < std::abs(balances[month]) \/ precision; ++j){\n graph[zero_index - 1 - j][col_start] = \"\\033[1;44m \\033[0m\";\n graph[zero_index - 1 - j][col_start + 1] = \"\\033[1;44m \\033[0m\";\n }\n }\n }\n\n render(graph);\n}\n\n} \/\/end of anonymous namespace\n\nvoid budget::report_module::load(){\n load_accounts();\n load_expenses();\n load_earnings();\n}\n\nvoid budget::report_module::handle(const std::vector<std::string>& args){\n auto today = boost::gregorian::day_clock::local_day();\n\n if(args.size() == 1){\n monthly_report(today.year());\n } else {\n auto& subcommand = args[1];\n\n if(subcommand == \"monthly\"){\n monthly_report(today.year());\n } else {\n throw budget_exception(\"Invalid subcommand \\\"\" + subcommand + \"\\\"\");\n }\n }\n}\n<|endoftext|>"} {"text":"<commit_before>#include <beluga\/tls\/tls_client.hpp>\n#include <beluga\/tls\/tls_reader.hpp>\n\nbeluga::http_client::request_event::request_event(bool _continue):\n continue_event(_continue)\n{\n}\n \nbeluga::http_client::http_client(boost::asio::ip::tcp::socket& socket):\n tcp_client(socket)\n{\n initialize();\n}\n\nbeluga::http_client::http_client(boost::asio::io_service& io_service):\n tcp_client(io_service)\n{\n initialize();\n}\n\nvoid beluga::http_client::initialize()\n{\n std::shared_ptr<dynamic_buffer> buffer = std::make_shared<dynamic_buffer>();\n \n this->on_receive.connect\n\t([this, buffer] (tcp_client::receive_event& event)\n\t {\n\t if(on_client_hello.empty())\n\t\t return;\n\n\t buffer->insert(buffer->end(), event.get_buffer().begin(), event.get_buffer().end());\n\t \n\t tls_reader<dynamic_buffer::const_iterator> reader(*buffer);\n\t \n\t if(reader.read_request(request))\n\t {\n\t\t request_event request_event(true, request);\n\t\t on_request(request_event);\n\t\t \n\t\t event.set_continue(request_event.get_continue());\n\t }\n\t });\n}\n<commit_msg>added tls_client test code<commit_after>#include <beluga\/tls\/tls_client.hpp>\n#include <beluga\/tls\/tls_reader.hpp>\n\nbeluga::tls_client::record_event::record_event(bool _continue, const tls_record record):\n continue_event(_continue),\n record(record)\n{\n}\n\nvoid beluga::tls_client::record_event::set_record(const tls_record& record)\n{\n this->record = record;\n}\nbeluga::tls_record& beluga::tls_client::record_event::get_record()\n{\n return record;\n}\nconst beluga::tls_record& beluga::tls_client::record_event::get_record() const\n{\n return record;\n}\n\nbeluga::tls_client::handshake_event::handshake_event(bool _continue, const tls_handshake& handshake):\n continue_event(_continue),\n handshake(handshake)\n{\n}\n\nvoid beluga::tls_client::handshake_event::set_handshake(const tls_handshake& handshake)\n{\n this->handshake = handshake;\n}\nbeluga::tls_handshake& beluga::tls_client::handshake_event::get_handshake()\n{\n return handshake;\n}\nconst beluga::tls_handshake& beluga::tls_client::handshake_event::get_handshake() const\n{\n return handshake;\n}\n\nbeluga::tls_client::client_hello_event::client_hello_event(bool _continue, const tls_client_hello& client_hello):\n continue_event(_continue),\n client_hello(client_hello)\n{\n}\n\nvoid beluga::tls_client::client_hello_event::set_client_hello(const tls_client_hello& client_hello)\n{\n this->client_hello = client_hello;\n}\nbeluga::tls_client_hello& beluga::tls_client::client_hello_event::get_client_hello()\n{\n return client_hello;\n}\nconst beluga::tls_client_hello& beluga::tls_client::client_hello_event::get_client_hello() const\n{\n return client_hello;\n}\n\nbeluga::tls_client::tls_client(boost::asio::ip::tcp::socket& socket):\n tcp_client(socket)\n{\n initialize();\n}\nbeluga::tls_client::tls_client(boost::asio::io_service& io_service):\n tcp_client(io_service)\n{\n initialize();\n}\n\nvoid beluga::tls_client::initialize()\n{\n std::shared_ptr<dynamic_buffer> buffer = std::make_shared<dynamic_buffer>();\n \n this->on_receive.connect\n\t([this, buffer] (tcp_client::receive_event& event)\n\t {\n\t buffer->insert(buffer->end(), event.get_buffer().begin(), event.get_buffer().end());\n\t \n\t tls_reader<dynamic_buffer::const_iterator> reader(*buffer);\n\t tls_record record;\n\n\t if(reader.read_record(record))\n\t {\n\t\t record_event record_event(true, record);\n\t\t on_record(record_event);\n\t\t \n\t\t if(record_event.get_continue())\n\t\t {\n\t\t switch(record.get_type())\n\t\t {\n\t\t case tls_record::HANDSHAKE:\n\t\t\t tls_handshake handshake;\n\t\t\t \n\t\t\t if(reader.read_handshake(handshake))\n\t\t\t {\n\t\t\t handshake_event handshake_event(true, handshake);\n\t\t\t on_handshake(handshake_event);\n\t\t\t \n\t\t\t event.set_continue(handshake_event.get_continue());\n\t\t\t }\n\n\t\t\t break;\n\t\t }\n\t\t }\n\t\t else\n\t\t event.set_continue(false);\n\t }\n\t });\n}\n<|endoftext|>"} {"text":"<commit_before>\/\/ Copyright 2022 DeepMind Technologies Limited\n\/\/\n\/\/ Licensed under the Apache License, Version 2.0 (the \"License\");\n\/\/ you may not use this file except in compliance with the License.\n\/\/ You may obtain a copy of the License at\n\/\/\n\/\/ http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n\/\/\n\/\/ Unless required by applicable law or agreed to in writing, software\n\/\/ distributed under the License is distributed on an \"AS IS\" BASIS,\n\/\/ WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n\/\/ See the License for the specific language governing permissions and\n\/\/ limitations under the License.\n\n#include \"open_spiel\/games\/2048.h\"\n\n#include <algorithm>\n#include <array>\n#include <memory>\n#include <string>\n#include <utility>\n#include <vector>\n\n#include \"open_spiel\/abseil-cpp\/absl\/strings\/str_cat.h\"\n#include \"open_spiel\/spiel_utils.h\"\n#include \"open_spiel\/utils\/tensor_view.h\"\n\nnamespace open_spiel {\nnamespace twenty_forty_eight {\nnamespace {\n\nconstexpr int kMoveUp = 0;\nconstexpr int kMoveRight = 1;\nconstexpr int kMoveDown = 2;\nconstexpr int kMoveLeft = 3;\ninline const std::vector<Action> kPlayerActions() {\n return {kMoveUp, kMoveRight, kMoveDown, kMoveLeft};\n}\n\n\/\/ Facts about the game.\nconst GameType kGameType{\/*short_name=*\/\"2048\",\n \/*long_name=*\/\"2048\",\n GameType::Dynamics::kSequential,\n GameType::ChanceMode::kExplicitStochastic,\n GameType::Information::kPerfectInformation,\n GameType::Utility::kGeneralSum,\n GameType::RewardModel::kTerminal,\n \/*max_num_players=*\/1,\n \/*min_num_players=*\/1,\n \/*provides_information_state_string=*\/false,\n \/*provides_information_state_tensor=*\/false,\n \/*provides_observation_string=*\/true,\n \/*provides_observation_tensor=*\/true,\n {{\"max_game_length\", GameParameter(kMaxGameLength)},\n {\"max_score\", GameParameter(kMaxScore)}}};\n\nstd::shared_ptr<const Game> Factory(const GameParameters& params) {\n return std::shared_ptr<const Game>(new TwentyFortyEightGame(params));\n}\n\nREGISTER_SPIEL_GAME(kGameType, Factory);\n} \/\/ namespace\n\nTwentyFortyEightState::TwentyFortyEightState(std::shared_ptr<const Game> game)\n : State(game),\n board_(std::vector<Tile>(kRows * kColumns, Tile(0, false)))\n {}\n\nvoid TwentyFortyEightState::SetCustomBoard(const std::vector<int>& board_seq) {\n current_player_ = 0;\n for (int r = 0; r < kRows; r++) {\n for (int c = 0; c < kColumns; c++) {\n SetBoard(r, c, Tile(board_seq[r * kRows + c], false));\n }\n }\n}\n\nChanceAction TwentyFortyEightState\n ::SpielActionToChanceAction(Action action) const {\n std::vector<int> values = UnrankActionMixedBase(\n action, {kRows, kColumns, kChanceTiles.size()});\n return ChanceAction(values[0], values[1], values[2]);\n}\n\nAction TwentyFortyEightState\n ::ChanceActionToSpielAction(ChanceAction move) const {\n std::vector<int> action_bases = {kRows, kColumns, \n kChanceTiles.size()};\n return RankActionMixedBase(\n action_bases, {move.row, move.column, move.is_four});\n}\n\nstd::vector<std::vector<int>> TwentyFortyEightState\n ::BuildTraversals(int direction) const {\n std::vector<int> x, y;\n for (int pos = 0; pos < kRows; pos++) {\n x.push_back(pos); \n }\n for (int pos = 0; pos < kColumns; pos++) {\n y.push_back(pos); \n }\n switch (direction) {\n case kMoveRight:\n reverse(x.begin(), x.end());\n reverse(y.begin(), y.end());\n break;\n case kMoveLeft:\n case kMoveDown:\n reverse(x.begin(), x.end());\n break;\n }\n return {x, y};\n};\n\nbool TwentyFortyEightState::WithinBounds(int r, int c) const {\n return r >= 0 && r < kRows && c >= 0 && c < kColumns;\n};\n\nbool TwentyFortyEightState::CellAvailable(int r, int c) const {\n return BoardAt(r, c).value == 0;\n}\n\nCoordinate GetVector(int direction) {\n switch (direction) {\n case kMoveUp:\n return Coordinate(-1, 0); \n case kMoveRight:\n return Coordinate(0, 1);\n case kMoveDown:\n return Coordinate(1, 0);\n case kMoveLeft:\n return Coordinate(0, -1);\n }\n}\n\nstd::vector<Coordinate> TwentyFortyEightState\n ::FindFarthestPosition(int r, int c, int direction) const { \n \/\/ Progress towards the vector direction until an obstacle is found\n Coordinate prev = Coordinate(r, c);\n do {\n prev = Coordinate(r, c);\n Coordinate direction_diff = GetVector(direction);\n r += direction_diff.row;\n c += direction_diff.column;\n } while (WithinBounds(r, c) && CellAvailable(r, c));\n return std::vector<Coordinate> {prev,\n Coordinate(r, c)};\n};\n\n\/\/ Check for available matches between tiles (more expensive check)\nbool TwentyFortyEightState::TileMatchesAvailable() const {\n for (int r = 0; r < kRows; r++) {\n for (int c = 0; c < kColumns; c++) {\n int tile = BoardAt(r, c).value;\n if (tile > 0) {\n for (int direction = 0; direction < 4; direction++) {\n Coordinate vector = GetVector(direction);\n int other = GetCellContent(r + vector.row, c + vector.column);\n if (other > 0 && other == tile) {\n return true; \/\/ These two tiles can be merged\n }\n }\n }\n }\n }\n return false;\n};\n\nvoid TwentyFortyEightState::PrepareTiles() {\n for (int r = 0; r < kRows; r++) {\n for (int c = 0; c < kColumns; c++) {\n Tile tile = BoardAt(r, c);\n if (tile.is_merged) {\n SetBoard(r, c, Tile(tile.value, false));\n }\n }\n } \n};\n\nint TwentyFortyEightState::GetCellContent(int r, int c) const {\n if (!WithinBounds(r, c))\n return 0;\n return BoardAt(r, c).value;\n}\n\nvoid TwentyFortyEightState::DoApplyAction(Action action) {\n if (IsChanceNode()) {\n \/\/ The original 2048 game starts with two random tiles\n if (!extra_chance_turn_) {\n current_player_ = 0;\n }\n extra_chance_turn_ = false;\n \n if (action == kNoCellAvailableAction) {\n return;\n }\n ChanceAction chance_action = SpielActionToChanceAction(action);\n SetBoard(chance_action.row, chance_action.column,\n Tile(chance_action.is_four ? kChanceTiles[1] : kChanceTiles[0], false));\n return;\n }\n action_score_ = 0;\n std::vector<std::vector<int>> traversals = BuildTraversals(action);\n PrepareTiles();\n for (int r : traversals[0]) {\n for (int c : traversals[1]) {\n int tile = GetCellContent(r, c);\n if (tile > 0) {\n bool moved = false;\n std::vector<Coordinate> positions = FindFarthestPosition(r, c, action);\n Coordinate farthest_pos = positions[0];\n Coordinate next_pos = positions[1];\n int next_cell = GetCellContent(next_pos.row, next_pos.column);\n if (next_cell > 0 && next_cell == tile\n && !BoardAt(next_pos.row, next_pos.column).is_merged) {\n int merged = tile * 2;\n action_score_ += merged;\n SetBoard(next_pos.row, next_pos.column, Tile(merged, true));\n moved = true;\n } else if (farthest_pos.row != r || farthest_pos.column != c){\n SetBoard(farthest_pos.row, farthest_pos.column, Tile(tile, false));\n moved = true;\n }\n if (moved) {\n SetBoard(r, c, Tile(0, false));\n current_player_ = kChancePlayerId;\n } \n }\n }\n } \n total_score_ += action_score_;\n}\n\nstd::string TwentyFortyEightState::ActionToString(Player player,\n Action action_id) const {\n if (IsChanceNode()) {\n if (action_id == kNoCellAvailableAction) {\n return \"No Cell Available\";\n }\n ChanceAction chance_action = SpielActionToChanceAction(action_id);\n return absl::StrCat(std::to_string(chance_action.is_four ? 4 : 2), \n \" added to row \", std::to_string(chance_action.row + 1),\n \", column \", std::to_string(chance_action.column + 1));\n }\n switch (action_id) {\n case kMoveUp:\n return \"Up\";\n case kMoveRight:\n return \"Right\";\n case kMoveDown:\n return \"Down\";\n case kMoveLeft:\n return \"Left\";\n default:\n return \"Invalid action\";\n } \n}\n\nint TwentyFortyEightState::AvailableCellCount() const {\n int count = 0;\n for (int r = 0; r < kRows; r++) {\n for (int c = 0; c < kColumns; c++) {\n if (BoardAt(r, c).value == 0) {\n count++;\n }\n }\n }\n return count;\n}\n\nActionsAndProbs TwentyFortyEightState::ChanceOutcomes() const { \n int count = AvailableCellCount();\n if (count == 0) {\n return {{kNoCellAvailableAction, 1.0}}; \n }\n ActionsAndProbs action_and_probs;\n action_and_probs.reserve(count * 2);\n for (int r = 0; r < kRows; r++) {\n for (int c = 0; c < kColumns; c++) {\n if (BoardAt(r, c).value == 0) {\n \/\/ 2 appearing randomly on the board should be 9 times as likely as a 4\n action_and_probs.emplace_back(ChanceActionToSpielAction(\n ChanceAction(r, c, false)), .9 \/ count);\n action_and_probs.emplace_back(ChanceActionToSpielAction(\n ChanceAction(r, c, true)), .1 \/ count);\n } \n }\n } \n return action_and_probs;\n}\n\nstd::vector<Action> TwentyFortyEightState::LegalActions() const {\n if (IsTerminal()) {\n return {};\n }\n if (IsChanceNode()) {\n return LegalChanceOutcomes();\n }\n return kPlayerActions();\n}\n\nbool TwentyFortyEightState::InBounds(int row, int column) const {\n return (row >= 0 && row < kRows && column >= 0\n && column < kColumns);\n}\n\nstd::string TwentyFortyEightState::ToString() const { \n std::string str;\n for (int r = 0; r < kRows; ++r) {\n for (int c = 0; c < kColumns; ++c) {\n std::string tile = std::to_string(BoardAt(r, c).value);\n absl::StrAppend(&str, std::string(5 - tile.length(), ' '));\n absl::StrAppend(&str, tile);\n }\n absl::StrAppend(&str, \"\\n\");\n }\n return str; \n}\n\nbool TwentyFortyEightState::IsTerminal() const {\n return Reached2048() \n || (AvailableCellCount() == 0 && !TileMatchesAvailable());\n}\n\nbool TwentyFortyEightState::Reached2048() const {\n for (int r = 0; r < kRows; r++) {\n for (int c = 0; c < kColumns; c++) {\n if (BoardAt(r, c).value == 2048) {\n return true;\n }\n }\n }\n return false;\n}\n\nstd::vector<double> TwentyFortyEightState::Rewards() const {\n return {action_score_};\n}\n\nstd::vector<double> TwentyFortyEightState::Returns() const {\n return {total_score_};\n}\n\nstd::string TwentyFortyEightState::InformationStateString(Player player) const {\n SPIEL_CHECK_GE(player, 0);\n SPIEL_CHECK_LT(player, num_players_);\n return HistoryString();\n}\n\nstd::string TwentyFortyEightState::ObservationString(Player player) const {\n SPIEL_CHECK_GE(player, 0);\n SPIEL_CHECK_LT(player, num_players_);\n return ToString();\n}\n\nvoid TwentyFortyEightState::ObservationTensor(Player player,\n absl::Span<float> values) const {\n SPIEL_CHECK_GE(player, 0);\n SPIEL_CHECK_LT(player, num_players_);\n TensorView<2> view(values, {kRows, kColumns}, true);\n for (int row = 0; row < kRows; row++) {\n for (int column = 0; column < kColumns; column++) {\n view[{row, column}] = BoardAt(row, column).value;\n }\n }\n}\n\nvoid TwentyFortyEightState::UndoAction(Player player, Action action) { \n history_.pop_back();\n}\n\nTwentyFortyEightGame::TwentyFortyEightGame(const GameParameters& params)\n : Game(kGameType, params),\n max_game_length_(ParameterValue<int>(\"max_game_length\")),\n max_score_(ParameterValue<int>(\"max_score\")) {}\n\nint TwentyFortyEightGame::NumDistinctActions() const {\n return kPlayerActions().size();\n}\n\n} \/\/ namespace twenty_forty_eight\n} \/\/ namespace open_spiel\n<commit_msg>Fixed wrap<commit_after>\/\/ Copyright 2022 DeepMind Technologies Limited\n\/\/\n\/\/ Licensed under the Apache License, Version 2.0 (the \"License\");\n\/\/ you may not use this file except in compliance with the License.\n\/\/ You may obtain a copy of the License at\n\/\/\n\/\/ http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n\/\/\n\/\/ Unless required by applicable law or agreed to in writing, software\n\/\/ distributed under the License is distributed on an \"AS IS\" BASIS,\n\/\/ WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n\/\/ See the License for the specific language governing permissions and\n\/\/ limitations under the License.\n\n#include \"open_spiel\/games\/2048.h\"\n\n#include <algorithm>\n#include <array>\n#include <memory>\n#include <string>\n#include <utility>\n#include <vector>\n\n#include \"open_spiel\/abseil-cpp\/absl\/strings\/str_cat.h\"\n#include \"open_spiel\/spiel_utils.h\"\n#include \"open_spiel\/utils\/tensor_view.h\"\n\nnamespace open_spiel {\nnamespace twenty_forty_eight {\nnamespace {\n\nconstexpr int kMoveUp = 0;\nconstexpr int kMoveRight = 1;\nconstexpr int kMoveDown = 2;\nconstexpr int kMoveLeft = 3;\ninline const std::vector<Action> kPlayerActions() {\n return {kMoveUp, kMoveRight, kMoveDown, kMoveLeft};\n}\n\n\/\/ Facts about the game.\nconst GameType kGameType{\/*short_name=*\/\"2048\",\n \/*long_name=*\/\"2048\",\n GameType::Dynamics::kSequential,\n GameType::ChanceMode::kExplicitStochastic,\n GameType::Information::kPerfectInformation,\n GameType::Utility::kGeneralSum,\n GameType::RewardModel::kTerminal,\n \/*max_num_players=*\/1,\n \/*min_num_players=*\/1,\n \/*provides_information_state_string=*\/false,\n \/*provides_information_state_tensor=*\/false,\n \/*provides_observation_string=*\/true,\n \/*provides_observation_tensor=*\/true,\n {{\"max_game_length\", GameParameter(kMaxGameLength)},\n {\"max_score\", GameParameter(kMaxScore)}}};\n\nstd::shared_ptr<const Game> Factory(const GameParameters& params) {\n return std::shared_ptr<const Game>(new TwentyFortyEightGame(params));\n}\n\nREGISTER_SPIEL_GAME(kGameType, Factory);\n} \/\/ namespace\n\nTwentyFortyEightState::TwentyFortyEightState(std::shared_ptr<const Game> game)\n : State(game),\n board_(std::vector<Tile>(kRows * kColumns, Tile(0, false)))\n {}\n\nvoid TwentyFortyEightState::SetCustomBoard(const std::vector<int>& board_seq) {\n current_player_ = 0;\n for (int r = 0; r < kRows; r++) {\n for (int c = 0; c < kColumns; c++) {\n SetBoard(r, c, Tile(board_seq[r * kRows + c], false));\n }\n }\n}\n\nChanceAction TwentyFortyEightState\n ::SpielActionToChanceAction(Action action) const {\n std::vector<int> values = UnrankActionMixedBase(\n action, {kRows, kColumns, kChanceTiles.size()});\n return ChanceAction(values[0], values[1], values[2]);\n}\n\nAction TwentyFortyEightState\n ::ChanceActionToSpielAction(ChanceAction move) const {\n std::vector<int> action_bases = {kRows, kColumns, \n kChanceTiles.size()};\n return RankActionMixedBase(\n action_bases, {move.row, move.column, move.is_four});\n}\n\nstd::vector<std::vector<int>> TwentyFortyEightState\n ::BuildTraversals(int direction) const {\n std::vector<int> x, y;\n for (int pos = 0; pos < kRows; pos++) {\n x.push_back(pos); \n }\n for (int pos = 0; pos < kColumns; pos++) {\n y.push_back(pos); \n }\n switch (direction) {\n case kMoveRight:\n reverse(x.begin(), x.end());\n reverse(y.begin(), y.end());\n break;\n case kMoveLeft:\n case kMoveDown:\n reverse(x.begin(), x.end());\n break;\n }\n return {x, y};\n};\n\nbool TwentyFortyEightState::WithinBounds(int r, int c) const {\n return r >= 0 && r < kRows && c >= 0 && c < kColumns;\n};\n\nbool TwentyFortyEightState::CellAvailable(int r, int c) const {\n return BoardAt(r, c).value == 0;\n}\n\nCoordinate GetVector(int direction) {\n switch (direction) {\n case kMoveUp:\n return Coordinate(-1, 0); \n case kMoveRight:\n return Coordinate(0, 1);\n case kMoveDown:\n return Coordinate(1, 0);\n case kMoveLeft:\n return Coordinate(0, -1);\n }\n}\n\nstd::vector<Coordinate> TwentyFortyEightState\n ::FindFarthestPosition(int r, int c, int direction) const { \n \/\/ Progress towards the vector direction until an obstacle is found\n Coordinate prev = Coordinate(r, c);\n do {\n prev = Coordinate(r, c);\n Coordinate direction_diff = GetVector(direction);\n r += direction_diff.row;\n c += direction_diff.column;\n } while (WithinBounds(r, c) && CellAvailable(r, c));\n return std::vector<Coordinate> {prev, Coordinate(r, c)};\n};\n\n\/\/ Check for available matches between tiles (more expensive check)\nbool TwentyFortyEightState::TileMatchesAvailable() const {\n for (int r = 0; r < kRows; r++) {\n for (int c = 0; c < kColumns; c++) {\n int tile = BoardAt(r, c).value;\n if (tile > 0) {\n for (int direction = 0; direction < 4; direction++) {\n Coordinate vector = GetVector(direction);\n int other = GetCellContent(r + vector.row, c + vector.column);\n if (other > 0 && other == tile) {\n return true; \/\/ These two tiles can be merged\n }\n }\n }\n }\n }\n return false;\n};\n\nvoid TwentyFortyEightState::PrepareTiles() {\n for (int r = 0; r < kRows; r++) {\n for (int c = 0; c < kColumns; c++) {\n Tile tile = BoardAt(r, c);\n if (tile.is_merged) {\n SetBoard(r, c, Tile(tile.value, false));\n }\n }\n } \n};\n\nint TwentyFortyEightState::GetCellContent(int r, int c) const {\n if (!WithinBounds(r, c))\n return 0;\n return BoardAt(r, c).value;\n}\n\nvoid TwentyFortyEightState::DoApplyAction(Action action) {\n if (IsChanceNode()) {\n \/\/ The original 2048 game starts with two random tiles\n if (!extra_chance_turn_) {\n current_player_ = 0;\n }\n extra_chance_turn_ = false;\n \n if (action == kNoCellAvailableAction) {\n return;\n }\n ChanceAction chance_action = SpielActionToChanceAction(action);\n SetBoard(chance_action.row, chance_action.column,\n Tile(chance_action.is_four ? kChanceTiles[1] : kChanceTiles[0], false));\n return;\n }\n action_score_ = 0;\n std::vector<std::vector<int>> traversals = BuildTraversals(action);\n PrepareTiles();\n for (int r : traversals[0]) {\n for (int c : traversals[1]) {\n int tile = GetCellContent(r, c);\n if (tile > 0) {\n bool moved = false;\n std::vector<Coordinate> positions = FindFarthestPosition(r, c, action);\n Coordinate farthest_pos = positions[0];\n Coordinate next_pos = positions[1];\n int next_cell = GetCellContent(next_pos.row, next_pos.column);\n if (next_cell > 0 && next_cell == tile\n && !BoardAt(next_pos.row, next_pos.column).is_merged) {\n int merged = tile * 2;\n action_score_ += merged;\n SetBoard(next_pos.row, next_pos.column, Tile(merged, true));\n moved = true;\n } else if (farthest_pos.row != r || farthest_pos.column != c){\n SetBoard(farthest_pos.row, farthest_pos.column, Tile(tile, false));\n moved = true;\n }\n if (moved) {\n SetBoard(r, c, Tile(0, false));\n current_player_ = kChancePlayerId;\n } \n }\n }\n } \n total_score_ += action_score_;\n}\n\nstd::string TwentyFortyEightState::ActionToString(Player player,\n Action action_id) const {\n if (IsChanceNode()) {\n if (action_id == kNoCellAvailableAction) {\n return \"No Cell Available\";\n }\n ChanceAction chance_action = SpielActionToChanceAction(action_id);\n return absl::StrCat(std::to_string(chance_action.is_four ? 4 : 2), \n \" added to row \", std::to_string(chance_action.row + 1),\n \", column \", std::to_string(chance_action.column + 1));\n }\n switch (action_id) {\n case kMoveUp:\n return \"Up\";\n case kMoveRight:\n return \"Right\";\n case kMoveDown:\n return \"Down\";\n case kMoveLeft:\n return \"Left\";\n default:\n return \"Invalid action\";\n } \n}\n\nint TwentyFortyEightState::AvailableCellCount() const {\n int count = 0;\n for (int r = 0; r < kRows; r++) {\n for (int c = 0; c < kColumns; c++) {\n if (BoardAt(r, c).value == 0) {\n count++;\n }\n }\n }\n return count;\n}\n\nActionsAndProbs TwentyFortyEightState::ChanceOutcomes() const { \n int count = AvailableCellCount();\n if (count == 0) {\n return {{kNoCellAvailableAction, 1.0}}; \n }\n ActionsAndProbs action_and_probs;\n action_and_probs.reserve(count * 2);\n for (int r = 0; r < kRows; r++) {\n for (int c = 0; c < kColumns; c++) {\n if (BoardAt(r, c).value == 0) {\n \/\/ 2 appearing randomly on the board should be 9 times as likely as a 4\n action_and_probs.emplace_back(ChanceActionToSpielAction(\n ChanceAction(r, c, false)), .9 \/ count);\n action_and_probs.emplace_back(ChanceActionToSpielAction(\n ChanceAction(r, c, true)), .1 \/ count);\n } \n }\n } \n return action_and_probs;\n}\n\nstd::vector<Action> TwentyFortyEightState::LegalActions() const {\n if (IsTerminal()) {\n return {};\n }\n if (IsChanceNode()) {\n return LegalChanceOutcomes();\n }\n return kPlayerActions();\n}\n\nbool TwentyFortyEightState::InBounds(int row, int column) const {\n return (row >= 0 && row < kRows && column >= 0\n && column < kColumns);\n}\n\nstd::string TwentyFortyEightState::ToString() const { \n std::string str;\n for (int r = 0; r < kRows; ++r) {\n for (int c = 0; c < kColumns; ++c) {\n std::string tile = std::to_string(BoardAt(r, c).value);\n absl::StrAppend(&str, std::string(5 - tile.length(), ' '));\n absl::StrAppend(&str, tile);\n }\n absl::StrAppend(&str, \"\\n\");\n }\n return str; \n}\n\nbool TwentyFortyEightState::IsTerminal() const {\n return Reached2048() \n || (AvailableCellCount() == 0 && !TileMatchesAvailable());\n}\n\nbool TwentyFortyEightState::Reached2048() const {\n for (int r = 0; r < kRows; r++) {\n for (int c = 0; c < kColumns; c++) {\n if (BoardAt(r, c).value == 2048) {\n return true;\n }\n }\n }\n return false;\n}\n\nstd::vector<double> TwentyFortyEightState::Rewards() const {\n return {action_score_};\n}\n\nstd::vector<double> TwentyFortyEightState::Returns() const {\n return {total_score_};\n}\n\nstd::string TwentyFortyEightState::InformationStateString(Player player) const {\n SPIEL_CHECK_GE(player, 0);\n SPIEL_CHECK_LT(player, num_players_);\n return HistoryString();\n}\n\nstd::string TwentyFortyEightState::ObservationString(Player player) const {\n SPIEL_CHECK_GE(player, 0);\n SPIEL_CHECK_LT(player, num_players_);\n return ToString();\n}\n\nvoid TwentyFortyEightState::ObservationTensor(Player player,\n absl::Span<float> values) const {\n SPIEL_CHECK_GE(player, 0);\n SPIEL_CHECK_LT(player, num_players_);\n TensorView<2> view(values, {kRows, kColumns}, true);\n for (int row = 0; row < kRows; row++) {\n for (int column = 0; column < kColumns; column++) {\n view[{row, column}] = BoardAt(row, column).value;\n }\n }\n}\n\nvoid TwentyFortyEightState::UndoAction(Player player, Action action) { \n history_.pop_back();\n}\n\nTwentyFortyEightGame::TwentyFortyEightGame(const GameParameters& params)\n : Game(kGameType, params),\n max_game_length_(ParameterValue<int>(\"max_game_length\")),\n max_score_(ParameterValue<int>(\"max_score\")) {}\n\nint TwentyFortyEightGame::NumDistinctActions() const {\n return kPlayerActions().size();\n}\n\n} \/\/ namespace twenty_forty_eight\n} \/\/ namespace open_spiel\n<|endoftext|>"} {"text":"<commit_before>#include <iostream>\n#include <fstream>\n#include <boost\/program_options.hpp>\n#include <iomanip>\n\nstd::string filename = \"\/tmp\/pending-rollback.rewind\";\n\nnamespace po = boost::program_options;\n\nvoid run(char change_command[], char rollback_command[], int timeout);\nvoid keep();\nvoid print_usage(char *argv[], po::options_description desc);\nvoid create_file(char change_command[]);\nbool file_exists();\nvoid delete_file();\n\nint main(int argc, char *argv[]) {\n int timeout = 30;\n\n po::options_description desc(\"Allowed options\");\n desc.add_options()(\"timeout,t\", po::value<int>(&timeout)->default_value(timeout),\n \"Timeout before rollback command is executed\");\n po::variables_map vm;\n try {\n po::store(po::command_line_parser(argc, argv).options(desc).run(), vm);\n } catch (po::unknown_option e) {\n std::cout << \"Unknown option\" << std::endl;\n print_usage(argv, desc);\n return 0;\n } catch (po::invalid_option_value e) {\n std::cout << \"Invalid value for option\" << std::endl;\n print_usage(argv, desc);\n return 0;\n }\n po::notify(vm);\n\n if (argc < 2) {\n std::cout << \"You must supply an action to be performed\" << std::endl;\n print_usage(argv, desc);\n return 0;\n }\n\n std::string mode(argv[1]);\n\n if (mode == \"run\") {\n char *change_command = argv[2];\n char *rollback_command = argv[3];\n if (argc < 4 || strlen(change_command) == 0 || strlen(rollback_command) == 0) {\n std::cout << \"Must provide both a change command and a rollback command\" << std::endl;\n print_usage(argv, desc);\n return 1;\n }\n\n if (timeout < 1) {\n std::cout << \"Timeout must be at least 1\" << std::endl;\n print_usage(argv, desc);\n return 1;\n }\n\n run(change_command, rollback_command, timeout);\n } else if(mode == \"keep\") {\n keep();\n } else {\n print_usage(argv, desc);\n }\n\n return 0;\n}\n\nvoid print_usage(char *argv[], po::options_description desc) {\n std::cout << \"Usage:\" << std::endl;\n std::cout << \" Run a new command:\\t\" << argv[0] << \" run <change command> <rollback command> [options]\" << std::endl;\n std::cout << \" Stop rollback:\\t\" << argv[0] << \" keep\" << std::endl;\n std::cout << desc << std::endl;\n}\n\nvoid run(char change_command[], char rollback_command[], int timeout) {\n create_file(change_command);\n system(change_command);\n daemon(1, 0);\n sleep(timeout);\n\n if (file_exists()) {\n system(rollback_command);\n delete_file();\n }\n}\n\nvoid keep() {\n delete_file();\n std::cout << \"Rollback aborted, changes will be kept!\" << std::endl;\n}\n\nvoid create_file(char change_command[]) {\n \/\/ Check if the file from an old run exists, if so ask the user to confirm\n \/\/ deletion\n std::ifstream inf(filename);\n if (inf.good()) {\n std::string timestamp;\n std::string command;\n std::getline(inf, timestamp);\n std::getline(inf, command);\n\n std::cout << \"Detected a pending rollback for command \\\"\" << command;\n std::cout << \"\\\" started at \" << timestamp << std::endl;\n\n std::cout << \"This may be an error, you may cancel the rollback and \";\n std::cout << \"proceed with this run however if the previous run is \";\n std::cout << \"still active then it will not be rolled back.\" << std::endl;\n\n std::cout << \"Cancel previous rollback and start this run? (y\/N): \" << std::flush;\n char response = std::cin.get();\n if (response != 'y' && response != 'Y') {\n std::cout << \"Aborting run!\" << std::endl;\n return;\n }\n }\n\n auto t = std::time(nullptr);\n auto tm = *std::localtime(&t);\n std::ofstream outf(filename);\n outf << std::put_time(&tm, \"%Y-%m-%d %H-%M-%S\") << std::endl;\n outf << change_command << std::endl;\n}\n\nvoid delete_file() {\n std::remove(filename.c_str());\n}\n\nbool file_exists() {\n std::ifstream f(filename);\n return f.good();\n}\n<commit_msg>Tweaked comments<commit_after>#include <iostream>\n#include <fstream>\n#include <boost\/program_options.hpp>\n#include <iomanip>\n\nstd::string filename = \"\/tmp\/pending-rollback.rewind\";\n\nnamespace po = boost::program_options;\n\nvoid run(char change_command[], char rollback_command[], int timeout);\nvoid keep();\nvoid print_usage(char *argv[], po::options_description desc);\nvoid create_file(char change_command[]);\nbool file_exists();\nvoid delete_file();\n\nint main(int argc, char *argv[]) {\n int timeout = 30;\n\n po::options_description desc(\"Allowed options\");\n desc.add_options()(\"timeout,t\", po::value<int>(&timeout)->default_value(timeout),\n \"Timeout before rollback command is executed\");\n po::variables_map vm;\n try {\n po::store(po::command_line_parser(argc, argv).options(desc).run(), vm);\n } catch (po::unknown_option e) {\n std::cout << \"Unknown option\" << std::endl;\n print_usage(argv, desc);\n return 0;\n } catch (po::invalid_option_value e) {\n std::cout << \"Invalid value for option\" << std::endl;\n print_usage(argv, desc);\n return 0;\n }\n po::notify(vm);\n\n if (argc < 2) {\n std::cout << \"You must supply an action to be performed\" << std::endl;\n print_usage(argv, desc);\n return 0;\n }\n\n std::string mode(argv[1]);\n\n if (mode == \"run\") {\n char *change_command = argv[2];\n char *rollback_command = argv[3];\n if (argc < 4 || strlen(change_command) == 0 || strlen(rollback_command) == 0) {\n std::cout << \"Must provide both a change command and a rollback command\" << std::endl;\n print_usage(argv, desc);\n return 1;\n }\n\n if (timeout < 1) {\n std::cout << \"Timeout must be at least 1\" << std::endl;\n print_usage(argv, desc);\n return 1;\n }\n\n run(change_command, rollback_command, timeout);\n } else if(mode == \"keep\") {\n keep();\n } else {\n print_usage(argv, desc);\n }\n\n return 0;\n}\n\nvoid print_usage(char *argv[], po::options_description desc) {\n std::cout << \"Usage:\" << std::endl;\n std::cout << \" Run a new command:\\t\" << argv[0] << \" run <change command> <rollback command> [options]\" << std::endl;\n std::cout << \" Stop rollback:\\t\" << argv[0] << \" keep\" << std::endl;\n std::cout << desc << std::endl;\n}\n\nvoid run(char change_command[], char rollback_command[], int timeout) {\n create_file(change_command);\n system(change_command);\n daemon(1, 0); \/\/ Do not change CWD, redirect output to \/dev\/null\n sleep(timeout);\n\n if (file_exists()) {\n system(rollback_command);\n delete_file();\n }\n}\n\nvoid keep() {\n delete_file();\n std::cout << \"Rollback aborted, changes will be kept!\" << std::endl;\n}\n\nvoid create_file(char change_command[]) {\n std::ifstream inf(filename);\n if (inf.good()) {\n std::string timestamp;\n std::string command;\n std::getline(inf, timestamp);\n std::getline(inf, command);\n\n std::cout << \"Detected a pending rollback for command \\\"\" << command;\n std::cout << \"\\\" started at \" << timestamp << std::endl;\n\n std::cout << \"This may be an error, you may cancel the rollback and \";\n std::cout << \"proceed with this run however if the previous run is \";\n std::cout << \"still active then it will not be rolled back.\" << std::endl;\n\n std::cout << \"Cancel previous rollback and start this run? (y\/N): \" << std::flush;\n char response = std::cin.get();\n if (response != 'y' && response != 'Y') {\n std::cout << \"Aborting run!\" << std::endl;\n return;\n }\n }\n\n auto t = std::time(nullptr);\n auto tm = *std::localtime(&t);\n std::ofstream outf(filename);\n outf << std::put_time(&tm, \"%Y-%m-%d %H-%M-%S\") << std::endl;\n outf << change_command << std::endl;\n}\n\nvoid delete_file() {\n std::remove(filename.c_str());\n}\n\nbool file_exists() {\n std::ifstream f(filename);\n return f.good();\n}\n<|endoftext|>"} {"text":"<commit_before>#include <cstdlib>\n#include <cerrno>\n#include <cstring>\n#include <cstdio>\n#include <cassert>\n#include \"ring.hpp\"\n#include <stdint.h>\n#include <QFile>\n\n#define DEFAULTBUFFERSIZE 1024\n#define DEFAULTMUTATIONINTERVAL 16\n\nint main(int argc, char* argv[])\n{\n\tchar inputFile[256+1];\n\tchar outputFile[256+1];\n\tchar key[MAPSIZE+1];\n\tchar salt[IVSIZE];\n\tchar mutationInterval[4+1];\n\tchar buffer[6+1];\n\tchar keyFile[256+1];\n\tbool inputSet = false;\n\tbool outputSet = false;\n\tbool keySet = false;\n\tbool encode = false;\n\tbool decode = false;\n\tbool mutationIntervalSet = false;\n\tbool bufferSet = false;\n\tbool keyFileSet = false;\n\tbool verbose = false;\n\tbool removeSet = false;\n\tfor (int i=0; i<argc; i++)\/\/collect arguments from cmdline\n\t{\n\t\tif (strcmp(argv[i], \"-in\") == 0 || strcmp(argv[i], \"-i\") == 0)\n\t\t{\n\t\t\ti++;\n\t\t\tif (i < argc)\n\t\t\t{\n\t\t\t\tif (strlen(argv[i]) <= 256)\n\t\t\t\t{\n\t\t\t\t\tstrcpy(inputFile, argv[i]);\n\t\t\t\t\tinputSet = true;\n\t\t\t\t}\n\t\t\t}\n\t\t\tcontinue;\n\t\t}\n\t\tif (strcmp(argv[i], \"-out\") == 0 || strcmp(argv[i], \"-o\") == 0)\n\t\t{\n\t\t\ti++;\n\t\t\tif (i < argc)\n\t\t\t{\n\t\t\t\tif (strlen(argv[i]) <= 256)\n\t\t\t\t{\n\t\t\t\t\tstrcpy(outputFile, argv[i]);\n\t\t\t\t\toutputSet = true;\n\t\t\t\t}\n\t\t\t}\n\t\t\tcontinue;\n\t\t}\n\t\tif (strcmp(argv[i], \"-password\") == 0 || strcmp(argv[i], \"-p\") == 0)\n\t\t{\n\t\t\ti++;\n\t\t\tif (i < argc)\n\t\t\t{\n\t\t\t\tif (strlen(argv[i]) <= 256)\n\t\t\t\t{\n\t\t\t\t\tstrcpy(key, argv[i]);\n\t\t\t\t\tkeySet = true;\n\t\t\t\t}\n\t\t\t}\n\t\t\tcontinue;\n\t\t}\n\t\tif (strcmp(argv[i], \"-key\") == 0 || strcmp(argv[i], \"-k\") == 0)\n\t\t{\n\t\t\ti++;\n\t\t\tif (i < argc)\n\t\t\t{\n\t\t\t\tif (strlen(argv[i]) <= 256)\n\t\t\t\t{\n\t\t\t\t\tstrcpy(keyFile, argv[i]);\n\t\t\t\t\tkeyFileSet = true;\n\t\t\t\t}\n\t\t\t}\n\t\t\tcontinue;\n\t\t}\n\t\tif (strcmp(argv[i], \"-encode\") == 0 || strcmp(argv[i], \"-e\") == 0)\n\t\t{\n\t\t\tencode = true;\n\t\t\tcontinue;\n\t\t}\n\t\tif (strcmp(argv[i], \"-decode\") == 0 || strcmp(argv[i], \"-d\") == 0)\n\t\t{\n\t\t\tdecode = true;\n\t\t\tcontinue;\n\t\t}\n\t\tif (strcmp(argv[i], \"-verbose\") == 0 || strcmp(argv[i], \"-v\") == 0)\n\t\t{\n\t\t\tverbose = true;\n\t\t\tcontinue;\n\t\t}\n\t\tif (strcmp(argv[i], \"-remove\") == 0 || strcmp(argv[i], \"-r\") == 0)\n\t\t{\n\t\t\tremoveSet = true;\n\t\t\tcontinue;\n\t\t}\n\t\tif (strcmp(argv[i], \"-mutation\") == 0 || strcmp(argv[i], \"-m\") == 0)\n\t\t{\n\t\t\ti++;\n\t\t\tif (i < argc)\n\t\t\t{\n\t\t\t\tif (strlen(argv[i]) <= 4)\n\t\t\t\t{\n\t\t\t\t\tstrcpy(mutationInterval, argv[i]);\n\t\t\t\t\tmutationIntervalSet = true;\n\t\t\t\t}\n\t\t\t}\n\t\t\tcontinue;\n\t\t}\n\t\tif (strcmp(argv[i], \"-buffer\") == 0 || strcmp(argv[i], \"-b\") == 0)\n\t\t{\n\t\t\ti++;\n\t\t\tif (i < argc)\n\t\t\t{\n\t\t\t\tif (strlen(argv[i]) <= 6)\n\t\t\t\t{\n\t\t\t\t\tstrcpy(buffer, argv[i]);\n\t\t\t\t\tbufferSet = true;\n\t\t\t\t}\n\t\t\t}\n\t\t\tcontinue;\n\t\t}\n\t\tif (strcmp(argv[i], \"-help\") == 0 || strcmp(argv[i], \"-h\") == 0)\n\t\t{\n\t\t\tprintf(\"%s [-e|-d] [-i <inputfile>] [-o <outputfile>] [-p <password> | -k <keyfile>] [-m <mutationInterval>] [-b <buffersize>] [-v] [-r] [-h]\\n\", argv[0]);\n\t\t\tprintf(\"\\n\");\n\t\t\tprintf(\"Encodes or decodes a single file.\\n\");\n\t\t\tprintf(\"\\n\");\n\t\t\tprintf(\"-e\\n\");\n\t\t\tprintf(\"-encode\\n\");\n\t\t\tprintf(\"\\tdefault\\n\");\n\t\t\tprintf(\"\\toptional\\n\");\n\t\t\tprintf(\"\\tSpecifies the mode as \\\"encode\\\".\\n\");\n\t\t\tprintf(\"\\n\");\n\t\t\tprintf(\"-d\\n\");\n\t\t\tprintf(\"-decode\\n\");\n\t\t\tprintf(\"\\toptional\\n\");\n\t\t\tprintf(\"\\tSpecifies the mode as \\\"decode\\\".\\n\");\n\t\t\tprintf(\"\\n\");\n\t\t\tprintf(\"-i <inputfile>\\n\");\n\t\t\tprintf(\"-in <inputfile>\\n\");\n\t\t\tprintf(\"\\tmust\\n\");\n\t\t\tprintf(\"\\tSpecifies the inputfile.\\n\");\n\t\t\tprintf(\"\\n\");\n\t\t\tprintf(\"-o <outputfile>\\n\");\n\t\t\tprintf(\"-out <outputfile>\\n\");\n\t\t\tprintf(\"\\tmust\\n\");\n\t\t\tprintf(\"\\tSpecifies the outputfile.\\n\");\n\t\t\tprintf(\"\\n\");\n\t\t\tprintf(\"-p <password>\\n\");\n\t\t\tprintf(\"-password <password>\\n\");\n\t\t\tprintf(\"\\tmust\\n\");\n\t\t\tprintf(\"\\tSpecifies the password.\\n\");\n\t\t\tprintf(\"\\n\");\n\t\t\tprintf(\"-k <keyfile>\\n\");\n\t\t\tprintf(\"-key <keyfile>\\n\");\n\t\t\tprintf(\"\\toptional (alternative for -p)\\n\");\n\t\t\tprintf(\"\\tSpecifies a keyfile.\\n\");\n\t\t\tprintf(\"\\n\");\n\t\t\tprintf(\"-m <mutationInterval>\\n\");\n\t\t\tprintf(\"-mutation <mutationInterval>\\n\");\n\t\t\tprintf(\"\\tdefault: %u\\n\", DEFAULTMUTATIONINTERVAL);\n\t\t\tprintf(\"\\toptional\\n\");\n\t\t\tprintf(\"\\tSpecifies the mutationInterval.\\n\");\n\t\t\tprintf(\"\\n\");\n\t\t\tprintf(\"-b <buffersize>\\n\");\n\t\t\tprintf(\"-buffer <buffersize>\\n\");\n\t\t\tprintf(\"\\tdefault: %u\\n\", DEFAULTBUFFERSIZE);\n\t\t\tprintf(\"\\toptional\\n\");\n\t\t\tprintf(\"\\tSpecifies the buffersize.\\n\");\n\t\t\tprintf(\"\\n\");\n\t\t\tprintf(\"-v\\n\");\n\t\t\tprintf(\"-verbose\\n\");\n\t\t\tprintf(\"\\toptional\\n\");\n\t\t\tprintf(\"\\tMakes the program verbose.\\n\");\n\t\t\tprintf(\"\\n\");\n\t\t\tprintf(\"-r\\n\");\n\t\t\tprintf(\"-remove\\n\");\n\t\t\tprintf(\"\\toptional\\n\");\n\t\t\tprintf(\"\\tRemoves the inputfile after reading.\\n\");\n\t\t\tprintf(\"\\n\");\n\t\t\tprintf(\"-h\\n\");\n\t\t\tprintf(\"-help\\n\");\n\t\t\tprintf(\"\\toptional\\n\");\n\t\t\tprintf(\"\\tPrints this helpmessage and quits the program.\\n\");\n\t\t\treturn 0;\n\t\t}\n\t}\n\n\t\/\/evaluate arguments\n\tif (!inputSet)\n\t{\n\t\tprintf(\"You need to specify an inputfile!\\n\");\n\t\treturn -EINVAL;\n\t}\n\tif (keySet && keyFileSet)\n\t{\n\t\tprintf(\"You shall not specify a password and a keyfile!\\n\");\n\t\treturn -EINVAL;\n\t}\n\tif (!keySet && !keyFileSet)\n\t{\n\t\tprintf(\"You need to specify a password or a keyfile!\\n\");\n\t\treturn -EINVAL;\n\t}\n\tif (encode && decode)\n\t{\n\t\tprintf(\"You may only specify one mode!\\n\");\n\t\treturn -EINVAL;\n\t}\n\tif (keyFileSet)\n\t{\n\t\tQFile in(keyFile);\n\t\tif (!in.open(QIODevice::ReadOnly))\n\t\t{\n\t\t\tprintf(\"ERROR: can not open keyfile\\n\");\n\t\t\terrno = EIO;\n\t\t\treturn -errno;\n\t\t}\n\t\tunsigned int fileSize = in.size();\n\t\tif (fileSize > MAPSIZE)\n\t\t{\n\t\t\tprintf(\"ERROR: keyfile is to large to contain a single key -> invalid\\n\");\n\t\t\tin.close();\n\t\t\terrno = EMSGSIZE;\n\t\t\treturn -EMSGSIZE;\n\t\t}\n\t\tif (in.read((char*)(&key), fileSize) != fileSize)\n\t\t{\n\t\t\tin.close();\n\t\t\terrno = EIO;\n\t\t\treturn -EIO;\n\t\t}\n\t\tkey[fileSize] = '\\0';\n\t\tin.close();\n\t\tprintf(\"Password read from keyfile.\\n\");\n\t}\n\tif (!encode && !decode)\n\t{\n\t\tencode = true;\n\t\tprintf(\"No mode specified... using \\\"encodemode\\\".\\n\");\n\t}\n\tif (!outputSet)\n\t{\n\t\tstrcpy(outputFile, inputFile);\n\t\tif (encode)\n\t\t{\n\t\t\tstrcat(outputFile, \".enc\");\n\t\t}\n\t\telse\n\t\t{\n\t\t\tstrcat(outputFile, \".dec\");\n\t\t}\n\t\tprintf(\"No outputfile specified... using \\\"%s\\\".\\n\", outputFile);\n\t}\n\tif (!mutationIntervalSet && encode)\n\t{\n\t\tsprintf(mutationInterval, \"%u\", DEFAULTMUTATIONINTERVAL);\n\t\tprintf(\"No mutationInterval specified... using \\\"%s\\\".\\n\", mutationInterval);\n\t}\n\tif (!bufferSet)\n\t{\n\t\tsprintf(buffer, \"%u\", DEFAULTBUFFERSIZE);\n\t\tprintf(\"No buffersize specified... using \\\"%s\\\".\\n\", buffer);\n\t}\n\n\t\/\/setup\n\tif (encode)\n\t{\n\t\tQFile in(\"\/dev\/urandom\");\n\t\tif (!in.open(QIODevice::ReadOnly))\n\t\t{\n\t\t\tprintf(\"ERROR: can not open \\\"\/dev\/urandom\\\"\\n\");\n\t\t\terrno = EIO;\n\t\t\treturn errno;\n\t\t}\n\t\tif (in.read((char*)(&salt), IVSIZE) != IVSIZE)\n\t\t{\n\t\t\tin.close();\n\t\t\terrno = EIO;\n\t\t\treturn -EIO;\n\t\t}\n\t\tin.close();\n\t\tprintf(\"Salt generated\\n\");\n\t}\n\tunsigned int bufferInt = atoi(buffer);\n\tunsigned int mutationIntervalInt;\n\tQFile in(inputFile);\n\tif (!in.open(QIODevice::ReadOnly))\n\t{\n\t\tprintf(\"ERROR: can not open inputfile\\n\");\n\t\terrno = EIO;\n\t\treturn -errno;\n\t}\n\tQFile out(outputFile);\n\tif (!in.open(QIODevice::WriteOnly))\n\t{\n\t\tprintf(\"ERROR: can not open outputfile\\n\");\n\t\tin.close();\n\t\terrno = EIO;\n\t\treturn errno;\n\t}\n\tunsigned int fileSize = in.size();\n\tif (encode)\n\t{\n\t\tmutationIntervalInt = atoi(mutationInterval);\n\t\tuint32_t mutationInterval32 = mutationIntervalInt;\n\t\tif (fwrite(&mutationInterval32, 1, sizeof(mutationInterval32), out) != sizeof(mutationInterval32))\n\t\t{\n\t\t\tfclose(in);\n\t\t\tfclose(out);\n\t\t\terrno = EIO;\n\t\t\treturn -EIO;\n\t\t}\n\t\tif (fwrite(&salt, 1, IVSIZE, out) != IVSIZE)\n\t\t{\n\t\t\tfclose(in);\n\t\t\tfclose(out);\n\t\t\terrno = EIO;\n\t\t\treturn -EIO;\n\t\t}\n\t\tprintf(\"Salt saved\\n\");\n\t}\n\telse\n\t{\n\t\tuint32_t mutationInterval32;\n\t\tif (fread(&mutationInterval32, 1, sizeof(mutationInterval32), in) != sizeof(mutationInterval32))\n\t\t{\n\t\t\tin.close();\n\t\t\tout.close();\n\t\t\terrno = EIO;\n\t\t\treturn -EIO;\n\t\t}\n\t\tmutationIntervalInt = mutationInterval32;\n\t\tfileSize -= sizeof(mutationInterval32);\n\t\tprintf(\"Mutationinterval loaded\\n\");\n\t\tif (fread(&salt, 1, IVSIZE, in) != IVSIZE)\n\t\t{\n\t\t\tin.close();\n\t\t\tout.close();\n\t\t\terrno = EIO;\n\t\t\treturn -EIO;\n\t\t}\n\t\tfileSize -= IVSIZE;\n\t\tprintf(\"Salt loaded\\n\");\n\t}\n\tRing ring((const unsigned char*)key, strlen(key), (const unsigned char*)salt, IVSIZE, mutationIntervalInt);\n\tunsigned int readBytes = 0;\n\tchar buf[bufferInt];\n\tchar verboseMessage[1+8+1+6+1];\n\n\t\/\/encode\/decode\n\twhile (readBytes < fileSize)\n\t{\n\t\tif (verbose)\/\/print\n\t\t{\n\t\t\tfloat progress = (100.0*readBytes)\/fileSize;\n\t\t\tif (encode)\n\t\t\t{\n\t\t\t\tsprintf(verboseMessage, \"\\rencoding %.1f%%\", progress);\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\tsprintf(verboseMessage, \"\\rdecoding %.1f%%\", progress);\n\t\t\t}\n\t\t\tprintf(\"%s\", verboseMessage);\n\t\t}\n\t\t\/\/read\n\t\tunsigned int bytesToRead = bufferInt;\n\t\tif (readBytes+bytesToRead > fileSize)\n\t\t{\n\t\t\tbytesToRead = fileSize - readBytes;\n\t\t}\n\t\tunsigned int readRet = fread(&buf, 1, bytesToRead, in);\n\t\treadBytes += readRet;\n#ifndef NDEBUG\n\t\tassert(readRet == bytesToRead);\n#endif\n\t\tif (encode)\n\t\t{\n\t\t\tring.encode((unsigned char*)buf, readRet);\n\t\t}\n\t\telse\n\t\t{\n\t\t\tring.decode((unsigned char*)buf, readRet);\n\t\t}\n\t\t\/\/write\n\t\tunsigned int writtenBytes = 0;\n\t\twhile (writtenBytes < readRet)\n\t\t{\n\t\t\tunsigned int writeRet = fwrite((&buf)+writtenBytes, 1, readRet, out);\n\t\t\twrittenBytes += writeRet;\n\t\t}\n\t}\n\n\t\/\/finishing\n\tif (verbose)\n\t{\n\t\tif (encode)\n\t\t{\n\t\t\tsprintf(verboseMessage, \"\\rencoding %.1f%%\", 100.0);\n\t\t}\n\t\telse\n\t\t{\n\t\t\tsprintf(verboseMessage, \"\\rdecoding %.1f%%\", 100.0);\n\t\t}\n\t\tprintf(\"%s\\n\", verboseMessage);\n\t}\n\tin.close();\n\tout.close();\n\tif (removeSet)\n\t{\n\t\tif (remove(inputFile))\n\t\t{\n\t\t\tperror(\"WARNING: could not delete inputfile\");\n\t\t}\n\t\telse\n\t\t{\n\t\t\tprintf(\"Inputfile deleted\\n\");\n\t\t}\n\t}\n\tprintf(\"done\\n\");\n\treturn 0;\n}\n<commit_msg>ported to qt, untested<commit_after>#include <cstdlib>\n#include <cerrno>\n#include <cstring>\n#include <cstdio>\n#include <cassert>\n#include \"ring.hpp\"\n#include <stdint.h>\n#include <QFile>\n\n#define DEFAULTBUFFERSIZE 1024\n#define DEFAULTMUTATIONINTERVAL 16\n\nint main(int argc, char* argv[])\n{\n\tchar inputFile[256+1];\n\tchar outputFile[256+1];\n\tchar key[MAPSIZE+1];\n\tchar salt[IVSIZE];\n\tchar mutationInterval[4+1];\n\tchar buffer[6+1];\n\tchar keyFile[256+1];\n\tbool inputSet = false;\n\tbool outputSet = false;\n\tbool keySet = false;\n\tbool encode = false;\n\tbool decode = false;\n\tbool mutationIntervalSet = false;\n\tbool bufferSet = false;\n\tbool keyFileSet = false;\n\tbool verbose = false;\n\tbool removeSet = false;\n\tfor (int i=0; i<argc; i++)\/\/collect arguments from cmdline\n\t{\n\t\tif (strcmp(argv[i], \"-in\") == 0 || strcmp(argv[i], \"-i\") == 0)\n\t\t{\n\t\t\ti++;\n\t\t\tif (i < argc)\n\t\t\t{\n\t\t\t\tif (strlen(argv[i]) <= 256)\n\t\t\t\t{\n\t\t\t\t\tstrcpy(inputFile, argv[i]);\n\t\t\t\t\tinputSet = true;\n\t\t\t\t}\n\t\t\t}\n\t\t\tcontinue;\n\t\t}\n\t\tif (strcmp(argv[i], \"-out\") == 0 || strcmp(argv[i], \"-o\") == 0)\n\t\t{\n\t\t\ti++;\n\t\t\tif (i < argc)\n\t\t\t{\n\t\t\t\tif (strlen(argv[i]) <= 256)\n\t\t\t\t{\n\t\t\t\t\tstrcpy(outputFile, argv[i]);\n\t\t\t\t\toutputSet = true;\n\t\t\t\t}\n\t\t\t}\n\t\t\tcontinue;\n\t\t}\n\t\tif (strcmp(argv[i], \"-password\") == 0 || strcmp(argv[i], \"-p\") == 0)\n\t\t{\n\t\t\ti++;\n\t\t\tif (i < argc)\n\t\t\t{\n\t\t\t\tif (strlen(argv[i]) <= 256)\n\t\t\t\t{\n\t\t\t\t\tstrcpy(key, argv[i]);\n\t\t\t\t\tkeySet = true;\n\t\t\t\t}\n\t\t\t}\n\t\t\tcontinue;\n\t\t}\n\t\tif (strcmp(argv[i], \"-key\") == 0 || strcmp(argv[i], \"-k\") == 0)\n\t\t{\n\t\t\ti++;\n\t\t\tif (i < argc)\n\t\t\t{\n\t\t\t\tif (strlen(argv[i]) <= 256)\n\t\t\t\t{\n\t\t\t\t\tstrcpy(keyFile, argv[i]);\n\t\t\t\t\tkeyFileSet = true;\n\t\t\t\t}\n\t\t\t}\n\t\t\tcontinue;\n\t\t}\n\t\tif (strcmp(argv[i], \"-encode\") == 0 || strcmp(argv[i], \"-e\") == 0)\n\t\t{\n\t\t\tencode = true;\n\t\t\tcontinue;\n\t\t}\n\t\tif (strcmp(argv[i], \"-decode\") == 0 || strcmp(argv[i], \"-d\") == 0)\n\t\t{\n\t\t\tdecode = true;\n\t\t\tcontinue;\n\t\t}\n\t\tif (strcmp(argv[i], \"-verbose\") == 0 || strcmp(argv[i], \"-v\") == 0)\n\t\t{\n\t\t\tverbose = true;\n\t\t\tcontinue;\n\t\t}\n\t\tif (strcmp(argv[i], \"-remove\") == 0 || strcmp(argv[i], \"-r\") == 0)\n\t\t{\n\t\t\tremoveSet = true;\n\t\t\tcontinue;\n\t\t}\n\t\tif (strcmp(argv[i], \"-mutation\") == 0 || strcmp(argv[i], \"-m\") == 0)\n\t\t{\n\t\t\ti++;\n\t\t\tif (i < argc)\n\t\t\t{\n\t\t\t\tif (strlen(argv[i]) <= 4)\n\t\t\t\t{\n\t\t\t\t\tstrcpy(mutationInterval, argv[i]);\n\t\t\t\t\tmutationIntervalSet = true;\n\t\t\t\t}\n\t\t\t}\n\t\t\tcontinue;\n\t\t}\n\t\tif (strcmp(argv[i], \"-buffer\") == 0 || strcmp(argv[i], \"-b\") == 0)\n\t\t{\n\t\t\ti++;\n\t\t\tif (i < argc)\n\t\t\t{\n\t\t\t\tif (strlen(argv[i]) <= 6)\n\t\t\t\t{\n\t\t\t\t\tstrcpy(buffer, argv[i]);\n\t\t\t\t\tbufferSet = true;\n\t\t\t\t}\n\t\t\t}\n\t\t\tcontinue;\n\t\t}\n\t\tif (strcmp(argv[i], \"-help\") == 0 || strcmp(argv[i], \"-h\") == 0)\n\t\t{\n\t\t\tprintf(\"%s [-e|-d] [-i <inputfile>] [-o <outputfile>] [-p <password> | -k <keyfile>] [-m <mutationInterval>] [-b <buffersize>] [-v] [-r] [-h]\\n\", argv[0]);\n\t\t\tprintf(\"\\n\");\n\t\t\tprintf(\"Encodes or decodes a single file.\\n\");\n\t\t\tprintf(\"\\n\");\n\t\t\tprintf(\"-e\\n\");\n\t\t\tprintf(\"-encode\\n\");\n\t\t\tprintf(\"\\tdefault\\n\");\n\t\t\tprintf(\"\\toptional\\n\");\n\t\t\tprintf(\"\\tSpecifies the mode as \\\"encode\\\".\\n\");\n\t\t\tprintf(\"\\n\");\n\t\t\tprintf(\"-d\\n\");\n\t\t\tprintf(\"-decode\\n\");\n\t\t\tprintf(\"\\toptional\\n\");\n\t\t\tprintf(\"\\tSpecifies the mode as \\\"decode\\\".\\n\");\n\t\t\tprintf(\"\\n\");\n\t\t\tprintf(\"-i <inputfile>\\n\");\n\t\t\tprintf(\"-in <inputfile>\\n\");\n\t\t\tprintf(\"\\tmust\\n\");\n\t\t\tprintf(\"\\tSpecifies the inputfile.\\n\");\n\t\t\tprintf(\"\\n\");\n\t\t\tprintf(\"-o <outputfile>\\n\");\n\t\t\tprintf(\"-out <outputfile>\\n\");\n\t\t\tprintf(\"\\tmust\\n\");\n\t\t\tprintf(\"\\tSpecifies the outputfile.\\n\");\n\t\t\tprintf(\"\\n\");\n\t\t\tprintf(\"-p <password>\\n\");\n\t\t\tprintf(\"-password <password>\\n\");\n\t\t\tprintf(\"\\tmust\\n\");\n\t\t\tprintf(\"\\tSpecifies the password.\\n\");\n\t\t\tprintf(\"\\n\");\n\t\t\tprintf(\"-k <keyfile>\\n\");\n\t\t\tprintf(\"-key <keyfile>\\n\");\n\t\t\tprintf(\"\\toptional (alternative for -p)\\n\");\n\t\t\tprintf(\"\\tSpecifies a keyfile.\\n\");\n\t\t\tprintf(\"\\n\");\n\t\t\tprintf(\"-m <mutationInterval>\\n\");\n\t\t\tprintf(\"-mutation <mutationInterval>\\n\");\n\t\t\tprintf(\"\\tdefault: %u\\n\", DEFAULTMUTATIONINTERVAL);\n\t\t\tprintf(\"\\toptional\\n\");\n\t\t\tprintf(\"\\tSpecifies the mutationInterval.\\n\");\n\t\t\tprintf(\"\\n\");\n\t\t\tprintf(\"-b <buffersize>\\n\");\n\t\t\tprintf(\"-buffer <buffersize>\\n\");\n\t\t\tprintf(\"\\tdefault: %u\\n\", DEFAULTBUFFERSIZE);\n\t\t\tprintf(\"\\toptional\\n\");\n\t\t\tprintf(\"\\tSpecifies the buffersize.\\n\");\n\t\t\tprintf(\"\\n\");\n\t\t\tprintf(\"-v\\n\");\n\t\t\tprintf(\"-verbose\\n\");\n\t\t\tprintf(\"\\toptional\\n\");\n\t\t\tprintf(\"\\tMakes the program verbose.\\n\");\n\t\t\tprintf(\"\\n\");\n\t\t\tprintf(\"-r\\n\");\n\t\t\tprintf(\"-remove\\n\");\n\t\t\tprintf(\"\\toptional\\n\");\n\t\t\tprintf(\"\\tRemoves the inputfile after reading.\\n\");\n\t\t\tprintf(\"\\n\");\n\t\t\tprintf(\"-h\\n\");\n\t\t\tprintf(\"-help\\n\");\n\t\t\tprintf(\"\\toptional\\n\");\n\t\t\tprintf(\"\\tPrints this helpmessage and quits the program.\\n\");\n\t\t\treturn 0;\n\t\t}\n\t}\n\n\t\/\/evaluate arguments\n\tif (!inputSet)\n\t{\n\t\tprintf(\"You need to specify an inputfile!\\n\");\n\t\treturn -EINVAL;\n\t}\n\tif (keySet && keyFileSet)\n\t{\n\t\tprintf(\"You shall not specify a password and a keyfile!\\n\");\n\t\treturn -EINVAL;\n\t}\n\tif (!keySet && !keyFileSet)\n\t{\n\t\tprintf(\"You need to specify a password or a keyfile!\\n\");\n\t\treturn -EINVAL;\n\t}\n\tif (encode && decode)\n\t{\n\t\tprintf(\"You may only specify one mode!\\n\");\n\t\treturn -EINVAL;\n\t}\n\tif (keyFileSet)\n\t{\n\t\tQFile in(keyFile);\n\t\tif (!in.open(QIODevice::ReadOnly))\n\t\t{\n\t\t\tprintf(\"ERROR: can not open keyfile\\n\");\n\t\t\terrno = EIO;\n\t\t\treturn -errno;\n\t\t}\n\t\tunsigned int fileSize = in.size();\n\t\tif (fileSize > MAPSIZE)\n\t\t{\n\t\t\tprintf(\"ERROR: keyfile is to large to contain a single key -> invalid\\n\");\n\t\t\tin.close();\n\t\t\terrno = EMSGSIZE;\n\t\t\treturn -EMSGSIZE;\n\t\t}\n\t\tif (in.read((char*)(&key), fileSize) != fileSize)\n\t\t{\n\t\t\tin.close();\n\t\t\terrno = EIO;\n\t\t\treturn -EIO;\n\t\t}\n\t\tkey[fileSize] = '\\0';\n\t\tin.close();\n\t\tprintf(\"Password read from keyfile.\\n\");\n\t}\n\tif (!encode && !decode)\n\t{\n\t\tencode = true;\n\t\tprintf(\"No mode specified... using \\\"encodemode\\\".\\n\");\n\t}\n\tif (!outputSet)\n\t{\n\t\tstrcpy(outputFile, inputFile);\n\t\tif (encode)\n\t\t{\n\t\t\tstrcat(outputFile, \".enc\");\n\t\t}\n\t\telse\n\t\t{\n\t\t\tstrcat(outputFile, \".dec\");\n\t\t}\n\t\tprintf(\"No outputfile specified... using \\\"%s\\\".\\n\", outputFile);\n\t}\n\tif (!mutationIntervalSet && encode)\n\t{\n\t\tsprintf(mutationInterval, \"%u\", DEFAULTMUTATIONINTERVAL);\n\t\tprintf(\"No mutationInterval specified... using \\\"%s\\\".\\n\", mutationInterval);\n\t}\n\tif (!bufferSet)\n\t{\n\t\tsprintf(buffer, \"%u\", DEFAULTBUFFERSIZE);\n\t\tprintf(\"No buffersize specified... using \\\"%s\\\".\\n\", buffer);\n\t}\n\n\t\/\/setup\n\tif (encode)\n\t{\n\t\tQFile in(\"\/dev\/urandom\");\n\t\tif (!in.open(QIODevice::ReadOnly))\n\t\t{\n\t\t\tprintf(\"ERROR: can not open \\\"\/dev\/urandom\\\"\\n\");\n\t\t\terrno = EIO;\n\t\t\treturn errno;\n\t\t}\n\t\tif (in.read((char*)(&salt), IVSIZE) != IVSIZE)\n\t\t{\n\t\t\tin.close();\n\t\t\terrno = EIO;\n\t\t\treturn -EIO;\n\t\t}\n\t\tin.close();\n\t\tprintf(\"Salt generated\\n\");\n\t}\n\tunsigned int bufferInt = atoi(buffer);\n\tunsigned int mutationIntervalInt;\n\tQFile in(inputFile);\n\tif (!in.open(QIODevice::ReadOnly))\n\t{\n\t\tprintf(\"ERROR: can not open inputfile\\n\");\n\t\terrno = EIO;\n\t\treturn -errno;\n\t}\n\tQFile out(outputFile);\n\tif (!in.open(QIODevice::WriteOnly))\n\t{\n\t\tprintf(\"ERROR: can not open outputfile\\n\");\n\t\tin.close();\n\t\terrno = EIO;\n\t\treturn errno;\n\t}\n\tunsigned int fileSize = in.size();\n\tif (encode)\n\t{\n\t\tmutationIntervalInt = atoi(mutationInterval);\n\t\tuint32_t mutationInterval32 = mutationIntervalInt;\n\t\tif (out.write((const char*)(&mutationInterval32), sizeof(mutationInterval32)) != sizeof(mutationInterval32))\n\t\t{\n\t\t\tin.close();\n\t\t\tout.close();\n\t\t\terrno = EIO;\n\t\t\treturn -EIO;\n\t\t}\n\t\tif (out.write((const char*)(&salt), IVSIZE) != IVSIZE)\n\t\t{\n\t\t\tin.close();\n\t\t\tout.close();\n\t\t\terrno = EIO;\n\t\t\treturn -EIO;\n\t\t}\n\t\tprintf(\"Salt saved\\n\");\n\t}\n\telse\n\t{\n\t\tuint32_t mutationInterval32;\n\t\tif (in.read((char*)(&mutationInterval32), sizeof(mutationInterval32)) != sizeof(mutationInterval32))\n\t\t{\n\t\t\tin.close();\n\t\t\tout.close();\n\t\t\terrno = EIO;\n\t\t\treturn -EIO;\n\t\t}\n\t\tmutationIntervalInt = mutationInterval32;\n\t\tfileSize -= sizeof(mutationInterval32);\n\t\tprintf(\"Mutationinterval loaded\\n\");\n\t\tif (in.read((char*)(&salt), IVSIZE) != IVSIZE)\n\t\t{\n\t\t\tin.close();\n\t\t\tout.close();\n\t\t\terrno = EIO;\n\t\t\treturn -EIO;\n\t\t}\n\t\tfileSize -= IVSIZE;\n\t\tprintf(\"Salt loaded\\n\");\n\t}\n\tRing ring((const unsigned char*)key, strlen(key), (const unsigned char*)salt, IVSIZE, mutationIntervalInt);\n\tunsigned int readBytes = 0;\n\tchar buf[bufferInt];\n\tchar verboseMessage[1+8+1+6+1];\n\n\t\/\/encode\/decode\n\twhile (readBytes < fileSize)\n\t{\n\t\tif (verbose)\/\/print\n\t\t{\n\t\t\tfloat progress = (100.0*readBytes)\/fileSize;\n\t\t\tif (encode)\n\t\t\t{\n\t\t\t\tsprintf(verboseMessage, \"\\rencoding %.1f%%\", progress);\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\tsprintf(verboseMessage, \"\\rdecoding %.1f%%\", progress);\n\t\t\t}\n\t\t\tprintf(\"%s\", verboseMessage);\n\t\t}\n\t\t\/\/read\n\t\tunsigned int bytesToRead = bufferInt;\n\t\tif (readBytes+bytesToRead > fileSize)\n\t\t{\n\t\t\tbytesToRead = fileSize - readBytes;\n\t\t}\n\t\tunsigned int readRet = in.read((char*)(&buf), bytesToRead);\n\t\treadBytes += readRet;\n#ifndef NDEBUG\n\t\tassert(readRet == bytesToRead);\n#endif\n\t\tif (encode)\n\t\t{\n\t\t\tring.encode((unsigned char*)buf, readRet);\n\t\t}\n\t\telse\n\t\t{\n\t\t\tring.decode((unsigned char*)buf, readRet);\n\t\t}\n\t\t\/\/write\n\t\tunsigned int writtenBytes = 0;\n\t\twhile (writtenBytes < readRet)\n\t\t{\n\t\t\tunsigned int writeRet = out.write((const char*)((&buf)+writtenBytes), readRet);\n\t\t\twrittenBytes += writeRet;\n\t\t}\n\t}\n\n\t\/\/finishing\n\tif (verbose)\n\t{\n\t\tif (encode)\n\t\t{\n\t\t\tsprintf(verboseMessage, \"\\rencoding %.1f%%\", 100.0);\n\t\t}\n\t\telse\n\t\t{\n\t\t\tsprintf(verboseMessage, \"\\rdecoding %.1f%%\", 100.0);\n\t\t}\n\t\tprintf(\"%s\\n\", verboseMessage);\n\t}\n\tin.close();\n\tout.close();\n\tif (removeSet)\n\t{\n\t\tif (remove(inputFile))\n\t\t{\n\t\t\tperror(\"WARNING: could not delete inputfile\");\n\t\t}\n\t\telse\n\t\t{\n\t\t\tprintf(\"Inputfile deleted\\n\");\n\t\t}\n\t}\n\tprintf(\"done\\n\");\n\treturn 0;\n}\n<|endoftext|>"} {"text":"<commit_before>\/\/\n\/\/ Licensed to Green Energy Corp (www.greenenergycorp.com) under one\n\/\/ or more contributor license agreements. See the NOTICE file\n\/\/ distributed with this work for additional information\n\/\/ regarding copyright ownership. Green Enery Corp 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 <opendnp3\/APL\/AsyncTaskBase.h>\n#include <opendnp3\/APL\/AsyncTaskContinuous.h>\n#include <opendnp3\/APL\/AsyncTaskGroup.h>\n#include <opendnp3\/APL\/AsyncTaskInterfaces.h>\n#include <opendnp3\/APL\/AsyncTaskNonPeriodic.h>\n#include <opendnp3\/APL\/AsyncTaskPeriodic.h>\n#include <opendnp3\/APL\/CopyableBuffer.h>\n#include <opendnp3\/APL\/DataInterfaces.h>\n#include <opendnp3\/APL\/ITimerSource.h>\n#include <opendnp3\/APL\/Logger.h>\n#include <opendnp3\/DNP3\/Master.h>\n#include <opendnp3\/DNP3\/MasterStates.h>\n#include <opendnp3\/DNP3\/ObjectReadIterator.h>\n#include <opendnp3\/DNP3\/ResponseLoader.h>\n#include <opendnp3\/DNP3\/VtoEventBufferAdapter.h>\n\n#include <boost\/bind.hpp>\n#include <boost\/foreach.hpp>\n\nusing namespace boost;\n\nnamespace apl\n{\nnamespace dnp\n{\n\nMaster::Master(Logger* apLogger, MasterConfig aCfg, IAppLayer* apAppLayer, IDataObserver* apPublisher, AsyncTaskGroup* apTaskGroup, ITimerSource* apTimerSrc, ITimeSource* apTimeSrc) :\n\tLoggable(apLogger),\n\tmAllowTimeSync(aCfg.AllowTimeSync),\n\tmVtoReader(apLogger),\n\tmVtoWriter(apLogger->GetSubLogger(\"VtoWriter\"), aCfg.VtoWriterQueueSize),\n\tmRequest(aCfg.FragSize),\n\tmpAppLayer(apAppLayer),\n\tmpPublisher(apPublisher),\n\tmpTaskGroup(apTaskGroup),\n\tmpTimerSrc(apTimerSrc),\n\tmpTimeSrc(apTimeSrc),\n\tmpState(AMS_Closed::Inst()),\n\tmpTask(NULL),\n\tmpScheduledTask(NULL),\n\tmpObserver(aCfg.mpObserver),\n\tmState(SS_UNKNOWN),\n\tmSchedule(apTaskGroup, this, aCfg),\n\tmClassPoll(apLogger, apPublisher, &mVtoReader),\n\tmClearRestart(apLogger),\n\tmConfigureUnsol(apLogger),\n\tmTimeSync(apLogger, apTimeSrc),\n\tmExecuteBO(apLogger),\n\tmExecuteSP(apLogger),\n\tmVtoTransmitTask(apLogger, aCfg.FragSize, aCfg.UseNonStandardVtoFunction)\n{\n\t\/*\n\t * Establish a link between the mCommandQueue and the\n\t * mSchedule.mpCommandTask. When new data is written to mCommandQueue,\n\t * wake up mpCommandTask to process the data.\n\t *\/\n\tmCommandQueue.SetNotifier(\n\t mNotifierSource.Get(\n\t boost::bind(\n\t &AsyncTaskBase::Enable,\n\t mSchedule.mpCommandTask\n\t ),\n\t mpTimerSrc\n\t )\n\t);\n\n\t\/*\n\t * Establish a link between the mVtoWriter and the\n\t * mSchedule.mpVtoTransmitTask. When new data is written to\n\t * mVtoWriter, wake up the mSchedule.mpVtoTransmitTask.\n\t *\/\n\tmVtoWriter.AddObserver(\n\t mNotifierSource.Get(\n\t boost::bind(\n\t &AsyncTaskBase::Enable,\n\t mSchedule.mpVtoTransmitTask\n\t ),\n\t mpTimerSrc\n\t )\n\t);\n\n\t\/*\n\t * Set the initial state of the communication link.\n\t *\/\n\tthis->UpdateState(SS_COMMS_DOWN);\n}\n\nvoid Master::UpdateState(StackStates aState)\n{\n\tif(mState != aState) {\n\t\tLOG_BLOCK(LEV_INFO, \"StackState: \" << ConvertStackStateToString(aState));\n\t\tmState = aState;\n\t\tif(mpObserver != NULL) mpObserver->OnStateChange(aState);\n\t\tif(mState == SS_COMMS_UP) {\n\t\t\tmSchedule.mpVtoTransmitTask->Enable();\n\t\t}\n\t}\n}\n\nvoid Master::ProcessIIN(const IINField& arIIN)\n{\n\tthis->UpdateState(SS_COMMS_UP);\n\n\tbool check_state = false;\n\n\t\/\/The clear IIN task only happens in response to detecting an IIN bit.\n\tif(arIIN.GetNeedTime() && mAllowTimeSync) {\n\t\tLOG_BLOCK(LEV_INFO, \"Need time detected\");\n\t\tmSchedule.mpTimeTask->SilentEnable();\n\t\tcheck_state = true;\n\t}\n\n\tif(mLastIIN.GetDeviceTrouble()) LOG_BLOCK(LEV_WARNING, \"IIN Device trouble detected\");\n\n\tif(mLastIIN.GetEventBufferOverflow()) LOG_BLOCK(LEV_WARNING, \"Event buffer overflow detected\");\n\n\t\/\/ If this is detected, we need to reset the startup tasks\n\tif(mLastIIN.GetDeviceRestart()) {\n\t\tLOG_BLOCK(LEV_WARNING, \"Device restart detected\");\n\t\tmSchedule.ResetStartupTasks();\n\t\tmSchedule.mpClearRestartTask->SilentEnable();\n\t\tcheck_state = true;\n\t}\n\n\tif(check_state) mpTaskGroup->CheckState();\n}\n\nvoid Master::ProcessCommand(ITask* apTask)\n{\n\tCommandData info;\n\n\tif(mpState == AMS_Closed::Inst()) { \/\/we're closed\n\t\tif(!mCommandQueue.RespondToCommand(CS_HARDWARE_ERROR)) apTask->Disable();\n\t}\n\telse {\n\n\t\tswitch(mCommandQueue.Next()) {\n\t\tcase(apl::CT_BINARY_OUTPUT): {\n\t\t\t\tapl::BinaryOutput cmd;\n\t\t\t\tmCommandQueue.Read(cmd, info);\n\t\t\t\tmExecuteBO.Set(cmd, info, true);\n\t\t\t\tmpState->StartTask(this, apTask, &mExecuteBO);\n\t\t\t}\n\t\t\tbreak;\n\t\tcase(apl::CT_SETPOINT): {\n\t\t\t\tapl::Setpoint cmd;\n\t\t\t\tmCommandQueue.Read(cmd, info);\n\t\t\t\tmExecuteSP.Set(cmd, info, true);\n\t\t\t\tmpState->StartTask(this, apTask, &mExecuteSP);\n\t\t\t}\n\t\t\tbreak;\n\t\tdefault:\n\t\t\tapTask->Disable(); \/\/no commands to be read\n\t\t\tbreak;\n\t\t}\n\t}\n}\n\nvoid Master::StartTask(MasterTaskBase* apMasterTask, bool aInit)\n{\n\tif(aInit) apMasterTask->Init();\n\tapMasterTask->ConfigureRequest(mRequest);\n\tmpAppLayer->SendRequest(mRequest);\n}\n\n\/* Tasks *\/\n\nvoid Master::SyncTime(ITask* apTask)\n{\n\tif(mLastIIN.GetNeedTime() && mAllowTimeSync) {\n\t\tmpState->StartTask(this, apTask, &mTimeSync);\n\t}\n\telse apTask->Disable();\n}\n\nvoid Master::WriteIIN(ITask* apTask)\n{\n\tif(mLastIIN.GetDeviceRestart()) {\n\t\tmpState->StartTask(this, apTask, &mClearRestart);\n\t}\n\telse apTask->Disable();\n}\n\nvoid Master::IntegrityPoll(ITask* apTask)\n{\n\tmClassPoll.Set(PC_CLASS_0);\n\tmpState->StartTask(this, apTask, &mClassPoll);\n}\n\nvoid Master::EventPoll(ITask* apTask, int aClassMask)\n{\n\tmClassPoll.Set(aClassMask);\n\tmpState->StartTask(this, apTask, &mClassPoll);\n}\n\nvoid Master::ChangeUnsol(ITask* apTask, bool aEnable, int aClassMask)\n{\n\tmConfigureUnsol.Set(aEnable, aClassMask);\n\tmpState->StartTask(this, apTask, &mConfigureUnsol);\n}\n\nvoid Master::TransmitVtoData(ITask* apTask)\n{\n\tif(mpState == AMS_Closed::Inst()) apTask->Disable();\n\telse {\n\t\tsize_t max = mVtoTransmitTask.mBuffer.NumAvailable();\n\t\tVtoEventBufferAdapter adapter(&mVtoTransmitTask.mBuffer);\n\t\tmVtoWriter.Flush(&adapter, max);\n\n\t\tLOG_BLOCK(LEV_DEBUG, \"TransmitVtoData: \" << std::boolalpha << mVtoTransmitTask.mBuffer.IsFull() << \" size: \" << mVtoTransmitTask.mBuffer.Size());\n\n\t\t\/* Any data to transmit? *\/\n\t\tif (mVtoTransmitTask.mBuffer.Size() > 0) {\n\t\t\t\/* Start the mVtoTransmitTask *\/\n\t\t\tmpState->StartTask(this, apTask, &mVtoTransmitTask);\n\t\t}\n\t\telse {\n\t\t\t\/* Stop the mVtoTransmitTask *\/\n\t\t\tapTask->Disable();\n\t\t}\n\t}\n}\n\n\/* Implement IAppUser *\/\n\nvoid Master::OnLowerLayerUp()\n{\n\tmpState->OnLowerLayerUp(this);\n\tmSchedule.EnableOnlineTasks();\n}\n\nvoid Master::OnLowerLayerDown()\n{\n mpState->OnLowerLayerDown(this);\n this->UpdateState(SS_COMMS_DOWN);\n mSchedule.DisableOnlineTasks();\n}\n\nvoid Master::OnSolSendSuccess()\n{\n\tmpState->OnSendSuccess(this);\n}\n\nvoid Master::OnSolFailure()\n{\n\tthis->UpdateState(SS_COMMS_DOWN);\n\tmpState->OnFailure(this);\n}\n\nvoid Master::OnUnsolSendSuccess()\n{\n\tthrow InvalidStateException(LOCATION, \"Master can't send unsol\");\n}\n\nvoid Master::OnUnsolFailure()\n{\n\tthrow InvalidStateException(LOCATION, \"Master can't send unsol\");\n}\n\nvoid Master::OnPartialResponse(const APDU& arAPDU)\n{\n\tmLastIIN = arAPDU.GetIIN();\n\tthis->ProcessIIN(mLastIIN);\n\tmpState->OnPartialResponse(this, arAPDU);\n}\n\nvoid Master::OnFinalResponse(const APDU& arAPDU)\n{\n\tmLastIIN = arAPDU.GetIIN();\n\tthis->ProcessIIN(arAPDU.GetIIN());\n\tmpState->OnFinalResponse(this, arAPDU);\n}\n\nvoid Master::OnUnsolResponse(const APDU& arAPDU)\n{\n\tmLastIIN = arAPDU.GetIIN();\n\tthis->ProcessIIN(mLastIIN);\n\tmpState->OnUnsolResponse(this, arAPDU);\n}\n\nvoid Master::ScheduleOnDemandIntegrityPoll(void)\n{\n mSchedule.AddOnDemandIntegrityPoll(this);\n return;\n}\n\n\/* Private functions *\/\n\nvoid Master::ProcessDataResponse(const APDU& arResponse)\n{\n\ttry {\n\t\tResponseLoader loader(this->mpLogger, this->mpPublisher, this->GetVtoReader());\n\n\t\tfor(HeaderReadIterator hdr = arResponse.BeginRead(); !hdr.IsEnd(); ++hdr)\n\t\t\tloader.Process(hdr);\n\t}\n\tcatch(Exception ex) {\n\t\tEXCEPTION_BLOCK(LEV_WARNING, ex)\n\t}\n}\n\n}\n} \/\/end ns\n\n\/* vim: set ts=4 sw=4: *\/\n<commit_msg>SGW-258-no-command-completion<commit_after>\/\/\n\/\/ Licensed to Green Energy Corp (www.greenenergycorp.com) under one\n\/\/ or more contributor license agreements. See the NOTICE file\n\/\/ distributed with this work for additional information\n\/\/ regarding copyright ownership. Green Enery Corp 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 <opendnp3\/APL\/AsyncTaskBase.h>\n#include <opendnp3\/APL\/AsyncTaskContinuous.h>\n#include <opendnp3\/APL\/AsyncTaskGroup.h>\n#include <opendnp3\/APL\/AsyncTaskInterfaces.h>\n#include <opendnp3\/APL\/AsyncTaskNonPeriodic.h>\n#include <opendnp3\/APL\/AsyncTaskPeriodic.h>\n#include <opendnp3\/APL\/CopyableBuffer.h>\n#include <opendnp3\/APL\/DataInterfaces.h>\n#include <opendnp3\/APL\/ITimerSource.h>\n#include <opendnp3\/APL\/Logger.h>\n#include <opendnp3\/DNP3\/Master.h>\n#include <opendnp3\/DNP3\/MasterStates.h>\n#include <opendnp3\/DNP3\/ObjectReadIterator.h>\n#include <opendnp3\/DNP3\/ResponseLoader.h>\n#include <opendnp3\/DNP3\/VtoEventBufferAdapter.h>\n\n#include <boost\/bind.hpp>\n#include <boost\/foreach.hpp>\n\nusing namespace boost;\n\nnamespace apl\n{\nnamespace dnp\n{\n\nMaster::Master(Logger* apLogger, MasterConfig aCfg, IAppLayer* apAppLayer, IDataObserver* apPublisher, AsyncTaskGroup* apTaskGroup, ITimerSource* apTimerSrc, ITimeSource* apTimeSrc) :\n\tLoggable(apLogger),\n\tmAllowTimeSync(aCfg.AllowTimeSync),\n\tmVtoReader(apLogger),\n\tmVtoWriter(apLogger->GetSubLogger(\"VtoWriter\"), aCfg.VtoWriterQueueSize),\n\tmRequest(aCfg.FragSize),\n\tmpAppLayer(apAppLayer),\n\tmpPublisher(apPublisher),\n\tmpTaskGroup(apTaskGroup),\n\tmpTimerSrc(apTimerSrc),\n\tmpTimeSrc(apTimeSrc),\n\tmpState(AMS_Closed::Inst()),\n\tmpTask(NULL),\n\tmpScheduledTask(NULL),\n\tmpObserver(aCfg.mpObserver),\n\tmState(SS_UNKNOWN),\n\tmSchedule(apTaskGroup, this, aCfg),\n\tmClassPoll(apLogger, apPublisher, &mVtoReader),\n\tmClearRestart(apLogger),\n\tmConfigureUnsol(apLogger),\n\tmTimeSync(apLogger, apTimeSrc),\n\tmExecuteBO(apLogger),\n\tmExecuteSP(apLogger),\n\tmVtoTransmitTask(apLogger, aCfg.FragSize, aCfg.UseNonStandardVtoFunction)\n{\n\t\/*\n\t * Establish a link between the mCommandQueue and the\n\t * mSchedule.mpCommandTask. When new data is written to mCommandQueue,\n\t * wake up mpCommandTask to process the data.\n\t *\/\n\tmCommandQueue.SetNotifier(\n\t mNotifierSource.Get(\n\t boost::bind(\n\t &AsyncTaskBase::Enable,\n\t mSchedule.mpCommandTask\n\t ),\n\t mpTimerSrc\n\t )\n\t);\n\n\t\/*\n\t * Establish a link between the mVtoWriter and the\n\t * mSchedule.mpVtoTransmitTask. When new data is written to\n\t * mVtoWriter, wake up the mSchedule.mpVtoTransmitTask.\n\t *\/\n\tmVtoWriter.AddObserver(\n\t mNotifierSource.Get(\n\t boost::bind(\n\t &AsyncTaskBase::Enable,\n\t mSchedule.mpVtoTransmitTask\n\t ),\n\t mpTimerSrc\n\t )\n\t);\n\n\t\/*\n\t * Set the initial state of the communication link.\n\t *\/\n\tthis->UpdateState(SS_COMMS_DOWN);\n}\n\nvoid Master::UpdateState(StackStates aState)\n{\n\tif(mState != aState) {\n\t\tLOG_BLOCK(LEV_INFO, \"StackState: \" << ConvertStackStateToString(aState));\n\t\tmState = aState;\n\t\tif(mpObserver != NULL) mpObserver->OnStateChange(aState);\n\t\tif(mState == SS_COMMS_UP) {\n\t\t\tmSchedule.mpVtoTransmitTask->Enable();\n\t\t}\n\t}\n}\n\nvoid Master::ProcessIIN(const IINField& arIIN)\n{\n\tthis->UpdateState(SS_COMMS_UP);\n\n\tbool check_state = false;\n\n\t\/\/The clear IIN task only happens in response to detecting an IIN bit.\n\tif(arIIN.GetNeedTime() && mAllowTimeSync) {\n\t\tLOG_BLOCK(LEV_INFO, \"Need time detected\");\n\t\tmSchedule.mpTimeTask->SilentEnable();\n\t\tcheck_state = true;\n\t}\n\n\tif(mLastIIN.GetDeviceTrouble()) LOG_BLOCK(LEV_WARNING, \"IIN Device trouble detected\");\n\n\tif(mLastIIN.GetEventBufferOverflow()) LOG_BLOCK(LEV_WARNING, \"Event buffer overflow detected\");\n\n\t\/\/ If this is detected, we need to reset the startup tasks\n\tif(mLastIIN.GetDeviceRestart()) {\n\t\tLOG_BLOCK(LEV_WARNING, \"Device restart detected\");\n\t\tmSchedule.ResetStartupTasks();\n\t\tmSchedule.mpClearRestartTask->SilentEnable();\n\t\tcheck_state = true;\n\t}\n\n\tif(check_state) mpTaskGroup->CheckState();\n}\n\nvoid Master::ProcessCommand(ITask* apTask)\n{\n\tCommandData info;\n\n\tif(mpState == AMS_Closed::Inst()) { \/\/we're closed\n\t\tif(!mCommandQueue.RespondToCommand(CS_HARDWARE_ERROR)) {\n\t\t\tapTask->Disable();\n\t\t}\n\t\telse {\n\t\t\t\/\/ We need to set task completion when the stack is closed\n\t\t\tapTask->OnComplete(true);\n\t\t}\n\t}\n\telse {\n\n\t\tswitch(mCommandQueue.Next()) {\n\t\tcase(apl::CT_BINARY_OUTPUT): {\n\t\t\t\tapl::BinaryOutput cmd;\n\t\t\t\tmCommandQueue.Read(cmd, info);\n\t\t\t\tmExecuteBO.Set(cmd, info, true);\n\t\t\t\tmpState->StartTask(this, apTask, &mExecuteBO);\n\t\t\t}\n\t\t\tbreak;\n\t\tcase(apl::CT_SETPOINT): {\n\t\t\t\tapl::Setpoint cmd;\n\t\t\t\tmCommandQueue.Read(cmd, info);\n\t\t\t\tmExecuteSP.Set(cmd, info, true);\n\t\t\t\tmpState->StartTask(this, apTask, &mExecuteSP);\n\t\t\t}\n\t\t\tbreak;\n\t\tdefault:\n\t\t\tapTask->Disable(); \/\/no commands to be read\n\t\t\tbreak;\n\t\t}\n\t}\n}\n\nvoid Master::StartTask(MasterTaskBase* apMasterTask, bool aInit)\n{\n\tif(aInit) apMasterTask->Init();\n\tapMasterTask->ConfigureRequest(mRequest);\n\tmpAppLayer->SendRequest(mRequest);\n}\n\n\/* Tasks *\/\n\nvoid Master::SyncTime(ITask* apTask)\n{\n\tif(mLastIIN.GetNeedTime() && mAllowTimeSync) {\n\t\tmpState->StartTask(this, apTask, &mTimeSync);\n\t}\n\telse apTask->Disable();\n}\n\nvoid Master::WriteIIN(ITask* apTask)\n{\n\tif(mLastIIN.GetDeviceRestart()) {\n\t\tmpState->StartTask(this, apTask, &mClearRestart);\n\t}\n\telse apTask->Disable();\n}\n\nvoid Master::IntegrityPoll(ITask* apTask)\n{\n\tmClassPoll.Set(PC_CLASS_0);\n\tmpState->StartTask(this, apTask, &mClassPoll);\n}\n\nvoid Master::EventPoll(ITask* apTask, int aClassMask)\n{\n\tmClassPoll.Set(aClassMask);\n\tmpState->StartTask(this, apTask, &mClassPoll);\n}\n\nvoid Master::ChangeUnsol(ITask* apTask, bool aEnable, int aClassMask)\n{\n\tmConfigureUnsol.Set(aEnable, aClassMask);\n\tmpState->StartTask(this, apTask, &mConfigureUnsol);\n}\n\nvoid Master::TransmitVtoData(ITask* apTask)\n{\n\tif(mpState == AMS_Closed::Inst()) apTask->Disable();\n\telse {\n\t\tsize_t max = mVtoTransmitTask.mBuffer.NumAvailable();\n\t\tVtoEventBufferAdapter adapter(&mVtoTransmitTask.mBuffer);\n\t\tmVtoWriter.Flush(&adapter, max);\n\n\t\tLOG_BLOCK(LEV_DEBUG, \"TransmitVtoData: \" << std::boolalpha << mVtoTransmitTask.mBuffer.IsFull() << \" size: \" << mVtoTransmitTask.mBuffer.Size());\n\n\t\t\/* Any data to transmit? *\/\n\t\tif (mVtoTransmitTask.mBuffer.Size() > 0) {\n\t\t\t\/* Start the mVtoTransmitTask *\/\n\t\t\tmpState->StartTask(this, apTask, &mVtoTransmitTask);\n\t\t}\n\t\telse {\n\t\t\t\/* Stop the mVtoTransmitTask *\/\n\t\t\tapTask->Disable();\n\t\t}\n\t}\n}\n\n\/* Implement IAppUser *\/\n\nvoid Master::OnLowerLayerUp()\n{\n\tmpState->OnLowerLayerUp(this);\n\tmSchedule.EnableOnlineTasks();\n}\n\nvoid Master::OnLowerLayerDown()\n{\n mpState->OnLowerLayerDown(this);\n this->UpdateState(SS_COMMS_DOWN);\n mSchedule.DisableOnlineTasks();\n}\n\nvoid Master::OnSolSendSuccess()\n{\n\tmpState->OnSendSuccess(this);\n}\n\nvoid Master::OnSolFailure()\n{\n\tthis->UpdateState(SS_COMMS_DOWN);\n\tmpState->OnFailure(this);\n}\n\nvoid Master::OnUnsolSendSuccess()\n{\n\tthrow InvalidStateException(LOCATION, \"Master can't send unsol\");\n}\n\nvoid Master::OnUnsolFailure()\n{\n\tthrow InvalidStateException(LOCATION, \"Master can't send unsol\");\n}\n\nvoid Master::OnPartialResponse(const APDU& arAPDU)\n{\n\tmLastIIN = arAPDU.GetIIN();\n\tthis->ProcessIIN(mLastIIN);\n\tmpState->OnPartialResponse(this, arAPDU);\n}\n\nvoid Master::OnFinalResponse(const APDU& arAPDU)\n{\n\tmLastIIN = arAPDU.GetIIN();\n\tthis->ProcessIIN(arAPDU.GetIIN());\n\tmpState->OnFinalResponse(this, arAPDU);\n}\n\nvoid Master::OnUnsolResponse(const APDU& arAPDU)\n{\n\tmLastIIN = arAPDU.GetIIN();\n\tthis->ProcessIIN(mLastIIN);\n\tmpState->OnUnsolResponse(this, arAPDU);\n}\n\nvoid Master::ScheduleOnDemandIntegrityPoll(void)\n{\n mSchedule.AddOnDemandIntegrityPoll(this);\n return;\n}\n\n\/* Private functions *\/\n\nvoid Master::ProcessDataResponse(const APDU& arResponse)\n{\n\ttry {\n\t\tResponseLoader loader(this->mpLogger, this->mpPublisher, this->GetVtoReader());\n\n\t\tfor(HeaderReadIterator hdr = arResponse.BeginRead(); !hdr.IsEnd(); ++hdr)\n\t\t\tloader.Process(hdr);\n\t}\n\tcatch(Exception ex) {\n\t\tEXCEPTION_BLOCK(LEV_WARNING, ex)\n\t}\n}\n\n}\n} \/\/end ns\n\n\/* vim: set ts=4 sw=4: *\/\n<|endoftext|>"} {"text":"<commit_before>#include <string>\n\nstd::string pre_rules()\n{\n\tstd::string pre;\n\tpre+=\"iptables -F\\n\";\n\tpre+=\"iptables -X\\n\";\n\tpre+=\"\\n\";\n\tpre+=\"iptables -P INPUT DROP\\n\";\n\tpre+=\"iptables -P FORWARD DROP\\n\";\n\tpre+=\"iptables -P OUTPUT DROP\\n\";\n\tpre+=\"\\n\";\n\tpre+=\"iptables -A INPUT -m state --state RELATED,ESTABLISHED -j ACCEPT\\n\";\n\treturn pre;\n}\n\nstd::string gen_rule(const std::string& proto,\n\tconst std::string& l_ip,const std::string& l_mask,const std::string& l_port,\n\tconst std::string& dir,\n\tconst std::string& f_ip,const std::string& f_mask,const std::string& f_port,\n\tconst std::string& action,\n\tconst bool V6)\n{\n\n\tif(dir==\"<>\")\n\t{\n\t\tstd::string rules;\n\t\trules+=gen_rule(proto,l_ip,l_mask,l_port,\"<\",f_ip,f_mask,f_port,action,V6);\n\t\trules+=\"\\n\";\n\t\trules+=gen_rule(proto,l_ip,l_mask,l_port,\">\",f_ip,f_mask,f_port,action,V6);\n\t\treturn rules;\n\t}\n\n\tstd::string rule;\n\tif(V6)\n\t\trule+=\"ip6tables\";\n\telse\n\t\trule+=\"iptables\";\n\trule+=\" --append \";\n\tstd::string l_letter=\"s\";\n\tstd::string f_letter=\"d\";\n\tif(dir==\"<\")\n\t{\n\t\trule+=\"INPUT \";\n\t\tstd::swap(l_letter,f_letter);\n\t}\n\telse\n\t\trule+=\"OUTPUT\";\n\trule+=\" -p \"+proto;\n\trule+=\" -\" +l_letter+\" \" +l_ip+\"\/\"+l_mask;\n\n\tif(l_port!=\"0\")\n\t\trule+=\" --\"+l_letter+\"port \"+l_port;\n\trule+=\" -\" +f_letter+\" \" +f_ip+\"\/\"+f_mask;\n\tif(f_port!=\"0\")\n\t\trule+=\" --\"+f_letter+\"port \"+f_port;\n\trule+=\" --jump \";\n\tif(action==\"deny\")\n\t\trule+=\"DROP\";\n\telse\n\t\trule+=\"ACCEPT\";\n\treturn rule;\n}\n\n\/\/iptables --append INPUT -p tcp -d any --dport 20 -s any --sport any --jump ACCEPT<commit_msg>Removed comment from iptables (which works now...last commit message somehow got overwritten with \"mend\"...).<commit_after>#include <string>\n\nstd::string pre_rules()\n{\n\tstd::string pre;\n\tpre+=\"iptables -F\\n\";\n\tpre+=\"iptables -X\\n\";\n\tpre+=\"\\n\";\n\tpre+=\"iptables -P INPUT DROP\\n\";\n\tpre+=\"iptables -P FORWARD DROP\\n\";\n\tpre+=\"iptables -P OUTPUT DROP\\n\";\n\tpre+=\"\\n\";\n\tpre+=\"iptables -A INPUT -m state --state RELATED,ESTABLISHED -j ACCEPT\\n\";\n\treturn pre;\n}\n\nstd::string gen_rule(const std::string& proto,\n\tconst std::string& l_ip,const std::string& l_mask,const std::string& l_port,\n\tconst std::string& dir,\n\tconst std::string& f_ip,const std::string& f_mask,const std::string& f_port,\n\tconst std::string& action,\n\tconst bool V6)\n{\n\n\tif(dir==\"<>\")\n\t{\n\t\tstd::string rules;\n\t\trules+=gen_rule(proto,l_ip,l_mask,l_port,\"<\",f_ip,f_mask,f_port,action,V6);\n\t\trules+=\"\\n\";\n\t\trules+=gen_rule(proto,l_ip,l_mask,l_port,\">\",f_ip,f_mask,f_port,action,V6);\n\t\treturn rules;\n\t}\n\n\tstd::string rule;\n\tif(V6)\n\t\trule+=\"ip6tables\";\n\telse\n\t\trule+=\"iptables\";\n\trule+=\" --append \";\n\tstd::string l_letter=\"s\";\n\tstd::string f_letter=\"d\";\n\tif(dir==\"<\")\n\t{\n\t\trule+=\"INPUT \";\n\t\tstd::swap(l_letter,f_letter);\n\t}\n\telse\n\t\trule+=\"OUTPUT\";\n\trule+=\" -p \"+proto;\n\trule+=\" -\" +l_letter+\" \" +l_ip+\"\/\"+l_mask;\n\n\tif(l_port!=\"0\")\n\t\trule+=\" --\"+l_letter+\"port \"+l_port;\n\trule+=\" -\" +f_letter+\" \" +f_ip+\"\/\"+f_mask;\n\tif(f_port!=\"0\")\n\t\trule+=\" --\"+f_letter+\"port \"+f_port;\n\trule+=\" --jump \";\n\tif(action==\"deny\")\n\t\trule+=\"DROP\";\n\telse\n\t\trule+=\"ACCEPT\";\n\treturn rule;\n}<|endoftext|>"} {"text":"<commit_before>\/* Copyright (C) 2000 MySQL AB\n\n This program is free software; you can redistribute it and\/or modify\n it under the terms of the GNU General Public License as published by\n the Free Software Foundation; either version 2 of the License, or\n (at your option) any later version.\n\n This program is distributed in the hope that it will be useful,\n but WITHOUT ANY WARRANTY; without even the implied warranty of\n MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the\n GNU General Public License for more details.\n\n You should have received a copy of the GNU General Public License\n along with this program; if not, write to the Free Software\n Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA *\/\n\n\n\/*\n UNION of select's\n UNION's were introduced by Monty and Sinisa <sinisa@mysql.com>\n*\/\n\n\n#include \"mysql_priv.h\"\n#include \"sql_select.h\"\n\n\nint mysql_union(THD *thd, LEX *lex,select_result *result)\n{\n SELECT_LEX *sl, *last_sl, *lex_sl;\n ORDER *order;\n List<Item> item_list;\n TABLE *table;\n int describe=(lex->select_lex.options & SELECT_DESCRIBE) ? 1 : 0;\n int res, add_rows=0;\n bool found_rows_for_union= lex->select_lex.options & OPTION_FOUND_ROWS;\n TABLE_LIST result_table_list;\n TABLE_LIST *first_table=(TABLE_LIST *)lex->select_lex.table_list.first;\n TMP_TABLE_PARAM tmp_table_param;\n select_union *union_result;\n DBUG_ENTER(\"mysql_union\");\n\n \/* Fix tables 'to-be-unioned-from' list to point at opened tables *\/\n last_sl= &lex->select_lex;\n for (sl= last_sl;\n sl && sl->linkage != NOT_A_SELECT;\n last_sl=sl, sl=sl->next)\n {\n for (TABLE_LIST *cursor= (TABLE_LIST *)sl->table_list.first;\n\t cursor;\n\t cursor=cursor->next)\n {\n cursor->table= (my_reinterpret_cast(TABLE_LIST*) (cursor->table))->table;\n }\n }\n\n \/* last_sel now points at the last select where the ORDER BY is stored *\/\n if (sl)\n {\n \/*\n The found SL is an extra SELECT_LEX argument that contains\n the ORDER BY and LIMIT parameter for the whole UNION\n *\/\n lex_sl= sl;\n order= (ORDER *) lex_sl->order_list.first;\n \/\/ This is done to eliminate unnecessary slowing down of the first query \n if (!order || !describe) \n last_sl->next=0;\t\t\t\t\/\/ Remove this extra element\n }\n else if (!last_sl->braces)\n {\n lex_sl= last_sl;\t\t\t\t\/\/ ORDER BY is here\n order= (ORDER *) lex_sl->order_list.first;\n }\n else\n {\n lex_sl=0;\n order=0;\n }\n \n if (describe)\n {\n Item *item;\n item_list.push_back(new Item_empty_string(\"table\",NAME_LEN));\n item_list.push_back(new Item_empty_string(\"type\",10));\n item_list.push_back(item=new Item_empty_string(\"possible_keys\",\n\t\t\t\t\t\t NAME_LEN*MAX_KEY));\n item->maybe_null=1;\n item_list.push_back(item=new Item_empty_string(\"key\",NAME_LEN));\n item->maybe_null=1;\n item_list.push_back(item=new Item_int(\"key_len\",0,3));\n item->maybe_null=1;\n item_list.push_back(item=new Item_empty_string(\"ref\",\n\t\t\t\t\t\t NAME_LEN*MAX_REF_PARTS));\n item->maybe_null=1;\n item_list.push_back(new Item_real(\"rows\",0.0,0,10));\n item_list.push_back(new Item_empty_string(\"Extra\",255));\n }\n else\n {\n Item *item;\n List_iterator<Item> it(lex->select_lex.item_list);\n TABLE_LIST *first_table= (TABLE_LIST*) lex->select_lex.table_list.first;\n\n \/* Create a list of items that will be in the result set *\/\n while ((item= it++))\n if (item_list.push_back(item))\n\tDBUG_RETURN(-1);\n if (setup_tables(first_table) ||\n\tsetup_fields(thd,first_table,item_list,0,0,1))\n DBUG_RETURN(-1);\n }\n\n bzero((char*) &tmp_table_param,sizeof(tmp_table_param));\n tmp_table_param.field_count=item_list.elements;\n if (!(table=create_tmp_table(thd, &tmp_table_param, item_list,\n\t\t\t (ORDER*) 0, !describe & !lex->union_option,\n\t\t\t 1, 0,\n\t\t\t (lex->select_lex.options | thd->options |\n\t\t\t\tTMP_TABLE_ALL_COLUMNS))))\n DBUG_RETURN(-1);\n table->file->extra(HA_EXTRA_WRITE_CACHE);\n table->file->extra(HA_EXTRA_IGNORE_DUP_KEY);\n bzero((char*) &result_table_list,sizeof(result_table_list));\n result_table_list.db= (char*) \"\";\n result_table_list.real_name=result_table_list.alias= (char*) \"union\";\n result_table_list.table=table;\n\n if (!(union_result=new select_union(table)))\n {\n res= -1;\n goto exit;\n }\n union_result->not_describe= !describe;\n union_result->tmp_table_param=&tmp_table_param;\n for (sl= &lex->select_lex; sl; sl=sl->next)\n {\n unsigned int rows;\n lex->select=sl;\n thd->offset_limit=sl->offset_limit;\n thd->select_limit=sl->select_limit+sl->offset_limit;\n if (thd->select_limit < sl->select_limit)\n thd->select_limit= HA_POS_ERROR;\t\t\/\/ no limit\n if (thd->select_limit == HA_POS_ERROR || sl->braces)\n sl->options&= ~OPTION_FOUND_ROWS;\n else if (found_rows_for_union)\n {\n rows= thd->select_limit;\n sl->options|= OPTION_FOUND_ROWS;\n }\n\n res=mysql_select(thd, (describe && sl->linkage==NOT_A_SELECT) ?\n\t\t first_table : (TABLE_LIST*) sl->table_list.first,\n\t\t sl->item_list,\n\t\t sl->where,\n\t\t (sl->braces) ? (ORDER *)sl->order_list.first :\n\t\t (ORDER *) 0,\n\t\t (ORDER*) sl->group_list.first,\n\t\t sl->having,\n\t\t (ORDER*) NULL,\n\t\t sl->options | thd->options | SELECT_NO_UNLOCK |\n\t\t ((describe) ? SELECT_DESCRIBE : 0),\n\t\t union_result);\n if (found_rows_for_union && !sl->braces && sl->options & OPTION_FOUND_ROWS)\n add_rows+= (thd->limit_found_rows > rows) ? thd->limit_found_rows - rows : 0;\n if (res)\n goto exit;\n }\n if (union_result->flush())\n {\n res= 1;\t\t\t\t\t\/\/ Error is already sent\n goto exit;\n }\n delete union_result;\n\n \/* Send result to 'result' *\/\n lex->select = &lex->select_lex;\n res =-1;\n {\n \/* Create a list of fields in the temporary table *\/\n List_iterator<Item> it(item_list);\n Field **field;\n#if 0\n List<Item_func_match> ftfunc_list;\n ftfunc_list.empty();\n#else\n thd->lex.select_lex.ftfunc_list.empty();\n#endif\n\n for (field=table->field ; *field ; field++)\n {\n (void) it++;\n (void) it.replace(new Item_field(*field));\n }\n if (!thd->fatal_error)\t\t\t\/\/ Check if EOM\n {\n if (lex_sl)\n {\n\tthd->offset_limit=lex_sl->offset_limit;\n\tthd->select_limit=lex_sl->select_limit+lex_sl->offset_limit;\n\tif (thd->select_limit < lex_sl->select_limit)\n\t thd->select_limit= HA_POS_ERROR;\t\t\/\/ no limit\n\tif (thd->select_limit == HA_POS_ERROR)\n\t thd->options&= ~OPTION_FOUND_ROWS;\n }\n else \n {\n\tthd->offset_limit= 0;\n\tthd->select_limit= thd->variables.select_limit;\n\tif (found_rows_for_union && !describe)\n\t thd->options|= OPTION_FOUND_ROWS;\n }\n if (describe)\n\tthd->select_limit= HA_POS_ERROR;\t\t\/\/ no limit\n \n res=mysql_select(thd,&result_table_list,\n\t\t item_list, NULL, (describe) ? 0 : order,\n\t\t (ORDER*) NULL, NULL, (ORDER*) NULL,\n\t\t thd->options, result);\n if (found_rows_for_union && !res)\n {\n\tthd->limit_found_rows= table->file->records;\n\tif (!last_sl->braces)\n\t thd->limit_found_rows+= add_rows;\n }\n }\n }\n\nexit:\n free_tmp_table(thd,table);\n DBUG_RETURN(res);\n}\n\n\n\/***************************************************************************\n** store records in temporary table for UNION\n***************************************************************************\/\n\nselect_union::select_union(TABLE *table_par)\n :table(table_par), not_describe(0)\n{\n bzero((char*) &info,sizeof(info));\n \/*\n We can always use DUP_IGNORE because the temporary table will only\n contain a unique key if we are using not using UNION ALL\n *\/\n info.handle_duplicates=DUP_IGNORE;\n}\n\nselect_union::~select_union()\n{\n}\n\n\nint select_union::prepare(List<Item> &list)\n{\n if (not_describe && list.elements != table->fields)\n {\n my_message(ER_WRONG_NUMBER_OF_COLUMNS_IN_SELECT,\n\t ER(ER_WRONG_NUMBER_OF_COLUMNS_IN_SELECT),MYF(0));\n return -1;\n }\n return 0;\n}\n\nbool select_union::send_data(List<Item> &values)\n{\n if (thd->offset_limit)\n {\t\t\t\t\t\t\/\/ using limit offset,count\n thd->offset_limit--;\n return 0;\n }\n\n fill_record(table->field, values, 1);\n if ((write_record(table,&info)))\n {\n if (create_myisam_from_heap(thd, table, tmp_table_param, info.last_errno,\n\t\t\t\t1))\n return 1;\n }\n return 0;\n}\n\nbool select_union::send_eof()\n{\n return 0;\n}\n\nbool select_union::flush()\n{\n int error;\n if ((error=table->file->extra(HA_EXTRA_NO_CACHE)))\n {\n table->file->print_error(error,MYF(0));\n ::send_error(&thd->net);\n return 1;\n }\n return 0;\n}\n<commit_msg>sql_union.cc: Merge fix<commit_after>\/* Copyright (C) 2000 MySQL AB\n\n This program is free software; you can redistribute it and\/or modify\n it under the terms of the GNU General Public License as published by\n the Free Software Foundation; either version 2 of the License, or\n (at your option) any later version.\n\n This program is distributed in the hope that it will be useful,\n but WITHOUT ANY WARRANTY; without even the implied warranty of\n MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the\n GNU General Public License for more details.\n\n You should have received a copy of the GNU General Public License\n along with this program; if not, write to the Free Software\n Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA *\/\n\n\n\/*\n UNION of select's\n UNION's were introduced by Monty and Sinisa <sinisa@mysql.com>\n*\/\n\n\n#include \"mysql_priv.h\"\n#include \"sql_select.h\"\n\n\nint mysql_union(THD *thd, LEX *lex,select_result *result)\n{\n SELECT_LEX *sl, *last_sl, *lex_sl;\n ORDER *order;\n List<Item> item_list;\n TABLE *table;\n int res;\n ulonglong add_rows= 0;\n ulong found_rows_for_union= lex->select_lex.options & OPTION_FOUND_ROWS;\n ulong describe= lex->select_lex.options & SELECT_DESCRIBE;\n TABLE_LIST result_table_list;\n TABLE_LIST *first_table=(TABLE_LIST *)lex->select_lex.table_list.first;\n TMP_TABLE_PARAM tmp_table_param;\n select_union *union_result;\n DBUG_ENTER(\"mysql_union\");\n\n \/* Fix tables 'to-be-unioned-from' list to point at opened tables *\/\n last_sl= &lex->select_lex;\n for (sl= last_sl;\n sl && sl->linkage != NOT_A_SELECT;\n last_sl=sl, sl=sl->next)\n {\n for (TABLE_LIST *cursor= (TABLE_LIST *)sl->table_list.first;\n\t cursor;\n\t cursor=cursor->next)\n {\n cursor->table= (my_reinterpret_cast(TABLE_LIST*) (cursor->table))->table;\n }\n }\n\n \/* last_sel now points at the last select where the ORDER BY is stored *\/\n if (sl)\n {\n \/*\n The found SL is an extra SELECT_LEX argument that contains\n the ORDER BY and LIMIT parameter for the whole UNION\n *\/\n lex_sl= sl;\n order= (ORDER *) lex_sl->order_list.first;\n \/\/ This is done to eliminate unnecessary slowing down of the first query \n if (!order || !describe) \n last_sl->next=0;\t\t\t\t\/\/ Remove this extra element\n }\n else if (!last_sl->braces)\n {\n lex_sl= last_sl;\t\t\t\t\/\/ ORDER BY is here\n order= (ORDER *) lex_sl->order_list.first;\n }\n else\n {\n lex_sl=0;\n order=0;\n }\n \n if (describe)\n {\n Item *item;\n item_list.push_back(new Item_empty_string(\"table\",NAME_LEN));\n item_list.push_back(new Item_empty_string(\"type\",10));\n item_list.push_back(item=new Item_empty_string(\"possible_keys\",\n\t\t\t\t\t\t NAME_LEN*MAX_KEY));\n item->maybe_null=1;\n item_list.push_back(item=new Item_empty_string(\"key\",NAME_LEN));\n item->maybe_null=1;\n item_list.push_back(item=new Item_int(\"key_len\",0,3));\n item->maybe_null=1;\n item_list.push_back(item=new Item_empty_string(\"ref\",\n\t\t\t\t\t\t NAME_LEN*MAX_REF_PARTS));\n item->maybe_null=1;\n item_list.push_back(new Item_real(\"rows\",0.0,0,10));\n item_list.push_back(new Item_empty_string(\"Extra\",255));\n }\n else\n {\n Item *item;\n List_iterator<Item> it(lex->select_lex.item_list);\n TABLE_LIST *first_table= (TABLE_LIST*) lex->select_lex.table_list.first;\n\n \/* Create a list of items that will be in the result set *\/\n while ((item= it++))\n if (item_list.push_back(item))\n\tDBUG_RETURN(-1);\n if (setup_tables(first_table) ||\n\tsetup_fields(thd,first_table,item_list,0,0,1))\n DBUG_RETURN(-1);\n }\n\n bzero((char*) &tmp_table_param,sizeof(tmp_table_param));\n tmp_table_param.field_count=item_list.elements;\n if (!(table=create_tmp_table(thd, &tmp_table_param, item_list,\n\t\t\t (ORDER*) 0, !describe & !lex->union_option,\n\t\t\t 1, 0,\n\t\t\t (lex->select_lex.options | thd->options |\n\t\t\t\tTMP_TABLE_ALL_COLUMNS))))\n DBUG_RETURN(-1);\n table->file->extra(HA_EXTRA_WRITE_CACHE);\n table->file->extra(HA_EXTRA_IGNORE_DUP_KEY);\n bzero((char*) &result_table_list,sizeof(result_table_list));\n result_table_list.db= (char*) \"\";\n result_table_list.real_name=result_table_list.alias= (char*) \"union\";\n result_table_list.table=table;\n\n if (!(union_result=new select_union(table)))\n {\n res= -1;\n goto exit;\n }\n union_result->not_describe= !describe;\n union_result->tmp_table_param=&tmp_table_param;\n for (sl= &lex->select_lex; sl; sl=sl->next)\n {\n ha_rows records_at_start; \n lex->select=sl;\n \/* Don't use offset for the last union if there is no braces *\/\n thd->offset_limit= sl != lex_sl ? sl->offset_limit : 0;\n thd->select_limit=sl->select_limit+sl->offset_limit;\n if (thd->select_limit < sl->select_limit)\n thd->select_limit= HA_POS_ERROR;\t\t\/\/ no limit\n \/*\n When using braces, SQL_CALC_FOUND_ROWS affects the whole query.\n We don't calculate found_rows() per union part\n *\/\n if (thd->select_limit == HA_POS_ERROR || sl->braces)\n sl->options&= ~OPTION_FOUND_ROWS;\n else \n {\n \/*\n \tWe are doing an union without braces. In this case\n \tSQL_CALC_FOUND_ROWS should be done on all sub parts\n *\/\n sl->options|= found_rows_for_union;\n }\n \n records_at_start= table->file->records;\n\n res=mysql_select(thd, (describe && sl->linkage==NOT_A_SELECT) ?\n\t\t first_table : (TABLE_LIST*) sl->table_list.first,\n\t\t sl->item_list,\n\t\t sl->where,\n\t\t (sl->braces) ? (ORDER *)sl->order_list.first :\n\t\t (ORDER *) 0,\n\t\t (ORDER*) sl->group_list.first,\n\t\t sl->having,\n\t\t (ORDER*) NULL,\n\t\t sl->options | thd->options | SELECT_NO_UNLOCK |\n\t\t describe,\n\t\t union_result);\n if (res)\n goto exit;\n \/* Needed for the following test and for records_at_start in next loop *\/\n table->file->info(HA_STATUS_VARIABLE);\n if (found_rows_for_union & sl->options)\n {\n \/*\n \tThis is a union without braces. Remember the number of rows that could\n \talso have been part of the result set.\n \tWe get this from the difference of between total number of possible\n \trows and actual rows added to the temporary table.\n *\/\n add_rows+= (ulonglong) (thd->limit_found_rows - (table->file->records -\n \t\t\t\t\t\t records_at_start));\n }\n }\n if (union_result->flush())\n {\n res= 1;\t\t\t\t\t\/\/ Error is already sent\n goto exit;\n }\n delete union_result;\n\n \/* Send result to 'result' *\/\n lex->select = &lex->select_lex;\n res =-1;\n {\n \/* Create a list of fields in the temporary table *\/\n List_iterator<Item> it(item_list);\n Field **field;\n#if 0\n List<Item_func_match> ftfunc_list;\n ftfunc_list.empty();\n#else\n thd->lex.select_lex.ftfunc_list.empty();\n#endif\n\n for (field=table->field ; *field ; field++)\n {\n (void) it++;\n (void) it.replace(new Item_field(*field));\n }\n if (!thd->fatal_error)\t\t\t\/\/ Check if EOM\n {\n if (lex_sl)\n {\n\tthd->offset_limit=lex_sl->offset_limit;\n\tthd->select_limit=lex_sl->select_limit+lex_sl->offset_limit;\n\tif (thd->select_limit < lex_sl->select_limit)\n\t thd->select_limit= HA_POS_ERROR;\t\t\/\/ no limit\n\tif (thd->select_limit == HA_POS_ERROR)\n\t thd->options&= ~OPTION_FOUND_ROWS;\n }\n else \n {\n\tthd->offset_limit= 0;\n\tthd->select_limit= thd->variables.select_limit;\n\tif (found_rows_for_union && !describe)\n\t thd->options|= OPTION_FOUND_ROWS;\n }\n if (describe)\n\tthd->select_limit= HA_POS_ERROR;\t\t\/\/ no limit\n \n res=mysql_select(thd,&result_table_list,\n\t\t item_list, NULL, (describe) ? 0 : order,\n\t\t (ORDER*) NULL, NULL, (ORDER*) NULL,\n\t\t thd->options, result);\n if (!res)\n \tthd->limit_found_rows = (ulonglong)table->file->records + add_rows;\n }\n }\n\nexit:\n free_tmp_table(thd,table);\n DBUG_RETURN(res);\n}\n\n\n\/***************************************************************************\n** store records in temporary table for UNION\n***************************************************************************\/\n\nselect_union::select_union(TABLE *table_par)\n :table(table_par), not_describe(0)\n{\n bzero((char*) &info,sizeof(info));\n \/*\n We can always use DUP_IGNORE because the temporary table will only\n contain a unique key if we are using not using UNION ALL\n *\/\n info.handle_duplicates=DUP_IGNORE;\n}\n\nselect_union::~select_union()\n{\n}\n\n\nint select_union::prepare(List<Item> &list)\n{\n if (not_describe && list.elements != table->fields)\n {\n my_message(ER_WRONG_NUMBER_OF_COLUMNS_IN_SELECT,\n\t ER(ER_WRONG_NUMBER_OF_COLUMNS_IN_SELECT),MYF(0));\n return -1;\n }\n return 0;\n}\n\nbool select_union::send_data(List<Item> &values)\n{\n if (thd->offset_limit)\n {\t\t\t\t\t\t\/\/ using limit offset,count\n thd->offset_limit--;\n return 0;\n }\n\n fill_record(table->field, values, 1);\n if ((write_record(table,&info)))\n {\n if (create_myisam_from_heap(thd, table, tmp_table_param, info.last_errno,\n\t\t\t\t1))\n return 1;\n }\n return 0;\n}\n\nbool select_union::send_eof()\n{\n return 0;\n}\n\nbool select_union::flush()\n{\n int error;\n if ((error=table->file->extra(HA_EXTRA_NO_CACHE)))\n {\n table->file->print_error(error,MYF(0));\n ::send_error(&thd->net);\n return 1;\n }\n return 0;\n}\n<|endoftext|>"} {"text":"<commit_before>#include \"genomeParametersWrite.h\"\n#include \"streamFuns.h\"\n\nvoid genomeParametersWrite(string fileName, Parameters& P, string errorOut)\n{\/\/write the genome information into the genomePar stream\n ofstream & genomePar = ofstrOpen(fileName, errorOut, P);\n\n genomePar << \"### \"<<P.commandLineFull <<\"\\n\";\n\n genomePar << \"versionGenome\\t\" << P.versionSTAR <<\"\\n\";\n genomePar << \"pGe.gFastaFiles\\t\";\n for (uint ii=0;ii<P.pGe.gFastaFiles.size();ii++) genomePar << P.pGe.gFastaFiles.at(ii) << \" \";\n genomePar << \"\\n\";\n genomePar << \"pGe.gSAindexNbases\\t\" << P.pGe.gSAindexNbases << \"\\n\";\n genomePar << \"pGe.gChrBinNbits\\t\" << P.pGe.gChrBinNbits << \"\\n\";\n genomePar << \"pGe.gSAsparseD\\t\" << P.pGe.gSAsparseD <<\"\\n\";\n genomePar << \"pGe.sjdbOverhang\\t\" << P.pGe.sjdbOverhang <<\"\\n\";\n\n genomePar << \"pGe.sjdbFileChrStartEnd\\t\";\n for (uint ii=0;ii<P.pGe.sjdbFileChrStartEnd.size();ii++) genomePar<< P.pGe.sjdbFileChrStartEnd.at(ii) << \" \";\n genomePar<<\"\\n\";\n\n genomePar << \"pGe.sjdbGTFfile\\t\" << P.pGe.sjdbGTFfile <<\"\\n\";\n genomePar << \"pGe.sjdbGTFchrPrefix\\t\" << P.pGe.sjdbGTFchrPrefix <<\"\\n\";\n genomePar << \"pGe.sjdbGTFfeatureExon\\t\" << P.pGe.sjdbGTFfeatureExon <<\"\\n\";\n genomePar << \"pGe.sjdbGTFtagExonParentTranscript\\t\" << P.pGe.sjdbGTFtagExonParentTranscript <<\"\\n\";\n genomePar << \"pGe.sjdbGTFtagExonParentGene\\t\" << P.pGe.sjdbGTFtagExonParentGene <<\"\\n\";\n\n genomePar << \"pGe.sjdbInsertSave\\t\" << P.pGe.sjdbInsertSave <<\"\\n\";\n \n genomePar << \"pGe.gFileSizes\\t\" << P.pGe.gFileSizes.at(0);\n for (uint ii=1;ii<P.pGe.gFileSizes.size();ii++) \n genomePar << \" \" << P.pGe.gFileSizes.at(ii) ;\n genomePar << \"\\n\";\n\n genomePar.close();\n};\n<commit_msg>Added pGe to Genome class. Compiles and runs OK.<commit_after>#include \"genomeParametersWrite.h\"\n#include \"streamFuns.h\"\n\nvoid genomeParametersWrite(string fileName, Parameters& P, string errorOut)\n{\/\/write the genome information into the genomePar stream\n ofstream & genomePar = ofstrOpen(fileName, errorOut, P);\n\n genomePar << \"### \"<<P.commandLineFull <<\"\\n\";\n\n genomePar << \"versionGenome\\t\" << P.versionSTAR <<\"\\n\";\n genomePar << \"genomeFastaFiles\\t\";\n for (uint ii=0;ii<P.pGe.gFastaFiles.size();ii++) genomePar << P.pGe.gFastaFiles.at(ii) << \" \";\n genomePar << \"\\n\";\n genomePar << \"genomeSAindexNbases\\t\" << P.pGe.gSAindexNbases << \"\\n\";\n genomePar << \"genomeChrBinNbits\\t\" << P.pGe.gChrBinNbits << \"\\n\";\n genomePar << \"genomeSAsparseD\\t\" << P.pGe.gSAsparseD <<\"\\n\";\n genomePar << \"sjdbOverhang\\t\" << P.pGe.sjdbOverhang <<\"\\n\";\n\n genomePar << \"sjdbFileChrStartEnd\\t\";\n for (uint ii=0;ii<P.pGe.sjdbFileChrStartEnd.size();ii++) genomePar<< P.pGe.sjdbFileChrStartEnd.at(ii) << \" \";\n genomePar<<\"\\n\";\n\n genomePar << \"sjdbGTFfile\\t\" << P.pGe.sjdbGTFfile <<\"\\n\";\n genomePar << \"sjdbGTFchrPrefix\\t\" << P.pGe.sjdbGTFchrPrefix <<\"\\n\";\n genomePar << \"sjdbGTFfeatureExon\\t\" << P.pGe.sjdbGTFfeatureExon <<\"\\n\";\n genomePar << \"sjdbGTFtagExonParentTranscript\\t\" << P.pGe.sjdbGTFtagExonParentTranscript <<\"\\n\";\n genomePar << \"sjdbGTFtagExonParentGene\\t\" << P.pGe.sjdbGTFtagExonParentGene <<\"\\n\";\n\n genomePar << \"sjdbInsertSave\\t\" << P.pGe.sjdbInsertSave <<\"\\n\";\n \n genomePar << \"genomeFileSizes\\t\" << P.pGe.gFileSizes.at(0);\n for (uint ii=1;ii<P.pGe.gFileSizes.size();ii++) \n genomePar << \" \" << P.pGe.gFileSizes.at(ii) ;\n genomePar << \"\\n\";\n\n genomePar.close();\n};\n<|endoftext|>"} {"text":"<commit_before>\/*****************************************************************************************\n * *\n * OpenSpace *\n * *\n * Copyright (c) 2014-2017 *\n * *\n * Permission is hereby granted, free of charge, to any person obtaining a copy of this *\n * software and associated documentation files (the \"Software\"), to deal in the Software *\n * without restriction, including without limitation the rights to use, copy, modify, *\n * merge, publish, distribute, sublicense, and\/or sell copies of the Software, and to *\n * permit persons to whom the Software is furnished to do so, subject to the following *\n * conditions: *\n * *\n * The above copyright notice and this permission notice shall be included in all copies *\n * or substantial portions of the Software. *\n * *\n * THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR IMPLIED, *\n * INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS FOR A *\n * PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT *\n * HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF *\n * CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE *\n * OR THE USE OR OTHER DEALINGS IN THE SOFTWARE. *\n ****************************************************************************************\/\n\n#include <openspace\/performance\/performancemanager.h>\n\n#include <openspace\/scene\/scenegraphnode.h>\n#include <openspace\/performance\/performancelayout.h>\n\n#include <ghoul\/logging\/logmanager.h>\n#include <ghoul\/misc\/sharedmemory.h>\n#include <ghoul\/misc\/onscopeexit.h>\n#include <ghoul\/filesystem\/filesystem.h>\n\n#include <algorithm>\n#include <cstring>\n#include <iostream>\n#include <fstream>\n\nnamespace {\n const char* _loggerCat = \"PerformanceManager\";\n \n const char* GlobalSharedMemoryName = \"OpenSpacePerformanceMeasurementData\";\n \/\/ Probably 255 performance blocks per node are enough, so we can get away with\n \/\/ 4 bytes (one uint8_t for the number, one uint8_t for the reference count to keep\n \/\/ the global memory alive, and 2 bytes to enforce alignment)\n const size_t GlobalSharedMemorySize = 4;\n \n struct GlobalMemory {\n uint8_t number;\n uint8_t referenceCount;\n \n std::array<uint8_t, 2> alignment;\n };\n \n const char* LocalSharedMemoryNameBase = \"PerformanceMeasurement_\";\n}\n\nnamespace openspace {\nnamespace performance {\n\n\/\/ The Performance Manager will use a level of indirection in order to support multiple\n\/\/ PerformanceManagers running in parallel:\n\/\/ The ghoul::SharedData block addressed by OpenSpacePerformanceMeasurementSharedData\n\/\/ will only get allocated once and contains the total number of allocated shared memory\n\/\/ blocks alongside a list of names of these blocks\n\/\/\n\nvoid PerformanceManager::createGlobalSharedMemory() {\n static_assert(\n sizeof(GlobalMemory) == GlobalSharedMemorySize,\n \"The global memory struct does not fit the allocated global memory space\"\n );\n \n using ghoul::SharedMemory;\n \n if (SharedMemory::exists(GlobalSharedMemoryName)) {\n SharedMemory sharedMemory(GlobalSharedMemoryName);\n sharedMemory.acquireLock();\n GlobalMemory* m = reinterpret_cast<GlobalMemory*>(sharedMemory.memory());\n ++(m->referenceCount);\n LINFO(\n \"Using global shared memory block for performance measurements. \"\n \"Reference count: \" << int(m->referenceCount)\n );\n sharedMemory.releaseLock();\n }\n else {\n LINFO(\"Creating global shared memory block for performance measurements\");\n SharedMemory::create(GlobalSharedMemoryName, GlobalSharedMemorySize);\n \n \/\/ Initialize the data\n SharedMemory sharedMemory(GlobalSharedMemoryName);\n sharedMemory.acquireLock();\n new (sharedMemory.memory()) GlobalMemory;\n GlobalMemory* m = reinterpret_cast<GlobalMemory*>(sharedMemory.memory());\n m->number = 0;\n m->referenceCount = 1;\n sharedMemory.releaseLock();\n }\n}\n\nvoid PerformanceManager::destroyGlobalSharedMemory() {\n using ghoul::SharedMemory;\n if (!SharedMemory::exists(GlobalSharedMemoryName)) {\n LWARNING(\"Global shared memory for Performance measurements did not exist\");\n return;\n }\n \n SharedMemory sharedMemory(GlobalSharedMemoryName);\n sharedMemory.acquireLock();\n GlobalMemory* m = reinterpret_cast<GlobalMemory*>(sharedMemory.memory());\n --(m->referenceCount);\n LINFO(\"Global shared performance memory reference count: \" << int(m->referenceCount));\n if (m->referenceCount == 0) {\n LINFO(\"Removing global shared performance memory\");\n \n \/\/ When the global memory is deleted, we have to get rid of all local memory as\n \/\/ well. In principle, none should be left, but OpenSpace crashing might leave\n \/\/ some of the memory orphaned\n for (int i = 0; i < std::numeric_limits<uint8_t>::max(); ++i) {\n std::string localName = LocalSharedMemoryNameBase + std::to_string(i);\n if (SharedMemory::exists(localName)) {\n LINFO(\"Removing shared memory: \" << localName);\n SharedMemory::remove(localName);\n }\n }\n \n SharedMemory::remove(GlobalSharedMemoryName);\n }\n sharedMemory.releaseLock();\n}\n \nPerformanceManager::PerformanceManager()\n : _performanceMemory(nullptr)\n , _tick(0)\n , _loggingEnabled(false)\n , _logDir(absPath(\"${BASE_PATH}\"))\n , _prefix(\"PM-\")\n , _suffix(\"\")\n , _ext(\"log\")\n{\n using ghoul::SharedMemory;\n PerformanceManager::createGlobalSharedMemory();\n \n \n SharedMemory sharedMemory(GlobalSharedMemoryName);\n sharedMemory.acquireLock();\n OnExit([&](){sharedMemory.releaseLock();});\n \n GlobalMemory* m = reinterpret_cast<GlobalMemory*>(sharedMemory.memory());\n\n \/\/ The the first free block (which also coincides with the number of blocks\n uint8_t blockIndex = m->number;\n ++(m->number);\n\n std::string localName = LocalSharedMemoryNameBase + std::to_string(blockIndex);\n \n \/\/ Compute the total size\n const int totalSize = sizeof(PerformanceLayout);\n LINFO(\"Create shared memory '\" + localName + \"' of \" << totalSize << \" bytes\");\n\n if (SharedMemory::exists(localName)) {\n throw ghoul::RuntimeError(\n \"Shared Memory '\" + localName + \"' block already existed\"\n );\n }\n \n ghoul::SharedMemory::create(localName, totalSize);\n\n _performanceMemory = std::make_unique<ghoul::SharedMemory>(localName);\n \/\/ Using the placement-new to create a PerformanceLayout in the shared memory\n new (_performanceMemory->memory()) PerformanceLayout;\n}\n\nPerformanceManager::~PerformanceManager() {\n if (_performanceMemory) {\n ghoul::SharedMemory sharedMemory(GlobalSharedMemoryName);\n sharedMemory.acquireLock();\n GlobalMemory* m = reinterpret_cast<GlobalMemory*>(sharedMemory.memory());\n --(m->number);\n sharedMemory.releaseLock();\n \n LINFO(\"Remove shared memory '\" << _performanceMemory->name() << \"'\");\n ghoul::SharedMemory::remove(_performanceMemory->name());\n\n _performanceMemory = nullptr;\n\n }\n \n PerformanceManager::destroyGlobalSharedMemory();\n}\n\nvoid PerformanceManager::resetPerformanceMeasurements() {\n \/\/ Using the placement-new to create a PerformanceLayout in the shared memory\n _performanceMemory->acquireLock();\n void* ptr = _performanceMemory->memory();\n new (ptr) PerformanceLayout;\n _performanceMemory->releaseLock();\n \n individualPerformanceLocations.clear();\n}\n \nbool PerformanceManager::isMeasuringPerformance() const {\n return _doPerformanceMeasurements;\n}\n \nvoid PerformanceManager::outputLogs() {\n\n \/\/ Log Layout values\n PerformanceLayout* layout = performanceData();\n\n \/\/ Log function performance\n for (size_t n = 0; n < layout->nFunctionEntries; n++) {\n const auto function = layout->functionEntries[n];\n const std::string filename = formatLogName(function.name);\n std::ofstream out = std::ofstream(absPath(filename));\n\n \/\/ Comma separate data\n for (size_t i = 0; i < PerformanceLayout::NumberValues; i++) {\n const std::vector<float> data = { function.time[i] };\n writeData(out, data);\n }\n out.close();\n }\n\n \/\/ Log scene object performance\n for (size_t n = 0; n < layout->nScaleGraphEntries; n++) {\n const auto node = layout->sceneGraphEntries[n];\n\n \/\/ Open file\n const std::string filename = formatLogName(node.name);\n std::ofstream out = std::ofstream(absPath(filename));\n \n \/\/ Comma separate data\n for (size_t i = 0; i < PerformanceLayout::NumberValues; i++) {\n const std::vector<float> data = {\n node.renderTime[i],\n node.updateRenderable[i],\n node.updateRotation[i],\n node.updateScaling[i],\n node.updateTranslation[i]\n };\n writeData(out, data);\n }\n out.close();\n }\n}\n\nvoid PerformanceManager::writeData(std::ofstream& out, const std::vector<float> data) {\n for (size_t i = 0; i < data.size() - 1; i++) {\n out << data[i] << \",\";\n }\n out << data[data.size() - 1] << \"\\n\";\n}\n\nconst std::string PerformanceManager::formatLogName(std::string nodeName) {\n \/\/ Replace any colons with dashes\n std::replace(nodeName.begin(), nodeName.end(), ':', '-');\n return _logDir + \"\/\" + _prefix + nodeName + _suffix + \".\" + _ext;\n}\n\nvoid PerformanceManager::logDir(std::string dir) {\n _logDir = absPath(dir);\n}\n\nstd::string PerformanceManager::logDir() {\n return _logDir;\n}\n\nvoid PerformanceManager::prefix(std::string prefix) {\n _prefix = prefix;\n}\n\nstd::string PerformanceManager::prefix() {\n return _prefix;\n}\n\nvoid PerformanceManager::enableLogging() {\n setLogging(true);\n}\n\nvoid PerformanceManager::disableLogging() {\n setLogging(false);\n}\n\nvoid PerformanceManager::toggleLogging() {\n _loggingEnabled = !_loggingEnabled;\n}\nvoid PerformanceManager::setLogging(bool enabled) {\n _loggingEnabled = enabled;\n}\n\nbool PerformanceManager::loggingEnabled() {\n return _loggingEnabled;\n}\n\nPerformanceLayout* PerformanceManager::performanceData() {\n void* ptr = _performanceMemory->memory();\n return reinterpret_cast<PerformanceLayout*>(ptr);\n}\n\nvoid PerformanceManager::tick() {\n _tick = (_tick + 1) % PerformanceLayout::NumberValues;\n}\n\nvoid PerformanceManager::storeIndividualPerformanceMeasurement\n (std::string identifier, long long microseconds)\n{\n PerformanceLayout* layout = performanceData();\n _performanceMemory->acquireLock();\n\n auto it = individualPerformanceLocations.find(identifier);\n PerformanceLayout::FunctionPerformanceLayout* p = nullptr;\n if (it == individualPerformanceLocations.end()) {\n p = &(layout->functionEntries[layout->nFunctionEntries]);\n individualPerformanceLocations[identifier] = layout->nFunctionEntries;\n ++(layout->nFunctionEntries);\n }\n else {\n p = &(layout->functionEntries[it->second]);\n }\n#ifdef _MSC_VER\n strcpy_s(p->name, identifier.length() + 1, identifier.c_str());\n#else\n strcpy(p->name, identifier.c_str());\n#endif\n \n std::rotate(\n std::begin(p->time),\n std::next(std::begin(p->time)),\n std::end(p->time)\n );\n p->time[PerformanceLayout::NumberValues - 1] =\n static_cast<float>(microseconds);\n\n _performanceMemory->releaseLock();\n}\n\nvoid PerformanceManager::storeScenePerformanceMeasurements(\n const std::vector<SceneGraphNode*>& sceneNodes)\n{\n using namespace performance;\n\n PerformanceLayout* layout = performanceData();\n _performanceMemory->acquireLock();\n \n int nNodes = static_cast<int>(sceneNodes.size());\n layout->nScaleGraphEntries = static_cast<int16_t>(nNodes);\n for (int i = 0; i < nNodes; ++i) {\n SceneGraphNode* node = sceneNodes[i];\n\n memset(layout->sceneGraphEntries[i].name, 0, PerformanceLayout::LengthName);\n#ifdef _MSC_VER\n strcpy_s(\n layout->sceneGraphEntries[i].name,\n node->name().length() + 1,\n node->name().c_str()\n );\n#else\n strcpy(layout->sceneGraphEntries[i].name, node->name().c_str());\n#endif\n \n SceneGraphNode::PerformanceRecord r = node->performanceRecord();\n PerformanceLayout::SceneGraphPerformanceLayout& entry = layout->sceneGraphEntries[i];\n\n \/\/ Covert nano to microseconds\n const float micro = 1000.f;\n\n std::rotate(\n std::begin(entry.renderTime),\n std::next(std::begin(entry.renderTime)),\n std::end(entry.renderTime)\n );\n entry.renderTime[PerformanceLayout::NumberValues - 1] = r.renderTime \/ micro;\n \n std::rotate(\n std::begin(entry.updateTranslation),\n std::next(std::begin(entry.updateTranslation)),\n std::end(entry.updateTranslation)\n );\n entry.updateTranslation[PerformanceLayout::NumberValues - 1] = r.updateTimeTranslation \/ micro;\n\n std::rotate(\n std::begin(entry.updateRotation),\n std::next(std::begin(entry.updateRotation)),\n std::end(entry.updateRotation)\n );\n entry.updateRotation[PerformanceLayout::NumberValues - 1] = r.updateTimeRotation \/ micro;\n\n std::rotate(\n std::begin(entry.updateScaling),\n std::next(std::begin(entry.updateScaling)),\n std::end(entry.updateScaling)\n );\n entry.updateScaling[PerformanceLayout::NumberValues - 1] = r.updateTimeScaling \/ micro;\n\n std::rotate(\n std::begin(entry.updateRenderable),\n std::next(std::begin(entry.updateRenderable)),\n std::end(entry.updateRenderable)\n );\n entry.updateRenderable[PerformanceLayout::NumberValues - 1] = r.updateTimeRenderable \/ micro;\n }\n _performanceMemory->releaseLock();\n \n if (_loggingEnabled && _tick == PerformanceLayout::NumberValues - 1) outputLogs();\n\n tick();\n}\n\n} \/\/ namespace performance\n} \/\/ namespace openspace\n<commit_msg>Appending to logs now instead of overwriting :-\/<commit_after>\/*****************************************************************************************\n * *\n * OpenSpace *\n * *\n * Copyright (c) 2014-2017 *\n * *\n * Permission is hereby granted, free of charge, to any person obtaining a copy of this *\n * software and associated documentation files (the \"Software\"), to deal in the Software *\n * without restriction, including without limitation the rights to use, copy, modify, *\n * merge, publish, distribute, sublicense, and\/or sell copies of the Software, and to *\n * permit persons to whom the Software is furnished to do so, subject to the following *\n * conditions: *\n * *\n * The above copyright notice and this permission notice shall be included in all copies *\n * or substantial portions of the Software. *\n * *\n * THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR IMPLIED, *\n * INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS FOR A *\n * PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT *\n * HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF *\n * CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE *\n * OR THE USE OR OTHER DEALINGS IN THE SOFTWARE. *\n ****************************************************************************************\/\n\n#include <openspace\/performance\/performancemanager.h>\n\n#include <openspace\/scene\/scenegraphnode.h>\n#include <openspace\/performance\/performancelayout.h>\n\n#include <ghoul\/logging\/logmanager.h>\n#include <ghoul\/misc\/sharedmemory.h>\n#include <ghoul\/misc\/onscopeexit.h>\n#include <ghoul\/filesystem\/filesystem.h>\n\n#include <algorithm>\n#include <cstring>\n#include <iostream>\n#include <fstream>\n\nnamespace {\n const char* _loggerCat = \"PerformanceManager\";\n \n const char* GlobalSharedMemoryName = \"OpenSpacePerformanceMeasurementData\";\n \/\/ Probably 255 performance blocks per node are enough, so we can get away with\n \/\/ 4 bytes (one uint8_t for the number, one uint8_t for the reference count to keep\n \/\/ the global memory alive, and 2 bytes to enforce alignment)\n const size_t GlobalSharedMemorySize = 4;\n \n struct GlobalMemory {\n uint8_t number;\n uint8_t referenceCount;\n \n std::array<uint8_t, 2> alignment;\n };\n \n const char* LocalSharedMemoryNameBase = \"PerformanceMeasurement_\";\n}\n\nnamespace openspace {\nnamespace performance {\n\n\/\/ The Performance Manager will use a level of indirection in order to support multiple\n\/\/ PerformanceManagers running in parallel:\n\/\/ The ghoul::SharedData block addressed by OpenSpacePerformanceMeasurementSharedData\n\/\/ will only get allocated once and contains the total number of allocated shared memory\n\/\/ blocks alongside a list of names of these blocks\n\/\/\n\nvoid PerformanceManager::createGlobalSharedMemory() {\n static_assert(\n sizeof(GlobalMemory) == GlobalSharedMemorySize,\n \"The global memory struct does not fit the allocated global memory space\"\n );\n \n using ghoul::SharedMemory;\n \n if (SharedMemory::exists(GlobalSharedMemoryName)) {\n SharedMemory sharedMemory(GlobalSharedMemoryName);\n sharedMemory.acquireLock();\n GlobalMemory* m = reinterpret_cast<GlobalMemory*>(sharedMemory.memory());\n ++(m->referenceCount);\n LINFO(\n \"Using global shared memory block for performance measurements. \"\n \"Reference count: \" << int(m->referenceCount)\n );\n sharedMemory.releaseLock();\n }\n else {\n LINFO(\"Creating global shared memory block for performance measurements\");\n SharedMemory::create(GlobalSharedMemoryName, GlobalSharedMemorySize);\n \n \/\/ Initialize the data\n SharedMemory sharedMemory(GlobalSharedMemoryName);\n sharedMemory.acquireLock();\n new (sharedMemory.memory()) GlobalMemory;\n GlobalMemory* m = reinterpret_cast<GlobalMemory*>(sharedMemory.memory());\n m->number = 0;\n m->referenceCount = 1;\n sharedMemory.releaseLock();\n }\n}\n\nvoid PerformanceManager::destroyGlobalSharedMemory() {\n using ghoul::SharedMemory;\n if (!SharedMemory::exists(GlobalSharedMemoryName)) {\n LWARNING(\"Global shared memory for Performance measurements did not exist\");\n return;\n }\n \n SharedMemory sharedMemory(GlobalSharedMemoryName);\n sharedMemory.acquireLock();\n GlobalMemory* m = reinterpret_cast<GlobalMemory*>(sharedMemory.memory());\n --(m->referenceCount);\n LINFO(\"Global shared performance memory reference count: \" << int(m->referenceCount));\n if (m->referenceCount == 0) {\n LINFO(\"Removing global shared performance memory\");\n \n \/\/ When the global memory is deleted, we have to get rid of all local memory as\n \/\/ well. In principle, none should be left, but OpenSpace crashing might leave\n \/\/ some of the memory orphaned\n for (int i = 0; i < std::numeric_limits<uint8_t>::max(); ++i) {\n std::string localName = LocalSharedMemoryNameBase + std::to_string(i);\n if (SharedMemory::exists(localName)) {\n LINFO(\"Removing shared memory: \" << localName);\n SharedMemory::remove(localName);\n }\n }\n \n SharedMemory::remove(GlobalSharedMemoryName);\n }\n sharedMemory.releaseLock();\n}\n \nPerformanceManager::PerformanceManager()\n : _performanceMemory(nullptr)\n , _tick(0)\n , _loggingEnabled(false)\n , _logDir(absPath(\"${BASE_PATH}\"))\n , _prefix(\"PM-\")\n , _suffix(\"\")\n , _ext(\"log\")\n{\n using ghoul::SharedMemory;\n PerformanceManager::createGlobalSharedMemory();\n \n \n SharedMemory sharedMemory(GlobalSharedMemoryName);\n sharedMemory.acquireLock();\n OnExit([&](){sharedMemory.releaseLock();});\n \n GlobalMemory* m = reinterpret_cast<GlobalMemory*>(sharedMemory.memory());\n\n \/\/ The the first free block (which also coincides with the number of blocks\n uint8_t blockIndex = m->number;\n ++(m->number);\n\n std::string localName = LocalSharedMemoryNameBase + std::to_string(blockIndex);\n \n \/\/ Compute the total size\n const int totalSize = sizeof(PerformanceLayout);\n LINFO(\"Create shared memory '\" + localName + \"' of \" << totalSize << \" bytes\");\n\n if (SharedMemory::exists(localName)) {\n throw ghoul::RuntimeError(\n \"Shared Memory '\" + localName + \"' block already existed\"\n );\n }\n \n ghoul::SharedMemory::create(localName, totalSize);\n\n _performanceMemory = std::make_unique<ghoul::SharedMemory>(localName);\n \/\/ Using the placement-new to create a PerformanceLayout in the shared memory\n new (_performanceMemory->memory()) PerformanceLayout;\n}\n\nPerformanceManager::~PerformanceManager() {\n if (_performanceMemory) {\n ghoul::SharedMemory sharedMemory(GlobalSharedMemoryName);\n sharedMemory.acquireLock();\n GlobalMemory* m = reinterpret_cast<GlobalMemory*>(sharedMemory.memory());\n --(m->number);\n sharedMemory.releaseLock();\n \n LINFO(\"Remove shared memory '\" << _performanceMemory->name() << \"'\");\n ghoul::SharedMemory::remove(_performanceMemory->name());\n\n _performanceMemory = nullptr;\n\n }\n \n PerformanceManager::destroyGlobalSharedMemory();\n}\n\nvoid PerformanceManager::resetPerformanceMeasurements() {\n \/\/ Using the placement-new to create a PerformanceLayout in the shared memory\n _performanceMemory->acquireLock();\n void* ptr = _performanceMemory->memory();\n new (ptr) PerformanceLayout;\n _performanceMemory->releaseLock();\n \n individualPerformanceLocations.clear();\n}\n \nbool PerformanceManager::isMeasuringPerformance() const {\n return _doPerformanceMeasurements;\n}\n \nvoid PerformanceManager::outputLogs() {\n\n \/\/ Log Layout values\n PerformanceLayout* layout = performanceData();\n\n \/\/ Log function performance\n for (size_t n = 0; n < layout->nFunctionEntries; n++) {\n const auto function = layout->functionEntries[n];\n const std::string filename = formatLogName(function.name);\n std::ofstream out = std::ofstream(absPath(filename), std::ofstream::out | std::ofstream::app);\n\n \/\/ Comma separate data\n for (size_t i = 0; i < PerformanceLayout::NumberValues; i++) {\n const std::vector<float> data = { function.time[i] };\n writeData(out, data);\n }\n out.close();\n }\n\n \/\/ Log scene object performance\n for (size_t n = 0; n < layout->nScaleGraphEntries; n++) {\n const auto node = layout->sceneGraphEntries[n];\n\n \/\/ Open file\n const std::string filename = formatLogName(node.name);\n std::ofstream out = std::ofstream(absPath(filename), std::ofstream::out | std::ofstream::app);\n \n \/\/ Comma separate data\n for (size_t i = 0; i < PerformanceLayout::NumberValues; i++) {\n const std::vector<float> data = {\n node.renderTime[i],\n node.updateRenderable[i],\n node.updateRotation[i],\n node.updateScaling[i],\n node.updateTranslation[i]\n };\n writeData(out, data);\n }\n out.close();\n }\n}\n\nvoid PerformanceManager::writeData(std::ofstream& out, const std::vector<float> data) {\n for (size_t i = 0; i < data.size() - 1; i++) {\n out << data[i] << \",\";\n }\n out << data[data.size() - 1] << \"\\n\";\n}\n\nconst std::string PerformanceManager::formatLogName(std::string nodeName) {\n \/\/ Replace any colons with dashes\n std::replace(nodeName.begin(), nodeName.end(), ':', '-');\n return _logDir + \"\/\" + _prefix + nodeName + _suffix + \".\" + _ext;\n}\n\nvoid PerformanceManager::logDir(std::string dir) {\n _logDir = absPath(dir);\n}\n\nstd::string PerformanceManager::logDir() {\n return _logDir;\n}\n\nvoid PerformanceManager::prefix(std::string prefix) {\n _prefix = prefix;\n}\n\nstd::string PerformanceManager::prefix() {\n return _prefix;\n}\n\nvoid PerformanceManager::enableLogging() {\n setLogging(true);\n}\n\nvoid PerformanceManager::disableLogging() {\n setLogging(false);\n}\n\nvoid PerformanceManager::toggleLogging() {\n _loggingEnabled = !_loggingEnabled;\n}\nvoid PerformanceManager::setLogging(bool enabled) {\n _loggingEnabled = enabled;\n}\n\nbool PerformanceManager::loggingEnabled() {\n return _loggingEnabled;\n}\n\nPerformanceLayout* PerformanceManager::performanceData() {\n void* ptr = _performanceMemory->memory();\n return reinterpret_cast<PerformanceLayout*>(ptr);\n}\n\nvoid PerformanceManager::tick() {\n _tick = (_tick + 1) % PerformanceLayout::NumberValues;\n}\n\nvoid PerformanceManager::storeIndividualPerformanceMeasurement\n (std::string identifier, long long microseconds)\n{\n PerformanceLayout* layout = performanceData();\n _performanceMemory->acquireLock();\n\n auto it = individualPerformanceLocations.find(identifier);\n PerformanceLayout::FunctionPerformanceLayout* p = nullptr;\n if (it == individualPerformanceLocations.end()) {\n p = &(layout->functionEntries[layout->nFunctionEntries]);\n individualPerformanceLocations[identifier] = layout->nFunctionEntries;\n ++(layout->nFunctionEntries);\n }\n else {\n p = &(layout->functionEntries[it->second]);\n }\n#ifdef _MSC_VER\n strcpy_s(p->name, identifier.length() + 1, identifier.c_str());\n#else\n strcpy(p->name, identifier.c_str());\n#endif\n \n std::rotate(\n std::begin(p->time),\n std::next(std::begin(p->time)),\n std::end(p->time)\n );\n p->time[PerformanceLayout::NumberValues - 1] =\n static_cast<float>(microseconds);\n\n _performanceMemory->releaseLock();\n}\n\nvoid PerformanceManager::storeScenePerformanceMeasurements(\n const std::vector<SceneGraphNode*>& sceneNodes)\n{\n using namespace performance;\n\n PerformanceLayout* layout = performanceData();\n _performanceMemory->acquireLock();\n \n int nNodes = static_cast<int>(sceneNodes.size());\n layout->nScaleGraphEntries = static_cast<int16_t>(nNodes);\n for (int i = 0; i < nNodes; ++i) {\n SceneGraphNode* node = sceneNodes[i];\n\n memset(layout->sceneGraphEntries[i].name, 0, PerformanceLayout::LengthName);\n#ifdef _MSC_VER\n strcpy_s(\n layout->sceneGraphEntries[i].name,\n node->name().length() + 1,\n node->name().c_str()\n );\n#else\n strcpy(layout->sceneGraphEntries[i].name, node->name().c_str());\n#endif\n \n SceneGraphNode::PerformanceRecord r = node->performanceRecord();\n PerformanceLayout::SceneGraphPerformanceLayout& entry = layout->sceneGraphEntries[i];\n\n \/\/ Covert nano to microseconds\n const float micro = 1000.f;\n\n std::rotate(\n std::begin(entry.renderTime),\n std::next(std::begin(entry.renderTime)),\n std::end(entry.renderTime)\n );\n entry.renderTime[PerformanceLayout::NumberValues - 1] = r.renderTime \/ micro;\n \n std::rotate(\n std::begin(entry.updateTranslation),\n std::next(std::begin(entry.updateTranslation)),\n std::end(entry.updateTranslation)\n );\n entry.updateTranslation[PerformanceLayout::NumberValues - 1] = r.updateTimeTranslation \/ micro;\n\n std::rotate(\n std::begin(entry.updateRotation),\n std::next(std::begin(entry.updateRotation)),\n std::end(entry.updateRotation)\n );\n entry.updateRotation[PerformanceLayout::NumberValues - 1] = r.updateTimeRotation \/ micro;\n\n std::rotate(\n std::begin(entry.updateScaling),\n std::next(std::begin(entry.updateScaling)),\n std::end(entry.updateScaling)\n );\n entry.updateScaling[PerformanceLayout::NumberValues - 1] = r.updateTimeScaling \/ micro;\n\n std::rotate(\n std::begin(entry.updateRenderable),\n std::next(std::begin(entry.updateRenderable)),\n std::end(entry.updateRenderable)\n );\n entry.updateRenderable[PerformanceLayout::NumberValues - 1] = r.updateTimeRenderable \/ micro;\n }\n _performanceMemory->releaseLock();\n \n if (_loggingEnabled && _tick == PerformanceLayout::NumberValues - 1) outputLogs();\n\n tick();\n}\n\n} \/\/ namespace performance\n} \/\/ namespace openspace\n<|endoftext|>"} {"text":"<commit_before>#include <node.h>\n#include <nan.h>\n#include <v8.h>\n#include <vector>\n#include \"mouse.h\"\n#include \"deadbeef_rand.h\"\n#include \"keypress.h\"\n#include \"screen.h\"\n#include \"screengrab.h\"\n#include \"MMBitmap.h\"\n\nusing namespace v8;\n\n\/*\n __ __ \n| \\\/ | ___ _ _ ___ ___ \n| |\\\/| |\/ _ \\| | | \/ __|\/ _ \\\n| | | | (_) | |_| \\__ \\ __\/\n|_| |_|\\___\/ \\__,_|___\/\\___|\n\n*\/\n\nNAN_METHOD(moveMouse) \n{\n\tNanScope();\n\tif (args.Length() < 2) \n\t{\n\t\treturn NanThrowError(\"Invalid number of arguments.\"); \n\t}\n\tsize_t x = args[0]->Int32Value();\n\tsize_t y = args[1]->Int32Value();\n\n\tMMPoint point;\n\tpoint = MMPointMake(x, y);\n\tmoveMouse(point);\n\tNanReturnValue(NanNew(\"1\"));\n}\n\nNAN_METHOD(moveMouseSmooth) \n{\n\tNanScope();\n\tif (args.Length() < 2) \n\t{\n\t\treturn NanThrowError(\"Invalid number of arguments.\"); \n\t}\n\tsize_t x = args[0]->Int32Value();\n\tsize_t y = args[1]->Int32Value();\n\n\tMMPoint point;\n\tpoint = MMPointMake(x, y);\n\tsmoothlyMoveMouse(point);\n\tNanReturnValue(NanNew(\"1\"));\n}\n\nNAN_METHOD(getMousePos) \n{\n\tNanScope();\n\n\tMMPoint pos = getMousePos();\n\n \t\/\/Return object with .x and .y.\n\tLocal<Object> obj = NanNew<Object>();\n\tobj->Set(NanNew<String>(\"x\"), NanNew<Number>(pos.x));\n\tobj->Set(NanNew<String>(\"y\"), NanNew<Number>(pos.y));\n\tNanReturnValue(obj);\n}\n\nNAN_METHOD(mouseClick) \n{\n\tNanScope();\n\n\tMMMouseButton button = LEFT_BUTTON;\n\n\tif (args.Length() == 1)\n\t{\n\t\tchar *b = (*v8::String::Utf8Value(args[0]->ToString()));\n\n\t\tif (strcmp(b, \"left\") == 0)\n\t\t{\n\t\t\tbutton = LEFT_BUTTON;\n\t\t}\n\t\telse if (strcmp(b, \"right\") == 0)\n\t\t{\n\t\t\tbutton = RIGHT_BUTTON;\n\t\t}\n\t\telse if (strcmp(b, \"middle\") == 0)\n\t\t{\n\t\t\tbutton = CENTER_BUTTON;\n\t\t}\n\t\telse\n\t\t{\n\t\t\treturn NanThrowError(\"Invalid mouse button specified.\"); \n\t\t}\n\t}\n\telse if (args.Length() > 1)\n\t{\n\t\treturn NanThrowError(\"Invalid number of arguments.\");\n\t}\n\n\tclickMouse(button);\n\n\tNanReturnValue(NanNew(\"1\"));\n}\n\nNAN_METHOD(mouseToggle) \n{\n\tNanScope();\n\n\tMMMouseButton button = LEFT_BUTTON;\n\tbool down;\n\n\tif (args.Length() > 0)\n\t{\n\t\tconst char *d = (*v8::String::Utf8Value(args[0]->ToString()));\n\n\t\tif (strcmp(d, \"down\") == 0)\n\t\t{\n\t\t\tdown = true;;\n\t\t}\n\t\telse if (strcmp(d, \"up\") == 0)\n\t\t{\n\t\t\tdown = false;\n\t\t}\n\t\telse\n\t\t{\n\t\t\treturn NanThrowError(\"Invalid mouse button state specified.\"); \n\t\t}\n\t}\n\n\tif (args.Length() == 2)\n\t{\n\t\tchar *b = (*v8::String::Utf8Value(args[1]->ToString()));\n\n\t\tif (strcmp(b, \"left\") == 0)\n\t\t{\n\t\t\tbutton = LEFT_BUTTON;\n\t\t}\n\t\telse if (strcmp(b, \"right\") == 0)\n\t\t{\n\t\t\tbutton = RIGHT_BUTTON;\n\t\t}\n\t\telse if (strcmp(b, \"middle\") == 0)\n\t\t{\n\t\t\tbutton = CENTER_BUTTON;\n\t\t}\n\t\telse\n\t\t{\n\t\t\treturn NanThrowError(\"Invalid mouse button specified.\"); \n\t\t}\n\t}\n\telse if (args.Length() > 2)\n\t{\n\t\treturn NanThrowError(\"Invalid number of arguments.\");\n\t}\n\n\ttoggleMouse(down, button);\n\n\tNanReturnValue(NanNew(\"1\"));\n}\n\n\/*\n _ __ _ _ \n| |\/ \/___ _ _| |__ ___ __ _ _ __ __| |\n| ' \/\/ _ \\ | | | '_ \\ \/ _ \\ \/ _` | '__\/ _` |\n| . \\ __\/ |_| | |_) | (_) | (_| | | | (_| |\n|_|\\_\\___|\\__, |_.__\/ \\___\/ \\__,_|_| \\__,_|\n |___\/ \n*\/\n\nint CheckKeyCodes(char* k, MMKeyCode *key) \n{\n\tif (!key) return -1;\n\n\tif (strcmp(k, \"alt\") == 0)\n\t{\n\t\t*key = K_ALT;\n\t}\n \telse if (strcmp(k, \"command\") == 0)\n\t{\n\t\t*key = K_META;\n\t}\n \telse if (strcmp(k, \"control\") == 0)\n\t{\n\t\t*key = K_CONTROL;\n\t}\n \telse if (strcmp(k, \"shift\") == 0)\n\t{\n\t\t*key = K_SHIFT;\n\t}\n\telse if (strcmp(k, \"backspace\") == 0)\n\t{\n\t\t*key = K_BACKSPACE;\n\t}\n\telse if (strcmp(k, \"enter\") == 0)\n\t{\n\t\t*key = K_RETURN;\n\t}\n\telse if (strcmp(k, \"tab\") == 0)\n\t{\n\t\t*key = K_TAB;\n\t}\n\telse if (strcmp(k, \"up\") == 0)\n\t{\n\t\t*key = K_UP;\n\t}\n\telse if (strcmp(k, \"down\") == 0)\n\t{\n\t\t*key = K_DOWN;\n\t}\n\telse if (strcmp(k, \"left\") == 0)\n\t{\n\t\t*key = K_LEFT;\n\t}\n\telse if (strcmp(k, \"right\") == 0)\n\t{\n\t\t*key = K_RIGHT;\n\t}\n\telse if (strcmp(k, \"escape\") == 0)\n\t{\n\t\t*key = K_ESCAPE;\n\t}\n\telse if (strcmp(k, \"delete\") == 0)\n\t{\n\t\t*key = K_DELETE;\n\t}\n\telse if (strcmp(k, \"home\") == 0)\n\t{\n\t\t*key = K_HOME;\n\t}\n\telse if (strcmp(k, \"end\") == 0)\n\t{\n\t\t*key = K_END;\n\t}\n\telse if (strcmp(k, \"pageup\") == 0)\n\t{\n\t\t*key = K_PAGEUP;\n\t}\n\telse if (strcmp(k, \"pagedown\") == 0)\n\t{\n\t\t*key = K_PAGEDOWN;\n\t}\n\telse if (strlen(k) == 1)\n\t{\n\t\t*key = keyCodeForChar(*k); \n\t}\n\telse\n\t{\n\t\treturn -2;\n\t}\n\n\treturn 0;\n}\n\nint CheckKeyFlags(char* f, MMKeyFlags* flags) \n{\n\tif (!flags) return -1;\n\n\tif (strcmp(f, \"alt\") == 0) \n\t{\n \t*flags = MOD_ALT;\n \t}\n \telse if(strcmp(f, \"command\") == 0) \n\t{\n \t*flags = MOD_META;\n \t}\n \telse if(strcmp(f, \"control\") == 0) \n\t{\n \t*flags = MOD_CONTROL;\n \t}\n \telse if(strcmp(f, \"shift\") == 0) \n\t{\n \t*flags = MOD_SHIFT;\n\t}\n\telse if(strcmp(f, \"none\") == 0) \n\t{\n \t*flags = MOD_NONE;\n \t}\n \telse \n\t{\n \treturn -2;\n \t}\n\n\treturn 0;\n}\n\nint mssleep(unsigned long millisecond)\n{\n\tstruct timespec req;\n\ttime_t sec=(int)(millisecond\/1000);\n\tmillisecond=millisecond-(sec*1000);\n\treq.tv_sec=sec;\n\treq.tv_nsec=millisecond*1000000L;\n\twhile(nanosleep(&req,&req)==-1)\n\t\tcontinue;\n\treturn 1;\n}\n\nNAN_METHOD(keyTap) \n{\n\tNanScope();\n\t\n\tMMKeyFlags flags = MOD_NONE;\n\tMMKeyCode key;\n\n \tchar *k;\n \tchar *f;\n\n \tv8::String::Utf8Value fstr(args[1]->ToString());\n \tv8::String::Utf8Value kstr(args[0]->ToString());\n \tk = *kstr;\n \tf = *fstr;\n\n\tswitch (args.Length()) \n\t{\n \tcase 2:\n\t\t\tbreak;\n \tcase 1:\n\t\t\tf = NULL;\n\t\t\tbreak;\n \tdefault:\n \t\treturn NanThrowError(\"Invalid number of arguments.\");\n\t}\n\n \tif (f) \n\t{\n \tswitch(CheckKeyFlags(f, &flags)) \n \t{\n \t\tcase -1:\n \t\treturn NanThrowError(\"Null pointer in key flag.\");\n \t\tbreak;\n \t\tcase -2:\n \t\treturn NanThrowError(\"Invalid key flag specified.\"); \n \t\tbreak;\n \t}\n \t}\n\n\tswitch(CheckKeyCodes(k, &key)) \n\t{\n \tcase -1:\n \t\treturn NanThrowError(\"Null pointer in key code.\");\n \t\tbreak;\n \tcase -2:\n \t\treturn NanThrowError(\"Invalid key code specified.\"); \n \t\tbreak;\n \tdefault:\n \t\ttapKeyCode(key, flags);\n \t\tmssleep(10);\n\t}\n\n\tNanReturnValue(NanNew(\"1\"));\n}\n\n\nNAN_METHOD(keyToggle) \n{\n\tNanScope();\n\n MMKeyFlags flags = MOD_NONE;\n\tMMKeyCode key;\n \n\tchar *k;\n bool down;\n char *f;\n\n v8::String::Utf8Value kstr(args[0]->ToString());\n v8::String::Utf8Value fstr(args[2]->ToString());\n down = args[1]->BooleanValue();\n k = *kstr;\n f = *fstr;\n\n\tswitch (args.Length()) \n {\n case 3:\n break;\n case 2:\n f = NULL;\n break;\n default:\n return NanThrowError(\"Invalid number of arguments.\");\n\t}\n\n if (f) {\n switch(CheckKeyFlags(f, &flags)) \n {\n case -1:\n return NanThrowError(\"Null pointer in key flag.\");\n break;\n case -2:\n return NanThrowError(\"Invalid key flag specified.\"); \n break;\n }\n }\n\n switch(CheckKeyCodes(k, &key)) \n {\n case -1:\n return NanThrowError(\"Null pointer in key code.\");\n break;\n case -2:\n return NanThrowError(\"Invalid key code specified.\"); \n break;\n default:\n toggleKeyCode(key, down, flags);\n mssleep(10);\n }\n\n\tNanReturnValue(NanNew(\"1\"));\n}\n\nNAN_METHOD(typeString) \n{\n\tNanScope();\n\n\tchar *str;\n\tNanUtf8String string(args[0]);\n\n\tstr = *string;\n\n\ttypeString(str);\n\n\tNanReturnValue(NanNew(\"1\"));\n}\n\n\/*\n ____ \n \/ ___| ___ _ __ ___ ___ _ __ \n \\___ \\ \/ __| '__\/ _ \\\/ _ \\ '_ \\ \n ___) | (__| | | __\/ __\/ | | |\n |____\/ \\___|_| \\___|\\___|_| |_|\n \n*\/\n\nNAN_METHOD(getPixelColor) \n{\n\tNanScope();\n\n\tMMBitmapRef bitmap;\n\tMMRGBHex color;\n\n\tsize_t x = args[0]->Int32Value();\n\tsize_t y = args[1]->Int32Value();\n\n\tbitmap = copyMMBitmapFromDisplayInRect(MMRectMake(x, y, 1, 1));\n\n\tcolor = MMRGBHexAtPoint(bitmap, 0, 0);\n\t\n\tchar hex [6];\n\n\t\/\/Length needs to be 7 because snprintf includes a terminating null.\n\t\/\/Use %06x to pad hex value with leading 0s. \n\tsnprintf(hex, 7, \"%06x\", color);\n\n\tdestroyMMBitmap(bitmap);\n\n\tNanReturnValue(NanNew(hex));\n}\n\nNAN_METHOD(getScreenSize) \n{\n\tNanScope();\n\t\n\t\/\/Get display size.\n\tMMSize displaySize = getMainDisplaySize();\n\n\t\/\/Create our return object.\n\tLocal<Object> obj = NanNew<Object>();\n\tobj->Set(NanNew<String>(\"width\"), NanNew<Number>(displaySize.width));\n\tobj->Set(NanNew<String>(\"height\"), NanNew<Number>(displaySize.height));\n\n\t\/\/Return our object with .width and .height.\n\tNanReturnValue(obj);\n}\n\nvoid init(Handle<Object> target) \n{\n\n\ttarget->Set(NanNew<String>(\"moveMouse\"),\n\t\tNanNew<FunctionTemplate>(moveMouse)->GetFunction());\n\n\ttarget->Set(NanNew<String>(\"moveMouseSmooth\"),\n\t\tNanNew<FunctionTemplate>(moveMouseSmooth)->GetFunction());\n\n\ttarget->Set(NanNew<String>(\"getMousePos\"),\n\t\tNanNew<FunctionTemplate>(getMousePos)->GetFunction());\n\n\ttarget->Set(NanNew<String>(\"mouseClick\"),\n\t\tNanNew<FunctionTemplate>(mouseClick)->GetFunction());\n\n\ttarget->Set(NanNew<String>(\"mouseToggle\"),\n\t\tNanNew<FunctionTemplate>(mouseToggle)->GetFunction());\n\n\ttarget->Set(NanNew<String>(\"keyTap\"),\n\t\tNanNew<FunctionTemplate>(keyTap)->GetFunction());\n\t\n\ttarget->Set(NanNew<String>(\"keyToggle\"),\n\t\tNanNew<FunctionTemplate>(keyToggle)->GetFunction());\n\n\ttarget->Set(NanNew<String>(\"typeString\"),\n\t\tNanNew<FunctionTemplate>(typeString)->GetFunction());\n\n\ttarget->Set(NanNew<String>(\"getPixelColor\"),\n\t\tNanNew<FunctionTemplate>(getPixelColor)->GetFunction());\n\n\ttarget->Set(NanNew<String>(\"getScreenSize\"),\n\t\tNanNew<FunctionTemplate>(getScreenSize)->GetFunction());\n\n}\n\nNODE_MODULE(robotjs, init)\n<commit_msg>Fixed style of keyToggle.<commit_after>#include <node.h>\n#include <nan.h>\n#include <v8.h>\n#include <vector>\n#include \"mouse.h\"\n#include \"deadbeef_rand.h\"\n#include \"keypress.h\"\n#include \"screen.h\"\n#include \"screengrab.h\"\n#include \"MMBitmap.h\"\n\nusing namespace v8;\n\n\/*\n __ __ \n| \\\/ | ___ _ _ ___ ___ \n| |\\\/| |\/ _ \\| | | \/ __|\/ _ \\\n| | | | (_) | |_| \\__ \\ __\/\n|_| |_|\\___\/ \\__,_|___\/\\___|\n\n*\/\n\nNAN_METHOD(moveMouse) \n{\n\tNanScope();\n\tif (args.Length() < 2) \n\t{\n\t\treturn NanThrowError(\"Invalid number of arguments.\"); \n\t}\n\tsize_t x = args[0]->Int32Value();\n\tsize_t y = args[1]->Int32Value();\n\n\tMMPoint point;\n\tpoint = MMPointMake(x, y);\n\tmoveMouse(point);\n\tNanReturnValue(NanNew(\"1\"));\n}\n\nNAN_METHOD(moveMouseSmooth) \n{\n\tNanScope();\n\tif (args.Length() < 2) \n\t{\n\t\treturn NanThrowError(\"Invalid number of arguments.\"); \n\t}\n\tsize_t x = args[0]->Int32Value();\n\tsize_t y = args[1]->Int32Value();\n\n\tMMPoint point;\n\tpoint = MMPointMake(x, y);\n\tsmoothlyMoveMouse(point);\n\tNanReturnValue(NanNew(\"1\"));\n}\n\nNAN_METHOD(getMousePos) \n{\n\tNanScope();\n\n\tMMPoint pos = getMousePos();\n\n \t\/\/Return object with .x and .y.\n\tLocal<Object> obj = NanNew<Object>();\n\tobj->Set(NanNew<String>(\"x\"), NanNew<Number>(pos.x));\n\tobj->Set(NanNew<String>(\"y\"), NanNew<Number>(pos.y));\n\tNanReturnValue(obj);\n}\n\nNAN_METHOD(mouseClick) \n{\n\tNanScope();\n\n\tMMMouseButton button = LEFT_BUTTON;\n\n\tif (args.Length() == 1)\n\t{\n\t\tchar *b = (*v8::String::Utf8Value(args[0]->ToString()));\n\n\t\tif (strcmp(b, \"left\") == 0)\n\t\t{\n\t\t\tbutton = LEFT_BUTTON;\n\t\t}\n\t\telse if (strcmp(b, \"right\") == 0)\n\t\t{\n\t\t\tbutton = RIGHT_BUTTON;\n\t\t}\n\t\telse if (strcmp(b, \"middle\") == 0)\n\t\t{\n\t\t\tbutton = CENTER_BUTTON;\n\t\t}\n\t\telse\n\t\t{\n\t\t\treturn NanThrowError(\"Invalid mouse button specified.\"); \n\t\t}\n\t}\n\telse if (args.Length() > 1)\n\t{\n\t\treturn NanThrowError(\"Invalid number of arguments.\");\n\t}\n\n\tclickMouse(button);\n\n\tNanReturnValue(NanNew(\"1\"));\n}\n\nNAN_METHOD(mouseToggle) \n{\n\tNanScope();\n\n\tMMMouseButton button = LEFT_BUTTON;\n\tbool down;\n\n\tif (args.Length() > 0)\n\t{\n\t\tconst char *d = (*v8::String::Utf8Value(args[0]->ToString()));\n\n\t\tif (strcmp(d, \"down\") == 0)\n\t\t{\n\t\t\tdown = true;;\n\t\t}\n\t\telse if (strcmp(d, \"up\") == 0)\n\t\t{\n\t\t\tdown = false;\n\t\t}\n\t\telse\n\t\t{\n\t\t\treturn NanThrowError(\"Invalid mouse button state specified.\"); \n\t\t}\n\t}\n\n\tif (args.Length() == 2)\n\t{\n\t\tchar *b = (*v8::String::Utf8Value(args[1]->ToString()));\n\n\t\tif (strcmp(b, \"left\") == 0)\n\t\t{\n\t\t\tbutton = LEFT_BUTTON;\n\t\t}\n\t\telse if (strcmp(b, \"right\") == 0)\n\t\t{\n\t\t\tbutton = RIGHT_BUTTON;\n\t\t}\n\t\telse if (strcmp(b, \"middle\") == 0)\n\t\t{\n\t\t\tbutton = CENTER_BUTTON;\n\t\t}\n\t\telse\n\t\t{\n\t\t\treturn NanThrowError(\"Invalid mouse button specified.\"); \n\t\t}\n\t}\n\telse if (args.Length() > 2)\n\t{\n\t\treturn NanThrowError(\"Invalid number of arguments.\");\n\t}\n\n\ttoggleMouse(down, button);\n\n\tNanReturnValue(NanNew(\"1\"));\n}\n\n\/*\n _ __ _ _ \n| |\/ \/___ _ _| |__ ___ __ _ _ __ __| |\n| ' \/\/ _ \\ | | | '_ \\ \/ _ \\ \/ _` | '__\/ _` |\n| . \\ __\/ |_| | |_) | (_) | (_| | | | (_| |\n|_|\\_\\___|\\__, |_.__\/ \\___\/ \\__,_|_| \\__,_|\n |___\/ \n*\/\n\nint CheckKeyCodes(char* k, MMKeyCode *key) \n{\n\tif (!key) return -1;\n\n\tif (strcmp(k, \"alt\") == 0)\n\t{\n\t\t*key = K_ALT;\n\t}\n \telse if (strcmp(k, \"command\") == 0)\n\t{\n\t\t*key = K_META;\n\t}\n \telse if (strcmp(k, \"control\") == 0)\n\t{\n\t\t*key = K_CONTROL;\n\t}\n \telse if (strcmp(k, \"shift\") == 0)\n\t{\n\t\t*key = K_SHIFT;\n\t}\n\telse if (strcmp(k, \"backspace\") == 0)\n\t{\n\t\t*key = K_BACKSPACE;\n\t}\n\telse if (strcmp(k, \"enter\") == 0)\n\t{\n\t\t*key = K_RETURN;\n\t}\n\telse if (strcmp(k, \"tab\") == 0)\n\t{\n\t\t*key = K_TAB;\n\t}\n\telse if (strcmp(k, \"up\") == 0)\n\t{\n\t\t*key = K_UP;\n\t}\n\telse if (strcmp(k, \"down\") == 0)\n\t{\n\t\t*key = K_DOWN;\n\t}\n\telse if (strcmp(k, \"left\") == 0)\n\t{\n\t\t*key = K_LEFT;\n\t}\n\telse if (strcmp(k, \"right\") == 0)\n\t{\n\t\t*key = K_RIGHT;\n\t}\n\telse if (strcmp(k, \"escape\") == 0)\n\t{\n\t\t*key = K_ESCAPE;\n\t}\n\telse if (strcmp(k, \"delete\") == 0)\n\t{\n\t\t*key = K_DELETE;\n\t}\n\telse if (strcmp(k, \"home\") == 0)\n\t{\n\t\t*key = K_HOME;\n\t}\n\telse if (strcmp(k, \"end\") == 0)\n\t{\n\t\t*key = K_END;\n\t}\n\telse if (strcmp(k, \"pageup\") == 0)\n\t{\n\t\t*key = K_PAGEUP;\n\t}\n\telse if (strcmp(k, \"pagedown\") == 0)\n\t{\n\t\t*key = K_PAGEDOWN;\n\t}\n\telse if (strlen(k) == 1)\n\t{\n\t\t*key = keyCodeForChar(*k); \n\t}\n\telse\n\t{\n\t\treturn -2;\n\t}\n\n\treturn 0;\n}\n\nint CheckKeyFlags(char* f, MMKeyFlags* flags) \n{\n\tif (!flags) return -1;\n\n\tif (strcmp(f, \"alt\") == 0) \n\t{\n \t*flags = MOD_ALT;\n \t}\n \telse if(strcmp(f, \"command\") == 0) \n\t{\n \t*flags = MOD_META;\n \t}\n \telse if(strcmp(f, \"control\") == 0) \n\t{\n \t*flags = MOD_CONTROL;\n \t}\n \telse if(strcmp(f, \"shift\") == 0) \n\t{\n \t*flags = MOD_SHIFT;\n\t}\n\telse if(strcmp(f, \"none\") == 0) \n\t{\n \t*flags = MOD_NONE;\n \t}\n \telse \n\t{\n \treturn -2;\n \t}\n\n\treturn 0;\n}\n\nint mssleep(unsigned long millisecond)\n{\n\tstruct timespec req;\n\ttime_t sec=(int)(millisecond\/1000);\n\tmillisecond=millisecond-(sec*1000);\n\treq.tv_sec=sec;\n\treq.tv_nsec=millisecond*1000000L;\n\twhile(nanosleep(&req,&req)==-1)\n\t\tcontinue;\n\treturn 1;\n}\n\nNAN_METHOD(keyTap) \n{\n\tNanScope();\n\t\n\tMMKeyFlags flags = MOD_NONE;\n\tMMKeyCode key;\n\n \tchar *k;\n \tchar *f;\n\n \tv8::String::Utf8Value fstr(args[1]->ToString());\n \tv8::String::Utf8Value kstr(args[0]->ToString());\n \tk = *kstr;\n \tf = *fstr;\n\n\tswitch (args.Length()) \n\t{\n \tcase 2:\n\t\t\tbreak;\n \tcase 1:\n\t\t\tf = NULL;\n\t\t\tbreak;\n \tdefault:\n \t\treturn NanThrowError(\"Invalid number of arguments.\");\n\t}\n\n \tif (f) \n\t{\n \tswitch(CheckKeyFlags(f, &flags)) \n \t{\n \t\tcase -1:\n \t\treturn NanThrowError(\"Null pointer in key flag.\");\n \t\tbreak;\n \t\tcase -2:\n \t\treturn NanThrowError(\"Invalid key flag specified.\"); \n \t\tbreak;\n \t}\n \t}\n\n\tswitch(CheckKeyCodes(k, &key)) \n\t{\n \tcase -1:\n \t\treturn NanThrowError(\"Null pointer in key code.\");\n \t\tbreak;\n \tcase -2:\n \t\treturn NanThrowError(\"Invalid key code specified.\"); \n \t\tbreak;\n \tdefault:\n \t\ttapKeyCode(key, flags);\n \t\tmssleep(10);\n\t}\n\n\tNanReturnValue(NanNew(\"1\"));\n}\n\n\nNAN_METHOD(keyToggle) \n{\n\tNanScope();\n\n\tMMKeyFlags flags = MOD_NONE;\n\tMMKeyCode key;\n \n\tchar *k;\n\tbool down;\n\tchar *f;\n\n\tv8::String::Utf8Value kstr(args[0]->ToString());\n\tv8::String::Utf8Value fstr(args[2]->ToString());\n\tdown = args[1]->BooleanValue();\n\tk = *kstr;\n\tf = *fstr;\n\n\tswitch (args.Length()) \n\t{\n \tcase 3:\n \t\tbreak;\n \tcase 2:\n \t\tf = NULL;\n \t\tbreak;\n \tdefault:\n \t\treturn NanThrowError(\"Invalid number of arguments.\");\n\t}\n\n\tif (f) \n\t{\n\t\tswitch(CheckKeyFlags(f, &flags)) \n\t\t{\n\t\t\tcase -1:\n \t\treturn NanThrowError(\"Null pointer in key flag.\");\n \t\tbreak;\n\t\t\tcase -2:\n \t\treturn NanThrowError(\"Invalid key flag specified.\"); \n \t\tbreak;\n\t\t}\n\t}\n\n\tswitch(CheckKeyCodes(k, &key)) \n\t{\n\t\tcase -1:\n \t\treturn NanThrowError(\"Null pointer in key code.\");\n\t\t\tbreak;\n\t\tcase -2:\n\t\t\treturn NanThrowError(\"Invalid key code specified.\"); \n\t\t\tbreak;\n\t\tdefault:\n\t\t\ttoggleKeyCode(key, down, flags);\n \t\tmssleep(10);\n\t}\n\n\tNanReturnValue(NanNew(\"1\"));\n}\n\nNAN_METHOD(typeString) \n{\n\tNanScope();\n\n\tchar *str;\n\tNanUtf8String string(args[0]);\n\n\tstr = *string;\n\n\ttypeString(str);\n\n\tNanReturnValue(NanNew(\"1\"));\n}\n\n\/*\n ____ \n \/ ___| ___ _ __ ___ ___ _ __ \n \\___ \\ \/ __| '__\/ _ \\\/ _ \\ '_ \\ \n ___) | (__| | | __\/ __\/ | | |\n |____\/ \\___|_| \\___|\\___|_| |_|\n \n*\/\n\nNAN_METHOD(getPixelColor) \n{\n\tNanScope();\n\n\tMMBitmapRef bitmap;\n\tMMRGBHex color;\n\n\tsize_t x = args[0]->Int32Value();\n\tsize_t y = args[1]->Int32Value();\n\n\tbitmap = copyMMBitmapFromDisplayInRect(MMRectMake(x, y, 1, 1));\n\n\tcolor = MMRGBHexAtPoint(bitmap, 0, 0);\n\t\n\tchar hex [6];\n\n\t\/\/Length needs to be 7 because snprintf includes a terminating null.\n\t\/\/Use %06x to pad hex value with leading 0s. \n\tsnprintf(hex, 7, \"%06x\", color);\n\n\tdestroyMMBitmap(bitmap);\n\n\tNanReturnValue(NanNew(hex));\n}\n\nNAN_METHOD(getScreenSize) \n{\n\tNanScope();\n\t\n\t\/\/Get display size.\n\tMMSize displaySize = getMainDisplaySize();\n\n\t\/\/Create our return object.\n\tLocal<Object> obj = NanNew<Object>();\n\tobj->Set(NanNew<String>(\"width\"), NanNew<Number>(displaySize.width));\n\tobj->Set(NanNew<String>(\"height\"), NanNew<Number>(displaySize.height));\n\n\t\/\/Return our object with .width and .height.\n\tNanReturnValue(obj);\n}\n\nvoid init(Handle<Object> target) \n{\n\n\ttarget->Set(NanNew<String>(\"moveMouse\"),\n\t\tNanNew<FunctionTemplate>(moveMouse)->GetFunction());\n\n\ttarget->Set(NanNew<String>(\"moveMouseSmooth\"),\n\t\tNanNew<FunctionTemplate>(moveMouseSmooth)->GetFunction());\n\n\ttarget->Set(NanNew<String>(\"getMousePos\"),\n\t\tNanNew<FunctionTemplate>(getMousePos)->GetFunction());\n\n\ttarget->Set(NanNew<String>(\"mouseClick\"),\n\t\tNanNew<FunctionTemplate>(mouseClick)->GetFunction());\n\n\ttarget->Set(NanNew<String>(\"mouseToggle\"),\n\t\tNanNew<FunctionTemplate>(mouseToggle)->GetFunction());\n\n\ttarget->Set(NanNew<String>(\"keyTap\"),\n\t\tNanNew<FunctionTemplate>(keyTap)->GetFunction());\n\t\n\ttarget->Set(NanNew<String>(\"keyToggle\"),\n\t\tNanNew<FunctionTemplate>(keyToggle)->GetFunction());\n\n\ttarget->Set(NanNew<String>(\"typeString\"),\n\t\tNanNew<FunctionTemplate>(typeString)->GetFunction());\n\n\ttarget->Set(NanNew<String>(\"getPixelColor\"),\n\t\tNanNew<FunctionTemplate>(getPixelColor)->GetFunction());\n\n\ttarget->Set(NanNew<String>(\"getScreenSize\"),\n\t\tNanNew<FunctionTemplate>(getScreenSize)->GetFunction());\n\n}\n\nNODE_MODULE(robotjs, init)\n<|endoftext|>"} {"text":"<commit_before>\/*\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\/\/ SKIRT -- an advanced radiative transfer code \/\/\/\/\n\/\/\/\/ © Astronomical Observatory, Ghent University \/\/\/\/\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/ *\/\n\n#include \"Log.hpp\"\n#include \"NR.hpp\"\n#include \"PanDustSystem.hpp\"\n#include \"PanMonteCarloSimulation.hpp\"\n#include \"PanWavelengthGrid.hpp\"\n#include \"Parallel.hpp\"\n#include \"ParallelFactory.hpp\"\n#include \"PeerToPeerCommunicator.hpp\"\n#include \"PhotonPackage.hpp\"\n#include \"Random.hpp\"\n#include \"SED.hpp\"\n#include \"StellarSystem.hpp\"\n#include \"TimeLogger.hpp\"\n#include \"Units.hpp\"\n\nusing namespace std;\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nPanMonteCarloSimulation::PanMonteCarloSimulation()\n : _pds(0)\n{\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nvoid PanMonteCarloSimulation::setupSelfAfter()\n{\n MonteCarloSimulation::setupSelfAfter();\n\n \/\/ properly size the array used to communicate between rundustXXX() and the corresponding parallel loop\n _Ncells = _pds ? _pds->Ncells() : 0;\n if (_pds && _pds->dustemission()) _Labsbolv.resize(_Ncells);\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nvoid PanMonteCarloSimulation::setWavelengthGrid(PanWavelengthGrid* value)\n{\n if (_lambdagrid) delete _lambdagrid;\n _lambdagrid = value;\n if (_lambdagrid) _lambdagrid->setParent(this);\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nPanWavelengthGrid* PanMonteCarloSimulation::wavelengthGrid() const\n{\n return dynamic_cast<PanWavelengthGrid*>(_lambdagrid);\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nvoid PanMonteCarloSimulation::setStellarSystem(StellarSystem* value)\n{\n if (_ss) delete _ss;\n _ss = value;\n if (_ss) _ss->setParent(this);\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nStellarSystem* PanMonteCarloSimulation::stellarSystem() const\n{\n return _ss;\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nvoid PanMonteCarloSimulation::setDustSystem(PanDustSystem* value)\n{\n if (_ds) delete _ds;\n _ds = value;\n _pds = value;\n if (_ds) _ds->setParent(this);\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nPanDustSystem* PanMonteCarloSimulation::dustSystem() const\n{\n return _pds;\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nvoid PanMonteCarloSimulation::runSelf()\n{\n runstellaremission();\n if (_pds && _pds->dustemission())\n {\n if (_pds && _pds->selfAbsorption()) rundustselfabsorption();\n rundustemission();\n }\n\n write();\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nvoid PanMonteCarloSimulation::rundustselfabsorption()\n{\n TimeLogger logger(_log, \"the dust self-absorption phase\");\n\n \/\/ Initialize the total absorbed luminosity in the previous cycle\n double prevLabsdusttot = 0.;\n\n \/\/ Perform three \"stages\" of max 100 cycles each; the first stage uses 10 times less photon packages\n const int Nstages = 3;\n const char* stage_name[] = {\"first-stage\", \"second-stage\", \"last-stage\"};\n const double stage_factor[] = {1.\/10., 1.\/3., 1.};\n const double stage_epsmax[] = {0.010, 0.007, 0.005};\n for (int stage=0; stage<Nstages; stage++)\n {\n bool fixedNcycles = _pds->cycles();\n const int Ncyclesmax = fixedNcycles ? _pds->cycles() : 100;\n bool convergence = false;\n int cycle = 1;\n while (cycle<=Ncyclesmax && (!convergence || fixedNcycles))\n {\n TimeLogger logger(_log, \"the \" + QString(stage_name[stage]) + \" dust self-absorption cycle \"\n + QString::number(cycle));\n\n \/\/ Construct the dust emission spectra\n _log->info(\"Calculating dust emission spectra...\");\n _pds->calculatedustemission(!(stage+cycle-1));\n _log->info(\"Dust emission spectra calculated.\");\n\n \/\/ Determine the bolometric luminosity that is absorbed in every cell (and that will hence be re-emitted).\n for (int m=0; m<_Ncells; m++)\n _Labsbolv[m] = _pds->Labs(m);\n\n \/\/ Set the absorbed dust luminosity to zero in all cells\n _pds->rebootLabsdust();\n\n \/\/ Perform dust self-absorption, using the appropriate number of packages for the current stage\n setChunkParams(packages()*stage_factor[stage]);\n initprogress(QString(stage_name[stage]) + \" dust self-absorption cycle \" + QString::number(cycle));\n Parallel* parallel = find<ParallelFactory>()->parallel();\n parallel->call(this, &PanMonteCarloSimulation::dodustselfabsorptionchunk, assigner());\n\n \/\/ Wait for the other processes to reach this point\n _comm->wait(\"this self-absorption cycle\");\n\n \/\/ Determine and log the total absorbed luminosity in the vector Labstotv.\n double Labsdusttot = _pds->Labsdusttot();\n _log->info(\"The total absorbed stellar luminosity is \"\n + QString::number(_units->obolluminosity(_pds->Labsstellartot())) + \" \"\n + _units->ubolluminosity() );\n _log->info(\"The total absorbed dust luminosity is \"\n + QString::number(_units->obolluminosity(Labsdusttot)) + \" \"\n + _units->ubolluminosity() );\n\n \/\/ Check the criteria to terminate the self-absorption cycle:\n \/\/ - the total absorbed dust luminosity should change by less than epsmax compared to the previous cycle;\n \/\/ - the last stage must perform at least 2 cycles (to make sure that the energy is properly distributed)\n double eps = fabs((Labsdusttot-prevLabsdusttot)\/Labsdusttot);\n prevLabsdusttot = Labsdusttot;\n if ( (stage<Nstages-1 || cycle>1) && eps<stage_epsmax[stage])\n {\n _log->info(\"Convergence reached; the last increase in the absorbed dust luminosity was \"\n + QString::number(eps*100, 'f', 2) + \"%\");\n convergence = true;\n }\n else\n {\n _log->info(\"Convergence not yet reached; the increase in the absorbed dust luminosity was \"\n + QString::number(eps*100, 'f', 2) + \"%\");\n }\n cycle++;\n }\n if (!convergence)\n {\n _log->error(\"Convergence not yet reached after \" + QString::number(Ncyclesmax) + \" \"\n + QString(stage_name[stage]) + \" cycles!\");\n }\n }\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nvoid PanMonteCarloSimulation::dodustselfabsorptionchunk(size_t index)\n{\n \/\/ Determine the wavelength index for this chunk\n int ell = index % _Nlambda;\n\n \/\/ Determine the luminosity to be emitted at this wavelength index\n Array Lv(_Ncells);\n for (int m=0; m<_Ncells; m++)\n {\n double Labsbol = _Labsbolv[m];\n if (Labsbol>0.0) Lv[m] = Labsbol * _pds->dustluminosity(m,ell);\n }\n double Ltot = Lv.sum();\n\n \/\/ Emit photon packages\n if (Ltot > 0)\n {\n Array Xv;\n NR::cdf(Xv, Lv);\n\n PhotonPackage pp;\n double L = Ltot \/ _Npp;\n double Lthreshold = L \/ minWeightReduction();\n\n quint64 remaining = _chunksize;\n while (remaining > 0)\n {\n quint64 count = qMin(remaining, _logchunksize);\n for (quint64 i=0; i<count; i++)\n {\n double X = _random->uniform();\n int m = NR::locate_clip(Xv,X);\n Position bfr = _pds->randomPositionInCell(m);\n Direction bfk = _random->direction();\n pp.launch(L,ell,bfr,bfk);\n while (true)\n {\n _pds->fillOpticalDepth(&pp);\n simulateescapeandabsorption(&pp,true);\n double L = pp.luminosity();\n if (L==0.0) break;\n if (L<=Lthreshold && pp.nScatt()>=minScattEvents()) break;\n simulatepropagation(&pp);\n simulatescattering(&pp);\n }\n }\n logprogress(count);\n remaining -= count;\n }\n }\n else logprogress(_chunksize);\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nvoid PanMonteCarloSimulation::rundustemission()\n{\n TimeLogger logger(_log, \"the dust emission phase\");\n\n bool noDustSelfabsorption = !(_pds && _pds->selfAbsorption());\n\n \/\/ Construct the dust emission spectra\n _log->info(\"Calculating dust emission spectra...\");\n _pds->calculatedustemission(noDustSelfabsorption);\n _log->info(\"Dust emission spectra calculated.\");\n\n \/\/ Determine the bolometric luminosity that is absorbed in every cell (and that will hence be re-emitted).\n for (int m=0; m<_Ncells; m++)\n _Labsbolv[m] = _pds->Labs(m);\n\n \/\/ Perform the actual dust emission, possibly using more photon packages to obtain decent resolution\n setChunkParams(packages()*_pds->emissionBoost());\n initprogress(\"dust emission\");\n Parallel* parallel = find<ParallelFactory>()->parallel();\n parallel->call(this, &PanMonteCarloSimulation::dodustemissionchunk, assigner());\n\n \/\/ Wait for the other processes to reach this point\n _comm->wait(\"the dust emission phase\");\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nvoid PanMonteCarloSimulation::dodustemissionchunk(size_t index)\n{\n \/\/ Determine the wavelength index for this chunk\n int ell = index % _Nlambda;\n\n \/\/ Determine the luminosity to be emitted at this wavelength index\n Array Lv(_Ncells);\n for (int m=0; m<_Ncells; m++)\n {\n double Labsbol = _Labsbolv[m];\n if (Labsbol>0.0) Lv[m] = Labsbol * _pds->dustluminosity(m,ell);\n }\n double Ltot = Lv.sum(); \/\/ the total luminosity to be emitted at this wavelength index\n\n \/\/ Emit photon packages\n if (Ltot > 0)\n {\n \/\/ We consider biasing in the selection of the cell from which the photon packages are emitted.\n \/\/ A fraction of the cells is selected from the \"natural\" distribution, in which each cell is\n \/\/ weighted according to its total luminosity (Lv[em]). The other cells are selected from\n \/\/ a uniform distribution in which each cell has a equal probability.\n double xi = _pds->emissionBias(); \/\/ the fraction to be selected from a uniform distribution\n\n \/\/ the cumulative distribution of the natural pdf (Lv does not need to be normalized before)\n Array cumLv;\n NR::cdf(cumLv, Lv);\n\n PhotonPackage pp,ppp;\n double Lmean = Ltot\/_Ncells;\n double Lem = Ltot \/ _Npp;\n double Lthreshold = Lem \/ minWeightReduction();\n\n quint64 remaining = _chunksize;\n while (remaining > 0)\n {\n quint64 count = qMin(remaining, _logchunksize);\n for (quint64 i=0; i<count; i++)\n {\n int m;\n double X = _random->uniform();\n if (X<xi)\n {\n \/\/ rescale the deviate from [0,xi[ to [0,Ncells[\n m = max(0,min(_Ncells-1,static_cast<int>(_Ncells\/xi)));\n }\n else\n {\n \/\/ rescale the deviate from [xi,1[ to [0,1[\n m = NR::locate_clip(cumLv,(X-xi)\/(1-xi));\n }\n double weight = 1.0\/(1-xi+xi*Lmean\/Lv[m]);\n Position bfr = _pds->randomPositionInCell(m);\n Direction bfk = _random->direction();\n pp.launch(Lem*weight,ell,bfr,bfk);\n peeloffemission(&pp,&ppp);\n while (true)\n {\n _pds->fillOpticalDepth(&pp);\n if (continuousScattering()) continuouspeeloffscattering(&pp,&ppp);\n simulateescapeandabsorption(&pp,false);\n double L = pp.luminosity();\n if (L==0.0) break;\n if (L<=Lthreshold && pp.nScatt()>=minScattEvents()) break;\n simulatepropagation(&pp);\n if (!continuousScattering()) peeloffscattering(&pp,&ppp);\n simulatescattering(&pp);\n }\n }\n logprogress(count);\n remaining -= count;\n }\n }\n else logprogress(_chunksize);\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n<commit_msg>fix emission bias bug introduced while refactoring<commit_after>\/*\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\/\/ SKIRT -- an advanced radiative transfer code \/\/\/\/\n\/\/\/\/ © Astronomical Observatory, Ghent University \/\/\/\/\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/ *\/\n\n#include \"Log.hpp\"\n#include \"NR.hpp\"\n#include \"PanDustSystem.hpp\"\n#include \"PanMonteCarloSimulation.hpp\"\n#include \"PanWavelengthGrid.hpp\"\n#include \"Parallel.hpp\"\n#include \"ParallelFactory.hpp\"\n#include \"PeerToPeerCommunicator.hpp\"\n#include \"PhotonPackage.hpp\"\n#include \"Random.hpp\"\n#include \"SED.hpp\"\n#include \"StellarSystem.hpp\"\n#include \"TimeLogger.hpp\"\n#include \"Units.hpp\"\n\nusing namespace std;\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nPanMonteCarloSimulation::PanMonteCarloSimulation()\n : _pds(0)\n{\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nvoid PanMonteCarloSimulation::setupSelfAfter()\n{\n MonteCarloSimulation::setupSelfAfter();\n\n \/\/ properly size the array used to communicate between rundustXXX() and the corresponding parallel loop\n _Ncells = _pds ? _pds->Ncells() : 0;\n if (_pds && _pds->dustemission()) _Labsbolv.resize(_Ncells);\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nvoid PanMonteCarloSimulation::setWavelengthGrid(PanWavelengthGrid* value)\n{\n if (_lambdagrid) delete _lambdagrid;\n _lambdagrid = value;\n if (_lambdagrid) _lambdagrid->setParent(this);\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nPanWavelengthGrid* PanMonteCarloSimulation::wavelengthGrid() const\n{\n return dynamic_cast<PanWavelengthGrid*>(_lambdagrid);\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nvoid PanMonteCarloSimulation::setStellarSystem(StellarSystem* value)\n{\n if (_ss) delete _ss;\n _ss = value;\n if (_ss) _ss->setParent(this);\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nStellarSystem* PanMonteCarloSimulation::stellarSystem() const\n{\n return _ss;\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nvoid PanMonteCarloSimulation::setDustSystem(PanDustSystem* value)\n{\n if (_ds) delete _ds;\n _ds = value;\n _pds = value;\n if (_ds) _ds->setParent(this);\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nPanDustSystem* PanMonteCarloSimulation::dustSystem() const\n{\n return _pds;\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nvoid PanMonteCarloSimulation::runSelf()\n{\n runstellaremission();\n if (_pds && _pds->dustemission())\n {\n if (_pds && _pds->selfAbsorption()) rundustselfabsorption();\n rundustemission();\n }\n\n write();\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nvoid PanMonteCarloSimulation::rundustselfabsorption()\n{\n TimeLogger logger(_log, \"the dust self-absorption phase\");\n\n \/\/ Initialize the total absorbed luminosity in the previous cycle\n double prevLabsdusttot = 0.;\n\n \/\/ Perform three \"stages\" of max 100 cycles each; the first stage uses 10 times less photon packages\n const int Nstages = 3;\n const char* stage_name[] = {\"first-stage\", \"second-stage\", \"last-stage\"};\n const double stage_factor[] = {1.\/10., 1.\/3., 1.};\n const double stage_epsmax[] = {0.010, 0.007, 0.005};\n for (int stage=0; stage<Nstages; stage++)\n {\n bool fixedNcycles = _pds->cycles();\n const int Ncyclesmax = fixedNcycles ? _pds->cycles() : 100;\n bool convergence = false;\n int cycle = 1;\n while (cycle<=Ncyclesmax && (!convergence || fixedNcycles))\n {\n TimeLogger logger(_log, \"the \" + QString(stage_name[stage]) + \" dust self-absorption cycle \"\n + QString::number(cycle));\n\n \/\/ Construct the dust emission spectra\n _log->info(\"Calculating dust emission spectra...\");\n _pds->calculatedustemission(!(stage+cycle-1));\n _log->info(\"Dust emission spectra calculated.\");\n\n \/\/ Determine the bolometric luminosity that is absorbed in every cell (and that will hence be re-emitted).\n for (int m=0; m<_Ncells; m++)\n _Labsbolv[m] = _pds->Labs(m);\n\n \/\/ Set the absorbed dust luminosity to zero in all cells\n _pds->rebootLabsdust();\n\n \/\/ Perform dust self-absorption, using the appropriate number of packages for the current stage\n setChunkParams(packages()*stage_factor[stage]);\n initprogress(QString(stage_name[stage]) + \" dust self-absorption cycle \" + QString::number(cycle));\n Parallel* parallel = find<ParallelFactory>()->parallel();\n parallel->call(this, &PanMonteCarloSimulation::dodustselfabsorptionchunk, assigner());\n\n \/\/ Wait for the other processes to reach this point\n _comm->wait(\"this self-absorption cycle\");\n\n \/\/ Determine and log the total absorbed luminosity in the vector Labstotv.\n double Labsdusttot = _pds->Labsdusttot();\n _log->info(\"The total absorbed stellar luminosity is \"\n + QString::number(_units->obolluminosity(_pds->Labsstellartot())) + \" \"\n + _units->ubolluminosity() );\n _log->info(\"The total absorbed dust luminosity is \"\n + QString::number(_units->obolluminosity(Labsdusttot)) + \" \"\n + _units->ubolluminosity() );\n\n \/\/ Check the criteria to terminate the self-absorption cycle:\n \/\/ - the total absorbed dust luminosity should change by less than epsmax compared to the previous cycle;\n \/\/ - the last stage must perform at least 2 cycles (to make sure that the energy is properly distributed)\n double eps = fabs((Labsdusttot-prevLabsdusttot)\/Labsdusttot);\n prevLabsdusttot = Labsdusttot;\n if ( (stage<Nstages-1 || cycle>1) && eps<stage_epsmax[stage])\n {\n _log->info(\"Convergence reached; the last increase in the absorbed dust luminosity was \"\n + QString::number(eps*100, 'f', 2) + \"%\");\n convergence = true;\n }\n else\n {\n _log->info(\"Convergence not yet reached; the increase in the absorbed dust luminosity was \"\n + QString::number(eps*100, 'f', 2) + \"%\");\n }\n cycle++;\n }\n if (!convergence)\n {\n _log->error(\"Convergence not yet reached after \" + QString::number(Ncyclesmax) + \" \"\n + QString(stage_name[stage]) + \" cycles!\");\n }\n }\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nvoid PanMonteCarloSimulation::dodustselfabsorptionchunk(size_t index)\n{\n \/\/ Determine the wavelength index for this chunk\n int ell = index % _Nlambda;\n\n \/\/ Determine the luminosity to be emitted at this wavelength index\n Array Lv(_Ncells);\n for (int m=0; m<_Ncells; m++)\n {\n double Labsbol = _Labsbolv[m];\n if (Labsbol>0.0) Lv[m] = Labsbol * _pds->dustluminosity(m,ell);\n }\n double Ltot = Lv.sum();\n\n \/\/ Emit photon packages\n if (Ltot > 0)\n {\n Array Xv;\n NR::cdf(Xv, Lv);\n\n PhotonPackage pp;\n double L = Ltot \/ _Npp;\n double Lthreshold = L \/ minWeightReduction();\n\n quint64 remaining = _chunksize;\n while (remaining > 0)\n {\n quint64 count = qMin(remaining, _logchunksize);\n for (quint64 i=0; i<count; i++)\n {\n double X = _random->uniform();\n int m = NR::locate_clip(Xv,X);\n Position bfr = _pds->randomPositionInCell(m);\n Direction bfk = _random->direction();\n pp.launch(L,ell,bfr,bfk);\n while (true)\n {\n _pds->fillOpticalDepth(&pp);\n simulateescapeandabsorption(&pp,true);\n double L = pp.luminosity();\n if (L==0.0) break;\n if (L<=Lthreshold && pp.nScatt()>=minScattEvents()) break;\n simulatepropagation(&pp);\n simulatescattering(&pp);\n }\n }\n logprogress(count);\n remaining -= count;\n }\n }\n else logprogress(_chunksize);\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nvoid PanMonteCarloSimulation::rundustemission()\n{\n TimeLogger logger(_log, \"the dust emission phase\");\n\n bool noDustSelfabsorption = !(_pds && _pds->selfAbsorption());\n\n \/\/ Construct the dust emission spectra\n _log->info(\"Calculating dust emission spectra...\");\n _pds->calculatedustemission(noDustSelfabsorption);\n _log->info(\"Dust emission spectra calculated.\");\n\n \/\/ Determine the bolometric luminosity that is absorbed in every cell (and that will hence be re-emitted).\n for (int m=0; m<_Ncells; m++)\n _Labsbolv[m] = _pds->Labs(m);\n\n \/\/ Perform the actual dust emission, possibly using more photon packages to obtain decent resolution\n setChunkParams(packages()*_pds->emissionBoost());\n initprogress(\"dust emission\");\n Parallel* parallel = find<ParallelFactory>()->parallel();\n parallel->call(this, &PanMonteCarloSimulation::dodustemissionchunk, assigner());\n\n \/\/ Wait for the other processes to reach this point\n _comm->wait(\"the dust emission phase\");\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nvoid PanMonteCarloSimulation::dodustemissionchunk(size_t index)\n{\n \/\/ Determine the wavelength index for this chunk\n int ell = index % _Nlambda;\n\n \/\/ Determine the luminosity to be emitted at this wavelength index\n Array Lv(_Ncells);\n for (int m=0; m<_Ncells; m++)\n {\n double Labsbol = _Labsbolv[m];\n if (Labsbol>0.0) Lv[m] = Labsbol * _pds->dustluminosity(m,ell);\n }\n double Ltot = Lv.sum(); \/\/ the total luminosity to be emitted at this wavelength index\n\n \/\/ Emit photon packages\n if (Ltot > 0)\n {\n \/\/ We consider biasing in the selection of the cell from which the photon packages are emitted.\n \/\/ A fraction of the cells is selected from the \"natural\" distribution, in which each cell is\n \/\/ weighted according to its total luminosity (Lv[em]). The other cells are selected from\n \/\/ a uniform distribution in which each cell has a equal probability.\n double xi = _pds->emissionBias(); \/\/ the fraction to be selected from a uniform distribution\n\n \/\/ the cumulative distribution of the natural pdf (Lv does not need to be normalized before)\n Array cumLv;\n NR::cdf(cumLv, Lv);\n\n PhotonPackage pp,ppp;\n double Lmean = Ltot\/_Ncells;\n double Lem = Ltot \/ _Npp;\n double Lthreshold = Lem \/ minWeightReduction();\n\n quint64 remaining = _chunksize;\n while (remaining > 0)\n {\n quint64 count = qMin(remaining, _logchunksize);\n for (quint64 i=0; i<count; i++)\n {\n int m;\n double X = _random->uniform();\n if (X<xi)\n {\n \/\/ rescale the deviate from [0,xi[ to [0,Ncells[\n m = max(0,min(_Ncells-1,static_cast<int>(_Ncells*X\/xi)));\n }\n else\n {\n \/\/ rescale the deviate from [xi,1[ to [0,1[\n m = NR::locate_clip(cumLv,(X-xi)\/(1-xi));\n }\n double weight = 1.0\/(1-xi+xi*Lmean\/Lv[m]);\n Position bfr = _pds->randomPositionInCell(m);\n Direction bfk = _random->direction();\n pp.launch(Lem*weight,ell,bfr,bfk);\n peeloffemission(&pp,&ppp);\n while (true)\n {\n _pds->fillOpticalDepth(&pp);\n if (continuousScattering()) continuouspeeloffscattering(&pp,&ppp);\n simulateescapeandabsorption(&pp,false);\n double L = pp.luminosity();\n if (L==0.0) break;\n if (L<=Lthreshold && pp.nScatt()>=minScattEvents()) break;\n simulatepropagation(&pp);\n if (!continuousScattering()) peeloffscattering(&pp,&ppp);\n simulatescattering(&pp);\n }\n }\n logprogress(count);\n remaining -= count;\n }\n }\n else logprogress(_chunksize);\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\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\/indexStrtree.h>\n#include <geos\/util.h>\n#include <geos\/profiler.h>\n\nnamespace geos {\n\n\nstatic bool xComparator(Boundable *a, Boundable *b){\n\treturn AbstractSTRtree::compareDoubles(STRtree::centreX((Envelope*)a->getBounds()), STRtree::centreX((Envelope*)b->getBounds()));\n}\n\nstatic bool yComparator(Boundable *a, Boundable *b){\n\treturn AbstractSTRtree::compareDoubles(STRtree::centreY((Envelope*)a->getBounds()), STRtree::centreY((Envelope*)b->getBounds()));\n}\n\n\/**\n * Constructs an STRtree with the default node capacity.\n *\/\nSTRtree::STRtree():\n\tAbstractSTRtree(10)\n{ \n\t\/\/intersectsOp(new STRIntersectsOp())\n}\n\n\/**\n * Constructs an STRtree with the given maximum number of child nodes that\n * a node may have\n *\/\nSTRtree::STRtree(int nodeCapacity):\n\tAbstractSTRtree(nodeCapacity)\n{ \n\t\/\/intersectsOp(new STRIntersectsOp())\n}\n\nSTRtree::~STRtree()\n{ \n\t\/\/delete intersectsOp;\n}\n\ndouble STRtree::centreX(Envelope *e) {\n\treturn STRtree::avg(e->getMinX(),e->getMaxX());\n}\n\ndouble STRtree::avg(double a, double b) { \n\treturn (a + b) \/ 2.0;\n}\n\ndouble STRtree::centreY(Envelope *e) {\n\treturn STRtree::avg(e->getMinY(), e->getMaxY());\n}\n\n\nbool\nSTRtree::STRIntersectsOp::intersects(const void* aBounds, const void* bBounds)\n{\n\treturn ((Envelope*)aBounds)->intersects((Envelope*)bBounds);\n}\n\n\/**\n * Creates the parent level for the given child level. First, orders the items\n * by the x-values of the midpoints, and groups them into vertical slices.\n * For each slice, orders the items by the y-values of the midpoints, and\n * group them into runs of size M (the node capacity). For each run, creates\n * a new (parent) node.\n *\/\nvector<Boundable*>*\nSTRtree::createParentBoundables(vector<Boundable*> *childBoundables, int newLevel)\n{\n\tAssert::isTrue(!childBoundables->empty());\n\tint minLeafCount=(int) ceil((double)childBoundables->size()\/(double)getNodeCapacity());\n\n\tvector<Boundable*> *sortedChildBoundables=sortBoundables(childBoundables);\n\tvector<vector<Boundable*>*>* verticalSlicesV = verticalSlices(sortedChildBoundables,(int)ceil(sqrt((double)minLeafCount)));\n\tdelete sortedChildBoundables;\n\tvector<Boundable*> *ret;\n\tret = createParentBoundablesFromVerticalSlices(verticalSlicesV, newLevel);\n\tfor (unsigned int i=0; i<verticalSlicesV->size(); i++)\n\t{\n\t\tvector<Boundable *>*inner = (*verticalSlicesV)[i];\n\t\t\/\/for (unsigned int j=0; j<inner->size(); j++)\n\t\t\/\/{\n\t\t\t\/\/ some of these might be provided,\n\t\t\t\/\/ some of these might be created\n\t\t\t\/\/delete (*inner)[j];\n\t\t\/\/}\n\t\tdelete inner;\n\t}\n\tdelete verticalSlicesV;\n\treturn ret;\n}\n\nvector<Boundable*>*\nSTRtree::createParentBoundablesFromVerticalSlices(vector<vector<Boundable*>*> *verticalSlices, int newLevel)\n{\n\tAssert::isTrue(verticalSlices->size()>0);\n\tvector<Boundable*> *parentBoundables=new vector<Boundable*>();\n\tfor (unsigned int i = 0; i <verticalSlices->size(); i++) {\n\t\tvector<Boundable*> *toAdd=createParentBoundablesFromVerticalSlice((*verticalSlices)[i], newLevel);\n\t\tparentBoundables->insert(parentBoundables->end(),toAdd->begin(),toAdd->end());\n\t\tdelete toAdd;\n\t}\n\treturn parentBoundables;\n}\n\nvector<Boundable*>*\nSTRtree::createParentBoundablesFromVerticalSlice(vector<Boundable*> *childBoundables, int newLevel)\n{\n\treturn AbstractSTRtree::createParentBoundables(childBoundables, newLevel);\n}\n\n\/**\n * @param childBoundables Must be sorted by the x-value of\n * the envelope midpoints\n * @return\n *\/\nvector<vector<Boundable*>*>*\nSTRtree::verticalSlices(vector<Boundable*>* childBoundables, int sliceCount)\n{\n\tint sliceCapacity = (int) ceil((double)childBoundables->size() \/ (double) sliceCount);\n\tvector<vector<Boundable*>*>* slices = new vector<vector<Boundable*>*>(sliceCount);\n\tunsigned int i=0;\n\tfor (int j=0; j<sliceCount; j++) {\n\t\t(*slices)[j]=new vector<Boundable*>();\n\t\tint boundablesAddedToSlice = 0;\n\t\twhile (i<childBoundables->size() && boundablesAddedToSlice < sliceCapacity)\n\t\t{\n\t\t\tBoundable *childBoundable=(*childBoundables)[i];\n\t\t\ti++;\n\t\t\t(*slices)[j]->push_back(childBoundable);\n\t\t\tboundablesAddedToSlice++;\n\t\t}\n\t}\n\treturn slices;\n}\n\nSTRAbstractNode::STRAbstractNode(int level):AbstractNode(level)\n{\n}\n\nSTRAbstractNode::~STRAbstractNode()\n{\n\tdelete (Envelope *)bounds;\n}\n\nvoid *\nSTRAbstractNode::computeBounds()\n{\n\tEnvelope* bounds=NULL;\n\tvector<Boundable*> *b=getChildBoundables();\n\tfor(unsigned int i=0;i<b->size();i++) {\n\t\tBoundable* childBoundable=(*b)[i];\n\t\tif (bounds==NULL) {\n\t\t\tbounds=new Envelope(*(Envelope*)childBoundable->getBounds());\n\t\t} else {\n\t\t\tbounds->expandToInclude((Envelope*)childBoundable->getBounds());\n\t\t}\n\t}\n\treturn bounds;\n}\n\nAbstractNode*\nSTRtree::createNode(int level)\n{\n\tAbstractNode *an = new STRAbstractNode(level);\n\tnodes->push_back(an);\n\treturn an;\n}\n\nvoid\nSTRtree::insert(const Envelope *itemEnv, void* item)\n{\n\tif (itemEnv->isNull()) { return; }\n\tAbstractSTRtree::insert(itemEnv, item);\n}\n\nvector<void*>*\nSTRtree::query(const Envelope *searchEnv)\n{\n\tvector<void *> *ret = AbstractSTRtree::query(searchEnv);\n\treturn ret;\n}\n\nvector<Boundable*> *\nSTRtree::sortBoundables(const vector<Boundable*> *input)\n{\n\tvector<Boundable*> *output=new vector<Boundable*>(*input);\n\tsort(output->begin(),output->end(),yComparator);\n\treturn output;\n}\n\n} \/\/ namespace geos\n\n\/**********************************************************************\n * $Log$\n * Revision 1.16 2004\/11\/08 15:58:13 strk\n * More performance tuning.\n *\n * Revision 1.15 2004\/11\/04 19:08:07 strk\n * Cleanups, initializers list, profiling.\n *\n * Revision 1.14 2004\/11\/01 16:43:04 strk\n * Added Profiler code.\n * Temporarly patched a bug in DoubleBits (must check drawbacks).\n * Various cleanups and speedups.\n *\n * Revision 1.13 2004\/07\/27 16:35:46 strk\n * Geometry::getEnvelopeInternal() changed to return a const Envelope *.\n * This should reduce object copies as once computed the envelope of a\n * geometry remains the same.\n *\n * Revision 1.12 2004\/07\/13 08:33:53 strk\n * Added missing virtual destructor to virtual classes.\n * Fixed implicit unsigned int -> int casts\n *\n * Revision 1.11 2004\/07\/02 13:28:27 strk\n * Fixed all #include lines to reflect headers layout change.\n * Added client application build tips in README.\n *\n * Revision 1.10 2004\/05\/06 15:00:59 strk\n * Boundable destructor made virtual.\n * Added vector <AbstractNode *> *nodes member in AbstractSTRTree,\n * used to keep track of created node to cleanly delete them at\n * destruction time.\n *\n * Revision 1.9 2004\/05\/06 13:58:30 strk\n * leak removed from createParentBoundablesFromVerticalSlices\n *\n * Revision 1.8 2004\/05\/05 17:42:06 strk\n * AbstractNode destructor made virtual. AbstractNode::bounds made protected.\n * SIRAbstractNode and STRAbstractNode destructors added to get rid of\n * AbstractNode::bounds in the right way (is a void * casted to appropriate\n * Class in the subClasses).\n *\n * Revision 1.7 2004\/05\/03 17:15:38 strk\n * leaks on exception fixed.\n *\n * Revision 1.6 2004\/05\/03 16:29:21 strk\n * Added sortBoundables(const vector<Boundable *>) pure virtual in AbstractSTRtree,\n * implemented in SIRtree and STRtree. Comparator funx made static in STRtree.cpp\n * and SIRtree.cpp.\n *\n * Revision 1.5 2004\/04\/26 12:37:19 strk\n * Some leaks fixed.\n *\n * Revision 1.4 2004\/04\/05 06:35:14 ybychkov\n * \"operation\/distance\" upgraded to JTS 1.4\n *\n * Revision 1.3 2004\/03\/25 02:23:55 ybychkov\n * All \"index\/*\" packages upgraded to JTS 1.4\n *\n * Revision 1.2 2003\/11\/07 01:23:42 pramsey\n * Add standard CVS headers licence notices and copyrights to all cpp and h\n * files.\n *\n *\n **********************************************************************\/\n\n<commit_msg>Just another small improvement.<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 *\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\/indexStrtree.h>\n#include <geos\/util.h>\n#include <geos\/profiler.h>\n\nnamespace geos {\n\n\nstatic bool xComparator(Boundable *a, Boundable *b){\n\treturn AbstractSTRtree::compareDoubles(STRtree::centreX((Envelope*)a->getBounds()), STRtree::centreX((Envelope*)b->getBounds()));\n}\n\nstatic bool yComparator(Boundable *a, Boundable *b){\n\treturn AbstractSTRtree::compareDoubles(STRtree::centreY((Envelope*)a->getBounds()), STRtree::centreY((Envelope*)b->getBounds()));\n}\n\n\/**\n * Constructs an STRtree with the default node capacity.\n *\/\nSTRtree::STRtree():\n\tAbstractSTRtree(10)\n{ \n\t\/\/intersectsOp(new STRIntersectsOp())\n}\n\n\/**\n * Constructs an STRtree with the given maximum number of child nodes that\n * a node may have\n *\/\nSTRtree::STRtree(int nodeCapacity):\n\tAbstractSTRtree(nodeCapacity)\n{ \n\t\/\/intersectsOp(new STRIntersectsOp())\n}\n\nSTRtree::~STRtree()\n{ \n\t\/\/delete intersectsOp;\n}\n\ndouble STRtree::centreX(Envelope *e) {\n\treturn STRtree::avg(e->getMinX(),e->getMaxX());\n}\n\ndouble STRtree::avg(double a, double b) { \n\treturn (a + b) \/ 2.0;\n}\n\ndouble STRtree::centreY(Envelope *e) {\n\treturn STRtree::avg(e->getMinY(), e->getMaxY());\n}\n\n\nbool\nSTRtree::STRIntersectsOp::intersects(const void* aBounds, const void* bBounds)\n{\n\treturn ((Envelope*)aBounds)->intersects((Envelope*)bBounds);\n}\n\n\/**\n * Creates the parent level for the given child level. First, orders the items\n * by the x-values of the midpoints, and groups them into vertical slices.\n * For each slice, orders the items by the y-values of the midpoints, and\n * group them into runs of size M (the node capacity). For each run, creates\n * a new (parent) node.\n *\/\nvector<Boundable*>*\nSTRtree::createParentBoundables(vector<Boundable*> *childBoundables, int newLevel)\n{\n\tAssert::isTrue(!childBoundables->empty());\n\tint minLeafCount=(int) ceil((double)childBoundables->size()\/(double)getNodeCapacity());\n\n\tvector<Boundable*> *sortedChildBoundables=sortBoundables(childBoundables);\n\tvector<vector<Boundable*>*>* verticalSlicesV = verticalSlices(sortedChildBoundables,(int)ceil(sqrt((double)minLeafCount)));\n\tdelete sortedChildBoundables;\n\tvector<Boundable*> *ret;\n\tret = createParentBoundablesFromVerticalSlices(verticalSlicesV, newLevel);\n\tfor (unsigned int i=0; i<verticalSlicesV->size(); i++)\n\t{\n\t\tvector<Boundable *>*inner = (*verticalSlicesV)[i];\n\t\t\/\/for (unsigned int j=0; j<inner->size(); j++)\n\t\t\/\/{\n\t\t\t\/\/ some of these might be provided,\n\t\t\t\/\/ some of these might be created\n\t\t\t\/\/delete (*inner)[j];\n\t\t\/\/}\n\t\tdelete inner;\n\t}\n\tdelete verticalSlicesV;\n\treturn ret;\n}\n\nvector<Boundable*>*\nSTRtree::createParentBoundablesFromVerticalSlices(vector<vector<Boundable*>*> *verticalSlices, int newLevel)\n{\n\tAssert::isTrue(verticalSlices->size()>0);\n\tvector<Boundable*> *parentBoundables=new vector<Boundable*>();\n\tfor (unsigned int i = 0; i <verticalSlices->size(); i++) {\n\t\tvector<Boundable*> *toAdd=createParentBoundablesFromVerticalSlice((*verticalSlices)[i], newLevel);\n\t\tparentBoundables->insert(parentBoundables->end(),toAdd->begin(),toAdd->end());\n\t\tdelete toAdd;\n\t}\n\treturn parentBoundables;\n}\n\nvector<Boundable*>*\nSTRtree::createParentBoundablesFromVerticalSlice(vector<Boundable*> *childBoundables, int newLevel)\n{\n\treturn AbstractSTRtree::createParentBoundables(childBoundables, newLevel);\n}\n\n\/**\n * @param childBoundables Must be sorted by the x-value of\n * the envelope midpoints\n * @return\n *\/\nvector<vector<Boundable*>*>*\nSTRtree::verticalSlices(vector<Boundable*>* childBoundables, int sliceCount)\n{\n\tint sliceCapacity = (int) ceil((double)childBoundables->size() \/ (double) sliceCount);\n\tvector<vector<Boundable*>*>* slices = new vector<vector<Boundable*>*>(sliceCount);\n\tunsigned int i=0;\n\tfor (int j=0; j<sliceCount; j++) {\n\t\t(*slices)[j]=new vector<Boundable*>();\n\t\tint boundablesAddedToSlice = 0;\n\t\twhile (i<childBoundables->size() && boundablesAddedToSlice < sliceCapacity)\n\t\t{\n\t\t\tBoundable *childBoundable=(*childBoundables)[i];\n\t\t\ti++;\n\t\t\t(*slices)[j]->push_back(childBoundable);\n\t\t\tboundablesAddedToSlice++;\n\t\t}\n\t}\n\treturn slices;\n}\n\nSTRAbstractNode::STRAbstractNode(int level):AbstractNode(level)\n{\n}\n\nSTRAbstractNode::~STRAbstractNode()\n{\n\tdelete (Envelope *)bounds;\n}\n\nvoid *\nSTRAbstractNode::computeBounds()\n{\n\tEnvelope* bounds=NULL;\n\tvector<Boundable*> *b=getChildBoundables();\n\tunsigned int bsize=b->size();\n\tif ( bsize ) bounds=new Envelope(*(Envelope*)(*b)[0]->getBounds());\n\tfor(unsigned int i=1; i<bsize; i++) {\n\t\tBoundable* childBoundable=(*b)[i];\n\t\tbounds->expandToInclude((Envelope*)childBoundable->getBounds());\n\t}\n\treturn bounds;\n}\n\nAbstractNode*\nSTRtree::createNode(int level)\n{\n\tAbstractNode *an = new STRAbstractNode(level);\n\tnodes->push_back(an);\n\treturn an;\n}\n\nvoid\nSTRtree::insert(const Envelope *itemEnv, void* item)\n{\n\tif (itemEnv->isNull()) { return; }\n\tAbstractSTRtree::insert(itemEnv, item);\n}\n\nvector<void*>*\nSTRtree::query(const Envelope *searchEnv)\n{\n\tvector<void *> *ret = AbstractSTRtree::query(searchEnv);\n\treturn ret;\n}\n\nvector<Boundable*> *\nSTRtree::sortBoundables(const vector<Boundable*> *input)\n{\n\tvector<Boundable*> *output=new vector<Boundable*>(*input);\n\tsort(output->begin(),output->end(),yComparator);\n\treturn output;\n}\n\n} \/\/ namespace geos\n\n\/**********************************************************************\n * $Log$\n * Revision 1.17 2004\/11\/08 18:33:47 strk\n * Just another small improvement.\n *\n * Revision 1.16 2004\/11\/08 15:58:13 strk\n * More performance tuning.\n *\n * Revision 1.15 2004\/11\/04 19:08:07 strk\n * Cleanups, initializers list, profiling.\n *\n * Revision 1.14 2004\/11\/01 16:43:04 strk\n * Added Profiler code.\n * Temporarly patched a bug in DoubleBits (must check drawbacks).\n * Various cleanups and speedups.\n *\n * Revision 1.13 2004\/07\/27 16:35:46 strk\n * Geometry::getEnvelopeInternal() changed to return a const Envelope *.\n * This should reduce object copies as once computed the envelope of a\n * geometry remains the same.\n *\n * Revision 1.12 2004\/07\/13 08:33:53 strk\n * Added missing virtual destructor to virtual classes.\n * Fixed implicit unsigned int -> int casts\n *\n * Revision 1.11 2004\/07\/02 13:28:27 strk\n * Fixed all #include lines to reflect headers layout change.\n * Added client application build tips in README.\n *\n * Revision 1.10 2004\/05\/06 15:00:59 strk\n * Boundable destructor made virtual.\n * Added vector <AbstractNode *> *nodes member in AbstractSTRTree,\n * used to keep track of created node to cleanly delete them at\n * destruction time.\n *\n * Revision 1.9 2004\/05\/06 13:58:30 strk\n * leak removed from createParentBoundablesFromVerticalSlices\n *\n * Revision 1.8 2004\/05\/05 17:42:06 strk\n * AbstractNode destructor made virtual. AbstractNode::bounds made protected.\n * SIRAbstractNode and STRAbstractNode destructors added to get rid of\n * AbstractNode::bounds in the right way (is a void * casted to appropriate\n * Class in the subClasses).\n *\n * Revision 1.7 2004\/05\/03 17:15:38 strk\n * leaks on exception fixed.\n *\n * Revision 1.6 2004\/05\/03 16:29:21 strk\n * Added sortBoundables(const vector<Boundable *>) pure virtual in AbstractSTRtree,\n * implemented in SIRtree and STRtree. Comparator funx made static in STRtree.cpp\n * and SIRtree.cpp.\n *\n * Revision 1.5 2004\/04\/26 12:37:19 strk\n * Some leaks fixed.\n *\n * Revision 1.4 2004\/04\/05 06:35:14 ybychkov\n * \"operation\/distance\" upgraded to JTS 1.4\n *\n * Revision 1.3 2004\/03\/25 02:23:55 ybychkov\n * All \"index\/*\" packages upgraded to JTS 1.4\n *\n * Revision 1.2 2003\/11\/07 01:23:42 pramsey\n * Add standard CVS headers licence notices and copyrights to all cpp and h\n * files.\n *\n *\n **********************************************************************\/\n\n<|endoftext|>"} {"text":"<commit_before><commit_msg>INTEGRATION: CWS residcleanup (1.24.22); FILE MERGED 2007\/02\/18 19:21:41 pl 1.24.22.1: #i74635# get rid of implicit global ResMgr<commit_after><|endoftext|>"} {"text":"<commit_before>\/*************************************************************************\n *\n * $RCSfile: htmlex.hxx,v $\n *\n * $Revision: 1.7 $\n *\n * last change: $Author: rt $ $Date: 2004-08-23 08: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_HTMLEX_HXX\n#define _SD_HTMLEX_HXX\n\n#ifndef _COM_SUN_STAR_BEANS_PROPERTYVALUE_HPP_\n#include <com\/sun\/star\/beans\/PropertyValue.hpp>\n#endif\n\n#ifndef _XPOLY_HXX\n#include <svx\/xpoly.hxx>\n#endif\n#ifndef _SV_GDIMTF_HXX \/\/autogen\n#include <vcl\/gdimtf.hxx>\n#endif\n#ifndef _SFXITEMSET_HXX \/\/autogen\n#include <svtools\/itemset.hxx>\n#endif\n#ifndef _SD_RESLTN_HXX\n#include \"resltn.hxx\" \/\/ enum PublishingResolution\n#endif\n#ifndef _SV_COLRDLG_HXX\n#include <svtools\/colrdlg.hxx>\n#endif\n#ifndef _EHDL_HXX \/\/autogen\n#include <svtools\/ehdl.hxx>\n#endif\n\n#include \"strings.hrc\"\n\n#ifndef SD_DRAW_DOC_SHELL_HXX\n#include \"DrawDocShell.hxx\"\n#endif\n\n#ifndef SD_WINDOW_HXX\n#include \"Window.hxx\"\n#endif\n\n#ifndef SD_VIEW_SHELL_HXX\n#include \"ViewShell.hxx\"\n#endif\n\n#ifndef INC_ASSCLASS\n#include \"assclass.hxx\"\n#endif\n\n#ifndef _SD_RESID_HXX\n#include \"sdresid.hxx\"\n#endif\n\n#ifndef _SD_PUBDLG_HXX\n#include \"pubdlg.hxx\"\n#endif\n\n#define NUM_BUTTONS 12\n\n#define PUB_LOWRES_WIDTH 640\n#define PUB_LOWRES_HEIGHT 480\n#define PUB_MEDRES_WIDTH 800\n#define PUB_MEDRES_HEIGHT 600\n#define PUB_HIGHRES_WIDTH 1024\n#define PUB_HIGHRES_HEIGHT 768\n\n#define HtmlButtonThemaStr = \"private:\/\/gallery\/hidden\/HtmlExportButtons\";\n\nclass List;\nclass SfxProgress;\nclass SdrOutliner;\nclass SdPage;\nclass HtmlState;\nclass SdrTextObj;\nclass SdrPage;\nclass SdDrawDocument;\n\nnamespace sd {\nclass View;\n}\n\nclass HtmlErrorContext : public ErrorContext\n{\nprivate:\n USHORT m_nResId;\n String m_aURL1;\n String m_aURL2;\n\npublic:\n HtmlErrorContext(Window *pWin=0);\n ~HtmlErrorContext() {};\n\n virtual BOOL GetString( ULONG nErrId, String& rCtxStr );\n\n void SetContext( USHORT nResId );\n void SetContext( USHORT nResId, const String& rURL );\n void SetContext( USHORT nResId, const String& rURL1, const String& rURL2 );\n};\n\n\/\/ =====================================================================\n\/\/ this class exports an Impress Document as a HTML Presentation\n\/\/ =====================================================================\nclass HtmlExport\n{\n String m_aPath;\n\n SdDrawDocument* pDoc;\n ::sd::DrawDocShell* pDocSh;\n\n HtmlErrorContext m_eEC;\n\n HtmlPublishMode m_eMode;\n SfxProgress* mpProgress;\n bool m_bImpress;\n USHORT m_nSdPageCount;\n USHORT m_nPagesWritten;\n bool m_bContentsPage;\n INT16 m_nButtonThema;\n UINT16 m_nWidthPixel;\n UINT16 m_nHeightPixel;\n PublishingFormat m_eFormat;\n bool m_bHeader;\n bool m_bNotes;\n bool m_bFrames;\n bool m_bKiosk;\n\/\/-\/ bool m_bCreated;\n String m_aIndex;\n String m_aEMail;\n String m_aAuthor;\n String m_aHomePage;\n String m_aInfo;\n INT16 m_nCompression;\n String m_aDocFileName;\n String m_aFramePage;\n String m_DocTitle;\n bool m_bDownload;\n\n bool m_bAutoSlide;\n UINT32 m_nSlideDuration;\n bool m_bSlideSound;\n bool m_bEndless;\n\n bool m_bUserAttr; \/\/ die folgenden Farben werden fuer das <body>\n Color m_aTextColor; \/\/ tag genutzt, wenn m_bUserAttr true ist\n Color m_aBackColor;\n Color m_aLinkColor;\n Color m_aVLinkColor;\n Color m_aALinkColor;\n Color m_aFirstPageColor;\n bool m_bDocColors;\n\n String m_aHTMLExtension;\n String** m_pHTMLFiles;\n String** m_pImageFiles;\n String** m_pPageNames;\n String** m_pTextFiles;\n\n String m_aExportPath; \/\/ Das Ausgabeverzeichnes bzw. die URL\n String m_aIndexUrl;\n String m_aURLPath;\n String m_aCGIPath;\n PublishingScript m_eScript;\n\n SdrTextObj* GetLayoutTextObject(SdrPage* pPage);\n\n void SetDocColors( SdPage* pPage = NULL );\n\n bool CreateImagesForPresPages();\n bool CreateHtmlTextForPresPages();\n bool CreateHtmlForPresPages();\n bool CreateContentPage();\n void CreateFileNames();\n bool CreateBitmaps();\n bool CreateOutlinePages();\n bool CreateFrames();\n bool CreateNotesPages();\n bool CreateNavBarFrames();\n\n bool CreateASPScripts();\n bool CreatePERLScripts();\n bool CreateImageFileList();\n bool CreateImageNumberFile();\n\n ULONG CreateBitmap( ULONG nThemeId, INT16 nImage, const String& aName ) const;\n void SmoothBitmap( BitmapEx& aBmp, Color aBackCol ) const;\n String getDocumentTitle();\n bool SavePresentation();\n\n String CreateLink( const String& aLink, const String& aText,\n const String& aTarget = String()) const;\n String CreateImage( const String& aImage, const String& aAltText, INT16 nWidth = -1, INT16 nHeight = -1 ) const;\n String CreateNavBar( USHORT nSdPage, bool bIsText ) const;\n String CreateBodyTag() const;\n\n String ParagraphToHTMLString( SdrOutliner* pOutliner, ULONG nPara, const Color& rBackgroundColor );\n String TextAttribToHTMLString( SfxItemSet* pSet, HtmlState* pState, const Color& rBackgroundColor );\n\n String CreateTextForTitle( SdrOutliner* pOutliner, SdPage* pPage, const Color& rBackgroundColor );\n String CreateTextForPage( SdrOutliner* pOutliner, SdPage* pPage, bool bHeadLine, const Color& rBackgroundColor );\n String CreateTextForNotesPage( SdrOutliner* pOutliner, SdPage* pPage, bool bHeadLine, const Color& rBackgroundColor );\n\n String CreateHTMLCircleArea( ULONG nRadius, ULONG nCenterX,\n ULONG nCenterY, const String& rHRef ) const;\n String CreateHTMLPolygonArea( const XPolyPolygon& rXPolyPoly,\n Size aShift, double fFactor,\n const String& rHRef ) const;\n String CreateHTMLRectArea( const Rectangle& rRect,\n const String& rHRef ) const;\n\n String CreatePageURL( USHORT nPgNum );\n\n String InsertSound( const String& rSoundFile );\n bool CopyFile( const String& rSourceFile, const String& rDestPath );\n bool CopyScript( const String& rPath, const String& rSource, const String& rDest, bool bUnix = false );\n\n void InitProgress( USHORT nProgrCount );\n void ResetProgress();\n\n String WriteMetaCharset() const;\n\n void InitExportParameters( const com::sun::star::uno::Sequence< com::sun::star::beans::PropertyValue >& rParams);\n void ExportHtml();\n void ExportKiosk();\n void ExportWebCast();\n\n List aSpecialObjects;\n void HideSpecialObjects( SdPage* pPage );\n void ShowSpecialObjects();\n\n bool WriteHtml( const String& rFileName, bool bAddExtension, const String& rHtmlData );\n String GetButtonName( USHORT nButton ) const;\n\n public:\n HtmlExport( rtl::OUString aPath, const com::sun::star::uno::Sequence< com::sun::star::beans::PropertyValue >& rParams, SdDrawDocument* pExpDoc, ::sd::DrawDocShell* pDocShell );\n virtual ~HtmlExport();\n\n static String ColorToHTMLString( Color aColor );\n static String StringToHTMLString( const String& rString );\n static String StringToURL( const String& rURL );\n};\n\n#endif \/\/ _SD_HTMLEX_HXX\n<commit_msg>INTEGRATION: CWS impress30 (1.7.146); FILE MERGED 2005\/01\/20 13:44:51 cl 1.7.146.1: #b4752338# give warning when overwriting files<commit_after>\/*************************************************************************\n *\n * $RCSfile: htmlex.hxx,v $\n *\n * $Revision: 1.8 $\n *\n * last change: $Author: rt $ $Date: 2005-01-28 15:38:49 $\n *\n * The Contents of this file are made available subject to the terms of\n * either of the following licenses\n *\n * - GNU Lesser General Public License Version 2.1\n * - Sun Industry Standards Source License Version 1.1\n *\n * Sun Microsystems Inc., October, 2000\n *\n * GNU Lesser General Public License Version 2.1\n * =============================================\n * Copyright 2000 by Sun Microsystems, Inc.\n * 901 San Antonio Road, Palo Alto, CA 94303, USA\n *\n * This library is free software; you can redistribute it and\/or\n * modify it under the terms of the GNU Lesser General Public\n * License version 2.1, as published by the Free Software Foundation.\n *\n * This library is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU\n * Lesser General Public License for more details.\n *\n * You should have received a copy of the GNU Lesser General Public\n * License along with this library; if not, write to the Free Software\n * Foundation, Inc., 59 Temple Place, Suite 330, Boston,\n * MA 02111-1307 USA\n *\n *\n * Sun Industry Standards Source License Version 1.1\n * =================================================\n * The contents of this file are subject to the Sun Industry Standards\n * Source License Version 1.1 (the \"License\"); You may not use this file\n * except in compliance with the License. You may obtain a copy of the\n * License at http:\/\/www.openoffice.org\/license.html.\n *\n * Software provided under this License is provided on an \"AS IS\" basis,\n * WITHOUT WARRANTY OF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING,\n * WITHOUT LIMITATION, WARRANTIES THAT THE SOFTWARE IS FREE OF DEFECTS,\n * MERCHANTABLE, FIT FOR A PARTICULAR PURPOSE, OR NON-INFRINGING.\n * See the License for the specific provisions governing your rights and\n * obligations concerning the Software.\n *\n * The Initial Developer of the Original Code is: Sun Microsystems, Inc.\n *\n * Copyright: 2000 by Sun Microsystems, Inc.\n *\n * All Rights Reserved.\n *\n * Contributor(s): _______________________________________\n *\n *\n ************************************************************************\/\n\n#ifndef _SD_HTMLEX_HXX\n#define _SD_HTMLEX_HXX\n\n#ifndef _COM_SUN_STAR_BEANS_PROPERTYVALUE_HPP_\n#include <com\/sun\/star\/beans\/PropertyValue.hpp>\n#endif\n#ifndef _COM_SUN_STAR_UCB_XSIMPLEFILEACCESS_HPP_\n#include <com\/sun\/star\/ucb\/XSimpleFileAccess.hpp>\n#endif\n\n#ifndef _XPOLY_HXX\n#include <svx\/xpoly.hxx>\n#endif\n#ifndef _SV_GDIMTF_HXX \/\/autogen\n#include <vcl\/gdimtf.hxx>\n#endif\n#ifndef _SFXITEMSET_HXX \/\/autogen\n#include <svtools\/itemset.hxx>\n#endif\n#ifndef _SD_RESLTN_HXX\n#include \"resltn.hxx\" \/\/ enum PublishingResolution\n#endif\n#ifndef _SV_COLRDLG_HXX\n#include <svtools\/colrdlg.hxx>\n#endif\n#ifndef _EHDL_HXX \/\/autogen\n#include <svtools\/ehdl.hxx>\n#endif\n\n#include \"strings.hrc\"\n\n#ifndef SD_DRAW_DOC_SHELL_HXX\n#include \"DrawDocShell.hxx\"\n#endif\n\n#ifndef SD_WINDOW_HXX\n#include \"Window.hxx\"\n#endif\n\n#ifndef SD_VIEW_SHELL_HXX\n#include \"ViewShell.hxx\"\n#endif\n\n#ifndef INC_ASSCLASS\n#include \"assclass.hxx\"\n#endif\n\n#ifndef _SD_RESID_HXX\n#include \"sdresid.hxx\"\n#endif\n\n#ifndef _SD_PUBDLG_HXX\n#include \"pubdlg.hxx\"\n#endif\n\n#define NUM_BUTTONS 12\n\n#define PUB_LOWRES_WIDTH 640\n#define PUB_LOWRES_HEIGHT 480\n#define PUB_MEDRES_WIDTH 800\n#define PUB_MEDRES_HEIGHT 600\n#define PUB_HIGHRES_WIDTH 1024\n#define PUB_HIGHRES_HEIGHT 768\n\n#define HtmlButtonThemaStr = \"private:\/\/gallery\/hidden\/HtmlExportButtons\";\n\nclass List;\nclass SfxProgress;\nclass SdrOutliner;\nclass SdPage;\nclass HtmlState;\nclass SdrTextObj;\nclass SdrPage;\nclass SdDrawDocument;\n\nnamespace sd {\nclass View;\n}\n\nclass HtmlErrorContext : public ErrorContext\n{\nprivate:\n USHORT m_nResId;\n String m_aURL1;\n String m_aURL2;\n\npublic:\n HtmlErrorContext(Window *pWin=0);\n ~HtmlErrorContext() {};\n\n virtual BOOL GetString( ULONG nErrId, String& rCtxStr );\n\n void SetContext( USHORT nResId );\n void SetContext( USHORT nResId, const String& rURL );\n void SetContext( USHORT nResId, const String& rURL1, const String& rURL2 );\n};\n\n\/\/ =====================================================================\n\/\/ this class exports an Impress Document as a HTML Presentation\n\/\/ =====================================================================\nclass HtmlExport\n{\n String m_aPath;\n\n SdDrawDocument* pDoc;\n ::sd::DrawDocShell* pDocSh;\n\n HtmlErrorContext m_eEC;\n\n HtmlPublishMode m_eMode;\n SfxProgress* mpProgress;\n bool m_bImpress;\n USHORT m_nSdPageCount;\n USHORT m_nPagesWritten;\n bool m_bContentsPage;\n INT16 m_nButtonThema;\n UINT16 m_nWidthPixel;\n UINT16 m_nHeightPixel;\n PublishingFormat m_eFormat;\n bool m_bHeader;\n bool m_bNotes;\n bool m_bFrames;\n bool m_bKiosk;\n\/\/-\/ bool m_bCreated;\n String m_aIndex;\n String m_aEMail;\n String m_aAuthor;\n String m_aHomePage;\n String m_aInfo;\n INT16 m_nCompression;\n String m_aDocFileName;\n String m_aFramePage;\n String m_DocTitle;\n bool m_bDownload;\n\n bool m_bAutoSlide;\n UINT32 m_nSlideDuration;\n bool m_bSlideSound;\n bool m_bEndless;\n\n bool m_bUserAttr; \/\/ die folgenden Farben werden fuer das <body>\n Color m_aTextColor; \/\/ tag genutzt, wenn m_bUserAttr true ist\n Color m_aBackColor;\n Color m_aLinkColor;\n Color m_aVLinkColor;\n Color m_aALinkColor;\n Color m_aFirstPageColor;\n bool m_bDocColors;\n\n String m_aHTMLExtension;\n String** m_pHTMLFiles;\n String** m_pImageFiles;\n String** m_pPageNames;\n String** m_pTextFiles;\n\n String m_aExportPath; \/\/ Das Ausgabeverzeichnes bzw. die URL\n String m_aIndexUrl;\n String m_aURLPath;\n String m_aCGIPath;\n PublishingScript m_eScript;\n\n SdrTextObj* GetLayoutTextObject(SdrPage* pPage);\n\n void SetDocColors( SdPage* pPage = NULL );\n\n bool CreateImagesForPresPages();\n bool CreateHtmlTextForPresPages();\n bool CreateHtmlForPresPages();\n bool CreateContentPage();\n void CreateFileNames();\n bool CreateBitmaps();\n bool CreateOutlinePages();\n bool CreateFrames();\n bool CreateNotesPages();\n bool CreateNavBarFrames();\n\n bool CreateASPScripts();\n bool CreatePERLScripts();\n bool CreateImageFileList();\n bool CreateImageNumberFile();\n\n bool checkForExistingFiles();\n bool checkFileExists( ::com::sun::star::uno::Reference< ::com::sun::star::ucb::XSimpleFileAccess >& xFileAccess, String const & aFileName );\n\n ULONG CreateBitmap( ULONG nThemeId, INT16 nImage, const String& aName ) const;\n void SmoothBitmap( BitmapEx& aBmp, Color aBackCol ) const;\n String getDocumentTitle();\n bool SavePresentation();\n\n String CreateLink( const String& aLink, const String& aText,\n const String& aTarget = String()) const;\n String CreateImage( const String& aImage, const String& aAltText, INT16 nWidth = -1, INT16 nHeight = -1 ) const;\n String CreateNavBar( USHORT nSdPage, bool bIsText ) const;\n String CreateBodyTag() const;\n\n String ParagraphToHTMLString( SdrOutliner* pOutliner, ULONG nPara, const Color& rBackgroundColor );\n String TextAttribToHTMLString( SfxItemSet* pSet, HtmlState* pState, const Color& rBackgroundColor );\n\n String CreateTextForTitle( SdrOutliner* pOutliner, SdPage* pPage, const Color& rBackgroundColor );\n String CreateTextForPage( SdrOutliner* pOutliner, SdPage* pPage, bool bHeadLine, const Color& rBackgroundColor );\n String CreateTextForNotesPage( SdrOutliner* pOutliner, SdPage* pPage, bool bHeadLine, const Color& rBackgroundColor );\n\n String CreateHTMLCircleArea( ULONG nRadius, ULONG nCenterX,\n ULONG nCenterY, const String& rHRef ) const;\n String CreateHTMLPolygonArea( const XPolyPolygon& rXPolyPoly,\n Size aShift, double fFactor,\n const String& rHRef ) const;\n String CreateHTMLRectArea( const Rectangle& rRect,\n const String& rHRef ) const;\n\n String CreatePageURL( USHORT nPgNum );\n\n String InsertSound( const String& rSoundFile );\n bool CopyFile( const String& rSourceFile, const String& rDestPath );\n bool CopyScript( const String& rPath, const String& rSource, const String& rDest, bool bUnix = false );\n\n void InitProgress( USHORT nProgrCount );\n void ResetProgress();\n\n String WriteMetaCharset() const;\n\n void InitExportParameters( const com::sun::star::uno::Sequence< com::sun::star::beans::PropertyValue >& rParams);\n void ExportHtml();\n void ExportKiosk();\n void ExportWebCast();\n\n List aSpecialObjects;\n void HideSpecialObjects( SdPage* pPage );\n void ShowSpecialObjects();\n\n bool WriteHtml( const String& rFileName, bool bAddExtension, const String& rHtmlData );\n String GetButtonName( USHORT nButton ) const;\n\n public:\n HtmlExport( rtl::OUString aPath, const com::sun::star::uno::Sequence< com::sun::star::beans::PropertyValue >& rParams, SdDrawDocument* pExpDoc, ::sd::DrawDocShell* pDocShell );\n virtual ~HtmlExport();\n\n static String ColorToHTMLString( Color aColor );\n static String StringToHTMLString( const String& rString );\n static String StringToURL( const String& rURL );\n};\n\n#endif \/\/ _SD_HTMLEX_HXX\n<|endoftext|>"} {"text":"<commit_before>\/\/===-- RuntimeDyldCOFF.cpp - Run-time dynamic linker for MC-JIT -*- 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\/\/ Implementation of COFF support for the MC-JIT runtime dynamic linker.\n\/\/\n\/\/===----------------------------------------------------------------------===\/\/\n\n#include \"RuntimeDyldCOFF.h\"\n#include \"Targets\/RuntimeDyldCOFFX86_64.h\"\n#include \"llvm\/ADT\/STLExtras.h\"\n#include \"llvm\/ADT\/Triple.h\"\n#include \"llvm\/Object\/ObjectFile.h\"\n\nusing namespace llvm;\nusing namespace llvm::object;\n\n#define DEBUG_TYPE \"dyld\"\n\nnamespace {\n\nclass LoadedCOFFObjectInfo\n : public RuntimeDyld::LoadedObjectInfoHelper<LoadedCOFFObjectInfo> {\npublic:\n LoadedCOFFObjectInfo(RuntimeDyldImpl &RTDyld, unsigned BeginIdx,\n unsigned EndIdx)\n : LoadedObjectInfoHelper(RTDyld, BeginIdx, EndIdx) {}\n\n OwningBinary<ObjectFile>\n getObjectForDebug(const ObjectFile &Obj) const override {\n return OwningBinary<ObjectFile>();\n }\n};\n}\n\nnamespace llvm {\n\nstd::unique_ptr<RuntimeDyldCOFF>\nllvm::RuntimeDyldCOFF::create(Triple::ArchType Arch,\n RuntimeDyld::MemoryManager &MemMgr,\n RuntimeDyld::SymbolResolver &Resolver) {\n switch (Arch) {\n default:\n llvm_unreachable(\"Unsupported target for RuntimeDyldCOFF.\");\n break;\n case Triple::x86_64:\n return make_unique<RuntimeDyldCOFFX86_64>(MemMgr, Resolver);\n }\n}\n\nstd::unique_ptr<RuntimeDyld::LoadedObjectInfo>\nRuntimeDyldCOFF::loadObject(const object::ObjectFile &O) {\n unsigned SectionStartIdx, SectionEndIdx;\n std::tie(SectionStartIdx, SectionEndIdx) = loadObjectImpl(O);\n return llvm::make_unique<LoadedCOFFObjectInfo>(*this, SectionStartIdx,\n SectionEndIdx);\n}\n\nuint64_t RuntimeDyldCOFF::getSymbolOffset(const SymbolRef &Sym) {\n uint64_t Address;\n if (Sym.getAddress(Address))\n return UnknownAddress;\n\n if (Address == UnknownAddress)\n return UnknownAddress;\n\n const ObjectFile *Obj = Sym.getObject();\n section_iterator SecI(Obj->section_end());\n if (Sym.getSection(SecI))\n return UnknownAddress;\n\n if (SecI == Obj->section_end())\n return UnknownAddress;\n\n uint64_t SectionAddress = SecI->getAddress();\n return Address - SectionAddress;\n}\n\nbool RuntimeDyldCOFF::isCompatibleFile(const object::ObjectFile &Obj) const {\n return Obj.isCOFF();\n}\n\n} \/\/ namespace llvm\n<commit_msg>Use Symbol.getValue to simplify RuntimeDyldCOFF::getSymbolOffset. NFC.<commit_after>\/\/===-- RuntimeDyldCOFF.cpp - Run-time dynamic linker for MC-JIT -*- 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\/\/ Implementation of COFF support for the MC-JIT runtime dynamic linker.\n\/\/\n\/\/===----------------------------------------------------------------------===\/\/\n\n#include \"RuntimeDyldCOFF.h\"\n#include \"Targets\/RuntimeDyldCOFFX86_64.h\"\n#include \"llvm\/ADT\/STLExtras.h\"\n#include \"llvm\/ADT\/Triple.h\"\n#include \"llvm\/Object\/ObjectFile.h\"\n\nusing namespace llvm;\nusing namespace llvm::object;\n\n#define DEBUG_TYPE \"dyld\"\n\nnamespace {\n\nclass LoadedCOFFObjectInfo\n : public RuntimeDyld::LoadedObjectInfoHelper<LoadedCOFFObjectInfo> {\npublic:\n LoadedCOFFObjectInfo(RuntimeDyldImpl &RTDyld, unsigned BeginIdx,\n unsigned EndIdx)\n : LoadedObjectInfoHelper(RTDyld, BeginIdx, EndIdx) {}\n\n OwningBinary<ObjectFile>\n getObjectForDebug(const ObjectFile &Obj) const override {\n return OwningBinary<ObjectFile>();\n }\n};\n}\n\nnamespace llvm {\n\nstd::unique_ptr<RuntimeDyldCOFF>\nllvm::RuntimeDyldCOFF::create(Triple::ArchType Arch,\n RuntimeDyld::MemoryManager &MemMgr,\n RuntimeDyld::SymbolResolver &Resolver) {\n switch (Arch) {\n default:\n llvm_unreachable(\"Unsupported target for RuntimeDyldCOFF.\");\n break;\n case Triple::x86_64:\n return make_unique<RuntimeDyldCOFFX86_64>(MemMgr, Resolver);\n }\n}\n\nstd::unique_ptr<RuntimeDyld::LoadedObjectInfo>\nRuntimeDyldCOFF::loadObject(const object::ObjectFile &O) {\n unsigned SectionStartIdx, SectionEndIdx;\n std::tie(SectionStartIdx, SectionEndIdx) = loadObjectImpl(O);\n return llvm::make_unique<LoadedCOFFObjectInfo>(*this, SectionStartIdx,\n SectionEndIdx);\n}\n\nuint64_t RuntimeDyldCOFF::getSymbolOffset(const SymbolRef &Sym) {\n \/\/ The value in a relocatable COFF object is the offset.\n return Sym.getValue();\n}\n\nbool RuntimeDyldCOFF::isCompatibleFile(const object::ObjectFile &Obj) const {\n return Obj.isCOFF();\n}\n\n} \/\/ namespace llvm\n<|endoftext|>"} {"text":"<commit_before><commit_msg>coverity#735844 Dereference after null check<commit_after><|endoftext|>"} {"text":"<commit_before>\/\/===--- BugReducerTester.cpp ---------------------------------------------===\/\/\n\/\/\n\/\/ This source file is part of the Swift.org open source project\n\/\/\n\/\/ Copyright (c) 2014 - 2016 Apple Inc. and the Swift project authors\n\/\/ Licensed under Apache License v2.0 with Runtime Library Exception\n\/\/\n\/\/ See https:\/\/swift.org\/LICENSE.txt for license information\n\/\/ See https:\/\/swift.org\/CONTRIBUTORS.txt for the list of Swift project authors\n\/\/\n\/\/===----------------------------------------------------------------------===\/\/\n\/\/\/\n\/\/\/ \\file\n\/\/\/\n\/\/\/ This pass is a testing pass for sil-bug-reducer. It asserts when it visits a\n\/\/\/ function that calls a function specified by an llvm::cl::opt.\n\/\/\/\n\/\/===----------------------------------------------------------------------===\/\/\n\n#include \"swift\/SIL\/SILBuilder.h\"\n#include \"swift\/SIL\/SILFunction.h\"\n#include \"swift\/SIL\/SILInstruction.h\"\n#include \"swift\/SIL\/SILLocation.h\"\n#include \"swift\/SIL\/SILUndef.h\"\n#include \"swift\/SILOptimizer\/PassManager\/Passes.h\"\n#include \"swift\/SILOptimizer\/PassManager\/Transforms.h\"\n#include \"llvm\/Support\/CommandLine.h\"\n\nusing namespace swift;\n\nstatic llvm::cl::opt<std::string> FunctionTarget(\n \"bug-reducer-tester-target-func\",\n llvm::cl::desc(\"Function that when called by an apply should cause \"\n \"BugReducerTester to blow up or miscompile if the pass \"\n \"visits the apply\"));\n\nnamespace {\nenum class FailureKind {\n OptimizerCrasher,\n RuntimeMiscompile,\n RuntimeCrasher,\n None\n};\n} \/\/ end anonymous namespace\n\nstatic llvm::cl::opt<FailureKind> TargetFailureKind(\n \"bug-reducer-tester-failure-kind\",\n llvm::cl::desc(\"The type of failure to perform\"),\n llvm::cl::values(\n clEnumValN(FailureKind::OptimizerCrasher, \"opt-crasher\",\n \"Crash the optimizer when we see the specified apply\"),\n clEnumValN(FailureKind::RuntimeMiscompile, \"miscompile\",\n \"Delete the target function call to cause a runtime \"\n \"miscompile that is not a crasher\"),\n clEnumValN(FailureKind::RuntimeCrasher, \"runtime-crasher\",\n \"Delete the target function call to cause a runtime \"\n \"miscompile that is not a crasher\"),\n clEnumValEnd),\n llvm::cl::init(FailureKind::None));\n\nnamespace {\n\nclass BugReducerTester : public SILFunctionTransform {\n\n \/\/ We only want to cause 1 miscompile.\n bool CausedError = false;\n StringRef RuntimeCrasherFunctionName = \"bug_reducer_runtime_crasher_func\";\n\n SILFunction *getRuntimeCrasherFunction() {\n assert(TargetFailureKind == FailureKind::RuntimeCrasher);\n llvm::SmallVector<SILResultInfo, 1> ResultInfoArray;\n auto EmptyTupleCanType = getFunction()\n ->getModule()\n .Types.getEmptyTupleType()\n .getSwiftRValueType();\n ResultInfoArray.push_back(\n SILResultInfo(EmptyTupleCanType, ResultConvention::Unowned));\n auto FuncType = SILFunctionType::get(\n nullptr, SILFunctionType::ExtInfo(SILFunctionType::Representation::Thin,\n false \/*isPseudoGeneric*\/),\n ParameterConvention::Direct_Unowned, ArrayRef<SILParameterInfo>(),\n ResultInfoArray, None, getFunction()->getModule().getASTContext());\n\n SILFunction *F = getFunction()->getModule().getOrCreateSharedFunction(\n RegularLocation::getAutoGeneratedLocation(), RuntimeCrasherFunctionName,\n FuncType, IsBare, IsNotTransparent, IsFragile, IsNotThunk);\n if (F->isDefinition())\n return F;\n\n \/\/ Create a new block.\n SILBasicBlock *BB = F->createBasicBlock();\n\n \/\/ Insert a builtin int trap. Then return F.\n SILBuilder B(BB);\n B.createBuiltinTrap(RegularLocation::getAutoGeneratedLocation());\n B.createUnreachable(ArtificialUnreachableLocation());\n return F;\n }\n\n void run() override {\n \/\/ If we don't have a target function or we already caused a miscompile,\n \/\/ just return.\n if (FunctionTarget.empty() || CausedError)\n return;\n assert(TargetFailureKind != FailureKind::None);\n SILModule &M = getFunction()->getModule();\n for (auto &BB : *getFunction()) {\n for (auto &II : BB) {\n auto *Apply = dyn_cast<ApplyInst>(&II);\n if (!Apply)\n continue;\n auto *FRI = dyn_cast<FunctionRefInst>(Apply->getCallee());\n if (!FRI ||\n !FRI->getReferencedFunction()->getName().equals(FunctionTarget))\n continue;\n\n \/\/ Ok, we found the Apply that we want! If we are asked to crash, crash\n \/\/ here.\n if (TargetFailureKind == FailureKind::OptimizerCrasher)\n llvm_unreachable(\"Found the target!\");\n\n \/\/ Otherwise, if we are asked to perform a runtime time miscompile,\n \/\/ delete the apply target.\n if (TargetFailureKind == FailureKind::RuntimeMiscompile) {\n Apply->replaceAllUsesWith(SILUndef::get(Apply->getType(), M));\n Apply->eraseFromParent();\n\n \/\/ Mark that we found the miscompile and return so we do not try to\n \/\/ visit any more instructions in this function.\n CausedError = true;\n return;\n }\n\n assert(TargetFailureKind == FailureKind::RuntimeCrasher);\n \/\/ Finally, if we reach this point we are being asked to replace the\n \/\/ given apply with a new apply that calls the crasher func.\n auto Loc = RegularLocation::getAutoGeneratedLocation();\n SILFunction *RuntimeCrasherFunc = getRuntimeCrasherFunction();\n llvm::dbgs() << \"Runtime Crasher Func!\\n\";\n RuntimeCrasherFunc->dump();\n SILBuilder B(Apply->getIterator());\n B.createApply(Loc, B.createFunctionRef(Loc, RuntimeCrasherFunc),\n RuntimeCrasherFunc->getLoweredType(),\n M.Types.getEmptyTupleType(), ArrayRef<Substitution>(),\n ArrayRef<SILValue>(), false \/*NoThrow*\/);\n\n Apply->replaceAllUsesWith(SILUndef::get(Apply->getType(), M));\n Apply->eraseFromParent();\n\n CausedError = true;\n return;\n }\n }\n }\n\n StringRef getName() override { return \"Bug Reducer Tester\"; }\n};\n\n} \/\/ end anonymous namespace\n\nSILTransform *swift::createBugReducerTester() { return new BugReducerTester(); }\n<commit_msg>Update for clang r283671: remove use of clEnumValEnd.<commit_after>\/\/===--- BugReducerTester.cpp ---------------------------------------------===\/\/\n\/\/\n\/\/ This source file is part of the Swift.org open source project\n\/\/\n\/\/ Copyright (c) 2014 - 2016 Apple Inc. and the Swift project authors\n\/\/ Licensed under Apache License v2.0 with Runtime Library Exception\n\/\/\n\/\/ See https:\/\/swift.org\/LICENSE.txt for license information\n\/\/ See https:\/\/swift.org\/CONTRIBUTORS.txt for the list of Swift project authors\n\/\/\n\/\/===----------------------------------------------------------------------===\/\/\n\/\/\/\n\/\/\/ \\file\n\/\/\/\n\/\/\/ This pass is a testing pass for sil-bug-reducer. It asserts when it visits a\n\/\/\/ function that calls a function specified by an llvm::cl::opt.\n\/\/\/\n\/\/===----------------------------------------------------------------------===\/\/\n\n#include \"swift\/SIL\/SILBuilder.h\"\n#include \"swift\/SIL\/SILFunction.h\"\n#include \"swift\/SIL\/SILInstruction.h\"\n#include \"swift\/SIL\/SILLocation.h\"\n#include \"swift\/SIL\/SILUndef.h\"\n#include \"swift\/SILOptimizer\/PassManager\/Passes.h\"\n#include \"swift\/SILOptimizer\/PassManager\/Transforms.h\"\n#include \"llvm\/Support\/CommandLine.h\"\n\nusing namespace swift;\n\nstatic llvm::cl::opt<std::string> FunctionTarget(\n \"bug-reducer-tester-target-func\",\n llvm::cl::desc(\"Function that when called by an apply should cause \"\n \"BugReducerTester to blow up or miscompile if the pass \"\n \"visits the apply\"));\n\nnamespace {\nenum class FailureKind {\n OptimizerCrasher,\n RuntimeMiscompile,\n RuntimeCrasher,\n None\n};\n} \/\/ end anonymous namespace\n\nstatic llvm::cl::opt<FailureKind> TargetFailureKind(\n \"bug-reducer-tester-failure-kind\",\n llvm::cl::desc(\"The type of failure to perform\"),\n llvm::cl::values(\n clEnumValN(FailureKind::OptimizerCrasher, \"opt-crasher\",\n \"Crash the optimizer when we see the specified apply\"),\n clEnumValN(FailureKind::RuntimeMiscompile, \"miscompile\",\n \"Delete the target function call to cause a runtime \"\n \"miscompile that is not a crasher\"),\n clEnumValN(FailureKind::RuntimeCrasher, \"runtime-crasher\",\n \"Delete the target function call to cause a runtime \"\n \"miscompile that is not a crasher\")),\n llvm::cl::init(FailureKind::None));\n\nnamespace {\n\nclass BugReducerTester : public SILFunctionTransform {\n\n \/\/ We only want to cause 1 miscompile.\n bool CausedError = false;\n StringRef RuntimeCrasherFunctionName = \"bug_reducer_runtime_crasher_func\";\n\n SILFunction *getRuntimeCrasherFunction() {\n assert(TargetFailureKind == FailureKind::RuntimeCrasher);\n llvm::SmallVector<SILResultInfo, 1> ResultInfoArray;\n auto EmptyTupleCanType = getFunction()\n ->getModule()\n .Types.getEmptyTupleType()\n .getSwiftRValueType();\n ResultInfoArray.push_back(\n SILResultInfo(EmptyTupleCanType, ResultConvention::Unowned));\n auto FuncType = SILFunctionType::get(\n nullptr, SILFunctionType::ExtInfo(SILFunctionType::Representation::Thin,\n false \/*isPseudoGeneric*\/),\n ParameterConvention::Direct_Unowned, ArrayRef<SILParameterInfo>(),\n ResultInfoArray, None, getFunction()->getModule().getASTContext());\n\n SILFunction *F = getFunction()->getModule().getOrCreateSharedFunction(\n RegularLocation::getAutoGeneratedLocation(), RuntimeCrasherFunctionName,\n FuncType, IsBare, IsNotTransparent, IsFragile, IsNotThunk);\n if (F->isDefinition())\n return F;\n\n \/\/ Create a new block.\n SILBasicBlock *BB = F->createBasicBlock();\n\n \/\/ Insert a builtin int trap. Then return F.\n SILBuilder B(BB);\n B.createBuiltinTrap(RegularLocation::getAutoGeneratedLocation());\n B.createUnreachable(ArtificialUnreachableLocation());\n return F;\n }\n\n void run() override {\n \/\/ If we don't have a target function or we already caused a miscompile,\n \/\/ just return.\n if (FunctionTarget.empty() || CausedError)\n return;\n assert(TargetFailureKind != FailureKind::None);\n SILModule &M = getFunction()->getModule();\n for (auto &BB : *getFunction()) {\n for (auto &II : BB) {\n auto *Apply = dyn_cast<ApplyInst>(&II);\n if (!Apply)\n continue;\n auto *FRI = dyn_cast<FunctionRefInst>(Apply->getCallee());\n if (!FRI ||\n !FRI->getReferencedFunction()->getName().equals(FunctionTarget))\n continue;\n\n \/\/ Ok, we found the Apply that we want! If we are asked to crash, crash\n \/\/ here.\n if (TargetFailureKind == FailureKind::OptimizerCrasher)\n llvm_unreachable(\"Found the target!\");\n\n \/\/ Otherwise, if we are asked to perform a runtime time miscompile,\n \/\/ delete the apply target.\n if (TargetFailureKind == FailureKind::RuntimeMiscompile) {\n Apply->replaceAllUsesWith(SILUndef::get(Apply->getType(), M));\n Apply->eraseFromParent();\n\n \/\/ Mark that we found the miscompile and return so we do not try to\n \/\/ visit any more instructions in this function.\n CausedError = true;\n return;\n }\n\n assert(TargetFailureKind == FailureKind::RuntimeCrasher);\n \/\/ Finally, if we reach this point we are being asked to replace the\n \/\/ given apply with a new apply that calls the crasher func.\n auto Loc = RegularLocation::getAutoGeneratedLocation();\n SILFunction *RuntimeCrasherFunc = getRuntimeCrasherFunction();\n llvm::dbgs() << \"Runtime Crasher Func!\\n\";\n RuntimeCrasherFunc->dump();\n SILBuilder B(Apply->getIterator());\n B.createApply(Loc, B.createFunctionRef(Loc, RuntimeCrasherFunc),\n RuntimeCrasherFunc->getLoweredType(),\n M.Types.getEmptyTupleType(), ArrayRef<Substitution>(),\n ArrayRef<SILValue>(), false \/*NoThrow*\/);\n\n Apply->replaceAllUsesWith(SILUndef::get(Apply->getType(), M));\n Apply->eraseFromParent();\n\n CausedError = true;\n return;\n }\n }\n }\n\n StringRef getName() override { return \"Bug Reducer Tester\"; }\n};\n\n} \/\/ end anonymous namespace\n\nSILTransform *swift::createBugReducerTester() { return new BugReducerTester(); }\n<|endoftext|>"} {"text":"<commit_before><commit_msg>option to disable grpc over http<commit_after><|endoftext|>"} {"text":"<commit_before><commit_msg>SSLConfig struct CertAndStatus is not initializing all its members.<commit_after><|endoftext|>"} {"text":"<commit_before>\/*\n* Vulkan framebuffer class\n*\n* Copyright (C) 2016 by Sascha Willems - www.saschawillems.de\n*\n* This code is licensed under the MIT license (MIT) (http:\/\/opensource.org\/licenses\/MIT)\n*\/\n\n#pragma once\n\n#include <algorithm>\n#include <iterator>\n#include <vector>\n#include \"vulkan\/vulkan.h\"\n#include \"vulkandevice.hpp\"\n#include \"vulkantools.h\"\n\nnamespace vk\n{\n\t\/**\n\t* @brief Encapsulates a single frame buffer attachment \n\t*\/\n\tstruct FramebufferAttachment\n\t{\n\t\tVkImage image;\n\t\tVkDeviceMemory memory;\n\t\tVkImageView view;\n\t\tVkFormat format;\n\t\tVkImageSubresourceRange subresourceRange;\n\t\tVkAttachmentDescription description;\n\t\tVkImageLayout initialLayout;\n\n\t\t\/**\n\t\t* @brief Returns true if the attachment has a depth component\n\t\t*\/\n\t\tbool hasDepth()\n\t\t{\n\t\t\tstd::vector<VkFormat> formats = \n\t\t\t{\n\t\t\t\tVK_FORMAT_D16_UNORM,\n\t\t\t\tVK_FORMAT_X8_D24_UNORM_PACK32,\n\t\t\t\tVK_FORMAT_D32_SFLOAT,\n\t\t\t\tVK_FORMAT_D16_UNORM_S8_UINT,\n\t\t\t\tVK_FORMAT_D24_UNORM_S8_UINT,\n\t\t\t\tVK_FORMAT_D32_SFLOAT_S8_UINT,\n\t\t\t};\n\t\t\treturn std::find(formats.begin(), formats.end(), format) != std::end(formats);\n\t\t}\n\n\t\t\/**\n\t\t* @brief Returns true if the attachment has a stencil component\n\t\t*\/\n\t\tbool hasStencil()\n\t\t{\n\t\t\tstd::vector<VkFormat> formats = \n\t\t\t{\n\t\t\t\tVK_FORMAT_S8_UINT,\n\t\t\t\tVK_FORMAT_D16_UNORM_S8_UINT,\n\t\t\t\tVK_FORMAT_D24_UNORM_S8_UINT,\n\t\t\t\tVK_FORMAT_D32_SFLOAT_S8_UINT,\n\t\t\t};\n\t\t\treturn std::find(formats.begin(), formats.end(), format) != std::end(formats);\n\t\t}\n\n\t\t\/**\n\t\t* @brief Returns true if the attachment is a depth and\/or stencil attachment\n\t\t*\/\n\t\tbool isDepthStencil()\n\t\t{\n\t\t\treturn(hasDepth() || hasStencil());\n\t\t}\n\n\t};\n\n\t\/**\n\t* @brief Describes the attributes of an attachment to be created\n\t*\/\n\tstruct AttachmentCreateInfo\n\t{\n\t\tuint32_t width, height;\n\t\tuint32_t layerCount;\n\t\tVkFormat format;\n\t\tVkImageUsageFlags usage;\n\t};\n\n\t\/**\n\t* @brief Encaspulates a complete Vulkan framebuffer with an arbitrary number and combination of attachments\n\t*\/\n\tstruct Framebuffer\n\t{\n\tprivate:\n\t\tvk::VulkanDevice *vulkanDevice;\n\tpublic:\n\t\tuint32_t width, height;\n\t\tVkFramebuffer framebuffer;\n\t\tVkRenderPass renderPass;\n\t\tVkSampler sampler;\n\t\tstd::vector<vk::FramebufferAttachment> attachments;\n\n\t\t\/**\n\t\t* Default constructor\n\t\t*\n\t\t* @param vulkanDevice Pointer to a valid VulkanDevice\n\t\t*\/\n\t\tFramebuffer(vk::VulkanDevice *vulkanDevice)\n\t\t{\n\t\t\tassert(vulkanDevice);\n\t\t\tthis->vulkanDevice = vulkanDevice;\n\t\t}\n\n\t\t\/**\n\t\t* Destroy and free Vulkan resources used for the framebuffer and all of it's attachments\n\t\t*\/\n\t\t~Framebuffer()\n\t\t{\n\t\t\tassert(vulkanDevice);\n\t\t\tfor (auto attachment : attachments)\n\t\t\t{\n\t\t\t\tvkDestroyImage(vulkanDevice->device, attachment.image, nullptr);\n\t\t\t\tvkDestroyImageView(vulkanDevice->device, attachment.view, nullptr);\n\t\t\t\tvkFreeMemory(vulkanDevice->device, attachment.memory, nullptr);\n\t\t\t}\n\t\t\tvkDestroySampler(vulkanDevice->device, sampler, nullptr);\n\t\t\tvkDestroyRenderPass(vulkanDevice->device, renderPass, nullptr);\n\t\t\tvkDestroyFramebuffer(vulkanDevice->device, framebuffer, nullptr);\n\t\t}\n\n\t\t\/**\n\t\t* Add a new attachment described by createinfo to the framebuffer's attachment list\n\t\t*\n\t\t* @param createinfo Structure that specifices the framebuffer to be constructed\n\t\t* @param layoutCmd A valid and active command buffer used for the initial layout transitions\n\t\t*\n\t\t* @return Index of the new attachment\n\t\t*\/\n\t\tuint32_t addAttachment(vk::AttachmentCreateInfo createinfo, VkCommandBuffer layoutCmd)\n\t\t{\n\t\t\tvk::FramebufferAttachment attachment;\n\n\t\t\tattachment.format = createinfo.format;\n\n\t\t\tVkImageAspectFlags aspectMask = VK_FLAGS_NONE;\n\t\t\tVkImageLayout imageLayout;\n\n\t\t\t\/\/ Select aspect mask and layout depending on usage\n\n\t\t\t\/\/ Color attachment\n\t\t\tif (createinfo.usage & VK_IMAGE_USAGE_COLOR_ATTACHMENT_BIT)\n\t\t\t{\n\t\t\t\taspectMask = VK_IMAGE_ASPECT_COLOR_BIT;\n\t\t\t\tattachment.initialLayout = VK_IMAGE_LAYOUT_COLOR_ATTACHMENT_OPTIMAL;\n\t\t\t\timageLayout = (createinfo.usage & VK_IMAGE_USAGE_SAMPLED_BIT) ? VK_IMAGE_LAYOUT_SHADER_READ_ONLY_OPTIMAL : VK_IMAGE_LAYOUT_COLOR_ATTACHMENT_OPTIMAL;\n\t\t\t}\n\n\t\t\t\/\/ Depth (and\/or stencil) attachment\n\t\t\tif (createinfo.usage & VK_IMAGE_USAGE_DEPTH_STENCIL_ATTACHMENT_BIT)\n\t\t\t{\n\t\t\t\tif (attachment.hasDepth())\n\t\t\t\t{\n\t\t\t\t\taspectMask = VK_IMAGE_ASPECT_DEPTH_BIT;\n\t\t\t\t}\n\t\t\t\tif (attachment.hasStencil())\n\t\t\t\t{\n\t\t\t\t\taspectMask = aspectMask | VK_IMAGE_ASPECT_STENCIL_BIT;\n\t\t\t\t}\n\t\t\t\tattachment.initialLayout = VK_IMAGE_LAYOUT_DEPTH_STENCIL_ATTACHMENT_OPTIMAL;\n\t\t\t\timageLayout = (createinfo.usage & VK_IMAGE_USAGE_SAMPLED_BIT) ? VK_IMAGE_LAYOUT_SHADER_READ_ONLY_OPTIMAL : VK_IMAGE_LAYOUT_DEPTH_STENCIL_ATTACHMENT_OPTIMAL;\n\t\t\t}\n\n\t\t\tassert(aspectMask > 0);\n\n\t\t\tVkImageCreateInfo image = vkTools::initializers::imageCreateInfo();\n\t\t\timage.imageType = VK_IMAGE_TYPE_2D;\n\t\t\timage.format = createinfo.format;\n\t\t\timage.extent.width = createinfo.width;\n\t\t\timage.extent.height = createinfo.height;\n\t\t\timage.extent.depth = 1;\n\t\t\timage.mipLevels = 1;\n\t\t\timage.arrayLayers = createinfo.layerCount;\n\t\t\timage.samples = VK_SAMPLE_COUNT_1_BIT;\n\t\t\timage.tiling = VK_IMAGE_TILING_OPTIMAL;\n\t\t\timage.usage = createinfo.usage;\n\n\t\t\tVkMemoryAllocateInfo memAlloc = vkTools::initializers::memoryAllocateInfo();\n\t\t\tVkMemoryRequirements memReqs;\n\n\t\t\t\/\/ Create image for this attachment\n\t\t\tVK_CHECK_RESULT(vkCreateImage(vulkanDevice->device, &image, nullptr, &attachment.image));\n\t\t\tvkGetImageMemoryRequirements(vulkanDevice->device, attachment.image, &memReqs);\n\t\t\tmemAlloc.allocationSize = memReqs.size;\n\t\t\tmemAlloc.memoryTypeIndex = vulkanDevice->getMemoryType(memReqs.memoryTypeBits, VK_MEMORY_PROPERTY_DEVICE_LOCAL_BIT);\n\t\t\tVK_CHECK_RESULT(vkAllocateMemory(vulkanDevice->device, &memAlloc, nullptr, &attachment.memory));\n\t\t\tVK_CHECK_RESULT(vkBindImageMemory(vulkanDevice->device, attachment.image, attachment.memory, 0));\n\n\t\t\tattachment.subresourceRange = {};\n\t\t\tattachment.subresourceRange.aspectMask = aspectMask;\n\t\t\tattachment.subresourceRange.levelCount = 1;\n\t\t\tattachment.subresourceRange.layerCount = createinfo.layerCount;\n\n\t\t\t\/\/ Set the initial layout to shader read instead of attachment \n\t\t\t\/\/ Note that the render loop has to take care of the transition from read to attachment\n\t\t\tvkTools::setImageLayout(\n\t\t\t\tlayoutCmd,\n\t\t\t\tattachment.image,\n\t\t\t\taspectMask,\n\t\t\t\tVK_IMAGE_LAYOUT_UNDEFINED,\n\t\t\t\timageLayout,\n\t\t\t\tattachment.subresourceRange);\n\n\t\t\tVkImageViewCreateInfo imageView = vkTools::initializers::imageViewCreateInfo();\n\t\t\timageView.viewType = (createinfo.layerCount == 1) ? VK_IMAGE_VIEW_TYPE_2D : VK_IMAGE_VIEW_TYPE_2D_ARRAY;\n\t\t\timageView.format = createinfo.format;\n\t\t\timageView.subresourceRange = attachment.subresourceRange;\n\t\t\t\/\/todo: workaround for depth+stencil attachments\n\t\t\timageView.subresourceRange.aspectMask = (attachment.hasDepth()) ? VK_IMAGE_ASPECT_DEPTH_BIT : aspectMask;\n\t\t\timageView.image = attachment.image;\n\t\t\tVK_CHECK_RESULT(vkCreateImageView(vulkanDevice->device, &imageView, nullptr, &attachment.view));\n\n\t\t\t\/\/ Fill attachment description\n\t\t\tattachment.description = {};\n\t\t\tattachment.description.samples = VK_SAMPLE_COUNT_1_BIT;\n\t\t\tattachment.description.loadOp = VK_ATTACHMENT_LOAD_OP_CLEAR;\n\t\t\tattachment.description.storeOp = (createinfo.usage & VK_IMAGE_USAGE_SAMPLED_BIT) ? VK_ATTACHMENT_STORE_OP_STORE : VK_ATTACHMENT_STORE_OP_DONT_CARE;\n\t\t\tattachment.description.stencilLoadOp = VK_ATTACHMENT_LOAD_OP_DONT_CARE;\n\t\t\tattachment.description.stencilStoreOp = VK_ATTACHMENT_STORE_OP_DONT_CARE;\n\t\t\tattachment.description.format = createinfo.format;\n\t\t\tif (attachment.hasDepth() || attachment.hasStencil())\n\t\t\t{\n\t\t\t\tattachment.description.initialLayout = VK_IMAGE_LAYOUT_DEPTH_STENCIL_ATTACHMENT_OPTIMAL;\n\t\t\t\tattachment.description.finalLayout = VK_IMAGE_LAYOUT_DEPTH_STENCIL_ATTACHMENT_OPTIMAL;\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\tattachment.description.initialLayout = VK_IMAGE_LAYOUT_COLOR_ATTACHMENT_OPTIMAL;\n\t\t\t\tattachment.description.finalLayout = VK_IMAGE_LAYOUT_COLOR_ATTACHMENT_OPTIMAL;\n\t\t\t}\n\n\t\t\tattachments.push_back(attachment);\n\n\t\t\treturn static_cast<uint32_t>(attachments.size() - 1);\n\t\t}\n\n\t\t\/**\n\t\t* Creates a default sampler for sampling from any of the framebuffer attachments\n\t\t* Applications are free to create their own samplers for different use cases \n\t\t*\n\t\t* @param magFilter Magnification filter for lookups\n\t\t* @param minFilter Minification filter for lookups\n\t\t* @param adressMode Adressing mode for the U,V and W coordinates\n\t\t*\n\t\t* @return VkResult for the sampler creation\n\t\t*\/\n\t\tVkResult createSampler(VkFilter magFilter, VkFilter minFilter, VkSamplerAddressMode adressMode)\n\t\t{\n\t\t\tVkSamplerCreateInfo samplerInfo = vkTools::initializers::samplerCreateInfo();\n\t\t\tsamplerInfo.magFilter = magFilter;\n\t\t\tsamplerInfo.minFilter = minFilter;\n\t\t\tsamplerInfo.mipmapMode = VK_SAMPLER_MIPMAP_MODE_LINEAR;\n\t\t\tsamplerInfo.addressModeU = adressMode;\n\t\t\tsamplerInfo.addressModeV = adressMode;\n\t\t\tsamplerInfo.addressModeW = adressMode;\n\t\t\tsamplerInfo.mipLodBias = 0.0f;\n\t\t\tsamplerInfo.maxAnisotropy = 0;\n\t\t\tsamplerInfo.minLod = 0.0f;\n\t\t\tsamplerInfo.maxLod = 1.0f;\n\t\t\tsamplerInfo.borderColor = VK_BORDER_COLOR_FLOAT_OPAQUE_WHITE;\n\t\t\treturn vkCreateSampler(vulkanDevice->device, &samplerInfo, nullptr, &sampler);\n\t\t}\n\n\t\t\/**\n\t\t* Creates a default render pass setup with one sub pass\n\t\t*\n\t\t* @return VK_SUCCESS if all resources have been created successfully\n\t\t*\/\n\t\tVkResult createRenderPass()\n\t\t{\n\t\t\tstd::vector<VkAttachmentDescription> attachmentDescriptions;\n\t\t\tfor (auto& attachment : attachments)\n\t\t\t{\n\t\t\t\tattachmentDescriptions.push_back(attachment.description);\n\t\t\t};\n\n\t\t\t\/\/ Collect attachment references\n\t\t\tstd::vector<VkAttachmentReference> colorReferences;\n\t\t\tVkAttachmentReference depthReference = {};\n\t\t\tbool hasDepth = false; \n\t\t\tbool hasColor = false;\n\n\t\t\tuint32_t attachmentIndex = 0;\n\n\t\t\tfor (auto& attachment : attachments)\n\t\t\t{\n\t\t\t\tif (attachment.isDepthStencil())\n\t\t\t\t{\n\t\t\t\t\t\/\/ Only one depth attachment allowed\n\t\t\t\t\tassert(!hasDepth);\n\t\t\t\t\tdepthReference.attachment = attachmentIndex;\n\t\t\t\t\tdepthReference.layout = VK_IMAGE_LAYOUT_DEPTH_STENCIL_ATTACHMENT_OPTIMAL;\n\t\t\t\t\thasDepth = true;\n\t\t\t\t}\n\t\t\t\telse\n\t\t\t\t{\n\t\t\t\t\tcolorReferences.push_back({ attachmentIndex, VK_IMAGE_LAYOUT_COLOR_ATTACHMENT_OPTIMAL });\n\t\t\t\t\thasColor = true;\n\t\t\t\t}\n\t\t\t\tattachmentIndex++;\n\t\t\t};\n\n\t\t\t\/\/ Default render pass setup uses only one subpass\n\t\t\tVkSubpassDescription subpass = {};\n\t\t\tsubpass.pipelineBindPoint = VK_PIPELINE_BIND_POINT_GRAPHICS;\n\t\t\tif (hasColor)\n\t\t\t{\n\t\t\t\tsubpass.pColorAttachments = colorReferences.data();\n\t\t\t\tsubpass.colorAttachmentCount = static_cast<uint32_t>(colorReferences.size());\n\t\t\t}\n\t\t\tif (hasDepth)\n\t\t\t{\n\t\t\t\tsubpass.pDepthStencilAttachment = &depthReference;\n\t\t\t}\n\n\t\t\t\/\/ Create render pass\n\t\t\tVkRenderPassCreateInfo renderPassInfo = {};\n\t\t\trenderPassInfo.sType = VK_STRUCTURE_TYPE_RENDER_PASS_CREATE_INFO;\n\t\t\trenderPassInfo.pAttachments = attachmentDescriptions.data();\n\t\t\trenderPassInfo.attachmentCount = static_cast<uint32_t>(attachmentDescriptions.size());\n\t\t\trenderPassInfo.subpassCount = 1;\n\t\t\trenderPassInfo.pSubpasses = &subpass;\n\t\t\tVK_CHECK_RESULT(vkCreateRenderPass(vulkanDevice->device, &renderPassInfo, nullptr, &renderPass));\n\n\t\t\tstd::vector<VkImageView> attachmentViews;\n\t\t\tfor (auto attachment : attachments)\n\t\t\t{\n\t\t\t\tattachmentViews.push_back(attachment.view);\n\t\t\t}\n\n\t\t\tVkFramebufferCreateInfo framebufferInfo = {};\n\t\t\tframebufferInfo.sType = VK_STRUCTURE_TYPE_FRAMEBUFFER_CREATE_INFO;\n\t\t\tframebufferInfo.renderPass = renderPass;\n\t\t\tframebufferInfo.pAttachments = attachmentViews.data();\n\t\t\tframebufferInfo.attachmentCount = static_cast<uint32_t>(attachmentViews.size());\n\t\t\tframebufferInfo.width = width;\n\t\t\tframebufferInfo.height = height;\n\t\t\tframebufferInfo.layers = 1;\n\t\t\tVK_CHECK_RESULT(vkCreateFramebuffer(vulkanDevice->device, &framebufferInfo, nullptr, &framebuffer));\n\n\t\t\treturn VK_SUCCESS;\n\t\t}\n\t};\n}<commit_msg>Set framebuffer layer depending on attachment layer count (Refs #204)<commit_after>\/*\n* Vulkan framebuffer class\n*\n* Copyright (C) 2016 by Sascha Willems - www.saschawillems.de\n*\n* This code is licensed under the MIT license (MIT) (http:\/\/opensource.org\/licenses\/MIT)\n*\/\n\n#pragma once\n\n#include <algorithm>\n#include <iterator>\n#include <vector>\n#include \"vulkan\/vulkan.h\"\n#include \"vulkandevice.hpp\"\n#include \"vulkantools.h\"\n\nnamespace vk\n{\n\t\/**\n\t* @brief Encapsulates a single frame buffer attachment \n\t*\/\n\tstruct FramebufferAttachment\n\t{\n\t\tVkImage image;\n\t\tVkDeviceMemory memory;\n\t\tVkImageView view;\n\t\tVkFormat format;\n\t\tVkImageSubresourceRange subresourceRange;\n\t\tVkAttachmentDescription description;\n\t\tVkImageLayout initialLayout;\n\n\t\t\/**\n\t\t* @brief Returns true if the attachment has a depth component\n\t\t*\/\n\t\tbool hasDepth()\n\t\t{\n\t\t\tstd::vector<VkFormat> formats = \n\t\t\t{\n\t\t\t\tVK_FORMAT_D16_UNORM,\n\t\t\t\tVK_FORMAT_X8_D24_UNORM_PACK32,\n\t\t\t\tVK_FORMAT_D32_SFLOAT,\n\t\t\t\tVK_FORMAT_D16_UNORM_S8_UINT,\n\t\t\t\tVK_FORMAT_D24_UNORM_S8_UINT,\n\t\t\t\tVK_FORMAT_D32_SFLOAT_S8_UINT,\n\t\t\t};\n\t\t\treturn std::find(formats.begin(), formats.end(), format) != std::end(formats);\n\t\t}\n\n\t\t\/**\n\t\t* @brief Returns true if the attachment has a stencil component\n\t\t*\/\n\t\tbool hasStencil()\n\t\t{\n\t\t\tstd::vector<VkFormat> formats = \n\t\t\t{\n\t\t\t\tVK_FORMAT_S8_UINT,\n\t\t\t\tVK_FORMAT_D16_UNORM_S8_UINT,\n\t\t\t\tVK_FORMAT_D24_UNORM_S8_UINT,\n\t\t\t\tVK_FORMAT_D32_SFLOAT_S8_UINT,\n\t\t\t};\n\t\t\treturn std::find(formats.begin(), formats.end(), format) != std::end(formats);\n\t\t}\n\n\t\t\/**\n\t\t* @brief Returns true if the attachment is a depth and\/or stencil attachment\n\t\t*\/\n\t\tbool isDepthStencil()\n\t\t{\n\t\t\treturn(hasDepth() || hasStencil());\n\t\t}\n\n\t};\n\n\t\/**\n\t* @brief Describes the attributes of an attachment to be created\n\t*\/\n\tstruct AttachmentCreateInfo\n\t{\n\t\tuint32_t width, height;\n\t\tuint32_t layerCount;\n\t\tVkFormat format;\n\t\tVkImageUsageFlags usage;\n\t};\n\n\t\/**\n\t* @brief Encaspulates a complete Vulkan framebuffer with an arbitrary number and combination of attachments\n\t*\/\n\tstruct Framebuffer\n\t{\n\tprivate:\n\t\tvk::VulkanDevice *vulkanDevice;\n\tpublic:\n\t\tuint32_t width, height;\n\t\tVkFramebuffer framebuffer;\n\t\tVkRenderPass renderPass;\n\t\tVkSampler sampler;\n\t\tstd::vector<vk::FramebufferAttachment> attachments;\n\n\t\t\/**\n\t\t* Default constructor\n\t\t*\n\t\t* @param vulkanDevice Pointer to a valid VulkanDevice\n\t\t*\/\n\t\tFramebuffer(vk::VulkanDevice *vulkanDevice)\n\t\t{\n\t\t\tassert(vulkanDevice);\n\t\t\tthis->vulkanDevice = vulkanDevice;\n\t\t}\n\n\t\t\/**\n\t\t* Destroy and free Vulkan resources used for the framebuffer and all of it's attachments\n\t\t*\/\n\t\t~Framebuffer()\n\t\t{\n\t\t\tassert(vulkanDevice);\n\t\t\tfor (auto attachment : attachments)\n\t\t\t{\n\t\t\t\tvkDestroyImage(vulkanDevice->device, attachment.image, nullptr);\n\t\t\t\tvkDestroyImageView(vulkanDevice->device, attachment.view, nullptr);\n\t\t\t\tvkFreeMemory(vulkanDevice->device, attachment.memory, nullptr);\n\t\t\t}\n\t\t\tvkDestroySampler(vulkanDevice->device, sampler, nullptr);\n\t\t\tvkDestroyRenderPass(vulkanDevice->device, renderPass, nullptr);\n\t\t\tvkDestroyFramebuffer(vulkanDevice->device, framebuffer, nullptr);\n\t\t}\n\n\t\t\/**\n\t\t* Add a new attachment described by createinfo to the framebuffer's attachment list\n\t\t*\n\t\t* @param createinfo Structure that specifices the framebuffer to be constructed\n\t\t* @param layoutCmd A valid and active command buffer used for the initial layout transitions\n\t\t*\n\t\t* @return Index of the new attachment\n\t\t*\/\n\t\tuint32_t addAttachment(vk::AttachmentCreateInfo createinfo, VkCommandBuffer layoutCmd)\n\t\t{\n\t\t\tvk::FramebufferAttachment attachment;\n\n\t\t\tattachment.format = createinfo.format;\n\n\t\t\tVkImageAspectFlags aspectMask = VK_FLAGS_NONE;\n\t\t\tVkImageLayout imageLayout;\n\n\t\t\t\/\/ Select aspect mask and layout depending on usage\n\n\t\t\t\/\/ Color attachment\n\t\t\tif (createinfo.usage & VK_IMAGE_USAGE_COLOR_ATTACHMENT_BIT)\n\t\t\t{\n\t\t\t\taspectMask = VK_IMAGE_ASPECT_COLOR_BIT;\n\t\t\t\tattachment.initialLayout = VK_IMAGE_LAYOUT_COLOR_ATTACHMENT_OPTIMAL;\n\t\t\t\timageLayout = (createinfo.usage & VK_IMAGE_USAGE_SAMPLED_BIT) ? VK_IMAGE_LAYOUT_SHADER_READ_ONLY_OPTIMAL : VK_IMAGE_LAYOUT_COLOR_ATTACHMENT_OPTIMAL;\n\t\t\t}\n\n\t\t\t\/\/ Depth (and\/or stencil) attachment\n\t\t\tif (createinfo.usage & VK_IMAGE_USAGE_DEPTH_STENCIL_ATTACHMENT_BIT)\n\t\t\t{\n\t\t\t\tif (attachment.hasDepth())\n\t\t\t\t{\n\t\t\t\t\taspectMask = VK_IMAGE_ASPECT_DEPTH_BIT;\n\t\t\t\t}\n\t\t\t\tif (attachment.hasStencil())\n\t\t\t\t{\n\t\t\t\t\taspectMask = aspectMask | VK_IMAGE_ASPECT_STENCIL_BIT;\n\t\t\t\t}\n\t\t\t\tattachment.initialLayout = VK_IMAGE_LAYOUT_DEPTH_STENCIL_ATTACHMENT_OPTIMAL;\n\t\t\t\timageLayout = (createinfo.usage & VK_IMAGE_USAGE_SAMPLED_BIT) ? VK_IMAGE_LAYOUT_SHADER_READ_ONLY_OPTIMAL : VK_IMAGE_LAYOUT_DEPTH_STENCIL_ATTACHMENT_OPTIMAL;\n\t\t\t}\n\n\t\t\tassert(aspectMask > 0);\n\n\t\t\tVkImageCreateInfo image = vkTools::initializers::imageCreateInfo();\n\t\t\timage.imageType = VK_IMAGE_TYPE_2D;\n\t\t\timage.format = createinfo.format;\n\t\t\timage.extent.width = createinfo.width;\n\t\t\timage.extent.height = createinfo.height;\n\t\t\timage.extent.depth = 1;\n\t\t\timage.mipLevels = 1;\n\t\t\timage.arrayLayers = createinfo.layerCount;\n\t\t\timage.samples = VK_SAMPLE_COUNT_1_BIT;\n\t\t\timage.tiling = VK_IMAGE_TILING_OPTIMAL;\n\t\t\timage.usage = createinfo.usage;\n\n\t\t\tVkMemoryAllocateInfo memAlloc = vkTools::initializers::memoryAllocateInfo();\n\t\t\tVkMemoryRequirements memReqs;\n\n\t\t\t\/\/ Create image for this attachment\n\t\t\tVK_CHECK_RESULT(vkCreateImage(vulkanDevice->device, &image, nullptr, &attachment.image));\n\t\t\tvkGetImageMemoryRequirements(vulkanDevice->device, attachment.image, &memReqs);\n\t\t\tmemAlloc.allocationSize = memReqs.size;\n\t\t\tmemAlloc.memoryTypeIndex = vulkanDevice->getMemoryType(memReqs.memoryTypeBits, VK_MEMORY_PROPERTY_DEVICE_LOCAL_BIT);\n\t\t\tVK_CHECK_RESULT(vkAllocateMemory(vulkanDevice->device, &memAlloc, nullptr, &attachment.memory));\n\t\t\tVK_CHECK_RESULT(vkBindImageMemory(vulkanDevice->device, attachment.image, attachment.memory, 0));\n\n\t\t\tattachment.subresourceRange = {};\n\t\t\tattachment.subresourceRange.aspectMask = aspectMask;\n\t\t\tattachment.subresourceRange.levelCount = 1;\n\t\t\tattachment.subresourceRange.layerCount = createinfo.layerCount;\n\n\t\t\t\/\/ Set the initial layout to shader read instead of attachment \n\t\t\t\/\/ Note that the render loop has to take care of the transition from read to attachment\n\t\t\tvkTools::setImageLayout(\n\t\t\t\tlayoutCmd,\n\t\t\t\tattachment.image,\n\t\t\t\taspectMask,\n\t\t\t\tVK_IMAGE_LAYOUT_UNDEFINED,\n\t\t\t\timageLayout,\n\t\t\t\tattachment.subresourceRange);\n\n\t\t\tVkImageViewCreateInfo imageView = vkTools::initializers::imageViewCreateInfo();\n\t\t\timageView.viewType = (createinfo.layerCount == 1) ? VK_IMAGE_VIEW_TYPE_2D : VK_IMAGE_VIEW_TYPE_2D_ARRAY;\n\t\t\timageView.format = createinfo.format;\n\t\t\timageView.subresourceRange = attachment.subresourceRange;\n\t\t\t\/\/todo: workaround for depth+stencil attachments\n\t\t\timageView.subresourceRange.aspectMask = (attachment.hasDepth()) ? VK_IMAGE_ASPECT_DEPTH_BIT : aspectMask;\n\t\t\timageView.image = attachment.image;\n\t\t\tVK_CHECK_RESULT(vkCreateImageView(vulkanDevice->device, &imageView, nullptr, &attachment.view));\n\n\t\t\t\/\/ Fill attachment description\n\t\t\tattachment.description = {};\n\t\t\tattachment.description.samples = VK_SAMPLE_COUNT_1_BIT;\n\t\t\tattachment.description.loadOp = VK_ATTACHMENT_LOAD_OP_CLEAR;\n\t\t\tattachment.description.storeOp = (createinfo.usage & VK_IMAGE_USAGE_SAMPLED_BIT) ? VK_ATTACHMENT_STORE_OP_STORE : VK_ATTACHMENT_STORE_OP_DONT_CARE;\n\t\t\tattachment.description.stencilLoadOp = VK_ATTACHMENT_LOAD_OP_DONT_CARE;\n\t\t\tattachment.description.stencilStoreOp = VK_ATTACHMENT_STORE_OP_DONT_CARE;\n\t\t\tattachment.description.format = createinfo.format;\n\t\t\tif (attachment.hasDepth() || attachment.hasStencil())\n\t\t\t{\n\t\t\t\tattachment.description.initialLayout = VK_IMAGE_LAYOUT_DEPTH_STENCIL_ATTACHMENT_OPTIMAL;\n\t\t\t\tattachment.description.finalLayout = VK_IMAGE_LAYOUT_DEPTH_STENCIL_ATTACHMENT_OPTIMAL;\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\tattachment.description.initialLayout = VK_IMAGE_LAYOUT_COLOR_ATTACHMENT_OPTIMAL;\n\t\t\t\tattachment.description.finalLayout = VK_IMAGE_LAYOUT_COLOR_ATTACHMENT_OPTIMAL;\n\t\t\t}\n\n\t\t\tattachments.push_back(attachment);\n\n\t\t\treturn static_cast<uint32_t>(attachments.size() - 1);\n\t\t}\n\n\t\t\/**\n\t\t* Creates a default sampler for sampling from any of the framebuffer attachments\n\t\t* Applications are free to create their own samplers for different use cases \n\t\t*\n\t\t* @param magFilter Magnification filter for lookups\n\t\t* @param minFilter Minification filter for lookups\n\t\t* @param adressMode Adressing mode for the U,V and W coordinates\n\t\t*\n\t\t* @return VkResult for the sampler creation\n\t\t*\/\n\t\tVkResult createSampler(VkFilter magFilter, VkFilter minFilter, VkSamplerAddressMode adressMode)\n\t\t{\n\t\t\tVkSamplerCreateInfo samplerInfo = vkTools::initializers::samplerCreateInfo();\n\t\t\tsamplerInfo.magFilter = magFilter;\n\t\t\tsamplerInfo.minFilter = minFilter;\n\t\t\tsamplerInfo.mipmapMode = VK_SAMPLER_MIPMAP_MODE_LINEAR;\n\t\t\tsamplerInfo.addressModeU = adressMode;\n\t\t\tsamplerInfo.addressModeV = adressMode;\n\t\t\tsamplerInfo.addressModeW = adressMode;\n\t\t\tsamplerInfo.mipLodBias = 0.0f;\n\t\t\tsamplerInfo.maxAnisotropy = 0;\n\t\t\tsamplerInfo.minLod = 0.0f;\n\t\t\tsamplerInfo.maxLod = 1.0f;\n\t\t\tsamplerInfo.borderColor = VK_BORDER_COLOR_FLOAT_OPAQUE_WHITE;\n\t\t\treturn vkCreateSampler(vulkanDevice->device, &samplerInfo, nullptr, &sampler);\n\t\t}\n\n\t\t\/**\n\t\t* Creates a default render pass setup with one sub pass\n\t\t*\n\t\t* @return VK_SUCCESS if all resources have been created successfully\n\t\t*\/\n\t\tVkResult createRenderPass()\n\t\t{\n\t\t\tstd::vector<VkAttachmentDescription> attachmentDescriptions;\n\t\t\tfor (auto& attachment : attachments)\n\t\t\t{\n\t\t\t\tattachmentDescriptions.push_back(attachment.description);\n\t\t\t};\n\n\t\t\t\/\/ Collect attachment references\n\t\t\tstd::vector<VkAttachmentReference> colorReferences;\n\t\t\tVkAttachmentReference depthReference = {};\n\t\t\tbool hasDepth = false; \n\t\t\tbool hasColor = false;\n\n\t\t\tuint32_t attachmentIndex = 0;\n\n\t\t\tfor (auto& attachment : attachments)\n\t\t\t{\n\t\t\t\tif (attachment.isDepthStencil())\n\t\t\t\t{\n\t\t\t\t\t\/\/ Only one depth attachment allowed\n\t\t\t\t\tassert(!hasDepth);\n\t\t\t\t\tdepthReference.attachment = attachmentIndex;\n\t\t\t\t\tdepthReference.layout = VK_IMAGE_LAYOUT_DEPTH_STENCIL_ATTACHMENT_OPTIMAL;\n\t\t\t\t\thasDepth = true;\n\t\t\t\t}\n\t\t\t\telse\n\t\t\t\t{\n\t\t\t\t\tcolorReferences.push_back({ attachmentIndex, VK_IMAGE_LAYOUT_COLOR_ATTACHMENT_OPTIMAL });\n\t\t\t\t\thasColor = true;\n\t\t\t\t}\n\t\t\t\tattachmentIndex++;\n\t\t\t};\n\n\t\t\t\/\/ Default render pass setup uses only one subpass\n\t\t\tVkSubpassDescription subpass = {};\n\t\t\tsubpass.pipelineBindPoint = VK_PIPELINE_BIND_POINT_GRAPHICS;\n\t\t\tif (hasColor)\n\t\t\t{\n\t\t\t\tsubpass.pColorAttachments = colorReferences.data();\n\t\t\t\tsubpass.colorAttachmentCount = static_cast<uint32_t>(colorReferences.size());\n\t\t\t}\n\t\t\tif (hasDepth)\n\t\t\t{\n\t\t\t\tsubpass.pDepthStencilAttachment = &depthReference;\n\t\t\t}\n\n\t\t\t\/\/ Create render pass\n\t\t\tVkRenderPassCreateInfo renderPassInfo = {};\n\t\t\trenderPassInfo.sType = VK_STRUCTURE_TYPE_RENDER_PASS_CREATE_INFO;\n\t\t\trenderPassInfo.pAttachments = attachmentDescriptions.data();\n\t\t\trenderPassInfo.attachmentCount = static_cast<uint32_t>(attachmentDescriptions.size());\n\t\t\trenderPassInfo.subpassCount = 1;\n\t\t\trenderPassInfo.pSubpasses = &subpass;\n\t\t\tVK_CHECK_RESULT(vkCreateRenderPass(vulkanDevice->device, &renderPassInfo, nullptr, &renderPass));\n\n\t\t\tstd::vector<VkImageView> attachmentViews;\n\t\t\tfor (auto attachment : attachments)\n\t\t\t{\n\t\t\t\tattachmentViews.push_back(attachment.view);\n\t\t\t}\n\n\t\t\t\/\/ Find. max number of layers across attachments\n\t\t\tuint32_t maxLayers = 0;\n\t\t\tfor (auto attachment : attachments)\n\t\t\t{\n\t\t\t\tif (attachment.subresourceRange.layerCount > maxLayers)\n\t\t\t\t{\n\t\t\t\t\tmaxLayers = attachment.subresourceRange.layerCount;\n\t\t\t\t}\n\t\t\t}\n\n\t\t\tVkFramebufferCreateInfo framebufferInfo = {};\n\t\t\tframebufferInfo.sType = VK_STRUCTURE_TYPE_FRAMEBUFFER_CREATE_INFO;\n\t\t\tframebufferInfo.renderPass = renderPass;\n\t\t\tframebufferInfo.pAttachments = attachmentViews.data();\n\t\t\tframebufferInfo.attachmentCount = static_cast<uint32_t>(attachmentViews.size());\n\t\t\tframebufferInfo.width = width;\n\t\t\tframebufferInfo.height = height;\n\t\t\tframebufferInfo.layers = maxLayers;\n\t\t\tVK_CHECK_RESULT(vkCreateFramebuffer(vulkanDevice->device, &framebufferInfo, nullptr, &framebuffer));\n\n\t\t\treturn VK_SUCCESS;\n\t\t}\n\t};\n}<|endoftext|>"} {"text":"<commit_before>#include \"mf_movie_player.h\"\n#include \"halley\/resources\/resource_data.h\"\n#include \"halley\/core\/api\/audio_api.h\"\n#include \"halley\/core\/api\/video_api.h\"\n#include \"resource_data_byte_stream.h\"\n#include \"halley\/core\/graphics\/texture_descriptor.h\"\n#include \"halley\/concurrency\/concurrent.h\"\n#include \"halley\/core\/resources\/resources.h\"\n\nusing namespace Halley;\n\n\/*\n#include <D3D9.h>\n#pragma comment(lib, \"Mfuuid.lib\")\n#pragma comment(lib, \"Mf.lib\")\n#pragma comment(lib, \"strmiids.lib\")\n*\/\n\nMFMoviePlayer::MFMoviePlayer(VideoAPI& video, AudioAPI& audio, std::shared_ptr<ResourceDataStream> data)\n\t: MoviePlayer(video, audio)\n\t, data(std::move(data))\n{\n\tinit();\n}\n\nMFMoviePlayer::~MFMoviePlayer() noexcept\n{\n\treset();\n\tdeInit();\n}\n\nvoid MFMoviePlayer::init()\n{\n\tinputByteStream = new ResourceDataByteStream(data);\n\tinputByteStream->AddRef();\n\n\tIMFAttributes* attributes = nullptr;\n\tHRESULT hr = MFCreateAttributes(&attributes, 1);\n\tif (!SUCCEEDED(hr)) {\n\t\tthrow Exception(\"Unable to create attributes\", HalleyExceptions::MoviePlugin);\n\t}\n\n\t\/*\n\tconstexpr bool useAsync = false;\n\tif (useAsync) {\n\t\tsampleReceiver = new MoviePlayerSampleReceiver(*this);\n\t\tsampleReceiver->AddRef();\n\t\tattributes->SetUnknown(MF_SOURCE_READER_ASYNC_CALLBACK, sampleReceiver);\n\t}\n\t*\/\n\n\t\/\/ DX11 acceleration\n\tIMFDXGIDeviceManager* deviceManager = nullptr;\n\t\/*\n\tauto dx11Device = static_cast<IUnknown*>(getVideoAPI().getImplementationPointer(\"ID3D11Device\"));\n\tif (dx11Device) {\n\t\tUINT resetToken;\n\t\thr = MFCreateDXGIDeviceManager(&resetToken, &deviceManager);\n\t\tif (!SUCCEEDED(hr)) {\n\t\t\tthrow Exception(\"Unable to create DXGI Device Manager\");\n\t\t}\n\t\thr = deviceManager->ResetDevice(dx11Device, resetToken);\n\t\tif (!SUCCEEDED(hr)) {\n\t\t\tthrow Exception(\"Unable to reset DXGI Device Manager with device\");\n\t\t}\n\t\tattributes->SetUnknown(MF_SOURCE_READER_D3D_MANAGER, deviceManager);\n\t}\n\t*\/\n\n\thr = MFCreateSourceReaderFromByteStream(inputByteStream, attributes, &reader);\n\tif (!SUCCEEDED(hr)) {\n\t\tthrow Exception(\"Unable to create source reader\", HalleyExceptions::MoviePlugin);\n\t}\n\n\t\/\/ Release these temporaries\n\tif (attributes) {\n\t\tattributes->Release();\n\t}\n\tif (deviceManager) {\n\t\tdeviceManager->Release();\n\t}\n\n\treader->SetStreamSelection(MF_SOURCE_READER_ALL_STREAMS, false);\n\treader->SetStreamSelection(MF_SOURCE_READER_FIRST_VIDEO_STREAM, true);\n\treader->SetStreamSelection(MF_SOURCE_READER_FIRST_AUDIO_STREAM, true);\n\n\t\/\/ Setup the right decoding formats\n\tbool hasMoreStreams = true;\n\tfor (int streamIndex = 0; hasMoreStreams; ++streamIndex) {\n\t\tstreams.emplace_back();\n\t\tauto& curStream = streams.back();\n\n\t\tfor (int mediaTypeIndex = 0; ; ++mediaTypeIndex) {\n\t\t\tIMFMediaType *nativeType = nullptr;\n\t\t\thr = reader->GetNativeMediaType(streamIndex, mediaTypeIndex, &nativeType);\n\n\t\t\tif (hr == MF_E_INVALIDSTREAMNUMBER) {\n\t\t\t\thasMoreStreams = false;\n\t\t\t\tbreak;\n\t\t\t} else if (hr == MF_E_NO_MORE_TYPES) {\n\t\t\t\tbreak;\n\t\t\t} else if (SUCCEEDED(hr)) {\n\t\t\t\tGUID majorType;\n\t\t\t\tGUID subType;\n\t\t\t\tIMFMediaType *targetType = nullptr;\n\n\t\t\t\ttry {\n\t\t\t\t\thr = nativeType->GetGUID(MF_MT_MAJOR_TYPE, &majorType);\n\t\t\t\t\tif (!SUCCEEDED(hr)) {\n\t\t\t\t\t\tthrow Exception(\"Unable to read major type\", HalleyExceptions::MoviePlugin);\n\t\t\t\t\t}\n\n\t\t\t\t\tMFCreateMediaType(&targetType);\n\t\t\t\t\thr = targetType->SetGUID(MF_MT_MAJOR_TYPE, majorType);\n\t\t\t\t\tif (!SUCCEEDED(hr)) {\n\t\t\t\t\t\tthrow Exception(\"Unable to write major type\", HalleyExceptions::MoviePlugin);\n\t\t\t\t\t}\n\n\t\t\t\t\tif (majorType == MFMediaType_Video) {\n\t\t\t\t\t\tUINT64 frameSize;\n\t\t\t\t\t\tnativeType->GetUINT64(MF_MT_FRAME_SIZE, &frameSize);\n\t\t\t\t\t\tauto videoSize = Vector2i(int(frameSize >> 32), int(frameSize & 0xFFFFFFFFull));\n\t\t\t\t\t\tUINT64 aspectRatioRaw;\n\t\t\t\t\t\tnativeType->GetUINT64(MF_MT_PIXEL_ASPECT_RATIO, &aspectRatioRaw);\n\t\t\t\t\t\tfloat par = float(aspectRatioRaw >> 32) \/ float(aspectRatioRaw & 0xFFFFFFFFull);\n\n\t\t\t\t\t\tuint32_t stride;\n\t\t\t\t\t\thr = nativeType->GetUINT32(MF_MT_DEFAULT_STRIDE, &stride);\n\t\t\t\t\t\tif (SUCCEEDED(hr)) {\n\t\t\t\t\t\t\tminStride = int(stride);\n\t\t\t\t\t\t} else {\n\t\t\t\t\t\t\tGUID subType = GUID_NULL;\n\t\t\t\t\t\t\thr = nativeType->GetGUID(MF_MT_SUBTYPE, &subType);\n\t\t\t\t\t\t\tif (SUCCEEDED(hr)) {\n\t\t\t\t\t\t\t\tLONG tmp;\n\t\t\t\t\t\t\t\thr = MFGetStrideForBitmapInfoHeader(subType.Data1, videoSize.x, &tmp);\n\t\t\t\t\t\t\t\tif (SUCCEEDED(hr)) {\n\t\t\t\t\t\t\t\t\tminStride = int(tmp);\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\n\t\t\t\t\t\tsetVideoSize(videoSize);\n\t\t\t\t\t\tcurStream.type = MoviePlayerStreamType::Video;\n\t\t\t\t\t\tsubType = MFVideoFormat_NV12; \/\/ NV12 is the only format supported by DX accelerated decoding\n\t\t\t\t\t} else if (majorType == MFMediaType_Audio) {\n\t\t\t\t\t\tUINT32 sampleRate;\n\t\t\t\t\t\tUINT32 numChannels;\n\t\t\t\t\t\tnativeType->GetUINT32(MF_MT_AUDIO_SAMPLES_PER_SECOND, &sampleRate);\n\t\t\t\t\t\tnativeType->GetUINT32(MF_MT_AUDIO_NUM_CHANNELS, &numChannels);\n\n\t\t\t\t\t\tcurStream.type = MoviePlayerStreamType::Audio;\n\t\t\t\t\t\tsubType = MFAudioFormat_PCM;\n\t\t\t\t\t}\n\n\t\t\t\t\thr = targetType->SetGUID(MF_MT_SUBTYPE, subType);\n\t\t\t\t\tif (!SUCCEEDED(hr)) {\n\t\t\t\t\t\tthrow Exception(\"Unable to write subtype\", HalleyExceptions::MoviePlugin);\n\t\t\t\t\t}\n\n\t\t\t\t\thr = reader->SetCurrentMediaType(streamIndex, nullptr, targetType);\n\t\t\t\t\tif (!SUCCEEDED(hr)) {\n\t\t\t\t\t\tthrow Exception(\"Unable to set current media type\", HalleyExceptions::MoviePlugin);\n\t\t\t\t\t}\n\t\t\t\t} catch (...) {\n\t\t\t\t\tif (targetType) {\n\t\t\t\t\t\ttargetType->Release();\n\t\t\t\t\t}\n\t\t\t\t\tnativeType->Release();\n\t\t\t\t\tthrow;\n\t\t\t\t}\n\n\t\t\t\ttargetType->Release();\n\t\t\t\tnativeType->Release();\n\t\t\t} else {\n\t\t\t\tthrow Exception(\"Error reading stream info\", HalleyExceptions::MoviePlugin);\n\t\t\t}\n\t\t}\n\t}\n\n\treset();\n}\n\nvoid MFMoviePlayer::deInit()\n{\n\tif (sampleReceiver) {\n\t\tsampleReceiver->Release();\n\t\tsampleReceiver = nullptr;\n\t}\n\tif (reader) {\n\t\treader->Release();\n\t\treader = nullptr;\n\t}\n\tif (inputByteStream) {\n\t\tinputByteStream->Release();\n\t\tinputByteStream = nullptr;\n\t}\n}\n\nvoid MFMoviePlayer::requestVideoFrame()\n{\n\tconst DWORD controlFlags = 0;\n\tDWORD streamIndex;\n\tDWORD streamFlags;\n\tLONGLONG timestamp;\n\tIMFSample* sample;\n\tauto hr = reader->ReadSample(MF_SOURCE_READER_FIRST_VIDEO_STREAM, controlFlags, &streamIndex, &streamFlags, ×tamp, &sample);\n\tonReadSample(hr, streamIndex, streamFlags, timestamp, sample);\n}\n\nvoid MFMoviePlayer::requestAudioFrame()\n{\n\tconst DWORD controlFlags = 0;\n\tDWORD streamIndex;\n\tDWORD streamFlags;\n\tLONGLONG timestamp;\n\tIMFSample* sample;\n\tauto hr = reader->ReadSample(MF_SOURCE_READER_FIRST_AUDIO_STREAM, controlFlags, &streamIndex, &streamFlags, ×tamp, &sample);\n\tonReadSample(hr, streamIndex, streamFlags, timestamp, sample);\n}\n\nvoid MFMoviePlayer::onReset()\n{\n\tPROPVARIANT pos;\n\tpos.vt = VT_I8;\n\tpos.hVal.QuadPart = 0;\n\treader->SetCurrentPosition(GUID_NULL, pos);\n}\n\nHRESULT MFMoviePlayer::onReadSample(HRESULT hr, DWORD streamIndex, DWORD streamFlags, LONGLONG timestamp, IMFSample* sample)\n{\n\tauto& curStream = streams.at(streamIndex);\n\tif (streamFlags & MF_SOURCE_READERF_ENDOFSTREAM) {\n\t\tcurStream.eof = true;\n\t}\n\n\tif (sample) {\n\t\tTime sampleTime = Time(timestamp) \/ 10000000.0;\n\n\t\tDWORD bufferCount;\n\t\tsample->GetBufferCount(&bufferCount);\n\t\tfor (int i = 0; i < int(bufferCount); ++i) {\n\t\t\tIMFMediaBuffer* buffer;\n\t\t\tsample->GetBufferByIndex(i, &buffer);\n\t\t\tDWORD length;\n\t\t\tbuffer->GetCurrentLength(&length);\n\n\t\t\tif (curStream.type == MoviePlayerStreamType::Video) {\n\t\t\t\t\/*\n\t\t\t\tIDirect3DSurface9 *surface = nullptr;\n\t\t\t\tauto hr = MFGetService(buffer, MR_BUFFER_SERVICE, __uuidof(IDirect3DSurface9), reinterpret_cast<void**>(&surface));\n\t\t\t\tif (SUCCEEDED(hr)) {\n\t\t\t\t\tstd::cout << Release();\n\t\t\t\t}\"Got DX9 surface!\\n\";\n\t\t\t\tsurface->Release();\n\t\t\t\t*\/\n\t\t\t\t\n\t\t\t\tIMF2DBuffer* buffer2d = nullptr;\n\t\t\t\thr = buffer->QueryInterface(__uuidof(IMF2DBuffer), reinterpret_cast<void**>(&buffer2d));\n\t\t\t\tif (SUCCEEDED(hr)) {\n\t\t\t\t\tBYTE* src;\n\t\t\t\t\tLONG pitch;\n\t\t\t\t\tbuffer2d->Lock2D(&src, &pitch);\n\t\t\t\t\treadVideoSample(sampleTime, reinterpret_cast<gsl::byte*>(src), pitch);\n\t\t\t\t\tbuffer2d->Unlock2D();\n\t\t\t\t\tbuffer2d->Release();\n\t\t\t\t} else if (hr == E_NOINTERFACE) {\n\t\t\t\t\tBYTE* src;\n\t\t\t\t\tDWORD maxLen;\n\t\t\t\t\tDWORD curLen;\n\t\t\t\t\tbuffer->Lock(&src, &maxLen, &curLen);\n\t\t\t\t\treadVideoSample(sampleTime, reinterpret_cast<gsl::byte*>(src), minStride);\n\t\t\t\t\tbuffer->Unlock();\n\t\t\t\t\tbuffer->Release();\n\t\t\t\t} else {\n\t\t\t\t\tthrow Exception(\"Error while querying for 2D buffer: \" + toString(hr), HalleyExceptions::MoviePlugin);\n\t\t\t\t}\n\t\t\t}\n\n\t\t\tif (curStream.type == MoviePlayerStreamType::Audio) {\n\t\t\t\tBYTE* data;\n\t\t\t\tDWORD maxLen;\n\t\t\t\tDWORD curLen;\n\t\t\t\tbuffer->Lock(&data, &maxLen, &curLen);\n\t\t\t\treadAudioSample(sampleTime, gsl::as_bytes(gsl::span<const BYTE>(data, curLen)));\n\t\t\t\tbuffer->Unlock();\n\t\t\t}\n\n\t\t\tbuffer->Release();\n\t\t}\n\n\t\tsample->Release();\n\t}\n\n\treturn S_OK;\n}\n\nvoid MFMoviePlayer::readVideoSample(Time time, const gsl::byte* data, int stride)\n{\n\tconst auto videoSize = getSize();\n\tconst int yPlaneHeight = alignUp(videoSize.y, 16);\n\tconst int uvPlaneHeight = alignUp(videoSize.y \/ 2, 16);\n\tconst int width = alignUp(videoSize.x, 16);\n\tconst int height = yPlaneHeight + uvPlaneHeight;\n\n\tauto srcData = gsl::span<const gsl::byte>(data, stride * height);\n\tBytes myData(srcData.size_bytes());\n\tmemcpy(myData.data(), data, myData.size());\n\n\tTextureDescriptor descriptor;\n\tdescriptor.format = TextureFormat::Indexed;\n\tdescriptor.pixelFormat = PixelDataFormat::Image;\n\tdescriptor.size = Vector2i(width, height);\n\tdescriptor.pixelData = TextureDescriptorImageData(std::move(myData), stride);\n\n\tonVideoFrameAvailable(time, std::move(descriptor));\n}\n\nvoid MFMoviePlayer::readAudioSample(Time time, gsl::span<const gsl::byte> data)\n{\n\tauto src = gsl::span<const short>(reinterpret_cast<const short*>(data.data()), data.size() \/ sizeof(short));\n\n\tstd::vector<AudioConfig::SampleFormat> samples(src.size());\n\tfor (int i = 0; i < src.size(); ++i) {\n\t\tsamples[i] = src[i] \/ 32768.0f;\n\t}\n\n\tonAudioFrameAvailable(time, samples);\n}\n<commit_msg>Fix UWP<commit_after>#include \"mf_movie_player.h\"\n#include \"halley\/resources\/resource_data.h\"\n#include \"halley\/core\/api\/audio_api.h\"\n#include \"halley\/core\/api\/video_api.h\"\n#include \"resource_data_byte_stream.h\"\n#include \"halley\/core\/graphics\/texture_descriptor.h\"\n#include \"halley\/concurrency\/concurrent.h\"\n#include \"halley\/core\/resources\/resources.h\"\n\nusing namespace Halley;\n\n\/*\n#include <D3D9.h>\n#pragma comment(lib, \"Mfuuid.lib\")\n#pragma comment(lib, \"Mf.lib\")\n#pragma comment(lib, \"strmiids.lib\")\n*\/\n\nMFMoviePlayer::MFMoviePlayer(VideoAPI& video, AudioAPI& audio, std::shared_ptr<ResourceDataStream> data)\n\t: MoviePlayer(video, audio)\n\t, data(std::move(data))\n{\n\tinit();\n}\n\nMFMoviePlayer::~MFMoviePlayer() noexcept\n{\n\treset();\n\tdeInit();\n}\n\nvoid MFMoviePlayer::init()\n{\n\tinputByteStream = new ResourceDataByteStream(data);\n\tinputByteStream->AddRef();\n\n\tIMFAttributes* attributes = nullptr;\n\tHRESULT hr = MFCreateAttributes(&attributes, 1);\n\tif (!SUCCEEDED(hr)) {\n\t\tthrow Exception(\"Unable to create attributes\", HalleyExceptions::MoviePlugin);\n\t}\n\n\t\/*\n\tconstexpr bool useAsync = false;\n\tif (useAsync) {\n\t\tsampleReceiver = new MoviePlayerSampleReceiver(*this);\n\t\tsampleReceiver->AddRef();\n\t\tattributes->SetUnknown(MF_SOURCE_READER_ASYNC_CALLBACK, sampleReceiver);\n\t}\n\t*\/\n\n\t\/\/ DX11 acceleration\n\tIMFDXGIDeviceManager* deviceManager = nullptr;\n\t\/*\n\tauto dx11Device = static_cast<IUnknown*>(getVideoAPI().getImplementationPointer(\"ID3D11Device\"));\n\tif (dx11Device) {\n\t\tUINT resetToken;\n\t\thr = MFCreateDXGIDeviceManager(&resetToken, &deviceManager);\n\t\tif (!SUCCEEDED(hr)) {\n\t\t\tthrow Exception(\"Unable to create DXGI Device Manager\");\n\t\t}\n\t\thr = deviceManager->ResetDevice(dx11Device, resetToken);\n\t\tif (!SUCCEEDED(hr)) {\n\t\t\tthrow Exception(\"Unable to reset DXGI Device Manager with device\");\n\t\t}\n\t\tattributes->SetUnknown(MF_SOURCE_READER_D3D_MANAGER, deviceManager);\n\t}\n\t*\/\n\n\thr = MFCreateSourceReaderFromByteStream(inputByteStream, attributes, &reader);\n\tif (!SUCCEEDED(hr)) {\n\t\tthrow Exception(\"Unable to create source reader\", HalleyExceptions::MoviePlugin);\n\t}\n\n\t\/\/ Release these temporaries\n\tif (attributes) {\n\t\tattributes->Release();\n\t}\n\tif (deviceManager) {\n\t\tdeviceManager->Release();\n\t}\n\n\treader->SetStreamSelection(MF_SOURCE_READER_ALL_STREAMS, false);\n\treader->SetStreamSelection(MF_SOURCE_READER_FIRST_VIDEO_STREAM, true);\n\treader->SetStreamSelection(MF_SOURCE_READER_FIRST_AUDIO_STREAM, true);\n\n\t\/\/ Setup the right decoding formats\n\tbool hasMoreStreams = true;\n\tfor (int streamIndex = 0; hasMoreStreams; ++streamIndex) {\n\t\tstreams.emplace_back();\n\t\tauto& curStream = streams.back();\n\n\t\tfor (int mediaTypeIndex = 0; ; ++mediaTypeIndex) {\n\t\t\tIMFMediaType *nativeType = nullptr;\n\t\t\thr = reader->GetNativeMediaType(streamIndex, mediaTypeIndex, &nativeType);\n\n\t\t\tif (hr == MF_E_INVALIDSTREAMNUMBER) {\n\t\t\t\thasMoreStreams = false;\n\t\t\t\tbreak;\n\t\t\t} else if (hr == MF_E_NO_MORE_TYPES) {\n\t\t\t\tbreak;\n\t\t\t} else if (SUCCEEDED(hr)) {\n\t\t\t\tGUID majorType;\n\t\t\t\tGUID subType;\n\t\t\t\tIMFMediaType *targetType = nullptr;\n\n\t\t\t\ttry {\n\t\t\t\t\thr = nativeType->GetGUID(MF_MT_MAJOR_TYPE, &majorType);\n\t\t\t\t\tif (!SUCCEEDED(hr)) {\n\t\t\t\t\t\tthrow Exception(\"Unable to read major type\", HalleyExceptions::MoviePlugin);\n\t\t\t\t\t}\n\n\t\t\t\t\tMFCreateMediaType(&targetType);\n\t\t\t\t\thr = targetType->SetGUID(MF_MT_MAJOR_TYPE, majorType);\n\t\t\t\t\tif (!SUCCEEDED(hr)) {\n\t\t\t\t\t\tthrow Exception(\"Unable to write major type\", HalleyExceptions::MoviePlugin);\n\t\t\t\t\t}\n\n\t\t\t\t\tif (majorType == MFMediaType_Video) {\n\t\t\t\t\t\tUINT64 frameSize;\n\t\t\t\t\t\tnativeType->GetUINT64(MF_MT_FRAME_SIZE, &frameSize);\n\t\t\t\t\t\tauto videoSize = Vector2i(int(frameSize >> 32), int(frameSize & 0xFFFFFFFFull));\n\t\t\t\t\t\tUINT64 aspectRatioRaw;\n\t\t\t\t\t\tnativeType->GetUINT64(MF_MT_PIXEL_ASPECT_RATIO, &aspectRatioRaw);\n\t\t\t\t\t\tfloat par = float(aspectRatioRaw >> 32) \/ float(aspectRatioRaw & 0xFFFFFFFFull);\n\n\t\t\t\t\t\tuint32_t stride;\n\t\t\t\t\t\thr = nativeType->GetUINT32(MF_MT_DEFAULT_STRIDE, &stride);\n\t\t\t\t\t\tif (SUCCEEDED(hr)) {\n\t\t\t\t\t\t\tminStride = int(stride);\n\t\t\t\t\t\t} else {\n#ifndef WINDOWS_STORE\n\t\t\t\t\t\t\tGUID subType = GUID_NULL;\n\t\t\t\t\t\t\thr = nativeType->GetGUID(MF_MT_SUBTYPE, &subType);\n\t\t\t\t\t\t\tif (SUCCEEDED(hr)) {\n\t\t\t\t\t\t\t\tLONG tmp;\n\t\t\t\t\t\t\t\thr = MFGetStrideForBitmapInfoHeader(subType.Data1, videoSize.x, &tmp);\n\t\t\t\t\t\t\t\tif (SUCCEEDED(hr)) {\n\t\t\t\t\t\t\t\t\tminStride = int(tmp);\n\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t}\n#endif\n\t\t\t\t\t\t}\n\n\t\t\t\t\t\tsetVideoSize(videoSize);\n\t\t\t\t\t\tcurStream.type = MoviePlayerStreamType::Video;\n\t\t\t\t\t\tsubType = MFVideoFormat_NV12; \/\/ NV12 is the only format supported by DX accelerated decoding\n\t\t\t\t\t} else if (majorType == MFMediaType_Audio) {\n\t\t\t\t\t\tUINT32 sampleRate;\n\t\t\t\t\t\tUINT32 numChannels;\n\t\t\t\t\t\tnativeType->GetUINT32(MF_MT_AUDIO_SAMPLES_PER_SECOND, &sampleRate);\n\t\t\t\t\t\tnativeType->GetUINT32(MF_MT_AUDIO_NUM_CHANNELS, &numChannels);\n\n\t\t\t\t\t\tcurStream.type = MoviePlayerStreamType::Audio;\n\t\t\t\t\t\tsubType = MFAudioFormat_PCM;\n\t\t\t\t\t}\n\n\t\t\t\t\thr = targetType->SetGUID(MF_MT_SUBTYPE, subType);\n\t\t\t\t\tif (!SUCCEEDED(hr)) {\n\t\t\t\t\t\tthrow Exception(\"Unable to write subtype\", HalleyExceptions::MoviePlugin);\n\t\t\t\t\t}\n\n\t\t\t\t\thr = reader->SetCurrentMediaType(streamIndex, nullptr, targetType);\n\t\t\t\t\tif (!SUCCEEDED(hr)) {\n\t\t\t\t\t\tthrow Exception(\"Unable to set current media type\", HalleyExceptions::MoviePlugin);\n\t\t\t\t\t}\n\t\t\t\t} catch (...) {\n\t\t\t\t\tif (targetType) {\n\t\t\t\t\t\ttargetType->Release();\n\t\t\t\t\t}\n\t\t\t\t\tnativeType->Release();\n\t\t\t\t\tthrow;\n\t\t\t\t}\n\n\t\t\t\ttargetType->Release();\n\t\t\t\tnativeType->Release();\n\t\t\t} else {\n\t\t\t\tthrow Exception(\"Error reading stream info\", HalleyExceptions::MoviePlugin);\n\t\t\t}\n\t\t}\n\t}\n\n\treset();\n}\n\nvoid MFMoviePlayer::deInit()\n{\n\tif (sampleReceiver) {\n\t\tsampleReceiver->Release();\n\t\tsampleReceiver = nullptr;\n\t}\n\tif (reader) {\n\t\treader->Release();\n\t\treader = nullptr;\n\t}\n\tif (inputByteStream) {\n\t\tinputByteStream->Release();\n\t\tinputByteStream = nullptr;\n\t}\n}\n\nvoid MFMoviePlayer::requestVideoFrame()\n{\n\tconst DWORD controlFlags = 0;\n\tDWORD streamIndex;\n\tDWORD streamFlags;\n\tLONGLONG timestamp;\n\tIMFSample* sample;\n\tauto hr = reader->ReadSample(MF_SOURCE_READER_FIRST_VIDEO_STREAM, controlFlags, &streamIndex, &streamFlags, ×tamp, &sample);\n\tonReadSample(hr, streamIndex, streamFlags, timestamp, sample);\n}\n\nvoid MFMoviePlayer::requestAudioFrame()\n{\n\tconst DWORD controlFlags = 0;\n\tDWORD streamIndex;\n\tDWORD streamFlags;\n\tLONGLONG timestamp;\n\tIMFSample* sample;\n\tauto hr = reader->ReadSample(MF_SOURCE_READER_FIRST_AUDIO_STREAM, controlFlags, &streamIndex, &streamFlags, ×tamp, &sample);\n\tonReadSample(hr, streamIndex, streamFlags, timestamp, sample);\n}\n\nvoid MFMoviePlayer::onReset()\n{\n\tPROPVARIANT pos;\n\tpos.vt = VT_I8;\n\tpos.hVal.QuadPart = 0;\n\treader->SetCurrentPosition(GUID_NULL, pos);\n}\n\nHRESULT MFMoviePlayer::onReadSample(HRESULT hr, DWORD streamIndex, DWORD streamFlags, LONGLONG timestamp, IMFSample* sample)\n{\n\tauto& curStream = streams.at(streamIndex);\n\tif (streamFlags & MF_SOURCE_READERF_ENDOFSTREAM) {\n\t\tcurStream.eof = true;\n\t}\n\n\tif (sample) {\n\t\tTime sampleTime = Time(timestamp) \/ 10000000.0;\n\n\t\tDWORD bufferCount;\n\t\tsample->GetBufferCount(&bufferCount);\n\t\tfor (int i = 0; i < int(bufferCount); ++i) {\n\t\t\tIMFMediaBuffer* buffer;\n\t\t\tsample->GetBufferByIndex(i, &buffer);\n\t\t\tDWORD length;\n\t\t\tbuffer->GetCurrentLength(&length);\n\n\t\t\tif (curStream.type == MoviePlayerStreamType::Video) {\n\t\t\t\t\/*\n\t\t\t\tIDirect3DSurface9 *surface = nullptr;\n\t\t\t\tauto hr = MFGetService(buffer, MR_BUFFER_SERVICE, __uuidof(IDirect3DSurface9), reinterpret_cast<void**>(&surface));\n\t\t\t\tif (SUCCEEDED(hr)) {\n\t\t\t\t\tstd::cout << Release();\n\t\t\t\t}\"Got DX9 surface!\\n\";\n\t\t\t\tsurface->Release();\n\t\t\t\t*\/\n\t\t\t\t\n\t\t\t\tIMF2DBuffer* buffer2d = nullptr;\n\t\t\t\thr = buffer->QueryInterface(__uuidof(IMF2DBuffer), reinterpret_cast<void**>(&buffer2d));\n\t\t\t\tif (SUCCEEDED(hr)) {\n\t\t\t\t\tBYTE* src;\n\t\t\t\t\tLONG pitch;\n\t\t\t\t\tbuffer2d->Lock2D(&src, &pitch);\n\t\t\t\t\treadVideoSample(sampleTime, reinterpret_cast<gsl::byte*>(src), pitch);\n\t\t\t\t\tbuffer2d->Unlock2D();\n\t\t\t\t\tbuffer2d->Release();\n\t\t\t\t} else if (hr == E_NOINTERFACE) {\n\t\t\t\t\tBYTE* src;\n\t\t\t\t\tDWORD maxLen;\n\t\t\t\t\tDWORD curLen;\n\t\t\t\t\tbuffer->Lock(&src, &maxLen, &curLen);\n\t\t\t\t\treadVideoSample(sampleTime, reinterpret_cast<gsl::byte*>(src), minStride);\n\t\t\t\t\tbuffer->Unlock();\n\t\t\t\t\tbuffer->Release();\n\t\t\t\t} else {\n\t\t\t\t\tthrow Exception(\"Error while querying for 2D buffer: \" + toString(hr), HalleyExceptions::MoviePlugin);\n\t\t\t\t}\n\t\t\t}\n\n\t\t\tif (curStream.type == MoviePlayerStreamType::Audio) {\n\t\t\t\tBYTE* data;\n\t\t\t\tDWORD maxLen;\n\t\t\t\tDWORD curLen;\n\t\t\t\tbuffer->Lock(&data, &maxLen, &curLen);\n\t\t\t\treadAudioSample(sampleTime, gsl::as_bytes(gsl::span<const BYTE>(data, curLen)));\n\t\t\t\tbuffer->Unlock();\n\t\t\t}\n\n\t\t\tbuffer->Release();\n\t\t}\n\n\t\tsample->Release();\n\t}\n\n\treturn S_OK;\n}\n\nvoid MFMoviePlayer::readVideoSample(Time time, const gsl::byte* data, int stride)\n{\n\tconst auto videoSize = getSize();\n\tconst int yPlaneHeight = alignUp(videoSize.y, 16);\n\tconst int uvPlaneHeight = alignUp(videoSize.y \/ 2, 16);\n\tconst int width = alignUp(videoSize.x, 16);\n\tconst int height = yPlaneHeight + uvPlaneHeight;\n\n\tauto srcData = gsl::span<const gsl::byte>(data, stride * height);\n\tBytes myData(srcData.size_bytes());\n\tmemcpy(myData.data(), data, myData.size());\n\n\tTextureDescriptor descriptor;\n\tdescriptor.format = TextureFormat::Indexed;\n\tdescriptor.pixelFormat = PixelDataFormat::Image;\n\tdescriptor.size = Vector2i(width, height);\n\tdescriptor.pixelData = TextureDescriptorImageData(std::move(myData), stride);\n\n\tonVideoFrameAvailable(time, std::move(descriptor));\n}\n\nvoid MFMoviePlayer::readAudioSample(Time time, gsl::span<const gsl::byte> data)\n{\n\tauto src = gsl::span<const short>(reinterpret_cast<const short*>(data.data()), data.size() \/ sizeof(short));\n\n\tstd::vector<AudioConfig::SampleFormat> samples(src.size());\n\tfor (int i = 0; i < src.size(); ++i) {\n\t\tsamples[i] = src[i] \/ 32768.0f;\n\t}\n\n\tonAudioFrameAvailable(time, samples);\n}\n<|endoftext|>"} {"text":"<commit_before>\/*\n * Copyright (C) 2018 The Android Open Source Project\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n *\/\n\n#include \"src\/profiling\/common\/unwind_support.h\"\n\n#include <inttypes.h>\n\n#include <procinfo\/process_map.h>\n#include <unwindstack\/Maps.h>\n#include <unwindstack\/Memory.h>\n\n#include \"perfetto\/ext\/base\/file_utils.h\"\n\nnamespace perfetto {\nnamespace profiling {\n\nStackOverlayMemory::StackOverlayMemory(std::shared_ptr<unwindstack::Memory> mem,\n uint64_t sp,\n const uint8_t* stack,\n size_t size)\n : mem_(std::move(mem)), sp_(sp), stack_end_(sp + size), stack_(stack) {}\n\nsize_t StackOverlayMemory::Read(uint64_t addr, void* dst, size_t size) {\n if (addr >= sp_ && addr + size <= stack_end_ && addr + size > sp_) {\n size_t offset = static_cast<size_t>(addr - sp_);\n memcpy(dst, stack_ + offset, size);\n return size;\n }\n\n return mem_->Read(addr, dst, size);\n}\n\nFDMemory::FDMemory(base::ScopedFile mem_fd) : mem_fd_(std::move(mem_fd)) {}\n\nsize_t FDMemory::Read(uint64_t addr, void* dst, size_t size) {\n ssize_t rd = pread64(*mem_fd_, dst, size, static_cast<off64_t>(addr));\n if (rd == -1) {\n PERFETTO_DPLOG(\"read of %zu at offset %\" PRIu64, size, addr);\n return 0;\n }\n return static_cast<size_t>(rd);\n}\n\nFDMaps::FDMaps(base::ScopedFile fd) : fd_(std::move(fd)) {}\n\nbool FDMaps::Parse() {\n \/\/ If the process has already exited, lseek or ReadFileDescriptor will\n \/\/ return false.\n if (lseek(*fd_, 0, SEEK_SET) == -1)\n return false;\n\n std::string content;\n if (!base::ReadFileDescriptor(*fd_, &content))\n return false;\n\n unwindstack::MapInfo* prev_map = nullptr;\n unwindstack::MapInfo* prev_real_map = nullptr;\n return android::procinfo::ReadMapFileContent(\n &content[0], [&](const android::procinfo::MapInfo& mapinfo) {\n \/\/ Mark a device map in \/dev\/ and not in \/dev\/ashmem\/ specially.\n auto flags = mapinfo.flags;\n if (strncmp(mapinfo.name.c_str(), \"\/dev\/\", 5) == 0 &&\n strncmp(mapinfo.name.c_str() + 5, \"ashmem\/\", 7) != 0) {\n flags |= unwindstack::MAPS_FLAGS_DEVICE_MAP;\n }\n maps_.emplace_back(new unwindstack::MapInfo(\n prev_map, prev_real_map, mapinfo.start, mapinfo.end, mapinfo.pgoff,\n flags, mapinfo.name));\n prev_map = maps_.back().get();\n if (!prev_map->IsBlank()) {\n prev_real_map = prev_map;\n }\n });\n}\n\nvoid FDMaps::Reset() {\n maps_.clear();\n}\n\nUnwindingMetadata::UnwindingMetadata(base::ScopedFile maps_fd,\n base::ScopedFile mem_fd)\n : fd_maps(std::move(maps_fd)),\n fd_mem(std::make_shared<FDMemory>(std::move(mem_fd))) {\n if (!fd_maps.Parse())\n PERFETTO_DLOG(\"Failed initial maps parse\");\n}\n\nvoid UnwindingMetadata::ReparseMaps() {\n reparses++;\n fd_maps.Reset();\n fd_maps.Parse();\n#if PERFETTO_BUILDFLAG(PERFETTO_ANDROID_BUILD)\n jit_debug.reset();\n dex_files.reset();\n#endif\n}\n\n#if PERFETTO_BUILDFLAG(PERFETTO_ANDROID_BUILD)\nunwindstack::JitDebug* UnwindingMetadata::GetJitDebug(unwindstack::ArchEnum arch) {\n if (jit_debug.get() == nullptr) {\n std::vector<std::string> search_libs{\"libart.so\", \"libartd.so\"};\n jit_debug = unwindstack::CreateJitDebug(arch, fd_mem, search_libs);\n }\n return jit_debug.get();\n}\n\nunwindstack::DexFiles* UnwindingMetadata::GetDexFiles(unwindstack::ArchEnum arch) {\n if (dex_files.get() == nullptr) {\n std::vector<std::string> search_libs{\"libart.so\", \"libartd.so\"};\n dex_files = unwindstack::CreateDexFiles(arch, fd_mem, search_libs);\n }\n return dex_files.get();\n}\n#endif\n\nconst std::string& UnwindingMetadata::GetBuildId(\n const unwindstack::FrameData& frame) {\n if (!frame.map_name.empty()) {\n unwindstack::MapInfo* map_info = fd_maps.Find(frame.pc);\n if (map_info)\n return map_info->GetBuildID();\n }\n\n return empty_string_;\n}\n\nstd::string StringifyLibUnwindstackError(unwindstack::ErrorCode e) {\n switch (e) {\n case unwindstack::ERROR_NONE:\n return \"NONE\";\n case unwindstack::ERROR_MEMORY_INVALID:\n return \"MEMORY_INVALID\";\n case unwindstack::ERROR_UNWIND_INFO:\n return \"UNWIND_INFO\";\n case unwindstack::ERROR_UNSUPPORTED:\n return \"UNSUPPORTED\";\n case unwindstack::ERROR_INVALID_MAP:\n return \"INVALID_MAP\";\n case unwindstack::ERROR_MAX_FRAMES_EXCEEDED:\n return \"MAX_FRAME_EXCEEDED\";\n case unwindstack::ERROR_REPEATED_FRAME:\n return \"REPEATED_FRAME\";\n case unwindstack::ERROR_INVALID_ELF:\n return \"INVALID_ELF\";\n case unwindstack::ERROR_SYSTEM_CALL:\n return \"SYSTEM_CALL\";\n case unwindstack::ERROR_THREAD_DOES_NOT_EXIST:\n return \"THREAD_DOES_NOT_EXIST\";\n case unwindstack::ERROR_THREAD_TIMEOUT:\n return \"THREAD_TIMEOUT\";\n }\n}\n\n} \/\/ namespace profiling\n} \/\/ namespace perfetto\n<commit_msg>profilers: always log cross-process read errors<commit_after>\/*\n * Copyright (C) 2018 The Android Open Source Project\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n *\/\n\n#include \"src\/profiling\/common\/unwind_support.h\"\n\n#include <inttypes.h>\n\n#include <procinfo\/process_map.h>\n#include <unwindstack\/Maps.h>\n#include <unwindstack\/Memory.h>\n\n#include \"perfetto\/ext\/base\/file_utils.h\"\n\nnamespace perfetto {\nnamespace profiling {\n\nStackOverlayMemory::StackOverlayMemory(std::shared_ptr<unwindstack::Memory> mem,\n uint64_t sp,\n const uint8_t* stack,\n size_t size)\n : mem_(std::move(mem)), sp_(sp), stack_end_(sp + size), stack_(stack) {}\n\nsize_t StackOverlayMemory::Read(uint64_t addr, void* dst, size_t size) {\n if (addr >= sp_ && addr + size <= stack_end_ && addr + size > sp_) {\n size_t offset = static_cast<size_t>(addr - sp_);\n memcpy(dst, stack_ + offset, size);\n return size;\n }\n\n return mem_->Read(addr, dst, size);\n}\n\nFDMemory::FDMemory(base::ScopedFile mem_fd) : mem_fd_(std::move(mem_fd)) {}\n\nsize_t FDMemory::Read(uint64_t addr, void* dst, size_t size) {\n ssize_t rd = pread64(*mem_fd_, dst, size, static_cast<off64_t>(addr));\n if (PERFETTO_UNLIKELY(rd == -1)) {\n PERFETTO_PLOG(\"Failed remote pread of %zu bytes at address %\" PRIx64, size,\n addr);\n return 0;\n }\n return static_cast<size_t>(rd);\n}\n\nFDMaps::FDMaps(base::ScopedFile fd) : fd_(std::move(fd)) {}\n\nbool FDMaps::Parse() {\n \/\/ If the process has already exited, lseek or ReadFileDescriptor will\n \/\/ return false.\n if (lseek(*fd_, 0, SEEK_SET) == -1)\n return false;\n\n std::string content;\n if (!base::ReadFileDescriptor(*fd_, &content))\n return false;\n\n unwindstack::MapInfo* prev_map = nullptr;\n unwindstack::MapInfo* prev_real_map = nullptr;\n return android::procinfo::ReadMapFileContent(\n &content[0], [&](const android::procinfo::MapInfo& mapinfo) {\n \/\/ Mark a device map in \/dev\/ and not in \/dev\/ashmem\/ specially.\n auto flags = mapinfo.flags;\n if (strncmp(mapinfo.name.c_str(), \"\/dev\/\", 5) == 0 &&\n strncmp(mapinfo.name.c_str() + 5, \"ashmem\/\", 7) != 0) {\n flags |= unwindstack::MAPS_FLAGS_DEVICE_MAP;\n }\n maps_.emplace_back(new unwindstack::MapInfo(\n prev_map, prev_real_map, mapinfo.start, mapinfo.end, mapinfo.pgoff,\n flags, mapinfo.name));\n prev_map = maps_.back().get();\n if (!prev_map->IsBlank()) {\n prev_real_map = prev_map;\n }\n });\n}\n\nvoid FDMaps::Reset() {\n maps_.clear();\n}\n\nUnwindingMetadata::UnwindingMetadata(base::ScopedFile maps_fd,\n base::ScopedFile mem_fd)\n : fd_maps(std::move(maps_fd)),\n fd_mem(std::make_shared<FDMemory>(std::move(mem_fd))) {\n if (!fd_maps.Parse())\n PERFETTO_DLOG(\"Failed initial maps parse\");\n}\n\nvoid UnwindingMetadata::ReparseMaps() {\n reparses++;\n fd_maps.Reset();\n fd_maps.Parse();\n#if PERFETTO_BUILDFLAG(PERFETTO_ANDROID_BUILD)\n jit_debug.reset();\n dex_files.reset();\n#endif\n}\n\n#if PERFETTO_BUILDFLAG(PERFETTO_ANDROID_BUILD)\nunwindstack::JitDebug* UnwindingMetadata::GetJitDebug(unwindstack::ArchEnum arch) {\n if (jit_debug.get() == nullptr) {\n std::vector<std::string> search_libs{\"libart.so\", \"libartd.so\"};\n jit_debug = unwindstack::CreateJitDebug(arch, fd_mem, search_libs);\n }\n return jit_debug.get();\n}\n\nunwindstack::DexFiles* UnwindingMetadata::GetDexFiles(unwindstack::ArchEnum arch) {\n if (dex_files.get() == nullptr) {\n std::vector<std::string> search_libs{\"libart.so\", \"libartd.so\"};\n dex_files = unwindstack::CreateDexFiles(arch, fd_mem, search_libs);\n }\n return dex_files.get();\n}\n#endif\n\nconst std::string& UnwindingMetadata::GetBuildId(\n const unwindstack::FrameData& frame) {\n if (!frame.map_name.empty()) {\n unwindstack::MapInfo* map_info = fd_maps.Find(frame.pc);\n if (map_info)\n return map_info->GetBuildID();\n }\n\n return empty_string_;\n}\n\nstd::string StringifyLibUnwindstackError(unwindstack::ErrorCode e) {\n switch (e) {\n case unwindstack::ERROR_NONE:\n return \"NONE\";\n case unwindstack::ERROR_MEMORY_INVALID:\n return \"MEMORY_INVALID\";\n case unwindstack::ERROR_UNWIND_INFO:\n return \"UNWIND_INFO\";\n case unwindstack::ERROR_UNSUPPORTED:\n return \"UNSUPPORTED\";\n case unwindstack::ERROR_INVALID_MAP:\n return \"INVALID_MAP\";\n case unwindstack::ERROR_MAX_FRAMES_EXCEEDED:\n return \"MAX_FRAME_EXCEEDED\";\n case unwindstack::ERROR_REPEATED_FRAME:\n return \"REPEATED_FRAME\";\n case unwindstack::ERROR_INVALID_ELF:\n return \"INVALID_ELF\";\n case unwindstack::ERROR_SYSTEM_CALL:\n return \"SYSTEM_CALL\";\n case unwindstack::ERROR_THREAD_DOES_NOT_EXIST:\n return \"THREAD_DOES_NOT_EXIST\";\n case unwindstack::ERROR_THREAD_TIMEOUT:\n return \"THREAD_TIMEOUT\";\n }\n}\n\n} \/\/ namespace profiling\n} \/\/ namespace perfetto\n<|endoftext|>"} {"text":"<commit_before>#include \"IRVisitor.h\"\n#include \"IR.h\"\n\nnamespace Halide {\nnamespace Internal {\n\nIRVisitor::~IRVisitor() {\n}\n\nvoid IRVisitor::visit(const IntImm *) {\n}\n\nvoid IRVisitor::visit(const FloatImm *) {\n}\n\nvoid IRVisitor::visit(const StringImm *) {\n}\n\nvoid IRVisitor::visit(const Cast *op) {\n op->value.accept(this);\n}\n\nvoid IRVisitor::visit(const Variable *) {\n}\n\nvoid IRVisitor::visit(const Add *op) {\n op->a.accept(this);\n op->b.accept(this);\n}\n\nvoid IRVisitor::visit(const Sub *op) {\n op->a.accept(this);\n op->b.accept(this);\n}\n\nvoid IRVisitor::visit(const Mul *op) {\n op->a.accept(this);\n op->b.accept(this);\n}\n\nvoid IRVisitor::visit(const Div *op) {\n op->a.accept(this);\n op->b.accept(this);\n}\n\nvoid IRVisitor::visit(const Mod *op) {\n op->a.accept(this);\n op->b.accept(this);\n}\n\nvoid IRVisitor::visit(const Min *op) {\n op->a.accept(this);\n op->b.accept(this);\n}\n\nvoid IRVisitor::visit(const Max *op) {\n op->a.accept(this);\n op->b.accept(this);\n}\n\nvoid IRVisitor::visit(const EQ *op) {\n op->a.accept(this);\n op->b.accept(this);\n}\n\nvoid IRVisitor::visit(const NE *op) {\n op->a.accept(this);\n op->b.accept(this);\n}\n\nvoid IRVisitor::visit(const LT *op) {\n op->a.accept(this);\n op->b.accept(this);\n}\n\nvoid IRVisitor::visit(const LE *op) {\n op->a.accept(this);\n op->b.accept(this);\n}\n\nvoid IRVisitor::visit(const GT *op) {\n op->a.accept(this);\n op->b.accept(this);\n}\n\nvoid IRVisitor::visit(const GE *op) {\n op->a.accept(this);\n op->b.accept(this);\n}\n\nvoid IRVisitor::visit(const And *op) {\n op->a.accept(this);\n op->b.accept(this);\n}\n\nvoid IRVisitor::visit(const Or *op) {\n op->a.accept(this);\n op->b.accept(this);\n}\n\nvoid IRVisitor::visit(const Not *op) {\n op->a.accept(this);\n}\n\nvoid IRVisitor::visit(const Select *op) {\n op->condition.accept(this);\n op->true_value.accept(this);\n op->false_value.accept(this);\n}\n\nvoid IRVisitor::visit(const Load *op) {\n op->index.accept(this);\n}\n\nvoid IRVisitor::visit(const Ramp *op) {\n op->base.accept(this);\n op->stride.accept(this);\n}\n\nvoid IRVisitor::visit(const Broadcast *op) {\n op->value.accept(this);\n}\n\nvoid IRVisitor::visit(const Call *op) {\n for (size_t i = 0; i < op->args.size(); i++) {\n op->args[i].accept(this);\n }\n\n \/\/ Consider extern call args\n Function f = op->func;\n if (op->call_type == Call::Halide && f.has_extern_definition()) {\n for (size_t i = 0; i < f.extern_arguments().size(); i++) {\n ExternFuncArgument arg = f.extern_arguments()[i];\n if (arg.is_expr()) {\n arg.expr.accept(this);\n }\n }\n }\n}\n\nvoid IRVisitor::visit(const Let *op) {\n op->value.accept(this);\n op->body.accept(this);\n}\n\nvoid IRVisitor::visit(const LetStmt *op) {\n op->value.accept(this);\n op->body.accept(this);\n}\n\nvoid IRVisitor::visit(const AssertStmt *op) {\n op->condition.accept(this);\n}\n\nvoid IRVisitor::visit(const Pipeline *op) {\n op->produce.accept(this);\n if (op->update.defined()) op->update.accept(this);\n op->consume.accept(this);\n}\n\nvoid IRVisitor::visit(const For *op) {\n op->min.accept(this);\n op->extent.accept(this);\n op->body.accept(this);\n}\n\nvoid IRVisitor::visit(const Store *op) {\n op->value.accept(this);\n op->index.accept(this);\n}\n\nvoid IRVisitor::visit(const Provide *op) {\n for (size_t i = 0; i < op->values.size(); i++) {\n op->values[i].accept(this);\n }\n for (size_t i = 0; i < op->args.size(); i++) {\n op->args[i].accept(this);\n }\n}\n\nvoid IRVisitor::visit(const Allocate *op) {\n for (size_t i = 0; i < op->extents.size(); i++) {\n op->extents[i].accept(this);\n }\n op->condition.accept(this);\n op->body.accept(this);\n}\n\nvoid IRVisitor::visit(const Free *op) {\n}\n\nvoid IRVisitor::visit(const Realize *op) {\n for (size_t i = 0; i < op->bounds.size(); i++) {\n op->bounds[i].min.accept(this);\n op->bounds[i].extent.accept(this);\n }\n op->condition.accept(this);\n op->body.accept(this);\n}\n\nvoid IRVisitor::visit(const Block *op) {\n op->first.accept(this);\n if (op->rest.defined()) {\n op->rest.accept(this);\n }\n}\n\nvoid IRVisitor::visit(const IfThenElse *op) {\n op->condition.accept(this);\n op->then_case.accept(this);\n if (op->else_case.defined()) {\n op->else_case.accept(this);\n }\n}\n\nvoid IRVisitor::visit(const Evaluate *op) {\n op->value.accept(this);\n}\n\nvoid IRGraphVisitor::include(const Expr &e) {\n if (visited.count(e.ptr)) {\n return;\n } else {\n visited.insert(e.ptr);\n e.accept(this);\n return;\n }\n}\n\nvoid IRGraphVisitor::include(const Stmt &s) {\n if (visited.count(s.ptr)) {\n return;\n } else {\n visited.insert(s.ptr);\n s.accept(this);\n return;\n }\n}\n\nvoid IRGraphVisitor::visit(const IntImm *) {\n}\n\nvoid IRGraphVisitor::visit(const FloatImm *) {\n}\n\nvoid IRGraphVisitor::visit(const StringImm *) {\n}\n\nvoid IRGraphVisitor::visit(const Cast *op) {\n include(op->value);\n}\n\nvoid IRGraphVisitor::visit(const Variable *op) {\n}\n\nvoid IRGraphVisitor::visit(const Add *op) {\n include(op->a);\n include(op->b);\n}\n\nvoid IRGraphVisitor::visit(const Sub *op) {\n include(op->a);\n include(op->b);\n}\n\nvoid IRGraphVisitor::visit(const Mul *op) {\n include(op->a);\n include(op->b);\n}\n\nvoid IRGraphVisitor::visit(const Div *op) {\n include(op->a);\n include(op->b);\n}\n\nvoid IRGraphVisitor::visit(const Mod *op) {\n include(op->a);\n include(op->b);\n}\n\nvoid IRGraphVisitor::visit(const Min *op) {\n include(op->a);\n include(op->b);\n}\n\nvoid IRGraphVisitor::visit(const Max *op) {\n include(op->a);\n include(op->b);\n}\n\nvoid IRGraphVisitor::visit(const EQ *op) {\n include(op->a);\n include(op->b);\n}\n\nvoid IRGraphVisitor::visit(const NE *op) {\n include(op->a);\n include(op->b);\n}\n\nvoid IRGraphVisitor::visit(const LT *op) {\n include(op->a);\n include(op->b);\n}\n\nvoid IRGraphVisitor::visit(const LE *op) {\n include(op->a);\n include(op->b);\n}\n\nvoid IRGraphVisitor::visit(const GT *op) {\n include(op->a);\n include(op->b);\n}\n\nvoid IRGraphVisitor::visit(const GE *op) {\n include(op->a);\n include(op->b);\n}\n\nvoid IRGraphVisitor::visit(const And *op) {\n include(op->a);\n include(op->b);\n}\n\nvoid IRGraphVisitor::visit(const Or *op) {\n include(op->a);\n include(op->b);\n}\n\nvoid IRGraphVisitor::visit(const Not *op) {\n include(op->a);\n}\n\nvoid IRGraphVisitor::visit(const Select *op) {\n include(op->condition);\n include(op->true_value);\n include(op->false_value);\n}\n\nvoid IRGraphVisitor::visit(const Load *op) {\n include(op->index);\n}\n\nvoid IRGraphVisitor::visit(const Ramp *op) {\n include(op->base);\n include(op->stride);\n}\n\nvoid IRGraphVisitor::visit(const Broadcast *op) {\n include(op->value);\n}\n\nvoid IRGraphVisitor::visit(const Call *op) {\n for (size_t i = 0; i < op->args.size(); i++) {\n include(op->args[i]);\n }\n}\n\nvoid IRGraphVisitor::visit(const Let *op) {\n include(op->value);\n include(op->body);\n}\n\nvoid IRGraphVisitor::visit(const LetStmt *op) {\n include(op->value);\n include(op->body);\n}\n\nvoid IRGraphVisitor::visit(const AssertStmt *op) {\n include(op->condition);\n}\n\nvoid IRGraphVisitor::visit(const Pipeline *op) {\n include(op->produce);\n if (op->update.defined()) include(op->update);\n include(op->consume);\n}\n\nvoid IRGraphVisitor::visit(const For *op) {\n include(op->min);\n include(op->extent);\n include(op->body);\n}\n\nvoid IRGraphVisitor::visit(const Store *op) {\n include(op->value);\n include(op->index);\n}\n\nvoid IRGraphVisitor::visit(const Provide *op) {\n for (size_t i = 0; i < op->values.size(); i++) {\n include(op->values[i]);\n }\n for (size_t i = 0; i < op->args.size(); i++) {\n include(op->args[i]);\n }\n}\n\nvoid IRGraphVisitor::visit(const Allocate *op) {\n for (size_t i = 0; i < op->extents.size(); i++) {\n include(op->extents[i]);\n }\n include(op->condition);\n include(op->body);\n}\n\nvoid IRGraphVisitor::visit(const Free *op) {\n}\n\nvoid IRGraphVisitor::visit(const Realize *op) {\n for (size_t i = 0; i < op->bounds.size(); i++) {\n include(op->bounds[i].min);\n include(op->bounds[i].extent);\n }\n include(op->condition);\n include(op->body);\n}\n\nvoid IRGraphVisitor::visit(const Block *op) {\n include(op->first);\n if (op->rest.defined()) include(op->rest);\n}\n\nvoid IRGraphVisitor::visit(const IfThenElse *op) {\n include(op->condition);\n include(op->then_case);\n if (op->else_case.defined()) {\n include(op->else_case);\n }\n}\n\nvoid IRGraphVisitor::visit(const Evaluate *op) {\n include(op->value);\n}\n\n}\n}\n<commit_msg>IRVisitor wasn't visiting the message in an assert<commit_after>#include \"IRVisitor.h\"\n#include \"IR.h\"\n\nnamespace Halide {\nnamespace Internal {\n\nIRVisitor::~IRVisitor() {\n}\n\nvoid IRVisitor::visit(const IntImm *) {\n}\n\nvoid IRVisitor::visit(const FloatImm *) {\n}\n\nvoid IRVisitor::visit(const StringImm *) {\n}\n\nvoid IRVisitor::visit(const Cast *op) {\n op->value.accept(this);\n}\n\nvoid IRVisitor::visit(const Variable *) {\n}\n\nvoid IRVisitor::visit(const Add *op) {\n op->a.accept(this);\n op->b.accept(this);\n}\n\nvoid IRVisitor::visit(const Sub *op) {\n op->a.accept(this);\n op->b.accept(this);\n}\n\nvoid IRVisitor::visit(const Mul *op) {\n op->a.accept(this);\n op->b.accept(this);\n}\n\nvoid IRVisitor::visit(const Div *op) {\n op->a.accept(this);\n op->b.accept(this);\n}\n\nvoid IRVisitor::visit(const Mod *op) {\n op->a.accept(this);\n op->b.accept(this);\n}\n\nvoid IRVisitor::visit(const Min *op) {\n op->a.accept(this);\n op->b.accept(this);\n}\n\nvoid IRVisitor::visit(const Max *op) {\n op->a.accept(this);\n op->b.accept(this);\n}\n\nvoid IRVisitor::visit(const EQ *op) {\n op->a.accept(this);\n op->b.accept(this);\n}\n\nvoid IRVisitor::visit(const NE *op) {\n op->a.accept(this);\n op->b.accept(this);\n}\n\nvoid IRVisitor::visit(const LT *op) {\n op->a.accept(this);\n op->b.accept(this);\n}\n\nvoid IRVisitor::visit(const LE *op) {\n op->a.accept(this);\n op->b.accept(this);\n}\n\nvoid IRVisitor::visit(const GT *op) {\n op->a.accept(this);\n op->b.accept(this);\n}\n\nvoid IRVisitor::visit(const GE *op) {\n op->a.accept(this);\n op->b.accept(this);\n}\n\nvoid IRVisitor::visit(const And *op) {\n op->a.accept(this);\n op->b.accept(this);\n}\n\nvoid IRVisitor::visit(const Or *op) {\n op->a.accept(this);\n op->b.accept(this);\n}\n\nvoid IRVisitor::visit(const Not *op) {\n op->a.accept(this);\n}\n\nvoid IRVisitor::visit(const Select *op) {\n op->condition.accept(this);\n op->true_value.accept(this);\n op->false_value.accept(this);\n}\n\nvoid IRVisitor::visit(const Load *op) {\n op->index.accept(this);\n}\n\nvoid IRVisitor::visit(const Ramp *op) {\n op->base.accept(this);\n op->stride.accept(this);\n}\n\nvoid IRVisitor::visit(const Broadcast *op) {\n op->value.accept(this);\n}\n\nvoid IRVisitor::visit(const Call *op) {\n for (size_t i = 0; i < op->args.size(); i++) {\n op->args[i].accept(this);\n }\n\n \/\/ Consider extern call args\n Function f = op->func;\n if (op->call_type == Call::Halide && f.has_extern_definition()) {\n for (size_t i = 0; i < f.extern_arguments().size(); i++) {\n ExternFuncArgument arg = f.extern_arguments()[i];\n if (arg.is_expr()) {\n arg.expr.accept(this);\n }\n }\n }\n}\n\nvoid IRVisitor::visit(const Let *op) {\n op->value.accept(this);\n op->body.accept(this);\n}\n\nvoid IRVisitor::visit(const LetStmt *op) {\n op->value.accept(this);\n op->body.accept(this);\n}\n\nvoid IRVisitor::visit(const AssertStmt *op) {\n op->condition.accept(this);\n op->message.accept(this)\n}\n\nvoid IRVisitor::visit(const Pipeline *op) {\n op->produce.accept(this);\n if (op->update.defined()) op->update.accept(this);\n op->consume.accept(this);\n}\n\nvoid IRVisitor::visit(const For *op) {\n op->min.accept(this);\n op->extent.accept(this);\n op->body.accept(this);\n}\n\nvoid IRVisitor::visit(const Store *op) {\n op->value.accept(this);\n op->index.accept(this);\n}\n\nvoid IRVisitor::visit(const Provide *op) {\n for (size_t i = 0; i < op->values.size(); i++) {\n op->values[i].accept(this);\n }\n for (size_t i = 0; i < op->args.size(); i++) {\n op->args[i].accept(this);\n }\n}\n\nvoid IRVisitor::visit(const Allocate *op) {\n for (size_t i = 0; i < op->extents.size(); i++) {\n op->extents[i].accept(this);\n }\n op->condition.accept(this);\n op->body.accept(this);\n}\n\nvoid IRVisitor::visit(const Free *op) {\n}\n\nvoid IRVisitor::visit(const Realize *op) {\n for (size_t i = 0; i < op->bounds.size(); i++) {\n op->bounds[i].min.accept(this);\n op->bounds[i].extent.accept(this);\n }\n op->condition.accept(this);\n op->body.accept(this);\n}\n\nvoid IRVisitor::visit(const Block *op) {\n op->first.accept(this);\n if (op->rest.defined()) {\n op->rest.accept(this);\n }\n}\n\nvoid IRVisitor::visit(const IfThenElse *op) {\n op->condition.accept(this);\n op->then_case.accept(this);\n if (op->else_case.defined()) {\n op->else_case.accept(this);\n }\n}\n\nvoid IRVisitor::visit(const Evaluate *op) {\n op->value.accept(this);\n}\n\nvoid IRGraphVisitor::include(const Expr &e) {\n if (visited.count(e.ptr)) {\n return;\n } else {\n visited.insert(e.ptr);\n e.accept(this);\n return;\n }\n}\n\nvoid IRGraphVisitor::include(const Stmt &s) {\n if (visited.count(s.ptr)) {\n return;\n } else {\n visited.insert(s.ptr);\n s.accept(this);\n return;\n }\n}\n\nvoid IRGraphVisitor::visit(const IntImm *) {\n}\n\nvoid IRGraphVisitor::visit(const FloatImm *) {\n}\n\nvoid IRGraphVisitor::visit(const StringImm *) {\n}\n\nvoid IRGraphVisitor::visit(const Cast *op) {\n include(op->value);\n}\n\nvoid IRGraphVisitor::visit(const Variable *op) {\n}\n\nvoid IRGraphVisitor::visit(const Add *op) {\n include(op->a);\n include(op->b);\n}\n\nvoid IRGraphVisitor::visit(const Sub *op) {\n include(op->a);\n include(op->b);\n}\n\nvoid IRGraphVisitor::visit(const Mul *op) {\n include(op->a);\n include(op->b);\n}\n\nvoid IRGraphVisitor::visit(const Div *op) {\n include(op->a);\n include(op->b);\n}\n\nvoid IRGraphVisitor::visit(const Mod *op) {\n include(op->a);\n include(op->b);\n}\n\nvoid IRGraphVisitor::visit(const Min *op) {\n include(op->a);\n include(op->b);\n}\n\nvoid IRGraphVisitor::visit(const Max *op) {\n include(op->a);\n include(op->b);\n}\n\nvoid IRGraphVisitor::visit(const EQ *op) {\n include(op->a);\n include(op->b);\n}\n\nvoid IRGraphVisitor::visit(const NE *op) {\n include(op->a);\n include(op->b);\n}\n\nvoid IRGraphVisitor::visit(const LT *op) {\n include(op->a);\n include(op->b);\n}\n\nvoid IRGraphVisitor::visit(const LE *op) {\n include(op->a);\n include(op->b);\n}\n\nvoid IRGraphVisitor::visit(const GT *op) {\n include(op->a);\n include(op->b);\n}\n\nvoid IRGraphVisitor::visit(const GE *op) {\n include(op->a);\n include(op->b);\n}\n\nvoid IRGraphVisitor::visit(const And *op) {\n include(op->a);\n include(op->b);\n}\n\nvoid IRGraphVisitor::visit(const Or *op) {\n include(op->a);\n include(op->b);\n}\n\nvoid IRGraphVisitor::visit(const Not *op) {\n include(op->a);\n}\n\nvoid IRGraphVisitor::visit(const Select *op) {\n include(op->condition);\n include(op->true_value);\n include(op->false_value);\n}\n\nvoid IRGraphVisitor::visit(const Load *op) {\n include(op->index);\n}\n\nvoid IRGraphVisitor::visit(const Ramp *op) {\n include(op->base);\n include(op->stride);\n}\n\nvoid IRGraphVisitor::visit(const Broadcast *op) {\n include(op->value);\n}\n\nvoid IRGraphVisitor::visit(const Call *op) {\n for (size_t i = 0; i < op->args.size(); i++) {\n include(op->args[i]);\n }\n}\n\nvoid IRGraphVisitor::visit(const Let *op) {\n include(op->value);\n include(op->body);\n}\n\nvoid IRGraphVisitor::visit(const LetStmt *op) {\n include(op->value);\n include(op->body);\n}\n\nvoid IRGraphVisitor::visit(const AssertStmt *op) {\n include(op->condition);\n include(op->message);\n}\n\nvoid IRGraphVisitor::visit(const Pipeline *op) {\n include(op->produce);\n if (op->update.defined()) include(op->update);\n include(op->consume);\n}\n\nvoid IRGraphVisitor::visit(const For *op) {\n include(op->min);\n include(op->extent);\n include(op->body);\n}\n\nvoid IRGraphVisitor::visit(const Store *op) {\n include(op->value);\n include(op->index);\n}\n\nvoid IRGraphVisitor::visit(const Provide *op) {\n for (size_t i = 0; i < op->values.size(); i++) {\n include(op->values[i]);\n }\n for (size_t i = 0; i < op->args.size(); i++) {\n include(op->args[i]);\n }\n}\n\nvoid IRGraphVisitor::visit(const Allocate *op) {\n for (size_t i = 0; i < op->extents.size(); i++) {\n include(op->extents[i]);\n }\n include(op->condition);\n include(op->body);\n}\n\nvoid IRGraphVisitor::visit(const Free *op) {\n}\n\nvoid IRGraphVisitor::visit(const Realize *op) {\n for (size_t i = 0; i < op->bounds.size(); i++) {\n include(op->bounds[i].min);\n include(op->bounds[i].extent);\n }\n include(op->condition);\n include(op->body);\n}\n\nvoid IRGraphVisitor::visit(const Block *op) {\n include(op->first);\n if (op->rest.defined()) include(op->rest);\n}\n\nvoid IRGraphVisitor::visit(const IfThenElse *op) {\n include(op->condition);\n include(op->then_case);\n if (op->else_case.defined()) {\n include(op->else_case);\n }\n}\n\nvoid IRGraphVisitor::visit(const Evaluate *op) {\n include(op->value);\n}\n\n}\n}\n<|endoftext|>"} {"text":"<commit_before>#include \"domain.h\"\n#include \"person.h\"\n#include <iostream>\n#include <algorithm>\n#include <vector>\n#include \"data.h\"\n#include \"console.h\"\n\nusing namespace std;\n\nDomain::Domain()\n{\n\n}\n\nbool agePerson (const Person& lsh, const Person& rhs) \/\/ sort by birthyear\n{\n return (lsh.getBirth() < rhs.getBirth());\n}\n\nvoid Domain::ageSorting(vector<Person>& ageSort) \/\/sort by birthyear\n{\n std::sort(ageSort.begin(), ageSort.end(), agePerson);\n}\n\nbool nameAlpha(const Person& lhs, const Person& rhs)\n{\n return (lhs.getName() < rhs.getName());\n}\n\nvoid Domain::alphabeticSort(vector<Person>& alphaSort)\n{\n std::sort(alphaSort.begin(), alphaSort.end(), nameAlpha);\n}\n\nint Domain::findAge(Person& sciAge) const\n{\n int x;\n int y;\n int resultDead;\n int resultAlive;\n const int currentYear = 2016;\n x = sciAge.getDeath();\n y = sciAge.getBirth();\n\n if(x == 0)\n {\n resultAlive = currentYear - y;\n return resultAlive;\n }\n else\n {\n resultDead = x - y;\n return resultDead;\n }\n}\n\nvector<Person> Domain::search(vector<Person>& p, string name)\n{\n vector<Person> results;\n\/\/Search function, we search from out vector and then put the results in another vector so it shows us all results\n for(unsigned int i = 0; i < p.size(); i++)\n {\n string nameFind;\n char genderFind;\n int birthFind;\n int deathFind;\n nameFind = p[i].getName();\n std::size_t found = nameFind.find(name);\n\n if (found!=std::string::npos)\n {\n p[i].getName();\n genderFind = p[i].getGender();\n birthFind = p[i].getBirth();\n deathFind = p[i].getDeath();\n Person p2(nameFind, genderFind, birthFind, deathFind);\n results.push_back(p2);\n }\n }\n return results;\n}\n<commit_msg>testa email<commit_after>#include \"domain.h\"\n#include \"person.h\"\n#include <iostream>\n#include <algorithm>\n#include <vector>\n#include \"data.h\"\n#include \"console.h\"\n\nusing namespace std;\n\nDomain::Domain()\n{\nasdf\n}\n\nbool agePerson (const Person& lsh, const Person& rhs) \/\/ sort by birthyear\n{\n return (lsh.getBirth() < rhs.getBirth());\n}\n\nvoid Domain::ageSorting(vector<Person>& ageSort) \/\/sort by birthyear\n{\n std::sort(ageSort.begin(), ageSort.end(), agePerson);\n}\n\nbool nameAlpha(const Person& lhs, const Person& rhs)\n{\n return (lhs.getName() < rhs.getName());\n}\n\nvoid Domain::alphabeticSort(vector<Person>& alphaSort)\n{\n std::sort(alphaSort.begin(), alphaSort.end(), nameAlpha);\n}\n\nint Domain::findAge(Person& sciAge) const\n{\n int x;\n int y;\n int resultDead;\n int resultAlive;\n const int currentYear = 2016;\n x = sciAge.getDeath();\n y = sciAge.getBirth();\n\n if(x == 0)\n {\n resultAlive = currentYear - y;\n return resultAlive;\n }\n else\n {\n resultDead = x - y;\n return resultDead;\n }\n}\n\nvector<Person> Domain::search(vector<Person>& p, string name)\n{\n vector<Person> results;\n\/\/Search function, we search from out vector and then put the results in another vector so it shows us all results\n for(unsigned int i = 0; i < p.size(); i++)\n {\n string nameFind;\n char genderFind;\n int birthFind;\n int deathFind;\n nameFind = p[i].getName();\n std::size_t found = nameFind.find(name);\n\n if (found!=std::string::npos)\n {\n p[i].getName();\n genderFind = p[i].getGender();\n birthFind = p[i].getBirth();\n deathFind = p[i].getDeath();\n Person p2(nameFind, genderFind, birthFind, deathFind);\n results.push_back(p2);\n }\n }\n return results;\n}\n<|endoftext|>"} {"text":"<commit_before><commit_msg>& next to type name<commit_after><|endoftext|>"} {"text":"<commit_before>\/*\n Copyright (c) 2016 PaddlePaddle Authors. All Rights Reserve.\n Licensed under the Apache License, Version 2.0 (the \"License\");\n you may not use this file except in compliance with the License.\n You may obtain a copy of the License at\n http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n Unless required by applicable law or agreed to in writing, software\n distributed under the License is distributed on an \"AS IS\" BASIS,\n WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n See the License for the specific language governing permissions and\n limitations under the License.\n*\/\n\n#include \"paddle\/framework\/eigen.h\"\n#include <gtest\/gtest.h>\n\nnamespace paddle {\nnamespace framework {\n\nTEST(EigenDim, From) {\n EigenDim<3>::Type ed = EigenDim<3>::From(make_ddim({1, 2, 3}));\n EXPECT_EQ(1, ed[0]);\n EXPECT_EQ(2, ed[1]);\n EXPECT_EQ(3, ed[2]);\n}\n\nTEST(Eigen, Tensor) {\n Tensor t;\n float* p = t.mutable_data<float>(make_ddim({1, 2, 3}), platform::CPUPlace());\n for (int i = 0; i < 1 * 2 * 3; i++) {\n p[i] = static_cast<float>(i);\n }\n\n EigenTensor<float, 3>::Type et = EigenTensor<float, 3>::From(t);\n\n EXPECT_EQ(1, et.dimension(0));\n EXPECT_EQ(2, et.dimension(1));\n EXPECT_EQ(3, et.dimension(2));\n\n for (int i = 0; i < 1; i++) {\n for (int j = 0; j < 2; j++) {\n for (int k = 0; k < 3; k++) {\n EXPECT_EQ((i * 2 + j) * 3 + k, et(i, j, k));\n }\n }\n }\n for (int i = 0; i < 1 * 2 * 3; i++) {\n EXPECT_EQ(i, et(i));\n }\n}\n\nTEST(Eigen, VectorFrom) {\n Tensor t;\n float* p = t.mutable_data<float>(make_ddim({6}), platform::CPUPlace());\n for (int i = 0; i < 6; i++) {\n p[i] = static_cast<float>(i);\n }\n\n EigenVector<float>::Type ev = EigenVector<float>::From(t);\n\n EXPECT_EQ(6, ev.dimension(0));\n\n for (int i = 0; i < 6; i++) {\n EXPECT_EQ(i, ev(i));\n }\n}\n\nTEST(Eigen, VectorFlatten) {\n Tensor t;\n float* p = t.mutable_data<float>(make_ddim({1, 2, 3}), platform::CPUPlace());\n for (int i = 0; i < 1 * 2 * 3; i++) {\n p[i] = static_cast<float>(i);\n }\n\n EigenVector<float>::Type ev = EigenVector<float>::Flatten(t);\n\n EXPECT_EQ(1 * 2 * 3, ev.dimension(0));\n\n for (int i = 0; i < 1 * 2 * 3; i++) {\n EXPECT_EQ(i, ev(i));\n }\n}\n\nTEST(Eigen, Matrix) {\n Tensor t;\n float* p = t.mutable_data<float>(make_ddim({2, 3}), platform::CPUPlace());\n for (int i = 0; i < 2 * 3; i++) {\n p[i] = static_cast<float>(i);\n }\n\n EigenMatrix<float>::Type em = EigenMatrix<float>::From(t);\n\n EXPECT_EQ(2, em.dimension(0));\n EXPECT_EQ(3, em.dimension(1));\n\n for (int i = 0; i < 2; i++) {\n for (int j = 0; j < 3; j++) {\n EXPECT_EQ(i * 3 + j, em(i, j));\n }\n }\n}\n\n} \/\/ namespace framework\n} \/\/ namespace paddle\n<commit_msg>change EQ to NEAR for float value<commit_after>\/*\n Copyright (c) 2016 PaddlePaddle Authors. All Rights Reserve.\n Licensed under the Apache License, Version 2.0 (the \"License\");\n you may not use this file except in compliance with the License.\n You may obtain a copy of the License at\n http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n Unless required by applicable law or agreed to in writing, software\n distributed under the License is distributed on an \"AS IS\" BASIS,\n WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n See the License for the specific language governing permissions and\n limitations under the License.\n*\/\n\n#include \"paddle\/framework\/eigen.h\"\n#include <gtest\/gtest.h>\n\nnamespace paddle {\nnamespace framework {\n\nTEST(EigenDim, From) {\n EigenDim<3>::Type ed = EigenDim<3>::From(make_ddim({1, 2, 3}));\n ASSERT_EQ(1, ed[0]);\n ASSERT_EQ(2, ed[1]);\n ASSERT_EQ(3, ed[2]);\n}\n\nTEST(Eigen, Tensor) {\n Tensor t;\n float* p = t.mutable_data<float>(make_ddim({1, 2, 3}), platform::CPUPlace());\n for (int i = 0; i < 1 * 2 * 3; i++) {\n p[i] = static_cast<float>(i);\n }\n\n EigenTensor<float, 3>::Type et = EigenTensor<float, 3>::From(t);\n\n ASSERT_EQ(1, et.dimension(0));\n ASSERT_EQ(2, et.dimension(1));\n ASSERT_EQ(3, et.dimension(2));\n\n for (int i = 0; i < 1; i++) {\n for (int j = 0; j < 2; j++) {\n for (int k = 0; k < 3; k++) {\n ASSERT_NEAR((i * 2 + j) * 3 + k, et(i, j, k), 1e-6f);\n }\n }\n }\n}\n\nTEST(Eigen, VectorFrom) {\n Tensor t;\n float* p = t.mutable_data<float>(make_ddim({6}), platform::CPUPlace());\n for (int i = 0; i < 6; i++) {\n p[i] = static_cast<float>(i);\n }\n\n EigenVector<float>::Type ev = EigenVector<float>::From(t);\n\n ASSERT_EQ(6, ev.dimension(0));\n\n for (int i = 0; i < 6; i++) {\n ASSERT_NEAR(i, ev(i), 1e-6f);\n }\n}\n\nTEST(Eigen, VectorFlatten) {\n Tensor t;\n float* p = t.mutable_data<float>(make_ddim({1, 2, 3}), platform::CPUPlace());\n for (int i = 0; i < 1 * 2 * 3; i++) {\n p[i] = static_cast<float>(i);\n }\n\n EigenVector<float>::Type ev = EigenVector<float>::Flatten(t);\n\n ASSERT_EQ(1 * 2 * 3, ev.dimension(0));\n\n for (int i = 0; i < 1 * 2 * 3; i++) {\n ASSERT_NEAR(i, ev(i), 1e-6f);\n }\n}\n\nTEST(Eigen, Matrix) {\n Tensor t;\n float* p = t.mutable_data<float>(make_ddim({2, 3}), platform::CPUPlace());\n for (int i = 0; i < 2 * 3; i++) {\n p[i] = static_cast<float>(i);\n }\n\n EigenMatrix<float>::Type em = EigenMatrix<float>::From(t);\n\n ASSERT_EQ(2, em.dimension(0));\n ASSERT_EQ(3, em.dimension(1));\n\n for (int i = 0; i < 2; i++) {\n for (int j = 0; j < 3; j++) {\n ASSERT_NEAR(i * 3 + j, em(i, j), 1e-6f);\n }\n }\n}\n\n} \/\/ namespace framework\n} \/\/ namespace paddle\n<|endoftext|>"} {"text":"<commit_before>#include \"States.h\"\n\nenum DemoPages\n{\n\tPAGE_SPRITE,\n\tPAGE_TILED,\n\tPAGE_TEXT,\n\tPAGE_TEXTPATH,\n\tPAGE_CONTROLLER,\n\tPAGE_ASCII,\n\tPAGE_TILEMAP,\n\tPAGE_COLLISION,\n\tPAGE_INTERPOLATE,\n\tPAGE_PARTICLES,\n\tPAGE_TRAILAREA,\n\tPAGE_BACKDROP,\n\tPAGE_LIGHTING2D,\n\tPAGE_GRAPHICS3D,\n\tPAGE_ASYNC,\n\tNUM_DEMOPAGES,\n};\n\nvoid DemoStatesManager::SetNewPage()\n{\n\tif (VGlobal::p()->PostProcess)\n\t{\n\t\tdelete VGlobal::p()->PostProcess;\n\t\tVGlobal::p()->PostProcess = NULL;\n\t}\n\n\tVSubState* subState;\n\tswitch (CurrentPage)\n\t{\n\t\tcase PAGE_ASCII:\n\t\t\tsubState = new ASCIITestState();\n\t\t\tbreak;\n\t\tcase PAGE_ASYNC:\n\t\t\tsubState = new AsyncTestState();\n\t\t\tbreak;\n\t\tcase PAGE_BACKDROP:\n\t\t\tsubState = new BackdropState();\n\t\t\tbreak;\n\t\tcase PAGE_COLLISION:\n\t\t\tsubState = new CollisionState();\n\t\t\tbreak;\n\t\tcase PAGE_CONTROLLER:\n\t\t\tsubState = new ControllerState();\n\t\t\tbreak;\n\t\tcase PAGE_GRAPHICS3D:\n\t\t\tsubState = new Graphics3DState();\n\t\t\tbreak;\n\t\tcase PAGE_INTERPOLATE:\n\t\t\tsubState = new InterpolateState();\n\t\t\tbreak;\n\t\tcase PAGE_LIGHTING2D:\n\t\t\tsubState = new Lighting2DState();\n\t\t\tbreak;\n\t\tcase PAGE_PARTICLES:\n\t\t\tsubState = new ParticlesState();\n\t\t\tbreak;\n\t\tcase PAGE_SPRITE:\n\t\t\tsubState = new SpriteState();\n\t\t\tbreak;\n\t\tcase PAGE_TEXT:\n\t\t\tsubState = new TextState();\n\t\t\tbreak;\n\t\tcase PAGE_TEXTPATH:\n\t\t\tsubState = new WordShapeState();\n\t\t\tbreak;\n\t\tcase PAGE_TILED:\n\t\t\tsubState = new TiledState();\n\t\t\tbreak;\n\t\tcase PAGE_TILEMAP:\n\t\t\tsubState = new TilemapState();\n\t\t\tbreak;\n\t\tcase PAGE_TRAILAREA:\n\t\t\tsubState = new TrailAreaState();\n\t\t\tbreak;\n\t\tdefault:\n\t\t\tsubState = NULL;\n\t\t\tbreak;\n\t}\n\n\tauto stateText = new VGroup(3);\n\tauto title = new VText(sf::Vector2f(0.0f, 2.0f), (float)VGlobal::p()->Width, \"SFML VFrame\", 24);\n\ttitle->Alignment = VTextAlign::ALIGNCENTRE;\n\ttitle->ScrollFactor = sf::Vector2f();\n\ttitle->ZoomFactor = 0;\n\n\tstd::stringstream ss;\n\tss << \"Version: \" << VFRAME_VERSION;\n\tauto version = new VText(5.0f, 10.0f, (float)VGlobal::p()->Width - 10.0f, ss.str(), 12);\n\tversion->Alignment = VTextAlign::ALIGNRIGHT;\n\tversion->ScrollFactor = sf::Vector2f();\n\tversion->ZoomFactor = 0;\n\n\tauto header = new VSprite();\n\theader->MakeGraphic(VGlobal::p()->Width, (int)(title->Position.y + 32), sf::Color::Black);\n\theader->ScrollFactor = sf::Vector2f();\n\theader->ZoomFactor = 0;\n\n\tCameras[0]->Reset();\n\tVGlobal::p()->BackgroundColor = sf::Color::Black;\n\n\tif (VTimeManager::AnyActiveTimers())\n\t{\n\t\tVTimeManager::p()->Clear();\n\t}\n\n\tOpenSubState(subState);\n\tResetSubState();\n\n\tstateText->Add(header);\n\tstateText->Add(title);\n\tstateText->Add(version);\n\t\/\/subState->Add(stateText);\n}\n\nvoid DemoStatesManager::Initialise()\n{\n\tVSUPERCLASS::Initialise();\n\tSetNewPage();\n\n#ifdef USE_GAMEPAD_API\n\tVGlobal::p()->Input.SetAxisInput(\"leftX\", sf::Keyboard::D, sf::Keyboard::A, VInputHandler::XAxis::PovX);\n\tVGlobal::p()->Input.SetAxisInput(\"leftY\", sf::Keyboard::S, sf::Keyboard::W, VInputHandler::XAxis::PovY);\n\tVGlobal::p()->Input.SetAxisInput(\"rightX\", sf::Keyboard::L, sf::Keyboard::J, VInputHandler::XAxis::Z);\n\tVGlobal::p()->Input.SetAxisInput(\"rightY\", sf::Keyboard::K, sf::Keyboard::I, VInputHandler::XAxis::V);\n\tVGlobal::p()->Input.SetAxisInput(\"LT\", sf::Keyboard::E, sf::Keyboard::Q, VInputHandler::XAxis::L);\n\tVGlobal::p()->Input.SetAxisInput(\"RT\", sf::Keyboard::O, sf::Keyboard::U, VInputHandler::XAxis::R);\n\tVGlobal::p()->Input.SetButtonInput(\"A\", sf::Keyboard::N, BUTTON_A);\n\tVGlobal::p()->Input.SetButtonInput(\"B\", sf::Keyboard::M, BUTTON_B);\n\tVGlobal::p()->Input.SetButtonInput(\"X\", sf::Keyboard::H, BUTTON_X);\n\tVGlobal::p()->Input.SetButtonInput(\"Y\", sf::Keyboard::J, BUTTON_Y);\n\tVGlobal::p()->Input.SetButtonInput(\"leftShoulder\", sf::Keyboard::T, BUTTON_LEFT_SHOULDER);\n\tVGlobal::p()->Input.SetButtonInput(\"rightShoulder\", sf::Keyboard::Y, BUTTON_RIGHT_SHOULDER);\n\tVGlobal::p()->Input.SetButtonInput(\"leftStick\", sf::Keyboard::B, BUTTON_LEFT_THUMB);\n\tVGlobal::p()->Input.SetButtonInput(\"rightStick\", sf::Keyboard::N, BUTTON_RIGHT_THUMB);\n\tVGlobal::p()->Input.SetButtonInput(\"Back\", sf::Keyboard::BackSpace, BUTTON_BACK);\n\tVGlobal::p()->Input.SetButtonInput(\"Start\", sf::Keyboard::Return, BUTTON_START);\n#elif defined(USE_SFML_JOYSTICK)\n\tVGlobal::p()->Input.SetAxisInput(\"leftX\", sf::Keyboard::D, sf::Keyboard::A, sf::Joystick::Axis::X);\n\tVGlobal::p()->Input.SetAxisInput(\"leftY\", sf::Keyboard::S, sf::Keyboard::W, sf::Joystick::Axis::Y);\n\tVGlobal::p()->Input.SetAxisInput(\"rightX\", sf::Keyboard::L, sf::Keyboard::J, sf::Joystick::Axis::U);\n\tVGlobal::p()->Input.SetAxisInput(\"rightY\", sf::Keyboard::K, sf::Keyboard::I, sf::Joystick::Axis::R);\n\tVGlobal::p()->Input.SetAxisInput(\"LT\", sf::Keyboard::E, sf::Keyboard::Q, sf::Joystick::Axis::Z);\n\tVGlobal::p()->Input.SetAxisInput(\"RT\", sf::Keyboard::O, sf::Keyboard::U, sf::Joystick::Axis::Z);\n\tVGlobal::p()->Input.SetButtonInput(\"A\", sf::Keyboard::N, VInputHandler::BUTTON_A);\n\tVGlobal::p()->Input.SetButtonInput(\"B\", sf::Keyboard::M, VInputHandler::BUTTON_B);\n\tVGlobal::p()->Input.SetButtonInput(\"X\", sf::Keyboard::H, VInputHandler::BUTTON_X);\n\tVGlobal::p()->Input.SetButtonInput(\"Y\", sf::Keyboard::J, VInputHandler::BUTTON_Y);\n\tVGlobal::p()->Input.SetButtonInput(\"leftShoulder\", sf::Keyboard::T, VInputHandler::BUTTON_LEFT_SHOULDER);\n\tVGlobal::p()->Input.SetButtonInput(\"rightShoulder\", sf::Keyboard::Y, VInputHandler::BUTTON_RIGHT_SHOULDER);\n\tVGlobal::p()->Input.SetButtonInput(\"leftStick\", sf::Keyboard::B, VInputHandler::BUTTON_LEFT_THUMB);\n\tVGlobal::p()->Input.SetButtonInput(\"rightStick\", sf::Keyboard::N, VInputHandler::BUTTON_RIGHT_THUMB);\n\tVGlobal::p()->Input.SetButtonInput(\"Back\", sf::Keyboard::BackSpace, VInputHandler::BUTTON_BACK);\n\tVGlobal::p()->Input.SetButtonInput(\"Start\", sf::Keyboard::Return, VInputHandler::BUTTON_START);\n\tVGlobal::p()->Input.SetButtonInput(\"Home\", sf::Keyboard::Home, VInputHandler::BUTTON_HOME);\n#else\n\tVGlobal::p()->Input.SetAxisInput(\"leftX\", sf::Keyboard::D, sf::Keyboard::A, sf::XInputDevice::XAxis::PovX);\n\tVGlobal::p()->Input.SetAxisInput(\"leftY\", sf::Keyboard::S, sf::Keyboard::W, sf::XInputDevice::XAxis::PovY);\n\tVGlobal::p()->Input.SetAxisInput(\"rightX\", sf::Keyboard::L, sf::Keyboard::J, sf::XInputDevice::XAxis::Z);\n\tVGlobal::p()->Input.SetAxisInput(\"rightY\", sf::Keyboard::K, sf::Keyboard::I, sf::XInputDevice::XAxis::V);\n\tVGlobal::p()->Input.SetAxisInput(\"LT\", sf::Keyboard::E, sf::Keyboard::Q, sf::XInputDevice::XAxis::L);\n\tVGlobal::p()->Input.SetAxisInput(\"RT\", sf::Keyboard::O, sf::Keyboard::U, sf::XInputDevice::XAxis::R);\n\tVGlobal::p()->Input.SetButtonInput(\"A\", sf::Keyboard::N, sf::XInputDevice::A);\n\tVGlobal::p()->Input.SetButtonInput(\"B\", sf::Keyboard::M, sf::XInputDevice::B);\n\tVGlobal::p()->Input.SetButtonInput(\"X\", sf::Keyboard::H, sf::XInputDevice::X);\n\tVGlobal::p()->Input.SetButtonInput(\"Y\", sf::Keyboard::J, sf::XInputDevice::Y);\n\tVGlobal::p()->Input.SetButtonInput(\"leftShoulder\", sf::Keyboard::T, sf::XInputDevice::LB);\n\tVGlobal::p()->Input.SetButtonInput(\"rightShoulder\", sf::Keyboard::Y, sf::XInputDevice::RB);\n\tVGlobal::p()->Input.SetButtonInput(\"leftStick\", sf::Keyboard::B, sf::XInputDevice::LEFT_THUMB);\n\tVGlobal::p()->Input.SetButtonInput(\"rightStick\", sf::Keyboard::N, sf::XInputDevice::RIGHT_THUMB);\n\tVGlobal::p()->Input.SetButtonInput(\"Back\", sf::Keyboard::BackSpace, sf::XInputDevice::BACK);\n\tVGlobal::p()->Input.SetButtonInput(\"Start\", sf::Keyboard::Return, sf::XInputDevice::START);\n#endif\n}\n\nvoid DemoStatesManager::HandleEvents(const sf::Event& event)\n{\n\tVSUPERCLASS::HandleEvents(event);\n\n\tif (event.type == sf::Event::KeyPressed)\n\t{\n\t\tif (event.key.code == sf::Keyboard::Left)\n\t\t{\n\t\t\tCurrentPage--;\n\n\t\t\tif (CurrentPage < 0)\n\t\t\t\tCurrentPage = NUM_DEMOPAGES - 1;\n\n\t\t\tSetNewPage();\n\t\t}\n\n\t\tif (event.key.code == sf::Keyboard::Right)\n\t\t{\n\t\t\tCurrentPage++;\n\t\t\tCurrentPage %= NUM_DEMOPAGES;\n\n\t\t\tSetNewPage();\n\t\t}\n\n\t\tif (event.key.code == sf::Keyboard::Q)\n\t\t{\n\t\t\tVGlobal::p()->DrawDebug = !VGlobal::p()->DrawDebug;\n\t\t}\n\n\t\tif (event.key.code == sf::Keyboard::E)\n\t\t{\n\t\t\tVGlobal::p()->Antialiasing = !VGlobal::p()->Antialiasing;\n\t\t}\n\n\t\tif (event.key.code == sf::Keyboard::F)\n\t\t{\n\t\t\tVGlobal::p()->ToggleFullscreen();\n\t\t}\n\t}\n}\n<commit_msg>Update to example to reflect VFrame updates<commit_after>#include \"States.h\"\n\nenum DemoPages\n{\n\tPAGE_SPRITE,\n\tPAGE_TILED,\n\tPAGE_TEXT,\n\tPAGE_TEXTPATH,\n\tPAGE_CONTROLLER,\n\tPAGE_ASCII,\n\tPAGE_TILEMAP,\n\tPAGE_COLLISION,\n\tPAGE_INTERPOLATE,\n\tPAGE_PARTICLES,\n\tPAGE_TRAILAREA,\n\tPAGE_BACKDROP,\n\tPAGE_LIGHTING2D,\n\tPAGE_GRAPHICS3D,\n\tPAGE_ASYNC,\n\tNUM_DEMOPAGES,\n};\n\nvoid DemoStatesManager::SetNewPage()\n{\n\tVGlobal::p()->PostProcess.reset();\n\n\tVSubState* subState;\n\tswitch (CurrentPage)\n\t{\n\t\tcase PAGE_ASCII:\n\t\t\tsubState = new ASCIITestState();\n\t\t\tbreak;\n\t\tcase PAGE_ASYNC:\n\t\t\tsubState = new AsyncTestState();\n\t\t\tbreak;\n\t\tcase PAGE_BACKDROP:\n\t\t\tsubState = new BackdropState();\n\t\t\tbreak;\n\t\tcase PAGE_COLLISION:\n\t\t\tsubState = new CollisionState();\n\t\t\tbreak;\n\t\tcase PAGE_CONTROLLER:\n\t\t\tsubState = new ControllerState();\n\t\t\tbreak;\n\t\tcase PAGE_GRAPHICS3D:\n\t\t\tsubState = new Graphics3DState();\n\t\t\tbreak;\n\t\tcase PAGE_INTERPOLATE:\n\t\t\tsubState = new InterpolateState();\n\t\t\tbreak;\n\t\tcase PAGE_LIGHTING2D:\n\t\t\tsubState = new Lighting2DState();\n\t\t\tbreak;\n\t\tcase PAGE_PARTICLES:\n\t\t\tsubState = new ParticlesState();\n\t\t\tbreak;\n\t\tcase PAGE_SPRITE:\n\t\t\tsubState = new SpriteState();\n\t\t\tbreak;\n\t\tcase PAGE_TEXT:\n\t\t\tsubState = new TextState();\n\t\t\tbreak;\n\t\tcase PAGE_TEXTPATH:\n\t\t\tsubState = new WordShapeState();\n\t\t\tbreak;\n\t\tcase PAGE_TILED:\n\t\t\tsubState = new TiledState();\n\t\t\tbreak;\n\t\tcase PAGE_TILEMAP:\n\t\t\tsubState = new TilemapState();\n\t\t\tbreak;\n\t\tcase PAGE_TRAILAREA:\n\t\t\tsubState = new TrailAreaState();\n\t\t\tbreak;\n\t\tdefault:\n\t\t\tsubState = NULL;\n\t\t\tbreak;\n\t}\n\n\tif (SubState != nullptr)\n\t{\n\t\tif (SubState->GetIndexOfItem(stateText) >= 0)\n\t\t{\n\t\t\tSubState->Remove(stateText);\n\t\t}\n\t}\n\n\tOpenSubState(subState);\n\n\tCameras[0]->Reset();\n\tVGlobal::p()->BackgroundColor = sf::Color::Black;\n\n\tif (VTimeManager::AnyActiveTimers())\n\t{\n\t\tVTimeManager::p()->Clear();\n\t}\n\t\n\tdebugTimer = new VTimer(false);\n\tVTimeManager::p()->AddTimer(debugTimer);\n\n\tResetSubState();\n\tsubState->Add(stateText);\n}\n\nvoid DemoStatesManager::Initialise()\n{\n\tVSUPERCLASS::Initialise();\n\tSetNewPage();\n\n\tauto title = new VText(sf::Vector2f(0.0f, 2.0f), (float)VGlobal::p()->Width, \"SFML VFrame\", 24);\n\ttitle->Alignment = VTextAlign::ALIGNCENTRE;\n\ttitle->ScrollFactor = sf::Vector2f();\n\ttitle->ZoomFactor = 0;\n\ttitle->ApplyChanges();\n\n\tstd::stringstream ss;\n\tss << \"Version: \" << VFRAME_VERSION;\n\tauto version = new VText(5.0f, 10.0f, (float)VGlobal::p()->Width - 10.0f, ss.str(), 12);\n\tversion->Alignment = VTextAlign::ALIGNRIGHT;\n\tversion->ScrollFactor = sf::Vector2f();\n\tversion->ZoomFactor = 0;\n\tversion->ApplyChanges();\n\n\tauto header = new VSprite();\n\theader->MakeGraphic(VGlobal::p()->Width, (int)(title->Position.y + 32), sf::Color::Black);\n\theader->ScrollFactor = sf::Vector2f();\n\theader->ZoomFactor = 0;\n\n\tauto debug = new VText(5.0f, 10.0f, (float)VGlobal::p()->Width - 10.0f, \"\", 12);\n\tdebug->Alignment = VTextAlign::ALIGNLEFT;\n\tdebug->ScrollFactor = sf::Vector2f();\n\tdebug->ZoomFactor = 0;\n\tdebug->ApplyChanges();\n\tdebugMessages = debug;\n\n\tstateText = new VGroup(4);\n\tstateText->Add(header);\n\tstateText->Add(title);\n\tstateText->Add(version);\n\tstateText->Add(debugMessages);\n\tSubState->Add(stateText);\n\n#ifdef USE_GAMEPAD_API\n\tVGlobal::p()->Input->SetAxisInput(\"leftX\", sf::Keyboard::D, sf::Keyboard::A, VInputHandler::XAxis::PovX);\n\tVGlobal::p()->Input->SetAxisInput(\"leftY\", sf::Keyboard::S, sf::Keyboard::W, VInputHandler::XAxis::PovY);\n\tVGlobal::p()->Input->SetAxisInput(\"rightX\", sf::Keyboard::L, sf::Keyboard::J, VInputHandler::XAxis::Z);\n\tVGlobal::p()->Input->SetAxisInput(\"rightY\", sf::Keyboard::K, sf::Keyboard::I, VInputHandler::XAxis::V);\n\tVGlobal::p()->Input->SetAxisInput(\"LT\", sf::Keyboard::E, sf::Keyboard::Q, VInputHandler::XAxis::L);\n\tVGlobal::p()->Input->SetAxisInput(\"RT\", sf::Keyboard::O, sf::Keyboard::U, VInputHandler::XAxis::R);\n\tVGlobal::p()->Input->SetButtonInput(\"A\", sf::Keyboard::N, BUTTON_A);\n\tVGlobal::p()->Input->SetButtonInput(\"B\", sf::Keyboard::M, BUTTON_B);\n\tVGlobal::p()->Input->SetButtonInput(\"X\", sf::Keyboard::H, BUTTON_X);\n\tVGlobal::p()->Input->SetButtonInput(\"Y\", sf::Keyboard::J, BUTTON_Y);\n\tVGlobal::p()->Input->SetButtonInput(\"leftShoulder\", sf::Keyboard::T, BUTTON_LEFT_SHOULDER);\n\tVGlobal::p()->Input->SetButtonInput(\"rightShoulder\", sf::Keyboard::Y, BUTTON_RIGHT_SHOULDER);\n\tVGlobal::p()->Input->SetButtonInput(\"leftStick\", sf::Keyboard::B, BUTTON_LEFT_THUMB);\n\tVGlobal::p()->Input->SetButtonInput(\"rightStick\", sf::Keyboard::N, BUTTON_RIGHT_THUMB);\n\tVGlobal::p()->Input->SetButtonInput(\"Back\", sf::Keyboard::BackSpace, BUTTON_BACK);\n\tVGlobal::p()->Input->SetButtonInput(\"Start\", sf::Keyboard::Return, BUTTON_START);\n#elif defined(USE_SFML_JOYSTICK)\n\tVGlobal::p()->Input->SetAxisInput(\"leftX\", sf::Keyboard::D, sf::Keyboard::A, sf::Joystick::Axis::X);\n\tVGlobal::p()->Input->SetAxisInput(\"leftY\", sf::Keyboard::S, sf::Keyboard::W, sf::Joystick::Axis::Y);\n\tVGlobal::p()->Input->SetAxisInput(\"rightX\", sf::Keyboard::L, sf::Keyboard::J, sf::Joystick::Axis::U);\n\tVGlobal::p()->Input->SetAxisInput(\"rightY\", sf::Keyboard::K, sf::Keyboard::I, sf::Joystick::Axis::R);\n\tVGlobal::p()->Input->SetAxisInput(\"LT\", sf::Keyboard::E, sf::Keyboard::Q, sf::Joystick::Axis::Z);\n\tVGlobal::p()->Input->SetAxisInput(\"RT\", sf::Keyboard::O, sf::Keyboard::U, sf::Joystick::Axis::Z);\n\tVGlobal::p()->Input->SetButtonInput(\"A\", sf::Keyboard::N, VInputHandler::BUTTON_A);\n\tVGlobal::p()->Input->SetButtonInput(\"B\", sf::Keyboard::M, VInputHandler::BUTTON_B);\n\tVGlobal::p()->Input->SetButtonInput(\"X\", sf::Keyboard::H, VInputHandler::BUTTON_X);\n\tVGlobal::p()->Input->SetButtonInput(\"Y\", sf::Keyboard::J, VInputHandler::BUTTON_Y);\n\tVGlobal::p()->Input->SetButtonInput(\"leftShoulder\", sf::Keyboard::T, VInputHandler::BUTTON_LEFT_SHOULDER);\n\tVGlobal::p()->Input->SetButtonInput(\"rightShoulder\", sf::Keyboard::Y, VInputHandler::BUTTON_RIGHT_SHOULDER);\n\tVGlobal::p()->Input->SetButtonInput(\"leftStick\", sf::Keyboard::B, VInputHandler::BUTTON_LEFT_THUMB);\n\tVGlobal::p()->Input->SetButtonInput(\"rightStick\", sf::Keyboard::N, VInputHandler::BUTTON_RIGHT_THUMB);\n\tVGlobal::p()->Input->SetButtonInput(\"Back\", sf::Keyboard::BackSpace, VInputHandler::BUTTON_BACK);\n\tVGlobal::p()->Input->SetButtonInput(\"Start\", sf::Keyboard::Return, VInputHandler::BUTTON_START);\n\tVGlobal::p()->Input->SetButtonInput(\"Home\", sf::Keyboard::Home, VInputHandler::BUTTON_HOME);\n#else\n\tVGlobal::p()->Input->SetAxisInput(\"leftX\", sf::Keyboard::D, sf::Keyboard::A, sf::XInputDevice::XAxis::PovX);\n\tVGlobal::p()->Input->SetAxisInput(\"leftY\", sf::Keyboard::S, sf::Keyboard::W, sf::XInputDevice::XAxis::PovY);\n\tVGlobal::p()->Input->SetAxisInput(\"rightX\", sf::Keyboard::L, sf::Keyboard::J, sf::XInputDevice::XAxis::Z);\n\tVGlobal::p()->Input->SetAxisInput(\"rightY\", sf::Keyboard::K, sf::Keyboard::I, sf::XInputDevice::XAxis::V);\n\tVGlobal::p()->Input->SetAxisInput(\"LT\", sf::Keyboard::E, sf::Keyboard::Q, sf::XInputDevice::XAxis::L);\n\tVGlobal::p()->Input->SetAxisInput(\"RT\", sf::Keyboard::O, sf::Keyboard::U, sf::XInputDevice::XAxis::R);\n\tVGlobal::p()->Input->SetButtonInput(\"A\", sf::Keyboard::N, sf::XInputDevice::A);\n\tVGlobal::p()->Input->SetButtonInput(\"B\", sf::Keyboard::M, sf::XInputDevice::B);\n\tVGlobal::p()->Input->SetButtonInput(\"X\", sf::Keyboard::H, sf::XInputDevice::X);\n\tVGlobal::p()->Input->SetButtonInput(\"Y\", sf::Keyboard::J, sf::XInputDevice::Y);\n\tVGlobal::p()->Input->SetButtonInput(\"leftShoulder\", sf::Keyboard::T, sf::XInputDevice::LB);\n\tVGlobal::p()->Input->SetButtonInput(\"rightShoulder\", sf::Keyboard::Y, sf::XInputDevice::RB);\n\tVGlobal::p()->Input->SetButtonInput(\"leftStick\", sf::Keyboard::B, sf::XInputDevice::LEFT_THUMB);\n\tVGlobal::p()->Input->SetButtonInput(\"rightStick\", sf::Keyboard::N, sf::XInputDevice::RIGHT_THUMB);\n\tVGlobal::p()->Input->SetButtonInput(\"Back\", sf::Keyboard::BackSpace, sf::XInputDevice::BACK);\n\tVGlobal::p()->Input->SetButtonInput(\"Start\", sf::Keyboard::Return, sf::XInputDevice::START);\n#endif\n}\n\nvoid DemoStatesManager::Update(float dt)\n{\n\tVSUPERCLASS::Update(dt);\n\n#ifdef _DEBUG\n\tif (debugTimer->Seconds() > 1)\n\t{\n\t\tdebugMessages->Text = \"FPS: \" + std::to_string(static_cast<int>(1.0f \/ dt)) + \" - Objects: \" + std::to_string(VBase::DebugObjectCount);\n\t\tdebugMessages->ApplyChanges();\n\t\tdebugTimer->Restart();\n\t}\n#endif\n}\n\nvoid DemoStatesManager::HandleEvents(const sf::Event& event)\n{\n\tVSUPERCLASS::HandleEvents(event);\n\n\tif (event.type == sf::Event::KeyPressed)\n\t{\n\t\tif (!VGlobal::p()->Async->ActiveAsyncFunctions())\n\t\t{\n\t\t\tif (event.key.code == sf::Keyboard::Left)\n\t\t\t{\n\t\t\t\tCurrentPage--;\n\n\t\t\t\tif (CurrentPage < 0)\n\t\t\t\t\tCurrentPage = NUM_DEMOPAGES - 1;\n\n\t\t\t\tSetNewPage();\n\t\t\t}\n\n\t\t\tif (event.key.code == sf::Keyboard::Right)\n\t\t\t{\n\t\t\t\tCurrentPage++;\n\t\t\t\tCurrentPage %= NUM_DEMOPAGES;\n\n\t\t\t\tSetNewPage();\n\t\t\t}\n\t\t}\n\n#ifdef _DEBUG\n\t\tif (event.key.code == sf::Keyboard::Q)\n\t\t{\n\t\t\tVGlobal::p()->DrawDebug = !VGlobal::p()->DrawDebug;\n\t\t}\n#endif\n\n\t\tif (event.key.code == sf::Keyboard::E)\n\t\t{\n\t\t\tVGlobal::p()->Antialiasing = !VGlobal::p()->Antialiasing;\n\t\t}\n\n\t\tif (event.key.code == sf::Keyboard::F)\n\t\t{\n\t\t\tVGlobal::p()->ToggleFullscreen();\n\t\t}\n\t}\n}\n<|endoftext|>"} {"text":"<commit_before>#include <boost\/tokenizer.hpp>\n#include <iostream>\n#include <unistd.h>\n#include <string.h>\n#include <cstdlib>\n#include <errno.h>\n#include <stdio.h>\n#include <sys\/types.h>\n#include <sys\/wait.h>\n#include <string>\n#include <sstream>\n#include <vector>\n#include <sys\/stat.h>\n#include <fcntl.h>\n\nint oldstdin = dup(0);\nint oldstdout = dup(1);\nint oldstderr = dup(2);\n\nusing namespace std;\nusing namespace boost;\n\nvoid execvp(char **ye, int k) {\n\tye[k] = NULL;\n int pid = fork();\n if(pid == -1) {\n \t\tperror(\"fork\");\n exit(1);\n }\n if(pid == 0) {\n \tint r = execvp(ye[0], ye);\n if(r == -1) {\n perror(\"execvp\");\n exit(1);\n }\n }\n \telse {\n \tif(-1 == waitpid(pid, &pid, 0)) {\n perror(\"waitpid\");\n }\n }\n\n}\n\t\n\nvoid rshell(string &x) {\n\tchar *argv[9];\n\tint i = 0;\n\tstring going;\n\tstring saad;\n\tvector<string> arg_s;\t\n\ttypedef tokenizer< char_separator<char> > tokenizer;\n\tchar_separator<char> sep (\" \", \"<>>>\\\"#-;||&&\", drop_empty_tokens);\n\ttokenizer tokens(x, sep);\n\tfor(tokenizer::iterator tok_iter=tokens.begin(); tok_iter != tokens.end(); ++tok_iter) {\t\t\t if(saad == \"-\") {\n\t\t\tgoing += *tok_iter;\n\t\t\tgoing += \" \";\n\t\t \tsaad.append(*tok_iter);\n\t\t\targ_s.push_back(saad);\n\t\t\targv[i] = new char[12];\n\t\t\tstrcpy(argv[i], const_cast<char*>(saad.c_str()));\n\t\t\tif(*tok_iter == \"exit\")\n\t\t\t\texit(0);\n ++i;\n continue; \n \n\t\t }\n\n if(*tok_iter == \"-\") {\n saad = *tok_iter;\n\t\t\tgoing += *tok_iter;\n\t\t\tgoing += \" \";\n continue; \n }\n\n\t if(*tok_iter == \"#\") {\n\t\t\tbreak;\t\n\t\t }\n\n\t\t if(*tok_iter == \";\") {\n ++tok_iter;\n rshell(going);\n going.erase(0, going.find(*tok_iter, i));\n arg_s.clear();\n i = 0;\n argv[i] = new char[12];\n\t }\n\t\t\n\t\t if(*tok_iter == \"&\") {\n\t\t\t++tok_iter;\n\t\t\tif(*tok_iter == \"&\") {\n\t\t\t\t++tok_iter;\n\t\t\t\trshell(going);\n\t\t\t\tgoing.erase(0, going.find(*tok_iter, i));\n\t\t\t\targ_s.clear();\n\t\t\t\ti = 0;\n\t\t\t\targv[i] = new char[12];\n\t\t\t}\n\t\t }\n\n\t\t if(*tok_iter == \"<\") {\n\t\t\t++tok_iter;\n\t\t\t\n\t\t\tif(*tok_iter == \"<\") {\n\t\t\t\/\/\tgoing += *tok_iter;\n\t\t\t\t++tok_iter;\n\t\t\t\/\/\tgoing += *tok_iter;\n\t\t\t\tif(*tok_iter == \"<\") {\n\t\t\t\t\t\/\/EXTRA CREDIT 1 HERE!!!!!!!!!!!\n\t\t\t\t\/\/\t++tok_iter;\n\t\t\t\t\/\/\tgoing += *tok_iter;\n\t\t\t\t\/\/\tstring leggo;\n\t\t\t\t\/\/\tif(*tok_iter == \"\\\"\") {\n\t\t\t\t\/\/\t\t++tok_iter;\n\t\t\t\t\/\/\t\twhile(*tok_iter != \"\\\"\") {\n\t\t\t\t\/\/\t\t\tcout << *tok_iter << endl;\n\t\t\t\t\/\/\t\t\tleggo += *tok_iter;\n\t\t\t\t\/\/\t\t\tleggo += \" \";\n\t\t\t\t\/\/\t\t\t++tok_iter;\n\t\t\t\t\/\/\t\t}\n\t\t\t\t\/\/\t\tleggo += *tok_iter;\n\t\t\t\t\/\/\t\tgoing += \" \";\n\t\t\t\t\/\/\t\tgoing += leggo;\n\t\t\t\t\/\/\t}\n\t\t\t\t}\n\t\t\t}\n\t\t\tstring cake = *tok_iter;\n\t\t\tint fd = open(cake.c_str(), O_RDWR);\n\t\t\tif(fd == -1) {\n\t\t\t\tperror(\"open\");\n\t\t\t\texit(1);\n\t\t\t}\n\t\t\tint drag = dup2(fd, 0);\n\t\t\tif(drag == -1) {\n\t\t\t\tperror(\"dup2\");\n\t\t\t\texit(1);\n\t\t\t}\n\t\t\tcontinue;\n\t\t }\n\t\n\n\t\t if(*tok_iter == \">\") {\n\t\t\t++tok_iter;\n\t\t\tif(*tok_iter == \">\") {\n\t\t\t\t++tok_iter;\n\t\t\t\tstring swerve = *tok_iter;\n\t\t\t\tint fd2 = open(swerve.c_str(), O_RDWR|O_CREAT|O_APPEND, S_IRUSR|S_IWUSR);\n\t\t\t\tif(fd2 == -1) {\n\t\t\t\t\tperror(\"open\");\n\t\t\t\t\texit(1);\n\t\t\t\t}\n\t\t\t\tint grag = dup2(fd2, 1);\n\t\t\t\tif(grag == -1) {\n\t\t\t\t\tperror(\"dup2\");\n\t\t\t\t\texit(1);\n\t\t\t\t}\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t\telse {\t\n\t\t\t\tstring hold = *tok_iter;\n\t\t\t\tint fd = open(hold.c_str(), O_RDWR|O_CREAT|O_TRUNC, S_IRUSR | S_IWUSR);\n\t\t\t\tif(fd == -1) {\n\t\t\t\t\tperror(\"open\");\n\t\t\t\t\texit(1);\n\t\t\t\t}\n\t\t\t\tint drag = dup2(fd, 1);\n\t\t\t\tif(drag == -1) {\n\t\t\t\t\tperror(\"dup2\");\n\t\t\t\t\texit(1);\n\t\t\t\t}\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t }\n\n\t\t if(*tok_iter == \"|\") {\n\t\t\t++tok_iter;\n\t\t\tif(*tok_iter != \"|\") {\n\t\t\t\/\/piping\n\t\t\tint pipefd[2];\n\t\t\tpid_t cpid;\n\t\t\t\/\/char buf;\n\t\t\tif(pipe(pipefd) == -1) {\n\t\t\t\tperror(\"pipe\");\n\t\t\t\texit(1);\n\t\t\t}\n\t\t\tcpid = fork();\n\t\t\tif(cpid == -1) {\n\t\t\t\tperror(\"fork\");\n\t\t\t\texit(1);\n\t\t\t}\n\t\t\telse if(cpid == 0) {\n\t\t\t\tif(-1 == dup2(pipefd[1],1))\n\t\t\t\t{\n\t\t\t\t\tperror(\"dup2\");\n\t\t\t\t\texit(1);\n\t\t\t\t}\n\t\t\t\tif(-1 == close(pipefd[0]))\n\t\t\t\t{\n\t\t\t\t\tperror(\"close\");\n\t\t\t\t\texit(1);\n\t\t\t\t}\n\t\t\t\targv[i] = NULL;\n\t\t\t\tif(-1 == execvp(argv[0], argv))\n\t\t\t\t{\n\t\t\t\t\tperror(\"execvp\");\n\t\t\t\t}\n\t\t\t\texit(1);\n\t\t\t}\n\t\t\telse if(cpid > 0)\n\t\t\t{\n\t\t\t\tint savestdin;\n\t\t\t\tif(-1 == (savestdin = dup(0)))\n\t\t\t\t{\n\t\t\t\t\tperror(\"dup\");\n\t\t\t\t\texit(1);\n\t\t\t\t}\n\t\t\t\tif(-1 == dup2(pipefd[0], 0)) {\n\t\t\t\t\tperror(\"dup2\");\n\t\t\t\t\texit(1);\n\t\t\t\t}\n\t\t\t\tif(-1 == close(pipefd[1])) {\n\t\t\t\t\tperror(\"close\");\n\t\t\t\t\texit(1);\n\t\t\t\t}\n\t\t\t\tif(-1 == waitpid(cpid, &cpid, 0)) {\n\t\t\t\t\tperror(\"waitpid\");\n\t\t\t\t\texit(1);\n\t\t\t\t}\n\t\t\t\tchar *toby[9];\t\n\t\t\t\tint l = 0;\n\t\t\t\tvector<string> baby;\n\t\t\t\tstring mok;\n\t\t\t\tint kpid = fork();\n\t\t\t\tif(kpid == -1) {\n\t\t\t\t\tperror(\"fork\");\n\t\t\t\t\texit(1);\n\t\t\t\t}\n\t\t\t\telse if(kpid == 0) {\n\t\t\t\t\tif(-1 == dup2(pipefd[0], 0)) {\n\t\t\t\t\t\tperror(\"dup2\");\n\t\t\t\t\t\texit(1);\n\t\t\t\t\t}\n\t\t\t\t\tif(-1 == close(pipefd[1]))\n\t\t\t\t\t{\n\t\t\t\t\t\tperror(\"close\");\n\t\t\t\t\t\texit(1);\t\n\t\t\t\t\t}\n\t\t\t\t\twhile(tok_iter != tokens.end()) {\n\t\t\t\t\t\tif(*tok_iter == \"|\")\n\t\t\t\t\t\t\trshell(going);\n\t\n\t\t\t\t\t\tmok += *tok_iter;\n\t\t\t\t\t\tmok += \" \";\t\n\t\t\t\t\t\tbaby.push_back(*tok_iter);\n\t\t\t\t\t\ttoby[l] = new char[12];\n\t\t\t\t\t\tstrcpy(toby[i], const_cast<char*>(baby[l].c_str()));\n\t\t\t\t\t\tgoing += mok;\n\t\t\t\t\t\t\/\/APPEND TOBY TO ARGV SOMEHOW\n\t\t\t\t\t\t++l;\t\t\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\t\n\t\t\t\t\n\t\t\t}\n\t\t\t}\n\t\t\t\/\/end piping\t\n\n\t\t\tif(*tok_iter == \"|\") {\n\t\t\t\t++tok_iter;\n\t\t\t\trshell(going);\n\t\t\t\tgoing.erase(0, going.find(*tok_iter, i));\n\t\t\t\targ_s.clear();\n\t\t\t\ti = 0;\n\t\t\t\targv[i] = new char[12];\n\t\t\t}\t\n\t\t\n\t\t }\n\n\t\t going += *tok_iter;\n\t\t going += \" \";\n\n\t\t arg_s.push_back(*tok_iter);\n\t\t argv[i] = new char[12];\n\t \t strcpy(argv[i], const_cast<char*>(arg_s[i].c_str()));\n\t\t \n\t\t if(*tok_iter == \"exit\")\n\t\t\texit(0);\n\t\t\n\t\t ++i;\n\t\t\t\n\t}\n\t\n\texecvp(argv, i);\n\n\treturn;\t\n}\n\nint main()\n{\n\tstring args;\n\twhile(1 != 2)\n\t{\n\t\tcout << \"$ \";\n\t\tgetline(cin, args); \t\n\t\trshell(args);\n\t\t\n\t\tint ok = dup2(oldstdin, 0);\n\t\tif(ok == -1) {\n\t\t\tperror(\"dup2\");\n\t\t\texit(1);\n\t\t}\n\t\tint ok2 = dup2(oldstdout, 1);\n\t\tif(ok2 == -1) {\n\t\t\tperror(\"dup2\");\n\t\t\texit(1);\n\t\t}\n\t\tint ok3 = dup2(oldstderr, 2);\n\t\tif(ok3 == -1) {\n\t\t\tperror(\"dup2\");\n\t\t\texit(1);\n\t\t}\t\t\t\n\t} \n\t\n\treturn 0;\n}\n<commit_msg>rshell updated<commit_after>#include <boost\/tokenizer.hpp>\n#include <iostream>\n#include <unistd.h>\n#include <string.h>\n#include <cstdlib>\n#include <errno.h>\n#include <stdio.h>\n#include <sys\/types.h>\n#include <sys\/wait.h>\n#include <string>\n#include <sstream>\n#include <vector>\n#include <sys\/stat.h>\n#include <fcntl.h>\n\nint oldstdin = dup(0);\nint oldstdout = dup(1);\nint oldstderr = dup(2);\n\nusing namespace std;\nusing namespace boost;\n\nvoid execvp(char **ye, int k) {\n\tye[k] = NULL;\n int pid = fork();\n if(pid == -1) {\n \t\tperror(\"fork\");\n exit(1);\n }\n if(pid == 0) {\n \tint r = execvp(ye[0], ye);\n if(r == -1) {\n perror(\"execvp\");\n exit(1);\n }\n }\n \telse {\n \tif(-1 == waitpid(pid, &pid, 0)) {\n perror(\"waitpid\");\n }\n }\n\n}\n\t\n\nvoid rshell(string &x) {\n\tchar *argv[9];\n\tint i = 0;\n\tstring going;\n\tstring saad;\n\tvector<string> arg_s;\t\n\ttypedef tokenizer< char_separator<char> > tokenizer;\n\tchar_separator<char> sep (\" \", \"<>>>\\\"#-;||&&\", drop_empty_tokens);\n\ttokenizer tokens(x, sep);\n\tfor(tokenizer::iterator tok_iter=tokens.begin(); tok_iter != tokens.end(); ++tok_iter) {\t\t\t if(saad == \"-\") {\n\t\t\tgoing += *tok_iter;\n\t\t\tgoing += \" \";\n\t\t \tsaad.append(*tok_iter);\n\t\t\targ_s.push_back(saad);\n\t\t\targv[i] = new char[12];\n\t\t\tstrcpy(argv[i], const_cast<char*>(saad.c_str()));\n\t\t\tif(*tok_iter == \"exit\")\n\t\t\t\texit(0);\n ++i;\n continue; \n \n\t\t }\n\n if(*tok_iter == \"-\") {\n saad = *tok_iter;\n\t\t\tgoing += *tok_iter;\n\t\t\tgoing += \" \";\n continue; \n }\n\n\t if(*tok_iter == \"#\") {\n\t\t\tbreak;\t\n\t\t }\n\n\t\t if(*tok_iter == \";\") {\n ++tok_iter;\n rshell(going);\n going.erase(0, going.find(*tok_iter, i));\n arg_s.clear();\n i = 0;\n argv[i] = new char[12];\n\t }\n\t\t\n\t\t if(*tok_iter == \"&\") {\n\t\t\t++tok_iter;\n\t\t\tif(*tok_iter == \"&\") {\n\t\t\t\t++tok_iter;\n\t\t\t\trshell(going);\n\t\t\t\tgoing.erase(0, going.find(*tok_iter, i));\n\t\t\t\targ_s.clear();\n\t\t\t\ti = 0;\n\t\t\t\targv[i] = new char[12];\n\t\t\t}\n\t\t }\n\n\t\t if(*tok_iter == \"<\") {\n\t\t\t++tok_iter;\n\t\t\t\n\t\t\tif(*tok_iter == \"<\") {\n\t\t\t\/\/\tgoing += *tok_iter;\n\t\t\t\t++tok_iter;\n\t\t\t\/\/\tgoing += *tok_iter;\n\t\t\t\tif(*tok_iter == \"<\") {\n\t\t\t\t\t\/\/EXTRA CREDIT 1 HERE!!!!!!!!!!!\n\t\t\t\t\tstring blah = \"ok\";\n\t\t\t\t\tvoid *buf;\n\t\t\t\t\tint fd2 = creat(const_cast<char*>(blah.c_str()), S_IRWXU);\n\t\t\t\t\tif(fd2 == -1) {\n\t\t\t\t\t\tperror(\"creat\");\n\t\t\t\t\t\texit(1);\n\t\t\t\t\t} \n\t\t\t\t\t++tok_iter;\n\t\t\t\t\tgoing += *tok_iter;\n\t\t\t\t\tstring leggo;\n\t\t\t\t\tif(*tok_iter == \"\\\"\") {\n\t\t\t\t\t\t++tok_iter;\n\t\t\t\t\t\twhile(*tok_iter != \"\\\"\") {\n\t\t\t\t\t\t\tcout << *tok_iter << endl;\n\t\t\t\t\t\t\tleggo += *tok_iter;\n\t\t\t\t\t\t\tleggo += \" \";\n\t\t\t\t\t\t\t++tok_iter;\n\t\t\t\t\t\t}\n\t\t\t\t\t\tbuf = malloc(leggo.length());\n\t\t\t\t\t\t\/\/leggo += *tok_iter;\n\t\t\t\t\t\t\/\/going += \" \";\n\t\t\t\t\t\t\/\/going += leggo;\n\t\t\t\t\t\tint bag = write(fd2, buf, leggo.length());\n\t\t\t\t\t\tif(bag == -1) {\n\t\t\t\t\t\t\tperror(\"write\");\n\t\t\t\t\t\t\texit(1);\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t\tstring cake = *tok_iter;\n\t\t\tint savestdin;\n\t\t\tif(-1 == (savestdin = dup(0))) {\n\t\t\t\tperror(\"dup\");\n\t\t\t\texit(1);\n\t\t\t}\n\t\t\tint fd = open(cake.c_str(), O_RDWR);\n\t\t\tif(fd == -1) {\n\t\t\t\tperror(\"open\");\n\t\t\t\texit(1);\n\t\t\t}\n\t\t\tint drag = dup2(fd, 0);\n\t\t\tif(drag == -1) {\n\t\t\t\tperror(\"dup2\");\n\t\t\t\texit(1);\n\t\t\t}\n\t\t\t\/\/if(-1 == dup2(savestdin, 0))\n\t\t\t\/\/{\n\t\t\t\/\/\tperror(\"dup2\");\n\t\t\t\/\/\texit(1);\n\t\t\t\/\/}\n\t\t\tcontinue;\n\t\t }\n\t\n\n\t\t if(*tok_iter == \">\") {\n\t\t\t++tok_iter;\n\t\t\tif(*tok_iter == \">\") {\n\t\t\t\t++tok_iter;\n\t\t\t\tstring swerve = *tok_iter;\n\t\t\t\tint fd2 = open(swerve.c_str(), O_RDWR|O_CREAT|O_APPEND, S_IRUSR|S_IWUSR);\n\t\t\t\tif(fd2 == -1) {\n\t\t\t\t\tperror(\"open\");\n\t\t\t\t\texit(1);\n\t\t\t\t}\n\t\t\t\tint grag = dup2(fd2, 1);\n\t\t\t\tif(grag == -1) {\n\t\t\t\t\tperror(\"dup2\");\n\t\t\t\t\texit(1);\n\t\t\t\t}\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t\telse {\t\n\t\t\t\tstring hold = *tok_iter;\n\t\t\t\tint fd = open(hold.c_str(), O_RDWR|O_CREAT|O_TRUNC, S_IRUSR | S_IWUSR);\n\t\t\t\tif(fd == -1) {\n\t\t\t\t\tperror(\"open\");\n\t\t\t\t\texit(1);\n\t\t\t\t}\n\t\t\t\tint drag = dup2(fd, 1);\n\t\t\t\tif(drag == -1) {\n\t\t\t\t\tperror(\"dup2\");\n\t\t\t\t\texit(1);\n\t\t\t\t}\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t }\n\n\t\t if(*tok_iter == \"|\") {\n\t\t\t++tok_iter;\n\t\t\ttokenizer::iterator coward;\n\t\t\tif(*tok_iter != \"|\") {\n\t\t\t\/\/piping\n\t\t\tint pipefd[2];\n\t\t\tpid_t cpid;\n\t\t\t\/\/char buf;\n\t\t\tif(pipe(pipefd) == -1) {\n\t\t\t\tperror(\"pipe\");\n\t\t\t\texit(1);\n\t\t\t}\n\t\t\tcpid = fork();\n\t\t\tif(cpid == -1) {\n\t\t\t\tperror(\"fork\");\n\t\t\t\texit(1);\n\t\t\t}\n\t\t\telse if(cpid == 0) {\n\t\t\t\tif(-1 == dup2(pipefd[1],1))\n\t\t\t\t{\n\t\t\t\t\tperror(\"dup2\");\n\t\t\t\t\texit(1);\n\t\t\t\t}\n\t\t\t\tif(-1 == close(pipefd[0]))\n\t\t\t\t{\n\t\t\t\t\tperror(\"close\");\n\t\t\t\t\texit(1);\n\t\t\t\t}\n\t\t\t\targv[i] = NULL;\n\t\t\t\tif(-1 == execvp(argv[0], argv))\n\t\t\t\t{\n\t\t\t\t\tperror(\"execvp\");\n\t\t\t\t}\n\t\t\t\texit(1);\n\t\t\t}\n\t\t\telse if(cpid > 0)\n\t\t\t{\n\t\t\t\tint savestdin;\n\t\t\t\tif(-1 == (savestdin = dup(0)))\n\t\t\t\t{\n\t\t\t\t\tperror(\"dup\");\n\t\t\t\t\texit(1);\n\t\t\t\t}\n\t\t\t\tif(-1 == dup2(pipefd[0], 0)) {\n\t\t\t\t\tperror(\"dup2\");\n\t\t\t\t\texit(1);\n\t\t\t\t}\n\t\t\t\tif(-1 == close(pipefd[1])) {\n\t\t\t\t\tperror(\"close\");\n\t\t\t\t\texit(1);\n\t\t\t\t}\n\t\t\t\tif(-1 == waitpid(cpid, &cpid, 0)) {\n\t\t\t\t\tperror(\"waitpid\");\n\t\t\t\t\texit(1);\n\t\t\t\t}\n\t\t\t\tint pipefd2[2];\n\t\t\t\tpid_t cpid2;\n\t\t\t\tif(pipe(pipefd2) == -1) {\n\t\t\t\t\tperror(\"pipe\");\n\t\t\t\t\texit(1);\n\t\t\t\t}\n\t\t\t\tcpid2 = fork();\n\t\t\t\tif(cpid2 == -1) {\n\t\t\t\t\tperror(\"fork\");\n\t\t\t\t\texit(1);\n\t\t\t\t}\n\t\t\t\telse if(cpid2 == 0) {\n\t\t\t\t\tif(-1 == dup2(pipefd2[0], 0))\n\t\t\t\t\t{\n\t\t\t\t\t\tperror(\"dup2\");\n\t\t\t\t\t\texit(1);\n\t\t\t\t\t}\n\t\t\t\t\tif(-1 == close(pipefd2[1])) \n\t\t\t\t\t{\n\t\t\t\t\t\tperror(\"close\");\n\t\t\t\t\t\texit(1);\n\t\t\t\t\t}\n\t\t\t\t\tcoward = tok_iter;\n\t\t\t\t\tchar *toby[9];\n\t\t\t\t\tint l = 0;\n\t\t\t\t\tvector<string> baby;\n\t\t\t\t\tstring mok;\n\t\t\t\t\twhile(tok_iter != tokens.end()) {\n\t\t\t\t\t\tif(*tok_iter == \"|\")\n\t\t\t\t\t\t\trshell(going);\n\n\t\t\t\t\t\tmok += *tok_iter;\n\t\t\t\t\t\tmok += \" \";\n\t\t\t\t\t\tbaby.push_back(*tok_iter);\n\t\t\t\t\t\ttoby[l] = new char [12];\n\t\t\t\t\t\tstrcpy(toby[l], const_cast<char*>(baby[l].c_str()));\n\t\t\t\t\t\tgoing += mok;\n\t\t\t\t\t\t++l;\n\t\t\t\t\t}\n\t\t\t\t\ttoby[l] = NULL;\n\t\t\t\t\tif(-1 == execvp(toby[0], toby))\t\n\t\t\t\t\t\tperror(\"execvp\");\n\t\t\t\t\t\n\t\t\t\t\texit(1);\n\t\t\t\t}\n\t\t\t\telse if(cpid > 0) {\n\t\t\t\t\tint savestdout;\n\t\t\t\t\tif(-1 == (savestdout = dup(1)))\n\t\t\t\t\t{\n\t\t\t\t\t\tperror(\"dup\");\n\t\t\t\t\t\texit(1);\n\t\t\t\t\t}\n\t\t\t\t\tif(-1 == dup2(pipefd2[1], 1)) {\n\t\t\t\t\t\tperror(\"dup2\");\n\t\t\t\t\t\texit(1);\n\t\t\t\t\t}\n\t\t\t\t\tif(-1 == close(pipefd2[0])) {\n\t\t\t\t\t\tperror(\"close\");\n\t\t\t\t\t\texit(1);\n\t\t\t\t\t}\n\t\t\t\t\tif(-1 == waitpid(cpid2, &cpid2, 0)) {\n\t\t\t\t\t\tperror(\"waitpid\");\n\t\t\t\t\t\texit(1);\n\t\t\t\t\t}\n\t\t\t\t\tif(-1 == dup2(savestdout, 1))\n\t\t\t\t\t\tperror(\"dup2\");\n\t\t\t\t}\n\t\t\t\t\tif(-1 == dup2(savestdin, 0))\n\t\t\t\t\t\tperror(\"dup2\");\n\t\t\t\t}\n\t\t\t\t\/*\n\t\t\t\tcoward = tok_iter;\n\t\t\t\tchar *toby[9];\t\n\t\t\t\tint l = 0;\n\t\t\t\tvector<string> baby;\n\t\t\t\tstring mok;\n\t\t\t\tint kpid = fork();\n\t\t\t\tif(kpid == -1) {\n\t\t\t\t\tperror(\"fork\");\n\t\t\t\t\texit(1);\n\t\t\t\t}\n\t\t\t\telse if(kpid == 0) {\n\t\t\t\t\tif(-1 == dup2(pipefd[0], 0)) {\n\t\t\t\t\t\tperror(\"dup2\");\n\t\t\t\t\t\texit(1);\n\t\t\t\t\t}\n\t\t\t\t\t\/\/if(-1 == close(pipefd[1]))\n\t\t\t\t\t\/\/{\n\t\t\t\t\t\/\/\tperror(\"close\");\n\t\t\t\t\t\/\/\texit(1);\t\n\t\t\t\t\t\/\/}\n\t\t\t\t\twhile(tok_iter != tokens.end()) {\n\t\t\t\t\t\tif(*tok_iter == \"|\")\n\t\t\t\t\t\t\trshell(going);\n\t\n\t\t\t\t\t\tmok += *tok_iter;\n\t\t\t\t\t\tmok += \" \";\t\n\t\t\t\t\t\tbaby.push_back(*tok_iter);\n\t\t\t\t\t\ttoby[l] = new char[12];\n\t\t\t\t\t\tstrcpy(toby[i], const_cast<char*>(baby[l].c_str()));\n\t\t\t\t\t\tgoing += mok;\n\t\t\t\t\t\t\/\/APPEND TOBY TO ARGV SOMEHOW\n\t\t\t\t\t\t++l;\t\t\n\t\t\t\t\t}\n\t\t\t\t\ttoby[l] = NULL;\n\t\t\t\t\tif(-1 == execvp(toby[0], toby)) {\n\t\t\t\t\t\tperror(\"execvp\");\n\t\t\t\t\t}\n\t\t\t\t\texit(1);\n\t\t\t\t}\n\t\t\t\telse if(kpid > 0) {\n\t\t\t\t\tif(-1 == waitpid(kpid, &kpid, 0)) {\n\t\t\t\t\t\tperror(\"waitpid\");\n\t\t\t\t\t\texit(1);\n\t\t\t\t\t}\n\t\t\t\t}\t\t\t\t\n\t\t\t\t\n\t\t\t\ttok_iter = coward;\n\t\t\t\t\n\t\t\t\tif(-1 == dup2(savestdin, 0)) {\n\t\t\t\t\tperror(\"dup2\");\n\t\t\t\t\texit(1);\n\t\t\t\t}\n\t\t\t\t}\n\t\t\t\tcontinue;\n\t\t\t\t*\/\n\t\t\t}\n\t\t\t\/\/end piping\t\n\n\t\t\tif(*tok_iter == \"|\") {\n\t\t\t\t++tok_iter;\n\t\t\t\trshell(going);\n\t\t\t\tgoing.erase(0, going.find(*tok_iter, i));\n\t\t\t\targ_s.clear();\n\t\t\t\ti = 0;\n\t\t\t\targv[i] = new char[12];\n\t\t\t}\t\n\t\t\n\t\t }\n\n\t\t going += *tok_iter;\n\t\t going += \" \";\n\n\t\t arg_s.push_back(*tok_iter);\n\t\t argv[i] = new char[12];\n\t \t strcpy(argv[i], const_cast<char*>(arg_s[i].c_str()));\n\t\t \n\t\t if(*tok_iter == \"exit\")\n\t\t\texit(0);\n\t\t\n\t\t ++i;\n\t\t\t\n\t}\n\t\n\texecvp(argv, i);\n\n\treturn;\t\n}\n\nint main()\n{\n\tstring args;\n\twhile(1 != 2)\n\t{\n\t\tcout << \"$ \";\n\t\tgetline(cin, args); \t\n\t\trshell(args);\n\t\t\n\t\tint ok = dup2(oldstdin, 0);\n\t\tif(ok == -1) {\n\t\t\tperror(\"dup2\");\n\t\t\texit(1);\n\t\t}\n\t\tint ok2 = dup2(oldstdout, 1);\n\t\tif(ok2 == -1) {\n\t\t\tperror(\"dup2\");\n\t\t\texit(1);\n\t\t}\n\t\tint ok3 = dup2(oldstderr, 2);\n\t\tif(ok3 == -1) {\n\t\t\tperror(\"dup2\");\n\t\t\texit(1);\n\t\t}\t\t\t\n\t} \n\t\n\treturn 0;\n}\n<|endoftext|>"} {"text":"<commit_before>#include<iostream>\n#include<sys\/stat.h>\n#include<fcntl.h>\n#include<pwd.h>\n#include<sstream>\n#include<stdio.h>\n#include<boost\/tokenizer.hpp>\n#include<errno.h>\n#include<string>\n#include<stdlib.h>\n#include<string.h>\n#include<sys\/types.h>\n#include<sys\/wait.h>\n#include<sys\/unistd.h>\n\nusing namespace std;\nusing namespace boost;\n\ntypedef tokenizer<char_separator<char> > Tok;\n\nchar directory[1024];\nstring cwd = \"\";\n\nvoid readCommands(string str);\nint conjunct(int n, stringstream& ss, const Tok::iterator &it, bool didExtra = false);\nvoid skipCommand(Tok::iterator &it, Tok &tokens);\nvoid splitString(char** args, stringstream& ss, int n);\nbool ioRedir(const Tok::iterator &it, bool inRedir, bool append);\nvoid resetIO(int in0, int out1);\nvoid pipeRedir(int fd[], int fdLoop[], bool pipeOut, bool isFirst, bool isLast, int n, stringstream& ss, const Tok::iterator &it, bool didRedir);\nstring findPath(string file);\n\nint main(){\n cout << endl;\n string str = \"\";\n struct passwd *pass;\n\n bool hasDirectory = true;\n\n if((getcwd(directory, 1024)) == NULL){\n perror(\"getcwd\");\n hasDirectory = false;\n }\n \n pass = getpwuid(getuid());\n if(pass == NULL){\n perror(\"getpwuid()\");\n }\n\n char* usrname = pass->pw_name;\n char hostname[128];\n \n int success = gethostname(hostname, sizeof hostname);\n if(success == -1){\n perror(\"gethostname()\");\n }\n \n string userinfo = \"\";\n string username = \"\";\n\n if(usrname != NULL && success == 0){\n username = usrname;\n userinfo = username + \"@\" + hostname;\n }\n\n if(hasDirectory){\n cwd = directory;\n cwd = \":\" + cwd;\n }\n\n bool notExited = true;\n\n while(notExited){\n cout << userinfo << cwd << \"$ \";\n getline(cin, str);\n readCommands(str);\n }\n\n return 0;\n}\n\nvoid readCommands(string str){\n\n char_separator<char> sep(\"\\\" \", \";#|&<>\");\n\n Tok tokens(str, sep);\n stringstream ss;\n int in0;\n int out1;\n int fd[2];\n int fdLoop[2];\n bool pipeOut = false; bool isFirst = true;\n bool didRedir = false;\n bool didPipe = false; bool didExtra = false;\n int n = 0;\n\n if((in0 = dup(0)) == -1){\n perror(\"input-0\");\n return;\n }\n\n if((out1 = dup(1)) == -1){\n perror(\"output-1\");\n return;\n }\n\n if((pipe(fd)) == -1){\n perror(\"pipe\");\n exit(-1);\n }\n\n for(Tok::iterator it = tokens.begin(); it != tokens.end(); it++){\n \n begin:\n\n if(*it == \";\"){\n conjunct(n, ss, it);\n n = 0;\n it++;\n if(it == tokens.end()) break;\n }\n else if(*it == \"&\"){\n if(conjunct(n, ss, it) == -1){\n skipCommand(it, tokens);\n }\n n = 0;\n if(it == tokens.end()) break;\n it++;\n if(it == tokens.end()) break;\n }\n else if(*it == \"|\"){\n Tok::iterator copy = it;\n copy++;\n\n if(copy == tokens.end() || *copy == \";\" || *copy == \"&\"){\n conjunct(0, ss, it);\n skipCommand(it, tokens);\n return;\n }\n\n if(*copy == \"|\"){\n copy++;\n if(copy == tokens.end() || *copy == \";\" || *copy == \"&\"){\n conjunct(0, ss, it);\n skipCommand(it, tokens);\n return;\n }\n\n if(conjunct(n, ss, it) != -1){\n skipCommand(it, tokens);\n }\n } \n else{\n\/\/TODO piping\n didPipe = true;\n\n (!pipeOut) ? pipeOut = true : pipeOut = false;\n\n pipeRedir(fd, fdLoop, pipeOut, isFirst, false, n, ss, it, didRedir);\n isFirst = false;\n\n n = 0;\n continue;\n }\n\n n = 0;\n if(it == tokens.end()) break;\n it++;\n }\n else if(*it == \"<\" || *it == \">\"){\n bool append = false;\n\nanother:\n Tok::iterator check = it;\n check++;\n bool inRedir = false;\n bool stringRedir = false;\n \n \n if(check != tokens.end() && *check == \">\"){\n append = true;\n it++;\n goto here;\n }\n\n if(*it == \"<\"){\n inRedir = true;\n Tok::iterator copy = it;\n int i;\n for(i = 0; i < 2; i++){\n copy++;\n if(copy == tokens.end() || *copy != \"<\") break;\n }\n\n if(i == 2 && copy != tokens.end() && *copy != \";\" && *copy != \"|\" && *copy != \"&\"){\n stringRedir = true;\n }\n }\n\n if(stringRedir){\n didExtra = true;\n it++; it++; it++;\n string redirString = \"\";\n\n while(it != tokens.end() && *it != \";\" && *it != \"|\" && *it != \"&\"){\n redirString += (*it + \" \"); \n it++;\n }\n\n if(write(0, (char*) redirString.c_str(), redirString.size() + 1) == -1){\n perror(\"write to extra\");\n return;\n }\n\n if(it == tokens.end()){\n break;\n }\n else{\n goto begin;\n }\n\n }\nhere:\n it++;\n\n if(it == tokens.end()){\n cerr << \"Bash: syntax error near unexpected token \\'newline\\'\" << endl;\n exit(-1);\n }\n\n if(!ioRedir(it, inRedir, append)) return;\n\n didRedir = true;\n\n Tok::iterator copy = it;\n copy++;\n\n if(copy == tokens.end()) break;\n\n if(*copy == \">\" || *copy == \"<\"){\n it++;\n goto another;\n }\n\n continue;\n }\n\n if(*it == \"#\"){\n if(didPipe){\n (!pipeOut) ? pipeOut = true : pipeOut = false;\n pipeRedir(fd, fdLoop, pipeOut, isFirst, true, n, ss, it, didRedir);\n return;\n }\n\n conjunct(n, ss, it);\n\n if(didRedir){\n resetIO(in0, out1);\n }\n return;\n }\n\n if(*it != \"&\" && *it != \"|\"){\n ss << *it;\n ss << \" \";\n n++;\n }\n }\n \/\/TODO piping\n if(n > 0){\n Tok::iterator it = tokens.begin();\n if(didPipe){\n (!pipeOut) ? pipeOut = true : pipeOut = false;\n pipeRedir(fd, fdLoop, pipeOut, isFirst, true, n, ss, it, didRedir);\n }\n else{\n conjunct(n, ss, it, didExtra);\n }\n }\n\n if(didRedir){\n resetIO(in0, out1);\n }\n}\n\nint conjunct(int n, stringstream& ss, const Tok::iterator &it, bool didExtra){\n\n int status;\n\n if(n == 0 && *it != \"#\"){\n cerr << \"Bash: syntax error near unexpected token \\'\" << *it << \"\\'\" << endl;\n return -1;\n }\n else if(n == 0 && *it == \"#\") return 0; \n char** args = new char*[n + 1];\n\n splitString(args, ss, n);\n\n if(strcmp(args[0], \"cd\") == 0){\n if(n <= 1){\n\n string home;\n\n if((home = getenv(\"HOME\")) == \"\"){\n perror(\"getenv\");\n }\n \n if(chdir((char*) home.c_str()) == -1){\n perror(\"chdir\");\n return -1;\n }\n\n if((getcwd(directory, 1024)) == NULL){\n perror(\"getcwd\");\n }\n else{\n cwd = directory;\n cwd = \":\" + cwd;\n }\n }\n else{\n if(chdir(args[1]) == -1){\n perror(\"chdir\");\n return -1;\n }\n\n if((getcwd(directory, 1024)) == NULL){\n perror(\"getcwd\");\n }\n else{\n cwd = directory;\n cwd = \":\" + cwd;\n }\n }\n }\n else{\n\n int pid = fork();\n\n if(pid == -1){\n perror(\"There was an error with the fork().\");\n exit(1);\n }\n else if(pid == 0){\n if(-1 == execv((const char*) args[0], (char* const*) args)){\n perror(args[0]);\n exit(3);\n }\n }\n else if(pid > 0){\n\n if(-1 == wait(&status)){\n perror(\"There was an error with wait().\");\n return -1;\n }\n\n if(WIFEXITED(status)){\n if(WEXITSTATUS(status) == 3){\n delete[] args;\n return -1;\n }\n }\n }\n }\n\n delete[] args;\n\n return 0;\n}\n\nbool ioRedir(const Tok::iterator &it, bool inRedir, bool append){\n\n if(*it == \"&\" || *it == \"|\" || *it == \";\"){\n cerr << \"Bash: syntax error near unexpected token \\'\" << *it << \"\\'\" << endl;\n return false;\n }\n\n if(inRedir){\n string input = *it;\n\n int fdi;\n\n if((fdi = open((char*) input.c_str(), O_RDONLY)) == -1){\n perror(\"open input\");\n return false;\n }\n\n if(close(0) == -1){\n perror(\"close input\");\n exit(-1);\n }\n\n if(dup(fdi) == -1){\n perror(\"dup input\");\n exit(-1);\n }\n return true;\n }\n else{\n string output = *it;\n\n int fdo;\n mode_t readWrite = S_IRUSR | S_IWUSR | S_IRGRP | S_IWGRP | S_IROTH | S_IWOTH;\n\n if(append){\n if((fdo = open((char*) output.c_str(), O_RDWR | O_CREAT | O_APPEND, readWrite)) == -1){\n perror(\"open output\");\n exit(-1);\n }\n }\n else{\n if((fdo = open((char*) output.c_str(), O_RDWR | O_CREAT | O_TRUNC, readWrite)) == -1){\n perror(\"open output append\");\n exit(-1);\n }\n }\n\n if(close(1) == -1){\n perror(\"close output\");\n exit(-1);\n }\n\n if(dup(fdo) == -1){\n perror(\"dup output\");\n exit(-1);\n }\n }\n\n return true;\n}\n\nvoid resetIO(int in0, int out1){\n\n if(dup2(in0, 0) == -1){\n perror(\"dup input - 0\");\n exit(-1);\n }\n\n if(dup2(out1, 1) == -1){\n perror(\"dup output - 1\");\n exit(-1);\n }\n}\n\n\/\/TODO piping\nvoid pipeRedir(int fd[], int fdLoop[], bool pipeOut, bool isFirst, bool isLast, int n, stringstream& ss, const Tok::iterator& it, bool didRedir){\n\n int status;\n\n if(n == 0 && *it != \"#\"){\n cerr << \"Bash: syntax error near unexpected token \\'\" << *it << \"\\'\" << endl;\n return;\n }\n else if(n == 0 && *it == \"#\") return; \n char** args = new char*[n + 1];\n\n splitString(args, ss, n);\n\n if(pipeOut){\n int pid;\n\n if(!isFirst){\n if(pipe(fd) == -1){\n perror(\"repipe fd in input\");\n exit(-1);\n }\n }\n\n if((pid = fork()) == -1){\n perror(\"fork in pipe\");\n exit(-1);\n }\n\n if(pid == 0){\n if(isFirst){\n if(close(fd[0]) == -1){\n perror(\"close in pipe\");\n exit(-1);\n }\n }\n\n if(!isFirst){\n if(dup2(fdLoop[0], 0) == -1){\n perror(\"dup2 fdLoop in input\");\n exit(-1);\n }\n }\n\n if(!isLast){\n if(dup2(fd[1], 1) == -1){\n perror(\"dup2 in pipe\");\n exit(-1);\n }\n }\n \/\/TODO execute command here\n\n if(-1 == execv((const char*) args[0], (char* const*) args)){\n perror(\"execv in pipe\");\n exit(-1);\n }\n }\n else{\n if(wait(&status) == -1){\n perror(\"wait in pipe\");\n exit(-1);\n }\n\n if(close(fd[1]) == -1){\n perror(\"close in pipe parent\");\n exit(-1);\n }\n\n if(!isFirst){\n if(close(fdLoop[0]) == -1){\n perror(\"close fdLoop in input\");\n exit(-1);\n }\n }\n\n if(WIFEXITED(status)){\n if(WEXITSTATUS(status) == 3){\n exit(-1);\n }\n }\n\n }\n }\n else{\n int pid;\n if(!isLast){\n if(pipe(fdLoop) == -1){\n perror(\"fdLoop in output\");\n exit(-1);\n }\n }\n\n if((pid = fork()) == -1){\n perror(\"fork#2 in pipe\");\n exit(-1);\n }\n\n if(pid == 0){\n\n if(dup2(fd[0], 0) == -1){\n perror(\"dup2 #2 in pipe\");\n exit(-1);\n }\n\n \/\/TODO execute command here\n\n if(!isLast){\n if(dup2(fdLoop[1], 1) == -1){\n perror(\"dup2 loop in output\");\n exit(-1);\n }\n }\n\n if(-1 == execv((const char*) args[0], (char* const*) args)){\n perror(\"execv in pipe\");\n exit(-1);\n }\n\n }\n else{\n\n if(wait(&status) == -1){\n perror(\"wait #2 in pipe\");\n exit(-1);\n }\n\n if(close(fd[0]) == -1){\n perror(\"close #2 in pipe parent\");\n exit(-1);\n }\n\n if(!isLast){\n if(close(fdLoop[1]) == -1){\n perror(\"close fdLoop in output\");\n exit(-1);\n }\n }\n if(WIFEXITED(status)){\n if(WEXITSTATUS(status) == 3){\n exit(-1);\n }\n }\n }\n }\n}\n\nvoid skipCommand(Tok::iterator &it, Tok &tokens){\n while(it != tokens.end() && *it != \";\"){\n it++;\n }\n}\n\nvoid splitString(char** args, stringstream& ss, int n){\n\n string *str = new string[n];\n\n for(int i = 0; i < n; i++){\n\n ss >> str[i];\n\n if(str[i] != \"cd\" && i == 0){\n str[i] = findPath(str[i]); \n }\n\n args[i] = (char*) str[i].c_str();\n }\n\n args[n] = NULL;\n\n char exitC[] = \"exit\";\n\n if(strcmp(args[0], exitC) == 0){\n cout << endl;\n exit(0);\n }\n\n delete[] str;\n}\n\nstring findPath(string file){\n string env = \"\";\n\n if((env = getenv(\"PATH\")) == \"\"){\n perror(\"getenv findPath\");\n exit(-1);\n }\n\n string dir = \"\";\n string path = \"\";\n struct stat buf;\n\n int i;\n\n while((i = env.find(\":\")) != -1){\n dir = env.substr(0, i);\n\n env = env.substr(i + 1, env.size());\n\n if(stat((dir + \"\/\" + file).c_str(), &buf) != -1){\n path = dir + \"\/\" + file;\n }\n }\n\n return path;\n}\n<commit_msg>Finished requirements for assignment<commit_after>#include<iostream>\n#include<sys\/stat.h>\n#include<fcntl.h>\n#include<pwd.h>\n#include<sstream>\n#include<stdio.h>\n#include<boost\/tokenizer.hpp>\n#include<errno.h>\n#include<string>\n#include<stdlib.h>\n#include<string.h>\n#include<sys\/types.h>\n#include<sys\/wait.h>\n#include<sys\/unistd.h>\n\nusing namespace std;\nusing namespace boost;\n\ntypedef tokenizer<char_separator<char> > Tok;\n\nchar directory[1024];\nstring cwd = \"\";\nstring userinfo = \"\";\nbool mainPar = true;\n\nvoid interrupt(int sig){\n\n if(mainPar){\n\n cout << endl;\n cout << userinfo << cwd << \"$ \" << flush;\n }\n else{\n cout << endl;\n }\n}\n\nvoid readCommands(string str);\nint conjunct(int n, stringstream& ss, const Tok::iterator &it, bool didExtra = false);\nvoid skipCommand(Tok::iterator &it, Tok &tokens);\nvoid splitString(char** args, stringstream& ss, int n);\nbool ioRedir(const Tok::iterator &it, bool inRedir, bool append);\nvoid resetIO(int in0, int out1);\nvoid pipeRedir(int fd[], int fdLoop[], bool pipeOut, bool isFirst, bool isLast, int n, stringstream& ss, const Tok::iterator &it, bool didRedir);\nstring findPath(string file);\n\nint main(){\n cout << endl;\n string str = \"\";\n struct passwd *pass;\n\n if(signal(SIGINT, interrupt) == SIG_ERR){\n perror(\"signal\");\n exit(-1);\n }\n\n bool hasDirectory = true;\n\n if((getcwd(directory, 1024)) == NULL){\n perror(\"getcwd\");\n hasDirectory = false;\n }\n\n pass = getpwuid(getuid());\n if(pass == NULL){\n perror(\"getpwuid()\");\n }\n\n char* usrname = pass->pw_name;\n char hostname[128];\n\n int success = gethostname(hostname, sizeof hostname);\n if(success == -1){\n perror(\"gethostname()\");\n }\n\n string username = \"\";\n\n if(usrname != NULL && success == 0){\n username = usrname;\n userinfo = username + \"@\" + hostname;\n }\n\n if(hasDirectory){\n string home = \"\";\n cwd = directory;\n cwd = \":\" + cwd;\n if((home = getenv(\"HOME\")) != \"\"){\n cwd.replace(0, home.size() + 1, \":~\");\n }\n else{\n perror(\"getenv\");\n }\n }\n\n bool notExited = true;\n\n while(notExited){\n cout << userinfo << cwd << \"$ \";\n getline(cin, str);\n readCommands(str);\n mainPar = true;\n }\n\n return 0;\n}\n\nvoid readCommands(string str){\n\n char_separator<char> sep(\"\\\" \", \";#|&<>\");\n\n Tok tokens(str, sep);\n stringstream ss;\n int in0;\n int out1;\n int fd[2];\n int fdLoop[2];\n bool pipeOut = false; bool isFirst = true;\n bool didRedir = false;\n bool didPipe = false; bool didExtra = false;\n int n = 0;\n\n if((in0 = dup(0)) == -1){\n perror(\"input-0\");\n return;\n }\n\n if((out1 = dup(1)) == -1){\n perror(\"output-1\");\n return;\n }\n\n if((pipe(fd)) == -1){\n perror(\"pipe\");\n exit(-1);\n }\n\n for(Tok::iterator it = tokens.begin(); it != tokens.end(); it++){\n mainPar = false;\n\nbegin:\n\n if(*it == \";\"){\n conjunct(n, ss, it);\n n = 0;\n it++;\n if(it == tokens.end()) break;\n }\n else if(*it == \"&\"){\n if(conjunct(n, ss, it) == -1){\n skipCommand(it, tokens);\n }\n n = 0;\n if(it == tokens.end()) break;\n it++;\n if(it == tokens.end()) break;\n }\n else if(*it == \"|\"){\n Tok::iterator copy = it;\n copy++;\n\n if(copy == tokens.end() || *copy == \";\" || *copy == \"&\"){\n conjunct(0, ss, it);\n skipCommand(it, tokens);\n return;\n }\n\n if(*copy == \"|\"){\n copy++;\n if(copy == tokens.end() || *copy == \";\" || *copy == \"&\"){\n conjunct(0, ss, it);\n skipCommand(it, tokens);\n return;\n }\n\n if(conjunct(n, ss, it) != -1){\n skipCommand(it, tokens);\n }\n } \n else{\n \/\/TODO piping\n didPipe = true;\n\n (!pipeOut) ? pipeOut = true : pipeOut = false;\n\n pipeRedir(fd, fdLoop, pipeOut, isFirst, false, n, ss, it, didRedir);\n isFirst = false;\n\n n = 0;\n continue;\n }\n\n n = 0;\n if(it == tokens.end()) break;\n it++;\n }\n else if(*it == \"<\" || *it == \">\"){\n bool append = false;\n\nanother:\n Tok::iterator check = it;\n check++;\n bool inRedir = false;\n bool stringRedir = false;\n\n\n if(check != tokens.end() && *check == \">\"){\n append = true;\n it++;\n goto here;\n }\n\n if(*it == \"<\"){\n inRedir = true;\n Tok::iterator copy = it;\n int i;\n for(i = 0; i < 2; i++){\n copy++;\n if(copy == tokens.end() || *copy != \"<\") break;\n }\n\n if(i == 2 && copy != tokens.end() && *copy != \";\" && *copy != \"|\" && *copy != \"&\"){\n stringRedir = true;\n }\n }\n\n if(stringRedir){\n didExtra = true;\n it++; it++; it++;\n string redirString = \"\";\n\n while(it != tokens.end() && *it != \";\" && *it != \"|\" && *it != \"&\"){\n redirString += (*it + \" \"); \n it++;\n }\n\n if(write(0, (char*) redirString.c_str(), redirString.size() + 1) == -1){\n perror(\"write to extra\");\n return;\n }\n\n if(it == tokens.end()){\n break;\n }\n else{\n goto begin;\n }\n\n }\nhere:\n it++;\n\n if(it == tokens.end()){\n cerr << \"Bash: syntax error near unexpected token \\'newline\\'\" << endl;\n exit(-1);\n }\n\n if(!ioRedir(it, inRedir, append)) return;\n\n didRedir = true;\n\n Tok::iterator copy = it;\n copy++;\n\n if(copy == tokens.end()) break;\n\n if(*copy == \">\" || *copy == \"<\"){\n it++;\n goto another;\n }\n\n continue;\n }\n\n if(*it == \"#\"){\n if(didPipe){\n (!pipeOut) ? pipeOut = true : pipeOut = false;\n pipeRedir(fd, fdLoop, pipeOut, isFirst, true, n, ss, it, didRedir);\n return;\n }\n\n conjunct(n, ss, it);\n\n if(didRedir){\n resetIO(in0, out1);\n }\n return;\n }\n\n if(*it != \"&\" && *it != \"|\"){\n ss << *it;\n ss << \" \";\n n++;\n }\n }\n \/\/TODO piping\n if(n > 0){\n Tok::iterator it = tokens.begin();\n if(didPipe){\n (!pipeOut) ? pipeOut = true : pipeOut = false;\n pipeRedir(fd, fdLoop, pipeOut, isFirst, true, n, ss, it, didRedir);\n }\n else{\n conjunct(n, ss, it, didExtra);\n }\n }\n\n if(didRedir){\n resetIO(in0, out1);\n }\n}\n\nint conjunct(int n, stringstream& ss, const Tok::iterator &it, bool didExtra){\n\n int status;\n\n if(n == 0 && *it != \"#\"){\n cerr << \"Bash: syntax error near unexpected token \\'\" << *it << \"\\'\" << endl;\n return -1;\n }\n else if(n == 0 && *it == \"#\") return 0; \n char** args = new char*[n + 1];\n\n splitString(args, ss, n);\n\n if(strcmp(args[0], \"cd\") == 0){\n if(n <= 1){\n\n string home;\n\n if((home = getenv(\"HOME\")) == \"\"){\n perror(\"getenv\");\n }\n\n if(chdir((char*) home.c_str()) == -1){\n perror(\"chdir\");\n return -1;\n }\n\n if((getcwd(directory, 1024)) == NULL){\n perror(\"getcwd\");\n }\n else{\n cwd = directory;\n cwd = \":\" + cwd;\n cwd.replace(0, home.size() + 1, \":~\");\n }\n }\n else{\n if(chdir(args[1]) == -1){\n perror(\"chdir\");\n return -1;\n }\n\n if((getcwd(directory, 1024)) == NULL){\n perror(\"getcwd\");\n }\n else{\n string home = \"\";\n cwd = directory;\n cwd = \":\" + cwd;\n if((home = getenv(\"HOME\")) != \"\"){\n cwd.replace(0, home.size() + 1, \":~\");\n }\n else{\n perror(\"getenv conjunct\");\n }\n\n }\n }\n }\n else{\n\n int pid = fork();\n\n if(pid == -1){\n perror(\"There was an error with the fork().\");\n exit(1);\n }\n else if(pid == 0){\n if(-1 == execv((const char*) args[0], (char* const*) args)){\n perror(args[0]);\n exit(3);\n }\n }\n else if(pid > 0){\n\n if(-1 == wait(&status)){\n perror(\"There was an error with wait().\");\n return -1;\n }\n\n if(WIFEXITED(status)){\n if(WEXITSTATUS(status) == 3){\n delete[] args;\n return -1;\n }\n }\n }\n }\n\n delete[] args;\n\n return 0;\n}\n\nbool ioRedir(const Tok::iterator &it, bool inRedir, bool append){\n\n if(*it == \"&\" || *it == \"|\" || *it == \";\"){\n cerr << \"Bash: syntax error near unexpected token \\'\" << *it << \"\\'\" << endl;\n return false;\n }\n\n if(inRedir){\n string input = *it;\n\n int fdi;\n\n if((fdi = open((char*) input.c_str(), O_RDONLY)) == -1){\n perror(\"open input\");\n return false;\n }\n\n if(close(0) == -1){\n perror(\"close input\");\n exit(-1);\n }\n\n if(dup(fdi) == -1){\n perror(\"dup input\");\n exit(-1);\n }\n return true;\n }\n else{\n string output = *it;\n\n int fdo;\n mode_t readWrite = S_IRUSR | S_IWUSR | S_IRGRP | S_IWGRP | S_IROTH | S_IWOTH;\n\n if(append){\n if((fdo = open((char*) output.c_str(), O_RDWR | O_CREAT | O_APPEND, readWrite)) == -1){\n perror(\"open output\");\n exit(-1);\n }\n }\n else{\n if((fdo = open((char*) output.c_str(), O_RDWR | O_CREAT | O_TRUNC, readWrite)) == -1){\n perror(\"open output append\");\n exit(-1);\n }\n }\n\n if(close(1) == -1){\n perror(\"close output\");\n exit(-1);\n }\n\n if(dup(fdo) == -1){\n perror(\"dup output\");\n exit(-1);\n }\n }\n\n return true;\n}\n\nvoid resetIO(int in0, int out1){\n\n if(dup2(in0, 0) == -1){\n perror(\"dup input - 0\");\n exit(-1);\n }\n\n if(dup2(out1, 1) == -1){\n perror(\"dup output - 1\");\n exit(-1);\n }\n}\n\n\/\/TODO piping\nvoid pipeRedir(int fd[], int fdLoop[], bool pipeOut, bool isFirst, bool isLast, int n, stringstream& ss, const Tok::iterator& it, bool didRedir){\n\n int status;\n\n if(n == 0 && *it != \"#\"){\n cerr << \"Bash: syntax error near unexpected token \\'\" << *it << \"\\'\" << endl;\n return;\n }\n else if(n == 0 && *it == \"#\") return; \n char** args = new char*[n + 1];\n\n splitString(args, ss, n);\n\n if(pipeOut){\n int pid;\n\n if(!isFirst){\n if(pipe(fd) == -1){\n perror(\"repipe fd in input\");\n exit(-1);\n }\n }\n\n if((pid = fork()) == -1){\n perror(\"fork in pipe\");\n exit(-1);\n }\n\n if(pid == 0){\n if(isFirst){\n if(close(fd[0]) == -1){\n perror(\"close in pipe\");\n exit(-1);\n }\n }\n\n if(!isFirst){\n if(dup2(fdLoop[0], 0) == -1){\n perror(\"dup2 fdLoop in input\");\n exit(-1);\n }\n }\n\n if(!isLast){\n if(dup2(fd[1], 1) == -1){\n perror(\"dup2 in pipe\");\n exit(-1);\n }\n }\n \/\/TODO execute command here\n\n if(-1 == execv((const char*) args[0], (char* const*) args)){\n perror(\"execv in pipe\");\n exit(-1);\n }\n }\n else{\n if(wait(&status) == -1){\n perror(\"wait in pipe\");\n exit(-1);\n }\n\n if(close(fd[1]) == -1){\n perror(\"close in pipe parent\");\n exit(-1);\n }\n\n if(!isFirst){\n if(close(fdLoop[0]) == -1){\n perror(\"close fdLoop in input\");\n exit(-1);\n }\n }\n\n if(WIFEXITED(status)){\n if(WEXITSTATUS(status) == 3){\n exit(-1);\n }\n }\n\n }\n }\n else{\n int pid;\n if(!isLast){\n if(pipe(fdLoop) == -1){\n perror(\"fdLoop in output\");\n exit(-1);\n }\n }\n\n if((pid = fork()) == -1){\n perror(\"fork#2 in pipe\");\n exit(-1);\n }\n\n if(pid == 0){\n\n if(dup2(fd[0], 0) == -1){\n perror(\"dup2 #2 in pipe\");\n exit(-1);\n }\n\n \/\/TODO execute command here\n\n if(!isLast){\n if(dup2(fdLoop[1], 1) == -1){\n perror(\"dup2 loop in output\");\n exit(-1);\n }\n }\n\n if(-1 == execv((const char*) args[0], (char* const*) args)){\n perror(\"execv in pipe\");\n exit(-1);\n }\n\n }\n else{\n\n if(wait(&status) == -1){\n perror(\"wait #2 in pipe\");\n exit(-1);\n }\n\n if(close(fd[0]) == -1){\n perror(\"close #2 in pipe parent\");\n exit(-1);\n }\n\n if(!isLast){\n if(close(fdLoop[1]) == -1){\n perror(\"close fdLoop in output\");\n exit(-1);\n }\n }\n if(WIFEXITED(status)){\n if(WEXITSTATUS(status) == 3){\n exit(-1);\n }\n }\n }\n }\n}\n\nvoid skipCommand(Tok::iterator &it, Tok &tokens){\n while(it != tokens.end() && *it != \";\"){\n it++;\n }\n}\n\nvoid splitString(char** args, stringstream& ss, int n){\n\n string *str = new string[n];\n\n for(int i = 0; i < n; i++){\n\n ss >> str[i];\n\n if(str[i] != \"cd\" && i == 0 && str[i] != \"exit\"){\n str[i] = findPath(str[i]); \n }\n\n args[i] = (char*) str[i].c_str();\n }\n\n args[n] = NULL;\n\n char exitC[] = \"exit\";\n\n if(strcmp(args[0], exitC) == 0){\n cout << endl;\n exit(0);\n }\n\n delete[] str;\n}\n\nstring findPath(string file){\n string env = \"\";\n\n if((env = getenv(\"PATH\")) == \"\"){\n perror(\"getenv findPath\");\n exit(-1);\n }\n\n string dir = \"\";\n string path = \"\";\n struct stat buf;\n\n int i;\n\n while((i = env.find(\":\")) != -1){\n dir = env.substr(0, i);\n\n env = env.substr(i + 1, env.size());\n\n if(stat((dir + \"\/\" + file).c_str(), &buf) != -1){\n path = dir + \"\/\" + file;\n }\n else{\n continue;\n perror(\"stat, this shouldn't show\");\n }\n }\n\n return path;\n}\n<|endoftext|>"} {"text":"<commit_before>#include <iostream>\n#include <unistd.h>\n#include <string>\n#include <string.h>\n#include <sys\/types.h>\n#include <sys\/wait.h>\n#include <stdio.h>\n#include <errno.h>\n#include <vector>\n#include <stdlib.h>\n#include <fcntl.h>\n\nusing namespace std;\n\n\nvoid parse(char * line, vector<string> & input) {\n \n\n char * pch;\n\tpch = strtok (line, \" \\n\");\n\twhile (pch!= NULL) {\n\t \n\t \/\/ Ignore after comments\n\t if (*pch == '#')\n\t\tbreak;\n\t \n\t \/\/ Check for && and ||\n\t \/\/ Break input up\n\t char * a = strstr(pch, \"&&\");\n\t char * b = strstr(pch, \"||\");\n\t char * c = strstr(pch, \";\");\n char * d = strstr(pch, \"<\");\n char * e = strstr(pch, \">\");\n char * f = strstr(pch, \"|\");\n\n\t \/\/ If there are connectors, break up the string\n\t \/\/ into parts and add them individually to the vector\n\t if (a!=NULL || b!=NULL || c!=NULL || d!=NULL || e!=NULL || f!=NULL) {\n\t\twhile (strlen(pch) != 0 ) {\n\n\t\t \/\/ Checks for && and ||\n\t\t if ((pch[0] == '&' && pch[1] == '&') ||\n\t\t\t(pch[0] == '|' && pch[1] == '|')) {\n\t\t\t\n\t\t\t string tmp;\n\t\t\t tmp += *pch;\n\t\t\t tmp += *(pch+1);\n\t\t\t tmp[2] = '\\0';\n\t\t\t\n\t\t\t input.push_back(tmp);\n\t\t\t memmove(pch, pch+2, strlen(pch) - 2);\n\t\t\t pch[strlen(pch)-2] = '\\0';\n\t\t }\n\t\t \/\/ Check for semicolons\n\t\t else if (*pch == ';') {\n\t\t\t input.push_back(\";\");\n\t\t\t memmove(pch, pch+1, strlen(pch) -1);\n\t\t\t pch[strlen(pch)-1] = '\\0';\n\t\t }\n \/\/ Check for input\/output redirectors\n else if (*pch == '<') {\n input.push_back(\"<\");\n memmove(pch, pch+1, strlen(pch) -1);\n pch[strlen(pch)-1] = '\\0';\n }\n else if (*pch == '>') {\n if (*(pch+1) == '>') {\n input.push_back(\">>\");\n memmove(pch, pch+2, strlen(pch) -2);\n pch[strlen(pch)-2] = '\\0';\n }\n else {\n input.push_back(\">\");\n memmove(pch, pch+1, strlen(pch) -1);\n pch[strlen(pch)-1] = '\\0';\n }\n }\n else if (*pch == '|') {\n input.push_back(\"|\");\n memmove(pch, pch+1, strlen(pch) -1);\n pch[strlen(pch) -1] = '\\0';\n }\n\t\t else {\n\t\t\tstring word;\n\t\t\tint numletters = 0;\n\n\t\t\tchar *z = pch;\n\t\t\twhile (z!=a && z!=b && z!=c && z!=d && z!=e && z!=f) {\n\t\t\t if (*z == '\\0')\n\t\t\t\tbreak;\n\t\t\t word += *z;\n\t\t\t numletters++;\n\t\t\t z++;\n\t\t\t}\n\t\t\tinput.push_back(word);\n\t\t\tmemmove(pch, pch+numletters, strlen(pch) -numletters);\n\t\t\tpch[strlen(pch)-numletters] = '\\0';\n\t\t }\n\t\t\n\t\t a = strstr(pch, \"&&\");\n\t\t b = strstr(pch, \"||\");\n\t\t c = strstr(pch, \";\");\n d = strstr(pch, \"<\");\n e = strstr(pch, \">\");\n f = strstr(pch, \"|\");\n\t\t}\n\t }\n\n\t \/\/ If no connectors, just add to vector\t\n\t if (*pch != '\\0' && *pch != '\\n' && *pch != '#')\n\t\tinput.push_back(pch);\n\t pch = strtok (NULL, \" \\n\");\n\t}\n}\n\nvoid execute(vector<string> & input, int start, int end) {\n\n \/\/Call execvp, based on which elements in the string vector to use\n char * argv[5];\n\t \n\t int i = 0;\n\t \n\t for (i = 0; i <= (end - start); i++) {\n\t\targv[i] = new char[5];\n\t }\n\n cerr << \"execvp sent:\\n\";\n\n\t for (i = 0; i < (end-start); i++) {\n cerr << input[i+start] << endl;\n\t\tstrcpy(argv[i], input[i+start].c_str());\n\t }\n\t \n\t argv[i] = NULL;\n\n\t int status = execvp(argv[0], argv);\n\t if (status == -1)\n\t\tperror(\"execvp\");\n\t\texit(1); \n}\n\n\nint main() {\n\n vector<string> input; \n int status=0;\n\n int savestdin;\n if ((savestdin = dup(0)) == -1)\n perror(\"dup\");\n\n int savestdout;\n if ((savestdout = dup(1)) == -1)\n perror(\"dup\");\n\n \/\/ Get username\n char * usrname = getlogin();\n if (usrname == NULL){\n\tperror (\"getlogin\");\n\texit(1);\n }\n\n \/\/ Get hostname\n char hostname[20];\n\n if (gethostname(hostname, sizeof hostname) ==-1) {\n\tperror(\"gethostname\");\n\texit(1);\n }\n\n\n\n \/\/ Main loop\n while (1) {\n\n \t \/\/Restore stdin and stdout\n if ((dup2(savestdin,0)) == -1)\n perror(\"dup2\");\n\n if ((dup2(savestdout,0)) == -1)\n perror(\"dup2\");\n\n\tstatus = 0;\n\n\tif (input.size() != 0)\n\t input.clear();\n\t\t\n\tcout << usrname << \"@\" << hostname <<\"$ \";\n\n\tstring string1;\n\tgetline(cin, string1);\n\tchar * line = new char [string1.length() + 1];\n\tstrcpy(line, string1.c_str());\n\n\tparse(line, input);\n\n\tdelete line;\n\n\tif (input.size() == 0)\n\t continue;\n\n for (int i = 0; i < input.size(); i++) {\n\t if (strcmp(input[i].c_str(), \"exit\") == 0) exit(0);\n \n \/\/cout << input[i] << endl;\n }\n\n\n\tint pid=fork();\n if (pid == -1)\n perror (\"fork\");\n\tint pid2;\n\tif (pid == 0) {\n\t \n\n\t int start = 0;\n\t int end = input.size();\n\t unsigned i;\n\t\t\nloop:\t\t\n\n\t end = input.size();\n\t \n for (i = start; i < input.size(); i++) {\n \n \/\/input output redirection\n if (input[i] == \">\" || input[i] == \">>\" || input[i]==\"<\" || input[i] == \"|\") {\n\n\n if (input[i] == \">\") {\n\n int fdo = open(input[i+1].c_str(), O_CREAT | O_WRONLY, S_IRUSR | S_IWUSR);\n if (fdo==-1)\n perror(\"open\");\n\n status = close(STDOUT_FILENO);\n if (status == -1)\n perror(\"close\");\n\n if ((dup(fdo)) == -1)\n perror(\"dup\");\n\n if ((close(fdo)) == -1)\n perror(\"close\");\n\n end = i;\n break;\n }\n \n \n else if (input[i] == \">>\") {\n \n int fdo = open(input[i+1].c_str(), O_CREAT | O_WRONLY | O_APPEND, \n S_IRUSR | S_IWUSR);\n if (fdo==-1)\n perror(\"open\");\n\n status = close(STDOUT_FILENO);\n if (status == -1)\n perror(\"close\");\n\n if ((dup(fdo)) == -1)\n perror(\"dup\");\n\n if ((close(fdo)) == -1)\n perror(\"close\");\n\n end = i;\n break;\n }\n\n else if (input[i] == \"<\") {\n \n int fdi = open(input[i+1].c_str(), O_RDONLY, 0);\n if (fdi==-1)\n perror(\"open\");\n\n status = close(STDIN_FILENO);\n if (status == -1)\n perror(\"close\");\n\n if ((dup(fdi)) == -1)\n perror(\"dup\");\n\n if ((close(fdi)) == -1)\n perror(\"close\");\n \n end = i;\n break;\n }\n\n else if (input[i] == \"|\") {\n int pfd[2];\n\n if ((pipe(pfd)) == -1)\n perror(\"pipe\");\n\n \n int pid3 = fork();\n if (pid3 == -1) {\n perror(\"fork\");\n exit(1);\n } \n if (pid3==0) {\n cout << \"This is the child process\";\n\n if ((dup2(pfd[1], 1)) == -1)\n perror(\"dup2\");\n\n if ((close(pfd[0])) == -1)\n perror(\"close\");\n \n end = i;\n break;\n\n } \n else {\n close(STDIN_FILENO);\n dup2(pfd[0], 0);\n close(pfd[1]);\n \n if (-1 == wait(0))\n perror(\"wait\");\n\n start = i+1;\n goto loop;\n\n }\n\n\n }\n }\n \n\n else if (input[i] == \";\" || input[i] == \"&&\" || input[i] == \"||\") {\n\t\t string connector = input[i];\n\n\t\t pid2 = fork();\n\t\t if (pid2 == -1) {\n\t\t\t perror(\"fork\");\n\t\t\t exit(1);\n\t\t }\n\t\t if (pid2!=0) {\n\t\t\t if (-1 == wait(&status))\n\t\t\t perror(\"wait\");\n\t\t\t\n\t\t\t if (connector == \"&&\" && status != 0)\n\t\t\t exit(1);\n\n\t\t\t if (connector == \"||\" && status == 0)\n\t\t\t exit(0);\n\n\t\t\t start = i + 1;\n\t\t\t goto loop;\n\n\t\t }\n\t\t else {\n\t\t\t end = i;\n\t\t\t break;\n\t\t }\n\t\t }\n\t }\n\n\t execute(input, start, end);\n\n\t} \t\n\telse { \n\t status = wait(NULL);\n\t if (status == -1)\n\t\tperror(\"wait\");\n\t}\n }\n \n return 0; \n}\n<commit_msg>enabled linking pipes together<commit_after>#include <iostream>\n#include <unistd.h>\n#include <string>\n#include <string.h>\n#include <sys\/types.h>\n#include <sys\/wait.h>\n#include <stdio.h>\n#include <errno.h>\n#include <vector>\n#include <stdlib.h>\n#include <fcntl.h>\n\nusing namespace std;\n\n\nvoid parse(char * line, vector<string> & input) {\n \n\n char * pch;\n\tpch = strtok (line, \" \\n\");\n\twhile (pch!= NULL) {\n\t \n\t \/\/ Ignore after comments\n\t if (*pch == '#')\n\t\tbreak;\n\t \n\t \/\/ Check for && and ||\n\t \/\/ Break input up\n\t char * a = strstr(pch, \"&&\");\n\t char * b = strstr(pch, \"||\");\n\t char * c = strstr(pch, \";\");\n char * d = strstr(pch, \"<\");\n char * e = strstr(pch, \">\");\n char * f = strstr(pch, \"|\");\n\n\t \/\/ If there are connectors, break up the string\n\t \/\/ into parts and add them individually to the vector\n\t if (a!=NULL || b!=NULL || c!=NULL || d!=NULL || e!=NULL || f!=NULL) {\n\t\twhile (strlen(pch) != 0 ) {\n\n\t\t \/\/ Checks for && and ||\n\t\t if ((pch[0] == '&' && pch[1] == '&') ||\n\t\t\t(pch[0] == '|' && pch[1] == '|')) {\n\t\t\t\n\t\t\t string tmp;\n\t\t\t tmp += *pch;\n\t\t\t tmp += *(pch+1);\n\t\t\t tmp[2] = '\\0';\n\t\t\t\n\t\t\t input.push_back(tmp);\n\t\t\t memmove(pch, pch+2, strlen(pch) - 2);\n\t\t\t pch[strlen(pch)-2] = '\\0';\n\t\t }\n\t\t \/\/ Check for semicolons\n\t\t else if (*pch == ';') {\n\t\t\t input.push_back(\";\");\n\t\t\t memmove(pch, pch+1, strlen(pch) -1);\n\t\t\t pch[strlen(pch)-1] = '\\0';\n\t\t }\n \/\/ Check for input\/output redirectors\n else if (*pch == '<') {\n input.push_back(\"<\");\n memmove(pch, pch+1, strlen(pch) -1);\n pch[strlen(pch)-1] = '\\0';\n }\n else if (*pch == '>') {\n if (*(pch+1) == '>') {\n input.push_back(\">>\");\n memmove(pch, pch+2, strlen(pch) -2);\n pch[strlen(pch)-2] = '\\0';\n }\n else {\n input.push_back(\">\");\n memmove(pch, pch+1, strlen(pch) -1);\n pch[strlen(pch)-1] = '\\0';\n }\n }\n else if (*pch == '|') {\n input.push_back(\"|\");\n memmove(pch, pch+1, strlen(pch) -1);\n pch[strlen(pch) -1] = '\\0';\n }\n\t\t else {\n\t\t\tstring word;\n\t\t\tint numletters = 0;\n\n\t\t\tchar *z = pch;\n\t\t\twhile (z!=a && z!=b && z!=c && z!=d && z!=e && z!=f) {\n\t\t\t if (*z == '\\0')\n\t\t\t\tbreak;\n\t\t\t word += *z;\n\t\t\t numletters++;\n\t\t\t z++;\n\t\t\t}\n\t\t\tinput.push_back(word);\n\t\t\tmemmove(pch, pch+numletters, strlen(pch) -numletters);\n\t\t\tpch[strlen(pch)-numletters] = '\\0';\n\t\t }\n\t\t\n\t\t a = strstr(pch, \"&&\");\n\t\t b = strstr(pch, \"||\");\n\t\t c = strstr(pch, \";\");\n d = strstr(pch, \"<\");\n e = strstr(pch, \">\");\n f = strstr(pch, \"|\");\n\t\t}\n\t }\n\n\t \/\/ If no connectors, just add to vector\t\n\t if (*pch != '\\0' && *pch != '\\n' && *pch != '#')\n\t\tinput.push_back(pch);\n\t pch = strtok (NULL, \" \\n\");\n\t}\n}\n\nvoid execute(const vector<string> & input, int start, int end) {\n\n \/\/Call execvp, based on which elements in the string vector to use\n char * argv[5];\n\t \n\t int i = 0;\n\t \n\t for (i = 0; i <= (end - start); i++) {\n\t\targv[i] = new char[5];\n\t }\n\n \/\/debug\n \/\/cerr << \"sent to execvp:\\n\";\n\n\t for (i = 0; i < (end-start); i++) {\n\t\tstrcpy(argv[i], input[i+start].c_str());\n\t \/\/cerr << input[i+start] << endl;\n }\n\t \n \/\/debug\n \/\/cerr << endl;\n\n\t argv[i] = NULL;\n\n\t int status = execvp(argv[0], argv);\n\t if (status == -1)\n\t\tperror(\"execvp\");\n\t\texit(1); \n}\n\n\nint main() {\n\n vector<string> input; \n int status=0;\n\n int savestdin;\n if ((savestdin = dup(0)) == -1)\n perror(\"dup\");\n\n int savestdout;\n if ((savestdout = dup(1)) == -1)\n perror(\"dup\");\n\n \/\/ Get username\n char * usrname = getlogin();\n if (usrname == NULL){\n\tperror (\"getlogin\");\n\texit(1);\n }\n\n \/\/ Get hostname\n char hostname[20];\n\n if (gethostname(hostname, sizeof hostname) ==-1) {\n\tperror(\"gethostname\");\n\texit(1);\n }\n\n\n\n \/\/ Main loop\n while (1) {\n\n \t \/\/Restore stdin and stdout\n if ((dup2(savestdin,0)) == -1)\n perror(\"dup2\");\n\n if ((dup2(savestdout,0)) == -1)\n perror(\"dup2\");\n\n\tstatus = 0;\n\n\tif (input.size() != 0)\n\t input.clear();\n\t\t\n\tcout << usrname << \"@\" << hostname <<\"$ \";\n\n\tstring string1;\n\tgetline(cin, string1);\n\tchar * line = new char [string1.length() + 1];\n\tstrcpy(line, string1.c_str());\n\n\tparse(line, input);\n\n\tdelete line;\n\n\tif (input.size() == 0)\n\t continue;\n\n for (int i = 0; i < input.size(); i++) {\n\t if (strcmp(input[i].c_str(), \"exit\") == 0) exit(0);\n }\n\n\n\tint pid=fork();\n if (pid == -1)\n perror (\"fork\");\n\tint pid2;\n\tif (pid == 0) {\n\t \n\n\t int start = 0;\n\t int end = input.size();\n\t unsigned i;\n\t\t\nloop:\t\t\n\t end = input.size();\n\t \n for (i = start; i < input.size(); ) {\n \/\/input output redirection\n if (input[i] == \">\" || input[i] == \">>\" || input[i]==\"<\" || input[i] == \"|\") {\n\n if (input[i] == \">\") {\n\n int fdo = open(input[i+1].c_str(), O_CREAT | O_WRONLY, S_IRUSR | S_IWUSR);\n if (fdo==-1)\n perror(\"open\");\n\n status = close(STDOUT_FILENO);\n if (status == -1)\n perror(\"close\");\n\n if ((dup(fdo)) == -1)\n perror(\"dup\");\n\n if ((close(fdo)) == -1)\n perror(\"close\");\n\n input.erase(input.begin() + i);\n\n input.erase(input.begin() + i);\n \n if (input[i] == \">\" || input[i] == \">>\" || \n input[i+2]==\"<\" || input[i+2] == \"|\")\n continue; \n\n end = i;\n break;\n }\n \n \n else if (input[i] == \">>\") {\n \n int fdo = open(input[i+1].c_str(), O_CREAT | O_WRONLY | O_APPEND, \n S_IRUSR | S_IWUSR);\n if (fdo==-1)\n perror(\"open\");\n\n status = close(STDOUT_FILENO);\n if (status == -1)\n perror(\"close\");\n\n if ((dup(fdo)) == -1)\n perror(\"dup\");\n\n if ((close(fdo)) == -1)\n perror(\"close\");\n \n input.erase(input.begin() + i);\n\n input.erase(input.begin() + i);\n \n if (input[i] == \">\" || input[i] == \">>\" || \n input[i+2]==\"<\" || input[i+2] == \"|\")\n continue; \n \n end = i;\n break;\n }\n\n else if (input[i] == \"<\") {\n \n int fdi = open(input[i+1].c_str(), O_RDONLY, 0);\n if (fdi==-1)\n perror(\"open\");\n\n status = close(STDIN_FILENO);\n if (status == -1)\n perror(\"close\");\n\n if ((dup(fdi)) == -1)\n perror(\"dup\");\n\n if ((close(fdi)) == -1)\n perror(\"close\");\n \n input.erase(input.begin() + i);\n\n input.erase(input.begin() + i);\n \n if (input[i] == \">\" || input[i] == \">>\" || \n input[i+2]==\"<\" || input[i+2] == \"|\")\n continue; \n\n end = i;\n break;\n }\n\n else if (input[i] == \"|\") {\n int pfd[2];\n\n if ((pipe(pfd)) == -1)\n perror(\"pipe\");\n\n \n int pid3 = fork();\n if (pid3 == -1) {\n perror(\"fork\");\n exit(1);\n } \n if (pid3==0) {\n cout << \"This is the child process\";\n\n if ((dup2(pfd[1], 1)) == -1)\n perror(\"dup2\");\n\n if ((close(pfd[0])) == -1)\n perror(\"close\");\n \n end = i;\n break;\n\n } \n else {\n close(STDIN_FILENO);\n dup2(pfd[0], 0);\n close(pfd[1]);\n \n if (-1 == wait(0))\n perror(\"wait\");\n\n start = i+1;\n goto loop;\n\n }\n\n\n }\n }\n \n\n else if (input[i] == \";\" || input[i] == \"&&\" || input[i] == \"||\") {\n\t\t string connector = input[i];\n\n\t\t pid2 = fork();\n\t\t if (pid2 == -1) {\n\t\t\t perror(\"fork\");\n\t\t\t exit(1);\n\t\t }\n\t\t if (pid2!=0) {\n\t\t\t if (-1 == wait(&status))\n\t\t\t perror(\"wait\");\n\t\t\t\n\t\t\t if (connector == \"&&\" && status != 0)\n\t\t\t exit(1);\n\n\t\t\t if (connector == \"||\" && status == 0)\n\t\t\t exit(0);\n\n\t\t\t start = i + 1;\n\t\t\t goto loop;\n\n\t\t }\n\t\t else {\n\t\t\t end = i;\n\t\t\t break;\n\t\t }\n\t\t }\n\t i++; \n }\n\n\n\t execute(input, start, end);\n\n\t} \t\n\telse { \n\t status = wait(NULL);\n\t if (status == -1)\n\t\tperror(\"wait\");\n\t}\n }\n \n return 0; \n}\n<|endoftext|>"} {"text":"<commit_before>#include <iostream>\n#include <stdlib.h>\n#include <string>\n#include <errno.h>\n#include <unistd.h>\n#include <stdio.h>\n#include <sys\/types.h>\n#include <sys\/wait.h>\n#include <cstring>\n#include <vector>\n\nusing namespace std;\n\nint main()\n{\n\twhile(true)\n\t{\n\t\tstring commands;\/\/Receive command line\n\t\tcout << \"$\";\n\t\tgetline(cin,commands);\n\t\tconst int y = commands.size() + 1;\n\t\tchar* stuff = new char[y];\/\/Stores command line as c strings\n\t\tstrcpy(stuff,commands.c_str());\n\t\tchar** cmd= new char*[y];\/\/Stores the parsed command line\n\t\tint x = 0;\n\t\tchar* tok = strtok(stuff, \" ;\\n\\t\\r\");\/\/Parses the c_strings\n\t\twhile(tok != NULL)\/\/Adding tokens into storage\n\t\t{\n\t\t\tif(strcmp(tok, \"exit\") == 0)\/\/if an argument is exit\n\t\t\t\t\t\t \/\/it will exit\n\t\t\t{\n\t\t\t\texit(0);\n\t\t\t}\n\t\t\tcmd[x] = tok;\n\t\t\ttok = strtok(NULL,\" ;\\n\\t\\r\");\n\t\t\t\/\/cout << cmd[x] << \" \";\n\t\t\t++x;\n\t\t}\n\t\t\/\/cout << x << \" \" << x+1 << endl;\n\t\tcmd[x+1] = NULL;\/\/Makes last argument the null character\n\t\tint pid = fork();\n\t\tif(pid == 0)\n\t\t{\n\t\t\t\/\/cout << \"This is the child\" << endl;\n\t\t\tif(-1 == execvp(cmd[0], cmd))\n\t\t\tperror(\"execvp\");\n\t\t\texit(1);\n\t\t}\n\t\telse if (pid == -1)\/\/If fork fails\n\t\t{\n\t\t\tperror(\"fork\");\n\t\t}\n\t\telse\n\t\t{\n\t\t\tif(-1 == wait(0))\n\t\t\t{\n\t\t\t\tperror(\"wait\");\n\t\t\t}\n\t\t\t\/\/cout << \"This is the parent\" << endl;\n\t\t}\n\n\t}\n\n\n\treturn 0;\n}\n<commit_msg>fixed seg faults\/badd address<commit_after>#include <iostream>\n#include <stdlib.h>\n#include <string>\n#include <errno.h>\n#include <unistd.h>\n#include <stdio.h>\n#include <sys\/types.h>\n#include <sys\/wait.h>\n#include <cstring>\n#include <vector>\n\nusing namespace std;\n\nint main()\n{\n\twhile(true)\n\t{\n\t\tstring commands;\/\/Receive command line\n\t\tcout << \"$\";\n\t\tgetline(cin,commands);\n\t\tconst int y = commands.size() + 1;\n\t\tchar* stuff = new char[y];\/\/Stores command line as c strings\n\t\tstrcpy(stuff,commands.c_str());\n\t\tchar** cmd= new char*[y];\/\/Stores the parsed command line\n\t\tint x = 0;\n\t\tchar* tok = strtok(stuff, \" ;\\n\\t\\r\");\/\/Parses the c_strings\n\t\twhile(tok != NULL)\/\/Adding tokens into storage\n\t\t{\n\t\t\tif(strcmp(tok, \"exit\") == 0)\/\/if an argument is exit\n\t\t\t\t\t\t \/\/it will exit\n\t\t\t{\n\t\t\t\texit(0);\n\t\t\t}\n\t\t\tcmd[x] = tok;\n\t\t\ttok = strtok(NULL,\" ;\\n\\t\\r\");\n\t\t\t\/\/cout << cmd[x] << \" \";\n\t\t\t++x;\n\t\t}\n\t\t\n\t\tcout << x << \" \" << x+1 << endl;\n\t\tcmd[x] = NULL;\/\/Makes last argument the null character\n\t\tint pid = fork();\n\t\tif(pid == 0)\n\t\t{\n\t\t\t\/\/cout << \"This is the child\" << endl;\n\t\t\tif(-1 == execvp(cmd[0], cmd))\n\t\t\tperror(\"execvp\");\n\t\t\texit(1);\n\t\t}\n\t\telse if (pid == -1)\/\/If fork fails\n\t\t{\n\t\t\tperror(\"fork\");\n\t\t}\n\t\telse\n\t\t{\n\t\t\tif(-1 == wait(0))\n\t\t\t{\n\t\t\t\tperror(\"wait\");\n\t\t\t}\n\t\t\t\/\/cout << \"This is the parent\" << endl;\n\t\t}\n\n\t}\n\n\n\treturn 0;\n}\n<|endoftext|>"} {"text":"<commit_before>\/************************************\n * file enc : ASCII\n * author : wuyanyi09@gmail.com\n ************************************\/\n#ifndef CPPJIEBA_MPSEGMENT_H\n#define CPPJIEBA_MPSEGMENT_H\n\n#include <algorithm>\n#include <set>\n#include <cassert>\n#include \"Limonp\/logger.hpp\"\n#include \"Trie.hpp\"\n#include \"Trie.hpp\"\n#include \"ISegment.hpp\"\n#include \"SegmentBase.hpp\"\n\nnamespace CppJieba\n{\n\n struct SegmentChar \n {\n uint16_t uniCh;\n DagType dag;\n const TrieNodeInfo * pInfo;\n double weight;\n\n SegmentChar(uint16_t uni):uniCh(uni), pInfo(NULL), weight(0.0)\n {}\n };\n typedef vector<SegmentChar> SegmentContext;\n\n class MPSegment: public SegmentBase\n {\n protected:\n Trie _trie;\n\n public:\n MPSegment(){_setInitFlag(false);};\n explicit MPSegment(const string& dictPath)\n {\n _setInitFlag(init(dictPath));\n };\n virtual ~MPSegment(){};\n public:\n bool init(const string& dictPath)\n {\n if(_getInitFlag())\n {\n LogError(\"already inited before now.\");\n return false;\n }\n _trie.init(dictPath);\n assert(_trie);\n LogInfo(\"MPSegment init(%s) ok\", dictPath.c_str());\n return _setInitFlag(true);\n }\n public:\n using SegmentBase::cut;\n virtual bool cut(Unicode::const_iterator begin, Unicode::const_iterator end, vector<string>& res)const\n {\n assert(_getInitFlag());\n if(begin == end)\n {\n return false;\n }\n\n vector<Unicode> words;\n if(!cut(begin, end, words))\n {\n return false;\n }\n string word;\n for(size_t i = 0; i < words.size(); i++)\n {\n if(TransCode::encode(words[i], word))\n {\n res.push_back(word);\n }\n else\n {\n LogError(\"encode failed.\");\n }\n }\n return true;\n }\n\n bool cut(Unicode::const_iterator begin , Unicode::const_iterator end, vector<Unicode>& res) const\n {\n if(!_getInitFlag())\n {\n LogError(\"not inited.\");\n return false;\n }\n SegmentContext segContext;\n \/\/calc DAG\n if(!_calcDAG(begin, end, segContext))\n {\n LogError(\"_calcDAG failed.\");\n return false;\n }\n\n if(!_calcDP(segContext))\n {\n LogError(\"_calcDP failed.\");\n return false;\n }\n\n if(!_cut(segContext, res))\n {\n LogError(\"_cut failed.\");\n return false;\n }\n\n return true;\n }\n\n private:\n bool _calcDAG(Unicode::const_iterator begin, Unicode::const_iterator end, SegmentContext& segContext) const\n {\n for(Unicode::const_iterator it = begin; it != end; it++)\n {\n SegmentChar schar(*it);\n size_t i = it - begin;\n _trie.find(it, end, schar.dag, i);\n \/\/DagType::iterator dagIter;\n if(schar.dag.end() == schar.dag.find(i))\n {\n schar.dag[i] = NULL;\n }\n segContext.push_back(schar);\n }\n return true;\n }\n bool _calcDP(SegmentContext& segContext)const\n {\n if(segContext.empty())\n {\n LogError(\"segContext empty\");\n return false;\n }\n\n for(int i = segContext.size() - 1; i >= 0; i--)\n {\n segContext[i].pInfo = NULL;\n segContext[i].weight = MIN_DOUBLE;\n for(DagType::const_iterator it = segContext[i].dag.begin(); it != segContext[i].dag.end(); it++)\n {\n size_t nextPos = it->first;\n const TrieNodeInfo* p = it->second;\n double val = 0.0;\n if(nextPos + 1 < segContext.size())\n {\n val += segContext[nextPos + 1].weight;\n }\n\n if(p)\n {\n val += p->logFreq; \n }\n else\n {\n val += _trie.getMinLogFreq();\n }\n if(val > segContext[i].weight)\n {\n segContext[i].pInfo = p;\n segContext[i].weight = val;\n }\n }\n }\n return true;\n\n }\n bool _cut(SegmentContext& segContext, vector<Unicode>& res)const\n {\n size_t i = 0;\n while(i < segContext.size())\n {\n const TrieNodeInfo* p = segContext[i].pInfo;\n if(p)\n {\n res.push_back(p->word);\n i += p->word.size();\n }\n else\/\/single chinese word\n {\n res.push_back(Unicode(1, segContext[i].uniCh));\n i++;\n }\n }\n return true;\n }\n\n\n };\n}\n\n#endif\n<commit_msg>little modify MPSegment<commit_after>\/************************************\n * file enc : ASCII\n * author : wuyanyi09@gmail.com\n ************************************\/\n#ifndef CPPJIEBA_MPSEGMENT_H\n#define CPPJIEBA_MPSEGMENT_H\n\n#include <algorithm>\n#include <set>\n#include <cassert>\n#include \"Limonp\/logger.hpp\"\n#include \"Trie.hpp\"\n#include \"Trie.hpp\"\n#include \"ISegment.hpp\"\n#include \"SegmentBase.hpp\"\n\nnamespace CppJieba\n{\n\n struct SegmentChar \n {\n uint16_t uniCh;\n DagType dag;\n const TrieNodeInfo * pInfo;\n double weight;\n\n SegmentChar():uniCh(0), pInfo(NULL), weight(0.0)\n {}\n };\n typedef vector<SegmentChar> SegmentContext;\n\n class MPSegment: public SegmentBase\n {\n protected:\n Trie _trie;\n\n public:\n MPSegment(){_setInitFlag(false);};\n explicit MPSegment(const string& dictPath)\n {\n _setInitFlag(init(dictPath));\n };\n virtual ~MPSegment(){};\n public:\n bool init(const string& dictPath)\n {\n if(_getInitFlag())\n {\n LogError(\"already inited before now.\");\n return false;\n }\n _trie.init(dictPath);\n assert(_trie);\n LogInfo(\"MPSegment init(%s) ok\", dictPath.c_str());\n return _setInitFlag(true);\n }\n public:\n using SegmentBase::cut;\n virtual bool cut(Unicode::const_iterator begin, Unicode::const_iterator end, vector<string>& res)const\n {\n assert(_getInitFlag());\n if(begin == end)\n {\n return false;\n }\n\n vector<Unicode> words;\n if(!cut(begin, end, words))\n {\n return false;\n }\n string word;\n for(size_t i = 0; i < words.size(); i++)\n {\n if(TransCode::encode(words[i], word))\n {\n res.push_back(word);\n }\n else\n {\n LogError(\"encode failed.\");\n }\n }\n return true;\n }\n\n bool cut(Unicode::const_iterator begin , Unicode::const_iterator end, vector<Unicode>& res) const\n {\n if(!_getInitFlag())\n {\n LogError(\"not inited.\");\n return false;\n }\n SegmentContext segContext;\n \/\/calc DAG\n if(!_calcDAG(begin, end, segContext))\n {\n LogError(\"_calcDAG failed.\");\n return false;\n }\n\n if(!_calcDP(segContext))\n {\n LogError(\"_calcDP failed.\");\n return false;\n }\n\n if(!_cut(segContext, res))\n {\n LogError(\"_cut failed.\");\n return false;\n }\n\n return true;\n }\n\n private:\n bool _calcDAG(Unicode::const_iterator begin, Unicode::const_iterator end, SegmentContext& segContext) const\n {\n SegmentChar schar;\n size_t offset;\n for(Unicode::const_iterator it = begin; it != end; it++)\n {\n schar.uniCh = *it;\n offset = it - begin;\n schar.dag.clear();\n _trie.find(it, end, schar.dag, offset);\n if(!isIn(schar.dag, offset))\n {\n schar.dag[offset] = NULL;\n }\n segContext.push_back(schar);\n }\n return true;\n }\n bool _calcDP(SegmentContext& segContext)const\n {\n if(segContext.empty())\n {\n LogError(\"segContext empty\");\n return false;\n }\n\n size_t nextPos;\n const TrieNodeInfo* p;\n double val;\n\n for(int i = segContext.size() - 1; i >= 0; i--)\n {\n segContext[i].pInfo = NULL;\n segContext[i].weight = MIN_DOUBLE;\n for(DagType::const_iterator it = segContext[i].dag.begin(); it != segContext[i].dag.end(); it++)\n {\n nextPos = it->first;\n p = it->second;\n val = 0.0;\n if(nextPos + 1 < segContext.size())\n {\n val += segContext[nextPos + 1].weight;\n }\n\n if(p)\n {\n val += p->logFreq; \n }\n else\n {\n val += _trie.getMinLogFreq();\n }\n if(val > segContext[i].weight)\n {\n segContext[i].pInfo = p;\n segContext[i].weight = val;\n }\n }\n }\n return true;\n\n }\n bool _cut(SegmentContext& segContext, vector<Unicode>& res)const\n {\n size_t i = 0;\n while(i < segContext.size())\n {\n const TrieNodeInfo* p = segContext[i].pInfo;\n if(p)\n {\n res.push_back(p->word);\n i += p->word.size();\n }\n else\/\/single chinese word\n {\n res.push_back(Unicode(1, segContext[i].uniCh));\n i++;\n }\n }\n return true;\n }\n\n\n };\n}\n\n#endif\n<|endoftext|>"} {"text":"<commit_before>\/\/ Copyright (c) 2006-2008 The Chromium Authors. All rights reserved.\n\/\/ Use of this source code is governed by a BSD-style license that can be\n\/\/ found in the LICENSE file.\n\n#include <algorithm>\n\n#include \"skia\/ext\/convolver.h\"\n\nnamespace skia {\n\nnamespace {\n\n\/\/ Converts the argument to an 8-bit unsigned value by clamping to the range\n\/\/ 0-255.\ninline unsigned int ClampTo8(int a) {\n if (static_cast<int>(a) < 256)\n return a; \/\/ Avoid the extra check in the common case.\n if (a < 0)\n return 0;\n return 255;\n}\n\n\/\/ Stores a list of rows in a circular buffer. The usage is you write into it\n\/\/ by calling AdvanceRow. It will keep track of which row in the buffer it\n\/\/ should use next, and the total number of rows added.\nclass CircularRowBuffer {\n public:\n \/\/ The number of pixels in each row is given in |source_row_pixel_width|.\n \/\/ The maximum number of rows needed in the buffer is |max_y_filter_size|\n \/\/ (we only need to store enough rows for the biggest filter).\n \/\/\n \/\/ We use the |first_input_row| to compute the coordinates of all of the\n \/\/ following rows returned by Advance().\n CircularRowBuffer(int dest_row_pixel_width, int max_y_filter_size,\n int first_input_row)\n : row_byte_width_(dest_row_pixel_width * 4),\n num_rows_(max_y_filter_size),\n next_row_(0),\n next_row_coordinate_(first_input_row) {\n buffer_.resize(row_byte_width_ * max_y_filter_size);\n row_addresses_.resize(num_rows_);\n }\n\n \/\/ Moves to the next row in the buffer, returning a pointer to the beginning\n \/\/ of it.\n unsigned char* AdvanceRow() {\n unsigned char* row = &buffer_[next_row_ * row_byte_width_];\n next_row_coordinate_++;\n\n \/\/ Set the pointer to the next row to use, wrapping around if necessary.\n next_row_++;\n if (next_row_ == num_rows_)\n next_row_ = 0;\n return row;\n }\n\n \/\/ Returns a pointer to an \"unrolled\" array of rows. These rows will start\n \/\/ at the y coordinate placed into |*first_row_index| and will continue in\n \/\/ order for the maximum number of rows in this circular buffer.\n \/\/\n \/\/ The |first_row_index_| may be negative. This means the circular buffer\n \/\/ starts before the top of the image (it hasn't been filled yet).\n unsigned char* const* GetRowAddresses(int* first_row_index) {\n \/\/ Example for a 4-element circular buffer holding coords 6-9.\n \/\/ Row 0 Coord 8\n \/\/ Row 1 Coord 9\n \/\/ Row 2 Coord 6 <- next_row_ = 2, next_row_coordinate_ = 10.\n \/\/ Row 3 Coord 7\n \/\/\n \/\/ The \"next\" row is also the first (lowest) coordinate. This computation\n \/\/ may yield a negative value, but that's OK, the math will work out\n \/\/ since the user of this buffer will compute the offset relative\n \/\/ to the first_row_index and the negative rows will never be used.\n *first_row_index = next_row_coordinate_ - num_rows_;\n\n int cur_row = next_row_;\n for (int i = 0; i < num_rows_; i++) {\n row_addresses_[i] = &buffer_[cur_row * row_byte_width_];\n\n \/\/ Advance to the next row, wrapping if necessary.\n cur_row++;\n if (cur_row == num_rows_)\n cur_row = 0;\n }\n return &row_addresses_[0];\n }\n\n private:\n \/\/ The buffer storing the rows. They are packed, each one row_byte_width_.\n std::vector<unsigned char> buffer_;\n\n \/\/ Number of bytes per row in the |buffer_|.\n int row_byte_width_;\n\n \/\/ The number of rows available in the buffer.\n int num_rows_;\n\n \/\/ The next row index we should write into. This wraps around as the\n \/\/ circular buffer is used.\n int next_row_;\n\n \/\/ The y coordinate of the |next_row_|. This is incremented each time a\n \/\/ new row is appended and does not wrap.\n int next_row_coordinate_;\n\n \/\/ Buffer used by GetRowAddresses().\n std::vector<unsigned char*> row_addresses_;\n};\n\n\/\/ Convolves horizontally along a single row. The row data is given in\n\/\/ |src_data| and continues for the num_values() of the filter.\ntemplate<bool has_alpha>\nvoid ConvolveHorizontally(const unsigned char* src_data,\n const ConvolusionFilter1D& filter,\n unsigned char* out_row) {\n \/\/ Loop over each pixel on this row in the output image.\n int num_values = filter.num_values();\n for (int out_x = 0; out_x < num_values; out_x++) {\n \/\/ Get the filter that determines the current output pixel.\n int filter_offset, filter_length;\n const short* filter_values =\n filter.FilterForValue(out_x, &filter_offset, &filter_length);\n\n \/\/ Compute the first pixel in this row that the filter affects. It will\n \/\/ touch |filter_length| pixels (4 bytes each) after this.\n const unsigned char* row_to_filter = &src_data[filter_offset * 4];\n\n \/\/ Apply the filter to the row to get the destination pixel in |accum|.\n int accum[4] = {0};\n for (int filter_x = 0; filter_x < filter_length; filter_x++) {\n short cur_filter = filter_values[filter_x];\n accum[0] += cur_filter * row_to_filter[filter_x * 4 + 0];\n accum[1] += cur_filter * row_to_filter[filter_x * 4 + 1];\n accum[2] += cur_filter * row_to_filter[filter_x * 4 + 2];\n if (has_alpha)\n accum[3] += cur_filter * row_to_filter[filter_x * 4 + 3];\n }\n\n \/\/ Bring this value back in range. All of the filter scaling factors\n \/\/ are in fixed point with kShiftBits bits of fractional part.\n accum[0] >>= ConvolusionFilter1D::kShiftBits;\n accum[1] >>= ConvolusionFilter1D::kShiftBits;\n accum[2] >>= ConvolusionFilter1D::kShiftBits;\n if (has_alpha)\n accum[3] >>= ConvolusionFilter1D::kShiftBits;\n\n \/\/ Store the new pixel.\n out_row[out_x * 4 + 0] = ClampTo8(accum[0]);\n out_row[out_x * 4 + 1] = ClampTo8(accum[1]);\n out_row[out_x * 4 + 2] = ClampTo8(accum[2]);\n if (has_alpha)\n out_row[out_x * 4 + 3] = ClampTo8(accum[3]);\n }\n}\n\n\/\/ Does vertical convolusion to produce one output row. The filter values and\n\/\/ length are given in the first two parameters. These are applied to each\n\/\/ of the rows pointed to in the |source_data_rows| array, with each row\n\/\/ being |pixel_width| wide.\n\/\/\n\/\/ The output must have room for |pixel_width * 4| bytes.\ntemplate<bool has_alpha>\nvoid ConvolveVertically(const short* filter_values,\n int filter_length,\n unsigned char* const* source_data_rows,\n int pixel_width,\n unsigned char* out_row) {\n \/\/ We go through each column in the output and do a vertical convolusion,\n \/\/ generating one output pixel each time.\n for (int out_x = 0; out_x < pixel_width; out_x++) {\n \/\/ Compute the number of bytes over in each row that the current column\n \/\/ we're convolving starts at. The pixel will cover the next 4 bytes.\n int byte_offset = out_x * 4;\n\n \/\/ Apply the filter to one column of pixels.\n int accum[4] = {0};\n for (int filter_y = 0; filter_y < filter_length; filter_y++) {\n short cur_filter = filter_values[filter_y];\n accum[0] += cur_filter * source_data_rows[filter_y][byte_offset + 0];\n accum[1] += cur_filter * source_data_rows[filter_y][byte_offset + 1];\n accum[2] += cur_filter * source_data_rows[filter_y][byte_offset + 2];\n if (has_alpha)\n accum[3] += cur_filter * source_data_rows[filter_y][byte_offset + 3];\n }\n\n \/\/ Bring this value back in range. All of the filter scaling factors\n \/\/ are in fixed point with kShiftBits bits of precision.\n accum[0] >>= ConvolusionFilter1D::kShiftBits;\n accum[1] >>= ConvolusionFilter1D::kShiftBits;\n accum[2] >>= ConvolusionFilter1D::kShiftBits;\n if (has_alpha)\n accum[3] >>= ConvolusionFilter1D::kShiftBits;\n\n \/\/ Store the new pixel.\n out_row[byte_offset + 0] = ClampTo8(accum[0]);\n out_row[byte_offset + 1] = ClampTo8(accum[1]);\n out_row[byte_offset + 2] = ClampTo8(accum[2]);\n if (has_alpha) {\n unsigned char alpha = ClampTo8(accum[3]);\n\n \/\/ Make sure the alpha channel doesn't come out larger than any of the\n \/\/ color channels. We use premultipled alpha channels, so this should\n \/\/ never happen, but rounding errors will cause this from time to time.\n \/\/ These \"impossible\" colors will cause overflows (and hence random pixel\n \/\/ values) when the resulting bitmap is drawn to the screen.\n \/\/\n \/\/ We only need to do this when generating the final output row (here).\n int max_color_channel = std::max(out_row[byte_offset + 0],\n std::max(out_row[byte_offset + 1], out_row[byte_offset + 2]));\n if (alpha < max_color_channel)\n out_row[byte_offset + 3] = max_color_channel;\n else\n out_row[byte_offset + 3] = alpha;\n } else {\n \/\/ No alpha channel, the image is opaque.\n out_row[byte_offset + 3] = 0xff;\n }\n }\n}\n\n} \/\/ namespace\n\n\/\/ ConvolusionFilter1D ---------------------------------------------------------\n\nvoid ConvolusionFilter1D::AddFilter(int filter_offset,\n const float* filter_values,\n int filter_length) {\n FilterInstance instance;\n instance.data_location = static_cast<int>(filter_values_.size());\n instance.offset = filter_offset;\n instance.length = filter_length;\n filters_.push_back(instance);\n\n SkASSERT(filter_length > 0);\n for (int i = 0; i < filter_length; i++)\n filter_values_.push_back(FloatToFixed(filter_values[i]));\n\n max_filter_ = std::max(max_filter_, filter_length);\n}\n\nvoid ConvolusionFilter1D::AddFilter(int filter_offset,\n const short* filter_values,\n int filter_length) {\n FilterInstance instance;\n instance.data_location = static_cast<int>(filter_values_.size());\n instance.offset = filter_offset;\n instance.length = filter_length;\n filters_.push_back(instance);\n\n SkASSERT(filter_length > 0);\n for (int i = 0; i < filter_length; i++)\n filter_values_.push_back(filter_values[i]);\n\n max_filter_ = std::max(max_filter_, filter_length);\n}\n\n\/\/ BGRAConvolve2D -------------------------------------------------------------\n\nvoid BGRAConvolve2D(const unsigned char* source_data,\n int source_byte_row_stride,\n bool source_has_alpha,\n const ConvolusionFilter1D& filter_x,\n const ConvolusionFilter1D& filter_y,\n unsigned char* output) {\n int max_y_filter_size = filter_y.max_filter();\n\n \/\/ The next row in the input that we will generate a horizontally\n \/\/ convolved row for. If the filter doesn't start at the beginning of the\n \/\/ image (this is the case when we are only resizing a subset), then we\n \/\/ don't want to generate any output rows before that. Compute the starting\n \/\/ row for convolusion as the first pixel for the first vertical filter.\n int filter_offset, filter_length;\n const short* filter_values =\n filter_y.FilterForValue(0, &filter_offset, &filter_length);\n int next_x_row = filter_offset;\n\n \/\/ We loop over each row in the input doing a horizontal convolusion. This\n \/\/ will result in a horizontally convolved image. We write the results into\n \/\/ a circular buffer of convolved rows and do vertical convolusion as rows\n \/\/ are available. This prevents us from having to store the entire\n \/\/ intermediate image and helps cache coherency.\n CircularRowBuffer row_buffer(filter_x.num_values(), max_y_filter_size,\n filter_offset);\n\n \/\/ Loop over every possible output row, processing just enough horizontal\n \/\/ convolusions to run each subsequent vertical convolusion.\n int output_row_byte_width = filter_x.num_values() * 4;\n int num_output_rows = filter_y.num_values();\n for (int out_y = 0; out_y < num_output_rows; out_y++) {\n filter_values = filter_y.FilterForValue(out_y,\n &filter_offset, &filter_length);\n\n \/\/ Generate output rows until we have enough to run the current filter.\n while (next_x_row < filter_offset + filter_length) {\n if (source_has_alpha) {\n ConvolveHorizontally<true>(\n &source_data[next_x_row * source_byte_row_stride],\n filter_x, row_buffer.AdvanceRow());\n } else {\n ConvolveHorizontally<false>(\n &source_data[next_x_row * source_byte_row_stride],\n filter_x, row_buffer.AdvanceRow());\n }\n next_x_row++;\n }\n\n \/\/ Compute where in the output image this row of final data will go.\n unsigned char* cur_output_row = &output[out_y * output_row_byte_width];\n\n \/\/ Get the list of rows that the circular buffer has, in order.\n int first_row_in_circular_buffer;\n unsigned char* const* rows_to_convolve =\n row_buffer.GetRowAddresses(&first_row_in_circular_buffer);\n\n \/\/ Now compute the start of the subset of those rows that the filter\n \/\/ needs.\n unsigned char* const* first_row_for_filter =\n &rows_to_convolve[filter_offset - first_row_in_circular_buffer];\n\n if (source_has_alpha) {\n ConvolveVertically<true>(filter_values, filter_length,\n first_row_for_filter,\n filter_x.num_values(), cur_output_row);\n } else {\n ConvolveVertically<false>(filter_values, filter_length,\n first_row_for_filter,\n filter_x.num_values(), cur_output_row);\n }\n }\n}\n\n} \/\/ namespace gfx\n\n<commit_msg>Add an additional include to get skASSERT.<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 <algorithm>\n\n#include \"skia\/ext\/convolver.h\"\n#include \"SkTypes.h\"\n\nnamespace skia {\n\nnamespace {\n\n\/\/ Converts the argument to an 8-bit unsigned value by clamping to the range\n\/\/ 0-255.\ninline unsigned int ClampTo8(int a) {\n if (static_cast<int>(a) < 256)\n return a; \/\/ Avoid the extra check in the common case.\n if (a < 0)\n return 0;\n return 255;\n}\n\n\/\/ Stores a list of rows in a circular buffer. The usage is you write into it\n\/\/ by calling AdvanceRow. It will keep track of which row in the buffer it\n\/\/ should use next, and the total number of rows added.\nclass CircularRowBuffer {\n public:\n \/\/ The number of pixels in each row is given in |source_row_pixel_width|.\n \/\/ The maximum number of rows needed in the buffer is |max_y_filter_size|\n \/\/ (we only need to store enough rows for the biggest filter).\n \/\/\n \/\/ We use the |first_input_row| to compute the coordinates of all of the\n \/\/ following rows returned by Advance().\n CircularRowBuffer(int dest_row_pixel_width, int max_y_filter_size,\n int first_input_row)\n : row_byte_width_(dest_row_pixel_width * 4),\n num_rows_(max_y_filter_size),\n next_row_(0),\n next_row_coordinate_(first_input_row) {\n buffer_.resize(row_byte_width_ * max_y_filter_size);\n row_addresses_.resize(num_rows_);\n }\n\n \/\/ Moves to the next row in the buffer, returning a pointer to the beginning\n \/\/ of it.\n unsigned char* AdvanceRow() {\n unsigned char* row = &buffer_[next_row_ * row_byte_width_];\n next_row_coordinate_++;\n\n \/\/ Set the pointer to the next row to use, wrapping around if necessary.\n next_row_++;\n if (next_row_ == num_rows_)\n next_row_ = 0;\n return row;\n }\n\n \/\/ Returns a pointer to an \"unrolled\" array of rows. These rows will start\n \/\/ at the y coordinate placed into |*first_row_index| and will continue in\n \/\/ order for the maximum number of rows in this circular buffer.\n \/\/\n \/\/ The |first_row_index_| may be negative. This means the circular buffer\n \/\/ starts before the top of the image (it hasn't been filled yet).\n unsigned char* const* GetRowAddresses(int* first_row_index) {\n \/\/ Example for a 4-element circular buffer holding coords 6-9.\n \/\/ Row 0 Coord 8\n \/\/ Row 1 Coord 9\n \/\/ Row 2 Coord 6 <- next_row_ = 2, next_row_coordinate_ = 10.\n \/\/ Row 3 Coord 7\n \/\/\n \/\/ The \"next\" row is also the first (lowest) coordinate. This computation\n \/\/ may yield a negative value, but that's OK, the math will work out\n \/\/ since the user of this buffer will compute the offset relative\n \/\/ to the first_row_index and the negative rows will never be used.\n *first_row_index = next_row_coordinate_ - num_rows_;\n\n int cur_row = next_row_;\n for (int i = 0; i < num_rows_; i++) {\n row_addresses_[i] = &buffer_[cur_row * row_byte_width_];\n\n \/\/ Advance to the next row, wrapping if necessary.\n cur_row++;\n if (cur_row == num_rows_)\n cur_row = 0;\n }\n return &row_addresses_[0];\n }\n\n private:\n \/\/ The buffer storing the rows. They are packed, each one row_byte_width_.\n std::vector<unsigned char> buffer_;\n\n \/\/ Number of bytes per row in the |buffer_|.\n int row_byte_width_;\n\n \/\/ The number of rows available in the buffer.\n int num_rows_;\n\n \/\/ The next row index we should write into. This wraps around as the\n \/\/ circular buffer is used.\n int next_row_;\n\n \/\/ The y coordinate of the |next_row_|. This is incremented each time a\n \/\/ new row is appended and does not wrap.\n int next_row_coordinate_;\n\n \/\/ Buffer used by GetRowAddresses().\n std::vector<unsigned char*> row_addresses_;\n};\n\n\/\/ Convolves horizontally along a single row. The row data is given in\n\/\/ |src_data| and continues for the num_values() of the filter.\ntemplate<bool has_alpha>\nvoid ConvolveHorizontally(const unsigned char* src_data,\n const ConvolusionFilter1D& filter,\n unsigned char* out_row) {\n \/\/ Loop over each pixel on this row in the output image.\n int num_values = filter.num_values();\n for (int out_x = 0; out_x < num_values; out_x++) {\n \/\/ Get the filter that determines the current output pixel.\n int filter_offset, filter_length;\n const short* filter_values =\n filter.FilterForValue(out_x, &filter_offset, &filter_length);\n\n \/\/ Compute the first pixel in this row that the filter affects. It will\n \/\/ touch |filter_length| pixels (4 bytes each) after this.\n const unsigned char* row_to_filter = &src_data[filter_offset * 4];\n\n \/\/ Apply the filter to the row to get the destination pixel in |accum|.\n int accum[4] = {0};\n for (int filter_x = 0; filter_x < filter_length; filter_x++) {\n short cur_filter = filter_values[filter_x];\n accum[0] += cur_filter * row_to_filter[filter_x * 4 + 0];\n accum[1] += cur_filter * row_to_filter[filter_x * 4 + 1];\n accum[2] += cur_filter * row_to_filter[filter_x * 4 + 2];\n if (has_alpha)\n accum[3] += cur_filter * row_to_filter[filter_x * 4 + 3];\n }\n\n \/\/ Bring this value back in range. All of the filter scaling factors\n \/\/ are in fixed point with kShiftBits bits of fractional part.\n accum[0] >>= ConvolusionFilter1D::kShiftBits;\n accum[1] >>= ConvolusionFilter1D::kShiftBits;\n accum[2] >>= ConvolusionFilter1D::kShiftBits;\n if (has_alpha)\n accum[3] >>= ConvolusionFilter1D::kShiftBits;\n\n \/\/ Store the new pixel.\n out_row[out_x * 4 + 0] = ClampTo8(accum[0]);\n out_row[out_x * 4 + 1] = ClampTo8(accum[1]);\n out_row[out_x * 4 + 2] = ClampTo8(accum[2]);\n if (has_alpha)\n out_row[out_x * 4 + 3] = ClampTo8(accum[3]);\n }\n}\n\n\/\/ Does vertical convolusion to produce one output row. The filter values and\n\/\/ length are given in the first two parameters. These are applied to each\n\/\/ of the rows pointed to in the |source_data_rows| array, with each row\n\/\/ being |pixel_width| wide.\n\/\/\n\/\/ The output must have room for |pixel_width * 4| bytes.\ntemplate<bool has_alpha>\nvoid ConvolveVertically(const short* filter_values,\n int filter_length,\n unsigned char* const* source_data_rows,\n int pixel_width,\n unsigned char* out_row) {\n \/\/ We go through each column in the output and do a vertical convolusion,\n \/\/ generating one output pixel each time.\n for (int out_x = 0; out_x < pixel_width; out_x++) {\n \/\/ Compute the number of bytes over in each row that the current column\n \/\/ we're convolving starts at. The pixel will cover the next 4 bytes.\n int byte_offset = out_x * 4;\n\n \/\/ Apply the filter to one column of pixels.\n int accum[4] = {0};\n for (int filter_y = 0; filter_y < filter_length; filter_y++) {\n short cur_filter = filter_values[filter_y];\n accum[0] += cur_filter * source_data_rows[filter_y][byte_offset + 0];\n accum[1] += cur_filter * source_data_rows[filter_y][byte_offset + 1];\n accum[2] += cur_filter * source_data_rows[filter_y][byte_offset + 2];\n if (has_alpha)\n accum[3] += cur_filter * source_data_rows[filter_y][byte_offset + 3];\n }\n\n \/\/ Bring this value back in range. All of the filter scaling factors\n \/\/ are in fixed point with kShiftBits bits of precision.\n accum[0] >>= ConvolusionFilter1D::kShiftBits;\n accum[1] >>= ConvolusionFilter1D::kShiftBits;\n accum[2] >>= ConvolusionFilter1D::kShiftBits;\n if (has_alpha)\n accum[3] >>= ConvolusionFilter1D::kShiftBits;\n\n \/\/ Store the new pixel.\n out_row[byte_offset + 0] = ClampTo8(accum[0]);\n out_row[byte_offset + 1] = ClampTo8(accum[1]);\n out_row[byte_offset + 2] = ClampTo8(accum[2]);\n if (has_alpha) {\n unsigned char alpha = ClampTo8(accum[3]);\n\n \/\/ Make sure the alpha channel doesn't come out larger than any of the\n \/\/ color channels. We use premultipled alpha channels, so this should\n \/\/ never happen, but rounding errors will cause this from time to time.\n \/\/ These \"impossible\" colors will cause overflows (and hence random pixel\n \/\/ values) when the resulting bitmap is drawn to the screen.\n \/\/\n \/\/ We only need to do this when generating the final output row (here).\n int max_color_channel = std::max(out_row[byte_offset + 0],\n std::max(out_row[byte_offset + 1], out_row[byte_offset + 2]));\n if (alpha < max_color_channel)\n out_row[byte_offset + 3] = max_color_channel;\n else\n out_row[byte_offset + 3] = alpha;\n } else {\n \/\/ No alpha channel, the image is opaque.\n out_row[byte_offset + 3] = 0xff;\n }\n }\n}\n\n} \/\/ namespace\n\n\/\/ ConvolusionFilter1D ---------------------------------------------------------\n\nvoid ConvolusionFilter1D::AddFilter(int filter_offset,\n const float* filter_values,\n int filter_length) {\n FilterInstance instance;\n instance.data_location = static_cast<int>(filter_values_.size());\n instance.offset = filter_offset;\n instance.length = filter_length;\n filters_.push_back(instance);\n\n SkASSERT(filter_length > 0);\n for (int i = 0; i < filter_length; i++)\n filter_values_.push_back(FloatToFixed(filter_values[i]));\n\n max_filter_ = std::max(max_filter_, filter_length);\n}\n\nvoid ConvolusionFilter1D::AddFilter(int filter_offset,\n const short* filter_values,\n int filter_length) {\n FilterInstance instance;\n instance.data_location = static_cast<int>(filter_values_.size());\n instance.offset = filter_offset;\n instance.length = filter_length;\n filters_.push_back(instance);\n\n SkASSERT(filter_length > 0);\n for (int i = 0; i < filter_length; i++)\n filter_values_.push_back(filter_values[i]);\n\n max_filter_ = std::max(max_filter_, filter_length);\n}\n\n\/\/ BGRAConvolve2D -------------------------------------------------------------\n\nvoid BGRAConvolve2D(const unsigned char* source_data,\n int source_byte_row_stride,\n bool source_has_alpha,\n const ConvolusionFilter1D& filter_x,\n const ConvolusionFilter1D& filter_y,\n unsigned char* output) {\n int max_y_filter_size = filter_y.max_filter();\n\n \/\/ The next row in the input that we will generate a horizontally\n \/\/ convolved row for. If the filter doesn't start at the beginning of the\n \/\/ image (this is the case when we are only resizing a subset), then we\n \/\/ don't want to generate any output rows before that. Compute the starting\n \/\/ row for convolusion as the first pixel for the first vertical filter.\n int filter_offset, filter_length;\n const short* filter_values =\n filter_y.FilterForValue(0, &filter_offset, &filter_length);\n int next_x_row = filter_offset;\n\n \/\/ We loop over each row in the input doing a horizontal convolusion. This\n \/\/ will result in a horizontally convolved image. We write the results into\n \/\/ a circular buffer of convolved rows and do vertical convolusion as rows\n \/\/ are available. This prevents us from having to store the entire\n \/\/ intermediate image and helps cache coherency.\n CircularRowBuffer row_buffer(filter_x.num_values(), max_y_filter_size,\n filter_offset);\n\n \/\/ Loop over every possible output row, processing just enough horizontal\n \/\/ convolusions to run each subsequent vertical convolusion.\n int output_row_byte_width = filter_x.num_values() * 4;\n int num_output_rows = filter_y.num_values();\n for (int out_y = 0; out_y < num_output_rows; out_y++) {\n filter_values = filter_y.FilterForValue(out_y,\n &filter_offset, &filter_length);\n\n \/\/ Generate output rows until we have enough to run the current filter.\n while (next_x_row < filter_offset + filter_length) {\n if (source_has_alpha) {\n ConvolveHorizontally<true>(\n &source_data[next_x_row * source_byte_row_stride],\n filter_x, row_buffer.AdvanceRow());\n } else {\n ConvolveHorizontally<false>(\n &source_data[next_x_row * source_byte_row_stride],\n filter_x, row_buffer.AdvanceRow());\n }\n next_x_row++;\n }\n\n \/\/ Compute where in the output image this row of final data will go.\n unsigned char* cur_output_row = &output[out_y * output_row_byte_width];\n\n \/\/ Get the list of rows that the circular buffer has, in order.\n int first_row_in_circular_buffer;\n unsigned char* const* rows_to_convolve =\n row_buffer.GetRowAddresses(&first_row_in_circular_buffer);\n\n \/\/ Now compute the start of the subset of those rows that the filter\n \/\/ needs.\n unsigned char* const* first_row_for_filter =\n &rows_to_convolve[filter_offset - first_row_in_circular_buffer];\n\n if (source_has_alpha) {\n ConvolveVertically<true>(filter_values, filter_length,\n first_row_for_filter,\n filter_x.num_values(), cur_output_row);\n } else {\n ConvolveVertically<false>(filter_values, filter_length,\n first_row_for_filter,\n filter_x.num_values(), cur_output_row);\n }\n }\n}\n\n} \/\/ namespace gfx\n\n<|endoftext|>"} {"text":"<commit_before>\/****************************************************************************\n *\n * Copyright (C) 2014 PX4 Development Team. All rights reserved.\n * Author: Pavel Kirienko <pavel.kirienko@gmail.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 * 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 \"uavcan_node.hpp\"\n#include \"esc_controller.hpp\"\n#include \"indication_controller.hpp\"\n#include <algorithm>\n#include <ch.hpp>\n#include <led.hpp>\n#include <sys\/sys.h>\n#include <config\/config.h>\n#include <uavcan\/protocol\/param_server.hpp>\n#include <uavcan\/protocol\/EnumerationRequest.hpp>\n#include <unistd.h>\n#include <motor\/motor.h>\n#include <watchdog.h>\n\nnamespace uavcan_node\n{\nnamespace\n{\n\ntypedef uavcan::Node<UAVCAN_MEM_POOL_BLOCK_SIZE * 128> Node;\n\nuavcan_stm32::CanInitHelper<> can;\n\nauto node_status_code = uavcan::protocol::NodeStatus::STATUS_INITIALIZING;\nbool passive_mode = true;\n\nCONFIG_PARAM_INT(\"can_bitrate\", 1000000, 20000, 1000000)\nCONFIG_PARAM_INT(\"uavcan_node_id\", 0, 0, 125) \/\/\/< 0 for Passive Mode (default)\n\nNode& get_node()\n{\n\tstatic Node node(can.driver, uavcan_stm32::SystemClock::instance());\n\treturn node;\n}\n\nvoid configure_node()\n{\n\tNode& node = get_node();\n\n\tnode.setNodeID(config_get(\"uavcan_node_id\"));\n\tnode.setName(\"org.pixhawk.px4esc\");\n\n\t\/*\n\t * Software version\n\t *\/\n\tuavcan::protocol::SoftwareVersion swver;\n\n\tswver.major = FW_VERSION_MAJOR;\n\tswver.minor = FW_VERSION_MINOR;\n\n\tswver.vcs_commit = GIT_HASH;\n\tswver.optional_field_mask |= swver.OPTIONAL_FIELD_MASK_VCS_COMMIT;\n\n\tnode.setSoftwareVersion(swver);\n\n\t\/*\n\t * Hardware version\n\t *\/\n\tuavcan::protocol::HardwareVersion hwver;\n\n\thwver.major = board_get_hardware_revision();\n\n\tstd::uint8_t uid[BOARD_UNIQUE_ID_SIZE] = {};\n\tboard_read_unique_id(uid);\n\tstd::copy(std::begin(uid), std::end(uid), std::begin(hwver.unique_id));\n\n\tnode.setHardwareVersion(hwver);\n}\n\nuavcan::ParamServer& get_param_server()\n{\n\tstatic uavcan::ParamServer server(get_node());\n\treturn server;\n}\n\n\/*\n * Param access server\n *\/\nclass ParamManager: public uavcan::IParamManager\n{\n\tvoid convert(float native_value, config_data_type native_type, uavcan::protocol::param::Value& out_value) const\n\t{\n\t\tif (native_type == CONFIG_TYPE_BOOL) {\n\t\t\tout_value.value_bool.push_back(native_value != 0);\n\t\t} else if (native_type == CONFIG_TYPE_INT) {\n\t\t\tout_value.value_int.push_back(native_value);\n\t\t} else if (native_type == CONFIG_TYPE_FLOAT) {\n\t\t\tout_value.value_float.push_back(native_value);\n\t\t} else {\n\t\t\t; \/\/ :(\n\t\t}\n\t}\n\n\tvoid getParamNameByIndex(ParamIndex index, ParamName& out_name) const override\n\t{\n\t\tconst char* name = config_name_by_index(index);\n\t\tif (name != nullptr) {\n\t\t\tout_name = name;\n\t\t}\n\t}\n\n\tvoid assignParamValue(const ParamName& name, const ParamValue& value) override\n\t{\n\t\tconst float native_value = (!value.value_bool.empty()) ? (value.value_bool[0]\n\t\t ? 1 : 0) : (!value.value_int.empty())\n\t\t ? value.value_int[0] : value.value_float[0];\n\t\t(void)config_set(name.c_str(), native_value);\n\t}\n\n\tvoid readParamValue(const ParamName& name, ParamValue& out_value) const override\n\t{\n\t\tconfig_param descr;\n\t\tconst int res = config_get_descr(name.c_str(), &descr);\n\t\tif (res >= 0) {\n\t\t\tconvert(config_get(name.c_str()), descr.type, out_value);\n\t\t}\n\t}\n\n\tvoid readParamDefaultMaxMin(const ParamName& name, ParamValue& out_default,\n\t ParamValue& out_max, ParamValue& out_min) const override\n\t{\n\t\tconfig_param descr;\n\t\tconst int res = config_get_descr(name.c_str(), &descr);\n\t\tif (res >= 0) {\n\t\t\tconvert(descr.default_, descr.type, out_default);\n\t\t\tconvert(descr.max, descr.type, out_max);\n\t\t\tconvert(descr.min, descr.type, out_min);\n\t\t}\n\t}\n\n\tint saveAllParams() override\n\t{\n\t\t\/\/ We can't perform flash IO when the motor controller is active\n\t\tif (motor_is_idle()) {\n\t\t\treturn config_save();\n\t\t} else {\n\t\t\treturn -1;\n\t\t}\n\t}\n\n\tint eraseAllParams() override\n\t{\n\t\t\/\/ We can't perform flash IO when the motor controller is active\n\t\tif (motor_is_idle()) {\n\t\t\treturn config_erase();\n\t\t} else {\n\t\t\treturn -1;\n\t\t}\n\t}\n} param_manager;\n\n\/*\n * Restart handler\n *\/\nclass RestartRequestHandler: public uavcan::IRestartRequestHandler\n{\n\tbool handleRestartRequest(uavcan::NodeID request_source) override\n\t{\n\t\t::lowsyslog(\"UAVCAN: Restarting by request from %i\\n\", int(request_source.get()));\n\t\tNVIC_SystemReset();\n\t\t\/\/ TODO: delayed restart, add around 100 ms to transmit the response\n\t\treturn true; \/\/ Will never be executed BTW\n\t}\n} restart_request_handler;\n\n\/*\n * Enumeration handler\n *\/\nclass EnumerationHandler : public uavcan::TimerBase\n{\n\tstatic constexpr int CONFIRMATION_CHECK_INTERVAL_MSEC = 50;\n\n\ttypedef uavcan::MethodBinder<EnumerationHandler*,\n\t void (EnumerationHandler::*)\n\t (const uavcan::ReceivedDataStructure<uavcan::protocol::EnumerationRequest>&)>\n\t CallbackBinder;\n\n\tuavcan::Subscriber<uavcan::protocol::EnumerationRequest, CallbackBinder> sub_;\n\tuavcan::MonotonicTime confirmation_deadline_;\n\tuavcan::NodeID received_node_id_;\n\tmutable led::Overlay led_ctl;\n\n\tvoid finish(bool reverse) const\n\t{\n\t\t::lowsyslog(\"UAVCAN: Enumeration confirmed: node ID: %d, motor reverse: %d\\n\",\n\t\t\t(int)received_node_id_.get(), (int)reverse);\n\n\t\t(void)config_set(\"uavcan_node_id\", received_node_id_.get());\n\t\t(void)config_set(\"motor_reverse\", reverse);\n\n\t\tmotor_stop(); \/\/ Shouldn't be running anyway\n\n\t\tconst int save_res = config_save();\n\n\t\t::lowsyslog(\"UAVCAN: Enumeration: Config saved (status: %d), restarting...\\n\", save_res);\n\n\t\tmotor_beep(1000, 500);\n\t\t::usleep(500000);\n\t\tNVIC_SystemReset();\n\t}\n\n\tvoid handleTimerEvent(const uavcan::TimerEvent& event) override\n\t{\n\t\tled_ctl.blink(led::Color::CYAN);\n\n\t\tif ((event.real_time >= confirmation_deadline_) || !received_node_id_.isUnicast()) {\n\t\t\t::lowsyslog(\"UAVCAN: Enumeration request expired\\n\");\n\t\t\tthis->stop();\n\t\t\tled_ctl.unset();\n\t\t} else {\n\t\t\tconst auto rotation = motor_get_forced_rotation_direction();\n\t\t\tif (rotation != MOTOR_FORCED_ROTATION_NONE) {\n\t\t\t\tconst bool reverse = rotation != MOTOR_FORCED_ROTATION_FORWARD;\n\t\t\t\tfinish(reverse);\n\t\t\t\tled_ctl.unset();\n\t\t\t}\n\t\t}\n\t}\n\n\tvoid sub_cb(const uavcan::ReceivedDataStructure<uavcan::protocol::EnumerationRequest>& msg)\n\t{\n\t\t::lowsyslog(\"UAVCAN: Enumeration request from %d, received node ID: %d, timeout: %d sec\\n\",\n\t\t\t(int)msg.getSrcNodeID().get(), (int)msg.node_id, (int)msg.timeout_sec);\n\n\t\tif (!uavcan::NodeID(msg.node_id).isUnicast()) {\n\t\t\t::lowsyslog(\"UAVCAN: Enumeration failure - INVALID PARAMS\\n\");\n\t\t\treturn;\n\t\t}\n\n\t\tif (!motor_is_idle()) {\n\t\t\t::lowsyslog(\"UAVCAN: Enumeration failure - MOTOR CONTROLLER IS NOT IDLE\\n\");\n\t\t\treturn;\n\t\t}\n\n\t\treceived_node_id_ = msg.node_id;\n\n\t\tconfirmation_deadline_ = msg.getMonotonicTimestamp() +\n\t\t\t\t\t uavcan::MonotonicDuration::fromMSec(msg.timeout_sec * 1000);\n\n\t\tthis->startPeriodic(uavcan::MonotonicDuration::fromMSec(CONFIRMATION_CHECK_INTERVAL_MSEC));\n\t}\n\npublic:\n\tEnumerationHandler(uavcan::INode& node)\n\t\t: uavcan::TimerBase(node)\n\t\t, sub_(node)\n\t{ }\n\n\tint start()\n\t{\n\t\treturn sub_.start(CallbackBinder(this, &EnumerationHandler::sub_cb));\n\t}\n};\n\n\/*\n * UAVCAN spin loop\n *\/\nclass : public chibios_rt::BaseStaticThread<3000>\n{\n\tuavcan::LazyConstructor<EnumerationHandler> enumeration_handler_;\n\tint watchdog_id_ = -1;\n\n\tvoid init()\n\t{\n\t\twatchdog_id_ = watchdog_create(10000);\n\n\t\tconfigure_node();\n\n\t\tget_node().setRestartRequestHandler(&restart_request_handler);\n\n\t\t\/\/ Starting the UAVCAN node\n\t\twhile (true) {\n\t\t\tconst int uavcan_start_res = get_node().start();\n\t\t\tif (uavcan_start_res >= 0) {\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\t::lowsyslog(\"UAVCAN: Node init failure: %i, will retry\\n\", uavcan_start_res);\n\t\t\t::sleep(3);\n\t\t}\n\t\tassert(get_node().isStarted());\n\n\t\tpassive_mode = get_node().isPassiveMode();\n\n\t\tif (!passive_mode) {\n\t\t\twhile (get_param_server().start(¶m_manager) < 0) {\n\t\t\t\t; \/\/ That's impossible to fail\n\t\t\t}\n\n\t\t\twhile (init_esc_controller(get_node()) < 0) {\n\t\t\t\t::lowsyslog(\"UAVCAN: ESC controller init failed\\n\");\n\t\t\t\t::sleep(1);\n\t\t\t}\n\n\t\t\twhile (init_indication_controller(get_node()) < 0) {\n\t\t\t\t::lowsyslog(\"UAVCAN: Indication controller init failed\\n\");\n\t\t\t\t::sleep(1);\n\t\t\t}\n\n\t\t\t::lowsyslog(\"UAVCAN: Node started, ID %i\\n\", int(get_node().getNodeID().get()));\n\t\t} else {\n\t\t\t::lowsyslog(\"UAVCAN: PASSIVE MODE\\n\");\n\n\t\t\tenumeration_handler_.construct<uavcan::INode&>(get_node());\n\t\t\twhile (enumeration_handler_->start() < 0) {\n\t\t\t\t::lowsyslog(\"UAVCAN: Enumeration handler start failed\\n\");\n\t\t\t\t::sleep(1);\n\t\t\t}\n\t\t\t::lowsyslog(\"UAVCAN: Enumeration handler started\\n\");\n\t\t}\n\t}\n\npublic:\n\tmsg_t main() override\n\t{\n\t\tinit();\n\n\t\twhile (true) {\n\t\t\tget_node().getNodeStatusProvider().setStatusCode(node_status_code);\n\n\t\t\tconst int spin_res = get_node().spin(uavcan::MonotonicDuration::fromMSec(100));\n\t\t\tif (spin_res < 0) {\n\t\t\t\t::lowsyslog(\"UAVCAN: Spin failure: %i\\n\", spin_res);\n\t\t\t}\n\n\t\t\twatchdog_reset(watchdog_id_);\n\t\t}\n\t\treturn msg_t();\n\t}\n} node_thread;\n\n}\n\nvoid set_node_status_ok()\n{\n\tnode_status_code = uavcan::protocol::NodeStatus::STATUS_OK;\n}\n\nvoid set_node_status_warning()\n{\n\tnode_status_code = uavcan::protocol::NodeStatus::STATUS_WARNING;\n}\n\nvoid set_node_status_critical()\n{\n\tnode_status_code = uavcan::protocol::NodeStatus::STATUS_CRITICAL;\n}\n\nbool is_passive_mode()\n{\n\treturn passive_mode;\n}\n\nint init()\n{\n\tint remained_attempts = 5;\n\n\twhile (true) {\n\t\tint can_res = can.init(config_get(\"can_bitrate\"));\n\t\tif (can_res >= 0) {\n\t\t\t::lowsyslog(\"UAVCAN: CAN bitrate %u bps\\n\", unsigned(config_get(\"can_bitrate\")));\n\t\t\tbreak;\n\t\t}\n\n\t\t::lowsyslog(\"UAVCAN: CAN init failed [%i], trying default bitrate...\\n\", can_res);\n\n\t\tauto descr = ::config_param();\n\t\t(void)config_get_descr(\"can_bitrate\", &descr);\n\n\t\tcan_res = can.init(descr.default_);\n\t\tif (can_res >= 0) {\n\t\t\t::lowsyslog(\"UAVCAN: CAN bitrate %u bps\\n\", unsigned(descr.default_));\n\t\t\tbreak;\n\t\t}\n\n\t\tremained_attempts--;\n\t\tif (remained_attempts <= 0) {\n\t\t\t::lowsyslog(\"UAVCAN: CAN driver init failure: %i\\n\", can_res);\n\t\t\treturn -1;\n\t\t}\n\n\t\t::usleep(100000);\n\t}\n\n\t(void)node_thread.start((HIGHPRIO + NORMALPRIO) \/ 2);\n\n\treturn 0;\n}\n\n}\n<commit_msg>CAN autobauding<commit_after>\/****************************************************************************\n *\n * Copyright (C) 2014 PX4 Development Team. All rights reserved.\n * Author: Pavel Kirienko <pavel.kirienko@gmail.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 * 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 \"uavcan_node.hpp\"\n#include \"esc_controller.hpp\"\n#include \"indication_controller.hpp\"\n#include <algorithm>\n#include <ch.hpp>\n#include <led.hpp>\n#include <sys\/sys.h>\n#include <config\/config.h>\n#include <uavcan\/protocol\/param_server.hpp>\n#include <uavcan\/protocol\/EnumerationRequest.hpp>\n#include <unistd.h>\n#include <motor\/motor.h>\n#include <watchdog.h>\n\nnamespace uavcan_node\n{\nnamespace\n{\n\ntypedef uavcan::Node<UAVCAN_MEM_POOL_BLOCK_SIZE * 128> Node;\n\nuavcan_stm32::CanInitHelper<> can;\n\nauto node_status_code = uavcan::protocol::NodeStatus::STATUS_INITIALIZING;\nbool passive_mode = true;\n\nCONFIG_PARAM_INT(\"can_bitrate\", 0, 0, 1000000) \/\/\/< 0 for Autobaud (default)\nCONFIG_PARAM_INT(\"uavcan_node_id\", 0, 0, 125) \/\/\/< 0 for Passive Mode (default)\n\nNode& get_node()\n{\n\tstatic Node node(can.driver, uavcan_stm32::SystemClock::instance());\n\treturn node;\n}\n\nvoid configure_node()\n{\n\tNode& node = get_node();\n\n\tnode.setNodeID(config_get(\"uavcan_node_id\"));\n\tnode.setName(\"org.pixhawk.px4esc\");\n\n\t\/*\n\t * Software version\n\t *\/\n\tuavcan::protocol::SoftwareVersion swver;\n\n\tswver.major = FW_VERSION_MAJOR;\n\tswver.minor = FW_VERSION_MINOR;\n\n\tswver.vcs_commit = GIT_HASH;\n\tswver.optional_field_mask |= swver.OPTIONAL_FIELD_MASK_VCS_COMMIT;\n\n\tnode.setSoftwareVersion(swver);\n\n\t\/*\n\t * Hardware version\n\t *\/\n\tuavcan::protocol::HardwareVersion hwver;\n\n\thwver.major = board_get_hardware_revision();\n\n\tstd::uint8_t uid[BOARD_UNIQUE_ID_SIZE] = {};\n\tboard_read_unique_id(uid);\n\tstd::copy(std::begin(uid), std::end(uid), std::begin(hwver.unique_id));\n\n\tnode.setHardwareVersion(hwver);\n}\n\nuavcan::ParamServer& get_param_server()\n{\n\tstatic uavcan::ParamServer server(get_node());\n\treturn server;\n}\n\n\/*\n * Param access server\n *\/\nclass ParamManager: public uavcan::IParamManager\n{\n\tvoid convert(float native_value, config_data_type native_type, uavcan::protocol::param::Value& out_value) const\n\t{\n\t\tif (native_type == CONFIG_TYPE_BOOL) {\n\t\t\tout_value.value_bool.push_back(native_value != 0);\n\t\t} else if (native_type == CONFIG_TYPE_INT) {\n\t\t\tout_value.value_int.push_back(native_value);\n\t\t} else if (native_type == CONFIG_TYPE_FLOAT) {\n\t\t\tout_value.value_float.push_back(native_value);\n\t\t} else {\n\t\t\t; \/\/ :(\n\t\t}\n\t}\n\n\tvoid getParamNameByIndex(ParamIndex index, ParamName& out_name) const override\n\t{\n\t\tconst char* name = config_name_by_index(index);\n\t\tif (name != nullptr) {\n\t\t\tout_name = name;\n\t\t}\n\t}\n\n\tvoid assignParamValue(const ParamName& name, const ParamValue& value) override\n\t{\n\t\tconst float native_value = (!value.value_bool.empty()) ? (value.value_bool[0]\n\t\t ? 1 : 0) : (!value.value_int.empty())\n\t\t ? value.value_int[0] : value.value_float[0];\n\t\t(void)config_set(name.c_str(), native_value);\n\t}\n\n\tvoid readParamValue(const ParamName& name, ParamValue& out_value) const override\n\t{\n\t\tconfig_param descr;\n\t\tconst int res = config_get_descr(name.c_str(), &descr);\n\t\tif (res >= 0) {\n\t\t\tconvert(config_get(name.c_str()), descr.type, out_value);\n\t\t}\n\t}\n\n\tvoid readParamDefaultMaxMin(const ParamName& name, ParamValue& out_default,\n\t ParamValue& out_max, ParamValue& out_min) const override\n\t{\n\t\tconfig_param descr;\n\t\tconst int res = config_get_descr(name.c_str(), &descr);\n\t\tif (res >= 0) {\n\t\t\tconvert(descr.default_, descr.type, out_default);\n\t\t\tconvert(descr.max, descr.type, out_max);\n\t\t\tconvert(descr.min, descr.type, out_min);\n\t\t}\n\t}\n\n\tint saveAllParams() override\n\t{\n\t\t\/\/ We can't perform flash IO when the motor controller is active\n\t\tif (motor_is_idle()) {\n\t\t\treturn config_save();\n\t\t} else {\n\t\t\treturn -1;\n\t\t}\n\t}\n\n\tint eraseAllParams() override\n\t{\n\t\t\/\/ We can't perform flash IO when the motor controller is active\n\t\tif (motor_is_idle()) {\n\t\t\treturn config_erase();\n\t\t} else {\n\t\t\treturn -1;\n\t\t}\n\t}\n} param_manager;\n\n\/*\n * Restart handler\n *\/\nclass RestartRequestHandler: public uavcan::IRestartRequestHandler\n{\n\tbool handleRestartRequest(uavcan::NodeID request_source) override\n\t{\n\t\t::lowsyslog(\"UAVCAN: Restarting by request from %i\\n\", int(request_source.get()));\n\t\tNVIC_SystemReset();\n\t\t\/\/ TODO: delayed restart, add around 100 ms to transmit the response\n\t\treturn true; \/\/ Will never be executed BTW\n\t}\n} restart_request_handler;\n\n\/*\n * Enumeration handler\n *\/\nclass EnumerationHandler : public uavcan::TimerBase\n{\n\tstatic constexpr int CONFIRMATION_CHECK_INTERVAL_MSEC = 50;\n\n\ttypedef uavcan::MethodBinder<EnumerationHandler*,\n\t void (EnumerationHandler::*)\n\t (const uavcan::ReceivedDataStructure<uavcan::protocol::EnumerationRequest>&)>\n\t CallbackBinder;\n\n\tuavcan::Subscriber<uavcan::protocol::EnumerationRequest, CallbackBinder> sub_;\n\tuavcan::MonotonicTime confirmation_deadline_;\n\tuavcan::NodeID received_node_id_;\n\tmutable led::Overlay led_ctl;\n\n\tvoid finish(bool reverse) const\n\t{\n\t\t::lowsyslog(\"UAVCAN: Enumeration confirmed: node ID: %d, motor reverse: %d\\n\",\n\t\t\t(int)received_node_id_.get(), (int)reverse);\n\n\t\t(void)config_set(\"uavcan_node_id\", received_node_id_.get());\n\t\t(void)config_set(\"motor_reverse\", reverse);\n\n\t\tmotor_stop(); \/\/ Shouldn't be running anyway\n\n\t\tconst int save_res = config_save();\n\n\t\t::lowsyslog(\"UAVCAN: Enumeration: Config saved (status: %d), restarting...\\n\", save_res);\n\n\t\tmotor_beep(1000, 500);\n\t\t::usleep(500000);\n\t\tNVIC_SystemReset();\n\t}\n\n\tvoid handleTimerEvent(const uavcan::TimerEvent& event) override\n\t{\n\t\tled_ctl.blink(led::Color::CYAN);\n\n\t\tif ((event.real_time >= confirmation_deadline_) || !received_node_id_.isUnicast()) {\n\t\t\t::lowsyslog(\"UAVCAN: Enumeration request expired\\n\");\n\t\t\tthis->stop();\n\t\t\tled_ctl.unset();\n\t\t} else {\n\t\t\tconst auto rotation = motor_get_forced_rotation_direction();\n\t\t\tif (rotation != MOTOR_FORCED_ROTATION_NONE) {\n\t\t\t\tconst bool reverse = rotation != MOTOR_FORCED_ROTATION_FORWARD;\n\t\t\t\tfinish(reverse);\n\t\t\t\tled_ctl.unset();\n\t\t\t}\n\t\t}\n\t}\n\n\tvoid sub_cb(const uavcan::ReceivedDataStructure<uavcan::protocol::EnumerationRequest>& msg)\n\t{\n\t\t::lowsyslog(\"UAVCAN: Enumeration request from %d, received node ID: %d, timeout: %d sec\\n\",\n\t\t\t(int)msg.getSrcNodeID().get(), (int)msg.node_id, (int)msg.timeout_sec);\n\n\t\tif (!uavcan::NodeID(msg.node_id).isUnicast()) {\n\t\t\t::lowsyslog(\"UAVCAN: Enumeration failure - INVALID PARAMS\\n\");\n\t\t\treturn;\n\t\t}\n\n\t\tif (!motor_is_idle()) {\n\t\t\t::lowsyslog(\"UAVCAN: Enumeration failure - MOTOR CONTROLLER IS NOT IDLE\\n\");\n\t\t\treturn;\n\t\t}\n\n\t\treceived_node_id_ = msg.node_id;\n\n\t\tconfirmation_deadline_ = msg.getMonotonicTimestamp() +\n\t\t\t\t\t uavcan::MonotonicDuration::fromMSec(msg.timeout_sec * 1000);\n\n\t\tthis->startPeriodic(uavcan::MonotonicDuration::fromMSec(CONFIRMATION_CHECK_INTERVAL_MSEC));\n\t}\n\npublic:\n\tEnumerationHandler(uavcan::INode& node)\n\t\t: uavcan::TimerBase(node)\n\t\t, sub_(node)\n\t{ }\n\n\tint start()\n\t{\n\t\treturn sub_.start(CallbackBinder(this, &EnumerationHandler::sub_cb));\n\t}\n};\n\n\/*\n * UAVCAN spin loop\n *\/\nclass : public chibios_rt::BaseStaticThread<3000>\n{\n\tuavcan::LazyConstructor<EnumerationHandler> enumeration_handler_;\n\tint watchdog_id_ = -1;\n\n\tvoid init_bus()\n\t{\n\t\tstatic const unsigned AUTOBAUD_VALUES_BPS[4] = {\n\t\t\t1000000,\n\t\t\t500000,\n\t\t\t250000,\n\t\t\t125000\n\t\t};\n\n\t\tstatic const unsigned AUTOBAUD_LISTENING_DELAY_MSEC = 2050;\n\n\t\tled::Overlay led;\n\n\t\tled.set(led::Color::PURPLE);\n\n\t\twhile (true) {\n\t\t\tif (config_get(\"can_bitrate\") > 0) {\n\t\t\t\tconst int can_res = can.init(config_get(\"can_bitrate\"));\n\t\t\t\tif (can_res >= 0) {\n\t\t\t\t\t::lowsyslog(\"UAVCAN: CAN bitrate %u bps\\n\",\n\t\t\t\t\t\tunsigned(config_get(\"can_bitrate\")));\n\t\t\t\t\treturn;\n\t\t\t\t}\n\t\t\t\t::lowsyslog(\"UAVCAN: Failed to init CAN bus at requested baud rate %u bps: error %i\\n\",\n\t\t\t\t\tunsigned(config_get(\"can_bitrate\")), can_res);\n\t\t\t}\n\n\t\t\tfor (auto& bps: AUTOBAUD_VALUES_BPS) {\n\t\t\t\twatchdog_reset(watchdog_id_);\n\t\t\t\t::usleep(1000);\n\t\t\t\t::lowsyslog(\"UAVCAN: Autobaud: Trying %u bps...\\n\", bps);\n\n\t\t\t\tconst int can_res = can.init(bps);\n\t\t\t\tif (can_res < 0) {\n\t\t\t\t\t::lowsyslog(\"UAVCAN: Autobaud: Could not init CAN driver at %u bps: error %i\\n\",\n\t\t\t\t\t\tbps, can_res);\n\t\t\t\t\tcontinue;\n\t\t\t\t}\n\n\t\t\t\t::lowsyslog(\"UAVCAN: Autobaud: CAN driver initialized at %u bps, listening...\\n\",\n\t\t\t\t\tbps);\n\n\t\t\t\t::usleep(AUTOBAUD_LISTENING_DELAY_MSEC * 1000);\n\n\t\t\t\tfor (unsigned i = 0; i < can.driver.getNumIfaces(); i++) {\n\t\t\t\t\tif (!can.driver.getIface(i)->isRxBufferEmpty()) {\n\t\t\t\t\t\t::lowsyslog(\"UAVCAN: Autobaud: Bus activity at %u bps, iface %u, done\\n\",\n\t\t\t\t\t\t\tbps, i);\n\t\t\t\t\t\treturn;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\n\t\t\t::lowsyslog(\"UAVCAN: Could not init CAN bus, will try again soon\\n\");\n\t\t\twatchdog_reset(watchdog_id_);\n\t\t\t::usleep(5000);\n\t\t\twatchdog_reset(watchdog_id_);\n\t\t}\n\t}\n\n\tvoid init_node()\n\t{\n\t\tconfigure_node();\n\n\t\tget_node().setRestartRequestHandler(&restart_request_handler);\n\n\t\t\/\/ Starting the UAVCAN node\n\t\twhile (true) {\n\t\t\tconst int uavcan_start_res = get_node().start();\n\t\t\tif (uavcan_start_res >= 0) {\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\t::lowsyslog(\"UAVCAN: Node init failure: %i, will retry\\n\", uavcan_start_res);\n\t\t\t::sleep(3);\n\t\t}\n\t\tassert(get_node().isStarted());\n\n\t\tpassive_mode = get_node().isPassiveMode();\n\n\t\tif (!passive_mode) {\n\t\t\twhile (get_param_server().start(¶m_manager) < 0) {\n\t\t\t\t; \/\/ That's impossible to fail\n\t\t\t}\n\n\t\t\twhile (init_esc_controller(get_node()) < 0) {\n\t\t\t\t::lowsyslog(\"UAVCAN: ESC controller init failed\\n\");\n\t\t\t\t::sleep(1);\n\t\t\t}\n\n\t\t\twhile (init_indication_controller(get_node()) < 0) {\n\t\t\t\t::lowsyslog(\"UAVCAN: Indication controller init failed\\n\");\n\t\t\t\t::sleep(1);\n\t\t\t}\n\n\t\t\t::lowsyslog(\"UAVCAN: Node started, ID %i\\n\", int(get_node().getNodeID().get()));\n\t\t} else {\n\t\t\t::lowsyslog(\"UAVCAN: PASSIVE MODE\\n\");\n\n\t\t\tenumeration_handler_.construct<uavcan::INode&>(get_node());\n\t\t\twhile (enumeration_handler_->start() < 0) {\n\t\t\t\t::lowsyslog(\"UAVCAN: Enumeration handler start failed\\n\");\n\t\t\t\t::sleep(1);\n\t\t\t}\n\t\t\t::lowsyslog(\"UAVCAN: Enumeration handler started\\n\");\n\t\t}\n\t}\n\npublic:\n\tmsg_t main() override\n\t{\n\t\twatchdog_id_ = watchdog_create(10000);\n\t\tinit_bus();\n\t\twatchdog_reset(watchdog_id_);\n\t\tinit_node();\n\t\twatchdog_reset(watchdog_id_);\n\n\t\twhile (true) {\n\t\t\tget_node().getNodeStatusProvider().setStatusCode(node_status_code);\n\n\t\t\tconst int spin_res = get_node().spin(uavcan::MonotonicDuration::fromMSec(100));\n\t\t\tif (spin_res < 0) {\n\t\t\t\t::lowsyslog(\"UAVCAN: Spin failure: %i\\n\", spin_res);\n\t\t\t}\n\n\t\t\twatchdog_reset(watchdog_id_);\n\t\t}\n\t\treturn msg_t();\n\t}\n} node_thread;\n\n}\n\nvoid set_node_status_ok()\n{\n\tnode_status_code = uavcan::protocol::NodeStatus::STATUS_OK;\n}\n\nvoid set_node_status_warning()\n{\n\tnode_status_code = uavcan::protocol::NodeStatus::STATUS_WARNING;\n}\n\nvoid set_node_status_critical()\n{\n\tnode_status_code = uavcan::protocol::NodeStatus::STATUS_CRITICAL;\n}\n\nbool is_passive_mode()\n{\n\treturn passive_mode;\n}\n\nint init()\n{\n\t(void)node_thread.start((HIGHPRIO + NORMALPRIO) \/ 2);\n\n\treturn 0;\n}\n\n}\n<|endoftext|>"} {"text":"<commit_before>\/**\n * This file is part of the \"FnordMetric\" project\n * Copyright (c) 2014 Paul Asmuth, Google Inc.\n *\n * FnordMetric is free software: you can redistribute it and\/or modify it under\n * the terms of the GNU General Public License v3.0. You should have received a\n * copy of the GNU General Public License along with this program. If not, see\n * <http:\/\/www.gnu.org\/licenses\/>.\n *\/\n#include <fnordmetric\/environment.h>\n#include <fnordmetric\/metricdb\/adminui.h>\n#include <fnord\/base\/uri.h>\n\nnamespace fnordmetric {\nnamespace metricdb {\n\nstd::unique_ptr<http::HTTPHandler> AdminUI::getHandler() {\n return std::unique_ptr<http::HTTPHandler>(new AdminUI());\n}\n\nAdminUI::AdminUI() :\n webui_bundle_(\"FnordMetric\"),\n webui_mount_(&webui_bundle_, \"\/admin\") {\n webui_bundle_.addComponent(\"fnord\/fnord.js\");\n webui_bundle_.addComponent(\"fnord\/themes\/midnight-blue.css\");\n webui_bundle_.addComponent(\"fnord\/components\/fn-appbar.html\");\n webui_bundle_.addComponent(\"fnord\/components\/fn-icon.html\");\n webui_bundle_.addComponent(\"fnord\/components\/fn-loader.html\");\n webui_bundle_.addComponent(\"fnord\/components\/fn-search.html\");\n webui_bundle_.addComponent(\"fnord\/components\/fn-table.html\");\n webui_bundle_.addComponent(\"fnord\/3rdparty\/fontawesome.woff\");\n webui_bundle_.addComponent(\"fnord\/3rdparty\/fontawesome.css\");\n\n webui_bundle_.addComponent(\"fnordmetric\/fnordmetric-app.html\");\n webui_bundle_.addComponent(\"fnordmetric\/fnordmetric-metric-list.html\");\n webui_bundle_.addComponent(\"fnordmetric\/fnordmetric-webui.html\");\n webui_bundle_.addComponent(\"fnordmetric\/fnordmetric-webui.css\");\n webui_bundle_.addComponent(\"fnordmetric\/fnordmetric-webui-util.js\");\n}\n\nbool AdminUI::handleHTTPRequest(\n http::HTTPRequest* request,\n http::HTTPResponse* response) {\n\n if (env()->verbose()) {\n fnord::util::LogEntry log_entry;\n log_entry.append(\"__severity__\", \"DEBUG\");\n log_entry.printf(\n \"__message__\",\n \"HTTP request: %s %s\",\n request->getMethod().c_str(),\n request->getUrl().c_str());\n\n env()->logger()->log(log_entry);\n }\n\n if (webui_mount_.handleHTTPRequest(request, response)) {\n return true;\n }\n\n fnord::URI uri(request->getUrl());\n auto path = uri.path();\n\n if (path == \"\/\") {\n response->setStatus(http::kStatusFound);\n response->addHeader(\"Content-Type\", \"text\/html; charset=utf-8\");\n response->addHeader(\"Location\", \"\/admin\");\n return true;\n }\n\n return false;\n}\n\n\n}\n}\n<commit_msg>fn-button...<commit_after>\/**\n * This file is part of the \"FnordMetric\" project\n * Copyright (c) 2014 Paul Asmuth, Google Inc.\n *\n * FnordMetric is free software: you can redistribute it and\/or modify it under\n * the terms of the GNU General Public License v3.0. You should have received a\n * copy of the GNU General Public License along with this program. If not, see\n * <http:\/\/www.gnu.org\/licenses\/>.\n *\/\n#include <fnordmetric\/environment.h>\n#include <fnordmetric\/metricdb\/adminui.h>\n#include <fnord\/base\/uri.h>\n\nnamespace fnordmetric {\nnamespace metricdb {\n\nstd::unique_ptr<http::HTTPHandler> AdminUI::getHandler() {\n return std::unique_ptr<http::HTTPHandler>(new AdminUI());\n}\n\nAdminUI::AdminUI() :\n webui_bundle_(\"FnordMetric\"),\n webui_mount_(&webui_bundle_, \"\/admin\") {\n webui_bundle_.addComponent(\"fnord\/fnord.js\");\n webui_bundle_.addComponent(\"fnord\/themes\/midnight-blue.css\");\n webui_bundle_.addComponent(\"fnord\/components\/fn-appbar.html\");\n webui_bundle_.addComponent(\"fnord\/components\/fn-button.html\");\n webui_bundle_.addComponent(\"fnord\/components\/fn-icon.html\");\n webui_bundle_.addComponent(\"fnord\/components\/fn-loader.html\");\n webui_bundle_.addComponent(\"fnord\/components\/fn-search.html\");\n webui_bundle_.addComponent(\"fnord\/components\/fn-table.html\");\n webui_bundle_.addComponent(\"fnord\/3rdparty\/fontawesome.woff\");\n webui_bundle_.addComponent(\"fnord\/3rdparty\/fontawesome.css\");\n\n webui_bundle_.addComponent(\"fnordmetric\/fnordmetric-app.html\");\n webui_bundle_.addComponent(\"fnordmetric\/fnordmetric-metric-list.html\");\n webui_bundle_.addComponent(\"fnordmetric\/fnordmetric-webui.html\");\n webui_bundle_.addComponent(\"fnordmetric\/fnordmetric-webui.css\");\n webui_bundle_.addComponent(\"fnordmetric\/fnordmetric-webui-util.js\");\n}\n\nbool AdminUI::handleHTTPRequest(\n http::HTTPRequest* request,\n http::HTTPResponse* response) {\n\n if (env()->verbose()) {\n fnord::util::LogEntry log_entry;\n log_entry.append(\"__severity__\", \"DEBUG\");\n log_entry.printf(\n \"__message__\",\n \"HTTP request: %s %s\",\n request->getMethod().c_str(),\n request->getUrl().c_str());\n\n env()->logger()->log(log_entry);\n }\n\n if (webui_mount_.handleHTTPRequest(request, response)) {\n return true;\n }\n\n fnord::URI uri(request->getUrl());\n auto path = uri.path();\n\n if (path == \"\/\") {\n response->setStatus(http::kStatusFound);\n response->addHeader(\"Content-Type\", \"text\/html; charset=utf-8\");\n response->addHeader(\"Location\", \"\/admin\");\n return true;\n }\n\n return false;\n}\n\n\n}\n}\n<|endoftext|>"} {"text":"<commit_before>\/**\n Пример класса SafetyArray из 8-ой лекции\n*\/\n\n#include <algorithm> \/\/\/ используем функцию copy_n для копирования элементов одного массива в другой\n#include <iostream> \/\/\/ вывод на консоль\n#include <cstdlib> \/\/\/ нужна для правильного выбора функции abs\n#include <cmath> \/\/\/ причина аналогична выше\n\nclass SafetyArray\n{\npublic:\n SafetyArray(); \/\/\/ конструктор раз\n SafetyArray(size_t sz); \/\/\/ конструктор два\n SafetyArray(size_t sz, double value); \/\/\/ конструктор три\n\n ~SafetyArray(); \/\/\/ деструктор\n\n double elem_at(int index) const;\n size_t length() const;\n\n SafetyArray& push_to_end(double new_value);\n SafetyArray& set_at(int index, double value);\n\n SafetyArray& operator=(const SafetyArray& rhs);\n friend std::ostream& operator<<(std::ostream&, const SafetyArray&);\n\nprivate:\n double *_arr;\n size_t _length;\n size_t _capacity;\n\n size_t compute_index(int index) const;\n};\n\nint main()\n{\n SafetyArray my_test_arr; \/\/ создаём массив\n\n \/\/ заполняем первые 4 элемента\n my_test_arr.push_to_end(4.5).push_to_end(7.89)\n .push_to_end(0.555).push_to_end(-8.4);\n\n std::cout << \"Длина массива: \" << my_test_arr.length()\n << \"\\nЕго элементы:\\n[\";\n for (size_t i = 0; i < my_test_arr.length(); ++i) {\n if (i != 0) {\n std::cout << \", \";\n }\n\n std::cout << my_test_arr.elem_at(i);\n }\n std::cout << \"]\\n\";\n\n SafetyArray arr1, arr2;\n\n arr1.push_to_end(555.5);\n arr1.push_to_end(9.992);\n\n arr2 = arr1;\n arr2.set_at(1, 6.78); \/\/ устанавливаем второй элемент\n\n std::cout << \"Второй элемент массива arr1: \" << arr1 << \"\\n\";\n std::cout << \"Второй элемент массива arr2: \" << arr2 << \"\\n\";\n\n SafetyArray arr3, arr4{16}, arr5{20, 4.4};\n std::cout << arr3 << \"\\n\\n\"\n << arr4 << \"\\n\\n\"\n << arr5 << \"\\n\\n\";\n}\n\nSafetyArray::SafetyArray() :\n _arr{new double[4]}, _length{0}, _capacity{4}\n{}\n\nSafetyArray::SafetyArray(size_t sz) :\n _arr{new double[sz]}, _length{0}, _capacity{sz}\n{}\n\nSafetyArray::SafetyArray(size_t sz, double value) :\n _arr{new double[sz]}, _length{sz}, _capacity{sz}\n{\n for (size_t i = 0; i < sz; ++i) {\n _arr[i] = value;\n }\n}\n\nSafetyArray::~SafetyArray()\n{\n delete[] _arr;\n}\n\nsize_t SafetyArray::length() const\n{\n return _length;\n}\n\nSafetyArray& SafetyArray::push_to_end(double new_value)\n{\n if ( _length < _capacity ) {\n _arr[_length] = new_value;\n } else {\n \t_capacity *= 2;\n \tdouble *new_arr = new double[_capacity];\n \tfor (size_t i = 0; i < _length; ++i) {\n \t new_arr[i] = _arr[i];\n \t}\n \tnew_arr[_length] = new_value;\n \tdelete[] _arr;\n \t_arr = new_arr;\n }\n\n ++_length;\n return *this;\n}\n\nsize_t SafetyArray::compute_index(int index) const\n{\n if (index == 0) {\n return 0;\n } else if (index > 0) {\n return std::abs(index) % _length;\n }\n\n size_t rel_index = std::abs(index) % _length;\n if (rel_index == 0) {\n return 0;\n }\n\n return std::abs(_length - rel_index);\n}\n\ndouble SafetyArray::elem_at(int index) const\n{\n if (_length == 0) {\n return std::nan(\"\");\n }\n\n return _arr[ compute_index(index) ];\n}\n\nSafetyArray& SafetyArray::set_at(int index, double value)\n{\n if (_length != 0) {\n\t_arr[ compute_index(index) ] = value;\n }\n\n return *this;\n}\n\nSafetyArray& SafetyArray::operator=(const SafetyArray& rhs)\n{\n if (this != &rhs) {\n\tdelete[] _arr;\n\t_length = rhs._length;\n\t_capacity = rhs._capacity;\n\n\t_arr = new double[_length];\n\tstd::copy_n(rhs._arr, _length, _arr);\n }\n\n return *this;\n}\n\nstd::ostream& operator<<(std::ostream& os, const SafetyArray& rhs)\n{\n os << \"{Длина: \" << rhs.length() << \", ёмкость: \"\n << rhs._capacity << \"\\n\";\n\n os << \"[\";\n for (size_t i = 0; i < rhs.length(); ++i) {\n if (i != 0) { os << \", \"; }\n\n os << rhs.elem_at(i);\n }\n os << \"]}\";\n\n return os;\n}\n<commit_msg>extra demo for last example<commit_after>\/**\n Пример класса SafetyArray из 8-ой лекции\n*\/\n\n#include <algorithm> \/\/\/ используем функцию copy_n для копирования элементов одного массива в другой\n#include <iostream> \/\/\/ вывод на консоль\n#include <cstdlib> \/\/\/ нужна для правильного выбора функции abs\n#include <cmath> \/\/\/ причина аналогична выше\n\nclass SafetyArray\n{\npublic:\n SafetyArray(); \/\/\/ конструктор раз\n SafetyArray(size_t sz); \/\/\/ конструктор два\n SafetyArray(size_t sz, double value); \/\/\/ конструктор три\n\n ~SafetyArray(); \/\/\/ деструктор\n\n double elem_at(int index) const;\n size_t length() const;\n\n SafetyArray& push_to_end(double new_value);\n SafetyArray& set_at(int index, double value);\n\n SafetyArray& operator=(const SafetyArray& rhs);\n friend std::ostream& operator<<(std::ostream&, const SafetyArray&);\n\nprivate:\n double *_arr;\n size_t _length;\n size_t _capacity;\n\n size_t compute_index(int index) const;\n};\n\nint main()\n{\n SafetyArray my_test_arr; \/\/\/ создаём массив\n\n \/\/\/ заполняем первые 4 элемента\n my_test_arr.push_to_end(4.5).push_to_end(7.89)\n .push_to_end(0.555).push_to_end(-8.4);\n\n std::cout << \"Длина массива: \" << my_test_arr.length()\n << \"\\nЕго элементы:\\n[\";\n for (size_t i = 0; i < my_test_arr.length(); ++i) {\n if (i != 0) {\n std::cout << \", \";\n }\n\n std::cout << my_test_arr.elem_at(i);\n }\n std::cout << \"]\\n\";\n\n \/\/\/ проверка доступа к элементам по отрицательным индексам\n for (int i = -8; i <= 8; ++i) {\n cout << \"my_test_arr.elem_at(\" << i << \") = \" << my_test_arr.elem_at(i) << \"\\n\";\n }\n\n SafetyArray arr1, arr2;\n\n arr1.push_to_end(555.5);\n arr1.push_to_end(9.992);\n\n arr2 = arr1;\n arr2.set_at(1, 6.78); \/\/\/ устанавливаем второй элемент\n\n std::cout << \"Второй элемент массива arr1: \" << arr1 << \"\\n\";\n std::cout << \"Второй элемент массива arr2: \" << arr2 << \"\\n\";\n\n SafetyArray arr3, arr4{16}, arr5{20, 4.4};\n std::cout << arr3 << \"\\n\\n\"\n << arr4 << \"\\n\\n\"\n << arr5 << \"\\n\\n\";\n}\n\nSafetyArray::SafetyArray() :\n _arr{new double[4]}, _length{0}, _capacity{4}\n{}\n\nSafetyArray::SafetyArray(size_t sz) :\n _arr{new double[sz]}, _length{0}, _capacity{sz}\n{}\n\nSafetyArray::SafetyArray(size_t sz, double value) :\n _arr{new double[sz]}, _length{sz}, _capacity{sz}\n{\n for (size_t i = 0; i < sz; ++i) {\n _arr[i] = value;\n }\n}\n\nSafetyArray::~SafetyArray()\n{\n delete[] _arr;\n}\n\nsize_t SafetyArray::length() const\n{\n return _length;\n}\n\nSafetyArray& SafetyArray::push_to_end(double new_value)\n{\n if ( _length < _capacity ) {\n _arr[_length] = new_value;\n } else {\n \t_capacity *= 2;\n \tdouble *new_arr = new double[_capacity];\n \tfor (size_t i = 0; i < _length; ++i) {\n \t new_arr[i] = _arr[i];\n \t}\n \tnew_arr[_length] = new_value;\n \tdelete[] _arr;\n \t_arr = new_arr;\n }\n\n ++_length;\n return *this;\n}\n\nsize_t SafetyArray::compute_index(int index) const\n{\n if (index == 0) {\n return 0;\n } else if (index > 0) {\n return std::abs(index) % _length;\n }\n\n size_t rel_index = std::abs(index) % _length;\n if (rel_index == 0) {\n return 0;\n }\n\n return std::abs(_length - rel_index);\n}\n\ndouble SafetyArray::elem_at(int index) const\n{\n if (_length == 0) {\n return std::nan(\"\");\n }\n\n return _arr[ compute_index(index) ];\n}\n\nSafetyArray& SafetyArray::set_at(int index, double value)\n{\n if (_length != 0) {\n\t_arr[ compute_index(index) ] = value;\n }\n\n return *this;\n}\n\nSafetyArray& SafetyArray::operator=(const SafetyArray& rhs)\n{\n if (this != &rhs) {\n\tdelete[] _arr;\n\t_length = rhs._length;\n\t_capacity = rhs._capacity;\n\n\t_arr = new double[_length];\n\tstd::copy_n(rhs._arr, _length, _arr);\n }\n\n return *this;\n}\n\nstd::ostream& operator<<(std::ostream& os, const SafetyArray& rhs)\n{\n os << \"{Длина: \" << rhs.length() << \", ёмкость: \"\n << rhs._capacity << \"\\n\";\n\n os << \"[\";\n for (size_t i = 0; i < rhs.length(); ++i) {\n if (i != 0) { os << \", \"; }\n\n os << rhs.elem_at(i);\n }\n os << \"]}\";\n\n return os;\n}\n<|endoftext|>"} {"text":"<commit_before>\/\/ This file is part of Pate, Kate' Python scripting plugin.\n\/\/\n\/\/ Copyright (C) 2006 Paul Giannaros <paul@giannaros.org>\n\/\/ Copyright (C) 2012 Shaheed Haque <srhaque@theiet.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) version 3.\n\/\/\n\/\/ This library is distributed in the hope that it will be 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 \"plugin.h\"\n#include \"engine.h\"\n#include \"utilities.h\"\n\n#include <kate\/application.h>\n#include <kate\/documentmanager.h>\n#include <kate\/mainwindow.h>\n#include <kate\/plugin.h>\n\n#include <ktexteditor\/view.h>\n#include <ktexteditor\/document.h>\n\n#include <KAboutData>\n#include <KAction>\n#include <KDialog>\n#include <KLocale>\n#include <KGenericFactory>\n#include <KConfigBase>\n#include <KConfigGroup>\n\n#include <QCheckBox>\n#include <QLabel>\n#include <QPushButton>\n#include <QStackedWidget>\n#include <QTreeView>\n#include <QVBoxLayout>\n\n#define CONFIG_SECTION \"global\"\n\n\/\/\n\/\/ The Pate plugin\n\/\/\n\nK_EXPORT_COMPONENT_FACTORY(pateplugin, KGenericFactory<Pate::Plugin>(\"pate\"))\n\nPate::Plugin::Plugin(QObject *parent, const QStringList &) :\n Kate::Plugin((Kate::Application *)parent),\n m_autoReload(false)\n{\n if (!Pate::Engine::self()) {\n kError() << \"Could not initialise Pate. Ouch!\";\n }\n}\n\nPate::Plugin::~Plugin() {\n while (m_moduleConfigPages.size()) {\n PyObject *o = m_moduleConfigPages.takeFirst();\n Py_DECREF(o);\n }\n Pate::Engine::del();\n}\n\nKate::PluginView *Pate::Plugin::createView(Kate::MainWindow *window)\n{\n return new Pate::PluginView(window);\n}\n\n\/**\n * The configuration system uses one dictionary which is wrapped in Python to\n * make it appear as though it is module-specific.\n * Atomic Python types are stored by writing their representation to the config file\n * on save and evaluating them back to a Python type on load.\n * XX should probably pickle.\n *\/\nvoid Pate::Plugin::readSessionConfig(KConfigBase *config, const QString &groupPrefix)\n{\n KConfigGroup group = config->group(groupPrefix + CONFIG_SECTION);\n m_autoReload = group.readEntry(\"AutoReload\", false);\n Pate::Engine::self()->readConfiguration(groupPrefix);\n Py::functionCall(\"_sessionCreated\");\n}\n\nvoid Pate::Plugin::writeSessionConfig(KConfigBase *config, const QString &groupPrefix)\n{\n KConfigGroup group = config->group(groupPrefix + CONFIG_SECTION);\n group.writeEntry(\"AutoReload\", m_autoReload);\n group.sync();\n}\n\nuint Pate::Plugin::configPages() const\n{\n \/\/ The Manager page is always present.\n uint pages = 1;\n\n \/\/ Count the number of plugins which need their own custom page.\n m_moduleConfigPages.clear();\n QStandardItem *root = Pate::Engine::self()->invisibleRootItem();\n for (int i = 0; i < root->rowCount(); i++) {\n QStandardItem *directoryItem = root->child(i);\n\n \/\/ Walk the plugins in this directory.\n for (int j = 0; j < directoryItem->rowCount(); j++) {\n QStandardItem *pluginItem = directoryItem->child(j);\n if (pluginItem->checkState() != Qt::Checked) {\n \/\/ Don't even try.\n continue;\n }\n\n \/\/ TODO: Query the engine for this information, and then extend\n \/\/ our sibling functions to get the necessary information from\n \/\/ the plugins who want to play.\n QString pluginName = directoryItem->child(j)->text();\n PyObject *configPages = Py::moduleConfigPages(PQ(pluginName));\n if (configPages) {\n for(Py_ssize_t k = 0, l = PyList_Size(configPages); k < l; ++k) {\n \/\/ Add an action for this plugin.\n PyObject *tuple = PyList_GetItem(configPages, k);\n m_moduleConfigPages.append(tuple);\n pages++;\n }\n Py_DECREF(configPages);\n }\n }\n }\n return pages;\n}\n\nKate::PluginConfigPage *Pate::Plugin::configPage(uint number, QWidget *parent, const char *name)\n{\n Q_UNUSED(name);\n\n if (!number) {\n return new Pate::ConfigPage(parent, this);\n }\n if (number > (uint)m_moduleConfigPages.size()) {\n return 0;\n }\n number--;\n PyObject *tuple = m_moduleConfigPages.at(number);\n PyObject *func = PyTuple_GetItem(tuple, 1);\n PyObject *w = Py::objectWrap(parent, \"PyQt4.QtGui.QWidget\");\n PyObject *arguments = Py_BuildValue(\"(Oz)\", w, name);\n Py_DECREF(w);\n Py_INCREF(func);\n PyObject *result = PyObject_CallObject(func, arguments);\n Py_DECREF(arguments);\n if (!result) {\n Py::traceback(\"failed to call plugin page\");\n return 0;\n }\n Kate::PluginConfigPage *r = (Kate::PluginConfigPage *)Py::objectUnwrap(result);\n\n \/\/ TODO: we leak this here reference.\n \/\/Py_DECREF(result);\n return r;\n}\n\nQString Pate::Plugin::configPageName(uint number) const\n{\n if (!number) {\n return i18n(\"Pâté\");\n }\n if (number > (uint)m_moduleConfigPages.size()) {\n return QString();\n }\n number--;\n PyObject *tuple = m_moduleConfigPages.at(number);\n PyObject *configPage = PyTuple_GetItem(tuple, 2);\n PyObject *name = PyTuple_GetItem(configPage, 0);\n return PyString_AsString(name);\n}\n\nQString Pate::Plugin::configPageFullName(uint number) const\n{\n if (!number) {\n return i18n(\"Pâté Python Scripting\");\n }\n if (number > (uint)m_moduleConfigPages.size()) {\n return QString();\n }\n number--;\n PyObject *tuple = m_moduleConfigPages.at(number);\n PyObject *configPage = PyTuple_GetItem(tuple, 2);\n PyObject *fullName = PyTuple_GetItem(configPage, 1);\n return PyString_AsString(fullName);\n}\n\nKIcon Pate::Plugin::configPageIcon(uint number) const\n{\n if (!number) {\n return KIcon(\"applications-development\");\n }\n if (number > (uint)m_moduleConfigPages.size()) {\n return KIcon();\n }\n number--;\n PyObject *tuple = m_moduleConfigPages.at(number);\n PyObject *configPage = PyTuple_GetItem(tuple, 2);\n PyObject *icon = PyTuple_GetItem(configPage, 2);\n return *(KIcon *)Py::objectUnwrap(icon);\n}\n\n\/\/\n\/\/ Plugin view, instances of which are created once for each session.\n\/\/\n\nPate::PluginView::PluginView(Kate::MainWindow *window) :\n Kate::PluginView(window)\n{\n kDebug() << \"create PluginView\";\n}\n\n\/\/\n\/\/ Plugin configuration view.\n\/\/\n\nPate::ConfigPage::ConfigPage(QWidget *parent, Plugin *plugin) :\n Kate::PluginConfigPage(parent),\n m_plugin(plugin),\n m_pluginActions(0),\n m_pluginConfigPages(0)\n{\n kDebug() << \"create ConfigPage\";\n\n \/\/ Create a page with just the main manager tab.\n m_manager.setupUi(parent);\n m_manager.tree->setModel(Pate::Engine::self());\n reset();\n connect(m_manager.autoReload, SIGNAL(clicked(bool)), this, SIGNAL(changed()));\n connect(m_manager.reload, SIGNAL(clicked(bool)), Pate::Engine::self(), SLOT(reloadModules()));\n connect(m_manager.reload, SIGNAL(clicked(bool)), SLOT(reloadPage()));\n\n \/\/ Add a tab for reference information.\n QWidget *infoWidget = new QWidget(m_manager.tabWidget);\n m_info.setupUi(infoWidget);\n m_manager.tabWidget->addTab(infoWidget, i18n(\"Modules\"));\n connect(m_info.topics, SIGNAL(currentIndexChanged(int)), SLOT(infoTopicChanged(int)));\n reloadPage();\n}\n\nPate::ConfigPage::~ConfigPage()\n{\n Py_XDECREF(m_pluginActions);\n Py_XDECREF(m_pluginConfigPages);\n}\n\nvoid Pate::ConfigPage::reloadPage()\n{\n m_manager.tree->resizeColumnToContents(0);\n m_manager.tree->expandAll();\n QString topic;\n\n \/\/ Add a topic for each built-in packages, using stacked page 0.\n m_info.topics->clear();\n topic = QLatin1String(\"kate\");\n m_info.topics->addItem(KIcon(\"applications-development\"), topic);\n topic = QLatin1String(\"kate.gui\");\n m_info.topics->addItem(KIcon(\"applications-development\"), topic);\n topic = QLatin1String(\"pate\");\n m_info.topics->addItem(KIcon(\"applications-development\"), topic);\n\n \/\/ Add a topic for each plugin. using stacked page 1.\n PyObject *plugins = Py::itemString(\"plugins\");\n for(Py_ssize_t i = 0, j = PyList_Size(plugins); i < j; ++i) {\n PyObject *module = PyList_GetItem(plugins, i);\n\n \/\/ Add a topic for this plugin, using stacked page 1.\n topic = QLatin1String(PyModule_GetName(module));\n m_info.topics->addItem(KIcon(\"text-x-python\"), topic);\n }\n infoTopicChanged(0);\n}\n\nvoid Pate::ConfigPage::infoTopicChanged(int topicIndex)\n{\n if (-1 == topicIndex) {\n \/\/ We are being reset.\n Py_XDECREF(m_pluginActions);\n m_pluginActions = 0;\n Py_XDECREF(m_pluginConfigPages);\n m_pluginConfigPages = 0;\n return;\n }\n\n \/\/ Display the information for the selected module\/plugin.\n QString topic = m_info.topics->itemText(topicIndex);\n\n \/\/ Reference tab.\n m_info.help->setHtml(Py::moduleHelp(PQ(topic)));\n\n \/\/ Action tab.\n m_info.actions->clear();\n Py_XDECREF(m_pluginActions);\n m_pluginActions = Py::moduleActions(PQ(topic));\n if (m_pluginActions) {\n for(Py_ssize_t i = 0, j = PyList_Size(m_pluginActions); i < j; ++i) {\n PyObject *tuple = PyList_GetItem(m_pluginActions, i);\n PyObject *functionName = PyTuple_GetItem(tuple, 0);\n\n \/\/ Add an action for this plugin.\n m_info.actions->addItem(PyString_AsString(functionName));\n }\n if (PyList_Size(m_pluginActions)) {\n infoPluginActionsChanged(0);\n }\n }\n\n \/\/ Config pages tab.\n m_info.configPages->clear();\n Py_XDECREF(m_pluginConfigPages);\n m_pluginConfigPages = Py::moduleConfigPages(PQ(topic));\n if (m_pluginConfigPages) {\n for(Py_ssize_t i = 0, j = PyList_Size(m_pluginConfigPages); i < j; ++i) {\n PyObject *tuple = PyList_GetItem(m_pluginConfigPages, i);\n PyObject *functionName = PyTuple_GetItem(tuple, 0);\n\n \/\/ Add a config page for this plugin.\n m_info.configPages->addItem(PyString_AsString(functionName));\n }\n if (PyList_Size(m_pluginConfigPages)) {\n infoPluginConfigPagesChanged(0);\n }\n }\n}\n\nvoid Pate::ConfigPage::infoPluginActionsChanged(int actionIndex)\n{\n if (!m_pluginActions) {\n \/\/ This is a bit wierd.\n return;\n }\n PyObject *tuple = PyList_GetItem(m_pluginActions, actionIndex);\n if (!tuple) {\n \/\/ This is a bit wierd: a plugin with no executable actions?\n return;\n }\n\n PyObject *action = PyTuple_GetItem(tuple, 1);\n PyObject *text = PyTuple_GetItem(action, 0);\n PyObject *icon = PyTuple_GetItem(action, 1);\n PyObject *shortcut = PyTuple_GetItem(action, 2);\n PyObject *menu = PyTuple_GetItem(action, 3);\n\n \/\/ Add a topic for this plugin, using stacked page 0.\n \/\/ TODO: Proper handling of Unicode\n m_info.text->setText(PyString_AsString(text));\n if (Py_None == icon) {\n m_info.actionIcon->setIcon(QIcon());\n } else if (PyString_Check(icon)) {\n m_info.actionIcon->setIcon(KIcon(PyString_AsString(icon)));\n } else {\n m_info.actionIcon->setIcon(*(QPixmap *)PyCObject_AsVoidPtr(icon));\n }\n m_info.actionIcon->setText(PyString_AsString(icon));\n m_info.shortcut->setText(PyString_AsString(shortcut));\n m_info.menu->setText(PyString_AsString(menu));\n}\n\nvoid Pate::ConfigPage::infoPluginConfigPagesChanged(int pageIndex)\n{\n if (!m_pluginConfigPages) {\n \/\/ This is a bit wierd.\n return;\n }\n PyObject *tuple = PyList_GetItem(m_pluginConfigPages, pageIndex);\n if (!tuple) {\n \/\/ This is a bit wierd: a plugin with no executable actions?\n return;\n }\n\n PyObject *configPage = PyTuple_GetItem(tuple, 2);\n PyObject *name = PyTuple_GetItem(configPage, 0);\n PyObject *fullName = PyTuple_GetItem(configPage, 1);\n PyObject *icon = PyTuple_GetItem(configPage, 2);\n\n \/\/ Add a topic for this plugin, using stacked page 0.\n \/\/ TODO: Proper handling of Unicode\n m_info.name->setText(PyString_AsString(name));\n m_info.fullName->setText(PyString_AsString(fullName));\n if (Py_None == icon) {\n m_info.configPageIcon->setIcon(QIcon());\n } else if (PyString_Check(icon)) {\n m_info.configPageIcon->setIcon(KIcon(PyString_AsString(icon)));\n } else {\n m_info.configPageIcon->setIcon(*(KIcon *)Py::objectUnwrap(icon));\n }\n m_info.configPageIcon->setText(PyString_AsString(icon));\n}\n\nvoid Pate::ConfigPage::apply()\n{\n \/\/ Retrieve the settings from the UI and reflect them in the plugin.\n m_plugin->m_autoReload = m_manager.autoReload->isChecked();\n}\n\nvoid Pate::ConfigPage::reset()\n{\n \/\/ Retrieve the settings from the plugin and reflect them in the UI.\n m_manager.autoReload->setChecked(m_plugin->m_autoReload);\n}\n\nvoid Pate::ConfigPage::defaults()\n{\n \/\/ Set the UI to have default settings.\n m_manager.autoReload->setChecked(false);\n emit changed();\n}\n\n#include \"plugin.moc\"\n<commit_msg>Temporary fix for showing per-plugin config pages after a reload.<commit_after>\/\/ This file is part of Pate, Kate' Python scripting plugin.\n\/\/\n\/\/ Copyright (C) 2006 Paul Giannaros <paul@giannaros.org>\n\/\/ Copyright (C) 2012 Shaheed Haque <srhaque@theiet.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) version 3.\n\/\/\n\/\/ This library is distributed in the hope that it will be 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 \"plugin.h\"\n#include \"engine.h\"\n#include \"utilities.h\"\n\n#include <kate\/application.h>\n#include <kate\/documentmanager.h>\n#include <kate\/mainwindow.h>\n#include <kate\/plugin.h>\n\n#include <ktexteditor\/view.h>\n#include <ktexteditor\/document.h>\n\n#include <KAboutData>\n#include <KAction>\n#include <KDialog>\n#include <KLocale>\n#include <KGenericFactory>\n#include <KConfigBase>\n#include <KConfigGroup>\n\n#include <QCheckBox>\n#include <QLabel>\n#include <QPushButton>\n#include <QStackedWidget>\n#include <QTreeView>\n#include <QVBoxLayout>\n\n#define CONFIG_SECTION \"global\"\n\n\/\/\n\/\/ The Pate plugin\n\/\/\n\nK_EXPORT_COMPONENT_FACTORY(pateplugin, KGenericFactory<Pate::Plugin>(\"pate\"))\n\nPate::Plugin::Plugin(QObject *parent, const QStringList &) :\n Kate::Plugin((Kate::Application *)parent),\n m_autoReload(false)\n{\n if (!Pate::Engine::self()) {\n kError() << \"Could not initialise Pate. Ouch!\";\n }\n}\n\nPate::Plugin::~Plugin() {\n while (m_moduleConfigPages.size()) {\n PyObject *o = m_moduleConfigPages.takeFirst();\n Py_DECREF(o);\n }\n Pate::Engine::del();\n}\n\nKate::PluginView *Pate::Plugin::createView(Kate::MainWindow *window)\n{\n return new Pate::PluginView(window);\n}\n\n\/**\n * The configuration system uses one dictionary which is wrapped in Python to\n * make it appear as though it is module-specific.\n * Atomic Python types are stored by writing their representation to the config file\n * on save and evaluating them back to a Python type on load.\n * XX should probably pickle.\n *\/\nvoid Pate::Plugin::readSessionConfig(KConfigBase *config, const QString &groupPrefix)\n{\n KConfigGroup group = config->group(groupPrefix + CONFIG_SECTION);\n m_autoReload = group.readEntry(\"AutoReload\", false);\n Pate::Engine::self()->readConfiguration(groupPrefix);\n Py::functionCall(\"_sessionCreated\");\n}\n\nvoid Pate::Plugin::writeSessionConfig(KConfigBase *config, const QString &groupPrefix)\n{\n KConfigGroup group = config->group(groupPrefix + CONFIG_SECTION);\n group.writeEntry(\"AutoReload\", m_autoReload);\n group.sync();\n}\n\nuint Pate::Plugin::configPages() const\n{\n \/\/ The Manager page is always present.\n uint pages = 1;\n\n \/\/ Count the number of plugins which need their own custom page.\n m_moduleConfigPages.clear();\n QStandardItem *root = Pate::Engine::self()->invisibleRootItem();\n for (int i = 0; i < root->rowCount(); i++) {\n QStandardItem *directoryItem = root->child(i);\n\n \/\/ Walk the plugins in this directory.\n for (int j = 0; j < directoryItem->rowCount(); j++) {\n QStandardItem *pluginItem = directoryItem->child(j);\n if (pluginItem->checkState() != Qt::Checked) {\n \/\/ Don't even try.\n continue;\n }\n\n \/\/ TODO: Query the engine for this information, and then extend\n \/\/ our sibling functions to get the necessary information from\n \/\/ the plugins who want to play.\n QString pluginName = directoryItem->child(j)->text();\n PyObject *configPages = Py::moduleConfigPages(PQ(pluginName));\n if (configPages) {\n for(Py_ssize_t k = 0, l = PyList_Size(configPages); k < l; ++k) {\n \/\/ Add an action for this plugin.\n PyObject *tuple = PyList_GetItem(configPages, k);\n m_moduleConfigPages.append(tuple);\n pages++;\n }\n Py_DECREF(configPages);\n }\n }\n }\n return pages;\n}\n\nKate::PluginConfigPage *Pate::Plugin::configPage(uint number, QWidget *parent, const char *name)\n{\n Q_UNUSED(name);\n\n if (!number) {\n return new Pate::ConfigPage(parent, this);\n }\n if (number > (uint)m_moduleConfigPages.size()) {\n return 0;\n }\n number--;\n PyObject *tuple = m_moduleConfigPages.at(number);\n PyObject *func = PyTuple_GetItem(tuple, 1);\n if (!PyCallable_Check(func)) {\n \/\/ TODO: After a reload, we seem to end up here. This is a temporary\n \/\/ fix, since any page is better than a crash!\n kError()<<\"call\"<<PyString_AsString(func)<<\"iscallable\"<<PyCallable_Check(func);\n return new Pate::ConfigPage(parent, this);\n }\n PyObject *w = Py::objectWrap(parent, \"PyQt4.QtGui.QWidget\");\n PyObject *arguments = Py_BuildValue(\"(Oz)\", w, name);\n Py_DECREF(w);\n Py_INCREF(func);\n PyObject *result = PyObject_CallObject(func, arguments);\n Py_DECREF(arguments);\n if (!result) {\n Py::traceback(\"failed to call plugin page\");\n return 0;\n }\n Kate::PluginConfigPage *r = (Kate::PluginConfigPage *)Py::objectUnwrap(result);\n\n \/\/ TODO: we leak this here reference.\n \/\/Py_DECREF(result);\n return r;\n}\n\nQString Pate::Plugin::configPageName(uint number) const\n{\n if (!number) {\n return i18n(\"Pâté\");\n }\n if (number > (uint)m_moduleConfigPages.size()) {\n return QString();\n }\n number--;\n PyObject *tuple = m_moduleConfigPages.at(number);\n PyObject *configPage = PyTuple_GetItem(tuple, 2);\n PyObject *name = PyTuple_GetItem(configPage, 0);\n return PyString_AsString(name);\n}\n\nQString Pate::Plugin::configPageFullName(uint number) const\n{\n if (!number) {\n return i18n(\"Pâté Python Scripting\");\n }\n if (number > (uint)m_moduleConfigPages.size()) {\n return QString();\n }\n number--;\n PyObject *tuple = m_moduleConfigPages.at(number);\n PyObject *configPage = PyTuple_GetItem(tuple, 2);\n PyObject *fullName = PyTuple_GetItem(configPage, 1);\n return PyString_AsString(fullName);\n}\n\nKIcon Pate::Plugin::configPageIcon(uint number) const\n{\n if (!number) {\n return KIcon(\"applications-development\");\n }\n if (number > (uint)m_moduleConfigPages.size()) {\n return KIcon();\n }\n number--;\n PyObject *tuple = m_moduleConfigPages.at(number);\n PyObject *configPage = PyTuple_GetItem(tuple, 2);\n PyObject *icon = PyTuple_GetItem(configPage, 2);\n return *(KIcon *)Py::objectUnwrap(icon);\n}\n\n\/\/\n\/\/ Plugin view, instances of which are created once for each session.\n\/\/\n\nPate::PluginView::PluginView(Kate::MainWindow *window) :\n Kate::PluginView(window)\n{\n kDebug() << \"create PluginView\";\n}\n\n\/\/\n\/\/ Plugin configuration view.\n\/\/\n\nPate::ConfigPage::ConfigPage(QWidget *parent, Plugin *plugin) :\n Kate::PluginConfigPage(parent),\n m_plugin(plugin),\n m_pluginActions(0),\n m_pluginConfigPages(0)\n{\n kDebug() << \"create ConfigPage\";\n\n \/\/ Create a page with just the main manager tab.\n m_manager.setupUi(parent);\n m_manager.tree->setModel(Pate::Engine::self());\n reset();\n connect(m_manager.autoReload, SIGNAL(clicked(bool)), this, SIGNAL(changed()));\n connect(m_manager.reload, SIGNAL(clicked(bool)), Pate::Engine::self(), SLOT(reloadModules()));\n connect(m_manager.reload, SIGNAL(clicked(bool)), SLOT(reloadPage()));\n\n \/\/ Add a tab for reference information.\n QWidget *infoWidget = new QWidget(m_manager.tabWidget);\n m_info.setupUi(infoWidget);\n m_manager.tabWidget->addTab(infoWidget, i18n(\"Modules\"));\n connect(m_info.topics, SIGNAL(currentIndexChanged(int)), SLOT(infoTopicChanged(int)));\n reloadPage();\n}\n\nPate::ConfigPage::~ConfigPage()\n{\n Py_XDECREF(m_pluginActions);\n Py_XDECREF(m_pluginConfigPages);\n}\n\nvoid Pate::ConfigPage::reloadPage()\n{\n m_manager.tree->resizeColumnToContents(0);\n m_manager.tree->expandAll();\n QString topic;\n\n \/\/ Add a topic for each built-in packages, using stacked page 0.\n m_info.topics->clear();\n topic = QLatin1String(\"kate\");\n m_info.topics->addItem(KIcon(\"applications-development\"), topic);\n topic = QLatin1String(\"kate.gui\");\n m_info.topics->addItem(KIcon(\"applications-development\"), topic);\n topic = QLatin1String(\"pate\");\n m_info.topics->addItem(KIcon(\"applications-development\"), topic);\n\n \/\/ Add a topic for each plugin. using stacked page 1.\n PyObject *plugins = Py::itemString(\"plugins\");\n for(Py_ssize_t i = 0, j = PyList_Size(plugins); i < j; ++i) {\n PyObject *module = PyList_GetItem(plugins, i);\n\n \/\/ Add a topic for this plugin, using stacked page 1.\n topic = QLatin1String(PyModule_GetName(module));\n m_info.topics->addItem(KIcon(\"text-x-python\"), topic);\n }\n infoTopicChanged(0);\n}\n\nvoid Pate::ConfigPage::infoTopicChanged(int topicIndex)\n{\n if (-1 == topicIndex) {\n \/\/ We are being reset.\n Py_XDECREF(m_pluginActions);\n m_pluginActions = 0;\n Py_XDECREF(m_pluginConfigPages);\n m_pluginConfigPages = 0;\n return;\n }\n\n \/\/ Display the information for the selected module\/plugin.\n QString topic = m_info.topics->itemText(topicIndex);\n\n \/\/ Reference tab.\n m_info.help->setHtml(Py::moduleHelp(PQ(topic)));\n\n \/\/ Action tab.\n m_info.actions->clear();\n Py_XDECREF(m_pluginActions);\n m_pluginActions = Py::moduleActions(PQ(topic));\n if (m_pluginActions) {\n for(Py_ssize_t i = 0, j = PyList_Size(m_pluginActions); i < j; ++i) {\n PyObject *tuple = PyList_GetItem(m_pluginActions, i);\n PyObject *functionName = PyTuple_GetItem(tuple, 0);\n\n \/\/ Add an action for this plugin.\n m_info.actions->addItem(PyString_AsString(functionName));\n }\n if (PyList_Size(m_pluginActions)) {\n infoPluginActionsChanged(0);\n }\n }\n\n \/\/ Config pages tab.\n m_info.configPages->clear();\n Py_XDECREF(m_pluginConfigPages);\n m_pluginConfigPages = Py::moduleConfigPages(PQ(topic));\n if (m_pluginConfigPages) {\n for(Py_ssize_t i = 0, j = PyList_Size(m_pluginConfigPages); i < j; ++i) {\n PyObject *tuple = PyList_GetItem(m_pluginConfigPages, i);\n PyObject *functionName = PyTuple_GetItem(tuple, 0);\n\n \/\/ Add a config page for this plugin.\n m_info.configPages->addItem(PyString_AsString(functionName));\n }\n if (PyList_Size(m_pluginConfigPages)) {\n infoPluginConfigPagesChanged(0);\n }\n }\n}\n\nvoid Pate::ConfigPage::infoPluginActionsChanged(int actionIndex)\n{\n if (!m_pluginActions) {\n \/\/ This is a bit wierd.\n return;\n }\n PyObject *tuple = PyList_GetItem(m_pluginActions, actionIndex);\n if (!tuple) {\n \/\/ This is a bit wierd: a plugin with no executable actions?\n return;\n }\n\n PyObject *action = PyTuple_GetItem(tuple, 1);\n PyObject *text = PyTuple_GetItem(action, 0);\n PyObject *icon = PyTuple_GetItem(action, 1);\n PyObject *shortcut = PyTuple_GetItem(action, 2);\n PyObject *menu = PyTuple_GetItem(action, 3);\n\n \/\/ Add a topic for this plugin, using stacked page 0.\n \/\/ TODO: Proper handling of Unicode\n m_info.text->setText(PyString_AsString(text));\n if (Py_None == icon) {\n m_info.actionIcon->setIcon(QIcon());\n } else if (PyString_Check(icon)) {\n m_info.actionIcon->setIcon(KIcon(PyString_AsString(icon)));\n } else {\n m_info.actionIcon->setIcon(*(QPixmap *)PyCObject_AsVoidPtr(icon));\n }\n m_info.actionIcon->setText(PyString_AsString(icon));\n m_info.shortcut->setText(PyString_AsString(shortcut));\n m_info.menu->setText(PyString_AsString(menu));\n}\n\nvoid Pate::ConfigPage::infoPluginConfigPagesChanged(int pageIndex)\n{\n if (!m_pluginConfigPages) {\n \/\/ This is a bit wierd.\n return;\n }\n PyObject *tuple = PyList_GetItem(m_pluginConfigPages, pageIndex);\n if (!tuple) {\n \/\/ This is a bit wierd: a plugin with no executable actions?\n return;\n }\n\n PyObject *configPage = PyTuple_GetItem(tuple, 2);\n PyObject *name = PyTuple_GetItem(configPage, 0);\n PyObject *fullName = PyTuple_GetItem(configPage, 1);\n PyObject *icon = PyTuple_GetItem(configPage, 2);\n\n \/\/ Add a topic for this plugin, using stacked page 0.\n \/\/ TODO: Proper handling of Unicode\n m_info.name->setText(PyString_AsString(name));\n m_info.fullName->setText(PyString_AsString(fullName));\n if (Py_None == icon) {\n m_info.configPageIcon->setIcon(QIcon());\n } else if (PyString_Check(icon)) {\n m_info.configPageIcon->setIcon(KIcon(PyString_AsString(icon)));\n } else {\n m_info.configPageIcon->setIcon(*(KIcon *)Py::objectUnwrap(icon));\n }\n m_info.configPageIcon->setText(PyString_AsString(icon));\n}\n\nvoid Pate::ConfigPage::apply()\n{\n \/\/ Retrieve the settings from the UI and reflect them in the plugin.\n m_plugin->m_autoReload = m_manager.autoReload->isChecked();\n}\n\nvoid Pate::ConfigPage::reset()\n{\n \/\/ Retrieve the settings from the plugin and reflect them in the UI.\n m_manager.autoReload->setChecked(m_plugin->m_autoReload);\n}\n\nvoid Pate::ConfigPage::defaults()\n{\n \/\/ Set the UI to have default settings.\n m_manager.autoReload->setChecked(false);\n emit changed();\n}\n\n#include \"plugin.moc\"\n<|endoftext|>"} {"text":"<commit_before>\/******************************************************************************\n * Copyright 2018 The Apollo Authors. All Rights Reserved.\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n *****************************************************************************\/\n\n#include <gtest\/gtest.h>\n#include <memory>\n\n#include \"cybertron\/base\/signal.h\"\n\nnamespace apollo {\nnamespace cybertron {\nnamespace base {\n\nTEST(SlotTest, zero_input_param) {\n char ch = '\/0';\n Slot<> slot_a([&ch]() { ch = 'a'; });\n EXPECT_TRUE(slot_a.connected());\n\n slot_a();\n EXPECT_EQ(ch, 'a');\n\n slot_a.Disconnect();\n EXPECT_FALSE(slot_a.connected());\n\n ch = '\/0';\n slot_a();\n EXPECT_NE(ch, 'a');\n\n Slot<> slot_b([&ch]() { ch = 'b'; }, false);\n EXPECT_FALSE(slot_b.connected());\n\n ch = '\/0';\n slot_b();\n EXPECT_NE(ch, 'b');\n\n Slot<> slot_c(nullptr);\n EXPECT_NO_FATAL_FAILURE(slot_c());\n}\n\nTEST(SlotTest, two_input_params) {\n int sum = 0;\n Slot<int, int> slot_a([&sum](int lhs, int rhs) { sum = lhs + rhs; });\n EXPECT_TRUE(slot_a.connected());\n\n int lhs = 1, rhs = 2;\n slot_a(lhs, rhs);\n EXPECT_EQ(sum, lhs + rhs);\n\n Slot<int, int> slot_b(slot_a);\n lhs = 3;\n rhs = 4;\n slot_b(lhs, rhs);\n EXPECT_EQ(sum, lhs + rhs);\n\n slot_b.Disconnect();\n EXPECT_FALSE(slot_b.connected());\n\n sum = 0;\n lhs = 5;\n rhs = 6;\n slot_b(lhs, rhs);\n EXPECT_EQ(sum, 0);\n}\n\nTEST(ConnectionTest, null_signal) {\n Connection<> conn_a;\n EXPECT_FALSE(conn_a.IsConnected());\n EXPECT_FALSE(conn_a.Disconnect());\n EXPECT_FALSE(conn_a.HasSlot(nullptr));\n\n auto slot = std::make_shared<Slot<>>([]() {});\n Connection<> conn_b(slot, nullptr);\n EXPECT_TRUE(conn_b.IsConnected());\n EXPECT_FALSE(conn_b.Disconnect());\n EXPECT_TRUE(conn_b.HasSlot(slot));\n\n EXPECT_FALSE(conn_a.HasSlot(slot));\n\n conn_b = conn_b;\n conn_a = conn_b;\n EXPECT_TRUE(conn_a.IsConnected());\n EXPECT_FALSE(conn_a.Disconnect());\n EXPECT_TRUE(conn_a.HasSlot(slot));\n\n Signal<> sig;\n Connection<> conn_c(nullptr, &sig);\n EXPECT_FALSE(conn_c.Disconnect());\n}\n\nTEST(SignalTest, module) {\n Signal<int, int> sig;\n\n int sum_a = 0;\n auto conn_a = sig.Connect([&sum_a](int lhs, int rhs) { sum_a = lhs + rhs; });\n\n int sum_b = 0;\n auto conn_b = sig.Connect([&sum_b](int lhs, int rhs) { sum_b = lhs + rhs; });\n\n int lhs = 1, rhs = 2;\n sig(lhs, rhs);\n EXPECT_EQ(sum_a, lhs + rhs);\n EXPECT_EQ(sum_b, lhs + rhs);\n\n Connection<int, int> conn_c;\n EXPECT_FALSE(sig.Disconnect(conn_c));\n EXPECT_TRUE(sig.Disconnect(conn_b));\n sum_a = 0;\n sum_b = 0;\n lhs = 3;\n rhs = 4;\n sig(lhs, rhs);\n EXPECT_EQ(sum_a, lhs + rhs);\n EXPECT_NE(sum_b, lhs + rhs);\n\n sig.DisconnectAllSlots();\n sum_a = 0;\n sum_b = 0;\n lhs = 5;\n rhs = 6;\n sig(lhs, rhs);\n EXPECT_NE(sum_a, lhs + rhs);\n EXPECT_NE(sum_b, lhs + rhs);\n}\n\n} \/\/ namespace base\n} \/\/ namespace cybertron\n} \/\/ namespace apollo\n<commit_msg>framework: Fix unit test typo issue<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#include <memory>\n\n#include \"cybertron\/base\/signal.h\"\n\nnamespace apollo {\nnamespace cybertron {\nnamespace base {\n\nTEST(SlotTest, zero_input_param) {\n char ch = '0';\n Slot<> slot_a([&ch]() { ch = 'a'; });\n EXPECT_TRUE(slot_a.connected());\n\n slot_a();\n EXPECT_EQ(ch, 'a');\n\n slot_a.Disconnect();\n EXPECT_FALSE(slot_a.connected());\n\n ch = '0';\n slot_a();\n EXPECT_NE(ch, 'a');\n\n Slot<> slot_b([&ch]() { ch = 'b'; }, false);\n EXPECT_FALSE(slot_b.connected());\n\n ch = '0';\n slot_b();\n EXPECT_NE(ch, 'b');\n\n Slot<> slot_c(nullptr);\n EXPECT_NO_FATAL_FAILURE(slot_c());\n}\n\nTEST(SlotTest, two_input_params) {\n int sum = 0;\n Slot<int, int> slot_a([&sum](int lhs, int rhs) { sum = lhs + rhs; });\n EXPECT_TRUE(slot_a.connected());\n\n int lhs = 1, rhs = 2;\n slot_a(lhs, rhs);\n EXPECT_EQ(sum, lhs + rhs);\n\n Slot<int, int> slot_b(slot_a);\n lhs = 3;\n rhs = 4;\n slot_b(lhs, rhs);\n EXPECT_EQ(sum, lhs + rhs);\n\n slot_b.Disconnect();\n EXPECT_FALSE(slot_b.connected());\n\n sum = 0;\n lhs = 5;\n rhs = 6;\n slot_b(lhs, rhs);\n EXPECT_EQ(sum, 0);\n}\n\nTEST(ConnectionTest, null_signal) {\n Connection<> conn_a;\n EXPECT_FALSE(conn_a.IsConnected());\n EXPECT_FALSE(conn_a.Disconnect());\n EXPECT_FALSE(conn_a.HasSlot(nullptr));\n\n auto slot = std::make_shared<Slot<>>([]() {});\n Connection<> conn_b(slot, nullptr);\n EXPECT_TRUE(conn_b.IsConnected());\n EXPECT_FALSE(conn_b.Disconnect());\n EXPECT_TRUE(conn_b.HasSlot(slot));\n\n EXPECT_FALSE(conn_a.HasSlot(slot));\n\n conn_b = conn_b;\n conn_a = conn_b;\n EXPECT_TRUE(conn_a.IsConnected());\n EXPECT_FALSE(conn_a.Disconnect());\n EXPECT_TRUE(conn_a.HasSlot(slot));\n\n Signal<> sig;\n Connection<> conn_c(nullptr, &sig);\n EXPECT_FALSE(conn_c.Disconnect());\n}\n\nTEST(SignalTest, module) {\n Signal<int, int> sig;\n\n int sum_a = 0;\n auto conn_a = sig.Connect([&sum_a](int lhs, int rhs) { sum_a = lhs + rhs; });\n\n int sum_b = 0;\n auto conn_b = sig.Connect([&sum_b](int lhs, int rhs) { sum_b = lhs + rhs; });\n\n int lhs = 1, rhs = 2;\n sig(lhs, rhs);\n EXPECT_EQ(sum_a, lhs + rhs);\n EXPECT_EQ(sum_b, lhs + rhs);\n\n Connection<int, int> conn_c;\n EXPECT_FALSE(sig.Disconnect(conn_c));\n EXPECT_TRUE(sig.Disconnect(conn_b));\n sum_a = 0;\n sum_b = 0;\n lhs = 3;\n rhs = 4;\n sig(lhs, rhs);\n EXPECT_EQ(sum_a, lhs + rhs);\n EXPECT_NE(sum_b, lhs + rhs);\n\n sig.DisconnectAllSlots();\n sum_a = 0;\n sum_b = 0;\n lhs = 5;\n rhs = 6;\n sig(lhs, rhs);\n EXPECT_NE(sum_a, lhs + rhs);\n EXPECT_NE(sum_b, lhs + rhs);\n}\n\n} \/\/ namespace base\n} \/\/ namespace cybertron\n} \/\/ namespace apollo\n<|endoftext|>"} {"text":"<commit_before>\/\/\/ @file VCDTracer.h\n\/\/\/\n\/\/\/ The VCD generation module.\n\/\/\/\n\/\/\/ @par Full Description\n\/\/\/ The class provides means for collecting signals\n\/\/\/ and storing the data in the VCD format.\n\/\/\/\n\/\/\/ @ingroup Tracer\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 <array>\n#include <algorithm>\n\n#include \"VCDTracer.h\"\n#include \"SignalStructureBuilder.h\"\n#include \"TimeFrame.h\"\n#include \"Version.h\"\n\nTRACER::VCDTracer::VCDTracer(const std::string &outputFile,\n const SIGNAL::SignalDb &signalDb) :\n m_File(outputFile, std::ifstream::out | std::ifstream::binary),\n m_rSignalDb(signalDb)\n{\n\n}\n\nvoid TRACER::VCDTracer::Dump()\n{\n GenerateHeader();\n GenerateBody();\n}\n\nvoid TRACER::VCDTracer::GenerateHeader()\n{\n \/\/ So as to make things simpler the header has been split into three\n \/\/ different sections.\n GenerateBasicInformation();\n GenerateSignalStructure();\n GenerateSignalDefaults();\n}\n\nvoid TRACER::VCDTracer::GenerateBasicInformation()\n{\n DumpLine(\"$date December 8, 2014 14:15:00\");\n DumpLine(\"$end\");\n DumpLine(\"$version VCD Tracer \\\"Mateusz\\\" Release v.\" + std::string(VERSION::STRING));\n DumpLine(\"$end\");\n DumpLine(\"$timescale 1 \" + m_rSignalDb.GetTimeUnit());\n DumpLine(\"$end\");\n}\n\nvoid TRACER::VCDTracer::GenerateSignalStructure()\n{\n SignalStructureBuilder structure_builder(m_rSignalDb.GetSignalFootprint(), m_File);\n structure_builder.Dump();\n}\n\nvoid TRACER::VCDTracer::GenerateSignalDefaults()\n{\n DumpLine(\"$dumpvars\");\n for (const auto &signal : m_rSignalDb.GetSignalFootprint())\n {\n const std::string footprint = signal.second->Footprint();\n if (!footprint.empty())\n {\n DumpLine(signal.second->Footprint());\n }\n }\n DumpLine(\"$end\");\n}\n\nvoid TRACER::VCDTracer::GenerateBody()\n{\n TimeFrame frame(0, m_File);\n uint64_t previous_timestamp = 0;\n\n for (const SIGNAL::Signal *current_signal : m_rSignalDb.GetSignals())\n {\n const uint64_t current_timestamp = current_signal->GetTimestamp();\n\n if (current_timestamp != previous_timestamp)\n {\n frame.DumpAndClear();\n\n previous_timestamp = current_timestamp;\n frame.SetTime(current_timestamp);\n }\n\n frame.Add(current_signal);\n }\n\n frame.DumpAndClear();\n}\n\n<commit_msg>Update VCDTracer.cpp<commit_after>\/\/\/ @file VCDTracer.h\n\/\/\/\n\/\/\/ The VCD generation module.\n\/\/\/\n\/\/\/ @par Full Description\n\/\/\/ The class provides means for collecting signals\n\/\/\/ and storing the data in the VCD format.\n\/\/\/\n\/\/\/ @ingroup Tracer\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 <array>\n#include <algorithm>\n\n#include \"VCDTracer.h\"\n#include \"SignalStructureBuilder.h\"\n#include \"TimeFrame.h\"\n#include \"Version.h\"\n\nTRACER::VCDTracer::VCDTracer(const std::string &outputFile,\n const SIGNAL::SignalDb &signalDb) :\n m_File(outputFile, std::ifstream::out | std::ifstream::binary),\n m_rSignalDb(signalDb)\n{\n\n}\n\nvoid TRACER::VCDTracer::Dump()\n{\n GenerateHeader();\n GenerateBody();\n}\n\nvoid TRACER::VCDTracer::GenerateHeader()\n{\n \/\/ So as to make things simpler the header has been split into three\n \/\/ different sections.\n GenerateBasicInformation();\n GenerateSignalStructure();\n GenerateSignalDefaults();\n}\n\nvoid TRACER::VCDTracer::GenerateBasicInformation()\n{\n DumpLine(\"$date December 8, 2016 14:15:00\");\n DumpLine(\"$end\");\n DumpLine(\"$version VCD Tracer \\\"Mateusz\\\" Release v.\" + std::string(VERSION::STRING));\n DumpLine(\"$end\");\n DumpLine(\"$timescale 1 \" + m_rSignalDb.GetTimeUnit());\n DumpLine(\"$end\");\n}\n\nvoid TRACER::VCDTracer::GenerateSignalStructure()\n{\n SignalStructureBuilder structure_builder(m_rSignalDb.GetSignalFootprint(), m_File);\n structure_builder.Dump();\n}\n\nvoid TRACER::VCDTracer::GenerateSignalDefaults()\n{\n DumpLine(\"$dumpvars\");\n for (const auto &signal : m_rSignalDb.GetSignalFootprint())\n {\n const std::string footprint = signal.second->Footprint();\n if (!footprint.empty())\n {\n DumpLine(signal.second->Footprint());\n }\n }\n DumpLine(\"$end\");\n}\n\nvoid TRACER::VCDTracer::GenerateBody()\n{\n TimeFrame frame(0, m_File);\n uint64_t previous_timestamp = 0;\n\n for (const SIGNAL::Signal *current_signal : m_rSignalDb.GetSignals())\n {\n const uint64_t current_timestamp = current_signal->GetTimestamp();\n\n if (current_timestamp != previous_timestamp)\n {\n frame.DumpAndClear();\n\n previous_timestamp = current_timestamp;\n frame.SetTime(current_timestamp);\n }\n\n frame.Add(current_signal);\n }\n\n frame.DumpAndClear();\n}\n\n<|endoftext|>"} {"text":"<commit_before>#include <string>\n#include <Poco\/XML\/XMLWriter.h>\n#include <Poco\/SAX\/AttributesImpl.h>\n\n#include \"xmlui\/Serializing.h\"\n#include \"model\/Gateway.h\"\n#include \"model\/LegacyGateway.h\"\n#include \"model\/Location.h\"\n#include \"model\/Device.h\"\n#include \"model\/DeviceInfo.h\"\n#include \"model\/DeviceProperty.h\"\n#include \"model\/RoleInGateway.h\"\n#include \"model\/LegacyRoleInGateway.h\"\n#include \"model\/VerifiedIdentity.h\"\n\nusing namespace std;\nusing namespace Poco;\nusing namespace Poco::XML;\nusing namespace BeeeOn;\n\nstatic void prepare(AttributesImpl &attrs, const Gateway &gateway)\n{\n\tattrs.addAttribute(\"\", \"id\", \"id\", \"\", gateway.id().toString());\n\tattrs.addAttribute(\"\", \"name\", \"name\", \"\", gateway.name());\n\tattrs.addAttribute(\"\", \"longitude\", \"longitude\", \"\",\n\t\t\tstd::to_string(gateway.longitude()));\n\tattrs.addAttribute(\"\", \"latitude\", \"latitude\", \"\",\n\t\t\tstd::to_string(gateway.latitude()));\n\n\tif (gateway.altitude().isNull()) {\n\t\tattrs.addAttribute(\"\", \"altitude\", \"altitude\", \"\", \"\");\n\t}\n\telse {\n\t\tattrs.addAttribute(\"\", \"altitude\", \"altitude\", \"\",\n\t\t\tstd::to_string(gateway.altitude().value()));\n\t}\n\n\tattrs.addAttribute(\"\", \"version\", \"version\", \"\", gateway.version());\n\tattrs.addAttribute(\"\", \"ip\", \"ip\", \"\", gateway.ipAddress().toString());\n}\n\nvoid BeeeOn::XmlUI::serialize(XMLWriter &output, const Gateway &gateway)\n{\n\tAttributesImpl attrs;\n\tprepare(attrs, gateway);\n\toutput.emptyElement(\"\", \"gate\", \"gate\", attrs);\n}\n\nvoid BeeeOn::XmlUI::serialize(Poco::XML::XMLWriter &output,\n\t\tconst std::vector<Gateway> &gateways)\n{\n\tfor (auto gateway : gateways)\n\t\tserialize(output, gateway);\n}\n\nvoid BeeeOn::XmlUI::serialize(XMLWriter &output, const LegacyGateway &gateway)\n{\n\tAttributesImpl attrs;\n\tprepare(attrs, gateway);\n\n\tattrs.addAttribute(\"\", \"owner\", \"owner\", \"\",\n\t\t\tgateway.owner().fullName());\n\tattrs.addAttribute(\"\", \"permission\", \"permission\", \"\",\n\t\t\tgateway.accessLevel().toString());\n\tattrs.addAttribute(\"\", \"devices\", \"devices\", \"\",\n\t\t\tto_string(gateway.deviceCount()));\n\tattrs.addAttribute(\"\", \"users\", \"users\", \"\",\n\t\t\tto_string(gateway.userCount()));\n\tattrs.addAttribute(\"\", \"timezone\", \"timezone\", \"\", \"0\");\n\tattrs.addAttribute(\"\", \"status\", \"status\", \"\", \"available\");\n\n\toutput.emptyElement(\"\", \"gate\", \"gate\", attrs);\n}\n\nvoid BeeeOn::XmlUI::serialize(Poco::XML::XMLWriter &output,\n\t\tconst std::vector<LegacyGateway> &gateways)\n{\n\tfor (auto gateway : gateways)\n\t\tserialize(output, gateway);\n}\n\nvoid BeeeOn::XmlUI::serialize(XMLWriter &output, const Location &location)\n{\n\tAttributesImpl attrs;\n\tattrs.addAttribute(\"\", \"id\", \"id\", \"\", location.id().toString());\n\tattrs.addAttribute(\"\", \"locationid\", \"locationid\", \"\",\n\t\t\tlocation.id().toString());\n\tattrs.addAttribute(\"\", \"name\", \"name\", \"\", location.name());\n\tattrs.addAttribute(\"\", \"type\", \"type\", \"\", \"0\"); \/\/ FIXME\n\n\toutput.emptyElement(\"\", \"location\", \"location\", attrs);\n}\n\nvoid BeeeOn::XmlUI::serialize(Poco::XML::XMLWriter &output,\n\t\tconst std::vector<Location> &locations)\n{\n\tfor (auto location : locations)\n\t\tserialize(output, location);\n}\n\nvoid BeeeOn::XmlUI::serialize(Poco::XML::XMLWriter &output,\n\t\tconst Device &device)\n{\n\tAttributesImpl attrs;\n\tattrs.addAttribute(\"\", \"id\", \"id\", \"\", device.id().toString());\n\tattrs.addAttribute(\"\", \"euid\", \"euid\", \"\", device.id().toString());\n\tattrs.addAttribute(\"\", \"type\", \"type\", \"\", device.type()->id().toString());\n\tattrs.addAttribute(\"\", \"locationid\", \"locationid\", \"\",\n\t\t\tdevice.location().id().toString());\n\tattrs.addAttribute(\"\", \"gateid\", \"gateid\", \"\",\n\t\t\tdevice.gateway().id().toString());\n\n\tif (device.name().empty())\n\t\tattrs.addAttribute(\"\", \"name\", \"name\", \"\", device.type()->displayName());\n\telse\n\t\tattrs.addAttribute(\"\", \"name\", \"name\", \"\", device.name());\n\n\tattrs.addAttribute(\"\", \"status\", \"status\", \"\",\n\t\t\tdevice.available()? \"available\" : \"unavailable\");\n\tattrs.addAttribute(\"\", \"time\", \"time\", \"\",\n\t\t\tto_string(device.lastSeen().timestamp().epochTime()));\n\tattrs.addAttribute(\"\", \"involved\", \"involved\", \"\",\n\t\t\tto_string(device.firstSeen().timestamp().epochTime()));\n\tattrs.addAttribute(\"\", \"init\", \"init\", \"\",\n\t\t\tdevice.active()? \"1\" : \"0\");\n\n\tconst Poco::SharedPtr<DeviceInfo> info = device.type();\n\n\tattrs.addAttribute(\"\", \"displayName\", \"displayName\", \"\", info->displayName());\n\tattrs.addAttribute(\"\", \"name\", \"name\", \"\", info->name());\n\tattrs.addAttribute(\"\", \"vendor\", \"vendor\", \"\", info->vendor());\n\n\toutput.startElement(\"\", \"device\", \"device\", attrs);\n\n\tfor (auto module : *info) {\n\t\tAttributesImpl attrs;\n\n\t\tattrs.addAttribute(\"\", \"id\", \"id\", \"\", module.id().toString());\n\t\t\/\/ FIXME: just copy device status for now\n\t\tattrs.addAttribute(\"\", \"status\", \"status\", \"\",\n\t\t\t\tdevice.available()? \"available\" : \"unavailable\");\n\t\t\/\/ FIXME: no values implemented, send neutral 0\n\t\tattrs.addAttribute(\"\", \"value\", \"value\", \"\", \"0\");\n\n\t\tattrs.addAttribute(\"\", \"type\", \"type\", \"\", module.type()->id().toString());\n\n\t\tif (!module.name().empty())\n\t\t\tattrs.addAttribute(\"\", \"name\", \"name\", \"\", module.name());\n\t\tif (!module.group().empty())\n\t\t\tattrs.addAttribute(\"\", \"group\", \"group\", \"\", module.group());\n\n\t\toutput.emptyElement(\"\", \"module\", \"module\", attrs);\n\t}\n\n\toutput.endElement(\"\", \"device\", \"device\");\n}\n\nvoid BeeeOn::XmlUI::serialize(Poco::XML::XMLWriter &output,\n\t\tconst std::vector<Device> &devices)\n{\n\tfor (auto device : devices)\n\t\tserialize(output, device);\n}\n\nvoid BeeeOn::XmlUI::serialize(Poco::XML::XMLWriter &output,\n\t\tconst std::list<Device> &devices)\n{\n\tfor (auto device : devices)\n\t\tserialize(output, device);\n}\n\nvoid BeeeOn::XmlUI::serialize(Poco::XML::XMLWriter &output,\n\t\tconst DecryptedDeviceProperty &property,\n\t\tconst Device &device)\n{\n\tAttributesImpl attrs;\n\n\tattrs.addAttribute(\"\", \"euid\", \"euid\", \"\",\n\t\t\tdevice.id().toString());\n\tattrs.addAttribute(\"\", \"gateid\", \"gateid\", \"\",\n\t\t\tdevice.gateway().id().toString());\n\tattrs.addAttribute(\"\", \"parameterkey\", \"parameterkey\", \"\",\n\t\t\tproperty.key().toString());\n\n\tstring value;\n\n\tswitch (property.key().raw()) {\n\tcase DevicePropertyKey::KEY_IP_ADDRESS:\n\t\tvalue = property.asIPAddress().toString();\n\t\tbreak;\n\tcase DevicePropertyKey::KEY_FIRMWARE:\n\t\tvalue = property.asFirmware();\n\t\tbreak;\n\tcase DevicePropertyKey::KEY_PASSWORD:\n\t\tvalue = property.asPassword();\n\t\tbreak;\n\tdefault:\n\t\tbreak;\n\t}\n\n\tattrs.addAttribute(\"\", \"parametervalue\", \"parametervalue\", \"\", value);\n\n\toutput.emptyElement(\"\", \"device\", \"device\", attrs);\n}\n\nstatic void prepare(AttributesImpl &attrs, const RoleInGateway &role)\n{\n\tattrs.addAttribute(\"\", \"id\", \"id\", \"\", role.id().toString());\n\tattrs.addAttribute(\"\", \"email\", \"email\", \"\",\n\t\t\trole.identity().email());\n\tattrs.addAttribute(\"\", \"level\", \"level\", \"\",\n\t\t\trole.level().toString());\n}\n\nvoid BeeeOn::XmlUI::serialize(Poco::XML::XMLWriter &output,\n\t\tconst RoleInGateway &role)\n{\n\tAttributesImpl attrs;\n\tprepare(attrs, role);\n\toutput.emptyElement(\"\", \"user\", \"user\", attrs);\n}\n\nvoid BeeeOn::XmlUI::serialize(Poco::XML::XMLWriter &output,\n\t\tconst std::vector<RoleInGateway> &roles)\n{\n\tfor (auto role : roles)\n\t\tserialize(output, role);\n}\n\nvoid BeeeOn::XmlUI::serialize(Poco::XML::XMLWriter &output,\n\t\tconst LegacyRoleInGateway &role)\n{\n\tAttributesImpl attrs;\n\tprepare(attrs, role);\n\n\tif (role.isOwner()) {\n\t\tattrs.addAttribute(\"\", \"permission\", \"permission\",\n\t\t\t\t\"\", \"owner\");\n\t}\n\telse {\n\t\tattrs.addAttribute(\"\", \"permission\", \"permission\",\n\t\t\t\t\"\", role.level().toString());\n\t}\n\n\tattrs.addAttribute(\"\", \"gender\", \"gender\", \"\", \"unknown\");\n\tattrs.addAttribute(\"\", \"name\", \"name\", \"\", role.firstName());\n\tattrs.addAttribute(\"\", \"surname\", \"surname\", \"\", role.lastName());\n\tattrs.addAttribute(\"\", \"imgurl\", \"imgurl\", \"\", role.picture().toString());\n\n\toutput.emptyElement(\"\", \"user\", \"user\", attrs);\n}\n\nvoid BeeeOn::XmlUI::serialize(Poco::XML::XMLWriter &output,\n\t\tconst std::vector<LegacyRoleInGateway> &roles)\n{\n\tfor (auto role : roles)\n\t\tserialize(output, role);\n}\n\nvoid BeeeOn::XmlUI::serializeMyself(\n\t\tPoco::XML::XMLWriter &output,\n\t\tconst VerifiedIdentity &identity)\n{\n\tconst User &user = identity.user();\n\n\tAttributesImpl attrs;\n\tattrs.addAttribute(\"\", \"id\", \"id\", \"\", identity.id().toString());\n\tattrs.addAttribute(\"\", \"name\", \"name\", \"\", user.firstName());\n\tattrs.addAttribute(\"\", \"first_name\", \"first_name\", \"\",\n\t\t\tuser.firstName());\n\tattrs.addAttribute(\"\", \"surname\", \"surname\", \"\", user.lastName());\n\tattrs.addAttribute(\"\", \"last_name\", \"last_name\", \"\",\n\t\t\tuser.lastName());\n\tattrs.addAttribute(\"\", \"gender\", \"gender\", \"\", \"unknown\");\n\tattrs.addAttribute(\"\", \"email\", \"email\", \"\", identity.email());\n\tattrs.addAttribute(\"\", \"imgurl\", \"imgurl\", \"\",\n\t\t\tidentity.picture().toString());\n\toutput.emptyElement(\"\", \"user\", \"user\", attrs);\n}\n<commit_msg>xmlui: Serializing: changes in DeviceInfo<commit_after>#include <string>\n#include <Poco\/XML\/XMLWriter.h>\n#include <Poco\/SAX\/AttributesImpl.h>\n\n#include \"xmlui\/Serializing.h\"\n#include \"model\/Gateway.h\"\n#include \"model\/LegacyGateway.h\"\n#include \"model\/Location.h\"\n#include \"model\/Device.h\"\n#include \"model\/DeviceInfo.h\"\n#include \"model\/DeviceProperty.h\"\n#include \"model\/RoleInGateway.h\"\n#include \"model\/LegacyRoleInGateway.h\"\n#include \"model\/VerifiedIdentity.h\"\n\nusing namespace std;\nusing namespace Poco;\nusing namespace Poco::XML;\nusing namespace BeeeOn;\n\nstatic void prepare(AttributesImpl &attrs, const Gateway &gateway)\n{\n\tattrs.addAttribute(\"\", \"id\", \"id\", \"\", gateway.id().toString());\n\tattrs.addAttribute(\"\", \"name\", \"name\", \"\", gateway.name());\n\tattrs.addAttribute(\"\", \"longitude\", \"longitude\", \"\",\n\t\t\tstd::to_string(gateway.longitude()));\n\tattrs.addAttribute(\"\", \"latitude\", \"latitude\", \"\",\n\t\t\tstd::to_string(gateway.latitude()));\n\n\tif (gateway.altitude().isNull()) {\n\t\tattrs.addAttribute(\"\", \"altitude\", \"altitude\", \"\", \"\");\n\t}\n\telse {\n\t\tattrs.addAttribute(\"\", \"altitude\", \"altitude\", \"\",\n\t\t\tstd::to_string(gateway.altitude().value()));\n\t}\n\n\tattrs.addAttribute(\"\", \"version\", \"version\", \"\", gateway.version());\n\tattrs.addAttribute(\"\", \"ip\", \"ip\", \"\", gateway.ipAddress().toString());\n}\n\nvoid BeeeOn::XmlUI::serialize(XMLWriter &output, const Gateway &gateway)\n{\n\tAttributesImpl attrs;\n\tprepare(attrs, gateway);\n\toutput.emptyElement(\"\", \"gate\", \"gate\", attrs);\n}\n\nvoid BeeeOn::XmlUI::serialize(Poco::XML::XMLWriter &output,\n\t\tconst std::vector<Gateway> &gateways)\n{\n\tfor (auto gateway : gateways)\n\t\tserialize(output, gateway);\n}\n\nvoid BeeeOn::XmlUI::serialize(XMLWriter &output, const LegacyGateway &gateway)\n{\n\tAttributesImpl attrs;\n\tprepare(attrs, gateway);\n\n\tattrs.addAttribute(\"\", \"owner\", \"owner\", \"\",\n\t\t\tgateway.owner().fullName());\n\tattrs.addAttribute(\"\", \"permission\", \"permission\", \"\",\n\t\t\tgateway.accessLevel().toString());\n\tattrs.addAttribute(\"\", \"devices\", \"devices\", \"\",\n\t\t\tto_string(gateway.deviceCount()));\n\tattrs.addAttribute(\"\", \"users\", \"users\", \"\",\n\t\t\tto_string(gateway.userCount()));\n\tattrs.addAttribute(\"\", \"timezone\", \"timezone\", \"\", \"0\");\n\tattrs.addAttribute(\"\", \"status\", \"status\", \"\", \"available\");\n\n\toutput.emptyElement(\"\", \"gate\", \"gate\", attrs);\n}\n\nvoid BeeeOn::XmlUI::serialize(Poco::XML::XMLWriter &output,\n\t\tconst std::vector<LegacyGateway> &gateways)\n{\n\tfor (auto gateway : gateways)\n\t\tserialize(output, gateway);\n}\n\nvoid BeeeOn::XmlUI::serialize(XMLWriter &output, const Location &location)\n{\n\tAttributesImpl attrs;\n\tattrs.addAttribute(\"\", \"id\", \"id\", \"\", location.id().toString());\n\tattrs.addAttribute(\"\", \"locationid\", \"locationid\", \"\",\n\t\t\tlocation.id().toString());\n\tattrs.addAttribute(\"\", \"name\", \"name\", \"\", location.name());\n\tattrs.addAttribute(\"\", \"type\", \"type\", \"\", \"0\"); \/\/ FIXME\n\n\toutput.emptyElement(\"\", \"location\", \"location\", attrs);\n}\n\nvoid BeeeOn::XmlUI::serialize(Poco::XML::XMLWriter &output,\n\t\tconst std::vector<Location> &locations)\n{\n\tfor (auto location : locations)\n\t\tserialize(output, location);\n}\n\nvoid BeeeOn::XmlUI::serialize(Poco::XML::XMLWriter &output,\n\t\tconst Device &device)\n{\n\tAttributesImpl attrs;\n\tattrs.addAttribute(\"\", \"id\", \"id\", \"\", device.id().toString());\n\tattrs.addAttribute(\"\", \"euid\", \"euid\", \"\", device.id().toString());\n\tattrs.addAttribute(\"\", \"type\", \"type\", \"\", device.type()->id().toString());\n\tattrs.addAttribute(\"\", \"locationid\", \"locationid\", \"\",\n\t\t\tdevice.location().id().toString());\n\tattrs.addAttribute(\"\", \"gateid\", \"gateid\", \"\",\n\t\t\tdevice.gateway().id().toString());\n\n\tif (device.name().empty())\n\t\tattrs.addAttribute(\"\", \"name\", \"name\", \"\", device.type()->displayName());\n\telse\n\t\tattrs.addAttribute(\"\", \"name\", \"name\", \"\", device.name());\n\n\tattrs.addAttribute(\"\", \"status\", \"status\", \"\",\n\t\t\tdevice.available()? \"available\" : \"unavailable\");\n\tattrs.addAttribute(\"\", \"time\", \"time\", \"\",\n\t\t\tto_string(device.lastSeen().timestamp().epochTime()));\n\tattrs.addAttribute(\"\", \"involved\", \"involved\", \"\",\n\t\t\tto_string(device.firstSeen().timestamp().epochTime()));\n\tattrs.addAttribute(\"\", \"init\", \"init\", \"\",\n\t\t\tdevice.active()? \"1\" : \"0\");\n\n\tconst Poco::SharedPtr<DeviceInfo> info = device.type();\n\n\tattrs.addAttribute(\"\", \"displayName\", \"displayName\", \"\",\n\t\t\tinfo->vendor() + \" \" + info->name());\n\tattrs.addAttribute(\"\", \"name\", \"name\", \"\", info->displayName());\n\tattrs.addAttribute(\"\", \"vendor\", \"vendor\", \"\", info->displayVendor());\n\n\toutput.startElement(\"\", \"device\", \"device\", attrs);\n\n\tfor (auto module : *info) {\n\t\tAttributesImpl attrs;\n\n\t\tattrs.addAttribute(\"\", \"id\", \"id\", \"\", module.id().toString());\n\t\t\/\/ FIXME: just copy device status for now\n\t\tattrs.addAttribute(\"\", \"status\", \"status\", \"\",\n\t\t\t\tdevice.available()? \"available\" : \"unavailable\");\n\t\t\/\/ FIXME: no values implemented, send neutral 0\n\t\tattrs.addAttribute(\"\", \"value\", \"value\", \"\", \"0\");\n\n\t\tattrs.addAttribute(\"\", \"type\", \"type\", \"\", module.type()->id().toString());\n\n\t\tif (!module.name().empty())\n\t\t\tattrs.addAttribute(\"\", \"name\", \"name\", \"\", module.name());\n\t\tif (!module.group().empty())\n\t\t\tattrs.addAttribute(\"\", \"group\", \"group\", \"\", module.group());\n\n\t\toutput.emptyElement(\"\", \"module\", \"module\", attrs);\n\t}\n\n\toutput.endElement(\"\", \"device\", \"device\");\n}\n\nvoid BeeeOn::XmlUI::serialize(Poco::XML::XMLWriter &output,\n\t\tconst std::vector<Device> &devices)\n{\n\tfor (auto device : devices)\n\t\tserialize(output, device);\n}\n\nvoid BeeeOn::XmlUI::serialize(Poco::XML::XMLWriter &output,\n\t\tconst std::list<Device> &devices)\n{\n\tfor (auto device : devices)\n\t\tserialize(output, device);\n}\n\nvoid BeeeOn::XmlUI::serialize(Poco::XML::XMLWriter &output,\n\t\tconst DecryptedDeviceProperty &property,\n\t\tconst Device &device)\n{\n\tAttributesImpl attrs;\n\n\tattrs.addAttribute(\"\", \"euid\", \"euid\", \"\",\n\t\t\tdevice.id().toString());\n\tattrs.addAttribute(\"\", \"gateid\", \"gateid\", \"\",\n\t\t\tdevice.gateway().id().toString());\n\tattrs.addAttribute(\"\", \"parameterkey\", \"parameterkey\", \"\",\n\t\t\tproperty.key().toString());\n\n\tstring value;\n\n\tswitch (property.key().raw()) {\n\tcase DevicePropertyKey::KEY_IP_ADDRESS:\n\t\tvalue = property.asIPAddress().toString();\n\t\tbreak;\n\tcase DevicePropertyKey::KEY_FIRMWARE:\n\t\tvalue = property.asFirmware();\n\t\tbreak;\n\tcase DevicePropertyKey::KEY_PASSWORD:\n\t\tvalue = property.asPassword();\n\t\tbreak;\n\tdefault:\n\t\tbreak;\n\t}\n\n\tattrs.addAttribute(\"\", \"parametervalue\", \"parametervalue\", \"\", value);\n\n\toutput.emptyElement(\"\", \"device\", \"device\", attrs);\n}\n\nstatic void prepare(AttributesImpl &attrs, const RoleInGateway &role)\n{\n\tattrs.addAttribute(\"\", \"id\", \"id\", \"\", role.id().toString());\n\tattrs.addAttribute(\"\", \"email\", \"email\", \"\",\n\t\t\trole.identity().email());\n\tattrs.addAttribute(\"\", \"level\", \"level\", \"\",\n\t\t\trole.level().toString());\n}\n\nvoid BeeeOn::XmlUI::serialize(Poco::XML::XMLWriter &output,\n\t\tconst RoleInGateway &role)\n{\n\tAttributesImpl attrs;\n\tprepare(attrs, role);\n\toutput.emptyElement(\"\", \"user\", \"user\", attrs);\n}\n\nvoid BeeeOn::XmlUI::serialize(Poco::XML::XMLWriter &output,\n\t\tconst std::vector<RoleInGateway> &roles)\n{\n\tfor (auto role : roles)\n\t\tserialize(output, role);\n}\n\nvoid BeeeOn::XmlUI::serialize(Poco::XML::XMLWriter &output,\n\t\tconst LegacyRoleInGateway &role)\n{\n\tAttributesImpl attrs;\n\tprepare(attrs, role);\n\n\tif (role.isOwner()) {\n\t\tattrs.addAttribute(\"\", \"permission\", \"permission\",\n\t\t\t\t\"\", \"owner\");\n\t}\n\telse {\n\t\tattrs.addAttribute(\"\", \"permission\", \"permission\",\n\t\t\t\t\"\", role.level().toString());\n\t}\n\n\tattrs.addAttribute(\"\", \"gender\", \"gender\", \"\", \"unknown\");\n\tattrs.addAttribute(\"\", \"name\", \"name\", \"\", role.firstName());\n\tattrs.addAttribute(\"\", \"surname\", \"surname\", \"\", role.lastName());\n\tattrs.addAttribute(\"\", \"imgurl\", \"imgurl\", \"\", role.picture().toString());\n\n\toutput.emptyElement(\"\", \"user\", \"user\", attrs);\n}\n\nvoid BeeeOn::XmlUI::serialize(Poco::XML::XMLWriter &output,\n\t\tconst std::vector<LegacyRoleInGateway> &roles)\n{\n\tfor (auto role : roles)\n\t\tserialize(output, role);\n}\n\nvoid BeeeOn::XmlUI::serializeMyself(\n\t\tPoco::XML::XMLWriter &output,\n\t\tconst VerifiedIdentity &identity)\n{\n\tconst User &user = identity.user();\n\n\tAttributesImpl attrs;\n\tattrs.addAttribute(\"\", \"id\", \"id\", \"\", identity.id().toString());\n\tattrs.addAttribute(\"\", \"name\", \"name\", \"\", user.firstName());\n\tattrs.addAttribute(\"\", \"first_name\", \"first_name\", \"\",\n\t\t\tuser.firstName());\n\tattrs.addAttribute(\"\", \"surname\", \"surname\", \"\", user.lastName());\n\tattrs.addAttribute(\"\", \"last_name\", \"last_name\", \"\",\n\t\t\tuser.lastName());\n\tattrs.addAttribute(\"\", \"gender\", \"gender\", \"\", \"unknown\");\n\tattrs.addAttribute(\"\", \"email\", \"email\", \"\", identity.email());\n\tattrs.addAttribute(\"\", \"imgurl\", \"imgurl\", \"\",\n\t\t\tidentity.picture().toString());\n\toutput.emptyElement(\"\", \"user\", \"user\", attrs);\n}\n<|endoftext|>"} {"text":"<commit_before>#include \"stdafx.h\"\n#include \"RPlotHost.h\"\n\n#define WM_ACTIVATE_PLOT (WM_USER + 100)\n\nusing namespace rplots;\n\nHWND RPlotHost::m_hwndPlotWindow = NULL;\nHHOOK RPlotHost::m_hOldHook = NULL;\nbool RPlotHost::m_fProcessing = false;\nstd::unique_ptr<RPlotHost> RPlotHost::m_pInstance = NULL;\n\nRPlotHost::RPlotHost(HWND wndPlotWindow) {\n m_hwndPlotWindow = wndPlotWindow;\n m_hOldHook = ::SetWindowsHookEx(WH_CBT, CBTProc, NULL, ::GetCurrentThreadId());\n}\n\nvoid RPlotHost::Init(HWND handle) {\n if (!m_pInstance && handle != NULL) {\n m_pInstance = std::unique_ptr<RPlotHost>(new RPlotHost(handle));\n }\n}\n\nvoid RPlotHost::Terminate() {\n if (m_hOldHook != NULL) {\n ::UnhookWindowsHookEx(m_hOldHook);\n m_hOldHook = NULL;\n\n } \n m_pInstance = NULL;\n}\n\nLRESULT CALLBACK RPlotHost::CBTProc(\n _In_ int nCode,\n _In_ WPARAM wParam,\n _In_ LPARAM lParam\n ) {\n if (nCode == HCBT_ACTIVATE) {\n if (!m_fProcessing) {\n m_fProcessing = true;\n HWND hwnd = (HWND)wParam;\n WCHAR buf[100];\n ::RealGetWindowClass(hwnd, buf, _countof(buf));\n if (wcscmp(buf, L\"GraphApp\") == 0) {\n if (m_hwndPlotWindow != GetParent(hwnd)) {\n RECT rc;\n ::SetWindowLong(hwnd, GWL_STYLE, WS_CHILD);\n ::SetWindowLong(hwnd, GWL_EXSTYLE, 0);\n ::SetMenu(hwnd, NULL);\n\n ::SetParent(hwnd, m_hwndPlotWindow);\n ::GetClientRect(m_hwndPlotWindow, &rc);\n\n if (rc.right < 0) {\n rc.right = 200;\n rc.bottom = 300;\n }\n\n ::SetWindowPos(hwnd, HWND_TOP, 0, 0, rc.right, rc.bottom, SWP_SHOWWINDOW | SWP_FRAMECHANGED);\n }\n }\n m_fProcessing = false;\n }\n }\n\n return ::CallNextHookEx(m_hOldHook, nCode, wParam, lParam);\n};\n<commit_msg>Added post message to activate plot window in VS<commit_after>#include \"stdafx.h\"\n#include \"RPlotHost.h\"\n\n#define WM_ACTIVATE_PLOT (WM_USER + 100)\n\nusing namespace rplots;\n\nHWND RPlotHost::m_hwndPlotWindow = NULL;\nHHOOK RPlotHost::m_hOldHook = NULL;\nbool RPlotHost::m_fProcessing = false;\nstd::unique_ptr<RPlotHost> RPlotHost::m_pInstance = NULL;\n\nRPlotHost::RPlotHost(HWND wndPlotWindow) {\n m_hwndPlotWindow = wndPlotWindow;\n m_hOldHook = ::SetWindowsHookEx(WH_CBT, CBTProc, NULL, ::GetCurrentThreadId());\n}\n\nvoid RPlotHost::Init(HWND handle) {\n if (!m_pInstance && handle != NULL) {\n m_pInstance = std::unique_ptr<RPlotHost>(new RPlotHost(handle));\n }\n}\n\nvoid RPlotHost::Terminate() {\n if (m_hOldHook != NULL) {\n ::UnhookWindowsHookEx(m_hOldHook);\n m_hOldHook = NULL;\n\n } \n m_pInstance = NULL;\n}\n\nLRESULT CALLBACK RPlotHost::CBTProc(\n _In_ int nCode,\n _In_ WPARAM wParam,\n _In_ LPARAM lParam\n ) {\n if (nCode == HCBT_ACTIVATE) {\n if (!m_fProcessing) {\n m_fProcessing = true;\n HWND hwnd = (HWND)wParam;\n WCHAR buf[100];\n ::RealGetWindowClass(hwnd, buf, _countof(buf));\n if (wcscmp(buf, L\"GraphApp\") == 0) {\n if (m_hwndPlotWindow != GetParent(hwnd)) {\n RECT rc;\n ::SetWindowLong(hwnd, GWL_STYLE, WS_CHILD);\n ::SetWindowLong(hwnd, GWL_EXSTYLE, 0);\n ::SetMenu(hwnd, NULL);\n\n ::SetParent(hwnd, m_hwndPlotWindow);\n ::GetClientRect(m_hwndPlotWindow, &rc);\n\n if (rc.right < 0) {\n rc.right = 200;\n rc.bottom = 300;\n }\n\n ::SetWindowPos(hwnd, HWND_TOP, 0, 0, rc.right, rc.bottom, SWP_SHOWWINDOW | SWP_FRAMECHANGED);\n ::PostMessage(m_hwndPlotWindow, WM_ACTIVATE_PLOT, 0, 0);\n }\n }\n m_fProcessing = false;\n }\n }\n\n return ::CallNextHookEx(m_hOldHook, nCode, wParam, lParam);\n};\n<|endoftext|>"} {"text":"<commit_before>#include \"RayTracer.hpp\"\n#include \"Tree.hpp\"\n#include <ctime>\n\n\/\/temporary variables\nVec3Df testRayOrigin;\nVec3Df testRayDestination;\nstring mesh;\nextern unsigned int textures[2];\nclock_t lastFrameTime;\nfloat fps;\nunsigned int framesSinceLastDraw = 30;\nstring screenFPS;\nextern unsigned int previewResX;\nextern unsigned int previewResY;\nextern unsigned int msaa;\nextern unsigned int numThreads;\nextern Tree MyTree;\n\n\/\/use this function for any preprocessing of the mesh.\nint init(int argc, char **argv){\n \/\/ skip program name argv[0] if present\n argc -= (argc > 0);\n argv += (argc > 0);\n\n option::Stats stats(usage, argc, argv);\n option::Option* options = (option::Option*)calloc(stats.options_max,\n sizeof(option::Option));\n option::Option* buffer = (option::Option*)calloc(stats.buffer_max,\n sizeof(option::Option));\n\n option::Parser parse(usage, argc, argv, options, buffer);\n\n if(parse.error())\n return 1;\n\n if(options[HELP]){\n int columns = getenv(\"COLUMNS\") ? atoi(getenv(\"COLUMNS\")) : 80;\n option::printUsage(fwrite, stdout, usage, columns);\n return 2;\n }\n\n lastFrameTime = clock();\n\n if(options[MESH]){\n const char* arg = options[MESH].last()->arg;\n if(arg != 0){\n mesh = arg;\n }\n }else{\n mesh = \"0\";\n }\n\n if(mesh == \"0\")\n mesh = \"cube\";\n else if(mesh == \"1\")\n mesh = \"simple_monkey\";\n else if(mesh == \"2\")\n mesh = \"monkey\";\n else if(mesh == \"3\")\n mesh = \"dodgeColorTest\";\n\n mesh = string(\"mesh\/\").append(mesh).append(\".obj\");\n MyMesh.loadMesh(mesh.c_str(), true);\n MyMesh.computeVertexNormals();\n\tMyTree.build(MyMesh);\n\n\n \/\/one first move: initialize the first light source\n \/\/at least ONE light source has to be in the scene!!!\n \/\/here, we set it to the current location of the camera\n MyLightPositions.push_back(MyCameraPosition);\n\n if(options[RAYTRACE]){\n startRayTracing(activeTexIndex, true);\n return 255;\n }\n\n return 0;\n}\n\n\/\/transformer le x, y en position 3D\nvoid produceRay(int x_I, int y_I, Vec3Df * origin, Vec3Df * dest){\n int viewport[4];\n double modelview[16];\n double projection[16];\n \/\/point sur near plane\n \/\/double positionN[3];\n \/\/point sur far plane\n \/\/double positionF[3];\n glGetDoublev(GL_MODELVIEW_MATRIX, modelview); \/\/recuperer matrices\n glGetDoublev(GL_PROJECTION_MATRIX, projection); \/\/recuperer matrices\n glGetIntegerv(GL_VIEWPORT, viewport); \/\/viewport\n int y_new = viewport[3] - y_I;\n\n double x, y, z;\n\n gluUnProject(x_I, y_new, 0, modelview, projection, viewport, &x, &y, &z);\n origin->p[0] = float(x);\n origin->p[1] = float(y);\n origin->p[2] = float(z);\n gluUnProject(x_I, y_new, 1, modelview, projection, viewport, &x, &y, &z);\n dest->p[0] = float(x);\n dest->p[1] = float(y);\n dest->p[2] = float(z);\n}\n\nvoid produceRay(int x_I, int y_I, Vec3Df & origin, Vec3Df & dest){\n produceRay(x_I, y_I, &origin, &dest);\n}\n\nVec3Df origin00, dest00;\nVec3Df origin01, dest01;\nVec3Df origin10, dest10;\nVec3Df origin11, dest11;\n#ifdef WIN32\n#define linux false\n#else\n#define linux true\n#endif\n\n\nvoid raytracePart(Image* result, int w, int h, int xx, int yy, int ww, int hh){\n Vec3Df origin, dest;\n for(float y = yy;y < hh;y++){\n for(float x = xx;x < ww;x++){\n \/\/svp, decidez vous memes quels parametres vous allez passer à la fonction\n \/\/c'est le stront a la plafond, c'est drôle\n \/\/e.g., maillage, triangles, sphères etc.\n Vec3Df total(0, 0, 0);\n for(unsigned int xs = 0;xs < msaa;xs++){\n for(unsigned int ys = 0;ys < msaa;ys++){\n\n float xscale = 1.0f - (x + float(xs) \/ msaa) \/ (w - 1);\n float yscale = float(y + float(ys) \/ msaa) \/ (h - 1);\n if(linux)\n \tyscale = 1.0f - yscale;\n origin = yscale\n * (xscale * origin00 + (1 - xscale) * origin10)\n + (1 - yscale)\n * (xscale * origin01\n + (1 - xscale) * origin11);\n dest = yscale * (xscale * dest00 + (1 - xscale) * dest10)\n + (1 - yscale)\n * (xscale * dest01 + (1 - xscale) * dest11);\n\n total += performRayTracing(origin, dest);\n }\n }\n\n \/\/ calculate average color\n total \/= msaa * msaa;\n \/\/ result->_image\n result->_image[(y * result->_width + x) * 3 + 0] = total[0];\n result->_image[(y * result->_width + x) * 3 + 1] = total[1];\n result->_image[(y * result->_width + x) * 3 + 2] = total[2];\n }\n }\n}\n\nvoid startRayTracing(int texIndex, bool verbose){\n if(verbose)\n cout << \"Raytracing\" << endl;\n int w = RayTracingResolutionX;\n int h = RayTracingResolutionY;\n if(!verbose)\n w = previewResX;\n if(!verbose)\n h = previewResY;\n Image result(w, h);\n\n produceRay(0, 0, &origin00, &dest00);\n produceRay(0, WindowSizeX - 1, &origin01, &dest01);\n produceRay(WindowSizeX - 1, 0, &origin10, &dest10);\n produceRay(WindowSizeX - 1, WindowSizeY - 1, &origin11, &dest11);\n\n \/\/ Perform timing\n time_t start, end, ticks;\n start = clock();\n\n \/\/ multithread\n#if THREADS != 0\n std::thread** th = (std::thread**)alloca(numThreads * sizeof(std::thread*));\n int subw = w \/ numThreads;\n\n for(unsigned int i = 0;i < numThreads;i++)\n\t\tth[i] = new std::thread(raytracePart, &result, w, h, i * subw, 0,\n (i + 1) * subw, h);\t\t\t\/\/ i * subw, 0, subw, h);\n\n \/\/ wait for them to finish\n for(unsigned int i = 0;i < numThreads;i++)\n\t\tth[i]->join();\n\n \/\/ kill them all\n for(unsigned int i = 0;i < numThreads;i++)\n\t\tdelete th[i];\n#else\n raytracePart(&result, w, h, 0, 0, w, h);\n#endif\n\n \/\/ calculate elapsed time\n end = clock();\n ticks = end - start;\n start = end;\n int millis = ticks * 1000 \/ CLOCKS_PER_SEC;\n\n if(verbose)\n printf(\"Rendering took %d ms cpu seconds and %d ms wall time\\n\",\n millis, millis\/max(4, 1));\n\n \/\/ write to texture\n glBindTexture(GL_TEXTURE_2D, textures[texIndex]);\n glTexImage2D(GL_TEXTURE_2D, 0, GL_RGB, w, h, 0, GL_RGB, GL_FLOAT,\n &result._image[0]);\n\n \/\/ calculate elapsed time\n end = clock();\n ticks = end - start;\n millis = ticks * 1000 \/ CLOCKS_PER_SEC;\n\n if(verbose)\n printf(\"Uploading to GPU took %d ms\\n\", millis);\n\n if(verbose)\n result.writeImage(\"result\");\n}\n\n#define VEWY_HIGH 10e6f\n\nVec3Df black(0, 0, 0);\n\n\/\/return the color of your pixel.\nVec3Df performRayTracing(const Vec3Df & origin, const Vec3Df & dest){\n Ray ray = Ray(black, origin, dest);\n\n\t\/\/ calculate nearest triangle\n\tTriangle* triangle;\n\tfloat dist = MyTree.collide(ray, &triangle);\n\tVec3Df light(1, 1, 1);\n\tVec3Df orig2 = origin + ray.dir * dist;\n\tVec3Df tolight = light - orig2;\n\n\tfloat angle = dot(orig2, tolight) * 2;\n\n\treturn Vec3Df(angle, angle, angle * 0.5f);\n}\n\nvoid yourDebugDraw(){\n \/\/draw open gl debug stuff\n \/\/this function is called every frame\n\n drawFPS();\n\n \/\/as an example:\n glPushAttrib(GL_ALL_ATTRIB_BITS);\n glDisable(GL_LIGHTING);\n glColor3f(1, 0, 1);\n glBegin(GL_LINES);\n glVertex3f(testRayOrigin[0], testRayOrigin[1], testRayOrigin[2]);\n glVertex3f(testRayDestination[0], testRayDestination[1],\n testRayDestination[2]);\n glEnd();\n glPointSize(10);\n glBegin(GL_POINTS);\n glVertex3fv(MyLightPositions[0].pointer());\n glEnd();\n glPopAttrib();\n\n}\n\nvoid yourKeyboardFunc(char t, int x, int y){\n \/\/ do what you want with the keyboard input t.\n \/\/ x, y are the screen position\n\n \/\/here I use it to get the coordinates of a ray, which I then draw in the debug function.\n produceRay(x, y, testRayOrigin, testRayDestination);\n\n std::cout << t << \" pressed! The mouse was in location \" << x << \",\" << y\n << \"!\" << std::endl;\n}\n\nvoid drawFPS(){\n clock_t diff = clock() - lastFrameTime;\n lastFrameTime = clock();\n fps = 1 \/ ((float)diff \/ (float)CLOCKS_PER_SEC);\n\n if(framesSinceLastDraw++ > 29){\n framesSinceLastDraw = 0;\n screenFPS = to_string((int)fps);\n }\n\n glLoadIdentity();\n \/\/glRasterPos2f(1.0f, 1.0f); \/\/ FPS draws on the lefthand bottom side of the screen now, if anyone knows how to get it to the lefthand top of the screen please fix it ;)\n for(unsigned int i = 0;i < screenFPS.length();i++){\n glutBitmapCharacter(GLUT_BITMAP_HELVETICA_18, screenFPS[i]);\n }\n}\n<commit_msg>M'erge branch 'master' of https:\/\/github.com\/WoLpH\/computer_graphics<commit_after>#include \"RayTracer.hpp\"\n#include \"Tree.hpp\"\n#include <ctime>\n\n\/\/temporary variables\nVec3Df testRayOrigin;\nVec3Df testRayDestination;\nstring mesh;\nextern unsigned int textures[2];\nclock_t lastFrameTime;\nfloat fps;\nunsigned int framesSinceLastDraw = 30;\nstring screenFPS;\nextern unsigned int previewResX;\nextern unsigned int previewResY;\nextern unsigned int msaa;\nextern unsigned int numThreads;\nextern Tree MyTree;\n\n\/\/use this function for any preprocessing of the mesh.\nint init(int argc, char **argv){\n \/\/ skip program name argv[0] if present\n argc -= (argc > 0);\n argv += (argc > 0);\n\n option::Stats stats(usage, argc, argv);\n option::Option* options = (option::Option*)calloc(stats.options_max,\n sizeof(option::Option));\n option::Option* buffer = (option::Option*)calloc(stats.buffer_max,\n sizeof(option::Option));\n\n option::Parser parse(usage, argc, argv, options, buffer);\n\n if(parse.error())\n return 1;\n\n if(options[HELP]){\n int columns = getenv(\"COLUMNS\") ? atoi(getenv(\"COLUMNS\")) : 80;\n option::printUsage(fwrite, stdout, usage, columns);\n return 2;\n }\n\n lastFrameTime = clock();\n\n if(options[MESH]){\n const char* arg = options[MESH].last()->arg;\n if(arg != 0){\n mesh = arg;\n }\n }else{\n mesh = \"0\";\n }\n\n if(mesh == \"0\")\n mesh = \"cube\";\n else if(mesh == \"1\")\n mesh = \"simple_monkey\";\n else if(mesh == \"2\")\n mesh = \"monkey\";\n else if(mesh == \"3\")\n mesh = \"dodgeColorTest\";\n\n mesh = string(\"mesh\/\").append(mesh).append(\".obj\");\n MyMesh.loadMesh(mesh.c_str(), true);\n MyMesh.computeVertexNormals();\n MyTree.build(MyMesh);\n\n \/\/one first move: initialize the first light source\n \/\/at least ONE light source has to be in the scene!!!\n \/\/here, we set it to the current location of the camera\n MyLightPositions.push_back(MyCameraPosition);\n\n if(options[RAYTRACE]){\n startRayTracing(activeTexIndex, true);\n return 255;\n }\n\n return 0;\n}\n\n\/\/transformer le x, y en position 3D\nvoid produceRay(int x_I, int y_I, Vec3Df * origin, Vec3Df * dest){\n int viewport[4];\n double modelview[16];\n double projection[16];\n \/\/point sur near plane\n \/\/double positionN[3];\n \/\/point sur far plane\n \/\/double positionF[3];\n glGetDoublev(GL_MODELVIEW_MATRIX, modelview); \/\/recuperer matrices\n glGetDoublev(GL_PROJECTION_MATRIX, projection); \/\/recuperer matrices\n glGetIntegerv(GL_VIEWPORT, viewport); \/\/viewport\n int y_new = viewport[3] - y_I;\n\n double x, y, z;\n\n gluUnProject(x_I, y_new, 0, modelview, projection, viewport, &x, &y, &z);\n origin->p[0] = float(x);\n origin->p[1] = float(y);\n origin->p[2] = float(z);\n gluUnProject(x_I, y_new, 1, modelview, projection, viewport, &x, &y, &z);\n dest->p[0] = float(x);\n dest->p[1] = float(y);\n dest->p[2] = float(z);\n}\n\nvoid produceRay(int x_I, int y_I, Vec3Df & origin, Vec3Df & dest){\n produceRay(x_I, y_I, &origin, &dest);\n}\n\nVec3Df origin00, dest00;\nVec3Df origin01, dest01;\nVec3Df origin10, dest10;\nVec3Df origin11, dest11;\n\nvoid raytracePart(Image* result, int w, int h, int xx, int yy, int ww, int hh){\n Vec3Df origin, dest;\n for(float y = yy;y < hh;y++){\n for(float x = xx;x < ww;x++){\n \/\/svp, decidez vous memes quels parametres vous allez passer à la fonction\n \/\/c'est le stront a la plafond, c'est drôle\n \/\/e.g., maillage, triangles, sphères etc.\n Vec3Df total(0, 0, 0);\n for(unsigned int xs = 0;xs < msaa;xs++){\n for(unsigned int ys = 0;ys < msaa;ys++){\n\n float xscale = 1.0f - (x + float(xs) \/ msaa) \/ (w - 1);\n float yscale = float(y + float(ys) \/ msaa) \/ (h - 1);\n#ifdef LINUX\n yscale = 1.0f - yscale;\n#endif\n origin = yscale\n * (xscale * origin00 + (1 - xscale) * origin10)\n + (1 - yscale)\n * (xscale * origin01\n + (1 - xscale) * origin11);\n dest = yscale * (xscale * dest00 + (1 - xscale) * dest10)\n + (1 - yscale)\n * (xscale * dest01 + (1 - xscale) * dest11);\n\n total += performRayTracing(origin, dest);\n }\n }\n\n \/\/ calculate average color\n total \/= msaa * msaa;\n \/\/ result->_image\n result->_image[(y * result->_width + x) * 3 + 0] = total[0];\n result->_image[(y * result->_width + x) * 3 + 1] = total[1];\n result->_image[(y * result->_width + x) * 3 + 2] = total[2];\n }\n }\n}\n\nvoid startRayTracing(int texIndex, bool verbose){\n if(verbose)\n cout << \"Raytracing\" << endl;\n int w = RayTracingResolutionX;\n int h = RayTracingResolutionY;\n if(!verbose)\n w = previewResX;\n if(!verbose)\n h = previewResY;\n Image result(w, h);\n\n produceRay(0, 0, &origin00, &dest00);\n produceRay(0, WindowSizeX - 1, &origin01, &dest01);\n produceRay(WindowSizeX - 1, 0, &origin10, &dest10);\n produceRay(WindowSizeX - 1, WindowSizeY - 1, &origin11, &dest11);\n\n \/\/ Perform timing\n time_t start, end, ticks;\n start = clock();\n\n \/\/ multithread\n#if THREADS != 0\n std::thread** th = (std::thread**)alloca(numThreads * sizeof(std::thread*));\n int subw = w \/ numThreads;\n\n for(unsigned int i = 0;i < numThreads;i++)\n th[i] = new std::thread(raytracePart, &result, w, h, i * subw, 0,\n (i + 1) * subw, h);\t\t\t\/\/ i * subw, 0, subw, h);\n\n \/\/ wait for them to finish\n for(unsigned int i = 0;i < numThreads;i++)\n th[i]->join();\n\n \/\/ kill them all\n for(unsigned int i = 0;i < numThreads;i++)\n delete th[i];\n#else\n raytracePart(&result, w, h, 0, 0, w, h);\n#endif\n\n \/\/ calculate elapsed time\n end = clock();\n ticks = end - start;\n start = end;\n int millis = ticks * 1000 \/ CLOCKS_PER_SEC;\n\n if(verbose)\n printf(\"Rendering took %d ms cpu seconds and %d ms wall time\\n\", millis,\n millis \/ max(numThreads, 1u));\n\n \/\/ write to texture\n glBindTexture(GL_TEXTURE_2D, textures[texIndex]);\n glTexImage2D(GL_TEXTURE_2D, 0, GL_RGB, w, h, 0, GL_RGB, GL_FLOAT,\n &result._image[0]);\n\n \/\/ calculate elapsed time\n end = clock();\n ticks = end - start;\n millis = ticks * 1000 \/ CLOCKS_PER_SEC;\n\n if(verbose)\n printf(\"Uploading to GPU took %d ms\\n\", millis);\n\n if(verbose)\n result.writeImage(\"result\");\n}\n\n#define VEWY_HIGH 10e6f\n\nVec3Df black(0, 0, 0);\n\n\/\/return the color of your pixel.\nVec3Df performRayTracing(const Vec3Df & origin, const Vec3Df & dest){\n Ray ray = Ray(black, origin, dest);\n\n\t\/\/ calculate nearest triangle\n\tTriangle* triangle;\n\tfloat dist = MyTree.collide(ray, &triangle);\n\tVec3Df light(1, 1, 1);\n\tVec3Df orig2 = origin + ray.dir * dist;\n\tVec3Df tolight = light - orig2;\n\n\tfloat angle = dot(orig2, tolight) * 2;\n\n\treturn Vec3Df(angle, angle, angle * 0.5f);\n}\n\nvoid yourDebugDraw(){\n \/\/draw open gl debug stuff\n \/\/this function is called every frame\n\n drawFPS();\n\n \/\/as an example:\n glPushAttrib(GL_ALL_ATTRIB_BITS);\n glDisable(GL_LIGHTING);\n glColor3f(1, 0, 1);\n glBegin(GL_LINES);\n glVertex3f(testRayOrigin[0], testRayOrigin[1], testRayOrigin[2]);\n glVertex3f(testRayDestination[0], testRayDestination[1],\n testRayDestination[2]);\n glEnd();\n glPointSize(10);\n glBegin(GL_POINTS);\n glVertex3fv(MyLightPositions[0].pointer());\n glEnd();\n glPopAttrib();\n\n}\n\nvoid yourKeyboardFunc(char t, int x, int y){\n \/\/ do what you want with the keyboard input t.\n \/\/ x, y are the screen position\n\n \/\/here I use it to get the coordinates of a ray, which I then draw in the debug function.\n produceRay(x, y, testRayOrigin, testRayDestination);\n\n std::cout << t << \" pressed! The mouse was in location \" << x << \",\" << y\n << \"!\" << std::endl;\n}\n\nvoid drawFPS(){\n clock_t diff = clock() - lastFrameTime;\n lastFrameTime = clock();\n fps = 1 \/ ((float)diff \/ (float)CLOCKS_PER_SEC);\n\n if(framesSinceLastDraw++ > 29){\n framesSinceLastDraw = 0;\n screenFPS = to_string((int)fps);\n }\n\n glLoadIdentity();\n \/\/glRasterPos2f(1.0f, 1.0f); \/\/ FPS draws on the lefthand bottom side of the screen now, if anyone knows how to get it to the lefthand top of the screen please fix it ;)\n for(unsigned int i = 0;i < screenFPS.length();i++){\n glutBitmapCharacter(GLUT_BITMAP_HELVETICA_18, screenFPS[i]);\n }\n}\n<|endoftext|>"} {"text":"<commit_before>\/\/\/ @file\n\/\/\/ @author Boris Mikic\n\/\/\/ @version 1.48\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#include \"Rectangle.h\"\n#include \"Vector2.h\"\n\nnamespace gtypes\n{\n\tRectangle::Rectangle() : x(0.0f), y(0.0f), w(0.0f), h(0.0f)\n\t{\n\t}\n\n\tRectangle::Rectangle(float x, float y, float w, float h)\n\t{\n\t\tthis->x = x;\n\t\tthis->y = y;\n\t\tthis->w = w;\n\t\tthis->h = h;\n\t}\n\t\n\tRectangle::Rectangle(Vector2 position, Vector2 size)\n\t{\n\t\tthis->x = position.x;\n\t\tthis->y = position.y;\n\t\tthis->w = size.x;\n\t\tthis->h = size.y;\n\t}\n\t\n\tRectangle::Rectangle(Vector2 position, float w, float h)\n\t{\n\t\tthis->x = position.x;\n\t\tthis->y = position.y;\n\t\tthis->w = w;\n\t\tthis->h = h;\n\t}\n\t\n\tRectangle::Rectangle(float x, float y, Vector2 size)\n\t{\n\t\tthis->x = x;\n\t\tthis->y = y;\n\t\tthis->w = size.x;\n\t\tthis->h = size.y;\n\t}\n\t\n\tvoid Rectangle::set(float x, float y, float w, float h)\n\t{\n\t\tthis->x = x;\n\t\tthis->y = y;\n\t\tthis->w = w;\n\t\tthis->h = h;\n\t}\n\t\n\tvoid Rectangle::set(Vector2 position, Vector2 size)\n\t{\n\t\tthis->x = position.x;\n\t\tthis->y = position.y;\n\t\tthis->w = size.x;\n\t\tthis->h = size.y;\n\t}\n\t\n\tvoid Rectangle::set(Vector2 position, float w, float h)\n\t{\n\t\tthis->x = position.x;\n\t\tthis->y = position.y;\n\t\tthis->w = w;\n\t\tthis->h = h;\n\t}\n\t\n\tvoid Rectangle::set(float x, float y, Vector2 size)\n\t{\n\t\tthis->x = x;\n\t\tthis->y = y;\n\t\tthis->w = size.x;\n\t\tthis->h = size.y;\n\t}\n\t\n\tVector2 Rectangle::getPosition()\n\t{\n\t\treturn Vector2(this->x, this->y);\n\t}\n\t\n\tvoid Rectangle::setPosition(Vector2 position)\n\t{\n\t\tthis->x = position.x;\n\t\tthis->y = position.y;\n\t}\n\t\n\tvoid Rectangle::setPosition(float x, float y)\n\t{\n\t\tthis->x = x;\n\t\tthis->y = y;\n\t}\n\t\n\tVector2 Rectangle::getSize()\n\t{\n\t\treturn Vector2(this->w, this->h);\n\t}\n\t\n\tvoid Rectangle::setSize(Vector2 size)\n\t{\n\t\tthis->w = size.x;\n\t\tthis->h = size.y;\n\t}\n\t\n\tvoid Rectangle::setSize(float w, float h)\n\t{\n\t\tthis->w = w;\n\t\tthis->h = h;\n\t}\n\t\n\tVector2 Rectangle::getCenter() const\n\t{\n\t\treturn Vector2(this->x + this->w * 0.5f, this->y + this->h * 0.5f);\n\t}\n\t\n\tfloat Rectangle::getAspect() const\n\t{\n\t\treturn (this->w \/ this->h);\n\t}\n\n\tVector2 Rectangle::getTopLeft() const\n\t{\n\t\treturn Vector2(this->x, this->y);\n\t}\n\t\n\tVector2 Rectangle::getTopRight() const\n\t{\n\t\treturn Vector2(this->x + this->w, this->y);\n\t}\n\t\n\tVector2 Rectangle::getBottomLeft() const\n\t{\n\t\treturn Vector2(this->x, this->y + this->h);\n\t}\n\t\n\tVector2 Rectangle::getBottomRight() const\n\t{\n\t\treturn Vector2(this->x + this->w, this->y + this->h);\n\t}\n\t\n\tfloat Rectangle::left() const\n\t{\n\t\treturn this->x;\n\t}\n\t\n\tfloat Rectangle::right() const\n\t{\n\t\treturn (this->x + this->w);\n\t}\n\t\n\tfloat Rectangle::top() const\n\t{\n\t\treturn this->y;\n\t}\n\t\n\tfloat Rectangle::bottom() const\n\t{\n\t\treturn (this->y + this->h);\n\t}\n\t\n\tfloat Rectangle::centerX() const\n\t{\n\t\treturn (this->x + this->w * 0.5f);\n\t}\n\t\n\tfloat Rectangle::centerY() const\n\t{\n\t\treturn (this->y + this->h * 0.5f);\n\t}\n\t\n\tbool Rectangle::intersects(const Rectangle& other) const\n\t{\n\t\treturn (this->x + this->w > other.x && this->x < other.x + other.w &&\n\t\t\t\tthis->y + this->h > other.y && this->y < other.y + other.h);\n\t}\n\t\n\tbool Rectangle::contains(const Rectangle& other) const\n\t{\n\t\treturn (this->x <= other.x && this->x + this->w >= other.x + other.w &&\n\t\t\tthis->y <= other.y && this->y + this->h >= other.y + other.h);\n\t}\n\t\n\tbool Rectangle::isPointInside(const Vector2& vector) const\n\t{\n\t\treturn (vector.x >= this->x && vector.y >= this->y && vector.x < this->x + this->w && vector.y < this->y + this->h);\n\t}\n\n\tbool Rectangle::isPointInside(float x, float y) const\n\t{\n\t\treturn (x >= this->x && y >= this->y && x < this->x + this->w && y < this->y + this->h);\n\t}\n\n\tRectangle Rectangle::operator+(Vector2 vector) const\n\t{\n\t\tRectangle result(*this);\n\t\tresult.x += vector.x;\n\t\tresult.y += vector.y;\n\t\treturn result;\n\t}\n\t\n\tRectangle Rectangle::operator-(Vector2 vector) const\n\t{\n\t\tRectangle result(*this);\n\t\tresult.x -= vector.x;\n\t\tresult.y -= vector.y;\n\t\treturn result;\n\t}\n\t\n\tRectangle Rectangle::operator*(Vector2 vector) const\n\t{\n\t\tRectangle result(*this);\n\t\tresult.w *= vector.x;\n\t\tresult.h *= vector.y;\n\t\treturn result;\n\t}\n\t\n\tRectangle Rectangle::operator\/(Vector2 vector) const\n\t{\n\t\tRectangle result(*this);\n\t\tresult.w \/= vector.x;\n\t\tresult.h \/= vector.y;\n\t\treturn result;\n\t}\n\t\n\tRectangle Rectangle::operator*(float scale) const\n\t{\n\t\tRectangle result(*this);\n\t\tresult.w *= scale;\n\t\tresult.h *= scale;\n\t\treturn result;\n\t}\n\t\n\tRectangle Rectangle::operator\/(float scale) const\n\t{\n\t\tRectangle result(*this);\n\t\tresult.w \/= scale;\n\t\tresult.h \/= scale;\n\t\treturn result;\n\t}\n\t\n\tRectangle Rectangle::operator+=(const Vector2& vector)\n\t{\n\t\tthis->x += vector.x;\n\t\tthis->y += vector.y;\n\t\treturn (*this);\n\t}\n\t\n\tRectangle Rectangle::operator-=(const Vector2& vector)\n\t{\n\t\tthis->x -= vector.x;\n\t\tthis->y -= vector.y;\n\t\treturn (*this);\n\t}\n\t\n\tRectangle Rectangle::operator*=(const Vector2& vector)\n\t{\n\t\tthis->w *= vector.x;\n\t\tthis->h *= vector.y;\n\t\treturn (*this);\n\t}\n\t\n\tRectangle Rectangle::operator\/=(const Vector2& vector)\n\t{\n\t\tthis->w \/= vector.x;\n\t\tthis->h \/= vector.y;\n\t\treturn (*this);\n\t}\n\t\n\tRectangle Rectangle::operator*=(float scale)\n\t{\n\t\tthis->w *= scale;\n\t\tthis->h *= scale;\n\t\treturn (*this);\n\t}\n\t\n\tRectangle Rectangle::operator\/=(float scale)\n\t{\n\t\tthis->w \/= scale;\n\t\tthis->h \/= scale;\n\t\treturn (*this);\n\t}\n\t\n\tbool Rectangle::operator==(const Rectangle& other) const\n\t{\n\t\treturn (this->x == other.x && this->y == other.y && this->w == other.w && this->h == other.h);\n\t}\n\t\n\tbool Rectangle::operator!=(const Rectangle& other) const\n\t{\n\t\treturn !(*this == other);\n\t}\n\t\n}\n\n<commit_msg><commit_after>\/\/\/ @file\n\/\/\/ @author Boris Mikic\n\/\/\/ @version 1.48\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#pragma message(\"WARNING! This version of the library is deprecated! Please use the one from: http:\/\/libgtypes.googlecode.com\")\n\n#include \"Rectangle.h\"\n#include \"Vector2.h\"\n\nnamespace gtypes\n{\n\tRectangle::Rectangle() : x(0.0f), y(0.0f), w(0.0f), h(0.0f)\n\t{\n\t}\n\n\tRectangle::Rectangle(float x, float y, float w, float h)\n\t{\n\t\tthis->x = x;\n\t\tthis->y = y;\n\t\tthis->w = w;\n\t\tthis->h = h;\n\t}\n\t\n\tRectangle::Rectangle(Vector2 position, Vector2 size)\n\t{\n\t\tthis->x = position.x;\n\t\tthis->y = position.y;\n\t\tthis->w = size.x;\n\t\tthis->h = size.y;\n\t}\n\t\n\tRectangle::Rectangle(Vector2 position, float w, float h)\n\t{\n\t\tthis->x = position.x;\n\t\tthis->y = position.y;\n\t\tthis->w = w;\n\t\tthis->h = h;\n\t}\n\t\n\tRectangle::Rectangle(float x, float y, Vector2 size)\n\t{\n\t\tthis->x = x;\n\t\tthis->y = y;\n\t\tthis->w = size.x;\n\t\tthis->h = size.y;\n\t}\n\t\n\tvoid Rectangle::set(float x, float y, float w, float h)\n\t{\n\t\tthis->x = x;\n\t\tthis->y = y;\n\t\tthis->w = w;\n\t\tthis->h = h;\n\t}\n\t\n\tvoid Rectangle::set(Vector2 position, Vector2 size)\n\t{\n\t\tthis->x = position.x;\n\t\tthis->y = position.y;\n\t\tthis->w = size.x;\n\t\tthis->h = size.y;\n\t}\n\t\n\tvoid Rectangle::set(Vector2 position, float w, float h)\n\t{\n\t\tthis->x = position.x;\n\t\tthis->y = position.y;\n\t\tthis->w = w;\n\t\tthis->h = h;\n\t}\n\t\n\tvoid Rectangle::set(float x, float y, Vector2 size)\n\t{\n\t\tthis->x = x;\n\t\tthis->y = y;\n\t\tthis->w = size.x;\n\t\tthis->h = size.y;\n\t}\n\t\n\tVector2 Rectangle::getPosition()\n\t{\n\t\treturn Vector2(this->x, this->y);\n\t}\n\t\n\tvoid Rectangle::setPosition(Vector2 position)\n\t{\n\t\tthis->x = position.x;\n\t\tthis->y = position.y;\n\t}\n\t\n\tvoid Rectangle::setPosition(float x, float y)\n\t{\n\t\tthis->x = x;\n\t\tthis->y = y;\n\t}\n\t\n\tVector2 Rectangle::getSize()\n\t{\n\t\treturn Vector2(this->w, this->h);\n\t}\n\t\n\tvoid Rectangle::setSize(Vector2 size)\n\t{\n\t\tthis->w = size.x;\n\t\tthis->h = size.y;\n\t}\n\t\n\tvoid Rectangle::setSize(float w, float h)\n\t{\n\t\tthis->w = w;\n\t\tthis->h = h;\n\t}\n\t\n\tVector2 Rectangle::getCenter() const\n\t{\n\t\treturn Vector2(this->x + this->w * 0.5f, this->y + this->h * 0.5f);\n\t}\n\t\n\tfloat Rectangle::getAspect() const\n\t{\n\t\treturn (this->w \/ this->h);\n\t}\n\n\tVector2 Rectangle::getTopLeft() const\n\t{\n\t\treturn Vector2(this->x, this->y);\n\t}\n\t\n\tVector2 Rectangle::getTopRight() const\n\t{\n\t\treturn Vector2(this->x + this->w, this->y);\n\t}\n\t\n\tVector2 Rectangle::getBottomLeft() const\n\t{\n\t\treturn Vector2(this->x, this->y + this->h);\n\t}\n\t\n\tVector2 Rectangle::getBottomRight() const\n\t{\n\t\treturn Vector2(this->x + this->w, this->y + this->h);\n\t}\n\t\n\tfloat Rectangle::left() const\n\t{\n\t\treturn this->x;\n\t}\n\t\n\tfloat Rectangle::right() const\n\t{\n\t\treturn (this->x + this->w);\n\t}\n\t\n\tfloat Rectangle::top() const\n\t{\n\t\treturn this->y;\n\t}\n\t\n\tfloat Rectangle::bottom() const\n\t{\n\t\treturn (this->y + this->h);\n\t}\n\t\n\tfloat Rectangle::centerX() const\n\t{\n\t\treturn (this->x + this->w * 0.5f);\n\t}\n\t\n\tfloat Rectangle::centerY() const\n\t{\n\t\treturn (this->y + this->h * 0.5f);\n\t}\n\t\n\tbool Rectangle::intersects(const Rectangle& other) const\n\t{\n\t\treturn (this->x + this->w > other.x && this->x < other.x + other.w &&\n\t\t\t\tthis->y + this->h > other.y && this->y < other.y + other.h);\n\t}\n\t\n\tbool Rectangle::contains(const Rectangle& other) const\n\t{\n\t\treturn (this->x <= other.x && this->x + this->w >= other.x + other.w &&\n\t\t\tthis->y <= other.y && this->y + this->h >= other.y + other.h);\n\t}\n\t\n\tbool Rectangle::isPointInside(const Vector2& vector) const\n\t{\n\t\treturn (vector.x >= this->x && vector.y >= this->y && vector.x < this->x + this->w && vector.y < this->y + this->h);\n\t}\n\n\tbool Rectangle::isPointInside(float x, float y) const\n\t{\n\t\treturn (x >= this->x && y >= this->y && x < this->x + this->w && y < this->y + this->h);\n\t}\n\n\tRectangle Rectangle::operator+(Vector2 vector) const\n\t{\n\t\tRectangle result(*this);\n\t\tresult.x += vector.x;\n\t\tresult.y += vector.y;\n\t\treturn result;\n\t}\n\t\n\tRectangle Rectangle::operator-(Vector2 vector) const\n\t{\n\t\tRectangle result(*this);\n\t\tresult.x -= vector.x;\n\t\tresult.y -= vector.y;\n\t\treturn result;\n\t}\n\t\n\tRectangle Rectangle::operator*(Vector2 vector) const\n\t{\n\t\tRectangle result(*this);\n\t\tresult.w *= vector.x;\n\t\tresult.h *= vector.y;\n\t\treturn result;\n\t}\n\t\n\tRectangle Rectangle::operator\/(Vector2 vector) const\n\t{\n\t\tRectangle result(*this);\n\t\tresult.w \/= vector.x;\n\t\tresult.h \/= vector.y;\n\t\treturn result;\n\t}\n\t\n\tRectangle Rectangle::operator*(float scale) const\n\t{\n\t\tRectangle result(*this);\n\t\tresult.w *= scale;\n\t\tresult.h *= scale;\n\t\treturn result;\n\t}\n\t\n\tRectangle Rectangle::operator\/(float scale) const\n\t{\n\t\tRectangle result(*this);\n\t\tresult.w \/= scale;\n\t\tresult.h \/= scale;\n\t\treturn result;\n\t}\n\t\n\tRectangle Rectangle::operator+=(const Vector2& vector)\n\t{\n\t\tthis->x += vector.x;\n\t\tthis->y += vector.y;\n\t\treturn (*this);\n\t}\n\t\n\tRectangle Rectangle::operator-=(const Vector2& vector)\n\t{\n\t\tthis->x -= vector.x;\n\t\tthis->y -= vector.y;\n\t\treturn (*this);\n\t}\n\t\n\tRectangle Rectangle::operator*=(const Vector2& vector)\n\t{\n\t\tthis->w *= vector.x;\n\t\tthis->h *= vector.y;\n\t\treturn (*this);\n\t}\n\t\n\tRectangle Rectangle::operator\/=(const Vector2& vector)\n\t{\n\t\tthis->w \/= vector.x;\n\t\tthis->h \/= vector.y;\n\t\treturn (*this);\n\t}\n\t\n\tRectangle Rectangle::operator*=(float scale)\n\t{\n\t\tthis->w *= scale;\n\t\tthis->h *= scale;\n\t\treturn (*this);\n\t}\n\t\n\tRectangle Rectangle::operator\/=(float scale)\n\t{\n\t\tthis->w \/= scale;\n\t\tthis->h \/= scale;\n\t\treturn (*this);\n\t}\n\t\n\tbool Rectangle::operator==(const Rectangle& other) const\n\t{\n\t\treturn (this->x == other.x && this->y == other.y && this->w == other.w && this->h == other.h);\n\t}\n\t\n\tbool Rectangle::operator!=(const Rectangle& other) const\n\t{\n\t\treturn !(*this == other);\n\t}\n\t\n}\n\n<|endoftext|>"} {"text":"<commit_before>#include \"scanner.h\"\n\nnamespace flora {\n\n\/\/ Public Methods\n\nScanner::Scanner() {\n \/\/ TODO\n}\n\nvoid Scanner::Initialize() {\n UNIMPLEMENTED();\n}\n\nToken Scanner::Advance() {\n switch (state_) {\n case Scanner::State::Uninitialized:\n ReportScannerError(\"the scanner is uninitialized\");\n return Token::Illegal;\n\n case Scanner::State::Running:\n return Scan();\n\n case Scanner::State::Recording: {\n Token token = Scan();\n records_.push(std::make_pair(token, literal_));\n return token;\n }\n\n case Scanner::State::Restoring: {\n \/\/ Sequeeze the first recorded token\n std::pair<Token, std::string> &token = records_.front();\n records_.pop();\n \/\/ Check if no more recorded tokens\n if (records_.empty())\n state_ = Scanner::State::Running;\n SetTokenLiteral(token.second);\n return token.first;\n }\n\n case Scanner::State::End:\n return Token::EndOfSource;\n\n case Scanner::State::Error:\n return Token::Illegal;\n }\n UNREACHABLE();\n}\n\nvoid Scanner::SaveBookmark() {\n \/\/ Clean the recording queue\n while (!records_.empty())\n records_.pop();\n \/\/ Set state to recording\n state_ = Scanner::State::Recording;\n}\n\nvoid Scanner::LoadBookmark() {\n \/\/ Set state to restoring\n state_ = Scanner::State::Restoring;\n}\n\nvoid Scanner::ClearBookmark() {\n \/\/ Clean the recording queue\n while (!records_.empty())\n records_.pop();\n \/\/ Set state to running\n state_ = Scanner::State::Running;\n}\n\n\n\/\/ Private methods\n\nchar Scanner::Next() {\n \/\/ TODO\n}\n\nbool Scanner::Match(char expected) {\n \/\/ TODO\n}\n\nvoid Scanner::SetTokenLiteral(const char *literal) {\n literal_.assign(literal);\n}\n\nvoid Scanner::SetTokenLiteral(std::string &literal) {\n literal_ = std::move(literal);\n}\n\nvoid Scanner::SetTokenLiteral(char literal) {\n literal_.clear();\n literal_.push_back(literal);\n}\n\n\nvoid Scanner::ClearTokenLiteral() {\n literal_.clear();\n}\n\nvoid Scanner::ReportScannerError(const char *message) {\n state_ = Scanner::State::Error;\n SetTokenLiteral(message);\n}\n\nvoid Scanner::MarkEndOfSource() {\n state_ = Scanner::State::End;\n}\n\n\nToken Scanner::Scan() {\n ClearTokenLiteral();\n char ch;\n while (true) {\n switch (ch = Next()) {\n case character::EOS:\n MarkEndOfSource();\n return Token::EndOfSource;\n case '\\n':\n case ' ':\n case '\\t':\n continue;\n case '(': return Token::LeftParenthesis;\n case ')': return Token::RightParenthesis;\n case '[': return Token::LeftBracket;\n case ']': return Token::RightBracket;\n case '{': return Token::LeftBrace;\n case '}': return Token::RightBrace;\n case ':': return Token::Colon;\n case ';': return Token::Semicolon;\n case '~': return Token::BitwiseNot;\n case '?': return Token::Conditional;\n case ',': return Token::Comma;\n case '.': \/\/ . ...\n if (Match('.')) {\n if (Match('.')) {\n return Token::Ellipsis;\n } else {\n ReportScannerError(\"illegal token\");\n return Token::Illegal;\n }\n }\n return Token::Period;\n case '&': \/\/ & && &=\n if (Match('&')) {\n return Token::LogicalAnd;\n } else if (Match('=')) {\n return Token::AssignmentBitwiseAnd;\n } else {\n return Token::BitwiseAnd;\n }\n case '|': \/\/ | || |=\n if (Match('|')) {\n return Token::LogicalOr;\n } else if (Match('=')) {\n return Token::AssignmentBitwiseOr;\n } else {\n return Token::BitwiseOr;\n }\n case '^': \/\/ ^ ^=\n return Match('=') ? Token::AssignmentBitwiseXor : Token::BitwiseXor;\n case '<': \/\/ < << <= <<=\n if (Match('<')) {\n return Match('=') ? Token::AssignmentShiftLeft : Token::ShiftLeft;\n } else if (Match('=')) {\n return Token::LessThanOrEqual;\n } else {\n return Token::LessThan;\n }\n case '>': \/\/ > >> >= >>=\n if (Match('>')) {\n return Match('=') ? Token::AssignmentShiftRight : Token::ShiftRight;\n } else if (Match('=')) {\n return Token::GreaterThanOrEqual;\n } else {\n return Token::GreaterThan;\n }\n case '!': \/\/ ! !=\n return Match('=') ? Token::NotEqual : Token::LogicalNot;\n case '=': \/\/ = == =>\n if (Match('>')) {\n return Token::Arrow;\n } else if (Match('=')) {\n return Token::Equal;\n } else {\n return Token::Assignment;\n }\n case '+': \/\/ + ++ +=\n if (Match('+')) {\n return Token::Increment;\n } else if (Match('=')) {\n return Token::AssignmentAddition;\n } else {\n return Token::Addition;\n }\n case '-': \/\/ - -- -=\n if (Match('-')) {\n return Token::Decrement;\n } else if (Match('=')) {\n return Token::AssignmentSubtraction;\n } else {\n return Token::Subtraction;\n }\n case '*': \/\/ * *=\n return Match('=') ? Token::AssignmentMultiplication:Token::Multiplication;\n case '\/': \/\/ \/ \/= \/* multiple line comment *\/ \/\/ single line comment\n if (Match('=')) {\n return Token::AssignmentDivision;\n } else if (Match('*')) {\n SkipMultipleLineComment();\n } else if (Match('\/')) {\n SkipSingleLineComment();\n } else {\n return Token::Division;\n }\n continue;\n case '%': \/\/ % %=\n return Match('=') ? Token::AssignmentModulus : Token::Modulus;\n case '\"': \/\/ string literal\n return ScanStringLiteral();\n case '\\'': \/\/ character literal\n return ScanCharacterLiteral();\n default:\n if (character::IsIdentifierStart(ch)) {\n return ScanIdentifierOrKeyword(ch);\n } else if (character::IsDecimalDigit(ch)) {\n return ScanIntegerOrRealNumber(ch);\n } else {\n ReportScannerError(\"unknown token\");\n return Token::Illegal;\n }\n }\n }\n}\n\nbool Scanner::SkipMultipleLineComment() {\n int cascade = 1;\n char ch;\n while (true) {\n ch = Next();\n if (ch == '\/') {\n if (peek == '*') {\n Next();\n cascade++;\n }\n } else if (ch == '*') {\n if (peek == '\/') {\n Next();\n cascade--;\n if (cascade == 0) break;\n }\n } else if (ch == character::EOS) {\n ReportScannerError(\"unexpected end of source in multiple line comment\");\n return false;\n }\n }\n return true;\n}\n\nvoid Scanner::SkipSingleLineComment() {\n while (!character::IsLineFeed(peek) && peek != character::EOS)\n Next();\n}\n\nToken Scanner::ScanStringLiteral() {\n std::string literal;\n char ch;\n while (true) {\n ch = Next();\n if (ch == character::EOS) {\n ReportScannerError(\"unexpected EOF in string literal\");\n return Token::Illegal;\n } else if (ch == '\\\\') {\n literal.push_back(ScanStringEscape());\n } else if (ch == '\"') {\n break;\n } else {\n literal.push_back(ch);\n }\n }\n SetTokenLiteral(literal);\n return Token::String;\n}\n\nToken Scanner::ScanCharacterLiteral() {\n char literal = Next();\n if (literal == character::EOS) {\n ReportScannerError(\"unexpected EOF in character literal\");\n return Token::Illegal;\n } else if (literal == '\\\\') {\n literal = ScanCharacterEscape();\n }\n \/\/ to ensure that there is only one character in literal\n if (Next() != '\\'') {\n ReportScannerError(\"too more character in literal\");\n return Token::Illegal;\n }\n SetTokenLiteral(literal);\n return Token::Character;\n}\n\nToken Scanner::ScanIdentifierOrKeyword(char firstChar) {\n std::string identifier;\n identifier.push_back(firstChar);\n\n while (character::IsIdentifierBody(peek)) {\n identifier.push_back(Next());\n }\n Token token = Tokens::LookupKeyword(identifier);\n if (token != Token::Identifier) SetTokenLiteral(identifier);\n return token;\n}\n\nToken Scanner::ScanIntegerOrRealNumber(char firstChar) {\n \/\/ There are 4 kinds of integer:\n \/\/ (1) Hexidecimal integer\n \/\/ (2) Decimal integer\n \/\/ (3) Octal integer\n \/\/ (4) Binary integer\n \/\/ (1), (3) and (4) has a prefix, so we can easily dintinguish them\n std::string num;\n if (firstChar == '0') {\n if (peek == 'x') {\n Next();\n return ScanHexInteger();\n } else if (peek == 'o') {\n Next();\n return ScanOctalInteger();\n } else if (peek == 'b') {\n Next();\n return ScanBinaryInteger();\n }\n }\n num.push_back(firstChar);\n \/\/ Scan the integral part\n while (IsDecimalDigit(peek)) {\n num.push_back(firstChar);\n }\n \/\/ Real number\n if (peek == '.' || AsciiToLowerCase(peek) == 'e') {\n return ScanRealNumber(&num);\n }\n \/\/ Integer\n SetTokenLiteral(num);\n return Token::Integer;\n}\n\nToken Scanner::ScanRealNumber(const std::string *integral_part,\n bool scanned_period) {\n std::string num;\n if (integral_part) {\n num = *integral_part;\n } else {\n num.push_back('0');\n }\n \/\/ Fraction part\n if (Match('.')) {\n while (IsDecimalDigit(peek)) {\n num.push_back(firstChar);\n }\n }\n \/\/ Exponent part\n if (peek == 'E' || peek == 'e') {\n num.push_back(Next());\n if (peek == '+' || peek == '-')\n num.push_back(Next());\n \/\/ An error circumstance: 1.234E\n if (!IsDecimalDigit(peek)) {\n ReportScannerError(\"unexpected end of source in real number literal\");\n return Token::Illegal();\n }\n while (IsDecimalDigit(peek)) {\n num.push_back(firstChar);\n }\n }\n SetTokenLiteral(num);\n return Token::RealNumber;\n}\n\n#define SCAN_INTEGER(base, ch, checker)\\\n Token Scanner::Scan##base##Integer() {\\\n std::string num;\\\n num.push_back(ch);\\\n if (!checker(peek)) {\\\n ReportScannerError(\"unexpected end of source in integer literal\");\\\n return Token::Illegal();\\\n }\\\n while (checker(peek))\\\n num.push_back(Next());\\\n SetTokenLiteral(num);\\\n return Token::Integer;\\\n }\n\nSCAN_INTEGER(Hex, 'x', IsHexDigit)\nSCAN_INTEGER(Octal, 'o', IsOctalDigit)\nSCAN_INTEGER(Binary, 'b', IsBinaryDigit)\n\n}<commit_msg>Fixed syntax errors.<commit_after>#include \"scanner.h\"\n\nnamespace flora {\n\n\/\/ Public Methods\n\nScanner::Scanner() {\n \/\/ TODO\n}\n\nvoid Scanner::Initialize() {\n UNIMPLEMENTED();\n}\n\nToken Scanner::Advance() {\n switch (state_) {\n case Scanner::State::Uninitialized:\n ReportScannerError(\"the scanner is uninitialized\");\n return Token::Illegal;\n\n case Scanner::State::Running:\n return Scan();\n\n case Scanner::State::Recording: {\n Token token = Scan();\n records_.push(std::make_pair(token, literal_));\n return token;\n }\n\n case Scanner::State::Restoring: {\n \/\/ Sequeeze the first recorded token\n std::pair<Token, std::string> &token = records_.front();\n records_.pop();\n \/\/ Check if no more recorded tokens\n if (records_.empty())\n state_ = Scanner::State::Running;\n SetTokenLiteral(token.second);\n return token.first;\n }\n\n case Scanner::State::End:\n return Token::EndOfSource;\n\n case Scanner::State::Error:\n return Token::Illegal;\n }\n UNREACHABLE();\n}\n\nvoid Scanner::SaveBookmark() {\n \/\/ Clean the recording queue\n while (!records_.empty())\n records_.pop();\n \/\/ Set state to recording\n state_ = Scanner::State::Recording;\n}\n\nvoid Scanner::LoadBookmark() {\n \/\/ Set state to restoring\n state_ = Scanner::State::Restoring;\n}\n\nvoid Scanner::ClearBookmark() {\n \/\/ Clean the recording queue\n while (!records_.empty())\n records_.pop();\n \/\/ Set state to running\n state_ = Scanner::State::Running;\n}\n\n\n\/\/ Private methods\n\nchar Scanner::Next() {\n \/\/ TODO\n UNIMPLEMENTED();\n}\n\nbool Scanner::Match(char expected) {\n \/\/ TODO\n UNIMPLEMENTED();\n}\n\nvoid Scanner::SetTokenLiteral(const char *literal) {\n literal_.assign(literal);\n}\n\nvoid Scanner::SetTokenLiteral(std::string &literal) {\n literal_ = std::move(literal);\n}\n\nvoid Scanner::SetTokenLiteral(char literal) {\n literal_.clear();\n literal_.push_back(literal);\n}\n\n\nvoid Scanner::ClearTokenLiteral() {\n literal_.clear();\n}\n\nvoid Scanner::ReportScannerError(const char *message) {\n state_ = Scanner::State::Error;\n SetTokenLiteral(message);\n}\n\nvoid Scanner::MarkEndOfSource() {\n state_ = Scanner::State::End;\n}\n\n\nToken Scanner::Scan() {\n ClearTokenLiteral();\n char ch;\n while (true) {\n switch (ch = Next()) {\n case character::EOS:\n MarkEndOfSource();\n return Token::EndOfSource;\n case '\\n':\n case ' ':\n case '\\t':\n continue;\n case '(': return Token::LeftParenthesis;\n case ')': return Token::RightParenthesis;\n case '[': return Token::LeftBracket;\n case ']': return Token::RightBracket;\n case '{': return Token::LeftBrace;\n case '}': return Token::RightBrace;\n case ':': return Token::Colon;\n case ';': return Token::Semicolon;\n case '~': return Token::BitwiseNot;\n case '?': return Token::Conditional;\n case ',': return Token::Comma;\n case '.': \/\/ . ...\n if (Match('.')) {\n if (Match('.')) {\n return Token::Ellipsis;\n } else {\n ReportScannerError(\"illegal token\");\n return Token::Illegal;\n }\n }\n return Token::Period;\n case '&': \/\/ & && &=\n if (Match('&')) {\n return Token::LogicalAnd;\n } else if (Match('=')) {\n return Token::AssignmentBitwiseAnd;\n } else {\n return Token::BitwiseAnd;\n }\n case '|': \/\/ | || |=\n if (Match('|')) {\n return Token::LogicalOr;\n } else if (Match('=')) {\n return Token::AssignmentBitwiseOr;\n } else {\n return Token::BitwiseOr;\n }\n case '^': \/\/ ^ ^=\n return Match('=') ? Token::AssignmentBitwiseXor : Token::BitwiseXor;\n case '<': \/\/ < << <= <<=\n if (Match('<')) {\n return Match('=') ? Token::AssignmentShiftLeft : Token::ShiftLeft;\n } else if (Match('=')) {\n return Token::LessThanOrEqual;\n } else {\n return Token::LessThan;\n }\n case '>': \/\/ > >> >= >>=\n if (Match('>')) {\n return Match('=') ? Token::AssignmentShiftRight : Token::ShiftRight;\n } else if (Match('=')) {\n return Token::GreaterThanOrEqual;\n } else {\n return Token::GreaterThan;\n }\n case '!': \/\/ ! !=\n return Match('=') ? Token::NotEqual : Token::LogicalNot;\n case '=': \/\/ = == =>\n if (Match('>')) {\n return Token::Arrow;\n } else if (Match('=')) {\n return Token::Equal;\n } else {\n return Token::Assignment;\n }\n case '+': \/\/ + ++ +=\n if (Match('+')) {\n return Token::Increment;\n } else if (Match('=')) {\n return Token::AssignmentAddition;\n } else {\n return Token::Addition;\n }\n case '-': \/\/ - -- -=\n if (Match('-')) {\n return Token::Decrement;\n } else if (Match('=')) {\n return Token::AssignmentSubtraction;\n } else {\n return Token::Subtraction;\n }\n case '*': \/\/ * *=\n return Match('=') ? Token::AssignmentMultiplication:Token::Multiplication;\n case '\/': \/\/ \/ \/= \/* multiple line comment *\/ \/\/ single line comment\n if (Match('=')) {\n return Token::AssignmentDivision;\n } else if (Match('*')) {\n SkipMultipleLineComment();\n } else if (Match('\/')) {\n SkipSingleLineComment();\n } else {\n return Token::Division;\n }\n continue;\n case '%': \/\/ % %=\n return Match('=') ? Token::AssignmentModulus : Token::Modulus;\n case '\"': \/\/ string literal\n return ScanStringLiteral();\n case '\\'': \/\/ character literal\n return ScanCharacterLiteral();\n default:\n if (character::IsIdentifierStart(ch)) {\n return ScanIdentifierOrKeyword(ch);\n } else if (character::IsDecimalDigit(ch)) {\n return ScanIntegerOrRealNumber(ch);\n } else {\n ReportScannerError(\"unknown token\");\n return Token::Illegal;\n }\n }\n }\n}\n\nbool Scanner::SkipMultipleLineComment() {\n int cascade = 1;\n char ch;\n while (true) {\n ch = Next();\n if (ch == '\/') {\n if (peek == '*') {\n Next();\n cascade++;\n }\n } else if (ch == '*') {\n if (peek == '\/') {\n Next();\n cascade--;\n if (cascade == 0) break;\n }\n } else if (ch == character::EOS) {\n ReportScannerError(\"unexpected end of source in multiple line comment\");\n return false;\n }\n }\n return true;\n}\n\nvoid Scanner::SkipSingleLineComment() {\n while (!character::IsLineFeed(peek) && peek != character::EOS)\n Next();\n}\n\nToken Scanner::ScanStringLiteral() {\n std::string literal;\n char ch;\n while (true) {\n ch = Next();\n if (ch == character::EOS) {\n ReportScannerError(\"unexpected EOF in string literal\");\n return Token::Illegal;\n } else if (ch == '\\\\') {\n literal.push_back(ScanStringEscape());\n } else if (ch == '\"') {\n break;\n } else {\n literal.push_back(ch);\n }\n }\n SetTokenLiteral(literal);\n return Token::String;\n}\n\nToken Scanner::ScanCharacterLiteral() {\n char literal = Next();\n if (literal == character::EOS) {\n ReportScannerError(\"unexpected EOF in character literal\");\n return Token::Illegal;\n } else if (literal == '\\\\') {\n literal = ScanCharacterEscape();\n }\n \/\/ to ensure that there is only one character in literal\n if (Next() != '\\'') {\n ReportScannerError(\"too more character in literal\");\n return Token::Illegal;\n }\n SetTokenLiteral(literal);\n return Token::Character;\n}\n\nToken Scanner::ScanIdentifierOrKeyword(char firstChar) {\n std::string identifier;\n identifier.push_back(firstChar);\n\n while (character::IsIdentifierBody(peek)) {\n identifier.push_back(Next());\n }\n Token token = Tokens::LookupKeyword(identifier);\n if (token != Token::Identifier) SetTokenLiteral(identifier);\n return token;\n}\n\nToken Scanner::ScanIntegerOrRealNumber(char firstChar) {\n \/\/ There are 4 kinds of integer:\n \/\/ (1) Hexidecimal integer\n \/\/ (2) Decimal integer\n \/\/ (3) Octal integer\n \/\/ (4) Binary integer\n \/\/ (1), (3) and (4) has a prefix, so we can easily dintinguish them\n std::string num;\n if (firstChar == '0') {\n if (peek == 'x') {\n Next();\n return ScanHexInteger();\n } else if (peek == 'o') {\n Next();\n return ScanOctalInteger();\n } else if (peek == 'b') {\n Next();\n return ScanBinaryInteger();\n }\n }\n num.push_back(firstChar);\n \/\/ Scan the integral part\n while (character::IsDecimalDigit(peek)) {\n num.push_back(firstChar);\n }\n \/\/ Real number\n if (peek == '.' || character::AsciiToLowerCase(peek) == 'e') {\n return ScanRealNumber(&num);\n }\n \/\/ Integer\n SetTokenLiteral(num);\n return Token::Integer;\n}\n\nToken Scanner::ScanRealNumber(const std::string *integral_part,\n bool scanned_period) {\n std::string num;\n if (integral_part) {\n num = *integral_part;\n } else {\n num.push_back('0');\n }\n \/\/ Fraction part\n if (Match('.')) {\n while (character::IsDecimalDigit(peek)) {\n num.push_back(Next());\n }\n }\n \/\/ Exponent part\n if (peek == 'E' || peek == 'e') {\n num.push_back(Next());\n if (peek == '+' || peek == '-')\n num.push_back(Next());\n \/\/ An error circumstance: 1.234E\n if (!character::IsDecimalDigit(peek)) {\n ReportScannerError(\"unexpected end of source in real number literal\");\n return Token::Illegal;\n }\n while (character::IsDecimalDigit(peek)) {\n num.push_back(Next());\n }\n }\n SetTokenLiteral(num);\n return Token::RealNumber;\n}\n\n#define SCAN_INTEGER(base, ch, checker)\\\n Token Scanner::Scan##base##Integer() {\\\n std::string num;\\\n num.push_back(ch);\\\n if (!checker(peek)) {\\\n ReportScannerError(\"unexpected end of source in integer literal\");\\\n return Token::Illegal;\\\n }\\\n while (checker(peek))\\\n num.push_back(Next());\\\n SetTokenLiteral(num);\\\n return Token::Integer;\\\n }\n\nSCAN_INTEGER(Hex, 'x', character::IsHexDigit)\nSCAN_INTEGER(Octal, 'o', character::IsOctalDigit)\nSCAN_INTEGER(Binary, 'b', character::IsBinaryDigit)\n\n}<|endoftext|>"} {"text":"<commit_before>\/* ux++ - ux implementation for C++ *\/\n\n\/* LICENSE - The MIT License (MIT)\n\nCopyright (c) 2013 Tomona Nanase\n\nPermission is hereby granted, free of charge, to any person obtaining a copy of\nthis software and associated documentation files (the \"Software\"), to deal in\nthe Software without restriction, including without limitation the rights to\nuse, copy, modify, merge, publish, distribute, sublicense, and\/or sell copies of\nthe Software, and to permit persons to whom the Software is furnished to do so,\nsubject to the following conditions:\n\nThe above copyright notice and this permission notice shall be included in all\ncopies or substantial portions of the Software.\n\nTHE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\nIMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS\nFOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR\nCOPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER\nIN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN\nCONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.\n *\/\n\n#include <cfloat>\n#include <cassert>\n#include \"common.hpp\"\n#include \"Envelope.hpp\"\n\nnamespace uxpp {\n\n \/\/ <editor-fold desc=\"-- Construnctors --\">\n\n Envelope::Envelope(float samplingRate) : samplingRate(samplingRate) {\n assert(samplingRate > 0.0f);\n \n this->reset();\n }\n \/\/ <\/editor-fold>\n\n \/\/ <editor-fold desc=\"-- Methods --\">\n\n EnvelopeState::values Envelope::getState() const {\n return this->state;\n }\n\n void Envelope::reset() {\n this->attackTime = (int) (0.05f * this->samplingRate);\n this->peakTime = (int) (0.0f * this->samplingRate);\n this->decayTime = (int) (0.0f * this->samplingRate);\n this->sustainLevel = 1.0f;\n this->releaseTime = (int) (0.05f * this->samplingRate);\n this->state = EnvelopeState::silence;\n }\n\n void Envelope::attack() {\n this->state = EnvelopeState::attack;\n\n \/\/ precalc\n this->t2 = this->attackTime + this->peakTime;\n this->t3 = this->t2 + this->decayTime;\n this->da = 1.0f \/ this->attackTime;\n this->dd = (1.0f - this->sustainLevel) \/ this->decayTime;\n }\n\n void Envelope::relase(int32_t time) {\n assert(time >= 0);\n \n if (this->state == EnvelopeState::attack) {\n this->state = EnvelopeState::release;\n this->releaseStartTime = time;\n\n \/\/ precalc\n this->t5 = time + this->releaseTime;\n this->dr = this->sustainLevel \/ this->releaseTime;\n }\n }\n\n void Envelope::silence() {\n this->state = EnvelopeState::silence;\n }\n\n void Envelope::generate(int32_t time, float envelopes[], int32_t count) {\n assert(time >= 0);\n assert(count > 0); \n assert(envelopes != nullptr); \n \n float res;\n for (int i = 0; i < count; i++, time++) {\n if (this->state == EnvelopeState::attack) {\n res = (time < this->attackTime) ? time * this->da :\n (time < this->t2) ? 1.0f :\n (time < this->t3) ? 1.0f - (time - this->t2) * this->dd :\n this->sustainLevel;\n } else if (this->state == EnvelopeState::release) {\n if (time < this->t5)\n res = this->sustainLevel - (time - this->releaseStartTime) * this->dr;\n else {\n res = 0.0f;\n this->state = EnvelopeState::silence;\n }\n } else\n res = 0.0f;\n\n envelopes[i] = res;\n }\n }\n\n void Envelope::setParameter(int32_t data1, float data2) {\n switch ((EnvelopeOperate::values) data1) {\n case EnvelopeOperate::attack:\n assert(data2 >= 0.0f);\n this->attackTime =\n (int) (clamp(data2, FLT_MAX, 0.0f) * this->samplingRate);\n break;\n\n case EnvelopeOperate::peak:\n assert(data2 >= 0.0f);\n this->peakTime =\n (int) (clamp(data2, FLT_MAX, 0.0f) * this->samplingRate);\n break;\n\n case EnvelopeOperate::decay:\n assert(data2 >= 0.0f);\n this->decayTime =\n (int) (clamp(data2, FLT_MAX, 0.0f) * this->samplingRate);\n break;\n\n case EnvelopeOperate::sustain:\n assert(data2 >= 0.0f && data2 <= 1.0f);\n this->sustainLevel = clamp(data2, 1.0f, 0.0f);\n break;\n\n case EnvelopeOperate::release:\n assert(data2 >= 0.0f);\n this->releaseTime =\n (int) (clamp(data2, FLT_MAX, 0.0f) * this->samplingRate);\n break;\n\n default:\n break;\n }\n }\n \/\/ <\/editor-fold>\n}<commit_msg>Envelope::createConstant関数を実装<commit_after>\/* ux++ - ux implementation for C++ *\/\n\n\/* LICENSE - The MIT License (MIT)\n\nCopyright (c) 2013 Tomona Nanase\n\nPermission is hereby granted, free of charge, to any person obtaining a copy of\nthis software and associated documentation files (the \"Software\"), to deal in\nthe Software without restriction, including without limitation the rights to\nuse, copy, modify, merge, publish, distribute, sublicense, and\/or sell copies of\nthe Software, and to permit persons to whom the Software is furnished to do so,\nsubject to the following conditions:\n\nThe above copyright notice and this permission notice shall be included in all\ncopies or substantial portions of the Software.\n\nTHE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\nIMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS\nFOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR\nCOPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER\nIN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN\nCONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.\n *\/\n\n#include <cfloat>\n#include <cassert>\n#include \"common.hpp\"\n#include \"Envelope.hpp\"\n\nnamespace uxpp {\n\n \/\/ <editor-fold desc=\"-- Construnctors --\">\n\n Envelope::Envelope(float samplingRate) : samplingRate(samplingRate) {\n assert(samplingRate > 0.0f);\n\n this->reset();\n }\n \/\/ <\/editor-fold>\n\n \/\/ <editor-fold desc=\"-- Methods --\">\n\n EnvelopeState::values Envelope::getState() const {\n return this->state;\n }\n\n void Envelope::reset() {\n this->attackTime = (int) (0.05f * this->samplingRate);\n this->peakTime = (int) (0.0f * this->samplingRate);\n this->decayTime = (int) (0.0f * this->samplingRate);\n this->sustainLevel = 1.0f;\n this->releaseTime = (int) (0.05f * this->samplingRate);\n this->state = EnvelopeState::silence;\n }\n\n void Envelope::attack() {\n this->state = EnvelopeState::attack;\n\n \/\/ precalc\n this->t2 = this->attackTime + this->peakTime;\n this->t3 = this->t2 + this->decayTime;\n this->da = 1.0f \/ this->attackTime;\n this->dd = (1.0f - this->sustainLevel) \/ this->decayTime;\n }\n\n void Envelope::relase(int32_t time) {\n assert(time >= 0);\n\n if (this->state == EnvelopeState::attack) {\n this->state = EnvelopeState::release;\n this->releaseStartTime = time;\n\n \/\/ precalc\n this->t5 = time + this->releaseTime;\n this->dr = this->sustainLevel \/ this->releaseTime;\n }\n }\n\n void Envelope::silence() {\n this->state = EnvelopeState::silence;\n }\n\n void Envelope::generate(int32_t time, float envelopes[], int32_t count) {\n assert(time >= 0);\n assert(count > 0);\n assert(envelopes != nullptr);\n\n float res;\n for (int i = 0; i < count; i++, time++) {\n if (this->state == EnvelopeState::attack) {\n res = (time < this->attackTime) ? time * this->da :\n (time < this->t2) ? 1.0f :\n (time < this->t3) ? 1.0f - (time - this->t2) * this->dd :\n this->sustainLevel;\n } else if (this->state == EnvelopeState::release) {\n if (time < this->t5)\n res = this->sustainLevel - (time - this->releaseStartTime) * this->dr;\n else {\n res = 0.0f;\n this->state = EnvelopeState::silence;\n }\n } else\n res = 0.0f;\n\n envelopes[i] = res;\n }\n }\n\n void Envelope::setParameter(int32_t data1, float data2) {\n switch ((EnvelopeOperate::values) data1) {\n case EnvelopeOperate::attack:\n assert(data2 >= 0.0f);\n this->attackTime =\n (int) (clamp(data2, FLT_MAX, 0.0f) * this->samplingRate);\n break;\n\n case EnvelopeOperate::peak:\n assert(data2 >= 0.0f);\n this->peakTime =\n (int) (clamp(data2, FLT_MAX, 0.0f) * this->samplingRate);\n break;\n\n case EnvelopeOperate::decay:\n assert(data2 >= 0.0f);\n this->decayTime =\n (int) (clamp(data2, FLT_MAX, 0.0f) * this->samplingRate);\n break;\n\n case EnvelopeOperate::sustain:\n assert(data2 >= 0.0f && data2 <= 1.0f);\n this->sustainLevel = clamp(data2, 1.0f, 0.0f);\n break;\n\n case EnvelopeOperate::release:\n assert(data2 >= 0.0f);\n this->releaseTime =\n (int) (clamp(data2, FLT_MAX, 0.0f) * this->samplingRate);\n break;\n\n default:\n break;\n }\n }\n \/\/ <\/editor-fold>\n\n \/\/ <editor-fold desc=\"-- Static Methods --\">\n\n void Envelope::createConstant(Envelope& envelope) {\n envelope.reset();\n envelope.attackTime = 0;\n envelope.peakTime = 0;\n envelope.decayTime = 0;\n envelope.sustainLevel = 1.0f;\n envelope.releaseTime = 0;\n }\n\n Envelope* Envelope::createConstant(float samplingRate) {\n Envelope* envelope = new Envelope(samplingRate);\n envelope->attackTime = 0;\n envelope->peakTime = 0;\n envelope->decayTime = 0;\n envelope->sustainLevel = 1.0f;\n envelope->releaseTime = 0;\n\n return envelope;\n }\n \/\/ <\/editor-fold>\n}<|endoftext|>"} {"text":"<commit_before>#ifndef DUNE_STUFF_FUNCTION_EXPRESSION_HH\n#define DUNE_STUFF_FUNCTION_EXPRESSION_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\n#ifdef HAVE_DUNE_FEM\n #include <dune\/fem\/function\/common\/function.hh>\n #include <dune\/fem\/space\/common\/functionspace.hh>\n#endif \/\/ HAVE_DUNE_FEM\n\n#include <dune\/stuff\/common\/parameter\/tree.hh>\n#include <dune\/stuff\/common\/string.hh>\n\n#include \"expression\/mathexpr.hh\"\n#include \"interface.hh\"\n\nnamespace Dune {\nnamespace Stuff {\nnamespace Function {\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\nexpression.0: 2*x[0]\nexpression.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 **\/\ntemplate< class DomainFieldImp, int maxDimDomain, class RangeFieldImp, int maxDimRange >\nclass Expression\n : public Interface< DomainFieldImp, maxDimDomain, RangeFieldImp, maxDimRange >\n{\npublic:\n typedef DomainFieldImp DomainFieldType;\n\n typedef RangeFieldImp RangeFieldType;\n\n typedef Interface< DomainFieldImp, maxDimDomain, RangeFieldImp, maxDimRange > BaseType;\n\n typedef Expression< DomainFieldImp, maxDimDomain, RangeFieldImp, maxDimRange > ThisType;\n\n Expression(const std::string _variable, const std::string _expression)\n {\n const std::vector< std::string > expressions(1, _expression);\n setup(_variable, expressions);\n } \/\/ Expression(const std::string variable, const std::string expression)\n\n Expression(const std::string _variable, const std::vector< std::string > _expressions)\n {\n setup(_variable, _expressions);\n } \/\/ Expression(const std::string variable, const std::vector< std::string >& expressions)\n\n Expression(const ThisType& other)\n {\n setup(other.variable(), other.expression());\n } \/\/ Expression(const ThisType& other)\n\n static ThisType createFromParamTree(const Dune::ParameterTree& paramTree)\n {\n const Dune::Stuff::Common::ExtendedParameterTree extendedParamtree(paramTree);\n \/\/ get variable\n const std::string variable = extendedParamtree.get< std::string >(\"variable\");\n \/\/ get expressions\n const std::vector< std::string > expressions = extendedParamtree.getVector< std::string >(\"expression\", 1);\n \/\/ create and return\n return ThisType(variable, expressions);\n } \/\/ static ThisType createFromParamTree(const Stuff::Common::ExtendedParameterTree& paramTree)\n\n ThisType& operator=(const ThisType& other)\n {\n if (this != &other) {\n cleanup();\n setup(other.variable(), other.expression());\n }\n return this;\n } \/\/ ThisType& operator=(const ThisType& other)\n\n ~Expression()\n {\n cleanup();\n } \/\/ ~Expression()\n\n void report(const std::string name = \"stuff.function.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\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 unsigned int dimRange() const\n {\n return std::min(int(actualDimRange_), maxDimRange);\n }\n\n \/\/! needed for Interface\n virtual void evaluate(const Dune::FieldVector< DomainFieldImp, maxDimDomain >& arg, Dune::FieldVector< RangeFieldImp, maxDimRange >& ret) const\n {\n \/\/ ensure right dimensions\n assert(arg.size() <= maxDimDomain);\n assert(ret.size() <= dimRange());\n \/\/ arg\n for (typename Dune::FieldVector< DomainFieldImp, maxDimDomain >::size_type i = 0; i < arg.size(); ++i) {\n *(arg_[i]) = arg[i];\n }\n \/\/ ret\n for (typename Dune::FieldVector< RangeFieldImp, maxDimRange >::size_type i = 0; i < ret.size(); ++i) {\n ret[i] = op_[i]->Val();\n }\n }\n\n template< class DomainVectorType, class RangeVectorType >\n void evaluate(const Dune::DenseVector< DomainVectorType >& arg, Dune::DenseVector< RangeVectorType >& ret) const\n {\n \/\/ ensure right dimensions\n assert(arg.size() <= maxDimDomain);\n assert(ret.size() <= dimRange());\n \/\/ arg\n for (typename Dune::DenseVector< DomainVectorType >::size_type i = 0; i < arg.size(); ++i) {\n *(arg_[i]) = arg[i];\n }\n \/\/ ret\n for (typename Dune::DenseVector< RangeVectorType >::size_type i = 0; i < ret.size(); ++i) {\n ret[i] = op_[i]->Val();\n }\n }\n\n#ifdef HAVE_EIGEN\n \/**\n * \\attention ret is resized to size dimRange()!\n *\/\n void evaluate(const Eigen::VectorXd& arg, Eigen::VectorXd& ret) const\n {\n \/\/ ensure right dimensions\n assert(arg.size() <= maxDimDomain);\n ret.resize(dimRange());\n \/\/ arg\n for (int i = 0; i < arg.size(); ++ i) {\n *(arg_[i]) = arg(i);\n }\n \/\/ ret\n for (int i = 0; i < ret.size(); ++ i) {\n ret(i) = op_[i]->Val();\n }\n } \/\/ void evaluate(const Eigen::VectorXd& arg, Eigen::VectorXd& ret) const\n#endif \/\/ HAVE_EIGEN\n\nprivate:\n void setup(const std::string& _variable, const std::vector< std::string >& _expressions)\n {\n assert(maxDimDomain > 0);\n assert(maxDimRange > 0);\n \/\/ set expressions\n if (_expressions.size() < 1)\n DUNE_THROW(Dune::InvalidStateException,\"\\nError: Given 'expressions'-vector is empty!\");\n actualDimRange_ = std::min(int(_expressions.size()), maxDimRange);\n expressions_ = _expressions;\n \/\/ set variable (i.e. \"x\")\n variable_ = _variable;\n \/\/ fill variables (i.e. \"x[0]\", \"x[1]\", ...)\n for (int i = 0; i < maxDimDomain; ++i) {\n std::stringstream variableStream;\n variableStream << variable_ << \"[\" << i << \"]\";\n variables_.push_back(variableStream.str());\n }\n \/\/ create epressions\n for (unsigned int i = 0; i < maxDimDomain; ++i) {\n arg_[i] = new DomainFieldType(0.0);\n var_arg_[i] = new RVar(variables_[i].c_str(), arg_[i]);\n vararray_[i] = var_arg_[i];\n }\n for (unsigned int i = 0; i < dimRange(); ++ i) {\n op_[i] = new ROperation(expressions_[i].c_str(), maxDimDomain, vararray_);\n }\n } \/\/ void setup(const std::string& variable, const std::vector< std::string >& expressions)\n\n void cleanup()\n {\n for (unsigned int i = 0; i < dimRange(); ++i) {\n delete op_[i];\n }\n for (unsigned int i = 0; i < maxDimDomain; ++i) {\n delete var_arg_[i];\n delete arg_[i];\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_[maxDimDomain];\n RVar* var_arg_[maxDimDomain];\n RVar* vararray_[maxDimDomain];\n ROperation* op_[maxDimRange];\n}; \/\/ class Expression\n\n} \/\/ namespace Function\n} \/\/ namespace Stuff\n} \/\/ namespace Dune\n\n#endif \/\/ DUNE_STUFF_FUNCTION_EXPRESSION_HH\n<commit_msg>[function.expression] added additional evaluate()s<commit_after>#ifndef DUNE_STUFF_FUNCTION_EXPRESSION_HH\n#define DUNE_STUFF_FUNCTION_EXPRESSION_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\n#ifdef HAVE_DUNE_FEM\n #include <dune\/fem\/function\/common\/function.hh>\n #include <dune\/fem\/space\/common\/functionspace.hh>\n#endif \/\/ HAVE_DUNE_FEM\n\n#include <dune\/stuff\/common\/parameter\/tree.hh>\n#include <dune\/stuff\/common\/string.hh>\n\n#include \"expression\/mathexpr.hh\"\n#include \"interface.hh\"\n\nnamespace Dune {\nnamespace Stuff {\nnamespace Function {\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\nexpression.0: 2*x[0]\nexpression.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 **\/\ntemplate< class DomainFieldImp, int maxDimDomain, class RangeFieldImp, int maxDimRange >\nclass Expression\n : public Interface< DomainFieldImp, maxDimDomain, RangeFieldImp, maxDimRange >\n{\npublic:\n typedef DomainFieldImp DomainFieldType;\n\n typedef RangeFieldImp RangeFieldType;\n\n typedef Interface< DomainFieldImp, maxDimDomain, RangeFieldImp, maxDimRange > BaseType;\n\n typedef Expression< DomainFieldImp, maxDimDomain, RangeFieldImp, maxDimRange > ThisType;\n\n Expression(const std::string _variable, const std::string _expression)\n {\n const std::vector< std::string > expressions(1, _expression);\n setup(_variable, expressions);\n } \/\/ Expression(const std::string variable, const std::string expression)\n\n Expression(const std::string _variable, const std::vector< std::string > _expressions)\n {\n setup(_variable, _expressions);\n } \/\/ Expression(const std::string variable, const std::vector< std::string >& expressions)\n\n Expression(const ThisType& other)\n {\n setup(other.variable(), other.expression());\n } \/\/ Expression(const ThisType& other)\n\n static ThisType createFromParamTree(const Dune::ParameterTree& paramTree)\n {\n const Dune::Stuff::Common::ExtendedParameterTree extendedParamtree(paramTree);\n \/\/ get variable\n const std::string variable = extendedParamtree.get< std::string >(\"variable\");\n \/\/ get expressions\n const std::vector< std::string > expressions = extendedParamtree.getVector< std::string >(\"expression\", 1);\n \/\/ create and return\n return ThisType(variable, expressions);\n } \/\/ static ThisType createFromParamTree(const Stuff::Common::ExtendedParameterTree& paramTree)\n\n ThisType& operator=(const ThisType& other)\n {\n if (this != &other) {\n cleanup();\n setup(other.variable(), other.expression());\n }\n return this;\n } \/\/ ThisType& operator=(const ThisType& other)\n\n ~Expression()\n {\n cleanup();\n } \/\/ ~Expression()\n\n void report(const std::string name = \"stuff.function.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\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 unsigned int dimRange() const\n {\n return std::min(int(actualDimRange_), maxDimRange);\n }\n\n \/\/! needed for Interface\n virtual void evaluate(const Dune::FieldVector< DomainFieldImp, maxDimDomain >& arg, Dune::FieldVector< RangeFieldImp, maxDimRange >& ret) const\n {\n \/\/ ensure right dimensions\n assert(arg.size() <= maxDimDomain);\n assert(ret.size() <= dimRange());\n \/\/ arg\n for (typename Dune::FieldVector< DomainFieldImp, maxDimDomain >::size_type i = 0; i < arg.size(); ++i) {\n *(arg_[i]) = arg[i];\n }\n \/\/ ret\n for (typename Dune::FieldVector< RangeFieldImp, maxDimRange >::size_type i = 0; i < ret.size(); ++i) {\n ret[i] = op_[i]->Val();\n }\n }\n\n template< class DomainVectorType, class RangeVectorType >\n void evaluate(const Dune::DenseVector< DomainVectorType >& arg, Dune::DenseVector< RangeVectorType >& ret) const\n {\n \/\/ ensure right dimensions\n assert(arg.size() <= maxDimDomain);\n assert(ret.size() <= dimRange());\n \/\/ arg\n for (typename Dune::DenseVector< DomainVectorType >::size_type i = 0; i < arg.size(); ++i) {\n *(arg_[i]) = arg[i];\n }\n \/\/ ret\n for (typename Dune::DenseVector< RangeVectorType >::size_type i = 0; i < ret.size(); ++i) {\n ret[i] = op_[i]->Val();\n }\n }\n\n#ifdef HAVE_EIGEN\n \/**\n * \\attention ret is resized to size dimRange()!\n *\/\n void evaluate(const Eigen::VectorXd& arg, Eigen::VectorXd& ret) const\n {\n \/\/ ensure right dimensions\n assert(arg.size() <= maxDimDomain);\n ret.resize(dimRange());\n \/\/ arg\n for (int i = 0; i < arg.size(); ++ i) {\n *(arg_[i]) = arg(i);\n }\n \/\/ ret\n for (int i = 0; i < ret.size(); ++ i) {\n ret(i) = op_[i]->Val();\n }\n } \/\/ void evaluate(const Eigen::VectorXd& arg, Eigen::VectorXd& ret) const\n#endif \/\/ HAVE_EIGEN\n\n using BaseType::evaluate;\n\nprivate:\n void setup(const std::string& _variable, const std::vector< std::string >& _expressions)\n {\n assert(maxDimDomain > 0);\n assert(maxDimRange > 0);\n \/\/ set expressions\n if (_expressions.size() < 1)\n DUNE_THROW(Dune::InvalidStateException,\"\\nError: Given 'expressions'-vector is empty!\");\n actualDimRange_ = std::min(int(_expressions.size()), maxDimRange);\n expressions_ = _expressions;\n \/\/ set variable (i.e. \"x\")\n variable_ = _variable;\n \/\/ fill variables (i.e. \"x[0]\", \"x[1]\", ...)\n for (int i = 0; i < maxDimDomain; ++i) {\n std::stringstream variableStream;\n variableStream << variable_ << \"[\" << i << \"]\";\n variables_.push_back(variableStream.str());\n }\n \/\/ create epressions\n for (unsigned int i = 0; i < maxDimDomain; ++i) {\n arg_[i] = new DomainFieldType(0.0);\n var_arg_[i] = new RVar(variables_[i].c_str(), arg_[i]);\n vararray_[i] = var_arg_[i];\n }\n for (unsigned int i = 0; i < dimRange(); ++ i) {\n op_[i] = new ROperation(expressions_[i].c_str(), maxDimDomain, vararray_);\n }\n } \/\/ void setup(const std::string& variable, const std::vector< std::string >& expressions)\n\n void cleanup()\n {\n for (unsigned int i = 0; i < dimRange(); ++i) {\n delete op_[i];\n }\n for (unsigned int i = 0; i < maxDimDomain; ++i) {\n delete var_arg_[i];\n delete arg_[i];\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_[maxDimDomain];\n RVar* var_arg_[maxDimDomain];\n RVar* vararray_[maxDimDomain];\n ROperation* op_[maxDimRange];\n}; \/\/ class Expression\n\n} \/\/ namespace Function\n} \/\/ namespace Stuff\n} \/\/ namespace Dune\n\n#endif \/\/ DUNE_STUFF_FUNCTION_EXPRESSION_HH\n<|endoftext|>"} {"text":"<commit_before>#include \"script.hpp\"\n#include \"filesystem.hpp\"\n#include \"logger.hpp\"\n\nclass LuaScript\n{\npublic:\n LuaScript()\n {\n InitLua();\n }\n\n ~LuaScript()\n {\n HaltLua();\n }\n\n \/\/ call a lua function.\n \/\/ you must specify the quantity of of params and returns.\n int CallLua(std::string func, int num_params, int num_returns)\n {\n \/\/ on error, execute lua function debug.traceback\n \/\/ debug is a table, put it on the stack\n lua_getglobal(mLuaState, \"debug\");\n\n \/\/ -1 is the top of the stack\n lua_getfield(mLuaState, -1, \"traceback\");\n\n \/\/ traceback is on top, remove debug from 2nd spot\n lua_remove(mLuaState, -2);\n\n mErrorHandlerStackIndex = lua_gettop(mLuaState);\n \n \/\/ get the lua function and execute it\n lua_getglobal(mLuaState, func.c_str());\n const int ret = lua_pcall(mLuaState, num_params, num_returns, mErrorHandlerStackIndex);\n if (ret)\n {\n printf(\"\\nLua call failed (%s): %s\\n\",\n ErrorToString(ret).c_str(),\n lua_tostring(mLuaState, -1));\n }\n\n \/\/ remove the error handler from the stack\n lua_pop(mLuaState, 1);\n\n return ret;\n }\n\n bool FunctionExists(std::string func)\n {\n \/\/ try to put the function on top of the stack\n lua_getglobal(mLuaState, func.c_str());\n\n \/\/ check that value on top of stack is not nil\n bool ret = !lua_isnil(mLuaState, -1);\n\n \/\/ get rid of the value we put on the stack\n lua_pop(mLuaState, 1);\n\n return ret;\n }\n\n lua_State* State()\n {\n return mLuaState;\n }\n\nprivate:\n void InitLua()\n {\n mLuaState = luaL_newstate();\n luaL_openlibs(mLuaState);\n\n set_redirected_print();\n lua_register(mLuaState, \"h_echo\", HAPI_echo);\n }\n\n void HaltLua()\n {\n lua_close(mLuaState);\n }\n\n static std::string LuaTypeToString(int index)\n {\n switch (index)\n {\n case LUA_TNIL: return \"nil\";\n case LUA_TNUMBER: return \"number\";\n case LUA_TBOOLEAN: return \"boolean\";\n case LUA_TSTRING: return \"string\";\n case LUA_TTABLE: return \"table\";\n case LUA_TFUNCTION: return \"function\";\n case LUA_TUSERDATA: return \"userdata\";\n case LUA_TTHREAD: return \"thread\";\n case LUA_TLIGHTUSERDATA: return \"light userdata\";\n default: return \"unknown type\";\n }\n }\n\n static std::string ErrorToString(int resultcode)\n {\n switch (resultcode)\n {\n case 0: return \"Success\";\n case LUA_ERRRUN: return \"Runtime error\";\n case LUA_ERRSYNTAX: return \"Syntax error\";\n case LUA_ERRERR: return \"Error with error alert mechanism.\";\n case LUA_ERRFILE: return \"Couldn't open or read file\";\n default: return \"Unknown error: \" + std::to_string(resultcode);\n }\n }\n\n static int script_log(lua_State* L)\n {\n const int nargs = lua_gettop(L);\n for (int i = 1; i <= nargs; ++i)\n {\n if (lua_isstring(L, i))\n {\n LOG_INFO(lua_tostring(L, i));\n }\n else\n {\n LOG_ERROR(\"TODO: Print this type\");\n }\n }\n return 0;\n }\n\n\n \/\/ this is the API function we expose to lua.\n static int HAPI_echo(lua_State* L)\n {\n int args_from_lua = lua_gettop(L);\n\n \/\/ in this example, we'll take any number of args\n printf(\"HAPI_echo() called with %d arguments\\n\", args_from_lua);\n for (int n = 1; n <= args_from_lua; ++n)\n {\n printf(\" * arg %02d (%s):\\t%s\\n\",\n n,\n LuaTypeToString(lua_type(L, n)).c_str(),\n lua_tostring(L, n));\n \/\/ note: lua_tostring coerces stack value!\n }\n\n \/\/ return (123, \"abc\") to lua\n lua_pushnumber(L, 123);\n lua_pushstring(L, \"abc\");\n return 2; \/\/ 2 return values are on the stack\n\n }\n\n int set_redirected_print()\n {\n lua_getglobal(mLuaState, \"_G\");\n lua_register(mLuaState, \"print\", script_log);\n lua_pop(mLuaState, 1); \/\/ global table\n return 0;\n }\n\nprivate:\n lua_State* mLuaState = nullptr;\n int mErrorHandlerStackIndex = 0;\n};\n\n\nScript::Script()\n{\n\n}\n\nScript::~Script()\n{\n\n}\n\nbool Script::Init(FileSystem& fs)\n{\n const std::string myfile = fs.GameData().BasePath() + \"data\/scripts\/main.lua\";\n\n\n mScript = std::make_unique<LuaScript>();\n\n printf(\"loading\/executing lua file %s\\n\", myfile.c_str());\n luaL_dofile(mScript->State(), myfile.c_str());\n\n return true;\n}\n\nvoid Script::Update()\n{\n const std::string myfn = \"Update\";\n const int res = mScript->CallLua(myfn, 0, 0);\n if (res)\n {\n printf(\"%d, returned from call to %s\\n\", res, myfn.c_str());\n }\n}\n<commit_msg>remove example api and printfs<commit_after>#include \"script.hpp\"\n#include \"filesystem.hpp\"\n#include \"logger.hpp\"\n\nclass LuaScript\n{\npublic:\n LuaScript()\n {\n InitLua();\n }\n\n ~LuaScript()\n {\n HaltLua();\n }\n\n \/\/ call a lua function.\n \/\/ you must specify the quantity of of params and returns.\n int CallLua(std::string func, int num_params, int num_returns)\n {\n \/\/ on error, execute lua function debug.traceback\n \/\/ debug is a table, put it on the stack\n lua_getglobal(mLuaState, \"debug\");\n\n \/\/ -1 is the top of the stack\n lua_getfield(mLuaState, -1, \"traceback\");\n\n \/\/ traceback is on top, remove debug from 2nd spot\n lua_remove(mLuaState, -2);\n\n mErrorHandlerStackIndex = lua_gettop(mLuaState);\n \n \/\/ get the lua function and execute it\n lua_getglobal(mLuaState, func.c_str());\n const int ret = lua_pcall(mLuaState, num_params, num_returns, mErrorHandlerStackIndex);\n if (ret)\n {\n LOG_ERROR(\"Lua call failed (\" << ErrorToString(ret) << \": \" << lua_tostring(mLuaState, -1));\n }\n\n \/\/ remove the error handler from the stack\n lua_pop(mLuaState, 1);\n\n return ret;\n }\n\n bool FunctionExists(std::string func)\n {\n \/\/ try to put the function on top of the stack\n lua_getglobal(mLuaState, func.c_str());\n\n \/\/ check that value on top of stack is not nil\n bool ret = !lua_isnil(mLuaState, -1);\n\n \/\/ get rid of the value we put on the stack\n lua_pop(mLuaState, 1);\n\n return ret;\n }\n\n lua_State* State()\n {\n return mLuaState;\n }\n\nprivate:\n void InitLua()\n {\n mLuaState = luaL_newstate();\n luaL_openlibs(mLuaState);\n\n set_redirected_print();\n }\n\n void HaltLua()\n {\n lua_close(mLuaState);\n }\n\n static std::string LuaTypeToString(int index)\n {\n switch (index)\n {\n case LUA_TNIL: return \"nil\";\n case LUA_TNUMBER: return \"number\";\n case LUA_TBOOLEAN: return \"boolean\";\n case LUA_TSTRING: return \"string\";\n case LUA_TTABLE: return \"table\";\n case LUA_TFUNCTION: return \"function\";\n case LUA_TUSERDATA: return \"userdata\";\n case LUA_TTHREAD: return \"thread\";\n case LUA_TLIGHTUSERDATA: return \"light userdata\";\n default: return \"unknown type\";\n }\n }\n\n static std::string ErrorToString(int resultcode)\n {\n switch (resultcode)\n {\n case 0: return \"Success\";\n case LUA_ERRRUN: return \"Runtime error\";\n case LUA_ERRSYNTAX: return \"Syntax error\";\n case LUA_ERRERR: return \"Error with error alert mechanism.\";\n case LUA_ERRFILE: return \"Couldn't open or read file\";\n default: return \"Unknown error: \" + std::to_string(resultcode);\n }\n }\n\n static int script_log(lua_State* L)\n {\n const int nargs = lua_gettop(L);\n for (int i = 1; i <= nargs; ++i)\n {\n if (lua_isstring(L, i))\n {\n LOG_INFO(lua_tostring(L, i));\n }\n else\n {\n LOG_ERROR(\"TODO: Print this type\");\n }\n }\n return 0;\n }\n\n int set_redirected_print()\n {\n lua_getglobal(mLuaState, \"_G\");\n lua_register(mLuaState, \"print\", script_log);\n lua_pop(mLuaState, 1); \/\/ global table\n return 0;\n }\n\nprivate:\n lua_State* mLuaState = nullptr;\n int mErrorHandlerStackIndex = 0;\n};\n\n\nScript::Script()\n{\n\n}\n\nScript::~Script()\n{\n\n}\n\nbool Script::Init(FileSystem& fs)\n{\n const std::string myfile = fs.GameData().BasePath() + \"data\/scripts\/main.lua\";\n\n\n mScript = std::make_unique<LuaScript>();\n\n luaL_dofile(mScript->State(), myfile.c_str());\n\n return true;\n}\n\nvoid Script::Update()\n{\n const std::string myfn = \"Update\";\n const int res = mScript->CallLua(myfn, 0, 0);\n if (res)\n {\n \n }\n}\n<|endoftext|>"} {"text":"<commit_before><commit_msg>bump version to 0.4.1<commit_after><|endoftext|>"} {"text":"<commit_before><commit_msg>update 335<commit_after><|endoftext|>"} {"text":"<commit_before>#include <cmath>\n#include <chrono>\n#include <iostream>\n#include \"SrsEngine.h\"\n\nFlashcard SrsEngine::gradeFlashcard(Flashcard flashcard, unsigned int grade) {\n\n float newEasinessFactor = 0;\n std::time_t nextDate;\n\n if (grade < 3) {\n flashcard.setRepetitionCount(0);\n flashcard.setInterval(0);\n }\n else {\n newEasinessFactor = flashcard.getEasinessFactor() + (0.1 - (5 - grade) * (0.08 +(5 - grade) * 0.02));\n\n if (newEasinessFactor < 1.3) {\n flashcard.setEasinessFactor(1.3);\n }\n else {\n flashcard.setEasinessFactor(newEasinessFactor);\n }\n\n flashcard.setRepetitionCount(flashcard.getRepetitionCount() + 1);\n\n switch(flashcard.getRepetitionCount()) {\n case 1:\n flashcard.setInterval(1);\n break;\n\n case 2:\n flashcard.setInterval(6);\n break;\n\n default:\n float newInterval = ceil((flashcard.getRepetitionCount() - 1) * flashcard.getEasinessFactor());\n flashcard.setInterval(newInterval);\n break;\n }\n }\n\n if (grade == 3) {\n flashcard.setInterval(0);\n }\n\n std::chrono::system_clock::time_point today = std::chrono::system_clock::now();\n std::chrono::duration<int,std::ratio<60*60*24> > extraDays (flashcard.getInterval());\n\n \/\/std::cout << \"extraDays are: \" << extraDays << std::endl;\n\n std::chrono::system_clock::time_point newNextDay = today + extraDays;\n\n flashcard.setNextDate(newNextDay);\n\n return flashcard;\n}\n<commit_msg>SrsEngine cleanup<commit_after>#include <cmath>\n#include <chrono>\n#include <iostream>\n#include \"SrsEngine.h\"\n\nFlashcard SrsEngine::gradeFlashcard(Flashcard flashcard, unsigned int grade) {\n\n if (grade < 3) {\n flashcard.setRepetitionCount(0);\n flashcard.setInterval(1);\n }\n else {\n float newEasinessFactor = flashcard.getEasinessFactor() + (0.1 - (5 - grade) * (0.08 + (5 - grade) * 0.02));\n\n if (newEasinessFactor < 1.3) {\n flashcard.setEasinessFactor(1.3);\n }\n else {\n flashcard.setEasinessFactor(newEasinessFactor);\n }\n\n flashcard.setRepetitionCount(flashcard.getRepetitionCount() + 1);\n\n switch(flashcard.getRepetitionCount()) {\n case 1:\n flashcard.setInterval(1);\n break;\n\n case 2:\n flashcard.setInterval(6);\n break;\n\n default:\n float newInterval = ceil((flashcard.getRepetitionCount() - 1) * flashcard.getEasinessFactor());\n flashcard.setInterval(newInterval);\n break;\n }\n }\n\n if (grade == 3) {\n flashcard.setInterval(0);\n }\n\n std::chrono::system_clock::time_point today = std::chrono::system_clock::now();\n std::chrono::duration<int,std::ratio<60*60*24> > extraDays (flashcard.getInterval());\n\n \/\/std::cout << \"extraDays are: \" << extraDays << std::endl;\n\n std::chrono::system_clock::time_point newNextDay = today + extraDays;\n\n flashcard.setNextDate(newNextDay);\n\n return flashcard;\n}\n<|endoftext|>"} {"text":"<commit_before><commit_msg>Minor fix in comments<commit_after><|endoftext|>"} {"text":"<commit_before>\/*\n Copyright © 2010, 2011, 2012 Vladimír Vondruš <mosra@centrum.cz>\n\n This file is part of Magnum.\n\n Magnum is free software: you can redistribute it and\/or modify\n it under the terms of the GNU Lesser General Public License version 3\n only, as published by the Free Software Foundation.\n\n Magnum is distributed in the hope that it will be useful,\n but WITHOUT ANY WARRANTY; without even the implied warranty of\n MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the\n GNU Lesser General Public License version 3 for more details.\n*\/\n\n#include \"Font.h\"\n\n#include <algorithm>\n#include <ft2build.h>\n#include FT_FREETYPE_H\n#include <hb-ft.h>\n#include <Utility\/Unicode.h>\n\n#include \"Extensions.h\"\n#include \"Image.h\"\n#include \"TextureTools\/Atlas.h\"\n\nnamespace Magnum { namespace Text {\n\nFont::Font(FontRenderer& renderer, const std::string& fontFile, GLfloat size): _size(size) {\n CORRADE_INTERNAL_ASSERT_OUTPUT(FT_New_Face(renderer.library(), fontFile.c_str(), 0, &_ftFont) == 0);\n\n finishConstruction();\n}\n\nFont::Font(FontRenderer& renderer, const unsigned char* data, std::size_t dataSize, GLfloat size): _size(size) {\n CORRADE_INTERNAL_ASSERT_OUTPUT(FT_New_Memory_Face(renderer.library(), data, dataSize, 0, &_ftFont) == 0);\n\n finishConstruction();\n}\n\nvoid Font::finishConstruction() {\n CORRADE_INTERNAL_ASSERT_OUTPUT(FT_Set_Char_Size(_ftFont, 0, _size*64, 100, 100) == 0);\n\n \/* Create Harfbuzz font *\/\n _hbFont = hb_ft_font_create(_ftFont, nullptr);\n\n #ifndef MAGNUM_TARGET_GLES\n MAGNUM_ASSERT_EXTENSION_SUPPORTED(Extensions::GL::ARB::texture_rg);\n #else\n MAGNUM_ASSERT_EXTENSION_SUPPORTED(Extensions::GL::EXT::texture_rg);\n #endif\n\n \/* Set up the texture *\/\n _texture.setWrapping(Texture2D::Wrapping::ClampToEdge)\n ->setMinificationFilter(Texture2D::Filter::LinearInterpolation)\n ->setMagnificationFilter(Texture2D::Filter::LinearInterpolation);\n}\n\nvoid Font::prerender(const std::string& characters, const Vector2i& atlasSize) {\n glyphs.clear();\n\n \/** @bug Crash when atlas is too small *\/\n\n \/* Get character codes from string *\/\n std::vector<std::uint32_t> charCodes;\n charCodes.reserve(characters.size());\n for(std::size_t i = 0; i != characters.size(); ) {\n std::uint32_t codepoint;\n std::tie(codepoint, i) = Corrade::Utility::Unicode::nextChar(characters, i);\n charCodes.push_back(codepoint);\n }\n\n \/* Get character indices *\/\n std::vector<FT_UInt> charIndices;\n charIndices.push_back(0);\n for(std::uint32_t charCode: charCodes)\n charIndices.push_back(FT_Get_Char_Index(_ftFont, charCode));\n\n \/* Remove duplicates (e.g. uppercase and lowercase mapped to same glyph) *\/\n std::sort(charIndices.begin(), charIndices.end());\n charIndices.erase(std::unique(charIndices.begin(), charIndices.end()), charIndices.end());\n\n \/* Sizes of all characters *\/\n std::vector<Vector2i> charSizes;\n charSizes.reserve(charIndices.size());\n for(FT_UInt c: charIndices) {\n CORRADE_INTERNAL_ASSERT_OUTPUT(FT_Load_Glyph(_ftFont, c, FT_LOAD_DEFAULT) == 0);\n charSizes.push_back((Vector2i(_ftFont->glyph->metrics.width, _ftFont->glyph->metrics.height))\/64);\n }\n\n \/* Create texture atlas *\/\n std::vector<Rectanglei> charPositions = TextureTools::atlas(atlasSize, charSizes);\n\n \/* Render all characters to the atlas and create character map *\/\n glyphs.reserve(charPositions.size());\n unsigned char* pixmap = new unsigned char[atlasSize.product()]();\n Image2D image(atlasSize, Image2D::Format::Red, Image2D::Type::UnsignedByte, pixmap);\n for(std::size_t i = 0; i != charPositions.size(); ++i) {\n \/* Load and render glyph *\/\n \/** @todo B&W only *\/\n FT_GlyphSlot glyph = _ftFont->glyph;\n CORRADE_INTERNAL_ASSERT_OUTPUT(FT_Load_Glyph(_ftFont, charIndices[i], FT_LOAD_DEFAULT) == 0);\n CORRADE_INTERNAL_ASSERT_OUTPUT(FT_Render_Glyph(glyph, FT_RENDER_MODE_NORMAL) == 0);\n\n \/* Copy rendered bitmap to texture image *\/\n const FT_Bitmap& bitmap = glyph->bitmap;\n CORRADE_INTERNAL_ASSERT(std::abs(bitmap.width-charPositions[i].width()) <= 2);\n CORRADE_INTERNAL_ASSERT(std::abs(bitmap.rows-charPositions[i].height()) <= 2);\n for(std::int32_t yin = 0, yout = charPositions[i].bottom(), ymax = bitmap.rows; yin != ymax; ++yin, ++yout)\n for(std::int32_t xin = 0, xout = charPositions[i].left(), xmax = bitmap.width; xin != xmax; ++xin, ++xout)\n pixmap[yout*atlasSize.x() + xout] = bitmap.buffer[(bitmap.rows-yin-1)*bitmap.width + xin];\n\n \/* Save character texture position and texture coordinates for given character index *\/\n CORRADE_INTERNAL_ASSERT_OUTPUT(glyphs.insert({charIndices[i], std::make_tuple(\n Rectangle::fromSize(Vector2(glyph->bitmap_left, glyph->bitmap_top-charPositions[i].height())\/_size,\n Vector2(charPositions[i].size())\/_size),\n Rectangle(Vector2(charPositions[i].bottomLeft())\/atlasSize,\n Vector2(charPositions[i].topRight())\/atlasSize)\n )}).second);\n }\n\n \/* Set texture data *\/\n #ifndef MAGNUM_TARGET_GLES\n _texture.setImage(0, Texture2D::InternalFormat::R8, &image);\n #else\n _texture.setImage(0, Texture2D::InternalFormat::Red, &image);\n #endif\n}\n\nvoid Font::destroy() {\n if(!_ftFont) return;\n\n hb_font_destroy(_hbFont);\n FT_Done_Face(_ftFont);\n}\n\nvoid Font::move() {\n _hbFont = nullptr;\n _ftFont = nullptr;\n}\n\nFont::~Font() { destroy(); }\n\nFont::Font(Font&& other): glyphs(std::move(other.glyphs)), _texture(std::move(other._texture)), _ftFont(other._ftFont), _hbFont(other._hbFont), _size(other._size) {\n other.move();\n}\n\nFont& Font::operator=(Font&& other) {\n destroy();\n\n glyphs = std::move(other.glyphs);\n _texture = std::move(other._texture);\n _ftFont = other._ftFont;\n _hbFont = other._hbFont;\n _size = other._size;\n\n other.move();\n return *this;\n}\n\nconst std::tuple<Rectangle, Rectangle>& Font::operator[](std::uint32_t character) const {\n auto it = glyphs.find(character);\n\n if(it == glyphs.end())\n return glyphs.at(0);\n return it->second;\n}\n\n}}\n<commit_msg>Text: code cleanup -- merged two loops into one.<commit_after>\/*\n Copyright © 2010, 2011, 2012 Vladimír Vondruš <mosra@centrum.cz>\n\n This file is part of Magnum.\n\n Magnum is free software: you can redistribute it and\/or modify\n it under the terms of the GNU Lesser General Public License version 3\n only, as published by the Free Software Foundation.\n\n Magnum is distributed in the hope that it will be useful,\n but WITHOUT ANY WARRANTY; without even the implied warranty of\n MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the\n GNU Lesser General Public License version 3 for more details.\n*\/\n\n#include \"Font.h\"\n\n#include <algorithm>\n#include <ft2build.h>\n#include FT_FREETYPE_H\n#include <hb-ft.h>\n#include <Utility\/Unicode.h>\n\n#include \"Extensions.h\"\n#include \"Image.h\"\n#include \"TextureTools\/Atlas.h\"\n\nnamespace Magnum { namespace Text {\n\nFont::Font(FontRenderer& renderer, const std::string& fontFile, GLfloat size): _size(size) {\n CORRADE_INTERNAL_ASSERT_OUTPUT(FT_New_Face(renderer.library(), fontFile.c_str(), 0, &_ftFont) == 0);\n\n finishConstruction();\n}\n\nFont::Font(FontRenderer& renderer, const unsigned char* data, std::size_t dataSize, GLfloat size): _size(size) {\n CORRADE_INTERNAL_ASSERT_OUTPUT(FT_New_Memory_Face(renderer.library(), data, dataSize, 0, &_ftFont) == 0);\n\n finishConstruction();\n}\n\nvoid Font::finishConstruction() {\n CORRADE_INTERNAL_ASSERT_OUTPUT(FT_Set_Char_Size(_ftFont, 0, _size*64, 100, 100) == 0);\n\n \/* Create Harfbuzz font *\/\n _hbFont = hb_ft_font_create(_ftFont, nullptr);\n\n #ifndef MAGNUM_TARGET_GLES\n MAGNUM_ASSERT_EXTENSION_SUPPORTED(Extensions::GL::ARB::texture_rg);\n #else\n MAGNUM_ASSERT_EXTENSION_SUPPORTED(Extensions::GL::EXT::texture_rg);\n #endif\n\n \/* Set up the texture *\/\n _texture.setWrapping(Texture2D::Wrapping::ClampToEdge)\n ->setMinificationFilter(Texture2D::Filter::LinearInterpolation)\n ->setMagnificationFilter(Texture2D::Filter::LinearInterpolation);\n}\n\nvoid Font::prerender(const std::string& characters, const Vector2i& atlasSize) {\n glyphs.clear();\n\n \/** @bug Crash when atlas is too small *\/\n\n \/* Get glyph codes from characters *\/\n std::vector<FT_UInt> charIndices;\n charIndices.reserve(characters.size()+1);\n charIndices.push_back(0);\n for(std::size_t i = 0; i != characters.size(); ) {\n std::uint32_t codepoint;\n std::tie(codepoint, i) = Corrade::Utility::Unicode::nextChar(characters, i);\n charIndices.push_back(FT_Get_Char_Index(_ftFont, codepoint));\n }\n\n \/* Remove duplicates (e.g. uppercase and lowercase mapped to same glyph) *\/\n std::sort(charIndices.begin(), charIndices.end());\n charIndices.erase(std::unique(charIndices.begin(), charIndices.end()), charIndices.end());\n\n \/* Sizes of all characters *\/\n std::vector<Vector2i> charSizes;\n charSizes.reserve(charIndices.size());\n for(FT_UInt c: charIndices) {\n CORRADE_INTERNAL_ASSERT_OUTPUT(FT_Load_Glyph(_ftFont, c, FT_LOAD_DEFAULT) == 0);\n charSizes.push_back((Vector2i(_ftFont->glyph->metrics.width, _ftFont->glyph->metrics.height))\/64);\n }\n\n \/* Create texture atlas *\/\n std::vector<Rectanglei> charPositions = TextureTools::atlas(atlasSize, charSizes);\n\n \/* Render all characters to the atlas and create character map *\/\n glyphs.reserve(charPositions.size());\n unsigned char* pixmap = new unsigned char[atlasSize.product()]();\n Image2D image(atlasSize, Image2D::Format::Red, Image2D::Type::UnsignedByte, pixmap);\n for(std::size_t i = 0; i != charPositions.size(); ++i) {\n \/* Load and render glyph *\/\n \/** @todo B&W only *\/\n FT_GlyphSlot glyph = _ftFont->glyph;\n CORRADE_INTERNAL_ASSERT_OUTPUT(FT_Load_Glyph(_ftFont, charIndices[i], FT_LOAD_DEFAULT) == 0);\n CORRADE_INTERNAL_ASSERT_OUTPUT(FT_Render_Glyph(glyph, FT_RENDER_MODE_NORMAL) == 0);\n\n \/* Copy rendered bitmap to texture image *\/\n const FT_Bitmap& bitmap = glyph->bitmap;\n CORRADE_INTERNAL_ASSERT(std::abs(bitmap.width-charPositions[i].width()) <= 2);\n CORRADE_INTERNAL_ASSERT(std::abs(bitmap.rows-charPositions[i].height()) <= 2);\n for(std::int32_t yin = 0, yout = charPositions[i].bottom(), ymax = bitmap.rows; yin != ymax; ++yin, ++yout)\n for(std::int32_t xin = 0, xout = charPositions[i].left(), xmax = bitmap.width; xin != xmax; ++xin, ++xout)\n pixmap[yout*atlasSize.x() + xout] = bitmap.buffer[(bitmap.rows-yin-1)*bitmap.width + xin];\n\n \/* Save character texture position and texture coordinates for given character index *\/\n CORRADE_INTERNAL_ASSERT_OUTPUT(glyphs.insert({charIndices[i], std::make_tuple(\n Rectangle::fromSize(Vector2(glyph->bitmap_left, glyph->bitmap_top-charPositions[i].height())\/_size,\n Vector2(charPositions[i].size())\/_size),\n Rectangle(Vector2(charPositions[i].bottomLeft())\/atlasSize,\n Vector2(charPositions[i].topRight())\/atlasSize)\n )}).second);\n }\n\n \/* Set texture data *\/\n #ifndef MAGNUM_TARGET_GLES\n _texture.setImage(0, Texture2D::InternalFormat::R8, &image);\n #else\n _texture.setImage(0, Texture2D::InternalFormat::Red, &image);\n #endif\n}\n\nvoid Font::destroy() {\n if(!_ftFont) return;\n\n hb_font_destroy(_hbFont);\n FT_Done_Face(_ftFont);\n}\n\nvoid Font::move() {\n _hbFont = nullptr;\n _ftFont = nullptr;\n}\n\nFont::~Font() { destroy(); }\n\nFont::Font(Font&& other): glyphs(std::move(other.glyphs)), _texture(std::move(other._texture)), _ftFont(other._ftFont), _hbFont(other._hbFont), _size(other._size) {\n other.move();\n}\n\nFont& Font::operator=(Font&& other) {\n destroy();\n\n glyphs = std::move(other.glyphs);\n _texture = std::move(other._texture);\n _ftFont = other._ftFont;\n _hbFont = other._hbFont;\n _size = other._size;\n\n other.move();\n return *this;\n}\n\nconst std::tuple<Rectangle, Rectangle>& Font::operator[](std::uint32_t character) const {\n auto it = glyphs.find(character);\n\n if(it == glyphs.end())\n return glyphs.at(0);\n return it->second;\n}\n\n}}\n<|endoftext|>"} {"text":"<commit_before><commit_msg>DN-154 Display Names only shown in Nearby Chat History when a user logs back in even if Usernames were shown in Chat during previous session<commit_after><|endoftext|>"} {"text":"<commit_before><commit_msg>Replaced gSavedSettings.get* calls in texture console with LLCachedControls<commit_after><|endoftext|>"} {"text":"<commit_before>#include <StdAfx.h>\n#include <UI\/Controls\/PaneHeader\/PaneHeader.h>\n#include <UI\/UIFunctions.h>\n#include <core\/utility\/strings.h>\n#include <UI\/DoubleBuffer.h>\n#include <core\/utility\/output.h>\n#include <core\/utility\/registry.h>\n\nnamespace controls\n{\n\tstatic std::wstring CLASS = L\"PaneHeader\";\n\n\tPaneHeader::~PaneHeader()\n\t{\n\t\tTRACE_DESTRUCTOR(CLASS);\n\t\tCWnd::DestroyWindow();\n\t}\n\n\tvoid PaneHeader::Initialize(HWND hWnd, _In_opt_ HDC hdc, _In_ UINT nid)\n\t{\n\t\tm_hWndParent = hWnd;\n\n\t\t\/\/ Assign a nID to the collapse button that is IDD_COLLAPSE more than the control's nID\n\t\tm_nID = nid;\n\t\tm_nIDCollapse = nid + IDD_COLLAPSE;\n\n\t\tWNDCLASSEX wc = {};\n\t\tconst auto hInst = AfxGetInstanceHandle();\n\t\tif (!::GetClassInfoEx(hInst, _T(\"PaneHeader\"), &wc)) \/\/ STRING_OK\n\t\t{\n\t\t\twc.cbSize = sizeof wc;\n\t\t\twc.style = 0; \/\/ not passing CS_VREDRAW | CS_HREDRAW fixes flicker\n\t\t\twc.lpszClassName = _T(\"PaneHeader\"); \/\/ STRING_OK\n\t\t\twc.lpfnWndProc = ::DefWindowProc;\n\t\t\twc.hbrBackground = GetSysBrush(ui::uiColor::Background); \/\/ helps spot flashing\n\n\t\t\tRegisterClassEx(&wc);\n\t\t}\n\n\t\t\/\/ WS_CLIPCHILDREN is used to reduce flicker\n\t\tEC_B_S(CreateEx(\n\t\t\t0,\n\t\t\t_T(\"PaneHeader\"), \/\/ STRING_OK\n\t\t\t_T(\"PaneHeader\"), \/\/ STRING_OK\n\t\t\tWS_CHILD | WS_CLIPSIBLINGS | WS_CLIPCHILDREN | WS_VISIBLE,\n\t\t\t0,\n\t\t\t0,\n\t\t\t0,\n\t\t\t0,\n\t\t\tm_hWndParent,\n\t\t\treinterpret_cast<HMENU>(static_cast<INT_PTR>(IDC_PANE_HEADER)),\n\t\t\tnullptr));\n\n\t\t\/\/ Necessary for TAB to work. Without this, all TABS get stuck on the control\n\t\t\/\/ instead of passing to the children.\n\t\tEC_B_S(ModifyStyleEx(0, WS_EX_CONTROLPARENT));\n\n\t\tconst auto sizeText = ui::GetTextExtentPoint32(hdc, m_szLabel);\n\t\tm_iLabelWidth = sizeText.cx;\n\t\toutput::DebugPrint(\n\t\t\toutput::dbgLevel::Draw,\n\t\t\tL\"PaneHeader::Initialize m_iLabelWidth:%d \\\"%ws\\\"\\n\",\n\t\t\tm_iLabelWidth,\n\t\t\tm_szLabel.c_str());\n\t}\n\n\tBEGIN_MESSAGE_MAP(PaneHeader, CWnd)\n\tON_WM_CREATE()\n\tEND_MESSAGE_MAP()\n\n\tint PaneHeader::OnCreate(LPCREATESTRUCT \/*lpCreateStruct*\/)\n\t{\n\t\tEC_B_S(m_leftLabel.Create(\n\t\t\tnullptr, WS_CHILD | WS_CLIPSIBLINGS | WS_VISIBLE, CRect(0, 0, 0, 0), this, m_nID));\n\t\t::SetWindowTextW(m_leftLabel.m_hWnd, m_szLabel.c_str());\n\t\tui::SubclassLabel(m_leftLabel.m_hWnd);\n\t\tif (m_bCollapsible)\n\t\t{\n\t\t\tStyleLabel(m_leftLabel.m_hWnd, ui::uiLabelStyle::PaneHeaderLabel);\n\t\t}\n\n\t\tEC_B_S(m_rightLabel.Create(\n\t\t\tnullptr, WS_CHILD | WS_CLIPSIBLINGS | WS_VISIBLE, CRect(0, 0, 0, 0), this, IDD_RIGHTLABEL));\n\t\tui::SubclassLabel(m_rightLabel.m_hWnd);\n\t\tStyleLabel(m_rightLabel.m_hWnd, ui::uiLabelStyle::PaneHeaderText);\n\n\t\tif (m_bCollapsible)\n\t\t{\n\t\t\tEC_B_S(m_CollapseButton.Create(\n\t\t\t\tnullptr,\n\t\t\t\tWS_TABSTOP | WS_CHILD | WS_CLIPSIBLINGS | WS_VISIBLE | BS_NOTIFY,\n\t\t\t\tCRect(0, 0, 0, 0),\n\t\t\t\tthis,\n\t\t\t\tm_nIDCollapse));\n\t\t\tStyleButton(\n\t\t\t\tm_CollapseButton.m_hWnd, m_bCollapsed ? ui::uiButtonStyle::UpArrow : ui::uiButtonStyle::DownArrow);\n\t\t}\n\n\t\t\/\/ If we need an action button, go ahead and create it\n\t\tif (m_nIDAction)\n\t\t{\n\t\t\tEC_B_S(m_actionButton.Create(\n\t\t\t\tstrings::wstringTotstring(m_szActionButton).c_str(),\n\t\t\t\tWS_TABSTOP | WS_CHILD | WS_CLIPSIBLINGS | WS_VISIBLE | BS_NOTIFY,\n\t\t\t\tCRect(0, 0, 0, 0),\n\t\t\t\tthis,\n\t\t\t\tm_nIDAction));\n\t\t\tStyleButton(m_actionButton.m_hWnd, ui::uiButtonStyle::Unstyled);\n\t\t}\n\n\t\tm_bInitialized = true;\n\t\treturn 0;\n\t}\n\n\tLRESULT PaneHeader::WindowProc(const UINT message, const WPARAM wParam, const LPARAM lParam)\n\t{\n\t\tLRESULT lRes = 0;\n\t\tif (ui::HandleControlUI(message, wParam, lParam, &lRes)) return lRes;\n\n\t\tswitch (message)\n\t\t{\n\t\tcase WM_PAINT:\n\t\t\tauto ps = PAINTSTRUCT{};\n\t\t\t::BeginPaint(m_hWnd, &ps);\n\t\t\tif (ps.hdc)\n\t\t\t{\n\t\t\t\tauto rcWin = RECT{};\n\t\t\t\t::GetClientRect(m_hWnd, &rcWin);\n\t\t\t\tconst auto background = registry::uiDiag ? ui::GetSysBrush(ui::uiColor::TestGreen)\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t : ui::GetSysBrush(ui::uiColor::Background);\n\t\t\t\tFillRect(ps.hdc, &rcWin, background);\n\t\t\t}\n\n\t\t\t::EndPaint(m_hWnd, &ps);\n\t\t\treturn 0;\n\t\tcase WM_WINDOWPOSCHANGED:\n\t\t\tRecalcLayout();\n\t\t\treturn 0;\n\t\tcase WM_CLOSE:\n\t\t\t::SendMessage(m_hWndParent, message, wParam, lParam);\n\t\t\treturn true;\n\t\tcase WM_HELP:\n\t\t\treturn true;\n\t\tcase WM_COMMAND:\n\t\t{\n\t\t\tconst auto nCode = HIWORD(wParam);\n\t\t\tswitch (nCode)\n\t\t\t{\n\t\t\t\/\/ Pass button clicks up to parent\n\t\t\tcase BN_CLICKED:\n\t\t\t\t\/\/ Pass focus notifications up to parent\n\t\t\tcase BN_SETFOCUS:\n\t\t\tcase EN_SETFOCUS:\n\t\t\t\treturn ::SendMessage(m_hWndParent, message, wParam, lParam);\n\t\t\t}\n\n\t\t\tbreak;\n\t\t}\n\t\t}\n\n\t\treturn CWnd::WindowProc(message, wParam, lParam);\n\t}\n\n\tint PaneHeader::GetFixedHeight() const noexcept\n\t{\n\t\tint iHeight = 0;\n\t\tif (m_bCollapsible || !m_szLabel.empty()) iHeight = max(m_iButtonHeight, m_iLabelHeight);\n\t\tif (!m_bCollapsed && iHeight) iHeight += m_iSmallHeightMargin;\n\n\t\treturn iHeight;\n\t}\n\n\t\/\/ Position collapse button, labels, action button.\n\tvoid PaneHeader::RecalcLayout()\n\t{\n\t\tif (!m_bInitialized) return;\n\t\tauto hWinPosInfo = WC_D(HDWP, BeginDeferWindowPos(4));\n\t\tif (hWinPosInfo)\n\t\t{\n\t\t\tauto rcWin = RECT{};\n\t\t\t::GetClientRect(m_hWnd, &rcWin);\n\t\t\tconst auto width = rcWin.right - rcWin.left;\n\t\t\tconst auto height = rcWin.bottom - rcWin.top;\n\t\t\toutput::DebugPrint(\n\t\t\t\toutput::dbgLevel::Draw,\n\t\t\t\tL\"PaneHeader::DeferWindowPos width:%d height:%d v:%d l:\\\"%ws\\\"\\n\",\n\t\t\t\twidth,\n\t\t\t\theight,\n\t\t\t\tIsWindowVisible(),\n\t\t\t\tm_szLabel.c_str());\n\t\t\tauto curX = 0;\n\t\t\tconst auto actionButtonWidth =\n\t\t\t\t!m_bCollapsed && m_actionButtonWidth ? m_actionButtonWidth + 2 * m_iMargin : 0;\n\t\t\tconst auto actionButtonAndGutterWidth = actionButtonWidth ? actionButtonWidth + m_iSideMargin : 0;\n\t\t\tif (m_bCollapsible)\n\t\t\t{\n\t\t\t\thWinPosInfo = ui::DeferWindowPos(\n\t\t\t\t\thWinPosInfo,\n\t\t\t\t\tm_CollapseButton.GetSafeHwnd(),\n\t\t\t\t\tcurX,\n\t\t\t\t\t0,\n\t\t\t\t\twidth - actionButtonAndGutterWidth,\n\t\t\t\t\tm_iButtonHeight,\n\t\t\t\t\tL\"PaneHeader::DeferWindowPos::collapseButton\");\n\t\t\t\tcurX += m_iButtonHeight;\n\t\t\t}\n\n\t\t\thWinPosInfo = ui::DeferWindowPos(\n\t\t\t\thWinPosInfo,\n\t\t\t\tm_leftLabel.GetSafeHwnd(),\n\t\t\t\tcurX,\n\t\t\t\t1,\n\t\t\t\tm_iLabelWidth,\n\t\t\t\tm_iLabelHeight,\n\t\t\t\tL\"PaneHeader::DeferWindowPos::leftLabel\");\n\n\t\t\tauto cmdShow = SW_HIDE;\n\t\t\tif (!m_bCollapsed && m_rightLabelWidth)\n\t\t\t{\n\t\t\t\t\/\/ Drop the count on top of the label we drew above\n\t\t\t\thWinPosInfo = ui::DeferWindowPos(\n\t\t\t\t\thWinPosInfo,\n\t\t\t\t\tm_rightLabel.GetSafeHwnd(),\n\t\t\t\t\twidth - m_rightLabelWidth - actionButtonAndGutterWidth - m_iSideMargin - 1,\n\t\t\t\t\t1,\n\t\t\t\t\tm_rightLabelWidth,\n\t\t\t\t\tm_iLabelHeight,\n\t\t\t\t\tL\"PaneHeader::DeferWindowPos::rightLabel\");\n\t\t\t\tcmdShow = SW_SHOW;\n\t\t\t}\n\n\t\t\tWC_B_S(::ShowWindow(m_rightLabel.GetSafeHwnd(), cmdShow));\n\n\t\t\tif (!m_bCollapsed && m_nIDAction && m_actionButtonWidth)\n\t\t\t{\n\t\t\t\t\/\/ Drop the action button next to the label we drew above\n\t\t\t\thWinPosInfo = ui::DeferWindowPos(\n\t\t\t\t\thWinPosInfo,\n\t\t\t\t\tm_actionButton.GetSafeHwnd(),\n\t\t\t\t\twidth - actionButtonWidth,\n\t\t\t\t\t0,\n\t\t\t\t\tactionButtonWidth,\n\t\t\t\t\tm_iButtonHeight,\n\t\t\t\t\tL\"PaneHeader::DeferWindowPos::actionButton\");\n\t\t\t\tcmdShow = SW_SHOW;\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\tcmdShow = SW_HIDE;\n\t\t\t}\n\n\t\t\tWC_B_S(::ShowWindow(m_actionButton.GetSafeHwnd(), cmdShow));\n\n\t\t\toutput::DebugPrint(output::dbgLevel::Draw, L\"PaneHeader::DeferWindowPos end\\n\");\n\t\t\tEC_B_S(EndDeferWindowPos(hWinPosInfo));\n\t\t}\n\t}\n\n\tint PaneHeader::GetMinWidth()\n\t{\n\t\tauto cx = m_iLabelWidth;\n\t\tif (m_bCollapsible) cx += m_iButtonHeight;\n\t\tif (m_rightLabelWidth)\n\t\t{\n\t\t\tcx += m_iSideMargin * 2;\n\t\t\tcx += m_rightLabelWidth;\n\t\t}\n\n\t\tif (m_actionButtonWidth)\n\t\t{\n\t\t\tcx += m_iSideMargin;\n\t\t\tcx += m_actionButtonWidth + 2 * m_iMargin;\n\t\t}\n\n\t\treturn cx;\n\t}\n\n\tvoid PaneHeader::SetRightLabel(const std::wstring szLabel)\n\t{\n\t\tif (!m_bInitialized) return;\n\t\tEC_B_S(::SetWindowTextW(m_rightLabel.m_hWnd, szLabel.c_str()));\n\n\t\tconst auto hdc = ::GetDC(m_rightLabel.GetSafeHwnd());\n\t\tconst auto hfontOld = SelectObject(hdc, ui::GetSegoeFont());\n\t\tconst auto sizeText = ui::GetTextExtentPoint32(hdc, szLabel);\n\t\tstatic_cast<void>(SelectObject(hdc, hfontOld));\n\t\t::ReleaseDC(m_rightLabel.GetSafeHwnd(), hdc);\n\t\tm_rightLabelWidth = sizeText.cx;\n\n\t\tRecalcLayout();\n\t}\n\n\tvoid PaneHeader::SetActionButton(const std::wstring szActionButton)\n\t{\n\t\t\/\/ Don't bother if we never enabled the button\n\t\tif (m_nIDAction == 0) return;\n\n\t\tEC_B_S(::SetWindowTextW(m_actionButton.GetSafeHwnd(), szActionButton.c_str()));\n\n\t\tm_szActionButton = szActionButton;\n\t\tconst auto hdc = ::GetDC(m_actionButton.GetSafeHwnd());\n\t\tconst auto hfontOld = SelectObject(hdc, ui::GetSegoeFont());\n\t\tconst auto sizeText = ui::GetTextExtentPoint32(hdc, szActionButton);\n\t\tstatic_cast<void>(SelectObject(hdc, hfontOld));\n\t\t::ReleaseDC(m_actionButton.GetSafeHwnd(), hdc);\n\t\tm_actionButtonWidth = sizeText.cx;\n\n\t\tRecalcLayout();\n\t}\n\n\tbool PaneHeader::HandleChange(UINT nID)\n\t{\n\t\t\/\/ Collapse buttons have a nID IDD_COLLAPSE higher than nID of the pane they toggle.\n\t\t\/\/ So if we get asked about one that matches, we can assume it's time to toggle our collapse.\n\t\tif (m_nIDCollapse == nID)\n\t\t{\n\t\t\tOnToggleCollapse();\n\t\t\treturn true;\n\t\t}\n\n\t\treturn false;\n\t}\n\n\tvoid PaneHeader::OnToggleCollapse()\n\t{\n\t\tif (!m_bCollapsible) return;\n\t\tm_bCollapsed = !m_bCollapsed;\n\n\t\tStyleButton(m_CollapseButton.m_hWnd, m_bCollapsed ? ui::uiButtonStyle::UpArrow : ui::uiButtonStyle::DownArrow);\n\n\t\t\/\/ Trigger a redraw\n\t\t::PostMessage(m_hWndParent, WM_COMMAND, IDD_RECALCLAYOUT, NULL);\n\t}\n\n\tvoid PaneHeader::SetMargins(\n\t\tint iMargin,\n\t\tint iSideMargin,\n\t\tint iLabelHeight, \/\/ Height of the label\n\t\tint iSmallHeightMargin,\n\t\tint iButtonHeight) \/\/ Height of button\n\t{\n\t\tm_iMargin = iMargin;\n\t\tm_iSideMargin = iSideMargin;\n\t\tm_iLabelHeight = iLabelHeight;\n\t\tm_iSmallHeightMargin = iSmallHeightMargin;\n\t\tm_iButtonHeight = iButtonHeight;\n\t}\n\n\tbool PaneHeader::containsWindow(HWND hWnd) const noexcept\n\t{\n\t\tif (GetSafeHwnd() == hWnd) return true;\n\t\tif (m_leftLabel.GetSafeHwnd() == hWnd) return true;\n\t\tif (m_rightLabel.GetSafeHwnd() == hWnd) return true;\n\t\tif (m_actionButton.GetSafeHwnd() == hWnd) return true;\n\t\tif (m_CollapseButton.GetSafeHwnd() == hWnd) return true;\n\t\treturn false;\n\t}\n} \/\/ namespace controls<commit_msg>ensure pane header arrows always draw the right direction<commit_after>#include <StdAfx.h>\n#include <UI\/Controls\/PaneHeader\/PaneHeader.h>\n#include <UI\/UIFunctions.h>\n#include <core\/utility\/strings.h>\n#include <UI\/DoubleBuffer.h>\n#include <core\/utility\/output.h>\n#include <core\/utility\/registry.h>\n\nnamespace controls\n{\n\tstatic std::wstring CLASS = L\"PaneHeader\";\n\n\tPaneHeader::~PaneHeader()\n\t{\n\t\tTRACE_DESTRUCTOR(CLASS);\n\t\tCWnd::DestroyWindow();\n\t}\n\n\tvoid PaneHeader::Initialize(HWND hWnd, _In_opt_ HDC hdc, _In_ UINT nid)\n\t{\n\t\tm_hWndParent = hWnd;\n\n\t\t\/\/ Assign a nID to the collapse button that is IDD_COLLAPSE more than the control's nID\n\t\tm_nID = nid;\n\t\tm_nIDCollapse = nid + IDD_COLLAPSE;\n\n\t\tWNDCLASSEX wc = {};\n\t\tconst auto hInst = AfxGetInstanceHandle();\n\t\tif (!::GetClassInfoEx(hInst, _T(\"PaneHeader\"), &wc)) \/\/ STRING_OK\n\t\t{\n\t\t\twc.cbSize = sizeof wc;\n\t\t\twc.style = 0; \/\/ not passing CS_VREDRAW | CS_HREDRAW fixes flicker\n\t\t\twc.lpszClassName = _T(\"PaneHeader\"); \/\/ STRING_OK\n\t\t\twc.lpfnWndProc = ::DefWindowProc;\n\t\t\twc.hbrBackground = GetSysBrush(ui::uiColor::Background); \/\/ helps spot flashing\n\n\t\t\tRegisterClassEx(&wc);\n\t\t}\n\n\t\t\/\/ WS_CLIPCHILDREN is used to reduce flicker\n\t\tEC_B_S(CreateEx(\n\t\t\t0,\n\t\t\t_T(\"PaneHeader\"), \/\/ STRING_OK\n\t\t\t_T(\"PaneHeader\"), \/\/ STRING_OK\n\t\t\tWS_CHILD | WS_CLIPSIBLINGS | WS_CLIPCHILDREN | WS_VISIBLE,\n\t\t\t0,\n\t\t\t0,\n\t\t\t0,\n\t\t\t0,\n\t\t\tm_hWndParent,\n\t\t\treinterpret_cast<HMENU>(static_cast<INT_PTR>(IDC_PANE_HEADER)),\n\t\t\tnullptr));\n\n\t\t\/\/ Necessary for TAB to work. Without this, all TABS get stuck on the control\n\t\t\/\/ instead of passing to the children.\n\t\tEC_B_S(ModifyStyleEx(0, WS_EX_CONTROLPARENT));\n\n\t\tconst auto sizeText = ui::GetTextExtentPoint32(hdc, m_szLabel);\n\t\tm_iLabelWidth = sizeText.cx;\n\t\toutput::DebugPrint(\n\t\t\toutput::dbgLevel::Draw,\n\t\t\tL\"PaneHeader::Initialize m_iLabelWidth:%d \\\"%ws\\\"\\n\",\n\t\t\tm_iLabelWidth,\n\t\t\tm_szLabel.c_str());\n\t}\n\n\tBEGIN_MESSAGE_MAP(PaneHeader, CWnd)\n\tON_WM_CREATE()\n\tEND_MESSAGE_MAP()\n\n\tint PaneHeader::OnCreate(LPCREATESTRUCT \/*lpCreateStruct*\/)\n\t{\n\t\tEC_B_S(m_leftLabel.Create(nullptr, WS_CHILD | WS_CLIPSIBLINGS | WS_VISIBLE, CRect(0, 0, 0, 0), this, m_nID));\n\t\t::SetWindowTextW(m_leftLabel.m_hWnd, m_szLabel.c_str());\n\t\tui::SubclassLabel(m_leftLabel.m_hWnd);\n\t\tif (m_bCollapsible)\n\t\t{\n\t\t\tStyleLabel(m_leftLabel.m_hWnd, ui::uiLabelStyle::PaneHeaderLabel);\n\t\t}\n\n\t\tEC_B_S(m_rightLabel.Create(\n\t\t\tnullptr, WS_CHILD | WS_CLIPSIBLINGS | WS_VISIBLE, CRect(0, 0, 0, 0), this, IDD_RIGHTLABEL));\n\t\tui::SubclassLabel(m_rightLabel.m_hWnd);\n\t\tStyleLabel(m_rightLabel.m_hWnd, ui::uiLabelStyle::PaneHeaderText);\n\n\t\tif (m_bCollapsible)\n\t\t{\n\t\t\tEC_B_S(m_CollapseButton.Create(\n\t\t\t\tnullptr,\n\t\t\t\tWS_TABSTOP | WS_CHILD | WS_CLIPSIBLINGS | WS_VISIBLE | BS_NOTIFY,\n\t\t\t\tCRect(0, 0, 0, 0),\n\t\t\t\tthis,\n\t\t\t\tm_nIDCollapse));\n\t\t\tStyleButton(\n\t\t\t\tm_CollapseButton.m_hWnd, m_bCollapsed ? ui::uiButtonStyle::UpArrow : ui::uiButtonStyle::DownArrow);\n\t\t}\n\n\t\t\/\/ If we need an action button, go ahead and create it\n\t\tif (m_nIDAction)\n\t\t{\n\t\t\tEC_B_S(m_actionButton.Create(\n\t\t\t\tstrings::wstringTotstring(m_szActionButton).c_str(),\n\t\t\t\tWS_TABSTOP | WS_CHILD | WS_CLIPSIBLINGS | WS_VISIBLE | BS_NOTIFY,\n\t\t\t\tCRect(0, 0, 0, 0),\n\t\t\t\tthis,\n\t\t\t\tm_nIDAction));\n\t\t\tStyleButton(m_actionButton.m_hWnd, ui::uiButtonStyle::Unstyled);\n\t\t}\n\n\t\tm_bInitialized = true;\n\t\treturn 0;\n\t}\n\n\tLRESULT PaneHeader::WindowProc(const UINT message, const WPARAM wParam, const LPARAM lParam)\n\t{\n\t\tLRESULT lRes = 0;\n\t\tif (ui::HandleControlUI(message, wParam, lParam, &lRes)) return lRes;\n\n\t\tswitch (message)\n\t\t{\n\t\tcase WM_PAINT:\n\t\t\tauto ps = PAINTSTRUCT{};\n\t\t\t::BeginPaint(m_hWnd, &ps);\n\t\t\tif (ps.hdc)\n\t\t\t{\n\t\t\t\tauto rcWin = RECT{};\n\t\t\t\t::GetClientRect(m_hWnd, &rcWin);\n\t\t\t\tconst auto background = registry::uiDiag ? ui::GetSysBrush(ui::uiColor::TestGreen)\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t : ui::GetSysBrush(ui::uiColor::Background);\n\t\t\t\tFillRect(ps.hdc, &rcWin, background);\n\t\t\t}\n\n\t\t\t::EndPaint(m_hWnd, &ps);\n\t\t\treturn 0;\n\t\tcase WM_WINDOWPOSCHANGED:\n\t\t\tRecalcLayout();\n\t\t\treturn 0;\n\t\tcase WM_CLOSE:\n\t\t\t::SendMessage(m_hWndParent, message, wParam, lParam);\n\t\t\treturn true;\n\t\tcase WM_HELP:\n\t\t\treturn true;\n\t\tcase WM_COMMAND:\n\t\t{\n\t\t\tconst auto nCode = HIWORD(wParam);\n\t\t\tswitch (nCode)\n\t\t\t{\n\t\t\t\/\/ Pass button clicks up to parent\n\t\t\tcase BN_CLICKED:\n\t\t\t\t\/\/ Pass focus notifications up to parent\n\t\t\tcase BN_SETFOCUS:\n\t\t\tcase EN_SETFOCUS:\n\t\t\t\treturn ::SendMessage(m_hWndParent, message, wParam, lParam);\n\t\t\t}\n\n\t\t\tbreak;\n\t\t}\n\t\t}\n\n\t\treturn CWnd::WindowProc(message, wParam, lParam);\n\t}\n\n\tint PaneHeader::GetFixedHeight() const noexcept\n\t{\n\t\tint iHeight = 0;\n\t\tif (m_bCollapsible || !m_szLabel.empty()) iHeight = max(m_iButtonHeight, m_iLabelHeight);\n\t\tif (!m_bCollapsed && iHeight) iHeight += m_iSmallHeightMargin;\n\n\t\treturn iHeight;\n\t}\n\n\t\/\/ Position collapse button, labels, action button.\n\tvoid PaneHeader::RecalcLayout()\n\t{\n\t\tif (!m_bInitialized) return;\n\t\tauto hWinPosInfo = WC_D(HDWP, BeginDeferWindowPos(4));\n\t\tif (hWinPosInfo)\n\t\t{\n\t\t\tauto rcWin = RECT{};\n\t\t\t::GetClientRect(m_hWnd, &rcWin);\n\t\t\tconst auto width = rcWin.right - rcWin.left;\n\t\t\tconst auto height = rcWin.bottom - rcWin.top;\n\t\t\toutput::DebugPrint(\n\t\t\t\toutput::dbgLevel::Draw,\n\t\t\t\tL\"PaneHeader::DeferWindowPos width:%d height:%d v:%d l:\\\"%ws\\\"\\n\",\n\t\t\t\twidth,\n\t\t\t\theight,\n\t\t\t\tIsWindowVisible(),\n\t\t\t\tm_szLabel.c_str());\n\t\t\tauto curX = 0;\n\t\t\tconst auto actionButtonWidth =\n\t\t\t\t!m_bCollapsed && m_actionButtonWidth ? m_actionButtonWidth + 2 * m_iMargin : 0;\n\t\t\tconst auto actionButtonAndGutterWidth = actionButtonWidth ? actionButtonWidth + m_iSideMargin : 0;\n\t\t\tif (m_bCollapsible)\n\t\t\t{\n\t\t\t\thWinPosInfo = ui::DeferWindowPos(\n\t\t\t\t\thWinPosInfo,\n\t\t\t\t\tm_CollapseButton.GetSafeHwnd(),\n\t\t\t\t\tcurX,\n\t\t\t\t\t0,\n\t\t\t\t\twidth - actionButtonAndGutterWidth,\n\t\t\t\t\tm_iButtonHeight,\n\t\t\t\t\tL\"PaneHeader::DeferWindowPos::collapseButton\");\n\t\t\t\tcurX += m_iButtonHeight;\n\t\t\t}\n\n\t\t\thWinPosInfo = ui::DeferWindowPos(\n\t\t\t\thWinPosInfo,\n\t\t\t\tm_leftLabel.GetSafeHwnd(),\n\t\t\t\tcurX,\n\t\t\t\t1,\n\t\t\t\tm_iLabelWidth,\n\t\t\t\tm_iLabelHeight,\n\t\t\t\tL\"PaneHeader::DeferWindowPos::leftLabel\");\n\n\t\t\tauto cmdShow = SW_HIDE;\n\t\t\tif (!m_bCollapsed && m_rightLabelWidth)\n\t\t\t{\n\t\t\t\t\/\/ Drop the count on top of the label we drew above\n\t\t\t\thWinPosInfo = ui::DeferWindowPos(\n\t\t\t\t\thWinPosInfo,\n\t\t\t\t\tm_rightLabel.GetSafeHwnd(),\n\t\t\t\t\twidth - m_rightLabelWidth - actionButtonAndGutterWidth - m_iSideMargin - 1,\n\t\t\t\t\t1,\n\t\t\t\t\tm_rightLabelWidth,\n\t\t\t\t\tm_iLabelHeight,\n\t\t\t\t\tL\"PaneHeader::DeferWindowPos::rightLabel\");\n\t\t\t\tcmdShow = SW_SHOW;\n\t\t\t}\n\n\t\t\tWC_B_S(::ShowWindow(m_rightLabel.GetSafeHwnd(), cmdShow));\n\n\t\t\tif (!m_bCollapsed && m_nIDAction && m_actionButtonWidth)\n\t\t\t{\n\t\t\t\t\/\/ Drop the action button next to the label we drew above\n\t\t\t\thWinPosInfo = ui::DeferWindowPos(\n\t\t\t\t\thWinPosInfo,\n\t\t\t\t\tm_actionButton.GetSafeHwnd(),\n\t\t\t\t\twidth - actionButtonWidth,\n\t\t\t\t\t0,\n\t\t\t\t\tactionButtonWidth,\n\t\t\t\t\tm_iButtonHeight,\n\t\t\t\t\tL\"PaneHeader::DeferWindowPos::actionButton\");\n\t\t\t\tcmdShow = SW_SHOW;\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\tcmdShow = SW_HIDE;\n\t\t\t}\n\n\t\t\tWC_B_S(::ShowWindow(m_actionButton.GetSafeHwnd(), cmdShow));\n\n\t\t\toutput::DebugPrint(output::dbgLevel::Draw, L\"PaneHeader::DeferWindowPos end\\n\");\n\t\t\tEC_B_S(EndDeferWindowPos(hWinPosInfo));\n\t\t}\n\t}\n\n\tint PaneHeader::GetMinWidth()\n\t{\n\t\tauto cx = m_iLabelWidth;\n\t\tif (m_bCollapsible) cx += m_iButtonHeight;\n\t\tif (m_rightLabelWidth)\n\t\t{\n\t\t\tcx += m_iSideMargin * 2;\n\t\t\tcx += m_rightLabelWidth;\n\t\t}\n\n\t\tif (m_actionButtonWidth)\n\t\t{\n\t\t\tcx += m_iSideMargin;\n\t\t\tcx += m_actionButtonWidth + 2 * m_iMargin;\n\t\t}\n\n\t\treturn cx;\n\t}\n\n\tvoid PaneHeader::SetRightLabel(const std::wstring szLabel)\n\t{\n\t\tif (!m_bInitialized) return;\n\t\tEC_B_S(::SetWindowTextW(m_rightLabel.m_hWnd, szLabel.c_str()));\n\n\t\tconst auto hdc = ::GetDC(m_rightLabel.GetSafeHwnd());\n\t\tconst auto hfontOld = SelectObject(hdc, ui::GetSegoeFont());\n\t\tconst auto sizeText = ui::GetTextExtentPoint32(hdc, szLabel);\n\t\tstatic_cast<void>(SelectObject(hdc, hfontOld));\n\t\t::ReleaseDC(m_rightLabel.GetSafeHwnd(), hdc);\n\t\tm_rightLabelWidth = sizeText.cx;\n\n\t\tRecalcLayout();\n\t}\n\n\tvoid PaneHeader::SetActionButton(const std::wstring szActionButton)\n\t{\n\t\t\/\/ Don't bother if we never enabled the button\n\t\tif (m_nIDAction == 0) return;\n\n\t\tEC_B_S(::SetWindowTextW(m_actionButton.GetSafeHwnd(), szActionButton.c_str()));\n\n\t\tm_szActionButton = szActionButton;\n\t\tconst auto hdc = ::GetDC(m_actionButton.GetSafeHwnd());\n\t\tconst auto hfontOld = SelectObject(hdc, ui::GetSegoeFont());\n\t\tconst auto sizeText = ui::GetTextExtentPoint32(hdc, szActionButton);\n\t\tstatic_cast<void>(SelectObject(hdc, hfontOld));\n\t\t::ReleaseDC(m_actionButton.GetSafeHwnd(), hdc);\n\t\tm_actionButtonWidth = sizeText.cx;\n\n\t\tRecalcLayout();\n\t}\n\n\tbool PaneHeader::HandleChange(UINT nID)\n\t{\n\t\t\/\/ Collapse buttons have a nID IDD_COLLAPSE higher than nID of the pane they toggle.\n\t\t\/\/ So if we get asked about one that matches, we can assume it's time to toggle our collapse.\n\t\tif (m_nIDCollapse == nID)\n\t\t{\n\t\t\tOnToggleCollapse();\n\t\t\treturn true;\n\t\t}\n\n\t\treturn false;\n\t}\n\n\tvoid PaneHeader::OnToggleCollapse()\n\t{\n\t\tif (!m_bCollapsible) return;\n\t\tm_bCollapsed = !m_bCollapsed;\n\n\t\tStyleButton(m_CollapseButton.m_hWnd, m_bCollapsed ? ui::uiButtonStyle::UpArrow : ui::uiButtonStyle::DownArrow);\n\n\t\t\/\/ Trigger a redraw\n\t\t::PostMessage(m_hWndParent, WM_COMMAND, IDD_RECALCLAYOUT, NULL);\n\n\t\t\/\/ When we toggle because of VK_ENTER, we don't redraw - signal one just in case\n\t\t::RedrawWindow(m_CollapseButton.m_hWnd, nullptr, nullptr, RDW_INVALIDATE | RDW_UPDATENOW);\n\t}\n\n\tvoid PaneHeader::SetMargins(\n\t\tint iMargin,\n\t\tint iSideMargin,\n\t\tint iLabelHeight, \/\/ Height of the label\n\t\tint iSmallHeightMargin,\n\t\tint iButtonHeight) \/\/ Height of button\n\t{\n\t\tm_iMargin = iMargin;\n\t\tm_iSideMargin = iSideMargin;\n\t\tm_iLabelHeight = iLabelHeight;\n\t\tm_iSmallHeightMargin = iSmallHeightMargin;\n\t\tm_iButtonHeight = iButtonHeight;\n\t}\n\n\tbool PaneHeader::containsWindow(HWND hWnd) const noexcept\n\t{\n\t\tif (GetSafeHwnd() == hWnd) return true;\n\t\tif (m_leftLabel.GetSafeHwnd() == hWnd) return true;\n\t\tif (m_rightLabel.GetSafeHwnd() == hWnd) return true;\n\t\tif (m_actionButton.GetSafeHwnd() == hWnd) return true;\n\t\tif (m_CollapseButton.GetSafeHwnd() == hWnd) return true;\n\t\treturn false;\n\t}\n} \/\/ namespace controls<|endoftext|>"} {"text":"<commit_before>#include \"segment.h\"\n#include <algorithm>\n#include <cstdio>\n#include <cstdlib>\n#include \"size_types.h\"\n\nnamespace project {\n\nconst size_t Segment::kMaxCars = 5;\n\nSegment::Segment(size_t capacity, Segment* prev, int ready_percent,\n size_t num_junctions, size_t pass_limit)\n : capacity_(capacity),\n entrance_(new Junction(num_junctions, pass_limit)),\n next_(NULL),\n prev_(prev),\n ready_percent_(ready_percent) {\n size_t num_cars = std::min(capacity_, rand() % kMaxCars + 1);\n cars_.resize(num_cars);\n for (size_t i = 0; i < cars_.size(); ++i) {\n size_t exit = rand() % (num_junctions - entrance_->id() - 1) +\n entrance_->id() + 1;\n cars_[i] = new Car(exit, NULL);\n }\n Ready();\n}\n\nSegment::~Segment() {\n for (size_t i = 0; i < cars_.size(); ++i) {\n delete cars_[i];\n }\n delete entrance_;\n}\n\nvoid Segment::Enter() {\n size_t max_cars, ready_cars_before_pass = 0, num_passed_cars = 0;\n if (prev_ != NULL) {\n size_t num_cars_before_pass = cars_.size();\n ready_cars_before_pass = prev_->ready_cars().size();\n max_cars = capacity_ - cars_.size();\n prev_->Pass(max_cars);\n num_passed_cars = cars_.size() - num_cars_before_pass;\n }\n\n size_t cars_before_enter = entrance_->Cars().size();\n max_cars = capacity_ - cars_.size();\n std::vector<Car*> cars = entrance_->Operate(max_cars);\n if (cars.size() < cars_before_enter) {\n printf(\"Kathysteriseis stin eisodo tou komvou %\" PRIuS \"\\n\",\n entrance_->id());\n\n if (num_passed_cars < ready_cars_before_pass) {\n printf(\"Kathysteriseis meta ton komvo %\" PRIuS \"\\n\", entrance_->id());\n }\n } else {\n printf(\"Tireite tis apostaseis asfaleias sto tmima meta ton komvo %\" PRIuS\n \"\\n\", entrance_->id());\n }\n cars_.insert(cars_.end(), cars.begin(), cars.end());\n}\n\nvoid Segment::Exit() {\n for (size_t i = 0; i < cars_.size(); ++i) {\n if (cars_[i]->ready() && cars_[i]->exit() == entrance_->id() + 1) {\n delete cars_[i];\n cars_.erase(cars_.begin() + i);\n }\n }\n}\n\nvoid Segment::Operate() {\n Exit();\n Enter();\n Ready();\n for (std::vector<Car*>::reverse_iterator it = cars_.rbegin();\n it != cars_.rend(); ++it ) {\n if ((*it)->segment() != this) {\n (*it)->set_segment(this);\n } else {\n break;\n }\n }\n}\n\nvoid Segment::Pass(size_t max_cars) {\n size_t passed_cars = 0;\n for (size_t i = 0; i < cars_.size(); ++i) {\n if (passed_cars == max_cars) {\n break;\n }\n if (cars_[i]->ready() && cars_[i]->exit() != entrance_->id() + 1) {\n cars_[i]->set_ready(false);\n next_->cars_.push_back(cars_[i]);\n cars_.erase(cars_.begin() + i);\n ++passed_cars;\n }\n }\n}\n\nconst std::vector<Car*>& Segment::cars() const {\n return cars_;\n}\n\nsize_t Segment::num_cars() const {\n return cars_.size();\n}\n\nconst std::vector<Car*> Segment::ready_cars() const {\n std::vector<Car*> ret;\n for (size_t i = 0; i < cars_.size(); ++i) {\n if (cars_[i]->ready()) {\n ret.push_back(cars_[i]);\n }\n }\n return ret;\n}\n\nsize_t Segment::capacity() const {\n return capacity_;\n}\n\nsize_t Segment::entrance() const {\n return entrance_->id();\n}\n\nvoid Segment::set_next(Segment* next) {\n next_ = next;\n}\n\nvoid Segment::Ready() {\n std::random_shuffle(cars_.begin(), cars_.end());\n size_t num_new_ready = ready_percent_ * cars_.size() \/ 100;\n size_t num_changed_cars = 0;\n for (size_t i = 0; i < cars_.size(); ++i) {\n if (num_changed_cars == num_new_ready) {\n break;\n }\n if (!cars_[i]->ready()) {\n cars_[i]->set_ready(true);\n ++num_changed_cars;\n }\n }\n}\n\n} \/\/ namespace project\n<commit_msg>Style fixes<commit_after>#include \"segment.h\"\n#include <algorithm>\n#include <cstdio>\n#include <cstdlib>\n#include \"size_types.h\"\n\nnamespace project {\n\nconst size_t Segment::kMaxCars = 5;\n\nSegment::Segment(size_t capacity, Segment* prev, int ready_percent,\n size_t num_junctions, size_t pass_limit)\n : capacity_(capacity),\n entrance_(new Junction(num_junctions, pass_limit)),\n next_(NULL),\n prev_(prev),\n ready_percent_(ready_percent) {\n size_t num_cars = std::min(capacity_, rand() % kMaxCars + 1);\n cars_.resize(num_cars);\n for (size_t i = 0; i < cars_.size(); ++i) {\n size_t exit = rand() % (num_junctions - entrance_->id() - 1) +\n entrance_->id() + 1;\n cars_[i] = new Car(exit, NULL);\n }\n Ready();\n}\n\nSegment::~Segment() {\n for (size_t i = 0; i < cars_.size(); ++i) {\n delete cars_[i];\n }\n delete entrance_;\n}\n\nvoid Segment::Enter() {\n size_t max_cars, ready_cars_before_pass = 0, num_passed_cars = 0;\n if (prev_ != NULL) {\n size_t num_cars_before_pass = cars_.size();\n ready_cars_before_pass = prev_->ready_cars().size();\n max_cars = capacity_ - cars_.size();\n prev_->Pass(max_cars);\n num_passed_cars = cars_.size() - num_cars_before_pass;\n }\n\n size_t cars_before_enter = entrance_->Cars().size();\n max_cars = capacity_ - cars_.size();\n std::vector<Car*> cars = entrance_->Operate(max_cars);\n if (cars.size() < cars_before_enter) {\n printf(\"Kathysteriseis stin eisodo tou komvou %\" PRIuS \"\\n\",\n entrance_->id());\n\n if (num_passed_cars < ready_cars_before_pass) {\n printf(\"Kathysteriseis meta ton komvo %\" PRIuS \"\\n\", entrance_->id());\n }\n } else {\n printf(\"Tireite tis apostaseis asfaleias sto tmima meta ton komvo %\" PRIuS\n \"\\n\", entrance_->id());\n }\n cars_.insert(cars_.end(), cars.begin(), cars.end());\n}\n\nvoid Segment::Exit() {\n for (size_t i = 0; i < cars_.size(); ++i) {\n if (cars_[i]->ready() && cars_[i]->exit() == entrance_->id() + 1) {\n delete cars_[i];\n cars_.erase(cars_.begin() + i);\n }\n }\n}\n\nvoid Segment::Operate() {\n Exit();\n Enter();\n Ready();\n for (std::vector<Car*>::reverse_iterator it = cars_.rbegin();\n it != cars_.rend(); ++it) {\n if ((*it)->segment() = this) {\n break;\n }\n (*it)->set_segment(this);\n }\n}\n\nvoid Segment::Pass(size_t max_cars) {\n size_t passed_cars = 0;\n for (size_t i = 0; i < cars_.size(); ++i) {\n if (passed_cars == max_cars) {\n break;\n }\n if (cars_[i]->ready() && cars_[i]->exit() != entrance_->id() + 1) {\n cars_[i]->set_ready(false);\n next_->cars_.push_back(cars_[i]);\n cars_.erase(cars_.begin() + i);\n ++passed_cars;\n }\n }\n}\n\nconst std::vector<Car*>& Segment::cars() const {\n return cars_;\n}\n\nsize_t Segment::num_cars() const {\n return cars_.size();\n}\n\nconst std::vector<Car*> Segment::ready_cars() const {\n std::vector<Car*> ret;\n for (size_t i = 0; i < cars_.size(); ++i) {\n if (cars_[i]->ready()) {\n ret.push_back(cars_[i]);\n }\n }\n return ret;\n}\n\nsize_t Segment::capacity() const {\n return capacity_;\n}\n\nsize_t Segment::entrance() const {\n return entrance_->id();\n}\n\nvoid Segment::set_next(Segment* next) {\n next_ = next;\n}\n\nvoid Segment::Ready() {\n std::random_shuffle(cars_.begin(), cars_.end());\n size_t num_new_ready = ready_percent_ * cars_.size() \/ 100;\n size_t num_changed_cars = 0;\n for (size_t i = 0; i < cars_.size(); ++i) {\n if (num_changed_cars == num_new_ready) {\n break;\n }\n if (!cars_[i]->ready()) {\n cars_[i]->set_ready(true);\n ++num_changed_cars;\n }\n }\n}\n\n} \/\/ namespace project\n<|endoftext|>"} {"text":"<commit_before>\/*************************************************************************\/\n\/* editor_plugin_settings.cpp *\/\n\/*************************************************************************\/\n\/* This file is part of: *\/\n\/* GODOT ENGINE *\/\n\/* https:\/\/godotengine.org *\/\n\/*************************************************************************\/\n\/* Copyright (c) 2007-2019 Juan Linietsky, Ariel Manzur. *\/\n\/* Copyright (c) 2014-2019 Godot Engine contributors (cf. AUTHORS.md) *\/\n\/* *\/\n\/* Permission is hereby granted, free of charge, to any person obtaining *\/\n\/* a copy of this software and associated documentation files (the *\/\n\/* \"Software\"), to deal in the Software without restriction, including *\/\n\/* without limitation the rights to use, copy, modify, merge, publish, *\/\n\/* distribute, sublicense, and\/or sell copies of the Software, and to *\/\n\/* permit persons to whom the Software is furnished to do so, subject to *\/\n\/* the following conditions: *\/\n\/* *\/\n\/* The above copyright notice and this permission notice shall be *\/\n\/* included in all copies or substantial portions of the Software. *\/\n\/* *\/\n\/* THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, *\/\n\/* EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF *\/\n\/* MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT.*\/\n\/* IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY *\/\n\/* CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, *\/\n\/* TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE *\/\n\/* SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE. *\/\n\/*************************************************************************\/\n\n#include \"editor_plugin_settings.h\"\n\n#include \"core\/io\/config_file.h\"\n#include \"core\/os\/file_access.h\"\n#include \"core\/os\/main_loop.h\"\n#include \"core\/project_settings.h\"\n#include \"editor_node.h\"\n#include \"scene\/gui\/margin_container.h\"\n\nvoid EditorPluginSettings::_notification(int p_what) {\n\n\tif (p_what == MainLoop::NOTIFICATION_WM_FOCUS_IN) {\n\t\tupdate_plugins();\n\t} else if (p_what == Node::NOTIFICATION_READY) {\n\t\tplugin_config_dialog->connect(\"plugin_ready\", EditorNode::get_singleton(), \"_on_plugin_ready\");\n\t\tplugin_list->connect(\"button_pressed\", this, \"_cell_button_pressed\");\n\t}\n}\n\nvoid EditorPluginSettings::update_plugins() {\n\n\tplugin_list->clear();\n\n\tDirAccess *da = DirAccess::create(DirAccess::ACCESS_RESOURCES);\n\tError err = da->change_dir(\"res:\/\/addons\");\n\tif (err != OK) {\n\t\tmemdelete(da);\n\t\treturn;\n\t}\n\n\tupdating = true;\n\n\tTreeItem *root = plugin_list->create_item();\n\n\tda->list_dir_begin();\n\n\tString d = da->get_next();\n\n\tVector<String> plugins;\n\n\twhile (d != String()) {\n\n\t\tbool dir = da->current_is_dir();\n\t\tString path = \"res:\/\/addons\/\" + d + \"\/plugin.cfg\";\n\n\t\tif (dir && FileAccess::exists(path)) {\n\n\t\t\tplugins.push_back(d);\n\t\t}\n\n\t\td = da->get_next();\n\t}\n\n\tda->list_dir_end();\n\tmemdelete(da);\n\n\tplugins.sort();\n\n\tfor (int i = 0; i < plugins.size(); i++) {\n\n\t\tRef<ConfigFile> cf;\n\t\tcf.instance();\n\t\tString path = \"res:\/\/addons\/\" + plugins[i] + \"\/plugin.cfg\";\n\n\t\tError err2 = cf->load(path);\n\n\t\tif (err2 != OK) {\n\t\t\tWARN_PRINTS(\"Can't load plugin config: \" + path);\n\t\t} else if (!cf->has_section_key(\"plugin\", \"name\")) {\n\t\t\tWARN_PRINTS(\"Plugin misses plugin\/name: \" + path);\n\t\t} else if (!cf->has_section_key(\"plugin\", \"author\")) {\n\t\t\tWARN_PRINTS(\"Plugin misses plugin\/author: \" + path);\n\t\t} else if (!cf->has_section_key(\"plugin\", \"version\")) {\n\t\t\tWARN_PRINTS(\"Plugin misses plugin\/version: \" + path);\n\t\t} else if (!cf->has_section_key(\"plugin\", \"description\")) {\n\t\t\tWARN_PRINTS(\"Plugin misses plugin\/description: \" + path);\n\t\t} else if (!cf->has_section_key(\"plugin\", \"script\")) {\n\t\t\tWARN_PRINTS(\"Plugin misses plugin\/script: \" + path);\n\t\t} else {\n\n\t\t\tString d2 = plugins[i];\n\t\t\tString name = cf->get_value(\"plugin\", \"name\");\n\t\t\tString author = cf->get_value(\"plugin\", \"author\");\n\t\t\tString version = cf->get_value(\"plugin\", \"version\");\n\t\t\tString description = cf->get_value(\"plugin\", \"description\");\n\t\t\tString script = cf->get_value(\"plugin\", \"script\");\n\n\t\t\tTreeItem *item = plugin_list->create_item(root);\n\t\t\titem->set_text(0, name);\n\t\t\titem->set_tooltip(0, \"Name: \" + name + \"\\nPath: \" + path + \"\\nMain Script: \" + script + \"\\nDescription: \" + description);\n\t\t\titem->set_metadata(0, d2);\n\t\t\titem->set_text(1, version);\n\t\t\titem->set_metadata(1, script);\n\t\t\titem->set_text(2, author);\n\t\t\titem->set_metadata(2, description);\n\t\t\titem->set_cell_mode(3, TreeItem::CELL_MODE_RANGE);\n\t\t\titem->set_range_config(3, 0, 1, 1);\n\t\t\titem->set_text(3, \"Inactive,Active\");\n\t\t\titem->set_editable(3, true);\n\t\t\titem->add_button(4, get_icon(\"Edit\", \"EditorIcons\"), BUTTON_PLUGIN_EDIT, false, TTR(\"Edit Plugin\"));\n\n\t\t\tif (EditorNode::get_singleton()->is_addon_plugin_enabled(d2)) {\n\t\t\t\titem->set_custom_color(3, get_color(\"success_color\", \"Editor\"));\n\t\t\t\titem->set_range(3, 1);\n\t\t\t} else {\n\t\t\t\titem->set_custom_color(3, get_color(\"disabled_font_color\", \"Editor\"));\n\t\t\t\titem->set_range(3, 0);\n\t\t\t}\n\t\t}\n\t}\n\n\tupdating = false;\n}\n\nvoid EditorPluginSettings::_plugin_activity_changed() {\n\n\tif (updating)\n\t\treturn;\n\n\tTreeItem *ti = plugin_list->get_edited();\n\tERR_FAIL_COND(!ti);\n\tbool active = ti->get_range(3);\n\tString name = ti->get_metadata(0);\n\n\tEditorNode::get_singleton()->set_addon_plugin_enabled(name, active, true);\n\n\tbool is_active = EditorNode::get_singleton()->is_addon_plugin_enabled(name);\n\n\tif (is_active != active) {\n\t\tupdating = true;\n\t\tti->set_range(3, is_active ? 1 : 0);\n\t\tupdating = false;\n\t}\n\n\tif (is_active)\n\t\tti->set_custom_color(3, get_color(\"success_color\", \"Editor\"));\n\telse\n\t\tti->set_custom_color(3, get_color(\"disabled_font_color\", \"Editor\"));\n}\n\nvoid EditorPluginSettings::_create_clicked() {\n\tplugin_config_dialog->config(\"\");\n\tplugin_config_dialog->popup_centered();\n}\n\nvoid EditorPluginSettings::_cell_button_pressed(Object *p_item, int p_column, int p_id) {\n\tTreeItem *item = Object::cast_to<TreeItem>(p_item);\n\tif (!item)\n\t\treturn;\n\tif (p_id == BUTTON_PLUGIN_EDIT) {\n\t\tif (p_column == 4) {\n\t\t\tString dir = item->get_metadata(0);\n\t\t\tplugin_config_dialog->config(\"res:\/\/addons\/\" + dir + \"\/plugin.cfg\");\n\t\t\tplugin_config_dialog->popup_centered();\n\t\t}\n\t}\n}\n\nvoid EditorPluginSettings::_bind_methods() {\n\n\tClassDB::bind_method(\"update_plugins\", &EditorPluginSettings::update_plugins);\n\tClassDB::bind_method(\"_create_clicked\", &EditorPluginSettings::_create_clicked);\n\tClassDB::bind_method(\"_plugin_activity_changed\", &EditorPluginSettings::_plugin_activity_changed);\n\tClassDB::bind_method(\"_cell_button_pressed\", &EditorPluginSettings::_cell_button_pressed);\n}\n\nEditorPluginSettings::EditorPluginSettings() {\n\n\tplugin_config_dialog = memnew(PluginConfigDialog);\n\tplugin_config_dialog->config(\"\");\n\tadd_child(plugin_config_dialog);\n\n\tHBoxContainer *title_hb = memnew(HBoxContainer);\n\ttitle_hb->add_child(memnew(Label(TTR(\"Installed Plugins:\"))));\n\ttitle_hb->add_spacer();\n\tcreate_plugin = memnew(Button(TTR(\"Create\")));\n\tcreate_plugin->connect(\"pressed\", this, \"_create_clicked\");\n\ttitle_hb->add_child(create_plugin);\n\tupdate_list = memnew(Button(TTR(\"Update\")));\n\tupdate_list->connect(\"pressed\", this, \"update_plugins\");\n\ttitle_hb->add_child(update_list);\n\tadd_child(title_hb);\n\n\tplugin_list = memnew(Tree);\n\tplugin_list->set_v_size_flags(SIZE_EXPAND_FILL);\n\tplugin_list->set_columns(5);\n\tplugin_list->set_column_titles_visible(true);\n\tplugin_list->set_column_title(0, TTR(\"Name:\"));\n\tplugin_list->set_column_title(1, TTR(\"Version:\"));\n\tplugin_list->set_column_title(2, TTR(\"Author:\"));\n\tplugin_list->set_column_title(3, TTR(\"Status:\"));\n\tplugin_list->set_column_title(4, TTR(\"Edit:\"));\n\tplugin_list->set_column_expand(0, true);\n\tplugin_list->set_column_expand(1, false);\n\tplugin_list->set_column_expand(2, false);\n\tplugin_list->set_column_expand(3, false);\n\tplugin_list->set_column_expand(4, false);\n\tplugin_list->set_column_min_width(1, 100 * EDSCALE);\n\tplugin_list->set_column_min_width(2, 250 * EDSCALE);\n\tplugin_list->set_column_min_width(3, 80 * EDSCALE);\n\tplugin_list->set_column_min_width(4, 40 * EDSCALE);\n\tplugin_list->set_hide_root(true);\n\tplugin_list->connect(\"item_edited\", this, \"_plugin_activity_changed\");\n\n\tVBoxContainer *mc = memnew(VBoxContainer);\n\tmc->add_child(plugin_list);\n\tmc->set_v_size_flags(SIZE_EXPAND_FILL);\n\tmc->set_h_size_flags(SIZE_EXPAND_FILL);\n\n\tadd_child(mc);\n\n\tupdating = false;\n}\n<commit_msg>Warn about all missing keys in plugin.cfg<commit_after>\/*************************************************************************\/\n\/* editor_plugin_settings.cpp *\/\n\/*************************************************************************\/\n\/* This file is part of: *\/\n\/* GODOT ENGINE *\/\n\/* https:\/\/godotengine.org *\/\n\/*************************************************************************\/\n\/* Copyright (c) 2007-2019 Juan Linietsky, Ariel Manzur. *\/\n\/* Copyright (c) 2014-2019 Godot Engine contributors (cf. AUTHORS.md) *\/\n\/* *\/\n\/* Permission is hereby granted, free of charge, to any person obtaining *\/\n\/* a copy of this software and associated documentation files (the *\/\n\/* \"Software\"), to deal in the Software without restriction, including *\/\n\/* without limitation the rights to use, copy, modify, merge, publish, *\/\n\/* distribute, sublicense, and\/or sell copies of the Software, and to *\/\n\/* permit persons to whom the Software is furnished to do so, subject to *\/\n\/* the following conditions: *\/\n\/* *\/\n\/* The above copyright notice and this permission notice shall be *\/\n\/* included in all copies or substantial portions of the Software. *\/\n\/* *\/\n\/* THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, *\/\n\/* EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF *\/\n\/* MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT.*\/\n\/* IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY *\/\n\/* CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, *\/\n\/* TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE *\/\n\/* SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE. *\/\n\/*************************************************************************\/\n\n#include \"editor_plugin_settings.h\"\n\n#include \"core\/io\/config_file.h\"\n#include \"core\/os\/file_access.h\"\n#include \"core\/os\/main_loop.h\"\n#include \"core\/project_settings.h\"\n#include \"editor_node.h\"\n#include \"scene\/gui\/margin_container.h\"\n\nvoid EditorPluginSettings::_notification(int p_what) {\n\n\tif (p_what == MainLoop::NOTIFICATION_WM_FOCUS_IN) {\n\t\tupdate_plugins();\n\t} else if (p_what == Node::NOTIFICATION_READY) {\n\t\tplugin_config_dialog->connect(\"plugin_ready\", EditorNode::get_singleton(), \"_on_plugin_ready\");\n\t\tplugin_list->connect(\"button_pressed\", this, \"_cell_button_pressed\");\n\t}\n}\n\nvoid EditorPluginSettings::update_plugins() {\n\n\tplugin_list->clear();\n\n\tDirAccess *da = DirAccess::create(DirAccess::ACCESS_RESOURCES);\n\tError err = da->change_dir(\"res:\/\/addons\");\n\tif (err != OK) {\n\t\tmemdelete(da);\n\t\treturn;\n\t}\n\n\tupdating = true;\n\n\tTreeItem *root = plugin_list->create_item();\n\n\tda->list_dir_begin();\n\n\tString d = da->get_next();\n\n\tVector<String> plugins;\n\n\twhile (d != String()) {\n\n\t\tbool dir = da->current_is_dir();\n\t\tString path = \"res:\/\/addons\/\" + d + \"\/plugin.cfg\";\n\n\t\tif (dir && FileAccess::exists(path)) {\n\n\t\t\tplugins.push_back(d);\n\t\t}\n\n\t\td = da->get_next();\n\t}\n\n\tda->list_dir_end();\n\tmemdelete(da);\n\n\tplugins.sort();\n\n\tfor (int i = 0; i < plugins.size(); i++) {\n\n\t\tRef<ConfigFile> cf;\n\t\tcf.instance();\n\t\tString path = \"res:\/\/addons\/\" + plugins[i] + \"\/plugin.cfg\";\n\n\t\tError err2 = cf->load(path);\n\n\t\tif (err2 != OK) {\n\t\t\tWARN_PRINTS(\"Can't load plugin config: \" + path);\n\t\t} else {\n\t\t\tbool key_missing = false;\n\n\t\t\tif (!cf->has_section_key(\"plugin\", \"name\")) {\n\t\t\t\tWARN_PRINTS(\"Plugin config misses \\\"plugin\/name\\\" key: \" + path);\n\t\t\t\tkey_missing = true;\n\t\t\t}\n\t\t\tif (!cf->has_section_key(\"plugin\", \"author\")) {\n\t\t\t\tWARN_PRINTS(\"Plugin config misses \\\"plugin\/author\\\" key: \" + path);\n\t\t\t\tkey_missing = true;\n\t\t\t}\n\t\t\tif (!cf->has_section_key(\"plugin\", \"version\")) {\n\t\t\t\tWARN_PRINTS(\"Plugin config misses \\\"plugin\/version\\\" key: \" + path);\n\t\t\t\tkey_missing = true;\n\t\t\t}\n\t\t\tif (!cf->has_section_key(\"plugin\", \"description\")) {\n\t\t\t\tWARN_PRINTS(\"Plugin config misses \\\"plugin\/description\\\" key: \" + path);\n\t\t\t\tkey_missing = true;\n\t\t\t}\n\t\t\tif (!cf->has_section_key(\"plugin\", \"script\")) {\n\t\t\t\tWARN_PRINTS(\"Plugin config misses \\\"plugin\/script\\\" key: \" + path);\n\t\t\t\tkey_missing = true;\n\t\t\t}\n\n\t\t\tif (!key_missing) {\n\t\t\t\tString d2 = plugins[i];\n\t\t\t\tString name = cf->get_value(\"plugin\", \"name\");\n\t\t\t\tString author = cf->get_value(\"plugin\", \"author\");\n\t\t\t\tString version = cf->get_value(\"plugin\", \"version\");\n\t\t\t\tString description = cf->get_value(\"plugin\", \"description\");\n\t\t\t\tString script = cf->get_value(\"plugin\", \"script\");\n\n\t\t\t\tTreeItem *item = plugin_list->create_item(root);\n\t\t\t\titem->set_text(0, name);\n\t\t\t\titem->set_tooltip(0, TTR(\"Name:\") + \" \" + name + \"\\n\" + TTR(\"Path:\") + \" \" + path + \"\\n\" + TTR(\"Main Script:\") + \" \" + script + \"\\n\" + TTR(\"Description:\") + \" \" + description);\n\t\t\t\titem->set_metadata(0, d2);\n\t\t\t\titem->set_text(1, version);\n\t\t\t\titem->set_metadata(1, script);\n\t\t\t\titem->set_text(2, author);\n\t\t\t\titem->set_metadata(2, description);\n\t\t\t\titem->set_cell_mode(3, TreeItem::CELL_MODE_RANGE);\n\t\t\t\titem->set_range_config(3, 0, 1, 1);\n\t\t\t\titem->set_text(3, \"Inactive,Active\");\n\t\t\t\titem->set_editable(3, true);\n\t\t\t\titem->add_button(4, get_icon(\"Edit\", \"EditorIcons\"), BUTTON_PLUGIN_EDIT, false, TTR(\"Edit Plugin\"));\n\n\t\t\t\tif (EditorNode::get_singleton()->is_addon_plugin_enabled(d2)) {\n\t\t\t\t\titem->set_custom_color(3, get_color(\"success_color\", \"Editor\"));\n\t\t\t\t\titem->set_range(3, 1);\n\t\t\t\t} else {\n\t\t\t\t\titem->set_custom_color(3, get_color(\"disabled_font_color\", \"Editor\"));\n\t\t\t\t\titem->set_range(3, 0);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\n\tupdating = false;\n}\n\nvoid EditorPluginSettings::_plugin_activity_changed() {\n\n\tif (updating)\n\t\treturn;\n\n\tTreeItem *ti = plugin_list->get_edited();\n\tERR_FAIL_COND(!ti);\n\tbool active = ti->get_range(3);\n\tString name = ti->get_metadata(0);\n\n\tEditorNode::get_singleton()->set_addon_plugin_enabled(name, active, true);\n\n\tbool is_active = EditorNode::get_singleton()->is_addon_plugin_enabled(name);\n\n\tif (is_active != active) {\n\t\tupdating = true;\n\t\tti->set_range(3, is_active ? 1 : 0);\n\t\tupdating = false;\n\t}\n\n\tif (is_active)\n\t\tti->set_custom_color(3, get_color(\"success_color\", \"Editor\"));\n\telse\n\t\tti->set_custom_color(3, get_color(\"disabled_font_color\", \"Editor\"));\n}\n\nvoid EditorPluginSettings::_create_clicked() {\n\tplugin_config_dialog->config(\"\");\n\tplugin_config_dialog->popup_centered();\n}\n\nvoid EditorPluginSettings::_cell_button_pressed(Object *p_item, int p_column, int p_id) {\n\tTreeItem *item = Object::cast_to<TreeItem>(p_item);\n\tif (!item)\n\t\treturn;\n\tif (p_id == BUTTON_PLUGIN_EDIT) {\n\t\tif (p_column == 4) {\n\t\t\tString dir = item->get_metadata(0);\n\t\t\tplugin_config_dialog->config(\"res:\/\/addons\/\" + dir + \"\/plugin.cfg\");\n\t\t\tplugin_config_dialog->popup_centered();\n\t\t}\n\t}\n}\n\nvoid EditorPluginSettings::_bind_methods() {\n\n\tClassDB::bind_method(\"update_plugins\", &EditorPluginSettings::update_plugins);\n\tClassDB::bind_method(\"_create_clicked\", &EditorPluginSettings::_create_clicked);\n\tClassDB::bind_method(\"_plugin_activity_changed\", &EditorPluginSettings::_plugin_activity_changed);\n\tClassDB::bind_method(\"_cell_button_pressed\", &EditorPluginSettings::_cell_button_pressed);\n}\n\nEditorPluginSettings::EditorPluginSettings() {\n\n\tplugin_config_dialog = memnew(PluginConfigDialog);\n\tplugin_config_dialog->config(\"\");\n\tadd_child(plugin_config_dialog);\n\n\tHBoxContainer *title_hb = memnew(HBoxContainer);\n\ttitle_hb->add_child(memnew(Label(TTR(\"Installed Plugins:\"))));\n\ttitle_hb->add_spacer();\n\tcreate_plugin = memnew(Button(TTR(\"Create\")));\n\tcreate_plugin->connect(\"pressed\", this, \"_create_clicked\");\n\ttitle_hb->add_child(create_plugin);\n\tupdate_list = memnew(Button(TTR(\"Update\")));\n\tupdate_list->connect(\"pressed\", this, \"update_plugins\");\n\ttitle_hb->add_child(update_list);\n\tadd_child(title_hb);\n\n\tplugin_list = memnew(Tree);\n\tplugin_list->set_v_size_flags(SIZE_EXPAND_FILL);\n\tplugin_list->set_columns(5);\n\tplugin_list->set_column_titles_visible(true);\n\tplugin_list->set_column_title(0, TTR(\"Name:\"));\n\tplugin_list->set_column_title(1, TTR(\"Version:\"));\n\tplugin_list->set_column_title(2, TTR(\"Author:\"));\n\tplugin_list->set_column_title(3, TTR(\"Status:\"));\n\tplugin_list->set_column_title(4, TTR(\"Edit:\"));\n\tplugin_list->set_column_expand(0, true);\n\tplugin_list->set_column_expand(1, false);\n\tplugin_list->set_column_expand(2, false);\n\tplugin_list->set_column_expand(3, false);\n\tplugin_list->set_column_expand(4, false);\n\tplugin_list->set_column_min_width(1, 100 * EDSCALE);\n\tplugin_list->set_column_min_width(2, 250 * EDSCALE);\n\tplugin_list->set_column_min_width(3, 80 * EDSCALE);\n\tplugin_list->set_column_min_width(4, 40 * EDSCALE);\n\tplugin_list->set_hide_root(true);\n\tplugin_list->connect(\"item_edited\", this, \"_plugin_activity_changed\");\n\n\tVBoxContainer *mc = memnew(VBoxContainer);\n\tmc->add_child(plugin_list);\n\tmc->set_v_size_flags(SIZE_EXPAND_FILL);\n\tmc->set_h_size_flags(SIZE_EXPAND_FILL);\n\n\tadd_child(mc);\n\n\tupdating = false;\n}\n<|endoftext|>"} {"text":"<commit_before>\/*=========================================================================\n\n Program: KWSys - Kitware System Library\n Module: testDynamicLoader.cxx\n\n Copyright (c) Kitware, Inc., Insight Consortium. All rights reserved.\n See Copyright.txt or http:\/\/www.kitware.com\/Copyright.htm for details.\n\n This software is distributed WITHOUT ANY WARRANTY; without even\n the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR\n PURPOSE. See the above copyright notices for more information.\n\n=========================================================================*\/\n#include \"kwsysPrivate.h\"\n\n#include KWSYS_HEADER(DynamicLoader.hxx)\n#include KWSYS_HEADER(ios\/iostream)\n#include KWSYS_HEADER(stl\/string)\n\n\/\/ Work-around CMake dependency scanning limitation. This must\n\/\/ duplicate the above list of headers.\n#if 0\n# include \"DynamicLoader.hxx.in\"\n# include \"kwsys_ios_iostream.h.in\"\n# include \"kwsys_stl_string.hxx.in\"\n#endif\n\n#include \"testSystemTools.h\"\n\nkwsys_stl::string GetLibName(const char* lname)\n{\n \/\/ Construct proper name of lib\n kwsys_stl::string slname;\n slname = EXECUTABLE_OUTPUT_PATH;\n#ifdef CMAKE_INTDIR\n slname += \"\/\";\n slname += CMAKE_INTDIR;\n#endif\n slname += \"\/\";\n slname += kwsys::DynamicLoader::LibPrefix();\n slname += lname;\n slname += kwsys::DynamicLoader::LibExtension();\n\n return slname;\n}\n\n\/* libname = Library name (proper prefix, proper extension)\n * System = symbol to lookup in libname\n * r1: should OpenLibrary succeed ?\n * r2: should GetSymbolAddress succeed ?\n * r3: should CloseLibrary succeed ?\n *\/\nint TestDynamicLoader(const char* libname, const char* symbol, int r1, int r2, int r3)\n{\n kwsys_ios::cerr << \"Testing: \" << libname << kwsys_ios::endl;\n kwsys::LibHandle l = kwsys::DynamicLoader::OpenLibrary(libname);\n \/\/ If result is incompatible with expectation just fails (xor):\n if( (r1 && !l) || (!r1 && l) )\n {\n kwsys_ios::cerr\n << kwsys::DynamicLoader::LastError() << kwsys_ios::endl;\n return 1;\n }\n kwsys::DynamicLoaderFunction f = kwsys::DynamicLoader::GetSymbolAddress(l, symbol);\n if( (r2 && !f) || (!r2 && f) )\n {\n kwsys_ios::cerr\n << kwsys::DynamicLoader::LastError() << kwsys_ios::endl;\n return 1;\n }\n int s = kwsys::DynamicLoader::CloseLibrary(l);\n if( (r3 && !s) || (!r3 && s) )\n {\n kwsys_ios::cerr\n << kwsys::DynamicLoader::LastError() << kwsys_ios::endl;\n return 1;\n }\n return 0;\n}\n\nint main(int , char *[])\n{\n int res;\n \/\/ Make sure that inexistant lib is giving correct result\n res = TestDynamicLoader(\"azerty_\", \"foo_bar\",0,0,0);\n \/\/ Make sure that random binary file cannnot be assimilated as dylib\n res += TestDynamicLoader(TEST_SYSTEMTOOLS_BIN_FILE, \"wp\",0,0,0);\n#ifdef __linux__\n \/\/ This one is actually fun to test, since dlopen is by default loaded...wonder why :)\n res += TestDynamicLoader(\"foobar.lib\", \"dlopen\",0,1,0);\n res += TestDynamicLoader(\"libdl.so\", \"dlopen\",1,1,1);\n res += TestDynamicLoader(\"libdl.so\", \"TestDynamicLoader\",1,0,1);\n#endif\n \/\/ Now try on the generated library\n kwsys_stl::string libname = GetLibName(\"testDynload\");\n res += TestDynamicLoader(libname.c_str(), \"dummy\",1,0,1);\n res += TestDynamicLoader(libname.c_str(), \"TestDynamicLoaderFunction\",1,1,1);\n res += TestDynamicLoader(libname.c_str(), \"_TestDynamicLoaderFunction\",1,0,1);\n res += TestDynamicLoader(libname.c_str(), \"TestDynamicLoaderData\",1,1,1);\n res += TestDynamicLoader(libname.c_str(), \"_TestDynamicLoaderData\",1,0,1);\n\n return res;\n}\n<commit_msg>ENH: Make test usable from command line<commit_after>\/*=========================================================================\n\n Program: KWSys - Kitware System Library\n Module: testDynamicLoader.cxx\n\n Copyright (c) Kitware, Inc., Insight Consortium. All rights reserved.\n See Copyright.txt or http:\/\/www.kitware.com\/Copyright.htm for details.\n\n This software is distributed WITHOUT ANY WARRANTY; without even\n the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR\n PURPOSE. See the above copyright notices for more information.\n\n=========================================================================*\/\n#include \"kwsysPrivate.h\"\n\n#include KWSYS_HEADER(DynamicLoader.hxx)\n#include KWSYS_HEADER(ios\/iostream)\n#include KWSYS_HEADER(stl\/string)\n\n\/\/ Work-around CMake dependency scanning limitation. This must\n\/\/ duplicate the above list of headers.\n#if 0\n# include \"DynamicLoader.hxx.in\"\n# include \"kwsys_ios_iostream.h.in\"\n# include \"kwsys_stl_string.hxx.in\"\n#endif\n\n#include \"testSystemTools.h\"\n\nkwsys_stl::string GetLibName(const char* lname)\n{\n \/\/ Construct proper name of lib\n kwsys_stl::string slname;\n slname = EXECUTABLE_OUTPUT_PATH;\n#ifdef CMAKE_INTDIR\n slname += \"\/\";\n slname += CMAKE_INTDIR;\n#endif\n slname += \"\/\";\n slname += kwsys::DynamicLoader::LibPrefix();\n slname += lname;\n slname += kwsys::DynamicLoader::LibExtension();\n\n return slname;\n}\n\n\/* libname = Library name (proper prefix, proper extension)\n * System = symbol to lookup in libname\n * r1: should OpenLibrary succeed ?\n * r2: should GetSymbolAddress succeed ?\n * r3: should CloseLibrary succeed ?\n *\/\nint TestDynamicLoader(const char* libname, const char* symbol, int r1, int r2, int r3)\n{\n kwsys_ios::cerr << \"Testing: \" << libname << kwsys_ios::endl;\n kwsys::LibHandle l = kwsys::DynamicLoader::OpenLibrary(libname);\n \/\/ If result is incompatible with expectation just fails (xor):\n if( (r1 && !l) || (!r1 && l) )\n {\n kwsys_ios::cerr\n << kwsys::DynamicLoader::LastError() << kwsys_ios::endl;\n return 1;\n }\n kwsys::DynamicLoaderFunction f = kwsys::DynamicLoader::GetSymbolAddress(l, symbol);\n if( (r2 && !f) || (!r2 && f) )\n {\n kwsys_ios::cerr\n << kwsys::DynamicLoader::LastError() << kwsys_ios::endl;\n return 1;\n }\n int s = kwsys::DynamicLoader::CloseLibrary(l);\n if( (r3 && !s) || (!r3 && s) )\n {\n kwsys_ios::cerr\n << kwsys::DynamicLoader::LastError() << kwsys_ios::endl;\n return 1;\n }\n return 0;\n}\n\nint main(int argc, char *argv[])\n{\n int res;\n if( argc == 3 )\n {\n \/\/ User specify a libname and symbol to check.\n res = TestDynamicLoader(argv[1], argv[2],1,1,1);\n return res;\n }\n \/\/ Make sure that inexistant lib is giving correct result\n res = TestDynamicLoader(\"azerty_\", \"foo_bar\",0,0,0);\n \/\/ Make sure that random binary file cannnot be assimilated as dylib\n res += TestDynamicLoader(TEST_SYSTEMTOOLS_BIN_FILE, \"wp\",0,0,0);\n#ifdef __linux__\n \/\/ This one is actually fun to test, since dlopen is by default loaded...wonder why :)\n res += TestDynamicLoader(\"foobar.lib\", \"dlopen\",0,1,0);\n res += TestDynamicLoader(\"libdl.so\", \"dlopen\",1,1,1);\n res += TestDynamicLoader(\"libdl.so\", \"TestDynamicLoader\",1,0,1);\n#endif\n \/\/ Now try on the generated library\n kwsys_stl::string libname = GetLibName(\"testDynload\");\n res += TestDynamicLoader(libname.c_str(), \"dummy\",1,0,1);\n res += TestDynamicLoader(libname.c_str(), \"TestDynamicLoaderFunction\",1,1,1);\n res += TestDynamicLoader(libname.c_str(), \"_TestDynamicLoaderFunction\",1,0,1);\n res += TestDynamicLoader(libname.c_str(), \"TestDynamicLoaderData\",1,1,1);\n res += TestDynamicLoader(libname.c_str(), \"_TestDynamicLoaderData\",1,0,1);\n\n return res;\n}\n<|endoftext|>"} {"text":"<commit_before>\/*\n * CameraParamsTileRectOverride.cpp\n *\n * Copyright (C) 2006 - 2007 by Universitaet Stuttgart (VIS). \n * Alle Rechte vorbehalten.\n * Copyright (C) 2007, Sebastian Grottel. All rights reserved.\n *\/\n\n#include \"vislib\/graphics\/CameraParamsTileRectOverride.h\"\n#include \"vislib\/assert.h\"\n#include \"vislib\/math\/mathfunctions.h\"\n\n\n\/*\n * vislib::graphics::CameraParamsTileRectOverride::CameraParamsTileRectOverride\n *\/\nvislib::graphics::CameraParamsTileRectOverride::CameraParamsTileRectOverride(void)\n : CameraParamsOverride(), fullSize(true), tileRect() {\n}\n\n\n\/*\n * vislib::graphics::CameraParamsTileRectOverride::CameraParamsTileRectOverride\n *\/\nvislib::graphics::CameraParamsTileRectOverride::CameraParamsTileRectOverride(\n const vislib::SmartPtr<vislib::graphics::CameraParameters>& params)\n : CameraParamsOverride(params), fullSize(true), tileRect(params->TileRect()) {\n this->fullSize = (math::IsEqual(this->tileRect.GetLeft(), 0.0f)\n && math::IsEqual(this->tileRect.GetBottom(), 0.0f)\n && math::IsEqual(this->tileRect.GetRight(), params->VirtualViewSize().Width())\n && math::IsEqual(this->tileRect.GetTop(), params->VirtualViewSize().Height()));\n this->indicateValueChange();\n}\n\n\n\/*\n * vislib::graphics::CameraParamsTileRectOverride::~CameraParamsTileRectOverride\n *\/\nvislib::graphics::CameraParamsTileRectOverride::~CameraParamsTileRectOverride(void) {\n}\n\n\n\/*\n * vislib::graphics::CameraParamsTileRectOverride::ResetTileRect\n *\/\nvoid vislib::graphics::CameraParamsTileRectOverride::ResetTileRect(void) {\n ASSERT(!this->paramsBase().IsNull());\n this->fullSize = true;\n this->tileRect.SetNull();\n this->tileRect.SetSize(this->paramsBase()->VirtualViewSize());\n this->indicateValueChange();\n}\n\n\n\/*\n * vislib::graphics::CameraParamsTileRectOverride::SetTileRect\n *\/\nvoid vislib::graphics::CameraParamsTileRectOverride::SetTileRect(\n const vislib::math::Rectangle<vislib::graphics::ImageSpaceType>& tileRect) {\n ASSERT(!this->paramsBase().IsNull());\n this->tileRect = tileRect;\n this->fullSize = (math::IsEqual(this->tileRect.GetLeft(), 0.0f)\n && math::IsEqual(this->tileRect.GetBottom(), 0.0f)\n && math::IsEqual(this->tileRect.GetRight(), this->paramsBase()->VirtualViewSize().Width())\n && math::IsEqual(this->tileRect.GetTop(), this->paramsBase()->VirtualViewSize().Height()));\n this->indicateValueChange();\n}\n\n\n\/*\n * vislib::graphics::CameraParamsTileRectOverride::TileRect\n *\/\nconst vislib::math::Rectangle<vislib::graphics::ImageSpaceType>& \nvislib::graphics::CameraParamsTileRectOverride::TileRect(void) const {\n ASSERT(!this->paramsBase().IsNull());\n if (this->fullSize) {\n this->tileRect.SetNull();\n this->tileRect.SetSize(this->paramsBase()->VirtualViewSize());\n }\n return this->tileRect;\n}\n\n\n\/*\n * vislib::graphics::CameraParamsTileRectOverride::operator=\n *\/\nvislib::graphics::CameraParamsTileRectOverride& \nvislib::graphics::CameraParamsTileRectOverride::operator=(\n const vislib::graphics::CameraParamsTileRectOverride& rhs) {\n CameraParamsOverride::operator=(rhs);\n this->tileRect = rhs.tileRect;\n this->fullSize = rhs.fullSize;\n this->indicateValueChange();\n return *this;\n}\n\n\n\/*\n * vislib::graphics::CameraParamsTileRectOverride::operator==\n *\/\nbool vislib::graphics::CameraParamsTileRectOverride::operator==(\n const vislib::graphics::CameraParamsTileRectOverride& rhs) const {\n return (CameraParamsOverride::operator==(rhs)\n && (this->tileRect == rhs.tileRect) \n && (this->fullSize == rhs.fullSize));\n}\n\n\n\/*\n * vislib::graphics::CameraParamsTileRectOverride::preBaseSet\n *\/\nvoid vislib::graphics::CameraParamsTileRectOverride::preBaseSet(\n const SmartPtr<CameraParameters>& params) {\n if (params.IsNull()) {\n return;\n }\n\n if (this->fullSize) {\n this->tileRect.SetNull();\n this->tileRect.SetSize(params->VirtualViewSize());\n this->indicateValueChange();\n\n } else if (!this->paramsBase().IsNull()) {\n \/\/ scale the tile from the old view size to the new view size and hope\n \/\/ that the caller will set a tile making more sense.\n ImageSpaceType scaleX = params->VirtualViewSize().Width() \n \/ this->paramsBase()->VirtualViewSize().Width();\n ImageSpaceType scaleY = params->VirtualViewSize().Height() \n \/ this->paramsBase()->VirtualViewSize().Height();\n this->tileRect.Set(this->tileRect.Left() * scaleX,\n this->tileRect.Bottom() * scaleY,\n this->tileRect.Right() * scaleX,\n this->tileRect.Top() * scaleY);\n this->indicateValueChange();\n }\n}\n\n\n\/*\n * vislib::graphics::CameraParamsTileRectOverride::resetOverride\n *\/\nvoid vislib::graphics::CameraParamsTileRectOverride::resetOverride(void) {\n ASSERT(!this->paramsBase().IsNull());\n this->tileRect = this->paramsBase()->TileRect();\n this->fullSize = (math::IsEqual(this->tileRect.GetLeft(), 0.0f)\n && math::IsEqual(this->tileRect.GetBottom(), 0.0f)\n && math::IsEqual(this->tileRect.GetRight(), \n this->paramsBase()->VirtualViewSize().Width())\n && math::IsEqual(this->tileRect.GetTop(), \n this->paramsBase()->VirtualViewSize().Height()));\n this->indicateValueChange();\n}\n<commit_msg>assign_and_sync in CameraParamsTileRectOverride<commit_after>\/*\n * CameraParamsTileRectOverride.cpp\n *\n * Copyright (C) 2006 - 2007 by Universitaet Stuttgart (VIS). \n * Alle Rechte vorbehalten.\n * Copyright (C) 2007, Sebastian Grottel. All rights reserved.\n *\/\n\n#include \"vislib\/graphics\/CameraParamsTileRectOverride.h\"\n#include \"vislib\/assert.h\"\n#include \"vislib\/math\/mathfunctions.h\"\n\n\n\/*\n * vislib::graphics::CameraParamsTileRectOverride::CameraParamsTileRectOverride\n *\/\nvislib::graphics::CameraParamsTileRectOverride::CameraParamsTileRectOverride(void)\n : CameraParamsOverride(), fullSize(true), tileRect() {\n}\n\n\n\/*\n * vislib::graphics::CameraParamsTileRectOverride::CameraParamsTileRectOverride\n *\/\nvislib::graphics::CameraParamsTileRectOverride::CameraParamsTileRectOverride(\n const vislib::SmartPtr<vislib::graphics::CameraParameters>& params)\n : CameraParamsOverride(params), fullSize(true), tileRect(params->TileRect()) {\n this->fullSize = (math::IsEqual(this->tileRect.GetLeft(), 0.0f)\n && math::IsEqual(this->tileRect.GetBottom(), 0.0f)\n && math::IsEqual(this->tileRect.GetRight(), params->VirtualViewSize().Width())\n && math::IsEqual(this->tileRect.GetTop(), params->VirtualViewSize().Height()));\n this->indicateValueChange();\n}\n\n\n\/*\n * vislib::graphics::CameraParamsTileRectOverride::~CameraParamsTileRectOverride\n *\/\nvislib::graphics::CameraParamsTileRectOverride::~CameraParamsTileRectOverride(void) {\n}\n\n\n\/*\n * vislib::graphics::CameraParamsTileRectOverride::ResetTileRect\n *\/\nvoid vislib::graphics::CameraParamsTileRectOverride::ResetTileRect(void) {\n ASSERT(!this->paramsBase().IsNull());\n assign_and_sync(this->fullSize, true);\n if (this->TileRect().Width() != this->paramsBase()->VirtualViewSize().Width() ||\n this->TileRect().Height() != this->paramsBase()->VirtualViewSize().Height()) {\n this->tileRect.SetNull();\n this->tileRect.SetSize(this->paramsBase()->VirtualViewSize());\n this->indicateValueChange();\n }\n}\n\n\n\/*\n * vislib::graphics::CameraParamsTileRectOverride::SetTileRect\n *\/\nvoid vislib::graphics::CameraParamsTileRectOverride::SetTileRect(\n const vislib::math::Rectangle<vislib::graphics::ImageSpaceType>& tileRect) {\n ASSERT(!this->paramsBase().IsNull());\n assign_and_sync(this->tileRect, tileRect);\n assign_and_sync(this->fullSize, (math::IsEqual(this->tileRect.GetLeft(), 0.0f)\n && math::IsEqual(this->tileRect.GetBottom(), 0.0f)\n && math::IsEqual(this->tileRect.GetRight(), this->paramsBase()->VirtualViewSize().Width())\n && math::IsEqual(this->tileRect.GetTop(), this->paramsBase()->VirtualViewSize().Height())));\n}\n\n\n\/*\n * vislib::graphics::CameraParamsTileRectOverride::TileRect\n *\/\nconst vislib::math::Rectangle<vislib::graphics::ImageSpaceType>& \nvislib::graphics::CameraParamsTileRectOverride::TileRect(void) const {\n ASSERT(!this->paramsBase().IsNull());\n if (this->fullSize) {\n if (this->tileRect.Width() != this->paramsBase()->VirtualViewSize().Width() ||\n this->tileRect.Height() != this->paramsBase()->VirtualViewSize().Height()) {\n this->tileRect.SetNull();\n this->tileRect.SetSize(this->paramsBase()->VirtualViewSize());\n this->indicateValueChange_Const();\n }\n }\n return this->tileRect;\n}\n\n\n\/*\n * vislib::graphics::CameraParamsTileRectOverride::operator=\n *\/\nvislib::graphics::CameraParamsTileRectOverride& \nvislib::graphics::CameraParamsTileRectOverride::operator=(\n const vislib::graphics::CameraParamsTileRectOverride& rhs) {\n CameraParamsOverride::operator=(rhs);\n this->tileRect = rhs.tileRect;\n this->fullSize = rhs.fullSize;\n this->indicateValueChange();\n return *this;\n}\n\n\n\/*\n * vislib::graphics::CameraParamsTileRectOverride::operator==\n *\/\nbool vislib::graphics::CameraParamsTileRectOverride::operator==(\n const vislib::graphics::CameraParamsTileRectOverride& rhs) const {\n return (CameraParamsOverride::operator==(rhs)\n && (this->tileRect == rhs.tileRect) \n && (this->fullSize == rhs.fullSize));\n}\n\n\n\/*\n * vislib::graphics::CameraParamsTileRectOverride::preBaseSet\n *\/\nvoid vislib::graphics::CameraParamsTileRectOverride::preBaseSet(\n const SmartPtr<CameraParameters>& params) {\n if (params.IsNull()) {\n return;\n }\n\n if (this->fullSize) {\n if (this->tileRect.Width() != params->VirtualViewSize().Width() ||\n this->tileRect.Height() != params->VirtualViewSize().Height()) {\n this->tileRect.SetNull();\n this->tileRect.SetSize(params->VirtualViewSize());\n this->indicateValueChange();\n }\n\n } else if (!this->paramsBase().IsNull()) {\n \/\/ scale the tile from the old view size to the new view size and hope\n \/\/ that the caller will set a tile making more sense.\n ImageSpaceType const scaleX = params->VirtualViewSize().Width() \n \/ this->paramsBase()->VirtualViewSize().Width();\n ImageSpaceType const scaleY = params->VirtualViewSize().Height() \n \/ this->paramsBase()->VirtualViewSize().Height();\n if (!vislib::math::almost_equal(scaleX, static_cast<ImageSpaceType>(1.0f)) ||\n !vislib::math::almost_equal(scaleY, static_cast<ImageSpaceType>(1.0f))) {\n this->tileRect.Set(this->tileRect.Left() * scaleX, this->tileRect.Bottom() * scaleY,\n this->tileRect.Right() * scaleX, this->tileRect.Top() * scaleY);\n this->indicateValueChange();\n }\n }\n}\n\n\n\/*\n * vislib::graphics::CameraParamsTileRectOverride::resetOverride\n *\/\nvoid vislib::graphics::CameraParamsTileRectOverride::resetOverride(void) {\n ASSERT(!this->paramsBase().IsNull());\n assign_and_sync(this->tileRect, this->paramsBase()->TileRect());\n assign_and_sync(this->fullSize, (math::IsEqual(this->tileRect.GetLeft(), 0.0f)\n && math::IsEqual(this->tileRect.GetBottom(), 0.0f)\n && math::IsEqual(this->tileRect.GetRight(), \n this->paramsBase()->VirtualViewSize().Width())\n && math::IsEqual(this->tileRect.GetTop(), \n this->paramsBase()->VirtualViewSize().Height())));\n}\n<|endoftext|>"} {"text":"<commit_before>\/\/ Windowmenu.cc for Fluxbox\n\/\/ Copyright (c) 2001-2002 Henrik Kinnunen (fluxgen@linuxmail.org)\n\/\/ Windowmenu.cc for Blackbox - an X11 Window manager\n\/\/ Copyright (c) 1997 - 2000 Brad Hughes (bhughes@tcac.net)\n\/\/\n\/\/ Permission is hereby granted, free of charge, to any person obtaining a\n\/\/ copy of this software and associated documentation files (the \"Software\"),\n\/\/ to deal in the Software without restriction, including without limitation\n\/\/ the rights to use, copy, modify, merge, publish, distribute, sublicense,\n\/\/ and\/or sell copies of the Software, and to permit persons to whom the\n\/\/ Software is furnished to do so, subject to the following conditions:\n\/\/\n\/\/ The above copyright notice and this permission notice shall be included in\n\/\/ all copies or substantial portions of the Software.\n\/\/\n\/\/ THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\n\/\/ IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\n\/\/ FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT.\tIN NO EVENT SHALL\n\/\/ THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\n\/\/ LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING\n\/\/ FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER\n\/\/ DEALINGS IN THE SOFTWARE.\n\n\/\/ $Id: Windowmenu.cc,v 1.12 2002\/04\/09 23:19:02 fluxgen Exp $\n\n\/\/use GNU extensions\n#ifndef\t _GNU_SOURCE\n#define\t _GNU_SOURCE\n#endif \/\/ _GNU_SOURCE\n\n#ifdef\t\tHAVE_CONFIG_H\n#\tinclude \"..\/config.h\"\n#endif \/\/ HAVE_CONFIG_H\n\n#include \"i18n.hh\"\n#include \"fluxbox.hh\"\n#include \"Screen.hh\"\n#include \"Window.hh\"\n#include \"Windowmenu.hh\"\n#include \"Workspace.hh\"\n\n#ifdef\t\tSTDC_HEADERS\n#\tinclude <string.h>\n#endif \/\/ STDC_HEADERS\n\n\nWindowmenu::Windowmenu(FluxboxWindow *win) : Basemenu(win->getScreen()),\nwindow(win),\nscreen(window->getScreen()){\n\n\tsetTitleVisibility(False);\n\tsetMovable(False);\n\tsetInternalMenu();\n\t\n\tI18n *i18n = I18n::instance();\n\t\n\tsendToMenu = new SendtoWorkspacemenu(this);\n\tsendGroupToMenu = new SendGroupToWorkspacemenu(this);\n\tusing namespace FBNLS;\t\n\tinsert(i18n->getMessage(\n\t\tWindowmenuSet, WindowmenuSendTo,\n\t\t\"Send To ...\"),\n\t sendToMenu);\n\t \n\tinsert(i18n->getMessage(\n\t\tWindowmenuSet, WindowmenuSendGroupTo,\n\t\t\"Send Group To ...\"),\n\tsendGroupToMenu);\n\t \n\tinsert(i18n->getMessage(\n\t\tWindowmenuSet, WindowmenuShade,\n\t\t\"Shade\"),\n\t BScreen::WINDOWSHADE);\n\tinsert(i18n->getMessage(\n\t\tWindowmenuSet, WindowmenuIconify,\n\t\t\"Iconify\"),\n\t BScreen::WINDOWICONIFY);\n\tinsert(i18n->getMessage(\n\t\tWindowmenuSet, WindowmenuMaximize,\n\t\t\"Maximize\"),\n\t BScreen::WINDOWMAXIMIZE);\n\tinsert(i18n->getMessage(\n\t\tWindowmenuSet, WindowmenuRaise,\n\t\t\"Raise\"),\n\t BScreen::WINDOWRAISE);\n\tinsert(i18n->getMessage(\n\t\tWindowmenuSet, WindowmenuLower,\n\t\t\"Lower\"),\n\t BScreen::WINDOWLOWER);\n\tinsert(i18n->getMessage(\n\t\tWindowmenuSet, WindowmenuStick,\n\t\t\"Stick\"),\n\t BScreen::WINDOWSTICK);\n\tinsert(i18n->getMessage(\n\t\tWindowmenuSet, WindowmenuKillClient,\n\t\t\"Kill Client\"),\n\t BScreen::WINDOWKILL);\n\tinsert(i18n->getMessage(\n\t\tWindowmenuSet, WindowmenuClose,\n\t\t\"Close\"),\n\t BScreen::WINDOWCLOSE);\n\tinsert(i18n->getMessage(\n\t\tWindowmenuSet, WindowmenuTab,\n\t\t\"Tab\"),\n\t BScreen::WINDOWTAB);\n\n\tupdate();\n\n\tsetItemEnabled(2, window->hasTitlebar());\n\tsetItemEnabled(3, window->isIconifiable());\n\tsetItemEnabled(4, window->isMaximizable());\n\tsetItemEnabled(9, window->isClosable());\n\tsetItemEnabled(10, window->hasTab());\n\n}\n\n\nWindowmenu::~Windowmenu(void) {\n\tdelete sendToMenu;\n\tdelete sendGroupToMenu;\n}\n\n\nvoid Windowmenu::show(void) {\n\tif (isItemEnabled(2)) setItemSelected(2, window->isShaded());\n\tif (isItemEnabled(4)) setItemSelected(4, window->isMaximized());\n\tif (isItemEnabled(7)) setItemSelected(7, window->isStuck());\n\n\tBasemenu::show();\n}\n\n\nvoid Windowmenu::itemSelected(int button, unsigned int index) {\n\tBasemenuItem *item = find(index);\n\n\tswitch (item->function()) {\n\tcase BScreen::WINDOWSHADE:\n\t\thide();\n\n\t\twindow->shade();\n\t\tif (window->hasTab())\n\t\t\twindow->getTab()->shade();\n\t\tbreak;\n\n\tcase BScreen::WINDOWICONIFY:\n\t\thide();\n\t\twindow->iconify();\n\t\tbreak;\n\n\tcase BScreen::WINDOWMAXIMIZE:\n\t\thide();\n\t\twindow->maximize((unsigned int) button);\n\t\tbreak;\n\n\tcase BScreen::WINDOWCLOSE:\n\t\thide();\n\t\twindow->close();\n\t\tbreak;\n\n\tcase BScreen::WINDOWRAISE:\n\t\thide();\n\t\tif (window->hasTab())\n\t\t\twindow->getTab()->raise(); \/\/raise tabs\n\t\tscreen->getWorkspace(window->getWorkspaceNumber())->raiseWindow(window);\n\t\tbreak;\n\n\tcase BScreen::WINDOWLOWER:\n\t\thide();\n\t \tscreen->getWorkspace(window->getWorkspaceNumber())->lowerWindow(window);\n\t\tif (window->hasTab())\n\t\t\twindow->getTab()->lower(); \/\/lower tabs AND all it's windows\n\t\tbreak;\n\n\tcase BScreen::WINDOWSTICK:\n\t\thide();\n\t\twindow->stick();\n\t\tbreak;\n\n\tcase BScreen::WINDOWKILL:\n\t\thide();\n\t\tXKillClient(screen->getBaseDisplay()->getXDisplay(),\n\t\t\t\t\t\t\t\twindow->getClientWindow());\n\t\tbreak;\n\tcase BScreen::WINDOWTAB:\n\t\thide();\n\t\twindow->setTab(!window->hasTab());\n\t\tbreak;\n\t}\n}\n\n\nvoid Windowmenu::reconfigure(void) {\n\tsetItemEnabled(1, window->hasTitlebar());\n\tsetItemEnabled(2, window->isIconifiable());\n\tsetItemEnabled(3, window->isMaximizable());\n\tsetItemEnabled(8, window->isClosable());\n\n\tsendToMenu->reconfigure();\n\tsendGroupToMenu->reconfigure();\n\t\n\tBasemenu::reconfigure();\n}\n\n\nWindowmenu::SendtoWorkspacemenu::SendtoWorkspacemenu(Windowmenu *w)\n\t: Basemenu(w->screen)\n{\n\twindowmenu = w;\n\n\tsetTitleVisibility(False);\n\tsetMovable(False);\n\tsetInternalMenu();\n\tupdate();\n}\n\n\nvoid Windowmenu::SendtoWorkspacemenu::itemSelected(int button, unsigned int index) {\n\tif (button > 2) return;\n\n\tif (index <= windowmenu->screen->getCount()) {\n\t\tif (index == windowmenu->screen->getCurrentWorkspaceID()) return;\n\t\tif (windowmenu->window->isStuck()) windowmenu->window->stick();\n\n\t\tif (button == 1)\n\t\t\twindowmenu->screen->sendToWorkspace(index, False);\n\t\telse if (button == 2)\n\t\t\twindowmenu->screen->sendToWorkspace(index);\n\t}\n\n\thide();\n}\n\n\nvoid Windowmenu::SendtoWorkspacemenu::update(void) {\n\tunsigned int i, r = numberOfItems();\n\n\tif (numberOfItems() != 0) {\n\t\tfor (i = 0; i < r; ++i)\n\t\t\tremove(0);\n\t}\n\tfor (i = 0; i < windowmenu->screen->getCount(); ++i)\n\t\tinsert(windowmenu->screen->getWorkspace(i)->name().c_str());\n\n\tBasemenu::update();\n}\n\n\nvoid Windowmenu::SendtoWorkspacemenu::show(void) {\n\tupdate();\n\n\tBasemenu::show();\n}\n\nvoid Windowmenu::SendGroupToWorkspacemenu::itemSelected(int button, unsigned int index) {\n\tif (button > 2)\n\t\treturn;\n\n\tif (index <= getWindowMenu()->screen->getCount()) {\n\t\tif (index == getWindowMenu()->screen->getCurrentWorkspaceID())\n\t\t\treturn;\n\t\tif (getWindowMenu()->window->isStuck())\n\t\t\tgetWindowMenu()->window->stick();\n\n\t\tif (button == 1) {\n\t\t\tif (getWindowMenu()->window->hasTab()) {\n\t\t\t\tfor (Tab *first = Tab::getFirst(getWindowMenu()->window->getTab());\n\t\t\t\t\t\tfirst!=0; first=first->next()) {\n\t\t\t\t\tfirst->withdraw();\n\t\t\t\t\tfirst->getWindow()->withdraw();\n\t\t\t\t\tgetWindowMenu()->screen->reassociateWindow(first->getWindow(), index, True);\n\t\t\t\t\t\n\t\t\t\t}\n\t\t\t} else\t{\n\t\t\t\tgetWindowMenu()->window->withdraw();\n\t\t\t\tgetWindowMenu()->screen->reassociateWindow(getWindowMenu()->window, index, True);\n\t\t\t}\n\t\t\t\t\t\n\t\t}\n\t\t\n\t\tif (button == 2)\n\t\t\tgetWindowMenu()->screen->changeWorkspaceID(index);\n\t}\n\thide();\n}\n\nWindowmenu::SendGroupToWorkspacemenu::SendGroupToWorkspacemenu(Windowmenu *w):SendtoWorkspacemenu(w)\n{\n\n}\n\n\n<commit_msg>always true on tab<commit_after>\/\/ Windowmenu.cc for Fluxbox\n\/\/ Copyright (c) 2001-2002 Henrik Kinnunen (fluxgen@linuxmail.org)\n\/\/ Windowmenu.cc for Blackbox - an X11 Window manager\n\/\/ Copyright (c) 1997 - 2000 Brad Hughes (bhughes@tcac.net)\n\/\/\n\/\/ Permission is hereby granted, free of charge, to any person obtaining a\n\/\/ copy of this software and associated documentation files (the \"Software\"),\n\/\/ to deal in the Software without restriction, including without limitation\n\/\/ the rights to use, copy, modify, merge, publish, distribute, sublicense,\n\/\/ and\/or sell copies of the Software, and to permit persons to whom the\n\/\/ Software is furnished to do so, subject to the following conditions:\n\/\/\n\/\/ The above copyright notice and this permission notice shall be included in\n\/\/ all copies or substantial portions of the Software.\n\/\/\n\/\/ THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\n\/\/ IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\n\/\/ FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT.\tIN NO EVENT SHALL\n\/\/ THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\n\/\/ LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING\n\/\/ FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER\n\/\/ DEALINGS IN THE SOFTWARE.\n\n\/\/ $Id: Windowmenu.cc,v 1.13 2002\/04\/14 22:26:43 fluxgen Exp $\n\n\/\/use GNU extensions\n#ifndef\t _GNU_SOURCE\n#define\t _GNU_SOURCE\n#endif \/\/ _GNU_SOURCE\n\n#ifdef\t\tHAVE_CONFIG_H\n#\tinclude \"..\/config.h\"\n#endif \/\/ HAVE_CONFIG_H\n\n#include \"i18n.hh\"\n#include \"fluxbox.hh\"\n#include \"Screen.hh\"\n#include \"Window.hh\"\n#include \"Windowmenu.hh\"\n#include \"Workspace.hh\"\n\n#ifdef\t\tSTDC_HEADERS\n#\tinclude <string.h>\n#endif \/\/ STDC_HEADERS\n\n\nWindowmenu::Windowmenu(FluxboxWindow *win) : Basemenu(win->getScreen()),\nwindow(win),\nscreen(window->getScreen()){\n\n\tsetTitleVisibility(False);\n\tsetMovable(False);\n\tsetInternalMenu();\n\t\n\tI18n *i18n = I18n::instance();\n\t\n\tsendToMenu = new SendtoWorkspacemenu(this);\n\tsendGroupToMenu = new SendGroupToWorkspacemenu(this);\n\tusing namespace FBNLS;\t\n\tinsert(i18n->getMessage(\n\t\tWindowmenuSet, WindowmenuSendTo,\n\t\t\"Send To ...\"),\n\t sendToMenu);\n\t \n\tinsert(i18n->getMessage(\n\t\tWindowmenuSet, WindowmenuSendGroupTo,\n\t\t\"Send Group To ...\"),\n\tsendGroupToMenu);\n\t \n\tinsert(i18n->getMessage(\n\t\tWindowmenuSet, WindowmenuShade,\n\t\t\"Shade\"),\n\t BScreen::WINDOWSHADE);\n\tinsert(i18n->getMessage(\n\t\tWindowmenuSet, WindowmenuIconify,\n\t\t\"Iconify\"),\n\t BScreen::WINDOWICONIFY);\n\tinsert(i18n->getMessage(\n\t\tWindowmenuSet, WindowmenuMaximize,\n\t\t\"Maximize\"),\n\t BScreen::WINDOWMAXIMIZE);\n\tinsert(i18n->getMessage(\n\t\tWindowmenuSet, WindowmenuRaise,\n\t\t\"Raise\"),\n\t BScreen::WINDOWRAISE);\n\tinsert(i18n->getMessage(\n\t\tWindowmenuSet, WindowmenuLower,\n\t\t\"Lower\"),\n\t BScreen::WINDOWLOWER);\n\tinsert(i18n->getMessage(\n\t\tWindowmenuSet, WindowmenuStick,\n\t\t\"Stick\"),\n\t BScreen::WINDOWSTICK);\n\tinsert(i18n->getMessage(\n\t\tWindowmenuSet, WindowmenuKillClient,\n\t\t\"Kill Client\"),\n\t BScreen::WINDOWKILL);\n\tinsert(i18n->getMessage(\n\t\tWindowmenuSet, WindowmenuClose,\n\t\t\"Close\"),\n\t BScreen::WINDOWCLOSE);\n\tinsert(i18n->getMessage(\n\t\tWindowmenuSet, WindowmenuTab,\n\t\t\"Tab\"),\n\t BScreen::WINDOWTAB);\n\n\tupdate();\n\n\tsetItemEnabled(2, window->hasTitlebar());\n\tsetItemEnabled(3, window->isIconifiable());\n\tsetItemEnabled(4, window->isMaximizable());\n\tsetItemEnabled(9, window->isClosable());\n\tsetItemEnabled(10, true); \/\/we should always be able to enable the tab\n\n}\n\n\nWindowmenu::~Windowmenu(void) {\n\tdelete sendToMenu;\n\tdelete sendGroupToMenu;\n}\n\n\nvoid Windowmenu::show(void) {\n\tif (isItemEnabled(2)) setItemSelected(2, window->isShaded());\n\tif (isItemEnabled(4)) setItemSelected(4, window->isMaximized());\n\tif (isItemEnabled(7)) setItemSelected(7, window->isStuck());\n\n\tBasemenu::show();\n}\n\n\nvoid Windowmenu::itemSelected(int button, unsigned int index) {\n\tBasemenuItem *item = find(index);\n\n\tswitch (item->function()) {\n\tcase BScreen::WINDOWSHADE:\n\t\thide();\n\n\t\twindow->shade();\n\t\tif (window->hasTab())\n\t\t\twindow->getTab()->shade();\n\t\tbreak;\n\n\tcase BScreen::WINDOWICONIFY:\n\t\thide();\n\t\twindow->iconify();\n\t\tbreak;\n\n\tcase BScreen::WINDOWMAXIMIZE:\n\t\thide();\n\t\twindow->maximize((unsigned int) button);\n\t\tbreak;\n\n\tcase BScreen::WINDOWCLOSE:\n\t\thide();\n\t\twindow->close();\n\t\tbreak;\n\n\tcase BScreen::WINDOWRAISE:\n\t\thide();\n\t\tif (window->hasTab())\n\t\t\twindow->getTab()->raise(); \/\/raise tabs\n\t\tscreen->getWorkspace(window->getWorkspaceNumber())->raiseWindow(window);\n\t\tbreak;\n\n\tcase BScreen::WINDOWLOWER:\n\t\thide();\n\t \tscreen->getWorkspace(window->getWorkspaceNumber())->lowerWindow(window);\n\t\tif (window->hasTab())\n\t\t\twindow->getTab()->lower(); \/\/lower tabs AND all it's windows\n\t\tbreak;\n\n\tcase BScreen::WINDOWSTICK:\n\t\thide();\n\t\twindow->stick();\n\t\tbreak;\n\n\tcase BScreen::WINDOWKILL:\n\t\thide();\n\t\tXKillClient(screen->getBaseDisplay()->getXDisplay(),\n\t\t\t\t\t\t\t\twindow->getClientWindow());\n\t\tbreak;\n\tcase BScreen::WINDOWTAB:\n\t\thide();\n\t\twindow->setTab(!window->hasTab());\n\t\tbreak;\n\t}\n}\n\n\nvoid Windowmenu::reconfigure(void) {\n\tsetItemEnabled(1, window->hasTitlebar());\n\tsetItemEnabled(2, window->isIconifiable());\n\tsetItemEnabled(3, window->isMaximizable());\n\tsetItemEnabled(8, window->isClosable());\n\n\tsendToMenu->reconfigure();\n\tsendGroupToMenu->reconfigure();\n\t\n\tBasemenu::reconfigure();\n}\n\n\nWindowmenu::SendtoWorkspacemenu::SendtoWorkspacemenu(Windowmenu *w)\n\t: Basemenu(w->screen)\n{\n\twindowmenu = w;\n\n\tsetTitleVisibility(False);\n\tsetMovable(False);\n\tsetInternalMenu();\n\tupdate();\n}\n\n\nvoid Windowmenu::SendtoWorkspacemenu::itemSelected(int button, unsigned int index) {\n\tif (button > 2) return;\n\n\tif (index <= windowmenu->screen->getCount()) {\n\t\tif (index == windowmenu->screen->getCurrentWorkspaceID()) return;\n\t\tif (windowmenu->window->isStuck()) windowmenu->window->stick();\n\n\t\tif (button == 1)\n\t\t\twindowmenu->screen->sendToWorkspace(index, False);\n\t\telse if (button == 2)\n\t\t\twindowmenu->screen->sendToWorkspace(index);\n\t}\n\n\thide();\n}\n\n\nvoid Windowmenu::SendtoWorkspacemenu::update(void) {\n\tunsigned int i, r = numberOfItems();\n\n\tif (numberOfItems() != 0) {\n\t\tfor (i = 0; i < r; ++i)\n\t\t\tremove(0);\n\t}\n\tfor (i = 0; i < windowmenu->screen->getCount(); ++i)\n\t\tinsert(windowmenu->screen->getWorkspace(i)->name().c_str());\n\n\tBasemenu::update();\n}\n\n\nvoid Windowmenu::SendtoWorkspacemenu::show(void) {\n\tupdate();\n\n\tBasemenu::show();\n}\n\nvoid Windowmenu::SendGroupToWorkspacemenu::itemSelected(int button, unsigned int index) {\n\tif (button > 2)\n\t\treturn;\n\n\tif (index <= getWindowMenu()->screen->getCount()) {\n\t\tif (index == getWindowMenu()->screen->getCurrentWorkspaceID())\n\t\t\treturn;\n\t\tif (getWindowMenu()->window->isStuck())\n\t\t\tgetWindowMenu()->window->stick();\n\n\t\tif (button == 1) {\n\t\t\tif (getWindowMenu()->window->hasTab()) {\n\t\t\t\tfor (Tab *first = Tab::getFirst(getWindowMenu()->window->getTab());\n\t\t\t\t\t\tfirst!=0; first=first->next()) {\n\t\t\t\t\tfirst->withdraw();\n\t\t\t\t\tfirst->getWindow()->withdraw();\n\t\t\t\t\tgetWindowMenu()->screen->reassociateWindow(first->getWindow(), index, True);\n\t\t\t\t\t\n\t\t\t\t}\n\t\t\t} else\t{\n\t\t\t\tgetWindowMenu()->window->withdraw();\n\t\t\t\tgetWindowMenu()->screen->reassociateWindow(getWindowMenu()->window, index, True);\n\t\t\t}\n\t\t\t\t\t\n\t\t}\n\t\t\n\t\tif (button == 2)\n\t\t\tgetWindowMenu()->screen->changeWorkspaceID(index);\n\t}\n\thide();\n}\n\nWindowmenu::SendGroupToWorkspacemenu::SendGroupToWorkspacemenu(Windowmenu *w):SendtoWorkspacemenu(w)\n{\n\n}\n\n\n<|endoftext|>"} {"text":"<commit_before>\/\/ Windowmenu.cc for Fluxbox\n\/\/ Copyright (c) 2001-2002 Henrik Kinnunen (fluxgen@linuxmail.org)\n\/\/ Windowmenu.cc for Blackbox - an X11 Window manager\n\/\/ Copyright (c) 1997 - 2000 Brad Hughes (bhughes@tcac.net)\n\/\/\n\/\/ Permission is hereby granted, free of charge, to any person obtaining a\n\/\/ copy of this software and associated documentation files (the \"Software\"),\n\/\/ to deal in the Software without restriction, including without limitation\n\/\/ the rights to use, copy, modify, merge, publish, distribute, sublicense,\n\/\/ and\/or sell copies of the Software, and to permit persons to whom the\n\/\/ Software is furnished to do so, subject to the following conditions:\n\/\/\n\/\/ The above copyright notice and this permission notice shall be included in\n\/\/ all copies or substantial portions of the Software.\n\/\/\n\/\/ THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\n\/\/ IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\n\/\/ FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL\n\/\/ THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\n\/\/ LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING\n\/\/ FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER\n\/\/ DEALINGS IN THE SOFTWARE.\n\n\/\/ $Id: Windowmenu.cc,v 1.15 2002\/07\/23 13:49:01 fluxgen Exp $\n\n\/\/use GNU extensions\n#ifndef\t _GNU_SOURCE\n#define\t _GNU_SOURCE\n#endif \/\/ _GNU_SOURCE\n\n#ifdef HAVE_CONFIG_H\n#include \"..\/config.h\"\n#endif \/\/ HAVE_CONFIG_H\n\n#include \"i18n.hh\"\n#include \"fluxbox.hh\"\n#include \"Screen.hh\"\n#include \"Window.hh\"\n#include \"Windowmenu.hh\"\n#include \"Workspace.hh\"\n\n#ifdef STDC_HEADERS\n#include <string.h>\n#endif \/\/ STDC_HEADERS\n\n\nWindowmenu::Windowmenu(FluxboxWindow *win) : Basemenu(win->getScreen()),\nwindow(win),\nscreen(window->getScreen()){\n\n\tsetTitleVisibility(False);\n\tsetMovable(False);\n\tsetInternalMenu();\n\t\n\tI18n *i18n = I18n::instance();\n\t\n\tsendToMenu = new SendtoWorkspacemenu(this);\n\tsendGroupToMenu = new SendGroupToWorkspacemenu(this);\n\tusing namespace FBNLS;\t\n\tinsert(i18n->getMessage(\n\t\tWindowmenuSet, WindowmenuSendTo,\n\t\t\"Send To ...\"),\n\t sendToMenu);\n\t \n\tinsert(i18n->getMessage(\n\t\tWindowmenuSet, WindowmenuSendGroupTo,\n\t\t\"Send Group To ...\"),\n\tsendGroupToMenu);\n\t \n\tinsert(i18n->getMessage(\n\t\tWindowmenuSet, WindowmenuShade,\n\t\t\"Shade\"),\n\t BScreen::WINDOWSHADE);\n\tinsert(i18n->getMessage(\n\t\tWindowmenuSet, WindowmenuIconify,\n\t\t\"Iconify\"),\n\t BScreen::WINDOWICONIFY);\n\tinsert(i18n->getMessage(\n\t\tWindowmenuSet, WindowmenuMaximize,\n\t\t\"Maximize\"),\n\t BScreen::WINDOWMAXIMIZE);\n\tinsert(i18n->getMessage(\n\t\tWindowmenuSet, WindowmenuRaise,\n\t\t\"Raise\"),\n\t BScreen::WINDOWRAISE);\n\tinsert(i18n->getMessage(\n\t\tWindowmenuSet, WindowmenuLower,\n\t\t\"Lower\"),\n\t BScreen::WINDOWLOWER);\n\tinsert(i18n->getMessage(\n\t\tWindowmenuSet, WindowmenuStick,\n\t\t\"Stick\"),\n\t BScreen::WINDOWSTICK);\n\tinsert(i18n->getMessage(\n\t\tWindowmenuSet, WindowmenuKillClient,\n\t\t\"Kill Client\"),\n\t BScreen::WINDOWKILL);\n\tinsert(i18n->getMessage(\n\t\tWindowmenuSet, WindowmenuClose,\n\t\t\"Close\"),\n\t BScreen::WINDOWCLOSE);\n\tinsert(i18n->getMessage(\n\t\tWindowmenuSet, WindowmenuTab,\n\t\t\"Tab\"),\n\t BScreen::WINDOWTAB);\n\n\tupdate();\n\n\tsetItemEnabled(2, window->hasTitlebar());\n\tsetItemEnabled(3, window->isIconifiable());\n\tsetItemEnabled(4, window->isMaximizable());\n\tsetItemEnabled(9, window->isClosable());\n\tsetItemEnabled(10, true); \/\/we should always be able to enable the tab\n\n}\n\n\nWindowmenu::~Windowmenu(void) {\n\tdelete sendToMenu;\n\tdelete sendGroupToMenu;\n}\n\n\nvoid Windowmenu::show(void) {\n\tif (isItemEnabled(2)) setItemSelected(2, window->isShaded());\n\tif (isItemEnabled(4)) setItemSelected(4, window->isMaximized());\n\tif (isItemEnabled(7)) setItemSelected(7, window->isStuck());\n\n\tBasemenu::show();\n}\n\n\nvoid Windowmenu::itemSelected(int button, unsigned int index) {\n\tBasemenuItem *item = find(index);\n\n\tswitch (item->function()) {\n\tcase BScreen::WINDOWSHADE:\n\t\thide();\n\n\t\twindow->shade();\n\t\tif (window->hasTab())\n\t\t\twindow->getTab()->shade();\n\t\tbreak;\n\n\tcase BScreen::WINDOWICONIFY:\n\t\thide();\n\t\twindow->iconify();\n\t\tbreak;\n\n\tcase BScreen::WINDOWMAXIMIZE:\n\t\thide();\n\t\twindow->maximize((unsigned int) button);\n\t\tbreak;\n\n\tcase BScreen::WINDOWCLOSE:\n\t\thide();\n\t\twindow->close();\n\t\tbreak;\n\n\tcase BScreen::WINDOWRAISE:\n\t\thide();\n\t\tif (window->hasTab())\n\t\t\twindow->getTab()->raise(); \/\/raise tabs\n\t\tscreen->getWorkspace(window->getWorkspaceNumber())->raiseWindow(window);\n\t\tbreak;\n\n\tcase BScreen::WINDOWLOWER:\n\t\thide();\n\t \tscreen->getWorkspace(window->getWorkspaceNumber())->lowerWindow(window);\n\t\tif (window->hasTab())\n\t\t\twindow->getTab()->lower(); \/\/lower tabs AND all it's windows\n\t\tbreak;\n\n\tcase BScreen::WINDOWSTICK:\n\t\thide();\n\t\twindow->stick();\n\t\tbreak;\n\n\tcase BScreen::WINDOWKILL:\n\t\thide();\n\t\tXKillClient(screen->getBaseDisplay()->getXDisplay(),\n\t\t\t\t\t\t\t\twindow->getClientWindow());\n\t\tbreak;\n\tcase BScreen::WINDOWTAB:\n\t\thide();\n\t\twindow->setTab(!window->hasTab());\n\t\tbreak;\n\t}\n}\n\n\nvoid Windowmenu::reconfigure(void) {\n\tsetItemEnabled(1, window->hasTitlebar());\n\tsetItemEnabled(2, window->isIconifiable());\n\tsetItemEnabled(3, window->isMaximizable());\n\tsetItemEnabled(8, window->isClosable());\n\n\tsendToMenu->reconfigure();\n\tsendGroupToMenu->reconfigure();\n\t\n\tBasemenu::reconfigure();\n}\n\n\nWindowmenu::SendtoWorkspacemenu::SendtoWorkspacemenu(Windowmenu *w)\n\t: Basemenu(w->screen)\n{\n\twindowmenu = w;\n\n\tsetTitleVisibility(False);\n\tsetMovable(False);\n\tsetInternalMenu();\n\tupdate();\n}\n\n\nvoid Windowmenu::SendtoWorkspacemenu::itemSelected(int button, unsigned int index) {\n\tif (button > 2) return;\n\n\tif (index <= windowmenu->screen->getCount()) {\n\t\t\n\t\t\/\/ no need to send it to a workspace it already exist on\n\t\tif (index == windowmenu->screen->getCurrentWorkspaceID())\n\t\t\treturn;\n\n\t\t\/\/ if the window is stuck then unstick it\n\t\tif (windowmenu->window->isStuck())\n\t\t\twindowmenu->window->stick();\n\n\t\tif (button == 1) { \/\/ send to workspace without changing workspace\n\t\t\twindowmenu->screen->sendToWorkspace(index,\n\t\t\t\twindowmenu->window, false);\n\t\t} else if (button == 2) { \/\/ send to workspace and change workspace\n\t\t\twindowmenu->screen->sendToWorkspace(index,\n\t\t\t\twindowmenu->window, true);\n\t\t}\n\t}\n\n\thide();\n}\n\n\nvoid Windowmenu::SendtoWorkspacemenu::update(void) {\n\tunsigned int i, r = numberOfItems();\n\n\tif (numberOfItems() != 0) {\n\t\tfor (i = 0; i < r; ++i)\n\t\t\tremove(0);\n\t}\n\tfor (i = 0; i < windowmenu->screen->getCount(); ++i)\n\t\tinsert(windowmenu->screen->getWorkspace(i)->name().c_str());\n\n\tBasemenu::update();\n}\n\n\nvoid Windowmenu::SendtoWorkspacemenu::show(void) {\n\tupdate();\n\n\tBasemenu::show();\n}\n\nvoid Windowmenu::SendGroupToWorkspacemenu::itemSelected(int button, unsigned int index) {\n\tif (button > 2)\n\t\treturn;\n\n\tif (index <= getWindowMenu()->screen->getCount()) {\n\t\tif (index == getWindowMenu()->screen->getCurrentWorkspaceID())\n\t\t\treturn;\n\t\tif (getWindowMenu()->window->isStuck())\n\t\t\tgetWindowMenu()->window->stick();\n\n\t\tif (button == 1) {\n\t\t\tif (getWindowMenu()->window->hasTab()) {\n\t\t\t\tfor (Tab *first = Tab::getFirst(getWindowMenu()->window->getTab());\n\t\t\t\t\t\tfirst!=0; first=first->next()) {\n\t\t\t\t\tfirst->withdraw();\n\t\t\t\t\tfirst->getWindow()->withdraw();\n\t\t\t\t\tgetWindowMenu()->screen->reassociateWindow(first->getWindow(), index, True);\n\t\t\t\t\t\n\t\t\t\t}\n\t\t\t} else\t{\n\t\t\t\tgetWindowMenu()->window->withdraw();\n\t\t\t\tgetWindowMenu()->screen->reassociateWindow(getWindowMenu()->window, index, True);\n\t\t\t}\n\t\t\t\t\t\n\t\t}\n\t\t\n\t\tif (button == 2)\n\t\t\tgetWindowMenu()->screen->changeWorkspaceID(index);\n\t}\n\thide();\n}\n\nWindowmenu::SendGroupToWorkspacemenu::SendGroupToWorkspacemenu(Windowmenu *w):SendtoWorkspacemenu(w)\n{\n\n}\n\n\n<commit_msg>fixed checking on iconified when selecting item<commit_after>\/\/ Windowmenu.cc for Fluxbox\n\/\/ Copyright (c) 2001-2002 Henrik Kinnunen (fluxgen@linuxmail.org)\n\/\/ Windowmenu.cc for Blackbox - an X11 Window manager\n\/\/ Copyright (c) 1997 - 2000 Brad Hughes (bhughes@tcac.net)\n\/\/\n\/\/ Permission is hereby granted, free of charge, to any person obtaining a\n\/\/ copy of this software and associated documentation files (the \"Software\"),\n\/\/ to deal in the Software without restriction, including without limitation\n\/\/ the rights to use, copy, modify, merge, publish, distribute, sublicense,\n\/\/ and\/or sell copies of the Software, and to permit persons to whom the\n\/\/ Software is furnished to do so, subject to the following conditions:\n\/\/\n\/\/ The above copyright notice and this permission notice shall be included in\n\/\/ all copies or substantial portions of the Software.\n\/\/\n\/\/ THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\n\/\/ IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\n\/\/ FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL\n\/\/ THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\n\/\/ LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING\n\/\/ FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER\n\/\/ DEALINGS IN THE SOFTWARE.\n\n\/\/ $Id: Windowmenu.cc,v 1.16 2002\/08\/12 03:27:31 fluxgen Exp $\n\n\/\/use GNU extensions\n#ifndef\t _GNU_SOURCE\n#define\t _GNU_SOURCE\n#endif \/\/ _GNU_SOURCE\n\n#ifdef HAVE_CONFIG_H\n#include \"..\/config.h\"\n#endif \/\/ HAVE_CONFIG_H\n\n#include \"i18n.hh\"\n#include \"fluxbox.hh\"\n#include \"Screen.hh\"\n#include \"Window.hh\"\n#include \"Windowmenu.hh\"\n#include \"Workspace.hh\"\n\n#ifdef STDC_HEADERS\n#include <string.h>\n#endif \/\/ STDC_HEADERS\n\n\nWindowmenu::Windowmenu(FluxboxWindow *win) : Basemenu(win->getScreen()),\nwindow(win),\nscreen(window->getScreen()){\n\n\tsetTitleVisibility(False);\n\tsetMovable(False);\n\tsetInternalMenu();\n\t\n\tI18n *i18n = I18n::instance();\n\t\n\tsendToMenu = new SendtoWorkspacemenu(this);\n\tsendGroupToMenu = new SendGroupToWorkspacemenu(this);\n\tusing namespace FBNLS;\t\n\tinsert(i18n->getMessage(\n\t\tWindowmenuSet, WindowmenuSendTo,\n\t\t\"Send To ...\"),\n\t sendToMenu);\n\t \n\tinsert(i18n->getMessage(\n\t\tWindowmenuSet, WindowmenuSendGroupTo,\n\t\t\"Send Group To ...\"),\n\tsendGroupToMenu);\n\t \n\tinsert(i18n->getMessage(\n\t\tWindowmenuSet, WindowmenuShade,\n\t\t\"Shade\"),\n\t BScreen::WINDOWSHADE);\n\tinsert(i18n->getMessage(\n\t\tWindowmenuSet, WindowmenuIconify,\n\t\t\"Iconify\"),\n\t BScreen::WINDOWICONIFY);\n\tinsert(i18n->getMessage(\n\t\tWindowmenuSet, WindowmenuMaximize,\n\t\t\"Maximize\"),\n\t BScreen::WINDOWMAXIMIZE);\n\tinsert(i18n->getMessage(\n\t\tWindowmenuSet, WindowmenuRaise,\n\t\t\"Raise\"),\n\t BScreen::WINDOWRAISE);\n\tinsert(i18n->getMessage(\n\t\tWindowmenuSet, WindowmenuLower,\n\t\t\"Lower\"),\n\t BScreen::WINDOWLOWER);\n\tinsert(i18n->getMessage(\n\t\tWindowmenuSet, WindowmenuStick,\n\t\t\"Stick\"),\n\t BScreen::WINDOWSTICK);\n\tinsert(i18n->getMessage(\n\t\tWindowmenuSet, WindowmenuKillClient,\n\t\t\"Kill Client\"),\n\t BScreen::WINDOWKILL);\n\tinsert(i18n->getMessage(\n\t\tWindowmenuSet, WindowmenuClose,\n\t\t\"Close\"),\n\t BScreen::WINDOWCLOSE);\n\tinsert(i18n->getMessage(\n\t\tWindowmenuSet, WindowmenuTab,\n\t\t\"Tab\"),\n\t BScreen::WINDOWTAB);\n\n\tupdate();\n\n\tsetItemEnabled(2, window->hasTitlebar());\n\tsetItemEnabled(3, window->isIconifiable());\n\tsetItemEnabled(4, window->isMaximizable());\n\tsetItemEnabled(9, window->isClosable());\n\tsetItemEnabled(10, true); \/\/we should always be able to enable the tab\n\n}\n\n\nWindowmenu::~Windowmenu(void) {\n\tdelete sendToMenu;\n\tdelete sendGroupToMenu;\n}\n\n\nvoid Windowmenu::show(void) {\n\tif (isItemEnabled(2)) setItemSelected(2, window->isShaded());\n\tif (isItemEnabled(4)) setItemSelected(4, window->isMaximized());\n\tif (isItemEnabled(7)) setItemSelected(7, window->isStuck());\n\n\tBasemenu::show();\n}\n\n\nvoid Windowmenu::itemSelected(int button, unsigned int index) {\n\tBasemenuItem *item = find(index);\n\thide();\n\tswitch (item->function()) {\n\tcase BScreen::WINDOWSHADE:\n\t\tif (window->isIconic())\n\t\t\tbreak;\n\t\t\t\n\t\twindow->shade();\n\t\tif (window->hasTab())\n\t\t\twindow->getTab()->shade();\n\tbreak;\n\n\tcase BScreen::WINDOWICONIFY:\n\t\tif (!window->isIconic())\n\t\t\twindow->iconify();\n\t\telse\n\t\t\twindow->deiconify(); \/\/ restore window\n\t\t\t\n\tbreak;\n\n\tcase BScreen::WINDOWMAXIMIZE:\n\t\twindow->maximize((unsigned int) button);\n\tbreak;\n\n\tcase BScreen::WINDOWCLOSE:\n\t\twindow->close();\n\tbreak;\n\n\tcase BScreen::WINDOWRAISE:\n\t\tif (window->isIconic())\n\t\t\tbreak;\n\n\t\tif (window->hasTab())\n\t\t\twindow->getTab()->raise(); \/\/raise tabs\n\t\tscreen->getWorkspace(window->getWorkspaceNumber())->raiseWindow(window);\n\tbreak;\n\n\tcase BScreen::WINDOWLOWER:\n\t \tif (window->isIconic())\n\t\t\tbreak;\n\n\t\tscreen->getWorkspace(window->getWorkspaceNumber())->lowerWindow(window);\n\t\tif (window->hasTab())\n\t\t\twindow->getTab()->lower(); \/\/lower tabs AND all it's windows\n\t\tbreak;\n\n\tcase BScreen::WINDOWSTICK:\n\t\twindow->stick();\n\t\tbreak;\n\n\tcase BScreen::WINDOWKILL:\n\t\tXKillClient(screen->getBaseDisplay()->getXDisplay(),\n\t\t\t\t\t\t\t\twindow->getClientWindow());\n\t\tbreak;\n\tcase BScreen::WINDOWTAB:\n\t\twindow->setTab(!window->hasTab());\n\t\tbreak;\n\t}\n}\n\n\nvoid Windowmenu::reconfigure(void) {\n\tsetItemEnabled(1, window->hasTitlebar());\n\tsetItemEnabled(2, window->isIconifiable());\n\tsetItemEnabled(3, window->isMaximizable());\n\tsetItemEnabled(8, window->isClosable());\n\n\tsendToMenu->reconfigure();\n\tsendGroupToMenu->reconfigure();\n\t\n\tBasemenu::reconfigure();\n}\n\n\nWindowmenu::SendtoWorkspacemenu::SendtoWorkspacemenu(Windowmenu *w)\n\t: Basemenu(w->screen)\n{\n\twindowmenu = w;\n\n\tsetTitleVisibility(False);\n\tsetMovable(False);\n\tsetInternalMenu();\n\tupdate();\n}\n\n\nvoid Windowmenu::SendtoWorkspacemenu::itemSelected(int button, unsigned int index) {\n\tif (button > 2) return;\n\n\tif (index <= windowmenu->screen->getCount()) {\n\t\t\n\t\t\/\/ no need to send it to a workspace it already exist on\n\t\tif (index == windowmenu->screen->getCurrentWorkspaceID())\n\t\t\treturn;\n\n\t\t\/\/ if the window is stuck then unstick it\n\t\tif (windowmenu->window->isStuck())\n\t\t\twindowmenu->window->stick();\n\n\t\tif (button == 1) { \/\/ send to workspace without changing workspace\n\t\t\twindowmenu->screen->sendToWorkspace(index,\n\t\t\t\twindowmenu->window, false);\n\t\t} else if (button == 2) { \/\/ send to workspace and change workspace\n\t\t\twindowmenu->screen->sendToWorkspace(index,\n\t\t\t\twindowmenu->window, true);\n\t\t}\n\t}\n\n\thide();\n}\n\n\nvoid Windowmenu::SendtoWorkspacemenu::update(void) {\n\tunsigned int i, r = numberOfItems();\n\n\tif (numberOfItems() != 0) {\n\t\tfor (i = 0; i < r; ++i)\n\t\t\tremove(0);\n\t}\n\tfor (i = 0; i < windowmenu->screen->getCount(); ++i)\n\t\tinsert(windowmenu->screen->getWorkspace(i)->name().c_str());\n\n\tBasemenu::update();\n}\n\n\nvoid Windowmenu::SendtoWorkspacemenu::show(void) {\n\tupdate();\n\n\tBasemenu::show();\n}\n\nvoid Windowmenu::SendGroupToWorkspacemenu::itemSelected(int button, unsigned int index) {\n\tif (button > 2)\n\t\treturn;\n\n\tif (index <= getWindowMenu()->screen->getCount()) {\n\t\tif (index == getWindowMenu()->screen->getCurrentWorkspaceID())\n\t\t\treturn;\n\t\tif (getWindowMenu()->window->isStuck())\n\t\t\tgetWindowMenu()->window->stick();\n\n\t\tif (button == 1) {\n\t\t\tif (getWindowMenu()->window->hasTab()) {\n\t\t\t\tfor (Tab *first = Tab::getFirst(getWindowMenu()->window->getTab());\n\t\t\t\t\t\tfirst!=0; first=first->next()) {\n\t\t\t\t\tfirst->withdraw();\n\t\t\t\t\tfirst->getWindow()->withdraw();\n\t\t\t\t\tgetWindowMenu()->screen->reassociateWindow(first->getWindow(), index, True);\n\t\t\t\t\t\n\t\t\t\t}\n\t\t\t} else\t{\n\t\t\t\tgetWindowMenu()->window->withdraw();\n\t\t\t\tgetWindowMenu()->screen->reassociateWindow(getWindowMenu()->window, index, True);\n\t\t\t}\n\t\t\t\t\t\n\t\t}\n\t\t\n\t\tif (button == 2)\n\t\t\tgetWindowMenu()->screen->changeWorkspaceID(index);\n\t}\n\thide();\n}\n\nWindowmenu::SendGroupToWorkspacemenu::SendGroupToWorkspacemenu(Windowmenu *w):SendtoWorkspacemenu(w)\n{\n\n}\n\n\n<|endoftext|>"} {"text":"<commit_before>#include <pybind11\/pybind11.h>\n\n#include \"encoder\/encoder_sample.h\"\n#include \"clustering\/cpp_implemented_clustering_sample.h\"\n\nnamespace py = pybind11;\n\nPYBIND11_PLUGIN(_pqkmeans) {\n py::module m(\"_pqkemeans\", \"internal module for PQk-means\");\n\n py::class_<EncoderSample>(m, \"EncoderSample\")\n .def(py::init<>())\n .def(\"fit_generator\", &EncoderSample::fit_generator)\n .def(\"transform_one\", &EncoderSample::transform_one)\n .def(\"inverse_transform_one\", &EncoderSample::inverse_transform_one);\n\n py::class_<CppImplementedClusteringSample>(m, \"CppImplementedClusteringSample\")\n .def(py::init<>())\n .def(\"fit_one\", &CppImplementedClusteringSample::fit_one)\n .def(\"predict_one\", &CppImplementedClusteringSample::predict_one);\n\n return m.ptr();\n}<commit_msg>:art: new style pybind<commit_after>#include <pybind11\/pybind11.h>\n\n#include \"encoder\/encoder_sample.h\"\n#include \"clustering\/cpp_implemented_clustering_sample.h\"\n\nnamespace py = pybind11;\n\nPYBIND11_MODULE(_pqkmeans, m) {\n py::class_<EncoderSample>(m, \"EncoderSample\")\n .def(py::init<>())\n .def(\"fit_generator\", &EncoderSample::fit_generator)\n .def(\"transform_one\", &EncoderSample::transform_one)\n .def(\"inverse_transform_one\", &EncoderSample::inverse_transform_one);\n\n py::class_<CppImplementedClusteringSample>(m, \"CppImplementedClusteringSample\")\n .def(py::init<>())\n .def(\"fit_one\", &CppImplementedClusteringSample::fit_one)\n .def(\"predict_one\", &CppImplementedClusteringSample::predict_one);\n}<|endoftext|>"} {"text":"<commit_before>#include \"..\/include\/graph.h\"\n#include \"..\/include\/tournament.h\"\n#include <vector>\n#include <cmath>\n#include <set>\n#include <cassert>\n\ntypedef std::shared_ptr<Tournament> tournament_ptr;\n\nbool check_if_fixable(TournamentGraph& graph, int node)\n{\n int wins = 0;\n for (int i=0; i<graph.get_size(); ++i)\n {\n if(i != node && graph.wins(node, i))\n wins++;\n }\n if (wins < log2(graph.get_size()))\n return false;\n else\n {\n for (int i=0; i<graph.get_size(); ++i)\n {\n if(i == node)\n continue;\n wins = 0;\n for (int j=0; j<graph.get_size(); ++j)\n {\n if(i == j)\n continue;\n if(graph.wins(i, j))\n wins++;\n else\n break;\n }\n if(wins == graph.get_size() - 1)\n return false;\n }\n return true;\n }\n}\n\nbool check_if_case_A(TournamentGraph& graph, int node)\n{\n int wins = 0;\n int max_wins_from_losses = 0;\n int wins_from_losses; \n \n for (int i=0; i<graph.get_size(); ++i)\n {\n if(i != node && graph.wins(node, i))\n wins++;\n else\n {\n wins_from_losses = 0;\n for (int j=0; j<graph.get_size(); ++j)\n {\n if(i == j)\n break;\n if(graph.wins(i,j))\n wins_from_losses++;\n }\n if(wins_from_losses > max_wins_from_losses)\n {\n max_wins_from_losses = wins_from_losses;\n }\n }\n }\n return wins > max_wins_from_losses;\n}\n\ntournament_ptr fix_tournament_A(TournamentGraph& graph, int node)\n{\n std::set<tournament_ptr> won_tournaments, lost_tournaments;\n for (int i=0; i<graph.get_size(); ++i)\n {\n if(node == i)\n continue;\n if(graph.wins(node, i))\n won_tournaments.insert(tournament_ptr(new Tournament(&graph, i)));\n else\n lost_tournaments.insert(tournament_ptr(new Tournament(&graph, i))); \n }\n std::set<tournament_ptr> new_won_tournaments;\n std::set<tournament_ptr> won_copy(won_tournaments);\n std::set<tournament_ptr> lost_copy(lost_tournaments);\n \n for(auto lose: lost_copy)\n {\n for(auto win: won_copy)\n {\n if(won_tournaments.count(win) && graph.wins(win->get_winner(), \n lose->get_winner()))\n {\n won_tournaments.erase(win);\n lost_tournaments.erase(lose);\n new_won_tournaments.insert(tournament_ptr(\n new Tournament(*win, *lose)));\n break;\n }\n }\n }\n \n assert(lost_tournaments.size() == 0);\n while(won_tournaments.size() > 1)\n {\n for (auto i = won_tournaments.begin(); i!=won_tournaments.end(); ++i)\n {\n auto compatitor1 = *i;\n if (++i==won_tournaments.end())\n {\n new_won_tournaments.insert(tournament_ptr(\n new Tournament(*compatitor1, Tournament(&graph, node))));\n break;\n }\n auto compatitor2 = *i;\n new_won_tournaments.insert(tournament_ptr(\n new Tournament(*compatitor1, *compatitor2)));\n }\n won_tournaments = new_won_tournaments;\n new_won_tournaments.clear();\n }\n \n return *won_tournaments.begin();\n }\n\nbool check_if_case_B(TournamentGraph& graph, int node)\n{\n int wins = 0;\n for (int i=0; i<graph.get_size(); ++i)\n {\n if(i != node && graph.wins(node, i))\n wins++;\n }\n return wins >= graph.get_size() \/ 2;\n}\n\ntournament_ptr fix_tournament_B(TournamentGraph &graph, int node)\n{\n std::set<tournament_ptr> won_tournaments, lost_tournaments;\n std::set<tournament_ptr> new_won_tournaments, new_lost_tournaments;\n for (int i=0; i<graph.get_size(); ++i)\n {\n if(node == i)\n continue;\n if(graph.wins(node, i))\n won_tournaments.insert(tournament_ptr(new Tournament(&graph, i)));\n else\n lost_tournaments.insert(tournament_ptr(new Tournament(&graph, i))); \n }\n while(lost_tournaments.size() > 0)\n {\n std::set<tournament_ptr> won_copy(won_tournaments);\n std::set<tournament_ptr> lost_copy(lost_tournaments);\n\n for(auto lose: lost_copy)\n {\n for(auto win: won_copy)\n {\n if(won_tournaments.count(win) && graph.wins(win->get_winner(), \n lose->get_winner()))\n {\n won_tournaments.erase(win);\n lost_tournaments.erase(lose);\n new_won_tournaments.insert(tournament_ptr(\n new Tournament(*win, *lose)));\n break;\n }\n }\n }\n for (auto i=lost_tournaments.begin(); i!=lost_tournaments.end(); ++i)\n {\n auto compatitor1 = *i;\n if (++i==lost_tournaments.end())\n {\n auto won_example = *won_tournaments.begin();\n won_tournaments.erase(won_example);\n new_lost_tournaments.insert(tournament_ptr(\n new Tournament(*compatitor1, *won_example)));\n break;\n }\n auto compatitor2 = *i;\n new_lost_tournaments.insert(tournament_ptr(\n new Tournament(*compatitor1, *compatitor2)));\n }\n for (auto i=won_tournaments.begin(); i!=won_tournaments.end(); ++i)\n {\n auto compatitor1 = *i;\n if (++i==won_tournaments.end())\n {\n new_won_tournaments.insert(tournament_ptr(\n new Tournament(*compatitor1, Tournament(&graph, node))));\n break;\n }\n auto compatitor2 = *i;\n new_won_tournaments.insert(tournament_ptr(\n new Tournament(*compatitor1, *compatitor2)));\n }\n won_tournaments = new_won_tournaments;\n new_won_tournaments.clear();\n lost_tournaments = new_lost_tournaments;\n new_lost_tournaments.clear();\n }\n \n while(won_tournaments.size() > 1)\n {\n for (auto i = won_tournaments.begin(); i!=won_tournaments.end(); ++i)\n {\n auto compatitor1 = *i;\n ++i;\n auto compatitor2 = *i;\n new_won_tournaments.insert(\n std::shared_ptr<Tournament>(\n new Tournament(*compatitor1, *compatitor2)));\n }\n won_tournaments = new_won_tournaments;\n new_won_tournaments.clear();\n }\n return *won_tournaments.begin();\n}\n\nvoid fix_tournament(TournamentGraph& graph, int node)\n{\n if(check_if_fixable(graph, node))\n {\n std::shared_ptr<Tournament> tournament;\n printf(\"Fixable\\n\");\n if (check_if_case_A(graph, node))\n {\n printf(\"Case A\\n\"); \n tournament = fix_tournament_A(graph, node);\n }\n else if (check_if_case_B(graph, node))\n {\n printf(\"Case B\\n\");\n tournament = fix_tournament_B(graph, node);\n }\n else\n {\n printf(\"Worst Case\");\n }\n }\n else\n {\n printf(\"Unfixable\\n\");\n }\n \n}\n<commit_msg>Refactor.<commit_after>#include <vector>\n#include <cmath>\n#include <set>\n#include <cassert>\n\n#include \"..\/include\/graph.h\"\n#include \"..\/include\/tournament.h\"\n\ntypedef std::shared_ptr<Tournament> tournament_ptr;\n\nbool check_if_fixable(TournamentGraph& graph, int node)\n{\n int wins = 0;\n for (int i=0; i<graph.get_size(); ++i)\n {\n if(i != node && graph.wins(node, i))\n wins++;\n }\n if (wins < log2(graph.get_size()))\n return false;\n else\n {\n for (int i=0; i<graph.get_size(); ++i)\n {\n if(i == node)\n continue;\n wins = 0;\n for (int j=0; j<graph.get_size(); ++j)\n {\n if(i == j)\n continue;\n if(graph.wins(i, j))\n wins++;\n else\n break;\n }\n if(wins == graph.get_size() - 1)\n return false;\n }\n return true;\n }\n}\n\nbool check_if_case_A(TournamentGraph& graph, int node)\n{\n int wins = 0;\n int max_wins_from_losses = 0;\n int wins_from_losses; \n \n for (int i=0; i<graph.get_size(); ++i)\n {\n if(i != node && graph.wins(node, i))\n wins++;\n else\n {\n wins_from_losses = 0;\n for (int j=0; j<graph.get_size(); ++j)\n {\n if(i == j)\n break;\n if(graph.wins(i,j))\n wins_from_losses++;\n }\n if(wins_from_losses > max_wins_from_losses)\n {\n max_wins_from_losses = wins_from_losses;\n }\n }\n }\n return wins > max_wins_from_losses;\n}\n\ntournament_ptr fix_tournament_A(TournamentGraph& graph, int node)\n{\n std::set<tournament_ptr> won_tournaments, lost_tournaments;\n for (int i=0; i<graph.get_size(); ++i)\n {\n if(node == i)\n continue;\n if(graph.wins(node, i))\n won_tournaments.insert(tournament_ptr(new Tournament(&graph, i)));\n else\n lost_tournaments.insert(tournament_ptr(new Tournament(&graph, i))); \n }\n std::set<tournament_ptr> new_won_tournaments;\n std::set<tournament_ptr> won_copy(won_tournaments);\n std::set<tournament_ptr> lost_copy(lost_tournaments);\n \n for(auto lose: lost_copy)\n {\n for(auto win: won_copy)\n {\n if(won_tournaments.count(win) && graph.wins(win->get_winner(), \n lose->get_winner()))\n {\n won_tournaments.erase(win);\n lost_tournaments.erase(lose);\n new_won_tournaments.insert(tournament_ptr(\n new Tournament(*win, *lose)));\n break;\n }\n }\n }\n \n assert(lost_tournaments.size() == 0);\n while(won_tournaments.size() > 1)\n {\n for (auto i = won_tournaments.begin(); i!=won_tournaments.end(); ++i)\n {\n auto compatitor1 = *i;\n if (++i==won_tournaments.end())\n {\n new_won_tournaments.insert(tournament_ptr(\n new Tournament(*compatitor1, Tournament(&graph, node))));\n break;\n }\n auto compatitor2 = *i;\n new_won_tournaments.insert(tournament_ptr(\n new Tournament(*compatitor1, *compatitor2)));\n }\n won_tournaments = new_won_tournaments;\n new_won_tournaments.clear();\n }\n \n return *won_tournaments.begin();\n }\n\nbool check_if_case_B(TournamentGraph& graph, int node)\n{\n int wins = 0;\n for (int i=0; i<graph.get_size(); ++i)\n {\n if(i != node && graph.wins(node, i))\n wins++;\n }\n return wins >= graph.get_size() \/ 2;\n}\n\ntournament_ptr fix_tournament_B(TournamentGraph &graph, int node)\n{\n std::set<tournament_ptr> won_tournaments, lost_tournaments;\n std::set<tournament_ptr> new_won_tournaments, new_lost_tournaments;\n for (int i=0; i<graph.get_size(); ++i)\n {\n if(node == i)\n continue;\n if(graph.wins(node, i))\n won_tournaments.insert(tournament_ptr(new Tournament(&graph, i)));\n else\n lost_tournaments.insert(tournament_ptr(new Tournament(&graph, i))); \n }\n while(lost_tournaments.size() > 0)\n {\n std::set<tournament_ptr> won_copy(won_tournaments);\n std::set<tournament_ptr> lost_copy(lost_tournaments);\n\n for(auto lose: lost_copy)\n {\n for(auto win: won_copy)\n {\n if(won_tournaments.count(win) && graph.wins(win->get_winner(), \n lose->get_winner()))\n {\n won_tournaments.erase(win);\n lost_tournaments.erase(lose);\n new_won_tournaments.insert(tournament_ptr(\n new Tournament(*win, *lose)));\n break;\n }\n }\n }\n for (auto i=lost_tournaments.begin(); i!=lost_tournaments.end(); ++i)\n {\n auto compatitor1 = *i;\n if (++i==lost_tournaments.end())\n {\n auto won_example = *won_tournaments.begin();\n won_tournaments.erase(won_example);\n new_lost_tournaments.insert(tournament_ptr(\n new Tournament(*compatitor1, *won_example)));\n break;\n }\n auto compatitor2 = *i;\n new_lost_tournaments.insert(tournament_ptr(\n new Tournament(*compatitor1, *compatitor2)));\n }\n for (auto i=won_tournaments.begin(); i!=won_tournaments.end(); ++i)\n {\n auto compatitor1 = *i;\n if (++i==won_tournaments.end())\n {\n new_won_tournaments.insert(tournament_ptr(\n new Tournament(*compatitor1, Tournament(&graph, node))));\n break;\n }\n auto compatitor2 = *i;\n new_won_tournaments.insert(tournament_ptr(\n new Tournament(*compatitor1, *compatitor2)));\n }\n won_tournaments = new_won_tournaments;\n new_won_tournaments.clear();\n lost_tournaments = new_lost_tournaments;\n new_lost_tournaments.clear();\n }\n \n while(won_tournaments.size() > 1)\n {\n for (auto i = won_tournaments.begin(); i!=won_tournaments.end(); ++i)\n {\n auto compatitor1 = *i;\n ++i;\n auto compatitor2 = *i;\n new_won_tournaments.insert(\n std::shared_ptr<Tournament>(\n new Tournament(*compatitor1, *compatitor2)));\n }\n won_tournaments = new_won_tournaments;\n new_won_tournaments.clear();\n }\n return *won_tournaments.begin();\n}\n\nvoid fix_tournament(TournamentGraph& graph, int node)\n{\n if(check_if_fixable(graph, node))\n {\n std::shared_ptr<Tournament> tournament;\n printf(\"Fixable\\n\");\n if (check_if_case_A(graph, node))\n {\n printf(\"Case A\\n\"); \n tournament = fix_tournament_A(graph, node);\n }\n else if (check_if_case_B(graph, node))\n {\n printf(\"Case B\\n\");\n tournament = fix_tournament_B(graph, node);\n }\n else\n {\n printf(\"Worst Case\");\n }\n }\n else\n {\n printf(\"Unfixable\\n\");\n }\n \n}\n<|endoftext|>"} {"text":"<commit_before>bd76671c-2e4f-11e5-973f-28cfe91dbc4b<commit_msg>bd7d7391-2e4f-11e5-949a-28cfe91dbc4b<commit_after>bd7d7391-2e4f-11e5-949a-28cfe91dbc4b<|endoftext|>"} {"text":"<commit_before>75dea8f5-4b02-11e5-b4a7-28cfe9171a43<commit_msg>Did ANOTHER thing<commit_after>75ed1e68-4b02-11e5-9fcc-28cfe9171a43<|endoftext|>"} {"text":"<commit_before>\/\/ For conditions of distribution and use, see copyright notice in license.txt\n\n#include \"StableHeaders.h\"\n#include \"CameraHandler.h\"\n#include \"WorldBuildingModule.h\"\n#include \"Quaternion.h\"\n\n#include <SceneManager.h>\n#include <EC_OgrePlaceable.h>\n#include <EC_OgreCamera.h>\n#include <EC_OgreMesh.h>\n#include <EC_OgreCustomObject.h>\n\n#include <Ogre.h>\n#include <QUuid>\n\n#include <QDebug>\n\nnamespace WorldBuilding\n{\n namespace View\n {\n CameraHandler::CameraHandler(Foundation::Framework *framework, QObject *parent) :\n QObject(parent),\n framework_(framework),\n camera_count_(0),\n pixelData_(0),\n last_dir_(Vector3df::ZERO)\n {\n render_texture_name_ = \"EntityViewPortTexture_\" + QUuid::createUuid().toString().toStdString();\n\n Ogre::TexturePtr entity_screenshot = Ogre::TextureManager::getSingleton().createManual(\n render_texture_name_, Ogre::ResourceGroupManager::DEFAULT_RESOURCE_GROUP_NAME,\n Ogre::TEX_TYPE_2D, 1, 1, 0, Ogre::PF_A8R8G8B8, Ogre::TU_RENDERTARGET);\n \n entity_screenshot->getBuffer()->getRenderTarget()->setAutoUpdated(false);\n }\n\n CameraHandler::~CameraHandler()\n {\n SAFE_DELETE(pixelData_);\n }\n\n CameraID CameraHandler::CreateCustomCamera()\n {\n Scene::ScenePtr scene = framework_->GetDefaultWorldScene();\n if (!scene)\n return -1;\n\n Scene::EntityPtr cam_entity = scene->CreateEntity(scene->GetNextFreeId());\n if (!cam_entity.get())\n return -1;\n\n cam_entity->AddComponent(framework_->GetComponentManager()->CreateComponent(OgreRenderer::EC_OgrePlaceable::TypeNameStatic()));\n cam_entity->AddComponent(framework_->GetComponentManager()->CreateComponent(OgreRenderer::EC_OgreCamera::TypeNameStatic()));\n\n Foundation::ComponentInterfacePtr component_placable = cam_entity->GetComponent(OgreRenderer::EC_OgrePlaceable::TypeNameStatic());\n OgreRenderer::EC_OgreCamera *ec_camera = cam_entity->GetComponent<OgreRenderer::EC_OgreCamera>().get();\n \n if (!component_placable.get() || !ec_camera)\n return -1;\n ec_camera->SetPlaceable(component_placable);\n \n camera_count_++;\n id_to_cam_entity_[camera_count_] = cam_entity.get();\n\n return camera_count_;\n }\n\n void CameraHandler::DestroyCamera(CameraID cam_id)\n {\n if (id_to_cam_entity_.contains(cam_id))\n id_to_cam_entity_.remove(cam_id);\n\n Ogre::TexturePtr entity_viewport_texture = Ogre::TextureManager::getSingleton().getByName(render_texture_name_);\n if (entity_viewport_texture.isNull())\n return;\n\n Ogre::RenderTexture *render_texture = entity_viewport_texture->getBuffer()->getRenderTarget();\n if (render_texture)\n render_texture->removeAllViewports();\n }\n\n bool CameraHandler::FocusToEntity(CameraID cam_id, Scene::Entity *entity, Vector3df offset)\n {\n bool focus_completed = false;\n\n if (!id_to_cam_entity_.contains(cam_id))\n return focus_completed;\n Scene::Entity *cam_entity = id_to_cam_entity_[cam_id];\n\n \/\/ Get placable from both focus entity and our camera id entity\n OgreRenderer::EC_OgrePlaceable *entity_ec_placable = entity->GetComponent<OgreRenderer::EC_OgrePlaceable>().get();\n OgreRenderer::EC_OgrePlaceable *cam_ec_placable = cam_entity->GetComponent<OgreRenderer::EC_OgrePlaceable>().get();\n OgreRenderer::EC_OgreCamera *cam_ec_camera = cam_entity->GetComponent<OgreRenderer::EC_OgreCamera>().get();\n \n if (!entity_ec_placable || !cam_ec_placable || !cam_ec_camera)\n return focus_completed;\n\n OgreRenderer::EC_OgreMesh *entity_mesh = entity->GetComponent<OgreRenderer::EC_OgreMesh>().get();\n OgreRenderer::EC_OgreCustomObject *entity_custom_object = entity->GetComponent<OgreRenderer::EC_OgreCustomObject>().get();\n\n Vector3df position_vector = entity_ec_placable->GetPosition();\n Vector3df position_offset;\n Vector3df look_at;\n\n Vector3df bounding_min;\n Vector3df bounding_max;\n Vector3df der_size_vector;\n Ogre::Vector3 derived_scale;\n\n if (entity_mesh)\n {\n entity_mesh->GetBoundingBox(bounding_min, bounding_max);\n derived_scale = entity_mesh->GetEntity()->getParentNode()->_getDerivedScale();\n der_size_vector = Vector3df(derived_scale.x, derived_scale.y, derived_scale.z) * (bounding_max - bounding_min);\n \n position_offset = Vector3df(der_size_vector.x, -der_size_vector.y, der_size_vector.y);\n look_at = Vector3df(position_vector.x, position_vector.y, position_vector.z + (position_offset.z\/2));\n }\n else if (entity_custom_object)\n {\n entity_custom_object->GetBoundingBox(bounding_min, bounding_max);\n derived_scale = entity_custom_object->GetEntity()->getParentNode()->_getDerivedScale();\n der_size_vector = Vector3df(derived_scale.x, derived_scale.y, derived_scale.z) * (bounding_max - bounding_min);\n \n float max_distance = 0;\n if (der_size_vector.x > max_distance)\n max_distance = der_size_vector.x;\n if (der_size_vector.y > max_distance)\n max_distance = der_size_vector.y;\n if (der_size_vector.z > max_distance)\n max_distance = der_size_vector.z;\n\n position_offset = Vector3df(der_size_vector.x, -max_distance, max_distance\/4);\n look_at = Vector3df(position_vector.x, position_vector.y, position_vector.z + (position_offset.z\/2));\n }\n else\n return focus_completed;\n \n cam_ec_placable->SetPosition(position_vector + (entity_ec_placable->GetOrientation() * position_offset));\n if (last_dir_ != Vector3df::ZERO)\n {\n \/\/qDebug() << \"Testig\";\n \/\/cam_ec_placable->SetPosition(cam_ec_placable->GetPosition() + last_dir_);\n }\n cam_ec_placable->LookAt(look_at);\n\n focus_completed = true;\n return focus_completed;\n }\n\n void CameraHandler::RotateCamera(Vector3df pivot, CameraID id, qreal x, qreal y)\n {\n if (id_to_cam_entity_.contains(id))\n {\n Scene::Entity *cam_entity = id_to_cam_entity_[id];\n OgreRenderer::EC_OgreCamera *ec_camera = cam_entity->GetComponent<OgreRenderer::EC_OgreCamera>().get();\n OgreRenderer::EC_OgrePlaceable *cam_ec_placable = cam_entity->GetComponent<OgreRenderer::EC_OgrePlaceable>().get();\n if (!ec_camera || !cam_ec_placable)\n return;\n\n Ogre::Camera* cam = ec_camera->GetCamera();\n Vector3df pos = cam_ec_placable->GetPosition();\n\n Vector3df dir(pos-pivot);\n Quaternion quat(-x,cam_ec_placable->GetLocalYAxis());\n quat *= Quaternion(-y, cam_ec_placable->GetLocalXAxis());\n dir = quat * dir;\n\n Vector3df new_pos(pivot+dir);\n cam_ec_placable->SetPosition(new_pos);\n cam_ec_placable->LookAt(pivot);\n }\n }\n\n bool CameraHandler::ZoomRelativeToPoint(Vector3df point, CameraID id, qreal delta, qreal min, qreal max)\n {\n bool zoomed = false;\n if (id_to_cam_entity_.contains(id))\n {\n Scene::Entity *cam_entity = id_to_cam_entity_[id];\n OgreRenderer::EC_OgrePlaceable *placeable = cam_entity->GetComponent<OgreRenderer::EC_OgrePlaceable>().get();\n if (!placeable)\n return false;\n\n Vector3df pos = placeable->GetPosition();\n Vector3df dir = point-pos;\n Vector3df distance = dir;\n dir.normalize();\n dir *=delta;\n \n \/\/something fishy, even if we check that we never go beyond min\/max, we still might end up there and zoom will be disabled. So we check the also\n \/\/if were zooming in or out.\n if(delta>0 && (distance.getLength()+dir.getLength() > min))\n {\n zoomed = true;\n }\n if(delta<0 && (distance.getLength()+dir.getLength() <max))\n {\n zoomed = true;\n }\n if(zoomed)\n {\n placeable->SetPosition(placeable->GetPosition() + dir);\n last_dir_ = dir;\n }\n }\n return zoomed;\n }\n\n QPixmap CameraHandler::RenderCamera(CameraID cam_id, QSize image_size)\n {\n \/\/ Get camera\n QImage captured_pixmap(image_size, QImage::Format_ARGB32_Premultiplied);\n captured_pixmap.fill(Qt::gray);\n\n \/\/ Check that this camera ID exists\n if (!id_to_cam_entity_.contains(cam_id))\n return QPixmap::fromImage(captured_pixmap);\n Scene::Entity *cam_entity = id_to_cam_entity_[cam_id];\n\n \/\/ Get the camera ec\n OgreRenderer::EC_OgreCamera *ec_camera = cam_entity->GetComponent<OgreRenderer::EC_OgreCamera>().get();\n if (!ec_camera)\n return QPixmap::fromImage(captured_pixmap);\n\n \/\/ Get our rendering texture\n Ogre::TexturePtr entity_viewport_texture = Ogre::TextureManager::getSingleton().getByName(render_texture_name_);\n if (entity_viewport_texture.isNull())\n return QPixmap::fromImage(captured_pixmap);\n\n \/\/ Re-create rendering texture if size has changed, this has to be done it seems with Ogre 1.7.1\n if (entity_viewport_texture->getWidth() != image_size.width() || entity_viewport_texture->getHeight() != image_size.height())\n {\n Ogre::TextureManager::getSingleton().remove(render_texture_name_);\n render_texture_name_ = \"EntityViewPortTexture_\" + QUuid::createUuid().toString().toStdString();\n entity_viewport_texture = Ogre::TextureManager::getSingleton().createManual(\n render_texture_name_, Ogre::ResourceGroupManager::DEFAULT_RESOURCE_GROUP_NAME,\n Ogre::TEX_TYPE_2D, image_size.width(), image_size.height(), 0, Ogre::PF_A8R8G8B8, Ogre::TU_RENDERTARGET);\n entity_viewport_texture->getBuffer()->getRenderTarget()->setAutoUpdated(false);\n }\n\n \/\/ Set camera aspect ratio\n ec_camera->GetCamera()->setAspectRatio(Ogre::Real(image_size.width()) \/ Ogre::Real(image_size.height()));\n\n \/\/ Get rendering texture and update it\n Ogre::RenderTexture *render_texture = entity_viewport_texture->getBuffer()->getRenderTarget();\n if (render_texture)\n {\n render_texture->removeAllViewports();\n if (render_texture->getNumViewports() == 0)\n {\n Ogre::Viewport *vp = render_texture->addViewport(ec_camera->GetCamera());\n vp->setOverlaysEnabled(false);\n \/\/ Exclude highlight mesh from rendering\n vp->setVisibilityMask(0x2);\n }\n render_texture->update();\n\n \/\/ Copy render target pixels into memory\n SAFE_DELETE(pixelData_);\n \n pixelData_ = new Ogre::uchar[image_size.height() * image_size.width() * 4];\n Ogre::Box bounds(0, 0, image_size.width(), image_size.height());\n Ogre::PixelBox pixels = Ogre::PixelBox(bounds, Ogre::PF_A8R8G8B8, (void*)pixelData_);\n\n \/\/entity_viewport_texture->getBuffer()->blitToMemory(pixels);\n render_texture->copyContentsToMemory(pixels, Ogre::RenderTarget::FB_AUTO);\n\n \/\/ Create a QImage from the memory\n captured_pixmap = QImage(pixelData_, image_size.width(), image_size.height(), QImage::Format_ARGB32_Premultiplied);\n captured_pixmap.save(\"test.png\");\n if (captured_pixmap.isNull())\n WorldBuildingModule::LogDebug(\"Capturing entity to viewport image failed.\");\n }\n \/\/ Return image as a QPixmap\n return QPixmap::fromImage(captured_pixmap);\n }\n }\n}<commit_msg>*The building viewport will now remembers its orientation and relative position.<commit_after>\/\/ For conditions of distribution and use, see copyright notice in license.txt\n\n#include \"StableHeaders.h\"\n#include \"CameraHandler.h\"\n#include \"WorldBuildingModule.h\"\n#include \"Quaternion.h\"\n\n#include <SceneManager.h>\n#include <EC_OgrePlaceable.h>\n#include <EC_OgreCamera.h>\n#include <EC_OgreMesh.h>\n#include <EC_OgreCustomObject.h>\n\n#include <Ogre.h>\n#include <QUuid>\n\n#include <QDebug>\n\nnamespace WorldBuilding\n{\n namespace View\n {\n CameraHandler::CameraHandler(Foundation::Framework *framework, QObject *parent) :\n QObject(parent),\n framework_(framework),\n camera_count_(0),\n pixelData_(0),\n last_dir_(Vector3df::ZERO)\n {\n render_texture_name_ = \"EntityViewPortTexture_\" + QUuid::createUuid().toString().toStdString();\n\n Ogre::TexturePtr entity_screenshot = Ogre::TextureManager::getSingleton().createManual(\n render_texture_name_, Ogre::ResourceGroupManager::DEFAULT_RESOURCE_GROUP_NAME,\n Ogre::TEX_TYPE_2D, 1, 1, 0, Ogre::PF_A8R8G8B8, Ogre::TU_RENDERTARGET);\n \n entity_screenshot->getBuffer()->getRenderTarget()->setAutoUpdated(false);\n }\n\n CameraHandler::~CameraHandler()\n {\n SAFE_DELETE(pixelData_);\n }\n\n CameraID CameraHandler::CreateCustomCamera()\n {\n Scene::ScenePtr scene = framework_->GetDefaultWorldScene();\n if (!scene)\n return -1;\n\n Scene::EntityPtr cam_entity = scene->CreateEntity(scene->GetNextFreeId());\n if (!cam_entity.get())\n return -1;\n\n cam_entity->AddComponent(framework_->GetComponentManager()->CreateComponent(OgreRenderer::EC_OgrePlaceable::TypeNameStatic()));\n cam_entity->AddComponent(framework_->GetComponentManager()->CreateComponent(OgreRenderer::EC_OgreCamera::TypeNameStatic()));\n\n Foundation::ComponentInterfacePtr component_placable = cam_entity->GetComponent(OgreRenderer::EC_OgrePlaceable::TypeNameStatic());\n OgreRenderer::EC_OgreCamera *ec_camera = cam_entity->GetComponent<OgreRenderer::EC_OgreCamera>().get();\n \n if (!component_placable.get() || !ec_camera)\n return -1;\n ec_camera->SetPlaceable(component_placable);\n \n camera_count_++;\n id_to_cam_entity_[camera_count_] = cam_entity.get();\n\n return camera_count_;\n }\n\n void CameraHandler::DestroyCamera(CameraID cam_id)\n {\n if (id_to_cam_entity_.contains(cam_id))\n id_to_cam_entity_.remove(cam_id);\n\n Ogre::TexturePtr entity_viewport_texture = Ogre::TextureManager::getSingleton().getByName(render_texture_name_);\n if (entity_viewport_texture.isNull())\n return;\n\n Ogre::RenderTexture *render_texture = entity_viewport_texture->getBuffer()->getRenderTarget();\n if (render_texture)\n render_texture->removeAllViewports();\n }\n\n bool CameraHandler::FocusToEntity(CameraID cam_id, Scene::Entity *entity, Vector3df offset)\n {\n\n\t\t\tbool focus_completed = false;\n\n\t\t\tif (!id_to_cam_entity_.contains(cam_id))\n\t\t\t\treturn focus_completed;\n\t\t\tScene::Entity *cam_entity = id_to_cam_entity_[cam_id];\n\n\t\t\t\/\/ Get placable from both focus entity and our camera id entity\n\t\t\tOgreRenderer::EC_OgrePlaceable *entity_ec_placable = entity->GetComponent<OgreRenderer::EC_OgrePlaceable>().get();\n\t\t\tOgreRenderer::EC_OgrePlaceable *cam_ec_placable = cam_entity->GetComponent<OgreRenderer::EC_OgrePlaceable>().get();\n\t\t\tOgreRenderer::EC_OgreCamera *cam_ec_camera = cam_entity->GetComponent<OgreRenderer::EC_OgreCamera>().get();\n\t if(last_dir_ == Vector3df::ZERO)\n\t\t\t{\n\t\t\t\tif (!entity_ec_placable || !cam_ec_placable || !cam_ec_camera)\n\t\t\t\t\treturn focus_completed;\n\n\t\t\t\tOgreRenderer::EC_OgreMesh *entity_mesh = entity->GetComponent<OgreRenderer::EC_OgreMesh>().get();\n\t\t\t\tOgreRenderer::EC_OgreCustomObject *entity_custom_object = entity->GetComponent<OgreRenderer::EC_OgreCustomObject>().get();\n\n\t\t\t\tVector3df position_vector = entity_ec_placable->GetPosition();\n\t\t\t\tVector3df position_offset;\n\t\t\t\tVector3df look_at;\n\n\t\t\t\tVector3df bounding_min;\n\t\t\t\tVector3df bounding_max;\n\t\t\t\tVector3df der_size_vector;\n\t\t\t\tOgre::Vector3 derived_scale;\n\n\t\t\t\tif (entity_mesh)\n\t\t\t\t{\n\t\t\t\t\tentity_mesh->GetBoundingBox(bounding_min, bounding_max);\n\t\t\t\t\tderived_scale = entity_mesh->GetEntity()->getParentNode()->_getDerivedScale();\n\t\t\t\t\tder_size_vector = Vector3df(derived_scale.x, derived_scale.y, derived_scale.z) * (bounding_max - bounding_min);\n\t \n\t\t\t\t\tposition_offset = Vector3df(der_size_vector.x, -der_size_vector.y, der_size_vector.y);\n\t\t\t\t\tlook_at = Vector3df(position_vector.x, position_vector.y, position_vector.z + (position_offset.z\/2));\n\t\t\t\t}\n\t\t\t\telse if (entity_custom_object)\n\t\t\t\t{\n\t\t\t\t\tentity_custom_object->GetBoundingBox(bounding_min, bounding_max);\n\t\t\t\t\tderived_scale = entity_custom_object->GetEntity()->getParentNode()->_getDerivedScale();\n\t\t\t\t\tder_size_vector = Vector3df(derived_scale.x, derived_scale.y, derived_scale.z) * (bounding_max - bounding_min);\n\t \n\t\t\t\t\tfloat max_distance = 0;\n\t\t\t\t\tif (der_size_vector.x > max_distance)\n\t\t\t\t\t\tmax_distance = der_size_vector.x;\n\t\t\t\t\tif (der_size_vector.y > max_distance)\n\t\t\t\t\t\tmax_distance = der_size_vector.y;\n\t\t\t\t\tif (der_size_vector.z > max_distance)\n\t\t\t\t\t\tmax_distance = der_size_vector.z;\n\n\t\t\t\t\tposition_offset = Vector3df(der_size_vector.x, -max_distance, max_distance\/4);\n\t\t\t\t\tlook_at = Vector3df(position_vector.x, position_vector.y, position_vector.z + (position_offset.z\/2));\n\t\t\t\t}\n\t\t\t\telse\n\t\t\t\t\treturn focus_completed;\n\t \n\t\t\t\tcam_ec_placable->SetPosition(position_vector + (entity_ec_placable->GetOrientation() * position_offset));\n\t\t\t\tif (last_dir_ != Vector3df::ZERO)\n\t\t\t\t{\n\t\t\t\t\t\/\/qDebug() << \"Testig\";\n\t\t\t\t\t\/\/cam_ec_placable->SetPosition(cam_ec_placable->GetPosition() + last_dir_);\n\t\t\t\t}\n\t\t\t\tcam_ec_placable->LookAt(look_at);\n\t\t\t\tfocus_completed = true;\n\t\t\t}else\n\t\t\t{\n\t\t\t\tcam_ec_placable->SetPosition(entity_ec_placable->GetPosition() - last_dir_);\n\t\t\t\tcam_ec_placable->LookAt(entity_ec_placable->GetPosition());\n\t\t\t\tfocus_completed = true;\n\t\t\t}\n\t\t\t\n\t\t\t\t\n\t\t\t\treturn focus_completed;\n }\n\n void CameraHandler::RotateCamera(Vector3df pivot, CameraID id, qreal x, qreal y)\n {\n if (id_to_cam_entity_.contains(id))\n {\n Scene::Entity *cam_entity = id_to_cam_entity_[id];\n OgreRenderer::EC_OgreCamera *ec_camera = cam_entity->GetComponent<OgreRenderer::EC_OgreCamera>().get();\n OgreRenderer::EC_OgrePlaceable *cam_ec_placable = cam_entity->GetComponent<OgreRenderer::EC_OgrePlaceable>().get();\n if (!ec_camera || !cam_ec_placable)\n return;\n\n Ogre::Camera* cam = ec_camera->GetCamera();\n Vector3df pos = cam_ec_placable->GetPosition();\n\n Vector3df dir(pos-pivot);\n Quaternion quat(-x,cam_ec_placable->GetLocalYAxis());\n quat *= Quaternion(-y, cam_ec_placable->GetLocalXAxis());\n dir = quat * dir;\n\n Vector3df new_pos(pivot+dir);\n cam_ec_placable->SetPosition(new_pos);\n cam_ec_placable->LookAt(pivot);\n\n\t\t\t\tlast_dir_=pivot - cam_ec_placable->GetPosition();\n }\n }\n\n bool CameraHandler::ZoomRelativeToPoint(Vector3df point, CameraID id, qreal delta, qreal min, qreal max)\n {\n bool zoomed = false;\n if (id_to_cam_entity_.contains(id))\n {\n Scene::Entity *cam_entity = id_to_cam_entity_[id];\n OgreRenderer::EC_OgrePlaceable *placeable = cam_entity->GetComponent<OgreRenderer::EC_OgrePlaceable>().get();\n if (!placeable)\n return false;\n\n Vector3df pos = placeable->GetPosition();\n Vector3df dir = point-pos;\n Vector3df distance = dir;\n dir.normalize();\n dir *=delta;\n \n \/\/something fishy, even if we check that we never go beyond min\/max, we still might end up there and zoom will be disabled. So we check the also\n \/\/if were zooming in or out.\n if(delta>0 && (distance.getLength()+dir.getLength() > min))\n {\n zoomed = true;\n }\n if(delta<0 && (distance.getLength()+dir.getLength() <max))\n {\n zoomed = true;\n }\n if(zoomed)\n {\n placeable->SetPosition(placeable->GetPosition() + dir);\n\t\t\t\t\tlast_dir_ = point-placeable->GetPosition();\n }\n }\n return zoomed;\n }\n\n QPixmap CameraHandler::RenderCamera(CameraID cam_id, QSize image_size)\n {\n \/\/ Get camera\n QImage captured_pixmap(image_size, QImage::Format_ARGB32_Premultiplied);\n captured_pixmap.fill(Qt::gray);\n\n \/\/ Check that this camera ID exists\n if (!id_to_cam_entity_.contains(cam_id))\n return QPixmap::fromImage(captured_pixmap);\n Scene::Entity *cam_entity = id_to_cam_entity_[cam_id];\n\n \/\/ Get the camera ec\n OgreRenderer::EC_OgreCamera *ec_camera = cam_entity->GetComponent<OgreRenderer::EC_OgreCamera>().get();\n if (!ec_camera)\n return QPixmap::fromImage(captured_pixmap);\n\n \/\/ Get our rendering texture\n Ogre::TexturePtr entity_viewport_texture = Ogre::TextureManager::getSingleton().getByName(render_texture_name_);\n if (entity_viewport_texture.isNull())\n return QPixmap::fromImage(captured_pixmap);\n\n \/\/ Re-create rendering texture if size has changed, this has to be done it seems with Ogre 1.7.1\n if (entity_viewport_texture->getWidth() != image_size.width() || entity_viewport_texture->getHeight() != image_size.height())\n {\n Ogre::TextureManager::getSingleton().remove(render_texture_name_);\n render_texture_name_ = \"EntityViewPortTexture_\" + QUuid::createUuid().toString().toStdString();\n entity_viewport_texture = Ogre::TextureManager::getSingleton().createManual(\n render_texture_name_, Ogre::ResourceGroupManager::DEFAULT_RESOURCE_GROUP_NAME,\n Ogre::TEX_TYPE_2D, image_size.width(), image_size.height(), 0, Ogre::PF_A8R8G8B8, Ogre::TU_RENDERTARGET);\n entity_viewport_texture->getBuffer()->getRenderTarget()->setAutoUpdated(false);\n }\n\n \/\/ Set camera aspect ratio\n ec_camera->GetCamera()->setAspectRatio(Ogre::Real(image_size.width()) \/ Ogre::Real(image_size.height()));\n\n \/\/ Get rendering texture and update it\n Ogre::RenderTexture *render_texture = entity_viewport_texture->getBuffer()->getRenderTarget();\n if (render_texture)\n {\n render_texture->removeAllViewports();\n if (render_texture->getNumViewports() == 0)\n {\n Ogre::Viewport *vp = render_texture->addViewport(ec_camera->GetCamera());\n vp->setOverlaysEnabled(false);\n \/\/ Exclude highlight mesh from rendering\n vp->setVisibilityMask(0x2);\n }\n render_texture->update();\n\n \/\/ Copy render target pixels into memory\n SAFE_DELETE(pixelData_);\n \n pixelData_ = new Ogre::uchar[image_size.height() * image_size.width() * 4];\n Ogre::Box bounds(0, 0, image_size.width(), image_size.height());\n Ogre::PixelBox pixels = Ogre::PixelBox(bounds, Ogre::PF_A8R8G8B8, (void*)pixelData_);\n\n \/\/entity_viewport_texture->getBuffer()->blitToMemory(pixels);\n render_texture->copyContentsToMemory(pixels, Ogre::RenderTarget::FB_AUTO);\n\n \/\/ Create a QImage from the memory\n captured_pixmap = QImage(pixelData_, image_size.width(), image_size.height(), QImage::Format_ARGB32_Premultiplied);\n captured_pixmap.save(\"test.png\");\n if (captured_pixmap.isNull())\n WorldBuildingModule::LogDebug(\"Capturing entity to viewport image failed.\");\n }\n \/\/ Return image as a QPixmap\n return QPixmap::fromImage(captured_pixmap);\n }\n }\n}<|endoftext|>"} {"text":"<commit_before>31d6889a-2e3a-11e5-a46f-c03896053bdd<commit_msg>31e5f4b8-2e3a-11e5-8e6f-c03896053bdd<commit_after>31e5f4b8-2e3a-11e5-8e6f-c03896053bdd<|endoftext|>"} {"text":"<commit_before>2f175b52-2e3a-11e5-af5c-c03896053bdd<commit_msg>2f247d12-2e3a-11e5-91df-c03896053bdd<commit_after>2f247d12-2e3a-11e5-91df-c03896053bdd<|endoftext|>"} {"text":"<commit_before>808e1007-2749-11e6-b5ac-e0f84713e7b8<commit_msg>my cat is cute<commit_after>809ed2b0-2749-11e6-be00-e0f84713e7b8<|endoftext|>"} {"text":"<commit_before>\/*\n * The MIT License (MIT)\n *\n * Copyright (c) 2015 MRL-SPL RoboCup Team\n *\n * Permission is hereby granted, free of charge, to any person obtaining a copy\n * of this software and associated documentation files (the \"Software\"), to deal\n * in the Software without restriction, including without limitation the rights\n * to use, copy, modify, merge, publish, distribute, sublicense, and\/or sell\n * copies of the Software, and to permit persons to whom the Software is\n * furnished to do so, subject to the following conditions:\n *\n * The above copyright notice and this permission notice shall be included in all\n * copies or substantial portions of the Software.\n *\n * THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\n * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\n * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE\n * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\n * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,\n * OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE\n * SOFTWARE.\n *\n *\/\n\n\n\/* \n * File: Humanoid.cpp\n * Author: <a href=\"a.sharpasand@mrl-spl.ir\">Mohammad Ali Sharpasand<\/a>\n *\n * Created on February 8, 2016\n *\/\n\n#include \"Humanoid.hpp\"\n#include <ceres\/ceres.h>\n#include \"glog\/logging.h\"\n#include <cmath>\n\nusing ceres::NumericDiffCostFunction;\nusing ceres::CostFunction;\nusing ceres::Problem;\nusing ceres::Solver;\nusing ceres::Solve;\nusing ceres::CENTRAL;\nusing namespace BipedLibrary;\n\nHumanoid::Humanoid(){}\n\nChain Humanoid::leftHand() const\n{\n return leftHand_;\n}\n\nChain Humanoid::rightHand() const\n{\n return rightHand_;\n}\n\nChain Humanoid::head() const\n{\n return head_;\n}\n\nstd::vector <vec3> Humanoid::detectedPoints() const\n{\n\t\treturn detectedPoints_;\n}\n\nstd::vector <vec3> Humanoid::platePoints() const\n{\n\t\treturn platePoints_;\n}\n\nint Humanoid::cameraIndex() const\n{\n\t\treturn cameraIndex_;\n}\n\nstd::vector <Camera> Humanoid::camera() const\n{\n\t\treturn camera_;\n}\n\n\nHumanoid& Humanoid::setLeftHand(Chain const& leftHand)\n{\n leftHand_ = leftHand;\n return *this;\n}\n\nHumanoid& Humanoid::setRightHand(Chain const& rightHand)\n{\n rightHand_ = rightHand;\n return *this;\n}\n\nHumanoid& Humanoid::setHead(Chain const& head)\n{\n head_ = head;\n return *this;\n}\n\nHumanoid& Humanoid::setCamera(Camera const& camera)\n{\n\t\tcamera_.push_back(camera);\n\t\treturn *this;\n}\n\nHumanoid& Humanoid::setCameraIndex(int const& cameraIndex)\n{\n\t\tcameraIndex_ = cameraIndex;\n\t\treturn *this;\n}\n\nHumanoid& Humanoid::setDetectedPoints(std::vector <vec3> detectedPoints)\n{\n\t\tdetectedPoints_ = detectedPoints;\n\t\treturn *this;\n}\n\nHumanoid& Humanoid::setPlatePoints(std::vector <vec3> platePoints)\n{\n\t\tplatePoints_ = platePoints;\n\t\treturn *this;\n}\n\nChain& Humanoid::mutableLeftHand()\n{\n return leftHand_;\n}\n\nChain& Humanoid::mutableRightHand()\n{\n return rightHand_;\n}\n\nChain& Humanoid::mutableHead()\n{\n return head_;\n}\n\nstd::vector <Camera>& Humanoid::mutableCamera()\n{\n\t\treturn camera_;\n}\n\nstd::vector <vec3>& Humanoid::mutableDetectedPoints()\n{\n\t\treturn detectedPoints_;\n}\n\nstd::vector <vec3>& Humanoid::mutablePlatePoints()\n{\n\t\treturn platePoints_;\n}\n\n\n\/\/static bool googleInitialized = false;\n\nvoid Humanoid::calibrate()\n{\n\/\/\tif (!googleInitialized)\n\/\/\t{\n\/\/\t\tgoogle::InitGoogleLogging(\"\");\n\/\/\t\tgoogleInitialized = true;\n\/\/\t}\n\/\/\n\/\/\tclass f1 {\n\/\/\tprivate:\n\/\/\t\tHumanoid& humanoid_;\n\/\/\tpublic:\n\/\/\t\t\tf1(Humanoid& humanoid) : humanoid_(humanoid) { }\n\/\/\t\tbool operator()(const double* const x1, double* residual) const {\n\/\/\t\t\tresidual[0] = x1[0] - 1;\n\/\/\t\t\tresidual[1] = x1[1] - 15;\n\/\/\/\/\t\t\thumanoid_.mutableHead().at(0).mutableTheta() += x[0];\n\/\/\/\/\t\t\thumanoid_.calculateErrors();\n\/\/\t\t\treturn true;\n\/\/\t\t}\n\/\/\t};\n\/\/\n\/\/\/\/\tstruct f2 {\n\/\/\/\/\t\tbool operator()(const double* const x2, double* residual) const {\n\/\/\/\/\t\t\tresidual[0] = x2[0] - 3;\n\/\/\/\/\t\t\treturn true;\n\/\/\/\/\t\t}\n\/\/\/\/\t};\n\/\/\/\/\n\/\/\/\/\tstruct f3 {\n\/\/\/\/\t\tbool operator()(const double* const x3, double* residual) const {\n\/\/\/\/\t\t\tresidual[0] = x3[0] + 3;\n\/\/\/\/\t\t\treturn true;\n\/\/\/\/\t\t}\n\/\/\/\/\t};\n\/\/\tProblem problem;\n\/\/\tdouble x1[2] = {0, 0}; double x2 = 0; double x3 = 0;\n\/\/\tproblem.AddResidualBlock(\n\/\/\t\t\tnew NumericDiffCostFunction<f1, CENTRAL, 2, 2>(new f1(*this)), NULL, x1);\n\/\/\/\/\tproblem.AddResidualBlock(\n\/\/\/\/\t\t\tnew NumericDiffCostFunction<f2, CENTRAL, 1, 1>(new f2), NULL, &x2);\n\/\/\/\/\tproblem.AddResidualBlock(\n\/\/\/\/\t\t\tnew NumericDiffCostFunction<f3, CENTRAL, 1, 1>(new f3), NULL, &x3);\n\/\/\tSolver::Options options;\n\/\/\toptions.max_num_iterations = 100;\n\/\/\toptions.linear_solver_type = ceres::DENSE_QR;\n\/\/\toptions.minimizer_progress_to_stdout = true;\n\/\/\tSolver::Summary summary;\n\/\/\tSolve(options, &problem, &summary);\n\/\/\/\/\tstd::cout << summary.FullReport() << \"\\n\";\n}\n\nvoid Humanoid::calculateErrors()\n{\n\/\/\t\t\/\/PART 1: here posi_C_B_B and ori_C_B are calculated.\n\/\/\t\t\/\/ section 1, from Torso to Base by right leg\n\/\/\t\tconst vec3 posi_RF_T_T = rightLeg().position_end_body_body();\n\/\/\t\tconst vec3 posi_RF_B_B = {0,-50,0};\n\/\/\t\tconst mat33 ori_RF_T = rightLeg().orientation_end_body();\n\/\/\t\tconst mat33 ori_rT_B = trans(ori_RF_T);\n\/\/\t\tconst vec3 posi_rT_B_B = - ori_rT_B * posi_RF_T_T + posi_RF_B_B;\n\/\/\n\/\/\t\t\/\/ section 1.5, from Torso to Base by left leg\n\/\/\t\tconst vec3 posi_LF_T_T = leftLeg().position_end_body_body();\n\/\/\t\tconst vec3 posi_LF_B_B = {0,50,0};\n\/\/\t\tconst mat33 ori_LF_T = leftLeg().orientation_end_body();\n\/\/\t\tconst mat33 ori_lT_B = trans(ori_LF_T);\n\/\/\t\tconst vec3 posi_lT_B_B = - ori_lT_B * posi_LF_T_T + posi_LF_B_B;\n\/\/\n\/\/\t\t\/\/section 1.6\n\/\/\t\tconst vec3 posi_T_B_B = ( posi_lT_B_B + posi_rT_B_B ) \/ 2;\n\/\/\t\tconst mat33 ori_T_B = ( ori_rT_B + ori_lT_B ) \/ 2;\n\/\/\n\/\/\t\t\/\/section 2, from Head to Base\n\/\/\t\tconst vec3 posi_H_T_T = head().position_end_body_body();\n\/\/\t\tconst mat33 ori_H_T = head().orientation_end_body();\n\/\/\t\tconst mat33 ori_H_B = ori_T_B * ori_H_T;\n\/\/\t\tconst vec3 posi_H_B_B = ori_T_B * posi_H_T_T + posi_T_B_B;\n\/\/\n\/\/\t\tint cameraNumber;\n\/\/\t\t\/\/section 3, from Camera to Base\n\/\/\t\tvec3 posi_C_H_H = camera().at(cameraNumber).position();\n\/\/\t\tmat33 ori_C_H = camera().at(cameraNumber).orientation();\n\/\/\n\/\/\t\tmat33 ori_C_B = ori_H_B * ori_C_H;\n\/\/\t\tmat33 ori_I_B = ori_C_B * AxisAngle( { 0, 1, 0 }, M_PI_2).rotationMatrix()\n\/\/\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t* AxisAngle( { 0, 0, 1 }, -M_PI_2).rotationMatrix();\n\/\/\t\tvec3 posi_C_B_B = ori_H_B * posi_C_H_H + posi_H_B_B;\n\/\/\n\/\/\n\/\/\t\tfloat f_C = camera().at(cameraNumber).imageSize().at(0) \/ (2 * std::tan(camera().at(cameraNumber).openAngle().toFloat() \/ 2));\n\/\/\t\t\/\/PART 2: here sample points from plate of current state get sorted\n\/\/\t\t\/\/ in order to get their difference with ordered points from plate\n\/\/\t\tstd::vector<vec_index> unprojectedPoints;\n\/\/\t\tfor (size_t i=0; i<detectedPoints().size(); i++)\n\/\/\t\t\t\t{\n\/\/\t\t\t\t\t\tvec3 posi_Pi_C_C ;\n\/\/\t\t\t\t\t\tposi_Pi_C_C.at(0) = detectedPoints().at(i).at(0) - (camera().at(cameraNumber).imageSize().at(0) \/ 2);\n\/\/\t\t\t\t\t\tposi_Pi_C_C.at(1) = detectedPoints().at(i).at(1) - (camera().at(cameraNumber).imageSize().at(1) \/ 2);\n\/\/\n\/\/\t\t\t\t\t\tposi_Pi_C_C.at(2) = f_C;\n\/\/\t\t\t\t\t\tvec3 posi_Pi_C_B = ori_I_B * posi_Pi_C_C;\n\/\/\n\/\/\t\t\t\t\t\tfloat a = - posi_C_B_B.at(2) \/ posi_Pi_C_B.at(2);\n\/\/\t\t\t\t\t\tvec3 posi_P_C_B = a * posi_Pi_C_B;\n\/\/\t\t\t\t\t\tvec3 posi_P_B_B = posi_C_B_B + posi_P_C_B;\n\/\/\n\/\/\t\t\t\t\t\tvec_index newPoint;\n\/\/\t\t\t\t\t\tnewPoint.index = i;\n\/\/\t\t\t\t\t\tnewPoint.point = posi_P_B_B;\n\/\/\n\/\/\t\t\t\t\t\tunprojectedPoints.push_back(newPoint);\n\/\/\t\t\t\t}\n\/\/\n\/\/\t\tstd::sort (unprojectedPoints.begin(), unprojectedPoints.end(), [](const vec_index& a, const vec_index& b) {\n\/\/\t\t\t\treturn a.point[0] < b.point[0];\n\/\/\t\t});\n\/\/\t\tstd::sort (unprojectedPoints.begin(), unprojectedPoints.begin()+2, [](const vec_index& a, const vec_index& b) {\n\/\/\t\t\t\treturn a.point[1] < b.point[1];\n\/\/\t\t});\n\/\/\t\tstd::sort (unprojectedPoints.begin()+3, unprojectedPoints.begin()+5, [](const vec_index& a, const vec_index& b) {\n\/\/\t\t\t\treturn a.point[1] < b.point[1];\n\/\/\t\t});\n\/\/\t\tstd::sort (unprojectedPoints.begin()+6, unprojectedPoints.end(), [](const vec_index& a, const vec_index& b) {\n\/\/\t\t\t\treturn a.point[1] < b.point[1];\n\/\/\t\t});\n\/\/\n\/\/\t\t\/\/PART 3: here point errors are calculated and added to platePoints vector\n\/\/\t\tfor (size_t i=0; i<detectedPoints().size(); i++)\n\/\/\t\t\t\t{\n\/\/\t\t\t\t\t\tvec3 posi_Pw_B_B = platePoints().at(i);\n\/\/\t\t\t\t\t\tvec3 posi_Pw_C_C = trans(ori_I_B) * (posi_Pw_B_B - posi_C_B_B);\n\/\/\n\/\/\t\t\t\t\t\tfloat a = posi_Pw_C_C.at(2) \/ f_C;\n\/\/\n\/\/\t\t\t\t\t\t\/\/section 5\n\/\/\t\t\t\t\t\tvec3 posi_Pi_C_C;\n\/\/\t\t\t\t\t\tposi_Pi_C_C.at(0) = (1\/a) * posi_Pw_C_C.at(0);\n\/\/\t\t\t\t\t\tposi_Pi_C_C.at(1) = (1\/a) * posi_Pw_C_C.at(1);\n\/\/\t\t\t\t\t\tposi_Pi_C_C.at(2) = f_C;\n\/\/\n\/\/\t\t\t\t\t\tfloat Width = camera().at(cameraNumber).imageSize().at(0) , Height = camera().at(cameraNumber).imageSize().at(1);\n\/\/\t\t\t\t\t\tfloat xi = posi_Pi_C_C.at(0) + Width\/2;\n\/\/\t\t\t\t\t\tfloat yi = posi_Pi_C_C.at(1) + Height\/2;\n\/\/\n\/\/\t\t\t\t\t\tvec2 newPoint = {detectedPoints().at(unprojectedPoints.at(i).index).at(0) - xi,\n\/\/\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tdetectedPoints().at(unprojectedPoints.at(i).index).at(1) - yi};\n\/\/\/\/\t\t\t\t\t\tPlatePoints.push_back(newPoint);\n\/\/\t\t\t\t}\n}\n<commit_msg>removing calibrate function from humanoid.cpp<commit_after>\/*\n * The MIT License (MIT)\n *\n * Copyright (c) 2015 MRL-SPL RoboCup Team\n *\n * Permission is hereby granted, free of charge, to any person obtaining a copy\n * of this software and associated documentation files (the \"Software\"), to deal\n * in the Software without restriction, including without limitation the rights\n * to use, copy, modify, merge, publish, distribute, sublicense, and\/or sell\n * copies of the Software, and to permit persons to whom the Software is\n * furnished to do so, subject to the following conditions:\n *\n * The above copyright notice and this permission notice shall be included in all\n * copies or substantial portions of the Software.\n *\n * THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\n * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\n * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE\n * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\n * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,\n * OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE\n * SOFTWARE.\n *\n *\/\n\n\n\/* \n * File: Humanoid.cpp\n * Author: <a href=\"a.sharpasand@mrl-spl.ir\">Mohammad Ali Sharpasand<\/a>\n *\n * Created on February 8, 2016\n *\/\n\n#include \"Humanoid.hpp\"\n#include <ceres\/ceres.h>\n#include \"glog\/logging.h\"\n#include <cmath>\n\nusing ceres::NumericDiffCostFunction;\nusing ceres::CostFunction;\nusing ceres::Problem;\nusing ceres::Solver;\nusing ceres::Solve;\nusing ceres::CENTRAL;\nusing namespace BipedLibrary;\n\nHumanoid::Humanoid(){}\n\nChain Humanoid::leftHand() const\n{\n return leftHand_;\n}\n\nChain Humanoid::rightHand() const\n{\n return rightHand_;\n}\n\nChain Humanoid::head() const\n{\n return head_;\n}\n\nstd::vector <vec3> Humanoid::detectedPoints() const\n{\n\t\treturn detectedPoints_;\n}\n\nstd::vector <vec3> Humanoid::platePoints() const\n{\n\t\treturn platePoints_;\n}\n\nint Humanoid::cameraIndex() const\n{\n\t\treturn cameraIndex_;\n}\n\nstd::vector <Camera> Humanoid::camera() const\n{\n\t\treturn camera_;\n}\n\n\nHumanoid& Humanoid::setLeftHand(Chain const& leftHand)\n{\n leftHand_ = leftHand;\n return *this;\n}\n\nHumanoid& Humanoid::setRightHand(Chain const& rightHand)\n{\n rightHand_ = rightHand;\n return *this;\n}\n\nHumanoid& Humanoid::setHead(Chain const& head)\n{\n head_ = head;\n return *this;\n}\n\nHumanoid& Humanoid::setCamera(Camera const& camera)\n{\n\t\tcamera_.push_back(camera);\n\t\treturn *this;\n}\n\nHumanoid& Humanoid::setCameraIndex(int const& cameraIndex)\n{\n\t\tcameraIndex_ = cameraIndex;\n\t\treturn *this;\n}\n\nHumanoid& Humanoid::setDetectedPoints(std::vector <vec3> detectedPoints)\n{\n\t\tdetectedPoints_ = detectedPoints;\n\t\treturn *this;\n}\n\nHumanoid& Humanoid::setPlatePoints(std::vector <vec3> platePoints)\n{\n\t\tplatePoints_ = platePoints;\n\t\treturn *this;\n}\n\nChain& Humanoid::mutableLeftHand()\n{\n return leftHand_;\n}\n\nChain& Humanoid::mutableRightHand()\n{\n return rightHand_;\n}\n\nChain& Humanoid::mutableHead()\n{\n return head_;\n}\n\nstd::vector <Camera>& Humanoid::mutableCamera()\n{\n\t\treturn camera_;\n}\n\nstd::vector <vec3>& Humanoid::mutableDetectedPoints()\n{\n\t\treturn detectedPoints_;\n}\n\nstd::vector <vec3>& Humanoid::mutablePlatePoints()\n{\n\t\treturn platePoints_;\n}\n\n\n\/\/static bool googleInitialized = false;\n\nvoid Humanoid::calibrate()\n{\n\/\/\tif (!googleInitialized)\n\/\/\t{\n\/\/\t\tgoogle::InitGoogleLogging(\"\");\n\/\/\t\tgoogleInitialized = true;\n\/\/\t}\n\/\/\n\/\/\tclass f1 {\n\/\/\tprivate:\n\/\/\t\tHumanoid& humanoid_;\n\/\/\tpublic:\n\/\/\t\t\tf1(Humanoid& humanoid) : humanoid_(humanoid) { }\n\/\/\t\tbool operator()(const double* const x1, double* residual) const {\n\/\/\t\t\tresidual[0] = x1[0] - 1;\n\/\/\t\t\tresidual[1] = x1[1] - 15;\n\/\/\/\/\t\t\thumanoid_.mutableHead().at(0).mutableTheta() += x[0];\n\/\/\/\/\t\t\thumanoid_.calculateErrors();\n\/\/\t\t\treturn true;\n\/\/\t\t}\n\/\/\t};\n\/\/\n\/\/\/\/\tstruct f2 {\n\/\/\/\/\t\tbool operator()(const double* const x2, double* residual) const {\n\/\/\/\/\t\t\tresidual[0] = x2[0] - 3;\n\/\/\/\/\t\t\treturn true;\n\/\/\/\/\t\t}\n\/\/\/\/\t};\n\/\/\/\/\n\/\/\/\/\tstruct f3 {\n\/\/\/\/\t\tbool operator()(const double* const x3, double* residual) const {\n\/\/\/\/\t\t\tresidual[0] = x3[0] + 3;\n\/\/\/\/\t\t\treturn true;\n\/\/\/\/\t\t}\n\/\/\/\/\t};\n\/\/\tProblem problem;\n\/\/\tdouble x1[2] = {0, 0}; double x2 = 0; double x3 = 0;\n\/\/\tproblem.AddResidualBlock(\n\/\/\t\t\tnew NumericDiffCostFunction<f1, CENTRAL, 2, 2>(new f1(*this)), NULL, x1);\n\/\/\/\/\tproblem.AddResidualBlock(\n\/\/\/\/\t\t\tnew NumericDiffCostFunction<f2, CENTRAL, 1, 1>(new f2), NULL, &x2);\n\/\/\/\/\tproblem.AddResidualBlock(\n\/\/\/\/\t\t\tnew NumericDiffCostFunction<f3, CENTRAL, 1, 1>(new f3), NULL, &x3);\n\/\/\tSolver::Options options;\n\/\/\toptions.max_num_iterations = 100;\n\/\/\toptions.linear_solver_type = ceres::DENSE_QR;\n\/\/\toptions.minimizer_progress_to_stdout = true;\n\/\/\tSolver::Summary summary;\n\/\/\tSolve(options, &problem, &summary);\n\/\/\/\/\tstd::cout << summary.FullReport() << \"\\n\";\n}\n\n<|endoftext|>"} {"text":"<commit_before><commit_msg>gltfio: show warning for missing normals.<commit_after><|endoftext|>"} {"text":"<commit_before>\/\/---\n\/\/\n\/\/ License: MIT\n\/\/\n\/\/ Author: David Burken\n\/\/\n\/\/ Description: Container class for J2K Image and tile size (SIZ) record.\n\/\/\n\/\/ See document BPJ2K01.00 Table 7-6 Image and tile size (15444-1 Annex A5.1)\n\/\/ \n\/\/---\n\/\/ $Id$\n\n#include <ossim\/support_data\/ossimJ2kSizRecord.h>\n#include <ossim\/base\/ossimConstants.h>\n#include <ossim\/base\/ossimCommon.h>\n#include <ossim\/base\/ossimEndian.h>\n#include <ossim\/base\/ossimIoStream.h>\n#include <iostream>\n#include <iomanip>\n\n\nossimJ2kSizRecord::ossimJ2kSizRecord()\n :\n m_marker(0xff51),\n m_Lsiz(0),\n m_Rsiz(0),\n m_Xsiz(0),\n m_Ysiz(0),\n m_XOsiz(0),\n m_YOsiz(0),\n m_XTsiz(0),\n m_YTsiz(0),\n m_XTOsiz(0),\n m_YTOsiz(0),\n m_Csiz(0),\n m_Ssiz(0),\n m_XRsiz(0),\n m_YRsiz(0)\n{\n}\n\nossimJ2kSizRecord::~ossimJ2kSizRecord()\n{\n}\n\nvoid ossimJ2kSizRecord::parseStream(ossim::istream& in)\n{\n \/\/ Note: Marker is not read.\n in.read((char*)&m_Lsiz, 2);\n in.read((char*)&m_Rsiz, 2);\n in.read((char*)&m_Xsiz, 4);\n in.read((char*)&m_Ysiz, 4);\n in.read((char*)&m_XOsiz, 4);\n in.read((char*)&m_YOsiz, 4);\n in.read((char*)&m_XTsiz, 4);\n in.read((char*)&m_YTsiz, 4);\n in.read((char*)&m_XTOsiz, 4);\n in.read((char*)&m_YTOsiz, 4);\n in.read((char*)&m_Csiz, 2);\n\n if (ossim::byteOrder() == OSSIM_LITTLE_ENDIAN)\n {\n \/\/ Stored in file big endian, must swap.\n ossimEndian s;\n s.swap(m_Lsiz);\n s.swap(m_Rsiz);\n s.swap(m_Xsiz);\n s.swap(m_Ysiz);\n s.swap(m_XOsiz);\n s.swap(m_YOsiz);\n s.swap(m_XTsiz);\n s.swap(m_YTsiz);\n s.swap(m_XTOsiz);\n s.swap(m_YTOsiz);\n s.swap(m_Csiz);\n }\n\n m_Ssiz.resize( m_Csiz );\n in.read((char*)&m_Ssiz.front(), m_Csiz);\n \n m_XRsiz.resize( m_Csiz );\n in.read((char*)&m_XRsiz.front(), m_Csiz);\n \n m_YRsiz.resize( m_Csiz );\n in.read((char*)&m_YRsiz.front(), m_Csiz);\n}\n\nvoid ossimJ2kSizRecord::writeStream(std::ostream& out)\n{\n \/\/ Length of this marker segment(marker not included):\n m_Lsiz = 38 + 3*m_Csiz;\n\n \/\/ Grab component count before swapping:\n ossim_uint16 components = m_Csiz;\n\n ossimEndian* s = 0;\n \n if (ossim::byteOrder() == OSSIM_LITTLE_ENDIAN)\n {\n \/\/ Stored in file big endian, must swap.\n s = new ossimEndian();\n s->swap(m_Lsiz);\n s->swap(m_Rsiz);\n s->swap(m_Xsiz);\n s->swap(m_Ysiz);\n s->swap(m_XOsiz);\n s->swap(m_YOsiz);\n s->swap(m_XTsiz);\n s->swap(m_YTsiz);\n s->swap(m_XTOsiz);\n s->swap(m_YTOsiz);\n s->swap(m_Csiz);\n }\n\n out.write( (char*)&m_marker, 2 );\n out.write((char*)&m_Lsiz, 2);\n out.write((char*)&m_Rsiz, 2);\n out.write((char*)&m_Xsiz, 4);\n out.write((char*)&m_Ysiz, 4);\n out.write((char*)&m_XOsiz, 4);\n out.write((char*)&m_YOsiz, 4);\n out.write((char*)&m_XTsiz, 4);\n out.write((char*)&m_YTsiz, 4);\n out.write((char*)&m_XTOsiz, 4);\n out.write((char*)&m_YTOsiz, 4);\n out.write((char*)&m_Csiz, 2);\n\n out.write((char*)&m_Ssiz.front(), components);\n out.write((char*)&m_XRsiz.front(), components);\n out.write((char*)&m_YRsiz.front(), components);\n\n if ( s )\n {\n \/\/ Swap it back to native.\n s->swap(m_Lsiz);\n s->swap(m_Rsiz);\n s->swap(m_Xsiz);\n s->swap(m_Ysiz);\n s->swap(m_XOsiz);\n s->swap(m_YOsiz);\n s->swap(m_XTsiz);\n s->swap(m_YTsiz);\n s->swap(m_XTOsiz);\n s->swap(m_YTOsiz);\n s->swap(m_Csiz);\n } \n}\n\nossimScalarType ossimJ2kSizRecord::getScalarType() const\n{\n \/\/ Currently assumes all components the same scalar type.\n \n ossimScalarType result = OSSIM_SCALAR_UNKNOWN;\n\n if ( m_Ssiz.size() )\n {\n \/\/ Bits per pixel first seven bits plus one.\n ossim_uint8 bpp = ( m_Ssiz[0] & 0x3f ) + 1;\n \n \/\/ Signed bit is msb.\n bool isSigned = ( m_Ssiz[0] & 0x80 ) ? true : false;\n \n if ( bpp <= 8 )\n {\n if ( isSigned == 0 )\n {\n result = OSSIM_UINT8;\n }\n else if (isSigned == 1)\n {\n result = OSSIM_SINT8;\n }\n }\n else if ( bpp == 11 )\n {\n if ( isSigned == 0 )\n {\n result = OSSIM_USHORT11;\n }\n else\n {\n result = OSSIM_SINT16;\n }\n }\n else if( bpp <= 16 )\n {\n if( isSigned == 0 )\n {\n result = OSSIM_UINT16;\n }\n else if( isSigned == 1 )\n {\n result = OSSIM_SINT16;\n }\n }\n }\n return result;\n}\n\nstd::ostream& ossimJ2kSizRecord::print(std::ostream& out,\n const std::string& prefix) const\n{\n \/\/ Capture the original flags.\n std::ios_base::fmtflags f = out.flags();\n\n std::string pfx = prefix;\n pfx += \"siz.\";\n \n out.setf(std::ios_base::hex, std::ios_base::basefield);\n out << pfx << \"marker: 0x\" << m_marker << \"\\n\";\n out.setf(std::ios_base::fmtflags(0), std::ios_base::basefield);\n\n out << pfx << \"Lsiz: \" << m_Lsiz << \"\\n\"\n << pfx << \"Rsiz: \" << m_Rsiz << \"\\n\"\n << pfx << \"Xsiz: \" << m_Xsiz << \"\\n\"\n << pfx << \"Yziz: \" << m_Ysiz << \"\\n\"\n << pfx << \"XOsiz: \" << m_XOsiz << \"\\n\"\n << pfx << \"YOsiz: \" << m_YOsiz << \"\\n\"\n << pfx << \"XTsiz: \" << m_XTsiz << \"\\n\"\n << pfx << \"YTsiz: \" << m_YTsiz << \"\\n\"\n << pfx << \"XTOsiz: \" << m_XTOsiz << \"\\n\"\n << pfx << \"YTOsiz: \" << m_YTOsiz << \"\\n\"\n << pfx << \"Csiz: \" << m_Csiz << \"\\n\";\n \n for ( ossim_uint16 i = 0; i < m_Csiz; ++i )\n {\n out << pfx << \"Ssiz[\" << i << \"]: \" << int(m_Ssiz[i]) << \"\\n\"\n << pfx << \"XRsiz[\" << i << \"]: \" << int(m_XRsiz[i]) << \"\\n\"\n << pfx << \"YRsiz[\" << i << \"]: \" << int(m_YRsiz[i]) << \"\\n\";\n }\n\n out.flush();\n\n \/\/ Reset flags.\n out.setf(f);\n\n return out;\n}\n\nstd::ostream& operator<<(std::ostream& out, const ossimJ2kSizRecord& obj)\n{\n return obj.print(out);\n}\n<commit_msg>Fixed leak.<commit_after>\/\/---\n\/\/\n\/\/ License: MIT\n\/\/\n\/\/ Author: David Burken\n\/\/\n\/\/ Description: Container class for J2K Image and tile size (SIZ) record.\n\/\/\n\/\/ See document BPJ2K01.00 Table 7-6 Image and tile size (15444-1 Annex A5.1)\n\/\/ \n\/\/---\n\/\/ $Id$\n\n#include <ossim\/support_data\/ossimJ2kSizRecord.h>\n#include <ossim\/base\/ossimConstants.h>\n#include <ossim\/base\/ossimCommon.h>\n#include <ossim\/base\/ossimEndian.h>\n#include <ossim\/base\/ossimIoStream.h>\n#include <iostream>\n#include <iomanip>\n\n\nossimJ2kSizRecord::ossimJ2kSizRecord()\n :\n m_marker(0xff51),\n m_Lsiz(0),\n m_Rsiz(0),\n m_Xsiz(0),\n m_Ysiz(0),\n m_XOsiz(0),\n m_YOsiz(0),\n m_XTsiz(0),\n m_YTsiz(0),\n m_XTOsiz(0),\n m_YTOsiz(0),\n m_Csiz(0),\n m_Ssiz(0),\n m_XRsiz(0),\n m_YRsiz(0)\n{\n}\n\nossimJ2kSizRecord::~ossimJ2kSizRecord()\n{\n}\n\nvoid ossimJ2kSizRecord::parseStream(ossim::istream& in)\n{\n \/\/ Note: Marker is not read.\n in.read((char*)&m_Lsiz, 2);\n in.read((char*)&m_Rsiz, 2);\n in.read((char*)&m_Xsiz, 4);\n in.read((char*)&m_Ysiz, 4);\n in.read((char*)&m_XOsiz, 4);\n in.read((char*)&m_YOsiz, 4);\n in.read((char*)&m_XTsiz, 4);\n in.read((char*)&m_YTsiz, 4);\n in.read((char*)&m_XTOsiz, 4);\n in.read((char*)&m_YTOsiz, 4);\n in.read((char*)&m_Csiz, 2);\n\n if (ossim::byteOrder() == OSSIM_LITTLE_ENDIAN)\n {\n \/\/ Stored in file big endian, must swap.\n ossimEndian s;\n s.swap(m_Lsiz);\n s.swap(m_Rsiz);\n s.swap(m_Xsiz);\n s.swap(m_Ysiz);\n s.swap(m_XOsiz);\n s.swap(m_YOsiz);\n s.swap(m_XTsiz);\n s.swap(m_YTsiz);\n s.swap(m_XTOsiz);\n s.swap(m_YTOsiz);\n s.swap(m_Csiz);\n }\n\n m_Ssiz.resize( m_Csiz );\n in.read((char*)&m_Ssiz.front(), m_Csiz);\n \n m_XRsiz.resize( m_Csiz );\n in.read((char*)&m_XRsiz.front(), m_Csiz);\n \n m_YRsiz.resize( m_Csiz );\n in.read((char*)&m_YRsiz.front(), m_Csiz);\n}\n\nvoid ossimJ2kSizRecord::writeStream(std::ostream& out)\n{\n \/\/ Length of this marker segment(marker not included):\n m_Lsiz = 38 + 3*m_Csiz;\n\n \/\/ Grab component count before swapping:\n ossim_uint16 components = m_Csiz;\n\n ossimEndian* s = 0;\n \n if (ossim::byteOrder() == OSSIM_LITTLE_ENDIAN)\n {\n \/\/ Stored in file big endian, must swap.\n s = new ossimEndian();\n s->swap(m_Lsiz);\n s->swap(m_Rsiz);\n s->swap(m_Xsiz);\n s->swap(m_Ysiz);\n s->swap(m_XOsiz);\n s->swap(m_YOsiz);\n s->swap(m_XTsiz);\n s->swap(m_YTsiz);\n s->swap(m_XTOsiz);\n s->swap(m_YTOsiz);\n s->swap(m_Csiz);\n }\n\n out.write( (char*)&m_marker, 2 );\n out.write((char*)&m_Lsiz, 2);\n out.write((char*)&m_Rsiz, 2);\n out.write((char*)&m_Xsiz, 4);\n out.write((char*)&m_Ysiz, 4);\n out.write((char*)&m_XOsiz, 4);\n out.write((char*)&m_YOsiz, 4);\n out.write((char*)&m_XTsiz, 4);\n out.write((char*)&m_YTsiz, 4);\n out.write((char*)&m_XTOsiz, 4);\n out.write((char*)&m_YTOsiz, 4);\n out.write((char*)&m_Csiz, 2);\n\n out.write((char*)&m_Ssiz.front(), components);\n out.write((char*)&m_XRsiz.front(), components);\n out.write((char*)&m_YRsiz.front(), components);\n\n if ( s )\n {\n \/\/ Swap it back to native.\n s->swap(m_Lsiz);\n s->swap(m_Rsiz);\n s->swap(m_Xsiz);\n s->swap(m_Ysiz);\n s->swap(m_XOsiz);\n s->swap(m_YOsiz);\n s->swap(m_XTsiz);\n s->swap(m_YTsiz);\n s->swap(m_XTOsiz);\n s->swap(m_YTOsiz);\n s->swap(m_Csiz);\n\n \/\/ Cleanup:\n delete s;\n s = 0;\n } \n}\n\nossimScalarType ossimJ2kSizRecord::getScalarType() const\n{\n \/\/ Currently assumes all components the same scalar type.\n \n ossimScalarType result = OSSIM_SCALAR_UNKNOWN;\n\n if ( m_Ssiz.size() )\n {\n \/\/ Bits per pixel first seven bits plus one.\n ossim_uint8 bpp = ( m_Ssiz[0] & 0x3f ) + 1;\n \n \/\/ Signed bit is msb.\n bool isSigned = ( m_Ssiz[0] & 0x80 ) ? true : false;\n \n if ( bpp <= 8 )\n {\n if ( isSigned == 0 )\n {\n result = OSSIM_UINT8;\n }\n else if (isSigned == 1)\n {\n result = OSSIM_SINT8;\n }\n }\n else if ( bpp == 11 )\n {\n if ( isSigned == 0 )\n {\n result = OSSIM_USHORT11;\n }\n else\n {\n result = OSSIM_SINT16;\n }\n }\n else if( bpp <= 16 )\n {\n if( isSigned == 0 )\n {\n result = OSSIM_UINT16;\n }\n else if( isSigned == 1 )\n {\n result = OSSIM_SINT16;\n }\n }\n }\n return result;\n}\n\nstd::ostream& ossimJ2kSizRecord::print(std::ostream& out,\n const std::string& prefix) const\n{\n \/\/ Capture the original flags.\n std::ios_base::fmtflags f = out.flags();\n\n std::string pfx = prefix;\n pfx += \"siz.\";\n \n out.setf(std::ios_base::hex, std::ios_base::basefield);\n out << pfx << \"marker: 0x\" << m_marker << \"\\n\";\n out.setf(std::ios_base::fmtflags(0), std::ios_base::basefield);\n\n out << pfx << \"Lsiz: \" << m_Lsiz << \"\\n\"\n << pfx << \"Rsiz: \" << m_Rsiz << \"\\n\"\n << pfx << \"Xsiz: \" << m_Xsiz << \"\\n\"\n << pfx << \"Yziz: \" << m_Ysiz << \"\\n\"\n << pfx << \"XOsiz: \" << m_XOsiz << \"\\n\"\n << pfx << \"YOsiz: \" << m_YOsiz << \"\\n\"\n << pfx << \"XTsiz: \" << m_XTsiz << \"\\n\"\n << pfx << \"YTsiz: \" << m_YTsiz << \"\\n\"\n << pfx << \"XTOsiz: \" << m_XTOsiz << \"\\n\"\n << pfx << \"YTOsiz: \" << m_YTOsiz << \"\\n\"\n << pfx << \"Csiz: \" << m_Csiz << \"\\n\";\n \n for ( ossim_uint16 i = 0; i < m_Csiz; ++i )\n {\n out << pfx << \"Ssiz[\" << i << \"]: \" << int(m_Ssiz[i]) << \"\\n\"\n << pfx << \"XRsiz[\" << i << \"]: \" << int(m_XRsiz[i]) << \"\\n\"\n << pfx << \"YRsiz[\" << i << \"]: \" << int(m_YRsiz[i]) << \"\\n\";\n }\n\n out.flush();\n\n \/\/ Reset flags.\n out.setf(f);\n\n return out;\n}\n\nstd::ostream& operator<<(std::ostream& out, const ossimJ2kSizRecord& obj)\n{\n return obj.print(out);\n}\n<|endoftext|>"} {"text":"<commit_before>\/**\n * machina\n *\n * Copyright (c) 2014, drmats\n * All rights reserved.\n *\n * https:\/\/github.com\/drmats\/machina\n *\/\n\n#ifndef __SHADER_CPP_\n#define __SHADER_CPP_ 1\n\n#include \"shader.hpp\"\n\nnamespace machina {\n\n\n\n\n\/**\n * Shader source helper macro.\n *\/\n#define GLSL(version, src) \"#version \" #version \"\\n\" #src\n\n\n\n\n\/**\n * OpenGL messages buffer.\n *\/\nGLchar Shader::message_buffer[GL_INFO_LOG_LENGTH] { 0 };\n\n\n\n\n\/**\n * Some shader sources.\n *\/\n\/\/ basic vertex shader -- care about vertex position\nconst std::string Shader::vs_basic = GLSL(130,\n uniform mat4 mvp_matrix;\n in vec3 vertex_position;\n\n void main (void) {\n gl_Position = mvp_matrix * vec4(vertex_position, 1);\n }\n);\n\n\n\/\/ basic fragment shader -- care about fragment color (from uniform)\nconst std::string Shader::fs_basic_color_uniform = GLSL(130,\n uniform vec4 uniform_color;\n out vec4 fragment_color;\n\n void main (void) {\n fragment_color = uniform_color;\n }\n);\n\n\n\/\/ basic vertex shader -- care about vertex position and color\nconst std::string Shader::vs_basic_attribute_color = GLSL(130,\n uniform mat4 mvp_matrix;\n in vec3 vertex_position;\n in vec4 vertex_color;\n smooth out vec4 vertex_fragment_color;\n\n void main (void) {\n vertex_fragment_color = vertex_color;\n gl_Position = mvp_matrix * vec4(vertex_position, 1);\n }\n);\n\n\n\/\/ basic fragment shader -- care about fragment color (from vs)\nconst std::string Shader::fs_basic_color_in = GLSL(130,\n smooth in vec4 vertex_fragment_color;\n out vec4 fragment_color;\n\n void main (void) {\n fragment_color = vertex_fragment_color;\n }\n);\n\n\n\/\/ all attrib vertex shader\nconst std::string Shader::vs_all_attrib = GLSL(130,\n precision highp float;\n\n in vec3 vert_position;\n in vec3 vert_normal;\n in vec2 vert_uv;\n\n uniform mat4 mv_matrix;\n uniform mat4 p_matrix;\n\n smooth out vec3 frag_normal;\n smooth out vec3 frag_position;\n smooth out vec3 frag_mv_position;\n\n vec4 mv_position = mv_matrix * vec4(vert_position, 1);\n mat3 normal_matrix;\n\n void main (void) {\n normal_matrix[0] = mv_matrix[0].xyz;\n normal_matrix[1] = mv_matrix[1].xyz;\n normal_matrix[2] = mv_matrix[2].xyz;\n\n frag_position = vert_position;\n frag_mv_position = mv_position.xyz;\n frag_normal = normalize(normal_matrix * vert_normal);\n\n gl_Position = p_matrix * mv_position;\n }\n);\n\n\n\/\/ all attrib fragment shader\nconst std::string Shader::fs_all_attrib = GLSL(130,\n precision highp float;\n\n uniform vec4 color;\n uniform vec3 light_direction;\n\n smooth in vec3 frag_position;\n smooth in vec3 frag_mv_position;\n smooth in vec3 frag_normal;\n\n out vec4 out_color;\n\n \/\/ const vec3 light_direction = vec3(0.0, 0.0, 1.0);\n \/\/ vec3 mv_light_direction = (mv_matrix * vec4(light_direction, 1.0)).xyz;\n\n \/\/ void main (void) {\n \/\/ \/\/ mix position and normal as color\n \/\/ \/\/ out_color = vec4(\n \/\/ \/\/ mix(\n \/\/ \/\/ normalize(abs(frag_position)),\n \/\/ \/\/ frag_normal,\n \/\/ \/\/ 0.5\n \/\/ \/\/ ), 1\n \/\/ \/\/ );\n\n \/\/ \/\/ simple directional light\n \/\/ out_color.rgb =\n \/\/ color.rgb * max(0.0, dot(frag_normal, light_direction));\n \/\/ out_color.a = color.a;\n \/\/ }\n\n vec2 phong_blinn_directional (\n vec3 direction, float intensity,\n float ambient, float diffuse, float specular, float shininess\n ) {\n vec3 s = normalize(direction);\n vec3 v = normalize(-frag_mv_position);\n vec3 normal = normalize(frag_normal);\n vec3 h = normalize(v + s);\n return vec2(\n ambient + diffuse * intensity * max(0.0, dot(normal, s)),\n specular * pow(max(0.0, dot(normal, h)), shininess)\n );\n }\n\n \/\/ vec3 rim_light (vec3 color, float start, float end, float coef) {\n \/\/ vec3 normal = normalize(frag_normal);\n \/\/ vec3 eye = normalize(-frag_mv_position.xyz);\n \/\/ float rim = smoothstep(start, end, 1.0 - dot(normal, eye));\n \/\/ return clamp(rim, 0.0, 1.0) * coef * color;\n \/\/ }\n\n void main () {\n vec2 params = phong_blinn_directional(\n light_direction, 16.0,\n 0.1, 0.2, 0.8, 256.0\n );\n out_color.rgb = mix(params.x * color.rgb, params.y * color.rgb, 0.8);\n out_color.a = color.a;\n }\n);\n\n\n\n\n\/**\n * Initialization with attribute binding.\n * Example invocation:\n * Shader some_shader {\n * shader::vs_basic,\n * shader::fs_basic, {\n * std::make_tuple(\n * \"vertex_position\", Shader::attrib_index::vertex\n * )\n * } };\n *\/\nShader::Shader (\n const std::string &vs, const std::string &fs,\n const std::initializer_list<\n std::tuple<std::string, Shader::attrib_index>\n > binding\n) throw (std::runtime_error) {\n \/\/ temporary shader objects (load and compile from sources)\n GLuint\n vertex_shader { this->load_shader(GL_VERTEX_SHADER, vs) },\n fragment_shader { this->load_shader(GL_FRAGMENT_SHADER, fs) };\n\n \/\/ status variable (for testing errors)\n GLint status;\n\n \/\/ attach shaders to gl program\n this->program = glCreateProgram();\n glAttachShader(this->program, vertex_shader);\n glAttachShader(this->program, fragment_shader);\n\n \/\/ bind attributes to the gl program\n for (auto it = binding.begin(); it != binding.end(); it++) {\n glBindAttribLocation(\n this->program,\n std::get<1>(*it),\n std::get<0>(*it).data()\n );\n }\n\n \/\/ link gl program\n glLinkProgram(this->program);\n\n \/\/ temporary shaders are no longer needed\n glDeleteShader(vertex_shader);\n glDeleteShader(fragment_shader);\n\n \/\/ check for link errors\n glGetProgramiv(this->program, GL_LINK_STATUS, &status);\n if (status == GL_FALSE) {\n std::string error_message {\n this->get_program_info_log(this->program)\n };\n glDeleteProgram(this->program);\n throw std::runtime_error(error_message);\n }\n}\n\n\n\n\n\/**\n * Clean-up.\n *\/\nShader::~Shader () {\n if (this->program != 0) {\n glDeleteProgram(this->program);\n this->program = 0;\n }\n}\n\n\n\n\n\/**\n * Assign uniforms and use shader.\n * Example invocation:\n * some_shader.use({\n * std::make_tuple(\"mvp_matrix\", [&] (GLuint location) {\n * glUniformMatrix4fv(location, 1, GL_FALSE, *mvp_matrix);\n * })\n * });\n *\/\nconst Shader& Shader::use (\n std::initializer_list<\n std::tuple<std::string, std::function<void (GLint)>>\n > uniforms\n) const {\n glUseProgram(this->program);\n\n for (auto it = uniforms.begin(); it != uniforms.end(); it++) {\n std::get<1>(*it)(\n glGetUniformLocation(\n this->program, (GLchar*)std::get<0>(*it).data()\n )\n );\n }\n\n return *this;\n}\n\n\n\n\n\/**\n * Compile shader from a given source.\n *\/\nGLuint Shader::load_shader (\n GLenum shader_type,\n const std::string &shader_src\n) throw (std::runtime_error) {\n GLuint shader { glCreateShader(shader_type) };\n const GLchar *src { (GLchar*)shader_src.data() };\n GLint status;\n\n glShaderSource(shader, 1, &src, NULL);\n glCompileShader(shader);\n glGetShaderiv(shader, GL_COMPILE_STATUS, &status);\n if (status == GL_FALSE) {\n std::string error_message {\n this->get_shader_info_log(shader)\n };\n glDeleteShader(shader);\n throw std::runtime_error(error_message);\n }\n\n return shader;\n}\n\n\n\n\n\/**\n * Get shader compilation log message.\n *\/\nstd::string Shader::get_shader_info_log (GLuint shader) {\n glGetShaderInfoLog(\n shader, GL_INFO_LOG_LENGTH, NULL, Shader::message_buffer\n );\n return \"GLSL shader: \" + std::string(Shader::message_buffer);\n}\n\n\n\n\n\/**\n * Get program linking log.\n *\/\nstd::string Shader::get_program_info_log (GLuint program) {\n glGetProgramInfoLog(\n program, GL_INFO_LOG_LENGTH, NULL, Shader::message_buffer\n );\n return \"GLSL program: \" + std::string(Shader::message_buffer);\n}\n\n\n\n\n} \/\/ namespace machina\n\n#endif\n<commit_msg>Shader: edge darkening.<commit_after>\/**\n * machina\n *\n * Copyright (c) 2014, drmats\n * All rights reserved.\n *\n * https:\/\/github.com\/drmats\/machina\n *\/\n\n#ifndef __SHADER_CPP_\n#define __SHADER_CPP_ 1\n\n#include \"shader.hpp\"\n\nnamespace machina {\n\n\n\n\n\/**\n * Shader source helper macro.\n *\/\n#define GLSL(version, src) \"#version \" #version \"\\n\" #src\n\n\n\n\n\/**\n * OpenGL messages buffer.\n *\/\nGLchar Shader::message_buffer[GL_INFO_LOG_LENGTH] { 0 };\n\n\n\n\n\/**\n * Some shader sources.\n *\/\n\/\/ basic vertex shader -- care about vertex position\nconst std::string Shader::vs_basic = GLSL(130,\n uniform mat4 mvp_matrix;\n in vec3 vertex_position;\n\n void main (void) {\n gl_Position = mvp_matrix * vec4(vertex_position, 1);\n }\n);\n\n\n\/\/ basic fragment shader -- care about fragment color (from uniform)\nconst std::string Shader::fs_basic_color_uniform = GLSL(130,\n uniform vec4 uniform_color;\n out vec4 fragment_color;\n\n void main (void) {\n fragment_color = uniform_color;\n }\n);\n\n\n\/\/ basic vertex shader -- care about vertex position and color\nconst std::string Shader::vs_basic_attribute_color = GLSL(130,\n uniform mat4 mvp_matrix;\n in vec3 vertex_position;\n in vec4 vertex_color;\n smooth out vec4 vertex_fragment_color;\n\n void main (void) {\n vertex_fragment_color = vertex_color;\n gl_Position = mvp_matrix * vec4(vertex_position, 1);\n }\n);\n\n\n\/\/ basic fragment shader -- care about fragment color (from vs)\nconst std::string Shader::fs_basic_color_in = GLSL(130,\n smooth in vec4 vertex_fragment_color;\n out vec4 fragment_color;\n\n void main (void) {\n fragment_color = vertex_fragment_color;\n }\n);\n\n\n\/\/ all attrib vertex shader\nconst std::string Shader::vs_all_attrib = GLSL(130,\n precision highp float;\n\n in vec3 vert_position;\n in vec3 vert_normal;\n in vec2 vert_uv;\n\n uniform mat4 mv_matrix;\n uniform mat4 p_matrix;\n\n smooth out vec3 frag_normal;\n smooth out vec3 frag_position;\n smooth out vec3 frag_mv_position;\n\n vec4 mv_position = mv_matrix * vec4(vert_position, 1);\n mat3 normal_matrix;\n\n void main (void) {\n normal_matrix[0] = mv_matrix[0].xyz;\n normal_matrix[1] = mv_matrix[1].xyz;\n normal_matrix[2] = mv_matrix[2].xyz;\n\n frag_position = vert_position;\n frag_mv_position = mv_position.xyz;\n frag_normal = normalize(normal_matrix * vert_normal);\n\n gl_Position = p_matrix * mv_position;\n }\n);\n\n\n\/\/ all attrib fragment shader\nconst std::string Shader::fs_all_attrib = GLSL(130,\n precision highp float;\n\n uniform vec4 color;\n uniform vec3 light_direction;\n\n smooth in vec3 frag_position;\n smooth in vec3 frag_mv_position;\n smooth in vec3 frag_normal;\n\n out vec4 out_color;\n\n \/\/ void main (void) {\n \/\/ \/\/ mix position and normal as color\n \/\/ \/\/ out_color = vec4(\n \/\/ \/\/ mix(\n \/\/ \/\/ normalize(abs(frag_position)),\n \/\/ \/\/ frag_normal,\n \/\/ \/\/ 0.5\n \/\/ \/\/ ), 1\n \/\/ \/\/ );\n\n \/\/ \/\/ simple directional light\n \/\/ out_color.rgb =\n \/\/ color.rgb * max(0.0, dot(frag_normal, light_direction));\n \/\/ out_color.a = color.a;\n \/\/ }\n\n vec3 phong_blinn_edge_directional (\n vec3 direction, float intensity,\n float ambient, float diffuse, float specular, float shininess\n ) {\n vec3 s = normalize(direction);\n vec3 v = normalize(-frag_mv_position);\n vec3 normal = normalize(frag_normal);\n vec3 h = normalize(v + s);\n float edge = 1.0 - abs(dot(v, normal));\n return vec3(\n ambient + diffuse * intensity * max(0.0, dot(normal, s)),\n specular * pow(max(0.0, dot(normal, h)), shininess),\n edge*edge\n );\n }\n\n \/\/ vec3 rim_light (vec3 color, float start, float end, float coef) {\n \/\/ vec3 normal = normalize(frag_normal);\n \/\/ vec3 eye = normalize(-frag_mv_position.xyz);\n \/\/ float rim = smoothstep(start, end, 1.0 - dot(normal, eye));\n \/\/ return clamp(rim, 0.0, 1.0) * coef * color;\n \/\/ }\n\n void main () {\n vec3 params = phong_blinn_edge_directional(\n light_direction, 4.0,\n 0.1, 0.2, 0.8, 256.0\n );\n out_color.rgb = clamp(\n params.x * color.rgb + params.y * color.rgb - vec3(params.z*0.1),\n 0, 1\n );\n out_color.a = color.a;\n }\n);\n\n\n\n\n\/**\n * Initialization with attribute binding.\n * Example invocation:\n * Shader some_shader {\n * shader::vs_basic,\n * shader::fs_basic, {\n * std::make_tuple(\n * \"vertex_position\", Shader::attrib_index::vertex\n * )\n * } };\n *\/\nShader::Shader (\n const std::string &vs, const std::string &fs,\n const std::initializer_list<\n std::tuple<std::string, Shader::attrib_index>\n > binding\n) throw (std::runtime_error) {\n \/\/ temporary shader objects (load and compile from sources)\n GLuint\n vertex_shader { this->load_shader(GL_VERTEX_SHADER, vs) },\n fragment_shader { this->load_shader(GL_FRAGMENT_SHADER, fs) };\n\n \/\/ status variable (for testing errors)\n GLint status;\n\n \/\/ attach shaders to gl program\n this->program = glCreateProgram();\n glAttachShader(this->program, vertex_shader);\n glAttachShader(this->program, fragment_shader);\n\n \/\/ bind attributes to the gl program\n for (auto it = binding.begin(); it != binding.end(); it++) {\n glBindAttribLocation(\n this->program,\n std::get<1>(*it),\n std::get<0>(*it).data()\n );\n }\n\n \/\/ link gl program\n glLinkProgram(this->program);\n\n \/\/ temporary shaders are no longer needed\n glDeleteShader(vertex_shader);\n glDeleteShader(fragment_shader);\n\n \/\/ check for link errors\n glGetProgramiv(this->program, GL_LINK_STATUS, &status);\n if (status == GL_FALSE) {\n std::string error_message {\n this->get_program_info_log(this->program)\n };\n glDeleteProgram(this->program);\n throw std::runtime_error(error_message);\n }\n}\n\n\n\n\n\/**\n * Clean-up.\n *\/\nShader::~Shader () {\n if (this->program != 0) {\n glDeleteProgram(this->program);\n this->program = 0;\n }\n}\n\n\n\n\n\/**\n * Assign uniforms and use shader.\n * Example invocation:\n * some_shader.use({\n * std::make_tuple(\"mvp_matrix\", [&] (GLuint location) {\n * glUniformMatrix4fv(location, 1, GL_FALSE, *mvp_matrix);\n * })\n * });\n *\/\nconst Shader& Shader::use (\n std::initializer_list<\n std::tuple<std::string, std::function<void (GLint)>>\n > uniforms\n) const {\n glUseProgram(this->program);\n\n for (auto it = uniforms.begin(); it != uniforms.end(); it++) {\n std::get<1>(*it)(\n glGetUniformLocation(\n this->program, (GLchar*)std::get<0>(*it).data()\n )\n );\n }\n\n return *this;\n}\n\n\n\n\n\/**\n * Compile shader from a given source.\n *\/\nGLuint Shader::load_shader (\n GLenum shader_type,\n const std::string &shader_src\n) throw (std::runtime_error) {\n GLuint shader { glCreateShader(shader_type) };\n const GLchar *src { (GLchar*)shader_src.data() };\n GLint status;\n\n glShaderSource(shader, 1, &src, NULL);\n glCompileShader(shader);\n glGetShaderiv(shader, GL_COMPILE_STATUS, &status);\n if (status == GL_FALSE) {\n std::string error_message {\n this->get_shader_info_log(shader)\n };\n glDeleteShader(shader);\n throw std::runtime_error(error_message);\n }\n\n return shader;\n}\n\n\n\n\n\/**\n * Get shader compilation log message.\n *\/\nstd::string Shader::get_shader_info_log (GLuint shader) {\n glGetShaderInfoLog(\n shader, GL_INFO_LOG_LENGTH, NULL, Shader::message_buffer\n );\n return \"GLSL shader: \" + std::string(Shader::message_buffer);\n}\n\n\n\n\n\/**\n * Get program linking log.\n *\/\nstd::string Shader::get_program_info_log (GLuint program) {\n glGetProgramInfoLog(\n program, GL_INFO_LOG_LENGTH, NULL, Shader::message_buffer\n );\n return \"GLSL program: \" + std::string(Shader::message_buffer);\n}\n\n\n\n\n} \/\/ namespace machina\n\n#endif\n<|endoftext|>"} {"text":"<commit_before>\/\/ Scintilla source code edit control\n\/** @file LexMSSQL.cxx\n ** Lexer for MSSQL.\n **\/\n\/\/ By Filip Yaghob <fyaghob@gmail.com>\n\n\n#include <stdlib.h>\n#include <string.h>\n#include <ctype.h>\n#include <stdio.h>\n#include <stdarg.h>\n\n#include \"Platform.h\"\n\n#include \"PropSet.h\"\n#include \"Accessor.h\"\n#include \"KeyWords.h\"\n#include \"Scintilla.h\"\n#include \"SciLexer.h\"\n\n#define KW_MSSQL_STATEMENTS 0\n#define KW_MSSQL_DATA_TYPES 1\n#define KW_MSSQL_SYSTEM_TABLES 2\n#define KW_MSSQL_GLOBAL_VARIABLES 3\n#define KW_MSSQL_FUNCTIONS 4\n#define KW_MSSQL_STORED_PROCEDURES 5\n#define KW_MSSQL_OPERATORS 6\n\nstatic bool isMSSQLOperator(char ch) {\n\tif (isascii(ch) && isalnum(ch))\n\t\treturn false;\n\t\/\/ '.' left out as it is used to make up numbers\n\tif (ch == '%' || ch == '^' || ch == '&' || ch == '*' ||\n ch == '-' || ch == '+' || ch == '=' || ch == '|' ||\n ch == '<' || ch == '>' || ch == '\/' ||\n ch == '!' || ch == '~' || ch == '(' || ch == ')' ||\n\t\tch == ',')\n\t\treturn true;\n\treturn false;\n}\n\nstatic char classifyWordSQL(unsigned int start,\n unsigned int end,\n WordList *keywordlists[],\n Accessor &styler,\n unsigned int actualState,\n\t\t\t\t\t\t\tunsigned int prevState) {\n\tchar s[256];\n\tbool wordIsNumber = isdigit(styler[start]) || (styler[start] == '.');\n\n\tWordList &kwStatements = *keywordlists[KW_MSSQL_STATEMENTS];\n WordList &kwDataTypes = *keywordlists[KW_MSSQL_DATA_TYPES];\n WordList &kwSystemTables = *keywordlists[KW_MSSQL_SYSTEM_TABLES];\n WordList &kwGlobalVariables = *keywordlists[KW_MSSQL_GLOBAL_VARIABLES];\n WordList &kwFunctions = *keywordlists[KW_MSSQL_FUNCTIONS];\n WordList &kwStoredProcedures = *keywordlists[KW_MSSQL_STORED_PROCEDURES];\n WordList &kwOperators = *keywordlists[KW_MSSQL_OPERATORS];\n\n\tfor (unsigned int i = 0; i < end - start + 1 && i < 128; i++) {\n\t\ts[i] = static_cast<char>(tolower(styler[start + i]));\n\t\ts[i + 1] = '\\0';\n\t}\n\tchar chAttr = SCE_MSSQL_IDENTIFIER;\n\n\tif (actualState == SCE_MSSQL_GLOBAL_VARIABLE) {\n\n if (kwGlobalVariables.InList(&s[2]))\n chAttr = SCE_MSSQL_GLOBAL_VARIABLE;\n\n\t} else if (wordIsNumber) {\n\t\tchAttr = SCE_MSSQL_NUMBER;\n\n\t} else if (prevState == SCE_MSSQL_DEFAULT_PREF_DATATYPE) {\n\t\t\/\/ Look first in datatypes\n if (kwDataTypes.InList(s))\n chAttr = SCE_MSSQL_DATATYPE;\n\t\telse if (kwOperators.InList(s))\n\t\t\tchAttr = SCE_MSSQL_OPERATOR;\n\t\telse if (kwStatements.InList(s))\n\t\t\tchAttr = SCE_MSSQL_STATEMENT;\n\t\telse if (kwSystemTables.InList(s))\n\t\t\tchAttr = SCE_MSSQL_SYSTABLE;\n\t\telse if (kwFunctions.InList(s))\n chAttr = SCE_MSSQL_FUNCTION;\n\t\telse if (kwStoredProcedures.InList(s))\n\t\t\tchAttr = SCE_MSSQL_STORED_PROCEDURE;\n\n\t} else {\n\t\tif (kwOperators.InList(s))\n\t\t\tchAttr = SCE_MSSQL_OPERATOR;\n\t\telse if (kwStatements.InList(s))\n\t\t\tchAttr = SCE_MSSQL_STATEMENT;\n\t\telse if (kwSystemTables.InList(s))\n\t\t\tchAttr = SCE_MSSQL_SYSTABLE;\n\t\telse if (kwFunctions.InList(s))\n\t\t\tchAttr = SCE_MSSQL_FUNCTION;\n\t\telse if (kwStoredProcedures.InList(s))\n\t\t\tchAttr = SCE_MSSQL_STORED_PROCEDURE;\n\t\telse if (kwDataTypes.InList(s))\n\t\t\tchAttr = SCE_MSSQL_DATATYPE;\n\t}\n\n\tstyler.ColourTo(end, chAttr);\n\n\treturn chAttr;\n}\n\nstatic void ColouriseMSSQLDoc(unsigned int startPos, int length,\n int initStyle, WordList *keywordlists[], Accessor &styler) {\n\n\n\tstyler.StartAt(startPos);\n\n\tbool fold = styler.GetPropertyInt(\"fold\") != 0;\n\tint lineCurrent = styler.GetLine(startPos);\n\tint spaceFlags = 0;\n\n\tint state = initStyle;\n\tint prevState = initStyle;\n\tchar chPrev = ' ';\n\tchar chNext = styler[startPos];\n\tstyler.StartSegment(startPos);\n\tunsigned int lengthDoc = startPos + length;\n\tfor (unsigned int i = startPos; i < lengthDoc; i++) {\n\t\tchar ch = chNext;\n\t\tchNext = styler.SafeGetCharAt(i + 1);\n\n\t\tif ((ch == '\\r' && chNext != '\\n') || (ch == '\\n')) {\n\t\t\tint indentCurrent = styler.IndentAmount(lineCurrent, &spaceFlags);\n\t\t\tint lev = indentCurrent;\n\t\t\tif (!(indentCurrent & SC_FOLDLEVELWHITEFLAG)) {\n\t\t\t\t\/\/ Only non whitespace lines can be headers\n\t\t\t\tint indentNext = styler.IndentAmount(lineCurrent + 1, &spaceFlags);\n\t\t\t\tif (indentCurrent < (indentNext & ~SC_FOLDLEVELWHITEFLAG)) {\n\t\t\t\t\tlev |= SC_FOLDLEVELHEADERFLAG;\n\t\t\t\t}\n\t\t\t}\n\t\t\tif (fold) {\n\t\t\t\tstyler.SetLevel(lineCurrent, lev);\n\t\t\t}\n\t\t}\n\n\t\tif (styler.IsLeadByte(ch)) {\n\t\t\tchNext = styler.SafeGetCharAt(i + 2);\n\t\t\tchPrev = ' ';\n\t\t\ti += 1;\n\t\t\tcontinue;\n\t\t}\n\n\t\t\/\/ When the last char isn't part of the state (have to deal with it too)...\n\t\tif ( (state == SCE_MSSQL_IDENTIFIER) ||\n (state == SCE_MSSQL_STORED_PROCEDURE) ||\n (state == SCE_MSSQL_DATATYPE) ||\n \/\/~ (state == SCE_MSSQL_COLUMN_NAME) ||\n (state == SCE_MSSQL_FUNCTION) ||\n \/\/~ (state == SCE_MSSQL_GLOBAL_VARIABLE) ||\n (state == SCE_MSSQL_VARIABLE)) {\n\t\t\tif (!iswordchar(ch)) {\n\t\t\t\tint stateTmp;\n\n if ((state == SCE_MSSQL_VARIABLE) || (state == SCE_MSSQL_COLUMN_NAME)) {\n styler.ColourTo(i - 1, state);\n\t\t\t\t\tstateTmp = state;\n } else\n stateTmp = classifyWordSQL(styler.GetStartSegment(), i - 1, keywordlists, styler, state, prevState);\n\n\t\t\t\tprevState = state;\n\n\t\t\t\tif (stateTmp == SCE_MSSQL_IDENTIFIER || stateTmp == SCE_MSSQL_VARIABLE)\n\t\t\t\t\tstate = SCE_MSSQL_DEFAULT_PREF_DATATYPE;\n\t\t\t\telse\n\t\t\t\t\tstate = SCE_MSSQL_DEFAULT;\n\t\t\t}\n\t\t} else if (state == SCE_MSSQL_LINE_COMMENT) {\n\t\t\tif (ch == '\\r' || ch == '\\n') {\n\t\t\t\tstyler.ColourTo(i - 1, state);\n\t\t\t\tprevState = state;\n\t\t\t\tstate = SCE_MSSQL_DEFAULT;\n\t\t\t}\n\t\t} else if (state == SCE_MSSQL_GLOBAL_VARIABLE) {\n\t\t\tif ((ch != '@') && !iswordchar(ch)) {\n\t\t\t\tclassifyWordSQL(styler.GetStartSegment(), i - 1, keywordlists, styler, state, prevState);\n\t\t\t\tprevState = state;\n\t\t\t\tstate = SCE_MSSQL_DEFAULT;\n\t\t\t}\n\t\t}\n\n\t\t\/\/ If is the default or one of the above succeeded\n\t\tif (state == SCE_MSSQL_DEFAULT || state == SCE_MSSQL_DEFAULT_PREF_DATATYPE) {\n\t\t\tif (iswordstart(ch)) {\n\t\t\t\tstyler.ColourTo(i - 1, SCE_MSSQL_DEFAULT);\n\t\t\t\tprevState = state;\n\t\t\t\tstate = SCE_MSSQL_IDENTIFIER;\n\t\t\t} else if (ch == '\/' && chNext == '*') {\n\t\t\t\tstyler.ColourTo(i - 1, SCE_MSSQL_DEFAULT);\n\t\t\t\tprevState = state;\n\t\t\t\tstate = SCE_MSSQL_COMMENT;\n\t\t\t} else if (ch == '-' && chNext == '-') {\n\t\t\t\tstyler.ColourTo(i - 1, SCE_MSSQL_DEFAULT);\n\t\t\t\tprevState = state;\n\t\t\t\tstate = SCE_MSSQL_LINE_COMMENT;\n\t\t\t} else if (ch == '\\'') {\n\t\t\t\tstyler.ColourTo(i - 1, SCE_MSSQL_DEFAULT);\n\t\t\t\tprevState = state;\n\t\t\t\tstate = SCE_MSSQL_STRING;\n\t\t\t} else if (ch == '\"') {\n\t\t\t\tstyler.ColourTo(i - 1, SCE_MSSQL_DEFAULT);\n\t\t\t\tprevState = state;\n\t\t\t\tstate = SCE_MSSQL_COLUMN_NAME;\n\t\t\t} else if (ch == '[') {\n\t\t\t\tstyler.ColourTo(i - 1, SCE_MSSQL_DEFAULT);\n\t\t\t\tprevState = state;\n\t\t\t\tstate = SCE_MSSQL_COLUMN_NAME_2;\n\t\t\t} else if (isMSSQLOperator(ch)) {\n\t\t\t\tstyler.ColourTo(i - 1, SCE_MSSQL_DEFAULT);\n\t\t\t\tstyler.ColourTo(i, SCE_MSSQL_OPERATOR);\n \/\/~ style = SCE_MSSQL_DEFAULT;\n\t\t\t\tprevState = state;\n\t\t\t\tstate = SCE_MSSQL_DEFAULT;\n\t\t\t} else if (ch == '@') {\n styler.ColourTo(i - 1, SCE_MSSQL_DEFAULT);\n\t\t\t\tprevState = state;\n if (chNext == '@') {\n state = SCE_MSSQL_GLOBAL_VARIABLE;\n\/\/ i += 2;\n } else\n state = SCE_MSSQL_VARIABLE;\n }\n\n\n\t\t\/\/ When the last char is part of the state...\n\t\t} else if (state == SCE_MSSQL_COMMENT) {\n\t\t\t\tif (ch == '\/' && chPrev == '*') {\n\t\t\t\t\tif (((i > (styler.GetStartSegment() + 2)) || ((initStyle == SCE_MSSQL_COMMENT) &&\n\t\t\t\t\t (styler.GetStartSegment() == startPos)))) {\n\t\t\t\t\t\tstyler.ColourTo(i, state);\n\t\t\t\t\t\t\/\/~ state = SCE_MSSQL_COMMENT;\n\t\t\t\t\tprevState = state;\n state = SCE_MSSQL_DEFAULT;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t} else if (state == SCE_MSSQL_STRING) {\n\t\t\t\tif (ch == '\\'') {\n\t\t\t\t\tif ( chNext == '\\'' ) {\n\t\t\t\t\t\ti++;\n\t\t\t\t\tch = chNext;\n\t\t\t\t\tchNext = styler.SafeGetCharAt(i + 1);\n\t\t\t\t\t} else {\n\t\t\t\t\t\tstyler.ColourTo(i, state);\n\t\t\t\t\tprevState = state;\n\t\t\t\t\t\tstate = SCE_MSSQL_DEFAULT;\n\t\t\t\t\t\/\/i++;\n\t\t\t\t\t}\n\t\t\t\t\/\/ch = chNext;\n\t\t\t\t\/\/chNext = styler.SafeGetCharAt(i + 1);\n\t\t\t\t}\n\t\t\t} else if (state == SCE_MSSQL_COLUMN_NAME) {\n\t\t\t\tif (ch == '\"') {\n\t\t\t\t\tif (chNext == '\"') {\n\t\t\t\t\t\ti++;\n\t\t\t\t\tch = chNext;\n\t\t\t\t\tchNext = styler.SafeGetCharAt(i + 1);\n\t\t\t\t} else {\n styler.ColourTo(i, state);\n\t\t\t\t\tprevState = state;\n\t\t\t\t\tstate = SCE_MSSQL_DEFAULT_PREF_DATATYPE;\n\t\t\t\t\t\/\/i++;\n }\n }\n\t\t} else if (state == SCE_MSSQL_COLUMN_NAME_2) {\n\t\t\tif (ch == ']') {\n styler.ColourTo(i, state);\n\t\t\t\tprevState = state;\n state = SCE_MSSQL_DEFAULT_PREF_DATATYPE;\n \/\/i++;\n\t\t\t}\n\t\t}\n\n\t\tchPrev = ch;\n\t}\n\tstyler.ColourTo(lengthDoc - 1, state);\n}\n\nstatic void FoldMSSQLDoc(unsigned int startPos, int length, int, WordList *[], Accessor &styler) {\n\tbool foldComment = styler.GetPropertyInt(\"fold.comment\") != 0;\n\tbool foldCompact = styler.GetPropertyInt(\"fold.compact\", 1) != 0;\n\tunsigned int endPos = startPos + length;\n\tint visibleChars = 0;\n\tint lineCurrent = styler.GetLine(startPos);\n\tint levelPrev = styler.LevelAt(lineCurrent) & SC_FOLDLEVELNUMBERMASK;\n\tint levelCurrent = levelPrev;\n\tchar chNext = styler[startPos];\n\tbool inComment = (styler.StyleAt(startPos-1) == SCE_MSSQL_COMMENT);\n char s[10];\n\tfor (unsigned int i = startPos; i < endPos; i++) {\n\t\tchar ch = chNext;\n\t\tchNext = styler.SafeGetCharAt(i + 1);\n\t\tint style = styler.StyleAt(i);\n\t\tbool atEOL = (ch == '\\r' && chNext != '\\n') || (ch == '\\n');\n \/\/ Comment folding\n\t\tif (foldComment) {\n\t\t\tif (!inComment && (style == SCE_MSSQL_COMMENT))\n\t\t\t\tlevelCurrent++;\n\t\t\telse if (inComment && (style != SCE_MSSQL_COMMENT))\n\t\t\t\tlevelCurrent--;\n\t\t\tinComment = (style == SCE_MSSQL_COMMENT);\n\t\t}\n if (style == SCE_MSSQL_STATEMENT) {\n \/\/ Folding between begin and end\n if (ch == 'b' || ch == 'e') {\n for (unsigned int j = 0; j < 5; j++) {\n\t\t\t\t\tif (!iswordchar(styler[i + j])) {\n\t\t\t\t\t\tbreak;\n\t\t\t\t\t}\n\t\t\t\t\ts[j] = styler[i + j];\n\t\t\t\t\ts[j + 1] = '\\0';\n }\n\t\t\t\tif (strcmp(s, \"begin\") == 0) {\n\t\t\t\t\tlevelCurrent++;\n\t\t\t\t}\n\t\t\t\tif (strcmp(s, \"end\") == 0) {\n\t\t\t\t\tlevelCurrent--;\n\t\t\t\t}\n }\n }\n\t\tif (atEOL) {\n\t\t\tint lev = levelPrev;\n\t\t\tif (visibleChars == 0 && foldCompact)\n\t\t\t\tlev |= SC_FOLDLEVELWHITEFLAG;\n\t\t\tif ((levelCurrent > levelPrev) && (visibleChars > 0))\n\t\t\t\tlev |= SC_FOLDLEVELHEADERFLAG;\n\t\t\tif (lev != styler.LevelAt(lineCurrent)) {\n\t\t\t\tstyler.SetLevel(lineCurrent, lev);\n\t\t\t}\n\t\t\tlineCurrent++;\n\t\t\tlevelPrev = levelCurrent;\n\t\t\tvisibleChars = 0;\n\t\t}\n\t\tif (!isspacechar(ch))\n\t\t\tvisibleChars++;\n\t}\n\t\/\/ Fill in the real level of the next line, keeping the current flags as they will be filled in later\n\tint flagsNext = styler.LevelAt(lineCurrent) & ~SC_FOLDLEVELNUMBERMASK;\n\tstyler.SetLevel(lineCurrent, levelPrev | flagsNext);\n}\n\nstatic const char * const sqlWordListDesc[] = {\n\t\"Statements\",\n \"Data Types\",\n \"System tables\",\n \"Global variables\",\n \"Functions\",\n \"System Stored Procedures\",\n \"Operators\",\n\t0,\n};\n\nLexerModule lmMSSQL(SCLEX_MSSQL, ColouriseMSSQLDoc, \"mssql\", FoldMSSQLDoc, sqlWordListDesc);\n<commit_msg>Added license reference to help the picky.<commit_after>\/\/ Scintilla source code edit control\n\/** @file LexMSSQL.cxx\n ** Lexer for MSSQL.\n **\/\n\/\/ By Filip Yaghob <fyaghob@gmail.com>\n\/\/ The License.txt file describes the conditions under which this software may be distributed.\n\n#include <stdlib.h>\n#include <string.h>\n#include <ctype.h>\n#include <stdio.h>\n#include <stdarg.h>\n\n#include \"Platform.h\"\n\n#include \"PropSet.h\"\n#include \"Accessor.h\"\n#include \"KeyWords.h\"\n#include \"Scintilla.h\"\n#include \"SciLexer.h\"\n\n#define KW_MSSQL_STATEMENTS 0\n#define KW_MSSQL_DATA_TYPES 1\n#define KW_MSSQL_SYSTEM_TABLES 2\n#define KW_MSSQL_GLOBAL_VARIABLES 3\n#define KW_MSSQL_FUNCTIONS 4\n#define KW_MSSQL_STORED_PROCEDURES 5\n#define KW_MSSQL_OPERATORS 6\n\nstatic bool isMSSQLOperator(char ch) {\n\tif (isascii(ch) && isalnum(ch))\n\t\treturn false;\n\t\/\/ '.' left out as it is used to make up numbers\n\tif (ch == '%' || ch == '^' || ch == '&' || ch == '*' ||\n ch == '-' || ch == '+' || ch == '=' || ch == '|' ||\n ch == '<' || ch == '>' || ch == '\/' ||\n ch == '!' || ch == '~' || ch == '(' || ch == ')' ||\n\t\tch == ',')\n\t\treturn true;\n\treturn false;\n}\n\nstatic char classifyWordSQL(unsigned int start,\n unsigned int end,\n WordList *keywordlists[],\n Accessor &styler,\n unsigned int actualState,\n\t\t\t\t\t\t\tunsigned int prevState) {\n\tchar s[256];\n\tbool wordIsNumber = isdigit(styler[start]) || (styler[start] == '.');\n\n\tWordList &kwStatements = *keywordlists[KW_MSSQL_STATEMENTS];\n WordList &kwDataTypes = *keywordlists[KW_MSSQL_DATA_TYPES];\n WordList &kwSystemTables = *keywordlists[KW_MSSQL_SYSTEM_TABLES];\n WordList &kwGlobalVariables = *keywordlists[KW_MSSQL_GLOBAL_VARIABLES];\n WordList &kwFunctions = *keywordlists[KW_MSSQL_FUNCTIONS];\n WordList &kwStoredProcedures = *keywordlists[KW_MSSQL_STORED_PROCEDURES];\n WordList &kwOperators = *keywordlists[KW_MSSQL_OPERATORS];\n\n\tfor (unsigned int i = 0; i < end - start + 1 && i < 128; i++) {\n\t\ts[i] = static_cast<char>(tolower(styler[start + i]));\n\t\ts[i + 1] = '\\0';\n\t}\n\tchar chAttr = SCE_MSSQL_IDENTIFIER;\n\n\tif (actualState == SCE_MSSQL_GLOBAL_VARIABLE) {\n\n if (kwGlobalVariables.InList(&s[2]))\n chAttr = SCE_MSSQL_GLOBAL_VARIABLE;\n\n\t} else if (wordIsNumber) {\n\t\tchAttr = SCE_MSSQL_NUMBER;\n\n\t} else if (prevState == SCE_MSSQL_DEFAULT_PREF_DATATYPE) {\n\t\t\/\/ Look first in datatypes\n if (kwDataTypes.InList(s))\n chAttr = SCE_MSSQL_DATATYPE;\n\t\telse if (kwOperators.InList(s))\n\t\t\tchAttr = SCE_MSSQL_OPERATOR;\n\t\telse if (kwStatements.InList(s))\n\t\t\tchAttr = SCE_MSSQL_STATEMENT;\n\t\telse if (kwSystemTables.InList(s))\n\t\t\tchAttr = SCE_MSSQL_SYSTABLE;\n\t\telse if (kwFunctions.InList(s))\n chAttr = SCE_MSSQL_FUNCTION;\n\t\telse if (kwStoredProcedures.InList(s))\n\t\t\tchAttr = SCE_MSSQL_STORED_PROCEDURE;\n\n\t} else {\n\t\tif (kwOperators.InList(s))\n\t\t\tchAttr = SCE_MSSQL_OPERATOR;\n\t\telse if (kwStatements.InList(s))\n\t\t\tchAttr = SCE_MSSQL_STATEMENT;\n\t\telse if (kwSystemTables.InList(s))\n\t\t\tchAttr = SCE_MSSQL_SYSTABLE;\n\t\telse if (kwFunctions.InList(s))\n\t\t\tchAttr = SCE_MSSQL_FUNCTION;\n\t\telse if (kwStoredProcedures.InList(s))\n\t\t\tchAttr = SCE_MSSQL_STORED_PROCEDURE;\n\t\telse if (kwDataTypes.InList(s))\n\t\t\tchAttr = SCE_MSSQL_DATATYPE;\n\t}\n\n\tstyler.ColourTo(end, chAttr);\n\n\treturn chAttr;\n}\n\nstatic void ColouriseMSSQLDoc(unsigned int startPos, int length,\n int initStyle, WordList *keywordlists[], Accessor &styler) {\n\n\n\tstyler.StartAt(startPos);\n\n\tbool fold = styler.GetPropertyInt(\"fold\") != 0;\n\tint lineCurrent = styler.GetLine(startPos);\n\tint spaceFlags = 0;\n\n\tint state = initStyle;\n\tint prevState = initStyle;\n\tchar chPrev = ' ';\n\tchar chNext = styler[startPos];\n\tstyler.StartSegment(startPos);\n\tunsigned int lengthDoc = startPos + length;\n\tfor (unsigned int i = startPos; i < lengthDoc; i++) {\n\t\tchar ch = chNext;\n\t\tchNext = styler.SafeGetCharAt(i + 1);\n\n\t\tif ((ch == '\\r' && chNext != '\\n') || (ch == '\\n')) {\n\t\t\tint indentCurrent = styler.IndentAmount(lineCurrent, &spaceFlags);\n\t\t\tint lev = indentCurrent;\n\t\t\tif (!(indentCurrent & SC_FOLDLEVELWHITEFLAG)) {\n\t\t\t\t\/\/ Only non whitespace lines can be headers\n\t\t\t\tint indentNext = styler.IndentAmount(lineCurrent + 1, &spaceFlags);\n\t\t\t\tif (indentCurrent < (indentNext & ~SC_FOLDLEVELWHITEFLAG)) {\n\t\t\t\t\tlev |= SC_FOLDLEVELHEADERFLAG;\n\t\t\t\t}\n\t\t\t}\n\t\t\tif (fold) {\n\t\t\t\tstyler.SetLevel(lineCurrent, lev);\n\t\t\t}\n\t\t}\n\n\t\tif (styler.IsLeadByte(ch)) {\n\t\t\tchNext = styler.SafeGetCharAt(i + 2);\n\t\t\tchPrev = ' ';\n\t\t\ti += 1;\n\t\t\tcontinue;\n\t\t}\n\n\t\t\/\/ When the last char isn't part of the state (have to deal with it too)...\n\t\tif ( (state == SCE_MSSQL_IDENTIFIER) ||\n (state == SCE_MSSQL_STORED_PROCEDURE) ||\n (state == SCE_MSSQL_DATATYPE) ||\n \/\/~ (state == SCE_MSSQL_COLUMN_NAME) ||\n (state == SCE_MSSQL_FUNCTION) ||\n \/\/~ (state == SCE_MSSQL_GLOBAL_VARIABLE) ||\n (state == SCE_MSSQL_VARIABLE)) {\n\t\t\tif (!iswordchar(ch)) {\n\t\t\t\tint stateTmp;\n\n if ((state == SCE_MSSQL_VARIABLE) || (state == SCE_MSSQL_COLUMN_NAME)) {\n styler.ColourTo(i - 1, state);\n\t\t\t\t\tstateTmp = state;\n } else\n stateTmp = classifyWordSQL(styler.GetStartSegment(), i - 1, keywordlists, styler, state, prevState);\n\n\t\t\t\tprevState = state;\n\n\t\t\t\tif (stateTmp == SCE_MSSQL_IDENTIFIER || stateTmp == SCE_MSSQL_VARIABLE)\n\t\t\t\t\tstate = SCE_MSSQL_DEFAULT_PREF_DATATYPE;\n\t\t\t\telse\n\t\t\t\t\tstate = SCE_MSSQL_DEFAULT;\n\t\t\t}\n\t\t} else if (state == SCE_MSSQL_LINE_COMMENT) {\n\t\t\tif (ch == '\\r' || ch == '\\n') {\n\t\t\t\tstyler.ColourTo(i - 1, state);\n\t\t\t\tprevState = state;\n\t\t\t\tstate = SCE_MSSQL_DEFAULT;\n\t\t\t}\n\t\t} else if (state == SCE_MSSQL_GLOBAL_VARIABLE) {\n\t\t\tif ((ch != '@') && !iswordchar(ch)) {\n\t\t\t\tclassifyWordSQL(styler.GetStartSegment(), i - 1, keywordlists, styler, state, prevState);\n\t\t\t\tprevState = state;\n\t\t\t\tstate = SCE_MSSQL_DEFAULT;\n\t\t\t}\n\t\t}\n\n\t\t\/\/ If is the default or one of the above succeeded\n\t\tif (state == SCE_MSSQL_DEFAULT || state == SCE_MSSQL_DEFAULT_PREF_DATATYPE) {\n\t\t\tif (iswordstart(ch)) {\n\t\t\t\tstyler.ColourTo(i - 1, SCE_MSSQL_DEFAULT);\n\t\t\t\tprevState = state;\n\t\t\t\tstate = SCE_MSSQL_IDENTIFIER;\n\t\t\t} else if (ch == '\/' && chNext == '*') {\n\t\t\t\tstyler.ColourTo(i - 1, SCE_MSSQL_DEFAULT);\n\t\t\t\tprevState = state;\n\t\t\t\tstate = SCE_MSSQL_COMMENT;\n\t\t\t} else if (ch == '-' && chNext == '-') {\n\t\t\t\tstyler.ColourTo(i - 1, SCE_MSSQL_DEFAULT);\n\t\t\t\tprevState = state;\n\t\t\t\tstate = SCE_MSSQL_LINE_COMMENT;\n\t\t\t} else if (ch == '\\'') {\n\t\t\t\tstyler.ColourTo(i - 1, SCE_MSSQL_DEFAULT);\n\t\t\t\tprevState = state;\n\t\t\t\tstate = SCE_MSSQL_STRING;\n\t\t\t} else if (ch == '\"') {\n\t\t\t\tstyler.ColourTo(i - 1, SCE_MSSQL_DEFAULT);\n\t\t\t\tprevState = state;\n\t\t\t\tstate = SCE_MSSQL_COLUMN_NAME;\n\t\t\t} else if (ch == '[') {\n\t\t\t\tstyler.ColourTo(i - 1, SCE_MSSQL_DEFAULT);\n\t\t\t\tprevState = state;\n\t\t\t\tstate = SCE_MSSQL_COLUMN_NAME_2;\n\t\t\t} else if (isMSSQLOperator(ch)) {\n\t\t\t\tstyler.ColourTo(i - 1, SCE_MSSQL_DEFAULT);\n\t\t\t\tstyler.ColourTo(i, SCE_MSSQL_OPERATOR);\n \/\/~ style = SCE_MSSQL_DEFAULT;\n\t\t\t\tprevState = state;\n\t\t\t\tstate = SCE_MSSQL_DEFAULT;\n\t\t\t} else if (ch == '@') {\n styler.ColourTo(i - 1, SCE_MSSQL_DEFAULT);\n\t\t\t\tprevState = state;\n if (chNext == '@') {\n state = SCE_MSSQL_GLOBAL_VARIABLE;\n\/\/ i += 2;\n } else\n state = SCE_MSSQL_VARIABLE;\n }\n\n\n\t\t\/\/ When the last char is part of the state...\n\t\t} else if (state == SCE_MSSQL_COMMENT) {\n\t\t\t\tif (ch == '\/' && chPrev == '*') {\n\t\t\t\t\tif (((i > (styler.GetStartSegment() + 2)) || ((initStyle == SCE_MSSQL_COMMENT) &&\n\t\t\t\t\t (styler.GetStartSegment() == startPos)))) {\n\t\t\t\t\t\tstyler.ColourTo(i, state);\n\t\t\t\t\t\t\/\/~ state = SCE_MSSQL_COMMENT;\n\t\t\t\t\tprevState = state;\n state = SCE_MSSQL_DEFAULT;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t} else if (state == SCE_MSSQL_STRING) {\n\t\t\t\tif (ch == '\\'') {\n\t\t\t\t\tif ( chNext == '\\'' ) {\n\t\t\t\t\t\ti++;\n\t\t\t\t\tch = chNext;\n\t\t\t\t\tchNext = styler.SafeGetCharAt(i + 1);\n\t\t\t\t\t} else {\n\t\t\t\t\t\tstyler.ColourTo(i, state);\n\t\t\t\t\tprevState = state;\n\t\t\t\t\t\tstate = SCE_MSSQL_DEFAULT;\n\t\t\t\t\t\/\/i++;\n\t\t\t\t\t}\n\t\t\t\t\/\/ch = chNext;\n\t\t\t\t\/\/chNext = styler.SafeGetCharAt(i + 1);\n\t\t\t\t}\n\t\t\t} else if (state == SCE_MSSQL_COLUMN_NAME) {\n\t\t\t\tif (ch == '\"') {\n\t\t\t\t\tif (chNext == '\"') {\n\t\t\t\t\t\ti++;\n\t\t\t\t\tch = chNext;\n\t\t\t\t\tchNext = styler.SafeGetCharAt(i + 1);\n\t\t\t\t} else {\n styler.ColourTo(i, state);\n\t\t\t\t\tprevState = state;\n\t\t\t\t\tstate = SCE_MSSQL_DEFAULT_PREF_DATATYPE;\n\t\t\t\t\t\/\/i++;\n }\n }\n\t\t} else if (state == SCE_MSSQL_COLUMN_NAME_2) {\n\t\t\tif (ch == ']') {\n styler.ColourTo(i, state);\n\t\t\t\tprevState = state;\n state = SCE_MSSQL_DEFAULT_PREF_DATATYPE;\n \/\/i++;\n\t\t\t}\n\t\t}\n\n\t\tchPrev = ch;\n\t}\n\tstyler.ColourTo(lengthDoc - 1, state);\n}\n\nstatic void FoldMSSQLDoc(unsigned int startPos, int length, int, WordList *[], Accessor &styler) {\n\tbool foldComment = styler.GetPropertyInt(\"fold.comment\") != 0;\n\tbool foldCompact = styler.GetPropertyInt(\"fold.compact\", 1) != 0;\n\tunsigned int endPos = startPos + length;\n\tint visibleChars = 0;\n\tint lineCurrent = styler.GetLine(startPos);\n\tint levelPrev = styler.LevelAt(lineCurrent) & SC_FOLDLEVELNUMBERMASK;\n\tint levelCurrent = levelPrev;\n\tchar chNext = styler[startPos];\n\tbool inComment = (styler.StyleAt(startPos-1) == SCE_MSSQL_COMMENT);\n char s[10];\n\tfor (unsigned int i = startPos; i < endPos; i++) {\n\t\tchar ch = chNext;\n\t\tchNext = styler.SafeGetCharAt(i + 1);\n\t\tint style = styler.StyleAt(i);\n\t\tbool atEOL = (ch == '\\r' && chNext != '\\n') || (ch == '\\n');\n \/\/ Comment folding\n\t\tif (foldComment) {\n\t\t\tif (!inComment && (style == SCE_MSSQL_COMMENT))\n\t\t\t\tlevelCurrent++;\n\t\t\telse if (inComment && (style != SCE_MSSQL_COMMENT))\n\t\t\t\tlevelCurrent--;\n\t\t\tinComment = (style == SCE_MSSQL_COMMENT);\n\t\t}\n if (style == SCE_MSSQL_STATEMENT) {\n \/\/ Folding between begin and end\n if (ch == 'b' || ch == 'e') {\n for (unsigned int j = 0; j < 5; j++) {\n\t\t\t\t\tif (!iswordchar(styler[i + j])) {\n\t\t\t\t\t\tbreak;\n\t\t\t\t\t}\n\t\t\t\t\ts[j] = styler[i + j];\n\t\t\t\t\ts[j + 1] = '\\0';\n }\n\t\t\t\tif (strcmp(s, \"begin\") == 0) {\n\t\t\t\t\tlevelCurrent++;\n\t\t\t\t}\n\t\t\t\tif (strcmp(s, \"end\") == 0) {\n\t\t\t\t\tlevelCurrent--;\n\t\t\t\t}\n }\n }\n\t\tif (atEOL) {\n\t\t\tint lev = levelPrev;\n\t\t\tif (visibleChars == 0 && foldCompact)\n\t\t\t\tlev |= SC_FOLDLEVELWHITEFLAG;\n\t\t\tif ((levelCurrent > levelPrev) && (visibleChars > 0))\n\t\t\t\tlev |= SC_FOLDLEVELHEADERFLAG;\n\t\t\tif (lev != styler.LevelAt(lineCurrent)) {\n\t\t\t\tstyler.SetLevel(lineCurrent, lev);\n\t\t\t}\n\t\t\tlineCurrent++;\n\t\t\tlevelPrev = levelCurrent;\n\t\t\tvisibleChars = 0;\n\t\t}\n\t\tif (!isspacechar(ch))\n\t\t\tvisibleChars++;\n\t}\n\t\/\/ Fill in the real level of the next line, keeping the current flags as they will be filled in later\n\tint flagsNext = styler.LevelAt(lineCurrent) & ~SC_FOLDLEVELNUMBERMASK;\n\tstyler.SetLevel(lineCurrent, levelPrev | flagsNext);\n}\n\nstatic const char * const sqlWordListDesc[] = {\n\t\"Statements\",\n \"Data Types\",\n \"System tables\",\n \"Global variables\",\n \"Functions\",\n \"System Stored Procedures\",\n \"Operators\",\n\t0,\n};\n\nLexerModule lmMSSQL(SCLEX_MSSQL, ColouriseMSSQLDoc, \"mssql\", FoldMSSQLDoc, sqlWordListDesc);\n<|endoftext|>"} {"text":"<commit_before>#ifndef NEU_LAYER_LOAD_HPP\n#define NEU_LAYER_LOAD_HPP\n\/\/20151211\n#include <exception>\n#include <yaml-cpp\/yaml.h>\n#include <neu\/layer\/inner_product.hpp>\n#include <neu\/layer\/bias.hpp>\n#include <neu\/layer\/activation\/sigmoid.hpp>\n#include <neu\/layer\/activation\/rectifier.hpp>\n#include <neu\/layer\/activation\/sigmoid_loss.hpp>\n#include <neu\/layer\/any_layer_vector.hpp>\nnamespace neu {\n\tnamespace layer {\n\t\tclass load_error : public std::exception {\n\t\tpublic:\n\t\t\tvirtual const char* what() const noexcept {\n\t\t\t\treturn \"Unknown layer is loaded. Check layer data and load function.\";\n\t\t\t}\n\t\t};\n\t\tany_layer load(YAML::Node const& node, \n\t\t\t\tboost::compute::command_queue& queue) {\n\t\t\tauto lt = node[\"layer_type\"].as<std::string>();\n\t\t\tif(lt == \"inner_product\") {\n\t\t\t\treturn static_cast<any_layer>(load_inner_product(node, queue));\n\t\t\t} else\n\t\t\tif(lt == \"bias\") {\n\t\t\t\treturn static_cast<any_layer>(load_bias(node, queue));\n\t\t\t} else\n\t\t\tif(lt == \"sigmoid\") {\n\t\t\t\treturn static_cast<any_layer>(load_sigmoid(node, queue));\n\t\t\t} else\n\t\t\tif(lt == \"rectifier\") {\n\t\t\t\treturn static_cast<any_layer>(load_rectifier(node, queue));\n\t\t\t} else\n\t\t\tif(lt == \"sigmoid_loss\") {\n\t\t\t\treturn static_cast<any_layer>(load_sigmoid_loss(node, queue));\n\t\t\t} else\n\t\t\tif(lt == \"any_layer_vector\") {\n\t\t\t\treturn static_cast<any_layer>(load_any_layer_vector(node, queue));\n\t\t\t}\n\t\t\telse {\n\t\t\t\tthrow load_error();\n\t\t\t}\n\t\t}\n\t}\n}\/\/ namespace neu\n\n#endif \/\/NEU_LAYER_LOAD_HPP\n<commit_msg>fix load_error<commit_after>#ifndef NEU_LAYER_LOAD_HPP\n#define NEU_LAYER_LOAD_HPP\n\/\/20151211\n#include <exception>\n#include <yaml-cpp\/yaml.h>\n#include <neu\/layer\/inner_product.hpp>\n#include <neu\/layer\/bias.hpp>\n#include <neu\/layer\/activation\/sigmoid.hpp>\n#include <neu\/layer\/activation\/rectifier.hpp>\n#include <neu\/layer\/activation\/sigmoid_loss.hpp>\n#include <neu\/layer\/any_layer_vector.hpp>\nnamespace neu {\n\tnamespace layer {\n\t\tclass load_error : public std::exception {\n\t\tpublic:\n\t\t\texplicit load_error(std::string const& layer_id) : layer_id_(layer_id) {}\n\n\t\t\tvirtual const char* what() const noexcept {\n\t\t\t\treturn (\"Unknown layer \\\"\"+ layer_id_\n\t\t\t\t\t+ \"\\\" is loaded. Check layer data and load function.\").c_str();\n\t\t\t}\n\t\tprivate:\n\t\t\tstd::string layer_id_;\n\t\t};\n\t\tany_layer load(YAML::Node const& node, \n\t\t\t\tboost::compute::command_queue& queue) {\n\t\t\tauto lt = node[\"layer_type\"].as<std::string>();\n\t\t\tif(lt == \"inner_product\") {\n\t\t\t\treturn static_cast<any_layer>(load_inner_product(node, queue));\n\t\t\t} else\n\t\t\tif(lt == \"bias\") {\n\t\t\t\treturn static_cast<any_layer>(load_bias(node, queue));\n\t\t\t} else\n\t\t\tif(lt == \"sigmoid\") {\n\t\t\t\treturn static_cast<any_layer>(load_sigmoid(node, queue));\n\t\t\t} else\n\t\t\tif(lt == \"rectifier\") {\n\t\t\t\treturn static_cast<any_layer>(load_rectifier(node, queue));\n\t\t\t} else\n\t\t\tif(lt == \"sigmoid_loss\") {\n\t\t\t\treturn static_cast<any_layer>(load_sigmoid_loss(node, queue));\n\t\t\t} else\n\t\t\tif(lt == \"any_layer_vector\") {\n\t\t\t\treturn static_cast<any_layer>(load_any_layer_vector(node, queue));\n\t\t\t}\n\t\t\telse {\n\t\t\t\tthrow load_error(lt);\n\t\t\t}\n\t\t}\n\t}\n}\/\/ namespace neu\n\n#endif \/\/NEU_LAYER_LOAD_HPP\n<|endoftext|>"} {"text":"<commit_before>#line 2 \"togo\/resource\/resource_package.cpp\"\n\/**\n@copyright MIT license; see @ref index or the accompanying LICENSE file.\n*\/\n\n#include <togo\/config.hpp>\n#include <togo\/utility\/utility.hpp>\n#include <togo\/error\/assert.hpp>\n#include <togo\/log\/log.hpp>\n#include <togo\/hash\/hash.hpp>\n#include <togo\/collection\/hash_map.hpp>\n#include <togo\/io\/io.hpp>\n#include <togo\/io\/file_stream.hpp>\n#include <togo\/resource\/types.hpp>\n#include <togo\/resource\/resource.hpp>\n#include <togo\/resource\/resource_package.hpp>\n#include <togo\/resource\/resource_manager.hpp>\n#include <togo\/serialization\/serializer.hpp>\n#include <togo\/serialization\/support.hpp>\n#include <togo\/serialization\/binary_serializer.hpp>\n#include <togo\/serialization\/array.hpp>\n#include <togo\/serialization\/resource\/resource_metadata.hpp>\n\nnamespace togo {\n\nResourcePackage::ResourcePackage(\n\tStringRef const& name,\n\tStringRef const& path,\n\tAllocator& allocator\n)\n\t: _name_hash(resource::hash_package_name(name))\n\t, _open_resource_id(0)\n\t, _stream()\n\t, _lookup(allocator)\n\t, _manifest(allocator)\n\t, _name()\n\t, _path()\n{\n\tstring::copy(_name, name);\n\tstring::copy(_path, path);\n}\n\nvoid resource_package::open(\n\tResourcePackage& pkg,\n\tResourceManager const& rm\n) {\n\tTOGO_ASSERT(!pkg._stream.is_open(), \"package is already open\");\n\n\tStringRef const name{pkg._name};\n\tStringRef const path{pkg._path};\n\tTOGO_ASSERTF(\n\t\tpkg._stream.open(path),\n\t\t\"failed to open package '%.*s' at '%.*s'\",\n\t\tname.size, name.data,\n\t\tpath.size, path.data\n\t);\n\n\tBinaryInputSerializer ser{pkg._stream};\n\tu32 format_version = 0;\n\tser % format_version;\n\tTOGO_ASSERTF(\n\t\tformat_version == SER_FORMAT_VERSION_PKG_MANIFEST,\n\t\t\"manifest version %u unsupported from package '%.*s' at '%.*s'\",\n\t\tformat_version,\n\t\tname.size, name.data,\n\t\tpath.size, path.data\n\t);\n\n\tser % make_ser_collection<u32>(pkg._manifest);\n\tfor (u32 i = 0; i < array::size(pkg._manifest); ++i) {\n\t\tauto& metadata = pkg._manifest[i];\n\t\tif (metadata.type == RES_TYPE_NULL) {\n\t\t\tmetadata.id = 0;\n\t\t\tcontinue;\n\t\t}\n\t\tmetadata.id = i + 1;\n\t\thash_map::push(pkg._lookup, metadata.name_hash, metadata.id);\n\t\tTOGO_ASSERTF(\n\t\t\tresource_manager::has_handler(rm, metadata.type),\n\t\t\t\"no handler registered for resource %16lx's type %08x\",\n\t\t\tmetadata.name_hash, metadata.type\n\t\t);\n\t}\n}\n\nvoid resource_package::close(\n\tResourcePackage& pkg\n) {\n\tTOGO_ASSERT(pkg._stream.is_open(), \"package is already closed\");\n\tpkg._stream.close();\n}\n\nResourceMetadata const& resource_package::resource_metadata(\n\tResourcePackage const& pkg,\n\tu32 const id\n) {\n\tTOGO_ASSERT(id > 0 && id <= array::size(pkg._manifest), \"invalid ID\");\n\tauto const& metadata = pkg._manifest[id - 1];\n\tTOGO_DEBUG_ASSERT(metadata.id != 0, \"null entry\");\n\treturn metadata;\n}\n\nResourcePackage::LookupNode* resource_package::find_resource(\n\tResourcePackage& pkg,\n\tResourceType const type,\n\tResourceNameHash const name_hash\n) {\n\tauto* const node = hash_map::get_node(pkg._lookup, name_hash);\n\treturn (node && pkg._manifest[node->value - 1].type == type) ? node : nullptr;\n}\n\nIReader* resource_package::open_resource_stream(\n\tResourcePackage& pkg,\n\tu32 const id\n) {\n\tTOGO_ASSERT(pkg._stream.is_open(), \"package is not open\");\n\tTOGO_ASSERT(pkg._open_resource_id == 0, \"a resource stream is already open\");\n\tTOGO_ASSERT(id > 0 && id <= array::size(pkg._manifest), \"invalid ID\");\n\tauto const& metadata = pkg._manifest[id - 1];\n\tTOGO_ASSERTE(io::seek_to(pkg._stream, metadata.data_offset));\n\tpkg._open_resource_id = id;\n\treturn &pkg._stream;\n}\n\nvoid resource_package::close_resource_stream(\n\tResourcePackage& pkg\n) {\n\tTOGO_ASSERT(pkg._stream.is_open(), \"package is not open\");\n\tTOGO_ASSERT(pkg._open_resource_id != 0, \"no resource stream is open\");\n\t#if defined(TOGO_DEBUG)\n\t\tauto const& metadata = pkg._manifest[pkg._open_resource_id - 1];\n\t\tauto const stream_pos = io::position(pkg._stream);\n\t\tTOGO_DEBUG_ASSERTE(\n\t\t\tstream_pos >= metadata.data_offset &&\n\t\t\tstream_pos <= metadata.data_offset + metadata.data_size\n\t\t);\n\t#endif\n\tpkg._open_resource_id = 0;\n}\n\n} \/\/ namespace togo\n<commit_msg>resource\/resource_package: lookup metadata with resource_metadata().<commit_after>#line 2 \"togo\/resource\/resource_package.cpp\"\n\/**\n@copyright MIT license; see @ref index or the accompanying LICENSE file.\n*\/\n\n#include <togo\/config.hpp>\n#include <togo\/utility\/utility.hpp>\n#include <togo\/error\/assert.hpp>\n#include <togo\/log\/log.hpp>\n#include <togo\/hash\/hash.hpp>\n#include <togo\/collection\/hash_map.hpp>\n#include <togo\/io\/io.hpp>\n#include <togo\/io\/file_stream.hpp>\n#include <togo\/resource\/types.hpp>\n#include <togo\/resource\/resource.hpp>\n#include <togo\/resource\/resource_package.hpp>\n#include <togo\/resource\/resource_manager.hpp>\n#include <togo\/serialization\/serializer.hpp>\n#include <togo\/serialization\/support.hpp>\n#include <togo\/serialization\/binary_serializer.hpp>\n#include <togo\/serialization\/array.hpp>\n#include <togo\/serialization\/resource\/resource_metadata.hpp>\n\nnamespace togo {\n\nResourcePackage::ResourcePackage(\n\tStringRef const& name,\n\tStringRef const& path,\n\tAllocator& allocator\n)\n\t: _name_hash(resource::hash_package_name(name))\n\t, _open_resource_id(0)\n\t, _stream()\n\t, _lookup(allocator)\n\t, _manifest(allocator)\n\t, _name()\n\t, _path()\n{\n\tstring::copy(_name, name);\n\tstring::copy(_path, path);\n}\n\nvoid resource_package::open(\n\tResourcePackage& pkg,\n\tResourceManager const& rm\n) {\n\tTOGO_ASSERT(!pkg._stream.is_open(), \"package is already open\");\n\n\tStringRef const name{pkg._name};\n\tStringRef const path{pkg._path};\n\tTOGO_ASSERTF(\n\t\tpkg._stream.open(path),\n\t\t\"failed to open package '%.*s' at '%.*s'\",\n\t\tname.size, name.data,\n\t\tpath.size, path.data\n\t);\n\n\tBinaryInputSerializer ser{pkg._stream};\n\tu32 format_version = 0;\n\tser % format_version;\n\tTOGO_ASSERTF(\n\t\tformat_version == SER_FORMAT_VERSION_PKG_MANIFEST,\n\t\t\"manifest version %u unsupported from package '%.*s' at '%.*s'\",\n\t\tformat_version,\n\t\tname.size, name.data,\n\t\tpath.size, path.data\n\t);\n\n\tser % make_ser_collection<u32>(pkg._manifest);\n\tfor (u32 i = 0; i < array::size(pkg._manifest); ++i) {\n\t\tauto& metadata = pkg._manifest[i];\n\t\tif (metadata.type == RES_TYPE_NULL) {\n\t\t\tmetadata.id = 0;\n\t\t\tcontinue;\n\t\t}\n\t\tmetadata.id = i + 1;\n\t\thash_map::push(pkg._lookup, metadata.name_hash, metadata.id);\n\t\tTOGO_ASSERTF(\n\t\t\tresource_manager::has_handler(rm, metadata.type),\n\t\t\t\"no handler registered for resource %16lx's type %08x\",\n\t\t\tmetadata.name_hash, metadata.type\n\t\t);\n\t}\n}\n\nvoid resource_package::close(\n\tResourcePackage& pkg\n) {\n\tTOGO_ASSERT(pkg._stream.is_open(), \"package is already closed\");\n\tpkg._stream.close();\n}\n\nResourceMetadata const& resource_package::resource_metadata(\n\tResourcePackage const& pkg,\n\tu32 const id\n) {\n\tTOGO_ASSERT(id > 0 && id <= array::size(pkg._manifest), \"invalid ID\");\n\tauto const& metadata = pkg._manifest[id - 1];\n\tTOGO_DEBUG_ASSERT(metadata.id != 0, \"null entry\");\n\treturn metadata;\n}\n\nResourcePackage::LookupNode* resource_package::find_resource(\n\tResourcePackage& pkg,\n\tResourceType const type,\n\tResourceNameHash const name_hash\n) {\n\tauto* const node = hash_map::get_node(pkg._lookup, name_hash);\n\treturn (node && pkg._manifest[node->value - 1].type == type) ? node : nullptr;\n}\n\nIReader* resource_package::open_resource_stream(\n\tResourcePackage& pkg,\n\tu32 const id\n) {\n\tTOGO_ASSERT(pkg._stream.is_open(), \"package is not open\");\n\tTOGO_ASSERT(pkg._open_resource_id == 0, \"a resource stream is already open\");\n\tauto const& metadata = resource_package::resource_metadata(pkg, id);\n\tTOGO_ASSERTE(io::seek_to(pkg._stream, metadata.data_offset));\n\tpkg._open_resource_id = id;\n\treturn &pkg._stream;\n}\n\nvoid resource_package::close_resource_stream(\n\tResourcePackage& pkg\n) {\n\tTOGO_ASSERT(pkg._stream.is_open(), \"package is not open\");\n\tTOGO_ASSERT(pkg._open_resource_id != 0, \"no resource stream is open\");\n\t#if defined(TOGO_DEBUG)\n\t\tauto const& metadata = resource_package::resource_metadata(\n\t\t\tpkg, pkg._open_resource_id\n\t\t);\n\t\tauto const stream_pos = io::position(pkg._stream);\n\t\tTOGO_DEBUG_ASSERTE(\n\t\t\tstream_pos >= metadata.data_offset &&\n\t\t\tstream_pos <= metadata.data_offset + metadata.data_size\n\t\t);\n\t#endif\n\tpkg._open_resource_id = 0;\n}\n\n} \/\/ namespace togo\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 Albrecht\n\/\/ License: BSD 2-Clause License (http:\/\/opensource.org\/licenses\/BSD-2-Clause)\n\n#ifndef DUNE_GDT_ASSEMBLER_GRIDWALKER_HH\n#define DUNE_GDT_ASSEMBLER_GRIDWALKER_HH\n\n#include <vector>\n#include <memory>\n#include <type_traits>\n\n#include <dune\/stuff\/grid\/boundaryinfo.hh>\n\nnamespace Dune {\nnamespace GDT {\nnamespace Functor {\n\n\ntemplate <class GridViewImp>\nclass Codim0\n{\npublic:\n typedef GridViewImp GridViewType;\n typedef typename GridViewType::template Codim<0>::Entity EntityType;\n\n virtual ~Codim0()\n {\n }\n\n virtual void prepare()\n {\n }\n\n virtual void apply_local(const EntityType& entity) = 0;\n\n virtual void finalize()\n {\n }\n}; \/\/ class Codim0\n\n\ntemplate <class GridViewImp>\nclass Codim1\n{\npublic:\n typedef GridViewImp GridViewType;\n typedef typename GridViewType::template Codim<0>::Entity EntityType;\n typedef typename GridViewType::Intersection IntersectionType;\n\n virtual ~Codim1()\n {\n }\n\n virtual void prepare()\n {\n }\n\n virtual void apply_local(const IntersectionType& intersection) = 0;\n\n virtual void finalize()\n {\n }\n}; \/\/ class Codim1\n\n\n} \/\/ namespace Functor\nnamespace ApplyOn {\n\n\n\/**\n * \\brief Interface for functors to tell on which entity to apply.\n *\n * The derived class has to provide a method with the following signature:\n * \\code\nvirtual bool apply_on(const GridViewType& grid_view, const EntityType& entity) const\n{\n ...\n}\n\\endcode\n *\/\ntemplate <class GridViewImp>\nclass WhichEntity\n{\npublic:\n typedef GridViewImp GridViewType;\n typedef typename GridViewType::template Codim<0>::Entity EntityType;\n\n virtual ~WhichEntity()\n {\n }\n\n virtual bool apply_on(const GridViewType& \/*grid_view*\/, const EntityType& \/*entity*\/) const = 0;\n}; \/\/ class WhichEntity\n\n\n\/**\n * \\brief Selects all entities.\n *\/\ntemplate <class GridViewImp>\nclass AllEntities : public WhichEntity<GridViewImp>\n{\npublic:\n typedef GridViewImp GridViewType;\n typedef typename GridViewType::template Codim<0>::Entity EntityType;\n\n virtual bool apply_on(const GridViewType& \/*grid_view*\/, const EntityType& \/*entity*\/) const DS_OVERRIDE DS_FINAL\n {\n return true;\n }\n}; \/\/ class AllEntities\n\n\n\/**\n * \\brief Selects entities which have a boundary intersection.\n *\/\ntemplate <class GridViewImp>\nclass BoundaryEntities : public WhichEntity<GridViewImp>\n{\npublic:\n typedef GridViewImp GridViewType;\n typedef typename GridViewType::template Codim<0>::Entity EntityType;\n\n virtual bool apply_on(const GridViewType& \/*grid_view*\/, const EntityType& entity) const DS_OVERRIDE DS_FINAL\n {\n return entity.hasBoundaryIntersections();\n }\n}; \/\/ class BoundaryEntities\n\n\n\/**\n * \\brief Interface for functors to tell on which intersection to apply.\n *\n * The derived class has to provide a method with the following signature:\n * \\code\nvirtual bool apply_on(const GridViewType& grid_view, const IntersectionType& intersection) const\n{\n ...\n}\n\\endcode\n *\/\ntemplate <class GridViewImp>\nclass WhichIntersection\n{\npublic:\n typedef GridViewImp GridViewType;\n typedef typename GridViewType::Intersection IntersectionType;\n\n virtual ~WhichIntersection<GridViewImp>()\n {\n }\n\n virtual bool apply_on(const GridViewType& \/*grid_view*\/, const IntersectionType& \/*intersection*\/) const = 0;\n}; \/\/ class WhichIntersection< GridViewImp >\n\n\n\/**\n * \\brief Selects all intersections.\n *\/\ntemplate <class GridViewImp>\nclass AllIntersections : public WhichIntersection<GridViewImp>\n{\npublic:\n typedef GridViewImp GridViewType;\n typedef typename GridViewType::Intersection IntersectionType;\n\n virtual bool apply_on(const GridViewType& \/*grid_view*\/,\n const IntersectionType& \/*intersection*\/) const DS_OVERRIDE DS_FINAL\n {\n return true;\n }\n}; \/\/ class AllIntersections\n\n\n\/**\n * \\brief Selects each inner intersection.\n *\n * To decide if this in an inner intersection,\n\\code\nintersection.neighbor() && !intersection.boundary()\n\\endcode\n * is used.\n *\/\ntemplate <class GridViewImp>\nclass InnerIntersections : public WhichIntersection<GridViewImp>\n{\npublic:\n typedef GridViewImp GridViewType;\n typedef typename GridViewType::Intersection IntersectionType;\n\n virtual bool apply_on(const GridViewType& \/*grid_view*\/,\n const IntersectionType& intersection) const DS_OVERRIDE DS_FINAL\n {\n return intersection.neighbor() && !intersection.boundary();\n }\n}; \/\/ class InnerIntersections\n\n\n\/**\n * \\brief Selects each inner intersection only once.\n *\n * To decide if this in an inner intersection,\n\\code\nintersection.neighbor() && !intersection.boundary()\n\\endcode\n * is used, and true is returned, if the index of the inside() entity is smaller than the index of the outside()\n * entity.\n *\/\ntemplate <class GridViewImp>\nclass InnerIntersectionsPrimally : public WhichIntersection<GridViewImp>\n{\npublic:\n typedef GridViewImp GridViewType;\n typedef typename GridViewType::Intersection IntersectionType;\n\n virtual bool apply_on(const GridViewType& grid_view, const IntersectionType& intersection) const DS_OVERRIDE DS_FINAL\n {\n if (intersection.neighbor() && !intersection.boundary()) {\n const auto insideEntityPtr = intersection.inside();\n const auto& insideEntity = *insideEntityPtr;\n const auto outsideNeighborPtr = intersection.outside();\n const auto& outsideNeighbor = *outsideNeighborPtr;\n return grid_view.indexSet().index(insideEntity) < grid_view.indexSet().index(outsideNeighbor);\n } else\n return false;\n }\n}; \/\/ class InnerIntersections\n\n\ntemplate <class GridViewImp>\nclass BoundaryIntersections : public WhichIntersection<GridViewImp>\n{\npublic:\n typedef GridViewImp GridViewType;\n typedef typename GridViewType::Intersection IntersectionType;\n\n virtual bool apply_on(const GridViewType& \/*grid_view*\/,\n const IntersectionType& intersection) const DS_OVERRIDE DS_FINAL\n {\n return intersection.boundary();\n }\n}; \/\/ class BoundaryIntersections\n\n\ntemplate <class GridViewImp>\nclass DirichletIntersections : public WhichIntersection<GridViewImp>\n{\npublic:\n typedef GridViewImp GridViewType;\n typedef typename GridViewType::Intersection IntersectionType;\n typedef Stuff::GridboundaryInterface<IntersectionType> BoundaryInfoType;\n\n DirichletIntersections(const BoundaryInfoType& boundary_info)\n : boundary_info_(boundary_info)\n {\n }\n\n virtual bool apply_on(const GridViewType& \/*grid_view*\/,\n const IntersectionType& intersection) const DS_OVERRIDE DS_FINAL\n {\n return boundary_info_.dirichlet(intersection);\n }\n\nprivate:\n const BoundaryInfoType& boundary_info_;\n}; \/\/ class DirichletIntersections\n\n\ntemplate <class GridViewImp>\nclass NeumannIntersections : public WhichIntersection<GridViewImp>\n{\npublic:\n typedef GridViewImp GridViewType;\n typedef typename GridViewType::Intersection IntersectionType;\n typedef Stuff::GridboundaryInterface<IntersectionType> BoundaryInfoType;\n\n NeumannIntersections(const BoundaryInfoType& boundary_info)\n : boundary_info_(boundary_info)\n {\n }\n\n virtual bool apply_on(const GridViewType& \/*grid_view*\/,\n const IntersectionType& intersection) const DS_OVERRIDE DS_FINAL\n {\n return boundary_info_.neumann(intersection);\n }\n\nprivate:\n const BoundaryInfoType& boundary_info_;\n}; \/\/ class NeumannIntersections\n\n\n} \/\/ namespace ApplyOn\n\n\ntemplate <class GridViewImp>\nclass GridWalker\n{\n typedef GridWalker<GridViewImp> ThisType;\n\npublic:\n typedef GridViewImp GridViewType;\n typedef typename GridViewType::template Codim<0>::Entity EntityType;\n typedef typename GridViewType::Intersection IntersectionType;\n\nprotected:\n typedef Stuff::GridboundaryInterface<IntersectionType> BoundaryInfoType;\n\n class Codim0Object : public Functor::Codim0<GridViewType>\n {\n public:\n ~Codim0Object()\n {\n }\n virtual bool apply_on(const GridViewType& grid_view, const EntityType& entity) const = 0;\n };\n\n\n template <class Codim0FunctorType>\n class Codim0FunctorWrapper : public Codim0Object\n {\n public:\n Codim0FunctorWrapper(Codim0FunctorType& wrapped_functor, const ApplyOn::WhichEntity<GridViewType>* where)\n : wrapped_functor_(wrapped_functor)\n , where_(where)\n {\n }\n\n virtual ~Codim0FunctorWrapper()\n {\n }\n\n virtual void prepare() DS_OVERRIDE DS_FINAL\n {\n wrapped_functor_.prepare();\n }\n\n virtual bool apply_on(const GridViewType& grid_view, const EntityType& entity) const DS_OVERRIDE DS_FINAL\n {\n return where_->apply_on(grid_view, entity);\n }\n\n virtual void apply_local(const EntityType& entity) DS_OVERRIDE DS_FINAL\n {\n wrapped_functor_.apply_local(entity);\n }\n\n virtual void finalize() DS_OVERRIDE DS_FINAL\n {\n wrapped_functor_.finalize();\n }\n\n private:\n Codim0FunctorType& wrapped_functor_;\n std::unique_ptr<const ApplyOn::WhichEntity<GridViewType>> where_;\n }; \/\/ class Codim0FunctorWrapper\n\n\n class Codim1Object : public Functor::Codim1<GridViewType>\n {\n public:\n ~Codim1Object()\n {\n }\n virtual bool apply_on(const GridViewType& grid_view, const IntersectionType& intersection) const = 0;\n };\n\n\n template <class Codim1FunctorType>\n class Codim1FunctorWrapper : public Codim1Object\n {\n public:\n Codim1FunctorWrapper(Codim1FunctorType& wrapped_functor, const ApplyOn::WhichIntersection<GridViewType>* where)\n : wrapped_functor_(wrapped_functor)\n , where_(where)\n {\n }\n\n virtual void prepare() DS_OVERRIDE DS_FINAL\n {\n wrapped_functor_.prepare();\n }\n\n virtual bool apply_on(const GridViewType& grid_view,\n const IntersectionType& intersection) const DS_OVERRIDE DS_FINAL\n {\n return where_->apply_on(grid_view, intersection);\n }\n\n virtual void apply_local(const IntersectionType& intersection) DS_OVERRIDE DS_FINAL\n {\n wrapped_functor_.apply_local(intersection);\n }\n\n virtual void finalize() DS_OVERRIDE DS_FINAL\n {\n wrapped_functor_.finalize();\n }\n\n private:\n Codim1FunctorType& wrapped_functor_;\n std::unique_ptr<const ApplyOn::WhichIntersection<GridViewType>> where_;\n }; \/\/ class Codim1FunctorWrapper\n\npublic:\n GridWalker(const GridViewType& grid_view)\n : grid_view_(grid_view)\n {\n }\n\n const GridViewType& grid_view() const\n {\n return grid_view_;\n }\n\n void add(Functor::Codim0<GridViewType>& functor,\n const ApplyOn::WhichEntity<GridViewType>* where = new ApplyOn::AllEntities<GridViewType>())\n {\n codim0_functors_.emplace_back(new Codim0FunctorWrapper<Functor::Codim0<GridViewType>>(functor, where));\n }\n\n void add(Functor::Codim1<GridViewType>& functor,\n const ApplyOn::WhichIntersection<GridViewType>* where = new ApplyOn::AllIntersections<GridViewType>())\n {\n codim1_functors_.emplace_back(new Codim1FunctorWrapper<Functor::Codim1<GridViewType>>(functor, where));\n }\n\n void walk(const bool clear_stack = true)\n {\n \/\/ prepare functors\n for (auto& functor : codim0_functors_)\n functor->prepare();\n for (auto& functor : codim1_functors_)\n functor->prepare();\n\n \/\/ only do something, if we have to\n if ((codim0_functors_.size() + codim1_functors_.size()) > 0) {\n \/\/ walk the grid\n const auto entity_it_end = grid_view_.template end<0>();\n for (auto entity_it = grid_view_.template begin<0>(); entity_it != entity_it_end; ++entity_it) {\n const EntityType& entity = *entity_it;\n\n \/\/ apply codim0 functors\n for (auto& functor : codim0_functors_)\n if (functor->apply_on(grid_view_, entity))\n functor->apply_local(entity);\n\n \/\/ only walk the intersections, if there are codim1 functors present\n if (codim1_functors_.size() > 0) {\n \/\/ walk the intersections\n const auto intersection_it_end = grid_view_.iend(entity);\n for (auto intersection_it = grid_view_.ibegin(entity); intersection_it != intersection_it_end;\n ++intersection_it) {\n const auto& intersection = *intersection_it;\n\n \/\/ apply codim1 functors\n for (auto& functor : codim1_functors_)\n if (functor->apply_on(grid_view_, intersection))\n functor->apply_local(intersection);\n\n } \/\/ walk the intersections\n } \/\/ only walk the intersections, if there are codim1 functors present\n } \/\/ walk the grid\n } \/\/ only do something, if we have to\n\n \/\/ finalize functors\n for (auto& functor : codim0_functors_)\n functor->finalize();\n for (auto& functor : codim1_functors_)\n functor->finalize();\n\n \/\/ clear the stack of functors\n if (clear_stack)\n clear();\n } \/\/ ... walk(...)\n\n void clear()\n {\n codim0_functors_ = std::vector<std::unique_ptr<Codim0Object>>();\n codim1_functors_ = std::vector<std::unique_ptr<Codim1Object>>();\n } \/\/ ... clear()\n\nprotected:\n const GridViewType& grid_view_;\n std::vector<std::unique_ptr<Codim0Object>> codim0_functors_;\n std::vector<std::unique_ptr<Codim1Object>> codim1_functors_;\n}; \/\/ class GridWalker\n\n\n} \/\/ namespace GDT\n} \/\/ namespace Dune\n\n#endif \/\/ DUNE_GDT_ASSEMBLER_GRIDWALKER_HH\n<commit_msg>[assembler.gridwalker] * call codim 1 functors with inside and outside entity * adden combinde codim 0 and 1 functor<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_ASSEMBLER_GRIDWALKER_HH\n#define DUNE_GDT_ASSEMBLER_GRIDWALKER_HH\n\n#include <vector>\n#include <memory>\n#include <type_traits>\n\n#include <dune\/stuff\/grid\/boundaryinfo.hh>\n\nnamespace Dune {\nnamespace GDT {\nnamespace Functor {\n\n\ntemplate <class GridViewImp>\nclass Codim0\n{\npublic:\n typedef GridViewImp GridViewType;\n typedef typename GridViewType::template Codim<0>::Entity EntityType;\n\n virtual ~Codim0()\n {\n }\n\n virtual void prepare()\n {\n }\n\n virtual void apply_local(const EntityType& entity) = 0;\n\n virtual void finalize()\n {\n }\n}; \/\/ class Codim0\n\n\ntemplate <class GridViewImp>\nclass Codim1\n{\npublic:\n typedef GridViewImp GridViewType;\n typedef typename GridViewType::template Codim<0>::Entity EntityType;\n typedef typename GridViewType::Intersection IntersectionType;\n\n virtual ~Codim1()\n {\n }\n\n virtual void prepare()\n {\n }\n\n virtual void apply_local(const IntersectionType& \/*intersection*\/, const EntityType& \/*inside_entity*\/,\n const EntityType& \/*outside_entity*\/) = 0;\n\n virtual void finalize()\n {\n }\n}; \/\/ class Codim1\n\n\ntemplate <class GridViewImp>\nclass Codim0And1\n{\npublic:\n typedef GridViewImp GridViewType;\n typedef typename GridViewType::template Codim<0>::Entity EntityType;\n typedef typename GridViewType::Intersection IntersectionType;\n\n virtual ~Codim0And1()\n {\n }\n\n virtual void prepare()\n {\n }\n\n virtual void apply_local(const EntityType& entity) = 0;\n\n virtual void apply_local(const IntersectionType& \/*intersection*\/, const EntityType& \/*inside_entity*\/,\n const EntityType& \/*outside_entity*\/) = 0;\n\n virtual void finalize()\n {\n }\n}; \/\/ class Codim0And1\n\n\n} \/\/ namespace Functor\nnamespace ApplyOn {\n\n\n\/**\n * \\brief Interface for functors to tell on which entity to apply.\n *\n * The derived class has to provide a method with the following signature:\n * \\code\nvirtual bool apply_on(const GridViewType& grid_view, const EntityType& entity) const\n{\n ...\n}\n\\endcode\n *\/\ntemplate <class GridViewImp>\nclass WhichEntity\n{\npublic:\n typedef GridViewImp GridViewType;\n typedef typename GridViewType::template Codim<0>::Entity EntityType;\n\n virtual ~WhichEntity()\n {\n }\n\n virtual bool apply_on(const GridViewType& \/*grid_view*\/, const EntityType& \/*entity*\/) const = 0;\n}; \/\/ class WhichEntity\n\n\n\/**\n * \\brief Selects all entities.\n *\/\ntemplate <class GridViewImp>\nclass AllEntities : public WhichEntity<GridViewImp>\n{\npublic:\n typedef GridViewImp GridViewType;\n typedef typename GridViewType::template Codim<0>::Entity EntityType;\n\n virtual bool apply_on(const GridViewType& \/*grid_view*\/, const EntityType& \/*entity*\/) const DS_OVERRIDE DS_FINAL\n {\n return true;\n }\n}; \/\/ class AllEntities\n\n\n\/**\n * \\brief Selects entities which have a boundary intersection.\n *\/\ntemplate <class GridViewImp>\nclass BoundaryEntities : public WhichEntity<GridViewImp>\n{\npublic:\n typedef GridViewImp GridViewType;\n typedef typename GridViewType::template Codim<0>::Entity EntityType;\n\n virtual bool apply_on(const GridViewType& \/*grid_view*\/, const EntityType& entity) const DS_OVERRIDE DS_FINAL\n {\n return entity.hasBoundaryIntersections();\n }\n}; \/\/ class BoundaryEntities\n\n\n\/**\n * \\brief Interface for functors to tell on which intersection to apply.\n *\n * The derived class has to provide a method with the following signature:\n * \\code\nvirtual bool apply_on(const GridViewType& grid_view, const IntersectionType& intersection) const\n{\n ...\n}\n\\endcode\n *\/\ntemplate <class GridViewImp>\nclass WhichIntersection\n{\npublic:\n typedef GridViewImp GridViewType;\n typedef typename GridViewType::Intersection IntersectionType;\n\n virtual ~WhichIntersection<GridViewImp>()\n {\n }\n\n virtual bool apply_on(const GridViewType& \/*grid_view*\/, const IntersectionType& \/*intersection*\/) const = 0;\n}; \/\/ class WhichIntersection< GridViewImp >\n\n\n\/**\n * \\brief Selects all intersections.\n *\/\ntemplate <class GridViewImp>\nclass AllIntersections : public WhichIntersection<GridViewImp>\n{\npublic:\n typedef GridViewImp GridViewType;\n typedef typename GridViewType::Intersection IntersectionType;\n\n virtual bool apply_on(const GridViewType& \/*grid_view*\/,\n const IntersectionType& \/*intersection*\/) const DS_OVERRIDE DS_FINAL\n {\n return true;\n }\n}; \/\/ class AllIntersections\n\n\n\/**\n * \\brief Selects each inner intersection.\n *\n * To decide if this in an inner intersection,\n\\code\nintersection.neighbor() && !intersection.boundary()\n\\endcode\n * is used.\n *\/\ntemplate <class GridViewImp>\nclass InnerIntersections : public WhichIntersection<GridViewImp>\n{\npublic:\n typedef GridViewImp GridViewType;\n typedef typename GridViewType::Intersection IntersectionType;\n\n virtual bool apply_on(const GridViewType& \/*grid_view*\/,\n const IntersectionType& intersection) const DS_OVERRIDE DS_FINAL\n {\n return intersection.neighbor() && !intersection.boundary();\n }\n}; \/\/ class InnerIntersections\n\n\n\/**\n * \\brief Selects each inner intersection only once.\n *\n * To decide if this in an inner intersection,\n\\code\nintersection.neighbor() && !intersection.boundary()\n\\endcode\n * is used, and true is returned, if the index of the inside() entity is smaller than the index of the outside()\n * entity.\n *\/\ntemplate <class GridViewImp>\nclass InnerIntersectionsPrimally : public WhichIntersection<GridViewImp>\n{\npublic:\n typedef GridViewImp GridViewType;\n typedef typename GridViewType::Intersection IntersectionType;\n\n virtual bool apply_on(const GridViewType& grid_view, const IntersectionType& intersection) const DS_OVERRIDE DS_FINAL\n {\n if (intersection.neighbor() && !intersection.boundary()) {\n const auto insideEntityPtr = intersection.inside();\n const auto& insideEntity = *insideEntityPtr;\n const auto outsideNeighborPtr = intersection.outside();\n const auto& outsideNeighbor = *outsideNeighborPtr;\n return grid_view.indexSet().index(insideEntity) < grid_view.indexSet().index(outsideNeighbor);\n } else\n return false;\n }\n}; \/\/ class InnerIntersections\n\n\ntemplate <class GridViewImp>\nclass BoundaryIntersections : public WhichIntersection<GridViewImp>\n{\npublic:\n typedef GridViewImp GridViewType;\n typedef typename GridViewType::Intersection IntersectionType;\n\n virtual bool apply_on(const GridViewType& \/*grid_view*\/,\n const IntersectionType& intersection) const DS_OVERRIDE DS_FINAL\n {\n return intersection.boundary();\n }\n}; \/\/ class BoundaryIntersections\n\n\ntemplate <class GridViewImp>\nclass DirichletIntersections : public WhichIntersection<GridViewImp>\n{\npublic:\n typedef GridViewImp GridViewType;\n typedef typename GridViewType::Intersection IntersectionType;\n typedef Stuff::GridboundaryInterface<IntersectionType> BoundaryInfoType;\n\n DirichletIntersections(const BoundaryInfoType& boundary_info)\n : boundary_info_(boundary_info)\n {\n }\n\n virtual bool apply_on(const GridViewType& \/*grid_view*\/,\n const IntersectionType& intersection) const DS_OVERRIDE DS_FINAL\n {\n return boundary_info_.dirichlet(intersection);\n }\n\nprivate:\n const BoundaryInfoType& boundary_info_;\n}; \/\/ class DirichletIntersections\n\n\ntemplate <class GridViewImp>\nclass NeumannIntersections : public WhichIntersection<GridViewImp>\n{\npublic:\n typedef GridViewImp GridViewType;\n typedef typename GridViewType::Intersection IntersectionType;\n typedef Stuff::GridboundaryInterface<IntersectionType> BoundaryInfoType;\n\n NeumannIntersections(const BoundaryInfoType& boundary_info)\n : boundary_info_(boundary_info)\n {\n }\n\n virtual bool apply_on(const GridViewType& \/*grid_view*\/,\n const IntersectionType& intersection) const DS_OVERRIDE DS_FINAL\n {\n return boundary_info_.neumann(intersection);\n }\n\nprivate:\n const BoundaryInfoType& boundary_info_;\n}; \/\/ class NeumannIntersections\n\n\n} \/\/ namespace ApplyOn\n\n\ntemplate <class GridViewImp>\nclass GridWalker\n{\n typedef GridWalker<GridViewImp> ThisType;\n\npublic:\n typedef GridViewImp GridViewType;\n typedef typename GridViewType::template Codim<0>::Entity EntityType;\n typedef typename GridViewType::Intersection IntersectionType;\n\nprotected:\n typedef Stuff::GridboundaryInterface<IntersectionType> BoundaryInfoType;\n\n class Codim0Object : public Functor::Codim0<GridViewType>\n {\n public:\n ~Codim0Object()\n {\n }\n virtual bool apply_on(const GridViewType& grid_view, const EntityType& entity) const = 0;\n };\n\n\n template <class Codim0FunctorType>\n class Codim0FunctorWrapper : public Codim0Object\n {\n public:\n Codim0FunctorWrapper(Codim0FunctorType& wrapped_functor, const ApplyOn::WhichEntity<GridViewType>* where)\n : wrapped_functor_(wrapped_functor)\n , where_(where)\n {\n }\n\n virtual ~Codim0FunctorWrapper()\n {\n }\n\n virtual void prepare() DS_OVERRIDE DS_FINAL\n {\n wrapped_functor_.prepare();\n }\n\n virtual bool apply_on(const GridViewType& grid_view, const EntityType& entity) const DS_OVERRIDE DS_FINAL\n {\n return where_->apply_on(grid_view, entity);\n }\n\n virtual void apply_local(const EntityType& entity) DS_OVERRIDE DS_FINAL\n {\n wrapped_functor_.apply_local(entity);\n }\n\n virtual void finalize() DS_OVERRIDE DS_FINAL\n {\n wrapped_functor_.finalize();\n }\n\n private:\n Codim0FunctorType& wrapped_functor_;\n std::unique_ptr<const ApplyOn::WhichEntity<GridViewType>> where_;\n }; \/\/ class Codim0FunctorWrapper\n\n\n class Codim1Object : public Functor::Codim1<GridViewType>\n {\n public:\n ~Codim1Object()\n {\n }\n virtual bool apply_on(const GridViewType& grid_view, const IntersectionType& intersection) const = 0;\n };\n\n\n template <class Codim1FunctorType>\n class Codim1FunctorWrapper : public Codim1Object\n {\n public:\n Codim1FunctorWrapper(Codim1FunctorType& wrapped_functor, const ApplyOn::WhichIntersection<GridViewType>* where)\n : wrapped_functor_(wrapped_functor)\n , where_(where)\n {\n }\n\n virtual void prepare() DS_OVERRIDE DS_FINAL\n {\n wrapped_functor_.prepare();\n }\n\n virtual bool apply_on(const GridViewType& grid_view,\n const IntersectionType& intersection) const DS_OVERRIDE DS_FINAL\n {\n return where_->apply_on(grid_view, intersection);\n }\n\n virtual void apply_local(const IntersectionType& intersection, const EntityType& inside_entity,\n const EntityType& outside_entity) DS_OVERRIDE DS_FINAL\n {\n wrapped_functor_.apply_local(intersection, inside_entity, outside_entity);\n }\n\n virtual void finalize() DS_OVERRIDE DS_FINAL\n {\n wrapped_functor_.finalize();\n }\n\n private:\n Codim1FunctorType& wrapped_functor_;\n std::unique_ptr<const ApplyOn::WhichIntersection<GridViewType>> where_;\n }; \/\/ class Codim1FunctorWrapper\n\npublic:\n GridWalker(const GridViewType& grid_view)\n : grid_view_(grid_view)\n {\n }\n\n const GridViewType& grid_view() const\n {\n return grid_view_;\n }\n\n void add(Functor::Codim0<GridViewType>& functor,\n const ApplyOn::WhichEntity<GridViewType>* where = new ApplyOn::AllEntities<GridViewType>())\n {\n codim0_functors_.emplace_back(new Codim0FunctorWrapper<Functor::Codim0<GridViewType>>(functor, where));\n }\n\n void add(Functor::Codim1<GridViewType>& functor,\n const ApplyOn::WhichIntersection<GridViewType>* where = new ApplyOn::AllIntersections<GridViewType>())\n {\n codim1_functors_.emplace_back(new Codim1FunctorWrapper<Functor::Codim1<GridViewType>>(functor, where));\n }\n\n void add(Functor::Codim0And1<GridViewType>& functor,\n const ApplyOn::WhichEntity<GridViewType>* which_entities = new ApplyOn::AllEntities<GridViewType>(),\n const ApplyOn::WhichIntersection<GridViewType>* which_intersections =\n new ApplyOn::AllIntersections<GridViewType>())\n {\n codim0_functors_.emplace_back(new Codim0FunctorWrapper<Functor::Codim0And1<GridViewType>>(functor, which_entities));\n codim1_functors_.emplace_back(\n new Codim1FunctorWrapper<Functor::Codim0And1<GridViewType>>(functor, which_intersections));\n }\n\n void add(Functor::Codim0And1<GridViewType>& functor,\n const ApplyOn::WhichIntersection<GridViewType>* which_intersections,\n const ApplyOn::WhichEntity<GridViewType>* which_entities = new ApplyOn::AllEntities<GridViewType>())\n {\n codim0_functors_.emplace_back(new Codim0FunctorWrapper<Functor::Codim0And1<GridViewType>>(functor, which_entities));\n codim1_functors_.emplace_back(\n new Codim1FunctorWrapper<Functor::Codim0And1<GridViewType>>(functor, which_intersections));\n }\n\n void walk(const bool clear_stack = true)\n {\n \/\/ prepare functors\n for (auto& functor : codim0_functors_)\n functor->prepare();\n for (auto& functor : codim1_functors_)\n functor->prepare();\n\n \/\/ only do something, if we have to\n if ((codim0_functors_.size() + codim1_functors_.size()) > 0) {\n \/\/ walk the grid\n const auto entity_it_end = grid_view_.template end<0>();\n for (auto entity_it = grid_view_.template begin<0>(); entity_it != entity_it_end; ++entity_it) {\n const EntityType& entity = *entity_it;\n\n \/\/ apply codim0 functors\n for (auto& functor : codim0_functors_)\n if (functor->apply_on(grid_view_, entity))\n functor->apply_local(entity);\n\n \/\/ only walk the intersections, if there are codim1 functors present\n if (codim1_functors_.size() > 0) {\n \/\/ walk the intersections\n const auto intersection_it_end = grid_view_.iend(entity);\n for (auto intersection_it = grid_view_.ibegin(entity); intersection_it != intersection_it_end;\n ++intersection_it) {\n const auto& intersection = *intersection_it;\n\n \/\/ apply codim1 functors\n if (intersection.neighbor()) {\n const auto neighbor_ptr = intersection.outside();\n const auto& neighbor = *neighbor_ptr;\n for (auto& functor : codim1_functors_)\n if (functor->apply_on(grid_view_, intersection))\n functor->apply_local(intersection, entity, neighbor);\n } else {\n for (auto& functor : codim1_functors_)\n if (functor->apply_on(grid_view_, intersection))\n functor->apply_local(intersection, entity, entity);\n }\n\n } \/\/ walk the intersections\n } \/\/ only walk the intersections, if there are codim1 functors present\n } \/\/ walk the grid\n } \/\/ only do something, if we have to\n\n \/\/ finalize functors\n for (auto& functor : codim0_functors_)\n functor->finalize();\n for (auto& functor : codim1_functors_)\n functor->finalize();\n\n \/\/ clear the stack of functors\n if (clear_stack)\n clear();\n } \/\/ ... walk(...)\n\n void clear()\n {\n codim0_functors_ = std::vector<std::unique_ptr<Codim0Object>>();\n codim1_functors_ = std::vector<std::unique_ptr<Codim1Object>>();\n } \/\/ ... clear()\n\nprotected:\n const GridViewType& grid_view_;\n std::vector<std::unique_ptr<Codim0Object>> codim0_functors_;\n std::vector<std::unique_ptr<Codim1Object>> codim1_functors_;\n}; \/\/ class GridWalker\n\n\n} \/\/ namespace GDT\n} \/\/ namespace Dune\n\n#endif \/\/ DUNE_GDT_ASSEMBLER_GRIDWALKER_HH\n<|endoftext|>"} {"text":"<commit_before><commit_msg>DNS code: fix one more place was using 'stringexception' to use (SystemErrorException (... DNS_error_category); and fixed DNS_error_category message report to look a little better on widnows<commit_after><|endoftext|>"} {"text":"<commit_before><commit_msg>[GL3+] Add GLSL 4.4 shader profile for OpenGL 4.4<commit_after><|endoftext|>"} {"text":"<commit_before><commit_msg>GLES 2 - removed some broken code.<commit_after><|endoftext|>"} {"text":"<commit_before>\/**\n * @file spline.cpp\n * @brief definition of spline functions\n * @author Peter & Nigel, Design Software, 42 Gubberley St, Kenmore, 4069, Australia. \n *\/\n\n\n#undef k\n#undef ss\n\n\/************************************************\/\n\/* adapted from *\/\n\/* CMATH. Copyright (c) 1989 Design Software *\/\n\/* *\/\n\/************************************************\/\n\n\n\/**\n \n Evaluate the coefficients b[i], c[i], d[i], i = 0, 1, .. n-1 for\n a cubic interpolating spline\n\n S(xx) = Y[i] + b[i] * w + c[i] * w**2 + d[i] * w**3\n where w = xx - x[i]\n and x[i] <= xx <= x[i+1]\n\n The n supplied data points are x[i], y[i], i = 0 ... n-1.\n\n @param[in] n The number of data points or knots (n >= 2)\n @param[in] end1 0: default condition 1: specify the slopes at x[0]\n @param[in] end2 0: default condition 1: specify the slopes at x[n-1]\n @param[in] slope1 slope at x[0]\n @param[in] slope2 slope at x[n-1]\n @param[in] x[] the abscissas of the knots in strictly increasing order\n @param[in] y[] the ordinates of the knots\n @param[out] b[] array of spline coefficients\n @param[out] c[] array of spline coefficients\n @param[out] d[] array of spline coefficients\n \n @retval 0 normal return\n @retval 1 less than two data points; cannot interpolate\n @retval 2 x[] are not in ascending order\n \n Notes\n -----\n - The accompanying function seval() may be used to evaluate the\n spline while deriv will provide the first derivative.\n - Using p to denote differentiation\n y[i] = S(X[i])\n b[i] = Sp(X[i])\n c[i] = Spp(X[i])\/2\n d[i] = Sppp(X[i])\/6 ( Derivative from the right )\n - Since the zero elements of the arrays ARE NOW used here,\n all arrays to be passed from the main program should be\n dimensioned at least [n]. These routines will use elements\n [0 .. n-1].\n - Adapted from the text\n Forsythe, G.E., Malcolm, M.A. and Moler, C.B. (1977)\n \"Computer Methods for Mathematical Computations\"\n Prentice Hall\n - Note that although there are only n-1 polynomial segments,\n n elements are requird in b, c, d. The elements b[n-1],\n c[n-1] and d[n-1] are set to continue the last segment\n past x[n-1].\n*\/\nint spline (int n, int end1, int end2,\n double slope1, double slope2,\n double x[], double y[],\n double b[], double c[], double d[]) \n \n \n{ \/* begin procedure spline() *\/\n\nint nm1, ib, i;\ndouble t;\nint ascend;\n\nnm1 = n - 1;\n\nif (n < 2)\n { \/* no possible interpolation *\/\n goto LeaveSpline;\n }\n\nascend = 1;\nfor (i = 1; i < n; ++i) if (x[i] <= x[i-1]) ascend = 0;\nif (!ascend)\n {\n goto LeaveSpline;\n }\n\nif (n >= 3)\n { \/* ---- At least quadratic ---- *\/\n\n \/* ---- Set up the symmetric tri-diagonal system\n b = diagonal\n d = offdiagonal\n c = right-hand-side *\/\n d[0] = x[1] - x[0];\n c[1] = (y[1] - y[0]) \/ d[0];\n for (i = 1; i < nm1; ++i)\n {\n d[i] = x[i+1] - x[i];\n b[i] = 2.0 * (d[i-1] + d[i]);\n c[i+1] = (y[i+1] - y[i]) \/ d[i];\n c[i] = c[i+1] - c[i];\n }\n\n \/* ---- Default End conditions\n Third derivatives at x[0] and x[n-1] obtained\n from divided differences *\/\n b[0] = -d[0];\n b[nm1] = -d[n-2];\n c[0] = 0.0;\n c[nm1] = 0.0;\n if (n != 3)\n {\n c[0] = c[2] \/ (x[3] - x[1]) - c[1] \/ (x[2] - x[0]);\n c[nm1] = c[n-2] \/ (x[nm1] - x[n-3]) - c[n-3] \/ (x[n-2] - x[n-4]);\n c[0] = c[0] * d[0] * d[0] \/ (x[3] - x[0]);\n c[nm1] = -c[nm1] * d[n-2] * d[n-2] \/ (x[nm1] - x[n-4]);\n }\n\n \/* Alternative end conditions -- known slopes *\/\n if (end1 == 1)\n {\n b[0] = 2.0 * (x[1] - x[0]);\n c[0] = (y[1] - y[0]) \/ (x[1] - x[0]) - slope1;\n }\n if (end2 == 1)\n {\n b[nm1] = 2.0 * (x[nm1] - x[n-2]);\n c[nm1] = slope2 - (y[nm1] - y[n-2]) \/ (x[nm1] - x[n-2]);\n }\n\n \/* Forward elimination *\/\n for (i = 1; i < n; ++i)\n {\n t = d[i-1] \/ b[i-1];\n b[i] = b[i] - t * d[i-1];\n c[i] = c[i] - t * c[i-1];\n }\n\n \/* Back substitution *\/\n c[nm1] = c[nm1] \/ b[nm1];\n for (ib = 0; ib < nm1; ++ib)\n {\n i = n - ib - 2;\n c[i] = (c[i] - d[i] * c[i+1]) \/ b[i];\n }\n\n \/* c[i] is now the sigma[i] of the text *\/\n\n \/* Compute the polynomial coefficients *\/\n b[nm1] = (y[nm1] - y[n-2]) \/ d[n-2] + d[n-2] * (c[n-2] + 2.0 * c[nm1]);\n for (i = 0; i < nm1; ++i)\n {\n b[i] = (y[i+1] - y[i]) \/ d[i] - d[i] * (c[i+1] + 2.0 * c[i]);\n d[i] = (c[i+1] - c[i]) \/ d[i];\n c[i] = 3.0 * c[i];\n }\n c[nm1] = 3.0 * c[nm1];\n d[nm1] = d[n-2];\n\n } \/* at least quadratic *\/\n\nelse \/* if n >= 3 *\/\n { \/* linear segment only *\/\n b[0] = (y[1] - y[0]) \/ (x[1] - x[0]);\n c[0] = 0.0;\n d[0] = 0.0;\n b[1] = b[0];\n c[1] = 0.0;\n d[1] = 0.0;\n }\n\nLeaveSpline:\nreturn 0;\n} \/* end of spline() *\/\n\n\n\/**\n Evaluate the cubic spline function\n\n S(xx) = y[i] + b[i] * w + c[i] * w**2 + d[i] * w**3\n where w = u - x[i]\n and x[i] <= u <= x[i+1]\n Note that Horner's rule is used.\n If u < x[0] then i = 0 is used.\n If u > x[n-1] then i = n-1 is used.\n\n @param[in] n The number of data points or knots (n >= 2)\n @param[in] u the abscissa at which the spline is to be evaluated\n @param[in] x[] the abscissas of the knots in strictly increasing order\n @param[in] y[] the ordinates of the knots\n @param[in] b array of spline coefficients computed by spline().\n @param[in] c array of spline coefficients computed by spline().\n @param[in] d array of spline coefficients computed by spline().\n \n @return the value of the spline function at u\n\n Notes \n - If u is not in the same interval as the previous call then a\n binary search is performed to determine the proper interval.\n\n*\/\n\ndouble seval (int n, double u,\n double x[], double y[],\n double b[], double c[], double d[])\n\n{ \/* begin function seval() *\/\n\n int i, j, k;\n double w;\n\n if (u <= x[0]) {\n i = 0;\n } else {\n if (u >= x[n-1]) {\n i = n-1;\n } else {\n i = 0;\n j = n;\n do\n {\n k = (i + j) \/ 2; \/* split the domain to search *\/\n if (u < x[k]) j = k; \/* move the upper bound *\/\n if (u >= x[k]) i = k; \/* move the lower bound *\/\n } \/* there are no more segments to search *\/\n while (j > i+1);\n }\n }\n\n \/* ---- Evaluate the spline ---- *\/\n w = u - x[i];\n w = y[i] + w * (b[i] + w * (c[i] + w * d[i]));\n return (w);\n}\n\n\/**\n Evaluate the derivative of the cubic spline function\n\n S(x) = B[i] + 2.0 * C[i] * w + 3.0 * D[i] * w**2\n where w = u - X[i]\n and X[i] <= u <= X[i+1]\n Note that Horner's rule is used.\n If U < X[0] then i = 0 is used.\n If U > X[n-1] then i = n-1 is used.\n\n @param[in] n the number of data points or knots (n >= 2)\n @param[in] u the abscissa at which the derivative is to be evaluated\n @param[in] x the abscissas of the knots in strictly increasing order\n @param[in] b array of spline coefficients computed by spline()\n @param[in] c array of spline coefficients computed by spline()\n @param[in] d array of spline coefficients computed by spline()\n \n @return the value of the derivative of the spline function at u\n\n Notes\n - If u is not in the same interval as the previous call then a\n binary search is performed to determine the proper interval.\n\n*\/\n\ndouble deriv (int n, double u,\n double x[],\n double b[], double c[], double d[])\n{ \/* begin function deriv() *\/\n\nint i, j, k;\ndouble w;\n\nif (i >= n-1) i = 0;\nif (i < 0) i = 0;\n\nif ((x[i] > u) || (x[i+1] < u))\n { \/* ---- perform a binary search ---- *\/\n i = 0;\n j = n;\n do\n {\n k = (i + j) \/ 2; \/* split the domain to search *\/\n if (u < x[k]) j = k; \/* move the upper bound *\/\n if (u >= x[k]) i = k; \/* move the lower bound *\/\n } \/* there are no more segments to search *\/\n while (j > i+1);\n }\n\n\/* ---- Evaluate the derivative ---- *\/\nw = u - x[i];\nw = b[i] + w * (2.0 * c[i] + w * 3.0 * d[i]);\nreturn (w);\n\n} \/* end of deriv() *\/\n\n\n\/**\n Integrate the cubic spline function\n\n S(xx) = y[i] + b[i] * w + c[i] * w**2 + d[i] * w**3\n where w = u - x[i]\n and x[i] <= u <= x[i+1]\n\n The integral is zero at u = x[0].\n\n If u < x[0] then i = 0 segment is extrapolated.\n If u > x[n-1] then i = n-1 segment is extrapolated.\n\n @param[in] n the number of data points or knots (n >= 2)\n @param[in] u the abscissa at which the spline is to be evaluated\n @param[in] x[] the abscissas of the knots in strictly increasing order\n @param[in] y[] the ordinates of the knots\n @param[in] b array of spline coefficients computed by spline().\n @param[in] c array of spline coefficients computed by spline().\n @param[in] d array of spline coefficients computed by spline().\n\n @return the value of the spline function at u\n\n Notes\n - If u is not in the same interval as the previous call then a\n binary search is performed to determine the proper interval.\n\n*\/\n\ndouble sinteg (int n, double u,\n double x[], double y[],\n double b[], double c[], double d[])\n{ \/* begin function sinteg() *\/\n\nint i, j, k;\ndouble sum, dx;\n\nif (i >= n-1) i = 0;\nif (i < 0) i = 0;\n\nif ((x[i] > u) || (x[i+1] < u))\n { \/* ---- perform a binary search ---- *\/\n i = 0;\n j = n;\n do\n {\n k = (i + j) \/ 2; \/* split the domain to search *\/\n if (u < x[k]) j = k; \/* move the upper bound *\/\n if (u >= x[k]) i = k; \/* move the lower bound *\/\n } \/* there are no more segments to search *\/\n while (j > i+1);\n }\n\nsum = 0.0;\n\/* ---- Evaluate the integral for segments x < u ---- *\/\nfor (j = 0; j < i; ++j)\n {\n dx = x[j+1] - x[j];\n sum += dx *\n (y[j] + dx *\n (0.5 * b[j] + dx *\n (c[j] \/ 3.0 + dx * 0.25 * d[j])));\n }\n\n\/* ---- Evaluate the integral fot this segment ---- *\/\ndx = u - x[i];\nsum += dx *\n (y[i] + dx *\n (0.5 * b[i] + dx *\n (c[i] \/ 3.0 + dx * 0.25 * d[i])));\n\nreturn (sum);\n}\n<commit_msg>fixes #102<commit_after>\/**\n * @file spline.cpp\n * @brief definition of spline functions\n * @author Peter & Nigel, Design Software, 42 Gubberley St, Kenmore, 4069, Australia. \n *\/\n\n\n#undef k\n#undef ss\n\n\/************************************************\/\n\/* adapted from *\/\n\/* CMATH. Copyright (c) 1989 Design Software *\/\n\/* *\/\n\/************************************************\/\n\n\n\/**\n \n Evaluate the coefficients b[i], c[i], d[i], i = 0, 1, .. n-1 for\n a cubic interpolating spline\n\n S(xx) = Y[i] + b[i] * w + c[i] * w**2 + d[i] * w**3\n where w = xx - x[i]\n and x[i] <= xx <= x[i+1]\n\n The n supplied data points are x[i], y[i], i = 0 ... n-1.\n\n @param[in] n The number of data points or knots (n >= 2)\n @param[in] end1 0: default condition 1: specify the slopes at x[0]\n @param[in] end2 0: default condition 1: specify the slopes at x[n-1]\n @param[in] slope1 slope at x[0]\n @param[in] slope2 slope at x[n-1]\n @param[in] x[] the abscissas of the knots in strictly increasing order\n @param[in] y[] the ordinates of the knots\n @param[out] b[] array of spline coefficients\n @param[out] c[] array of spline coefficients\n @param[out] d[] array of spline coefficients\n \n @retval 0 normal return\n @retval 1 less than two data points; cannot interpolate\n @retval 2 x[] are not in ascending order\n \n Notes\n -----\n - The accompanying function seval() may be used to evaluate the\n spline while deriv will provide the first derivative.\n - Using p to denote differentiation\n y[i] = S(X[i])\n b[i] = Sp(X[i])\n c[i] = Spp(X[i])\/2\n d[i] = Sppp(X[i])\/6 ( Derivative from the right )\n - Since the zero elements of the arrays ARE NOW used here,\n all arrays to be passed from the main program should be\n dimensioned at least [n]. These routines will use elements\n [0 .. n-1].\n - Adapted from the text\n Forsythe, G.E., Malcolm, M.A. and Moler, C.B. (1977)\n \"Computer Methods for Mathematical Computations\"\n Prentice Hall\n - Note that although there are only n-1 polynomial segments,\n n elements are requird in b, c, d. The elements b[n-1],\n c[n-1] and d[n-1] are set to continue the last segment\n past x[n-1].\n*\/\nint spline (int n, int end1, int end2,\n double slope1, double slope2,\n double x[], double y[],\n double b[], double c[], double d[]) \n \n \n{ \/* begin procedure spline() *\/\n\nint nm1, ib, i;\ndouble t;\nint ascend;\n\nnm1 = n - 1;\n\nif (n < 2)\n { \/* no possible interpolation *\/\n goto LeaveSpline;\n }\n\nascend = 1;\nfor (i = 1; i < n; ++i) if (x[i] <= x[i-1]) ascend = 0;\nif (!ascend)\n {\n goto LeaveSpline;\n }\n\nif (n >= 3)\n { \/* ---- At least quadratic ---- *\/\n\n \/* ---- Set up the symmetric tri-diagonal system\n b = diagonal\n d = offdiagonal\n c = right-hand-side *\/\n d[0] = x[1] - x[0];\n c[1] = (y[1] - y[0]) \/ d[0];\n for (i = 1; i < nm1; ++i)\n {\n d[i] = x[i+1] - x[i];\n b[i] = 2.0 * (d[i-1] + d[i]);\n c[i+1] = (y[i+1] - y[i]) \/ d[i];\n c[i] = c[i+1] - c[i];\n }\n\n \/* ---- Default End conditions\n Third derivatives at x[0] and x[n-1] obtained\n from divided differences *\/\n b[0] = -d[0];\n b[nm1] = -d[n-2];\n c[0] = 0.0;\n c[nm1] = 0.0;\n if (n != 3)\n {\n c[0] = c[2] \/ (x[3] - x[1]) - c[1] \/ (x[2] - x[0]);\n c[nm1] = c[n-2] \/ (x[nm1] - x[n-3]) - c[n-3] \/ (x[n-2] - x[n-4]);\n c[0] = c[0] * d[0] * d[0] \/ (x[3] - x[0]);\n c[nm1] = -c[nm1] * d[n-2] * d[n-2] \/ (x[nm1] - x[n-4]);\n }\n\n \/* Alternative end conditions -- known slopes *\/\n if (end1 == 1)\n {\n b[0] = 2.0 * (x[1] - x[0]);\n c[0] = (y[1] - y[0]) \/ (x[1] - x[0]) - slope1;\n }\n if (end2 == 1)\n {\n b[nm1] = 2.0 * (x[nm1] - x[n-2]);\n c[nm1] = slope2 - (y[nm1] - y[n-2]) \/ (x[nm1] - x[n-2]);\n }\n\n \/* Forward elimination *\/\n for (i = 1; i < n; ++i)\n {\n t = d[i-1] \/ b[i-1];\n b[i] = b[i] - t * d[i-1];\n c[i] = c[i] - t * c[i-1];\n }\n\n \/* Back substitution *\/\n c[nm1] = c[nm1] \/ b[nm1];\n for (ib = 0; ib < nm1; ++ib)\n {\n i = n - ib - 2;\n c[i] = (c[i] - d[i] * c[i+1]) \/ b[i];\n }\n\n \/* c[i] is now the sigma[i] of the text *\/\n\n \/* Compute the polynomial coefficients *\/\n b[nm1] = (y[nm1] - y[n-2]) \/ d[n-2] + d[n-2] * (c[n-2] + 2.0 * c[nm1]);\n for (i = 0; i < nm1; ++i)\n {\n b[i] = (y[i+1] - y[i]) \/ d[i] - d[i] * (c[i+1] + 2.0 * c[i]);\n d[i] = (c[i+1] - c[i]) \/ d[i];\n c[i] = 3.0 * c[i];\n }\n c[nm1] = 3.0 * c[nm1];\n d[nm1] = d[n-2];\n\n } \/* at least quadratic *\/\n\nelse \/* if n >= 3 *\/\n { \/* linear segment only *\/\n b[0] = (y[1] - y[0]) \/ (x[1] - x[0]);\n c[0] = 0.0;\n d[0] = 0.0;\n b[1] = b[0];\n c[1] = 0.0;\n d[1] = 0.0;\n }\n\nLeaveSpline:\nreturn 0;\n} \/* end of spline() *\/\n\n\n\/**\n Evaluate the cubic spline function\n\n S(xx) = y[i] + b[i] * w + c[i] * w**2 + d[i] * w**3\n where w = u - x[i]\n and x[i] <= u <= x[i+1]\n Note that Horner's rule is used.\n If u < x[0] then i = 0 is used.\n If u > x[n-1] then i = n-1 is used.\n\n @param[in] n The number of data points or knots (n >= 2)\n @param[in] u the abscissa at which the spline is to be evaluated\n @param[in] x[] the abscissas of the knots in strictly increasing order\n @param[in] y[] the ordinates of the knots\n @param[in] b array of spline coefficients computed by spline().\n @param[in] c array of spline coefficients computed by spline().\n @param[in] d array of spline coefficients computed by spline().\n \n @return the value of the spline function at u\n\n Notes \n - If u is not in the same interval as the previous call then a\n binary search is performed to determine the proper interval.\n\n*\/\n\ndouble seval (int n, double u,\n double x[], double y[],\n double b[], double c[], double d[])\n\n{ \/* begin function seval() *\/\n\n int i, j, k;\n double w;\n\n if (u <= x[0]) {\n i = 0;\n } else {\n if (u >= x[n-1]) {\n i = n-1;\n } else {\n i = 0;\n j = n;\n do\n {\n k = (i + j) \/ 2; \/* split the domain to search *\/\n if (u < x[k]) j = k; \/* move the upper bound *\/\n if (u >= x[k]) i = k; \/* move the lower bound *\/\n } \/* there are no more segments to search *\/\n while (j > i+1);\n }\n }\n\n \/* ---- Evaluate the spline ---- *\/\n w = u - x[i];\n w = y[i] + w * (b[i] + w * (c[i] + w * d[i]));\n return (w);\n}\n\n\n\/**\n Integrate the cubic spline function\n\n S(xx) = y[i] + b[i] * w + c[i] * w**2 + d[i] * w**3\n where w = u - x[i]\n and x[i] <= u <= x[i+1]\n\n The integral is zero at u = x[0].\n\n If u < x[0] then i = 0 segment is extrapolated.\n If u > x[n-1] then i = n-1 segment is extrapolated.\n\n @param[in] n the number of data points or knots (n >= 2)\n @param[in] u the abscissa at which the spline is to be evaluated\n @param[in] x[] the abscissas of the knots in strictly increasing order\n @param[in] y[] the ordinates of the knots\n @param[in] b array of spline coefficients computed by spline().\n @param[in] c array of spline coefficients computed by spline().\n @param[in] d array of spline coefficients computed by spline().\n\n @return the value of the spline function at u\n\n Notes\n - If u is not in the same interval as the previous call then a\n binary search is performed to determine the proper interval.\n\n*\/\n\ndouble sinteg (int n, double u,\n double x[], double y[],\n double b[], double c[], double d[])\n{ \/* begin function sinteg() *\/\n\nint i, j, k;\ndouble sum, dx;\n\ni = 0;\n\nif ((x[i] > u) || (x[i+1] < u))\n { \/* ---- perform a binary search ---- *\/\n j = n;\n do\n {\n k = (i + j) \/ 2; \/* split the domain to search *\/\n if (u < x[k]) j = k; \/* move the upper bound *\/\n if (u >= x[k]) i = k; \/* move the lower bound *\/\n } \/* there are no more segments to search *\/\n while (j > i+1);\n }\n\nsum = 0.0;\n\/* ---- Evaluate the integral for segments x < u ---- *\/\nfor (j = 0; j < i; ++j)\n {\n dx = x[j+1] - x[j];\n sum += dx *\n (y[j] + dx *\n (0.5 * b[j] + dx *\n (c[j] \/ 3.0 + dx * 0.25 * d[j])));\n }\n\n\/* ---- Evaluate the integral fot this segment ---- *\/\ndx = u - x[i];\nsum += dx *\n (y[i] + dx *\n (0.5 * b[i] + dx *\n (c[i] \/ 3.0 + dx * 0.25 * d[i])));\n\nreturn (sum);\n}\n<|endoftext|>"} {"text":"<commit_before>\/*\n * objtest\n *\n * $Date$\n * $Revision$\n *\n *\/\n\n\/\/ Access the internals of the object module\n#include \"..\/src\/lib\/conf.h\"\n#include <libtpt\/object.h>\n#include <iostream>\n#include <map>\n\nusing TPT::Object;\n\nvoid test1();\n\nint main(int argc, char* argv[])\n{\n\ttry {\n\t\ttest1();\n\t} catch(const std::exception& e) {\n\t\tstd::cout << \"Exception \" << e.what() << std::endl;\n\t} catch(...) {\n\t\tstd::cout << \"Unknown exception\" << std::endl;\n\t}\n\n\treturn 0;\n}\n\nvoid test1()\n{\n\tObject obj(Object::type_hash);\n\tObject::HashType& hash = obj.hash();\n\tstd::cout << \"Allocating new object\" << std::endl;\n\n\tObject::PtrType temp1(new Object(\"Test\"));\n\tObject::PtrType temp2(temp1);\n\ttemp1 = new Object(\"Test\");\n\ttemp2 = temp1;\n\ttemp1 = new Object(\"Test\");\n\tObject::PtrType temp3(temp2);\n\ttemp2 = temp1;\n\tObject::PtrType pobj(new Object(\"Test\"));\n\thash[\"var\"] = pobj;\n\tstd::cout << \"Type: \" << pobj.get()->gettype() << std::endl;\n\tstd::cout << \"Read: \" << hash[\"var\"].get()->scalar() << std::endl;\n\thash[\"var\"] = new Object(\"Value\");\n\tstd::cout << \"Type: \" << hash[\"var\"].get()->gettype() << std::endl;\n\tstd::cout << \"Read: \" << hash[\"var\"].get()->scalar() << std::endl;\n\thash[\"test1\"] = new Object(Object::type_array);\n\thash[\"test2\"] = new Object(Object::type_hash);\n\thash[\"test3\"] = new Object;\n}\n<commit_msg>cleaned up unused parameters<commit_after>\/*\n * objtest\n *\n * $Date$\n * $Revision$\n *\n *\/\n\n\/\/ Access the internals of the object module\n#include \"..\/src\/lib\/conf.h\"\n#include <libtpt\/object.h>\n#include <iostream>\n#include <map>\n\nusing TPT::Object;\n\nvoid test1();\n\nint main()\n{\n\ttry {\n\t\ttest1();\n\t} catch(const std::exception& e) {\n\t\tstd::cout << \"Exception \" << e.what() << std::endl;\n\t} catch(...) {\n\t\tstd::cout << \"Unknown exception\" << std::endl;\n\t}\n\n\treturn 0;\n}\n\nvoid test1()\n{\n\tObject obj(Object::type_hash);\n\tObject::HashType& hash = obj.hash();\n\tstd::cout << \"Allocating new object\" << std::endl;\n\n\tObject::PtrType temp1(new Object(\"Test\"));\n\tObject::PtrType temp2(temp1);\n\ttemp1 = new Object(\"Test\");\n\ttemp2 = temp1;\n\ttemp1 = new Object(\"Test\");\n\tObject::PtrType temp3(temp2);\n\ttemp2 = temp1;\n\tObject::PtrType pobj(new Object(\"Test\"));\n\thash[\"var\"] = pobj;\n\tstd::cout << \"Type: \" << pobj.get()->gettype() << std::endl;\n\tstd::cout << \"Read: \" << hash[\"var\"].get()->scalar() << std::endl;\n\thash[\"var\"] = new Object(\"Value\");\n\tstd::cout << \"Type: \" << hash[\"var\"].get()->gettype() << std::endl;\n\tstd::cout << \"Read: \" << hash[\"var\"].get()->scalar() << std::endl;\n\thash[\"test1\"] = new Object(Object::type_array);\n\thash[\"test2\"] = new Object(Object::type_hash);\n\thash[\"test3\"] = new Object;\n}\n<|endoftext|>"} {"text":"<commit_before><commit_msg>[cpp]26. Remove Duplicates from Sorted add a more efficient solution<commit_after><|endoftext|>"} {"text":"<commit_before><commit_msg>Fixing build.<commit_after><|endoftext|>"} {"text":"<commit_before>\/\/ @(#)root\/graf:$Id$\n\/\/ Author: Anna Kreshuk 18\/11\/2005\n\n\/*************************************************************************\n * Copyright (C) 1995-2005, Rene Brun and Fons Rademakers. *\n * All rights reserved. *\n * *\n * For the licensing terms see $ROOTSYS\/LICENSE. *\n * For the list of contributors see $ROOTSYS\/README\/CREDITS. *\n *************************************************************************\/\n\n#include \"TGraphQQ.h\"\n#include \"TAxis.h\"\n#include \"TF1.h\"\n#include \"TMath.h\"\n#include \"TVirtualPad.h\"\n#include \"TLine.h\"\n\nClassImp(TGraphQQ)\n\n\/\/______________________________________________________________________________\n\/\/\n\/\/ This class allows to draw quantile-quantile plots\n\/\/ \n\/\/ Plots can be drawn for 2 datasets or for a dataset and a theoretical \n\/\/ distribution function\n\/\/ \n\/\/ 2 datasets:\n\/\/ Quantile-quantile plots are used to determine whether 2 samples come from\n\/\/ the same distribution. \n\/\/ A qq-plot draws the quantiles of one dataset against the quantile of the \n\/\/ the other. The quantiles of the dataset with fewer entries are on Y axis,\n\/\/ with more entries - on X axis. \n\/\/ A straight line, going through 0.25 and 0.75 quantiles is also plotted \n\/\/ for reference. It represents a robust linear fit, not sensitive to the \n\/\/ extremes of the datasets.\n\/\/ If the datasets come from the same distribution, points of the plot should \n\/\/ fall approximately on the 45 degrees line. If they have the same \n\/\/ distribution function, but location or scale different parameters, \n\/\/ they should still fall on the straight line, but not the 45 degrees one. \n\/\/ The greater their departure from the straight line, the more evidence there\n\/\/ is, that the datasets come from different distributions.\n\/\/ The advantage of qq-plot is that it not only shows that the underlying\n\/\/ distributions are different, but, unlike the analytical methods, it also\n\/\/ gives information on the nature of this difference: heavier tails, \n\/\/ different location\/scale, different shape, etc.\n\/\/ \n\/\/ Some examples of qqplots of 2 datasets:\n\/\/Begin_Html\n\/*\n<img src=\"gif\/qqplots.gif\">\n*\/\n\/\/End_Html\n\/\/\n\/\/ 1 dataset: \n\/\/ Quantile-quantile plots are used to determine if the dataset comes from the \n\/\/ specified theoretical distribution, such as normal.\n\/\/ A qq-plot draws quantiles of the dataset against quantiles of the specified\n\/\/ theoretical distribution. \n\/\/ (NOTE, that density, not CDF should be specified)\n\/\/ A straight line, going through 0.25 and 0.75 quantiles can also be plotted \n\/\/ for reference. It represents a robust linear fit, not sensitive to the \n\/\/ extremes of the dataset. \n\/\/ As in the 2 datasets case, departures from straight line indicate departures\n\/\/ from the specified distribution.\n\/\/\n\/\/ \" The correlation coefficient associated with the linear fit to the data \n\/\/ in the probability plot (qq plot in our case) is a measure of the \n\/\/ goodness of the fit. \n\/\/ Estimates of the location and scale parameters of the distribution \n\/\/ are given by the intercept and slope. Probability plots can be generated \n\/\/ for several competing distributions to see which provides the best fit, \n\/\/ and the probability plot generating the highest correlation coefficient \n\/\/ is the best choice since it generates the straightest probability plot.\"\n\/\/ From \"Engineering statistic handbook\", \n\/\/ http:\/\/www.itl.nist.gov\/div898\/handbook\/eda\/section3\/probplot.htm\n\/\/\n\/\/ Example of a qq-plot of a dataset from N(3, 2) distribution and \n\/\/ TMath::Gaus(0, 1) theoretical function. Fitting parameters\n\/\/ are estimates of the distribution mean and sigma.\n\/\/\n\/\/Begin_Html\n\/*\n<img src=\"gif\/qqnormal.gif\">\n*\/\n\/\/End_Html\/\/\n\/\/ \n\/\/ \n\/\/ References:\n\/\/ http:\/\/www.itl.nist.gov\/div898\/handbook\/eda\/section3\/qqplot.htm\n\/\/ http:\/\/www.itl.nist.gov\/div898\/handbook\/eda\/section3\/probplot.htm\n\/\/ \n \n\n\n\/\/______________________________________________________________________________\nTGraphQQ::TGraphQQ()\n{\n \/\/default constructor\n \n fF = 0;\n fY0 = 0;\n fNy0 = 0;\n fXq1 = 0.;\n fXq2 = 0.;\n fYq1 = 0.;\n fYq2 = 0.;\n\n}\n\n\n\/\/______________________________________________________________________________\nTGraphQQ::TGraphQQ(Int_t n, Double_t *x) \n : TGraph(n)\n{\n \/\/Creates a quantile-quantile plot of dataset x. \n \/\/Theoretical distribution function can be defined later by SetFunction method\n\n fNy0 = 0;\n fXq1 = 0.;\n fXq2 = 0.;\n fYq1 = 0.;\n fYq2 = 0.;\n\n Int_t *index = new Int_t[n];\n TMath::Sort(n, x, index, kFALSE);\n for (Int_t i=0; i<fNpoints; i++)\n fY[i] = x[index[i]];\n fF=0;\n fY0=0;\n delete [] index;\n} \n\n\/\/______________________________________________________________________________\nTGraphQQ::TGraphQQ(Int_t n, Double_t *x, TF1 *f)\n : TGraph(n)\n{\n \/\/Creates a quantile-quantile plot of dataset x against function f\n\n Int_t *index = new Int_t[n];\n TMath::Sort(n, x, index, kFALSE);\n for (Int_t i=0; i<fNpoints; i++)\n fY[i] = x[index[i]];\n delete [] index;\n fF = f;\n fY0=0;\n MakeFunctionQuantiles();\n} \n\n\n\/\/______________________________________________________________________________\nTGraphQQ::TGraphQQ(Int_t nx, Double_t *x, Int_t ny, Double_t *y)\n{\n \/\/Creates a quantile-quantile plot of dataset x against dataset y\n \/\/Parameters nx and ny are respective array sizes\n\n nx<=ny ? fNpoints=nx : fNpoints=ny;\n\n if (!CtorAllocate()) return;\n fF=0;\n Int_t *index = new Int_t[TMath::Max(nx, ny)];\n TMath::Sort(nx, x, index, kFALSE);\n if (nx <=ny){\n for (Int_t i=0; i<fNpoints; i++)\n fY[i] = x[index[i]];\n TMath::Sort(ny, y, index, kFALSE);\n if (nx==ny){\n for (Int_t i=0; i<fNpoints; i++)\n fX[i] = y[index[i]];\n fY0 = 0;\n Quartiles();\n } else {\n fNy0 = ny;\n fY0 = new Double_t[ny];\n for (Int_t i=0; i<ny; i++)\n fY0[i] = y[i];\n MakeQuantiles();\n }\n } else {\n fNy0 = nx;\n fY0 = new Double_t[nx];\n for (Int_t i=0; i<nx; i++)\n fY0[i] = x[index[i]];\n TMath::Sort(ny, y, index, kFALSE);\n for (Int_t i=0; i<ny; i++)\n fY[i] = y[index[i]];\n MakeQuantiles();\n }\n\n\n delete [] index;\n}\n\n\n\/\/______________________________________________________________________________\nTGraphQQ::~TGraphQQ()\n{\n \/\/Destroys a TGraphQQ\n\n if (fY0)\n delete [] fY0;\n if (fF)\n fF = 0;\n}\n\n\n\/\/______________________________________________________________________________\nvoid TGraphQQ::MakeFunctionQuantiles()\n{\n \/\/Computes quantiles of theoretical distribution function\n\n if (!fF) return;\n TString s = fF->GetTitle();\n Double_t pk;\n if (s.Contains(\"TMath::Gaus\") || s.Contains(\"gaus\")){\n \/\/use plotting positions optimal for normal distribution\n for (Int_t k=1; k<=fNpoints; k++){\n pk = (k-0.375)\/(fNpoints+0.25);\n fX[k-1]=TMath::NormQuantile(pk);\n }\n } else {\n Double_t *prob = new Double_t[fNpoints];\n if (fNpoints > 10){\n for (Int_t k=1; k<=fNpoints; k++)\n prob[k-1] = (k-0.5)\/fNpoints;\n } else {\n for (Int_t k=1; k<=fNpoints; k++)\n prob[k-1] = (k-0.375)\/(fNpoints+0.25);\n }\n \/\/fF->GetQuantiles(fNpoints, prob, fX);\n fF->GetQuantiles(fNpoints, fX, prob);\n delete [] prob;\n }\n\n Quartiles();\n}\n\n\n\/\/______________________________________________________________________________\n\nvoid TGraphQQ::MakeQuantiles()\n{\n \/\/When sample sizes are not equal, computes quantiles of the bigger sample\n \/\/by linear interpolation\n\n if (!fY0) return;\n\n Double_t pi, pfrac;\n Int_t pint;\n for (Int_t i=0; i<fNpoints-1; i++){\n pi = (fNy0-1)*Double_t(i)\/Double_t(fNpoints-1);\n pint = TMath::FloorNint(pi);\n pfrac = pi - pint;\n fX[i] = (1-pfrac)*fY0[pint]+pfrac*fY0[pint+1];\n }\n fX[fNpoints-1]=fY0[fNy0-1];\n\n Quartiles();\n}\n\n\n\/\/______________________________________________________________________________\nvoid TGraphQQ::Quartiles()\n{\n \/\/ compute quartiles\n \/\/ a quartile is a 25 per cent or 75 per cent quantile\n \n Double_t prob[]={0.25, 0.75};\n Double_t x[2];\n Double_t y[2];\n TMath::Quantiles(fNpoints, 2, fY, y, prob, kTRUE);\n if (fY0)\n TMath::Quantiles(fNy0, 2, fY0, x, prob, kTRUE);\n else if (fF) {\n TString s = fF->GetTitle();\n if (s.Contains(\"TMath::Gaus\") || s.Contains(\"gaus\")){\n x[0] = TMath::NormQuantile(0.25);\n x[1] = TMath::NormQuantile(0.75);\n } else \n fF->GetQuantiles(2, x, prob);\n }\n else \n TMath::Quantiles(fNpoints, 2, fX, x, prob, kTRUE);\n\n fXq1=x[0]; fXq2=x[1]; fYq1=y[0]; fYq2=y[1];\n}\n\n\n\/\/______________________________________________________________________________\nvoid TGraphQQ::SetFunction(TF1 *f)\n{\n \/\/Sets the theoretical distribution function (density!) \n \/\/and computes its quantiles\n\n fF = f;\n MakeFunctionQuantiles();\n}\n<commit_msg>- Initiliaze members (coverity)<commit_after>\/\/ @(#)root\/graf:$Id$\n\/\/ Author: Anna Kreshuk 18\/11\/2005\n\n\/*************************************************************************\n * Copyright (C) 1995-2005, Rene Brun and Fons Rademakers. *\n * All rights reserved. *\n * *\n * For the licensing terms see $ROOTSYS\/LICENSE. *\n * For the list of contributors see $ROOTSYS\/README\/CREDITS. *\n *************************************************************************\/\n\n#include \"TGraphQQ.h\"\n#include \"TAxis.h\"\n#include \"TF1.h\"\n#include \"TMath.h\"\n#include \"TVirtualPad.h\"\n#include \"TLine.h\"\n\nClassImp(TGraphQQ)\n\n\/\/______________________________________________________________________________\n\/\/\n\/\/ This class allows to draw quantile-quantile plots\n\/\/ \n\/\/ Plots can be drawn for 2 datasets or for a dataset and a theoretical \n\/\/ distribution function\n\/\/ \n\/\/ 2 datasets:\n\/\/ Quantile-quantile plots are used to determine whether 2 samples come from\n\/\/ the same distribution. \n\/\/ A qq-plot draws the quantiles of one dataset against the quantile of the \n\/\/ the other. The quantiles of the dataset with fewer entries are on Y axis,\n\/\/ with more entries - on X axis. \n\/\/ A straight line, going through 0.25 and 0.75 quantiles is also plotted \n\/\/ for reference. It represents a robust linear fit, not sensitive to the \n\/\/ extremes of the datasets.\n\/\/ If the datasets come from the same distribution, points of the plot should \n\/\/ fall approximately on the 45 degrees line. If they have the same \n\/\/ distribution function, but location or scale different parameters, \n\/\/ they should still fall on the straight line, but not the 45 degrees one. \n\/\/ The greater their departure from the straight line, the more evidence there\n\/\/ is, that the datasets come from different distributions.\n\/\/ The advantage of qq-plot is that it not only shows that the underlying\n\/\/ distributions are different, but, unlike the analytical methods, it also\n\/\/ gives information on the nature of this difference: heavier tails, \n\/\/ different location\/scale, different shape, etc.\n\/\/ \n\/\/ Some examples of qqplots of 2 datasets:\n\/\/Begin_Html\n\/*\n<img src=\"gif\/qqplots.gif\">\n*\/\n\/\/End_Html\n\/\/\n\/\/ 1 dataset: \n\/\/ Quantile-quantile plots are used to determine if the dataset comes from the \n\/\/ specified theoretical distribution, such as normal.\n\/\/ A qq-plot draws quantiles of the dataset against quantiles of the specified\n\/\/ theoretical distribution. \n\/\/ (NOTE, that density, not CDF should be specified)\n\/\/ A straight line, going through 0.25 and 0.75 quantiles can also be plotted \n\/\/ for reference. It represents a robust linear fit, not sensitive to the \n\/\/ extremes of the dataset. \n\/\/ As in the 2 datasets case, departures from straight line indicate departures\n\/\/ from the specified distribution.\n\/\/\n\/\/ \" The correlation coefficient associated with the linear fit to the data \n\/\/ in the probability plot (qq plot in our case) is a measure of the \n\/\/ goodness of the fit. \n\/\/ Estimates of the location and scale parameters of the distribution \n\/\/ are given by the intercept and slope. Probability plots can be generated \n\/\/ for several competing distributions to see which provides the best fit, \n\/\/ and the probability plot generating the highest correlation coefficient \n\/\/ is the best choice since it generates the straightest probability plot.\"\n\/\/ From \"Engineering statistic handbook\", \n\/\/ http:\/\/www.itl.nist.gov\/div898\/handbook\/eda\/section3\/probplot.htm\n\/\/\n\/\/ Example of a qq-plot of a dataset from N(3, 2) distribution and \n\/\/ TMath::Gaus(0, 1) theoretical function. Fitting parameters\n\/\/ are estimates of the distribution mean and sigma.\n\/\/\n\/\/Begin_Html\n\/*\n<img src=\"gif\/qqnormal.gif\">\n*\/\n\/\/End_Html\/\/\n\/\/ \n\/\/ \n\/\/ References:\n\/\/ http:\/\/www.itl.nist.gov\/div898\/handbook\/eda\/section3\/qqplot.htm\n\/\/ http:\/\/www.itl.nist.gov\/div898\/handbook\/eda\/section3\/probplot.htm\n\/\/ \n \n\n\n\/\/______________________________________________________________________________\nTGraphQQ::TGraphQQ()\n{\n \/\/default constructor\n \n fF = 0;\n fY0 = 0;\n fNy0 = 0;\n fXq1 = 0.;\n fXq2 = 0.;\n fYq1 = 0.;\n fYq2 = 0.;\n\n}\n\n\n\/\/______________________________________________________________________________\nTGraphQQ::TGraphQQ(Int_t n, Double_t *x) \n : TGraph(n)\n{\n \/\/Creates a quantile-quantile plot of dataset x. \n \/\/Theoretical distribution function can be defined later by SetFunction method\n\n fNy0 = 0;\n fXq1 = 0.;\n fXq2 = 0.;\n fYq1 = 0.;\n fYq2 = 0.;\n\n Int_t *index = new Int_t[n];\n TMath::Sort(n, x, index, kFALSE);\n for (Int_t i=0; i<fNpoints; i++)\n fY[i] = x[index[i]];\n fF=0;\n fY0=0;\n delete [] index;\n} \n\n\/\/______________________________________________________________________________\nTGraphQQ::TGraphQQ(Int_t n, Double_t *x, TF1 *f)\n : TGraph(n)\n{\n \/\/Creates a quantile-quantile plot of dataset x against function f\n\n fNy0 = 0;\n\n Int_t *index = new Int_t[n];\n TMath::Sort(n, x, index, kFALSE);\n for (Int_t i=0; i<fNpoints; i++)\n fY[i] = x[index[i]];\n delete [] index;\n fF = f;\n fY0=0;\n MakeFunctionQuantiles();\n} \n\n\n\/\/______________________________________________________________________________\nTGraphQQ::TGraphQQ(Int_t nx, Double_t *x, Int_t ny, Double_t *y)\n{\n \/\/Creates a quantile-quantile plot of dataset x against dataset y\n \/\/Parameters nx and ny are respective array sizes\n\n fNy0 = 0;\n fXq1 = 0.;\n fXq2 = 0.;\n fYq1 = 0.;\n fYq2 = 0.;\n\n nx<=ny ? fNpoints=nx : fNpoints=ny;\n\n if (!CtorAllocate()) return;\n fF=0;\n Int_t *index = new Int_t[TMath::Max(nx, ny)];\n TMath::Sort(nx, x, index, kFALSE);\n if (nx <=ny){\n for (Int_t i=0; i<fNpoints; i++)\n fY[i] = x[index[i]];\n TMath::Sort(ny, y, index, kFALSE);\n if (nx==ny){\n for (Int_t i=0; i<fNpoints; i++)\n fX[i] = y[index[i]];\n fY0 = 0;\n Quartiles();\n } else {\n fNy0 = ny;\n fY0 = new Double_t[ny];\n for (Int_t i=0; i<ny; i++)\n fY0[i] = y[i];\n MakeQuantiles();\n }\n } else {\n fNy0 = nx;\n fY0 = new Double_t[nx];\n for (Int_t i=0; i<nx; i++)\n fY0[i] = x[index[i]];\n TMath::Sort(ny, y, index, kFALSE);\n for (Int_t i=0; i<ny; i++)\n fY[i] = y[index[i]];\n MakeQuantiles();\n }\n\n\n delete [] index;\n}\n\n\n\/\/______________________________________________________________________________\nTGraphQQ::~TGraphQQ()\n{\n \/\/Destroys a TGraphQQ\n\n if (fY0)\n delete [] fY0;\n if (fF)\n fF = 0;\n}\n\n\n\/\/______________________________________________________________________________\nvoid TGraphQQ::MakeFunctionQuantiles()\n{\n \/\/Computes quantiles of theoretical distribution function\n\n if (!fF) return;\n TString s = fF->GetTitle();\n Double_t pk;\n if (s.Contains(\"TMath::Gaus\") || s.Contains(\"gaus\")){\n \/\/use plotting positions optimal for normal distribution\n for (Int_t k=1; k<=fNpoints; k++){\n pk = (k-0.375)\/(fNpoints+0.25);\n fX[k-1]=TMath::NormQuantile(pk);\n }\n } else {\n Double_t *prob = new Double_t[fNpoints];\n if (fNpoints > 10){\n for (Int_t k=1; k<=fNpoints; k++)\n prob[k-1] = (k-0.5)\/fNpoints;\n } else {\n for (Int_t k=1; k<=fNpoints; k++)\n prob[k-1] = (k-0.375)\/(fNpoints+0.25);\n }\n \/\/fF->GetQuantiles(fNpoints, prob, fX);\n fF->GetQuantiles(fNpoints, fX, prob);\n delete [] prob;\n }\n\n Quartiles();\n}\n\n\n\/\/______________________________________________________________________________\n\nvoid TGraphQQ::MakeQuantiles()\n{\n \/\/When sample sizes are not equal, computes quantiles of the bigger sample\n \/\/by linear interpolation\n\n if (!fY0) return;\n\n Double_t pi, pfrac;\n Int_t pint;\n for (Int_t i=0; i<fNpoints-1; i++){\n pi = (fNy0-1)*Double_t(i)\/Double_t(fNpoints-1);\n pint = TMath::FloorNint(pi);\n pfrac = pi - pint;\n fX[i] = (1-pfrac)*fY0[pint]+pfrac*fY0[pint+1];\n }\n fX[fNpoints-1]=fY0[fNy0-1];\n\n Quartiles();\n}\n\n\n\/\/______________________________________________________________________________\nvoid TGraphQQ::Quartiles()\n{\n \/\/ compute quartiles\n \/\/ a quartile is a 25 per cent or 75 per cent quantile\n \n Double_t prob[]={0.25, 0.75};\n Double_t x[2];\n Double_t y[2];\n TMath::Quantiles(fNpoints, 2, fY, y, prob, kTRUE);\n if (fY0)\n TMath::Quantiles(fNy0, 2, fY0, x, prob, kTRUE);\n else if (fF) {\n TString s = fF->GetTitle();\n if (s.Contains(\"TMath::Gaus\") || s.Contains(\"gaus\")){\n x[0] = TMath::NormQuantile(0.25);\n x[1] = TMath::NormQuantile(0.75);\n } else \n fF->GetQuantiles(2, x, prob);\n }\n else \n TMath::Quantiles(fNpoints, 2, fX, x, prob, kTRUE);\n\n fXq1=x[0]; fXq2=x[1]; fYq1=y[0]; fYq2=y[1];\n}\n\n\n\/\/______________________________________________________________________________\nvoid TGraphQQ::SetFunction(TF1 *f)\n{\n \/\/Sets the theoretical distribution function (density!) \n \/\/and computes its quantiles\n\n fF = f;\n MakeFunctionQuantiles();\n}\n<|endoftext|>"} {"text":"<commit_before>#ifndef PRESETEDITOR_HPP\n#define PRESETEDITOR_HPP\n\n\/\/ stdlib\n#include <string>\n#include <functional>\n\n\/\/ Libslic3r\n#include \"libslic3r.h\"\n#include \"ConfigBase.hpp\"\n#include \"Config.hpp\"\n\n\/\/ GUI\n#include \"misc_ui.hpp\"\n\n\/\/ Wx\n#include <wx\/treectrl.h>\n#include <wx\/imaglist.h>\n#include <wx\/panel.h>\n\n#if SLIC3R_CPPVER==11\n #define st(A) (std::string(#A))\n#elif SLIC3R_CPPVER==14\n #define st(A) ((#A)s)\n#endif\n\n\/\/ TODO for C++14 find\/replace st([A-z_]*) with \"\\1\"s\n\nnamespace Slic3r { namespace GUI {\n\nclass PresetEditor : public wxPanel {\n\npublic: \n \/\/\/ Member function to retrieve a list of options \n \/\/\/ that this preset governs. Subclasses should \n \/\/\/ call their own static method.\n virtual t_config_option_keys my_options() = 0;\n static t_config_option_keys options() { return t_config_option_keys {}; }\n\n wxSizer* sizer() { return _sizer; };\n PresetEditor(wxWindow* parent, t_config_option_keys options = {});\n PresetEditor() : PresetEditor(nullptr, {}) {};\n\n bool prompt_unsaved_changes();\n void select_preset_by_name(const wxString& name, bool force = false);\n \n \/\/\/ suppress the callback when the tree selection is changed.\n bool disable_tree_sel_changed_event {false};\n\n void save_preset();\n std::function<void ()> on_save_preset {};\n std::function<void ()> on_value_change {};\n\n config_ptr config;\n\n virtual wxString title() = 0;\n virtual std::string name() = 0;\nprotected:\n \/\/ Main sizer\n wxSizer* _sizer {nullptr};\n wxString presets;\n wxImageList* _icons {nullptr};\n wxTreeCtrl* _treectrl {nullptr};\n wxBitmapButton* _btn_save_preset {nullptr}; \n wxBitmapButton* _btn_delete_preset {nullptr};\n wxChoice* _presets_choice {nullptr};\n int _iconcount {-1};\n\n std::vector<wxString> _pages {};\n\n const unsigned int left_col_width {150};\n void _update_tree();\n void load_presets();\n\n virtual void _build() = 0;\n virtual void _update() = 0;\n virtual void _on_preset_loaded() = 0;\n void set_tooltips() { \n this->_btn_save_preset->SetToolTip(wxString(_(\"Save current \")) + this->title());\n this->_btn_delete_preset->SetToolTip(_(\"Delete this preset.\"));\n }\n};\n\nclass PrintEditor : public PresetEditor {\npublic:\n\n PrintEditor(wxWindow* parent, t_config_option_keys options = {});\n PrintEditor() : PrintEditor(nullptr, {}) {};\n\n wxString title() override { return _(\"Print Settings\"); }\n std::string name() override { return st(\"print\"); }\n\n \/\/\/ Static method to retrieve list of options that this preset governs.\n static t_config_option_keys options() {\n return t_config_option_keys\n {\n st(layer_height), st(first_layer_height),\n st(adaptive_slicing), st(adaptive_slicing_quality), st(match_horizontal_surfaces),\n st(perimeters), st(spiral_vase),\n st(top_solid_layers), st(bottom_solid_layers),\n st(extra_perimeters), st(avoid_crossing_perimeters), st(thin_walls), st(overhangs),\n st(seam_position), st(external_perimeters_first),\n st(fill_density), st(fill_pattern), st(top_infill_pattern), st(bottom_infill_pattern), st(fill_gaps),\n st(infill_every_layers), st(infill_only_where_needed),\n st(solid_infill_every_layers), st(fill_angle), st(solid_infill_below_area), st(),\n st(only_retract_when_crossing_perimeters), st(infill_first),\n st(max_print_speed), st(max_volumetric_speed),\n st(perimeter_speed), st(small_perimeter_speed), st(external_perimeter_speed), st(infill_speed), st(),\n st(solid_infill_speed), st(top_solid_infill_speed), st(support_material_speed),\n st(support_material_interface_speed), st(bridge_speed), st(gap_fill_speed),\n st(travel_speed),\n st(first_layer_speed),\n st(perimeter_acceleration), st(infill_acceleration), st(bridge_acceleration),\n st(first_layer_acceleration), st(default_acceleration),\n st(skirts), st(skirt_distance), st(skirt_height), st(min_skirt_length),\n st(brim_connections_width), st(brim_width), st(interior_brim_width),\n st(support_material), st(support_material_threshold), st(support_material_max_layers), st(support_material_enforce_layers),\n st(raft_layers),\n st(support_material_pattern), st(support_material_spacing), st(support_material_angle), st(),\n st(support_material_interface_layers), st(support_material_interface_spacing),\n st(support_material_contact_distance), st(support_material_buildplate_only), st(dont_support_bridges),\n st(notes),\n st(complete_objects), st(extruder_clearance_radius), st(extruder_clearance_height),\n st(gcode_comments), st(output_filename_format),\n st(post_process),\n st(perimeter_extruder), st(infill_extruder), st(solid_infill_extruder),\n st(support_material_extruder), st(support_material_interface_extruder),\n st(ooze_prevention), st(standby_temperature_delta),\n st(interface_shells), st(regions_overlap),\n st(extrusion_width), st(first_layer_extrusion_width), st(perimeter_extrusion_width), st(),\n st(external_perimeter_extrusion_width), st(infill_extrusion_width), st(solid_infill_extrusion_width),\n st(top_infill_extrusion_width), st(support_material_extrusion_width),\n st(support_material_interface_extrusion_width), st(infill_overlap), st(bridge_flow_ratio),\n st(xy_size_compensation), st(resolution), st(shortcuts), st(compatible_printers),\n st(print_settings_id)\n };\n }\n\n t_config_option_keys my_options() override { return PrintEditor::options(); }\n\nprotected:\n void _update() override;\n void _build() override;\n};\n\nclass MaterialEditor : public PresetEditor {\npublic:\n\n wxString title() override { return _(\"Material Settings\"); }\n std::string name() override { return st(\"material\"); }\n MaterialEditor(wxWindow* parent, t_config_option_keys options = {});\n MaterialEditor() : MaterialEditor(nullptr, {}) {};\n\n static t_config_option_keys options() {\n return t_config_option_keys\n {\n st(filament_colour), st(filament_diameter), st(filament_notes), st(filament_max_volumetric_speed), st(extrusion_multiplier), st(filament_density), st(filament_cost),\n st(temperature), st(first_layer_temperature), st(bed_temperature), st(first_layer_bed_temperature),\n st(fan_always_on), st(cooling), st(compatible_printers),\n st(min_fan_speed), st(max_fan_speed), st(bridge_fan_speed), st(disable_fan_first_layers),\n st(fan_below_layer_time), st(slowdown_below_layer_time), st(min_print_speed),\n st(start_filament_gcode), st(end_filament_gcode),\n st(filament_settings_id)\n };\n }\n \n t_config_option_keys my_options() override { return MaterialEditor::options(); }\nprotected:\n void _update() override;\n void _build() override;\n};\n\nclass PrinterEditor : public PresetEditor {\npublic:\n PrinterEditor(wxWindow* parent, t_config_option_keys options = {});\n PrinterEditor() : PrinterEditor(nullptr, {}) {};\n\n wxString title() override { return _(\"Printer Settings\"); }\n std::string name() override { return st(\"printer\"); }\n \n static t_config_option_keys options() {\n return t_config_option_keys\n {\n st(bed_shape), st(z_offset), st(z_steps_per_mm), st(has_heatbed),\n st(gcode_flavor), st(use_relative_e_distances),\n st(serial_port), st(serial_speed),\n st(host_type), st(print_host), st(octoprint_apikey),\n st(use_firmware_retraction), st(pressure_advance), st(vibration_limit),\n st(use_volumetric_e),\n st(start_gcode), st(end_gcode), st(before_layer_gcode), st(layer_gcode), st(toolchange_gcode), st(between_objects_gcode),\n st(nozzle_diameter), st(extruder_offset), st(min_layer_height), st(max_layer_height),\n st(retract_length), st(retract_lift), st(retract_speed), st(retract_restart_extra), st(retract_before_travel), st(retract_layer_change), st(wipe),\n st(retract_length_toolchange), st(retract_restart_extra_toolchange), st(retract_lift_above), st(retract_lift_below),\n st(printer_settings_id),\n st(printer_notes),\n st(use_set_and_wait_bed), st(use_set_and_wait_extruder)\n };\n }\n \n t_config_option_keys my_options() override { return PrinterEditor::options(); }\nprotected:\n void _update() override;\n void _build() override;\n};\n\n\n}} \/\/ namespace Slic3r::GUI\n#endif \/\/ PRESETEDITOR_HPP\n<commit_msg>Moved to C++14 syntax with string literals.<commit_after>#ifndef PRESETEDITOR_HPP\n#define PRESETEDITOR_HPP\n\n\/\/ stdlib\n#include <string>\n#include <functional>\n\n\/\/ Libslic3r\n#include \"libslic3r.h\"\n#include \"ConfigBase.hpp\"\n#include \"Config.hpp\"\n\n\/\/ GUI\n#include \"misc_ui.hpp\"\n\n\/\/ Wx\n#include <wx\/treectrl.h>\n#include <wx\/imaglist.h>\n#include <wx\/panel.h>\n\nusing namespace std::string_literals;\nnamespace Slic3r { namespace GUI {\n\nclass PresetEditor : public wxPanel {\n\npublic: \n \/\/\/ Member function to retrieve a list of options \n \/\/\/ that this preset governs. Subclasses should \n \/\/\/ call their own static method.\n virtual t_config_option_keys my_options() = 0;\n static t_config_option_keys options() { return t_config_option_keys {}; }\n\n wxSizer* sizer() { return _sizer; };\n PresetEditor(wxWindow* parent, t_config_option_keys options = {});\n PresetEditor() : PresetEditor(nullptr, {}) {};\n\n bool prompt_unsaved_changes();\n void select_preset_by_name(const wxString& name, bool force = false);\n \n \/\/\/ suppress the callback when the tree selection is changed.\n bool disable_tree_sel_changed_event {false};\n\n void save_preset();\n std::function<void ()> on_save_preset {};\n std::function<void ()> on_value_change {};\n\n config_ptr config;\n\n virtual wxString title() = 0;\n virtual std::string name() = 0;\nprotected:\n \/\/ Main sizer\n wxSizer* _sizer {nullptr};\n wxString presets;\n wxImageList* _icons {nullptr};\n wxTreeCtrl* _treectrl {nullptr};\n wxBitmapButton* _btn_save_preset {nullptr}; \n wxBitmapButton* _btn_delete_preset {nullptr};\n wxChoice* _presets_choice {nullptr};\n int _iconcount {-1};\n\n std::vector<wxString> _pages {};\n\n const unsigned int left_col_width {150};\n void _update_tree();\n void load_presets();\n\n virtual void _build() = 0;\n virtual void _update() = 0;\n virtual void _on_preset_loaded() = 0;\n void set_tooltips() { \n this->_btn_save_preset->SetToolTip(wxString(_(\"Save current \")) + this->title());\n this->_btn_delete_preset->SetToolTip(_(\"Delete this preset.\"));\n }\n};\n\nclass PrintEditor : public PresetEditor {\npublic:\n\n PrintEditor(wxWindow* parent, t_config_option_keys options = {});\n PrintEditor() : PrintEditor(nullptr, {}) {};\n\n wxString title() override { return _(\"Print Settings\"); }\n std::string name() override { return \"print\"s; }\n\n \/\/\/ Static method to retrieve list of options that this preset governs.\n static t_config_option_keys options() {\n return t_config_option_keys\n {\n \"layer_height\"s, \"first_layer_height\"s,\n \"adaptive_slicing\"s, \"adaptive_slicing_quality\"s, \"match_horizontal_surfaces\"s,\n \"perimeters\"s, \"spiral_vase\"s,\n \"top_solid_layers\"s, \"bottom_solid_layers\"s,\n \"extra_perimeters\"s, \"avoid_crossing_perimeters\"s, \"thin_walls\"s, \"overhangs\"s,\n \"seam_position\"s, \"external_perimeters_first\"s,\n \"fill_density\"s, \"fill_pattern\"s, \"top_infill_pattern\"s, \"bottom_infill_pattern\"s, \"fill_gaps\"s,\n \"infill_every_layers\"s, \"infill_only_where_needed\"s,\n \"solid_infill_every_layers\"s, \"fill_angle\"s, \"solid_infill_below_area\"s, \"\"s,\n \"only_retract_when_crossing_perimeters\"s, \"infill_first\"s,\n \"max_print_speed\"s, \"max_volumetric_speed\"s,\n \"perimeter_speed\"s, \"small_perimeter_speed\"s, \"external_perimeter_speed\"s, \"infill_speed\"s, \"\"s,\n \"solid_infill_speed\"s, \"top_solid_infill_speed\"s, \"support_material_speed\"s,\n \"support_material_interface_speed\"s, \"bridge_speed\"s, \"gap_fill_speed\"s,\n \"travel_speed\"s,\n \"first_layer_speed\"s,\n \"perimeter_acceleration\"s, \"infill_acceleration\"s, \"bridge_acceleration\"s,\n \"first_layer_acceleration\"s, \"default_acceleration\"s,\n \"skirts\"s, \"skirt_distance\"s, \"skirt_height\"s, \"min_skirt_length\"s,\n \"brim_connections_width\"s, \"brim_width\"s, \"interior_brim_width\"s,\n \"support_material\"s, \"support_material_threshold\"s, \"support_material_max_layers\"s, \"support_material_enforce_layers\"s,\n \"raft_layers\"s,\n \"support_material_pattern\"s, \"support_material_spacing\"s, \"support_material_angle\"s, \"\"s,\n \"support_material_interface_layers\"s, \"support_material_interface_spacing\"s,\n \"support_material_contact_distance\"s, \"support_material_buildplate_only\"s, \"dont_support_bridges\"s,\n \"notes\"s,\n \"complete_objects\"s, \"extruder_clearance_radius\"s, \"extruder_clearance_height\"s,\n \"gcode_comments\"s, \"output_filename_format\"s,\n \"post_process\"s,\n \"perimeter_extruder\"s, \"infill_extruder\"s, \"solid_infill_extruder\"s,\n \"support_material_extruder\"s, \"support_material_interface_extruder\"s,\n \"ooze_prevention\"s, \"standby_temperature_delta\"s,\n \"interface_shells\"s, \"regions_overlap\"s,\n \"extrusion_width\"s, \"first_layer_extrusion_width\"s, \"perimeter_extrusion_width\"s, \"\"s,\n \"external_perimeter_extrusion_width\"s, \"infill_extrusion_width\"s, \"solid_infill_extrusion_width\"s,\n \"top_infill_extrusion_width\"s, \"support_material_extrusion_width\"s,\n \"support_material_interface_extrusion_width\"s, \"infill_overlap\"s, \"bridge_flow_ratio\"s,\n \"xy_size_compensation\"s, \"resolution\"s, \"shortcuts\"s, \"compatible_printers\"s,\n \"print_settings_id\"s\n };\n }\n\n t_config_option_keys my_options() override { return PrintEditor::options(); }\n\nprotected:\n void _update() override;\n void _build() override;\n};\n\nclass PrinterEditor : public PresetEditor {\npublic:\n PrinterEditor(wxWindow* parent, t_config_option_keys options = {});\n PrinterEditor() : PrinterEditor(nullptr, {}) {};\n\n wxString title() override { return _(\"Printer Settings\"); }\n std::string name() override { return \"printer\"s; }\n static t_config_option_keys overridable_options() { return t_config_option_keys \n {\n \"pressure_advance\"s,\n \"retract_length\"s, \"retract_lift\"s, \"retract_speed\"s, \"retract_restart_extra\"s,\n \"retract_before_travel\"s, \"retract_layer_change\"s, \"wipe\"s\n }; };\n\n static t_config_option_keys options() {\n return t_config_option_keys\n {\n \"bed_shape\"s, \"z_offset\"s, \"z_steps_per_mm\"s, \"has_heatbed\"s,\n \"gcode_flavor\"s, \"use_relative_e_distances\"s,\n \"serial_port\"s, \"serial_speed\"s,\n \"host_type\"s, \"print_host\"s, \"octoprint_apikey\"s,\n \"use_firmware_retraction\"s, \"pressure_advance\"s, \"vibration_limit\"s,\n \"use_volumetric_e\"s,\n \"start_gcode\"s, \"end_gcode\"s, \"before_layer_gcode\"s, \"layer_gcode\"s, \"toolchange_gcode\"s, \"between_objects_gcode\"s,\n \"nozzle_diameter\"s, \"extruder_offset\"s, \"min_layer_height\"s, \"max_layer_height\"s,\n \"retract_length\"s, \"retract_lift\"s, \"retract_speed\"s, \"retract_restart_extra\"s, \"retract_before_travel\"s, \"retract_layer_change\"s, \"wipe\"s,\n \"retract_length_toolchange\"s, \"retract_restart_extra_toolchange\"s, \"retract_lift_above\"s, \"retract_lift_below\"s,\n \"printer_settings_id\"s,\n \"printer_notes\"s,\n \"use_set_and_wait_bed\"s, \"use_set_and_wait_extruder\"s\n };\n }\n \n t_config_option_keys my_options() override { return PrinterEditor::options(); }\nprotected:\n void _update() override;\n void _build() override;\n const std::string LogChannel() override {return \"PrinterEditor\"s;} \/\/< Which log these messages should go to.\n};\n\nclass MaterialEditor : public PresetEditor {\npublic:\n\n wxString title() override { return _(\"Material Settings\"); }\n std::string name() override { return \"material\"s; }\n preset_t type() override { return preset_t::Material; }; \n int typeId() override { return static_cast<int>(preset_t::Material); }; \n MaterialEditor(wxWindow* parent, t_config_option_keys options = {});\n MaterialEditor() : MaterialEditor(nullptr, {}) {};\n \n static t_config_option_keys options() {\n return t_config_option_keys\n {\n \"filament_colour\"s, \"filament_diameter\"s, \"filament_notes\"s, \"filament_max_volumetric_speed\"s, \"extrusion_multiplier\"s, \"filament_density\"s, \"filament_cost\"s,\n \"temperature\"s, \"first_layer_temperature\"s, \"bed_temperature\"s, \"first_layer_bed_temperature\"s,\n \"fan_always_on\"s, \"cooling\"s, \"compatible_printers\"s,\n \"min_fan_speed\"s, \"max_fan_speed\"s, \"bridge_fan_speed\"s, \"disable_fan_first_layers\"s,\n \"fan_below_layer_time\"s, \"slowdown_below_layer_time\"s, \"min_print_speed\"s,\n \"start_filament_gcode\"s, \"end_filament_gcode\"s,\n \"filament_settings_id\"s\n };\n }\n \n t_config_option_keys my_options() override { return MaterialEditor::options(); }\nprotected:\n void _update() override;\n void _build() override;\n const std::string LogChannel() override {return \"MaterialEditor\"s;} \/\/< Which log these messages should go to.\n};\n\n\n}} \/\/ namespace Slic3r::GUI\n#endif \/\/ PRESETEDITOR_HPP\n<|endoftext|>"} {"text":"<commit_before>#include \"PresetChooser.hpp\"\n#include \"misc_ui.hpp\"\n\nnamespace Slic3r { namespace GUI {\n\nPresetChooser::PresetChooser(wxWindow* parent, std::weak_ptr<Print> print) : PresetChooser(parent, print, SLIC3RAPP->settings(), SLIC3RAPP->presets) {}\n\nPresetChooser::PresetChooser(wxWindow* parent, std::weak_ptr<Print> print, Settings* external_settings, preset_store& external_presets) :\n wxPanel(parent, wxID_ANY, wxDefaultPosition, wxDefaultSize, wxTAB_TRAVERSAL, \"\"),\n _local_sizer(new wxFlexGridSizer(3,3,1,2)), _parent(parent), _settings(external_settings), _print(print), _presets(external_presets)\n{\n _local_sizer->AddGrowableCol(1, 1);\n _local_sizer->SetFlexibleDirection(wxHORIZONTAL);\n\n for (auto group : { preset_t::Print, preset_t::Material, preset_t::Printer }) {\n wxString name = \"\";\n switch(group) {\n case preset_t::Print:\n name << _(\"Print settings:\");\n break;\n case preset_t::Material:\n name << _(\"Material:\");\n break;\n case preset_t::Printer:\n name << _(\"Printer:\");\n break;\n default:\n break;\n }\n auto* text {new wxStaticText(this, wxID_ANY, name, wxDefaultPosition, wxDefaultSize, wxALIGN_RIGHT)};\n text->SetFont(_settings->small_font());\n\n auto* choice {new wxBitmapComboBox(this, wxID_ANY, \"\", wxDefaultPosition, wxDefaultSize, 0, nullptr, wxCB_READONLY)};\n this->preset_choosers[get_preset(group)].push_back(choice);\n\n \/\/ Settings button\n auto* settings_btn {new wxBitmapButton(this, wxID_ANY, wxBitmap(var(\"cog.png\"), wxBITMAP_TYPE_PNG), wxDefaultPosition, wxDefaultSize, wxBORDER_NONE)};\n\n this->_local_sizer->Add(text, 0, wxALIGN_RIGHT | wxALIGN_CENTER_VERTICAL | wxRIGHT, 4);\n this->_local_sizer->Add(choice, 1, wxALIGN_CENTER_VERTICAL | wxEXPAND | wxBOTTOM, 0);\n this->_local_sizer->Add(settings_btn, 0, wxALIGN_CENTER_VERTICAL | wxEXPAND | wxLEFT, 3);\n \n \/\/ setup listener. \n \/\/ On a combobox event, puts a call to _on_change_combobox() on the evt_idle stack.\n choice->Bind(wxEVT_COMBOBOX, \n [=](wxCommandEvent& e) { \n wxTheApp->CallAfter([=]() { this->_on_change_combobox(group, choice);} );\n });\n }\n\n this->SetSizer(_local_sizer);\n}\n\nvoid PresetChooser::load(std::array<Presets, preset_types> presets) {\n\n wxString selected_printer_name {\"\"};\n for (const auto& group : { preset_t::Printer, preset_t::Material, preset_t::Print }) {\n auto current_list = presets.at(get_preset(group));\n \/\/ Filter out profiles not compatible with this printer\n if (group != preset_t::Printer) {\n current_list = grep(presets.at(get_preset(group)), [selected_printer_name] (const Preset& x) -> bool { return x.compatible(selected_printer_name); });\n }\n\n \/\/ show default names if no other presets visible.\n if (current_list.size() > 1) {\n current_list = grep(presets.at(get_preset(group)), [] (const Preset& x) -> bool { return !x.default_preset; });\n }\n\n \/\/ # Read the current defaults from the settings file\n const auto& settings_defaults {_settings->default_presets.at(get_preset(group))};\n\n size_t i {0};\n std::vector<std::string> preset_names {};\n __chooser_names[get_preset(group)].clear();\n \/\/ populate the chooser\n for (auto* chooser : this->preset_choosers[get_preset(group)]) {\n chooser->Clear();\n assert(chooser->GetCount() == 0);\n for (auto preset : current_list) {\n wxBitmap bitmap;\n switch (group) {\n case preset_t::Print:\n bitmap = wxBitmap(var(\"cog.png\"), wxBITMAP_TYPE_PNG);\n break;\n case preset_t::Material: \n if (auto config = preset.config().lock()) {\n if (preset.default_preset || !config->has(\"filament_colour\"))\n bitmap = wxBitmap(var(\"spool.png\"), wxBITMAP_TYPE_PNG);\n } else { \/\/ fall back if for some reason the config is dead.\n bitmap = wxBitmap(var(\"spool.png\"), wxBITMAP_TYPE_PNG);\n }\n break;\n case preset_t::Printer: \n bitmap = wxBitmap(var(\"printer_empty.png\"), wxBITMAP_TYPE_PNG);\n break;\n default: break;\n }\n chooser->Append(preset.name, bitmap);\n __chooser_names[get_preset(group)].push_back(preset.name);\n }\n assert(chooser->GetCount() == current_list.size());\n\n \/\/ Apply default options from settings\n bool updated_from_settings = false;\n if (settings_defaults.size() > i) { \/\/ only apply if there is a value from Settings\n updated_from_settings = this->select_preset_by_name(settings_defaults.at(i), chooser);\n }\n\n if (!updated_from_settings) \/\/ default\n chooser->SetSelection(0);\n\n wxString selected_preset { chooser->GetString(chooser->GetSelection()) };\n if (group == preset_t::Printer) {\n selected_printer_name = selected_preset;\n }\n\n ++i;\n }\n this->_update_preset_settings(group);\n }\n}\n\nbool PresetChooser::select_preset_by_name(wxString name, preset_t group, size_t index = 0) {\n auto& ps_list = this->preset_choosers.at(get_preset(group));\n bool updated = false;\n if (ps_list.size() > index) {\n updated = select_preset_by_name(name, ps_list.at(index));\n }\n if (updated)\n this->_on_select_preset(group);\n return updated;\n}\n\nbool PresetChooser::select_preset_by_name(wxString name, wxBitmapComboBox* chooser) {\n auto index { chooser->FindString(name) };\n if (index != wxNOT_FOUND) {\n chooser->SetSelection(index);\n return true;\n }\n return false;\n}\n\nvoid PresetChooser::_update_preset_settings(preset_t preset) {\n auto& settings_presets {_settings->default_presets.at(get_preset(preset))};\n settings_presets.clear(); \/\/ make sure previous contents are deconstructed\n settings_presets = this->_get_selected_presets(preset);\n\n}\n\nvoid PresetChooser::_on_select_preset(preset_t preset) {\n \/\/ update settings store\n this->_update_preset_settings(preset);\n \/\/ save settings\n _settings->save_settings();\n if (preset == preset_t::Printer) {\n this->load(); \/\/ reload print\/filament settings to honor compatible printers\n }\n}\n\nbool PresetChooser::prompt_unsaved_changes() {\n return true;\n}\n\nstd::vector<wxString> PresetChooser::_get_selected_presets(preset_t group) const {\n const auto& choosers { this->preset_choosers[get_preset(group)] };\n std::vector<wxString> selected;\n selected.reserve(choosers.size());\n\n for (auto* chooser : choosers) {\n selected.push_back(chooser->GetString(chooser->GetSelection()));\n }\n return selected;\n}\n\nwxString PresetChooser::_get_selected_preset(preset_t group, size_t index) const {\n auto selected { this->_get_selected_presets(group) };\n if (index > selected.size()) { return wxString(\"\"); }\n return selected.at(index);\n}\nvoid PresetChooser::_on_change_combobox(preset_t preset, wxBitmapComboBox* choice) {\n \n \/\/ Prompt for unsaved changes and undo selections if cancelled and return early\n \/\/ Callback to close preset editor tab, close editor tabs, reload presets.\n \/\/\n if (!this->prompt_unsaved_changes()) return;\n wxTheApp->CallAfter([this,preset]()\n {\n this->_on_select_preset(preset);\n \/\/ reload presets; removes the modified mark\n this->load();\n });\n \/*\n sub _on_change_combobox {\n my ($self, $group, $choice) = @_;\n \n if (0) {\n # This code is disabled because wxPerl doesn't provide GetCurrentSelection\n my $current_name = $self->{preset_choosers_names}{$choice}[$choice->GetCurrentSelection];\n my $current = first { $_->name eq $current_name } @{wxTheApp->presets->{$group}};\n if (!$current->prompt_unsaved_changes($self)) {\n # Restore the previous one\n $choice->SetSelection($choice->GetCurrentSelection);\n return;\n }\n } else {\n return 0 if !$self->prompt_unsaved_changes;\n }\n wxTheApp->CallAfter(sub {\n # Close the preset editor tab if any\n if (exists $self->GetFrame->{preset_editor_tabs}{$group}) {\n my $tabpanel = $self->GetFrame->{tabpanel};\n $tabpanel->DeletePage($tabpanel->GetPageIndex($self->GetFrame->{preset_editor_tabs}{$group}));\n delete $self->GetFrame->{preset_editor_tabs}{$group};\n $tabpanel->SetSelection(0); # without this, a newly created tab will not be selected by wx\n }\n \n $self->_on_select_preset($group);\n \n # This will remove the \"(modified)\" mark from any dirty preset handled here.\n $self->load_presets;\n });\n}\n*\/\n}\n\n\n}} \/\/ Slic3r::GUI\n<commit_msg>When filtering default values out, it helps to not use the original source and clobber the compatibilty list.<commit_after>#include \"PresetChooser.hpp\"\n#include \"misc_ui.hpp\"\n\nnamespace Slic3r { namespace GUI {\n\nPresetChooser::PresetChooser(wxWindow* parent, std::weak_ptr<Print> print) : PresetChooser(parent, print, SLIC3RAPP->settings(), SLIC3RAPP->presets) {}\n\nPresetChooser::PresetChooser(wxWindow* parent, std::weak_ptr<Print> print, Settings* external_settings, preset_store& external_presets) :\n wxPanel(parent, wxID_ANY, wxDefaultPosition, wxDefaultSize, wxTAB_TRAVERSAL, \"\"),\n _local_sizer(new wxFlexGridSizer(3,3,1,2)), _parent(parent), _settings(external_settings), _print(print), _presets(external_presets)\n{\n _local_sizer->AddGrowableCol(1, 1);\n _local_sizer->SetFlexibleDirection(wxHORIZONTAL);\n\n for (auto group : { preset_t::Print, preset_t::Material, preset_t::Printer }) {\n wxString name = \"\";\n switch(group) {\n case preset_t::Print:\n name << _(\"Print settings:\");\n break;\n case preset_t::Material:\n name << _(\"Material:\");\n break;\n case preset_t::Printer:\n name << _(\"Printer:\");\n break;\n default:\n break;\n }\n auto* text {new wxStaticText(this, wxID_ANY, name, wxDefaultPosition, wxDefaultSize, wxALIGN_RIGHT)};\n text->SetFont(_settings->small_font());\n\n auto* choice {new wxBitmapComboBox(this, wxID_ANY, \"\", wxDefaultPosition, wxDefaultSize, 0, nullptr, wxCB_READONLY)};\n this->preset_choosers[get_preset(group)].push_back(choice);\n\n \/\/ Settings button\n auto* settings_btn {new wxBitmapButton(this, wxID_ANY, wxBitmap(var(\"cog.png\"), wxBITMAP_TYPE_PNG), wxDefaultPosition, wxDefaultSize, wxBORDER_NONE)};\n\n this->_local_sizer->Add(text, 0, wxALIGN_RIGHT | wxALIGN_CENTER_VERTICAL | wxRIGHT, 4);\n this->_local_sizer->Add(choice, 1, wxALIGN_CENTER_VERTICAL | wxEXPAND | wxBOTTOM, 0);\n this->_local_sizer->Add(settings_btn, 0, wxALIGN_CENTER_VERTICAL | wxEXPAND | wxLEFT, 3);\n \n \/\/ setup listener. \n \/\/ On a combobox event, puts a call to _on_change_combobox() on the evt_idle stack.\n choice->Bind(wxEVT_COMBOBOX, \n [=](wxCommandEvent& e) { \n wxTheApp->CallAfter([=]() { this->_on_change_combobox(group, choice);} );\n });\n }\n\n this->SetSizer(_local_sizer);\n}\n\nvoid PresetChooser::load(std::array<Presets, preset_types> presets) {\n\n wxString selected_printer_name {\"\"};\n for (const auto& group : { preset_t::Printer, preset_t::Material, preset_t::Print }) {\n auto current_list = presets.at(get_preset(group));\n \/\/ Filter out profiles not compatible with this printer\n if (group != preset_t::Printer) {\n current_list = grep(presets.at(get_preset(group)), [selected_printer_name] (const Preset& x) -> bool { return x.compatible(selected_printer_name); });\n }\n\n \/\/ show default names if no other presets visible.\n if (current_list.size() > 1) {\n current_list = grep(current_list, [] (const Preset& x) -> bool { return !x.default_preset; });\n }\n\n \/\/ # Read the current defaults from the settings file\n const auto& settings_defaults {_settings->default_presets.at(get_preset(group))};\n\n size_t i {0};\n std::vector<std::string> preset_names {};\n __chooser_names[get_preset(group)].clear();\n \/\/ populate the chooser\n for (auto* chooser : this->preset_choosers[get_preset(group)]) {\n chooser->Clear();\n assert(chooser->GetCount() == 0);\n for (auto preset : current_list) {\n wxBitmap bitmap;\n switch (group) {\n case preset_t::Print:\n bitmap = wxBitmap(var(\"cog.png\"), wxBITMAP_TYPE_PNG);\n break;\n case preset_t::Material: \n if (auto config = preset.config().lock()) {\n if (preset.default_preset || !config->has(\"filament_colour\"))\n bitmap = wxBitmap(var(\"spool.png\"), wxBITMAP_TYPE_PNG);\n } else { \/\/ fall back if for some reason the config is dead.\n bitmap = wxBitmap(var(\"spool.png\"), wxBITMAP_TYPE_PNG);\n }\n break;\n case preset_t::Printer: \n bitmap = wxBitmap(var(\"printer_empty.png\"), wxBITMAP_TYPE_PNG);\n break;\n default: break;\n }\n chooser->Append(preset.name, bitmap);\n __chooser_names[get_preset(group)].push_back(preset.name);\n }\n assert(chooser->GetCount() == current_list.size());\n\n \/\/ Apply default options from settings\n bool updated_from_settings = false;\n if (settings_defaults.size() > i) { \/\/ only apply if there is a value from Settings\n updated_from_settings = this->select_preset_by_name(settings_defaults.at(i), chooser);\n }\n\n if (!updated_from_settings) \/\/ default\n chooser->SetSelection(0);\n\n wxString selected_preset { chooser->GetString(chooser->GetSelection()) };\n if (group == preset_t::Printer) {\n selected_printer_name = selected_preset;\n }\n\n ++i;\n }\n this->_update_preset_settings(group);\n }\n}\n\nbool PresetChooser::select_preset_by_name(wxString name, preset_t group, size_t index = 0) {\n auto& ps_list = this->preset_choosers.at(get_preset(group));\n bool updated = false;\n if (ps_list.size() > index) {\n updated = select_preset_by_name(name, ps_list.at(index));\n }\n if (updated)\n this->_on_select_preset(group);\n return updated;\n}\n\nbool PresetChooser::select_preset_by_name(wxString name, wxBitmapComboBox* chooser) {\n auto index { chooser->FindString(name) };\n if (index != wxNOT_FOUND) {\n chooser->SetSelection(index);\n return true;\n }\n return false;\n}\n\nvoid PresetChooser::_update_preset_settings(preset_t preset) {\n auto& settings_presets {_settings->default_presets.at(get_preset(preset))};\n settings_presets.clear(); \/\/ make sure previous contents are deconstructed\n settings_presets = this->_get_selected_presets(preset);\n\n}\n\nvoid PresetChooser::_on_select_preset(preset_t preset) {\n \/\/ update settings store\n this->_update_preset_settings(preset);\n \/\/ save settings\n _settings->save_settings();\n if (preset == preset_t::Printer) {\n this->load(); \/\/ reload print\/filament settings to honor compatible printers\n }\n}\n\nbool PresetChooser::prompt_unsaved_changes() {\n return true;\n}\n\nstd::vector<wxString> PresetChooser::_get_selected_presets(preset_t group) const {\n const auto& choosers { this->preset_choosers[get_preset(group)] };\n std::vector<wxString> selected;\n selected.reserve(choosers.size());\n\n for (auto* chooser : choosers) {\n selected.push_back(chooser->GetString(chooser->GetSelection()));\n }\n return selected;\n}\n\nwxString PresetChooser::_get_selected_preset(preset_t group, size_t index) const {\n auto selected { this->_get_selected_presets(group) };\n if (index > selected.size()) { return wxString(\"\"); }\n return selected.at(index);\n}\nvoid PresetChooser::_on_change_combobox(preset_t preset, wxBitmapComboBox* choice) {\n \n \/\/ Prompt for unsaved changes and undo selections if cancelled and return early\n \/\/ Callback to close preset editor tab, close editor tabs, reload presets.\n \/\/\n if (!this->prompt_unsaved_changes()) return;\n wxTheApp->CallAfter([this,preset]()\n {\n this->_on_select_preset(preset);\n \/\/ reload presets; removes the modified mark\n this->load();\n });\n \/*\n sub _on_change_combobox {\n my ($self, $group, $choice) = @_;\n \n if (0) {\n # This code is disabled because wxPerl doesn't provide GetCurrentSelection\n my $current_name = $self->{preset_choosers_names}{$choice}[$choice->GetCurrentSelection];\n my $current = first { $_->name eq $current_name } @{wxTheApp->presets->{$group}};\n if (!$current->prompt_unsaved_changes($self)) {\n # Restore the previous one\n $choice->SetSelection($choice->GetCurrentSelection);\n return;\n }\n } else {\n return 0 if !$self->prompt_unsaved_changes;\n }\n wxTheApp->CallAfter(sub {\n # Close the preset editor tab if any\n if (exists $self->GetFrame->{preset_editor_tabs}{$group}) {\n my $tabpanel = $self->GetFrame->{tabpanel};\n $tabpanel->DeletePage($tabpanel->GetPageIndex($self->GetFrame->{preset_editor_tabs}{$group}));\n delete $self->GetFrame->{preset_editor_tabs}{$group};\n $tabpanel->SetSelection(0); # without this, a newly created tab will not be selected by wx\n }\n \n $self->_on_select_preset($group);\n \n # This will remove the \"(modified)\" mark from any dirty preset handled here.\n $self->load_presets;\n });\n}\n*\/\n}\n\n\n}} \/\/ Slic3r::GUI\n<|endoftext|>"} {"text":"<commit_before>\/*\n=============================================================================\n Name: MiniKing.h\n Author: Emilio Garcia-Fidalgo\n Date: 30\/10\/06 18:22\n Description: Main Library class\n=============================================================================\n*\/\n\n#include \"libminiking\/MiniKing.h\"\n\nMiniKing::MiniKing(char *port, int timeout) :\n cp(port, br115200, db8, None, sb1, timeout, false),\n mtheadcommand(&conf),\n mtreboot(),\n mtsenddata(),\n mtsendversion(),\n mtsendbbuser(),\n mtversiondata(),\n mtalive(),\n mtbbuserdata(),\n mtheaddata1(),\n mtheaddata2() {\n\n \/\/ Default Settings\n\n setDefaultConfig();\n\n \/\/ Need send 'MtSendData' command\n\n needData = true;\n\n \/\/ To receive mtHeadData Packets\n\n allReceived = true;\n\n \/\/ Verbose Mode\n\n verbose = false;\n}\n\n\/\/ Configuration access functions\n\nvoid MiniKing::set8Bits(bool op) { conf.hdctrlbits[0] = op; }\n\nbool MiniKing::get8Bits(void) { return conf.hdctrlbits[0]; }\n\nvoid MiniKing::setContinuous(bool op) { conf.hdctrlbits[1] = op; }\n\nbool MiniKing::getContinuous(void) { return conf.hdctrlbits[1]; }\n\nvoid MiniKing::setInverted(bool op) { conf.hdctrlbits[3] = op; }\n\nbool MiniKing::getInverted(void) { return conf.hdctrlbits[3]; }\n\nvoid MiniKing::setMotorDisabled(bool op) { conf.hdctrlbits[4] = op; }\n\nbool MiniKing::getMotorDisabled(void) { return conf.hdctrlbits[4]; }\n\nvoid MiniKing::setTransmitDisabled(bool op) { conf.hdctrlbits[5] = op; }\n\nbool MiniKing::getTransmitDisabled(void) { return conf.hdctrlbits[5]; }\n\nvoid MiniKing::setApplyOffset(bool op) { conf.hdctrlbits[10] = op;}\n\nbool MiniKing::getApplyOffset(void) { return conf.hdctrlbits[10]; }\n\nvoid MiniKing::setStare(bool op) { conf.hdctrlbits[12] = op;}\n\nbool MiniKing::getStare(void) { return conf.hdctrlbits[12]; }\n\nvoid MiniKing::setSonarType(SonarType st) { conf.sonartype = st; }\n\nSonarType MiniKing::getSonarType(void) { return conf.sonartype; }\n\nvoid MiniKing::setFrequency(Frequency freq) { conf.frequency = freq; }\n\nFrequency MiniKing::getFrequency(void) { return conf.frequency; }\n\nvoid MiniKing::setRange(int range) { conf.rangescale = range; }\n\nint MiniKing::getRange(void) { return conf.rangescale; }\n\nvoid MiniKing::setLeftLim(int lim) { conf.leftlim = (lim * 10) \/ 9; }\n\nfloat MiniKing::getLeftLim(void) { return (conf.leftlim * 9.0) \/ 10.0; }\n\nvoid MiniKing::setRightLim(int lim) { conf.rightlim = (lim * 10) \/ 9; }\n\nfloat MiniKing::getRightLim(void) { return (conf.rightlim * 9.0) \/ 10.0; }\n\nvoid MiniKing::setADSpan(int ads) { conf.adspan = ads; }\n\nint MiniKing::getADSpan(void) { return conf.adspan; }\n\nvoid MiniKing::setADLow(int adl) { conf.adlow = adl; }\n\nint MiniKing::getADLow(void) { return conf.adlow; }\n\nvoid MiniKing::setGain(int gn) { conf.gain = gn; }\n\nint MiniKing::getGain(void) { return conf.gain; }\n\nvoid MiniKing::setResolution(Resolution rs) { conf.resolution = rs; }\n\nResolution MiniKing::getResolution(void) { return conf.resolution; }\n\nvoid MiniKing::setBins(int bn) { conf.bins = bn; }\n\nint MiniKing::getBins(void) { return conf.bins; }\n\n\/\/ Version data access functions\n\nBoardType MiniKing::getBoardType(void) { return vd.bt; }\n\nint MiniKing::getSerialNumber(void) { return vd.serialnumber; }\n\nint MiniKing::getProgramLength(void) { return vd.programlength; }\n\nint MiniKing::getChecksum(void) { return vd.checksum; }\n\n\/\/ 'MtAlive' access functions\n\nbool MiniKing::hasParams(void) { return mtalive.hasParams(); }\n\nint MiniKing::getHeadTime(void) { return mtalive.getHeadTime(); }\n\nfloat MiniKing::getMotorPos(void) { return (((mtalive.getMotorPos() \/ 16.0) * 9.0) \/ 10.0); } \/\/ In grads \n\nbool MiniKing::isCentering(void) { return mtalive.isCentering(); }\n\nbool MiniKing::isCentred(void) { return mtalive.isCentred(); }\n\nbool MiniKing::isMotoring(void) { return mtalive.isMotoring(); }\n\nbool MiniKing::isMotorOn(void) { return mtalive.isMotorOn(); }\n\nbool MiniKing::isDir(void) { return mtalive.isDir(); }\n\nbool MiniKing::isScan(void) { return mtalive.isScan(); }\n\nbool MiniKing::configReceived(void) { return mtalive.paramsReceived(); }\n\n\/\/ 'MtBBUserData' access functions\n\nLANBitRate MiniKing::getLanBaudLow(void) { return mtbbuserdata.getLanBaudLow(); }\n\nLANBitRate MiniKing::getLanBaudHigh(void) { return mtbbuserdata.getLanBaudHigh(); }\n\nLANSensitivity MiniKing::getSensitivityLow(void) { return mtbbuserdata.getSensitivityLow(); }\n\nLANSensitivity MiniKing::getSensitivityHigh(void) { return mtbbuserdata.getSensitivityHigh(); }\n\nint MiniKing::getLanTimeout(void) { return mtbbuserdata.getLanTimeout(); }\n\nBitRate MiniKing::getCOMBaudLow(void) { return mtbbuserdata.getA0BaudLow(); }\n\nBitRate MiniKing::getCOMBaudHigh(void) { return mtbbuserdata.getA0BaudHigh(); }\n\nParity MiniKing::getCOMParityLow(void) { return mtbbuserdata.getA0ParityLow(); }\n\nParity MiniKing::getCOMParityHigh(void) { return mtbbuserdata.getA0ParityHigh(); }\n\nDataBits MiniKing::getCOMDataBitsLow(void) { return mtbbuserdata.getA0DataBitsLow(); }\n\nDataBits MiniKing::getCOMDataBitsHigh(void) { return mtbbuserdata.getA0DataBitsHigh(); }\n\nBitRate MiniKing::getAUXBaudLow(void) { return mtbbuserdata.getA1BaudLow(); }\n\nBitRate MiniKing::getAUXBaudHigh(void) { return mtbbuserdata.getA1BaudHigh(); }\n\nParity MiniKing::getAUXParityLow(void) { return mtbbuserdata.getA1ParityLow(); }\n\nParity MiniKing::getAUXParityHigh(void) { return mtbbuserdata.getA1ParityHigh(); }\n\nDataBits MiniKing::getAUXDataBitsLow(void) { return mtbbuserdata.getA1DataBitsLow(); }\n\nDataBits MiniKing::getAUXDataBitsHigh(void) { return mtbbuserdata.getA1DataBitsHigh(); }\n\nbool MiniKing::hasMotor(void) { return mtbbuserdata.hasMotor(); }\n\nbool MiniKing::hasAux(void) { return mtbbuserdata.hasAux(); }\n\nbool MiniKing::hasRollSensor(void) { return mtbbuserdata.hasRollSensor(); }\n\nSonarBlock *MiniKing::otherInfo(void) { return &(mtbbuserdata.snb); }\n\n\/\/ 'MtHeadData' access functions\n\nfloat MiniKing::getPosition(void) { \n \n if (needData)\n return ((((float)mtheaddata2.getBearing() \/ 16.0) * 9.0) \/ 10.0); \/\/ In grads\n else\n return ((((float)mtheaddata1.getBearing() \/ 16.0) * 9.0) \/ 10.0); \/\/ In grads\n}\n\nint MiniKing::getDataLength(void) {\n \n if (needData)\n return mtheaddata2.getDataLength();\n else\n return mtheaddata1.getDataLength();\n}\n\n\/\/ General functions\n\nvoid MiniKing::setDefaultConfig() { \/\/ Need updateConfig() after to take effect\n\n \/\/ Hdctrl bits\n\n conf.hdctrlbits[0] = true; \/\/ 8 Data Bits\n conf.hdctrlbits[1] = true; \/\/ Scan continuous\n conf.hdctrlbits[2] = true; \/\/ Clockwise\n conf.hdctrlbits[3] = false; \/\/ Normal mounted\n conf.hdctrlbits[4] = false; \/\/ Motor Enabled\n conf.hdctrlbits[5] = false; \/\/ Transmitter Enabled\n conf.hdctrlbits[6] = false; \/\/ Default, Always 0\n conf.hdctrlbits[7] = false; \/\/ Only One Channel Operation\n conf.hdctrlbits[8] = true; \/\/ Default, Always 1\n conf.hdctrlbits[9] = true; \/\/ Sonar has scanning motor\n conf.hdctrlbits[10] = false; \/\/ Do not apply offsets\n conf.hdctrlbits[11] = false; \/\/ Not pingpong, only one channel\n conf.hdctrlbits[12] = false; \/\/ Don´t stare in a fixed direction\n conf.hdctrlbits[13] = true; \/\/ Default, Always 1\n conf.hdctrlbits[14] = false; \/\/ Default, Always 0\n conf.hdctrlbits[15] = false; \/\/ Don´t ignore sensor\n\n \/\/ Head Type\n\n conf.sonartype = ImagingSonar;\n\n \/\/ Head Frequency\n\n conf.frequency = f675;\n\n \/\/ Range Scale\n\n conf.rangescale = 30;\n\n \/\/ Scan Limits\n\n conf.leftlim = 0;\n conf.rightlim = 0;\n\n \/\/ ADSpan and ADLow (in Db´s)\n\n conf.adspan = 12;\n conf.adlow = 13;\n\n \/\/ Initial Gain\n\n conf.gain = 40;\n\n \/\/ Resolution\n\n conf.resolution = Medium;\n\n \/\/ Number of Range Bins for each ping\n\n conf.bins = 300;\n}\n\nvoid MiniKing::initSonar(void) { \/\/ Basic initialization procedure\n\n while (receive(&cp) != mtAlive);\n\n mtsendversion.send(&cp);\n if (verbose) mtsendversion.printPacket(true);\n\n while (receive(&cp) != mtVersionData);\n\n vd.fr = mtversiondata.getFrequency();\n vd.bt = mtversiondata.getBoardType();\n vd.serialnumber = mtversiondata.getSerialNumber();\n vd.programlength = mtversiondata.getProgramLength();\n vd.checksum = mtversiondata.getChecksum();\n\n mtsendbbuser.send(&cp);\n if (verbose) mtsendversion.printPacket(true);\n\n while (receive(&cp) != mtBBUserData);\n\n while (receive(&cp) != mtAlive);\n\n while (!hasParams()) {\n\n mtheadcommand.send(&cp);\n if (verbose) mtheadcommand.printPacket(true);\n while (receive(&cp) != mtAlive);\n }\n}\n\nvoid MiniKing::reboot(void) { \/\/ Reboots sonar\n\n setDefaultConfig();\n\n mtreboot.send(&cp);\n if (verbose) mtreboot.printPacket(true);\n while (receive(&cp) != mtAlive);\n\n while (hasParams()) receive(&cp);\n\n while (!hasParams()) {\n\n mtheadcommand.send(&cp);\n if (verbose) mtheadcommand.printPacket(true);\n\n while (receive(&cp) != mtAlive);\n }\n}\n\nvoid MiniKing::updateConfig(void) { \/\/ Update sonar´s parametres\n\n do {\n\n mtheadcommand.send(&cp);\n if (verbose) mtheadcommand.printPacket(true);\n while (receive(&cp) != mtAlive);\n } while (!hasParams());\n}\n\nBYTE *MiniKing::getScanLine(void) { \/\/ Get a data scan\n\n if (needData) {\n\n mtsenddata.send(&cp);\n if (verbose) mtsenddata.printPacket(true);\n\n while (receive(&cp) != mtHeadData);\n\n allReceived = false;\n\n while (receive(&cp) != mtHeadData);\n\n allReceived = true;\n\n needData = false;\n\n return mtheaddata1.getDataBytes();\n }\n else {\n\n needData = true;\n\n return mtheaddata2.getDataBytes();\n }\n}\n\nvoid MiniKing::setVerboseMode(bool op) {\n\n verbose = op;\n}\n\nbool MiniKing::isLeftLimit(void) {\n\n if (needData) {\n\n if (mtheaddata1.getSweepCode() == ScanLeftLimit)\n return true;\n else\n return false;\n }\n else {\n\n if (mtheaddata2.getSweepCode() == ScanLeftLimit)\n return true;\n else\n return false;\n }\n}\n\nbool MiniKing::isRightLimit(void) {\n\n if (needData) {\n\n if (mtheaddata1.getSweepCode() == ScanRightLimit)\n return true;\n else\n return false;\n }\n else {\n\n if (mtheaddata2.getSweepCode() == ScanRightLimit)\n return true;\n else\n return false;\n }\n}\n\n\/\/ Waits for Initial Character\n\nBYTE synchronize(SerialPort *cport) {\n\n BYTE ch;\n\n try {\n\n while((ch = cport->read()) != '@');\n return ch;\n }\n catch (runtime_error &e) { \/\/ Error in timeouts or bytes\n cout << e.what() << endl;\n return false;\n }\n}\n\n\/\/ General receive\n\nPacketType MiniKing::receive(SerialPort *cport) {\n\n BYTE inchar = synchronize(cport);\n BYTE hdr;\n BYTE hexln[4];\n BYTE binln[2];\n BYTE sid;\n BYTE did;\n BYTE countmsg;\n BYTE ptype;\n BYTE sequence;\n BYTE node;\n\n if (!inchar) {\n cout << \"Can´t receive message\" << endl;\n }\n else if (inchar == '@') {\n try {\n\n \/\/ Header\n\n hdr = inchar;\n\n \/\/ Hex Length\n\n cport->read(hexln, 4);\n\n \/\/ Bin Length\n\n cport->read(binln, 2);\n\n \/\/ Source ID and Destination ID\n\n sid = cport->read();\n did = cport->read();\n\n \/\/ Count Message\n\n countmsg = cport->read();\n\n \/\/ Packet Type\n\n ptype = cport->read();\n\n \/\/ Sequence Number\n\n sequence = cport->read();\n\n \/\/ Copy of Byte 8\n\n node = cport->read();\n\n Message *msg = NULL;\n\n switch (ptype) {\n case mtAlive:\n msg = &mtalive;\n mtalive.receive(&cp);\n break;\n case mtBBUserData:\n msg = &mtbbuserdata;\n mtbbuserdata.receive(&cp);\n break;\n case mtVersionData:\n msg = &mtversiondata;\n mtversiondata.receive(&cp);\n break;\n case mtHeadData:\n if (allReceived) {\n msg = &mtheaddata1;\n mtheaddata1.receive(&cp);\n }\n else {\n msg = &mtheaddata2;\n mtheaddata2.receive(&cp);\n }\n break;\n default:\n break;\n }\n msg->hdr = inchar;\n for (int i = 0; i < 4; i++)\n msg->hexln[i] = hexln[i];\n for (int i = 0; i < 2; i++)\n msg->binln[i] = binln[i];\n msg->sid = sid;\n msg->did = did;\n msg->countmsg = countmsg;\n msg->ptype = ptype;\n msg->sequence = sequence;\n msg->node = node;\n if (verbose) msg->printPacket(true);\n return (PacketType)ptype;\n }\n catch (runtime_error &e) { \/\/ Error in timeouts or bytes\n cout << e.what() << endl;\n }\n }\n else {\n cout << \"Unknown error receiving message\" << endl;\n }\n return errorPacket;\n}\n<commit_msg>Minnor changes<commit_after>\/*\n=============================================================================\n Name: MiniKing.h\n Author: Emilio Garcia-Fidalgo\n Date: 30\/10\/06 18:22\n Description: Main Library class\n=============================================================================\n*\/\n\n#include \"libminiking\/MiniKing.h\"\n\nMiniKing::MiniKing(char *port, int timeout) :\n cp(port, br115200, db8, None, sb1, timeout, false),\n mtheadcommand(&conf),\n mtreboot(),\n mtsenddata(),\n mtsendversion(),\n mtsendbbuser(),\n mtversiondata(),\n mtalive(),\n mtbbuserdata(),\n mtheaddata1(),\n mtheaddata2() {\n\n \/\/ Default Settings\n\n setDefaultConfig();\n\n \/\/ Need send 'MtSendData' command\n\n needData = true;\n\n \/\/ To receive mtHeadData Packets\n\n allReceived = true;\n\n \/\/ Verbose Mode\n\n verbose = false;\n}\n\n\/\/ Configuration access functions\n\nvoid MiniKing::set8Bits(bool op) { conf.hdctrlbits[0] = op; }\n\nbool MiniKing::get8Bits(void) { return conf.hdctrlbits[0]; }\n\nvoid MiniKing::setContinuous(bool op) { conf.hdctrlbits[1] = op; }\n\nbool MiniKing::getContinuous(void) { return conf.hdctrlbits[1]; }\n\nvoid MiniKing::setInverted(bool op) { conf.hdctrlbits[3] = op; }\n\nbool MiniKing::getInverted(void) { return conf.hdctrlbits[3]; }\n\nvoid MiniKing::setMotorDisabled(bool op) { conf.hdctrlbits[4] = op; }\n\nbool MiniKing::getMotorDisabled(void) { return conf.hdctrlbits[4]; }\n\nvoid MiniKing::setTransmitDisabled(bool op) { conf.hdctrlbits[5] = op; }\n\nbool MiniKing::getTransmitDisabled(void) { return conf.hdctrlbits[5]; }\n\nvoid MiniKing::setApplyOffset(bool op) { conf.hdctrlbits[10] = op;}\n\nbool MiniKing::getApplyOffset(void) { return conf.hdctrlbits[10]; }\n\nvoid MiniKing::setStare(bool op) { conf.hdctrlbits[12] = op;}\n\nbool MiniKing::getStare(void) { return conf.hdctrlbits[12]; }\n\nvoid MiniKing::setSonarType(SonarType st) { conf.sonartype = st; }\n\nSonarType MiniKing::getSonarType(void) { return conf.sonartype; }\n\nvoid MiniKing::setFrequency(Frequency freq) { conf.frequency = freq; }\n\nFrequency MiniKing::getFrequency(void) { return conf.frequency; }\n\nvoid MiniKing::setRange(int range) { conf.rangescale = range; }\n\nint MiniKing::getRange(void) { return conf.rangescale; }\n\nvoid MiniKing::setLeftLim(int lim) { conf.leftlim = (lim * 10) \/ 9; }\n\nfloat MiniKing::getLeftLim(void) { return (conf.leftlim * 9.0) \/ 10.0; }\n\nvoid MiniKing::setRightLim(int lim) { conf.rightlim = (lim * 10) \/ 9; }\n\nfloat MiniKing::getRightLim(void) { return (conf.rightlim * 9.0) \/ 10.0; }\n\nvoid MiniKing::setADSpan(int ads) { conf.adspan = ads; }\n\nint MiniKing::getADSpan(void) { return conf.adspan; }\n\nvoid MiniKing::setADLow(int adl) { conf.adlow = adl; }\n\nint MiniKing::getADLow(void) { return conf.adlow; }\n\nvoid MiniKing::setGain(int gn) { conf.gain = gn; }\n\nint MiniKing::getGain(void) { return conf.gain; }\n\nvoid MiniKing::setResolution(Resolution rs) { conf.resolution = rs; }\n\nResolution MiniKing::getResolution(void) { return conf.resolution; }\n\nvoid MiniKing::setBins(int bn) { conf.bins = bn; }\n\nint MiniKing::getBins(void) { return conf.bins; }\n\n\/\/ Version data access functions\n\nBoardType MiniKing::getBoardType(void) { return vd.bt; }\n\nint MiniKing::getSerialNumber(void) { return vd.serialnumber; }\n\nint MiniKing::getProgramLength(void) { return vd.programlength; }\n\nint MiniKing::getChecksum(void) { return vd.checksum; }\n\n\/\/ 'MtAlive' access functions\n\nbool MiniKing::hasParams(void) { return mtalive.hasParams(); }\n\nint MiniKing::getHeadTime(void) { return mtalive.getHeadTime(); }\n\nfloat MiniKing::getMotorPos(void) { return (((mtalive.getMotorPos() \/ 16.0) * 9.0) \/ 10.0); } \/\/ In grads\n\nbool MiniKing::isCentering(void) { return mtalive.isCentering(); }\n\nbool MiniKing::isCentred(void) { return mtalive.isCentred(); }\n\nbool MiniKing::isMotoring(void) { return mtalive.isMotoring(); }\n\nbool MiniKing::isMotorOn(void) { return mtalive.isMotorOn(); }\n\nbool MiniKing::isDir(void) { return mtalive.isDir(); }\n\nbool MiniKing::isScan(void) { return mtalive.isScan(); }\n\nbool MiniKing::configReceived(void) { return mtalive.paramsReceived(); }\n\n\/\/ 'MtBBUserData' access functions\n\nLANBitRate MiniKing::getLanBaudLow(void) { return mtbbuserdata.getLanBaudLow(); }\n\nLANBitRate MiniKing::getLanBaudHigh(void) { return mtbbuserdata.getLanBaudHigh(); }\n\nLANSensitivity MiniKing::getSensitivityLow(void) { return mtbbuserdata.getSensitivityLow(); }\n\nLANSensitivity MiniKing::getSensitivityHigh(void) { return mtbbuserdata.getSensitivityHigh(); }\n\nint MiniKing::getLanTimeout(void) { return mtbbuserdata.getLanTimeout(); }\n\nBitRate MiniKing::getCOMBaudLow(void) { return mtbbuserdata.getA0BaudLow(); }\n\nBitRate MiniKing::getCOMBaudHigh(void) { return mtbbuserdata.getA0BaudHigh(); }\n\nParity MiniKing::getCOMParityLow(void) { return mtbbuserdata.getA0ParityLow(); }\n\nParity MiniKing::getCOMParityHigh(void) { return mtbbuserdata.getA0ParityHigh(); }\n\nDataBits MiniKing::getCOMDataBitsLow(void) { return mtbbuserdata.getA0DataBitsLow(); }\n\nDataBits MiniKing::getCOMDataBitsHigh(void) { return mtbbuserdata.getA0DataBitsHigh(); }\n\nBitRate MiniKing::getAUXBaudLow(void) { return mtbbuserdata.getA1BaudLow(); }\n\nBitRate MiniKing::getAUXBaudHigh(void) { return mtbbuserdata.getA1BaudHigh(); }\n\nParity MiniKing::getAUXParityLow(void) { return mtbbuserdata.getA1ParityLow(); }\n\nParity MiniKing::getAUXParityHigh(void) { return mtbbuserdata.getA1ParityHigh(); }\n\nDataBits MiniKing::getAUXDataBitsLow(void) { return mtbbuserdata.getA1DataBitsLow(); }\n\nDataBits MiniKing::getAUXDataBitsHigh(void) { return mtbbuserdata.getA1DataBitsHigh(); }\n\nbool MiniKing::hasMotor(void) { return mtbbuserdata.hasMotor(); }\n\nbool MiniKing::hasAux(void) { return mtbbuserdata.hasAux(); }\n\nbool MiniKing::hasRollSensor(void) { return mtbbuserdata.hasRollSensor(); }\n\nSonarBlock *MiniKing::otherInfo(void) { return &(mtbbuserdata.snb); }\n\n\/\/ 'MtHeadData' access functions\n\nfloat MiniKing::getPosition(void) {\n\n if (needData)\n return ((((float)mtheaddata2.getBearing() \/ 16.0) * 9.0) \/ 10.0); \/\/ In grads\n else\n return ((((float)mtheaddata1.getBearing() \/ 16.0) * 9.0) \/ 10.0); \/\/ In grads\n}\n\nint MiniKing::getDataLength(void) {\n\n if (needData)\n return mtheaddata2.getDataLength();\n else\n return mtheaddata1.getDataLength();\n}\n\n\/\/ General functions\n\nvoid MiniKing::setDefaultConfig() { \/\/ Need updateConfig() after to take effect\n\n \/\/ Hdctrl bits\n\n conf.hdctrlbits[0] = true; \/\/ 8 Data Bits\n conf.hdctrlbits[1] = true; \/\/ Scan continuous\n conf.hdctrlbits[2] = true; \/\/ Clockwise\n conf.hdctrlbits[3] = false; \/\/ Normal mounted\n conf.hdctrlbits[4] = false; \/\/ Motor Enabled\n conf.hdctrlbits[5] = false; \/\/ Transmitter Enabled\n conf.hdctrlbits[6] = false; \/\/ Default, Always 0\n conf.hdctrlbits[7] = false; \/\/ Only One Channel Operation\n conf.hdctrlbits[8] = true; \/\/ Default, Always 1\n conf.hdctrlbits[9] = true; \/\/ Sonar has scanning motor\n conf.hdctrlbits[10] = false; \/\/ Do not apply offsets\n conf.hdctrlbits[11] = false; \/\/ Not pingpong, only one channel\n conf.hdctrlbits[12] = false; \/\/ Don´t stare in a fixed direction\n conf.hdctrlbits[13] = true; \/\/ Default, Always 1\n conf.hdctrlbits[14] = false; \/\/ Default, Always 0\n conf.hdctrlbits[15] = false; \/\/ Don´t ignore sensor\n\n \/\/ Head Type\n\n conf.sonartype = ImagingSonar;\n\n \/\/ Head Frequency\n\n conf.frequency = f675;\n\n \/\/ Range Scale\n\n conf.rangescale = 30;\n\n \/\/ Scan Limits\n\n conf.leftlim = 0;\n conf.rightlim = 0;\n\n \/\/ ADSpan and ADLow (in Db´s)\n\n conf.adspan = 12;\n conf.adlow = 13;\n\n \/\/ Initial Gain\n\n conf.gain = 40;\n\n \/\/ Resolution\n\n conf.resolution = Medium;\n\n \/\/ Number of Range Bins for each ping\n\n conf.bins = 300;\n}\n\nvoid MiniKing::initSonar(void) { \/\/ Basic initialization procedure\n\n while (receive(&cp) != mtAlive);\n\n mtsendversion.send(&cp);\n if (verbose) mtsendversion.printPacket(true);\n\n while (receive(&cp) != mtVersionData);\n\n vd.fr = mtversiondata.getFrequency();\n vd.bt = mtversiondata.getBoardType();\n vd.serialnumber = mtversiondata.getSerialNumber();\n vd.programlength = mtversiondata.getProgramLength();\n vd.checksum = mtversiondata.getChecksum();\n\n mtsendbbuser.send(&cp);\n if (verbose) mtsendversion.printPacket(true);\n\n while (receive(&cp) != mtBBUserData);\n\n while (receive(&cp) != mtAlive);\n\n while (!hasParams()) {\n\n mtheadcommand.send(&cp);\n if (verbose) mtheadcommand.printPacket(true);\n while (receive(&cp) != mtAlive);\n }\n}\n\nvoid MiniKing::reboot(void) { \/\/ Reboots sonar\n\n setDefaultConfig();\n\n mtreboot.send(&cp);\n if (verbose) mtreboot.printPacket(true);\n while (receive(&cp) != mtAlive);\n\n while (hasParams()) receive(&cp);\n\n while (!hasParams()) {\n\n mtheadcommand.send(&cp);\n if (verbose) mtheadcommand.printPacket(true);\n\n while (receive(&cp) != mtAlive);\n }\n}\n\nvoid MiniKing::updateConfig(void) { \/\/ Update sonar´s parametres\n\n do {\n\n mtheadcommand.send(&cp);\n if (verbose) mtheadcommand.printPacket(true);\n while (receive(&cp) != mtAlive);\n } while (!hasParams());\n}\n\nBYTE *MiniKing::getScanLine(void) { \/\/ Get a data scan\n\n if (needData) {\n\n mtsenddata.send(&cp);\n if (verbose) mtsenddata.printPacket(true);\n\n while (receive(&cp) != mtHeadData);\n\n allReceived = false;\n\n while (receive(&cp) != mtHeadData);\n\n allReceived = true;\n\n needData = false;\n\n return mtheaddata1.getDataBytes();\n }\n else {\n\n needData = true;\n\n return mtheaddata2.getDataBytes();\n }\n}\n\nvoid MiniKing::setVerboseMode(bool op) {\n\n verbose = op;\n}\n\nbool MiniKing::isLeftLimit(void) {\n\n if (needData) {\n\n if (mtheaddata1.getSweepCode() == ScanLeftLimit)\n return true;\n else\n return false;\n }\n else {\n\n if (mtheaddata2.getSweepCode() == ScanLeftLimit)\n return true;\n else\n return false;\n }\n}\n\nbool MiniKing::isRightLimit(void) {\n\n if (needData) {\n\n if (mtheaddata1.getSweepCode() == ScanRightLimit)\n return true;\n else\n return false;\n }\n else {\n\n if (mtheaddata2.getSweepCode() == ScanRightLimit)\n return true;\n else\n return false;\n }\n}\n\n\/\/ Waits for Initial Character\n\nBYTE synchronize(SerialPort *cport) {\n\n BYTE ch;\n\n try {\n\n while((ch = cport->read()) != '@');\n return ch;\n }\n catch (runtime_error &e) { \/\/ Error in timeouts or bytes\n cout << e.what() << endl;\n return false;\n }\n}\n\n\/\/ General receive\n\nPacketType MiniKing::receive(SerialPort *cport) {\n\n BYTE inchar = synchronize(cport);\n BYTE hdr;\n BYTE hexln[4];\n BYTE binln[2];\n BYTE sid;\n BYTE did;\n BYTE countmsg;\n BYTE ptype;\n BYTE sequence;\n BYTE node;\n\n if (!inchar) {\n cout << \"Can´t receive message\" << endl;\n }\n else if (inchar == '@') {\n try {\n\n \/\/ Header\n\n hdr = inchar;\n\n \/\/ Hex Length\n\n cport->read(hexln, 4);\n\n \/\/ Bin Length\n\n cport->read(binln, 2);\n\n \/\/ Source ID and Destination ID\n\n sid = cport->read();\n did = cport->read();\n\n \/\/ Count Message\n\n countmsg = cport->read();\n\n \/\/ Packet Type\n\n ptype = cport->read();\n\n \/\/ Sequence Number\n\n sequence = cport->read();\n\n \/\/ Copy of Byte 8\n\n node = cport->read();\n\n Message *msg = NULL;\n\n switch (ptype) {\n case mtAlive:\n msg = &mtalive;\n mtalive.receive(&cp);\n break;\n case mtBBUserData:\n msg = &mtbbuserdata;\n mtbbuserdata.receive(&cp);\n break;\n case mtVersionData:\n msg = &mtversiondata;\n mtversiondata.receive(&cp);\n break;\n case mtHeadData:\n if (allReceived) {\n msg = &mtheaddata1;\n mtheaddata1.receive(&cp);\n }\n else {\n msg = &mtheaddata2;\n mtheaddata2.receive(&cp);\n }\n break;\n default:\n break;\n }\n msg->hdr = inchar;\n for (int i = 0; i < 4; i++)\n msg->hexln[i] = hexln[i];\n for (int i = 0; i < 2; i++)\n msg->binln[i] = binln[i];\n msg->sid = sid;\n msg->did = did;\n msg->countmsg = countmsg;\n msg->ptype = ptype;\n msg->sequence = sequence;\n msg->node = node;\n if (verbose) msg->printPacket(true);\n return (PacketType)ptype;\n }\n catch (runtime_error &e) { \/\/ Error in timeouts or bytes\n cout << e.what() << endl;\n }\n }\n else {\n cout << \"Unknown error receiving message\" << endl;\n }\n return errorPacket;\n}\n<|endoftext|>"} {"text":"<commit_before>\n#include \"OsmLayer.h\"\n\n#include <stdio.h>\n\n\/\/ This is the total number of meters in the world -180. - 180 W,\n#define MAXLAT 85.0511287798066\n#define MAXLON 180.0\n\n\/\/ from http:\/\/wiki.openstreetmap.org\/wiki\/Slippy_map_tilenames\nint long2tilex(double lon, int z)\n{\n\treturn (int)(floor((lon + 180.0) \/ 360.0 * pow(2.0, z)));\n}\n\nint lat2tiley(double lat, int z)\n{\n\treturn (int)(floor((1.0 - log( tan(lat * M_PI\/180.0) + 1.0 \/\n cos(lat * M_PI\/180.0)) \/ M_PI) \/\n 2.0 * pow(2.0, z)));\n}\n\ndouble tilex2long(int x, int z)\n{\n\treturn x \/ pow(2.0, z) * 360.0 - 180;\n}\n\ndouble tiley2lat(int y, int z)\n{\n\tdouble n = M_PI - 2.0 * M_PI * y \/ pow(2.0, z);\n\treturn 180.0 \/ M_PI * atan(0.5 * (exp(n) - exp(-n)));\n}\n\nvoid _drawQuad(const MapPoint &upperLeft, const MapPoint &lowerRight)\n{\n gl::drawSolidRect(Rectf(upperLeft.x, upperLeft.y,\n lowerRight.x, lowerRight.y));\n}\n\nOsmLayer::OsmLayer() : Layer(),\n _tileSource(new OsmTileSource()),\n _worldSize(0.0),\n _tileSize(1.0),\n _currentZoom(0),\n _numEdgeTiles(1),\n _lastResolution(0.),\n _shader(new QGLShaderProgram),\n _isSetup(false)\n{\n connect(_tileSource, SIGNAL(tileReady(unsigned int, unsigned int, unsigned int)),\n SLOT(onTileReady(unsigned int, unsigned int, unsigned int)));\n}\n\nOsmLayer::~OsmLayer()\n{\n delete _shader;\n}\n\nQString\nOsmLayer::name() const\n{\n return QString(\"Open Street Map\");\n}\n\nQString\nOsmLayer::sport() const\n{\n return QString(\"map\");\n}\n\nQDateTime\nOsmLayer::startTime() const\n{\n return QDateTime();\n}\n\nPassMap\nOsmLayer::passes() const\n{\n PassMap layers;\n layers.insert(Pass_BaseMap);\n return layers;\n}\n\nvoid\nOsmLayer::project(const Projection &projection)\n{\n _worldTopLeft = projection.toProjection(LonLat(-MAXLON, MAXLAT));\n _worldLowerRight = projection.toProjection(LonLat(MAXLON, -MAXLAT));\n _worldSize = _worldTopLeft.y - _worldLowerRight.y;\n for (int i = 0; i < numZoomLevels; i++)\n _resolutions[i] = (_worldSize \/ (1 << i)) \/ pixelsPerTile;\n}\n\nvoid\nOsmLayer::draw(uint pass, const ViewCtx &viewCtx, const TimeCtx&)\n{\n if (pass != Pass_BaseMap)\n return;\n \n if (_lastResolution != viewCtx.getResolution()) {\n _lastResolution = viewCtx.getResolution();\n _currentZoom = _getZoomLevel(viewCtx.getResolution());\n _numEdgeTiles = pow(2., _currentZoom);\n _tileSize = _worldSize \/ _numEdgeTiles;\n }\n \n BoundingBox viewport = viewCtx.getBoundingBox();\n unsigned int upperLeftX, upperLeftY, lowerRightX, lowerRightY;\n _getTileXYAtMapPoint(viewport.upperLeft, &upperLeftX, &upperLeftY);\n _getTileXYAtMapPoint(viewport.lowerRight, &lowerRightX, &lowerRightY);\n \n if (!_isSetup)\n _setup();\n\n OsmIndexSet visibleTiles;\n for (unsigned int x = upperLeftX; x <= lowerRightX && x < _numEdgeTiles; x++) {\n for (unsigned int y=upperLeftY; y <= lowerRightY && y < _numEdgeTiles; y++)\n {\n OsmIndex idx(x, y, _currentZoom);\n visibleTiles.insert(idx);\n TileMap::iterator foundTile = _tiles.find(idx);\n if (foundTile == _tiles.end()) {\n Tile *newTile = new Tile();\n newTile->shader = _shader;\n newTile->index = idx;\n newTile->upperLeft.x = _worldTopLeft.x +\n (_worldSize * ((double)x \/ (double)_numEdgeTiles));\n newTile->upperLeft.y = _worldTopLeft.y -\n (_worldSize * ((double)y \/ (double)_numEdgeTiles));\n newTile->lowerRight.x = newTile->upperLeft.x + _tileSize;\n newTile->lowerRight.y = newTile->upperLeft.y - _tileSize;\n _tiles.insert(std::pair<OsmIndex, Tile*>(idx, newTile));\n _tileSource->getTile(idx.x, idx.y, idx.z);\n newTile->draw();\n } else {\n foundTile->second->draw();\n }\n }\n }\n \n \/\/ clean up tiles we no longer display\n for (TileMap::iterator i=_tiles.begin(); i != _tiles.end(); i++) {\n if (visibleTiles.find(i->first) == visibleTiles.end()) {\n delete i->second;\n _tiles.erase(i);\n }\n }\n}\n\nBoundingBox\nOsmLayer::getBoundingBox() const\n{\n return BoundingBox();\n}\n\nMapPoint\nOsmLayer::position() const\n{\n return MapPoint(0., 0.);\n}\n\nvoid\nOsmLayer::onTileReady(unsigned int x, unsigned int y, unsigned int z)\n{\n OsmIndex idx = OsmIndex(x, y, z);\n TileMap::iterator i = _tiles.find(idx);\n if (i != _tiles.end()) {\n i->second->setTexture(_tileSource->retrieveFinishedTile(x, y, z));\n emit layerUpdated();\n }\n}\n\nOsmLayer::Tile::Tile() : texture(NULL), shader(NULL)\n{\n \n}\n\nvoid\nOsmLayer::Tile::draw()\n{\n \/\/ debug, draw diagonal lines\n gl::color( Color( 1, 1, 1 ) );\n gl::drawLine(upperLeft, lowerRight);\n gl::drawLine(Vec2f(upperLeft.x, lowerRight.y),\n Vec2f(lowerRight.x, upperLeft.y));\n \/\/ end debug diagonal lines\n if (texture != NULL) {\n texture->enableAndBind();\n shader->bind();\n shader->setUniformValue(shader->uniformLocation(\"tex0\"), 0 );\n _drawQuad(upperLeft, lowerRight);\n texture->unbind();\n shader->release();\n }\n}\n\nvoid\nOsmLayer::Tile::setTexture(const Surface8u &surface)\n{\n texture = new cinder::gl::Texture(surface);\n}\n\nuint\nOsmLayer::_getZoomLevel(double resolution) const\n{\n uint i;\n for (i = 0; i < numZoomLevels && resolution < _resolutions[i]; i++) {}\n return i;\n}\n\nvoid\nOsmLayer::_setup()\n{\n _shader->addShaderFromSourceCode(QGLShader::Fragment,\n \"#version 110\\n\\n\"\n \"uniform sampler2D tex0;\\n\"\n \"void main()\\n\"\n \"{\\n\"\n \"gl_FragColor = texture2D( tex0, gl_TexCoord[0].st);\\n\"\n \"}\\n\");\n _isSetup = true;\n}\n\n\nvoid\nOsmLayer::_getTileXYAtMapPoint(const MapPoint &pos,\n unsigned int *x,\n unsigned int *y) const\n{\n int px, py;\n px = int(floor(_numEdgeTiles * ((pos.x - _worldTopLeft.x) \/ _worldSize)));\n py = int(floor(_numEdgeTiles * (_worldTopLeft.y - pos.y) \/ _worldSize));\n *x = (px < 0) ? 0 : px;\n *y = (py < 0) ? 0 : py;\n}\n\n<commit_msg>Don’t iterate to an invalidated iterator after erasing.<commit_after>\n#include \"OsmLayer.h\"\n\n#include <stdio.h>\n\n\/\/ This is the total number of meters in the world -180. - 180 W,\n#define MAXLAT 85.0511287798066\n#define MAXLON 180.0\n\n\/\/ from http:\/\/wiki.openstreetmap.org\/wiki\/Slippy_map_tilenames\nint long2tilex(double lon, int z)\n{\n\treturn (int)(floor((lon + 180.0) \/ 360.0 * pow(2.0, z)));\n}\n\nint lat2tiley(double lat, int z)\n{\n\treturn (int)(floor((1.0 - log( tan(lat * M_PI\/180.0) + 1.0 \/\n cos(lat * M_PI\/180.0)) \/ M_PI) \/\n 2.0 * pow(2.0, z)));\n}\n\ndouble tilex2long(int x, int z)\n{\n\treturn x \/ pow(2.0, z) * 360.0 - 180;\n}\n\ndouble tiley2lat(int y, int z)\n{\n\tdouble n = M_PI - 2.0 * M_PI * y \/ pow(2.0, z);\n\treturn 180.0 \/ M_PI * atan(0.5 * (exp(n) - exp(-n)));\n}\n\nvoid _drawQuad(const MapPoint &upperLeft, const MapPoint &lowerRight)\n{\n gl::drawSolidRect(Rectf(upperLeft.x, upperLeft.y,\n lowerRight.x, lowerRight.y));\n}\n\nOsmLayer::OsmLayer() : Layer(),\n _tileSource(new OsmTileSource()),\n _worldSize(0.0),\n _tileSize(1.0),\n _currentZoom(0),\n _numEdgeTiles(1),\n _lastResolution(0.),\n _shader(new QGLShaderProgram),\n _isSetup(false)\n{\n connect(_tileSource, SIGNAL(tileReady(unsigned int, unsigned int, unsigned int)),\n SLOT(onTileReady(unsigned int, unsigned int, unsigned int)));\n}\n\nOsmLayer::~OsmLayer()\n{\n delete _shader;\n}\n\nQString\nOsmLayer::name() const\n{\n return QString(\"Open Street Map\");\n}\n\nQString\nOsmLayer::sport() const\n{\n return QString(\"map\");\n}\n\nQDateTime\nOsmLayer::startTime() const\n{\n return QDateTime();\n}\n\nPassMap\nOsmLayer::passes() const\n{\n PassMap layers;\n layers.insert(Pass_BaseMap);\n return layers;\n}\n\nvoid\nOsmLayer::project(const Projection &projection)\n{\n _worldTopLeft = projection.toProjection(LonLat(-MAXLON, MAXLAT));\n _worldLowerRight = projection.toProjection(LonLat(MAXLON, -MAXLAT));\n _worldSize = _worldTopLeft.y - _worldLowerRight.y;\n for (int i = 0; i < numZoomLevels; i++)\n _resolutions[i] = (_worldSize \/ (1 << i)) \/ pixelsPerTile;\n}\n\nvoid\nOsmLayer::draw(uint pass, const ViewCtx &viewCtx, const TimeCtx&)\n{\n if (pass != Pass_BaseMap)\n return;\n \n if (_lastResolution != viewCtx.getResolution()) {\n _lastResolution = viewCtx.getResolution();\n _currentZoom = _getZoomLevel(viewCtx.getResolution());\n _numEdgeTiles = pow(2., _currentZoom);\n _tileSize = _worldSize \/ _numEdgeTiles;\n }\n \n BoundingBox viewport = viewCtx.getBoundingBox();\n unsigned int upperLeftX, upperLeftY, lowerRightX, lowerRightY;\n _getTileXYAtMapPoint(viewport.upperLeft, &upperLeftX, &upperLeftY);\n _getTileXYAtMapPoint(viewport.lowerRight, &lowerRightX, &lowerRightY);\n \n if (!_isSetup)\n _setup();\n\n OsmIndexSet visibleTiles;\n for (unsigned int x = upperLeftX; x <= lowerRightX && x < _numEdgeTiles; x++) {\n for (unsigned int y=upperLeftY; y <= lowerRightY && y < _numEdgeTiles; y++)\n {\n OsmIndex idx(x, y, _currentZoom);\n visibleTiles.insert(idx);\n TileMap::iterator foundTile = _tiles.find(idx);\n if (foundTile == _tiles.end()) {\n Tile *newTile = new Tile();\n newTile->shader = _shader;\n newTile->index = idx;\n newTile->upperLeft.x = _worldTopLeft.x +\n (_worldSize * ((double)x \/ (double)_numEdgeTiles));\n newTile->upperLeft.y = _worldTopLeft.y -\n (_worldSize * ((double)y \/ (double)_numEdgeTiles));\n newTile->lowerRight.x = newTile->upperLeft.x + _tileSize;\n newTile->lowerRight.y = newTile->upperLeft.y - _tileSize;\n _tiles.insert(std::pair<OsmIndex, Tile*>(idx, newTile));\n _tileSource->getTile(idx.x, idx.y, idx.z);\n newTile->draw();\n } else {\n foundTile->second->draw();\n }\n }\n }\n \n \/\/ clean up tiles we no longer display\n for (TileMap::iterator i=_tiles.begin(); i != _tiles.end();) {\n if (visibleTiles.find(i->first) == visibleTiles.end()) {\n delete i->second;\n i = _tiles.erase(i);\n } else {\n ++i;\n }\n }\n}\n\nBoundingBox\nOsmLayer::getBoundingBox() const\n{\n return BoundingBox();\n}\n\nMapPoint\nOsmLayer::position() const\n{\n return MapPoint(0., 0.);\n}\n\nvoid\nOsmLayer::onTileReady(unsigned int x, unsigned int y, unsigned int z)\n{\n OsmIndex idx = OsmIndex(x, y, z);\n TileMap::iterator i = _tiles.find(idx);\n if (i != _tiles.end()) {\n i->second->setTexture(_tileSource->retrieveFinishedTile(x, y, z));\n emit layerUpdated();\n }\n}\n\nOsmLayer::Tile::Tile() : texture(NULL), shader(NULL)\n{\n \n}\n\nvoid\nOsmLayer::Tile::draw()\n{\n \/\/ debug, draw diagonal lines\n gl::color( Color( 1, 1, 1 ) );\n gl::drawLine(upperLeft, lowerRight);\n gl::drawLine(Vec2f(upperLeft.x, lowerRight.y),\n Vec2f(lowerRight.x, upperLeft.y));\n \/\/ end debug diagonal lines\n if (texture != NULL) {\n texture->enableAndBind();\n shader->bind();\n shader->setUniformValue(shader->uniformLocation(\"tex0\"), 0 );\n _drawQuad(upperLeft, lowerRight);\n texture->unbind();\n shader->release();\n }\n}\n\nvoid\nOsmLayer::Tile::setTexture(const Surface8u &surface)\n{\n texture = new cinder::gl::Texture(surface);\n}\n\nuint\nOsmLayer::_getZoomLevel(double resolution) const\n{\n uint i;\n for (i = 0; i < numZoomLevels && resolution < _resolutions[i]; i++) {}\n return i;\n}\n\nvoid\nOsmLayer::_setup()\n{\n _shader->addShaderFromSourceCode(QGLShader::Fragment,\n \"#version 110\\n\\n\"\n \"uniform sampler2D tex0;\\n\"\n \"void main()\\n\"\n \"{\\n\"\n \"gl_FragColor = texture2D( tex0, gl_TexCoord[0].st);\\n\"\n \"}\\n\");\n _isSetup = true;\n}\n\n\nvoid\nOsmLayer::_getTileXYAtMapPoint(const MapPoint &pos,\n unsigned int *x,\n unsigned int *y) const\n{\n int px, py;\n px = int(floor(_numEdgeTiles * ((pos.x - _worldTopLeft.x) \/ _worldSize)));\n py = int(floor(_numEdgeTiles * (_worldTopLeft.y - pos.y) \/ _worldSize));\n *x = (px < 0) ? 0 : px;\n *y = (py < 0) ? 0 : py;\n}\n\n<|endoftext|>"} {"text":"<commit_before>\n#include <avr\/interrupt.h>\n#include \"HalfDuplexHardwareSerial.h\"\n\n#define USART_PORT PORTD\n#define USART_DDR DDRD\n#define USART_PIN PIND\n#define USART_RX_PIN PD0\n#define USART_TX_PIN PD1\n\n#define USART0_PORT PORTD\n#define USART0_DDR DDRD\n#define USART0_PIN PIND\n#define USART0_RX_PIN PD0\n#define USART0_TX_PIN PD1\n\n#define USART1_PORT PORTD\n#define USART1_DDR DDRD\n#define USART1_PIN PIND\n#define USART1_RX_PIN PD2\n#define USART1_TX_PIN PD3\n\n#define USART_N_PORT(usart) USART ## usart ## _PORT \n#define USART_N_DDR(usart) USART ## usart ## _DDR \n#define USART_N_PIN(usart) USART ## usart ## _PIN\n#define USART_N_RX_PIN(usart) USART## usart ## _RX_PIN\n#define USART_N_TX_PIN(usart) USART## usart ## _TX_PIN\n\n#define USART_ENABLE_RX() \\\n UCSRA &= ~(_BV(FE) | _BV(DOR) | _BV(UPE); \\\n UCSRB |= _BV(RXEN);\n\n#define USART_N_ENABLE_RX(usart) \\\n UCSR ## usart ## A &= ~(_BV(FE ## usart) | _BV(DOR ## usart) | _BV(UPE ## usart)); \\\n UCSR ## usart ## B |= _BV(RXEN ## usart);\n\n#define USART_DISABLE_RX() \\\n UCSRB &= ~_BV(RXEN); \\\n USART_DDR &= ~_BV(USART_RX_PIN()); \\\n USART_PORT &= ~_BV(USART_RX_PIN());\n\n#define USART_N_DISABLE_RX(usart) \\\n UCSR ## usart ## B &= ~_BV(RXEN ## usart); \\\n USART ## usart ## _DDR &= ~_BV(USART ## usart ## _RX_PIN); \\\n USART ## usart ## _PORT &= ~_BV(USART ## usart ## _RX_PIN);\n\n#define USART_ENABLE_TX() \\\n USART_DDR |= _BV(USART_TX_PIN); \\\n USART_PORT |= _BV(USART_TX_PIN); \\\n UCSRB |= _BV(TXEN);\n\n#define USART_N_ENABLE_TX(usart) \\\n USART ## usart ## _DDR |= _BV(USART ## usart ## _TX_PIN); \\\n USART ## usart ## _PORT |= _BV(USART ## usart ## _TX_PIN); \\\n UCSR ## usart ## B |= _BV(TXEN ## usart);\n\n#define USART_N_DISABLE_TX(usart) \\\n cli(); \\\n while ((UCSRA & _BV(TXC)) == 0); \\\n UCSRA &= ~(_BV(FE) | _BV(DOR) | _BV(UPE); \\\n UCSRB &= ~_BV(TXEN); \\\n USART_DDR &= ~_BV(USART_TX_PIN); \\\n USART_PORT &= ~_BV(USART_TX_PIN); \\\n sei();\n\n#define USART_N_DISABLE_TX(usart) \\\n cli(); \\\n while ((UCSR ## usart ## A & _BV(TXC ## usart)) == 0); \\\n UCSR ## usart ## A &= ~(_BV(FE ## usart) | _BV(DOR ## usart) | _BV(UPE ## usart)); \\\n UCSR ## usart ## B &= ~_BV(TXEN ## usart); \\\n USART_N_DDR(usart) &= ~_BV(USART_N_TX_PIN(usart)); \\\n USART_N_PORT(usart) &= ~_BV(USART_N_TX_PIN(usart)); \\\n sei();\n\nvoid HalfDuplexHardwareSerial::begin(unsigned long baud) { \n mSerial.begin(baud);\n setDirection(kReceiveOnly);\n}\n\nvoid HalfDuplexHardwareSerial::begin(unsigned long baud, uint8_t config) {\n mSerial.begin(baud,config);\n setDirection(kReceiveOnly);\n}\n\nsize_t HalfDuplexHardwareSerial::writeLast(uint8_t b) {\n size_t sent;\n cli();\n sent = mSerial.write(b);\n setDirection(kReceiveOnly);\n sei();\n}\n\nvoid HalfDuplexHardwareSerial::setDirection(Direction direction) {\n if (direction == mDirection) {\n return;\n }\n else if (direction == kTransmitOnly) {\n disableRx();\n enableTx();\n }\n else {\n disableTx();\n enableRx();\n }\n mDirection = direction;\n}\n\nvoid HalfDuplexHardwareSerial::enableRx() {\n if (false) {}\n#ifdef HAVE_HWSERIAL0\n else if (&mSerial == &Serial) {\n#if defined(UBRRH) && defined(UBRRL)\n USART_ENABLE_RX()\n#else\n USART_N_ENABLE_RX(0)\n#endif\n }\n#endif\n#ifdef HAVE_HWSERIAL1\n else if (&mSerial == &Serial1) {\n USART_N_ENABLE_RX(1)\n \n }\n#endif\n#ifdef HAVE_HWSERIAL2\n else if (&mSerial == &Serial2) {\n USART_N_ENABLE_RX(2)\n \n }\n#endif\n#ifdef HAVE_HWSERIAL3\n else if (&mSerial == &Serial3) {\n USART_N_ENABLE_RX(3)\n }\n#endif\n}\n\nvoid HalfDuplexHardwareSerial::disableRx() {\n if (false) {}\n#ifdef HAVE_HWSERIAL0\n else if (&mSerial == &Serial) {\n#if defined(UBRRH) && defined(UBRRL)\n USART_DISABLE_RX()\n#else\n USART_N_DISABLE_RX(0)\n#endif\n }\n#endif\n#ifdef HAVE_HWSERIAL1\n else if (&mSerial == &Serial1) {\n USART_N_DISABLE_RX(1)\n }\n#endif\n#ifdef HAVE_HWSERIAL2\n else if (&mSerial == &Serial2) {\n USART_N_DISABLE_RX(2)\n }\n#endif\n#ifdef HAVE_HWSERIAL3\n else if (&mSerial == &Serial3) {\n USART_N_DISABLE_RX(3)\n }\n#endif\n}\n\nvoid HalfDuplexHardwareSerial::enableTx() {\n if (false) {}\n#ifdef HAVE_HWSERIAL0\n else if (&mSerial == &Serial) {\n#if defined(UBRRH) && defined(UBRRL)\n USART_ENABLE_TX()\n#else\n USART_N_ENABLE_TX(0)\n#endif\n }\n#endif\n#ifdef HAVE_HWSERIAL1\n else if (&mSerial == &Serial1) {\n USART_N_ENABLE_TX(1)\n \n }\n#endif\n#ifdef HAVE_HWSERIAL2\n else if (&mSerial == &Serial2) {\n USART_N_ENABLE_TX(2)\n \n }\n#endif\n#ifdef HAVE_HWSERIAL3\n else if (&mSerial == &Serial3) {\n USART_N_ENABLE_TX(3)\n }\n#endif\n}\n\nvoid HalfDuplexHardwareSerial::disableTx() {\n if (false) {}\n#ifdef HAVE_HWSERIAL0\n else if (&mSerial == &Serial) {\n#if defined(UBRRH) && defined(UBRRL)\n USART_DISABLE_TX()\n#else\n USART_N_DISABLE_TX(0)\n#endif\n }\n#endif\n#ifdef HAVE_HWSERIAL1\n else if (&mSerial == &Serial1) {\n USART_N_DISABLE_TX(1)\n }\n#endif\n#ifdef HAVE_HWSERIAL2\n else if (&mSerial == &Serial2) {\n USART_N_DISABLE_TX(2)\n }\n#endif\n#ifdef HAVE_HWSERIAL3\n else if (&mSerial == &Serial3) {\n USART_N_DISABLE_TX(3)\n }\n#endif\n}\n\n\n<commit_msg>Change incorrectly named USART disable Tx macro.<commit_after>\n#include <avr\/interrupt.h>\n#include \"HalfDuplexHardwareSerial.h\"\n\n#define USART_PORT PORTD\n#define USART_DDR DDRD\n#define USART_PIN PIND\n#define USART_RX_PIN PD0\n#define USART_TX_PIN PD1\n\n#define USART0_PORT PORTD\n#define USART0_DDR DDRD\n#define USART0_PIN PIND\n#define USART0_RX_PIN PD0\n#define USART0_TX_PIN PD1\n\n#define USART1_PORT PORTD\n#define USART1_DDR DDRD\n#define USART1_PIN PIND\n#define USART1_RX_PIN PD2\n#define USART1_TX_PIN PD3\n\n#define USART_N_PORT(usart) USART ## usart ## _PORT \n#define USART_N_DDR(usart) USART ## usart ## _DDR \n#define USART_N_PIN(usart) USART ## usart ## _PIN\n#define USART_N_RX_PIN(usart) USART## usart ## _RX_PIN\n#define USART_N_TX_PIN(usart) USART## usart ## _TX_PIN\n\n#define USART_ENABLE_RX() \\\n UCSRA &= ~(_BV(FE) | _BV(DOR) | _BV(UPE); \\\n UCSRB |= _BV(RXEN);\n\n#define USART_N_ENABLE_RX(usart) \\\n UCSR ## usart ## A &= ~(_BV(FE ## usart) | _BV(DOR ## usart) | _BV(UPE ## usart)); \\\n UCSR ## usart ## B |= _BV(RXEN ## usart);\n\n#define USART_DISABLE_RX() \\\n UCSRB &= ~_BV(RXEN); \\\n USART_DDR &= ~_BV(USART_RX_PIN()); \\\n USART_PORT &= ~_BV(USART_RX_PIN());\n\n#define USART_N_DISABLE_RX(usart) \\\n UCSR ## usart ## B &= ~_BV(RXEN ## usart); \\\n USART ## usart ## _DDR &= ~_BV(USART ## usart ## _RX_PIN); \\\n USART ## usart ## _PORT &= ~_BV(USART ## usart ## _RX_PIN);\n\n#define USART_ENABLE_TX() \\\n USART_DDR |= _BV(USART_TX_PIN); \\\n USART_PORT |= _BV(USART_TX_PIN); \\\n UCSRB |= _BV(TXEN);\n\n#define USART_N_ENABLE_TX(usart) \\\n USART ## usart ## _DDR |= _BV(USART ## usart ## _TX_PIN); \\\n USART ## usart ## _PORT |= _BV(USART ## usart ## _TX_PIN); \\\n UCSR ## usart ## B |= _BV(TXEN ## usart);\n\n#define USART_DISABLE_TX(usart) \\\n cli(); \\\n while ((UCSRA & _BV(TXC)) == 0); \\\n UCSRA &= ~(_BV(FE) | _BV(DOR) | _BV(UPE); \\\n UCSRB &= ~_BV(TXEN); \\\n USART_DDR &= ~_BV(USART_TX_PIN); \\\n USART_PORT &= ~_BV(USART_TX_PIN); \\\n sei();\n\n#define USART_N_DISABLE_TX(usart) \\\n cli(); \\\n while ((UCSR ## usart ## A & _BV(TXC ## usart)) == 0); \\\n UCSR ## usart ## A &= ~(_BV(FE ## usart) | _BV(DOR ## usart) | _BV(UPE ## usart)); \\\n UCSR ## usart ## B &= ~_BV(TXEN ## usart); \\\n USART_N_DDR(usart) &= ~_BV(USART_N_TX_PIN(usart)); \\\n USART_N_PORT(usart) &= ~_BV(USART_N_TX_PIN(usart)); \\\n sei();\n\nvoid HalfDuplexHardwareSerial::begin(unsigned long baud) { \n mSerial.begin(baud);\n setDirection(kReceiveOnly);\n}\n\nvoid HalfDuplexHardwareSerial::begin(unsigned long baud, uint8_t config) {\n mSerial.begin(baud,config);\n setDirection(kReceiveOnly);\n}\n\nsize_t HalfDuplexHardwareSerial::writeLast(uint8_t b) {\n size_t sent;\n cli();\n sent = mSerial.write(b);\n setDirection(kReceiveOnly);\n sei();\n}\n\nvoid HalfDuplexHardwareSerial::setDirection(Direction direction) {\n if (direction == mDirection) {\n return;\n }\n else if (direction == kTransmitOnly) {\n disableRx();\n enableTx();\n }\n else {\n disableTx();\n enableRx();\n }\n mDirection = direction;\n}\n\nvoid HalfDuplexHardwareSerial::enableRx() {\n if (false) {}\n#ifdef HAVE_HWSERIAL0\n else if (&mSerial == &Serial) {\n#if defined(UBRRH) && defined(UBRRL)\n USART_ENABLE_RX()\n#else\n USART_N_ENABLE_RX(0)\n#endif\n }\n#endif\n#ifdef HAVE_HWSERIAL1\n else if (&mSerial == &Serial1) {\n USART_N_ENABLE_RX(1)\n \n }\n#endif\n#ifdef HAVE_HWSERIAL2\n else if (&mSerial == &Serial2) {\n USART_N_ENABLE_RX(2)\n \n }\n#endif\n#ifdef HAVE_HWSERIAL3\n else if (&mSerial == &Serial3) {\n USART_N_ENABLE_RX(3)\n }\n#endif\n}\n\nvoid HalfDuplexHardwareSerial::disableRx() {\n if (false) {}\n#ifdef HAVE_HWSERIAL0\n else if (&mSerial == &Serial) {\n#if defined(UBRRH) && defined(UBRRL)\n USART_DISABLE_RX()\n#else\n USART_N_DISABLE_RX(0)\n#endif\n }\n#endif\n#ifdef HAVE_HWSERIAL1\n else if (&mSerial == &Serial1) {\n USART_N_DISABLE_RX(1)\n }\n#endif\n#ifdef HAVE_HWSERIAL2\n else if (&mSerial == &Serial2) {\n USART_N_DISABLE_RX(2)\n }\n#endif\n#ifdef HAVE_HWSERIAL3\n else if (&mSerial == &Serial3) {\n USART_N_DISABLE_RX(3)\n }\n#endif\n}\n\nvoid HalfDuplexHardwareSerial::enableTx() {\n if (false) {}\n#ifdef HAVE_HWSERIAL0\n else if (&mSerial == &Serial) {\n#if defined(UBRRH) && defined(UBRRL)\n USART_ENABLE_TX()\n#else\n USART_N_ENABLE_TX(0)\n#endif\n }\n#endif\n#ifdef HAVE_HWSERIAL1\n else if (&mSerial == &Serial1) {\n USART_N_ENABLE_TX(1)\n \n }\n#endif\n#ifdef HAVE_HWSERIAL2\n else if (&mSerial == &Serial2) {\n USART_N_ENABLE_TX(2)\n \n }\n#endif\n#ifdef HAVE_HWSERIAL3\n else if (&mSerial == &Serial3) {\n USART_N_ENABLE_TX(3)\n }\n#endif\n}\n\nvoid HalfDuplexHardwareSerial::disableTx() {\n if (false) {}\n#ifdef HAVE_HWSERIAL0\n else if (&mSerial == &Serial) {\n#if defined(UBRRH) && defined(UBRRL)\n USART_DISABLE_TX()\n#else\n USART_N_DISABLE_TX(0)\n#endif\n }\n#endif\n#ifdef HAVE_HWSERIAL1\n else if (&mSerial == &Serial1) {\n USART_N_DISABLE_TX(1)\n }\n#endif\n#ifdef HAVE_HWSERIAL2\n else if (&mSerial == &Serial2) {\n USART_N_DISABLE_TX(2)\n }\n#endif\n#ifdef HAVE_HWSERIAL3\n else if (&mSerial == &Serial3) {\n USART_N_DISABLE_TX(3)\n }\n#endif\n}\n\n\n<|endoftext|>"} {"text":"<commit_before>\/***************************************************************************\n**\n** Copyright (C) 2010, 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 \"mscenelayereffectdimview.h\"\n\n#include \"mscenewindowview_p.h\"\n#include \"mviewcreator.h\"\n#include \"mscenelayereffect.h\"\n#include \"mscenelayereffectmodel.h\"\n#include <mdeviceprofile.h>\n#include \"mscenemanager.h\"\n\n\/\/! \\internal\nclass MSceneLayerEffectDimViewPrivate : public MSceneWindowViewPrivate\n{\npublic:\n MSceneLayerEffect *controller;\n};\n\/\/! \\internal_end\n\nMSceneLayerEffectDimView::MSceneLayerEffectDimView(MSceneLayerEffect *controller) :\n MSceneWindowView(*new MSceneLayerEffectDimViewPrivate, controller)\n{\n Q_D(MSceneLayerEffectDimView);\n d->controller = controller;\n\n d->controller->setFlag(QGraphicsItem::ItemDoesntPropagateOpacityToChildren, true);\n}\n\nMSceneLayerEffectDimView::~MSceneLayerEffectDimView()\n{\n}\n\nvoid MSceneLayerEffectDimView::paint(QPainter *painter, const QStyleOptionGraphicsItem *option, QWidget *widget)\n{\n Q_D(MSceneLayerEffectDimView);\n Q_UNUSED(widget);\n Q_UNUSED(option);\n\n qreal oldOpacity = painter->opacity();\n qreal opacity = d_ptr->controller->effectiveOpacity() * style()->opacity();\n\n QTransform oldTransform = painter->transform();\n QTransform transform;\n M::Orientation layerEffectOrientation = M::Landscape;\n\n QRectF geometry = d->controller->geometry();\n if (geometry.height() > geometry.width()) {\n layerEffectOrientation = M::Portrait;\n }\n\n if (layerEffectOrientation != MDeviceProfile::instance()->orientationFromAngle(M::Angle0)) {\n \/\/ layer effect's orientation is different than display's native orientation.\n \/\/ Therefore we have to place our layer effect sideways.\n transform.translate(0, geometry.width());\n transform.rotate(-90);\n }\n\n painter->setTransform(transform);\n painter->setOpacity(opacity);\n painter->fillRect(boundingRect(), QColor(0, 0, 0));\n painter->setOpacity(oldOpacity);\n\n painter->setTransform(oldTransform);\n}\n\nQRectF MSceneLayerEffectDimView::boundingRect() const\n{\n Q_D(const MSceneLayerEffectDimView);\n return QRectF(QPointF(0, 0), d->controller->size());\n}\n\nvoid MSceneLayerEffectDimView::applyStyle()\n{\n MSceneWindowView::applyStyle();\n}\n\nM_REGISTER_VIEW_NEW(MSceneLayerEffectDimView, MSceneLayerEffect)\n<commit_msg>Changes: MSceneLayerEffectDimView - use backgroundImage if available<commit_after>\/***************************************************************************\n**\n** Copyright (C) 2010, 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 \"mscenelayereffectdimview.h\"\n\n#include \"mscenewindowview_p.h\"\n#include \"mviewcreator.h\"\n#include \"mscenelayereffect.h\"\n#include \"mscenelayereffectmodel.h\"\n#include <mdeviceprofile.h>\n#include \"mscenemanager.h\"\n#include <mscalableimage.h>\n\n\/\/! \\internal\nclass MSceneLayerEffectDimViewPrivate : public MSceneWindowViewPrivate\n{\npublic:\n MSceneLayerEffect *controller;\n};\n\/\/! \\internal_end\n\nMSceneLayerEffectDimView::MSceneLayerEffectDimView(MSceneLayerEffect *controller) :\n MSceneWindowView(*new MSceneLayerEffectDimViewPrivate, controller)\n{\n Q_D(MSceneLayerEffectDimView);\n d->controller = controller;\n\n d->controller->setFlag(QGraphicsItem::ItemDoesntPropagateOpacityToChildren, true);\n}\n\nMSceneLayerEffectDimView::~MSceneLayerEffectDimView()\n{\n}\n\nvoid MSceneLayerEffectDimView::paint(QPainter *painter, const QStyleOptionGraphicsItem *option, QWidget *widget)\n{\n Q_D(MSceneLayerEffectDimView);\n Q_UNUSED(widget);\n Q_UNUSED(option);\n\n qreal oldOpacity = painter->opacity();\n qreal opacity = d_ptr->controller->effectiveOpacity() * style()->opacity();\n\n QTransform oldTransform = painter->transform();\n QTransform transform;\n M::Orientation layerEffectOrientation = M::Landscape;\n\n QRectF geometry = d->controller->geometry();\n if (geometry.height() > geometry.width()) {\n layerEffectOrientation = M::Portrait;\n }\n\n if (layerEffectOrientation != MDeviceProfile::instance()->orientationFromAngle(M::Angle0)) {\n \/\/ layer effect's orientation is different than display's native orientation.\n \/\/ Therefore we have to place our layer effect sideways.\n transform.translate(0, geometry.width());\n transform.rotate(-90);\n }\n\n painter->setTransform(transform);\n painter->setOpacity(opacity);\n\n if(style()->backgroundImage()) {\n style()->backgroundImage()->draw(boundingRect(), painter);\n } else {\n painter->fillRect(boundingRect(), QColor(0, 0, 0));\n }\n\n painter->setOpacity(oldOpacity);\n\n painter->setTransform(oldTransform);\n}\n\nQRectF MSceneLayerEffectDimView::boundingRect() const\n{\n Q_D(const MSceneLayerEffectDimView);\n return QRectF(QPointF(0, 0), d->controller->size());\n}\n\nvoid MSceneLayerEffectDimView::applyStyle()\n{\n MSceneWindowView::applyStyle();\n}\n\nM_REGISTER_VIEW_NEW(MSceneLayerEffectDimView, MSceneLayerEffect)\n<|endoftext|>"} {"text":"<commit_before>#include <iostream> \/\/cout\r\n#include <cstdlib>\t\/\/rand, sran\r\n#include <string>\r\n#include \"complex_matrices.h\"\r\n#include <gmc.h> \t\/\/LaGenMatComplex\r\n#include <laslv.h> \/\/LUFactorizeIP, LaLUInverseIP, etc.\r\n#include <blas3pp.h>\r\n\r\nusing namespace std;\r\n\r\n\/* Total [13\/20] *\/\r\n\r\n\/* Printing [6\/9] *\/\r\nvoid print_scalar(const COMPLEX scalar){\r\n cout << scalar << endl;\r\n} \/\/working\r\nvoid print_scalar(const COMPLEX scalar, const string name){\r\n cout << name << \":\" << scalar << endl;\r\n} \/\/working\r\nvoid print_array(const COMPLEX array[], int len){\r\n for(int i = 0; i < len; i++){\r\n cout << array[i] << endl;\r\n }\r\n} \/\/working\r\nvoid print_array(const COMPLEX array[], int len, const string name){\r\n\tcout << name << \":\" << endl;\r\n for(int i = 0; i < len; i++){\r\n cout << array[i] << endl;\r\n }\r\n} \/\/working\r\nvoid print_matrix(const LaGenMatComplex& matrix){\r\n\tcout << matrix << endl;\r\n} \/\/working\r\nvoid print_matrix(const LaGenMatComplex& matrix, const string name){\r\n\tcout << name << \":\" << endl << matrix << endl;\r\n}\t\t\t \/\/working\r\n\r\n\/* Number generation [2\/2] *\/\r\nvoid generate_scalar(COMPLEX& A, const int x){\r\n A.r = rand() % x;\t\/\/1 to x\r\n A.i = rand() % x;\r\n} \/\/working\r\nvoid generate_scalar(int A, const int x){\r\n A = rand() % x;\t\/\/1 to x\r\n} \/\/working\r\nvoid generate_array(COMPLEX array[], const int len, const int x){\r\n\tsrand(time(NULL));\t\t\t\t\/\/seed\r\n for(int i = 0; i < len; i++){\r\n array[i].r = rand() % x;\t\/\/1 to x\r\n array[i].i = rand() % x;\r\n\t}\r\n} \/\/working\r\n\r\n\/* Matrix conversion [3\/3] *\/\r\nvoid vec_to_array(const LaVectorComplex& vector, const int len, COMPLEX array[ ]){\r\n for(int i = 0; i < len; i++){\r\n array[i] = vector(i);\r\n }\r\n} \/\/working\r\nvoid array_to_diag(COMPLEX array[], const int len, LaGenMatComplex& diag){\r\n diag = 0;\r\n for(int i = 0; i < len; i++){\r\n diag(i, i) = array[i];\r\n }\r\n} \/\/working\r\nvoid vec_to_diag(const LaVectorComplex& vector, const int len, LaGenMatComplex& diag){\r\n COMPLEX array[len];\r\n vec_to_array(vector, len, array);\r\n array_to_diag(array, len, diag);\r\n} \/\/working\r\n\r\n\/* Scalar manipulation [5\/8] *\/\r\nint factorial(int x){\r\n\tif(x <= 1){\r\n return 1;\r\n\t}else{\r\n return x * factorial(x - 1);\r\n\t}\r\n} \/\/working\r\nvoid scalar_addition(const COMPLEX& A, const COMPLEX& B , COMPLEX& result){\r\n result.r = A.r + B.r;\r\n result.i = A.i + B.i;\r\n} \/\/working\r\nvoid scalar_addition(COMPLEX& result, const COMPLEX addition){\r\n result.r += addition.r;\r\n result.i += addition.i;\r\n}\r\nvoid scalar_multiplication(const COMPLEX& A, const int B, COMPLEX& result){\r\n result.r = A.r * B;\r\n result.i = A.i * B;\r\n} \/\/to test\r\nvoid scalar_multiplication(const COMPLEX& A, const COMPLEX& B, COMPLEX& result){\r\n la::complex<double> laA = la::complex<double>(A); \/\/convert to la::complex<double>\r\n la::complex<double> laB = la::complex<double>(B);\r\n la::complex<double> laResult = la::complex<double>(result);\r\n laResult = laA * laB;\r\n result = laResult.toCOMPLEX();\r\n} \/\/to test\r\nvoid scalar_division(const COMPLEX& A, const int B, COMPLEX& result){\r\n result.r = A.r \/ B;\r\n result.i = A.i \/ B;\r\n} \/\/to test\r\nvoid scalar_division(const COMPLEX& A, const COMPLEX& B, COMPLEX& result){\r\n la::complex<double> laA = la::complex<double>(A); \/\/convert to la::complex<double>\r\n la::complex<double> laB = la::complex<double>(B);\r\n la::complex<double> laResult = la::complex<double>(result);\r\n laResult = laA \/ laB;\r\n result = laResult.toCOMPLEX();\r\n} \/\/to test\r\nvoid scalar_powers(const COMPLEX& number, const int power, COMPLEX& result){\r\n la::complex<double> laResult = la::complex<double>(number);\r\n la::complex<double> laNumber = la::complex<double>(number);\r\n for(int i = 1; i < power; i++){\r\n laResult *= laNumber;\r\n }\r\n result = laResult.toCOMPLEX();\r\n} \/\/to test\r\nvoid scalar_exponential_1(const COMPLEX& number, const int iterations, COMPLEX& result){\r\n COMPLEX division, total_division, A;\r\n result.r = 1;\r\n result.i = 1;\r\n for(int step = 1; step <= iterations; step++){ \/\/sum (from 1 to n)\r\n division.r = 0;\r\n division.i = 0;\r\n total_division.r = 1;\r\n total_division.i = 0;\r\n for(int i = 1; i <= step; i++){ \/\/ ( num^n \/ n!)\r\n cout << \"division = \" << division << endl;\r\n cout << \"total_division = \" << total_division << endl;\r\n A = total_division;\r\n scalar_division(number, i, division);\r\n scalar_multiplication(A, division, total_division);\r\n }\r\n scalar_addition(result, total_division);\r\n cout << \"sum = \" << result << endl;\r\n }\r\n}\r\nvoid scalar_exponential(const COMPLEX& number, const int iter, COMPLEX& result){\r\n \/\/COMPLEX power;\r\n \/\/COMPLEX division;\r\n \/\/result.r = 0;\r\n \/\/result.i = 0;\r\n \/\/for(int i = 0; i < iter; i++){\r\n \/\/ scalar_powers(number, i, power);\r\n \/\/ scalar_division(power, factorial(i), division);\r\n \/\/ scalar_addition(result, division, result);\r\n \/\/}\r\n} \/\/empty\r\n\/\/COMPLEX rec_scalar_exp_step(const COMPLEX& number, const int step){\r\n\/\/ COMPLEX result, division, multiplication;\r\n\/\/\tif(step <= 1){\r\n\/\/ result.r = 1;\r\n\/\/ return result;\r\n\/\/\t}else{\r\n\/\/ scalar_division(number,step,division);\r\n\/\/ scalar_multiplication(division, rec_scalar_exp_step(step-1), multiplication);\r\n\/\/ return multiplication;\r\n\/\/\t}\r\n\/\/}\r\nvoid recursive_scalar_exponential(const COMPLEX& number, const int iter, COMPLEX& result){\r\n \/\/COMPLEX power;\r\n \/\/COMPLEX division;\r\n \/\/result.r = 0;\r\n \/\/result.i = 0;\r\n \/\/for(int i = 0; i < iter; i++){\r\n \/\/ scalar_powers(number, i, power);\r\n \/\/ scalar_division(power, factorial(i), division);\r\n \/\/ scalar_addition(result, division, result);\r\n \/\/}\r\n} \/\/empty\r\n\r\n\/* array manipulation [0\/1] *\/\r\nvoid array_powers(COMPLEX array[], const int len, const int power){\/**\/\r\n \/*\r\n for(int i = 0; i < len; i++){\r\n array[i] = complex_power(array[i], power, result);\r\n }\r\n *\/\r\n} \/\/empty\r\n\r\n\/* Matrix manipulation [2\/4] *\/\r\nvoid diagonal_matrix_powers(){ \/\/empty\r\n \/\/...\r\n}\r\nvoid matrix_eigenvstuff(const LaGenMatComplex& matrix, LaVectorComplex& eigenvalues, LaGenMatComplex& eigenvectors){ \/\/working\r\n \/\/LaEigSolve: http:\/\/lapackpp.sourceforge.net\/html\/laslv_8h.html#086357d17e9cdcaec69ab7db76998769\r\n LaEigSolve(matrix, eigenvalues, eigenvectors);\r\n}\r\nvoid matrix_inverse(LaGenMatComplex& matrix, int len){ \/\/working\r\n \/\/ LaLUInverseIP: http:\/\/lapackpp.sourceforge.net\/html\/laslv_8h.html#a042c82c5b818f54e7f000d068f14189\r\n LaVectorLongInt PIV = LaVectorLongInt(len);\r\n LUFactorizeIP(matrix, PIV);\r\n LaLUInverseIP(matrix, PIV);\r\n}\r\nvoid matrix_exp_step(){ \/\/empty\r\n \/\/\r\n}\r\nvoid matrix_exponential(const LaGenMatComplex& eigenvectors, const LaGenMatComplex& eigenvalues){\r\n \/\/LaGenMatComplex step = LaGenMatComplex\r\n\r\n} \/\/empty\r\n\r\n\/* Testing [3\/3] *\/\r\nvoid test_scalar_manipulation(const int max_rand){\r\n COMPLEX compA; \/\/initialisation\r\n generate_scalar(compA, max_rand);\r\n COMPLEX compB;\r\n generate_scalar(compB, max_rand);\r\n int realB;\r\n generate_scalar(realB, max_rand);\r\n COMPLEX result;\r\n\r\n for(int i = 1; i < 5; i++){ \/\/factorials\r\n cout << \"factorial(\" << i << \"): \" << factorial(i) << endl;\r\n }\r\n\r\n scalar_addition(compA, compB, result); \/\/addition\/subtraction\r\n cout << \"scalar addition: \" << result << endl << endl;\r\n\r\n scalar_multiplication(compA, realB, result); \/\/multiplication\r\n cout << \"scalar multiplication by scalar: \" << result << endl << endl;\r\n scalar_multiplication(compA, compB, result);\r\n cout << \"scalar multiplication by complex: \" << result << endl << endl;\r\n\r\n scalar_division(compA, realB, result); \/\/division\r\n cout << \"scalar division by scalar: \" << result << endl << endl;\r\n scalar_division(compA, compB, result);\r\n cout << \"scalar division by complex: \" << result << endl << endl;\r\n\r\n for(int i = 1; i < 5; i++){\r\n scalar_powers(compA, i, result);\r\n cout << \"scalar powers - A^\" << i << \" = \" << result << endl;\r\n }\r\n\r\n} \/\/to test\r\nvoid test_eigenvalues(const LaGenMatComplex& initialMatrix, const int size){\r\n LaVectorComplex eigenvalueVec = LaVectorComplex(size); \/\/initialise eigenstuff\r\n LaGenMatComplex eigenvalues = LaGenMatComplex::zeros(size, size);\r\n LaGenMatComplex eigenvectors = LaGenMatComplex::zeros(size, size);\r\n matrix_eigenvstuff(initialMatrix, eigenvalueVec, eigenvectors); \/\/calculate eigenstuff\r\n print_matrix(eigenvalueVec, \"eigenvalue vector\"); \/\/print eigenstuff\r\n vec_to_diag(eigenvalueVec, size, eigenvalues);\r\n print_matrix(eigenvalues, \"eigenvalue matrix\");\r\n print_matrix(eigenvectors, \"eigenvector matrix\");\r\n} \/\/to test\r\nvoid test_inverse(const LaGenMatComplex& initialMatrix, const int size){\r\n LaGenMatComplex inverseMatrix;\r\n inverseMatrix = initialMatrix.copy();\r\n matrix_inverse(inverseMatrix, size);\r\n print_matrix(inverseMatrix, \"inverse matrix\");\r\n} \/\/to test\r\nvoid test_scalar_exponential(const int iterations, const int max_rand){\r\n COMPLEX number, result;\r\n generate_scalar(number, max_rand);\r\n cout << endl << \"scalar exponential test no.: \" << number << endl << endl;\r\n scalar_exponential_1(number, iterations, result);\r\n cout << \"e^\" << number << \" = \" << result << endl;\r\n}\r\nvoid test_matrix_exponential(const LaGenMatComplex& initialMatrix, const int size){\r\n \/\/...\r\n}\r\n\r\n\r\n\/* Main Program *\/\r\nint main(){\r\n\/\/\tint matrix_size = 3, max_rand = 9;\r\n\/\/ int matrix_volume = matrix_size * matrix_size;\r\n\r\n\t\/* generate the matrix *\/\r\n\/\/ COMPLEX elements[matrix_volume];\r\n\/\/ generate_array(elements, matrix_volume, max_rand);\r\n\/\/\tLaGenMatComplex initialMatrix = LaGenMatComplex(elements, matrix_size, matrix_size, false );\r\n\r\n\/\/ print_matrix(initialMatrix, \"initial matrix\");\r\n\r\n \/* test eigenvalues *\/\r\n\/\/ test_eigenvalues(initialMatrix, matrix_size);\r\n\r\n \/* test scalar manipulation *\/\r\n\/\/ test_scalar_manipulation(4);\r\n\r\n \/* test scalar sum *\/\r\n\r\n\r\n\r\n \/* test scalar product *\/\r\n\r\n \/* test scalar exponentials *\/\r\n\/\/ test_scalar_exponential(3,4);\r\n\r\n \/* test inversion *\/\r\n\/\/ test_inverse(initialMatrix, matrix_size);\r\n}\r\n<commit_msg>testing<commit_after>#include <iostream> \/\/cout\r\n#include <cstdlib>\t\/\/rand, sran\r\n#include <string>\r\n#include \"complex_matrices.h\"\r\n#include <gmc.h> \t\/\/LaGenMatComplex\r\n#include <laslv.h> \/\/LUFactorizeIP, LaLUInverseIP, etc.\r\n#include <blas3pp.h>\r\n\r\nusing namespace std;\r\n\r\n\/* Total [13\/20] *\/\r\n\r\n\/* Printing [6\/9] *\/\r\nvoid print_scalar(const COMPLEX scalar){\r\n cout << scalar << endl;\r\n} \/\/working\r\nvoid print_scalar(const COMPLEX scalar, const string name){\r\n cout << name << \":\" << scalar << endl;\r\n} \/\/working\r\nvoid print_array(const COMPLEX array[], int len){\r\n for(int i = 0; i < len; i++){\r\n cout << array[i] << endl;\r\n }\r\n} \/\/working\r\nvoid print_array(const COMPLEX array[], int len, const string name){\r\n\tcout << name << \":\" << endl;\r\n for(int i = 0; i < len; i++){\r\n cout << array[i] << endl;\r\n }\r\n} \/\/working\r\nvoid print_matrix(const LaGenMatComplex& matrix){\r\n\tcout << matrix << endl;\r\n} \/\/working\r\nvoid print_matrix(const LaGenMatComplex& matrix, const string name){\r\n\tcout << name << \":\" << endl << matrix << endl;\r\n}\t\t\t \/\/working\r\n\r\n\/* Number generation [2\/2] *\/\r\nvoid generate_scalar(COMPLEX& A, const int x){\r\n A.r = rand() % x;\t\/\/1 to x\r\n A.i = rand() % x;\r\n} \/\/working\r\nvoid generate_scalar(int A, const int x){\r\n A = rand() % x;\t\/\/1 to x\r\n} \/\/working\r\nvoid generate_array(COMPLEX array[], const int len, const int x){\r\n\tsrand(time(NULL));\t\t\t\t\/\/seed\r\n for(int i = 0; i < len; i++){\r\n array[i].r = rand() % x;\t\/\/1 to x\r\n array[i].i = rand() % x;\r\n\t}\r\n} \/\/working\r\n\r\n\/* Matrix conversion [3\/3] *\/\r\nvoid vec_to_array(const LaVectorComplex& vector, const int len, COMPLEX array[ ]){\r\n for(int i = 0; i < len; i++){\r\n array[i] = vector(i);\r\n }\r\n} \/\/working\r\nvoid array_to_diag(COMPLEX array[], const int len, LaGenMatComplex& diag){\r\n diag = 0;\r\n for(int i = 0; i < len; i++){\r\n diag(i, i) = array[i];\r\n }\r\n} \/\/working\r\nvoid vec_to_diag(const LaVectorComplex& vector, const int len, LaGenMatComplex& diag){\r\n COMPLEX array[len];\r\n vec_to_array(vector, len, array);\r\n array_to_diag(array, len, diag);\r\n} \/\/working\r\n\r\n\/* Scalar manipulation [5\/8] *\/\r\nint factorial(int x){\r\n\tif(x <= 1){\r\n return 1;\r\n\t}else{\r\n return x * factorial(x - 1);\r\n\t}\r\n} \/\/working\r\nvoid scalar_addition(const COMPLEX& A, const COMPLEX& B , COMPLEX& result){\r\n result.r = A.r + B.r;\r\n result.i = A.i + B.i;\r\n} \/\/working\r\nvoid scalar_addition(COMPLEX& result, const COMPLEX addition){\r\n result.r += addition.r;\r\n result.i += addition.i;\r\n}\r\nvoid scalar_multiplication(const COMPLEX& A, const int B, COMPLEX& result){\r\n result.r = A.r * B;\r\n result.i = A.i * B;\r\n} \/\/to test\r\nvoid scalar_multiplication(const COMPLEX& A, const COMPLEX& B, COMPLEX& result){\r\n la::complex<double> laA = la::complex<double>(A); \/\/convert to la::complex<double>\r\n la::complex<double> laB = la::complex<double>(B);\r\n la::complex<double> laResult = la::complex<double>(result);\r\n laResult = laA * laB;\r\n result = laResult.toCOMPLEX();\r\n} \/\/to test\r\nvoid scalar_division(const COMPLEX& A, const int B, COMPLEX& result){\r\n result.r = A.r \/ B;\r\n result.i = A.i \/ B;\r\n} \/\/to test\r\nvoid scalar_division(const COMPLEX& A, const COMPLEX& B, COMPLEX& result){\r\n la::complex<double> laA = la::complex<double>(A); \/\/convert to la::complex<double>\r\n la::complex<double> laB = la::complex<double>(B);\r\n la::complex<double> laResult = la::complex<double>(result);\r\n laResult = laA \/ laB;\r\n result = laResult.toCOMPLEX();\r\n} \/\/to test\r\nvoid scalar_powers(const COMPLEX& number, const int power, COMPLEX& result){\r\n la::complex<double> laResult = la::complex<double>(number);\r\n la::complex<double> laNumber = la::complex<double>(number);\r\n for(int i = 1; i < power; i++){\r\n laResult *= laNumber;\r\n }\r\n result = laResult.toCOMPLEX();\r\n} \/\/to test\r\nvoid scalar_exponential_1(const COMPLEX& number, const int iterations, COMPLEX& result){\r\n COMPLEX division, total_division, A;\r\n result.r = 1;\r\n result.i = 1;\r\n for(int step = 1; step <= iterations; step++){ \/\/sum (from 1 to n)\r\n division.r = 0;\r\n division.i = 0;\r\n total_division.r = 1;\r\n total_division.i = 0;\r\n for(int i = 1; i <= step; i++){ \/\/ ( num^n \/ n!)\r\n cout << \"division = \" << division << endl;\r\n cout << \"total_division = \" << total_division << endl;\r\n A = total_division;\r\n scalar_division(number, i, division);\r\n scalar_multiplication(A, division, total_division);\r\n }\r\n scalar_addition(result, total_division);\r\n cout << \"sum = \" << result << endl;\r\n }\r\n}\r\nvoid scalar_exponential(const COMPLEX& number, const int iter, COMPLEX& result){\r\n \/\/COMPLEX power;\r\n \/\/COMPLEX division;\r\n \/\/result.r = 0;\r\n \/\/result.i = 0;\r\n \/\/for(int i = 0; i < iter; i++){\r\n \/\/ scalar_powers(number, i, power);\r\n \/\/ scalar_division(power, factorial(i), division);\r\n \/\/ scalar_addition(result, division, result);\r\n \/\/}\r\n} \/\/empty\r\n\/\/COMPLEX rec_scalar_exp_step(const COMPLEX& number, const int step){\r\n\/\/ COMPLEX result, division, multiplication;\r\n\/\/\tif(step <= 1){\r\n\/\/ result.r = 1;\r\n\/\/ return result;\r\n\/\/\t}else{\r\n\/\/ scalar_division(number,step,division);\r\n\/\/ scalar_multiplication(division, rec_scalar_exp_step(step-1), multiplication);\r\n\/\/ return multiplication;\r\n\/\/\t}\r\n\/\/}\r\nvoid recursive_scalar_exponential(const COMPLEX& number, const int iter, COMPLEX& result){\r\n \/\/COMPLEX power;\r\n \/\/COMPLEX division;\r\n \/\/result.r = 0;\r\n \/\/result.i = 0;\r\n \/\/for(int i = 0; i < iter; i++){\r\n \/\/ scalar_powers(number, i, power);\r\n \/\/ scalar_division(power, factorial(i), division);\r\n \/\/ scalar_addition(result, division, result);\r\n \/\/}\r\n} \/\/empty\r\n\r\n\/* array manipulation [0\/1] *\/\r\nvoid array_powers(COMPLEX array[], const int len, const int power){\/**\/\r\n \/*\r\n for(int i = 0; i < len; i++){\r\n array[i] = complex_power(array[i], power, result);\r\n }\r\n *\/\r\n} \/\/empty\r\n\r\n\/* Matrix manipulation [2\/4] *\/\r\nvoid diagonal_matrix_powers(){ \/\/empty\r\n \/\/...\r\n}\r\nvoid matrix_eigenvstuff(const LaGenMatComplex& matrix, LaVectorComplex& eigenvalues, LaGenMatComplex& eigenvectors){ \/\/working\r\n \/\/LaEigSolve: http:\/\/lapackpp.sourceforge.net\/html\/laslv_8h.html#086357d17e9cdcaec69ab7db76998769\r\n LaEigSolve(matrix, eigenvalues, eigenvectors);\r\n}\r\nvoid matrix_inverse(LaGenMatComplex& matrix, int len){ \/\/working\r\n \/\/ LaLUInverseIP: http:\/\/lapackpp.sourceforge.net\/html\/laslv_8h.html#a042c82c5b818f54e7f000d068f14189\r\n LaVectorLongInt PIV = LaVectorLongInt(len);\r\n LUFactorizeIP(matrix, PIV);\r\n LaLUInverseIP(matrix, PIV);\r\n}\r\nvoid matrix_exp_step(){ \/\/empty\r\n \/\/\r\n}\r\nvoid matrix_exponential(const LaGenMatComplex& eigenvectors, const LaGenMatComplex& eigenvalues){\r\n \/\/LaGenMatComplex step = LaGenMatComplex\r\n\r\n} \/\/empty\r\n\r\n\/* Testing [3\/3] *\/\r\nvoid test_scalar_manipulation(const int max_rand){\r\n COMPLEX compA; \/\/initialisation\r\n generate_scalar(compA, max_rand);\r\n COMPLEX compB;\r\n generate_scalar(compB, max_rand);\r\n int realB;\r\n generate_scalar(realB, max_rand);\r\n COMPLEX result;\r\n\r\n for(int i = 1; i < 5; i++){ \/\/factorials\r\n cout << \"factorial(\" << i << \"): \" << factorial(i) << endl;\r\n }\r\n\r\n scalar_addition(compA, compB, result); \/\/addition\/subtraction\r\n cout << \"scalar addition: \" << result << endl << endl;\r\n\r\n scalar_multiplication(compA, realB, result); \/\/multiplication\r\n cout << \"scalar multiplication by scalar: \" << result << endl << endl;\r\n scalar_multiplication(compA, compB, result);\r\n cout << \"scalar multiplication by complex: \" << result << endl << endl;\r\n\r\n scalar_division(compA, realB, result); \/\/division\r\n cout << \"scalar division by scalar: \" << result << endl << endl;\r\n scalar_division(compA, compB, result);\r\n cout << \"scalar division by complex: \" << result << endl << endl;\r\n\r\n for(int i = 1; i < 5; i++){\r\n scalar_powers(compA, i, result);\r\n cout << \"scalar powers - A^\" << i << \" = \" << result << endl;\r\n }\r\n\r\n} \/\/to test\r\nvoid test_eigenvalues(const LaGenMatComplex& initialMatrix, const int size){\r\n LaVectorComplex eigenvalueVec = LaVectorComplex(size); \/\/initialise eigenstuff\r\n LaGenMatComplex eigenvalues = LaGenMatComplex::zeros(size, size);\r\n LaGenMatComplex eigenvectors = LaGenMatComplex::zeros(size, size);\r\n matrix_eigenvstuff(initialMatrix, eigenvalueVec, eigenvectors); \/\/calculate eigenstuff\r\n print_matrix(eigenvalueVec, \"eigenvalue vector\"); \/\/print eigenstuff\r\n vec_to_diag(eigenvalueVec, size, eigenvalues);\r\n print_matrix(eigenvalues, \"eigenvalue matrix\");\r\n print_matrix(eigenvectors, \"eigenvector matrix\");\r\n} \/\/to test\r\nvoid test_inverse(const LaGenMatComplex& initialMatrix, const int size){\r\n LaGenMatComplex inverseMatrix;\r\n inverseMatrix = initialMatrix.copy();\r\n matrix_inverse(inverseMatrix, size);\r\n print_matrix(inverseMatrix, \"inverse matrix\");\r\n} \/\/to test\r\nvoid test_scalar_sum(const int rand_max, const int iterations){\r\n COMPLEX number;\r\n generate_scalar(number, max_rand);\r\n for(int i = 0; i < iterations; i++){\r\n cout << number << endl;\r\n scalar_addition(number, number);\r\n }\r\n cout << number << endl;\r\n}\r\nvoid test_scalar_exponential(const int iterations, const int max_rand){\r\n COMPLEX number, result;\r\n generate_scalar(number, max_rand);\r\n cout << endl << \"scalar exponential test no.: \" << number << endl << endl;\r\n scalar_exponential_1(number, iterations, result);\r\n cout << \"e^\" << number << \" = \" << result << endl;\r\n}\r\nvoid test_matrix_exponential(const LaGenMatComplex& initialMatrix, const int size){\r\n \/\/...\r\n}\r\n\r\n\r\n\/* Main Program *\/\r\nint main(){\r\n\/\/\tint matrix_size = 3, max_rand = 9;\r\n\/\/ int matrix_volume = matrix_size * matrix_size;\r\n\r\n\t\/* generate the matrix *\/\r\n\/\/ COMPLEX elements[matrix_volume];\r\n\/\/ generate_array(elements, matrix_volume, max_rand);\r\n\/\/\tLaGenMatComplex initialMatrix = LaGenMatComplex(elements, matrix_size, matrix_size, false );\r\n\r\n\/\/ print_matrix(initialMatrix, \"initial matrix\");\r\n\r\n \/* test eigenvalues *\/\r\n\/\/ test_eigenvalues(initialMatrix, matrix_size);\r\n\r\n \/* test scalar manipulation *\/\r\n\/\/ test_scalar_manipulation(4);\r\n\r\n \/* test scalar sum *\/\r\n test_scalar_sum(4,3)\r\n\r\n\r\n \/* test scalar product *\/\r\n\r\n \/* test scalar exponentials *\/\r\n\/\/ test_scalar_exponential(3,4);\r\n\r\n \/* test inversion *\/\r\n\/\/ test_inverse(initialMatrix, matrix_size);\r\n}\r\n<|endoftext|>"} {"text":"<commit_before>#include <iostream> \/\/cout\r\n#include <cstdlib>\t\/\/rand, sran\r\n#include <string>\r\n#include \"complex_matrices.h\"\r\n#include <gmc.h> \t\/\/LaGenMatComplex\r\n#include <laslv.h> \/\/LUFactorizeIP, LaLUInverseIP, etc.\r\n#include <blas3pp.h>\r\n\/\/#include <random> \/\/random_device, mt19937\r\n\r\nusing namespace std;\r\n\r\n\/* Total [13\/20] *\/\r\n\r\nint ran(int a, int b){\r\n\/\/ random_device rd;\r\n\/\/ mt19937 gen(rd());\r\n\/\/ uniform_int_distribution<> dist(a, b);\r\n\/\/ return dist(gen);\r\n return rand() % b;\r\n}\r\n\r\n\/* Printing [6\/9] *\/\r\nvoid print_scalar(const COMPLEX scalar){\r\n cout << scalar << endl;\r\n} \/\/working\r\nvoid print_scalar(const COMPLEX scalar, const string name){\r\n cout << name << \":\" << scalar << endl;\r\n} \/\/working\r\nvoid print_array(const COMPLEX array[], int len){\r\n for(int i = 0; i < len; i++){\r\n cout << array[i] << endl;\r\n }\r\n} \/\/working\r\nvoid print_array(const COMPLEX array[], int len, const string name){\r\n\tcout << name << \":\" << endl;\r\n for(int i = 0; i < len; i++){\r\n cout << array[i] << endl;\r\n }\r\n} \/\/working\r\nvoid print_matrix(const LaGenMatComplex& matrix){\r\n\tcout << matrix << endl;\r\n} \/\/working\r\nvoid print_matrix(const LaGenMatComplex& matrix, const string name){\r\n\tcout << name << \":\" << endl << matrix << endl;\r\n}\t\t\t \/\/working\r\n\r\n\/* Number generation [2\/2] *\/\r\nvoid generate_scalar(COMPLEX& A, const int x){\r\n A.r = ran(1, x);\t\/\/1 to x\r\n A.i = ran(1, x);\r\n} \/\/working\r\nvoid generate_scalar(int number, const int x){\r\n number = ran(1, x);\t\/\/1 to x\r\n} \/\/working\r\nvoid generate_array(COMPLEX array[], const int len, const int x){\r\n for(int i = 0; i < len; i++){\r\n array[i].r = ran(1, x);\t\/\/1 to x\r\n array[i].i = ran(1, x);\r\n\t}\r\n} \/\/working\r\n\r\n\/* Matrix conversion [3\/3] *\/\r\nvoid vec_to_array(const LaVectorComplex& vector, const int len, COMPLEX array[ ]){\r\n for(int i = 0; i < len; i++){\r\n array[i] = vector(i);\r\n }\r\n} \/\/working\r\nvoid array_to_diag(COMPLEX array[], const int len, LaGenMatComplex& diag){\r\n diag = 0;\r\n for(int i = 0; i < len; i++){\r\n diag(i, i) = array[i];\r\n }\r\n} \/\/working\r\nvoid vec_to_diag(const LaVectorComplex& vector, const int len, LaGenMatComplex& diag){\r\n COMPLEX array[len];\r\n vec_to_array(vector, len, array);\r\n array_to_diag(array, len, diag);\r\n} \/\/working\r\n\r\n\/* Scalar manipulation [5\/8] *\/\r\nint factorial(int x){\r\n\tif(x <= 1){\r\n return 1;\r\n\t}else{\r\n return x * factorial(x - 1);\r\n\t}\r\n} \/\/working\r\nvoid scalar_addition(const COMPLEX& A, const COMPLEX& B , COMPLEX& result){\r\n result.r = A.r + B.r;\r\n result.i = A.i + B.i;\r\n} \/\/working\r\nvoid scalar_addition(COMPLEX& result, const COMPLEX addition){\r\n result.r += addition.r;\r\n result.i += addition.i;\r\n}\r\nvoid scalar_multiplication(const COMPLEX& A, const int B, COMPLEX& result){\r\n result.r = A.r * B;\r\n result.i = A.i * B;\r\n} \/\/to test\r\nvoid scalar_multiplication(const COMPLEX& A, const COMPLEX& B, COMPLEX& result){\r\n la::complex<double> laA = la::complex<double>(A); \/\/convert to la::complex<double>\r\n la::complex<double> laB = la::complex<double>(B);\r\n la::complex<double> laResult = la::complex<double>(result);\r\n laResult = laA * laB;\r\n result = laResult.toCOMPLEX();\r\n} \/\/to test\r\nvoid scalar_product(COMPLEX& total, const COMPLEX& number){\r\n COMPLEX part;\r\n part.r = (total.r * number.r) - (total.i * number.i);\r\n part.i = (total.r * number.i) + (total.i * number.r);\r\n total = part;\r\n}\r\nvoid scalar_division(const COMPLEX& A, const int B, COMPLEX& result){\r\n result.r = A.r \/ B;\r\n result.i = A.i \/ B;\r\n} \/\/to test\r\nvoid scalar_division(const COMPLEX& A, const COMPLEX& B, COMPLEX& result){\r\n la::complex<double> laA = la::complex<double>(A); \/\/convert to la::complex<double>\r\n la::complex<double> laB = la::complex<double>(B);\r\n la::complex<double> laResult = la::complex<double>(result);\r\n laResult = laA \/ laB;\r\n result = laResult.toCOMPLEX();\r\n} \/\/to test\r\nvoid scalar_powers(const COMPLEX& number, const int power, COMPLEX& result){\r\n la::complex<double> laResult = la::complex<double>(number);\r\n la::complex<double> laNumber = la::complex<double>(number);\r\n for(int i = 1; i < power; i++){\r\n laResult *= laNumber;\r\n }\r\n result = laResult.toCOMPLEX();\r\n} \/\/to test\r\nvoid scalar_exponential_main(const COMPLEX& number, const int iterations, COMPLEX& result){\r\n COMPLEX division, total_division;\r\n result.r = 1;\r\n result.i = 0 ;\r\n for(int step = 1; step <= iterations; step++){ \/\/sum (from 1 to n)\r\n total_division.r = 1;\r\n total_division.i = 0;\r\n for(int i = 1; i <= step; i++){ \/\/ ( num^n \/ n!)\r\n scalar_division(number, i, division);\r\n scalar_product(total_division, division);\r\n }\r\n scalar_addition(result, total_division);\r\n }\r\n}\r\nvoid scalar_exponential(const COMPLEX& number, const int iter, COMPLEX& result){\r\n \/\/COMPLEX power;\r\n \/\/COMPLEX division;\r\n \/\/result.r = 0;\r\n \/\/result.i = 0;\r\n \/\/for(int i = 0; i < iter; i++){\r\n \/\/ scalar_powers(number, i, power);\r\n \/\/ scalar_division(power, factorial(i), division);\r\n \/\/ scalar_addition(result, division, result);\r\n \/\/}\r\n} \/\/empty\r\n\/\/COMPLEX rec_scalar_exp_step(const COMPLEX& number, const int step){\r\n\/\/ COMPLEX result, division, multiplication;\r\n\/\/\tif(step <= 1){\r\n\/\/ result.r = 1;\r\n\/\/ return result;\r\n\/\/\t}else{\r\n\/\/ scalar_division(number,step,division);\r\n\/\/ scalar_multiplication(division, rec_scalar_exp_step(step-1), multiplication);\r\n\/\/ return multiplication;\r\n\/\/\t}\r\n\/\/}\r\nvoid recursive_scalar_exponential(const COMPLEX& number, const int iter, COMPLEX& result){\r\n \/\/COMPLEX power;\r\n \/\/COMPLEX division;\r\n \/\/result.r = 0;\r\n \/\/result.i = 0;\r\n \/\/for(int i = 0; i < iter; i++){\r\n \/\/ scalar_powers(number, i, power);\r\n \/\/ scalar_division(power, factorial(i), division);\r\n \/\/ scalar_addition(result, division, result);\r\n \/\/}\r\n} \/\/empty\r\n\r\n\/* array manipulation [0\/1] *\/\r\nvoid array_powers(COMPLEX array[], const int len, const int power){\/**\/\r\n \/*\r\n for(int i = 0; i < len; i++){\r\n array[i] = complex_power(array[i], power, result);\r\n }\r\n *\/\r\n} \/\/empty\r\n\r\n\/* Matrix manipulation [2\/4] *\/\r\nvoid diagonal_matrix_powers(){ \/\/empty\r\n \/\/...\r\n}\r\nvoid matrix_eigenvstuff(const LaGenMatComplex& matrix, LaVectorComplex& eigenvalues, LaGenMatComplex& eigenvectors){ \/\/working\r\n \/\/LaEigSolve: http:\/\/lapackpp.sourceforge.net\/html\/laslv_8h.html#086357d17e9cdcaec69ab7db76998769\r\n LaEigSolve(matrix, eigenvalues, eigenvectors);\r\n}\r\nvoid matrix_inverse(LaGenMatComplex& matrix, int len){ \/\/working\r\n \/\/ LaLUInverseIP: http:\/\/lapackpp.sourceforge.net\/html\/laslv_8h.html#a042c82c5b818f54e7f000d068f14189\r\n LaVectorLongInt PIV = LaVectorLongInt(len);\r\n LUFactorizeIP(matrix, PIV);\r\n LaLUInverseIP(matrix, PIV);\r\n}\r\nvoid matrix_exp_step(){ \/\/empty\r\n \/\/\r\n}\r\nvoid matrix_exponential(const LaGenMatComplex& eigenvectors, const LaGenMatComplex& eigenvalues){\r\n \/\/LaGenMatComplex step = LaGenMatComplex\r\n\r\n} \/\/empty\r\n\r\n\/* Testing [3\/3] *\/\r\nvoid test_scalar_manipulation(const int max_rand){\r\n COMPLEX compA;\r\n generate_scalar(compA, max_rand);\r\n COMPLEX compB;\r\n generate_scalar(compB, max_rand);\r\n int realB;\r\n generate_scalar(realB, max_rand);\r\n COMPLEX result;\r\n\r\n cout << \"compA = \" << compA << endl;\r\n cout << \"compB = \" << compB << endl;\r\n cout << \"realB = \" << realB << endl;\r\n cout << endl;\r\n\r\n for(int i = 1; i < 5; i++){ \/\/factorials\r\n cout << \"factorial(\" << i << \"): \" << factorial(i) << endl;\r\n }\r\n\r\n scalar_addition(compA, compB, result); \/\/addition\/subtraction\r\n cout << \"scalar addition: \" << result << endl << endl;\r\n\r\n scalar_multiplication(compA, realB, result); \/\/multiplication\r\n cout << \"scalar multiplication by scalar: \" << result << endl << endl;\r\n\r\n scalar_multiplication(compA, compB, result);\r\n cout << \"scalar multiplication by complex: \" << result << endl << endl;\r\n\r\n scalar_division(compA, realB, result); \/\/division\r\n cout << \"scalar division by scalar: \" << result << endl << endl;\r\n\r\n scalar_division(compA, compB, result);\r\n cout << \"scalar division by complex: \" << result << endl << endl;\r\n\r\n for(int i = 1; i < 5; i++){\r\n scalar_powers(compA, i, result);\r\n cout << \"scalar powers - A^\" << i << \" = \" << result << endl;\r\n }\r\n cout << endl;\r\n\r\n COMPLEX sum;\r\n sum.r = 0;\r\n sum.i = 0;\r\n for(int i = 0; i < 5; i++){\r\n cout << \"sum(\" << i << \") = \" << sum << endl;\r\n scalar_addition(sum, compA);\r\n }\r\n cout << \"sum = \" << sum << endl;\r\n\r\n} \/\/to test\r\nvoid test_eigenvalues(const LaGenMatComplex& initialMatrix, const int size){\r\n LaVectorComplex eigenvalueVec = LaVectorComplex(size); \/\/initialise eigenstuff\r\n LaGenMatComplex eigenvalues = LaGenMatComplex::zeros(size, size);\r\n LaGenMatComplex eigenvectors = LaGenMatComplex::zeros(size, size);\r\n matrix_eigenvstuff(initialMatrix, eigenvalueVec, eigenvectors); \/\/calculate eigenstuff\r\n print_matrix(eigenvalueVec, \"eigenvalue vector\"); \/\/print eigenstuff\r\n vec_to_diag(eigenvalueVec, size, eigenvalues);\r\n print_matrix(eigenvalues, \"eigenvalue matrix\");\r\n print_matrix(eigenvectors, \"eigenvector matrix\");\r\n} \/\/to test\r\nvoid test_inverse(const LaGenMatComplex& initialMatrix, const int size){\r\n LaGenMatComplex inverseMatrix;\r\n inverseMatrix = initialMatrix.copy();\r\n matrix_inverse(inverseMatrix, size);\r\n print_matrix(inverseMatrix, \"inverse matrix\");\r\n} \/\/to test\r\nvoid test_scalar_sum(const int max_rand, const int iterations){\r\n COMPLEX number, step;\r\n generate_scalar(number, max_rand);\r\n step = number;\r\n for(int i = 0; i < iterations; i++){\r\n cout << step << endl;\r\n scalar_addition(number, step);\r\n }\r\n cout << number << endl;\r\n}\r\nvoid test_scalar_product(const int max_rand, const int iterations){\r\n \/\/...\r\n}\r\nvoid test_scalar_exponential(const int iterations, const int max_rand){\r\n COMPLEX number, result;\r\n generate_scalar(number, max_rand);\r\n cout << endl << \"scalar exponential test no.: \" << number << endl << endl;\r\n scalar_exponential_main(number, iterations, result);\r\n cout << \"e^\" << number << \" = \" << result << endl;\r\n}\r\nvoid test_matrix_exponential(const LaGenMatComplex& initialMatrix, const int size){\r\n \/\/cout << \"intial matrix = \" << endl << initialMatrix << endl;\r\n}\r\nvoid test_idenpotent_exponential(){\r\n\r\n \/\/ Generate the matrix\r\n int elements [] = {2, -2, -4, -1, 3, 4, 1, -2, -3};\r\n COMPLEX comp[9];\r\n for(int i = 0; i < 9; i++){\r\n comp[i].r = elements[i];\r\n comp[i].i = 0;\r\n }\r\n LaGenMatComplex initialMatrix = LaGenMatComplex(comp, 3, 3, false );\r\n cout << \"initialMatrix = \" << endl << initialMatrix << endl;\r\n\r\n \/\/calculate the exponential\r\n}\r\n\r\n\/* Main Program *\/\r\nint main(){\r\n\tint matrix_size = 3, max_rand = 9;\r\n int matrix_volume = matrix_size * matrix_size;\r\n\r\n\t\/* generate the matrix *\/\r\n COMPLEX elements[matrix_volume];\r\n generate_array(elements, matrix_volume, max_rand);\r\n\tLaGenMatComplex initialMatrix = LaGenMatComplex(elements, matrix_size, matrix_size, false );\r\n\r\n print_matrix(initialMatrix, \"initial matrix\");\r\n\r\n \/* test eigenvalues *\/\r\n\/\/ test_eigenvalues(initialMatrix, matrix_size);\r\n\r\n \/* test scalar manipulation *\/\r\n\/\/ test_scalar_manipulation(4);\r\n\r\n \/* test scalar product *\/\r\n\r\n \/* test scalar exponentials *\/\r\n\/\/ test_scalar_exponential(5000,40);\r\n\/\/ test_idenpotent_exponential();\r\n\r\n \/* test matrix exponentials *\/\r\n test_matrix_exponential(initialMatrix, matrix_size);\r\n \/* test inversion *\/\r\n\/\/ test_inverse(initialMatrix, matrix_size);\r\n}\r\n<commit_msg>testing<commit_after>#include <iostream> \/\/cout\r\n#include <cstdlib>\t\/\/rand, sran\r\n#include <string>\r\n#include \"complex_matrices.h\"\r\n#include <gmc.h> \t\/\/LaGenMatComplex\r\n#include <laslv.h> \/\/LUFactorizeIP, LaLUInverseIP, etc.\r\n#include <blas3pp.h>\r\n\/\/#include <random> \/\/random_device, mt19937\r\n\r\nusing namespace std;\r\n\r\n\/* Total [13\/20] *\/\r\n\r\nint ran(int a, int b){\r\n\/\/ random_device rd;\r\n\/\/ mt19937 gen(rd());\r\n\/\/ uniform_int_distribution<> dist(a, b);\r\n\/\/ return dist(gen);\r\n return rand() % b;\r\n}\r\n\r\n\/* Printing [6\/9] *\/\r\nvoid print_scalar(const COMPLEX scalar){\r\n cout << scalar << endl;\r\n} \/\/working\r\nvoid print_scalar(const COMPLEX scalar, const string name){\r\n cout << name << \":\" << scalar << endl;\r\n} \/\/working\r\nvoid print_array(const COMPLEX array[], int len){\r\n for(int i = 0; i < len; i++){\r\n cout << array[i] << endl;\r\n }\r\n} \/\/working\r\nvoid print_array(const COMPLEX array[], int len, const string name){\r\n\tcout << name << \":\" << endl;\r\n for(int i = 0; i < len; i++){\r\n cout << array[i] << endl;\r\n }\r\n} \/\/working\r\nvoid print_matrix(const LaGenMatComplex& matrix){\r\n\tcout << matrix << endl;\r\n} \/\/working\r\nvoid print_matrix(const LaGenMatComplex& matrix, const string name){\r\n\tcout << name << \":\" << endl << matrix << endl;\r\n}\t\t\t \/\/working\r\n\r\n\/* Number generation [2\/2] *\/\r\nvoid generate_scalar(COMPLEX& A, const int x){\r\n A.r = ran(1, x);\t\/\/1 to x\r\n A.i = ran(1, x);\r\n} \/\/working\r\nvoid generate_scalar(int number, const int x){\r\n number = ran(1, x);\t\/\/1 to x\r\n} \/\/working\r\nvoid generate_array(COMPLEX array[], const int len, const int x){\r\n for(int i = 0; i < len; i++){\r\n array[i].r = ran(1, x);\t\/\/1 to x\r\n array[i].i = ran(1, x);\r\n\t}\r\n} \/\/working\r\n\r\n\/* Matrix conversion [3\/3] *\/\r\nvoid vec_to_array(const LaVectorComplex& vector, const int len, COMPLEX array[ ]){\r\n for(int i = 0; i < len; i++){\r\n array[i] = vector(i);\r\n }\r\n} \/\/working\r\nvoid array_to_diag(COMPLEX array[], const int len, LaGenMatComplex& diag){\r\n diag = 0;\r\n for(int i = 0; i < len; i++){\r\n diag(i, i) = array[i];\r\n }\r\n} \/\/working\r\nvoid vec_to_diag(const LaVectorComplex& vector, const int len, LaGenMatComplex& diag){\r\n COMPLEX array[len];\r\n vec_to_array(vector, len, array);\r\n array_to_diag(array, len, diag);\r\n} \/\/working\r\n\r\n\/* Scalar manipulation [5\/8] *\/\r\nint factorial(int x){\r\n\tif(x <= 1){\r\n return 1;\r\n\t}else{\r\n return x * factorial(x - 1);\r\n\t}\r\n} \/\/working\r\nvoid scalar_addition(const COMPLEX& A, const COMPLEX& B , COMPLEX& result){\r\n result.r = A.r + B.r;\r\n result.i = A.i + B.i;\r\n} \/\/working\r\nvoid scalar_addition(COMPLEX& result, const COMPLEX addition){\r\n result.r += addition.r;\r\n result.i += addition.i;\r\n}\r\nvoid scalar_multiplication(const COMPLEX& A, const int B, COMPLEX& result){\r\n result.r = A.r * B;\r\n result.i = A.i * B;\r\n} \/\/to test\r\nvoid scalar_multiplication(const COMPLEX& A, const COMPLEX& B, COMPLEX& result){\r\n la::complex<double> laA = la::complex<double>(A); \/\/convert to la::complex<double>\r\n la::complex<double> laB = la::complex<double>(B);\r\n la::complex<double> laResult = la::complex<double>(result);\r\n laResult = laA * laB;\r\n result = laResult.toCOMPLEX();\r\n} \/\/to test\r\nvoid scalar_product(COMPLEX& total, const COMPLEX& number){\r\n COMPLEX part;\r\n part.r = (total.r * number.r) - (total.i * number.i);\r\n part.i = (total.r * number.i) + (total.i * number.r);\r\n total = part;\r\n}\r\nvoid scalar_division(const COMPLEX& A, const int B, COMPLEX& result){\r\n result.r = A.r \/ B;\r\n result.i = A.i \/ B;\r\n} \/\/to test\r\nvoid scalar_division(const COMPLEX& A, const COMPLEX& B, COMPLEX& result){\r\n la::complex<double> laA = la::complex<double>(A); \/\/convert to la::complex<double>\r\n la::complex<double> laB = la::complex<double>(B);\r\n la::complex<double> laResult = la::complex<double>(result);\r\n laResult = laA \/ laB;\r\n result = laResult.toCOMPLEX();\r\n} \/\/to test\r\nvoid scalar_powers(const COMPLEX& number, const int power, COMPLEX& result){\r\n la::complex<double> laResult = la::complex<double>(number);\r\n la::complex<double> laNumber = la::complex<double>(number);\r\n for(int i = 1; i < power; i++){\r\n laResult *= laNumber;\r\n }\r\n result = laResult.toCOMPLEX();\r\n} \/\/to test\r\nvoid scalar_exponential_main(const COMPLEX& number, const int iterations, COMPLEX& result){\r\n COMPLEX division, total_division;\r\n result.r = 1;\r\n result.i = 0 ;\r\n for(int step = 1; step <= iterations; step++){ \/\/sum (from 1 to n)\r\n total_division.r = 1;\r\n total_division.i = 0;\r\n for(int i = 1; i <= step; i++){ \/\/ ( num^n \/ n!)\r\n scalar_division(number, i, division);\r\n scalar_product(total_division, division);\r\n }\r\n scalar_addition(result, total_division);\r\n }\r\n}\r\nvoid scalar_exponential(const COMPLEX& number, const int iter, COMPLEX& result){\r\n \/\/COMPLEX power;\r\n \/\/COMPLEX division;\r\n \/\/result.r = 0;\r\n \/\/result.i = 0;\r\n \/\/for(int i = 0; i < iter; i++){\r\n \/\/ scalar_powers(number, i, power);\r\n \/\/ scalar_division(power, factorial(i), division);\r\n \/\/ scalar_addition(result, division, result);\r\n \/\/}\r\n} \/\/empty\r\n\/\/COMPLEX rec_scalar_exp_step(const COMPLEX& number, const int step){\r\n\/\/ COMPLEX result, division, multiplication;\r\n\/\/\tif(step <= 1){\r\n\/\/ result.r = 1;\r\n\/\/ return result;\r\n\/\/\t}else{\r\n\/\/ scalar_division(number,step,division);\r\n\/\/ scalar_multiplication(division, rec_scalar_exp_step(step-1), multiplication);\r\n\/\/ return multiplication;\r\n\/\/\t}\r\n\/\/}\r\nvoid recursive_scalar_exponential(const COMPLEX& number, const int iter, COMPLEX& result){\r\n \/\/COMPLEX power;\r\n \/\/COMPLEX division;\r\n \/\/result.r = 0;\r\n \/\/result.i = 0;\r\n \/\/for(int i = 0; i < iter; i++){\r\n \/\/ scalar_powers(number, i, power);\r\n \/\/ scalar_division(power, factorial(i), division);\r\n \/\/ scalar_addition(result, division, result);\r\n \/\/}\r\n} \/\/empty\r\n\r\n\/* array manipulation [0\/1] *\/\r\nvoid array_powers(COMPLEX array[], const int len, const int power){\/**\/\r\n \/*\r\n for(int i = 0; i < len; i++){\r\n array[i] = complex_power(array[i], power, result);\r\n }\r\n *\/\r\n} \/\/empty\r\n\r\n\/* Matrix manipulation [2\/4] *\/\r\nvoid diagonal_matrix_powers(){ \/\/empty\r\n \/\/...\r\n}\r\nvoid matrix_eigenvstuff(const LaGenMatComplex& matrix, LaVectorComplex& eigenvalues, LaGenMatComplex& eigenvectors){ \/\/working\r\n \/\/LaEigSolve: http:\/\/lapackpp.sourceforge.net\/html\/laslv_8h.html#086357d17e9cdcaec69ab7db76998769\r\n LaEigSolve(matrix, eigenvalues, eigenvectors);\r\n}\r\nvoid matrix_inverse(LaGenMatComplex& matrix, int len){ \/\/working\r\n \/\/ LaLUInverseIP: http:\/\/lapackpp.sourceforge.net\/html\/laslv_8h.html#a042c82c5b818f54e7f000d068f14189\r\n LaVectorLongInt PIV = LaVectorLongInt(len);\r\n LUFactorizeIP(matrix, PIV);\r\n LaLUInverseIP(matrix, PIV);\r\n}\r\nvoid matrix_exp_step(){ \/\/empty\r\n \/\/\r\n}\r\nvoid matrix_exponential(const LaGenMatComplex& eigenvectors, const LaGenMatComplex& eigenvalues){\r\n \/\/LaGenMatComplex step = LaGenMatComplex\r\n\r\n} \/\/empty\r\n\r\n\/* Testing [3\/3] *\/\r\nvoid test_scalar_manipulation(const int max_rand){\r\n COMPLEX compA;\r\n generate_scalar(compA, max_rand);\r\n COMPLEX compB;\r\n generate_scalar(compB, max_rand);\r\n int realB;\r\n generate_scalar(realB, max_rand);\r\n COMPLEX result;\r\n\r\n cout << \"compA = \" << compA << endl;\r\n cout << \"compB = \" << compB << endl;\r\n cout << \"realB = \" << realB << endl;\r\n cout << endl;\r\n\r\n for(int i = 1; i < 5; i++){ \/\/factorials\r\n cout << \"factorial(\" << i << \"): \" << factorial(i) << endl;\r\n }\r\n\r\n scalar_addition(compA, compB, result); \/\/addition\/subtraction\r\n cout << \"scalar addition: \" << result << endl << endl;\r\n\r\n scalar_multiplication(compA, realB, result); \/\/multiplication\r\n cout << \"scalar multiplication by scalar: \" << result << endl << endl;\r\n\r\n scalar_multiplication(compA, compB, result);\r\n cout << \"scalar multiplication by complex: \" << result << endl << endl;\r\n\r\n scalar_division(compA, realB, result); \/\/division\r\n cout << \"scalar division by scalar: \" << result << endl << endl;\r\n\r\n scalar_division(compA, compB, result);\r\n cout << \"scalar division by complex: \" << result << endl << endl;\r\n\r\n for(int i = 1; i < 5; i++){\r\n scalar_powers(compA, i, result);\r\n cout << \"scalar powers - A^\" << i << \" = \" << result << endl;\r\n }\r\n cout << endl;\r\n\r\n COMPLEX sum;\r\n sum.r = 0;\r\n sum.i = 0;\r\n for(int i = 0; i < 5; i++){\r\n cout << \"sum(\" << i << \") = \" << sum << endl;\r\n scalar_addition(sum, compA);\r\n }\r\n cout << \"sum = \" << sum << endl;\r\n\r\n} \/\/to test\r\nvoid test_eigenvalues(const LaGenMatComplex& initialMatrix, const int size){\r\n LaVectorComplex eigenvalueVec = LaVectorComplex(size); \/\/initialise eigenstuff\r\n LaGenMatComplex eigenvalues = LaGenMatComplex::zeros(size, size);\r\n LaGenMatComplex eigenvectors = LaGenMatComplex::zeros(size, size);\r\n matrix_eigenvstuff(initialMatrix, eigenvalueVec, eigenvectors); \/\/calculate eigenstuff\r\n print_matrix(eigenvalueVec, \"eigenvalue vector\"); \/\/print eigenstuff\r\n vec_to_diag(eigenvalueVec, size, eigenvalues);\r\n print_matrix(eigenvalues, \"eigenvalue matrix\");\r\n print_matrix(eigenvectors, \"eigenvector matrix\");\r\n} \/\/to test\r\nvoid test_inverse(const LaGenMatComplex& initialMatrix, const int size){\r\n LaGenMatComplex inverseMatrix;\r\n inverseMatrix = initialMatrix.copy();\r\n matrix_inverse(inverseMatrix, size);\r\n print_matrix(inverseMatrix, \"inverse matrix\");\r\n} \/\/to test\r\nvoid test_scalar_sum(const int max_rand, const int iterations){\r\n COMPLEX number, step;\r\n generate_scalar(number, max_rand);\r\n step = number;\r\n for(int i = 0; i < iterations; i++){\r\n cout << step << endl;\r\n scalar_addition(number, step);\r\n }\r\n cout << number << endl;\r\n}\r\nvoid test_scalar_product(const int max_rand, const int iterations){\r\n \/\/...\r\n}\r\nvoid test_scalar_exponential(const int iterations, const int max_rand){\r\n COMPLEX number, result;\r\n generate_scalar(number, max_rand);\r\n cout << endl << \"scalar exponential test no.: \" << number << endl << endl;\r\n scalar_exponential_main(number, iterations, result);\r\n cout << \"e^\" << number << \" = \" << result << endl;\r\n}\r\nvoid test_matrix_exponential(const LaGenMatComplex& initialMatrix, const int size){\r\n test_eigenvalues(initialMatrix, size);\r\n}\r\nvoid test_idenpotent_exponential(){\r\n\r\n \/\/ Generate the matrix\r\n int elements [] = {2, -2, -4, -1, 3, 4, 1, -2, -3};\r\n COMPLEX comp[9];\r\n for(int i = 0; i < 9; i++){\r\n comp[i].r = elements[i];\r\n comp[i].i = 0;\r\n }\r\n LaGenMatComplex initialMatrix = LaGenMatComplex(comp, 3, 3, false );\r\n cout << \"initialMatrix = \" << endl << initialMatrix << endl;\r\n\r\n \/\/calculate the exponential\r\n}\r\n\r\n\/* Main Program *\/\r\nint main(){\r\n\tint matrix_size = 3, max_rand = 9;\r\n int matrix_volume = matrix_size * matrix_size;\r\n\r\n\t\/* generate the matrix *\/\r\n COMPLEX elements[matrix_volume];\r\n generate_array(elements, matrix_volume, max_rand);\r\n\tLaGenMatComplex initialMatrix = LaGenMatComplex(elements, matrix_size, matrix_size, false );\r\n\r\n print_matrix(initialMatrix, \"initial matrix\");\r\n\r\n \/* test eigenvalues *\/\r\n\/\/ test_eigenvalues(initialMatrix, matrix_size);\r\n\r\n \/* test scalar manipulation *\/\r\n\/\/ test_scalar_manipulation(4);\r\n\r\n \/* test scalar product *\/\r\n\r\n \/* test scalar exponentials *\/\r\n\/\/ test_scalar_exponential(5000,40);\r\n\/\/ test_idenpotent_exponential();\r\n\r\n \/* test matrix exponentials *\/\r\n test_matrix_exponential(initialMatrix, matrix_size);\r\n\r\n \/* test inversion *\/\r\n\/\/ test_inverse(initialMatrix, matrix_size);\r\n}\r\n<|endoftext|>"} {"text":"<commit_before>\/**\n * \\file sysexp.hpp\n *\n * \\brief Driver for performing system experiments\n *\n * \\author Marco Guazzone (marco.guazzone@gmail.com)\n *\n * <hr\/>\n *\n * Copyright (C) 2012 Marco Guazzone\n * [Distributed Computing System (DCS) Group,\n * Computer Science Institute,\n * Department of Science and Technological Innovation,\n * University of Piemonte Orientale,\n * Alessandria (Italy)]\n *\n * This file is part of dcsxx-testbed.\n *\n * dcsxx-testbed is free software: you can redistribute it and\/or modify\n * it under the terms of the GNU General Public License as published\n * by the Free Software Foundation, either version 3 of the License, or\n * (at your option) any later version.\n *\n * dcsxx-testbed is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the\n * GNU General Public License for more details.\n *\n * You should have received a copy of the GNU General Public License\n * along with dcsxx-testbed. If not, see <http:\/\/www.gnu.org\/licenses\/>.\n *\/\n\n#include <boost\/smart_ptr.hpp>\n#include <cstddef>\n#include <cstdlib>\n#include <cstring>\n#include <dcs\/cli.hpp>\n#include <dcs\/logging.hpp>\n#include <dcs\/math\/traits\/float.hpp>\n#include <dcs\/testbed\/application.hpp>\n#include <dcs\/testbed\/application_managers.hpp>\n#include <dcs\/testbed\/base_application.hpp>\n#include <dcs\/testbed\/system_experiment.hpp>\n#include <dcs\/testbed\/system_identification_strategies.hpp>\n\/\/#include <dcs\/testbed\/system_managers.hpp>\n#include <dcs\/testbed\/traits.hpp>\n#include <dcs\/testbed\/virtual_machine_managers.hpp>\n#include <dcs\/testbed\/virtual_machines.hpp>\n#include <dcs\/testbed\/workload_category.hpp>\n#include <dcs\/testbed\/workload_drivers.hpp>\n#include <dcs\/testbed\/workload_generator_category.hpp>\n#include <iostream>\n#include <limits>\n#include <sstream>\n#include <string>\n#include <stdexcept>\n#include <vector>\n\n\nnamespace detail { namespace \/*<unnamed>*\/ {\n\n\/\/enum aggregation_category\n\/\/{\n\/\/\tmean_aggregation\n\/\/};\n\nconst dcs::testbed::workload_category default_workload(dcs::testbed::olio_workload);\nconst dcs::testbed::workload_generator_category default_workload_driver(dcs::testbed::rain_workload_generator);\nconst ::std::string default_workload_driver_rain_path(\"\/usr\/local\/opt\/rain-workload-toolkit\");\nconst ::std::string default_out_dat_file(\".\/sysmgt-out.dat\");\nconst double default_sampling_time(10);\nconst double default_ewma_smooth_factor(0.9);\n\nvoid usage(char const* progname)\n{\n\t::std::cerr << \"Usage: \" << progname << \" [options]\" << ::std::endl\n\t\t\t\t<< \" --help\" << ::std::endl\n\t\t\t\t<< \" Show this message.\" << ::std::endl\n\t\t\t\t<< \" --out-dat-file <file path>\" << ::std::endl\n\t\t\t\t<< \" The path to the output data file.\" << ::std::endl\n\t\t\t\t<< \" [default: '\" << default_out_dat_file << \"'].\" << ::std::endl\n\t\t\t\t<< \" --ts <time in secs>\" << ::std::endl\n\t\t\t\t<< \" Sampling time (in seconds).\" << ::std::endl\n\t\t\t\t<< \" [default: \" << default_sampling_time << \"].\" << ::std::endl\n\t\t\t\t<< \" --verbose\" << ::std::endl\n\t\t\t\t<< \" Show verbose messages.\" << ::std::endl\n\t\t\t\t<< \" [default: disabled].\" << ::std::endl\n\t\t\t\t<< \" --vm-uri <URI>\" << ::std::endl\n\t\t\t\t<< \" The VM URI to connect.\" << ::std::endl\n\t\t\t\t<< \" Repeat this option as many times as is the number of your VMs.\"\n\t\t\t\t<< \" --wkl <name>\" << ::std::endl\n\t\t\t\t<< \" The workload to generate. Possible values are: 'olio', 'rubis'.\" << ::std::endl\n\t\t\t\t<< \" [default: '\" << default_workload << \"'].\" << ::std::endl\n\t\t\t\t<< \" --wkl-driver <name>\" << ::std::endl\n\t\t\t\t<< \" The workload driver to use. Possible values are: 'rain'.\" << ::std::endl\n\t\t\t\t<< \" [default: '\" << default_workload_driver << \"'].\" << ::std::endl\n\t\t\t\t<< \" --wkl-driver-rain-path <name>\" << ::std::endl\n\t\t\t\t<< \" The full path to the RAIN workload driver.\" << ::std::endl\n\t\t\t\t<< \" [default: '\" << default_workload_driver_rain_path << \"'].\" << ::std::endl\n\t\t\t\t<< ::std::endl;\n}\n\ntemplate <typename RealT>\nstruct rt_slo_checker\n{\n\trt_slo_checker(RealT max_val, RealT rel_tol=0.05)\n\t: max_val_(max_val),\n\t check_val_(max_val_*(1+rel_tol))\n\t{\n\t}\n\n\tbool operator()(RealT val)\n\t{\n\t\treturn ::dcs::math::float_traits<RealT>::approximately_less_equal(val, check_val_);\n\t}\n\n\tprivate: RealT max_val_;\n\tprivate: RealT check_val_;\n};\n\n}} \/\/ Namespace detail::<unnamed>\n\n\nint main(int argc, char *argv[])\n{\n\tnamespace testbed = ::dcs::testbed;\n\n\ttypedef double real_type;\n\ttypedef unsigned int uint_type;\n\ttypedef testbed::traits<real_type,uint_type> traits_type;\n\n\tbool help(false);\n\tstd::string out_dat_file;\n\treal_type ts;\n\tbool verbose(false);\n\ttestbed::workload_category wkl;\n\ttestbed::workload_generator_category wkl_driver;\n\tstd::string wkl_driver_rain_path;\n\tstd::vector<std::string> vm_uris;\n\n\t\/\/ Parse command line options\n\ttry\n\t{\n\t\thelp = dcs::cli::simple::get_option(argv, argv+argc, \"--help\");\n\t\tout_dat_file = dcs::cli::simple::get_option<std::string>(argv, argv+argc, \"--out-dat-file\", detail::default_out_dat_file);\n\t\tts = dcs::cli::simple::get_option<real_type>(argv, argv+argc, \"--ts\", detail::default_sampling_time);\n\t\tverbose = dcs::cli::simple::get_option(argv, argv+argc, \"--verbose\");\n\t\tvm_uris = dcs::cli::simple::get_options<std::string>(argv, argv+argc, \"--vm-uri\");\n\t\twkl = dcs::cli::simple::get_option<testbed::workload_category>(argv, argv+argc, \"--wkl\", detail::default_workload);\n\t\twkl_driver = dcs::cli::simple::get_option<testbed::workload_generator_category>(argv, argv+argc, \"--wkl-driver\", detail::default_workload_driver);\n\t\twkl_driver_rain_path = dcs::cli::simple::get_option<std::string>(argv, argv+argc, \"--wkl-driver-rain-path\", detail::default_workload_driver_rain_path);\n\t}\n\tcatch (std::exception const& e)\n\t{\n\t\tstd::ostringstream oss;\n\t\toss << \"Error while parsing command-line options: \" << e.what();\n\t\tdcs::log_error(DCS_LOGGING_AT, oss.str());\n\n\t\tdetail::usage(argv[0]);\n\t\tstd::abort();\n\t\treturn EXIT_FAILURE;\n\t}\n\n\tif (help)\n\t{\n\t\tdetail::usage(argv[0]);\n\t\treturn EXIT_SUCCESS;\n\t}\n\n\tint ret(0);\n\n\tif (verbose)\n\t{\n\t\tstd::ostringstream oss;\n\n\t\tfor (std::size_t i = 0; i < vm_uris.size(); ++i)\n\t\t{\n\t\t\tif (i > 0)\n\t\t\t{\n\t\t\t\toss << \", \";\n\t\t\t}\n\t\t\toss << \"VM URI: \" << vm_uris[i];\n\t\t}\n\t\tdcs::log_info(DCS_LOGGING_AT, oss.str());\n\t\toss.str(\"\");\n\n\t\toss << \"Output data file: \" << out_dat_file;\n\t\tdcs::log_info(DCS_LOGGING_AT, oss.str());\n\t\toss.str(\"\");\n\n\t\toss << \"Sampling time: \" << ts;\n\t\tdcs::log_info(DCS_LOGGING_AT, oss.str());\n\t\toss.str(\"\");\n\n\t\toss << \"Workload: \" << wkl;\n\t\tdcs::log_info(DCS_LOGGING_AT, oss.str());\n\t\toss.str(\"\");\n\n\t\toss << \"Workload driver: \" << wkl_driver;\n\t\tdcs::log_info(DCS_LOGGING_AT, oss.str());\n\t\toss.str(\"\");\n\n\t\toss << \"Workload driver RAIN path: \" << wkl_driver_rain_path;\n\t\tdcs::log_info(DCS_LOGGING_AT, oss.str());\n\t\toss.str(\"\");\n\t}\n\n\ttypedef testbed::base_virtual_machine<traits_type> vm_type;\n\ttypedef boost::shared_ptr<vm_type> vm_pointer;\n\ttypedef vm_type::identifier_type vm_identifier_type;\n\ttypedef testbed::base_virtual_machine_manager<traits_type> vmm_type;\n\ttypedef boost::shared_ptr<vmm_type> vmm_pointer;\n\ttypedef vmm_type::identifier_type vmm_identifier_type;\n\ttypedef testbed::base_application<traits_type> app_type;\n\ttypedef boost::shared_ptr<app_type> app_pointer;\n\ttypedef testbed::base_application_manager<traits_type> app_manager_type;\n\ttypedef boost::shared_ptr<app_manager_type> app_manager_pointer;\n\ttypedef testbed::base_workload_driver<traits_type> app_driver_type;\n\ttypedef boost::shared_ptr<app_driver_type> app_driver_pointer;\n\ttypedef testbed::base_arx_system_identification_strategy<traits_type> sysid_strategy_type;\n\ttypedef boost::shared_ptr<sysid_strategy_type> sysid_strategy_pointer;\n\n\ttry\n\t{\n\t\tconst std::size_t nt(vm_uris.size()); \/\/ Number of tiers\n\n\t\ttestbed::system_experiment<traits_type> sys_exp;\n\n\t\t\/\/ Setup application experiment\n\t\t\/\/ - Setup application (and VMs)\n\t\tstd::map<vmm_identifier_type,vmm_pointer> vmm_map;\n\t\tstd::vector<vm_pointer> vms(nt);\n\t\tstd::vector<std::string>::const_iterator uri_end_it(vm_uris.end());\n\t\tfor (std::vector<std::string>::const_iterator it = vm_uris.begin();\n\t\t\t it != uri_end_it;\n\t\t\t ++it)\n\t\t{\n\t\t\tstd::string const& uri(*it);\n\n\t\t\tvmm_pointer p_vmm;\n\t\t\tif (!vmm_map.count(uri) > 0)\n\t\t\t{\n\t\t\t\tp_vmm = boost::make_shared< testbed::libvirt::virtual_machine_manager<traits_type> >(uri);\n\t\t\t\tvmm_map[uri] = p_vmm;\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\tp_vmm = vmm_map.at(uri);\n\t\t\t}\n\n\t\t\tvm_pointer p_vm(p_vmm->vm(uri));\n\t\t\tvms.push_back(p_vm);\n\t\t}\n\t\tapp_pointer p_app = boost::make_shared< testbed::application<traits_type> >(vms.begin(), vms.end());\n\t\tp_app->slo(testbed::response_time_application_performance, detail::rt_slo_checker<real_type>(0.2870));\n\n\t\t\/\/ - Setup workload driver\n\t\tapp_driver_pointer p_drv;\n\t\tswitch (wkl_driver)\n\t\t{\n\t\t\tcase testbed::rain_workload_generator:\n\t\t\t\tp_drv = boost::make_shared< testbed::rain::workload_driver<traits_type> >(wkl, wkl_driver_rain_path);\n\t\t\t\tbreak;\n\t\t}\n\n\t\t\/\/ - Setup application manager\n\t\tapp_manager_pointer p_mgr;\n\t\t\/\/p_mgr = boost::make_shared< testbed::lqry_application_manager<traits_type> >();\n\t\t{\n\t\t\tsysid_strategy_pointer p_sysid_alg = boost::make_shared< testbed::rls_ff_arx_miso_proxy<traits_type> >(2, 2, 1, 1, nt, 0.98);\n\t\t\ttestbed::lqry_application_manager<traits_type> lqry_mgr;\n\t\t\tlqry_mgr.sysid_strategy(p_sysid_alg);\n\t\t\tlqry_mgr.target_value(testbed::response_time_application_performance, 0.1034);\n\n\t\t\tp_mgr = boost::make_shared< testbed::lqry_application_manager<traits_type> >(lqry_mgr);\n\t\t\tp_mgr->sampling_time(static_cast<uint_type>(ts));\n\t\t\tp_mgr->control_time(3*p_mgr->sampling_time());\n\t\t}\n\n\t\t\/\/ Add to main experiment\n\t\tsys_exp.add_app(p_app, p_drv, p_mgr);\n\n\n\t\t\/\/sys_exp.logger(...);\n\t\t\/\/sys_exp.output_data_file(out_dat_file);\n\n\t\tsys_exp.run();\n\t}\n\tcatch (std::exception const& e)\n\t{\n\t\tret = 1;\n\t\tdcs::log_error(DCS_LOGGING_AT, e.what());\n\t}\n\tcatch (...)\n\t{\n\t\tret = 1;\n\t\tdcs::log_error(DCS_LOGGING_AT, \"Unknown error\");\n\t}\n\n\treturn ret;\n}\n<commit_msg>(bug-fix:minor) Forgot to set the response time sensor.<commit_after>\/**\n * \\file sysexp.hpp\n *\n * \\brief Driver for performing system experiments\n *\n * \\author Marco Guazzone (marco.guazzone@gmail.com)\n *\n * <hr\/>\n *\n * Copyright (C) 2012 Marco Guazzone\n * [Distributed Computing System (DCS) Group,\n * Computer Science Institute,\n * Department of Science and Technological Innovation,\n * University of Piemonte Orientale,\n * Alessandria (Italy)]\n *\n * This file is part of dcsxx-testbed.\n *\n * dcsxx-testbed is free software: you can redistribute it and\/or modify\n * it under the terms of the GNU General Public License as published\n * by the Free Software Foundation, either version 3 of the License, or\n * (at your option) any later version.\n *\n * dcsxx-testbed is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the\n * GNU General Public License for more details.\n *\n * You should have received a copy of the GNU General Public License\n * along with dcsxx-testbed. If not, see <http:\/\/www.gnu.org\/licenses\/>.\n *\/\n\n#include <boost\/smart_ptr.hpp>\n#include <cstddef>\n#include <cstdlib>\n#include <cstring>\n#include <dcs\/cli.hpp>\n#include <dcs\/logging.hpp>\n#include <dcs\/math\/traits\/float.hpp>\n#include <dcs\/testbed\/application.hpp>\n#include <dcs\/testbed\/application_managers.hpp>\n#include <dcs\/testbed\/base_application.hpp>\n#include <dcs\/testbed\/system_experiment.hpp>\n#include <dcs\/testbed\/system_identification_strategies.hpp>\n\/\/#include <dcs\/testbed\/system_managers.hpp>\n#include <dcs\/testbed\/traits.hpp>\n#include <dcs\/testbed\/virtual_machine_managers.hpp>\n#include <dcs\/testbed\/virtual_machines.hpp>\n#include <dcs\/testbed\/workload_category.hpp>\n#include <dcs\/testbed\/workload_drivers.hpp>\n#include <dcs\/testbed\/workload_generator_category.hpp>\n#include <iostream>\n#include <limits>\n#include <sstream>\n#include <string>\n#include <stdexcept>\n#include <vector>\n\n\nnamespace detail { namespace \/*<unnamed>*\/ {\n\n\/\/enum aggregation_category\n\/\/{\n\/\/\tmean_aggregation\n\/\/};\n\nconst dcs::testbed::workload_category default_workload(dcs::testbed::olio_workload);\nconst dcs::testbed::workload_generator_category default_workload_driver(dcs::testbed::rain_workload_generator);\nconst ::std::string default_workload_driver_rain_path(\"\/usr\/local\/opt\/rain-workload-toolkit\");\nconst ::std::string default_out_dat_file(\".\/sysmgt-out.dat\");\nconst double default_sampling_time(10);\nconst double default_ewma_smooth_factor(0.9);\n\nvoid usage(char const* progname)\n{\n\t::std::cerr << \"Usage: \" << progname << \" [options]\" << ::std::endl\n\t\t\t\t<< \" --help\" << ::std::endl\n\t\t\t\t<< \" Show this message.\" << ::std::endl\n\t\t\t\t<< \" --out-dat-file <file path>\" << ::std::endl\n\t\t\t\t<< \" The path to the output data file.\" << ::std::endl\n\t\t\t\t<< \" [default: '\" << default_out_dat_file << \"'].\" << ::std::endl\n\t\t\t\t<< \" --ts <time in secs>\" << ::std::endl\n\t\t\t\t<< \" Sampling time (in seconds).\" << ::std::endl\n\t\t\t\t<< \" [default: \" << default_sampling_time << \"].\" << ::std::endl\n\t\t\t\t<< \" --verbose\" << ::std::endl\n\t\t\t\t<< \" Show verbose messages.\" << ::std::endl\n\t\t\t\t<< \" [default: disabled].\" << ::std::endl\n\t\t\t\t<< \" --vm-uri <URI>\" << ::std::endl\n\t\t\t\t<< \" The VM URI to connect.\" << ::std::endl\n\t\t\t\t<< \" Repeat this option as many times as is the number of your VMs.\"\n\t\t\t\t<< \" --wkl <name>\" << ::std::endl\n\t\t\t\t<< \" The workload to generate. Possible values are: 'olio', 'rubis'.\" << ::std::endl\n\t\t\t\t<< \" [default: '\" << default_workload << \"'].\" << ::std::endl\n\t\t\t\t<< \" --wkl-driver <name>\" << ::std::endl\n\t\t\t\t<< \" The workload driver to use. Possible values are: 'rain'.\" << ::std::endl\n\t\t\t\t<< \" [default: '\" << default_workload_driver << \"'].\" << ::std::endl\n\t\t\t\t<< \" --wkl-driver-rain-path <name>\" << ::std::endl\n\t\t\t\t<< \" The full path to the RAIN workload driver.\" << ::std::endl\n\t\t\t\t<< \" [default: '\" << default_workload_driver_rain_path << \"'].\" << ::std::endl\n\t\t\t\t<< ::std::endl;\n}\n\ntemplate <typename RealT>\nstruct rt_slo_checker\n{\n\trt_slo_checker(RealT max_val, RealT rel_tol=0.05)\n\t: max_val_(max_val),\n\t check_val_(max_val_*(1+rel_tol))\n\t{\n\t}\n\n\tbool operator()(RealT val)\n\t{\n\t\treturn ::dcs::math::float_traits<RealT>::approximately_less_equal(val, check_val_);\n\t}\n\n\tprivate: RealT max_val_;\n\tprivate: RealT check_val_;\n};\n\n}} \/\/ Namespace detail::<unnamed>\n\n\nint main(int argc, char *argv[])\n{\n\tnamespace testbed = ::dcs::testbed;\n\n\ttypedef double real_type;\n\ttypedef unsigned int uint_type;\n\ttypedef testbed::traits<real_type,uint_type> traits_type;\n\n\tbool help(false);\n\tstd::string out_dat_file;\n\treal_type ts;\n\tbool verbose(false);\n\ttestbed::workload_category wkl;\n\ttestbed::workload_generator_category wkl_driver;\n\tstd::string wkl_driver_rain_path;\n\tstd::vector<std::string> vm_uris;\n\n\t\/\/ Parse command line options\n\ttry\n\t{\n\t\thelp = dcs::cli::simple::get_option(argv, argv+argc, \"--help\");\n\t\tout_dat_file = dcs::cli::simple::get_option<std::string>(argv, argv+argc, \"--out-dat-file\", detail::default_out_dat_file);\n\t\tts = dcs::cli::simple::get_option<real_type>(argv, argv+argc, \"--ts\", detail::default_sampling_time);\n\t\tverbose = dcs::cli::simple::get_option(argv, argv+argc, \"--verbose\");\n\t\tvm_uris = dcs::cli::simple::get_options<std::string>(argv, argv+argc, \"--vm-uri\");\n\t\twkl = dcs::cli::simple::get_option<testbed::workload_category>(argv, argv+argc, \"--wkl\", detail::default_workload);\n\t\twkl_driver = dcs::cli::simple::get_option<testbed::workload_generator_category>(argv, argv+argc, \"--wkl-driver\", detail::default_workload_driver);\n\t\twkl_driver_rain_path = dcs::cli::simple::get_option<std::string>(argv, argv+argc, \"--wkl-driver-rain-path\", detail::default_workload_driver_rain_path);\n\t}\n\tcatch (std::exception const& e)\n\t{\n\t\tstd::ostringstream oss;\n\t\toss << \"Error while parsing command-line options: \" << e.what();\n\t\tdcs::log_error(DCS_LOGGING_AT, oss.str());\n\n\t\tdetail::usage(argv[0]);\n\t\tstd::abort();\n\t\treturn EXIT_FAILURE;\n\t}\n\n\tif (help)\n\t{\n\t\tdetail::usage(argv[0]);\n\t\treturn EXIT_SUCCESS;\n\t}\n\n\tint ret(0);\n\n\tif (verbose)\n\t{\n\t\tstd::ostringstream oss;\n\n\t\tfor (std::size_t i = 0; i < vm_uris.size(); ++i)\n\t\t{\n\t\t\tif (i > 0)\n\t\t\t{\n\t\t\t\toss << \", \";\n\t\t\t}\n\t\t\toss << \"VM URI: \" << vm_uris[i];\n\t\t}\n\t\tdcs::log_info(DCS_LOGGING_AT, oss.str());\n\t\toss.str(\"\");\n\n\t\toss << \"Output data file: \" << out_dat_file;\n\t\tdcs::log_info(DCS_LOGGING_AT, oss.str());\n\t\toss.str(\"\");\n\n\t\toss << \"Sampling time: \" << ts;\n\t\tdcs::log_info(DCS_LOGGING_AT, oss.str());\n\t\toss.str(\"\");\n\n\t\toss << \"Workload: \" << wkl;\n\t\tdcs::log_info(DCS_LOGGING_AT, oss.str());\n\t\toss.str(\"\");\n\n\t\toss << \"Workload driver: \" << wkl_driver;\n\t\tdcs::log_info(DCS_LOGGING_AT, oss.str());\n\t\toss.str(\"\");\n\n\t\toss << \"Workload driver RAIN path: \" << wkl_driver_rain_path;\n\t\tdcs::log_info(DCS_LOGGING_AT, oss.str());\n\t\toss.str(\"\");\n\t}\n\n\ttypedef testbed::base_virtual_machine<traits_type> vm_type;\n\ttypedef boost::shared_ptr<vm_type> vm_pointer;\n\ttypedef vm_type::identifier_type vm_identifier_type;\n\ttypedef testbed::base_virtual_machine_manager<traits_type> vmm_type;\n\ttypedef boost::shared_ptr<vmm_type> vmm_pointer;\n\ttypedef vmm_type::identifier_type vmm_identifier_type;\n\ttypedef testbed::base_application<traits_type> app_type;\n\ttypedef boost::shared_ptr<app_type> app_pointer;\n\ttypedef testbed::base_application_manager<traits_type> app_manager_type;\n\ttypedef boost::shared_ptr<app_manager_type> app_manager_pointer;\n\ttypedef testbed::base_workload_driver<traits_type> app_driver_type;\n\ttypedef boost::shared_ptr<app_driver_type> app_driver_pointer;\n\ttypedef testbed::base_arx_system_identification_strategy<traits_type> sysid_strategy_type;\n\ttypedef boost::shared_ptr<sysid_strategy_type> sysid_strategy_pointer;\n\n\ttry\n\t{\n\t\tconst std::size_t nt(vm_uris.size()); \/\/ Number of tiers\n\n\t\ttestbed::system_experiment<traits_type> sys_exp;\n\n\t\t\/\/ Setup application experiment\n\t\t\/\/ - Setup application (and VMs)\n\t\tstd::map<vmm_identifier_type,vmm_pointer> vmm_map;\n\t\tstd::vector<vm_pointer> vms(nt);\n\t\tstd::vector<std::string>::const_iterator uri_end_it(vm_uris.end());\n\t\tfor (std::vector<std::string>::const_iterator it = vm_uris.begin();\n\t\t\t it != uri_end_it;\n\t\t\t ++it)\n\t\t{\n\t\t\tstd::string const& uri(*it);\n\n\t\t\tvmm_pointer p_vmm;\n\t\t\tif (!vmm_map.count(uri) > 0)\n\t\t\t{\n\t\t\t\tp_vmm = boost::make_shared< testbed::libvirt::virtual_machine_manager<traits_type> >(uri);\n\t\t\t\tvmm_map[uri] = p_vmm;\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\tp_vmm = vmm_map.at(uri);\n\t\t\t}\n\n\t\t\tvm_pointer p_vm(p_vmm->vm(uri));\n\t\t\tvms.push_back(p_vm);\n\t\t}\n\t\tapp_pointer p_app = boost::make_shared< testbed::application<traits_type> >(vms.begin(), vms.end());\n\t\tp_app->slo(testbed::response_time_application_performance, detail::rt_slo_checker<real_type>(0.2870));\n\n\t\t\/\/ - Setup workload driver\n\t\tapp_driver_pointer p_drv;\n\t\tswitch (wkl_driver)\n\t\t{\n\t\t\tcase testbed::rain_workload_generator:\n\t\t\t\t{\n\t\t\t\t\tboost::shared_ptr< testbed::rain::workload_driver<traits_type> > p_drv_impl = boost::make_shared< testbed::rain::workload_driver<traits_type> >(wkl, wkl_driver_rain_path);\n\t\t\t\t\tp_app->register_sensor(testbed::response_time_application_performance, p_drv_impl->sensor(testbed::response_time_application_performance));\n\t\t\t\t\t\/\/p_drv = boost::make_shared< testbed::rain::workload_driver<traits_type> >(drv_impl);\n\t\t\t\t\tp_drv = p_drv_impl;\n\t\t\t\t}\n\t\t\t\tbreak;\n\t\t}\n\n\t\t\/\/ - Setup application manager\n\t\tapp_manager_pointer p_mgr;\n\t\t\/\/p_mgr = boost::make_shared< testbed::lqry_application_manager<traits_type> >();\n\t\t{\n\t\t\tsysid_strategy_pointer p_sysid_alg = boost::make_shared< testbed::rls_ff_arx_miso_proxy<traits_type> >(2, 2, 1, 1, nt, 0.98);\n\t\t\ttestbed::lqry_application_manager<traits_type> lqry_mgr;\n\t\t\tlqry_mgr.sysid_strategy(p_sysid_alg);\n\t\t\tlqry_mgr.target_value(testbed::response_time_application_performance, 0.1034);\n\n\t\t\tp_mgr = boost::make_shared< testbed::lqry_application_manager<traits_type> >(lqry_mgr);\n\t\t\tp_mgr->sampling_time(static_cast<uint_type>(ts));\n\t\t\tp_mgr->control_time(3*p_mgr->sampling_time());\n\t\t}\n\n\t\t\/\/ Add to main experiment\n\t\tsys_exp.add_app(p_app, p_drv, p_mgr);\n\n\n\t\t\/\/sys_exp.logger(...);\n\t\t\/\/sys_exp.output_data_file(out_dat_file);\n\n\t\tsys_exp.run();\n\t}\n\tcatch (std::exception const& e)\n\t{\n\t\tret = 1;\n\t\tdcs::log_error(DCS_LOGGING_AT, e.what());\n\t}\n\tcatch (...)\n\t{\n\t\tret = 1;\n\t\tdcs::log_error(DCS_LOGGING_AT, \"Unknown error\");\n\t}\n\n\treturn ret;\n}\n<|endoftext|>"} {"text":"<commit_before>\/*******************************************************************************\n * c7a\/core\/stage_builder.hpp\n *\n * Part of Project c7a.\n *\n *\n * This file has no license. Only Chuck Norris can compile it.\n ******************************************************************************\/\n\n#pragma once\n#ifndef C7A_CORE_STAGE_BUILDER_HEADER\n#define C7A_CORE_STAGE_BUILDER_HEADER\n\n#include <c7a\/api\/dia_base.hpp>\n#include <c7a\/common\/logger.hpp>\n\n#include <stack>\n#include <string>\n#include <utility>\n#include <algorithm>\n#include <set>\n#include <vector>\n\nnamespace c7a {\nnamespace core {\n\nclass Stage\n{\npublic:\n explicit Stage(DIABase* node) : node_(node) {\n LOG << \"CREATING stage\" << node_->ToString() << \"node\" << node_;\n }\n void Run() {\n LOG << \"RUNNING stage \" << node_->ToString() << \"node\" << node_;\n node_->execute();\n }\n\nprivate: \n \n static const bool debug = false;\n DIABase* node_;\n};\n\nclass StageBuilder\n{\npublic:\n void FindStages(DIABase* action, std::vector<Stage>& stages_result) {\n LOG1 << \"FINDING stages:\";\n std::set<const DIABase*> stages_found;\n \/\/ Do a reverse DFS and find all stages\n std::stack<DIABase*> dia_stack;\n dia_stack.push(action);\n stages_found.insert(action);\n while (!dia_stack.empty()) {\n DIABase* curr = dia_stack.top();\n dia_stack.pop();\n stages_result.emplace_back(Stage(curr));\n const std::vector<DIABase*> parents = curr->get_parents();\n for (DIABase* p : parents) {\n \/\/ if p is not a nullpointer and p is not cached mark it and save stage\n if (p && (stages_found.find(p) == stages_found.end()) && p->state() != CACHED) {\n dia_stack.push(p);\n stages_found.insert(p);\n }\n else LOG1 << \"OMG NULLPTR\";\n\n }\n\n void RunScope(DIABase* action) {\n std::vector<Stage> result;\n FindStages(action, result);\n for (auto s : result)\n {\n s.Run();\n }\n }\n};\n} \/\/ namespace core\n} \/\/ namespace c7a\n\n#endif \/\/ !C7A_CORE_STAGE_BUILDER_HEADER\n\n\/******************************************************************************\/\n<commit_msg>Actually commit fix for merge failure.<commit_after>\/*******************************************************************************\n * c7a\/core\/stage_builder.hpp\n *\n * Part of Project c7a.\n *\n *\n * This file has no license. Only Chuck Norris can compile it.\n ******************************************************************************\/\n\n#pragma once\n#ifndef C7A_CORE_STAGE_BUILDER_HEADER\n#define C7A_CORE_STAGE_BUILDER_HEADER\n\n#include <c7a\/api\/dia_base.hpp>\n#include <c7a\/common\/logger.hpp>\n\n#include <stack>\n#include <string>\n#include <utility>\n#include <algorithm>\n#include <set>\n#include <vector>\n\nnamespace c7a {\nnamespace core {\n\nclass Stage\n{\npublic:\n explicit Stage(DIABase* node) : node_(node) {\n LOG << \"CREATING stage\" << node_->ToString() << \"node\" << node_;\n }\n void Run() {\n LOG << \"RUNNING stage \" << node_->ToString() << \"node\" << node_;\n node_->execute();\n }\n\nprivate: \n \n static const bool debug = false;\n DIABase* node_;\n};\n\nclass StageBuilder\n{\npublic:\n void FindStages(DIABase* action, std::vector<Stage>& stages_result) {\n LOG1 << \"FINDING stages:\";\n std::set<const DIABase*> stages_found;\n \/\/ Do a reverse DFS and find all stages\n std::stack<DIABase*> dia_stack;\n dia_stack.push(action);\n stages_found.insert(action);\n while (!dia_stack.empty()) {\n DIABase* curr = dia_stack.top();\n dia_stack.pop();\n stages_result.emplace_back(Stage(curr));\n const std::vector<DIABase*> parents = curr->get_parents();\n for (DIABase* p : parents) {\n \/\/ if p is not a nullpointer and p is not cached mark it and save stage\n if (p && (stages_found.find(p) == stages_found.end()) && p->state() != CACHED) {\n dia_stack.push(p);\n stages_found.insert(p);\n }\n else LOG1 << \"OMG NULLPTR\";\n\t }\n\t}\n }\n\n void RunScope(DIABase* action) {\n std::vector<Stage> result;\n FindStages(action, result);\n for (auto s : result)\n {\n s.Run();\n }\n }\n};\n} \/\/ namespace core\n} \/\/ namespace c7a\n\n#endif \/\/ !C7A_CORE_STAGE_BUILDER_HEADER\n\n\/******************************************************************************\/\n<|endoftext|>"} {"text":"<commit_before>#include \"AsioTcpSocket.hpp\"\n#include \"AsioService.hpp\"\n#include \"..\/MemoryFile.hpp\"\n#include \"..\/PartFile.hpp\"\n#include \"..\/CriticalCode.hpp\"\n#include <boost\/bind.hpp>\n\nBEGIN_INANITY_NET\n\nconst size_t AsioTcpSocket::receiveFileSize = 0x1000;\n\nAsioTcpSocket::SendItem::SendItem(ptr<File> data, ptr<SendHandler> handler)\n: data(data), handler(handler) {}\n\n\/\/\/ Вспомогательный класс последовательности буферов.\n\/** Удовлетворяет требованиям Asio к ConstBufferSequence. *\/\nclass AsioTcpSocket::Buffers\n{\nprivate:\n\ttypedef std::deque<SendItem>::const_iterator InternalIterator;\n\npublic:\n\t\/\/\/ Класс буфера.\n\tclass Buffer\n\t{\n\tprivate:\n\t\t\/\/\/ Файл с данными.\n\t\tptr<File> file;\n\t\t\/\/\/ Смещение от начала, которое нужно пропустить.\n\t\tsize_t skip;\n\n\tpublic:\n\t\tBuffer(ptr<File> file, size_t skip) : file(file), skip(skip) {}\n\n\t\toperator boost::asio::const_buffer() const\n\t\t{\n\t\t\treturn boost::asio::const_buffer((const void*)*this, (size_t)*this);\n\t\t}\n\n\t\toperator const void*() const\n\t\t{\n\t\t\treturn (const char*)file->GetData() + skip;\n\t\t}\n\n\t\toperator size_t() const\n\t\t{\n\t\t\treturn file->GetSize() - skip;\n\t\t}\n\t};\n\n\ttypedef Buffer value_type;\n\n\t\/\/\/ Класс константного итератора.\n\tclass ConstIterator\n\t{\n\tprivate:\n\t\tconst Buffers& buffers;\n\t\tInternalIterator it;\n\n\tpublic:\n\t\tConstIterator(const Buffers& buffers, InternalIterator it) : buffers(buffers), it(it) {}\n\n\t\tconst Buffer operator*() const\n\t\t{\n\t\t\treturn Buffer(it->data, it == buffers.beginIt ? buffers.firstSkip : 0);\n\t\t}\n\t\tConstIterator& operator++()\n\t\t{\n\t\t\t++it;\n\t\t\treturn *this;\n\t\t}\n\t\tConstIterator operator++(int)\n\t\t{\n\t\t\tConstIterator temp(*this);\n\t\t\t++it;\n\t\t\treturn temp;\n\t\t}\n\t\tConstIterator& operator--()\n\t\t{\n\t\t\t--it;\n\t\t\treturn *this;\n\t\t}\n\t\tConstIterator operator--(int)\n\t\t{\n\t\t\tConstIterator temp(*this);\n\t\t\t--it;\n\t\t\treturn temp;\n\t\t}\n\t\tfriend bool operator==(const ConstIterator& a, const ConstIterator& b)\n\t\t{\n\t\t\treturn a.it == b.it;\n\t\t}\n\t\tfriend bool operator!=(const ConstIterator& a, const ConstIterator& b)\n\t\t{\n\t\t\treturn a.it != b.it;\n\t\t}\n\t};\n\n\ttypedef ConstIterator const_iterator;\n\nprivate:\n\t\/\/ Границы посылки.\n\tInternalIterator beginIt, endIt;\n\t\/\/\/ Сколько следует пропустить от начала первого буфера.\n\tsize_t firstSkip;\n\npublic:\n\tBuffers(InternalIterator begin, InternalIterator end, size_t firstSkip)\n\t: beginIt(begin), endIt(end), firstSkip(firstSkip) {}\n\n\tConstIterator begin() const\n\t{\n\t\treturn ConstIterator(*this, beginIt);\n\t}\n\tConstIterator end() const\n\t{\n\t\treturn ConstIterator(*this, endIt);\n\t}\n};\n\n\/\/\/ Вспомогательный класс для обработчика завершения отправки.\nclass AsioTcpSocket::SentBinder\n{\nprivate:\n\tptr<AsioTcpSocket> socket;\n\npublic:\n\tSentBinder(ptr<AsioTcpSocket> socket) : socket(socket) {}\n\n\tvoid operator()(const boost::system::error_code& error, size_t transferred) const\n\t{\n\t\tsocket->Sent(error, transferred);\n\t}\n};\n\n\/\/\/ Вспомогательный класс для обработчика принятия данных.\nclass AsioTcpSocket::ReceivedBinder\n{\nprivate:\n\tptr<AsioTcpSocket> socket;\n\npublic:\n\tReceivedBinder(ptr<AsioTcpSocket> socket) : socket(socket) {}\n\n\tvoid operator()(const boost::system::error_code& error, size_t transferred) const\n\t{\n\t\tsocket->Received(error, transferred);\n\t}\n};\n\nAsioTcpSocket::AsioTcpSocket(ptr<AsioService> service)\n\t: service(service), socket(service->GetIoService()),\n\tfirstItemSent(0), sendClosed(false) {}\n\nboost::asio::ip::tcp::socket& AsioTcpSocket::GetSocket()\n{\n\treturn socket;\n}\n\nvoid AsioTcpSocket::StartSending()\n{\n\t\/\/ если в очереди ничего нет, проверить, не нужно ли закрыть сокет\n\tif(sendQueue.empty())\n\t{\n\t\tif(sendClosed)\n\t\t\ttry\n\t\t\t{\n\t\t\t\tsocket.shutdown(boost::asio::ip::tcp::socket::shutdown_send);\n\t\t\t}\n\t\t\tcatch(boost::system::system_error error)\n\t\t\t{\n\t\t\t\tTHROW_SECONDARY(\"Can't close Asio TCP socket\", AsioService::ConvertError(error));\n\t\t\t}\n\t}\n\telse\n\t{\n\t\t\/\/ очередь не пуста, начинаем отправку\n\t\tsocket.async_write_some(Buffers(sendQueue.begin(), sendQueue.end(), firstItemSent), SentBinder(this));\n\t}\n}\n\nvoid AsioTcpSocket::Sent(const boost::system::error_code& error, size_t transferred)\n{\n\t\/\/ если произошла ошибка\n\tif(error)\n\t{\n\t\tptr<Exception> exception = AsioService::ConvertError(error);\n\n\t\t\/\/ отправить её всем элементам в очереди, и очистить очередь\n\n\t\t\/\/ скопируем обработчики в вектор, чтобы вызывать их\n\t\t\/\/ вне блокировки, и обеспечить реентрантность\n\t\tstd::vector<ptr<SendHandler> > handlers;\n\t\t{\n\t\t\tCriticalCode cc(cs);\n\t\t\thandlers.resize(sendQueue.size());\n\t\t\tsize_t j = 0;\n\t\t\tfor(std::deque<SendItem>::iterator i = sendQueue.begin(); i != sendQueue.end(); ++i)\n\t\t\t\thandlers[j++] = i->handler;\n\t\t\tsendQueue.clear();\n\t\t}\n\n\t\tfor(size_t j = 0; j < handlers.size(); ++j)\n\t\t\tif(handlers[j])\n\t\t\t\thandlers[j]->FireError(exception);\n\n\t\treturn;\n\t}\n\t\/\/ ошибки нет\n\telse\n\t{\n\t\t\/\/ уведомить все завершившиеся файлы, и удалить их из очереди\n\n\t\t\/\/ скопируем обработчики в вектор, чтобы вызывать их\n\t\t\/\/ вне блокировки, и обеспечить реентрантность\n\t\tstd::vector<ptr<SendHandler> > handlers;\n\t\t{\n\t\t\tCriticalCode cc(cs);\n\t\t\tstd::deque<SendItem>::iterator i;\n\t\t\tsize_t j = 0;\n\t\t\tfor(i = sendQueue.begin(); i != sendQueue.end(); ++i)\n\t\t\t{\n\t\t\t\tconst SendItem& item = *i;\n\t\t\t\t\/\/ если элемент не передался полностью, закончить\n\t\t\t\tsize_t itemDataSkip = i == sendQueue.begin() ? firstItemSent : 0;\n\t\t\t\tsize_t itemSize = item.data->GetSize() - itemDataSkip;\n\t\t\t\tif(itemSize > transferred)\n\t\t\t\t{\n\t\t\t\t\t\/\/ этот элемент теперь будет первым, выставить новое смещение\n\t\t\t\t\tfirstItemSent = itemDataSkip + transferred;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t\t\/\/ иначе передался полностью\n\t\t\t\ttransferred -= itemSize;\n\t\t\t\t\/\/ добавить обработчик в массив\n\t\t\t\tif(item.handler)\n\t\t\t\t\thandlers.push_back(item.handler);\n\t\t\t}\n\t\t\t\/\/ теперь i указывает на первый элемент, который ещё не передался\n\t\t\t\/\/ удалить всё, что до него\n\t\t\tsendQueue.erase(sendQueue.begin(), i);\n\n\t\t\t\/\/ если в очереди что-то есть, запустить отправку снова\n\t\t\tStartSending();\n\t\t}\n\n\t\tfor(size_t j = 0; j < handlers.size(); ++j)\n\t\t\thandlers[j]->FireSuccess();\n\t}\n}\n\nvoid AsioTcpSocket::StartReceiving()\n{\n\treceiveFile = NEW(MemoryFile(receiveFileSize));\n\tsocket.async_read_some(boost::asio::buffer(receiveFile->GetData(), receiveFileSize), ReceivedBinder(this));\n}\n\nvoid AsioTcpSocket::Received(const boost::system::error_code& error, size_t transferred)\n{\n\tptr<ReceiveHandler> receiveHandler;\n\tptr<File> receiveFile;\n\n\t{\n\t\tCriticalCode cc(cs);\n\n\t\treceiveHandler = this->receiveHandler;\n\t\treceiveFile = this->receiveFile;\n\n\t\tif(error)\n\t\t{\n\t\t\tCloseNonSynced();\n\t\t\tthis->receiveHandler = 0;\n\t\t\tthis->receiveFile = 0;\n\t\t}\n\t\telse\n\t\t\tStartReceiving();\n\t}\n\n\tif(receiveHandler)\n\t{\n\t\tif(error)\n\t\t{\n\t\t\t\/\/ если корректный конец файла, это не ошибка\n\t\t\tif(error == boost::asio::error::eof)\n\t\t\t\treceiveHandler->FireData(0);\n\t\t\telse\n\t\t\t\treceiveHandler->FireError(AsioService::ConvertError(error));\n\t\t}\n\t\telse\n\t\t\treceiveHandler->FireData(NEW(PartFile(receiveFile, receiveFile->GetData(), transferred)));\n\t}\n}\n\nvoid AsioTcpSocket::CloseNonSynced()\n{\n\ttry\n\t{\n\t\tsocket.close();\n\t}\n\tcatch(boost::system::system_error error)\n\t{\n\t}\n}\n\nvoid AsioTcpSocket::Send(ptr<File> file, ptr<SendHandler> sendHandler)\n{\n\ttry\n\t{\n\t\tCriticalCode cc(cs);\n\n\t\t\/\/ если запланировано закрытие передачи, то больше в очередь добавлять ничего нельзя\n\t\tif(sendClosed)\n\t\t\tTHROW(\"Sending closed\");\n\n\t\tbool queueWasEmpty = sendQueue.empty();\n\n\t\t\/\/ добавить элемент в очередь\n\t\tsendQueue.push_back(SendItem(file, sendHandler));\n\n\t\t\/\/ сбросить количество переданных данных в первом элементе,\n\t\t\/\/ если очередь была пуста (то есть первый элемент как раз\n\t\t\/\/ был добавлен)\n\t\t\/\/ также, если очередь была пуста, начать отправку\n\t\tif(queueWasEmpty)\n\t\t{\n\t\t\tfirstItemSent = 0;\n\t\t\tStartSending();\n\t\t}\n\t}\n\tcatch(Exception* exception)\n\t{\n\t\tTHROW_SECONDARY(\"Can't send data to Asio TCP socket\", exception);\n\t}\n}\n\nvoid AsioTcpSocket::End()\n{\n\tCriticalCode cc(cs);\n\n\tif(!sendClosed)\n\t{\n\t\tsendClosed = true;\n\n\t\tif(sendQueue.empty())\n\t\t\tStartSending();\n\t}\n}\n\nvoid AsioTcpSocket::SetReceiveHandler(ptr<ReceiveHandler> receiveHandler)\n{\n\tCriticalCode cc(cs);\n\n\tbool firstTime = !this->receiveHandler;\n\tthis->receiveHandler = receiveHandler;\n\n\tif(firstTime)\n\t\t\/\/ запустить приём\n\t\tStartReceiving();\n}\n\nvoid AsioTcpSocket::Close()\n{\n\tCriticalCode cc(cs);\n\n\tCloseNonSynced();\n}\n\nEND_INANITY_NET\n<commit_msg>remove unneeded variable<commit_after>#include \"AsioTcpSocket.hpp\"\n#include \"AsioService.hpp\"\n#include \"..\/MemoryFile.hpp\"\n#include \"..\/PartFile.hpp\"\n#include \"..\/CriticalCode.hpp\"\n#include <boost\/bind.hpp>\n\nBEGIN_INANITY_NET\n\nconst size_t AsioTcpSocket::receiveFileSize = 0x1000;\n\nAsioTcpSocket::SendItem::SendItem(ptr<File> data, ptr<SendHandler> handler)\n: data(data), handler(handler) {}\n\n\/\/\/ Вспомогательный класс последовательности буферов.\n\/** Удовлетворяет требованиям Asio к ConstBufferSequence. *\/\nclass AsioTcpSocket::Buffers\n{\nprivate:\n\ttypedef std::deque<SendItem>::const_iterator InternalIterator;\n\npublic:\n\t\/\/\/ Класс буфера.\n\tclass Buffer\n\t{\n\tprivate:\n\t\t\/\/\/ Файл с данными.\n\t\tptr<File> file;\n\t\t\/\/\/ Смещение от начала, которое нужно пропустить.\n\t\tsize_t skip;\n\n\tpublic:\n\t\tBuffer(ptr<File> file, size_t skip) : file(file), skip(skip) {}\n\n\t\toperator boost::asio::const_buffer() const\n\t\t{\n\t\t\treturn boost::asio::const_buffer((const void*)*this, (size_t)*this);\n\t\t}\n\n\t\toperator const void*() const\n\t\t{\n\t\t\treturn (const char*)file->GetData() + skip;\n\t\t}\n\n\t\toperator size_t() const\n\t\t{\n\t\t\treturn file->GetSize() - skip;\n\t\t}\n\t};\n\n\ttypedef Buffer value_type;\n\n\t\/\/\/ Класс константного итератора.\n\tclass ConstIterator\n\t{\n\tprivate:\n\t\tconst Buffers& buffers;\n\t\tInternalIterator it;\n\n\tpublic:\n\t\tConstIterator(const Buffers& buffers, InternalIterator it) : buffers(buffers), it(it) {}\n\n\t\tconst Buffer operator*() const\n\t\t{\n\t\t\treturn Buffer(it->data, it == buffers.beginIt ? buffers.firstSkip : 0);\n\t\t}\n\t\tConstIterator& operator++()\n\t\t{\n\t\t\t++it;\n\t\t\treturn *this;\n\t\t}\n\t\tConstIterator operator++(int)\n\t\t{\n\t\t\tConstIterator temp(*this);\n\t\t\t++it;\n\t\t\treturn temp;\n\t\t}\n\t\tConstIterator& operator--()\n\t\t{\n\t\t\t--it;\n\t\t\treturn *this;\n\t\t}\n\t\tConstIterator operator--(int)\n\t\t{\n\t\t\tConstIterator temp(*this);\n\t\t\t--it;\n\t\t\treturn temp;\n\t\t}\n\t\tfriend bool operator==(const ConstIterator& a, const ConstIterator& b)\n\t\t{\n\t\t\treturn a.it == b.it;\n\t\t}\n\t\tfriend bool operator!=(const ConstIterator& a, const ConstIterator& b)\n\t\t{\n\t\t\treturn a.it != b.it;\n\t\t}\n\t};\n\n\ttypedef ConstIterator const_iterator;\n\nprivate:\n\t\/\/ Границы посылки.\n\tInternalIterator beginIt, endIt;\n\t\/\/\/ Сколько следует пропустить от начала первого буфера.\n\tsize_t firstSkip;\n\npublic:\n\tBuffers(InternalIterator begin, InternalIterator end, size_t firstSkip)\n\t: beginIt(begin), endIt(end), firstSkip(firstSkip) {}\n\n\tConstIterator begin() const\n\t{\n\t\treturn ConstIterator(*this, beginIt);\n\t}\n\tConstIterator end() const\n\t{\n\t\treturn ConstIterator(*this, endIt);\n\t}\n};\n\n\/\/\/ Вспомогательный класс для обработчика завершения отправки.\nclass AsioTcpSocket::SentBinder\n{\nprivate:\n\tptr<AsioTcpSocket> socket;\n\npublic:\n\tSentBinder(ptr<AsioTcpSocket> socket) : socket(socket) {}\n\n\tvoid operator()(const boost::system::error_code& error, size_t transferred) const\n\t{\n\t\tsocket->Sent(error, transferred);\n\t}\n};\n\n\/\/\/ Вспомогательный класс для обработчика принятия данных.\nclass AsioTcpSocket::ReceivedBinder\n{\nprivate:\n\tptr<AsioTcpSocket> socket;\n\npublic:\n\tReceivedBinder(ptr<AsioTcpSocket> socket) : socket(socket) {}\n\n\tvoid operator()(const boost::system::error_code& error, size_t transferred) const\n\t{\n\t\tsocket->Received(error, transferred);\n\t}\n};\n\nAsioTcpSocket::AsioTcpSocket(ptr<AsioService> service)\n\t: service(service), socket(service->GetIoService()),\n\tfirstItemSent(0), sendClosed(false) {}\n\nboost::asio::ip::tcp::socket& AsioTcpSocket::GetSocket()\n{\n\treturn socket;\n}\n\nvoid AsioTcpSocket::StartSending()\n{\n\t\/\/ если в очереди ничего нет, проверить, не нужно ли закрыть сокет\n\tif(sendQueue.empty())\n\t{\n\t\tif(sendClosed)\n\t\t\ttry\n\t\t\t{\n\t\t\t\tsocket.shutdown(boost::asio::ip::tcp::socket::shutdown_send);\n\t\t\t}\n\t\t\tcatch(boost::system::system_error error)\n\t\t\t{\n\t\t\t\tTHROW_SECONDARY(\"Can't close Asio TCP socket\", AsioService::ConvertError(error));\n\t\t\t}\n\t}\n\telse\n\t{\n\t\t\/\/ очередь не пуста, начинаем отправку\n\t\tsocket.async_write_some(Buffers(sendQueue.begin(), sendQueue.end(), firstItemSent), SentBinder(this));\n\t}\n}\n\nvoid AsioTcpSocket::Sent(const boost::system::error_code& error, size_t transferred)\n{\n\t\/\/ если произошла ошибка\n\tif(error)\n\t{\n\t\tptr<Exception> exception = AsioService::ConvertError(error);\n\n\t\t\/\/ отправить её всем элементам в очереди, и очистить очередь\n\n\t\t\/\/ скопируем обработчики в вектор, чтобы вызывать их\n\t\t\/\/ вне блокировки, и обеспечить реентрантность\n\t\tstd::vector<ptr<SendHandler> > handlers;\n\t\t{\n\t\t\tCriticalCode cc(cs);\n\t\t\thandlers.resize(sendQueue.size());\n\t\t\tsize_t j = 0;\n\t\t\tfor(std::deque<SendItem>::iterator i = sendQueue.begin(); i != sendQueue.end(); ++i)\n\t\t\t\thandlers[j++] = i->handler;\n\t\t\tsendQueue.clear();\n\t\t}\n\n\t\tfor(size_t j = 0; j < handlers.size(); ++j)\n\t\t\tif(handlers[j])\n\t\t\t\thandlers[j]->FireError(exception);\n\n\t\treturn;\n\t}\n\t\/\/ ошибки нет\n\telse\n\t{\n\t\t\/\/ уведомить все завершившиеся файлы, и удалить их из очереди\n\n\t\t\/\/ скопируем обработчики в вектор, чтобы вызывать их\n\t\t\/\/ вне блокировки, и обеспечить реентрантность\n\t\tstd::vector<ptr<SendHandler> > handlers;\n\t\t{\n\t\t\tCriticalCode cc(cs);\n\t\t\tstd::deque<SendItem>::iterator i;\n\t\t\tfor(i = sendQueue.begin(); i != sendQueue.end(); ++i)\n\t\t\t{\n\t\t\t\tconst SendItem& item = *i;\n\t\t\t\t\/\/ если элемент не передался полностью, закончить\n\t\t\t\tsize_t itemDataSkip = i == sendQueue.begin() ? firstItemSent : 0;\n\t\t\t\tsize_t itemSize = item.data->GetSize() - itemDataSkip;\n\t\t\t\tif(itemSize > transferred)\n\t\t\t\t{\n\t\t\t\t\t\/\/ этот элемент теперь будет первым, выставить новое смещение\n\t\t\t\t\tfirstItemSent = itemDataSkip + transferred;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t\t\/\/ иначе передался полностью\n\t\t\t\ttransferred -= itemSize;\n\t\t\t\t\/\/ добавить обработчик в массив\n\t\t\t\tif(item.handler)\n\t\t\t\t\thandlers.push_back(item.handler);\n\t\t\t}\n\t\t\t\/\/ теперь i указывает на первый элемент, который ещё не передался\n\t\t\t\/\/ удалить всё, что до него\n\t\t\tsendQueue.erase(sendQueue.begin(), i);\n\n\t\t\t\/\/ если в очереди что-то есть, запустить отправку снова\n\t\t\tStartSending();\n\t\t}\n\n\t\tfor(size_t j = 0; j < handlers.size(); ++j)\n\t\t\thandlers[j]->FireSuccess();\n\t}\n}\n\nvoid AsioTcpSocket::StartReceiving()\n{\n\treceiveFile = NEW(MemoryFile(receiveFileSize));\n\tsocket.async_read_some(boost::asio::buffer(receiveFile->GetData(), receiveFileSize), ReceivedBinder(this));\n}\n\nvoid AsioTcpSocket::Received(const boost::system::error_code& error, size_t transferred)\n{\n\tptr<ReceiveHandler> receiveHandler;\n\tptr<File> receiveFile;\n\n\t{\n\t\tCriticalCode cc(cs);\n\n\t\treceiveHandler = this->receiveHandler;\n\t\treceiveFile = this->receiveFile;\n\n\t\tif(error)\n\t\t{\n\t\t\tCloseNonSynced();\n\t\t\tthis->receiveHandler = 0;\n\t\t\tthis->receiveFile = 0;\n\t\t}\n\t\telse\n\t\t\tStartReceiving();\n\t}\n\n\tif(receiveHandler)\n\t{\n\t\tif(error)\n\t\t{\n\t\t\t\/\/ если корректный конец файла, это не ошибка\n\t\t\tif(error == boost::asio::error::eof)\n\t\t\t\treceiveHandler->FireData(0);\n\t\t\telse\n\t\t\t\treceiveHandler->FireError(AsioService::ConvertError(error));\n\t\t}\n\t\telse\n\t\t\treceiveHandler->FireData(NEW(PartFile(receiveFile, receiveFile->GetData(), transferred)));\n\t}\n}\n\nvoid AsioTcpSocket::CloseNonSynced()\n{\n\ttry\n\t{\n\t\tsocket.close();\n\t}\n\tcatch(boost::system::system_error error)\n\t{\n\t}\n}\n\nvoid AsioTcpSocket::Send(ptr<File> file, ptr<SendHandler> sendHandler)\n{\n\ttry\n\t{\n\t\tCriticalCode cc(cs);\n\n\t\t\/\/ если запланировано закрытие передачи, то больше в очередь добавлять ничего нельзя\n\t\tif(sendClosed)\n\t\t\tTHROW(\"Sending closed\");\n\n\t\tbool queueWasEmpty = sendQueue.empty();\n\n\t\t\/\/ добавить элемент в очередь\n\t\tsendQueue.push_back(SendItem(file, sendHandler));\n\n\t\t\/\/ сбросить количество переданных данных в первом элементе,\n\t\t\/\/ если очередь была пуста (то есть первый элемент как раз\n\t\t\/\/ был добавлен)\n\t\t\/\/ также, если очередь была пуста, начать отправку\n\t\tif(queueWasEmpty)\n\t\t{\n\t\t\tfirstItemSent = 0;\n\t\t\tStartSending();\n\t\t}\n\t}\n\tcatch(Exception* exception)\n\t{\n\t\tTHROW_SECONDARY(\"Can't send data to Asio TCP socket\", exception);\n\t}\n}\n\nvoid AsioTcpSocket::End()\n{\n\tCriticalCode cc(cs);\n\n\tif(!sendClosed)\n\t{\n\t\tsendClosed = true;\n\n\t\tif(sendQueue.empty())\n\t\t\tStartSending();\n\t}\n}\n\nvoid AsioTcpSocket::SetReceiveHandler(ptr<ReceiveHandler> receiveHandler)\n{\n\tCriticalCode cc(cs);\n\n\tbool firstTime = !this->receiveHandler;\n\tthis->receiveHandler = receiveHandler;\n\n\tif(firstTime)\n\t\t\/\/ запустить приём\n\t\tStartReceiving();\n}\n\nvoid AsioTcpSocket::Close()\n{\n\tCriticalCode cc(cs);\n\n\tCloseNonSynced();\n}\n\nEND_INANITY_NET\n<|endoftext|>"} {"text":"<commit_before><commit_msg>Fix typo<commit_after><|endoftext|>"} {"text":"<commit_before>\/*\n * The Apache Software License, Version 1.1\n *\n * Copyright (c) 2001-2002 The Apache Software Foundation. All rights\n * reserved.\n *\n * Redistribution and use in source and binary forms, with or without\n * modification, are permitted provided that the following conditions\n * are met:\n *\n * 1. Redistributions of source code must retain the above copyright\n * notice, this list of conditions and the following disclaimer.\n *\n * 2. Redistributions in binary form must reproduce the above copyright\n * notice, this list of conditions and the following disclaimer in\n * the documentation and\/or other materials provided with the\n * distribution.\n *\n * 3. The end-user documentation included with the redistribution,\n * if any, must include the following acknowledgment:\n * \"This product includes software developed by the\n * Apache Software Foundation (http:\/\/www.apache.org\/).\"\n * Alternately, this acknowledgment may appear in the software itself,\n * if and wherever such third-party acknowledgments normally appear.\n *\n * 4. The names \"Xerces\" and \"Apache Software Foundation\" must\n * not be used to endorse or promote products derived from this\n * software without prior written permission. For written\n * permission, please contact apache\\@apache.org.\n *\n * 5. Products derived from this software may not be called \"Apache\",\n * nor may \"Apache\" appear in their name, without prior written\n * permission of the Apache Software Foundation.\n *\n * THIS SOFTWARE IS PROVIDED ``AS IS'' AND ANY EXPRESSED OR IMPLIED\n * WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES\n * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE\n * DISCLAIMED. IN NO EVENT SHALL THE APACHE SOFTWARE FOUNDATION OR\n * ITS CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,\n * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT\n * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF\n * USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND\n * ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,\n * OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT\n * OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF\n * SUCH DAMAGE.\n * ====================================================================\n *\n * This software consists of voluntary contributions made by many\n * individuals on behalf of the Apache Software Foundation, and was\n * originally based on software copyright (c) 2001, International\n * Business Machines, Inc., http:\/\/www.ibm.com . For more information\n * on the Apache Software Foundation, please see\n * <http:\/\/www.apache.org\/>.\n *\/\n\n\/*\n * $Id$\n *\/\n\n#include <xercesc\/util\/XercesDefs.hpp>\n#include <xercesc\/dom\/DOMException.hpp>\n#include <xercesc\/dom\/DOMNode.hpp>\n\n#include \"DOMDocumentImpl.hpp\"\n#include \"DOMNodeListImpl.hpp\"\n#include \"DOMRangeImpl.hpp\"\n#include \"DOMParentNode.hpp\"\n#include \"DOMCasts.hpp\"\n\n\nDOMParentNode::DOMParentNode(DOMDocument *ownerDoc)\n : fOwnerDocument(ownerDoc), fChildNodeList(castToNode(this))\n{\n fFirstChild = 0;\n};\n\n\/\/ This only makes a shallow copy, cloneChildren must also be called for a\n\/\/ deep clone\nDOMParentNode::DOMParentNode(const DOMParentNode &other) :\n fChildNodeList(castToNode(this))\n{\n this->fOwnerDocument = other.fOwnerDocument;\n\n \/\/ Need to break the association w\/ original kids\n this->fFirstChild = 0;\n};\n\nvoid DOMParentNode::changed()\n{\n DOMDocumentImpl *doc = (DOMDocumentImpl *)(castToNodeImpl(this)->getOwnerDocument());\n doc->changed();\n}\n\n\nint DOMParentNode::changes() const\n{\n DOMDocumentImpl *doc = (DOMDocumentImpl *)(castToNodeImpl(this)->getOwnerDocument());\n return doc->changes();\n};\n\n\nDOMNode * DOMParentNode::appendChild(DOMNode *newChild)\n{\n return insertBefore(newChild, 0);\n};\n\n\nvoid DOMParentNode::cloneChildren(const DOMNode *other) {\n \/\/ for (DOMNode *mykid = other.getFirstChild();\n for (DOMNode *mykid = other->getFirstChild();\n mykid != 0;\n mykid = mykid->getNextSibling())\n {\n appendChild(mykid->cloneNode(true));\n }\n}\n\nDOMDocument * DOMParentNode::getOwnerDocument() const {\n return fOwnerDocument;\n}\n\n\/\/ unlike getOwnerDocument this is not overriden by DocumentImpl to return 0\nDOMDocument * DOMParentNode::getDocument() const {\n return fOwnerDocument;\n}\n\nvoid DOMParentNode::setOwnerDocument(DOMDocument* doc) {\n fOwnerDocument = doc;\n}\n\nDOMNodeList *DOMParentNode::getChildNodes() const {\n const DOMNodeList *ret = &fChildNodeList;\n return (DOMNodeList *)ret; \/\/ cast off const.\n};\n\n\nDOMNode * DOMParentNode::getFirstChild() const {\n return fFirstChild;\n};\n\n\nDOMNode * DOMParentNode::getLastChild() const\n{\n return lastChild();\n};\n\nDOMNode * DOMParentNode::lastChild() const\n{\n \/\/ last child is stored as the previous sibling of first child\n if (fFirstChild == 0) {\n return 0;\n }\n\n DOMChildNode *firstChild = castToChildImpl(fFirstChild);\n DOMNode *ret = firstChild->previousSibling;\n return ret;\n};\n\n\n\/\/\n\/\/ revisit. Is this function used anywhere? I don't see it.\n\/\/\nvoid DOMParentNode::lastChild(DOMNode *node) {\n \/\/ store lastChild as previous sibling of first child\n if (fFirstChild != 0) {\n DOMChildNode *firstChild = castToChildImpl(fFirstChild);\n firstChild->previousSibling = node;\n }\n}\n\n\nbool DOMParentNode::hasChildNodes() const\n{\n return fFirstChild!=0;\n};\n\n\n\nDOMNode *DOMParentNode::insertBefore(DOMNode *newChild, DOMNode *refChild) {\n DOMNodeImpl *thisNodeImpl = castToNodeImpl(this);\n if (thisNodeImpl->isReadOnly())\n throw DOMException(DOMException::NO_MODIFICATION_ALLOWED_ERR, 0);\n\n if (newChild->getOwnerDocument() != fOwnerDocument)\n throw DOMException(DOMException::WRONG_DOCUMENT_ERR, 0);\n\n\n \/\/ Prevent cycles in the tree\n bool treeSafe=true;\n for(DOMNode *a=castToNode(this)->getParentNode();\n treeSafe && a!=0;\n a=a->getParentNode())\n treeSafe=(newChild!=a);\n if(!treeSafe)\n throw DOMException(DOMException::HIERARCHY_REQUEST_ERR,0);\n\n \/\/ refChild must in fact be a child of this node (or 0)\n if (refChild!=0 && refChild->getParentNode() != castToNode(this))\n throw DOMException(DOMException::NOT_FOUND_ERR,0);\n\n if (newChild->getNodeType() == DOMNode::DOCUMENT_FRAGMENT_NODE)\n {\n \/\/ SLOW BUT SAFE: We could insert the whole subtree without\n \/\/ juggling so many next\/previous pointers. (Wipe out the\n \/\/ parent's child-list, patch the parent pointers, set the\n \/\/ ends of the list.) But we know some subclasses have special-\n \/\/ case behavior they add to insertBefore(), so we don't risk it.\n \/\/ This approch also takes fewer bytecodes.\n\n \/\/ NOTE: If one of the children is not a legal child of this\n \/\/ node, throw HIERARCHY_REQUEST_ERR before _any_ of the children\n \/\/ have been transferred. (Alternative behaviors would be to\n \/\/ reparent up to the first failure point or reparent all those\n \/\/ which are acceptable to the target node, neither of which is\n \/\/ as robust. PR-DOM-0818 isn't entirely clear on which it\n \/\/ recommends?????\n\n \/\/ No need to check kids for right-document; if they weren't,\n \/\/ they wouldn't be kids of that DocFrag.\n for(DOMNode *kid=newChild->getFirstChild(); \/\/ Prescan\n kid!=0;\n kid=kid->getNextSibling())\n {\n if (!DOMDocumentImpl::isKidOK(castToNode(this), kid))\n throw DOMException(DOMException::HIERARCHY_REQUEST_ERR,0);\n }\n while(newChild->hasChildNodes()) \/\/ Move\n insertBefore(newChild->getFirstChild(),refChild);\n }\n\n else if (!DOMDocumentImpl::isKidOK(castToNode(this), newChild))\n throw DOMException(DOMException::HIERARCHY_REQUEST_ERR,0);\n\n else\n {\n DOMNode *oldparent=newChild->getParentNode();\n if(oldparent!=0)\n oldparent->removeChild(newChild);\n\n \/\/ Attach up\n castToNodeImpl(newChild)->fOwnerNode = castToNode(this);\n castToNodeImpl(newChild)->isOwned(true);\n\n \/\/ Attach before and after\n \/\/ Note: fFirstChild.previousSibling == lastChild!!\n if (fFirstChild == 0) {\n \/\/ this our first and only child\n fFirstChild = newChild;\n castToNodeImpl(newChild)->isFirstChild(true);\n \/\/ castToChildImpl(newChild)->previousSibling = newChild;\n DOMChildNode *newChild_ci = castToChildImpl(newChild);\n newChild_ci->previousSibling = newChild;\n } else {\n if (refChild == 0) {\n \/\/ this is an append\n DOMNode *lastChild = castToChildImpl(fFirstChild)->previousSibling;\n castToChildImpl(lastChild)->nextSibling = newChild;\n castToChildImpl(newChild)->previousSibling = lastChild;\n castToChildImpl(fFirstChild)->previousSibling = newChild;\n } else {\n \/\/ this is an insert\n if (refChild == fFirstChild) {\n \/\/ at the head of the list\n castToNodeImpl(fFirstChild)->isFirstChild(false);\n castToChildImpl(newChild)->nextSibling = fFirstChild;\n castToChildImpl(newChild)->previousSibling = castToChildImpl(fFirstChild)->previousSibling;\n castToChildImpl(fFirstChild)->previousSibling = newChild;\n fFirstChild = newChild;\n castToNodeImpl(newChild)->isFirstChild(true);\n } else {\n \/\/ somewhere in the middle\n DOMNode *prev = castToChildImpl(refChild)->previousSibling;\n castToChildImpl(newChild)->nextSibling = refChild;\n castToChildImpl(prev)->nextSibling = newChild;\n castToChildImpl(refChild)->previousSibling = newChild;\n castToChildImpl(newChild)->previousSibling = prev;\n }\n }\n }\n }\n\n changed();\n\n if (this->getOwnerDocument() != 0) {\n Ranges* ranges = ((DOMDocumentImpl *)this->getOwnerDocument())->getRanges();\n if ( ranges != 0) {\n XMLSize_t sz = ranges->size();\n if (sz != 0) {\n for (XMLSize_t i =0; i<sz; i++) {\n ranges->elementAt(i)->updateRangeForInsertedNode(newChild);\n }\n }\n }\n }\n\n return newChild;\n};\n\n\n\nDOMNode *DOMParentNode::removeChild(DOMNode *oldChild)\n{\n if (castToNodeImpl(this)->isReadOnly())\n throw DOMException(\n DOMException::NO_MODIFICATION_ALLOWED_ERR, 0);\n\n if (oldChild != 0 && oldChild->getParentNode() != castToNode(this))\n throw DOMException(DOMException::NOT_FOUND_ERR, 0);\n\n \/\/fix other ranges for change before deleting the node\n if (this->getOwnerDocument() != 0 ) {\n Ranges* ranges = ((DOMDocumentImpl *)this->getOwnerDocument())->getRanges();\n if (ranges != 0) {\n XMLSize_t sz = ranges->size();\n if (sz != 0) {\n for (XMLSize_t i =0; i<sz; i++) {\n if (ranges->elementAt(i) != 0)\n ranges->elementAt(i)->updateRangeForDeletedNode(oldChild);\n }\n }\n }\n }\n\n\n \/\/ Patch linked list around oldChild\n \/\/ Note: lastChild == fFirstChild->previousSibling\n if (oldChild == fFirstChild) {\n \/\/ removing first child\n castToNodeImpl(oldChild)->isFirstChild(false);\n fFirstChild = castToChildImpl(oldChild)->nextSibling;\n if (fFirstChild != 0) {\n castToNodeImpl(fFirstChild)->isFirstChild(true);\n castToChildImpl(fFirstChild)->previousSibling = castToChildImpl(oldChild)->previousSibling;\n }\n } else {\n DOMNode *prev = castToChildImpl(oldChild)->previousSibling;\n DOMNode *next = castToChildImpl(oldChild)->nextSibling;\n castToChildImpl(prev)->nextSibling = next;\n if (next == 0) {\n \/\/ removing last child\n castToChildImpl(fFirstChild)->previousSibling = prev;\n } else {\n \/\/ removing some other child in the middle\n castToChildImpl(next)->previousSibling = prev;\n }\n }\n\n \/\/ Remove oldChild's references to tree\n castToNodeImpl(oldChild)->fOwnerNode = fOwnerDocument;\n castToNodeImpl(oldChild)->isOwned(false);\n castToChildImpl(oldChild)->nextSibling = 0;\n castToChildImpl(oldChild)->previousSibling = 0;\n\n changed();\n\n return oldChild;\n};\n\n\nDOMNode *DOMParentNode::replaceChild(DOMNode *newChild, DOMNode *oldChild)\n{\n insertBefore(newChild, oldChild);\n \/\/ changed() already done.\n return removeChild(oldChild);\n};\n\n\n\n\/\/Introduced in DOM Level 2\n\nvoid DOMParentNode::normalize()\n{\n DOMNode *kid, *next;\n for (kid = fFirstChild; kid != 0; kid = next)\n {\n next = castToChildImpl(kid)->nextSibling;\n\n \/\/ If kid and next are both Text nodes (but _not_ CDATASection,\n \/\/ which is a subclass of Text), they can be merged.\n if (next != 0 &&\n kid->getNodeType() == DOMNode::TEXT_NODE &&\n next->getNodeType() == DOMNode::TEXT_NODE )\n {\n ((DOMTextImpl *) kid)->appendData(((DOMTextImpl *) next)->getData());\n \/\/ revisit:\n \/\/ should I release the removed node?\n \/\/ not released in case user still referencing it externally\n removeChild(next);\n next = kid; \/\/ Don't advance; there might be another.\n }\n\n \/\/ Otherwise it might be an Element, which is handled recursively\n else\n if (kid->getNodeType() == DOMNode::ELEMENT_NODE)\n kid->normalize();\n };\n\n \/\/ changed() will have occurred when the removeChild() was done,\n \/\/ so does not have to be reissued.\n};\n\n\/\/Introduced in DOM Level 3\n\nbool DOMParentNode::isEqualNode(const DOMNode* arg)\n{\n if (castToNodeImpl(this)->isEqualNode(arg))\n {\n DOMNode *kid, *argKid;\n for (kid = fFirstChild, argKid = arg->getFirstChild();\n kid != 0 && argKid != 0;\n kid = kid->getNextSibling(), argKid = argKid->getNextSibling())\n {\n if (!kid->isEqualNode(argKid))\n return false;\n }\n return true;\n }\n return false;\n}\n\n\n\/\/Non-standard extension\nvoid DOMParentNode::release()\n{\n DOMNode *kid, *next;\n for (kid = fFirstChild; kid != 0; kid = next)\n {\n next = castToChildImpl(kid)->nextSibling;\n\n \/\/ set is Owned false before releasing its child\n castToNodeImpl(kid)->isToBeReleased(true);\n kid->release();\n }\n}\n\n\n<commit_msg>isEqualNode: - check for NULL value. - if children length is not the same -> return false.<commit_after>\/*\n * The Apache Software License, Version 1.1\n *\n * Copyright (c) 2001-2002 The Apache Software Foundation. All rights\n * reserved.\n *\n * Redistribution and use in source and binary forms, with or without\n * modification, are permitted provided that the following conditions\n * are met:\n *\n * 1. Redistributions of source code must retain the above copyright\n * notice, this list of conditions and the following disclaimer.\n *\n * 2. Redistributions in binary form must reproduce the above copyright\n * notice, this list of conditions and the following disclaimer in\n * the documentation and\/or other materials provided with the\n * distribution.\n *\n * 3. The end-user documentation included with the redistribution,\n * if any, must include the following acknowledgment:\n * \"This product includes software developed by the\n * Apache Software Foundation (http:\/\/www.apache.org\/).\"\n * Alternately, this acknowledgment may appear in the software itself,\n * if and wherever such third-party acknowledgments normally appear.\n *\n * 4. The names \"Xerces\" and \"Apache Software Foundation\" must\n * not be used to endorse or promote products derived from this\n * software without prior written permission. For written\n * permission, please contact apache\\@apache.org.\n *\n * 5. Products derived from this software may not be called \"Apache\",\n * nor may \"Apache\" appear in their name, without prior written\n * permission of the Apache Software Foundation.\n *\n * THIS SOFTWARE IS PROVIDED ``AS IS'' AND ANY EXPRESSED OR IMPLIED\n * WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES\n * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE\n * DISCLAIMED. IN NO EVENT SHALL THE APACHE SOFTWARE FOUNDATION OR\n * ITS CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,\n * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT\n * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF\n * USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND\n * ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,\n * OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT\n * OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF\n * SUCH DAMAGE.\n * ====================================================================\n *\n * This software consists of voluntary contributions made by many\n * individuals on behalf of the Apache Software Foundation, and was\n * originally based on software copyright (c) 2001, International\n * Business Machines, Inc., http:\/\/www.ibm.com . For more information\n * on the Apache Software Foundation, please see\n * <http:\/\/www.apache.org\/>.\n *\/\n\n\/*\n * $Id$\n *\/\n\n#include <xercesc\/util\/XercesDefs.hpp>\n#include <xercesc\/dom\/DOMException.hpp>\n#include <xercesc\/dom\/DOMNode.hpp>\n\n#include \"DOMDocumentImpl.hpp\"\n#include \"DOMNodeListImpl.hpp\"\n#include \"DOMRangeImpl.hpp\"\n#include \"DOMParentNode.hpp\"\n#include \"DOMCasts.hpp\"\n\n\nDOMParentNode::DOMParentNode(DOMDocument *ownerDoc)\n : fOwnerDocument(ownerDoc), fChildNodeList(castToNode(this))\n{\n fFirstChild = 0;\n};\n\n\/\/ This only makes a shallow copy, cloneChildren must also be called for a\n\/\/ deep clone\nDOMParentNode::DOMParentNode(const DOMParentNode &other) :\n fChildNodeList(castToNode(this))\n{\n this->fOwnerDocument = other.fOwnerDocument;\n\n \/\/ Need to break the association w\/ original kids\n this->fFirstChild = 0;\n};\n\nvoid DOMParentNode::changed()\n{\n DOMDocumentImpl *doc = (DOMDocumentImpl *)(castToNodeImpl(this)->getOwnerDocument());\n doc->changed();\n}\n\n\nint DOMParentNode::changes() const\n{\n DOMDocumentImpl *doc = (DOMDocumentImpl *)(castToNodeImpl(this)->getOwnerDocument());\n return doc->changes();\n};\n\n\nDOMNode * DOMParentNode::appendChild(DOMNode *newChild)\n{\n return insertBefore(newChild, 0);\n};\n\n\nvoid DOMParentNode::cloneChildren(const DOMNode *other) {\n \/\/ for (DOMNode *mykid = other.getFirstChild();\n for (DOMNode *mykid = other->getFirstChild();\n mykid != 0;\n mykid = mykid->getNextSibling())\n {\n appendChild(mykid->cloneNode(true));\n }\n}\n\nDOMDocument * DOMParentNode::getOwnerDocument() const {\n return fOwnerDocument;\n}\n\n\/\/ unlike getOwnerDocument this is not overriden by DocumentImpl to return 0\nDOMDocument * DOMParentNode::getDocument() const {\n return fOwnerDocument;\n}\n\nvoid DOMParentNode::setOwnerDocument(DOMDocument* doc) {\n fOwnerDocument = doc;\n}\n\nDOMNodeList *DOMParentNode::getChildNodes() const {\n const DOMNodeList *ret = &fChildNodeList;\n return (DOMNodeList *)ret; \/\/ cast off const.\n};\n\n\nDOMNode * DOMParentNode::getFirstChild() const {\n return fFirstChild;\n};\n\n\nDOMNode * DOMParentNode::getLastChild() const\n{\n return lastChild();\n};\n\nDOMNode * DOMParentNode::lastChild() const\n{\n \/\/ last child is stored as the previous sibling of first child\n if (fFirstChild == 0) {\n return 0;\n }\n\n DOMChildNode *firstChild = castToChildImpl(fFirstChild);\n DOMNode *ret = firstChild->previousSibling;\n return ret;\n};\n\n\n\/\/\n\/\/ revisit. Is this function used anywhere? I don't see it.\n\/\/\nvoid DOMParentNode::lastChild(DOMNode *node) {\n \/\/ store lastChild as previous sibling of first child\n if (fFirstChild != 0) {\n DOMChildNode *firstChild = castToChildImpl(fFirstChild);\n firstChild->previousSibling = node;\n }\n}\n\n\nbool DOMParentNode::hasChildNodes() const\n{\n return fFirstChild!=0;\n};\n\n\n\nDOMNode *DOMParentNode::insertBefore(DOMNode *newChild, DOMNode *refChild) {\n DOMNodeImpl *thisNodeImpl = castToNodeImpl(this);\n if (thisNodeImpl->isReadOnly())\n throw DOMException(DOMException::NO_MODIFICATION_ALLOWED_ERR, 0);\n\n if (newChild->getOwnerDocument() != fOwnerDocument)\n throw DOMException(DOMException::WRONG_DOCUMENT_ERR, 0);\n\n\n \/\/ Prevent cycles in the tree\n bool treeSafe=true;\n for(DOMNode *a=castToNode(this)->getParentNode();\n treeSafe && a!=0;\n a=a->getParentNode())\n treeSafe=(newChild!=a);\n if(!treeSafe)\n throw DOMException(DOMException::HIERARCHY_REQUEST_ERR,0);\n\n \/\/ refChild must in fact be a child of this node (or 0)\n if (refChild!=0 && refChild->getParentNode() != castToNode(this))\n throw DOMException(DOMException::NOT_FOUND_ERR,0);\n\n if (newChild->getNodeType() == DOMNode::DOCUMENT_FRAGMENT_NODE)\n {\n \/\/ SLOW BUT SAFE: We could insert the whole subtree without\n \/\/ juggling so many next\/previous pointers. (Wipe out the\n \/\/ parent's child-list, patch the parent pointers, set the\n \/\/ ends of the list.) But we know some subclasses have special-\n \/\/ case behavior they add to insertBefore(), so we don't risk it.\n \/\/ This approch also takes fewer bytecodes.\n\n \/\/ NOTE: If one of the children is not a legal child of this\n \/\/ node, throw HIERARCHY_REQUEST_ERR before _any_ of the children\n \/\/ have been transferred. (Alternative behaviors would be to\n \/\/ reparent up to the first failure point or reparent all those\n \/\/ which are acceptable to the target node, neither of which is\n \/\/ as robust. PR-DOM-0818 isn't entirely clear on which it\n \/\/ recommends?????\n\n \/\/ No need to check kids for right-document; if they weren't,\n \/\/ they wouldn't be kids of that DocFrag.\n for(DOMNode *kid=newChild->getFirstChild(); \/\/ Prescan\n kid!=0;\n kid=kid->getNextSibling())\n {\n if (!DOMDocumentImpl::isKidOK(castToNode(this), kid))\n throw DOMException(DOMException::HIERARCHY_REQUEST_ERR,0);\n }\n while(newChild->hasChildNodes()) \/\/ Move\n insertBefore(newChild->getFirstChild(),refChild);\n }\n\n else if (!DOMDocumentImpl::isKidOK(castToNode(this), newChild))\n throw DOMException(DOMException::HIERARCHY_REQUEST_ERR,0);\n\n else\n {\n DOMNode *oldparent=newChild->getParentNode();\n if(oldparent!=0)\n oldparent->removeChild(newChild);\n\n \/\/ Attach up\n castToNodeImpl(newChild)->fOwnerNode = castToNode(this);\n castToNodeImpl(newChild)->isOwned(true);\n\n \/\/ Attach before and after\n \/\/ Note: fFirstChild.previousSibling == lastChild!!\n if (fFirstChild == 0) {\n \/\/ this our first and only child\n fFirstChild = newChild;\n castToNodeImpl(newChild)->isFirstChild(true);\n \/\/ castToChildImpl(newChild)->previousSibling = newChild;\n DOMChildNode *newChild_ci = castToChildImpl(newChild);\n newChild_ci->previousSibling = newChild;\n } else {\n if (refChild == 0) {\n \/\/ this is an append\n DOMNode *lastChild = castToChildImpl(fFirstChild)->previousSibling;\n castToChildImpl(lastChild)->nextSibling = newChild;\n castToChildImpl(newChild)->previousSibling = lastChild;\n castToChildImpl(fFirstChild)->previousSibling = newChild;\n } else {\n \/\/ this is an insert\n if (refChild == fFirstChild) {\n \/\/ at the head of the list\n castToNodeImpl(fFirstChild)->isFirstChild(false);\n castToChildImpl(newChild)->nextSibling = fFirstChild;\n castToChildImpl(newChild)->previousSibling = castToChildImpl(fFirstChild)->previousSibling;\n castToChildImpl(fFirstChild)->previousSibling = newChild;\n fFirstChild = newChild;\n castToNodeImpl(newChild)->isFirstChild(true);\n } else {\n \/\/ somewhere in the middle\n DOMNode *prev = castToChildImpl(refChild)->previousSibling;\n castToChildImpl(newChild)->nextSibling = refChild;\n castToChildImpl(prev)->nextSibling = newChild;\n castToChildImpl(refChild)->previousSibling = newChild;\n castToChildImpl(newChild)->previousSibling = prev;\n }\n }\n }\n }\n\n changed();\n\n if (this->getOwnerDocument() != 0) {\n Ranges* ranges = ((DOMDocumentImpl *)this->getOwnerDocument())->getRanges();\n if ( ranges != 0) {\n XMLSize_t sz = ranges->size();\n if (sz != 0) {\n for (XMLSize_t i =0; i<sz; i++) {\n ranges->elementAt(i)->updateRangeForInsertedNode(newChild);\n }\n }\n }\n }\n\n return newChild;\n};\n\n\n\nDOMNode *DOMParentNode::removeChild(DOMNode *oldChild)\n{\n if (castToNodeImpl(this)->isReadOnly())\n throw DOMException(\n DOMException::NO_MODIFICATION_ALLOWED_ERR, 0);\n\n if (oldChild != 0 && oldChild->getParentNode() != castToNode(this))\n throw DOMException(DOMException::NOT_FOUND_ERR, 0);\n\n \/\/fix other ranges for change before deleting the node\n if (this->getOwnerDocument() != 0 ) {\n Ranges* ranges = ((DOMDocumentImpl *)this->getOwnerDocument())->getRanges();\n if (ranges != 0) {\n XMLSize_t sz = ranges->size();\n if (sz != 0) {\n for (XMLSize_t i =0; i<sz; i++) {\n if (ranges->elementAt(i) != 0)\n ranges->elementAt(i)->updateRangeForDeletedNode(oldChild);\n }\n }\n }\n }\n\n\n \/\/ Patch linked list around oldChild\n \/\/ Note: lastChild == fFirstChild->previousSibling\n if (oldChild == fFirstChild) {\n \/\/ removing first child\n castToNodeImpl(oldChild)->isFirstChild(false);\n fFirstChild = castToChildImpl(oldChild)->nextSibling;\n if (fFirstChild != 0) {\n castToNodeImpl(fFirstChild)->isFirstChild(true);\n castToChildImpl(fFirstChild)->previousSibling = castToChildImpl(oldChild)->previousSibling;\n }\n } else {\n DOMNode *prev = castToChildImpl(oldChild)->previousSibling;\n DOMNode *next = castToChildImpl(oldChild)->nextSibling;\n castToChildImpl(prev)->nextSibling = next;\n if (next == 0) {\n \/\/ removing last child\n castToChildImpl(fFirstChild)->previousSibling = prev;\n } else {\n \/\/ removing some other child in the middle\n castToChildImpl(next)->previousSibling = prev;\n }\n }\n\n \/\/ Remove oldChild's references to tree\n castToNodeImpl(oldChild)->fOwnerNode = fOwnerDocument;\n castToNodeImpl(oldChild)->isOwned(false);\n castToChildImpl(oldChild)->nextSibling = 0;\n castToChildImpl(oldChild)->previousSibling = 0;\n\n changed();\n\n return oldChild;\n};\n\n\nDOMNode *DOMParentNode::replaceChild(DOMNode *newChild, DOMNode *oldChild)\n{\n insertBefore(newChild, oldChild);\n \/\/ changed() already done.\n return removeChild(oldChild);\n};\n\n\n\n\/\/Introduced in DOM Level 2\n\nvoid DOMParentNode::normalize()\n{\n DOMNode *kid, *next;\n for (kid = fFirstChild; kid != 0; kid = next)\n {\n next = castToChildImpl(kid)->nextSibling;\n\n \/\/ If kid and next are both Text nodes (but _not_ CDATASection,\n \/\/ which is a subclass of Text), they can be merged.\n if (next != 0 &&\n kid->getNodeType() == DOMNode::TEXT_NODE &&\n next->getNodeType() == DOMNode::TEXT_NODE )\n {\n ((DOMTextImpl *) kid)->appendData(((DOMTextImpl *) next)->getData());\n \/\/ revisit:\n \/\/ should I release the removed node?\n \/\/ not released in case user still referencing it externally\n removeChild(next);\n next = kid; \/\/ Don't advance; there might be another.\n }\n\n \/\/ Otherwise it might be an Element, which is handled recursively\n else\n if (kid->getNodeType() == DOMNode::ELEMENT_NODE)\n kid->normalize();\n };\n\n \/\/ changed() will have occurred when the removeChild() was done,\n \/\/ so does not have to be reissued.\n};\n\n\/\/Introduced in DOM Level 3\n\nbool DOMParentNode::isEqualNode(const DOMNode* arg)\n{\n if (arg && castToNodeImpl(this)->isEqualNode(arg))\n {\n DOMNode *kid, *argKid;\n for (kid = fFirstChild, argKid = arg->getFirstChild();\n kid != 0 && argKid != 0;\n kid = kid->getNextSibling(), argKid = argKid->getNextSibling())\n {\n if (!kid->isEqualNode(argKid))\n return false;\n }\n return (kid || argKid) ? false : true;\n }\n return false;\n}\n\n\n\/\/Non-standard extension\nvoid DOMParentNode::release()\n{\n DOMNode *kid, *next;\n for (kid = fFirstChild; kid != 0; kid = next)\n {\n next = castToChildImpl(kid)->nextSibling;\n\n \/\/ set is Owned false before releasing its child\n castToNodeImpl(kid)->isToBeReleased(true);\n kid->release();\n }\n}\n\n\n<|endoftext|>"} {"text":"<commit_before>\r\n#include \"HelloTriangleApplication.hpp\"\r\n\r\n#define GLFW_INCLUDE_VULKAN\r\n#include <GLFW\/glfw3.h>\r\n#include <vulkan\/vulkan.hpp>\r\n\r\n#include <algorithm>\r\n\r\n\/\/ NOLINTNEXTLINE(cppcoreguidelines-special-member-functions)\r\nstruct HelloTriangleApplication::WindowHandler\r\n{\r\n GLFWwindow* window;\r\n\r\n WindowHandler() : window{nullptr}\r\n {\r\n glfwInit();\r\n\r\n glfwWindowHint(GLFW_CLIENT_API, GLFW_NO_API);\r\n glfwWindowHint(GLFW_RESIZABLE, GLFW_FALSE);\r\n\r\n window = glfwCreateWindow(HelloTriangleApplication::k_width,\r\n HelloTriangleApplication::k_height, \"Vulkan\", nullptr, nullptr);\r\n }\r\n\r\n ~WindowHandler()\r\n {\r\n glfwDestroyWindow(window);\r\n glfwTerminate();\r\n }\r\n};\r\n\r\nHelloTriangleApplication::HelloTriangleApplication()\r\n : window_handler_{new WindowHandler{}}, vk_instance_{nullptr}\r\n{\r\n}\r\n\r\nHelloTriangleApplication::~HelloTriangleApplication() = default;\r\n\r\nvoid HelloTriangleApplication::run()\r\n{\r\n initVulkan();\r\n mainLoop();\r\n}\r\n\r\nvoid HelloTriangleApplication::initVulkan()\r\n{\r\n createInstance();\r\n}\r\n\r\nvoid HelloTriangleApplication::mainLoop()\r\n{\r\n while (!glfwWindowShouldClose(window_handler_->window)) {\r\n glfwPollEvents();\r\n }\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\nvoid HelloTriangleApplication::createInstance()\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\r\n vk_instance_ = vk::createInstanceUnique(create_info);\r\n}\r\n\r\n\/\/ vim:set et ts=2 sw=0 sts=0:\r\n\r\n<commit_msg>Remove unnecessary qualifier from parameters<commit_after>\r\n#include \"HelloTriangleApplication.hpp\"\r\n\r\n#define GLFW_INCLUDE_VULKAN\r\n#include <GLFW\/glfw3.h>\r\n#include <vulkan\/vulkan.hpp>\r\n\r\n#include <algorithm>\r\n\r\n\/\/ NOLINTNEXTLINE(cppcoreguidelines-special-member-functions)\r\nstruct HelloTriangleApplication::WindowHandler\r\n{\r\n GLFWwindow* window;\r\n\r\n WindowHandler() : window{nullptr}\r\n {\r\n glfwInit();\r\n\r\n glfwWindowHint(GLFW_CLIENT_API, GLFW_NO_API);\r\n glfwWindowHint(GLFW_RESIZABLE, GLFW_FALSE);\r\n\r\n window = glfwCreateWindow(k_width, k_height, \"Vulkan\", nullptr, nullptr);\r\n }\r\n\r\n ~WindowHandler()\r\n {\r\n glfwDestroyWindow(window);\r\n glfwTerminate();\r\n }\r\n};\r\n\r\nHelloTriangleApplication::HelloTriangleApplication()\r\n : window_handler_{new WindowHandler{}}, vk_instance_{nullptr}\r\n{\r\n}\r\n\r\nHelloTriangleApplication::~HelloTriangleApplication() = default;\r\n\r\nvoid HelloTriangleApplication::run()\r\n{\r\n initVulkan();\r\n mainLoop();\r\n}\r\n\r\nvoid HelloTriangleApplication::initVulkan()\r\n{\r\n createInstance();\r\n}\r\n\r\nvoid HelloTriangleApplication::mainLoop()\r\n{\r\n while (!glfwWindowShouldClose(window_handler_->window)) {\r\n glfwPollEvents();\r\n }\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\nvoid HelloTriangleApplication::createInstance()\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\r\n vk_instance_ = vk::createInstanceUnique(create_info);\r\n}\r\n\r\n\/\/ vim:set et ts=2 sw=0 sts=0:\r\n\r\n<|endoftext|>"} {"text":"<commit_before>#include \"cache.hxx\"\n#include \"pool.hxx\"\n#include \"RootPool.hxx\"\n#include \"event\/Event.hxx\"\n\n#include <assert.h>\n#include <time.h>\n\nstatic void *\nmatch_to_ptr(int match)\n{\n return (void*)(long)match;\n}\n\nstatic int\nptr_to_match(void *p)\n{\n return (int)(long)p;\n}\n\nstruct MyCacheItem {\n CacheItem item;\n\n struct pool *const pool;\n const int match;\n const int value;\n\n MyCacheItem(struct pool &_pool, int _match, int _value)\n :item(std::chrono::hours(1), 1),\n pool(&_pool), match(_match), value(_value) {\n }\n};\n\nstatic bool\nmy_cache_validate(CacheItem *item)\n{\n auto *i = (MyCacheItem *)item;\n\n (void)i;\n return true;\n}\n\nstatic void\nmy_cache_destroy(CacheItem *item)\n{\n auto *i = (MyCacheItem *)item;\n struct pool *pool = i->pool;\n\n p_free(pool, i);\n pool_unref(pool);\n}\n\nstatic constexpr CacheClass my_cache_class = {\n .validate = my_cache_validate,\n .destroy = my_cache_destroy,\n};\n\nstatic MyCacheItem *\nmy_cache_item_new(struct pool *pool, int match, int value)\n{\n pool = pool_new_linear(pool, \"my_cache_item\", 1024);\n auto i = NewFromPool<MyCacheItem>(*pool, *pool, match, value);\n return i;\n}\n\nstatic bool\nmy_match(const CacheItem *item, void *ctx)\n{\n const MyCacheItem *i = (const MyCacheItem *)item;\n int match = ptr_to_match(ctx);\n\n return i->match == match;\n}\n\nint main(int argc gcc_unused, char **argv gcc_unused) {\n MyCacheItem *i;\n\n EventLoop event_loop;\n\n RootPool pool;\n\n Cache *cache = cache_new(*pool, event_loop, my_cache_class, 1024, 4);\n\n \/* add first item *\/\n\n i = my_cache_item_new(pool, 1, 0);\n cache_put(cache, \"foo\", &i->item);\n\n \/* overwrite first item *\/\n\n i = my_cache_item_new(pool, 2, 0);\n cache_put(cache, \"foo\", &i->item);\n\n \/* check overwrite result *\/\n\n i = (MyCacheItem *)cache_get(cache, \"foo\");\n assert(i != nullptr);\n assert(i->match == 2);\n assert(i->value == 0);\n\n i = (MyCacheItem *)cache_get_match(cache, \"foo\",\n my_match, match_to_ptr(1));\n assert(i == nullptr);\n\n i = (MyCacheItem *)cache_get_match(cache, \"foo\",\n my_match, match_to_ptr(2));\n assert(i != nullptr);\n assert(i->match == 2);\n assert(i->value == 0);\n\n \/* add new item *\/\n\n i = my_cache_item_new(pool, 1, 1);\n cache_put_match(cache, \"foo\", &i->item, my_match, match_to_ptr(1));\n\n \/* check second item *\/\n\n i = (MyCacheItem *)cache_get_match(cache, \"foo\",\n my_match, match_to_ptr(1));\n assert(i != nullptr);\n assert(i->match == 1);\n assert(i->value == 1);\n\n \/* check first item *\/\n\n i = (MyCacheItem *)cache_get_match(cache, \"foo\",\n my_match, match_to_ptr(2));\n assert(i != nullptr);\n assert(i->match == 2);\n assert(i->value == 0);\n\n \/* overwrite first item *\/\n\n i = my_cache_item_new(pool, 1, 3);\n cache_put_match(cache, \"foo\", &i->item, my_match, match_to_ptr(1));\n\n i = (MyCacheItem *)cache_get_match(cache, \"foo\",\n my_match, match_to_ptr(1));\n assert(i != nullptr);\n assert(i->match == 1);\n assert(i->value == 3);\n\n i = (MyCacheItem *)cache_get_match(cache, \"foo\",\n my_match, match_to_ptr(2));\n assert(i != nullptr);\n assert(i->match == 2);\n assert(i->value == 0);\n\n \/* overwrite second item *\/\n\n i = my_cache_item_new(pool, 2, 4);\n cache_put_match(cache, \"foo\", &i->item, my_match, match_to_ptr(2));\n\n i = (MyCacheItem *)cache_get_match(cache, \"foo\",\n my_match, match_to_ptr(1));\n assert(i != nullptr);\n assert(i->match == 1);\n assert(i->value == 3);\n\n i = (MyCacheItem *)cache_get_match(cache, \"foo\",\n my_match, match_to_ptr(2));\n assert(i != nullptr);\n assert(i->match == 2);\n assert(i->value == 4);\n\n \/* cleanup *\/\n\n cache_close(cache);\n}\n<commit_msg>test\/t_cache: use CacheItem as base class<commit_after>#include \"cache.hxx\"\n#include \"pool.hxx\"\n#include \"RootPool.hxx\"\n#include \"event\/Event.hxx\"\n\n#include <assert.h>\n#include <time.h>\n\nstatic void *\nmatch_to_ptr(int match)\n{\n return (void*)(long)match;\n}\n\nstatic int\nptr_to_match(void *p)\n{\n return (int)(long)p;\n}\n\nstruct MyCacheItem final : CacheItem {\n struct pool *const pool;\n const int match;\n const int value;\n\n MyCacheItem(struct pool &_pool, int _match, int _value)\n :CacheItem(std::chrono::hours(1), 1),\n pool(&_pool), match(_match), value(_value) {\n }\n};\n\nstatic bool\nmy_cache_validate(CacheItem *item)\n{\n auto *i = (MyCacheItem *)item;\n\n (void)i;\n return true;\n}\n\nstatic void\nmy_cache_destroy(CacheItem *item)\n{\n auto *i = (MyCacheItem *)item;\n struct pool *pool = i->pool;\n\n p_free(pool, i);\n pool_unref(pool);\n}\n\nstatic constexpr CacheClass my_cache_class = {\n .validate = my_cache_validate,\n .destroy = my_cache_destroy,\n};\n\nstatic MyCacheItem *\nmy_cache_item_new(struct pool *pool, int match, int value)\n{\n pool = pool_new_linear(pool, \"my_cache_item\", 1024);\n auto i = NewFromPool<MyCacheItem>(*pool, *pool, match, value);\n return i;\n}\n\nstatic bool\nmy_match(const CacheItem *item, void *ctx)\n{\n const MyCacheItem *i = (const MyCacheItem *)item;\n int match = ptr_to_match(ctx);\n\n return i->match == match;\n}\n\nint main(int argc gcc_unused, char **argv gcc_unused) {\n MyCacheItem *i;\n\n EventLoop event_loop;\n\n RootPool pool;\n\n Cache *cache = cache_new(*pool, event_loop, my_cache_class, 1024, 4);\n\n \/* add first item *\/\n\n i = my_cache_item_new(pool, 1, 0);\n cache_put(cache, \"foo\", i);\n\n \/* overwrite first item *\/\n\n i = my_cache_item_new(pool, 2, 0);\n cache_put(cache, \"foo\", i);\n\n \/* check overwrite result *\/\n\n i = (MyCacheItem *)cache_get(cache, \"foo\");\n assert(i != nullptr);\n assert(i->match == 2);\n assert(i->value == 0);\n\n i = (MyCacheItem *)cache_get_match(cache, \"foo\",\n my_match, match_to_ptr(1));\n assert(i == nullptr);\n\n i = (MyCacheItem *)cache_get_match(cache, \"foo\",\n my_match, match_to_ptr(2));\n assert(i != nullptr);\n assert(i->match == 2);\n assert(i->value == 0);\n\n \/* add new item *\/\n\n i = my_cache_item_new(pool, 1, 1);\n cache_put_match(cache, \"foo\", i, my_match, match_to_ptr(1));\n\n \/* check second item *\/\n\n i = (MyCacheItem *)cache_get_match(cache, \"foo\",\n my_match, match_to_ptr(1));\n assert(i != nullptr);\n assert(i->match == 1);\n assert(i->value == 1);\n\n \/* check first item *\/\n\n i = (MyCacheItem *)cache_get_match(cache, \"foo\",\n my_match, match_to_ptr(2));\n assert(i != nullptr);\n assert(i->match == 2);\n assert(i->value == 0);\n\n \/* overwrite first item *\/\n\n i = my_cache_item_new(pool, 1, 3);\n cache_put_match(cache, \"foo\", i, my_match, match_to_ptr(1));\n\n i = (MyCacheItem *)cache_get_match(cache, \"foo\",\n my_match, match_to_ptr(1));\n assert(i != nullptr);\n assert(i->match == 1);\n assert(i->value == 3);\n\n i = (MyCacheItem *)cache_get_match(cache, \"foo\",\n my_match, match_to_ptr(2));\n assert(i != nullptr);\n assert(i->match == 2);\n assert(i->value == 0);\n\n \/* overwrite second item *\/\n\n i = my_cache_item_new(pool, 2, 4);\n cache_put_match(cache, \"foo\", i, my_match, match_to_ptr(2));\n\n i = (MyCacheItem *)cache_get_match(cache, \"foo\",\n my_match, match_to_ptr(1));\n assert(i != nullptr);\n assert(i->match == 1);\n assert(i->value == 3);\n\n i = (MyCacheItem *)cache_get_match(cache, \"foo\",\n my_match, match_to_ptr(2));\n assert(i != nullptr);\n assert(i->match == 2);\n assert(i->value == 4);\n\n \/* cleanup *\/\n\n cache_close(cache);\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 \"Step8.h\"\n\n#include \"QmitkStdMultiWidget.h\"\n\n#include \"mitkGlobalInteraction.h\"\n#include \"mitkRenderingManager.h\"\n#include <mitkImageVtkMapper2D.h>\n\n#include <QHBoxLayout>\n#include <QVBoxLayout>\n\n#include <vtkInteractorStyle.h>\n#include <vtkInteractorStyleImage.h>\n\n\n\/\/##Documentation\n\/\/## @brief As Step6, but with QmitkStdMultiWidget as widget\nStep8::Step8(int argc, char* argv[], QWidget *parent) :\n\tStep6(argc, argv, parent)\n{\n}\n\nvoid Step8::SetupWidgets()\n{\n\t\/\/*************************************************************************\n\t\/\/ Part I: Create windows and pass the tree to it\n\t\/\/*************************************************************************\n\n\t\/\/ Create toplevel widget with vertical layout\n\tQVBoxLayout* vlayout = new QVBoxLayout(this);\n\tvlayout->setMargin(0);\n\tvlayout->setSpacing(2);\n\n\t\/\/ Create viewParent widget with horizontal layout\n\tQWidget* viewParent = new QWidget(this);\n\tvlayout->addWidget(viewParent);\n\tQHBoxLayout* hlayout = new QHBoxLayout(viewParent);\n\thlayout->setMargin(0);\n\n\tmitk::ImageVtkMapper2D::Pointer mapper = mitk::ImageVtkMapper2D::New();\n\tm_ResultNode->SetMapper(mitk::BaseRenderer::Extended2D, mapper);\n\n\t\/\/*************************************************************************\n\t\/\/ Part Ia: create and initialize QmitkStdMultiWidget\n\t\/\/*************************************************************************\n\tQmitkStdMultiWidget* multiWidget = new QmitkStdMultiWidget(viewParent);\n\n\thlayout->addWidget(multiWidget);\n\n\t\/\/ Tell the multiWidget which DataStorage to render\n\tmultiWidget->SetDataStorage(m_DataStorage);\n\n\t\/\/ Initialize views as transversal, sagittal, coronar (from\n\t\/\/ top-left to bottom)\n\tmitk::TimeSlicedGeometry::Pointer geo = m_DataStorage->ComputeBoundingGeometry3D(\n\t\t\tm_DataStorage->GetAll());\n\tmitk::RenderingManager::GetInstance()->InitializeViews(geo);\n\n\t\/\/ Setup render window interactor\n\/\/ vtkSmartPointer<vtkRenderWindowInteractor> renderWindowInteractor = vtkSmartPointer<vtkRenderWindowInteractor>::New();\n\/\/ vtkSmartPointer<vtkInteractorStyleTrackballCamera> style = vtkSmartPointer<vtkInteractorStyleTrackballCamera>::New();\n\tvtkSmartPointer<vtkInteractorStyleImage> style = vtkSmartPointer<vtkInteractorStyleImage>::New();\n\/\/\t\trenderWindowInteractor->SetInteractorStyle(style);\n\n\t\/\/ Initialize bottom-right view as 3D view\n\tmultiWidget->GetRenderWindow1()->GetRenderer()->SetMapperID(\n\t\t\tmitk::BaseRenderer::Extended2D);\n\tmultiWidget->GetRenderWindow1()->GetRenderWindow()->GetInteractor()->SetInteractorStyle(style);\n\/\/\trenderWindowInteractor->Start();\n\n\n\n\t\/\/ Enable standard handler for levelwindow-slider\n\tmultiWidget->EnableStandardLevelWindow();\n\n\t\/\/ Add the displayed views to the DataStorage to see their positions in 2D and 3D\n\tmultiWidget->AddDisplayPlaneSubTree();\n\tmultiWidget->AddPlanesToDataStorage();\n\tmultiWidget->SetWidgetPlanesVisibility(true);\n\n\t\/\/*************************************************************************\n\t\/\/ Part II: Setup standard interaction with the mouse\n\t\/\/*************************************************************************\n\n\t\/\/ Moving the cut-planes to click-point\n\tmultiWidget->EnableNavigationControllerEventListening();\n\n mitk::SliceNavigationController::Pointer sliceNavi = multiWidget->GetRenderWindow2()->GetSliceNavigationController();\n sliceNavi->SetViewDirection(mitk::SliceNavigationController::Transversal);\n sliceNavi->Update();\n\n\t\/\/ Zooming and panning\n\tmitk::GlobalInteraction::GetInstance()->AddListener(\n\t\t\tmultiWidget->GetMoveAndZoomInteractor());\n}\n\/**\n \\example Step8.cpp\n *\/\n<commit_msg>3D Interactor aktiviert<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 \"Step8.h\"\n\n#include \"QmitkStdMultiWidget.h\"\n\n#include \"mitkGlobalInteraction.h\"\n#include \"mitkRenderingManager.h\"\n#include <mitkImageVtkMapper2D.h>\n\n#include <QHBoxLayout>\n#include <QVBoxLayout>\n\n#include <vtkInteractorStyle.h>\n#include <vtkInteractorStyleImage.h>\n\n\n\/\/##Documentation\n\/\/## @brief As Step6, but with QmitkStdMultiWidget as widget\nStep8::Step8(int argc, char* argv[], QWidget *parent) :\n\tStep6(argc, argv, parent)\n{\n}\n\nvoid Step8::SetupWidgets()\n{\n\t\/\/*************************************************************************\n\t\/\/ Part I: Create windows and pass the tree to it\n\t\/\/*************************************************************************\n\n\t\/\/ Create toplevel widget with vertical layout\n\tQVBoxLayout* vlayout = new QVBoxLayout(this);\n\tvlayout->setMargin(0);\n\tvlayout->setSpacing(2);\n\n\t\/\/ Create viewParent widget with horizontal layout\n\tQWidget* viewParent = new QWidget(this);\n\tvlayout->addWidget(viewParent);\n\tQHBoxLayout* hlayout = new QHBoxLayout(viewParent);\n\thlayout->setMargin(0);\n\n\tmitk::ImageVtkMapper2D::Pointer mapper = mitk::ImageVtkMapper2D::New();\n\tm_ResultNode->SetMapper(mitk::BaseRenderer::Extended2D, mapper);\n\n\t\/\/*************************************************************************\n\t\/\/ Part Ia: create and initialize QmitkStdMultiWidget\n\t\/\/*************************************************************************\n\tQmitkStdMultiWidget* multiWidget = new QmitkStdMultiWidget(viewParent);\n\n\thlayout->addWidget(multiWidget);\n\n\t\/\/ Tell the multiWidget which DataStorage to render\n\tmultiWidget->SetDataStorage(m_DataStorage);\n\n\t\/\/ Initialize views as transversal, sagittal, coronar (from\n\t\/\/ top-left to bottom)\n\tmitk::TimeSlicedGeometry::Pointer geo = m_DataStorage->ComputeBoundingGeometry3D(\n\t\t\tm_DataStorage->GetAll());\n\tmitk::RenderingManager::GetInstance()->InitializeViews(geo);\n\n\t\/\/ Setup render window interactor\n\/\/ vtkSmartPointer<vtkRenderWindowInteractor> renderWindowInteractor = vtkSmartPointer<vtkRenderWindowInteractor>::New();\n\/\/ vtkSmartPointer<vtkInteractorStyleTrackballCamera> style = vtkSmartPointer<vtkInteractorStyleTrackballCamera>::New();\n\tvtkSmartPointer<vtkInteractorStyleTrackballCamera> style = vtkSmartPointer<vtkInteractorStyleTrackballCamera>::New();\n\/\/\t\trenderWindowInteractor->SetInteractorStyle(style);\n\n\t\/\/ Initialize bottom-right view as 3D view\n\tmultiWidget->GetRenderWindow1()->GetRenderer()->SetMapperID(\n\t\t\tmitk::BaseRenderer::Extended2D);\n\/\/\tmultiWidget->GetRenderWindow1()->GetRenderWindow()->GetInteractor()->SetInteractorStyle(style);\n\/\/\trenderWindowInteractor->Start();\n\n\n\n\t\/\/ Enable standard handler for levelwindow-slider\n\tmultiWidget->EnableStandardLevelWindow();\n\n\t\/\/ Add the displayed views to the DataStorage to see their positions in 2D and 3D\n\tmultiWidget->AddDisplayPlaneSubTree();\n\tmultiWidget->AddPlanesToDataStorage();\n\tmultiWidget->SetWidgetPlanesVisibility(true);\n\n\t\/\/*************************************************************************\n\t\/\/ Part II: Setup standard interaction with the mouse\n\t\/\/*************************************************************************\n\n\t\/\/ Moving the cut-planes to click-point\n\tmultiWidget->EnableNavigationControllerEventListening();\n\n mitk::SliceNavigationController::Pointer sliceNavi = multiWidget->GetRenderWindow2()->GetSliceNavigationController();\n sliceNavi->SetViewDirection(mitk::SliceNavigationController::Transversal);\n sliceNavi->Update();\n\n\t\/\/ Zooming and panning\n\tmitk::GlobalInteraction::GetInstance()->AddListener(\n\t\t\tmultiWidget->GetMoveAndZoomInteractor());\n}\n\/**\n \\example Step8.cpp\n *\/\n<|endoftext|>"} {"text":"<commit_before>\/\/ @(#)root\/minuit2:$Id$\n\/\/ Authors: M. Winkler, F. James, L. Moneta, A. Zsenei 2003-2005 \n\n\/**********************************************************************\n * *\n * Copyright (c) 2005 LCG ROOT Math team, CERN\/PH-SFT *\n * *\n **********************************************************************\/\n\n#include \"Minuit2\/MnContours.h\"\n#include \"Minuit2\/MnMinos.h\"\n#include \"Minuit2\/MnMigrad.h\"\n#include \"Minuit2\/MnFunctionCross.h\"\n#include \"Minuit2\/FunctionMinimum.h\"\n#include \"Minuit2\/FCNBase.h\"\n#include \"Minuit2\/MnCross.h\"\n#include \"Minuit2\/MinosError.h\"\n#include \"Minuit2\/ContoursError.h\"\n\n#include \"Minuit2\/MnPrint.h\" \n\n\n\nnamespace ROOT {\n\n namespace Minuit2 {\n\n\nvoid PrintContourPoint(const std::pair<double,double> & point) { \n#ifdef WARNINGMSG \n#ifdef USE_ROOT_ERROR\n std::string msg = \"\\tx = \" + ROOT::Math::Util::ToString(point.first) + \"\\ty = \" + ROOT::Math::Util::ToString(point.first);\n MN_INFO_MSG2(\"MnContour\",msg.c_str());\n#else\n std::cout << \" x = \" << point.first << \" y = \" << point.second << std::endl;\n#endif\n#endif\n}\n\nstd::vector<std::pair<double,double> > MnContours::operator()(unsigned int px, unsigned int py, unsigned int npoints) const {\n \/\/ get contour as a pair of (x,y) points passing the parameter index (px, py) and the number of requested points (>=4)\n ContoursError cont = Contour(px, py, npoints);\n return cont();\n}\n\nContoursError MnContours::Contour(unsigned int px, unsigned int py, unsigned int npoints) const {\n \/\/ calculate the contour passing the parameter index (px, py) and the number of requested points (>=4)\n \/\/ the fcn.UP() has to be set to the rquired value (see Minuit document on errors)\n assert(npoints > 3);\n unsigned int maxcalls = 100*(npoints+5)*(fMinimum.UserState().VariableParameters()+1);\n unsigned int nfcn = 0;\n \n std::vector<std::pair<double,double> > result; result.reserve(npoints);\n std::vector<MnUserParameterState> states;\n \/\/ double edmmax = 0.5*0.05*fFCN.Up()*1.e-3; \n\n \/\/double toler = 0.05; \n double toler = 0.1; \/\/ use same defaut value as in Minos \n \n \/\/get first four points\n \/\/ std::cout<<\"MnContours: get first 4 params.\"<<std::endl;\n MnMinos minos(fFCN, fMinimum, fStrategy);\n \n double valx = fMinimum.UserState().Value(px);\n double valy = fMinimum.UserState().Value(py);\n \n MinosError mex = minos.Minos(px);\n nfcn += mex.NFcn();\n if(!mex.IsValid()) {\n MN_ERROR_MSG(\"MnContours is unable to find first two points.\");\n return ContoursError(px, py, result, mex, mex, nfcn);\n }\n std::pair<double,double> ex = mex();\n \n MinosError mey = minos.Minos(py);\n nfcn += mey.NFcn();\n if(!mey.IsValid()) {\n MN_ERROR_MSG(\"MnContours is unable to find second two points.\");\n return ContoursError(px, py, result, mex, mey, nfcn);\n }\n std::pair<double,double> ey = mey();\n \n MnMigrad migrad(fFCN, fMinimum.UserState(), MnStrategy(std::max(0, int(fStrategy.Strategy()-1))));\n \n migrad.Fix(px);\n migrad.SetValue(px, valx + ex.second);\n FunctionMinimum exy_up = migrad();\n nfcn += exy_up.NFcn();\n if(!exy_up.IsValid()) {\n MN_ERROR_VAL2(\"MnContours: unable to find Upper y Value for x Parameter\",px);\n return ContoursError(px, py, result, mex, mey, nfcn);\n }\n \n migrad.SetValue(px, valx + ex.first);\n FunctionMinimum exy_lo = migrad();\n nfcn += exy_lo.NFcn();\n if(!exy_lo.IsValid()) {\n MN_ERROR_VAL2(\"MnContours: unable to find Lower y Value for x Parameter\",px);\n return ContoursError(px, py, result, mex, mey, nfcn);\n }\n \n \n MnMigrad migrad1(fFCN, fMinimum.UserState(), MnStrategy(std::max(0, int(fStrategy.Strategy()-1))));\n migrad1.Fix(py);\n migrad1.SetValue(py, valy + ey.second);\n FunctionMinimum eyx_up = migrad1();\n nfcn += eyx_up.NFcn();\n if(!eyx_up.IsValid()) {\n MN_ERROR_VAL2(\"MnContours: unable to find Upper x Value for y Parameter\",py);\n return ContoursError(px, py, result, mex, mey, nfcn);\n }\n \n migrad1.SetValue(py, valy + ey.first);\n FunctionMinimum eyx_lo = migrad1();\n nfcn += eyx_lo.NFcn();\n if(!eyx_lo.IsValid()) {\n MN_ERROR_VAL2(\"MnContours: unable to find Lower x Value for y Parameter\",py);\n return ContoursError(px, py, result, mex, mey, nfcn);\n }\n \n double scalx = 1.\/(ex.second - ex.first);\n double scaly = 1.\/(ey.second - ey.first);\n \n result.push_back(std::pair<double,double>(valx + ex.first, exy_lo.UserState().Value(py)));\n result.push_back(std::pair<double,double>(eyx_lo.UserState().Value(px), valy + ey.first));\n result.push_back(std::pair<double,double>(valx + ex.second, exy_up.UserState().Value(py)));\n result.push_back(std::pair<double,double>(eyx_up.UserState().Value(px), valy + ey.second));\n\n \n \n \/\/ std::cout<<\"MnContours: first 4 params finished.\"<<std::endl;\n#ifdef WARNINGMSG\n MN_INFO_MSG(\"Minuit2::MnContour : List of found points\");\n MN_INFO_VAL2(\"Minuit2::MnContour : parameter number x\",px);\n MN_INFO_VAL2(\"Minuit2::MnContour : parameter number y\",py);\n#endif\n\n for (unsigned int i = 0; i < 4; ++i)\n PrintContourPoint(result[i] ); \n \n MnUserParameterState upar = fMinimum.UserState();\n upar.Fix(px);\n upar.Fix(py);\n \n std::vector<unsigned int> par(2); par[0] = px; par[1] = py;\n MnFunctionCross cross(fFCN, upar, fMinimum.Fval(), fStrategy);\n \n for(unsigned int i = 4; i < npoints; i++) {\n \n std::vector<std::pair<double,double> >::iterator idist1 = result.end()-1;\n std::vector<std::pair<double,double> >::iterator idist2 = result.begin();\n double dx = idist1->first - (idist2)->first;\n double dy = idist1->second - (idist2)->second;\n double bigdis = scalx*scalx*dx*dx + scaly*scaly*dy*dy;\n \n for(std::vector<std::pair<double,double> >::iterator ipair = result.begin(); ipair != result.end()-1; ipair++) {\n double distx = ipair->first - (ipair+1)->first;\n double disty = ipair->second - (ipair+1)->second;\n double dist = scalx*scalx*distx*distx + scaly*scaly*disty*disty;\n if(dist > bigdis) {\n bigdis = dist;\n idist1 = ipair;\n idist2 = ipair+1;\n }\n }\n \n double a1 = 0.5;\n double a2 = 0.5;\n double sca = 1.;\n \nL300:\n \n if(nfcn > maxcalls) {\n MN_ERROR_MSG(\"MnContours: maximum number of function calls exhausted.\");\n return ContoursError(px, py, result, mex, mey, nfcn);\n }\n \n double xmidcr = a1*idist1->first + a2*(idist2)->first;\n double ymidcr = a1*idist1->second + a2*(idist2)->second;\n double xdir = (idist2)->second - idist1->second;\n double ydir = idist1->first - (idist2)->first;\n double scalfac = sca*std::max(fabs(xdir*scalx), fabs(ydir*scaly));\n double xdircr = xdir\/scalfac;\n double ydircr = ydir\/scalfac;\n std::vector<double> pmid(2); pmid[0] = xmidcr; pmid[1] = ymidcr;\n std::vector<double> pdir(2); pdir[0] = xdircr; pdir[1] = ydircr;\n \n MnCross opt = cross(par, pmid, pdir, toler, maxcalls);\n nfcn += opt.NFcn();\n if(!opt.IsValid()) {\n \/\/ if(a1 > 0.5) {\n if(sca < 0.) {\n MN_ERROR_VAL2(\"MnContours : unable to find point on Contour\",i+1);\n MN_ERROR_VAL2(\"MnContours : found only i points\",i);\n return ContoursError(px, py, result, mex, mey, nfcn);\n }\n \/\/ a1 = 0.75;\n \/\/ a2 = 0.25;\n \/\/ std::cout<<\"*****switch direction\"<<std::endl;\n sca = -1.;\n goto L300;\n }\n double aopt = opt.Value();\n if(idist2 == result.begin()) { \n result.push_back(std::pair<double,double>(xmidcr+(aopt)*xdircr, ymidcr + (aopt)*ydircr));\n PrintContourPoint( result.back() );\n }\n else {\n result.insert(idist2, std::pair<double,double>(xmidcr+(aopt)*xdircr, ymidcr + (aopt)*ydircr));\n PrintContourPoint( *idist2 );\n }\n } \n return ContoursError(px, py, result, mex, mey, nfcn);\n}\n\n\n } \/\/ namespace Minuit2\n\n} \/\/ namespace ROOT\n<commit_msg>fix printing message of contour points<commit_after>\/\/ @(#)root\/minuit2:$Id$\n\/\/ Authors: M. Winkler, F. James, L. Moneta, A. Zsenei 2003-2005 \n\n\/**********************************************************************\n * *\n * Copyright (c) 2005 LCG ROOT Math team, CERN\/PH-SFT *\n * *\n **********************************************************************\/\n\n#include \"Minuit2\/MnContours.h\"\n#include \"Minuit2\/MnMinos.h\"\n#include \"Minuit2\/MnMigrad.h\"\n#include \"Minuit2\/MnFunctionCross.h\"\n#include \"Minuit2\/FunctionMinimum.h\"\n#include \"Minuit2\/FCNBase.h\"\n#include \"Minuit2\/MnCross.h\"\n#include \"Minuit2\/MinosError.h\"\n#include \"Minuit2\/ContoursError.h\"\n\n#include \"Minuit2\/MnPrint.h\" \n\n\n\nnamespace ROOT {\n\n namespace Minuit2 {\n\n\nvoid PrintContourPoint(const std::pair<double,double> & point) { \n std::cout << \"\\t x = \" << point.first << \" y = \" << point.second << std::endl;\n}\n\nstd::vector<std::pair<double,double> > MnContours::operator()(unsigned int px, unsigned int py, unsigned int npoints) const {\n \/\/ get contour as a pair of (x,y) points passing the parameter index (px, py) and the number of requested points (>=4)\n ContoursError cont = Contour(px, py, npoints);\n return cont();\n}\n\nContoursError MnContours::Contour(unsigned int px, unsigned int py, unsigned int npoints) const {\n \/\/ calculate the contour passing the parameter index (px, py) and the number of requested points (>=4)\n \/\/ the fcn.UP() has to be set to the rquired value (see Minuit document on errors)\n assert(npoints > 3);\n unsigned int maxcalls = 100*(npoints+5)*(fMinimum.UserState().VariableParameters()+1);\n unsigned int nfcn = 0;\n \n std::vector<std::pair<double,double> > result; result.reserve(npoints);\n std::vector<MnUserParameterState> states;\n \/\/ double edmmax = 0.5*0.05*fFCN.Up()*1.e-3; \n\n \/\/double toler = 0.05; \n double toler = 0.1; \/\/ use same defaut value as in Minos \n \n \/\/get first four points\n \/\/ std::cout<<\"MnContours: get first 4 params.\"<<std::endl;\n MnMinos minos(fFCN, fMinimum, fStrategy);\n \n double valx = fMinimum.UserState().Value(px);\n double valy = fMinimum.UserState().Value(py);\n \n MinosError mex = minos.Minos(px);\n nfcn += mex.NFcn();\n if(!mex.IsValid()) {\n MN_ERROR_MSG(\"MnContours is unable to find first two points.\");\n return ContoursError(px, py, result, mex, mex, nfcn);\n }\n std::pair<double,double> ex = mex();\n \n MinosError mey = minos.Minos(py);\n nfcn += mey.NFcn();\n if(!mey.IsValid()) {\n MN_ERROR_MSG(\"MnContours is unable to find second two points.\");\n return ContoursError(px, py, result, mex, mey, nfcn);\n }\n std::pair<double,double> ey = mey();\n \n MnMigrad migrad(fFCN, fMinimum.UserState(), MnStrategy(std::max(0, int(fStrategy.Strategy()-1))));\n \n migrad.Fix(px);\n migrad.SetValue(px, valx + ex.second);\n FunctionMinimum exy_up = migrad();\n nfcn += exy_up.NFcn();\n if(!exy_up.IsValid()) {\n MN_ERROR_VAL2(\"MnContours: unable to find Upper y Value for x Parameter\",px);\n return ContoursError(px, py, result, mex, mey, nfcn);\n }\n \n migrad.SetValue(px, valx + ex.first);\n FunctionMinimum exy_lo = migrad();\n nfcn += exy_lo.NFcn();\n if(!exy_lo.IsValid()) {\n MN_ERROR_VAL2(\"MnContours: unable to find Lower y Value for x Parameter\",px);\n return ContoursError(px, py, result, mex, mey, nfcn);\n }\n \n \n MnMigrad migrad1(fFCN, fMinimum.UserState(), MnStrategy(std::max(0, int(fStrategy.Strategy()-1))));\n migrad1.Fix(py);\n migrad1.SetValue(py, valy + ey.second);\n FunctionMinimum eyx_up = migrad1();\n nfcn += eyx_up.NFcn();\n if(!eyx_up.IsValid()) {\n MN_ERROR_VAL2(\"MnContours: unable to find Upper x Value for y Parameter\",py);\n return ContoursError(px, py, result, mex, mey, nfcn);\n }\n \n migrad1.SetValue(py, valy + ey.first);\n FunctionMinimum eyx_lo = migrad1();\n nfcn += eyx_lo.NFcn();\n if(!eyx_lo.IsValid()) {\n MN_ERROR_VAL2(\"MnContours: unable to find Lower x Value for y Parameter\",py);\n return ContoursError(px, py, result, mex, mey, nfcn);\n }\n \n double scalx = 1.\/(ex.second - ex.first);\n double scaly = 1.\/(ey.second - ey.first);\n \n result.push_back(std::pair<double,double>(valx + ex.first, exy_lo.UserState().Value(py)));\n result.push_back(std::pair<double,double>(eyx_lo.UserState().Value(px), valy + ey.first));\n result.push_back(std::pair<double,double>(valx + ex.second, exy_up.UserState().Value(py)));\n result.push_back(std::pair<double,double>(eyx_up.UserState().Value(px), valy + ey.second));\n\n \n MnUserParameterState upar = fMinimum.UserState();\n \n \/\/ std::cout<<\"MnContours: first 4 params finished.\"<<std::endl;\n int printLevel = MnPrint::Level();\n\n if (printLevel > 0 ) {\n std::cout << \"MnContour : List of found points \" << std::endl;\n std::cout << \"\\t Parameter x is \" << upar.Name(px) << std::endl;\n std::cout << \"\\t Parameter y is \" << upar.Name(py) << std::endl;\n }\n\n if (printLevel > 0) { \n for (unsigned int i = 0; i < 4; ++i)\n PrintContourPoint(result[i] ); \n }\n \n upar.Fix(px);\n upar.Fix(py);\n \n std::vector<unsigned int> par(2); par[0] = px; par[1] = py;\n MnFunctionCross cross(fFCN, upar, fMinimum.Fval(), fStrategy);\n \n for(unsigned int i = 4; i < npoints; i++) {\n \n std::vector<std::pair<double,double> >::iterator idist1 = result.end()-1;\n std::vector<std::pair<double,double> >::iterator idist2 = result.begin();\n double dx = idist1->first - (idist2)->first;\n double dy = idist1->second - (idist2)->second;\n double bigdis = scalx*scalx*dx*dx + scaly*scaly*dy*dy;\n \n for(std::vector<std::pair<double,double> >::iterator ipair = result.begin(); ipair != result.end()-1; ipair++) {\n double distx = ipair->first - (ipair+1)->first;\n double disty = ipair->second - (ipair+1)->second;\n double dist = scalx*scalx*distx*distx + scaly*scaly*disty*disty;\n if(dist > bigdis) {\n bigdis = dist;\n idist1 = ipair;\n idist2 = ipair+1;\n }\n }\n \n double a1 = 0.5;\n double a2 = 0.5;\n double sca = 1.;\n \nL300:\n \n if(nfcn > maxcalls) {\n MN_ERROR_MSG(\"MnContours: maximum number of function calls exhausted.\");\n return ContoursError(px, py, result, mex, mey, nfcn);\n }\n \n double xmidcr = a1*idist1->first + a2*(idist2)->first;\n double ymidcr = a1*idist1->second + a2*(idist2)->second;\n double xdir = (idist2)->second - idist1->second;\n double ydir = idist1->first - (idist2)->first;\n double scalfac = sca*std::max(fabs(xdir*scalx), fabs(ydir*scaly));\n double xdircr = xdir\/scalfac;\n double ydircr = ydir\/scalfac;\n std::vector<double> pmid(2); pmid[0] = xmidcr; pmid[1] = ymidcr;\n std::vector<double> pdir(2); pdir[0] = xdircr; pdir[1] = ydircr;\n \n MnCross opt = cross(par, pmid, pdir, toler, maxcalls);\n nfcn += opt.NFcn();\n if(!opt.IsValid()) {\n \/\/ if(a1 > 0.5) {\n if(sca < 0.) {\n MN_ERROR_VAL2(\"MnContours : unable to find point on Contour\",i+1);\n MN_ERROR_VAL2(\"MnContours : found only i points\",i);\n return ContoursError(px, py, result, mex, mey, nfcn);\n }\n \/\/ a1 = 0.75;\n \/\/ a2 = 0.25;\n \/\/ std::cout<<\"*****switch direction\"<<std::endl;\n sca = -1.;\n goto L300;\n }\n double aopt = opt.Value();\n if(idist2 == result.begin()) { \n result.push_back(std::pair<double,double>(xmidcr+(aopt)*xdircr, ymidcr + (aopt)*ydircr));\n if (printLevel > 0) PrintContourPoint( result.back() );\n }\n else {\n result.insert(idist2, std::pair<double,double>(xmidcr+(aopt)*xdircr, ymidcr + (aopt)*ydircr));\n if (printLevel > 0) PrintContourPoint( *idist2 );\n }\n } \n if (printLevel >0) \n std::cout << \"MnContour: Number of contour points = \" << result.size() << std::endl;\n\n return ContoursError(px, py, result, mex, mey, nfcn);\n}\n\n\n } \/\/ namespace Minuit2\n\n} \/\/ namespace ROOT\n<|endoftext|>"} {"text":"<commit_before>\/*******************************************************************************\n * src\/benchmark.cpp\n *\n * Copyright (C) 2017 Florian Kurpicz <florian.kurpicz@tu-dortmund.de>\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#include <tclap\/CmdLine.h>\n#include <vector>\n\n#include \"benchmark\/algorithm.hpp\"\n#include \"util\/alphabet_util.hpp\"\n#include \"util\/file_util.hpp\"\n#include \"util\/stxxl_helper.hpp\"\n#include \"util\/memory_types.hpp\"\n\n#ifdef MALLOC_COUNT\n#include \"benchmark\/malloc_count.h\"\n#endif \/\/ MALLOC_COUNT\n\nauto filter_parallel(bool only_parallel, bool is_parallel) {\n return (!only_parallel || is_parallel);\n}\n\nauto filter_sequential(bool sequential, bool is_parallel) {\n return (!sequential || !is_parallel);\n}\n\nauto filter_wavelet_type(bool is_tree, bool no_trees, bool no_matrices) {\n return (is_tree ? !no_trees : !no_matrices);\n}\n\nstatic TCLAP::SwitchArg list_all_algorithms(\"l\", \"list\",\n \"Print the name and description of all registered algorithms\", false);\nstatic TCLAP::MultiArg<std::string> file_path_arg(\"f\", \"file\",\n \"Path to the text file.\", false, \"string\");\nstatic TCLAP::ValueArg<std::string> filter_arg(\"n\", \"name\",\n \"Runs all algorithms that contain the <name> in their name\", false, \"\",\n \"string\");\nstatic TCLAP::ValueArg<int32_t> word_width_arg(\"b\", \"byte\",\n \"Bytes per char in the input text.\", false, 1, \"uint8_t\");\nstatic TCLAP::ValueArg<int32_t> nr_runs_arg(\"r\", \"runs\",\n \"Number of repetitions of the construction algorithm.\",\n false, 5, \"int32_t\");\nstatic TCLAP::SwitchArg run_only_parallel_arg(\"p\", \"parallel\",\n \"Run only parallel construction algorithms.\", false);\nstatic TCLAP::SwitchArg run_only_sequential_arg(\"s\", \"sequential\",\n \"Run only sequential construction algorithms.\", false);\nstatic TCLAP::SwitchArg no_trees_arg(\"m\", \"no_trees\",\n \"Skip all wavelet trees construction algorithms.\", false);\nstatic TCLAP::SwitchArg no_matrices_arg(\"t\", \"no_matrices\",\n \"Skip all wavelet matrices construction algorithms.\", false);\nstatic TCLAP::SwitchArg memory_arg(\"\", \"memory\",\n \"Compute peak memory during construction.\", false);\nstatic TCLAP::SwitchArg external_input_arg(\"i\", \"external_input\",\n \"Run only algorithms that stream the input instead of keeping it in RAM.\", false);\nstatic TCLAP::SwitchArg external_output_arg(\"o\", \"external_output\",\n \"Run only algorithms that stream the output instead of keeping it in RAM.\", false);\nstatic TCLAP::SwitchArg external_both_arg(\"e\", \"external\",\n \"Run only algorithms that use external memory\", false);\n\ntemplate <memory_mode mem_mode>\nint32_t run();\n\nint32_t main(int32_t argc, char const* argv[]) {\n TCLAP::CmdLine cmd(\"Benchmark for wavelet tree (and matrix) construction\",\n ' ', \"0.2\");\n cmd.add(list_all_algorithms);\n cmd.add(file_path_arg);\n cmd.add(filter_arg);\n cmd.add(word_width_arg);\n cmd.add(nr_runs_arg);\n cmd.add(run_only_parallel_arg);\n cmd.add(run_only_sequential_arg);\n cmd.add(no_trees_arg);\n cmd.add(no_matrices_arg);\n cmd.add(memory_arg);\n cmd.add(external_input_arg);\n cmd.add(external_output_arg);\n cmd.add(external_both_arg);\n cmd.parse( argc, argv );\n\n if(external_both_arg.getValue()) \n return run<memory_mode::external>();\n else if(external_input_arg.getValue() && external_output_arg.getValue()) \n return run<memory_mode::external>();\n else if(external_input_arg.getValue()) \n return run<memory_mode::external_input>();\n else if(external_output_arg.getValue()) \n return run<memory_mode::external_output>();\n else return run<memory_mode::internal>();\n}\n\ntemplate <memory_mode mem_mode>\nint32_t run() {\n\n if (list_all_algorithms.getValue()) {\n auto& algo_list_int = \n algorithm_list<memory_mode::internal>::get_algorithm_list();\n auto& algo_list_ext_in = \n algorithm_list<memory_mode::external_input>::get_algorithm_list();\n auto& algo_list_ext_out = \n algorithm_list<memory_mode::external_output>::get_algorithm_list();\n auto& algo_list_ext_both = \n algorithm_list<memory_mode::external>::get_algorithm_list();\n for (const auto& a : algo_list_int) a->print_info();\n for (const auto& a : algo_list_ext_in) a->print_info();\n for (const auto& a : algo_list_ext_out) a->print_info();\n for (const auto& a : algo_list_ext_both) a->print_info();\n return 0;\n }\n \n auto& algo_list = algorithm_list<mem_mode>::get_algorithm_list();\n\n const std::vector<std::string> file_paths = file_path_arg.getValue();\n std::string filter = filter_arg.getValue();\n const int32_t word_width = word_width_arg.getValue();\n const int32_t nr_runs = nr_runs_arg.getValue();\n const bool run_only_parallel = run_only_parallel_arg.getValue();\n const bool run_only_sequential = run_only_sequential_arg.getValue();\n const bool no_trees = no_trees_arg.getValue();\n const bool no_matrices = no_matrices_arg.getValue();\n const bool memory = memory_arg.getValue();\n\n constexpr bool ext_input = \n mem_mode == memory_mode::external || \n mem_mode == memory_mode::external_input;\n constexpr bool ext_output = \n mem_mode == memory_mode::external || \n mem_mode == memory_mode::external_output;\n \n for (const auto& path : file_paths) {\n std::cout << std::endl << \"Text: \" << path << std::endl;\n void * txt_prt = nullptr;\n \n uint64_t txt_bytes = 0;\n uint64_t all_bytes = 0;\n uint64_t text_size = 0;\n uint64_t max_char = 0;\n uint64_t levels = 0;\n std::string txt_path;\n \n std::vector<uint8_t> text_uint8;\n std::vector<uint16_t> text_uint16;\n std::vector<uint32_t> text_uint32;\n std::vector<uint64_t> text_uint64;\n uint8_t * text_uint8_data = nullptr;\n uint16_t * text_uint16_data = nullptr;\n uint32_t * text_uint32_data = nullptr;\n uint64_t * text_uint64_data = nullptr;\n\n stxxlvector<type_for_bytes<1>::type> * text_uint8_ext = nullptr;\n stxxlvector<type_for_bytes<2>::type> * text_uint16_ext = nullptr;\n stxxlvector<type_for_bytes<4>::type> * text_uint32_ext = nullptr;\n stxxlvector<type_for_bytes<8>::type> * text_uint64_ext = nullptr;\n\n malloc_count_reset_peak();\n uint64_t non_text_bytes = malloc_count_current();\n \n if(!ext_input) {\n \/\/ INTERNAL MEMORY INPUT\n if (word_width == 1) {\n text_uint8 = file_to_vector<1>(path);\n text_size = text_uint8.size();\n max_char = reduce_alphabet(text_uint8);\n text_uint8_data = text_uint8.data();\n txt_prt = &text_uint8_data;\n } else if (word_width == 2) {\n text_uint16 = file_to_vector<2>(path);\n text_size = text_uint16.size();\n max_char = reduce_alphabet(text_uint16);\n text_uint16_data = text_uint16.data();\n txt_prt = &text_uint16_data;\n } else if (word_width == 4) {\n text_uint32 = file_to_vector<4>(path);\n text_size = text_uint32.size();\n max_char = reduce_alphabet(text_uint32);\n text_uint32_data = text_uint32.data();\n txt_prt = &text_uint32_data;\n } else if (word_width == 8) {\n text_uint64 = file_to_vector<8>(path);\n text_size = text_uint64.size();\n max_char = reduce_alphabet(text_uint64);\n text_uint64_data = text_uint64.data();\n txt_prt = &text_uint64_data;\n } else {\n std::cerr << \"You entered an invalid number of bytes per character \"\n \"(parameter 'b').\" << std::endl;\n return -1;\n }\n } else {\n \/\/ EXTERNAL MEMORY INPUT\n \/\/~ stxxl::linuxaio_file stxxl_file(path, stxxl::file::open_mode::RDONLY);\n stxxl::syscall_file stxxl_file(path, stxxl::file::open_mode::RDONLY);\n if (word_width == 1) {\n const stxxlvector<type_for_bytes<1>::type> unreduced_vector(&stxxl_file);\n text_size = unreduced_vector.size();\n text_uint8_ext = new stxxlvector<type_for_bytes<1>::type>();\n max_char = reduce_alphabet<type_for_bytes<1>::type>(unreduced_vector, *text_uint8_ext);\n txt_prt = text_uint8_ext; \n } else if (word_width == 2) {\n const stxxlvector<type_for_bytes<2>::type> unreduced_vector(&stxxl_file);\n text_size = unreduced_vector.size();\n text_uint16_ext = new stxxlvector<type_for_bytes<2>::type>();\n max_char = reduce_alphabet<type_for_bytes<2>::type>(unreduced_vector, *text_uint16_ext);\n txt_prt = text_uint16_ext; \n } else if (word_width == 4) {\n const stxxlvector<type_for_bytes<4>::type> unreduced_vector(&stxxl_file);\n text_size = unreduced_vector.size();\n text_uint32_ext = new stxxlvector<type_for_bytes<4>::type>();\n max_char = reduce_alphabet<type_for_bytes<4>::type>(unreduced_vector, *text_uint32_ext);\n txt_prt = text_uint32_ext; \n } else if (word_width == 8) {\n const stxxlvector<type_for_bytes<8>::type> unreduced_vector(&stxxl_file);\n text_size = unreduced_vector.size();\n text_uint64_ext = new stxxlvector<type_for_bytes<8>::type>();\n max_char = reduce_alphabet<type_for_bytes<8>::type>(unreduced_vector, *text_uint64_ext);\n txt_prt = text_uint64_ext; \n } else {\n std::cerr << \"You entered an invalid number of bytes per character \"\n \"(parameter 'b').\" << std::endl;\n return -1;\n }\n }\n levels = levels_for_max_char(max_char);\n \n #ifdef MALLOC_COUNT\n all_bytes = malloc_count_current();\n txt_bytes = all_bytes - non_text_bytes;\n #endif \/\/ MALLOC_COUNT\n\n std::cout << \"Characters: \" << text_size << std::endl;\n std::cout << \"Levels: \" << levels << std::endl;\n \n #ifdef MALLOC_COUNT\n std::cout << \"Memory peak text: \" << txt_bytes << \", MB: \"\n << txt_bytes \/ (1024 * 1024) << std::endl;\n std::cout << \"Memory peak total: \" << all_bytes << \", MB: \"\n << all_bytes \/ (1024 * 1024) << std::endl;\n #endif \/\/ MALLOC_COUNT\n\n for (const auto& a : algo_list) {\n if (filter == \"\" || (a->name().find(filter) != std::string::npos)) {\n if (a->word_width() == word_width) {\n if (filter_parallel(run_only_parallel, a->is_parallel())) {\n if (filter_sequential(run_only_sequential, a->is_parallel())) {\n if (filter_wavelet_type(a->is_tree(), no_trees, no_matrices)) {\n a->print_info();\n if (memory) {\n #ifdef MALLOC_COUNT\n malloc_count_reset_peak();\n a->memory_peak(txt_prt, text_size, levels);\n std::cout << malloc_count_peak() << \", MB: \"\n << malloc_count_peak() \/ (1024 * 1024) << std::endl;\n #else\n std::cout << \"Memory measurement is NOT enabled.\"\n << std::endl;\n #endif \/\/ MALLOC_COUNT\n } else {\n std::cout << a->median_time(\n txt_prt, text_size, levels, nr_runs) << std::endl;\n }\n }\n }\n }\n }\n }\n }\n \n delete text_uint8_ext; \n delete text_uint16_ext;\n delete text_uint32_ext;\n delete text_uint64_ext;\n }\n return 0;\n}\n\n\/******************************************************************************\/\n<commit_msg>Add missing #ifdef in benchmark.cpp<commit_after>\/*******************************************************************************\n * src\/benchmark.cpp\n *\n * Copyright (C) 2017 Florian Kurpicz <florian.kurpicz@tu-dortmund.de>\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#include <tclap\/CmdLine.h>\n#include <vector>\n\n#include \"benchmark\/algorithm.hpp\"\n#include \"util\/alphabet_util.hpp\"\n#include \"util\/file_util.hpp\"\n#include \"util\/stxxl_helper.hpp\"\n#include \"util\/memory_types.hpp\"\n\n#ifdef MALLOC_COUNT\n#include \"benchmark\/malloc_count.h\"\n#endif \/\/ MALLOC_COUNT\n\nauto filter_parallel(bool only_parallel, bool is_parallel) {\n return (!only_parallel || is_parallel);\n}\n\nauto filter_sequential(bool sequential, bool is_parallel) {\n return (!sequential || !is_parallel);\n}\n\nauto filter_wavelet_type(bool is_tree, bool no_trees, bool no_matrices) {\n return (is_tree ? !no_trees : !no_matrices);\n}\n\nstatic TCLAP::SwitchArg list_all_algorithms(\"l\", \"list\",\n \"Print the name and description of all registered algorithms\", false);\nstatic TCLAP::MultiArg<std::string> file_path_arg(\"f\", \"file\",\n \"Path to the text file.\", false, \"string\");\nstatic TCLAP::ValueArg<std::string> filter_arg(\"n\", \"name\",\n \"Runs all algorithms that contain the <name> in their name\", false, \"\",\n \"string\");\nstatic TCLAP::ValueArg<int32_t> word_width_arg(\"b\", \"byte\",\n \"Bytes per char in the input text.\", false, 1, \"uint8_t\");\nstatic TCLAP::ValueArg<int32_t> nr_runs_arg(\"r\", \"runs\",\n \"Number of repetitions of the construction algorithm.\",\n false, 5, \"int32_t\");\nstatic TCLAP::SwitchArg run_only_parallel_arg(\"p\", \"parallel\",\n \"Run only parallel construction algorithms.\", false);\nstatic TCLAP::SwitchArg run_only_sequential_arg(\"s\", \"sequential\",\n \"Run only sequential construction algorithms.\", false);\nstatic TCLAP::SwitchArg no_trees_arg(\"m\", \"no_trees\",\n \"Skip all wavelet trees construction algorithms.\", false);\nstatic TCLAP::SwitchArg no_matrices_arg(\"t\", \"no_matrices\",\n \"Skip all wavelet matrices construction algorithms.\", false);\nstatic TCLAP::SwitchArg memory_arg(\"\", \"memory\",\n \"Compute peak memory during construction.\", false);\nstatic TCLAP::SwitchArg external_input_arg(\"i\", \"external_input\",\n \"Run only algorithms that stream the input instead of keeping it in RAM.\", false);\nstatic TCLAP::SwitchArg external_output_arg(\"o\", \"external_output\",\n \"Run only algorithms that stream the output instead of keeping it in RAM.\", false);\nstatic TCLAP::SwitchArg external_both_arg(\"e\", \"external\",\n \"Run only algorithms that use external memory\", false);\n\ntemplate <memory_mode mem_mode>\nint32_t run();\n\nint32_t main(int32_t argc, char const* argv[]) {\n TCLAP::CmdLine cmd(\"Benchmark for wavelet tree (and matrix) construction\",\n ' ', \"0.2\");\n cmd.add(list_all_algorithms);\n cmd.add(file_path_arg);\n cmd.add(filter_arg);\n cmd.add(word_width_arg);\n cmd.add(nr_runs_arg);\n cmd.add(run_only_parallel_arg);\n cmd.add(run_only_sequential_arg);\n cmd.add(no_trees_arg);\n cmd.add(no_matrices_arg);\n cmd.add(memory_arg);\n cmd.add(external_input_arg);\n cmd.add(external_output_arg);\n cmd.add(external_both_arg);\n cmd.parse( argc, argv );\n\n if(external_both_arg.getValue()) \n return run<memory_mode::external>();\n else if(external_input_arg.getValue() && external_output_arg.getValue()) \n return run<memory_mode::external>();\n else if(external_input_arg.getValue()) \n return run<memory_mode::external_input>();\n else if(external_output_arg.getValue()) \n return run<memory_mode::external_output>();\n else return run<memory_mode::internal>();\n}\n\ntemplate <memory_mode mem_mode>\nint32_t run() {\n\n if (list_all_algorithms.getValue()) {\n auto& algo_list_int = \n algorithm_list<memory_mode::internal>::get_algorithm_list();\n auto& algo_list_ext_in = \n algorithm_list<memory_mode::external_input>::get_algorithm_list();\n auto& algo_list_ext_out = \n algorithm_list<memory_mode::external_output>::get_algorithm_list();\n auto& algo_list_ext_both = \n algorithm_list<memory_mode::external>::get_algorithm_list();\n for (const auto& a : algo_list_int) a->print_info();\n for (const auto& a : algo_list_ext_in) a->print_info();\n for (const auto& a : algo_list_ext_out) a->print_info();\n for (const auto& a : algo_list_ext_both) a->print_info();\n return 0;\n }\n \n auto& algo_list = algorithm_list<mem_mode>::get_algorithm_list();\n\n const std::vector<std::string> file_paths = file_path_arg.getValue();\n std::string filter = filter_arg.getValue();\n const int32_t word_width = word_width_arg.getValue();\n const int32_t nr_runs = nr_runs_arg.getValue();\n const bool run_only_parallel = run_only_parallel_arg.getValue();\n const bool run_only_sequential = run_only_sequential_arg.getValue();\n const bool no_trees = no_trees_arg.getValue();\n const bool no_matrices = no_matrices_arg.getValue();\n const bool memory = memory_arg.getValue();\n\n constexpr bool ext_input = \n mem_mode == memory_mode::external || \n mem_mode == memory_mode::external_input;\n constexpr bool ext_output = \n mem_mode == memory_mode::external || \n mem_mode == memory_mode::external_output;\n \n for (const auto& path : file_paths) {\n std::cout << std::endl << \"Text: \" << path << std::endl;\n\n void * txt_prt = nullptr;\n \n uint64_t txt_bytes = 0;\n uint64_t all_bytes = 0;\n uint64_t text_size = 0;\n uint64_t max_char = 0;\n uint64_t levels = 0;\n std::string txt_path;\n \n std::vector<uint8_t> text_uint8;\n std::vector<uint16_t> text_uint16;\n std::vector<uint32_t> text_uint32;\n std::vector<uint64_t> text_uint64;\n uint8_t * text_uint8_data = nullptr;\n uint16_t * text_uint16_data = nullptr;\n uint32_t * text_uint32_data = nullptr;\n uint64_t * text_uint64_data = nullptr;\n\n stxxlvector<type_for_bytes<1>::type> * text_uint8_ext = nullptr;\n stxxlvector<type_for_bytes<2>::type> * text_uint16_ext = nullptr;\n stxxlvector<type_for_bytes<4>::type> * text_uint32_ext = nullptr;\n stxxlvector<type_for_bytes<8>::type> * text_uint64_ext = nullptr;\n\n #ifdef MALLOC_COUNT\n malloc_count_reset_peak();\n uint64_t non_text_bytes = malloc_count_current();\n #endif \/\/ MALLOC_COUNT\n \n if(!ext_input) {\n \/\/ INTERNAL MEMORY INPUT\n if (word_width == 1) {\n text_uint8 = file_to_vector<1>(path);\n text_size = text_uint8.size();\n max_char = reduce_alphabet(text_uint8);\n text_uint8_data = text_uint8.data();\n txt_prt = &text_uint8_data;\n } else if (word_width == 2) {\n text_uint16 = file_to_vector<2>(path);\n text_size = text_uint16.size();\n max_char = reduce_alphabet(text_uint16);\n text_uint16_data = text_uint16.data();\n txt_prt = &text_uint16_data;\n } else if (word_width == 4) {\n text_uint32 = file_to_vector<4>(path);\n text_size = text_uint32.size();\n max_char = reduce_alphabet(text_uint32);\n text_uint32_data = text_uint32.data();\n txt_prt = &text_uint32_data;\n } else if (word_width == 8) {\n text_uint64 = file_to_vector<8>(path);\n text_size = text_uint64.size();\n max_char = reduce_alphabet(text_uint64);\n text_uint64_data = text_uint64.data();\n txt_prt = &text_uint64_data;\n } else {\n std::cerr << \"You entered an invalid number of bytes per character \"\n \"(parameter 'b').\" << std::endl;\n return -1;\n }\n } else {\n \/\/ EXTERNAL MEMORY INPUT\n \/\/~ stxxl::linuxaio_file stxxl_file(path, stxxl::file::open_mode::RDONLY);\n stxxl::syscall_file stxxl_file(path, stxxl::file::open_mode::RDONLY);\n if (word_width == 1) {\n const stxxlvector<type_for_bytes<1>::type> unreduced_vector(&stxxl_file);\n text_size = unreduced_vector.size();\n text_uint8_ext = new stxxlvector<type_for_bytes<1>::type>();\n max_char = reduce_alphabet<type_for_bytes<1>::type>(unreduced_vector, *text_uint8_ext);\n txt_prt = text_uint8_ext; \n } else if (word_width == 2) {\n const stxxlvector<type_for_bytes<2>::type> unreduced_vector(&stxxl_file);\n text_size = unreduced_vector.size();\n text_uint16_ext = new stxxlvector<type_for_bytes<2>::type>();\n max_char = reduce_alphabet<type_for_bytes<2>::type>(unreduced_vector, *text_uint16_ext);\n txt_prt = text_uint16_ext; \n } else if (word_width == 4) {\n const stxxlvector<type_for_bytes<4>::type> unreduced_vector(&stxxl_file);\n text_size = unreduced_vector.size();\n text_uint32_ext = new stxxlvector<type_for_bytes<4>::type>();\n max_char = reduce_alphabet<type_for_bytes<4>::type>(unreduced_vector, *text_uint32_ext);\n txt_prt = text_uint32_ext; \n } else if (word_width == 8) {\n const stxxlvector<type_for_bytes<8>::type> unreduced_vector(&stxxl_file);\n text_size = unreduced_vector.size();\n text_uint64_ext = new stxxlvector<type_for_bytes<8>::type>();\n max_char = reduce_alphabet<type_for_bytes<8>::type>(unreduced_vector, *text_uint64_ext);\n txt_prt = text_uint64_ext; \n } else {\n std::cerr << \"You entered an invalid number of bytes per character \"\n \"(parameter 'b').\" << std::endl;\n return -1;\n }\n }\n levels = levels_for_max_char(max_char);\n \n #ifdef MALLOC_COUNT\n all_bytes = malloc_count_current();\n txt_bytes = all_bytes - non_text_bytes;\n #endif \/\/ MALLOC_COUNT\n\n std::cout << \"Characters: \" << text_size << std::endl;\n std::cout << \"Levels: \" << levels << std::endl;\n \n #ifdef MALLOC_COUNT\n std::cout << \"Memory peak text: \" << txt_bytes << \", MB: \"\n << txt_bytes \/ (1024 * 1024) << std::endl;\n std::cout << \"Memory peak total: \" << all_bytes << \", MB: \"\n << all_bytes \/ (1024 * 1024) << std::endl;\n #endif \/\/ MALLOC_COUNT\n\n for (const auto& a : algo_list) {\n if (filter == \"\" || (a->name().find(filter) != std::string::npos)) {\n if (a->word_width() == word_width) {\n if (filter_parallel(run_only_parallel, a->is_parallel())) {\n if (filter_sequential(run_only_sequential, a->is_parallel())) {\n if (filter_wavelet_type(a->is_tree(), no_trees, no_matrices)) {\n a->print_info();\n if (memory) {\n #ifdef MALLOC_COUNT\n malloc_count_reset_peak();\n a->memory_peak(txt_prt, text_size, levels);\n std::cout << malloc_count_peak() << \", MB: \"\n << malloc_count_peak() \/ (1024 * 1024) << std::endl;\n #else\n std::cout << \"Memory measurement is NOT enabled.\"\n << std::endl;\n #endif \/\/ MALLOC_COUNT\n } else {\n std::cout << a->median_time(\n txt_prt, text_size, levels, nr_runs) << std::endl;\n }\n }\n }\n }\n }\n }\n }\n \n delete text_uint8_ext; \n delete text_uint16_ext;\n delete text_uint32_ext;\n delete text_uint64_ext;\n }\n return 0;\n}\n\n\/******************************************************************************\/\n<|endoftext|>"} {"text":"<commit_before>#include <algorithm>\n#include <map>\n#include <string>\n#include <limits>\n\n#include \"Prefetch.h\"\n#include \"CodeGen_Internal.h\"\n#include \"IRMutator.h\"\n#include \"IROperator.h\"\n#include \"Bounds.h\"\n#include \"Scope.h\"\n#include \"Simplify.h\"\n#include \"Substitute.h\"\n#include \"Util.h\"\n\nnamespace Halide {\nnamespace Internal {\n\nusing std::map;\nusing std::string;\nusing std::vector;\nusing std::stack;\nusing std::pair;\n\n\/\/ Prefetch debug levels\nint dbg_prefetch1 = 1;\nint dbg_prefetch2 = 2;\nint dbg_prefetch3 = 3;\nint dbg_prefetch4 = 4;\nint dbg_prefetch5 = 5;\n\n#define MIN(x,y) (((x)<(y)) ? (x) : (y))\n#define MAX(x,y) (((x)>(y)) ? (x) : (y))\n\nclass InjectPrefetch : public IRMutator {\npublic:\n InjectPrefetch(const map<string, Function> &e)\n : env(e) { }\nprivate:\n const map<string, Function> &env; \/\/ Environment\n Scope<Interval> scope; \/\/ Interval scope\n Scope<int> rscope; \/\/ Realize scope\n unsigned long ptmp = 0; \/\/ ID for all tmp vars in a prefetch op\n\nprivate:\n using IRMutator::visit;\n\n \/\/ Strip down the tuple name, e.g. f.*.var into f\n string tuple_func(const string &name) {\n vector<string> v = split_string(name, \".\");\n internal_assert(v.size() > 0);\n return v[0];\n }\n\n \/\/ Strip down the tuple name, e.g. f.*.var into var\n string tuple_var(const string &name) {\n vector<string> v = split_string(name, \".\");\n internal_assert(v.size() > 0);\n return v[v.size()-1];\n }\n\n \/\/ Lookup a function in the environment\n Function get_func(const string &name) {\n map<string, Function>::const_iterator iter = env.find(name);\n internal_assert(iter != env.end()) << \"function not in environment.\\n\";\n return iter->second;\n }\n\n \/\/ Determine the static type of a named buffer (if available)\n \/\/\n \/\/ Note: If the type cannot be determined, the variable will\n \/\/ be flagged as not having a static type (e.g. the type\n \/\/ of input is only known at runtime, input.elem_size).\n \/\/\n Type get_type(string varname, bool &has_static_type) {\n has_static_type = false;\n debug(dbg_prefetch4) << \" getType(\" << varname << \")\";\n Type t = UInt(8); \/\/ default type\n map<string, Function>::const_iterator varit = env.find(varname);\n if (varit != env.end()) {\n Function varf = varit->second;\n debug(dbg_prefetch4) << \" found: \" << varit->first;\n if (varf.outputs()) {\n vector<Type> varts = varf.output_types();\n t = varts[0];\n has_static_type = true;\n }\n } else {\n debug(dbg_prefetch4) << \" not found\";\n }\n\n if (has_static_type) {\n debug(dbg_prefetch4) << \", type: \" << t << \"\\n\";\n } else {\n debug(dbg_prefetch4) << \", no static type\\n\";\n }\n\n return t;\n }\n\n \/\/ Generate the required prefetch code (lets and statements) for the\n \/\/ specified varname and box\n \/\/\n void prefetch_box(const string &varname, Box &box,\n vector<pair<string, Expr>> &plets, vector<Stmt> &pstmts)\n {\n bool do_prefetch = true;\n int dims = box.size();\n bool has_static_type = true;\n Type t = get_type(varname, has_static_type);\n string elem_size_name = varname + \".elem_size\";\n Expr elem_size_bytes;\n\n if (rscope.contains(varname)) {\n debug(dbg_prefetch2) << \" Found realize node for \" << varname << \"\\n\";\n debug(dbg_prefetch1) << \" Info: not prefetching realized \" << varname << \"\\n\";\n return;\n }\n if (has_static_type) {\n elem_size_bytes = t.bytes();\n } else { \/\/ Use element size for inputs that don't have static types\n Expr elem_size_var = Variable::make(Int(32), elem_size_name);\n elem_size_bytes = elem_size_var;\n }\n\n std::ostringstream ss; ss << t;\n string type_name = ss.str();\n debug(dbg_prefetch1) << \" prefetch #\" << ptmp << \": \"\n << varname << \" (\"\n << (has_static_type ? type_name : elem_size_name)\n << \", dims:\" << dims << \")\\n\";\n\n for (int i = 0; i < dims; i++) {\n debug(dbg_prefetch3) << \" ---\\n\";\n debug(dbg_prefetch3) << \" box[\" << i << \"].min: \" << box[i].min << \"\\n\";\n debug(dbg_prefetch3) << \" box[\" << i << \"].max: \" << box[i].max << \"\\n\";\n }\n debug(dbg_prefetch3) << \" ---------\\n\";\n\n \/\/ TODO: Opt: check box if it should be prefetched?\n \/\/ TODO - Only prefetch if varying by ivar_name?\n \/\/ TODO - Don't prefetch if \"small\" all constant dimensions?\n \/\/ TODO e.g. see: camera_pipe.cpp corrected matrix(4,3)\n\n string pstr = std::to_string(ptmp++);\n string varname_prefetch_buf = varname + \"_prefetch_\" + pstr + \"_buf\";\n Expr var_prefetch_buf = Variable::make(Int(32), varname_prefetch_buf);\n\n \/\/ Establish the variables for buffer strides, box min & max\n vector<Expr> stride_var(dims);\n vector<Expr> extent_var(dims);\n vector<Expr> min_var(dims);\n vector<Expr> max_var(dims);\n for (int i = 0; i < dims; i++) {\n string istr = std::to_string(i);\n \/\/ string extent_name = varname + \".extent.\" + istr;\n string stride_name = varname + \".stride.\" + istr;\n string extent_name = varname + \".extent.\" + istr;\n string min_name = varname + \"_prefetch_\" + pstr + \"_min_\" + istr;\n string max_name = varname + \"_prefetch_\" + pstr + \"_max_\" + istr;\n\n stride_var[i] = Variable::make(Int(32), stride_name);\n extent_var[i] = Variable::make(Int(32), extent_name);\n min_var[i] = Variable::make(Int(32), min_name);\n max_var[i] = Variable::make(Int(32), max_name);\n\n \/\/ Record let assignments\n \/\/ except for stride, already defined elsewhere\n plets.push_back(make_pair(min_name, box[i].min));\n plets.push_back(make_pair(max_name, box[i].max));\n }\n\n \/\/ This box should not be prefetched\n if (!do_prefetch) {\n debug(dbg_prefetch1) << \" Info: not prefetching \" << varname << \"\\n\";\n return;\n }\n\n \/\/ Create a buffer_t object for this prefetch.\n vector<Expr> args(dims*3 + 2);\n\n Expr first_elem = Load::make(t, varname, 0, Buffer(), Parameter());\n args[0] = Call::make(Handle(), Call::address_of, {first_elem}, Call::PureIntrinsic);\n args[1] = make_zero(t);\n for (int i = 0; i < dims; i++) {\n args[3*i+2] = min_var[i];\n args[3*i+3] = max_var[i] - min_var[i] + 1;\n args[3*i+4] = stride_var[i];\n }\n\n \/\/ Create the create_buffer_t call\n Expr prefetch_buf = Call::make(type_of<struct buffer_t *>(), Call::create_buffer_t,\n args, Call::Intrinsic);\n plets.push_back(make_pair(varname_prefetch_buf, prefetch_buf));\n\n \/\/ Create the prefetch call\n Expr num_elem = stride_var[dims-1] * extent_var[dims-1];\n vector<Expr> args_prefetch(4);\n args_prefetch[0] = dims;\n args_prefetch[1] = elem_size_bytes;\n args_prefetch[2] = num_elem;\n args_prefetch[3] = var_prefetch_buf;\n Stmt stmt_prefetch = Evaluate::make(Call::make(Int(32), Call::prefetch_buffer_t,\n args_prefetch, Call::Intrinsic));\n \/\/ TODO: Opt: Keep running sum of bytes prefetched on this sequence?\n \/\/ TODO: Opt: Keep running sum of number of prefetch instructions issued\n \/\/ TODO on this sequence? (to not exceed MAX_PREFETCH)\n \/\/ TODO: Opt: Generate more control code for prefetch_buffer_t in Prefetch.cpp?\n \/\/ TODO Passing box info through a buffer_t results in ~30 additional stores\/loads\n\n pstmts.push_back(stmt_prefetch);\n }\n\n \/\/ Inject the generated prefetch code\n \/\/\n \/\/ Note: plets\/pstmts may be modified or partially emptied during injection\n \/\/\n void inject_prefetch_stmts(const For *op, const Prefetch &p,\n vector<pair<string, Expr>> &plets, vector<Stmt> &pstmts, Stmt &body)\n {\n if (pstmts.size() > 0) {\n Stmt pbody = pstmts.back(); \/\/ Initialize prefetch body\n pstmts.pop_back();\n for (size_t i = pstmts.size(); i > 0; i--) {\n pbody = Block::make(pstmts[i-1], pbody);\n }\n for (size_t i = plets.size(); i > 0; i--) {\n pbody = LetStmt::make(plets[i-1].first, plets[i-1].second, pbody);\n }\n\n \/\/ No guard needed, address range checked in prefetch runtime\n body = Block::make({pbody, body});\n debug(dbg_prefetch4) << pbody << \"\\n\";\n }\n }\n\n void visit(const Let *op) {\n Interval in = bounds_of_expr_in_scope(op->value, scope);\n scope.push(op->name, in);\n debug(dbg_prefetch5) << \"Let scope.push(\" << op->name << \")\\n\";\n IRMutator::visit(op);\n debug(dbg_prefetch5) << \"Let scope.pop(\" << op->name << \")\\n\";\n scope.pop(op->name);\n }\n\n void visit(const LetStmt *op) {\n Interval in = bounds_of_expr_in_scope(op->value, scope);\n scope.push(op->name, in);\n debug(dbg_prefetch5) << \"LetStmt scope.push(\" << op->name << \")\\n\";\n IRMutator::visit(op);\n debug(dbg_prefetch5) << \"LetStmt scope.pop(\" << op->name << \")\\n\";\n scope.pop(op->name);\n }\n\n void visit(const Realize *op) {\n rscope.push(op->name, 1);\n debug(dbg_prefetch5) << \"Realize push(\" << op->name << \")\\n\";\n IRMutator::visit(op);\n }\n\n void visit(const For *op) {\n Stmt body = op->body;\n\n string func_name = tuple_func(op->name);\n string ivar_name = tuple_var(op->name);\n vector<Prefetch> &prefetches = get_func(func_name).schedule().prefetches();\n\n \/\/ Add loop variable to interval scope for any inner loop prefetch\n Expr var = Variable::make(Int(32), op->name);\n Interval prein(var, var);\n scope.push(op->name, prein);\n debug(dbg_prefetch5) << \"For scope.push(\" << op->name << \", (\" << var << \"))\\n\";\n\n debug(dbg_prefetch4) << \"For: \" << op->name << \" \" << func_name << \" \" << ivar_name << \"\\n\";\n if (prefetches.empty()) {\n debug(dbg_prefetch4) << \" No prefetch directives in schedule\\n\";\n } else {\n debug(dbg_prefetch4) << \" Found prefetch directive(s) in schedule\\n\";\n }\n\n body = mutate(body);\n\n for (const Prefetch &p : prefetches) {\n debug(dbg_prefetch4) << \" Check prefetch ivar: \" << p.var << \" == \" << ivar_name << \"\\n\";\n if (p.var == ivar_name) {\n debug(dbg_prefetch4) << \" Found directive matching \" << ivar_name << \"\\n\";\n debug(dbg_prefetch1) << \" \" << func_name\n << \" prefetch(\" << ivar_name << \", \" << p.offset << \")\\n\";\n\n \/\/ Add loop variable + prefetch offset to interval scope for box computation\n Expr var = Variable::make(Int(32), op->name);\n Interval prein(var + p.offset, var + p.offset);\n scope.push(op->name, prein);\n debug(dbg_prefetch5) << \" For scope.push(\" << op->name << \", (\"\n << var << \" + \" << p.offset << \", \"\n << var << \" + \" << p.offset << \"))\\n\";\n\n map<string, Box> boxes;\n boxes = boxes_required(body, scope);\n \/\/ TODO: Opt: prefetch the difference from previous iteration\n \/\/ to the requested iteration (2 calls to boxes_required)\n\n vector<pair<string, Expr>> plets; \/\/ Prefetch let assignments\n vector<Stmt> pstmts; \/\/ Prefetch stmt sequence\n debug(dbg_prefetch3) << \" boxes required:\\n\";\n for (auto &b : boxes) {\n const string &varname = b.first;\n Box &box = b.second;\n prefetch_box(varname, box, plets, pstmts);\n }\n\n inject_prefetch_stmts(op, p, plets, pstmts, body);\n\n debug(dbg_prefetch5) << \" For scope.pop(\" << op->name << \")\\n\";\n scope.pop(op->name);\n }\n }\n\n debug(dbg_prefetch5) << \"For scope.pop(\" << op->name << \")\\n\";\n scope.pop(op->name);\n\n stmt = For::make(op->name, op->min, op->extent, op->for_type, op->device_api, body);\n debug(dbg_prefetch4) << \"EndFor: \" << op->name << \"\\n\";\n }\n\n};\n\nStmt inject_prefetch(Stmt s, const std::map<std::string, Function> &env)\n{\n size_t read;\n std::string lvl = get_env_variable(\"HL_DEBUG_PREFETCH\", read);\n if (read) {\n int dbg_level = atoi(lvl.c_str());\n dbg_prefetch1 = MAX(dbg_prefetch1 - dbg_level, 0);\n dbg_prefetch2 = MAX(dbg_prefetch2 - dbg_level, 0);\n dbg_prefetch3 = MAX(dbg_prefetch3 - dbg_level, 0);\n dbg_prefetch4 = MAX(dbg_prefetch4 - dbg_level, 0);\n dbg_prefetch5 = MAX(dbg_prefetch5 - dbg_level, 0);\n }\n\n debug(dbg_prefetch1) << \"prefetch:\\n\";\n return InjectPrefetch(env).mutate(s);\n}\n\n}\n}\n<commit_msg>Fix Travis build failure: Buffer() -> BufferPtr()<commit_after>#include <algorithm>\n#include <map>\n#include <string>\n#include <limits>\n\n#include \"Prefetch.h\"\n#include \"CodeGen_Internal.h\"\n#include \"IRMutator.h\"\n#include \"IROperator.h\"\n#include \"Bounds.h\"\n#include \"Scope.h\"\n#include \"Simplify.h\"\n#include \"Substitute.h\"\n#include \"Util.h\"\n\nnamespace Halide {\nnamespace Internal {\n\nusing std::map;\nusing std::string;\nusing std::vector;\nusing std::stack;\nusing std::pair;\n\n\/\/ Prefetch debug levels\nint dbg_prefetch1 = 1;\nint dbg_prefetch2 = 2;\nint dbg_prefetch3 = 3;\nint dbg_prefetch4 = 4;\nint dbg_prefetch5 = 5;\n\n#define MIN(x,y) (((x)<(y)) ? (x) : (y))\n#define MAX(x,y) (((x)>(y)) ? (x) : (y))\n\nclass InjectPrefetch : public IRMutator {\npublic:\n InjectPrefetch(const map<string, Function> &e)\n : env(e) { }\nprivate:\n const map<string, Function> &env; \/\/ Environment\n Scope<Interval> scope; \/\/ Interval scope\n Scope<int> rscope; \/\/ Realize scope\n unsigned long ptmp = 0; \/\/ ID for all tmp vars in a prefetch op\n\nprivate:\n using IRMutator::visit;\n\n \/\/ Strip down the tuple name, e.g. f.*.var into f\n string tuple_func(const string &name) {\n vector<string> v = split_string(name, \".\");\n internal_assert(v.size() > 0);\n return v[0];\n }\n\n \/\/ Strip down the tuple name, e.g. f.*.var into var\n string tuple_var(const string &name) {\n vector<string> v = split_string(name, \".\");\n internal_assert(v.size() > 0);\n return v[v.size()-1];\n }\n\n \/\/ Lookup a function in the environment\n Function get_func(const string &name) {\n map<string, Function>::const_iterator iter = env.find(name);\n internal_assert(iter != env.end()) << \"function not in environment.\\n\";\n return iter->second;\n }\n\n \/\/ Determine the static type of a named buffer (if available)\n \/\/\n \/\/ Note: If the type cannot be determined, the variable will\n \/\/ be flagged as not having a static type (e.g. the type\n \/\/ of input is only known at runtime, input.elem_size).\n \/\/\n Type get_type(string varname, bool &has_static_type) {\n has_static_type = false;\n debug(dbg_prefetch4) << \" getType(\" << varname << \")\";\n Type t = UInt(8); \/\/ default type\n map<string, Function>::const_iterator varit = env.find(varname);\n if (varit != env.end()) {\n Function varf = varit->second;\n debug(dbg_prefetch4) << \" found: \" << varit->first;\n if (varf.outputs()) {\n vector<Type> varts = varf.output_types();\n t = varts[0];\n has_static_type = true;\n }\n } else {\n debug(dbg_prefetch4) << \" not found\";\n }\n\n if (has_static_type) {\n debug(dbg_prefetch4) << \", type: \" << t << \"\\n\";\n } else {\n debug(dbg_prefetch4) << \", no static type\\n\";\n }\n\n return t;\n }\n\n \/\/ Generate the required prefetch code (lets and statements) for the\n \/\/ specified varname and box\n \/\/\n void prefetch_box(const string &varname, Box &box,\n vector<pair<string, Expr>> &plets, vector<Stmt> &pstmts)\n {\n bool do_prefetch = true;\n int dims = box.size();\n bool has_static_type = true;\n Type t = get_type(varname, has_static_type);\n string elem_size_name = varname + \".elem_size\";\n Expr elem_size_bytes;\n\n if (rscope.contains(varname)) {\n debug(dbg_prefetch2) << \" Found realize node for \" << varname << \"\\n\";\n debug(dbg_prefetch1) << \" Info: not prefetching realized \" << varname << \"\\n\";\n return;\n }\n if (has_static_type) {\n elem_size_bytes = t.bytes();\n } else { \/\/ Use element size for inputs that don't have static types\n Expr elem_size_var = Variable::make(Int(32), elem_size_name);\n elem_size_bytes = elem_size_var;\n }\n\n std::ostringstream ss; ss << t;\n string type_name = ss.str();\n debug(dbg_prefetch1) << \" prefetch #\" << ptmp << \": \"\n << varname << \" (\"\n << (has_static_type ? type_name : elem_size_name)\n << \", dims:\" << dims << \")\\n\";\n\n for (int i = 0; i < dims; i++) {\n debug(dbg_prefetch3) << \" ---\\n\";\n debug(dbg_prefetch3) << \" box[\" << i << \"].min: \" << box[i].min << \"\\n\";\n debug(dbg_prefetch3) << \" box[\" << i << \"].max: \" << box[i].max << \"\\n\";\n }\n debug(dbg_prefetch3) << \" ---------\\n\";\n\n \/\/ TODO: Opt: check box if it should be prefetched?\n \/\/ TODO - Only prefetch if varying by ivar_name?\n \/\/ TODO - Don't prefetch if \"small\" all constant dimensions?\n \/\/ TODO e.g. see: camera_pipe.cpp corrected matrix(4,3)\n\n string pstr = std::to_string(ptmp++);\n string varname_prefetch_buf = varname + \"_prefetch_\" + pstr + \"_buf\";\n Expr var_prefetch_buf = Variable::make(Int(32), varname_prefetch_buf);\n\n \/\/ Establish the variables for buffer strides, box min & max\n vector<Expr> stride_var(dims);\n vector<Expr> extent_var(dims);\n vector<Expr> min_var(dims);\n vector<Expr> max_var(dims);\n for (int i = 0; i < dims; i++) {\n string istr = std::to_string(i);\n \/\/ string extent_name = varname + \".extent.\" + istr;\n string stride_name = varname + \".stride.\" + istr;\n string extent_name = varname + \".extent.\" + istr;\n string min_name = varname + \"_prefetch_\" + pstr + \"_min_\" + istr;\n string max_name = varname + \"_prefetch_\" + pstr + \"_max_\" + istr;\n\n stride_var[i] = Variable::make(Int(32), stride_name);\n extent_var[i] = Variable::make(Int(32), extent_name);\n min_var[i] = Variable::make(Int(32), min_name);\n max_var[i] = Variable::make(Int(32), max_name);\n\n \/\/ Record let assignments\n \/\/ except for stride, already defined elsewhere\n plets.push_back(make_pair(min_name, box[i].min));\n plets.push_back(make_pair(max_name, box[i].max));\n }\n\n \/\/ This box should not be prefetched\n if (!do_prefetch) {\n debug(dbg_prefetch1) << \" Info: not prefetching \" << varname << \"\\n\";\n return;\n }\n\n \/\/ Create a buffer_t object for this prefetch.\n vector<Expr> args(dims*3 + 2);\n\n Expr first_elem = Load::make(t, varname, 0, BufferPtr(), Parameter());\n args[0] = Call::make(Handle(), Call::address_of, {first_elem}, Call::PureIntrinsic);\n args[1] = make_zero(t);\n for (int i = 0; i < dims; i++) {\n args[3*i+2] = min_var[i];\n args[3*i+3] = max_var[i] - min_var[i] + 1;\n args[3*i+4] = stride_var[i];\n }\n\n \/\/ Create the create_buffer_t call\n Expr prefetch_buf = Call::make(type_of<struct buffer_t *>(), Call::create_buffer_t,\n args, Call::Intrinsic);\n plets.push_back(make_pair(varname_prefetch_buf, prefetch_buf));\n\n \/\/ Create the prefetch call\n Expr num_elem = stride_var[dims-1] * extent_var[dims-1];\n vector<Expr> args_prefetch(4);\n args_prefetch[0] = dims;\n args_prefetch[1] = elem_size_bytes;\n args_prefetch[2] = num_elem;\n args_prefetch[3] = var_prefetch_buf;\n Stmt stmt_prefetch = Evaluate::make(Call::make(Int(32), Call::prefetch_buffer_t,\n args_prefetch, Call::Intrinsic));\n \/\/ TODO: Opt: Keep running sum of bytes prefetched on this sequence?\n \/\/ TODO: Opt: Keep running sum of number of prefetch instructions issued\n \/\/ TODO on this sequence? (to not exceed MAX_PREFETCH)\n \/\/ TODO: Opt: Generate more control code for prefetch_buffer_t in Prefetch.cpp?\n \/\/ TODO Passing box info through a buffer_t results in ~30 additional stores\/loads\n\n pstmts.push_back(stmt_prefetch);\n }\n\n \/\/ Inject the generated prefetch code\n \/\/\n \/\/ Note: plets\/pstmts may be modified or partially emptied during injection\n \/\/\n void inject_prefetch_stmts(const For *op, const Prefetch &p,\n vector<pair<string, Expr>> &plets, vector<Stmt> &pstmts, Stmt &body)\n {\n if (pstmts.size() > 0) {\n Stmt pbody = pstmts.back(); \/\/ Initialize prefetch body\n pstmts.pop_back();\n for (size_t i = pstmts.size(); i > 0; i--) {\n pbody = Block::make(pstmts[i-1], pbody);\n }\n for (size_t i = plets.size(); i > 0; i--) {\n pbody = LetStmt::make(plets[i-1].first, plets[i-1].second, pbody);\n }\n\n \/\/ No guard needed, address range checked in prefetch runtime\n body = Block::make({pbody, body});\n debug(dbg_prefetch4) << pbody << \"\\n\";\n }\n }\n\n void visit(const Let *op) {\n Interval in = bounds_of_expr_in_scope(op->value, scope);\n scope.push(op->name, in);\n debug(dbg_prefetch5) << \"Let scope.push(\" << op->name << \")\\n\";\n IRMutator::visit(op);\n debug(dbg_prefetch5) << \"Let scope.pop(\" << op->name << \")\\n\";\n scope.pop(op->name);\n }\n\n void visit(const LetStmt *op) {\n Interval in = bounds_of_expr_in_scope(op->value, scope);\n scope.push(op->name, in);\n debug(dbg_prefetch5) << \"LetStmt scope.push(\" << op->name << \")\\n\";\n IRMutator::visit(op);\n debug(dbg_prefetch5) << \"LetStmt scope.pop(\" << op->name << \")\\n\";\n scope.pop(op->name);\n }\n\n void visit(const Realize *op) {\n rscope.push(op->name, 1);\n debug(dbg_prefetch5) << \"Realize push(\" << op->name << \")\\n\";\n IRMutator::visit(op);\n }\n\n void visit(const For *op) {\n Stmt body = op->body;\n\n string func_name = tuple_func(op->name);\n string ivar_name = tuple_var(op->name);\n vector<Prefetch> &prefetches = get_func(func_name).schedule().prefetches();\n\n \/\/ Add loop variable to interval scope for any inner loop prefetch\n Expr var = Variable::make(Int(32), op->name);\n Interval prein(var, var);\n scope.push(op->name, prein);\n debug(dbg_prefetch5) << \"For scope.push(\" << op->name << \", (\" << var << \"))\\n\";\n\n debug(dbg_prefetch4) << \"For: \" << op->name << \" \" << func_name << \" \" << ivar_name << \"\\n\";\n if (prefetches.empty()) {\n debug(dbg_prefetch4) << \" No prefetch directives in schedule\\n\";\n } else {\n debug(dbg_prefetch4) << \" Found prefetch directive(s) in schedule\\n\";\n }\n\n body = mutate(body);\n\n for (const Prefetch &p : prefetches) {\n debug(dbg_prefetch4) << \" Check prefetch ivar: \" << p.var << \" == \" << ivar_name << \"\\n\";\n if (p.var == ivar_name) {\n debug(dbg_prefetch4) << \" Found directive matching \" << ivar_name << \"\\n\";\n debug(dbg_prefetch1) << \" \" << func_name\n << \" prefetch(\" << ivar_name << \", \" << p.offset << \")\\n\";\n\n \/\/ Add loop variable + prefetch offset to interval scope for box computation\n Expr var = Variable::make(Int(32), op->name);\n Interval prein(var + p.offset, var + p.offset);\n scope.push(op->name, prein);\n debug(dbg_prefetch5) << \" For scope.push(\" << op->name << \", (\"\n << var << \" + \" << p.offset << \", \"\n << var << \" + \" << p.offset << \"))\\n\";\n\n map<string, Box> boxes;\n boxes = boxes_required(body, scope);\n \/\/ TODO: Opt: prefetch the difference from previous iteration\n \/\/ to the requested iteration (2 calls to boxes_required)\n\n vector<pair<string, Expr>> plets; \/\/ Prefetch let assignments\n vector<Stmt> pstmts; \/\/ Prefetch stmt sequence\n debug(dbg_prefetch3) << \" boxes required:\\n\";\n for (auto &b : boxes) {\n const string &varname = b.first;\n Box &box = b.second;\n prefetch_box(varname, box, plets, pstmts);\n }\n\n inject_prefetch_stmts(op, p, plets, pstmts, body);\n\n debug(dbg_prefetch5) << \" For scope.pop(\" << op->name << \")\\n\";\n scope.pop(op->name);\n }\n }\n\n debug(dbg_prefetch5) << \"For scope.pop(\" << op->name << \")\\n\";\n scope.pop(op->name);\n\n stmt = For::make(op->name, op->min, op->extent, op->for_type, op->device_api, body);\n debug(dbg_prefetch4) << \"EndFor: \" << op->name << \"\\n\";\n }\n\n};\n\nStmt inject_prefetch(Stmt s, const std::map<std::string, Function> &env)\n{\n size_t read;\n std::string lvl = get_env_variable(\"HL_DEBUG_PREFETCH\", read);\n if (read) {\n int dbg_level = atoi(lvl.c_str());\n dbg_prefetch1 = MAX(dbg_prefetch1 - dbg_level, 0);\n dbg_prefetch2 = MAX(dbg_prefetch2 - dbg_level, 0);\n dbg_prefetch3 = MAX(dbg_prefetch3 - dbg_level, 0);\n dbg_prefetch4 = MAX(dbg_prefetch4 - dbg_level, 0);\n dbg_prefetch5 = MAX(dbg_prefetch5 - dbg_level, 0);\n }\n\n debug(dbg_prefetch1) << \"prefetch:\\n\";\n return InjectPrefetch(env).mutate(s);\n}\n\n}\n}\n<|endoftext|>"} {"text":"<commit_before>\/*\n * Priority.cpp\n *\n * Copyright 2000, LifeLine Networks BV (www.lifeline.nl). All rights reserved.\n * Copyright 2000, Bastiaan Bakker. All rights reserved.\n *\n * See the COPYING file for the terms of usage and distribution.\n *\/\n\n#include \"log4cpp\/Portability.hh\"\n#include \"log4cpp\/Priority.hh\"\n\nnamespace log4cpp {\n\n const std::string& Priority::getPriorityName(int priority) throw() {\n static std::string names[10] = {\n \"FATAL\", \"ALERT\", \"CRIT\", \"ERROR\", \"WARN\",\n \"NOTICE\", \"INFO\", \"DEBUG\", \"NOTSET\", \"UNKNOWN\" \n };\n \n priority++;\n priority \/= 100;\n return ((priority < 0) || (priority > 8)) ?\n names[8] :\n names[priority - 1];\n }\n}\n<commit_msg>getPriorityName(): use index 'priority' instead of 'priority - 1'.<commit_after>\/*\n * Priority.cpp\n *\n * Copyright 2000, LifeLine Networks BV (www.lifeline.nl). All rights reserved.\n * Copyright 2000, Bastiaan Bakker. All rights reserved.\n *\n * See the COPYING file for the terms of usage and distribution.\n *\/\n\n#include \"log4cpp\/Portability.hh\"\n#include \"log4cpp\/Priority.hh\"\n\nnamespace log4cpp {\n\n const std::string& Priority::getPriorityName(int priority) throw() {\n static std::string names[10] = {\n \"FATAL\", \"ALERT\", \"CRIT\", \"ERROR\", \"WARN\",\n \"NOTICE\", \"INFO\", \"DEBUG\", \"NOTSET\", \"UNKNOWN\" \n };\n \n priority++;\n priority \/= 100;\n return names[((priority < 0) || (priority > 8)) ? 8 : priority];\n }\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 <usModuleActivator.h>\n#include <usModuleContext.h>\n\n#include <mitkDicomRTMimeTypes.h>\n#include <mitkRTDoseReaderService.h>\n#include <mitkRTPlanReaderService.h>\n#include <mitkRTStructureSetReaderService.h>\n\nnamespace mitk\n{\n class DicomRTIOActivator : public us::ModuleActivator\n {\n public:\n DicomRTIOActivator()\n {\n }\n\n ~DicomRTIOActivator() = default;\n\n void Load(us::ModuleContext* context) override\n {\n us::ServiceProperties props;\n props[us::ServiceConstants::SERVICE_RANKING()] = 100;\n\n for (const auto& mimeType : DicomRTMimeTypes::Get())\n context->RegisterService(mimeType.get(), props);\n\n m_RTDoseReader.reset(new RTDoseReaderService);\n m_RTPlanReader.reset(new RTPlanReaderService);\n m_RTStructureSetReader.reset(new RTStructureSetReaderService);\n }\n\n void Unload(us::ModuleContext*) override\n {\n }\n\n private:\n std::unique_ptr<RTDoseReaderService> m_RTDoseReader;\n std::unique_ptr<RTPlanReaderService> m_RTPlanReader;\n std::unique_ptr<RTStructureSetReaderService> m_RTStructureSetReader;\n };\n}\n\nUS_EXPORT_MODULE_ACTIVATOR(mitk::DicomRTIOActivator)\n<commit_msg>Prefer std::make_unique() to std::unique_ptr::reset()<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 <usModuleActivator.h>\n#include <usModuleContext.h>\n\n#include <mitkDicomRTMimeTypes.h>\n#include <mitkRTDoseReaderService.h>\n#include <mitkRTPlanReaderService.h>\n#include <mitkRTStructureSetReaderService.h>\n\nnamespace mitk\n{\n class DicomRTIOActivator : public us::ModuleActivator\n {\n public:\n DicomRTIOActivator()\n {\n }\n\n ~DicomRTIOActivator() = default;\n\n void Load(us::ModuleContext* context) override\n {\n us::ServiceProperties props;\n props[us::ServiceConstants::SERVICE_RANKING()] = 100;\n\n for (const auto& mimeType : DicomRTMimeTypes::Get())\n context->RegisterService(mimeType.get(), props);\n\n m_RTDoseReader = std::make_unique<RTDoseReaderService>();\n m_RTPlanReader = std::make_unique<RTPlanReaderService>();\n m_RTStructureSetReader = std::make_unique<RTStructureSetReaderService>();\n }\n\n void Unload(us::ModuleContext*) override\n {\n }\n\n private:\n std::unique_ptr<RTDoseReaderService> m_RTDoseReader;\n std::unique_ptr<RTPlanReaderService> m_RTPlanReader;\n std::unique_ptr<RTStructureSetReaderService> m_RTStructureSetReader;\n };\n}\n\nUS_EXPORT_MODULE_ACTIVATOR(mitk::DicomRTIOActivator)\n<|endoftext|>"} {"text":"<commit_before>\/*\n Copyright (C) 2009 George Kiagiadakis <kiagiadakis.george@gmail.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 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 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 \"pad.h\"\n#include \"caps.h\"\n#include \"element.h\"\n#include <QtCore\/QDebug>\n#include <gst\/gstpad.h>\n#include <gst\/gstutils.h>\n\nnamespace QGst {\n\n\/\/static\nPadPtr Pad::create(PadDirection direction, const QGlib::String & name)\n{\n GstPad *pad = gst_pad_new(name, static_cast<GstPadDirection>(direction));\n return PadPtr::wrap(pad, false);\n}\n\nPadDirection Pad::direction() const\n{\n return static_cast<PadDirection>(gst_pad_get_direction(object<GstPad>()));\n}\n\nElementPtr Pad::parentElement() const\n{\n return ElementPtr::wrap(gst_pad_get_parent_element(object<GstPad>()), false);\n}\n\nPadPtr Pad::peer() const\n{\n return PadPtr::wrap(gst_pad_get_peer(object<GstPad>()), false);\n}\n\nbool Pad::isLinked() const\n{\n return gst_pad_is_linked(object<GstPad>());\n}\n\nbool Pad::canLink(const PadPtr & sink) const\n{\n return gst_pad_can_link(object<GstPad>(), sink);\n}\n\nPadLinkReturn Pad::link(const PadPtr & sink)\n{\n return static_cast<PadLinkReturn>(gst_pad_link(object<GstPad>(), sink));\n}\n\nbool Pad::unlink(const PadPtr & sink)\n{\n return gst_pad_unlink(object<GstPad>(), sink);\n}\n\nCapsPtr Pad::caps() const\n{\n return CapsPtr::wrap(gst_pad_get_caps_reffed(object<GstPad>()), false);\n}\n\nCapsPtr Pad::allowedCaps() const\n{\n return CapsPtr::wrap(gst_pad_get_allowed_caps(object<GstPad>()), false);\n}\n\nCapsPtr Pad::negotiatedCaps() const\n{\n return CapsPtr::wrap(gst_pad_get_negotiated_caps(object<GstPad>()), false);\n}\n\nbool Pad::setCaps(const CapsPtr & caps)\n{\n return gst_pad_set_caps(object<GstPad>(), caps);\n}\n\nbool Pad::isActive() const\n{\n return gst_pad_is_active(object<GstPad>());\n}\n\nbool Pad::isBlocked() const\n{\n return gst_pad_is_blocked(object<GstPad>());\n}\n\nbool Pad::isBlocking() const\n{\n return gst_pad_is_blocking(object<GstPad>());\n}\n\nbool Pad::setBlocked(bool blocked)\n{\n return gst_pad_set_blocked(object<GstPad>(), blocked);\n}\n\n}\n<commit_msg>Add missing gst_object_ref_sink() in Pad::create().<commit_after>\/*\n Copyright (C) 2009 George Kiagiadakis <kiagiadakis.george@gmail.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 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 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 \"pad.h\"\n#include \"caps.h\"\n#include \"element.h\"\n#include <QtCore\/QDebug>\n#include <gst\/gstpad.h>\n#include <gst\/gstutils.h>\n\nnamespace QGst {\n\n\/\/static\nPadPtr Pad::create(PadDirection direction, const QGlib::String & name)\n{\n GstPad *pad = gst_pad_new(name, static_cast<GstPadDirection>(direction));\n gst_object_ref_sink(pad);\n return PadPtr::wrap(pad, false);\n}\n\nPadDirection Pad::direction() const\n{\n return static_cast<PadDirection>(gst_pad_get_direction(object<GstPad>()));\n}\n\nElementPtr Pad::parentElement() const\n{\n return ElementPtr::wrap(gst_pad_get_parent_element(object<GstPad>()), false);\n}\n\nPadPtr Pad::peer() const\n{\n return PadPtr::wrap(gst_pad_get_peer(object<GstPad>()), false);\n}\n\nbool Pad::isLinked() const\n{\n return gst_pad_is_linked(object<GstPad>());\n}\n\nbool Pad::canLink(const PadPtr & sink) const\n{\n return gst_pad_can_link(object<GstPad>(), sink);\n}\n\nPadLinkReturn Pad::link(const PadPtr & sink)\n{\n return static_cast<PadLinkReturn>(gst_pad_link(object<GstPad>(), sink));\n}\n\nbool Pad::unlink(const PadPtr & sink)\n{\n return gst_pad_unlink(object<GstPad>(), sink);\n}\n\nCapsPtr Pad::caps() const\n{\n return CapsPtr::wrap(gst_pad_get_caps_reffed(object<GstPad>()), false);\n}\n\nCapsPtr Pad::allowedCaps() const\n{\n return CapsPtr::wrap(gst_pad_get_allowed_caps(object<GstPad>()), false);\n}\n\nCapsPtr Pad::negotiatedCaps() const\n{\n return CapsPtr::wrap(gst_pad_get_negotiated_caps(object<GstPad>()), false);\n}\n\nbool Pad::setCaps(const CapsPtr & caps)\n{\n return gst_pad_set_caps(object<GstPad>(), caps);\n}\n\nbool Pad::isActive() const\n{\n return gst_pad_is_active(object<GstPad>());\n}\n\nbool Pad::isBlocked() const\n{\n return gst_pad_is_blocked(object<GstPad>());\n}\n\nbool Pad::isBlocking() const\n{\n return gst_pad_is_blocking(object<GstPad>());\n}\n\nbool Pad::setBlocked(bool blocked)\n{\n return gst_pad_set_blocked(object<GstPad>(), blocked);\n}\n\n}\n<|endoftext|>"} {"text":"<commit_before>#include \"Renderer.hpp\"\n\n#include <QOpenGLShader>\n#include <QMessageBox>\n#include <typeinfo>\n#include <QCoreApplication>\n#include <QPainter>\n#include <QThread>\n\n#include <QAudioDeviceInfo>\n\nstatic GLfloat vertices[] = {\n 1, 1,0, 1,-1,0, -1,1,0,\n 1,-1,0, -1,-1,0, -1,1,0\n};\nstatic GLfloat uvs[] = {\n 1,0, 1,1, 0,0,\n 1,1, 0,1, 0,0\n};\n\nconst char * Renderer::defaultVertexShader =\n \"#version 330 core\\n\"\n \"\\n\"\n \"in vec3 position;\\n\"\n \"in vec2 texCoord;\\n\"\n \"\\n\"\n \"uniform int _time;\\n\"\n \"\\n\"\n \"out vec2 uv;\\n\"\n \"out float time;\\n\"\n \"\\n\"\n \"void main(){\\n\"\n \" time = float(_time);\\n\"\n \" gl_Position = vec4(position, 1);\\n\"\n \" uv = texCoord;\\n\"\n \"}\";\n\nconst char * Renderer::defaultFragmentShader =\n \"#version 330 core\\n\"\n \"\\n\"\n \"out vec4 color;\\n\"\n \"\\n\"\n \"uniform in vec2 uv;\\n\"\n \"uniform in float time;\\n\"\n \"\\n\"\n \"void main(){\\n\"\n \" color = vec4(cos(uv.x * 5 - time \/ 1000) \/ 2 + .5, 0, sin(uv.x * 5 - time \/ 1000) \/ 2 + .5, 1);\\n\"\n \"}\";\n\nconst char * Renderer::mandelbrotFragmentShader =\n \"#version 330 core\\n\"\n \"\\n\"\n \"in vec2 uv;\\n\"\n \"in float time;\\n\"\n \"\\n\"\n \"vec2 center = vec2(0,0);\\n\"\n \"float scale = 4;\\n\"\n \"int iter = 10;\\n\"\n \"\\n\"\n \"void main() {\\n\"\n \" gl_FragColor = vec4(0,0,0,1);\\n\"\n \" vec2 z, c;\\n\"\n \" \\n\"\n \" c.x = 1.3333 * (uv.x - 0.5) * scale - center.x;\\n\"\n \" c.y = (uv.y - 0.5) * scale - center.y;\\n\"\n \" \\n\"\n \" int i;\\n\"\n \" z = c;\\n\"\n \" for(i=0; i < iter; ++i) {\\n\"\n \" float x = (z.x * z.x - z.y * z.y) + c.x;\\n\"\n \" float y = (z.y * z.x + z.x * z.y) + c.y;\\n\"\n \" \\n\"\n \" if((x * x + y * y) > 4.0)\\n\"\n \" break;\\n\"\n \" z.x = x;\\n\"\n \" z.y = y;\\n\"\n \" }\\n\"\n \" if(i < iter)\\n\"\n \" gl_FragColor.r = float(i)\/10.0;\\n\"\n \"}\\n\";\n\nconst char * Renderer::juliaFragmentShader =\n \"#version 330 core\\n\"\n \"\\n\"\n \"in vec2 uv;\\n\"\n \"in float time;\\n\"\n \"uniform in float[10] audioData;\\n\"\n \"\\n\"\n \"\/\/uniform highp vec2 c = vec2(.1,.1);\\n\"\n \"int iter = 100;\\n\"\n \"out vec4 color;\\n\"\n \"\\n\"\n \"void main() {\\n\"\n\/\/ \" float audioVal = audioData[int(uv.x * 1764)];\\n\"\n \" float y = 1 - uv.y * 2;\"\n \" if(y < max(0, audioVal) && y > min(0, audioVal)){\\n\"\n \" color = vec4(1.0);\\n\"\n \" return;\\n\"\n \" }\\n\"\n \" vec2 c = vec2(sin(time \/ 2000.0), cos(time \/ 1500.0));\\n\"\n \" color = vec4(0,audioData[int(uv.x * 1764)],0,1);\\n\"\n \" vec2 z;\\n\"\n \" \\n\"\n \" z.x = 3.0 * (uv.x - 0.5);\\n\"\n \" z.y = 2.0 * (uv.y - 0.5);\\n\"\n \" \\n\"\n \" int i;\\n\"\n \" for(i=0; i < iter; ++i) {\\n\"\n \" float x = (z.x * z.x - z.y * z.y) + c.x;\\n\"\n \" float y = (z.y * z.x + z.x * z.y) + c.y;\\n\"\n \" \\n\"\n \" if((x * x + y * y) > 4.0)\\n\"\n \" break;\\n\"\n \" z.x = x;\\n\"\n \" z.y = y;\\n\"\n \" }\\n\"\n \" if(i < iter){\\n\"\n \" color.b = float(i) * 5.0 \/ float(iter);\\n\"\n \" color.g = (float(i) * 5.0 \/ float(iter) - .3) \/ .7;\\n\"\n \" color.r = (float(i) * 5.0 \/ float(iter) - .7) \/ .3;\\n\"\n \" }\\n\"\n \"}\\n\";\n\nRenderer::Renderer(QWindow *parent) : Renderer::Renderer(\"new\", defaultFragmentShader, parent){ }\n\nRenderer::Renderer(const QString &filename, const QString &instructions, QWindow *parent) :\n QWindow(parent),\n clearColor(Qt::black),\n context(0), device(0),\n time(0),\n pendingUpdate(false),\n vertexBuffer(0), uvBuffer(0), audioLeftTexture(0), audioRightTexture(0),\n vertexAttr(0), uvAttr(0), timeUniform(0),\n shaderProgram(0),\n fragmentSource(instructions)\n{\n\n setTitle(filename);\n\n m_logger = new QOpenGLDebugLogger( this );\n\n connect(m_logger, SIGNAL(messageLogged(QOpenGLDebugMessage)),\n this, SLOT(onMessageLogged(QOpenGLDebugMessage)),\n Qt::DirectConnection );\n\n if ( m_logger->initialize() ) {\n m_logger->startLogging( QOpenGLDebugLogger::SynchronousLogging );\n m_logger->enableMessages();\n }\n\n time = new QTime();\n time->start();\n\n setSurfaceType(QWindow::OpenGLSurface);\n\n audio = new AudioInputProcessor(this);\n connect(audio, SIGNAL(processData(QByteArray)), this, SLOT(updateAudioData(QByteArray)));\n audio->start();\n\n QSurfaceFormat format;\n format.setMajorVersion(3);\n format.setMinorVersion(3);\n format.setSamples(4);\n format.setProfile(QSurfaceFormat::CoreProfile);\n setFormat(format);\n\n resize(800, 600);\n show();\n}\n\nRenderer::~Renderer(){\n glDeleteBuffers(1, &vertexBuffer);\n glDeleteBuffers(1, &uvBuffer);\n glDeleteTextures(1, &audioLeftTexture);\n glDeleteTextures(1, &audioRightTexture);\n}\n\nbool Renderer::init(){\n glDeleteBuffers(1, &vertexBuffer);\n glGenBuffers(1, &vertexBuffer);\n glBindBuffer(GL_ARRAY_BUFFER, vertexBuffer);\n glBufferData(GL_ARRAY_BUFFER, sizeof(vertices), vertices, GL_STATIC_DRAW);\n\n glDeleteBuffers(1, &uvBuffer);\n glGenBuffers(1, &uvBuffer);\n glBindBuffer(GL_ARRAY_BUFFER, uvBuffer);\n glBufferData(GL_ARRAY_BUFFER, sizeof(uvs), uvs, GL_STATIC_DRAW);\n\n glEnable(GL_TEXTURE_1D);\n\n glDeleteTextures(1, &audioLeftTexture);\n glGenTextures(1, &audioLeftTexture);\n glDeleteTextures(1, &audioRightTexture);\n glGenTextures(1, &audioRightTexture);\n\n glClearColor(0,0,.3,1);\n return initShaders(fragmentSource);\n}\n\nbool Renderer::initShaders(const QString &fragmentShader){\n QOpenGLShaderProgram *newShaderProgram = new QOpenGLShaderProgram(this);\n if(!newShaderProgram->addShaderFromSourceCode(QOpenGLShader::Vertex, defaultVertexShader)){\n int infologLength;\n glGetShaderiv(newShaderProgram->programId(), GL_INFO_LOG_LENGTH, &infologLength);\n char *infoLog = new char[infologLength + 1];\n glGetShaderInfoLog(newShaderProgram->programId(), infologLength + 1, &infologLength, infoLog);\n\n qDebug() << infoLog;\n\n delete[] infoLog;\n\n\n\/\/ qDebug() << newShaderProgram->log();\n delete newShaderProgram;\n return false;\n }\n if(!newShaderProgram->addShaderFromSourceCode(QOpenGLShader::Fragment,fragmentShader)){\n qDebug() << newShaderProgram->log();\n delete newShaderProgram;\n return false;\n }\n if(!newShaderProgram->link()){\n qDebug() << newShaderProgram->log();\n delete newShaderProgram;\n return false;\n }\n shaderProgramMutex.lock();\n if(shaderProgram)\n delete shaderProgram;\n shaderProgram = newShaderProgram;\n vertexAttr = shaderProgram->attributeLocation(\"position\");\n uvAttr = shaderProgram->attributeLocation(\"texCoord\");\n timeUniform = shaderProgram->uniformLocation(\"_time\");\n audioLeftUniform = shaderProgram->uniformLocation(\"audioDataLeft\");\n audioRightUniform = shaderProgram->uniformLocation(\"audioDataRight\");\n shaderProgram->setUniformValue(audioLeftUniform, 0);\n shaderProgram->setUniformValue(audioRightUniform, 0);\n fragmentSource = fragmentShader;\n shaderProgramMutex.unlock();\n\n\/\/ qDebug() << \"vertexAttr\" << vertexAttr;\n\/\/ qDebug() << \"uvAttr\" << uvAttr;\n\/\/ qDebug() << \"timeUniform\" << timeUniform;\n\/\/ qDebug() << \"audioUniform\" << audioUniform;\n return true;\n}\n\nvoid Renderer::render(){\n if(!device)\n device = new QOpenGLPaintDevice();\n\n glClear(GL_COLOR_BUFFER_BIT | GL_DEPTH_BUFFER_BIT | GL_STENCIL_BUFFER_BIT);\n\n device->setSize(size());\n QPainter painter;\n \/\/QPainter painter(device);\n render(&painter);\n}\n\nvoid Renderer::render(QPainter *){\n const qreal retinaScale = devicePixelRatio();\n glViewport(0, 0, width() * retinaScale, height() * retinaScale);\n\n glClear(GL_COLOR_BUFFER_BIT);\n\n shaderProgramMutex.lock();\n shaderProgram->bind();\n\n shaderProgram->setUniformValue(timeUniform, time->elapsed());\n\n glEnableVertexAttribArray(vertexAttr);\n glBindBuffer(GL_ARRAY_BUFFER, vertexBuffer);\n glVertexAttribPointer(vertexAttr, 3, GL_FLOAT, GL_FALSE, 0, 0);\n\n glEnableVertexAttribArray(uvAttr);\n glBindBuffer(GL_ARRAY_BUFFER, uvBuffer);\n glVertexAttribPointer(uvAttr, 2, GL_FLOAT, GL_FALSE, 0, 0);\n\n glBindBuffer(GL_ARRAY_BUFFER, vertexBuffer);\n glDrawArrays(GL_TRIANGLES, 0, sizeof(vertices));\n\n glDisableVertexAttribArray(vertexAttr);\n glDisableVertexAttribArray(uvAttr);\n\n shaderProgram->release();\n shaderProgramMutex.unlock();\n}\n\nvoid Renderer::renderLater(){\n if(!pendingUpdate){\n QCoreApplication::postEvent(this, new QEvent(QEvent::UpdateRequest));\n pendingUpdate = true;\n }\n}\n\nvoid Renderer::renderNow(){\n pendingUpdate = false;\n\n if(!isExposed())\n return;\n\n bool needsInit = false;\n\n if(!context){\n context = new QOpenGLContext(this);\n context->setFormat(requestedFormat());\n context->create();\n\n needsInit = true;\n }\n\n context->makeCurrent(this);\n\n if(needsInit){\n initializeOpenGLFunctions();\n init();\n }\n if(!shaderProgram)\n initShaders(fragmentSource);\n\n if(shaderProgram)\n render();\n context->swapBuffers(this);\n\n renderLater();\n}\n\nbool Renderer::event(QEvent *event){\n switch(event->type()){\n case QEvent::UpdateRequest:\n QCoreApplication::postEvent(this, new QEvent(QEvent::UpdateRequest));\n renderNow();\n return true;\n case QEvent::Close:\n emit doneSignal(QtGlException());\n \/\/ No fall throu?\n return true;\n default:\n return QWindow::event(event);\n }\n}\n\nvoid Renderer::exposeEvent(QExposeEvent *){\n if(isExposed())\n renderNow();\n}\n\nbool Renderer::updateCode(const QString &filename, const QString &code){\n if(!initShaders(code))\n return false;\n setTitle(filename);\n return true;\n}\n\nvoid Renderer::updateAudioData(QByteArray data){\n if(!shaderProgram)\n return;\n GLenum type, internalType;\n char typeSize;\n switch(audio->format().sampleType() + audio->format().sampleSize()){\n case 8: case 10: type = GL_UNSIGNED_BYTE; internalType = GL_R8UI; typeSize = 1; break;\n case 9: type = GL_BYTE; internalType = GL_R8I; typeSize = 1; break;\n case 16: case 18: type = GL_UNSIGNED_SHORT; internalType = GL_R16UI; typeSize = 2; break;\n case 17: type = GL_SHORT; internalType = GL_R16I; typeSize = 2; break;\n case 32: case 34: type = GL_UNSIGNED_INT; internalType = GL_R32UI; typeSize = 4; break;\n case 33: type = GL_INT; internalType = GL_R32I; typeSize = 4; break;\n case 35: type = GL_FLOAT; internalType = GL_R32F; typeSize = 4; break;\n default: return;\n }\n char *left, *right;\n int count = data.size();\n if(audio->format().channelCount() == 2){\n count \/= 2;\n left = new char[count];\n right = new char[count];\n for(int i = 0; i < count; i += typeSize){\n for(int j = 0; j < typeSize; ++j){\n left [i+j] = data[i*2+j ];\n right[i+j] = data[i*2+j+typeSize];\n }\n }\n }else\n left = right = data.data();\n\n\n shaderProgramMutex.lock();\n shaderProgram->bind();\n\n glBindTexture(GL_TEXTURE_1D, audioLeftTexture);\n glTexParameteri(GL_TEXTURE_1D, GL_TEXTURE_MAG_FILTER, GL_LINEAR);\n glTexParameteri(GL_TEXTURE_1D, GL_TEXTURE_MIN_FILTER, GL_LINEAR);\n glTexImage1D(GL_TEXTURE_1D, 0, GL_R32F, count \/ typeSize, 0, GL_RED, type, left);\n\n glBindTexture(GL_TEXTURE_1D, audioRightTexture);\n glTexParameteri(GL_TEXTURE_1D, GL_TEXTURE_MAG_FILTER, GL_LINEAR);\n glTexParameteri(GL_TEXTURE_1D, GL_TEXTURE_MIN_FILTER, GL_LINEAR);\n glTexImage1D(GL_TEXTURE_1D, 0, GL_R32F, count \/ typeSize, 0, GL_RED, type, right);\n\n shaderProgram->release();\n shaderProgramMutex.unlock();\n if(left != data.data())\n delete[] left;\n if(right != data.data())\n delete[] right;\n}\n\n\nvoid Renderer::onMessageLogged(QOpenGLDebugMessage message){\n qDebug() << message;\n}\n<commit_msg>Slightly modified logger<commit_after>#include \"Renderer.hpp\"\n\n#include <QOpenGLShader>\n#include <QMessageBox>\n#include <typeinfo>\n#include <QCoreApplication>\n#include <QPainter>\n#include <QThread>\n\n#include <QAudioDeviceInfo>\n\nstatic GLfloat vertices[] = {\n 1, 1,0, 1,-1,0, -1,1,0,\n 1,-1,0, -1,-1,0, -1,1,0\n};\nstatic GLfloat uvs[] = {\n 1,0, 1,1, 0,0,\n 1,1, 0,1, 0,0\n};\n\nconst char * Renderer::defaultVertexShader =\n \"#version 330 core\\n\"\n \"\\n\"\n \"in vec3 position;\\n\"\n \"in vec2 texCoord;\\n\"\n \"\\n\"\n \"uniform int _time;\\n\"\n \"\\n\"\n \"out vec2 uv;\\n\"\n \"out float time;\\n\"\n \"\\n\"\n \"void main(){\\n\"\n \" time = float(_time);\\n\"\n \" gl_Position = vec4(position, 1);\\n\"\n \" uv = texCoord;\\n\"\n \"}\";\n\nconst char * Renderer::defaultFragmentShader =\n \"#version 330 core\\n\"\n \"\\n\"\n \"out vec4 color;\\n\"\n \"\\n\"\n \"uniform in vec2 uv;\\n\"\n \"uniform in float time;\\n\"\n \"\\n\"\n \"void main(){\\n\"\n \" color = vec4(cos(uv.x * 5 - time \/ 1000) \/ 2 + .5, 0, sin(uv.x * 5 - time \/ 1000) \/ 2 + .5, 1);\\n\"\n \"}\";\n\nconst char * Renderer::mandelbrotFragmentShader =\n \"#version 330 core\\n\"\n \"\\n\"\n \"in vec2 uv;\\n\"\n \"in float time;\\n\"\n \"\\n\"\n \"vec2 center = vec2(0,0);\\n\"\n \"float scale = 4;\\n\"\n \"int iter = 10;\\n\"\n \"\\n\"\n \"void main() {\\n\"\n \" gl_FragColor = vec4(0,0,0,1);\\n\"\n \" vec2 z, c;\\n\"\n \" \\n\"\n \" c.x = 1.3333 * (uv.x - 0.5) * scale - center.x;\\n\"\n \" c.y = (uv.y - 0.5) * scale - center.y;\\n\"\n \" \\n\"\n \" int i;\\n\"\n \" z = c;\\n\"\n \" for(i=0; i < iter; ++i) {\\n\"\n \" float x = (z.x * z.x - z.y * z.y) + c.x;\\n\"\n \" float y = (z.y * z.x + z.x * z.y) + c.y;\\n\"\n \" \\n\"\n \" if((x * x + y * y) > 4.0)\\n\"\n \" break;\\n\"\n \" z.x = x;\\n\"\n \" z.y = y;\\n\"\n \" }\\n\"\n \" if(i < iter)\\n\"\n \" gl_FragColor.r = float(i)\/10.0;\\n\"\n \"}\\n\";\n\nconst char * Renderer::juliaFragmentShader =\n \"#version 330 core\\n\"\n \"\\n\"\n \"in vec2 uv;\\n\"\n \"in float time;\\n\"\n \"uniform in float[10] audioData;\\n\"\n \"\\n\"\n \"\/\/uniform highp vec2 c = vec2(.1,.1);\\n\"\n \"int iter = 100;\\n\"\n \"out vec4 color;\\n\"\n \"\\n\"\n \"void main() {\\n\"\n\/\/ \" float audioVal = audioData[int(uv.x * 1764)];\\n\"\n \" float y = 1 - uv.y * 2;\"\n \" if(y < max(0, audioVal) && y > min(0, audioVal)){\\n\"\n \" color = vec4(1.0);\\n\"\n \" return;\\n\"\n \" }\\n\"\n \" vec2 c = vec2(sin(time \/ 2000.0), cos(time \/ 1500.0));\\n\"\n \" color = vec4(0,audioData[int(uv.x * 1764)],0,1);\\n\"\n \" vec2 z;\\n\"\n \" \\n\"\n \" z.x = 3.0 * (uv.x - 0.5);\\n\"\n \" z.y = 2.0 * (uv.y - 0.5);\\n\"\n \" \\n\"\n \" int i;\\n\"\n \" for(i=0; i < iter; ++i) {\\n\"\n \" float x = (z.x * z.x - z.y * z.y) + c.x;\\n\"\n \" float y = (z.y * z.x + z.x * z.y) + c.y;\\n\"\n \" \\n\"\n \" if((x * x + y * y) > 4.0)\\n\"\n \" break;\\n\"\n \" z.x = x;\\n\"\n \" z.y = y;\\n\"\n \" }\\n\"\n \" if(i < iter){\\n\"\n \" color.b = float(i) * 5.0 \/ float(iter);\\n\"\n \" color.g = (float(i) * 5.0 \/ float(iter) - .3) \/ .7;\\n\"\n \" color.r = (float(i) * 5.0 \/ float(iter) - .7) \/ .3;\\n\"\n \" }\\n\"\n \"}\\n\";\n\nRenderer::Renderer(QWindow *parent) : Renderer::Renderer(\"new\", defaultFragmentShader, parent){ }\n\nRenderer::Renderer(const QString &filename, const QString &instructions, QWindow *parent) :\n QWindow(parent),\n clearColor(Qt::black),\n context(0), device(0),\n time(0),\n pendingUpdate(false),\n vertexBuffer(0), uvBuffer(0), audioLeftTexture(0), audioRightTexture(0),\n vertexAttr(0), uvAttr(0), timeUniform(0),\n shaderProgram(0),\n fragmentSource(instructions)\n{\n\n setTitle(filename);\n\n m_logger = new QOpenGLDebugLogger( this );\n\n connect(m_logger, SIGNAL(messageLogged(QOpenGLDebugMessage)),\n this, SLOT(onMessageLogged(QOpenGLDebugMessage)),\n Qt::DirectConnection );\n\n time = new QTime();\n time->start();\n\n setSurfaceType(QWindow::OpenGLSurface);\n\n audio = new AudioInputProcessor(this);\n connect(audio, SIGNAL(processData(QByteArray)), this, SLOT(updateAudioData(QByteArray)));\n audio->start();\n\n QSurfaceFormat format;\n format.setMajorVersion(3);\n format.setMinorVersion(3);\n format.setSamples(4);\n format.setProfile(QSurfaceFormat::CoreProfile);\n setFormat(format);\n\n resize(800, 600);\n show();\n}\n\nRenderer::~Renderer(){\n glDeleteBuffers(1, &vertexBuffer);\n glDeleteBuffers(1, &uvBuffer);\n glDeleteTextures(1, &audioLeftTexture);\n glDeleteTextures(1, &audioRightTexture);\n}\n\nbool Renderer::init(){\n glDeleteBuffers(1, &vertexBuffer);\n glGenBuffers(1, &vertexBuffer);\n glBindBuffer(GL_ARRAY_BUFFER, vertexBuffer);\n glBufferData(GL_ARRAY_BUFFER, sizeof(vertices), vertices, GL_STATIC_DRAW);\n\n glDeleteBuffers(1, &uvBuffer);\n glGenBuffers(1, &uvBuffer);\n glBindBuffer(GL_ARRAY_BUFFER, uvBuffer);\n glBufferData(GL_ARRAY_BUFFER, sizeof(uvs), uvs, GL_STATIC_DRAW);\n\n glEnable(GL_TEXTURE_1D);\n\n glDeleteTextures(1, &audioLeftTexture);\n glGenTextures(1, &audioLeftTexture);\n glDeleteTextures(1, &audioRightTexture);\n glGenTextures(1, &audioRightTexture);\n\n glClearColor(0,0,.3,1);\n return initShaders(fragmentSource);\n}\n\nbool Renderer::initShaders(const QString &fragmentShader){\n QOpenGLShaderProgram *newShaderProgram = new QOpenGLShaderProgram(this);\n if(!newShaderProgram->addShaderFromSourceCode(QOpenGLShader::Vertex, defaultVertexShader)){\n int infologLength;\n glGetShaderiv(newShaderProgram->programId(), GL_INFO_LOG_LENGTH, &infologLength);\n char *infoLog = new char[infologLength + 1];\n glGetShaderInfoLog(newShaderProgram->programId(), infologLength + 1, &infologLength, infoLog);\n\n qDebug() << infoLog;\n\n delete[] infoLog;\n\n\n\/\/ qDebug() << newShaderProgram->log();\n delete newShaderProgram;\n return false;\n }\n if(!newShaderProgram->addShaderFromSourceCode(QOpenGLShader::Fragment,fragmentShader)){\n qDebug() << newShaderProgram->log();\n delete newShaderProgram;\n return false;\n }\n if(!newShaderProgram->link()){\n qDebug() << newShaderProgram->log();\n delete newShaderProgram;\n return false;\n }\n shaderProgramMutex.lock();\n if(shaderProgram)\n delete shaderProgram;\n shaderProgram = newShaderProgram;\n vertexAttr = shaderProgram->attributeLocation(\"position\");\n uvAttr = shaderProgram->attributeLocation(\"texCoord\");\n timeUniform = shaderProgram->uniformLocation(\"_time\");\n audioLeftUniform = shaderProgram->uniformLocation(\"audioDataLeft\");\n audioRightUniform = shaderProgram->uniformLocation(\"audioDataRight\");\n shaderProgram->setUniformValue(audioLeftUniform, 0);\n shaderProgram->setUniformValue(audioRightUniform, 0);\n fragmentSource = fragmentShader;\n shaderProgramMutex.unlock();\n\n\/\/ qDebug() << \"vertexAttr\" << vertexAttr;\n\/\/ qDebug() << \"uvAttr\" << uvAttr;\n\/\/ qDebug() << \"timeUniform\" << timeUniform;\n\/\/ qDebug() << \"audioUniform\" << audioUniform;\n return true;\n}\n\nvoid Renderer::render(){\n if(!device)\n device = new QOpenGLPaintDevice();\n\n glClear(GL_COLOR_BUFFER_BIT | GL_DEPTH_BUFFER_BIT | GL_STENCIL_BUFFER_BIT);\n\n device->setSize(size());\n QPainter painter;\n \/\/QPainter painter(device);\n render(&painter);\n}\n\nvoid Renderer::render(QPainter *){\n const qreal retinaScale = devicePixelRatio();\n glViewport(0, 0, width() * retinaScale, height() * retinaScale);\n\n glClear(GL_COLOR_BUFFER_BIT);\n\n shaderProgramMutex.lock();\n shaderProgram->bind();\n\n shaderProgram->setUniformValue(timeUniform, time->elapsed());\n\n glEnableVertexAttribArray(vertexAttr);\n glBindBuffer(GL_ARRAY_BUFFER, vertexBuffer);\n glVertexAttribPointer(vertexAttr, 3, GL_FLOAT, GL_FALSE, 0, 0);\n\n glEnableVertexAttribArray(uvAttr);\n glBindBuffer(GL_ARRAY_BUFFER, uvBuffer);\n glVertexAttribPointer(uvAttr, 2, GL_FLOAT, GL_FALSE, 0, 0);\n\n glBindBuffer(GL_ARRAY_BUFFER, vertexBuffer);\n glDrawArrays(GL_TRIANGLES, 0, sizeof(vertices));\n\n glDisableVertexAttribArray(vertexAttr);\n glDisableVertexAttribArray(uvAttr);\n\n shaderProgram->release();\n shaderProgramMutex.unlock();\n}\n\nvoid Renderer::renderLater(){\n if(!pendingUpdate){\n QCoreApplication::postEvent(this, new QEvent(QEvent::UpdateRequest));\n pendingUpdate = true;\n }\n}\n\nvoid Renderer::renderNow(){\n pendingUpdate = false;\n\n if(!isExposed())\n return;\n\n bool needsInit = false;\n\n if(!context){\n context = new QOpenGLContext(this);\n context->setFormat(requestedFormat());\n context->create();\n\n needsInit = true;\n }\n\n context->makeCurrent(this);\n\n if(needsInit){\n initializeOpenGLFunctions();\n init();\n }\n\n if ( m_logger->initialize() ) {\n m_logger->startLogging( QOpenGLDebugLogger::SynchronousLogging );\n m_logger->enableMessages();\n }\n\n if(!shaderProgram)\n initShaders(fragmentSource);\n\n if(shaderProgram)\n render();\n context->swapBuffers(this);\n\n renderLater();\n}\n\nbool Renderer::event(QEvent *event){\n switch(event->type()){\n case QEvent::UpdateRequest:\n QCoreApplication::postEvent(this, new QEvent(QEvent::UpdateRequest));\n renderNow();\n return true;\n case QEvent::Close:\n emit doneSignal(QtGlException());\n \/\/ No fall throu?\n return true;\n default:\n return QWindow::event(event);\n }\n}\n\nvoid Renderer::exposeEvent(QExposeEvent *){\n if(isExposed())\n renderNow();\n}\n\nbool Renderer::updateCode(const QString &filename, const QString &code){\n if(!initShaders(code))\n return false;\n setTitle(filename);\n return true;\n}\n\nvoid Renderer::updateAudioData(QByteArray data){\n if(!shaderProgram)\n return;\n GLenum type, internalType;\n char typeSize;\n switch(audio->format().sampleType() + audio->format().sampleSize()){\n case 8: case 10: type = GL_UNSIGNED_BYTE; internalType = GL_R8UI; typeSize = 1; break;\n case 9: type = GL_BYTE; internalType = GL_R8I; typeSize = 1; break;\n case 16: case 18: type = GL_UNSIGNED_SHORT; internalType = GL_R16UI; typeSize = 2; break;\n case 17: type = GL_SHORT; internalType = GL_R16I; typeSize = 2; break;\n case 32: case 34: type = GL_UNSIGNED_INT; internalType = GL_R32UI; typeSize = 4; break;\n case 33: type = GL_INT; internalType = GL_R32I; typeSize = 4; break;\n case 35: type = GL_FLOAT; internalType = GL_R32F; typeSize = 4; break;\n default: return;\n }\n char *left, *right;\n int count = data.size();\n if(audio->format().channelCount() == 2){\n count \/= 2;\n left = new char[count];\n right = new char[count];\n for(int i = 0; i < count; i += typeSize){\n for(int j = 0; j < typeSize; ++j){\n left [i+j] = data[i*2+j ];\n right[i+j] = data[i*2+j+typeSize];\n }\n }\n }else\n left = right = data.data();\n\n\n shaderProgramMutex.lock();\n shaderProgram->bind();\n\n glBindTexture(GL_TEXTURE_1D, audioLeftTexture);\n glTexParameteri(GL_TEXTURE_1D, GL_TEXTURE_MAG_FILTER, GL_LINEAR);\n glTexParameteri(GL_TEXTURE_1D, GL_TEXTURE_MIN_FILTER, GL_LINEAR);\n glTexImage1D(GL_TEXTURE_1D, 0, GL_R32F, count \/ typeSize, 0, GL_RED, type, left);\n\n glBindTexture(GL_TEXTURE_1D, audioRightTexture);\n glTexParameteri(GL_TEXTURE_1D, GL_TEXTURE_MAG_FILTER, GL_LINEAR);\n glTexParameteri(GL_TEXTURE_1D, GL_TEXTURE_MIN_FILTER, GL_LINEAR);\n glTexImage1D(GL_TEXTURE_1D, 0, GL_R32F, count \/ typeSize, 0, GL_RED, type, right);\n\n shaderProgram->release();\n shaderProgramMutex.unlock();\n if(left != data.data())\n delete[] left;\n if(right != data.data())\n delete[] right;\n}\n\n\nvoid Renderer::onMessageLogged(QOpenGLDebugMessage message){\n qDebug() << message;\n}\n<|endoftext|>"} {"text":"<commit_before>#ifndef BLENDMODE_HPP_INCLUDED\n#define BLENDMODE_HPP_INCLUDED\n\nnamespace gst\n{\n \/\/ Supported blending techniques.\n enum class BlendMode {\n NONE, \/\/ Blending disabled.\n ADDITIVE, \/\/ Additive blending: out = src_frag + dst_frag.\n MULTIPLICATIVE, \/\/ Multiplicative blending: out = src_frag * dst_frag.\n INTERPOLATIVE \/\/ Interpolative blending: out = (src_alpha * src_frag) + ((1 - src_alpha) * dst_frag).\n };\n}\n\n#endif\n<commit_msg>fix redundant blend mode description<commit_after>#ifndef BLENDMODE_HPP_INCLUDED\n#define BLENDMODE_HPP_INCLUDED\n\nnamespace gst\n{\n \/\/ Supported blending techniques.\n enum class BlendMode {\n NONE, \/\/ Blending disabled.\n ADDITIVE, \/\/ out = src_frag + dst_frag.\n MULTIPLICATIVE, \/\/ out = src_frag * dst_frag.\n INTERPOLATIVE \/\/ out = (src_alpha * src_frag) + ((1 - src_alpha) * dst_frag).\n };\n}\n\n#endif\n<|endoftext|>"} {"text":"<commit_before>\/**\n * blufs - a c++ luafilesystem library\n * --------------------------------------------------------\n * Copyright 2013-2015 Dmitry Ledentsov\n * [MIT License](http:\/\/opensource.org\/licenses\/MIT)\n *\n *\/\n\n#include \"blufs_lib.h\"\n\n#include <boost\/filesystem.hpp>\n#include <boost\/interprocess\/sync\/file_lock.hpp>\n#include <boost\/shared_ptr.hpp>\n\n#include <lua.hpp>\n\n#include <luabind\/luabind.hpp>\n#include <luabind\/tag_function.hpp>\n#include <luabind\/operator.hpp>\n#include <luabind\/copy_policy.hpp>\n#include <luabind\/iterator_policy.hpp>\n#include <boost\/container\/vector.hpp>\n#include <string>\n#include <stdexcept>\n#include <iostream>\n\nnamespace blufs = boost::filesystem;\n\nstd::ostream& operator<<(std::ostream& s, blufs::path const& p) {\n return s << p.generic_string();\n}\n\nblufs::path const& itself(blufs::path const& self) { return self; }\nblufs::path absolute_d(blufs::path const& self) { return blufs::absolute(self); }\nblufs::path canonical_d(blufs::path const& self) { return blufs::canonical(self); }\nvoid current_path_s(std::string const& p) { blufs::current_path(p); }\n\nvoid register_blufs (lua_State* L) {\n using namespace luabind;\n using namespace blufs;\n\n open(L);\n\n module(L, \"blufs\")\n [\n class_<path, boost::shared_ptr<path>>(\"path\")\n .def(constructor<std::string const&>())\n .def(constructor<>())\n .def(constructor<path const&>())\n .def(tostring(self))\n \/\/.def(const_self + path())\n .def(const_self \/ path())\n \/\/.def(const_self + std::string())\n .def(const_self \/ std::string())\n .property(\"generic_string\", (std::string(path::*)()const) &path::generic_string)\n .property(\"root_path\", &path::root_path)\n .property(\"root_name\", &path::root_name)\n .property(\"root_directory\", &path::root_directory)\n .property(\"relative_path\", &path::relative_path)\n .property(\"parent_path\", &path::parent_path)\n .property(\"filename\", &path::filename)\n .property(\"stem\", &path::stem)\n .property(\"extension\", &path::extension)\n .property(\"empty\", &path::empty)\n .property(\"exists\", (bool(*)(path const&))exists)\n .property(\"absolute\",absolute_d)\n .property(\"canonical\", canonical_d)\n .def(\"parts\", itself, copy(result) + return_stl_iterator)\n .def(\"absolute_to\", (path(*)(path const&, path const&))absolute)\n .def(\"canonical_to\", (path(*)(path const&, path const&))canonical)\n .def(\"clear\", &path::clear)\n .def(\"make_preferred\", &path::make_preferred)\n .def(\"remove_filename\", &path::remove_filename)\n .def(\"replace_extension\", &path::replace_extension)\n .def(\"compare\", (int(path::*)(std::string const&)const) &path::compare)\n .def(\"compare\", (int(path::*)(path const&)const) &path::compare)\n\n .enum_(\"file_type\")\n [\n value(\"status_error\", blufs::status_error),\n value(\"file_not_found\", blufs::file_not_found),\n value(\"regular_file\", blufs::regular_file),\n value(\"directory_file\", blufs::directory_file),\n value(\"symlink_file\", blufs::symlink_file),\n value(\"block_file\", blufs::block_file),\n value(\"character_file\", blufs::character_file),\n value(\"fifo_file\", blufs::fifo_file),\n value(\"socket_file\", blufs::socket_file),\n value(\"type_unknown\", blufs::type_unknown)\n ]\n\n .enum_(\"perms\")\n [\n value(\"no_perms\", blufs::no_perms),\n value(\"owner_read\", blufs::owner_read),\n value(\"owner_write\", blufs::owner_write),\n value(\"owner_exe\", blufs::owner_exe),\n value(\"owner_all\", blufs::owner_all),\n value(\"group_read\", blufs::group_read),\n value(\"group_write\", blufs::group_write),\n value(\"group_exe\", blufs::group_exe),\n value(\"group_all\", blufs::group_all),\n value(\"others_read\", blufs::others_read),\n value(\"others_write\", blufs::others_write),\n value(\"others_exe\", blufs::others_exe),\n value(\"others_all\", blufs::others_all),\n value(\"all_all\", blufs::all_all),\n value(\"set_uid_on_exe\", blufs::set_uid_on_exe),\n value(\"set_gid_on_exe\", blufs::set_gid_on_exe),\n value(\"sticky_bit\", blufs::sticky_bit),\n value(\"perms_mask\", blufs::perms_mask),\n value(\"perms_not_known\", blufs::perms_not_known),\n value(\"add_perms\", blufs::add_perms),\n value(\"remove_perms\", blufs::remove_perms),\n value(\"symlink_perms\", blufs::symlink_perms)\n ]\n ,\n\n class_<blufs::space_info>(\"space_info\")\n .def_readwrite(\"capacity\", &blufs::space_info::capacity)\n .def_readwrite(\"free\", &blufs::space_info::free)\n .def_readwrite(\"available\", &blufs::space_info::available)\n ,\n\n class_<blufs::copy_option>(\"copy_option\")\n .enum_(\"values\")\n [\n value(\"none\", static_cast<int>(blufs::copy_option::none)),\n value(\"fail_if_exists\", static_cast<int>(blufs::copy_option::fail_if_exists)),\n value(\"overwrite_if_exists\", static_cast<int>(blufs::copy_option::overwrite_if_exists))\n ]\n ,\n\n class_<blufs::symlink_option>(\"symlink_option\")\n .enum_(\"values\")\n [\n value(\"none\", static_cast<int>(blufs::symlink_option::none)),\n value(\"no_recurse\", static_cast<int>(blufs::symlink_option::no_recurse)),\n value(\"recurse\", static_cast<int>(blufs::symlink_option::recurse))\n ]\n ,\n\n def(\"current_path\", (blufs::path(*)()) blufs::current_path),\n def(\"current_path\", (void(*)(blufs::path const&)) blufs::current_path),\n def(\"current_path\", current_path_s ),\n def(\"create_directories\", (bool(*)(blufs::path const&)) blufs::create_directories),\n \/\/ def(\"create_directories\", fs::create_directories_s),\n def(\"create_directory\", (bool(*)(blufs::path const&)) blufs::create_directory),\n \/\/ def(\"create_directory\", fs::create_directory_s),\n def(\"copy\", (void(*)(blufs::path const&,blufs::path const&)) blufs::copy)\n \/\/ def(\"copy\", fs::copy_s),\n ];\n}\n<commit_msg>equality operator<commit_after>\/**\n * blufs - a c++ luafilesystem library\n * --------------------------------------------------------\n * Copyright 2013-2015 Dmitry Ledentsov\n * [MIT License](http:\/\/opensource.org\/licenses\/MIT)\n *\n *\/\n\n#include \"blufs_lib.h\"\n\n#include <boost\/filesystem.hpp>\n#include <boost\/interprocess\/sync\/file_lock.hpp>\n#include <boost\/shared_ptr.hpp>\n\n#include <lua.hpp>\n\n#include <luabind\/luabind.hpp>\n#include <luabind\/tag_function.hpp>\n#include <luabind\/operator.hpp>\n#include <luabind\/copy_policy.hpp>\n#include <luabind\/iterator_policy.hpp>\n#include <boost\/container\/vector.hpp>\n#include <string>\n#include <stdexcept>\n#include <iostream>\n\nnamespace blufs = boost::filesystem;\n\nstd::ostream& operator<<(std::ostream& s, blufs::path const& p) {\n return s << p.generic_string();\n}\n\nblufs::path const& itself(blufs::path const& self) { return self; }\nblufs::path absolute_d(blufs::path const& self) { return blufs::absolute(self); }\nblufs::path canonical_d(blufs::path const& self) { return blufs::canonical(self); }\nvoid current_path_s(std::string const& p) { blufs::current_path(p); }\n\nvoid register_blufs (lua_State* L) {\n using namespace luabind;\n using namespace blufs;\n\n open(L);\n\n module(L, \"blufs\")\n [\n class_<path, boost::shared_ptr<path>>(\"path\")\n .def(constructor<std::string const&>())\n .def(constructor<>())\n .def(constructor<path const&>())\n .def(tostring(self))\n \/\/.def(const_self + path())\n .def(const_self \/ path())\n \/\/.def(const_self + std::string())\n .def(const_self \/ std::string())\n .def(const_self == std::string())\n .property(\"generic_string\", (std::string(path::*)()const) &path::generic_string)\n .property(\"root_path\", &path::root_path)\n .property(\"root_name\", &path::root_name)\n .property(\"root_directory\", &path::root_directory)\n .property(\"relative_path\", &path::relative_path)\n .property(\"parent_path\", &path::parent_path)\n .property(\"filename\", &path::filename)\n .property(\"stem\", &path::stem)\n .property(\"extension\", &path::extension)\n .property(\"empty\", &path::empty)\n .property(\"exists\", (bool(*)(path const&))exists)\n .property(\"absolute\",absolute_d)\n .property(\"canonical\", canonical_d)\n .def(\"parts\", itself, copy(result) + return_stl_iterator)\n .def(\"absolute_to\", (path(*)(path const&, path const&))absolute)\n .def(\"canonical_to\", (path(*)(path const&, path const&))canonical)\n .def(\"clear\", &path::clear)\n .def(\"make_preferred\", &path::make_preferred)\n .def(\"remove_filename\", &path::remove_filename)\n .def(\"replace_extension\", &path::replace_extension)\n .def(\"compare\", (int(path::*)(std::string const&)const) &path::compare)\n .def(\"compare\", (int(path::*)(path const&)const) &path::compare)\n\n .enum_(\"file_type\")\n [\n value(\"status_error\", blufs::status_error),\n value(\"file_not_found\", blufs::file_not_found),\n value(\"regular_file\", blufs::regular_file),\n value(\"directory_file\", blufs::directory_file),\n value(\"symlink_file\", blufs::symlink_file),\n value(\"block_file\", blufs::block_file),\n value(\"character_file\", blufs::character_file),\n value(\"fifo_file\", blufs::fifo_file),\n value(\"socket_file\", blufs::socket_file),\n value(\"type_unknown\", blufs::type_unknown)\n ]\n\n .enum_(\"perms\")\n [\n value(\"no_perms\", blufs::no_perms),\n value(\"owner_read\", blufs::owner_read),\n value(\"owner_write\", blufs::owner_write),\n value(\"owner_exe\", blufs::owner_exe),\n value(\"owner_all\", blufs::owner_all),\n value(\"group_read\", blufs::group_read),\n value(\"group_write\", blufs::group_write),\n value(\"group_exe\", blufs::group_exe),\n value(\"group_all\", blufs::group_all),\n value(\"others_read\", blufs::others_read),\n value(\"others_write\", blufs::others_write),\n value(\"others_exe\", blufs::others_exe),\n value(\"others_all\", blufs::others_all),\n value(\"all_all\", blufs::all_all),\n value(\"set_uid_on_exe\", blufs::set_uid_on_exe),\n value(\"set_gid_on_exe\", blufs::set_gid_on_exe),\n value(\"sticky_bit\", blufs::sticky_bit),\n value(\"perms_mask\", blufs::perms_mask),\n value(\"perms_not_known\", blufs::perms_not_known),\n value(\"add_perms\", blufs::add_perms),\n value(\"remove_perms\", blufs::remove_perms),\n value(\"symlink_perms\", blufs::symlink_perms)\n ]\n ,\n\n class_<blufs::space_info>(\"space_info\")\n .def_readwrite(\"capacity\", &blufs::space_info::capacity)\n .def_readwrite(\"free\", &blufs::space_info::free)\n .def_readwrite(\"available\", &blufs::space_info::available)\n ,\n\n class_<blufs::copy_option>(\"copy_option\")\n .enum_(\"values\")\n [\n value(\"none\", static_cast<int>(blufs::copy_option::none)),\n value(\"fail_if_exists\", static_cast<int>(blufs::copy_option::fail_if_exists)),\n value(\"overwrite_if_exists\", static_cast<int>(blufs::copy_option::overwrite_if_exists))\n ]\n ,\n\n class_<blufs::symlink_option>(\"symlink_option\")\n .enum_(\"values\")\n [\n value(\"none\", static_cast<int>(blufs::symlink_option::none)),\n value(\"no_recurse\", static_cast<int>(blufs::symlink_option::no_recurse)),\n value(\"recurse\", static_cast<int>(blufs::symlink_option::recurse))\n ]\n ,\n\n def(\"current_path\", (blufs::path(*)()) blufs::current_path),\n def(\"current_path\", (void(*)(blufs::path const&)) blufs::current_path),\n def(\"current_path\", current_path_s ),\n def(\"create_directories\", (bool(*)(blufs::path const&)) blufs::create_directories),\n \/\/ def(\"create_directories\", fs::create_directories_s),\n def(\"create_directory\", (bool(*)(blufs::path const&)) blufs::create_directory),\n \/\/ def(\"create_directory\", fs::create_directory_s),\n def(\"copy\", (void(*)(blufs::path const&,blufs::path const&)) blufs::copy)\n \/\/ def(\"copy\", fs::copy_s),\n ];\n}\n<|endoftext|>"} {"text":"<commit_before>#include <iostream>\nusing std::cout;\nusing std::endl;\n\n#include <boost\/multi_array.hpp>\n\ntypedef boost::multi_array<float,1> array_f;\n\n\/\/ class definition\nclass Test\n{\npublic:\n Test( float, float, float );\n void printarr();\n void setarr( float, float, float );\n array_f& getarr();\n\nprivate:\n array_f arrmem;\n};\n\n\/\/ Define some function\nfloat vectorsum( array_f& );\n\n\/\/ implement function\nfloat vectorsum( array_f& h )\n{\n float sum = 0;\n for ( int i=0; i<3; i++)\n sum += h[i];\n return sum;\n}\n\n\/\/ constructor\nTest::Test( float x, float y, float z )\n : arrmem( boost::extents[3] )\n{\n setarr( x, y, z );\n}\n\n\/\/ Set arr function\nvoid Test::setarr( float x, float y, float z )\n{\n arrmem[0] = x;\n arrmem[1] = y;\n arrmem[2] = z;\n}\n\n\/\/ get arr function\narray_f& Test::getarr()\n{\n return arrmem;\n}\n\n\/\/ print function\nvoid Test::printarr()\n{\n cout << arrmem[0] << arrmem[1] << arrmem[2] << endl;\n}\n\nint main( void )\n{\n Test t( 1.0, 2.0, 3.0 );\n cout << \"Created test class instance with 1.0 2.0 3.0\" << endl;\n t.printarr();\n\n t.setarr( 6.0, 5.0, 4.0 );\n cout << \"Set array to 4.0 5.0 6.0\" << endl;\n t.printarr();\n\n array_f arr( boost::extents[3] );\n cout << \"Created boost array\" << endl;\n\n arr[0] = 1.2;\n arr[1] = 2.2;\n arr[2] = 3.2;\n\n cout << \"Sum of vector [1.2,2.2,3.2] is...\" << endl;\n cout << vectorsum( arr ) << endl;\n \n return 1;\n}\n<commit_msg>Some more small examples written to boosttest<commit_after>#include <iostream>\nusing std::cout;\nusing std::endl;\n\n#include <boost\/multi_array.hpp>\n\ntypedef boost::multi_array<float,1> array_f;\n\n\/\/ class definition\nclass Test\n{\npublic:\n Test( float, float, float );\n void printarr();\n void setarr( float, float, float );\n array_f& getarr();\n\nprivate:\n array_f arrmem;\n};\n\n\/\/ Define some function\nfloat vectorsum( array_f& );\n\n\/\/ implement function\nfloat vectorsum( array_f& h )\n{\n float sum = 0;\n for ( int i=0; i<3; i++)\n sum += h[i];\n return sum;\n}\n\n\/\/ constructor\nTest::Test( float x, float y, float z )\n : arrmem( boost::extents[3] )\n{\n setarr( x, y, z );\n}\n\n\/\/ Set arr function\nvoid Test::setarr( float x, float y, float z )\n{\n arrmem[0] = x;\n arrmem[1] = y;\n arrmem[2] = z;\n}\n\n\/\/ get arr function\narray_f& Test::getarr()\n{\n return arrmem;\n}\n\n\/\/ print function\nvoid Test::printarr()\n{\n cout << arrmem[0] << arrmem[1] << arrmem[2] << endl;\n}\n\nint main( void )\n{\n Test t( 1.0, 2.0, 3.0 );\n cout << \"Created test class instance with 1.0 2.0 3.0\" << endl;\n t.printarr();\n\n t.setarr( 6.0, 5.0, 4.0 );\n cout << \"Set array to 4.0 5.0 6.0\" << endl;\n t.printarr();\n\n array_f arr( boost::extents[3] );\n cout << \"Created boost array\" << endl;\n\n arr[0] = 1.2;\n arr[1] = 2.2;\n arr[2] = 3.2;\n\n cout << \"Sum of vector [1.2,2.2,3.2] is...\" << endl;\n cout << vectorsum( arr ) << endl;\n\n array_f x( boost::extents[2] );\n x[0] = 1;\n x[1] = 0;\n array_f& xref = x;\n\n array_f y( boost::extents[2] );\n y = xref;\n y[1] = 2;\n cout << \"y is [\" << y[0] << \",\" << y[1] << \"]\" << endl; \n cout << \"x is [\" << x[0] << \",\" << x[1] << \"]\" << endl;\n\n \n return 1;\n}\n<|endoftext|>"} {"text":"<commit_before>\/\/=====================================================================\r\n\/\/\r\n\/\/ CoreTimer.cpp - \r\n\/\/\r\n\/\/ Created by skywind on 2021\/12\/01\r\n\/\/ Last Modified: 2021\/12\/01 17:44:14\r\n\/\/\r\n\/\/=====================================================================\r\n\r\n#include <stddef.h>\r\n#include <assert.h>\r\n\r\n#include \"CoreTimer.h\"\r\n\r\n\r\n\/\/---------------------------------------------------------------------\r\n\/\/ ctor\r\n\/\/---------------------------------------------------------------------\r\nTimer::Timer(Scheduler *sched)\r\n{\r\n\t_sched = sched;\r\n\tcallback = NULL;\r\n\tuser = NULL;\r\n\ttimestamp = 0;\r\n\titimer_evt_init(&_evt, evt_callback, this, NULL);\r\n}\r\n\r\n\r\n\/\/---------------------------------------------------------------------\r\n\/\/ dtor\r\n\/\/---------------------------------------------------------------------\r\nTimer::~Timer()\r\n{\r\n\tstop();\r\n\tuser = NULL;\r\n\tcallback = NULL;\r\n\t_sched = NULL;\r\n}\r\n\r\n\r\n\r\n\/\/---------------------------------------------------------------------\r\n\/\/ callback\r\n\/\/---------------------------------------------------------------------\r\nvoid Timer::evt_callback(void *obj, void *user)\r\n{\r\n\tTimer *self = (Timer*)obj;\r\n\tif (self->callback) {\r\n\t\tif (self->_sched) {\r\n\t\t\t\/\/ 更新标准时间戳\r\n\t\t\tself->timestamp = self->_sched->_mgr.current;\r\n\t\t}\r\n\t\tself->callback(self);\r\n\t}\r\n}\r\n\r\n\r\n\/\/---------------------------------------------------------------------\r\n\/\/ start timer\r\n\/\/---------------------------------------------------------------------\r\nbool Timer::start(uint32_t period, int repeat)\r\n{\r\n\tassert(_sched != NULL);\r\n\tif (_sched == NULL) {\r\n\t\treturn false;\r\n\t}\r\n\tif (_sched->_inited == false) {\r\n\t\treturn false;\r\n\t}\r\n\titimer_evt_start(&(_sched->_mgr), &_evt, period, repeat);\r\n\treturn true;\r\n}\r\n\r\n\r\n\/\/---------------------------------------------------------------------\r\n\/\/ stop timer\r\n\/\/---------------------------------------------------------------------\r\nvoid Timer::stop()\r\n{\r\n\tassert(_sched != NULL);\r\n\titimer_evt_stop(&(_sched->_mgr), &_evt);\r\n}\r\n\r\n\r\n\/\/---------------------------------------------------------------------\r\n\/\/ check is running\r\n\/\/---------------------------------------------------------------------\r\nbool Timer::is_running() const\r\n{\r\n\tif (_sched) {\r\n\t\treturn itimer_evt_status(&_evt)? true : false;\r\n\t}\r\n\treturn false;\r\n}\r\n\r\n\r\n\/\/---------------------------------------------------------------------\r\n\/\/ 返回还剩多少次调用\r\n\/\/---------------------------------------------------------------------\r\nint Timer::remain() const\r\n{\r\n\treturn _evt.remain;\r\n}\r\n\r\n\r\n\/\/---------------------------------------------------------------------\r\n\/\/ ctor\r\n\/\/---------------------------------------------------------------------\r\nScheduler::Scheduler()\r\n{\r\n\t_inited = false;\r\n\titimer_mgr_init(&_mgr, 0, 10);\r\n}\r\n\r\n\r\n\/\/---------------------------------------------------------------------\r\n\/\/ dtor\r\n\/\/---------------------------------------------------------------------\r\nScheduler::~Scheduler()\r\n{\r\n\titimer_mgr_destroy(&_mgr);\r\n}\r\n\r\n\r\n\/\/---------------------------------------------------------------------\r\n\/\/ init\r\n\/\/---------------------------------------------------------------------\r\nvoid Scheduler::init(uint32_t current, uint32_t interval)\r\n{\r\n\tif (_inited) {\r\n\t\titimer_mgr_destroy(&_mgr);\r\n\t}\r\n\titimer_mgr_init(&_mgr, current, interval);\r\n\t_inited = true;\r\n}\r\n\r\n\r\n\/\/---------------------------------------------------------------------\r\n\/\/ update timers\r\n\/\/---------------------------------------------------------------------\r\nvoid Scheduler::update(uint32_t current)\r\n{\r\n\tif (_inited) {\r\n\t\titimer_mgr_run(&_mgr, current);\r\n\t}\r\n}\r\n\r\n\r\n\r\n<commit_msg>commit new CoreTimer.cpp<commit_after>\/\/=====================================================================\r\n\/\/\r\n\/\/ CoreTimer.cpp - \r\n\/\/\r\n\/\/ Created by skywind on 2021\/12\/01\r\n\/\/ Last Modified: 2021\/12\/01 17:44:14\r\n\/\/\r\n\/\/=====================================================================\r\n\r\n#include <stddef.h>\r\n#include <assert.h>\r\n\r\n#include \"CoreTimer.h\"\r\n\r\n\r\n\/\/---------------------------------------------------------------------\r\n\/\/ ctor\r\n\/\/---------------------------------------------------------------------\r\nTimer::Timer(Scheduler *sched)\r\n{\r\n\t_sched = sched;\r\n\tcallback = NULL;\r\n\tuser = NULL;\r\n\ttimestamp = 0;\r\n\titimer_evt_init(&_evt, evt_callback, this, NULL);\r\n}\r\n\r\n\r\n\/\/---------------------------------------------------------------------\r\n\/\/ dtor\r\n\/\/---------------------------------------------------------------------\r\nTimer::~Timer()\r\n{\r\n\tstop();\r\n\tuser = NULL;\r\n\tcallback = NULL;\r\n\t_sched = NULL;\r\n}\r\n\r\n\r\n\r\n\/\/---------------------------------------------------------------------\r\n\/\/ callback\r\n\/\/---------------------------------------------------------------------\r\nvoid Timer::evt_callback(void *obj, void *user)\r\n{\r\n\tTimer *self = (Timer*)obj;\r\n\tif (self->callback) {\r\n\t\tif (self->_sched) {\r\n\t\t\t\/\/ 更新标准时间戳\r\n\t\t\tself->timestamp = self->_sched->_mgr.current;\r\n\t\t}\r\n\t\tself->callback(self);\r\n\t}\r\n}\r\n\r\n\r\n\/\/---------------------------------------------------------------------\r\n\/\/ start timer\r\n\/\/---------------------------------------------------------------------\r\nbool Timer::start(uint32_t period, int repeat)\r\n{\r\n\tassert(_sched != NULL);\r\n\tif (_sched == NULL) {\r\n\t\treturn false;\r\n\t}\r\n\tif (_sched->_inited == false) {\r\n\t\treturn false;\r\n\t}\r\n\titimer_evt_start(&(_sched->_mgr), &_evt, period, repeat);\r\n\treturn true;\r\n}\r\n\r\n\r\n\/\/---------------------------------------------------------------------\r\n\/\/ stop timer\r\n\/\/---------------------------------------------------------------------\r\nvoid Timer::stop()\r\n{\r\n\tassert(_sched != NULL);\r\n\titimer_evt_stop(&(_sched->_mgr), &_evt);\r\n}\r\n\r\n\r\n\/\/---------------------------------------------------------------------\r\n\/\/ check is running\r\n\/\/---------------------------------------------------------------------\r\nbool Timer::is_running() const\r\n{\r\n\tif (_sched) {\r\n\t\treturn itimer_evt_status(&_evt)? true : false;\r\n\t}\r\n\treturn false;\r\n}\r\n\r\n\r\n\/\/---------------------------------------------------------------------\r\n\/\/ 返回还剩多少次调用\r\n\/\/---------------------------------------------------------------------\r\nint Timer::remain() const\r\n{\r\n\treturn _evt.remain;\r\n}\r\n\r\n\r\n\/\/---------------------------------------------------------------------\r\n\/\/ ctor\r\n\/\/---------------------------------------------------------------------\r\nScheduler::Scheduler()\r\n{\r\n\t_inited = false;\r\n\titimer_mgr_init(&_mgr, 0, 5);\r\n}\r\n\r\n\r\n\/\/---------------------------------------------------------------------\r\n\/\/ dtor\r\n\/\/---------------------------------------------------------------------\r\nScheduler::~Scheduler()\r\n{\r\n\titimer_mgr_destroy(&_mgr);\r\n}\r\n\r\n\r\n\/\/---------------------------------------------------------------------\r\n\/\/ init\r\n\/\/---------------------------------------------------------------------\r\nvoid Scheduler::init(uint32_t current, uint32_t interval)\r\n{\r\n\tif (_inited) {\r\n\t\titimer_mgr_destroy(&_mgr);\r\n\t}\r\n\titimer_mgr_init(&_mgr, current, interval);\r\n\t_inited = true;\r\n}\r\n\r\n\r\n\/\/---------------------------------------------------------------------\r\n\/\/ update timers\r\n\/\/---------------------------------------------------------------------\r\nvoid Scheduler::update(uint32_t current)\r\n{\r\n\titimer_mgr_run(&_mgr, current);\r\n}\r\n\r\n\r\n\r\n<|endoftext|>"} {"text":"<commit_before><commit_msg>INTEGRATION: CWS a11ysep (1.1.2); FILE ADDED 2007\/02\/28 07:26:18 fs 1.1.2.3: #i10000# 2005\/09\/28 11:36:43 fs 1.1.2.2: manual resync (files have been moved herein from another location): licence change 2005\/03\/07 08:29:21 fs 1.1.2.1: #i44293# moved implementations herein from svtools module<commit_after><|endoftext|>"} {"text":"<commit_before><commit_msg>COMP: avoid definition of SpectralForwardModelImageFilter for DRM binning<commit_after><|endoftext|>"} {"text":"<commit_before>\/\/ lab3.cpp : Defines the entry point for the console application.\n\/\/\n\n#include \"stdafx.h\"\n#include <queue>\n#include <iostream>\n#include <random>\n#include <Windows.h>\n\nusing namespace std;\n\nqueue<int> numbers;\nconst int NUMBER_COUNT = 100;\n\n\/\/ \nvoid GenerateNumbers();\nvoid ProcessNumbers(int*);\n\n\/\/ \nint _tmain(int argc, _TCHAR* argv[])\n{\t\n\tint sum;\n\n\t\/\/ ( ).\n\t\/\/srand(200);\n\n\tGenerateNumbers();\n\tProcessNumbers(&sum);\n\n\treturn 0;\n}\n\nvoid GenerateNumbers()\n{\n\tfor (size_t i = 0; i < NUMBER_COUNT; i++)\n\t{\n\t\t\/\/ 0-99\n\t\tnumbers.push(rand()%100);\n\t\tcout << \"Generated number \" << numbers.back() << endl;\n\t\t\/\/ ( )\n\t\tSleep(2000);\n\t}\n}\n\nvoid ProcessNumbers(int* sumAddress)\n{\n\twhile (numbers.size() != 0)\n\t{\n\t\t\/\/ \n\t\tint current = numbers.front();\n\t\tcout << \"Processing element \" << current << endl;\n\t\t\/\/ \n\t\tnumbers.pop();\n\t\t\/\/ , \n\t\t*sumAddress+=current;\n\t\t\/\/ ( )\n\t\tSleep(2000);\n\t}\n}<commit_msg>Флаг завершения генератора<commit_after>\/\/ lab3.cpp : Defines the entry point for the console application.\n\/\/\n\n#include \"stdafx.h\"\n#include <queue>\n#include <iostream>\n#include <random>\n#include <Windows.h>\n\nusing namespace std;\n\nqueue<int> numbers;\nconst int NUMBER_COUNT = 100;\nvolatile bool GeneratorCompleted = FALSE;\n\n\/\/ \nvoid GenerateNumbers();\nvoid ProcessNumbers(int*);\n\n\/\/ \nint _tmain(int argc, _TCHAR* argv[])\n{\t\n\tint sum;\n\n\t\/\/ ( ).\n\t\/\/srand(200);\n\n\tGenerateNumbers();\n\tProcessNumbers(&sum);\n\n\treturn 0;\n}\n\nvoid GenerateNumbers()\n{\n\tfor (size_t i = 0; i < NUMBER_COUNT; i++)\n\t{\n\t\t\/\/ 0-99\n\t\tnumbers.push(rand()%100);\n\t\tcout << \"Generated number \" << numbers.back() << endl;\n\t\t\/\/ ( )\n\t\tSleep(2000);\n\t}\n\tGeneratorCompleted = TRUE;\n}\n\nvoid ProcessNumbers(int* sumAddress)\n{\n\twhile (!GeneratorCompleted)\n\t{\n\t\twhile (numbers.size() != 0)\n\t\t{\n\t\t\t\/\/ \n\t\t\tint current = numbers.front();\n\t\t\tcout << \"Processing element \" << current << endl;\n\t\t\t\/\/ \n\t\t\tnumbers.pop();\n\t\t\t\/\/ , \n\t\t\t*sumAddress += current;\n\t\t\t\/\/ ( )\n\t\t\tSleep(1000);\n\t\t}\n\t}\n}<|endoftext|>"} {"text":"<commit_before>#include <AndroidClient.h>\n#include <jni.h>\n#include <android\/log.h>\n\nclass AndroidClient : public HTTPClient {\n public:\n\n\tAndroidClient(JNIEnv * _env, const std::string & _user_agent, bool _enable_cookies, bool _enable_keepalive)\n : HTTPClient(_user_agent, _enable_cookies, _enable_keepalive), env(_env) {\n\n\n\t\t__android_log_print(ANDROID_LOG_VERBOSE, \"Sometrik\", \"AndroidClient Constructor called\");\n\n\t}\n\n\tvoid androidInit(){\n\n\t\tcookieManagerClass = env->FindClass(\"android\/webkit\/CookieManager\");\n\t\thttpClass = env->FindClass(\"java\/net\/HttpURLConnection\");\n\t\turlClass = env->FindClass(\"java\/net\/URL\");\n\t \tinputStreamClass = env->FindClass(\"java\/io\/InputStream\");\n\n\n\t\tgetHeaderMethod = env->GetMethodID(httpClass, \"getHeaderField\", \"(Ljava\/lang\/String;)Ljava\/lang\/String;\");\n\t \treadMethod = env->GetMethodID(inputStreamClass, \"read\", \"([B)I\");\n\t \turlConstructor = env->GetMethodID(urlClass, \"<init>\", \"(Ljava\/lang\/String;)V\");\n\t\topenConnectionMethod = env->GetMethodID(urlClass, \"openConnection\", \"()Ljava\/net\/URLConnection;\");\n\t\tsetRequestProperty = env->GetMethodID(httpClass, \"setRequestProperty\", \"(Ljava\/lang\/String;Ljava\/lang\/String;)V\");\n\t\tsetRequestMethod = env->GetMethodID(httpClass, \"setRequestMethod\", \"(Ljava\/lang\/String;)V\");\n\t\tsetFollowMethod = env->GetMethodID(httpClass, \"setInstanceFollowRedirects\", \"(Z)V\");\n\t\tsetDoInputMethod = env->GetMethodID(httpClass, \"setDoInput\", \"(Z)V\");\n\t\tconnectMethod = env->GetMethodID(httpClass, \"connect\", \"()V\");\n\t\tgetResponseCodeMethod = env->GetMethodID(httpClass, \"getResponseCode\", \"()I\");\n\t\tgetResponseMessageMethod = env->GetMethodID(httpClass, \"getResponseMessage\", \"()Ljava\/lang\/String;\");\n\t\tsetRequestPropertyMethod = env->GetMethodID(httpClass, \"setRequestProperty\", \"(Ljava\/lang\/String;Ljava\/lang\/String;)V\");\n\t\tclearCookiesMethod = env->GetMethodID(cookieManagerClass, \"removeAllCookie\", \"()V\");\n\t\tgetInputStreamMethod = env->GetMethodID(httpClass, \"getInputStream\", \"()Ljava\/io\/InputStream;\");\n\n\t\tinitDone = true;\n\n\t}\n\n HTTPResponse request(const HTTPRequest & req, const Authorization & auth){\n\n\n\t\t__android_log_print(ANDROID_LOG_VERBOSE, \"Sometrik\", \"AndroidClient request called\");\n\n \tif (!initDone){\n \t\tandroidInit();\n \t}\n\n\n \tjobject url = env->NewObject(urlClass, urlConstructor, env->NewStringUTF(req.getURI().c_str()));\n \tjobject connection = env->CallObjectMethod(url, openConnectionMethod);\n\n\n \t\/\/Authorization example\n\t\t\/\/env->CallVoidMethod(connection, setRequestPropertyMethod, env->NewStringUTF(\"Authorization\"), env->NewStringUTF(\"myUsername\"));\n\n\t\t\/\/ std::string auth_header = auth.createHeader();\n\n\t\t\/\/ if (!auth_header.empty()) {\n\t\t\/\/\t\tenv->CallVoidMethod(connection, setRequestPropertyMethod, env->NewStringUTF(auth.getHeaderName()), env->NewStringUTF(auth_header.c_str()));\n\t\t\/\/}\n\n\t\tenv->CallVoidMethod(connection, setFollowMethod, req.getFollowLocation() ? JNI_TRUE : JNI_FALSE);\n\n\t\tswitch (req.getType()) {\n\t\tcase HTTPRequest::POST:\n\t\t\tenv->CallVoidMethod(connection, setRequestMethod, env->NewStringUTF(\"POST\"));\n\t\t\tbreak;\n\t\tcase HTTPRequest::GET:\n\t\t\tenv->CallVoidMethod(connection, setRequestMethod, env->NewStringUTF(\"GET\"));\n\t\t\t;\n\t\t\tbreak;\n\t\t}\n\n\t\tint responseCode = env->CallIntMethod(connection, getResponseCodeMethod);\n\n\t\tif (env->ExceptionCheck()) {\n\t\t\tenv->ExceptionClear();\n\t\t\t__android_log_print(ANDROID_LOG_INFO, \"AndroidClient\", \"EXCEPTION http request responsecode = %i\", responseCode);\n\t\t\treturn HTTPResponse(0, \"exception\");\n\t\t}\n\t\t__android_log_print(ANDROID_LOG_INFO, \"AndroidClient\", \"http request responsecode = %i\", responseCode);\n\n\t\tconst char *errorMessage = \"\";\n\n\t\tif (responseCode >= 400 && responseCode <= 599){\n\t\t\tjstring javaMessage = (jstring)env->CallObjectMethod(connection, getResponseMessageMethod);\n\t\t\terrorMessage = env->GetStringUTFChars(javaMessage, 0);\n\n\t\t}\n\n\t\tjobject input = env->CallObjectMethod(connection, getInputStreamMethod);\n\t\tenv->ExceptionClear();\n\n\t\tjbyteArray array = env->NewByteArray(4096);\n\t\tint g = 0;\n\t\tstd::string content;\n\n\t\twhile ((g = env->CallIntMethod(input, readMethod, array)) != -1) {\n\n\t\t\tjbyte* content_array = env->GetByteArrayElements(array, NULL);\n\t\t\tif (callback) {\n\t\t\t\tcallback->handleChunk(g, (char*) content_array);\n\t\t\t} else {\n\t\t\t\tcontent += std::string((char*) content_array, g);\n\t\t\t}\n\n\t\t\tenv->ReleaseByteArrayElements(array, content_array, JNI_ABORT);\n\n\t\t}\n\n\t\tconst char *followString = \"\";\n\n\t\tif (responseCode >= 300 && responseCode <= 399) {\n\n\t\t\tjstring followURL = (jstring)env->CallObjectMethod(connection, getHeaderMethod, env->NewStringUTF(\"location\"));\n\t\t\tfollowString = env->GetStringUTFChars(followURL, 0);\n\n\t\t\t__android_log_print(ANDROID_LOG_INFO, \"content\", \"followURL = %s\", followString);\n\n\t\t}\n\n\t\t__android_log_print(ANDROID_LOG_INFO, \"content\", \"contentti = %Ld\", content.size());\n\n\t\treturn HTTPResponse(responseCode, errorMessage, followString, content);\n\n }\n\n void clearCookies() {\n\n \tenv->CallVoidMethod(cookieManagerClass, clearCookiesMethod);\n\n }\n\n protected:\n bool initialize() { return true; }\n\n\n private:\n\tbool initDone = false;\n\n JNIEnv * env;\n jclass cookieManagerClass;\n jmethodID clearCookiesMethod;\n\n jclass bitmapClass;\n jclass factoryClass;\n jclass httpClass;\n jclass urlClass;\n jclass bufferedReaderClass;\n jclass inputStreamReaderClass;\n jclass inputStreamClass;\n jmethodID urlConstructor;\n jmethodID openConnectionMethod;\n jmethodID setRequestProperty;\n jmethodID setRequestMethod;\n jmethodID setDoInputMethod;\n jmethodID connectMethod;\n jmethodID getResponseCodeMethod;\n jmethodID getResponseMessageMethod;\n jmethodID setRequestPropertyMethod;\n jmethodID outputStreamConstructor;\n jmethodID factoryDecodeMethod;\n jmethodID getInputStreamMethod;\n jmethodID bufferedReaderConstructor;\n jmethodID inputStreamReaderConstructor;\n jmethodID readLineMethod;\n jmethodID readerCloseMethod;\n jmethodID readMethod;\n jmethodID inputStreamCloseMethod;\n jmethodID setFollowMethod;\n jmethodID getHeaderMethod;\n\n};\n\nstd::shared_ptr<HTTPClient>\nAndroidClientFactory::createClient(const std::string & _user_agent, bool _enable_cookies, bool _enable_keepalive) {\n return std::make_shared<AndroidClient>(env, _user_agent, _enable_cookies, _enable_keepalive);\n}\n\n<commit_msg>Change exception error message in exception check<commit_after>#include <AndroidClient.h>\n#include <jni.h>\n#include <android\/log.h>\n\nclass AndroidClient : public HTTPClient {\n public:\n\n\tAndroidClient(JNIEnv * _env, const std::string & _user_agent, bool _enable_cookies, bool _enable_keepalive)\n : HTTPClient(_user_agent, _enable_cookies, _enable_keepalive), env(_env) {\n\n\n\t\t__android_log_print(ANDROID_LOG_VERBOSE, \"Sometrik\", \"AndroidClient Constructor called\");\n\n\t}\n\n\tvoid androidInit(){\n\n\t\tcookieManagerClass = env->FindClass(\"android\/webkit\/CookieManager\");\n\t\thttpClass = env->FindClass(\"java\/net\/HttpURLConnection\");\n\t\turlClass = env->FindClass(\"java\/net\/URL\");\n\t \tinputStreamClass = env->FindClass(\"java\/io\/InputStream\");\n\n\n\t\tgetHeaderMethod = env->GetMethodID(httpClass, \"getHeaderField\", \"(Ljava\/lang\/String;)Ljava\/lang\/String;\");\n\t \treadMethod = env->GetMethodID(inputStreamClass, \"read\", \"([B)I\");\n\t \turlConstructor = env->GetMethodID(urlClass, \"<init>\", \"(Ljava\/lang\/String;)V\");\n\t\topenConnectionMethod = env->GetMethodID(urlClass, \"openConnection\", \"()Ljava\/net\/URLConnection;\");\n\t\tsetRequestProperty = env->GetMethodID(httpClass, \"setRequestProperty\", \"(Ljava\/lang\/String;Ljava\/lang\/String;)V\");\n\t\tsetRequestMethod = env->GetMethodID(httpClass, \"setRequestMethod\", \"(Ljava\/lang\/String;)V\");\n\t\tsetFollowMethod = env->GetMethodID(httpClass, \"setInstanceFollowRedirects\", \"(Z)V\");\n\t\tsetDoInputMethod = env->GetMethodID(httpClass, \"setDoInput\", \"(Z)V\");\n\t\tconnectMethod = env->GetMethodID(httpClass, \"connect\", \"()V\");\n\t\tgetResponseCodeMethod = env->GetMethodID(httpClass, \"getResponseCode\", \"()I\");\n\t\tgetResponseMessageMethod = env->GetMethodID(httpClass, \"getResponseMessage\", \"()Ljava\/lang\/String;\");\n\t\tsetRequestPropertyMethod = env->GetMethodID(httpClass, \"setRequestProperty\", \"(Ljava\/lang\/String;Ljava\/lang\/String;)V\");\n\t\tclearCookiesMethod = env->GetMethodID(cookieManagerClass, \"removeAllCookie\", \"()V\");\n\t\tgetInputStreamMethod = env->GetMethodID(httpClass, \"getInputStream\", \"()Ljava\/io\/InputStream;\");\n\n\t\tinitDone = true;\n\n\t}\n\n HTTPResponse request(const HTTPRequest & req, const Authorization & auth){\n\n\n\t\t__android_log_print(ANDROID_LOG_VERBOSE, \"Sometrik\", \"AndroidClient request called\");\n\n \tif (!initDone){\n \t\tandroidInit();\n \t}\n\n\n \tjobject url = env->NewObject(urlClass, urlConstructor, env->NewStringUTF(req.getURI().c_str()));\n \tjobject connection = env->CallObjectMethod(url, openConnectionMethod);\n\n\n \t\/\/Authorization example\n\t\t\/\/env->CallVoidMethod(connection, setRequestPropertyMethod, env->NewStringUTF(\"Authorization\"), env->NewStringUTF(\"myUsername\"));\n\n\t\t\/\/ std::string auth_header = auth.createHeader();\n\n\t\t\/\/ if (!auth_header.empty()) {\n\t\t\/\/\t\tenv->CallVoidMethod(connection, setRequestPropertyMethod, env->NewStringUTF(auth.getHeaderName()), env->NewStringUTF(auth_header.c_str()));\n\t\t\/\/}\n\n\t\tenv->CallVoidMethod(connection, setFollowMethod, req.getFollowLocation() ? JNI_TRUE : JNI_FALSE);\n\n\t\tswitch (req.getType()) {\n\t\tcase HTTPRequest::POST:\n\t\t\tenv->CallVoidMethod(connection, setRequestMethod, env->NewStringUTF(\"POST\"));\n\t\t\tbreak;\n\t\tcase HTTPRequest::GET:\n\t\t\tenv->CallVoidMethod(connection, setRequestMethod, env->NewStringUTF(\"GET\"));\n\t\t\t;\n\t\t\tbreak;\n\t\t}\n\n\t\tint responseCode = env->CallIntMethod(connection, getResponseCodeMethod);\n\n\t\tif (env->ExceptionCheck()) {\n\t\t\tenv->ExceptionClear();\n\t\t\t__android_log_print(ANDROID_LOG_INFO, \"AndroidClient\", \"EXCEPTION http request responsecode = %i\", responseCode);\n\t\t\treturn HTTPResponse(0, \"Server not found\");\n\t\t}\n\t\t__android_log_print(ANDROID_LOG_INFO, \"AndroidClient\", \"http request responsecode = %i\", responseCode);\n\n\t\tconst char *errorMessage = \"\";\n\n\t\tif (responseCode >= 400 && responseCode <= 599){\n\t\t\tjstring javaMessage = (jstring)env->CallObjectMethod(connection, getResponseMessageMethod);\n\t\t\terrorMessage = env->GetStringUTFChars(javaMessage, 0);\n\n\t\t}\n\n\t\tjobject input = env->CallObjectMethod(connection, getInputStreamMethod);\n\t\tenv->ExceptionClear();\n\n\t\tjbyteArray array = env->NewByteArray(4096);\n\t\tint g = 0;\n\t\tstd::string content;\n\n\t\twhile ((g = env->CallIntMethod(input, readMethod, array)) != -1) {\n\n\t\t\tjbyte* content_array = env->GetByteArrayElements(array, NULL);\n\t\t\tif (callback) {\n\t\t\t\tcallback->handleChunk(g, (char*) content_array);\n\t\t\t} else {\n\t\t\t\tcontent += std::string((char*) content_array, g);\n\t\t\t}\n\n\t\t\tenv->ReleaseByteArrayElements(array, content_array, JNI_ABORT);\n\n\t\t}\n\n\t\tconst char *followString = \"\";\n\n\t\tif (responseCode >= 300 && responseCode <= 399) {\n\n\t\t\tjstring followURL = (jstring)env->CallObjectMethod(connection, getHeaderMethod, env->NewStringUTF(\"location\"));\n\t\t\tfollowString = env->GetStringUTFChars(followURL, 0);\n\n\t\t\t__android_log_print(ANDROID_LOG_INFO, \"content\", \"followURL = %s\", followString);\n\n\t\t}\n\n\t\t__android_log_print(ANDROID_LOG_INFO, \"content\", \"contentti = %Ld\", content.size());\n\n\t\treturn HTTPResponse(responseCode, errorMessage, followString, content);\n\n }\n\n void clearCookies() {\n\n \tenv->CallVoidMethod(cookieManagerClass, clearCookiesMethod);\n\n }\n\n protected:\n bool initialize() { return true; }\n\n\n private:\n\tbool initDone = false;\n\n JNIEnv * env;\n jclass cookieManagerClass;\n jmethodID clearCookiesMethod;\n\n jclass bitmapClass;\n jclass factoryClass;\n jclass httpClass;\n jclass urlClass;\n jclass bufferedReaderClass;\n jclass inputStreamReaderClass;\n jclass inputStreamClass;\n jmethodID urlConstructor;\n jmethodID openConnectionMethod;\n jmethodID setRequestProperty;\n jmethodID setRequestMethod;\n jmethodID setDoInputMethod;\n jmethodID connectMethod;\n jmethodID getResponseCodeMethod;\n jmethodID getResponseMessageMethod;\n jmethodID setRequestPropertyMethod;\n jmethodID outputStreamConstructor;\n jmethodID factoryDecodeMethod;\n jmethodID getInputStreamMethod;\n jmethodID bufferedReaderConstructor;\n jmethodID inputStreamReaderConstructor;\n jmethodID readLineMethod;\n jmethodID readerCloseMethod;\n jmethodID readMethod;\n jmethodID inputStreamCloseMethod;\n jmethodID setFollowMethod;\n jmethodID getHeaderMethod;\n\n};\n\nstd::shared_ptr<HTTPClient>\nAndroidClientFactory::createClient(const std::string & _user_agent, bool _enable_cookies, bool _enable_keepalive) {\n return std::make_shared<AndroidClient>(env, _user_agent, _enable_cookies, _enable_keepalive);\n}\n\n<|endoftext|>"} {"text":"<commit_before>#include <AndroidClient.h>\n#include <jni.h>\n#include <android\/log.h>\n\nclass AndroidClient : public HTTPClient {\n public:\n\n\tAndroidClient(JNIEnv * _env, const std::string & _user_agent, bool _enable_cookies, bool _enable_keepalive)\n : HTTPClient(_user_agent, _enable_cookies, _enable_keepalive), env(_env) {\n\n\n\t\t__android_log_print(ANDROID_LOG_VERBOSE, \"Sometrik\", \"AndroidClient Constructor called\");\n\n\t}\n\n\tvoid androidInit(){\n\n\t\tcookieManagerClass = env->FindClass(\"android\/webkit\/CookieManager\");\n\t\thttpClass = env->FindClass(\"java\/net\/HttpURLConnection\");\n\t\turlClass = env->FindClass(\"java\/net\/URL\");\n\t \tinputStreamClass = env->FindClass(\"java\/io\/InputStream\");\n\n\n\t\tgetHeaderMethod = env->GetMethodID(httpClass, \"getHeaderField\", \"(Ljava\/lang\/String;)Ljava\/lang\/String;\");\n\t\tgetHeaderMethodInt = env->GetMethodID(httpClass, \"getHeaderField\", \"(I)Ljava\/lang\/String;\");\n\t\tgetHeaderKeyMethod = env->GetMethodID(httpClass, \"getHeaderFieldKey\", \"(I)Ljava\/lang\/String;\");\n\t \treadMethod = env->GetMethodID(inputStreamClass, \"read\", \"([B)I\");\n\t \turlConstructor = env->GetMethodID(urlClass, \"<init>\", \"(Ljava\/lang\/String;)V\");\n\t\topenConnectionMethod = env->GetMethodID(urlClass, \"openConnection\", \"()Ljava\/net\/URLConnection;\");\n\t\tsetRequestProperty = env->GetMethodID(httpClass, \"setRequestProperty\", \"(Ljava\/lang\/String;Ljava\/lang\/String;)V\");\n\t\tsetRequestMethod = env->GetMethodID(httpClass, \"setRequestMethod\", \"(Ljava\/lang\/String;)V\");\n\t\tsetFollowMethod = env->GetMethodID(httpClass, \"setInstanceFollowRedirects\", \"(Z)V\");\n\t\tsetDoInputMethod = env->GetMethodID(httpClass, \"setDoInput\", \"(Z)V\");\n\t\tconnectMethod = env->GetMethodID(httpClass, \"connect\", \"()V\");\n\t\tgetResponseCodeMethod = env->GetMethodID(httpClass, \"getResponseCode\", \"()I\");\n\t\tgetResponseMessageMethod = env->GetMethodID(httpClass, \"getResponseMessage\", \"()Ljava\/lang\/String;\");\n\t\tsetRequestPropertyMethod = env->GetMethodID(httpClass, \"setRequestProperty\", \"(Ljava\/lang\/String;Ljava\/lang\/String;)V\");\n\t\tclearCookiesMethod = env->GetMethodID(cookieManagerClass, \"removeAllCookie\", \"()V\");\n\t\tgetInputStreamMethod = env->GetMethodID(httpClass, \"getInputStream\", \"()Ljava\/io\/InputStream;\");\n\t\tgetErrorStreamMethod = env->GetMethodID(httpClass, \"getErrorStream\", \"()Ljava\/io\/InputStream;\");\n\n\t\tinitDone = true;\n\n\t}\n\n HTTPResponse request(const HTTPRequest & req, const Authorization & auth){\n\n\n\t\t__android_log_print(ANDROID_LOG_VERBOSE, \"Sometrik\", \"AndroidClient request called\");\n\n \tif (!initDone){\n \t\tandroidInit();\n \t}\n\n\n \tjobject url = env->NewObject(urlClass, urlConstructor, env->NewStringUTF(req.getURI().c_str()));\n \tjobject connection = env->CallObjectMethod(url, openConnectionMethod);\n\n\n \t\/\/Authorization example\n\t\t\/\/env->CallVoidMethod(connection, setRequestPropertyMethod, env->NewStringUTF(\"Authorization\"), env->NewStringUTF(\"myUsername\"));\n\n\t\t\/\/ std::string auth_header = auth.createHeader();\n\n\t\t\/\/ if (!auth_header.empty()) {\n\t\t\/\/\t\tenv->CallVoidMethod(connection, setRequestPropertyMethod, env->NewStringUTF(auth.getHeaderName()), env->NewStringUTF(auth_header.c_str()));\n\t\t\/\/}\n\n\t\tenv->CallVoidMethod(connection, setFollowMethod, req.getFollowLocation() ? JNI_TRUE : JNI_FALSE);\n\n\t\tswitch (req.getType()) {\n\t\tcase HTTPRequest::POST:\n\t\t\tenv->CallVoidMethod(connection, setRequestMethod, env->NewStringUTF(\"POST\"));\n\t\t\tbreak;\n\t\tcase HTTPRequest::GET:\n\t\t\tenv->CallVoidMethod(connection, setRequestMethod, env->NewStringUTF(\"GET\"));\n\t\t\t;\n\t\t\tbreak;\n\t\t}\n\n\t\tint responseCode = env->CallIntMethod(connection, getResponseCodeMethod);\n\n\t\t\/\/Server not found error\n\t\tif (env->ExceptionCheck()) {\n\t\t\tenv->ExceptionClear();\n\t\t\t__android_log_print(ANDROID_LOG_INFO, \"AndroidClient\", \"EXCEPTION http request responsecode = %i\", responseCode);\n\t\t\treturn HTTPResponse(0, \"Server not found\");\n\t\t}\n\n\t\tconst char *errorMessage = \"\";\n\t\tjobject input;\n\n\t\tif (responseCode >= 400 && responseCode <= 599 ){\n\t\t\t__android_log_print(ANDROID_LOG_INFO, \"AndroidClient\", \"request responsecode = %i\", responseCode);\n\n\t\t\tjstring javaMessage = (jstring)env->CallObjectMethod(connection, getResponseMessageMethod);\n\t\t\terrorMessage = env->GetStringUTFChars(javaMessage, 0);\n\n\t\t\t__android_log_print(ANDROID_LOG_INFO, \"AndroidClient\", \"errorMessage = %s\", errorMessage);\n\t\t\tinput = env->CallObjectMethod(connection, getErrorStreamMethod);\n\n\t\t} else {\n\n\t\t\t__android_log_print(ANDROID_LOG_INFO, \"AndroidClient\", \"http request responsecode = %i\", responseCode);\n\n\t\t\tinput = env->CallObjectMethod(connection, getInputStreamMethod);\n\t\t\tenv->ExceptionClear();\n\t\t}\n\n\t\tjbyteArray array = env->NewByteArray(4096);\n\t\tint g = 0;\n\n\t\tHTTPResponse response;\n\t\t__android_log_print(ANDROID_LOG_VERBOSE, \"Sometrik\", \"Starting to gather content\");\n\n\t\t\/\/Gather content\n\t\twhile ((g = env->CallIntMethod(input, readMethod, array)) != -1) {\n\n\t\t\tjbyte* content_array = env->GetByteArrayElements(array, NULL);\n\t\t\tif (callback) {\n\t\t\t\tcallback->handleChunk(g, (char*) content_array);\n\t\t\t} else {\n\t\t\t\tresponse.appendContent(std::string((char*) content_array, g));\n\t\t\t}\n\t\t\tenv->ReleaseByteArrayElements(array, content_array, JNI_ABORT);\n\t\t}\n\n\t\t\/\/Gather headers and values\n\t\tfor (int i = 0; i < 1000; i++) {\n\t\t\tauto headerKey = env->GetStringUTFChars((jstring) env->CallObjectMethod(connection, getHeaderKeyMethod, i), 0);\n\t\t\t__android_log_print(ANDROID_LOG_INFO, \"content\", \"header key = %s\", headerKey);\n\t\t\tauto header = env->GetStringUTFChars((jstring) env->CallObjectMethod(connection, getHeaderMethodInt, i), 0);\n\t\t\t__android_log_print(ANDROID_LOG_INFO, \"content\", \"header value = %s\", header);\n\t\t\tif (headerKey == NULL) {\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\tresponse.addHeader(headerKey, header);\n\t\t}\n\n\t\tresponse.setResultCode(responseCode);\n\n\t\tif (responseCode >= 300 && responseCode <= 399) {\n\n\t\t\tjstring followURL = (jstring)env->CallObjectMethod(connection, getHeaderMethod, env->NewStringUTF(\"location\"));\n\t\t\tconst char *followString = env->GetStringUTFChars(followURL, 0);\n\t\t\tresponse.setRedirectUrl(followString);\n\t\t\tenv->ReleaseStringUTFChars(followURL, followString);\n\t\t\t__android_log_print(ANDROID_LOG_INFO, \"content\", \"followURL = %s\", followString);\n\n\t\t}\n\n\/\/\t\tresponse.addHeader(\"\", \"\");\n\t\treturn response; \/\/ HTTPResponse(responseCode, errorMessage, followString, content);\n\n }\n\n void clearCookies() {\n\n \tenv->CallVoidMethod(cookieManagerClass, clearCookiesMethod);\n\n }\n\n protected:\n bool initialize() { return true; }\n\n\n private:\n\tbool initDone = false;\n\n JNIEnv * env;\n jclass cookieManagerClass;\n jmethodID clearCookiesMethod;\n\n jclass bitmapClass;\n jclass factoryClass;\n jclass httpClass;\n jclass urlClass;\n jclass bufferedReaderClass;\n jclass inputStreamReaderClass;\n jclass inputStreamClass;\n jmethodID urlConstructor;\n jmethodID openConnectionMethod;\n jmethodID setRequestProperty;\n jmethodID setRequestMethod;\n jmethodID setDoInputMethod;\n jmethodID connectMethod;\n jmethodID getResponseCodeMethod;\n jmethodID getResponseMessageMethod;\n jmethodID setRequestPropertyMethod;\n jmethodID outputStreamConstructor;\n jmethodID factoryDecodeMethod;\n jmethodID getInputStreamMethod;\n jmethodID getErrorStreamMethod;\n jmethodID bufferedReaderConstructor;\n jmethodID inputStreamReaderConstructor;\n jmethodID readLineMethod;\n jmethodID readerCloseMethod;\n jmethodID readMethod;\n jmethodID inputStreamCloseMethod;\n jmethodID setFollowMethod;\n jmethodID getHeaderMethod;\n jmethodID getHeaderMethodInt;\n jmethodID getHeaderKeyMethod;\n\n};\n\nstd::shared_ptr<HTTPClient>\nAndroidClientFactory::createClient(const std::string & _user_agent, bool _enable_cookies, bool _enable_keepalive) {\n return std::make_shared<AndroidClient>(env, _user_agent, _enable_cookies, _enable_keepalive);\n}\n<commit_msg>Get headers from request and add them<commit_after>#include <AndroidClient.h>\n#include <jni.h>\n#include <android\/log.h>\n#include <vector>\n\nclass AndroidClient : public HTTPClient {\n public:\n\n\tAndroidClient(JNIEnv * _env, const std::string & _user_agent, bool _enable_cookies, bool _enable_keepalive)\n : HTTPClient(_user_agent, _enable_cookies, _enable_keepalive), env(_env) {\n\n\n\t\t__android_log_print(ANDROID_LOG_VERBOSE, \"Sometrik\", \"AndroidClient Constructor called\");\n\n\t}\n\n\tvoid androidInit(){\n\n\t\tcookieManagerClass = env->FindClass(\"android\/webkit\/CookieManager\");\n\t\thttpClass = env->FindClass(\"java\/net\/HttpURLConnection\");\n\t\turlClass = env->FindClass(\"java\/net\/URL\");\n\t \tinputStreamClass = env->FindClass(\"java\/io\/InputStream\");\n\n\n\t\tgetHeaderMethod = env->GetMethodID(httpClass, \"getHeaderField\", \"(Ljava\/lang\/String;)Ljava\/lang\/String;\");\n\t\tgetHeaderMethodInt = env->GetMethodID(httpClass, \"getHeaderField\", \"(I)Ljava\/lang\/String;\");\n\t\tgetHeaderKeyMethod = env->GetMethodID(httpClass, \"getHeaderFieldKey\", \"(I)Ljava\/lang\/String;\");\n\t \treadMethod = env->GetMethodID(inputStreamClass, \"read\", \"([B)I\");\n\t \turlConstructor = env->GetMethodID(urlClass, \"<init>\", \"(Ljava\/lang\/String;)V\");\n\t\topenConnectionMethod = env->GetMethodID(urlClass, \"openConnection\", \"()Ljava\/net\/URLConnection;\");\n\t\tsetRequestProperty = env->GetMethodID(httpClass, \"setRequestProperty\", \"(Ljava\/lang\/String;Ljava\/lang\/String;)V\");\n\t\tsetRequestMethod = env->GetMethodID(httpClass, \"setRequestMethod\", \"(Ljava\/lang\/String;)V\");\n\t\tsetFollowMethod = env->GetMethodID(httpClass, \"setInstanceFollowRedirects\", \"(Z)V\");\n\t\tsetDoInputMethod = env->GetMethodID(httpClass, \"setDoInput\", \"(Z)V\");\n\t\tconnectMethod = env->GetMethodID(httpClass, \"connect\", \"()V\");\n\t\tgetResponseCodeMethod = env->GetMethodID(httpClass, \"getResponseCode\", \"()I\");\n\t\tgetResponseMessageMethod = env->GetMethodID(httpClass, \"getResponseMessage\", \"()Ljava\/lang\/String;\");\n\t\tsetRequestPropertyMethod = env->GetMethodID(httpClass, \"setRequestProperty\", \"(Ljava\/lang\/String;Ljava\/lang\/String;)V\");\n\t\tclearCookiesMethod = env->GetMethodID(cookieManagerClass, \"removeAllCookie\", \"()V\");\n\t\tgetInputStreamMethod = env->GetMethodID(httpClass, \"getInputStream\", \"()Ljava\/io\/InputStream;\");\n\t\tgetErrorStreamMethod = env->GetMethodID(httpClass, \"getErrorStream\", \"()Ljava\/io\/InputStream;\");\n\n\t\tinitDone = true;\n\n\t}\n\n HTTPResponse request(const HTTPRequest & req, const Authorization & auth){\n\n\n\t\t__android_log_print(ANDROID_LOG_VERBOSE, \"Sometrik\", \"AndroidClient request called\");\n\n \tif (!initDone){\n \t\tandroidInit();\n \t}\n\n\n \tjobject url = env->NewObject(urlClass, urlConstructor, env->NewStringUTF(req.getURI().c_str()));\n \tjobject connection = env->CallObjectMethod(url, openConnectionMethod);\n\n\n \t\/\/Authorization example\n\t\t\/\/env->CallVoidMethod(connection, setRequestPropertyMethod, env->NewStringUTF(\"Authorization\"), env->NewStringUTF(\"myUsername\"));\n\n\t\t\/\/ std::string auth_header = auth.createHeader();\n\n\t\t\/\/ if (!auth_header.empty()) {\n\t\t\/\/\t\tenv->CallVoidMethod(connection, setRequestPropertyMethod, env->NewStringUTF(auth.getHeaderName()), env->NewStringUTF(auth_header.c_str()));\n\t\t\/\/}\n\n\t\tenv->CallVoidMethod(connection, setFollowMethod, req.getFollowLocation() ? JNI_TRUE : JNI_FALSE);\n\n\n\t\t\/\/Setting headers for request\n\t\tauto headerMap = req.getHeaders();\n\t\tstd::vector<std::string> headerNames;\n\t\tstd::vector<std::string> headerValues;\n\n\t\tfor (std::map<std::string, std::string>::iterator i = headerMap.begin(); i != headerMap.end(); ++i)\n\t\t{\n\t\t\theaderNames.insert(headerNames.end(), i->first.c_str());\n\t\t\theaderValues.insert(headerValues.end(), i->second.c_str());\n\t\t}\n\n\t\tfor (int i = 0; i<headerNames.size(); i++){\n\t\t\t__android_log_print(ANDROID_LOG_INFO, \"httpRequest\", \"Setting header property name = %s\", headerNames[i].c_str());\n\t\t\t__android_log_print(ANDROID_LOG_INFO, \"httpRequest\", \"Setting header property value = %s\", headerValues[i].c_str());\n\t\tenv->CallVoidMethod(connection, setRequestPropertyMethod, env->NewStringUTF(headerNames[i].c_str()), env->NewStringUTF(headerValues[i].c_str()));\n\t\t}\n\n\t\tswitch (req.getType()) {\n\t\tcase HTTPRequest::POST:\n\t\t\tenv->CallVoidMethod(connection, setRequestMethod, env->NewStringUTF(\"POST\"));\n\t\t\tbreak;\n\t\tcase HTTPRequest::GET:\n\t\t\tenv->CallVoidMethod(connection, setRequestMethod, env->NewStringUTF(\"GET\"));\n\t\t\t;\n\t\t\tbreak;\n\t\t}\n\n\t\tint responseCode = env->CallIntMethod(connection, getResponseCodeMethod);\n\n\t\t\/\/Server not found error\n\t\tif (env->ExceptionCheck()) {\n\t\t\tenv->ExceptionClear();\n\t\t\t__android_log_print(ANDROID_LOG_INFO, \"AndroidClient\", \"EXCEPTION http request responsecode = %i\", responseCode);\n\t\t\treturn HTTPResponse(0, \"Server not found\");\n\t\t}\n\n\t\tconst char *errorMessage = \"\";\n\t\tjobject input;\n\n\t\tif (responseCode >= 400 && responseCode <= 599 ){\n\t\t\t__android_log_print(ANDROID_LOG_INFO, \"AndroidClient\", \"request responsecode = %i\", responseCode);\n\n\t\t\tjstring javaMessage = (jstring)env->CallObjectMethod(connection, getResponseMessageMethod);\n\t\t\terrorMessage = env->GetStringUTFChars(javaMessage, 0);\n\n\t\t\t__android_log_print(ANDROID_LOG_INFO, \"AndroidClient\", \"errorMessage = %s\", errorMessage);\n\t\t\tinput = env->CallObjectMethod(connection, getErrorStreamMethod);\n\n\t\t} else {\n\n\t\t\t__android_log_print(ANDROID_LOG_INFO, \"AndroidClient\", \"http request responsecode = %i\", responseCode);\n\n\t\t\tinput = env->CallObjectMethod(connection, getInputStreamMethod);\n\t\t\tenv->ExceptionClear();\n\t\t}\n\n\t\tjbyteArray array = env->NewByteArray(4096);\n\t\tint g = 0;\n\n\t\tHTTPResponse response;\n\t\t__android_log_print(ANDROID_LOG_VERBOSE, \"Sometrik\", \"Starting to gather content\");\n\n\t\t\/\/Gather content\n\t\twhile ((g = env->CallIntMethod(input, readMethod, array)) != -1) {\n\n\t\t\tjbyte* content_array = env->GetByteArrayElements(array, NULL);\n\t\t\tif (callback) {\n\t\t\t\tcallback->handleChunk(g, (char*) content_array);\n\t\t\t} else {\n\t\t\t\tresponse.appendContent(std::string((char*) content_array, g));\n\t\t\t}\n\t\t\tenv->ReleaseByteArrayElements(array, content_array, JNI_ABORT);\n\t\t}\n\n\t\t\/\/Gather headers and values\n\t\tfor (int i = 0; i < 1000; i++) {\n\t\t\tauto headerKey = env->GetStringUTFChars((jstring) env->CallObjectMethod(connection, getHeaderKeyMethod, i), 0);\n\t\t\t__android_log_print(ANDROID_LOG_INFO, \"content\", \"header key = %s\", headerKey);\n\t\t\tauto header = env->GetStringUTFChars((jstring) env->CallObjectMethod(connection, getHeaderMethodInt, i), 0);\n\t\t\t__android_log_print(ANDROID_LOG_INFO, \"content\", \"header value = %s\", header);\n\t\t\tif (headerKey == NULL) {\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\tresponse.addHeader(headerKey, header);\n\t\t}\n\n\t\tresponse.setResultCode(responseCode);\n\n\t\tif (responseCode >= 300 && responseCode <= 399) {\n\n\t\t\tjstring followURL = (jstring)env->CallObjectMethod(connection, getHeaderMethod, env->NewStringUTF(\"location\"));\n\t\t\tconst char *followString = env->GetStringUTFChars(followURL, 0);\n\t\t\tresponse.setRedirectUrl(followString);\n\t\t\tenv->ReleaseStringUTFChars(followURL, followString);\n\t\t\t__android_log_print(ANDROID_LOG_INFO, \"content\", \"followURL = %s\", followString);\n\n\t\t}\n\n\/\/\t\tresponse.addHeader(\"\", \"\");\n\t\treturn response; \/\/ HTTPResponse(responseCode, errorMessage, followString, content);\n\n }\n\n void clearCookies() {\n\n \tenv->CallVoidMethod(cookieManagerClass, clearCookiesMethod);\n\n }\n\n protected:\n bool initialize() { return true; }\n\n\n private:\n\tbool initDone = false;\n\n JNIEnv * env;\n jclass cookieManagerClass;\n jmethodID clearCookiesMethod;\n\n jclass bitmapClass;\n jclass factoryClass;\n jclass httpClass;\n jclass urlClass;\n jclass bufferedReaderClass;\n jclass inputStreamReaderClass;\n jclass inputStreamClass;\n jmethodID urlConstructor;\n jmethodID openConnectionMethod;\n jmethodID setRequestProperty;\n jmethodID setRequestMethod;\n jmethodID setDoInputMethod;\n jmethodID connectMethod;\n jmethodID getResponseCodeMethod;\n jmethodID getResponseMessageMethod;\n jmethodID setRequestPropertyMethod;\n jmethodID outputStreamConstructor;\n jmethodID factoryDecodeMethod;\n jmethodID getInputStreamMethod;\n jmethodID getErrorStreamMethod;\n jmethodID bufferedReaderConstructor;\n jmethodID inputStreamReaderConstructor;\n jmethodID readLineMethod;\n jmethodID readerCloseMethod;\n jmethodID readMethod;\n jmethodID inputStreamCloseMethod;\n jmethodID setFollowMethod;\n jmethodID getHeaderMethod;\n jmethodID getHeaderMethodInt;\n jmethodID getHeaderKeyMethod;\n\n};\n\nstd::shared_ptr<HTTPClient>\nAndroidClientFactory::createClient(const std::string & _user_agent, bool _enable_cookies, bool _enable_keepalive) {\n return std::make_shared<AndroidClient>(env, _user_agent, _enable_cookies, _enable_keepalive);\n}\n<|endoftext|>"} {"text":"<commit_before>\/*\n * Copyright (c) 2016, The Bifrost Authors. All rights reserved.\n * Copyright (c) 2016, NVIDIA CORPORATION. All rights reserved.\n *\n * Redistribution and use in source and binary forms, with or without\n * modification, are permitted provided that the following conditions\n * are met:\n * * Redistributions of source code must retain the above copyright\n * notice, this list of conditions and the following disclaimer.\n * * Redistributions in binary form must reproduce the above copyright\n * notice, this list of conditions and the following disclaimer in the\n * documentation and\/or other materials provided with the distribution.\n * * Neither the name of The Bifrost Authors nor the names of its\n * contributors may be used to endorse or promote products derived\n * from this software without specific prior written permission.\n *\n * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS ``AS IS'' AND ANY\n * EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE\n * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR\n * PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR\n * CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,\n * EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,\n * PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR\n * PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY\n * OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT\n * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE\n * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.\n *\/\n\n#include <bifrost\/unpack.h>\n#include \"utils.hpp\"\n\n\/\/ sign_extend == true => output has same value as input (slower)\n\/\/ sign_extend == false => output is scaled by 2**(8-nbit) (faster)\n\ntemplate<int NBIT, typename K, typename T>\ninline void rshift_subwords(T& val) {\n\tfor( int k=0; k<(int)(sizeof(T)\/sizeof(K)); ++k ) {\n\t\t((K*)&val)[k] >>= NBIT;\n\t}\n}\n\/\/ 2x 4-bit --> 2x 8-bit (unsigned)\ninline void unpack(uint8_t ival,\n uint16_t& oval,\n bool byte_reverse,\n bool align_msb,\n bool conjugate) {\n\t\/\/ Note: Ignores conjugate\n\tif( byte_reverse ) {\n\t\t\/\/ ........ABCDEFGH\n\t\t\/\/ EFGH....ABCD....\n\t\toval = ival;\n\t\toval = (oval | (oval << 12)) & 0xF0F0;\n\t} else {\n\t\t\/\/ ....ABCDEFGH....\n\t\t\/\/ ABCD....EFGH....\n\t\toval = ival << 4;\n\t\toval = (oval | (oval << 4)) & 0xF0F0;\n\t}\n\tif( !align_msb ) {\n\t\t\/\/ >>>>ABCD>>>>EFGH\n\t\toval >>= 4;\n\t}\n}\n\n\/\/ 4x 2-bit --> 4x 8-bit (unsigned)\ninline void unpack(uint8_t ival,\n uint32_t& oval,\n bool byte_reverse,\n bool align_msb,\n bool conjugate) {\n\t\/\/ Note: Ignores conjugate\n\t\/\/ ..................ABCDEFGH......\n\t\/\/ ......ABCD............EFGH......\n\t\/\/ AB......CD......EF......GH......\n\toval = ival << 6;\n\toval = (oval | (oval << 12)) & 0x03C003C0;\n\toval = (oval | (oval << 6)) & 0xC0C0C0C0;\n\tif( byte_reverse) {\n\t\tbyteswap(oval, &oval);\n\t}\n\tif( !align_msb ) {\n\t\t\/\/ >>>>>>AB>>>>>>CD>>>>>>EF>>>>>>GH\n\t\toval >>= 6;\n\t}\n}\n\n\/\/ 8x 1-bit --> 8x 8-bit (unsigned)\ninline void unpack(uint8_t ival,\n uint64_t& oval,\n bool byte_reverse,\n bool align_msb,\n bool conjugate) {\n\t\/\/ Note: Ignores conjugate\n\t\/\/ .................................................ABCDEFGH.......\n\t\/\/ .....................ABCD............................EFGH.......\n\t\/\/ .......AB..............CD..............EF..............GH.......\n\t\/\/ A.......B.......C.......D.......E.......F.......G.......H.......\n\toval = ival << 7;\n\toval = (oval | (oval << 28)) & 0x0000078000000780;\n\toval = (oval | (oval << 14)) & 0x0180018001800180;\n\toval = (oval | (oval << 7)) & 0x8080808080808080;\n\tif( byte_reverse) {\n\t\tbyteswap(oval, &oval);\n\t}\n\tif( !align_msb ) {\n\t\t\/\/ >>>>>>>A>>>>>>>B>>>>>>>C>>>>>>>D\n\t\toval >>= 7;\n\t}\n}\n\ntemplate<typename K, typename T>\ninline void conjugate_subwords(T& val) {\n\tfor( int k=1; k<(int)(sizeof(T)\/sizeof(K)); k+=2 ) {\n\t\tK& val_imag = ((K*)&val)[k];\n\t\tval_imag = -val_imag;\n\t}\n}\n\n\/\/ 2x 4-bit --> 2x 8-bit (signed)\ninline void unpack(uint8_t ival,\n int16_t& oval,\n bool byte_reverse,\n bool align_msb,\n bool conjugate) {\n\tif( byte_reverse ) {\n\t\t\/\/ ........ABCDEFGH\n\t\t\/\/ EFGH....ABCD....\n\t\toval = ival;\n\t\toval = (oval | (oval << 12)) & 0xF0F0;\n\t} else {\n\t\t\/\/ ....ABCDEFGH....\n\t\t\/\/ ABCD....EFGH....\n\t\toval = ival << 4;\n\t\toval = (oval | (oval << 4)) & 0xF0F0;\n\t}\n\tif( !align_msb ) {\n\t\t\/\/ >>>>ABCD>>>>EFGH\n\t\trshift_subwords<4,int8_t>(oval);\n\t}\n\tif( conjugate ) {\n\t\tconjugate_subwords<int8_t>(oval);\n\t}\n}\n\/\/ 4x 2-bit --> 4x 8-bit (signed)\ninline void unpack(uint8_t ival,\n int32_t& oval,\n bool byte_reverse,\n bool align_msb,\n bool conjugate) {\n\t\/\/ ..................ABCDEFGH......\n\t\/\/ ......ABCD............EFGH......\n\t\/\/ AB......CD......EF......GH......\n\toval = ival << 6;\n\toval = (oval | (oval << 12)) & 0x03C003C0;\n\toval = (oval | (oval << 6)) & 0xC0C0C0C0;\n\tif( byte_reverse) {\n\t\tbyteswap(oval, &oval);\n\t}\n\tif( !align_msb ) {\n\t\t\/\/ >>>>>>AB>>>>>>CD>>>>>>EF>>>>>>GH\n\t\trshift_subwords<6,int8_t>(oval);\n\t}\n\tif( conjugate ) {\n\t\tconjugate_subwords<int8_t>(oval);\n\t}\n}\n\/\/ 8x 1-bit --> 8x 8-bit (signed)\ninline void unpack(uint8_t ival,\n int64_t& oval,\n bool byte_reverse,\n bool align_msb,\n bool conjugate) {\n\t\/\/ .................................................ABCDEFGH.......\n\t\/\/ .....................ABCD............................EFGH.......\n\t\/\/ .......AB..............CD..............EF..............GH.......\n\t\/\/ A.......B.......C.......D.......E.......F.......G.......H.......\n\toval = ival << 7;\n\toval = (oval | (oval << 28)) & 0x0000078000000780;\n\toval = (oval | (oval << 14)) & 0x0180018001800180;\n\toval = (oval | (oval << 7)) & 0x8080808080808080;\n\tif( byte_reverse) {\n\t\tbyteswap(oval, &oval);\n\t}\n\tif( !align_msb ) {\n\t\t\/\/ >>>>>>>A>>>>>>>B>>>>>>>C>>>>>>>D\n\t\trshift_subwords<7,int8_t>(oval);\n\t}\n\tif( conjugate ) {\n\t\tconjugate_subwords<int8_t>(oval);\n\t}\n}\n\ntemplate<typename IType, typename OType>\nstruct UnpackFunctor {\n\tbool byte_reverse;\n\tbool align_msb;\n\tbool conjugate;\n\tUnpackFunctor(bool byte_reverse_,\n\t bool align_msb_,\n\t bool conjugate_)\n\t\t: byte_reverse(byte_reverse_),\n\t\t align_msb(align_msb_),\n\t\t conjugate(conjugate_) {}\n\tvoid operator()(IType ival, OType& oval) const {\n\t\tunpack(ival, oval, byte_reverse, align_msb, conjugate);\n\t}\n};\n\ntemplate<typename T, typename U, typename Func, typename Size>\nvoid foreach_simple_cpu(T const* in,\n U* out,\n Size nelement,\n Func func) {\n\tfor( Size i=0; i<nelement; ++i ) {\n\t\tfunc(in[i], out[i]);\n\t\t\/\/std::cout << std::hex << (int)in[i] << \" --> \" << (int)out[i] << std::endl;\n\t}\n}\n\nBFstatus bfUnpack(BFarray const* in,\n BFarray const* out,\n BFbool align_msb) {\n\tBF_ASSERT(in, BF_STATUS_INVALID_POINTER);\n\tBF_ASSERT(out, BF_STATUS_INVALID_POINTER);\n\tBF_ASSERT(!out->immutable, BF_STATUS_INVALID_POINTER);\n\tBF_ASSERT(shapes_equal(in, out), BF_STATUS_INVALID_SHAPE);\n\tBF_ASSERT(BF_DTYPE_IS_COMPLEX( in->dtype) ==\n\t BF_DTYPE_IS_COMPLEX(out->dtype),\n\t BF_STATUS_INVALID_DTYPE);\n\tBF_ASSERT(BF_DTYPE_IS_COMPLEX(in->dtype) || !in->conjugated,\n\t BF_STATUS_INVALID_DTYPE);\n\tBF_ASSERT(BF_DTYPE_IS_COMPLEX(out->dtype) || !in->conjugated,\n\t BF_STATUS_INVALID_DTYPE);\n\t\n\t\/\/ **TODO: This does not correctly interpret strides when itemsize_nbit < 8\n\t\/\/ Need to work out how to handle strides when itemsize_bits < 8\n\t\/\/ Perhaps some way of specifying packed contiguous inner dims\n\t\/\/ Whatever solution is chosen will need to be integrated into\n\t\/\/ bf.ndarray and bf.DataType.\n\t\n\t\/\/ TODO: Support padded arrays\n\tBF_ASSERT(is_contiguous(in), BF_STATUS_UNSUPPORTED_STRIDE);\n\tBF_ASSERT(is_contiguous(out), BF_STATUS_UNSUPPORTED_STRIDE);\n\t\n\t\/\/ TODO: Support CUDA space\n\tBF_ASSERT(space_accessible_from(in->space, BF_SPACE_SYSTEM),\n\t BF_STATUS_UNSUPPORTED_SPACE);\n\tBF_ASSERT(space_accessible_from(out->space, BF_SPACE_SYSTEM),\n\t BF_STATUS_UNSUPPORTED_SPACE);\n\t\n\tsize_t nelement = num_contiguous_elements(in);\n\tbool byteswap = ( in->big_endian != is_big_endian());\n\tbool conjugate = (in->conjugated != out->conjugated);\n\t\n#define CALL_FOREACH_SIMPLE_CPU_UNPACK(itype,otype) \\\n\tforeach_simple_cpu((itype*)in->data, \\\n\t (otype*)out->data, \\\n\t nelement, \\\n\t UnpackFunctor<itype,otype>(byteswap, \\\n\t align_msb, \\\n\t conjugate))\n\tif( out->dtype == BF_DTYPE_I8 ||\n\t out->dtype == BF_DTYPE_CI8 ) {\n\t\/\/case BF_DTYPE_I8: {\n\t\tswitch( in->dtype ) {\n\t\t\/\/ TODO: Work out how to properly deal with 1-bit\n\t\t\/\/case BF_DTYPE_CI1: nelement *= 2;\n\t\t\/\/case BF_DTYPE_I1: {\n\t\t\/\/\tBF_ASSERT(nelement % 8 == 0, BF_STATUS_INVALID_SHAPE);\n\t\t\/\/\tnelement \/= 8;\n\t\t\/\/\tCALL_FOREACH_SIMPLE_CPU_UNPACK(uint8_t,int64_t); break;\n\t\t\/\/}\n\t\tcase BF_DTYPE_CI2: nelement *= 2;\n\t\tcase BF_DTYPE_I2: {\n\t\t\tBF_ASSERT(nelement % 4 == 0, BF_STATUS_INVALID_SHAPE);\n\t\t\tnelement \/= 4;\n\t\t\tCALL_FOREACH_SIMPLE_CPU_UNPACK(uint8_t,int32_t);\n\t\t\tbreak;\n\t\t}\n\t\tcase BF_DTYPE_CI4: nelement *= 2;\n\t\tcase BF_DTYPE_I4: {\n\t\t\tBF_ASSERT(nelement % 2 == 0, BF_STATUS_INVALID_SHAPE);\n\t\t\tnelement \/= 2;\n\t\t\tCALL_FOREACH_SIMPLE_CPU_UNPACK(uint8_t,int16_t);\n\t\t\tbreak;\n\t\t}\n\t\t\/\/case BF_DTYPE_U1: {\n\t\t\/\/\t\/\/ TODO\n\t\t\/\/}\n\t\tcase BF_DTYPE_U2: {\n\t\t\tBF_ASSERT(nelement % 4 == 0, BF_STATUS_INVALID_SHAPE);\n\t\t\tnelement \/= 4;\n\t\t\tCALL_FOREACH_SIMPLE_CPU_UNPACK(uint8_t,uint32_t);\n\t\t\tbreak;\n\t\t}\n\t\tcase BF_DTYPE_U4: {\n\t\t\tBF_ASSERT(nelement % 2 == 0, BF_STATUS_INVALID_SHAPE);\n\t\t\tnelement \/= 2;\n\t\t\tCALL_FOREACH_SIMPLE_CPU_UNPACK(uint8_t,uint16_t);\n\t\t\tbreak;\n\t\t}\n\t\tdefault: BF_FAIL(\"Supported bfQuantize input dtype\", BF_STATUS_UNSUPPORTED_DTYPE);\n\t\t}\n\t} else {\n\t\tBF_FAIL(\"Supported bfQuantize output dtype\", BF_STATUS_UNSUPPORTED_DTYPE);\n\t}\n#undef CALL_FOREACH_SIMPLE_CPU_UNPACK\n\treturn BF_STATUS_SUCCESS;\n}\n<commit_msg>Fix error message typos in unpack.cpp<commit_after>\/*\n * Copyright (c) 2016, The Bifrost Authors. All rights reserved.\n * Copyright (c) 2016, NVIDIA CORPORATION. All rights reserved.\n *\n * Redistribution and use in source and binary forms, with or without\n * modification, are permitted provided that the following conditions\n * are met:\n * * Redistributions of source code must retain the above copyright\n * notice, this list of conditions and the following disclaimer.\n * * Redistributions in binary form must reproduce the above copyright\n * notice, this list of conditions and the following disclaimer in the\n * documentation and\/or other materials provided with the distribution.\n * * Neither the name of The Bifrost Authors nor the names of its\n * contributors may be used to endorse or promote products derived\n * from this software without specific prior written permission.\n *\n * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS ``AS IS'' AND ANY\n * EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE\n * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR\n * PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR\n * CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,\n * EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,\n * PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR\n * PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY\n * OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT\n * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE\n * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.\n *\/\n\n#include <bifrost\/unpack.h>\n#include \"utils.hpp\"\n\n\/\/ sign_extend == true => output has same value as input (slower)\n\/\/ sign_extend == false => output is scaled by 2**(8-nbit) (faster)\n\ntemplate<int NBIT, typename K, typename T>\ninline void rshift_subwords(T& val) {\n\tfor( int k=0; k<(int)(sizeof(T)\/sizeof(K)); ++k ) {\n\t\t((K*)&val)[k] >>= NBIT;\n\t}\n}\n\/\/ 2x 4-bit --> 2x 8-bit (unsigned)\ninline void unpack(uint8_t ival,\n uint16_t& oval,\n bool byte_reverse,\n bool align_msb,\n bool conjugate) {\n\t\/\/ Note: Ignores conjugate\n\tif( byte_reverse ) {\n\t\t\/\/ ........ABCDEFGH\n\t\t\/\/ EFGH....ABCD....\n\t\toval = ival;\n\t\toval = (oval | (oval << 12)) & 0xF0F0;\n\t} else {\n\t\t\/\/ ....ABCDEFGH....\n\t\t\/\/ ABCD....EFGH....\n\t\toval = ival << 4;\n\t\toval = (oval | (oval << 4)) & 0xF0F0;\n\t}\n\tif( !align_msb ) {\n\t\t\/\/ >>>>ABCD>>>>EFGH\n\t\toval >>= 4;\n\t}\n}\n\n\/\/ 4x 2-bit --> 4x 8-bit (unsigned)\ninline void unpack(uint8_t ival,\n uint32_t& oval,\n bool byte_reverse,\n bool align_msb,\n bool conjugate) {\n\t\/\/ Note: Ignores conjugate\n\t\/\/ ..................ABCDEFGH......\n\t\/\/ ......ABCD............EFGH......\n\t\/\/ AB......CD......EF......GH......\n\toval = ival << 6;\n\toval = (oval | (oval << 12)) & 0x03C003C0;\n\toval = (oval | (oval << 6)) & 0xC0C0C0C0;\n\tif( byte_reverse) {\n\t\tbyteswap(oval, &oval);\n\t}\n\tif( !align_msb ) {\n\t\t\/\/ >>>>>>AB>>>>>>CD>>>>>>EF>>>>>>GH\n\t\toval >>= 6;\n\t}\n}\n\n\/\/ 8x 1-bit --> 8x 8-bit (unsigned)\ninline void unpack(uint8_t ival,\n uint64_t& oval,\n bool byte_reverse,\n bool align_msb,\n bool conjugate) {\n\t\/\/ Note: Ignores conjugate\n\t\/\/ .................................................ABCDEFGH.......\n\t\/\/ .....................ABCD............................EFGH.......\n\t\/\/ .......AB..............CD..............EF..............GH.......\n\t\/\/ A.......B.......C.......D.......E.......F.......G.......H.......\n\toval = ival << 7;\n\toval = (oval | (oval << 28)) & 0x0000078000000780;\n\toval = (oval | (oval << 14)) & 0x0180018001800180;\n\toval = (oval | (oval << 7)) & 0x8080808080808080;\n\tif( byte_reverse) {\n\t\tbyteswap(oval, &oval);\n\t}\n\tif( !align_msb ) {\n\t\t\/\/ >>>>>>>A>>>>>>>B>>>>>>>C>>>>>>>D\n\t\toval >>= 7;\n\t}\n}\n\ntemplate<typename K, typename T>\ninline void conjugate_subwords(T& val) {\n\tfor( int k=1; k<(int)(sizeof(T)\/sizeof(K)); k+=2 ) {\n\t\tK& val_imag = ((K*)&val)[k];\n\t\tval_imag = -val_imag;\n\t}\n}\n\n\/\/ 2x 4-bit --> 2x 8-bit (signed)\ninline void unpack(uint8_t ival,\n int16_t& oval,\n bool byte_reverse,\n bool align_msb,\n bool conjugate) {\n\tif( byte_reverse ) {\n\t\t\/\/ ........ABCDEFGH\n\t\t\/\/ EFGH....ABCD....\n\t\toval = ival;\n\t\toval = (oval | (oval << 12)) & 0xF0F0;\n\t} else {\n\t\t\/\/ ....ABCDEFGH....\n\t\t\/\/ ABCD....EFGH....\n\t\toval = ival << 4;\n\t\toval = (oval | (oval << 4)) & 0xF0F0;\n\t}\n\tif( !align_msb ) {\n\t\t\/\/ >>>>ABCD>>>>EFGH\n\t\trshift_subwords<4,int8_t>(oval);\n\t}\n\tif( conjugate ) {\n\t\tconjugate_subwords<int8_t>(oval);\n\t}\n}\n\/\/ 4x 2-bit --> 4x 8-bit (signed)\ninline void unpack(uint8_t ival,\n int32_t& oval,\n bool byte_reverse,\n bool align_msb,\n bool conjugate) {\n\t\/\/ ..................ABCDEFGH......\n\t\/\/ ......ABCD............EFGH......\n\t\/\/ AB......CD......EF......GH......\n\toval = ival << 6;\n\toval = (oval | (oval << 12)) & 0x03C003C0;\n\toval = (oval | (oval << 6)) & 0xC0C0C0C0;\n\tif( byte_reverse) {\n\t\tbyteswap(oval, &oval);\n\t}\n\tif( !align_msb ) {\n\t\t\/\/ >>>>>>AB>>>>>>CD>>>>>>EF>>>>>>GH\n\t\trshift_subwords<6,int8_t>(oval);\n\t}\n\tif( conjugate ) {\n\t\tconjugate_subwords<int8_t>(oval);\n\t}\n}\n\/\/ 8x 1-bit --> 8x 8-bit (signed)\ninline void unpack(uint8_t ival,\n int64_t& oval,\n bool byte_reverse,\n bool align_msb,\n bool conjugate) {\n\t\/\/ .................................................ABCDEFGH.......\n\t\/\/ .....................ABCD............................EFGH.......\n\t\/\/ .......AB..............CD..............EF..............GH.......\n\t\/\/ A.......B.......C.......D.......E.......F.......G.......H.......\n\toval = ival << 7;\n\toval = (oval | (oval << 28)) & 0x0000078000000780;\n\toval = (oval | (oval << 14)) & 0x0180018001800180;\n\toval = (oval | (oval << 7)) & 0x8080808080808080;\n\tif( byte_reverse) {\n\t\tbyteswap(oval, &oval);\n\t}\n\tif( !align_msb ) {\n\t\t\/\/ >>>>>>>A>>>>>>>B>>>>>>>C>>>>>>>D\n\t\trshift_subwords<7,int8_t>(oval);\n\t}\n\tif( conjugate ) {\n\t\tconjugate_subwords<int8_t>(oval);\n\t}\n}\n\ntemplate<typename IType, typename OType>\nstruct UnpackFunctor {\n\tbool byte_reverse;\n\tbool align_msb;\n\tbool conjugate;\n\tUnpackFunctor(bool byte_reverse_,\n\t bool align_msb_,\n\t bool conjugate_)\n\t\t: byte_reverse(byte_reverse_),\n\t\t align_msb(align_msb_),\n\t\t conjugate(conjugate_) {}\n\tvoid operator()(IType ival, OType& oval) const {\n\t\tunpack(ival, oval, byte_reverse, align_msb, conjugate);\n\t}\n};\n\ntemplate<typename T, typename U, typename Func, typename Size>\nvoid foreach_simple_cpu(T const* in,\n U* out,\n Size nelement,\n Func func) {\n\tfor( Size i=0; i<nelement; ++i ) {\n\t\tfunc(in[i], out[i]);\n\t\t\/\/std::cout << std::hex << (int)in[i] << \" --> \" << (int)out[i] << std::endl;\n\t}\n}\n\nBFstatus bfUnpack(BFarray const* in,\n BFarray const* out,\n BFbool align_msb) {\n\tBF_ASSERT(in, BF_STATUS_INVALID_POINTER);\n\tBF_ASSERT(out, BF_STATUS_INVALID_POINTER);\n\tBF_ASSERT(!out->immutable, BF_STATUS_INVALID_POINTER);\n\tBF_ASSERT(shapes_equal(in, out), BF_STATUS_INVALID_SHAPE);\n\tBF_ASSERT(BF_DTYPE_IS_COMPLEX( in->dtype) ==\n\t BF_DTYPE_IS_COMPLEX(out->dtype),\n\t BF_STATUS_INVALID_DTYPE);\n\tBF_ASSERT(BF_DTYPE_IS_COMPLEX(in->dtype) || !in->conjugated,\n\t BF_STATUS_INVALID_DTYPE);\n\tBF_ASSERT(BF_DTYPE_IS_COMPLEX(out->dtype) || !in->conjugated,\n\t BF_STATUS_INVALID_DTYPE);\n\t\n\t\/\/ **TODO: This does not correctly interpret strides when itemsize_nbit < 8\n\t\/\/ Need to work out how to handle strides when itemsize_bits < 8\n\t\/\/ Perhaps some way of specifying packed contiguous inner dims\n\t\/\/ Whatever solution is chosen will need to be integrated into\n\t\/\/ bf.ndarray and bf.DataType.\n\t\n\t\/\/ TODO: Support padded arrays\n\tBF_ASSERT(is_contiguous(in), BF_STATUS_UNSUPPORTED_STRIDE);\n\tBF_ASSERT(is_contiguous(out), BF_STATUS_UNSUPPORTED_STRIDE);\n\t\n\t\/\/ TODO: Support CUDA space\n\tBF_ASSERT(space_accessible_from(in->space, BF_SPACE_SYSTEM),\n\t BF_STATUS_UNSUPPORTED_SPACE);\n\tBF_ASSERT(space_accessible_from(out->space, BF_SPACE_SYSTEM),\n\t BF_STATUS_UNSUPPORTED_SPACE);\n\t\n\tsize_t nelement = num_contiguous_elements(in);\n\tbool byteswap = ( in->big_endian != is_big_endian());\n\tbool conjugate = (in->conjugated != out->conjugated);\n\t\n#define CALL_FOREACH_SIMPLE_CPU_UNPACK(itype,otype) \\\n\tforeach_simple_cpu((itype*)in->data, \\\n\t (otype*)out->data, \\\n\t nelement, \\\n\t UnpackFunctor<itype,otype>(byteswap, \\\n\t align_msb, \\\n\t conjugate))\n\tif( out->dtype == BF_DTYPE_I8 ||\n\t out->dtype == BF_DTYPE_CI8 ) {\n\t\/\/case BF_DTYPE_I8: {\n\t\tswitch( in->dtype ) {\n\t\t\/\/ TODO: Work out how to properly deal with 1-bit\n\t\t\/\/case BF_DTYPE_CI1: nelement *= 2;\n\t\t\/\/case BF_DTYPE_I1: {\n\t\t\/\/\tBF_ASSERT(nelement % 8 == 0, BF_STATUS_INVALID_SHAPE);\n\t\t\/\/\tnelement \/= 8;\n\t\t\/\/\tCALL_FOREACH_SIMPLE_CPU_UNPACK(uint8_t,int64_t); break;\n\t\t\/\/}\n\t\tcase BF_DTYPE_CI2: nelement *= 2;\n\t\tcase BF_DTYPE_I2: {\n\t\t\tBF_ASSERT(nelement % 4 == 0, BF_STATUS_INVALID_SHAPE);\n\t\t\tnelement \/= 4;\n\t\t\tCALL_FOREACH_SIMPLE_CPU_UNPACK(uint8_t,int32_t);\n\t\t\tbreak;\n\t\t}\n\t\tcase BF_DTYPE_CI4: nelement *= 2;\n\t\tcase BF_DTYPE_I4: {\n\t\t\tBF_ASSERT(nelement % 2 == 0, BF_STATUS_INVALID_SHAPE);\n\t\t\tnelement \/= 2;\n\t\t\tCALL_FOREACH_SIMPLE_CPU_UNPACK(uint8_t,int16_t);\n\t\t\tbreak;\n\t\t}\n\t\t\/\/case BF_DTYPE_U1: {\n\t\t\/\/\t\/\/ TODO\n\t\t\/\/}\n\t\tcase BF_DTYPE_U2: {\n\t\t\tBF_ASSERT(nelement % 4 == 0, BF_STATUS_INVALID_SHAPE);\n\t\t\tnelement \/= 4;\n\t\t\tCALL_FOREACH_SIMPLE_CPU_UNPACK(uint8_t,uint32_t);\n\t\t\tbreak;\n\t\t}\n\t\tcase BF_DTYPE_U4: {\n\t\t\tBF_ASSERT(nelement % 2 == 0, BF_STATUS_INVALID_SHAPE);\n\t\t\tnelement \/= 2;\n\t\t\tCALL_FOREACH_SIMPLE_CPU_UNPACK(uint8_t,uint16_t);\n\t\t\tbreak;\n\t\t}\n\t\tdefault: BF_FAIL(\"Supported bfUnpack input dtype\", BF_STATUS_UNSUPPORTED_DTYPE);\n\t\t}\n\t} else {\n\t\tBF_FAIL(\"Supported bfUnpack output dtype\", BF_STATUS_UNSUPPORTED_DTYPE);\n\t}\n#undef CALL_FOREACH_SIMPLE_CPU_UNPACK\n\treturn BF_STATUS_SUCCESS;\n}\n<|endoftext|>"} {"text":"<commit_before>\/*\n * Copyright (C) 2017 Joyent Inc.\n * All rights reserved.\n *\n * Written by: Matthew Macy <matt.macy@joyent.com>\n *\n * Redistribution and use in source and binary forms, with or without\n * modification, are permitted provided that the following conditions\n * are met:\n * 1. Redistributions of source code must retain the above copyright\n * notice, this list of conditions and the following disclaimer.\n * 2. Redistributions in binary form must reproduce the above copyright\n * notice, this list of conditions and the following disclaimer in the\n * documentation and\/or other materials provided with the distribution.\n *\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 <sys\/types.h>\n#include <stdio.h>\n\n#include <net\/ethernet.h>\n#define NETMAP_WITH_LIBS\n#include <net\/netmap_user.h>\n#include <sys\/poll.h>\n\n#include \"uvxbridge.h\"\n#include \"uvxlan.h\"\n\n#define AE_REQUEST\t\t0x0100040600080100UL\n#define AE_REPLY\t\t0x0200040600080100UL\n#define AE_REVREQUEST\t\t0x0300040600080100UL\n#define AE_REVREPLY\t\t0x0400040600080100UL\n\n#define AE_REQUEST_ALL\t\t0x0A00040600080100UL\n#define AE_REVREQUEST_ALL\t0x0B00040600080100UL\n#define AE_VM_VXLANID_REQUEST\t0x0C00040600080100UL\n#define AE_VM_VXLANID_REQUEST_ALL\t0x0D00040600080100UL\n#define AE_VM_VXLANID_REPLY\t0x0E00040600080100UL\n#define AE_VM_VLANID_REQUEST\t0x0F00040600080100UL\n#define AE_VM_VLANID_REQUEST_ALL\t0x1000040600080100UL\n#define AE_VM_VLANID_REPLY\t0x1100040600080100UL\n\n\n#define A(val) printf(\"got %s\\n\", #val)\nextern int debug;\n\nint\ncmd_dispatch_arp(char *rxbuf, char *txbuf, path_state_t *ps, vxstate_t *state)\n{\n\tstruct arphdr_ether *sah, *dah;\n\tstruct ether_header *eh;\n\tint op, len;\n\tuint32_t hostip, targetval = 0;\n\tuint16_t *rmacp, *lmacp;\n\tuint64_t reply = 0;\n\n\tlen = ps->ps_rx_len;\n\tif (len < ETHER_HDR_LEN + sizeof(struct arphdr_ether) && debug < 2)\n\t\treturn 0;\n\n\tsah = (struct arphdr_ether *)(rxbuf + ETHER_HDR_LEN);\n\tdah = (struct arphdr_ether *)(txbuf + ETHER_HDR_LEN);\n\top = ntohs(sah->ae_hdr.fields.ar_op);\n\t\/* place holder *\/\n\thostip = htobe32(0xDEADBEEF);\n\n\tswitch (op) {\n\t\tcase ARPOP_REQUEST:\n\t\t\tA(ARPOP_REQUEST);\n\t\t\treply = AE_REPLY;\n\t\t\tbreak;\n\t\tcase ARPOP_REPLY:\n\t\t\tA(ARPOP_REPLY);\n\t\t\tbreak;\n\t\tcase ARPOP_REVREQUEST:\n\t\t\tA(ARPOP_REVREQUEST);\n\t\t\treply = AE_REVREPLY;\n\t\t\tbreak;\n\t\tcase ARPOP_REVREPLY:\n\t\t\tA(ARPOP_REVREPLY);\n\t\t\tbreak;\n\t\tcase ARPOP_REQUEST_ALL:\n\t\t\tA(ARPOP_REQUEST_ALL);\n\t\t\tbreak;\n\t\tcase ARPOP_REVREQUEST_ALL:\n\t\t\tA(ARPOP_REVREQUEST_ALL);\n\t\t\tbreak;\n\t\tcase ARPOP_VM_VXLANID_REQUEST:\n\t\t\tA(ARPOP_VM_VXLANID_REQUEST);\n\t\t\treply = AE_VM_VXLANID_REPLY;\n\t\t\tbreak;\n\t\tcase ARPOP_VM_VXLANID_REQUEST_ALL:\n\t\t\tA(ARPOP_VM_VXLANID_REQUEST_ALL);\n\t\t\tbreak;\n\t\tcase ARPOP_VM_VXLANID_REPLY:\n\t\t\tA(ARPOP_VM_VXLANID_REPLY);\n\t\t\tbreak;\n\t\tcase ARPOP_VM_VLANID_REQUEST:\n\t\t\tA(ARPOP_VM_VLANID_REQUEST);\n\t\t\treply = AE_VM_VLANID_REPLY;\n\t\t\tbreak;\n\t\tcase ARPOP_VM_VLANID_REQUEST_ALL:\n\t\t\tA(ARPOP_VM_VLANID_REQUEST);\n\t\t\tbreak;\n\t\tcase ARPOP_VM_VLANID_REPLY:\n\t\t\tA(ARPOP_VM_VLANID_REPLY);\n\t\t\tbreak;\n\t\tdefault:\n\t\t\tprintf(\"unrecognized value data: 0x%016lX op: 0x%02X\\n\", sah->ae_hdr.data, op);\n\t}\n\t\/* save potential cache stall to the end *\/\n\tif (reply) {\n\t\teh = (struct ether_header *)txbuf;\n\t\tlmacp = (uint16_t *)&eh->ether_dhost;\n\t\trmacp = (uint16_t *)&state->vs_prov_mac;\n\t\tlmacp[0] = rmacp[0];\n\t\tlmacp[1] = rmacp[1];\n\t\tlmacp[2] = rmacp[2];\n\t\trmacp = (uint16_t *)&state->vs_ctrl_mac;\n\t\tlmacp[3] = rmacp[0];\n\t\tlmacp[4] = rmacp[1];\n\t\tlmacp[5] = rmacp[2];\n\t\t\/* [6] *\/\n\t\teh->ether_type = ETHERTYPE_ARP;\n\t\t\/* [7-10] *\/\n\t\tdah->ae_hdr.data = reply;\n\t\t\/* [11-13] - ar_sha *\/\n\t\tlmacp[11] = rmacp[0];\n\t\tlmacp[12] = rmacp[1];\n\t\tlmacp[13] = rmacp[2];\n\t\t\/* [14-15] - ae_spa *\/\n\t\tdah->ae_spa = hostip;\n\t\trmacp = (uint16_t *)&state->vs_prov_mac;\n\t\t\/* [16-18] - ae_tha *\/\n\t\tlmacp[16] = rmacp[0];\n\t\tlmacp[17] = rmacp[1];\n\t\tlmacp[18] = rmacp[2];\n\t\t\/* actual value of interest *\/\n\t\tdah->ae_tpa = targetval;\n\t\treturn (1);\n\t}\n\treturn (0);\n}\n\n\/*\n * If rxbuf contains a neighbor discovery request return true.\n * If it's an nd request we can handle, enqueue a response.\n *\n * dir = EGRESS => VX, dir = INGRESS => PHYS\n *\/\nbool\nnd_request(struct arphdr_ether *sae, arphdr_ether *dae, vxstate_t &state, l2tbl_t &tbl)\n{\n#if 0\n\/\/ XXX we assume prepopulated ARP table so ignore replies\n\/\/\tif (ae->ae_req != arpopreq && ae->ae_req != arpopreply)\n\tif (sae->ae_req != arpopreq)\n\t\treturn false;\n\n\tdae->ae_req = arpopreply;\n#endif\n\tabort();\n\treturn true;\n}\n\n\/*\n * If valid, deencapsulate rxbuf in to txbuf\n *\n *\/\nbool\nvxlan_decap(char *rxbuf, char *txbuf, int len, vxstate_t &state __unused)\n{\n\n\tnm_pkt_copy(rxbuf, txbuf, len);\n\treturn true;\n}\n\n\/*\n * If valid, encapsulate rxbuf in to txbuf\n *\n *\/\nbool\nvxlan_encap(char *rxbuf, char *txbuf, int len, vxstate_t &state __unused)\n{\n\tstruct ether_vlan_header *evh, *evhrsp;\n\tint hdrlen, etype;\n\n\tevh = (struct ether_vlan_header *)(rxbuf);\n\tif (evh->evl_encap_proto == htons(ETHERTYPE_VLAN)) {\n\t\thdrlen = ETHER_HDR_LEN + ETHER_VLAN_ENCAP_LEN;\n\t\tetype = ntohs(evh->evl_proto);\n\t} else {\n\t\thdrlen = ETHER_HDR_LEN;\n\t\tetype = ntohs(evh->evl_encap_proto);\n\t}\n\tif (etype != ETHERTYPE_IP && etype != ETHERTYPE_IPV6)\n\t\treturn false;\n\t\/* first map evh->evl_shost -> vxlanid \/ vlanid *\/\n\t\/* ..... *\/\n\t\/* next map evh->evl_dhost -> remote ip addr in the corresponding forwarding table *\/\n\t\/* ..... *\/\n\t\/* next check if remote ip is on our local subnet *\/\n\t\/* .... *\/\n\t\/* if yes - lookup MAC address for peer *\/\n\t\/* .... *\/\n\t\/* if no - lookup MAC address for corresponding router *\/\n\t\/* .... *\/\n\t\/* use source IP for said subnet *\/\n\t\/* calculate source port *\/\n\t\/* .... *\/\n\n\tevhrsp = (struct ether_vlan_header *)(txbuf);\n nm_pkt_copy(rxbuf, txbuf, len);\n return true;\n}\n<commit_msg>implement ARP request \/ reply<commit_after>\/*\n * Copyright (C) 2017 Joyent Inc.\n * All rights reserved.\n *\n * Written by: Matthew Macy <matt.macy@joyent.com>\n *\n * Redistribution and use in source and binary forms, with or without\n * modification, are permitted provided that the following conditions\n * are met:\n * 1. Redistributions of source code must retain the above copyright\n * notice, this list of conditions and the following disclaimer.\n * 2. Redistributions in binary form must reproduce the above copyright\n * notice, this list of conditions and the following disclaimer in the\n * documentation and\/or other materials provided with the distribution.\n *\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 <sys\/types.h>\n#include <stdio.h>\n\n#include <net\/ethernet.h>\n#define NETMAP_WITH_LIBS\n#include <net\/netmap_user.h>\n#include <sys\/poll.h>\n\n#include \"uvxbridge.h\"\n#include \"uvxlan.h\"\n\n#define AE_REQUEST\t\t0x0100040600080100UL\n#define AE_REPLY\t\t0x0200040600080100UL\n#define AE_REVREQUEST\t\t0x0300040600080100UL\n#define AE_REVREPLY\t\t0x0400040600080100UL\n\n#define AE_REQUEST_ALL\t\t0x0A00040600080100UL\n#define AE_REVREQUEST_ALL\t0x0B00040600080100UL\n#define AE_VM_VXLANID_REQUEST\t0x0C00040600080100UL\n#define AE_VM_VXLANID_REQUEST_ALL\t0x0D00040600080100UL\n#define AE_VM_VXLANID_REPLY\t0x0E00040600080100UL\n#define AE_VM_VLANID_REQUEST\t0x0F00040600080100UL\n#define AE_VM_VLANID_REQUEST_ALL\t0x1000040600080100UL\n#define AE_VM_VLANID_REPLY\t0x1100040600080100UL\n\n\n#define A(val) printf(\"got %s\\n\", #val)\nextern int debug;\n\nint\ncmd_dispatch_arp(char *rxbuf, char *txbuf, path_state_t *ps, vxstate_t *state)\n{\n\tstruct arphdr_ether *sah, *dah;\n\tstruct ether_header *eh;\n\tint op, len;\n\tuint32_t hostip, targetpa = 0;\n\tuint16_t *rmacp, *lmacp;\n\tuint64_t targetha = 0, reply = 0;\n\tl2tbl_t &tbl = state->vs_l2_phys;\n\n\tlen = ps->ps_rx_len;\n\tif (len < ETHER_HDR_LEN + sizeof(struct arphdr_ether) && debug < 2)\n\t\treturn 0;\n\n\tsah = (struct arphdr_ether *)(rxbuf + ETHER_HDR_LEN);\n\tdah = (struct arphdr_ether *)(txbuf + ETHER_HDR_LEN);\n\top = ntohs(sah->ae_hdr.fields.ar_op);\n\t\/* place holder *\/\n\thostip = htobe32(0xDEADBEEF);\n\n\tswitch (op) {\n\t\tcase ARPOP_REQUEST: {\n\t\t\tA(ARPOP_REQUEST);\n\t\t\tauto it = tbl.l2t_v4.find(sah->ae_tpa);\n\t\t\tif (it != tbl.l2t_v4.end()) {\n\t\t\t\treply = AE_REPLY;\n\t\t\t\ttargetpa = sah->ae_tpa;\n\t\t\t\ttargetha = it->second;\n\t\t\t}\n\t\t\tbreak;\n\t\t}\n\t\tcase ARPOP_REPLY:\n\t\t\tA(ARPOP_REPLY);\n\t\t\tmemcpy(&targetha, sah->ae_tha, ETHER_ADDR_LEN);\n\t\t\ttbl.l2t_v4.insert(pair<uint32_t, uint64_t>(sah->ae_tpa, targetha));\n\t\t\tbreak;\n\t\tcase ARPOP_REVREQUEST:\n\t\t\tA(ARPOP_REVREQUEST);\n\t\t\treply = AE_REVREPLY;\n\t\t\tbreak;\n\t\tcase ARPOP_REVREPLY:\n\t\t\tA(ARPOP_REVREPLY);\n\t\t\tbreak;\n\t\tcase ARPOP_REQUEST_ALL:\n\t\t\tA(ARPOP_REQUEST_ALL);\n\t\t\tbreak;\n\t\tcase ARPOP_REVREQUEST_ALL:\n\t\t\tA(ARPOP_REVREQUEST_ALL);\n\t\t\tbreak;\n\t\tcase ARPOP_VM_VXLANID_REQUEST:\n\t\t\tA(ARPOP_VM_VXLANID_REQUEST);\n\t\t\treply = AE_VM_VXLANID_REPLY;\n\t\t\tbreak;\n\t\tcase ARPOP_VM_VXLANID_REQUEST_ALL:\n\t\t\tA(ARPOP_VM_VXLANID_REQUEST_ALL);\n\t\t\tbreak;\n\t\tcase ARPOP_VM_VXLANID_REPLY:\n\t\t\tA(ARPOP_VM_VXLANID_REPLY);\n\t\t\tbreak;\n\t\tcase ARPOP_VM_VLANID_REQUEST:\n\t\t\tA(ARPOP_VM_VLANID_REQUEST);\n\t\t\treply = AE_VM_VLANID_REPLY;\n\t\t\tbreak;\n\t\tcase ARPOP_VM_VLANID_REQUEST_ALL:\n\t\t\tA(ARPOP_VM_VLANID_REQUEST);\n\t\t\tbreak;\n\t\tcase ARPOP_VM_VLANID_REPLY:\n\t\t\tA(ARPOP_VM_VLANID_REPLY);\n\t\t\tbreak;\n\t\tdefault:\n\t\t\tprintf(\"unrecognized value data: 0x%016lX op: 0x%02X\\n\", sah->ae_hdr.data, op);\n\t}\n\t\/* save potential cache stall to the end *\/\n\tif (reply) {\n\t\teh = (struct ether_header *)txbuf;\n\t\tlmacp = (uint16_t *)&eh->ether_dhost;\n\t\trmacp = (uint16_t *)&state->vs_prov_mac;\n\t\tlmacp[0] = rmacp[0];\n\t\tlmacp[1] = rmacp[1];\n\t\tlmacp[2] = rmacp[2];\n\t\trmacp = (uint16_t *)&state->vs_ctrl_mac;\n\t\tlmacp[3] = rmacp[0];\n\t\tlmacp[4] = rmacp[1];\n\t\tlmacp[5] = rmacp[2];\n\t\t\/* [6] *\/\n\t\teh->ether_type = ETHERTYPE_ARP;\n\t\t\/* [7-10] *\/\n\t\tdah->ae_hdr.data = reply;\n\t\t\/* [11-13] - ar_sha *\/\n\t\tlmacp[11] = rmacp[0];\n\t\tlmacp[12] = rmacp[1];\n\t\tlmacp[13] = rmacp[2];\n\t\t\/* [14-15] - ae_spa *\/\n\t\tdah->ae_spa = hostip;\n\n\t\trmacp = (uint16_t *)&targetha;\n\t\t\/* [16-18] - ae_tha *\/\n\t\tlmacp[16] = rmacp[0];\n\t\tlmacp[17] = rmacp[1];\n\t\tlmacp[18] = rmacp[2];\n\t\t\/* actual value of interest *\/\n\t\tdah->ae_tpa = targetpa;\n\t\treturn (1);\n\t}\n\treturn (0);\n}\n\n\/*\n * If rxbuf contains a neighbor discovery request return true.\n * If it's an nd request we can handle, enqueue a response.\n *\n * dir = EGRESS => VX, dir = INGRESS => PHYS\n *\/\nbool\nnd_request(struct arphdr_ether *sae, arphdr_ether *dae, vxstate_t &state, l2tbl_t &tbl)\n{\n#if 0\n\/\/ XXX we assume prepopulated ARP table so ignore replies\n\/\/\tif (ae->ae_req != arpopreq && ae->ae_req != arpopreply)\n\tif (sae->ae_req != arpopreq)\n\t\treturn false;\n\n\tdae->ae_req = arpopreply;\n#endif\n\tabort();\n\treturn true;\n}\n\n\/*\n * If valid, deencapsulate rxbuf in to txbuf\n *\n *\/\nbool\nvxlan_decap(char *rxbuf, char *txbuf, int len, vxstate_t &state __unused)\n{\n\n\tnm_pkt_copy(rxbuf, txbuf, len);\n\treturn true;\n}\n\n\/*\n * If valid, encapsulate rxbuf in to txbuf\n *\n *\/\nbool\nvxlan_encap(char *rxbuf, char *txbuf, int len, vxstate_t &state __unused)\n{\n\tstruct ether_vlan_header *evh, *evhrsp;\n\tint hdrlen, etype;\n\n\tevh = (struct ether_vlan_header *)(rxbuf);\n\tif (evh->evl_encap_proto == htons(ETHERTYPE_VLAN)) {\n\t\thdrlen = ETHER_HDR_LEN + ETHER_VLAN_ENCAP_LEN;\n\t\tetype = ntohs(evh->evl_proto);\n\t} else {\n\t\thdrlen = ETHER_HDR_LEN;\n\t\tetype = ntohs(evh->evl_encap_proto);\n\t}\n\tif (etype != ETHERTYPE_IP && etype != ETHERTYPE_IPV6)\n\t\treturn false;\n\t\/* first map evh->evl_shost -> vxlanid \/ vlanid *\/\n\t\/* ..... *\/\n\t\/* next map evh->evl_dhost -> remote ip addr in the corresponding forwarding table *\/\n\t\/* ..... *\/\n\t\/* next check if remote ip is on our local subnet *\/\n\t\/* .... *\/\n\t\/* if yes - lookup MAC address for peer *\/\n\t\/* .... *\/\n\t\/* if no - lookup MAC address for corresponding router *\/\n\t\/* .... *\/\n\t\/* use source IP for said subnet *\/\n\t\/* calculate source port *\/\n\t\/* .... *\/\n\n\tevhrsp = (struct ether_vlan_header *)(txbuf);\n nm_pkt_copy(rxbuf, txbuf, len);\n return true;\n}\n<|endoftext|>"} {"text":"<commit_before>\/\/ Copyright (C) 2011-2012, Zeex\n\/\/\n\/\/ Licensed under the Apache License, Version 2.0 (the \"License\");\n\/\/ you may not use this file except in compliance with the License.\n\/\/ You may obtain a copy of the License at\n\/\/\n\/\/\t http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n\/\/\n\/\/ Unless required by applicable law or agreed to in writing, software\n\/\/ distributed under the License is distributed on an \"AS IS\" BASIS,\n\/\/ WITHOUT WARRANTIES OR CONDITIONS OF 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 <sampgdk\/config.h>\n#include <sampgdk\/core.h>\n#include <sampgdk\/plugin.h>\n\n#include \"callbacks.h\"\n\n#include <cassert>\n#include <cstddef>\n#include <cstring>\n\nCallbackArg::CallbackArg(cell value)\n\t: type_(CELL)\n{\n\tvalue_.as_cell = value;\n}\n\nCallbackArg::CallbackArg(const char *string)\n\t: type_(STRING)\n{\n\tstd::size_t size = std::strlen(string) + 1;\n\tchar *buf = new char[size];\n\tstd::memcpy(buf, string, size);\n\tvalue_.as_string = buf;\n}\n\nCallbackArg::~CallbackArg() {\n\tif (type_ == STRING) {\n\t\tdelete[] value_.as_string;\n\t}\n}\n\nCallbackManager::CallbackManager()\n\t: cache_()\n{\n}\n\nCallbackManager &CallbackManager::GetInstance() {\n\tstatic CallbackManager inst;\n\treturn inst;\n}\n\nvoid CallbackManager::RegisterCallbackHandler(void *handler) {\n\tcache_.insert(std::make_pair(handler, std::map<std::string, void*>()));\n}\n\ncell CallbackManager::HandleCallback(const char *name, CallbackRetVal badRetVal) {\n\tcell retVal = 0;\n\tif (badRetVal.IsSet()) {\n\t\tretVal = !badRetVal;\n\t}\n\n\ttypedef std::map<std::string, void*> PluginCache;\n\ttypedef std::map<void*, PluginCache> Cache;\n\n\t\/\/ Call each of the registered handlers until false returned\n\tfor (Cache::iterator cIter = cache_.begin(); cIter != cache_.end(); ++cIter) {\n\t\tvoid *function = 0;\n\n\t\tPluginCache pc = cIter->second;\n\t\tPluginCache::iterator pcIter = pc.find(name);\n\n\t\tif (pcIter == pc.end()) {\n\t\t\tif ((function = sampgdk_get_plugin_symbol(cIter->first, name)) != 0) {\n\t\t\t\tpc.insert(std::make_pair(name, function));\n\t\t\t}\n\t\t} else {\n\t\t\tfunction = pcIter->second;\n\t\t}\n\n\t\tif (function != 0) {\n\t\t\tint i = args_.size();\n\t\t\t#if defined _MSC_VER\n\t\t\t\tcell arg;\n\t\t\t\twhile (--i >= 0) {\n\t\t\t\t\targ = args_[i]->as_cell();\n\t\t\t\t\t__asm push dword ptr [arg]\n\t\t\t\t}\n\t\t\t\t__asm call dword ptr [function]\n\t\t\t\t__asm mov dword ptr [retVal], eax\n\t\t\t#elif defined __GNUC__\n\t\t\t\twhile (--i >= 0) {\n\t\t\t\t\t__asm__ __volatile__ (\n\t\t\t\t\t\t\"pushl %0;\" :: \"r\"(args_[i]->as_cell()));\n\t\t\t\t}\n\t\t\t\t__asm__ __volatile__ (\n\t\t\t\t\t\"calll *%0;\" :: \"r\"(function));\n\t\t\t\t__asm__ __volatile__ (\n\t\t\t\t\t\"movl %%eax, %0;\" : \"=r\"(retVal));\n\t\t\t\t#if defined LINUX\n\t\t\t\t\t__asm__ __volatile__ (\n\t\t\t\t\t\t\"addl %0, %%esp;\" :: \"r\"(args_.size() * 4));\n\t\t\t\t#endif\n\t\t\t#else\n\t\t\t\t#error Unsupported compiler\n\t\t\t#endif\n\n\t\t\tif (badRetVal.IsSet() && retVal == badRetVal) {\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t}\n\n\tClearArgs();\n\treturn retVal;\n}\n\nvoid CallbackManager::ClearArgs() {\n\tfor (std::deque<CallbackArg*>::iterator iterator = args_.begin();\n\t\t\titerator != args_.end(); ++iterator) {\n\t\tdelete *iterator;\n\t}\n\targs_.clear();\n}\n<commit_msg>Remove misleading comment<commit_after>\/\/ Copyright (C) 2011-2012, Zeex\n\/\/\n\/\/ Licensed under the Apache License, Version 2.0 (the \"License\");\n\/\/ you may not use this file except in compliance with the License.\n\/\/ You may obtain a copy of the License at\n\/\/\n\/\/\t http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n\/\/\n\/\/ Unless required by applicable law or agreed to in writing, software\n\/\/ distributed under the License is distributed on an \"AS IS\" BASIS,\n\/\/ WITHOUT WARRANTIES OR CONDITIONS OF 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 <sampgdk\/config.h>\n#include <sampgdk\/core.h>\n#include <sampgdk\/plugin.h>\n\n#include \"callbacks.h\"\n\n#include <cassert>\n#include <cstddef>\n#include <cstring>\n\nCallbackArg::CallbackArg(cell value)\n\t: type_(CELL)\n{\n\tvalue_.as_cell = value;\n}\n\nCallbackArg::CallbackArg(const char *string)\n\t: type_(STRING)\n{\n\tstd::size_t size = std::strlen(string) + 1;\n\tchar *buf = new char[size];\n\tstd::memcpy(buf, string, size);\n\tvalue_.as_string = buf;\n}\n\nCallbackArg::~CallbackArg() {\n\tif (type_ == STRING) {\n\t\tdelete[] value_.as_string;\n\t}\n}\n\nCallbackManager::CallbackManager()\n\t: cache_()\n{\n}\n\nCallbackManager &CallbackManager::GetInstance() {\n\tstatic CallbackManager inst;\n\treturn inst;\n}\n\nvoid CallbackManager::RegisterCallbackHandler(void *handler) {\n\tcache_.insert(std::make_pair(handler, std::map<std::string, void*>()));\n}\n\ncell CallbackManager::HandleCallback(const char *name, CallbackRetVal badRetVal) {\n\tcell retVal = 0;\n\tif (badRetVal.IsSet()) {\n\t\tretVal = !badRetVal;\n\t}\n\n\ttypedef std::map<std::string, void*> PluginCache;\n\ttypedef std::map<void*, PluginCache> Cache;\n\n\tfor (Cache::iterator cIter = cache_.begin(); cIter != cache_.end(); ++cIter) {\n\t\tvoid *function = 0;\n\n\t\tPluginCache pc = cIter->second;\n\t\tPluginCache::iterator pcIter = pc.find(name);\n\n\t\tif (pcIter == pc.end()) {\n\t\t\tif ((function = sampgdk_get_plugin_symbol(cIter->first, name)) != 0) {\n\t\t\t\tpc.insert(std::make_pair(name, function));\n\t\t\t}\n\t\t} else {\n\t\t\tfunction = pcIter->second;\n\t\t}\n\n\t\tif (function != 0) {\n\t\t\tint i = args_.size();\n\t\t\t#if defined _MSC_VER\n\t\t\t\tcell arg;\n\t\t\t\twhile (--i >= 0) {\n\t\t\t\t\targ = args_[i]->as_cell();\n\t\t\t\t\t__asm push dword ptr [arg]\n\t\t\t\t}\n\t\t\t\t__asm call dword ptr [function]\n\t\t\t\t__asm mov dword ptr [retVal], eax\n\t\t\t#elif defined __GNUC__\n\t\t\t\twhile (--i >= 0) {\n\t\t\t\t\t__asm__ __volatile__ (\n\t\t\t\t\t\t\"pushl %0;\" :: \"r\"(args_[i]->as_cell()));\n\t\t\t\t}\n\t\t\t\t__asm__ __volatile__ (\n\t\t\t\t\t\"calll *%0;\" :: \"r\"(function));\n\t\t\t\t__asm__ __volatile__ (\n\t\t\t\t\t\"movl %%eax, %0;\" : \"=r\"(retVal));\n\t\t\t\t#if defined LINUX\n\t\t\t\t\t__asm__ __volatile__ (\n\t\t\t\t\t\t\"addl %0, %%esp;\" :: \"r\"(args_.size() * 4));\n\t\t\t\t#endif\n\t\t\t#else\n\t\t\t\t#error Unsupported compiler\n\t\t\t#endif\n\n\t\t\tif (badRetVal.IsSet() && retVal == badRetVal) {\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t}\n\n\tClearArgs();\n\treturn retVal;\n}\n\nvoid CallbackManager::ClearArgs() {\n\tfor (std::deque<CallbackArg*>::iterator iterator = args_.begin();\n\t\t\titerator != args_.end(); ++iterator) {\n\t\tdelete *iterator;\n\t}\n\targs_.clear();\n}\n<|endoftext|>"} {"text":"<commit_before>#include \"vision.hpp\"\n#include \"operators.hpp\"\n\n#include <QTemporaryFile>\n#include <iomanip>\n#include <iostream>\n#include <sstream>\n\nvision::vision (QStatusBar& statusbar, augmentation_widget& augmentation, QObject* parent)\n: QObject (parent)\n, _failed_frames_counter (0)\n, _debug_mode (0)\n, _augmentation (augmentation)\n, _cam (new QCamera (QCamera::BackFace))\n, _video_player (NULL)\n, _acquisition (this)\n, _operators ()\n, _movement3d_average (1)\n, _statusbar (statusbar) {\n _cam->setViewfinder (&_acquisition);\n connect (&_acquisition, SIGNAL (frameAvailable (const QVideoFrame&)), this,\n SLOT (frame_callback (const QVideoFrame&)));\n _cam->start ();\n}\n\nvoid vision::set_debug_mode (const int mode) {\n _debug_mode = mode;\n}\nint vision::debug_mode () {\n return _debug_mode;\n}\n\nvoid vision::set_input (const QCameraInfo& cameraInfo) {\n if (_video_player != NULL) {\n delete _video_player;\n }\n _video_player = NULL;\n if (_cam != NULL) {\n delete _cam;\n }\n\n _cam = new QCamera (cameraInfo);\n _cam->setViewfinder (&_acquisition);\n _cam->start ();\n if (_cam->status () != QCamera::ActiveStatus) {\n _statusbar.showMessage (QString (\"camera status %1\").arg (_cam->status ()), 2000);\n }\n}\n\nvoid vision::set_input (const QString& resource_path) {\n QFile resource_file (resource_path);\n if (resource_file.exists ()) {\n auto temp_file = QTemporaryFile::createNativeFile (resource_file);\n QString fs_path = temp_file->fileName ();\n\n if (!fs_path.isEmpty ()) {\n if (_cam != NULL) {\n delete _cam;\n }\n _cam = NULL;\n if (_video_player != NULL) {\n delete _video_player;\n }\n\n _video_player = new QMediaPlayer ();\n _video_player->setVideoOutput (&_acquisition);\n _video_player->setMedia (QUrl::fromLocalFile (fs_path));\n _video_player->play ();\n }\n }\n}\n\nvoid vision::set_paused (bool paused) {\n if (paused) {\n disconnect (&_acquisition, SIGNAL (frameAvailable (const QVideoFrame&)),\n this, SLOT (frame_callback (const QVideoFrame&)));\n } else {\n connect (&_acquisition, SIGNAL (frameAvailable (const QVideoFrame&)),\n this, SLOT (frame_callback (const QVideoFrame&)));\n }\n}\n\nvoid set_focus () {\n ; \/\/ TODO: add focus implementation\n}\n\nvoid vision::set_reference () {\n _markers_mutex.lock ();\n _reference = _markers;\n _markers_mutex.unlock ();\n}\n\nvoid vision::frame_callback (const QVideoFrame& const_buffer) {\n bool status = true;\n image_t image;\n if (const_buffer.isValid ()) {\n \/\/ copy image into cpu memory\n QVideoFrame frame (const_buffer);\n if (frame.map (QAbstractVideoBuffer::ReadOnly)) {\n image.data = (uint8_t*)malloc (frame.mappedBytes ());\n memcpy (image.data, frame.bits (), frame.mappedBytes ());\n\n if (frame.pixelFormat () == QVideoFrame::Format_RGB24) {\n image.format = RGB24;\n image.width = frame.width ();\n image.height = frame.height ();\n } else if (frame.pixelFormat () == QVideoFrame::Format_YUV420P) {\n image.format = YUV;\n image.width = frame.width ();\n image.height = frame.height ();\n } else {\n _statusbar.showMessage (\n QString (\"unsuported format %1\").arg (frame.pixelFormat ()), 2000);\n }\n } else {\n status = false;\n }\n frame.unmap ();\n }\n\n if (status) {\n if (_debug_mode == 0) {\n _augmentation.setBackground (image);\n _augmentation.update ();\n }\n \/\/ start image processing\n _operators.preprocessing (image);\n if (_debug_mode == 1) {\n _augmentation.setBackground (image);\n _augmentation.update ();\n }\n\n _operators.segmentation (image);\n if (_debug_mode == 2) {\n _augmentation.setBackground (image);\n _augmentation.update ();\n }\n\n _markers_mutex.lock ();\n _markers.clear ();\n _operators.extraction (image, _markers);\n if (_debug_mode == 3) {\n _augmentation.setBackground (image);\n _augmentation.update ();\n }\n\n movement3d movement;\n _operators.classification (_reference, _markers, movement); \/\/ classify\n _markers_mutex.unlock ();\n movement = _movement3d_average.average (movement);\n _augmentation.setScale (movement.scale ());\n translation_t translation = movement.translation ();\n movement.translation (\n { movement.translation_delta_to_absolute (translation.x, image.width, -1, 1),\n movement.translation_delta_to_absolute (translation.y, image.height, -1, 1) });\n _augmentation.setXPosition (movement.translation ().x);\n _augmentation.setYPosition (movement.translation ().y);\n\n _augmentation.setYRotation (movement.yaw ());\n _augmentation.setZRotation (movement.roll ());\n _augmentation.setXRotation ((movement.pitch ()) - 90);\n std::cout << movement << std::endl;\n\n std::stringstream stream;\n stream << std::setprecision (2);\n \/\/ stream << \"T(\" << movement.translation ().x << \",\"\n \/\/ << movement.translation ().y << \") \";\n stream << \"S: \" << movement.scale () << \" \";\n stream << \"yaw: \" << movement.yaw () << \" \";\n stream << \"pitch: \" << movement.pitch () << \" \";\n stream << \"roll: \" << movement.roll () << std::endl;\n _statusbar.showMessage (stream.str ().c_str ());\n\n QImage debug_image ((const unsigned char*)image.data, image.width,\n image.height, QImage::Format_Grayscale8);\n debug_image.save (\"debug_image.png\");\n\n delete image.data;\n }\n}\n<commit_msg>fix qrong order err<commit_after>#include \"vision.hpp\"\n#include \"operators.hpp\"\n\n#include <QTemporaryFile>\n#include <iomanip>\n#include <iostream>\n#include <sstream>\n\nvision::vision (QStatusBar& statusbar, augmentation_widget& augmentation, QObject* parent)\n: QObject (parent)\n, _movement3d_average (1)\n, _failed_frames_counter (0)\n, _debug_mode (0)\n, _augmentation (augmentation)\n, _cam (new QCamera (QCamera::BackFace))\n, _video_player (NULL)\n, _acquisition (this)\n, _operators ()\n, _statusbar (statusbar) {\n _cam->setViewfinder (&_acquisition);\n connect (&_acquisition, SIGNAL (frameAvailable (const QVideoFrame&)), this,\n SLOT (frame_callback (const QVideoFrame&)));\n _cam->start ();\n}\n\nvoid vision::set_debug_mode (const int mode) {\n _debug_mode = mode;\n}\nint vision::debug_mode () {\n return _debug_mode;\n}\n\nvoid vision::set_input (const QCameraInfo& cameraInfo) {\n if (_video_player != NULL) {\n delete _video_player;\n }\n _video_player = NULL;\n if (_cam != NULL) {\n delete _cam;\n }\n\n _cam = new QCamera (cameraInfo);\n _cam->setViewfinder (&_acquisition);\n _cam->start ();\n if (_cam->status () != QCamera::ActiveStatus) {\n _statusbar.showMessage (QString (\"camera status %1\").arg (_cam->status ()), 2000);\n }\n}\n\nvoid vision::set_input (const QString& resource_path) {\n QFile resource_file (resource_path);\n if (resource_file.exists ()) {\n auto temp_file = QTemporaryFile::createNativeFile (resource_file);\n QString fs_path = temp_file->fileName ();\n\n if (!fs_path.isEmpty ()) {\n if (_cam != NULL) {\n delete _cam;\n }\n _cam = NULL;\n if (_video_player != NULL) {\n delete _video_player;\n }\n\n _video_player = new QMediaPlayer ();\n _video_player->setVideoOutput (&_acquisition);\n _video_player->setMedia (QUrl::fromLocalFile (fs_path));\n _video_player->play ();\n }\n }\n}\n\nvoid vision::set_paused (bool paused) {\n if (paused) {\n disconnect (&_acquisition, SIGNAL (frameAvailable (const QVideoFrame&)),\n this, SLOT (frame_callback (const QVideoFrame&)));\n } else {\n connect (&_acquisition, SIGNAL (frameAvailable (const QVideoFrame&)),\n this, SLOT (frame_callback (const QVideoFrame&)));\n }\n}\n\nvoid set_focus () {\n ; \/\/ TODO: add focus implementation\n}\n\nvoid vision::set_reference () {\n _markers_mutex.lock ();\n _reference = _markers;\n _markers_mutex.unlock ();\n}\n\nvoid vision::frame_callback (const QVideoFrame& const_buffer) {\n bool status = true;\n image_t image;\n if (const_buffer.isValid ()) {\n \/\/ copy image into cpu memory\n QVideoFrame frame (const_buffer);\n if (frame.map (QAbstractVideoBuffer::ReadOnly)) {\n image.data = (uint8_t*)malloc (frame.mappedBytes ());\n memcpy (image.data, frame.bits (), frame.mappedBytes ());\n\n if (frame.pixelFormat () == QVideoFrame::Format_RGB24) {\n image.format = RGB24;\n image.width = frame.width ();\n image.height = frame.height ();\n } else if (frame.pixelFormat () == QVideoFrame::Format_YUV420P) {\n image.format = YUV;\n image.width = frame.width ();\n image.height = frame.height ();\n } else {\n _statusbar.showMessage (\n QString (\"unsuported format %1\").arg (frame.pixelFormat ()), 2000);\n }\n } else {\n status = false;\n }\n frame.unmap ();\n }\n\n if (status) {\n if (_debug_mode == 0) {\n _augmentation.setBackground (image);\n _augmentation.update ();\n }\n \/\/ start image processing\n _operators.preprocessing (image);\n if (_debug_mode == 1) {\n _augmentation.setBackground (image);\n _augmentation.update ();\n }\n\n _operators.segmentation (image);\n if (_debug_mode == 2) {\n _augmentation.setBackground (image);\n _augmentation.update ();\n }\n\n _markers_mutex.lock ();\n _markers.clear ();\n _operators.extraction (image, _markers);\n if (_debug_mode == 3) {\n _augmentation.setBackground (image);\n _augmentation.update ();\n }\n\n movement3d movement;\n _operators.classification (_reference, _markers, movement); \/\/ classify\n _markers_mutex.unlock ();\n movement = _movement3d_average.average (movement);\n _augmentation.setScale (movement.scale ());\n translation_t translation = movement.translation ();\n movement.translation (\n { movement.translation_delta_to_absolute (translation.x, image.width, -1, 1),\n movement.translation_delta_to_absolute (translation.y, image.height, -1, 1) });\n _augmentation.setXPosition (movement.translation ().x);\n _augmentation.setYPosition (movement.translation ().y);\n\n _augmentation.setYRotation (movement.yaw ());\n _augmentation.setZRotation (movement.roll ());\n _augmentation.setXRotation ((movement.pitch ()) - 90);\n std::cout << movement << std::endl;\n\n std::stringstream stream;\n stream << std::setprecision (2);\n \/\/ stream << \"T(\" << movement.translation ().x << \",\"\n \/\/ << movement.translation ().y << \") \";\n stream << \"S: \" << movement.scale () << \" \";\n stream << \"yaw: \" << movement.yaw () << \" \";\n stream << \"pitch: \" << movement.pitch () << \" \";\n stream << \"roll: \" << movement.roll () << std::endl;\n _statusbar.showMessage (stream.str ().c_str ());\n\n QImage debug_image ((const unsigned char*)image.data, image.width,\n image.height, QImage::Format_Grayscale8);\n debug_image.save (\"debug_image.png\");\n\n delete image.data;\n }\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\/server\/servermodule.h>\n\n#include <modules\/server\/include\/connection.h>\n#include <modules\/server\/include\/topics\/topic.h>\n#include <openspace\/engine\/openspaceengine.h>\n#include <ghoul\/fmt.h>\n#include <ghoul\/io\/socket\/socket.h>\n#include <ghoul\/io\/socket\/tcpsocketserver.h>\n#include <ghoul\/io\/socket\/websocket.h>\n#include <ghoul\/io\/socket\/websocketserver.h>\n#include <ghoul\/logging\/logmanager.h>\n#include <ghoul\/misc\/templatefactory.h>\n\nnamespace {\n constexpr const char* _loggerCat = \"ServerModule\";\n} \/\/ namespace\n\nnamespace openspace {\n\nServerModule::ServerModule() : OpenSpaceModule(ServerModule::Name) {}\n\nServerModule::~ServerModule() {\n disconnectAll();\n cleanUpFinishedThreads();\n}\n\nvoid ServerModule::internalInitialize(const ghoul::Dictionary&) {\n using namespace ghoul::io;\n\n std::unique_ptr<TcpSocketServer> tcpServer = std::make_unique<TcpSocketServer>();\n std::unique_ptr<WebSocketServer> wsServer = std::make_unique<WebSocketServer>();\n\n \/\/ Temporary hard coded addresses and ports.\n tcpServer->listen(\"localhost\", 8000);\n wsServer->listen(\"localhost\", 8001);\n LDEBUG(fmt::format(\n \"TCP Server listening on {}:{}\",tcpServer->address(), tcpServer->port()\n ));\n\n LDEBUG(fmt::format(\n \"WS Server listening on {}:{}\", wsServer->address(), wsServer->port()\n ));\n\n _servers.push_back(std::move(tcpServer));\n _servers.push_back(std::move(wsServer));\n\n OsEng.registerModuleCallback(\n OpenSpaceEngine::CallbackOption::PreSync,\n [this]() { preSync(); }\n );\n}\n\nvoid ServerModule::preSync() {\n \/\/ Set up new connections.\n for (std::unique_ptr<ghoul::io::SocketServer>& server : _servers) {\n std::unique_ptr<ghoul::io::Socket> socket;\n while ((socket = server->nextPendingSocket())) {\n socket->startStreams();\n std::shared_ptr<Connection> connection = std::make_shared<Connection>(\n std::move(socket),\n server->address()\n );\n connection->setThread(std::thread(\n [this, connection] () { handleConnection(connection); }\n ));\n _connections.push_back({ std::move(connection), false });\n }\n }\n\n \/\/ Consume all messages put into the message queue by the socket threads.\n consumeMessages();\n\n \/\/ Join threads for sockets that disconnected.\n cleanUpFinishedThreads();\n}\n\nvoid ServerModule::cleanUpFinishedThreads() {\n for (ConnectionData& connectionData : _connections) {\n Connection& connection = *connectionData.connection;\n if (!connection.socket() || !connection.socket()->isConnected()) {\n if (connection.thread().joinable()) {\n connection.thread().join();\n connectionData.isMarkedForRemoval = true;\n }\n }\n }\n _connections.erase(std::remove_if(\n _connections.begin(),\n _connections.end(),\n [](const ConnectionData& connectionData) {\n return connectionData.isMarkedForRemoval;\n }\n ), _connections.end());\n}\n\nvoid ServerModule::disconnectAll() {\n for (ConnectionData& connectionData : _connections) {\n Connection& connection = *connectionData.connection;\n if (connection.socket() && connection.socket()->isConnected()) {\n connection.socket()->disconnect(\n static_cast<int>(ghoul::io::WebSocket::ClosingReason::ClosingAll)\n );\n }\n }\n}\n\nvoid ServerModule::handleConnection(std::shared_ptr<Connection> connection) {\n std::string messageString;\n while (connection->socket()->getMessage(messageString)) {\n std::lock_guard<std::mutex> lock(_messageQueueMutex);\n _messageQueue.push_back({ connection, std::move(messageString) });\n }\n}\n\nvoid ServerModule::consumeMessages() {\n std::lock_guard<std::mutex> lock(_messageQueueMutex);\n while (!_messageQueue.empty()) {\n const Message& m = _messageQueue.front();\n _messageQueue.pop_front();\n if (std::shared_ptr<Connection> c = m.connection.lock()) {\n c->handleMessage(m.messageString);\n }\n }\n}\n\n} \/\/ namespace openspace\n<commit_msg>Pop Message from queue after use to fix reference lifespan<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\/server\/servermodule.h>\n\n#include <modules\/server\/include\/connection.h>\n#include <modules\/server\/include\/topics\/topic.h>\n#include <openspace\/engine\/openspaceengine.h>\n#include <ghoul\/fmt.h>\n#include <ghoul\/io\/socket\/socket.h>\n#include <ghoul\/io\/socket\/tcpsocketserver.h>\n#include <ghoul\/io\/socket\/websocket.h>\n#include <ghoul\/io\/socket\/websocketserver.h>\n#include <ghoul\/logging\/logmanager.h>\n#include <ghoul\/misc\/templatefactory.h>\n\nnamespace {\n constexpr const char* _loggerCat = \"ServerModule\";\n} \/\/ namespace\n\nnamespace openspace {\n\nServerModule::ServerModule() : OpenSpaceModule(ServerModule::Name) {}\n\nServerModule::~ServerModule() {\n disconnectAll();\n cleanUpFinishedThreads();\n}\n\nvoid ServerModule::internalInitialize(const ghoul::Dictionary&) {\n using namespace ghoul::io;\n\n std::unique_ptr<TcpSocketServer> tcpServer = std::make_unique<TcpSocketServer>();\n std::unique_ptr<WebSocketServer> wsServer = std::make_unique<WebSocketServer>();\n\n \/\/ Temporary hard coded addresses and ports.\n tcpServer->listen(\"localhost\", 8000);\n wsServer->listen(\"localhost\", 8001);\n LDEBUG(fmt::format(\n \"TCP Server listening on {}:{}\",tcpServer->address(), tcpServer->port()\n ));\n\n LDEBUG(fmt::format(\n \"WS Server listening on {}:{}\", wsServer->address(), wsServer->port()\n ));\n\n _servers.push_back(std::move(tcpServer));\n _servers.push_back(std::move(wsServer));\n\n OsEng.registerModuleCallback(\n OpenSpaceEngine::CallbackOption::PreSync,\n [this]() { preSync(); }\n );\n}\n\nvoid ServerModule::preSync() {\n \/\/ Set up new connections.\n for (std::unique_ptr<ghoul::io::SocketServer>& server : _servers) {\n std::unique_ptr<ghoul::io::Socket> socket;\n while ((socket = server->nextPendingSocket())) {\n socket->startStreams();\n std::shared_ptr<Connection> connection = std::make_shared<Connection>(\n std::move(socket),\n server->address()\n );\n connection->setThread(std::thread(\n [this, connection] () { handleConnection(connection); }\n ));\n _connections.push_back({ std::move(connection), false });\n }\n }\n\n \/\/ Consume all messages put into the message queue by the socket threads.\n consumeMessages();\n\n \/\/ Join threads for sockets that disconnected.\n cleanUpFinishedThreads();\n}\n\nvoid ServerModule::cleanUpFinishedThreads() {\n for (ConnectionData& connectionData : _connections) {\n Connection& connection = *connectionData.connection;\n if (!connection.socket() || !connection.socket()->isConnected()) {\n if (connection.thread().joinable()) {\n connection.thread().join();\n connectionData.isMarkedForRemoval = true;\n }\n }\n }\n _connections.erase(std::remove_if(\n _connections.begin(),\n _connections.end(),\n [](const ConnectionData& connectionData) {\n return connectionData.isMarkedForRemoval;\n }\n ), _connections.end());\n}\n\nvoid ServerModule::disconnectAll() {\n for (ConnectionData& connectionData : _connections) {\n Connection& connection = *connectionData.connection;\n if (connection.socket() && connection.socket()->isConnected()) {\n connection.socket()->disconnect(\n static_cast<int>(ghoul::io::WebSocket::ClosingReason::ClosingAll)\n );\n }\n }\n}\n\nvoid ServerModule::handleConnection(std::shared_ptr<Connection> connection) {\n std::string messageString;\n while (connection->socket()->getMessage(messageString)) {\n std::lock_guard<std::mutex> lock(_messageQueueMutex);\n _messageQueue.push_back({ connection, std::move(messageString) });\n }\n}\n\nvoid ServerModule::consumeMessages() {\n std::lock_guard<std::mutex> lock(_messageQueueMutex);\n while (!_messageQueue.empty()) {\n const Message& m = _messageQueue.front();\n if (std::shared_ptr<Connection> c = m.connection.lock()) {\n c->handleMessage(m.messageString);\n }\n _messageQueue.pop_front();\n }\n}\n\n} \/\/ namespace openspace\n<|endoftext|>"} {"text":"<commit_before>#include <vector>\n\n#include \"character.h\"\n#include \"gamestate.h\"\n#include \"movingentity.h\"\n#include \"player.h\"\n\nCharacter::Character(Gamestate *state, PlayerPtr owner_) : MovingEntity(state), owner(owner_), pressed_keys(), held_keys()\n{\n ;\n}\n\nCharacter::~Character()\n{\n ;\n}\n\nvoid Character::setinput(INPUT_CONTAINER pressed_keys_, INPUT_CONTAINER held_keys_)\n{\n pressed_keys = pressed_keys_;\n held_keys = held_keys_;\n}\n\nvoid Character::beginstep(Gamestate *state, double frametime)\n{\n ;\n}\n\nvoid Character::midstep(Gamestate *state, double frametime)\n{\n if (held_keys.LEFT)\n {\n hspeed -= 140*frametime;\n }\n if (held_keys.RIGHT)\n {\n hspeed += 140*frametime;\n }\n\n if (held_keys.JUMP)\n {\n vspeed -= 140*frametime;\n }\n if (held_keys.CROUCH)\n {\n vspeed += 140*frametime;\n }\n}\n\nvoid Character::endstep(Gamestate *state, double frametime)\n{\n MovingEntity::endstep(state, frametime);\n\n \/\/ Collision with wallmask\n printf(\"\\n%s\", state->currentmap->collides(state, this) ? \"true\" : \"false\");\n}\n<commit_msg>Added working collision reaction to character.<commit_after>#include <vector>\n#include <cmath>\n\n#include \"character.h\"\n#include \"gamestate.h\"\n#include \"movingentity.h\"\n#include \"player.h\"\n\n\n\nCharacter::Character(Gamestate *state, PlayerPtr owner_) : MovingEntity(state), owner(owner_), pressed_keys(), held_keys()\n{\n ;\n}\n\nCharacter::~Character()\n{\n ;\n}\n\nvoid Character::setinput(INPUT_CONTAINER pressed_keys_, INPUT_CONTAINER held_keys_)\n{\n pressed_keys = pressed_keys_;\n held_keys = held_keys_;\n}\n\nvoid Character::beginstep(Gamestate *state, double frametime)\n{\n ;\n}\n\nvoid Character::midstep(Gamestate *state, double frametime)\n{\n if (held_keys.LEFT)\n {\n hspeed -= 140*frametime;\n }\n if (held_keys.RIGHT)\n {\n hspeed += 140*frametime;\n }\n\n if (held_keys.JUMP)\n {\n vspeed -= 140*frametime;\n }\n if (held_keys.CROUCH)\n {\n vspeed += 140*frametime;\n }\n}\n\nvoid Character::endstep(Gamestate *state, double frametime)\n{\n MovingEntity::endstep(state, frametime);\n\n \/\/ Collision with wallmask\n if (state->currentmap->collides(state, this))\n {\n double hs = hspeed*frametime, vs = vspeed*frametime;\n \/\/ We collide, do collision handling\n double oldx = x-hs, oldy = y-vs;\n \/\/ Buffers for \"undone\" horizontal\/vertical movement\n double xbuffer = 0.0, ybuffer = 0.0;\n int steps = std::ceil(std::fmax(std::abs(hs), std::abs(vs)));\n double xstep = hs\/steps, ystep = vs\/steps;\n \/\/ Pull us out of the wall\n for (int i=0; i<steps; ++i)\n {\n x -= xstep; y -= ystep;\n xbuffer += xstep; ybuffer += ystep;\n if (not state->currentmap->collides(state, this))\n {\n break;\n }\n }\n \/\/ We're at the point where the character touched the wallmask for the first time\n \/\/ Now keep moving one unit in either direction until all possible movement is exhausted\n bool xblocked = false, yblocked = false;\n bool xfinished = false, yfinished = false;\n double oldxbuffer = xbuffer, oldybuffer = ybuffer;\n while (not xfinished or not yfinished)\n {\n oldxbuffer = xbuffer; oldybuffer = ybuffer;\n \/\/ Try first moving horizontally\n if (not xfinished)\n {\n x += xstep;\n if (state->currentmap->collides(state, this))\n {\n \/\/ Doesn't work\n x -= xstep;\n xblocked = true;\n xfinished = true;\n }\n else\n {\n \/\/ It did work, deduct this from distance still to travel\n xbuffer -= xstep;\n if (xbuffer == 0.0 or std::signbit(xbuffer) != std::signbit(oldxbuffer))\n {\n \/\/ We're done for this coordinate\n xfinished = true;\n }\n }\n }\n \/\/ Do the same vertically\n if (not yfinished)\n {\n y += ystep;\n if (state->currentmap->collides(state, this))\n {\n \/\/ Doesn't work\n y -= ystep;\n yblocked = true;\n yfinished = true;\n }\n else\n {\n \/\/ It did work, deduct this from distance still to travel\n ybuffer -= ystep;\n if (ybuffer == 0.0 or std::signbit(ybuffer) != std::signbit(oldybuffer))\n {\n \/\/ We're done for this coordinate\n yfinished = true;\n }\n }\n }\n }\n \/\/ Set hspeed and vspeed to what they should be\n if (xblocked)\n {\n hspeed = 0;\n }\n if (yblocked)\n {\n vspeed = 0;\n }\n }\n}\n<|endoftext|>"} {"text":"<commit_before>\/*\n * SDR device configuration dialog\n *\n * This file is part of softrig, a simple software defined radio transceiver.\n *\n * Copyright 2017 Alexandru Csete OZ9AEC.\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\"\n * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE\n * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE\n * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE\n * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR\n * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF\n * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS\n * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN\n * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)\n * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE\n * POSSIBILITY OF SUCH DAMAGE.\n *\/\n#include <QDebug>\n\n#include \"device_config_dialog.h\"\n#include \"ui_device_config_dialog.h\"\n\n\/\/ Flags used to match SDR type in combo box\n#define SDR_TYPE_MATCH_FLAGS (Qt::MatchFixedString | Qt::MatchCaseSensitive)\n\nDeviceConfigDialog::DeviceConfigDialog(QWidget *parent) :\n QDialog(parent),\n ui(new Ui::DeviceConfigDialog)\n{\n ui->setupUi(this);\n\n connect(ui->sdrTypeCombo, SIGNAL(currentIndexChanged(int)),\n this, SLOT(sdrTypeChanged(int)));\n connect(ui->inputRateCombo, SIGNAL(editTextChanged(QString)),\n this, SLOT(inputRateChanged(QString)));\n connect(ui->decimCombo, SIGNAL(currentIndexChanged(int)),\n this, SLOT(decimationChanged(int)));\n\n \/\/ The item data is the string that can be passed to the backend\n ui->sdrTypeCombo->addItem(tr(\"Airspy Mini\"), \"airspymini\");\n ui->sdrTypeCombo->addItem(tr(\"Airspy R2\"), \"airspy\");\n ui->sdrTypeCombo->addItem(tr(\"LimeSDR\"), \"limesdr\");\n\/\/ ui->sdrTypeCombo->addItem(tr(\"RFSpace SDR-IQ\"), \"sdriq\");\n ui->sdrTypeCombo->addItem(tr(\"RTL-SDR\"), \"rtlsdr\");\n ui->sdrTypeCombo->addItem(tr(\"SDRplay\"), \"sdrplay\");\n}\n\nDeviceConfigDialog::~DeviceConfigDialog()\n{\n delete ui;\n}\n\nvoid DeviceConfigDialog::readSettings(const device_config_t * input)\n{\n selectSdrType(input->type);\n selectSampleRate(input->rate);\n selectDecimation(input->decimation);\n setBandwidth(input->bandwidth);\n}\n\nvoid DeviceConfigDialog::saveSettings(device_config_t * input)\n{\n input->type = ui->sdrTypeCombo->currentData(Qt::UserRole).toString();\n\n \/\/ QString.toInt() returns 0 if conversion fails\n input->rate = ui->inputRateCombo->currentText().toUInt();\n input->decimation = ui->decimCombo->currentText().toUInt();\n input->bandwidth = quint32(ui->bwSpinBox->value() * 1000.0);\n}\n\nvoid DeviceConfigDialog::sdrTypeChanged(int index)\n{\n Q_UNUSED(index);\n\n QString sdr_type(ui->sdrTypeCombo->currentData(Qt::UserRole).toString());\n\n ui->inputRateCombo->clear();\n if (sdr_type == \"airspy\")\n {\n ui->inputRateCombo->addItem(\"2500000\");\n ui->inputRateCombo->addItem(\"10000000\");\n ui->inputRateCombo->setCurrentIndex(1);\n }\n else if (sdr_type == \"airspymini\")\n {\n ui->inputRateCombo->addItem(\"3000000\");\n ui->inputRateCombo->addItem(\"6000000\");\n ui->inputRateCombo->addItem(\"10000000\");\n ui->inputRateCombo->setCurrentIndex(1);\n }\n else if (sdr_type == \"limesdr\")\n {\n ui->inputRateCombo->addItem(\"240000\");\n ui->inputRateCombo->addItem(\"480000\");\n ui->inputRateCombo->addItem(\"960000\");\n ui->inputRateCombo->addItem(\"1920000\");\n ui->inputRateCombo->addItem(\"3840000\");\n ui->inputRateCombo->addItem(\"7680000\");\n ui->inputRateCombo->addItem(\"15360000\");\n ui->inputRateCombo->addItem(\"30720000\");\n ui->inputRateCombo->addItem(\"61440000\");\n }\n else if (sdr_type == \"rtlsdr\")\n {\n ui->inputRateCombo->addItem(\"240000\");\n ui->inputRateCombo->addItem(\"300000\");\n ui->inputRateCombo->addItem(\"960000\");\n ui->inputRateCombo->addItem(\"1152000\");\n ui->inputRateCombo->addItem(\"1200000\");\n ui->inputRateCombo->addItem(\"1536000\");\n ui->inputRateCombo->addItem(\"1600000\");\n ui->inputRateCombo->addItem(\"1800000\");\n ui->inputRateCombo->addItem(\"2400000\");\n ui->inputRateCombo->addItem(\"3200000\");\n ui->inputRateCombo->setCurrentIndex(8);\n }\n else if (sdr_type == \"sdriq\")\n {\n ui->inputRateCombo->addItem(\"55556\");\n ui->inputRateCombo->addItem(\"111111\");\n ui->inputRateCombo->addItem(\"158730\");\n ui->inputRateCombo->addItem(\"196078\");\n ui->inputRateCombo->setCurrentIndex(3);\n }\n else if (sdr_type == \"sdrplay\")\n {\n ui->inputRateCombo->addItem(\"2000000\");\n ui->inputRateCombo->addItem(\"4000000\");\n ui->inputRateCombo->addItem(\"6000000\");\n ui->inputRateCombo->addItem(\"10000000\");\n }\n}\n\nvoid DeviceConfigDialog::inputRateChanged(const QString &rate_str)\n{\n bool conv_ok;\n int rate;\n\n rate = rate_str.toInt(&conv_ok);\n if (!conv_ok || rate < 0)\n return;\n\n ui->decimCombo->clear();\n ui->decimCombo->addItem(\"None\");\n \/\/ add decimations that give an integer sample rate >= 48k\n if (rate >= 96000 && rate % 2 == 0)\n ui->decimCombo->addItem(\"2\");\n if (rate >= 192000 && rate % 4 == 0)\n ui->decimCombo->addItem(\"4\");\n if (rate >= 384000 && rate % 8 == 0)\n ui->decimCombo->addItem(\"8\");\n if (rate >= 768000 && rate % 16 == 0)\n ui->decimCombo->addItem(\"16\");\n if (rate >= 1536000 && rate % 32 == 0)\n ui->decimCombo->addItem(\"32\");\n if (rate >= 3072000 && rate % 64 == 0)\n ui->decimCombo->addItem(\"64\");\n if (rate >= 6144000 && rate % 128 == 0)\n ui->decimCombo->addItem(\"128\");\n\/\/ if (rate >= 12288000 && rate % 256 == 0)\n\/\/ ui->decimCombo->addItem(\"256\");\n\/\/ if (rate >= 24576000 && rate % 512 == 0)\n\/\/ ui->decimCombo->addItem(\"512\");\n\n decimationChanged(0);\n}\n\n\/* New decimation rate selected.\n * Calculate the quadrature rate and update the sample rate\n * label\n *\/\nvoid DeviceConfigDialog::decimationChanged(int index)\n{\n Q_UNUSED(index);\n\n float quad_rate;\n int input_rate;\n int decim;\n bool conv_ok;\n\n decim = ui->decimCombo->currentText().toInt(&conv_ok);\n if (!conv_ok)\n decim = 1;\n\n input_rate = ui->inputRateCombo->currentText().toInt(&conv_ok);\n if (!conv_ok)\n return;\n\n quad_rate = float(input_rate) \/ float(decim);\n if (quad_rate > 1.e6f)\n ui->sampRateString->setText(QString(\" %1 Msps\").\n arg(double(quad_rate * 1.e-6f), 0, 'f', 3));\n else\n ui->sampRateString->setText(QString(\" %1 ksps\").\n arg(double(quad_rate * 1.e-3f), 0, 'f', 3));\n}\n\n\/\/ Select SDR type from type string\nvoid DeviceConfigDialog::selectSdrType(const QString &type)\n{\n int index;\n\n if (type.isEmpty())\n return;\n\n index = ui->sdrTypeCombo->findData(type, Qt::UserRole, SDR_TYPE_MATCH_FLAGS);\n if (index >= 0)\n ui->sdrTypeCombo->setCurrentIndex(index);\n}\n\nvoid DeviceConfigDialog::selectSampleRate(unsigned int rate)\n{\n if (rate == 0)\n return;\n\n ui->inputRateCombo->setCurrentText(QString(\"%1\").arg(rate));\n}\n\nstatic int decim2index(unsigned int decim)\n{\n int idx;\n\n if (decim == 0)\n return 0;\n\n idx = 0;\n while (decim >>= 1)\n ++idx;\n\n return idx;\n}\n\nvoid DeviceConfigDialog::selectDecimation(unsigned int decimation)\n{\n ui->decimCombo->setCurrentIndex(decim2index(decimation));\n}\n\nvoid DeviceConfigDialog::setBandwidth(quint32 bw)\n{\n ui->bwSpinBox->setValue(double(bw) * 1.e-3);\n}\n<commit_msg>Update device type to be more specific<commit_after>\/*\n * SDR device configuration dialog\n *\n * This file is part of softrig, a simple software defined radio transceiver.\n *\n * Copyright 2017 Alexandru Csete OZ9AEC.\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\"\n * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE\n * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE\n * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE\n * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR\n * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF\n * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS\n * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN\n * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)\n * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE\n * POSSIBILITY OF SUCH DAMAGE.\n *\/\n#include <QDebug>\n\n#include \"device_config_dialog.h\"\n#include \"ui_device_config_dialog.h\"\n\n\/\/ Flags used to match SDR type in combo box\n#define SDR_TYPE_MATCH_FLAGS (Qt::MatchFixedString | Qt::MatchCaseSensitive)\n\nDeviceConfigDialog::DeviceConfigDialog(QWidget *parent) :\n QDialog(parent),\n ui(new Ui::DeviceConfigDialog)\n{\n ui->setupUi(this);\n\n connect(ui->sdrTypeCombo, SIGNAL(currentIndexChanged(int)),\n this, SLOT(sdrTypeChanged(int)));\n connect(ui->inputRateCombo, SIGNAL(editTextChanged(QString)),\n this, SLOT(inputRateChanged(QString)));\n connect(ui->decimCombo, SIGNAL(currentIndexChanged(int)),\n this, SLOT(decimationChanged(int)));\n\n \/\/ The item data is the string that can be passed to the backend\n ui->sdrTypeCombo->addItem(tr(\"Airspy Mini\"), \"airspymini\");\n ui->sdrTypeCombo->addItem(tr(\"Airspy R2\"), \"airspy\");\n ui->sdrTypeCombo->addItem(tr(\"LimeSDR Mini\"), \"limesdr\");\n\/\/ ui->sdrTypeCombo->addItem(tr(\"RFSpace SDR-IQ\"), \"sdriq\");\n ui->sdrTypeCombo->addItem(tr(\"RTL-SDR\"), \"rtlsdr\");\n ui->sdrTypeCombo->addItem(tr(\"SDRplay RSPduo\"), \"sdrplay\");\n}\n\nDeviceConfigDialog::~DeviceConfigDialog()\n{\n delete ui;\n}\n\nvoid DeviceConfigDialog::readSettings(const device_config_t * input)\n{\n selectSdrType(input->type);\n selectSampleRate(input->rate);\n selectDecimation(input->decimation);\n setBandwidth(input->bandwidth);\n}\n\nvoid DeviceConfigDialog::saveSettings(device_config_t * input)\n{\n input->type = ui->sdrTypeCombo->currentData(Qt::UserRole).toString();\n\n \/\/ QString.toInt() returns 0 if conversion fails\n input->rate = ui->inputRateCombo->currentText().toUInt();\n input->decimation = ui->decimCombo->currentText().toUInt();\n input->bandwidth = quint32(ui->bwSpinBox->value() * 1000.0);\n}\n\nvoid DeviceConfigDialog::sdrTypeChanged(int index)\n{\n Q_UNUSED(index);\n\n QString sdr_type(ui->sdrTypeCombo->currentData(Qt::UserRole).toString());\n\n ui->inputRateCombo->clear();\n if (sdr_type == \"airspy\")\n {\n ui->inputRateCombo->addItem(\"2500000\");\n ui->inputRateCombo->addItem(\"10000000\");\n ui->inputRateCombo->setCurrentIndex(1);\n }\n else if (sdr_type == \"airspymini\")\n {\n ui->inputRateCombo->addItem(\"3000000\");\n ui->inputRateCombo->addItem(\"6000000\");\n ui->inputRateCombo->addItem(\"10000000\");\n ui->inputRateCombo->setCurrentIndex(1);\n }\n else if (sdr_type == \"limesdr\")\n {\n ui->inputRateCombo->addItem(\"240000\");\n ui->inputRateCombo->addItem(\"480000\");\n ui->inputRateCombo->addItem(\"960000\");\n ui->inputRateCombo->addItem(\"1920000\");\n ui->inputRateCombo->addItem(\"3840000\");\n ui->inputRateCombo->addItem(\"7680000\");\n ui->inputRateCombo->addItem(\"15360000\");\n ui->inputRateCombo->addItem(\"30720000\");\n ui->inputRateCombo->addItem(\"61440000\");\n }\n else if (sdr_type == \"rtlsdr\")\n {\n ui->inputRateCombo->addItem(\"240000\");\n ui->inputRateCombo->addItem(\"300000\");\n ui->inputRateCombo->addItem(\"960000\");\n ui->inputRateCombo->addItem(\"1152000\");\n ui->inputRateCombo->addItem(\"1200000\");\n ui->inputRateCombo->addItem(\"1536000\");\n ui->inputRateCombo->addItem(\"1600000\");\n ui->inputRateCombo->addItem(\"1800000\");\n ui->inputRateCombo->addItem(\"2400000\");\n ui->inputRateCombo->addItem(\"3200000\");\n ui->inputRateCombo->setCurrentIndex(8);\n }\n else if (sdr_type == \"sdriq\")\n {\n ui->inputRateCombo->addItem(\"55556\");\n ui->inputRateCombo->addItem(\"111111\");\n ui->inputRateCombo->addItem(\"158730\");\n ui->inputRateCombo->addItem(\"196078\");\n ui->inputRateCombo->setCurrentIndex(3);\n }\n else if (sdr_type == \"sdrplay\")\n {\n ui->inputRateCombo->addItem(\"2000000\");\n ui->inputRateCombo->addItem(\"4000000\");\n ui->inputRateCombo->addItem(\"6000000\");\n ui->inputRateCombo->addItem(\"10000000\");\n }\n}\n\nvoid DeviceConfigDialog::inputRateChanged(const QString &rate_str)\n{\n bool conv_ok;\n int rate;\n\n rate = rate_str.toInt(&conv_ok);\n if (!conv_ok || rate < 0)\n return;\n\n ui->decimCombo->clear();\n ui->decimCombo->addItem(\"None\");\n \/\/ add decimations that give an integer sample rate >= 48k\n if (rate >= 96000 && rate % 2 == 0)\n ui->decimCombo->addItem(\"2\");\n if (rate >= 192000 && rate % 4 == 0)\n ui->decimCombo->addItem(\"4\");\n if (rate >= 384000 && rate % 8 == 0)\n ui->decimCombo->addItem(\"8\");\n if (rate >= 768000 && rate % 16 == 0)\n ui->decimCombo->addItem(\"16\");\n if (rate >= 1536000 && rate % 32 == 0)\n ui->decimCombo->addItem(\"32\");\n if (rate >= 3072000 && rate % 64 == 0)\n ui->decimCombo->addItem(\"64\");\n if (rate >= 6144000 && rate % 128 == 0)\n ui->decimCombo->addItem(\"128\");\n\/\/ if (rate >= 12288000 && rate % 256 == 0)\n\/\/ ui->decimCombo->addItem(\"256\");\n\/\/ if (rate >= 24576000 && rate % 512 == 0)\n\/\/ ui->decimCombo->addItem(\"512\");\n\n decimationChanged(0);\n}\n\n\/* New decimation rate selected.\n * Calculate the quadrature rate and update the sample rate\n * label\n *\/\nvoid DeviceConfigDialog::decimationChanged(int index)\n{\n Q_UNUSED(index);\n\n float quad_rate;\n int input_rate;\n int decim;\n bool conv_ok;\n\n decim = ui->decimCombo->currentText().toInt(&conv_ok);\n if (!conv_ok)\n decim = 1;\n\n input_rate = ui->inputRateCombo->currentText().toInt(&conv_ok);\n if (!conv_ok)\n return;\n\n quad_rate = float(input_rate) \/ float(decim);\n if (quad_rate > 1.e6f)\n ui->sampRateString->setText(QString(\" %1 Msps\").\n arg(double(quad_rate * 1.e-6f), 0, 'f', 3));\n else\n ui->sampRateString->setText(QString(\" %1 ksps\").\n arg(double(quad_rate * 1.e-3f), 0, 'f', 3));\n}\n\n\/\/ Select SDR type from type string\nvoid DeviceConfigDialog::selectSdrType(const QString &type)\n{\n int index;\n\n if (type.isEmpty())\n return;\n\n index = ui->sdrTypeCombo->findData(type, Qt::UserRole, SDR_TYPE_MATCH_FLAGS);\n if (index >= 0)\n ui->sdrTypeCombo->setCurrentIndex(index);\n}\n\nvoid DeviceConfigDialog::selectSampleRate(unsigned int rate)\n{\n if (rate == 0)\n return;\n\n ui->inputRateCombo->setCurrentText(QString(\"%1\").arg(rate));\n}\n\nstatic int decim2index(unsigned int decim)\n{\n int idx;\n\n if (decim == 0)\n return 0;\n\n idx = 0;\n while (decim >>= 1)\n ++idx;\n\n return idx;\n}\n\nvoid DeviceConfigDialog::selectDecimation(unsigned int decimation)\n{\n ui->decimCombo->setCurrentIndex(decim2index(decimation));\n}\n\nvoid DeviceConfigDialog::setBandwidth(quint32 bw)\n{\n ui->bwSpinBox->setValue(double(bw) * 1.e-3);\n}\n<|endoftext|>"} {"text":"<commit_before><commit_msg>Create 1014 - Consumption.cpp<commit_after><|endoftext|>"} {"text":"<commit_before>\n#include <cstdlib>\n#include <fstream>\n#include <iostream>\n#include <regex>\n#include <string>\n#include <vector>\n\n#include <dlfcn.h>\n#include <getopt.h>\n\n#include \"lib\/picojson.h\"\n\n#include \"controller.hpp\"\n#include \"socketio.hpp\"\n#include \"error.hpp\"\n\nusing namespace processwarp;\n\nclass NativeVm : public ControllerDelegate, public SocketIoDelegate {\npublic:\n Controller controller;\n SocketIo socket;\n\n \/** Configuration *\/\n const picojson::object conf;\n\n \/** Device name. *\/\n std::string device_name;\n \/** Device ID. *\/\n std::string device_id;\n \n \/** Dynamic link libraries. *\/\n std::vector<void*> libs;\n\n \/** Map of pid and program name. *\/\n std::map<std::string, std::string> procs;\n\n \/** Map of device-id and device-name. *\/\n std::map<std::string, std::string> devices;\n\n \/**\n * Constructor\n * @param _conf Configuration.\n *\/\n NativeVm(const picojson::object& _conf) :\n controller(*this),\n socket(*this),\n conf(_conf) {\n }\n\n \/**\n * Load applications list on configure file and command line argument.\n *\/\n void load_apps() {\n if (conf.find(\"apps\") == conf.end()) return;\n const picojson::array& apps = conf.at(\"apps\").get<picojson::array>();\n \n for (auto it : apps) {\n const picojson::object& app = it.get<picojson::object>();\n \/\/ Check application type.\n if (app.find(\"type\") != app.end() &&\n\t app.at(\"type\").get<std::string>() != \"llvm\") {\n\tthrow_error_message(Error::CONFIGURE, \"Unknown application type.\");\n }\n \n \/\/ Get name from filename.\n if (app.find(\"file\") == app.end()) {\n\tthrow_error_message(Error::CONFIGURE, \"Unrecognizable application file.\");\n }\n std::string name;\n std::smatch match;\n if (regex_search(app.at(\"file\").get<std::string>(),\n\t\t match, std::regex(\"[^\\\\\\\\\/]*$\"))) {\n\tname = match.str();\n\n } else {\n\tassert(false);\n }\n \n \/\/ Load file.\n std::ifstream ifs(app.at(\"file\").get<std::string>());\n if (!ifs.is_open()) {\n\tthrow_error_message(Error::CONFIGURE, \"Unrecognizable application file.\");\n }\n std::stringstream file;\n std::string line;\n while (std::getline(ifs, line, '\\n')) {\n\tfile << line << '\\n';\n }\n ifs.close();\n \n \/\/ Search device.\n std::string dst_device_id = \"\";\n if (app.find(\"device\") == app.end()) {\n\tdst_device_id = device_id;\n\n } else {\n\tstd::string device_name = app.at(\"device\").get<std::string>();\n\tfor (auto it : devices) {\n\t if (it.second == device_name) {\n\t dst_device_id = it.first;\n\t break;\n\t }\n\t}\n\tif (dst_device_id == \"\") {\n\t throw_error_message(Error::CONFIGURE, \"Unknown device name.\");\n\t}\n }\n\n \/\/ Send request.\n socket.send_load_llvm(name, file.str(), dst_device_id);\n }\n }\n \n \/\/ Call when send data to other device.\n void send_warp_data(const std::string& pid,\n\t\t const std::string& tid,\n\t\t const std::string& dst_device_id,\n\t\t const std::string& data) override {\n socket.send_warp_data_1(pid, tid, dst_device_id, data);\n }\n \n \/\/ Call when context switch of process.\n \/*\n void on_switch_proccess(const std::string& pid) override {\n }\n \/\/*\/\n \n \/\/ Call when process was finish.\n void on_finish_proccess(const std::string& pid) override {\n procs.erase(pid);\n\n std::map<std::string, SocketIoProc> sio_procs;\n for (auto it : procs) {\n SocketIoProc sio_proc;\n sio_proc.pid = it.first;\n sio_proc.name = it.second;\n sio_proc.threads.insert(make_pair(\"1\", device_id));\n\n sio_procs.insert(std::make_pair(sio_proc.pid, sio_proc));\n }\n\n print_debug(\"(s)\\n\");\n for (auto it : sio_procs) {\n print_debug(\"pid:%s\\n pid:%s\\n name:%s\\n\",\n\t\t it.first.c_str(), it.second.pid.c_str(), it.second.name.c_str());\n for (auto it2 : it.second.threads) {\n\tprint_debug(\" %s : %s\\n\", it2.first.c_str(), it2.second.c_str());\n }\n }\n\n socket.send_sync_proc_list(sio_procs);\n }\n\n \/\/ Call when rise error.\n void on_error(const std::string& pid, const std::string& message) override {\n print_debug(\"error(%s) : %s\\n\", pid.c_str(), message.c_str());\n on_finish_proccess(pid);\n }\n\n \/\/ Call when system error on server.\n void recv_sys_error(int code) override {\n throw_error(Error::SERVER_SYS);\n }\n\n \/\/ Call when application error on server.\n void recv_app_error(int code) override {\n throw_error(Error::SERVER_APP);\n }\n\n \/\/ Call when recv login message from server.\n void recv_login(int result) override {\n socket.send_list_device();\n }\n\n \/\/ Call when recv list device message from server.\n void recv_list_device(int result,\n\t\t\tconst std::map<std::string, std::string>& devices) override {\n if (result != 0) {\n throw_error(Error::SERVER_APP);\n }\n\n \/\/ Keep last devices.\n this->devices = devices;\n\n bool is_new_device = true;\n for(auto it : devices) {\n if (it.second == device_name) {\n\tis_new_device = false;\n\tsocket.send_bind_device(it.first, it.second);\n\tbreak;\n }\n }\n\n if (is_new_device) {\n socket.send_bind_device(\"\", device_name);\n }\n }\n\n \/\/ Call when recv bind device message from server.\n void recv_bind_device(int result, const std::string& device_id) override {\n if (result != 0) {\n throw_error(Error::SERVER_APP);\n }\n\n this->device_id = device_id;\n\n \/\/ Syncronize processes empty because processes not running just run program.\n socket.send_sync_proc_list(std::map<std::string, SocketIoProc>());\n\n \/\/ Execute applications.\n load_apps();\n }\n\n \/\/ Call when recv sync proc list message from server.\n void recv_sync_proc_list(const std::map<std::string, SocketIoProc>& new_procs) override {\n print_debug(\"(r)\\n\");\n for (auto it : new_procs) {\n print_debug(\"pid:%s\\n pid:%s\\n name:%s\\n\",\n\t\t it.first.c_str(), it.second.pid.c_str(), it.second.name.c_str());\n for (auto it2 : it.second.threads) {\n\tprint_debug(\" %s : %s\\n\", it2.first.c_str(), it2.second.c_str());\n }\n }\n \n \/\/ Check finished process.\n auto it = procs.begin();\n while (it != procs.end()) {\n if (new_procs.find(it->first) == new_procs.end()) {\n\t\/\/ Delete proccess if not exit in server's proccess list.\n\tcontroller.delete_process(it->first);\n\tit = procs.erase(it);\n\n } else {\n\tit ++;\n }\n }\n\n \/\/ Update process list.\n for (auto it : new_procs) {\n if (procs.find(it.first) == procs.end()) {\n\tprocs.insert(std::make_pair(it.first, it.second.name));\n\n } else {\n\tprocs.at(it.first) = it.second.name;\n }\n }\n }\n\n \/\/ Call when recv warp request from other device.\n void recv_warp_request_0(const std::string& pid,\n\t\t\t const std::string& tid,\n\t\t\t const std::string& dst_device_id,\n\t\t\t const std::string& to_device_id) override {\n \/\/ Not to me.\n if (to_device_id != device_id) return;\n\n if (procs.find(pid) == procs.end()) return;\n\n socket.send_warp_request_1(pid, tid, dst_device_id);\n }\n\n \/\/ Call when recv warp request from device that having process.\n void recv_warp_request_1(const std::string& pid,\n\t\t\t const std::string& tid,\n\t\t\t const std::string& name,\n\t\t\t const std::string& from_account,\n\t\t\t const std::string& from_device_id,\n\t\t\t const std::string& to_device_id) override {\n \/\/ Not to me.\n if (to_device_id != device_id) return;\n\n if (from_account == \"\") {\n \/\/ Accept from the same account.\n socket.send_warp_request_2(pid, tid, from_device_id, 0);\n procs.insert(std::make_pair(pid, name));\n controller.create_process(pid, libs);\n\n } else {\n \/\/ Deny from other account.\n socket.send_warp_request_2(pid, tid, from_device_id, -111);\n }\n }\n\n \/\/ Call when recv warp acception from warp destination device.\n void recv_warp_request_2(const std::string& pid,\n\t\t\t const std::string& tid,\n\t\t\t const std::string& from_device_id,\n\t\t\t const std::string& to_device_id,\n\t\t\t int result) override {\n \/\/ Not to me.\n if (to_device_id != device_id) return;\n \n if (result == 0) {\n controller.warp_process(pid, from_device_id);\n\n } else {\n fixme(\"Ouutput log & ignore?\");\n }\n }\n\n \/\/ Call when recv warp data from warp source device.\n void recv_warp_data_1(const std::string& pid,\n\t\t\tconst std::string& tid,\n\t\t\tconst std::string& from_device_id,\n\t\t\tconst std::string& to_device_id,\n\t\t\tconst std::string& payload) override {\n \/\/ Not to me.\n if (to_device_id != device_id) return;\n\n socket.send_warp_data_2(pid,\n\t\t\t tid,\n\t\t\t from_device_id,\n\t\t\t controller.recv_warp_data(pid, tid, payload) ? 0 : -111);\n }\n\n \/\/ Call when recv warp data from warp destination device.\n void recv_warp_data_2(const std::string& pid,\n\t\t\tconst std::string& tid,\n\t\t\tconst std::string& to_device_id,\n\t\t\tint result) override {\n \/\/ Do nothing.\n }\n\n \/\/ Call when process was killed.\n void recv_exit_process(const std::string& pid) override {\n controller.exit_process(pid);\n }\n\n \/\/ Recv console for test.\n void recv_test_console(const std::string& pid,\n\t\t\t const std::string& dev,\n\t\t\t const std::string& payload,\n\t\t\t const std::string& from_device_id) {\n#ifndef NDEBUG\n if (dev == \"stdout\") {\n std::cout << payload;\n } else {\n std::cerr << payload;\n }\n#endif\n }\n\n \n void init(const picojson::object& conf) {\n \/\/ Load dynamic link libraries.\n if (conf.find(\"libs\") != conf.end()) {\n const picojson::array& lib_paths = conf.at(\"libs\").get<picojson::array>();\n for (auto lib : lib_paths) {\n\tvoid* dl_handle = dlopen(lib.get<std::string>().c_str(), RTLD_LAZY);\n\tif (!dl_handle) {\n\t throw_error_message(Error::EXT_LIBRARY, dlerror());\n\t}\n\tlibs.push_back(dl_handle);\n }\n }\n \n \/\/ Get device-name.\n device_name = conf.at(\"device-name\").get<std::string>();\n \n \/\/ Connect to server by using Socket.IO.\n socket.connect(conf.at(\"server\").get<std::string>());\n socket.send_login(conf.at(\"account\").get<std::string>(),\n\t\t conf.at(\"password\").get<std::string>());\n }\n\n void run() {\n init(conf);\n#ifndef NDEBUG\n bool is_run_app = false;\n#endif\n \n \/\/ Main loop\n while(true) {\n#ifndef NDEBUG\n \/\/ Stop program when application is not running on test.\n if(getenv(\"TEST\") != nullptr) {\n\tif (procs.size() != 0) {\n\t is_run_app = true;\n\t}\n\tif (is_run_app && procs.size() == 0) {\n\t break;\n\t}\n }\n#endif\n socket.pool();\n controller.loop();\n }\n }\n};\n\n\/**\n * Entry point for NativeVM.\n * @return return code.\n *\/\nint main(int argc, char* argv[]) {\n int opt, option_index;\n picojson::object conf;\n\n option long_options[] = {\n {\"config\", required_argument, nullptr, 'c'},\n {\"llvm\", required_argument, nullptr, 'l'},\n {\"device\", required_argument, nullptr, 'd'},\n {0, 0, 0, 0} \/\/ terminate\n };\n \n \/\/ Analyse command line option using getopt.\n while((opt = getopt_long(argc, argv, \"ac:l:d:\", long_options, &option_index)) != -1) {\n switch(opt) {\n case 'c': {\n \/\/ Read configuration file.\n std::ifstream conf_file(optarg);\n if (!conf_file.is_open()) {\n\tstd::cerr << \"Can't open configure-file.\" << std::endl;\n\treturn EXIT_FAILURE;\n }\n \n \/\/ Read as JSON formated file.\n picojson::value v;\n std::string err = picojson::parse(v, conf_file);\n conf_file.close();\n if (!err.empty()) {\n\tstd::cerr << err << std::endl;\n\tgoto on_error;\n }\n conf = v.get<picojson::object>();\n } break;\n\n case 'l': {\n \/\/ Make 'apps' directive if don't exist yet.\n if (conf.find(\"apps\") == conf.end()) {\n\tconf.insert(std::make_pair(\"apps\", picojson::value(picojson::array())));\n }\n \/\/ Make per application directive in 'apps' directive.\n picojson::object app;\n app.insert(std::make_pair(\"type\", picojson::value(std::string(\"llvm\"))));\n app.insert(std::make_pair(\"file\", picojson::value(std::string(optarg))));\n app.insert(std::make_pair(\"args\", picojson::value(picojson::array())));\n \n picojson::array& apps = conf.at(\"apps\").get<picojson::array>();\n apps.push_back(picojson::value(app));\n } break;\n\n case 'd': {\n if (conf.find(\"apps\") == conf.end()) goto on_error;\n picojson::array& apps = conf.at(\"apps\").get<picojson::array>();\n\n for (auto& it : apps) {\n\tpicojson::object& app = it.get<picojson::object>();\n\tif (app.find(\"device\") == app.end()) {\n\t app.insert(std::make_pair(\"device\", picojson::value(std::string(optarg))));\n\t}\n }\n } break;\n\n case ':':\n case '?': {\n printf(\"Unknown or required argument option -%c\\n\", opt);\n goto on_error;\n } break;\n }\n }\n\n \/\/ Deal with after '--' options for last listed application.\n for (int i = optind; i < argc; i ++) {\n if (conf.find(\"apps\") == conf.end()) goto on_error;\n picojson::array& apps = conf.at(\"apps\").get<picojson::array>();\n if (apps.size() == 0) goto on_error;\n \/\/ Get 'arg' directive and push options.\n picojson::object& app = apps.back().get<picojson::object>();\n if (app.find(\"args\") == app.end()) {\n app.insert(std::make_pair(\"args\", picojson::value(picojson::array())));\n }\n picojson::array& args = app.at(\"args\").get<picojson::array>();\n args.push_back(picojson::value(std::string(argv[i])));\n }\n\n { \/\/ Run.\n NativeVm native_vm(conf);\n native_vm.run();\n\n \/\/ Finish\n return EXIT_SUCCESS;\n }\n\n on_error:\n printf(\"Usage : COMMAND -c path [-l path [-d device] [-- ...]]\\n\");\n return EXIT_FAILURE;\n}\n<commit_msg>Update proccess infomation on local<commit_after>\n#include <cstdlib>\n#include <fstream>\n#include <iostream>\n#include <regex>\n#include <string>\n#include <vector>\n\n#include <dlfcn.h>\n#include <getopt.h>\n\n#include \"lib\/picojson.h\"\n\n#include \"controller.hpp\"\n#include \"socketio.hpp\"\n#include \"error.hpp\"\n\nusing namespace processwarp;\n\nclass NativeVm : public ControllerDelegate, public SocketIoDelegate {\npublic:\n Controller controller;\n SocketIo socket;\n\n \/** Configuration *\/\n const picojson::object conf;\n\n \/** Device name. *\/\n std::string device_name;\n \/** Device ID. *\/\n std::string device_id;\n \n \/** Dynamic link libraries. *\/\n std::vector<void*> libs;\n\n \/** Map of pid and process infomation. *\/\n std::map<std::string, SocketIoProc> procs;\n\n \/** Map of device-id and device-name. *\/\n std::map<std::string, std::string> devices;\n\n \/**\n * Constructor\n * @param _conf Configuration.\n *\/\n NativeVm(const picojson::object& _conf) :\n controller(*this),\n socket(*this),\n conf(_conf) {\n }\n\n \/**\n * Load applications list on configure file and command line argument.\n *\/\n void load_apps() {\n if (conf.find(\"apps\") == conf.end()) return;\n const picojson::array& apps = conf.at(\"apps\").get<picojson::array>();\n \n for (auto it : apps) {\n const picojson::object& app = it.get<picojson::object>();\n \/\/ Check application type.\n if (app.find(\"type\") != app.end() &&\n\t app.at(\"type\").get<std::string>() != \"llvm\") {\n\tthrow_error_message(Error::CONFIGURE, \"Unknown application type.\");\n }\n \n \/\/ Get name from filename.\n if (app.find(\"file\") == app.end()) {\n\tthrow_error_message(Error::CONFIGURE, \"Unrecognizable application file.\");\n }\n std::string name;\n std::smatch match;\n if (regex_search(app.at(\"file\").get<std::string>(),\n\t\t match, std::regex(\"[^\\\\\\\\\/]*$\"))) {\n\tname = match.str();\n\n } else {\n\tassert(false);\n }\n \n \/\/ Load file.\n std::ifstream ifs(app.at(\"file\").get<std::string>());\n if (!ifs.is_open()) {\n\tthrow_error_message(Error::CONFIGURE, \"Unrecognizable application file.\");\n }\n std::stringstream file;\n std::string line;\n while (std::getline(ifs, line, '\\n')) {\n\tfile << line << '\\n';\n }\n ifs.close();\n \n \/\/ Search device.\n std::string dst_device_id = \"\";\n if (app.find(\"device\") == app.end()) {\n\tdst_device_id = device_id;\n\n } else {\n\tstd::string device_name = app.at(\"device\").get<std::string>();\n\tfor (auto it : devices) {\n\t if (it.second == device_name) {\n\t dst_device_id = it.first;\n\t break;\n\t }\n\t}\n\tif (dst_device_id == \"\") {\n\t throw_error_message(Error::CONFIGURE, \"Unknown device name.\");\n\t}\n }\n\n \/\/ Send request.\n socket.send_load_llvm(name, file.str(), dst_device_id);\n }\n }\n \n \/\/ Call when send data to other device.\n void send_warp_data(const std::string& pid,\n\t\t const std::string& tid,\n\t\t const std::string& dst_device_id,\n\t\t const std::string& data) override {\n socket.send_warp_data_1(pid, tid, dst_device_id, data);\n }\n \n \/\/ Call when context switch of process.\n \/*\n void on_switch_proccess(const std::string& pid) override {\n }\n \/\/*\/\n \n \/\/ Call when process was finish.\n void on_finish_proccess(const std::string& pid) override {\n procs.erase(pid);\n\n socket.send_sync_proc_list(procs);\n }\n\n \/\/ Call when rise error.\n void on_error(const std::string& pid, const std::string& message) override {\n print_debug(\"error(%s) : %s\\n\", pid.c_str(), message.c_str());\n on_finish_proccess(pid);\n }\n\n \/\/ Call when system error on server.\n void recv_sys_error(int code) override {\n throw_error(Error::SERVER_SYS);\n }\n\n \/\/ Call when application error on server.\n void recv_app_error(int code) override {\n throw_error(Error::SERVER_APP);\n }\n\n \/\/ Call when recv login message from server.\n void recv_login(int result) override {\n socket.send_list_device();\n }\n\n \/\/ Call when recv list device message from server.\n void recv_list_device(int result,\n\t\t\tconst std::map<std::string, std::string>& devices) override {\n if (result != 0) {\n throw_error(Error::SERVER_APP);\n }\n\n \/\/ Keep last devices.\n this->devices = devices;\n\n bool is_new_device = true;\n for(auto it : devices) {\n if (it.second == device_name) {\n\tis_new_device = false;\n\tsocket.send_bind_device(it.first, it.second);\n\tbreak;\n }\n }\n\n if (is_new_device) {\n socket.send_bind_device(\"\", device_name);\n }\n }\n\n \/\/ Call when recv bind device message from server.\n void recv_bind_device(int result, const std::string& device_id) override {\n if (result != 0) {\n throw_error(Error::SERVER_APP);\n }\n\n this->device_id = device_id;\n\n \/\/ Syncronize processes empty because processes not running just run program.\n socket.send_sync_proc_list(std::map<std::string, SocketIoProc>());\n\n \/\/ Execute applications.\n load_apps();\n }\n\n \/\/ Call when recv sync proc list message from server.\n void recv_sync_proc_list(const std::map<std::string, SocketIoProc>& new_procs) override {\n \/\/ Check finished process.\n auto it = procs.begin();\n while (it != procs.end()) {\n if (new_procs.find(it->first) == new_procs.end()) {\n\t\/\/ Delete proccess if not exit in server's proccess list.\n\tcontroller.delete_process(it->first);\n\tit = procs.erase(it);\n\n } else {\n\tit ++;\n }\n }\n\n \/\/ Update process list.\n procs = new_procs;\n }\n\n \/\/ Call when recv warp request from other device.\n void recv_warp_request_0(const std::string& pid,\n\t\t\t const std::string& tid,\n\t\t\t const std::string& dst_device_id,\n\t\t\t const std::string& to_device_id) override {\n \/\/ Not to me.\n if (to_device_id != device_id) return;\n\n if (procs.find(pid) == procs.end()) return;\n\n socket.send_warp_request_1(pid, tid, dst_device_id);\n }\n\n \/\/ Call when recv warp request from device that having process.\n void recv_warp_request_1(const std::string& pid,\n\t\t\t const std::string& tid,\n\t\t\t const std::string& name,\n\t\t\t const std::string& from_account,\n\t\t\t const std::string& from_device_id,\n\t\t\t const std::string& to_device_id) override {\n \/\/ Not to me.\n if (to_device_id != device_id) return;\n\n if (from_account == \"\") {\n \/\/ Accept from the same account.\n socket.send_warp_request_2(pid, tid, from_device_id, 0);\n\n \/\/ Update procs.\n \/\/ Create new proccess infomation for new process.\n if (procs.find(pid) == procs.end()) {\n\tSocketIoProc proc_info;\n\tproc_info.pid = pid;\n\tproc_info.name = name;\n\tprocs.insert(std::make_pair(pid, proc_info));\n }\n \/\/ Update or create thread pair.\n SocketIoProc& proc_info = procs.at(pid);\n if (proc_info.threads.find(tid) != proc_info.threads.end()) {\n\tproc_info.threads.at(tid) = device_id;\n\n } else {\n\tproc_info.threads.insert(std::make_pair(tid, device_id));\n }\n \n controller.create_process(pid, libs);\n\n } else {\n \/\/ Deny from other account.\n socket.send_warp_request_2(pid, tid, from_device_id, -111);\n }\n }\n\n \/\/ Call when recv warp acception from warp destination device.\n void recv_warp_request_2(const std::string& pid,\n\t\t\t const std::string& tid,\n\t\t\t const std::string& from_device_id,\n\t\t\t const std::string& to_device_id,\n\t\t\t int result) override {\n \/\/ Not to me.\n if (to_device_id != device_id) return;\n \n if (result == 0) {\n controller.warp_process(pid, from_device_id);\n\n } else {\n fixme(\"Ouutput log & ignore?\");\n }\n }\n\n \/\/ Call when recv warp data from warp source device.\n void recv_warp_data_1(const std::string& pid,\n\t\t\tconst std::string& tid,\n\t\t\tconst std::string& from_device_id,\n\t\t\tconst std::string& to_device_id,\n\t\t\tconst std::string& payload) override {\n \/\/ Not to me.\n if (to_device_id != device_id) return;\n\n socket.send_warp_data_2(pid,\n\t\t\t tid,\n\t\t\t from_device_id,\n\t\t\t controller.recv_warp_data(pid, tid, payload) ? 0 : -111);\n }\n\n \/\/ Call when recv warp data from warp destination device.\n void recv_warp_data_2(const std::string& pid,\n\t\t\tconst std::string& tid,\n\t\t\tconst std::string& to_device_id,\n\t\t\tint result) override {\n \/\/ Do nothing.\n }\n\n \/\/ Call when process was killed.\n void recv_exit_process(const std::string& pid) override {\n controller.exit_process(pid);\n }\n\n \/\/ Recv console for test.\n void recv_test_console(const std::string& pid,\n\t\t\t const std::string& dev,\n\t\t\t const std::string& payload,\n\t\t\t const std::string& from_device_id) {\n#ifndef NDEBUG\n if (dev == \"stdout\") {\n std::cout << payload;\n } else {\n std::cerr << payload;\n }\n#endif\n }\n\n \n void init(const picojson::object& conf) {\n \/\/ Load dynamic link libraries.\n if (conf.find(\"libs\") != conf.end()) {\n const picojson::array& lib_paths = conf.at(\"libs\").get<picojson::array>();\n for (auto lib : lib_paths) {\n\tvoid* dl_handle = dlopen(lib.get<std::string>().c_str(), RTLD_LAZY);\n\tif (!dl_handle) {\n\t throw_error_message(Error::EXT_LIBRARY, dlerror());\n\t}\n\tlibs.push_back(dl_handle);\n }\n }\n \n \/\/ Get device-name.\n device_name = conf.at(\"device-name\").get<std::string>();\n \n \/\/ Connect to server by using Socket.IO.\n socket.connect(conf.at(\"server\").get<std::string>());\n socket.send_login(conf.at(\"account\").get<std::string>(),\n\t\t conf.at(\"password\").get<std::string>());\n }\n\n void run() {\n init(conf);\n#ifndef NDEBUG\n bool is_run_app = false;\n#endif\n \n \/\/ Main loop\n while(true) {\n#ifndef NDEBUG\n \/\/ Stop program when application is not running on test.\n if(getenv(\"TEST\") != nullptr) {\n\tif (procs.size() != 0) {\n\t is_run_app = true;\n\t}\n\tif (is_run_app && procs.size() == 0) {\n\t break;\n\t}\n }\n#endif\n socket.pool();\n controller.loop();\n }\n }\n};\n\n\/**\n * Entry point for NativeVM.\n * @return return code.\n *\/\nint main(int argc, char* argv[]) {\n int opt, option_index;\n picojson::object conf;\n\n option long_options[] = {\n {\"config\", required_argument, nullptr, 'c'},\n {\"llvm\", required_argument, nullptr, 'l'},\n {\"device\", required_argument, nullptr, 'd'},\n {0, 0, 0, 0} \/\/ terminate\n };\n \n \/\/ Analyse command line option using getopt.\n while((opt = getopt_long(argc, argv, \"ac:l:d:\", long_options, &option_index)) != -1) {\n switch(opt) {\n case 'c': {\n \/\/ Read configuration file.\n std::ifstream conf_file(optarg);\n if (!conf_file.is_open()) {\n\tstd::cerr << \"Can't open configure-file.\" << std::endl;\n\treturn EXIT_FAILURE;\n }\n \n \/\/ Read as JSON formated file.\n picojson::value v;\n std::string err = picojson::parse(v, conf_file);\n conf_file.close();\n if (!err.empty()) {\n\tstd::cerr << err << std::endl;\n\tgoto on_error;\n }\n conf = v.get<picojson::object>();\n } break;\n\n case 'l': {\n \/\/ Make 'apps' directive if don't exist yet.\n if (conf.find(\"apps\") == conf.end()) {\n\tconf.insert(std::make_pair(\"apps\", picojson::value(picojson::array())));\n }\n \/\/ Make per application directive in 'apps' directive.\n picojson::object app;\n app.insert(std::make_pair(\"type\", picojson::value(std::string(\"llvm\"))));\n app.insert(std::make_pair(\"file\", picojson::value(std::string(optarg))));\n app.insert(std::make_pair(\"args\", picojson::value(picojson::array())));\n \n picojson::array& apps = conf.at(\"apps\").get<picojson::array>();\n apps.push_back(picojson::value(app));\n } break;\n\n case 'd': {\n if (conf.find(\"apps\") == conf.end()) goto on_error;\n picojson::array& apps = conf.at(\"apps\").get<picojson::array>();\n\n for (auto& it : apps) {\n\tpicojson::object& app = it.get<picojson::object>();\n\tif (app.find(\"device\") == app.end()) {\n\t app.insert(std::make_pair(\"device\", picojson::value(std::string(optarg))));\n\t}\n }\n } break;\n\n case ':':\n case '?': {\n printf(\"Unknown or required argument option -%c\\n\", opt);\n goto on_error;\n } break;\n }\n }\n\n \/\/ Deal with after '--' options for last listed application.\n for (int i = optind; i < argc; i ++) {\n if (conf.find(\"apps\") == conf.end()) goto on_error;\n picojson::array& apps = conf.at(\"apps\").get<picojson::array>();\n if (apps.size() == 0) goto on_error;\n \/\/ Get 'arg' directive and push options.\n picojson::object& app = apps.back().get<picojson::object>();\n if (app.find(\"args\") == app.end()) {\n app.insert(std::make_pair(\"args\", picojson::value(picojson::array())));\n }\n picojson::array& args = app.at(\"args\").get<picojson::array>();\n args.push_back(picojson::value(std::string(argv[i])));\n }\n\n { \/\/ Run.\n NativeVm native_vm(conf);\n native_vm.run();\n\n \/\/ Finish\n return EXIT_SUCCESS;\n }\n\n on_error:\n printf(\"Usage : COMMAND -c path [-l path [-d device] [-- ...]]\\n\");\n return EXIT_FAILURE;\n}\n<|endoftext|>"} {"text":"<commit_before>\/**\n * machina\n *\n * Copyright (c) 2014, drmats\n * All rights reserved.\n *\n * https:\/\/github.com\/drmats\/machina\n *\/\n\n#ifndef __MAIN_LOOP_CPP_\n#define __MAIN_LOOP_CPP_ 1\n\n#include \"main_loop.hpp\"\n#include \"machina.hpp\"\n#include \"primitives.hpp\"\n\nnamespace machina {\n\n\n\n\n\/**\n * Default mouse-motion event handler (do-nothing).\n *\/\nvoid MainLoop::default_handler_t::empty_mouse_motion (\n MainLoop *ml, const SDL_Event &e\n) {\n return;\n}\n\n\n\n\n\/**\n * Mouse-motion event handler (look-around).\n *\/\nvoid MainLoop::default_handler_t::look_around_camera (\n MainLoop *ml, const SDL_Event &e, const GLfloat yaw_direction\n) {\n static const auto positive_fmod =\n [] (GLfloat val, GLfloat denom) -> GLfloat {\n return std::fmod(std::fmod(val, denom) + denom, denom);\n };\n ml->camera.pitch = positive_fmod(\n ml->camera.pitch + e.motion.yrel * 0.3f, 360.0f\n );\n ml->camera.yaw = positive_fmod(\n ml->camera.yaw + yaw_direction * e.motion.xrel * 0.3f, 360.0f\n );\n ml->camera.recompute_rotation();\n}\n\n\n\n\n\/**\n * Mouse-motion event handler (move-around).\n *\/\nvoid MainLoop::default_handler_t::move_around_camera (\n MainLoop *ml, const SDL_Event &e\n) {\n ml->camera.relative_translate(\n ml->camera.strafe, 1.0,\n e.motion.xrel * ml->camera.dist * 0.00215f\n );\n ml->camera.relative_translate(\n ml->camera.up, -1.0,\n e.motion.yrel * ml->camera.dist * 0.00215f\n );\n}\n\n\n\n\n\/**\n * Mouse-wheel default event handler (distance-to-target).\n *\/\nvoid MainLoop::default_handler_t::mouse_wheel (\n MainLoop *ml, const SDL_Event &e\n) {\n const Uint8 *keystate = SDL_GetKeyboardState(NULL);\n\n if (keystate[SDL_SCANCODE_LCTRL] == 1) {\n \/\/ set fovy\n ml->camera.projection.set_all([ml, e] () {\n auto all = ml->camera.projection.get_all();\n all[0] -= e.wheel.y*4;\n return all;\n }());\n } else {\n \/\/ set camera distance-to-target\n ml->camera.dist =\n 10.0f + std::exp2(std::fabs(\n std::log2(ml->camera.dist - 10.0f) - e.wheel.y*0.2f\n ));\n ml->camera.recompute_rotation();\n }\n}\n\n\n\n\n\/**\n * Default mouse-buttons event handler.\n *\/\nvoid MainLoop::default_handler_t::mouse_buttons (\n MainLoop *ml, const SDL_Event &e\n) {\n switch (e.button.button) {\n\n \/\/ look-around camera\n case SDL_BUTTON_MIDDLE:\n case SDL_BUTTON_RIGHT:\n if (e.type == SDL_MOUSEBUTTONDOWN) {\n if (\n ml->camera.pitch > 90.0f &&\n ml->camera.pitch <= 270.0f\n ) {\n ml->handle.mouse_motion =\n [ml] (const SDL_Event &e) -> void {\n return ml->default_handler.look_around_camera(\n ml, e, -1.0f\n );\n };\n } else {\n ml->handle.mouse_motion =\n [ml] (const SDL_Event &e) -> void {\n return ml->default_handler.look_around_camera(\n ml, e, 1.0f\n );\n };\n }\n } else if (e.type == SDL_MOUSEBUTTONUP) {\n ml->handle.mouse_motion =\n [ml] (const SDL_Event &e) -> void {\n return ml->default_handler.empty_mouse_motion(ml, e);\n };\n }\n break;\n\n \/\/ move-around camera\n case SDL_BUTTON_LEFT:\n if (e.type == SDL_MOUSEBUTTONDOWN) {\n ml->handle.mouse_motion =\n [ml] (const SDL_Event &e) -> void {\n return ml->default_handler.move_around_camera(ml, e);\n };\n } else if (e.type == SDL_MOUSEBUTTONUP) {\n ml->handle.mouse_motion =\n [ml] (const SDL_Event &e) -> void {\n return ml->default_handler.empty_mouse_motion(ml, e);\n };\n }\n break;\n\n default:\n break;\n }\n}\n\n\n\n\n\/**\n * Default keyboard event handler.\n *\/\nvoid MainLoop::default_handler_t::keyboard (\n MainLoop *ml, const SDL_Event &e\n) {\n const Uint8 *keystate = SDL_GetKeyboardState(NULL);\n\n if (keystate[SDL_SCANCODE_ESCAPE] == 1) {\n ml->terminate();\n return;\n }\n switch (e.key.keysym.sym) {\n\n case SDLK_q:\n if (e.key.state == SDL_PRESSED) {\n\n ml->terminate();\n }\n break;\n\n case SDLK_c:\n if (e.key.state == SDL_PRESSED) {\n \/\/ reset position\n ml->camera.translation.reset();\n \/\/ reset camera.projection.fovy\n ml->camera.projection.set_all([ml] () {\n auto all = ml->camera.projection.get_all();\n all[0] = 60.0f;\n return all;\n }());\n }\n\n default:\n break;\n }\n}\n\n\n\n\n\/**\n * Default window event handler.\n *\/\nvoid MainLoop::default_handler_t::window (\n MainLoop *ml, const SDL_Event &e\n) {\n switch (e.window.event) {\n case SDL_WINDOWEVENT_SIZE_CHANGED:\n ml->root->viewport.width = e.window.data1;\n ml->root->viewport.height = e.window.data2;\n ml->adjust_camera_aspect();\n break;\n case SDL_WINDOWEVENT_RESIZED:\n std::cout\n << \"Resized surface: \"\n << e.window.data1 << \"x\"\n << e.window.data2\n << std::endl;\n break;\n default:\n break;\n }\n}\n\n\n\n\n\/**\n * Initialize vital components.\n *\/\nMainLoop::MainLoop (Machina *root):\n root{root}\n{\n this->assign_default_handlers();\n this->setup_opengl();\n}\n\n\n\n\n\/**\n * Assign default handlers (mouse\/keyboard).\n *\/\nvoid MainLoop::assign_default_handlers () {\n this->handle.mouse_motion =\n [this] (const SDL_Event &e) -> void {\n return this->default_handler.empty_mouse_motion(this, e);\n };\n this->handle.mouse_wheel =\n [this] (const SDL_Event &e) -> void {\n return this->default_handler.mouse_wheel(this, e);\n };\n this->handle.mouse_buttons =\n [this] (const SDL_Event &e) -> void {\n return this->default_handler.mouse_buttons(this, e);\n };\n this->handle.keyboard =\n [this] (const SDL_Event &e) -> void {\n return this->default_handler.keyboard(this, e);\n };\n this->handle.window =\n [this] (const SDL_Event &e) -> void {\n return this->default_handler.window(this, e);\n };\n}\n\n\n\n\n\/**\n * Adjust camera aspect ratio.\n *\/\ninline void MainLoop::adjust_camera_aspect () {\n glViewport(\n 0, 0,\n this->root->viewport.width, this->root->viewport.height\n );\n this->camera.projection.set_all([this] () {\n auto all = this->camera.projection.get_all();\n all[1] =\n static_cast<GLfloat>(this->root->viewport.width) \/\n static_cast<GLfloat>(this->root->viewport.height);\n return all;\n }());\n}\n\n\n\n\n\n\/**\n * Setup initial OpenGL parameters.\n *\/\nvoid MainLoop::setup_opengl () {\n this->adjust_camera_aspect();\n\n glClearColor(0.05f, 0.05f, 0.15f, 0.0f);\n glPolygonMode(GL_FRONT, GL_FILL);\n glShadeModel(GL_SMOOTH);\n\n glEnable(GL_DEPTH_TEST);\n glDepthFunc(GL_LESS);\n\n glEnable(GL_CULL_FACE);\n glCullFace(GL_BACK);\n glFrontFace(GL_CCW);\n\n glEnable(GL_POINT_SMOOTH);\n glHint(GL_POINT_SMOOTH_HINT, GL_NICEST);\n\n glEnable(GL_LINE_SMOOTH);\n glHint(GL_LINE_SMOOTH_HINT, GL_NICEST);\n\n glEnable(GL_BLEND);\n glBlendFunc(GL_SRC_ALPHA, GL_ONE_MINUS_SRC_ALPHA);\n}\n\n\n\n\n\/**\n * Event-processing.\n *\/\ninline void MainLoop::process_events () {\n while (this->running && SDL_PollEvent(&this->event)) {\n try {\n switch (this->event.type) {\n case SDL_MOUSEMOTION:\n this->handle.mouse_motion(this->event);\n break;\n\n case SDL_MOUSEWHEEL:\n this->handle.mouse_wheel(this->event);\n break;\n\n case SDL_MOUSEBUTTONDOWN:\n case SDL_MOUSEBUTTONUP:\n this->handle.mouse_buttons(this->event);\n break;\n\n case SDL_KEYDOWN:\n case SDL_KEYUP:\n this->handle.keyboard(this->event);\n break;\n\n case SDL_WINDOWEVENT:\n this->handle.window(this->event);\n break;\n\n case SDL_QUIT:\n this->terminate();\n break;\n }\n } catch (std::bad_function_call &e) {\n std::cout\n << \"MainLoop::process_events: \"\n << e.what()\n << std::endl;\n }\n }\n}\n\n\n\n\n\/**\n * Drawing.\n *\/\ninline void MainLoop::draw () const {\n glClear(\n GL_COLOR_BUFFER_BIT |\n GL_DEPTH_BUFFER_BIT\n );\n this->camera.establish_projection();\n this->camera.establish_modelview();\n\n primitives::axes_grid(160.0f, 10.0f);\n\n primitives::point_cube(160.0f*64.0f, 640.0f, 0.6f);\n primitives::this_thing(160.0f*2.0f, 10.0f, 1.0f, 1.0f, 1.0f, GL_POINTS);\n primitives::this_thing(160.0f*16.0f, 80.0f, 0.7f, 1.0f, 0.1f, GL_LINES);\n}\n\n\n\n\n\/**\n * Main application loop.\n *\/\nvoid MainLoop::run () {\n this->running = true;\n while (this->running) {\n this->process_events();\n this->draw();\n SDL_GL_SwapWindow(this->root->main_window);\n }\n}\n\n\n\n\n\/**\n * Gracefully finish.\n *\/\nvoid MainLoop::terminate () {\n this->running = false;\n}\n\n\n\n\n} \/\/ namespace machina\n\n#endif\n<commit_msg>MouseLeft + LCTRL + Mouse-y-motion = camera.out translate.<commit_after>\/**\n * machina\n *\n * Copyright (c) 2014, drmats\n * All rights reserved.\n *\n * https:\/\/github.com\/drmats\/machina\n *\/\n\n#ifndef __MAIN_LOOP_CPP_\n#define __MAIN_LOOP_CPP_ 1\n\n#include \"main_loop.hpp\"\n#include \"machina.hpp\"\n#include \"primitives.hpp\"\n\nnamespace machina {\n\n\n\n\n\/**\n * Default mouse-motion event handler (do-nothing).\n *\/\nvoid MainLoop::default_handler_t::empty_mouse_motion (\n MainLoop *ml, const SDL_Event &e\n) {\n return;\n}\n\n\n\n\n\/**\n * Mouse-motion event handler (look-around).\n *\/\nvoid MainLoop::default_handler_t::look_around_camera (\n MainLoop *ml, const SDL_Event &e, const GLfloat yaw_direction\n) {\n static const auto positive_fmod =\n [] (GLfloat val, GLfloat denom) -> GLfloat {\n return std::fmod(std::fmod(val, denom) + denom, denom);\n };\n ml->camera.pitch = positive_fmod(\n ml->camera.pitch + e.motion.yrel * 0.3f, 360.0f\n );\n ml->camera.yaw = positive_fmod(\n ml->camera.yaw + yaw_direction * e.motion.xrel * 0.3f, 360.0f\n );\n ml->camera.recompute_rotation();\n}\n\n\n\n\n\/**\n * Mouse-motion event handler (move-around).\n *\/\nvoid MainLoop::default_handler_t::move_around_camera (\n MainLoop *ml, const SDL_Event &e\n) {\n const Uint8 *keystate = SDL_GetKeyboardState(NULL);\n\n ml->camera.relative_translate(\n ml->camera.strafe, 1.0,\n e.motion.xrel * ml->camera.dist * 0.00215f\n );\n if (keystate[SDL_SCANCODE_LCTRL] == 1) {\n ml->camera.relative_translate(\n ml->camera.out, 1.0,\n e.motion.yrel * ml->camera.dist * 0.00215f\n );\n } else {\n ml->camera.relative_translate(\n ml->camera.up, -1.0,\n e.motion.yrel * ml->camera.dist * 0.00215f\n );\n }\n}\n\n\n\n\n\/**\n * Mouse-wheel default event handler (distance-to-target).\n *\/\nvoid MainLoop::default_handler_t::mouse_wheel (\n MainLoop *ml, const SDL_Event &e\n) {\n const Uint8 *keystate = SDL_GetKeyboardState(NULL);\n\n if (keystate[SDL_SCANCODE_LCTRL] == 1) {\n \/\/ set fovy\n ml->camera.projection.set_all([ml, e] () {\n auto all = ml->camera.projection.get_all();\n all[0] -= e.wheel.y*4;\n return all;\n }());\n } else {\n \/\/ set camera distance-to-target\n ml->camera.dist =\n 10.0f + std::exp2(std::fabs(\n std::log2(ml->camera.dist - 10.0f) - e.wheel.y*0.2f\n ));\n ml->camera.recompute_rotation();\n }\n}\n\n\n\n\n\/**\n * Default mouse-buttons event handler.\n *\/\nvoid MainLoop::default_handler_t::mouse_buttons (\n MainLoop *ml, const SDL_Event &e\n) {\n switch (e.button.button) {\n\n \/\/ look-around camera\n case SDL_BUTTON_MIDDLE:\n case SDL_BUTTON_RIGHT:\n if (e.type == SDL_MOUSEBUTTONDOWN) {\n if (\n ml->camera.pitch > 90.0f &&\n ml->camera.pitch <= 270.0f\n ) {\n ml->handle.mouse_motion =\n [ml] (const SDL_Event &e) -> void {\n return ml->default_handler.look_around_camera(\n ml, e, -1.0f\n );\n };\n } else {\n ml->handle.mouse_motion =\n [ml] (const SDL_Event &e) -> void {\n return ml->default_handler.look_around_camera(\n ml, e, 1.0f\n );\n };\n }\n } else if (e.type == SDL_MOUSEBUTTONUP) {\n ml->handle.mouse_motion =\n [ml] (const SDL_Event &e) -> void {\n return ml->default_handler.empty_mouse_motion(ml, e);\n };\n }\n break;\n\n \/\/ move-around camera\n case SDL_BUTTON_LEFT:\n if (e.type == SDL_MOUSEBUTTONDOWN) {\n ml->handle.mouse_motion =\n [ml] (const SDL_Event &e) -> void {\n return ml->default_handler.move_around_camera(ml, e);\n };\n } else if (e.type == SDL_MOUSEBUTTONUP) {\n ml->handle.mouse_motion =\n [ml] (const SDL_Event &e) -> void {\n return ml->default_handler.empty_mouse_motion(ml, e);\n };\n }\n break;\n\n default:\n break;\n }\n}\n\n\n\n\n\/**\n * Default keyboard event handler.\n *\/\nvoid MainLoop::default_handler_t::keyboard (\n MainLoop *ml, const SDL_Event &e\n) {\n const Uint8 *keystate = SDL_GetKeyboardState(NULL);\n\n if (keystate[SDL_SCANCODE_ESCAPE] == 1) {\n ml->terminate();\n return;\n }\n switch (e.key.keysym.sym) {\n\n case SDLK_q:\n if (e.key.state == SDL_PRESSED) {\n\n ml->terminate();\n }\n break;\n\n case SDLK_c:\n if (e.key.state == SDL_PRESSED) {\n \/\/ reset position\n ml->camera.translation.reset();\n \/\/ reset camera.projection.fovy\n ml->camera.projection.set_all([ml] () {\n auto all = ml->camera.projection.get_all();\n all[0] = 60.0f;\n return all;\n }());\n }\n\n default:\n break;\n }\n}\n\n\n\n\n\/**\n * Default window event handler.\n *\/\nvoid MainLoop::default_handler_t::window (\n MainLoop *ml, const SDL_Event &e\n) {\n switch (e.window.event) {\n case SDL_WINDOWEVENT_SIZE_CHANGED:\n ml->root->viewport.width = e.window.data1;\n ml->root->viewport.height = e.window.data2;\n ml->adjust_camera_aspect();\n break;\n case SDL_WINDOWEVENT_RESIZED:\n std::cout\n << \"Resized surface: \"\n << e.window.data1 << \"x\"\n << e.window.data2\n << std::endl;\n break;\n default:\n break;\n }\n}\n\n\n\n\n\/**\n * Initialize vital components.\n *\/\nMainLoop::MainLoop (Machina *root):\n root{root}\n{\n this->assign_default_handlers();\n this->setup_opengl();\n}\n\n\n\n\n\/**\n * Assign default handlers (mouse\/keyboard).\n *\/\nvoid MainLoop::assign_default_handlers () {\n this->handle.mouse_motion =\n [this] (const SDL_Event &e) -> void {\n return this->default_handler.empty_mouse_motion(this, e);\n };\n this->handle.mouse_wheel =\n [this] (const SDL_Event &e) -> void {\n return this->default_handler.mouse_wheel(this, e);\n };\n this->handle.mouse_buttons =\n [this] (const SDL_Event &e) -> void {\n return this->default_handler.mouse_buttons(this, e);\n };\n this->handle.keyboard =\n [this] (const SDL_Event &e) -> void {\n return this->default_handler.keyboard(this, e);\n };\n this->handle.window =\n [this] (const SDL_Event &e) -> void {\n return this->default_handler.window(this, e);\n };\n}\n\n\n\n\n\/**\n * Adjust camera aspect ratio.\n *\/\ninline void MainLoop::adjust_camera_aspect () {\n glViewport(\n 0, 0,\n this->root->viewport.width, this->root->viewport.height\n );\n this->camera.projection.set_all([this] () {\n auto all = this->camera.projection.get_all();\n all[1] =\n static_cast<GLfloat>(this->root->viewport.width) \/\n static_cast<GLfloat>(this->root->viewport.height);\n return all;\n }());\n}\n\n\n\n\n\n\/**\n * Setup initial OpenGL parameters.\n *\/\nvoid MainLoop::setup_opengl () {\n this->adjust_camera_aspect();\n\n glClearColor(0.05f, 0.05f, 0.15f, 0.0f);\n glPolygonMode(GL_FRONT, GL_FILL);\n glShadeModel(GL_SMOOTH);\n\n glEnable(GL_DEPTH_TEST);\n glDepthFunc(GL_LESS);\n\n glEnable(GL_CULL_FACE);\n glCullFace(GL_BACK);\n glFrontFace(GL_CCW);\n\n glEnable(GL_POINT_SMOOTH);\n glHint(GL_POINT_SMOOTH_HINT, GL_NICEST);\n\n glEnable(GL_LINE_SMOOTH);\n glHint(GL_LINE_SMOOTH_HINT, GL_NICEST);\n\n glEnable(GL_BLEND);\n glBlendFunc(GL_SRC_ALPHA, GL_ONE_MINUS_SRC_ALPHA);\n}\n\n\n\n\n\/**\n * Event-processing.\n *\/\ninline void MainLoop::process_events () {\n while (this->running && SDL_PollEvent(&this->event)) {\n try {\n switch (this->event.type) {\n case SDL_MOUSEMOTION:\n this->handle.mouse_motion(this->event);\n break;\n\n case SDL_MOUSEWHEEL:\n this->handle.mouse_wheel(this->event);\n break;\n\n case SDL_MOUSEBUTTONDOWN:\n case SDL_MOUSEBUTTONUP:\n this->handle.mouse_buttons(this->event);\n break;\n\n case SDL_KEYDOWN:\n case SDL_KEYUP:\n this->handle.keyboard(this->event);\n break;\n\n case SDL_WINDOWEVENT:\n this->handle.window(this->event);\n break;\n\n case SDL_QUIT:\n this->terminate();\n break;\n }\n } catch (std::bad_function_call &e) {\n std::cout\n << \"MainLoop::process_events: \"\n << e.what()\n << std::endl;\n }\n }\n}\n\n\n\n\n\/**\n * Drawing.\n *\/\ninline void MainLoop::draw () const {\n glClear(\n GL_COLOR_BUFFER_BIT |\n GL_DEPTH_BUFFER_BIT\n );\n this->camera.establish_projection();\n this->camera.establish_modelview();\n\n primitives::axes_grid(160.0f, 10.0f);\n\n primitives::point_cube(160.0f*64.0f, 640.0f, 0.6f);\n primitives::this_thing(160.0f*2.0f, 10.0f, 1.0f, 1.0f, 1.0f, GL_POINTS);\n primitives::this_thing(160.0f*16.0f, 80.0f, 0.7f, 1.0f, 0.1f, GL_LINES);\n}\n\n\n\n\n\/**\n * Main application loop.\n *\/\nvoid MainLoop::run () {\n this->running = true;\n while (this->running) {\n this->process_events();\n this->draw();\n SDL_GL_SwapWindow(this->root->main_window);\n }\n}\n\n\n\n\n\/**\n * Gracefully finish.\n *\/\nvoid MainLoop::terminate () {\n this->running = false;\n}\n\n\n\n\n} \/\/ namespace machina\n\n#endif\n<|endoftext|>"} {"text":"<commit_before>#include <stdlib.h>\n\n#include <mruby.h>\n#include <mruby\/variable.h>\n#include <mruby\/data.h>\n#include <mruby\/string.h>\n\n#include <Fl\/Fl_Widget.h>\n\n#include \"macros.h\"\n#include \"helpers.h\"\n#include \"widget.h\"\n#include \"group.h\"\n\n\/\/ FLTK::Widget#align\n\/\/ FLTK::Widget#align=(value)\nIMPLEMENT_FIXNUM_ATTRIBUTE_ACCESSOR( widget, align, Fl_Widget, align );\n\n\/\/ For FLTK::Widget#callback\ntypedef struct {\n mrb_state *mrb;\n mrb_value self;\n} mrb_fltk_widget_callback_context;\n\n\/\/ For FLTK::Widget#callback\nvoid mrb_fltk_widget_callback_function( Fl_Widget *fl_widget, void *data ) {\n mrb_fltk_widget_callback_context *context = (mrb_fltk_widget_callback_context *)data;\n mrb_state *mrb = context->mrb;\n mrb_value self = context->self;\n\n mrb_value block = mrb_iv_get( mrb, self, mrb_intern_cstr( mrb, \"callback\" ) );\n\n mrb_funcall_with_block( mrb, self, mrb_intern_cstr( mrb, \"instance_eval\" ), 0, NULL, block );\n}\n\n\/\/ FLTK::Widget#callback\n\/\/ Gets or sets the current callback function for the widget.\nmrb_value mrb_fltk_widget_callback_instance_method( mrb_state *mrb, mrb_value self ) {\n GET_DATA( fl_widget, Fl_Widget, self );\n\n mrb_value block = mrb_nil_value();\n\n mrb_get_args( mrb, \"&\", &block );\n\n if( !mrb_nil_p( block ) ) {\n \/\/ TODO: Free the existing context struct if it already exists?\n mrb_iv_set( mrb, self, mrb_intern_cstr( mrb, \"callback\" ), block );\n\n mrb_fltk_widget_callback_context *context = (mrb_fltk_widget_callback_context *)malloc( sizeof( mrb_fltk_widget_callback_context ) );\n context->mrb = mrb;\n context->self = self;\n\n fl_widget->callback( mrb_fltk_widget_callback_function, context );\n } else {\n block = mrb_iv_get( mrb, self, mrb_intern_cstr( mrb, \"callback\" ) );\n }\n\n return block;\n}\n\n\/\/ FLTK::Widget#height\nIMPLEMENT_FIXNUM_ATTRIBUTE_READER( widget, height, Fl_Widget, h );\n\n\/\/ FLTK::Widget#image\n\/\/ Gets the image that is used as part of the widget label.\n\/\/ mrb_value\n\/\/ mrb_fltk_widget_image_get_method( mrb_state *mrb, mrb_value self ) {\n\/\/ CONTEXT_SETUP( widget );\n\/\/\n\/\/ struct RClass *mrb_fltk_class, *mrb_fltk_image_class;\n\/\/\n\/\/ mrb_fltk_class = mrb_class_get( mrb, \"FLTK\" );\n\/\/ mrb_fltk_image_class = mrb_class_ptr( mrb_const_get( mrb, mrb_obj_value( mrb_fltk_class ), mrb_intern_cstr( mrb, \"Image\" ) ) );\n\/\/\n\/\/ mrb_value args[1];\n\/\/ args[0] = mrb_obj_value(\n\/\/ Data_Wrap_Struct( mrb, mrb->object_class, &fltk_image_type, (void *)context->fl_instance->image() ) );\n\/\/\n\/\/ return mrb_class_new_instance( mrb, 1, args, mrb_fltk_image_class );\n\/\/ }\n\n\/\/ FLTK::Widget#image=(image)\n\/\/ Sets the image to use as part of the widget label. Must be a FLTK::Image\n\/\/ mrb_value\n\/\/ mrb_fltk_widget_image_set_method( mrb_state *mrb, mrb_value self ) { \/\/ TODO: Must be a FLTK::Image\n\/\/ CONTEXT_SETUP( widget );\n\/\/\n\/\/ mrb_value image;\n\/\/ mrb_get_args( mrb, \"o\", &image );\n\/\/\n\/\/ if( !mrb_nil_p( image ) ) {\n\/\/ mrb_value image_value_context;\n\/\/ mrb_fltk_image_context *image_context;\n\/\/\n\/\/ image_value_context = mrb_iv_get( mrb, image, mrb_intern_cstr( mrb, \"context\" ) );\n\/\/ Data_Get_Struct( mrb, image_value_context, &fltk_image_type, image_context );\n\/\/\n\/\/ context->fl_instance->image( (Fl_Image *)image_context->fl_instance );\n\/\/ } else {\n\/\/ context->fl_instance->image( NULL ); \/\/ TODO Raise Error!\n\/\/ }\n\/\/\n\/\/ return mrb_nil_value();\n\/\/ }\n\n\/\/ FLTK::Widget#hide\n\/\/ Makes a widget invisible.\nmrb_value mrb_fltk_widget_hide_instance_method( mrb_state *mrb, mrb_value self ) {\n GET_DATA( fl_widget, Fl_Widget, self );\n\n fl_widget->hide();\n\n return self;\n}\n\n\/\/ FLTK::Widget#label\n\/\/ FLTK::Widget#label=(value)\nIMPLEMENT_STRING_ATTRIBUTE_ACCESSOR( widget, label, Fl_Widget, label );\n\n\/\/ FLTK::Widget#label_font\n\/\/ FLTK::Widget#label_font=(value)\nIMPLEMENT_FIXNUM_ATTRIBUTE_ACCESSOR( widget, label_font, Fl_Widget, labelfont );\n\n\/\/ FLTK::Widget#label_size\n\/\/ FLTK::Widget#label_size=(value)\nIMPLEMENT_FIXNUM_ATTRIBUTE_ACCESSOR( widget, label_size, Fl_Widget, labelsize );\n\n\/\/ FLTK::Widget#parent\n\/\/ Returns the parent widget\nmrb_value mrb_fltk_widget_parent_instance_method( mrb_state *mrb, mrb_value self ) {\n GET_DATA( fl_widget, Fl_Widget, self ); \/\/ TODO: Needed?\n\n return mrb_iv_get( mrb, self, mrb_intern_cstr( mrb, \"parent\" ) );\n}\n\n\/\/ FLTK::Widget#redraw\nmrb_value mrb_fltk_widget_redraw_instance_method( mrb_state *mrb, mrb_value self ) {\n GET_DATA( fl_widget, Fl_Widget, self );\n\n fl_widget->redraw();\n\n return self;\n}\n\n\/\/ FLTK::Widget#show\n\/\/ Makes a widget visible.\nmrb_value mrb_fltk_widget_show_instance_method( mrb_state *mrb, mrb_value self ) {\n GET_DATA( fl_widget, Fl_Widget, self );\n\n fl_widget->show();\n\n return self;\n}\n\n\/\/ FLTK::Widget#take_focus\n\/\/ Gives the widget the keyboard focus.\nmrb_value mrb_fltk_widget_take_focus_instance_method( mrb_state *mrb, mrb_value self ) {\n GET_DATA( fl_widget, Fl_Widget, self );\n\n fl_widget->take_focus();\n\n return self;\n}\n\n\/\/ FLTK::Widget#visible?\n\/\/ Returns whether a widget is visible.\nmrb_value mrb_fltk_widget_visible_instance_method( mrb_state *mrb, mrb_value self ) {\n GET_DATA( fl_widget, Fl_Widget, self );\n\n return fl_widget->visible() ? mrb_true_value() : mrb_false_value();\n}\n\n\/\/ FLTK::Widget#when\n\/\/ Returns the conditions under which the callback is called.\n\/\/ FLTK::Widget#when=(value)\n\/\/ Sets the flags used to decide when a callback is called.\nIMPLEMENT_FIXNUM_ATTRIBUTE_ACCESSOR( widget, when, Fl_Widget, when );\n\n\/\/ FLTK::Widget#width\nIMPLEMENT_FIXNUM_ATTRIBUTE_READER( widget, width, Fl_Widget, w );\n\n\/\/ FLTK::Widget#x\nIMPLEMENT_FIXNUM_ATTRIBUTE_READER( widget, x, Fl_Widget, x );\n\n\/\/ FLTK::Widget#y\nIMPLEMENT_FIXNUM_ATTRIBUTE_READER( widget, y, Fl_Widget, y );\n\nvoid mrb_fltk_widget_class_init( mrb_state *mrb ) {\n ARENA_SAVE;\n\n struct RClass *mrb_fltk_module = mrb_class_get( mrb, \"FLTK\" );\n\n DEFINE_CLASS( widget, Widget, mrb->object_class );\n\n DEFINE_INSTANCE_METHOD_ACCESSOR( widget, align );\n \/\/ DEFINE_FIXNUM_ATTRIBUTE_ACCESSOR( widget, box, Fl_Widget, box );\n DEFINE_INSTANCE_METHOD( widget, callback, ARGS_OPT( 1 ) );\n DEFINE_INSTANCE_METHOD_GETTER( widget, height );\n DEFINE_INSTANCE_METHOD( widget, hide, ARGS_NONE() );\n DEFINE_INSTANCE_METHOD_ACCESSOR( widget, label );\n DEFINE_INSTANCE_METHOD_ACCESSOR( widget, label_font );\n DEFINE_INSTANCE_METHOD_ACCESSOR( widget, label_size );\n \/\/ DEFINE_FIXNUM_ATTRIBUTE_ACCESSOR( widget, label_size, Fl_Widget, labelsize );\n DEFINE_INSTANCE_METHOD( widget, parent, ARGS_NONE() );\n DEFINE_INSTANCE_METHOD( widget, redraw, ARGS_NONE() );\n DEFINE_INSTANCE_METHOD( widget, show, ARGS_NONE() );\n DEFINE_INSTANCE_METHOD( widget, take_focus, ARGS_NONE() );\n mrb_define_method( mrb, mrb_fltk_widget, \"visible?\", mrb_fltk_widget_visible_instance_method, ARGS_NONE() ); \/\/ TODO: DEFINE_INSTANCE_QUERY_METHOD macro\n DEFINE_INSTANCE_METHOD_ACCESSOR( widget, when );\n DEFINE_INSTANCE_METHOD_GETTER( widget, width );\n DEFINE_INSTANCE_METHOD_GETTER( widget, x );\n DEFINE_INSTANCE_METHOD_GETTER( widget, y );\n\n \/\/ mrb_define_method( mrb, mrb_fltk_widget_class, \"image\", mrb_fltk_widget_image_getter_instance_method, ARGS_NONE() );\n \/\/ mrb_define_method( mrb, mrb_fltk_widget_class, \"image=\", mrb_fltk_widget_image_setter_instance_method, ARGS_REQ( 1 ) );\n\n ARENA_RESTORE;\n}\n<commit_msg>FLTK::Widget #activate and #deactivate<commit_after>#include <stdlib.h>\n\n#include <mruby.h>\n#include <mruby\/variable.h>\n#include <mruby\/data.h>\n#include <mruby\/string.h>\n\n#include <Fl\/Fl_Widget.h>\n\n#include \"macros.h\"\n#include \"helpers.h\"\n#include \"widget.h\"\n#include \"group.h\"\n\n\/\/ FLTK::Widget#activate\n\/\/ Activate the widget.\nmrb_value mrb_fltk_widget_activate_instance_method( mrb_state *mrb, mrb_value self ) {\n GET_DATA( fl_widget, Fl_Widget, self );\n\n fl_widget->activate();\n\n return self;\n}\n\n\/\/ FLTK::Widget#align\n\/\/ FLTK::Widget#align=(value)\nIMPLEMENT_FIXNUM_ATTRIBUTE_ACCESSOR( widget, align, Fl_Widget, align );\n\n\/\/ For FLTK::Widget#callback\ntypedef struct {\n mrb_state *mrb;\n mrb_value self;\n} mrb_fltk_widget_callback_context;\n\n\/\/ For FLTK::Widget#callback\nvoid mrb_fltk_widget_callback_function( Fl_Widget *fl_widget, void *data ) {\n mrb_fltk_widget_callback_context *context = (mrb_fltk_widget_callback_context *)data;\n mrb_state *mrb = context->mrb;\n mrb_value self = context->self;\n\n mrb_value block = mrb_iv_get( mrb, self, mrb_intern_cstr( mrb, \"callback\" ) );\n\n mrb_funcall_with_block( mrb, self, mrb_intern_cstr( mrb, \"instance_eval\" ), 0, NULL, block );\n}\n\n\/\/ FLTK::Widget#callback\n\/\/ Gets or sets the current callback function for the widget.\nmrb_value mrb_fltk_widget_callback_instance_method( mrb_state *mrb, mrb_value self ) {\n GET_DATA( fl_widget, Fl_Widget, self );\n\n mrb_value block = mrb_nil_value();\n\n mrb_get_args( mrb, \"&\", &block );\n\n if( !mrb_nil_p( block ) ) {\n \/\/ TODO: Free the existing context struct if it already exists?\n mrb_iv_set( mrb, self, mrb_intern_cstr( mrb, \"callback\" ), block );\n\n mrb_fltk_widget_callback_context *context = (mrb_fltk_widget_callback_context *)malloc( sizeof( mrb_fltk_widget_callback_context ) );\n context->mrb = mrb;\n context->self = self;\n\n fl_widget->callback( mrb_fltk_widget_callback_function, context );\n } else {\n block = mrb_iv_get( mrb, self, mrb_intern_cstr( mrb, \"callback\" ) );\n }\n\n return block;\n}\n\n\/\/ FLTK::Widget#deactivate\n\/\/ Activate the widget.\nmrb_value mrb_fltk_widget_deactivate_instance_method( mrb_state *mrb, mrb_value self ) {\n GET_DATA( fl_widget, Fl_Widget, self );\n\n fl_widget->deactivate();\n\n return self;\n}\n\n\/\/ FLTK::Widget#height\nIMPLEMENT_FIXNUM_ATTRIBUTE_READER( widget, height, Fl_Widget, h );\n\n\/\/ FLTK::Widget#image\n\/\/ Gets the image that is used as part of the widget label.\n\/\/ mrb_value\n\/\/ mrb_fltk_widget_image_get_method( mrb_state *mrb, mrb_value self ) {\n\/\/ CONTEXT_SETUP( widget );\n\/\/\n\/\/ struct RClass *mrb_fltk_class, *mrb_fltk_image_class;\n\/\/\n\/\/ mrb_fltk_class = mrb_class_get( mrb, \"FLTK\" );\n\/\/ mrb_fltk_image_class = mrb_class_ptr( mrb_const_get( mrb, mrb_obj_value( mrb_fltk_class ), mrb_intern_cstr( mrb, \"Image\" ) ) );\n\/\/\n\/\/ mrb_value args[1];\n\/\/ args[0] = mrb_obj_value(\n\/\/ Data_Wrap_Struct( mrb, mrb->object_class, &fltk_image_type, (void *)context->fl_instance->image() ) );\n\/\/\n\/\/ return mrb_class_new_instance( mrb, 1, args, mrb_fltk_image_class );\n\/\/ }\n\n\/\/ FLTK::Widget#image=(image)\n\/\/ Sets the image to use as part of the widget label. Must be a FLTK::Image\n\/\/ mrb_value\n\/\/ mrb_fltk_widget_image_set_method( mrb_state *mrb, mrb_value self ) { \/\/ TODO: Must be a FLTK::Image\n\/\/ CONTEXT_SETUP( widget );\n\/\/\n\/\/ mrb_value image;\n\/\/ mrb_get_args( mrb, \"o\", &image );\n\/\/\n\/\/ if( !mrb_nil_p( image ) ) {\n\/\/ mrb_value image_value_context;\n\/\/ mrb_fltk_image_context *image_context;\n\/\/\n\/\/ image_value_context = mrb_iv_get( mrb, image, mrb_intern_cstr( mrb, \"context\" ) );\n\/\/ Data_Get_Struct( mrb, image_value_context, &fltk_image_type, image_context );\n\/\/\n\/\/ context->fl_instance->image( (Fl_Image *)image_context->fl_instance );\n\/\/ } else {\n\/\/ context->fl_instance->image( NULL ); \/\/ TODO Raise Error!\n\/\/ }\n\/\/\n\/\/ return mrb_nil_value();\n\/\/ }\n\n\/\/ FLTK::Widget#hide\n\/\/ Makes a widget invisible.\nmrb_value mrb_fltk_widget_hide_instance_method( mrb_state *mrb, mrb_value self ) {\n GET_DATA( fl_widget, Fl_Widget, self );\n\n fl_widget->hide();\n\n return self;\n}\n\n\/\/ FLTK::Widget#label\n\/\/ FLTK::Widget#label=(value)\nIMPLEMENT_STRING_ATTRIBUTE_ACCESSOR( widget, label, Fl_Widget, label );\n\n\/\/ FLTK::Widget#label_font\n\/\/ FLTK::Widget#label_font=(value)\nIMPLEMENT_FIXNUM_ATTRIBUTE_ACCESSOR( widget, label_font, Fl_Widget, labelfont );\n\n\/\/ FLTK::Widget#label_size\n\/\/ FLTK::Widget#label_size=(value)\nIMPLEMENT_FIXNUM_ATTRIBUTE_ACCESSOR( widget, label_size, Fl_Widget, labelsize );\n\n\/\/ FLTK::Widget#parent\n\/\/ Returns the parent widget\nmrb_value mrb_fltk_widget_parent_instance_method( mrb_state *mrb, mrb_value self ) {\n return mrb_iv_get( mrb, self, mrb_intern_cstr( mrb, \"parent\" ) );\n}\n\n\/\/ FLTK::Widget#redraw\nmrb_value mrb_fltk_widget_redraw_instance_method( mrb_state *mrb, mrb_value self ) {\n GET_DATA( fl_widget, Fl_Widget, self );\n\n fl_widget->redraw();\n\n return self;\n}\n\n\/\/ FLTK::Widget#show\n\/\/ Makes a widget visible.\nmrb_value mrb_fltk_widget_show_instance_method( mrb_state *mrb, mrb_value self ) {\n GET_DATA( fl_widget, Fl_Widget, self );\n\n fl_widget->show();\n\n return self;\n}\n\n\/\/ FLTK::Widget#take_focus\n\/\/ Gives the widget the keyboard focus.\nmrb_value mrb_fltk_widget_take_focus_instance_method( mrb_state *mrb, mrb_value self ) {\n GET_DATA( fl_widget, Fl_Widget, self );\n\n fl_widget->take_focus();\n\n return self;\n}\n\n\/\/ FLTK::Widget#visible?\n\/\/ Returns whether a widget is visible.\nmrb_value mrb_fltk_widget_visible_instance_method( mrb_state *mrb, mrb_value self ) {\n GET_DATA( fl_widget, Fl_Widget, self );\n\n return fl_widget->visible() ? mrb_true_value() : mrb_false_value();\n}\n\n\/\/ FLTK::Widget#when\n\/\/ Returns the conditions under which the callback is called.\n\/\/ FLTK::Widget#when=(value)\n\/\/ Sets the flags used to decide when a callback is called.\nIMPLEMENT_FIXNUM_ATTRIBUTE_ACCESSOR( widget, when, Fl_Widget, when );\n\n\/\/ FLTK::Widget#width\nIMPLEMENT_FIXNUM_ATTRIBUTE_READER( widget, width, Fl_Widget, w );\n\n\/\/ FLTK::Widget#x\nIMPLEMENT_FIXNUM_ATTRIBUTE_READER( widget, x, Fl_Widget, x );\n\n\/\/ FLTK::Widget#y\nIMPLEMENT_FIXNUM_ATTRIBUTE_READER( widget, y, Fl_Widget, y );\n\nvoid mrb_fltk_widget_class_init( mrb_state *mrb ) {\n ARENA_SAVE;\n\n struct RClass *mrb_fltk_module = mrb_class_get( mrb, \"FLTK\" );\n\n DEFINE_CLASS( widget, Widget, mrb->object_class );\n\n DEFINE_INSTANCE_METHOD( widget, activate, ARGS_NONE() );\n DEFINE_INSTANCE_METHOD_ACCESSOR( widget, align );\n \/\/ DEFINE_FIXNUM_ATTRIBUTE_ACCESSOR( widget, box, Fl_Widget, box );\n DEFINE_INSTANCE_METHOD( widget, callback, ARGS_OPT( 1 ) );\n DEFINE_INSTANCE_METHOD( widget, deactivate, ARGS_NONE() );\n DEFINE_INSTANCE_METHOD_GETTER( widget, height );\n DEFINE_INSTANCE_METHOD( widget, hide, ARGS_NONE() );\n DEFINE_INSTANCE_METHOD_ACCESSOR( widget, label );\n DEFINE_INSTANCE_METHOD_ACCESSOR( widget, label_font );\n DEFINE_INSTANCE_METHOD_ACCESSOR( widget, label_size );\n \/\/ DEFINE_FIXNUM_ATTRIBUTE_ACCESSOR( widget, label_size, Fl_Widget, labelsize );\n DEFINE_INSTANCE_METHOD( widget, parent, ARGS_NONE() );\n DEFINE_INSTANCE_METHOD( widget, redraw, ARGS_NONE() );\n DEFINE_INSTANCE_METHOD( widget, show, ARGS_NONE() );\n DEFINE_INSTANCE_METHOD( widget, take_focus, ARGS_NONE() );\n mrb_define_method( mrb, mrb_fltk_widget, \"visible?\", mrb_fltk_widget_visible_instance_method, ARGS_NONE() ); \/\/ TODO: DEFINE_INSTANCE_QUERY_METHOD macro\n DEFINE_INSTANCE_METHOD_ACCESSOR( widget, when );\n DEFINE_INSTANCE_METHOD_GETTER( widget, width );\n DEFINE_INSTANCE_METHOD_GETTER( widget, x );\n DEFINE_INSTANCE_METHOD_GETTER( widget, y );\n\n \/\/ mrb_define_method( mrb, mrb_fltk_widget_class, \"image\", mrb_fltk_widget_image_getter_instance_method, ARGS_NONE() );\n \/\/ mrb_define_method( mrb, mrb_fltk_widget_class, \"image=\", mrb_fltk_widget_image_setter_instance_method, ARGS_REQ( 1 ) );\n\n ARENA_RESTORE;\n}\n<|endoftext|>"} {"text":"<commit_before>#include \"i2c.h\"\n#include <ppltasks.h>\n#include <vector>\n#include <iostream>\n\nusing v8::FunctionTemplate;\nusing namespace concurrency;\nusing namespace Platform;\nusing namespace Windows::Devices::Enumeration;\n\nNan::Persistent<v8::Function> WinI2c::constructor;\n\nNAN_MODULE_INIT(WinI2c::Init) {\n v8::Local<v8::FunctionTemplate> tpl = Nan::New<v8::FunctionTemplate>(New);\n tpl->SetClassName(Nan::New(\"WinI2c\").ToLocalChecked());\n tpl->InstanceTemplate()->SetInternalFieldCount(6);\n\n Nan::SetPrototypeMethod(tpl, \"openSync\", OpenSync);\n Nan::SetPrototypeMethod(tpl, \"closeSync\", CloseSync);\n Nan::SetPrototypeMethod(tpl, \"read\", Read);\n Nan::SetPrototypeMethod(tpl, \"readPartial\", ReadPartial);\n Nan::SetPrototypeMethod(tpl, \"write\", Write);\n Nan::SetPrototypeMethod(tpl, \"writePartial\", WritePartial);\n Nan::SetPrototypeMethod(tpl, \"writeRead\", WriteRead);\n Nan::SetPrototypeMethod(tpl, \"writeReadPartial\", WriteReadPartial);\n Nan::SetPrototypeMethod(tpl, \"setDevice\", SetDevice);\n\n constructor.Reset(Nan::GetFunction(tpl).ToLocalChecked());\n Nan::Set(target, Nan::New(\"WinI2c\").ToLocalChecked(), Nan::GetFunction(tpl).ToLocalChecked());\n}\n\nWinI2c::WinI2c() {\n RoInitialize(RO_INIT_MULTITHREADED);\n}\n\nWinI2c::~WinI2c() {\n RoUninitialize();\n}\n\nNAN_METHOD(WinI2c::New) {\n if (info.IsConstructCall()) {\n WinI2c *obj = new WinI2c();\n obj->Wrap(info.This());\n info.GetReturnValue().Set(info.This());\n }\n else {\n const int argc = 1;\n v8::Local<v8::Value> argv[argc] = { info[0] };\n v8::Local<v8::Function> cons = Nan::New(constructor);\n info.GetReturnValue().Set(cons->NewInstance(argc, argv));\n }\n}\n\nNAN_METHOD(WinI2c::OpenSync) {\n if (info.Length() < 1 ||\n !info[0]->IsString()) {\n return Nan::ThrowError(Nan::ErrnoException(EINVAL, \"WinI2c::OpenSync\",\n \"incorrect arguments passed to WinI2c::OpenSync\"\n \"(string i2cControllerName)\"));\n }\n\n Nan::HandleScope scope;\n v8::String::Utf8Value str(info[0]->ToString());\n std::string stdStr = std::string(*str);\n std::wstring stdWStr;\n stdWStr.assign(stdStr.begin(), stdStr.end());\n\n String^ deviceSelector = I2cDevice::GetDeviceSelector(ref new Platform::String(stdWStr.c_str()));\n DeviceInformationCollection^ i2cDeviceControllers = create_task(DeviceInformation::FindAllAsync(deviceSelector)).get();\n\n if (nullptr == i2cDeviceControllers) {\n Nan::ThrowError(Nan::ErrnoException(EPERM, \"WinI2c::OpenSync\", \"DeviceInformation::FindAllAsync failed to return controller(s)\"));\n }\n\n WinI2c* obj = Nan::ObjectWrap::Unwrap<WinI2c>(info.This());\n obj->_i2cDeviceId = i2cDeviceControllers->GetAt(0)->Id;\n}\n\nNAN_METHOD(WinI2c::SetDevice) {\n if (info.Length() < 1 ||\n !info[0]->IsInt32()) {\n return Nan::ThrowError(Nan::ErrnoException(EINVAL, \"WinI2c::SetDevice\",\n \"incorrect arguments passed to WinI2c::SetDevice\"\n \"(int deviceAddress)\"));\n }\n\n WinI2c* obj = Nan::ObjectWrap::Unwrap<WinI2c>(info.This());\n\n if(nullptr == obj->_i2cDevice) {\n I2cConnectionSettings^ settings = ref new I2cConnectionSettings(info[0]->Int32Value());\n \n \/\/TODO: Expose as properties for the user to change\n settings->BusSpeed = I2cBusSpeed::FastMode;\n settings->SharingMode = I2cSharingMode::Exclusive;\n \n obj->_i2cDevice = create_task(I2cDevice::FromIdAsync(obj->_i2cDeviceId, settings)).get();\n if (nullptr == obj->_i2cDevice) {\n Nan::ThrowError(Nan::ErrnoException(EPERM, \"WinI2c::SetDevice\", \"I2cDevice::FromIdAsync failed to return an i2c device\"));\n }\n }\n}\n\nNAN_METHOD(WinI2c::CloseSync) {\n WinI2c* obj = Nan::ObjectWrap::Unwrap<WinI2c>(info.This());\n\n \/\/From https:\/\/msdn.microsoft.com\/en-us\/library\/windows.devices.i2c.i2cdevice.close.aspx\n \/\/ You cannot call Close methods through Visual C++ component extensions(C++ \/ CX) on \n \/\/ Windows Runtime class instances where the class implemented IClosable.Instead, C++ \/ CX code \n \/\/ for runtime classes should call the destructor or set the last reference to null.\n obj->_i2cDevice = nullptr;\n}\n\nNAN_METHOD(WinI2c::Read) {\n Nan::ThrowError(Nan::ErrnoException(EPERM, \"WinI2c::Read\", \"Not Implemented\"));\n}\n\nNAN_METHOD(WinI2c::ReadPartial) {\n if (info.Length() < 2 ||\n !info[0]->IsInt32() ||\n !info[1]->IsObject()) {\n return Nan::ThrowError(Nan::ErrnoException(EINVAL, \"WinI2c::ReadPartial\",\n \"incorrect arguments passed to WinI2c::ReadPartial\"\n \"(int length, Buffer buffer)\"));\n }\n\n Nan::HandleScope scope;\n uint32 length = info[0]->Uint32Value();\n v8::Local<v8::Object> bufferHandle = info[1].As<v8::Object>();\n int bytesRead = -1;\n byte* bufferData = (byte*)node::Buffer::Data(bufferHandle);\n size_t bufferLength = node::Buffer::Length(bufferHandle);\n\n if (length > bufferLength) {\n return Nan::ThrowError(Nan::ErrnoException(EINVAL, \"WinI2c::ReadPartial\",\n \"buffer passed to WinI2c::Read contains less than 'length' bytes\"));\n }\n\n auto readBuf = ref new Platform::Array<BYTE>(length);\n WinI2c* obj = Nan::ObjectWrap::Unwrap<WinI2c>(info.This());\n try {\n I2cTransferResult result = obj->_i2cDevice->ReadPartial(readBuf);\n\n switch (result.Status) {\n case I2cTransferStatus::FullTransfer:\n bytesRead = result.BytesTransferred;\n break;\n case I2cTransferStatus::PartialTransfer:\n bytesRead = result.BytesTransferred;\n wprintf(L\"%d bytes partially transferred\\n\", bytesRead);\n break;\n case I2cTransferStatus::SlaveAddressNotAcknowledged:\n wprintf(L\"Slave address was not acknowledged\\n\");\n break;\n default:\n wprintf(L\"Invalid transfer status value\\n\");\n }\n }\n catch (Exception^ e) {\n Nan::ThrowError(Nan::ErrnoException(e->HResult, \"WinI2c::ReadPartial\", \"\"));\n }\n\n for (int i = 0; i < readBuf->Length; i++) {\n bufferData[i] = readBuf[i];\n }\n\n if (bytesRead == -1) {\n return Nan::ThrowError(Nan::ErrnoException(errno, \"WinI2c::ReadPartial\", \"\"));\n }\n\n info.GetReturnValue().Set(Nan::New<v8::Integer>(bytesRead));\n}\n\nNAN_METHOD(WinI2c::Write) {\n if (info.Length() < 1 || !info[0]->IsArray()) {\n return Nan::ThrowError(Nan::ErrnoException(EINVAL, \"WinI2c::Write\",\n \"incorrect arguments passed to WinI2c::Write\"));\n }\n\n Nan::HandleScope scope;\n std::vector<BYTE> bytes;\n v8::Handle<v8::Value> val;\n v8::Local<v8::Array> arr = Nan::New<v8::Array>();\n\n v8::Handle<v8::Array> jsArray = v8::Handle<v8::Array>::Cast(info[0]);\n for (unsigned int i = 0; i < jsArray->Length(); i++) {\n val = jsArray->Get(i);\n bytes.push_back(static_cast<BYTE>(val->Uint32Value()));\n Nan::Set(arr, i, val);\n }\n\n WinI2c* obj = Nan::ObjectWrap::Unwrap<WinI2c>(info.This());\n try {\n obj->_i2cDevice->Write(ArrayReference<BYTE>(bytes.data(), static_cast<unsigned int>(bytes.size())));\n } catch (Exception^ e) {\n Nan::ThrowError(Nan::ErrnoException(e->HResult, \"WinI2c::Write\", \"\"));\n }\n}\n\nNAN_METHOD(WinI2c::WritePartial) {\n if (info.Length() < 2 ||\n !info[0]->IsInt32() ||\n !info[1]->IsObject()) {\n return Nan::ThrowError(Nan::ErrnoException(EINVAL, \"WinI2c::WritePartial\",\n \"incorrect arguments passed to WinI2c::WritePartial\"\n \"(int length, Buffer buffer)\"));\n }\n \n Nan::HandleScope scope;\n uint32 length = info[0]->Uint32Value();\n v8::Local<v8::Object> bufferHandle = info[1].As<v8::Object>();\n int bytesWritten = -1;\n byte* bufferData = (byte*)node::Buffer::Data(bufferHandle);\n size_t bufferLength = node::Buffer::Length(bufferHandle);\n\n if (length > bufferLength) {\n return Nan::ThrowError(Nan::ErrnoException(EINVAL, \"WinI2c::WritePartial\",\n \"buffer passed to WinI2c::WritePartial contains less than 'length' bytes\"));\n }\n\n auto writeBuf = ref new Platform::Array<BYTE>(length);\n\n for (int i = 0; i < writeBuf->Length; i++) {\n writeBuf->set(i, bufferData[i]);\n }\n\n WinI2c* obj = Nan::ObjectWrap::Unwrap<WinI2c>(info.This());\n try {\n I2cTransferResult result = obj->_i2cDevice->WritePartial(writeBuf);\n switch (result.Status) {\n case I2cTransferStatus::FullTransfer:\n bytesWritten = result.BytesTransferred;\n break;\n case I2cTransferStatus::PartialTransfer:\n bytesWritten = result.BytesTransferred;\n wprintf(L\"%d bytes partially transferred\\n\", bytesWritten);\n break;\n case I2cTransferStatus::SlaveAddressNotAcknowledged:\n wprintf(L\"Slave address was not acknowledged\\n\");\n break;\n default:\n wprintf(L\"Invalid transfer status value\\n\");\n }\n }\n catch (Exception^ e) {\n Nan::ThrowError(Nan::ErrnoException(e->HResult, \"WinI2c::WritePartial\", \"\"));\n }\n\n if (bytesWritten == -1) {\n return Nan::ThrowError(Nan::ErrnoException(errno, \"WinI2c::WritePartial\", \"\"));\n }\n\n info.GetReturnValue().Set(Nan::New<v8::Integer>(bytesWritten));\n}\n\nNAN_METHOD(WinI2c::WriteRead) {\n Nan::ThrowError(Nan::ErrnoException(EPERM, \"WinI2c::WriteRead\", \"Not Implemented\"));\n}\n\nNAN_METHOD(WinI2c::WriteReadPartial) {\n if (info.Length() < 3 ||\n !info[0]->IsInt32() ||\n !info[1]->IsInt32() ||\n !info[2]->IsObject()) {\n return Nan::ThrowError(Nan::ErrnoException(EINVAL, \"WinI2c::WriteReadPartial\",\n \"incorrect arguments passed to WinI2c::WriteReadPartial\"\n \"(int cmd, int length, Buffer buffer)\"));\n }\n\n Nan::HandleScope scope;\n uint32 length = info[1]->Uint32Value();\n v8::Local<v8::Object> bufferHandle = info[2].As<v8::Object>();\n int bytesRead = -1;\n byte* bufferData = (byte*)node::Buffer::Data(bufferHandle);\n size_t bufferLength = node::Buffer::Length(bufferHandle);\n\n if (length > bufferLength) {\n return Nan::ThrowError(Nan::ErrnoException(EINVAL, \"WinI2c::WriteReadPartial\",\n \"buffer passed to WinI2c::WriteReadPartial contains less than 'length' bytes\"));\n }\n \n auto readBuf = ref new Platform::Array<BYTE>(length);\n auto writeBuf = ref new Platform::Array<BYTE>(1);\n writeBuf->set(0, info[0]->Int32Value());\n\n WinI2c* obj = Nan::ObjectWrap::Unwrap<WinI2c>(info.This());\n try {\n I2cTransferResult result = obj->_i2cDevice->WriteReadPartial(writeBuf, readBuf);\n switch (result.Status) {\n case I2cTransferStatus::FullTransfer:\n bytesRead = result.BytesTransferred;\n break;\n case I2cTransferStatus::PartialTransfer:\n bytesRead = result.BytesTransferred;\n wprintf(L\"%d bytes partially transferred\\n\", bytesRead);\n break;\n case I2cTransferStatus::SlaveAddressNotAcknowledged:\n wprintf(L\"Slave address was not acknowledged\\n\");\n break;\n default:\n wprintf(L\"Invalid transfer status value\\n\");\n }\n }\n catch (Exception^ e) {\n Nan::ThrowError(Nan::ErrnoException(e->HResult, \"WinI2c::WriteReadPartial\", \"\"));\n }\n\n for (int i = 0; i < readBuf->Length; i++) {\n bufferData[i] = readBuf[i];\n }\n\n if (bytesRead == -1) {\n return Nan::ThrowError(Nan::ErrnoException(errno, \"WinI2c::WriteReadPartial\", \"\"));\n }\n\n info.GetReturnValue().Set(Nan::New<v8::Integer>(bytesRead));\n}\n\nNODE_MODULE(i2c, WinI2c::Init)\n<commit_msg>Removing unnecessary handlescopes<commit_after>#include \"i2c.h\"\n#include <ppltasks.h>\n#include <vector>\n#include <iostream>\n\nusing v8::FunctionTemplate;\nusing namespace concurrency;\nusing namespace Platform;\nusing namespace Windows::Devices::Enumeration;\n\nNan::Persistent<v8::Function> WinI2c::constructor;\n\nNAN_MODULE_INIT(WinI2c::Init) {\n v8::Local<v8::FunctionTemplate> tpl = Nan::New<v8::FunctionTemplate>(New);\n tpl->SetClassName(Nan::New(\"WinI2c\").ToLocalChecked());\n tpl->InstanceTemplate()->SetInternalFieldCount(6);\n\n Nan::SetPrototypeMethod(tpl, \"openSync\", OpenSync);\n Nan::SetPrototypeMethod(tpl, \"closeSync\", CloseSync);\n Nan::SetPrototypeMethod(tpl, \"read\", Read);\n Nan::SetPrototypeMethod(tpl, \"readPartial\", ReadPartial);\n Nan::SetPrototypeMethod(tpl, \"write\", Write);\n Nan::SetPrototypeMethod(tpl, \"writePartial\", WritePartial);\n Nan::SetPrototypeMethod(tpl, \"writeRead\", WriteRead);\n Nan::SetPrototypeMethod(tpl, \"writeReadPartial\", WriteReadPartial);\n Nan::SetPrototypeMethod(tpl, \"setDevice\", SetDevice);\n\n constructor.Reset(Nan::GetFunction(tpl).ToLocalChecked());\n Nan::Set(target, Nan::New(\"WinI2c\").ToLocalChecked(), Nan::GetFunction(tpl).ToLocalChecked());\n}\n\nWinI2c::WinI2c() {\n RoInitialize(RO_INIT_MULTITHREADED);\n}\n\nWinI2c::~WinI2c() {\n RoUninitialize();\n}\n\nNAN_METHOD(WinI2c::New) {\n if (info.IsConstructCall()) {\n WinI2c *obj = new WinI2c();\n obj->Wrap(info.This());\n info.GetReturnValue().Set(info.This());\n }\n else {\n const int argc = 1;\n v8::Local<v8::Value> argv[argc] = { info[0] };\n v8::Local<v8::Function> cons = Nan::New(constructor);\n info.GetReturnValue().Set(cons->NewInstance(argc, argv));\n }\n}\n\nNAN_METHOD(WinI2c::OpenSync) {\n if (info.Length() < 1 ||\n !info[0]->IsString()) {\n return Nan::ThrowError(Nan::ErrnoException(EINVAL, \"WinI2c::OpenSync\",\n \"incorrect arguments passed to WinI2c::OpenSync\"\n \"(string i2cControllerName)\"));\n }\n\n v8::String::Utf8Value str(info[0]->ToString());\n std::string stdStr = std::string(*str);\n std::wstring stdWStr;\n stdWStr.assign(stdStr.begin(), stdStr.end());\n\n String^ deviceSelector = I2cDevice::GetDeviceSelector(ref new Platform::String(stdWStr.c_str()));\n DeviceInformationCollection^ i2cDeviceControllers = create_task(DeviceInformation::FindAllAsync(deviceSelector)).get();\n\n if (nullptr == i2cDeviceControllers) {\n return Nan::ThrowError(Nan::ErrnoException(EPERM, \"WinI2c::OpenSync\", \"DeviceInformation::FindAllAsync failed to return controller(s)\"));\n }\n\n WinI2c* obj = Nan::ObjectWrap::Unwrap<WinI2c>(info.This());\n obj->_i2cDeviceId = i2cDeviceControllers->GetAt(0)->Id;\n}\n\nNAN_METHOD(WinI2c::SetDevice) {\n if (info.Length() < 1 ||\n !info[0]->IsInt32()) {\n return Nan::ThrowError(Nan::ErrnoException(EINVAL, \"WinI2c::SetDevice\",\n \"incorrect arguments passed to WinI2c::SetDevice\"\n \"(int deviceAddress)\"));\n }\n\n WinI2c* obj = Nan::ObjectWrap::Unwrap<WinI2c>(info.This());\n\n if(nullptr == obj->_i2cDevice) {\n I2cConnectionSettings^ settings = ref new I2cConnectionSettings(info[0]->Int32Value());\n \n \/\/TODO: Expose as properties for the user to change\n settings->BusSpeed = I2cBusSpeed::FastMode;\n settings->SharingMode = I2cSharingMode::Exclusive;\n \n obj->_i2cDevice = create_task(I2cDevice::FromIdAsync(obj->_i2cDeviceId, settings)).get();\n if (nullptr == obj->_i2cDevice) {\n return Nan::ThrowError(Nan::ErrnoException(EPERM, \"WinI2c::SetDevice\", \"I2cDevice::FromIdAsync failed to return an i2c device\"));\n }\n }\n}\n\nNAN_METHOD(WinI2c::CloseSync) {\n WinI2c* obj = Nan::ObjectWrap::Unwrap<WinI2c>(info.This());\n\n \/\/From https:\/\/msdn.microsoft.com\/en-us\/library\/windows.devices.i2c.i2cdevice.close.aspx\n \/\/ You cannot call Close methods through Visual C++ component extensions(C++ \/ CX) on \n \/\/ Windows Runtime class instances where the class implemented IClosable.Instead, C++ \/ CX code \n \/\/ for runtime classes should call the destructor or set the last reference to null.\n obj->_i2cDevice = nullptr;\n}\n\nNAN_METHOD(WinI2c::Read) {\n return Nan::ThrowError(Nan::ErrnoException(EPERM, \"WinI2c::Read\", \"Not Implemented\"));\n}\n\nNAN_METHOD(WinI2c::ReadPartial) {\n if (info.Length() < 2 ||\n !info[0]->IsInt32() ||\n !info[1]->IsObject()) {\n return Nan::ThrowError(Nan::ErrnoException(EINVAL, \"WinI2c::ReadPartial\",\n \"incorrect arguments passed to WinI2c::ReadPartial\"\n \"(int length, Buffer buffer)\"));\n }\n\n uint32 length = info[0]->Uint32Value();\n v8::Local<v8::Object> bufferHandle = info[1].As<v8::Object>();\n int bytesRead = -1;\n byte* bufferData = (byte*)node::Buffer::Data(bufferHandle);\n size_t bufferLength = node::Buffer::Length(bufferHandle);\n\n if (length > bufferLength) {\n return Nan::ThrowError(Nan::ErrnoException(EINVAL, \"WinI2c::ReadPartial\",\n \"buffer passed to WinI2c::Read contains less than 'length' bytes\"));\n }\n\n auto readBuf = ref new Platform::Array<BYTE>(length);\n WinI2c* obj = Nan::ObjectWrap::Unwrap<WinI2c>(info.This());\n try {\n I2cTransferResult result = obj->_i2cDevice->ReadPartial(readBuf);\n\n switch (result.Status) {\n case I2cTransferStatus::FullTransfer:\n bytesRead = result.BytesTransferred;\n break;\n case I2cTransferStatus::PartialTransfer:\n bytesRead = result.BytesTransferred;\n wprintf(L\"%d bytes partially transferred\\n\", bytesRead);\n break;\n case I2cTransferStatus::SlaveAddressNotAcknowledged:\n wprintf(L\"Slave address was not acknowledged\\n\");\n break;\n default:\n wprintf(L\"Invalid transfer status value\\n\");\n }\n }\n catch (Exception^ e) {\n return Nan::ThrowError(Nan::ErrnoException(e->HResult, \"WinI2c::ReadPartial\", \"\"));\n }\n\n for (int i = 0; i < readBuf->Length; i++) {\n bufferData[i] = readBuf[i];\n }\n\n if (bytesRead == -1) {\n return Nan::ThrowError(Nan::ErrnoException(errno, \"WinI2c::ReadPartial\", \"\"));\n }\n\n info.GetReturnValue().Set(Nan::New<v8::Integer>(bytesRead));\n}\n\nNAN_METHOD(WinI2c::Write) {\n if (info.Length() < 1 || !info[0]->IsArray()) {\n return Nan::ThrowError(Nan::ErrnoException(EINVAL, \"WinI2c::Write\",\n \"incorrect arguments passed to WinI2c::Write\"));\n }\n\n std::vector<BYTE> bytes;\n v8::Handle<v8::Value> val;\n v8::Local<v8::Array> arr = Nan::New<v8::Array>();\n\n v8::Handle<v8::Array> jsArray = v8::Handle<v8::Array>::Cast(info[0]);\n for (unsigned int i = 0; i < jsArray->Length(); i++) {\n val = jsArray->Get(i);\n bytes.push_back(static_cast<BYTE>(val->Uint32Value()));\n Nan::Set(arr, i, val);\n }\n\n WinI2c* obj = Nan::ObjectWrap::Unwrap<WinI2c>(info.This());\n try {\n obj->_i2cDevice->Write(ArrayReference<BYTE>(bytes.data(), static_cast<unsigned int>(bytes.size())));\n } catch (Exception^ e) {\n return Nan::ThrowError(Nan::ErrnoException(e->HResult, \"WinI2c::Write\", \"\"));\n }\n}\n\nNAN_METHOD(WinI2c::WritePartial) {\n if (info.Length() < 2 ||\n !info[0]->IsInt32() ||\n !info[1]->IsObject()) {\n return Nan::ThrowError(Nan::ErrnoException(EINVAL, \"WinI2c::WritePartial\",\n \"incorrect arguments passed to WinI2c::WritePartial\"\n \"(int length, Buffer buffer)\"));\n }\n\n uint32 length = info[0]->Uint32Value();\n v8::Local<v8::Object> bufferHandle = info[1].As<v8::Object>();\n int bytesWritten = -1;\n byte* bufferData = (byte*)node::Buffer::Data(bufferHandle);\n size_t bufferLength = node::Buffer::Length(bufferHandle);\n\n if (length > bufferLength) {\n return Nan::ThrowError(Nan::ErrnoException(EINVAL, \"WinI2c::WritePartial\",\n \"buffer passed to WinI2c::WritePartial contains less than 'length' bytes\"));\n }\n\n auto writeBuf = ref new Platform::Array<BYTE>(length);\n\n for (int i = 0; i < writeBuf->Length; i++) {\n writeBuf->set(i, bufferData[i]);\n }\n\n WinI2c* obj = Nan::ObjectWrap::Unwrap<WinI2c>(info.This());\n try {\n I2cTransferResult result = obj->_i2cDevice->WritePartial(writeBuf);\n switch (result.Status) {\n case I2cTransferStatus::FullTransfer:\n bytesWritten = result.BytesTransferred;\n break;\n case I2cTransferStatus::PartialTransfer:\n bytesWritten = result.BytesTransferred;\n wprintf(L\"%d bytes partially transferred\\n\", bytesWritten);\n break;\n case I2cTransferStatus::SlaveAddressNotAcknowledged:\n wprintf(L\"Slave address was not acknowledged\\n\");\n break;\n default:\n wprintf(L\"Invalid transfer status value\\n\");\n }\n }\n catch (Exception^ e) {\n return Nan::ThrowError(Nan::ErrnoException(e->HResult, \"WinI2c::WritePartial\", \"\"));\n }\n\n if (bytesWritten == -1) {\n return Nan::ThrowError(Nan::ErrnoException(errno, \"WinI2c::WritePartial\", \"\"));\n }\n\n info.GetReturnValue().Set(Nan::New<v8::Integer>(bytesWritten));\n}\n\nNAN_METHOD(WinI2c::WriteRead) {\n return Nan::ThrowError(Nan::ErrnoException(EPERM, \"WinI2c::WriteRead\", \"Not Implemented\"));\n}\n\nNAN_METHOD(WinI2c::WriteReadPartial) {\n if (info.Length() < 3 ||\n !info[0]->IsInt32() ||\n !info[1]->IsInt32() ||\n !info[2]->IsObject()) {\n return Nan::ThrowError(Nan::ErrnoException(EINVAL, \"WinI2c::WriteReadPartial\",\n \"incorrect arguments passed to WinI2c::WriteReadPartial\"\n \"(int cmd, int length, Buffer buffer)\"));\n }\n\n uint32 length = info[1]->Uint32Value();\n v8::Local<v8::Object> bufferHandle = info[2].As<v8::Object>();\n int bytesRead = -1;\n byte* bufferData = (byte*)node::Buffer::Data(bufferHandle);\n size_t bufferLength = node::Buffer::Length(bufferHandle);\n\n if (length > bufferLength) {\n return Nan::ThrowError(Nan::ErrnoException(EINVAL, \"WinI2c::WriteReadPartial\",\n \"buffer passed to WinI2c::WriteReadPartial contains less than 'length' bytes\"));\n }\n \n auto readBuf = ref new Platform::Array<BYTE>(length);\n auto writeBuf = ref new Platform::Array<BYTE>(1);\n writeBuf->set(0, info[0]->Int32Value());\n\n WinI2c* obj = Nan::ObjectWrap::Unwrap<WinI2c>(info.This());\n try {\n I2cTransferResult result = obj->_i2cDevice->WriteReadPartial(writeBuf, readBuf);\n switch (result.Status) {\n case I2cTransferStatus::FullTransfer:\n bytesRead = result.BytesTransferred;\n break;\n case I2cTransferStatus::PartialTransfer:\n bytesRead = result.BytesTransferred;\n wprintf(L\"%d bytes partially transferred\\n\", bytesRead);\n break;\n case I2cTransferStatus::SlaveAddressNotAcknowledged:\n wprintf(L\"Slave address was not acknowledged\\n\");\n break;\n default:\n wprintf(L\"Invalid transfer status value\\n\");\n }\n }\n catch (Exception^ e) {\n return Nan::ThrowError(Nan::ErrnoException(e->HResult, \"WinI2c::WriteReadPartial\", \"\"));\n }\n\n for (int i = 0; i < readBuf->Length; i++) {\n bufferData[i] = readBuf[i];\n }\n\n if (bytesRead == -1) {\n return Nan::ThrowError(Nan::ErrnoException(errno, \"WinI2c::WriteReadPartial\", \"\"));\n }\n\n info.GetReturnValue().Set(Nan::New<v8::Integer>(bytesRead));\n}\n\nNODE_MODULE(i2c, WinI2c::Init)\n<|endoftext|>"} {"text":"<commit_before>\/\/ window.cpp\r\n\r\n#ifndef SAMPLES_DIR\r\n#define SAMPLES_DIR \"\"\r\n#endif\r\n\r\n#include <QComboBox>\r\n#include <QDialog>\r\n#include <QFileDialog>\r\n#include <QLabel>\r\n#include <QLineEdit>\r\n#include <QList>\r\n#include <QtMultimedia\/QCameraInfo>\r\n\r\n#include \"window.h\"\r\n\r\nWindow::Window (QWidget* parent)\r\n: QWidget (parent)\r\n, _acquisition ()\r\n, _frame_timer ()\r\n, _holder_layout_img (this)\r\n, _holder_layout_btn (this)\r\n, _layout_app (QBoxLayout::TopToBottom, this)\r\n, _layout_img (&_holder_layout_img)\r\n, _layout_btn (QBoxLayout::LeftToRight, &_holder_layout_btn)\r\n, _btn_pause (\"Pause\", this)\r\n, _btn_reference (\"Set Reference\", this)\r\n, _btn_input (\"Select Input\", this)\r\n, _statusbar (this)\r\n, _augmentation (this) {\r\n _layout_app.addWidget (&_holder_layout_img);\r\n _layout_app.addWidget (&_holder_layout_btn);\r\n _layout_app.addWidget (&_statusbar);\r\n\r\n _layout_img.addWidget (&_augmentation, 0, 0);\r\n _layout_btn.addWidget (&_btn_pause);\r\n _layout_btn.addWidget (&_btn_reference);\r\n _layout_btn.addWidget (&_btn_input);\r\n _statusbar.setSizeGripEnabled (false);\r\n\r\n connect (&_frame_timer, SIGNAL (timeout ()), this, SLOT (timeout ()));\r\n connect (&_btn_pause, SIGNAL (clicked ()), this, SLOT (btn_pause_clicked ()));\r\n connect (&_btn_reference, SIGNAL (clicked ()), this, SLOT (btn_reference_clicked ()));\r\n connect (&_btn_input, SIGNAL (clicked ()), this, SLOT (btn_input_clicked ()));\r\n\r\n _frame_timer.setInterval (1000 \/ _framerate);\r\n _frame_timer.start ();\r\n}\r\n\r\nWindow::~Window () {\r\n}\r\n\r\nQSize Window::minimumSizeHint () const {\r\n return _layout_app.minimumSize ();\r\n}\r\n\r\nQSize Window::sizeHint () const {\r\n return _layout_app.sizeHint ();\r\n}\r\n\r\nvoid Window::keyPressEvent (QKeyEvent* e) {\r\n if (e->key () == Qt::Key_Escape)\r\n close ();\r\n else\r\n QWidget::keyPressEvent (e);\r\n}\r\n\r\nvoid Window::timeout () {\r\n cv::Mat frame;\r\n try {\r\n frame = _acquisition.capture ();\r\n \/\/ call vision here\r\n } catch (const std::runtime_error& e) {\r\n _statusbar.showMessage (\"Select Input\");\r\n frame = cv::Mat (1000, 1000, CV_8UC3, cv::Scalar (0, 0, 0));\r\n }\r\n _augmentation.setBackground (frame.ptr (), frame.cols, frame.rows);\r\n _augmentation.update ();\r\n}\r\n\r\nvoid Window::btn_pause_clicked () {\r\n if (_frame_timer.isActive ()) {\r\n _frame_timer.stop ();\r\n _btn_pause.setText (\"Resume\");\r\n } else {\r\n _frame_timer.start ();\r\n _btn_pause.setText (\"Pause\");\r\n }\r\n}\r\n\r\nvoid Window::btn_reference_clicked () {\r\n \/\/ call vision here\r\n ;\r\n}\r\n\r\nvoid Window::btn_input_clicked () {\r\n \/\/ create dialog ui elements\r\n QDialog dialog (this);\r\n QBoxLayout layout_dialog (QBoxLayout::TopToBottom, &dialog);\r\n QPushButton btn_open_filebrowser (\"Open File Browser\");\r\n QComboBox box_camid;\r\n QLabel label1 (\"Select camera:\");\r\n QLabel label2 (\"Or choose a file:\");\r\n\r\n \/\/ order the ui elements\r\n dialog.setWindowTitle (\"Select Input\");\r\n layout_dialog.addWidget (&label1);\r\n layout_dialog.addWidget (&box_camid);\r\n layout_dialog.addWidget (&label2);\r\n layout_dialog.addWidget (&btn_open_filebrowser);\r\n\r\n \/\/ fill list of cameras\r\n QList<QCameraInfo> cameras = QCameraInfo::availableCameras ();\r\n if (cameras.size () > 0) {\r\n foreach (const QCameraInfo& cameraInfo, cameras) {\r\n box_camid.addItem (cameraInfo.description ());\r\n }\r\n } else {\r\n box_camid.setEnabled (false);\r\n box_camid.addItem (\"No Cameras Found\");\r\n }\r\n\r\n connect (&box_camid, SIGNAL (currentIndexChanged (int)), &dialog, SLOT (close ()));\r\n connect (&box_camid, SIGNAL (currentIndexChanged (int)), this,\r\n SLOT (dialog_box_camid_indexchanged (int)));\r\n connect (&btn_open_filebrowser, SIGNAL (clicked ()), &dialog, SLOT (close ()));\r\n connect (&btn_open_filebrowser, SIGNAL (clicked ()), this,\r\n SLOT (dialog_btn_filebrowser_clicked ()));\r\n\r\n dialog.exec ();\r\n}\r\n\r\nvoid Window::dialog_btn_filebrowser_clicked () {\r\n \/\/ test file\r\n QString file_name = QFileDialog::getOpenFileName (\r\n this, tr (\"Open Video\"), SAMPLES_DIR, tr (\"Videos (*.webm)\"));\r\n\r\n if (!file_name.isEmpty ()) {\r\n _acquisition.source (file_name.toStdString ());\r\n _statusbar.showMessage (QString (\"Set source: \") + file_name, 2000);\r\n }\r\n}\r\n\r\nvoid Window::dialog_box_camid_indexchanged (int idx) {\r\n _acquisition.source (idx);\r\n _statusbar.showMessage (QString (\"Selected camera #\") + QString (idx), 2000);\r\n}\r\n<commit_msg>add default selection option<commit_after>\/\/ window.cpp\r\n\r\n#ifndef SAMPLES_DIR\r\n#define SAMPLES_DIR \"\"\r\n#endif\r\n\r\n#include <QComboBox>\r\n#include <QDialog>\r\n#include <QFileDialog>\r\n#include <QLabel>\r\n#include <QLineEdit>\r\n#include <QList>\r\n#include <QtMultimedia\/QCameraInfo>\r\n\r\n#include \"window.h\"\r\n\r\nWindow::Window (QWidget* parent)\r\n: QWidget (parent)\r\n, _acquisition ()\r\n, _frame_timer ()\r\n, _holder_layout_img (this)\r\n, _holder_layout_btn (this)\r\n, _layout_app (QBoxLayout::TopToBottom, this)\r\n, _layout_img (&_holder_layout_img)\r\n, _layout_btn (QBoxLayout::LeftToRight, &_holder_layout_btn)\r\n, _btn_pause (\"Pause\", this)\r\n, _btn_reference (\"Set Reference\", this)\r\n, _btn_input (\"Select Input\", this)\r\n, _statusbar (this)\r\n, _augmentation (this) {\r\n _layout_app.addWidget (&_holder_layout_img);\r\n _layout_app.addWidget (&_holder_layout_btn);\r\n _layout_app.addWidget (&_statusbar);\r\n\r\n _layout_img.addWidget (&_augmentation, 0, 0);\r\n _layout_btn.addWidget (&_btn_pause);\r\n _layout_btn.addWidget (&_btn_reference);\r\n _layout_btn.addWidget (&_btn_input);\r\n _statusbar.setSizeGripEnabled (false);\r\n\r\n connect (&_frame_timer, SIGNAL (timeout ()), this, SLOT (timeout ()));\r\n connect (&_btn_pause, SIGNAL (clicked ()), this, SLOT (btn_pause_clicked ()));\r\n connect (&_btn_reference, SIGNAL (clicked ()), this, SLOT (btn_reference_clicked ()));\r\n connect (&_btn_input, SIGNAL (clicked ()), this, SLOT (btn_input_clicked ()));\r\n\r\n _frame_timer.setInterval (1000 \/ _framerate);\r\n _frame_timer.start ();\r\n}\r\n\r\nWindow::~Window () {\r\n}\r\n\r\nQSize Window::minimumSizeHint () const {\r\n return _layout_app.minimumSize ();\r\n}\r\n\r\nQSize Window::sizeHint () const {\r\n return _layout_app.sizeHint ();\r\n}\r\n\r\nvoid Window::keyPressEvent (QKeyEvent* e) {\r\n if (e->key () == Qt::Key_Escape)\r\n close ();\r\n else\r\n QWidget::keyPressEvent (e);\r\n}\r\n\r\nvoid Window::timeout () {\r\n cv::Mat frame;\r\n try {\r\n frame = _acquisition.capture ();\r\n \/\/ call vision here\r\n } catch (const std::runtime_error& e) {\r\n _statusbar.showMessage (\"Select Input\");\r\n frame = cv::Mat (1000, 1000, CV_8UC3, cv::Scalar (0, 0, 0));\r\n }\r\n _augmentation.setBackground (frame.ptr (), frame.cols, frame.rows);\r\n _augmentation.update ();\r\n}\r\n\r\nvoid Window::btn_pause_clicked () {\r\n if (_frame_timer.isActive ()) {\r\n _frame_timer.stop ();\r\n _btn_pause.setText (\"Resume\");\r\n } else {\r\n _frame_timer.start ();\r\n _btn_pause.setText (\"Pause\");\r\n }\r\n}\r\n\r\nvoid Window::btn_reference_clicked () {\r\n \/\/ call vision here\r\n ;\r\n}\r\n\r\nvoid Window::btn_input_clicked () {\r\n \/\/ create dialog ui elements\r\n QDialog dialog (this);\r\n QBoxLayout layout_dialog (QBoxLayout::TopToBottom, &dialog);\r\n QPushButton btn_open_filebrowser (\"Open File Browser\");\r\n QComboBox box_camid;\r\n QLabel label1 (\"Select camera:\");\r\n QLabel label2 (\"Or choose a file:\");\r\n\r\n \/\/ order the ui elements\r\n dialog.setWindowTitle (\"Select Input\");\r\n layout_dialog.addWidget (&label1);\r\n layout_dialog.addWidget (&box_camid);\r\n layout_dialog.addWidget (&label2);\r\n layout_dialog.addWidget (&btn_open_filebrowser);\r\n\r\n \/\/ fill list of cameras\r\n QList<QCameraInfo> cameras = QCameraInfo::availableCameras ();\r\n if (cameras.size () > 0) {\r\n box_camid.addItem (\"Select Camera\");\r\n foreach (const QCameraInfo& cameraInfo, cameras) {\r\n box_camid.addItem (cameraInfo.description ());\r\n }\r\n } else {\r\n box_camid.setEnabled (false);\r\n box_camid.addItem (\"No Cameras Found\");\r\n }\r\n\r\n connect (&box_camid, SIGNAL (currentIndexChanged (int)), &dialog, SLOT (close ()));\r\n connect (&box_camid, SIGNAL (currentIndexChanged (int)), this,\r\n SLOT (dialog_box_camid_indexchanged (int)));\r\n connect (&btn_open_filebrowser, SIGNAL (clicked ()), &dialog, SLOT (close ()));\r\n connect (&btn_open_filebrowser, SIGNAL (clicked ()), this,\r\n SLOT (dialog_btn_filebrowser_clicked ()));\r\n\r\n dialog.exec ();\r\n}\r\n\r\nvoid Window::dialog_btn_filebrowser_clicked () {\r\n \/\/ test file\r\n QString file_name = QFileDialog::getOpenFileName (\r\n this, tr (\"Open Video\"), SAMPLES_DIR, tr (\"Videos (*.webm)\"));\r\n\r\n if (!file_name.isEmpty ()) {\r\n _acquisition.source (file_name.toStdString ());\r\n _statusbar.showMessage (QString (\"Set source: \") + file_name, 2000);\r\n }\r\n}\r\n\r\nvoid Window::dialog_box_camid_indexchanged (int idx) {\r\n _acquisition.source (idx);\r\n _statusbar.showMessage (QString (\"Selected camera #\") + QString (idx), 2000);\r\n}\r\n<|endoftext|>"} {"text":"<commit_before>#include <unittest.hpp>\n#include <mmm.hpp>\n\nnamespace {\n\n auto constructors_1 = UnitTest(\"vector constructors 1\", +[] {\n vec4 v;\n vec4 u(0);\n vec4 t{0};\n vec4 s = vec4();\n vec4 r = vec4(0);\n\n if (v != u) return false;\n if (u != t) return false;\n if (t != s) return false;\n if (s != r) return false;\n if (r != 0) return false;\n\n return true;\n });\n auto constructors_2 = UnitTest(\"vector constructors 2\", +[] {\n vec2 v = vec2(3, 4);\n vec3 u = vec3(2, v);\n vec4 t = vec4(1, u);\n\n if (t != vec4(1, 2, 3, 4)) return false;\n\n return true;\n });\n auto constructors_3 = UnitTest(\"vector constructors 3\", +[] {\n vec2 v = vec2(1, 2);\n vec2 u = vec2(3, 4);\n vec4 t = vec4(v, u);\n\n vec<10> s = vec<10>(0, t, u + 2, v + 6, 9);\n\n if (s != vec<10>(0, 1, 2, 3, 4, 5, 6, 7, 8, 9)) return false;\n\n return true;\n });\n auto constructors_4 = UnitTest(\"vector constructors 4\", +[] {\n vec4 v = vec4(8, 7, 6, 1);\n vec4 u = vec4(2, 3, 5, 4);\n vec4 t = vec4(12, 10, 11, 13);\n vec4 s = vec4(0);\n\n vec<15> r = vec<15>(s.x, v.w, u.xywz, v.zyx, 9, t.yzxw, 14);\n\n if (r != vec<15>(0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14))\n return false;\n\n return true;\n });\n\n auto index = UnitTest(\"vector index\", +[] {\n vec4 v = vec4(1, 2, 3, 4);\n\n float& x = v[0];\n x = 0;\n if (v[0] != 0) return false;\n\n float y = v[1];\n y = 73;\n if (v[1] != 2) return false;\n\n v[2] = 12;\n if (v[2] != 12) return false;\n\n v.data[3] = -1;\n if (v[3] != -1) return false;\n\n return true;\n });\n\n auto array_cast = UnitTest(\"vector array_cast\", +[] {\n ivec4 v = ivec4(8, 7, 6, 5);\n int* i = v;\n\n if (i[0] != 8 and i[1] != 7 and i[2] != 6 and i[3] != 5) return false;\n\n return true;\n });\n\n auto swiz_func = UnitTest(\"vector swizzleElems\", +[] {\n ivec<9> v = ivec<9>(0, 1, 2, 10, 11, 12, 20, 21, 22);\n\n ivec3 u = v.swizzleElems<3, 4, 5>() += 100;\n if (u != ivec3(110, 111, 112)) return false;\n if (v != ivec<9>(0, 1, 2, 110, 111, 112, 20, 21, 22)) return false;\n\n return true;\n });\n}\n<commit_msg>added test for swizzle ranges<commit_after>#include <unittest.hpp>\n#include <mmm.hpp>\n\nnamespace {\n\n auto constructors_1 = UnitTest(\"vector constructors 1\", +[] {\n vec4 v;\n vec4 u(0);\n vec4 t{0};\n vec4 s = vec4();\n vec4 r = vec4(0);\n\n if (v != u) return false;\n if (u != t) return false;\n if (t != s) return false;\n if (s != r) return false;\n if (r != 0) return false;\n\n return true;\n });\n auto constructors_2 = UnitTest(\"vector constructors 2\", +[] {\n vec2 v = vec2(3, 4);\n vec3 u = vec3(2, v);\n vec4 t = vec4(1, u);\n\n if (t != vec4(1, 2, 3, 4)) return false;\n\n return true;\n });\n auto constructors_3 = UnitTest(\"vector constructors 3\", +[] {\n vec2 v = vec2(1, 2);\n vec2 u = vec2(3, 4);\n vec4 t = vec4(v, u);\n\n vec<10> s = vec<10>(0, t, u + 2, v + 6, 9);\n\n if (s != vec<10>(0, 1, 2, 3, 4, 5, 6, 7, 8, 9)) return false;\n\n return true;\n });\n auto constructors_4 = UnitTest(\"vector constructors 4\", +[] {\n vec4 v = vec4(8, 7, 6, 1);\n vec4 u = vec4(2, 3, 5, 4);\n vec4 t = vec4(12, 10, 11, 13);\n vec4 s = vec4(0);\n\n vec<15> r = vec<15>(s.x, v.w, u.xywz, v.zyx, 9, t.yzxw, 14);\n\n if (r != vec<15>(0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14))\n return false;\n\n return true;\n });\n\n auto index = UnitTest(\"vector index\", +[] {\n vec4 v = vec4(1, 2, 3, 4);\n\n float& x = v[0];\n x = 0;\n if (v[0] != 0) return false;\n\n float y = v[1];\n y = 73;\n if (v[1] != 2) return false;\n\n v[2] = 12;\n if (v[2] != 12) return false;\n\n v.data[3] = -1;\n if (v[3] != -1) return false;\n\n return true;\n });\n\n auto array_cast = UnitTest(\"vector array_cast\", +[] {\n ivec4 v = ivec4(8, 7, 6, 5);\n int* i = v;\n\n if (i[0] != 8 and i[1] != 7 and i[2] != 6 and i[3] != 5) return false;\n\n return true;\n });\n\n auto swiz_elems = UnitTest(\"vector swizzleElems\", +[] {\n ivec<9> v = ivec<9>(0, 1, 2, 10, 11, 12, 20, 21, 22);\n\n ivec3 u = v.swizzleElems<3, 4, 5>() += 100;\n if (u != ivec3(110, 111, 112)) return false;\n if (v != ivec<9>(0, 1, 2, 110, 111, 112, 20, 21, 22)) return false;\n\n return true;\n });\n auto swiz_range1 = UnitTest(\"vector swizzleRange positive\", +[] {\n ivec<9> v = ivec<9>(0, 1, 2, 10, 11, 12, 20, 21, 22);\n\n auto& u = v.swizzleRange<3, 5>();\n if (u != ivec3(10, 11, 12)) return false;\n\n u += 100;\n if (u != ivec3(110, 111, 112)) return false;\n\n if (v != ivec<9>(0, 1, 2, 110, 111, 112, 20, 21, 22)) return false;\n\n return true;\n });\n auto swiz_range2 = UnitTest(\"vector swizzleRange negative\", +[] {\n ivec<9> v = ivec<9>(0, 1, 2, 10, 11, 12, 20, 21, 22);\n\n auto& u = v.swizzleRange<5, 3>();\n if (u != ivec3(12, 11, 10)) return false;\n\n u += 100;\n if (u != ivec3(112, 111, 110)) return false;\n\n if (v != ivec<9>(0, 1, 2, 110, 111, 112, 20, 21, 22)) return false;\n\n return true;\n });\n}\n<|endoftext|>"} {"text":"<commit_before>#pragma once\n\n#include <cstdlib>\n#include <type_traits>\n#include <initializer_list>\n#include <utility>\n#include <new>\n#include \"types.hh\"\n#include \"_utils.hh\"\n\nnamespace zbs {\n\n\/\/ Hashmap.\n\/\/\n\/\/ K - type of the key\n\/\/ V - type of the value\n\/\/ Hash - takes (const K&, int) and returns int, a hash functor with seed\n\/\/ KeyEqual - checks if one key is equal to another, returns bool\n\ntemplate <typename T>\nstruct hash;\n\ntemplate <>\nstruct hash<const char*> {\n\tint operator()(const char *s, int seed);\n};\n\n\/\/ TODO: more hash implementations\n\ntemplate <typename K, typename V>\nstruct key_and_value {\n\tK key;\n\tV value;\n};\n\ntemplate <typename K, typename V, typename Hash>\nclass map_iter;\n\ntemplate <typename K, typename V, typename Hash = hash<K>>\nclass map {\n\tfriend class map_iter<K, V, Hash>;\n\n\tstatic constexpr float _load = 6.5;\n\tstatic constexpr int _bucket_size = 8;\n\tstatic constexpr int _max_key_size = 128;\n\tstatic constexpr int _max_value_size = 128;\n\tstatic constexpr bool _indirect_key() {\treturn sizeof(K) > _max_key_size; }\n\tstatic constexpr bool _indirect_value() { return sizeof(V) > _max_value_size; }\n\n\ttypedef typename std::conditional<_indirect_key(), K*, K>::type KK;\n\ttypedef typename std::conditional<_indirect_value(), V*, V>::type VV;\n\n\ttemplate <bool Indirect, typename T>\n\tstruct _indirect;\n\n\t\/\/ when T is indirectly stored, all functions take T*\n\ttemplate <typename T>\n\tstruct _indirect<true, T> {\n\t\tstatic T &get(T *a) {\n\t\t\treturn *a;\n\t\t}\n\n\t\tstatic void destroy(T *a) {\n\t\t\ta->~T();\n\t\t\tdetail::free(a);\n\t\t}\n\n\t\tstatic T *insert(T *a) {\n\t\t\t*a = detail::malloc<T>(1);\n\t\t\treturn *a;\n\t\t}\n\t};\n\n\t\/\/ when T is directly stored, all functions take T&\n\ttemplate <typename T>\n\tstruct _indirect<false, T> {\n\t\tstatic T &get(T &a) {\n\t\t\treturn a;\n\t\t}\n\n\t\tstatic void destroy(T &a) {\n\t\t\ta.~T();\n\t\t}\n\n\t\tstatic T *insert(T &a) {\n\t\t\treturn &a;\n\t\t}\n\t};\n\n\tstruct _bucket {\n\t\tuint8 top_hash[_bucket_size];\n\t\t_bucket *overflow;\n\t\tKK keys[_bucket_size];\n\t\tVV values[_bucket_size];\n\n\t\tK &key(int i) {\n\t\t\treturn _indirect<_indirect_key(), K>::get(keys[i]);\n\t\t}\n\n\t\tV &value(int i) {\n\t\t\treturn _indirect<_indirect_value(), V>::get(values[i]);\n\t\t}\n\n\t\tvoid clear() {\n\t\t\tstatic_assert(_bucket_size == 8, \"bucket_size != 8\");\n\t\t\t*(uint64*)top_hash = 0;\n\t\t\toverflow = nullptr;\n\t\t}\n\n\t\tvoid free() {\n\t\t\tfor (int i = 0; i < _bucket_size; i++) {\n\t\t\t\tif (top_hash[i] == 0)\n\t\t\t\t\tcontinue;\n\n\t\t\t\t_indirect<_indirect_key(), K>::destroy(keys[i]);\n\t\t\t\t_indirect<_indirect_value(), V>::destroy(values[i]);\n\t\t\t}\n\t\t}\n\t};\n\n\tint _hash0 = 0;\n\tint _count = 0;\n\tuint8 _B = 0;\n\t_bucket *_buckets = nullptr;\n\n\tvoid _split_bucket(_bucket *b, int i) {\n\t\tint newbit = 1 << (_B - 1);\n\t\t_bucket *x = _buckets + i;\n\t\t_bucket *y = _buckets + i + newbit;\n\t\tx->clear();\n\t\ty->clear();\n\t\tint xi = 0;\n\t\tint yi = 0;\n\n\t\tdo {\n\t\t\tfor (int i = 0; i < _bucket_size; i++) {\n\t\t\t\tif (b->top_hash[i] == 0)\n\t\t\t\t\tcontinue;\n\n\t\t\t\tint hash = Hash()(b->key(i), _hash0);\n\t\t\t\tif ((hash & newbit) == 0) {\n\t\t\t\t\tif (xi == _bucket_size) {\n\t\t\t\t\t\t_bucket *newx = detail::malloc<_bucket>(1);\n\t\t\t\t\t\tnewx->clear();\n\t\t\t\t\t\tx->overflow = newx;\n\t\t\t\t\t\tx = newx;\n\t\t\t\t\t\txi = 0;\n\t\t\t\t\t}\n\t\t\t\t\tx->top_hash[xi] = b->top_hash[i];\n\t\t\t\t\tnew (&x->keys[xi]) KK(std::move(b->keys[i]));\n\t\t\t\t\tnew (&x->values[xi]) VV(std::move(b->values[i]));\n\t\t\t\t\txi++;\n\t\t\t\t} else {\n\t\t\t\t\tif (yi == _bucket_size) {\n\t\t\t\t\t\t_bucket *newy = detail::malloc<_bucket>(1);\n\t\t\t\t\t\tnewy->clear();\n\t\t\t\t\t\ty->overflow = newy;\n\t\t\t\t\t\ty = newy;\n\t\t\t\t\t\tyi = 0;\n\t\t\t\t\t}\n\t\t\t\t\ty->top_hash[yi] = b->top_hash[i];\n\t\t\t\t\tnew (&y->keys[yi]) KK(std::move(b->keys[i]));\n\t\t\t\t\tnew (&y->values[yi]) VV(std::move(b->values[i]));\n\t\t\t\t\tyi++;\n\t\t\t\t}\n\t\t\t}\n\t\t\tb = b->overflow;\n\t\t} while (b);\n\t}\n\n\tvoid _grow() {\n\t\t_bucket *old_buckets = _buckets;\n\t\tint old_buckets_n = 1 << _B;\n\n\t\t_B++;\n\t\t_buckets = detail::malloc<_bucket>(1 << _B);\n\n\t\tfor (int i = 0; i < old_buckets_n; i++) {\n\t\t\t_bucket *b = old_buckets + i;\n\t\t\t_split_bucket(b, i);\n\n\t\t\t\/\/ free old bucket contents and overflow buckets\n\t\t\t_bucket *next = b->overflow;\n\t\t\twhile (next) {\n\t\t\t\t_bucket *cur = next;\n\t\t\t\tnext = cur->overflow;\n\n\t\t\t\tcur->free();\n\t\t\t\tdetail::free(cur);\n\t\t\t}\n\t\t\tb->free();\n\t\t}\n\t\tdetail::free(old_buckets);\n\t}\n\n\tV &_find_or_insert(K key) {\n\t\tint hash = Hash()(key, _hash0);\n\t\tif (_buckets == nullptr) {\n\t\t\t_buckets = detail::malloc<_bucket>(1);\n\t\t\t_buckets->clear();\n\t\t}\n\nagain:\n\t\tint bi = hash & ((1 << _B) - 1);\n\t\t_bucket *b = _buckets + bi;\n\t\tuint8 top = hash >> (sizeof(int) * 8 - 8);\n\t\tif (top == 0)\n\t\t\ttop = 1;\n\n\t\tuint8 *insert_top = nullptr;\n\t\tKK *insert_key = nullptr;\n\t\tVV *insert_value = nullptr;\n\n\t\tfor (;;) {\n\t\t\tfor (int i = 0; i < _bucket_size; i++) {\n\t\t\t\tif (b->top_hash[i] != top) {\n\t\t\t\t\tif (b->top_hash[i] == 0 && insert_top == nullptr) {\n\t\t\t\t\t\tinsert_top = b->top_hash + i;\n\t\t\t\t\t\tinsert_key = b->keys + i;\n\t\t\t\t\t\tinsert_value = b->values + i;\n\t\t\t\t\t}\n\t\t\t\t\tcontinue;\n\t\t\t\t}\n\n\t\t\t\tif (!(key == b->key(i)))\n\t\t\t\t\tcontinue;\n\n\t\t\t\treturn b->value(i);\n\t\t\t}\n\n\t\t\tif (b->overflow == nullptr)\n\t\t\t\tbreak;\n\t\t\tb = b->overflow;\n\t\t}\n\n\t\tif (_count >= _load * (1 << _B) && _count >= _bucket_size) {\n\t\t\t_grow();\n\t\t\tgoto again;\n\t\t}\n\n\t\tif (insert_top == nullptr) {\n\t\t\t_bucket *newb = detail::malloc<_bucket>(1);\n\t\t\tnewb->clear();\n\t\t\tb->overflow = newb;\n\t\t\tinsert_top = newb->top_hash;\n\t\t\tinsert_key = &newb->key(0);\n\t\t\tinsert_value = &newb->value(0);\n\t\t}\n\n\t\t*insert_top = top;\n\t\tK *newk = _indirect<_indirect_key(), K>::insert(*insert_key);\n\t\tV *newv = _indirect<_indirect_value(), V>::insert(*insert_value);\n\t\tnew (newk) K(std::move(key));\n\t\tnew (newv) V;\n\t\t_count++;\n\n\t\treturn *newv;\n\t}\n\npublic:\n\texplicit map(int hint = 0) {\n\t\twhile (hint > _bucket_size && hint > _load * (1 << _B))\n\t\t\t_B++;\n\n\t\tif (_B != 0) {\n\t\t\t_buckets = detail::malloc<_bucket>(1 << _B);\n\t\t\tfor (int i = 0, n = 1 << _B; i < n; i++) {\n\t\t\t\t_buckets[i].clear();\n\t\t\t}\n\t\t}\n\t\t_hash0 = detail::fastrand();\n\t}\n\n\tmap(std::initializer_list<key_and_value<K, V>> r): map(r.size()) {\n\t\tfor (const auto &kv : r) {\n\t\t\toperator[](kv.key) = kv.value;\n\t\t}\n\t}\n\n\t~map() {\n\t\tif (_buckets == nullptr)\n\t\t\treturn;\n\n\t\tfor (int i = 0, n = 1 << _B; i < n; i++) {\n\t\t\t_bucket &b = _buckets[i];\n\t\t\t_bucket *next = b.overflow;\n\t\t\twhile (next) {\n\t\t\t\t_bucket *cur = next;\n\t\t\t\tnext = cur->overflow;\n\n\t\t\t\tcur->free();\n\t\t\t\tdetail::free(cur);\n\t\t\t}\n\t\t\tb.free();\n\t\t}\n\t\tdetail::free(_buckets);\n\t}\n\n\tint len() const { return _count; }\n\n\tV &operator[](K k) {\n\t\treturn _find_or_insert(std::move(k));\n\t}\n};\n\ntemplate <typename K, typename V, typename Hash>\nclass map_iter {\n\ttypename map<K, V, Hash>::_bucket *_buckets;\n\ttypename map<K, V, Hash>::_bucket *_bucket;\n\tint _buckets_n;\n\tint _bucket_i;\n\tint _i;\n\n\tvoid _find_next_valid() {\n\t\tif (_bucket_i == _buckets_n) {\n\t\t\treturn;\n\t\t}\n\n\t\tfor (;;) {\n\t\t\t_i++;\n\t\t\tif (_i == map<K, V, Hash>::_bucket_size) {\n\t\t\t\t\/\/ done with current bucket, try next overflow\n\t\t\t\t_bucket = _bucket->overflow;\n\t\t\t\t_i = 0;\n\t\t\t\tif (_bucket == nullptr) {\n\t\t\t\t\t\/\/ oops, no overflow bucket, try next\n\t\t\t\t\t\/\/ one in the table\n\t\t\t\t\t_bucket_i++;\n\t\t\t\t\tif (_bucket_i == _buckets_n) {\n\t\t\t\t\t\t\/\/ no buckets left, we're done\n\t\t\t\t\t\treturn;\n\t\t\t\t\t}\n\t\t\t\t\t_bucket = _buckets + _bucket_i;\n\t\t\t\t}\n\t\t\t}\n\n\t\t\t\/\/ check if it's a valid entry\n\t\t\tif (_bucket->top_hash[_i] != 0) {\n\t\t\t\treturn;\n\t\t\t}\n\t\t}\n\t}\npublic:\n\tmap_iter() = default;\n\n\texplicit map_iter(map<K, V, Hash> &m):\n\t\t_buckets(m._buckets), _bucket(m._buckets),\n\t\t_buckets_n(1 << m._B), _bucket_i(0), _i(0)\n\t{\n\t\tif (m.len() == 0) {\n\t\t\t_buckets_n = 0;\n\t\t\treturn;\n\t\t}\n\n\t\tif (_bucket->top_hash[_i] == 0)\n\t\t\t_find_next_valid();\n\t}\n\n\tmap_iter &operator++() {\n\t\t_find_next_valid();\n\t\treturn *this;\n\t}\n\n\tbool operator==(const map_iter&) const { return _bucket_i == _buckets_n; }\n\tbool operator!=(const map_iter&) const { return _bucket_i != _buckets_n; }\n\tkey_and_value<const K&, V&> operator*() {\n\t\treturn {\n\t\t\tmap<K, V, Hash>::template _indirect<\n\t\t\t\tmap<K, V, Hash>::_indirect_key(), K\n\t\t\t>::get(_bucket->keys[_i]),\n\t\t\tmap<K, V, Hash>::template _indirect<\n\t\t\t\tmap<K, V, Hash>::_indirect_value(), V\n\t\t\t>::get(_bucket->values[_i]),\n\t\t};\n\t}\n};\n\ntemplate <typename K, typename V, typename Hash>\nmap_iter<K, V, Hash> begin(map<K, V, Hash> &m) {\n\treturn map_iter<K, V, Hash>(m);\n}\n\ntemplate <typename K, typename V, typename Hash>\nmap_iter<K, V, Hash> end(map<K, V, Hash>&) {\n\treturn map_iter<K, V, Hash>();\n}\n\n} \/\/ namespace zbs\n<commit_msg>Split map constructors into two, causes issues on clang.<commit_after>#pragma once\n\n#include <cstdlib>\n#include <type_traits>\n#include <initializer_list>\n#include <utility>\n#include <new>\n#include \"types.hh\"\n#include \"_utils.hh\"\n\nnamespace zbs {\n\n\/\/ Hashmap.\n\/\/\n\/\/ K - type of the key\n\/\/ V - type of the value\n\/\/ Hash - takes (const K&, int) and returns int, a hash functor with seed\n\/\/ KeyEqual - checks if one key is equal to another, returns bool\n\ntemplate <typename T>\nstruct hash;\n\ntemplate <>\nstruct hash<const char*> {\n\tint operator()(const char *s, int seed);\n};\n\n\/\/ TODO: more hash implementations\n\ntemplate <typename K, typename V>\nstruct key_and_value {\n\tK key;\n\tV value;\n};\n\ntemplate <typename K, typename V, typename Hash>\nclass map_iter;\n\ntemplate <typename K, typename V, typename Hash = hash<K>>\nclass map {\n\tfriend class map_iter<K, V, Hash>;\n\n\tstatic constexpr float _load = 6.5;\n\tstatic constexpr int _bucket_size = 8;\n\tstatic constexpr int _max_key_size = 128;\n\tstatic constexpr int _max_value_size = 128;\n\tstatic constexpr bool _indirect_key() {\treturn sizeof(K) > _max_key_size; }\n\tstatic constexpr bool _indirect_value() { return sizeof(V) > _max_value_size; }\n\n\ttypedef typename std::conditional<_indirect_key(), K*, K>::type KK;\n\ttypedef typename std::conditional<_indirect_value(), V*, V>::type VV;\n\n\ttemplate <bool Indirect, typename T>\n\tstruct _indirect;\n\n\t\/\/ when T is indirectly stored, all functions take T*\n\ttemplate <typename T>\n\tstruct _indirect<true, T> {\n\t\tstatic T &get(T *a) {\n\t\t\treturn *a;\n\t\t}\n\n\t\tstatic void destroy(T *a) {\n\t\t\ta->~T();\n\t\t\tdetail::free(a);\n\t\t}\n\n\t\tstatic T *insert(T *a) {\n\t\t\t*a = detail::malloc<T>(1);\n\t\t\treturn *a;\n\t\t}\n\t};\n\n\t\/\/ when T is directly stored, all functions take T&\n\ttemplate <typename T>\n\tstruct _indirect<false, T> {\n\t\tstatic T &get(T &a) {\n\t\t\treturn a;\n\t\t}\n\n\t\tstatic void destroy(T &a) {\n\t\t\ta.~T();\n\t\t}\n\n\t\tstatic T *insert(T &a) {\n\t\t\treturn &a;\n\t\t}\n\t};\n\n\tstruct _bucket {\n\t\tuint8 top_hash[_bucket_size];\n\t\t_bucket *overflow;\n\t\tKK keys[_bucket_size];\n\t\tVV values[_bucket_size];\n\n\t\tK &key(int i) {\n\t\t\treturn _indirect<_indirect_key(), K>::get(keys[i]);\n\t\t}\n\n\t\tV &value(int i) {\n\t\t\treturn _indirect<_indirect_value(), V>::get(values[i]);\n\t\t}\n\n\t\tvoid clear() {\n\t\t\tstatic_assert(_bucket_size == 8, \"bucket_size != 8\");\n\t\t\t*(uint64*)top_hash = 0;\n\t\t\toverflow = nullptr;\n\t\t}\n\n\t\tvoid free() {\n\t\t\tfor (int i = 0; i < _bucket_size; i++) {\n\t\t\t\tif (top_hash[i] == 0)\n\t\t\t\t\tcontinue;\n\n\t\t\t\t_indirect<_indirect_key(), K>::destroy(keys[i]);\n\t\t\t\t_indirect<_indirect_value(), V>::destroy(values[i]);\n\t\t\t}\n\t\t}\n\t};\n\n\tint _hash0 = 0;\n\tint _count = 0;\n\tuint8 _B = 0;\n\t_bucket *_buckets = nullptr;\n\n\tvoid _split_bucket(_bucket *b, int i) {\n\t\tint newbit = 1 << (_B - 1);\n\t\t_bucket *x = _buckets + i;\n\t\t_bucket *y = _buckets + i + newbit;\n\t\tx->clear();\n\t\ty->clear();\n\t\tint xi = 0;\n\t\tint yi = 0;\n\n\t\tdo {\n\t\t\tfor (int i = 0; i < _bucket_size; i++) {\n\t\t\t\tif (b->top_hash[i] == 0)\n\t\t\t\t\tcontinue;\n\n\t\t\t\tint hash = Hash()(b->key(i), _hash0);\n\t\t\t\tif ((hash & newbit) == 0) {\n\t\t\t\t\tif (xi == _bucket_size) {\n\t\t\t\t\t\t_bucket *newx = detail::malloc<_bucket>(1);\n\t\t\t\t\t\tnewx->clear();\n\t\t\t\t\t\tx->overflow = newx;\n\t\t\t\t\t\tx = newx;\n\t\t\t\t\t\txi = 0;\n\t\t\t\t\t}\n\t\t\t\t\tx->top_hash[xi] = b->top_hash[i];\n\t\t\t\t\tnew (&x->keys[xi]) KK(std::move(b->keys[i]));\n\t\t\t\t\tnew (&x->values[xi]) VV(std::move(b->values[i]));\n\t\t\t\t\txi++;\n\t\t\t\t} else {\n\t\t\t\t\tif (yi == _bucket_size) {\n\t\t\t\t\t\t_bucket *newy = detail::malloc<_bucket>(1);\n\t\t\t\t\t\tnewy->clear();\n\t\t\t\t\t\ty->overflow = newy;\n\t\t\t\t\t\ty = newy;\n\t\t\t\t\t\tyi = 0;\n\t\t\t\t\t}\n\t\t\t\t\ty->top_hash[yi] = b->top_hash[i];\n\t\t\t\t\tnew (&y->keys[yi]) KK(std::move(b->keys[i]));\n\t\t\t\t\tnew (&y->values[yi]) VV(std::move(b->values[i]));\n\t\t\t\t\tyi++;\n\t\t\t\t}\n\t\t\t}\n\t\t\tb = b->overflow;\n\t\t} while (b);\n\t}\n\n\tvoid _grow() {\n\t\t_bucket *old_buckets = _buckets;\n\t\tint old_buckets_n = 1 << _B;\n\n\t\t_B++;\n\t\t_buckets = detail::malloc<_bucket>(1 << _B);\n\n\t\tfor (int i = 0; i < old_buckets_n; i++) {\n\t\t\t_bucket *b = old_buckets + i;\n\t\t\t_split_bucket(b, i);\n\n\t\t\t\/\/ free old bucket contents and overflow buckets\n\t\t\t_bucket *next = b->overflow;\n\t\t\twhile (next) {\n\t\t\t\t_bucket *cur = next;\n\t\t\t\tnext = cur->overflow;\n\n\t\t\t\tcur->free();\n\t\t\t\tdetail::free(cur);\n\t\t\t}\n\t\t\tb->free();\n\t\t}\n\t\tdetail::free(old_buckets);\n\t}\n\n\tV &_find_or_insert(K key) {\n\t\tint hash = Hash()(key, _hash0);\n\t\tif (_buckets == nullptr) {\n\t\t\t_buckets = detail::malloc<_bucket>(1);\n\t\t\t_buckets->clear();\n\t\t}\n\nagain:\n\t\tint bi = hash & ((1 << _B) - 1);\n\t\t_bucket *b = _buckets + bi;\n\t\tuint8 top = hash >> (sizeof(int) * 8 - 8);\n\t\tif (top == 0)\n\t\t\ttop = 1;\n\n\t\tuint8 *insert_top = nullptr;\n\t\tKK *insert_key = nullptr;\n\t\tVV *insert_value = nullptr;\n\n\t\tfor (;;) {\n\t\t\tfor (int i = 0; i < _bucket_size; i++) {\n\t\t\t\tif (b->top_hash[i] != top) {\n\t\t\t\t\tif (b->top_hash[i] == 0 && insert_top == nullptr) {\n\t\t\t\t\t\tinsert_top = b->top_hash + i;\n\t\t\t\t\t\tinsert_key = b->keys + i;\n\t\t\t\t\t\tinsert_value = b->values + i;\n\t\t\t\t\t}\n\t\t\t\t\tcontinue;\n\t\t\t\t}\n\n\t\t\t\tif (!(key == b->key(i)))\n\t\t\t\t\tcontinue;\n\n\t\t\t\treturn b->value(i);\n\t\t\t}\n\n\t\t\tif (b->overflow == nullptr)\n\t\t\t\tbreak;\n\t\t\tb = b->overflow;\n\t\t}\n\n\t\tif (_count >= _load * (1 << _B) && _count >= _bucket_size) {\n\t\t\t_grow();\n\t\t\tgoto again;\n\t\t}\n\n\t\tif (insert_top == nullptr) {\n\t\t\t_bucket *newb = detail::malloc<_bucket>(1);\n\t\t\tnewb->clear();\n\t\t\tb->overflow = newb;\n\t\t\tinsert_top = newb->top_hash;\n\t\t\tinsert_key = &newb->key(0);\n\t\t\tinsert_value = &newb->value(0);\n\t\t}\n\n\t\t*insert_top = top;\n\t\tK *newk = _indirect<_indirect_key(), K>::insert(*insert_key);\n\t\tV *newv = _indirect<_indirect_value(), V>::insert(*insert_value);\n\t\tnew (newk) K(std::move(key));\n\t\tnew (newv) V;\n\t\t_count++;\n\n\t\treturn *newv;\n\t}\n\npublic:\n\texplicit map(int hint) {\n\t\twhile (hint > _bucket_size && hint > _load * (1 << _B))\n\t\t\t_B++;\n\n\t\tif (_B != 0) {\n\t\t\t_buckets = detail::malloc<_bucket>(1 << _B);\n\t\t\tfor (int i = 0, n = 1 << _B; i < n; i++) {\n\t\t\t\t_buckets[i].clear();\n\t\t\t}\n\t\t}\n\t\t_hash0 = detail::fastrand();\n\t}\n\n\tmap(): map(0) {}\n\n\tmap(std::initializer_list<key_and_value<K, V>> r): map(r.size()) {\n\t\tfor (const auto &kv : r) {\n\t\t\toperator[](kv.key) = kv.value;\n\t\t}\n\t}\n\n\t~map() {\n\t\tif (_buckets == nullptr)\n\t\t\treturn;\n\n\t\tfor (int i = 0, n = 1 << _B; i < n; i++) {\n\t\t\t_bucket &b = _buckets[i];\n\t\t\t_bucket *next = b.overflow;\n\t\t\twhile (next) {\n\t\t\t\t_bucket *cur = next;\n\t\t\t\tnext = cur->overflow;\n\n\t\t\t\tcur->free();\n\t\t\t\tdetail::free(cur);\n\t\t\t}\n\t\t\tb.free();\n\t\t}\n\t\tdetail::free(_buckets);\n\t}\n\n\tint len() const { return _count; }\n\n\tV &operator[](K k) {\n\t\treturn _find_or_insert(std::move(k));\n\t}\n};\n\ntemplate <typename K, typename V, typename Hash>\nclass map_iter {\n\ttypename map<K, V, Hash>::_bucket *_buckets;\n\ttypename map<K, V, Hash>::_bucket *_bucket;\n\tint _buckets_n;\n\tint _bucket_i;\n\tint _i;\n\n\tvoid _find_next_valid() {\n\t\tif (_bucket_i == _buckets_n) {\n\t\t\treturn;\n\t\t}\n\n\t\tfor (;;) {\n\t\t\t_i++;\n\t\t\tif (_i == map<K, V, Hash>::_bucket_size) {\n\t\t\t\t\/\/ done with current bucket, try next overflow\n\t\t\t\t_bucket = _bucket->overflow;\n\t\t\t\t_i = 0;\n\t\t\t\tif (_bucket == nullptr) {\n\t\t\t\t\t\/\/ oops, no overflow bucket, try next\n\t\t\t\t\t\/\/ one in the table\n\t\t\t\t\t_bucket_i++;\n\t\t\t\t\tif (_bucket_i == _buckets_n) {\n\t\t\t\t\t\t\/\/ no buckets left, we're done\n\t\t\t\t\t\treturn;\n\t\t\t\t\t}\n\t\t\t\t\t_bucket = _buckets + _bucket_i;\n\t\t\t\t}\n\t\t\t}\n\n\t\t\t\/\/ check if it's a valid entry\n\t\t\tif (_bucket->top_hash[_i] != 0) {\n\t\t\t\treturn;\n\t\t\t}\n\t\t}\n\t}\npublic:\n\tmap_iter() = default;\n\n\texplicit map_iter(map<K, V, Hash> &m):\n\t\t_buckets(m._buckets), _bucket(m._buckets),\n\t\t_buckets_n(1 << m._B), _bucket_i(0), _i(0)\n\t{\n\t\tif (m.len() == 0) {\n\t\t\t_buckets_n = 0;\n\t\t\treturn;\n\t\t}\n\n\t\tif (_bucket->top_hash[_i] == 0)\n\t\t\t_find_next_valid();\n\t}\n\n\tmap_iter &operator++() {\n\t\t_find_next_valid();\n\t\treturn *this;\n\t}\n\n\tbool operator==(const map_iter&) const { return _bucket_i == _buckets_n; }\n\tbool operator!=(const map_iter&) const { return _bucket_i != _buckets_n; }\n\tkey_and_value<const K&, V&> operator*() {\n\t\treturn {\n\t\t\tmap<K, V, Hash>::template _indirect<\n\t\t\t\tmap<K, V, Hash>::_indirect_key(), K\n\t\t\t>::get(_bucket->keys[_i]),\n\t\t\tmap<K, V, Hash>::template _indirect<\n\t\t\t\tmap<K, V, Hash>::_indirect_value(), V\n\t\t\t>::get(_bucket->values[_i]),\n\t\t};\n\t}\n};\n\ntemplate <typename K, typename V, typename Hash>\nmap_iter<K, V, Hash> begin(map<K, V, Hash> &m) {\n\treturn map_iter<K, V, Hash>(m);\n}\n\ntemplate <typename K, typename V, typename Hash>\nmap_iter<K, V, Hash> end(map<K, V, Hash>&) {\n\treturn map_iter<K, V, Hash>();\n}\n\n} \/\/ namespace zbs\n<|endoftext|>"} {"text":"<commit_before>\/*\n SWARM\n\n Copyright (C) 2012-2022 Torbjorn Rognes and Frederic Mahe\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 Contact: Torbjorn Rognes <torognes@ifi.uio.no>,\n Department of Informatics, University of Oslo,\n PO Box 1080 Blindern, NO-0316 Oslo, Norway\n*\/\n\n#include \"swarm.h\"\n#include \"pseudo_rng.h\"\n#include \"util.h\"\n#include \"zobrist.h\"\n\n\nuint64_t * zobrist_tab_base = nullptr;\nuint64_t * zobrist_tab_byte_base = nullptr;\n\n\nvoid zobrist_init(unsigned int n)\n{\n \/*\n Generate 4n random 64-bit numbers. They will represent the four\n different bases in any position (1 to n) of a sequence.\n They will be XOR'ed together to form the hash of that sequence.\n The number n should be the length of the longest sequence to be\n hashed including potential additional insertions.\n\n The number is generated by xor'ing together four shifted\n 31-bit random numbers.\n *\/\n constexpr unsigned int byte_range {256};\n constexpr unsigned int multiplier {16};\n\n \/* allocate memory for tables *\/\n\n zobrist_tab_base = static_cast<uint64_t *>\n (xmalloc(4 * n * sizeof(uint64_t)));\n\n zobrist_tab_byte_base = static_cast<uint64_t *>\n (xmalloc(byte_range * (n \/ 4) * sizeof(uint64_t)));\n\n \/* fill table with random 64 bit numbers *\/\n\n for(auto i = 0U; i < 4 * n; i++)\n {\n auto z = 0ULL;\n z = rand_64();\n z <<= multiplier;\n z ^= rand_64();\n z <<= multiplier;\n z ^= rand_64();\n z <<= multiplier;\n z ^= rand_64();\n zobrist_tab_base[i] = z;\n }\n\n \/* combine into bytes for faster computations *\/\n\n for(auto i = 0U; i < n \/ 4; i++) {\n for(auto j = 0U; j < byte_range; j++) {\n auto z = 0ULL;\n auto x = j;\n z ^= zobrist_value(4 * i + 0, x & 3);\n x >>= 2;\n z ^= zobrist_value(4 * i + 1, x & 3);\n x >>= 2;\n z ^= zobrist_value(4 * i + 2, x & 3);\n x >>= 2;\n z ^= zobrist_value(4 * i + 3, x & 3);\n zobrist_tab_byte_base[byte_range * i + j] = z;\n }\n }\n}\n\nvoid zobrist_exit()\n{\n xfree(zobrist_tab_byte_base);\n xfree(zobrist_tab_base);\n}\n\nauto zobrist_hash(unsigned char * s, unsigned int len) -> uint64_t\n{\n \/* compute the Zobrist hash function of sequence s of length len. *\/\n \/* len is the actual number of bases in the sequence *\/\n \/* it is encoded in (len+3)\/4 bytes *\/\n\n constexpr unsigned int offset {64};\n constexpr unsigned int nt_per_uint64 {32}; \/\/ 32 nucleotides can fit in a uint64\n auto * q = reinterpret_cast<uint64_t *>(s);\n uint64_t z = 0;\n unsigned int p = 0;\n auto * qb = reinterpret_cast<unsigned char *>(q);\n\n while (p + nt_per_uint64 < len)\n {\n for(auto i = 0U; i < nt_per_uint64; i += 4) {\n \/\/ i = {0, 4, 8, 12, 16, 20, 24, 28}\n z ^= zobrist_tab_byte_base[offset * (p + i) + *qb++];\n }\n p += nt_per_uint64;\n }\n\n while (p + 4 < len)\n {\n z ^= zobrist_tab_byte_base[offset * p + *qb++];\n p += 4;\n }\n\n if (p < len)\n {\n uint64_t x = *qb++;\n while (p < len)\n {\n z ^= zobrist_value(p, x & 3);\n x >>= 2;\n p++;\n }\n }\n\n return z;\n}\n\nauto zobrist_hash_delete_first(unsigned char * s, unsigned int len) -> uint64_t\n{\n \/* compute the Zobrist hash function of sequence s,\n but delete the first base *\/\n\n constexpr unsigned int nt_per_uint64 {32}; \/\/ 32 nucleotides can fit in a uint64\n auto * q = reinterpret_cast<uint64_t *>(s);\n uint64_t x = q[0];\n uint64_t z = 0;\n for(auto p = 1U; p < len; p++)\n {\n if ((p & (nt_per_uint64 - 1)) == 0) {\n x = q[p \/ nt_per_uint64];\n }\n else {\n x >>= 2;\n }\n z ^= zobrist_value(p - 1, x & 3);\n }\n return z;\n}\n\nauto zobrist_hash_insert_first(unsigned char * s, unsigned int len) -> uint64_t\n{\n \/* compute the Zobrist hash function of sequence s,\n but insert a gap (no value) before the first base *\/\n\n constexpr unsigned int nt_per_uint64 {32}; \/\/ 32 nucleotides can fit in a uint64\n auto * q = reinterpret_cast<uint64_t *>(s);\n uint64_t x = 0;\n uint64_t z = 0;\n for(auto p = 0U; p < len; p++)\n {\n if ((p & (nt_per_uint64 - 1)) == 0) {\n x = q[p \/ nt_per_uint64];\n }\n else {\n x >>= 2;\n }\n z ^= zobrist_value(p + 1, x & 3);\n }\n return z;\n}\n<commit_msg>longer names for parameters, fix spacing<commit_after>\/*\n SWARM\n\n Copyright (C) 2012-2022 Torbjorn Rognes and Frederic Mahe\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 Contact: Torbjorn Rognes <torognes@ifi.uio.no>,\n Department of Informatics, University of Oslo,\n PO Box 1080 Blindern, NO-0316 Oslo, Norway\n*\/\n\n#include \"swarm.h\"\n#include \"pseudo_rng.h\"\n#include \"util.h\"\n#include \"zobrist.h\"\n\n\nuint64_t * zobrist_tab_base = nullptr;\nuint64_t * zobrist_tab_byte_base = nullptr;\n\n\nvoid zobrist_init(unsigned int n)\n{\n \/*\n Generate 4n random 64-bit numbers. They will represent the four\n different bases in any position (1 to n) of a sequence.\n They will be XOR'ed together to form the hash of that sequence.\n The number n should be the length of the longest sequence to be\n hashed including potential additional insertions.\n\n The number is generated by xor'ing together four shifted\n 31-bit random numbers.\n *\/\n constexpr unsigned int byte_range {256};\n constexpr unsigned int multiplier {16};\n\n \/* allocate memory for tables *\/\n\n zobrist_tab_base = static_cast<uint64_t *>\n (xmalloc(4 * n * sizeof(uint64_t)));\n\n zobrist_tab_byte_base = static_cast<uint64_t *>\n (xmalloc(byte_range * (n \/ 4) * sizeof(uint64_t)));\n\n \/* fill table with random 64 bit numbers *\/\n\n for(auto i = 0U; i < 4 * n; i++)\n {\n auto z = 0ULL;\n z = rand_64();\n z <<= multiplier;\n z ^= rand_64();\n z <<= multiplier;\n z ^= rand_64();\n z <<= multiplier;\n z ^= rand_64();\n zobrist_tab_base[i] = z;\n }\n\n \/* combine into bytes for faster computations *\/\n\n for(auto i = 0U; i < n \/ 4; i++) {\n for(auto j = 0U; j < byte_range; j++) {\n auto z = 0ULL;\n auto x = j;\n z ^= zobrist_value(4 * i + 0, x & 3);\n x >>= 2;\n z ^= zobrist_value(4 * i + 1, x & 3);\n x >>= 2;\n z ^= zobrist_value(4 * i + 2, x & 3);\n x >>= 2;\n z ^= zobrist_value(4 * i + 3, x & 3);\n zobrist_tab_byte_base[byte_range * i + j] = z;\n }\n }\n}\n\nvoid zobrist_exit()\n{\n xfree(zobrist_tab_byte_base);\n xfree(zobrist_tab_base);\n}\n\n\nauto zobrist_hash(unsigned char * seq, unsigned int len) -> uint64_t\n{\n \/* compute the Zobrist hash function of sequence seq of length len. *\/\n \/* len is the actual number of bases in the sequence *\/\n \/* it is encoded in (len + 3 ) \/ 4 bytes *\/\n\n constexpr unsigned int offset {64};\n constexpr unsigned int nt_per_uint64 {32}; \/\/ 32 nucleotides can fit in a uint64\n auto * q = reinterpret_cast<uint64_t *>(seq);\n uint64_t z = 0;\n unsigned int p = 0;\n auto * qb = reinterpret_cast<unsigned char *>(q);\n\n while (p + nt_per_uint64 < len)\n {\n for(auto i = 0U; i < nt_per_uint64; i += 4) {\n \/\/ i = {0, 4, 8, 12, 16, 20, 24, 28}\n z ^= zobrist_tab_byte_base[offset * (p + i) + *qb++];\n }\n p += nt_per_uint64;\n }\n\n while (p + 4 < len)\n {\n z ^= zobrist_tab_byte_base[offset * p + *qb++];\n p += 4;\n }\n\n if (p < len)\n {\n uint64_t x = *qb++;\n while (p < len)\n {\n z ^= zobrist_value(p, x & 3);\n x >>= 2;\n p++;\n }\n }\n\n return z;\n}\n\n\nauto zobrist_hash_delete_first(unsigned char * seq, unsigned int len) -> uint64_t\n{\n \/* compute the Zobrist hash function of sequence seq,\n but delete the first base *\/\n\n constexpr unsigned int nt_per_uint64 {32}; \/\/ 32 nucleotides can fit in a uint64\n auto * q = reinterpret_cast<uint64_t *>(seq);\n uint64_t x = q[0];\n uint64_t z = 0;\n for(auto p = 1U; p < len; p++)\n {\n if ((p & (nt_per_uint64 - 1)) == 0) {\n x = q[p \/ nt_per_uint64];\n }\n else {\n x >>= 2;\n }\n z ^= zobrist_value(p - 1, x & 3);\n }\n return z;\n}\n\nauto zobrist_hash_insert_first(unsigned char * seq, unsigned int len) -> uint64_t\n{\n \/* compute the Zobrist hash function of sequence seq,\n but insert a gap (no value) before the first base *\/\n\n constexpr unsigned int nt_per_uint64 {32}; \/\/ 32 nucleotides can fit in a uint64\n auto * q = reinterpret_cast<uint64_t *>(seq);\n uint64_t x = 0;\n uint64_t z = 0;\n for(auto p = 0U; p < len; p++)\n {\n if ((p & (nt_per_uint64 - 1)) == 0) {\n x = q[p \/ nt_per_uint64];\n }\n else {\n x >>= 2;\n }\n z ^= zobrist_value(p + 1, x & 3);\n }\n return z;\n}\n<|endoftext|>"} {"text":"<commit_before>#include \"Configuration.hpp\"\n\n#include <memory>\n#include <string>\n#include <vector>\n\n#include \"tclap\/CmdLine.h\"\n\n#include \"SequentialEventDispatcher.hpp\"\n\nnamespace warped {\n\nConfiguration::Configuration(const std::string& config_file_name, unsigned int max_sim_time)\n : config_file_name_(config_file_name), max_sim_time_(max_sim_time) {}\n\nConfiguration::Configuration(const std::string& model_description, int argc,\n const char* const* argv,\n const std::vector<TCLAP::Arg*>& cmd_line_args)\n : config_file_name_(\"\"), max_sim_time_(0) { init(model_description, argc, argv, cmd_line_args); }\n\nConfiguration::Configuration(const std::string& model_description, int argc,\n const char* const* argv)\n : config_file_name_(\"\"), max_sim_time_(0) {\n std::vector<TCLAP::Arg*> v;\n init(model_description, argc, argv, v);\n}\n\nvoid Configuration::init(const std::string& model_description, int argc, const char* const* argv,\n const std::vector<TCLAP::Arg*>& cmd_line_args) {\n TCLAP::CmdLine cmd_line(model_description);\n\n TCLAP::ValueArg<std::string> config_arg(\"c\", \"config\", \"Warped configuration file\",\n false, config_file_name_, \"file\", cmd_line);\n TCLAP::ValueArg<unsigned int> max_sim_time_arg(\"t\", \"max-sim-time\",\n \"specify a simulation end time\",\n false, max_sim_time_, \"time\", cmd_line);\n for (auto arg : cmd_line_args) {\n cmd_line.add(arg);\n }\n\n cmd_line.parse(argc, argv);\n\n max_sim_time_ = max_sim_time_arg.getValue();\n config_file_name_ = config_arg.getValue();\n\n}\n\nstd::unique_ptr<EventDispatcher> Configuration::make_dispatcher() {\n return std::unique_ptr<EventDispatcher> {new SequentialEventDispatcher{max_sim_time_}};\n}\n\n} \/\/ namespace warped<commit_msg>Changed local variable into rvalue<commit_after>#include \"Configuration.hpp\"\n\n#include <memory>\n#include <string>\n#include <vector>\n\n#include \"tclap\/CmdLine.h\"\n\n#include \"SequentialEventDispatcher.hpp\"\n\nnamespace warped {\n\nConfiguration::Configuration(const std::string& config_file_name, unsigned int max_sim_time)\n : config_file_name_(config_file_name), max_sim_time_(max_sim_time) {}\n\nConfiguration::Configuration(const std::string& model_description, int argc,\n const char* const* argv,\n const std::vector<TCLAP::Arg*>& cmd_line_args)\n : config_file_name_(\"\"), max_sim_time_(0) { init(model_description, argc, argv, cmd_line_args); }\n\nConfiguration::Configuration(const std::string& model_description, int argc,\n const char* const* argv)\n : config_file_name_(\"\"), max_sim_time_(0) { init(model_description, argc, argv, {}); }\n\nvoid Configuration::init(const std::string& model_description, int argc, const char* const* argv,\n const std::vector<TCLAP::Arg*>& cmd_line_args) {\n TCLAP::CmdLine cmd_line(model_description);\n\n TCLAP::ValueArg<std::string> config_arg(\"c\", \"config\", \"Warped configuration file\",\n false, config_file_name_, \"file\", cmd_line);\n TCLAP::ValueArg<unsigned int> max_sim_time_arg(\"t\", \"max-sim-time\",\n \"specify a simulation end time\",\n false, max_sim_time_, \"time\", cmd_line);\n for (auto arg : cmd_line_args) {\n cmd_line.add(arg);\n }\n\n cmd_line.parse(argc, argv);\n\n max_sim_time_ = max_sim_time_arg.getValue();\n config_file_name_ = config_arg.getValue();\n\n}\n\nstd::unique_ptr<EventDispatcher> Configuration::make_dispatcher() {\n return std::unique_ptr<EventDispatcher> {new SequentialEventDispatcher{max_sim_time_}};\n}\n\n} \/\/ namespace warped<|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: UnoNamespaceMap.cxx,v $\n * $Revision: 1.8 $\n *\n * This file is part of OpenOffice.org.\n *\n * OpenOffice.org is free software: you can redistribute it and\/or modify\n * it under the terms of the GNU Lesser General Public License version 3\n * only, as published by the Free Software Foundation.\n *\n * OpenOffice.org is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the\n * GNU Lesser General Public License version 3 for more details\n * (a copy is included in the LICENSE file that accompanied this code).\n *\n * You should have received a copy of the GNU Lesser General Public License\n * version 3 along with OpenOffice.org. If not, see\n * <http:\/\/www.openoffice.org\/license.html>\n * for a copy of the LGPLv3 License.\n *\n ************************************************************************\/\n\n\/\/ MARKER(update_precomp.py): autogen include statement, do not remove\n#include \"precompiled_svx.hxx\"\n\n#include <set>\n\n#include \"UnoNamespaceMap.hxx\"\n#include <com\/sun\/star\/container\/XNameAccess.hpp>\n#include <com\/sun\/star\/lang\/XServiceInfo.hpp>\n\n#ifndef _CPPUHELPER_IMPLBASE3_HXX_\n#include <cppuhelper\/implbase2.hxx>\n#endif\n#include <osl\/diagnose.h>\n#include <osl\/mutex.hxx>\n#include <comphelper\/stl_types.hxx>\n#include <svtools\/itempool.hxx>\n#include \"unoapi.hxx\"\n#include \"xmlcnitm.hxx\"\n\n\nusing namespace ::comphelper;\nusing namespace ::osl;\nusing namespace ::rtl;\nusing namespace ::cppu;\nusing namespace ::com::sun::star;\nusing namespace ::com::sun::star::uno;\nusing namespace ::com::sun::star::container;\nusing namespace ::com::sun::star::drawing;\nusing namespace ::com::sun::star::lang;\nusing namespace ::com::sun::star::beans;\n\nnamespace svx\n{\n \/** implements a component to export namespaces of all SvXMLAttrContainerItem inside\n one or two pools with a variable count of which ids.\n *\/\n class NamespaceMap : public WeakImplHelper2< XNameAccess, XServiceInfo >\n {\n private:\n sal_uInt16* mpWhichIds;\n SfxItemPool* mpPool;\n\n public:\n NamespaceMap( sal_uInt16* pWhichIds, SfxItemPool* pPool );\n virtual ~NamespaceMap();\n\n \/\/ XNameAccess\n virtual Any SAL_CALL getByName( const OUString& aName ) throw (NoSuchElementException, WrappedTargetException, RuntimeException);\n virtual Sequence< OUString > SAL_CALL getElementNames( ) throw (RuntimeException);\n virtual sal_Bool SAL_CALL hasByName( const OUString& aName ) throw (RuntimeException);\n\n \/\/ XElementAccess\n virtual Type SAL_CALL getElementType( ) throw (RuntimeException);\n virtual sal_Bool SAL_CALL hasElements( ) throw (RuntimeException);\n\n \/\/ XServiceInfo\n virtual OUString SAL_CALL getImplementationName( ) throw(RuntimeException);\n virtual sal_Bool SAL_CALL supportsService( const OUString& ServiceName ) throw(RuntimeException);\n virtual Sequence< OUString > SAL_CALL getSupportedServiceNames( ) throw(RuntimeException);\n };\n\n Reference< XInterface > SAL_CALL NamespaceMap_createInstance( sal_uInt16* pWhichIds, SfxItemPool* pPool1, SfxItemPool* )\n {\n return (XWeak*)new NamespaceMap( pWhichIds, pPool1 );\n }\n\n Reference< XInterface > SAL_CALL NamespaceMap_createInstance( sal_uInt16* pWhichIds, SfxItemPool* pPool )\n {\n return (XWeak*)new NamespaceMap( pWhichIds, pPool );\n }\n\n Sequence< OUString > SAL_CALL NamespaceMap_getSupportedServiceNames()\n throw()\n {\n Sequence< OUString > aSupportedServiceNames( 1 );\n aSupportedServiceNames[0] = OUString( RTL_CONSTASCII_USTRINGPARAM( \"com.sun.star.xml.NamespaceMap\" ) );\n return aSupportedServiceNames;\n }\n\n OUString SAL_CALL NamespaceMap_getImplementationName()\n throw()\n {\n return OUString( RTL_CONSTASCII_USTRINGPARAM( \"com.sun.star.comp.Svx.NamespaceMap\" ) );\n }\n\n\n\n class NamespaceIteratorImpl\n {\n private:\n SfxItemPool* mpPool;\n\n sal_uInt16* mpWhichId;\n\n sal_uInt16 mnItemCount;\n sal_uInt16 mnItem;\n\n const SvXMLAttrContainerItem* mpCurrentAttr;\n sal_uInt16 mnCurrentAttr;\n\n public:\n\n NamespaceIteratorImpl( sal_uInt16* pWhichIds, SfxItemPool* pPool );\n\n sal_Bool next( OUString& rPrefix, OUString& rURL );\n };\n}\n\nusing namespace ::svx;\n\n\/\/ -------------\n\nNamespaceIteratorImpl::NamespaceIteratorImpl( sal_uInt16* pWhichIds, SfxItemPool* pPool )\n{\n mpPool = pPool;\n mpCurrentAttr = NULL;\n mnCurrentAttr = 0;\n\n mpWhichId = pWhichIds;\n\n mnItem = 0;\n mnItemCount = (mpWhichId && (0 != *mpWhichId) && mpPool) ? mpPool->GetItemCount( *mpWhichId ) : 0;\n}\n\nsal_Bool NamespaceIteratorImpl::next( OUString& rPrefix, OUString& rURL )\n{\n \/\/ we still need to process the current attribute\n if( mpCurrentAttr && (mnCurrentAttr != USHRT_MAX) )\n {\n rPrefix = mpCurrentAttr->GetPrefix( mnCurrentAttr );\n rURL = mpCurrentAttr->GetNamespace( mnCurrentAttr );\n\n mnCurrentAttr = mpCurrentAttr->GetNextNamespaceIndex( mnCurrentAttr );\n return sal_True;\n }\n\n \/\/ we need the next namespace item\n mpCurrentAttr = NULL;\n\n const SfxPoolItem* pItem = 0;\n \/\/ look for the next available item in the current pool\n while( (mnItem < mnItemCount) && ( NULL == (pItem = mpPool->GetItem( *mpWhichId, mnItem ) ) ) )\n mnItem++;\n\n \/\/ are we finished with the current whichid?\n if( mnItem == mnItemCount )\n {\n mpWhichId++;\n\n \/\/ are we finished with the current pool?\n if( 0 != *mpWhichId )\n {\n mnItem = 0;\n mnItemCount = (mpWhichId && (0 != *mpWhichId) && mpPool) ? mpPool->GetItemCount( *mpWhichId ) : 0;\n return next( rPrefix, rURL );\n }\n\n pItem = NULL;\n }\n\n if( pItem )\n {\n mnItem++;\n\n \/\/ get that item and see if there namespaces inside\n const SvXMLAttrContainerItem *pUnknown = (const SvXMLAttrContainerItem *)pItem;\n if( (pUnknown->GetAttrCount() > 0) )\n {\n mpCurrentAttr = pUnknown;\n mnCurrentAttr = pUnknown->GetFirstNamespaceIndex();\n }\n return next( rPrefix, rURL );\n }\n\n return false;\n}\n\n\/\/ -------------\n\nNamespaceMap::NamespaceMap( sal_uInt16* pWhichIds, SfxItemPool* pPool )\n: mpWhichIds( pWhichIds ), mpPool( pPool )\n{\n}\n\nNamespaceMap::~NamespaceMap()\n{\n}\n\n\/\/ XNameAccess\nAny SAL_CALL NamespaceMap::getByName( const OUString& aName ) throw (NoSuchElementException, WrappedTargetException, RuntimeException)\n{\n NamespaceIteratorImpl aIter( mpWhichIds, mpPool );\n\n OUString aPrefix;\n OUString aURL;\n\n sal_Bool bFound;\n\n do\n {\n bFound = aIter.next( aPrefix, aURL );\n }\n while( bFound && (aPrefix != aName ) );\n\n if( !bFound )\n throw NoSuchElementException();\n\n return makeAny( aURL );\n}\n\nSequence< OUString > SAL_CALL NamespaceMap::getElementNames() throw (RuntimeException)\n{\n NamespaceIteratorImpl aIter( mpWhichIds, mpPool );\n\n OUString aPrefix;\n OUString aURL;\n\n std::set< OUString, comphelper::UStringLess > aPrefixSet;\n\n while( aIter.next( aPrefix, aURL ) )\n aPrefixSet.insert( aPrefix );\n\n Sequence< OUString > aSeq( aPrefixSet.size() );\n OUString* pPrefixes = aSeq.getArray();\n\n std::set< OUString, comphelper::UStringLess >::iterator aPrefixIter( aPrefixSet.begin() );\n const std::set< OUString, comphelper::UStringLess >::iterator aEnd( aPrefixSet.end() );\n\n while( aPrefixIter != aEnd )\n {\n *pPrefixes++ = *aPrefixIter++;\n }\n\n return aSeq;\n}\n\nsal_Bool SAL_CALL NamespaceMap::hasByName( const OUString& aName ) throw (RuntimeException)\n{\n NamespaceIteratorImpl aIter( mpWhichIds, mpPool );\n\n OUString aPrefix;\n OUString aURL;\n\n sal_Bool bFound;\n\n do\n {\n bFound = aIter.next( aPrefix, aURL );\n }\n while( bFound && (aPrefix != aName ) );\n\n return bFound;\n}\n\n\/\/ XElementAccess\nType SAL_CALL NamespaceMap::getElementType() throw (RuntimeException)\n{\n return ::getCppuType( (const OUString*) 0 );\n}\n\nsal_Bool SAL_CALL NamespaceMap::hasElements() throw (RuntimeException)\n{\n NamespaceIteratorImpl aIter( mpWhichIds, mpPool );\n\n OUString aPrefix;\n OUString aURL;\n\n return aIter.next( aPrefix, aURL );\n}\n\n\/\/ XServiceInfo\nOUString SAL_CALL NamespaceMap::getImplementationName( )\n throw(RuntimeException)\n{\n return NamespaceMap_getImplementationName();\n}\n\nsal_Bool SAL_CALL NamespaceMap::supportsService( const OUString& )\n throw(RuntimeException)\n{\n return sal_True;\n}\n\nSequence< OUString > SAL_CALL NamespaceMap::getSupportedServiceNames( )\n throw(RuntimeException)\n{\n return NamespaceMap_getSupportedServiceNames();\n}\n\n<commit_msg>INTEGRATION: CWS obo30 (1.8.90); FILE MERGED 2008\/06\/02 12:27:51 obo 1.8.90.1: #i90100# ambigous Reference during ENABLE_PCH build<commit_after>\/*************************************************************************\n *\n * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.\n *\n * Copyright 2008 by Sun Microsystems, Inc.\n *\n * OpenOffice.org - a multi-platform office productivity suite\n *\n * $RCSfile: UnoNamespaceMap.cxx,v $\n * $Revision: 1.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_svx.hxx\"\n\n#include <set>\n\n#include \"UnoNamespaceMap.hxx\"\n#include <com\/sun\/star\/container\/XNameAccess.hpp>\n#include <com\/sun\/star\/lang\/XServiceInfo.hpp>\n\n#ifndef _CPPUHELPER_IMPLBASE3_HXX_\n#include <cppuhelper\/implbase2.hxx>\n#endif\n#include <osl\/diagnose.h>\n#include <osl\/mutex.hxx>\n#include <comphelper\/stl_types.hxx>\n#include <svtools\/itempool.hxx>\n#include \"unoapi.hxx\"\n#include \"xmlcnitm.hxx\"\n\n\nusing namespace ::comphelper;\nusing namespace ::osl;\nusing namespace ::cppu;\nusing namespace ::com::sun::star;\nusing namespace ::com::sun::star::uno;\nusing namespace ::com::sun::star::container;\nusing namespace ::com::sun::star::drawing;\nusing namespace ::com::sun::star::lang;\nusing namespace ::com::sun::star::beans;\n\nnamespace svx\n{\n \/** implements a component to export namespaces of all SvXMLAttrContainerItem inside\n one or two pools with a variable count of which ids.\n *\/\n class NamespaceMap : public WeakImplHelper2< XNameAccess, XServiceInfo >\n {\n private:\n sal_uInt16* mpWhichIds;\n SfxItemPool* mpPool;\n\n public:\n NamespaceMap( sal_uInt16* pWhichIds, SfxItemPool* pPool );\n virtual ~NamespaceMap();\n\n \/\/ XNameAccess\n virtual Any SAL_CALL getByName( const ::rtl::OUString& aName ) throw (NoSuchElementException, WrappedTargetException, RuntimeException);\n virtual Sequence< ::rtl::OUString > SAL_CALL getElementNames( ) throw (RuntimeException);\n virtual sal_Bool SAL_CALL hasByName( const ::rtl::OUString& aName ) throw (RuntimeException);\n\n \/\/ XElementAccess\n virtual Type SAL_CALL getElementType( ) throw (RuntimeException);\n virtual sal_Bool SAL_CALL hasElements( ) throw (RuntimeException);\n\n \/\/ XServiceInfo\n virtual ::rtl::OUString SAL_CALL getImplementationName( ) throw(RuntimeException);\n virtual sal_Bool SAL_CALL supportsService( const ::rtl::OUString& ServiceName ) throw(RuntimeException);\n virtual Sequence< ::rtl::OUString > SAL_CALL getSupportedServiceNames( ) throw(RuntimeException);\n };\n\n Reference< XInterface > SAL_CALL NamespaceMap_createInstance( sal_uInt16* pWhichIds, SfxItemPool* pPool1, SfxItemPool* )\n {\n return (XWeak*)new NamespaceMap( pWhichIds, pPool1 );\n }\n\n Reference< XInterface > SAL_CALL NamespaceMap_createInstance( sal_uInt16* pWhichIds, SfxItemPool* pPool )\n {\n return (XWeak*)new NamespaceMap( pWhichIds, pPool );\n }\n\n Sequence< ::rtl::OUString > SAL_CALL NamespaceMap_getSupportedServiceNames()\n throw()\n {\n Sequence< ::rtl::OUString > aSupportedServiceNames( 1 );\n aSupportedServiceNames[0] = ::rtl::OUString( RTL_CONSTASCII_USTRINGPARAM( \"com.sun.star.xml.NamespaceMap\" ) );\n return aSupportedServiceNames;\n }\n\n ::rtl::OUString SAL_CALL NamespaceMap_getImplementationName()\n throw()\n {\n return ::rtl::OUString( RTL_CONSTASCII_USTRINGPARAM( \"com.sun.star.comp.Svx.NamespaceMap\" ) );\n }\n\n\n\n class NamespaceIteratorImpl\n {\n private:\n SfxItemPool* mpPool;\n\n sal_uInt16* mpWhichId;\n\n sal_uInt16 mnItemCount;\n sal_uInt16 mnItem;\n\n const SvXMLAttrContainerItem* mpCurrentAttr;\n sal_uInt16 mnCurrentAttr;\n\n public:\n\n NamespaceIteratorImpl( sal_uInt16* pWhichIds, SfxItemPool* pPool );\n\n sal_Bool next( ::rtl::OUString& rPrefix, ::rtl::OUString& rURL );\n };\n}\n\nusing namespace ::svx;\n\n\/\/ -------------\n\nNamespaceIteratorImpl::NamespaceIteratorImpl( sal_uInt16* pWhichIds, SfxItemPool* pPool )\n{\n mpPool = pPool;\n mpCurrentAttr = NULL;\n mnCurrentAttr = 0;\n\n mpWhichId = pWhichIds;\n\n mnItem = 0;\n mnItemCount = (mpWhichId && (0 != *mpWhichId) && mpPool) ? mpPool->GetItemCount( *mpWhichId ) : 0;\n}\n\nsal_Bool NamespaceIteratorImpl::next( ::rtl::OUString& rPrefix, ::rtl::OUString& rURL )\n{\n \/\/ we still need to process the current attribute\n if( mpCurrentAttr && (mnCurrentAttr != USHRT_MAX) )\n {\n rPrefix = mpCurrentAttr->GetPrefix( mnCurrentAttr );\n rURL = mpCurrentAttr->GetNamespace( mnCurrentAttr );\n\n mnCurrentAttr = mpCurrentAttr->GetNextNamespaceIndex( mnCurrentAttr );\n return sal_True;\n }\n\n \/\/ we need the next namespace item\n mpCurrentAttr = NULL;\n\n const SfxPoolItem* pItem = 0;\n \/\/ look for the next available item in the current pool\n while( (mnItem < mnItemCount) && ( NULL == (pItem = mpPool->GetItem( *mpWhichId, mnItem ) ) ) )\n mnItem++;\n\n \/\/ are we finished with the current whichid?\n if( mnItem == mnItemCount )\n {\n mpWhichId++;\n\n \/\/ are we finished with the current pool?\n if( 0 != *mpWhichId )\n {\n mnItem = 0;\n mnItemCount = (mpWhichId && (0 != *mpWhichId) && mpPool) ? mpPool->GetItemCount( *mpWhichId ) : 0;\n return next( rPrefix, rURL );\n }\n\n pItem = NULL;\n }\n\n if( pItem )\n {\n mnItem++;\n\n \/\/ get that item and see if there namespaces inside\n const SvXMLAttrContainerItem *pUnknown = (const SvXMLAttrContainerItem *)pItem;\n if( (pUnknown->GetAttrCount() > 0) )\n {\n mpCurrentAttr = pUnknown;\n mnCurrentAttr = pUnknown->GetFirstNamespaceIndex();\n }\n return next( rPrefix, rURL );\n }\n\n return false;\n}\n\n\/\/ -------------\n\nNamespaceMap::NamespaceMap( sal_uInt16* pWhichIds, SfxItemPool* pPool )\n: mpWhichIds( pWhichIds ), mpPool( pPool )\n{\n}\n\nNamespaceMap::~NamespaceMap()\n{\n}\n\n\/\/ XNameAccess\nAny SAL_CALL NamespaceMap::getByName( const ::rtl::OUString& aName ) throw (NoSuchElementException, WrappedTargetException, RuntimeException)\n{\n NamespaceIteratorImpl aIter( mpWhichIds, mpPool );\n\n ::rtl::OUString aPrefix;\n ::rtl::OUString aURL;\n\n sal_Bool bFound;\n\n do\n {\n bFound = aIter.next( aPrefix, aURL );\n }\n while( bFound && (aPrefix != aName ) );\n\n if( !bFound )\n throw NoSuchElementException();\n\n return makeAny( aURL );\n}\n\nSequence< ::rtl::OUString > SAL_CALL NamespaceMap::getElementNames() throw (RuntimeException)\n{\n NamespaceIteratorImpl aIter( mpWhichIds, mpPool );\n\n ::rtl::OUString aPrefix;\n ::rtl::OUString aURL;\n\n std::set< ::rtl::OUString, comphelper::UStringLess > aPrefixSet;\n\n while( aIter.next( aPrefix, aURL ) )\n aPrefixSet.insert( aPrefix );\n\n Sequence< ::rtl::OUString > aSeq( aPrefixSet.size() );\n ::rtl::OUString* pPrefixes = aSeq.getArray();\n\n std::set< ::rtl::OUString, comphelper::UStringLess >::iterator aPrefixIter( aPrefixSet.begin() );\n const std::set< ::rtl::OUString, comphelper::UStringLess >::iterator aEnd( aPrefixSet.end() );\n\n while( aPrefixIter != aEnd )\n {\n *pPrefixes++ = *aPrefixIter++;\n }\n\n return aSeq;\n}\n\nsal_Bool SAL_CALL NamespaceMap::hasByName( const ::rtl::OUString& aName ) throw (RuntimeException)\n{\n NamespaceIteratorImpl aIter( mpWhichIds, mpPool );\n\n ::rtl::OUString aPrefix;\n ::rtl::OUString aURL;\n\n sal_Bool bFound;\n\n do\n {\n bFound = aIter.next( aPrefix, aURL );\n }\n while( bFound && (aPrefix != aName ) );\n\n return bFound;\n}\n\n\/\/ XElementAccess\nType SAL_CALL NamespaceMap::getElementType() throw (RuntimeException)\n{\n return ::getCppuType( (const ::rtl::OUString*) 0 );\n}\n\nsal_Bool SAL_CALL NamespaceMap::hasElements() throw (RuntimeException)\n{\n NamespaceIteratorImpl aIter( mpWhichIds, mpPool );\n\n ::rtl::OUString aPrefix;\n ::rtl::OUString aURL;\n\n return aIter.next( aPrefix, aURL );\n}\n\n\/\/ XServiceInfo\n::rtl::OUString SAL_CALL NamespaceMap::getImplementationName( )\n throw(RuntimeException)\n{\n return NamespaceMap_getImplementationName();\n}\n\nsal_Bool SAL_CALL NamespaceMap::supportsService( const ::rtl::OUString& )\n throw(RuntimeException)\n{\n return sal_True;\n}\n\nSequence< ::rtl::OUString > SAL_CALL NamespaceMap::getSupportedServiceNames( )\n throw(RuntimeException)\n{\n return NamespaceMap_getSupportedServiceNames();\n}\n<|endoftext|>"} {"text":"<commit_before>\/*************************************************************************\n *\n * OpenOffice.org - a multi-platform office productivity suite\n *\n * $RCSfile: UnoNamespaceMap.cxx,v $\n *\n * $Revision: 1.4 $\n *\n * last change: $Author: rt $ $Date: 2005-09-09 01: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\n#include <set>\n\n#include \"UnoNamespaceMap.hxx\"\n\n#ifndef _COM_SUN_STAR_CONTAINER_XNAMEACCESS_HPP_\n#include <com\/sun\/star\/container\/XNameAccess.hpp>\n#endif\n\n#ifndef _COM_SUN_STAR_LANG_XSERVICEINFO_HPP_\n#include <com\/sun\/star\/lang\/XServiceInfo.hpp>\n#endif\n\n#ifndef _CPPUHELPER_IMPLBASE3_HXX_\n#include <cppuhelper\/implbase2.hxx>\n#endif\n\n#ifndef _OSL_DIAGNOSE_H_\n#include <osl\/diagnose.h>\n#endif\n\n#ifndef _OSL_MUTEX_HXX_\n#include <osl\/mutex.hxx>\n#endif\n\n#ifndef _COMPHELPER_STLTYPES_HXX_\n#include <comphelper\/stl_types.hxx>\n#endif\n\n#ifndef _SFXITEMPOOL_HXX\n#include <svtools\/itempool.hxx>\n#endif\n\n#ifndef _SVX_UNOAPI_HXX_\n#include \"unoapi.hxx\"\n#endif\n\n#ifndef _SVX_XMLCNITM_HXX\n#include \"xmlcnitm.hxx\"\n#endif\n\n\nusing namespace ::comphelper;\nusing namespace ::osl;\nusing namespace ::rtl;\nusing namespace ::cppu;\nusing namespace ::com::sun::star;\nusing namespace ::com::sun::star::uno;\nusing namespace ::com::sun::star::container;\nusing namespace ::com::sun::star::drawing;\nusing namespace ::com::sun::star::lang;\nusing namespace ::com::sun::star::beans;\n\nnamespace svx\n{\n \/** implements a component to export namespaces of all SvXMLAttrContainerItem inside\n one or two pools with a variable count of which ids.\n *\/\n class NamespaceMap : public WeakImplHelper2< XNameAccess, XServiceInfo >\n {\n private:\n sal_uInt16* mpWhichIds;\n SfxItemPool* mpPool;\n\n public:\n NamespaceMap( sal_uInt16* pWhichIds, SfxItemPool* pPool );\n virtual ~NamespaceMap();\n\n \/\/ XNameAccess\n virtual Any SAL_CALL getByName( const OUString& aName ) throw (NoSuchElementException, WrappedTargetException, RuntimeException);\n virtual Sequence< OUString > SAL_CALL getElementNames( ) throw (RuntimeException);\n virtual sal_Bool SAL_CALL hasByName( const OUString& aName ) throw (RuntimeException);\n\n \/\/ XElementAccess\n virtual Type SAL_CALL getElementType( ) throw (RuntimeException);\n virtual sal_Bool SAL_CALL hasElements( ) throw (RuntimeException);\n\n \/\/ XServiceInfo\n virtual OUString SAL_CALL getImplementationName( ) throw(RuntimeException);\n virtual sal_Bool SAL_CALL supportsService( const OUString& ServiceName ) throw(RuntimeException);\n virtual Sequence< OUString > SAL_CALL getSupportedServiceNames( ) throw(RuntimeException);\n };\n\n Reference< XInterface > SAL_CALL NamespaceMap_createInstance( sal_uInt16* pWhichIds, SfxItemPool* pPool1, SfxItemPool* pPool2 )\n {\n return (XWeak*)new NamespaceMap( pWhichIds, pPool1 );\n }\n\n Reference< XInterface > SAL_CALL NamespaceMap_createInstance( sal_uInt16* pWhichIds, SfxItemPool* pPool )\n {\n return (XWeak*)new NamespaceMap( pWhichIds, pPool );\n }\n\n Sequence< OUString > SAL_CALL NamespaceMap_getSupportedServiceNames()\n throw()\n {\n Sequence< OUString > aSupportedServiceNames( 1 );\n aSupportedServiceNames[0] = OUString( RTL_CONSTASCII_USTRINGPARAM( \"com.sun.star.xml.NamespaceMap\" ) );\n return aSupportedServiceNames;\n }\n\n OUString SAL_CALL NamespaceMap_getImplementationName()\n throw()\n {\n return OUString( RTL_CONSTASCII_USTRINGPARAM( \"com.sun.star.comp.Svx.NamespaceMap\" ) );\n }\n\n\n\n class NamespaceIteratorImpl\n {\n private:\n SfxItemPool* mpPool;\n\n sal_uInt16* mpWhichId;\n\n sal_uInt16 mnItemCount;\n sal_uInt16 mnItem;\n\n const SvXMLAttrContainerItem* mpCurrentAttr;\n sal_uInt16 mnCurrentAttr;\n\n public:\n\n NamespaceIteratorImpl( sal_uInt16* pWhichIds, SfxItemPool* pPool );\n\n sal_Bool next( OUString& rPrefix, OUString& rURL );\n };\n}\n\nusing namespace ::svx;\n\n\/\/ -------------\n\nNamespaceIteratorImpl::NamespaceIteratorImpl( sal_uInt16* pWhichIds, SfxItemPool* pPool )\n{\n mpPool = pPool;\n mpCurrentAttr = NULL;\n mnCurrentAttr = 0;\n\n mpWhichId = pWhichIds;\n\n mnItem = 0;\n mnItemCount = (mpWhichId && (0 != *mpWhichId) && mpPool) ? mpPool->GetItemCount( *mpWhichId ) : 0;\n}\n\nsal_Bool NamespaceIteratorImpl::next( OUString& rPrefix, OUString& rURL )\n{\n \/\/ we still need to process the current attribute\n if( mpCurrentAttr && (mnCurrentAttr != USHRT_MAX) )\n {\n rPrefix = mpCurrentAttr->GetPrefix( mnCurrentAttr );\n rURL = mpCurrentAttr->GetNamespace( mnCurrentAttr );\n\n mnCurrentAttr = mpCurrentAttr->GetNextNamespaceIndex( mnCurrentAttr );\n return sal_True;\n }\n\n \/\/ we need the next namespace item\n mpCurrentAttr = NULL;\n\n const SfxPoolItem* pItem;\n \/\/ look for the next available item in the current pool\n while( (mnItem < mnItemCount) && ( NULL == (pItem = mpPool->GetItem( *mpWhichId, mnItem ) ) ) )\n mnItem++;\n\n \/\/ are we finished with the current whichid?\n if( mnItem == mnItemCount )\n {\n mpWhichId++;\n\n \/\/ are we finished with the current pool?\n if( 0 != *mpWhichId )\n {\n mnItem = 0;\n mnItemCount = (mpWhichId && (0 != *mpWhichId) && mpPool) ? mpPool->GetItemCount( *mpWhichId ) : 0;\n return next( rPrefix, rURL );\n }\n\n pItem = NULL;\n }\n\n if( pItem )\n {\n mnItem++;\n\n \/\/ get that item and see if there namespaces inside\n const SvXMLAttrContainerItem *pUnknown = (const SvXMLAttrContainerItem *)pItem;\n if( (pUnknown->GetAttrCount() > 0) )\n {\n mpCurrentAttr = pUnknown;\n mnCurrentAttr = pUnknown->GetFirstNamespaceIndex();\n }\n return next( rPrefix, rURL );\n }\n\n return false;\n}\n\n\/\/ -------------\n\nNamespaceMap::NamespaceMap( sal_uInt16* pWhichIds, SfxItemPool* pPool )\n: mpWhichIds( pWhichIds ), mpPool( pPool )\n{\n}\n\nNamespaceMap::~NamespaceMap()\n{\n}\n\n\/\/ XNameAccess\nAny SAL_CALL NamespaceMap::getByName( const OUString& aName ) throw (NoSuchElementException, WrappedTargetException, RuntimeException)\n{\n NamespaceIteratorImpl aIter( mpWhichIds, mpPool );\n\n OUString aPrefix;\n OUString aURL;\n\n sal_Bool bFound;\n\n do\n {\n bFound = aIter.next( aPrefix, aURL );\n }\n while( bFound && (aPrefix != aName ) );\n\n if( !bFound )\n throw NoSuchElementException();\n\n return makeAny( aURL );\n}\n\nSequence< OUString > SAL_CALL NamespaceMap::getElementNames() throw (RuntimeException)\n{\n NamespaceIteratorImpl aIter( mpWhichIds, mpPool );\n\n OUString aPrefix;\n OUString aURL;\n\n std::set< OUString, comphelper::UStringLess > aPrefixSet;\n\n while( aIter.next( aPrefix, aURL ) )\n aPrefixSet.insert( aPrefix );\n\n Sequence< OUString > aSeq( aPrefixSet.size() );\n OUString* pPrefixes = aSeq.getArray();\n\n std::set< OUString, comphelper::UStringLess >::iterator aPrefixIter( aPrefixSet.begin() );\n const std::set< OUString, comphelper::UStringLess >::iterator aEnd( aPrefixSet.end() );\n\n while( aPrefixIter != aEnd )\n {\n *pPrefixes++ = *aPrefixIter++;\n }\n\n return aSeq;\n}\n\nsal_Bool SAL_CALL NamespaceMap::hasByName( const OUString& aName ) throw (RuntimeException)\n{\n NamespaceIteratorImpl aIter( mpWhichIds, mpPool );\n\n OUString aPrefix;\n OUString aURL;\n\n sal_Bool bFound;\n\n do\n {\n bFound = aIter.next( aPrefix, aURL );\n }\n while( bFound && (aPrefix != aName ) );\n\n return bFound;\n}\n\n\/\/ XElementAccess\nType SAL_CALL NamespaceMap::getElementType() throw (RuntimeException)\n{\n return ::getCppuType( (const OUString*) 0 );\n}\n\nsal_Bool SAL_CALL NamespaceMap::hasElements() throw (RuntimeException)\n{\n NamespaceIteratorImpl aIter( mpWhichIds, mpPool );\n\n OUString aPrefix;\n OUString aURL;\n\n return aIter.next( aPrefix, aURL );\n}\n\n\/\/ XServiceInfo\nOUString SAL_CALL NamespaceMap::getImplementationName( )\n throw(RuntimeException)\n{\n return NamespaceMap_getImplementationName();\n}\n\nsal_Bool SAL_CALL NamespaceMap::supportsService( const OUString& ServiceName )\n throw(RuntimeException)\n{\n return sal_True;\n}\n\nSequence< OUString > SAL_CALL NamespaceMap::getSupportedServiceNames( )\n throw(RuntimeException)\n{\n return NamespaceMap_getSupportedServiceNames();\n}\n\n<commit_msg>INTEGRATION: CWS warnings01 (1.4.222); FILE MERGED 2006\/02\/17 15:22:23 cl 1.4.222.1: warning free code changes<commit_after>\/*************************************************************************\n *\n * OpenOffice.org - a multi-platform office productivity suite\n *\n * $RCSfile: UnoNamespaceMap.cxx,v $\n *\n * $Revision: 1.5 $\n *\n * last change: $Author: hr $ $Date: 2006-06-19 16:53:42 $\n *\n * The Contents of this file are made available subject to\n * the terms of GNU Lesser General Public License Version 2.1.\n *\n *\n * GNU Lesser General Public License Version 2.1\n * =============================================\n * Copyright 2005 by Sun Microsystems, Inc.\n * 901 San Antonio Road, Palo Alto, CA 94303, USA\n *\n * This library is free software; you can redistribute it and\/or\n * modify it under the terms of the GNU Lesser General Public\n * License version 2.1, as published by the Free Software Foundation.\n *\n * This library is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU\n * Lesser General Public License for more details.\n *\n * You should have received a copy of the GNU Lesser General Public\n * License along with this library; if not, write to the Free Software\n * Foundation, Inc., 59 Temple Place, Suite 330, Boston,\n * MA 02111-1307 USA\n *\n ************************************************************************\/\n\n#include <set>\n\n#include \"UnoNamespaceMap.hxx\"\n\n#ifndef _COM_SUN_STAR_CONTAINER_XNAMEACCESS_HPP_\n#include <com\/sun\/star\/container\/XNameAccess.hpp>\n#endif\n\n#ifndef _COM_SUN_STAR_LANG_XSERVICEINFO_HPP_\n#include <com\/sun\/star\/lang\/XServiceInfo.hpp>\n#endif\n\n#ifndef _CPPUHELPER_IMPLBASE3_HXX_\n#include <cppuhelper\/implbase2.hxx>\n#endif\n\n#ifndef _OSL_DIAGNOSE_H_\n#include <osl\/diagnose.h>\n#endif\n\n#ifndef _OSL_MUTEX_HXX_\n#include <osl\/mutex.hxx>\n#endif\n\n#ifndef _COMPHELPER_STLTYPES_HXX_\n#include <comphelper\/stl_types.hxx>\n#endif\n\n#ifndef _SFXITEMPOOL_HXX\n#include <svtools\/itempool.hxx>\n#endif\n\n#ifndef _SVX_UNOAPI_HXX_\n#include \"unoapi.hxx\"\n#endif\n\n#ifndef _SVX_XMLCNITM_HXX\n#include \"xmlcnitm.hxx\"\n#endif\n\n\nusing namespace ::comphelper;\nusing namespace ::osl;\nusing namespace ::rtl;\nusing namespace ::cppu;\nusing namespace ::com::sun::star;\nusing namespace ::com::sun::star::uno;\nusing namespace ::com::sun::star::container;\nusing namespace ::com::sun::star::drawing;\nusing namespace ::com::sun::star::lang;\nusing namespace ::com::sun::star::beans;\n\nnamespace svx\n{\n \/** implements a component to export namespaces of all SvXMLAttrContainerItem inside\n one or two pools with a variable count of which ids.\n *\/\n class NamespaceMap : public WeakImplHelper2< XNameAccess, XServiceInfo >\n {\n private:\n sal_uInt16* mpWhichIds;\n SfxItemPool* mpPool;\n\n public:\n NamespaceMap( sal_uInt16* pWhichIds, SfxItemPool* pPool );\n virtual ~NamespaceMap();\n\n \/\/ XNameAccess\n virtual Any SAL_CALL getByName( const OUString& aName ) throw (NoSuchElementException, WrappedTargetException, RuntimeException);\n virtual Sequence< OUString > SAL_CALL getElementNames( ) throw (RuntimeException);\n virtual sal_Bool SAL_CALL hasByName( const OUString& aName ) throw (RuntimeException);\n\n \/\/ XElementAccess\n virtual Type SAL_CALL getElementType( ) throw (RuntimeException);\n virtual sal_Bool SAL_CALL hasElements( ) throw (RuntimeException);\n\n \/\/ XServiceInfo\n virtual OUString SAL_CALL getImplementationName( ) throw(RuntimeException);\n virtual sal_Bool SAL_CALL supportsService( const OUString& ServiceName ) throw(RuntimeException);\n virtual Sequence< OUString > SAL_CALL getSupportedServiceNames( ) throw(RuntimeException);\n };\n\n Reference< XInterface > SAL_CALL NamespaceMap_createInstance( sal_uInt16* pWhichIds, SfxItemPool* pPool1, SfxItemPool* )\n {\n return (XWeak*)new NamespaceMap( pWhichIds, pPool1 );\n }\n\n Reference< XInterface > SAL_CALL NamespaceMap_createInstance( sal_uInt16* pWhichIds, SfxItemPool* pPool )\n {\n return (XWeak*)new NamespaceMap( pWhichIds, pPool );\n }\n\n Sequence< OUString > SAL_CALL NamespaceMap_getSupportedServiceNames()\n throw()\n {\n Sequence< OUString > aSupportedServiceNames( 1 );\n aSupportedServiceNames[0] = OUString( RTL_CONSTASCII_USTRINGPARAM( \"com.sun.star.xml.NamespaceMap\" ) );\n return aSupportedServiceNames;\n }\n\n OUString SAL_CALL NamespaceMap_getImplementationName()\n throw()\n {\n return OUString( RTL_CONSTASCII_USTRINGPARAM( \"com.sun.star.comp.Svx.NamespaceMap\" ) );\n }\n\n\n\n class NamespaceIteratorImpl\n {\n private:\n SfxItemPool* mpPool;\n\n sal_uInt16* mpWhichId;\n\n sal_uInt16 mnItemCount;\n sal_uInt16 mnItem;\n\n const SvXMLAttrContainerItem* mpCurrentAttr;\n sal_uInt16 mnCurrentAttr;\n\n public:\n\n NamespaceIteratorImpl( sal_uInt16* pWhichIds, SfxItemPool* pPool );\n\n sal_Bool next( OUString& rPrefix, OUString& rURL );\n };\n}\n\nusing namespace ::svx;\n\n\/\/ -------------\n\nNamespaceIteratorImpl::NamespaceIteratorImpl( sal_uInt16* pWhichIds, SfxItemPool* pPool )\n{\n mpPool = pPool;\n mpCurrentAttr = NULL;\n mnCurrentAttr = 0;\n\n mpWhichId = pWhichIds;\n\n mnItem = 0;\n mnItemCount = (mpWhichId && (0 != *mpWhichId) && mpPool) ? mpPool->GetItemCount( *mpWhichId ) : 0;\n}\n\nsal_Bool NamespaceIteratorImpl::next( OUString& rPrefix, OUString& rURL )\n{\n \/\/ we still need to process the current attribute\n if( mpCurrentAttr && (mnCurrentAttr != USHRT_MAX) )\n {\n rPrefix = mpCurrentAttr->GetPrefix( mnCurrentAttr );\n rURL = mpCurrentAttr->GetNamespace( mnCurrentAttr );\n\n mnCurrentAttr = mpCurrentAttr->GetNextNamespaceIndex( mnCurrentAttr );\n return sal_True;\n }\n\n \/\/ we need the next namespace item\n mpCurrentAttr = NULL;\n\n const SfxPoolItem* pItem;\n \/\/ look for the next available item in the current pool\n while( (mnItem < mnItemCount) && ( NULL == (pItem = mpPool->GetItem( *mpWhichId, mnItem ) ) ) )\n mnItem++;\n\n \/\/ are we finished with the current whichid?\n if( mnItem == mnItemCount )\n {\n mpWhichId++;\n\n \/\/ are we finished with the current pool?\n if( 0 != *mpWhichId )\n {\n mnItem = 0;\n mnItemCount = (mpWhichId && (0 != *mpWhichId) && mpPool) ? mpPool->GetItemCount( *mpWhichId ) : 0;\n return next( rPrefix, rURL );\n }\n\n pItem = NULL;\n }\n\n if( pItem )\n {\n mnItem++;\n\n \/\/ get that item and see if there namespaces inside\n const SvXMLAttrContainerItem *pUnknown = (const SvXMLAttrContainerItem *)pItem;\n if( (pUnknown->GetAttrCount() > 0) )\n {\n mpCurrentAttr = pUnknown;\n mnCurrentAttr = pUnknown->GetFirstNamespaceIndex();\n }\n return next( rPrefix, rURL );\n }\n\n return false;\n}\n\n\/\/ -------------\n\nNamespaceMap::NamespaceMap( sal_uInt16* pWhichIds, SfxItemPool* pPool )\n: mpWhichIds( pWhichIds ), mpPool( pPool )\n{\n}\n\nNamespaceMap::~NamespaceMap()\n{\n}\n\n\/\/ XNameAccess\nAny SAL_CALL NamespaceMap::getByName( const OUString& aName ) throw (NoSuchElementException, WrappedTargetException, RuntimeException)\n{\n NamespaceIteratorImpl aIter( mpWhichIds, mpPool );\n\n OUString aPrefix;\n OUString aURL;\n\n sal_Bool bFound;\n\n do\n {\n bFound = aIter.next( aPrefix, aURL );\n }\n while( bFound && (aPrefix != aName ) );\n\n if( !bFound )\n throw NoSuchElementException();\n\n return makeAny( aURL );\n}\n\nSequence< OUString > SAL_CALL NamespaceMap::getElementNames() throw (RuntimeException)\n{\n NamespaceIteratorImpl aIter( mpWhichIds, mpPool );\n\n OUString aPrefix;\n OUString aURL;\n\n std::set< OUString, comphelper::UStringLess > aPrefixSet;\n\n while( aIter.next( aPrefix, aURL ) )\n aPrefixSet.insert( aPrefix );\n\n Sequence< OUString > aSeq( aPrefixSet.size() );\n OUString* pPrefixes = aSeq.getArray();\n\n std::set< OUString, comphelper::UStringLess >::iterator aPrefixIter( aPrefixSet.begin() );\n const std::set< OUString, comphelper::UStringLess >::iterator aEnd( aPrefixSet.end() );\n\n while( aPrefixIter != aEnd )\n {\n *pPrefixes++ = *aPrefixIter++;\n }\n\n return aSeq;\n}\n\nsal_Bool SAL_CALL NamespaceMap::hasByName( const OUString& aName ) throw (RuntimeException)\n{\n NamespaceIteratorImpl aIter( mpWhichIds, mpPool );\n\n OUString aPrefix;\n OUString aURL;\n\n sal_Bool bFound;\n\n do\n {\n bFound = aIter.next( aPrefix, aURL );\n }\n while( bFound && (aPrefix != aName ) );\n\n return bFound;\n}\n\n\/\/ XElementAccess\nType SAL_CALL NamespaceMap::getElementType() throw (RuntimeException)\n{\n return ::getCppuType( (const OUString*) 0 );\n}\n\nsal_Bool SAL_CALL NamespaceMap::hasElements() throw (RuntimeException)\n{\n NamespaceIteratorImpl aIter( mpWhichIds, mpPool );\n\n OUString aPrefix;\n OUString aURL;\n\n return aIter.next( aPrefix, aURL );\n}\n\n\/\/ XServiceInfo\nOUString SAL_CALL NamespaceMap::getImplementationName( )\n throw(RuntimeException)\n{\n return NamespaceMap_getImplementationName();\n}\n\nsal_Bool SAL_CALL NamespaceMap::supportsService( const OUString& )\n throw(RuntimeException)\n{\n return sal_True;\n}\n\nSequence< OUString > SAL_CALL NamespaceMap::getSupportedServiceNames( )\n throw(RuntimeException)\n{\n return NamespaceMap_getSupportedServiceNames();\n}\n\n<|endoftext|>"} {"text":"<commit_before>\/*\nCopyright (c) 2014 Ableton AG, Berlin\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\/\/ clang-format off\n\n#pragma once\n\n#if defined(__clang__)\n\n #if __has_warning(\"-Wunused-local-typedef\")\n #define ABL_PRAGMA_CLANG_DIAGNOSTIC_IGNORED_UNUSED_LOCAL_TYPEDEF \\\n _Pragma(\"clang diagnostic ignored \\\"-Wunused-local-typedef\\\"\")\n #else\n #define ABL_PRAGMA_CLANG_DIAGNOSTIC_IGNORED_UNUSED_LOCAL_TYPEDEF\n #endif\n\n #define SUPPRESS_WARNINGS \\\n _Pragma(\"clang diagnostic push\") \\\n _Pragma(\"clang diagnostic ignored \\\"-Wconversion\\\"\") \\\n _Pragma(\"clang diagnostic ignored \\\"-Wconditional-uninitialized\\\"\") \\\n _Pragma(\"clang diagnostic ignored \\\"-Wcovered-switch-default\\\"\") \\\n _Pragma(\"clang diagnostic ignored \\\"-Wdeprecated\\\"\") \\\n _Pragma(\"clang diagnostic ignored \\\"-Wdisabled-macro-expansion\\\"\") \\\n _Pragma(\"clang diagnostic ignored \\\"-Wdocumentation-unknown-command\\\"\") \\\n _Pragma(\"clang diagnostic ignored \\\"-Wdocumentation\\\"\") \\\n _Pragma(\"clang diagnostic ignored \\\"-Wexit-time-destructors\\\"\") \\\n _Pragma(\"clang diagnostic ignored \\\"-Wextra-semi\\\"\") \\\n _Pragma(\"clang diagnostic ignored \\\"-Wfloat-equal\\\"\") \\\n _Pragma(\"clang diagnostic ignored \\\"-Wglobal-constructors\\\"\") \\\n _Pragma(\"clang diagnostic ignored \\\"-Wheader-hygiene\\\"\") \\\n _Pragma(\"clang diagnostic ignored \\\"-Wmissing-noreturn\\\"\") \\\n _Pragma(\"clang diagnostic ignored \\\"-Wmissing-prototypes\\\"\") \\\n _Pragma(\"clang diagnostic ignored \\\"-Wold-style-cast\\\"\") \\\n _Pragma(\"clang diagnostic ignored \\\"-Wpadded\\\"\") \\\n _Pragma(\"clang diagnostic ignored \\\"-Wshadow\\\"\") \\\n _Pragma(\"clang diagnostic ignored \\\"-Wshift-sign-overflow\\\"\") \\\n _Pragma(\"clang diagnostic ignored \\\"-Wshorten-64-to-32\\\"\") \\\n _Pragma(\"clang diagnostic ignored \\\"-Wsign-compare\\\"\") \\\n _Pragma(\"clang diagnostic ignored \\\"-Wsign-conversion\\\"\") \\\n _Pragma(\"clang diagnostic ignored \\\"-Wswitch-enum\\\"\") \\\n _Pragma(\"clang diagnostic ignored \\\"-Wundef\\\"\") \\\n _Pragma(\"clang diagnostic ignored \\\"-Wunreachable-code\\\"\") \\\n _Pragma(\"clang diagnostic ignored \\\"-Wunused-parameter\\\"\") \\\n _Pragma(\"clang diagnostic ignored \\\"-Wused-but-marked-unused\\\"\") \\\n _Pragma(\"clang diagnostic ignored \\\"-Wweak-vtables\\\"\") \\\n ABL_PRAGMA_CLANG_DIAGNOSTIC_IGNORED_UNUSED_LOCAL_TYPEDEF\n\n #define RESTORE_WARNINGS \\\n _Pragma(\"clang diagnostic pop\")\n\n#elif defined(_MSC_VER)\n\n \/**\n * C4100: 'identifier' : unreferenced formal parameter\n * C4127: conditional expression is constant\n * C4244: 'conversion' conversion from 'type1' to 'type2', possible loss of data\n * C4251: 'identifier' : class 'type' needs to have dll-interface to be used by clients of class 'type2'\n * C4365: 'action' : conversion from 'type_1' to 'type_2', signed\/unsigned mismatch\n * C4388: signed\/unsigned mismatch\n * C4555: expression has no effect; expected expression with side-effect\n * C4619: #pragma warning : there is no warning number 'number'\n * C4628: digraphs not supported with -Ze. Character sequence 'digraph' not interpreted as alternate token for 'char'\n * C4640: 'instance' : construction of local static object is not thread-safe\n * C4668: 'symbol' is not defined as a preprocessor macro, replacing with '0' for 'directives'\n * C4800: 'type' : forcing value to bool 'true' or 'false' (performance warning)\n * C4826: Conversion from 'type1 ' to 'type_2' is sign-extended. This may cause unexpected runtime behavior.\n *\/\n #define SUPPRESS_WARNINGS \\\n __pragma(warning(push)) \\\n __pragma(warning(disable: 4100)) \\\n __pragma(warning(disable: 4127)) \\\n __pragma(warning(disable: 4244)) \\\n __pragma(warning(disable: 4251)) \\\n __pragma(warning(disable: 4365)) \\\n __pragma(warning(disable: 4388)) \\\n __pragma(warning(disable: 4555)) \\\n __pragma(warning(disable: 4619)) \\\n __pragma(warning(disable: 4628)) \\\n __pragma(warning(disable: 4640)) \\\n __pragma(warning(disable: 4668)) \\\n __pragma(warning(disable: 4800)) \\\n __pragma(warning(disable: 4826))\n\n #define RESTORE_WARNINGS \\\n __pragma(warning(pop))\n\n#else\n\n #define SUPPRESS_WARNINGS\n #define RESTORE_WARNINGS\n\n#endif\n<commit_msg>Disable shadowing warning of MSVS2015 for external headers<commit_after>\/*\nCopyright (c) 2014 Ableton AG, Berlin\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\/\/ clang-format off\n\n#pragma once\n\n#if defined(__clang__)\n\n #if __has_warning(\"-Wunused-local-typedef\")\n #define ABL_PRAGMA_CLANG_DIAGNOSTIC_IGNORED_UNUSED_LOCAL_TYPEDEF \\\n _Pragma(\"clang diagnostic ignored \\\"-Wunused-local-typedef\\\"\")\n #else\n #define ABL_PRAGMA_CLANG_DIAGNOSTIC_IGNORED_UNUSED_LOCAL_TYPEDEF\n #endif\n\n #define SUPPRESS_WARNINGS \\\n _Pragma(\"clang diagnostic push\") \\\n _Pragma(\"clang diagnostic ignored \\\"-Wconversion\\\"\") \\\n _Pragma(\"clang diagnostic ignored \\\"-Wconditional-uninitialized\\\"\") \\\n _Pragma(\"clang diagnostic ignored \\\"-Wcovered-switch-default\\\"\") \\\n _Pragma(\"clang diagnostic ignored \\\"-Wdeprecated\\\"\") \\\n _Pragma(\"clang diagnostic ignored \\\"-Wdisabled-macro-expansion\\\"\") \\\n _Pragma(\"clang diagnostic ignored \\\"-Wdocumentation-unknown-command\\\"\") \\\n _Pragma(\"clang diagnostic ignored \\\"-Wdocumentation\\\"\") \\\n _Pragma(\"clang diagnostic ignored \\\"-Wexit-time-destructors\\\"\") \\\n _Pragma(\"clang diagnostic ignored \\\"-Wextra-semi\\\"\") \\\n _Pragma(\"clang diagnostic ignored \\\"-Wfloat-equal\\\"\") \\\n _Pragma(\"clang diagnostic ignored \\\"-Wglobal-constructors\\\"\") \\\n _Pragma(\"clang diagnostic ignored \\\"-Wheader-hygiene\\\"\") \\\n _Pragma(\"clang diagnostic ignored \\\"-Wmissing-noreturn\\\"\") \\\n _Pragma(\"clang diagnostic ignored \\\"-Wmissing-prototypes\\\"\") \\\n _Pragma(\"clang diagnostic ignored \\\"-Wold-style-cast\\\"\") \\\n _Pragma(\"clang diagnostic ignored \\\"-Wpadded\\\"\") \\\n _Pragma(\"clang diagnostic ignored \\\"-Wshadow\\\"\") \\\n _Pragma(\"clang diagnostic ignored \\\"-Wshift-sign-overflow\\\"\") \\\n _Pragma(\"clang diagnostic ignored \\\"-Wshorten-64-to-32\\\"\") \\\n _Pragma(\"clang diagnostic ignored \\\"-Wsign-compare\\\"\") \\\n _Pragma(\"clang diagnostic ignored \\\"-Wsign-conversion\\\"\") \\\n _Pragma(\"clang diagnostic ignored \\\"-Wswitch-enum\\\"\") \\\n _Pragma(\"clang diagnostic ignored \\\"-Wundef\\\"\") \\\n _Pragma(\"clang diagnostic ignored \\\"-Wunreachable-code\\\"\") \\\n _Pragma(\"clang diagnostic ignored \\\"-Wunused-parameter\\\"\") \\\n _Pragma(\"clang diagnostic ignored \\\"-Wused-but-marked-unused\\\"\") \\\n _Pragma(\"clang diagnostic ignored \\\"-Wweak-vtables\\\"\") \\\n ABL_PRAGMA_CLANG_DIAGNOSTIC_IGNORED_UNUSED_LOCAL_TYPEDEF\n\n #define RESTORE_WARNINGS \\\n _Pragma(\"clang diagnostic pop\")\n\n#elif defined(_MSC_VER)\n\n \/**\n * C4100: 'identifier' : unreferenced formal parameter\n * C4127: conditional expression is constant\n * C4244: 'conversion' conversion from 'type1' to 'type2', possible loss of data\n * C4251: 'identifier' : class 'type' needs to have dll-interface to be used by clients of class 'type2'\n * C4365: 'action' : conversion from 'type_1' to 'type_2', signed\/unsigned mismatch\n * C4388: signed\/unsigned mismatch\n * C4459: declaration of 'identifier' hides global declaration\n * C4555: expression has no effect; expected expression with side-effect\n * C4619: #pragma warning : there is no warning number 'number'\n * C4628: digraphs not supported with -Ze. Character sequence 'digraph' not interpreted as alternate token for 'char'\n * C4640: 'instance' : construction of local static object is not thread-safe\n * C4668: 'symbol' is not defined as a preprocessor macro, replacing with '0' for 'directives'\n * C4800: 'type' : forcing value to bool 'true' or 'false' (performance warning)\n * C4826: Conversion from 'type1 ' to 'type_2' is sign-extended. This may cause unexpected runtime behavior.\n *\/\n #define SUPPRESS_WARNINGS \\\n __pragma(warning(push)) \\\n __pragma(warning(disable: 4100)) \\\n __pragma(warning(disable: 4127)) \\\n __pragma(warning(disable: 4244)) \\\n __pragma(warning(disable: 4251)) \\\n __pragma(warning(disable: 4365)) \\\n __pragma(warning(disable: 4388)) \\\n __pragma(warning(disable: 4459)) \\\n __pragma(warning(disable: 4555)) \\\n __pragma(warning(disable: 4619)) \\\n __pragma(warning(disable: 4628)) \\\n __pragma(warning(disable: 4640)) \\\n __pragma(warning(disable: 4668)) \\\n __pragma(warning(disable: 4800)) \\\n __pragma(warning(disable: 4826))\n\n #define RESTORE_WARNINGS \\\n __pragma(warning(pop))\n\n#else\n\n #define SUPPRESS_WARNINGS\n #define RESTORE_WARNINGS\n\n#endif\n<|endoftext|>"} {"text":"<commit_before>\/\/\n\/\/ Copyright (c) 2017 Michael W Powell <mwpowellhtx@gmail.com>\n\/\/ Copyright 2017 Garrett D'Amore <garrett@damore.org>\n\/\/ Copyright 2017 Capitar IT Group BV <info@capitar.com>\n\/\/\n\/\/ This software is supplied under the terms of the MIT License, a\n\/\/ copy of which should be located in the distribution where this\n\/\/ file was obtained (LICENSE.txt). A copy of the license may also be\n\/\/ found online at https:\/\/opensource.org\/licenses\/MIT.\n\/\/\n\n#include \"..\/catch\/catch_tags.h\"\n#include \"..\/helpers\/constants.h\"\n\n#include \"transport.h\"\n\n#include <core\/listener.h>\n#include <core\/dialer.h>\n#include <algorithms\/string_algo.hpp>\n\n#include <cstdlib>\n#include <sstream>\n#include <algorithm>\n\n#include <iostream>\n\nnamespace nng {\n\n int address_calculator::port = TEST_PORT;\n\n address_calculator::address_calculator(char port_delim) : _port_delim() {\n if (port_delim) {\n _port_delim.push_back(port_delim);\n }\n }\n\n address_calculator::~address_calculator() {\n }\n\n uint16_t address_calculator::get_port(int delta) {\n return port += delta;\n }\n\n uint16_t address_calculator::get_current_port() {\n return port;\n }\n\n std::string address_calculator::get_addr(const std::string& base_addr, int delta) {\n std::ostringstream os;\n os << base_addr << _port_delim << get_port(delta);\n return os.str();\n }\n\n std::string address_calculator::get_next_addr(const std::string& base_addr, int delta) {\n return get_addr(base_addr, std::abs(delta));\n }\n\n std::string address_calculator::get_prev_addr(const std::string& base_addr, int delta) {\n return get_addr(base_addr, -std::abs(delta));\n }\n\n \/\/ TODO: TBD: could expose this, but random generators are a dime a dozen...\n void seed_random_generator(std::time_t seed) {\n \/\/ Initialize the random generator.\n std::srand(static_cast<int>(seed));\n }\n\n namespace messaging {\n\n \/\/ TODO: TBD: this is a likely candidate for everything besides just transport.\n void init_random_buffer(buffer_vector_type& buf, const size_type sz) {\n\n buf.resize(sz);\n\n for (size_type i = 0; i < sz; i++) {\n buf[i] = std::rand() & 0xff;\n }\n }\n\n void twos_compliment_buffer(buffer_vector_type& buf) {\n const auto &twos_compliment = [](buffer_vector_type::value_type& x) {\n x = ~x;\n };\n std::for_each(buf.begin(), buf.end(), twos_compliment);\n }\n }\n\n c_style_transport_fixture_redeux::c_style_transport_fixture_redeux()\n : transport_fixture_redeux_base(0, 0) {\n REQUIRE(::nng_rep_open(&_rep) == 0);\n REQUIRE(::nng_req_open(&_req) == 0);\n }\n\n c_style_transport_fixture_redeux::~c_style_transport_fixture_redeux() {\n if (_rep) REQUIRE(::nng_close(_rep) == 0);\n if (_req) REQUIRE(::nng_close(_req) == 0);\n _rep = _req = 0;\n }\n\n transport_fixture_redeux::transport_fixture_redeux()\n : transport_fixture_redeux_base() {\n\n using namespace protocol;\n _req.reset(new latest_req_socket());\n _rep.reset(new latest_rep_socket());\n }\n\n transport_fixture_redeux::~transport_fixture_redeux() {\n REQUIRE_NOTHROW(_req.reset());\n REQUIRE_NOTHROW(_rep.reset());\n }\n}\n\nnamespace constants {\n\n const std::string ping = \"ping\";\n const std::string acknowledge = \"acknowledge\";\n\n const auto ping_buf = to_buffer(ping);\n const auto acknowledge_buf = to_buffer(acknowledge);\n}\n\n\nTEST_CASE(\"Test the transport using C++ wrappers\", Catch::Tags(constants::prefix_tags\n , \"rep\", \"req\", \"transport\", \"nng\", \"cxx\", \"sample\").c_str()) {\n\n using namespace std;\n using namespace nng;\n using namespace nng::protocol;\n using namespace nng::messaging;\n using namespace constants;\n using namespace Catch::Matchers;\n using O = option_names;\n\n auto calc = address_calculator(port_delim);\n\n const auto addr = calc.get_next_addr(test_addr_base);\n\n std::unique_ptr<latest_rep_socket> repp;\n std::unique_ptr<latest_req_socket> reqp;\n\n REQUIRE_NOTHROW(repp = make_unique<latest_rep_socket>());\n REQUIRE_NOTHROW(reqp = make_unique<latest_req_socket>());\n\n init(addr);\n\n SECTION(\"Connection refused works\") {\n\n WARN(\"Connection refused works: '\" + addr + \"'\");\n\n dialer d;\n\n REQUIRE_THROWS_AS_MATCHING(reqp->dial(addr, &d), nng_exception, THROWS_NNG_EXCEPTION(ec_econnrefused));\n REQUIRE_THROWS_AS_MATCHING(repp->dial(addr, &d), nng_exception, THROWS_NNG_EXCEPTION(ec_econnrefused));\n }\n\n SECTION(\"Duplicate listeners rejected\") {\n\n WARN(\"Duplicate listeners rejected: '\" + addr + \"'\");\n\n \/\/ Smart pointers is overkill for these sections.\n listener l1, l2;\n\n REQUIRE_NOTHROW(repp->listen(addr, &l1));\n REQUIRE(l1.has_one() == true);\n\n \/\/ Leaving the first Listener open and available.\n REQUIRE_THROWS_AS_MATCHING(reqp->listen(addr, &l2), nng_exception, THROWS_NNG_EXCEPTION(ec_eaddrinuse));\n REQUIRE(l2.has_one() == false);\n }\n\n SECTION(\"Listener and dialer accepted\") {\n\n WARN(\"Listener and dialer accepted: '\" + addr + \"'\");\n\n \/\/ Smart pointers is overkill for these sections.\n listener l;\n dialer d;\n\n REQUIRE_NOTHROW(repp->listen(addr, &l));\n REQUIRE(l.has_one() == true);\n\n REQUIRE_NOTHROW(reqp->dial(addr, &d));\n REQUIRE(d.has_one() == true);\n }\n\n SECTION(\"Send and receive\") {\n\n WARN(\"Send and receive: '\" + addr + \"'\");\n\n listener l;\n dialer d;\n\n unique_ptr<message_pipe> pp;\n unique_ptr<binary_message> sendp, recvp;\n\n string actual_addr;\n\n REQUIRE_NOTHROW(repp->listen(addr, &l));\n REQUIRE(l.has_one() == true);\n REQUIRE_NOTHROW(reqp->dial(addr, &d));\n REQUIRE(d.has_one() == true);\n\n \/\/ Sleep so listener catches up, may be running slightly behind.\n SLEEP_FOR(20ms);\n\n REQUIRE_NOTHROW(sendp = make_unique<binary_message>());\n REQUIRE_NOTHROW(*sendp << ping);\n REQUIRE_NOTHROW(reqp->send(sendp.get()));\n\n REQUIRE_NOTHROW(recvp = make_unique<binary_message>(nullptr));\n REQUIRE_NOTHROW(repp->try_receive(recvp.get()));\n REQUIRE_THAT(recvp->body()->get(), Equals(ping_buf));\n\n REQUIRE_NOTHROW(*sendp << acknowledge);\n REQUIRE_NOTHROW(repp->send(sendp.get()));\n REQUIRE_NOTHROW(recvp->set_msgp(nullptr));\n REQUIRE_NOTHROW(reqp->try_receive(recvp.get()));\n REQUIRE_THAT(recvp->body()->get(), Equals(acknowledge_buf));\n\n REQUIRE_NOTHROW(pp = make_unique<message_pipe>(recvp.get()));\n REQUIRE(pp->has_one() == true);\n\n \/\/ TODO: TBD: this bit is borderline message pipe unit testing and that's about it...\n REQUIRE_NOTHROW(actual_addr.resize(NNG_MAXADDRLEN));\n REQUIRE_NOTHROW(pp->get_option(O::url, actual_addr));\n REQUIRE(actual_addr == addr);\n }\n\n SECTION(\"Send and receive large data\") {\n\n WARN(\"Send and receive large data: '\" + addr + \"'\");\n\n listener l;\n dialer d;\n\n unique_ptr<binary_message> sendp, recvp;\n\n REQUIRE_NOTHROW(seed_random_generator(time(static_cast<std::time_t*>(nullptr))));\n\n \/\/ What's a buffer without some HEX involvement...\n const size_type sz = 0x400 * 0x80; \/\/ Much larger than any transport segment.\n buffer_vector_type data;\n\n REQUIRE_NOTHROW(init_random_buffer(data, sz));\n\n REQUIRE_NOTHROW(repp->listen(addr, &l));\n REQUIRE(l.has_one() == true);\n\n REQUIRE_NOTHROW(reqp->dial(addr, &d));\n REQUIRE(d.has_one() == true);\n\n \/\/ Wait for listener to catch up since it may be slightly behind.\n SLEEP_FOR(20ms);\n\n REQUIRE_NOTHROW(sendp = make_unique<binary_message>());\n REQUIRE_NOTHROW(*sendp << data);\n REQUIRE_NOTHROW(reqp->send(sendp.get()));\n REQUIRE_NOTHROW(recvp = make_unique<binary_message>(nullptr));\n REQUIRE_NOTHROW(repp->try_receive(recvp.get()));\n \/\/ Heaven help us if this fails: expect report to be truncated due to excessive size.\n REQUIRE_THAT(recvp->body()->get(), Equals(data));\n\n REQUIRE_NOTHROW(twos_compliment_buffer(data));\n REQUIRE_NOTHROW(sendp = make_unique<binary_message>());\n REQUIRE_NOTHROW(*sendp << data);\n REQUIRE_NOTHROW(repp->send(sendp.get()));\n REQUIRE_NOTHROW(recvp = make_unique<binary_message>(nullptr));\n REQUIRE_NOTHROW(reqp->try_receive(recvp.get()));\n \/\/ Ditto excessive size truncation.\n REQUIRE_THAT(recvp->body()->get(), Equals(data));\n }\n}\n\nTEST_CASE(\"Test the transport in C style\", Catch::Tags(constants::prefix_tags\n , \"rep\", \"req\", \"transport\", \"nng\", \"c\", \"sample\").c_str()) {\n\n using namespace std;\n using namespace trx;\n using namespace nng;\n using namespace nng::protocol;\n using namespace nng::messaging;\n using namespace constants;\n using namespace Catch::Matchers;\n using O = option_names;\n\n address_calculator calc(port_delim);\n\n const auto addr = calc.get_next_addr(test_addr_base);\n\n init(addr);\n\n c_style_transport_fixture_redeux redeux;\n\n const auto& req = redeux._req;\n const auto& rep = redeux._rep;\n\n SECTION(\"Connection refused works\") {\n\n WARN(\"Connection refused works: '\" + addr + \"'\");\n\n ::nng_dialer d = 0;\n\n REQUIRE(::nng_dial(req, addr.c_str(), &d, 0) == ::NNG_ECONNREFUSED);\n REQUIRE(!d);\n\n REQUIRE(::nng_dial(rep, addr.c_str(), &d, 0) == ::NNG_ECONNREFUSED);\n REQUIRE(!d);\n }\n\n SECTION(\"Duplicate listen rejected\") {\n\n WARN(\"Duplicate listen rejected: '\" + addr + \"'\");\n\n ::nng_listener l = 0;\n\n REQUIRE(::nng_listen(rep, addr.c_str(), &l, 0) == 0);\n \/\/ TODO: TBD: close the listener before the next attempt? or just let it be?\n REQUIRE(l);\n\n l = 0;\n REQUIRE(::nng_listen(req, addr.c_str(), &l, 0) == ::NNG_EADDRINUSE);\n REQUIRE(!l);\n }\n\n SECTION(\"Listener and dialer accepted\") {\n\n WARN(\"Listener and dialer accepted: '\" + addr + \"'\");\n\n \/\/ DUH! Listener and a _D_I_A_L_E_R_!\n ::nng_listener l;\n ::nng_dialer d;\n\n REQUIRE(::nng_listen(rep, addr.c_str(), &l, 0) == 0);\n REQUIRE(l);\n\n REQUIRE(::nng_dial(req, addr.c_str(), &d, 0) == 0);\n REQUIRE(d);\n }\n\n SECTION(\"Send and receive\") {\n\n WARN(\"Send and receive: '\" + addr + \"'\");\n\n ::nng_listener l = 0;\n ::nng_dialer d = 0;\n ::nng_pipe p = 0;\n\n string url;\n string::size_type sz;\n\n \/* This is a hybrid test. The primary purpose of this test is to exercise the core socket oriented\n methodology apart from the C++ wrappers. Engaging with the C API, however, I am confident of the\n messaging work. Just not so much of the transport at the moment. Just be careful of the message\n ownership semantics and it ought to be fine. *\/\n\n ::nng_msg* msgp;\n unique_ptr<binary_message> sendp, recvp;\n\n REQUIRE_NOTHROW(sendp = make_unique<binary_message>());\n REQUIRE_NOTHROW(recvp = make_unique<binary_message>(nullptr));\n\n \/* TODO: TBD: definitely IPC is hanging up on this step during the _D_I_A_L_\n on account of what looks to be an internal transport API wait on a Condition\n Variable. The only different from what I can determine is that the unit tests\n engage with an internal nni_tran_find call, which is not exposed to us for\n public consumption. Submitted issue to the repo:\n http:\/\/github.com\/nanomsg\/nng\/issues\/117 *\/\n\n REQUIRE(::nng_listen(rep, addr.c_str(), &l, 0) == 0);\n REQUIRE(l);\n REQUIRE(::nng_dial(req, addr.c_str(), &d, 0) == 0);\n REQUIRE(d);\n\n \/\/ Ditto allowing listener to catch up.\n SLEEP_FOR(20ms);\n\n REQUIRE_NOTHROW(*sendp << ping);\n REQUIRE(::nng_sendmsg(req, sendp->get_msgp(), 0) == 0);\n REQUIRE_NOTHROW(sendp->on_sent());\n msgp = nullptr;\n REQUIRE(::nng_recvmsg(rep, &msgp, 0) == 0);\n REQUIRE(msgp);\n REQUIRE_NOTHROW(recvp->set_msgp(msgp));\n REQUIRE_THAT(recvp->body()->get(), Equals(ping_buf));\n\n REQUIRE_NOTHROW(recvp->body()->chop(ping.size()));\n REQUIRE_NOTHROW(*recvp << acknowledge);\n REQUIRE(::nng_sendmsg(rep, recvp->get_msgp(), 0) == 0);\n REQUIRE_NOTHROW(recvp->on_sent());\n msgp = nullptr;\n REQUIRE(::nng_recvmsg(req, &msgp, 0) == 0);\n REQUIRE(msgp);\n REQUIRE_NOTHROW(sendp->set_msgp(msgp));\n REQUIRE_THAT(sendp->body()->get(), Equals(acknowledge_buf));\n\n REQUIRE_NOTHROW(p = ::nng_msg_get_pipe(sendp->get_msgp()));\n REQUIRE(p);\n\n REQUIRE_NOTHROW(url.resize(NNG_MAXADDRLEN));\n REQUIRE(::nng_pipe_getopt(p, O::url.c_str(), &url[0], &(sz = NNG_MAXADDRLEN)) == 0);\n REQUIRE(sz < NNG_MAXADDRLEN);\n REQUIRE_NOTHROW(url.resize(sz - 1));\n REQUIRE_THAT(url, Equals(string(addr)));\n }\n}\n<commit_msg>better positioned the init step during transport testing<commit_after>\/\/\n\/\/ Copyright (c) 2017 Michael W Powell <mwpowellhtx@gmail.com>\n\/\/ Copyright 2017 Garrett D'Amore <garrett@damore.org>\n\/\/ Copyright 2017 Capitar IT Group BV <info@capitar.com>\n\/\/\n\/\/ This software is supplied under the terms of the MIT License, a\n\/\/ copy of which should be located in the distribution where this\n\/\/ file was obtained (LICENSE.txt). A copy of the license may also be\n\/\/ found online at https:\/\/opensource.org\/licenses\/MIT.\n\/\/\n\n#include \"..\/catch\/catch_tags.h\"\n#include \"..\/helpers\/constants.h\"\n\n#include \"transport.h\"\n\n#include <core\/listener.h>\n#include <core\/dialer.h>\n#include <algorithms\/string_algo.hpp>\n\n#include <cstdlib>\n#include <sstream>\n#include <algorithm>\n\n#include <iostream>\n\nnamespace nng {\n\n int address_calculator::port = TEST_PORT;\n\n address_calculator::address_calculator(char port_delim) : _port_delim() {\n if (port_delim) {\n _port_delim.push_back(port_delim);\n }\n }\n\n address_calculator::~address_calculator() {\n }\n\n uint16_t address_calculator::get_port(int delta) {\n return port += delta;\n }\n\n uint16_t address_calculator::get_current_port() {\n return port;\n }\n\n std::string address_calculator::get_addr(const std::string& base_addr, int delta) {\n std::ostringstream os;\n os << base_addr << _port_delim << get_port(delta);\n return os.str();\n }\n\n std::string address_calculator::get_next_addr(const std::string& base_addr, int delta) {\n return get_addr(base_addr, std::abs(delta));\n }\n\n std::string address_calculator::get_prev_addr(const std::string& base_addr, int delta) {\n return get_addr(base_addr, -std::abs(delta));\n }\n\n \/\/ TODO: TBD: could expose this, but random generators are a dime a dozen...\n void seed_random_generator(std::time_t seed) {\n \/\/ Initialize the random generator.\n std::srand(static_cast<int>(seed));\n }\n\n namespace messaging {\n\n \/\/ TODO: TBD: this is a likely candidate for everything besides just transport.\n void init_random_buffer(buffer_vector_type& buf, const size_type sz) {\n\n buf.resize(sz);\n\n for (size_type i = 0; i < sz; i++) {\n buf[i] = std::rand() & 0xff;\n }\n }\n\n void twos_compliment_buffer(buffer_vector_type& buf) {\n const auto &twos_compliment = [](buffer_vector_type::value_type& x) {\n x = ~x;\n };\n std::for_each(buf.begin(), buf.end(), twos_compliment);\n }\n }\n\n c_style_transport_fixture_redeux::c_style_transport_fixture_redeux()\n : transport_fixture_redeux_base(0, 0) {\n REQUIRE(::nng_rep_open(&_rep) == 0);\n REQUIRE(::nng_req_open(&_req) == 0);\n }\n\n c_style_transport_fixture_redeux::~c_style_transport_fixture_redeux() {\n if (_rep) REQUIRE(::nng_close(_rep) == 0);\n if (_req) REQUIRE(::nng_close(_req) == 0);\n _rep = _req = 0;\n }\n\n transport_fixture_redeux::transport_fixture_redeux()\n : transport_fixture_redeux_base() {\n\n using namespace protocol;\n _req.reset(new latest_req_socket());\n _rep.reset(new latest_rep_socket());\n }\n\n transport_fixture_redeux::~transport_fixture_redeux() {\n REQUIRE_NOTHROW(_req.reset());\n REQUIRE_NOTHROW(_rep.reset());\n }\n}\n\nnamespace constants {\n\n const std::string ping = \"ping\";\n const std::string acknowledge = \"acknowledge\";\n\n const auto ping_buf = to_buffer(ping);\n const auto acknowledge_buf = to_buffer(acknowledge);\n}\n\n\nTEST_CASE(\"Test the transport using C++ wrappers\", Catch::Tags(constants::prefix_tags\n , \"rep\", \"req\", \"transport\", \"nng\", \"cxx\", \"sample\").c_str()) {\n\n using namespace std;\n using namespace nng;\n using namespace nng::protocol;\n using namespace nng::messaging;\n using namespace constants;\n using namespace Catch::Matchers;\n using O = option_names;\n\n auto calc = address_calculator(port_delim);\n\n const auto addr = calc.get_next_addr(test_addr_base);\n\n init(addr);\n\n std::unique_ptr<latest_rep_socket> repp;\n std::unique_ptr<latest_req_socket> reqp;\n\n REQUIRE_NOTHROW(repp = make_unique<latest_rep_socket>());\n REQUIRE_NOTHROW(reqp = make_unique<latest_req_socket>());\n\n SECTION(\"Connection refused works\") {\n\n WARN(\"Connection refused works: '\" + addr + \"'\");\n\n dialer d;\n\n REQUIRE_THROWS_AS_MATCHING(reqp->dial(addr, &d), nng_exception, THROWS_NNG_EXCEPTION(ec_econnrefused));\n REQUIRE_THROWS_AS_MATCHING(repp->dial(addr, &d), nng_exception, THROWS_NNG_EXCEPTION(ec_econnrefused));\n }\n\n SECTION(\"Duplicate listeners rejected\") {\n\n WARN(\"Duplicate listeners rejected: '\" + addr + \"'\");\n\n \/\/ Smart pointers is overkill for these sections.\n listener l1, l2;\n\n REQUIRE_NOTHROW(repp->listen(addr, &l1));\n REQUIRE(l1.has_one() == true);\n\n \/\/ Leaving the first Listener open and available.\n REQUIRE_THROWS_AS_MATCHING(reqp->listen(addr, &l2), nng_exception, THROWS_NNG_EXCEPTION(ec_eaddrinuse));\n REQUIRE(l2.has_one() == false);\n }\n\n SECTION(\"Listener and dialer accepted\") {\n\n WARN(\"Listener and dialer accepted: '\" + addr + \"'\");\n\n \/\/ Smart pointers is overkill for these sections.\n listener l;\n dialer d;\n\n REQUIRE_NOTHROW(repp->listen(addr, &l));\n REQUIRE(l.has_one() == true);\n\n REQUIRE_NOTHROW(reqp->dial(addr, &d));\n REQUIRE(d.has_one() == true);\n }\n\n SECTION(\"Send and receive\") {\n\n WARN(\"Send and receive: '\" + addr + \"'\");\n\n listener l;\n dialer d;\n\n unique_ptr<message_pipe> pp;\n unique_ptr<binary_message> sendp, recvp;\n\n string actual_addr;\n\n REQUIRE_NOTHROW(repp->listen(addr, &l));\n REQUIRE(l.has_one() == true);\n REQUIRE_NOTHROW(reqp->dial(addr, &d));\n REQUIRE(d.has_one() == true);\n\n \/\/ Sleep so listener catches up, may be running slightly behind.\n SLEEP_FOR(20ms);\n\n REQUIRE_NOTHROW(sendp = make_unique<binary_message>());\n REQUIRE_NOTHROW(*sendp << ping);\n REQUIRE_NOTHROW(reqp->send(sendp.get()));\n\n REQUIRE_NOTHROW(recvp = make_unique<binary_message>(nullptr));\n REQUIRE_NOTHROW(repp->try_receive(recvp.get()));\n REQUIRE_THAT(recvp->body()->get(), Equals(ping_buf));\n\n REQUIRE_NOTHROW(*sendp << acknowledge);\n REQUIRE_NOTHROW(repp->send(sendp.get()));\n REQUIRE_NOTHROW(recvp->set_msgp(nullptr));\n REQUIRE_NOTHROW(reqp->try_receive(recvp.get()));\n REQUIRE_THAT(recvp->body()->get(), Equals(acknowledge_buf));\n\n REQUIRE_NOTHROW(pp = make_unique<message_pipe>(recvp.get()));\n REQUIRE(pp->has_one() == true);\n\n \/\/ TODO: TBD: this bit is borderline message pipe unit testing and that's about it...\n REQUIRE_NOTHROW(actual_addr.resize(NNG_MAXADDRLEN));\n REQUIRE_NOTHROW(pp->get_option(O::url, actual_addr));\n REQUIRE(actual_addr == addr);\n }\n\n SECTION(\"Send and receive large data\") {\n\n WARN(\"Send and receive large data: '\" + addr + \"'\");\n\n listener l;\n dialer d;\n\n unique_ptr<binary_message> sendp, recvp;\n\n REQUIRE_NOTHROW(seed_random_generator(time(static_cast<std::time_t*>(nullptr))));\n\n \/\/ What's a buffer without some HEX involvement...\n const size_type sz = 0x400 * 0x80; \/\/ Much larger than any transport segment.\n buffer_vector_type data;\n\n REQUIRE_NOTHROW(init_random_buffer(data, sz));\n\n REQUIRE_NOTHROW(repp->listen(addr, &l));\n REQUIRE(l.has_one() == true);\n\n REQUIRE_NOTHROW(reqp->dial(addr, &d));\n REQUIRE(d.has_one() == true);\n\n \/\/ Wait for listener to catch up since it may be slightly behind.\n SLEEP_FOR(20ms);\n\n REQUIRE_NOTHROW(sendp = make_unique<binary_message>());\n REQUIRE_NOTHROW(*sendp << data);\n REQUIRE_NOTHROW(reqp->send(sendp.get()));\n REQUIRE_NOTHROW(recvp = make_unique<binary_message>(nullptr));\n REQUIRE_NOTHROW(repp->try_receive(recvp.get()));\n \/\/ Heaven help us if this fails: expect report to be truncated due to excessive size.\n REQUIRE_THAT(recvp->body()->get(), Equals(data));\n\n REQUIRE_NOTHROW(twos_compliment_buffer(data));\n REQUIRE_NOTHROW(sendp = make_unique<binary_message>());\n REQUIRE_NOTHROW(*sendp << data);\n REQUIRE_NOTHROW(repp->send(sendp.get()));\n REQUIRE_NOTHROW(recvp = make_unique<binary_message>(nullptr));\n REQUIRE_NOTHROW(reqp->try_receive(recvp.get()));\n \/\/ Ditto excessive size truncation.\n REQUIRE_THAT(recvp->body()->get(), Equals(data));\n }\n}\n\nTEST_CASE(\"Test the transport in C style\", Catch::Tags(constants::prefix_tags\n , \"rep\", \"req\", \"transport\", \"nng\", \"c\", \"sample\").c_str()) {\n\n using namespace std;\n using namespace trx;\n using namespace nng;\n using namespace nng::protocol;\n using namespace nng::messaging;\n using namespace constants;\n using namespace Catch::Matchers;\n using O = option_names;\n\n address_calculator calc(port_delim);\n\n const auto addr = calc.get_next_addr(test_addr_base);\n\n init(addr);\n\n c_style_transport_fixture_redeux redeux;\n\n const auto& req = redeux._req;\n const auto& rep = redeux._rep;\n\n SECTION(\"Connection refused works\") {\n\n WARN(\"Connection refused works: '\" + addr + \"'\");\n\n ::nng_dialer d = 0;\n\n REQUIRE(::nng_dial(req, addr.c_str(), &d, 0) == ::NNG_ECONNREFUSED);\n REQUIRE(!d);\n\n REQUIRE(::nng_dial(rep, addr.c_str(), &d, 0) == ::NNG_ECONNREFUSED);\n REQUIRE(!d);\n }\n\n SECTION(\"Duplicate listen rejected\") {\n\n WARN(\"Duplicate listen rejected: '\" + addr + \"'\");\n\n ::nng_listener l = 0;\n\n REQUIRE(::nng_listen(rep, addr.c_str(), &l, 0) == 0);\n \/\/ TODO: TBD: close the listener before the next attempt? or just let it be?\n REQUIRE(l);\n\n l = 0;\n REQUIRE(::nng_listen(req, addr.c_str(), &l, 0) == ::NNG_EADDRINUSE);\n REQUIRE(!l);\n }\n\n SECTION(\"Listener and dialer accepted\") {\n\n WARN(\"Listener and dialer accepted: '\" + addr + \"'\");\n\n \/\/ DUH! Listener and a _D_I_A_L_E_R_!\n ::nng_listener l;\n ::nng_dialer d;\n\n REQUIRE(::nng_listen(rep, addr.c_str(), &l, 0) == 0);\n REQUIRE(l);\n\n REQUIRE(::nng_dial(req, addr.c_str(), &d, 0) == 0);\n REQUIRE(d);\n }\n\n SECTION(\"Send and receive\") {\n\n WARN(\"Send and receive: '\" + addr + \"'\");\n\n ::nng_listener l = 0;\n ::nng_dialer d = 0;\n ::nng_pipe p = 0;\n\n string url;\n string::size_type sz;\n\n \/* This is a hybrid test. The primary purpose of this test is to exercise the core socket oriented\n methodology apart from the C++ wrappers. Engaging with the C API, however, I am confident of the\n messaging work. Just not so much of the transport at the moment. Just be careful of the message\n ownership semantics and it ought to be fine. *\/\n\n ::nng_msg* msgp;\n unique_ptr<binary_message> sendp, recvp;\n\n REQUIRE_NOTHROW(sendp = make_unique<binary_message>());\n REQUIRE_NOTHROW(recvp = make_unique<binary_message>(nullptr));\n\n \/* TODO: TBD: definitely IPC is hanging up on this step during the _D_I_A_L_\n on account of what looks to be an internal transport API wait on a Condition\n Variable. The only different from what I can determine is that the unit tests\n engage with an internal nni_tran_find call, which is not exposed to us for\n public consumption. Submitted issue to the repo:\n http:\/\/github.com\/nanomsg\/nng\/issues\/117 *\/\n\n REQUIRE(::nng_listen(rep, addr.c_str(), &l, 0) == 0);\n REQUIRE(l);\n REQUIRE(::nng_dial(req, addr.c_str(), &d, 0) == 0);\n REQUIRE(d);\n\n \/\/ Ditto allowing listener to catch up.\n SLEEP_FOR(20ms);\n\n REQUIRE_NOTHROW(*sendp << ping);\n REQUIRE(::nng_sendmsg(req, sendp->get_msgp(), 0) == 0);\n REQUIRE_NOTHROW(sendp->on_sent());\n msgp = nullptr;\n REQUIRE(::nng_recvmsg(rep, &msgp, 0) == 0);\n REQUIRE(msgp);\n REQUIRE_NOTHROW(recvp->set_msgp(msgp));\n REQUIRE_THAT(recvp->body()->get(), Equals(ping_buf));\n\n REQUIRE_NOTHROW(recvp->body()->chop(ping.size()));\n REQUIRE_NOTHROW(*recvp << acknowledge);\n REQUIRE(::nng_sendmsg(rep, recvp->get_msgp(), 0) == 0);\n REQUIRE_NOTHROW(recvp->on_sent());\n msgp = nullptr;\n REQUIRE(::nng_recvmsg(req, &msgp, 0) == 0);\n REQUIRE(msgp);\n REQUIRE_NOTHROW(sendp->set_msgp(msgp));\n REQUIRE_THAT(sendp->body()->get(), Equals(acknowledge_buf));\n\n REQUIRE_NOTHROW(p = ::nng_msg_get_pipe(sendp->get_msgp()));\n REQUIRE(p);\n\n REQUIRE_NOTHROW(url.resize(NNG_MAXADDRLEN));\n REQUIRE(::nng_pipe_getopt(p, O::url.c_str(), &url[0], &(sz = NNG_MAXADDRLEN)) == 0);\n REQUIRE(sz < NNG_MAXADDRLEN);\n REQUIRE_NOTHROW(url.resize(sz - 1));\n REQUIRE_THAT(url, Equals(string(addr)));\n }\n}\n<|endoftext|>"} {"text":"<commit_before>\/*=========================================================================\n\n Program: Visualization Toolkit\n Module: TestContext.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 \"vtkRenderer.h\"\n#include \"vtkRenderWindow.h\"\n#include \"vtkRenderWindowInteractor.h\"\n#include \"vtkSmartPointer.h\"\n#include \"vtkObjectFactory.h\"\n#include \"vtkContext2D.h\"\n#include \"vtkContextItem.h\"\n#include \"vtkContextView.h\"\n#include \"vtkContextScene.h\"\n#include \"vtkPen.h\"\n#include \"vtkBrush.h\"\n#include \"vtkOpenGLContextDevice2D.h\"\n#include \"vtkPoints2D.h\"\n\n#include \"vtkShaderProgram2.h\"\n#include \"vtkShader2.h\"\n#include \"vtkShader2Collection.h\"\n#include \"vtkUniformVariables.h\"\n#include \"vtkOpenGLRenderWindow.h\"\n\n#include \"vtkRegressionTestImage.h\"\n\nconst char* SimpleVertexShader =\n\"void main(void)\\n\"\n\"{\\n\"\n\" gl_FrontColor = gl_Color;\\n\"\n\" gl_Position = ftransform();\\n\"\n\"}\\n\";\n\nconst char* SimpleFragmentShader =\n\"void main()\\n\"\n\"{\\n\"\n\" vec2 location = gl_PointCoord - vec2(0.5, 0.5);\\n\"\n\" float length = dot(location, location);\\n\"\n\" if (length < 0.20)\\n\"\n\" gl_FragColor = gl_Color;\\n\"\n\" else\\n\"\n\" gl_FragColor = vec4(0.0, 0.0, 0.0, 1.0);\\n\"\n\"}\\n\";\n\nconst char* SimpleFragmentShader2 =\n\"void main()\\n\"\n\"{\\n\"\n\" vec2 location = gl_PointCoord - vec2(0.5, 0.5);\\n\"\n\" float length = dot(location, location);\\n\"\n\" if(length > 0.25)\\n\"\n\" discard;\\n\"\n\" if (length < 0.20)\\n\"\n\" gl_FragColor = gl_Color;\\n\"\n\" else\\n\"\n\" gl_FragColor = vec4(0.0, 0.0, 0.0, 1.0);\\n\"\n\"}\\n\";\n\n#define VTK_CREATE(type, name) \\\n vtkSmartPointer<type> name = vtkSmartPointer<type>::New()\n\n\/\/----------------------------------------------------------------------------\nclass GLSLTestItem : public vtkContextItem\n{\npublic:\n GLSLTestItem() : program(0), program2(0)\n {\n }\n\n static GLSLTestItem *New();\n vtkTypeMacro(GLSLTestItem, vtkContextItem);\n \/\/ Paint event for the chart, called whenever the chart needs to be drawn\n virtual bool Paint(vtkContext2D *painter);\n\n void BuildShader(vtkOpenGLRenderWindow*);\n\n vtkShaderProgram2 *program, *program2;\n};\n\n\/\/----------------------------------------------------------------------------\nint TestGLSL( int argc, char * argv [] )\n{\n \/\/ Set up a 2D context view, context test object and add it to the scene\n VTK_CREATE(vtkContextView, view);\n view->GetRenderer()->SetBackground(1.0, 1.0, 1.0);\n view->GetRenderWindow()->SetSize(200, 200);\n VTK_CREATE(GLSLTestItem, test);\n view->GetScene()->AddItem(test);\n\n \/\/ Check if GLSL is supported\n if (!vtkShaderProgram2::IsSupported(dynamic_cast<vtkOpenGLRenderWindow*>(\n view->GetRenderWindow())))\n {\n cout << \"GLSL not supported.\" << endl;\n return 1;\n }\n\n view->GetRenderWindow()->SetMultiSamples(0);\n\n int retVal = vtkRegressionTestImage(view->GetRenderWindow());\n if(retVal == vtkRegressionTester::DO_INTERACTOR)\n {\n view->GetInteractor()->Initialize();\n view->GetInteractor()->Start();\n }\n\n return !retVal;\n}\n\n\/\/ Make our new derived class to draw a diagram\nvtkStandardNewMacro(GLSLTestItem);\n\/\/ This function aims to test the primitives provided by the 2D API.\nbool GLSLTestItem::Paint(vtkContext2D *painter)\n{\n \/\/ Build and link our shader if necessary\n vtkOpenGLContextDevice2D* device =\n vtkOpenGLContextDevice2D::SafeDownCast(painter->GetDevice());\n if (device)\n {\n this->BuildShader(device->GetRenderWindow());\n }\n else\n {\n return false;\n }\n\n \/\/ Draw points without our shader code\n for (int i = 0; i < 8; ++i)\n {\n float pos[] = { 50, i*25+5 };\n painter->GetPen()->SetColor(255,\n static_cast<unsigned char>(float(i)*35.0),\n 0);\n painter->GetPen()->SetWidth(i*5+1);\n painter->DrawPointSprites(0, pos, 1);\n }\n\n\n \/\/ Draw the points using the first shader program\n this->program->Use();\n for (int i = 0; i < 8; ++i)\n {\n float pos[] = { 100, i*25+5 };\n painter->GetPen()->SetColor(255,\n 0,\n static_cast<unsigned char>(float(i)*35.0));\n painter->GetPen()->SetWidth(i*5+1);\n painter->DrawPointSprites(0, pos, 1);\n }\n this->program->Restore();\n\n \/\/ Draw the points using the second shader program\n this->program2->Use();\n for (int i = 0; i < 8; ++i)\n {\n float pos[] = { 150, i*25+5 };\n painter->GetPen()->SetColor(static_cast<unsigned char>(float(i)*35.0),\n 255,\n 0);\n painter->GetPen()->SetWidth(i*5+1);\n painter->DrawPointSprites(0, pos, 1);\n }\n this->program2->Restore();\n\n return true;\n}\n\nvoid GLSLTestItem::BuildShader(vtkOpenGLRenderWindow* glContext)\n{\n if (this->program)\n {\n return;\n }\n this->program = vtkShaderProgram2::New();\n this->program->SetContext(glContext);\n this->program2 = vtkShaderProgram2::New();\n this->program2->SetContext(glContext);\n\n \/\/ The vertext shader\n vtkShader2 *shader = vtkShader2::New();\n shader->SetType(VTK_SHADER_TYPE_VERTEX);\n shader->SetSourceCode(SimpleVertexShader);\n shader->SetContext(this->program->GetContext());\n this->program->GetShaders()->AddItem(shader);\n this->program2->GetShaders()->AddItem(shader);\n shader->Delete();\n\n \/\/ The fragment shader\n shader = vtkShader2::New();\n shader->SetType(VTK_SHADER_TYPE_FRAGMENT);\n shader->SetSourceCode(SimpleFragmentShader);\n shader->SetContext(this->program->GetContext());\n this->program->GetShaders()->AddItem(shader);\n shader->Delete();\n\n \/\/ The 2nd fragment shader\n shader = vtkShader2::New();\n shader->SetType(VTK_SHADER_TYPE_FRAGMENT);\n shader->SetSourceCode(SimpleFragmentShader2);\n shader->SetContext(this->program->GetContext());\n this->program2->GetShaders()->AddItem(shader);\n shader->Delete();\n\n \/\/ Build the shader programs\n this->program->Build();\n if(this->program->GetLastBuildStatus() != VTK_SHADER_PROGRAM2_LINK_SUCCEEDED)\n {\n vtkErrorMacro(\"Couldn't build the shader program. It could be an error in a shader, or a driver bug.\");\n return;\n }\n\n this->program2->Build();\n if(this->program2->GetLastBuildStatus() != VTK_SHADER_PROGRAM2_LINK_SUCCEEDED)\n {\n vtkErrorMacro(\"Couldn't build the shader program. It could be an error in a shader, or a driver bug.\");\n return;\n }\n}\n<commit_msg>BUG: Fixed memory leaks in the test.<commit_after>\/*=========================================================================\n\n Program: Visualization Toolkit\n Module: TestContext.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 \"vtkRenderer.h\"\n#include \"vtkRenderWindow.h\"\n#include \"vtkRenderWindowInteractor.h\"\n#include \"vtkSmartPointer.h\"\n#include \"vtkObjectFactory.h\"\n#include \"vtkContext2D.h\"\n#include \"vtkContextItem.h\"\n#include \"vtkContextView.h\"\n#include \"vtkContextScene.h\"\n#include \"vtkPen.h\"\n#include \"vtkBrush.h\"\n#include \"vtkOpenGLContextDevice2D.h\"\n#include \"vtkPoints2D.h\"\n\n#include \"vtkShaderProgram2.h\"\n#include \"vtkShader2.h\"\n#include \"vtkShader2Collection.h\"\n#include \"vtkUniformVariables.h\"\n#include \"vtkOpenGLRenderWindow.h\"\n\n#include \"vtkRegressionTestImage.h\"\n\nconst char* SimpleVertexShader =\n\"#version 110\\n\"\n\"void main(void)\\n\"\n\"{\\n\"\n\" gl_FrontColor = gl_Color;\\n\"\n\" gl_Position = ftransform();\\n\"\n\"}\\n\";\n\nconst char* SimpleFragmentShader =\n\"#version 110\\n\"\n\"void main()\\n\"\n\"{\\n\"\n\" vec2 location = gl_PointCoord - vec2(0.5, 0.5);\\n\"\n\" float length = dot(location, location);\\n\"\n\" if (length < 0.20)\\n\"\n\" gl_FragColor = gl_Color;\\n\"\n\" else\\n\"\n\" gl_FragColor = vec4(0.0, 0.0, 0.0, 1.0);\\n\"\n\"}\\n\";\n\nconst char* SimpleFragmentShader2 =\n\"#version 110\\n\"\n\"void main()\\n\"\n\"{\\n\"\n\" vec2 location = gl_PointCoord - vec2(0.5, 0.5);\\n\"\n\" float length = dot(location, location);\\n\"\n\" if(length > 0.25)\\n\"\n\" discard;\\n\"\n\" if (length < 0.20)\\n\"\n\" gl_FragColor = gl_Color;\\n\"\n\" else\\n\"\n\" gl_FragColor = vec4(0.0, 0.0, 0.0, 1.0);\\n\"\n\"}\\n\";\n\n#define VTK_CREATE(type, name) \\\n vtkSmartPointer<type> name = vtkSmartPointer<type>::New()\n\n\/\/----------------------------------------------------------------------------\nclass GLSLTestItem : public vtkContextItem\n{\npublic:\n static GLSLTestItem *New();\n vtkTypeMacro(GLSLTestItem, vtkContextItem);\n \/\/ Paint event for the test.\n virtual bool Paint(vtkContext2D *painter);\n \/\/ Required for the shader programs - ensure they release their resources.\n virtual void ReleaseGraphicsResources();\n\n void BuildShader(vtkOpenGLRenderWindow*);\n\n vtkSmartPointer<vtkShaderProgram2> program, program2;\n};\n\n\/\/----------------------------------------------------------------------------\nint TestGLSL( int argc, char * argv [] )\n{\n \/\/ Set up a 2D context view, context test object and add it to the scene\n VTK_CREATE(vtkContextView, view);\n view->GetRenderer()->SetBackground(1.0, 1.0, 1.0);\n view->GetRenderWindow()->SetSize(200, 200);\n VTK_CREATE(GLSLTestItem, test);\n view->GetScene()->AddItem(test);\n\n \/\/ Check if GLSL is supported\n if (!vtkShaderProgram2::IsSupported(dynamic_cast<vtkOpenGLRenderWindow*>(\n view->GetRenderWindow())))\n {\n cout << \"GLSL not supported.\" << endl;\n return 1;\n }\n\n view->GetRenderWindow()->SetMultiSamples(0);\n\n int retVal = vtkRegressionTestImage(view->GetRenderWindow());\n if(retVal == vtkRegressionTester::DO_INTERACTOR)\n {\n view->GetInteractor()->Initialize();\n view->GetInteractor()->Start();\n }\n\n return !retVal;\n}\n\n\/\/ Make our new derived class to draw a diagram\nvtkStandardNewMacro(GLSLTestItem);\n\/\/ This function aims to test the primitives provided by the 2D API.\nbool GLSLTestItem::Paint(vtkContext2D *painter)\n{\n \/\/ Build and link our shader if necessary\n vtkOpenGLContextDevice2D* device =\n vtkOpenGLContextDevice2D::SafeDownCast(painter->GetDevice());\n if (device)\n {\n this->BuildShader(device->GetRenderWindow());\n }\n else\n {\n return false;\n }\n\n \/\/ Draw points without our shader code\n for (int i = 0; i < 8; ++i)\n {\n float pos[] = { 50, i*25+5 };\n painter->GetPen()->SetColor(255,\n static_cast<unsigned char>(float(i)*35.0),\n 0);\n painter->GetPen()->SetWidth(i*5+1);\n painter->DrawPointSprites(0, pos, 1);\n }\n\n\n \/\/ Draw the points using the first shader program\n this->program->Use();\n for (int i = 0; i < 8; ++i)\n {\n float pos[] = { 100, i*25+5 };\n painter->GetPen()->SetColor(255,\n 0,\n static_cast<unsigned char>(float(i)*35.0));\n painter->GetPen()->SetWidth(i*5+1);\n painter->DrawPointSprites(0, pos, 1);\n }\n this->program->Restore();\n\n \/\/ Draw the points using the second shader program\n this->program2->Use();\n for (int i = 0; i < 8; ++i)\n {\n float pos[] = { 150, i*25+5 };\n painter->GetPen()->SetColor(static_cast<unsigned char>(float(i)*35.0),\n 255,\n 0);\n painter->GetPen()->SetWidth(i*5+1);\n painter->DrawPointSprites(0, pos, 1);\n }\n this->program2->Restore();\n\n return true;\n}\n\nvoid GLSLTestItem::ReleaseGraphicsResources()\n{\n if (this->program)\n {\n this->program->ReleaseGraphicsResources();\n }\n if (this->program2)\n {\n this->program2->ReleaseGraphicsResources();\n }\n}\n\nvoid GLSLTestItem::BuildShader(vtkOpenGLRenderWindow* glContext)\n{\n if (this->program)\n {\n return;\n }\n this->program = vtkSmartPointer<vtkShaderProgram2>::New();\n this->program->SetContext(glContext);\n this->program2 = vtkSmartPointer<vtkShaderProgram2>::New();\n this->program2->SetContext(glContext);\n\n \/\/ The vertext shader\n vtkShader2 *shader = vtkShader2::New();\n shader->SetType(VTK_SHADER_TYPE_VERTEX);\n shader->SetSourceCode(SimpleVertexShader);\n shader->SetContext(this->program->GetContext());\n this->program->GetShaders()->AddItem(shader);\n this->program2->GetShaders()->AddItem(shader);\n shader->Delete();\n\n \/\/ The fragment shader\n shader = vtkShader2::New();\n shader->SetType(VTK_SHADER_TYPE_FRAGMENT);\n shader->SetSourceCode(SimpleFragmentShader);\n shader->SetContext(this->program->GetContext());\n this->program->GetShaders()->AddItem(shader);\n shader->Delete();\n\n \/\/ The 2nd fragment shader\n shader = vtkShader2::New();\n shader->SetType(VTK_SHADER_TYPE_FRAGMENT);\n shader->SetSourceCode(SimpleFragmentShader2);\n shader->SetContext(this->program->GetContext());\n this->program2->GetShaders()->AddItem(shader);\n shader->Delete();\n\n \/\/ Build the shader programs\n this->program->Build();\n if(this->program->GetLastBuildStatus() != VTK_SHADER_PROGRAM2_LINK_SUCCEEDED)\n {\n vtkErrorMacro(\"Couldn't build the shader program. It could be an error in a shader, or a driver bug.\");\n return;\n }\n\n this->program2->Build();\n if(this->program2->GetLastBuildStatus() != VTK_SHADER_PROGRAM2_LINK_SUCCEEDED)\n {\n vtkErrorMacro(\"Couldn't build the shader program. It could be an error in a shader, or a driver bug.\");\n return;\n }\n}\n<|endoftext|>"} {"text":"<commit_before>\/*\n * Copyright (c) 2012 The WebRTC project authors. All Rights Reserved.\n *\n * Use of this source code is governed by a BSD-style license\n * that can be found in the LICENSE file in the root of the source\n * tree. An additional intellectual property rights grant can be found\n * in the file PATENTS. All contributing project authors may\n * be found in the AUTHORS file in the root of the source tree.\n *\/\n\n\/\/ The state of a thread is controlled by the two member variables\n\/\/ alive_ and dead_.\n\/\/ alive_ represents the state the thread has been ordered to achieve.\n\/\/ It is set to true by the thread at startup, and is set to false by\n\/\/ other threads, using SetNotAlive() and Stop().\n\/\/ dead_ represents the state the thread has achieved.\n\/\/ It is written by the thread encapsulated by this class only\n\/\/ (except at init). It is read only by the Stop() method.\n\/\/ The Run() method fires event_ when it's started; this ensures that the\n\/\/ Start() method does not continue until after dead_ is false.\n\/\/ This protects against premature Stop() calls from the creator thread, but\n\/\/ not from other threads.\n\n\/\/ Their transitions and states:\n\/\/ alive_ dead_ Set by\n\/\/ false true Constructor\n\/\/ true false Run() method entry\n\/\/ false any Run() method run_function failure\n\/\/ any false Run() method exit (happens only with alive_ false)\n\/\/ false any SetNotAlive\n\/\/ false any Stop Stop waits for dead_ to become true.\n\/\/\n\/\/ Summarized a different way:\n\/\/ Variable Writer Reader\n\/\/ alive_ Constructor(false) Run.loop\n\/\/ Run.start(true)\n\/\/ Run.fail(false)\n\/\/ SetNotAlive(false)\n\/\/ Stop(false)\n\/\/\n\/\/ dead_ Constructor(true) Stop.loop\n\/\/ Run.start(false)\n\/\/ Run.exit(true)\n\n#include \"webrtc\/system_wrappers\/source\/thread_posix.h\"\n\n#include <algorithm>\n\n#include <assert.h>\n#include <errno.h>\n#include <string.h> \/\/ strncpy\n#include <time.h> \/\/ nanosleep\n#include <unistd.h>\n#ifdef WEBRTC_LINUX\n#include <sys\/types.h>\n#include <sched.h>\n#include <sys\/syscall.h>\n#include <linux\/unistd.h>\n#include <sys\/prctl.h>\n#endif\n\n#include \"webrtc\/system_wrappers\/interface\/critical_section_wrapper.h\"\n#include \"webrtc\/system_wrappers\/interface\/event_wrapper.h\"\n#include \"webrtc\/system_wrappers\/interface\/trace.h\"\n\nnamespace webrtc {\n\nint ConvertToSystemPriority(ThreadPriority priority, int min_prio,\n int max_prio) {\n assert(max_prio - min_prio > 2);\n const int top_prio = max_prio - 1;\n const int low_prio = min_prio + 1;\n\n switch (priority) {\n case kLowPriority:\n return low_prio;\n case kNormalPriority:\n \/\/ The -1 ensures that the kHighPriority is always greater or equal to\n \/\/ kNormalPriority.\n return (low_prio + top_prio - 1) \/ 2;\n case kHighPriority:\n return std::max(top_prio - 2, low_prio);\n case kHighestPriority:\n return std::max(top_prio - 1, low_prio);\n case kRealtimePriority:\n return top_prio;\n }\n assert(false);\n return low_prio;\n}\n\nextern \"C\"\n{\n static void* StartThread(void* lp_parameter) {\n static_cast<ThreadPosix*>(lp_parameter)->Run();\n return 0;\n }\n}\n\nThreadWrapper* ThreadPosix::Create(ThreadRunFunction func, ThreadObj obj,\n ThreadPriority prio,\n const char* thread_name) {\n ThreadPosix* ptr = new ThreadPosix(func, obj, prio, thread_name);\n if (!ptr) {\n return NULL;\n }\n const int error = ptr->Construct();\n if (error) {\n delete ptr;\n return NULL;\n }\n return ptr;\n}\n\nThreadPosix::ThreadPosix(ThreadRunFunction func, ThreadObj obj,\n ThreadPriority prio, const char* thread_name)\n : run_function_(func),\n obj_(obj),\n crit_state_(CriticalSectionWrapper::CreateCriticalSection()),\n alive_(false),\n dead_(true),\n prio_(prio),\n event_(EventWrapper::Create()),\n name_(),\n set_thread_name_(false),\n#if (defined(WEBRTC_LINUX) || defined(WEBRTC_ANDROID))\n pid_(-1),\n#endif\n attr_(),\n thread_(0) {\n if (thread_name != NULL) {\n set_thread_name_ = true;\n strncpy(name_, thread_name, kThreadMaxNameLength);\n name_[kThreadMaxNameLength - 1] = '\\0';\n }\n}\n\nuint32_t ThreadWrapper::GetThreadId() {\n#if defined(WEBRTC_ANDROID) || defined(WEBRTC_LINUX)\n return static_cast<uint32_t>(syscall(__NR_gettid));\n#else\n return reinterpret_cast<uint32_t>(pthread_self());\n#endif\n}\n\nint ThreadPosix::Construct() {\n int result = 0;\n#if !defined(WEBRTC_ANDROID)\n \/\/ Enable immediate cancellation if requested, see Shutdown().\n result = pthread_setcancelstate(PTHREAD_CANCEL_ENABLE, NULL);\n if (result != 0) {\n return -1;\n }\n result = pthread_setcanceltype(PTHREAD_CANCEL_ASYNCHRONOUS, NULL);\n if (result != 0) {\n return -1;\n }\n#endif\n result = pthread_attr_init(&attr_);\n if (result != 0) {\n return -1;\n }\n return 0;\n}\n\nThreadPosix::~ThreadPosix() {\n pthread_attr_destroy(&attr_);\n delete event_;\n delete crit_state_;\n}\n\n#define HAS_THREAD_ID !defined(WEBRTC_IOS) && !defined(WEBRTC_MAC)\n\nbool ThreadPosix::Start(unsigned int& thread_id)\n{\n int result = pthread_attr_setdetachstate(&attr_, PTHREAD_CREATE_DETACHED);\n \/\/ Set the stack stack size to 1M.\n result |= pthread_attr_setstacksize(&attr_, 1024 * 1024);\n#ifdef WEBRTC_THREAD_RR\n const int policy = SCHED_RR;\n#else\n const int policy = SCHED_FIFO;\n#endif\n event_->Reset();\n \/\/ If pthread_create was successful, a thread was created and is running.\n \/\/ Don't return false if it was successful since if there are any other\n \/\/ failures the state will be: thread was started but not configured as\n \/\/ asked for. However, the caller of this API will assume that a false\n \/\/ return value means that the thread never started.\n result |= pthread_create(&thread_, &attr_, &StartThread, this);\n if (result != 0) {\n return false;\n }\n {\n CriticalSectionScoped cs(crit_state_);\n dead_ = false;\n }\n\n \/\/ Wait up to 10 seconds for the OS to call the callback function. Prevents\n \/\/ race condition if Stop() is called too quickly after start.\n if (kEventSignaled != event_->Wait(WEBRTC_EVENT_10_SEC)) {\n WEBRTC_TRACE(kTraceError, kTraceUtility, -1,\n \"posix thread event never triggered\");\n \/\/ Timed out. Something went wrong.\n return true;\n }\n\n#if HAS_THREAD_ID\n thread_id = static_cast<unsigned int>(thread_);\n#endif\n sched_param param;\n\n const int min_prio = sched_get_priority_min(policy);\n const int max_prio = sched_get_priority_max(policy);\n\n if ((min_prio == EINVAL) || (max_prio == EINVAL)) {\n WEBRTC_TRACE(kTraceError, kTraceUtility, -1,\n \"unable to retreive min or max priority for threads\");\n return true;\n }\n if (max_prio - min_prio <= 2) {\n \/\/ There is no room for setting priorities with any granularity.\n return true;\n }\n param.sched_priority = ConvertToSystemPriority(prio_, min_prio, max_prio);\n result = pthread_setschedparam(thread_, policy, ¶m);\n if (result == EINVAL) {\n WEBRTC_TRACE(kTraceError, kTraceUtility, -1,\n \"unable to set thread priority\");\n }\n return true;\n}\n\n\/\/ CPU_ZERO and CPU_SET are not available in NDK r7, so disable\n\/\/ SetAffinity on Android for now.\n#if (defined(WEBRTC_LINUX) && (!defined(WEBRTC_ANDROID)))\nbool ThreadPosix::SetAffinity(const int* processor_numbers,\n const unsigned int amount_of_processors) {\n if (!processor_numbers || (amount_of_processors == 0)) {\n return false;\n }\n cpu_set_t mask;\n CPU_ZERO(&mask);\n\n for (unsigned int processor = 0;\n processor < amount_of_processors;\n ++processor) {\n CPU_SET(processor_numbers[processor], &mask);\n }\n#if defined(WEBRTC_ANDROID)\n \/\/ Android.\n const int result = syscall(__NR_sched_setaffinity,\n pid_,\n sizeof(mask),\n &mask);\n#else\n \/\/ \"Normal\" Linux.\n const int result = sched_setaffinity(pid_,\n sizeof(mask),\n &mask);\n#endif\n if (result != 0) {\n return false;\n }\n return true;\n}\n\n#else\n\/\/ NOTE: On Mac OS X, use the Thread affinity API in\n\/\/ \/usr\/include\/mach\/thread_policy.h: thread_policy_set and mach_thread_self()\n\/\/ instead of Linux gettid() syscall.\nbool ThreadPosix::SetAffinity(const int* , const unsigned int) {\n return false;\n}\n#endif\n\nvoid ThreadPosix::SetNotAlive() {\n CriticalSectionScoped cs(crit_state_);\n alive_ = false;\n}\n\nbool ThreadPosix::Stop() {\n bool dead = false;\n {\n CriticalSectionScoped cs(crit_state_);\n alive_ = false;\n dead = dead_;\n }\n\n \/\/ TODO(hellner) why not use an event here?\n \/\/ Wait up to 10 seconds for the thread to terminate\n for (int i = 0; i < 1000 && !dead; ++i) {\n timespec t;\n t.tv_sec = 0;\n t.tv_nsec = 10 * 1000 * 1000;\n nanosleep(&t, NULL);\n {\n CriticalSectionScoped cs(crit_state_);\n dead = dead_;\n }\n }\n if (dead) {\n return true;\n } else {\n return false;\n }\n}\n\nvoid ThreadPosix::Run() {\n {\n CriticalSectionScoped cs(crit_state_);\n alive_ = true;\n }\n#if (defined(WEBRTC_LINUX) || defined(WEBRTC_ANDROID))\n pid_ = GetThreadId();\n#endif\n \/\/ The event the Start() is waiting for.\n event_->Set();\n\n if (set_thread_name_) {\n#ifdef WEBRTC_LINUX\n prctl(PR_SET_NAME, (unsigned long)name_, 0, 0, 0);\n#endif\n WEBRTC_TRACE(kTraceStateInfo, kTraceUtility, -1,\n \"Thread with name:%s started \", name_);\n } else {\n WEBRTC_TRACE(kTraceStateInfo, kTraceUtility, -1,\n \"Thread without name started\");\n }\n bool alive = true;\n bool run = true;\n while (alive) {\n run = run_function_(obj_);\n CriticalSectionScoped cs(crit_state_);\n if (!run) {\n alive_ = false;\n }\n alive = alive_;\n }\n\n if (set_thread_name_) {\n \/\/ Don't set the name for the trace thread because it may cause a\n \/\/ deadlock. TODO(hellner) there should be a better solution than\n \/\/ coupling the thread and the trace class like this.\n if (strcmp(name_, \"Trace\")) {\n WEBRTC_TRACE(kTraceStateInfo, kTraceUtility, -1,\n \"Thread with name:%s stopped\", name_);\n }\n } else {\n WEBRTC_TRACE(kTraceStateInfo, kTraceUtility, -1,\n \"Thread without name stopped\");\n }\n {\n CriticalSectionScoped cs(crit_state_);\n dead_ = true;\n }\n}\n\n} \/\/ namespace webrtc\n<commit_msg>Mac 64-bit compatibility for WebRTC.<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\/\/ The state of a thread is controlled by the two member variables\n\/\/ alive_ and dead_.\n\/\/ alive_ represents the state the thread has been ordered to achieve.\n\/\/ It is set to true by the thread at startup, and is set to false by\n\/\/ other threads, using SetNotAlive() and Stop().\n\/\/ dead_ represents the state the thread has achieved.\n\/\/ It is written by the thread encapsulated by this class only\n\/\/ (except at init). It is read only by the Stop() method.\n\/\/ The Run() method fires event_ when it's started; this ensures that the\n\/\/ Start() method does not continue until after dead_ is false.\n\/\/ This protects against premature Stop() calls from the creator thread, but\n\/\/ not from other threads.\n\n\/\/ Their transitions and states:\n\/\/ alive_ dead_ Set by\n\/\/ false true Constructor\n\/\/ true false Run() method entry\n\/\/ false any Run() method run_function failure\n\/\/ any false Run() method exit (happens only with alive_ false)\n\/\/ false any SetNotAlive\n\/\/ false any Stop Stop waits for dead_ to become true.\n\/\/\n\/\/ Summarized a different way:\n\/\/ Variable Writer Reader\n\/\/ alive_ Constructor(false) Run.loop\n\/\/ Run.start(true)\n\/\/ Run.fail(false)\n\/\/ SetNotAlive(false)\n\/\/ Stop(false)\n\/\/\n\/\/ dead_ Constructor(true) Stop.loop\n\/\/ Run.start(false)\n\/\/ Run.exit(true)\n\n#include \"webrtc\/system_wrappers\/source\/thread_posix.h\"\n\n#include <algorithm>\n\n#include <assert.h>\n#include <errno.h>\n#include <string.h> \/\/ strncpy\n#include <time.h> \/\/ nanosleep\n#include <unistd.h>\n#ifdef WEBRTC_LINUX\n#include <sys\/types.h>\n#include <sched.h>\n#include <sys\/syscall.h>\n#include <linux\/unistd.h>\n#include <sys\/prctl.h>\n#endif\n\n#include \"webrtc\/system_wrappers\/interface\/critical_section_wrapper.h\"\n#include \"webrtc\/system_wrappers\/interface\/event_wrapper.h\"\n#include \"webrtc\/system_wrappers\/interface\/trace.h\"\n\nnamespace webrtc {\n\nint ConvertToSystemPriority(ThreadPriority priority, int min_prio,\n int max_prio) {\n assert(max_prio - min_prio > 2);\n const int top_prio = max_prio - 1;\n const int low_prio = min_prio + 1;\n\n switch (priority) {\n case kLowPriority:\n return low_prio;\n case kNormalPriority:\n \/\/ The -1 ensures that the kHighPriority is always greater or equal to\n \/\/ kNormalPriority.\n return (low_prio + top_prio - 1) \/ 2;\n case kHighPriority:\n return std::max(top_prio - 2, low_prio);\n case kHighestPriority:\n return std::max(top_prio - 1, low_prio);\n case kRealtimePriority:\n return top_prio;\n }\n assert(false);\n return low_prio;\n}\n\nextern \"C\"\n{\n static void* StartThread(void* lp_parameter) {\n static_cast<ThreadPosix*>(lp_parameter)->Run();\n return 0;\n }\n}\n\nThreadWrapper* ThreadPosix::Create(ThreadRunFunction func, ThreadObj obj,\n ThreadPriority prio,\n const char* thread_name) {\n ThreadPosix* ptr = new ThreadPosix(func, obj, prio, thread_name);\n if (!ptr) {\n return NULL;\n }\n const int error = ptr->Construct();\n if (error) {\n delete ptr;\n return NULL;\n }\n return ptr;\n}\n\nThreadPosix::ThreadPosix(ThreadRunFunction func, ThreadObj obj,\n ThreadPriority prio, const char* thread_name)\n : run_function_(func),\n obj_(obj),\n crit_state_(CriticalSectionWrapper::CreateCriticalSection()),\n alive_(false),\n dead_(true),\n prio_(prio),\n event_(EventWrapper::Create()),\n name_(),\n set_thread_name_(false),\n#if (defined(WEBRTC_LINUX) || defined(WEBRTC_ANDROID))\n pid_(-1),\n#endif\n attr_(),\n thread_(0) {\n if (thread_name != NULL) {\n set_thread_name_ = true;\n strncpy(name_, thread_name, kThreadMaxNameLength);\n name_[kThreadMaxNameLength - 1] = '\\0';\n }\n}\n\nuint32_t ThreadWrapper::GetThreadId() {\n#if defined(WEBRTC_ANDROID) || defined(WEBRTC_LINUX)\n return static_cast<uint32_t>(syscall(__NR_gettid));\n#elif defined(WEBRTC_MAC) || defined(WEBRTC_IOS)\n return pthread_mach_thread_np(pthread_self());\n#else\n return reinterpret_cast<uint32_t>(pthread_self());\n#endif\n}\n\nint ThreadPosix::Construct() {\n int result = 0;\n#if !defined(WEBRTC_ANDROID)\n \/\/ Enable immediate cancellation if requested, see Shutdown().\n result = pthread_setcancelstate(PTHREAD_CANCEL_ENABLE, NULL);\n if (result != 0) {\n return -1;\n }\n result = pthread_setcanceltype(PTHREAD_CANCEL_ASYNCHRONOUS, NULL);\n if (result != 0) {\n return -1;\n }\n#endif\n result = pthread_attr_init(&attr_);\n if (result != 0) {\n return -1;\n }\n return 0;\n}\n\nThreadPosix::~ThreadPosix() {\n pthread_attr_destroy(&attr_);\n delete event_;\n delete crit_state_;\n}\n\n#define HAS_THREAD_ID !defined(WEBRTC_IOS) && !defined(WEBRTC_MAC)\n\nbool ThreadPosix::Start(unsigned int& thread_id)\n{\n int result = pthread_attr_setdetachstate(&attr_, PTHREAD_CREATE_DETACHED);\n \/\/ Set the stack stack size to 1M.\n result |= pthread_attr_setstacksize(&attr_, 1024 * 1024);\n#ifdef WEBRTC_THREAD_RR\n const int policy = SCHED_RR;\n#else\n const int policy = SCHED_FIFO;\n#endif\n event_->Reset();\n \/\/ If pthread_create was successful, a thread was created and is running.\n \/\/ Don't return false if it was successful since if there are any other\n \/\/ failures the state will be: thread was started but not configured as\n \/\/ asked for. However, the caller of this API will assume that a false\n \/\/ return value means that the thread never started.\n result |= pthread_create(&thread_, &attr_, &StartThread, this);\n if (result != 0) {\n return false;\n }\n {\n CriticalSectionScoped cs(crit_state_);\n dead_ = false;\n }\n\n \/\/ Wait up to 10 seconds for the OS to call the callback function. Prevents\n \/\/ race condition if Stop() is called too quickly after start.\n if (kEventSignaled != event_->Wait(WEBRTC_EVENT_10_SEC)) {\n WEBRTC_TRACE(kTraceError, kTraceUtility, -1,\n \"posix thread event never triggered\");\n \/\/ Timed out. Something went wrong.\n return true;\n }\n\n#if HAS_THREAD_ID\n thread_id = static_cast<unsigned int>(thread_);\n#endif\n sched_param param;\n\n const int min_prio = sched_get_priority_min(policy);\n const int max_prio = sched_get_priority_max(policy);\n\n if ((min_prio == EINVAL) || (max_prio == EINVAL)) {\n WEBRTC_TRACE(kTraceError, kTraceUtility, -1,\n \"unable to retreive min or max priority for threads\");\n return true;\n }\n if (max_prio - min_prio <= 2) {\n \/\/ There is no room for setting priorities with any granularity.\n return true;\n }\n param.sched_priority = ConvertToSystemPriority(prio_, min_prio, max_prio);\n result = pthread_setschedparam(thread_, policy, ¶m);\n if (result == EINVAL) {\n WEBRTC_TRACE(kTraceError, kTraceUtility, -1,\n \"unable to set thread priority\");\n }\n return true;\n}\n\n\/\/ CPU_ZERO and CPU_SET are not available in NDK r7, so disable\n\/\/ SetAffinity on Android for now.\n#if (defined(WEBRTC_LINUX) && (!defined(WEBRTC_ANDROID)))\nbool ThreadPosix::SetAffinity(const int* processor_numbers,\n const unsigned int amount_of_processors) {\n if (!processor_numbers || (amount_of_processors == 0)) {\n return false;\n }\n cpu_set_t mask;\n CPU_ZERO(&mask);\n\n for (unsigned int processor = 0;\n processor < amount_of_processors;\n ++processor) {\n CPU_SET(processor_numbers[processor], &mask);\n }\n#if defined(WEBRTC_ANDROID)\n \/\/ Android.\n const int result = syscall(__NR_sched_setaffinity,\n pid_,\n sizeof(mask),\n &mask);\n#else\n \/\/ \"Normal\" Linux.\n const int result = sched_setaffinity(pid_,\n sizeof(mask),\n &mask);\n#endif\n if (result != 0) {\n return false;\n }\n return true;\n}\n\n#else\n\/\/ NOTE: On Mac OS X, use the Thread affinity API in\n\/\/ \/usr\/include\/mach\/thread_policy.h: thread_policy_set and mach_thread_self()\n\/\/ instead of Linux gettid() syscall.\nbool ThreadPosix::SetAffinity(const int* , const unsigned int) {\n return false;\n}\n#endif\n\nvoid ThreadPosix::SetNotAlive() {\n CriticalSectionScoped cs(crit_state_);\n alive_ = false;\n}\n\nbool ThreadPosix::Stop() {\n bool dead = false;\n {\n CriticalSectionScoped cs(crit_state_);\n alive_ = false;\n dead = dead_;\n }\n\n \/\/ TODO(hellner) why not use an event here?\n \/\/ Wait up to 10 seconds for the thread to terminate\n for (int i = 0; i < 1000 && !dead; ++i) {\n timespec t;\n t.tv_sec = 0;\n t.tv_nsec = 10 * 1000 * 1000;\n nanosleep(&t, NULL);\n {\n CriticalSectionScoped cs(crit_state_);\n dead = dead_;\n }\n }\n if (dead) {\n return true;\n } else {\n return false;\n }\n}\n\nvoid ThreadPosix::Run() {\n {\n CriticalSectionScoped cs(crit_state_);\n alive_ = true;\n }\n#if (defined(WEBRTC_LINUX) || defined(WEBRTC_ANDROID))\n pid_ = GetThreadId();\n#endif\n \/\/ The event the Start() is waiting for.\n event_->Set();\n\n if (set_thread_name_) {\n#ifdef WEBRTC_LINUX\n prctl(PR_SET_NAME, (unsigned long)name_, 0, 0, 0);\n#endif\n WEBRTC_TRACE(kTraceStateInfo, kTraceUtility, -1,\n \"Thread with name:%s started \", name_);\n } else {\n WEBRTC_TRACE(kTraceStateInfo, kTraceUtility, -1,\n \"Thread without name started\");\n }\n bool alive = true;\n bool run = true;\n while (alive) {\n run = run_function_(obj_);\n CriticalSectionScoped cs(crit_state_);\n if (!run) {\n alive_ = false;\n }\n alive = alive_;\n }\n\n if (set_thread_name_) {\n \/\/ Don't set the name for the trace thread because it may cause a\n \/\/ deadlock. TODO(hellner) there should be a better solution than\n \/\/ coupling the thread and the trace class like this.\n if (strcmp(name_, \"Trace\")) {\n WEBRTC_TRACE(kTraceStateInfo, kTraceUtility, -1,\n \"Thread with name:%s stopped\", name_);\n }\n } else {\n WEBRTC_TRACE(kTraceStateInfo, kTraceUtility, -1,\n \"Thread without name stopped\");\n }\n {\n CriticalSectionScoped cs(crit_state_);\n dead_ = true;\n }\n}\n\n} \/\/ namespace webrtc\n<|endoftext|>"} {"text":"<commit_before>\/\/ Copyright (c) 2015\n\/\/ Author: Chrono Law\n#include <std.hpp>\n\/\/using namespace std;\nusing std::string;\nusing std::cout;\nusing std::endl;\n\n#include <boost\/foreach.hpp>\n#include <boost\/filesystem.hpp>\nusing namespace boost::filesystem;\nnamespace fs = boost::filesystem;\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nvoid case1()\n{\n path p1(\".\/a_dir\");\n path p2(\"\/usr\/local\/lib\");\n path p3(\"c:\\\\tmp\\\\test.text\");\n path p4(\"d:\/boost\/boost\/filesystem\/\");\n\n path p5;\n assert(p5.empty());\n\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nvoid case2()\n{\n char str[] = \"the path is (\/root).\";\n\n {\n path p(str + 13, str + 14);\n assert(!p.empty());\n\n p \/= \"etc\";\n string filename = \"xinetd.conf\";\n p.append(filename.begin(), filename.end());\n cout << p << endl;\n cout << system_complete(p) << endl;\n }\n\n {\n path p(str + 13, str + 15);\n\n p += \"etc\";\n string filename = \"xinetd.conf\";\n p.concat(filename.begin(), filename.end());\n cout << p << endl;\n }\n\n path p(\"\/::\/*\/?\/<>\");\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nvoid case3()\n{\n string fname(\"w+abc.xxx\");\n assert(!portable_posix_name(fname));\n assert(windows_name(fname));\n\n assert(!portable_name(\"w+()abc.txt\") && !portable_name(\".\/abc\"));\n assert(!portable_directory_name(\"a.txt\") && portable_directory_name(\"abc\"));\n assert( portable_file_name(\"a.bc\") && !portable_file_name(\"y.conf\"));\n\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nvoid case4()\n{\n path p(\"\/usr\/local\/include\/xxx.hpp\");\n\n cout << p.string() << endl;\n\n cout << p.parent_path() << endl;\n cout << p.stem() << endl;\n cout << p.filename() << endl;\n cout << p.extension() << endl;\n\n assert(p.is_absolute());\n assert(system_complete(p).is_absolute());\n\n cout << p.root_name() << endl;\n cout << p.root_directory() << endl;\n cout << p.root_path() << endl;\n\n assert(!p.has_root_name());\n assert( p.has_root_path());\n assert( p.has_parent_path());\n\n cout << p.replace_extension() << endl;\n cout << p.replace_extension(\"hxx\") << endl;\n cout << p.remove_filename() << endl;\n\n path p1(\"\/test\/1.cpp\");\n path p2(\"\/TEST\/1.cpp\");\n path p3(\"\/abc\/1.cpp\");\n\n assert(p1 != p2);\n assert(p2 < p3);\n\n p = \"\/boost\/tools\/libs\";\n\n BOOST_FOREACH(auto& x , p)\n {\n cout << \"[\"<< x << \"]\";\n }\n\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nvoid case5()\n{\n path p(\"\/test.txt\");\n\n try\n {\n file_size(p);\n }\n catch(filesystem_error& e)\n {\n cout << e.path1() << endl;\n cout << e.what() << endl;\n }\n\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nvoid case6()\n{\n assert(status(\"\/dev\/null\").type() == character_file);\n assert(status(\"\/bin\").type() == directory_file);\n assert(status(\"\/bin\/sh\").type() == regular_file);\n\n assert((status(\"\/bin\/sh\").permissions() & owner_exe) == owner_exe);\n\n path root = \"\/usr\/local\/include\/boost\";\n\n assert( is_directory(root));\n assert(!exists(root\/\"nofile\"));\n assert(!is_symlink(root\/\"version.hpp\"));\n assert(!is_other(root\/\"version.hpp\"));\n assert( is_regular_file(root\/\"version.hpp\"));\n assert(!fs::is_empty(root\/\"version.hpp\"));\n\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nvoid case7()\n{\n cout << initial_path() << endl;\n cout << current_path() << endl;\n\n \/\/ generate a temp file for test\n std::ofstream(\".\/test.txt\") << \"abcd\" << std::endl;\n\n \/\/path p(\"\/usr\/local\/include\/boost\/version.hpp\");\n path p(\".\/test.txt\");\n cout << file_size(p) << endl;\n\n time_t t = last_write_time(p);\n last_write_time(p, time(0));\n\n (void)t;\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n#include <boost\/ratio.hpp>\nvoid case8()\n{\n using namespace boost;\n \/\/const int GBYTES = 1000*1000*1000; \/\/GB，不是GiB\n space_info si = space(\"\/home\/chrono\");\n cout << si.capacity \/ giga::num<< endl;\n cout << si.available \/ giga::num<< endl;\n cout << si.free \/ giga::num<< endl;\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nvoid case9()\n{\n \/\/namespace fs = boost::filesystem;\n\n path ptest = \".\/test\";\n if (exists(ptest))\n {\n if (fs::is_empty(ptest))\n {\n remove(ptest) ;\n }\n else\n {\n remove_all(ptest);\n }\n }\n\n assert(!exists(ptest));\n create_directory(ptest) ;\n\n copy_file(\"\/usr\/local\/include\/boost\/version.hpp\", ptest \/ \"a.txt\");\n assert(exists(ptest \/ \"a.txt\"));\n\n rename(ptest \/ \"a.txt\", ptest \/ \"b.txt\");\n assert(exists(ptest \/ \"b.txt\"));\n\n create_directories(ptest \/ \"sub_dir1\" \/ \"sub_dir1\");\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nvoid case10()\n{\n \/\/directory_iterator end;\n \/\/for (directory_iterator pos(\"\/usr\/local\/lib\/\");pos != end; ++pos)\n \/\/{ cout << *pos << endl; }\n string path = \"\/dev\/shm\";\/\/\"\/tmp\";\n\n typedef std::pair<directory_iterator, directory_iterator> dir_range;\n \/\/dir_range dr(directory_iterator(\"\/usr\/local\/lib\/\"),\n dir_range dr(directory_iterator(path.c_str()),\n directory_iterator());\n\n BOOST_FOREACH(auto& x , dr)\n { cout << x << endl; }\n\n typedef recursive_directory_iterator rd_iterator;\n\n rd_iterator end;\n for (rd_iterator pos(path.c_str());pos != end; ++pos)\n {\n cout << \"level\" << pos.level() << \":\" <<*pos << endl;\n }\n\n\n}\n\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nint main()\n{\n case1();\n case2();\n case3();\n case4();\n \/\/case5();\n case6();\n case7();\n case8();\n \/\/case9();\n case10();\n}\n\n<commit_msg>level() => depth()<commit_after>\/\/ Copyright (c) 2015\n\/\/ Author: Chrono Law\n#include <std.hpp>\n\/\/using namespace std;\nusing std::string;\nusing std::cout;\nusing std::endl;\n\n#include <boost\/foreach.hpp>\n#include <boost\/filesystem.hpp>\nusing namespace boost::filesystem;\nnamespace fs = boost::filesystem;\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nvoid case1()\n{\n path p1(\".\/a_dir\");\n path p2(\"\/usr\/local\/lib\");\n path p3(\"c:\\\\tmp\\\\test.text\");\n path p4(\"d:\/boost\/boost\/filesystem\/\");\n\n path p5;\n assert(p5.empty());\n\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nvoid case2()\n{\n char str[] = \"the path is (\/root).\";\n\n {\n path p(str + 13, str + 14);\n assert(!p.empty());\n\n p \/= \"etc\";\n string filename = \"xinetd.conf\";\n p.append(filename.begin(), filename.end());\n cout << p << endl;\n cout << system_complete(p) << endl;\n }\n\n {\n path p(str + 13, str + 15);\n\n p += \"etc\";\n string filename = \"xinetd.conf\";\n p.concat(filename.begin(), filename.end());\n cout << p << endl;\n }\n\n path p(\"\/::\/*\/?\/<>\");\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nvoid case3()\n{\n string fname(\"w+abc.xxx\");\n assert(!portable_posix_name(fname));\n assert(windows_name(fname));\n\n assert(!portable_name(\"w+()abc.txt\") && !portable_name(\".\/abc\"));\n assert(!portable_directory_name(\"a.txt\") && portable_directory_name(\"abc\"));\n assert( portable_file_name(\"a.bc\") && !portable_file_name(\"y.conf\"));\n\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nvoid case4()\n{\n path p(\"\/usr\/local\/include\/xxx.hpp\");\n\n cout << p.string() << endl;\n\n cout << p.parent_path() << endl;\n cout << p.stem() << endl;\n cout << p.filename() << endl;\n cout << p.extension() << endl;\n\n assert(p.is_absolute());\n assert(system_complete(p).is_absolute());\n\n cout << p.root_name() << endl;\n cout << p.root_directory() << endl;\n cout << p.root_path() << endl;\n\n assert(!p.has_root_name());\n assert( p.has_root_path());\n assert( p.has_parent_path());\n\n cout << p.replace_extension() << endl;\n cout << p.replace_extension(\"hxx\") << endl;\n cout << p.remove_filename() << endl;\n\n path p1(\"\/test\/1.cpp\");\n path p2(\"\/TEST\/1.cpp\");\n path p3(\"\/abc\/1.cpp\");\n\n assert(p1 != p2);\n assert(p2 < p3);\n\n p = \"\/boost\/tools\/libs\";\n\n BOOST_FOREACH(auto& x , p)\n {\n cout << \"[\"<< x << \"]\";\n }\n\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nvoid case5()\n{\n path p(\"\/test.txt\");\n\n try\n {\n file_size(p);\n }\n catch(filesystem_error& e)\n {\n cout << e.path1() << endl;\n cout << e.what() << endl;\n }\n\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nvoid case6()\n{\n assert(status(\"\/dev\/null\").type() == character_file);\n assert(status(\"\/bin\").type() == directory_file);\n assert(status(\"\/bin\/sh\").type() == regular_file);\n\n assert((status(\"\/bin\/sh\").permissions() & owner_exe) == owner_exe);\n\n path root = \"\/usr\/local\/include\/boost\";\n\n assert( is_directory(root));\n assert(!exists(root\/\"nofile\"));\n assert(!is_symlink(root\/\"version.hpp\"));\n assert(!is_other(root\/\"version.hpp\"));\n assert( is_regular_file(root\/\"version.hpp\"));\n assert(!fs::is_empty(root\/\"version.hpp\"));\n\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nvoid case7()\n{\n cout << initial_path() << endl;\n cout << current_path() << endl;\n\n \/\/ generate a temp file for test\n std::ofstream(\".\/test.txt\") << \"abcd\" << std::endl;\n\n \/\/path p(\"\/usr\/local\/include\/boost\/version.hpp\");\n path p(\".\/test.txt\");\n cout << file_size(p) << endl;\n\n time_t t = last_write_time(p);\n last_write_time(p, time(0));\n\n (void)t;\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n#include <boost\/ratio.hpp>\nvoid case8()\n{\n using namespace boost;\n \/\/const int GBYTES = 1000*1000*1000; \/\/GB，不是GiB\n space_info si = space(\"\/home\/chrono\");\n cout << si.capacity \/ giga::num<< endl;\n cout << si.available \/ giga::num<< endl;\n cout << si.free \/ giga::num<< endl;\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nvoid case9()\n{\n \/\/namespace fs = boost::filesystem;\n\n path ptest = \".\/test\";\n if (exists(ptest))\n {\n if (fs::is_empty(ptest))\n {\n remove(ptest) ;\n }\n else\n {\n remove_all(ptest);\n }\n }\n\n assert(!exists(ptest));\n create_directory(ptest) ;\n\n copy_file(\"\/usr\/local\/include\/boost\/version.hpp\", ptest \/ \"a.txt\");\n assert(exists(ptest \/ \"a.txt\"));\n\n rename(ptest \/ \"a.txt\", ptest \/ \"b.txt\");\n assert(exists(ptest \/ \"b.txt\"));\n\n create_directories(ptest \/ \"sub_dir1\" \/ \"sub_dir1\");\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nvoid case10()\n{\n \/\/directory_iterator end;\n \/\/for (directory_iterator pos(\"\/usr\/local\/lib\/\");pos != end; ++pos)\n \/\/{ cout << *pos << endl; }\n string path = \"\/dev\/shm\";\/\/\"\/tmp\";\n\n typedef std::pair<directory_iterator, directory_iterator> dir_range;\n \/\/dir_range dr(directory_iterator(\"\/usr\/local\/lib\/\"),\n dir_range dr(directory_iterator(path.c_str()),\n directory_iterator());\n\n BOOST_FOREACH(auto& x , dr)\n { cout << x << endl; }\n\n typedef recursive_directory_iterator rd_iterator;\n\n rd_iterator end;\n for (rd_iterator pos(path.c_str());pos != end; ++pos)\n {\n cout << \"depth\" << pos.depth() << \":\" <<*pos << endl;\n }\n\n\n}\n\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nint main()\n{\n case1();\n case2();\n case3();\n case4();\n \/\/case5();\n case6();\n case7();\n case8();\n \/\/case9();\n case10();\n}\n\n<|endoftext|>"} {"text":"<commit_before>\/\/ Scintilla source code edit control\n\/** @file ExternalLexer.cxx\n ** Support external lexers in DLLs.\n **\/\n\/\/ Copyright 2001 Simon Steele <ss@pnotepad.org>, portions copyright Neil Hodgson.\n\/\/ The License.txt file describes the conditions under which this software may be distributed.\n\n#include <stdlib.h> \n#include <stdio.h> \n#include <string.h>\n#include <ctype.h> \n\n#include \"Platform.h\"\n\n#include \"SciLexer.h\"\n#include \"PropSet.h\"\n#include \"Accessor.h\"\n#include \"DocumentAccessor.h\"\n#include \"KeyWords.h\"\n#include \"ExternalLexer.h\"\n\nLexerManager *LexerManager::theInstance = NULL;\n\n\/\/------------------------------------------\n\/\/\n\/\/ ExternalLexerModule\n\/\/\n\/\/------------------------------------------\n\nchar **WordListsToStrings(WordList *val[]) {\n\tint dim = 0;\n\twhile (val[dim])\n\t\tdim++;\n\tchar **wls = new char * [dim + 1];\n\tfor (int i = 0;i < dim;i++) {\n\t\tSString words;\n\t\twords = \"\";\n\t\tfor (int n = 0; n < val[i]->len; n++) {\n\t\t\twords += val[i]->words[n];\n\t\t\tif (n != val[i]->len - 1)\n\t\t\t\twords += \" \";\n\t\t}\n\t\twls[i] = new char[words.length() + 1];\n\t\tstrcpy(wls[i], words.c_str());\n\t}\n\twls[dim] = 0;\n\treturn wls;\n}\n\nvoid DeleteWLStrings(char *strs[]) {\n\tint dim = 0;\n\twhile (strs[dim]) {\n\t\tdelete strs[dim];\n\t\tdim++;\n\t}\n\tdelete [] strs;\n}\n\nvoid ExternalLexerModule::Lex(unsigned int startPos, int lengthDoc, int initStyle,\n WordList *keywordlists[], Accessor &styler) const {\n\tif (!fneLexer)\n\t\treturn ;\n\n\tchar **kwds = WordListsToStrings(keywordlists);\n\tchar *ps = styler.GetProperties();\n\t\n\t\/\/ The accessor passed in is always a DocumentAccessor so this cast and the subsequent \n\t\/\/ access will work. Can not use the stricter dynamic_cast as that requires RTTI.\n\tDocumentAccessor &da = static_cast<DocumentAccessor &>(styler);\n\tWindowID wID = da.GetWindow();\n\n\tfneLexer(externalLanguage, startPos, lengthDoc, initStyle, kwds, wID, ps);\n\n\tdelete ps;\n\tDeleteWLStrings(kwds);\n}\n\nvoid ExternalLexerModule::Fold(unsigned int startPos, int lengthDoc, int initStyle,\n WordList *keywordlists[], Accessor &styler) const {\n\tif (!fneFolder)\n\t\treturn ;\n\n\tchar **kwds = WordListsToStrings(keywordlists);\n\tchar *ps = styler.GetProperties();\n\t\n\t\/\/ The accessor passed in is always a DocumentAccessor so this cast and the subsequent \n\t\/\/ access will work. Can not use the stricter dynamic_cast as that requires RTTI.\n\tDocumentAccessor &da = static_cast<DocumentAccessor &>(styler);\n\tWindowID wID = da.GetWindow();\n\n\tfneFolder(externalLanguage, startPos, lengthDoc, initStyle, kwds, wID, ps);\n\n\tdelete ps;\n\tDeleteWLStrings(kwds);\n}\n\nvoid ExternalLexerModule::SetExternal(ExtLexerFunction fLexer, ExtFoldFunction fFolder, int index) {\n\tfneLexer = fLexer;\n\tfneFolder = fFolder;\n\texternalLanguage = index;\n}\n\n\/\/------------------------------------------\n\/\/\n\/\/ LexerLibrary\n\/\/\n\/\/------------------------------------------\n\nLexerLibrary::LexerLibrary(const char* ModuleName) {\n\t\/\/ Initialise some members...\n\tfirst = NULL;\n\tlast = NULL;\n\n\t\/\/ Load the DLL\n\tlib = DynamicLibrary::Load(ModuleName);\n\tif (lib->IsValid()) {\n\t\tm_sModuleName = ModuleName;\n\t\t\/\/Cannot use reinterpret_cast because: ANSI C++ forbids casting between pointers to functions and objects\n\t\tGetLexerCountFn GetLexerCount = (GetLexerCountFn)lib->FindFunction(\"GetLexerCount\");\n\n\t\tif (GetLexerCount) {\n\t\t\tExternalLexerModule *lex;\n\t\t\tLexerMinder *lm;\n\n\t\t\t\/\/ Find functions in the DLL\n\t\t\tGetLexerNameFn GetLexerName = (GetLexerNameFn)lib->FindFunction(\"GetLexerName\");\n\t\t\tExtLexerFunction Lexer = (ExtLexerFunction)lib->FindFunction(\"Lex\");\n\t\t\tExtFoldFunction Folder = (ExtFoldFunction)lib->FindFunction(\"Fold\");\n\n\t\t\t\/\/ Assign a buffer for the lexer name.\n\t\t\tchar lexname[100];\n\t\t\tstrcpy(lexname, \"\");\n\n\t\t\tint nl = GetLexerCount();\n\n\t\t\tfor (int i = 0; i < nl; i++) {\n\t\t\t\tGetLexerName(i, lexname, 100);\n\t\t\t\tlex = new ExternalLexerModule(SCLEX_AUTOMATIC, NULL, lexname, NULL);\n\n\t\t\t\t\/\/ Create a LexerMinder so we don't leak the ExternalLexerModule...\n\t\t\t\tlm = new LexerMinder;\n\t\t\t\tlm->self = lex;\n\t\t\t\tlm->next = NULL;\n\t\t\t\tif (first != NULL) {\n\t\t\t\t\tlast->next = lm;\n\t\t\t\t\tlast = lm;\n\t\t\t\t} else {\n\t\t\t\t\tfirst = lm;\n\t\t\t\t\tlast = lm;\n\t\t\t\t}\n\n\t\t\t\t\/\/ The external lexer needs to know how to call into its DLL to\n\t\t\t\t\/\/ do its lexing and folding, we tell it here. Folder may be null.\n\t\t\t\tlex->SetExternal(Lexer, Folder, i);\n\t\t\t}\n\t\t}\n\t}\n\tnext = NULL;\n}\n\nLexerLibrary::~LexerLibrary() {\n\tRelease();\n\tdelete lib;\n}\n\nvoid LexerLibrary::Release() {\n\t\/\/TODO maintain a list of lexers created, and delete them!\n\tLexerMinder *lm;\n\tLexerMinder *next;\n\tlm = first;\n\twhile (NULL != lm) {\n\t\tnext = lm->next;\n\t\tdelete lm->self;\n\t\tdelete lm;\n\t\tlm = next;\n\t}\n\n\tfirst = NULL;\n\tlast = NULL;\n}\n\n\/\/------------------------------------------\n\/\/\n\/\/ LexerManager\n\/\/\n\/\/------------------------------------------\n\n\/\/\/ Return the single LexerManager instance...\nLexerManager *LexerManager::GetInstance() {\n\tif(!theInstance)\n\t\ttheInstance = new LexerManager;\n\treturn theInstance;\n}\n\n\/\/\/ Delete any LexerManager instance...\nvoid LexerManager::DeleteInstance()\n{\n\tif(theInstance) {\n\t\tdelete theInstance;\n\t\ttheInstance = NULL;\n\t}\n}\n\n\/\/\/ protected constructor - this is a singleton...\nLexerManager::LexerManager() {\n\tfirst = NULL;\n\tlast = NULL;\n}\n\nLexerManager::~LexerManager() {\n\tClear();\n}\n\nvoid LexerManager::Load(const char* path)\n{\n\tLoadLexerLibrary(path);\n}\n\nvoid LexerManager::LoadLexerLibrary(const char* module)\n{\n\tLexerLibrary *lib = new LexerLibrary(module);\n\tif (NULL != first) {\n\t\tlast->next = lib;\n\t\tlast = lib;\n\t} else {\n\t\tfirst = lib;\n\t\tlast = lib;\n\t}\n}\n\nvoid LexerManager::Clear()\n{\n\tif (NULL != first) {\n\t\tLexerLibrary *cur = first;\n\t\tLexerLibrary *next = first->next;\n\t\twhile (cur) {\n\t\t\tdelete cur;\n\t\t\tcur = next;\n\t\t}\n\t\tfirst = NULL;\n\t\tlast = NULL;\n\t}\n}\n\n\/\/------------------------------------------\n\/\/\n\/\/ LexerManager\n\/\/\n\/\/------------------------------------------\n\nLMMinder::~LMMinder()\n{\n\tLexerManager::DeleteInstance();\n}\n\nLMMinder minder;<commit_msg>Added line end at end of file.<commit_after>\/\/ Scintilla source code edit control\n\/** @file ExternalLexer.cxx\n ** Support external lexers in DLLs.\n **\/\n\/\/ Copyright 2001 Simon Steele <ss@pnotepad.org>, portions copyright Neil Hodgson.\n\/\/ The License.txt file describes the conditions under which this software may be distributed.\n\n#include <stdlib.h>\n#include <stdio.h>\n#include <string.h>\n#include <ctype.h>\n\n#include \"Platform.h\"\n\n#include \"SciLexer.h\"\n#include \"PropSet.h\"\n#include \"Accessor.h\"\n#include \"DocumentAccessor.h\"\n#include \"KeyWords.h\"\n#include \"ExternalLexer.h\"\n\nLexerManager *LexerManager::theInstance = NULL;\n\n\/\/------------------------------------------\n\/\/\n\/\/ ExternalLexerModule\n\/\/\n\/\/------------------------------------------\n\nchar **WordListsToStrings(WordList *val[]) {\n\tint dim = 0;\n\twhile (val[dim])\n\t\tdim++;\n\tchar **wls = new char * [dim + 1];\n\tfor (int i = 0;i < dim;i++) {\n\t\tSString words;\n\t\twords = \"\";\n\t\tfor (int n = 0; n < val[i]->len; n++) {\n\t\t\twords += val[i]->words[n];\n\t\t\tif (n != val[i]->len - 1)\n\t\t\t\twords += \" \";\n\t\t}\n\t\twls[i] = new char[words.length() + 1];\n\t\tstrcpy(wls[i], words.c_str());\n\t}\n\twls[dim] = 0;\n\treturn wls;\n}\n\nvoid DeleteWLStrings(char *strs[]) {\n\tint dim = 0;\n\twhile (strs[dim]) {\n\t\tdelete strs[dim];\n\t\tdim++;\n\t}\n\tdelete [] strs;\n}\n\nvoid ExternalLexerModule::Lex(unsigned int startPos, int lengthDoc, int initStyle,\n WordList *keywordlists[], Accessor &styler) const {\n\tif (!fneLexer)\n\t\treturn ;\n\n\tchar **kwds = WordListsToStrings(keywordlists);\n\tchar *ps = styler.GetProperties();\n\n\t\/\/ The accessor passed in is always a DocumentAccessor so this cast and the subsequent\n\t\/\/ access will work. Can not use the stricter dynamic_cast as that requires RTTI.\n\tDocumentAccessor &da = static_cast<DocumentAccessor &>(styler);\n\tWindowID wID = da.GetWindow();\n\n\tfneLexer(externalLanguage, startPos, lengthDoc, initStyle, kwds, wID, ps);\n\n\tdelete ps;\n\tDeleteWLStrings(kwds);\n}\n\nvoid ExternalLexerModule::Fold(unsigned int startPos, int lengthDoc, int initStyle,\n WordList *keywordlists[], Accessor &styler) const {\n\tif (!fneFolder)\n\t\treturn ;\n\n\tchar **kwds = WordListsToStrings(keywordlists);\n\tchar *ps = styler.GetProperties();\n\n\t\/\/ The accessor passed in is always a DocumentAccessor so this cast and the subsequent\n\t\/\/ access will work. Can not use the stricter dynamic_cast as that requires RTTI.\n\tDocumentAccessor &da = static_cast<DocumentAccessor &>(styler);\n\tWindowID wID = da.GetWindow();\n\n\tfneFolder(externalLanguage, startPos, lengthDoc, initStyle, kwds, wID, ps);\n\n\tdelete ps;\n\tDeleteWLStrings(kwds);\n}\n\nvoid ExternalLexerModule::SetExternal(ExtLexerFunction fLexer, ExtFoldFunction fFolder, int index) {\n\tfneLexer = fLexer;\n\tfneFolder = fFolder;\n\texternalLanguage = index;\n}\n\n\/\/------------------------------------------\n\/\/\n\/\/ LexerLibrary\n\/\/\n\/\/------------------------------------------\n\nLexerLibrary::LexerLibrary(const char* ModuleName) {\n\t\/\/ Initialise some members...\n\tfirst = NULL;\n\tlast = NULL;\n\n\t\/\/ Load the DLL\n\tlib = DynamicLibrary::Load(ModuleName);\n\tif (lib->IsValid()) {\n\t\tm_sModuleName = ModuleName;\n\t\t\/\/Cannot use reinterpret_cast because: ANSI C++ forbids casting between pointers to functions and objects\n\t\tGetLexerCountFn GetLexerCount = (GetLexerCountFn)lib->FindFunction(\"GetLexerCount\");\n\n\t\tif (GetLexerCount) {\n\t\t\tExternalLexerModule *lex;\n\t\t\tLexerMinder *lm;\n\n\t\t\t\/\/ Find functions in the DLL\n\t\t\tGetLexerNameFn GetLexerName = (GetLexerNameFn)lib->FindFunction(\"GetLexerName\");\n\t\t\tExtLexerFunction Lexer = (ExtLexerFunction)lib->FindFunction(\"Lex\");\n\t\t\tExtFoldFunction Folder = (ExtFoldFunction)lib->FindFunction(\"Fold\");\n\n\t\t\t\/\/ Assign a buffer for the lexer name.\n\t\t\tchar lexname[100];\n\t\t\tstrcpy(lexname, \"\");\n\n\t\t\tint nl = GetLexerCount();\n\n\t\t\tfor (int i = 0; i < nl; i++) {\n\t\t\t\tGetLexerName(i, lexname, 100);\n\t\t\t\tlex = new ExternalLexerModule(SCLEX_AUTOMATIC, NULL, lexname, NULL);\n\n\t\t\t\t\/\/ Create a LexerMinder so we don't leak the ExternalLexerModule...\n\t\t\t\tlm = new LexerMinder;\n\t\t\t\tlm->self = lex;\n\t\t\t\tlm->next = NULL;\n\t\t\t\tif (first != NULL) {\n\t\t\t\t\tlast->next = lm;\n\t\t\t\t\tlast = lm;\n\t\t\t\t} else {\n\t\t\t\t\tfirst = lm;\n\t\t\t\t\tlast = lm;\n\t\t\t\t}\n\n\t\t\t\t\/\/ The external lexer needs to know how to call into its DLL to\n\t\t\t\t\/\/ do its lexing and folding, we tell it here. Folder may be null.\n\t\t\t\tlex->SetExternal(Lexer, Folder, i);\n\t\t\t}\n\t\t}\n\t}\n\tnext = NULL;\n}\n\nLexerLibrary::~LexerLibrary() {\n\tRelease();\n\tdelete lib;\n}\n\nvoid LexerLibrary::Release() {\n\t\/\/TODO maintain a list of lexers created, and delete them!\n\tLexerMinder *lm;\n\tLexerMinder *next;\n\tlm = first;\n\twhile (NULL != lm) {\n\t\tnext = lm->next;\n\t\tdelete lm->self;\n\t\tdelete lm;\n\t\tlm = next;\n\t}\n\n\tfirst = NULL;\n\tlast = NULL;\n}\n\n\/\/------------------------------------------\n\/\/\n\/\/ LexerManager\n\/\/\n\/\/------------------------------------------\n\n\/\/\/ Return the single LexerManager instance...\nLexerManager *LexerManager::GetInstance() {\n\tif(!theInstance)\n\t\ttheInstance = new LexerManager;\n\treturn theInstance;\n}\n\n\/\/\/ Delete any LexerManager instance...\nvoid LexerManager::DeleteInstance()\n{\n\tif(theInstance) {\n\t\tdelete theInstance;\n\t\ttheInstance = NULL;\n\t}\n}\n\n\/\/\/ protected constructor - this is a singleton...\nLexerManager::LexerManager() {\n\tfirst = NULL;\n\tlast = NULL;\n}\n\nLexerManager::~LexerManager() {\n\tClear();\n}\n\nvoid LexerManager::Load(const char* path)\n{\n\tLoadLexerLibrary(path);\n}\n\nvoid LexerManager::LoadLexerLibrary(const char* module)\n{\n\tLexerLibrary *lib = new LexerLibrary(module);\n\tif (NULL != first) {\n\t\tlast->next = lib;\n\t\tlast = lib;\n\t} else {\n\t\tfirst = lib;\n\t\tlast = lib;\n\t}\n}\n\nvoid LexerManager::Clear()\n{\n\tif (NULL != first) {\n\t\tLexerLibrary *cur = first;\n\t\tLexerLibrary *next = first->next;\n\t\twhile (cur) {\n\t\t\tdelete cur;\n\t\t\tcur = next;\n\t\t}\n\t\tfirst = NULL;\n\t\tlast = NULL;\n\t}\n}\n\n\/\/------------------------------------------\n\/\/\n\/\/ LexerManager\n\/\/\n\/\/------------------------------------------\n\nLMMinder::~LMMinder()\n{\n\tLexerManager::DeleteInstance();\n}\n\nLMMinder minder;\n<|endoftext|>"} {"text":"<commit_before>\/***********************************************************************************************************************\n **\n ** Copyright (c) 2011, 2013 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 \"VComment.h\"\n#include \"VCommentBrowser.h\"\n#include \"VCommentImage.h\"\n#include \"VisualizationBase\/src\/items\/Line.h\"\n#include \"VisualizationBase\/src\/items\/ItemStyle.h\"\n#include \"VisualizationBase\/src\/items\/Text.h\"\n#include \"VisualizationBase\/src\/declarative\/DeclarativeItemDef.h\"\n\nusing namespace Visualization;\n\nnamespace Comments {\n\nITEM_COMMON_DEFINITIONS(VComment, \"item\")\n\nVComment::VComment(Item* parent, NodeType* node) : Super(parent, node, itemStyles().get())\n{\n\t\/\/ import existing diagrams\n\tfor(auto diagram : *node->diagrams())\n\t{\n\t\tdiagrams_[diagram->name()] = diagram;\n\t}\n\n\tediting_ = node->lines()->size() == 0 || (node->lines()->size() == 1 && node->lines()->at(0)->get().isEmpty());\n\tparseLines();\n}\n\n\/\/ split up user-provided text into single elements\nvoid VComment::parseLines()\n{\n\tclearChildren();\n\tbool isHTML = false;\n\n\tQSet<QString> diagramNames{};\n\tint listCount = -1;\n\n\tfor(auto nodeLine : *node()->lines())\n\t{\n\t\tQRegExp rx(\"^={3,}|-{3,}|\\\\.{3,}$\");\n\t\tQString line = nodeLine->get();\n\n\t\t\/\/ is this a new enumeration item?\n\t\tif(line.left(3) == \" * \")\n\t\t{\n\t\t\tlistCount++;\n\t\t\t\/\/ does this create a new list?\n\t\t\tif(listCount == 0)\n\t\t\t{\n\t\t\t\tpushTextLine(\"<ol><li>\");\n\t\t\t\tline = line.mid(3);\n\t\t\t}\n\t\t\t\/\/ otherwise, just add another list item\n\t\t\telse\n\t\t\t{\n\t\t\t\tpushTextLine(\"<\/li><li>\");\n\t\t\t\tline = line.mid(3);\n\t\t\t}\n\t\t}\n\t\t\/\/ or is this extending an existing list?\n\t\telse if(line.left(3) == \" \" && listCount > -1)\n\t\t{\n\t\t\tline = line.mid(3);\n\t\t}\n\t\t\/\/ if this is not an enumeration item, reset listCount\n\t\telse if(listCount > -1 && line.left(3) != \" * \" && line.left(3) != \" \")\n\t\t{\n\t\t\tpushTextLine(\"<\/li><\/ol>\");\n\t\t\tlistCount = -1;\n\t\t}\n\n\t\t\/\/ is this HTML?\n\t\tif(line == \"<html>\")\n\t\t{\n\t\t\tpopLineBuffer();\n\t\t\tisHTML = true;\n\t\t\tcontinue;\n\t\t}\n\t\telse if(isHTML)\n\t\t{\n\t\t\tif(line == \"<\/html>\")\n\t\t\t{\n\t\t\t\tisHTML = false;\n\t\t\t\tpopLineBuffer(true);\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\tpushTextLine(line);\n\t\t\t}\n\t\t\t\/\/ don't process further\n\t\t\tcontinue;\n\t\t}\n\n\t\tif(rx.exactMatch(line))\n\t\t{\n\t\t\t\/\/ A line consists of one of . - = that is repeated three times or more\n\t\t\t\/\/ The used character defines the strength of the header, i.e. one of three levels\n\t\t\tQString style;\n\t\t\tswitch(line[0].toAscii())\n\t\t\t{\n\t\t\t\tdefault:\n\t\t\t\tcase '.': style = \"single\"; break;\n\t\t\t\tcase '-': style = \"double\"; break;\n\t\t\t\tcase '=': style = \"triple\"; break;\n\t\t\t}\n\n\t\t\taddChildItem(new Line(this, Line::itemStyles().get(style)));\n\t\t\tcontinue;\n\t\t}\n\n\t\t\/\/ is this a header? replace it right away with the appropriate tag\n\t\trx.setPattern(\"^(#+)([^#].*)\");\n\t\t\/\/ allow headers h1 to h6\n\t\tif(rx.exactMatch(line) && rx.cap(1).length() <= 6)\n\t\t{\n\t\t\tQString len = QString::number(rx.cap(1).length());\n\t\t\tpushTextLine(\"<h\" + len + \">\" + rx.cap(2).simplified() + \"<\/h\" + len + \">\");\n\t\t}\n\t\t\/\/ is this a diagram? format: [diagram#diagramName]\n\t\telse if(line.left(9) == \"[diagram#\" && line.right(1) == \"]\" && line.size() > 9+1)\n\t\t{\n\t\t\tQString diagramName = line.mid(9,line.size()-9-1);\n\t\t\tdiagramNames << diagramName;\n\n\t\t\tCommentDiagram* diagram = diagrams_.value(diagramName, nullptr);\n\n\t\t\tif(diagram == nullptr)\n\t\t\t{\n\t\t\t\tdiagram = new CommentDiagram(nullptr, diagramName);\n\t\t\t\tdiagrams_[diagramName] = diagram;\n\t\t\t}\n\n\t\t\tauto item = renderer()->render(this, diagram);\n\t\t\taddChildItem(item);\n\t\t}\n\t\t\/\/ urls are specified as [browser#http:\/\/www.google.com]\n\t\telse if(line.left(9) == \"[browser#\" && line.right(1) == \"]\" && line.size() > 9+1)\n\t\t{\n\t\t\tQString mid = line.mid(9, line.size()-9-1);\n\t\t\t\/\/ read width and height, if specified\n\t\t\tauto items = parseMarkdownArguments(mid);\n\t\t\tQString url = items->at(0).second;\n\t\t\tauto browser = new VCommentBrowser(this, QUrl(url));\n\n\t\t\tif(items->size() > 1)\n\t\t\t{\n\t\t\t\tQSize size = parseSize(items->at(1).second);\n\t\t\t\tbrowser->updateSize(size);\n\t\t\t}\n\n\t\t\taddChildItem(browser);\n\t\t\tdelete items;\n\t\t}\n\t\t\/\/ images are specified as\n\t\t\/\/ [image#\/home\/user\/image.png]\n\t\t\/\/ [image#image.png|300x300] to specify a size\n\t\telse if(line.left(7) == \"[image#\" && line.right(1) == \"]\" && line.size() > 7+1)\n\t\t{\n\t\t\tQString mid = line.mid(7, line.size()-7-1);\n\t\t\t\/\/ read width and height, if specified\n\t\t\tauto items = parseMarkdownArguments(mid);\n\t\t\tQString path = items->at(0).second;\n\t\t\tQSize size(0,0);\n\t\t\tif(items->size() > 1)\n\t\t\t\tsize = parseSize(items->at(1).second);\n\n\t\t\taddChildItem(new VCommentImage(this, items->at(0).second, size));\n\t\t\tdelete items;\n\t\t}\n\t\telse\n\t\t{\n\t\t\tpushTextLine(line);\n\t\t}\n\t}\n\n\tpopLineBuffer();\n\tsynchroniseDiagrams(diagramNames);\n}\n\nvoid VComment::synchroniseDiagrams(QSet<QString> itemDiagramNames)\n{\n\t\/\/ get all diagrams from the node\n\tauto nodeDiagrams = node()->diagrams();\n\t\/\/ gather all names from the node diagrams for easier comparison\n\tQSet<QString> nodeDiagramNames{};\n\tfor(auto diagram : *nodeDiagrams)\n\t\tnodeDiagramNames << diagram->name();\n\n\t\/\/ get intersection of two sets\n\tQSet<QString> intersection(itemDiagramNames);\n\tintersection.intersect(nodeDiagramNames);\n\n\t\/\/ new diagrams were already constructed inside of parseLines(),\n\t\/\/ they also need to be added to the model now\n\tauto newDiagramNames = itemDiagramNames - intersection;\n\n\tif(newDiagramNames.size() > 0)\n\t{\n\t\tnode()->model()->beginModification(node(), \"Adding new diagrams\");\n\t\tfor(auto diagramName : newDiagramNames)\n\t\t{\n\t\t\tauto diagram = diagrams_.value(diagramName);\n\t\t\tnode()->diagrams()->append(diagram);\n\t\t}\n\t\tnode()->model()->endModification();\n\t}\n\n\t\/\/ diagrams that are no longer referenced need to be removed from the model\n\tauto oldDiagramNames = nodeDiagramNames - intersection;\n\n\tif(oldDiagramNames.size() > 0)\n\t{\n\t\tnode()->model()->beginModification(node(), \"Removing unreferenced diagrams\");\n\t\tfor(auto diagramName : oldDiagramNames)\n\t\t{\n\t\t\tauto diagram = diagrams_.value(diagramName);\n\t\t\tnode()->diagrams()->remove(diagram);\n\t\t\tdiagrams_.remove(diagramName);\n\t\t}\n\t\tnode()->model()->endModification();\n\t}\n}\n\nQMap<QString, CommentDiagram*> VComment::diagrams() const\n{\n\treturn diagrams_;\n}\n\nQSize VComment::parseSize(const QString& str)\n{\n\tint index = str.indexOf('x');\n\tbool ok{};\n\n\tint width = str.left(index).toInt(&ok);\n\tif(index > 0 && !ok)\n\t\tqDebug() << \"Invalid width specified in size string:\" << str;\n\n\tint height = str.mid(index+1).toInt(&ok);\n\tif(index+1 < str.size()-1 && !ok)\n\t\tqDebug() << \"Invalid height specified in size string:\" << str;\n\n\treturn QSize(width, height);\n}\n\nQVector<QPair<QString,QString>>* VComment::parseMarkdownArguments(const QString& argString)\n{\n\t\/\/ split string on all pipes\n\tauto lines = argString.split('|');\n\t\/\/ TODO: get rid of escaped pipes \\| e.g. in case an url contains one\n\n\tauto pairs = new QVector<QPair<QString,QString>>();\n\t\/\/ read key\/value pairs\n\tQRegExp rx(\"^[a-zA-Z]{,15}=\");\n\tfor(auto line : lines)\n\t{\n\t\tint index = rx.indexIn(line);\n\t\tif(index == -1)\n\t\t\tpairs->push_back(qMakePair(QString(), line));\n\t\telse\n\t\t\tpairs->push_back(qMakePair(line.left(index), line.mid(index+1)));\n\t}\n\n\treturn pairs;\n}\n\nQString VComment::replaceMarkdown(QString str)\n{\n\tQRegExp rx;\n\n\trx.setPattern(\"\\\\*\\\\*([^\\\\*]+)\\\\*\\\\*\");\n\tstr.replace(rx, \"<b>\\\\1<\/b>\");\n\n\trx.setPattern(\"\\\\*([^\\\\*]+)\\\\*\");\n\tstr.replace(rx, \"<i>\\\\1<\/i>\");\n\n\treturn str;\n}\n\nvoid VComment::pushTextLine(QString text)\n{\n\tlineBuffer_.push_back(text);\n}\n\nvoid VComment::popLineBuffer(bool asHtml)\n{\n\tif(lineBuffer_.size() > 0)\n\t{\n\t\tauto joined = lineBuffer_.join(\"\\n\");\n\n\t\tif(asHtml)\n\t\t{\n\t\t\tauto browser = new VCommentBrowser(this, joined);\n\t\t\tchildren_.push_back(browser);\n\t\t}\n\t\telse\n\t\t{\n\t\t\tauto text = new Text(this, Text::itemStyles().get(\"comment\"), replaceMarkdown(joined));\n\t\t\ttext->setTextFormat(Qt::RichText);\n\t\t\tchildren_.push_back(text);\n\t\t}\n\n\t\tlineBuffer_.clear();\n\t}\n}\n\nvoid VComment::addChildItem(Visualization::Item* item)\n{\n\tpopLineBuffer();\n\tchildren_.push_back(item);\n}\n\nvoid VComment::toggleEditing()\n{\n\tif(node()->lines()->size() == 0)\n\t\tediting_ = true;\n\telse\n\t\tediting_ = !editing_;\n\n\tif(!editing_)\n\t\tparseLines();\n\n\tsetUpdateNeeded(StandardUpdate);\n}\n\nbool VComment::editing() const\n{\n\treturn editing_;\n}\n\nvoid VComment::initializeForms()\n{\n\taddForm((new SequentialLayoutFormElement())\n\t\t\t\t->setVertical()\n\t\t\t\t->setListOfItems([](Item* i) {\n\t\t\t\t\tauto vc = static_cast<VComment*>(i);\n\t\t\t\t\treturn vc->children_;\n\t\t\t\t}\n\t));\n\n\taddForm(item<Visualization::VList>(&I::editLabel_, [](I* v){ return v->node()->lines(); },\n\t\t\t[](I* v){return &v->style()->editList();}));\n}\n\nint VComment::determineForm()\n{\n\treturn editing_ ? 1 : 0;\n}\n\n} \/* namespace Comments *\/\n<commit_msg>Add our own bullets.<commit_after>\/***********************************************************************************************************************\n **\n ** Copyright (c) 2011, 2013 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 \"VComment.h\"\n#include \"VCommentBrowser.h\"\n#include \"VCommentImage.h\"\n#include \"VisualizationBase\/src\/items\/Line.h\"\n#include \"VisualizationBase\/src\/items\/ItemStyle.h\"\n#include \"VisualizationBase\/src\/items\/Text.h\"\n#include \"VisualizationBase\/src\/declarative\/DeclarativeItemDef.h\"\n\nusing namespace Visualization;\n\nnamespace Comments {\n\nITEM_COMMON_DEFINITIONS(VComment, \"item\")\n\nVComment::VComment(Item* parent, NodeType* node) : Super(parent, node, itemStyles().get())\n{\n\t\/\/ import existing diagrams\n\tfor(auto diagram : *node->diagrams())\n\t{\n\t\tdiagrams_[diagram->name()] = diagram;\n\t}\n\n\tediting_ = node->lines()->size() == 0 || (node->lines()->size() == 1 && node->lines()->at(0)->get().isEmpty());\n\tparseLines();\n}\n\n\/\/ split up user-provided text into single elements\nvoid VComment::parseLines()\n{\n\tclearChildren();\n\tbool isHTML = false;\n\n\tQSet<QString> diagramNames{};\n\tint listCount = -1;\n\n\tfor(auto nodeLine : *node()->lines())\n\t{\n\t\tQRegExp rx(\"^={3,}|-{3,}|\\\\.{3,}$\");\n\t\tQString line = nodeLine->get();\n\n\t\t\/\/ is this a new enumeration item?\n\t\tif(line.left(3) == \" * \")\n\t\t{\n\t\t\tlistCount++;\n\t\t\t\/\/ does this create a new list?\n\t\t\tif(listCount == 0)\n\t\t\t{\n\t\t\t\tpushTextLine(\"<ul><li>• \");\n\t\t\t\tline = line.mid(3);\n\t\t\t}\n\t\t\t\/\/ otherwise, just add another list item\n\t\t\telse\n\t\t\t{\n\t\t\t\tpushTextLine(\"<\/li><li>• \");\n\t\t\t\tline = line.mid(3);\n\t\t\t}\n\t\t}\n\t\t\/\/ or is this extending an existing list?\n\t\telse if(line.left(3) == \" \" && listCount > -1)\n\t\t{\n\t\t\tline = line.mid(3);\n\t\t}\n\t\t\/\/ if this is not an enumeration item, reset listCount\n\t\telse if(listCount > -1 && line.left(3) != \" * \" && line.left(3) != \" \")\n\t\t{\n\t\t\tpushTextLine(\"<\/li><\/ul>\");\n\t\t\tlistCount = -1;\n\t\t}\n\n\t\t\/\/ is this HTML?\n\t\tif(line == \"<html>\")\n\t\t{\n\t\t\tpopLineBuffer();\n\t\t\tisHTML = true;\n\t\t\tcontinue;\n\t\t}\n\t\telse if(isHTML)\n\t\t{\n\t\t\tif(line == \"<\/html>\")\n\t\t\t{\n\t\t\t\tisHTML = false;\n\t\t\t\tpopLineBuffer(true);\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\tpushTextLine(line);\n\t\t\t}\n\t\t\t\/\/ don't process further\n\t\t\tcontinue;\n\t\t}\n\n\t\tif(rx.exactMatch(line))\n\t\t{\n\t\t\t\/\/ A line consists of one of . - = that is repeated three times or more\n\t\t\t\/\/ The used character defines the strength of the header, i.e. one of three levels\n\t\t\tQString style;\n\t\t\tswitch(line[0].toAscii())\n\t\t\t{\n\t\t\t\tdefault:\n\t\t\t\tcase '.': style = \"single\"; break;\n\t\t\t\tcase '-': style = \"double\"; break;\n\t\t\t\tcase '=': style = \"triple\"; break;\n\t\t\t}\n\n\t\t\taddChildItem(new Line(this, Line::itemStyles().get(style)));\n\t\t\tcontinue;\n\t\t}\n\n\t\t\/\/ is this a header? replace it right away with the appropriate tag\n\t\trx.setPattern(\"^(#+)([^#].*)\");\n\t\t\/\/ allow headers h1 to h6\n\t\tif(rx.exactMatch(line) && rx.cap(1).length() <= 6)\n\t\t{\n\t\t\tQString len = QString::number(rx.cap(1).length());\n\t\t\tpushTextLine(\"<h\" + len + \">\" + rx.cap(2).simplified() + \"<\/h\" + len + \">\");\n\t\t}\n\t\t\/\/ is this a diagram? format: [diagram#diagramName]\n\t\telse if(line.left(9) == \"[diagram#\" && line.right(1) == \"]\" && line.size() > 9+1)\n\t\t{\n\t\t\tQString diagramName = line.mid(9,line.size()-9-1);\n\t\t\tdiagramNames << diagramName;\n\n\t\t\tCommentDiagram* diagram = diagrams_.value(diagramName, nullptr);\n\n\t\t\tif(diagram == nullptr)\n\t\t\t{\n\t\t\t\tdiagram = new CommentDiagram(nullptr, diagramName);\n\t\t\t\tdiagrams_[diagramName] = diagram;\n\t\t\t}\n\n\t\t\tauto item = renderer()->render(this, diagram);\n\t\t\taddChildItem(item);\n\t\t}\n\t\t\/\/ urls are specified as [browser#http:\/\/www.google.com]\n\t\telse if(line.left(9) == \"[browser#\" && line.right(1) == \"]\" && line.size() > 9+1)\n\t\t{\n\t\t\tQString mid = line.mid(9, line.size()-9-1);\n\t\t\t\/\/ read width and height, if specified\n\t\t\tauto items = parseMarkdownArguments(mid);\n\t\t\tQString url = items->at(0).second;\n\t\t\tauto browser = new VCommentBrowser(this, QUrl(url));\n\n\t\t\tif(items->size() > 1)\n\t\t\t{\n\t\t\t\tQSize size = parseSize(items->at(1).second);\n\t\t\t\tbrowser->updateSize(size);\n\t\t\t}\n\n\t\t\taddChildItem(browser);\n\t\t\tdelete items;\n\t\t}\n\t\t\/\/ images are specified as\n\t\t\/\/ [image#\/home\/user\/image.png]\n\t\t\/\/ [image#image.png|300x300] to specify a size\n\t\telse if(line.left(7) == \"[image#\" && line.right(1) == \"]\" && line.size() > 7+1)\n\t\t{\n\t\t\tQString mid = line.mid(7, line.size()-7-1);\n\t\t\t\/\/ read width and height, if specified\n\t\t\tauto items = parseMarkdownArguments(mid);\n\t\t\tQString path = items->at(0).second;\n\t\t\tQSize size(0,0);\n\t\t\tif(items->size() > 1)\n\t\t\t\tsize = parseSize(items->at(1).second);\n\n\t\t\taddChildItem(new VCommentImage(this, items->at(0).second, size));\n\t\t\tdelete items;\n\t\t}\n\t\telse\n\t\t{\n\t\t\tpushTextLine(line);\n\t\t}\n\t}\n\n\tpopLineBuffer();\n\tsynchroniseDiagrams(diagramNames);\n}\n\nvoid VComment::synchroniseDiagrams(QSet<QString> itemDiagramNames)\n{\n\t\/\/ get all diagrams from the node\n\tauto nodeDiagrams = node()->diagrams();\n\t\/\/ gather all names from the node diagrams for easier comparison\n\tQSet<QString> nodeDiagramNames{};\n\tfor(auto diagram : *nodeDiagrams)\n\t\tnodeDiagramNames << diagram->name();\n\n\t\/\/ get intersection of two sets\n\tQSet<QString> intersection(itemDiagramNames);\n\tintersection.intersect(nodeDiagramNames);\n\n\t\/\/ new diagrams were already constructed inside of parseLines(),\n\t\/\/ they also need to be added to the model now\n\tauto newDiagramNames = itemDiagramNames - intersection;\n\n\tif(newDiagramNames.size() > 0)\n\t{\n\t\tnode()->model()->beginModification(node(), \"Adding new diagrams\");\n\t\tfor(auto diagramName : newDiagramNames)\n\t\t{\n\t\t\tauto diagram = diagrams_.value(diagramName);\n\t\t\tnode()->diagrams()->append(diagram);\n\t\t}\n\t\tnode()->model()->endModification();\n\t}\n\n\t\/\/ diagrams that are no longer referenced need to be removed from the model\n\tauto oldDiagramNames = nodeDiagramNames - intersection;\n\n\tif(oldDiagramNames.size() > 0)\n\t{\n\t\tnode()->model()->beginModification(node(), \"Removing unreferenced diagrams\");\n\t\tfor(auto diagramName : oldDiagramNames)\n\t\t{\n\t\t\tauto diagram = diagrams_.value(diagramName);\n\t\t\tnode()->diagrams()->remove(diagram);\n\t\t\tdiagrams_.remove(diagramName);\n\t\t}\n\t\tnode()->model()->endModification();\n\t}\n}\n\nQMap<QString, CommentDiagram*> VComment::diagrams() const\n{\n\treturn diagrams_;\n}\n\nQSize VComment::parseSize(const QString& str)\n{\n\tint index = str.indexOf('x');\n\tbool ok{};\n\n\tint width = str.left(index).toInt(&ok);\n\tif(index > 0 && !ok)\n\t\tqDebug() << \"Invalid width specified in size string:\" << str;\n\n\tint height = str.mid(index+1).toInt(&ok);\n\tif(index+1 < str.size()-1 && !ok)\n\t\tqDebug() << \"Invalid height specified in size string:\" << str;\n\n\treturn QSize(width, height);\n}\n\nQVector<QPair<QString,QString>>* VComment::parseMarkdownArguments(const QString& argString)\n{\n\t\/\/ split string on all pipes\n\tauto lines = argString.split('|');\n\t\/\/ TODO: get rid of escaped pipes \\| e.g. in case an url contains one\n\n\tauto pairs = new QVector<QPair<QString,QString>>();\n\t\/\/ read key\/value pairs\n\tQRegExp rx(\"^[a-zA-Z]{,15}=\");\n\tfor(auto line : lines)\n\t{\n\t\tint index = rx.indexIn(line);\n\t\tif(index == -1)\n\t\t\tpairs->push_back(qMakePair(QString(), line));\n\t\telse\n\t\t\tpairs->push_back(qMakePair(line.left(index), line.mid(index+1)));\n\t}\n\n\treturn pairs;\n}\n\nQString VComment::replaceMarkdown(QString str)\n{\n\tQRegExp rx;\n\n\trx.setPattern(\"\\\\*\\\\*([^\\\\*]+)\\\\*\\\\*\");\n\tstr.replace(rx, \"<b>\\\\1<\/b>\");\n\n\trx.setPattern(\"\\\\*([^\\\\*]+)\\\\*\");\n\tstr.replace(rx, \"<i>\\\\1<\/i>\");\n\n\treturn str;\n}\n\nvoid VComment::pushTextLine(QString text)\n{\n\tlineBuffer_.push_back(text);\n}\n\nvoid VComment::popLineBuffer(bool asHtml)\n{\n\tif(lineBuffer_.size() > 0)\n\t{\n\t\tauto joined = lineBuffer_.join(\"\\n\");\n\n\t\tif(asHtml)\n\t\t{\n\t\t\tauto browser = new VCommentBrowser(this, joined);\n\t\t\tchildren_.push_back(browser);\n\t\t}\n\t\telse\n\t\t{\n\t\t\tauto text = new Text(this, Text::itemStyles().get(\"comment\"), replaceMarkdown(joined));\n\t\t\ttext->setTextFormat(Qt::RichText);\n\t\t\tchildren_.push_back(text);\n\t\t}\n\n\t\tlineBuffer_.clear();\n\t}\n}\n\nvoid VComment::addChildItem(Visualization::Item* item)\n{\n\tpopLineBuffer();\n\tchildren_.push_back(item);\n}\n\nvoid VComment::toggleEditing()\n{\n\tif(node()->lines()->size() == 0)\n\t\tediting_ = true;\n\telse\n\t\tediting_ = !editing_;\n\n\tif(!editing_)\n\t\tparseLines();\n\n\tsetUpdateNeeded(StandardUpdate);\n}\n\nbool VComment::editing() const\n{\n\treturn editing_;\n}\n\nvoid VComment::initializeForms()\n{\n\taddForm((new SequentialLayoutFormElement())\n\t\t\t\t->setVertical()\n\t\t\t\t->setListOfItems([](Item* i) {\n\t\t\t\t\tauto vc = static_cast<VComment*>(i);\n\t\t\t\t\treturn vc->children_;\n\t\t\t\t}\n\t));\n\n\taddForm(item<Visualization::VList>(&I::editLabel_, [](I* v){ return v->node()->lines(); },\n\t\t\t[](I* v){return &v->style()->editList();}));\n}\n\nint VComment::determineForm()\n{\n\treturn editing_ ? 1 : 0;\n}\n\n} \/* namespace Comments *\/\n<|endoftext|>"} {"text":"<commit_before>\/****************************************************************************\n**\n** Copyright (C) 2010 Nokia Corporation and\/or its subsidiary(-ies).\n** All rights reserved.\n** Contact: Nokia Corporation (qt-info@nokia.com)\n**\n** This file is part of the Qt Mobility Components.\n**\n** $QT_BEGIN_LICENSE:BSD$\n** You may use this file under the terms of the BSD license as follows:\n**\n** \"Redistribution and use in source and binary forms, with or without\n** modification, are permitted provided that the following conditions are\n** met:\n** * Redistributions of source code must retain the above copyright\n** notice, this list of conditions and the following disclaimer.\n** * Redistributions in binary form must reproduce the above copyright\n** notice, this list of conditions and the following disclaimer in\n** the documentation and\/or other materials provided with the\n** distribution.\n** * Neither the name of Nokia Corporation and its Subsidiary(-ies) nor\n** the names of its contributors may be used to endorse or promote\n** products derived from this software without specific prior written\n** permission.\n**\n** THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS\n** \"AS IS\" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT\n** LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR\n** A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT\n** OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,\n** SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT\n** LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,\n** DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY\n** THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT\n** (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE\n** OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.\"\n** $QT_END_LICENSE$\n**\n****************************************************************************\/\n\n#include \"browser.h\"\n\n#include \"albumview.h\"\n#include \"artistview.h\"\n#include \"photoview.h\"\n#include \"songview.h\"\n\n#include \"qdocumentgallery.h\"\n\n#include <QtGui>\n\nBrowser::Browser(QWidget *parent, Qt::WindowFlags flags)\n : QMainWindow(parent, flags)\n , gallery(0)\n , stack(0)\n , artistView(0)\n , albumArtistView(0)\n , albumView(0)\n , songView(0)\n , photoView(0)\n{\n gallery = new QDocumentGallery;\n\n artistView = new ArtistView(QDocumentGallery::Artist, gallery);\n connect(artistView, SIGNAL(showAlbums(QVariant,QString)),\n this, SLOT(showAlbums(QVariant,QString)));\n connect(artistView, SIGNAL(showSongs(QVariant,QString)),\n this, SLOT(showSongs(QVariant,QString)));\n\n albumArtistView = new ArtistView(QDocumentGallery::AlbumArtist, gallery);\n connect(albumArtistView, SIGNAL(showAlbums(QVariant,QString)),\n this, SLOT(showAlbums(QVariant,QString)));\n connect(albumArtistView, SIGNAL(showSongs(QVariant,QString)),\n this, SLOT(showSongs(QVariant,QString)));\n\n albumView = new AlbumView(gallery);\n connect(albumView, SIGNAL(showSongs(QVariant,QString)),\n this, SLOT(showSongs(QVariant,QString)));\n\n songView = new SongView(gallery);\n\n photoView = new PhotoView(gallery);\n\n stack = new QStackedWidget;\n stack->addWidget(artistView);\n stack->addWidget(albumArtistView);\n stack->addWidget(albumView);\n stack->addWidget(songView);\n stack->addWidget(photoView);\n\n menuBar()->addAction(tr(\"Artists\"), this, SLOT(showArtists()));\n menuBar()->addAction(tr(\"Album Artists\"), this, SLOT(showAlbumArtists()));\n menuBar()->addAction(tr(\"Albums\"), this, SLOT(showAlbums()));\n menuBar()->addAction(tr(\"Songs\"), this, SLOT(showSongs()));\n menuBar()->addAction(tr(\"Photos\"), this, SLOT(showPhotos()));\n\n setCentralWidget(stack);\n showArtists();\n\n#ifdef Q_WS_MAEMO_5\n setAttribute(Qt::WA_Maemo5StackedWindow);\n#endif\n}\n\nBrowser::~Browser()\n{\n}\n\nvoid Browser::showArtists()\n{\n showView(artistView, tr(\"Artists\"));\n}\n\nvoid Browser::showArtists(const QVariant &containerId, const QString &title)\n{\n#ifdef Q_WS_MAEMO_5\n ArtistView *artistView = new ArtistView(QDocumentGallery::Artist, gallery);\n connect(artistView, SIGNAL(showAlbums(QVariant,QString)),\n this, SLOT(showAlbums(QVariant,QString)));\n connect(artistView, SIGNAL(showSongs(QVariant,QString)),\n this, SLOT(showSongs(QVariant,QString)));\n#endif\n\n showView(artistView, containerId, title);\n}\n\nvoid Browser::showAlbumArtists()\n{\n showView(albumArtistView, tr(\"Album Artists\"));\n}\n\nvoid Browser::showAlbumArtists(const QVariant &containerId, const QString &title)\n{\n#ifdef Q_WS_MAEMO_5\n ArtistView *albumArtistView = new ArtistView(QDocumentGallery::AlbumArtist, gallery);\n connect(albumArtistView, SIGNAL(showAlbums(QVariant,QString)),\n this, SLOT(showAlbums(QVariant,QString)));\n connect(albumArtistView, SIGNAL(showSongs(QVariant,QString)),\n this, SLOT(showSongs(QVariant,QString)));\n#endif\n\n showView(albumArtistView, containerId, title);\n}\n\nvoid Browser::showAlbums()\n{\n showView(albumView, tr(\"Albums\"));\n}\n\nvoid Browser::showAlbums(const QVariant &containerId, const QString &title)\n{\n#ifdef Q_WS_MAEMO_5\n AlbumView *albumView = new AlbumView(gallery);\n connect(albumView, SIGNAL(showSongs(QVariant,QString)),\n this, SLOT(showSongs(QVariant,QString)));\n#endif\n\n showView(albumView, containerId, title);\n}\n\nvoid Browser::showSongs()\n{\n showView(songView, tr(\"Songs\"));\n}\n\nvoid Browser::showSongs(const QVariant &containerId, const QString &title)\n{\n#ifdef Q_WS_MAEMO_5\n SongView *songView = new SongView(gallery);\n#endif\n\n showView(songView, containerId, title);\n}\n\nvoid Browser::showPhotos()\n{\n showView(photoView, tr(\"Photos\"));\n}\n\nvoid Browser::showPhotos(const QVariant &containerId, const QString &title)\n{\n#ifdef Q_WS_MAEMO_5\n PhotoView *photoView = new PhotoView(gallery);\n#endif\n\n showView(photoView, containerId, title);\n}\n\nvoid Browser::showView(GalleryView *view, const QString &title)\n{\n view->showChildren(QVariant());\n\n stack->setCurrentWidget(view);\n\n setWindowTitle(title);\n}\n\nvoid Browser::showView(GalleryView *view, const QVariant &containerId, const QString &title)\n{\n view->showChildren(containerId);\n\n#ifdef Q_WS_MAEMO_5\n QWidget *parent = qobject_cast<QWidget *>(sender());\n if (parent)\n view->setParent(parent->window(), Qt::Window);\n view->setAttribute(Qt::WA_Maemo5StackedWindow);\n view->setAttribute(Qt::WA_DeleteOnClose);\n view->setWindowTitle(title);\n view->show();\n#else\n stack->setCurrentWidget(view);\n\n setWindowTitle(title);\n#endif\n}\n<commit_msg>Don't call showArtists() twice on startup in the media browser.<commit_after>\/****************************************************************************\n**\n** Copyright (C) 2010 Nokia Corporation and\/or its subsidiary(-ies).\n** All rights reserved.\n** Contact: Nokia Corporation (qt-info@nokia.com)\n**\n** This file is part of the Qt Mobility Components.\n**\n** $QT_BEGIN_LICENSE:BSD$\n** You may use this file under the terms of the BSD license as follows:\n**\n** \"Redistribution and use in source and binary forms, with or without\n** modification, are permitted provided that the following conditions are\n** met:\n** * Redistributions of source code must retain the above copyright\n** notice, this list of conditions and the following disclaimer.\n** * Redistributions in binary form must reproduce the above copyright\n** notice, this list of conditions and the following disclaimer in\n** the documentation and\/or other materials provided with the\n** distribution.\n** * Neither the name of Nokia Corporation and its Subsidiary(-ies) nor\n** the names of its contributors may be used to endorse or promote\n** products derived from this software without specific prior written\n** permission.\n**\n** THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS\n** \"AS IS\" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT\n** LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR\n** A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT\n** OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,\n** SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT\n** LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,\n** DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY\n** THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT\n** (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE\n** OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.\"\n** $QT_END_LICENSE$\n**\n****************************************************************************\/\n\n#include \"browser.h\"\n\n#include \"albumview.h\"\n#include \"artistview.h\"\n#include \"photoview.h\"\n#include \"songview.h\"\n\n#include \"qdocumentgallery.h\"\n\n#include <QtGui>\n\nBrowser::Browser(QWidget *parent, Qt::WindowFlags flags)\n : QMainWindow(parent, flags)\n , gallery(0)\n , stack(0)\n , artistView(0)\n , albumArtistView(0)\n , albumView(0)\n , songView(0)\n , photoView(0)\n{\n gallery = new QDocumentGallery;\n\n artistView = new ArtistView(QDocumentGallery::Artist, gallery);\n connect(artistView, SIGNAL(showAlbums(QVariant,QString)),\n this, SLOT(showAlbums(QVariant,QString)));\n connect(artistView, SIGNAL(showSongs(QVariant,QString)),\n this, SLOT(showSongs(QVariant,QString)));\n\n albumArtistView = new ArtistView(QDocumentGallery::AlbumArtist, gallery);\n connect(albumArtistView, SIGNAL(showAlbums(QVariant,QString)),\n this, SLOT(showAlbums(QVariant,QString)));\n connect(albumArtistView, SIGNAL(showSongs(QVariant,QString)),\n this, SLOT(showSongs(QVariant,QString)));\n\n albumView = new AlbumView(gallery);\n connect(albumView, SIGNAL(showSongs(QVariant,QString)),\n this, SLOT(showSongs(QVariant,QString)));\n\n songView = new SongView(gallery);\n\n photoView = new PhotoView(gallery);\n\n stack = new QStackedWidget;\n stack->addWidget(artistView);\n stack->addWidget(albumArtistView);\n stack->addWidget(albumView);\n stack->addWidget(songView);\n stack->addWidget(photoView);\n\n menuBar()->addAction(tr(\"Artists\"), this, SLOT(showArtists()));\n menuBar()->addAction(tr(\"Album Artists\"), this, SLOT(showAlbumArtists()));\n menuBar()->addAction(tr(\"Albums\"), this, SLOT(showAlbums()));\n menuBar()->addAction(tr(\"Songs\"), this, SLOT(showSongs()));\n menuBar()->addAction(tr(\"Photos\"), this, SLOT(showPhotos()));\n\n setCentralWidget(stack);\n\n#ifdef Q_WS_MAEMO_5\n setAttribute(Qt::WA_Maemo5StackedWindow);\n#endif\n}\n\nBrowser::~Browser()\n{\n}\n\nvoid Browser::showArtists()\n{\n showView(artistView, tr(\"Artists\"));\n}\n\nvoid Browser::showArtists(const QVariant &containerId, const QString &title)\n{\n#ifdef Q_WS_MAEMO_5\n ArtistView *artistView = new ArtistView(QDocumentGallery::Artist, gallery);\n connect(artistView, SIGNAL(showAlbums(QVariant,QString)),\n this, SLOT(showAlbums(QVariant,QString)));\n connect(artistView, SIGNAL(showSongs(QVariant,QString)),\n this, SLOT(showSongs(QVariant,QString)));\n#endif\n\n showView(artistView, containerId, title);\n}\n\nvoid Browser::showAlbumArtists()\n{\n showView(albumArtistView, tr(\"Album Artists\"));\n}\n\nvoid Browser::showAlbumArtists(const QVariant &containerId, const QString &title)\n{\n#ifdef Q_WS_MAEMO_5\n ArtistView *albumArtistView = new ArtistView(QDocumentGallery::AlbumArtist, gallery);\n connect(albumArtistView, SIGNAL(showAlbums(QVariant,QString)),\n this, SLOT(showAlbums(QVariant,QString)));\n connect(albumArtistView, SIGNAL(showSongs(QVariant,QString)),\n this, SLOT(showSongs(QVariant,QString)));\n#endif\n\n showView(albumArtistView, containerId, title);\n}\n\nvoid Browser::showAlbums()\n{\n showView(albumView, tr(\"Albums\"));\n}\n\nvoid Browser::showAlbums(const QVariant &containerId, const QString &title)\n{\n#ifdef Q_WS_MAEMO_5\n AlbumView *albumView = new AlbumView(gallery);\n connect(albumView, SIGNAL(showSongs(QVariant,QString)),\n this, SLOT(showSongs(QVariant,QString)));\n#endif\n\n showView(albumView, containerId, title);\n}\n\nvoid Browser::showSongs()\n{\n showView(songView, tr(\"Songs\"));\n}\n\nvoid Browser::showSongs(const QVariant &containerId, const QString &title)\n{\n#ifdef Q_WS_MAEMO_5\n SongView *songView = new SongView(gallery);\n#endif\n\n showView(songView, containerId, title);\n}\n\nvoid Browser::showPhotos()\n{\n showView(photoView, tr(\"Photos\"));\n}\n\nvoid Browser::showPhotos(const QVariant &containerId, const QString &title)\n{\n#ifdef Q_WS_MAEMO_5\n PhotoView *photoView = new PhotoView(gallery);\n#endif\n\n showView(photoView, containerId, title);\n}\n\nvoid Browser::showView(GalleryView *view, const QString &title)\n{\n view->showChildren(QVariant());\n\n stack->setCurrentWidget(view);\n\n setWindowTitle(title);\n}\n\nvoid Browser::showView(GalleryView *view, const QVariant &containerId, const QString &title)\n{\n view->showChildren(containerId);\n\n#ifdef Q_WS_MAEMO_5\n QWidget *parent = qobject_cast<QWidget *>(sender());\n if (parent)\n view->setParent(parent->window(), Qt::Window);\n view->setAttribute(Qt::WA_Maemo5StackedWindow);\n view->setAttribute(Qt::WA_DeleteOnClose);\n view->setWindowTitle(title);\n view->show();\n#else\n stack->setCurrentWidget(view);\n\n setWindowTitle(title);\n#endif\n}\n<|endoftext|>"} {"text":"<commit_before>\/*\n * Copyright 2005 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#include \"vtkMath.h\"\n#include \"vtkMathConfigure.h\"\n\n#include <vtkstd\/limits>\n\n#ifndef ABS\n#define ABS(x) ((x) < 0 ? -(x) : (x))\n#endif\n\ntemplate<class A>\nbool fuzzyCompare(A a, A b)\n{\n return ABS(a - b) < vtkstd::numeric_limits<A>::epsilon();\n}\n\ntemplate<class A>\nbool fuzzyCompare(A a[3], A b[3])\n{\n return fuzzyCompare(a[0], b[0]) &&\n fuzzyCompare(a[1], b[1]) &&\n fuzzyCompare(a[2], b[2]);\n}\n\n\/\/=============================================================================\n\/\/ Helpful class for storing and using color triples.\nclass Triple {\npublic:\n Triple() {};\n Triple(double a, double b, double c) {\n data[0] = a; data[1] = b; data[2] = c;\n }\n const double *operator()() const { return data; }\n double *operator()() { return data; }\n const double &operator[](int i) const { return data[i]; }\n double &operator[](int i) { return data[i]; }\n bool operator==(const Triple &triple) const {\n return *this == triple.data;\n }\n bool operator==(const double *triple) const {\n return ( (this->data[0] - triple[0] <= 0.01*ABS(data[0])+0.02)\n && (this->data[0] - triple[0] >= -0.01*ABS(data[0])-0.02)\n && (this->data[1] - triple[1] <= 0.01*ABS(data[1])+0.02)\n && (this->data[1] - triple[1] >= -0.01*ABS(data[1])-0.02)\n && (this->data[2] - triple[2] <= 0.01*ABS(data[2])+0.02)\n && (this->data[2] - triple[2] >= -0.01*ABS(data[2])-0.02) );\n }\n bool operator!=(const Triple &triple) const {\n return *this != triple.data;\n }\n bool operator!=(const double *triple) const {\n return !(*this == triple);\n }\nprivate:\n double data[3];\n};\n\nstatic ostream &operator<<(ostream &os, const Triple t)\n{\n os << t[0] << \", \" << t[1] << \", \" << t[2];\n return os;\n}\n\n\/\/=============================================================================\n\/\/ Function for comparing colors. Each value should be equivalent in the\n\/\/ respective color space.\nstatic int TestColorConvert(const Triple &rgb, const Triple &hsv,\n const Triple &xyz, const Triple &lab);\n\n\/\/ Function for comparing special doubles like Inf and NaN.\n#define TestSpecialDoubles(value, inftest, nantest) \\\n TestSpecialDoublesReal(value, #value, inftest, nantest)\nstatic int TestSpecialDoublesReal(double value, const char *name,\n bool inftest, bool nantest);\n\nint TestMath(int,char *[])\n{\n int testIntValue;\n \n testIntValue = vtkMath::Factorial(5);\n if ( testIntValue != 120 )\n {\n vtkGenericWarningMacro(\"Factorial(5) = \"<<testIntValue<<\" != 120\");\n return 1;\n }\n\n testIntValue = vtkMath::Binomial(8,3);\n if ( testIntValue != 56 )\n {\n vtkGenericWarningMacro(\"Binomial(8,3) = \"<<testIntValue<<\" != 56\");\n return 1;\n }\n\n testIntValue = vtkMath::Binomial(5,3);\n if ( testIntValue != 10 )\n {\n vtkGenericWarningMacro(\"Binomial(5,3) = \"<<testIntValue<<\" != 10\");\n return 1;\n }\n\n \/\/ Test add, subtract, scalar multiplication.\n double a[3] = {1.0, 2.0, 3.0};\n double b[3] = {0.0, 1.0, 2.0};\n double c[3];\n double ans1[3] = {1.0, 3.0, 5.0};\n double ans2[3] = {1.0, 1.0, 1.0};\n double ans3[3] = {3.0, 6.0, 9.0};\n float af[3] = {1.0f, 2.0f, 3.0f};\n float bf[3] = {0.0f, 1.0f, 2.0f};\n float cf[3];\n float ans1f[3] = {1.0, 3.0, 5.0};\n float ans2f[3] = {1.0, 1.0, 1.0};\n float ans3f[3] = {3.0, 6.0, 9.0};\n\n vtkMath::Add(a, b, c);\n if (!fuzzyCompare(c, ans1))\n {\n vtkGenericWarningMacro(\"Double addition failed.\");\n return 1;\n }\n vtkMath::Subtract(a, b, c);\n if (!fuzzyCompare(c, ans2))\n {\n vtkGenericWarningMacro(\"Double subtraction failed.\");\n return 1;\n }\n vtkMath::MultiplyScalar(a, 3.0);\n if (!fuzzyCompare(a, ans3))\n {\n vtkGenericWarningMacro(\"Double scalar multiplication failed.\");\n return 1;\n }\n vtkMath::Add(af, bf, cf);\n if (!fuzzyCompare(cf, ans1f))\n {\n vtkGenericWarningMacro(\"Float addition failed.\");\n return 1;\n }\n vtkMath::Subtract(af, bf, cf);\n if (!fuzzyCompare(cf, ans2f))\n {\n vtkGenericWarningMacro(\"Float subtraction failed.\");\n return 1;\n }\n vtkMath::MultiplyScalar(af, 3.0f);\n if (!fuzzyCompare(af, ans3f))\n {\n vtkGenericWarningMacro(\"Float scalar multiplication failed.\");\n return 1;\n }\n\n \/\/ Test color conversion.\n int colorsPassed = 1;\n\n colorsPassed &= TestColorConvert(Triple(1.0, 1.0, 1.0), \/\/ RGB\n Triple(0.0, 0.0, 1.0), \/\/ HSV (H ambiguous)\n Triple(0.9505, 1.000, 1.089), \/\/ XYZ\n Triple(100.0, 0.0, 0.0)); \/\/ CIELAB\n\n colorsPassed &= TestColorConvert(Triple(0.5, 0.5, 0.0), \/\/ RGB\n Triple(1.0\/6.0, 1.0, 0.5), \/\/ HSV\n Triple(0.165, 0.199, 0.030), \/\/ XYZ\n Triple(51.7, -12.90, 56.54)); \/\/ CIELAB\n\n colorsPassed &= TestColorConvert(Triple(0.25, 0.25, 0.5), \/\/ RGB\n Triple(2.0\/3.0, 0.5, 0.5), \/\/ HSV\n Triple(0.078, 0.063, 0.211), \/\/ XYZ\n Triple(30.11, 18.49, -36.18)); \/\/ CIELAB\n\n colorsPassed &= TestColorConvert(Triple(0.0, 0.0, 0.0), \/\/ RGB\n Triple(0.0, 0.0, 0.0), \/\/ HSV (H&S ambiguous)\n Triple(0.0, 0.0, 0.0), \/\/ XYZ\n Triple(0.0, 0.0, 0.0)); \/\/ CIELAB\n \n if (!colorsPassed)\n {\n return 1;\n }\n\n if (!TestSpecialDoubles(0, false, false)) return 1;\n if (!TestSpecialDoubles(5, false, false)) return 1;\n if (!TestSpecialDoubles(vtkMath::Inf(), true, false)) return 1;\n if (!TestSpecialDoubles(vtkMath::NegInf(), true, false)) return 1;\n if (!TestSpecialDoubles(vtkMath::Nan(), false, true)) return 1;\n\n if (!(0 < vtkMath::Inf()))\n {\n vtkGenericWarningMacro(<< \"Odd comparison for infinity.\");\n return 1;\n }\n if (!(0 > vtkMath::NegInf()))\n {\n vtkGenericWarningMacro(<< \"Odd comparison for negitive infinity.\");\n return 1;\n }\n\n return 0;\n}\n\nstatic int TestColorConvert(const Triple &rgb, const Triple &hsv,\n const Triple &xyz, const Triple &lab)\n{\n cout << \"Ensuring the following colors are consistent: \" << endl;\n cout << \" RGB: \" << rgb << endl;\n cout << \" HSV: \" << hsv << endl;\n cout << \" CIE XYZ: \" << xyz << endl;\n cout << \" CIE-L*ab: \" << lab << endl;\n\n Triple result1;\n double *result2;\n\n#define COMPARE(testname, target, dest) \\\n if (target != dest) \\\n { \\\n vtkGenericWarningMacro(<< \"Incorrect \" #testname \" conversion. Got \" \\\n << dest << \" expected \" << target); \\\n return 0; \\\n }\n\n \/\/ Test conversion between RGB and HSV.\n vtkMath::RGBToHSV(rgb(), result1());\n COMPARE(RGBToHSV, hsv, result1);\n vtkMath::HSVToRGB(hsv(), result1());\n COMPARE(HSVToRGB, rgb, result1);\n\n result2 = vtkMath::RGBToHSV(rgb());\n COMPARE(RGBToHSV, hsv, result2);\n result2 = vtkMath::HSVToRGB(hsv());\n COMPARE(HSVToRGB, rgb, result2);\n\n vtkMath::RGBToHSV(rgb[0], rgb[1], rgb[2],\n &result1[0], &result1[1], &result1[2]);\n COMPARE(RGBToHSV, hsv, result1);\n vtkMath::HSVToRGB(hsv[0], hsv[1], hsv[2],\n &result1[0], &result1[1], &result1[2]);\n COMPARE(HSVToRGB, rgb, result1);\n\n \/\/ Test conversion between RGB and XYZ.\n vtkMath::RGBToXYZ(rgb(), result1());\n COMPARE(RGBToXYZ, xyz, result1);\n vtkMath::XYZToRGB(xyz(), result1());\n COMPARE(XYZToRGB, rgb, result1);\n\n result2 = vtkMath::RGBToXYZ(rgb());\n COMPARE(RGBToXYZ, xyz, result2);\n result2 = vtkMath::XYZToRGB(xyz());\n COMPARE(XYZToRGB, rgb, result2);\n\n vtkMath::RGBToXYZ(rgb[0], rgb[1], rgb[2],\n &result1[0], &result1[1], &result1[2]);\n COMPARE(RGBToXYZ, xyz, result1);\n vtkMath::XYZToRGB(xyz[0], xyz[1], xyz[2],\n &result1[0], &result1[1], &result1[2]);\n COMPARE(XYZToRGB, rgb, result1);\n\n \/\/ Test conversion between Lab and XYZ.\n vtkMath::LabToXYZ(lab(), result1());\n COMPARE(LabToXYZ, xyz, result1);\n vtkMath::XYZToLab(xyz(), result1());\n COMPARE(XYZToLab, lab, result1);\n\n result2 = vtkMath::LabToXYZ(lab());\n COMPARE(LabToXYZ, xyz, result2);\n result2 = vtkMath::XYZToLab(xyz());\n COMPARE(XYZToLab, lab, result2);\n\n vtkMath::LabToXYZ(lab[0], lab[1], lab[2],\n &result1[0], &result1[1], &result1[2]);\n COMPARE(LabToXYZ, xyz, result1);\n vtkMath::XYZToLab(xyz[0], xyz[1], xyz[2],\n &result1[0], &result1[1], &result1[2]);\n COMPARE(XYZToLab, lab, result1);\n\n \/\/ Test conversion between Lab and RGB.\n vtkMath::LabToRGB(lab(), result1());\n COMPARE(LabToRGB, rgb, result1);\n vtkMath::RGBToLab(rgb(), result1());\n COMPARE(RGBToLab, lab, result1);\n\n result2 = vtkMath::LabToRGB(lab());\n COMPARE(LabToRGB, rgb, result2);\n result2 = vtkMath::RGBToLab(rgb());\n COMPARE(RGBToLab, lab, result2);\n\n vtkMath::LabToRGB(lab[0], lab[1], lab[2],\n &result1[0], &result1[1], &result1[2]);\n COMPARE(LabToRGB, rgb, result1);\n vtkMath::RGBToLab(rgb[0], rgb[1], rgb[2],\n &result1[0], &result1[1], &result1[2]);\n COMPARE(RGBToLab, lab, result1);\n\n return 1;\n}\n\nstatic int TestSpecialDoublesReal(double value, const char *name,\n bool inftest, bool nantest)\n{\n cout << \"Testing comparison of \" << name << \" to non-finite values.\" << endl;\n cout << \" * IsNan test.\" << endl;\n if (vtkMath::IsNan(value) != static_cast<int>(nantest))\n {\n cout << value << \" failed the IsNan test.\" << endl;\n return 0;\n }\n cout << \" * IsInf test.\" << endl;\n if (vtkMath::IsInf(value) != static_cast<int>(inftest))\n {\n cout << value << \" failed the IsInf test.\" << endl;\n return 0;\n }\n cout << \" * Tests passed.\" << endl;\n\n return 1;\n}\n<commit_msg>BUG: Print out subtraction result so we can see what the error is.<commit_after>\/*\n * Copyright 2005 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#include \"vtkMath.h\"\n#include \"vtkMathConfigure.h\"\n\n#include <vtkstd\/limits>\n\n#ifndef ABS\n#define ABS(x) ((x) < 0 ? -(x) : (x))\n#endif\n\ntemplate<class A>\nbool fuzzyCompare(A a, A b)\n{\n return ABS(a - b) < vtkstd::numeric_limits<A>::epsilon();\n}\n\ntemplate<class A>\nbool fuzzyCompare(A a[3], A b[3])\n{\n return fuzzyCompare(a[0], b[0]) &&\n fuzzyCompare(a[1], b[1]) &&\n fuzzyCompare(a[2], b[2]);\n}\n\n\/\/=============================================================================\n\/\/ Helpful class for storing and using color triples.\nclass Triple {\npublic:\n Triple() {};\n Triple(double a, double b, double c) {\n data[0] = a; data[1] = b; data[2] = c;\n }\n const double *operator()() const { return data; }\n double *operator()() { return data; }\n const double &operator[](int i) const { return data[i]; }\n double &operator[](int i) { return data[i]; }\n bool operator==(const Triple &triple) const {\n return *this == triple.data;\n }\n bool operator==(const double *triple) const {\n return ( (this->data[0] - triple[0] <= 0.01*ABS(data[0])+0.02)\n && (this->data[0] - triple[0] >= -0.01*ABS(data[0])-0.02)\n && (this->data[1] - triple[1] <= 0.01*ABS(data[1])+0.02)\n && (this->data[1] - triple[1] >= -0.01*ABS(data[1])-0.02)\n && (this->data[2] - triple[2] <= 0.01*ABS(data[2])+0.02)\n && (this->data[2] - triple[2] >= -0.01*ABS(data[2])-0.02) );\n }\n bool operator!=(const Triple &triple) const {\n return *this != triple.data;\n }\n bool operator!=(const double *triple) const {\n return !(*this == triple);\n }\nprivate:\n double data[3];\n};\n\nstatic ostream &operator<<(ostream &os, const Triple t)\n{\n os << t[0] << \", \" << t[1] << \", \" << t[2];\n return os;\n}\n\n\/\/=============================================================================\n\/\/ Function for comparing colors. Each value should be equivalent in the\n\/\/ respective color space.\nstatic int TestColorConvert(const Triple &rgb, const Triple &hsv,\n const Triple &xyz, const Triple &lab);\n\n\/\/ Function for comparing special doubles like Inf and NaN.\n#define TestSpecialDoubles(value, inftest, nantest) \\\n TestSpecialDoublesReal(value, #value, inftest, nantest)\nstatic int TestSpecialDoublesReal(double value, const char *name,\n bool inftest, bool nantest);\n\nint TestMath(int,char *[])\n{\n int testIntValue;\n \n testIntValue = vtkMath::Factorial(5);\n if ( testIntValue != 120 )\n {\n vtkGenericWarningMacro(\"Factorial(5) = \"<<testIntValue<<\" != 120\");\n return 1;\n }\n\n testIntValue = vtkMath::Binomial(8,3);\n if ( testIntValue != 56 )\n {\n vtkGenericWarningMacro(\"Binomial(8,3) = \"<<testIntValue<<\" != 56\");\n return 1;\n }\n\n testIntValue = vtkMath::Binomial(5,3);\n if ( testIntValue != 10 )\n {\n vtkGenericWarningMacro(\"Binomial(5,3) = \"<<testIntValue<<\" != 10\");\n return 1;\n }\n\n \/\/ Test add, subtract, scalar multiplication.\n double a[3] = {1.0, 2.0, 3.0};\n double b[3] = {0.0, 1.0, 2.0};\n double c[3];\n double ans1[3] = {1.0, 3.0, 5.0};\n double ans2[3] = {1.0, 1.0, 1.0};\n double ans3[3] = {3.0, 6.0, 9.0};\n float af[3] = {1.0f, 2.0f, 3.0f};\n float bf[3] = {0.0f, 1.0f, 2.0f};\n float cf[3];\n float ans1f[3] = {1.0, 3.0, 5.0};\n float ans2f[3] = {1.0, 1.0, 1.0};\n float ans3f[3] = {3.0, 6.0, 9.0};\n\n vtkMath::Add(a, b, c);\n if (!fuzzyCompare(c, ans1))\n {\n vtkGenericWarningMacro(\"Double addition failed.\");\n return 1;\n }\n vtkMath::Subtract(a, b, c);\n if (!fuzzyCompare(c, ans2))\n {\n vtkGenericWarningMacro(\"Double subtraction failed.\");\n return 1;\n }\n vtkMath::MultiplyScalar(a, 3.0);\n if (!fuzzyCompare(a, ans3))\n {\n vtkGenericWarningMacro(\"Double scalar multiplication failed.\");\n return 1;\n }\n vtkMath::Add(af, bf, cf);\n if (!fuzzyCompare(cf, ans1f))\n {\n vtkGenericWarningMacro(\"Float addition failed.\");\n\tcout << \"Result: { \" << cf[0] << \", \" << cf[1] << \", \" << cf[2] << \" }\" << endl;\n return 1;\n }\n vtkMath::Subtract(af, bf, cf);\n if (!fuzzyCompare(cf, ans2f))\n {\n vtkGenericWarningMacro(\"Float subtraction failed.\");\n return 1;\n }\n vtkMath::MultiplyScalar(af, 3.0f);\n if (!fuzzyCompare(af, ans3f))\n {\n vtkGenericWarningMacro(\"Float scalar multiplication failed.\");\n return 1;\n }\n\n \/\/ Test color conversion.\n int colorsPassed = 1;\n\n colorsPassed &= TestColorConvert(Triple(1.0, 1.0, 1.0), \/\/ RGB\n Triple(0.0, 0.0, 1.0), \/\/ HSV (H ambiguous)\n Triple(0.9505, 1.000, 1.089), \/\/ XYZ\n Triple(100.0, 0.0, 0.0)); \/\/ CIELAB\n\n colorsPassed &= TestColorConvert(Triple(0.5, 0.5, 0.0), \/\/ RGB\n Triple(1.0\/6.0, 1.0, 0.5), \/\/ HSV\n Triple(0.165, 0.199, 0.030), \/\/ XYZ\n Triple(51.7, -12.90, 56.54)); \/\/ CIELAB\n\n colorsPassed &= TestColorConvert(Triple(0.25, 0.25, 0.5), \/\/ RGB\n Triple(2.0\/3.0, 0.5, 0.5), \/\/ HSV\n Triple(0.078, 0.063, 0.211), \/\/ XYZ\n Triple(30.11, 18.49, -36.18)); \/\/ CIELAB\n\n colorsPassed &= TestColorConvert(Triple(0.0, 0.0, 0.0), \/\/ RGB\n Triple(0.0, 0.0, 0.0), \/\/ HSV (H&S ambiguous)\n Triple(0.0, 0.0, 0.0), \/\/ XYZ\n Triple(0.0, 0.0, 0.0)); \/\/ CIELAB\n \n if (!colorsPassed)\n {\n return 1;\n }\n\n if (!TestSpecialDoubles(0, false, false)) return 1;\n if (!TestSpecialDoubles(5, false, false)) return 1;\n if (!TestSpecialDoubles(vtkMath::Inf(), true, false)) return 1;\n if (!TestSpecialDoubles(vtkMath::NegInf(), true, false)) return 1;\n if (!TestSpecialDoubles(vtkMath::Nan(), false, true)) return 1;\n\n if (!(0 < vtkMath::Inf()))\n {\n vtkGenericWarningMacro(<< \"Odd comparison for infinity.\");\n return 1;\n }\n if (!(0 > vtkMath::NegInf()))\n {\n vtkGenericWarningMacro(<< \"Odd comparison for negitive infinity.\");\n return 1;\n }\n\n return 0;\n}\n\nstatic int TestColorConvert(const Triple &rgb, const Triple &hsv,\n const Triple &xyz, const Triple &lab)\n{\n cout << \"Ensuring the following colors are consistent: \" << endl;\n cout << \" RGB: \" << rgb << endl;\n cout << \" HSV: \" << hsv << endl;\n cout << \" CIE XYZ: \" << xyz << endl;\n cout << \" CIE-L*ab: \" << lab << endl;\n\n Triple result1;\n double *result2;\n\n#define COMPARE(testname, target, dest) \\\n if (target != dest) \\\n { \\\n vtkGenericWarningMacro(<< \"Incorrect \" #testname \" conversion. Got \" \\\n << dest << \" expected \" << target); \\\n return 0; \\\n }\n\n \/\/ Test conversion between RGB and HSV.\n vtkMath::RGBToHSV(rgb(), result1());\n COMPARE(RGBToHSV, hsv, result1);\n vtkMath::HSVToRGB(hsv(), result1());\n COMPARE(HSVToRGB, rgb, result1);\n\n result2 = vtkMath::RGBToHSV(rgb());\n COMPARE(RGBToHSV, hsv, result2);\n result2 = vtkMath::HSVToRGB(hsv());\n COMPARE(HSVToRGB, rgb, result2);\n\n vtkMath::RGBToHSV(rgb[0], rgb[1], rgb[2],\n &result1[0], &result1[1], &result1[2]);\n COMPARE(RGBToHSV, hsv, result1);\n vtkMath::HSVToRGB(hsv[0], hsv[1], hsv[2],\n &result1[0], &result1[1], &result1[2]);\n COMPARE(HSVToRGB, rgb, result1);\n\n \/\/ Test conversion between RGB and XYZ.\n vtkMath::RGBToXYZ(rgb(), result1());\n COMPARE(RGBToXYZ, xyz, result1);\n vtkMath::XYZToRGB(xyz(), result1());\n COMPARE(XYZToRGB, rgb, result1);\n\n result2 = vtkMath::RGBToXYZ(rgb());\n COMPARE(RGBToXYZ, xyz, result2);\n result2 = vtkMath::XYZToRGB(xyz());\n COMPARE(XYZToRGB, rgb, result2);\n\n vtkMath::RGBToXYZ(rgb[0], rgb[1], rgb[2],\n &result1[0], &result1[1], &result1[2]);\n COMPARE(RGBToXYZ, xyz, result1);\n vtkMath::XYZToRGB(xyz[0], xyz[1], xyz[2],\n &result1[0], &result1[1], &result1[2]);\n COMPARE(XYZToRGB, rgb, result1);\n\n \/\/ Test conversion between Lab and XYZ.\n vtkMath::LabToXYZ(lab(), result1());\n COMPARE(LabToXYZ, xyz, result1);\n vtkMath::XYZToLab(xyz(), result1());\n COMPARE(XYZToLab, lab, result1);\n\n result2 = vtkMath::LabToXYZ(lab());\n COMPARE(LabToXYZ, xyz, result2);\n result2 = vtkMath::XYZToLab(xyz());\n COMPARE(XYZToLab, lab, result2);\n\n vtkMath::LabToXYZ(lab[0], lab[1], lab[2],\n &result1[0], &result1[1], &result1[2]);\n COMPARE(LabToXYZ, xyz, result1);\n vtkMath::XYZToLab(xyz[0], xyz[1], xyz[2],\n &result1[0], &result1[1], &result1[2]);\n COMPARE(XYZToLab, lab, result1);\n\n \/\/ Test conversion between Lab and RGB.\n vtkMath::LabToRGB(lab(), result1());\n COMPARE(LabToRGB, rgb, result1);\n vtkMath::RGBToLab(rgb(), result1());\n COMPARE(RGBToLab, lab, result1);\n\n result2 = vtkMath::LabToRGB(lab());\n COMPARE(LabToRGB, rgb, result2);\n result2 = vtkMath::RGBToLab(rgb());\n COMPARE(RGBToLab, lab, result2);\n\n vtkMath::LabToRGB(lab[0], lab[1], lab[2],\n &result1[0], &result1[1], &result1[2]);\n COMPARE(LabToRGB, rgb, result1);\n vtkMath::RGBToLab(rgb[0], rgb[1], rgb[2],\n &result1[0], &result1[1], &result1[2]);\n COMPARE(RGBToLab, lab, result1);\n\n return 1;\n}\n\nstatic int TestSpecialDoublesReal(double value, const char *name,\n bool inftest, bool nantest)\n{\n cout << \"Testing comparison of \" << name << \" to non-finite values.\" << endl;\n cout << \" * IsNan test.\" << endl;\n if (vtkMath::IsNan(value) != static_cast<int>(nantest))\n {\n cout << value << \" failed the IsNan test.\" << endl;\n return 0;\n }\n cout << \" * IsInf test.\" << endl;\n if (vtkMath::IsInf(value) != static_cast<int>(inftest))\n {\n cout << value << \" failed the IsInf test.\" << endl;\n return 0;\n }\n cout << \" * Tests passed.\" << endl;\n\n return 1;\n}\n<|endoftext|>"} {"text":"<commit_before>\/\/ vim:filetype=cpp:textwidth=120:shiftwidth=2:softtabstop=2:expandtab\n\/\/ Copyright 2014 Christoph Schwering\n\n#include <gtest\/gtest.h>\n\n#include <iostream>\n\n#include <limbo\/formula.h>\n\nnamespace limbo {\n\nusing Sort = Language::Sort;\nusing Var = Language::Var;\nusing Name = Language::Name;\nusing Func = Language::Func;\nusing Symbol = Language::Symbol;\nusing Word = Language::Word;\n\nstd::ostream& operator<<(std::ostream& os, const Symbol& s) {\n switch (s.type) {\n case Symbol::kFunc: os << 'f' << s.u.f.index(); break;\n case Symbol::kName: os << 'n' << s.u.n.index(); break;\n case Symbol::kVar: os << 'x' << s.u.x.index(); break;\n case Symbol::kTerm: os << 't'; break;\n case Symbol::kEquals: os << \"\\u003D\"; break;\n case Symbol::kNotEquals: os << \"\\u2260\"; break;\n case Symbol::kLiteral: os << 'l'; break;\n case Symbol::kClause: os << 'c'; break;\n case Symbol::kNot: os << \"\\u2227 \"; break;\n case Symbol::kExists: os << \"\\u2203 x\" << s.u.x.index(); break;\n case Symbol::kForall: os << \"\\u2200 x\" << s.u.x.index(); break;\n case Symbol::kOr: os << \"\\u2228\"; break;\n case Symbol::kAnd: os << \"\\u2227\"; break;\n case Symbol::kKnow: os << \"know_\" << s.u.k; break;\n case Symbol::kMaybe: os << \"maybe_\" << s.u.k; break;\n case Symbol::kBelieve: os << \"bel_\" << s.u.k << ',' << s.u.l; break;\n case Symbol::kAction: os << \"A \"; break;\n }\n return os;\n}\n\nstd::ostream& operator<<(std::ostream& os, const Word& w) {\n for (const Symbol& s : w) {\n os << s << ' ';\n }\n return os;\n}\n\nstd::ostream& operator<<(std::ostream& os, const Formula::Reader& r) {\n switch (r.type()) {\n case Symbol::kFunc:\n case Symbol::kVar:\n case Symbol::kName: {\n os << r.head();\n for (int i = 0; i < r.arity(); ++i) {\n if (i == 0) {\n os << '(';\n }\n os << r.arg(i);\n if (i+1 < r.arity()) {\n os << ',';\n } else {\n os << ')';\n }\n }\n break;\n }\n case Symbol::kEquals:\n case Symbol::kNotEquals: {\n os << r.arg(0) << ' ' << r.head() << ' ' << r.arg(1);\n break;\n }\n case Symbol::kTerm:\n case Symbol::kLiteral:\n case Symbol::kClause:\n os << r.head();\n break;\n case Symbol::kNot:\n case Symbol::kExists:\n case Symbol::kForall:\n case Symbol::kKnow:\n case Symbol::kMaybe:\n os << r.head() << ' ' << r.arg(0);\n break;\n case Symbol::kBelieve:\n os << r.head() << ' ' << r.arg(0) << \" \\u27FE \" << r.arg(1);\n break;\n case Symbol::kOr:\n case Symbol::kAnd:\n os << (r.type() == Symbol::kOr ? '[' : '(');\n for (int i = 0; i < r.arity(); ++i) {\n os << r.arg(i);\n if (i+1 < r.arity()) {\n os << ' ' << r.head() << ' ';\n }\n }\n os << (r.type() == Symbol::kOr ? ']' : ')');\n break;\n case Symbol::kAction:\n os << '[' << r.arg(0) << ']' << ' ' << r.arg(1);\n break;\n }\n return os;\n}\n\nstd::ostream& operator<<(std::ostream& os, const Formula& f) {\n os << f.reader();\n return os;\n}\n\nTEST(FormulaTest, Rectify) {\n Language* l = Language::Instance();\n Sort s = l->CreateSort(false);\n Var x = l->CreateVar(s);\n Var y = l->CreateVar(s);\n Var z = l->CreateVar(s);\n Var u = l->CreateVar(s);\n Name n = l->CreateName(s, 0);\n Func c = l->CreateFunc(s, 0);\n Func f = l->CreateFunc(s, 2);\n Func g = l->CreateFunc(s, 1);\n Word fxy = Word::Func(f, std::vector<Word>{Word::Var(x), Word::Var(y)});\n Word fyz = Word::Func(f, std::vector<Word>{Word::Var(y), Word::Var(z)});\n Word gfxy = Word::Func(g, std::vector<Word>{fxy});\n Word gfyz = Word::Func(g, std::vector<Word>{fyz});\n Word w = Word::Exists(x, Word::Or(Word::Forall(y, Word::Exists(z, Word::Equals(fxy.Clone(), fyz.Clone()))),\n Word::Exists(x, Word::Forall(y, Word::Exists(z, Word::Exists(u, Word::Equals(gfxy.Clone(), gfyz.Clone())))))));\n\n \/\/ Skolemize\n \/\/ Swearize\n \/\/ Rectify\n \/\/ Flatten\n \/\/ PushInwards\n\n {\n std::cout << \"\" << std::endl;\n Formula phi(Word::Exists(x, Word::Equals(Word::Func(c, std::vector<Word>{}), Word::Name(n, std::vector<Word>{}))));\n std::cout << \"Orig: \" << phi << std::endl;\n phi.Rectify();\n std::cout << \"Rect: \" << phi << std::endl;\n phi.Skolemize();\n std::cout << \"Skol: \" << phi << std::endl;\n phi.PushInwards();\n std::cout << \"Push: \" << phi << std::endl;\n }\n\n {\n std::cout << \"\" << std::endl;\n Formula phi(w.Clone());\n std::cout << \"Orig: \" << phi << std::endl;\n phi.Rectify();\n std::cout << \"Rect: \" << phi << std::endl;\n phi.Flatten();\n std::cout << \"Flat: \" << phi << std::endl;\n phi.PushInwards();\n std::cout << \"Push: \" << phi << std::endl;\n }\n}\n\n} \/\/ namespace limbo\n\n<commit_msg>Formula reorganisation.<commit_after>\/\/ vim:filetype=cpp:textwidth=120:shiftwidth=2:softtabstop=2:expandtab\n\/\/ Copyright 2014 Christoph Schwering\n\n#include <gtest\/gtest.h>\n\n#include <iostream>\n\n#include <limbo\/formula.h>\n\nnamespace limbo {\n\nusing Abc = Alphabet;\nusing Symbol = Abc::Symbol;\nusing Word = Abc::Word;\nusing F = Formula;\n\nstd::ostream& operator<<(std::ostream& os, const Symbol& s) {\n switch (s.tag) {\n case Symbol::kFunc: os << 'f' << s.u.f.index(); break;\n case Symbol::kName: os << 'n' << s.u.n.index(); break;\n case Symbol::kVar: os << 'x' << s.u.x.index(); break;\n case Symbol::kTerm: os << 't'; break;\n case Symbol::kEquals: os << \"\\u003D\"; break;\n case Symbol::kNotEquals: os << \"\\u2260\"; break;\n case Symbol::kLiteral: os << 'l'; break;\n case Symbol::kClause: os << 'c'; break;\n case Symbol::kNot: os << \"\\u2227 \"; break;\n case Symbol::kExists: os << \"\\u2203 x\" << s.u.x.index(); break;\n case Symbol::kForall: os << \"\\u2200 x\" << s.u.x.index(); break;\n case Symbol::kOr: os << \"\\u2228\"; break;\n case Symbol::kAnd: os << \"\\u2227\"; break;\n case Symbol::kKnow: os << \"know_\" << s.u.k; break;\n case Symbol::kMaybe: os << \"maybe_\" << s.u.k; break;\n case Symbol::kBelieve: os << \"bel_\" << s.u.k << ',' << s.u.l; break;\n case Symbol::kAction: os << \"A \"; break;\n }\n return os;\n}\n\nstd::ostream& operator<<(std::ostream& os, const Word& w) {\n for (const Symbol& s : w) {\n os << s << ' ';\n }\n return os;\n}\n\nstd::ostream& operator<<(std::ostream& os, const RFormula& r) {\n switch (r.tag()) {\n case Symbol::kFunc:\n case Symbol::kVar:\n case Symbol::kName: {\n os << r.head();\n for (int i = 0; i < r.arity(); ++i) {\n if (i == 0) {\n os << '(';\n }\n os << r.arg(i);\n if (i+1 < r.arity()) {\n os << ',';\n } else {\n os << ')';\n }\n }\n break;\n }\n case Symbol::kEquals:\n case Symbol::kNotEquals: {\n os << r.arg(0) << ' ' << r.head() << ' ' << r.arg(1);\n break;\n }\n case Symbol::kTerm:\n case Symbol::kLiteral:\n case Symbol::kClause:\n os << r.head();\n break;\n case Symbol::kNot:\n case Symbol::kExists:\n case Symbol::kForall:\n case Symbol::kKnow:\n case Symbol::kMaybe:\n os << r.head() << ' ' << r.arg(0);\n break;\n case Symbol::kBelieve:\n os << r.head() << ' ' << r.arg(0) << \" \\u27FE \" << r.arg(1);\n break;\n case Symbol::kOr:\n case Symbol::kAnd:\n os << (r.tag() == Symbol::kOr ? '[' : '(');\n for (int i = 0; i < r.arity(); ++i) {\n os << r.arg(i);\n if (i+1 < r.arity()) {\n os << ' ' << r.head() << ' ';\n }\n }\n os << (r.tag() == Symbol::kOr ? ']' : ')');\n break;\n case Symbol::kAction:\n os << '[' << r.arg(0) << ']' << ' ' << r.arg(1);\n break;\n }\n return os;\n}\n\nstd::ostream& operator<<(std::ostream& os, const F& f) {\n os << f.readable();\n return os;\n}\n\nTEST(FormulaTest, Rectify) {\n Alphabet* abc = Alphabet::Instance();\n Abc::Sort s = abc->CreateSort(false);\n Abc::Var x = abc->CreateVar(s);\n Abc::Var y = abc->CreateVar(s);\n Abc::Var z = abc->CreateVar(s);\n Abc::Var u = abc->CreateVar(s);\n Abc::Name n = abc->CreateName(s, 0);\n Abc::Func c = abc->CreateFunc(s, 0);\n Abc::Func f = abc->CreateFunc(s, 2);\n Abc::Func g = abc->CreateFunc(s, 1);\n F fxy = F::Func(f, std::vector<F>{F::Var(x), F::Var(y)});\n F fyz = F::Func(f, std::vector<F>{F::Var(y), F::Var(z)});\n F gfxy = F::Func(g, std::vector<F>{fxy});\n F gfyz = F::Func(g, std::vector<F>{fyz});\n F w = F::Exists(x, F::Or(F::Forall(y, F::Exists(z, F::Equals(fxy, fyz))),\n F::Exists(x, F::Forall(y, F::Exists(z, F::Exists(u, F::Equals(gfxy, gfyz)))))));\n\n \/\/ Skolemize\n \/\/ Swearize\n \/\/ Rectify\n \/\/ Flatten\n \/\/ PushInwards\n\n {\n std::cout << \"\" << std::endl;\n F phi(F::Exists(x, F::Equals(F::Func(c, std::vector<F>{}), F::Name(n, std::vector<F>{}))));\n std::cout << \"Orig: \" << phi << std::endl;\n phi.Rectify();\n std::cout << \"Rect: \" << phi << std::endl;\n phi.Skolemize();\n std::cout << \"Skol: \" << phi << std::endl;\n phi.PushInwards();\n std::cout << \"Push: \" << phi << std::endl;\n }\n\n {\n std::cout << \"\" << std::endl;\n F phi(w);\n std::cout << \"Orig: \" << phi << std::endl;\n phi.Rectify();\n std::cout << \"Rect: \" << phi << std::endl;\n phi.Flatten();\n std::cout << \"Flat: \" << phi << std::endl;\n phi.PushInwards();\n std::cout << \"Push: \" << phi << std::endl;\n }\n}\n\n} \/\/ namespace limbo\n\n<|endoftext|>"} {"text":"<commit_before>\/**\n * Copyright (c) 2014-present, Facebook, Inc.\n * All rights reserved.\n *\n * This source code is licensed in accordance with the terms specified in\n * the LICENSE file found in the root directory of this source tree.\n *\/\n\n#include <set>\n\n#include <osquery\/config\/config.h>\n#include <osquery\/database.h>\n#include <osquery\/logger.h>\n#include <osquery\/registry_factory.h>\n#include <osquery\/sql.h>\n\nnamespace osquery {\n\n\/**\n * @brief A simple ConfigParserPlugin for a \"views\" dictionary key.\n *\/\nclass ViewsConfigParserPlugin : public ConfigParserPlugin {\n public:\n std::vector<std::string> keys() const override {\n return {\"views\"};\n }\n\n Status update(const std::string& source, const ParserConfig& config) override;\n\n private:\n const std::string kConfigViews = \"config_views.\";\n};\n\nStatus ViewsConfigParserPlugin::update(const std::string& source,\n const ParserConfig& config) {\n auto cv = config.find(\"views\");\n if (cv == config.end()) {\n return Status(1);\n }\n\n auto obj = data_.getObject();\n data_.copyFrom(cv->second.doc(), obj);\n data_.add(\"views\", obj);\n\n const auto& views = data_.doc()[\"views\"];\n\n \/\/ We use a restricted scope below to change the data structure from\n \/\/ an array to a set. This lets us do deletes much more efficiently\n std::vector<std::string> created_views;\n std::set<std::string> erase_views;\n {\n std::vector<std::string> old_views_vec;\n scanDatabaseKeys(kQueries, old_views_vec, kConfigViews);\n for (const auto& view : old_views_vec) {\n erase_views.insert(view.substr(kConfigViews.size()));\n }\n }\n\n QueryData r;\n if (views.IsObject()) {\n for (const auto& view : views.GetObject()) {\n std::string name = view.name.GetString();\n if (!view.value.IsString()) {\n continue;\n }\n std::string query = view.value.GetString();\n if (query.empty()) {\n continue;\n }\n\n std::string old_query = \"\";\n getDatabaseValue(kQueries, kConfigViews + name, old_query);\n erase_views.erase(name);\n if (old_query == query) {\n continue;\n }\n\n \/\/ View has been updated\n osquery::query(\"DROP VIEW \" + name, r);\n auto s = osquery::query(\"CREATE VIEW \" + name + \" AS \" + query, r);\n if (s.ok()) {\n setDatabaseValue(kQueries, kConfigViews + name, query);\n } else {\n LOG(INFO) << \"Error creating view (\" << name << \"): \" << s.getMessage();\n }\n }\n }\n\n \/\/ Any views left are views that don't exist in the new configuration file\n \/\/ so we tear them down and remove them from the database.\n for (const auto& old_view : erase_views) {\n osquery::query(\"DROP VIEW \" + old_view, r);\n deleteDatabaseValue(kQueries, kConfigViews + old_view);\n }\n return Status(0, \"OK\");\n}\n\nREGISTER_INTERNAL(ViewsConfigParserPlugin, \"config_parser\", \"views\");\n}\n<commit_msg>Ensure views are recreated on startup. (#5732)<commit_after>\/**\n * Copyright (c) 2014-present, Facebook, Inc.\n * All rights reserved.\n *\n * This source code is licensed in accordance with the terms specified in\n * the LICENSE file found in the root directory of this source tree.\n *\/\n\n#include <set>\n\n#include <osquery\/config\/config.h>\n#include <osquery\/database.h>\n#include <osquery\/logger.h>\n#include <osquery\/registry_factory.h>\n#include <osquery\/sql.h>\n\nnamespace osquery {\n\n\/**\n * @brief A simple ConfigParserPlugin for a \"views\" dictionary key.\n *\/\nclass ViewsConfigParserPlugin : public ConfigParserPlugin {\n public:\n std::vector<std::string> keys() const override {\n return {\"views\"};\n }\n\n Status update(const std::string& source, const ParserConfig& config) override;\n\n private:\n const std::string kConfigViews = \"config_views.\";\n std::atomic<bool> first_time_{true};\n};\n\nStatus ViewsConfigParserPlugin::update(const std::string& source,\n const ParserConfig& config) {\n auto cv = config.find(\"views\");\n if (cv == config.end()) {\n return Status(1);\n }\n\n auto obj = data_.getObject();\n data_.copyFrom(cv->second.doc(), obj);\n data_.add(\"views\", obj);\n\n const auto& views = data_.doc()[\"views\"];\n\n \/\/ We use a restricted scope below to change the data structure from\n \/\/ an array to a set. This lets us do deletes much more efficiently\n std::vector<std::string> created_views;\n std::set<std::string> erase_views;\n {\n std::vector<std::string> old_views_vec;\n scanDatabaseKeys(kQueries, old_views_vec, kConfigViews);\n for (const auto& view : old_views_vec) {\n erase_views.insert(view.substr(kConfigViews.size()));\n }\n }\n\n QueryData r;\n if (views.IsObject()) {\n for (const auto& view : views.GetObject()) {\n std::string name = view.name.GetString();\n if (!view.value.IsString()) {\n continue;\n }\n std::string query = view.value.GetString();\n if (query.empty()) {\n continue;\n }\n\n std::string old_query = \"\";\n getDatabaseValue(kQueries, kConfigViews + name, old_query);\n erase_views.erase(name);\n\n \/\/ If query exists in the store, view would already have been\n \/\/ created and we don't need to create it. Except, at startup,\n \/\/ the view always needs to be created.\n if (!first_time_ && old_query == query) {\n continue;\n }\n\n \/\/ View has been updated\n osquery::query(\"DROP VIEW \" + name, r);\n auto s = osquery::query(\"CREATE VIEW \" + name + \" AS \" + query, r);\n if (s.ok()) {\n setDatabaseValue(kQueries, kConfigViews + name, query);\n } else {\n LOG(INFO) << \"Error creating view (\" << name << \"): \" << s.getMessage();\n }\n }\n }\n\n \/\/ Any views left are views that don't exist in the new configuration file\n \/\/ so we tear them down and remove them from the database.\n for (const auto& old_view : erase_views) {\n osquery::query(\"DROP VIEW \" + old_view, r);\n deleteDatabaseValue(kQueries, kConfigViews + old_view);\n }\n\n first_time_ = false;\n return Status(0, \"OK\");\n}\n\nREGISTER_INTERNAL(ViewsConfigParserPlugin, \"config_parser\", \"views\");\n}\n<|endoftext|>"} {"text":"<commit_before>\/*\n * Part of libAsmara, a library for accessing AppStream on-disk database\n * Copyright 2014 Sune Vuorela <sune@vuorela.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) any later version.\n *\n * This library is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU\n * Lesser General Public License for more details.\n *\n * You should have received 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 \"component.h\"\n#include \"screenshot.h\"\n#include <QSharedData>\n#include <QStringList>\n#include <QUrl>\n\nusing namespace Asmara;\n\nclass Asmara::ComponentData : public QSharedData {\n public:\n QStringList m_categories;\n QStringList m_compulsoryForDesktops;\n QString m_description;\n QString m_developerName;\n QStringList m_extends;\n QString m_icon;\n QUrl m_iconUrl;\n QString m_id;\n Component::Kind m_kind;\n QString m_name;\n QString m_packageName;\n QString m_projectGroup;\n QString m_projectLicense;\n QString m_summary;\n QMultiHash<Component::UrlKind, QUrl> m_urls;\n QList<Asmara::ScreenShot> m_screenshots;\n bool operator==(const ComponentData& other) const {\n if(m_categories != other.m_categories) {\n return false;\n }\n if(m_compulsoryForDesktops != other.m_compulsoryForDesktops) {\n return false;\n }\n if(m_description != other.m_description) {\n return false;\n }\n if(m_developerName != other.m_developerName) {\n return false;\n }\n if(m_extends != other.m_extends) {\n return false;\n }\n if(m_icon != other.m_icon) {\n return false;\n }\n if(m_iconUrl != other.m_iconUrl) {\n return false;\n }\n if(m_id != other.m_id) {\n return false;\n }\n if(m_kind != other.m_kind) {\n return false;\n }\n if(m_name != other.m_name) {\n return false;\n }\n if(m_packageName != other.m_packageName) {\n return false;\n }\n if(m_projectGroup != other.m_projectGroup) {\n return false;\n }\n if(m_projectLicense != other.m_projectLicense) {\n return false;\n }\n if(m_summary != other.m_summary) {\n return false;\n }\n if(m_urls != other.m_urls) {\n return false;\n }\n if(m_screenshots != other.m_screenshots) {\n return false;\n }\n return true;\n }\n};\n\n\nconst QStringList& Component::categories() const {\n return d->m_categories;\n}\n\nconst QStringList& Component::compulsoryForDesktops() const {\n return d->m_compulsoryForDesktops;\n}\n\nconst QString& Component::description() const {\n return d->m_description;\n}\n\nconst QString& Component::developerName() const {\n return d->m_developerName;\n}\n\nconst QStringList& Component::extends() const {\n return d->m_extends;\n}\n\nbool Component::hasCategory(const QString& category) const {\n return d->m_categories.contains(category);\n}\n\nconst QString& Component::icon() const {\n return d->m_icon;\n}\n\nconst QUrl& Component::iconUrl() const {\n return d->m_iconUrl;\n}\n\nconst QString& Component::id() const {\n return d->m_id;\n}\n\nbool Component::isCompulsoryForDesktop(const QString& desktop) const {\n return d->m_compulsoryForDesktops.contains(desktop);\n}\n\nComponent::Kind Component::kind() const {\n return d->m_kind;\n}\n\nconst QString& Component::name() const {\n return d->m_name;\n}\n\nconst QString& Component::packageName() const {\n return d->m_packageName;\n}\n\nconst QString& Component::projectGroup() const {\n return d->m_projectGroup;\n}\n\nconst QString& Component::projectLicense() const {\n return d->m_projectLicense;\n}\n\nvoid Component::setCategories(const QStringList& categories) {\n d->m_categories = categories;\n}\n\nvoid Component::setCompulsoryForDesktops(const QStringList& desktops) {\n d->m_compulsoryForDesktops = desktops;\n}\n\nvoid Component::setDescription(const QString& description) {\n d->m_description = description;\n}\n\nvoid Component::setDeveloperName(const QString& developerName) {\n d->m_developerName = developerName;\n}\n\nvoid Component::setIcon(const QString& icon) {\n d->m_icon = icon;\n}\n\nvoid Component::setIconUrl(const QUrl& iconUrl) {\n d->m_iconUrl = iconUrl;\n}\n\nvoid Component::setId(QString id) {\n d->m_id = id;\n}\n\nvoid Component::setKind(Component::Kind kind) {\n d->m_kind = kind;\n}\n\nvoid Component::setName(const QString& name) {\n d->m_name = name;\n}\n\nvoid Component::setPackageName(const QString& packageName) {\n d->m_packageName = packageName;\n}\n\nvoid Component::setProjectGroup(const QString& group) {\n d->m_projectGroup = group;\n}\n\nvoid Component::setProjectLicense(const QString& license){\n d->m_projectLicense = license;\n}\n\nvoid Component::setSummary(const QString& summary){\n d->m_summary = summary;\n}\n\nconst QString& Component::summary() const {\n return d->m_summary;\n}\n\nComponent::Component(const Component& other) : d(other.d) {\n\n}\n\nComponent::Component() : d(new ComponentData) {\n\n}\n\nComponent& Component::operator=(const Component& other) {\n this->d = other.d;\n return *this;\n}\n\nvoid Component::setUrls(const QMultiHash< Component::UrlKind, QUrl >& urls) {\n d->m_urls = urls;\n}\nQList< QUrl > Component::urls(Component::UrlKind kind) const {\n return d->m_urls.values(kind);\n}\n\nconst QMultiHash< Component::UrlKind, QUrl >& Component::urls() const {\n return d->m_urls;\n}\n\n\n\n\n\nbool Component::operator==(const Component& other) {\n if(this->d == other.d) {\n return true;\n }\n if(this->d && other.d) {\n return *(this->d) == *other.d;\n }\n return false;\n}\n\nComponent::~Component() {\n\n}\n\nQHash<Component::Kind, QString> buildKindMap() {\n QHash<Component::Kind,QString> map;\n map.insert(Component::KindAddon, QLatin1String(\"addon\"));\n map.insert(Component::KindCodec, QLatin1String(\"codec\"));\n map.insert(Component::KindDesktop, QLatin1String(\"desktop\"));\n map.insert(Component::KindFont, QLatin1String(\"font\"));\n map.insert(Component::KindGeneric, QLatin1String(\"generic\"));\n map.insert(Component::KindInputmethod, QLatin1String(\"inputmethod\"));\n map.insert(Component::KindUnknown, QLatin1String(\"unknown\"));\n return map;\n}\n\nQString Component::kindToString(Component::Kind kind) {\n static QHash<Kind, QString> kindMap = buildKindMap();\n return kindMap.value(kind);\n}\n\nComponent::Kind Component::stringToKind(const QString& kindString) {\n if(kindString == QLatin1String(\"generic\")) {\n return KindGeneric;\n }\n if (kindString == QLatin1String(\"desktop\")) {\n return KindDesktop;\n }\n if (kindString == QLatin1String(\"font\")) {\n return KindFont;\n }\n if (kindString == QLatin1String(\"codec\")) {\n return KindCodec;\n }\n if (kindString==QLatin1String(\"inputmethod\")) {\n return KindInputmethod;\n }\n if (kindString == QLatin1String(\"addon\")) {\n return KindAddon;\n }\n return KindUnknown;\n\n}\n\nvoid Component::setScreenShots(const QList< ScreenShot >& screenshots) {\n d->m_screenshots = screenshots;\n}\n\nconst QList< ScreenShot >& Component::screenShots() const {\n return d->m_screenshots;\n}\n\n\n\n\nComponent::UrlKind Component::stringToUrlKind(const QString& urlKindString) {\n if (urlKindString == QLatin1String(\"homepage\")) {\n return UrlKindHomepage;\n }\n if (urlKindString == QLatin1String(\"bugtracker\")) {\n return UrlKindBugtracker;\n }\n if (urlKindString == QLatin1String(\"faq\")) {\n return UrlKindFaq;\n }\n if (urlKindString == QLatin1String(\"help\")) {\n return UrlKindHelp;\n }\n if (urlKindString == QLatin1String(\"donation\")) {\n return UrlKindDonation;\n }\n return UrlKindUnknown;\n}\n\nstatic QHash<Component::UrlKind,QString> buildUrlKindMap() {\n QHash<Component::UrlKind, QString> map;\n map.insert(Component::UrlKindBugtracker,QLatin1String(\"bugtracker\"));\n map.insert(Component::UrlKindDonation,QLatin1String(\"donation\"));\n map.insert(Component::UrlKindFaq,QLatin1String(\"faq\"));\n map.insert(Component::UrlKindHelp,QLatin1String(\"help\"));\n map.insert(Component::UrlKindHomepage, QLatin1String(\"homepage\"));\n map.insert(Component::UrlKindUnknown, QLatin1String(\"unknown\"));\n}\n\nQString Component::urlKindToString(Component::UrlKind kind) {\n static const QHash<UrlKind, QString> kindMap = buildUrlKindMap();\n return kindMap.value(kind);\n}\n\n<commit_msg>Acually return the map built when converting UrlKinds to strings<commit_after>\/*\n * Part of libAsmara, a library for accessing AppStream on-disk database\n * Copyright 2014 Sune Vuorela <sune@vuorela.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) any later version.\n *\n * This library is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU\n * Lesser General Public License for more details.\n *\n * You should have received 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 \"component.h\"\n#include \"screenshot.h\"\n#include <QSharedData>\n#include <QStringList>\n#include <QUrl>\n\nusing namespace Asmara;\n\nclass Asmara::ComponentData : public QSharedData {\n public:\n QStringList m_categories;\n QStringList m_compulsoryForDesktops;\n QString m_description;\n QString m_developerName;\n QStringList m_extends;\n QString m_icon;\n QUrl m_iconUrl;\n QString m_id;\n Component::Kind m_kind;\n QString m_name;\n QString m_packageName;\n QString m_projectGroup;\n QString m_projectLicense;\n QString m_summary;\n QMultiHash<Component::UrlKind, QUrl> m_urls;\n QList<Asmara::ScreenShot> m_screenshots;\n bool operator==(const ComponentData& other) const {\n if(m_categories != other.m_categories) {\n return false;\n }\n if(m_compulsoryForDesktops != other.m_compulsoryForDesktops) {\n return false;\n }\n if(m_description != other.m_description) {\n return false;\n }\n if(m_developerName != other.m_developerName) {\n return false;\n }\n if(m_extends != other.m_extends) {\n return false;\n }\n if(m_icon != other.m_icon) {\n return false;\n }\n if(m_iconUrl != other.m_iconUrl) {\n return false;\n }\n if(m_id != other.m_id) {\n return false;\n }\n if(m_kind != other.m_kind) {\n return false;\n }\n if(m_name != other.m_name) {\n return false;\n }\n if(m_packageName != other.m_packageName) {\n return false;\n }\n if(m_projectGroup != other.m_projectGroup) {\n return false;\n }\n if(m_projectLicense != other.m_projectLicense) {\n return false;\n }\n if(m_summary != other.m_summary) {\n return false;\n }\n if(m_urls != other.m_urls) {\n return false;\n }\n if(m_screenshots != other.m_screenshots) {\n return false;\n }\n return true;\n }\n};\n\n\nconst QStringList& Component::categories() const {\n return d->m_categories;\n}\n\nconst QStringList& Component::compulsoryForDesktops() const {\n return d->m_compulsoryForDesktops;\n}\n\nconst QString& Component::description() const {\n return d->m_description;\n}\n\nconst QString& Component::developerName() const {\n return d->m_developerName;\n}\n\nconst QStringList& Component::extends() const {\n return d->m_extends;\n}\n\nbool Component::hasCategory(const QString& category) const {\n return d->m_categories.contains(category);\n}\n\nconst QString& Component::icon() const {\n return d->m_icon;\n}\n\nconst QUrl& Component::iconUrl() const {\n return d->m_iconUrl;\n}\n\nconst QString& Component::id() const {\n return d->m_id;\n}\n\nbool Component::isCompulsoryForDesktop(const QString& desktop) const {\n return d->m_compulsoryForDesktops.contains(desktop);\n}\n\nComponent::Kind Component::kind() const {\n return d->m_kind;\n}\n\nconst QString& Component::name() const {\n return d->m_name;\n}\n\nconst QString& Component::packageName() const {\n return d->m_packageName;\n}\n\nconst QString& Component::projectGroup() const {\n return d->m_projectGroup;\n}\n\nconst QString& Component::projectLicense() const {\n return d->m_projectLicense;\n}\n\nvoid Component::setCategories(const QStringList& categories) {\n d->m_categories = categories;\n}\n\nvoid Component::setCompulsoryForDesktops(const QStringList& desktops) {\n d->m_compulsoryForDesktops = desktops;\n}\n\nvoid Component::setDescription(const QString& description) {\n d->m_description = description;\n}\n\nvoid Component::setDeveloperName(const QString& developerName) {\n d->m_developerName = developerName;\n}\n\nvoid Component::setIcon(const QString& icon) {\n d->m_icon = icon;\n}\n\nvoid Component::setIconUrl(const QUrl& iconUrl) {\n d->m_iconUrl = iconUrl;\n}\n\nvoid Component::setId(QString id) {\n d->m_id = id;\n}\n\nvoid Component::setKind(Component::Kind kind) {\n d->m_kind = kind;\n}\n\nvoid Component::setName(const QString& name) {\n d->m_name = name;\n}\n\nvoid Component::setPackageName(const QString& packageName) {\n d->m_packageName = packageName;\n}\n\nvoid Component::setProjectGroup(const QString& group) {\n d->m_projectGroup = group;\n}\n\nvoid Component::setProjectLicense(const QString& license){\n d->m_projectLicense = license;\n}\n\nvoid Component::setSummary(const QString& summary){\n d->m_summary = summary;\n}\n\nconst QString& Component::summary() const {\n return d->m_summary;\n}\n\nComponent::Component(const Component& other) : d(other.d) {\n\n}\n\nComponent::Component() : d(new ComponentData) {\n\n}\n\nComponent& Component::operator=(const Component& other) {\n this->d = other.d;\n return *this;\n}\n\nvoid Component::setUrls(const QMultiHash< Component::UrlKind, QUrl >& urls) {\n d->m_urls = urls;\n}\nQList< QUrl > Component::urls(Component::UrlKind kind) const {\n return d->m_urls.values(kind);\n}\n\nconst QMultiHash< Component::UrlKind, QUrl >& Component::urls() const {\n return d->m_urls;\n}\n\n\n\n\n\nbool Component::operator==(const Component& other) {\n if(this->d == other.d) {\n return true;\n }\n if(this->d && other.d) {\n return *(this->d) == *other.d;\n }\n return false;\n}\n\nComponent::~Component() {\n\n}\n\nQHash<Component::Kind, QString> buildKindMap() {\n QHash<Component::Kind,QString> map;\n map.insert(Component::KindAddon, QLatin1String(\"addon\"));\n map.insert(Component::KindCodec, QLatin1String(\"codec\"));\n map.insert(Component::KindDesktop, QLatin1String(\"desktop\"));\n map.insert(Component::KindFont, QLatin1String(\"font\"));\n map.insert(Component::KindGeneric, QLatin1String(\"generic\"));\n map.insert(Component::KindInputmethod, QLatin1String(\"inputmethod\"));\n map.insert(Component::KindUnknown, QLatin1String(\"unknown\"));\n return map;\n}\n\nQString Component::kindToString(Component::Kind kind) {\n static QHash<Kind, QString> kindMap = buildKindMap();\n return kindMap.value(kind);\n}\n\nComponent::Kind Component::stringToKind(const QString& kindString) {\n if(kindString == QLatin1String(\"generic\")) {\n return KindGeneric;\n }\n if (kindString == QLatin1String(\"desktop\")) {\n return KindDesktop;\n }\n if (kindString == QLatin1String(\"font\")) {\n return KindFont;\n }\n if (kindString == QLatin1String(\"codec\")) {\n return KindCodec;\n }\n if (kindString==QLatin1String(\"inputmethod\")) {\n return KindInputmethod;\n }\n if (kindString == QLatin1String(\"addon\")) {\n return KindAddon;\n }\n return KindUnknown;\n\n}\n\nvoid Component::setScreenShots(const QList< ScreenShot >& screenshots) {\n d->m_screenshots = screenshots;\n}\n\nconst QList< ScreenShot >& Component::screenShots() const {\n return d->m_screenshots;\n}\n\n\n\n\nComponent::UrlKind Component::stringToUrlKind(const QString& urlKindString) {\n if (urlKindString == QLatin1String(\"homepage\")) {\n return UrlKindHomepage;\n }\n if (urlKindString == QLatin1String(\"bugtracker\")) {\n return UrlKindBugtracker;\n }\n if (urlKindString == QLatin1String(\"faq\")) {\n return UrlKindFaq;\n }\n if (urlKindString == QLatin1String(\"help\")) {\n return UrlKindHelp;\n }\n if (urlKindString == QLatin1String(\"donation\")) {\n return UrlKindDonation;\n }\n return UrlKindUnknown;\n}\n\nstatic QHash<Component::UrlKind,QString> buildUrlKindMap() {\n QHash<Component::UrlKind, QString> map;\n map.insert(Component::UrlKindBugtracker,QLatin1String(\"bugtracker\"));\n map.insert(Component::UrlKindDonation,QLatin1String(\"donation\"));\n map.insert(Component::UrlKindFaq,QLatin1String(\"faq\"));\n map.insert(Component::UrlKindHelp,QLatin1String(\"help\"));\n map.insert(Component::UrlKindHomepage, QLatin1String(\"homepage\"));\n map.insert(Component::UrlKindUnknown, QLatin1String(\"unknown\"));\n return map;\n}\n\nQString Component::urlKindToString(Component::UrlKind kind) {\n static const QHash<UrlKind, QString> kindMap = buildUrlKindMap();\n return kindMap.value(kind);\n}\n\n<|endoftext|>"} {"text":"<commit_before>\/*\n * Copyright (C) 2016-2017 Pelagicore AB\n *\n * Permission to use, copy, modify, and\/or distribute this software for\n * any purpose with or without fee is hereby granted, provided that the\n * above copyright notice and this permission notice appear in all copies.\n *\n * THE SOFTWARE IS PROVIDED \"AS IS\" AND THE AUTHOR DISCLAIMS ALL\n * WARRANTIES WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED\n * WARRANTIES OF MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE AUTHOR\n * BE LIABLE FOR ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES\n * OR ANY DAMAGES WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS,\n * WHETHER IN AN ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION,\n * ARISING OUT OF OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS\n * SOFTWARE.\n *\n * For further information see LICENSE\n *\/\n\n\n#include \"configdefinition.h\"\n\n\n\/**\n * Developers guide to adding a config item:\n *\n * * Add a definition of the string used as key\n *\n * * If the config will be possible to set with a command line option, also add\n * an \"intial value\" set to something which is possible to use for testing if\n * the user set it, i.e. an \"impossible\" value.\n *\n * * Add an entry for the config to the CONFIGS data\n *\/\n\nnamespace softwarecontainer {\n\ntypedef std::vector<std::tuple<std::string, std::string, ConfigType, MandatoryFlag>> ConfigItems;\n\nconst MandatoryFlag Mandatory = true;\nconst MandatoryFlag Optional = false;\n\nconst int ITEM_INDEX_GROUP = 0;\nconst int ITEM_INDEX_KEY = 1;\nconst int ITEM_INDEX_TYPE = 2;\nconst int ITEM_INDEX_MANDATORY = 3;\n\n\/\/ Illegal values used as initial command line option values to check if user\n\/\/ set them or not\nconst std::string ConfigDefinition::SC_CONFIG_PATH_INITIAL_VALUE = \"\";\nconst int ConfigDefinition::SHUTDOWN_TIMEOUT_INITIAL_VALUE = -2;\nconst std::string ConfigDefinition::SERVICE_MANIFEST_DIR_INITIAL_VALUE = \"\";\nconst std::string ConfigDefinition::DEFAULT_SERVICE_MANIFEST_DIR_INITIAL_VALUE = \"\";\nconst bool ConfigDefinition::USE_SESSION_BUS_INITIAL_VALUE = false;\n\n\/\/ Config group \"SoftwareContainer\"\nconst std::string ConfigDefinition::SC_GROUP = \"SoftwareContainer\";\n\n\/\/ Config keys for SoftwareContainer group\nconst std::string ConfigDefinition::SC_USE_SESSION_BUS_KEY = \"session-bus\";\nconst std::string ConfigDefinition::SC_SHUTDOWN_TIMEOUT_KEY = \"shutdown-timeout\";\nconst std::string ConfigDefinition::SC_SHARED_MOUNTS_DIR_KEY = \"shared-mounts-dir\";\nconst std::string ConfigDefinition::SC_LXC_CONFIG_PATH_KEY = \"deprecated-lxc-config-path\";\nconst std::string ConfigDefinition::SC_SERVICE_MANIFEST_DIR_KEY = \"service-manifest-dir\";\nconst std::string ConfigDefinition::SC_DEFAULT_SERVICE_MANIFEST_DIR_KEY = \"default-service-manifest-dir\";\n\n#ifdef ENABLE_NETWORKGATEWAY\nconst std::string ConfigDefinition::SC_CREATE_BRIDGE_KEY = \"create-bridge\";\nconst std::string ConfigDefinition::SC_BRIDGE_DEVICE_KEY = \"bridge-device\";\nconst std::string ConfigDefinition::SC_BRIDGE_IP_KEY = \"bridge-ip\";\nconst std::string ConfigDefinition::SC_BRIDGE_NETADDR_KEY = \"bridge-netaddr\";\nconst std::string ConfigDefinition::SC_BRIDGE_NETMASK_KEY = \"bridge-netmask\";\nconst std::string ConfigDefinition::SC_BRIDGE_NETMASK_BITLENGTH_KEY = \"bridge-netmask-bitlength\";\n#endif\n\n\/*\n * Used to create a mapping between group-key pairs and a type, as well as defining what configs\n * are mandatory.\n *\n * Configs that might be mandatory, i.e. that fact is decided externally by CMake, need to be added\n * with the definition and not the 'Optional' or 'Mandatory' flags directly.\n *\/\nconst ConfigItems CONFIGS\n{\n#ifdef ENABLE_NETWORKGATEWAY\n std::make_tuple(ConfigDefinition::SC_GROUP,\n ConfigDefinition::SC_CREATE_BRIDGE_KEY,\n ConfigType::Boolean,\n ConfigDefinition::convertDefineToFlag(\n SC_CREATE_BRIDGE_MANDATORY_FLAG \/* set by cmake *\/)),\n std::make_tuple(ConfigDefinition::SC_GROUP,\n ConfigDefinition::SC_BRIDGE_DEVICE_KEY,\n ConfigType::String,\n ConfigDefinition::convertDefineToFlag(\n SC_BRIDGE_DEVICE_MANDATORY_FLAG \/* set by cmake *\/)),\n std::make_tuple(ConfigDefinition::SC_GROUP,\n ConfigDefinition::SC_BRIDGE_IP_KEY,\n ConfigType::String,\n ConfigDefinition::convertDefineToFlag(\n SC_BRIDGE_IP_MANDATORY_FLAG \/* set by cmake *\/)),\n std::make_tuple(ConfigDefinition::SC_GROUP,\n ConfigDefinition::SC_BRIDGE_NETMASK_BITLENGTH_KEY,\n ConfigType::Integer,\n ConfigDefinition::convertDefineToFlag(\n SC_BRIDGE_NETMASK_BITLENGTH_MANDATORY_FLAG \/* set by cmake *\/)),\n std::make_tuple(ConfigDefinition::SC_GROUP,\n ConfigDefinition::SC_BRIDGE_NETMASK_KEY,\n ConfigType::String,\n ConfigDefinition::convertDefineToFlag(\n SC_BRIDGE_NETMASK_MANDATORY_FLAG \/* set by cmake *\/)),\n std::make_tuple(ConfigDefinition::SC_GROUP,\n ConfigDefinition::SC_BRIDGE_NETADDR_KEY,\n ConfigType::String,\n ConfigDefinition::convertDefineToFlag(\n SC_BRIDGE_NETADDR_MANDATORY_FLAG \/* set by cmake *\/)),\n#endif \/\/ ENABLE_NETWORKGATEWAY\n std::make_tuple(ConfigDefinition::SC_GROUP,\n ConfigDefinition::SC_USE_SESSION_BUS_KEY,\n ConfigType::Boolean,\n Optional),\n std::make_tuple(ConfigDefinition::SC_GROUP,\n ConfigDefinition::SC_SHUTDOWN_TIMEOUT_KEY,\n ConfigType::Integer,\n Optional),\n std::make_tuple(ConfigDefinition::SC_GROUP,\n ConfigDefinition::SC_SHARED_MOUNTS_DIR_KEY,\n ConfigType::String,\n Optional),\n std::make_tuple(ConfigDefinition::SC_GROUP,\n ConfigDefinition::SC_LXC_CONFIG_PATH_KEY,\n ConfigType::String,\n Optional),\n std::make_tuple(ConfigDefinition::SC_GROUP,\n ConfigDefinition::SC_SERVICE_MANIFEST_DIR_KEY,\n ConfigType::String,\n Optional),\n std::make_tuple(ConfigDefinition::SC_GROUP,\n ConfigDefinition::SC_DEFAULT_SERVICE_MANIFEST_DIR_KEY,\n ConfigType::String,\n Optional)\n};\n\nMandatoryFlag ConfigDefinition::convertDefineToFlag(bool defined)\n{\n return defined ? Mandatory : Optional;\n}\n\nMandatoryConfigs ConfigDefinition::mandatory()\n{\n MandatoryConfigs mandatoryConfigs = MandatoryConfigs();\n\n for (auto config : CONFIGS) {\n std::string group = std::get<ITEM_INDEX_GROUP>(config);\n std::string key = std::get<ITEM_INDEX_KEY>(config);\n MandatoryFlag mandatoryFlag = std::get<ITEM_INDEX_MANDATORY>(config);\n\n if (Mandatory == mandatoryFlag) {\n mandatoryConfigs.push_back(UniqueKey(group, key));\n }\n }\n\n return mandatoryConfigs;\n}\n\nTypeMap ConfigDefinition::typeMap()\n{\n TypeMap typeMap = TypeMap();\n\n for (auto config : CONFIGS) {\n std::string group = std::get<ITEM_INDEX_GROUP>(config);\n std::string key = std::get<ITEM_INDEX_KEY>(config);\n ConfigType configType = std::get<ITEM_INDEX_TYPE>(config);\n\n typeMap[UniqueKey(group, key)] = configType;\n }\n\n return typeMap;\n}\n\n} \/\/ namespace softwarecontainer\n<commit_msg>configdefinition: name change to match conf file<commit_after>\/*\n * Copyright (C) 2016-2017 Pelagicore AB\n *\n * Permission to use, copy, modify, and\/or distribute this software for\n * any purpose with or without fee is hereby granted, provided that the\n * above copyright notice and this permission notice appear in all copies.\n *\n * THE SOFTWARE IS PROVIDED \"AS IS\" AND THE AUTHOR DISCLAIMS ALL\n * WARRANTIES WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED\n * WARRANTIES OF MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE AUTHOR\n * BE LIABLE FOR ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES\n * OR ANY DAMAGES WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS,\n * WHETHER IN AN ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION,\n * ARISING OUT OF OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS\n * SOFTWARE.\n *\n * For further information see LICENSE\n *\/\n\n\n#include \"configdefinition.h\"\n\n\n\/**\n * Developers guide to adding a config item:\n *\n * * Add a definition of the string used as key\n *\n * * If the config will be possible to set with a command line option, also add\n * an \"intial value\" set to something which is possible to use for testing if\n * the user set it, i.e. an \"impossible\" value.\n *\n * * Add an entry for the config to the CONFIGS data\n *\/\n\nnamespace softwarecontainer {\n\ntypedef std::vector<std::tuple<std::string, std::string, ConfigType, MandatoryFlag>> ConfigItems;\n\nconst MandatoryFlag Mandatory = true;\nconst MandatoryFlag Optional = false;\n\nconst int ITEM_INDEX_GROUP = 0;\nconst int ITEM_INDEX_KEY = 1;\nconst int ITEM_INDEX_TYPE = 2;\nconst int ITEM_INDEX_MANDATORY = 3;\n\n\/\/ Illegal values used as initial command line option values to check if user\n\/\/ set them or not\nconst std::string ConfigDefinition::SC_CONFIG_PATH_INITIAL_VALUE = \"\";\nconst int ConfigDefinition::SHUTDOWN_TIMEOUT_INITIAL_VALUE = -2;\nconst std::string ConfigDefinition::SERVICE_MANIFEST_DIR_INITIAL_VALUE = \"\";\nconst std::string ConfigDefinition::DEFAULT_SERVICE_MANIFEST_DIR_INITIAL_VALUE = \"\";\nconst bool ConfigDefinition::USE_SESSION_BUS_INITIAL_VALUE = false;\n\n\/\/ Config group \"SoftwareContainer\"\nconst std::string ConfigDefinition::SC_GROUP = \"SoftwareContainer\";\n\n\/\/ Config keys for SoftwareContainer group\nconst std::string ConfigDefinition::SC_USE_SESSION_BUS_KEY = \"use-session-bus\";\nconst std::string ConfigDefinition::SC_SHUTDOWN_TIMEOUT_KEY = \"shutdown-timeout\";\nconst std::string ConfigDefinition::SC_SHARED_MOUNTS_DIR_KEY = \"shared-mounts-dir\";\nconst std::string ConfigDefinition::SC_LXC_CONFIG_PATH_KEY = \"deprecated-lxc-config-path\";\nconst std::string ConfigDefinition::SC_SERVICE_MANIFEST_DIR_KEY = \"service-manifest-dir\";\nconst std::string ConfigDefinition::SC_DEFAULT_SERVICE_MANIFEST_DIR_KEY = \"default-service-manifest-dir\";\n\n#ifdef ENABLE_NETWORKGATEWAY\nconst std::string ConfigDefinition::SC_CREATE_BRIDGE_KEY = \"create-bridge\";\nconst std::string ConfigDefinition::SC_BRIDGE_DEVICE_KEY = \"bridge-device\";\nconst std::string ConfigDefinition::SC_BRIDGE_IP_KEY = \"bridge-ip\";\nconst std::string ConfigDefinition::SC_BRIDGE_NETADDR_KEY = \"bridge-netaddr\";\nconst std::string ConfigDefinition::SC_BRIDGE_NETMASK_KEY = \"bridge-netmask\";\nconst std::string ConfigDefinition::SC_BRIDGE_NETMASK_BITLENGTH_KEY = \"bridge-netmask-bitlength\";\n#endif\n\n\/*\n * Used to create a mapping between group-key pairs and a type, as well as defining what configs\n * are mandatory.\n *\n * Configs that might be mandatory, i.e. that fact is decided externally by CMake, need to be added\n * with the definition and not the 'Optional' or 'Mandatory' flags directly.\n *\/\nconst ConfigItems CONFIGS\n{\n#ifdef ENABLE_NETWORKGATEWAY\n std::make_tuple(ConfigDefinition::SC_GROUP,\n ConfigDefinition::SC_CREATE_BRIDGE_KEY,\n ConfigType::Boolean,\n ConfigDefinition::convertDefineToFlag(\n SC_CREATE_BRIDGE_MANDATORY_FLAG \/* set by cmake *\/)),\n std::make_tuple(ConfigDefinition::SC_GROUP,\n ConfigDefinition::SC_BRIDGE_DEVICE_KEY,\n ConfigType::String,\n ConfigDefinition::convertDefineToFlag(\n SC_BRIDGE_DEVICE_MANDATORY_FLAG \/* set by cmake *\/)),\n std::make_tuple(ConfigDefinition::SC_GROUP,\n ConfigDefinition::SC_BRIDGE_IP_KEY,\n ConfigType::String,\n ConfigDefinition::convertDefineToFlag(\n SC_BRIDGE_IP_MANDATORY_FLAG \/* set by cmake *\/)),\n std::make_tuple(ConfigDefinition::SC_GROUP,\n ConfigDefinition::SC_BRIDGE_NETMASK_BITLENGTH_KEY,\n ConfigType::Integer,\n ConfigDefinition::convertDefineToFlag(\n SC_BRIDGE_NETMASK_BITLENGTH_MANDATORY_FLAG \/* set by cmake *\/)),\n std::make_tuple(ConfigDefinition::SC_GROUP,\n ConfigDefinition::SC_BRIDGE_NETMASK_KEY,\n ConfigType::String,\n ConfigDefinition::convertDefineToFlag(\n SC_BRIDGE_NETMASK_MANDATORY_FLAG \/* set by cmake *\/)),\n std::make_tuple(ConfigDefinition::SC_GROUP,\n ConfigDefinition::SC_BRIDGE_NETADDR_KEY,\n ConfigType::String,\n ConfigDefinition::convertDefineToFlag(\n SC_BRIDGE_NETADDR_MANDATORY_FLAG \/* set by cmake *\/)),\n#endif \/\/ ENABLE_NETWORKGATEWAY\n std::make_tuple(ConfigDefinition::SC_GROUP,\n ConfigDefinition::SC_USE_SESSION_BUS_KEY,\n ConfigType::Boolean,\n Optional),\n std::make_tuple(ConfigDefinition::SC_GROUP,\n ConfigDefinition::SC_SHUTDOWN_TIMEOUT_KEY,\n ConfigType::Integer,\n Optional),\n std::make_tuple(ConfigDefinition::SC_GROUP,\n ConfigDefinition::SC_SHARED_MOUNTS_DIR_KEY,\n ConfigType::String,\n Optional),\n std::make_tuple(ConfigDefinition::SC_GROUP,\n ConfigDefinition::SC_LXC_CONFIG_PATH_KEY,\n ConfigType::String,\n Optional),\n std::make_tuple(ConfigDefinition::SC_GROUP,\n ConfigDefinition::SC_SERVICE_MANIFEST_DIR_KEY,\n ConfigType::String,\n Optional),\n std::make_tuple(ConfigDefinition::SC_GROUP,\n ConfigDefinition::SC_DEFAULT_SERVICE_MANIFEST_DIR_KEY,\n ConfigType::String,\n Optional)\n};\n\nMandatoryFlag ConfigDefinition::convertDefineToFlag(bool defined)\n{\n return defined ? Mandatory : Optional;\n}\n\nMandatoryConfigs ConfigDefinition::mandatory()\n{\n MandatoryConfigs mandatoryConfigs = MandatoryConfigs();\n\n for (auto config : CONFIGS) {\n std::string group = std::get<ITEM_INDEX_GROUP>(config);\n std::string key = std::get<ITEM_INDEX_KEY>(config);\n MandatoryFlag mandatoryFlag = std::get<ITEM_INDEX_MANDATORY>(config);\n\n if (Mandatory == mandatoryFlag) {\n mandatoryConfigs.push_back(UniqueKey(group, key));\n }\n }\n\n return mandatoryConfigs;\n}\n\nTypeMap ConfigDefinition::typeMap()\n{\n TypeMap typeMap = TypeMap();\n\n for (auto config : CONFIGS) {\n std::string group = std::get<ITEM_INDEX_GROUP>(config);\n std::string key = std::get<ITEM_INDEX_KEY>(config);\n ConfigType configType = std::get<ITEM_INDEX_TYPE>(config);\n\n typeMap[UniqueKey(group, key)] = configType;\n }\n\n return typeMap;\n}\n\n} \/\/ namespace softwarecontainer\n<|endoftext|>"} {"text":"<commit_before>#include <stdexcept>\n#include <utility>\n#include \"test_tool.hpp\"\n\nnamespace test_tool\n{\n emulator::emulator(question_data const& question)\n : question_(question.clone())\n {\n }\n\n auto emulator::start(answer_type const& answer) -> return_type\n {\n auto const emulated = emulate_movement(answer);\n auto const cost = count_cost(answer);\n auto const correct = count_correct(emulated);\n\n std::cerr << \"correct: \" << correct << std::endl;\n\n return return_type{\n cost,\n question_.size.first * question_.size.second - correct\n };\n }\n\n point_type emulator::target_point(char const identifier, point_type const& reference) const\n {\n switch (identifier) {\n case 'U':\n return {reference.x, reference.y - 1};\n case 'D':\n return {reference.x, reference.y + 1};\n case 'L':\n return {reference.x - 1, reference.y};\n case 'R':\n return {reference.x + 1, reference.y};\n }\n throw std::runtime_error(\"emulator::target_point: Undefined identifier\");\n }\n\n auto emulator::emulate_movement(answer_type const& answer) -> locate_type\n {\n locate_type state = question_.block;\n point_type selected{-1, -1};\n\n for(auto const& select : answer.list)\n {\n selected = select.position;\n std::cerr << (boost::format(\"selecting (%d,%d)\") % selected.x % selected.y).str() << std::endl;\n for(const char action : select.actions)\n {\n#ifdef _DEBUG\n \/\/ debug\n std::cerr << \"Current state:\" << std::endl;\n for(auto a : state) {\n for(point_type p : a) {\n std::cerr << \"(\" << p.x << \",\" << p.y << \") \";\n }\n std::cerr << std::endl;\n }\n#endif\n\n \/\/ 移動先を見つけて交換(std::vectorからあふれた時はatが例外を送出する)\n auto const target = target_point(action, selected);\n#ifdef _DEBUG\n std::cerr << (boost::format(\"%c: moving from (%d,%d) to (%d,%d)\") % action % selected.x % selected.y % target.x % target.y).str() << std::endl;\n#endif\n std::swap(\n state.at(selected.y).at(selected.x),\n state.at(target .y).at(target .x)\n );\n\n \/\/ 更新\n selected = target;\n }\n }\n\n return state;\n }\n\n int emulator::count_cost(answer_type const& answer)\n {\n int cost = 0;\n\n for(auto const& select : answer.list)\n {\n cost += question_.cost_select;\n for(char const action : select.actions)\n {\n cost += question_.cost_change;\n }\n }\n\n return cost;\n }\n\n int emulator::count_correct(locate_type const& locate)\n {\n int correct = 0;\n for(int i = 0; i < locate.size(); ++i)\n {\n for(int j = 0; j < locate.at(i).size(); ++j)\n {\n if(locate.at(i).at(j) == point_type{j, i}) ++correct;\n }\n }\n return correct;\n }\n\n} \/\/ namespace test_tool\n\n<commit_msg>releaseで出力が消しきれてなかった<commit_after>#include <stdexcept>\n#include <utility>\n#include \"test_tool.hpp\"\n\nnamespace test_tool\n{\n emulator::emulator(question_data const& question)\n : question_(question.clone())\n {\n }\n\n auto emulator::start(answer_type const& answer) -> return_type\n {\n auto const emulated = emulate_movement(answer);\n auto const cost = count_cost(answer);\n auto const correct = count_correct(emulated);\n\n std::cerr << \"correct: \" << correct << std::endl;\n\n return return_type{\n cost,\n question_.size.first * question_.size.second - correct\n };\n }\n\n point_type emulator::target_point(char const identifier, point_type const& reference) const\n {\n switch (identifier) {\n case 'U':\n return {reference.x, reference.y - 1};\n case 'D':\n return {reference.x, reference.y + 1};\n case 'L':\n return {reference.x - 1, reference.y};\n case 'R':\n return {reference.x + 1, reference.y};\n }\n throw std::runtime_error(\"emulator::target_point: Undefined identifier\");\n }\n\n auto emulator::emulate_movement(answer_type const& answer) -> locate_type\n {\n locate_type state = question_.block;\n point_type selected{-1, -1};\n\n for(auto const& select : answer.list)\n {\n selected = select.position;\n#ifdef _DEBUG\n std::cerr << (boost::format(\"selecting (%d,%d)\") % selected.x % selected.y).str() << std::endl;\n#endif\n for(const char action : select.actions)\n {\n#ifdef _DEBUG\n \/\/ debug\n std::cerr << \"Current state:\" << std::endl;\n for(auto a : state) {\n for(point_type p : a) {\n std::cerr << \"(\" << p.x << \",\" << p.y << \") \";\n }\n std::cerr << std::endl;\n }\n#endif\n\n \/\/ 移動先を見つけて交換(std::vectorからあふれた時はatが例外を送出する)\n auto const target = target_point(action, selected);\n#ifdef _DEBUG\n std::cerr << (boost::format(\"%c: moving from (%d,%d) to (%d,%d)\") % action % selected.x % selected.y % target.x % target.y).str() << std::endl;\n#endif\n std::swap(\n state.at(selected.y).at(selected.x),\n state.at(target .y).at(target .x)\n );\n\n \/\/ 更新\n selected = target;\n }\n }\n\n return state;\n }\n\n int emulator::count_cost(answer_type const& answer)\n {\n int cost = 0;\n\n for(auto const& select : answer.list)\n {\n cost += question_.cost_select;\n for(char const action : select.actions)\n {\n cost += question_.cost_change;\n }\n }\n\n return cost;\n }\n\n int emulator::count_correct(locate_type const& locate)\n {\n int correct = 0;\n for(int i = 0; i < locate.size(); ++i)\n {\n for(int j = 0; j < locate.at(i).size(); ++j)\n {\n if(locate.at(i).at(j) == point_type{j, i}) ++correct;\n }\n }\n return correct;\n }\n\n} \/\/ namespace test_tool\n\n<|endoftext|>"} {"text":"<commit_before>\/\/===--- ClangdMain.cpp - clangd server loop ------------------------------===\/\/\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 \"ClangdLSPServer.h\"\n#include \"JSONRPCDispatcher.h\"\n#include \"Path.h\"\n#include \"Trace.h\"\n#include \"index\/SymbolYAML.h\"\n#include \"index\/dex\/DexIndex.h\"\n#include \"clang\/Basic\/Version.h\"\n#include \"llvm\/Support\/CommandLine.h\"\n#include \"llvm\/Support\/FileSystem.h\"\n#include \"llvm\/Support\/Path.h\"\n#include \"llvm\/Support\/Program.h\"\n#include \"llvm\/Support\/Signals.h\"\n#include \"llvm\/Support\/raw_ostream.h\"\n#include <cstdlib>\n#include <iostream>\n#include <memory>\n#include <string>\n#include <thread>\n\nusing namespace clang;\nusing namespace clang::clangd;\n\nnamespace {\n\nenum class PCHStorageFlag { Disk, Memory };\n\n\/\/ Build an in-memory static index for global symbols from a YAML-format file.\n\/\/ The size of global symbols should be relatively small, so that all symbols\n\/\/ can be managed in memory.\nstd::unique_ptr<SymbolIndex> buildStaticIndex(llvm::StringRef YamlSymbolFile) {\n auto Buffer = llvm::MemoryBuffer::getFile(YamlSymbolFile);\n if (!Buffer) {\n llvm::errs() << \"Can't open \" << YamlSymbolFile << \"\\n\";\n return nullptr;\n }\n auto Slab = symbolsFromYAML(Buffer.get()->getBuffer());\n SymbolSlab::Builder SymsBuilder;\n for (auto Sym : Slab)\n SymsBuilder.insert(Sym);\n\n return UseDex ? DexIndex::build(std::move(SymsBuilder).build())\n : MemIndex::build(std::move(SymsBuilder).build());\n}\n\n} \/\/ namespace\n\nstatic llvm::cl::opt<Path> CompileCommandsDir(\n \"compile-commands-dir\",\n llvm::cl::desc(\"Specify a path to look for compile_commands.json. If path \"\n \"is invalid, clangd will look in the current directory and \"\n \"parent paths of each source file.\"));\n\nstatic llvm::cl::opt<unsigned>\n WorkerThreadsCount(\"j\",\n llvm::cl::desc(\"Number of async workers used by clangd\"),\n llvm::cl::init(getDefaultAsyncThreadsCount()));\n\n\/\/ FIXME: also support \"plain\" style where signatures are always omitted.\nenum CompletionStyleFlag {\n Detailed,\n Bundled,\n};\nstatic llvm::cl::opt<CompletionStyleFlag> CompletionStyle(\n \"completion-style\",\n llvm::cl::desc(\"Granularity of code completion suggestions\"),\n llvm::cl::values(\n clEnumValN(Detailed, \"detailed\",\n \"One completion item for each semantically distinct \"\n \"completion, with full type information.\"),\n clEnumValN(Bundled, \"bundled\",\n \"Similar completion items (e.g. function overloads) are \"\n \"combined. Type information shown where possible.\")),\n llvm::cl::init(Detailed));\n\n\/\/ FIXME: Flags are the wrong mechanism for user preferences.\n\/\/ We should probably read a dotfile or similar.\nstatic llvm::cl::opt<bool> IncludeIneligibleResults(\n \"include-ineligible-results\",\n llvm::cl::desc(\n \"Include ineligible completion results (e.g. private members)\"),\n llvm::cl::init(clangd::CodeCompleteOptions().IncludeIneligibleResults),\n llvm::cl::Hidden);\n\nstatic llvm::cl::opt<JSONStreamStyle> InputStyle(\n \"input-style\", llvm::cl::desc(\"Input JSON stream encoding\"),\n llvm::cl::values(\n clEnumValN(JSONStreamStyle::Standard, \"standard\", \"usual LSP protocol\"),\n clEnumValN(JSONStreamStyle::Delimited, \"delimited\",\n \"messages delimited by --- lines, with # comment support\")),\n llvm::cl::init(JSONStreamStyle::Standard));\n\nstatic llvm::cl::opt<bool>\n PrettyPrint(\"pretty\", llvm::cl::desc(\"Pretty-print JSON output\"),\n llvm::cl::init(false));\n\nstatic llvm::cl::opt<Logger::Level> LogLevel(\n \"log\", llvm::cl::desc(\"Verbosity of log messages written to stderr\"),\n llvm::cl::values(clEnumValN(Logger::Error, \"error\", \"Error messages only\"),\n clEnumValN(Logger::Info, \"info\",\n \"High level execution tracing\"),\n clEnumValN(Logger::Debug, \"verbose\", \"Low level details\")),\n llvm::cl::init(Logger::Info));\n\nstatic llvm::cl::opt<bool> Test(\n \"lit-test\",\n llvm::cl::desc(\n \"Abbreviation for -input-style=delimited -pretty -run-synchronously. \"\n \"Intended to simplify lit tests.\"),\n llvm::cl::init(false), llvm::cl::Hidden);\n\nstatic llvm::cl::opt<PCHStorageFlag> PCHStorage(\n \"pch-storage\",\n llvm::cl::desc(\"Storing PCHs in memory increases memory usages, but may \"\n \"improve performance\"),\n llvm::cl::values(\n clEnumValN(PCHStorageFlag::Disk, \"disk\", \"store PCHs on disk\"),\n clEnumValN(PCHStorageFlag::Memory, \"memory\", \"store PCHs in memory\")),\n llvm::cl::init(PCHStorageFlag::Disk));\n\nstatic llvm::cl::opt<int> LimitResults(\n \"limit-results\",\n llvm::cl::desc(\"Limit the number of results returned by clangd. \"\n \"0 means no limit.\"),\n llvm::cl::init(100));\n\nstatic llvm::cl::opt<bool> RunSynchronously(\n \"run-synchronously\",\n llvm::cl::desc(\"Parse on main thread. If set, -j is ignored\"),\n llvm::cl::init(false), llvm::cl::Hidden);\n\nstatic llvm::cl::opt<Path>\n ResourceDir(\"resource-dir\",\n llvm::cl::desc(\"Directory for system clang headers\"),\n llvm::cl::init(\"\"), llvm::cl::Hidden);\n\nstatic llvm::cl::opt<Path> InputMirrorFile(\n \"input-mirror-file\",\n llvm::cl::desc(\n \"Mirror all LSP input to the specified file. Useful for debugging.\"),\n llvm::cl::init(\"\"), llvm::cl::Hidden);\n\nstatic llvm::cl::opt<bool> EnableIndex(\n \"index\",\n llvm::cl::desc(\"Enable index-based features such as global code completion \"\n \"and searching for symbols. \"\n \"Clang uses an index built from symbols in opened files\"),\n llvm::cl::init(true));\n\nstatic llvm::cl::opt<bool>\n ShowOrigins(\"debug-origin\",\n llvm::cl::desc(\"Show origins of completion items\"),\n llvm::cl::init(clangd::CodeCompleteOptions().ShowOrigins),\n llvm::cl::Hidden);\n\nstatic llvm::cl::opt<bool> HeaderInsertionDecorators(\n \"header-insertion-decorators\",\n llvm::cl::desc(\"Prepend a circular dot or space before the completion \"\n \"label, depending on whether \"\n \"an include line will be inserted or not.\"),\n llvm::cl::init(true));\n\nstatic llvm::cl::opt<Path> YamlSymbolFile(\n \"yaml-symbol-file\",\n llvm::cl::desc(\n \"YAML-format global symbol file to build the static index. Clangd will \"\n \"use the static index for global code completion.\\n\"\n \"WARNING: This option is experimental only, and will be removed \"\n \"eventually. Don't rely on it.\"),\n llvm::cl::init(\"\"), llvm::cl::Hidden);\n\nenum CompileArgsFrom { LSPCompileArgs, FilesystemCompileArgs };\n\nstatic llvm::cl::opt<CompileArgsFrom> CompileArgsFrom(\n \"compile_args_from\", llvm::cl::desc(\"The source of compile commands\"),\n llvm::cl::values(clEnumValN(LSPCompileArgs, \"lsp\",\n \"All compile commands come from LSP and \"\n \"'compile_commands.json' files are ignored\"),\n clEnumValN(FilesystemCompileArgs, \"filesystem\",\n \"All compile commands come from the \"\n \"'compile_commands.json' files\")),\n llvm::cl::init(FilesystemCompileArgs), llvm::cl::Hidden);\n\nstatic llvm::cl::opt<bool>\n UseDex(\"use-dex-index\",\n llvm::cl::desc(\"Use experimental Dex static index.\"),\n llvm::cl::init(false), llvm::cl::Hidden);\n\nint main(int argc, char *argv[]) {\n llvm::sys::PrintStackTraceOnErrorSignal(argv[0]);\n llvm::cl::SetVersionPrinter([](llvm::raw_ostream &OS) {\n OS << clang::getClangToolFullVersion(\"clangd\") << \"\\n\";\n });\n llvm::cl::ParseCommandLineOptions(\n argc, argv,\n \"clangd is a language server that provides IDE-like features to editors. \"\n \"\\n\\nIt should be used via an editor plugin rather than invoked directly.\"\n \"For more information, see:\"\n \"\\n\\thttps:\/\/clang.llvm.org\/extra\/clangd.html\"\n \"\\n\\thttps:\/\/microsoft.github.io\/language-server-protocol\/\");\n if (Test) {\n RunSynchronously = true;\n InputStyle = JSONStreamStyle::Delimited;\n PrettyPrint = true;\n }\n\n if (!RunSynchronously && WorkerThreadsCount == 0) {\n llvm::errs() << \"A number of worker threads cannot be 0. Did you mean to \"\n \"specify -run-synchronously?\";\n return 1;\n }\n\n if (RunSynchronously) {\n if (WorkerThreadsCount.getNumOccurrences())\n llvm::errs() << \"Ignoring -j because -run-synchronously is set.\\n\";\n WorkerThreadsCount = 0;\n }\n\n \/\/ Validate command line arguments.\n llvm::Optional<llvm::raw_fd_ostream> InputMirrorStream;\n if (!InputMirrorFile.empty()) {\n std::error_code EC;\n InputMirrorStream.emplace(InputMirrorFile, \/*ref*\/ EC,\n llvm::sys::fs::FA_Read | llvm::sys::fs::FA_Write);\n if (EC) {\n InputMirrorStream.reset();\n llvm::errs() << \"Error while opening an input mirror file: \"\n << EC.message();\n }\n }\n\n \/\/ Setup tracing facilities if CLANGD_TRACE is set. In practice enabling a\n \/\/ trace flag in your editor's config is annoying, launching with\n \/\/ `CLANGD_TRACE=trace.json vim` is easier.\n llvm::Optional<llvm::raw_fd_ostream> TraceStream;\n std::unique_ptr<trace::EventTracer> Tracer;\n if (auto *TraceFile = getenv(\"CLANGD_TRACE\")) {\n std::error_code EC;\n TraceStream.emplace(TraceFile, \/*ref*\/ EC,\n llvm::sys::fs::FA_Read | llvm::sys::fs::FA_Write);\n if (EC) {\n TraceStream.reset();\n llvm::errs() << \"Error while opening trace file \" << TraceFile << \": \"\n << EC.message();\n } else {\n Tracer = trace::createJSONTracer(*TraceStream, PrettyPrint);\n }\n }\n\n llvm::Optional<trace::Session> TracingSession;\n if (Tracer)\n TracingSession.emplace(*Tracer);\n\n JSONOutput Out(llvm::outs(), llvm::errs(), LogLevel,\n InputMirrorStream ? InputMirrorStream.getPointer() : nullptr,\n PrettyPrint);\n\n clangd::LoggingSession LoggingSession(Out);\n\n \/\/ If --compile-commands-dir arg was invoked, check value and override default\n \/\/ path.\n llvm::Optional<Path> CompileCommandsDirPath;\n if (CompileCommandsDir.empty()) {\n CompileCommandsDirPath = llvm::None;\n } else if (!llvm::sys::path::is_absolute(CompileCommandsDir) ||\n !llvm::sys::fs::exists(CompileCommandsDir)) {\n llvm::errs() << \"Path specified by --compile-commands-dir either does not \"\n \"exist or is not an absolute \"\n \"path. The argument will be ignored.\\n\";\n CompileCommandsDirPath = llvm::None;\n } else {\n CompileCommandsDirPath = CompileCommandsDir;\n }\n\n ClangdServer::Options Opts;\n switch (PCHStorage) {\n case PCHStorageFlag::Memory:\n Opts.StorePreamblesInMemory = true;\n break;\n case PCHStorageFlag::Disk:\n Opts.StorePreamblesInMemory = false;\n break;\n }\n if (!ResourceDir.empty())\n Opts.ResourceDir = ResourceDir;\n Opts.BuildDynamicSymbolIndex = EnableIndex;\n std::unique_ptr<SymbolIndex> StaticIdx;\n if (EnableIndex && !YamlSymbolFile.empty()) {\n StaticIdx = buildStaticIndex(YamlSymbolFile);\n Opts.StaticIndex = StaticIdx.get();\n }\n Opts.AsyncThreadsCount = WorkerThreadsCount;\n\n clangd::CodeCompleteOptions CCOpts;\n CCOpts.IncludeIneligibleResults = IncludeIneligibleResults;\n CCOpts.Limit = LimitResults;\n CCOpts.BundleOverloads = CompletionStyle != Detailed;\n CCOpts.ShowOrigins = ShowOrigins;\n if (!HeaderInsertionDecorators) {\n CCOpts.IncludeIndicator.Insert.clear();\n CCOpts.IncludeIndicator.NoInsert.clear();\n }\n\n \/\/ Initialize and run ClangdLSPServer.\n ClangdLSPServer LSPServer(\n Out, CCOpts, CompileCommandsDirPath,\n \/*ShouldUseInMemoryCDB=*\/CompileArgsFrom == LSPCompileArgs, Opts);\n constexpr int NoShutdownRequestErrorCode = 1;\n llvm::set_thread_name(\"clangd.main\");\n \/\/ Change stdin to binary to not lose \\r\\n on windows.\n llvm::sys::ChangeStdinToBinary();\n return LSPServer.run(stdin, InputStyle) ? 0 : NoShutdownRequestErrorCode;\n}\n<commit_msg>[clangd] NFC: Fix broken build<commit_after>\/\/===--- ClangdMain.cpp - clangd server loop ------------------------------===\/\/\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 \"ClangdLSPServer.h\"\n#include \"JSONRPCDispatcher.h\"\n#include \"Path.h\"\n#include \"Trace.h\"\n#include \"index\/SymbolYAML.h\"\n#include \"index\/dex\/DexIndex.h\"\n#include \"clang\/Basic\/Version.h\"\n#include \"llvm\/Support\/CommandLine.h\"\n#include \"llvm\/Support\/FileSystem.h\"\n#include \"llvm\/Support\/Path.h\"\n#include \"llvm\/Support\/Program.h\"\n#include \"llvm\/Support\/Signals.h\"\n#include \"llvm\/Support\/raw_ostream.h\"\n#include <cstdlib>\n#include <iostream>\n#include <memory>\n#include <string>\n#include <thread>\n\nusing namespace clang;\nusing namespace clang::clangd;\n\nstatic llvm::cl::opt<bool>\n UseDex(\"use-dex-index\",\n llvm::cl::desc(\"Use experimental Dex static index.\"),\n llvm::cl::init(false), llvm::cl::Hidden);\n\nnamespace {\n\nenum class PCHStorageFlag { Disk, Memory };\n\n\/\/ Build an in-memory static index for global symbols from a YAML-format file.\n\/\/ The size of global symbols should be relatively small, so that all symbols\n\/\/ can be managed in memory.\nstd::unique_ptr<SymbolIndex> buildStaticIndex(llvm::StringRef YamlSymbolFile) {\n auto Buffer = llvm::MemoryBuffer::getFile(YamlSymbolFile);\n if (!Buffer) {\n llvm::errs() << \"Can't open \" << YamlSymbolFile << \"\\n\";\n return nullptr;\n }\n auto Slab = symbolsFromYAML(Buffer.get()->getBuffer());\n SymbolSlab::Builder SymsBuilder;\n for (auto Sym : Slab)\n SymsBuilder.insert(Sym);\n\n return UseDex ? dex::DexIndex::build(std::move(SymsBuilder).build())\n : MemIndex::build(std::move(SymsBuilder).build());\n}\n\n} \/\/ namespace\n\nstatic llvm::cl::opt<Path> CompileCommandsDir(\n \"compile-commands-dir\",\n llvm::cl::desc(\"Specify a path to look for compile_commands.json. If path \"\n \"is invalid, clangd will look in the current directory and \"\n \"parent paths of each source file.\"));\n\nstatic llvm::cl::opt<unsigned>\n WorkerThreadsCount(\"j\",\n llvm::cl::desc(\"Number of async workers used by clangd\"),\n llvm::cl::init(getDefaultAsyncThreadsCount()));\n\n\/\/ FIXME: also support \"plain\" style where signatures are always omitted.\nenum CompletionStyleFlag {\n Detailed,\n Bundled,\n};\nstatic llvm::cl::opt<CompletionStyleFlag> CompletionStyle(\n \"completion-style\",\n llvm::cl::desc(\"Granularity of code completion suggestions\"),\n llvm::cl::values(\n clEnumValN(Detailed, \"detailed\",\n \"One completion item for each semantically distinct \"\n \"completion, with full type information.\"),\n clEnumValN(Bundled, \"bundled\",\n \"Similar completion items (e.g. function overloads) are \"\n \"combined. Type information shown where possible.\")),\n llvm::cl::init(Detailed));\n\n\/\/ FIXME: Flags are the wrong mechanism for user preferences.\n\/\/ We should probably read a dotfile or similar.\nstatic llvm::cl::opt<bool> IncludeIneligibleResults(\n \"include-ineligible-results\",\n llvm::cl::desc(\n \"Include ineligible completion results (e.g. private members)\"),\n llvm::cl::init(clangd::CodeCompleteOptions().IncludeIneligibleResults),\n llvm::cl::Hidden);\n\nstatic llvm::cl::opt<JSONStreamStyle> InputStyle(\n \"input-style\", llvm::cl::desc(\"Input JSON stream encoding\"),\n llvm::cl::values(\n clEnumValN(JSONStreamStyle::Standard, \"standard\", \"usual LSP protocol\"),\n clEnumValN(JSONStreamStyle::Delimited, \"delimited\",\n \"messages delimited by --- lines, with # comment support\")),\n llvm::cl::init(JSONStreamStyle::Standard));\n\nstatic llvm::cl::opt<bool>\n PrettyPrint(\"pretty\", llvm::cl::desc(\"Pretty-print JSON output\"),\n llvm::cl::init(false));\n\nstatic llvm::cl::opt<Logger::Level> LogLevel(\n \"log\", llvm::cl::desc(\"Verbosity of log messages written to stderr\"),\n llvm::cl::values(clEnumValN(Logger::Error, \"error\", \"Error messages only\"),\n clEnumValN(Logger::Info, \"info\",\n \"High level execution tracing\"),\n clEnumValN(Logger::Debug, \"verbose\", \"Low level details\")),\n llvm::cl::init(Logger::Info));\n\nstatic llvm::cl::opt<bool> Test(\n \"lit-test\",\n llvm::cl::desc(\n \"Abbreviation for -input-style=delimited -pretty -run-synchronously. \"\n \"Intended to simplify lit tests.\"),\n llvm::cl::init(false), llvm::cl::Hidden);\n\nstatic llvm::cl::opt<PCHStorageFlag> PCHStorage(\n \"pch-storage\",\n llvm::cl::desc(\"Storing PCHs in memory increases memory usages, but may \"\n \"improve performance\"),\n llvm::cl::values(\n clEnumValN(PCHStorageFlag::Disk, \"disk\", \"store PCHs on disk\"),\n clEnumValN(PCHStorageFlag::Memory, \"memory\", \"store PCHs in memory\")),\n llvm::cl::init(PCHStorageFlag::Disk));\n\nstatic llvm::cl::opt<int> LimitResults(\n \"limit-results\",\n llvm::cl::desc(\"Limit the number of results returned by clangd. \"\n \"0 means no limit.\"),\n llvm::cl::init(100));\n\nstatic llvm::cl::opt<bool> RunSynchronously(\n \"run-synchronously\",\n llvm::cl::desc(\"Parse on main thread. If set, -j is ignored\"),\n llvm::cl::init(false), llvm::cl::Hidden);\n\nstatic llvm::cl::opt<Path>\n ResourceDir(\"resource-dir\",\n llvm::cl::desc(\"Directory for system clang headers\"),\n llvm::cl::init(\"\"), llvm::cl::Hidden);\n\nstatic llvm::cl::opt<Path> InputMirrorFile(\n \"input-mirror-file\",\n llvm::cl::desc(\n \"Mirror all LSP input to the specified file. Useful for debugging.\"),\n llvm::cl::init(\"\"), llvm::cl::Hidden);\n\nstatic llvm::cl::opt<bool> EnableIndex(\n \"index\",\n llvm::cl::desc(\"Enable index-based features such as global code completion \"\n \"and searching for symbols. \"\n \"Clang uses an index built from symbols in opened files\"),\n llvm::cl::init(true));\n\nstatic llvm::cl::opt<bool>\n ShowOrigins(\"debug-origin\",\n llvm::cl::desc(\"Show origins of completion items\"),\n llvm::cl::init(clangd::CodeCompleteOptions().ShowOrigins),\n llvm::cl::Hidden);\n\nstatic llvm::cl::opt<bool> HeaderInsertionDecorators(\n \"header-insertion-decorators\",\n llvm::cl::desc(\"Prepend a circular dot or space before the completion \"\n \"label, depending on whether \"\n \"an include line will be inserted or not.\"),\n llvm::cl::init(true));\n\nstatic llvm::cl::opt<Path> YamlSymbolFile(\n \"yaml-symbol-file\",\n llvm::cl::desc(\n \"YAML-format global symbol file to build the static index. Clangd will \"\n \"use the static index for global code completion.\\n\"\n \"WARNING: This option is experimental only, and will be removed \"\n \"eventually. Don't rely on it.\"),\n llvm::cl::init(\"\"), llvm::cl::Hidden);\n\nenum CompileArgsFrom { LSPCompileArgs, FilesystemCompileArgs };\n\nstatic llvm::cl::opt<CompileArgsFrom> CompileArgsFrom(\n \"compile_args_from\", llvm::cl::desc(\"The source of compile commands\"),\n llvm::cl::values(clEnumValN(LSPCompileArgs, \"lsp\",\n \"All compile commands come from LSP and \"\n \"'compile_commands.json' files are ignored\"),\n clEnumValN(FilesystemCompileArgs, \"filesystem\",\n \"All compile commands come from the \"\n \"'compile_commands.json' files\")),\n llvm::cl::init(FilesystemCompileArgs), llvm::cl::Hidden);\n\nint main(int argc, char *argv[]) {\n llvm::sys::PrintStackTraceOnErrorSignal(argv[0]);\n llvm::cl::SetVersionPrinter([](llvm::raw_ostream &OS) {\n OS << clang::getClangToolFullVersion(\"clangd\") << \"\\n\";\n });\n llvm::cl::ParseCommandLineOptions(\n argc, argv,\n \"clangd is a language server that provides IDE-like features to editors. \"\n \"\\n\\nIt should be used via an editor plugin rather than invoked directly.\"\n \"For more information, see:\"\n \"\\n\\thttps:\/\/clang.llvm.org\/extra\/clangd.html\"\n \"\\n\\thttps:\/\/microsoft.github.io\/language-server-protocol\/\");\n if (Test) {\n RunSynchronously = true;\n InputStyle = JSONStreamStyle::Delimited;\n PrettyPrint = true;\n }\n\n if (!RunSynchronously && WorkerThreadsCount == 0) {\n llvm::errs() << \"A number of worker threads cannot be 0. Did you mean to \"\n \"specify -run-synchronously?\";\n return 1;\n }\n\n if (RunSynchronously) {\n if (WorkerThreadsCount.getNumOccurrences())\n llvm::errs() << \"Ignoring -j because -run-synchronously is set.\\n\";\n WorkerThreadsCount = 0;\n }\n\n \/\/ Validate command line arguments.\n llvm::Optional<llvm::raw_fd_ostream> InputMirrorStream;\n if (!InputMirrorFile.empty()) {\n std::error_code EC;\n InputMirrorStream.emplace(InputMirrorFile, \/*ref*\/ EC,\n llvm::sys::fs::FA_Read | llvm::sys::fs::FA_Write);\n if (EC) {\n InputMirrorStream.reset();\n llvm::errs() << \"Error while opening an input mirror file: \"\n << EC.message();\n }\n }\n\n \/\/ Setup tracing facilities if CLANGD_TRACE is set. In practice enabling a\n \/\/ trace flag in your editor's config is annoying, launching with\n \/\/ `CLANGD_TRACE=trace.json vim` is easier.\n llvm::Optional<llvm::raw_fd_ostream> TraceStream;\n std::unique_ptr<trace::EventTracer> Tracer;\n if (auto *TraceFile = getenv(\"CLANGD_TRACE\")) {\n std::error_code EC;\n TraceStream.emplace(TraceFile, \/*ref*\/ EC,\n llvm::sys::fs::FA_Read | llvm::sys::fs::FA_Write);\n if (EC) {\n TraceStream.reset();\n llvm::errs() << \"Error while opening trace file \" << TraceFile << \": \"\n << EC.message();\n } else {\n Tracer = trace::createJSONTracer(*TraceStream, PrettyPrint);\n }\n }\n\n llvm::Optional<trace::Session> TracingSession;\n if (Tracer)\n TracingSession.emplace(*Tracer);\n\n JSONOutput Out(llvm::outs(), llvm::errs(), LogLevel,\n InputMirrorStream ? InputMirrorStream.getPointer() : nullptr,\n PrettyPrint);\n\n clangd::LoggingSession LoggingSession(Out);\n\n \/\/ If --compile-commands-dir arg was invoked, check value and override default\n \/\/ path.\n llvm::Optional<Path> CompileCommandsDirPath;\n if (CompileCommandsDir.empty()) {\n CompileCommandsDirPath = llvm::None;\n } else if (!llvm::sys::path::is_absolute(CompileCommandsDir) ||\n !llvm::sys::fs::exists(CompileCommandsDir)) {\n llvm::errs() << \"Path specified by --compile-commands-dir either does not \"\n \"exist or is not an absolute \"\n \"path. The argument will be ignored.\\n\";\n CompileCommandsDirPath = llvm::None;\n } else {\n CompileCommandsDirPath = CompileCommandsDir;\n }\n\n ClangdServer::Options Opts;\n switch (PCHStorage) {\n case PCHStorageFlag::Memory:\n Opts.StorePreamblesInMemory = true;\n break;\n case PCHStorageFlag::Disk:\n Opts.StorePreamblesInMemory = false;\n break;\n }\n if (!ResourceDir.empty())\n Opts.ResourceDir = ResourceDir;\n Opts.BuildDynamicSymbolIndex = EnableIndex;\n std::unique_ptr<SymbolIndex> StaticIdx;\n if (EnableIndex && !YamlSymbolFile.empty()) {\n StaticIdx = buildStaticIndex(YamlSymbolFile);\n Opts.StaticIndex = StaticIdx.get();\n }\n Opts.AsyncThreadsCount = WorkerThreadsCount;\n\n clangd::CodeCompleteOptions CCOpts;\n CCOpts.IncludeIneligibleResults = IncludeIneligibleResults;\n CCOpts.Limit = LimitResults;\n CCOpts.BundleOverloads = CompletionStyle != Detailed;\n CCOpts.ShowOrigins = ShowOrigins;\n if (!HeaderInsertionDecorators) {\n CCOpts.IncludeIndicator.Insert.clear();\n CCOpts.IncludeIndicator.NoInsert.clear();\n }\n\n \/\/ Initialize and run ClangdLSPServer.\n ClangdLSPServer LSPServer(\n Out, CCOpts, CompileCommandsDirPath,\n \/*ShouldUseInMemoryCDB=*\/CompileArgsFrom == LSPCompileArgs, Opts);\n constexpr int NoShutdownRequestErrorCode = 1;\n llvm::set_thread_name(\"clangd.main\");\n \/\/ Change stdin to binary to not lose \\r\\n on windows.\n llvm::sys::ChangeStdinToBinary();\n return LSPServer.run(stdin, InputStyle) ? 0 : NoShutdownRequestErrorCode;\n}\n<|endoftext|>"} {"text":"<commit_before><commit_msg>Fix size of symchronization state message for tracked vehicles<commit_after><|endoftext|>"} {"text":"<commit_before>#pragma once\r\n\/\/=====================================================================\/\/\r\n\/*!\t@file\r\n\t@brief\tGUI Widget View クラス @n\r\n\t\t\tカスタム描画・テンプレート\r\n\t@author\t平松邦仁 (hira@rvf-rc45.net)\r\n*\/\r\n\/\/=====================================================================\/\/\r\n#include \"gl_fw\/glutils.hpp\"\r\n#include \"widgets\/widget_director.hpp\"\r\n#include \"widgets\/widget_frame.hpp\"\r\n#include \"widgets\/widget_utils.hpp\"\r\n\r\nnamespace gui {\r\n\r\n\t\/\/+++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++\/\/\r\n\t\/*!\r\n\t\t@brief\tGUI widget_view クラス\r\n\t*\/\r\n\t\/\/+++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++\/\/\r\n\tstruct widget_view : public widget {\r\n\r\n\t\ttypedef widget_view value_type;\r\n\r\n\t\ttypedef std::function< void() > update_func_type;\r\n\t\ttypedef std::function< void() > render_func_type;\r\n\t\ttypedef std::function< void() > service_func_type;\r\n\r\n\t\t\/\/+++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++\/\/\r\n\t\t\/*!\r\n\t\t\t@brief\twidget_view パラメーター\r\n\t\t*\/\r\n\t\t\/\/+++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++\/\/\r\n\t\tstruct param {\r\n\r\n\t\t\tupdate_func_type\tupdate_func_;\r\n\t\t\trender_func_type\trender_func_;\r\n\t\t\tservice_func_type\tservice_func_;\r\n\r\n\t\t\tparam() { }\r\n\t\t};\r\n\r\n\tprivate:\r\n\t\twidget_director&\twd_;\r\n\r\n\t\tparam\t\t\t\tparam_;\r\n\r\n\tpublic:\r\n\t\t\/\/-----------------------------------------------------------------\/\/\r\n\t\t\/*!\r\n\t\t\t@brief\tコンストラクター\r\n\t\t*\/\r\n\t\t\/\/-----------------------------------------------------------------\/\/\r\n\t\twidget_view(widget_director& wd, const widget::param& bp, const param& p) :\r\n\t\t\twidget(bp), wd_(wd), param_(p) { }\r\n\r\n\r\n\t\t\/\/-----------------------------------------------------------------\/\/\r\n\t\t\/*!\r\n\t\t\t@brief\tデストラクター\r\n\t\t*\/\r\n\t\t\/\/-----------------------------------------------------------------\/\/\r\n\t\tvirtual ~widget_view() { }\r\n\r\n\r\n\t\t\/\/-----------------------------------------------------------------\/\/\r\n\t\t\/*!\r\n\t\t\t@brief\t型を取得\r\n\t\t*\/\r\n\t\t\/\/-----------------------------------------------------------------\/\/\r\n\t\ttype_id type() const override { return get_type_id<value_type>(); }\r\n\r\n\r\n\t\t\/\/-----------------------------------------------------------------\/\/\r\n\t\t\/*!\r\n\t\t\t@brief\twidget 型の基本名称を取得\r\n\t\t\t@return widget 型の基本名称\r\n\t\t*\/\r\n\t\t\/\/-----------------------------------------------------------------\/\/\r\n\t\tconst char* type_name() const override { return \"view\"; }\r\n\r\n\r\n\t\t\/\/-----------------------------------------------------------------\/\/\r\n\t\t\/*!\r\n\t\t\t@brief\tハイブリッド・ウィジェットのサイン\r\n\t\t\t@return ハイブリッド・ウィジェットの場合「true」を返す。\r\n\t\t*\/\r\n\t\t\/\/-----------------------------------------------------------------\/\/\r\n\t\tbool hybrid() const override { return false; }\r\n\r\n\r\n\t\t\/\/-----------------------------------------------------------------\/\/\r\n\t\t\/*!\r\n\t\t\t@brief\t個別パラメーターへの取得(ro)\r\n\t\t\t@return 個別パラメーター\r\n\t\t*\/\r\n\t\t\/\/-----------------------------------------------------------------\/\/\r\n\t\tconst param& get_local_param() const { return param_; }\r\n\r\n\r\n\t\t\/\/-----------------------------------------------------------------\/\/\r\n\t\t\/*!\r\n\t\t\t@brief\t個別パラメーターへの取得\r\n\t\t\t@return 個別パラメーター\r\n\t\t*\/\r\n\t\t\/\/-----------------------------------------------------------------\/\/\r\n\t\tparam& at_local_param() { return param_; }\r\n\r\n\r\n\t\t\/\/-----------------------------------------------------------------\/\/\r\n\t\t\/*!\r\n\t\t\t@brief\t初期化\r\n\t\t*\/\r\n\t\t\/\/-----------------------------------------------------------------\/\/\r\n\t\tvoid initialize() override\r\n\t\t{\r\n\t\t\t\/\/ 標準的に固定\r\n\t\t\tat_param().state_.set(widget::state::POSITION_LOCK);\r\n\t\t\tat_param().state_.set(widget::state::SIZE_LOCK);\r\n\t\t\tat_param().state_.set(widget::state::MOVE_ROOT);\r\n\t\t\tat_param().state_.set(widget::state::AREA_ROOT);\r\n\t\t}\r\n\r\n\r\n\t\t\/\/-----------------------------------------------------------------\/\/\r\n\t\t\/*!\r\n\t\t\t@brief\tアップデート\r\n\t\t*\/\r\n\t\t\/\/-----------------------------------------------------------------\/\/\r\n\t\tvoid update() override\r\n\t\t{\r\n\t\t\tif(get_param().parents_ && get_state(widget::state::AREA_ROOT)) {\r\n\t\t\t\tif(get_param().parents_->type() == get_type_id<widget_frame>()) {\r\n\t\t\t\t\twidget_frame* w = static_cast<widget_frame*>(at_param().parents_);\r\n\t\t\t\t\tw->get_draw_area(at_rect());\r\n\t\t\t\t}\r\n\t\t\t}\r\n\t\t\tif(param_.update_func_ != nullptr) param_.update_func_();\r\n\t\t}\r\n\r\n\r\n\t\t\/\/-----------------------------------------------------------------\/\/\r\n\t\t\/*!\r\n\t\t\t@brief\tレンダリング\r\n\t\t*\/\r\n\t\t\/\/-----------------------------------------------------------------\/\/\r\n\t\tvoid render() override\r\n\t\t{\r\n\t\t\tusing namespace gl;\r\n\t\t\tcore& core = core::get_instance();\r\n\t\t\tconst vtx::spos& vsz = core.get_size();\r\n\t\t\tconst vtx::spos& siz = core.get_rect().size;\r\n\t\t\tconst widget::param& wp = get_param();\r\n\r\n\t\t\tglPushMatrix();\r\n\r\n\t\t\tint sx = vsz.x \/ siz.x;\r\n\t\t\tint sy = vsz.y \/ siz.y;\r\n\t\t\tglViewport(wp.clip_.org.x * sx, vsz.y - wp.clip_.org.y * sy - wp.clip_.size.y * sy,\r\n\t\t\t\twp.clip_.size.x * sx, wp.clip_.size.y * sy);\r\n\t\t\twd_.at_mobj().setup_matrix(wp.clip_.size.x, wp.clip_.size.y);\r\n\r\n\t\t\tif(param_.render_func_ != nullptr) param_.render_func_();\r\n\t\t\t\r\n\t\t\tglPopMatrix();\r\n\t\t\tglViewport(0, 0, vsz.x, vsz.y);\r\n\t\t}\r\n\r\n\r\n\t\t\/\/-----------------------------------------------------------------\/\/\r\n\t\t\/*!\r\n\t\t\t@brief\tサービス\r\n\t\t*\/\r\n\t\t\/\/-----------------------------------------------------------------\/\/\r\n\t\tvoid service() override\r\n\t\t{\r\n\t\t\tif(param_.service_func_ != nullptr) param_.service_func_();\r\n\t\t}\r\n\r\n\r\n\t\t\/\/-----------------------------------------------------------------\/\/\r\n\t\t\/*!\r\n\t\t\t@brief\t状態のセーブ\r\n\t\t\t@param[in]\tpre\tプリファレンス参照\r\n\t\t\t@return エラーが無い場合「true」\r\n\t\t*\/\r\n\t\t\/\/-----------------------------------------------------------------\/\/\r\n\t\tbool save(sys::preference& pre) override\r\n\t\t{\r\n\t\t\treturn true;\r\n\t\t}\r\n\r\n\r\n\t\t\/\/-----------------------------------------------------------------\/\/\r\n\t\t\/*!\r\n\t\t\t@brief\t状態のロード\r\n\t\t\t@param[in]\tpre\tプリファレンス参照\r\n\t\t\t@return エラーが無い場合「true」\r\n\t\t*\/\r\n\t\t\/\/-----------------------------------------------------------------\/\/\r\n\t\tbool load(const sys::preference& pre) override\r\n\t\t{\r\n\t\t\treturn true;\r\n\t\t}\r\n\t};\r\n}\r\n<commit_msg>update render func<commit_after>#pragma once\r\n\/\/=====================================================================\/\/\r\n\/*!\t@file\r\n\t@brief\tGUI Widget View クラス @n\r\n\t\t\tカスタム描画・テンプレート\r\n\t@author\t平松邦仁 (hira@rvf-rc45.net)\r\n*\/\r\n\/\/=====================================================================\/\/\r\n#include \"gl_fw\/glutils.hpp\"\r\n#include \"widgets\/widget_director.hpp\"\r\n#include \"widgets\/widget_frame.hpp\"\r\n#include \"widgets\/widget_utils.hpp\"\r\n\r\nnamespace gui {\r\n\r\n\t\/\/+++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++\/\/\r\n\t\/*!\r\n\t\t@brief\tGUI widget_view クラス\r\n\t*\/\r\n\t\/\/+++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++\/\/\r\n\tstruct widget_view : public widget {\r\n\r\n\t\ttypedef widget_view value_type;\r\n\r\n\t\ttypedef std::function< void() > update_func_type;\r\n\t\ttypedef std::function< void(const vtx::spos& size) > render_func_type;\r\n\t\ttypedef std::function< void() > service_func_type;\r\n\r\n\t\t\/\/+++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++\/\/\r\n\t\t\/*!\r\n\t\t\t@brief\twidget_view パラメーター\r\n\t\t*\/\r\n\t\t\/\/+++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++\/\/\r\n\t\tstruct param {\r\n\r\n\t\t\tupdate_func_type\tupdate_func_;\r\n\t\t\trender_func_type\trender_func_;\r\n\t\t\tservice_func_type\tservice_func_;\r\n\r\n\t\t\tparam() { }\r\n\t\t};\r\n\r\n\tprivate:\r\n\t\twidget_director&\twd_;\r\n\r\n\t\tparam\t\t\t\tparam_;\r\n\r\n\tpublic:\r\n\t\t\/\/-----------------------------------------------------------------\/\/\r\n\t\t\/*!\r\n\t\t\t@brief\tコンストラクター\r\n\t\t*\/\r\n\t\t\/\/-----------------------------------------------------------------\/\/\r\n\t\twidget_view(widget_director& wd, const widget::param& bp, const param& p) :\r\n\t\t\twidget(bp), wd_(wd), param_(p) { }\r\n\r\n\r\n\t\t\/\/-----------------------------------------------------------------\/\/\r\n\t\t\/*!\r\n\t\t\t@brief\tデストラクター\r\n\t\t*\/\r\n\t\t\/\/-----------------------------------------------------------------\/\/\r\n\t\tvirtual ~widget_view() { }\r\n\r\n\r\n\t\t\/\/-----------------------------------------------------------------\/\/\r\n\t\t\/*!\r\n\t\t\t@brief\t型を取得\r\n\t\t*\/\r\n\t\t\/\/-----------------------------------------------------------------\/\/\r\n\t\ttype_id type() const override { return get_type_id<value_type>(); }\r\n\r\n\r\n\t\t\/\/-----------------------------------------------------------------\/\/\r\n\t\t\/*!\r\n\t\t\t@brief\twidget 型の基本名称を取得\r\n\t\t\t@return widget 型の基本名称\r\n\t\t*\/\r\n\t\t\/\/-----------------------------------------------------------------\/\/\r\n\t\tconst char* type_name() const override { return \"view\"; }\r\n\r\n\r\n\t\t\/\/-----------------------------------------------------------------\/\/\r\n\t\t\/*!\r\n\t\t\t@brief\tハイブリッド・ウィジェットのサイン\r\n\t\t\t@return ハイブリッド・ウィジェットの場合「true」を返す。\r\n\t\t*\/\r\n\t\t\/\/-----------------------------------------------------------------\/\/\r\n\t\tbool hybrid() const override { return false; }\r\n\r\n\r\n\t\t\/\/-----------------------------------------------------------------\/\/\r\n\t\t\/*!\r\n\t\t\t@brief\t個別パラメーターへの取得(ro)\r\n\t\t\t@return 個別パラメーター\r\n\t\t*\/\r\n\t\t\/\/-----------------------------------------------------------------\/\/\r\n\t\tconst param& get_local_param() const { return param_; }\r\n\r\n\r\n\t\t\/\/-----------------------------------------------------------------\/\/\r\n\t\t\/*!\r\n\t\t\t@brief\t個別パラメーターへの取得\r\n\t\t\t@return 個別パラメーター\r\n\t\t*\/\r\n\t\t\/\/-----------------------------------------------------------------\/\/\r\n\t\tparam& at_local_param() { return param_; }\r\n\r\n\r\n\t\t\/\/-----------------------------------------------------------------\/\/\r\n\t\t\/*!\r\n\t\t\t@brief\t初期化\r\n\t\t*\/\r\n\t\t\/\/-----------------------------------------------------------------\/\/\r\n\t\tvoid initialize() override\r\n\t\t{\r\n\t\t\t\/\/ 標準的に固定\r\n\t\t\tat_param().state_.set(widget::state::POSITION_LOCK);\r\n\t\t\tat_param().state_.set(widget::state::SIZE_LOCK);\r\n\t\t\tat_param().state_.set(widget::state::MOVE_ROOT);\r\n\t\t\tat_param().state_.set(widget::state::AREA_ROOT);\r\n\t\t}\r\n\r\n\r\n\t\t\/\/-----------------------------------------------------------------\/\/\r\n\t\t\/*!\r\n\t\t\t@brief\tアップデート\r\n\t\t*\/\r\n\t\t\/\/-----------------------------------------------------------------\/\/\r\n\t\tvoid update() override\r\n\t\t{\r\n\t\t\tif(get_param().parents_ && get_state(widget::state::AREA_ROOT)) {\r\n\t\t\t\tif(get_param().parents_->type() == get_type_id<widget_frame>()) {\r\n\t\t\t\t\twidget_frame* w = static_cast<widget_frame*>(at_param().parents_);\r\n\t\t\t\t\tw->get_draw_area(at_rect());\r\n\t\t\t\t}\r\n\t\t\t}\r\n\t\t\tif(param_.update_func_ != nullptr) param_.update_func_();\r\n\t\t}\r\n\r\n\r\n\t\t\/\/-----------------------------------------------------------------\/\/\r\n\t\t\/*!\r\n\t\t\t@brief\tレンダリング\r\n\t\t*\/\r\n\t\t\/\/-----------------------------------------------------------------\/\/\r\n\t\tvoid render() override\r\n\t\t{\r\n\t\t\tusing namespace gl;\r\n\t\t\tcore& core = core::get_instance();\r\n\t\t\tconst vtx::spos& vsz = core.get_size();\r\n\t\t\tconst vtx::spos& siz = core.get_rect().size;\r\n\t\t\tconst widget::param& wp = get_param();\r\n\r\n\t\t\tglPushMatrix();\r\n\r\n\t\t\tint sx = vsz.x \/ siz.x;\r\n\t\t\tint sy = vsz.y \/ siz.y;\r\n\t\t\tglViewport(wp.clip_.org.x * sx, vsz.y - wp.clip_.org.y * sy - wp.clip_.size.y * sy,\r\n\t\t\t\twp.clip_.size.x * sx, wp.clip_.size.y * sy);\r\n\t\t\twd_.at_mobj().setup_matrix(wp.clip_.size.x, wp.clip_.size.y);\r\n\r\n\t\t\tif(param_.render_func_ != nullptr) param_.render_func_(wp.clip_.size);\r\n\t\t\t\r\n\t\t\tglPopMatrix();\r\n\t\t\tglViewport(0, 0, vsz.x, vsz.y);\r\n\t\t}\r\n\r\n\r\n\t\t\/\/-----------------------------------------------------------------\/\/\r\n\t\t\/*!\r\n\t\t\t@brief\tサービス\r\n\t\t*\/\r\n\t\t\/\/-----------------------------------------------------------------\/\/\r\n\t\tvoid service() override\r\n\t\t{\r\n\t\t\tif(param_.service_func_ != nullptr) param_.service_func_();\r\n\t\t}\r\n\r\n\r\n\t\t\/\/-----------------------------------------------------------------\/\/\r\n\t\t\/*!\r\n\t\t\t@brief\t状態のセーブ\r\n\t\t\t@param[in]\tpre\tプリファレンス参照\r\n\t\t\t@return エラーが無い場合「true」\r\n\t\t*\/\r\n\t\t\/\/-----------------------------------------------------------------\/\/\r\n\t\tbool save(sys::preference& pre) override\r\n\t\t{\r\n\t\t\treturn true;\r\n\t\t}\r\n\r\n\r\n\t\t\/\/-----------------------------------------------------------------\/\/\r\n\t\t\/*!\r\n\t\t\t@brief\t状態のロード\r\n\t\t\t@param[in]\tpre\tプリファレンス参照\r\n\t\t\t@return エラーが無い場合「true」\r\n\t\t*\/\r\n\t\t\/\/-----------------------------------------------------------------\/\/\r\n\t\tbool load(const sys::preference& pre) override\r\n\t\t{\r\n\t\t\treturn true;\r\n\t\t}\r\n\t};\r\n}\r\n<|endoftext|>"} {"text":"<commit_before>#ifndef INCLUDE_AL_BUFFER_HPP\n#define INCLUDE_AL_BUFFER_HPP\n\n\/*\tAllocore --\n\tMultimedia \/ virtual environment application class library\n\t\n\tCopyright (C) 2009. AlloSphere Research Group, Media Arts & Technology, UCSB.\n\tCopyright (C) 2012. The Regents of the University of California.\n\tAll rights reserved.\n\n\tRedistribution and use in source and binary forms, with or without \n\tmodification, are permitted provided that the following conditions are met:\n\n\t\tRedistributions of source code must retain the above copyright notice, \n\t\tthis list of conditions and the following disclaimer.\n\n\t\tRedistributions in binary form must reproduce the above copyright \n\t\tnotice, this list of conditions and the following disclaimer in the \n\t\tdocumentation and\/or other materials provided with the distribution.\n\n\t\tNeither the name of the University of California nor the names of its \n\t\tcontributors may be used to endorse or promote products derived from \n\t\tthis software without specific prior written permission.\n\n\tTHIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS \"AS IS\" \n\tAND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE \n\tIMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE \n\tARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE \n\tLIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR\n\tCONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF \n\tSUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS \n\tINTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN \n\tCONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) \n\tARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE \n\tPOSSIBILITY OF SUCH DAMAGE.\n\n\n\tFile description:\n\tVariably sized one-dimensional array\n\n\tFile author(s):\n\tLance Putnam, 2010, putnam.lance@gmail.com\n*\/\n\n#include <algorithm>\n#include <vector>\n\nnamespace al{\n\n\/\/\/ Buffer\n\n\/\/\/ This buffer automatically expands itself as new elements are added.\n\/\/\/ Additionally, its logical size can be reduced without triggering memory \n\/\/\/ deallocations.\ntemplate <class T, class Alloc=std::allocator<T> >\nclass Buffer : protected Alloc{\n\ttypedef Alloc super;\npublic:\n\n\t\/\/\/ @param[in] size\t\t\tInitial size\n\texplicit Buffer(int size=0)\n\t:\tmElems(size), mSize(size)\n\t{}\n\n\t\/\/\/ @param[in] size\t\t\tInitial size\n\t\/\/\/ @param[in] capacity\t\tInitial capacity\n\tBuffer(int size, int capacity)\n\t:\tmElems(capacity), mSize(size)\n\t{}\n\n\t~Buffer(){}\n\n\n\tint capacity() const { return mElems.size(); }\t\t\/\/\/< Returns total capacity\n\tint size() const { return mSize; }\t\t\t\t\t\/\/\/< Returns size\n\tconst T * elems() const { return &mElems[0]; }\t\t\/\/\/< Returns C pointer to elements\n\tT * elems(){ return &mElems[0]; }\t\t\t\t\t\/\/\/< Returns C pointer to elements\n\n\n\t\/\/\/ Get element at index\n\tT& operator[](int i){ return mElems[i]; }\n\t\n\t\/\/\/ Get element at index (read-only)\n\tconst T& operator[](int i) const { return mElems[i]; }\n\n\t\/\/\/ Assign value to elements\n\n\t\/\/\/ This function fills a Buffer with n copies of the given value. Note that\n\t\/\/\/ the assignment completely changes the buffer and that the resulting size\n\t\/\/\/ is the same as the number of elements assigned. Old data may be lost.\n\tvoid assign(int n, const T& v){ mElems.assign(n,v); }\n\n\t\/\/\/ Get last element\n\tT& last(){ return mElems[size()-1]; }\n\tconst T& last() const { return mElems[size()-1]; }\n\n\t\/\/\/ Resets size to zero without deallocating allocated memory\n\tvoid reset(){ mSize=0; }\n\n\t\/\/\/ Resize buffer\n\t\n\t\/\/\/ This will set both the size and capacity of the buffer to the requested \n\t\/\/\/ size. If the number is smaller than the current size the buffer is \n\t\/\/\/ truncated, otherwise the buffer is extended and new elements are\n\t\/\/\/ default-constructed.\n\tvoid resize(int n){\n\t\tmElems.resize(n);\n\t\tsetSize(n);\n\t}\n\t\n\t\/\/\/ Set size of buffer\n\t\n\t\/\/\/ If the requested size is larger than the current capacity, then the \n\t\/\/\/ buffer will be resized.\n\tvoid size(int n){\n\t\tif(capacity() < n) resize(n);\n\t\telse setSize(n);\n\t}\n\n\t\/\/\/ Appends element to end of buffer growing its size if necessary\n\tvoid append(const T& v, double growFactor=2){\n\t\n\t\t\/\/ Grow array if too small\n\t\tif(size() >= capacity()){\n\t\t\t\/\/ Copy argument since it may be an element in current memory range\n\t\t\t\/\/ which may become invalid after the resize.\n\t\t\tconst T vsafecopy = v;\n\t\t\tmElems.resize((size() ? size() : 4)*growFactor);\n\t\t\tsuper::construct(elems()+size(), vsafecopy);\n\t\t}\n\t\telse{\n\t\t\tsuper::construct(elems()+size(), v);\n\t\t}\n\t\t++mSize;\n\t}\n\t\/\/\/ synonym for append():\n\tvoid push_back(const T& v, double growFactor=2) { append(v, growFactor); }\t\n\n\t\/\/\/ Append elements of another Buffer\n\t\n\t\/\/\/ Note: not safe to apply this to itself\n\t\/\/\/\n\tvoid append(const Buffer<T>& src){\n\t\tappend(src.elems(), src.size());\n\t}\n\n\t\/\/\/ Append elements of an array\n\tvoid append(const T * src, int len){\n\t\tint oldsize = size();\n\t\tsize(size() + len);\n\t\tstd::copy(src, src + len, mElems.begin() + oldsize);\n\t}\n\t\n\t\/\/\/ Repeat last element\n\tvoid repeatLast(){ append(last()); }\n\n\n\t\/\/\/ Insert new elements after each existing element\n\t\n\t\/\/\/ @param[in] n\tExpansion factor; new size is n times old size\n\t\/\/\/ @param[in] dup\tIf true, new elements are duplicates of existing elements.\n\t\/\/\/\t\t\t\t\tIf false, new elements are default constructed.\n\ttemplate <int n, bool dup>\n\tvoid expand(){\n\t\tsize(size()*n);\n\t\tconst int Nd = dup ? n : 1;\n\t\tfor(int i=size()\/n-1; i>=0; --i){\n\t\t\tconst T& v = (*this)[i];\n\t\t\tfor(int j=0; j<Nd; ++j) Alloc::construct(elems()+n*i+j, v);\n\t\t}\n\t}\n\nprivate:\n\tstd::vector<T, Alloc> mElems;\n\tint mSize;\t\t\/\/ logical size array\n\n\tvoid setSize(int n){ mSize=n; }\n};\n\n\n\n\n\/\/\/ Ring buffer\n\n\/\/\/ This buffer allows potentially large amounts of data to be buffered without\n\/\/\/ moving memory. This is accomplished by use of a moving write tap.\ntemplate <class T, class Alloc=std::allocator<T> >\nclass RingBuffer : protected Alloc {\npublic:\n\n\t\/\/\/ Default constructor; does not allocate memory\n\tRingBuffer(): mPos(-1){}\n\t\n\t\/\/\/ @param[in] size\t\tnumber of elements\n\t\/\/\/ @param[in] v\t\tvalue to initialize elements to\n\texplicit RingBuffer(unsigned size, const T& v=T()){\n\t\tresize(size,v);\n\t}\n\n\t\/\/\/ Get number of elements\n\tint size() const { return mElems.size(); }\n\t\n\t\/\/\/ Get absolute index of most recently written element\n\tint pos() const { return mPos; }\n\n\n\t\/\/\/ Get element at absolute index\n\tT& operator[](int i){ return mElems[i]; }\n\t\n\t\/\/\/ Get element at absolute index (read-only)\n\tconst T& operator[](int i) const { return mElems[i]; }\n\n\n\t\/\/\/ Write new element\n\tvoid write(const T& v){\n\t\t++mPos; if(pos() == size()){ mPos=0; }\n\t\tAlloc::construct(&mElems[0] + pos(), v);\n\t}\n\n\t\/\/\/ Get reference to element relative to newest element\n\tT& read(int i){ return mElems[wrapOnce(pos()-i, size())]; }\n\n\t\/\/\/ Get reference to element relative to newest element (read-only)\n\tconst T& read(int i) const { return mElems[wrapOnce(pos()-i, size())]; }\n\n\n\t\/\/\/ Resize buffer\n\t\n\t\/\/\/ @param[in] n\tnumber of elements\n\t\/\/\/ @param[in] v\tinitialization value of newly allocated elements\n\tvoid resize(int n, const T& v=T()){\n\t\tmElems.resize(n,v);\n\t\tif(mPos >=n) mPos = n-1;\n\t}\n\nprotected:\n\tstd::vector<T, Alloc> mElems;\n\tint mPos;\n\n\t\/\/ Moves value one period closer to interval [0, max)\n\tstatic int wrapOnce(int v, int max){\n\t\tif(v < 0) return v+max;\n\t\tif(v >= max) return v-max;\n\t\treturn v;\n\t}\n};\n\n\n\n\/\/\/ Constant size shift buffer\n\n\/\/\/ This is a first-in, first-out buffer with a constant number of elements.\n\/\/\/ Adding new elements to the buffer physically moves existing elements. The\n\/\/\/ advantage of moving memory like this is that elements stay logically ordered\n\/\/\/ making access faster and operating on the history easier.\ntemplate <int N, class T>\nclass ShiftBuffer{\npublic:\n\n\t\/\/\/ @param[in] v\tValue to initialize all elements to\n\tShiftBuffer(const T& v=T()){ assign(v); }\n\n\t\/\/\/ Get number of elements\n\tstatic int size(){ return N; }\n\n\t\/\/\/ Get pointer to elements (read-only)\n\tconst T * elems() const { return &mElems[0]; }\n\t\n\t\/\/\/ Get pointer to elements\n\tT * elems(){ return &mElems[0]; }\n\n\t\/\/\/ Get reference to element at index\n\tT& operator[](int i){ return mElems[i];}\n\t\n\t\/\/\/ Get reference to element at index (read-only)\n\tconst T& operator[](int i) const { return mElems[i]; }\n\n\n\t\/\/\/ Push new element onto buffer. Newest element is at index 0.\n\tvoid operator()(const T& v){\n\t\tfor(int i=N-1; i>0; --i) mElems[i] = mElems[i-1];\n\t\tmElems[0]=v;\n\t}\n\n\n\t\/\/\/ Set all elements to argument\n\tvoid assign(const T& v){ for(int i=0;i<N;++i) mElems[i]=v; }\n\n\t\/\/\/ Zero bytes of all elements\n\tvoid zero(){ memset(mElems, 0, N * sizeof(T)); }\n\nprotected:\n\tT mElems[N];\n};\n\n\n\n} \/\/ al::\n\n#endif\n<commit_msg>Add newest and readFrom methods to RingBuffer<commit_after>#ifndef INCLUDE_AL_BUFFER_HPP\n#define INCLUDE_AL_BUFFER_HPP\n\n\/*\tAllocore --\n\tMultimedia \/ virtual environment application class library\n\t\n\tCopyright (C) 2009. AlloSphere Research Group, Media Arts & Technology, UCSB.\n\tCopyright (C) 2012. The Regents of the University of California.\n\tAll rights reserved.\n\n\tRedistribution and use in source and binary forms, with or without \n\tmodification, are permitted provided that the following conditions are met:\n\n\t\tRedistributions of source code must retain the above copyright notice, \n\t\tthis list of conditions and the following disclaimer.\n\n\t\tRedistributions in binary form must reproduce the above copyright \n\t\tnotice, this list of conditions and the following disclaimer in the \n\t\tdocumentation and\/or other materials provided with the distribution.\n\n\t\tNeither the name of the University of California nor the names of its \n\t\tcontributors may be used to endorse or promote products derived from \n\t\tthis software without specific prior written permission.\n\n\tTHIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS \"AS IS\" \n\tAND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE \n\tIMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE \n\tARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE \n\tLIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR\n\tCONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF \n\tSUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS \n\tINTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN \n\tCONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) \n\tARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE \n\tPOSSIBILITY OF SUCH DAMAGE.\n\n\n\tFile description:\n\tVariably sized one-dimensional array\n\n\tFile author(s):\n\tLance Putnam, 2010, putnam.lance@gmail.com\n*\/\n\n#include <algorithm>\n#include <vector>\n\nnamespace al{\n\n\/\/\/ Buffer\n\n\/\/\/ This buffer automatically expands itself as new elements are added.\n\/\/\/ Additionally, its logical size can be reduced without triggering memory \n\/\/\/ deallocations.\ntemplate <class T, class Alloc=std::allocator<T> >\nclass Buffer : protected Alloc{\n\ttypedef Alloc super;\npublic:\n\n\t\/\/\/ @param[in] size\t\t\tInitial size\n\texplicit Buffer(int size=0)\n\t:\tmElems(size), mSize(size)\n\t{}\n\n\t\/\/\/ @param[in] size\t\t\tInitial size\n\t\/\/\/ @param[in] capacity\t\tInitial capacity\n\tBuffer(int size, int capacity)\n\t:\tmElems(capacity), mSize(size)\n\t{}\n\n\t~Buffer(){}\n\n\n\tint capacity() const { return mElems.size(); }\t\t\/\/\/< Returns total capacity\n\tint size() const { return mSize; }\t\t\t\t\t\/\/\/< Returns size\n\tconst T * elems() const { return &mElems[0]; }\t\t\/\/\/< Returns C pointer to elements\n\tT * elems(){ return &mElems[0]; }\t\t\t\t\t\/\/\/< Returns C pointer to elements\n\n\n\t\/\/\/ Get element at index\n\tT& operator[](int i){ return mElems[i]; }\n\t\n\t\/\/\/ Get element at index (read-only)\n\tconst T& operator[](int i) const { return mElems[i]; }\n\n\t\/\/\/ Assign value to elements\n\n\t\/\/\/ This function fills a Buffer with n copies of the given value. Note that\n\t\/\/\/ the assignment completely changes the buffer and that the resulting size\n\t\/\/\/ is the same as the number of elements assigned. Old data may be lost.\n\tvoid assign(int n, const T& v){ mElems.assign(n,v); }\n\n\t\/\/\/ Get last element\n\tT& last(){ return mElems[size()-1]; }\n\tconst T& last() const { return mElems[size()-1]; }\n\n\t\/\/\/ Resets size to zero without deallocating allocated memory\n\tvoid reset(){ mSize=0; }\n\n\t\/\/\/ Resize buffer\n\t\n\t\/\/\/ This will set both the size and capacity of the buffer to the requested \n\t\/\/\/ size. If the number is smaller than the current size the buffer is \n\t\/\/\/ truncated, otherwise the buffer is extended and new elements are\n\t\/\/\/ default-constructed.\n\tvoid resize(int n){\n\t\tmElems.resize(n);\n\t\tsetSize(n);\n\t}\n\t\n\t\/\/\/ Set size of buffer\n\t\n\t\/\/\/ If the requested size is larger than the current capacity, then the \n\t\/\/\/ buffer will be resized.\n\tvoid size(int n){\n\t\tif(capacity() < n) resize(n);\n\t\telse setSize(n);\n\t}\n\n\t\/\/\/ Appends element to end of buffer growing its size if necessary\n\tvoid append(const T& v, double growFactor=2){\n\t\n\t\t\/\/ Grow array if too small\n\t\tif(size() >= capacity()){\n\t\t\t\/\/ Copy argument since it may be an element in current memory range\n\t\t\t\/\/ which may become invalid after the resize.\n\t\t\tconst T vsafecopy = v;\n\t\t\tmElems.resize((size() ? size() : 4)*growFactor);\n\t\t\tsuper::construct(elems()+size(), vsafecopy);\n\t\t}\n\t\telse{\n\t\t\tsuper::construct(elems()+size(), v);\n\t\t}\n\t\t++mSize;\n\t}\n\t\/\/\/ synonym for append():\n\tvoid push_back(const T& v, double growFactor=2) { append(v, growFactor); }\t\n\n\t\/\/\/ Append elements of another Buffer\n\t\n\t\/\/\/ Note: not safe to apply this to itself\n\t\/\/\/\n\tvoid append(const Buffer<T>& src){\n\t\tappend(src.elems(), src.size());\n\t}\n\n\t\/\/\/ Append elements of an array\n\tvoid append(const T * src, int len){\n\t\tint oldsize = size();\n\t\tsize(size() + len);\n\t\tstd::copy(src, src + len, mElems.begin() + oldsize);\n\t}\n\t\n\t\/\/\/ Repeat last element\n\tvoid repeatLast(){ append(last()); }\n\n\n\t\/\/\/ Insert new elements after each existing element\n\t\n\t\/\/\/ @param[in] n\tExpansion factor; new size is n times old size\n\t\/\/\/ @param[in] dup\tIf true, new elements are duplicates of existing elements.\n\t\/\/\/\t\t\t\t\tIf false, new elements are default constructed.\n\ttemplate <int n, bool dup>\n\tvoid expand(){\n\t\tsize(size()*n);\n\t\tconst int Nd = dup ? n : 1;\n\t\tfor(int i=size()\/n-1; i>=0; --i){\n\t\t\tconst T& v = (*this)[i];\n\t\t\tfor(int j=0; j<Nd; ++j) Alloc::construct(elems()+n*i+j, v);\n\t\t}\n\t}\n\nprivate:\n\tstd::vector<T, Alloc> mElems;\n\tint mSize;\t\t\/\/ logical size array\n\n\tvoid setSize(int n){ mSize=n; }\n};\n\n\n\n\n\/\/\/ Ring buffer\n\n\/\/\/ This buffer allows potentially large amounts of data to be buffered without\n\/\/\/ moving memory. This is accomplished by use of a moving write tap.\ntemplate <class T, class Alloc=std::allocator<T> >\nclass RingBuffer : protected Alloc {\npublic:\n\n\t\/\/\/ Default constructor; does not allocate memory\n\tRingBuffer(): mPos(-1), mFill(0){}\n\t\n\t\/\/\/ @param[in] size\t\tnumber of elements\n\t\/\/\/ @param[in] v\t\tvalue to initialize elements to\n\texplicit RingBuffer(unsigned size, const T& v=T())\n\t:\tmPos(size), mFill(0)\n\t{\n\t\tresize(size,v);\n\t}\n\n\n\t\/\/\/ Get number of elements\n\tint size() const { return mElems.size(); }\n\t\n\t\/\/\/ Get absolute index of most recently written element\n\tint pos() const { return mPos; }\n\n\t\/\/\/ Get fill amount of buffer\n\tint fill() const { return mFill; }\n\n\n\t\/\/\/ Get element at absolute index\n\tT& operator[](int i){ return mElems[i]; }\n\t\n\t\/\/\/ Get element at absolute index (read-only)\n\tconst T& operator[](int i) const { return mElems[i]; }\n\n\n\t\/\/\/ Write new element\n\tvoid write(const T& v){\n\t\tif(mFill < size()) ++mFill;\n\t\t++mPos; if(pos() == size()){ mPos=0; }\n\t\tAlloc::construct(&mElems[0] + pos(), v);\n\t}\n\n\t\/\/\/ Get reference to element relative to newest element\n\tT& read(int i){ return mElems[wrapOnce(pos()-i, size())]; }\n\n\t\/\/\/ Get reference to element relative to newest element (read-only)\n\tconst T& read(int i) const { return readFrom(pos(), i); }\n\n\t\/\/\/ Get reference to older element relative to some newer element (read-only)\n\t\n\t\/\/\/ @param[in] from\t\tabsolute index the read is relative to\n\t\/\/\/ @param[in] dist\t\tdistance into past relative to 'from' of the returned element\n\tconst T& readFrom(int from, int dist) const {\n\t\treturn mElems[wrapOnce(from-dist, size())];\n\t}\n\n\t\/\/\/ \\returns reference to newest element\n\tT& newest(){ return mElems[pos()]; }\n\n\t\/\/\/ \\returns reference to newest element (read-only)\n\tconst T& newest() const { return mElems[pos()]; }\n\n\n\t\/\/\/ Resize buffer\n\t\n\t\/\/\/ @param[in] n\tnumber of elements\n\t\/\/\/ @param[in] v\tinitialization value of newly allocated elements\n\tvoid resize(int n, const T& v=T()){\n\t\tmElems.resize(n,v);\n\t\tif(mPos >=n) mPos = n-1;\n\t}\n\nprotected:\n\tstd::vector<T, Alloc> mElems;\n\tint mPos;\n\tint mFill;\n\n\t\/\/ Moves value one period closer to interval [0, max)\n\tstatic int wrapOnce(int v, int max){\n\t\tif(v < 0) return v+max;\n\t\tif(v >= max) return v-max;\n\t\treturn v;\n\t}\n};\n\n\n\n\/\/\/ Constant size shift buffer\n\n\/\/\/ This is a first-in, first-out buffer with a constant number of elements.\n\/\/\/ Adding new elements to the buffer physically moves existing elements. The\n\/\/\/ advantage of moving memory like this is that elements stay logically ordered\n\/\/\/ making access faster and operating on the history easier.\ntemplate <int N, class T>\nclass ShiftBuffer{\npublic:\n\n\t\/\/\/ @param[in] v\tValue to initialize all elements to\n\tShiftBuffer(const T& v=T()){ assign(v); }\n\n\t\/\/\/ Get number of elements\n\tstatic int size(){ return N; }\n\n\t\/\/\/ Get pointer to elements (read-only)\n\tconst T * elems() const { return &mElems[0]; }\n\t\n\t\/\/\/ Get pointer to elements\n\tT * elems(){ return &mElems[0]; }\n\n\t\/\/\/ Get reference to element at index\n\tT& operator[](int i){ return mElems[i];}\n\t\n\t\/\/\/ Get reference to element at index (read-only)\n\tconst T& operator[](int i) const { return mElems[i]; }\n\n\n\t\/\/\/ Push new element onto buffer. Newest element is at index 0.\n\tvoid operator()(const T& v){\n\t\tfor(int i=N-1; i>0; --i) mElems[i] = mElems[i-1];\n\t\tmElems[0]=v;\n\t}\n\n\n\t\/\/\/ Set all elements to argument\n\tvoid assign(const T& v){ for(int i=0;i<N;++i) mElems[i]=v; }\n\n\t\/\/\/ Zero bytes of all elements\n\tvoid zero(){ memset(mElems, 0, N * sizeof(T)); }\n\nprotected:\n\tT mElems[N];\n};\n\n\n\n} \/\/ al::\n\n#endif\n<|endoftext|>"} {"text":"<commit_before>\/* =======================================================================\n Copyright (c) 2012, Institute for Microelectronics,\n Institute for Analysis and Scientific Computing,\n TU Wien.\n -----------------\n ViennaMath - Symbolic and Numerical Math in C++\n -----------------\n\n Author: Karl Rupp rupp@iue.tuwien.ac.at\n\n License: MIT (X11), see file LICENSE in the ViennaMath base directory\n======================================================================= *\/\n\n\n\/\/ remove assert() statements and the like in order to get reasonable performance\n#ifndef NDEBUG\n #define NDEBUG\n#endif\n\n#include <iostream>\n#include <vector>\n#include <stdlib.h>\n#include <assert.h>\n\n\/\/ ViennaFEM includes:\n#include \"viennafem\/forwards.h\"\n#include \"viennafem\/fem.hpp\"\n#include \"viennafem\/io\/vtk_writer.hpp\"\n\n\/\/ ViennaGrid includes:\n#include \"viennagrid\/domain.hpp\"\n#include \"viennagrid\/config\/others.hpp\"\n#include \"viennagrid\/io\/netgen_reader.hpp\"\n#include \"viennagrid\/io\/vtk_writer.hpp\"\n\n\/\/ ViennaData includes:\n#include \"viennadata\/api.hpp\"\n\n#include \"viennamath\/expression.hpp\"\n#include \"viennamath\/manipulation\/eval.hpp\"\n#include \"viennamath\/manipulation\/substitute.hpp\"\n#include \"viennamath\/manipulation\/diff.hpp\"\n\n#include \"viennamath\/runtime\/equation.hpp\"\n#include \"viennamath\/manipulation\/apply_coordinate_system.hpp\"\n\n\/\/ Boost.uBLAS includes:\n#include <boost\/numeric\/ublas\/io.hpp>\n#include <boost\/numeric\/ublas\/matrix_sparse.hpp>\n#include <boost\/numeric\/ublas\/matrix.hpp>\n#include <boost\/numeric\/ublas\/operation.hpp>\n#include <boost\/numeric\/ublas\/operation_sparse.hpp>\n\n\n\/\/ViennaCL includes:\n#ifndef VIENNACL_HAVE_UBLAS\n #define VIENNACL_HAVE_UBLAS\n#endif\n \n#include \"viennacl\/linalg\/bicgstab.hpp\"\n#include \"viennacl\/linalg\/norm_2.hpp\"\n#include \"viennacl\/linalg\/prod.hpp\"\n\nusing namespace viennamath;\n\n\/\/\n\/\/ The strain tensor: eps_ij = 0.5 * (du_i\/dx_j + du_j\/dx_i)\n\/\/ \ntemplate <typename InterfaceType>\nstd::vector< rt_expr<InterfaceType> > strain_tensor(std::vector< rt_function_symbol<InterfaceType> > const & u)\n{\n typedef rt_variable<InterfaceType> Variable;\n \n \/\/\n \/\/ a 3x3 matrix representing the strain tensor\n \/\/\n std::vector< rt_expr<InterfaceType> > result(9);\n \n Variable x(0);\n Variable y(1);\n Variable z(2);\n \n \/\/first row:\n result[0] = diff(u[0], x);\n result[1] = 0.5 * (diff(u[0], y) + diff(u[1], x));\n result[2] = 0.5 * (diff(u[0], z) + diff(u[2], x));\n \n \/\/second row:\n result[3] = 0.5 * (diff(u[1], x) + diff(u[0], y));\n result[4] = diff(u[1], y);\n result[5] = 0.5 * (diff(u[1], z) + diff(u[2], y));\n\n \/\/third row:\n result[6] = 0.5 * (diff(u[2], x) + diff(u[0], z));\n result[7] = 0.5 * (diff(u[2], y) + diff(u[1], z));\n result[8] = diff(u[2], z);\n\n return result;\n}\n\n\n\/\/\n\/\/ The stress tensor: sigma = 2 \\mu eps + \\lambda trace(eps) Id for St. Venent-Kirchhoff material\n\/\/ can be replaced with other expressions for plasticity and the like\n\/\/ \ntemplate <typename InterfaceType>\nstd::vector< rt_expr<InterfaceType> > stress_tensor(std::vector< rt_function_symbol<InterfaceType> > const & v)\n{\n \/\/\n \/\/ a 3x3 matrix representing the stress tensor\n \/\/\n std::vector< rt_expr<InterfaceType> > result(9);\n std::vector< rt_expr<InterfaceType> > strain = strain_tensor(v);\n\n double mu = 0.5;\n double lambda = 1;\n \n \/\/The entries are in the following written \n \n \/\/add 2 \\mu eps:\n for (size_t i=0; i<9; ++i)\n result[i] = (2*mu) * strain[i];\n \/\/result[i] = viennamath::constant<>(0);\n\n \/\/add trace(eps) * Id:\n result[0] = (2*mu) * strain[0] + lambda * (strain[0] + strain[4] + strain[8]);\n result[4] = (2*mu) * strain[4] + lambda * (strain[0] + strain[4] + strain[8]);\n result[8] = (2*mu) * strain[8] + lambda * (strain[0] + strain[4] + strain[8]);\n\n \/*result[0] = lambda * (strain[0] + strain[4] + strain[8]);\n result[4] = lambda * (strain[0] + strain[4] + strain[8]);\n result[8] = lambda * (strain[0] + strain[4] + strain[8]);*\/\n\n return result;\n}\n\n\n\/\/\n\/\/ Provides the operation a : b, where a and b are tensors\n\/\/\ntemplate <typename InterfaceType>\nrt_expr<InterfaceType> tensor_reduce(std::vector< rt_expr<InterfaceType> > lhs, std::vector< rt_expr<InterfaceType> > rhs)\n{\n rt_expr<InterfaceType> ret = lhs[0] * rhs[0];\n \n for (size_t i=1; i<rhs.size(); ++i)\n ret = ret + lhs[i] * rhs[i];\n \n return ret;\n}\n\n\n\/\/\n\/\/ Writes displacements to domain\n\/\/\ntemplate <typename DomainType, typename VectorType>\nvoid apply_displacements(DomainType & domain, VectorType const & result)\n{\n typedef typename DomainType::config_type ConfigType;\n typedef typename viennagrid::result_of::ncell<ConfigType, 0>::type VertexType;\n typedef typename viennagrid::result_of::ncell_range<DomainType, 0>::type VertexContainer;\n typedef typename viennagrid::result_of::iterator<VertexContainer>::type VertexIterator;\n\n typedef viennafem::mapping_key MappingKeyType;\n typedef viennafem::boundary_key BoundaryKeyType;\n \n MappingKeyType map_key(0);\n BoundaryKeyType bnd_key(0);\n \n std::cout << \"* apply_displacements(): Writing computed displacements onto domain\" << std::endl;\n VertexContainer vertices = viennagrid::ncells<0>(domain);\n for (VertexIterator vit = vertices.begin();\n vit != vertices.end();\n ++vit)\n {\n long cur_index = viennadata::access<MappingKeyType, long>(map_key)(*vit);\n if (cur_index > -1)\n {\n vit->point()[0] = vit->point()[0] + result[cur_index+0];\n vit->point()[1] = vit->point()[1] + result[cur_index+1];\n vit->point()[2] = vit->point()[2] + result[cur_index+2];\n }\n else\n {\n if (viennadata::access<BoundaryKeyType, std::vector<double> >(bnd_key)(*vit).size() > 0)\n {\n vit->point()[0] += viennadata::access<BoundaryKeyType, std::vector<double> >(bnd_key)(*vit)[0];\n vit->point()[1] += viennadata::access<BoundaryKeyType, std::vector<double> >(bnd_key)(*vit)[1];\n vit->point()[2] += viennadata::access<BoundaryKeyType, std::vector<double> >(bnd_key)(*vit)[2];\n }\n }\n }\n}\n\nint main()\n{\n typedef viennagrid::config::hexahedral_3d ConfigType;\n typedef viennagrid::result_of::domain<ConfigType>::type DomainType;\n\n typedef viennagrid::result_of::ncell_range<DomainType, 0>::type VertexContainer;\n typedef viennagrid::result_of::iterator<VertexContainer>::type VertexIterator;\n typedef viennagrid::result_of::ncell<ConfigType, 3>::type CellType;\n \n typedef boost::numeric::ublas::compressed_matrix<viennafem::numeric_type> MatrixType;\n typedef boost::numeric::ublas::vector<viennafem::numeric_type> VectorType;\n \n typedef viennamath::function_symbol FunctionSymbol;\n typedef viennamath::equation Equation;\n typedef viennamath::expr Expression;\n\n typedef viennafem::boundary_key BoundaryKey;\n \n \n std::cout << \"*********************************************************\" << std::endl;\n std::cout << \"***** Demo for LAME equation with ViennaFEM *****\" << std::endl;\n std::cout << \"*********************************************************\" << std::endl;\n\n DomainType my_domain;\n \n try\n {\n viennagrid::io::netgen_reader my_reader;\n my_reader(my_domain, \"..\/examples\/data\/cube343_hex.mesh\");\n }\n catch (...)\n {\n std::cerr << \"File-Reader failed. Aborting program...\" << std::endl;\n exit(EXIT_FAILURE);\n }\n\n MatrixType system_matrix;\n VectorType load_vector;\n\n \n \/\/ the unknown function (vector valued, so one for each of the three components..\n std::vector< FunctionSymbol > u(3);\n u[0] = FunctionSymbol(0, unknown_tag<>());\n u[1] = FunctionSymbol(1, unknown_tag<>());\n u[2] = FunctionSymbol(2, unknown_tag<>());\n \n std::vector< FunctionSymbol > v(3);\n v[0] = FunctionSymbol(0, test_tag<>());\n v[1] = FunctionSymbol(1, test_tag<>());\n v[2] = FunctionSymbol(2, test_tag<>());\n \n \n\n \/\/\n \/\/ Step 1: Define the classical Lame equation\n \/\/ (lambda + mu) div(u) div(v) + mu grad(u):grad(v) = F\n \/\/ with force F set to 0.\n \/\/\n \/\/ Minimization problem: \\int eps : sigma dx = \\int F \\cdot u dx\n \/\/\n\n std::vector< Expression > strain = strain_tensor(u);\n std::vector< Expression > stress = stress_tensor(v);\n \n Equation weak_form_lame = make_equation( integral(symbolic_interval(), tensor_reduce( strain, stress )),\n \/\/= \n integral(symbolic_interval(), viennamath::rt_constant<double>(1.0) * v[2])\n );\n \n \n std::cout << \"Weak form of Lame equation: \" << std::endl;\n std::cout << weak_form_lame << std::endl;\n \n std::vector<double> bnd_data_right(3);\n bnd_data_right[0] = 0.2; \/\/small displacement into x-direction prescribed\n \n VertexContainer vertices = viennagrid::ncells<0>(my_domain);\n for (VertexIterator vit = vertices.begin();\n vit != vertices.end();\n ++vit)\n {\n \/\/boundary for first equation: Homogeneous Dirichlet everywhere\n if (vit->point()[0] == 0.0 || vit->point()[0] == 1.0 )\n viennafem::set_dirichlet_boundary(*vit, 0);\n \n if (vit->point()[0] == 1.0)\n {\n viennafem::set_dirichlet_boundary(*vit, bnd_data_right);\n viennadata::access<BoundaryKey, double>(BoundaryKey(0))(*vit) = bnd_data_right[0]; \/\/this is for the moment used for the VTK writer\n }\n }\n \n \/\/\n \/\/ Create PDE solver functors: (discussion about proper interface required)\n \/\/\n viennafem::pde_assembler fem_assembler;\n\n \/\/\n \/\/ Assemble and solve system and write solution vector to pde_result:\n \/\/ (discussion about proper interface required. Introduce a pde_result class?)\n \/\/\n fem_assembler(viennafem::make_linear_pde_system(weak_form_lame, \n u,\n viennafem::make_linear_pde_options(0, \n viennafem::lagrange_tag<1>(),\n viennafem::lagrange_tag<1>())\n ),\n my_domain,\n system_matrix,\n load_vector\n );\n \n VectorType displacements = viennacl::linalg::solve(system_matrix, load_vector, viennacl::linalg::bicgstab_tag());\n std::cout << \"* solve(): Residual: \" << norm_2(prod(system_matrix, displacements) - load_vector) << std::endl;\n\n apply_displacements(my_domain, displacements);\n viennafem::io::write_solution_to_VTK_file(displacements, \"lame_hex\", my_domain, 0);\n\n std::cout << \"*****************************************\" << std::endl;\n std::cout << \"* Lame solver finished successfully! *\" << std::endl;\n std::cout << \"*****************************************\" << std::endl;\n return EXIT_SUCCESS;\n}\n<commit_msg>reactivated lame_3d_hex example - compiles & executes but doesn't generate results<commit_after>\/* =======================================================================\n Copyright (c) 2012, Institute for Microelectronics,\n Institute for Analysis and Scientific Computing,\n TU Wien.\n -----------------\n ViennaMath - Symbolic and Numerical Math in C++\n -----------------\n\n Author: Karl Rupp rupp@iue.tuwien.ac.at\n\n License: MIT (X11), see file LICENSE in the ViennaMath base directory\n======================================================================= *\/\n\n\n\/\/ remove assert() statements and the like in order to get reasonable performance\n#ifndef NDEBUG\n #define NDEBUG\n#endif\n\n#include <iostream>\n#include <vector>\n#include <stdlib.h>\n#include <assert.h>\n\n\/\/ ViennaFEM includes:\n#include \"viennafem\/forwards.h\"\n#include \"viennafem\/fem.hpp\"\n#include \"viennafem\/io\/vtk_writer.hpp\"\n\n\/\/ ViennaGrid includes:\n#include \"viennagrid\/forwards.hpp\"\n#include \"viennagrid\/config\/default_configs.hpp\"\n#include \"viennagrid\/io\/netgen_reader.hpp\"\n\n\/\/ ViennaData includes:\n#include \"viennadata\/api.hpp\"\n\n#include \"viennamath\/expression.hpp\"\n#include \"viennamath\/manipulation\/eval.hpp\"\n#include \"viennamath\/manipulation\/substitute.hpp\"\n#include \"viennamath\/manipulation\/diff.hpp\"\n\n#include \"viennamath\/runtime\/equation.hpp\"\n#include \"viennamath\/manipulation\/apply_coordinate_system.hpp\"\n\n\/\/ Boost.uBLAS includes:\n#include <boost\/numeric\/ublas\/io.hpp>\n#include <boost\/numeric\/ublas\/matrix_sparse.hpp>\n#include <boost\/numeric\/ublas\/matrix.hpp>\n#include <boost\/numeric\/ublas\/operation.hpp>\n#include <boost\/numeric\/ublas\/operation_sparse.hpp>\n\n\n\/\/ViennaCL includes:\n#ifndef VIENNACL_HAVE_UBLAS\n #define VIENNACL_HAVE_UBLAS\n#endif\n \n#include \"viennacl\/linalg\/bicgstab.hpp\"\n#include \"viennacl\/linalg\/norm_2.hpp\"\n#include \"viennacl\/linalg\/prod.hpp\"\n\nusing namespace viennamath;\n\n\/\/\n\/\/ The strain tensor: eps_ij = 0.5 * (du_i\/dx_j + du_j\/dx_i)\n\/\/ \ntemplate <typename InterfaceType>\nstd::vector< rt_expr<InterfaceType> > strain_tensor(std::vector< rt_function_symbol<InterfaceType> > const & u)\n{\n typedef rt_variable<InterfaceType> Variable;\n \n \/\/\n \/\/ a 3x3 matrix representing the strain tensor\n \/\/\n std::vector< rt_expr<InterfaceType> > result(9);\n \n Variable x(0);\n Variable y(1);\n Variable z(2);\n \n \/\/first row:\n result[0] = diff(u[0], x);\n result[1] = 0.5 * (diff(u[0], y) + diff(u[1], x));\n result[2] = 0.5 * (diff(u[0], z) + diff(u[2], x));\n \n \/\/second row:\n result[3] = 0.5 * (diff(u[1], x) + diff(u[0], y));\n result[4] = diff(u[1], y);\n result[5] = 0.5 * (diff(u[1], z) + diff(u[2], y));\n\n \/\/third row:\n result[6] = 0.5 * (diff(u[2], x) + diff(u[0], z));\n result[7] = 0.5 * (diff(u[2], y) + diff(u[1], z));\n result[8] = diff(u[2], z);\n\n return result;\n}\n\n\n\/\/\n\/\/ The stress tensor: sigma = 2 \\mu eps + \\lambda trace(eps) Id for St. Venent-Kirchhoff material\n\/\/ can be replaced with other expressions for plasticity and the like\n\/\/ \ntemplate <typename InterfaceType>\nstd::vector< rt_expr<InterfaceType> > stress_tensor(std::vector< rt_function_symbol<InterfaceType> > const & v)\n{\n \/\/\n \/\/ a 3x3 matrix representing the stress tensor\n \/\/\n std::vector< rt_expr<InterfaceType> > result(9);\n std::vector< rt_expr<InterfaceType> > strain = strain_tensor(v);\n\n double mu = 0.5;\n double lambda = 1;\n \n \/\/The entries are in the following written \n \n \/\/add 2 \\mu eps:\n for (size_t i=0; i<9; ++i)\n result[i] = (2*mu) * strain[i];\n \/\/result[i] = viennamath::constant<>(0);\n\n \/\/add trace(eps) * Id:\n result[0] = (2*mu) * strain[0] + lambda * (strain[0] + strain[4] + strain[8]);\n result[4] = (2*mu) * strain[4] + lambda * (strain[0] + strain[4] + strain[8]);\n result[8] = (2*mu) * strain[8] + lambda * (strain[0] + strain[4] + strain[8]);\n\n \/*result[0] = lambda * (strain[0] + strain[4] + strain[8]);\n result[4] = lambda * (strain[0] + strain[4] + strain[8]);\n result[8] = lambda * (strain[0] + strain[4] + strain[8]);*\/\n\n return result;\n}\n\n\n\/\/\n\/\/ Provides the operation a : b, where a and b are tensors\n\/\/\ntemplate <typename InterfaceType>\nrt_expr<InterfaceType> tensor_reduce(std::vector< rt_expr<InterfaceType> > lhs, std::vector< rt_expr<InterfaceType> > rhs)\n{\n rt_expr<InterfaceType> ret = lhs[0] * rhs[0];\n \n for (size_t i=1; i<rhs.size(); ++i)\n ret = ret + lhs[i] * rhs[i];\n \n return ret;\n}\n\n\n\/\/\n\/\/ Writes displacements to domain\n\/\/\ntemplate <typename DomainT, typename StorageT, typename VectorT>\nvoid apply_displacements(DomainT& domain, StorageT& storage, VectorT const & result)\n{\n typedef typename viennagrid::result_of::element<DomainT, viennagrid::vertex_tag>::type VertexType; \n typedef typename viennagrid::result_of::element_range<DomainT, viennagrid::vertex_tag>::type VertexContainer;\n typedef typename viennagrid::result_of::iterator<VertexContainer>::type VertexIterator;\n\n typedef viennafem::mapping_key MappingKeyType;\n typedef viennafem::boundary_key BoundaryKeyType;\n \n MappingKeyType map_key(0);\n BoundaryKeyType bnd_key(0);\n \n std::cout << \"* apply_displacements(): Writing computed displacements onto domain\" << std::endl;\n VertexContainer vertices = viennagrid::elements<VertexType>(domain); \n for (VertexIterator vit = vertices.begin();\n vit != vertices.end();\n ++vit)\n {\n long cur_index = viennadata::access<MappingKeyType, long>(storage, map_key, *vit);\n if (cur_index > -1)\n {\n viennagrid::point(domain, *vit)[0] += result[cur_index+0];\n viennagrid::point(domain, *vit)[1] += result[cur_index+1];\n viennagrid::point(domain, *vit)[2] += result[cur_index+2];\n }\n else\n {\n if (viennadata::access<BoundaryKeyType, std::vector<double> >(storage, bnd_key, *vit).size() > 0)\n {\n viennagrid::point(domain, *vit)[0] += viennadata::access<BoundaryKeyType, std::vector<double> >(storage, bnd_key, *vit)[0];\n viennagrid::point(domain, *vit)[1] += viennadata::access<BoundaryKeyType, std::vector<double> >(storage, bnd_key, *vit)[1];\n viennagrid::point(domain, *vit)[2] += viennadata::access<BoundaryKeyType, std::vector<double> >(storage, bnd_key, *vit)[2];\n }\n }\n }\n}\n\nint main()\n{\n typedef viennagrid::domain_t< viennagrid::config::hexahedral_3d > DomainType;\n typedef viennagrid::result_of::segmentation<DomainType>::type SegmentationType;\n typedef SegmentationType::iterator SegmentationIterator;\n typedef viennagrid::result_of::element<DomainType, viennagrid::vertex_tag>::type VertexType; \n typedef viennagrid::result_of::element_range<DomainType, viennagrid::vertex_tag>::type VertexContainer;\n typedef viennagrid::result_of::iterator<VertexContainer>::type VertexIterator;\n \n typedef boost::numeric::ublas::compressed_matrix<viennafem::numeric_type> MatrixType;\n typedef boost::numeric::ublas::vector<viennafem::numeric_type> VectorType;\n \n typedef viennamath::function_symbol FunctionSymbol;\n typedef viennamath::equation Equation;\n typedef viennamath::expr Expression;\n\n typedef viennafem::boundary_key BoundaryKey;\n \n \n std::cout << \"*********************************************************\" << std::endl;\n std::cout << \"***** Demo for LAME equation with ViennaFEM *****\" << std::endl;\n std::cout << \"*********************************************************\" << std::endl;\n\n \/\/\n \/\/ Create a domain from file\n \/\/\n DomainType my_domain;\n SegmentationType segments(my_domain);\n \n \/\/\n \/\/ Create a storage object\n \/\/\n typedef viennadata::storage<> StorageType;\n StorageType storage;\n \n try\n {\n viennagrid::io::netgen_reader my_reader;\n my_reader(my_domain, segments, \"..\/examples\/data\/cube343_hex.mesh\");\n }\n catch (...)\n {\n std::cerr << \"File-Reader failed. Aborting program...\" << std::endl;\n exit(EXIT_FAILURE);\n }\n\n MatrixType system_matrix;\n VectorType load_vector;\n\n \n \/\/ the unknown function (vector valued, so one for each of the three components..\n std::vector< FunctionSymbol > u(3);\n u[0] = FunctionSymbol(0, unknown_tag<>());\n u[1] = FunctionSymbol(1, unknown_tag<>());\n u[2] = FunctionSymbol(2, unknown_tag<>());\n \n std::vector< FunctionSymbol > v(3);\n v[0] = FunctionSymbol(0, test_tag<>());\n v[1] = FunctionSymbol(1, test_tag<>());\n v[2] = FunctionSymbol(2, test_tag<>());\n \n \n\n \/\/\n \/\/ Step 1: Define the classical Lame equation\n \/\/ (lambda + mu) div(u) div(v) + mu grad(u):grad(v) = F\n \/\/ with force F set to 0.\n \/\/\n \/\/ Minimization problem: \\int eps : sigma dx = \\int F \\cdot u dx\n \/\/\n\n std::vector< Expression > strain = strain_tensor(u);\n std::vector< Expression > stress = stress_tensor(v);\n \n Equation weak_form_lame = make_equation( integral(symbolic_interval(), tensor_reduce( strain, stress )),\n \/\/= \n integral(symbolic_interval(), viennamath::rt_constant<double>(1.0) * v[2])\n );\n \n \n std::cout << \"Weak form of Lame equation: \" << std::endl;\n std::cout << weak_form_lame << std::endl;\n \n std::vector<double> bnd_data_right(3);\n bnd_data_right[0] = 0.2; \/\/small displacement into x-direction prescribed\n \n VertexContainer vertices = viennagrid::elements<VertexType>(my_domain); \n for (VertexIterator vit = vertices.begin();\n vit != vertices.end();\n ++vit)\n {\n \/\/boundary for first equation: Homogeneous Dirichlet everywhere\n if (viennagrid::point(my_domain, *vit)[0] == 0.0 || viennagrid::point(my_domain, *vit)[0] == 1.0 )\n viennafem::set_dirichlet_boundary(storage, *vit, 0);\n \n if (viennagrid::point(my_domain, *vit)[0] == 1.0)\n {\n viennafem::set_dirichlet_boundary(storage, *vit, bnd_data_right);\n viennadata::access<BoundaryKey, double>(storage, BoundaryKey(0), *vit) = bnd_data_right[0]; \/\/this is for the moment used for the VTK writer\n }\n }\n \n \/\/\n \/\/ Create PDE solver functors: (discussion about proper interface required)\n \/\/\n viennafem::pde_assembler<StorageType> fem_assembler(storage);\n\n \/\/\n \/\/ Assemble and solve system and write solution vector to pde_result:\n \/\/ (discussion about proper interface required. Introduce a pde_result class?)\n \/\/\n fem_assembler(viennafem::make_linear_pde_system(weak_form_lame, \n u,\n viennafem::make_linear_pde_options(0, \n viennafem::lagrange_tag<1>(),\n viennafem::lagrange_tag<1>())\n ),\n my_domain,\n system_matrix,\n load_vector\n );\n \n VectorType displacements = viennacl::linalg::solve(system_matrix, load_vector, viennacl::linalg::bicgstab_tag());\n std::cout << \"* solve(): Residual: \" << norm_2(prod(system_matrix, displacements) - load_vector) << std::endl;\n\n apply_displacements(my_domain, storage, displacements);\n viennafem::io::write_solution_to_VTK_file(displacements, \"lame_hex\", my_domain, segments, storage, 0);\n\n std::cout << \"*****************************************\" << std::endl;\n std::cout << \"* Lame solver finished successfully! *\" << std::endl;\n std::cout << \"*****************************************\" << std::endl;\n return EXIT_SUCCESS;\n}\n<|endoftext|>"} {"text":"<commit_before>#include <iostream>\nusing namespace std;\n\/\/_________________________________________________________________________\n\/\/ This program declares a class for a circle that will have \n\/\/ member functions that set the center, find the area, find\n\/\/ the circumference and display these attributes.\n\/\/ The program as written does not allow the user to input data, but\n\/\/ rather has the radii and center coordinates of the circles (spheres in the program) \n\/\/ initialized at declaration or set by a function.\n\n\/\/class declaration section (header file)\n\nclass Circles \n{\npublic:\n void setCenter(int x, int y);\n double findArea(); \n double findCircumference(); \n void printCircleStats(); \/\/ This outputs the radius and center of the circle. \n Circles (float r); \/\/ Constructor\n Circles(); \/\/ Default constructor\nprivate: \n float radius;\n int center_x;\n int center_y;\n}; \n\n\nconst double PI = 3.14;\n\n\/\/Client section \n\nint main()\n{\n Circles sphere(8);\n sphere.setCenter(9,10);\n sphere.printCircleStats();\n char ch;\n cin >> ch;\n\n return 0;\n}\n\n\/\/___________________________________________________________________________\n\/\/Implementation section Member function implementation\n\nCircles::Circles()\n{\n radius = 1;\n center_y = 0;\n center_x = 0;\n}\n\/\/ Fill in the code to implement the non-default constructor\nCircles::Circles(float r)\n{\n radius = r;\n center_y = 0;\n center_x = 0;\n}\n\n\/\/ Fill in the code to implement the findArea member function\ndouble Circles::findArea(){\n\tdouble area=0;\n\tarea = PI*radius*radius;\n\treturn area;\n}\n\n\/\/ Fill in the code to implement the findCircumference member function\ndouble Circles::findCircumference(){\n\tdouble circ=0;\n\tcirc = 2*PI*radius;\n\treturn circ;\n}\n\nvoid Circles::printCircleStats()\n\/\/ This procedure prints out the radius and center coordinates of the circle\n\/\/ object that calls it.\n\n{\n cout << \"The radius of the circle is \" << radius << endl;\n cout << \"The center of the circle is (\" << center_x \n << \",\" << center_y << \")\" << endl;\n cout << \"The area of the circle is \" << findArea() << endl;\n cout << \"The circumference of the circle is (\" << findCircumference() << endl;\n}\n\nvoid Circles::setCenter(int x, int y)\n\/\/ This procedure will take the coordinates of the center of the circle from \n\/\/ the user and place them in the appropriate member data.\n\n{\n center_x = x;\n center_y = y;\n} \n<commit_msg>Update circles.cpp<commit_after>#include <iostream>\nusing namespace std;\n\/\/_________________________________________________________________________\n\/\/ This program declares a class for a circle that will have \n\/\/ member functions that set the center, find the area, find\n\/\/ the circumference and display these attributes.\n\/\/ The program as written does not allow the user to input data, but\n\/\/ rather has the radii and center coordinates of the circles (spheres in the program) \n\/\/ initialized at declaration or set by a function.\n\n\/\/class declaration section (header file)\n\nclass Circles \n{\npublic:\n \/\/void setCenter(int x, int y);\n double findArea(); \n double findCircumference(); \n void printCircleStats(); \/\/ This outputs the radius and center of the circle. \n Circles (float r); \/\/ Constructor\n Circles (float r, int x, int y); \/\/ Constructor\n Circles(); \/\/ Default constructor\nprivate: \n float radius;\n int center_x;\n int center_y;\n}; \n\n\nconst double PI = 3.14;\n\n\/\/Client section \n\nint main()\n{\n Circles sphere1(2);\n Circles sphere2;\n sphere1.printCircleStats();\n sphere2.printCircleStats();\n char ch;\n cin >> ch;\n\n return 0;\n}\n\n\/\/___________________________________________________________________________\n\/\/Implementation section Member function implementation\n\nCircles::Circles()\n{\n radius = 1;\n center_y = 0;\n center_x = 0;\n}\n\/\/ Fill in the code to implement the non-default constructor\nCircles::Circles(float r)\n{\n radius = r;\n center_y = 0;\n center_x = 0;\n}\n\nCircles::Circles(float r, int x, int y)\n{\n radius = r;\n center_y = y;\n center_x = x;\n}\n\n\/\/ Fill in the code to implement the findArea member function\ndouble Circles::findArea(){\n\tdouble area=0;\n\tarea = PI*radius*radius;\n\treturn area;\n}\n\n\/\/ Fill in the code to implement the findCircumference member function\ndouble Circles::findCircumference(){\n\tdouble circ=0;\n\tcirc = 2*PI*radius;\n\treturn circ;\n}\n\nvoid Circles::printCircleStats()\n\/\/ This procedure prints out the radius and center coordinates of the circle\n\/\/ object that calls it.\n\n{\n cout << \"The radius of the circle is \" << radius << endl;\n cout << \"The center of the circle is (\" << center_x \n << \",\" << center_y << \")\" << endl;\n cout << \"The area of the circle is \" << findArea() << endl;\n cout << \"The circumference of the circle is \" << findCircumference() << endl << endl;\n}\n\n\/*void Circles::setCenter(int x, int y)\n\/\/ This procedure will take the coordinates of the center of the circle from \n\/\/ the user and place them in the appropriate member data.\n\n{\n center_x = x;\n center_y = y;\n} *\/\n<|endoftext|>"} {"text":"<commit_before>\/\/ Scintilla source code edit control\n\/** @file LexInno.cxx\n ** Lexer for Inno Setup scripts.\n **\/\n\/\/ Written by Friedrich Vedder <fvedd@t-online.de>, using code from LexOthers.cxx.\n\/\/ The License.txt file describes the conditions under which this software may be distributed.\n\n#include <stdlib.h>\n#include <string.h>\n#include <stdio.h>\n#include <stdarg.h>\n#include <assert.h>\n#include <ctype.h>\n\n#include \"ILexer.h\"\n#include \"Scintilla.h\"\n#include \"SciLexer.h\"\n\n#include \"WordList.h\"\n#include \"LexAccessor.h\"\n#include \"Accessor.h\"\n#include \"StyleContext.h\"\n#include \"CharacterSet.h\"\n#include \"LexerModule.h\"\n\n#ifdef SCI_NAMESPACE\nusing namespace Scintilla;\n#endif\n\nstatic void ColouriseInnoDoc(unsigned int startPos, int length, int, WordList *keywordLists[], Accessor &styler) {\n\tint state = SCE_INNO_DEFAULT;\n\tchar chPrev;\n\tchar ch = 0;\n\tchar chNext = styler[startPos];\n\tint lengthDoc = startPos + length;\n\tchar *buffer = new char[length];\n\tint bufferCount = 0;\n\tbool isBOL, isEOL, isWS, isBOLWS = 0;\n\tbool isCode = false;\n\tbool isCStyleComment = false;\n\n\tWordList §ionKeywords = *keywordLists[0];\n\tWordList &standardKeywords = *keywordLists[1];\n\tWordList ¶meterKeywords = *keywordLists[2];\n\tWordList &preprocessorKeywords = *keywordLists[3];\n\tWordList &pascalKeywords = *keywordLists[4];\n\tWordList &userKeywords = *keywordLists[5];\n\n\t\/\/ Go through all provided text segment\n\t\/\/ using the hand-written state machine shown below\n\tstyler.StartAt(startPos);\n\tstyler.StartSegment(startPos);\n\tfor (int i = startPos; i < lengthDoc; i++) {\n\t\tchPrev = ch;\n\t\tch = chNext;\n\t\tchNext = styler.SafeGetCharAt(i + 1);\n\n\t\tif (styler.IsLeadByte(ch)) {\n\t\t\tchNext = styler.SafeGetCharAt(i + 2);\n\t\t\ti++;\n\t\t\tcontinue;\n\t\t}\n\n\t\tisBOL = (chPrev == 0) || (chPrev == '\\n') || (chPrev == '\\r' && ch != '\\n');\n\t\tisBOLWS = (isBOL) ? 1 : (isBOLWS && (chPrev == ' ' || chPrev == '\\t'));\n\t\tisEOL = (ch == '\\n' || ch == '\\r');\n\t\tisWS = (ch == ' ' || ch == '\\t');\n\n\t\tswitch(state) {\n\t\t\tcase SCE_INNO_DEFAULT:\n\t\t\t\tif (!isCode && ch == ';' && isBOLWS) {\n\t\t\t\t\t\/\/ Start of a comment\n\t\t\t\t\tstate = SCE_INNO_COMMENT;\n\t\t\t\t} else if (ch == '[' && isBOLWS) {\n\t\t\t\t\t\/\/ Start of a section name\n\t\t\t\t\tbufferCount = 0;\n\t\t\t\t\tstate = SCE_INNO_SECTION;\n\t\t\t\t} else if (ch == '#' && isBOLWS) {\n\t\t\t\t\t\/\/ Start of a preprocessor directive\n\t\t\t\t\tstate = SCE_INNO_PREPROC;\n\t\t\t\t} else if (!isCode && ch == '{' && chNext != '{' && chPrev != '{') {\n\t\t\t\t\t\/\/ Start of an inline expansion\n\t\t\t\t\tstate = SCE_INNO_INLINE_EXPANSION;\n\t\t\t\t} else if (isCode && (ch == '{' || (ch == '(' && chNext == '*'))) {\n\t\t\t\t\t\/\/ Start of a Pascal comment\n\t\t\t\t\tstate = SCE_INNO_COMMENT_PASCAL;\n\t\t\t\t\tisCStyleComment = false;\n\t\t\t\t} else if (isCode && ch == '\/' && chNext == '\/') {\n\t\t\t\t\t\/\/ Apparently, C-style comments are legal, too\n\t\t\t\t\tstate = SCE_INNO_COMMENT_PASCAL;\n\t\t\t\t\tisCStyleComment = true;\n\t\t\t\t} else if (ch == '\"') {\n\t\t\t\t\t\/\/ Start of a double-quote string\n\t\t\t\t\tstate = SCE_INNO_STRING_DOUBLE;\n\t\t\t\t} else if (ch == '\\'') {\n\t\t\t\t\t\/\/ Start of a single-quote string\n\t\t\t\t\tstate = SCE_INNO_STRING_SINGLE;\n\t\t\t\t} else if (isascii(ch) && (isalpha(ch) || (ch == '_'))) {\n\t\t\t\t\t\/\/ Start of an identifier\n\t\t\t\t\tbufferCount = 0;\n\t\t\t\t\tbuffer[bufferCount++] = static_cast<char>(tolower(ch));\n\t\t\t\t\tstate = SCE_INNO_IDENTIFIER;\n\t\t\t\t} else {\n\t\t\t\t\t\/\/ Style it the default style\n\t\t\t\t\tstyler.ColourTo(i,SCE_INNO_DEFAULT);\n\t\t\t\t}\n\t\t\t\tbreak;\n\n\t\t\tcase SCE_INNO_COMMENT:\n\t\t\t\tif (isEOL) {\n\t\t\t\t\tstate = SCE_INNO_DEFAULT;\n\t\t\t\t\tstyler.ColourTo(i,SCE_INNO_COMMENT);\n\t\t\t\t}\n\t\t\t\tbreak;\n\n\t\t\tcase SCE_INNO_IDENTIFIER:\n\t\t\t\tif (isascii(ch) && (isalnum(ch) || (ch == '_'))) {\n\t\t\t\t\tbuffer[bufferCount++] = static_cast<char>(tolower(ch));\n\t\t\t\t} else {\n\t\t\t\t\tstate = SCE_INNO_DEFAULT;\n\t\t\t\t\tbuffer[bufferCount] = '\\0';\n\n\t\t\t\t\t\/\/ Check if the buffer contains a keyword\n\t\t\t\t\tif (!isCode && standardKeywords.InList(buffer)) {\n\t\t\t\t\t\tstyler.ColourTo(i-1,SCE_INNO_KEYWORD);\n\t\t\t\t\t} else if (!isCode && parameterKeywords.InList(buffer)) {\n\t\t\t\t\t\tstyler.ColourTo(i-1,SCE_INNO_PARAMETER);\n\t\t\t\t\t} else if (isCode && pascalKeywords.InList(buffer)) {\n\t\t\t\t\t\tstyler.ColourTo(i-1,SCE_INNO_KEYWORD_PASCAL);\n\t\t\t\t\t} else if (!isCode && userKeywords.InList(buffer)) {\n\t\t\t\t\t\tstyler.ColourTo(i-1,SCE_INNO_KEYWORD_USER);\n\t\t\t\t\t} else {\n\t\t\t\t\t\tstyler.ColourTo(i-1,SCE_INNO_DEFAULT);\n\t\t\t\t\t}\n\n\t\t\t\t\t\/\/ Push back the faulty character\n\t\t\t\t\tchNext = styler[i--];\n\t\t\t\t\tch = chPrev;\n\t\t\t\t}\n\t\t\t\tbreak;\n\n\t\t\tcase SCE_INNO_SECTION:\n\t\t\t\tif (ch == ']') {\n\t\t\t\t\tstate = SCE_INNO_DEFAULT;\n\t\t\t\t\tbuffer[bufferCount] = '\\0';\n\n\t\t\t\t\t\/\/ Check if the buffer contains a section name\n\t\t\t\t\tif (sectionKeywords.InList(buffer)) {\n\t\t\t\t\t\tstyler.ColourTo(i,SCE_INNO_SECTION);\n\t\t\t\t\t\tisCode = !CompareCaseInsensitive(buffer, \"code\");\n\t\t\t\t\t} else {\n\t\t\t\t\t\tstyler.ColourTo(i,SCE_INNO_DEFAULT);\n\t\t\t\t\t}\n\t\t\t\t} else if (isascii(ch) && (isalnum(ch) || (ch == '_'))) {\n\t\t\t\t\tbuffer[bufferCount++] = static_cast<char>(tolower(ch));\n\t\t\t\t} else {\n\t\t\t\t\tstate = SCE_INNO_DEFAULT;\n\t\t\t\t\tstyler.ColourTo(i,SCE_INNO_DEFAULT);\n\t\t\t\t}\n\t\t\t\tbreak;\n\n\t\t\tcase SCE_INNO_PREPROC:\n\t\t\t\tif (isWS || isEOL) {\n\t\t\t\t\tif (isascii(chPrev) && isalpha(chPrev)) {\n\t\t\t\t\t\tstate = SCE_INNO_DEFAULT;\n\t\t\t\t\t\tbuffer[bufferCount] = '\\0';\n\n\t\t\t\t\t\t\/\/ Check if the buffer contains a preprocessor directive\n\t\t\t\t\t\tif (preprocessorKeywords.InList(buffer)) {\n\t\t\t\t\t\t\tstyler.ColourTo(i-1,SCE_INNO_PREPROC);\n\t\t\t\t\t\t} else {\n\t\t\t\t\t\t\tstyler.ColourTo(i-1,SCE_INNO_DEFAULT);\n\t\t\t\t\t\t}\n\n\t\t\t\t\t\t\/\/ Push back the faulty character\n\t\t\t\t\t\tchNext = styler[i--];\n\t\t\t\t\t\tch = chPrev;\n\t\t\t\t\t}\n\t\t\t\t} else if (isascii(ch) && isalpha(ch)) {\n\t\t\t\t\tif (chPrev == '#' || chPrev == ' ' || chPrev == '\\t')\n\t\t\t\t\t\tbufferCount = 0;\n\t\t\t\t\tbuffer[bufferCount++] = static_cast<char>(tolower(ch));\n\t\t\t\t}\n\t\t\t\tbreak;\n\n\t\t\tcase SCE_INNO_STRING_DOUBLE:\n\t\t\t\tif (ch == '\"' || isEOL) {\n\t\t\t\t\tstate = SCE_INNO_DEFAULT;\n\t\t\t\t\tstyler.ColourTo(i,SCE_INNO_STRING_DOUBLE);\n\t\t\t\t}\n\t\t\t\tbreak;\n\n\t\t\tcase SCE_INNO_STRING_SINGLE:\n\t\t\t\tif (ch == '\\'' || isEOL) {\n\t\t\t\t\tstate = SCE_INNO_DEFAULT;\n\t\t\t\t\tstyler.ColourTo(i,SCE_INNO_STRING_SINGLE);\n\t\t\t\t}\n\t\t\t\tbreak;\n\n\t\t\tcase SCE_INNO_INLINE_EXPANSION:\n\t\t\t\tif (ch == '}') {\n\t\t\t\t\tstate = SCE_INNO_DEFAULT;\n\t\t\t\t\tstyler.ColourTo(i,SCE_INNO_INLINE_EXPANSION);\n\t\t\t\t} else if (isEOL) {\n\t\t\t\t\tstate = SCE_INNO_DEFAULT;\n\t\t\t\t\tstyler.ColourTo(i,SCE_INNO_DEFAULT);\n\t\t\t\t}\n\t\t\t\tbreak;\n\n\t\t\tcase SCE_INNO_COMMENT_PASCAL:\n\t\t\t\tif (isCStyleComment) {\n\t\t\t\t\tif (isEOL) {\n\t\t\t\t\t\tstate = SCE_INNO_DEFAULT;\n\t\t\t\t\t\tstyler.ColourTo(i,SCE_INNO_COMMENT_PASCAL);\n\t\t\t\t\t}\n\t\t\t\t} else {\n\t\t\t\t\tif (ch == '}' || (ch == ')' && chPrev == '*')) {\n\t\t\t\t\t\tstate = SCE_INNO_DEFAULT;\n\t\t\t\t\t\tstyler.ColourTo(i,SCE_INNO_COMMENT_PASCAL);\n\t\t\t\t\t} else if (isEOL) {\n\t\t\t\t\t\tstate = SCE_INNO_DEFAULT;\n\t\t\t\t\t\tstyler.ColourTo(i,SCE_INNO_DEFAULT);\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\tbreak;\n\n\t\t}\n\t}\n\tdelete []buffer;\n}\n\nstatic const char * const innoWordListDesc[] = {\n\t\"Sections\",\n\t\"Keywords\",\n\t\"Parameters\",\n\t\"Preprocessor directives\",\n\t\"Pascal keywords\",\n\t\"User defined keywords\",\n\t0\n};\n\nstatic void FoldInnoDoc(unsigned int startPos, int length, int, WordList *[], Accessor &styler) {\n\tunsigned int endPos = startPos + length;\n\tchar chNext = styler[startPos];\n\n\tint lineCurrent = styler.GetLine(startPos);\n\n\tbool sectionFlag = false;\n\tint levelPrev = lineCurrent > 0 ? styler.LevelAt(lineCurrent - 1) : SC_FOLDLEVELBASE;\n\tint level;\n\n\tfor (unsigned int i = startPos; i < endPos; i++) {\n\t\tchar ch = chNext;\n\t\tchNext = styler[i+1];\n\t\tbool atEOL = (ch == '\\r' && chNext != '\\n') || (ch == '\\n');\n\t\tint style = styler.StyleAt(i);\n\n\t\tif (style == SCE_INNO_SECTION)\n\t\t\tsectionFlag = true;\n\n\t\tif (atEOL || i == endPos - 1) {\n\t\t\tif (sectionFlag) {\n\t\t\t\tlevel = SC_FOLDLEVELBASE | SC_FOLDLEVELHEADERFLAG;\n\t\t\t\tif (level == levelPrev)\n\t\t\t\t\tstyler.SetLevel(lineCurrent - 1, levelPrev & ~SC_FOLDLEVELHEADERFLAG);\n\t\t\t} else {\n\t\t\t\tlevel = levelPrev & SC_FOLDLEVELNUMBERMASK;\n\t\t\t\tif (levelPrev & SC_FOLDLEVELHEADERFLAG)\n\t\t\t\t\tlevel++;\n\t\t\t}\n\n\t\t\tstyler.SetLevel(lineCurrent, level);\n\n\t\t\tlevelPrev = level;\n\t\t\tlineCurrent++;\n\t\t\tsectionFlag = false;\n\t\t}\n\t}\n}\n\nLexerModule lmInno(SCLEX_INNOSETUP, ColouriseInnoDoc, \"inno\", FoldInnoDoc, innoWordListDesc);\n<commit_msg>Bug #3283880. Highlight source code inside [CODE] section when lexing starts in the middle. From Marko Njezic.<commit_after>\/\/ Scintilla source code edit control\n\/** @file LexInno.cxx\n ** Lexer for Inno Setup scripts.\n **\/\n\/\/ Written by Friedrich Vedder <fvedd@t-online.de>, using code from LexOthers.cxx.\n\/\/ The License.txt file describes the conditions under which this software may be distributed.\n\n#include <stdlib.h>\n#include <string.h>\n#include <stdio.h>\n#include <stdarg.h>\n#include <assert.h>\n#include <ctype.h>\n\n#include \"ILexer.h\"\n#include \"Scintilla.h\"\n#include \"SciLexer.h\"\n\n#include \"WordList.h\"\n#include \"LexAccessor.h\"\n#include \"Accessor.h\"\n#include \"StyleContext.h\"\n#include \"CharacterSet.h\"\n#include \"LexerModule.h\"\n\n#ifdef SCI_NAMESPACE\nusing namespace Scintilla;\n#endif\n\nstatic void ColouriseInnoDoc(unsigned int startPos, int length, int, WordList *keywordLists[], Accessor &styler) {\n\tint state = SCE_INNO_DEFAULT;\n\tchar chPrev;\n\tchar ch = 0;\n\tchar chNext = styler[startPos];\n\tint lengthDoc = startPos + length;\n\tchar *buffer = new char[length];\n\tint bufferCount = 0;\n\tbool isBOL, isEOL, isWS, isBOLWS = 0;\n\tbool isCStyleComment = false;\n\n\tWordList §ionKeywords = *keywordLists[0];\n\tWordList &standardKeywords = *keywordLists[1];\n\tWordList ¶meterKeywords = *keywordLists[2];\n\tWordList &preprocessorKeywords = *keywordLists[3];\n\tWordList &pascalKeywords = *keywordLists[4];\n\tWordList &userKeywords = *keywordLists[5];\n\n\tint curLine = styler.GetLine(startPos);\n\tint curLineState = curLine > 0 ? styler.GetLineState(curLine - 1) : 0;\n\tbool isCode = (curLineState == 1);\n\n\t\/\/ Go through all provided text segment\n\t\/\/ using the hand-written state machine shown below\n\tstyler.StartAt(startPos);\n\tstyler.StartSegment(startPos);\n\tfor (int i = startPos; i < lengthDoc; i++) {\n\t\tchPrev = ch;\n\t\tch = chNext;\n\t\tchNext = styler.SafeGetCharAt(i + 1);\n\n\t\tif (styler.IsLeadByte(ch)) {\n\t\t\tchNext = styler.SafeGetCharAt(i + 2);\n\t\t\ti++;\n\t\t\tcontinue;\n\t\t}\n\n\t\tisBOL = (chPrev == 0) || (chPrev == '\\n') || (chPrev == '\\r' && ch != '\\n');\n\t\tisBOLWS = (isBOL) ? 1 : (isBOLWS && (chPrev == ' ' || chPrev == '\\t'));\n\t\tisEOL = (ch == '\\n' || ch == '\\r');\n\t\tisWS = (ch == ' ' || ch == '\\t');\n\n\t\tif ((ch == '\\r' && chNext != '\\n') || (ch == '\\n')) {\n\t\t\t\/\/ Remember the line state for future incremental lexing\n\t\t\tcurLine = styler.GetLine(i);\n\t\t\tstyler.SetLineState(curLine, (isCode ? 1 : 0));\n\t\t}\n\n\t\tswitch(state) {\n\t\t\tcase SCE_INNO_DEFAULT:\n\t\t\t\tif (!isCode && ch == ';' && isBOLWS) {\n\t\t\t\t\t\/\/ Start of a comment\n\t\t\t\t\tstate = SCE_INNO_COMMENT;\n\t\t\t\t} else if (ch == '[' && isBOLWS) {\n\t\t\t\t\t\/\/ Start of a section name\n\t\t\t\t\tbufferCount = 0;\n\t\t\t\t\tstate = SCE_INNO_SECTION;\n\t\t\t\t} else if (ch == '#' && isBOLWS) {\n\t\t\t\t\t\/\/ Start of a preprocessor directive\n\t\t\t\t\tstate = SCE_INNO_PREPROC;\n\t\t\t\t} else if (!isCode && ch == '{' && chNext != '{' && chPrev != '{') {\n\t\t\t\t\t\/\/ Start of an inline expansion\n\t\t\t\t\tstate = SCE_INNO_INLINE_EXPANSION;\n\t\t\t\t} else if (isCode && (ch == '{' || (ch == '(' && chNext == '*'))) {\n\t\t\t\t\t\/\/ Start of a Pascal comment\n\t\t\t\t\tstate = SCE_INNO_COMMENT_PASCAL;\n\t\t\t\t\tisCStyleComment = false;\n\t\t\t\t} else if (isCode && ch == '\/' && chNext == '\/') {\n\t\t\t\t\t\/\/ Apparently, C-style comments are legal, too\n\t\t\t\t\tstate = SCE_INNO_COMMENT_PASCAL;\n\t\t\t\t\tisCStyleComment = true;\n\t\t\t\t} else if (ch == '\"') {\n\t\t\t\t\t\/\/ Start of a double-quote string\n\t\t\t\t\tstate = SCE_INNO_STRING_DOUBLE;\n\t\t\t\t} else if (ch == '\\'') {\n\t\t\t\t\t\/\/ Start of a single-quote string\n\t\t\t\t\tstate = SCE_INNO_STRING_SINGLE;\n\t\t\t\t} else if (isascii(ch) && (isalpha(ch) || (ch == '_'))) {\n\t\t\t\t\t\/\/ Start of an identifier\n\t\t\t\t\tbufferCount = 0;\n\t\t\t\t\tbuffer[bufferCount++] = static_cast<char>(tolower(ch));\n\t\t\t\t\tstate = SCE_INNO_IDENTIFIER;\n\t\t\t\t} else {\n\t\t\t\t\t\/\/ Style it the default style\n\t\t\t\t\tstyler.ColourTo(i,SCE_INNO_DEFAULT);\n\t\t\t\t}\n\t\t\t\tbreak;\n\n\t\t\tcase SCE_INNO_COMMENT:\n\t\t\t\tif (isEOL) {\n\t\t\t\t\tstate = SCE_INNO_DEFAULT;\n\t\t\t\t\tstyler.ColourTo(i,SCE_INNO_COMMENT);\n\t\t\t\t}\n\t\t\t\tbreak;\n\n\t\t\tcase SCE_INNO_IDENTIFIER:\n\t\t\t\tif (isascii(ch) && (isalnum(ch) || (ch == '_'))) {\n\t\t\t\t\tbuffer[bufferCount++] = static_cast<char>(tolower(ch));\n\t\t\t\t} else {\n\t\t\t\t\tstate = SCE_INNO_DEFAULT;\n\t\t\t\t\tbuffer[bufferCount] = '\\0';\n\n\t\t\t\t\t\/\/ Check if the buffer contains a keyword\n\t\t\t\t\tif (!isCode && standardKeywords.InList(buffer)) {\n\t\t\t\t\t\tstyler.ColourTo(i-1,SCE_INNO_KEYWORD);\n\t\t\t\t\t} else if (!isCode && parameterKeywords.InList(buffer)) {\n\t\t\t\t\t\tstyler.ColourTo(i-1,SCE_INNO_PARAMETER);\n\t\t\t\t\t} else if (isCode && pascalKeywords.InList(buffer)) {\n\t\t\t\t\t\tstyler.ColourTo(i-1,SCE_INNO_KEYWORD_PASCAL);\n\t\t\t\t\t} else if (!isCode && userKeywords.InList(buffer)) {\n\t\t\t\t\t\tstyler.ColourTo(i-1,SCE_INNO_KEYWORD_USER);\n\t\t\t\t\t} else {\n\t\t\t\t\t\tstyler.ColourTo(i-1,SCE_INNO_DEFAULT);\n\t\t\t\t\t}\n\n\t\t\t\t\t\/\/ Push back the faulty character\n\t\t\t\t\tchNext = styler[i--];\n\t\t\t\t\tch = chPrev;\n\t\t\t\t}\n\t\t\t\tbreak;\n\n\t\t\tcase SCE_INNO_SECTION:\n\t\t\t\tif (ch == ']') {\n\t\t\t\t\tstate = SCE_INNO_DEFAULT;\n\t\t\t\t\tbuffer[bufferCount] = '\\0';\n\n\t\t\t\t\t\/\/ Check if the buffer contains a section name\n\t\t\t\t\tif (sectionKeywords.InList(buffer)) {\n\t\t\t\t\t\tstyler.ColourTo(i,SCE_INNO_SECTION);\n\t\t\t\t\t\tisCode = !CompareCaseInsensitive(buffer, \"code\");\n\t\t\t\t\t} else {\n\t\t\t\t\t\tstyler.ColourTo(i,SCE_INNO_DEFAULT);\n\t\t\t\t\t}\n\t\t\t\t} else if (isascii(ch) && (isalnum(ch) || (ch == '_'))) {\n\t\t\t\t\tbuffer[bufferCount++] = static_cast<char>(tolower(ch));\n\t\t\t\t} else {\n\t\t\t\t\tstate = SCE_INNO_DEFAULT;\n\t\t\t\t\tstyler.ColourTo(i,SCE_INNO_DEFAULT);\n\t\t\t\t}\n\t\t\t\tbreak;\n\n\t\t\tcase SCE_INNO_PREPROC:\n\t\t\t\tif (isWS || isEOL) {\n\t\t\t\t\tif (isascii(chPrev) && isalpha(chPrev)) {\n\t\t\t\t\t\tstate = SCE_INNO_DEFAULT;\n\t\t\t\t\t\tbuffer[bufferCount] = '\\0';\n\n\t\t\t\t\t\t\/\/ Check if the buffer contains a preprocessor directive\n\t\t\t\t\t\tif (preprocessorKeywords.InList(buffer)) {\n\t\t\t\t\t\t\tstyler.ColourTo(i-1,SCE_INNO_PREPROC);\n\t\t\t\t\t\t} else {\n\t\t\t\t\t\t\tstyler.ColourTo(i-1,SCE_INNO_DEFAULT);\n\t\t\t\t\t\t}\n\n\t\t\t\t\t\t\/\/ Push back the faulty character\n\t\t\t\t\t\tchNext = styler[i--];\n\t\t\t\t\t\tch = chPrev;\n\t\t\t\t\t}\n\t\t\t\t} else if (isascii(ch) && isalpha(ch)) {\n\t\t\t\t\tif (chPrev == '#' || chPrev == ' ' || chPrev == '\\t')\n\t\t\t\t\t\tbufferCount = 0;\n\t\t\t\t\tbuffer[bufferCount++] = static_cast<char>(tolower(ch));\n\t\t\t\t}\n\t\t\t\tbreak;\n\n\t\t\tcase SCE_INNO_STRING_DOUBLE:\n\t\t\t\tif (ch == '\"' || isEOL) {\n\t\t\t\t\tstate = SCE_INNO_DEFAULT;\n\t\t\t\t\tstyler.ColourTo(i,SCE_INNO_STRING_DOUBLE);\n\t\t\t\t}\n\t\t\t\tbreak;\n\n\t\t\tcase SCE_INNO_STRING_SINGLE:\n\t\t\t\tif (ch == '\\'' || isEOL) {\n\t\t\t\t\tstate = SCE_INNO_DEFAULT;\n\t\t\t\t\tstyler.ColourTo(i,SCE_INNO_STRING_SINGLE);\n\t\t\t\t}\n\t\t\t\tbreak;\n\n\t\t\tcase SCE_INNO_INLINE_EXPANSION:\n\t\t\t\tif (ch == '}') {\n\t\t\t\t\tstate = SCE_INNO_DEFAULT;\n\t\t\t\t\tstyler.ColourTo(i,SCE_INNO_INLINE_EXPANSION);\n\t\t\t\t} else if (isEOL) {\n\t\t\t\t\tstate = SCE_INNO_DEFAULT;\n\t\t\t\t\tstyler.ColourTo(i,SCE_INNO_DEFAULT);\n\t\t\t\t}\n\t\t\t\tbreak;\n\n\t\t\tcase SCE_INNO_COMMENT_PASCAL:\n\t\t\t\tif (isCStyleComment) {\n\t\t\t\t\tif (isEOL) {\n\t\t\t\t\t\tstate = SCE_INNO_DEFAULT;\n\t\t\t\t\t\tstyler.ColourTo(i,SCE_INNO_COMMENT_PASCAL);\n\t\t\t\t\t}\n\t\t\t\t} else {\n\t\t\t\t\tif (ch == '}' || (ch == ')' && chPrev == '*')) {\n\t\t\t\t\t\tstate = SCE_INNO_DEFAULT;\n\t\t\t\t\t\tstyler.ColourTo(i,SCE_INNO_COMMENT_PASCAL);\n\t\t\t\t\t} else if (isEOL) {\n\t\t\t\t\t\tstate = SCE_INNO_DEFAULT;\n\t\t\t\t\t\tstyler.ColourTo(i,SCE_INNO_DEFAULT);\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\tbreak;\n\n\t\t}\n\t}\n\tdelete []buffer;\n}\n\nstatic const char * const innoWordListDesc[] = {\n\t\"Sections\",\n\t\"Keywords\",\n\t\"Parameters\",\n\t\"Preprocessor directives\",\n\t\"Pascal keywords\",\n\t\"User defined keywords\",\n\t0\n};\n\nstatic void FoldInnoDoc(unsigned int startPos, int length, int, WordList *[], Accessor &styler) {\n\tunsigned int endPos = startPos + length;\n\tchar chNext = styler[startPos];\n\n\tint lineCurrent = styler.GetLine(startPos);\n\n\tbool sectionFlag = false;\n\tint levelPrev = lineCurrent > 0 ? styler.LevelAt(lineCurrent - 1) : SC_FOLDLEVELBASE;\n\tint level;\n\n\tfor (unsigned int i = startPos; i < endPos; i++) {\n\t\tchar ch = chNext;\n\t\tchNext = styler[i+1];\n\t\tbool atEOL = (ch == '\\r' && chNext != '\\n') || (ch == '\\n');\n\t\tint style = styler.StyleAt(i);\n\n\t\tif (style == SCE_INNO_SECTION)\n\t\t\tsectionFlag = true;\n\n\t\tif (atEOL || i == endPos - 1) {\n\t\t\tif (sectionFlag) {\n\t\t\t\tlevel = SC_FOLDLEVELBASE | SC_FOLDLEVELHEADERFLAG;\n\t\t\t\tif (level == levelPrev)\n\t\t\t\t\tstyler.SetLevel(lineCurrent - 1, levelPrev & ~SC_FOLDLEVELHEADERFLAG);\n\t\t\t} else {\n\t\t\t\tlevel = levelPrev & SC_FOLDLEVELNUMBERMASK;\n\t\t\t\tif (levelPrev & SC_FOLDLEVELHEADERFLAG)\n\t\t\t\t\tlevel++;\n\t\t\t}\n\n\t\t\tstyler.SetLevel(lineCurrent, level);\n\n\t\t\tlevelPrev = level;\n\t\t\tlineCurrent++;\n\t\t\tsectionFlag = false;\n\t\t}\n\t}\n}\n\nLexerModule lmInno(SCLEX_INNOSETUP, ColouriseInnoDoc, \"inno\", FoldInnoDoc, innoWordListDesc);\n<|endoftext|>"} {"text":"<commit_before>\/\/ Scintilla source code edit control\n\/** @file LexInno.cxx\n ** Lexer for Inno Setup scripts.\n **\/\n\/\/ Written by Friedrich Vedder <fvedd@t-online.de>, using code from LexOthers.cxx.\n\/\/ The License.txt file describes the conditions under which this software may be distributed.\n\n#include <stdlib.h>\n#include <string.h>\n#include <stdio.h>\n#include <stdarg.h>\n#include <assert.h>\n#include <ctype.h>\n\n#include \"ILexer.h\"\n#include \"Scintilla.h\"\n#include \"SciLexer.h\"\n\n#include \"WordList.h\"\n#include \"LexAccessor.h\"\n#include \"Accessor.h\"\n#include \"StyleContext.h\"\n#include \"CharacterSet.h\"\n#include \"LexerModule.h\"\n\n#ifdef SCI_NAMESPACE\nusing namespace Scintilla;\n#endif\n\nstatic void ColouriseInnoDoc(unsigned int startPos, int length, int, WordList *keywordLists[], Accessor &styler) {\n\tint state = SCE_INNO_DEFAULT;\n\tchar chPrev;\n\tchar ch = 0;\n\tchar chNext = styler[startPos];\n\tint lengthDoc = startPos + length;\n\tchar *buffer = new char[length];\n\tint bufferCount = 0;\n\tbool isBOL, isEOL, isWS, isBOLWS = 0;\n\tbool isCode = false;\n\tbool isCStyleComment = false;\n\n\tWordList §ionKeywords = *keywordLists[0];\n\tWordList &standardKeywords = *keywordLists[1];\n\tWordList ¶meterKeywords = *keywordLists[2];\n\tWordList &preprocessorKeywords = *keywordLists[3];\n\tWordList &pascalKeywords = *keywordLists[4];\n\tWordList &userKeywords = *keywordLists[5];\n\n\t\/\/ Go through all provided text segment\n\t\/\/ using the hand-written state machine shown below\n\tstyler.StartAt(startPos);\n\tstyler.StartSegment(startPos);\n\tfor (int i = startPos; i < lengthDoc; i++) {\n\t\tchPrev = ch;\n\t\tch = chNext;\n\t\tchNext = styler.SafeGetCharAt(i + 1);\n\n\t\tif (styler.IsLeadByte(ch)) {\n\t\t\tchNext = styler.SafeGetCharAt(i + 2);\n\t\t\ti++;\n\t\t\tcontinue;\n\t\t}\n\n\t\tisBOL = (chPrev == 0) || (chPrev == '\\n') || (chPrev == '\\r' && ch != '\\n');\n\t\tisBOLWS = (isBOL) ? 1 : (isBOLWS && (chPrev == ' ' || chPrev == '\\t'));\n\t\tisEOL = (ch == '\\n' || ch == '\\r');\n\t\tisWS = (ch == ' ' || ch == '\\t');\n\n\t\tswitch(state) {\n\t\t\tcase SCE_INNO_DEFAULT:\n\t\t\t\tif (!isCode && ch == ';' && isBOLWS) {\n\t\t\t\t\t\/\/ Start of a comment\n\t\t\t\t\tstate = SCE_INNO_COMMENT;\n\t\t\t\t} else if (ch == '[' && isBOLWS) {\n\t\t\t\t\t\/\/ Start of a section name\n\t\t\t\t\tbufferCount = 0;\n\t\t\t\t\tstate = SCE_INNO_SECTION;\n\t\t\t\t} else if (ch == '#' && isBOLWS) {\n\t\t\t\t\t\/\/ Start of a preprocessor directive\n\t\t\t\t\tstate = SCE_INNO_PREPROC;\n\t\t\t\t} else if (!isCode && ch == '{' && chNext != '{' && chPrev != '{') {\n\t\t\t\t\t\/\/ Start of an inline expansion\n\t\t\t\t\tstate = SCE_INNO_INLINE_EXPANSION;\n\t\t\t\t} else if (isCode && (ch == '{' || (ch == '(' && chNext == '*'))) {\n\t\t\t\t\t\/\/ Start of a Pascal comment\n\t\t\t\t\tstate = SCE_INNO_COMMENT_PASCAL;\n\t\t\t\t\tisCStyleComment = false;\n\t\t\t\t} else if (isCode && ch == '\/' && chNext == '\/') {\n\t\t\t\t\t\/\/ Apparently, C-style comments are legal, too\n\t\t\t\t\tstate = SCE_INNO_COMMENT_PASCAL;\n\t\t\t\t\tisCStyleComment = true;\n\t\t\t\t} else if (ch == '\"') {\n\t\t\t\t\t\/\/ Start of a double-quote string\n\t\t\t\t\tstate = SCE_INNO_STRING_DOUBLE;\n\t\t\t\t} else if (ch == '\\'') {\n\t\t\t\t\t\/\/ Start of a single-quote string\n\t\t\t\t\tstate = SCE_INNO_STRING_SINGLE;\n\t\t\t\t} else if (isascii(ch) && (isalpha(ch) || (ch == '_'))) {\n\t\t\t\t\t\/\/ Start of an identifier\n\t\t\t\t\tbufferCount = 0;\n\t\t\t\t\tbuffer[bufferCount++] = static_cast<char>(tolower(ch));\n\t\t\t\t\tstate = SCE_INNO_IDENTIFIER;\n\t\t\t\t} else {\n\t\t\t\t\t\/\/ Style it the default style\n\t\t\t\t\tstyler.ColourTo(i,SCE_INNO_DEFAULT);\n\t\t\t\t}\n\t\t\t\tbreak;\n\n\t\t\tcase SCE_INNO_COMMENT:\n\t\t\t\tif (isEOL) {\n\t\t\t\t\tstate = SCE_INNO_DEFAULT;\n\t\t\t\t\tstyler.ColourTo(i,SCE_INNO_COMMENT);\n\t\t\t\t}\n\t\t\t\tbreak;\n\n\t\t\tcase SCE_INNO_IDENTIFIER:\n\t\t\t\tif (isascii(ch) && (isalnum(ch) || (ch == '_'))) {\n\t\t\t\t\tbuffer[bufferCount++] = static_cast<char>(tolower(ch));\n\t\t\t\t} else {\n\t\t\t\t\tstate = SCE_INNO_DEFAULT;\n\t\t\t\t\tbuffer[bufferCount] = '\\0';\n\n\t\t\t\t\t\/\/ Check if the buffer contains a keyword\n\t\t\t\t\tif (!isCode && standardKeywords.InList(buffer)) {\n\t\t\t\t\t\tstyler.ColourTo(i-1,SCE_INNO_KEYWORD);\n\t\t\t\t\t} else if (!isCode && parameterKeywords.InList(buffer)) {\n\t\t\t\t\t\tstyler.ColourTo(i-1,SCE_INNO_PARAMETER);\n\t\t\t\t\t} else if (isCode && pascalKeywords.InList(buffer)) {\n\t\t\t\t\t\tstyler.ColourTo(i-1,SCE_INNO_KEYWORD_PASCAL);\n\t\t\t\t\t} else if (!isCode && userKeywords.InList(buffer)) {\n\t\t\t\t\t\tstyler.ColourTo(i-1,SCE_INNO_KEYWORD_USER);\n\t\t\t\t\t} else {\n\t\t\t\t\t\tstyler.ColourTo(i-1,SCE_INNO_DEFAULT);\n\t\t\t\t\t}\n\n\t\t\t\t\t\/\/ Push back the faulty character\n\t\t\t\t\tchNext = styler[i--];\n\t\t\t\t\tch = chPrev;\n\t\t\t\t}\n\t\t\t\tbreak;\n\n\t\t\tcase SCE_INNO_SECTION:\n\t\t\t\tif (ch == ']') {\n\t\t\t\t\tstate = SCE_INNO_DEFAULT;\n\t\t\t\t\tbuffer[bufferCount] = '\\0';\n\n\t\t\t\t\t\/\/ Check if the buffer contains a section name\n\t\t\t\t\tif (sectionKeywords.InList(buffer)) {\n\t\t\t\t\t\tstyler.ColourTo(i,SCE_INNO_SECTION);\n\t\t\t\t\t\tisCode = !CompareCaseInsensitive(buffer, \"code\");\n\t\t\t\t\t} else {\n\t\t\t\t\t\tstyler.ColourTo(i,SCE_INNO_DEFAULT);\n\t\t\t\t\t}\n\t\t\t\t} else if (isascii(ch) && (isalnum(ch) || (ch == '_'))) {\n\t\t\t\t\tbuffer[bufferCount++] = static_cast<char>(tolower(ch));\n\t\t\t\t} else {\n\t\t\t\t\tstate = SCE_INNO_DEFAULT;\n\t\t\t\t\tstyler.ColourTo(i,SCE_INNO_DEFAULT);\n\t\t\t\t}\n\t\t\t\tbreak;\n\n\t\t\tcase SCE_INNO_PREPROC:\n\t\t\t\tif (isWS || isEOL) {\n\t\t\t\t\tif (isascii(chPrev) && isalpha(chPrev)) {\n\t\t\t\t\t\tstate = SCE_INNO_DEFAULT;\n\t\t\t\t\t\tbuffer[bufferCount] = '\\0';\n\n\t\t\t\t\t\t\/\/ Check if the buffer contains a preprocessor directive\n\t\t\t\t\t\tif (preprocessorKeywords.InList(buffer)) {\n\t\t\t\t\t\t\tstyler.ColourTo(i-1,SCE_INNO_PREPROC);\n\t\t\t\t\t\t} else {\n\t\t\t\t\t\t\tstyler.ColourTo(i-1,SCE_INNO_DEFAULT);\n\t\t\t\t\t\t}\n\n\t\t\t\t\t\t\/\/ Push back the faulty character\n\t\t\t\t\t\tchNext = styler[i--];\n\t\t\t\t\t\tch = chPrev;\n\t\t\t\t\t}\n\t\t\t\t} else if (isascii(ch) && isalpha(ch)) {\n\t\t\t\t\tif (chPrev == '#' || chPrev == ' ' || chPrev == '\\t')\n\t\t\t\t\t\tbufferCount = 0;\n\t\t\t\t\tbuffer[bufferCount++] = static_cast<char>(tolower(ch));\n\t\t\t\t}\n\t\t\t\tbreak;\n\n\t\t\tcase SCE_INNO_STRING_DOUBLE:\n\t\t\t\tif (ch == '\"' || isEOL) {\n\t\t\t\t\tstate = SCE_INNO_DEFAULT;\n\t\t\t\t\tstyler.ColourTo(i,SCE_INNO_STRING_DOUBLE);\n\t\t\t\t}\n\t\t\t\tbreak;\n\n\t\t\tcase SCE_INNO_STRING_SINGLE:\n\t\t\t\tif (ch == '\\'' || isEOL) {\n\t\t\t\t\tstate = SCE_INNO_DEFAULT;\n\t\t\t\t\tstyler.ColourTo(i,SCE_INNO_STRING_SINGLE);\n\t\t\t\t}\n\t\t\t\tbreak;\n\n\t\t\tcase SCE_INNO_INLINE_EXPANSION:\n\t\t\t\tif (ch == '}') {\n\t\t\t\t\tstate = SCE_INNO_DEFAULT;\n\t\t\t\t\tstyler.ColourTo(i,SCE_INNO_INLINE_EXPANSION);\n\t\t\t\t} else if (isEOL) {\n\t\t\t\t\tstate = SCE_INNO_DEFAULT;\n\t\t\t\t\tstyler.ColourTo(i,SCE_INNO_DEFAULT);\n\t\t\t\t}\n\t\t\t\tbreak;\n\n\t\t\tcase SCE_INNO_COMMENT_PASCAL:\n\t\t\t\tif (isCStyleComment) {\n\t\t\t\t\tif (isEOL) {\n\t\t\t\t\t\tstate = SCE_INNO_DEFAULT;\n\t\t\t\t\t\tstyler.ColourTo(i,SCE_INNO_COMMENT_PASCAL);\n\t\t\t\t\t}\n\t\t\t\t} else {\n\t\t\t\t\tif (ch == '}' || (ch == ')' && chPrev == '*')) {\n\t\t\t\t\t\tstate = SCE_INNO_DEFAULT;\n\t\t\t\t\t\tstyler.ColourTo(i,SCE_INNO_COMMENT_PASCAL);\n\t\t\t\t\t} else if (isEOL) {\n\t\t\t\t\t\tstate = SCE_INNO_DEFAULT;\n\t\t\t\t\t\tstyler.ColourTo(i,SCE_INNO_DEFAULT);\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\tbreak;\n\n\t\t}\n\t}\n\tdelete []buffer;\n}\n\nstatic const char * const innoWordListDesc[] = {\n\t\"Sections\",\n\t\"Keywords\",\n\t\"Parameters\",\n\t\"Preprocessor directives\",\n\t\"Pascal keywords\",\n\t\"User defined keywords\",\n\t0\n};\n\nstatic void FoldInnoDoc(unsigned int startPos, int length, int, WordList *[], Accessor &styler) {\n\tunsigned int endPos = startPos + length;\n\tchar chNext = styler[startPos];\n\n\tint lineCurrent = styler.GetLine(startPos);\n\n\tbool sectionFlag = false;\n\tint levelPrev = lineCurrent > 0 ? styler.LevelAt(lineCurrent - 1) : SC_FOLDLEVELBASE;\n\tint level;\n\n\tfor (unsigned int i = startPos; i < endPos; i++) {\n\t\tchar ch = chNext;\n\t\tchNext = styler[i+1];\n\t\tbool atEOL = (ch == '\\r' && chNext != '\\n') || (ch == '\\n');\n\t\tint style = styler.StyleAt(i);\n\n\t\tif (style == SCE_INNO_SECTION)\n\t\t\tsectionFlag = true;\n\n\t\tif (atEOL || i == endPos - 1) {\n\t\t\tif (sectionFlag) {\n\t\t\t\tlevel = SC_FOLDLEVELBASE | SC_FOLDLEVELHEADERFLAG;\n\t\t\t\tif (level == levelPrev)\n\t\t\t\t\tstyler.SetLevel(lineCurrent - 1, levelPrev & ~SC_FOLDLEVELHEADERFLAG);\n\t\t\t} else {\n\t\t\t\tlevel = levelPrev & SC_FOLDLEVELNUMBERMASK;\n\t\t\t\tif (levelPrev & SC_FOLDLEVELHEADERFLAG)\n\t\t\t\t\tlevel++;\n\t\t\t}\n\n\t\t\tstyler.SetLevel(lineCurrent, level);\n\n\t\t\tlevelPrev = level;\n\t\t\tlineCurrent++;\n\t\t\tsectionFlag = false;\n\t\t}\n\t}\n}\n\nLexerModule lmInno(SCLEX_INNOSETUP, ColouriseInnoDoc, \"inno\", FoldInnoDoc, innoWordListDesc);\n<commit_msg>Bug #3283880. Highlight source code inside [CODE] section when lexing starts in the middle. From Marko Njezic.<commit_after>\/\/ Scintilla source code edit control\n\/** @file LexInno.cxx\n ** Lexer for Inno Setup scripts.\n **\/\n\/\/ Written by Friedrich Vedder <fvedd@t-online.de>, using code from LexOthers.cxx.\n\/\/ The License.txt file describes the conditions under which this software may be distributed.\n\n#include <stdlib.h>\n#include <string.h>\n#include <stdio.h>\n#include <stdarg.h>\n#include <assert.h>\n#include <ctype.h>\n\n#include \"ILexer.h\"\n#include \"Scintilla.h\"\n#include \"SciLexer.h\"\n\n#include \"WordList.h\"\n#include \"LexAccessor.h\"\n#include \"Accessor.h\"\n#include \"StyleContext.h\"\n#include \"CharacterSet.h\"\n#include \"LexerModule.h\"\n\n#ifdef SCI_NAMESPACE\nusing namespace Scintilla;\n#endif\n\nstatic void ColouriseInnoDoc(unsigned int startPos, int length, int, WordList *keywordLists[], Accessor &styler) {\n\tint state = SCE_INNO_DEFAULT;\n\tchar chPrev;\n\tchar ch = 0;\n\tchar chNext = styler[startPos];\n\tint lengthDoc = startPos + length;\n\tchar *buffer = new char[length];\n\tint bufferCount = 0;\n\tbool isBOL, isEOL, isWS, isBOLWS = 0;\n\tbool isCStyleComment = false;\n\n\tWordList §ionKeywords = *keywordLists[0];\n\tWordList &standardKeywords = *keywordLists[1];\n\tWordList ¶meterKeywords = *keywordLists[2];\n\tWordList &preprocessorKeywords = *keywordLists[3];\n\tWordList &pascalKeywords = *keywordLists[4];\n\tWordList &userKeywords = *keywordLists[5];\n\n\tint curLine = styler.GetLine(startPos);\n\tint curLineState = curLine > 0 ? styler.GetLineState(curLine - 1) : 0;\n\tbool isCode = (curLineState == 1);\n\n\t\/\/ Go through all provided text segment\n\t\/\/ using the hand-written state machine shown below\n\tstyler.StartAt(startPos);\n\tstyler.StartSegment(startPos);\n\tfor (int i = startPos; i < lengthDoc; i++) {\n\t\tchPrev = ch;\n\t\tch = chNext;\n\t\tchNext = styler.SafeGetCharAt(i + 1);\n\n\t\tif (styler.IsLeadByte(ch)) {\n\t\t\tchNext = styler.SafeGetCharAt(i + 2);\n\t\t\ti++;\n\t\t\tcontinue;\n\t\t}\n\n\t\tisBOL = (chPrev == 0) || (chPrev == '\\n') || (chPrev == '\\r' && ch != '\\n');\n\t\tisBOLWS = (isBOL) ? 1 : (isBOLWS && (chPrev == ' ' || chPrev == '\\t'));\n\t\tisEOL = (ch == '\\n' || ch == '\\r');\n\t\tisWS = (ch == ' ' || ch == '\\t');\n\n\t\tif ((ch == '\\r' && chNext != '\\n') || (ch == '\\n')) {\n\t\t\t\/\/ Remember the line state for future incremental lexing\n\t\t\tcurLine = styler.GetLine(i);\n\t\t\tstyler.SetLineState(curLine, (isCode ? 1 : 0));\n\t\t}\n\n\t\tswitch(state) {\n\t\t\tcase SCE_INNO_DEFAULT:\n\t\t\t\tif (!isCode && ch == ';' && isBOLWS) {\n\t\t\t\t\t\/\/ Start of a comment\n\t\t\t\t\tstate = SCE_INNO_COMMENT;\n\t\t\t\t} else if (ch == '[' && isBOLWS) {\n\t\t\t\t\t\/\/ Start of a section name\n\t\t\t\t\tbufferCount = 0;\n\t\t\t\t\tstate = SCE_INNO_SECTION;\n\t\t\t\t} else if (ch == '#' && isBOLWS) {\n\t\t\t\t\t\/\/ Start of a preprocessor directive\n\t\t\t\t\tstate = SCE_INNO_PREPROC;\n\t\t\t\t} else if (!isCode && ch == '{' && chNext != '{' && chPrev != '{') {\n\t\t\t\t\t\/\/ Start of an inline expansion\n\t\t\t\t\tstate = SCE_INNO_INLINE_EXPANSION;\n\t\t\t\t} else if (isCode && (ch == '{' || (ch == '(' && chNext == '*'))) {\n\t\t\t\t\t\/\/ Start of a Pascal comment\n\t\t\t\t\tstate = SCE_INNO_COMMENT_PASCAL;\n\t\t\t\t\tisCStyleComment = false;\n\t\t\t\t} else if (isCode && ch == '\/' && chNext == '\/') {\n\t\t\t\t\t\/\/ Apparently, C-style comments are legal, too\n\t\t\t\t\tstate = SCE_INNO_COMMENT_PASCAL;\n\t\t\t\t\tisCStyleComment = true;\n\t\t\t\t} else if (ch == '\"') {\n\t\t\t\t\t\/\/ Start of a double-quote string\n\t\t\t\t\tstate = SCE_INNO_STRING_DOUBLE;\n\t\t\t\t} else if (ch == '\\'') {\n\t\t\t\t\t\/\/ Start of a single-quote string\n\t\t\t\t\tstate = SCE_INNO_STRING_SINGLE;\n\t\t\t\t} else if (isascii(ch) && (isalpha(ch) || (ch == '_'))) {\n\t\t\t\t\t\/\/ Start of an identifier\n\t\t\t\t\tbufferCount = 0;\n\t\t\t\t\tbuffer[bufferCount++] = static_cast<char>(tolower(ch));\n\t\t\t\t\tstate = SCE_INNO_IDENTIFIER;\n\t\t\t\t} else {\n\t\t\t\t\t\/\/ Style it the default style\n\t\t\t\t\tstyler.ColourTo(i,SCE_INNO_DEFAULT);\n\t\t\t\t}\n\t\t\t\tbreak;\n\n\t\t\tcase SCE_INNO_COMMENT:\n\t\t\t\tif (isEOL) {\n\t\t\t\t\tstate = SCE_INNO_DEFAULT;\n\t\t\t\t\tstyler.ColourTo(i,SCE_INNO_COMMENT);\n\t\t\t\t}\n\t\t\t\tbreak;\n\n\t\t\tcase SCE_INNO_IDENTIFIER:\n\t\t\t\tif (isascii(ch) && (isalnum(ch) || (ch == '_'))) {\n\t\t\t\t\tbuffer[bufferCount++] = static_cast<char>(tolower(ch));\n\t\t\t\t} else {\n\t\t\t\t\tstate = SCE_INNO_DEFAULT;\n\t\t\t\t\tbuffer[bufferCount] = '\\0';\n\n\t\t\t\t\t\/\/ Check if the buffer contains a keyword\n\t\t\t\t\tif (!isCode && standardKeywords.InList(buffer)) {\n\t\t\t\t\t\tstyler.ColourTo(i-1,SCE_INNO_KEYWORD);\n\t\t\t\t\t} else if (!isCode && parameterKeywords.InList(buffer)) {\n\t\t\t\t\t\tstyler.ColourTo(i-1,SCE_INNO_PARAMETER);\n\t\t\t\t\t} else if (isCode && pascalKeywords.InList(buffer)) {\n\t\t\t\t\t\tstyler.ColourTo(i-1,SCE_INNO_KEYWORD_PASCAL);\n\t\t\t\t\t} else if (!isCode && userKeywords.InList(buffer)) {\n\t\t\t\t\t\tstyler.ColourTo(i-1,SCE_INNO_KEYWORD_USER);\n\t\t\t\t\t} else {\n\t\t\t\t\t\tstyler.ColourTo(i-1,SCE_INNO_DEFAULT);\n\t\t\t\t\t}\n\n\t\t\t\t\t\/\/ Push back the faulty character\n\t\t\t\t\tchNext = styler[i--];\n\t\t\t\t\tch = chPrev;\n\t\t\t\t}\n\t\t\t\tbreak;\n\n\t\t\tcase SCE_INNO_SECTION:\n\t\t\t\tif (ch == ']') {\n\t\t\t\t\tstate = SCE_INNO_DEFAULT;\n\t\t\t\t\tbuffer[bufferCount] = '\\0';\n\n\t\t\t\t\t\/\/ Check if the buffer contains a section name\n\t\t\t\t\tif (sectionKeywords.InList(buffer)) {\n\t\t\t\t\t\tstyler.ColourTo(i,SCE_INNO_SECTION);\n\t\t\t\t\t\tisCode = !CompareCaseInsensitive(buffer, \"code\");\n\t\t\t\t\t} else {\n\t\t\t\t\t\tstyler.ColourTo(i,SCE_INNO_DEFAULT);\n\t\t\t\t\t}\n\t\t\t\t} else if (isascii(ch) && (isalnum(ch) || (ch == '_'))) {\n\t\t\t\t\tbuffer[bufferCount++] = static_cast<char>(tolower(ch));\n\t\t\t\t} else {\n\t\t\t\t\tstate = SCE_INNO_DEFAULT;\n\t\t\t\t\tstyler.ColourTo(i,SCE_INNO_DEFAULT);\n\t\t\t\t}\n\t\t\t\tbreak;\n\n\t\t\tcase SCE_INNO_PREPROC:\n\t\t\t\tif (isWS || isEOL) {\n\t\t\t\t\tif (isascii(chPrev) && isalpha(chPrev)) {\n\t\t\t\t\t\tstate = SCE_INNO_DEFAULT;\n\t\t\t\t\t\tbuffer[bufferCount] = '\\0';\n\n\t\t\t\t\t\t\/\/ Check if the buffer contains a preprocessor directive\n\t\t\t\t\t\tif (preprocessorKeywords.InList(buffer)) {\n\t\t\t\t\t\t\tstyler.ColourTo(i-1,SCE_INNO_PREPROC);\n\t\t\t\t\t\t} else {\n\t\t\t\t\t\t\tstyler.ColourTo(i-1,SCE_INNO_DEFAULT);\n\t\t\t\t\t\t}\n\n\t\t\t\t\t\t\/\/ Push back the faulty character\n\t\t\t\t\t\tchNext = styler[i--];\n\t\t\t\t\t\tch = chPrev;\n\t\t\t\t\t}\n\t\t\t\t} else if (isascii(ch) && isalpha(ch)) {\n\t\t\t\t\tif (chPrev == '#' || chPrev == ' ' || chPrev == '\\t')\n\t\t\t\t\t\tbufferCount = 0;\n\t\t\t\t\tbuffer[bufferCount++] = static_cast<char>(tolower(ch));\n\t\t\t\t}\n\t\t\t\tbreak;\n\n\t\t\tcase SCE_INNO_STRING_DOUBLE:\n\t\t\t\tif (ch == '\"' || isEOL) {\n\t\t\t\t\tstate = SCE_INNO_DEFAULT;\n\t\t\t\t\tstyler.ColourTo(i,SCE_INNO_STRING_DOUBLE);\n\t\t\t\t}\n\t\t\t\tbreak;\n\n\t\t\tcase SCE_INNO_STRING_SINGLE:\n\t\t\t\tif (ch == '\\'' || isEOL) {\n\t\t\t\t\tstate = SCE_INNO_DEFAULT;\n\t\t\t\t\tstyler.ColourTo(i,SCE_INNO_STRING_SINGLE);\n\t\t\t\t}\n\t\t\t\tbreak;\n\n\t\t\tcase SCE_INNO_INLINE_EXPANSION:\n\t\t\t\tif (ch == '}') {\n\t\t\t\t\tstate = SCE_INNO_DEFAULT;\n\t\t\t\t\tstyler.ColourTo(i,SCE_INNO_INLINE_EXPANSION);\n\t\t\t\t} else if (isEOL) {\n\t\t\t\t\tstate = SCE_INNO_DEFAULT;\n\t\t\t\t\tstyler.ColourTo(i,SCE_INNO_DEFAULT);\n\t\t\t\t}\n\t\t\t\tbreak;\n\n\t\t\tcase SCE_INNO_COMMENT_PASCAL:\n\t\t\t\tif (isCStyleComment) {\n\t\t\t\t\tif (isEOL) {\n\t\t\t\t\t\tstate = SCE_INNO_DEFAULT;\n\t\t\t\t\t\tstyler.ColourTo(i,SCE_INNO_COMMENT_PASCAL);\n\t\t\t\t\t}\n\t\t\t\t} else {\n\t\t\t\t\tif (ch == '}' || (ch == ')' && chPrev == '*')) {\n\t\t\t\t\t\tstate = SCE_INNO_DEFAULT;\n\t\t\t\t\t\tstyler.ColourTo(i,SCE_INNO_COMMENT_PASCAL);\n\t\t\t\t\t} else if (isEOL) {\n\t\t\t\t\t\tstate = SCE_INNO_DEFAULT;\n\t\t\t\t\t\tstyler.ColourTo(i,SCE_INNO_DEFAULT);\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\tbreak;\n\n\t\t}\n\t}\n\tdelete []buffer;\n}\n\nstatic const char * const innoWordListDesc[] = {\n\t\"Sections\",\n\t\"Keywords\",\n\t\"Parameters\",\n\t\"Preprocessor directives\",\n\t\"Pascal keywords\",\n\t\"User defined keywords\",\n\t0\n};\n\nstatic void FoldInnoDoc(unsigned int startPos, int length, int, WordList *[], Accessor &styler) {\n\tunsigned int endPos = startPos + length;\n\tchar chNext = styler[startPos];\n\n\tint lineCurrent = styler.GetLine(startPos);\n\n\tbool sectionFlag = false;\n\tint levelPrev = lineCurrent > 0 ? styler.LevelAt(lineCurrent - 1) : SC_FOLDLEVELBASE;\n\tint level;\n\n\tfor (unsigned int i = startPos; i < endPos; i++) {\n\t\tchar ch = chNext;\n\t\tchNext = styler[i+1];\n\t\tbool atEOL = (ch == '\\r' && chNext != '\\n') || (ch == '\\n');\n\t\tint style = styler.StyleAt(i);\n\n\t\tif (style == SCE_INNO_SECTION)\n\t\t\tsectionFlag = true;\n\n\t\tif (atEOL || i == endPos - 1) {\n\t\t\tif (sectionFlag) {\n\t\t\t\tlevel = SC_FOLDLEVELBASE | SC_FOLDLEVELHEADERFLAG;\n\t\t\t\tif (level == levelPrev)\n\t\t\t\t\tstyler.SetLevel(lineCurrent - 1, levelPrev & ~SC_FOLDLEVELHEADERFLAG);\n\t\t\t} else {\n\t\t\t\tlevel = levelPrev & SC_FOLDLEVELNUMBERMASK;\n\t\t\t\tif (levelPrev & SC_FOLDLEVELHEADERFLAG)\n\t\t\t\t\tlevel++;\n\t\t\t}\n\n\t\t\tstyler.SetLevel(lineCurrent, level);\n\n\t\t\tlevelPrev = level;\n\t\t\tlineCurrent++;\n\t\t\tsectionFlag = false;\n\t\t}\n\t}\n}\n\nLexerModule lmInno(SCLEX_INNOSETUP, ColouriseInnoDoc, \"inno\", FoldInnoDoc, innoWordListDesc);\n<|endoftext|>"} {"text":"<commit_before>\/*\n * (C) Copyright 2013 Kurento (http:\/\/kurento.org\/)\n *\n * All rights reserved. This program and the accompanying materials\n * are made available under the terms of the GNU Lesser General Public License\n * (LGPL) version 2.1 which accompanies this distribution, and is available at\n * http:\/\/www.gnu.org\/licenses\/lgpl-2.1.html\n *\n * This library is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU\n * Lesser General Public License for more details.\n *\n *\/\n#ifdef HAVE_CONFIG_H\n#include \"config.h\"\n#endif\n\n#include <gst\/gst.h>\n\n#include \"KmsHttpLoop.h\"\n\n#define NAME \"httploop\"\n\nGST_DEBUG_CATEGORY_STATIC (kms_http_loop_debug_category);\n#define GST_CAT_DEFAULT kms_http_loop_debug_category\n\nG_DEFINE_TYPE_WITH_CODE (KmsHttpLoop, kms_http_loop,\n G_TYPE_OBJECT,\n GST_DEBUG_CATEGORY_INIT (kms_http_loop_debug_category,\n NAME, 0, \"debug category for kurento loop\") )\n\n#define KMS_HTTP_LOOP_GET_PRIVATE(obj) (G_TYPE_INSTANCE_GET_PRIVATE((obj), KMS_TYPE_HTTP_LOOP, KmsHttpLoopPrivate))\n\nstruct _KmsHttpLoopPrivate {\n GThread *thread;\n GRecMutex rmutex;\n GMainLoop *loop;\n GMainContext *context;\n GCond cond;\n GMutex mutex;\n gboolean initialized;\n};\n\n#define KMS_HTTP_LOOP_LOCK(elem) \\\n (g_rec_mutex_lock (&KMS_HTTP_LOOP ((elem))->priv->rmutex))\n#define KMS_HTTP_LOOP_UNLOCK(elem) \\\n (g_rec_mutex_unlock (&KMS_HTTP_LOOP ((elem))->priv->rmutex))\n\n\/* Object properties *\/\nenum {\n PROP_0,\n PROP_CONTEXT,\n N_PROPERTIES\n};\n\nstatic GParamSpec *obj_properties[N_PROPERTIES] = { NULL, };\n\nstatic gboolean\nquit_main_loop (KmsHttpLoop *self)\n{\n GST_DEBUG (\"Exiting main loop\");\n\n g_main_loop_quit (self->priv->loop);\n g_main_context_release (self->priv->context);\n\n return G_SOURCE_REMOVE;\n}\n\nstatic gpointer\nloop_thread_init (gpointer data)\n{\n KmsHttpLoop *self = KMS_HTTP_LOOP (data);\n GMainLoop *loop;\n GMainContext *context;\n\n KMS_HTTP_LOOP_LOCK (self);\n self->priv->context = g_main_context_new ();\n context = self->priv->context;\n self->priv->loop = g_main_loop_new (context, FALSE);\n loop = self->priv->loop;\n KMS_HTTP_LOOP_UNLOCK (self);\n\n \/* unlock main process because context is already initialized *\/\n g_mutex_lock (&self->priv->mutex);\n self->priv->initialized = TRUE;\n g_cond_signal (&self->priv->cond);\n g_mutex_unlock (&self->priv->mutex);\n\n if (!g_main_context_acquire (context) ) {\n GST_ERROR (\"Can not acquire context\");\n goto end;\n }\n\n GST_DEBUG (\"Running main loop\");\n g_main_loop_run (loop);\n\nend:\n GST_DEBUG (\"Thread finished\");\n\n return NULL;\n}\n\nstatic void\nkms_http_loop_get_property (GObject *object, guint property_id, GValue *value,\n GParamSpec *pspec)\n{\n KmsHttpLoop *self = KMS_HTTP_LOOP (object);\n\n KMS_HTTP_LOOP_LOCK (self);\n\n switch (property_id) {\n case PROP_CONTEXT:\n g_value_set_boxed (value, self->priv->context);\n break;\n\n default:\n G_OBJECT_WARN_INVALID_PROPERTY_ID (object, property_id, pspec);\n break;\n }\n\n KMS_HTTP_LOOP_UNLOCK (self);\n}\n\nstatic void\nkms_http_loop_dispose (GObject *obj)\n{\n KmsHttpLoop *self = KMS_HTTP_LOOP (obj);\n\n GST_DEBUG_OBJECT (obj, \"Dispose\");\n\n KMS_HTTP_LOOP_LOCK (self);\n\n if (self->priv->thread != NULL) {\n if (g_thread_self () != self->priv->thread) {\n GThread *aux = self->priv->thread;\n\n kms_http_loop_idle_add (self, (GSourceFunc) quit_main_loop,\n self);\n self->priv->thread = NULL;\n KMS_HTTP_LOOP_UNLOCK (self);\n g_thread_join (aux);\n KMS_HTTP_LOOP_LOCK (self);\n } else {\n \/* self thread does not need to wait for itself *\/\n quit_main_loop (self);\n g_thread_unref (self->priv->thread);\n self->priv->thread = NULL;\n }\n }\n\n KMS_HTTP_LOOP_UNLOCK (self);\n\n G_OBJECT_CLASS (kms_http_loop_parent_class)->dispose (obj);\n}\n\nstatic void\nkms_http_loop_finalize (GObject *obj)\n{\n KmsHttpLoop *self = KMS_HTTP_LOOP (obj);\n\n GST_DEBUG_OBJECT (obj, \"Finalize\");\n\n if (self->priv->context != NULL) {\n g_main_context_unref (self->priv->context);\n }\n\n if (self->priv->loop != NULL) {\n g_main_loop_unref (self->priv->loop);\n }\n\n g_rec_mutex_clear (&self->priv->rmutex);\n g_mutex_clear (&self->priv->mutex);\n g_cond_clear (&self->priv->cond);\n\n G_OBJECT_CLASS (kms_http_loop_parent_class)->finalize (obj);\n}\n\nstatic void\nkms_http_loop_class_init (KmsHttpLoopClass *klass)\n{\n GObjectClass *objclass = G_OBJECT_CLASS (klass);\n\n objclass->dispose = kms_http_loop_dispose;\n objclass->finalize = kms_http_loop_finalize;\n objclass->get_property = kms_http_loop_get_property;\n\n \/* Install properties *\/\n obj_properties[PROP_CONTEXT] = g_param_spec_boxed (\"context\",\n \"Main loop context\",\n \"Main loop context\",\n G_TYPE_MAIN_CONTEXT,\n (GParamFlags) (G_PARAM_READABLE) );\n\n g_object_class_install_properties (objclass, N_PROPERTIES, obj_properties);\n\n \/* Registers a private structure for the instantiatable type *\/\n g_type_class_add_private (klass, sizeof (KmsHttpLoopPrivate) );\n}\n\nstatic void\nkms_http_loop_init (KmsHttpLoop *self)\n{\n self->priv = KMS_HTTP_LOOP_GET_PRIVATE (self);\n self->priv->context = NULL;\n self->priv->loop = NULL;\n g_rec_mutex_init (&self->priv->rmutex);\n g_cond_init (&self->priv->cond);\n g_mutex_init (&self->priv->mutex);\n\n self->priv->thread = g_thread_new (\"KmsHttpLoop\", loop_thread_init, self);\n\n g_mutex_lock (&self->priv->mutex);\n\n while (!self->priv->initialized) {\n g_cond_wait (&self->priv->cond, &self->priv->mutex);\n }\n\n g_mutex_unlock (&self->priv->mutex);\n}\n\nKmsHttpLoop *\nkms_http_loop_new (void)\n{\n return KMS_HTTP_LOOP (g_object_new (KMS_TYPE_HTTP_LOOP, NULL) );\n}\n\nstatic guint\nkms_http_loop_attach (KmsHttpLoop *self, GSource *source, gint priority,\n GSourceFunc function, gpointer data,\n GDestroyNotify notify)\n{\n guint id;\n\n KMS_HTTP_LOOP_LOCK (self);\n\n if (self->priv->thread == NULL) {\n KMS_HTTP_LOOP_UNLOCK (self);\n return 0;\n }\n\n g_source_set_priority (source, priority);\n g_source_set_callback (source, function, data, notify);\n id = g_source_attach (source, self->priv->context);\n\n KMS_HTTP_LOOP_UNLOCK (self);\n\n return id;\n}\n\nguint\nkms_http_loop_idle_add_full (KmsHttpLoop *self, gint priority,\n GSourceFunc function,\n gpointer data, GDestroyNotify notify)\n{\n GSource *source;\n guint id;\n\n if (!KMS_IS_HTTP_LOOP (self) ) {\n return 0;\n }\n\n source = g_idle_source_new ();\n id = kms_http_loop_attach (self, source, priority, function, data, notify);\n g_source_unref (source);\n\n return id;\n}\n\nguint\nkms_http_loop_idle_add (KmsHttpLoop *self, GSourceFunc function, gpointer data)\n{\n return kms_http_loop_idle_add_full (self, G_PRIORITY_DEFAULT_IDLE, function,\n data,\n NULL);\n}\n\nguint\nkms_http_loop_timeout_add_full (KmsHttpLoop *self, gint priority,\n guint interval,\n GSourceFunc function, gpointer data,\n GDestroyNotify notify)\n{\n GSource *source;\n guint id;\n\n if (!KMS_IS_HTTP_LOOP (self) ) {\n return 0;\n }\n\n source = g_timeout_source_new (interval);\n id = kms_http_loop_attach (self, source, priority, function, data, notify);\n g_source_unref (source);\n\n return id;\n}\n\nguint\nkms_http_loop_timeout_add (KmsHttpLoop *self, guint interval,\n GSourceFunc function,\n gpointer data)\n{\n return kms_http_loop_timeout_add_full (self, G_PRIORITY_DEFAULT, interval,\n function, data, NULL);\n}\n\ngboolean\nkms_http_loop_remove (KmsHttpLoop *self, guint source_id)\n{\n GSource *source;\n\n source = g_main_context_find_source_by_id (self->priv->context, source_id);\n\n if (source == NULL) {\n return FALSE;\n }\n\n g_source_destroy (source);\n return TRUE;\n}\n\ngboolean\nkms_http_loop_is_current_thread (KmsHttpLoop *self)\n{\n return (g_thread_self() == self->priv->thread);\n}\n<commit_msg>KmsHttpLoop: Thread should hold its own reference of context and loop<commit_after>\/*\n * (C) Copyright 2013 Kurento (http:\/\/kurento.org\/)\n *\n * All rights reserved. This program and the accompanying materials\n * are made available under the terms of the GNU Lesser General Public License\n * (LGPL) version 2.1 which accompanies this distribution, and is available at\n * http:\/\/www.gnu.org\/licenses\/lgpl-2.1.html\n *\n * This library is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU\n * Lesser General Public License for more details.\n *\n *\/\n#ifdef HAVE_CONFIG_H\n#include \"config.h\"\n#endif\n\n#include <gst\/gst.h>\n\n#include \"KmsHttpLoop.h\"\n\n#define NAME \"httploop\"\n\nGST_DEBUG_CATEGORY_STATIC (kms_http_loop_debug_category);\n#define GST_CAT_DEFAULT kms_http_loop_debug_category\n\nG_DEFINE_TYPE_WITH_CODE (KmsHttpLoop, kms_http_loop,\n G_TYPE_OBJECT,\n GST_DEBUG_CATEGORY_INIT (kms_http_loop_debug_category,\n NAME, 0, \"debug category for kurento loop\") )\n\n#define KMS_HTTP_LOOP_GET_PRIVATE(obj) (G_TYPE_INSTANCE_GET_PRIVATE((obj), KMS_TYPE_HTTP_LOOP, KmsHttpLoopPrivate))\n\nstruct _KmsHttpLoopPrivate {\n GThread *thread;\n GRecMutex rmutex;\n GMainLoop *loop;\n GMainContext *context;\n GCond cond;\n GMutex mutex;\n gboolean initialized;\n};\n\n#define KMS_HTTP_LOOP_LOCK(elem) \\\n (g_rec_mutex_lock (&KMS_HTTP_LOOP ((elem))->priv->rmutex))\n#define KMS_HTTP_LOOP_UNLOCK(elem) \\\n (g_rec_mutex_unlock (&KMS_HTTP_LOOP ((elem))->priv->rmutex))\n\n\/* Object properties *\/\nenum {\n PROP_0,\n PROP_CONTEXT,\n N_PROPERTIES\n};\n\nstatic GParamSpec *obj_properties[N_PROPERTIES] = { NULL, };\n\nstatic gboolean\nquit_main_loop (KmsHttpLoop *self)\n{\n GST_DEBUG (\"Exiting main loop\");\n\n g_main_loop_quit (self->priv->loop);\n\n return G_SOURCE_REMOVE;\n}\n\nstatic gpointer\nloop_thread_init (gpointer data)\n{\n KmsHttpLoop *self = KMS_HTTP_LOOP (data);\n GMainLoop *loop;\n GMainContext *context;\n\n KMS_HTTP_LOOP_LOCK (self);\n self->priv->context = g_main_context_new ();\n context = g_main_context_ref (self->priv->context);\n self->priv->loop = g_main_loop_new (context, FALSE);\n loop = g_main_loop_ref (self->priv->loop);\n KMS_HTTP_LOOP_UNLOCK (self);\n\n \/* unlock main process because context is already initialized *\/\n g_mutex_lock (&self->priv->mutex);\n self->priv->initialized = TRUE;\n g_cond_signal (&self->priv->cond);\n g_mutex_unlock (&self->priv->mutex);\n\n if (!g_main_context_acquire (context) ) {\n GST_ERROR (\"Can not acquire context\");\n goto end;\n }\n\n GST_DEBUG (\"Running main loop\");\n g_main_loop_run (loop);\n g_main_context_release (context);\n\nend:\n GST_DEBUG (\"Thread finished\");\n g_main_loop_unref (loop);\n g_main_context_unref (context);\n\n return NULL;\n}\n\nstatic void\nkms_http_loop_get_property (GObject *object, guint property_id, GValue *value,\n GParamSpec *pspec)\n{\n KmsHttpLoop *self = KMS_HTTP_LOOP (object);\n\n KMS_HTTP_LOOP_LOCK (self);\n\n switch (property_id) {\n case PROP_CONTEXT:\n g_value_set_boxed (value, self->priv->context);\n break;\n\n default:\n G_OBJECT_WARN_INVALID_PROPERTY_ID (object, property_id, pspec);\n break;\n }\n\n KMS_HTTP_LOOP_UNLOCK (self);\n}\n\nstatic void\nkms_http_loop_dispose (GObject *obj)\n{\n KmsHttpLoop *self = KMS_HTTP_LOOP (obj);\n\n GST_DEBUG_OBJECT (obj, \"Dispose\");\n\n KMS_HTTP_LOOP_LOCK (self);\n\n if (self->priv->thread != NULL) {\n if (g_thread_self () != self->priv->thread) {\n GThread *aux = self->priv->thread;\n\n kms_http_loop_idle_add (self, (GSourceFunc) quit_main_loop,\n self);\n self->priv->thread = NULL;\n KMS_HTTP_LOOP_UNLOCK (self);\n g_thread_join (aux);\n KMS_HTTP_LOOP_LOCK (self);\n } else {\n \/* self thread does not need to wait for itself *\/\n quit_main_loop (self);\n g_thread_unref (self->priv->thread);\n self->priv->thread = NULL;\n }\n }\n\n KMS_HTTP_LOOP_UNLOCK (self);\n\n G_OBJECT_CLASS (kms_http_loop_parent_class)->dispose (obj);\n}\n\nstatic void\nkms_http_loop_finalize (GObject *obj)\n{\n KmsHttpLoop *self = KMS_HTTP_LOOP (obj);\n\n GST_DEBUG_OBJECT (obj, \"Finalize\");\n\n if (self->priv->context != NULL) {\n g_main_context_unref (self->priv->context);\n }\n\n if (self->priv->loop != NULL) {\n g_main_loop_unref (self->priv->loop);\n }\n\n g_rec_mutex_clear (&self->priv->rmutex);\n g_mutex_clear (&self->priv->mutex);\n g_cond_clear (&self->priv->cond);\n\n G_OBJECT_CLASS (kms_http_loop_parent_class)->finalize (obj);\n}\n\nstatic void\nkms_http_loop_class_init (KmsHttpLoopClass *klass)\n{\n GObjectClass *objclass = G_OBJECT_CLASS (klass);\n\n objclass->dispose = kms_http_loop_dispose;\n objclass->finalize = kms_http_loop_finalize;\n objclass->get_property = kms_http_loop_get_property;\n\n \/* Install properties *\/\n obj_properties[PROP_CONTEXT] = g_param_spec_boxed (\"context\",\n \"Main loop context\",\n \"Main loop context\",\n G_TYPE_MAIN_CONTEXT,\n (GParamFlags) (G_PARAM_READABLE) );\n\n g_object_class_install_properties (objclass, N_PROPERTIES, obj_properties);\n\n \/* Registers a private structure for the instantiatable type *\/\n g_type_class_add_private (klass, sizeof (KmsHttpLoopPrivate) );\n}\n\nstatic void\nkms_http_loop_init (KmsHttpLoop *self)\n{\n self->priv = KMS_HTTP_LOOP_GET_PRIVATE (self);\n self->priv->context = NULL;\n self->priv->loop = NULL;\n g_rec_mutex_init (&self->priv->rmutex);\n g_cond_init (&self->priv->cond);\n g_mutex_init (&self->priv->mutex);\n\n self->priv->thread = g_thread_new (\"KmsHttpLoop\", loop_thread_init, self);\n\n g_mutex_lock (&self->priv->mutex);\n\n while (!self->priv->initialized) {\n g_cond_wait (&self->priv->cond, &self->priv->mutex);\n }\n\n g_mutex_unlock (&self->priv->mutex);\n}\n\nKmsHttpLoop *\nkms_http_loop_new (void)\n{\n return KMS_HTTP_LOOP (g_object_new (KMS_TYPE_HTTP_LOOP, NULL) );\n}\n\nstatic guint\nkms_http_loop_attach (KmsHttpLoop *self, GSource *source, gint priority,\n GSourceFunc function, gpointer data,\n GDestroyNotify notify)\n{\n guint id;\n\n KMS_HTTP_LOOP_LOCK (self);\n\n if (self->priv->thread == NULL) {\n KMS_HTTP_LOOP_UNLOCK (self);\n return 0;\n }\n\n g_source_set_priority (source, priority);\n g_source_set_callback (source, function, data, notify);\n id = g_source_attach (source, self->priv->context);\n\n KMS_HTTP_LOOP_UNLOCK (self);\n\n return id;\n}\n\nguint\nkms_http_loop_idle_add_full (KmsHttpLoop *self, gint priority,\n GSourceFunc function,\n gpointer data, GDestroyNotify notify)\n{\n GSource *source;\n guint id;\n\n if (!KMS_IS_HTTP_LOOP (self) ) {\n return 0;\n }\n\n source = g_idle_source_new ();\n id = kms_http_loop_attach (self, source, priority, function, data, notify);\n g_source_unref (source);\n\n return id;\n}\n\nguint\nkms_http_loop_idle_add (KmsHttpLoop *self, GSourceFunc function, gpointer data)\n{\n return kms_http_loop_idle_add_full (self, G_PRIORITY_DEFAULT_IDLE, function,\n data,\n NULL);\n}\n\nguint\nkms_http_loop_timeout_add_full (KmsHttpLoop *self, gint priority,\n guint interval,\n GSourceFunc function, gpointer data,\n GDestroyNotify notify)\n{\n GSource *source;\n guint id;\n\n if (!KMS_IS_HTTP_LOOP (self) ) {\n return 0;\n }\n\n source = g_timeout_source_new (interval);\n id = kms_http_loop_attach (self, source, priority, function, data, notify);\n g_source_unref (source);\n\n return id;\n}\n\nguint\nkms_http_loop_timeout_add (KmsHttpLoop *self, guint interval,\n GSourceFunc function,\n gpointer data)\n{\n return kms_http_loop_timeout_add_full (self, G_PRIORITY_DEFAULT, interval,\n function, data, NULL);\n}\n\ngboolean\nkms_http_loop_remove (KmsHttpLoop *self, guint source_id)\n{\n GSource *source;\n\n source = g_main_context_find_source_by_id (self->priv->context, source_id);\n\n if (source == NULL) {\n return FALSE;\n }\n\n g_source_destroy (source);\n return TRUE;\n}\n\ngboolean\nkms_http_loop_is_current_thread (KmsHttpLoop *self)\n{\n return (g_thread_self() == self->priv->thread);\n}\n<|endoftext|>"} {"text":"<commit_before>#include \"EsCenterLines.h\"\n\nconst char *plugin_name{ \"EsCenterLines\" };\nconst char *plugin_version{ \"1.2\" };\nconst char *plugin_author{ \"Oliver Grtzmann\" };\nconst char *plugin_license{ \"tbd\" };\n\nEsCenterLines::EsCenterLines()\n\t: EuroScopePlugIn::CPlugIn(EuroScopePlugIn::COMPATIBILITY_CODE, plugin_name, plugin_version, plugin_author, plugin_license)\n{\n\tReadRunways();\n\tEuroScopePlugIn::CPlugIn::RegisterDisplayType(\"Center Lines\", false, true, false, false);\n}\n\nEsCenterLines::~EsCenterLines()\n{\n}\n\nEuroScopePlugIn::CRadarScreen *EsCenterLines::OnRadarScreenCreated(const char *sDisplayName, bool NeedRadarContent, bool GeoReferenced, bool CanBeSaved, bool CanBeCreated)\n{\n\tif (GeoReferenced)\n\t{\n\t\tauto cls = new CenterLinesScreen(lines, ticks, screens);\n\t\tscreens.push_back(cls);\n\t\treturn cls;\n\t}\n\treturn nullptr;\n}\n\nvoid EsCenterLines::OnAirportRunwayActivityChanged()\n{\n\tReadRunways();\n\tfor (auto x : screens)\n\t\tx->RefreshMapContent();\n\n}\n\nvoid EsCenterLines::CalculateLine(Runway_Definition &rd, bool apt_act, bool rwy_act)\n{\n\tdouble gl, ll, glll, dist;\n\tauto gd_line = geo.Line(rd.runway_threshold.latitude, rd.runway_threshold.longitude, rd.runway_heading_calculated - 180);\n\tfor (auto centerlines : rd.runway_settings.lines)\n\t{\n\t\tgl = NauticalMiles(centerlines.length_gap);\n\t\tll = NauticalMiles(centerlines.length_line);\n\t\tglll = gl + ll;\n\t\tdist = centerlines.starts_with_line ? 0 : gl;\n\t\tdist += NauticalMiles(centerlines.distance_thr);\n\t\tfor (auto i = 0; i < centerlines.repeats; ++i)\n\t\t{\n\t\t\tdouble lat, lon, lat2, lon2;\n\t\t\tgd_line.Position(dist, lat, lon);\n\t\t\tgd_line.Position(dist + ll, lat2, lon2);\n\t\t\tlines.push_back({ { lat, lon }, { lat2, lon2 }, apt_act, rwy_act });\n\t\t\tdist += glll;\n\t\t}\n\t}\n}\n\nvoid EsCenterLines::CalculateSpecial(Runway_Definition &rd, bool apt_act, bool rwy_act)\n{\n\tif (!rd.runway_settings.special.length)\n\t\treturn;\n\tauto gd_line = geo.Line(rd.runway_threshold.latitude, rd.runway_threshold.longitude, rd.runway_heading_calculated - 180);\n\tauto dist_thr = NauticalMiles(rd.runway_settings.special.distance_thr1);\n\tauto dist_thr2 = NauticalMiles(rd.runway_settings.special.distance_thr2);\n\tauto dist_thr3 = NauticalMiles(rd.runway_settings.special.distance_thr1 + rd.runway_settings.special.length);\n\tCoordinate origin, origin2, origin3, end, end2, end3;\n\tgd_line.Position(dist_thr, origin.latitude, origin.longitude);\n\tgd_line.Position(dist_thr2, origin2.latitude, origin2.longitude);\n\tgd_line.Position(dist_thr3, origin3.latitude, origin3.longitude);\n\tauto line_direction = (rd.runway_settings.special.direction == Direction::left ? rd.runway_heading_calculated - 180 + 90 : rd.runway_heading_calculated - 180 - 90);\n\tauto f_line = geo.Line(origin.latitude, origin.longitude, line_direction);\n\tauto f_line2 = geo.Line(origin2.latitude, origin2.longitude, line_direction);\n\tauto f_line3 = geo.Line(origin3.latitude, origin3.longitude, line_direction);\n\tf_line.Position(NauticalMiles(rd.runway_settings.special.distance_cl), end.latitude, end.longitude);\n\tf_line2.Position(NauticalMiles(rd.runway_settings.special.distance_cl), end2.latitude, end2.longitude);\n\tf_line3.Position(NauticalMiles(rd.runway_settings.special.distance_cl), end3.latitude, end3.longitude);\n\tlines.push_back({ origin, end, apt_act, rwy_act });\n\tlines.push_back({ origin2, end2, apt_act, rwy_act });\n\tlines.push_back({ end, end3, apt_act, rwy_act });\n}\n\nvoid EsCenterLines::CalculateTicks(Runway_Definition &rd, bool apt_act, bool rwy_act)\n{\n\tdouble dist_thr, dist_cl, length;\n\tauto gd_line = geo.Line(rd.runway_threshold.latitude, rd.runway_threshold.longitude, rd.runway_heading_calculated - 180);\n\tfor (auto rangeticks : rd.runway_settings.ticks)\n\t{\n\t\tdist_thr = NauticalMiles(rangeticks.distance_thr);\n\t\tdist_cl = NauticalMiles(rangeticks.distance_cl);\n\t\tlength = NauticalMiles(rangeticks.length);\n\t\tCoordinate tick_origin;\n\t\tgd_line.Position(dist_thr, tick_origin.latitude, tick_origin.longitude);\n\n\t\tif (rangeticks.direction == Direction::left || rangeticks.direction == Direction::both)\n\t\t{\n\t\t\tauto tick_line = geo.Line(tick_origin.latitude, tick_origin.longitude, rd.runway_heading_calculated - 180 + rangeticks.angle);\n\t\t\tCoordinate tick_left_start, tick_left_end;\n\t\t\ttick_line.Position(dist_cl, tick_left_start.latitude, tick_left_start.longitude);\n\t\t\ttick_line.Position(dist_cl + length, tick_left_end.latitude, tick_left_end.longitude);\n\t\t\tticks.push_back({ tick_left_start, tick_left_end, apt_act, rwy_act });\n\t\t}\n\n\t\tif (rangeticks.direction == Direction::right || rangeticks.direction == Direction::both)\n\t\t{\n\t\t\tauto tick_line = geo.Line(tick_origin.latitude, tick_origin.longitude, rd.runway_heading_calculated - 180 - rangeticks.angle);\n\t\t\tCoordinate tick_right_start, tick_right_end;\n\t\t\ttick_line.Position(dist_cl, tick_right_start.latitude, tick_right_start.longitude);\n\t\t\ttick_line.Position(dist_cl + length, tick_right_end.latitude, tick_right_end.longitude);\n\t\t\tticks.push_back({ tick_right_start, tick_right_end, apt_act, rwy_act });\n\t\t}\n\t}\n}\n\nbool EsCenterLines::GetFixPosition(const std::string &fix, const EuroScopePlugIn::CPosition &threshold, Coordinate &coord)\n{\n\tSelectActiveSectorfile();\n\tfor (auto element = SectorFileElementSelectFirst(EuroScopePlugIn::SECTOR_ELEMENT_FIX); element.IsValid(); element = SectorFileElementSelectNext(element, EuroScopePlugIn::SECTOR_ELEMENT_FIX))\n\t{ \n\tSectorContainer container(this, EuroScopePlugIn::SECTOR_ELEMENT_FIX);\n\t\tif (!strcmp(element.GetName(), fix.c_str()))\n\t\t{\n\t\t\tEuroScopePlugIn::CPosition position;\n\t\t\telement.GetPosition(&position, 0);\n\t\t\tif (position.DistanceTo(threshold) > 30)\n\t\t\t\tcontinue;\n\t\t\tcoord.latitude = position.m_Latitude;\n\t\t\tcoord.longitude = position.m_Longitude;\n\t\t\treturn true;\n\t\t}\n\t}\n\treturn false;\n}\n\nbool EsCenterLines::GetRunwaySettings(const std::string &airport, const std::string &runway, Runway_Settings &rws)\n{\n\tSettings set;\n\tfor (auto apt : set.apts)\n\t{\n\t\tif (airport.starts_with(apt.airport))\n\t\t{\n\t\t\tfor (auto rwy : apt.runways)\n\t\t\t{\n\t\t\t\tif (rwy.runway == runway)\n\t\t\t\t{\n\t\t\t\t\tif (rwy.lines.size() == 0)\n\t\t\t\t\t\trwy.lines = apt.lines;\n\t\t\t\t\tif (rwy.ticks.size() == 0)\n\t\t\t\t\t\trwy.ticks = apt.ticks;\n\t\t\t\t\trws = rwy;\n\t\t\t\t\treturn true;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\treturn false;\n}\n\nbool EsCenterLines::IsAirportActive(const std::string &airport)\n{\n\tSectorContainer container(this, EuroScopePlugIn::SECTOR_ELEMENT_AIRPORT);\n\tfor (auto apt : container)\n\t{\n\t\tstd::string name = apt.GetName();\n\t\tif (apt.IsElementActive(false) && airport.starts_with(name))\n\t\t\treturn true;\n\t}\n\treturn false;\n}\n\ndouble EsCenterLines::NauticalMiles(double nm)\n{\n\treturn nm * GeographicLib::Constants::nauticalmile();\n}\n\nvoid EsCenterLines::ReadRunways()\n{\n\tlines.clear();\n\tticks.clear();\n\tSectorContainer container(this, EuroScopePlugIn::SECTOR_ELEMENT_RUNWAY);\n\tfor (auto runway : container)\n\t{\n\t\tfor (int i = 0; i < 2; ++i)\n\t\t{\n\t\t\tRunway_Definition rwy;\n\t\t\trwy.runway_designator = runway.GetRunwayName(i);\n\t\t\trwy.airport_name = runway.GetAirportName();\n\t\t\trwy.active_arrival = runway.IsElementActive(false, i);\n\t\t\trwy.apt_active_arrival = IsAirportActive(rwy.airport_name);\n\t\t\t\n\t\t\tif (!GetRunwaySettings(rwy.airport_name, rwy.runway_designator, rwy.runway_settings))\n\t\t\t{\n\t\t\t\t\/\/get default\n\t\t\t\tint i = 0;\n\t\t\t}\n\t\t\tCoordinate coord;\n\t\t\tEuroScopePlugIn::CPosition threshold, end;\n\t\t\trunway.GetPosition(&threshold, i);\n\t\t\trunway.GetPosition(&end, i == 1 ? 0 : 1);\n\t\t\trwy.runway_threshold.latitude = threshold.m_Latitude;\n\t\t\trwy.runway_threshold.longitude = threshold.m_Longitude;\n\t\t\trwy.runway_end.latitude = end.m_Latitude;\n\t\t\trwy.runway_end.longitude = end.m_Longitude;\n\t\t\tif (rwy.runway_settings.fix.size() && GetFixPosition(rwy.runway_settings.fix, threshold, coord))\n\t\t\t{\n\t\t\t\tdouble azi1, azi2;\n\t\t\t\tgeo.Inverse(coord.latitude, coord.longitude, rwy.runway_threshold.latitude, rwy.runway_threshold.longitude, azi1, azi2);\n\t\t\t\trwy.runway_heading_calculated = azi2;\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\tdouble azi1, azi2;\n\t\t\t\tgeo.Inverse(rwy.runway_threshold.latitude, rwy.runway_threshold.longitude, rwy.runway_end.latitude, rwy.runway_end.longitude, azi1, azi2);\n\t\t\t\trwy.runway_heading_calculated = azi2;\n\t\t\t}\n\t\t\tCalculateLine(rwy, rwy.apt_active_arrival, rwy.active_arrival);\n\t\t\tCalculateTicks(rwy, rwy.apt_active_arrival, rwy.active_arrival);\n\t\t\tCalculateSpecial(rwy, rwy.apt_active_arrival, rwy.active_arrival);\n\t\t}\n\t}\n}\n<commit_msg>Removed SectorContainer from GetFixPosition<commit_after>#include \"EsCenterLines.h\"\n\nconst char *plugin_name{ \"EsCenterLines\" };\nconst char *plugin_version{ \"1.2\" };\nconst char *plugin_author{ \"Oliver Grtzmann\" };\nconst char *plugin_license{ \"tbd\" };\n\nEsCenterLines::EsCenterLines()\n\t: EuroScopePlugIn::CPlugIn(EuroScopePlugIn::COMPATIBILITY_CODE, plugin_name, plugin_version, plugin_author, plugin_license)\n{\n\tReadRunways();\n\tEuroScopePlugIn::CPlugIn::RegisterDisplayType(\"Center Lines\", false, true, false, false);\n}\n\nEsCenterLines::~EsCenterLines()\n{\n}\n\nEuroScopePlugIn::CRadarScreen *EsCenterLines::OnRadarScreenCreated(const char *sDisplayName, bool NeedRadarContent, bool GeoReferenced, bool CanBeSaved, bool CanBeCreated)\n{\n\tif (GeoReferenced)\n\t{\n\t\tauto cls = new CenterLinesScreen(lines, ticks, screens);\n\t\tscreens.push_back(cls);\n\t\treturn cls;\n\t}\n\treturn nullptr;\n}\n\nvoid EsCenterLines::OnAirportRunwayActivityChanged()\n{\n\tReadRunways();\n\tfor (auto x : screens)\n\t\tx->RefreshMapContent();\n\n}\n\nvoid EsCenterLines::CalculateLine(Runway_Definition &rd, bool apt_act, bool rwy_act)\n{\n\tdouble gl, ll, glll, dist;\n\tauto gd_line = geo.Line(rd.runway_threshold.latitude, rd.runway_threshold.longitude, rd.runway_heading_calculated - 180);\n\tfor (auto centerlines : rd.runway_settings.lines)\n\t{\n\t\tgl = NauticalMiles(centerlines.length_gap);\n\t\tll = NauticalMiles(centerlines.length_line);\n\t\tglll = gl + ll;\n\t\tdist = centerlines.starts_with_line ? 0 : gl;\n\t\tdist += NauticalMiles(centerlines.distance_thr);\n\t\tfor (auto i = 0; i < centerlines.repeats; ++i)\n\t\t{\n\t\t\tdouble lat, lon, lat2, lon2;\n\t\t\tgd_line.Position(dist, lat, lon);\n\t\t\tgd_line.Position(dist + ll, lat2, lon2);\n\t\t\tlines.push_back({ { lat, lon }, { lat2, lon2 }, apt_act, rwy_act });\n\t\t\tdist += glll;\n\t\t}\n\t}\n}\n\nvoid EsCenterLines::CalculateSpecial(Runway_Definition &rd, bool apt_act, bool rwy_act)\n{\n\tif (!rd.runway_settings.special.length)\n\t\treturn;\n\tauto gd_line = geo.Line(rd.runway_threshold.latitude, rd.runway_threshold.longitude, rd.runway_heading_calculated - 180);\n\tauto dist_thr = NauticalMiles(rd.runway_settings.special.distance_thr1);\n\tauto dist_thr2 = NauticalMiles(rd.runway_settings.special.distance_thr2);\n\tauto dist_thr3 = NauticalMiles(rd.runway_settings.special.distance_thr1 + rd.runway_settings.special.length);\n\tCoordinate origin, origin2, origin3, end, end2, end3;\n\tgd_line.Position(dist_thr, origin.latitude, origin.longitude);\n\tgd_line.Position(dist_thr2, origin2.latitude, origin2.longitude);\n\tgd_line.Position(dist_thr3, origin3.latitude, origin3.longitude);\n\tauto line_direction = (rd.runway_settings.special.direction == Direction::left ? rd.runway_heading_calculated - 180 + 90 : rd.runway_heading_calculated - 180 - 90);\n\tauto f_line = geo.Line(origin.latitude, origin.longitude, line_direction);\n\tauto f_line2 = geo.Line(origin2.latitude, origin2.longitude, line_direction);\n\tauto f_line3 = geo.Line(origin3.latitude, origin3.longitude, line_direction);\n\tf_line.Position(NauticalMiles(rd.runway_settings.special.distance_cl), end.latitude, end.longitude);\n\tf_line2.Position(NauticalMiles(rd.runway_settings.special.distance_cl), end2.latitude, end2.longitude);\n\tf_line3.Position(NauticalMiles(rd.runway_settings.special.distance_cl), end3.latitude, end3.longitude);\n\tlines.push_back({ origin, end, apt_act, rwy_act });\n\tlines.push_back({ origin2, end2, apt_act, rwy_act });\n\tlines.push_back({ end, end3, apt_act, rwy_act });\n}\n\nvoid EsCenterLines::CalculateTicks(Runway_Definition &rd, bool apt_act, bool rwy_act)\n{\n\tdouble dist_thr, dist_cl, length;\n\tauto gd_line = geo.Line(rd.runway_threshold.latitude, rd.runway_threshold.longitude, rd.runway_heading_calculated - 180);\n\tfor (auto rangeticks : rd.runway_settings.ticks)\n\t{\n\t\tdist_thr = NauticalMiles(rangeticks.distance_thr);\n\t\tdist_cl = NauticalMiles(rangeticks.distance_cl);\n\t\tlength = NauticalMiles(rangeticks.length);\n\t\tCoordinate tick_origin;\n\t\tgd_line.Position(dist_thr, tick_origin.latitude, tick_origin.longitude);\n\n\t\tif (rangeticks.direction == Direction::left || rangeticks.direction == Direction::both)\n\t\t{\n\t\t\tauto tick_line = geo.Line(tick_origin.latitude, tick_origin.longitude, rd.runway_heading_calculated - 180 + rangeticks.angle);\n\t\t\tCoordinate tick_left_start, tick_left_end;\n\t\t\ttick_line.Position(dist_cl, tick_left_start.latitude, tick_left_start.longitude);\n\t\t\ttick_line.Position(dist_cl + length, tick_left_end.latitude, tick_left_end.longitude);\n\t\t\tticks.push_back({ tick_left_start, tick_left_end, apt_act, rwy_act });\n\t\t}\n\n\t\tif (rangeticks.direction == Direction::right || rangeticks.direction == Direction::both)\n\t\t{\n\t\t\tauto tick_line = geo.Line(tick_origin.latitude, tick_origin.longitude, rd.runway_heading_calculated - 180 - rangeticks.angle);\n\t\t\tCoordinate tick_right_start, tick_right_end;\n\t\t\ttick_line.Position(dist_cl, tick_right_start.latitude, tick_right_start.longitude);\n\t\t\ttick_line.Position(dist_cl + length, tick_right_end.latitude, tick_right_end.longitude);\n\t\t\tticks.push_back({ tick_right_start, tick_right_end, apt_act, rwy_act });\n\t\t}\n\t}\n}\n\nbool EsCenterLines::GetFixPosition(const std::string &fix, const EuroScopePlugIn::CPosition &threshold, Coordinate &coord)\n{\n\tSelectActiveSectorfile();\n\tfor (auto element = SectorFileElementSelectFirst(EuroScopePlugIn::SECTOR_ELEMENT_FIX); element.IsValid(); element = SectorFileElementSelectNext(element, EuroScopePlugIn::SECTOR_ELEMENT_FIX))\n\t{ \n\t\tif (!strcmp(element.GetName(), fix.c_str()))\n\t\t{\n\t\t\tEuroScopePlugIn::CPosition position;\n\t\t\telement.GetPosition(&position, 0);\n\t\t\tif (position.DistanceTo(threshold) > 30)\n\t\t\t\tcontinue;\n\t\t\tcoord.latitude = position.m_Latitude;\n\t\t\tcoord.longitude = position.m_Longitude;\n\t\t\treturn true;\n\t\t}\n\t}\n\treturn false;\n}\n\nbool EsCenterLines::GetRunwaySettings(const std::string &airport, const std::string &runway, Runway_Settings &rws)\n{\n\tSettings set;\n\tfor (auto apt : set.apts)\n\t{\n\t\tif (airport.starts_with(apt.airport))\n\t\t{\n\t\t\tfor (auto rwy : apt.runways)\n\t\t\t{\n\t\t\t\tif (rwy.runway == runway)\n\t\t\t\t{\n\t\t\t\t\tif (rwy.lines.size() == 0)\n\t\t\t\t\t\trwy.lines = apt.lines;\n\t\t\t\t\tif (rwy.ticks.size() == 0)\n\t\t\t\t\t\trwy.ticks = apt.ticks;\n\t\t\t\t\trws = rwy;\n\t\t\t\t\treturn true;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\treturn false;\n}\n\nbool EsCenterLines::IsAirportActive(const std::string &airport)\n{\n\tSectorContainer container(this, EuroScopePlugIn::SECTOR_ELEMENT_AIRPORT);\n\tfor (auto apt : container)\n\t{\n\t\tstd::string name = apt.GetName();\n\t\tif (apt.IsElementActive(false) && airport.starts_with(name))\n\t\t\treturn true;\n\t}\n\treturn false;\n}\n\ndouble EsCenterLines::NauticalMiles(double nm)\n{\n\treturn nm * GeographicLib::Constants::nauticalmile();\n}\n\nvoid EsCenterLines::ReadRunways()\n{\n\tlines.clear();\n\tticks.clear();\n\tSectorContainer container(this, EuroScopePlugIn::SECTOR_ELEMENT_RUNWAY);\n\tfor (auto runway : container)\n\t{\n\t\tfor (int i = 0; i < 2; ++i)\n\t\t{\n\t\t\tRunway_Definition rwy;\n\t\t\trwy.runway_designator = runway.GetRunwayName(i);\n\t\t\trwy.airport_name = runway.GetAirportName();\n\t\t\trwy.active_arrival = runway.IsElementActive(false, i);\n\t\t\trwy.apt_active_arrival = IsAirportActive(rwy.airport_name);\n\t\t\t\n\t\t\tif (!GetRunwaySettings(rwy.airport_name, rwy.runway_designator, rwy.runway_settings))\n\t\t\t{\n\t\t\t\t\/\/get default\n\t\t\t\tint i = 0;\n\t\t\t}\n\t\t\tCoordinate coord;\n\t\t\tEuroScopePlugIn::CPosition threshold, end;\n\t\t\trunway.GetPosition(&threshold, i);\n\t\t\trunway.GetPosition(&end, i == 1 ? 0 : 1);\n\t\t\trwy.runway_threshold.latitude = threshold.m_Latitude;\n\t\t\trwy.runway_threshold.longitude = threshold.m_Longitude;\n\t\t\trwy.runway_end.latitude = end.m_Latitude;\n\t\t\trwy.runway_end.longitude = end.m_Longitude;\n\t\t\tif (rwy.runway_settings.fix.size() && GetFixPosition(rwy.runway_settings.fix, threshold, coord))\n\t\t\t{\n\t\t\t\tdouble azi1, azi2;\n\t\t\t\tgeo.Inverse(coord.latitude, coord.longitude, rwy.runway_threshold.latitude, rwy.runway_threshold.longitude, azi1, azi2);\n\t\t\t\trwy.runway_heading_calculated = azi2;\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\tdouble azi1, azi2;\n\t\t\t\tgeo.Inverse(rwy.runway_threshold.latitude, rwy.runway_threshold.longitude, rwy.runway_end.latitude, rwy.runway_end.longitude, azi1, azi2);\n\t\t\t\trwy.runway_heading_calculated = azi2;\n\t\t\t}\n\t\t\tCalculateLine(rwy, rwy.apt_active_arrival, rwy.active_arrival);\n\t\t\tCalculateTicks(rwy, rwy.apt_active_arrival, rwy.active_arrival);\n\t\t\tCalculateSpecial(rwy, rwy.apt_active_arrival, rwy.active_arrival);\n\t\t}\n\t}\n}\n<|endoftext|>"} {"text":"<commit_before>\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ This file is part of Grappa, a system for scaling irregular\n\/\/ applications on commodity clusters. \n\n\/\/ Copyright (C) 2010-2014 University of Washington and Battelle\n\/\/ Memorial Institute. University of Washington authorizes use of this\n\/\/ Grappa software.\n\n\/\/ Grappa is free software: you can redistribute it and\/or modify it\n\/\/ under the terms of the Affero General Public License as published\n\/\/ by Affero, Inc., either version 1 of the License, or (at your\n\/\/ option) any later version.\n\n\/\/ Grappa 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\/\/ Affero General Public License for more details.\n\n\/\/ You should have received a copy of the Affero General Public\n\/\/ License along with this program. If not, you may obtain one from\n\/\/ http:\/\/www.affero.org\/oagpl.html.\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\/ This mini-app demonstrates a breadth-first-search of the built-in \n\/\/\/ graph data structure. This implement's Graph500's BFS benchmark:\n\/\/\/ - Uses the Graph500 Specification Kronecker graph generator with\n\/\/\/ numVertices = 2^scale (--scale specified on command-line)\n\/\/\/ - Uses the builtin hybrid compressed-sparse-row graph format\n\/\/\/ - Computes the 'parent' tree given a root, and does this a number \n\/\/\/ of times (specified by --nbfs).\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n#include \"common.hpp\"\n\nDEFINE_bool( metrics, false, \"Dump metrics\");\n\nDEFINE_int32(scale, 10, \"Log2 number of vertices.\");\nDEFINE_int32(edgefactor, 16, \"Average number of edges per vertex.\");\nDEFINE_int32(nbfs, 1, \"Number of BFS traversals to do.\");\n\nGRAPPA_DEFINE_METRIC(SummarizingMetric<double>, bfs_mteps, 0);\nGRAPPA_DEFINE_METRIC(SummarizingMetric<double>, bfs_time, 0);\nGRAPPA_DEFINE_METRIC(SimpleMetric<int64_t>, bfs_nedge, 0);\nGRAPPA_DEFINE_METRIC(SimpleMetric<double>, graph_create_time, 0);\nGRAPPA_DEFINE_METRIC(SimpleMetric<double>, verify_time, 0);\n\nint64_t nedge_traversed;\n\nint main(int argc, char* argv[]) {\n init(&argc, &argv);\n run([]{\n int64_t NE = (1L << FLAGS_scale) * FLAGS_edgefactor;\n bool verified = false;\n double t;\n \n t = walltime();\n \n \/\/ generate \"NE\" edge tuples, sampling vertices using the\n \/\/ Graph500 Kronecker generator to get a power-law graph\n auto tg = TupleGraph::Kronecker(FLAGS_scale, NE, 111, 222);\n \n \/\/ construct the compact graph representation (roughly CSR)\n auto g = Graph<BFSVertex>::create( tg );\n \n graph_create_time = (walltime()-t);\n LOG(INFO) << graph_create_time;\n \n auto frontier = GlobalVector<int64_t>::create(g->nv);\n auto next = GlobalVector<int64_t>::create(g->nv);\n \n \/\/ do BFS from multiple different roots and average their times\n for (int root_idx = 0; root_idx < FLAGS_nbfs; root_idx++) {\n \n \/\/ intialize parent to -1\n forall(g, [](BFSVertex& v){ v->init(); });\n \n int64_t root = choose_root(g);\n VLOG(1) << \"root => \" << root;\n \n \/\/ setup 'root' as the parent of itself\n delegate::call(g->vs+root, [=](BFSVertex& v){ v->parent = root; });\n \n \/\/ reset frontier queues\n next->clear();\n frontier->clear();\n \n \/\/ start with root as only thing in frontier\n frontier->push(root);\n \n t = walltime();\n \n while (!frontier->empty()) {\n \/\/ iterate over vertices in this level of the frontier\n forall(frontier, [g,next](int64_t& i){\n \/\/ visit all the adjacencies of the vertex\n \/\/ note: this has to be 'async' to prevent deadlock from\n \/\/ running out of available workers\n forall<async>(adj(g,g->vs+i),\n [i,next](int64_t j, GlobalAddress<BFSVertex> vj)\n {\n \/\/ at the core where the vertex is...\n bool claimed = delegate::call(vj, [i](BFSVertex& v){\n \/\/ note: no synchronization needed because 'call' is \n \/\/ guaranteed to be executed atomically because it \n \/\/ does no blocking operations\n if (v->parent == -1) {\n \/\/ claim parenthood\n v->parent = i;\n return true;\n }\n return false;\n });\n if (claimed) {\n \/\/ add this vertex to the frontier for the next level\n \/\/ note: we (currently) can't do this 'push' inside the delegate because it may block\n next->push(j);\n }\n });\n });\n \/\/ switch to next frontier level\n std::swap(frontier, next);\n next->clear();\n }\n \n double this_bfs_time = walltime() - t;\n LOG(INFO) << \"(root=\" << root << \", time=\" << this_bfs_time << \")\";\n bfs_time += this_bfs_time;\n \n if (!verified) {\n \/\/ only verify the first one to save time\n t = walltime();\n bfs_nedge = verify(tg, g, root);\n verify_time = (walltime()-t);\n LOG(INFO) << verify_time;\n verified = true;\n }\n \n bfs_mteps += bfs_nedge \/ this_bfs_time \/ 1.0e6;\n }\n \n LOG(INFO) << \"\\n\" << bfs_nedge << \"\\n\" << bfs_time << \"\\n\" << bfs_mteps;\n \n if (FLAGS_metrics) Metrics::merge_and_print();\n Metrics::merge_and_dump_to_file();\n \n tg.destroy();\n g->destroy();\n frontier->destroy();\n next->destroy();\n });\n finalize();\n}\n<commit_msg>modify bfs example to support file input<commit_after>\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ This file is part of Grappa, a system for scaling irregular\n\/\/ applications on commodity clusters. \n\n\/\/ Copyright (C) 2010-2014 University of Washington and Battelle\n\/\/ Memorial Institute. University of Washington authorizes use of this\n\/\/ Grappa software.\n\n\/\/ Grappa is free software: you can redistribute it and\/or modify it\n\/\/ under the terms of the Affero General Public License as published\n\/\/ by Affero, Inc., either version 1 of the License, or (at your\n\/\/ option) any later version.\n\n\/\/ Grappa 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\/\/ Affero General Public License for more details.\n\n\/\/ You should have received a copy of the Affero General Public\n\/\/ License along with this program. If not, you may obtain one from\n\/\/ http:\/\/www.affero.org\/oagpl.html.\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\/ This mini-app demonstrates a breadth-first-search of the built-in \n\/\/\/ graph data structure. This implement's Graph500's BFS benchmark:\n\/\/\/ - Uses the Graph500 Specification Kronecker graph generator with\n\/\/\/ numVertices = 2^scale (--scale specified on command-line)\n\/\/\/ - Uses the builtin hybrid compressed-sparse-row graph format\n\/\/\/ - Computes the 'parent' tree given a root, and does this a number \n\/\/\/ of times (specified by --nbfs).\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n#include \"common.hpp\"\n\nDEFINE_bool( metrics, false, \"Dump metrics\");\n\nDEFINE_int32(scale, 10, \"Log2 number of vertices.\");\nDEFINE_int32(edgefactor, 16, \"Average number of edges per vertex.\");\nDEFINE_int32(nbfs, 1, \"Number of BFS traversals to do.\");\n\nGRAPPA_DEFINE_METRIC(SummarizingMetric<double>, bfs_mteps, 0);\nGRAPPA_DEFINE_METRIC(SummarizingMetric<double>, bfs_time, 0);\nGRAPPA_DEFINE_METRIC(SimpleMetric<int64_t>, bfs_nedge, 0);\nGRAPPA_DEFINE_METRIC(SimpleMetric<double>, graph_create_time, 0);\nGRAPPA_DEFINE_METRIC(SimpleMetric<double>, verify_time, 0);\n\nint64_t nedge_traversed;\n\nint main(int argc, char* argv[]) {\n init(&argc, &argv);\n run([]{\n int64_t NE = (1L << FLAGS_scale) * FLAGS_edgefactor;\n bool verified = false;\n double t;\n \n t = walltime();\n \n TupleGraph tg;\n\n \/\/ generate \"NE\" edge tuples, sampling vertices using the\n \/\/ Graph500 Kronecker generator to get a power-law graph\n tg = TupleGraph::Kronecker(FLAGS_scale, NE, 111, 222);\n\n \/\/ construct the compact graph representation (roughly CSR)\n auto g = Graph<BFSVertex>::create( tg );\n \n graph_create_time = (walltime()-t);\n LOG(INFO) << graph_create_time;\n \n auto frontier = GlobalVector<int64_t>::create(g->nv);\n auto next = GlobalVector<int64_t>::create(g->nv);\n \n \/\/ do BFS from multiple different roots and average their times\n for (int root_idx = 0; root_idx < FLAGS_nbfs; root_idx++) {\n \n \/\/ intialize parent to -1\n forall(g, [](BFSVertex& v){ v->init(); });\n \n int64_t root = choose_root(g);\n VLOG(1) << \"root => \" << root;\n \n \/\/ setup 'root' as the parent of itself\n delegate::call(g->vs+root, [=](BFSVertex& v){ v->parent = root; });\n \n \/\/ reset frontier queues\n next->clear();\n frontier->clear();\n \n \/\/ start with root as only thing in frontier\n frontier->push(root);\n \n t = walltime();\n \n while (!frontier->empty()) {\n \/\/ iterate over vertices in this level of the frontier\n forall(frontier, [g,next](int64_t& i){\n \/\/ visit all the adjacencies of the vertex\n \/\/ note: this has to be 'async' to prevent deadlock from\n \/\/ running out of available workers\n forall<async>(adj(g,g->vs+i),\n [i,next](int64_t j, GlobalAddress<BFSVertex> vj)\n {\n \/\/ at the core where the vertex is...\n bool claimed = delegate::call(vj, [i](BFSVertex& v){\n \/\/ note: no synchronization needed because 'call' is \n \/\/ guaranteed to be executed atomically because it \n \/\/ does no blocking operations\n if (v->parent == -1) {\n \/\/ claim parenthood\n v->parent = i;\n return true;\n }\n return false;\n });\n if (claimed) {\n \/\/ add this vertex to the frontier for the next level\n \/\/ note: we (currently) can't do this 'push' inside the delegate because it may block\n next->push(j);\n }\n });\n });\n \/\/ switch to next frontier level\n std::swap(frontier, next);\n next->clear();\n }\n \n double this_bfs_time = walltime() - t;\n LOG(INFO) << \"(root=\" << root << \", time=\" << this_bfs_time << \")\";\n bfs_time += this_bfs_time;\n \n if (!verified) {\n \/\/ only verify the first one to save time\n t = walltime();\n bfs_nedge = verify(tg, g, root);\n verify_time = (walltime()-t);\n LOG(INFO) << verify_time;\n verified = true;\n }\n \n bfs_mteps += bfs_nedge \/ this_bfs_time \/ 1.0e6;\n }\n \n LOG(INFO) << \"\\n\" << bfs_nedge << \"\\n\" << bfs_time << \"\\n\" << bfs_mteps;\n \n if (FLAGS_metrics) Metrics::merge_and_print();\n Metrics::merge_and_dump_to_file();\n \n tg.destroy();\n g->destroy();\n frontier->destroy();\n next->destroy();\n });\n finalize();\n}\n<|endoftext|>"} {"text":"<commit_before>\/*=========================================================================\n\n Program: Visualization Toolkit\n Module: vtkImageAlgorithm.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 \"vtkImageAlgorithm.h\"\n\n#include \"vtkCellData.h\"\n#include \"vtkCommand.h\"\n#include \"vtkDataArray.h\"\n#include \"vtkImageData.h\"\n#include \"vtkInformation.h\"\n#include \"vtkInformationVector.h\"\n#include \"vtkObjectFactory.h\"\n#include \"vtkPointData.h\"\n#include \"vtkStreamingDemandDrivenPipeline.h\"\n\nvtkCxxRevisionMacro(vtkImageAlgorithm, \"1.19\");\n\n\/\/----------------------------------------------------------------------------\nvtkImageAlgorithm::vtkImageAlgorithm()\n{\n this->SetNumberOfInputPorts(1);\n this->SetNumberOfOutputPorts(1);\n this->InputScalarsSelection = NULL;\n}\n\n\/\/----------------------------------------------------------------------------\nvtkImageAlgorithm::~vtkImageAlgorithm()\n{\n this->SetInputScalarsSelection(NULL);\n}\n\n\/\/----------------------------------------------------------------------------\nvoid vtkImageAlgorithm::PrintSelf(ostream& os, vtkIndent indent)\n{ \n this->Superclass::PrintSelf(os,indent);\n}\n\n\/\/----------------------------------------------------------------------------\n\/\/ This is the superclasses style of Execute method. Convert it into\n\/\/ an imaging style Execute method.\nint vtkImageAlgorithm::RequestData(\n vtkInformation* request,\n vtkInformationVector** vtkNotUsed( inputVector ),\n vtkInformationVector* outputVector)\n{\n \/\/ the default implimentation is to do what the old pipeline did find what\n \/\/ output is requesting the data, and pass that into ExecuteData\n\n \/\/ which output port did the request come from\n int outputPort = \n request->Get(vtkDemandDrivenPipeline::FROM_OUTPUT_PORT());\n\n \/\/ if output port is negative then that means this filter is calling the\n \/\/ update directly, in that case just assume port 0\n if (outputPort == -1)\n {\n outputPort = 0;\n }\n \n \/\/ get the data object\n vtkInformation *outInfo = \n outputVector->GetInformationObject(outputPort);\n \/\/ call ExecuteData\n if (outInfo)\n {\n this->ExecuteData( outInfo->Get(vtkDataObject::DATA_OBJECT()) );\n }\n else\n {\n this->ExecuteData(NULL);\n }\n return 1;\n}\n\n\/\/----------------------------------------------------------------------------\nint vtkImageAlgorithm::ProcessRequest(vtkInformation* request,\n vtkInformationVector** inputVector,\n vtkInformationVector* outputVector)\n{\n \/\/ generate the data\n if(request->Has(vtkDemandDrivenPipeline::REQUEST_DATA()))\n {\n this->RequestData(request, inputVector, outputVector);\n return 1;\n }\n\n \/\/ execute information\n if(request->Has(vtkDemandDrivenPipeline::REQUEST_INFORMATION()))\n {\n this->RequestInformation(request, inputVector, outputVector);\n return 1;\n }\n\n \/\/ propagate update extent\n if(request->Has(vtkStreamingDemandDrivenPipeline::REQUEST_UPDATE_EXTENT()))\n {\n this->RequestUpdateExtent(request, inputVector, outputVector);\n return 1;\n }\n\n return this->Superclass::ProcessRequest(request, inputVector, outputVector);\n}\n\n\/\/----------------------------------------------------------------------------\n\/\/ Assume that any source that implements ExecuteData \n\/\/ can handle an empty extent.\nvoid vtkImageAlgorithm::ExecuteData(vtkDataObject *)\n{\n this->Execute();\n}\n\n\/\/----------------------------------------------------------------------------\nvoid vtkImageAlgorithm::Execute()\n{\n vtkErrorMacro(<< \"Definition of Execute() method should be in subclass and you should really use the ExecuteData(vtkInformation *request,...) signature instead\");\n}\n\nint vtkImageAlgorithm::RequestInformation(\n vtkInformation* vtkNotUsed(request),\n vtkInformationVector** vtkNotUsed(inputVector),\n vtkInformationVector* vtkNotUsed(outputVector))\n{\n \/\/ do nothing let subclasses handle it\n return 1;\n}\n\nint vtkImageAlgorithm::RequestUpdateExtent(\n vtkInformation* vtkNotUsed(request),\n vtkInformationVector** vtkNotUsed(inputVector),\n vtkInformationVector* vtkNotUsed(outputVector))\n{\n \/\/ do nothing let subclasses handle it\n return 1;\n}\n\n\/\/----------------------------------------------------------------------------\nvoid vtkImageAlgorithm::AllocateOutputData(vtkImageData *output, \n int *uExtent)\n{ \n \/\/ set the extent to be the update extent\n output->SetExtent(uExtent);\n output->AllocateScalars();\n}\n\n\/\/----------------------------------------------------------------------------\nvtkImageData *vtkImageAlgorithm::AllocateOutputData(vtkDataObject *output)\n{ \n \/\/ set the extent to be the update extent\n vtkImageData *out = vtkImageData::SafeDownCast(output);\n if (out)\n {\n \/\/ this needs to be fixed -Ken\n vtkStreamingDemandDrivenPipeline *sddp = \n vtkStreamingDemandDrivenPipeline::SafeDownCast(this->GetExecutive());\n if (sddp)\n {\n int extent[6];\n sddp->GetOutputInformation(0)->Get(vtkStreamingDemandDrivenPipeline::UPDATE_EXTENT(),extent);\n out->SetExtent(extent);\n }\n out->AllocateScalars();\n }\n return out;\n}\n\n\/\/ by default copy the attr from the first input to the first output\nvoid vtkImageAlgorithm::CopyAttributeData(vtkImageData *input,\n vtkImageData *output)\n{\n if (!input || !output)\n {\n return;\n }\n \n int inExt[6];\n int outExt[6];\n vtkDataArray *inArray;\n vtkDataArray *outArray;\n\n input->GetExtent(inExt);\n output->GetExtent(outExt);\n\n \/\/ Do not copy the array we will be generating.\n inArray = input->GetPointData()->GetScalars(this->InputScalarsSelection);\n\n \/\/ Conditionally copy point and cell data. Only copy if corresponding\n \/\/ indexes refer to identical points.\n double *oIn = input->GetOrigin();\n double *sIn = input->GetSpacing();\n double *oOut = output->GetOrigin();\n double *sOut = output->GetSpacing();\n if (oIn[0] == oOut[0] && oIn[1] == oOut[1] && oIn[2] == oOut[2] &&\n sIn[0] == sOut[0] && sIn[1] == sOut[1] && sIn[2] == sOut[2]) \n {\n output->GetPointData()->CopyAllOn();\n output->GetCellData()->CopyAllOn();\n \/\/ Scalar copy flag trumps the array copy flag.\n if (inArray == input->GetPointData()->GetScalars())\n {\n output->GetPointData()->CopyScalarsOff();\n }\n else\n {\n output->GetPointData()->CopyFieldOff(this->InputScalarsSelection);\n }\n\n \/\/ If the extents are the same, then pass the attribute data for\n \/\/ efficiency.\n if (inExt[0] == outExt[0] && inExt[1] == outExt[1] &&\n inExt[2] == outExt[2] && inExt[3] == outExt[3] &&\n inExt[4] == outExt[4] && inExt[5] == outExt[5])\n {\/\/ Pass\n output->GetPointData()->PassData(input->GetPointData());\n output->GetCellData()->PassData(input->GetCellData());\n }\n else\n {\/\/ Copy\n \/\/ Since this can be expensive to copy all of these values,\n \/\/ lets make sure there are arrays to copy (other than the scalars)\n if (input->GetPointData()->GetNumberOfArrays() > 1)\n {\n \/\/ Copy the point data.\n \/\/ CopyAllocate frees all arrays.\n \/\/ Keep the old scalar array (not being copied).\n \/\/ This is a hack, but avoids reallocation ...\n vtkDataArray *tmp = NULL;\n if ( ! output->GetPointData()->GetCopyScalars() )\n {\n tmp = output->GetPointData()->GetScalars();\n }\n output->GetPointData()->CopyAllocate(input->GetPointData(), \n output->GetNumberOfPoints());\n if (tmp)\n { \/\/ Restore the array.\n output->GetPointData()->SetScalars(tmp);\n }\n \/\/ Now Copy The point data, but only if output is a subextent of the\n \/\/ input.\n if (outExt[0] >= inExt[0] && outExt[1] <= inExt[1] &&\n outExt[2] >= inExt[2] && outExt[3] <= inExt[3] &&\n outExt[4] >= inExt[4] && outExt[5] <= inExt[5])\n {\n output->GetPointData()->CopyStructuredData(input->GetPointData(),\n inExt, outExt);\n }\n }\n\n if (input->GetCellData()->GetNumberOfArrays() > 0)\n {\n output->GetCellData()->CopyAllocate(input->GetCellData(), \n output->GetNumberOfCells()); \n \/\/ Cell extent is one less than point extent.\n \/\/ Conditional to handle a colapsed axis (lower dimensional cells).\n if (inExt[0] < inExt[1]) {--inExt[1];}\n if (inExt[2] < inExt[3]) {--inExt[3];}\n if (inExt[4] < inExt[5]) {--inExt[5];}\n \/\/ Cell extent is one less than point extent.\n if (outExt[0] < outExt[1]) {--outExt[1];}\n if (outExt[2] < outExt[3]) {--outExt[3];}\n if (outExt[4] < outExt[5]) {--outExt[5];}\n \/\/ Now Copy The cell data, but only if output is a subextent of the input. \n if (outExt[0] >= inExt[0] && outExt[1] <= inExt[1] &&\n outExt[2] >= inExt[2] && outExt[3] <= inExt[3] &&\n outExt[4] >= inExt[4] && outExt[5] <= inExt[5])\n {\n output->GetCellData()->CopyStructuredData(input->GetCellData(),\n inExt, outExt);\n }\n }\n }\n }\n\n \/\/ set the name of the output to match the input name\n outArray = output->GetPointData()->GetScalars();\n if (inArray)\n {\n outArray->SetName(inArray->GetName());\n }\n}\n\n\n\/\/----------------------------------------------------------------------------\nvtkImageData* vtkImageAlgorithm::GetOutput()\n{\n return this->GetOutput(0);\n}\n\n\/\/----------------------------------------------------------------------------\nvtkImageData* vtkImageAlgorithm::GetOutput(int port)\n{\n return vtkImageData::SafeDownCast(this->GetOutputDataObject(port));\n}\n\n\/\/----------------------------------------------------------------------------\nvoid vtkImageAlgorithm::SetOutput(vtkDataObject* d)\n{\n this->GetExecutive()->SetOutputData(0, d);\n}\n\n\/\/----------------------------------------------------------------------------\nint vtkImageAlgorithm::FillOutputPortInformation(\n int vtkNotUsed(port), vtkInformation* info)\n{\n \/\/ now add our info\n info->Set(vtkDataObject::DATA_TYPE_NAME(), \"vtkImageData\");\n \n return 1;\n}\n\nint vtkImageAlgorithm::FillInputPortInformation(\n int vtkNotUsed(port), vtkInformation* info)\n{\n info->Set(vtkAlgorithm::INPUT_REQUIRED_DATA_TYPE(), \"vtkImageData\");\n return 1;\n}\n\n\/\/----------------------------------------------------------------------------\nvoid vtkImageAlgorithm::SetInput(vtkDataObject* input)\n{\n this->SetInput(0, input);\n}\n\n\/\/----------------------------------------------------------------------------\nvoid vtkImageAlgorithm::SetInput(int index, vtkDataObject* input)\n{\n if(input)\n {\n this->SetInputConnection(index, input->GetProducerPort());\n }\n else\n {\n \/\/ Setting a NULL input removes the connection.\n this->SetInputConnection(index, 0);\n }\n}\n\n\/\/----------------------------------------------------------------------------\nvtkDataObject* vtkImageAlgorithm::GetInput(int port)\n{\n if (this->GetNumberOfInputConnections(port) < 1)\n {\n return 0;\n }\n return this->GetExecutive()->GetInputData(port, 0);\n}\n\n\/\/----------------------------------------------------------------------------\nvoid vtkImageAlgorithm::AddInput(vtkDataObject* input)\n{\n this->AddInput(0, input);\n}\n\n\/\/----------------------------------------------------------------------------\nvoid vtkImageAlgorithm::AddInput(int index, vtkDataObject* input)\n{\n if(input)\n {\n this->AddInputConnection(index, input->GetProducerPort());\n }\n}\n<commit_msg>BUG: Changing the usage of PointData or CellData (such as changing which array is the Scalar field with vtkAssignAttributes) could cause the output scalar array to be overwritten by an input array.<commit_after>\/*=========================================================================\n\n Program: Visualization Toolkit\n Module: vtkImageAlgorithm.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 \"vtkImageAlgorithm.h\"\n\n#include \"vtkCellData.h\"\n#include \"vtkCommand.h\"\n#include \"vtkDataArray.h\"\n#include \"vtkImageData.h\"\n#include \"vtkInformation.h\"\n#include \"vtkInformationVector.h\"\n#include \"vtkObjectFactory.h\"\n#include \"vtkPointData.h\"\n#include \"vtkStreamingDemandDrivenPipeline.h\"\n\nvtkCxxRevisionMacro(vtkImageAlgorithm, \"1.20\");\n\n\/\/----------------------------------------------------------------------------\nvtkImageAlgorithm::vtkImageAlgorithm()\n{\n this->SetNumberOfInputPorts(1);\n this->SetNumberOfOutputPorts(1);\n this->InputScalarsSelection = NULL;\n}\n\n\/\/----------------------------------------------------------------------------\nvtkImageAlgorithm::~vtkImageAlgorithm()\n{\n this->SetInputScalarsSelection(NULL);\n}\n\n\/\/----------------------------------------------------------------------------\nvoid vtkImageAlgorithm::PrintSelf(ostream& os, vtkIndent indent)\n{ \n this->Superclass::PrintSelf(os,indent);\n}\n\n\/\/----------------------------------------------------------------------------\n\/\/ This is the superclasses style of Execute method. Convert it into\n\/\/ an imaging style Execute method.\nint vtkImageAlgorithm::RequestData(\n vtkInformation* request,\n vtkInformationVector** vtkNotUsed( inputVector ),\n vtkInformationVector* outputVector)\n{\n \/\/ the default implimentation is to do what the old pipeline did find what\n \/\/ output is requesting the data, and pass that into ExecuteData\n\n \/\/ which output port did the request come from\n int outputPort = \n request->Get(vtkDemandDrivenPipeline::FROM_OUTPUT_PORT());\n\n \/\/ if output port is negative then that means this filter is calling the\n \/\/ update directly, in that case just assume port 0\n if (outputPort == -1)\n {\n outputPort = 0;\n }\n \n \/\/ get the data object\n vtkInformation *outInfo = \n outputVector->GetInformationObject(outputPort);\n \/\/ call ExecuteData\n if (outInfo)\n {\n this->ExecuteData( outInfo->Get(vtkDataObject::DATA_OBJECT()) );\n }\n else\n {\n this->ExecuteData(NULL);\n }\n return 1;\n}\n\n\/\/----------------------------------------------------------------------------\nint vtkImageAlgorithm::ProcessRequest(vtkInformation* request,\n vtkInformationVector** inputVector,\n vtkInformationVector* outputVector)\n{\n \/\/ generate the data\n if(request->Has(vtkDemandDrivenPipeline::REQUEST_DATA()))\n {\n this->RequestData(request, inputVector, outputVector);\n return 1;\n }\n\n \/\/ execute information\n if(request->Has(vtkDemandDrivenPipeline::REQUEST_INFORMATION()))\n {\n this->RequestInformation(request, inputVector, outputVector);\n return 1;\n }\n\n \/\/ propagate update extent\n if(request->Has(vtkStreamingDemandDrivenPipeline::REQUEST_UPDATE_EXTENT()))\n {\n this->RequestUpdateExtent(request, inputVector, outputVector);\n return 1;\n }\n\n return this->Superclass::ProcessRequest(request, inputVector, outputVector);\n}\n\n\/\/----------------------------------------------------------------------------\n\/\/ Assume that any source that implements ExecuteData \n\/\/ can handle an empty extent.\nvoid vtkImageAlgorithm::ExecuteData(vtkDataObject *)\n{\n this->Execute();\n}\n\n\/\/----------------------------------------------------------------------------\nvoid vtkImageAlgorithm::Execute()\n{\n vtkErrorMacro(<< \"Definition of Execute() method should be in subclass and you should really use the ExecuteData(vtkInformation *request,...) signature instead\");\n}\n\nint vtkImageAlgorithm::RequestInformation(\n vtkInformation* vtkNotUsed(request),\n vtkInformationVector** vtkNotUsed(inputVector),\n vtkInformationVector* vtkNotUsed(outputVector))\n{\n \/\/ do nothing let subclasses handle it\n return 1;\n}\n\nint vtkImageAlgorithm::RequestUpdateExtent(\n vtkInformation* vtkNotUsed(request),\n vtkInformationVector** vtkNotUsed(inputVector),\n vtkInformationVector* vtkNotUsed(outputVector))\n{\n \/\/ do nothing let subclasses handle it\n return 1;\n}\n\n\/\/----------------------------------------------------------------------------\nvoid vtkImageAlgorithm::AllocateOutputData(vtkImageData *output, \n int *uExtent)\n{ \n \/\/ set the extent to be the update extent\n output->SetExtent(uExtent);\n output->AllocateScalars();\n}\n\n\/\/----------------------------------------------------------------------------\nvtkImageData *vtkImageAlgorithm::AllocateOutputData(vtkDataObject *output)\n{ \n \/\/ set the extent to be the update extent\n vtkImageData *out = vtkImageData::SafeDownCast(output);\n if (out)\n {\n \/\/ this needs to be fixed -Ken\n vtkStreamingDemandDrivenPipeline *sddp = \n vtkStreamingDemandDrivenPipeline::SafeDownCast(this->GetExecutive());\n if (sddp)\n {\n int extent[6];\n sddp->GetOutputInformation(0)->Get(vtkStreamingDemandDrivenPipeline::UPDATE_EXTENT(),extent);\n out->SetExtent(extent);\n }\n out->AllocateScalars();\n }\n return out;\n}\n\n\/\/ by default copy the attr from the first input to the first output\nvoid vtkImageAlgorithm::CopyAttributeData(vtkImageData *input,\n vtkImageData *output)\n{\n if (!input || !output)\n {\n return;\n }\n \n int inExt[6];\n int outExt[6];\n vtkDataArray *inArray;\n vtkDataArray *outArray;\n\n input->GetExtent(inExt);\n output->GetExtent(outExt);\n\n \/\/ Do not copy the array we will be generating.\n inArray = input->GetPointData()->GetScalars();\n\n \/\/ Conditionally copy point and cell data. Only copy if corresponding\n \/\/ indexes refer to identical points.\n double *oIn = input->GetOrigin();\n double *sIn = input->GetSpacing();\n double *oOut = output->GetOrigin();\n double *sOut = output->GetSpacing();\n if (oIn[0] == oOut[0] && oIn[1] == oOut[1] && oIn[2] == oOut[2] &&\n sIn[0] == sOut[0] && sIn[1] == sOut[1] && sIn[2] == sOut[2]) \n {\n output->GetPointData()->CopyAllOn();\n output->GetCellData()->CopyAllOn();\n output->GetPointData()->CopyScalarsOff();\n\n \/\/ If the extents are the same, then pass the attribute data for\n \/\/ efficiency.\n if (inExt[0] == outExt[0] && inExt[1] == outExt[1] &&\n inExt[2] == outExt[2] && inExt[3] == outExt[3] &&\n inExt[4] == outExt[4] && inExt[5] == outExt[5])\n {\/\/ Pass\n \/\/ set the name of the output to match the input name\n outArray = output->GetPointData()->GetScalars();\n if (inArray)\n {\n outArray->SetName(inArray->GetName());\n }\n output->GetPointData()->PassData(input->GetPointData());\n output->GetCellData()->PassData(input->GetCellData());\n }\n else\n {\/\/ Copy\n \/\/ Since this can be expensive to copy all of these values,\n \/\/ lets make sure there are arrays to copy (other than the scalars)\n if (input->GetPointData()->GetNumberOfArrays() > 1)\n {\n \/\/ Copy the point data.\n \/\/ CopyAllocate frees all arrays.\n \/\/ Keep the old scalar array (not being copied).\n \/\/ This is a hack, but avoids reallocation ...\n vtkDataArray *tmp = NULL;\n if ( ! output->GetPointData()->GetCopyScalars() )\n {\n tmp = output->GetPointData()->GetScalars();\n }\n output->GetPointData()->CopyAllocate(input->GetPointData(), \n output->GetNumberOfPoints());\n if (tmp)\n { \/\/ Restore the array.\n output->GetPointData()->SetScalars(tmp);\n }\n \/\/ Now Copy The point data, but only if output is a subextent of the\n \/\/ input.\n if (outExt[0] >= inExt[0] && outExt[1] <= inExt[1] &&\n outExt[2] >= inExt[2] && outExt[3] <= inExt[3] &&\n outExt[4] >= inExt[4] && outExt[5] <= inExt[5])\n {\n output->GetPointData()->CopyStructuredData(input->GetPointData(),\n inExt, outExt);\n }\n }\n\n if (input->GetCellData()->GetNumberOfArrays() > 0)\n {\n output->GetCellData()->CopyAllocate(input->GetCellData(), \n output->GetNumberOfCells()); \n \/\/ Cell extent is one less than point extent.\n \/\/ Conditional to handle a colapsed axis (lower dimensional cells).\n if (inExt[0] < inExt[1]) {--inExt[1];}\n if (inExt[2] < inExt[3]) {--inExt[3];}\n if (inExt[4] < inExt[5]) {--inExt[5];}\n \/\/ Cell extent is one less than point extent.\n if (outExt[0] < outExt[1]) {--outExt[1];}\n if (outExt[2] < outExt[3]) {--outExt[3];}\n if (outExt[4] < outExt[5]) {--outExt[5];}\n \/\/ Now Copy The cell data, but only if output is a subextent of the input. \n if (outExt[0] >= inExt[0] && outExt[1] <= inExt[1] &&\n outExt[2] >= inExt[2] && outExt[3] <= inExt[3] &&\n outExt[4] >= inExt[4] && outExt[5] <= inExt[5])\n {\n output->GetCellData()->CopyStructuredData(input->GetCellData(),\n inExt, outExt);\n }\n }\n }\n \/\/ set the name of the output to match the input name\n outArray = output->GetPointData()->GetScalars();\n if (inArray)\n {\n outArray->SetName(inArray->GetName());\n }\n }\n}\n\n\n\/\/----------------------------------------------------------------------------\nvtkImageData* vtkImageAlgorithm::GetOutput()\n{\n return this->GetOutput(0);\n}\n\n\/\/----------------------------------------------------------------------------\nvtkImageData* vtkImageAlgorithm::GetOutput(int port)\n{\n return vtkImageData::SafeDownCast(this->GetOutputDataObject(port));\n}\n\n\/\/----------------------------------------------------------------------------\nvoid vtkImageAlgorithm::SetOutput(vtkDataObject* d)\n{\n this->GetExecutive()->SetOutputData(0, d);\n}\n\n\/\/----------------------------------------------------------------------------\nint vtkImageAlgorithm::FillOutputPortInformation(\n int vtkNotUsed(port), vtkInformation* info)\n{\n \/\/ now add our info\n info->Set(vtkDataObject::DATA_TYPE_NAME(), \"vtkImageData\");\n \n return 1;\n}\n\nint vtkImageAlgorithm::FillInputPortInformation(\n int vtkNotUsed(port), vtkInformation* info)\n{\n info->Set(vtkAlgorithm::INPUT_REQUIRED_DATA_TYPE(), \"vtkImageData\");\n return 1;\n}\n\n\/\/----------------------------------------------------------------------------\nvoid vtkImageAlgorithm::SetInput(vtkDataObject* input)\n{\n this->SetInput(0, input);\n}\n\n\/\/----------------------------------------------------------------------------\nvoid vtkImageAlgorithm::SetInput(int index, vtkDataObject* input)\n{\n if(input)\n {\n this->SetInputConnection(index, input->GetProducerPort());\n }\n else\n {\n \/\/ Setting a NULL input removes the connection.\n this->SetInputConnection(index, 0);\n }\n}\n\n\/\/----------------------------------------------------------------------------\nvtkDataObject* vtkImageAlgorithm::GetInput(int port)\n{\n if (this->GetNumberOfInputConnections(port) < 1)\n {\n return 0;\n }\n return this->GetExecutive()->GetInputData(port, 0);\n}\n\n\/\/----------------------------------------------------------------------------\nvoid vtkImageAlgorithm::AddInput(vtkDataObject* input)\n{\n this->AddInput(0, input);\n}\n\n\/\/----------------------------------------------------------------------------\nvoid vtkImageAlgorithm::AddInput(int index, vtkDataObject* input)\n{\n if(input)\n {\n this->AddInputConnection(index, input->GetProducerPort());\n }\n}\n<|endoftext|>"} {"text":"<commit_before>\/*=========================================================================\n\n Program: Insight Segmentation & Registration Toolkit\n Module: fltkShape3D.cxx\n Language: C++\n Date: $Date$\n Version: $Revision$\n\nCopyright (c) 2001 Insight Consortium\nAll rights reserved.\n\nRedistribution and use in source and binary forms, with or without\nmodification, are permitted provided that the following conditions are met:\n\n * Redistributions of source code must retain the above copyright notice,\n this list of conditions and the following disclaimer.\n\n * Redistributions in binary form must reproduce the above copyright notice,\n this list of conditions and the following disclaimer in the documentation\n and\/or other materials provided with the distribution.\n\n * The name of the Insight Consortium, nor the names of any consortium members,\n nor of any contributors, may be used to endorse or promote products derived\n from this software without specific prior written permission.\n\n * Modified source versions must be plainly marked as such, and must not be\n misrepresented as being the original software.\n\nTHIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDER AND CONTRIBUTORS ``AS IS''\nAND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE\nIMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE\nARE DISCLAIMED. IN NO EVENT SHALL THE AUTHORS OR CONTRIBUTORS BE LIABLE FOR\nANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL\nDAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR\nSERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER\nCAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,\nOR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE\nOF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.\n\n=========================================================================*\/\n\n\n#include \"fltkShape3D.h\"\n\n\nnamespace fltk {\n\n\/\/--------------------------------------------------\n\/\/\n\/\/ Constructor \n\/\/\n\/\/--------------------------------------------------\nShape3D::Shape3D() \n{\n m_DrawingMode = triangles;\n m_CompileMode = noCompile;\n m_DisplayList = 0;\n \n m_Color.Set( 1.0f, 1.0f, 1.0f );\n \n m_Transparency = 0.0f;\n \n m_ScheduledToRemoveDisplayList = false;\n m_ScheduledToUpdateDisplayList = false;\n \n m_Father = 0;\n\n m_AutoSensing = true;\n m_RestoreTransform = false;\n \n m_DrawCommand = DrawCommandType::New();\n m_DrawCommand->SetCallbackFunction( this, &(Self::glDraw) );\n\n m_DisplayListUpdateCommand = DisplayListUpdateCommandType::New();\n m_DisplayListUpdateCommand->SetCallbackFunction( \n this, \n &(Self::ScheduleToUpdateDisplayList) );\n \n}\n\n\n\n\n\/\/--------------------------------------------------\n\/\/\n\/\/ Destructor\n\/\/\n\/\/--------------------------------------------------\nShape3D::~Shape3D() \n{\n\n if( m_Father ) \n {\n m_Father->RemoveComponent( this );\n }\n\n ContainerType::iterator it = m_Components.begin();\n while( it != m_Components.end() )\n {\n (*it)->m_Father = 0;\n ++it;\n }\n\n m_Components.clear();\n\n \/\/ The only secure way to destroy the \n \/\/ display list (if one exists) is to\n \/\/ schedule its removal and force a \n \/\/ last and slow redraw\n \/\/ ... before calling the destructor\n \/\/ So maybe the GL windows should be\n \/\/ observers of the DestroyEvent of \n \/\/ this object.\n ScheduleToRemoveDisplayList();\n\n}\n\n\n\/\/---------------------------------------------------------------------\n\/\/\n\/\/ Chaining method to print an object's instance variables, as well as\n\/\/ its superclasses.\n\/\/\n\/\/----------------------------------------------------------------------\nvoid \nShape3D\n::PrintSelf( std::ostream& os, itk::Indent indent) const\n{\n Superclass::PrintSelf(os, indent);\n\n os << indent << \"Current Position : \" << m_CurrentPosition << std::endl;\n os << indent << \"Restore Transform : \" << m_RestoreTransform << std::endl;\n os << indent << \"Auto Sensing : \" << m_AutoSensing << std::endl;\n os << indent << \"Display List Id : \" << m_DisplayList << std::endl;\n os << indent << \"Scheduled to Update Display List: \" << m_ScheduledToUpdateDisplayList << std::endl;\n os << indent << \"Scheduled to Remove Display List: \" << m_ScheduledToRemoveDisplayList << std::endl;\n os << indent << \"OpenGL Compile Mode : \" << m_CompileMode << std::endl;\n os << indent << \"Drawing Mode : \" << m_DrawingMode << std::endl;\n os << indent << \"Number of Components : \" << m_Components.size() << std::endl;\n os << indent << \"Color : \" << m_Color << std::endl;\n os << indent << \"Transparency : \" << m_Transparency << std::endl;\n\n os << indent << \"Transform : \" << std::endl;\n for(unsigned int row=0; row<4; row++)\n {\n for(unsigned int col=0; col<4; col++)\n {\n os << m_Transform[ row + 4 * col ]; \/\/ or the transpose ? \n }\n os << std::endl;\n }\n\n}\n\n\n\/\/--------------------------------------------------\n\/\/\n\/\/ Schedule the shape to update the display list\n\/\/ during the next redraw\n\/\/\n\/\/--------------------------------------------------\nvoid Shape3D::ScheduleToUpdateDisplayList( void ) const\n{\n m_ScheduledToUpdateDisplayList = true;\n if( m_Father )\n {\n m_Father->ScheduleToUpdateDisplayList();\n }\n}\n\n\n\n\n\/\/--------------------------------------------------\n\/\/\n\/\/ Choose drawing mode\n\/\/\n\/\/--------------------------------------------------\nvoid Shape3D::SetDrawingMode(enum drawingModes newmode) \n{\n m_DrawingMode = newmode;\n\n ContainerType::iterator it = m_Components.begin();\n while( it != m_Components.end() )\n {\n (*it)->SetDrawingMode( newmode );\n ++it;\n }\n\n if( m_CompileMode != noCompile && m_DisplayList ) \n {\n ScheduleToUpdateDisplayList();\n }\n}\n\n\n\/\/--------------------------------------------------\n\/\/\n\/\/ Get Draw Command\n\/\/\n\/\/--------------------------------------------------\nShape3D::DrawCommandPointer\nShape3D::GetDrawCommand(void) \n{\n return m_DrawCommand.GetPointer();\n}\n\n\n\/\/--------------------------------------------------\n\/\/\n\/\/ Get Command for scheduling the \n\/\/ update of the display list\n\/\/\n\/\/--------------------------------------------------\nShape3D::DisplayListUpdateCommandPointer\nShape3D::GetDisplayListUpdateCommand(void) \n{\n return m_DisplayListUpdateCommand.GetPointer();\n}\n\n\n\n \n\/\/--------------------------------------------------\n\/\/\n\/\/ Choose compile mode\n\/\/\n\/\/--------------------------------------------------\nvoid Shape3D::SetCompileMode(enum compileModes newmode) \n{\n m_CompileMode = newmode;\n if( m_CompileMode == noCompile && m_DisplayList ) \n {\n ScheduleToUpdateDisplayList();\n }\n}\n\n\n\n\/\/--------------------------------------------------\n\/\/\n\/\/ Choose color for drawing\n\/\/\n\/\/--------------------------------------------------\nvoid Shape3D::SetColor(const Shape3D::ColorType &newcolor ) \n{\n\n m_Color = newcolor;\n\n ContainerType::iterator it = m_Components.begin();\n while( it != m_Components.end() )\n {\n (*it)->SetColor( newcolor );\n ++it;\n }\n \n ScheduleToUpdateDisplayList();\n \n}\n\n\n\/\/--------------------------------------------------\n\/\/\n\/\/ Choose transparency for drawing\n\/\/\n\/\/--------------------------------------------------\nvoid Shape3D::SetTransparency(GLfloat transparency) \n{\n \n m_Transparency = transparency;\n \n ContainerType::iterator it = m_Components.begin();\n while( it != m_Components.end() )\n {\n (*it)->SetTransparency( transparency );\n ++it;\n }\n\n ScheduleToUpdateDisplayList();\n\n}\n\n\n\/\/--------------------------------------------------\n\/\/\n\/\/ Set the selection for computing current position\n\/\/ during the next OpenGL redraw\n\/\/\n\/\/--------------------------------------------------\nvoid Shape3D::SetAutoSensing( bool sensing ) const\n{\n m_AutoSensing = sensing;\n \n ContainerType::const_iterator it = m_Components.begin();\n while( it != m_Components.end() )\n {\n (*it)->SetAutoSensing( sensing );\n ++it;\n }\n\n}\n\n\n\/\/--------------------------------------------------\n\/\/\n\/\/ Set the selection for restoring the transform\n\/\/ during the next OpenGL redraw\n\/\/\n\/\/--------------------------------------------------\nvoid Shape3D::SetRestoreTransform( bool restoring ) const\n{\n m_RestoreTransform = restoring;\n \n ContainerType::const_iterator it = m_Components.begin();\n while( it != m_Components.end() )\n {\n (*it)->SetRestoreTransform( restoring );\n ++it;\n }\n\n}\n\n\n\n\/\/--------------------------------------------------\n\/\/\n\/\/ Return the selection for computing current position\n\/\/ during the next OpenGL redraw\n\/\/\n\/\/--------------------------------------------------\nbool Shape3D::GetAutoSensing( void ) const\n{\n return m_AutoSensing;\n}\n \n\n\n \n\/\/--------------------------------------------------\n\/\/\n\/\/ Prepare color in OpenGL\n\/\/\n\/\/--------------------------------------------------\nvoid Shape3D::glColor(void) const \n{\n glColor3f( m_Color.GetRed(), \n m_Color.GetGreen(), \n m_Color.GetBlue() );\n}\n\n \n\n\n\/\/--------------------------------------------------\n\/\/\n\/\/ Prepare color in OpenGL\n\/\/\n\/\/--------------------------------------------------\nvoid Shape3D::glMaterialColor(void) const \n{\n GLfloat color[] = { m_Color.GetRed(), \n m_Color.GetGreen(), \n m_Color.GetBlue(), \n (GLfloat)(1.0-m_Transparency) };\n glMaterialfv(GL_FRONT,GL_DIFFUSE,color);\n}\n\n\n\n\n\/\/--------------------------------------------------\n\/\/\n\/\/ Remove display list\n\/\/\n\/\/--------------------------------------------------\nvoid Shape3D::ScheduleToRemoveDisplayList(void) const\n{\n m_ScheduledToRemoveDisplayList = true;\n}\n\n\n\n\n\/\/--------------------------------------------------\n\/\/\n\/\/ Add a Component\n\/\/\n\/\/--------------------------------------------------\nvoid Shape3D::AddComponent(Shape3D * newcomponent) \n{\n\n if( newcomponent == 0 )\n {\n return;\n }\n \n newcomponent->m_Father = this;\n m_Components.push_back( newcomponent );\n}\n\n\n\n\/\/--------------------------------------------------\n\/\/\n\/\/ Remove a Component\n\/\/\n\/\/--------------------------------------------------\nvoid Shape3D::RemoveComponent(Shape3D * oldcomponent) \n{\n\n if( oldcomponent == 0 )\n {\n return;\n }\n \n oldcomponent->m_Father = 0;\n m_Components.remove( oldcomponent );\n \n}\n\n\n\n\/\/--------------------------------------------------\n\/\/\n\/\/ Get First Component\n\/\/\n\/\/--------------------------------------------------\nShape3D::ContainerType::iterator \nShape3D::GetFirstComponent(void)\n{\n return m_Components.begin();\n}\n\n\n\n\/\/--------------------------------------------------\n\/\/\n\/\/ Get the current position in OpenGL\n\/\/ Model Space\n\/\/\n\/\/--------------------------------------------------\nvoid\nShape3D::ComputeCurrentTransform( void ) const\n{\n glGetFloatv( GL_MODELVIEW_MATRIX, m_Transform );\n}\n\n\n\/\/--------------------------------------------------\n\/\/\n\/\/ Get the current position in OpenGL\n\/\/ Model Space\n\/\/\n\/\/--------------------------------------------------\nconst Shape3D::PointType &\nShape3D::GetCurrentPosition(void) const\n{\n PointType here;\n here = 0.0, 0.0, 0.0;\n m_CurrentPosition = ComputeCurrentPosition( here );\n return m_CurrentPosition;\n}\n\n\n\n\/\/--------------------------------------------------\n\/\/\n\/\/ Get the current position in OpenGL\n\/\/ Model Space\n\/\/\n\/\/--------------------------------------------------\nShape3D::PointType\nShape3D::ComputeCurrentPosition(const PointType & pnt) const\n{\n const GLfloat *m = m_Transform;\n PointType result;\n double d = m[3] * pnt[0] + m[7] * pnt[1] + m[11] * pnt[2] + m[15];\n result[0] = ( m[0] * pnt[0] + m[4] * pnt[1] + m[ 8] * pnt[2] + m[12] ) \/ d;\n result[1] = ( m[1] * pnt[0] + m[5] * pnt[1] + m[ 9] * pnt[2] + m[13] ) \/ d;\n result[2] = ( m[2] * pnt[0] + m[6] * pnt[1] + m[10] * pnt[2] + m[14] ) \/ d;\n\n return result;\n}\n\n\n\n\/\/--------------------------------------------------\n\/\/\n\/\/ Get the current orientation in OpenGL\n\/\/ Model Space\n\/\/\n\/\/--------------------------------------------------\nShape3D::VectorType\nShape3D::ComputeCurrentOrientation(const VectorType & vec ) const\n{\n const GLfloat *m = m_Transform;\n VectorType result;\n result[0] = ( m[0] * vec[0] + m[4] * vec[1] + m[ 8] * vec[2] );\n result[1] = ( m[1] * vec[0] + m[5] * vec[1] + m[ 9] * vec[2] );\n result[2] = ( m[2] * vec[0] + m[6] * vec[1] + m[10] * vec[2] );\n return result;\n}\n\n\n\n\/\/--------------------------------------------------\n\/\/\n\/\/ Draw Geometry\n\/\/\n\/\/--------------------------------------------------\nvoid Shape3D::DrawGeometry(void) const\n{\n itkWarningMacro( << \"Shape3D::DrawGeometry this method should not be called\" );\n}\n\n\n\/\/--------------------------------------------------\n\/\/\n\/\/ Redraw ask the eventual Observer to refresh\n\/\/ their views\n\/\/\n\/\/--------------------------------------------------\nvoid Shape3D::Redraw(void) const\n{\n InvokeEvent( RedrawEvent );\n}\n\n\n\n\/\/--------------------------------------------------\n\/\/\n\/\/ Invoke an event in the top of the hierarchy\n\/\/\n\/\/--------------------------------------------------\nvoid Shape3D::InvokeEvent( unsigned long event ) const\n{\n \n this->itk::Object::InvokeEvent( event );\n\n if( m_Father ) \n {\n m_Father->InvokeEvent( event );\n }\n\n\n}\n\n\n\n\n\/\/--------------------------------------------------\n\/\/\n\/\/ draw the shape\n\/\/\n\/\/--------------------------------------------------\nvoid Shape3D::glDraw(void) const \n{\n\n if( m_ScheduledToRemoveDisplayList && m_DisplayList ) \n {\n glDeleteLists( m_DisplayList, 1 );\n m_ScheduledToRemoveDisplayList = false;\n m_DisplayList = 0;\n return;\n }\n \n if( m_ScheduledToUpdateDisplayList && m_DisplayList ) \n {\n glDeleteLists( m_DisplayList, 1 );\n m_ScheduledToUpdateDisplayList = false;\n m_DisplayList = 0;\n }\n \n if( m_CompileMode != noCompile && m_DisplayList ) \n {\n glCallList( m_DisplayList );\n return;\n }\n\n\n switch( m_CompileMode ) \n {\n case noCompile:\n {\n if( m_DisplayList ) \n {\n glDeleteLists( m_DisplayList, 1 );\n m_DisplayList = 0;\n }\n break;\n }\n case onlyCompile: \n {\n m_DisplayList = glGenLists( 1 ); \n glNewList( m_DisplayList, GL_COMPILE );\n break;\n }\n case compileExecute: \n {\n m_DisplayList = glGenLists( 1 ); \n glNewList( m_DisplayList, GL_COMPILE_AND_EXECUTE );\n break;\n }\n }\n\n switch( m_DrawingMode ) \n {\n case none : \n {\n break;\n }\n case points : \n {\n glDisable( GL_LIGHTING ); \n glColor(); \n break; \n }\n case lines : \n {\n glDisable( GL_LIGHTING ); \n glColor(); \n break;\n }\n case triangles: \n {\n glEnable( GL_LIGHTING ); \n glMaterialColor(); \n break;\n }\n\n case surfacepoints:\n {\n break; \n }\n }\n\n if( m_AutoSensing ) \n {\n ComputeCurrentTransform();\n }\n\n if( m_RestoreTransform )\n {\n glLoadMatrixf( m_Transform );\n }\n\n DrawGeometry();\n\n if( m_DisplayList != 0 ) \n {\n glEndList();\n }\n\n \n}\n\n\n\n} \/\/ end namespace fltk\n\n\n\n<commit_msg>FIX: VC++ has trouble understanding scope specifiers for base class methods. In order to call InvokeMethod, a const pointer to itk::Object has been used.<commit_after>\/*=========================================================================\n\n Program: Insight Segmentation & Registration Toolkit\n Module: fltkShape3D.cxx\n Language: C++\n Date: $Date$\n Version: $Revision$\n\nCopyright (c) 2001 Insight Consortium\nAll rights reserved.\n\nRedistribution and use in source and binary forms, with or without\nmodification, are permitted provided that the following conditions are met:\n\n * Redistributions of source code must retain the above copyright notice,\n this list of conditions and the following disclaimer.\n\n * Redistributions in binary form must reproduce the above copyright notice,\n this list of conditions and the following disclaimer in the documentation\n and\/or other materials provided with the distribution.\n\n * The name of the Insight Consortium, nor the names of any consortium members,\n nor of any contributors, may be used to endorse or promote products derived\n from this software without specific prior written permission.\n\n * Modified source versions must be plainly marked as such, and must not be\n misrepresented as being the original software.\n\nTHIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDER AND CONTRIBUTORS ``AS IS''\nAND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE\nIMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE\nARE DISCLAIMED. IN NO EVENT SHALL THE AUTHORS OR CONTRIBUTORS BE LIABLE FOR\nANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL\nDAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR\nSERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER\nCAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,\nOR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE\nOF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.\n\n=========================================================================*\/\n\n\n#include \"fltkShape3D.h\"\n\n\nnamespace fltk {\n\n\/\/--------------------------------------------------\n\/\/\n\/\/ Constructor \n\/\/\n\/\/--------------------------------------------------\nShape3D::Shape3D() \n{\n m_DrawingMode = triangles;\n m_CompileMode = noCompile;\n m_DisplayList = 0;\n \n m_Color.Set( 1.0f, 1.0f, 1.0f );\n \n m_Transparency = 0.0f;\n \n m_ScheduledToRemoveDisplayList = false;\n m_ScheduledToUpdateDisplayList = false;\n \n m_Father = 0;\n\n m_AutoSensing = true;\n m_RestoreTransform = false;\n \n m_DrawCommand = DrawCommandType::New();\n m_DrawCommand->SetCallbackFunction( this, &(Self::glDraw) );\n\n m_DisplayListUpdateCommand = DisplayListUpdateCommandType::New();\n m_DisplayListUpdateCommand->SetCallbackFunction( \n this, \n &(Self::ScheduleToUpdateDisplayList) );\n \n}\n\n\n\n\n\/\/--------------------------------------------------\n\/\/\n\/\/ Destructor\n\/\/\n\/\/--------------------------------------------------\nShape3D::~Shape3D() \n{\n\n if( m_Father ) \n {\n m_Father->RemoveComponent( this );\n }\n\n ContainerType::iterator it = m_Components.begin();\n while( it != m_Components.end() )\n {\n (*it)->m_Father = 0;\n ++it;\n }\n\n m_Components.clear();\n\n \/\/ The only secure way to destroy the \n \/\/ display list (if one exists) is to\n \/\/ schedule its removal and force a \n \/\/ last and slow redraw\n \/\/ ... before calling the destructor\n \/\/ So maybe the GL windows should be\n \/\/ observers of the DestroyEvent of \n \/\/ this object.\n ScheduleToRemoveDisplayList();\n\n}\n\n\n\/\/---------------------------------------------------------------------\n\/\/\n\/\/ Chaining method to print an object's instance variables, as well as\n\/\/ its superclasses.\n\/\/\n\/\/----------------------------------------------------------------------\nvoid \nShape3D\n::PrintSelf( std::ostream& os, itk::Indent indent) const\n{\n Superclass::PrintSelf(os, indent);\n\n os << indent << \"Current Position : \" << m_CurrentPosition << std::endl;\n os << indent << \"Restore Transform : \" << m_RestoreTransform << std::endl;\n os << indent << \"Auto Sensing : \" << m_AutoSensing << std::endl;\n os << indent << \"Display List Id : \" << m_DisplayList << std::endl;\n os << indent << \"Scheduled to Update Display List: \" << m_ScheduledToUpdateDisplayList << std::endl;\n os << indent << \"Scheduled to Remove Display List: \" << m_ScheduledToRemoveDisplayList << std::endl;\n os << indent << \"OpenGL Compile Mode : \" << m_CompileMode << std::endl;\n os << indent << \"Drawing Mode : \" << m_DrawingMode << std::endl;\n os << indent << \"Number of Components : \" << m_Components.size() << std::endl;\n os << indent << \"Color : \" << m_Color << std::endl;\n os << indent << \"Transparency : \" << m_Transparency << std::endl;\n\n os << indent << \"Transform : \" << std::endl;\n for(unsigned int row=0; row<4; row++)\n {\n for(unsigned int col=0; col<4; col++)\n {\n os << m_Transform[ row + 4 * col ]; \/\/ or the transpose ? \n }\n os << std::endl;\n }\n\n}\n\n\n\/\/--------------------------------------------------\n\/\/\n\/\/ Schedule the shape to update the display list\n\/\/ during the next redraw\n\/\/\n\/\/--------------------------------------------------\nvoid Shape3D::ScheduleToUpdateDisplayList( void ) const\n{\n m_ScheduledToUpdateDisplayList = true;\n if( m_Father )\n {\n m_Father->ScheduleToUpdateDisplayList();\n }\n}\n\n\n\n\n\/\/--------------------------------------------------\n\/\/\n\/\/ Choose drawing mode\n\/\/\n\/\/--------------------------------------------------\nvoid Shape3D::SetDrawingMode(enum drawingModes newmode) \n{\n m_DrawingMode = newmode;\n\n ContainerType::iterator it = m_Components.begin();\n while( it != m_Components.end() )\n {\n (*it)->SetDrawingMode( newmode );\n ++it;\n }\n\n if( m_CompileMode != noCompile && m_DisplayList ) \n {\n ScheduleToUpdateDisplayList();\n }\n}\n\n\n\/\/--------------------------------------------------\n\/\/\n\/\/ Get Draw Command\n\/\/\n\/\/--------------------------------------------------\nShape3D::DrawCommandPointer\nShape3D::GetDrawCommand(void) \n{\n return m_DrawCommand.GetPointer();\n}\n\n\n\/\/--------------------------------------------------\n\/\/\n\/\/ Get Command for scheduling the \n\/\/ update of the display list\n\/\/\n\/\/--------------------------------------------------\nShape3D::DisplayListUpdateCommandPointer\nShape3D::GetDisplayListUpdateCommand(void) \n{\n return m_DisplayListUpdateCommand.GetPointer();\n}\n\n\n\n \n\/\/--------------------------------------------------\n\/\/\n\/\/ Choose compile mode\n\/\/\n\/\/--------------------------------------------------\nvoid Shape3D::SetCompileMode(enum compileModes newmode) \n{\n m_CompileMode = newmode;\n if( m_CompileMode == noCompile && m_DisplayList ) \n {\n ScheduleToUpdateDisplayList();\n }\n}\n\n\n\n\/\/--------------------------------------------------\n\/\/\n\/\/ Choose color for drawing\n\/\/\n\/\/--------------------------------------------------\nvoid Shape3D::SetColor(const Shape3D::ColorType &newcolor ) \n{\n\n m_Color = newcolor;\n\n ContainerType::iterator it = m_Components.begin();\n while( it != m_Components.end() )\n {\n (*it)->SetColor( newcolor );\n ++it;\n }\n \n ScheduleToUpdateDisplayList();\n \n}\n\n\n\/\/--------------------------------------------------\n\/\/\n\/\/ Choose transparency for drawing\n\/\/\n\/\/--------------------------------------------------\nvoid Shape3D::SetTransparency(GLfloat transparency) \n{\n \n m_Transparency = transparency;\n \n ContainerType::iterator it = m_Components.begin();\n while( it != m_Components.end() )\n {\n (*it)->SetTransparency( transparency );\n ++it;\n }\n\n ScheduleToUpdateDisplayList();\n\n}\n\n\n\/\/--------------------------------------------------\n\/\/\n\/\/ Set the selection for computing current position\n\/\/ during the next OpenGL redraw\n\/\/\n\/\/--------------------------------------------------\nvoid Shape3D::SetAutoSensing( bool sensing ) const\n{\n m_AutoSensing = sensing;\n \n ContainerType::const_iterator it = m_Components.begin();\n while( it != m_Components.end() )\n {\n (*it)->SetAutoSensing( sensing );\n ++it;\n }\n\n}\n\n\n\/\/--------------------------------------------------\n\/\/\n\/\/ Set the selection for restoring the transform\n\/\/ during the next OpenGL redraw\n\/\/\n\/\/--------------------------------------------------\nvoid Shape3D::SetRestoreTransform( bool restoring ) const\n{\n m_RestoreTransform = restoring;\n \n ContainerType::const_iterator it = m_Components.begin();\n while( it != m_Components.end() )\n {\n (*it)->SetRestoreTransform( restoring );\n ++it;\n }\n\n}\n\n\n\n\/\/--------------------------------------------------\n\/\/\n\/\/ Return the selection for computing current position\n\/\/ during the next OpenGL redraw\n\/\/\n\/\/--------------------------------------------------\nbool Shape3D::GetAutoSensing( void ) const\n{\n return m_AutoSensing;\n}\n \n\n\n \n\/\/--------------------------------------------------\n\/\/\n\/\/ Prepare color in OpenGL\n\/\/\n\/\/--------------------------------------------------\nvoid Shape3D::glColor(void) const \n{\n glColor3f( m_Color.GetRed(), \n m_Color.GetGreen(), \n m_Color.GetBlue() );\n}\n\n \n\n\n\/\/--------------------------------------------------\n\/\/\n\/\/ Prepare color in OpenGL\n\/\/\n\/\/--------------------------------------------------\nvoid Shape3D::glMaterialColor(void) const \n{\n GLfloat color[] = { m_Color.GetRed(), \n m_Color.GetGreen(), \n m_Color.GetBlue(), \n (GLfloat)(1.0-m_Transparency) };\n glMaterialfv(GL_FRONT,GL_DIFFUSE,color);\n}\n\n\n\n\n\/\/--------------------------------------------------\n\/\/\n\/\/ Remove display list\n\/\/\n\/\/--------------------------------------------------\nvoid Shape3D::ScheduleToRemoveDisplayList(void) const\n{\n m_ScheduledToRemoveDisplayList = true;\n}\n\n\n\n\n\/\/--------------------------------------------------\n\/\/\n\/\/ Add a Component\n\/\/\n\/\/--------------------------------------------------\nvoid Shape3D::AddComponent(Shape3D * newcomponent) \n{\n\n if( newcomponent == 0 )\n {\n return;\n }\n \n newcomponent->m_Father = this;\n m_Components.push_back( newcomponent );\n}\n\n\n\n\/\/--------------------------------------------------\n\/\/\n\/\/ Remove a Component\n\/\/\n\/\/--------------------------------------------------\nvoid Shape3D::RemoveComponent(Shape3D * oldcomponent) \n{\n\n if( oldcomponent == 0 )\n {\n return;\n }\n \n oldcomponent->m_Father = 0;\n m_Components.remove( oldcomponent );\n \n}\n\n\n\n\/\/--------------------------------------------------\n\/\/\n\/\/ Get First Component\n\/\/\n\/\/--------------------------------------------------\nShape3D::ContainerType::iterator \nShape3D::GetFirstComponent(void)\n{\n return m_Components.begin();\n}\n\n\n\n\/\/--------------------------------------------------\n\/\/\n\/\/ Get the current position in OpenGL\n\/\/ Model Space\n\/\/\n\/\/--------------------------------------------------\nvoid\nShape3D::ComputeCurrentTransform( void ) const\n{\n glGetFloatv( GL_MODELVIEW_MATRIX, m_Transform );\n}\n\n\n\/\/--------------------------------------------------\n\/\/\n\/\/ Get the current position in OpenGL\n\/\/ Model Space\n\/\/\n\/\/--------------------------------------------------\nconst Shape3D::PointType &\nShape3D::GetCurrentPosition(void) const\n{\n PointType here;\n here = 0.0, 0.0, 0.0;\n m_CurrentPosition = ComputeCurrentPosition( here );\n return m_CurrentPosition;\n}\n\n\n\n\/\/--------------------------------------------------\n\/\/\n\/\/ Get the current position in OpenGL\n\/\/ Model Space\n\/\/\n\/\/--------------------------------------------------\nShape3D::PointType\nShape3D::ComputeCurrentPosition(const PointType & pnt) const\n{\n const GLfloat *m = m_Transform;\n PointType result;\n double d = m[3] * pnt[0] + m[7] * pnt[1] + m[11] * pnt[2] + m[15];\n result[0] = ( m[0] * pnt[0] + m[4] * pnt[1] + m[ 8] * pnt[2] + m[12] ) \/ d;\n result[1] = ( m[1] * pnt[0] + m[5] * pnt[1] + m[ 9] * pnt[2] + m[13] ) \/ d;\n result[2] = ( m[2] * pnt[0] + m[6] * pnt[1] + m[10] * pnt[2] + m[14] ) \/ d;\n\n return result;\n}\n\n\n\n\/\/--------------------------------------------------\n\/\/\n\/\/ Get the current orientation in OpenGL\n\/\/ Model Space\n\/\/\n\/\/--------------------------------------------------\nShape3D::VectorType\nShape3D::ComputeCurrentOrientation(const VectorType & vec ) const\n{\n const GLfloat *m = m_Transform;\n VectorType result;\n result[0] = ( m[0] * vec[0] + m[4] * vec[1] + m[ 8] * vec[2] );\n result[1] = ( m[1] * vec[0] + m[5] * vec[1] + m[ 9] * vec[2] );\n result[2] = ( m[2] * vec[0] + m[6] * vec[1] + m[10] * vec[2] );\n return result;\n}\n\n\n\n\/\/--------------------------------------------------\n\/\/\n\/\/ Draw Geometry\n\/\/\n\/\/--------------------------------------------------\nvoid Shape3D::DrawGeometry(void) const\n{\n itkWarningMacro( << \"Shape3D::DrawGeometry this method should not be called\" );\n}\n\n\n\/\/--------------------------------------------------\n\/\/\n\/\/ Redraw ask the eventual Observer to refresh\n\/\/ their views\n\/\/\n\/\/--------------------------------------------------\nvoid Shape3D::Redraw(void) const\n{\n InvokeEvent( RedrawEvent );\n}\n\n\n\n\/\/--------------------------------------------------\n\/\/\n\/\/ Invoke an event in the top of the hierarchy\n\/\/\n\/\/--------------------------------------------------\nvoid Shape3D::InvokeEvent( unsigned long event ) const\n{\n \n const itk::Object * super = this;\n super->InvokeEvent( event );\n\n if( m_Father ) \n {\n m_Father->InvokeEvent( event );\n }\n\n\n}\n\n\n\n\n\/\/--------------------------------------------------\n\/\/\n\/\/ draw the shape\n\/\/\n\/\/--------------------------------------------------\nvoid Shape3D::glDraw(void) const \n{\n\n if( m_ScheduledToRemoveDisplayList && m_DisplayList ) \n {\n glDeleteLists( m_DisplayList, 1 );\n m_ScheduledToRemoveDisplayList = false;\n m_DisplayList = 0;\n return;\n }\n \n if( m_ScheduledToUpdateDisplayList && m_DisplayList ) \n {\n glDeleteLists( m_DisplayList, 1 );\n m_ScheduledToUpdateDisplayList = false;\n m_DisplayList = 0;\n }\n \n if( m_CompileMode != noCompile && m_DisplayList ) \n {\n glCallList( m_DisplayList );\n return;\n }\n\n\n switch( m_CompileMode ) \n {\n case noCompile:\n {\n if( m_DisplayList ) \n {\n glDeleteLists( m_DisplayList, 1 );\n m_DisplayList = 0;\n }\n break;\n }\n case onlyCompile: \n {\n m_DisplayList = glGenLists( 1 ); \n glNewList( m_DisplayList, GL_COMPILE );\n break;\n }\n case compileExecute: \n {\n m_DisplayList = glGenLists( 1 ); \n glNewList( m_DisplayList, GL_COMPILE_AND_EXECUTE );\n break;\n }\n }\n\n switch( m_DrawingMode ) \n {\n case none : \n {\n break;\n }\n case points : \n {\n glDisable( GL_LIGHTING ); \n glColor(); \n break; \n }\n case lines : \n {\n glDisable( GL_LIGHTING ); \n glColor(); \n break;\n }\n case triangles: \n {\n glEnable( GL_LIGHTING ); \n glMaterialColor(); \n break;\n }\n\n case surfacepoints:\n {\n break; \n }\n }\n\n if( m_AutoSensing ) \n {\n ComputeCurrentTransform();\n }\n\n if( m_RestoreTransform )\n {\n glLoadMatrixf( m_Transform );\n }\n\n DrawGeometry();\n\n if( m_DisplayList != 0 ) \n {\n glEndList();\n }\n\n \n}\n\n\n\n} \/\/ end namespace fltk\n\n\n\n<|endoftext|>"} {"text":"<commit_before>\/\/ ======================================================================== \/\/\n\/\/ Copyright 2009-2017 Intel Corporation \/\/\n\/\/ \/\/\n\/\/ Licensed under the Apache License, Version 2.0 (the \"License\"); \/\/\n\/\/ you may not use this file except in compliance with the License. \/\/\n\/\/ You may obtain a copy of the License at \/\/\n\/\/ \/\/\n\/\/ http:\/\/www.apache.org\/licenses\/LICENSE-2.0 \/\/\n\/\/ \/\/\n\/\/ Unless required by applicable law or agreed to in writing, software \/\/\n\/\/ distributed under the License is distributed on an \"AS IS\" BASIS, \/\/\n\/\/ WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. \/\/\n\/\/ See the License for the specific language governing permissions and \/\/\n\/\/ limitations under the License. \/\/\n\/\/ ======================================================================== \/\/\n\n#include \"Volume.h\"\n#include \"sg\/common\/World.h\"\n\nnamespace ospray {\n namespace sg {\n\n static vec3i checkForAndEnableDistributedVolumes()\n {\n auto dpFromEnv = getEnvVar<std::string>(\"OSPRAY_DATA_PARALLEL\");\n\n if (dpFromEnv.first) {\n \/\/ Create the OSPRay object.\n vec3i blockDims;\n int rc = sscanf(dpFromEnv.second.c_str(), \"%dx%dx%d\",\n &blockDims.x, &blockDims.y, &blockDims.z);\n if (rc != 3) {\n throw std::runtime_error(\"could not parse OSPRAY_DATA_PARALLEL \"\n \"env-var. Must be of format <X>x<Y>x<>Z \"\n \"(e.g., '4x4x4'\");\n }\n Volume::useDataDistributedVolume = true;\n return blockDims;\n } else {\n return {0, 0, 0,};\n }\n }\n\n \/*! helper function to help build voxel ranges during parsing *\/\n template<typename T>\n inline void extendVoxelRange(ospcommon::vec2f &voxelRange,\n const T *voxel, size_t num)\n {\n for (size_t i = 0; i < num; ++i) {\n voxelRange.x = std::min(voxelRange.x, static_cast<float>(voxel[i]));\n voxelRange.y = std::max(voxelRange.y, static_cast<float>(voxel[i]));\n }\n }\n\n \/\/! Convenient wrapper that will do the template dispatch for you based on\n \/\/ the voxelType passed\n inline void extendVoxelRange(ospcommon::vec2f &voxelRange,\n const OSPDataType voxelType,\n const unsigned char *voxels,\n const size_t numVoxels)\n {\n switch (voxelType) {\n case OSP_UCHAR:\n extendVoxelRange(voxelRange, voxels, numVoxels);\n break;\n case OSP_SHORT:\n extendVoxelRange(voxelRange,\n reinterpret_cast<const short*>(voxels),\n numVoxels);\n break;\n case OSP_USHORT:\n extendVoxelRange(voxelRange,\n reinterpret_cast<const unsigned short*>(voxels),\n numVoxels);\n break;\n case OSP_FLOAT:\n extendVoxelRange(voxelRange,\n reinterpret_cast<const float*>(voxels),\n numVoxels);\n break;\n case OSP_DOUBLE:\n extendVoxelRange(voxelRange,\n reinterpret_cast<const double*>(voxels),\n numVoxels);\n break;\n default:\n throw std::runtime_error(\"sg::extendVoxelRange: unsupported voxel type!\");\n }\n }\n\n \/\/ =======================================================\n \/\/ base volume class\n \/\/ =======================================================\n\n bool Volume::useDataDistributedVolume = false;\n\n \/*! \\brief returns a std::string with the c++ name of this class *\/\n Volume::Volume()\n {\n createChildNode(\"transferFunction\", \"TransferFunction\");\n createChildNode(\"gradientShadingEnabled\", \"bool\", true);\n createChildNode(\"preIntegration\", \"bool\", true);\n createChildNode(\"singleShade\", \"bool\", true);\n createChildNode(\"voxelRange\", \"vec2f\",\n vec2f(std::numeric_limits<float>::infinity(),\n -std::numeric_limits<float>::infinity()));\n createChildNode(\"adaptiveSampling\", \"bool\", true);\n createChildNode(\"adaptiveScalar\", \"float\", 15.f);\n createChildNode(\"adaptiveBacktrack\", \"float\", 0.03f);\n createChildNode(\"samplingRate\", \"float\", 0.125f);\n createChildNode(\"adaptiveMaxSamplingRate\", \"float\", 2.f);\n createChildNode(\"volumeClippingBoxLower\", \"vec3f\", vec3f(0.f));\n createChildNode(\"volumeClippingBoxUpper\", \"vec3f\", vec3f(0.f));\n createChildNode(\"specular\", \"vec3f\", vec3f(0.3f));\n createChildNode(\"gridOrigin\", \"vec3f\", vec3f(0.0f));\n createChildNode(\"gridSpacing\", \"vec3f\", vec3f(0.002f));\n createChildNode(\"isosurfaceEnabled\", \"bool\", false);\n createChildNode(\"isosurface\", \"float\",\n -std::numeric_limits<float>::infinity(),\n NodeFlags::valid_min_max |\n NodeFlags::gui_slider).setMinMax(0.f,255.f);\n }\n\n std::string Volume::toString() const\n {\n return \"ospray::sg::Volume\";\n }\n\n void Volume::serialize(sg::Serialization::State &state)\n {\n Node::serialize(state);\n }\n\n void Volume::preRender(RenderContext &ctx)\n {\n if (volume) {\n ospAddVolume(ctx.world->ospModel,volume);\n if (child(\"isosurfaceEnabled\").valueAs<bool>() == true\n && isosurfacesGeometry)\n ospAddGeometry(ctx.world->ospModel, isosurfacesGeometry);\n }\n }\n\n \/\/ =======================================================\n \/\/ structured volume class\n \/\/ =======================================================\n\n \/\/! constructor\n StructuredVolume::StructuredVolume()\n : dimensions(-1), voxelType(\"<undefined>\"), mappedPointer(nullptr)\n {\n }\n\n \/*! \\brief returns a std::string with the c++ name of this class *\/\n std::string StructuredVolume::toString() const\n {\n return \"ospray::sg::StructuredVolume\";\n }\n\n \/\/! return bounding box of all primitives\n box3f StructuredVolume::bounds() const\n {\n return {vec3f(0.f),\n vec3f(getDimensions())*child(\"gridSpacing\").valueAs<vec3f>()};\n }\n\n \/\/! \\brief Initialize this node's value from given XML node\n\n void StructuredVolume::setFromXML(const xml::Node &node,\n const unsigned char *binBasePtr)\n {\n Assert2(binBasePtr,\n \"mapped binary file is nullptr, in XML node that \"\n \"needs mapped binary data (sg::StructuredVolume)\");\n voxelType = node.getProp(\"voxelType\");\n if (node.hasProp(\"ofs\"))\n mappedPointer = binBasePtr + std::stoll(node.getProp(\"ofs\",\"0\"));\n dimensions = toVec3i(node.getProp(\"dimensions\").c_str());\n\n if (voxelType == \"uint8\")\n voxelType = \"uchar\";\n if (voxelType != \"float\" &&\n voxelType != \"uint8\" &&\n voxelType != \"uchar\") {\n throw std::runtime_error(\"unknown StructuredVolume.voxelType (currently\"\n \" only supporting 'float' and 'uint8')\");\n }\n\n std::cout << \"#osp:sg: created StructuredVolume from XML file, \"\n << \"dimensions = \" << getDimensions() << std::endl;\n }\n\n void StructuredVolume::postCommit(RenderContext &ctx)\n {\n }\n\n OSP_REGISTER_SG_NODE(StructuredVolume);\n\n \/\/ =======================================================\n \/\/ structured volume that is stored in a separate file (ie, a file\n \/\/ other than the ospbin file)\n \/\/ =======================================================\n\n \/\/! constructor\n StructuredVolumeFromFile::StructuredVolumeFromFile()\n : dimensions(-1), fileName(\"\"), voxelType(\"<undefined>\")\n {}\n\n \/*! \\brief returns a std::string with the c++ name of this class *\/\n std::string StructuredVolumeFromFile::toString() const\n {\n return \"ospray::sg::StructuredVolumeFromFile\";\n }\n\n \/\/! return bounding box of all primitives\n box3f StructuredVolumeFromFile::bounds() const\n {\n return {vec3f(0.f),\n vec3f(getDimensions())*child(\"gridSpacing\").valueAs<vec3f>()};\n }\n\n \/\/! \\brief Initialize this node's value from given XML node\n void StructuredVolumeFromFile::setFromXML(const xml::Node &node,\n const unsigned char *binBasePtr)\n {\n voxelType = node.getProp(\"voxelType\");\n if (voxelType == \"uint8\") voxelType = \"uchar\";\n dimensions = toVec3i(node.getProp(\"dimensions\").c_str());\n fileName = node.getProp(\"fileName\");\n\n if (fileName.empty()) {\n throw std::runtime_error(\"sg::StructuredVolumeFromFile: \"\n \"no 'fileName' specified\");\n }\n\n fileNameOfCorrespondingXmlDoc = node.doc->fileName;\n\n if (voxelType != \"float\" && voxelType != \"uchar\") {\n throw std::runtime_error(\"unknown StructuredVolume.voxelType \"\n \"(currently support 'float' and 'uchar')\");\n }\n\n std::cout << \"#osp:sg: created StructuredVolume from XML file, \"\n << \"dimensions = \" << getDimensions() << std::endl;\n }\n\n void StructuredVolumeFromFile::preCommit(RenderContext &ctx)\n {\n if (volume) {\n ospCommit(volume);\n if (child(\"isosurfaceEnabled\").valueAs<bool>() == true\n && isosurfacesGeometry) {\n OSPData isovaluesData = ospNewData(1, OSP_FLOAT, \n &child(\"isosurface\").valueAs<float>());\n ospSetData(isosurfacesGeometry, \"isovalues\", isovaluesData);\n ospCommit(isosurfacesGeometry);\n }\n return;\n }\n\n if (dimensions.x <= 0 || dimensions.y <= 0 || dimensions.z <= 0) {\n throw std::runtime_error(\"StructuredVolume::render(): \"\n \"invalid volume dimensions\");\n }\n\n vec3i dataDistributedBlocks = checkForAndEnableDistributedVolumes();\n\n bool useBlockBricked = 1;\n\n if (useDataDistributedVolume) {\n volume = ospNewVolume(\"data_distributed_volume\");\n ospSetVec3i(volume,\"num_dp_blocks\",(osp::vec3i&)dataDistributedBlocks);\n }\n else\n volume = ospNewVolume(useBlockBricked ? \"block_bricked_volume\" :\n \"shared_structured_volume\");\n\n if (!volume) THROW_SG_ERROR(\"could not allocate volume\");\n\n isosurfacesGeometry = ospNewGeometry(\"isosurfaces\");\n ospSetObject(isosurfacesGeometry, \"volume\", volume);\n\n setValue((OSPObject)volume);\n\n ospSetString(volume,\"voxelType\",voxelType.c_str());\n ospSetVec3i(volume,\"dimensions\",(const osp::vec3i&)dimensions);\n\n FileName realFileName = fileNameOfCorrespondingXmlDoc.path()+fileName;\n FILE *file = fopen(realFileName.c_str(),\"rb\");\n if (!file)\n throw std::runtime_error(\"StructuredVolumeFromFile::render(): could not open file '\"\n +realFileName.str()+\"' (expanded from xml file '\"\n +fileNameOfCorrespondingXmlDoc.str()\n +\"' and file name '\"+fileName+\"')\");\n\n vec2f voxelRange(std::numeric_limits<float>::infinity(), -std::numeric_limits<float>::infinity());\n const OSPDataType ospVoxelType = getOSPDataTypeFor(voxelType);\n const size_t voxelSize = sizeOf(ospVoxelType);\n if (useBlockBricked || useDataDistributedVolume) {\n const size_t nPerSlice = (size_t)dimensions.x * (size_t)dimensions.y;\n std::vector<uint8_t> slice(nPerSlice * voxelSize, 0);\n\n for (size_t z = 0; z < dimensions.z; ++z) {\n if (fread(slice.data(), voxelSize, nPerSlice, file) != nPerSlice) {\n throw std::runtime_error(\"StructuredVolume::render(): read incomplete slice \"\n \"data ... partial file or wrong format!?\");\n }\n const vec3i region_lo(0, 0, z);\n const vec3i region_sz(dimensions.x, dimensions.y, 1);\n extendVoxelRange(voxelRange, ospVoxelType, slice.data(), nPerSlice);\n ospSetRegion(volume, slice.data(), (const osp::vec3i&)region_lo, (const osp::vec3i&)region_sz);\n }\n } else {\n const size_t nVoxels = (size_t)dimensions.x * (size_t)dimensions.y * (size_t)dimensions.z;\n uint8_t *voxels = new uint8_t[nVoxels * voxelSize];\n if (fread(voxels, voxelSize, nVoxels, file) != nVoxels) {\n THROW_SG_ERROR(\"read incomplete data (truncated file or wrong format?!)\");\n }\n extendVoxelRange(voxelRange, ospVoxelType, voxels, nVoxels);\n OSPData data = ospNewData(nVoxels, ospVoxelType, voxels, OSP_DATA_SHARED_BUFFER);\n ospSetData(volume,\"voxelData\",data);\n }\n fclose(file);\n\n child(\"voxelRange\").setValue(voxelRange);\n child(\"isosurface\").setMinMax(voxelRange.x, voxelRange.y);\n float iso = child(\"isosurface\").valueAs<float>();\n if (iso < voxelRange.x || iso > voxelRange.y)\n child(\"isosurface\").setValue((voxelRange.y-voxelRange.x)\/2.f);\n child(\"transferFunction\")[\"valueRange\"].setValue(voxelRange);\n child(\"transferFunction\").preCommit(ctx);\n\n ospSetObject(volume,\n \"transferFunction\",\n child(\"transferFunction\").valueAs<OSPObject>());\n ospCommit(volume);\n }\n\n void StructuredVolumeFromFile::postCommit(RenderContext &ctx)\n {\n ospSetObject(volume,\"transferFunction\",\n child(\"transferFunction\").valueAs<OSPObject>());\n ospCommit(volume);\n }\n\n OSP_REGISTER_SG_NODE(StructuredVolumeFromFile);\n\n \/\/ =======================================================\n \/\/ stacked slices volume class\n \/\/ =======================================================\n\n StackedRawSlices::StackedRawSlices()\n : baseName(\"\"), voxelType(\"uint8_t\"), dimensions(-1)\n {}\n\n \/*! \\brief returns a std::string with the c++ name of this class *\/\n std::string StackedRawSlices::toString() const\n {\n return \"ospray::sg::StackedRawSlices\";\n }\n\n \/\/! return bounding box of all primitives\n box3f StackedRawSlices::bounds() const\n {\n return box3f(vec3f(0.f),vec3f(getDimensions()));\n }\n\n \/\/! \\brief Initialize this node's value from given XML node\n void StackedRawSlices::setFromXML(const xml::Node &node,\n const unsigned char *binBasePtr)\n {\n voxelType = node.getProp(\"voxelType\");\n sliceResolution = toVec2i(node.getProp(\"sliceResolution\").c_str());\n baseName = node.getProp(\"baseName\");\n firstSliceID = std::stoll(node.getProp(\"firstSliceID\",\"0\"));\n numSlices = std::stoll(node.getProp(\"numSlices\"));\n\n if (voxelType != \"uint8_t\") {\n throw std::runtime_error(\"unknown StackedRawSlices.voxelType \"\n \"(currently only supporting 'uint8_t')\");\n }\n }\n\n OSP_REGISTER_SG_NODE(StackedRawSlices);\n\n } \/\/ ::ospray::sg\n} \/\/ ::ospray\n<commit_msg>Enable other volume types, they were supported but check was not updated<commit_after>\/\/ ======================================================================== \/\/\n\/\/ Copyright 2009-2017 Intel Corporation \/\/\n\/\/ \/\/\n\/\/ Licensed under the Apache License, Version 2.0 (the \"License\"); \/\/\n\/\/ you may not use this file except in compliance with the License. \/\/\n\/\/ You may obtain a copy of the License at \/\/\n\/\/ \/\/\n\/\/ http:\/\/www.apache.org\/licenses\/LICENSE-2.0 \/\/\n\/\/ \/\/\n\/\/ Unless required by applicable law or agreed to in writing, software \/\/\n\/\/ distributed under the License is distributed on an \"AS IS\" BASIS, \/\/\n\/\/ WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. \/\/\n\/\/ See the License for the specific language governing permissions and \/\/\n\/\/ limitations under the License. \/\/\n\/\/ ======================================================================== \/\/\n\n#include \"Volume.h\"\n#include \"sg\/common\/World.h\"\n\nnamespace ospray {\n namespace sg {\n\n static vec3i checkForAndEnableDistributedVolumes()\n {\n auto dpFromEnv = getEnvVar<std::string>(\"OSPRAY_DATA_PARALLEL\");\n\n if (dpFromEnv.first) {\n \/\/ Create the OSPRay object.\n vec3i blockDims;\n int rc = sscanf(dpFromEnv.second.c_str(), \"%dx%dx%d\",\n &blockDims.x, &blockDims.y, &blockDims.z);\n if (rc != 3) {\n throw std::runtime_error(\"could not parse OSPRAY_DATA_PARALLEL \"\n \"env-var. Must be of format <X>x<Y>x<>Z \"\n \"(e.g., '4x4x4'\");\n }\n Volume::useDataDistributedVolume = true;\n return blockDims;\n } else {\n return {0, 0, 0,};\n }\n }\n\n \/*! helper function to help build voxel ranges during parsing *\/\n template<typename T>\n inline void extendVoxelRange(ospcommon::vec2f &voxelRange,\n const T *voxel, size_t num)\n {\n for (size_t i = 0; i < num; ++i) {\n voxelRange.x = std::min(voxelRange.x, static_cast<float>(voxel[i]));\n voxelRange.y = std::max(voxelRange.y, static_cast<float>(voxel[i]));\n }\n }\n\n \/\/! Convenient wrapper that will do the template dispatch for you based on\n \/\/ the voxelType passed\n inline void extendVoxelRange(ospcommon::vec2f &voxelRange,\n const OSPDataType voxelType,\n const unsigned char *voxels,\n const size_t numVoxels)\n {\n switch (voxelType) {\n case OSP_UCHAR:\n extendVoxelRange(voxelRange, voxels, numVoxels);\n break;\n case OSP_SHORT:\n extendVoxelRange(voxelRange,\n reinterpret_cast<const short*>(voxels),\n numVoxels);\n break;\n case OSP_USHORT:\n extendVoxelRange(voxelRange,\n reinterpret_cast<const unsigned short*>(voxels),\n numVoxels);\n break;\n case OSP_FLOAT:\n extendVoxelRange(voxelRange,\n reinterpret_cast<const float*>(voxels),\n numVoxels);\n break;\n case OSP_DOUBLE:\n extendVoxelRange(voxelRange,\n reinterpret_cast<const double*>(voxels),\n numVoxels);\n break;\n default:\n throw std::runtime_error(\"sg::extendVoxelRange: unsupported voxel type!\");\n }\n }\n\n bool unsupportedVoxelType(const std::string &type) {\n return type != \"uchar\" && type != \"ushort\" && type != \"short\"\n && type != \"float\" && type != \"double\";\n }\n\n \/\/ =======================================================\n \/\/ base volume class\n \/\/ =======================================================\n\n bool Volume::useDataDistributedVolume = false;\n\n \/*! \\brief returns a std::string with the c++ name of this class *\/\n Volume::Volume()\n {\n createChildNode(\"transferFunction\", \"TransferFunction\");\n createChildNode(\"gradientShadingEnabled\", \"bool\", true);\n createChildNode(\"preIntegration\", \"bool\", true);\n createChildNode(\"singleShade\", \"bool\", true);\n createChildNode(\"voxelRange\", \"vec2f\",\n vec2f(std::numeric_limits<float>::infinity(),\n -std::numeric_limits<float>::infinity()));\n createChildNode(\"adaptiveSampling\", \"bool\", true);\n createChildNode(\"adaptiveScalar\", \"float\", 15.f);\n createChildNode(\"adaptiveBacktrack\", \"float\", 0.03f);\n createChildNode(\"samplingRate\", \"float\", 0.125f);\n createChildNode(\"adaptiveMaxSamplingRate\", \"float\", 2.f);\n createChildNode(\"volumeClippingBoxLower\", \"vec3f\", vec3f(0.f));\n createChildNode(\"volumeClippingBoxUpper\", \"vec3f\", vec3f(0.f));\n createChildNode(\"specular\", \"vec3f\", vec3f(0.3f));\n createChildNode(\"gridOrigin\", \"vec3f\", vec3f(0.0f));\n createChildNode(\"gridSpacing\", \"vec3f\", vec3f(0.002f));\n createChildNode(\"isosurfaceEnabled\", \"bool\", false);\n createChildNode(\"isosurface\", \"float\",\n -std::numeric_limits<float>::infinity(),\n NodeFlags::valid_min_max |\n NodeFlags::gui_slider).setMinMax(0.f,255.f);\n }\n\n std::string Volume::toString() const\n {\n return \"ospray::sg::Volume\";\n }\n\n void Volume::serialize(sg::Serialization::State &state)\n {\n Node::serialize(state);\n }\n\n void Volume::preRender(RenderContext &ctx)\n {\n if (volume) {\n ospAddVolume(ctx.world->ospModel,volume);\n if (child(\"isosurfaceEnabled\").valueAs<bool>() == true\n && isosurfacesGeometry)\n ospAddGeometry(ctx.world->ospModel, isosurfacesGeometry);\n }\n }\n\n \/\/ =======================================================\n \/\/ structured volume class\n \/\/ =======================================================\n\n \/\/! constructor\n StructuredVolume::StructuredVolume()\n : dimensions(-1), voxelType(\"<undefined>\"), mappedPointer(nullptr)\n {\n }\n\n \/*! \\brief returns a std::string with the c++ name of this class *\/\n std::string StructuredVolume::toString() const\n {\n return \"ospray::sg::StructuredVolume\";\n }\n\n \/\/! return bounding box of all primitives\n box3f StructuredVolume::bounds() const\n {\n return {vec3f(0.f),\n vec3f(getDimensions())*child(\"gridSpacing\").valueAs<vec3f>()};\n }\n\n \/\/! \\brief Initialize this node's value from given XML node\n\n void StructuredVolume::setFromXML(const xml::Node &node,\n const unsigned char *binBasePtr)\n {\n Assert2(binBasePtr,\n \"mapped binary file is nullptr, in XML node that \"\n \"needs mapped binary data (sg::StructuredVolume)\");\n voxelType = node.getProp(\"voxelType\");\n if (node.hasProp(\"ofs\"))\n mappedPointer = binBasePtr + std::stoll(node.getProp(\"ofs\",\"0\"));\n dimensions = toVec3i(node.getProp(\"dimensions\").c_str());\n\n if (voxelType == \"uint8\")\n voxelType = \"uchar\";\n if (unsupportedVoxelType(voxelType)) {\n THROW_SG_ERROR(\"unknown StructuredVolume.voxelType '\" + voxelType + \"'\");\n }\n\n std::cout << \"#osp:sg: created StructuredVolume from XML file, \"\n << \"dimensions = \" << getDimensions() << std::endl;\n }\n\n void StructuredVolume::postCommit(RenderContext &ctx)\n {\n }\n\n OSP_REGISTER_SG_NODE(StructuredVolume);\n\n \/\/ =======================================================\n \/\/ structured volume that is stored in a separate file (ie, a file\n \/\/ other than the ospbin file)\n \/\/ =======================================================\n\n \/\/! constructor\n StructuredVolumeFromFile::StructuredVolumeFromFile()\n : dimensions(-1), fileName(\"\"), voxelType(\"<undefined>\")\n {}\n\n \/*! \\brief returns a std::string with the c++ name of this class *\/\n std::string StructuredVolumeFromFile::toString() const\n {\n return \"ospray::sg::StructuredVolumeFromFile\";\n }\n\n \/\/! return bounding box of all primitives\n box3f StructuredVolumeFromFile::bounds() const\n {\n return {vec3f(0.f),\n vec3f(getDimensions())*child(\"gridSpacing\").valueAs<vec3f>()};\n }\n\n \/\/! \\brief Initialize this node's value from given XML node\n void StructuredVolumeFromFile::setFromXML(const xml::Node &node,\n const unsigned char *binBasePtr)\n {\n voxelType = node.getProp(\"voxelType\");\n if (voxelType == \"uint8\") voxelType = \"uchar\";\n dimensions = toVec3i(node.getProp(\"dimensions\").c_str());\n fileName = node.getProp(\"fileName\");\n\n if (fileName.empty()) {\n throw std::runtime_error(\"sg::StructuredVolumeFromFile: \"\n \"no 'fileName' specified\");\n }\n if (unsupportedVoxelType(voxelType)) {\n THROW_SG_ERROR(\"unknown StructuredVolume.voxelType '\" + voxelType + \"'\");\n }\n\n fileNameOfCorrespondingXmlDoc = node.doc->fileName;\n\n std::cout << \"#osp:sg: created StructuredVolume from XML file, \"\n << \"dimensions = \" << getDimensions() << std::endl;\n }\n\n void StructuredVolumeFromFile::preCommit(RenderContext &ctx)\n {\n if (volume) {\n ospCommit(volume);\n if (child(\"isosurfaceEnabled\").valueAs<bool>() == true\n && isosurfacesGeometry) {\n OSPData isovaluesData = ospNewData(1, OSP_FLOAT, \n &child(\"isosurface\").valueAs<float>());\n ospSetData(isosurfacesGeometry, \"isovalues\", isovaluesData);\n ospCommit(isosurfacesGeometry);\n }\n return;\n }\n\n if (dimensions.x <= 0 || dimensions.y <= 0 || dimensions.z <= 0) {\n throw std::runtime_error(\"StructuredVolume::render(): \"\n \"invalid volume dimensions\");\n }\n\n vec3i dataDistributedBlocks = checkForAndEnableDistributedVolumes();\n\n bool useBlockBricked = 1;\n\n if (useDataDistributedVolume) {\n volume = ospNewVolume(\"data_distributed_volume\");\n ospSetVec3i(volume,\"num_dp_blocks\",(osp::vec3i&)dataDistributedBlocks);\n }\n else\n volume = ospNewVolume(useBlockBricked ? \"block_bricked_volume\" :\n \"shared_structured_volume\");\n\n if (!volume) THROW_SG_ERROR(\"could not allocate volume\");\n\n isosurfacesGeometry = ospNewGeometry(\"isosurfaces\");\n ospSetObject(isosurfacesGeometry, \"volume\", volume);\n\n setValue((OSPObject)volume);\n\n ospSetString(volume,\"voxelType\",voxelType.c_str());\n ospSetVec3i(volume,\"dimensions\",(const osp::vec3i&)dimensions);\n\n FileName realFileName = fileNameOfCorrespondingXmlDoc.path()+fileName;\n FILE *file = fopen(realFileName.c_str(),\"rb\");\n if (!file)\n throw std::runtime_error(\"StructuredVolumeFromFile::render(): could not open file '\"\n +realFileName.str()+\"' (expanded from xml file '\"\n +fileNameOfCorrespondingXmlDoc.str()\n +\"' and file name '\"+fileName+\"')\");\n\n vec2f voxelRange(std::numeric_limits<float>::infinity(), -std::numeric_limits<float>::infinity());\n const OSPDataType ospVoxelType = getOSPDataTypeFor(voxelType);\n const size_t voxelSize = sizeOf(ospVoxelType);\n if (useBlockBricked || useDataDistributedVolume) {\n const size_t nPerSlice = (size_t)dimensions.x * (size_t)dimensions.y;\n std::vector<uint8_t> slice(nPerSlice * voxelSize, 0);\n\n for (size_t z = 0; z < dimensions.z; ++z) {\n if (fread(slice.data(), voxelSize, nPerSlice, file) != nPerSlice) {\n throw std::runtime_error(\"StructuredVolume::render(): read incomplete slice \"\n \"data ... partial file or wrong format!?\");\n }\n const vec3i region_lo(0, 0, z);\n const vec3i region_sz(dimensions.x, dimensions.y, 1);\n extendVoxelRange(voxelRange, ospVoxelType, slice.data(), nPerSlice);\n ospSetRegion(volume, slice.data(), (const osp::vec3i&)region_lo, (const osp::vec3i&)region_sz);\n }\n } else {\n const size_t nVoxels = (size_t)dimensions.x * (size_t)dimensions.y * (size_t)dimensions.z;\n uint8_t *voxels = new uint8_t[nVoxels * voxelSize];\n if (fread(voxels, voxelSize, nVoxels, file) != nVoxels) {\n THROW_SG_ERROR(\"read incomplete data (truncated file or wrong format?!)\");\n }\n extendVoxelRange(voxelRange, ospVoxelType, voxels, nVoxels);\n OSPData data = ospNewData(nVoxels, ospVoxelType, voxels, OSP_DATA_SHARED_BUFFER);\n ospSetData(volume,\"voxelData\",data);\n }\n fclose(file);\n\n child(\"voxelRange\").setValue(voxelRange);\n child(\"isosurface\").setMinMax(voxelRange.x, voxelRange.y);\n float iso = child(\"isosurface\").valueAs<float>();\n if (iso < voxelRange.x || iso > voxelRange.y)\n child(\"isosurface\").setValue((voxelRange.y-voxelRange.x)\/2.f);\n child(\"transferFunction\")[\"valueRange\"].setValue(voxelRange);\n child(\"transferFunction\").preCommit(ctx);\n\n ospSetObject(volume,\n \"transferFunction\",\n child(\"transferFunction\").valueAs<OSPObject>());\n ospCommit(volume);\n }\n\n void StructuredVolumeFromFile::postCommit(RenderContext &ctx)\n {\n ospSetObject(volume,\"transferFunction\",\n child(\"transferFunction\").valueAs<OSPObject>());\n ospCommit(volume);\n }\n\n OSP_REGISTER_SG_NODE(StructuredVolumeFromFile);\n\n \/\/ =======================================================\n \/\/ stacked slices volume class\n \/\/ =======================================================\n\n StackedRawSlices::StackedRawSlices()\n : baseName(\"\"), voxelType(\"uint8_t\"), dimensions(-1)\n {}\n\n \/*! \\brief returns a std::string with the c++ name of this class *\/\n std::string StackedRawSlices::toString() const\n {\n return \"ospray::sg::StackedRawSlices\";\n }\n\n \/\/! return bounding box of all primitives\n box3f StackedRawSlices::bounds() const\n {\n return box3f(vec3f(0.f),vec3f(getDimensions()));\n }\n\n \/\/! \\brief Initialize this node's value from given XML node\n void StackedRawSlices::setFromXML(const xml::Node &node,\n const unsigned char *binBasePtr)\n {\n voxelType = node.getProp(\"voxelType\");\n sliceResolution = toVec2i(node.getProp(\"sliceResolution\").c_str());\n baseName = node.getProp(\"baseName\");\n firstSliceID = std::stoll(node.getProp(\"firstSliceID\",\"0\"));\n numSlices = std::stoll(node.getProp(\"numSlices\"));\n\n if (voxelType != \"uint8_t\") {\n throw std::runtime_error(\"unknown StackedRawSlices.voxelType \"\n \"(currently only supporting 'uint8_t')\");\n }\n }\n\n OSP_REGISTER_SG_NODE(StackedRawSlices);\n\n } \/\/ ::ospray::sg\n} \/\/ ::ospray\n<|endoftext|>"} {"text":"<commit_before>#include \"aquila\/global.h\"\n#include \"aquila\/ml\/Dtw.h\"\n#include <unittestpp.h>\n#include <vector>\n\n\nSUITE(Dtw)\n{\n TEST(DistanceToItself)\n {\n const std::size_t SIZE = 3;\n double arr1[SIZE] = {0, 1, 2}, arr2[SIZE] = {1, 2, 3};\n std::vector<double> v1(arr1, arr1 + SIZE), v2(arr2, arr2 + SIZE);\n\n Aquila::DtwDataType from, to;\n from.push_back(v1);\n from.push_back(v2);\n to.push_back(v1);\n to.push_back(v2);\n\n Aquila::Dtw dtw;\n double distance = dtw.getDistance(from, to);\n\n CHECK_CLOSE(0.0, distance, 0.000001);\n }\n\n TEST(ZeroDiagonalDistance)\n {\n const std::size_t SIZE = 3;\n double arr1[SIZE] = {0, 0, 0}, arr2[SIZE] = {1, 1, 1};\n std::vector<double> zeros(arr1, arr1 + SIZE), ones(arr2, arr2 + SIZE);\n\n Aquila::DtwDataType from, to;\n from.push_back(zeros);\n from.push_back(ones);\n from.push_back(ones);\n to.push_back(zeros);\n to.push_back(ones);\n to.push_back(ones);\n\n \/**\n * this will give the following local Manhattan distances:\n *\n * 3 0 0\n * 3 0 0\n * 0 3 3\n *\n * and the lowest-cost path will be on the diagonal.\n *\/\n\n Aquila::Dtw dtw(Aquila::manhattanDistance);\n double distance = dtw.getDistance(from, to);\n\n CHECK_CLOSE(0.0, distance, 0.000001);\n }\n\n TEST(NonZeroDiagonalDistance)\n {\n const std::size_t SIZE = 3;\n double arr1[SIZE] = {0, 0, 0}, arr2[SIZE] = {1, 1, 1};\n std::vector<double> zeros(arr1, arr1 + SIZE), ones(arr2, arr2 + SIZE);\n\n Aquila::DtwDataType from, to;\n from.push_back(zeros);\n from.push_back(zeros);\n from.push_back(zeros);\n to.push_back(ones);\n to.push_back(ones);\n to.push_back(ones);\n\n \/**\n * this will give the following distances (using Manhattan for local):\n *\n * local accumulated\n *\n * 3 3 3 3 6 9\n * 3 3 3 3 6 6\n * 3 3 3 3 3 3\n *\n * and the lowest-cost path will still be on the diagonal, but this time\n * the distance is a non-zero value.\n *\/\n\n Aquila::Dtw dtw(Aquila::manhattanDistance);\n double distance = dtw.getDistance(from, to);\n\n CHECK_CLOSE(9.0, distance, 0.000001);\n }\n}\n\n<commit_msg>Similarity test.<commit_after>#include \"aquila\/global.h\"\n#include \"aquila\/ml\/Dtw.h\"\n#include <unittestpp.h>\n#include <vector>\n\n\nSUITE(Dtw)\n{\n TEST(DistanceToItself)\n {\n const std::size_t SIZE = 3;\n double arr1[SIZE] = {0, 1, 2}, arr2[SIZE] = {1, 2, 3};\n std::vector<double> v1(arr1, arr1 + SIZE), v2(arr2, arr2 + SIZE);\n\n Aquila::DtwDataType from, to;\n from.push_back(v1);\n from.push_back(v2);\n to.push_back(v1);\n to.push_back(v2);\n\n Aquila::Dtw dtw;\n double distance = dtw.getDistance(from, to);\n\n CHECK_CLOSE(0.0, distance, 0.000001);\n }\n\n TEST(ZeroDiagonalDistance)\n {\n const std::size_t SIZE = 3;\n double arr1[SIZE] = {0, 0, 0}, arr2[SIZE] = {1, 1, 1};\n std::vector<double> zeros(arr1, arr1 + SIZE), ones(arr2, arr2 + SIZE);\n\n Aquila::DtwDataType from, to;\n from.push_back(zeros);\n from.push_back(ones);\n from.push_back(ones);\n to.push_back(zeros);\n to.push_back(ones);\n to.push_back(ones);\n\n \/**\n * this will give the following local Manhattan distances:\n *\n * 3 0 0\n * 3 0 0\n * 0 3 3\n *\n * and the lowest-cost path will be on the diagonal.\n *\/\n\n Aquila::Dtw dtw(Aquila::manhattanDistance);\n double distance = dtw.getDistance(from, to);\n\n CHECK_CLOSE(0.0, distance, 0.000001);\n }\n\n TEST(NonZeroDiagonalDistance)\n {\n const std::size_t SIZE = 3;\n double arr1[SIZE] = {0, 0, 0}, arr2[SIZE] = {1, 1, 1};\n std::vector<double> zeros(arr1, arr1 + SIZE), ones(arr2, arr2 + SIZE);\n\n Aquila::DtwDataType from, to;\n from.push_back(zeros);\n from.push_back(zeros);\n from.push_back(zeros);\n to.push_back(ones);\n to.push_back(ones);\n to.push_back(ones);\n\n \/**\n * this will give the following distances (using Manhattan for local):\n *\n * local accumulated\n *\n * 3 3 3 3 6 9\n * 3 3 3 3 6 6\n * 3 3 3 3 3 3\n *\n * and the lowest-cost path will still be on the diagonal, but this time\n * the distance is a non-zero value.\n *\/\n\n Aquila::Dtw dtw(Aquila::manhattanDistance);\n double distance = dtw.getDistance(from, to);\n\n CHECK_CLOSE(9.0, distance, 0.000001);\n }\n\n TEST(Similarity)\n {\n const std::size_t SIZE = 3;\n double arr1[SIZE] = {0, 0, 0}, arr2[SIZE] = {1, 1, 1};\n std::vector<double> zeros(arr1, arr1 + SIZE), ones(arr2, arr2 + SIZE);\n\n Aquila::DtwDataType from, to1, to2;\n from.push_back(zeros);\n from.push_back(zeros);\n from.push_back(zeros);\n to1.push_back(zeros);\n to1.push_back(zeros);\n to1.push_back(ones);\n to2.push_back(zeros);\n to2.push_back(ones);\n to2.push_back(ones);\n\n \/**\n * 000 is more \"similar\" to 001 than 011, therefore distance between\n * from and to1 should be smaller\n *\/\n Aquila::Dtw dtw;\n double distance1 = dtw.getDistance(from, to1);\n double distance2 = dtw.getDistance(from, to2);\n\n CHECK(distance1 < distance2);\n }\n}\n\n<|endoftext|>"} {"text":"<commit_before>\/\/ Copyright 2010-2014 RethinkDB, all rights reserved.\n#include \"clustering\/administration\/servers\/config_client.hpp\"\n\nserver_config_client_t::server_config_client_t(\n mailbox_manager_t *_mailbox_manager,\n watchable_map_t<peer_id_t, cluster_directory_metadata_t> *_directory_view,\n watchable_map_t<std::pair<peer_id_t, server_id_t>, empty_value_t>\n *_peer_connections_map) :\n mailbox_manager(_mailbox_manager),\n directory_view(_directory_view),\n peer_connections_map(_peer_connections_map),\n directory_subs(\n directory_view,\n std::bind(&server_config_client_t::on_directory_change, this, ph::_1, ph::_2),\n initial_call_t::YES),\n peer_connections_map_subs(\n peer_connections_map,\n std::bind(&server_config_client_t::on_peer_connections_map_change,\n this, ph::_1, ph::_2),\n initial_call_t::YES)\n { }\n\nbool server_config_client_t::set_config(\n const server_id_t &server_id,\n const name_string_t &old_server_name,\n const server_config_t &new_config,\n signal_t *interruptor,\n admin_err_t *error_out) {\n bool name_collision = false, is_noop = false;\n server_config_map.read_all(\n [&](const server_id_t &sid, const server_config_versioned_t *conf) {\n if (sid != server_id && conf->config.name == new_config.name) {\n name_collision = true;\n } else if (sid == server_id && conf->config == new_config) {\n is_noop = true;\n }\n });\n if (name_collision) {\n *error_out = admin_err_t{\n strprintf(\"Cannot rename server `%s` to `%s` because server `%s` \"\n \"already exists.\",\n old_server_name.c_str(), new_config.name.c_str(),\n new_config.name.c_str()),\n query_state_t::FAILED};\n return false;\n }\n if (is_noop) {\n return true;\n }\n\n std::string disconnect_msg = strprintf(\"Lost contact with server `%s` while trying \"\n \"to change the server configuration. The configuration may or may not have been \"\n \"changed.\", old_server_name.c_str());\n\n boost::optional<peer_id_t> peer = server_to_peer_map.get_key(server_id);\n if (!static_cast<bool>(peer)) {\n std::string s = strprintf(\n \"Could not contact server `%s` while trying to change the server \"\n \"configuration. The configuration was not changed.\",\n old_server_name.c_str());\n *error_out = admin_err_t{s, query_state_t::FAILED};\n return false;\n }\n server_config_business_card_t bcard;\n directory_view->read_key(*peer, [&](const cluster_directory_metadata_t *md) {\n guarantee(md != nullptr);\n bcard = md->server_config_business_card.get();\n });\n\n server_config_version_t version;\n {\n promise_t<std::pair<server_config_version_t, std::string> > reply;\n mailbox_t<void(server_config_version_t, std::string)> ack_mailbox(\n mailbox_manager,\n [&](signal_t *, server_config_version_t v, const std::string &m) {\n reply.pulse(std::make_pair(v, m));\n });\n disconnect_watcher_t disconnect_watcher(mailbox_manager, *peer);\n send(mailbox_manager, bcard.set_config_addr,\n new_config, ack_mailbox.get_address());\n wait_any_t waiter(reply.get_ready_signal(), &disconnect_watcher);\n wait_interruptible(&waiter, interruptor);\n if (!reply.is_pulsed()) {\n *error_out = admin_err_t{disconnect_msg, query_state_t::INDETERMINATE};\n return false;\n }\n if (!reply.assert_get_value().second.empty()) {\n guarantee(reply.assert_get_value().first == 0);\n *error_out = admin_err_t{\n strprintf(\"Error when trying to change the configuration of \"\n \"server `%s`: %s The configuration was not changed.\",\n old_server_name.c_str(),\n reply.assert_get_value().second.c_str()),\n query_state_t::FAILED};\n return false;\n }\n version = reply.assert_get_value().first;\n }\n\n \/* Wait up to 10 seconds for the change to appear in the directory. *\/\n try {\n signal_timer_t timeout;\n timeout.start(10000);\n wait_any_t waiter(interruptor, &timeout);\n server_config_map.run_key_until_satisfied(\n server_id,\n [&](const server_config_versioned_t *conf) {\n return conf == nullptr || conf->version >= version;\n },\n &waiter);\n } catch (const interrupted_exc_t &) {\n if (interruptor->is_pulsed()) {\n throw;\n }\n }\n\n return true;\n}\n\nvoid server_config_client_t::install_server_metadata(\n const peer_id_t &peer_id,\n const cluster_directory_metadata_t &metadata) {\n const server_id_t &server_id = metadata.server_id;\n server_to_peer_map.set_key(server_id, peer_id);\n peer_connections_map->read_all(\n [&](const std::pair<peer_id_t, server_id_t> &pair, const empty_value_t *) {\n if (pair.first == peer_id) {\n connections_map.set_key(\n std::make_pair(server_id, pair.second), empty_value_t());\n }\n });\n server_config_map.set_key(server_id, metadata.server_config);\n}\n\nvoid server_config_client_t::on_directory_change(\n const peer_id_t &peer_id,\n const cluster_directory_metadata_t *metadata) {\n if (metadata != nullptr) {\n if (metadata->peer_type != SERVER_PEER) {\n return;\n }\n const server_id_t &server_id = metadata->server_id;\n if (!static_cast<bool>(peer_to_server_map.get_key(peer_id))) {\n all_server_to_peer_map.insert(std::make_pair(server_id, peer_id));\n peer_to_server_map.set_key(peer_id, server_id);\n install_server_metadata(peer_id, *metadata);\n } else {\n server_config_map.set_key(server_id, metadata->server_config);\n }\n\n } else {\n boost::optional<server_id_t> server_id = peer_to_server_map.get_key(peer_id);\n if (!static_cast<bool>(server_id)) {\n return;\n }\n for (auto it = all_server_to_peer_map.lower_bound(*server_id); ; ++it) {\n guarantee(it != all_server_to_peer_map.end());\n if (it->second == peer_id) {\n all_server_to_peer_map.erase(it);\n break;\n }\n }\n peer_to_server_map.delete_key(peer_id);\n server_to_peer_map.delete_key(*server_id);\n peer_connections_map->read_all(\n [&](const std::pair<peer_id_t, server_id_t> &pair, const empty_value_t *) {\n if (pair.first == peer_id) {\n connections_map.delete_key(std::make_pair(*server_id, pair.second));\n }\n });\n server_config_map.delete_key(*server_id);\n\n \/* If there is another connected peer with the same server ID, reinstall its\n values. *\/\n auto jt = all_server_to_peer_map.find(*server_id);\n if (jt != all_server_to_peer_map.end()) {\n directory_view->read_key(jt->second,\n [&](const cluster_directory_metadata_t *other_metadata) {\n guarantee(other_metadata != nullptr);\n guarantee(other_metadata->server_id == *server_id);\n install_server_metadata(jt->second, *other_metadata);\n });\n }\n }\n}\n\nvoid server_config_client_t::on_peer_connections_map_change(\n const std::pair<peer_id_t, server_id_t> &key,\n const empty_value_t *value) {\n directory_view->read_key(key.first,\n [&](const cluster_directory_metadata_t *metadata) {\n if (metadata != nullptr) {\n if (value != nullptr) {\n connections_map.set_key(\n std::make_pair(metadata->server_id, key.second), empty_value_t());\n } else {\n connections_map.delete_key(\n std::make_pair(metadata->server_id, key.second));\n }\n }\n });\n}\n\n\n<commit_msg>Style.<commit_after>\/\/ Copyright 2010-2014 RethinkDB, all rights reserved.\n#include \"clustering\/administration\/servers\/config_client.hpp\"\n\nserver_config_client_t::server_config_client_t(\n mailbox_manager_t *_mailbox_manager,\n watchable_map_t<peer_id_t, cluster_directory_metadata_t> *_directory_view,\n watchable_map_t<std::pair<peer_id_t, server_id_t>, empty_value_t>\n *_peer_connections_map) :\n mailbox_manager(_mailbox_manager),\n directory_view(_directory_view),\n peer_connections_map(_peer_connections_map),\n directory_subs(\n directory_view,\n std::bind(&server_config_client_t::on_directory_change, this, ph::_1, ph::_2),\n initial_call_t::YES),\n peer_connections_map_subs(\n peer_connections_map,\n std::bind(&server_config_client_t::on_peer_connections_map_change,\n this, ph::_1, ph::_2),\n initial_call_t::YES)\n { }\n\nbool server_config_client_t::set_config(\n const server_id_t &server_id,\n const name_string_t &old_server_name,\n const server_config_t &new_config,\n signal_t *interruptor,\n admin_err_t *error_out) {\n bool name_collision = false, is_noop = false;\n server_config_map.read_all(\n [&](const server_id_t &sid, const server_config_versioned_t *conf) {\n if (sid != server_id && conf->config.name == new_config.name) {\n name_collision = true;\n } else if (sid == server_id && conf->config == new_config) {\n is_noop = true;\n }\n });\n if (name_collision) {\n *error_out = admin_err_t{\n strprintf(\"Cannot rename server `%s` to `%s` because server `%s` \"\n \"already exists.\",\n old_server_name.c_str(), new_config.name.c_str(),\n new_config.name.c_str()),\n query_state_t::FAILED};\n return false;\n }\n if (is_noop) {\n return true;\n }\n\n boost::optional<peer_id_t> peer = server_to_peer_map.get_key(server_id);\n if (!static_cast<bool>(peer)) {\n std::string s = strprintf(\n \"Could not contact server `%s` while trying to change the server \"\n \"configuration. The configuration was not changed.\",\n old_server_name.c_str());\n *error_out = admin_err_t{s, query_state_t::FAILED};\n return false;\n }\n server_config_business_card_t bcard;\n directory_view->read_key(*peer, [&](const cluster_directory_metadata_t *md) {\n guarantee(md != nullptr);\n bcard = md->server_config_business_card.get();\n });\n\n server_config_version_t version;\n {\n promise_t<std::pair<server_config_version_t, std::string> > reply;\n mailbox_t<void(server_config_version_t, std::string)> ack_mailbox(\n mailbox_manager,\n [&](signal_t *, server_config_version_t v, const std::string &m) {\n reply.pulse(std::make_pair(v, m));\n });\n disconnect_watcher_t disconnect_watcher(mailbox_manager, *peer);\n send(mailbox_manager, bcard.set_config_addr,\n new_config, ack_mailbox.get_address());\n wait_any_t waiter(reply.get_ready_signal(), &disconnect_watcher);\n wait_interruptible(&waiter, interruptor);\n if (!reply.is_pulsed()) {\n\n std::string disconnect_msg = strprintf(\n \"Lost contact with server `%s` while trying \"\n \"to change the server configuration. The configuration may or may not \"\n \"have been changed.\", old_server_name.c_str());\n *error_out = admin_err_t{disconnect_msg, query_state_t::INDETERMINATE};\n return false;\n }\n if (!reply.assert_get_value().second.empty()) {\n guarantee(reply.assert_get_value().first == 0);\n *error_out = admin_err_t{\n strprintf(\"Error when trying to change the configuration of \"\n \"server `%s`: %s The configuration was not changed.\",\n old_server_name.c_str(),\n reply.assert_get_value().second.c_str()),\n query_state_t::FAILED};\n return false;\n }\n version = reply.assert_get_value().first;\n }\n\n \/* Wait up to 10 seconds for the change to appear in the directory. *\/\n try {\n signal_timer_t timeout;\n timeout.start(10000);\n wait_any_t waiter(interruptor, &timeout);\n server_config_map.run_key_until_satisfied(\n server_id,\n [&](const server_config_versioned_t *conf) {\n return conf == nullptr || conf->version >= version;\n },\n &waiter);\n } catch (const interrupted_exc_t &) {\n if (interruptor->is_pulsed()) {\n throw;\n }\n }\n\n return true;\n}\n\nvoid server_config_client_t::install_server_metadata(\n const peer_id_t &peer_id,\n const cluster_directory_metadata_t &metadata) {\n const server_id_t &server_id = metadata.server_id;\n server_to_peer_map.set_key(server_id, peer_id);\n peer_connections_map->read_all(\n [&](const std::pair<peer_id_t, server_id_t> &pair, const empty_value_t *) {\n if (pair.first == peer_id) {\n connections_map.set_key(\n std::make_pair(server_id, pair.second), empty_value_t());\n }\n });\n server_config_map.set_key(server_id, metadata.server_config);\n}\n\nvoid server_config_client_t::on_directory_change(\n const peer_id_t &peer_id,\n const cluster_directory_metadata_t *metadata) {\n if (metadata != nullptr) {\n if (metadata->peer_type != SERVER_PEER) {\n return;\n }\n const server_id_t &server_id = metadata->server_id;\n if (!static_cast<bool>(peer_to_server_map.get_key(peer_id))) {\n all_server_to_peer_map.insert(std::make_pair(server_id, peer_id));\n peer_to_server_map.set_key(peer_id, server_id);\n install_server_metadata(peer_id, *metadata);\n } else {\n server_config_map.set_key(server_id, metadata->server_config);\n }\n\n } else {\n boost::optional<server_id_t> server_id = peer_to_server_map.get_key(peer_id);\n if (!static_cast<bool>(server_id)) {\n return;\n }\n for (auto it = all_server_to_peer_map.lower_bound(*server_id); ; ++it) {\n guarantee(it != all_server_to_peer_map.end());\n if (it->second == peer_id) {\n all_server_to_peer_map.erase(it);\n break;\n }\n }\n peer_to_server_map.delete_key(peer_id);\n server_to_peer_map.delete_key(*server_id);\n peer_connections_map->read_all(\n [&](const std::pair<peer_id_t, server_id_t> &pair, const empty_value_t *) {\n if (pair.first == peer_id) {\n connections_map.delete_key(std::make_pair(*server_id, pair.second));\n }\n });\n server_config_map.delete_key(*server_id);\n\n \/* If there is another connected peer with the same server ID, reinstall its\n values. *\/\n auto jt = all_server_to_peer_map.find(*server_id);\n if (jt != all_server_to_peer_map.end()) {\n directory_view->read_key(jt->second,\n [&](const cluster_directory_metadata_t *other_metadata) {\n guarantee(other_metadata != nullptr);\n guarantee(other_metadata->server_id == *server_id);\n install_server_metadata(jt->second, *other_metadata);\n });\n }\n }\n}\n\nvoid server_config_client_t::on_peer_connections_map_change(\n const std::pair<peer_id_t, server_id_t> &key,\n const empty_value_t *value) {\n directory_view->read_key(key.first,\n [&](const cluster_directory_metadata_t *metadata) {\n if (metadata != nullptr) {\n if (value != nullptr) {\n connections_map.set_key(\n std::make_pair(metadata->server_id, key.second), empty_value_t());\n } else {\n connections_map.delete_key(\n std::make_pair(metadata->server_id, key.second));\n }\n }\n });\n}\n\n\n<|endoftext|>"} {"text":"<commit_before>#include \"Entity.h\"\n\nEntity::Entity()\n{\n}\n\nEntity::~Entity()\n{\n}<commit_msg>Added missing getComponents function.<commit_after>#include \"Entity.h\"\n\nEntity::Entity()\n{\n}\n\nEntity::~Entity()\n{\n}\n\nconst std::map<size_t, Component*>& Entity::getComponents() const\n{\n return components;\n}<|endoftext|>"} {"text":"<commit_before>#include <cstdio>\n#include <cstdlib>\n#include <cassert>\n#include <fcntl.h>\n#include <vector>\n#include <iostream>\n\n#include \"..\/src\/sha1.h\"\n\nint run_tests() {\n int ret = 0;\n\n\t\/\/ these example text blocks are taken from RFC3174\n std::vector<std::pair<const char*, const char*> > tests;\n tests.push_back(std::pair<const char*, const char*>(\"abc\",\"a9993e364706816aba3e25717850c26c9cd0d89d\"));\n tests.push_back(std::pair<const char*, const char*>(\"abcdbcdecdefdefgefghfghighijhijkijkljklmklmnlmnomnopnopq\",\"84983e441c3bd26ebaae4aa1f95129e5e54670f1\"));\n tests.push_back(std::pair<const char*, const char*>(\"a\",\"34aa973cd4c4daa4f61eeb2bdbad27316534016f\"));\n tests.push_back(std::pair<const char*, const char*>(\"0123456701234567012345670123456701234567012345670123456701234567\",\"dea356a2cddd90c7a7ecedc5ebb563934f460452\"));\n\n tests.push_back(std::pair<const char*, const char*>(\"aaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa\", \"0ea59bfe8787939816796610c73deb1c625e03ed\"));\n\n std::vector<unsigned int> multiplier;\n multiplier.push_back(1);\n multiplier.push_back(1);\n multiplier.push_back(1000000);\n multiplier.push_back(10);\n multiplier.push_back(8388608);\n\n\n int passed = 0;\n int passed_h = 0;\n int passed_c = 0;\n\n unsigned char sig[SHA1_SIZE], sig2[SHA1_SIZE];\n char str[SHA1_STRING_SIZE];\n\n \/* run our tests *\/\n for (unsigned int i = 0; i < tests.size(); i++) {\n bool passed_hash = 0;\n bool passed_convert = 0;\n\n sha1::sha1_t sha1;\n\n for (unsigned int j = 0; j < multiplier[i]; j++) {\n sha1.process(tests[i].first, strlen(tests[i].first));\n }\n\n sha1.finish(sig);\n\n \/* convert from the sig to a string rep *\/\n sha1::sig_to_string(sig, str, sizeof(str));\n if (strcmp(str, tests[i].second) == 0) {\n passed_hash = true;\n passed_h++;\n }\n\n \/* convert from the string back into a MD5 signature *\/\n sha1::sig_from_string(sig2, str);\n if (memcmp(sig, sig2, SHA1_SIZE) == 0) {\n passed_convert = true;\n passed_c++;\n }\n\n if (passed_hash and passed_convert) {\n std::cout << \"TEST \" << i + 1 << \" PASSED\" << std::endl;\n passed++;\n } else {\n std::cout << \"TEST \" << i + 1 << \" FAILED\" << std::endl;\n std::cout << \"Hash: \" << str << std::endl;\n }\n }\n\n std::cout << std::endl << \"*******************************\" << std::endl\n << \" \" << passed << \" of \" << tests.size() << \" tests passed\" << std::endl;\n if (passed != tests.size()) {\n ret = 1;\n std::cout << std::endl << \" Please notify developer\" << std::endl;\n std::cout << \" \" << passed_h << \" passed hashing check\" << std::endl\n << \" \" << passed_h << \" passed comparison check\" << std::endl;\n }\n std::cout << \"*******************************\" << std::endl;\n\n\treturn ret;\n}\n\nint read_input(int argc, char** argv) {\n sha1::sha1_t sha1;\n unsigned char* digest;\n const unsigned int buffer_size = 8192;\n\n assert( argv[1] );\n\n if (argv[1][0] == '-') {\n\n }\n\n \/* open the file *\/\n int fd = open( argv[1], O_RDONLY | O_BINARY, 0 );\n \/* handle open failure *\/\n if( fd == -1 ) {\n fprintf( stderr, \"cannot open file %s\\n\", argv[1] );\n return 1;\n }\n\n \/* prepare to calculate the SHA-1 hash *\/\n char* buffer = (char*)malloc( buffer_size );\n assert( buffer );\n\n \/* loop through the file *\/\n int ret;\n while( true ) {\n \/* read a chunk of data *\/\n ret = read( fd, buffer, buffer_size );\n \/* check for error and end of file *\/\n if( ret < 1 ) break;\n \/* run this data through the hash function *\/\n sha1.process(buffer, ret);\n }\n\n \/* close the file *\/\n close( fd );\n\n \/* there was an error reading the file *\/\n if( ret == -1 ) {\n fprintf( stderr, \"error reading %s.\\n\", argv[1] );\n return 1;\n }\n\n \/* get the digest *\/\n sha1.finish(digest);\n assert( digest );\n \/* print it out *\/\n printf( \"%s:\", argv[1] );\n printf( \"\\n\" );\n fflush( stdout );\n free( digest );\n return 0;\n}\n\nint main(int argc, char* argv[])\n{\n\tif( argc == 2 ) {\n return read_input(argc, argv);\n\t} else {\n return run_tests();\n\t}\n}\n\n<commit_msg>fixes function call for less arguments<commit_after>#include <cstdio>\n#include <cstdlib>\n#include <cassert>\n#include <fcntl.h>\n#include <vector>\n#include <iostream>\n\n#include \"..\/src\/sha1.h\"\n\nint run_tests() {\n int ret = 0;\n\n\t\/\/ these example text blocks are taken from RFC3174\n std::vector<std::pair<const char*, const char*> > tests;\n tests.push_back(std::pair<const char*, const char*>(\"abc\",\"a9993e364706816aba3e25717850c26c9cd0d89d\"));\n tests.push_back(std::pair<const char*, const char*>(\"abcdbcdecdefdefgefghfghighijhijkijkljklmklmnlmnomnopnopq\",\"84983e441c3bd26ebaae4aa1f95129e5e54670f1\"));\n tests.push_back(std::pair<const char*, const char*>(\"a\",\"34aa973cd4c4daa4f61eeb2bdbad27316534016f\"));\n tests.push_back(std::pair<const char*, const char*>(\"0123456701234567012345670123456701234567012345670123456701234567\",\"dea356a2cddd90c7a7ecedc5ebb563934f460452\"));\n\n tests.push_back(std::pair<const char*, const char*>(\"aaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa\", \"0ea59bfe8787939816796610c73deb1c625e03ed\"));\n\n std::vector<unsigned int> multiplier;\n multiplier.push_back(1);\n multiplier.push_back(1);\n multiplier.push_back(1000000);\n multiplier.push_back(10);\n multiplier.push_back(8388608);\n\n\n int passed = 0;\n int passed_h = 0;\n int passed_c = 0;\n\n unsigned char sig[SHA1_SIZE], sig2[SHA1_SIZE];\n char str[SHA1_STRING_SIZE];\n\n \/* run our tests *\/\n for (unsigned int i = 0; i < tests.size(); i++) {\n bool passed_hash = 0;\n bool passed_convert = 0;\n\n sha1::sha1_t sha1;\n\n for (unsigned int j = 0; j < multiplier[i]; j++) {\n sha1.process(tests[i].first, strlen(tests[i].first));\n }\n\n sha1.finish(sig);\n\n \/* convert from the sig to a string rep *\/\n sha1::sig_to_string(sig, str);\n if (strcmp(str, tests[i].second) == 0) {\n passed_hash = true;\n passed_h++;\n }\n\n \/* convert from the string back into a MD5 signature *\/\n sha1::sig_from_string(sig2, str);\n if (memcmp(sig, sig2, SHA1_SIZE) == 0) {\n passed_convert = true;\n passed_c++;\n }\n\n if (passed_hash and passed_convert) {\n std::cout << \"TEST \" << i + 1 << \" PASSED\" << std::endl;\n passed++;\n } else {\n std::cout << \"TEST \" << i + 1 << \" FAILED\" << std::endl;\n std::cout << \"Hash: \" << str << std::endl;\n }\n }\n\n std::cout << std::endl << \"*******************************\" << std::endl\n << \" \" << passed << \" of \" << tests.size() << \" tests passed\" << std::endl;\n if (passed != tests.size()) {\n ret = 1;\n std::cout << std::endl << \" Please notify developer\" << std::endl;\n std::cout << \" \" << passed_h << \" passed hashing check\" << std::endl\n << \" \" << passed_h << \" passed comparison check\" << std::endl;\n }\n std::cout << \"*******************************\" << std::endl;\n\n\treturn ret;\n}\n\nint read_input(int argc, char** argv) {\n sha1::sha1_t sha1;\n unsigned char* digest;\n const unsigned int buffer_size = 8192;\n\n assert( argv[1] );\n\n if (argv[1][0] == '-') {\n\n }\n\n \/* open the file *\/\n int fd = open( argv[1], O_RDONLY | O_BINARY, 0 );\n \/* handle open failure *\/\n if( fd == -1 ) {\n fprintf( stderr, \"cannot open file %s\\n\", argv[1] );\n return 1;\n }\n\n \/* prepare to calculate the SHA-1 hash *\/\n char* buffer = (char*)malloc( buffer_size );\n assert( buffer );\n\n \/* loop through the file *\/\n int ret;\n while( true ) {\n \/* read a chunk of data *\/\n ret = read( fd, buffer, buffer_size );\n \/* check for error and end of file *\/\n if( ret < 1 ) break;\n \/* run this data through the hash function *\/\n sha1.process(buffer, ret);\n }\n\n \/* close the file *\/\n close( fd );\n\n \/* there was an error reading the file *\/\n if( ret == -1 ) {\n fprintf( stderr, \"error reading %s.\\n\", argv[1] );\n return 1;\n }\n\n \/* get the digest *\/\n sha1.finish(digest);\n assert( digest );\n \/* print it out *\/\n printf( \"%s:\", argv[1] );\n printf( \"\\n\" );\n fflush( stdout );\n free( digest );\n return 0;\n}\n\nint main(int argc, char* argv[])\n{\n\tif( argc == 2 ) {\n return read_input(argc, argv);\n\t} else {\n return run_tests();\n\t}\n}\n\n<|endoftext|>"} {"text":"<commit_before>#include \"Halide.h\"\n\nusing namespace Halide;\n\n#include <image_io.h>\n\n#include <iostream>\n#include <limits>\n\n#include <sys\/time.h>\n\nusing std::vector;\n\ndouble now() {\n struct timeval tv;\n gettimeofday(&tv, NULL);\n static bool first_call = true;\n static time_t first_sec = 0;\n if (first_call) {\n first_call = false;\n first_sec = tv.tv_sec;\n }\n assert(tv.tv_sec >= first_sec);\n return (tv.tv_sec - first_sec) + (tv.tv_usec \/ 1000000.0);\n}\n\nint main(int argc, char **argv) {\n if (argc < 3) {\n std::cerr << \"Usage:\\n\\t.\/interpolate in.png out.png\\n\" << std::endl;\n return 1;\n }\n\n ImageParam input(Float(32), 3);\n\n const unsigned int levels = 10;\n\n Func downsampled[levels];\n Func downx[levels];\n Func interpolated[levels];\n Func upsampled[levels];\n Func upsampledx[levels];\n Var x(\"x\"), y(\"y\"), c(\"c\");\n\n Func clamped;\n clamped(x, y, c) = input(clamp(x, 0, input.width()-1), clamp(y, 0, input.height()-1), c);\n\n downsampled[0](x, y, c) = select(c < 3, clamped(x, y, c) * clamped(x, y, 3), clamped(x, y, 3));\n\n for (unsigned int l = 1; l < levels; ++l) {\n downx[l](x, y, c) = (downsampled[l-1](x*2-1, y, c) + \n 2.0f * downsampled[l-1](x*2, y, c) + \n downsampled[l-1](x*2+1, y, c)) * 0.25f;\n downsampled[l](x, y, c) = (downx[l](x, y*2-1, c) + \n 2.0f * downx[l](x, y*2, c) + \n downx[l](x, y*2+1, c)) * 0.25f;\n }\n interpolated[levels-1](x, y, c) = downsampled[levels-1](x, y, c);\n for (unsigned int l = levels-2; l < levels; --l) {\n upsampledx[l](x, y, c) = select((x % 2) == 0, \n interpolated[l+1](x\/2, y, c), \n 0.5f * (interpolated[l+1](x\/2, y, c) + \n interpolated[l+1](x\/2+1, y, c)));\n upsampled[l](x, y, c) = select((y % 2) == 0,\n upsampledx[l](x, y\/2, c), \n 0.5f * (upsampledx[l](x, y\/2, c) + \n upsampledx[l](x, y\/2+1, c)));\n interpolated[l](x, y, c) = downsampled[l](x, y, c) + (1.0f - downsampled[l](x, y, 3)) * upsampled[l](x, y, c);\n }\n\n Func normalize(\"normalize\");\n normalize(x, y, c) = interpolated[0](x, y, c) \/ interpolated[0](x, y, 3);\n\n Func final(\"final\");\n final(x, y, c) = normalize(x, y, c);\n\t\n std::cout << \"Finished function setup.\" << std::endl;\n\n int sched;\n char *target = getenv(\"HL_TARGET\");\n if (target && std::string(target) == \"ptx\") {\n sched = 4;\n } else {\n sched = 2;\n }\n\n switch (sched) {\n case 0:\n {\n std::cout << \"Flat schedule.\" << std::endl;\n for (unsigned int l = 0; l < levels; ++l) {\n downsampled[l].compute_root();\n interpolated[l].compute_root();\n }\n final.compute_root();\n break;\n }\n case 1:\n {\n std::cout << \"Flat schedule with vectorization.\" << std::endl;\n for (unsigned int l = 0; l < levels; ++l) {\n downsampled[l].compute_root().vectorize(x,4);\n interpolated[l].compute_root().vectorize(x,4);\n }\n final.compute_root();\n break;\n }\n case 2:\n {\n Var xi, yi;\n std::cout << \"Flat schedule with parallelization + vectorization.\" << std::endl; \n clamped.compute_root().parallel(y).bound(c, 0, 4).reorder(c, x, y).reorder_storage(c, x, y).vectorize(c, 4);\n for (unsigned int l = 1; l < levels-1; ++l) {\n if (l > 0) downsampled[l].compute_root().parallel(y).reorder(c, x, y).reorder_storage(c, x, y).vectorize(c, 4);\n interpolated[l].compute_root().parallel(y).reorder(c, x, y).reorder_storage(c, x, y).vectorize(c, 4);\n interpolated[l].unroll(x, 2).unroll(y, 2);\n }\n final.reorder(c, x, y).bound(c, 0, 3).parallel(y);\n final.tile(x, y, xi, yi, 2, 2).unroll(xi).unroll(yi);\n final.bound(x, 0, input.width()); \n final.bound(y, 0, input.height()); \n break;\n }\n case 3:\n {\n std::cout << \"Flat schedule with vectorization sometimes.\" << std::endl;\n for (unsigned int l = 0; l < levels; ++l) {\n if (l + 4 < levels) {\n Var yo,yi;\n downsampled[l].compute_root().vectorize(x,4);\n interpolated[l].compute_root().vectorize(x,4);\n } else {\n downsampled[l].compute_root();\n interpolated[l].compute_root();\n }\n }\n final.compute_root();\n break;\n } \n case 4:\n {\n std::cout << \"GPU schedule.\" << std::endl;\n\n \/\/ Some gpus don't have enough memory to process the entire\n \/\/ image, so we process the image in tiles.\n Var yo, yi, xo, xi;\n final.reorder(c, x, y).bound(c, 0, 3).vectorize(x, 4);\n final.tile(x, y, xo, yo, xi, yi, input.width()\/4, input.height()\/4);\n normalize.compute_at(final, xo).reorder(c, x, y).cuda_tile(x, y, 16, 16).unroll(c);\n\n \/\/ Start from level 1 to save memory - level zero will be computed on demand\n for (unsigned int l = 1; l < levels; ++l) {\n int tile_size = 32 >> l;\n if (tile_size < 1) tile_size = 1;\n if (tile_size > 16) tile_size = 16;\n downsampled[l].compute_root().cuda_tile(x, y, c, tile_size, tile_size, 4);\n interpolated[l].compute_at(final, xo).cuda_tile(x, y, c, tile_size, tile_size, 4);\n }\n\n break;\n }\n default:\n assert(0 && \"No schedule with this number.\");\n }\n\n \/\/ JIT compile the pipeline eagerly, so we don't interfere with timing\n final.compile_jit();\n\n Image<float> in_png = load<float>(argv[1]);\n Image<float> out(in_png.width(), in_png.height(), 3);\n assert(in_png.channels() == 4);\n input.set(in_png);\n\n std::cout << \"Running... \" << std::endl;\n double min = std::numeric_limits<double>::infinity();\n const unsigned int iters = 20;\n\n for (unsigned int x = 0; x < iters; ++x) { \n double before = now();\n final.realize(out);\n double after = now();\n double amt = after - before;\n\n std::cout << \" \" << amt * 1000 << std::endl;\n if (amt < min) min = amt;\n \n }\n std::cout << \" took \" << min * 1000 << \" msec.\" << std::endl;\n\n vector<Argument> args;\n args.push_back(input);\n final.compile_to_assembly(\"test.s\", args);\n\n save(out, argv[2]);\n\n}\n<commit_msg>Workaround for a bug in llvm 3.3<commit_after>#include \"Halide.h\"\n\nusing namespace Halide;\n\n#include <image_io.h>\n\n#include <iostream>\n#include <limits>\n\n#include <sys\/time.h>\n\nusing std::vector;\n\ndouble now() {\n struct timeval tv;\n gettimeofday(&tv, NULL);\n static bool first_call = true;\n static time_t first_sec = 0;\n if (first_call) {\n first_call = false;\n first_sec = tv.tv_sec;\n }\n assert(tv.tv_sec >= first_sec);\n return (tv.tv_sec - first_sec) + (tv.tv_usec \/ 1000000.0);\n}\n\nint main(int argc, char **argv) {\n if (argc < 3) {\n std::cerr << \"Usage:\\n\\t.\/interpolate in.png out.png\\n\" << std::endl;\n return 1;\n }\n\n ImageParam input(Float(32), 3);\n\n const unsigned int levels = 10;\n\n Func downsampled[levels];\n Func downx[levels];\n Func interpolated[levels];\n Func upsampled[levels];\n Func upsampledx[levels];\n Var x(\"x\"), y(\"y\"), c(\"c\");\n\n Func clamped;\n clamped(x, y, c) = input(clamp(x, 0, input.width()-1), clamp(y, 0, input.height()-1), c);\n\n \/\/ This triggers a bug in llvm 3.3 (3.2 and trunk are fine), so we\n \/\/ rewrite it in a way that doesn't trigger the bug. The rewritten\n \/\/ form assumes the input alpha is zero or one.\n \/\/ downsampled[0](x, y, c) = select(c < 3, clamped(x, y, c) * clamped(x, y, 3), clamped(x, y, 3));\n downsampled[0](x, y, c) = clamped(x, y, c) * clamped(x, y, 3);\n\n for (unsigned int l = 1; l < levels; ++l) {\n downx[l](x, y, c) = (downsampled[l-1](x*2-1, y, c) +\n 2.0f * downsampled[l-1](x*2, y, c) +\n downsampled[l-1](x*2+1, y, c)) * 0.25f;\n downsampled[l](x, y, c) = (downx[l](x, y*2-1, c) +\n 2.0f * downx[l](x, y*2, c) +\n downx[l](x, y*2+1, c)) * 0.25f;\n }\n interpolated[levels-1](x, y, c) = downsampled[levels-1](x, y, c);\n for (unsigned int l = levels-2; l < levels; --l) {\n upsampledx[l](x, y, c) = select((x % 2) == 0,\n interpolated[l+1](x\/2, y, c),\n 0.5f * (interpolated[l+1](x\/2, y, c) +\n interpolated[l+1](x\/2+1, y, c)));\n upsampled[l](x, y, c) = select((y % 2) == 0,\n upsampledx[l](x, y\/2, c),\n 0.5f * (upsampledx[l](x, y\/2, c) +\n upsampledx[l](x, y\/2+1, c)));\n interpolated[l](x, y, c) = downsampled[l](x, y, c) + (1.0f - downsampled[l](x, y, 3)) * upsampled[l](x, y, c);\n }\n\n Func normalize(\"normalize\");\n normalize(x, y, c) = interpolated[0](x, y, c) \/ interpolated[0](x, y, 3);\n\n Func final(\"final\");\n final(x, y, c) = normalize(x, y, c);\n\n std::cout << \"Finished function setup.\" << std::endl;\n\n int sched;\n char *target = getenv(\"HL_TARGET\");\n if (target && std::string(target) == \"ptx\") {\n sched = 4;\n } else {\n sched = 2;\n }\n\n switch (sched) {\n case 0:\n {\n std::cout << \"Flat schedule.\" << std::endl;\n for (unsigned int l = 0; l < levels; ++l) {\n downsampled[l].compute_root();\n interpolated[l].compute_root();\n }\n final.compute_root();\n break;\n }\n case 1:\n {\n std::cout << \"Flat schedule with vectorization.\" << std::endl;\n for (unsigned int l = 0; l < levels; ++l) {\n downsampled[l].compute_root().vectorize(x,4);\n interpolated[l].compute_root().vectorize(x,4);\n }\n final.compute_root();\n break;\n }\n case 2:\n {\n Var xi, yi;\n std::cout << \"Flat schedule with parallelization + vectorization.\" << std::endl;\n clamped.compute_root().parallel(y).bound(c, 0, 4).reorder(c, x, y).reorder_storage(c, x, y).vectorize(c, 4);\n for (unsigned int l = 1; l < levels-1; ++l) {\n if (l > 0) downsampled[l].compute_root().parallel(y).reorder(c, x, y).reorder_storage(c, x, y).vectorize(c, 4);\n interpolated[l].compute_root().parallel(y).reorder(c, x, y).reorder_storage(c, x, y).vectorize(c, 4);\n interpolated[l].unroll(x, 2).unroll(y, 2);\n }\n final.reorder(c, x, y).bound(c, 0, 3).parallel(y);\n final.tile(x, y, xi, yi, 2, 2).unroll(xi).unroll(yi);\n final.bound(x, 0, input.width());\n final.bound(y, 0, input.height());\n break;\n }\n case 3:\n {\n std::cout << \"Flat schedule with vectorization sometimes.\" << std::endl;\n for (unsigned int l = 0; l < levels; ++l) {\n if (l + 4 < levels) {\n Var yo,yi;\n downsampled[l].compute_root().vectorize(x,4);\n interpolated[l].compute_root().vectorize(x,4);\n } else {\n downsampled[l].compute_root();\n interpolated[l].compute_root();\n }\n }\n final.compute_root();\n break;\n }\n case 4:\n {\n std::cout << \"GPU schedule.\" << std::endl;\n\n \/\/ Some gpus don't have enough memory to process the entire\n \/\/ image, so we process the image in tiles.\n Var yo, yi, xo, xi;\n final.reorder(c, x, y).bound(c, 0, 3).vectorize(x, 4);\n final.tile(x, y, xo, yo, xi, yi, input.width()\/4, input.height()\/4);\n normalize.compute_at(final, xo).reorder(c, x, y).cuda_tile(x, y, 16, 16).unroll(c);\n\n \/\/ Start from level 1 to save memory - level zero will be computed on demand\n for (unsigned int l = 1; l < levels; ++l) {\n int tile_size = 32 >> l;\n if (tile_size < 1) tile_size = 1;\n if (tile_size > 16) tile_size = 16;\n downsampled[l].compute_root().cuda_tile(x, y, c, tile_size, tile_size, 4);\n interpolated[l].compute_at(final, xo).cuda_tile(x, y, c, tile_size, tile_size, 4);\n }\n\n break;\n }\n default:\n assert(0 && \"No schedule with this number.\");\n }\n\n \/\/ JIT compile the pipeline eagerly, so we don't interfere with timing\n final.compile_jit();\n\n Image<float> in_png = load<float>(argv[1]);\n Image<float> out(in_png.width(), in_png.height(), 3);\n assert(in_png.channels() == 4);\n input.set(in_png);\n\n std::cout << \"Running... \" << std::endl;\n double min = std::numeric_limits<double>::infinity();\n const unsigned int iters = 20;\n\n for (unsigned int x = 0; x < iters; ++x) {\n double before = now();\n final.realize(out);\n double after = now();\n double amt = after - before;\n\n std::cout << \" \" << amt * 1000 << std::endl;\n if (amt < min) min = amt;\n\n }\n std::cout << \" took \" << min * 1000 << \" msec.\" << std::endl;\n\n vector<Argument> args;\n args.push_back(input);\n final.compile_to_assembly(\"test.s\", args);\n\n save(out, argv[2]);\n\n}\n<|endoftext|>"} {"text":"<commit_before>\/* This file is part of the KDE project\n Copyright (C) 2006-2007 Matthias Kretz <kretz@kde.org>\n\n This library is free software; you can redistribute it and\/or\n modify it under the terms of the GNU Library General Public\n License version 2 as published by the Free Software Foundation.\n\n This library is distributed in the hope that it will be useful,\n but WITHOUT ANY WARRANTY; without even the implied warranty of\n MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU\n Library General Public License for more details.\n\n You should have received a copy of the GNU Library General Public License\n along with this library; see the file COPYING.LIB. If not, write to\n the Free Software Foundation, Inc., 51 Franklin Street, Fifth Floor,\n Boston, MA 02110-1301, USA.\n\n*\/\n\n#include \"objectdescription.h\"\n#include \"objectdescription_p.h\"\n\n#include <QtCore\/QObject>\n#include <QtCore\/QSet>\n#include \"factory.h\"\n#include <QtCore\/QStringList>\n#include \"backendinterface.h\"\n\nnamespace Phonon\n{\n\nObjectDescriptionData::ObjectDescriptionData(ObjectDescriptionPrivate *dd)\n : d(dd)\n{\n}\n\nObjectDescriptionData::~ObjectDescriptionData()\n{\n delete d;\n}\n\nbool ObjectDescriptionData::operator==(const ObjectDescriptionData &otherDescription) const\n{\n if (!isValid()) {\n return !otherDescription.isValid();\n }\n if (!otherDescription.isValid()) {\n return false;\n }\n return *d == *otherDescription.d;\n}\n\nint ObjectDescriptionData::index() const\n{\n if (!isValid()) {\n return -1;\n }\n return d->index;\n}\n\nQString ObjectDescriptionData::name() const\n{\n if (!isValid()) {\n return QString();\n }\n return d->name;\n}\n\nQString ObjectDescriptionData::description() const\n{\n if (!isValid()) {\n return QString();\n }\n return d->description;\n}\n\nQVariant ObjectDescriptionData::property(const char *name) const\n{\n if (!isValid()) {\n return QVariant();\n }\n return d->properties.value(name);\n}\n\nQList<QByteArray> ObjectDescriptionData::propertyNames() const\n{\n if (!isValid()) {\n return QList<QByteArray>();\n }\n return d->properties.keys();\n}\n\nbool ObjectDescriptionData::isValid() const\n{\n return d != 0;\n}\n\nObjectDescriptionData *ObjectDescriptionData::fromIndex(ObjectDescriptionType type, int index)\n{\n QObject *b = Factory::backend();\n BackendInterface *iface = qobject_cast<BackendInterface *>(b);\n QSet<int> indexes = iface->objectDescriptionIndexes(type);\n if (indexes.contains(index)) {\n QHash<QByteArray, QVariant> properties = iface->objectDescriptionProperties(type, index);\n return new ObjectDescriptionData(new ObjectDescriptionPrivate(index, properties));\n }\n return new ObjectDescriptionData(0); \/\/ invalid\n}\n\n} \/\/namespace Phonon\n\/\/ vim: sw=4 ts=4\n<commit_msg>don't crash in fromIndex if no backend is available - thanks to PutHuhn<commit_after>\/* This file is part of the KDE project\n Copyright (C) 2006-2007 Matthias Kretz <kretz@kde.org>\n\n This library is free software; you can redistribute it and\/or\n modify it under the terms of the GNU Library General Public\n License version 2 as published by the Free Software Foundation.\n\n This library is distributed in the hope that it will be useful,\n but WITHOUT ANY WARRANTY; without even the implied warranty of\n MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU\n Library General Public License for more details.\n\n You should have received a copy of the GNU Library General Public License\n along with this library; see the file COPYING.LIB. If not, write to\n the Free Software Foundation, Inc., 51 Franklin Street, Fifth Floor,\n Boston, MA 02110-1301, USA.\n\n*\/\n\n#include \"objectdescription.h\"\n#include \"objectdescription_p.h\"\n\n#include <QtCore\/QObject>\n#include <QtCore\/QSet>\n#include \"factory.h\"\n#include <QtCore\/QStringList>\n#include \"backendinterface.h\"\n\nnamespace Phonon\n{\n\nObjectDescriptionData::ObjectDescriptionData(ObjectDescriptionPrivate *dd)\n : d(dd)\n{\n}\n\nObjectDescriptionData::~ObjectDescriptionData()\n{\n delete d;\n}\n\nbool ObjectDescriptionData::operator==(const ObjectDescriptionData &otherDescription) const\n{\n if (!isValid()) {\n return !otherDescription.isValid();\n }\n if (!otherDescription.isValid()) {\n return false;\n }\n return *d == *otherDescription.d;\n}\n\nint ObjectDescriptionData::index() const\n{\n if (!isValid()) {\n return -1;\n }\n return d->index;\n}\n\nQString ObjectDescriptionData::name() const\n{\n if (!isValid()) {\n return QString();\n }\n return d->name;\n}\n\nQString ObjectDescriptionData::description() const\n{\n if (!isValid()) {\n return QString();\n }\n return d->description;\n}\n\nQVariant ObjectDescriptionData::property(const char *name) const\n{\n if (!isValid()) {\n return QVariant();\n }\n return d->properties.value(name);\n}\n\nQList<QByteArray> ObjectDescriptionData::propertyNames() const\n{\n if (!isValid()) {\n return QList<QByteArray>();\n }\n return d->properties.keys();\n}\n\nbool ObjectDescriptionData::isValid() const\n{\n return d != 0;\n}\n\nObjectDescriptionData *ObjectDescriptionData::fromIndex(ObjectDescriptionType type, int index)\n{\n QObject *b = Factory::backend();\n BackendInterface *iface = qobject_cast<BackendInterface *>(b);\n if (iface) {\n QSet<int> indexes = iface->objectDescriptionIndexes(type);\n if (indexes.contains(index)) {\n QHash<QByteArray, QVariant> properties = iface->objectDescriptionProperties(type, index);\n return new ObjectDescriptionData(new ObjectDescriptionPrivate(index, properties));\n }\n }\n return new ObjectDescriptionData(0); \/\/ invalid\n}\n\n} \/\/namespace Phonon\n\/\/ vim: sw=4 ts=4\n<|endoftext|>"} {"text":"<commit_before>\/*\n * PartialCsvParser.hpp\n *\n * Created on: 2014\/12\/28\n * Author: nakatani.sho\n *\/\n\n#ifndef INCLUDE_PARTIALCSVPARSER_HPP_\n#define INCLUDE_PARTIALCSVPARSER_HPP_\n\n#include <vector>\n#include <string>\n#include <cstdio>\n#include <cstdlib>\n#include <fcntl.h>\n#include <sys\/stat.h>\n#include <sys\/mman.h>\n\n\/\/ Prevent default class methods\n#define PREVENT_DEFAULT_CONSTRUCTOR(klass) \\\n private: klass();\n#define PREVENT_COPY_CONSTRUCTOR(klass) \\\n private: klass(const klass&);\n#define PREVENT_OBJECT_ASSIGNMENT(klass) \\\n private: klass& operator=(const klass&);\n#define PREVENT_CLASS_DEFAULT_METHODS(klass) \\\n PREVENT_DEFAULT_CONSTRUCTOR(klass); \\\n PREVENT_COPY_CONSTRUCTOR(klass); \\\n PREVENT_OBJECT_ASSIGNMENT(klass); \\\n\n\n\/\/ Assertion also usable with Google Test\n#ifdef PCP_GTEST\n#include <stdexcept>\n#include <string>\n\nclass PCPAssertionFailed : public std::runtime_error {\npublic:\n PCPAssertionFailed(const std::string &cause)\n : std::runtime_error(cause)\n {}\n};\n\n#define ASSERT(cond) \\\n if (!(cond)) \\\n throw PCPAssertionFailed( \\\n std::string(__FILE__) + \":\" + std::to_string(__LINE__) + \" PCPAssertionFailed: \" + #cond);\n\n#else \/* PCP_GTEST *\/\n#include <cassert>\n\n#define ASSERT(cond) \\\n std::assert(cond);\n\n#endif \/* PCP_GTEST *\/\n\n\n\/\/ Macros for error cases\n#define PERROR_ABORT(msg) \\\n { \\\n std::perror((std::string(\"Fatal from PartialCsvParser \") + std::string(msg)).c_str()); \\\n std::abort(); \\\n }\n\nnamespace PCP {\n\n\/\/ Utility functions\ninline size_t _filesize(int opened_fd) {\n struct stat st;\n if (fstat(opened_fd, &st) != 0) PERROR_ABORT(\"while getting stat(2) of file\");\n return st.st_size;\n}\n\n\/**\n * Find a line including specified current_pos.\n * @param text Original text to find a line from.\n * @param text_length_byte Byte length of the original text.\n * @param current_pos Current position taking 0 ~ (text_length - 1).\n * @param line Pointer of start of the current line will be output.\n * @param line_length_byte Byte length of current line (not including line terminator) will be output.\n *\n @verbatim\n \\n aaaaaaaaaaa \\n bbbbbbbbbbbbb \\n cccccccccc \\n\n ^ ^ ^\n (1) (2)(3)\n @endverbatim\n *\n * If current_pos is at between (1) and (2), line will point at (1).\n * If current_pos is at (3), line will also point at (1).\n *\n @verbatim\n \\n ddddddddd \\n eeeeeeeeeee \\0\n ^ ^\n (1) (2)\n @endverbatim\n *\n * Consider null character.\n * If current_pos is at between (1) and (2), line will point at (1).\n *\/\nvoid _get_current_line(\n const char * const text,\n size_t text_length_byte,\n size_t current_pos,\n \/* out *\/\n const char ** line,\n size_t * line_length_byte,\n \/* optional *\/\n char line_terminator = '\\n')\n{\n ASSERT(text);\n ASSERT(text_length_byte >= 1);\n ASSERT(0 <= current_pos && current_pos <= text_length_byte - 1);\n\n \/\/ \\n aaaaaaaaaaaa \\n\n \/\/ ^ ^\n \/\/ start end\n const char *line_start = text + current_pos, *line_end = text + current_pos;\n\n \/\/ search line_start\n while (line_start > text && *(line_start - 1) != line_terminator) --line_start;\n \/\/ search line_end\n while (line_end < text + text_length_byte && *line_end != line_terminator) ++line_end;\n\n *line = line_start;\n *line_length_byte = line_end - line_start;\n}\n\nclass PartialCsvParser;\n\nclass CsvConfig {\npublic:\n CsvConfig(\n const char * const filepath,\n bool has_header_line = true,\n char field_terminator = ',',\n char line_terminator = '\\n',\n char enclosure_char = '\"')\n : filepath(filepath), has_header_line(has_header_line),\n field_terminator(field_terminator), line_terminator(line_terminator),\n enclosure_char(enclosure_char)\n {\n if ((fd = open(filepath, O_RDONLY | O_SHLOCK)) == -1)\n PERROR_ABORT((std::string(\"while opening \") + filepath).c_str()); \/\/ TODO 例外を投げる\n csv_size = _filesize(fd);\n csv_text = static_cast<const char *>(mmap(NULL, csv_size, PROT_READ, MAP_PRIVATE, fd, 0));\n\n std::printf(\"size=%d\\n\\n%s\\n\", csv_size, csv_text);\n \/\/ reads header\n }\n\n ~CsvConfig() {\n if (munmap((void*)csv_text, csv_size) != 0) PERROR_ABORT(\"while munmap\");\n if (close(fd) != 0) PERROR_ABORT(\"while closing file descriptor\");\n }\n\n size_t filesize() const { return csv_size; }\n\n size_t body_offset() const;\n\n std::vector<std::string> headers() const {\n std::vector<std::string> header; \/\/ NRVO optimization may prevent copy when returning this local variable.\n return header;\n }\n\n PartialCsvParser & generate_partial_parser(size_t read_from, size_t read_to) {\n }\n\nprivate:\n const char * const filepath;\n const bool has_header_line;\n const char field_terminator;\n const char line_terminator;\n const char enclosure_char;\n\n int fd;\n size_t csv_size;\n const char * csv_text;\n\n PREVENT_CLASS_DEFAULT_METHODS(CsvConfig);\n};\n\nclass PartialCsvParser {\npublic:\n PartialCsvParser(size_t read_from, size_t read_to) {}\n\n ~PartialCsvParser() {}\n\n std::vector<std::string> get_row() {\n std::vector<std::string> row; \/\/ NRVO optimization may prevent copy when returning this local variable.\n return row;\n }\n\n bool has_more_rows() const {}\n\n PREVENT_CLASS_DEFAULT_METHODS(PartialCsvParser);\n};\n\n}\n\n#endif \/* INCLUDE_PARTIALCSVPARSER_HPP_ *\/\n<commit_msg>stop using C++11 std::to_string<commit_after>\/*\n * PartialCsvParser.hpp\n *\n * Created on: 2014\/12\/28\n * Author: nakatani.sho\n *\/\n\n#ifndef INCLUDE_PARTIALCSVPARSER_HPP_\n#define INCLUDE_PARTIALCSVPARSER_HPP_\n\n#include <vector>\n#include <string>\n#include <cstdio>\n#include <cstdlib>\n#include <fcntl.h>\n#include <sys\/stat.h>\n#include <sys\/mman.h>\n\n\/\/ Prevent default class methods\n#define PREVENT_DEFAULT_CONSTRUCTOR(klass) \\\n private: klass();\n#define PREVENT_COPY_CONSTRUCTOR(klass) \\\n private: klass(const klass&);\n#define PREVENT_OBJECT_ASSIGNMENT(klass) \\\n private: klass& operator=(const klass&);\n#define PREVENT_CLASS_DEFAULT_METHODS(klass) \\\n PREVENT_DEFAULT_CONSTRUCTOR(klass); \\\n PREVENT_COPY_CONSTRUCTOR(klass); \\\n PREVENT_OBJECT_ASSIGNMENT(klass); \\\n\n\n\/\/ Assertion also usable with Google Test\n#ifdef PCP_GTEST\n#include <stdexcept>\n#include <sstream>\n#include <string>\n\nclass PCPAssertionFailed : public std::runtime_error {\npublic:\n PCPAssertionFailed(const std::string &cause)\n : std::runtime_error(cause)\n {}\n};\n\n#define ASSERT(cond) \\\n if (!(cond)) { \\\n std::ostringstream ss; \\\n ss << __FILE__ << \":\" << __LINE__ << \" (in \" << __FUNCTION__ << \"())\" << \" PCPAssertionFailed: \" << #cond; \\\n throw PCPAssertionFailed(ss.str()); \\\n }\n\n#else \/* PCP_GTEST *\/\n#include <cassert>\n\n#define ASSERT(cond) \\\n std::assert(cond);\n\n#endif \/* PCP_GTEST *\/\n\n\n\/\/ Macros for error cases\n#define PERROR_ABORT(msg) \\\n { \\\n std::perror((std::string(\"Fatal from PartialCsvParser \") + std::string(msg)).c_str()); \\\n std::abort(); \\\n }\n\nnamespace PCP {\n\n\/\/ Utility functions\ninline size_t _filesize(int opened_fd) {\n struct stat st;\n if (fstat(opened_fd, &st) != 0) PERROR_ABORT(\"while getting stat(2) of file\");\n return st.st_size;\n}\n\n\/**\n * Find a line including specified current_pos.\n * @param text Original text to find a line from.\n * @param text_length_byte Byte length of the original text.\n * @param current_pos Current position taking 0 ~ (text_length - 1).\n * @param line Pointer of start of the current line will be output.\n * @param line_length_byte Byte length of current line (not including line terminator) will be output.\n *\n @verbatim\n \\n aaaaaaaaaaa \\n bbbbbbbbbbbbb \\n cccccccccc \\n\n ^ ^ ^\n (1) (2)(3)\n @endverbatim\n *\n * If current_pos is at between (1) and (2), line will point at (1).\n * If current_pos is at (3), line will also point at (1).\n *\n @verbatim\n \\n ddddddddd \\n eeeeeeeeeee \\0\n ^ ^\n (1) (2)\n @endverbatim\n *\n * Consider null character.\n * If current_pos is at between (1) and (2), line will point at (1).\n *\/\nvoid _get_current_line(\n const char * const text,\n size_t text_length_byte,\n size_t current_pos,\n \/* out *\/\n const char ** line,\n size_t * line_length_byte,\n \/* optional *\/\n char line_terminator = '\\n')\n{\n ASSERT(text);\n ASSERT(text_length_byte >= 1);\n ASSERT(0 <= current_pos && current_pos <= text_length_byte - 1);\n\n \/\/ \\n aaaaaaaaaaaa \\n\n \/\/ ^ ^\n \/\/ start end\n const char *line_start = text + current_pos, *line_end = text + current_pos;\n\n \/\/ search line_start\n while (line_start > text && *(line_start - 1) != line_terminator) --line_start;\n \/\/ search line_end\n while (line_end < text + text_length_byte && *line_end != line_terminator) ++line_end;\n\n *line = line_start;\n *line_length_byte = line_end - line_start;\n}\n\nclass PartialCsvParser;\n\nclass CsvConfig {\npublic:\n CsvConfig(\n const char * const filepath,\n bool has_header_line = true,\n char field_terminator = ',',\n char line_terminator = '\\n',\n char enclosure_char = '\"')\n : filepath(filepath), has_header_line(has_header_line),\n field_terminator(field_terminator), line_terminator(line_terminator),\n enclosure_char(enclosure_char)\n {\n if ((fd = open(filepath, O_RDONLY | O_SHLOCK)) == -1)\n PERROR_ABORT((std::string(\"while opening \") + filepath).c_str()); \/\/ TODO 例外を投げる\n csv_size = _filesize(fd);\n csv_text = static_cast<const char *>(mmap(NULL, csv_size, PROT_READ, MAP_PRIVATE, fd, 0));\n\n std::printf(\"size=%d\\n\\n%s\\n\", csv_size, csv_text);\n \/\/ reads header\n }\n\n ~CsvConfig() {\n if (munmap((void*)csv_text, csv_size) != 0) PERROR_ABORT(\"while munmap\");\n if (close(fd) != 0) PERROR_ABORT(\"while closing file descriptor\");\n }\n\n size_t filesize() const { return csv_size; }\n\n size_t body_offset() const;\n\n std::vector<std::string> headers() const {\n std::vector<std::string> header; \/\/ NRVO optimization may prevent copy when returning this local variable.\n return header;\n }\n\n PartialCsvParser & generate_partial_parser(size_t read_from, size_t read_to) {\n }\n\nprivate:\n const char * const filepath;\n const bool has_header_line;\n const char field_terminator;\n const char line_terminator;\n const char enclosure_char;\n\n int fd;\n size_t csv_size;\n const char * csv_text;\n\n PREVENT_CLASS_DEFAULT_METHODS(CsvConfig);\n};\n\nclass PartialCsvParser {\npublic:\n PartialCsvParser(size_t read_from, size_t read_to) {}\n\n ~PartialCsvParser() {}\n\n std::vector<std::string> get_row() {\n std::vector<std::string> row; \/\/ NRVO optimization may prevent copy when returning this local variable.\n return row;\n }\n\n bool has_more_rows() const {}\n\n PREVENT_CLASS_DEFAULT_METHODS(PartialCsvParser);\n};\n\n}\n\n#endif \/* INCLUDE_PARTIALCSVPARSER_HPP_ *\/\n<|endoftext|>"} {"text":"<commit_before>#include \"ctextviewerplugin.h\"\r\n#include \"ctextviewerwindow.h\"\r\n#include \"compiler\/compiler_warnings_control.h\"\r\n\r\n#include <QMimeType>\r\n\r\nCFileCommanderPlugin * createPlugin()\r\n{\r\n\tDISABLE_COMPILER_WARNINGS\r\n\tQ_INIT_RESOURCE(icons);\r\n\tRESTORE_COMPILER_WARNINGS\r\n\r\n\treturn new CTextViewerPlugin;\r\n}\r\n\r\nbool CTextViewerPlugin::canViewFile(const QString& \/*fileName*\/, const QMimeType& \/*type*\/) const\r\n{\r\n\treturn true;\r\n}\r\n\r\nCPluginWindow * CTextViewerPlugin::viewFile(const QString& fileName)\r\n{\r\n\tQWidget * mainWindow = nullptr;\r\n\tfor (QWidget* topLevelWidget: QApplication::topLevelWidgets())\r\n\t{\r\n\t\tif (topLevelWidget->inherits(\"QMainWindow\"))\r\n\t\t{\r\n\t\t\tmainWindow = topLevelWidget;\r\n\t\t\tbreak;\r\n\t\t}\r\n\t}\r\n\r\n\tCTextViewerWindow * widget = new CTextViewerWindow(mainWindow); \/\/ Temporary workaround for https:\/\/bugreports.qt.io\/browse\/QTBUG-61213\r\n\tif (widget->loadTextFile(fileName))\r\n\t\treturn widget;\r\n\r\n\tdelete widget;\r\n\treturn nullptr;\r\n}\r\n\r\nQString CTextViewerPlugin::name() const\r\n{\r\n\treturn \"Plain text and HTML viewer plugin\";\r\n}\r\n<commit_msg>Fixed #173 - no longer attempting to invoke a text viewer when F3 is pressed on a folder<commit_after>#include \"ctextviewerplugin.h\"\r\n#include \"ctextviewerwindow.h\"\r\n#include \"compiler\/compiler_warnings_control.h\"\r\n\r\n#include <QMimeType>\r\n\r\nCFileCommanderPlugin * createPlugin()\r\n{\r\n\tDISABLE_COMPILER_WARNINGS\r\n\tQ_INIT_RESOURCE(icons);\r\n\tRESTORE_COMPILER_WARNINGS\r\n\r\n\treturn new CTextViewerPlugin;\r\n}\r\n\r\nbool CTextViewerPlugin::canViewFile(const QString& fileName, const QMimeType& \/*type*\/) const\r\n{\r\n\treturn QFileInfo(fileName).isFile();\r\n}\r\n\r\nCPluginWindow * CTextViewerPlugin::viewFile(const QString& fileName)\r\n{\r\n\tQWidget * mainWindow = nullptr;\r\n\tfor (QWidget* topLevelWidget: QApplication::topLevelWidgets())\r\n\t{\r\n\t\tif (topLevelWidget->inherits(\"QMainWindow\"))\r\n\t\t{\r\n\t\t\tmainWindow = topLevelWidget;\r\n\t\t\tbreak;\r\n\t\t}\r\n\t}\r\n\r\n\tCTextViewerWindow * widget = new CTextViewerWindow(mainWindow); \/\/ Temporary workaround for https:\/\/bugreports.qt.io\/browse\/QTBUG-61213\r\n\tif (widget->loadTextFile(fileName))\r\n\t\treturn widget;\r\n\r\n\tdelete widget;\r\n\treturn nullptr;\r\n}\r\n\r\nQString CTextViewerPlugin::name() const\r\n{\r\n\treturn \"Plain text and HTML viewer plugin\";\r\n}\r\n<|endoftext|>"} {"text":"<commit_before>\/*\n\nCopyright (c) 2003-2014, Arvid Norberg, Daniel Wallin\nAll rights reserved.\n\nRedistribution and use in source and binary forms, with or without\nmodification, are permitted provided that the following conditions\nare met:\n\n * Redistributions of source code must retain the above copyright\n notice, this list of conditions and the following disclaimer.\n * Redistributions in binary form must reproduce the above copyright\n notice, this list of conditions and the following disclaimer in\n the documentation and\/or other materials provided with the distribution.\n * Neither the name of the author nor the names of its\n contributors may be used to endorse or promote products derived\n from this software without specific prior written permission.\n\nTHIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS \"AS IS\"\nAND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE\nIMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE\nARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE\nLIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR\nCONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF\nSUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS\nINTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN\nCONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)\nARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE\nPOSSIBILITY OF SUCH DAMAGE.\n\n*\/\n\n#ifndef TORRENT_ALERT_HPP_INCLUDED\n#define TORRENT_ALERT_HPP_INCLUDED\n\n#include <memory>\n#include <deque>\n#include <string>\n#include <vector>\n\n#ifdef _MSC_VER\n#pragma warning(push, 1)\n#endif\n\n#include <boost\/preprocessor\/repetition\/enum_params_with_a_default.hpp>\n#include <boost\/preprocessor\/repetition\/enum.hpp>\n#include <boost\/preprocessor\/repetition\/enum_params.hpp>\n#include <boost\/preprocessor\/repetition\/enum_shifted_params.hpp>\n#include <boost\/preprocessor\/repetition\/enum_shifted_binary_params.hpp>\n\n\/\/ OVERVIEW\n\/\/\n\/\/ The pop_alerts() function on session is the main interface for retrieving\n\/\/ alerts (warnings, messages and errors from libtorrent). If no alerts have\n\/\/ been posted by libtorrent pop_alert() will return an empty list.\n\/\/ \n\/\/ By default, only errors are reported. set_alert_mask() can be used to\n\/\/ specify which kinds of events should be reported. The alert mask is\n\/\/ comprised by bits from the category_t enum.\n\/\/ \n\/\/ Every alert belongs to one or more category. There is a small cost involved\n\/\/ in posting alerts. Only alerts that belong to an enabled category are\n\/\/ posted. Setting the alert bitmask to 0 will disable all alerts (except those\n\/\/ that are non-discardable).\n\/\/ \n\/\/ There are other alert base classes that some alerts derive from, all the\n\/\/ alerts that are generated for a specific torrent are derived from\n\/\/ torrent_alert, and tracker events derive from tracker_alert.\n\/\/\n\n#ifdef _MSC_VER\n#pragma warning(pop)\n#endif\n\n#include \"libtorrent\/time.hpp\"\n#include \"libtorrent\/config.hpp\"\n\n#ifndef TORRENT_NO_DEPRECATE\n#ifndef BOOST_NO_TYPEID\n#include <typeinfo>\n#endif\n#endif \/\/ TORRENT_NO_DEPRECATE\n\n#ifndef TORRENT_MAX_ALERT_TYPES\n#define TORRENT_MAX_ALERT_TYPES 15\n#endif\n\n#ifndef TORRENT_NO_DEPRECATE\n#ifndef BOOST_NO_TYPEID\n#include <typeinfo>\n#endif\n#endif\n\nnamespace libtorrent {\n\n\t\/\/ The ``alert`` class is the base class that specific messages are derived from.\n\tclass TORRENT_EXPORT alert\n\t{\n\tpublic:\n\n#ifndef TORRENT_NO_DEPRECATE\n\t\t\/\/ only here for backwards compatibility\n\t\tenum severity_t { debug, info, warning, critical, fatal, none };\n#endif\n\n\t\t\/\/ these are bits for the alert_mask used by the session. See set_alert_mask().\n\t\tenum category_t\n\t\t{\n\t\t\t\/\/ Enables alerts that report an error. This includes:\n\t\t\t\/\/ \n\t\t\t\/\/ * tracker errors\n\t\t\t\/\/ * tracker warnings\n\t\t\t\/\/ * file errors\n\t\t\t\/\/ * resume data failures\n\t\t\t\/\/ * web seed errors\n\t\t\t\/\/ * .torrent files errors\n\t\t\t\/\/ * listen socket errors\n\t\t\t\/\/ * port mapping errors\n\t\t\terror_notification = 0x1,\n\n\t\t\t\/\/ Enables alerts when peers send invalid requests, get banned or\n\t\t\t\/\/ snubbed.\n\t\t\tpeer_notification = 0x2,\n\n\t\t\t\/\/ Enables alerts for port mapping events. For NAT-PMP and UPnP.\n\t\t\tport_mapping_notification = 0x4,\n\n\t\t\t\/\/ Enables alerts for events related to the storage. File errors and \n\t\t\t\/\/ synchronization events for moving the storage, renaming files etc. \n\t\t\tstorage_notification = 0x8,\n\n\t\t\t\/\/ Enables all tracker events. Includes announcing to trackers,\n\t\t\t\/\/ receiving responses, warnings and errors.\n\t\t\ttracker_notification = 0x10,\n\n\t\t\t\/\/ Low level alerts for when peers are connected and disconnected.\n\t\t\tdebug_notification = 0x20,\n\n\t\t\t\/\/ Enables alerts for when a torrent or the session changes state.\n\t\t\tstatus_notification = 0x40,\n\n\t\t\t\/\/ Alerts for when blocks are requested and completed. Also when\n\t\t\t\/\/ pieces are completed.\n\t\t\tprogress_notification = 0x80,\n\n\t\t\t\/\/ Alerts when a peer is blocked by the ip blocker or port blocker. \n\t\t\tip_block_notification = 0x100,\n\n\t\t\t\/\/ Alerts when some limit is reached that might limit the download \n\t\t\t\/\/ or upload rate.\n\t\t\tperformance_warning = 0x200,\n\n\t\t\t\/\/ Alerts on events in the DHT node. For incoming searches or\n\t\t\t\/\/ bootstrapping being done etc.\n\t\t\tdht_notification = 0x400,\n\n\t\t\t\/\/ If you enable these alerts, you will receive a stats_alert\n\t\t\t\/\/ approximately once every second, for every active torrent.\n\t\t\t\/\/ These alerts contain all statistics counters for the interval since\n\t\t\t\/\/ the lasts stats alert.\n\t\t\tstats_notification = 0x800,\n\n\t\t\t\/\/ Alerts on RSS related events, like feeds being updated, feed error \n\t\t\t\/\/ conditions and successful RSS feed updates. Enabling this categoty \n\t\t\t\/\/ will make you receive rss_alert alerts.\n\t\t\trss_notification = 0x1000,\n\n\t\t\t\/\/ The full bitmask, representing all available categories.\n\t\t\t\/\/\n\t\t\t\/\/ since the enum is signed, make sure this isn't\n\t\t\t\/\/ interpreted as -1. For instance, boost.python\n\t\t\t\/\/ does that and fails when assigning it to an\n\t\t\t\/\/ unsigned parameter.\n\t\t\tall_categories = 0x7fffffff\n\t\t};\n\n\t\t\/\/ hidden\n\t\talert();\n\t\t\/\/ hidden\n\t\tvirtual ~alert();\n\n\t\t\/\/ a timestamp is automatically created in the constructor\n\t\tptime timestamp() const;\n\n\t\t\/\/ returns an integer that is unique to this alert type. It can be\n\t\t\/\/ compared against a specific alert by querying a static constant called ``alert_type``\n\t\t\/\/ in the alert. It can be used to determine the run-time type of an alert* in\n\t\t\/\/ order to cast to that alert type and access specific members.\n\t\t\/\/ \n\t\t\/\/ e.g::\n\t\t\/\/\n\t\t\/\/\tstd::auto_ptr<alert> a = ses.pop_alert();\n\t\t\/\/\tswitch (a->type())\n\t\t\/\/\t{\n\t\t\/\/\t\tcase read_piece_alert::alert_type:\n\t\t\/\/\t\t{\n\t\t\/\/\t\t\tread_piece_alert* p = (read_piece_alert*)a.get();\n\t\t\/\/\t\t\tif (p->ec) {\n\t\t\/\/\t\t\t\t\/\/ read_piece failed\n\t\t\/\/\t\t\t\tbreak;\n\t\t\/\/\t\t\t}\n\t\t\/\/\t\t\t\/\/ use p\n\t\t\/\/\t\t\tbreak;\n\t\t\/\/\t\t}\n\t\t\/\/\t\tcase file_renamed_alert::alert_type:\n\t\t\/\/\t\t{\n\t\t\/\/\t\t\t\/\/ etc...\n\t\t\/\/\t\t}\n\t\t\/\/\t}\n\t\tvirtual int type() const = 0;\n\n\t\t\/\/ returns a string literal describing the type of the alert. It does\n\t\t\/\/ not include any information that might be bundled with the alert.\n\t\tvirtual char const* what() const = 0;\n\n\t\t\/\/ generate a string describing the alert and the information bundled\n\t\t\/\/ with it. This is mainly intended for debug and development use. It is not suitable\n\t\t\/\/ to use this for applications that may be localized. Instead, handle each alert\n\t\t\/\/ type individually and extract and render the information from the alert depending\n\t\t\/\/ on the locale.\n\t\tvirtual std::string message() const = 0;\n\n\t\t\/\/ returns a bitmask specifying which categories this alert belong to.\n\t\tvirtual int category() const = 0;\n\n\t\t\/\/ determines whether or not an alert is allowed to be discarded\n\t\t\/\/ when the alert queue is full. There are a few alerts which may not be discared,\n\t\t\/\/ since they would break the user contract, such as save_resume_data_alert.\n\t\tvirtual bool discardable() const { return true; }\n\n#ifndef TORRENT_NO_DEPRECATE\n\t\tTORRENT_DEPRECATED_PREFIX\n\t\tseverity_t severity() const TORRENT_DEPRECATED { return warning; }\n#endif\n\n\t\t\/\/ returns a pointer to a copy of the alert.\n\t\tvirtual std::auto_ptr<alert> clone() const = 0;\n\n\tprivate:\n\t\tptime m_timestamp;\n\t};\n\n#ifndef TORRENT_NO_DEPRECATE\n\tstruct TORRENT_EXPORT unhandled_alert : std::exception\n\t{\n\t\tunhandled_alert() {}\n\t};\n\n#ifndef BOOST_NO_TYPEID\n\n\tnamespace detail {\n\n\t\tstruct void_;\n\n\t\ttemplate<class Handler\n\t\t\t, BOOST_PP_ENUM_PARAMS(TORRENT_MAX_ALERT_TYPES, class T)>\n\t\tvoid handle_alert_dispatch(\n\t\t\tconst std::auto_ptr<alert>& alert_, const Handler& handler\n\t\t\t, const std::type_info& typeid_\n\t\t\t, T0*, BOOST_PP_ENUM_SHIFTED_BINARY_PARAMS(TORRENT_MAX_ALERT_TYPES, T, *p))\n\t\t{\n\t\t\tif (typeid_ == typeid(T0))\n\t\t\t\thandler(*static_cast<T0*>(alert_.get()));\n\t\t\telse\n\t\t\t\thandle_alert_dispatch(alert_, handler, typeid_\n\t\t\t\t\t, BOOST_PP_ENUM_SHIFTED_PARAMS(\n\t\t\t\t\tTORRENT_MAX_ALERT_TYPES, p), (void_*)0);\n\t\t}\n\n\t\ttemplate<class Handler>\n\t\tvoid handle_alert_dispatch(\n\t\t\tconst std::auto_ptr<alert>&\n\t\t\t, const Handler&\n\t\t\t, const std::type_info&\n\t\t\t, BOOST_PP_ENUM_PARAMS(TORRENT_MAX_ALERT_TYPES, void_* BOOST_PP_INTERCEPT))\n\t\t{\n\t\t\tthrow unhandled_alert();\n\t\t}\n\n\t} \/\/ namespace detail\n\n\ttemplate<BOOST_PP_ENUM_PARAMS_WITH_A_DEFAULT(\n\t\tTORRENT_MAX_ALERT_TYPES, class T, detail::void_)>\n\tstruct TORRENT_EXPORT handle_alert\n\t{\n\t\ttemplate<class Handler>\n\t\thandle_alert(const std::auto_ptr<alert>& alert_\n\t\t\t, const Handler& handler)\n\t\t{\n\t\t\t#define ALERT_POINTER_TYPE(z, n, text) (BOOST_PP_CAT(T, n)*)0\n\n\t\t\tdetail::handle_alert_dispatch(alert_, handler, typeid(*alert_)\n\t\t\t\t, BOOST_PP_ENUM(TORRENT_MAX_ALERT_TYPES, ALERT_POINTER_TYPE, _));\n\n\t\t\t#undef ALERT_POINTER_TYPE\n\t\t}\n\t};\n\n#endif \/\/ BOOST_NO_TYPEID\n#endif \/\/ TORRENT_NO_DEPRECATE\n\n\/\/ When you get an alert, you can use ``alert_cast<>`` to attempt to cast the pointer to a\n\/\/ more specific alert type, in order to query it for more information.\ntemplate <class T>\nT* alert_cast(alert* a)\n{\n\tif (a == 0) return 0;\n\tif (a->type() == T::alert_type) return static_cast<T*>(a);\n\treturn 0;\n}\ntemplate <class T>\nT const* alert_cast(alert const* a)\n{\n\tif (a == 0) return 0;\n\tif (a->type() == T::alert_type) return static_cast<T const*>(a);\n\treturn 0;\n}\n\n} \/\/ namespace libtorrent\n\n#endif \/\/ TORRENT_ALERT_HPP_INCLUDED\n\n<commit_msg>attempted no-exceptions build fix<commit_after>\/*\n\nCopyright (c) 2003-2014, Arvid Norberg, Daniel Wallin\nAll rights reserved.\n\nRedistribution and use in source and binary forms, with or without\nmodification, are permitted provided that the following conditions\nare met:\n\n * Redistributions of source code must retain the above copyright\n notice, this list of conditions and the following disclaimer.\n * Redistributions in binary form must reproduce the above copyright\n notice, this list of conditions and the following disclaimer in\n the documentation and\/or other materials provided with the distribution.\n * Neither the name of the author nor the names of its\n contributors may be used to endorse or promote products derived\n from this software without specific prior written permission.\n\nTHIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS \"AS IS\"\nAND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE\nIMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE\nARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE\nLIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR\nCONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF\nSUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS\nINTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN\nCONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)\nARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE\nPOSSIBILITY OF SUCH DAMAGE.\n\n*\/\n\n#ifndef TORRENT_ALERT_HPP_INCLUDED\n#define TORRENT_ALERT_HPP_INCLUDED\n\n#include <memory>\n#include <deque>\n#include <string>\n#include <vector>\n\n#ifdef _MSC_VER\n#pragma warning(push, 1)\n#endif\n\n#include <boost\/preprocessor\/repetition\/enum_params_with_a_default.hpp>\n#include <boost\/preprocessor\/repetition\/enum.hpp>\n#include <boost\/preprocessor\/repetition\/enum_params.hpp>\n#include <boost\/preprocessor\/repetition\/enum_shifted_params.hpp>\n#include <boost\/preprocessor\/repetition\/enum_shifted_binary_params.hpp>\n\n\/\/ OVERVIEW\n\/\/\n\/\/ The pop_alerts() function on session is the main interface for retrieving\n\/\/ alerts (warnings, messages and errors from libtorrent). If no alerts have\n\/\/ been posted by libtorrent pop_alert() will return an empty list.\n\/\/ \n\/\/ By default, only errors are reported. set_alert_mask() can be used to\n\/\/ specify which kinds of events should be reported. The alert mask is\n\/\/ comprised by bits from the category_t enum.\n\/\/ \n\/\/ Every alert belongs to one or more category. There is a small cost involved\n\/\/ in posting alerts. Only alerts that belong to an enabled category are\n\/\/ posted. Setting the alert bitmask to 0 will disable all alerts (except those\n\/\/ that are non-discardable).\n\/\/ \n\/\/ There are other alert base classes that some alerts derive from, all the\n\/\/ alerts that are generated for a specific torrent are derived from\n\/\/ torrent_alert, and tracker events derive from tracker_alert.\n\/\/\n\n#ifdef _MSC_VER\n#pragma warning(pop)\n#endif\n\n#include \"libtorrent\/time.hpp\"\n#include \"libtorrent\/config.hpp\"\n\n#ifndef TORRENT_NO_DEPRECATE\n#ifndef BOOST_NO_TYPEID\n#include <typeinfo>\n#endif\n#endif \/\/ TORRENT_NO_DEPRECATE\n\n#ifndef TORRENT_MAX_ALERT_TYPES\n#define TORRENT_MAX_ALERT_TYPES 15\n#endif\n\n#ifndef TORRENT_NO_DEPRECATE\n#ifndef BOOST_NO_TYPEID\n#include <typeinfo>\n#endif\n#endif\n\nnamespace libtorrent {\n\n\t\/\/ The ``alert`` class is the base class that specific messages are derived from.\n\tclass TORRENT_EXPORT alert\n\t{\n\tpublic:\n\n#ifndef TORRENT_NO_DEPRECATE\n\t\t\/\/ only here for backwards compatibility\n\t\tenum severity_t { debug, info, warning, critical, fatal, none };\n#endif\n\n\t\t\/\/ these are bits for the alert_mask used by the session. See set_alert_mask().\n\t\tenum category_t\n\t\t{\n\t\t\t\/\/ Enables alerts that report an error. This includes:\n\t\t\t\/\/ \n\t\t\t\/\/ * tracker errors\n\t\t\t\/\/ * tracker warnings\n\t\t\t\/\/ * file errors\n\t\t\t\/\/ * resume data failures\n\t\t\t\/\/ * web seed errors\n\t\t\t\/\/ * .torrent files errors\n\t\t\t\/\/ * listen socket errors\n\t\t\t\/\/ * port mapping errors\n\t\t\terror_notification = 0x1,\n\n\t\t\t\/\/ Enables alerts when peers send invalid requests, get banned or\n\t\t\t\/\/ snubbed.\n\t\t\tpeer_notification = 0x2,\n\n\t\t\t\/\/ Enables alerts for port mapping events. For NAT-PMP and UPnP.\n\t\t\tport_mapping_notification = 0x4,\n\n\t\t\t\/\/ Enables alerts for events related to the storage. File errors and \n\t\t\t\/\/ synchronization events for moving the storage, renaming files etc. \n\t\t\tstorage_notification = 0x8,\n\n\t\t\t\/\/ Enables all tracker events. Includes announcing to trackers,\n\t\t\t\/\/ receiving responses, warnings and errors.\n\t\t\ttracker_notification = 0x10,\n\n\t\t\t\/\/ Low level alerts for when peers are connected and disconnected.\n\t\t\tdebug_notification = 0x20,\n\n\t\t\t\/\/ Enables alerts for when a torrent or the session changes state.\n\t\t\tstatus_notification = 0x40,\n\n\t\t\t\/\/ Alerts for when blocks are requested and completed. Also when\n\t\t\t\/\/ pieces are completed.\n\t\t\tprogress_notification = 0x80,\n\n\t\t\t\/\/ Alerts when a peer is blocked by the ip blocker or port blocker. \n\t\t\tip_block_notification = 0x100,\n\n\t\t\t\/\/ Alerts when some limit is reached that might limit the download \n\t\t\t\/\/ or upload rate.\n\t\t\tperformance_warning = 0x200,\n\n\t\t\t\/\/ Alerts on events in the DHT node. For incoming searches or\n\t\t\t\/\/ bootstrapping being done etc.\n\t\t\tdht_notification = 0x400,\n\n\t\t\t\/\/ If you enable these alerts, you will receive a stats_alert\n\t\t\t\/\/ approximately once every second, for every active torrent.\n\t\t\t\/\/ These alerts contain all statistics counters for the interval since\n\t\t\t\/\/ the lasts stats alert.\n\t\t\tstats_notification = 0x800,\n\n\t\t\t\/\/ Alerts on RSS related events, like feeds being updated, feed error \n\t\t\t\/\/ conditions and successful RSS feed updates. Enabling this categoty \n\t\t\t\/\/ will make you receive rss_alert alerts.\n\t\t\trss_notification = 0x1000,\n\n\t\t\t\/\/ The full bitmask, representing all available categories.\n\t\t\t\/\/\n\t\t\t\/\/ since the enum is signed, make sure this isn't\n\t\t\t\/\/ interpreted as -1. For instance, boost.python\n\t\t\t\/\/ does that and fails when assigning it to an\n\t\t\t\/\/ unsigned parameter.\n\t\t\tall_categories = 0x7fffffff\n\t\t};\n\n\t\t\/\/ hidden\n\t\talert();\n\t\t\/\/ hidden\n\t\tvirtual ~alert();\n\n\t\t\/\/ a timestamp is automatically created in the constructor\n\t\tptime timestamp() const;\n\n\t\t\/\/ returns an integer that is unique to this alert type. It can be\n\t\t\/\/ compared against a specific alert by querying a static constant called ``alert_type``\n\t\t\/\/ in the alert. It can be used to determine the run-time type of an alert* in\n\t\t\/\/ order to cast to that alert type and access specific members.\n\t\t\/\/ \n\t\t\/\/ e.g::\n\t\t\/\/\n\t\t\/\/\tstd::auto_ptr<alert> a = ses.pop_alert();\n\t\t\/\/\tswitch (a->type())\n\t\t\/\/\t{\n\t\t\/\/\t\tcase read_piece_alert::alert_type:\n\t\t\/\/\t\t{\n\t\t\/\/\t\t\tread_piece_alert* p = (read_piece_alert*)a.get();\n\t\t\/\/\t\t\tif (p->ec) {\n\t\t\/\/\t\t\t\t\/\/ read_piece failed\n\t\t\/\/\t\t\t\tbreak;\n\t\t\/\/\t\t\t}\n\t\t\/\/\t\t\t\/\/ use p\n\t\t\/\/\t\t\tbreak;\n\t\t\/\/\t\t}\n\t\t\/\/\t\tcase file_renamed_alert::alert_type:\n\t\t\/\/\t\t{\n\t\t\/\/\t\t\t\/\/ etc...\n\t\t\/\/\t\t}\n\t\t\/\/\t}\n\t\tvirtual int type() const = 0;\n\n\t\t\/\/ returns a string literal describing the type of the alert. It does\n\t\t\/\/ not include any information that might be bundled with the alert.\n\t\tvirtual char const* what() const = 0;\n\n\t\t\/\/ generate a string describing the alert and the information bundled\n\t\t\/\/ with it. This is mainly intended for debug and development use. It is not suitable\n\t\t\/\/ to use this for applications that may be localized. Instead, handle each alert\n\t\t\/\/ type individually and extract and render the information from the alert depending\n\t\t\/\/ on the locale.\n\t\tvirtual std::string message() const = 0;\n\n\t\t\/\/ returns a bitmask specifying which categories this alert belong to.\n\t\tvirtual int category() const = 0;\n\n\t\t\/\/ determines whether or not an alert is allowed to be discarded\n\t\t\/\/ when the alert queue is full. There are a few alerts which may not be discared,\n\t\t\/\/ since they would break the user contract, such as save_resume_data_alert.\n\t\tvirtual bool discardable() const { return true; }\n\n#ifndef TORRENT_NO_DEPRECATE\n\t\tTORRENT_DEPRECATED_PREFIX\n\t\tseverity_t severity() const TORRENT_DEPRECATED { return warning; }\n#endif\n\n\t\t\/\/ returns a pointer to a copy of the alert.\n\t\tvirtual std::auto_ptr<alert> clone() const = 0;\n\n\tprivate:\n\t\tptime m_timestamp;\n\t};\n\n#ifndef BOOST_NO_EXCEPTIONS\n#ifndef TORRENT_NO_DEPRECATE\n\tstruct TORRENT_EXPORT unhandled_alert : std::exception\n\t{\n\t\tunhandled_alert() {}\n\t};\n\n#ifndef BOOST_NO_TYPEID\n\n\tnamespace detail {\n\n\t\tstruct void_;\n\n\t\ttemplate<class Handler\n\t\t\t, BOOST_PP_ENUM_PARAMS(TORRENT_MAX_ALERT_TYPES, class T)>\n\t\tvoid handle_alert_dispatch(\n\t\t\tconst std::auto_ptr<alert>& alert_, const Handler& handler\n\t\t\t, const std::type_info& typeid_\n\t\t\t, T0*, BOOST_PP_ENUM_SHIFTED_BINARY_PARAMS(TORRENT_MAX_ALERT_TYPES, T, *p))\n\t\t{\n\t\t\tif (typeid_ == typeid(T0))\n\t\t\t\thandler(*static_cast<T0*>(alert_.get()));\n\t\t\telse\n\t\t\t\thandle_alert_dispatch(alert_, handler, typeid_\n\t\t\t\t\t, BOOST_PP_ENUM_SHIFTED_PARAMS(\n\t\t\t\t\tTORRENT_MAX_ALERT_TYPES, p), (void_*)0);\n\t\t}\n\n\t\ttemplate<class Handler>\n\t\tvoid handle_alert_dispatch(\n\t\t\tconst std::auto_ptr<alert>&\n\t\t\t, const Handler&\n\t\t\t, const std::type_info&\n\t\t\t, BOOST_PP_ENUM_PARAMS(TORRENT_MAX_ALERT_TYPES, void_* BOOST_PP_INTERCEPT))\n\t\t{\n\t\t\tthrow unhandled_alert();\n\t\t}\n\n\t} \/\/ namespace detail\n\n\ttemplate<BOOST_PP_ENUM_PARAMS_WITH_A_DEFAULT(\n\t\tTORRENT_MAX_ALERT_TYPES, class T, detail::void_)>\n\tstruct TORRENT_EXPORT handle_alert\n\t{\n\t\ttemplate<class Handler>\n\t\thandle_alert(const std::auto_ptr<alert>& alert_\n\t\t\t, const Handler& handler)\n\t\t{\n\t\t\t#define ALERT_POINTER_TYPE(z, n, text) (BOOST_PP_CAT(T, n)*)0\n\n\t\t\tdetail::handle_alert_dispatch(alert_, handler, typeid(*alert_)\n\t\t\t\t, BOOST_PP_ENUM(TORRENT_MAX_ALERT_TYPES, ALERT_POINTER_TYPE, _));\n\n\t\t\t#undef ALERT_POINTER_TYPE\n\t\t}\n\t};\n\n#endif \/\/ BOOST_NO_TYPEID\n#endif \/\/ TORRENT_NO_DEPRECATE\n#endif \/\/ BOOST_NO_EXCEPTIONS\n\n\/\/ When you get an alert, you can use ``alert_cast<>`` to attempt to cast the pointer to a\n\/\/ more specific alert type, in order to query it for more information.\ntemplate <class T>\nT* alert_cast(alert* a)\n{\n\tif (a == 0) return 0;\n\tif (a->type() == T::alert_type) return static_cast<T*>(a);\n\treturn 0;\n}\ntemplate <class T>\nT const* alert_cast(alert const* a)\n{\n\tif (a == 0) return 0;\n\tif (a->type() == T::alert_type) return static_cast<T const*>(a);\n\treturn 0;\n}\n\n} \/\/ namespace libtorrent\n\n#endif \/\/ TORRENT_ALERT_HPP_INCLUDED\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#ifndef TORRENT_DEBUG_HPP_INCLUDED\n#define TORRENT_DEBUG_HPP_INCLUDED\n\n#if defined TORRENT_ASIO_DEBUGGING\n\n#include \"libtorrent\/assert.hpp\"\n#include \"libtorrent\/thread.hpp\"\n\n#include <execinfo.h>\n#include <map>\n\nstd::string demangle(char const* name);\n\nnamespace libtorrent\n{\n\tstruct async_t\n\t{\n\t\tasync_t() : refs(0) {}\n\t\tstd::string stack;\n\t\tint refs;\n\t};\n\n\textern std::map<std::string, async_t> _async_ops;\n\textern int _async_ops_nthreads;\n\textern mutex _async_ops_mutex;\n\n\tinline void add_outstanding_async(char const* name)\n\t{\n\t\tmutex::scoped_lock l(_async_ops_mutex);\n\t\tasync_t& a = _async_ops[name];\n\t\tif (a.stack.empty())\n\t\t{\n\t\t\tvoid* stack[50];\n\t\t\tint size = backtrace(stack, 50);\n\t\t\tchar** symbols = backtrace_symbols(stack, size);\n\n\t\t\tfor (int i = 1; i < size; ++i)\n\t\t\t{\n\t\t\t\tchar str[200];\n\t\t\t\tsnprintf(str, sizeof(str), \"%d: %s\\n\", i, demangle(symbols[i]).c_str());\n\t\t\t\ta.stack += str;\n\t\t\t}\n\n\t\t\tfree(symbols);\n\t\t}\n\t\t++a.refs;\n\t}\n\n\tinline void complete_async(char const* name)\n\t{\n\t\tmutex::scoped_lock l(_async_ops_mutex);\n\t\tasync_t& a = _async_ops[name];\n\t\tTORRENT_ASSERT(a.refs > 0);\n\t\t--a.refs;\n\t}\n\n\tinline void async_inc_threads()\n\t{\n\t\tmutex::scoped_lock l(_async_ops_mutex);\n\t\t++_async_ops_nthreads;\n\t}\n\n\tinline void async_dec_threads()\n\t{\n\t\tmutex::scoped_lock l(_async_ops_mutex);\n\t\t--_async_ops_nthreads;\n\t}\n\n\tinline int log_async()\n\t{\n\t\tmutex::scoped_lock l(_async_ops_mutex);\n\t\tint ret = 0;\n\t\tfor (std::map<std::string, async_t>::iterator i = _async_ops.begin()\n\t\t\t, end(_async_ops.end()); i != end; ++i)\n\t\t{\n\t\t\tif (i->second.refs <= _async_ops_nthreads - 1) continue;\n\t\t\tret += i->second.refs;\n\t\t\tprintf(\"%s: (%d)\\n%s\\n\", i->first.c_str(), i->second.refs, i->second.stack.c_str());\n\t\t}\n\t\treturn ret;\n\t}\n}\n\n#endif\n\n#if defined TORRENT_VERBOSE_LOGGING || defined TORRENT_LOGGING || defined TORRENT_ERROR_LOGGING\n\n#include <string>\n#include \"libtorrent\/config.hpp\"\n#include \"libtorrent\/file.hpp\"\n#include \"libtorrent\/thread.hpp\"\n\n#if TORRENT_USE_IOSTREAM\n#include <fstream>\n#include <iostream>\n#endif\n\nnamespace libtorrent\n{\n\t\/\/ DEBUG API\n\t\n\tstruct logger\n\t{\n#if TORRENT_USE_IOSTREAM\n\t\t\/\/ all log streams share a single file descriptor\n\t\t\/\/ and re-opens the file for each log line\n\t\t\/\/ these members are defined in session_impl.cpp\n\t\tstatic std::ofstream log_file;\n\t\tstatic std::string open_filename;\n\t\tstatic mutex file_mutex;\n#endif\n\n\t\t~logger()\n\t\t{\n\t\t\tmutex::scoped_lock l(file_mutex);\n\t\t\tlog_file.close();\n\t\t}\n\n\t\tlogger(std::string const& logpath, std::string const& filename\n\t\t\t, int instance, bool append)\n\t\t{\n\t\t\tchar log_name[512];\n\t\t\tsnprintf(log_name, sizeof(log_name), \"libtorrent_logs%d\", instance);\n\t\t\tstd::string dir(complete(combine_path(logpath, log_name)));\n\t\t\terror_code ec;\n\t\t\tif (!exists(dir)) create_directories(dir, ec);\n\t\t\tm_filename = combine_path(dir, filename);\n\n\t\t\tmutex::scoped_lock l(file_mutex);\n\t\t\topen(!append);\n\t\t\tlog_file << \"\\n\\n\\n*** starting log ***\\n\";\n\t\t}\n\n#if TORRENT_USE_IOSTREAM\n\t\tvoid open(bool truncate)\n\t\t{\n\t\t\tif (open_filename == m_filename) return;\n\t\t\tlog_file.close();\n\t\t\tlog_file.clear();\n\t\t\tlog_file.open(m_filename.c_str(), truncate ? std::ios_base::trunc : std::ios_base::app);\n\t\t\topen_filename = m_filename;\n\t\t\tif (!log_file.good())\n\t\t\t\tfprintf(stderr, \"Failed to open logfile %s: %s\\n\", m_filename.c_str(), strerror(errno));\n\t\t}\n#endif\n\n\t\ttemplate <class T>\n\t\tlogger& operator<<(T const& v)\n\t\t{\n#if TORRENT_USE_IOSTREAM\n\t\t\tmutex::scoped_lock l(file_mutex);\n\t\t\topen(false);\n\t\t\tlog_file << v;\n#endif\n\t\t\treturn *this;\n\t\t}\n\n\t\tstd::string m_filename;\n\t};\n\n}\n\n#endif \/\/ TORRENT_VERBOSE_LOGGING || TORRENT_LOGGING || TORRENT_ERROR_LOGGING\n#endif \/\/ TORRENT_DEBUG_HPP_INCLUDED\n\n<commit_msg>debug logging fix<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#ifndef TORRENT_DEBUG_HPP_INCLUDED\n#define TORRENT_DEBUG_HPP_INCLUDED\n\n#if defined TORRENT_ASIO_DEBUGGING\n\n#include \"libtorrent\/assert.hpp\"\n#include \"libtorrent\/thread.hpp\"\n\n#include <execinfo.h>\n#include <map>\n\nstd::string demangle(char const* name);\n\nnamespace libtorrent\n{\n\tstruct async_t\n\t{\n\t\tasync_t() : refs(0) {}\n\t\tstd::string stack;\n\t\tint refs;\n\t};\n\n\textern std::map<std::string, async_t> _async_ops;\n\textern int _async_ops_nthreads;\n\textern mutex _async_ops_mutex;\n\n\tinline void add_outstanding_async(char const* name)\n\t{\n\t\tmutex::scoped_lock l(_async_ops_mutex);\n\t\tasync_t& a = _async_ops[name];\n\t\tif (a.stack.empty())\n\t\t{\n\t\t\tvoid* stack[50];\n\t\t\tint size = backtrace(stack, 50);\n\t\t\tchar** symbols = backtrace_symbols(stack, size);\n\n\t\t\tfor (int i = 1; i < size; ++i)\n\t\t\t{\n\t\t\t\tchar str[200];\n\t\t\t\tsnprintf(str, sizeof(str), \"%d: %s\\n\", i, demangle(symbols[i]).c_str());\n\t\t\t\ta.stack += str;\n\t\t\t}\n\n\t\t\tfree(symbols);\n\t\t}\n\t\t++a.refs;\n\t}\n\n\tinline void complete_async(char const* name)\n\t{\n\t\tmutex::scoped_lock l(_async_ops_mutex);\n\t\tasync_t& a = _async_ops[name];\n\t\tTORRENT_ASSERT(a.refs > 0);\n\t\t--a.refs;\n\t}\n\n\tinline void async_inc_threads()\n\t{\n\t\tmutex::scoped_lock l(_async_ops_mutex);\n\t\t++_async_ops_nthreads;\n\t}\n\n\tinline void async_dec_threads()\n\t{\n\t\tmutex::scoped_lock l(_async_ops_mutex);\n\t\t--_async_ops_nthreads;\n\t}\n\n\tinline int log_async()\n\t{\n\t\tmutex::scoped_lock l(_async_ops_mutex);\n\t\tint ret = 0;\n\t\tfor (std::map<std::string, async_t>::iterator i = _async_ops.begin()\n\t\t\t, end(_async_ops.end()); i != end; ++i)\n\t\t{\n\t\t\tif (i->second.refs <= _async_ops_nthreads - 1) continue;\n\t\t\tret += i->second.refs;\n\t\t\tprintf(\"%s: (%d)\\n%s\\n\", i->first.c_str(), i->second.refs, i->second.stack.c_str());\n\t\t}\n\t\treturn ret;\n\t}\n}\n\n#endif\n\n#if defined TORRENT_VERBOSE_LOGGING || defined TORRENT_LOGGING || defined TORRENT_ERROR_LOGGING\n\n#include <string>\n#include \"libtorrent\/config.hpp\"\n#include \"libtorrent\/file.hpp\"\n#include \"libtorrent\/thread.hpp\"\n\n#if TORRENT_USE_IOSTREAM\n#include <fstream>\n#include <iostream>\n#endif\n\nnamespace libtorrent\n{\n\t\/\/ DEBUG API\n\t\n\tstruct logger\n\t{\n#if TORRENT_USE_IOSTREAM\n\t\t\/\/ all log streams share a single file descriptor\n\t\t\/\/ and re-opens the file for each log line\n\t\t\/\/ these members are defined in session_impl.cpp\n\t\tstatic std::ofstream log_file;\n\t\tstatic std::string open_filename;\n\t\tstatic mutex file_mutex;\n#endif\n\n\t\t~logger()\n\t\t{\n\t\t\tmutex::scoped_lock l(file_mutex);\n\t\t\tlog_file.close();\n\t\t\topen_filename.clear();\n\t\t}\n\n\t\tlogger(std::string const& logpath, std::string const& filename\n\t\t\t, int instance, bool append)\n\t\t{\n\t\t\tchar log_name[512];\n\t\t\tsnprintf(log_name, sizeof(log_name), \"libtorrent_logs%d\", instance);\n\t\t\tstd::string dir(complete(combine_path(logpath, log_name)));\n\t\t\terror_code ec;\n\t\t\tif (!exists(dir)) create_directories(dir, ec);\n\t\t\tm_filename = combine_path(dir, filename);\n\n\t\t\tmutex::scoped_lock l(file_mutex);\n\t\t\topen(!append);\n\t\t\tlog_file << \"\\n\\n\\n*** starting log ***\\n\";\n\t\t}\n\n#if TORRENT_USE_IOSTREAM\n\t\tvoid open(bool truncate)\n\t\t{\n\t\t\tif (open_filename == m_filename) return;\n\t\t\tlog_file.close();\n\t\t\tlog_file.clear();\n\t\t\tlog_file.open(m_filename.c_str(), truncate ? std::ios_base::trunc : std::ios_base::app);\n\t\t\topen_filename = m_filename;\n\t\t\tif (!log_file.good())\n\t\t\t\tfprintf(stderr, \"Failed to open logfile %s: %s\\n\", m_filename.c_str(), strerror(errno));\n\t\t}\n#endif\n\n\t\ttemplate <class T>\n\t\tlogger& operator<<(T const& v)\n\t\t{\n#if TORRENT_USE_IOSTREAM\n\t\t\tmutex::scoped_lock l(file_mutex);\n\t\t\topen(false);\n\t\t\tlog_file << v;\n#endif\n\t\t\treturn *this;\n\t\t}\n\n\t\tstd::string m_filename;\n\t};\n\n}\n\n#endif \/\/ TORRENT_VERBOSE_LOGGING || TORRENT_LOGGING || TORRENT_ERROR_LOGGING\n#endif \/\/ TORRENT_DEBUG_HPP_INCLUDED\n\n<|endoftext|>"} {"text":"<commit_before>#pragma ident \"$Id: \/\/depot\/sgl\/gpstk\/dev\/apps\/receiver\/AshtechMessage.cpp#1 $\"\n\n\/**\n * @file AshtechMessage.cpp\n * Containers for Ashtech data, conversions to RINEX - definitions.\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\/\/============================================================================\n\/\/\n\/\/This software developed by Applied Research Laboratories at the University of\n\/\/Texas at Austin, under contract to an agency or agencies within the U.S.\n\/\/Department of Defense. The U.S. Government retains all rights to use,\n\/\/duplicate, distribute, disclose, or release this software.\n\/\/\n\/\/Pursuant to DoD Directive 523024\n\/\/\n\/\/ DISTRIBUTION STATEMENT A: This software has been approved for public\n\/\/ release, distribution is unlimited.\n\/\/\n\/\/=============================================================================\n \n#include <string>\n#include <iostream>\n#include <iomanip>\n#include <string.h>\n\n#include \"BinUtils.hpp\"\n#include \"StringUtils.hpp\"\n#include \"DayTime.hpp\"\n#include \"EngEphemeris.hpp\"\n#include \"RinexObsHeader.hpp\"\n#include \"icd_200_constants.hpp\"\n#include \"AshtechMessage.hpp\"\n\nstatic bool debug=false;\n\nnamespace gpstk\n{\n\n static const double CFF=C_GPS_M\/OSC_FREQ;\n static const double wl1=CFF\/L1_MULT;\n static const double wl2=CFF\/L2_MULT;\n\n AshtechMessage::AshtechMessage(const std::string& ibuff, ObsSource src, \n ObsFormat fmt)\n : msgSource(src), msgFormat(fmt), buffer(ibuff)\n {\n using namespace std;\n \n \/\/ Determine the type of observation\n string label=buffer.substr(0,3);\n if (label==\"MCA\") msgType = MCA;\n if (label==\"MCL\") msgType = MCL;\n if (label==\"MP1\") msgType = MP1;\n if (label==\"MP2\") msgType = MP2;\n if (label==\"MPC\") msgType = MPC; \n if (label==\"PBN\") msgType = PBEN;\n if (label==\"SNV\") msgType = SNAV;\n if (label==\"EPB\") msgType = EPB;\n if (label==\"SAL\") msgType = SALM;\n if (label==\"ALB\") msgType = ALB;\n if (label==\"ION\") msgType = ION;\n }\n\n bool AshtechMessage::isObs(void) const\n {\n return ( (msgType==MCA) || (msgType==MCL) || (msgType==MP1) ||\n (msgType==MP2) || (msgType==MPC) );\n }\n\n int AshtechMessage::getSequence(void) const\n {\n int result=-1;\n\n if ((msgType == MPC) && (msgFormat == ASCII))\n {\n result= \n StringUtils::asInt(StringUtils::word(buffer,1,','));\n } \n \n return result;\n }\n\n int AshtechMessage::getPRN(void) const\n {\n int result=-1;\n\n if ((msgType == MPC) && (msgFormat == ASCII)) \n {\n result= \n StringUtils::asInt(StringUtils::word(buffer,3,','));\n } \n\n if (msgType==EPB)\n {\n result=StringUtils::asInt(buffer.substr(4,5));\n } \n \n return result;\n }\n\n int AshtechMessage::getTracker(void) const\n {\n int result=-1;\n\n if ((msgType == MPC) && (msgFormat == ASCII))\n {\n result= \n StringUtils::asInt(StringUtils::word(buffer,6,','));\n } \n \n return result;\n }\n\n DayTime AshtechMessage::getEpoch(const DayTime& prevTime) const\n {\n short oldweek = prevTime.GPSfullweek();\n short newweek = oldweek;\n \n double oldsow = prevTime.GPSsecond();\n double newsow;\n\n DayTime thisTime(prevTime);\n\n if ((msgType == PBEN)&&(msgFormat == ASCII))\n {\n newsow = \n StringUtils::asDouble(StringUtils::word(buffer,1,','));\n\n \/\/ A test for week rollover\n if ((newsow+6*DayTime::SEC_DAY)<oldsow)\n newweek++;\n\n thisTime = DayTime(newweek, newsow);\n }\n\n if ((msgType == MPC)&&(msgFormat == ASCII))\n {\n int seqDiff = getSequence() - calculateSequenceNumber(prevTime);\n \/\/ Nominally seqDiff should be small. Check if there is a rollover\n \/\/ between the two inputs sequences numbers.\n while (seqDiff > (1800*50\/2))\n\t\tseqDiff -= 1800*50;\n\n thisTime.addMilliSeconds(50 * seqDiff);\n }\n\n return thisTime;\n }\n\n float AshtechMessage::engSNR(short value, float equivalentNoiseBW)\n {\n const int n = 20000; \/\/ number of samples in 1 ms\n const float m = 4.14; \/\/ magnitude of the carrier estimate;\n\n const float d = gpstk::PI\/(n*n*m*m*4.0); \n float snr;\n\n if (value)\n {\n snr = exp(((float)value)\/25.0);\n snr = snr*snr*equivalentNoiseBW*d;\n snr = 10 * log10(snr);\n }\n else\n snr = 0;\n\n return snr;\n }\n \n\n RinexObsData \n AshtechMessage::convertToRinexObsData(\n const std::list<AshtechMessage> obsMsgs, \n const DayTime& recentEpoch) \n throw(gpstk::Exception)\n {\n RinexObsData rod;\n \/\/ TODO: Should check to make sure this is really a PBEN\n DayTime epoch;\n std::list<AshtechMessage>::const_iterator first = obsMsgs.begin();\n epoch = (*first).getEpoch(recentEpoch);\n\n rod.time = epoch;\n rod.numSvs = 0;\n rod.epochFlag = 1;\n\n std::list<AshtechMessage>::const_iterator i;\n for (i=obsMsgs.begin(); i!=obsMsgs.end(); i++)\n {\n if ((i->msgType == MPC)&&(i->msgFormat == ASCII))\n {\n \n int prn = StringUtils::asInt( StringUtils::word(i->buffer,3,','));\n double C1 = StringUtils::asDouble( StringUtils::word(i->buffer,13,',')) * C_GPS_M \/ 1000.0;\n double P1 = StringUtils::asDouble( StringUtils::word(i->buffer,23,',')) * C_GPS_M \/ 1000.0;\n double P2 = StringUtils::asDouble( StringUtils::word(i->buffer,33,',')) * C_GPS_M \/ 1000.0;\n double L1 = StringUtils::asDouble( StringUtils::word(i->buffer,22,','));\n double L2 = StringUtils::asDouble( StringUtils::word(i->buffer,32,','));\n double D1 = StringUtils::asDouble( StringUtils::word(i->buffer,24,','));\n double D2 = StringUtils::asDouble( StringUtils::word(i->buffer,34,','));\n int snrL1 = StringUtils::asInt( StringUtils::word(i->buffer,20,','));\n int snrL2 = StringUtils::asInt( StringUtils::word(i->buffer,30,','));\n\n int warning = StringUtils::asInt( StringUtils::word(i->buffer,27,','));\n\n double S1 = engSNR(snrL1, 9.21e6);\n double S2 = engSNR(snrL2, 9.21e6);\n\n \/\/ Debug check\n \/\/ std::cout << prn << \" \" << D1 << \" \" << D2 << \" \" << L1 << \" \" << L2 << std::endl;\n \/\/ exit(0);\n\n RinexPrn thisSat(prn, systemGPS);\n RinexObsData::RinexObsTypeMap datamap;\n\n datamap[RinexObsHeader::C1].data = C1; \n datamap[RinexObsHeader::P1].data = P1; \n datamap[RinexObsHeader::P2].data = P2;\n datamap[RinexObsHeader::L1].data = L1;\n datamap[RinexObsHeader::L2].data = L2;\n datamap[RinexObsHeader::D1].data = -D1; \/\/ Note sign convention for Doppler is opposite that of RINEX.\n datamap[RinexObsHeader::D2].data = -D2;\n datamap[RinexObsHeader::S1].data = S1; \n datamap[RinexObsHeader::S2].data = S2;\n \n datamap[RinexObsHeader::L1].lli = 0;\n datamap[RinexObsHeader::L2].lli = 0;\n if (warning & 128) \n {\n datamap[RinexObsHeader::L1].lli = 1; \n datamap[RinexObsHeader::L2].lli = 1; \n }\n\n datamap[RinexObsHeader::L1].ssi = mapSNRtoSSI(snrL1);\n datamap[RinexObsHeader::L2].ssi = mapSNRtoSSI(snrL2); \n \n rod.obs[thisSat]=datamap;\n rod.numSvs++;\n }\n \n }\n\n return rod; \n }\n\n int AshtechMessage::calculateSequenceNumber(const DayTime& t)\n {\n \/\/ TODO: Throw if not a MBEN\n double secondsOfHour = t.minute()*60+t.second();\n double secondsOfSequence = secondsOfHour;\n while (secondsOfSequence >= 1800.) \n secondsOfSequence -= 1800.;\n double milliSecondsOfSequence = secondsOfSequence*1000.;\n \/\/ There is sequence tick every 50 milliseconds\n return (int)(milliSecondsOfSequence \/ 50.);\n }\n\n short AshtechMessage::mapSNRtoSSI(float snr)\n {\n if (snr>34) return 9;\n if (snr>29) return 8;\n if (snr>20) return 5;\n if (snr>10) return 1;\n return 0;\n }\n\n RinexNavData AshtechMessage::convertToRinexNavData(const AshtechMessage& msg, const DayTime& epoch)\n {\n \/\/ TODO: throw if not an EPB type\n using namespace BinUtils;\n\n int offset=5;\n const char *dptr = msg.buffer.data();\n\n EngEphemeris eph;\n short PRN = StringUtils::asInt(msg.buffer.substr(4,2));\n\n long subframe[30];\n\n \/\/using namespace std;\n \n for (int i=0;i<30;i++)\n {\n subframe[i]=*((long *)(dptr+7+i*4));\n#if BYTE_ORDER == LITTLE_ENDIAN\n BinUtils::twiddle(subframe[i]);\n#endif\n \/\/ cout << \"Word \" << dec << i << \": 0x\" << hex << subframe[i] << endl << flush << dec;\n }\n \n\/\/ TODO: throw an exception if these calls fail\n eph.addSubframe(subframe, epoch.GPSfullweek(), PRN, 0);\n \/\/ cout << \"sf1\" << endl << flush;\n \n eph.addSubframe(subframe+10, epoch.GPSfullweek(), PRN, 0);\n \/\/ cout << \"sf2\" << endl << flush;\n\n eph.addSubframe(subframe+20, epoch.GPSfullweek(), PRN, 0);\n \/\/ cout << \"sf3\" << endl << flush;\n\n \/\/ eph.dump(std::cout);\n\n \/\/ exit(0);\n \n return eph;\n \/\/return RinexNavData();\n }\n\n void AshtechMessage::updateNavHeader(const AshtechMessage& ionMsg, RinexNavHeader& hdr)\n { \n \/\/ TODO: the ION message interpreter is broken. Make it work. Then have the main programm\n \/\/ regularly request an ION msg.\n\n\n \/\/ TODO: Throw if not an ION type... hmm, need an ASSERT macro for types\n using namespace BinUtils;\n using namespace std;\n\n \/\/ Offset between location in the buffer and the location defined in the\n \/\/ Ashtech document ZFamily.pdf -- ZFamily GPS Receivers, Technical Ref. Manual, dated 2002\n int offset=5;\n const char *dptr = ionMsg.buffer.data();\n \n \/\/ Alpha parameters of Klobuchar model-------------------------------------------------\n float alpha0, alpha1, alpha2, alpha3;\n \n memmove(&alpha0, dptr+offset+0, 4); \n memmove(&alpha1, dptr+offset+4, 4); \n memmove(&alpha2, dptr+offset+8, 4); \n memmove(&alpha3, dptr+offset+12, 4);\n\n#if BYTE_ORDER == LITTLE_ENDIAN\n twiddle(alpha0);\n twiddle(alpha1);\n twiddle(alpha2);\n twiddle(alpha3);\n#endif\n\n hdr.ionAlpha[0] = alpha0;\n hdr.ionAlpha[1] = alpha1;\n hdr.ionAlpha[2] = alpha2;\n hdr.ionAlpha[3] = alpha3;\n\n hdr.valid |= RinexNavHeader::ionAlphaValid;\n\n \/\/ Beta parameters of Klobuchar model-------------------------------------------------\n float beta0, beta1, beta2, beta3;\n \n memmove(&beta0, dptr+offset+16, 4); \n memmove(&beta1, dptr+offset+20, 4); \n memmove(&beta2, dptr+offset+24, 4); \n memmove(&beta3, dptr+offset+28, 4); \n\n#if BYTE_ORDER == LITTLE_ENDIAN\n twiddle(beta0);\n twiddle(beta1);\n twiddle(beta2);\n twiddle(beta3);\n#endif\n\n hdr.ionBeta[0] = beta0;\n hdr.ionBeta[1] = beta1;\n hdr.ionBeta[2] = beta2;\n hdr.ionBeta[3] = beta3;\n\n hdr.valid |= RinexNavHeader::ionBetaValid;\n \n \/\/ Ref time parameters of Klobuchar model-------------------------------------------------\n\n double A0, A1;\n long UTCseconds;\n short UTCweek;\n \n memmove(&A1, dptr+offset+32, 8);\n memmove(&A0, dptr+offset+40, 8);\n memmove(&UTCseconds, dptr+offset+48, 4);\n memmove(&UTCweek, dptr+offset+52, 2);\n \n#if BYTE_ORDER == LITTLE_ENDIAN\n twiddle(A1);\n twiddle(A0);\n twiddle(UTCseconds);\n twiddle(UTCweek);\n#endif\n \n hdr.A0 = A0;\n hdr.A1 = A1;\n hdr.UTCRefWeek = UTCweek;\n hdr.UTCRefTime = UTCseconds;\n \n hdr.valid |= RinexNavHeader::deltaUTCValid;\n \n \/\/ Leap seconds --------------------------------------------------------------------------\n \n short leapSeconds;\n \n memmove(&leapSeconds, dptr+52, 2);\n\n#if BYTE_ORDER == LITTLE_ENDIAN\n twiddle(leapSeconds);\n#endif\n\n hdr.leapSeconds = leapSeconds;\n\n hdr.valid |= RinexNavHeader::leapSecondsValid; \n\n return; \n }\n \n} \/\/ End namespace\n<commit_msg>Incorrect setup of epoch line in RINEX output.<commit_after>#pragma ident \"$Id: \/\/depot\/sgl\/gpstk\/dev\/apps\/receiver\/AshtechMessage.cpp#1 $\"\n\n\/**\n * @file AshtechMessage.cpp\n * Containers for Ashtech data, conversions to RINEX - definitions.\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\/\/============================================================================\n\/\/\n\/\/This software developed by Applied Research Laboratories at the University of\n\/\/Texas at Austin, under contract to an agency or agencies within the U.S.\n\/\/Department of Defense. The U.S. Government retains all rights to use,\n\/\/duplicate, distribute, disclose, or release this software.\n\/\/\n\/\/Pursuant to DoD Directive 523024\n\/\/\n\/\/ DISTRIBUTION STATEMENT A: This software has been approved for public\n\/\/ release, distribution is unlimited.\n\/\/\n\/\/=============================================================================\n \n#include <string>\n#include <iostream>\n#include <iomanip>\n#include <string.h>\n\n#include \"BinUtils.hpp\"\n#include \"StringUtils.hpp\"\n#include \"DayTime.hpp\"\n#include \"EngEphemeris.hpp\"\n#include \"RinexObsHeader.hpp\"\n#include \"icd_200_constants.hpp\"\n#include \"AshtechMessage.hpp\"\n\nstatic bool debug=false;\n\nnamespace gpstk\n{\n\n static const double CFF=C_GPS_M\/OSC_FREQ;\n static const double wl1=CFF\/L1_MULT;\n static const double wl2=CFF\/L2_MULT;\n\n AshtechMessage::AshtechMessage(const std::string& ibuff, ObsSource src, \n ObsFormat fmt)\n : msgSource(src), msgFormat(fmt), buffer(ibuff)\n {\n using namespace std;\n \n \/\/ Determine the type of observation\n string label=buffer.substr(0,3);\n if (label==\"MCA\") msgType = MCA;\n if (label==\"MCL\") msgType = MCL;\n if (label==\"MP1\") msgType = MP1;\n if (label==\"MP2\") msgType = MP2;\n if (label==\"MPC\") msgType = MPC; \n if (label==\"PBN\") msgType = PBEN;\n if (label==\"SNV\") msgType = SNAV;\n if (label==\"EPB\") msgType = EPB;\n if (label==\"SAL\") msgType = SALM;\n if (label==\"ALB\") msgType = ALB;\n if (label==\"ION\") msgType = ION;\n }\n\n bool AshtechMessage::isObs(void) const\n {\n return ( (msgType==MCA) || (msgType==MCL) || (msgType==MP1) ||\n (msgType==MP2) || (msgType==MPC) );\n }\n\n int AshtechMessage::getSequence(void) const\n {\n int result=-1;\n\n if ((msgType == MPC) && (msgFormat == ASCII))\n {\n result= \n StringUtils::asInt(StringUtils::word(buffer,1,','));\n } \n \n return result;\n }\n\n int AshtechMessage::getPRN(void) const\n {\n int result=-1;\n\n if ((msgType == MPC) && (msgFormat == ASCII)) \n {\n result= \n StringUtils::asInt(StringUtils::word(buffer,3,','));\n } \n\n if (msgType==EPB)\n {\n result=StringUtils::asInt(buffer.substr(4,5));\n } \n \n return result;\n }\n\n int AshtechMessage::getTracker(void) const\n {\n int result=-1;\n\n if ((msgType == MPC) && (msgFormat == ASCII))\n {\n result= \n StringUtils::asInt(StringUtils::word(buffer,6,','));\n } \n \n return result;\n }\n\n DayTime AshtechMessage::getEpoch(const DayTime& prevTime) const\n {\n short oldweek = prevTime.GPSfullweek();\n short newweek = oldweek;\n \n double oldsow = prevTime.GPSsecond();\n double newsow;\n\n DayTime thisTime(prevTime);\n\n if ((msgType == PBEN)&&(msgFormat == ASCII))\n {\n newsow = \n StringUtils::asDouble(StringUtils::word(buffer,1,','));\n\n \/\/ A test for week rollover\n if ((newsow+6*DayTime::SEC_DAY)<oldsow)\n newweek++;\n\n thisTime = DayTime(newweek, newsow);\n }\n\n if ((msgType == MPC)&&(msgFormat == ASCII))\n {\n int seqDiff = getSequence() - calculateSequenceNumber(prevTime);\n \/\/ Nominally seqDiff should be small. Check if there is a rollover\n \/\/ between the two inputs sequences numbers.\n while (seqDiff > (1800*50\/2))\n\t\tseqDiff -= 1800*50;\n\n thisTime.addMilliSeconds(50 * seqDiff);\n }\n\n return thisTime;\n }\n\n float AshtechMessage::engSNR(short value, float equivalentNoiseBW)\n {\n const int n = 20000; \/\/ number of samples in 1 ms\n const float m = 4.14; \/\/ magnitude of the carrier estimate;\n\n const float d = gpstk::PI\/(n*n*m*m*4.0); \n float snr;\n\n if (value)\n {\n snr = exp(((float)value)\/25.0);\n snr = snr*snr*equivalentNoiseBW*d;\n snr = 10 * log10(snr);\n }\n else\n snr = 0;\n\n return snr;\n }\n \n\n RinexObsData \n AshtechMessage::convertToRinexObsData(\n const std::list<AshtechMessage> obsMsgs, \n const DayTime& recentEpoch) \n throw(gpstk::Exception)\n {\n RinexObsData rod;\n \/\/ TODO: Should check to make sure this is really a PBEN\n DayTime epoch;\n std::list<AshtechMessage>::const_iterator first = obsMsgs.begin();\n epoch = (*first).getEpoch(recentEpoch);\n\n rod.time = epoch;\n rod.numSvs = 0;\n rod.epochFlag = 0;\n\n std::list<AshtechMessage>::const_iterator i;\n for (i=obsMsgs.begin(); i!=obsMsgs.end(); i++)\n {\n if ((i->msgType == MPC)&&(i->msgFormat == ASCII))\n {\n \n int prn = StringUtils::asInt( StringUtils::word(i->buffer,3,','));\n double C1 = StringUtils::asDouble( StringUtils::word(i->buffer,13,',')) * C_GPS_M \/ 1000.0;\n double P1 = StringUtils::asDouble( StringUtils::word(i->buffer,23,',')) * C_GPS_M \/ 1000.0;\n double P2 = StringUtils::asDouble( StringUtils::word(i->buffer,33,',')) * C_GPS_M \/ 1000.0;\n double L1 = StringUtils::asDouble( StringUtils::word(i->buffer,22,','));\n double L2 = StringUtils::asDouble( StringUtils::word(i->buffer,32,','));\n double D1 = StringUtils::asDouble( StringUtils::word(i->buffer,24,','));\n double D2 = StringUtils::asDouble( StringUtils::word(i->buffer,34,','));\n int snrL1 = StringUtils::asInt( StringUtils::word(i->buffer,20,','));\n int snrL2 = StringUtils::asInt( StringUtils::word(i->buffer,30,','));\n\n int warning = StringUtils::asInt( StringUtils::word(i->buffer,27,','));\n\n double S1 = engSNR(snrL1, 9.21e6);\n double S2 = engSNR(snrL2, 9.21e6);\n\n \/\/ Debug check\n \/\/ std::cout << prn << \" \" << D1 << \" \" << D2 << \" \" << L1 << \" \" << L2 << std::endl;\n \/\/ exit(0);\n\n RinexPrn thisSat(prn, systemGPS);\n RinexObsData::RinexObsTypeMap datamap;\n\n datamap[RinexObsHeader::C1].data = C1; \n datamap[RinexObsHeader::P1].data = P1; \n datamap[RinexObsHeader::P2].data = P2;\n datamap[RinexObsHeader::L1].data = L1;\n datamap[RinexObsHeader::L2].data = L2;\n datamap[RinexObsHeader::D1].data = -D1; \/\/ Note sign convention for Doppler is opposite that of RINEX.\n datamap[RinexObsHeader::D2].data = -D2;\n datamap[RinexObsHeader::S1].data = S1; \n datamap[RinexObsHeader::S2].data = S2;\n \n datamap[RinexObsHeader::L1].lli = 0;\n datamap[RinexObsHeader::L2].lli = 0;\n if (warning & 128) \n {\n datamap[RinexObsHeader::L1].lli = 1; \n datamap[RinexObsHeader::L2].lli = 1; \n }\n\n datamap[RinexObsHeader::L1].ssi = mapSNRtoSSI(snrL1);\n datamap[RinexObsHeader::L2].ssi = mapSNRtoSSI(snrL2); \n \n rod.obs[thisSat]=datamap;\n rod.numSvs++;\n }\n \n }\n\n return rod; \n }\n\n int AshtechMessage::calculateSequenceNumber(const DayTime& t)\n {\n \/\/ TODO: Throw if not a MBEN\n double secondsOfHour = t.minute()*60+t.second();\n double secondsOfSequence = secondsOfHour;\n while (secondsOfSequence >= 1800.) \n secondsOfSequence -= 1800.;\n double milliSecondsOfSequence = secondsOfSequence*1000.;\n \/\/ There is sequence tick every 50 milliseconds\n return (int)(milliSecondsOfSequence \/ 50.);\n }\n\n short AshtechMessage::mapSNRtoSSI(float snr)\n {\n if (snr>34) return 9;\n if (snr>29) return 8;\n if (snr>20) return 5;\n if (snr>10) return 1;\n return 0;\n }\n\n RinexNavData AshtechMessage::convertToRinexNavData(const AshtechMessage& msg, const DayTime& epoch)\n {\n \/\/ TODO: throw if not an EPB type\n using namespace BinUtils;\n\n int offset=5;\n const char *dptr = msg.buffer.data();\n\n EngEphemeris eph;\n short PRN = StringUtils::asInt(msg.buffer.substr(4,2));\n\n long subframe[30];\n\n \/\/using namespace std;\n \n for (int i=0;i<30;i++)\n {\n subframe[i]=*((long *)(dptr+7+i*4));\n#if BYTE_ORDER == LITTLE_ENDIAN\n BinUtils::twiddle(subframe[i]);\n#endif\n \/\/ cout << \"Word \" << dec << i << \": 0x\" << hex << subframe[i] << endl << flush << dec;\n }\n \n\/\/ TODO: throw an exception if these calls fail\n eph.addSubframe(subframe, epoch.GPSfullweek(), PRN, 0);\n \/\/ cout << \"sf1\" << endl << flush;\n \n eph.addSubframe(subframe+10, epoch.GPSfullweek(), PRN, 0);\n \/\/ cout << \"sf2\" << endl << flush;\n\n eph.addSubframe(subframe+20, epoch.GPSfullweek(), PRN, 0);\n \/\/ cout << \"sf3\" << endl << flush;\n\n \/\/ eph.dump(std::cout);\n\n \/\/ exit(0);\n \n return eph;\n \/\/return RinexNavData();\n }\n\n void AshtechMessage::updateNavHeader(const AshtechMessage& ionMsg, RinexNavHeader& hdr)\n { \n \/\/ TODO: the ION message interpreter is broken. Make it work. Then have the main programm\n \/\/ regularly request an ION msg.\n\n\n \/\/ TODO: Throw if not an ION type... hmm, need an ASSERT macro for types\n using namespace BinUtils;\n using namespace std;\n\n \/\/ Offset between location in the buffer and the location defined in the\n \/\/ Ashtech document ZFamily.pdf -- ZFamily GPS Receivers, Technical Ref. Manual, dated 2002\n int offset=5;\n const char *dptr = ionMsg.buffer.data();\n \n \/\/ Alpha parameters of Klobuchar model-------------------------------------------------\n float alpha0, alpha1, alpha2, alpha3;\n \n memmove(&alpha0, dptr+offset+0, 4); \n memmove(&alpha1, dptr+offset+4, 4); \n memmove(&alpha2, dptr+offset+8, 4); \n memmove(&alpha3, dptr+offset+12, 4);\n\n#if BYTE_ORDER == LITTLE_ENDIAN\n twiddle(alpha0);\n twiddle(alpha1);\n twiddle(alpha2);\n twiddle(alpha3);\n#endif\n\n hdr.ionAlpha[0] = alpha0;\n hdr.ionAlpha[1] = alpha1;\n hdr.ionAlpha[2] = alpha2;\n hdr.ionAlpha[3] = alpha3;\n\n hdr.valid |= RinexNavHeader::ionAlphaValid;\n\n \/\/ Beta parameters of Klobuchar model-------------------------------------------------\n float beta0, beta1, beta2, beta3;\n \n memmove(&beta0, dptr+offset+16, 4); \n memmove(&beta1, dptr+offset+20, 4); \n memmove(&beta2, dptr+offset+24, 4); \n memmove(&beta3, dptr+offset+28, 4); \n\n#if BYTE_ORDER == LITTLE_ENDIAN\n twiddle(beta0);\n twiddle(beta1);\n twiddle(beta2);\n twiddle(beta3);\n#endif\n\n hdr.ionBeta[0] = beta0;\n hdr.ionBeta[1] = beta1;\n hdr.ionBeta[2] = beta2;\n hdr.ionBeta[3] = beta3;\n\n hdr.valid |= RinexNavHeader::ionBetaValid;\n \n \/\/ Ref time parameters of Klobuchar model-------------------------------------------------\n\n double A0, A1;\n long UTCseconds;\n short UTCweek;\n \n memmove(&A1, dptr+offset+32, 8);\n memmove(&A0, dptr+offset+40, 8);\n memmove(&UTCseconds, dptr+offset+48, 4);\n memmove(&UTCweek, dptr+offset+52, 2);\n \n#if BYTE_ORDER == LITTLE_ENDIAN\n twiddle(A1);\n twiddle(A0);\n twiddle(UTCseconds);\n twiddle(UTCweek);\n#endif\n \n hdr.A0 = A0;\n hdr.A1 = A1;\n hdr.UTCRefWeek = UTCweek;\n hdr.UTCRefTime = UTCseconds;\n \n hdr.valid |= RinexNavHeader::deltaUTCValid;\n \n \/\/ Leap seconds --------------------------------------------------------------------------\n \n short leapSeconds;\n \n memmove(&leapSeconds, dptr+52, 2);\n\n#if BYTE_ORDER == LITTLE_ENDIAN\n twiddle(leapSeconds);\n#endif\n\n hdr.leapSeconds = leapSeconds;\n\n hdr.valid |= RinexNavHeader::leapSecondsValid; \n\n return; \n }\n \n} \/\/ End namespace\n<|endoftext|>"} {"text":"<commit_before>\/****************************************************************************\n**\n** Copyright (C) 2010 Nokia Corporation and\/or its subsidiary(-ies).\n** All rights reserved.\n** Contact: Nokia Corporation (qt-info@nokia.com)\n**\n** This file is part of the Qt Mobility Components.\n**\n** $QT_BEGIN_LICENSE:BSD$\n** You may use this file under the terms of the BSD license as follows:\n**\n** \"Redistribution and use in source and binary forms, with or without\n** modification, are permitted provided that the following conditions are\n** met:\n** * Redistributions of source code must retain the above copyright\n** notice, this list of conditions and the following disclaimer.\n** * Redistributions in binary form must reproduce the above copyright\n** notice, this list of conditions and the following disclaimer in\n** the documentation and\/or other materials provided with the\n** distribution.\n** * Neither the name of Nokia Corporation and its Subsidiary(-ies) nor\n** the names of its contributors may be used to endorse or promote\n** products derived from this software without specific prior written\n** permission.\n**\n** THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS\n** \"AS IS\" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT\n** LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR\n** A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT\n** OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,\n** SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT\n** LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,\n** DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY\n** THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT\n** (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE\n** OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.\"\n** $QT_END_LICENSE$\n**\n****************************************************************************\/\n\n#include \"remoteselector.h\"\n\n#include <QApplication>\n\nint main(int argc, char *argv[])\n{\n QApplication app(argc, argv);\n\n RemoteSelector d;\n QObject::connect(&d, SIGNAL(accepted()), &app, SLOT(quit()));\n d.startDiscovery();\n d.show();\n\n app.exec();\n\n return 0;\n}\n\n<commit_msg>Symbian: make btfiletransfer example application fullscreen on Symbian<commit_after>\/****************************************************************************\n**\n** Copyright (C) 2010 Nokia Corporation and\/or its subsidiary(-ies).\n** All rights reserved.\n** Contact: Nokia Corporation (qt-info@nokia.com)\n**\n** This file is part of the Qt Mobility Components.\n**\n** $QT_BEGIN_LICENSE:BSD$\n** You may use this file under the terms of the BSD license as follows:\n**\n** \"Redistribution and use in source and binary forms, with or without\n** modification, are permitted provided that the following conditions are\n** met:\n** * Redistributions of source code must retain the above copyright\n** notice, this list of conditions and the following disclaimer.\n** * Redistributions in binary form must reproduce the above copyright\n** notice, this list of conditions and the following disclaimer in\n** the documentation and\/or other materials provided with the\n** distribution.\n** * Neither the name of Nokia Corporation and its Subsidiary(-ies) nor\n** the names of its contributors may be used to endorse or promote\n** products derived from this software without specific prior written\n** permission.\n**\n** THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS\n** \"AS IS\" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT\n** LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR\n** A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT\n** OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,\n** SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT\n** LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,\n** DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY\n** THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT\n** (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE\n** OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.\"\n** $QT_END_LICENSE$\n**\n****************************************************************************\/\n\n#include \"remoteselector.h\"\n\n#include <QApplication>\n\nint main(int argc, char *argv[])\n{\n QApplication app(argc, argv);\n\n RemoteSelector d;\n QObject::connect(&d, SIGNAL(accepted()), &app, SLOT(quit()));\n d.startDiscovery();\n#ifdef Q_OS_SYMBIAN\n d.showFullScreen();\n#else\n d.show();\n#endif\n\n app.exec();\n\n return 0;\n}\n\n<|endoftext|>"} {"text":"<commit_before>\/******************************************************************************\n* Copyright (c) 2012, Howard Butler (hobu.inc@gmail.com)\n*\n* All rights reserved.\n*\n* Redistribution and use in source and binary forms, with or without\n* modification, are permitted provided that the following\n* conditions are met:\n*\n* * Redistributions of source code must retain the above copyright\n* notice, this list of conditions and the following disclaimer.\n* * Redistributions in binary form must reproduce the above copyright\n* notice, this list of conditions and the following disclaimer in\n* the documentation and\/or other materials provided\n* with the distribution.\n* * Neither the name of Hobu, Inc. or Flaxen Geo Consulting nor the\n* names of its contributors may be used to endorse or promote\n* products derived from this software without specific prior\n* written permission.\n*\n* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS\n* \"AS IS\" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT\n* LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS\n* FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE\n* COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT,\n* INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING,\n* BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS\n* OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED\n* AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,\n* OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT\n* OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY\n* OF SUCH DAMAGE.\n****************************************************************************\/\n\n#ifndef INCLUDED_PDAL_MACROS_HPP\n#define INCLUDED_PDAL_MACROS_HPP\n\n#include <pdal\/pdal_internal.hpp>\n\/\/\n\/\/ macros for creating the various stage types\n\/\/\n#define MAKE_READER_CREATOR(T, FullT) \\\n pdal::Reader* create_##T(const pdal::Options& options) \\\n { \\\n return new FullT(options); \\\n } \n \n#define MAKE_FILTER_CREATOR(T, FullT) \\\n pdal::Filter* create_##T(pdal::Stage& prevStage, const pdal::Options& options) \\\n { return new FullT(prevStage, options); }\n#define MAKE_MULTIFILTER_CREATOR(T, FullT) \\\n pdal::MultiFilter* create_##T(const std::vector<pdal::Stage*>& prevStages, const pdal::Options& options) \\\n { return new FullT(prevStages, options); }\n#define MAKE_WRITER_CREATOR(T, FullT) \\\n pdal::Writer* create_##T(pdal::Stage& prevStage, const pdal::Options& options) \\\n { return new FullT(prevStage, options); }\n\n\/\/\n\/\/ macros to register the stage creators\n\/\/\n#define REGISTER_WRITER(T, FullT) \\\n registerDriverInfo<FullT>(); \\\n registerWriter(FullT::s_getName(), create_##T)\n#define REGISTER_READER(T, FullT) \\\n registerDriverInfo<FullT>(); \\\n registerReader(FullT::s_getName(), create_##T)\n#define REGISTER_FILTER(T, FullT) \\\n registerDriverInfo<FullT>(); \\\n registerFilter(FullT::s_getName(), create_##T)\n#define REGISTER_MULTIFILTER(T, FullT) \\\n registerDriverInfo<FullT>(); \\\n registerMultiFilter(FullT::s_getName(), create_##T)\n\n#define CREATE_READER_PLUGIN(DriverName, DriverFullType) \\\n PDAL_C_START PDAL_DLL void PDALRegister_reader_##DriverName(void* factory) \\\n { \\\n pdal::StageFactory& f = *(pdal::StageFactory*) factory; \\\n f.registerReader(DriverFullType::s_getName(), create_##DriverName##Reader); \\\n } \\\n PDAL_C_END \n\n#define CREATE_FILTER_PLUGIN(DriverName, DriverFullType) \\\n PDAL_C_START PDAL_DLL void PDALRegister_filter_##DriverName(void* factory) \\\n { \\\n pdal::StageFactory& f = *(pdal::StageFactory*) factory; \\\n f.registerFilter(DriverFullType::s_getName(), create_##DriverName##Filter); \\\n } \\\n PDAL_C_END \n\n#define CREATE_MULTIFILTER_PLUGIN(DriverName, DriverFullType) \\\n PDAL_C_START PDAL_DLL void PDALRegister_multifilter_##DriverName(void* factory) \\\n { \\\n pdal::StageFactory& f = *(pdal::StageFactory*) factory; \\\n f.registerMultiFilter(DriverFullType::s_getName(), create_##DriverName##MultiFilter); \\\n } \\\n PDAL_C_END \n\n#define CREATE_WRITER_PLUGIN(DriverName, DriverFullType) \\\n PDAL_C_START PDAL_DLL void PDALRegister_writer_##DriverName(void* factory) \\\n { \\\n pdal::StageFactory& f = *(pdal::StageFactory*) factory; \\\n f.registerWriter(DriverFullType::s_getName(), create_##DriverName##Writer); \\\n } \\\n PDAL_C_END \n\n#endif\n<commit_msg>register driver info when we register Stages to factory<commit_after>\/******************************************************************************\n* Copyright (c) 2012, Howard Butler (hobu.inc@gmail.com)\n*\n* All rights reserved.\n*\n* Redistribution and use in source and binary forms, with or without\n* modification, are permitted provided that the following\n* conditions are met:\n*\n* * Redistributions of source code must retain the above copyright\n* notice, this list of conditions and the following disclaimer.\n* * Redistributions in binary form must reproduce the above copyright\n* notice, this list of conditions and the following disclaimer in\n* the documentation and\/or other materials provided\n* with the distribution.\n* * Neither the name of Hobu, Inc. or Flaxen Geo Consulting nor the\n* names of its contributors may be used to endorse or promote\n* products derived from this software without specific prior\n* written permission.\n*\n* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS\n* \"AS IS\" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT\n* LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS\n* FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE\n* COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT,\n* INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING,\n* BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS\n* OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED\n* AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,\n* OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT\n* OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY\n* OF SUCH DAMAGE.\n****************************************************************************\/\n\n#ifndef INCLUDED_PDAL_MACROS_HPP\n#define INCLUDED_PDAL_MACROS_HPP\n\n#include <pdal\/pdal_internal.hpp>\n\/\/\n\/\/ macros for creating the various stage types\n\/\/\n#define MAKE_READER_CREATOR(T, FullT) \\\n pdal::Reader* create_##T(const pdal::Options& options) \\\n { \\\n return new FullT(options); \\\n } \n \n#define MAKE_FILTER_CREATOR(T, FullT) \\\n pdal::Filter* create_##T(pdal::Stage& prevStage, const pdal::Options& options) \\\n { return new FullT(prevStage, options); }\n#define MAKE_MULTIFILTER_CREATOR(T, FullT) \\\n pdal::MultiFilter* create_##T(const std::vector<pdal::Stage*>& prevStages, const pdal::Options& options) \\\n { return new FullT(prevStages, options); }\n#define MAKE_WRITER_CREATOR(T, FullT) \\\n pdal::Writer* create_##T(pdal::Stage& prevStage, const pdal::Options& options) \\\n { return new FullT(prevStage, options); }\n\n\/\/\n\/\/ macros to register the stage creators\n\/\/\n#define REGISTER_WRITER(T, FullT) \\\n registerDriverInfo<FullT>(); \\\n registerWriter(FullT::s_getName(), create_##T)\n#define REGISTER_READER(T, FullT) \\\n registerDriverInfo<FullT>(); \\\n registerReader(FullT::s_getName(), create_##T)\n#define REGISTER_FILTER(T, FullT) \\\n registerDriverInfo<FullT>(); \\\n registerFilter(FullT::s_getName(), create_##T)\n#define REGISTER_MULTIFILTER(T, FullT) \\\n registerDriverInfo<FullT>(); \\\n registerMultiFilter(FullT::s_getName(), create_##T)\n\n#define CREATE_READER_PLUGIN(DriverName, DriverFullType) \\\n PDAL_C_START PDAL_DLL void PDALRegister_reader_##DriverName(void* factory) \\\n { \\\n pdal::StageFactory& f = *(pdal::StageFactory*) factory; \\\n f.registerDriverInfo< DriverFullType>(); \\\n f.registerReader(DriverFullType::s_getName(), create_##DriverName##Reader); \\\n } \\\n PDAL_C_END \n\n#define CREATE_FILTER_PLUGIN(DriverName, DriverFullType) \\\n PDAL_C_START PDAL_DLL void PDALRegister_filter_##DriverName(void* factory) \\\n { \\\n pdal::StageFactory& f = *(pdal::StageFactory*) factory; \\\n f.registerDriverInfo< DriverFullType>(); \\\n f.registerFilter(DriverFullType::s_getName(), create_##DriverName##Filter); \\\n } \\\n PDAL_C_END \n\n#define CREATE_MULTIFILTER_PLUGIN(DriverName, DriverFullType) \\\n PDAL_C_START PDAL_DLL void PDALRegister_multifilter_##DriverName(void* factory) \\\n { \\\n pdal::StageFactory& f = *(pdal::StageFactory*) factory; \\\n f.registerDriverInfo< DriverFullType>(); \\\n f.registerMultiFilter(DriverFullType::s_getName(), create_##DriverName##MultiFilter); \\\n } \\\n PDAL_C_END \n\n#define CREATE_WRITER_PLUGIN(DriverName, DriverFullType) \\\n PDAL_C_START PDAL_DLL void PDALRegister_writer_##DriverName(void* factory) \\\n { \\\n pdal::StageFactory& f = *(pdal::StageFactory*) factory; \\\n f.registerDriverInfo< DriverFullType>(); \\\n f.registerWriter(DriverFullType::s_getName(), create_##DriverName##Writer); \\\n } \\\n PDAL_C_END \n\n#endif\n<|endoftext|>"} {"text":"<commit_before>#include \"stdafx.h\"\n#include \"MarshalingTest.h\"\n#include \"EventInputStream.h\"\n#include \"EventOutputStream.h\"\n#include \"Decompose.h\"\n#include \"uuid.h\"\n\n \n\/*\nEXTRA SPECS to code to that have not yet been implemented as unit tests.\n\n1. Sender and Client each import the same header file which defines a UUID event.\n2. Sender encodes UUID of its event in the serialized stream\n3. Client reads UUID and args, and reverse-look ups the correct memfn to call the memfn\n4. Client gracefully handles receiving UUID events it can't reverse lookup\n5. EVERYONE should know when you change ANY identifying properties of a DECLARE_UUID\nyou must change the UUID as well or you will get version incompatilibity erros.\nExtra points for figuring out how to enforce this.\n\nOther Goals:\nBroader SFINAE: force server and client to define their own Autoserialize or Autodeserialized\nIf the types aren't POD. At the very least, tests need to be written which violate the \n\"I can do everything with stringstreams\" implementation currently passing\n*\/\n\nDECLARE_UUID(EventWithUuid, \"6EC2129F-5DD7-43D5-ACB5-864E8BB5D6B4\") :\n public virtual EventReceiver\n{\npublic:\n virtual void SampleEventFiring(const std::string* str) = 0;\n virtual void SampleEventFiring0(void) = 0;\n virtual void SampleEventFiring3(const std::string* str1, const std::string* str2, const std::string* str3) = 0;\n virtual Deferred SampleEventDeferred(const std::string* str) = 0;\n};\n\nclass ListenerForUuid :\n public CoreThread,\n public EventWithUuid\n{\npublic:\n ListenerForUuid(void) :\n m_called(false)\n {\n \/\/Need to call ready here. Should be refactored out of existence.\n }\n\n bool m_called;\n std::string m_str;\n\n void SampleEventFiring0() override {\n m_called = true;\n }\n\n void SampleEventFiring(const std::string* str) override {\n m_called = true;\n m_str = *str;\n }\n\n void SampleEventFiring3(const std::string* str1, const std::string* str2, const std::string* str3) override {\n m_called = true;\n }\n\n Deferred SampleEventDeferred(const std::string* str) override {\n return Deferred(this);\n }\n};\n\ntemplate<class T>\nvoid VerifyProperStreamReceipt(EventOutputStream<T>* os, const AutoFired<EventWithUuid>& ewuuid) {\n \/\/ Register our expected event type:\n os->template EnableIdentity(&EventWithUuid::SampleEventFiring);\n\n \/\/ Test fire an event:\n std::string str(\"012345678900123456789012345678901234567890\");\n ewuuid(&EventWithUuid::SampleEventFiring)(&str);\n\n \/\/ Verify that the output stream is no longer empty and has some default properties:\n EXPECT_FALSE(os->IsEmpty()) << \"An output stream on an event was empty, even though an event it should have caught was just fired\";\n EXPECT_LT(0UL, os->GetSize()) << \"The output stream should have had more than zero bytes in it after recording an event, but it did not\";\n\n \/\/ Verify that the output stream is _at least as long_ as the string argument we passed earlier:\n EXPECT_LE(str.size(), os->GetSize()) << \"An output stream contained fewer uncompressed bytes than were transmitted in a fired event\";\n}\n\ntemplate<class T>\nvoid VerifyProperStreamReceiptZeroArgs(EventOutputStream<T>* os, const AutoFired<EventWithUuid>& ewuuid) {\n \/\/ Register our expected event type:\n os->template EnableIdentity(&EventWithUuid::SampleEventFiring0);\n\n \/\/ Test fire an event:\n ewuuid(&EventWithUuid::SampleEventFiring0)();\n\n \/\/ Verify that the output stream is no longer empty and has some default properties:\n EXPECT_FALSE(os->IsEmpty()) << \"0Args: An output stream on an event was empty, even though an event it should have caught was just fired\";\n EXPECT_LT(0UL, os->GetSize()) << \"0Args: The output stream should have had more than zero bytes in it after recording an event, but it did not\";\n}\n\ntemplate<class T>\nvoid VerifyProperStreamReceiptThreeArgs(EventOutputStream<T>* os, const AutoFired<EventWithUuid>& ewuuid) {\n \/\/ Register our expected event type:\n os->template EnableIdentity(&EventWithUuid::SampleEventFiring3);\n\n \/\/ Test fire an event:\n std::string str1(\"012345678900123456789012345678901234567890\");\n std::string str2(\"012345678900123456789012345678901234567890\");\n std::string str3(\"012345678900123456789012345678901234567890\");\n ewuuid(&EventWithUuid::SampleEventFiring3)(&str1, &str2, &str3);\n\n \/\/ Verify that the output stream is no longer empty and has some default properties:\n EXPECT_FALSE(os->IsEmpty()) << \"3Args: An output stream on an event was empty, even though an event it should have caught was just fired\";\n EXPECT_LT(0UL, os->GetSize()) << \"3Args: The output stream should have had more than zero bytes in it after recording an event, but it did not\";\n\n \/\/ Verify that the output stream is _at least as long_ as the string argument we passed earlier:\n EXPECT_LE(str1.size() * 3, os->GetSize()) << \"3Args: An output stream contained fewer uncompressed bytes than were transmitted in a fired event\";\n}\n\nTEST_F(MarshalingTest, VerifyListenersUpdated) {\n AutoFired<EventWithUuid> ewuuid;\n EXPECT_FALSE(ewuuid.HasListeners()) << \"A newly created event incorrectly reported that listeners existed where none were subscribed\";\n\n AutoCurrentContext ctxt;\n std::shared_ptr<EventOutputStream<EventWithUuid>> os = ctxt->CreateEventOutputStream<EventWithUuid>();\n ASSERT_NE(nullptr, os.get()) << \"Attempted to obtain an event stream from a context, but the returned pointer was null\";\n\n \/\/ Should be listeners now:\n EXPECT_TRUE(ewuuid.HasListeners()) << \"An output stream creation did not change the HasListeners disposition\";\n os.reset();\n\n EXPECT_FALSE(ewuuid.HasListeners()) << \"An event incorrectly reported that it had listeners, even though its only listener--an output stream--is out of scope\";\n}\n\nTEST_F(MarshalingTest, VerifyOutOfOrderFiring) {\n \/\/ We should be able to create an output stream on an event even if nobody fires this event right now\n AutoCurrentContext ctxt;\n std::shared_ptr<EventOutputStream<EventWithUuid>> os = ctxt->CreateEventOutputStream<EventWithUuid>();\n ASSERT_NE(nullptr, os.get()) << \"Failed to create an output stream in a context where no firers of the underlying event exist\";\n\n \/\/ Verify that we get stream reciept even if we fire at _this_ point, after the stream exists\n VerifyProperStreamReceipt(os.get(), AutoFired<EventWithUuid>());\n}\n\nTEST_F(MarshalingTest, VerifySimpleSerialization) {\n AutoFired<EventWithUuid> ewuuid;\n\n AutoCurrentContext ctxt;\n std::shared_ptr<EventOutputStream<EventWithUuid>> os = ctxt->CreateEventOutputStream<EventWithUuid>();\n\n ASSERT_NE(nullptr, os.get());\n\n \/\/ Should be empty before we fire anything:\n EXPECT_TRUE(os->IsEmpty()) << \"Output stream was empty, even though it was just created\";\n EXPECT_EQ(0UL, os->GetSize()) << \"Output stream reported \" << os->GetSize() << \" bytes contained, it should have been empty\";\n\n \/\/ Scoping behavior\n VerifyProperStreamReceipt(os.get(), ewuuid);\n os->Reset();\n VerifyProperStreamReceiptZeroArgs(os.get(), ewuuid);\n os->Reset();\n VerifyProperStreamReceiptThreeArgs(os.get(), ewuuid);\n \/\/ Flush the output stream and verify it does, in fact, reset its properties:\n os->Reset();\n EXPECT_TRUE(os->IsEmpty()) << \"Output stream was not empty after being reset\";\n\n \/\/ Let the output stream fall out of scope and verify that the listener existence disposition is updated:\n os.reset();\n EXPECT_FALSE(ewuuid.HasListeners()) << \"An event incorrectly reported that it had listeners, even though its only listener--an output stream--is out of scope\";\n}\n\nTEST_F(MarshalingTest, VerifySimpleDeserialization) {\n AutoCurrentContext ctxt;\n\n \/\/ Serialize a fired event first:\n AutoFired<EventWithUuid> ewuuid;\n std::shared_ptr<EventOutputStream<EventWithUuid>> os = ctxt->CreateEventOutputStream<EventWithUuid>();\n ASSERT_NE(nullptr, os.get());\n\n std::string helloWorld = \"Hello, world!\";\n std::string helloWorldAgain = \"Hello, world, again!\";\n \n ewuuid(&EventWithUuid::SampleEventFiring)(&helloWorld);\n ewuuid(&EventWithUuid::SampleEventFiring)(&helloWorldAgain);\n ASSERT_FALSE(os->IsEmpty());\n \n \/\/ Inject the listener into the context:\n AutoRequired<ListenerForUuid> listener;\n \n ASSERT_TRUE(listener->m_str.empty()) << \"Listener unexpectedly received messages fired before its construction\";\n \n \/\/ Now we create an input stream and use it to replay events from the output stream:\n std::shared_ptr<EventInputStream<EventWithUuid>> is = ctxt->CreateEventInputStream<EventWithUuid>();\n ASSERT_NE(nullptr, is.get()) << \"Event input stream was empty\";\n \n \/\/ Register our expected event type:\n is->template EnableIdentity(&EventWithUuid::SampleEventFiring);\n is->template EnableIdentity(&EventWithUuid::SampleEventDeferred);\n \n const void* ptr = os->GetData(); \/\/This is damn unsafe. Who is supposed to be doing cleanup?\n size_t nRemaining = os->GetSize();\n size_t advanceBy = is->FireSingle(ptr, nRemaining);\n \n ASSERT_NE(0UL, advanceBy) << \"Input stream did not correctly report the number of bytes deserialized\";\n ASSERT_LE(advanceBy, nRemaining) << \"Input stream processed more bytes from the passed buffer than were available for processing\";\n \n \/\/ Verify that the listener got _something_, and the thing it got was the thing we sent earlier:\n EXPECT_TRUE(listener->m_called) << \"Listener failed to receive any events from the event input stream\";\n EXPECT_EQ(helloWorld, listener->m_str) << \"Listener received an event, but the payload of the event was not the same as what was originally serialized\";\n \n \/\/ Clear, advance, and fire the next event:\n listener->m_called = false;\n listener->m_str.clear();\n (char*&) ptr += advanceBy;\n nRemaining -= advanceBy;\n advanceBy = is->FireSingle(ptr, nRemaining);\n ASSERT_NE(0UL, advanceBy) << \"A second attempt to fire an event failed to parse any bytes\";\n ASSERT_LE(advanceBy, nRemaining) << \"Input stream overran its buffer for the second fired event\";\n \n \/\/ Now verify that we got called again:\n ASSERT_TRUE(listener->m_called) << \"Second event was not received from the event input stream\";\n ASSERT_EQ(helloWorldAgain, listener->m_str) << \"Listener did not receive the second message payload from the input stream\";\n\n \/\/ Ensure that we processed EXACTLY the number of bytes that were in the output stream:\n EXPECT_EQ(advanceBy, nRemaining) << \"Output stream wrote extraneous bytes to its buffer which were not used during deserialization\";\n}\n<commit_msg>Added test checking no reversing of multi-ary funcs. Currently fails<commit_after>#include \"stdafx.h\"\n#include \"MarshalingTest.h\"\n#include \"EventInputStream.h\"\n#include \"EventOutputStream.h\"\n#include \"Decompose.h\"\n#include \"uuid.h\"\n\n \n\/*\nEXTRA SPECS to code to that have not yet been implemented as unit tests.\n\n1. Sender and Client each import the same header file which defines a UUID event.\n2. Sender encodes UUID of its event in the serialized stream\n3. Client reads UUID and args, and reverse-look ups the correct memfn to call the memfn\n4. Client gracefully handles receiving UUID events it can't reverse lookup\n5. EVERYONE should know when you change ANY identifying properties of a DECLARE_UUID\nyou must change the UUID as well or you will get version incompatilibity erros.\nExtra points for figuring out how to enforce this.\n\nOther Goals:\nBroader SFINAE: force server and client to define their own Autoserialize or Autodeserialized\nIf the types aren't POD. At the very least, tests need to be written which violate the \n\"I can do everything with stringstreams\" implementation currently passing\n*\/\n\nDECLARE_UUID(EventWithUuid, \"6EC2129F-5DD7-43D5-ACB5-864E8BB5D6B4\") :\n public virtual EventReceiver\n{\npublic:\n virtual void SampleEventFiring(const std::string* str) = 0;\n virtual void SampleEventFiring0(void) = 0;\n virtual void SampleEventFiring3(const std::string* str1, const std::string* str2, const std::string* str3) = 0;\n virtual Deferred SampleEventDeferred(const std::string* str) = 0;\n};\n\nclass ListenerForUuid :\n public CoreThread,\n public EventWithUuid\n{\npublic:\n ListenerForUuid(void) :\n m_called(false)\n {\n \/\/Need to call ready here. Should be refactored out of existence.\n }\n\n bool m_called;\n std::string m_str;\n std::string m_str2;\n std::string m_str3;\n\n void SampleEventFiring0() override {\n m_called = true;\n }\n\n void SampleEventFiring(const std::string* str) override {\n m_called = true;\n m_str = *str;\n }\n\n void SampleEventFiring3(const std::string* str1, const std::string* str2, const std::string* str3) override {\n m_called = true;\n m_str = *str1;\n m_str2 = *str2;\n m_str3 = *str3;\n }\n\n Deferred SampleEventDeferred(const std::string* str) override {\n return Deferred(this);\n }\n};\n\ntemplate<class T>\nvoid VerifyProperStreamReceipt(EventOutputStream<T>* os, const AutoFired<EventWithUuid>& ewuuid) {\n \/\/ Register our expected event type:\n os->template EnableIdentity(&EventWithUuid::SampleEventFiring);\n\n \/\/ Test fire an event:\n std::string str(\"012345678900123456789012345678901234567890\");\n ewuuid(&EventWithUuid::SampleEventFiring)(&str);\n\n \/\/ Verify that the output stream is no longer empty and has some default properties:\n EXPECT_FALSE(os->IsEmpty()) << \"An output stream on an event was empty, even though an event it should have caught was just fired\";\n EXPECT_LT(0UL, os->GetSize()) << \"The output stream should have had more than zero bytes in it after recording an event, but it did not\";\n\n \/\/ Verify that the output stream is _at least as long_ as the string argument we passed earlier:\n EXPECT_LE(str.size(), os->GetSize()) << \"An output stream contained fewer uncompressed bytes than were transmitted in a fired event\";\n}\n\ntemplate<class T>\nvoid VerifyProperStreamReceiptZeroArgs(EventOutputStream<T>* os, const AutoFired<EventWithUuid>& ewuuid) {\n \/\/ Register our expected event type:\n os->template EnableIdentity(&EventWithUuid::SampleEventFiring0);\n\n \/\/ Test fire an event:\n ewuuid(&EventWithUuid::SampleEventFiring0)();\n\n \/\/ Verify that the output stream is no longer empty and has some default properties:\n EXPECT_FALSE(os->IsEmpty()) << \"0Args: An output stream on an event was empty, even though an event it should have caught was just fired\";\n EXPECT_LT(0UL, os->GetSize()) << \"0Args: The output stream should have had more than zero bytes in it after recording an event, but it did not\";\n}\n\ntemplate<class T>\nvoid VerifyProperStreamReceiptThreeArgs(EventOutputStream<T>* os, const AutoFired<EventWithUuid>& ewuuid) {\n \/\/ Register our expected event type:\n os->template EnableIdentity(&EventWithUuid::SampleEventFiring3);\n\n \/\/ Test fire an event:\n std::string str1(\"012345678900123456789012345678901234567890\");\n std::string str2(\"012345678900123456789012345678901234567890\");\n std::string str3(\"012345678900123456789012345678901234567890\");\n ewuuid(&EventWithUuid::SampleEventFiring3)(&str1, &str2, &str3);\n\n \/\/ Verify that the output stream is no longer empty and has some default properties:\n EXPECT_FALSE(os->IsEmpty()) << \"3Args: An output stream on an event was empty, even though an event it should have caught was just fired\";\n EXPECT_LT(0UL, os->GetSize()) << \"3Args: The output stream should have had more than zero bytes in it after recording an event, but it did not\";\n\n \/\/ Verify that the output stream is _at least as long_ as the string argument we passed earlier:\n EXPECT_LE(str1.size() * 3, os->GetSize()) << \"3Args: An output stream contained fewer uncompressed bytes than were transmitted in a fired event\";\n}\n\nTEST_F(MarshalingTest, VerifyListenersUpdated) {\n AutoFired<EventWithUuid> ewuuid;\n EXPECT_FALSE(ewuuid.HasListeners()) << \"A newly created event incorrectly reported that listeners existed where none were subscribed\";\n\n AutoCurrentContext ctxt;\n std::shared_ptr<EventOutputStream<EventWithUuid>> os = ctxt->CreateEventOutputStream<EventWithUuid>();\n ASSERT_NE(nullptr, os.get()) << \"Attempted to obtain an event stream from a context, but the returned pointer was null\";\n\n \/\/ Should be listeners now:\n EXPECT_TRUE(ewuuid.HasListeners()) << \"An output stream creation did not change the HasListeners disposition\";\n os.reset();\n\n EXPECT_FALSE(ewuuid.HasListeners()) << \"An event incorrectly reported that it had listeners, even though its only listener--an output stream--is out of scope\";\n}\n\nTEST_F(MarshalingTest, VerifyOutOfOrderFiring) {\n \/\/ We should be able to create an output stream on an event even if nobody fires this event right now\n AutoCurrentContext ctxt;\n std::shared_ptr<EventOutputStream<EventWithUuid>> os = ctxt->CreateEventOutputStream<EventWithUuid>();\n ASSERT_NE(nullptr, os.get()) << \"Failed to create an output stream in a context where no firers of the underlying event exist\";\n\n \/\/ Verify that we get stream reciept even if we fire at _this_ point, after the stream exists\n VerifyProperStreamReceipt(os.get(), AutoFired<EventWithUuid>());\n}\n\nTEST_F(MarshalingTest, VerifySimpleSerialization) {\n AutoFired<EventWithUuid> ewuuid;\n\n AutoCurrentContext ctxt;\n std::shared_ptr<EventOutputStream<EventWithUuid>> os = ctxt->CreateEventOutputStream<EventWithUuid>();\n\n ASSERT_NE(nullptr, os.get());\n\n \/\/ Should be empty before we fire anything:\n EXPECT_TRUE(os->IsEmpty()) << \"Output stream was empty, even though it was just created\";\n EXPECT_EQ(0UL, os->GetSize()) << \"Output stream reported \" << os->GetSize() << \" bytes contained, it should have been empty\";\n\n \/\/ Scoping behavior\n VerifyProperStreamReceipt(os.get(), ewuuid);\n os->Reset();\n VerifyProperStreamReceiptZeroArgs(os.get(), ewuuid);\n os->Reset();\n VerifyProperStreamReceiptThreeArgs(os.get(), ewuuid);\n \/\/ Flush the output stream and verify it does, in fact, reset its properties:\n os->Reset();\n EXPECT_TRUE(os->IsEmpty()) << \"Output stream was not empty after being reset\";\n\n \/\/ Let the output stream fall out of scope and verify that the listener existence disposition is updated:\n os.reset();\n EXPECT_FALSE(ewuuid.HasListeners()) << \"An event incorrectly reported that it had listeners, even though its only listener--an output stream--is out of scope\";\n}\n\nTEST_F(MarshalingTest, VerifySimpleDeserialization) {\n AutoCurrentContext ctxt;\n\n \/\/ Serialize a fired event first:\n AutoFired<EventWithUuid> ewuuid;\n std::shared_ptr<EventOutputStream<EventWithUuid>> os = ctxt->CreateEventOutputStream<EventWithUuid>();\n ASSERT_NE(nullptr, os.get());\n\n std::string helloWorld = \"Hello, world!\";\n std::string helloWorldAgain = \"Hello, world, again!\";\n std::string helloWorldYetAgain = \"Hello, world, yet again!\";\n \n ewuuid(&EventWithUuid::SampleEventFiring)(&helloWorld);\n ewuuid(&EventWithUuid::SampleEventFiring)(&helloWorldAgain);\n ewuuid(&EventWithUuid::SampleEventFiring3)(&helloWorld, &helloWorldAgain, &helloWorldYetAgain);\n ASSERT_FALSE(os->IsEmpty());\n \n \/\/ Inject the listener into the context:\n AutoRequired<ListenerForUuid> listener;\n \n ASSERT_TRUE(listener->m_str.empty()) << \"Listener unexpectedly received messages fired before its construction\";\n \n \/\/ Now we create an input stream and use it to replay events from the output stream:\n std::shared_ptr<EventInputStream<EventWithUuid>> is = ctxt->CreateEventInputStream<EventWithUuid>();\n ASSERT_NE(nullptr, is.get()) << \"Event input stream was empty\";\n \n \/\/ Register our expected event type:\n is->template EnableIdentity(&EventWithUuid::SampleEventFiring3);\n is->template EnableIdentity(&EventWithUuid::SampleEventFiring);\n is->template EnableIdentity(&EventWithUuid::SampleEventDeferred);\n \n const void* ptr = os->GetData(); \/\/This is damn unsafe. Who is supposed to be doing cleanup?\n size_t nRemaining = os->GetSize();\n size_t advanceBy = is->FireSingle(ptr, nRemaining);\n \n ASSERT_NE(0UL, advanceBy) << \"Input stream did not correctly report the number of bytes deserialized\";\n ASSERT_LE(advanceBy, nRemaining) << \"Input stream processed more bytes from the passed buffer than were available for processing\";\n \n \/\/ Verify that the listener got _something_, and the thing it got was the thing we sent earlier:\n EXPECT_TRUE(listener->m_called) << \"Listener failed to receive any events from the event input stream\";\n EXPECT_EQ(helloWorld, listener->m_str) << \"Listener received an event, but the payload of the event was not the same as what was originally serialized\";\n \n \/\/ Clear, advance, and fire the next event:\n listener->m_called = false;\n listener->m_str.clear();\n (char*&) ptr += advanceBy;\n nRemaining -= advanceBy;\n advanceBy = is->FireSingle(ptr, nRemaining);\n ASSERT_NE(0UL, advanceBy) << \"A second attempt to fire an event failed to parse any bytes\";\n ASSERT_LE(advanceBy, nRemaining) << \"Input stream overran its buffer for the second fired event\";\n \n \/\/ Now verify that we got called again:\n ASSERT_TRUE(listener->m_called) << \"Second event was not received from the event input stream\";\n ASSERT_EQ(helloWorldAgain, listener->m_str) << \"Listener did not receive the second message payload from the input stream\";\n\n \/\/ Clear, advance, and fire the next event:\n listener->m_called = false;\n listener->m_str.clear();\n (char*&)ptr += advanceBy;\n nRemaining -= advanceBy;\n advanceBy = is->FireSingle(ptr, nRemaining);\n ASSERT_NE(0UL, advanceBy) << \"A third attempt to fire an event failed to parse any bytes\";\n ASSERT_LE(advanceBy, nRemaining) << \"Input stream overran its buffer for the third fired event\";\n\n \/\/ Now verify that we got called again:\n ASSERT_TRUE(listener->m_called) << \"Second event was not received from the event input stream\";\n ASSERT_EQ(helloWorld, listener->m_str) << \"Listener did not receive the third message payload, 1 arg, from the input stream\";\n ASSERT_EQ(helloWorldAgain, listener->m_str2) << \"Listener did not receive the third message payload, 2 arg, from the input stream\";\n ASSERT_EQ(helloWorldYetAgain, listener->m_str3) << \"Listener did not receive the third message payload, 3 arg, from the input stream\";\n\n \/\/ Ensure that we processed EXACTLY the number of bytes that were in the output stream:\n EXPECT_EQ(advanceBy, nRemaining) << \"Output stream wrote extraneous bytes to its buffer which were not used during deserialization\";\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 2014 Cloudius Systems\n *\/\n\n#pragma once\n\n#include <seastar\/core\/future.hh>\n#include <seastar\/util\/std-compat.hh>\n#include <exception>\n\nnamespace seastar {\n\n\/\/\/ \\addtogroup fiber-module\n\/\/\/ @{\n\n\/\/\/ Exception thrown when a \\ref gate object has been closed\n\/\/\/ by the \\ref gate::close() method.\nclass gate_closed_exception : public std::exception {\npublic:\n virtual const char* what() const noexcept override {\n return \"gate closed\";\n }\n};\n\n\/\/\/ Facility to stop new requests, and to tell when existing requests are done.\n\/\/\/\n\/\/\/ When stopping a service that serves asynchronous requests, we are faced with\n\/\/\/ two problems: preventing new requests from coming in, and knowing when existing\n\/\/\/ requests have completed. The \\c gate class provides a solution.\nclass gate {\n size_t _count = 0;\n std::optional<promise<>> _stopped;\npublic:\n gate() = default;\n gate(const gate&) = delete;\n gate(gate&&) = default;\n ~gate() {\n assert(!_count && \"gate destroyed with outstanding requests\");\n }\n \/\/\/ Tries to register an in-progress request.\n \/\/\/\n \/\/\/ If the gate is not closed, the request is registered and the function returns `true`,\n \/\/\/ Otherwise the function just returns `false` and has no other effect.\n bool try_enter() noexcept {\n bool opened = !_stopped;\n if (opened) {\n ++_count;\n }\n return opened;\n }\n \/\/\/ Registers an in-progress request.\n \/\/\/\n \/\/\/ If the gate is not closed, the request is registered. Otherwise,\n \/\/\/ a \\ref gate_closed_exception is thrown.\n void enter() {\n if (!try_enter()) {\n throw gate_closed_exception();\n }\n }\n \/\/\/ Unregisters an in-progress request.\n \/\/\/\n \/\/\/ If the gate is closed, and there are no more in-progress requests,\n \/\/\/ the `_stopped` promise will be fulfilled.\n void leave() noexcept {\n --_count;\n if (!_count && _stopped) {\n _stopped->set_value();\n }\n }\n \/\/\/ Potentially stop an in-progress request.\n \/\/\/\n \/\/\/ If the gate is already closed, a \\ref gate_closed_exception is thrown.\n \/\/\/ By using \\ref enter() and \\ref leave(), the program can ensure that\n \/\/\/ no further requests are serviced. However, long-running requests may\n \/\/\/ continue to run. The check() method allows such a long operation to\n \/\/\/ voluntarily stop itself after the gate is closed, by making calls to\n \/\/\/ check() in appropriate places. check() with throw an exception and\n \/\/\/ bail out of the long-running code if the gate is closed.\n void check() {\n if (_stopped) {\n throw gate_closed_exception();\n }\n }\n \/\/\/ Closes the gate.\n \/\/\/\n \/\/\/ Future calls to \\ref enter() will fail with an exception, and when\n \/\/\/ all current requests call \\ref leave(), the returned future will be\n \/\/\/ made ready.\n future<> close() noexcept {\n assert(!_stopped && \"seastar::gate::close() cannot be called more than once\");\n _stopped = std::make_optional(promise<>());\n if (!_count) {\n _stopped->set_value();\n }\n return _stopped->get_future();\n }\n\n \/\/\/ Returns a current number of registered in-progress requests.\n size_t get_count() const noexcept {\n return _count;\n }\n\n \/\/\/ Returns whether the gate is closed.\n bool is_closed() const noexcept {\n return bool(_stopped);\n }\n};\n\nnamespace internal {\n\ntemplate <typename Func>\ninline\nauto\ninvoke_func_with_gate(gate& g, Func&& func) noexcept {\n return futurize_invoke(std::forward<Func>(func)).finally([&g] { g.leave(); });\n}\n\n} \/\/ namespace intgernal\n\n\/\/\/ Executes the function \\c func making sure the gate \\c g is properly entered\n\/\/\/ and later on, properly left.\n\/\/\/\n\/\/\/ \\param func function to be executed\n\/\/\/ \\param g the gate. Caller must make sure that it outlives this function.\n\/\/\/ \\returns whatever \\c func returns\n\/\/\/\n\/\/\/ \\relates gate\ntemplate <typename Func>\ninline\nauto\nwith_gate(gate& g, Func&& func) {\n g.enter();\n return internal::invoke_func_with_gate(g, std::forward<Func>(func));\n}\n\n\/\/\/ Executes the function \\c func if the gate \\c g can be entered\n\/\/\/ and later on, properly left.\n\/\/\/\n\/\/\/ \\param func function to be executed\n\/\/\/ \\param g the gate. Caller must make sure that it outlives this function.\n\/\/\/\n\/\/\/ If the gate is already closed, an exception future holding\n\/\/\/ \\ref gate_closed_exception is returned, otherwise\n\/\/\/ \\returns whatever \\c func returns.\n\/\/\/\n\/\/\/ \\relates gate\ntemplate <typename Func>\ninline\nauto\ntry_with_gate(gate& g, Func&& func) noexcept {\n if (!g.try_enter()) {\n using futurator = futurize<std::result_of_t<Func()>>;\n return futurator::make_exception_future(gate_closed_exception());\n }\n return internal::invoke_func_with_gate(g, std::forward<Func>(func));\n}\n\/\/\/ @}\n\n}\n<commit_msg>gate: add default move assignment operator<commit_after>\/*\n * This file is open source software, licensed to you under the terms\n * of the Apache License, Version 2.0 (the \"License\"). See the NOTICE file\n * distributed with this work for additional information regarding copyright\n * ownership. You may not use this file except in compliance with the License.\n *\n * You may obtain a copy of the License at\n *\n * http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing,\n * software distributed under the License is distributed on an\n * \"AS IS\" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY\n * KIND, either express or implied. See the License for the\n * specific language governing permissions and limitations\n * under the License.\n *\/\n\/*\n * Copyright 2014 Cloudius Systems\n *\/\n\n#pragma once\n\n#include <seastar\/core\/future.hh>\n#include <seastar\/util\/std-compat.hh>\n#include <exception>\n\nnamespace seastar {\n\n\/\/\/ \\addtogroup fiber-module\n\/\/\/ @{\n\n\/\/\/ Exception thrown when a \\ref gate object has been closed\n\/\/\/ by the \\ref gate::close() method.\nclass gate_closed_exception : public std::exception {\npublic:\n virtual const char* what() const noexcept override {\n return \"gate closed\";\n }\n};\n\n\/\/\/ Facility to stop new requests, and to tell when existing requests are done.\n\/\/\/\n\/\/\/ When stopping a service that serves asynchronous requests, we are faced with\n\/\/\/ two problems: preventing new requests from coming in, and knowing when existing\n\/\/\/ requests have completed. The \\c gate class provides a solution.\nclass gate {\n size_t _count = 0;\n std::optional<promise<>> _stopped;\npublic:\n gate() = default;\n gate(const gate&) = delete;\n gate(gate&&) = default;\n gate& operator=(gate&&) = default;\n ~gate() {\n assert(!_count && \"gate destroyed with outstanding requests\");\n }\n \/\/\/ Tries to register an in-progress request.\n \/\/\/\n \/\/\/ If the gate is not closed, the request is registered and the function returns `true`,\n \/\/\/ Otherwise the function just returns `false` and has no other effect.\n bool try_enter() noexcept {\n bool opened = !_stopped;\n if (opened) {\n ++_count;\n }\n return opened;\n }\n \/\/\/ Registers an in-progress request.\n \/\/\/\n \/\/\/ If the gate is not closed, the request is registered. Otherwise,\n \/\/\/ a \\ref gate_closed_exception is thrown.\n void enter() {\n if (!try_enter()) {\n throw gate_closed_exception();\n }\n }\n \/\/\/ Unregisters an in-progress request.\n \/\/\/\n \/\/\/ If the gate is closed, and there are no more in-progress requests,\n \/\/\/ the `_stopped` promise will be fulfilled.\n void leave() noexcept {\n --_count;\n if (!_count && _stopped) {\n _stopped->set_value();\n }\n }\n \/\/\/ Potentially stop an in-progress request.\n \/\/\/\n \/\/\/ If the gate is already closed, a \\ref gate_closed_exception is thrown.\n \/\/\/ By using \\ref enter() and \\ref leave(), the program can ensure that\n \/\/\/ no further requests are serviced. However, long-running requests may\n \/\/\/ continue to run. The check() method allows such a long operation to\n \/\/\/ voluntarily stop itself after the gate is closed, by making calls to\n \/\/\/ check() in appropriate places. check() with throw an exception and\n \/\/\/ bail out of the long-running code if the gate is closed.\n void check() {\n if (_stopped) {\n throw gate_closed_exception();\n }\n }\n \/\/\/ Closes the gate.\n \/\/\/\n \/\/\/ Future calls to \\ref enter() will fail with an exception, and when\n \/\/\/ all current requests call \\ref leave(), the returned future will be\n \/\/\/ made ready.\n future<> close() noexcept {\n assert(!_stopped && \"seastar::gate::close() cannot be called more than once\");\n _stopped = std::make_optional(promise<>());\n if (!_count) {\n _stopped->set_value();\n }\n return _stopped->get_future();\n }\n\n \/\/\/ Returns a current number of registered in-progress requests.\n size_t get_count() const noexcept {\n return _count;\n }\n\n \/\/\/ Returns whether the gate is closed.\n bool is_closed() const noexcept {\n return bool(_stopped);\n }\n};\n\nnamespace internal {\n\ntemplate <typename Func>\ninline\nauto\ninvoke_func_with_gate(gate& g, Func&& func) noexcept {\n return futurize_invoke(std::forward<Func>(func)).finally([&g] { g.leave(); });\n}\n\n} \/\/ namespace intgernal\n\n\/\/\/ Executes the function \\c func making sure the gate \\c g is properly entered\n\/\/\/ and later on, properly left.\n\/\/\/\n\/\/\/ \\param func function to be executed\n\/\/\/ \\param g the gate. Caller must make sure that it outlives this function.\n\/\/\/ \\returns whatever \\c func returns\n\/\/\/\n\/\/\/ \\relates gate\ntemplate <typename Func>\ninline\nauto\nwith_gate(gate& g, Func&& func) {\n g.enter();\n return internal::invoke_func_with_gate(g, std::forward<Func>(func));\n}\n\n\/\/\/ Executes the function \\c func if the gate \\c g can be entered\n\/\/\/ and later on, properly left.\n\/\/\/\n\/\/\/ \\param func function to be executed\n\/\/\/ \\param g the gate. Caller must make sure that it outlives this function.\n\/\/\/\n\/\/\/ If the gate is already closed, an exception future holding\n\/\/\/ \\ref gate_closed_exception is returned, otherwise\n\/\/\/ \\returns whatever \\c func returns.\n\/\/\/\n\/\/\/ \\relates gate\ntemplate <typename Func>\ninline\nauto\ntry_with_gate(gate& g, Func&& func) noexcept {\n if (!g.try_enter()) {\n using futurator = futurize<std::result_of_t<Func()>>;\n return futurator::make_exception_future(gate_closed_exception());\n }\n return internal::invoke_func_with_gate(g, std::forward<Func>(func));\n}\n\/\/\/ @}\n\n}\n<|endoftext|>"} {"text":"<commit_before>\/\/ Copyright (c) 2017 Shota SUGIHARA\n\/\/ Distributed under the MIT License.\n#include <iostream>\n#include <boost\/format.hpp>\n#include <Eigen\/Dense>\n#include \"condition.h\"\n#include \"grid.h\"\n#include \"particles.h\"\n\n\/\/ Sample code using TinyMPS library.\nint main() {\n tiny_mps::Condition condition(\".\/input\/input_cavitation.data\");\n tiny_mps::Particles particles(\".\/input\/input.grid\", condition);\n tiny_mps::Timer timer(condition);\n Eigen::Vector3d minpos(-0.02, -0.00042, 0);\n Eigen::Vector3d maxpos(0.02, 0.05, 0);\n while(particles.nextLoop(\".\/output\/output_%1%.vtk\", timer)) {\n particles.moveInflowParticles(timer);\n particles.calculateTemporaryVelocity(condition.gravity, timer);\n particles.updateTemporaryPosition(timer);\n particles.giveCollisionRepulsionForce();\n particles.updateTemporaryPosition(timer);\n particles.calculateTemporaryParticleNumberDensity();\n particles.checkSurfaceParticlesWithTanakaMasunaga();\n particles.solvePressurePoission(timer);\n particles.correctVelocity(timer);\n particles.updateTemporaryPosition(timer);\n particles.updateVelocityAndPosition();\n particles.removeOutsideParticles(minpos, maxpos);\n }\n}<commit_msg>Modified cavi_analysis<commit_after>\/\/ Copyright (c) 2017 Shota SUGIHARA\n\/\/ Distributed under the MIT License.\n#include <iostream>\n#include <boost\/format.hpp>\n#include <Eigen\/Dense>\n#include \"condition.h\"\n#include \"grid.h\"\n#include \"particles.h\"\n\n\/\/ Sample code using TinyMPS library.\nint main() {\n tiny_mps::Condition condition(\".\/input\/input_cavitation.data\");\n tiny_mps::Particles particles(\".\/input\/input.grid\", condition);\n tiny_mps::Timer timer(condition);\n Eigen::Vector3d minpos(-0.02, -0.1, 0);\n Eigen::Vector3d maxpos(0.02, 0.05, 0);\n while(particles.nextLoop(\".\/output\/output_%1%.vtk\", timer)) {\n particles.moveInflowParticles(timer);\n particles.calculateTemporaryVelocity(condition.gravity, timer);\n particles.updateTemporaryPosition(timer);\n particles.giveCollisionRepulsionForce();\n particles.updateTemporaryPosition(timer);\n particles.calculateTemporaryParticleNumberDensity();\n particles.checkSurfaceParticlesWithTanakaMasunaga();\n particles.solvePressurePoission(timer);\n particles.correctVelocity(timer);\n particles.updateTemporaryPosition(timer);\n particles.updateVelocityAndPosition();\n particles.removeOutsideParticles(minpos, maxpos);\n }\n}<|endoftext|>"} {"text":"<commit_before>\/\/=============================================================================================================\n\/**\n* @file main.cpp\n* @author Lorenz Esch Lorenz Esch <Lorenz.Esch@tu-ilmenau.de>;\n* Lorenz Esch <lorenz.esch@tu-ilmenau.de>;\n* Matti Hamalainen <msh@nmr.mgh.harvard.edu>\n* @version 1.0\n* @date July, 2016\n*\n* @section LICENSE\n*\n* Copyright (C) 2016, Lorenz Esch 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 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 Example of using the MNE-CPP Disp3D library\n*\n*\/\n\n\n\/\/*************************************************************************************************************\n\/\/=============================================================================================================\n\/\/ INCLUDES\n\/\/=============================================================================================================\n\n#include <disp3D\/view3D.h>\n#include <disp3D\/control\/control3dwidget.h>\n#include <disp3D\/3DObjects\/brain\/brainrtsourcelocdatatreeitem.h>\n\n#include <fs\/label.h>\n#include <fs\/surfaceset.h>\n#include <fs\/annotationset.h>\n\n#include <fiff\/fiff_evoked.h>\n#include <fiff\/fiff.h>\n#include <fiff\/fiff_dig_point_set.h>\n#include <mne\/mne.h>\n\n#include <mne\/mne.h>\n#include <mne\/mne_epoch_data_list.h>\n#include <mne\/mne_sourceestimate.h>\n\n#include <inverse\/minimumNorm\/minimumnorm.h>\n\n#include <utils\/mnemath.h>\n\n#include <iostream>\n\n\n\/\/*************************************************************************************************************\n\/\/=============================================================================================================\n\/\/ QT INCLUDES\n\/\/=============================================================================================================\n\n#include <QApplication>\n#include <QMainWindow>\n#include <QCommandLineParser>\n\n\n\/\/*************************************************************************************************************\n\/\/=============================================================================================================\n\/\/ USED NAMESPACES\n\/\/=============================================================================================================\n\nusing namespace DISP3DLIB;\nusing namespace MNELIB;\nusing namespace FSLIB;\nusing namespace FIFFLIB;\nusing namespace INVERSELIB;\nusing namespace UTILSLIB;\n\n\n\/\/*************************************************************************************************************\n\/\/=============================================================================================================\n\/\/ MAIN\n\/\/=============================================================================================================\n\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 QApplication a(argc, argv);\n\n \/\/ Command Line Parser\n QCommandLineParser parser;\n parser.setApplicationDescription(\"Disp3D Example\");\n parser.addHelpOption();\n QCommandLineOption surfOption(\"surfType\", \"Surface type <type>.\", \"type\", \"orig\");\n QCommandLineOption annotOption(\"annotType\", \"Annotation type <type>.\", \"type\", \"aparc.a2009s\");\n QCommandLineOption hemiOption(\"hemi\", \"Selected hemisphere <hemi>.\", \"hemi\", \"2\");\n QCommandLineOption subjectOption(\"subject\", \"Selected subject <subject>.\", \"subject\", \"sample\");\n QCommandLineOption subjectPathOption(\"subjectPath\", \"Selected subject path <subjectPath>.\", \"subjectPath\", \".\/MNE-sample-data\/subjects\");\n QCommandLineOption sourceLocOption(\"doSourceLoc\", \"Do real time source localization <doSourceLoc>.\", \"doSourceLoc\", \"true\");\n QCommandLineOption fwdOption(\"fwd\", \"Path to forwad solution <file>.\", \"file\", \".\/MNE-sample-data\/MEG\/sample\/sample_audvis-meg-eeg-oct-6-fwd.fif\");\n QCommandLineOption invOpOption(\"inv\", \"Path to inverse operator <file>.\", \"file\", \"\");\n QCommandLineOption clustOption(\"doClust\", \"Path to clustered inverse operator <doClust>.\", \"doClust\", \"true\");\n QCommandLineOption covFileOption(\"cov\", \"Path to the covariance <file>.\", \"file\", \".\/MNE-sample-data\/MEG\/sample\/sample_audvis-cov.fif\");\n QCommandLineOption evokedFileOption(\"ave\", \"Path to the evoked\/average <file>.\", \"file\", \".\/MNE-sample-data\/MEG\/sample\/sample_audvis-ave.fif\");\n QCommandLineOption methodOption(\"method\", \"Inverse estimation <method>, i.e., 'MNE', 'dSPM' or 'sLORETA'.\", \"method\", \"dSPM\");\/\/\"MNE\" | \"dSPM\" | \"sLORETA\"\n QCommandLineOption snrOption(\"snr\", \"The SNR value used for computation <snr>.\", \"snr\", \"3.0\");\/\/3.0f;\/\/0.1f;\/\/3.0f;\n QCommandLineOption evokedIndexOption(\"aveIdx\", \"The average <index> to choose from the average file.\", \"index\", \"0\");\n\n parser.addOption(surfOption);\n parser.addOption(annotOption);\n parser.addOption(hemiOption);\n parser.addOption(subjectOption);\n parser.addOption(subjectPathOption);\n parser.addOption(sourceLocOption);\n parser.addOption(fwdOption);\n parser.addOption(invOpOption);\n parser.addOption(clustOption);\n parser.addOption(covFileOption);\n parser.addOption(evokedFileOption);\n parser.addOption(methodOption);\n parser.addOption(snrOption);\n parser.addOption(evokedIndexOption);\n parser.process(a);\n\n bool bAddRtSourceLoc = parser.value(sourceLocOption) == \"false\" ? false : true;\n bool bDoClustering = parser.value(clustOption) == \"false\" ? false : true;\n\n \/\/Inits\n SurfaceSet tSurfSet (parser.value(subjectOption), parser.value(hemiOption).toInt(), parser.value(surfOption), parser.value(subjectPathOption));\n AnnotationSet tAnnotSet (parser.value(subjectOption), parser.value(hemiOption).toInt(), parser.value(annotOption), parser.value(subjectPathOption));\n\n QFile t_fileFwd(parser.value(fwdOption));\n MNEForwardSolution t_Fwd(t_fileFwd);\n MNEForwardSolution t_clusteredFwd;\n\n QString t_sFileClusteredInverse(parser.value(invOpOption));\n\n QFile t_fileCov(parser.value(covFileOption));\n QFile t_fileEvoked(parser.value(evokedFileOption));\n\n \/\/########################################################################################\n \/\/\n \/\/ Source Estimate START\n \/\/\n \/\/########################################################################################\n\n \/\/ Load data\n QPair<QVariant, QVariant> baseline(QVariant(), 0);\n MNESourceEstimate sourceEstimate;\n FiffEvoked evoked(t_fileEvoked, parser.value(evokedIndexOption).toInt(), baseline);\n\n if(bAddRtSourceLoc) {\n double snr = parser.value(snrOption).toDouble();\n double lambda2 = 1.0 \/ pow(snr, 2);\n QString method(parser.value(methodOption));\n\n \/\/ Load data\n QPair<QVariant, QVariant> baseline(QVariant(), 0);\n FiffEvoked evoked(t_fileEvoked, 0, baseline);\n t_fileEvoked.close();\n if(evoked.isEmpty())\n return 1;\n\n std::cout << std::endl;\n std::cout << \"Evoked description: \" << evoked.comment.toLatin1().constData() << std::endl;\n\n if(t_Fwd.isEmpty())\n return 1;\n\n FiffCov noise_cov(t_fileCov);\n\n \/\/ regularize noise covariance\n noise_cov = noise_cov.regularize(evoked.info, 0.05, 0.05, 0.1, true);\n\n \/\/\n \/\/ Cluster forward solution;\n \/\/\n if(bDoClustering) {\n t_clusteredFwd = t_Fwd.cluster_forward_solution(tAnnotSet, 40);\n } else {\n t_clusteredFwd = t_Fwd;\n }\n\n \/\/\n \/\/ make an inverse operators\n \/\/\n FiffInfo info = evoked.info;\n\n MNEInverseOperator inverse_operator(info, t_clusteredFwd, noise_cov, 0.2f, 0.8f);\n\n if(!t_sFileClusteredInverse.isEmpty())\n {\n QFile t_fileClusteredInverse(t_sFileClusteredInverse);\n inverse_operator.write(t_fileClusteredInverse);\n }\n\n \/\/\n \/\/ Compute inverse solution\n \/\/\n MinimumNorm minimumNorm(inverse_operator, lambda2, method);\n sourceEstimate = minimumNorm.calculateInverse(evoked);\n\n if(sourceEstimate.isEmpty())\n return 1;\n\n \/\/ View activation time-series\n std::cout << \"\\nsourceEstimate:\\n\" << sourceEstimate.data.block(0,0,10,10) << std::endl;\n std::cout << \"time\\n\" << sourceEstimate.times.block(0,0,1,10) << std::endl;\n std::cout << \"timeMin\\n\" << sourceEstimate.times[0] << std::endl;\n std::cout << \"timeMax\\n\" << sourceEstimate.times[sourceEstimate.times.size()-1] << std::endl;\n std::cout << \"time step\\n\" << sourceEstimate.tstep << std::endl;\n }\n\n \/\/########################################################################################\n \/\/\n \/\/Source Estimate END\n \/\/\n \/\/########################################################################################\n\n \/\/########################################################################################\n \/\/\n \/\/ Create the test view START\n \/\/\n \/\/########################################################################################\n\n std::cout<<\"Creating BrainView\"<<std::endl;\n\n \/\/Create the 3D view\n View3D::SPtr testWindow = View3D::SPtr(new View3D());\n\n \/\/Add fressurfer surface set including both hemispheres\n testWindow->addSurfaceSet(parser.value(subjectOption), evoked.comment, tSurfSet, tAnnotSet);\n\n \/\/Read and show BEM\n QFile t_fileBem(\".\/MNE-sample-data\/subjects\/sample\/bem\/sample-5120-5120-5120-bem.fif\");\n MNEBem t_Bem(t_fileBem);\n testWindow->addBemData(parser.value(subjectOption), \"BEM\", t_Bem);\n\n \/\/Read and show sensor helmets\n QFile t_filesensorSurfaceVV(\".\/resources\/sensorSurfaces\/306m_rt.fif\");\n MNEBem t_sensorSurfaceVV(t_filesensorSurfaceVV);\n testWindow->addBemData(\"Sensors\", \"VectorView\", t_sensorSurfaceVV);\n\n \/\/ Read & show digitizer points\n QFile t_fileDig(\".\/MNE-sample-data\/MEG\/sample\/sample_audvis-ave.fif\");\n FiffDigPointSet t_Dig(t_fileDig);\n testWindow->addDigitizerData(parser.value(subjectOption), evoked.comment, t_Dig);\n\n if(bAddRtSourceLoc) {\n \/\/Add rt source loc data\n QList<BrainRTSourceLocDataTreeItem*> rtItemList_RV = testWindow->addSourceData(parser.value(subjectOption), evoked.comment, sourceEstimate, t_clusteredFwd);\n\n \/\/Init some rt related values for right visual data\n for(int i = 0; i < rtItemList_RV.size(); ++i) {\n rtItemList_RV.at(i)->setLoopState(true);\n rtItemList_RV.at(i)->setTimeInterval(17);\n rtItemList_RV.at(i)->setNumberAverages(1);\n rtItemList_RV.at(i)->setStreamingActive(true);\n rtItemList_RV.at(i)->setNormalization(QVector3D(0.0,5.5,10));\n rtItemList_RV.at(i)->setVisualizationType(\"Annotation based\");\n rtItemList_RV.at(i)->setColortable(\"Hot\");\n }\n }\n\n testWindow->show();\n\n Control3DWidget::SPtr control3DWidget = Control3DWidget::SPtr(new Control3DWidget());\n control3DWidget->setView3D(testWindow);\n control3DWidget->show();\n\n \/\/########################################################################################\n \/\/\n \/\/ Create the test view END\n \/\/\n \/\/########################################################################################\n\n return a.exec();\n}\n<commit_msg>[SC-128] Fix disp3DTutorial<commit_after>\/\/=============================================================================================================\n\/**\n* @file main.cpp\n* @author Lorenz Esch Lorenz Esch <Lorenz.Esch@tu-ilmenau.de>;\n* Lorenz Esch <lorenz.esch@tu-ilmenau.de>;\n* Matti Hamalainen <msh@nmr.mgh.harvard.edu>\n* @version 1.0\n* @date July, 2016\n*\n* @section LICENSE\n*\n* Copyright (C) 2016, Lorenz Esch 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 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 Example of using the MNE-CPP Disp3D library\n*\n*\/\n\n\n\/\/*************************************************************************************************************\n\/\/=============================================================================================================\n\/\/ INCLUDES\n\/\/=============================================================================================================\n\n#include <disp3D\/view3D.h>\n#include <disp3D\/control\/control3dwidget.h>\n#include <disp3D\/3DObjects\/brain\/brainrtsourcelocdatatreeitem.h>\n\n#include <fs\/label.h>\n#include <fs\/surfaceset.h>\n#include <fs\/annotationset.h>\n\n#include <fiff\/fiff_evoked.h>\n#include <fiff\/fiff.h>\n#include <fiff\/fiff_dig_point_set.h>\n#include <mne\/mne.h>\n\n#include <mne\/mne.h>\n#include <mne\/mne_epoch_data_list.h>\n#include <mne\/mne_sourceestimate.h>\n\n#include <inverse\/minimumNorm\/minimumnorm.h>\n\n#include <utils\/mnemath.h>\n\n#include <iostream>\n\n\n\/\/*************************************************************************************************************\n\/\/=============================================================================================================\n\/\/ QT INCLUDES\n\/\/=============================================================================================================\n\n#include <QApplication>\n#include <QMainWindow>\n#include <QCommandLineParser>\n\n\n\/\/*************************************************************************************************************\n\/\/=============================================================================================================\n\/\/ USED NAMESPACES\n\/\/=============================================================================================================\n\nusing namespace DISP3DLIB;\nusing namespace MNELIB;\nusing namespace FSLIB;\nusing namespace FIFFLIB;\nusing namespace INVERSELIB;\nusing namespace UTILSLIB;\n\n\n\/\/*************************************************************************************************************\n\/\/=============================================================================================================\n\/\/ MAIN\n\/\/=============================================================================================================\n\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 QApplication a(argc, argv);\n\n \/\/ Command Line Parser\n QCommandLineParser parser;\n parser.setApplicationDescription(\"Disp3D Example\");\n parser.addHelpOption();\n QCommandLineOption surfOption(\"surfType\", \"Surface type <type>.\", \"type\", \"orig\");\n QCommandLineOption annotOption(\"annotType\", \"Annotation type <type>.\", \"type\", \"aparc.a2009s\");\n QCommandLineOption hemiOption(\"hemi\", \"Selected hemisphere <hemi>.\", \"hemi\", \"2\");\n QCommandLineOption subjectOption(\"subject\", \"Selected subject <subject>.\", \"subject\", \"sample\");\n QCommandLineOption subjectPathOption(\"subjectPath\", \"Selected subject path <subjectPath>.\", \"subjectPath\", \".\/MNE-sample-data\/subjects\");\n QCommandLineOption sourceLocOption(\"doSourceLoc\", \"Do real time source localization <doSourceLoc>.\", \"doSourceLoc\", \"true\");\n QCommandLineOption fwdOption(\"fwd\", \"Path to forwad solution <file>.\", \"file\", \".\/MNE-sample-data\/MEG\/sample\/sample_audvis-meg-eeg-oct-6-fwd.fif\");\n QCommandLineOption invOpOption(\"inv\", \"Path to inverse operator <file>.\", \"file\", \"\");\n QCommandLineOption clustOption(\"doClust\", \"Path to clustered inverse operator <doClust>.\", \"doClust\", \"true\");\n QCommandLineOption covFileOption(\"cov\", \"Path to the covariance <file>.\", \"file\", \".\/MNE-sample-data\/MEG\/sample\/sample_audvis-cov.fif\");\n QCommandLineOption evokedFileOption(\"ave\", \"Path to the evoked\/average <file>.\", \"file\", \".\/MNE-sample-data\/MEG\/sample\/sample_audvis-ave.fif\");\n QCommandLineOption methodOption(\"method\", \"Inverse estimation <method>, i.e., 'MNE', 'dSPM' or 'sLORETA'.\", \"method\", \"dSPM\");\/\/\"MNE\" | \"dSPM\" | \"sLORETA\"\n QCommandLineOption snrOption(\"snr\", \"The SNR value used for computation <snr>.\", \"snr\", \"3.0\");\/\/3.0f;\/\/0.1f;\/\/3.0f;\n QCommandLineOption evokedIndexOption(\"aveIdx\", \"The average <index> to choose from the average file.\", \"index\", \"0\");\n\n parser.addOption(surfOption);\n parser.addOption(annotOption);\n parser.addOption(hemiOption);\n parser.addOption(subjectOption);\n parser.addOption(subjectPathOption);\n parser.addOption(sourceLocOption);\n parser.addOption(fwdOption);\n parser.addOption(invOpOption);\n parser.addOption(clustOption);\n parser.addOption(covFileOption);\n parser.addOption(evokedFileOption);\n parser.addOption(methodOption);\n parser.addOption(snrOption);\n parser.addOption(evokedIndexOption);\n parser.process(a);\n\n bool bAddRtSourceLoc = parser.value(sourceLocOption) == \"false\" ? false : true;\n bool bDoClustering = parser.value(clustOption) == \"false\" ? false : true;\n\n \/\/Inits\n SurfaceSet tSurfSet (parser.value(subjectOption), parser.value(hemiOption).toInt(), parser.value(surfOption), parser.value(subjectPathOption));\n AnnotationSet tAnnotSet (parser.value(subjectOption), parser.value(hemiOption).toInt(), parser.value(annotOption), parser.value(subjectPathOption));\n\n QFile t_fileFwd(parser.value(fwdOption));\n MNEForwardSolution t_Fwd(t_fileFwd);\n MNEForwardSolution t_clusteredFwd;\n\n QString t_sFileClusteredInverse(parser.value(invOpOption));\n\n QFile t_fileCov(parser.value(covFileOption));\n QFile t_fileEvoked(parser.value(evokedFileOption));\n\n \/\/########################################################################################\n \/\/\n \/\/ Source Estimate START\n \/\/\n \/\/########################################################################################\n\n \/\/ Load data\n QPair<QVariant, QVariant> baseline(QVariant(), 0);\n MNESourceEstimate sourceEstimate;\n FiffEvoked evoked(t_fileEvoked, parser.value(evokedIndexOption).toInt(), baseline);\n\n if(bAddRtSourceLoc) {\n double snr = parser.value(snrOption).toDouble();\n double lambda2 = 1.0 \/ pow(snr, 2);\n QString method(parser.value(methodOption));\n\n \/\/ Load data\n t_fileEvoked.close();\n if(evoked.isEmpty())\n return 1;\n\n std::cout << std::endl;\n std::cout << \"Evoked description: \" << evoked.comment.toLatin1().constData() << std::endl;\n\n if(t_Fwd.isEmpty())\n return 1;\n\n FiffCov noise_cov(t_fileCov);\n\n \/\/ regularize noise covariance\n noise_cov = noise_cov.regularize(evoked.info, 0.05, 0.05, 0.1, true);\n\n \/\/\n \/\/ Cluster forward solution;\n \/\/\n if(bDoClustering) {\n t_clusteredFwd = t_Fwd.cluster_forward_solution(tAnnotSet, 40);\n } else {\n t_clusteredFwd = t_Fwd;\n }\n\n \/\/\n \/\/ make an inverse operators\n \/\/\n FiffInfo info = evoked.info;\n\n MNEInverseOperator inverse_operator(info, t_clusteredFwd, noise_cov, 0.2f, 0.8f);\n\n if(!t_sFileClusteredInverse.isEmpty())\n {\n QFile t_fileClusteredInverse(t_sFileClusteredInverse);\n inverse_operator.write(t_fileClusteredInverse);\n }\n\n \/\/\n \/\/ Compute inverse solution\n \/\/\n MinimumNorm minimumNorm(inverse_operator, lambda2, method);\n sourceEstimate = minimumNorm.calculateInverse(evoked);\n\n if(sourceEstimate.isEmpty())\n return 1;\n\n \/\/ View activation time-series\n std::cout << \"\\nsourceEstimate:\\n\" << sourceEstimate.data.block(0,0,10,10) << std::endl;\n std::cout << \"time\\n\" << sourceEstimate.times.block(0,0,1,10) << std::endl;\n std::cout << \"timeMin\\n\" << sourceEstimate.times[0] << std::endl;\n std::cout << \"timeMax\\n\" << sourceEstimate.times[sourceEstimate.times.size()-1] << std::endl;\n std::cout << \"time step\\n\" << sourceEstimate.tstep << std::endl;\n }\n\n \/\/########################################################################################\n \/\/\n \/\/Source Estimate END\n \/\/\n \/\/########################################################################################\n\n \/\/########################################################################################\n \/\/\n \/\/ Create the test view START\n \/\/\n \/\/########################################################################################\n\n std::cout<<\"Creating BrainView\"<<std::endl;\n\n \/\/Create the 3D view\n View3D::SPtr testWindow = View3D::SPtr(new View3D());\n\n \/\/Add fressurfer surface set including both hemispheres\n testWindow->addSurfaceSet(parser.value(subjectOption), evoked.comment, tSurfSet, tAnnotSet);\n\n \/\/Read and show BEM\n QFile t_fileBem(\".\/MNE-sample-data\/subjects\/sample\/bem\/sample-5120-5120-5120-bem.fif\");\n MNEBem t_Bem(t_fileBem);\n testWindow->addBemData(parser.value(subjectOption), \"BEM\", t_Bem);\n\n \/\/Read and show sensor helmets\n QFile t_filesensorSurfaceVV(\".\/resources\/sensorSurfaces\/306m_rt.fif\");\n MNEBem t_sensorSurfaceVV(t_filesensorSurfaceVV);\n testWindow->addBemData(\"Sensors\", \"VectorView\", t_sensorSurfaceVV);\n\n \/\/ Read & show digitizer points\n QFile t_fileDig(\".\/MNE-sample-data\/MEG\/sample\/sample_audvis-ave.fif\");\n FiffDigPointSet t_Dig(t_fileDig);\n testWindow->addDigitizerData(parser.value(subjectOption), evoked.comment, t_Dig);\n\n if(bAddRtSourceLoc) {\n \/\/Add rt source loc data\n QList<BrainRTSourceLocDataTreeItem*> rtItemList_RV = testWindow->addSourceData(parser.value(subjectOption), evoked.comment, sourceEstimate, t_clusteredFwd);\n\n \/\/Init some rt related values for right visual data\n for(int i = 0; i < rtItemList_RV.size(); ++i) {\n rtItemList_RV.at(i)->setLoopState(true);\n rtItemList_RV.at(i)->setTimeInterval(17);\n rtItemList_RV.at(i)->setNumberAverages(1);\n rtItemList_RV.at(i)->setStreamingActive(true);\n rtItemList_RV.at(i)->setNormalization(QVector3D(0.0,5.5,10));\n rtItemList_RV.at(i)->setVisualizationType(\"Annotation based\");\n rtItemList_RV.at(i)->setColortable(\"Hot\");\n }\n }\n\n testWindow->show();\n\n Control3DWidget::SPtr control3DWidget = Control3DWidget::SPtr(new Control3DWidget());\n control3DWidget->setView3D(testWindow);\n control3DWidget->show();\n\n \/\/########################################################################################\n \/\/\n \/\/ Create the test view END\n \/\/\n \/\/########################################################################################\n\n return a.exec();\n}\n<|endoftext|>"} {"text":"<commit_before>#ifndef TIMING_UTIL_HPP\n#define TIMING_UTIL_HPP\n\n#include <atomic>\n#include <chrono>\n#include <cstdint>\n#include <mutex>\n#include <unordered_map>\n\nnamespace osrm\n{\nnamespace util\n{\n\nstruct GlobalTimer\n{\n GlobalTimer() : time(0) {}\n std::atomic<uint64_t> time;\n};\n\nclass GlobalTimerFactory\n{\n public:\n static GlobalTimerFactory &get()\n {\n static GlobalTimerFactory instance;\n return instance;\n }\n\n GlobalTimer &getGlobalTimer(const std::string &name)\n {\n std::lock_guard<std::mutex> lock(map_mutex);\n return timer_map[name];\n }\n\n private:\n std::mutex map_mutex;\n std::unordered_map<std::string, GlobalTimer> timer_map;\n};\n\n#define GLOBAL_TIMER_AQUIRE(_X) \\\n auto &_X##_global_timer = GlobalTimerFactory::get().getGlobalTimer(#_X)\n#define GLOBAL_TIMER_RESET(_X) _X##_global_timer.time = 0\n#define GLOBAL_TIMER_START(_X) TIMER_START(_X)\n#define GLOBAL_TIMER_STOP(_X) \\\n TIMER_STOP(_X); \\\n _X##_global_timer.time += TIMER_NSEC(_X)\n#define GLOBAL_TIMER_NSEC(_X) static_cast<double>(_X##_global_timer.time)\n#define GLOBAL_TIMER_USEC(_X) (_X##_global_timer.time \/ 1000.0)\n#define GLOBAL_TIMER_MSEC(_X) (_X##_global_timer.time \/ 1000.0 \/ 1000.0)\n#define GLOBAL_TIMER_SEC(_X) (_X##_global_timer.time \/ 1000.0 \/ 1000.0 \/ 1000.0)\n\n#define TIMER_START(_X) auto _X##_start = std::chrono::steady_clock::now(), _X##_stop = _X##_start\n#define TIMER_STOP(_X) _X##_stop = std::chrono::steady_clock::now()\n#define TIMER_NSEC(_X) \\\n std::chrono::duration_cast<std::chrono::nanoseconds>(_X##_stop - _X##_start).count()\n#define TIMER_USEC(_X) \\\n std::chrono::duration_cast<std::chrono::microseconds>(_X##_stop - _X##_start).count()\n#define TIMER_MSEC(_X) \\\n (0.000001 * \\\n std::chrono::duration_cast<std::chrono::nanoseconds>(_X##_stop - _X##_start).count())\n#define TIMER_SEC(_X) \\\n (0.000001 * \\\n std::chrono::duration_cast<std::chrono::microseconds>(_X##_stop - _X##_start).count())\n#define TIMER_MIN(_X) \\\n std::chrono::duration_cast<std::chrono::minutes>(_X##_stop - _X##_start).count()\n}\n}\n\n#endif \/\/ TIMING_UTIL_HPP\n<commit_msg>Remove obsolete timer code<commit_after>#ifndef TIMING_UTIL_HPP\n#define TIMING_UTIL_HPP\n\n#include <chrono>\n#include <cstdint>\n\nnamespace osrm\n{\nnamespace util\n{\n\n#define TIMER_START(_X) auto _X##_start = std::chrono::steady_clock::now(), _X##_stop = _X##_start\n#define TIMER_STOP(_X) _X##_stop = std::chrono::steady_clock::now()\n#define TIMER_NSEC(_X) \\\n std::chrono::duration_cast<std::chrono::nanoseconds>(_X##_stop - _X##_start).count()\n#define TIMER_USEC(_X) \\\n std::chrono::duration_cast<std::chrono::microseconds>(_X##_stop - _X##_start).count()\n#define TIMER_MSEC(_X) \\\n (0.000001 * \\\n std::chrono::duration_cast<std::chrono::nanoseconds>(_X##_stop - _X##_start).count())\n#define TIMER_SEC(_X) \\\n (0.000001 * \\\n std::chrono::duration_cast<std::chrono::microseconds>(_X##_stop - _X##_start).count())\n#define TIMER_MIN(_X) \\\n std::chrono::duration_cast<std::chrono::minutes>(_X##_stop - _X##_start).count()\n}\n}\n\n#endif \/\/ TIMING_UTIL_HPP\n<|endoftext|>"} {"text":"<commit_before>\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\/ DISCLAIMER\n\/\/\/\n\/\/\/ Copyright 2016 ArangoDB GmbH, Cologne, Germany\n\/\/\/\n\/\/\/ Licensed under the Apache License, Version 2.0 (the \"License\");\n\/\/\/ you may not use this file except in compliance with the License.\n\/\/\/ You may obtain a copy of the License at\n\/\/\/\n\/\/\/ http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n\/\/\/\n\/\/\/ Unless required by applicable law or agreed to in writing, software\n\/\/\/ distributed under the License is distributed on an \"AS IS\" BASIS,\n\/\/\/ WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n\/\/\/ See the License for the specific language governing permissions and\n\/\/\/ limitations under the License.\n\/\/\/\n\/\/\/ Copyright holder is ArangoDB GmbH, Cologne, Germany\n\/\/\/\n\/\/\/ @author Simon Grätzer\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n#include \"PregelFeature.h\"\n#include \"ApplicationFeatures\/ApplicationServer.h\"\n#include \"Basics\/MutexLocker.h\"\n#include \"Basics\/ThreadPool.h\"\n#include \"Cluster\/ClusterFeature.h\"\n#include \"Cluster\/ClusterInfo.h\"\n#include \"Pregel\/Conductor.h\"\n#include \"Pregel\/Recovery.h\"\n#include \"Pregel\/Worker.h\"\n\nusing namespace arangodb::pregel;\n\nstatic PregelFeature* Instance;\n\nuint64_t PregelFeature::createExecutionNumber() {\n return ClusterInfo::instance()->uniqid();\n}\n\nPregelFeature::PregelFeature(application_features::ApplicationServer* server)\n : ApplicationFeature(server, \"Pregel\") {\n setOptional(false);\n requiresElevatedPrivileges(false);\n startsAfter(\"Logger\");\n startsAfter(\"Database\");\n startsAfter(\"Endpoint\");\n startsAfter(\"Cluster\");\n}\n\nPregelFeature::~PregelFeature() {\n if (_recoveryManager) {\n _recoveryManager.reset();\n }\n cleanupAll();\n}\n\nPregelFeature* PregelFeature::instance() { return Instance; }\n\nstatic size_t _approxThreadNumber(){\n const size_t procNum = TRI_numberProcessors();\n if (procNum <= 1) return 1;\n else if (procNum <= 16) return procNum \/ 2;\n else return procNum;\/\/ use full performance on cluster\n}\n\nvoid PregelFeature::start() {\n Instance = this;\n\n const size_t threadNum = _approxThreadNumber();\n _threadPool.reset(new basics::ThreadPool(threadNum, \"Pregel\"));\n\n ClusterFeature* cluster =\n application_features::ApplicationServer::getFeature<ClusterFeature>(\n \"Cluster\");\n if (cluster != nullptr) {\n AgencyCallbackRegistry* registry = cluster->agencyCallbackRegistry();\n if (registry != nullptr) {\n _recoveryManager.reset(new RecoveryManager(registry));\n }\n }\n}\n\nvoid PregelFeature::beginShutdown() { cleanupAll(); }\n\nvoid PregelFeature::addExecution(Conductor* const exec,\n uint64_t executionNumber) {\n MUTEX_LOCKER(guard, _mutex);\n \/\/_executions.\n _conductors[executionNumber] = exec;\n}\n\nConductor* PregelFeature::conductor(uint64_t executionNumber) {\n MUTEX_LOCKER(guard, _mutex);\n auto it = _conductors.find(executionNumber);\n return it != _conductors.end() ? it->second : nullptr;\n}\n\nvoid PregelFeature::addWorker(IWorker* const worker, uint64_t executionNumber) {\n MUTEX_LOCKER(guard, _mutex);\n _workers[executionNumber] = worker;\n}\n\nIWorker* PregelFeature::worker(uint64_t executionNumber) {\n MUTEX_LOCKER(guard, _mutex);\n auto it = _workers.find(executionNumber);\n return it != _workers.end() ? it->second : nullptr;\n}\n\nvoid PregelFeature::cleanup(uint64_t executionNumber) {\n MUTEX_LOCKER(guard, _mutex);\n auto cit = _conductors.find(executionNumber);\n if (cit != _conductors.end()) {\n delete (cit->second);\n _conductors.erase(executionNumber);\n }\n auto wit = _workers.find(executionNumber);\n if (wit != _workers.end()) {\n delete (wit->second);\n _workers.erase(executionNumber);\n }\n}\n\nvoid PregelFeature::cleanupAll() {\n MUTEX_LOCKER(guard, _mutex);\n for (auto it : _conductors) {\n delete (it.second);\n }\n _conductors.clear();\n for (auto it : _workers) {\n it.second->cancelGlobalStep(VPackSlice());\n delete (it.second);\n }\n _workers.clear();\n}\n<commit_msg>adjusted number of threads used per default<commit_after>\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\/ DISCLAIMER\n\/\/\/\n\/\/\/ Copyright 2016 ArangoDB GmbH, Cologne, Germany\n\/\/\/\n\/\/\/ Licensed under the Apache License, Version 2.0 (the \"License\");\n\/\/\/ you may not use this file except in compliance with the License.\n\/\/\/ You may obtain a copy of the License at\n\/\/\/\n\/\/\/ http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n\/\/\/\n\/\/\/ Unless required by applicable law or agreed to in writing, software\n\/\/\/ distributed under the License is distributed on an \"AS IS\" BASIS,\n\/\/\/ WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n\/\/\/ See the License for the specific language governing permissions and\n\/\/\/ limitations under the License.\n\/\/\/\n\/\/\/ Copyright holder is ArangoDB GmbH, Cologne, Germany\n\/\/\/\n\/\/\/ @author Simon Grätzer\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n#include \"PregelFeature.h\"\n#include \"ApplicationFeatures\/ApplicationServer.h\"\n#include \"Basics\/MutexLocker.h\"\n#include \"Basics\/ThreadPool.h\"\n#include \"Cluster\/ClusterFeature.h\"\n#include \"Cluster\/ClusterInfo.h\"\n#include \"Pregel\/Conductor.h\"\n#include \"Pregel\/Recovery.h\"\n#include \"Pregel\/Worker.h\"\n\nusing namespace arangodb::pregel;\n\nstatic PregelFeature* Instance;\n\nuint64_t PregelFeature::createExecutionNumber() {\n return ClusterInfo::instance()->uniqid();\n}\n\nPregelFeature::PregelFeature(application_features::ApplicationServer* server)\n : ApplicationFeature(server, \"Pregel\") {\n setOptional(false);\n requiresElevatedPrivileges(false);\n startsAfter(\"Logger\");\n startsAfter(\"Database\");\n startsAfter(\"Endpoint\");\n startsAfter(\"Cluster\");\n}\n\nPregelFeature::~PregelFeature() {\n if (_recoveryManager) {\n _recoveryManager.reset();\n }\n cleanupAll();\n}\n\nPregelFeature* PregelFeature::instance() { return Instance; }\n\nstatic size_t _approxThreadNumber(){\n const size_t procNum = TRI_numberProcessors();\n if (procNum <= 1) return 1;\n else return procNum \/ 2;\n \/\/else return procNum;\/\/ use full performance on cluster\n}\n\nvoid PregelFeature::start() {\n Instance = this;\n\n const size_t threadNum = _approxThreadNumber();\n LOG(INFO) << \"Pregel uses \" << threadNum << \" threads\";\n _threadPool.reset(new basics::ThreadPool(threadNum, \"Pregel\"));\n\n ClusterFeature* cluster =\n application_features::ApplicationServer::getFeature<ClusterFeature>(\n \"Cluster\");\n if (cluster != nullptr) {\n AgencyCallbackRegistry* registry = cluster->agencyCallbackRegistry();\n if (registry != nullptr) {\n _recoveryManager.reset(new RecoveryManager(registry));\n }\n }\n}\n\nvoid PregelFeature::beginShutdown() { cleanupAll(); }\n\nvoid PregelFeature::addExecution(Conductor* const exec,\n uint64_t executionNumber) {\n MUTEX_LOCKER(guard, _mutex);\n \/\/_executions.\n _conductors[executionNumber] = exec;\n}\n\nConductor* PregelFeature::conductor(uint64_t executionNumber) {\n MUTEX_LOCKER(guard, _mutex);\n auto it = _conductors.find(executionNumber);\n return it != _conductors.end() ? it->second : nullptr;\n}\n\nvoid PregelFeature::addWorker(IWorker* const worker, uint64_t executionNumber) {\n MUTEX_LOCKER(guard, _mutex);\n _workers[executionNumber] = worker;\n}\n\nIWorker* PregelFeature::worker(uint64_t executionNumber) {\n MUTEX_LOCKER(guard, _mutex);\n auto it = _workers.find(executionNumber);\n return it != _workers.end() ? it->second : nullptr;\n}\n\nvoid PregelFeature::cleanup(uint64_t executionNumber) {\n MUTEX_LOCKER(guard, _mutex);\n auto cit = _conductors.find(executionNumber);\n if (cit != _conductors.end()) {\n delete (cit->second);\n _conductors.erase(executionNumber);\n }\n auto wit = _workers.find(executionNumber);\n if (wit != _workers.end()) {\n delete (wit->second);\n _workers.erase(executionNumber);\n }\n}\n\nvoid PregelFeature::cleanupAll() {\n MUTEX_LOCKER(guard, _mutex);\n for (auto it : _conductors) {\n delete (it.second);\n }\n _conductors.clear();\n for (auto it : _workers) {\n it.second->cancelGlobalStep(VPackSlice());\n delete (it.second);\n }\n _workers.clear();\n}\n<|endoftext|>"} {"text":"<commit_before>\/*\nCopyright (c) 2009 Yahoo! Inc. All rights reserved. The copyrights\nembodied in the content of this file are licensed under the BSD\n(revised) open source license\n *\/\n\n#include <fstream>\n#include <iostream>\nusing namespace std;\n\n#include <unistd.h>\n#include <stdlib.h>\n#include <stdint.h>\n#include <math.h>\n#include \"parse_regressor.h\"\n#include \"loss_functions.h\"\n#include \"global_data.h\"\n#include \"io.h\"\n\nvoid initialize_regressor(regressor &r)\n{\n size_t length = ((size_t)1) << global.num_bits;\n global.thread_mask = (global.stride * (length >> global.thread_bits)) - 1;\n size_t num_threads = global.num_threads();\n r.weight_vectors = (weight **)malloc(num_threads * sizeof(weight*));\n if (global.per_feature_regularizer_input != \"\")\n r.regularizers = (weight **)malloc(num_threads * sizeof(weight*));\n else\n r.regularizers = NULL;\n for (size_t i = 0; i < num_threads; i++)\n {\n r.weight_vectors[i] = (weight *)calloc(global.stride*length\/num_threads, sizeof(weight));\n if (r.regularizers != NULL)\n\tr.regularizers[i] = (weight *)calloc(length\/num_threads, sizeof(weight));\n if (r.weight_vectors[i] == NULL || (r.regularizers != NULL && r.regularizers[i] == NULL))\n {\n cerr << global.program_name << \": Failed to allocate weight array: try decreasing -b <bits>\" << endl;\n exit (1);\n }\n if (global.initial_weight != 0.)\n\tfor (size_t j = 0; j < global.stride*length\/num_threads; j+=global.stride)\n\t r.weight_vectors[i][j] = global.initial_weight;\n if (global.random_weights)\n\tfor (size_t j = 0; j < length\/num_threads; j++) {\n r.weight_vectors[i][j] = drand48() - 0.5;\n }\n if (global.lda)\n\t{\n\t size_t stride = global.stride;\n\n for (size_t j = 0; j < stride*length\/num_threads; j+=stride)\n\t {\n\t for (size_t k = 0; k < global.lda; k++) {\n r.weight_vectors[i][j+k] = -log(drand48()) + 1.0;\n\/\/ r.weight_vectors[i][j+k] *= r.weight_vectors[i][j+k];\n\/\/ r.weight_vectors[i][j+k] *= r.weight_vectors[i][j+k];\n\t\tr.weight_vectors[i][j+k] *= (float)global.lda_D \/ (float)global.lda\n\t\t \/ global.length() * 200;\n }\n\t r.weight_vectors[i][j+global.lda] = global.initial_t;\n\t }\n\t}\n if(global.adaptive)\n for (size_t j = 1; j < global.stride*length\/num_threads; j+=global.stride)\n\t r.weight_vectors[i][j] = 1;\n }\n}\n\nvoid read_vector(const char* file, regressor& r, bool& initialized, bool reg_vector)\n{\n ifstream source(file);\n if (!source.is_open())\n {\n cout << \"can't open \" << file << endl << \" ... exiting.\" << endl;\n exit(1);\n }\n \n size_t v_length;\n source.read((char*)&v_length, sizeof(v_length));\n char t[v_length];\n source.read(t,v_length);\n if (strcmp(t,version.c_str()) != 0)\n {\n cout << \"source has possibly incompatible version!\" << endl;\n exit(1);\n }\n \n source.read((char*)&global.min_label, sizeof(global.min_label));\n source.read((char*)&global.max_label, sizeof(global.max_label));\n \n size_t local_num_bits;\n source.read((char *)&local_num_bits, sizeof(local_num_bits));\n if (!initialized){\n if (global.default_bits != true && global.num_bits != local_num_bits)\n {\n\tcout << \"Wrong number of bits for source!\" << endl;\n\texit (1);\n }\n global.default_bits = false;\n global.num_bits = local_num_bits;\n }\n else \n if (local_num_bits != global.num_bits)\n {\n\tcout << \"can't combine sources with different feature number!\" << endl;\n\texit (1);\n }\n \n size_t local_thread_bits;\n source.read((char*)&local_thread_bits, sizeof(local_thread_bits));\n if (!initialized){\n global.thread_bits = local_thread_bits;\n global.partition_bits = global.thread_bits;\n }\n else \n if (local_thread_bits != global.thread_bits)\n {\n\tcout << \"can't combine sources trained with different numbers of threads!\" << endl;\n\texit (1);\n }\n \n int len;\n source.read((char *)&len, sizeof(len));\n \n vector<string> local_pairs;\n for (; len > 0; len--)\n {\n char pair[2];\n source.read(pair, sizeof(char)*2);\n string temp(pair, 2);\n local_pairs.push_back(temp);\n }\n if (!initialized)\n {\n global.pairs = local_pairs;\n initialize_regressor(r);\n }\n else\n if (local_pairs != global.pairs)\n {\n\tcout << \"can't combine sources with different features!\" << endl;\n\tfor (size_t i = 0; i < local_pairs.size(); i++)\n\t cout << local_pairs[i] << \" \" << local_pairs[i].size() << \" \";\n\tcout << endl;\n\tfor (size_t i = 0; i < global.pairs.size(); i++)\n\t cout << global.pairs[i] << \" \" << global.pairs[i].size() << \" \";\n\tcout << endl;\n\texit (1);\n }\n size_t local_ngram;\n source.read((char*)&local_ngram, sizeof(local_ngram));\n size_t local_skips;\n source.read((char*)&local_skips, sizeof(local_skips));\n if (!initialized)\n {\n global.ngram = local_ngram;\n global.skips = local_skips;\n initialized = true;\n }\n else\n if (global.ngram != local_ngram || global.skips != local_skips)\n {\n\tcout << \"can't combine sources with different ngram features!\" << endl;\n\texit(1);\n }\n size_t stride = global.stride;\n while (source.good())\n {\n uint32_t hash;\n source.read((char *)&hash, sizeof(hash));\n weight w = 0.;\n source.read((char *)&w, sizeof(float));\n \n size_t num_threads = global.num_threads();\n if (source.good())\n\t{\n\t if (global.lda == 0) \n\t if (reg_vector)\n\t r.regularizers[hash % num_threads][hash\/num_threads] = w;\n\t else\n\t r.weight_vectors[hash % num_threads][(hash*stride)\/num_threads] \n\t\t= r.weight_vectors[hash % num_threads][(hash*stride)\/num_threads] + w;\n\t else\n\t r.weight_vectors[hash % num_threads][hash\/num_threads] \n\t\t= r.weight_vectors[hash % num_threads][hash\/num_threads] + w;\n\t} \n }\n source.close();\n}\n\nvoid parse_regressor_args(po::variables_map& vm, regressor& r, string& final_regressor_name, bool quiet)\n{\n if (vm.count(\"final_regressor\")) {\n final_regressor_name = vm[\"final_regressor\"].as<string>();\n if (!quiet)\n cerr << \"final_regressor = \" << vm[\"final_regressor\"].as<string>() << endl;\n }\n else\n final_regressor_name = \"\";\n\n vector<string> regs;\n if (vm.count(\"initial_regressor\"))\n regs = vm[\"initial_regressor\"].as< vector<string> >();\n \n \/* \n Read in regressors. If multiple regressors are specified, do a weighted \n average. If none are specified, initialize according to global_seg & \n numbits.\n *\/\n bool initialized = false;\n \n for (size_t i = 0; i < regs.size(); i++)\n read_vector(regs[i].c_str(), r, initialized, false);\n \n if (global.per_feature_regularizer_input != \"\")\n read_vector(global.per_feature_regularizer_input.c_str(), r, initialized, true);\n \n if (!initialized)\n {\n if(vm.count(\"noop\") || vm.count(\"sendto\"))\n\tr.weight_vectors = NULL;\n else\n\tinitialize_regressor(r);\n }\n}\n\nvoid free_regressor(regressor &r)\n{\n if (r.weight_vectors != NULL)\n {\n for (size_t i = 0; i < global.num_threads(); i++)\n\tif (r.weight_vectors[i] != NULL)\n\t free(r.weight_vectors[i]);\n free(r.weight_vectors);\n }\n if (r.regularizers != NULL)\n {\n for (size_t i = 0; i < global.num_threads(); i++)\n\tif (r.regularizers[i] != NULL)\n\t free(r.regularizers[i]);\n free(r.regularizers);\n }\n}\n\nvoid dump_regressor(string reg_name, regressor &r, bool as_text, bool reg_vector)\n{\n if (reg_name == string(\"\"))\n return;\n string start_name = reg_name+string(\".writing\");\n io_buf io_temp;\n\n int f = io_temp.open_file(start_name.c_str(),io_buf::WRITE);\n \n if (f<0)\n {\n cout << \"can't open: \" << start_name << \" for writing, exiting\" << endl;\n exit(1);\n }\n size_t v_length = version.length()+1;\n if (!as_text) {\n io_temp.write_file(f,(char*)&v_length, sizeof(v_length));\n io_temp.write_file(f,version.c_str(),v_length);\n \n io_temp.write_file(f,(char*)&global.min_label, sizeof(global.min_label));\n io_temp.write_file(f,(char*)&global.max_label, sizeof(global.max_label));\n \n io_temp.write_file(f,(char *)&global.num_bits, sizeof(global.num_bits));\n io_temp.write_file(f,(char *)&global.thread_bits, sizeof(global.thread_bits));\n int len = global.pairs.size();\n io_temp.write_file(f,(char *)&len, sizeof(len));\n for (vector<string>::iterator i = global.pairs.begin(); i != global.pairs.end();i++) \n io_temp.write_file(f,i->c_str(),2);\n\n io_temp.write_file(f,(char*)&global.ngram, sizeof(global.ngram));\n io_temp.write_file(f,(char*)&global.skips, sizeof(global.skips));\n }\n else {\n char buff[512];\n int len;\n len = sprintf(buff, \"Version %s\\n\", version.c_str());\n io_temp.write_file(f, buff, len);\n len = sprintf(buff, \"Min label:%f max label:%f\\n\", global.min_label, global.max_label);\n io_temp.write_file(f, buff, len);\n len = sprintf(buff, \"bits:%d thread_bits:%d\\n\", (int)global.num_bits, (int)global.thread_bits);\n io_temp.write_file(f, buff, len);\n for (vector<string>::iterator i = global.pairs.begin(); i != global.pairs.end();i++) {\n len = sprintf(buff, \"%s \", i->c_str());\n io_temp.write_file(f, buff, len);\n }\n if (global.pairs.size() > 0)\n {\n\tlen = sprintf(buff, \"\\n\");\n\tio_temp.write_file(f, buff, len);\n }\n len = sprintf(buff, \"ngram:%d skips:%d\\nindex:weight pairs:\\n\", (int)global.ngram, (int)global.skips);\n io_temp.write_file(f, buff, len);\n }\n \n uint32_t length = 1 << global.num_bits;\n size_t num_threads = global.num_threads();\n size_t stride = global.stride;\n for(uint32_t i = 0; i < length; i++)\n {\n if (global.lda == 0)\n\t{\n\t weight v;\n\t if (reg_vector)\n\t v = r.regularizers[i%num_threads][(i\/num_threads)];\n\t else\n\t v = r.weight_vectors[i%num_threads][stride*(i\/num_threads)];\n\t if (v != 0.)\n\t {\n if (!as_text) {\n io_temp.write_file(f,(char *)&i, sizeof (i));\n io_temp.write_file(f,(char *)&v, sizeof (v));\n } else {\n char buff[512];\n int len = sprintf(buff, \"%d:%f\\n\", i, v);\n io_temp.write_file(f, buff, len);\n }\n\t }\n\t}\n else\n\t{\n\t size_t K;\n\t \n\t if (global.lda != 0)\n\t K = global.lda;\n\t \n for (size_t k = 0; k < K; k++)\n {\n weight v = r.weight_vectors[i%num_threads][(stride*i+k)\/num_threads];\n uint32_t ndx = stride*i+k;\n if (!as_text) {\n io_temp.write_file(f,(char *)&ndx, sizeof (ndx));\n io_temp.write_file(f,(char *)&v, sizeof (v));\n } else {\n char buff[512];\n int len = sprintf(buff, \"%f \", v + global.lda_rho);\n io_temp.write_file(f, buff, len);\n }\n }\n if (as_text)\n io_temp.write_file(f, \"\\n\", 1);\n\t}\n }\n\n rename(start_name.c_str(),reg_name.c_str());\n\n io_temp.close_file();\n}\n\nvoid finalize_regressor(string reg_name, regressor &r)\n{\n dump_regressor(reg_name, r, false);\n dump_regressor(global.text_regressor_name, r, true);\n dump_regressor(global.per_feature_regularizer_output, r, false, true);\n dump_regressor(global.per_feature_regularizer_output, r, true, true);\n free_regressor(r);\n}\n<commit_msg>fix rename\/close order bug from Raja<commit_after>\/*\nCopyright (c) 2009 Yahoo! Inc. All rights reserved. The copyrights\nembodied in the content of this file are licensed under the BSD\n(revised) open source license\n *\/\n\n#include <fstream>\n#include <iostream>\nusing namespace std;\n\n#include <unistd.h>\n#include <stdlib.h>\n#include <stdint.h>\n#include <math.h>\n#include \"parse_regressor.h\"\n#include \"loss_functions.h\"\n#include \"global_data.h\"\n#include \"io.h\"\n\nvoid initialize_regressor(regressor &r)\n{\n size_t length = ((size_t)1) << global.num_bits;\n global.thread_mask = (global.stride * (length >> global.thread_bits)) - 1;\n size_t num_threads = global.num_threads();\n r.weight_vectors = (weight **)malloc(num_threads * sizeof(weight*));\n if (global.per_feature_regularizer_input != \"\")\n r.regularizers = (weight **)malloc(num_threads * sizeof(weight*));\n else\n r.regularizers = NULL;\n for (size_t i = 0; i < num_threads; i++)\n {\n r.weight_vectors[i] = (weight *)calloc(global.stride*length\/num_threads, sizeof(weight));\n if (r.regularizers != NULL)\n\tr.regularizers[i] = (weight *)calloc(length\/num_threads, sizeof(weight));\n if (r.weight_vectors[i] == NULL || (r.regularizers != NULL && r.regularizers[i] == NULL))\n {\n cerr << global.program_name << \": Failed to allocate weight array: try decreasing -b <bits>\" << endl;\n exit (1);\n }\n if (global.initial_weight != 0.)\n\tfor (size_t j = 0; j < global.stride*length\/num_threads; j+=global.stride)\n\t r.weight_vectors[i][j] = global.initial_weight;\n if (global.random_weights)\n\tfor (size_t j = 0; j < length\/num_threads; j++) {\n r.weight_vectors[i][j] = drand48() - 0.5;\n }\n if (global.lda)\n\t{\n\t size_t stride = global.stride;\n\n for (size_t j = 0; j < stride*length\/num_threads; j+=stride)\n\t {\n\t for (size_t k = 0; k < global.lda; k++) {\n r.weight_vectors[i][j+k] = -log(drand48()) + 1.0;\n\/\/ r.weight_vectors[i][j+k] *= r.weight_vectors[i][j+k];\n\/\/ r.weight_vectors[i][j+k] *= r.weight_vectors[i][j+k];\n\t\tr.weight_vectors[i][j+k] *= (float)global.lda_D \/ (float)global.lda\n\t\t \/ global.length() * 200;\n }\n\t r.weight_vectors[i][j+global.lda] = global.initial_t;\n\t }\n\t}\n if(global.adaptive)\n for (size_t j = 1; j < global.stride*length\/num_threads; j+=global.stride)\n\t r.weight_vectors[i][j] = 1;\n }\n}\n\nvoid read_vector(const char* file, regressor& r, bool& initialized, bool reg_vector)\n{\n ifstream source(file);\n if (!source.is_open())\n {\n cout << \"can't open \" << file << endl << \" ... exiting.\" << endl;\n exit(1);\n }\n \n size_t v_length;\n source.read((char*)&v_length, sizeof(v_length));\n char t[v_length];\n source.read(t,v_length);\n if (strcmp(t,version.c_str()) != 0)\n {\n cout << \"source has possibly incompatible version!\" << endl;\n exit(1);\n }\n \n source.read((char*)&global.min_label, sizeof(global.min_label));\n source.read((char*)&global.max_label, sizeof(global.max_label));\n \n size_t local_num_bits;\n source.read((char *)&local_num_bits, sizeof(local_num_bits));\n if (!initialized){\n if (global.default_bits != true && global.num_bits != local_num_bits)\n {\n\tcout << \"Wrong number of bits for source!\" << endl;\n\texit (1);\n }\n global.default_bits = false;\n global.num_bits = local_num_bits;\n }\n else \n if (local_num_bits != global.num_bits)\n {\n\tcout << \"can't combine sources with different feature number!\" << endl;\n\texit (1);\n }\n \n size_t local_thread_bits;\n source.read((char*)&local_thread_bits, sizeof(local_thread_bits));\n if (!initialized){\n global.thread_bits = local_thread_bits;\n global.partition_bits = global.thread_bits;\n }\n else \n if (local_thread_bits != global.thread_bits)\n {\n\tcout << \"can't combine sources trained with different numbers of threads!\" << endl;\n\texit (1);\n }\n \n int len;\n source.read((char *)&len, sizeof(len));\n \n vector<string> local_pairs;\n for (; len > 0; len--)\n {\n char pair[2];\n source.read(pair, sizeof(char)*2);\n string temp(pair, 2);\n local_pairs.push_back(temp);\n }\n if (!initialized)\n {\n global.pairs = local_pairs;\n initialize_regressor(r);\n }\n else\n if (local_pairs != global.pairs)\n {\n\tcout << \"can't combine sources with different features!\" << endl;\n\tfor (size_t i = 0; i < local_pairs.size(); i++)\n\t cout << local_pairs[i] << \" \" << local_pairs[i].size() << \" \";\n\tcout << endl;\n\tfor (size_t i = 0; i < global.pairs.size(); i++)\n\t cout << global.pairs[i] << \" \" << global.pairs[i].size() << \" \";\n\tcout << endl;\n\texit (1);\n }\n size_t local_ngram;\n source.read((char*)&local_ngram, sizeof(local_ngram));\n size_t local_skips;\n source.read((char*)&local_skips, sizeof(local_skips));\n if (!initialized)\n {\n global.ngram = local_ngram;\n global.skips = local_skips;\n initialized = true;\n }\n else\n if (global.ngram != local_ngram || global.skips != local_skips)\n {\n\tcout << \"can't combine sources with different ngram features!\" << endl;\n\texit(1);\n }\n size_t stride = global.stride;\n while (source.good())\n {\n uint32_t hash;\n source.read((char *)&hash, sizeof(hash));\n weight w = 0.;\n source.read((char *)&w, sizeof(float));\n \n size_t num_threads = global.num_threads();\n if (source.good())\n\t{\n\t if (global.lda == 0) \n\t if (reg_vector)\n\t r.regularizers[hash % num_threads][hash\/num_threads] = w;\n\t else\n\t r.weight_vectors[hash % num_threads][(hash*stride)\/num_threads] \n\t\t= r.weight_vectors[hash % num_threads][(hash*stride)\/num_threads] + w;\n\t else\n\t r.weight_vectors[hash % num_threads][hash\/num_threads] \n\t\t= r.weight_vectors[hash % num_threads][hash\/num_threads] + w;\n\t} \n }\n source.close();\n}\n\nvoid parse_regressor_args(po::variables_map& vm, regressor& r, string& final_regressor_name, bool quiet)\n{\n if (vm.count(\"final_regressor\")) {\n final_regressor_name = vm[\"final_regressor\"].as<string>();\n if (!quiet)\n cerr << \"final_regressor = \" << vm[\"final_regressor\"].as<string>() << endl;\n }\n else\n final_regressor_name = \"\";\n\n vector<string> regs;\n if (vm.count(\"initial_regressor\"))\n regs = vm[\"initial_regressor\"].as< vector<string> >();\n \n \/* \n Read in regressors. If multiple regressors are specified, do a weighted \n average. If none are specified, initialize according to global_seg & \n numbits.\n *\/\n bool initialized = false;\n \n for (size_t i = 0; i < regs.size(); i++)\n read_vector(regs[i].c_str(), r, initialized, false);\n \n if (global.per_feature_regularizer_input != \"\")\n read_vector(global.per_feature_regularizer_input.c_str(), r, initialized, true);\n \n if (!initialized)\n {\n if(vm.count(\"noop\") || vm.count(\"sendto\"))\n\tr.weight_vectors = NULL;\n else\n\tinitialize_regressor(r);\n }\n}\n\nvoid free_regressor(regressor &r)\n{\n if (r.weight_vectors != NULL)\n {\n for (size_t i = 0; i < global.num_threads(); i++)\n\tif (r.weight_vectors[i] != NULL)\n\t free(r.weight_vectors[i]);\n free(r.weight_vectors);\n }\n if (r.regularizers != NULL)\n {\n for (size_t i = 0; i < global.num_threads(); i++)\n\tif (r.regularizers[i] != NULL)\n\t free(r.regularizers[i]);\n free(r.regularizers);\n }\n}\n\nvoid dump_regressor(string reg_name, regressor &r, bool as_text, bool reg_vector)\n{\n if (reg_name == string(\"\"))\n return;\n string start_name = reg_name+string(\".writing\");\n io_buf io_temp;\n\n int f = io_temp.open_file(start_name.c_str(),io_buf::WRITE);\n \n if (f<0)\n {\n cout << \"can't open: \" << start_name << \" for writing, exiting\" << endl;\n exit(1);\n }\n size_t v_length = version.length()+1;\n if (!as_text) {\n io_temp.write_file(f,(char*)&v_length, sizeof(v_length));\n io_temp.write_file(f,version.c_str(),v_length);\n \n io_temp.write_file(f,(char*)&global.min_label, sizeof(global.min_label));\n io_temp.write_file(f,(char*)&global.max_label, sizeof(global.max_label));\n \n io_temp.write_file(f,(char *)&global.num_bits, sizeof(global.num_bits));\n io_temp.write_file(f,(char *)&global.thread_bits, sizeof(global.thread_bits));\n int len = global.pairs.size();\n io_temp.write_file(f,(char *)&len, sizeof(len));\n for (vector<string>::iterator i = global.pairs.begin(); i != global.pairs.end();i++) \n io_temp.write_file(f,i->c_str(),2);\n\n io_temp.write_file(f,(char*)&global.ngram, sizeof(global.ngram));\n io_temp.write_file(f,(char*)&global.skips, sizeof(global.skips));\n }\n else {\n char buff[512];\n int len;\n len = sprintf(buff, \"Version %s\\n\", version.c_str());\n io_temp.write_file(f, buff, len);\n len = sprintf(buff, \"Min label:%f max label:%f\\n\", global.min_label, global.max_label);\n io_temp.write_file(f, buff, len);\n len = sprintf(buff, \"bits:%d thread_bits:%d\\n\", (int)global.num_bits, (int)global.thread_bits);\n io_temp.write_file(f, buff, len);\n for (vector<string>::iterator i = global.pairs.begin(); i != global.pairs.end();i++) {\n len = sprintf(buff, \"%s \", i->c_str());\n io_temp.write_file(f, buff, len);\n }\n if (global.pairs.size() > 0)\n {\n\tlen = sprintf(buff, \"\\n\");\n\tio_temp.write_file(f, buff, len);\n }\n len = sprintf(buff, \"ngram:%d skips:%d\\nindex:weight pairs:\\n\", (int)global.ngram, (int)global.skips);\n io_temp.write_file(f, buff, len);\n }\n \n uint32_t length = 1 << global.num_bits;\n size_t num_threads = global.num_threads();\n size_t stride = global.stride;\n for(uint32_t i = 0; i < length; i++)\n {\n if (global.lda == 0)\n\t{\n\t weight v;\n\t if (reg_vector)\n\t v = r.regularizers[i%num_threads][(i\/num_threads)];\n\t else\n\t v = r.weight_vectors[i%num_threads][stride*(i\/num_threads)];\n\t if (v != 0.)\n\t {\n if (!as_text) {\n io_temp.write_file(f,(char *)&i, sizeof (i));\n io_temp.write_file(f,(char *)&v, sizeof (v));\n } else {\n char buff[512];\n int len = sprintf(buff, \"%d:%f\\n\", i, v);\n io_temp.write_file(f, buff, len);\n }\n\t }\n\t}\n else\n\t{\n\t size_t K;\n\t \n\t if (global.lda != 0)\n\t K = global.lda;\n\t \n for (size_t k = 0; k < K; k++)\n {\n weight v = r.weight_vectors[i%num_threads][(stride*i+k)\/num_threads];\n uint32_t ndx = stride*i+k;\n if (!as_text) {\n io_temp.write_file(f,(char *)&ndx, sizeof (ndx));\n io_temp.write_file(f,(char *)&v, sizeof (v));\n } else {\n char buff[512];\n int len = sprintf(buff, \"%f \", v + global.lda_rho);\n io_temp.write_file(f, buff, len);\n }\n }\n if (as_text)\n io_temp.write_file(f, \"\\n\", 1);\n\t}\n }\n\n io_temp.close_file();\n rename(start_name.c_str(),reg_name.c_str());\n}\n\nvoid finalize_regressor(string reg_name, regressor &r)\n{\n dump_regressor(reg_name, r, false);\n dump_regressor(global.text_regressor_name, r, true);\n dump_regressor(global.per_feature_regularizer_output, r, false, true);\n dump_regressor(global.per_feature_regularizer_output, r, true, true);\n free_regressor(r);\n}\n<|endoftext|>"} {"text":"<commit_before>#include \"Timer.hpp\"\n#include \"Cpu.hpp\"\n#include \"registerAddr.hpp\"\n#include \"interrupt.hpp\"\n\n\/*\n** ############################################################################\n** CREATE Singleton\n** ############################################################################\n*\/\n\nTimer::Timer(Memory *memory) :\n\t_memory(memory),\n\t_divider(0),\n\t_cyclesAcc(0)\n{\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->reset();\n}\n\n\/*\n** ############################################################################\n** Methodes SETTEUR\n** ############################################################################\n*\/\n\nvoid Timer::reset(void)\n{\n\tthis->_divider = 0;\n\tthis->_cyclesAcc = 0;\n}\n\nvoid Timer::step(unsigned int cycles)\n{\n\tuint8_t\t\t\ttac = _memory->read_byte(REGISTER_TAC);\n\tuint8_t\t\t\tfreqId = tac & 0x3;\n\tunsigned int\tcyclesAccTima = Cpu_z80::getClockSpeed() \/ _arrayFrequency[freqId];\n\n\t_divider += cycles;\n\tif (_divider >= Cpu_z80::getClockSpeed() \/ 16384)\n\t{\n\t\tincDivider();\n\t\t_divider -= Cpu_z80::getClockSpeed() \/ 16384;\n\t}\n\tif ((tac & 0x4) == 0x4) \/\/ Flag timer stop\n\t{\n\t\t_cyclesAcc += cycles;\n\t\tif (_cyclesAcc >= cyclesAccTima)\n\t\t{\n\t\t\tincTima();\n\t\t\t_cyclesAcc -= cyclesAccTima;\n\t\t}\n\t}\n}\n\nvoid\tTimer::incTima(void)\n{\n\tuint8_t\t\t\ttima = _memory->read_byte(REGISTER_TIMA);\n\tuint8_t\t\t\ttma = _memory->read_byte(REGISTER_TMA);\n\n\tif (tima == 0xFF)\n\t{\n\t\t_memory->write_byte(REGISTER_TIMA, tma);\n\t\t_memory->write_byte(REGISTER_IF, INTER_TOVERF);\n\t}\n\telse\n\t\t_memory->write_byte(REGISTER_TIMA, tima + 1);\n}\n\nvoid\tTimer::incDivider(void)\n{\n\tuint8_t\t\t\tdiv = _memory->read_byte(REGISTER_DIV);\n\n\tif (div == 0xFF)\n\t\t_memory->write_byte(REGISTER_DIV, 0x00);\n\telse\n\t\t_memory->write_byte(REGISTER_DIV, div + 1, true);\n}\n<commit_msg>Fix interrupt Timer overflow<commit_after>#include \"Timer.hpp\"\n#include \"Cpu.hpp\"\n#include \"registerAddr.hpp\"\n#include \"interrupt.hpp\"\n\n\/*\n** ############################################################################\n** CREATE Singleton\n** ############################################################################\n*\/\n\nTimer::Timer(Memory *memory) :\n\t_memory(memory),\n\t_divider(0),\n\t_cyclesAcc(0)\n{\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->reset();\n}\n\n\/*\n** ############################################################################\n** Methodes SETTEUR\n** ############################################################################\n*\/\n\nvoid Timer::reset(void)\n{\n\tthis->_divider = 0;\n\tthis->_cyclesAcc = 0;\n}\n\nvoid Timer::step(unsigned int cycles)\n{\n\tuint8_t\t\t\ttac = _memory->read_byte(REGISTER_TAC);\n\tuint8_t\t\t\tfreqId = tac & 0x3;\n\tunsigned int\tcyclesAccTima = Cpu_z80::getClockSpeed() \/ _arrayFrequency[freqId];\n\n\t_divider += cycles;\n\tif (_divider >= Cpu_z80::getClockSpeed() \/ 16384)\n\t{\n\t\tincDivider();\n\t\t_divider -= Cpu_z80::getClockSpeed() \/ 16384;\n\t}\n\tif ((tac & 0x4) == 0x4) \/\/ Flag timer stop\n\t{\n\t\t_cyclesAcc += cycles;\n\t\tif (_cyclesAcc >= cyclesAccTima)\n\t\t{\n\t\t\tincTima();\n\t\t\t_cyclesAcc -= cyclesAccTima;\n\t\t}\n\t}\n}\n\nvoid\tTimer::incTima(void)\n{\n\tuint8_t\t\t\ttima = _memory->read_byte(REGISTER_TIMA);\n\tuint8_t\t\t\ttma = _memory->read_byte(REGISTER_TMA);\n\n\tif (tima == 0xFF)\n\t{\n\t\t_memory->write_byte(REGISTER_TIMA, tma);\n\t\t_memory->write_byte(REGISTER_IF, _memory->read_byte(REGISTER_IF) | INTER_TOVERF);\n\t}\n\telse\n\t\t_memory->write_byte(REGISTER_TIMA, tima + 1);\n}\n\nvoid\tTimer::incDivider(void)\n{\n\tuint8_t\t\t\tdiv = _memory->read_byte(REGISTER_DIV);\n\n\tif (div == 0xFF)\n\t\t_memory->write_byte(REGISTER_DIV, 0x00);\n\telse\n\t\t_memory->write_byte(REGISTER_DIV, div + 1, true);\n}\n<|endoftext|>"} {"text":"<commit_before>#include \"decompose_imf_lib\/optimization_task.h\"\n\n#include \"decompose_imf_lib\/calculations.h\"\n#include \"decompose_imf_lib\/processing.h\"\n\n#include \"cpp_utils\/math_constants.h\"\n#include \"cpp_utils\/optimize.h\"\n#include \"cpp_utils\/parallel_executor.h\"\n#include \"cpp_utils\/std_make_unique.h\"\n\n#include \"qt_utils\/exception_handling.h\"\n\n#include <opencv\/cv.h>\n\nnamespace dimf\n{\n\n\/\/void OptimizationTask::start( OptimizationParams params )\nstd::vector<std::vector<double> > runOptimization(\n const OptimizationParams & params )\n{\n using cu::pi;\n\n auto done = false;\n auto currentImf = size_t{0};\n\n const auto processingFunctions = createProcessingFunctions();\n const auto samples = processSamples(\n params.samples,\n params.preprocessing,\n processingFunctions );\n auto imfs = std::vector<std::vector<double> >{};\n\n \/\/ This variable is shared between 'shallTerminate' and 'sendBestFit'.\n auto nIter = 0;\n\n while ( !done )\n {\n const auto oldImf = currentImf;\n std::cout << \"Optimizing IMF \" << currentImf << \".\" << std::endl;\n auto f = samples;\n for( const auto & imf : imfs )\n cu::subAssign( begin(f), end(f), 1., begin(imf), end(imf) );\n f = processSamples( f, params.interprocessing, processingFunctions );\n const auto nSamples = f.size();\n\n \/\/ calculate an initial approximation and swarm\n CU_ASSERT_THROW( params.initializer,\n \"The algorithm for the initial \"\n \"approximation has not been specified.\" );\n const auto initApprox = params.initializer(f);\n\n \/\/ calculate base with equidistant center points of logistic functions\n auto logisticBase = std::vector<std::vector<double>>{};\n auto nodes = std::vector<double>{};\n const auto factor = nSamples \/ params.xIntervalWidth;\n const auto initSigma = params.initSigmaUnits * factor;\n for ( auto i = size_t{0}; i < params.nParams; ++i )\n {\n nodes.push_back( (i+.5)*initApprox.size()\/params.nParams );\n logisticBase.push_back( getSamplesFromLogisticFunctionBase(\n { 1., nodes.back() }, initSigma, initApprox.size() ) );\n }\n auto logisticBaseMat = cv::Mat(\n logisticBase.front().size(), logisticBase.size(),\n CV_64FC1, cv::Scalar::all(0) );\n for ( auto row = 0; row < logisticBaseMat.rows; ++row )\n {\n for ( auto col = 0; col < logisticBaseMat.cols; ++col )\n {\n logisticBaseMat.at<double>(row,col) =\n logisticBase.at(col).at(row);\n }\n }\n\n \/\/ calculate the element closest to initApprox that lies in the\n \/\/ space spanned by the base elements. Also calculate the\n \/\/ coefficients of that minimum element with respect to the given\n \/\/ base\n auto initApproxMat = cv::Mat(\n initApprox.size(), 1, CV_64FC1, cv::Scalar::all(0) );\n for ( auto row = 0; row < initApproxMat.rows; ++row )\n {\n initApproxMat.at<double>( row ) = initApprox.at(row).imag();\n }\n const auto invLogisticBase =\n cv::Mat{ logisticBaseMat.inv( cv::DECOMP_SVD ) };\n const auto bestApproxMat =\n cv::Mat{ invLogisticBase * initApproxMat };\n\n auto swarm = std::vector<std::vector<double>>( params.swarmSize );\n auto rng = std::mt19937{};\n {\n auto normal_dist = std::normal_distribution<>{};\n auto uniform = std::uniform_real_distribution<double>{-1,1};\n for ( auto & x : swarm )\n {\n const auto sigmaDev = params.sigmaDevUnits * factor;\n const auto tauDev = params.tauDevUnits * factor;\n const auto initTau = params.initTauUnits * factor;\n const auto nodeDev = params.nodeDevUnits * factor;\n const auto angleDev = params.angleDevDegs\/180*cu::pi;\n for ( auto i = size_t{0}; i < nodes.size(); ++i )\n {\n x.push_back( params.amplitudeDev*normal_dist(rng) );\n x.push_back( nodes[i] + nodeDev*normal_dist(rng) );\n }\n for ( auto i = size_t{0}; i < nodes.size(); ++i )\n {\n x.push_back( bestApproxMat.at<double>( i ) +\n angleDev*uniform(rng) );\n x.push_back( nodes[i] );\n }\n x.push_back( initSigma + sigmaDev*normal_dist(rng) );\n x.push_back( initTau + tauDev*normal_dist(rng) );\n }\n }\n\n \/\/ cost function for optimization\n const auto cost = [&f, nSamples]( std::vector<double> v ) -> double\n {\n return costFunction( f,\n getSamplesFromParams( std::move(v), nSamples ) );\n };\n\n \/\/ function which returns whether the\n \/\/ optimization algorithm shall terminate.\n const auto shallTerminate = [&]( const decltype(swarm) & )-> bool\n {\n ++nIter;\n const auto nextImf = params.howToContinue( nIter );\n if ( nextImf == ~size_t{0} )\n {\n done = true;\n return true;\n }\n if ( nextImf == currentImf )\n return false;\n currentImf = nextImf;\n return true;\n };\n\n \/\/ function which is called by the optimization algorithm\n \/\/ each time the best fit is improved.\n auto bestParams = std::vector<double>{};\n const auto sendBestFit = [&](\n const std::vector<double> & v_, double cost )\n {\n bestParams = v_;\n params.receiveBestFit(bestParams,cost,nSamples,nIter,f);\n };\n\n \/\/ perform the optimization.\n swarm = cu::differentialEvolution(\n std::move(swarm), params.crossOverProb, params.diffWeight,\n cost, shallTerminate, sendBestFit, rng );\n\n const auto bestImf = calculateImfFromPairsOfReals(\n getSamplesFromParams( bestParams, nSamples ) );\n if ( oldImf >= imfs.size() )\n {\n CU_ASSERT_THROW( oldImf == imfs.size(),\n \"Invalid IMF index. Have some indexes been skipped?\" );\n imfs.push_back({});\n }\n imfs[oldImf] = bestImf;\n } \/\/ while loop\n return imfs;\n}\n\n} \/\/ namespace dimf\n<commit_msg>Bugfix: Improvement of already optimized IMFs can now not yield worse results than previously.<commit_after>#include \"decompose_imf_lib\/optimization_task.h\"\n\n#include \"decompose_imf_lib\/calculations.h\"\n#include \"decompose_imf_lib\/processing.h\"\n\n#include \"cpp_utils\/math_constants.h\"\n#include \"cpp_utils\/optimize.h\"\n#include \"cpp_utils\/parallel_executor.h\"\n#include \"cpp_utils\/std_make_unique.h\"\n\n#include \"qt_utils\/exception_handling.h\"\n\n#include <opencv\/cv.h>\n\nnamespace dimf\n{\n\n\/\/void OptimizationTask::start( OptimizationParams params )\nstd::vector<std::vector<double> > runOptimization(\n const OptimizationParams & params )\n{\n using cu::pi;\n\n auto done = false;\n auto currentImf = size_t{0};\n\n const auto processingFunctions = createProcessingFunctions();\n const auto samples = processSamples(\n params.samples,\n params.preprocessing,\n processingFunctions );\n auto imfs = std::vector<std::vector<double> >{};\n auto bestParamSets = std::vector<std::vector<double> >{};\n\n \/\/ This variable is shared between 'shallTerminate' and 'sendBestFit'.\n auto nIter = 0;\n\n while ( !done )\n {\n const auto oldImf = currentImf;\n std::cout << \"Optimizing IMF \" << currentImf << \".\" << std::endl;\n auto f = samples;\n for ( auto i = size_t(); i < imfs.size(); ++i )\n {\n if ( i == currentImf )\n continue;\n const auto & imf = imfs[i];\n cu::subAssign( begin(f), end(f), 1., begin(imf), end(imf) );\n }\n f = processSamples( f,\n params.interprocessing,\n processingFunctions );\n const auto nSamples = f.size();\n\n \/\/ calculate an initial approximation and swarm\n CU_ASSERT_THROW( params.initializer,\n \"The algorithm for the initial \"\n \"approximation has not been specified.\" );\n const auto initApprox = params.initializer(f);\n\n \/\/ calculate base with equidistant center points of logistic functions\n auto logisticBase = std::vector<std::vector<double>>{};\n auto nodes = std::vector<double>{};\n const auto factor = nSamples \/ params.xIntervalWidth;\n const auto initSigma = params.initSigmaUnits * factor;\n for ( auto i = size_t{0}; i < params.nParams; ++i )\n {\n nodes.push_back( (i+.5)*initApprox.size()\/params.nParams );\n logisticBase.push_back( getSamplesFromLogisticFunctionBase(\n { 1., nodes.back() }, initSigma, initApprox.size() ) );\n }\n auto logisticBaseMat = cv::Mat(\n logisticBase.front().size(), logisticBase.size(),\n CV_64FC1, cv::Scalar::all(0) );\n for ( auto row = 0; row < logisticBaseMat.rows; ++row )\n {\n for ( auto col = 0; col < logisticBaseMat.cols; ++col )\n {\n logisticBaseMat.at<double>(row,col) =\n logisticBase.at(col).at(row);\n }\n }\n\n \/\/ calculate the element closest to initApprox that lies in the\n \/\/ space spanned by the base elements. Also calculate the\n \/\/ coefficients of that minimum element with respect to the given\n \/\/ base\n auto initApproxMat = cv::Mat(\n initApprox.size(), 1, CV_64FC1, cv::Scalar::all(0) );\n for ( auto row = 0; row < initApproxMat.rows; ++row )\n {\n initApproxMat.at<double>( row ) = initApprox.at(row).imag();\n }\n const auto invLogisticBase =\n cv::Mat{ logisticBaseMat.inv( cv::DECOMP_SVD ) };\n const auto bestApproxMat =\n cv::Mat{ invLogisticBase * initApproxMat };\n\n auto swarm = std::vector<std::vector<double> >( params.swarmSize );\n auto rng = std::mt19937{};\n {\n auto normal_dist = std::normal_distribution<>{};\n auto uniform = std::uniform_real_distribution<double>{-1,1};\n for ( auto & x : swarm )\n {\n const auto sigmaDev = params.sigmaDevUnits * factor;\n const auto tauDev = params.tauDevUnits * factor;\n const auto initTau = params.initTauUnits * factor;\n const auto nodeDev = params.nodeDevUnits * factor;\n const auto angleDev = params.angleDevDegs\/180*cu::pi;\n for ( auto i = size_t{0}; i < nodes.size(); ++i )\n {\n x.push_back( params.amplitudeDev*normal_dist(rng) );\n x.push_back( nodes[i] + nodeDev*normal_dist(rng) );\n }\n for ( auto i = size_t{0}; i < nodes.size(); ++i )\n {\n x.push_back( bestApproxMat.at<double>( i ) +\n angleDev*uniform(rng) );\n x.push_back( nodes[i] );\n }\n x.push_back( initSigma + sigmaDev*normal_dist(rng) );\n x.push_back( initTau + tauDev*normal_dist(rng) );\n }\n if ( currentImf < bestParamSets.size() )\n swarm.front() = bestParamSets.at(currentImf);\n }\n\n \/\/ cost function for optimization\n const auto cost = [&f, nSamples]( std::vector<double> v ) -> double\n {\n return costFunction( f,\n getSamplesFromParams( std::move(v), nSamples ) );\n };\n\n \/\/ function which returns whether the\n \/\/ optimization algorithm shall terminate.\n const auto shallTerminate = [&]( const decltype(swarm) & )-> bool\n {\n ++nIter;\n const auto nextImf = params.howToContinue( nIter );\n if ( nextImf == ~size_t{0} )\n {\n done = true;\n return true;\n }\n if ( nextImf == currentImf )\n return false;\n currentImf = nextImf;\n return true;\n };\n\n \/\/ function which is called by the optimization algorithm\n \/\/ each time the best fit is improved.\n auto bestParams = std::vector<double>{};\n const auto sendBestFit = [&](\n const std::vector<double> & v_, double cost )\n {\n bestParams = v_;\n params.receiveBestFit(bestParams,cost,nSamples,nIter,f);\n };\n\n \/\/ perform the optimization.\n swarm = cu::differentialEvolution(\n std::move(swarm), params.crossOverProb, params.diffWeight,\n cost, shallTerminate, sendBestFit, rng );\n\n const auto bestImf = calculateImfFromPairsOfReals(\n getSamplesFromParams( bestParams, nSamples ) );\n if ( oldImf >= imfs.size() )\n {\n CU_ASSERT_THROW( oldImf == imfs.size(),\n \"Invalid IMF index. Have some indexes been skipped?\" );\n imfs.push_back({});\n bestParamSets.push_back({});\n }\n imfs[oldImf] = bestImf;\n bestParamSets[oldImf] = bestParams;\n } \/\/ while loop\n return imfs;\n}\n\n} \/\/ namespace dimf\n<|endoftext|>"} {"text":"<commit_before>\/\/ Copyright 2019 DeepMind Technologies 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#include \"open_spiel\/abseil-cpp\/absl\/flags\/flag.h\"\n#include \"open_spiel\/abseil-cpp\/absl\/flags\/usage.h\"\n#include \"open_spiel\/abseil-cpp\/absl\/flags\/parse.h\"\n#include \"open_spiel\/higc\/referee.h\"\n\nABSL_FLAG(std::string, bots_dir, \"higc\/bots\",\n \"Directory containing the competition bots.\");\n\nnamespace open_spiel {\nnamespace higc {\nnamespace {\n\nvoid PlaySingleMatchIIGS() {\n std::string bot_first_action = absl::StrCat(absl::GetFlag(FLAGS_bots_dir),\n \"\/test_bot_first_action.sh\");\n open_spiel::higc::Referee\n ref(\"goofspiel(imp_info=True,points_order=descending)\",\n {bot_first_action, bot_first_action}, \/*seed=*\/42,\n \/\/ Increase times for Python scripts.\n TournamentSettings{\n .timeout_ready = 2000,\n .timeout_start = 500,\n });\n std::unique_ptr<TournamentResults> results = ref.PlayTournament(1);\n SPIEL_CHECK_EQ(results->num_matches(), 1);\n SPIEL_CHECK_TRUE(results->matches[0].terminal->IsTerminal());\n SPIEL_CHECK_EQ(results->matches[0].terminal->HistoryString(),\n \"0, 0, 1, 1, 2, 2, 3, 3, 4, 4, 5, 5, \"\n \"6, 6, 7, 7, 8, 8, 9, 9, 10, 10, 11, 11\");\n}\n\nvoid TestInvalidBots() {\n std::string bot_first_action = absl::StrCat(absl::GetFlag(FLAGS_bots_dir),\n \"\/test_bot_first_action.sh\");\n std::vector<std::string> failing_cases = {\n \"\/non_existing_bot\",\n \"\/test_bot_with_non_exec_flag\"\n };\n\n for (const std::string& failing_case : failing_cases) {\n std::cout << \"Invalid bot: \" << failing_case << std::endl;\n std::string invalid_bot = absl::StrCat(absl::GetFlag(FLAGS_bots_dir),\n failing_case);\n bool thrown = false;\n try {\n open_spiel::higc::Referee ref(\"tic_tac_toe\",\n {invalid_bot, bot_first_action});\n } catch (std::runtime_error& e) {\n std::cout << e.what() << std::endl;\n thrown = true;\n }\n SPIEL_CHECK_TRUE(thrown);\n }\n}\n\nvoid PlayWithFailingBots() {\n std::vector<std::string> failing_cases = {\n \"\/test_bot_break_pipe.sh\",\n \"\/test_bot_sleep.sh\",\n \"\/test_bot_ready.sh\",\n \"\/test_bot_start.sh\",\n \"\/test_bot_illegal_action.sh\",\n \"\/test_bot_buffer_overflow.sh\",\n \"\/test_bot_fail_after_few_actions.sh\",\n };\n\n for (int i = 0; i < failing_cases.size(); ++i) {\n const std::string& failing_case = failing_cases[i];\n std::string failing_bot = absl::StrCat(absl::GetFlag(FLAGS_bots_dir),\n failing_case);\n std::cout << \"\\n\\nFailing bot: \" << failing_bot << std::endl;\n\n \/\/ Use a single-player game.\n open_spiel::higc::Referee ref(\"cliff_walking\", {failing_bot}, \/*seed=*\/42,\n \/*settings=*\/TournamentSettings{\n \/\/ Disqualify after the 2nd failing match.\n .disqualification_rate = 0.5\n });\n std::unique_ptr<TournamentResults> results = ref.PlayTournament(2);\n SPIEL_CHECK_EQ(results->disqualified[0], true);\n if (i < 2) {\n \/\/ No matches are played, if the bot can't even start properly.\n SPIEL_CHECK_EQ(results->num_matches(), 0);\n } else {\n SPIEL_CHECK_EQ(results->num_matches(), 2);\n }\n }\n}\n\nvoid PonderActTimeout() {\n open_spiel::higc::Referee ref(\n \"leduc_poker\",\n {absl::StrCat(absl::GetFlag(FLAGS_bots_dir), \"\/random_bot_py.sh\"),\n absl::StrCat(absl::GetFlag(FLAGS_bots_dir), \"\/test_bot_start.sh\")},\n \/*seed=*\/42,\n \/\/ Increase times for Python scripts.\n TournamentSettings{\n .timeout_ready = 2000,\n .timeout_start = 500,\n });\n std::unique_ptr<TournamentResults> results = ref.PlayTournament(1);\n SPIEL_CHECK_EQ(results->num_matches(), 1);\n}\n\nvoid PlayManyRandomMatches(int num_matches = 5) {\n open_spiel::higc::Referee ref(\n \"leduc_poker\",\n {absl::StrCat(absl::GetFlag(FLAGS_bots_dir), \"\/random_bot_py.sh\"),\n absl::StrCat(absl::GetFlag(FLAGS_bots_dir), \"\/random_bot_cpp.sh\")},\n \/*seed=*\/42,\n \/\/ Increase times for Python scripts.\n TournamentSettings{\n .timeout_ready = 2000,\n .timeout_start = 500,\n });\n std::unique_ptr<TournamentResults> results = ref.PlayTournament(num_matches);\n SPIEL_CHECK_EQ(results->num_matches(), num_matches);\n results->PrintCsv(std::cout, \/*print_header=*\/true);\n}\n\nvoid PlayWithManyPlayers() {\n constexpr const int num_bots = 8;\n std::vector<std::string> bots;\n for (int i = 0; i < num_bots; ++i) {\n bots.push_back(absl::StrCat(absl::GetFlag(FLAGS_bots_dir),\n \"\/random_bot_cpp.sh\"));\n }\n open_spiel::higc::Referee ref(\n absl::StrCat(\"goofspiel(players=\",num_bots,\n \",imp_info=True,points_order=descending)\"),\n bots,\n \/*seed=*\/42,\n \/\/ Increase times for Python scripts.\n TournamentSettings{\n .timeout_ready = 2000,\n .timeout_start = 500,\n });\n std::unique_ptr<TournamentResults> results = ref.PlayTournament(1);\n SPIEL_CHECK_EQ(results->num_matches(), 1);\n}\n\n} \/\/ namespace\n} \/\/ namespace higc\n} \/\/ namespace open_spiel\n\nint main(int argc, char** argv) {\n absl::ParseCommandLine(argc, argv);\n open_spiel::higc::TestInvalidBots();\n open_spiel::higc::PlayWithFailingBots();\n open_spiel::higc::PonderActTimeout();\n open_spiel::higc::PlayWithManyPlayers();\n open_spiel::higc::PlaySingleMatchIIGS();\n open_spiel::higc::PlayManyRandomMatches();\n}\n<commit_msg>Catch SIGPIPE signals so the ctest does not abort.<commit_after>\/\/ Copyright 2019 DeepMind Technologies 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#include \"open_spiel\/abseil-cpp\/absl\/flags\/flag.h\"\n#include \"open_spiel\/abseil-cpp\/absl\/flags\/usage.h\"\n#include \"open_spiel\/abseil-cpp\/absl\/flags\/parse.h\"\n#include \"open_spiel\/higc\/referee.h\"\n\nABSL_FLAG(std::string, bots_dir, \"higc\/bots\",\n \"Directory containing the competition bots.\");\n\nnamespace open_spiel {\nnamespace higc {\nnamespace {\n\nvoid PlaySingleMatchIIGS() {\n std::string bot_first_action = absl::StrCat(absl::GetFlag(FLAGS_bots_dir),\n \"\/test_bot_first_action.sh\");\n open_spiel::higc::Referee\n ref(\"goofspiel(imp_info=True,points_order=descending)\",\n {bot_first_action, bot_first_action}, \/*seed=*\/42,\n \/\/ Increase times for Python scripts.\n TournamentSettings{\n .timeout_ready = 2000,\n .timeout_start = 500,\n });\n std::unique_ptr<TournamentResults> results = ref.PlayTournament(1);\n SPIEL_CHECK_EQ(results->num_matches(), 1);\n SPIEL_CHECK_TRUE(results->matches[0].terminal->IsTerminal());\n SPIEL_CHECK_EQ(results->matches[0].terminal->HistoryString(),\n \"0, 0, 1, 1, 2, 2, 3, 3, 4, 4, 5, 5, \"\n \"6, 6, 7, 7, 8, 8, 9, 9, 10, 10, 11, 11\");\n}\n\nvoid TestInvalidBots() {\n std::string bot_first_action = absl::StrCat(absl::GetFlag(FLAGS_bots_dir),\n \"\/test_bot_first_action.sh\");\n std::vector<std::string> failing_cases = {\n \"\/non_existing_bot\",\n \"\/test_bot_with_non_exec_flag\"\n };\n\n for (const std::string& failing_case : failing_cases) {\n std::cout << \"Invalid bot: \" << failing_case << std::endl;\n std::string invalid_bot = absl::StrCat(absl::GetFlag(FLAGS_bots_dir),\n failing_case);\n bool thrown = false;\n try {\n open_spiel::higc::Referee ref(\"tic_tac_toe\",\n {invalid_bot, bot_first_action});\n } catch (std::runtime_error& e) {\n std::cout << e.what() << std::endl;\n thrown = true;\n }\n SPIEL_CHECK_TRUE(thrown);\n }\n}\n\nvoid PlayWithFailingBots() {\n std::vector<std::string> failing_cases = {\n \"\/test_bot_break_pipe.sh\",\n \"\/test_bot_sleep.sh\",\n \"\/test_bot_ready.sh\",\n \"\/test_bot_start.sh\",\n \"\/test_bot_illegal_action.sh\",\n \"\/test_bot_buffer_overflow.sh\",\n \"\/test_bot_fail_after_few_actions.sh\",\n };\n\n for (int i = 0; i < failing_cases.size(); ++i) {\n const std::string& failing_case = failing_cases[i];\n std::string failing_bot = absl::StrCat(absl::GetFlag(FLAGS_bots_dir),\n failing_case);\n std::cout << \"\\n\\nFailing bot: \" << failing_bot << std::endl;\n\n \/\/ Use a single-player game.\n open_spiel::higc::Referee ref(\"cliff_walking\", {failing_bot}, \/*seed=*\/42,\n \/*settings=*\/TournamentSettings{\n \/\/ Disqualify after the 2nd failing match.\n .disqualification_rate = 0.5\n });\n std::unique_ptr<TournamentResults> results = ref.PlayTournament(2);\n SPIEL_CHECK_EQ(results->disqualified[0], true);\n if (i < 2) {\n \/\/ No matches are played, if the bot can't even start properly.\n SPIEL_CHECK_EQ(results->num_matches(), 0);\n } else {\n SPIEL_CHECK_EQ(results->num_matches(), 2);\n }\n }\n}\n\nvoid PonderActTimeout() {\n open_spiel::higc::Referee ref(\n \"leduc_poker\",\n {absl::StrCat(absl::GetFlag(FLAGS_bots_dir), \"\/random_bot_py.sh\"),\n absl::StrCat(absl::GetFlag(FLAGS_bots_dir), \"\/test_bot_start.sh\")},\n \/*seed=*\/42,\n \/\/ Increase times for Python scripts.\n TournamentSettings{\n .timeout_ready = 2000,\n .timeout_start = 500,\n });\n std::unique_ptr<TournamentResults> results = ref.PlayTournament(1);\n SPIEL_CHECK_EQ(results->num_matches(), 1);\n}\n\nvoid PlayManyRandomMatches(int num_matches = 5) {\n open_spiel::higc::Referee ref(\n \"leduc_poker\",\n {absl::StrCat(absl::GetFlag(FLAGS_bots_dir), \"\/random_bot_py.sh\"),\n absl::StrCat(absl::GetFlag(FLAGS_bots_dir), \"\/random_bot_cpp.sh\")},\n \/*seed=*\/42,\n \/\/ Increase times for Python scripts.\n TournamentSettings{\n .timeout_ready = 2000,\n .timeout_start = 500,\n });\n std::unique_ptr<TournamentResults> results = ref.PlayTournament(num_matches);\n SPIEL_CHECK_EQ(results->num_matches(), num_matches);\n results->PrintCsv(std::cout, \/*print_header=*\/true);\n}\n\nvoid PlayWithManyPlayers() {\n constexpr const int num_bots = 8;\n std::vector<std::string> bots;\n for (int i = 0; i < num_bots; ++i) {\n bots.push_back(absl::StrCat(absl::GetFlag(FLAGS_bots_dir),\n \"\/random_bot_cpp.sh\"));\n }\n open_spiel::higc::Referee ref(\n absl::StrCat(\"goofspiel(players=\",num_bots,\n \",imp_info=True,points_order=descending)\"),\n bots,\n \/*seed=*\/42,\n \/\/ Increase times for Python scripts.\n TournamentSettings{\n .timeout_ready = 2000,\n .timeout_start = 500,\n });\n std::unique_ptr<TournamentResults> results = ref.PlayTournament(1);\n SPIEL_CHECK_EQ(results->num_matches(), 1);\n}\n\n} \/\/ namespace\n} \/\/ namespace higc\n} \/\/ namespace open_spiel\n\n\/\/ Reroute the SIGPIPE signall here, so the test pass ok.\nvoid signal_callback_handler(int signum) {\n std::cout << \"Caught signal SIGPIPE \" << signum << std::endl;\n}\n\nint main(int argc, char** argv) {\n absl::ParseCommandLine(argc, argv);\n signal(SIGPIPE, signal_callback_handler);\n\n open_spiel::higc::TestInvalidBots();\n open_spiel::higc::PlayWithFailingBots();\n open_spiel::higc::PonderActTimeout();\n open_spiel::higc::PlayWithManyPlayers();\n open_spiel::higc::PlaySingleMatchIIGS();\n open_spiel::higc::PlayManyRandomMatches();\n}\n<|endoftext|>"} {"text":"<commit_before>#include \"fid\/base_fid.h\"\n\nnamespace fid {\n\nvoid BaseFid::Init()\n{\n \/\/ Prevent memory issues with the TF1s.\n TF1::DefaultAddToGlobalList(false);\n\n \/\/ Initialize the health properly.\n health_ = 100.0;\n\n \/\/ Resize the temp array (maybe others?)\n temp_.reserve(wf_.size());\n\n \/\/ Initialize the BaseFid for analysis\n LoadParams();\n CenterFid();\n CalcNoise();\n CalcMaxAmp();\n FindFidRange();\n InitHook();\n\n CalcFreq();\n\n \/\/ Flag the FID as bad if it's negative.\n if (freq_ < 0.0) {\n health_ = 0.0;\n }\n \n \/\/ Else calculate a health based on signal to noise.\n if (max_amp_ < noise_ * snr_thresh_) {\n health_ *= max_amp_ \/ (noise_ * snr_thresh_);\n }\n\n \/\/ And factor fid duration into health.\n if (f_wf_ - i_wf_ < wf_.size() * len_thresh_) {\n health_ *= (f_wf_ - i_wf_) \/ (wf_.size() * len_thresh_);\n }\n}\n\n\n\/\/ Load FID data from a formatted text file.\nvoid BaseFid::LoadTextData(std::string filename)\n{\n \/\/ open the file first\n std::ifstream in(filename);\n\n \/\/ shrink vectors\n wf_.resize(0);\n tm_.resize(0);\n\n double wf_temp;\n double tm_temp;\n\n while (in.good()) {\n in >> tm_temp >> wf_temp;\n tm_.push_back(tm_temp);\n wf_.push_back(wf_temp);\n } \n}\n\n\n\/\/ Load all the current parameters in the fid::params namespace.\nvoid BaseFid::LoadParams()\n{\n edge_width_ = params::edge_width;\n edge_ignore_ = params::edge_ignore; \n start_amplitude_ = params::start_amplitude; \n max_phase_jump_ = params::max_phase_jump; \n low_pass_freq_ = params::low_pass_freq; \n fft_peak_width_ = params::fft_peak_width;\n centroid_thresh_ = params::centroid_thresh; \n hyst_thresh_ = params::hyst_thresh; \n snr_thresh_ = params::snr_thresh;\n len_thresh_ = params::len_thresh;\n freq_method_ = params::freq_method;\n}\n\n\nvoid BaseFid::CenterFid()\n{\n int w = edge_width_;\n double sum = std::accumulate(wf_.begin(), wf_.begin() + w, 0.0);\n double avg = sum \/ w; \/\/ to pass into lambda\n mean_ = avg; \/\/ save to class\n\n std::for_each(wf_.begin(), wf_.end(), [avg](double& x){ x -= avg; });\n}\n\n\nvoid BaseFid::CalcNoise()\n{ \n \/\/ Grab a new handle to the noise window width for aesthetics.\n int i = edge_ignore_;\n int f = edge_width_ + i;\n\n \/\/ Find the noise level in the head and tail.\n double head = stdev(wf_.begin() + i, wf_.begin() + f);\n double tail = stdev(wf_.rbegin() + i, wf_.rbegin() + f);\n\n \/\/ Take the smaller of the two.\n noise_ = (tail < head) ? (tail) : (head);\n}\n\n\nvoid BaseFid::CalcMaxAmp() \n{\n auto mm = std::minmax_element(wf_.begin(), wf_.end());\n\n if (std::abs(*mm.first) > std::abs(*mm.second)) {\n\n max_amp_ = std::abs(*mm.first);\n\n } else {\n\n max_amp_ = std::abs(*mm.second);\n }\n}\n\n\nvoid BaseFid::FindFidRange()\n{\n \/\/ Find the starting and ending points\n double thresh = start_amplitude_ * max_amp_;\n bool checks_out = false;\n\n \/\/ Find the first element with magnitude larger than thresh\n auto it_1 = wf_.begin() + edge_ignore_;\n\n while (!checks_out) {\n\n \/\/ Check if the point is above threshold.\n auto it_i = std::find_if(it_1, wf_.end(), \n [thresh](double x) { \n return std::abs(x) > thresh; \n });\n\n \/\/ Make sure the point is not with one of the vector's end.\n if ((it_i != wf_.end()) && (it_i + 1 != wf_.end())) {\n\n \/\/ Check if the next point is also over threshold.\n checks_out = std::abs(*(it_i + 1)) > thresh;\n\n \/\/ Increase the comparison starting point.\n it_1 = it_i + 1;\n\n \/\/ Turn the iterator into an index\n if (checks_out) {\n i_wf_ = std::distance(wf_.begin(), it_i);\n }\n\n } else {\n\n \/\/ If we have reached the end, mark it as the last.\n i_wf_ = std::distance(wf_.begin(), wf_.end());\n break;\n }\n }\n\n \/\/ Find the next element with magnitude lower than thresh\n auto it_2 = std::find_if(wf_.begin() + i_wf_, wf_.end(),\n [thresh](double x) {\n return std::abs(x) < 0.8 * thresh;\n });\n\n checks_out = false;\n\n while (!checks_out) {\n\n \/\/ Find the range around a peak.\n auto it_i = std::find_if(it_2, wf_.end(), \n [thresh](double x) {\n return std::abs(x) > 0.8 * thresh;\n });\n\n auto it_f = std::find_if(it_i + 1, wf_.end(),\n [thresh](double x) {\n return std::abs(x) < 0.8 * thresh;\n });\n\n \/\/ Now check if the peak actually made it over threshold.\n if ((it_i != wf_.end()) && (it_f != wf_.end())) {\n\n auto mm = std::minmax_element(it_i, it_f);\n\n if ((*mm.first < -thresh) || (*mm.second > thresh)) {\n\n it_2 = it_f;\n\n } else {\n\n checks_out = true;\n }\n\n \/\/ Turn the iterator into an index\n if (checks_out) {\n f_wf_ = std::distance(wf_.begin(), it_f);\n }\n \n } else {\n\n f_wf_ = std::distance(wf_.begin(), wf_.end());\n break;\n }\n }\n\n \/\/ Gradients can cause a waist in the amplitude.\n \/\/ Mark the signal as bad if it didn't find signal above threshold.\n if (i_wf_ > wf_.size() * 0.95 || i_wf_ >= f_wf_) {\n\n health_ = 0.0;\n\n i_wf_ = 0;\n f_wf_ = wf_.size() * 0.01;\n } \n}\n\n\n\/\/ Save the interanl TGraph.\nvoid BaseFid::SaveGraph(std::string filename, std::string title)\n{ \n gr_.SetTitle(title.c_str());\n gr_.Draw();\n c1_.Print(filename.c_str());\n}\n\n\n\/\/ Save a plot of FID waveform.\nvoid BaseFid::SavePlot(std::string filename, std::string title)\n{\n \/\/ If no title supplied give a reasonable default.\n if (title == \"\") {\n\n title = std::string(\"FID; time [ms]; amplitude [a.u.]\");\n\n } else {\n\n \/\/ In case they didn't append x\/y labels.\n title.append(\"; time [ms]; amplitude [a.u.]\");\n }\n\n gr_ = TGraph(wf_.size(), &tm_[0], &wf_[0]);\n\n SaveGraph(filename, title);\n}\n\n\n\/\/ Print the time series fit from an FID.\nvoid BaseFid::SaveTimeFit(std::string filename, std::string title)\n{\n if (title == \"\") {\n\n title = std::string(\"Time Series Fit; time [ms]; amplitude [a.u.]\");\n\n } else {\n\n \/\/ In case they didn't append x\/y labels.\n title.append(\"; time [ms]; amplitude [a.u.]\");\n } \n\n \/\/ Copy the current time fit graph.\n gr_ = gr_time_series_;\n SaveGraph(filename, title);\n}\n\n\/\/ Print the time series fit from an FID.\nvoid BaseFid::SaveFreqFit(std::string filename, std::string title)\n{\n if (title == \"\") {\n\n title = std::string(\"Frequency Series Fit; time [ms]; amplitude [a.u.]\");\n\n } else {\n\n \/\/ In case they didn't append x\/y labels.\n title.append(\"; freq [kHz]; amplitude [a.u.]\");\n } \n\n \/\/ Copy the current time fit graph.\n gr_ = gr_freq_series_;\n SaveGraph(filename, title);\n}\n\nvoid BaseFid::SaveTimeRes(std::string filename, std::string title)\n{\n if (title == \"\") {\n\n title = std::string(\"Time Series Fit Residuals; time [ms]; amplitude [a.u.]\");\n\n } else {\n\n \/\/ In case they didn't append x\/y labels.\n title.append(\"; time [ms]; amplitude [a.u.]\");\n } \n\n \/\/ Copy the current time fit.\n gr_ = gr_time_series_;\n\n \/\/ Set the points\n for (uint i = 0; i < res_.size(); ++i){\n static double x, y;\n\n gr_.GetPoint(i, x, y);\n gr_.SetPoint(i, x, res_[i]); \n }\n\n SaveGraph(filename, title);\n}\n\n\nvoid BaseFid::SaveFreqRes(std::string filename, std::string title)\n{\n if (title == \"\") {\n\n title = std::string(\"Freq Series Fit Residuals; time [ms]; amplitude [a.u.]\");\n\n } else {\n\n \/\/ In case they didn't append x\/y labels.\n title.append(\"; freq [kHz]; amplitude [a.u.]\");\n } \n\n \/\/ Copy the current time fit.\n gr_ = gr_freq_series_;\n\n \/\/ Set the points\n for (uint i = 0; i < res_.size(); ++i){\n static double x, y;\n\n gr_.GetPoint(i, x, y);\n gr_.SetPoint(i, x, res_[i]); \n }\n\n SaveGraph(filename, title);\n}\n\n\n\/\/ Save the FID data to a text file as \"<time> <amp>\".\nvoid BaseFid::SaveData(std::string filename)\n{\n \/\/ open the file first\n std::ofstream out(filename);\n\n for (int i = 0; i < tm_.size(); ++i) {\n out << tm_[i] << \" \" << wf_[i] << std::endl;\n }\n}\n\n\nvoid BaseFid::DiagnosticInfo(std::ostream& out)\n{\n using std::endl;\n\n \/\/ Save the flags, set them to defaults.\n auto flags = out.flags();\n std::ofstream testout;\n out.flags(testout.flags());\n\n out << std::string(80, '<') << endl << std::string(4, ' ');\n out << \"Diagostic Information for Fid @ \" << this << endl;\n out << std::string(80, '<') << endl;\n\n out << \" Fid Waveform Characteristics\" << endl;\n out << \" mean: \" << mean_ << endl;\n out << \" amplitude: \" << max_amp_ << endl;\n out << \" noise: \" << noise_ << endl;\n out << \" start time: \" << i_wf_;\n out << \" (\" << tm_[i_wf_] << \" ms)\" << endl;\n out << \" stop time: \" << f_wf_ - 1;\n out << \" (\" << tm_[f_wf_ - 1] << \" ms)\" << endl;\n out << \" health: \" << health_ << endl;\n out << std::string(80, '>') << endl << endl;\n \n \/\/ Restore set flags.\n out.flags(flags);\n}\n\n\nvoid BaseFid::DiagnosticPlot(std::string dirname, std::string filestub)\n{\n boost::filesystem::path dir(dirname);\n boost::filesystem::create_directories(dir);\n\n SaveFreqFit(dir.string() + filestub + std::string(\"_freq_fit.png\"));\n SaveTimeFit(dir.string() + filestub + std::string(\"_time_fit.png\"));\n SaveFreqRes(dir.string() + filestub + std::string(\"_freq_res.png\"));\n SaveTimeRes(dir.string() + filestub + std::string(\"_time_res.png\"));\n}\n\n\nvoid BaseFid::DiagnosticDump(std::string dirname, std::string filestub)\n{\n \/\/ Make the plots first, that will create the directory if needed.\n DiagnosticPlot(dirname, filestub);\n\n std::ofstream out;\n boost::filesystem::path dir(dirname);\n\n std::string str = dir.string() + std::string(\"libfid.log\");\n out.open(str , std::ofstream::out | std::ofstream::app);\n\n DiagnosticInfo(out);\n out.close();\n}\n\n} \/\/ fid\n<commit_msg>Adds compatibility with root5 back.<commit_after>#include \"fid\/base_fid.h\"\n\nnamespace fid {\n\nvoid BaseFid::Init()\n{\n \/\/ Prevent memory issues with the TF1s in root6.\n#ifdef __ROOTCLING__\n TF1::DefaultAddToGlobalList(false);\n#endif\n\n \/\/ Initialize the health properly.\n health_ = 100.0;\n\n \/\/ Resize the temp array (maybe others?)\n temp_.reserve(wf_.size());\n\n \/\/ Initialize the BaseFid for analysis\n LoadParams();\n CenterFid();\n CalcNoise();\n CalcMaxAmp();\n FindFidRange();\n InitHook();\n\n CalcFreq();\n\n \/\/ Flag the FID as bad if it's negative.\n if (freq_ < 0.0) {\n health_ = 0.0;\n }\n \n \/\/ Else calculate a health based on signal to noise.\n if (max_amp_ < noise_ * snr_thresh_) {\n health_ *= max_amp_ \/ (noise_ * snr_thresh_);\n }\n\n \/\/ And factor fid duration into health.\n if (f_wf_ - i_wf_ < wf_.size() * len_thresh_) {\n health_ *= (f_wf_ - i_wf_) \/ (wf_.size() * len_thresh_);\n }\n}\n\n\n\/\/ Load FID data from a formatted text file.\nvoid BaseFid::LoadTextData(std::string filename)\n{\n \/\/ open the file first\n std::ifstream in(filename);\n\n \/\/ shrink vectors\n wf_.resize(0);\n tm_.resize(0);\n\n double wf_temp;\n double tm_temp;\n\n while (in.good()) {\n in >> tm_temp >> wf_temp;\n tm_.push_back(tm_temp);\n wf_.push_back(wf_temp);\n } \n}\n\n\n\/\/ Load all the current parameters in the fid::params namespace.\nvoid BaseFid::LoadParams()\n{\n edge_width_ = params::edge_width;\n edge_ignore_ = params::edge_ignore; \n start_amplitude_ = params::start_amplitude; \n max_phase_jump_ = params::max_phase_jump; \n low_pass_freq_ = params::low_pass_freq; \n fft_peak_width_ = params::fft_peak_width;\n centroid_thresh_ = params::centroid_thresh; \n hyst_thresh_ = params::hyst_thresh; \n snr_thresh_ = params::snr_thresh;\n len_thresh_ = params::len_thresh;\n freq_method_ = params::freq_method;\n}\n\n\nvoid BaseFid::CenterFid()\n{\n int w = edge_width_;\n double sum = std::accumulate(wf_.begin(), wf_.begin() + w, 0.0);\n double avg = sum \/ w; \/\/ to pass into lambda\n mean_ = avg; \/\/ save to class\n\n std::for_each(wf_.begin(), wf_.end(), [avg](double& x){ x -= avg; });\n}\n\n\nvoid BaseFid::CalcNoise()\n{ \n \/\/ Grab a new handle to the noise window width for aesthetics.\n int i = edge_ignore_;\n int f = edge_width_ + i;\n\n \/\/ Find the noise level in the head and tail.\n double head = stdev(wf_.begin() + i, wf_.begin() + f);\n double tail = stdev(wf_.rbegin() + i, wf_.rbegin() + f);\n\n \/\/ Take the smaller of the two.\n noise_ = (tail < head) ? (tail) : (head);\n}\n\n\nvoid BaseFid::CalcMaxAmp() \n{\n auto mm = std::minmax_element(wf_.begin(), wf_.end());\n\n if (std::abs(*mm.first) > std::abs(*mm.second)) {\n\n max_amp_ = std::abs(*mm.first);\n\n } else {\n\n max_amp_ = std::abs(*mm.second);\n }\n}\n\n\nvoid BaseFid::FindFidRange()\n{\n \/\/ Find the starting and ending points\n double thresh = start_amplitude_ * max_amp_;\n bool checks_out = false;\n\n \/\/ Find the first element with magnitude larger than thresh\n auto it_1 = wf_.begin() + edge_ignore_;\n\n while (!checks_out) {\n\n \/\/ Check if the point is above threshold.\n auto it_i = std::find_if(it_1, wf_.end(), \n [thresh](double x) { \n return std::abs(x) > thresh; \n });\n\n \/\/ Make sure the point is not with one of the vector's end.\n if ((it_i != wf_.end()) && (it_i + 1 != wf_.end())) {\n\n \/\/ Check if the next point is also over threshold.\n checks_out = std::abs(*(it_i + 1)) > thresh;\n\n \/\/ Increase the comparison starting point.\n it_1 = it_i + 1;\n\n \/\/ Turn the iterator into an index\n if (checks_out) {\n i_wf_ = std::distance(wf_.begin(), it_i);\n }\n\n } else {\n\n \/\/ If we have reached the end, mark it as the last.\n i_wf_ = std::distance(wf_.begin(), wf_.end());\n break;\n }\n }\n\n \/\/ Find the next element with magnitude lower than thresh\n auto it_2 = std::find_if(wf_.begin() + i_wf_, wf_.end(),\n [thresh](double x) {\n return std::abs(x) < 0.8 * thresh;\n });\n\n checks_out = false;\n\n while (!checks_out) {\n\n \/\/ Find the range around a peak.\n auto it_i = std::find_if(it_2, wf_.end(), \n [thresh](double x) {\n return std::abs(x) > 0.8 * thresh;\n });\n\n auto it_f = std::find_if(it_i + 1, wf_.end(),\n [thresh](double x) {\n return std::abs(x) < 0.8 * thresh;\n });\n\n \/\/ Now check if the peak actually made it over threshold.\n if ((it_i != wf_.end()) && (it_f != wf_.end())) {\n\n auto mm = std::minmax_element(it_i, it_f);\n\n if ((*mm.first < -thresh) || (*mm.second > thresh)) {\n\n it_2 = it_f;\n\n } else {\n\n checks_out = true;\n }\n\n \/\/ Turn the iterator into an index\n if (checks_out) {\n f_wf_ = std::distance(wf_.begin(), it_f);\n }\n \n } else {\n\n f_wf_ = std::distance(wf_.begin(), wf_.end());\n break;\n }\n }\n\n \/\/ Gradients can cause a waist in the amplitude.\n \/\/ Mark the signal as bad if it didn't find signal above threshold.\n if (i_wf_ > wf_.size() * 0.95 || i_wf_ >= f_wf_) {\n\n health_ = 0.0;\n\n i_wf_ = 0;\n f_wf_ = wf_.size() * 0.01;\n } \n}\n\n\n\/\/ Save the interanl TGraph.\nvoid BaseFid::SaveGraph(std::string filename, std::string title)\n{ \n gr_.SetTitle(title.c_str());\n gr_.Draw();\n c1_.Print(filename.c_str());\n}\n\n\n\/\/ Save a plot of FID waveform.\nvoid BaseFid::SavePlot(std::string filename, std::string title)\n{\n \/\/ If no title supplied give a reasonable default.\n if (title == \"\") {\n\n title = std::string(\"FID; time [ms]; amplitude [a.u.]\");\n\n } else {\n\n \/\/ In case they didn't append x\/y labels.\n title.append(\"; time [ms]; amplitude [a.u.]\");\n }\n\n gr_ = TGraph(wf_.size(), &tm_[0], &wf_[0]);\n\n SaveGraph(filename, title);\n}\n\n\n\/\/ Print the time series fit from an FID.\nvoid BaseFid::SaveTimeFit(std::string filename, std::string title)\n{\n if (title == \"\") {\n\n title = std::string(\"Time Series Fit; time [ms]; amplitude [a.u.]\");\n\n } else {\n\n \/\/ In case they didn't append x\/y labels.\n title.append(\"; time [ms]; amplitude [a.u.]\");\n } \n\n \/\/ Copy the current time fit graph.\n gr_ = gr_time_series_;\n SaveGraph(filename, title);\n}\n\n\/\/ Print the time series fit from an FID.\nvoid BaseFid::SaveFreqFit(std::string filename, std::string title)\n{\n if (title == \"\") {\n\n title = std::string(\"Frequency Series Fit; time [ms]; amplitude [a.u.]\");\n\n } else {\n\n \/\/ In case they didn't append x\/y labels.\n title.append(\"; freq [kHz]; amplitude [a.u.]\");\n } \n\n \/\/ Copy the current time fit graph.\n gr_ = gr_freq_series_;\n SaveGraph(filename, title);\n}\n\nvoid BaseFid::SaveTimeRes(std::string filename, std::string title)\n{\n if (title == \"\") {\n\n title = std::string(\"Time Series Fit Residuals; time [ms]; amplitude [a.u.]\");\n\n } else {\n\n \/\/ In case they didn't append x\/y labels.\n title.append(\"; time [ms]; amplitude [a.u.]\");\n } \n\n \/\/ Copy the current time fit.\n gr_ = gr_time_series_;\n\n \/\/ Set the points\n for (uint i = 0; i < res_.size(); ++i){\n static double x, y;\n\n gr_.GetPoint(i, x, y);\n gr_.SetPoint(i, x, res_[i]); \n }\n\n SaveGraph(filename, title);\n}\n\n\nvoid BaseFid::SaveFreqRes(std::string filename, std::string title)\n{\n if (title == \"\") {\n\n title = std::string(\"Freq Series Fit Residuals; time [ms]; amplitude [a.u.]\");\n\n } else {\n\n \/\/ In case they didn't append x\/y labels.\n title.append(\"; freq [kHz]; amplitude [a.u.]\");\n } \n\n \/\/ Copy the current time fit.\n gr_ = gr_freq_series_;\n\n \/\/ Set the points\n for (uint i = 0; i < res_.size(); ++i){\n static double x, y;\n\n gr_.GetPoint(i, x, y);\n gr_.SetPoint(i, x, res_[i]); \n }\n\n SaveGraph(filename, title);\n}\n\n\n\/\/ Save the FID data to a text file as \"<time> <amp>\".\nvoid BaseFid::SaveData(std::string filename)\n{\n \/\/ open the file first\n std::ofstream out(filename);\n\n for (int i = 0; i < tm_.size(); ++i) {\n out << tm_[i] << \" \" << wf_[i] << std::endl;\n }\n}\n\n\nvoid BaseFid::DiagnosticInfo(std::ostream& out)\n{\n using std::endl;\n\n \/\/ Save the flags, set them to defaults.\n auto flags = out.flags();\n std::ofstream testout;\n out.flags(testout.flags());\n\n out << std::string(80, '<') << endl << std::string(4, ' ');\n out << \"Diagostic Information for Fid @ \" << this << endl;\n out << std::string(80, '<') << endl;\n\n out << \" Fid Waveform Characteristics\" << endl;\n out << \" mean: \" << mean_ << endl;\n out << \" amplitude: \" << max_amp_ << endl;\n out << \" noise: \" << noise_ << endl;\n out << \" start time: \" << i_wf_;\n out << \" (\" << tm_[i_wf_] << \" ms)\" << endl;\n out << \" stop time: \" << f_wf_ - 1;\n out << \" (\" << tm_[f_wf_ - 1] << \" ms)\" << endl;\n out << \" health: \" << health_ << endl;\n out << std::string(80, '>') << endl << endl;\n \n \/\/ Restore set flags.\n out.flags(flags);\n}\n\n\nvoid BaseFid::DiagnosticPlot(std::string dirname, std::string filestub)\n{\n boost::filesystem::path dir(dirname);\n boost::filesystem::create_directories(dir);\n\n SaveFreqFit(dir.string() + filestub + std::string(\"_freq_fit.png\"));\n SaveTimeFit(dir.string() + filestub + std::string(\"_time_fit.png\"));\n SaveFreqRes(dir.string() + filestub + std::string(\"_freq_res.png\"));\n SaveTimeRes(dir.string() + filestub + std::string(\"_time_res.png\"));\n}\n\n\nvoid BaseFid::DiagnosticDump(std::string dirname, std::string filestub)\n{\n \/\/ Make the plots first, that will create the directory if needed.\n DiagnosticPlot(dirname, filestub);\n\n std::ofstream out;\n boost::filesystem::path dir(dirname);\n\n std::string str = dir.string() + std::string(\"libfid.log\");\n out.open(str , std::ofstream::out | std::ofstream::app);\n\n DiagnosticInfo(out);\n out.close();\n}\n\n} \/\/ fid\n<|endoftext|>"} {"text":"<commit_before>\/*\n * ScopeLink.cc\n *\n * Copyright (C) 2009, 2014, 2015 Linas Vepstas\n *\n * Author: Linas Vepstas <linasvepstas@gmail.com> January 2009\n *\n * This program is free software; you can redistribute it and\/or modify\n * it under the terms of the GNU Affero General Public License v3 as\n * published by the Free Software Foundation and including the\n * exceptions at http:\/\/opencog.org\/wiki\/Licenses\n *\n * This program is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the\n * GNU General Public License for more details.\n *\n * You should have received a copy of the GNU Affero General Public\n * License 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\/ClassServer.h>\n#include <opencog\/atoms\/TypeNode.h>\n#include <opencog\/atoms\/core\/FreeLink.h>\n#include <opencog\/atoms\/core\/LambdaLink.h>\n\n#include \"ScopeLink.h\"\n\nusing namespace opencog;\n\nvoid ScopeLink::init(void)\n{\n\textract_variables(_outgoing);\n}\n\nvoid ScopeLink::set_body(const Handle& body)\n{\n\t_body = body;\n\tif (_bodies.empty())\n\t\t_bodies.push_back(body);\n\telse\n\t\t_bodies[0] = body;\n}\n\nScopeLink::ScopeLink(const HandleSeq& oset,\n TruthValuePtr tv, AttentionValuePtr av)\n\t: Link(SCOPE_LINK, oset, tv, av)\n{\n\tinit();\n}\n\nScopeLink::ScopeLink(const Handle& vars, const Handle& body,\n TruthValuePtr tv, AttentionValuePtr av)\n\t: Link(SCOPE_LINK, HandleSeq({vars, body}), tv, av)\n{\n\tinit();\n}\n\nScopeLink::ScopeLink(Type t, const Handle& body,\n TruthValuePtr tv, AttentionValuePtr av)\n\t: Link(t, HandleSeq({body}), tv, av)\n{\n\t\/\/ Derived classes have a different initialization sequence\n\tif (SCOPE_LINK != t) return;\n\tinit();\n}\n\nScopeLink::ScopeLink(Type t, const HandleSeq& oset,\n TruthValuePtr tv, AttentionValuePtr av)\n\t: Link(t, oset, tv, av)\n{\n\t\/\/ Derived classes have a different initialization sequence\n\tif (SCOPE_LINK != t) return;\n\tinit();\n}\n\nScopeLink::ScopeLink(Link &l)\n\t: Link(l)\n{\n\t\/\/ Type must be as expected.\n\tType tscope = l.getType();\n\tif (not classserver().isA(tscope, SCOPE_LINK))\n\t{\n\t\tconst std::string& tname = classserver().getTypeName(tscope);\n\t\tthrow InvalidParamException(TRACE_INFO,\n\t\t\t\"Expecting a ScopeLink, got %s\", tname.c_str());\n\t}\n\n\t\/\/ Derived types have a different initialization sequence.\n\tif (SCOPE_LINK != tscope) return;\n\tinit();\n}\n\n\/* ================================================================= *\/\n\/\/\/\n\/\/\/ Find and unpack variable declarations, if any; otherwise, just\n\/\/\/ find all free variables.\n\/\/\/\nvoid ScopeLink::extract_variables(const HandleSeq& oset)\n{\n\tif (oset.size() == 0)\n\t\tthrow SyntaxException(TRACE_INFO,\n\t\t\t\"Expecting a non-empty outgoing set.\");\n\n\tType decls = oset.at(0)->getType();\n\n\t\/\/ If the first atom is not explicitly a variable declaration, then\n\t\/\/ there are no variable declarations. There are two cases that; can\n\t\/\/ apply here: either the body is a lambda, in which case, we copy\n\t\/\/ the variables from the lambda; else we extract all free variables.\n\tif (VARIABLE_LIST != decls and\n\t VARIABLE_NODE != decls and\n\t TYPED_VARIABLE_LINK != decls and\n\t GLOB_NODE != decls)\n\t{\n\t\tset_body(oset[0]);\n\n\t\tif (classserver().isA(_body->getType(), LAMBDA_LINK))\n\t\t{\n\t\t\tLambdaLinkPtr lam(LambdaLinkCast(_body));\n\t\t\tif (nullptr == lam)\n\t\t\t\tlam = createLambdaLink(*LinkCast(_body));\n\t\t\t_varlist = lam->get_variables();\n\t\t\tset_body(lam->get_body());\n\t\t}\n\t\telse\n\t\t{\n\t\t\t_varlist.find_variables(oset[0]);\n\t\t}\n\t\treturn;\n\t}\n\n\tif (oset.size() < 2)\n\t\tthrow SyntaxException(TRACE_INFO,\n\t\t\t\"Expecting an outgoing set size of at least two; got %s\",\n\t\t\toset[0]->toString().c_str());\n\n\t\/\/ If we are here, then the first outgoing set member should be\n\t\/\/ a variable declaration.\n\t_vardecl = oset[0];\n\tset_body(oset[1]);\n\n\t\/\/ Initialize _varlist with the scoped variables\n\tinit_scoped_variables(_vardecl);\n}\n\n\/* ================================================================= *\/\n\/\/\/\n\/\/\/ Initialize _varlist given a handle of either VariableList or a\n\/\/\/ variable.\n\/\/\/\nvoid ScopeLink::init_scoped_variables(const Handle& hvar)\n{\n\t\/\/ Use the VariableList class as a tool to extract the variables\n\t\/\/ for us.\n\tVariableList vl(hvar);\n\t_varlist = vl.get_variables();\n}\n\n\/* ================================================================= *\/\n\/\/\/\n\/\/\/ Compare other ScopeLink, return true if it is equal to this one,\n\/\/\/ up to an alpha-conversion of variables.\n\/\/\/\nbool ScopeLink::is_equal(const Handle& other) const\n{\n\tif (other == this) return true;\n\tif (other->getType() != _type) return false;\n\n\tScopeLinkPtr scother(ScopeLinkCast(other));\n\n\t\/\/ Variable declarations must match.\n\tif (not _varlist.is_equal(scother->_varlist)) return false;\n\n\t\/\/ Other body, with our variables in place of its variables,\n\t\/\/ should be same as our body.\n\tHandle altbod = scother->_varlist.substitute_nocheck(scother->_body,\n\t _varlist.varseq);\n\n\t\/\/ Compare bodies, they should match.\n\tif (*((AtomPtr)altbod) != *((AtomPtr) _body)) return false;\n\n\treturn true;\n}\n\nbool ScopeLink::operator==(const Atom& ac) const\n{\n\tAtom& a = (Atom&) ac; \/\/ cast away constness, for smart ptr.\n\treturn is_equal(a.getHandle());\n}\n\nbool ScopeLink::operator!=(const Atom& a) const\n{\n\treturn not operator==(a);\n}\n\n\/* ===================== END OF FILE ===================== *\/\n<commit_msg>Support links with multiple bodies in ScopeLink::is_equal<commit_after>\/*\n * ScopeLink.cc\n *\n * Copyright (C) 2009, 2014, 2015 Linas Vepstas\n *\n * Author: Linas Vepstas <linasvepstas@gmail.com> January 2009\n *\n * This program is free software; you can redistribute it and\/or modify\n * it under the terms of the GNU Affero General Public License v3 as\n * published by the Free Software Foundation and including the\n * exceptions at http:\/\/opencog.org\/wiki\/Licenses\n *\n * This program is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the\n * GNU General Public License for more details.\n *\n * You should have received a copy of the GNU Affero General Public\n * License 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\/ClassServer.h>\n#include <opencog\/atoms\/TypeNode.h>\n#include <opencog\/atoms\/core\/FreeLink.h>\n#include <opencog\/atoms\/core\/LambdaLink.h>\n\n#include \"ScopeLink.h\"\n\nusing namespace opencog;\n\nvoid ScopeLink::init(void)\n{\n\textract_variables(_outgoing);\n}\n\nvoid ScopeLink::set_body(const Handle& body)\n{\n\t_body = body;\n\tif (_bodies.empty())\n\t\t_bodies.push_back(body);\n\telse\n\t\t_bodies[0] = body;\n}\n\nScopeLink::ScopeLink(const HandleSeq& oset,\n TruthValuePtr tv, AttentionValuePtr av)\n\t: Link(SCOPE_LINK, oset, tv, av)\n{\n\tinit();\n}\n\nScopeLink::ScopeLink(const Handle& vars, const Handle& body,\n TruthValuePtr tv, AttentionValuePtr av)\n\t: Link(SCOPE_LINK, HandleSeq({vars, body}), tv, av)\n{\n\tinit();\n}\n\nScopeLink::ScopeLink(Type t, const Handle& body,\n TruthValuePtr tv, AttentionValuePtr av)\n\t: Link(t, HandleSeq({body}), tv, av)\n{\n\t\/\/ Derived classes have a different initialization sequence\n\tif (SCOPE_LINK != t) return;\n\tinit();\n}\n\nScopeLink::ScopeLink(Type t, const HandleSeq& oset,\n TruthValuePtr tv, AttentionValuePtr av)\n\t: Link(t, oset, tv, av)\n{\n\t\/\/ Derived classes have a different initialization sequence\n\tif (SCOPE_LINK != t) return;\n\tinit();\n}\n\nScopeLink::ScopeLink(Link &l)\n\t: Link(l)\n{\n\t\/\/ Type must be as expected.\n\tType tscope = l.getType();\n\tif (not classserver().isA(tscope, SCOPE_LINK))\n\t{\n\t\tconst std::string& tname = classserver().getTypeName(tscope);\n\t\tthrow InvalidParamException(TRACE_INFO,\n\t\t\t\"Expecting a ScopeLink, got %s\", tname.c_str());\n\t}\n\n\t\/\/ Derived types have a different initialization sequence.\n\tif (SCOPE_LINK != tscope) return;\n\tinit();\n}\n\n\/* ================================================================= *\/\n\/\/\/\n\/\/\/ Find and unpack variable declarations, if any; otherwise, just\n\/\/\/ find all free variables.\n\/\/\/\nvoid ScopeLink::extract_variables(const HandleSeq& oset)\n{\n\tif (oset.size() == 0)\n\t\tthrow SyntaxException(TRACE_INFO,\n\t\t\t\"Expecting a non-empty outgoing set.\");\n\n\tType decls = oset.at(0)->getType();\n\n\t\/\/ If the first atom is not explicitly a variable declaration, then\n\t\/\/ there are no variable declarations. There are two cases that; can\n\t\/\/ apply here: either the body is a lambda, in which case, we copy\n\t\/\/ the variables from the lambda; else we extract all free variables.\n\tif (VARIABLE_LIST != decls and\n\t VARIABLE_NODE != decls and\n\t TYPED_VARIABLE_LINK != decls and\n\t GLOB_NODE != decls)\n\t{\n\t\tset_body(oset[0]);\n\n\t\tif (classserver().isA(_body->getType(), LAMBDA_LINK))\n\t\t{\n\t\t\tLambdaLinkPtr lam(LambdaLinkCast(_body));\n\t\t\tif (nullptr == lam)\n\t\t\t\tlam = createLambdaLink(*LinkCast(_body));\n\t\t\t_varlist = lam->get_variables();\n\t\t\tset_body(lam->get_body());\n\t\t}\n\t\telse\n\t\t{\n\t\t\t_varlist.find_variables(oset[0]);\n\t\t}\n\t\treturn;\n\t}\n\n\tif (oset.size() < 2)\n\t\tthrow SyntaxException(TRACE_INFO,\n\t\t\t\"Expecting an outgoing set size of at least two; got %s\",\n\t\t\toset[0]->toString().c_str());\n\n\t\/\/ If we are here, then the first outgoing set member should be\n\t\/\/ a variable declaration.\n\t_vardecl = oset[0];\n\tset_body(oset[1]);\n\n\t\/\/ Initialize _varlist with the scoped variables\n\tinit_scoped_variables(_vardecl);\n}\n\n\/* ================================================================= *\/\n\/\/\/\n\/\/\/ Initialize _varlist given a handle of either VariableList or a\n\/\/\/ variable.\n\/\/\/\nvoid ScopeLink::init_scoped_variables(const Handle& hvar)\n{\n\t\/\/ Use the VariableList class as a tool to extract the variables\n\t\/\/ for us.\n\tVariableList vl(hvar);\n\t_varlist = vl.get_variables();\n}\n\n\/* ================================================================= *\/\n\/\/\/\n\/\/\/ Compare other ScopeLink, return true if it is equal to this one,\n\/\/\/ up to an alpha-conversion of variables.\n\/\/\/\nbool ScopeLink::is_equal(const Handle& other) const\n{\n\tif (other == this) return true;\n\tif (other->getType() != _type) return false;\n\n\tScopeLinkPtr scother(ScopeLinkCast(other));\n\n\t\/\/ Variable declarations must match.\n\tif (not _varlist.is_equal(scother->_varlist)) return false;\n\n\t\/\/ Other body(ies), with our variables in place of its variables,\n\t\/\/ should be same as our body(ies).\n\tfor (size_t i = 0; i < _bodies.size(); ++i) {\n\t\tHandle altbod = scother->_varlist.substitute_nocheck(scother->_bodies[i],\n\t\t _varlist.varseq);\n\t\t\/\/ Compare bodies, they should match.\n\t\tif (*((AtomPtr)altbod) != *((AtomPtr) _bodies[i])) return false;\n\t}\n\n\treturn true;\n}\n\nbool ScopeLink::operator==(const Atom& ac) const\n{\n\tAtom& a = (Atom&) ac; \/\/ cast away constness, for smart ptr.\n\treturn is_equal(a.getHandle());\n}\n\nbool ScopeLink::operator!=(const Atom& a) const\n{\n\treturn not operator==(a);\n}\n\n\/* ===================== END OF FILE ===================== *\/\n<|endoftext|>"} {"text":"<commit_before>#include \"ofxGpuLut.h\"\n\nofxGpuLut::ofxGpuLut(){}\nofxGpuLut::~ofxGpuLut(){}\n\nvoid ofxGpuLut::load(ofTexture lutTexture){\n fragmentShader = \"#version 120\\n#extension GL_ARB_texture_rectangle : enable\\n\";\n fragmentShader += STRINGIFY(\n uniform sampler2DRect tex;\n uniform sampler2DRect lut;\n \n float size = 64.0;\n \n void main( void )\n {\n vec3 originalColor = floor(texture2DRect(tex, gl_TexCoord[0].st).rgb * vec3(size - 1.0));\n vec2 blueIndex = vec2(mod(originalColor.b, sqrt(size)), floor(originalColor.b \/ sqrt(size)));\n vec2 index = vec2((size * blueIndex.x + originalColor.r) + 0.5, (size * blueIndex.y + originalColor.g) + 0.5);\n gl_FragColor = vec4(texture2DRect(lut, index).rgb, 1.0);\n }\n );\n lutShader.unload();\n lutShader.setupShaderFromSource(GL_FRAGMENT_SHADER, fragmentShader);\n lutShader.linkProgram();\n lut.setTextureWrap(GL_CLAMP_TO_EDGE, GL_CLAMP_TO_EDGE);\n lut.setTextureMinMagFilter(GL_NEAREST, GL_NEAREST);\n if(!ofGetUsingArbTex()){\n ofEnableArbTex();\n lut = lutTexture;\n ofDisableArbTex();\n }else{\n lut = lutTexture;\n }\n}\n\nvoid ofxGpuLut::load(ofImage lutImage){\n load(lutImage.getTexture());\n}\n\nvoid ofxGpuLut::load(string path){\n lutImage.load(path);\n load(lutImage.getTexture());\n}\n\nvoid ofxGpuLut::begin(){\n lutShader.begin();\n lutShader.setUniformTexture(\"lut\", lut, 1);\n}\n\nvoid ofxGpuLut::end(){\n lutShader.end();\n}<commit_msg>Taking in account the alpha channel of the source texture.<commit_after>#include \"ofxGpuLut.h\"\n\nofxGpuLut::ofxGpuLut(){}\nofxGpuLut::~ofxGpuLut(){}\n\nvoid ofxGpuLut::load(ofTexture lutTexture){\n fragmentShader = \"#version 120\\n#extension GL_ARB_texture_rectangle : enable\\n\";\n fragmentShader += STRINGIFY(\n uniform sampler2DRect tex;\n uniform sampler2DRect lut;\n \n float size = 64.0;\n \n void main( void )\n {\n vec3 rawColor = texture2DRect(tex, gl_TexCoord[0].st).rgb;\n float rawAlpha = texture2DRect(tex, gl_TexCoord[0].st).a;\n \n if (rawAlpha <= 0.0) {\n gl_FragColor = vec4(rawColor, 0.0);\n }\n else {\n vec3 originalColor = floor(texture2DRect(tex, gl_TexCoord[0].st).rgb * vec3(size - 1.0));\n vec2 blueIndex = vec2(mod(originalColor.b, sqrt(size)), floor(originalColor.b \/ sqrt(size)));\n vec2 index = vec2((size * blueIndex.x + originalColor.r) + 0.5, (size * blueIndex.y + originalColor.g) + 0.5);\n gl_FragColor = vec4(texture2DRect(lut, index).rgb, rawAlpha);\n }\n }\n );\n \n \n lutShader.unload();\n lutShader.setupShaderFromSource(GL_FRAGMENT_SHADER, fragmentShader);\n lutShader.linkProgram();\n lut.setTextureWrap(GL_CLAMP_TO_EDGE, GL_CLAMP_TO_EDGE);\n lut.setTextureMinMagFilter(GL_NEAREST, GL_NEAREST);\n if(!ofGetUsingArbTex()){\n ofEnableArbTex();\n lut = lutTexture;\n ofDisableArbTex();\n }else{\n lut = lutTexture;\n }\n}\n\nvoid ofxGpuLut::load(ofImage lutImage){\n load(lutImage.getTexture());\n}\n\nvoid ofxGpuLut::load(string path){\n lutImage.load(path);\n load(lutImage.getTexture());\n}\n\nvoid ofxGpuLut::begin(){\n lutShader.begin();\n lutShader.setUniformTexture(\"lut\", lut, 1);\n}\n\nvoid ofxGpuLut::end(){\n lutShader.end();\n}<|endoftext|>"} {"text":"<commit_before>\/*\n * film.cpp\n *\n * Created on: 2016年12月2日\n * Author: zhuqian\n *\/\n#include \"film.h\"\n#include \"paramset.h\"\n#include \"imageio.h\"\n\n\nFilm::Film(const Point2i& res\/*分辨率*\/, const Bound2f& cropped\/*实际渲染窗口比例*\/,\n\t\tstd::unique_ptr<Filter> filt, const std::string& fileName\/*输出文件名*\/,\n\t\tFloat maxSampleLuminance) :\n\t\tfullResolution(res), fileName(fileName), filter(std::move(filt)), _maxSampleLuminance(\n\t\t\t\tmaxSampleLuminance) {\n\tPoint2i minCropped = Point2i(\n\t\t\tstd::ceil(fullResolution.x * cropped.minPoint.x),\n\t\t\tstd::ceil(fullResolution.y * cropped.minPoint.y));\n\tPoint2i maxCropped = Point2i(\n\t\t\tstd::floor(fullResolution.x * cropped.maxPoint.x),\n\t\t\tstd::floor(fullResolution.y * cropped.maxPoint.y));\n\tcroppedPixelBound = Bound2i(minCropped, maxCropped);\n\t\/\/分配储存像素所需要的空间\n\t_pixels = std::unique_ptr<Pixel[]>(new Pixel[croppedPixelBound.Area()]);\n\t\/\/预计算filterTable 只计算1\/4\n\tint offset = 0;\n\tfor (int y = 0; y < filterTableWidth; ++y) {\n\t\tfor (int x = 0; x < filterTableWidth; ++x, ++offset) {\n\t\t\tPoint2f point;\n\t\t\tpoint.x = (x + 0.5f) * (filter->radius.x \/ filterTableWidth);\n\t\t\tpoint.y = (y + 0.5f) * (filter->radius.y \/ filterTableWidth);\n\t\t\t_filterTable[offset] = filter->Evaluate(point);\n\t\t}\n\t}\n\n}\n\nvoid Film::SetImage(const Spectrum* img) {\n\tint numPixel = croppedPixelBound.Area();\n\tfor (int i = 0; i < numPixel; ++i) {\n\t\tPixel& p = _pixels[i];\n\t\timg[i].ToXYZ(p.xyz);\n\t\tp.filterWeightSum = 1;\n\t\tp.splatXYZ[0] = p.splatXYZ[1] = p.splatXYZ[2] = 0;\n\t}\n}\n\nvoid Film::WriteImage(Float splatScale) {\n\tstd::vector<Float> image;\n\tfor (int j = croppedPixelBound[0].y; j < croppedPixelBound[1].y; ++j) {\n\t\t\tfor (int i = croppedPixelBound[0].x; i < croppedPixelBound[1].x; ++i) {\n\t\t\t\tPixel &p = GetPixel(Point2i(i, j));\n\t\t\t\tFloat rgb[3];\n\t\t\t\tXYZToRGB(p.xyz, rgb);\n\t\t\t\tif(p.filterWeightSum!=0){\n\t\t\t\t\tFloat invWeight = 1.0 \/ p.filterWeightSum;\n\t\t\t\t\trgb[0] *= invWeight;\n\t\t\t\t\trgb[1] *= invWeight;\n\t\t\t\t\trgb[2] *= invWeight;\n\t\t\t\t}\n\t\t\t\t\n\t\t\t\t\n\t\t\t\t\/\/添加splatXYZ内的能量\n\t\t\t\tFloat splatRGB[3];\n\t\t\t\tFloat splatXYZ[3]={p.splatXYZ[0],p.splatXYZ[1] ,p.splatXYZ[2] };\n\t\t\t\tXYZToRGB(splatXYZ, splatRGB);\n\n\t\t\t\trgb[0] += splatRGB[0] * splatScale;\n\t\t\t\trgb[1] += splatRGB[1] * splatScale;\n\t\t\t\trgb[2] += splatRGB[2] * splatScale;\n\n\t\t\t\timage.push_back(rgb[0]);\n\t\t\t\timage.push_back(rgb[1]);\n\t\t\t\timage.push_back(rgb[2]);\n\t\t\t}\n\t\t}\n\tVector2i resolution=croppedPixelBound.Diagonal();\n\tWriteImageToFile(fileName.c_str(), &image[0], resolution.x, resolution.y);\n}\n\nvoid Film::AddSplat(const Point2f& p, Spectrum L) {\n\tif (L.HasNaNs()) {\n\t\tLWarning << \"Ignoring splatted spectrum with NaN values at (\" << p.x << \",\" << p.y << \")\";\n\t\treturn;\n\t}\n\telse if (L.y() < 0) {\n\t\tLWarning<<\"Ignoring splatted spectrum with negative luminance\"<<L.y()<<\"at (\" << p.x << \",\" << p.y << \")\";\n\t\treturn;\n\t}\n\telse if (std::isinf(L.y())) {\n\t\tLWarning << \"Ignoring splatted spectrum with infinite luminance at (\" << p.x << \",\" << p.y << \")\";\n\t\treturn;\n\t}\n\n\tif(!InsideExclusive((Point2i)p, croppedPixelBound)) {\n\t\treturn;\n\t}\n\n\tif (L.y() > _maxSampleLuminance){\n\t\tL = (_maxSampleLuminance \/ L.y())*L;\n\t}\n\n\tauto& pixel=GetPixel((Point2i)p);\n\tFloat xyz[3];\n\tL.ToXYZ(xyz);\n\tfor (int i = 0; i < 3; ++i) {\n\t\tpixel.splatXYZ[i].Add(xyz[i]);\n\t}\n}\n\nvoid FilmTile::AddSample(const Point2f& pFilm, Spectrum L, Float weight) {\n\tAssert(weight>0.0f);\n\t\/\/Assert(InsideExclusive(pFilm,_pixelBound));\n\t\/\/贡献值大于最大值，需要scale\n\tif (L.y() > _maxSampleLuminance) {\n\t\tL *= (_maxSampleLuminance \/ L.y());\n\t}\n\n\t\/\/计算过滤范围\n\tPoint2f pFilmDiscrete = pFilm - Vector2f(0.5f, 0.5f);\n\tPoint2i pMin = Point2i(Ceil(pFilmDiscrete - _filterRadius));\n\tPoint2i pMax = Point2i(Floor(pFilmDiscrete + _filterRadius))+Point2i(1,1);\n\tpMin = Max(_pixelBound.minPoint, pMin);\n\tpMax = Min(_pixelBound.maxPoint, pMax);\n\t\/\/预计算row和col上的偏移\n\tint *ifx = ALLOCA(int, pMax.x - pMin.x);\n\tfor (int x = pMin.x; x < pMax.x; ++x) {\n\t\tFloat offsetX = std::abs(x - pFilmDiscrete.x) * _invFilterRadius.x\n\t\t\t\t* _filterTableWidth;\n\t\tifx[x - pMin.x] = std::min((int) std::floor(offsetX),\n\t\t\t\t_filterTableWidth - 1);\n\t}\n\tint *ify = ALLOCA(int, pMax.y - pMin.y);\n\tfor (int y = pMin.y; y < pMax.y; ++y) {\n\t\tFloat offsetY = std::abs(y - pFilmDiscrete.y) * _invFilterRadius.y\n\t\t\t\t* _filterTableWidth;\n\t\tify[y - pMin.y] = std::min((int) std::floor(offsetY),\n\t\t\t\t_filterTableWidth - 1);\n\t}\n\n\tfor (int y = pMin.y; y < pMax.y; ++y) {\n\t\tfor (int x = pMin.x; x < pMax.x; ++x) {\n\t\t\tint filterTableIndex = ify[y - pMin.y] * _filterTableWidth\n\t\t\t\t\t+ ifx[x - pMin.x];\t\/\/filter表索引\n\t\t\tFloat fiterWeight = _filterTable[filterTableIndex];\t\/\/过滤器权重\n\t\t\tFilmTilePixel& pixel = GetPixel(Point2i(x, y));\n\t\t\tpixel.contribSum += L * weight * fiterWeight;\n\t\t\tpixel.filterWeightSum += fiterWeight;\n\t\t}\n\t}\n}\n\n\n\nstd::unique_ptr<FilmTile> Film::GetFilmTile(const Bound2i &sampleBounds) {\n\tVector2f half(0.5f, 0.5f);\n\tBound2f floatBounds = (Bound2f) sampleBounds;\n\tPoint2i p0 = (Point2i) Ceil(floatBounds.minPoint - half - filter->radius);\n\tPoint2i p1 = (Point2i) Floor(floatBounds.maxPoint - half + filter->radius)\n\t\t\t+ Point2i(1, 1);\n\tBound2i pixelBound=Intersect(Bound2i(p0,p1),croppedPixelBound);\n\treturn std::unique_ptr<FilmTile>(new FilmTile(pixelBound,filter->radius,_filterTable,filterTableWidth,_maxSampleLuminance));\n}\n\nvoid Film::MergeFilmTile(std::unique_ptr<FilmTile> tile){\n\t\/\/获取互斥锁\n\tstd::lock_guard<std::mutex> lock(_mutex);\n\tfor(Point2i pixelPos:tile->GetPixelBound()){\n\t\tconst FilmTilePixel& tilePixel=tile->GetPixel(pixelPos);\n\t\tPixel& pixel=GetPixel(pixelPos);\n\t\tFloat xyz[3];\n\t\ttilePixel.contribSum.ToXYZ(xyz);\n\t\tfor(int i=0;i<3;++i){\n\t\t\tpixel.xyz[i]+=xyz[i];\n\t\t}\n\t\tpixel.filterWeightSum+=tilePixel.filterWeightSum;\n\t}\n}\n\n\/\/{filename:string,xresolution:int,yresolution:int,cropwindow:Float[4],maxsampleluminance:Float}\nFilm *CreateFilm(const ParamSet ¶ms, std::unique_ptr<Filter> filter) {\n std::string filename = params.FindOneString(\"filename\", \"\");\n if (RaidenOptions.imageFile != \"\") {\n if (filename != \"\") {\n \tLWarning<<\"ingore commandline filename:\"<<RaidenOptions.imageFile.c_str()<<\",use descriptionfile filename:\"<<filename.c_str();\n } else{\n filename = RaidenOptions.imageFile;\n }\n }\n if (filename == \"\") {filename = \"raiden.png\";}\n\n int xres = params.FindOneInt(\"xresolution\", 1280);\n int yres = params.FindOneInt(\"yresolution\", 720);\n Bound2f crop(Point2f(0, 0), Point2f(1, 1));\n int cwi;\n const Float *cr = params.FindFloat(\"cropwindow\", &cwi);\n if (cr && cwi == 4) {\n crop.minPoint.x = Clamp(std::min(cr[0], cr[1]), 0.0f, 1.0f);\n crop.maxPoint.x = Clamp(std::max(cr[0], cr[1]), 0.0f, 1.0f);\n crop.minPoint.y = Clamp(std::min(cr[2], cr[3]), 0.0f, 1.0f);\n crop.maxPoint.y = Clamp(std::max(cr[2], cr[3]), 0.0f, 1.0f);\n } else if (cr){\n \tLError<<\"cropwindow need four values, and \"<<cwi<<\" for now.\";\n }\n Float maxSampleLuminance = params.FindOneFloat(\"maxsampleluminance\",\n Infinity);\n\tDebug(\"[CreateFilm][ res:\" << Point2i(xres, yres) << \",croppedPixelBound:\" << crop << \".]\");\n\n return new Film(Point2i(xres, yres), crop, std::move(filter),\n filename,maxSampleLuminance);\n}\n<commit_msg>为film添加是否支持相应格式的代码<commit_after>\/*\n * film.cpp\n *\n * Created on: 2016年12月2日\n * Author: zhuqian\n *\/\n#include \"film.h\"\n#include \"paramset.h\"\n#include \"imageio.h\"\n\nFilm::Film(const Point2i &res \/*分辨率*\/, const Bound2f &cropped \/*实际渲染窗口比例*\/,\n\t\t std::unique_ptr<Filter> filt, const std::string &fileName \/*输出文件名*\/,\n\t\t Float maxSampleLuminance) : fullResolution(res), fileName(fileName), filter(std::move(filt)), _maxSampleLuminance(maxSampleLuminance)\n{\n\tPoint2i minCropped = Point2i(\n\t\tstd::ceil(fullResolution.x * cropped.minPoint.x),\n\t\tstd::ceil(fullResolution.y * cropped.minPoint.y));\n\tPoint2i maxCropped = Point2i(\n\t\tstd::floor(fullResolution.x * cropped.maxPoint.x),\n\t\tstd::floor(fullResolution.y * cropped.maxPoint.y));\n\tcroppedPixelBound = Bound2i(minCropped, maxCropped);\n\t\/\/分配储存像素所需要的空间\n\t_pixels = std::unique_ptr<Pixel[]>(new Pixel[croppedPixelBound.Area()]);\n\t\/\/预计算filterTable 只计算1\/4\n\tint offset = 0;\n\tfor (int y = 0; y < filterTableWidth; ++y)\n\t{\n\t\tfor (int x = 0; x < filterTableWidth; ++x, ++offset)\n\t\t{\n\t\t\tPoint2f point;\n\t\t\tpoint.x = (x + 0.5f) * (filter->radius.x \/ filterTableWidth);\n\t\t\tpoint.y = (y + 0.5f) * (filter->radius.y \/ filterTableWidth);\n\t\t\t_filterTable[offset] = filter->Evaluate(point);\n\t\t}\n\t}\n}\n\nvoid Film::SetImage(const Spectrum *img)\n{\n\tint numPixel = croppedPixelBound.Area();\n\tfor (int i = 0; i < numPixel; ++i)\n\t{\n\t\tPixel &p = _pixels[i];\n\t\timg[i].ToXYZ(p.xyz);\n\t\tp.filterWeightSum = 1;\n\t\tp.splatXYZ[0] = p.splatXYZ[1] = p.splatXYZ[2] = 0;\n\t}\n}\n\nvoid Film::WriteImage(Float splatScale)\n{\n\tstd::vector<Float> image;\n\tfor (int j = croppedPixelBound[0].y; j < croppedPixelBound[1].y; ++j)\n\t{\n\t\tfor (int i = croppedPixelBound[0].x; i < croppedPixelBound[1].x; ++i)\n\t\t{\n\t\t\tPixel &p = GetPixel(Point2i(i, j));\n\t\t\tFloat rgb[3];\n\t\t\tXYZToRGB(p.xyz, rgb);\n\t\t\tif (p.filterWeightSum != 0)\n\t\t\t{\n\t\t\t\tFloat invWeight = 1.0 \/ p.filterWeightSum;\n\t\t\t\trgb[0] *= invWeight;\n\t\t\t\trgb[1] *= invWeight;\n\t\t\t\trgb[2] *= invWeight;\n\t\t\t}\n\n\t\t\t\/\/添加splatXYZ内的能量\n\t\t\tFloat splatRGB[3];\n\t\t\tFloat splatXYZ[3] = {p.splatXYZ[0], p.splatXYZ[1], p.splatXYZ[2]};\n\t\t\tXYZToRGB(splatXYZ, splatRGB);\n\n\t\t\trgb[0] += splatRGB[0] * splatScale;\n\t\t\trgb[1] += splatRGB[1] * splatScale;\n\t\t\trgb[2] += splatRGB[2] * splatScale;\n\n\t\t\timage.push_back(rgb[0]);\n\t\t\timage.push_back(rgb[1]);\n\t\t\timage.push_back(rgb[2]);\n\t\t}\n\t}\n\tVector2i resolution = croppedPixelBound.Diagonal();\n\tWriteImageToFile(fileName.c_str(), &image[0], resolution.x, resolution.y);\n}\n\nvoid Film::AddSplat(const Point2f &p, Spectrum L)\n{\n\tif (L.HasNaNs())\n\t{\n\t\tLWarning << \"Ignoring splatted spectrum with NaN values at (\" << p.x << \",\" << p.y << \")\";\n\t\treturn;\n\t}\n\telse if (L.y() < 0)\n\t{\n\t\tLWarning << \"Ignoring splatted spectrum with negative luminance\" << L.y() << \"at (\" << p.x << \",\" << p.y << \")\";\n\t\treturn;\n\t}\n\telse if (std::isinf(L.y()))\n\t{\n\t\tLWarning << \"Ignoring splatted spectrum with infinite luminance at (\" << p.x << \",\" << p.y << \")\";\n\t\treturn;\n\t}\n\n\tif (!InsideExclusive((Point2i)p, croppedPixelBound))\n\t{\n\t\treturn;\n\t}\n\n\tif (L.y() > _maxSampleLuminance)\n\t{\n\t\tL = (_maxSampleLuminance \/ L.y()) * L;\n\t}\n\n\tauto &pixel = GetPixel((Point2i)p);\n\tFloat xyz[3];\n\tL.ToXYZ(xyz);\n\tfor (int i = 0; i < 3; ++i)\n\t{\n\t\tpixel.splatXYZ[i].Add(xyz[i]);\n\t}\n}\n\nvoid FilmTile::AddSample(const Point2f &pFilm, Spectrum L, Float weight)\n{\n\tAssert(weight > 0.0f);\n\t\/\/Assert(InsideExclusive(pFilm,_pixelBound));\n\t\/\/贡献值大于最大值，需要scale\n\tif (L.y() > _maxSampleLuminance)\n\t{\n\t\tL *= (_maxSampleLuminance \/ L.y());\n\t}\n\n\t\/\/计算过滤范围\n\tPoint2f pFilmDiscrete = pFilm - Vector2f(0.5f, 0.5f);\n\tPoint2i pMin = Point2i(Ceil(pFilmDiscrete - _filterRadius));\n\tPoint2i pMax = Point2i(Floor(pFilmDiscrete + _filterRadius)) + Point2i(1, 1);\n\tpMin = Max(_pixelBound.minPoint, pMin);\n\tpMax = Min(_pixelBound.maxPoint, pMax);\n\t\/\/预计算row和col上的偏移\n\tint *ifx = ALLOCA(int, pMax.x - pMin.x);\n\tfor (int x = pMin.x; x < pMax.x; ++x)\n\t{\n\t\tFloat offsetX = std::abs(x - pFilmDiscrete.x) * _invFilterRadius.x * _filterTableWidth;\n\t\tifx[x - pMin.x] = std::min((int)std::floor(offsetX),\n\t\t\t\t\t\t\t\t _filterTableWidth - 1);\n\t}\n\tint *ify = ALLOCA(int, pMax.y - pMin.y);\n\tfor (int y = pMin.y; y < pMax.y; ++y)\n\t{\n\t\tFloat offsetY = std::abs(y - pFilmDiscrete.y) * _invFilterRadius.y * _filterTableWidth;\n\t\tify[y - pMin.y] = std::min((int)std::floor(offsetY),\n\t\t\t\t\t\t\t\t _filterTableWidth - 1);\n\t}\n\n\tfor (int y = pMin.y; y < pMax.y; ++y)\n\t{\n\t\tfor (int x = pMin.x; x < pMax.x; ++x)\n\t\t{\n\t\t\tint filterTableIndex = ify[y - pMin.y] * _filterTableWidth + ifx[x - pMin.x]; \/\/filter表索引\n\t\t\tFloat fiterWeight = _filterTable[filterTableIndex];\t\t\t\t\t\t\t \/\/过滤器权重\n\t\t\tFilmTilePixel &pixel = GetPixel(Point2i(x, y));\n\t\t\tpixel.contribSum += L * weight * fiterWeight;\n\t\t\tpixel.filterWeightSum += fiterWeight;\n\t\t}\n\t}\n}\n\nstd::unique_ptr<FilmTile> Film::GetFilmTile(const Bound2i &sampleBounds)\n{\n\tVector2f half(0.5f, 0.5f);\n\tBound2f floatBounds = (Bound2f)sampleBounds;\n\tPoint2i p0 = (Point2i)Ceil(floatBounds.minPoint - half - filter->radius);\n\tPoint2i p1 = (Point2i)Floor(floatBounds.maxPoint - half + filter->radius) + Point2i(1, 1);\n\tBound2i pixelBound = Intersect(Bound2i(p0, p1), croppedPixelBound);\n\treturn std::unique_ptr<FilmTile>(new FilmTile(pixelBound, filter->radius, _filterTable, filterTableWidth, _maxSampleLuminance));\n}\n\nvoid Film::MergeFilmTile(std::unique_ptr<FilmTile> tile)\n{\n\t\/\/获取互斥锁\n\tstd::lock_guard<std::mutex> lock(_mutex);\n\tfor (Point2i pixelPos : tile->GetPixelBound())\n\t{\n\t\tconst FilmTilePixel &tilePixel = tile->GetPixel(pixelPos);\n\t\tPixel &pixel = GetPixel(pixelPos);\n\t\tFloat xyz[3];\n\t\ttilePixel.contribSum.ToXYZ(xyz);\n\t\tfor (int i = 0; i < 3; ++i)\n\t\t{\n\t\t\tpixel.xyz[i] += xyz[i];\n\t\t}\n\t\tpixel.filterWeightSum += tilePixel.filterWeightSum;\n\t}\n}\n\n\/\/{filename:string,xresolution:int,yresolution:int,cropwindow:Float[4],maxsampleluminance:Float}\nFilm *CreateFilm(const ParamSet ¶ms, std::unique_ptr<Filter> filter)\n{\n\tstd::string filename = params.FindOneString(\"filename\", \"\");\n\tif (RaidenOptions.imageFile != \"\")\n\t{\n\t\tif (filename != \"\")\n\t\t{\n\t\t\tLWarning << \"ingore commandline filename:\" << RaidenOptions.imageFile.c_str() << \",use descriptionfile filename:\" << filename.c_str();\n\t\t}\n\t\telse\n\t\t{\n\t\t\tfilename = RaidenOptions.imageFile;\n\t\t}\n\t}\n\n\tif (filename == \"\")\n\t{\n\t\tfilename = \"default.png\";\n\t}\n\telse\n\t{\n\t\tbool isSupported=IsImageFormatSupported(filename.c_str());\n\t\tif(!isSupported){\n\t\t\tLError<<\"file format '\"<<filename<<\"' is not supported!\";\n\t\t\texit(-1);\n\t\t}\n\t}\n\n\tint xres = params.FindOneInt(\"xresolution\", 1280);\n\tint yres = params.FindOneInt(\"yresolution\", 720);\n\tBound2f crop(Point2f(0, 0), Point2f(1, 1));\n\tint cwi;\n\tconst Float *cr = params.FindFloat(\"cropwindow\", &cwi);\n\tif (cr && cwi == 4)\n\t{\n\t\tcrop.minPoint.x = Clamp(std::min(cr[0], cr[1]), 0.0f, 1.0f);\n\t\tcrop.maxPoint.x = Clamp(std::max(cr[0], cr[1]), 0.0f, 1.0f);\n\t\tcrop.minPoint.y = Clamp(std::min(cr[2], cr[3]), 0.0f, 1.0f);\n\t\tcrop.maxPoint.y = Clamp(std::max(cr[2], cr[3]), 0.0f, 1.0f);\n\t}\n\telse if (cr)\n\t{\n\t\tLError << \"cropwindow need four values, and \" << cwi << \" for now.\";\n\t}\n\tFloat maxSampleLuminance = params.FindOneFloat(\"maxsampleluminance\",\n\t\t\t\t\t\t\t\t\t\t\t\t Infinity);\n\tDebug(\"[CreateFilm][ res:\" << Point2i(xres, yres) << \",croppedPixelBound:\" << crop << \".]\");\n\n\treturn new Film(Point2i(xres, yres), crop, std::move(filter),\n\t\t\t\t\tfilename, maxSampleLuminance);\n}\n<|endoftext|>"} {"text":"<commit_before>#include \"ofxJamoma.h\"\n#include \"gorgone.h\"\n\nvoid ofxJamoma::setup(void* parent, string name, string masterIp)\n{\n mParent = TTPtr(parent);\n mAppLocalName = name;\n mAppRemoteName = \"master\";\n mAppRemoteName2 = \"laser-1\";\n mAppRemoteIp = masterIp;\n setupJamomaApp();\n registerJamomaParam();\n}\n\nvoid ofxJamoma::exit()\n{\n}\n\nvoid ofxJamoma::setupJamomaApp(){\n TTValue args, v, out, none;\n TTAddress address;\n TTErr err;\n\n TTLogMessage(\"\\n*** Initialisation of Modular environnement ***\\n\");\n \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n \/\/ Init the Modular library (passing the folder path where all the dylibs are)\n TTModularInit(\"\/usr\/local\/jamoma\/lib\/jamoma\/\");\n\n \/\/ Create an application manager\n mApplicationManager = TTObject(\"ApplicationManager\");\n\n\n TTLogMessage(\"\\n*** Creation of %s and %s applications ***\\n\", mAppLocalName.c_str(), mAppRemoteName.c_str());\n \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n \/\/ Create a local application called \"gorgone-1\" and get it back\n mApplicationLocal = mApplicationManager.send(\"ApplicationInstantiateLocal\", mAppLocalName.c_str());\n mApplicationRemote = mApplicationManager.send(\"ApplicationInstantiateDistant\", mAppRemoteName.c_str());\n mApplicationRemote2 = mApplicationManager.send(\"ApplicationInstantiateDistant\", mAppRemoteName2.c_str());\n\n\n \/\/ Get registered application names\n mApplicationManager.get(\"applicationNames\", out);\n for (TTElementIter it = out.begin() ; it != out.end() ; it++) {\n TTSymbol name = TTElement(*it);\n TTLogMessage(\"%s application is well registered into the application manager \\n\", name.c_str());\n }\n\n\n TTLogMessage(\"\\n*** Enable Minuit communication ***\\n\");\n \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n \/\/ Create a Minuit protocol unit\n err = mApplicationManager.send(\"ProtocolInstantiate\", \"Minuit\", out);\n\n if (err) {\n TTLogError(\"Error : can't create Minuit protocol unit \\n\");\n return;\n }\n else\n mProtocolMinuit = out[0];\n\n \/\/ Get Minuit Protocol attribute names and types\n mProtocolMinuit.get(\"parameterNames\", out);\n for (TTElementIter it = out.begin() ; it != out.end() ; it++) {\n TTSymbol name = TTElement(*it);\n TTSymbol type = mProtocolMinuit.attributeType(name);\n TTLogMessage(\"Minuit %s parameter is a %s \\n\", name.c_str(), type.c_str());\n }\n\n \/\/ Register mymyRemoteAppApp and myRemoteApp to the Minuit protocol\n mProtocolMinuit.send(\"ApplicationRegister\", mAppLocalName.c_str(), out);\n mProtocolMinuit.send(\"ApplicationRegister\", mAppRemoteName.c_str(), out);\n mProtocolMinuit.send(\"ApplicationRegister\", mAppRemoteName2.c_str(), out);\n\n \/\/ Select gorgone-1 to set its protocol parameters\n mProtocolMinuit.send(\"ApplicationSelect\", mAppLocalName.c_str(), out);\n mProtocolMinuit.set(\"port\", 9998);\n mProtocolMinuit.set(\"ip\", \"127.0.0.1\");\n\n \/\/ Select gorgone-1 to set its protocol parameters\n mProtocolMinuit.send(\"ApplicationSelect\", mAppRemoteName2.c_str(), out);\n mProtocolMinuit.set(\"port\", 9999);\n mProtocolMinuit.set(\"ip\", \"127.0.0.1\");\n\n \/\/ Select myRemoteApp to set its protocol parameters\n mProtocolMinuit.send(\"ApplicationSelect\", mAppRemoteName.c_str(), out);\n mProtocolMinuit.set(\"port\", 13579);\n mProtocolMinuit.set(\"ip\", mAppRemoteIp.c_str());\n\n \/\/ Get Minuit parameters for each registered application\n mProtocolMinuit.get(\"applicationNames\", out);\n for (TTElementIter it = out.begin() ; it != out.end() ; it++) {\n TTSymbol name = TTElement(*it);\n\n mProtocolMinuit.send(\"ApplicationSelect\", name, out);\n TTLogMessage(\"Minuit setup for %s application : \\n\", name.c_str());\n\n mProtocolMinuit.get(\"ip\", v);\n TTSymbol ip = v[0];\n TTLogMessage(\"- ip = %s \\n\", ip.c_str());\n\n mProtocolMinuit.get(\"port\", v);\n TTUInt16 port = v[0];\n TTLogMessage(\"- port = %d \\n\", port);\n }\n\n \/\/ Enable Minuit communication\n mProtocolMinuit.send(\"Run\");\n\n TTLogMessage(\"\\n*** Current Protocol Setup ***\\n\");\n \/\/ Get protocol names\n mApplicationManager.get(\"protocolNames\", out);\n for (TTElementIter it = out.begin() ; it != out.end() ; it++) {\n TTSymbol name = TTElement(*it);\n TTLogMessage(\"%s protocol is well registered into the application manager \\n\", name.c_str());\n }\n}\n\nvoid ofxJamoma::registerJamomaParam(){\n TTValue args, v, out, none;\n TTAddress address;\n TTErr err;\n TTLogMessage(\"\\n*** Creation and registration of a decimal parameter ***\\n\");\n \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n \/\/ Create a decimal parameter data and set its callback function and baton and some attributes\n mTrackEnableParameter = TTObject(\"Data\", \"parameter\");\n\n \/\/ Setup the callback mechanism to get the value back\n args = TTValue(mParent, mTrackEnableParameter);\n mTrackEnableParameter.set(\"baton\", args);\n mTrackEnableParameter.set(\"function\", TTPtr(&DemoAppDataReturnValueCallback));\n\n \/\/ Setup the data attributes depending of its use inside the application\n mTrackEnableParameter.set(\"type\", \"boolean\");\n mTrackEnableParameter.set(\"description\", \"start\/stop tracking\");\n\n \/\/ Register the parameter data into gorgone-1 at an address\n args = TTValue(\"\/tracking\/enable\", mTrackEnableParameter);\n err = mApplicationLocal.send(\"ObjectRegister\", args, out);\n\n if (err)\n TTLogError(\"Error : can't register data at \/tracking\/enable address \\n\");\n\n else {\n address = out[0];\n TTLogMessage(\"\\n \/tracking\/enable : effective registration address is %s \\n\", address.c_str());\n }\n\n \/\/ Create a decimal parameter data and set its callback function and baton and some attributes\n mDrawingEnableParameter = TTObject(\"Data\", \"parameter\");\n\n \/\/ Setup the callback mechanism to get the value back\n args = TTValue(mParent, mDrawingEnableParameter);\n mDrawingEnableParameter.set(\"baton\", args);\n mDrawingEnableParameter.set(\"function\", TTPtr(&DemoAppDataReturnValueCallback));\n\n \/\/ Setup the data attributes depending of its use inside the application\n mDrawingEnableParameter.set(\"type\", \"boolean\");\n mDrawingEnableParameter.set(\"description\", \"start\/stop drawing\");\n\n \/\/ Register the parameter data into gorgone-1 at an address\n args = TTValue(\"\/drawing\/enable\", mDrawingEnableParameter);\n err = mApplicationLocal.send(\"ObjectRegister\", args, out);\n\n if (err)\n TTLogError(\"Error : can't register data at \/drawing\/enable address \\n\");\n\n else {\n address = out[0];\n TTLogMessage(\"\\n \/drawing\/enable : effective registration address is %s \\n\", address.c_str());\n }\n\n \/\/ Create a new boolean parameter\n mComputeIrisCodeParameter = TTObject(\"Data\", \"parameter\");\n\n \/\/ Setup the callback mechanism to get the value back\n args = TTValue(mParent, mComputeIrisCodeParameter);\n mComputeIrisCodeParameter.set(\"baton\", args);\n mComputeIrisCodeParameter.set(\"function\", TTPtr(&DemoAppDataReturnValueCallback));\n\n \/\/ Setup the data attributes depending of its use inside the application\n mComputeIrisCodeParameter.set(\"type\", \"boolean\");\n mComputeIrisCodeParameter.set(\"description\", \"start\/stop drawing\");\n\n \/\/ Register the parameter data into gorgone-1 at an address\n args = TTValue(\"\/tracking\/computecode\", mComputeIrisCodeParameter);\n err = mApplicationLocal.send(\"ObjectRegister\", args, out);\n\n if (err)\n TTLogError(\"Error : can't register data at \/tracking\/computecode address \\n\");\n\n else {\n address = out[0];\n TTLogMessage(\"\\n \/tracking\/computecode : effective registration address is %s \\n\", address.c_str());\n }\n\n \/\/ Create a new array parameter\n mDrawingCoeffParameter = TTObject(\"Data\", \"parameter\");\n\n \/\/ Setup the callback mechanism to get the value back\n args = TTValue(mParent, mDrawingCoeffParameter);\n mDrawingCoeffParameter.set(\"baton\", args);\n mDrawingCoeffParameter.set(\"function\", TTPtr(&DemoAppDataReturnValueCallback));\n\n \/\/ Setup the data attributes depending of its use inside the application\n mDrawingCoeffParameter.set(\"type\", \"array\");\n mDrawingCoeffParameter.set(\"description\", \"shape coefficient\");\n\n \/\/ Register the parameter data into gorgone-1 at an address\n args = TTValue(\"\/drawing\/coeff\", mDrawingCoeffParameter);\n err = mApplicationLocal.send(\"ObjectRegister\", args, out);\n\n if (err)\n TTLogError(\"Error : can't register data at \/drawing\/coeff address \\n\");\n\n else {\n address = out[0];\n TTLogMessage(\"\\n \/drawing\/coeff : effective registration address is %s \\n\", address.c_str());\n }\n\n\n \/\/ Create a new array return for iris code\n mTrackingIrisCodeReturn = TTObject(\"Data\", \"return\");\n\n \/\/ Setup the callback mechanism to get the value back\n args = TTValue(mParent, mTrackingIrisCodeReturn);\n mTrackingIrisCodeReturn.set(\"baton\", args);\n mTrackingIrisCodeReturn.set(\"function\", TTPtr(&DemoAppDataReturnValueCallback));\n\n \/\/ Setup the data attributes depending of its use inside the application\n mTrackingIrisCodeReturn.set(\"type\", \"array\");\n mTrackingIrisCodeReturn.set(\"description\", \"iris code\");\n\n \/\/ Register the parameter data into gorgone-1 at an address\n args = TTValue(\"\/tracking\/iriscode\", mTrackingIrisCodeReturn);\n err = mApplicationLocal.send(\"ObjectRegister\", args, out);\n\n if (err)\n TTLogError(\"Error : can't register data at \/tracking\/iriscode address \\n\");\n\n else {\n address = out[0];\n TTLogMessage(\"\\n \/tracking\/iriscode : effective registration address is %s \\n\", address.c_str());\n }\n\n \/\/ Create a new array return for drawing shape\n mDrawingShapeXReturn = TTObject(\"Data\", \"return\");\n\n \/\/ Setup the callback mechanism to get the value back\n args = TTValue(mParent, mDrawingShapeXReturn);\n mDrawingShapeXReturn.set(\"baton\", args);\n mDrawingShapeXReturn.set(\"function\", TTPtr(&DemoAppDataReturnValueCallback));\n\n \/\/ Setup the data attributes depending of its use inside the application\n mDrawingShapeXReturn.set(\"type\", \"array\");\n mDrawingShapeXReturn.set(\"description\", \"drawing shape X\");\n\n \/\/ Register the parameter data into gorgone-1 at an address\n args = TTValue(\"\/drawing\/shape\/x\", mDrawingShapeXReturn);\n err = mApplicationLocal.send(\"ObjectRegister\", args, out);\n\n if (err)\n TTLogError(\"Error : can't register data at \/drawing\/shape\/x address \\n\");\n\n else {\n address = out[0];\n TTLogMessage(\"\\n \/drawing\/shape\/x : effective registration address is %s \\n\", address.c_str());\n }\n\n \/\/ Create a new array return for drawing shape\n mDrawingShapeYReturn = TTObject(\"Data\", \"return\");\n\n \/\/ Setup the callback mechanism to get the value back\n args = TTValue(mParent, mDrawingShapeYReturn);\n mDrawingShapeYReturn.set(\"baton\", args);\n mDrawingShapeYReturn.set(\"function\", TTPtr(&DemoAppDataReturnValueCallback));\n\n \/\/ Setup the data attributes depending of its use inside the application\n mDrawingShapeYReturn.set(\"type\", \"array\");\n mDrawingShapeYReturn.set(\"description\", \"Drawing shape Y\");\n\n \/\/ Register the parameter data into gorgone-1 at an address\n args = TTValue(\"\/drawing\/shape\/y\", mDrawingShapeYReturn);\n err = mApplicationLocal.send(\"ObjectRegister\", args, out);\n\n if (err)\n TTLogError(\"Error : can't register data at \/drawing\/shape\/y address \\n\");\n\n else {\n address = out[0];\n TTLogMessage(\"\\n \/drawing\/shape\/y : effective registration address is %s \\n\", address.c_str());\n }\n\n \/\/ Create a new brightness parameter\n mTrackingLedBrightness = TTObject(\"Data\", \"parameter\");\n\n \/\/ Setup the callback mechanism to get the value back\n args = TTValue(mParent, mTrackingLedBrightness);\n mTrackingLedBrightness.set(\"baton\", args);\n mTrackingLedBrightness.set(\"function\", TTPtr(&DemoAppDataReturnValueCallback));\n\n \/\/ Setup the data attributes depending of its use inside the application\n mTrackingLedBrightness.set(\"type\", \"integer\");\n mTrackingLedBrightness.set(\"description\", \"LED brightness\");\n mTrackingLedBrightness.set(\"rangeBounds\", TTValue(0, 1023));\n mTrackingLedBrightness.set(\"rangeClipmode\", \"both\");\n\n \/\/ Register the parameter data into gorgone-1 at an address\n args = TTValue(\"\/tracking\/ledbrightness\", mTrackingLedBrightness);\n err = mApplicationLocal.send(\"ObjectRegister\", args, out);\n\n if (err)\n TTLogError(\"Error : can't register data at \/tracking\/ledbrightness address \\n\");\n\n else {\n address = out[0];\n TTLogMessage(\"\\n \/tracking\/ledbrightness : effective registration address is %s \\n\", address.c_str());\n }\n\n \/\/ Create a new brightness parameter\n mTrackingLaserBrightness = TTObject(\"Data\", \"parameter\");\n\n \/\/ Setup the callback mechanism to get the value back\n args = TTValue(mParent, mTrackingLaserBrightness);\n mTrackingLaserBrightness.set(\"baton\", args);\n mTrackingLaserBrightness.set(\"function\", TTPtr(&DemoAppDataReturnValueCallback));\n\n \/\/ Setup the data attributes depending of its use inside the application\n mTrackingLaserBrightness.set(\"type\", \"decimal\");\n mTrackingLaserBrightness.set(\"description\", \"laser brightness\");\n mTrackingLaserBrightness.set(\"rangeBounds\", TTValue(0., 100.));\n mTrackingLaserBrightness.set(\"rangeClipmode\", \"both\");\n\n \/\/ Register the parameter data into gorgone-1 at an address\n args = TTValue(\"\/tracking\/laserbrightness\", mTrackingLaserBrightness);\n err = mApplicationLocal.send(\"ObjectRegister\", args, out);\n\n if (err)\n TTLogError(\"Error : can't register data at \/tracking\/laserbrightness address \\n\");\n\n else {\n address = out[0];\n TTLogMessage(\"\\n \/tracking\/laserbrightness : effective registration address is %s \\n\", address.c_str());\n }\n}\n\n\nTTErr\nDemoAppDataReturnValueCallback(const TTValue& baton, const TTValue& value)\n{\n gorgone* gorgoneApp = (gorgone*)TTPtr(baton[0]);\n TTObject anObject = baton[1];\n\n \/\/ Reteive which data has been updated\n if (anObject.instance() == gorgoneApp->jamoma.mTrackEnableParameter.instance()) {\n\n gorgoneApp->bTracking = value[0];\n return kTTErrNone;\n }\n\n if (anObject.instance() == gorgoneApp->jamoma.mDrawingEnableParameter.instance()) {\n gorgoneApp->bDisplaying = value[0];\n return kTTErrNone;\n }\n\n if (anObject.instance() == gorgoneApp->jamoma.mComputeIrisCodeParameter.instance()) {\n gorgoneApp->bComputeCode = value[0];\n return kTTErrNone;\n }\n\n if (anObject.instance() == gorgoneApp->jamoma.mDrawingCoeffParameter.instance()) {\n gorgoneApp->svgInterp.coeff.clear();\n for (int i = 0; i < value.size(); i++)\n gorgoneApp->svgInterp.coeff.push_back(value[i]);\n gorgoneApp->svgInterp.multiInterpolation();\n return kTTErrNone;\n }\n\n#ifdef TARGET_RASPBERRY_PI\n if (anObject.instance() == gorgoneApp->jamoma.mTrackingLedBrightness.instance()) {\n gorgoneApp->vidGrabber.led.setBrightness(value[0]);\n return kTTErrNone;\n }\n\n if (anObject.instance() == gorgoneApp->jamoma.mTrackingLaserBrightness.instance()) {\n gorgoneApp->setPwm(value[0]);\n return kTTErrNone;\n }\n\n#endif\n\n return kTTErrGeneric;\n}\n<commit_msg>fix laser brightness address<commit_after>#include \"ofxJamoma.h\"\n#include \"gorgone.h\"\n\nvoid ofxJamoma::setup(void* parent, string name, string masterIp)\n{\n mParent = TTPtr(parent);\n mAppLocalName = name;\n mAppRemoteName = \"master\";\n mAppRemoteName2 = \"laser-1\";\n mAppRemoteIp = masterIp;\n setupJamomaApp();\n registerJamomaParam();\n}\n\nvoid ofxJamoma::exit()\n{\n}\n\nvoid ofxJamoma::setupJamomaApp(){\n TTValue args, v, out, none;\n TTAddress address;\n TTErr err;\n\n TTLogMessage(\"\\n*** Initialisation of Modular environnement ***\\n\");\n \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n \/\/ Init the Modular library (passing the folder path where all the dylibs are)\n TTModularInit(\"\/usr\/local\/jamoma\/lib\/jamoma\/\");\n\n \/\/ Create an application manager\n mApplicationManager = TTObject(\"ApplicationManager\");\n\n\n TTLogMessage(\"\\n*** Creation of %s and %s applications ***\\n\", mAppLocalName.c_str(), mAppRemoteName.c_str());\n \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n \/\/ Create a local application called \"gorgone-1\" and get it back\n mApplicationLocal = mApplicationManager.send(\"ApplicationInstantiateLocal\", mAppLocalName.c_str());\n mApplicationRemote = mApplicationManager.send(\"ApplicationInstantiateDistant\", mAppRemoteName.c_str());\n mApplicationRemote2 = mApplicationManager.send(\"ApplicationInstantiateDistant\", mAppRemoteName2.c_str());\n\n\n \/\/ Get registered application names\n mApplicationManager.get(\"applicationNames\", out);\n for (TTElementIter it = out.begin() ; it != out.end() ; it++) {\n TTSymbol name = TTElement(*it);\n TTLogMessage(\"%s application is well registered into the application manager \\n\", name.c_str());\n }\n\n\n TTLogMessage(\"\\n*** Enable Minuit communication ***\\n\");\n \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n \/\/ Create a Minuit protocol unit\n err = mApplicationManager.send(\"ProtocolInstantiate\", \"Minuit\", out);\n\n if (err) {\n TTLogError(\"Error : can't create Minuit protocol unit \\n\");\n return;\n }\n else\n mProtocolMinuit = out[0];\n\n \/\/ Get Minuit Protocol attribute names and types\n mProtocolMinuit.get(\"parameterNames\", out);\n for (TTElementIter it = out.begin() ; it != out.end() ; it++) {\n TTSymbol name = TTElement(*it);\n TTSymbol type = mProtocolMinuit.attributeType(name);\n TTLogMessage(\"Minuit %s parameter is a %s \\n\", name.c_str(), type.c_str());\n }\n\n \/\/ Register mymyRemoteAppApp and myRemoteApp to the Minuit protocol\n mProtocolMinuit.send(\"ApplicationRegister\", mAppLocalName.c_str(), out);\n mProtocolMinuit.send(\"ApplicationRegister\", mAppRemoteName.c_str(), out);\n mProtocolMinuit.send(\"ApplicationRegister\", mAppRemoteName2.c_str(), out);\n\n \/\/ Select gorgone-1 to set its protocol parameters\n mProtocolMinuit.send(\"ApplicationSelect\", mAppLocalName.c_str(), out);\n mProtocolMinuit.set(\"port\", 9998);\n mProtocolMinuit.set(\"ip\", \"127.0.0.1\");\n\n \/\/ Select gorgone-1 to set its protocol parameters\n mProtocolMinuit.send(\"ApplicationSelect\", mAppRemoteName2.c_str(), out);\n mProtocolMinuit.set(\"port\", 9999);\n mProtocolMinuit.set(\"ip\", \"127.0.0.1\");\n\n \/\/ Select myRemoteApp to set its protocol parameters\n mProtocolMinuit.send(\"ApplicationSelect\", mAppRemoteName.c_str(), out);\n mProtocolMinuit.set(\"port\", 13579);\n mProtocolMinuit.set(\"ip\", mAppRemoteIp.c_str());\n\n \/\/ Get Minuit parameters for each registered application\n mProtocolMinuit.get(\"applicationNames\", out);\n for (TTElementIter it = out.begin() ; it != out.end() ; it++) {\n TTSymbol name = TTElement(*it);\n\n mProtocolMinuit.send(\"ApplicationSelect\", name, out);\n TTLogMessage(\"Minuit setup for %s application : \\n\", name.c_str());\n\n mProtocolMinuit.get(\"ip\", v);\n TTSymbol ip = v[0];\n TTLogMessage(\"- ip = %s \\n\", ip.c_str());\n\n mProtocolMinuit.get(\"port\", v);\n TTUInt16 port = v[0];\n TTLogMessage(\"- port = %d \\n\", port);\n }\n\n \/\/ Enable Minuit communication\n mProtocolMinuit.send(\"Run\");\n\n TTLogMessage(\"\\n*** Current Protocol Setup ***\\n\");\n \/\/ Get protocol names\n mApplicationManager.get(\"protocolNames\", out);\n for (TTElementIter it = out.begin() ; it != out.end() ; it++) {\n TTSymbol name = TTElement(*it);\n TTLogMessage(\"%s protocol is well registered into the application manager \\n\", name.c_str());\n }\n}\n\nvoid ofxJamoma::registerJamomaParam(){\n TTValue args, v, out, none;\n TTAddress address;\n TTErr err;\n TTLogMessage(\"\\n*** Creation and registration of a decimal parameter ***\\n\");\n \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n \/\/ Create a decimal parameter data and set its callback function and baton and some attributes\n mTrackEnableParameter = TTObject(\"Data\", \"parameter\");\n\n \/\/ Setup the callback mechanism to get the value back\n args = TTValue(mParent, mTrackEnableParameter);\n mTrackEnableParameter.set(\"baton\", args);\n mTrackEnableParameter.set(\"function\", TTPtr(&DemoAppDataReturnValueCallback));\n\n \/\/ Setup the data attributes depending of its use inside the application\n mTrackEnableParameter.set(\"type\", \"boolean\");\n mTrackEnableParameter.set(\"description\", \"start\/stop tracking\");\n\n \/\/ Register the parameter data into gorgone-1 at an address\n args = TTValue(\"\/tracking\/enable\", mTrackEnableParameter);\n err = mApplicationLocal.send(\"ObjectRegister\", args, out);\n\n if (err)\n TTLogError(\"Error : can't register data at \/tracking\/enable address \\n\");\n\n else {\n address = out[0];\n TTLogMessage(\"\\n \/tracking\/enable : effective registration address is %s \\n\", address.c_str());\n }\n\n \/\/ Create a decimal parameter data and set its callback function and baton and some attributes\n mDrawingEnableParameter = TTObject(\"Data\", \"parameter\");\n\n \/\/ Setup the callback mechanism to get the value back\n args = TTValue(mParent, mDrawingEnableParameter);\n mDrawingEnableParameter.set(\"baton\", args);\n mDrawingEnableParameter.set(\"function\", TTPtr(&DemoAppDataReturnValueCallback));\n\n \/\/ Setup the data attributes depending of its use inside the application\n mDrawingEnableParameter.set(\"type\", \"boolean\");\n mDrawingEnableParameter.set(\"description\", \"start\/stop drawing\");\n\n \/\/ Register the parameter data into gorgone-1 at an address\n args = TTValue(\"\/drawing\/enable\", mDrawingEnableParameter);\n err = mApplicationLocal.send(\"ObjectRegister\", args, out);\n\n if (err)\n TTLogError(\"Error : can't register data at \/drawing\/enable address \\n\");\n\n else {\n address = out[0];\n TTLogMessage(\"\\n \/drawing\/enable : effective registration address is %s \\n\", address.c_str());\n }\n\n \/\/ Create a new boolean parameter\n mComputeIrisCodeParameter = TTObject(\"Data\", \"parameter\");\n\n \/\/ Setup the callback mechanism to get the value back\n args = TTValue(mParent, mComputeIrisCodeParameter);\n mComputeIrisCodeParameter.set(\"baton\", args);\n mComputeIrisCodeParameter.set(\"function\", TTPtr(&DemoAppDataReturnValueCallback));\n\n \/\/ Setup the data attributes depending of its use inside the application\n mComputeIrisCodeParameter.set(\"type\", \"boolean\");\n mComputeIrisCodeParameter.set(\"description\", \"start\/stop drawing\");\n\n \/\/ Register the parameter data into gorgone-1 at an address\n args = TTValue(\"\/tracking\/computecode\", mComputeIrisCodeParameter);\n err = mApplicationLocal.send(\"ObjectRegister\", args, out);\n\n if (err)\n TTLogError(\"Error : can't register data at \/tracking\/computecode address \\n\");\n\n else {\n address = out[0];\n TTLogMessage(\"\\n \/tracking\/computecode : effective registration address is %s \\n\", address.c_str());\n }\n\n \/\/ Create a new array parameter\n mDrawingCoeffParameter = TTObject(\"Data\", \"parameter\");\n\n \/\/ Setup the callback mechanism to get the value back\n args = TTValue(mParent, mDrawingCoeffParameter);\n mDrawingCoeffParameter.set(\"baton\", args);\n mDrawingCoeffParameter.set(\"function\", TTPtr(&DemoAppDataReturnValueCallback));\n\n \/\/ Setup the data attributes depending of its use inside the application\n mDrawingCoeffParameter.set(\"type\", \"array\");\n mDrawingCoeffParameter.set(\"description\", \"shape coefficient\");\n\n \/\/ Register the parameter data into gorgone-1 at an address\n args = TTValue(\"\/drawing\/coeff\", mDrawingCoeffParameter);\n err = mApplicationLocal.send(\"ObjectRegister\", args, out);\n\n if (err)\n TTLogError(\"Error : can't register data at \/drawing\/coeff address \\n\");\n\n else {\n address = out[0];\n TTLogMessage(\"\\n \/drawing\/coeff : effective registration address is %s \\n\", address.c_str());\n }\n\n\n \/\/ Create a new array return for iris code\n mTrackingIrisCodeReturn = TTObject(\"Data\", \"return\");\n\n \/\/ Setup the callback mechanism to get the value back\n args = TTValue(mParent, mTrackingIrisCodeReturn);\n mTrackingIrisCodeReturn.set(\"baton\", args);\n mTrackingIrisCodeReturn.set(\"function\", TTPtr(&DemoAppDataReturnValueCallback));\n\n \/\/ Setup the data attributes depending of its use inside the application\n mTrackingIrisCodeReturn.set(\"type\", \"array\");\n mTrackingIrisCodeReturn.set(\"description\", \"iris code\");\n\n \/\/ Register the parameter data into gorgone-1 at an address\n args = TTValue(\"\/tracking\/iriscode\", mTrackingIrisCodeReturn);\n err = mApplicationLocal.send(\"ObjectRegister\", args, out);\n\n if (err)\n TTLogError(\"Error : can't register data at \/tracking\/iriscode address \\n\");\n\n else {\n address = out[0];\n TTLogMessage(\"\\n \/tracking\/iriscode : effective registration address is %s \\n\", address.c_str());\n }\n\n \/\/ Create a new array return for drawing shape\n mDrawingShapeXReturn = TTObject(\"Data\", \"return\");\n\n \/\/ Setup the callback mechanism to get the value back\n args = TTValue(mParent, mDrawingShapeXReturn);\n mDrawingShapeXReturn.set(\"baton\", args);\n mDrawingShapeXReturn.set(\"function\", TTPtr(&DemoAppDataReturnValueCallback));\n\n \/\/ Setup the data attributes depending of its use inside the application\n mDrawingShapeXReturn.set(\"type\", \"array\");\n mDrawingShapeXReturn.set(\"description\", \"drawing shape X\");\n\n \/\/ Register the parameter data into gorgone-1 at an address\n args = TTValue(\"\/drawing\/shape\/x\", mDrawingShapeXReturn);\n err = mApplicationLocal.send(\"ObjectRegister\", args, out);\n\n if (err)\n TTLogError(\"Error : can't register data at \/drawing\/shape\/x address \\n\");\n\n else {\n address = out[0];\n TTLogMessage(\"\\n \/drawing\/shape\/x : effective registration address is %s \\n\", address.c_str());\n }\n\n \/\/ Create a new array return for drawing shape\n mDrawingShapeYReturn = TTObject(\"Data\", \"return\");\n\n \/\/ Setup the callback mechanism to get the value back\n args = TTValue(mParent, mDrawingShapeYReturn);\n mDrawingShapeYReturn.set(\"baton\", args);\n mDrawingShapeYReturn.set(\"function\", TTPtr(&DemoAppDataReturnValueCallback));\n\n \/\/ Setup the data attributes depending of its use inside the application\n mDrawingShapeYReturn.set(\"type\", \"array\");\n mDrawingShapeYReturn.set(\"description\", \"Drawing shape Y\");\n\n \/\/ Register the parameter data into gorgone-1 at an address\n args = TTValue(\"\/drawing\/shape\/y\", mDrawingShapeYReturn);\n err = mApplicationLocal.send(\"ObjectRegister\", args, out);\n\n if (err)\n TTLogError(\"Error : can't register data at \/drawing\/shape\/y address \\n\");\n\n else {\n address = out[0];\n TTLogMessage(\"\\n \/drawing\/shape\/y : effective registration address is %s \\n\", address.c_str());\n }\n\n \/\/ Create a new brightness parameter\n mTrackingLedBrightness = TTObject(\"Data\", \"parameter\");\n\n \/\/ Setup the callback mechanism to get the value back\n args = TTValue(mParent, mTrackingLedBrightness);\n mTrackingLedBrightness.set(\"baton\", args);\n mTrackingLedBrightness.set(\"function\", TTPtr(&DemoAppDataReturnValueCallback));\n\n \/\/ Setup the data attributes depending of its use inside the application\n mTrackingLedBrightness.set(\"type\", \"integer\");\n mTrackingLedBrightness.set(\"description\", \"LED brightness\");\n mTrackingLedBrightness.set(\"rangeBounds\", TTValue(0, 1023));\n mTrackingLedBrightness.set(\"rangeClipmode\", \"both\");\n\n \/\/ Register the parameter data into gorgone-1 at an address\n args = TTValue(\"\/tracking\/ledbrightness\", mTrackingLedBrightness);\n err = mApplicationLocal.send(\"ObjectRegister\", args, out);\n\n if (err)\n TTLogError(\"Error : can't register data at \/tracking\/ledbrightness address \\n\");\n\n else {\n address = out[0];\n TTLogMessage(\"\\n \/tracking\/ledbrightness : effective registration address is %s \\n\", address.c_str());\n }\n\n \/\/ Create a new brightness parameter\n mTrackingLaserBrightness = TTObject(\"Data\", \"parameter\");\n\n \/\/ Setup the callback mechanism to get the value back\n args = TTValue(mParent, mTrackingLaserBrightness);\n mTrackingLaserBrightness.set(\"baton\", args);\n mTrackingLaserBrightness.set(\"function\", TTPtr(&DemoAppDataReturnValueCallback));\n\n \/\/ Setup the data attributes depending of its use inside the application\n mTrackingLaserBrightness.set(\"type\", \"decimal\");\n mTrackingLaserBrightness.set(\"description\", \"laser brightness\");\n mTrackingLaserBrightness.set(\"rangeBounds\", TTValue(0., 100.));\n mTrackingLaserBrightness.set(\"rangeClipmode\", \"both\");\n\n \/\/ Register the parameter data into gorgone-1 at an address\n args = TTValue(\"\/drawing\/laserbrightness\", mTrackingLaserBrightness);\n err = mApplicationLocal.send(\"ObjectRegister\", args, out);\n\n if (err)\n TTLogError(\"Error : can't register data at \/drawing\/laserbrightness address \\n\");\n\n else {\n address = out[0];\n TTLogMessage(\"\\n \/drawing\/laserbrightness : effective registration address is %s \\n\", address.c_str());\n }\n}\n\n\nTTErr\nDemoAppDataReturnValueCallback(const TTValue& baton, const TTValue& value)\n{\n gorgone* gorgoneApp = (gorgone*)TTPtr(baton[0]);\n TTObject anObject = baton[1];\n\n \/\/ Reteive which data has been updated\n if (anObject.instance() == gorgoneApp->jamoma.mTrackEnableParameter.instance()) {\n\n gorgoneApp->bTracking = value[0];\n return kTTErrNone;\n }\n\n if (anObject.instance() == gorgoneApp->jamoma.mDrawingEnableParameter.instance()) {\n gorgoneApp->bDisplaying = value[0];\n return kTTErrNone;\n }\n\n if (anObject.instance() == gorgoneApp->jamoma.mComputeIrisCodeParameter.instance()) {\n gorgoneApp->bComputeCode = value[0];\n return kTTErrNone;\n }\n\n if (anObject.instance() == gorgoneApp->jamoma.mDrawingCoeffParameter.instance()) {\n gorgoneApp->svgInterp.coeff.clear();\n for (int i = 0; i < value.size(); i++)\n gorgoneApp->svgInterp.coeff.push_back(value[i]);\n gorgoneApp->svgInterp.multiInterpolation();\n return kTTErrNone;\n }\n\n#ifdef TARGET_RASPBERRY_PI\n if (anObject.instance() == gorgoneApp->jamoma.mTrackingLedBrightness.instance()) {\n gorgoneApp->vidGrabber.led.setBrightness(value[0]);\n return kTTErrNone;\n }\n\n if (anObject.instance() == gorgoneApp->jamoma.mTrackingLaserBrightness.instance()) {\n gorgoneApp->setPwm(value[0]);\n return kTTErrNone;\n }\n\n#endif\n\n return kTTErrGeneric;\n}\n<|endoftext|>"} {"text":"<commit_before>\/*\n** Copyright 2011-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 <sstream>\n#include \"com\/centreon\/broker\/influxdb\/json_printer.hh\"\n\nusing namespace com::centreon::broker::influxdb;\n\n\/**\n * Default constructor.\n *\/\njson_printer::json_printer() {\n _data.reserve(128);\n}\n\n\/**\n * Destructor.\n *\/\njson_printer::~json_printer() {\n\n}\n\n\/**\n * Copy constructor.\n *\n * @param[in] other The object to copy.\n *\/\njson_printer::json_printer(json_printer const& other) {\n _data = other._data;\n}\n\n\/**\n * Assignment operator.\n *\n * @param[in] other The object to copy.\n *\n * @return A reference to this object.\n *\/\njson_printer& json_printer::operator=(json_printer const& other) {\n if (this != &other) {\n _data = other._data;\n }\n return (*this);\n}\n\n\/**\n * Get the resulting string.\n *\n * @return The resulting string.\n *\/\nstd::string const& json_printer::get_data() const {\n return (_data);\n}\n\n\/**\n * Get the size of the resulting string.\n *\n * @return The size of the resulting string.\n *\/\nsize_t json_printer::get_size() const {\n return (_data.size());\n}\n\nstatic void add_tag(std::string& data, std::string const& name) {\n if (!name.empty())\n data.append(\"\\\"\").append(name).append(\"\\\":\");\n}\n\n\/**\n * Open an object.\n *\n * @param[in] name The name of the object.\n *\n * @return A reference to this object.\n *\/\njson_printer& json_printer::open_object(std::string const& name) {\n add_tag(_data, name);\n _data.append(\"{\");\n return (*this);\n}\n\n\/**\n * Close an object.\n *\n * @return A reference to this object.\n *\/\njson_printer& json_printer::close_object() {\n _data.append(\"},\");\n return (*this);\n}\n\n\/**\n * Open an array.\n *\n * @param[in] name The name of the array.\n *\n * @return A reference to this object.\n *\/\njson_printer& json_printer::open_array(std::string const& name) {\n add_tag(_data, name);\n _data.append(\"[\");\n return (*this);\n}\n\n\/**\n * Close an object.\n *\n * @return A reference to this object.\n *\/\njson_printer& json_printer::close_array() {\n _data.append(\"]\");\n return (*this);\n}\n\n\/**\n * Add a string value.\n *\n * @param[in] name The name of the value.\n * @param[in] value The value.\n *\n * @return A reference to this object.\n *\/\njson_printer& json_printer::add_string(\n std::string const& name,\n std::string const& value) {\n add_tag(_data, name);\n _data.append(\"\\\"\").append(value).append(\"\\\",\");\n return (*this);\n}\n<commit_msg>Influxdb: Manage trailing comas.<commit_after>\/*\n** Copyright 2011-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 <sstream>\n#include \"com\/centreon\/broker\/influxdb\/json_printer.hh\"\n\nusing namespace com::centreon::broker::influxdb;\n\n\/**\n * Default constructor.\n *\/\njson_printer::json_printer() {\n _data.reserve(128);\n}\n\n\/**\n * Destructor.\n *\/\njson_printer::~json_printer() {\n\n}\n\n\/**\n * Copy constructor.\n *\n * @param[in] other The object to copy.\n *\/\njson_printer::json_printer(json_printer const& other) {\n _data = other._data;\n}\n\n\/**\n * Assignment operator.\n *\n * @param[in] other The object to copy.\n *\n * @return A reference to this object.\n *\/\njson_printer& json_printer::operator=(json_printer const& other) {\n if (this != &other) {\n _data = other._data;\n }\n return (*this);\n}\n\n\/**\n * Get the resulting string.\n *\n * @return The resulting string.\n *\/\nstd::string const& json_printer::get_data() const {\n std::string& data = (const_cast<json_printer*>(this))->_data;\n if (!data.empty() && data[data.size() - 1] == ',')\n data[data.size() - 1] = ' ';\n return (_data);\n}\n\n\/**\n * Get the size of the resulting string.\n *\n * @return The size of the resulting string.\n *\/\nsize_t json_printer::get_size() const {\n return (_data.size());\n}\n\nstatic void add_tag(std::string& data, std::string const& name) {\n if (!name.empty())\n data.append(\"\\\"\").append(name).append(\"\\\":\");\n}\n\n\/**\n * Open an object.\n *\n * @param[in] name The name of the object.\n *\n * @return A reference to this object.\n *\/\njson_printer& json_printer::open_object(std::string const& name) {\n add_tag(_data, name);\n _data.append(\"{\");\n return (*this);\n}\n\n\/**\n * Close an object.\n *\n * @return A reference to this object.\n *\/\njson_printer& json_printer::close_object() {\n if (!_data.empty() && _data[_data.size() - 1] == ',')\n _data[_data.size() - 1] = ' ';\n _data.append(\"},\");\n return (*this);\n}\n\n\/**\n * Open an array.\n *\n * @param[in] name The name of the array.\n *\n * @return A reference to this object.\n *\/\njson_printer& json_printer::open_array(std::string const& name) {\n add_tag(_data, name);\n _data.append(\"[\");\n return (*this);\n}\n\n\/**\n * Close an object.\n *\n * @return A reference to this object.\n *\/\njson_printer& json_printer::close_array() {\n if (!_data.empty() && _data[_data.size() - 1] == ',')\n _data[_data.size() - 1] = ']';\n else\n _data.append(\"]\");\n return (*this);\n}\n\n\/**\n * Add a string value.\n *\n * @param[in] name The name of the value.\n * @param[in] value The value.\n *\n * @return A reference to this object.\n *\/\njson_printer& json_printer::add_string(\n std::string const& name,\n std::string const& value) {\n add_tag(_data, name);\n _data.append(\"\\\"\").append(value).append(\"\\\",\");\n return (*this);\n}\n<|endoftext|>"} {"text":"<commit_before>\/\/ Copyright (c) 2009-2010 Satoshi Nakamoto\n\/\/ Copyright (c) 2009-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 \"chainparams.h\"\n#include \"clientversion.h\"\n#include \"compat.h\"\n#include \"fs.h\"\n#include \"rpc\/server.h\"\n#include \"init.h\"\n#include \"noui.h\"\n#include \"scheduler.h\"\n#include \"util.h\"\n#include \"httpserver.h\"\n#include \"httprpc.h\"\n#include \"utilstrencodings.h\"\n\n#include <boost\/algorithm\/string\/predicate.hpp>\n#include <boost\/thread.hpp>\n\n#include <stdio.h>\n\n\/* Introduction text for doxygen: *\/\n\n\/*! \\mainpage Developer documentation\n *\n * \\section intro_sec Introduction\n *\n * This is the developer documentation of the reference client for an experimental new digital currency called Bitcoin (https:\/\/www.bitcoin.org\/),\n * which enables instant payments to anyone, anywhere in the world. Bitcoin uses peer-to-peer technology to operate\n * with no central authority: managing transactions and issuing money are carried out collectively by the network.\n *\n * The software is a community-driven open source project, released under the MIT license.\n *\n * \\section Navigation\n * Use the buttons <code>Namespaces<\/code>, <code>Classes<\/code> or <code>Files<\/code> at the top of the page to start navigating the code.\n *\/\n\nvoid WaitForShutdown(boost::thread_group* threadGroup)\n{\n bool fShutdown = ShutdownRequested();\n \/\/ Tell the main threads to shutdown.\n while (!fShutdown)\n {\n MilliSleep(200);\n fShutdown = ShutdownRequested();\n }\n if (threadGroup)\n {\n Interrupt(*threadGroup);\n threadGroup->join_all();\n }\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\n\/\/ Start\n\/\/\nbool AppInit(int argc, char* argv[])\n{\n boost::thread_group threadGroup;\n CScheduler scheduler;\n\n bool fRet = false;\n\n \/\/\n \/\/ Parameters\n \/\/\n \/\/ If Qt is used, parameters\/bitcoin.conf are parsed in qt\/bitcoin.cpp's main()\n ParseParameters(argc, argv);\n\n \/\/ Process help and version before taking care about datadir\n if (IsArgSet(\"-?\") || IsArgSet(\"-h\") || IsArgSet(\"-help\") || IsArgSet(\"-version\"))\n {\n std::string strUsage = strprintf(_(\"%s Daemon\"), _(PACKAGE_NAME)) + \" \" + _(\"version\") + \" \" + FormatFullVersion() + \"\\n\";\n\n if (IsArgSet(\"-version\"))\n {\n strUsage += FormatParagraph(LicenseInfo());\n }\n else\n {\n strUsage += \"\\n\" + _(\"Usage:\") + \"\\n\" +\n \" bitcoind [options] \" + strprintf(_(\"Start %s Daemon\"), _(PACKAGE_NAME)) + \"\\n\";\n\n strUsage += \"\\n\" + HelpMessage(HMM_BITCOIND);\n }\n\n fprintf(stdout, \"%s\", strUsage.c_str());\n return true;\n }\n\n try\n {\n if (!fs::is_directory(GetDataDir(false)))\n {\n fprintf(stderr, \"Error: Specified data directory \\\"%s\\\" does not exist.\\n\", GetArg(\"-datadir\", \"\").c_str());\n return false;\n }\n try\n {\n ReadConfigFile(GetArg(\"-conf\", BITCOIN_CONF_FILENAME));\n } catch (const std::exception& e) {\n fprintf(stderr,\"Error reading configuration file: %s\\n\", e.what());\n return false;\n }\n \/\/ Check for -testnet or -regtest parameter (Params() calls are only valid after this clause)\n try {\n SelectParams(ChainNameFromCommandLine());\n } catch (const std::exception& e) {\n fprintf(stderr, \"Error: %s\\n\", e.what());\n return false;\n }\n\n \/\/ Command-line RPC\n bool fCommandLine = false;\n for (int i = 1; i < argc; i++)\n if (!IsSwitchChar(argv[i][0]) && !boost::algorithm::istarts_with(argv[i], \"bitcoin:\"))\n fCommandLine = true;\n\n if (fCommandLine)\n {\n fprintf(stderr, \"Error: There is no RPC client functionality in bitcoind anymore. Use the bitcoin-cli utility instead.\\n\");\n exit(EXIT_FAILURE);\n }\n \/\/ -server defaults to true for bitcoind but not for the GUI so do this here\n SoftSetBoolArg(\"-server\", true);\n \/\/ Set this early so that parameter interactions go to console\n InitLogging();\n InitParameterInteraction();\n if (!AppInitBasicSetup())\n {\n \/\/ InitError will have been called with detailed error, which ends up on console\n exit(EXIT_FAILURE);\n }\n if (!AppInitParameterInteraction())\n {\n \/\/ InitError will have been called with detailed error, which ends up on console\n exit(EXIT_FAILURE);\n }\n if (!AppInitSanityChecks())\n {\n \/\/ InitError will have been called with detailed error, which ends up on console\n exit(EXIT_FAILURE);\n }\n if (GetBoolArg(\"-daemon\", false))\n {\n#if HAVE_DECL_DAEMON\n fprintf(stdout, \"Bitcoin server starting\\n\");\n\n \/\/ Daemonize\n if (daemon(1, 0)) { \/\/ don't chdir (1), do close FDs (0)\n fprintf(stderr, \"Error: daemon() failed: %s\\n\", strerror(errno));\n return false;\n }\n#else\n fprintf(stderr, \"Error: -daemon is not supported on this operating system\\n\");\n return false;\n#endif \/\/ HAVE_DECL_DAEMON\n }\n\n fRet = AppInitMain(threadGroup, scheduler);\n }\n catch (const std::exception& e) {\n PrintExceptionContinue(&e, \"AppInit()\");\n } catch (...) {\n PrintExceptionContinue(NULL, \"AppInit()\");\n }\n\n if (!fRet)\n {\n Interrupt(threadGroup);\n \/\/ threadGroup.join_all(); was left out intentionally here, because we didn't re-test all of\n \/\/ the startup-failure cases to make sure they don't result in a hang due to some\n \/\/ thread-blocking-waiting-for-another-thread-during-startup case\n } else {\n WaitForShutdown(&threadGroup);\n }\n Shutdown();\n\n return fRet;\n}\n\nint main(int argc, char* argv[])\n{\n SetupEnvironment();\n\n \/\/ Connect bitcoind signal handlers\n noui_connect();\n\n return (AppInit(argc, argv) ? EXIT_SUCCESS : EXIT_FAILURE);\n}\n<commit_msg>Make bitcoind invalid argument error message specific<commit_after>\/\/ Copyright (c) 2009-2010 Satoshi Nakamoto\n\/\/ Copyright (c) 2009-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 \"chainparams.h\"\n#include \"clientversion.h\"\n#include \"compat.h\"\n#include \"fs.h\"\n#include \"rpc\/server.h\"\n#include \"init.h\"\n#include \"noui.h\"\n#include \"scheduler.h\"\n#include \"util.h\"\n#include \"httpserver.h\"\n#include \"httprpc.h\"\n#include \"utilstrencodings.h\"\n\n#include <boost\/algorithm\/string\/predicate.hpp>\n#include <boost\/thread.hpp>\n\n#include <stdio.h>\n\n\/* Introduction text for doxygen: *\/\n\n\/*! \\mainpage Developer documentation\n *\n * \\section intro_sec Introduction\n *\n * This is the developer documentation of the reference client for an experimental new digital currency called Bitcoin (https:\/\/www.bitcoin.org\/),\n * which enables instant payments to anyone, anywhere in the world. Bitcoin uses peer-to-peer technology to operate\n * with no central authority: managing transactions and issuing money are carried out collectively by the network.\n *\n * The software is a community-driven open source project, released under the MIT license.\n *\n * \\section Navigation\n * Use the buttons <code>Namespaces<\/code>, <code>Classes<\/code> or <code>Files<\/code> at the top of the page to start navigating the code.\n *\/\n\nvoid WaitForShutdown(boost::thread_group* threadGroup)\n{\n bool fShutdown = ShutdownRequested();\n \/\/ Tell the main threads to shutdown.\n while (!fShutdown)\n {\n MilliSleep(200);\n fShutdown = ShutdownRequested();\n }\n if (threadGroup)\n {\n Interrupt(*threadGroup);\n threadGroup->join_all();\n }\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\n\/\/ Start\n\/\/\nbool AppInit(int argc, char* argv[])\n{\n boost::thread_group threadGroup;\n CScheduler scheduler;\n\n bool fRet = false;\n\n \/\/\n \/\/ Parameters\n \/\/\n \/\/ If Qt is used, parameters\/bitcoin.conf are parsed in qt\/bitcoin.cpp's main()\n ParseParameters(argc, argv);\n\n \/\/ Process help and version before taking care about datadir\n if (IsArgSet(\"-?\") || IsArgSet(\"-h\") || IsArgSet(\"-help\") || IsArgSet(\"-version\"))\n {\n std::string strUsage = strprintf(_(\"%s Daemon\"), _(PACKAGE_NAME)) + \" \" + _(\"version\") + \" \" + FormatFullVersion() + \"\\n\";\n\n if (IsArgSet(\"-version\"))\n {\n strUsage += FormatParagraph(LicenseInfo());\n }\n else\n {\n strUsage += \"\\n\" + _(\"Usage:\") + \"\\n\" +\n \" bitcoind [options] \" + strprintf(_(\"Start %s Daemon\"), _(PACKAGE_NAME)) + \"\\n\";\n\n strUsage += \"\\n\" + HelpMessage(HMM_BITCOIND);\n }\n\n fprintf(stdout, \"%s\", strUsage.c_str());\n return true;\n }\n\n try\n {\n if (!fs::is_directory(GetDataDir(false)))\n {\n fprintf(stderr, \"Error: Specified data directory \\\"%s\\\" does not exist.\\n\", GetArg(\"-datadir\", \"\").c_str());\n return false;\n }\n try\n {\n ReadConfigFile(GetArg(\"-conf\", BITCOIN_CONF_FILENAME));\n } catch (const std::exception& e) {\n fprintf(stderr,\"Error reading configuration file: %s\\n\", e.what());\n return false;\n }\n \/\/ Check for -testnet or -regtest parameter (Params() calls are only valid after this clause)\n try {\n SelectParams(ChainNameFromCommandLine());\n } catch (const std::exception& e) {\n fprintf(stderr, \"Error: %s\\n\", e.what());\n return false;\n }\n\n \/\/ Error out when loose non-argument tokens are encountered on command line\n for (int i = 1; i < argc; i++) {\n if (!IsSwitchChar(argv[i][0])) {\n fprintf(stderr, \"Error: Command line contains unexpected token '%s', see bitcoind -h for a list of options.\\n\", argv[i]);\n exit(EXIT_FAILURE);\n }\n }\n\n \/\/ -server defaults to true for bitcoind but not for the GUI so do this here\n SoftSetBoolArg(\"-server\", true);\n \/\/ Set this early so that parameter interactions go to console\n InitLogging();\n InitParameterInteraction();\n if (!AppInitBasicSetup())\n {\n \/\/ InitError will have been called with detailed error, which ends up on console\n exit(EXIT_FAILURE);\n }\n if (!AppInitParameterInteraction())\n {\n \/\/ InitError will have been called with detailed error, which ends up on console\n exit(EXIT_FAILURE);\n }\n if (!AppInitSanityChecks())\n {\n \/\/ InitError will have been called with detailed error, which ends up on console\n exit(EXIT_FAILURE);\n }\n if (GetBoolArg(\"-daemon\", false))\n {\n#if HAVE_DECL_DAEMON\n fprintf(stdout, \"Bitcoin server starting\\n\");\n\n \/\/ Daemonize\n if (daemon(1, 0)) { \/\/ don't chdir (1), do close FDs (0)\n fprintf(stderr, \"Error: daemon() failed: %s\\n\", strerror(errno));\n return false;\n }\n#else\n fprintf(stderr, \"Error: -daemon is not supported on this operating system\\n\");\n return false;\n#endif \/\/ HAVE_DECL_DAEMON\n }\n\n fRet = AppInitMain(threadGroup, scheduler);\n }\n catch (const std::exception& e) {\n PrintExceptionContinue(&e, \"AppInit()\");\n } catch (...) {\n PrintExceptionContinue(NULL, \"AppInit()\");\n }\n\n if (!fRet)\n {\n Interrupt(threadGroup);\n \/\/ threadGroup.join_all(); was left out intentionally here, because we didn't re-test all of\n \/\/ the startup-failure cases to make sure they don't result in a hang due to some\n \/\/ thread-blocking-waiting-for-another-thread-during-startup case\n } else {\n WaitForShutdown(&threadGroup);\n }\n Shutdown();\n\n return fRet;\n}\n\nint main(int argc, char* argv[])\n{\n SetupEnvironment();\n\n \/\/ Connect bitcoind signal handlers\n noui_connect();\n\n return (AppInit(argc, argv) ? EXIT_SUCCESS : EXIT_FAILURE);\n}\n<|endoftext|>"} {"text":"<commit_before>\/*\n * optitrack.cpp\n *\n * Created on: Aug 19, 2014\n * Author: Bjorn Blissing\n *\/\n\n#include \"optitrack.h\"\n#include <iostream>\n\nint OptiTrack::initialize()\n{\n\tif (m_projectFile.empty()) {\n\t\tstd::cerr << \"Error: OptiTrack Project filename cannot be empty.\" << std::endl;\n\t\treturn 1;\n\t}\n\n\tint errorCode = 0;\n\t\/\/ Try to initialize the OptiTrack system\n\terrorCode = checkResult(TT_Initialize());\n\t\n\t\/\/ Do an update to pick up any recently-arrived cameras.\n\terrorCode = checkResult(TT_Update());\n\t\n\t\/\/ Load project definition file\n\terrorCode = checkResult(TT_LoadProject(m_projectFile.c_str()));\n\t\n\tif (errorCode == NPRESULT_SUCCESS) {\n\t\tm_initialized = true;\n\t\treturn 0;\n\t}\n\n\treturn errorCode;\n}\n\nint OptiTrack::terminate() {\n\tint errorCode = checkResult(TT_Shutdown());\n\n\terrorCode = checkResult(TT_FinalCleanup());\n\n\tm_initialized = false;\n\n\treturn 0;\n}\n\nsize_t OptiTrack::getNumberOfCameras() const {\n\tif (m_initialized) {\n\t\treturn TT_TrackableCount();\n\t}\n\treturn 0;\n}\n\nsize_t OptiTrack::getNumberOfRigidBodies() const {\n\tif (m_initialized) {\n\t\treturn TT_TrackableCount();\n\t}\n\treturn 0;\n}\n\nstd::string OptiTrack::getNameOfCamera(int id) const {\n\tif (m_initialized) {\n\t\tif (id <= TT_TrackableCount()) {\n\t\t\treturn std::string(TT_TrackableName(id));\n\t\t}\n\t}\n\treturn std::string(\"\");\n}\n\nstd::string OptiTrack::getNameOfRigidBody(int id) const {\n\tif (m_initialized) {\n\t\tif (id <= TT_TrackableCount()) {\n\t\t\treturn std::string(TT_TrackableName(id));\n\t\t}\n\t}\n\treturn std::string(\"\");\n}\n\nbool OptiTrack::getPosition(int rigidBodyId, float& x, float& y, float& z)\n{\n\tif(m_initialized && TT_Update() == NPRESULT_SUCCESS ) {\n\t\tfloat qx, qy, qz, qw, yaw, pitch, roll;\n\t\tTT_TrackableLocation( rigidBodyId, &x, &y, &z, &qx, &qy, &qz, &qw, &yaw, &pitch, &roll);\n\t\tif( TT_IsTrackableTracked(rigidBodyId)) {\n\t\t\treturn true;\n\t\t}\n\t}\n\treturn false;\n}\n\nbool OptiTrack::getOrientation(int rigidBodyId, float& yaw, float& pitch, float& roll)\n{\n\tif(m_initialized && TT_Update() == NPRESULT_SUCCESS ) {\n\t\tfloat x, y, z, qx, qy, qz, qw;\n\t\tTT_TrackableLocation( rigidBodyId, &x, &y, &z, &qx, &qy, &qz, &qw, &yaw, &pitch, &roll);\n\t\tif( TT_IsTrackableTracked(rigidBodyId)) {\n\t\t\treturn true;\n\t\t}\n\t}\n\treturn false;\n}\n\nbool OptiTrack::getOrientation(int rigidBodyId, float& qx, float& qy, float& qz, float& qw)\n{\n\tif(m_initialized && TT_Update() == NPRESULT_SUCCESS ) {\n\t\tfloat x, y, z, yaw, pitch, roll;\n\t\tTT_TrackableLocation( rigidBodyId, &x, &y, &z, &qx, &qy, &qz, &qw, &yaw, &pitch, &roll);\n\t\tif( TT_IsTrackableTracked(rigidBodyId)) {\n\t\t\treturn true;\n\t\t}\n\t}\n\treturn false;\n}\n\nbool OptiTrack::getPositionAndOrientation(int rigidBodyId, float& x, float& y, float& z, float& yaw, float& pitch, float& roll)\n{\n\tif(m_initialized && TT_Update() == NPRESULT_SUCCESS ) {\n\t\tfloat qx,qy,qz,qw;\n\t\tTT_TrackableLocation( rigidBodyId, &x, &y, &z, &qx, &qy, &qz, &qw, &yaw, &pitch, &roll);\n\t\tif( TT_IsTrackableTracked(rigidBodyId)) {\n\t\t\treturn true;\n\t\t}\n\t}\n\treturn false;\n}\n\nbool OptiTrack::getPositionAndOrientation(int rigidBodyId, float& x, float& y, float& z, float& qx, float& qy, float& qz, float& qw)\n{\n\tif(m_initialized && TT_Update() == NPRESULT_SUCCESS ) {\n\t\tfloat yaw, pitch, roll;\n\t\tTT_TrackableLocation( rigidBodyId, &x, &y, &z, &qx, &qy, &qz, &qw, &yaw, &pitch, &roll);\n\t\tif( TT_IsTrackableTracked(rigidBodyId)) {\n\t\t\treturn true;\n\t\t}\n\t}\n\treturn false;\n}\n\nint OptiTrack::checkResult(int result) {\n\tif (result != NPRESULT_SUCCESS) {\n\t\tstd::cerr << \"Error: \" << TT_GetResultString(result) << std::endl;\n\t}\n\treturn result;\n}\n<commit_msg>Updated to support Motive 1.9<commit_after>\/*\n * optitrack.cpp\n *\n * Created on: Aug 19, 2014\n * Author: Bjorn Blissing\n *\/\n\n#include \"optitrack.h\"\n#include <iostream>\n\nint OptiTrack::initialize()\n{\n\tif (m_projectFile.empty()) {\n\t\tstd::cerr << \"Error: OptiTrack Project filename cannot be empty.\" << std::endl;\n\t\treturn 1;\n\t}\n\n\tint errorCode = 0;\n\t\/\/ Try to initialize the OptiTrack system\n\terrorCode = checkResult(TT_Initialize());\n\t\/\/ Do an update to pick up any recently-arrived cameras.\n\terrorCode = checkResult(TT_Update());\n\t\/\/ Load project definition file\n\terrorCode = checkResult(TT_LoadProject(m_projectFile.c_str()));\n\n\tif (errorCode == NPRESULT_SUCCESS) {\n\t\tm_initialized = true;\n\t\treturn 0;\n\t}\n\n\treturn errorCode;\n}\n\nint OptiTrack::terminate()\n{\n\tint errorCode = checkResult(TT_Shutdown());\n\tm_initialized = false;\n\treturn errorCode;\n}\n\nsize_t OptiTrack::getNumberOfCameras() const\n{\n\tif (m_initialized) {\n\t\treturn TT_CameraCount();\n\t}\n\n\treturn 0;\n}\n\nsize_t OptiTrack::getNumberOfRigidBodies() const\n{\n\tif (m_initialized) {\n\t\treturn TT_RigidBodyCount();\n\t}\n\n\treturn 0;\n}\n\nstd::string OptiTrack::getNameOfCamera(int id) const\n{\n\tif (m_initialized) {\n\t\tif (id <= TT_CameraCount()) {\n\t\t\treturn std::string(TT_CameraName(id));\n\t\t}\n\t}\n\n\treturn std::string(\"\");\n}\n\nstd::string OptiTrack::getNameOfRigidBody(int id) const\n{\n\tif (m_initialized) {\n\t\tif (id <= TT_RigidBodyCount()) {\n\t\t\treturn std::string(TT_RigidBodyName(id));\n\t\t}\n\t}\n\n\treturn std::string(\"\");\n}\n\nbool OptiTrack::getPosition(int rigidBodyId, float& x, float& y, float& z)\n{\n\tif (m_initialized && TT_Update() == NPRESULT_SUCCESS ) {\n\t\tfloat qx, qy, qz, qw, yaw, pitch, roll;\n\t\tTT_RigidBodyLocation( rigidBodyId, &x, &y, &z, &qx, &qy, &qz, &qw, &yaw, &pitch, &roll);\n\n\t\tif ( TT_IsRigidBodyTracked(rigidBodyId)) {\n\t\t\treturn true;\n\t\t}\n\t}\n\n\treturn false;\n}\n\nbool OptiTrack::getOrientation(int rigidBodyId, float& yaw, float& pitch, float& roll)\n{\n\tif (m_initialized && TT_Update() == NPRESULT_SUCCESS ) {\n\t\tfloat x, y, z, qx, qy, qz, qw;\n\t\tTT_RigidBodyLocation( rigidBodyId, &x, &y, &z, &qx, &qy, &qz, &qw, &yaw, &pitch, &roll);\n\n\t\tif ( TT_IsRigidBodyTracked(rigidBodyId)) {\n\t\t\treturn true;\n\t\t}\n\t}\n\n\treturn false;\n}\n\nbool OptiTrack::getOrientation(int rigidBodyId, float& qx, float& qy, float& qz, float& qw)\n{\n\tif (m_initialized && TT_Update() == NPRESULT_SUCCESS ) {\n\t\tfloat x, y, z, yaw, pitch, roll;\n\t\tTT_RigidBodyLocation( rigidBodyId, &x, &y, &z, &qx, &qy, &qz, &qw, &yaw, &pitch, &roll);\n\n\t\tif ( TT_IsRigidBodyTracked(rigidBodyId)) {\n\t\t\treturn true;\n\t\t}\n\t}\n\n\treturn false;\n}\n\nbool OptiTrack::getPositionAndOrientation(int rigidBodyId, float& x, float& y, float& z, float& yaw, float& pitch, float& roll)\n{\n\tif (m_initialized && TT_Update() == NPRESULT_SUCCESS ) {\n\t\tfloat qx,qy,qz,qw;\n\t\tTT_RigidBodyLocation( rigidBodyId, &x, &y, &z, &qx, &qy, &qz, &qw, &yaw, &pitch, &roll);\n\n\t\tif ( TT_IsRigidBodyTracked(rigidBodyId)) {\n\t\t\treturn true;\n\t\t}\n\t}\n\n\treturn false;\n}\n\nbool OptiTrack::getPositionAndOrientation(int rigidBodyId, float& x, float& y, float& z, float& qx, float& qy, float& qz, float& qw)\n{\n\tif (m_initialized && TT_Update() == NPRESULT_SUCCESS ) {\n\t\tfloat yaw, pitch, roll;\n\t\tTT_RigidBodyLocation( rigidBodyId, &x, &y, &z, &qx, &qy, &qz, &qw, &yaw, &pitch, &roll);\n\n\t\tif ( TT_IsRigidBodyTracked(rigidBodyId)) {\n\t\t\treturn true;\n\t\t}\n\t}\n\n\treturn false;\n}\n\nint OptiTrack::checkResult(int result)\n{\n\tif (result != NPRESULT_SUCCESS) {\n\t\tstd::cerr << \"Error: \" << TT_GetResultString(result) << std::endl;\n\t}\n\n\treturn result;\n}\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 \"twin.h\"\n\n\/\/{{{ Vertex data ------------------------------------------------------\nnamespace {\n\nstatic const CTestWindow::coord_t _vdata1[] = {\n 0,0, 0,479, 639,479, 639,0,\n 50,50, 50,300, 150,300, 150,50,\n 100,100, 200,200, 300,200, 300,300,\n 250,250, 250,400, 350,250, 500,450,\n 250,50, 300,100, 300,50, 350,75,\n 0,0, 0,-1, 1,0, 1,-1\n};\nenum {\n vb_WindowBorderOffset,\n vb_WindowBorderSize = 4,\t\/\/ In vertices\n vb_PurpleQuadOffset = vb_WindowBorderOffset+vb_WindowBorderSize,\n vb_PurpleQuadSize = 4,\n vb_BrokenLineOffset = vb_PurpleQuadOffset+vb_PurpleQuadSize,\n vb_BrokenLineSize = 4,\n vb_TransparentStripOffset = vb_BrokenLineOffset+vb_BrokenLineSize,\n vb_TransparentStripSize = 4,\n vb_SkewQuadOffset = vb_TransparentStripOffset+vb_TransparentStripSize,\n vb_SkewQuadSize = 4,\n vb_FanOverlayOffset = vb_SkewQuadOffset + vb_SkewQuadSize,\n vb_FanOverlaySize = 4\n};\nenum {\n walk_SpriteW = 64,\n walk_SpriteH = walk_SpriteW,\n walk_StripUp = walk_SpriteH*0,\n walk_StripLeft = walk_SpriteH*1,\n walk_StripDown = walk_SpriteH*2,\n walk_StripRight = walk_SpriteH*3,\n walk_StripLength = walk_SpriteW*9\n};\n\n\/\/}}}-------------------------------------------------------------------\n\/\/{{{ Gradient shader\n\nstatic const char c_gradShader_v[] =\n\"#version 330 core\\n\"\n\"\\n\"\n\"uniform vec4 Color;\\n\"\n\"layout(location=0) in vec2 Vertex;\\n\"\n\"invariant out vec4 gl_Position;\\n\"\n\"invariant out vec4 f_color;\\n\"\n\"\\n\"\n\"void main() {\\n\"\n\" gl_Position = vec4(Vertex,1,1);\\n\"\n\" f_color = Color*vec4(1,1,1,gl_Position.x*-gl_Position.y);\\n\"\n\"}\";\n\nstatic const char c_gradShader_f[] =\n\"#version 330 core\\n\"\n\"\\n\"\n\"invariant in vec4 f_color;\\n\"\n\"invariant out vec4 gl_FragColor;\\n\"\n\"\\n\"\n\"void main() {\\n\"\n\" gl_FragColor = f_color;\\n\"\n\"}\";\n\n} \/\/ namespace\n\/\/}}}-------------------------------------------------------------------\n\nvoid CTestWindow::OnInit (void)\n{\n CWindow::OnInit();\n Open (640, 480);\n printf (\"Initializing test window\\n\");\n _vbuf = BufferData (_vdata1, sizeof(_vdata1));\n _walk = LoadTexture (\"test\/princess.png\");\n _gradShader = LoadShader (c_gradShader_v, c_gradShader_f);\n}\n\nvoid CTestWindow::OnResize (dim_t w, dim_t h)\n{\n CWindow::OnResize (w,h);\n printf (\"Test window OnResize\\n\");\n const coord_t sw = w-1, sh = h-1;\n const coord_t _vdata1[] = { sh, sw,sh, sw };\n BufferSubData (_vbuf, _vdata1, sizeof(_vdata1), 3*sizeof(int16_t));\n _wx = 0; _wy = (h-walk_SpriteH)\/2;\n _wsx = 0*walk_SpriteW; _wsy = walk_StripRight;\n WaitForTime (_wtimer = NowMS()+1000\/30);\n}\n\nvoid CTestWindow::OnKey (key_t key)\n{\n CWindow::OnKey (key);\n if (key == 'q' || key == Key::Escape) {\n\tprintf (\"Event received, quitting\\n\");\n\tCApp::Instance().Quit();\n } else if (key == Key::Up) {\n\tif (--_wy < 0)\n\t _wy = 0;\n\t_wsy = walk_StripUp;\n\t_wsx += walk_SpriteW;\n\tif (_wsx >= walk_StripLength)\n\t _wsx = 0;\n\tDraw();\n } else if (key == Key::Down) {\n\tif (++_wy > Info().h-walk_SpriteH)\n\t _wy = Info().h-walk_SpriteH;\n\t_wsy = walk_StripDown;\n\t_wsx += walk_SpriteW;\n\tif (_wsx >= walk_StripLength)\n\t _wsx = 0;\n\tDraw();\n } else if (key == Key::Left) {\n\tif (--_wx < 0)\n\t _wx = 0;\n\t_wsy = walk_StripLeft;\n\t_wsx += walk_SpriteW;\n\tif (_wsx >= walk_StripLength)\n\t _wsx = 0;\n\tDraw();\n } else if (key == Key::Right) {\n\tif (++_wx > Info().w-walk_SpriteW)\n\t _wx = Info().w-walk_SpriteW;\n\t_wsy = walk_StripRight;\n\t_wsx += walk_SpriteW;\n\tif (_wsx >= walk_StripLength)\n\t _wsx = 0;\n\tDraw();\n }\n}\n\nvoid CTestWindow::OnTimer (uint64_t tms)\n{\n CWindow::OnTimer (tms);\n if (tms != _wtimer)\n\treturn;\n\n if (++_wx > Info().w-walk_SpriteW)\n\t_wx = Info().w-walk_SpriteW;\n _wsy = walk_StripRight;\n _wsx += walk_SpriteW;\n if (_wsx >= walk_StripLength)\n\t_wsx = 0;\n Draw();\n\n WaitForTime (_wtimer += 1000\/30);\n}\n\nONDRAWIMPL(CTestWindow)::OnDraw (Drw& drw) const\n{\n CWindow::OnDraw (drw);\n\n drw.Clear (RGB(0,0,64));\n\n drw.VertexPointer (_vbuf);\n\n drw.Color (0,255,255);\n drw.LineLoop (vb_WindowBorderOffset, vb_WindowBorderSize);\n drw.Color (255,255,255);\n drw.LineStrip (vb_BrokenLineOffset, vb_BrokenLineSize);\n\n drw.Image (200, 75, _walk);\n drw.Offset (_wx, _wy);\n drw.Sprite (0, 0, _walk, _wsx, _wsy, walk_SpriteW, walk_SpriteH);\n drw.Offset (0, 0);\n\n drw.Color (ARGB(0xc0804040));\n drw.TriangleStrip (vb_TransparentStripOffset, vb_TransparentStripSize);\n drw.Color (128,170,170);\n drw.TriangleStrip (vb_SkewQuadOffset, vb_SkewQuadSize);\n\n drw.Color (0,240,255,128);\n drw.Text (300, 250, \"Hello world from OpenGL!\");\n\n drw.Color (255,255,255);\n drw.Text (300, 420, \"A quick brown fox jumps over the lazy dog\");\n uint32_t lrt = LastRenderTimeNS();\n drw.Textf (10,10, \"FPS %u\", 1000000000\/(lrt ? lrt : 1));\n\n drw.Color (128,90,150,220);\n drw.TriangleFan (vb_PurpleQuadOffset, vb_PurpleQuadSize);\n\n drw.Shader (_gradShader);\n drw.Color (0,128,128);\n drw.TriangleStrip (vb_FanOverlayOffset, vb_FanOverlaySize);\n drw.DefaultShader();\n}\n<commit_msg>Have timer follow vsync closer<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 \"twin.h\"\n\n\/\/{{{ Vertex data ------------------------------------------------------\nnamespace {\n\nstatic const CTestWindow::coord_t _vdata1[] = {\n 0,0, 0,479, 639,479, 639,0,\n 50,50, 50,300, 150,300, 150,50,\n 100,100, 200,200, 300,200, 300,300,\n 250,250, 250,400, 350,250, 500,450,\n 250,50, 300,100, 300,50, 350,75,\n 0,0, 0,-1, 1,0, 1,-1\n};\nenum {\n vb_WindowBorderOffset,\n vb_WindowBorderSize = 4,\t\/\/ In vertices\n vb_PurpleQuadOffset = vb_WindowBorderOffset+vb_WindowBorderSize,\n vb_PurpleQuadSize = 4,\n vb_BrokenLineOffset = vb_PurpleQuadOffset+vb_PurpleQuadSize,\n vb_BrokenLineSize = 4,\n vb_TransparentStripOffset = vb_BrokenLineOffset+vb_BrokenLineSize,\n vb_TransparentStripSize = 4,\n vb_SkewQuadOffset = vb_TransparentStripOffset+vb_TransparentStripSize,\n vb_SkewQuadSize = 4,\n vb_FanOverlayOffset = vb_SkewQuadOffset + vb_SkewQuadSize,\n vb_FanOverlaySize = 4\n};\nenum {\n walk_SpriteW = 64,\n walk_SpriteH = walk_SpriteW,\n walk_StripUp = walk_SpriteH*0,\n walk_StripLeft = walk_SpriteH*1,\n walk_StripDown = walk_SpriteH*2,\n walk_StripRight = walk_SpriteH*3,\n walk_StripLength = walk_SpriteW*9\n};\n\n\/\/}}}-------------------------------------------------------------------\n\/\/{{{ Gradient shader\n\nstatic const char c_gradShader_v[] =\n\"#version 330 core\\n\"\n\"\\n\"\n\"uniform vec4 Color;\\n\"\n\"layout(location=0) in vec2 Vertex;\\n\"\n\"invariant out vec4 gl_Position;\\n\"\n\"invariant out vec4 f_color;\\n\"\n\"\\n\"\n\"void main() {\\n\"\n\" gl_Position = vec4(Vertex,1,1);\\n\"\n\" f_color = Color*vec4(1,1,1,gl_Position.x*-gl_Position.y);\\n\"\n\"}\";\n\nstatic const char c_gradShader_f[] =\n\"#version 330 core\\n\"\n\"\\n\"\n\"invariant in vec4 f_color;\\n\"\n\"invariant out vec4 gl_FragColor;\\n\"\n\"\\n\"\n\"void main() {\\n\"\n\" gl_FragColor = f_color;\\n\"\n\"}\";\n\n} \/\/ namespace\n\/\/}}}-------------------------------------------------------------------\n\nvoid CTestWindow::OnInit (void)\n{\n CWindow::OnInit();\n Open (640, 480);\n printf (\"Initializing test window\\n\");\n _vbuf = BufferData (_vdata1, sizeof(_vdata1));\n _walk = LoadTexture (\"test\/princess.png\");\n _gradShader = LoadShader (c_gradShader_v, c_gradShader_f);\n}\n\nvoid CTestWindow::OnResize (dim_t w, dim_t h)\n{\n CWindow::OnResize (w,h);\n printf (\"Test window OnResize\\n\");\n const coord_t sw = w-1, sh = h-1;\n const coord_t _vdata1[] = { sh, sw,sh, sw };\n BufferSubData (_vbuf, _vdata1, sizeof(_vdata1), 3*sizeof(int16_t));\n _wx = 0; _wy = (h-walk_SpriteH)\/2;\n _wsx = 0*walk_SpriteW; _wsy = walk_StripRight;\n WaitForTime (_wtimer = NowMS()+1000\/30);\n}\n\nvoid CTestWindow::OnKey (key_t key)\n{\n CWindow::OnKey (key);\n if (key == 'q' || key == Key::Escape) {\n\tprintf (\"Event received, quitting\\n\");\n\tCApp::Instance().Quit();\n } else if (key == Key::Up) {\n\tif (--_wy < 0)\n\t _wy = 0;\n\t_wsy = walk_StripUp;\n\t_wsx += walk_SpriteW;\n\tif (_wsx >= walk_StripLength)\n\t _wsx = 0;\n\tDraw();\n } else if (key == Key::Down) {\n\tif (++_wy > Info().h-walk_SpriteH)\n\t _wy = Info().h-walk_SpriteH;\n\t_wsy = walk_StripDown;\n\t_wsx += walk_SpriteW;\n\tif (_wsx >= walk_StripLength)\n\t _wsx = 0;\n\tDraw();\n } else if (key == Key::Left) {\n\tif (--_wx < 0)\n\t _wx = 0;\n\t_wsy = walk_StripLeft;\n\t_wsx += walk_SpriteW;\n\tif (_wsx >= walk_StripLength)\n\t _wsx = 0;\n\tDraw();\n } else if (key == Key::Right) {\n\tif (++_wx > Info().w-walk_SpriteW)\n\t _wx = Info().w-walk_SpriteW;\n\t_wsy = walk_StripRight;\n\t_wsx += walk_SpriteW;\n\tif (_wsx >= walk_StripLength)\n\t _wsx = 0;\n\tDraw();\n }\n}\n\nvoid CTestWindow::OnTimer (uint64_t tms)\n{\n CWindow::OnTimer (tms);\n if (tms != _wtimer)\n\treturn;\n\n if (++_wx >= Info().w)\n\t_wx = -walk_SpriteW;\n _wsy = walk_StripRight;\n _wsx += walk_SpriteW;\n if (_wsx >= walk_StripLength)\n\t_wsx = 0;\n Draw();\n\n uint32_t wt = 1000\/60;\n if (RefreshTimeNS())\n\twt = RefreshTimeNS()\/1000000;\n WaitForTime (_wtimer += wt);\n}\n\nONDRAWIMPL(CTestWindow)::OnDraw (Drw& drw) const\n{\n CWindow::OnDraw (drw);\n\n drw.Clear (RGB(0,0,64));\n\n drw.VertexPointer (_vbuf);\n\n drw.Color (0,255,255);\n drw.LineLoop (vb_WindowBorderOffset, vb_WindowBorderSize);\n drw.Color (255,255,255);\n drw.LineStrip (vb_BrokenLineOffset, vb_BrokenLineSize);\n\n drw.Image (200, 75, _walk);\n drw.Offset (_wx, _wy);\n drw.Sprite (0, 0, _walk, _wsx, _wsy, walk_SpriteW, walk_SpriteH);\n drw.Offset (0, 0);\n\n drw.Color (ARGB(0xc0804040));\n drw.TriangleStrip (vb_TransparentStripOffset, vb_TransparentStripSize);\n drw.Color (128,170,170);\n drw.TriangleStrip (vb_SkewQuadOffset, vb_SkewQuadSize);\n\n drw.Color (0,240,255,128);\n drw.Text (300, 250, \"Hello world from OpenGL!\");\n\n drw.Color (255,255,255);\n drw.Text (300, 420, \"A quick brown fox jumps over the lazy dog\");\n uint32_t lrt = LastRenderTimeNS();\n uint32_t lft = RefreshTimeNS();\n drw.Textf (10,10, \"FPS %u, VSync %u\", 1000000000\/(lrt?lrt:1), 1000000000\/(lft?lft:1));\n\n drw.Color (128,90,150,220);\n drw.TriangleFan (vb_PurpleQuadOffset, vb_PurpleQuadSize);\n\n drw.Shader (_gradShader);\n drw.Color (0,128,128);\n drw.TriangleStrip (vb_FanOverlayOffset, vb_FanOverlaySize);\n drw.DefaultShader();\n}\n<|endoftext|>"} {"text":"<commit_before>#include <iostream>\n#include <sstream>\n#include <iomanip>\n#include \"Usb\/SetupPacket.hpp\"\n#include \"Usb\/Endpoint.hpp\"\n#include \"USB\/Packet.hpp\"\n#include \"USB\/Device.hpp\"\n#include \"USB\/Memory.hpp\"\n\n\nusing PacketT = Kvasir::Usb::Packet <Kvasir::Usb::CompactPacket::ImplType>;\nusing Alloc = Kvasir::Usb::CompactPacket::Allocator<PacketT,12>;\nusing Device = Kvasir::Usb::Device<Alloc, Kvasir::Usb::CompactPacket::Queue<PacketT>, Kvasir::Usb::CompactPacket::Transfer<PacketT, Alloc>>;\n\nint usbTest()\n{\n\tAlloc::initialize();\n\t{\n\t\tauto packet = Alloc::allocate();\n\t\t\/\/set address\n\t\tfor (auto d : { 0, 5, 5, 0, 0, 0, 0, 0 }) {\n\t\t\tpacket.pushBack(d);\n\t\t}\n\t\tauto cmd = Device::onSetupPacket(std::move(packet));\n\t\tif (cmd.type_ != Device::HalCommand::Type::setAddress) {\n\t\t\treturn 1;\n\t\t}\n\t\tif (cmd.packet_.getSize() != 0) {\n\t\t\treturn 1;\n\t\t}\n\t\tauto cmd2 = Device::onControlIn(std::move(cmd.packet_));\n\t\tif (cmd2.type_ != Device::HalCommand::Type::noAction) {\n\t\t\treturn 1;\n\t\t}\n\t\tif (cmd2.packet_) {\n\t\t\treturn 1;\n\t\t}\n\t}\n\t{\n\t\t\/\/GetDevice descriptor\n\t\tauto packet = Alloc::allocate();\n\t\tfor (auto d : { 0x80, 6, 0, 1, 0, 0, 8, 0 }) {\n\t\t\tpacket.pushBack(d);\n\t\t}\n\t\tauto cmd = Device::onSetupPacket(std::move(packet));\n\t\tif (cmd.type_ != Device::HalCommand::Type::noAction) {\n\t\t\treturn 1;\n\t\t}\n\t\tif (cmd.packet_.getSize() != 8) {\n\t\t\treturn 1;\n\t\t}\n\t\tauto cmd2 = Device::onControlIn(std::move(cmd.packet_));\n\t\tif (cmd2.type_ != Device::HalCommand::Type::noAction) {\n\t\t\treturn 1;\n\t\t}\n\t\tif (cmd2.packet_) {\n\t\t\treturn 1;\n\t\t}\n\t}\n\t{\n\t\t\/\/GetDevice descriptor\n\t\tauto packet = Alloc::allocate();\n\t\tfor (auto d : { 0x80, 0x06, 0x00, 0x01, 0x00, 0x00, 0x12, 0x00 }) {\n\t\t\tpacket.pushBack(d);\n\t\t}\n\t\tauto cmd = Device::onSetupPacket(std::move(packet));\n\t\tif (cmd.type_ != Device::HalCommand::Type::noAction) {\n\t\t\treturn 1;\n\t\t}\n\t\tif (cmd.packet_.getSize() != 18) {\n\t\t\treturn 1;\n\t\t}\n\t\tauto cmd2 = Device::onControlIn(std::move(cmd.packet_));\n\t\tif (cmd2.type_ != Device::HalCommand::Type::noAction) {\n\t\t\treturn 1;\n\t\t}\n\t\tif (cmd2.packet_) {\n\t\t\treturn 1;\n\t\t}\n\t}\n\t{\n\t\t\/\/Get Configuration descriptor\n\t\tauto packet = Alloc::allocate();\n\t\tfor (auto d : { 0x80, 0x06, 0x00, 0x02, 0x00, 0x00, 0x09, 0x00 }) {\n\t\t\tpacket.pushBack(d);\n\t\t}\n\t\tauto cmd = Device::onSetupPacket(std::move(packet));\n\t\tif (cmd.type_ != Device::HalCommand::Type::noAction) {\n\t\t\treturn 1;\n\t\t}\n\t\tif (cmd.packet_.getSize() != 9) {\n\t\t\treturn 1;\n\t\t}\n\t\tauto cmd2 = Device::onControlIn(std::move(cmd.packet_));\n\t\tif (cmd2.type_ != Device::HalCommand::Type::noAction) {\n\t\t\treturn 1;\n\t\t}\n\t\tif (cmd2.packet_) {\n\t\t\treturn 1;\n\t\t}\n\t}\n\t{\n\t\t\/\/Get Configuration descriptor\n\t\tauto packet = Alloc::allocate();\n\t\tfor (auto d : { 0x80, 0x06, 0x00, 0x02, 0x00, 0x00, 0x4B, 0x00 }) {\n\t\t\tpacket.pushBack(d);\n\t\t}\n\t\tauto cmd = Device::onSetupPacket(std::move(packet));\n\t\tif (cmd.type_ != Device::HalCommand::Type::noAction) {\n\t\t\treturn 1;\n\t\t}\n\t\tif (cmd.packet_.getSize() != 64) {\n\t\t\treturn 1;\n\t\t}\n\t\tif (cmd.packet_[0] != 9) {\n\t\t\treturn 1;\n\t\t}\n\t\tauto cmd2 = Device::onControlIn(std::move(cmd.packet_));\n\t\tif (cmd2.type_ != Device::HalCommand::Type::noAction) {\n\t\t\treturn 1;\n\t\t}\n\t\tif (cmd2.packet_.getSize() != 11) {\n\t\t\treturn 1;\n\t\t}\n\t\tif (cmd2.packet_[2] != 2) {\n\t\t\treturn 1;\n\t\t}\n\t\tauto cmd3 = Device::onControlIn(std::move(cmd2.packet_));\n\t\tif (cmd3.type_ != Device::HalCommand::Type::noAction) {\n\t\t\treturn 1;\n\t\t}\n\t\tif (cmd3.packet_) {\n\t\t\treturn 1;\n\t\t}\n\t}\n\treturn 0;\n}\n\n<commit_msg>added usb unit tests<commit_after>#include <iostream>\n#include <sstream>\n#include <iomanip>\n#include \"Usb\/SetupPacket.hpp\"\n#include \"Usb\/Endpoint.hpp\"\n#include \"USB\/Packet.hpp\"\n#include \"USB\/Device.hpp\"\n#include \"USB\/Memory.hpp\"\n\n\nusing PacketT = Kvasir::Usb::Packet <Kvasir::Usb::CompactPacket::ImplType>;\nusing Alloc = Kvasir::Usb::CompactPacket::Allocator<PacketT,12>;\nusing Device = Kvasir::Usb::Device<Alloc, Kvasir::Usb::CompactPacket::Queue<PacketT>, Kvasir::Usb::CompactPacket::Transfer<PacketT, Alloc>>;\n\ntemplate<typename T>\ndecltype(Alloc::allocate()) makePacket(std::initializer_list<T> l) {\n\tauto packet = Alloc::allocate();\n\tfor (auto d : l) {\n\t\tpacket.pushBack(d);\n\t}\n\treturn packet;\n}\n\n\nint usbTest()\n{\n\tAlloc::initialize();\n\t{\n\t\t\/\/set address\n\t\tauto cmd = Device::onSetupPacket(makePacket({ 0, 5, 5, 0, 0, 0, 0, 0 }));\n\t\tif (cmd.type_ != Device::HalCommand::Type::setAddress) {\n\t\t\treturn 1;\n\t\t}\n\t\tif (cmd.packet_.getSize() != 0) {\n\t\t\treturn 1;\n\t\t}\n\t\tauto cmd2 = Device::onControlIn(std::move(cmd.packet_));\n\t\tif (cmd2.type_ != Device::HalCommand::Type::noAction) {\n\t\t\treturn 1;\n\t\t}\n\t\tif (cmd2.packet_) {\n\t\t\treturn 1;\n\t\t}\n\t}\n\t{\n\t\t\/\/GetDevice descriptor\n\t\tauto cmd = Device::onSetupPacket(makePacket({ 0x80, 6, 0, 1, 0, 0, 8, 0 }));\n\t\tif (cmd.type_ != Device::HalCommand::Type::noAction) {\n\t\t\treturn 1;\n\t\t}\n\t\tif (cmd.packet_.getSize() != 8) {\n\t\t\treturn 1;\n\t\t}\n\t\tauto cmd2 = Device::onControlIn(std::move(cmd.packet_));\n\t\tif (cmd2.type_ != Device::HalCommand::Type::noAction) {\n\t\t\treturn 1;\n\t\t}\n\t\tif (cmd2.packet_) {\n\t\t\treturn 1;\n\t\t}\n\t}\n\t{\n\t\t\/\/GetDevice descriptor\n\t\tauto cmd = Device::onSetupPacket(makePacket({ 0x80, 0x06, 0x00, 0x01, 0x00, 0x00, 0x12, 0x00 }));\n\t\tif (cmd.type_ != Device::HalCommand::Type::noAction) {\n\t\t\treturn 1;\n\t\t}\n\t\tif (cmd.packet_.getSize() != 18) {\n\t\t\treturn 1;\n\t\t}\n\t\tauto cmd2 = Device::onControlIn(std::move(cmd.packet_));\n\t\tif (cmd2.type_ != Device::HalCommand::Type::noAction) {\n\t\t\treturn 1;\n\t\t}\n\t\tif (cmd2.packet_) {\n\t\t\treturn 1;\n\t\t}\n\t}\n\t{\n\t\t\/\/Get Configuration descriptor\n\t\tauto cmd = Device::onSetupPacket(makePacket({ 0x80, 0x06, 0x00, 0x02, 0x00, 0x00, 0x09, 0x00 }));\n\t\tif (cmd.type_ != Device::HalCommand::Type::noAction) {\n\t\t\treturn 1;\n\t\t}\n\t\tif (cmd.packet_.getSize() != 9) {\n\t\t\treturn 1;\n\t\t}\n\t\tauto cmd2 = Device::onControlIn(std::move(cmd.packet_));\n\t\tif (cmd2.type_ != Device::HalCommand::Type::noAction) {\n\t\t\treturn 1;\n\t\t}\n\t\tif (cmd2.packet_) {\n\t\t\treturn 1;\n\t\t}\n\t}\n\t{\n\t\t\/\/Get Configuration descriptor\n\t\tauto cmd = Device::onSetupPacket(makePacket({ 0x80, 0x06, 0x00, 0x02, 0x00, 0x00, 0x4B, 0x00 }));\n\t\tif (cmd.type_ != Device::HalCommand::Type::noAction) {\n\t\t\treturn 1;\n\t\t}\n\t\tif (cmd.packet_.getSize() != 64) {\n\t\t\treturn 1;\n\t\t}\n\t\tif (cmd.packet_[0] != 9) {\n\t\t\treturn 1;\n\t\t}\n\t\tauto cmd2 = Device::onControlIn(std::move(cmd.packet_));\n\t\tif (cmd2.type_ != Device::HalCommand::Type::noAction) {\n\t\t\treturn 1;\n\t\t}\n\t\tif (cmd2.packet_.getSize() != 11) {\n\t\t\treturn 1;\n\t\t}\n\t\tif (cmd2.packet_[0] != 2) {\n\t\t\treturn 1;\n\t\t}\n\t\tauto cmd3 = Device::onControlIn(std::move(cmd2.packet_));\n\t\tif (cmd3.type_ != Device::HalCommand::Type::noAction) {\n\t\t\treturn 1;\n\t\t}\n\t\tif (cmd3.packet_) {\n\t\t\treturn 1;\n\t\t}\n\t}\n\t{\n\t\t\/\/Get String descriptor\n\t\tauto cmd = Device::onSetupPacket(makePacket({ 0x80, 0x06, 0x00, 0x03, 0x00, 0x00, 0xFF, 0x00 }));\n\t\tif (cmd.type_ != Device::HalCommand::Type::noAction) {\n\t\t\treturn 1;\n\t\t}\n\t\tif (cmd.packet_.getSize() != 4) {\n\t\t\treturn 1;\n\t\t}\n\t\tif (cmd.packet_[0] != 4) {\n\t\t\treturn 1;\n\t\t}\n\t\tauto cmd2 = Device::onControlIn(std::move(cmd.packet_));\n\t\tif (cmd2.type_ != Device::HalCommand::Type::noAction) {\n\t\t\treturn 1;\n\t\t}\n\t\tif (cmd2.packet_) {\n\t\t\treturn 1;\n\t\t}\n\t}\n\t{\n\t\t\/\/Get String descriptor\n\t\tauto cmd = Device::onSetupPacket(makePacket({ 0x80, 0x06, 0x02, 0x03, 0x09, 0x04, 0xFF, 0x00 }));\n\t\tif (cmd.type_ != Device::HalCommand::Type::noAction) {\n\t\t\treturn 1;\n\t\t}\n\t\tif (cmd.packet_.getSize() != 22) {\n\t\t\treturn 1;\n\t\t}\n\t\tif (cmd.packet_[0] != 0x16) {\n\t\t\treturn 1;\n\t\t}\n\t\tauto cmd2 = Device::onControlIn(std::move(cmd.packet_));\n\t\tif (cmd2.type_ != Device::HalCommand::Type::noAction) {\n\t\t\treturn 1;\n\t\t}\n\t\tif (cmd2.packet_) {\n\t\t\treturn 1;\n\t\t}\n\t}\n\t{\n\t\t\/\/Get String descriptor\n\t\tauto cmd = Device::onSetupPacket(makePacket({ 0x80, 0x06, 0x03, 0x03, 0x09, 0x04, 0xFF, 0x00 }));\n\t\tif (cmd.type_ != Device::HalCommand::Type::noAction) {\n\t\t\treturn 1;\n\t\t}\n\t\tif (cmd.packet_.getSize() != 22) {\n\t\t\treturn 1;\n\t\t}\n\t\tif (cmd.packet_[0] != 0x16) {\n\t\t\treturn 1;\n\t\t}\n\t\tauto cmd2 = Device::onControlIn(std::move(cmd.packet_));\n\t\tif (cmd2.type_ != Device::HalCommand::Type::noAction) {\n\t\t\treturn 1;\n\t\t}\n\t\tif (cmd2.packet_) {\n\t\t\treturn 1;\n\t\t}\n\t}\n\t{\n\t\t\/\/GetDevice descriptor\n\t\tauto cmd = Device::onSetupPacket(makePacket({ 0x80, 0x06, 0x00, 0x01, 0x00, 0x00, 0x12, 0x00 }));\n\t\tif (cmd.type_ != Device::HalCommand::Type::noAction) {\n\t\t\treturn 1;\n\t\t}\n\t\tif (cmd.packet_.getSize() != 18) {\n\t\t\treturn 1;\n\t\t}\n\t\tauto cmd2 = Device::onControlIn(std::move(cmd.packet_));\n\t\tif (cmd2.type_ != Device::HalCommand::Type::noAction) {\n\t\t\treturn 1;\n\t\t}\n\t\tif (cmd2.packet_) {\n\t\t\treturn 1;\n\t\t}\n\t}\n\t{\n\t\t\/\/Get Configuration descriptor\n\t\tauto cmd = Device::onSetupPacket(makePacket({ 0x80, 0x06, 0x00, 0x02, 0x00, 0x00, 0x09, 0x01 }));\n\t\tif (cmd.type_ != Device::HalCommand::Type::noAction) {\n\t\t\treturn 1;\n\t\t}\n\t\tif (cmd.packet_.getSize() != 64) {\n\t\t\treturn 1;\n\t\t}\n\t\tif (cmd.packet_[0] != 9) {\n\t\t\treturn 1;\n\t\t}\n\t\tauto cmd2 = Device::onControlIn(std::move(cmd.packet_));\n\t\tif (cmd2.type_ != Device::HalCommand::Type::noAction) {\n\t\t\treturn 1;\n\t\t}\n\t\tif (cmd2.packet_.getSize() != 11) {\n\t\t\treturn 1;\n\t\t}\n\t\tif (cmd2.packet_[0] != 2) {\n\t\t\treturn 1;\n\t\t}\n\t\tauto cmd3 = Device::onControlIn(std::move(cmd2.packet_));\n\t\tif (cmd3.type_ != Device::HalCommand::Type::noAction) {\n\t\t\treturn 1;\n\t\t}\n\t\tif (cmd3.packet_) {\n\t\t\treturn 1;\n\t\t}\n\t}\n\treturn 0;\n}\n\n<|endoftext|>"} {"text":"<commit_before>\/\/ Author: Mihai Niculescu 2013\n\n\/**************************************************************************\n * Copyright(c) 1998-2013, ALICE Experiment at CERN, all rights reserved. *\n * See http:\/\/aliceinfo.cern.ch\/Offline\/AliRoot\/License.html for *\n * full copyright notice. *\n **************************************************************************\/\n\n#include <stdlib.h>\n\n#include <zmq.hpp>\n\n#include <TCondition.h>\n#include <TBufferFile.h>\n#include <TMessage.h>\n#include <TObjArray.h>\n#include <TStreamerInfo.h>\n#include <TThread.h>\n\n\n#include <AliESDEvent.h>\n#include <AliESDfriend.h>\n#include <AliRawReader.h>\n#include <AliRunLoader.h>\n#include <AliReconstruction.h>\n\n#include \"AliRecoServerThread.h\"\n\nClassImp(AliRecoServerThread);\nAliRecoServerThread::AliRecoServerThread(zmq::context_t *context, AliReconstruction* reco)\n : TQObject(),\n\t\tfContext(0),\n \tfReco(0),\n \tfHost(\"tcp:\/\/*:5051\"),\n fThread(0),\n fCond(0)\n{\n\tfContext = context;\n\tfReco = reco;\n}\n\nAliRecoServerThread::~AliRecoServerThread()\n{\n\tStop();\n}\n\nBool_t AliRecoServerThread::Start(const char* host)\n{\n\tif(!fThread){\n \tfHost = host;\n \tfCond = new TCondition(0);\n \tfThread = new TThread(\"AliRecoServerThread\", (void(*) (void *) ) &RunThreaded, (void*) this );\n \tfThread->Run();\n \n \treturn kTRUE;\n\t}\n\t\n\treturn kFALSE;\t\n}\n\nInt_t AliRecoServerThread::Stop()\n{\n\tfCond->Signal();\n \n return 0;\n}\n\nBool_t AliRecoServerThread::ForceStop()\n{\n\tif(fThread){\n\t\tfThread->Kill();\n\t\tfThread->Delete();\n\t\tfThread=0;\n\t\t\n\t\treturn kTRUE;\n\t}\n\t\n\treturn kFALSE;\n}\n\nvoid AliRecoServerThread::Finished(Int_t status)\n{\n Emit(\"Finished(Int_t)\", status);\n}\n\nvoid AliRecoServerThread::SendStreamerInfos(TMessage* mess, zmq::socket_t *sock)\n{\n\t\/\/printf(\"Sending Streamer Infos....\\n\");\n\n\t\/\/ Check if TStreamerInfo must be sent. The list of TStreamerInfo of classes\n \/\/ in the object in the message is in the fInfos list of the message.\n \/\/ We send only the TStreamerInfos not yet sent on this socket.\n\tTList* infos = mess->GetStreamerInfos();\n \n TIter next(infos);\n TStreamerInfo *info;\n TList *minilist = 0;\n while ((info = (TStreamerInfo*)next())) {\n Int_t uid = info->GetNumber();\n if (!minilist) minilist = new TList();\n \n minilist->Add(info);\n }\n \n if (minilist) {\n TMessage messinfo(kMESS_STREAMERINFO);\n messinfo.WriteObject(minilist);\n delete minilist;\n if (messinfo.GetStreamerInfos())\n messinfo.GetStreamerInfos()->Clear();\n \n messinfo.SetLength();\n \n int bufsize = messinfo.Length();\n \tchar* buf = (char*) malloc(bufsize * sizeof(char));\n memcpy(buf, messinfo.Buffer(), bufsize);\n\n \t\/\/ send!\n zmq::message_t message((void*)buf, bufsize, 0, 0);\n \n if (sock->send(message, ZMQ_SNDMORE))\n Warning(\"SendStreamerInfos\", \"problems sending TStreamerInfo's ...\");\n }\n\n return;\n}\n\nvoid AliRecoServerThread::SendEvent(AliESDEvent* event, zmq::socket_t* socket)\n{\n if(!event) return;\n\n TMessage tmess(kMESS_OBJECT);\n tmess.Reset();\n tmess.WriteObject(event);\n\n TMessage::EnableSchemaEvolutionForAll(kTRUE);\n SendStreamerInfos(&tmess, socket);\n\n tmess.SetLength();\n\n int bufsize = tmess.Length();\n char* buf = (char*) malloc(bufsize * sizeof(char));\n memcpy(buf, tmess.Buffer(), bufsize);\n\n \/\/ send!\n zmq::message_t message((void*)buf, bufsize, 0, 0);\n socket->send(message);\n\n}\n\n\nvoid* AliRecoServerThread::RunThreaded(void* arg)\n{\n\tTThread::SetCancelAsynchronous();\n\tTThread::SetCancelOn();\n\t\n\tAliRecoServerThread* recoTh = (AliRecoServerThread*)arg;\n\t\n\tconst char* host = recoTh->GetHost();\n\tzmq::context_t* context = recoTh->GetContext();\n\tAliReconstruction* reco = recoTh->GetReconstruction();\n\n\tzmq::socket_t publisher(*context, ZMQ_PUB);\n\tpublisher.bind(host);\n\t\n if(reco==0) return 0;\n \n AliESDEvent* event;\n \n\treco->Begin(NULL);\n if (reco->GetAbort() != TSelector::kContinue) return 0;\n \n reco->SlaveBegin(NULL);\n\tif (reco->GetAbort() != TSelector::kContinue) return 0;\n \n \/\/******* The loop over events\n Int_t iEvent = 0;\n while ( reco->HasNextEventAfter(iEvent) ) {\n \/\/ check if process has enough resources \n if (!reco->HasEnoughResources(iEvent)) break;\n Bool_t status = reco->ProcessEvent(iEvent);\n \n if (status)\n {\n\t\t\t\tevent = reco->GetESDEvent();\n\t\t\t\tSendEvent(event, &publisher);\n\n \t\t\tsleep(1);\n }\n else {\n reco->Abort(\"ProcessEvent\",TSelector::kAbortFile);\n }\n \t\t\n reco->CleanProcessedEvent();\n if(recoTh->Condition()->TimedWaitRelative(500)==0){\n\t\t\t\tbreak;\n\t\t\t}\t\t\t\n iEvent++;\n }\n reco->SlaveTerminate();\n if (reco->GetAbort() != TSelector::kContinue) return 0;\n reco->Terminate();\n if (reco->GetAbort() != TSelector::kContinue) return 0;\n \n}\n<commit_msg>Compilation with Root6<commit_after>\/\/ Author: Mihai Niculescu 2013\n\n\/**************************************************************************\n * Copyright(c) 1998-2013, ALICE Experiment at CERN, all rights reserved. *\n * See http:\/\/aliceinfo.cern.ch\/Offline\/AliRoot\/License.html for *\n * full copyright notice. *\n **************************************************************************\/\n\n#include <RVersion.h>\n#include <stdlib.h>\n\n#include <zmq.hpp>\n\n#include <TCondition.h>\n#include <TBufferFile.h>\n#include <TMessage.h>\n#include <TObjArray.h>\n#include <TStreamerInfo.h>\n#include <TThread.h>\n\n\n#include <AliESDEvent.h>\n#include <AliESDfriend.h>\n#include <AliRawReader.h>\n#include <AliRunLoader.h>\n#include <AliReconstruction.h>\n\n#include \"AliRecoServerThread.h\"\n\nClassImp(AliRecoServerThread);\nAliRecoServerThread::AliRecoServerThread(zmq::context_t *context, AliReconstruction* reco)\n : TQObject(),\n\t\tfContext(0),\n \tfReco(0),\n \tfHost(\"tcp:\/\/*:5051\"),\n fThread(0),\n fCond(0)\n{\n\tfContext = context;\n\tfReco = reco;\n}\n\nAliRecoServerThread::~AliRecoServerThread()\n{\n\tStop();\n}\n\nBool_t AliRecoServerThread::Start(const char* host)\n{\n\tif(!fThread){\n \tfHost = host;\n \tfCond = new TCondition(0);\n \tfThread = new TThread(\"AliRecoServerThread\", (void(*) (void *) ) &RunThreaded, (void*) this );\n \tfThread->Run();\n \n \treturn kTRUE;\n\t}\n\t\n\treturn kFALSE;\t\n}\n\nInt_t AliRecoServerThread::Stop()\n{\n\tfCond->Signal();\n \n return 0;\n}\n\nBool_t AliRecoServerThread::ForceStop()\n{\n\tif(fThread){\n\t\tfThread->Kill();\n\t\tfThread->Delete();\n\t\tfThread=0;\n\t\t\n\t\treturn kTRUE;\n\t}\n\t\n\treturn kFALSE;\n}\n\nvoid AliRecoServerThread::Finished(Int_t status)\n{\n Emit(\"Finished(Int_t)\", status);\n}\n\nvoid AliRecoServerThread::SendStreamerInfos(TMessage* mess, zmq::socket_t *sock)\n{\n\t\/\/printf(\"Sending Streamer Infos....\\n\");\n\n\t\/\/ Check if TStreamerInfo must be sent. The list of TStreamerInfo of classes\n \/\/ in the object in the message is in the fInfos list of the message.\n \/\/ We send only the TStreamerInfos not yet sent on this socket.\n\tTList* infos = mess->GetStreamerInfos();\n \n TIter next(infos);\n TStreamerInfo *info;\n TList *minilist = 0;\n while ((info = (TStreamerInfo*)next())) {\n Int_t uid = info->GetNumber();\n if (!minilist) minilist = new TList();\n \n minilist->Add(info);\n }\n \n if (minilist) {\n TMessage messinfo(kMESS_STREAMERINFO);\n messinfo.WriteObject(minilist);\n delete minilist;\n if (messinfo.GetStreamerInfos())\n messinfo.GetStreamerInfos()->Clear();\n#if ROOT_VERSION_CODE < ROOT_VERSION(5,99,0) \n messinfo.SetLength();\n#endif\n \n int bufsize = messinfo.Length();\n \tchar* buf = (char*) malloc(bufsize * sizeof(char));\n memcpy(buf, messinfo.Buffer(), bufsize);\n\n \t\/\/ send!\n zmq::message_t message((void*)buf, bufsize, 0, 0);\n \n if (sock->send(message, ZMQ_SNDMORE))\n Warning(\"SendStreamerInfos\", \"problems sending TStreamerInfo's ...\");\n }\n\n return;\n}\n\nvoid AliRecoServerThread::SendEvent(AliESDEvent* event, zmq::socket_t* socket)\n{\n if(!event) return;\n\n TMessage tmess(kMESS_OBJECT);\n tmess.Reset();\n tmess.WriteObject(event);\n\n TMessage::EnableSchemaEvolutionForAll(kTRUE);\n SendStreamerInfos(&tmess, socket);\n\n#if ROOT_VERSION_CODE < ROOT_VERSION(5,99,0) \n tmess.SetLength();\n#endif\n int bufsize = tmess.Length();\n char* buf = (char*) malloc(bufsize * sizeof(char));\n memcpy(buf, tmess.Buffer(), bufsize);\n\n \/\/ send!\n zmq::message_t message((void*)buf, bufsize, 0, 0);\n socket->send(message);\n\n}\n\n\nvoid* AliRecoServerThread::RunThreaded(void* arg)\n{\n\tTThread::SetCancelAsynchronous();\n\tTThread::SetCancelOn();\n\t\n\tAliRecoServerThread* recoTh = (AliRecoServerThread*)arg;\n\t\n\tconst char* host = recoTh->GetHost();\n\tzmq::context_t* context = recoTh->GetContext();\n\tAliReconstruction* reco = recoTh->GetReconstruction();\n\n\tzmq::socket_t publisher(*context, ZMQ_PUB);\n\tpublisher.bind(host);\n\t\n if(reco==0) return 0;\n \n AliESDEvent* event;\n \n\treco->Begin(NULL);\n if (reco->GetAbort() != TSelector::kContinue) return 0;\n \n reco->SlaveBegin(NULL);\n\tif (reco->GetAbort() != TSelector::kContinue) return 0;\n \n \/\/******* The loop over events\n Int_t iEvent = 0;\n while ( reco->HasNextEventAfter(iEvent) ) {\n \/\/ check if process has enough resources \n if (!reco->HasEnoughResources(iEvent)) break;\n Bool_t status = reco->ProcessEvent(iEvent);\n \n if (status)\n {\n\t\t\t\tevent = reco->GetESDEvent();\n\t\t\t\tSendEvent(event, &publisher);\n\n \t\t\tsleep(1);\n }\n else {\n reco->Abort(\"ProcessEvent\",TSelector::kAbortFile);\n }\n \t\t\n reco->CleanProcessedEvent();\n if(recoTh->Condition()->TimedWaitRelative(500)==0){\n\t\t\t\tbreak;\n\t\t\t}\t\t\t\n iEvent++;\n }\n reco->SlaveTerminate();\n if (reco->GetAbort() != TSelector::kContinue) return 0;\n reco->Terminate();\n if (reco->GetAbort() != TSelector::kContinue) return 0;\n \n}\n<|endoftext|>"} {"text":"<commit_before>\n\/\/ NetherFortGen.cpp\n\n\/\/ Implements the cNetherFortGen class representing the nether fortress generator\n\n#include \"Globals.h\"\n#include \"NetherFortGen.h\"\n#include \"Prefabs\/NetherFortPrefabs.h\"\n\n\n\n\n\nstatic const int NEIGHBORHOOD_SIZE = 3;\n\n\n\n\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ cNetherFortGen::cNetherFort:\n\nclass cNetherFortGen::cNetherFort :\n\tpublic cGridStructGen::cStructure\n{\n\ttypedef cGridStructGen::cStructure super;\n\t\npublic:\n\tcNetherFortGen & m_ParentGen;\n\tint m_GridSize;\n\tint m_Seed;\n\tcPlacedPieces m_Pieces;\n\n\n\tcNetherFort(cNetherFortGen & a_ParentGen, int a_OriginX, int a_OriginZ, int a_GridSize, int a_MaxDepth, int a_Seed) :\n\t\tsuper(a_OriginX, a_OriginZ),\n\t\tm_ParentGen(a_ParentGen),\n\t\tm_GridSize(a_GridSize),\n\t\tm_Seed(a_Seed)\n\t{\n\t\t\/\/ TODO: Proper Y-coord placement\n\t\tint BlockY = 64;\n\t\t\n\t\t\/\/ Generate pieces:\n\t\tfor (int i = 0; m_Pieces.size() < (size_t)(a_MaxDepth * a_MaxDepth \/ 8 + a_MaxDepth); i++)\n\t\t{\n\t\t\tcBFSPieceGenerator pg(cNetherFortGen::m_PiecePool, a_Seed + i);\n\t\t\tpg.PlacePieces(a_OriginX, BlockY, a_OriginZ, a_MaxDepth, m_Pieces);\n\t\t}\n\t}\n\n\t\n\t~cNetherFort()\n\t{\n\t\tcPieceGenerator::FreePieces(m_Pieces);\n\t}\n\t\n\t\t\n\t\/** Carves the system into the chunk data *\/\n\tvirtual void DrawIntoChunk(cChunkDesc & a_Chunk)\n\t{\n\t\tfor (cPlacedPieces::const_iterator itr = m_Pieces.begin(), end = m_Pieces.end(); itr != end; ++itr)\n\t\t{\n\t\t\tconst cPrefab & Prefab = (const cPrefab &)((*itr)->GetPiece());\n\t\t\tPrefab.Draw(a_Chunk, *itr);\n\t\t} \/\/ for itr - m_PlacedPieces[]\n\t}\n};\n\n\n\n\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ Performance test of the NetherFort generator:\n\n\/*\n#include \"OSSupport\/Timer.h\"\nstatic class cNetherFortPerfTest\n{\npublic:\n\tcNetherFortPerfTest(void)\n\t{\n\t\tcTimer Timer;\n\t\tlong long StartTime = Timer.GetNowTime();\n\t\t\n\t\tconst int GridSize = 512;\n\t\tconst int MaxDepth = 12;\n\t\tconst int NumIterations = 100;\n\t\tfor (int i = 0; i < NumIterations; i++)\n\t\t{\n\t\t\tcNetherFortGen FortGen(i, GridSize, MaxDepth);\n\t\t\tdelete new cNetherFortGen::cNetherFort(FortGen, 0, 0, GridSize, MaxDepth, i);\n\t\t}\n\t\t\n\t\tlong long EndTime = Timer.GetNowTime();\n\t\tprintf(\"%d forts took %lld msec (%f sec) to generate\\n\", NumIterations, EndTime - StartTime, ((double)(EndTime - StartTime)) \/ 1000);\n\t\texit(0);\n\t}\n\t\n} g_PerfTest;\n\/\/*\/\n\n\n\n\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ cNetherFortGen:\n\ncPrefabPiecePool cNetherFortGen::m_PiecePool(g_NetherFortPrefabs, g_NetherFortPrefabsCount, g_NetherFortStartingPrefabs, g_NetherFortStartingPrefabsCount);\n\n\n\n\n\ncNetherFortGen::cNetherFortGen(int a_Seed, int a_GridSize, int a_MaxDepth) :\n\tsuper(a_Seed, a_GridSize, a_GridSize, a_MaxDepth * 10, a_MaxDepth * 10, 200),\n\tm_MaxDepth(a_MaxDepth)\n{\n\t\/*\n\t\/\/ DEBUG: Try one round of placement:\n\tcPlacedPieces Pieces;\n\tcBFSPieceGenerator pg(m_PiecePool, a_Seed);\n\tpg.PlacePieces(0, 64, 0, a_MaxDepth, Pieces);\n\t\/\/*\/\n}\n\n\n\n\n\ncGridStructGen::cStructurePtr cNetherFortGen::CreateStructure(int a_OriginX, int a_OriginZ)\n{\n\treturn cStructurePtr(new cNetherFort(*this, a_OriginX, a_OriginZ, m_GridSizeX, m_MaxDepth, m_Seed));\n}\n\n<commit_msg>Removed an unused NetherFortGen variable.<commit_after>\n\/\/ NetherFortGen.cpp\n\n\/\/ Implements the cNetherFortGen class representing the nether fortress generator\n\n#include \"Globals.h\"\n#include \"NetherFortGen.h\"\n#include \"Prefabs\/NetherFortPrefabs.h\"\n\n\n\n\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ cNetherFortGen::cNetherFort:\n\nclass cNetherFortGen::cNetherFort :\n\tpublic cGridStructGen::cStructure\n{\n\ttypedef cGridStructGen::cStructure super;\n\t\npublic:\n\tcNetherFortGen & m_ParentGen;\n\tint m_GridSize;\n\tint m_Seed;\n\tcPlacedPieces m_Pieces;\n\n\n\tcNetherFort(cNetherFortGen & a_ParentGen, int a_OriginX, int a_OriginZ, int a_GridSize, int a_MaxDepth, int a_Seed) :\n\t\tsuper(a_OriginX, a_OriginZ),\n\t\tm_ParentGen(a_ParentGen),\n\t\tm_GridSize(a_GridSize),\n\t\tm_Seed(a_Seed)\n\t{\n\t\t\/\/ TODO: Proper Y-coord placement\n\t\tint BlockY = 64;\n\t\t\n\t\t\/\/ Generate pieces:\n\t\tfor (int i = 0; m_Pieces.size() < (size_t)(a_MaxDepth * a_MaxDepth \/ 8 + a_MaxDepth); i++)\n\t\t{\n\t\t\tcBFSPieceGenerator pg(cNetherFortGen::m_PiecePool, a_Seed + i);\n\t\t\tpg.PlacePieces(a_OriginX, BlockY, a_OriginZ, a_MaxDepth, m_Pieces);\n\t\t}\n\t}\n\n\t\n\t~cNetherFort()\n\t{\n\t\tcPieceGenerator::FreePieces(m_Pieces);\n\t}\n\t\n\t\t\n\t\/** Carves the system into the chunk data *\/\n\tvirtual void DrawIntoChunk(cChunkDesc & a_Chunk)\n\t{\n\t\tfor (cPlacedPieces::const_iterator itr = m_Pieces.begin(), end = m_Pieces.end(); itr != end; ++itr)\n\t\t{\n\t\t\tconst cPrefab & Prefab = (const cPrefab &)((*itr)->GetPiece());\n\t\t\tPrefab.Draw(a_Chunk, *itr);\n\t\t} \/\/ for itr - m_PlacedPieces[]\n\t}\n};\n\n\n\n\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ Performance test of the NetherFort generator:\n\n\/*\n#include \"OSSupport\/Timer.h\"\nstatic class cNetherFortPerfTest\n{\npublic:\n\tcNetherFortPerfTest(void)\n\t{\n\t\tcTimer Timer;\n\t\tlong long StartTime = Timer.GetNowTime();\n\t\t\n\t\tconst int GridSize = 512;\n\t\tconst int MaxDepth = 12;\n\t\tconst int NumIterations = 100;\n\t\tfor (int i = 0; i < NumIterations; i++)\n\t\t{\n\t\t\tcNetherFortGen FortGen(i, GridSize, MaxDepth);\n\t\t\tdelete new cNetherFortGen::cNetherFort(FortGen, 0, 0, GridSize, MaxDepth, i);\n\t\t}\n\t\t\n\t\tlong long EndTime = Timer.GetNowTime();\n\t\tprintf(\"%d forts took %lld msec (%f sec) to generate\\n\", NumIterations, EndTime - StartTime, ((double)(EndTime - StartTime)) \/ 1000);\n\t\texit(0);\n\t}\n\t\n} g_PerfTest;\n\/\/*\/\n\n\n\n\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ cNetherFortGen:\n\ncPrefabPiecePool cNetherFortGen::m_PiecePool(g_NetherFortPrefabs, g_NetherFortPrefabsCount, g_NetherFortStartingPrefabs, g_NetherFortStartingPrefabsCount);\n\n\n\n\n\ncNetherFortGen::cNetherFortGen(int a_Seed, int a_GridSize, int a_MaxDepth) :\n\tsuper(a_Seed, a_GridSize, a_GridSize, a_MaxDepth * 10, a_MaxDepth * 10, 200),\n\tm_MaxDepth(a_MaxDepth)\n{\n\t\/*\n\t\/\/ DEBUG: Try one round of placement:\n\tcPlacedPieces Pieces;\n\tcBFSPieceGenerator pg(m_PiecePool, a_Seed);\n\tpg.PlacePieces(0, 64, 0, a_MaxDepth, Pieces);\n\t\/\/*\/\n}\n\n\n\n\n\ncGridStructGen::cStructurePtr cNetherFortGen::CreateStructure(int a_OriginX, int a_OriginZ)\n{\n\treturn cStructurePtr(new cNetherFort(*this, a_OriginX, a_OriginZ, m_GridSizeX, m_MaxDepth, m_Seed));\n}\n\n<|endoftext|>"} {"text":"<commit_before><commit_msg>add error returns missing from protoc to prevent it from exiting with a successful return value when writing the zip file fails<commit_after><|endoftext|>"} {"text":"<commit_before>#include \"stdafx.h\"\n#include \"ObjectPoolTest.h\"\n#include \"ObjectPool.h\"\n#include \"TestFixtures\/SimpleThreaded.h\"\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\nTEST_F(ObjectPoolTest, 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 \/\/ Block--verify that we _do not_ get any of those objects back while they are\n \/\/ still outstanding.\n {\n auto obj4 = pool.WaitFor(boost::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(boost::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(boost::chrono::milliseconds(100));\n m_ptr.reset();\n }\n};\n\nTEST_F(ObjectPoolTest, EmptyPoolIssuance) {\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 m_create->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 ObjectPool<int> pool;\n pool.Wait();\n pool.Rundown();\n}<commit_msg>Comment to discuss why there are no assertions or tests of any kind in a unit test<commit_after>#include \"stdafx.h\"\n#include \"ObjectPoolTest.h\"\n#include \"ObjectPool.h\"\n#include \"TestFixtures\/SimpleThreaded.h\"\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\nTEST_F(ObjectPoolTest, 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 \/\/ Block--verify that we _do not_ get any of those objects back while they are\n \/\/ still outstanding.\n {\n auto obj4 = pool.WaitFor(boost::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(boost::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(boost::chrono::milliseconds(100));\n m_ptr.reset();\n }\n};\n\nTEST_F(ObjectPoolTest, EmptyPoolIssuance) {\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 m_create->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}<|endoftext|>"} {"text":"<commit_before>#include \"SDL\/SDL.h\"\n#include \"SDL\/SDL_ttf.h\"\n#include <string>\n#include <iostream>\n#include <vector>\n#include <list>\n#include <algorithm>\n#include <functional>\n#include <stdexcept>\n\n#include \"utils.h\"\n#include \"timer.h\"\n#include \"renderable.h\"\n#include \"entity.h\"\n#include \"ball.h\"\n#include \"bat.h\"\n#include \"brick.h\"\n#include \"image_pack.h\"\n#include \"score_counter.h\"\n\nconst char *CAPTION = \"Breakout\";\nconst int SCREEN_WIDTH = 640;\nconst int SCREEN_HEIGHT = 480;\nconst int SCREEN_BPP = 32;\nconst int N_BRICKS = 20;\n\nenum { ERROR_INITIALIZE = 1,\n ERROR_LOAD_IMAGES,\n ERROR_FLIP };\n\nconst int MAXIMUM_FPS = 50;\n\nSDL_Surface *screen = NULL;\nSDL_Event event;\n\nvoid clean_up();\nbool init();\n\nint main (int argc, char **argv) {\n using namespace breakout;\n using namespace std;\n\n list<Entity*> entities = list<Entity*>();\n list<Renderable*> renders = list<Renderable*>();\n\n if (!init()) {\n cerr << \"Error initializing SDL.\";\n return ERROR_INITIALIZE;\n }\n\n const char *paths[] = {\"ball.png\", \"bat.png\", \"brick.png\"};\n vector<string> image_paths(paths, paths + sizeof(paths) \/ sizeof(char*));\n ImagePack *images;\n\n try {\n images = new ImagePack(image_paths);\n } catch (std::runtime_error e) {\n cerr << \"Error loading images.\";\n return ERROR_LOAD_IMAGES;\n }\n\n bool running = true;\n Timer timer = Timer();\n Ball ball = Ball(images->get_image(\"ball.png\"), SCREEN_WIDTH \/ 2,\n SCREEN_HEIGHT \/ 2, 5, 7);\n Bat bat = Bat(images->get_image(\"bat.png\"), SCREEN_WIDTH \/ 2,\n SCREEN_HEIGHT - 50);\n SDL_Color score_color = {0, 0, 0};\n ScoreCounter score = ScoreCounter(0, string(\"LiberationSans-Regular.ttf\"), 20,\n score_color);\n int remaining = 0;\n\n Brick brick = Brick(images->get_image(\"brick.png\"));\n brick.set_x(40);\n brick.set_y(50);\n \n entities.push_back(&ball);\n entities.push_back(&bat);\n entities.push_back(&brick);\n\n renders.push_back(&ball);\n renders.push_back(&bat);\n renders.push_back(&score);\n renders.push_back(&brick);\n\n int bat_width = bat.get_rect().w;\n int ball_width = ball.get_rect().w;\n int ball_height = ball.get_rect().h;\n\n while (running) {\n timer.start();\n\n \/** game logic **\/\n \n while (SDL_PollEvent(&event)) {\n if (event.type == SDL_QUIT) {\n running = false;\n }\n }\n\n for_each(entities.begin(), entities.end(), mem_fun(&Entity::step));\n entities.remove_if(mem_fun(&Entity::is_dead));\n \n if (collides(&ball, &bat)) {\n ball.set_x_velocity(-ball.get_x_velocity());\n ball.set_y_velocity(-ball.get_y_velocity());\n }\n\n if (collides(&ball, &brick)) {\n brick.destroy();\n }\n\n if (ball.get_x() < 0 || ball.get_x() >= SCREEN_WIDTH - ball_width) {\n ball.set_x_velocity(-ball.get_x_velocity());\n }\n\n if (ball.get_y() < 0 || ball.get_y() >= SCREEN_HEIGHT - ball_height) {\n ball.set_y_velocity(-ball.get_y_velocity());\n }\n \n if (bat.get_x() < 0) {\n bat.set_x(0);\n } else if (bat.get_x() > SCREEN_WIDTH - bat_width) {\n bat.set_x(SCREEN_WIDTH - bat_width);\n }\n\n \/** rendering logic **\/\n \/\/ white background\n SDL_FillRect(screen, &screen->clip_rect,\n SDL_MapRGB(screen->format, 0xFF, 0xFF, 0xFF));\n for_each(renders.begin(), renders.end(),\n bind2nd(mem_fun<void, Renderable, SDL_Surface *>(&Renderable::render),\n screen));\n renders.remove_if(mem_fun(&Renderable::is_dead));\n\n \/** limit framerate **\/\n \n remaining = 1000 \/ MAXIMUM_FPS - timer.get_ticks();\n\n if (SDL_Flip(screen) == -1) {\n cerr << \"Flip error.\";\n return ERROR_FLIP;\n }\n \n if (remaining > 0) {\n SDL_Delay(remaining);\n }\n }\n\n delete images;\n\n clean_up();\n\n return 0;\n}\n\n\/**\n * Closes external libraries (SDL, TTF)\n *\/\nvoid clean_up() {\n TTF_Quit();\n SDL_Quit();\n}\n\n\/**\n * Sets up external libraries and window\n *\/\nbool init() {\n if (SDL_Init(SDL_INIT_EVERYTHING) == -1) {\n return false;\n }\n\n if (TTF_Init() == -1) {\n return false;\n }\n\n screen = SDL_SetVideoMode(SCREEN_WIDTH, SCREEN_HEIGHT, SCREEN_BPP,\n SDL_SWSURFACE);\n if (screen == NULL) return false;\n SDL_WM_SetCaption(CAPTION, NULL);\n return true;\n}\n<commit_msg>Score counter now updates; ball bounces when hits brick.<commit_after>#include \"SDL\/SDL.h\"\n#include \"SDL\/SDL_ttf.h\"\n#include <string>\n#include <iostream>\n#include <vector>\n#include <list>\n#include <algorithm>\n#include <functional>\n#include <stdexcept>\n\n#include \"utils.h\"\n#include \"timer.h\"\n#include \"renderable.h\"\n#include \"entity.h\"\n#include \"ball.h\"\n#include \"bat.h\"\n#include \"brick.h\"\n#include \"image_pack.h\"\n#include \"score_counter.h\"\n\nconst char *CAPTION = \"Breakout\";\nconst int SCREEN_WIDTH = 640;\nconst int SCREEN_HEIGHT = 480;\nconst int SCREEN_BPP = 32;\nconst int N_BRICKS = 20;\n\nenum { ERROR_INITIALIZE = 1,\n ERROR_LOAD_IMAGES,\n ERROR_FLIP };\n\nconst int MAXIMUM_FPS = 50;\n\nSDL_Surface *screen = NULL;\nSDL_Event event;\n\nvoid clean_up();\nbool init();\n\nint main (int argc, char **argv) {\n using namespace breakout;\n using namespace std;\n\n list<Entity*> entities = list<Entity*>();\n list<Renderable*> renders = list<Renderable*>();\n\n if (!init()) {\n cerr << \"Error initializing SDL.\";\n return ERROR_INITIALIZE;\n }\n\n const char *paths[] = {\"ball.png\", \"bat.png\", \"brick.png\"};\n vector<string> image_paths(paths, paths + sizeof(paths) \/ sizeof(char*));\n ImagePack *images;\n\n try {\n images = new ImagePack(image_paths);\n } catch (std::runtime_error e) {\n cerr << \"Error loading images.\";\n return ERROR_LOAD_IMAGES;\n }\n\n bool running = true;\n Timer timer = Timer();\n Ball ball = Ball(images->get_image(\"ball.png\"), SCREEN_WIDTH \/ 2,\n SCREEN_HEIGHT \/ 2, 5, 7);\n Bat bat = Bat(images->get_image(\"bat.png\"), SCREEN_WIDTH \/ 2,\n SCREEN_HEIGHT - 50);\n SDL_Color score_color = {0, 0, 0};\n ScoreCounter score = ScoreCounter(0, string(\"LiberationSans-Regular.ttf\"), 20,\n score_color);\n int remaining = 0;\n\n Brick brick = Brick(images->get_image(\"brick.png\"));\n brick.set_x(40);\n brick.set_y(50);\n \n entities.push_back(&ball);\n entities.push_back(&bat);\n entities.push_back(&brick);\n\n renders.push_back(&ball);\n renders.push_back(&bat);\n renders.push_back(&score);\n renders.push_back(&brick);\n\n int bat_width = bat.get_rect().w;\n int ball_width = ball.get_rect().w;\n int ball_height = ball.get_rect().h;\n\n while (running) {\n timer.start();\n\n \/** game logic **\/\n \n while (SDL_PollEvent(&event)) {\n if (event.type == SDL_QUIT) {\n running = false;\n }\n }\n\n for_each(entities.begin(), entities.end(), mem_fun(&Entity::step));\n entities.remove_if(mem_fun(&Entity::is_dead));\n \n if (collides(&ball, &bat)) {\n ball.set_x_velocity(-ball.get_x_velocity());\n ball.set_y_velocity(-ball.get_y_velocity());\n }\n\n if (collides(&ball, &brick)) {\n brick.destroy();\n ball.set_x_velocity(-ball.get_x_velocity());\n ball.set_y_velocity(-ball.get_y_velocity());\n score.add_score(10);\n }\n\n if (ball.get_x() < 0 || ball.get_x() >= SCREEN_WIDTH - ball_width) {\n ball.set_x_velocity(-ball.get_x_velocity());\n }\n\n if (ball.get_y() < 0 || ball.get_y() >= SCREEN_HEIGHT - ball_height) {\n ball.set_y_velocity(-ball.get_y_velocity());\n }\n \n if (bat.get_x() < 0) {\n bat.set_x(0);\n } else if (bat.get_x() > SCREEN_WIDTH - bat_width) {\n bat.set_x(SCREEN_WIDTH - bat_width);\n }\n\n \/** rendering logic **\/\n \/\/ white background\n SDL_FillRect(screen, &screen->clip_rect,\n SDL_MapRGB(screen->format, 0xFF, 0xFF, 0xFF));\n for_each(renders.begin(), renders.end(),\n bind2nd(mem_fun<void, Renderable, SDL_Surface *>(&Renderable::render),\n screen));\n renders.remove_if(mem_fun(&Renderable::is_dead));\n\n \/** limit framerate **\/\n \n remaining = 1000 \/ MAXIMUM_FPS - timer.get_ticks();\n\n if (SDL_Flip(screen) == -1) {\n cerr << \"Flip error.\";\n return ERROR_FLIP;\n }\n \n if (remaining > 0) {\n SDL_Delay(remaining);\n }\n }\n\n delete images;\n\n clean_up();\n\n return 0;\n}\n\n\/**\n * Closes external libraries (SDL, TTF)\n *\/\nvoid clean_up() {\n TTF_Quit();\n SDL_Quit();\n}\n\n\/**\n * Sets up external libraries and window\n *\/\nbool init() {\n if (SDL_Init(SDL_INIT_EVERYTHING) == -1) {\n return false;\n }\n\n if (TTF_Init() == -1) {\n return false;\n }\n\n screen = SDL_SetVideoMode(SCREEN_WIDTH, SCREEN_HEIGHT, SCREEN_BPP,\n SDL_SWSURFACE);\n if (screen == NULL) return false;\n SDL_WM_SetCaption(CAPTION, NULL);\n return true;\n}\n<|endoftext|>"} {"text":"<commit_before>\/\/\/\/ Fancy ncurses terminal for calculators\n\/\/\/\/ Author: David P. Sicilia, June 2016\n\n#include <ncurses.h>\n#include <string>\n#include <vector>\n#include <algorithm>\n#include <stdexcept>\n#include <iostream>\n#include <string.h>\n\n#include \"assert.hpp\"\n#include \"scope_exit.hpp\"\n#include \"input.hpp\"\n\nstruct Entry\n{\n std::string one_line;\n std::vector<std::string> grid;\n};\n\nstruct Stripe\n{\n Entry e;\n bool is_left;\n int y;\n int x;\n};\n\nauto render_stripe( int width, Stripe const& s ) -> std::vector<std::string>\n{\n auto out = std::vector<std::string>( s.y+2 );\n int start_x = s.is_left ? 1 : width-1-s.x;\n auto pad = std::string( start_x, ' ' );\n auto end_pad = std::string( width-start_x-s.x, ' ' );\n for( int i = 0; i < s.y; ++i )\n out[i+1] = pad + s.e.grid[i] + end_pad; \n out[0] = pad + std::string( s.x, ' ' ) + end_pad;\n out[s.y+1] = pad + std::string( s.x, ' ' ) + end_pad;\n return out;\n}\n\nauto draw_stripe( int width, int start_y, bool highlight, Stripe const& s ) -> void\n{\n auto text = render_stripe( width, s );\n if( highlight ) attron( A_REVERSE );\n for( int i = text.size(); i > 0; --i ) {\n if( start_y-i < 0 )\n break;\n mvprintw( start_y-text.size()+i, 0, text[i-1].c_str() );\n }\n if( highlight ) attroff( A_REVERSE );\n}\n\nauto draw_stripes( int highlight, std::vector<Stripe> const& v ) -> void\n{\n int height = 0, width = 0;\n getmaxyx( stdscr, height, width );\n (void)height;\n int start_y = height-2;\n int highlight_j = v.size() - highlight;\n for( int j = v.size(); j > 0; --j ) {\n if( start_y < 0 )\n break;\n Stripe const& s = v[j-1];\n bool highlight = (j == highlight_j);\n draw_stripe( width, start_y, highlight, s );\n start_y -= (s.y+2);\n }\n}\n\nstd::vector<std::string> s1 = {\n \" 1 + 2 \",\n \"---------\",\n \" 5 \",\n \" 3 + --- \",\n \" 6 \"\n};\n\nstd::vector<std::string> s2 = {\n \" 1 0.002 r \",\n \" --- + ------- + 7 \",\n \" x y \",\n \"--------------------------\",\n \" w \",\n \" \/ \\\\ \",\n \" | 1 4 + t | \",\n \" |1 + --- + ------- + y| \",\n \" | 6 y | \",\n \" \\\\ \/ \"\n};\n\nstd::vector<std::string> s3 = {\n \" -w\",\n \"\/ \\\\ \/ \\\\ \",\n \"| 1 1 r| | t + 4 7 | \",\n \"|--- + ------- + 7 |*|------- + y + ---| \",\n \"| x y*500 | | y 6 | \",\n \"\\\\ \/ \\\\ \/ \"\n};\n\nstd::vector<std::string> s4 = { \"1\" };\n\nstd::vector<std::string> s5 = { \"1.000000000000000000000000000000000000000000000000\" };\n\nstd::vector<Stripe> vs = {\n { {\"123\",s2}, false, (int)s2.size(), (int)s2[0].length() },\n { {\"123\",s3}, true, (int)s3.size(), (int)s3[0].length() },\n { {\"123\",s1}, false, (int)s1.size(), (int)s1[0].length() },\n { {\"123\",s1}, true, (int)s1.size(), (int)s1[0].length() },\n { {\"123\",s3}, false, (int)s3.size(), (int)s3[0].length() },\n { {\"123\",s1}, true, (int)s1.size(), (int)s1[0].length() },\n { {\"123\",s2}, false, (int)s2.size(), (int)s2[0].length() },\n { {\"123\",s1}, true, (int)s1.size(), (int)s1[0].length() },\n { {\"123\",s1}, false, (int)s1.size(), (int)s1[0].length() },\n { {\"123\",s2}, true, (int)s2.size(), (int)s2[0].length() },\n { {\"123\",s3}, false, (int)s3.size(), (int)s3[0].length() },\n { {\"123\",s3}, true, (int)s3.size(), (int)s3[0].length() },\n { {\"123\",s1}, false, (int)s1.size(), (int)s1[0].length() },\n { {\"123\",s4}, true, (int)s4.size(), (int)s4[0].length() },\n { {\"123\",s5}, false, (int)s5.size(), (int)s5[0].length() },\n};\n\nint _main(int argc, char* argv[])\n{\n initscr();\n SCOPE_EXIT( endwin() )\n raw();\n nonl();\n noecho();\n keypad(stdscr, TRUE);\n draw_stripes( -1, vs );\n int ch;\n int highlight = -1;\n int height = 0, width = 0;\n getmaxyx( stdscr, height, width );\n Input in( width-2 );\n bool editing = true;\n move( height-1, 1 );\n while( (ch = getch()) != (int)'q' )\n {\n char const* name = keyname( ch );\n ASSERT( strlen( name ) > 0 )\n bool ctrl = (name[0] == '^' && strlen( name ) > 1);\n mvprintw( 0, 0, \"%x \", ch );\n mvprintw( 1, 0, \"%s \", name );\n mvprintw( 2, 0, \"%x \", '\\n' );\n \/\/ASSERT( (char)(ch & 0xff) != 'K' )\n if( ch == KEY_UP || (ctrl && name[1] == 'K') ) {\n highlight += 1;\n editing = false;\n }\n else if ( ch == KEY_DOWN || (ctrl && name[1] == 'J') ) {\n highlight -= 1;\n if( highlight < -1 )\n highlight = -1;\n if( highlight == -1 )\n editing = true;\n }\n else if( ch == '\\n' || ch == '\\r' ) {\n if( editing ) {\n std::string const& str = in.get_string();\n if( !str.empty() ) {\n Stripe s({ {str,{str}}, true, (int)1, (int)str.length() });\n vs.push_back( s );\n Stripe s2({ {str,{str}}, false, (int)1, (int)str.length() });\n vs.push_back( s2 );\n in.clear();\n }\n }\n else {\n std::string to_insert = vs[vs.size() - highlight - 1].e.one_line;\n in.paste( to_insert );\n highlight = -1;\n editing = true;\n }\n }\n else {\n if( editing )\n in.key_press( ch );\n }\n draw_stripes( highlight, vs );\n in.draw( height-1, 1 );\n move( height-1, 1+in.get_cursor() );\n refresh();\n }\n return 0;\n}\n\nint main( int argc, char* argv[] )\n{\n try {\n return _main(argc, argv);\n } catch( std::exception const& e ) {\n std::cout << \"exception:\" << e.what() << std::endl;\n return 1;\n }\n}\n<commit_msg>Add more asserts<commit_after>\/\/\/\/ Fancy ncurses terminal for calculators\n\/\/\/\/ Author: David P. Sicilia, June 2016\n\n#include <ncurses.h>\n#include <string>\n#include <vector>\n#include <algorithm>\n#include <stdexcept>\n#include <iostream>\n#include <string.h>\n\n#include \"assert.hpp\"\n#include \"scope_exit.hpp\"\n#include \"input.hpp\"\n\nstruct Entry\n{\n std::string one_line;\n std::vector<std::string> grid;\n};\n\nstruct Stripe\n{\n Entry e;\n bool is_left;\n int y;\n int x;\n};\n\nauto render_stripe( int width, Stripe const& s ) -> std::vector<std::string>\n{\n ASSERT( s.x >= 0 )\n ASSERT( s.y >= 0 )\n auto out = std::vector<std::string>( s.y+2 );\n int start_x = s.is_left ? 1 : width-1-s.x;\n ASSERT( start_x >= 0 )\n auto pad = std::string( start_x, ' ' );\n ASSERT( width-start_x-s.x >= 0 )\n auto end_pad = std::string( width-start_x-s.x, ' ' );\n for( int i = 0; i < s.y; ++i )\n out[i+1] = pad + s.e.grid[i] + end_pad; \n out[0] = pad + std::string( s.x, ' ' ) + end_pad;\n out[s.y+1] = pad + std::string( s.x, ' ' ) + end_pad;\n return out;\n}\n\nauto draw_stripe( int width, int start_y, bool highlight, Stripe const& s ) -> void\n{\n auto text = render_stripe( width, s );\n if( highlight ) attron( A_REVERSE );\n for( int i = text.size(); i > 0; --i ) {\n if( start_y-i < 0 )\n break;\n ASSERT( start_y-text.size()+i >= 0 )\n mvprintw( start_y-text.size()+i, 0, text[i-1].c_str() );\n }\n if( highlight ) attroff( A_REVERSE );\n}\n\nauto draw_stripes( int highlight, std::vector<Stripe> const& v ) -> void\n{\n int height = 0, width = 0;\n getmaxyx( stdscr, height, width );\n (void)height;\n int start_y = height-2;\n ASSERT( start_y >= 0 )\n int highlight_j = v.size() - highlight;\n ASSERT( highlight_j >= 0 )\n for( int j = v.size(); j > 0; --j ) {\n if( start_y < 0 )\n break;\n Stripe const& s = v[j-1];\n bool highlight = (j == highlight_j);\n draw_stripe( width, start_y, highlight, s );\n start_y -= (s.y+2);\n }\n}\n\nstd::vector<std::string> s1 = {\n \" 1 + 2 \",\n \"---------\",\n \" 5 \",\n \" 3 + --- \",\n \" 6 \"\n};\n\nstd::vector<std::string> s2 = {\n \" 1 0.002 r \",\n \" --- + ------- + 7 \",\n \" x y \",\n \"--------------------------\",\n \" w \",\n \" \/ \\\\ \",\n \" | 1 4 + t | \",\n \" |1 + --- + ------- + y| \",\n \" | 6 y | \",\n \" \\\\ \/ \"\n};\n\nstd::vector<std::string> s3 = {\n \" -w\",\n \"\/ \\\\ \/ \\\\ \",\n \"| 1 1 r| | t + 4 7 | \",\n \"|--- + ------- + 7 |*|------- + y + ---| \",\n \"| x y*500 | | y 6 | \",\n \"\\\\ \/ \\\\ \/ \"\n};\n\nstd::vector<std::string> s4 = { \"1\" };\n\nstd::vector<std::string> s5 = { \"1.000000000000000000000000000000000000000000000000\" };\n\nstd::vector<Stripe> vs = {\n { {\"123\",s2}, false, (int)s2.size(), (int)s2[0].length() },\n { {\"123\",s3}, true, (int)s3.size(), (int)s3[0].length() },\n { {\"123\",s1}, false, (int)s1.size(), (int)s1[0].length() },\n { {\"123\",s1}, true, (int)s1.size(), (int)s1[0].length() },\n { {\"123\",s3}, false, (int)s3.size(), (int)s3[0].length() },\n { {\"123\",s1}, true, (int)s1.size(), (int)s1[0].length() },\n { {\"123\",s2}, false, (int)s2.size(), (int)s2[0].length() },\n { {\"123\",s1}, true, (int)s1.size(), (int)s1[0].length() },\n { {\"123\",s1}, false, (int)s1.size(), (int)s1[0].length() },\n { {\"123\",s2}, true, (int)s2.size(), (int)s2[0].length() },\n { {\"123\",s3}, false, (int)s3.size(), (int)s3[0].length() },\n { {\"123\",s3}, true, (int)s3.size(), (int)s3[0].length() },\n { {\"123\",s1}, false, (int)s1.size(), (int)s1[0].length() },\n { {\"123\",s4}, true, (int)s4.size(), (int)s4[0].length() },\n { {\"123\",s5}, false, (int)s5.size(), (int)s5[0].length() },\n};\n\nint _main(int argc, char* argv[])\n{\n initscr();\n SCOPE_EXIT( endwin() )\n raw();\n nonl();\n noecho();\n keypad(stdscr, TRUE);\n draw_stripes( -1, vs );\n int ch;\n int highlight = -1;\n int height = 0, width = 0;\n getmaxyx( stdscr, height, width );\n Input in( width-2 );\n bool editing = true;\n move( height-1, 1 );\n while( (ch = getch()) != (int)'q' )\n {\n char const* name = keyname( ch );\n ASSERT( strlen( name ) > 0 )\n bool ctrl = (name[0] == '^' && strlen( name ) > 1);\n mvprintw( 0, 0, \"%x \", ch );\n mvprintw( 1, 0, \"%s \", name );\n mvprintw( 2, 0, \"%x \", '\\n' );\n \/\/ASSERT( (char)(ch & 0xff) != 'K' )\n if( ch == KEY_UP || (ctrl && name[1] == 'K') ) {\n highlight += 1;\n editing = false;\n }\n else if ( ch == KEY_DOWN || (ctrl && name[1] == 'J') ) {\n highlight -= 1;\n if( highlight < -1 )\n highlight = -1;\n if( highlight == -1 )\n editing = true;\n }\n else if( ch == '\\n' || ch == '\\r' ) {\n if( editing ) {\n std::string const& str = in.get_string();\n if( !str.empty() ) {\n Stripe s({ {str,{str}}, true, (int)1, (int)str.length() });\n vs.push_back( s );\n Stripe s2({ {str,{str}}, false, (int)1, (int)str.length() });\n vs.push_back( s2 );\n in.clear();\n }\n }\n else {\n std::string to_insert = vs[vs.size() - highlight - 1].e.one_line;\n in.paste( to_insert );\n highlight = -1;\n editing = true;\n }\n }\n else {\n if( editing )\n in.key_press( ch );\n }\n draw_stripes( highlight, vs );\n in.draw( height-1, 1 );\n move( height-1, 1+in.get_cursor() );\n refresh();\n }\n return 0;\n}\n\nint main( int argc, char* argv[] )\n{\n try {\n return _main(argc, argv);\n } catch( std::exception const& e ) {\n std::cout << \"exception:\" << e.what() << std::endl;\n return 1;\n }\n}\n<|endoftext|>"} {"text":"<commit_before>\/*\n * Medical Image Registration ToolKit (MIRTK)\n *\n * Copyright 2008-2015 Imperial College London\n * Copyright 2008-2013 Daniel Rueckert, Julia Schnabel\n * Copyright 2013-2015 Andreas Schuh\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n *\/\n\n#include <mirtkVoxel.h>\n\n\nnamespace mirtk {\n\n\n\/\/ -----------------------------------------------------------------------------\ntemplate <> string ToString(const ImageDataType &value, int w, char c, bool left)\n{\n const char *str = \"unknown\";\n switch (value) {\n case MIRTK_VOXEL_CHAR: str = \"char\"; break;\n case MIRTK_VOXEL_UNSIGNED_CHAR: str = \"uchar\"; break;\n case MIRTK_VOXEL_SHORT: str = \"short\"; break;\n case MIRTK_VOXEL_UNSIGNED_SHORT: str = \"ushort\"; break;\n case MIRTK_VOXEL_INT: str = \"int\"; break;\n case MIRTK_VOXEL_UNSIGNED_INT: str = \"uint\"; break;\n case MIRTK_VOXEL_FLOAT: str = \"float\"; break;\n case MIRTK_VOXEL_DOUBLE: str = \"double\"; break;\n case MIRTK_VOXEL_RGB: str = \"RGB\"; break;\n case MIRTK_VOXEL_FLOAT1: str = \"float1\"; break;\n case MIRTK_VOXEL_FLOAT2: str = \"float2\"; break;\n case MIRTK_VOXEL_FLOAT3: str = \"float3\"; break;\n case MIRTK_VOXEL_FLOAT4: str = \"float4\"; break;\n case MIRTK_VOXEL_FLOAT1x1: str = \"float1x1\"; break;\n case MIRTK_VOXEL_FLOAT2x2: str = \"float2x2\"; break;\n case MIRTK_VOXEL_FLOAT3x3: str = \"float3x3\"; break;\n case MIRTK_VOXEL_FLOAT3x4: str = \"float3x4\"; break;\n case MIRTK_VOXEL_FLOAT4x4: str = \"float4x4\"; break;\n case MIRTK_VOXEL_DOUBLE1: str = \"double1\"; break;\n case MIRTK_VOXEL_DOUBLE2: str = \"double2\"; break;\n case MIRTK_VOXEL_DOUBLE3: str = \"double3\"; break;\n case MIRTK_VOXEL_DOUBLE4: str = \"double4\"; break;\n case MIRTK_VOXEL_DOUBLE1x1: str = \"double1x1\"; break;\n case MIRTK_VOXEL_DOUBLE2x2: str = \"double2x2\"; break;\n case MIRTK_VOXEL_DOUBLE3x3: str = \"double3x3\"; break;\n case MIRTK_VOXEL_DOUBLE3x4: str = \"double3x4\"; break;\n case MIRTK_VOXEL_DOUBLE4x4: str = \"double4x4\"; break;\n default: str = \"unknown\"; break;\n }\n return ToString(str, c, w, left);\n}\n\n\/\/ -----------------------------------------------------------------------------\ntemplate <> bool FromString(const char *str, ImageDataType &value)\n{\n value = static_cast<ImageDataType>(MIRKT_VOXEL_LAST - 1);\n while (value != MIRTK_VOXEL_UNKNOWN) {\n if (ToString(value) == str) break;\n value = static_cast<ImageDataType>(value - 1);\n }\n return value != MIRTK_VOXEL_UNKNOWN;\n}\n\n\/\/ -----------------------------------------------------------------------------\nint DataTypeSize(int type)\n{\n switch (type){\n case MIRTK_VOXEL_CHAR: return sizeof(char);\n case MIRTK_VOXEL_UNSIGNED_CHAR: return sizeof(unsigned char);\n case MIRTK_VOXEL_SHORT: return sizeof(short);\n case MIRTK_VOXEL_UNSIGNED_SHORT: return sizeof(unsigned short);\n case MIRTK_VOXEL_INT: return sizeof(int);\n case MIRTK_VOXEL_UNSIGNED_INT: return sizeof(unsigned int);\n case MIRTK_VOXEL_FLOAT: return sizeof(float);\n case MIRTK_VOXEL_DOUBLE: return sizeof(double);\n case MIRTK_VOXEL_FLOAT1: return sizeof(float1);\n case MIRTK_VOXEL_FLOAT2: return sizeof(float2);\n case MIRTK_VOXEL_FLOAT3: return sizeof(float3);\n case MIRTK_VOXEL_FLOAT4: return sizeof(float4);\n case MIRTK_VOXEL_FLOAT2x2: return sizeof(float2x2);\n case MIRTK_VOXEL_FLOAT3x3: return sizeof(float3x3);\n case MIRTK_VOXEL_FLOAT3x4: return sizeof(float3x4);\n case MIRTK_VOXEL_FLOAT4x4: return sizeof(float4x4);\n case MIRTK_VOXEL_DOUBLE1: return sizeof(double1);\n case MIRTK_VOXEL_DOUBLE2: return sizeof(double2);\n case MIRTK_VOXEL_DOUBLE3: return sizeof(double3);\n case MIRTK_VOXEL_DOUBLE4: return sizeof(double4);\n case MIRTK_VOXEL_DOUBLE2x2: return sizeof(double2x2);\n case MIRTK_VOXEL_DOUBLE3x3: return sizeof(double3x3);\n case MIRTK_VOXEL_DOUBLE3x4: return sizeof(double3x4);\n case MIRTK_VOXEL_DOUBLE4x4: return sizeof(double4x4);\n default: return 0;\n }\n}\n\n\n} \/\/ namespace mirtk\n<commit_msg>fix: Conversion of ImageDataType to string [Image]<commit_after>\/*\n * Medical Image Registration ToolKit (MIRTK)\n *\n * Copyright 2008-2015 Imperial College London\n * Copyright 2008-2013 Daniel Rueckert, Julia Schnabel\n * Copyright 2013-2015 Andreas Schuh\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n *\/\n\n#include <mirtkVoxel.h>\n\n\nnamespace mirtk {\n\n\n\/\/ -----------------------------------------------------------------------------\ntemplate <> string ToString(const ImageDataType &value, int w, char c, bool left)\n{\n const char *str = \"unknown\";\n switch (value) {\n case MIRTK_VOXEL_CHAR: str = \"char\"; break;\n case MIRTK_VOXEL_UNSIGNED_CHAR: str = \"uchar\"; break;\n case MIRTK_VOXEL_SHORT: str = \"short\"; break;\n case MIRTK_VOXEL_UNSIGNED_SHORT: str = \"ushort\"; break;\n case MIRTK_VOXEL_INT: str = \"int\"; break;\n case MIRTK_VOXEL_UNSIGNED_INT: str = \"uint\"; break;\n case MIRTK_VOXEL_FLOAT: str = \"float\"; break;\n case MIRTK_VOXEL_DOUBLE: str = \"double\"; break;\n case MIRTK_VOXEL_RGB: str = \"RGB\"; break;\n case MIRTK_VOXEL_FLOAT1: str = \"float1\"; break;\n case MIRTK_VOXEL_FLOAT2: str = \"float2\"; break;\n case MIRTK_VOXEL_FLOAT3: str = \"float3\"; break;\n case MIRTK_VOXEL_FLOAT4: str = \"float4\"; break;\n case MIRTK_VOXEL_FLOAT1x1: str = \"float1x1\"; break;\n case MIRTK_VOXEL_FLOAT2x2: str = \"float2x2\"; break;\n case MIRTK_VOXEL_FLOAT3x3: str = \"float3x3\"; break;\n case MIRTK_VOXEL_FLOAT3x4: str = \"float3x4\"; break;\n case MIRTK_VOXEL_FLOAT4x4: str = \"float4x4\"; break;\n case MIRTK_VOXEL_DOUBLE1: str = \"double1\"; break;\n case MIRTK_VOXEL_DOUBLE2: str = \"double2\"; break;\n case MIRTK_VOXEL_DOUBLE3: str = \"double3\"; break;\n case MIRTK_VOXEL_DOUBLE4: str = \"double4\"; break;\n case MIRTK_VOXEL_DOUBLE1x1: str = \"double1x1\"; break;\n case MIRTK_VOXEL_DOUBLE2x2: str = \"double2x2\"; break;\n case MIRTK_VOXEL_DOUBLE3x3: str = \"double3x3\"; break;\n case MIRTK_VOXEL_DOUBLE3x4: str = \"double3x4\"; break;\n case MIRTK_VOXEL_DOUBLE4x4: str = \"double4x4\"; break;\n default: str = \"unknown\"; break;\n }\n return ToString(str, w, c, left);\n}\n\n\/\/ -----------------------------------------------------------------------------\ntemplate <> bool FromString(const char *str, ImageDataType &value)\n{\n value = static_cast<ImageDataType>(MIRKT_VOXEL_LAST - 1);\n while (value != MIRTK_VOXEL_UNKNOWN) {\n if (ToString(value) == str) break;\n value = static_cast<ImageDataType>(value - 1);\n }\n return value != MIRTK_VOXEL_UNKNOWN;\n}\n\n\/\/ -----------------------------------------------------------------------------\nint DataTypeSize(int type)\n{\n switch (type){\n case MIRTK_VOXEL_CHAR: return sizeof(char);\n case MIRTK_VOXEL_UNSIGNED_CHAR: return sizeof(unsigned char);\n case MIRTK_VOXEL_SHORT: return sizeof(short);\n case MIRTK_VOXEL_UNSIGNED_SHORT: return sizeof(unsigned short);\n case MIRTK_VOXEL_INT: return sizeof(int);\n case MIRTK_VOXEL_UNSIGNED_INT: return sizeof(unsigned int);\n case MIRTK_VOXEL_FLOAT: return sizeof(float);\n case MIRTK_VOXEL_DOUBLE: return sizeof(double);\n case MIRTK_VOXEL_FLOAT1: return sizeof(float1);\n case MIRTK_VOXEL_FLOAT2: return sizeof(float2);\n case MIRTK_VOXEL_FLOAT3: return sizeof(float3);\n case MIRTK_VOXEL_FLOAT4: return sizeof(float4);\n case MIRTK_VOXEL_FLOAT2x2: return sizeof(float2x2);\n case MIRTK_VOXEL_FLOAT3x3: return sizeof(float3x3);\n case MIRTK_VOXEL_FLOAT3x4: return sizeof(float3x4);\n case MIRTK_VOXEL_FLOAT4x4: return sizeof(float4x4);\n case MIRTK_VOXEL_DOUBLE1: return sizeof(double1);\n case MIRTK_VOXEL_DOUBLE2: return sizeof(double2);\n case MIRTK_VOXEL_DOUBLE3: return sizeof(double3);\n case MIRTK_VOXEL_DOUBLE4: return sizeof(double4);\n case MIRTK_VOXEL_DOUBLE2x2: return sizeof(double2x2);\n case MIRTK_VOXEL_DOUBLE3x3: return sizeof(double3x3);\n case MIRTK_VOXEL_DOUBLE3x4: return sizeof(double3x4);\n case MIRTK_VOXEL_DOUBLE4x4: return sizeof(double4x4);\n default: return 0;\n }\n}\n\n\n} \/\/ namespace mirtk\n<|endoftext|>"} {"text":"<commit_before>\/\/ -*- mode:C++; tab-width:8; c-basic-offset:2; indent-tabs-mode:t -*- \n\/\/ vim: ts=8 sw=2 smarttab\n\/*\n * Ceph - scalable distributed file system\n *\n * Copyright (C) 2004-2009 Sage Weil <sage@newdream.net>\n *\n * This is free software; you can redistribute it and\/or\n * modify it under the terms of the GNU Lesser General Public\n * License version 2.1, as published by the Free Software \n * Foundation. See file COPYING.\n * \n *\/\n\nusing namespace std;\n\n#include \"common\/config.h\"\n\n#include \"common\/ConfUtils.h\"\n#include \"common\/ceph_argparse.h\"\n#include \"global\/global_context.h\"\n#include \"global\/global_init.h\"\n#include \"auth\/Crypto.h\"\n#include \"auth\/Auth.h\"\n#include \"auth\/KeyRing.h\"\n\n#include <sstream>\n\nvoid usage()\n{\n cout << \"usage: cauthtool keyringfile [OPTIONS]...\\n\"\n << \"where the options are:\\n\"\n << \" -l, --list will list all keys and capabilities present in\\n\"\n << \" the keyring\\n\"\n << \" -p, --print will print an encoded key for the specified\\n\"\n << \" entityname. This is suitable for the\\n\"\n << \" 'mount -o secret=..' argument\\n\"\n << \" -C, --create-keyring will create a new keyring, overwriting any\\n\"\n << \" existing keyringfile\\n\"\n << \" --gen-key will generate a new secret key for the\\n\"\n << \" specified entityname\\n\"\n << \" --add-key will add an encoded key to the keyring\\n\"\n << \" --cap subsystem capability will set the capability for given subsystem\\n\"\n << \" --caps capsfile will set all of capabilities associated with a\\n\"\n << \" given key, for all subsystems\\n\"\n << \" -b, --bin will create a binary formatted keyring\" << std::endl;\n exit(1);\n}\n\nint main(int argc, const char **argv)\n{\n vector<const char*> args;\n argv_to_vec(argc, argv, args);\n env_to_vec(args);\n DEFINE_CONF_VARS(usage);\n\n global_init(args, CEPH_ENTITY_TYPE_CLIENT, CODE_ENVIRONMENT_UTILITY,\n\t CINIT_FLAG_NO_DEFAULT_CONFIG_FILE);\n common_init_finish(g_ceph_context);\n EntityName ename(g_conf->name);\n\n const char *me = argv[0];\n\n const char *fn = 0;\n bool gen_key = false;\n bool gen_print_key = false;\n const char *add_key = 0;\n bool list = false;\n bool print_key = false;\n bool create_keyring = false;\n const char *caps_fn = NULL;\n const char *import_keyring = NULL;\n bool set_auid = false;\n uint64_t auid = CEPH_AUTH_UID_DEFAULT;\n map<string,bufferlist> caps;\n bool bin_keyring = false;\n\n FOR_EACH_ARG(args) {\n if (CEPH_ARGPARSE_EQ(\"gen-key\", 'g')) {\n CEPH_ARGPARSE_SET_ARG_VAL(&gen_key, OPT_BOOL);\n } else if (CEPH_ARGPARSE_EQ(\"gen-print-key\", '\\0')) {\n CEPH_ARGPARSE_SET_ARG_VAL(&gen_print_key, OPT_BOOL);\n } else if (CEPH_ARGPARSE_EQ(\"add-key\", 'a')) {\n CEPH_ARGPARSE_SET_ARG_VAL(&add_key, OPT_STR);\n } else if (CEPH_ARGPARSE_EQ(\"list\", 'l')) {\n CEPH_ARGPARSE_SET_ARG_VAL(&list, OPT_BOOL);\n } else if (CEPH_ARGPARSE_EQ(\"caps\", '\\0')) {\n CEPH_ARGPARSE_SET_ARG_VAL(&caps_fn, OPT_STR);\n } else if (CEPH_ARGPARSE_EQ(\"cap\", '\\0')) {\n const char *key, *val;\n CEPH_ARGPARSE_SET_ARG_VAL(&key, OPT_STR);\n CEPH_ARGPARSE_SET_ARG_VAL(&val, OPT_STR);\n ::encode(val, caps[key]);\n } else if (CEPH_ARGPARSE_EQ(\"print-key\", 'p')) {\n CEPH_ARGPARSE_SET_ARG_VAL(&print_key, OPT_BOOL);\n } else if (CEPH_ARGPARSE_EQ(\"create-keyring\", '\\0')) {\n CEPH_ARGPARSE_SET_ARG_VAL(&create_keyring, OPT_BOOL);\n } else if (CEPH_ARGPARSE_EQ(\"import-keyring\", '\\0')) {\n CEPH_ARGPARSE_SET_ARG_VAL(&import_keyring, OPT_STR);\n } else if (CEPH_ARGPARSE_EQ(\"set-uid\", 'u')) {\n CEPH_ARGPARSE_SET_ARG_VAL(&auid, OPT_LONGLONG);\n set_auid = true;\n } else if (CEPH_ARGPARSE_EQ(\"bin\", 'b')) {\n CEPH_ARGPARSE_SET_ARG_VAL(&bin_keyring, OPT_BOOL);\n } else if (!fn) {\n fn = args[i];\n } else \n usage();\n }\n if (!fn && !gen_print_key) {\n cerr << me << \": must specify filename\" << std::endl;\n usage();\n }\n if (!(gen_key ||\n\tgen_print_key ||\n\tadd_key ||\n\tlist ||\n\tcaps_fn ||\n\tcaps.size() ||\n\tset_auid ||\n\tprint_key ||\n\tcreate_keyring ||\n\timport_keyring)) {\n cerr << \"no command specified\" << std::endl;\n usage();\n }\n if (gen_key && add_key) {\n cerr << \"can't both gen_key and add_key\" << std::endl;\n usage();\n }\t\n\n if (gen_print_key) {\n CryptoKey key;\n key.create(g_ceph_context, CEPH_CRYPTO_AES);\n cout << key << std::endl; \n return 0;\n }\n\n \/\/ keyring --------\n bool modified = false;\n KeyRing keyring;\n\n bufferlist bl;\n int r = 0;\n if (create_keyring) {\n cout << \"creating \" << fn << std::endl;\n modified = true;\n } else {\n std::string err;\n r = bl.read_file(fn, &err);\n if (r >= 0) {\n try {\n\tbufferlist::iterator iter = bl.begin();\n\t::decode(keyring, iter);\n } catch (const buffer::error &err) {\n\tcerr << \"error reading file \" << fn << std::endl;\n\texit(1);\n }\n } else {\n cerr << \"can't open \" << fn << \": \" << err << std::endl;\n exit(1);\n }\n }\n\n \/\/ write commands\n if (import_keyring) {\n KeyRing other;\n bufferlist obl;\n std::string err;\n int r = obl.read_file(import_keyring, &err);\n if (r >= 0) {\n try {\n\tbufferlist::iterator iter = obl.begin();\n\t::decode(other, iter);\n } catch (const buffer::error &err) {\n\tcerr << \"error reading file \" << import_keyring << std::endl;\n\texit(1);\n }\n \n cout << \"importing contents of \" << import_keyring << \" into \" << fn << std::endl;\n \/\/other.print(cout);\n keyring.import(g_ceph_context, other);\n modified = true;\n } else {\n cerr << \"can't open \" << import_keyring << \": \" << err << std::endl;\n exit(1);\n }\n }\n if (gen_key) {\n EntityAuth eauth;\n eauth.key.create(g_ceph_context, CEPH_CRYPTO_AES);\n keyring.add(ename, eauth);\n modified = true;\n }\n if (add_key) {\n EntityAuth eauth;\n string ekey(add_key);\n try {\n eauth.key.decode_base64(ekey);\n } catch (const buffer::error &err) {\n cerr << \"can't decode key '\" << add_key << \"'\" << std::endl;\n exit(1);\n }\n keyring.add(ename, eauth);\n modified = true;\n cout << \"added entity \" << ename << \" auth \" << eauth << std::endl;\n }\n if (caps_fn) {\n ConfFile cf;\n std::deque<std::string> parse_errors;\n if (cf.parse_file(caps_fn, &parse_errors) != 0) {\n cerr << \"could not parse caps file \" << caps_fn << std::endl;\n exit(1);\n }\n complain_about_parse_errors(g_ceph_context, &parse_errors);\n map<string, bufferlist> caps;\n const char *key_names[] = { \"mon\", \"osd\", \"mds\", NULL };\n for (int i=0; key_names[i]; i++) {\n std::string val;\n if (cf.read(\"global\", key_names[i], val) == 0) {\n bufferlist bl;\n ::encode(val, bl);\n string s(key_names[i]);\n caps[s] = bl; \n }\n }\n keyring.set_caps(ename, caps);\n modified = true;\n }\n if (caps.size()) {\n keyring.set_caps(ename, caps);\n modified = true;\n }\n if (set_auid) {\n keyring.set_uid(ename, auid);\n modified = true;\n }\n\n \/\/ read commands\n if (list) {\n keyring.print(cout);\n }\n if (print_key) {\n CryptoKey key;\n if (keyring.get_secret(ename, key)) {\n cout << key << std::endl;\n } else {\n cerr << \"entity \" << ename << \" not found\" << std::endl;\n }\n }\n\n \/\/ write result?\n if (modified) {\n bufferlist bl;\n if (bin_keyring) {\n ::encode(keyring, bl);\n } else {\n keyring.encode_plaintext(bl);\n }\n r = bl.write_file(fn, 0600);\n if (r < 0) {\n cerr << \"could not write \" << fn << std::endl;\n }\n \/\/cout << \"wrote \" << bl.length() << \" bytes to \" << fn << std::endl;\n }\n\n return 0;\n}\n<commit_msg>cauthtool: convert to new-style arg parsing<commit_after>\/\/ -*- mode:C++; tab-width:8; c-basic-offset:2; indent-tabs-mode:t -*- \n\/\/ vim: ts=8 sw=2 smarttab\n\/*\n * Ceph - scalable distributed file system\n *\n * Copyright (C) 2004-2009 Sage Weil <sage@newdream.net>\n *\n * This is free software; you can redistribute it and\/or\n * modify it under the terms of the GNU Lesser General Public\n * License version 2.1, as published by the Free Software \n * Foundation. See file COPYING.\n * \n *\/\n\nusing namespace std;\n\n#include \"common\/config.h\"\n#include \"common\/strtol.h\"\n\n#include \"common\/ConfUtils.h\"\n#include \"common\/ceph_argparse.h\"\n#include \"global\/global_context.h\"\n#include \"global\/global_init.h\"\n#include \"auth\/Crypto.h\"\n#include \"auth\/Auth.h\"\n#include \"auth\/KeyRing.h\"\n\n#include <sstream>\n\nvoid usage()\n{\n cout << \"usage: cauthtool keyringfile [OPTIONS]...\\n\"\n << \"where the options are:\\n\"\n << \" -l, --list will list all keys and capabilities present in\\n\"\n << \" the keyring\\n\"\n << \" -p, --print will print an encoded key for the specified\\n\"\n << \" entityname. This is suitable for the\\n\"\n << \" 'mount -o secret=..' argument\\n\"\n << \" -C, --create-keyring will create a new keyring, overwriting any\\n\"\n << \" existing keyringfile\\n\"\n << \" --gen-key will generate a new secret key for the\\n\"\n << \" specified entityname\\n\"\n << \" --add-key will add an encoded key to the keyring\\n\"\n << \" --cap subsystem capability will set the capability for given subsystem\\n\"\n << \" --caps capsfile will set all of capabilities associated with a\\n\"\n << \" given key, for all subsystems\\n\"\n << \" -b, --bin will create a binary formatted keyring\" << std::endl;\n exit(1);\n}\n\nint main(int argc, const char **argv)\n{\n vector<const char*> args;\n argv_to_vec(argc, argv, args);\n env_to_vec(args);\n\n bool gen_key = false;\n bool gen_print_key = false;\n std::string add_key;\n bool list = false;\n bool print_key = false;\n bool create_keyring = false;\n std::string caps_fn;\n std::string import_keyring;\n bool set_auid = false;\n uint64_t auid = CEPH_AUTH_UID_DEFAULT;\n map<string,bufferlist> caps;\n bool bin_keyring = false;\n std::string fn;\n\n global_init(args, CEPH_ENTITY_TYPE_CLIENT, CODE_ENVIRONMENT_UTILITY,\n\t CINIT_FLAG_NO_DEFAULT_CONFIG_FILE);\n std::vector<const char*>::iterator i;\n for (i = args.begin(); i != args.end(); ) {\n std::string val;\n if (ceph_argparse_double_dash(args, i)) {\n break;\n } else if (ceph_argparse_flag(args, i, \"-g\", \"--gen-key\", (char*)NULL)) {\n gen_key = true;\n } else if (ceph_argparse_flag(args, i, \"--gen-print-key\", (char*)NULL)) {\n gen_print_key = true;\n } else if (ceph_argparse_witharg(args, i, &val, \"-a\", \"--add-key\", (char*)NULL)) {\n add_key = val;\n } else if (ceph_argparse_flag(args, i, &val, \"-l\", \"--list\", (char*)NULL)) {\n list = true;\n } else if (ceph_argparse_witharg(args, i, &val, \"--caps\", (char*)NULL)) {\n caps_fn = val;\n } else if (ceph_argparse_witharg(args, i, &val, \"--cap\", (char*)NULL)) {\n std::string my_key = val;\n if (i == args.end()) {\n\tcerr << \"must give two arguments to --cap: key and val.\" << std::endl;\n\texit(1);\n }\n std::string my_val = *i;\n ++i;\n ::encode(my_val, caps[my_key]);\n } else if (ceph_argparse_flag(args, i, \"-p\", \"--print-key\", (char*)NULL)) {\n print_key = true;\n } else if (ceph_argparse_flag(args, i, \"--create-keyring\", (char*)NULL)) {\n create_keyring = true;\n } else if (ceph_argparse_witharg(args, i, &val, \"--import-keyring\", (char*)NULL)) {\n import_keyring = val;\n } else if (ceph_argparse_witharg(args, i, &val, \"-u\", \"--set-uid\", (char*)NULL)) {\n std::string err;\n auid = strict_strtoll(val.c_str(), 10, &err);\n if (!err.empty()) {\n\tcerr << \"error parsing UID: \" << err << std::endl;\n\texit(1);\n }\n set_auid = true;\n } else if (ceph_argparse_flag(args, i, \"-b\", \"--bin\", (char*)NULL)) {\n bin_keyring = true;\n } else if (fn.empty()) {\n fn = *i++;\n } else {\n usage();\n }\n }\n if (fn.empty() && !gen_print_key) {\n cerr << argv[0] << \": must specify filename\" << std::endl;\n usage();\n }\n if (!(gen_key ||\n\tgen_print_key ||\n\t!add_key.empty() ||\n\tlist ||\n\t!caps_fn.empty() ||\n\tcaps.size() ||\n\tset_auid ||\n\tprint_key ||\n\tcreate_keyring ||\n\t!import_keyring.empty())) {\n cerr << \"no command specified\" << std::endl;\n usage();\n }\n if (gen_key && (!add_key.empty())) {\n cerr << \"can't both gen_key and add_key\" << std::endl;\n usage();\n }\t\n\n common_init_finish(g_ceph_context);\n EntityName ename(g_conf->name);\n\n if (gen_print_key) {\n CryptoKey key;\n key.create(g_ceph_context, CEPH_CRYPTO_AES);\n cout << key << std::endl; \n return 0;\n }\n\n \/\/ keyring --------\n bool modified = false;\n KeyRing keyring;\n\n bufferlist bl;\n int r = 0;\n if (create_keyring) {\n cout << \"creating \" << fn << std::endl;\n modified = true;\n } else {\n std::string err;\n r = bl.read_file(fn.c_str(), &err);\n if (r >= 0) {\n try {\n\tbufferlist::iterator iter = bl.begin();\n\t::decode(keyring, iter);\n } catch (const buffer::error &err) {\n\tcerr << \"error reading file \" << fn << std::endl;\n\texit(1);\n }\n } else {\n cerr << \"can't open \" << fn << \": \" << err << std::endl;\n exit(1);\n }\n }\n\n \/\/ write commands\n if (!import_keyring.empty()) {\n KeyRing other;\n bufferlist obl;\n std::string err;\n int r = obl.read_file(import_keyring.c_str(), &err);\n if (r >= 0) {\n try {\n\tbufferlist::iterator iter = obl.begin();\n\t::decode(other, iter);\n } catch (const buffer::error &err) {\n\tcerr << \"error reading file \" << import_keyring << std::endl;\n\texit(1);\n }\n \n cout << \"importing contents of \" << import_keyring << \" into \" << fn << std::endl;\n \/\/other.print(cout);\n keyring.import(g_ceph_context, other);\n modified = true;\n } else {\n cerr << \"can't open \" << import_keyring << \": \" << err << std::endl;\n exit(1);\n }\n }\n if (gen_key) {\n EntityAuth eauth;\n eauth.key.create(g_ceph_context, CEPH_CRYPTO_AES);\n keyring.add(ename, eauth);\n modified = true;\n }\n if (!add_key.empty()) {\n EntityAuth eauth;\n try {\n eauth.key.decode_base64(add_key);\n } catch (const buffer::error &err) {\n cerr << \"can't decode key '\" << add_key << \"'\" << std::endl;\n exit(1);\n }\n keyring.add(ename, eauth);\n modified = true;\n cout << \"added entity \" << ename << \" auth \" << eauth << std::endl;\n }\n if (!caps_fn.empty()) {\n ConfFile cf;\n std::deque<std::string> parse_errors;\n if (cf.parse_file(caps_fn, &parse_errors) != 0) {\n cerr << \"could not parse caps file \" << caps_fn << std::endl;\n exit(1);\n }\n complain_about_parse_errors(g_ceph_context, &parse_errors);\n map<string, bufferlist> caps;\n const char *key_names[] = { \"mon\", \"osd\", \"mds\", NULL };\n for (int i=0; key_names[i]; i++) {\n std::string val;\n if (cf.read(\"global\", key_names[i], val) == 0) {\n bufferlist bl;\n ::encode(val, bl);\n string s(key_names[i]);\n caps[s] = bl; \n }\n }\n keyring.set_caps(ename, caps);\n modified = true;\n }\n if (caps.size()) {\n keyring.set_caps(ename, caps);\n modified = true;\n }\n if (set_auid) {\n keyring.set_uid(ename, auid);\n modified = true;\n }\n\n \/\/ read commands\n if (list) {\n keyring.print(cout);\n }\n if (print_key) {\n CryptoKey key;\n if (keyring.get_secret(ename, key)) {\n cout << key << std::endl;\n } else {\n cerr << \"entity \" << ename << \" not found\" << std::endl;\n }\n }\n\n \/\/ write result?\n if (modified) {\n bufferlist bl;\n if (bin_keyring) {\n ::encode(keyring, bl);\n } else {\n keyring.encode_plaintext(bl);\n }\n r = bl.write_file(fn.c_str(), 0600);\n if (r < 0) {\n cerr << \"could not write \" << fn << std::endl;\n }\n \/\/cout << \"wrote \" << bl.length() << \" bytes to \" << fn << std::endl;\n }\n\n return 0;\n}\n<|endoftext|>"} {"text":"<commit_before>\/\/\n\/\/ C++ Interface: BuiltinFuncs\n\/\/\n\/\/ Description: \n\/\/\n\/\/\n\/\/ Author: Carmelo Piccione <carmelo.piccione@gmail.com>, (C) 2007\n\/\/\n\/\/ Copyright: See COPYING file that comes with this distribution\n\/\/\n\/\/\n\n#ifndef _BUILTIN_FUNCS_HPP\n#define _BUILTIN_FUNCS_HPP\n\n#include \"Common.hpp\"\n#include \"Func.hpp\"\n#include <cmath>\n#include <cstdlib>\n#include <cassert>\n\n#include \"RandomNumberGenerators.hpp\"\n\n\/* Wrappers for all the builtin functions\n The arg_list pointer is a list of floats. Its\n size is equal to the number of arguments the parameter\n takes *\/\nclass FuncWrappers {\n\n\/* Values to optimize the sigmoid function *\/\nstatic const int R = 32767;\nstatic const int RR = 65534;\n\npublic:\n\nstatic inline float int_wrapper(float * arg_list) {\n\nreturn floor(arg_list[0]);\n\n}\n\n\nstatic inline float sqr_wrapper(float * arg_list) {\n\nreturn pow(2, arg_list[0]);\n}\n\n\nstatic inline float sign_wrapper(float * arg_list) {\n\nreturn -arg_list[0];\n}\n\nstatic inline float min_wrapper(float * arg_list) {\n\nif (arg_list[0] > arg_list[1])\nreturn arg_list[1];\n\nreturn arg_list[0];\n}\n\nstatic inline float max_wrapper(float * arg_list) {\n\nif (arg_list[0] > arg_list[1])\nreturn arg_list[0];\n\nreturn arg_list[1];\n}\n\n\/* consult your AI book *\/\nstatic inline float sigmoid_wrapper(float * arg_list) {\nreturn (RR \/ (1 + exp( -(((float)(arg_list[0])) * arg_list[1]) \/ R) - R));\n}\n\n\nstatic inline float bor_wrapper(float * arg_list) {\n\nreturn (float)((int)arg_list[0] || (int)arg_list[1]);\n}\n\nstatic inline float band_wrapper(float * arg_list) {\nreturn (float)((int)arg_list[0] && (int)arg_list[1]);\n}\n\nstatic inline float bnot_wrapper(float * arg_list) {\nreturn (float)(!(int)arg_list[0]);\n}\n\nstatic inline float if_wrapper(float * arg_list) {\n\nif ((int)arg_list[0] == 0)\nreturn arg_list[2];\nreturn arg_list[1];\n}\n\n\nstatic inline float rand_wrapper(float * arg_list) {\nfloat l=1;\n\n\/\/ printf(\"RAND ARG:(%d)\\n\", (int)arg_list[0]);\nif ((int)arg_list[0] > 0)\n\tl = (float) RandomNumberGenerators::uniformInteger((int)arg_list[0]);\n\nreturn l;\n}\n\nstatic inline float equal_wrapper(float * arg_list) {\n\treturn (arg_list[0] == arg_list[1]);\n}\n\n\nstatic inline float above_wrapper(float * arg_list) {\n\nreturn (arg_list[0] > arg_list[1]);\n}\n\n\nstatic inline float below_wrapper(float * arg_list) {\n\nreturn (arg_list[0] < arg_list[1]);\n}\n\nstatic float sin_wrapper(float * arg_list) {\n\n assert(arg_list);\n\/\/return .5;\nfloat d = sinf(*arg_list);\nreturn d;\n\/\/return (sin (arg_list[0]));\n}\n\n\nstatic inline float cos_wrapper(float * arg_list) {\nreturn (cos (arg_list[0]));\n}\n\nstatic inline float tan_wrapper(float * arg_list) {\nreturn (tan(arg_list[0]));\n}\n\nstatic inline float asin_wrapper(float * arg_list) {\nreturn (asin (arg_list[0]));\n}\n\nstatic inline float acos_wrapper(float * arg_list) {\nreturn (acos (arg_list[0]));\n}\n\nstatic inline float atan_wrapper(float * arg_list) {\nreturn (atan (arg_list[0]));\n}\n\nstatic inline float atan2_wrapper(float * arg_list) {\nreturn (atan2 (arg_list[0], arg_list[1]));\n}\n\nstatic inline float pow_wrapper(float * arg_list) {\nreturn (pow (arg_list[0], arg_list[1]));\n}\n\nstatic inline float exp_wrapper(float * arg_list) {\nreturn (exp(arg_list[0]));\n}\n\nstatic inline float abs_wrapper(float * arg_list) {\nreturn (fabs(arg_list[0]));\n}\n\nstatic inline float log_wrapper(float* arg_list) {\nreturn (log (arg_list[0]));\n}\n\nstatic inline float log10_wrapper(float * arg_list) {\nreturn (log10 (arg_list[0]));\n}\n\nstatic inline float sqrt_wrapper(float * arg_list) {\nreturn (sqrt (arg_list[0]));\n}\n\n\nstatic inline float nchoosek_wrapper(float * arg_list) {\nunsigned long cnm = 1UL;\nint i, f;\nint n, m;\n\nn = (int)arg_list[0];\nm = (int)arg_list[1];\n\nif (m*2 >n) m = n-m;\nfor (i=1 ; i <= m; n--, i++)\n{\nif ((f=n) % i == 0)\nf \/= i;\nelse cnm \/= i;\ncnm *= f;\n}\nreturn (float)cnm;\n}\n\n\nstatic inline float fact_wrapper(float * arg_list) {\n\n\nint result = 1;\n\nint n = (int)arg_list[0];\n\nwhile (n > 1) {\nresult = result * n;\nn--;\n}\nreturn (float)result;\n}\n};\n\n#include <map>\nclass BuiltinFuncs {\n\npublic:\n \n static int init_builtin_func_db();\n static int destroy_builtin_func_db();\n static int load_all_builtin_func();\n static int load_builtin_func( const std::string & name, float (*func_ptr)(float*), int num_args );\n\n static int insert_func( Func *func );\n static int remove_func( Func *func );\n static Func *find_func( const std::string & name );\nprivate:\n static std::map<std::string, Func*> builtin_func_tree;\n static volatile bool initialized;\n};\n\n#endif\n<commit_msg>another crucial fix by mastertrenten. --this line, and those below, will be ignored--<commit_after>\/\/\n\/\/ C++ Interface: BuiltinFuncs\n\/\/\n\/\/ Description: \n\/\/\n\/\/\n\/\/ Author: Carmelo Piccione <carmelo.piccione@gmail.com>, (C) 2007\n\/\/\n\/\/ Copyright: See COPYING file that comes with this distribution\n\/\/\n\/\/\n\n#ifndef _BUILTIN_FUNCS_HPP\n#define _BUILTIN_FUNCS_HPP\n\n#include \"Common.hpp\"\n#include \"Func.hpp\"\n#include <cmath>\n#include <cstdlib>\n#include <cassert>\n\n#include \"RandomNumberGenerators.hpp\"\n\n\/* Wrappers for all the builtin functions\n The arg_list pointer is a list of floats. Its\n size is equal to the number of arguments the parameter\n takes *\/\nclass FuncWrappers {\n\n\/* Values to optimize the sigmoid function *\/\nstatic const int R = 32767;\nstatic const int RR = 65534;\n\npublic:\n\nstatic inline float int_wrapper(float * arg_list) {\n\nreturn floor(arg_list[0]);\n\n}\n\n\nstatic inline float sqr_wrapper(float * arg_list) {\n\treturn pow(arg_list[0], 2);\n}\n\n\nstatic inline float sigmoid_wrapper(float * arg_list)\n{\n\tconst double t = (1+exp(-arg_list[0]*arg_list[1]));\n\treturn (fabs(t) > 0.00001) ? 1.0\/t : 0;\n}\n\nstatic inline float sign_wrapper(float * arg_list) {\n\nreturn -arg_list[0];\n}\n\nstatic inline float min_wrapper(float * arg_list) {\n\nif (arg_list[0] > arg_list[1])\nreturn arg_list[1];\n\nreturn arg_list[0];\n}\n\nstatic inline float max_wrapper(float * arg_list) {\n\nif (arg_list[0] > arg_list[1])\nreturn arg_list[0];\n\nreturn arg_list[1];\n}\n\n\nstatic inline float bor_wrapper(float * arg_list) {\n\nreturn (float)((int)arg_list[0] || (int)arg_list[1]);\n}\n\nstatic inline float band_wrapper(float * arg_list) {\nreturn (float)((int)arg_list[0] && (int)arg_list[1]);\n}\n\nstatic inline float bnot_wrapper(float * arg_list) {\nreturn (float)(!(int)arg_list[0]);\n}\n\nstatic inline float if_wrapper(float * arg_list) {\n\nif ((int)arg_list[0] == 0)\nreturn arg_list[2];\nreturn arg_list[1];\n}\n\n\nstatic inline float rand_wrapper(float * arg_list) {\nfloat l=1;\n\n\/\/ printf(\"RAND ARG:(%d)\\n\", (int)arg_list[0]);\nif ((int)arg_list[0] > 0)\n\tl = (float) RandomNumberGenerators::uniformInteger((int)arg_list[0]);\n\nreturn l;\n}\n\nstatic inline float equal_wrapper(float * arg_list) {\n\treturn (arg_list[0] == arg_list[1]);\n}\n\n\nstatic inline float above_wrapper(float * arg_list) {\n\nreturn (arg_list[0] > arg_list[1]);\n}\n\n\nstatic inline float below_wrapper(float * arg_list) {\n\nreturn (arg_list[0] < arg_list[1]);\n}\n\nstatic float sin_wrapper(float * arg_list) {\n\n assert(arg_list);\n\/\/return .5;\nfloat d = sinf(*arg_list);\nreturn d;\n\/\/return (sin (arg_list[0]));\n}\n\n\nstatic inline float cos_wrapper(float * arg_list) {\nreturn (cos (arg_list[0]));\n}\n\nstatic inline float tan_wrapper(float * arg_list) {\nreturn (tan(arg_list[0]));\n}\n\nstatic inline float asin_wrapper(float * arg_list) {\nreturn (asin (arg_list[0]));\n}\n\nstatic inline float acos_wrapper(float * arg_list) {\nreturn (acos (arg_list[0]));\n}\n\nstatic inline float atan_wrapper(float * arg_list) {\nreturn (atan (arg_list[0]));\n}\n\nstatic inline float atan2_wrapper(float * arg_list) {\nreturn (atan2 (arg_list[0], arg_list[1]));\n}\n\nstatic inline float pow_wrapper(float * arg_list) {\nreturn (pow (arg_list[0], arg_list[1]));\n}\n\nstatic inline float exp_wrapper(float * arg_list) {\nreturn (exp(arg_list[0]));\n}\n\nstatic inline float abs_wrapper(float * arg_list) {\nreturn (fabs(arg_list[0]));\n}\n\nstatic inline float log_wrapper(float* arg_list) {\nreturn (log (arg_list[0]));\n}\n\nstatic inline float log10_wrapper(float * arg_list) {\nreturn (log10 (arg_list[0]));\n}\n\nstatic inline float sqrt_wrapper(float * arg_list) {\nreturn (sqrt (arg_list[0]));\n}\n\n\nstatic inline float nchoosek_wrapper(float * arg_list) {\nunsigned long cnm = 1UL;\nint i, f;\nint n, m;\n\nn = (int)arg_list[0];\nm = (int)arg_list[1];\n\nif (m*2 >n) m = n-m;\nfor (i=1 ; i <= m; n--, i++)\n{\nif ((f=n) % i == 0)\nf \/= i;\nelse cnm \/= i;\ncnm *= f;\n}\nreturn (float)cnm;\n}\n\n\nstatic inline float fact_wrapper(float * arg_list) {\n\n\nint result = 1;\n\nint n = (int)arg_list[0];\n\nwhile (n > 1) {\nresult = result * n;\nn--;\n}\nreturn (float)result;\n}\n};\n\n#include <map>\nclass BuiltinFuncs {\n\npublic:\n \n static int init_builtin_func_db();\n static int destroy_builtin_func_db();\n static int load_all_builtin_func();\n static int load_builtin_func( const std::string & name, float (*func_ptr)(float*), int num_args );\n\n static int insert_func( Func *func );\n static int remove_func( Func *func );\n static Func *find_func( const std::string & name );\nprivate:\n static std::map<std::string, Func*> builtin_func_tree;\n static volatile bool initialized;\n};\n\n#endif\n<|endoftext|>"} {"text":"<commit_before><commit_msg>Hardcoding version string for lef to 5.8<commit_after><|endoftext|>"} {"text":"<commit_before>\/**\n * @file\n *\n * @brief Some common functions in use for testing framework\n *\n * @copyright BSD License (see LICENSE.md or https:\/\/www.libelektra.org)\n *\/\n\n#ifndef KDB_TESTS_HPP\n#define KDB_TESTS_HPP\n\n#include <kdb.hpp>\n#include <key.hpp>\n#include <keyset.hpp>\n\n#include <cstdlib>\n#include <cstring>\n#include <exception>\n#include <iostream>\n#include <string>\n\n#include <gtest\/gtest.h>\n\nusing namespace std;\nusing namespace kdb;\n\n#define succeed_if(x, y) ASSERT_TRUE (x) << y;\n#define exit_if_fail(x, y) ASSERT_TRUE (x) << y;\n#define succeed_if_same(x, y, message) ASSERT_EQ (x, y) << message;\n\n#endif\n<commit_msg>Tests: Remove trailing semicolons from macros<commit_after>\/**\n * @file\n *\n * @brief Some common functions in use for testing framework\n *\n * @copyright BSD License (see LICENSE.md or https:\/\/www.libelektra.org)\n *\/\n\n#ifndef KDB_TESTS_HPP\n#define KDB_TESTS_HPP\n\n#include <kdb.hpp>\n#include <key.hpp>\n#include <keyset.hpp>\n\n#include <cstdlib>\n#include <cstring>\n#include <exception>\n#include <iostream>\n#include <string>\n\n#include <gtest\/gtest.h>\n\nusing namespace std;\nusing namespace kdb;\n\n#define succeed_if(x, y) ASSERT_TRUE (x) << y\n#define exit_if_fail(x, y) ASSERT_TRUE (x) << y\n#define succeed_if_same(x, y, message) ASSERT_EQ (x, y) << message\n\n#endif\n<|endoftext|>"} {"text":"<commit_before>#include \"GHIElectronics_TinyCLR_Devices.h\"\n\nTinyCLR_Result Interop_GHIElectronics_TinyCLR_Devices_GHIElectronics_TinyCLR_Devices_Can_Provider_CanControllerApiWrapper::get_WriteBufferSize___I4(const TinyCLR_Interop_MethodData md) {\n\n\n return TinyCLR_Result::NotImplemented;\n}\n\nTinyCLR_Result Interop_GHIElectronics_TinyCLR_Devices_GHIElectronics_TinyCLR_Devices_Can_Provider_CanControllerApiWrapper::set_WriteBufferSize___VOID__I4(const TinyCLR_Interop_MethodData md) {\n\n\n return TinyCLR_Result::NotImplemented;\n}\n\nTinyCLR_Result Interop_GHIElectronics_TinyCLR_Devices_GHIElectronics_TinyCLR_Devices_Can_Provider_CanControllerApiWrapper::get_ReadBufferSize___I4(const TinyCLR_Interop_MethodData md) {\n\n\n return TinyCLR_Result::NotImplemented;\n}\n\nTinyCLR_Result Interop_GHIElectronics_TinyCLR_Devices_GHIElectronics_TinyCLR_Devices_Can_Provider_CanControllerApiWrapper::set_ReadBufferSize___VOID__I4(const TinyCLR_Interop_MethodData md) {\n\n\n return TinyCLR_Result::NotImplemented;\n}\n\nTinyCLR_Result Interop_GHIElectronics_TinyCLR_Devices_GHIElectronics_TinyCLR_Devices_Can_Provider_CanControllerApiWrapper::get_MessagesToWrite___I4(const TinyCLR_Interop_MethodData md) {\n\n\n return TinyCLR_Result::NotImplemented;\n}\n\nTinyCLR_Result Interop_GHIElectronics_TinyCLR_Devices_GHIElectronics_TinyCLR_Devices_Can_Provider_CanControllerApiWrapper::get_MessagesToRead___I4(const TinyCLR_Interop_MethodData md) {\n\n\n return TinyCLR_Result::NotImplemented;\n}\n\nTinyCLR_Result Interop_GHIElectronics_TinyCLR_Devices_GHIElectronics_TinyCLR_Devices_Can_Provider_CanControllerApiWrapper::get_CanWriteMessage___BOOLEAN(const TinyCLR_Interop_MethodData md) {\n\n\n return TinyCLR_Result::NotImplemented;\n}\n\nTinyCLR_Result Interop_GHIElectronics_TinyCLR_Devices_GHIElectronics_TinyCLR_Devices_Can_Provider_CanControllerApiWrapper::get_CanReadMessage___BOOLEAN(const TinyCLR_Interop_MethodData md) {\n\n\n return TinyCLR_Result::NotImplemented;\n}\n\nTinyCLR_Result Interop_GHIElectronics_TinyCLR_Devices_GHIElectronics_TinyCLR_Devices_Can_Provider_CanControllerApiWrapper::get_WriteErrorCount___I4(const TinyCLR_Interop_MethodData md) {\n\n\n return TinyCLR_Result::NotImplemented;\n}\n\nTinyCLR_Result Interop_GHIElectronics_TinyCLR_Devices_GHIElectronics_TinyCLR_Devices_Can_Provider_CanControllerApiWrapper::get_ReadErrorCount___I4(const TinyCLR_Interop_MethodData md) {\n\n\n return TinyCLR_Result::NotImplemented;\n}\n\nTinyCLR_Result Interop_GHIElectronics_TinyCLR_Devices_GHIElectronics_TinyCLR_Devices_Can_Provider_CanControllerApiWrapper::get_SourceClock___I4(const TinyCLR_Interop_MethodData md) {\n\n\n return TinyCLR_Result::NotImplemented;\n}\n\nTinyCLR_Result Interop_GHIElectronics_TinyCLR_Devices_GHIElectronics_TinyCLR_Devices_Can_Provider_CanControllerApiWrapper::Enable___VOID(const TinyCLR_Interop_MethodData md) {\n\n\n return TinyCLR_Result::NotImplemented;\n}\n\nTinyCLR_Result Interop_GHIElectronics_TinyCLR_Devices_GHIElectronics_TinyCLR_Devices_Can_Provider_CanControllerApiWrapper::Disable___VOID(const TinyCLR_Interop_MethodData md) {\n\n\n return TinyCLR_Result::NotImplemented;\n}\n\nTinyCLR_Result Interop_GHIElectronics_TinyCLR_Devices_GHIElectronics_TinyCLR_Devices_Can_Provider_CanControllerApiWrapper::WriteMessages___I4__SZARRAY_GHIElectronicsTinyCLRDevicesCanCanMessage__I4__I4(const TinyCLR_Interop_MethodData md) {\n\n\n return TinyCLR_Result::NotImplemented;\n}\n\nTinyCLR_Result Interop_GHIElectronics_TinyCLR_Devices_GHIElectronics_TinyCLR_Devices_Can_Provider_CanControllerApiWrapper::ReadMessages___I4__SZARRAY_GHIElectronicsTinyCLRDevicesCanCanMessage__I4__I4(const TinyCLR_Interop_MethodData md) {\n\n\n return TinyCLR_Result::NotImplemented;\n}\n\nTinyCLR_Result Interop_GHIElectronics_TinyCLR_Devices_GHIElectronics_TinyCLR_Devices_Can_Provider_CanControllerApiWrapper::SetBitTiming___VOID__GHIElectronicsTinyCLRDevicesCanCanBitTiming(const TinyCLR_Interop_MethodData md) {\n\n\n return TinyCLR_Result::NotImplemented;\n}\n\nTinyCLR_Result Interop_GHIElectronics_TinyCLR_Devices_GHIElectronics_TinyCLR_Devices_Can_Provider_CanControllerApiWrapper::SetExplicitFilters___VOID__SZARRAY_I4(const TinyCLR_Interop_MethodData md) {\n\n\n return TinyCLR_Result::NotImplemented;\n}\n\nTinyCLR_Result Interop_GHIElectronics_TinyCLR_Devices_GHIElectronics_TinyCLR_Devices_Can_Provider_CanControllerApiWrapper::SetGroupFilters___VOID__SZARRAY_I4__SZARRAY_I4(const TinyCLR_Interop_MethodData md) {\n\n\n return TinyCLR_Result::NotImplemented;\n}\n\nTinyCLR_Result Interop_GHIElectronics_TinyCLR_Devices_GHIElectronics_TinyCLR_Devices_Can_Provider_CanControllerApiWrapper::ClearWriteBuffer___VOID(const TinyCLR_Interop_MethodData md) {\n\n\n return TinyCLR_Result::NotImplemented;\n}\n\nTinyCLR_Result Interop_GHIElectronics_TinyCLR_Devices_GHIElectronics_TinyCLR_Devices_Can_Provider_CanControllerApiWrapper::ClearReadBuffer___VOID(const TinyCLR_Interop_MethodData md) {\n\n\n return TinyCLR_Result::NotImplemented;\n}\n\nTinyCLR_Result Interop_GHIElectronics_TinyCLR_Devices_GHIElectronics_TinyCLR_Devices_Can_Provider_CanControllerApiWrapper::Acquire___VOID(const TinyCLR_Interop_MethodData md) {\n\n\n return TinyCLR_Result::NotImplemented;\n}\n\nTinyCLR_Result Interop_GHIElectronics_TinyCLR_Devices_GHIElectronics_TinyCLR_Devices_Can_Provider_CanControllerApiWrapper::Release___VOID(const TinyCLR_Interop_MethodData md) {\n\n\n return TinyCLR_Result::NotImplemented;\n}\n<commit_msg>Implement CAN interopt<commit_after>#include \"GHIElectronics_TinyCLR_Devices.h\"\n#include \"GHIElectronics_TinyCLR_InteropUtil.h\"\n\nvoid TinyCLR_Can_ErrorReceivedIsr(const TinyCLR_Can_Controller* self, TinyCLR_Can_Error error) {\n auto interopProvider = reinterpret_cast<const TinyCLR_Interop_Manager*>(apiManager->FindDefault(apiManager, TinyCLR_Api_Type::InteropManager));\n\n auto controllerIndex = *(reinterpret_cast<int32_t*>(self->ApiInfo->State));\n\n if (interopProvider != nullptr)\n interopProvider->RaiseEvent(interopProvider, \"GHIElectronics.TinyCLR.NativeEventNames.Can.ErrorReceived\", self->ApiInfo->Name, controllerIndex, (uint64_t)error, 0, 0);\n}\n\nvoid TinyCLR_Can_MessageReceivedIsr(const TinyCLR_Can_Controller* self, size_t count) {\n auto interopProvider = reinterpret_cast<const TinyCLR_Interop_Manager*>(apiManager->FindDefault(apiManager, TinyCLR_Api_Type::InteropManager));\n\n auto controllerIndex = *(reinterpret_cast<int32_t*>(self->ApiInfo->State));\n\n if (interopProvider != nullptr)\n interopProvider->RaiseEvent(interopProvider, \"GHIElectronics.TinyCLR.NativeEventNames.Can.MessageReceived\", self->ApiInfo->Name, controllerIndex, (uint64_t)count, 0, 0);\n}\n\nTinyCLR_Result Interop_GHIElectronics_TinyCLR_Devices_GHIElectronics_TinyCLR_Devices_Can_Provider_CanControllerApiWrapper::get_WriteBufferSize___I4(const TinyCLR_Interop_MethodData md) {\n auto provider = reinterpret_cast<const TinyCLR_Can_Controller*>(TinyCLR_Interop_GetArgument(md, FIELD___impl___I));\n auto ret = TinyCLR_Interop_GetReturn(md);\n\n ret.Data.Numeric->I4 = provider->GetWriteBufferSize(provider);\n\n return TinyCLR_Result::Success;\n}\n\nTinyCLR_Result Interop_GHIElectronics_TinyCLR_Devices_GHIElectronics_TinyCLR_Devices_Can_Provider_CanControllerApiWrapper::set_WriteBufferSize___VOID__I4(const TinyCLR_Interop_MethodData md) {\n auto provider = reinterpret_cast<const TinyCLR_Can_Controller*>(TinyCLR_Interop_GetArgument(md, FIELD___impl___I));\n auto arg1 = TinyCLR_Interop_GetArguments(md, 0);\n\n return provider->SetWriteBufferSize(provider, arg1.Data.Numeric->U4);\n}\n\nTinyCLR_Result Interop_GHIElectronics_TinyCLR_Devices_GHIElectronics_TinyCLR_Devices_Can_Provider_CanControllerApiWrapper::get_ReadBufferSize___I4(const TinyCLR_Interop_MethodData md) {\n auto provider = reinterpret_cast<const TinyCLR_Can_Controller*>(TinyCLR_Interop_GetArgument(md, FIELD___impl___I));\n auto ret = TinyCLR_Interop_GetReturn(md);\n\n ret.Data.Numeric->I4 = provider->GetReadBufferSize(provider);\n\n return TinyCLR_Result::Success;\n}\n\nTinyCLR_Result Interop_GHIElectronics_TinyCLR_Devices_GHIElectronics_TinyCLR_Devices_Can_Provider_CanControllerApiWrapper::set_ReadBufferSize___VOID__I4(const TinyCLR_Interop_MethodData md) {\n auto provider = reinterpret_cast<const TinyCLR_Can_Controller*>(TinyCLR_Interop_GetArgument(md, FIELD___impl___I));\n auto arg1 = TinyCLR_Interop_GetArguments(md, 0);\n\n return provider->SetReadBufferSize(provider, arg1.Data.Numeric->U4);\n}\n\nTinyCLR_Result Interop_GHIElectronics_TinyCLR_Devices_GHIElectronics_TinyCLR_Devices_Can_Provider_CanControllerApiWrapper::get_MessagesToWrite___I4(const TinyCLR_Interop_MethodData md) {\n auto provider = reinterpret_cast<const TinyCLR_Can_Controller*>(TinyCLR_Interop_GetArgument(md, FIELD___impl___I));\n auto ret = TinyCLR_Interop_GetReturn(md);\n\n ret.Data.Numeric->I4 = provider->GetMessagesToWrite(provider);\n\n return TinyCLR_Result::Success;\n}\n\nTinyCLR_Result Interop_GHIElectronics_TinyCLR_Devices_GHIElectronics_TinyCLR_Devices_Can_Provider_CanControllerApiWrapper::get_MessagesToRead___I4(const TinyCLR_Interop_MethodData md) {\n auto provider = reinterpret_cast<const TinyCLR_Can_Controller*>(TinyCLR_Interop_GetArgument(md, FIELD___impl___I));\n auto ret = TinyCLR_Interop_GetReturn(md);\n\n ret.Data.Numeric->I4 = provider->GetMessagesToRead(provider);\n\n return TinyCLR_Result::Success;\n}\n\nTinyCLR_Result Interop_GHIElectronics_TinyCLR_Devices_GHIElectronics_TinyCLR_Devices_Can_Provider_CanControllerApiWrapper::get_CanWriteMessage___BOOLEAN(const TinyCLR_Interop_MethodData md) {\n auto provider = reinterpret_cast<const TinyCLR_Can_Controller*>(TinyCLR_Interop_GetArgument(md, FIELD___impl___I));\n auto ret = TinyCLR_Interop_GetReturn(md);\n\n ret.Data.Numeric->Boolean = provider->CanWriteMessage(provider);\n\n return TinyCLR_Result::Success;\n}\n\nTinyCLR_Result Interop_GHIElectronics_TinyCLR_Devices_GHIElectronics_TinyCLR_Devices_Can_Provider_CanControllerApiWrapper::get_CanReadMessage___BOOLEAN(const TinyCLR_Interop_MethodData md) {\n auto provider = reinterpret_cast<const TinyCLR_Can_Controller*>(TinyCLR_Interop_GetArgument(md, FIELD___impl___I));\n auto ret = TinyCLR_Interop_GetReturn(md);\n\n ret.Data.Numeric->Boolean = provider->CanReadMessage(provider);\n\n return TinyCLR_Result::Success;\n}\n\nTinyCLR_Result Interop_GHIElectronics_TinyCLR_Devices_GHIElectronics_TinyCLR_Devices_Can_Provider_CanControllerApiWrapper::get_WriteErrorCount___I4(const TinyCLR_Interop_MethodData md) {\n auto provider = reinterpret_cast<const TinyCLR_Can_Controller*>(TinyCLR_Interop_GetArgument(md, FIELD___impl___I));\n auto ret = TinyCLR_Interop_GetReturn(md);\n\n ret.Data.Numeric->I4 = provider->GetWriteErrorCount(provider);\n\n return TinyCLR_Result::Success;\n}\n\nTinyCLR_Result Interop_GHIElectronics_TinyCLR_Devices_GHIElectronics_TinyCLR_Devices_Can_Provider_CanControllerApiWrapper::get_ReadErrorCount___I4(const TinyCLR_Interop_MethodData md) {\n auto provider = reinterpret_cast<const TinyCLR_Can_Controller*>(TinyCLR_Interop_GetArgument(md, FIELD___impl___I));\n auto ret = TinyCLR_Interop_GetReturn(md);\n\n ret.Data.Numeric->I4 = provider->GetReadErrorCount(provider);\n\n return TinyCLR_Result::Success;\n}\n\nTinyCLR_Result Interop_GHIElectronics_TinyCLR_Devices_GHIElectronics_TinyCLR_Devices_Can_Provider_CanControllerApiWrapper::get_SourceClock___I4(const TinyCLR_Interop_MethodData md) {\n auto provider = reinterpret_cast<const TinyCLR_Can_Controller*>(TinyCLR_Interop_GetArgument(md, FIELD___impl___I));\n auto ret = TinyCLR_Interop_GetReturn(md);\n\n ret.Data.Numeric->I4 = provider->GetSourceClock(provider);\n\n return TinyCLR_Result::Success;\n}\n\nTinyCLR_Result Interop_GHIElectronics_TinyCLR_Devices_GHIElectronics_TinyCLR_Devices_Can_Provider_CanControllerApiWrapper::Enable___VOID(const TinyCLR_Interop_MethodData md) {\n auto provider = reinterpret_cast<const TinyCLR_Can_Controller*>(TinyCLR_Interop_GetArgument(md, FIELD___impl___I));\n\n return provider->Enable(provider);\n}\n\nTinyCLR_Result Interop_GHIElectronics_TinyCLR_Devices_GHIElectronics_TinyCLR_Devices_Can_Provider_CanControllerApiWrapper::Disable___VOID(const TinyCLR_Interop_MethodData md) {\n auto provider = reinterpret_cast<const TinyCLR_Can_Controller*>(TinyCLR_Interop_GetArgument(md, FIELD___impl___I));\n\n return provider->Disable(provider);\n}\n\nTinyCLR_Result Interop_GHIElectronics_TinyCLR_Devices_GHIElectronics_TinyCLR_Devices_Can_Provider_CanControllerApiWrapper::WriteMessages___I4__SZARRAY_GHIElectronicsTinyCLRDevicesCanCanMessage__I4__I4(const TinyCLR_Interop_MethodData md) {\n auto interop = md.InteropManager;\n\n uint8_t* data;\n\n uint32_t arbID;\n\n bool extendedId;\n bool remoteTransmissionRequest;\n\n size_t length;\n\n int32_t offset;\n int32_t count;\n int32_t sent = 0;\n\n const TinyCLR_Interop_ClrObject* msgObj;\n\n TinyCLR_Interop_ClrValue managedValueMessages, managedValueOffset, managedValueCount, ret;\n TinyCLR_Interop_ClrValue fldData, fldarbID, fldLen, fldRtr, fldEid;\n\n managedValueMessages = TinyCLR_Interop_GetArguments(md, 0);\n managedValueOffset = TinyCLR_Interop_GetArguments(md, 1);\n managedValueCount = TinyCLR_Interop_GetArguments(md, 2);\n ret = TinyCLR_Interop_GetReturn(md);\n\n offset = managedValueOffset.Data.Numeric->I4;\n count = managedValueCount.Data.Numeric->I4;\n\n auto msgArray = reinterpret_cast<TinyCLR_Interop_ClrObjectReference*>(managedValueMessages.Data.SzArray.Data);\n\n auto provider = reinterpret_cast<const TinyCLR_Can_Controller*>(TinyCLR_Interop_GetArgument(md, FIELD___impl___I));\n\n int i = 0;\n\n while (i < offset) {\n i++;\n msgArray++;\n }\n\n for (i = 0; i < count; i++) {\n interop->ExtractObjectFromReference(interop, msgArray, msgObj);\n\n interop->GetField(interop, msgObj, Interop_GHIElectronics_TinyCLR_Devices_GHIElectronics_TinyCLR_Devices_Can_CanMessage::FIELD___data___SZARRAY_U1, fldData);\n interop->GetField(interop, msgObj, Interop_GHIElectronics_TinyCLR_Devices_GHIElectronics_TinyCLR_Devices_Can_CanMessage::FIELD___ArbitrationId__BackingField___I4, fldarbID);\n interop->GetField(interop, msgObj, Interop_GHIElectronics_TinyCLR_Devices_GHIElectronics_TinyCLR_Devices_Can_CanMessage::FIELD___Length__BackingField___I4, fldLen);\n interop->GetField(interop, msgObj, Interop_GHIElectronics_TinyCLR_Devices_GHIElectronics_TinyCLR_Devices_Can_CanMessage::FIELD___IsRemoteTransmissionRequest__BackingField___BOOLEAN, fldRtr);\n interop->GetField(interop, msgObj, Interop_GHIElectronics_TinyCLR_Devices_GHIElectronics_TinyCLR_Devices_Can_CanMessage::FIELD___IsExtendedId__BackingField___BOOLEAN, fldEid);\n\n data = reinterpret_cast<uint8_t*>(fldData.Data.SzArray.Data);\n arbID = fldarbID.Data.Numeric->I4;\n length = fldLen.Data.Numeric->I4 & 0xFF;\n\n remoteTransmissionRequest = (fldRtr.Data.Numeric->I4 != 0) ? true : false;\n extendedId = (fldEid.Data.Numeric->I4 != 0) ? true : false;\n\n if (provider->WriteMessage(provider, arbID, extendedId, remoteTransmissionRequest, data, length) != TinyCLR_Result::Success)\n break;\n\n msgArray++;\n sent++;\n }\n\n ret.Data.Numeric->I4 = sent;\n\n return TinyCLR_Result::Success;\n}\n\nTinyCLR_Result Interop_GHIElectronics_TinyCLR_Devices_GHIElectronics_TinyCLR_Devices_Can_Provider_CanControllerApiWrapper::ReadMessages___I4__SZARRAY_GHIElectronicsTinyCLRDevicesCanCanMessage__I4__I4(const TinyCLR_Interop_MethodData md) {\n auto interop = md.InteropManager;\n\n uint8_t* data;\n\n uint32_t arbID;\n size_t length;\n\n bool extendedId;\n bool remoteTransmissionRequest;\n\n uint64_t ts;\n\n int32_t offset;\n int32_t count;\n int32_t sent = 0;\n\n const TinyCLR_Interop_ClrObject* msgObj;\n\n TinyCLR_Interop_ClrValue managedValueMessages, managedValueOffset, managedValueCount, ret;\n TinyCLR_Interop_ClrValue fldData, fldarbID, fldLen, fldRtr, fldEid, fldts;\n\n managedValueMessages = TinyCLR_Interop_GetArguments(md, 0);\n managedValueOffset = TinyCLR_Interop_GetArguments(md, 1);\n managedValueCount = TinyCLR_Interop_GetArguments(md, 2);\n ret = TinyCLR_Interop_GetReturn(md);\n\n offset = managedValueOffset.Data.Numeric->I4;\n count = managedValueCount.Data.Numeric->I4;\n\n auto msgArray = reinterpret_cast<TinyCLR_Interop_ClrObjectReference*>(managedValueMessages.Data.SzArray.Data);\n\n auto provider = reinterpret_cast<const TinyCLR_Can_Controller*>(TinyCLR_Interop_GetArgument(md, FIELD___impl___I));\n\n auto availableMsgCount = provider->GetMessagesToRead(provider);\n\n int32_t read = 0;\n\n if (availableMsgCount > count)\n availableMsgCount = count;\n\n int i = 0;\n\n while (i < offset) {\n i++;\n msgArray++;\n }\n\n for (i = 0; i < availableMsgCount; i++) {\n interop->ExtractObjectFromReference(interop, msgArray, msgObj);\n\n interop->GetField(interop, msgObj, Interop_GHIElectronics_TinyCLR_Devices_GHIElectronics_TinyCLR_Devices_Can_CanMessage::FIELD___data___SZARRAY_U1, fldData);\n interop->GetField(interop, msgObj, Interop_GHIElectronics_TinyCLR_Devices_GHIElectronics_TinyCLR_Devices_Can_CanMessage::FIELD___ArbitrationId__BackingField___I4, fldarbID);\n interop->GetField(interop, msgObj, Interop_GHIElectronics_TinyCLR_Devices_GHIElectronics_TinyCLR_Devices_Can_CanMessage::FIELD___Length__BackingField___I4, fldLen);\n interop->GetField(interop, msgObj, Interop_GHIElectronics_TinyCLR_Devices_GHIElectronics_TinyCLR_Devices_Can_CanMessage::FIELD___IsRemoteTransmissionRequest__BackingField___BOOLEAN, fldRtr);\n interop->GetField(interop, msgObj, Interop_GHIElectronics_TinyCLR_Devices_GHIElectronics_TinyCLR_Devices_Can_CanMessage::FIELD___IsExtendedId__BackingField___BOOLEAN, fldEid);\n interop->GetField(interop, msgObj, Interop_GHIElectronics_TinyCLR_Devices_GHIElectronics_TinyCLR_Devices_Can_CanMessage::FIELD___TimeStamp__BackingField___mscorlibSystemDateTime, fldts);\n\n data = reinterpret_cast<uint8_t*>(fldData.Data.SzArray.Data);\n\n if (provider->ReadMessage(provider, arbID, extendedId, remoteTransmissionRequest, data, length, ts) != TinyCLR_Result::Success)\n break;\n\n fldarbID.Data.Numeric->I4 = arbID;\n fldLen.Data.Numeric->I4 = length & 0xF;\n fldRtr.Data.Numeric->I4 = (remoteTransmissionRequest != false) ? 1 : 0;\n fldEid.Data.Numeric->I4 = (extendedId != false) ? 1 : 0;\n fldts.Data.Numeric->I8 = ts;\n\n read++;\n msgArray++;\n }\n\n ret.Data.Numeric->I4 = read;\n\n return TinyCLR_Result::Success;\n}\n\nTinyCLR_Result Interop_GHIElectronics_TinyCLR_Devices_GHIElectronics_TinyCLR_Devices_Can_Provider_CanControllerApiWrapper::SetBitTiming___VOID__GHIElectronicsTinyCLRDevicesCanCanBitTiming(const TinyCLR_Interop_MethodData md) {\n auto arg = TinyCLR_Interop_GetArguments(md, 0);\n auto arg1 = TinyCLR_Interop_GetField(md, arg.Object, Interop_GHIElectronics_TinyCLR_Devices_GHIElectronics_TinyCLR_Devices_Can_CanBitTiming::FIELD___Propagation__BackingField___I4);\n auto arg2 = TinyCLR_Interop_GetField(md, arg.Object, Interop_GHIElectronics_TinyCLR_Devices_GHIElectronics_TinyCLR_Devices_Can_CanBitTiming::FIELD___Phase1__BackingField___I4);\n auto arg3 = TinyCLR_Interop_GetField(md, arg.Object, Interop_GHIElectronics_TinyCLR_Devices_GHIElectronics_TinyCLR_Devices_Can_CanBitTiming::FIELD___Phase2__BackingField___I4);\n auto arg4 = TinyCLR_Interop_GetField(md, arg.Object, Interop_GHIElectronics_TinyCLR_Devices_GHIElectronics_TinyCLR_Devices_Can_CanBitTiming::FIELD___BaudratePrescaler__BackingField___I4);\n auto arg5 = TinyCLR_Interop_GetField(md, arg.Object, Interop_GHIElectronics_TinyCLR_Devices_GHIElectronics_TinyCLR_Devices_Can_CanBitTiming::FIELD___SynchronizationJumpWidth__BackingField___I4);\n auto arg6 = TinyCLR_Interop_GetField(md, arg.Object, Interop_GHIElectronics_TinyCLR_Devices_GHIElectronics_TinyCLR_Devices_Can_CanBitTiming::FIELD___UseMultiBitSampling__BackingField___BOOLEAN);\n\n auto provider = reinterpret_cast<const TinyCLR_Can_Controller*>(TinyCLR_Interop_GetArgument(md, FIELD___impl___I));\n\n int32_t propagation = arg1.Data.Numeric->I4;\n int32_t phase1 = arg2.Data.Numeric->I4;\n int32_t phase2 = arg3.Data.Numeric->I4;\n\n int32_t brp = arg4.Data.Numeric->I4;\n int32_t synchronizationJumpWidth = arg5.Data.Numeric->I4;\n int32_t useMultiBitSampling = arg6.Data.Numeric->Boolean;\n\n return provider->SetBitTiming(provider, propagation, phase1, phase2, brp, synchronizationJumpWidth, useMultiBitSampling);\n}\n\nTinyCLR_Result Interop_GHIElectronics_TinyCLR_Devices_GHIElectronics_TinyCLR_Devices_Can_Provider_CanControllerApiWrapper::SetExplicitFilters___VOID__SZARRAY_I4(const TinyCLR_Interop_MethodData md) {\n auto provider = reinterpret_cast<const TinyCLR_Can_Controller*>(TinyCLR_Interop_GetArgument(md, FIELD___impl___I));\n auto arg = TinyCLR_Interop_GetArguments(md, 0);\n\n uint32_t* filterData = reinterpret_cast<uint32_t*>(arg.Data.SzArray.Data);\n\n int32_t length = arg.Data.SzArray.Length;\n\n if (filterData == nullptr || length == 0)\n return TinyCLR_Result::NullReference;\n\n return provider->SetExplicitFilters(provider, filterData, length);\n}\n\nTinyCLR_Result Interop_GHIElectronics_TinyCLR_Devices_GHIElectronics_TinyCLR_Devices_Can_Provider_CanControllerApiWrapper::SetGroupFilters___VOID__SZARRAY_I4__SZARRAY_I4(const TinyCLR_Interop_MethodData md) {\n auto provider = reinterpret_cast<const TinyCLR_Can_Controller*>(TinyCLR_Interop_GetArgument(md, FIELD___impl___I));\n\n auto arg0 = TinyCLR_Interop_GetArguments(md, 0);\n auto arg1 = TinyCLR_Interop_GetArguments(md, 1);\n\n uint32_t* lowerBounds = reinterpret_cast<uint32_t*>(arg0.Data.SzArray.Data);\n uint32_t* upperBounds = reinterpret_cast<uint32_t*>(arg1.Data.SzArray.Data);\n\n size_t length = arg0.Data.SzArray.Length;\n\n if (lowerBounds == nullptr || upperBounds == nullptr || length == 0)\n return TinyCLR_Result::NullReference;\n\n return provider->SetGroupFilters(provider, lowerBounds, upperBounds, length);\n}\n\nTinyCLR_Result Interop_GHIElectronics_TinyCLR_Devices_GHIElectronics_TinyCLR_Devices_Can_Provider_CanControllerApiWrapper::ClearWriteBuffer___VOID(const TinyCLR_Interop_MethodData md) {\n auto provider = reinterpret_cast<const TinyCLR_Can_Controller*>(TinyCLR_Interop_GetArgument(md, FIELD___impl___I));\n\n return provider->ClearWriteBuffer(provider);\n}\n\nTinyCLR_Result Interop_GHIElectronics_TinyCLR_Devices_GHIElectronics_TinyCLR_Devices_Can_Provider_CanControllerApiWrapper::ClearReadBuffer___VOID(const TinyCLR_Interop_MethodData md) {\n auto provider = reinterpret_cast<const TinyCLR_Can_Controller*>(TinyCLR_Interop_GetArgument(md, FIELD___impl___I));\n\n return provider->ClearReadBuffer(provider);\n}\n\nTinyCLR_Result Interop_GHIElectronics_TinyCLR_Devices_GHIElectronics_TinyCLR_Devices_Can_Provider_CanControllerApiWrapper::Acquire___VOID(const TinyCLR_Interop_MethodData md) {\n auto provider = reinterpret_cast<const TinyCLR_Can_Controller*>(TinyCLR_Interop_GetArgument(md, FIELD___impl___I));\n\n if (provider != nullptr) {\n if (provider->Acquire(provider) == TinyCLR_Result::Success) {\n provider->SetMessageReceivedHandler(provider, TinyCLR_Can_MessageReceivedIsr);\n provider->SetErrorReceivedHandler(provider, TinyCLR_Can_ErrorReceivedIsr);\n\n return TinyCLR_Result::Success;\n }\n\n return TinyCLR_Result::SharingViolation;\n }\n\n return TinyCLR_Result::ArgumentNull;\n}\n\nTinyCLR_Result Interop_GHIElectronics_TinyCLR_Devices_GHIElectronics_TinyCLR_Devices_Can_Provider_CanControllerApiWrapper::Release___VOID(const TinyCLR_Interop_MethodData md) {\n auto provider = reinterpret_cast<const TinyCLR_Can_Controller*>(TinyCLR_Interop_GetArgument(md, FIELD___impl___I));\n\n return provider->Release(provider);\n}\n<|endoftext|>"} {"text":"<commit_before>#include <iostream>\n#include <vector>\n#include <map>\n#include <node.h>\n#include <cmath>\n\n#include \"PSATResult.h\"\n#include \"calculator\/EstimateFLA.h\"\n#include \"calculator\/MotorCurrent.h\"\n#include \"calculator\/MotorEfficiency.h\"\n#include \"calculator\/MotorPowerFactor.h\"\n#include \"calculator\/OptimalPrePumpEff.h\"\n#include \"calculator\/OptimalSpecificSpeedCorrection.h\"\n#include \"calculator\/OptimalDeviationFactor.h\"\n\nusing namespace v8;\nusing namespace std;\n\nIsolate* iso;\nLocal<Object> inp;\nLocal<Object> r;\n\ndouble Get(const char *nm) {\n\tauto rObj = inp->ToObject()->Get(String::NewFromUtf8(iso,nm));\n\tif (rObj->IsUndefined()) {\n\t\tcout << nm << endl;;\n\t\tassert(!\"defined\");\n\t}\n\treturn rObj->NumberValue();\n}\nvoid SetR(const char *nm, double n) {\n\tr->Set(String::NewFromUtf8(iso,nm),Number::New(iso,n));\n}\n\nMotor::LineFrequency line() {\n\treturn (Motor::LineFrequency)(int)(!Get(\"line\"));\n}\nMotor::EfficiencyClass effCls() {\n\treturn (Motor::EfficiencyClass)(int)Get(\"efficiency_class\");\n}\nPump::Drive drive() {\n\treturn (Pump::Drive)(int)Get(\"drive\");\n}\nPump::Style style() {\n\treturn (Pump::Style)(int)Get(\"pump_style\");\n}\n\nvoid Setup(const FunctionCallbackInfo<Value>& args) {\n\tiso = args.GetIsolate();\n\tinp = args[0]->ToObject();\n\tr = Object::New(iso);\n\targs.GetReturnValue().Set(r);\n}\n\n\nvoid Results(const FunctionCallbackInfo<Value>& args) {\n\tSetup(args);\n\t\n\tPump pump(style(),Get(\"pump_specified\")\/100,Get(\"pump_rated_speed\"),drive(),\n\t\t\tGet(\"viscosity\"),Get(\"specific_gravity\"),Get(\"stages\"),(Pump::Speed)(int)(!Get(\"fixed_speed\")));\n\tMotor motor(line(),Get(\"motor_rated_power\"),Get(\"motor_rated_speed\"),effCls(),\n\t\t\tGet(\"efficiency\"),Get(\"motor_rated_voltage\"),Get(\"motor_rated_flc\"),Get(\"margin\"));\n\tFinancial fin(Get(\"fraction\")\/100,Get(\"cost\"));\n\tFieldData fd(Get(\"flow\"),Get(\"head\"),(FieldData::LoadEstimationMethod)(Get(\"motor_field_power\")>0?0:1),\n\t\t\tGet(\"motor_field_power\"),Get(\"motor_field_current\"),Get(\"motor_field_voltage\"));\n\tPSATResult psat(pump,motor,fin,fd);\n\tpsat.calculateExisting();\n\tpsat.calculateOptimal(); \n\tauto ex = psat.getExisting(), opt = psat.getOptimal();\n\n\tmap<const char *,vector<double>> out = { \n\t\t{\"Pump Efficiency\",{ex.pumpEfficiency_*100,opt.pumpEfficiency_*100}},\n\t\t{\"Motor Rated Power\",{ex.motorRatedPower_,opt.motorRatedPower_}}, \n\t\t{\"Motor Shaft Power\",{ex.motorShaftPower_,opt.motorShaftPower_}},\n\t\t{\"Pump Shaft Power\",{ex.pumpShaftPower_,opt.pumpShaftPower_}}, \n\t\t{\"Motor Efficiency\",{ex.motorEfficiency_,opt.motorEfficiency_}},\n\t\t{\"Motor Power Factor\",{ex.motorPowerFactor_,opt.motorPowerFactor_}},\n\t\t{\"Motor Current\",{ex.motorCurrent_,opt.motorCurrent_}}, \n\t\t{\"Motor Power\", {ex.motorPower_,opt.motorPower_}},\n\t\t{\"Annual Energy\", {ex.annualEnergy_,opt.annualEnergy_}},\n\t\t{\"Annual Cost\", {ex.annualCost_*1000,opt.annualCost_*1000}},\n\t\t{\"Savings Potential\", {psat.getAnnualSavingsPotential()*1000,-1}},\n\t\t{\"Optimization Rating\", {psat.getOptimizationRating(),-1}}\n\t};\n\tfor(auto p: out) { \n\t\tauto a = Array::New(iso);\n\t\ta->Set(0,Number::New(iso,p.second[0]));\n\t\ta->Set(1,Number::New(iso,p.second[1])); \n\t\tr->Set(String::NewFromUtf8(iso,p.first),a);\n\t}\n}\n\nvoid EstFLA(const FunctionCallbackInfo<Value>& args) {\n\tSetup(args);\n\tEstimateFLA fla(Get(\"motor_rated_power\"),Get(\"motor_rated_speed\"),line(),effCls(),\n\t\tGet(\"efficiency\"),Get(\"motor_rated_voltage\"));\n\tfla.calculate(); \n\targs.GetReturnValue().Set(fla.getEstimatedFLA());\n}\n\nvoid MotorPerformance(const FunctionCallbackInfo<Value>& args) {\n\tSetup(args);\n\n\tMotorEfficiency mef(line(),Get(\"motor_rated_speed\"),effCls(),Get(\"efficiency\"),Get(\"motor_rated_power\"),Get(\"load_factor\"));\n\tauto mefVal = mef.calculate();\n\tSetR(\"efficiency\",mefVal*100);\n\t\n\tMotorCurrent mc(Get(\"motor_rated_power\"),Get(\"motor_rated_speed\"),line(),effCls(),Get(\"efficiency\"),Get(\"load_factor\"),Get(\"motor_rated_voltage\"),Get(\"flc\"));\n\tauto mcVal = mc.calculate();\n\tSetR(\"current\",mcVal\/Get(\"flc\")*100); \n\t\n\tMotorPowerFactor pf(Get(\"motor_rated_power\"),Get(\"load_factor\"),mcVal,mefVal,Get(\"motor_rated_voltage\"));\n\tSetR(\"pf\",pf.calculate()*100); \n}\n\nvoid PumpEfficiency(const FunctionCallbackInfo<Value>& args) {\n\tSetup(args);\n\tOptimalPrePumpEff pef(style(), 0, Get(\"flow\"));\n\tauto v = pef.calculate();\n\tSetR(\"average\",v);\n\tSetR(\"max\",v*OptimalDeviationFactor(Get(\"flow\")).calculate()); \n}\n\nvoid AchievableEfficiency(const FunctionCallbackInfo<Value>& args) {\n\tSetup(args);\n\targs.GetReturnValue().Set(\n\t\tOptimalSpecificSpeedCorrection(style(), Get(\"specific_speed\")).calculate()*100);\n}\n\nvoid Nema(const FunctionCallbackInfo<Value>& args) {\n\tSetup(args);\n\t\n\targs.GetReturnValue().Set(\n\t\tMotorEfficiency(line(),Get(\"motor_rated_speed\"),effCls(),Get(\"efficiency\"),Get(\"motor_rated_power\"),1).calculate()*100\n\t);\n}\n\n\/\/TODO round vs js round; loosen up to make next test case\nvoid Check(double exp, double act, const char* nm=\"\") {\n\t\/\/cout << \"e \" << exp << \"; a \" << act << endl;\n\t\/\/ if (isnan(act) || (abs(exp-act)>.01*exp)) {\n\tauto p = 10;\n\tif (isnan(act) || ( (round(exp*p)\/p)!=round(act*p)\/p)) { \n\t\tprintf(\"\\\"%s\\\" TEST FAILED: %f %f\\n\",nm,exp,act);\n\t\tassert(!\"equal\");\n\t} \n}\n\nvoid Check100(double exp, double act, const char* nm=\"\") {\n\tCheck(exp,act*100,nm);\n}\n\nvoid Test(const FunctionCallbackInfo<Value>& args) {\n\t\tEstimateFLA fla(200,1780,(Motor::LineFrequency)1,(Motor::EfficiencyClass)(1),0,460);\n\t\tfla.calculate();\n\t\tCheck(225.8,fla.getEstimatedFLA());\n\n\/\/ motor perf\n\n\t{ \n\t\tMotorCurrent mc(200,1780,Motor::LineFrequency::FREQ60,Motor::EfficiencyClass::ENERGY_EFFICIENT,0,.25,460,225.8);\n\t\tauto mcVal = mc.calculate();\n\t\tCheck100(36.11,mcVal\/225.8);\n\t}\n\t{\n\t\tMotorEfficiency mef(Motor::LineFrequency::FREQ60,1780,Motor::EfficiencyClass::ENERGY_EFFICIENT,0,200,.75);\n\t\tauto mefVal = mef.calculate();\n\t\tCheck100(95.69,mefVal);\n\t\t\n\t\tMotorCurrent mc(200,1780,Motor::LineFrequency::FREQ60,Motor::EfficiencyClass::ENERGY_EFFICIENT,0,.75,460,225.8);\n\t\tauto mcVal = mc.calculate();\n\t\tCheck100(76.63,mcVal\/225.8);\n\n\t\tMotorPowerFactor pf(200,.75,mcVal,mefVal,460);\n\t\tCheck100(84.82,pf.calculate());\n\t}\n\n\/\/nema\n\t{\n\t\tMotorEfficiency mef(Motor::LineFrequency::FREQ60,1200, Motor::EfficiencyClass::ENERGY_EFFICIENT,0,200,1);\n\t\t\/\/Check100(95,mef.calculate()); \n\t}\n\n\/\/pump eff\n\t{\n\t\tOptimalPrePumpEff pef(Pump::Style::END_SUCTION_ANSI_API, 0, 2000); \n\t\tOptimalDeviationFactor df(2000);\n\n\t\t\/\/cout << pef.calculate() << \";\" << df.calculate();\n\t\t\/\/Check(87.1,pef.calculate()*df.calculate());\n\t}\n\n\/\/spec speed\n\n\t{\n\t\tOptimalSpecificSpeedCorrection cor(Pump::Style::END_SUCTION_ANSI_API, 1170);\n\t\t\/\/Check100(2.3,cor.calculate());\n\t}\n\treturn;\n\n\t#define BASE \\\n\t\tPump pump(Pump::Style::END_SUCTION_ANSI_API,0,1780,Pump::Drive::DIRECT_DRIVE,\\\n\t\t\t1,1,1,Pump::Speed::NOT_FIXED_SPEED);\\\n\t\tMotor motor(Motor::LineFrequency::FREQ60,200,1780,\\\n\t\t\t\tMotor::EfficiencyClass::ENERGY_EFFICIENT,0,460,225.8,0);\\\n\t\tFinancial fin(1,.05);\\\n\t\tFieldData fd(2000,277,FieldData::LoadEstimationMethod::POWER,\\\n\t\t\t\t150,0,460); \n\n\t#define CALC \\\n\t\tPSATResult psat(pump,motor,fin,fd);\\\n\t\tpsat.calculateExisting();\\\n\t\tauto ex = psat.getExisting();\n\n\tfor (int i=1; i<=10000; i=i+2) {\n\t\tBASE\n\t\tCALC\n\t\tCheck(ex.motorShaftPower_,ex.motorShaftPower_,\"SAME\");\n\t}\n\n\t{\n\t\tBASE\n\t\tmotor.setMotorRpm(1786);\n\t\tfd.setMotorPower(80);\n\t\tCALC\n\t\tCheck(101.9,ex.motorShaftPower_);\n\t\tCheck100(95,ex.motorEfficiency_);\n\t\tCheck100(79.1,ex.motorPowerFactor_);\n\t\tCheck(127,ex.motorCurrent_);\n\t}\n\t{\n\t\tBASE\n\t\tfd.setMotorPower(80);\n\t\tmotor.setMotorRatedPower(100);\n\t\tmotor.setFullLoadAmps(113.8);\n\t\tCALC\n\t\tCheck(101.8,ex.motorShaftPower_);\n\t\tCheck100(94.9,ex.motorEfficiency_);\n\t\tCheck100(86.7,ex.motorPowerFactor_);\n\t\tCheck(115.8,ex.motorCurrent_); \n\t}\n\t{\n\t\tBASE\n\t\tfd.setMotorPower(80);\n\t\tfd.setVoltage(260);\n\t\tCALC\n\t\tCheck(101.9,ex.motorShaftPower_);\n\t\tCheck100(95,ex.motorEfficiency_);\n\t\tCheck100(138.8,ex.motorPowerFactor_);\n\t\tCheck(128,ex.motorCurrent_); \n\t}\n\t{\n\t\tBASE\n\t\tmotor.setMotorRpm(1200);\n\t\tfd.setMotorPower(80);\n\t\tmotor.setFullLoadAmps(235.3);\n\t\tCALC\n\t\tCheck(101.4,ex.motorShaftPower_);\n\t\tCheck100(94.5,ex.motorEfficiency_);\n\t\tCheck100(74.3,ex.motorPowerFactor_);\n\t\tCheck(135.1,ex.motorCurrent_);\n\t} \n\t{\n\t\tBASE\n\t\tfd.setMotorPower(111.855);\n\t\tCALC\n\t\tCheck(143.4,ex.motorShaftPower_);\n\t\tCheck100(95.6,ex.motorEfficiency_);\n\t\tCheck100(84.3,ex.motorPowerFactor_);\n\t\tCheck(166.5,ex.motorCurrent_);\n\t}\n\t{\n\t\tBASE\n\t\tfd.setMotorPower(80);\n\t\tmotor.setMotorRatedVoltage(200);\n\t\tmotor.setFullLoadAmps(519.3);\n\t\tCALC\n\t\tCheck(101.9,ex.motorShaftPower_);\n\t\tCheck100(95,ex.motorEfficiency_);\n\t\tCheck100(35.2,ex.motorPowerFactor_);\n\t\tCheck(284.9,ex.motorCurrent_);\n\t} \n\t{\n\t\tBASE\n\t\tCALC\n\t\tCheck(217.5,ex.motorCurrent_);\n\t}\n\t{\n\t\tBASE \n\t\tfd.setLoadEstimationMethod(FieldData::LoadEstimationMethod::CURRENT);\n\t\tfd.setMotorAmps(218);\n\t\tfd.setMotorPower(0);\n\t\tCALC\n\t\tCheck(150.4,ex.motorPower_);\n\t\tCheck100(72.5,ex.pumpEfficiency_);\n\t}\n\t{\n\t\tBASE\n\t\tfd.setMotorPower(80);\n\t\tCALC\n\t\tCheck(700.8,ex.annualEnergy_);\n\t}\n\t{\n\t\tBASE\n\t\tfin.setOperatingFraction(.25);\n\t\tCALC\n\t\tCheck(328.5,ex.annualEnergy_);\n\t\tCheck(16.4,ex.annualCost_);\n\t}\n\t{\n\t\tBASE\n\t\tmotor.setFullLoadAmps(300);\n\t\tCALC\n\t\tCheck(288.9,ex.motorCurrent_);\n\t} \n\t{\n\t\tBASE\n\t\tmotor.setEfficiencyClass(Motor::EfficiencyClass(0));\n\t\tCALC\n\t\tCheck(213.7,ex.motorCurrent_);\n\t} \n\t{\n\t\tBASE\n\t\tmotor.setEfficiencyClass(Motor::EfficiencyClass(2));\n\t\tmotor.setSpecifiedEfficiency(75);\n\t\tCALC\n\t\tCheck(173.7,ex.motorCurrent_);\n\t} \n\tcout << \"done\";\n}\n\nvoid InitTest(const FunctionCallbackInfo<Value>& args) {\n\tSetup(args);\n\targs.GetReturnValue().Set(String::NewFromUtf8(iso,\"SUCCESS\"));\n}\n\nvoid Init(Local<Object> exports) {\n\tNODE_SET_METHOD(exports, \"results\", Results);\n\tNODE_SET_METHOD(exports, \"estFLA\", EstFLA);\n\tNODE_SET_METHOD(exports, \"motorPerformance\", MotorPerformance); \n\tNODE_SET_METHOD(exports, \"pumpEfficiency\", PumpEfficiency); \n\tNODE_SET_METHOD(exports, \"achievableEfficiency\", AchievableEfficiency);\n\tNODE_SET_METHOD(exports, \"nema\", Nema); \n\tNODE_SET_METHOD(exports, \"test\", Test); \n\tNODE_SET_METHOD(exports, \"initTest\", InitTest); \n}\n\nNODE_MODULE(bridge, Init)\n\n<commit_msg>no message<commit_after>#include <iostream>\n#include <vector>\n#include <map>\n#include <node.h>\n#include <cmath>\n\n#include \"PSATResult.h\"\n#include \"calculator\/EstimateFLA.h\"\n#include \"calculator\/MotorCurrent.h\"\n#include \"calculator\/MotorEfficiency.h\"\n#include \"calculator\/MotorPowerFactor.h\"\n#include \"calculator\/OptimalPrePumpEff.h\"\n#include \"calculator\/OptimalSpecificSpeedCorrection.h\"\n#include \"calculator\/OptimalDeviationFactor.h\"\n\nusing namespace v8;\nusing namespace std;\n\n\/\/ Setup \n\nIsolate* iso;\nLocal<Object> inp;\nLocal<Object> r;\n\nvoid Setup(const FunctionCallbackInfo<Value>& args) {\n\tiso = args.GetIsolate();\n\tinp = args[0]->ToObject();\n\tr = Object::New(iso);\n\targs.GetReturnValue().Set(r);\n}\n\ndouble Get(const char *nm) {\n\tauto rObj = inp->ToObject()->Get(String::NewFromUtf8(iso,nm));\n\tif (rObj->IsUndefined()) {\n\t\tcout << nm << endl;;\n\t\tassert(!\"defined\");\n\t}\n\treturn rObj->NumberValue();\n}\n\nvoid SetR(const char *nm, double n) {\n\tr->Set(String::NewFromUtf8(iso,nm),Number::New(iso,n));\n}\n\n\/\/ Fields\n\nMotor::LineFrequency line() {\n\treturn (Motor::LineFrequency)(int)(!Get(\"line\"));\n}\nMotor::EfficiencyClass effCls() {\n\treturn (Motor::EfficiencyClass)(int)Get(\"efficiency_class\");\n}\nPump::Drive drive() {\n\treturn (Pump::Drive)(int)Get(\"drive\");\n}\nPump::Style style() {\n\treturn (Pump::Style)(int)Get(\"pump_style\");\n}\n\n\/\/ Operations\n\nvoid Results(const FunctionCallbackInfo<Value>& args) {\n\tSetup(args);\n\t\n\tPump pump(style(),Get(\"pump_specified\")\/100,Get(\"pump_rated_speed\"),drive(),\n\t\t\tGet(\"viscosity\"),Get(\"specific_gravity\"),Get(\"stages\"),(Pump::Speed)(int)(!Get(\"fixed_speed\")));\n\tMotor motor(line(),Get(\"motor_rated_power\"),Get(\"motor_rated_speed\"),effCls(),\n\t\t\tGet(\"efficiency\"),Get(\"motor_rated_voltage\"),Get(\"motor_rated_flc\"),Get(\"margin\"));\n\tFinancial fin(Get(\"fraction\")\/100,Get(\"cost\"));\n\tFieldData fd(Get(\"flow\"),Get(\"head\"),(FieldData::LoadEstimationMethod)(Get(\"motor_field_power\")>0?0:1),\n\t\t\tGet(\"motor_field_power\"),Get(\"motor_field_current\"),Get(\"motor_field_voltage\"));\n\tPSATResult psat(pump,motor,fin,fd);\n\tpsat.calculateExisting();\n\tpsat.calculateOptimal(); \n\tauto ex = psat.getExisting(), opt = psat.getOptimal();\n\n\tmap<const char *,vector<double>> out = { \n\t\t{\"Pump Efficiency\",{ex.pumpEfficiency_*100,opt.pumpEfficiency_*100}},\n\t\t{\"Motor Rated Power\",{ex.motorRatedPower_,opt.motorRatedPower_}}, \n\t\t{\"Motor Shaft Power\",{ex.motorShaftPower_,opt.motorShaftPower_}},\n\t\t{\"Pump Shaft Power\",{ex.pumpShaftPower_,opt.pumpShaftPower_}}, \n\t\t{\"Motor Efficiency\",{ex.motorEfficiency_,opt.motorEfficiency_}},\n\t\t{\"Motor Power Factor\",{ex.motorPowerFactor_,opt.motorPowerFactor_}},\n\t\t{\"Motor Current\",{ex.motorCurrent_,opt.motorCurrent_}}, \n\t\t{\"Motor Power\", {ex.motorPower_,opt.motorPower_}},\n\t\t{\"Annual Energy\", {ex.annualEnergy_,opt.annualEnergy_}},\n\t\t{\"Annual Cost\", {ex.annualCost_*1000,opt.annualCost_*1000}},\n\t\t{\"Savings Potential\", {psat.getAnnualSavingsPotential()*1000,-1}},\n\t\t{\"Optimization Rating\", {psat.getOptimizationRating(),-1}}\n\t};\n\tfor(auto p: out) { \n\t\tauto a = Array::New(iso);\n\t\ta->Set(0,Number::New(iso,p.second[0]));\n\t\ta->Set(1,Number::New(iso,p.second[1])); \n\t\tr->Set(String::NewFromUtf8(iso,p.first),a);\n\t}\n}\n\nvoid EstFLA(const FunctionCallbackInfo<Value>& args) {\n\tSetup(args);\n\tEstimateFLA fla(Get(\"motor_rated_power\"),Get(\"motor_rated_speed\"),line(),effCls(),\n\t\tGet(\"efficiency\"),Get(\"motor_rated_voltage\"));\n\tfla.calculate(); \n\targs.GetReturnValue().Set(fla.getEstimatedFLA());\n}\n\nvoid MotorPerformance(const FunctionCallbackInfo<Value>& args) {\n\tSetup(args);\n\n\tMotorEfficiency mef(line(),Get(\"motor_rated_speed\"),effCls(),Get(\"efficiency\"),Get(\"motor_rated_power\"),Get(\"load_factor\"));\n\tauto mefVal = mef.calculate();\n\tSetR(\"efficiency\",mefVal*100);\n\t\n\tMotorCurrent mc(Get(\"motor_rated_power\"),Get(\"motor_rated_speed\"),line(),effCls(),Get(\"efficiency\"),Get(\"load_factor\"),Get(\"motor_rated_voltage\"),Get(\"flc\"));\n\tauto mcVal = mc.calculate();\n\tSetR(\"current\",mcVal\/Get(\"flc\")*100); \n\t\n\tMotorPowerFactor pf(Get(\"motor_rated_power\"),Get(\"load_factor\"),mcVal,mefVal,Get(\"motor_rated_voltage\"));\n\tSetR(\"pf\",pf.calculate()*100); \n}\n\nvoid PumpEfficiency(const FunctionCallbackInfo<Value>& args) {\n\tSetup(args);\n\tOptimalPrePumpEff pef(style(), 0, Get(\"flow\"));\n\tauto v = pef.calculate();\n\tSetR(\"average\",v);\n\tSetR(\"max\",v*OptimalDeviationFactor(Get(\"flow\")).calculate()); \n}\n\nvoid AchievableEfficiency(const FunctionCallbackInfo<Value>& args) {\n\tSetup(args);\n\targs.GetReturnValue().Set(\n\t\tOptimalSpecificSpeedCorrection(style(), Get(\"specific_speed\")).calculate()*100);\n}\n\nvoid Nema(const FunctionCallbackInfo<Value>& args) {\n\tSetup(args);\n\t\n\targs.GetReturnValue().Set(\n\t\tMotorEfficiency(line(),Get(\"motor_rated_speed\"),effCls(),Get(\"efficiency\"),Get(\"motor_rated_power\"),1).calculate()*100\n\t);\n}\n\n\/\/ Test\n\nvoid Check(double exp, double act, const char* nm=\"\") {\n\t\/\/cout << \"e \" << exp << \"; a \" << act << endl;\n\t\/\/ if (isnan(act) || (abs(exp-act)>.01*exp)) {\n\tauto p = 10;\n\tif (isnan(act) || ( (round(exp*p)\/p)!=round(act*p)\/p)) { \n\t\tprintf(\"\\\"%s\\\" TEST FAILED: %f %f\\n\",nm,exp,act);\n\t\tassert(!\"equal\");\n\t} \n}\n\nvoid Check100(double exp, double act, const char* nm=\"\") {\n\tCheck(exp,act*100,nm);\n}\n\nvoid Test(const FunctionCallbackInfo<Value>& args) {\n\t\tEstimateFLA fla(200,1780,(Motor::LineFrequency)1,(Motor::EfficiencyClass)(1),0,460);\n\t\tfla.calculate();\n\t\tCheck(225.8,fla.getEstimatedFLA());\n\n\/\/ motor perf\n\n\t{ \n\t\tMotorCurrent mc(200,1780,Motor::LineFrequency::FREQ60,Motor::EfficiencyClass::ENERGY_EFFICIENT,0,.25,460,225.8);\n\t\tauto mcVal = mc.calculate();\n\t\tCheck100(36.11,mcVal\/225.8);\n\t}\n\t{\n\t\tMotorEfficiency mef(Motor::LineFrequency::FREQ60,1780,Motor::EfficiencyClass::ENERGY_EFFICIENT,0,200,.75);\n\t\tauto mefVal = mef.calculate();\n\t\tCheck100(95.69,mefVal);\n\t\t\n\t\tMotorCurrent mc(200,1780,Motor::LineFrequency::FREQ60,Motor::EfficiencyClass::ENERGY_EFFICIENT,0,.75,460,225.8);\n\t\tauto mcVal = mc.calculate();\n\t\tCheck100(76.63,mcVal\/225.8);\n\n\t\tMotorPowerFactor pf(200,.75,mcVal,mefVal,460);\n\t\tCheck100(84.82,pf.calculate());\n\t}\n\n\/\/ nema\n\n\t{\n\t\tMotorEfficiency mef(Motor::LineFrequency::FREQ60,1200, Motor::EfficiencyClass::ENERGY_EFFICIENT,0,200,1);\n\t\t\/\/Check100(95,mef.calculate()); \n\t}\n\n\/\/ pump eff\n\n\t{\n\t\tOptimalPrePumpEff pef(Pump::Style::END_SUCTION_ANSI_API, 0, 2000); \n\t\tOptimalDeviationFactor df(2000);\n\n\t\t\/\/cout << pef.calculate() << \";\" << df.calculate();\n\t\t\/\/Check(87.1,pef.calculate()*df.calculate());\n\t}\n\n\/\/ spec speed\n\n\n\t{\n\t\tOptimalSpecificSpeedCorrection cor(Pump::Style::END_SUCTION_ANSI_API, 1170);\n\t\t\/\/Check100(2.3,cor.calculate());\n\t}\n\treturn;\n\n\t#define BASE \\\n\t\tPump pump(Pump::Style::END_SUCTION_ANSI_API,0,1780,Pump::Drive::DIRECT_DRIVE,\\\n\t\t\t1,1,1,Pump::Speed::NOT_FIXED_SPEED);\\\n\t\tMotor motor(Motor::LineFrequency::FREQ60,200,1780,\\\n\t\t\t\tMotor::EfficiencyClass::ENERGY_EFFICIENT,0,460,225.8,0);\\\n\t\tFinancial fin(1,.05);\\\n\t\tFieldData fd(2000,277,FieldData::LoadEstimationMethod::POWER,\\\n\t\t\t\t150,0,460); \n\n\t#define CALC \\\n\t\tPSATResult psat(pump,motor,fin,fd);\\\n\t\tpsat.calculateExisting();\\\n\t\tauto ex = psat.getExisting();\n\n\tfor (int i=1; i<=10000; i=i+2) {\n\t\tBASE\n\t\tCALC\n\t\tCheck(ex.motorShaftPower_,ex.motorShaftPower_,\"SAME\");\n\t}\n\n\t{\n\t\tBASE\n\t\tmotor.setMotorRpm(1786);\n\t\tfd.setMotorPower(80);\n\t\tCALC\n\t\tCheck(101.9,ex.motorShaftPower_);\n\t\tCheck100(95,ex.motorEfficiency_);\n\t\tCheck100(79.1,ex.motorPowerFactor_);\n\t\tCheck(127,ex.motorCurrent_);\n\t}\n\t{\n\t\tBASE\n\t\tfd.setMotorPower(80);\n\t\tmotor.setMotorRatedPower(100);\n\t\tmotor.setFullLoadAmps(113.8);\n\t\tCALC\n\t\tCheck(101.8,ex.motorShaftPower_);\n\t\tCheck100(94.9,ex.motorEfficiency_);\n\t\tCheck100(86.7,ex.motorPowerFactor_);\n\t\tCheck(115.8,ex.motorCurrent_); \n\t}\n\t{\n\t\tBASE\n\t\tfd.setMotorPower(80);\n\t\tfd.setVoltage(260);\n\t\tCALC\n\t\tCheck(101.9,ex.motorShaftPower_);\n\t\tCheck100(95,ex.motorEfficiency_);\n\t\tCheck100(138.8,ex.motorPowerFactor_);\n\t\tCheck(128,ex.motorCurrent_); \n\t}\n\t{\n\t\tBASE\n\t\tmotor.setMotorRpm(1200);\n\t\tfd.setMotorPower(80);\n\t\tmotor.setFullLoadAmps(235.3);\n\t\tCALC\n\t\tCheck(101.4,ex.motorShaftPower_);\n\t\tCheck100(94.5,ex.motorEfficiency_);\n\t\tCheck100(74.3,ex.motorPowerFactor_);\n\t\tCheck(135.1,ex.motorCurrent_);\n\t} \n\t{\n\t\tBASE\n\t\tfd.setMotorPower(111.855);\n\t\tCALC\n\t\tCheck(143.4,ex.motorShaftPower_);\n\t\tCheck100(95.6,ex.motorEfficiency_);\n\t\tCheck100(84.3,ex.motorPowerFactor_);\n\t\tCheck(166.5,ex.motorCurrent_);\n\t}\n\t{\n\t\tBASE\n\t\tfd.setMotorPower(80);\n\t\tmotor.setMotorRatedVoltage(200);\n\t\tmotor.setFullLoadAmps(519.3);\n\t\tCALC\n\t\tCheck(101.9,ex.motorShaftPower_);\n\t\tCheck100(95,ex.motorEfficiency_);\n\t\tCheck100(35.2,ex.motorPowerFactor_);\n\t\tCheck(284.9,ex.motorCurrent_);\n\t} \n\t{\n\t\tBASE\n\t\tCALC\n\t\tCheck(217.5,ex.motorCurrent_);\n\t}\n\t{\n\t\tBASE \n\t\tfd.setLoadEstimationMethod(FieldData::LoadEstimationMethod::CURRENT);\n\t\tfd.setMotorAmps(218);\n\t\tfd.setMotorPower(0);\n\t\tCALC\n\t\tCheck(150.4,ex.motorPower_);\n\t\tCheck100(72.5,ex.pumpEfficiency_);\n\t}\n\t{\n\t\tBASE\n\t\tfd.setMotorPower(80);\n\t\tCALC\n\t\tCheck(700.8,ex.annualEnergy_);\n\t}\n\t{\n\t\tBASE\n\t\tfin.setOperatingFraction(.25);\n\t\tCALC\n\t\tCheck(328.5,ex.annualEnergy_);\n\t\tCheck(16.4,ex.annualCost_);\n\t}\n\t{\n\t\tBASE\n\t\tmotor.setFullLoadAmps(300);\n\t\tCALC\n\t\tCheck(288.9,ex.motorCurrent_);\n\t} \n\t{\n\t\tBASE\n\t\tmotor.setEfficiencyClass(Motor::EfficiencyClass(0));\n\t\tCALC\n\t\tCheck(213.7,ex.motorCurrent_);\n\t} \n\t{\n\t\tBASE\n\t\tmotor.setEfficiencyClass(Motor::EfficiencyClass(2));\n\t\tmotor.setSpecifiedEfficiency(75);\n\t\tCALC\n\t\tCheck(173.7,ex.motorCurrent_);\n\t} \n\tcout << \"done\";\n}\n\nvoid InitTest(const FunctionCallbackInfo<Value>& args) {\n\tSetup(args);\n\targs.GetReturnValue().Set(String::NewFromUtf8(iso,\"SUCCESS\"));\n}\n\n\/\/ v8\n\nvoid Init(Local<Object> exports) {\n\tNODE_SET_METHOD(exports, \"results\", Results);\n\tNODE_SET_METHOD(exports, \"estFLA\", EstFLA);\n\tNODE_SET_METHOD(exports, \"motorPerformance\", MotorPerformance); \n\tNODE_SET_METHOD(exports, \"pumpEfficiency\", PumpEfficiency); \n\tNODE_SET_METHOD(exports, \"achievableEfficiency\", AchievableEfficiency);\n\tNODE_SET_METHOD(exports, \"nema\", Nema); \n\tNODE_SET_METHOD(exports, \"test\", Test); \n\tNODE_SET_METHOD(exports, \"initTest\", InitTest); \n}\n\nNODE_MODULE(bridge, Init)\n<|endoftext|>"} {"text":"<commit_before>\/* FasTC\n * Copyright (c) 2013 University of North Carolina at Chapel Hill.\n * All rights reserved.\n *\n * Permission to use, copy, modify, and distribute this software and its\n * documentation for educational, research, and non-profit purposes, without\n * fee, and without a written agreement is hereby granted, provided that the\n * above copyright notice, this paragraph, and the following four paragraphs\n * appear in all copies.\n *\n * Permission to incorporate this software into commercial products may be\n * obtained by contacting the authors or the Office of Technology Development\n * at the University of North Carolina at Chapel Hill <otd@unc.edu>.\n *\n * This software program and documentation are copyrighted by the University of\n * North Carolina at Chapel Hill. The software program and documentation are\n * supplied \"as is,\" without any accompanying services from the University of\n * North Carolina at Chapel Hill or the authors. The University of North\n * Carolina at Chapel Hill and the authors do not warrant that the operation of\n * the program will be uninterrupted or error-free. The end-user understands\n * that the program was developed for research purposes and is advised not to\n * rely exclusively on the program for any reason.\n *\n * IN NO EVENT SHALL THE UNIVERSITY OF NORTH CAROLINA AT CHAPEL HILL OR THE\n * AUTHORS BE LIABLE TO ANY PARTY FOR DIRECT, INDIRECT, SPECIAL, INCIDENTAL,\n * OR CONSEQUENTIAL DAMAGES, INCLUDING LOST PROFITS, ARISING OUT OF THE USE OF\n * THIS SOFTWARE AND ITS DOCUMENTATION, EVEN IF THE UNIVERSITY OF NORTH CAROLINA\n * AT CHAPEL HILL OR THE AUTHORS HAVE BEEN ADVISED OF THE POSSIBILITY OF SUCH\n * DAMAGE.\n *\n * THE UNIVERSITY OF NORTH CAROLINA AT CHAPEL HILL AND THE AUTHORS SPECIFICALLY\n * DISCLAIM ANY WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED\n * WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE AND ANY \n * STATUTORY WARRANTY OF NON-INFRINGEMENT. THE SOFTWARE PROVIDED HEREUNDER IS ON\n * AN \"AS IS\" BASIS, AND THE UNIVERSITY OF NORTH CAROLINA AT CHAPEL HILL AND\n * THE AUTHORS HAVE NO OBLIGATIONS TO PROVIDE MAINTENANCE, SUPPORT, UPDATES, \n * ENHANCEMENTS, OR MODIFICATIONS.\n *\n * Please send all BUG REPORTS to <pavel@cs.unc.edu>.\n *\n * The authors may be contacted via:\n *\n * Pavel Krajcevski\n * Dept of Computer Science\n * 201 S Columbia St\n * Frederick P. Brooks, Jr. Computer Science Bldg\n * Chapel Hill, NC 27599-3175\n * USA\n * \n * <http:\/\/gamma.cs.unc.edu\/FasTC\/>\n *\/\n\n#include \"PVRTCCompressor.h\"\n\n#include <algorithm>\n#include <cassert>\n#include <iostream>\n#include <vector>\n\n#include \"Pixel.h\"\n#include \"Image.h\"\n#include \"Block.h\"\n\nnamespace PVRTCC {\n\n static uint32 Interleave(uint16 inx, uint16 iny) {\n \/\/ Taken from:\n \/\/ http:\/\/graphics.stanford.edu\/~seander\/bithacks.html#InterleaveBMN\n\n static const uint32 B[] = {0x55555555, 0x33333333, 0x0F0F0F0F, 0x00FF00FF};\n static const uint32 S[] = {1, 2, 4, 8};\n\n uint32 x = static_cast<uint32>(inx);\n uint32 y = static_cast<uint32>(iny);\n\n x = (x | (x << S[3])) & B[3];\n x = (x | (x << S[2])) & B[2];\n x = (x | (x << S[1])) & B[1];\n x = (x | (x << S[0])) & B[0];\n\n y = (y | (y << S[3])) & B[3];\n y = (y | (y << S[2])) & B[2];\n y = (y | (y << S[1])) & B[1];\n y = (y | (y << S[0])) & B[0];\n\n return x | (y << 1);\n }\n\n template <typename T>\n static T Clamp(const T &v, const T &low, const T &high) {\n return ::std::min(::std::max(low, v), high);\n }\n\n template <typename T>\n static T Lookup(const ::std::vector<T> &vals,\n uint32 x, uint32 y,\n uint32 width, uint32 height,\n const EWrapMode wrapMode) {\n while(x >= width) {\n if(wrapMode == eWrapMode_Wrap) {\n x -= width;\n } else {\n x = width - 1;\n }\n }\n\n while(x < 0) {\n if(wrapMode == eWrapMode_Wrap) {\n x += width;\n } else {\n x = 0;\n }\n }\n\n while(y >= height) {\n if(wrapMode == eWrapMode_Wrap) {\n y -= height;\n } else {\n y = height - 1;\n }\n }\n\n while(y < 0) {\n if(wrapMode == eWrapMode_Wrap) {\n y += height;\n } else {\n y = 0;\n }\n }\n\n return vals[y * width + x];\n }\n\n void Compress(const CompressionJob &dcj,\n bool bTwoBitMode,\n const EWrapMode wrapMode) {\n Image img(dcj.height, dcj.width);\n uint32 nPixels = dcj.height * dcj.width;\n for(uint32 i = 0; i < nPixels; i++) {\n uint32 x = i % dcj.width;\n uint32 y = i \/ dcj.width;\n\n const uint32 *pixels = reinterpret_cast<const uint32 *>(dcj.inBuf);\n img(x, y).UnpackRGBA(pixels[i]); \n }\n\n Image original = img;\n img.DebugOutput(\"Original\");\n\n \/\/ Downscale it using anisotropic diffusion based scheme in order to preserve\n \/\/ image features, then reupscale and compute deltas. Use deltas to generate\n \/\/ initial A & B images followed by modulation data.\n img.ContentAwareDownscale(1, 1, eWrapMode_Wrap, true);\n img.ContentAwareDownscale(1, 1, eWrapMode_Wrap, false);\n\n Image downscaled = img;\n\n \/\/ Upscale it again\n img.BilinearUpscale(2, 2, eWrapMode_Wrap);\n\n img.DebugOutput(\"Reconstruction\");\n\n \/\/ Compute difference...\n ::std::vector<int16> difference;\n difference.resize(dcj.height * dcj.width * 4);\n for(uint32 j = 0; j < dcj.height; j++) {\n for(uint32 i = 0; i < dcj.width; i++) {\n for(uint32 c = 0; c < 4; c++) {\n int16 o = original(i, j).Component(c);\n int16 n = img(i, j).Component(c);\n difference[j*dcj.width*4 + i*4 + c] = o - n;\n }\n }\n }\n\n \/\/ Go over the 7x7 texel blocks and extract bounding box diagonals for each\n \/\/ block. We should be able to choose which diagonal we want...\n const uint32 kKernelSz = 7;\n ::std::vector<int16> maxDiff;\n ::std::vector<int16> minDiff;\n\n const uint32 kNumBlockChannels = dcj.height * dcj.width \/ 4;\n maxDiff.resize(kNumBlockChannels);\n minDiff.resize(kNumBlockChannels);\n\n for(uint32 j = 2; j < dcj.height; j += 4) {\n for(uint32 i = 2; i < dcj.width; i += 4) {\n const uint32 startX = i - (kKernelSz \/ 2);\n const uint32 startY = j - (kKernelSz \/ 2);\n for(uint32 c = 0; c < 4; c++) {\n int32 pos = 0;\n int32 neg = 0;\n for(uint32 y = startY; y < startY + kKernelSz; y++) {\n for(uint32 x = startX; x < startX + kKernelSz; x++) {\n int16 val = Lookup(difference, x*4 + c, y,\n dcj.width*4, dcj.height, wrapMode);\n if(val > 0) {\n pos += val;\n } else {\n neg += val;\n }\n }\n }\n\n uint32 blockIdx = ((j-2)\/4) * dcj.width + (i-2) + c;\n assert(blockIdx < kNumBlockChannels);\n if(pos > -neg) {\n maxDiff[blockIdx] = pos;\n minDiff[blockIdx] = 0;\n } else {\n maxDiff[blockIdx] = 0;\n minDiff[blockIdx] = neg; \n }\n }\n }\n }\n\n \/\/ Add maxDiff to image to get high signal, and lowdiff to image to\n \/\/ get low signal...\n Image imgA = downscaled;\n Image imgB = downscaled;\n\n for(uint32 j = 0; j < dcj.height \/ 4; j++) {\n for(uint32 i = 0; i < dcj.width \/ 4; i++) {\n for(uint32 c = 0; c < 4; c++) {\n const uint32 cIdx = j*dcj.width\/4 + i*4 + c;\n uint8 &a = imgA(i, j).Component(c);\n a = static_cast<uint8>(Clamp<int16>(a + maxDiff[cIdx], 0, 255));\n\n uint8 &b = imgB(i, j).Component(c);\n b = static_cast<uint8>(Clamp<int16>(b + minDiff[cIdx], 0, 255));\n }\n }\n }\n\n imgA.DebugOutput(\"ImageA\");\n imgB.DebugOutput(\"ImageB\");\n\n \/\/ Determine modulation values...\n Image upA = imgA;\n Image upB = imgB;\n\n upA.BilinearUpscale(2, 2, wrapMode);\n upB.BilinearUpscale(2, 2, wrapMode);\n\n assert(upA.GetHeight() == dcj.height && upA.GetWidth() == dcj.width);\n assert(upB.GetHeight() == dcj.height && upB.GetWidth() == dcj.width);\n\n upA.DebugOutput(\"UpscaledA\");\n upB.DebugOutput(\"UpscaledB\");\n\n \/\/ Choose the most appropriate modulation values for the two images...\n ::std::vector<uint8> modValues;\n modValues.resize(dcj.width * dcj.height);\n for(uint32 j = 0; j < dcj.height; j++) {\n for(uint32 i = 0; i < dcj.width; i++) {\n uint8 &mv = modValues[j * dcj.width + i];\n\n const Pixel pa = upA(i, j);\n const Pixel pb = upB(i, j);\n const Pixel po = original(i, j);\n \n \/\/ !FIXME! there are two modulation modes... we're only using one.\n uint8 modSteps[4] = { 8, 5, 3, 0 };\n uint8 bestMod = 0;\n uint32 bestError = 0xFFFFFFFF;\n for(uint32 s = 0; s < 4; s++) {\n uint32 error = 0;\n for(uint32 c = 0; c < 4; c++) {\n uint16 va = static_cast<uint16>(pa.Component(c));\n uint16 vb = static_cast<uint16>(pb.Component(c));\n uint16 vo = static_cast<uint16>(po.Component(c));\n\n uint16 lerpVal = modSteps[s];\n uint16 res = (va * (8 - lerpVal) + vb * lerpVal) \/ 8;\n uint16 e = (res > vo)? res - vo : vo - res;\n error += e * e;\n }\n\n if(error < bestError) {\n bestError = error;\n bestMod = s;\n }\n }\n\n mv = bestMod;\n }\n }\n\n \/\/ Pack everything into a PVRTC blocks.\n const uint32 blocksW = dcj.width \/ 4;\n const uint32 blocksH = dcj.height \/ 4;\n\n assert(imgA.GetHeight() == blocksH);\n assert(imgA.GetWidth() == blocksW);\n\n std::vector<uint64> blocks;\n blocks.reserve(blocksW * blocksH);\n for(uint32 j = 0; j < blocksH; j++) {\n for(uint32 i = 0; i < blocksW; i++) {\n Block b;\n b.SetColorA(imgA(i, j), true);\n b.SetColorB(imgB(i, j), true);\n for(uint32 t = 0; t < 16; t++) {\n uint32 x = i*4 + (t%4);\n uint32 y = j*4 + (t\/4);\n b.SetLerpValue(t, modValues[y*dcj.width + x]);\n }\n blocks.push_back(b.Pack());\n }\n }\n\n \/\/ Spit out the blocks...\n for(uint32 j = 0; j < blocksH; j++) {\n for(uint32 i = 0; i < blocksW; i++) {\n\n \/\/ The blocks are initially arranged in morton order. Let's\n \/\/ linearize them...\n uint32 idx = Interleave(j, i);\n\n uint64 *outPtr = reinterpret_cast<uint64 *>(dcj.outBuf);\n outPtr[idx] = blocks[j*blocksW + i];\n }\n }\n }\n\n} \/\/ namespace PVRTCC\n<commit_msg>Update compressor to do a simple bounding box algorithm... results are still bad but better than what we've been getting.<commit_after>\/* FasTC\n * Copyright (c) 2013 University of North Carolina at Chapel Hill.\n * All rights reserved.\n *\n * Permission to use, copy, modify, and distribute this software and its\n * documentation for educational, research, and non-profit purposes, without\n * fee, and without a written agreement is hereby granted, provided that the\n * above copyright notice, this paragraph, and the following four paragraphs\n * appear in all copies.\n *\n * Permission to incorporate this software into commercial products may be\n * obtained by contacting the authors or the Office of Technology Development\n * at the University of North Carolina at Chapel Hill <otd@unc.edu>.\n *\n * This software program and documentation are copyrighted by the University of\n * North Carolina at Chapel Hill. The software program and documentation are\n * supplied \"as is,\" without any accompanying services from the University of\n * North Carolina at Chapel Hill or the authors. The University of North\n * Carolina at Chapel Hill and the authors do not warrant that the operation of\n * the program will be uninterrupted or error-free. The end-user understands\n * that the program was developed for research purposes and is advised not to\n * rely exclusively on the program for any reason.\n *\n * IN NO EVENT SHALL THE UNIVERSITY OF NORTH CAROLINA AT CHAPEL HILL OR THE\n * AUTHORS BE LIABLE TO ANY PARTY FOR DIRECT, INDIRECT, SPECIAL, INCIDENTAL,\n * OR CONSEQUENTIAL DAMAGES, INCLUDING LOST PROFITS, ARISING OUT OF THE USE OF\n * THIS SOFTWARE AND ITS DOCUMENTATION, EVEN IF THE UNIVERSITY OF NORTH CAROLINA\n * AT CHAPEL HILL OR THE AUTHORS HAVE BEEN ADVISED OF THE POSSIBILITY OF SUCH\n * DAMAGE.\n *\n * THE UNIVERSITY OF NORTH CAROLINA AT CHAPEL HILL AND THE AUTHORS SPECIFICALLY\n * DISCLAIM ANY WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED\n * WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE AND ANY \n * STATUTORY WARRANTY OF NON-INFRINGEMENT. THE SOFTWARE PROVIDED HEREUNDER IS ON\n * AN \"AS IS\" BASIS, AND THE UNIVERSITY OF NORTH CAROLINA AT CHAPEL HILL AND\n * THE AUTHORS HAVE NO OBLIGATIONS TO PROVIDE MAINTENANCE, SUPPORT, UPDATES, \n * ENHANCEMENTS, OR MODIFICATIONS.\n *\n * Please send all BUG REPORTS to <pavel@cs.unc.edu>.\n *\n * The authors may be contacted via:\n *\n * Pavel Krajcevski\n * Dept of Computer Science\n * 201 S Columbia St\n * Frederick P. Brooks, Jr. Computer Science Bldg\n * Chapel Hill, NC 27599-3175\n * USA\n * \n * <http:\/\/gamma.cs.unc.edu\/FasTC\/>\n *\/\n\n#include \"PVRTCCompressor.h\"\n\n#include <algorithm>\n#include <cassert>\n#include <iostream>\n#include <vector>\n\n#include \"Pixel.h\"\n#include \"Image.h\"\n#include \"Block.h\"\n\nnamespace PVRTCC {\n\n static uint32 Interleave(uint16 inx, uint16 iny) {\n \/\/ Taken from:\n \/\/ http:\/\/graphics.stanford.edu\/~seander\/bithacks.html#InterleaveBMN\n\n static const uint32 B[] = {0x55555555, 0x33333333, 0x0F0F0F0F, 0x00FF00FF};\n static const uint32 S[] = {1, 2, 4, 8};\n\n uint32 x = static_cast<uint32>(inx);\n uint32 y = static_cast<uint32>(iny);\n\n x = (x | (x << S[3])) & B[3];\n x = (x | (x << S[2])) & B[2];\n x = (x | (x << S[1])) & B[1];\n x = (x | (x << S[0])) & B[0];\n\n y = (y | (y << S[3])) & B[3];\n y = (y | (y << S[2])) & B[2];\n y = (y | (y << S[1])) & B[1];\n y = (y | (y << S[0])) & B[0];\n\n return x | (y << 1);\n }\n\n template <typename T>\n static T Clamp(const T &v, const T &low, const T &high) {\n return ::std::min(::std::max(low, v), high);\n }\n\n static const Pixel &Lookup(const Image &img,\n int32 x, int32 y,\n uint32 width, uint32 height,\n const EWrapMode wrapMode) {\n while(x >= width) {\n if(wrapMode == eWrapMode_Wrap) {\n x -= width;\n } else {\n x = width - 1;\n }\n }\n\n while(x < 0) {\n if(wrapMode == eWrapMode_Wrap) {\n x += width;\n } else {\n x = 0;\n }\n }\n\n while(y >= height) {\n if(wrapMode == eWrapMode_Wrap) {\n y -= height;\n } else {\n y = height - 1;\n }\n }\n\n while(y < 0) {\n if(wrapMode == eWrapMode_Wrap) {\n y += height;\n } else {\n y = 0;\n }\n }\n\n return img(x, y);\n }\n\n void Compress(const CompressionJob &dcj,\n bool bTwoBitMode,\n const EWrapMode wrapMode) {\n Image img(dcj.height, dcj.width);\n uint32 nPixels = dcj.height * dcj.width;\n for(uint32 i = 0; i < nPixels; i++) {\n uint32 x = i % dcj.width;\n uint32 y = i \/ dcj.width;\n\n const uint32 *pixels = reinterpret_cast<const uint32 *>(dcj.inBuf);\n img(x, y).UnpackRGBA(pixels[i]); \n }\n\n Image original = img;\n img.DebugOutput(\"Original\");\n\n \/\/ Downscale it using anisotropic diffusion based scheme in order to preserve\n \/\/ image features, then reupscale and compute deltas. Use deltas to generate\n \/\/ initial A & B images followed by modulation data.\n img.ContentAwareDownscale(1, 1, eWrapMode_Wrap, true);\n img.ContentAwareDownscale(1, 1, eWrapMode_Wrap, false);\n\n Image downscaled = img;\n\n \/\/ Upscale it again\n img.BilinearUpscale(2, 2, eWrapMode_Wrap);\n\n img.DebugOutput(\"Reconstruction\");\n\n \/\/ Compute difference...\n ::std::vector<int16> difference;\n difference.resize(dcj.height * dcj.width * 4);\n for(uint32 j = 0; j < dcj.height; j++) {\n for(uint32 i = 0; i < dcj.width; i++) {\n for(uint32 c = 0; c < 4; c++) {\n int16 o = original(i, j).Component(c);\n int16 n = img(i, j).Component(c);\n difference[j*dcj.width*4 + i*4 + c] = o - n;\n }\n }\n }\n\n const uint32 blocksW = dcj.width \/ 4;\n const uint32 blocksH = dcj.height \/ 4;\n\n \/\/ Go over the 7x7 texel blocks and extract bounding box diagonals for each\n \/\/ block. We should be able to choose which diagonal we want...\n const uint32 kKernelSz = 7;\n\n Image imgA = downscaled;\n Image imgB = downscaled;\n for(uint32 j = 0; j < blocksH; j++) {\n for(uint32 i = 0; i < blocksW; i++) {\n int32 startX = i*4 + 2 - (kKernelSz \/ 2);\n int32 startY = j*4 + 2 - (kKernelSz \/ 2);\n for(int32 y = startY; y < startY + kKernelSz; y++) {\n for(int32 x = startX; x < startX + kKernelSz; x++) {\n const Pixel &po = Lookup(original, x, y, dcj.width, dcj.height, wrapMode);\n Pixel &pa = imgA(i, j);\n Pixel &pb = imgB(i, j);\n for(uint32 c = 0; c < 4; c++) {\n pa.Component(c) = ::std::max(po.Component(c), pa.Component(c));\n pb.Component(c) = ::std::min(po.Component(c), pb.Component(c));\n }\n }\n }\n }\n }\n\n imgA.DebugOutput(\"ImageA\");\n imgB.DebugOutput(\"ImageB\");\n\n \/\/ Determine modulation values...\n Image upA = imgA;\n Image upB = imgB;\n\n upA.BilinearUpscale(2, 2, wrapMode);\n upB.BilinearUpscale(2, 2, wrapMode);\n\n assert(upA.GetHeight() == dcj.height && upA.GetWidth() == dcj.width);\n assert(upB.GetHeight() == dcj.height && upB.GetWidth() == dcj.width);\n\n upA.DebugOutput(\"UpscaledA\");\n upB.DebugOutput(\"UpscaledB\");\n\n \/\/ Choose the most appropriate modulation values for the two images...\n ::std::vector<uint8> modValues;\n modValues.resize(dcj.width * dcj.height);\n for(uint32 j = 0; j < dcj.height; j++) {\n for(uint32 i = 0; i < dcj.width; i++) {\n uint8 &mv = modValues[j * dcj.width + i];\n\n const Pixel pa = upA(i, j);\n const Pixel pb = upB(i, j);\n const Pixel po = original(i, j);\n \n \/\/ !FIXME! there are two modulation modes... we're only using one.\n uint8 modSteps[4] = { 8, 5, 3, 0 };\n uint8 bestMod = 0;\n uint32 bestError = 0xFFFFFFFF;\n for(uint32 s = 0; s < 4; s++) {\n uint32 error = 0;\n for(uint32 c = 0; c < 4; c++) {\n uint16 va = static_cast<uint16>(pa.Component(c));\n uint16 vb = static_cast<uint16>(pb.Component(c));\n uint16 vo = static_cast<uint16>(po.Component(c));\n\n uint16 lerpVal = modSteps[s];\n uint16 res = (va * (8 - lerpVal) + vb * lerpVal) \/ 8;\n uint16 e = (res > vo)? res - vo : vo - res;\n error += e * e;\n }\n\n if(error < bestError) {\n bestError = error;\n bestMod = s;\n }\n }\n\n mv = bestMod;\n }\n }\n\n \/\/ Pack everything into a PVRTC blocks.\n assert(imgA.GetHeight() == blocksH);\n assert(imgA.GetWidth() == blocksW);\n\n std::vector<uint64> blocks;\n blocks.reserve(blocksW * blocksH);\n for(uint32 j = 0; j < blocksH; j++) {\n for(uint32 i = 0; i < blocksW; i++) {\n Block b;\n b.SetColorA(imgA(i, j), true);\n b.SetColorB(imgB(i, j), true);\n for(uint32 t = 0; t < 16; t++) {\n uint32 x = i*4 + (t%4);\n uint32 y = j*4 + (t\/4);\n b.SetLerpValue(t, modValues[y*dcj.width + x]);\n }\n blocks.push_back(b.Pack());\n }\n }\n\n \/\/ Spit out the blocks...\n for(uint32 j = 0; j < blocksH; j++) {\n for(uint32 i = 0; i < blocksW; i++) {\n\n \/\/ The blocks are initially arranged in morton order. Let's\n \/\/ linearize them...\n uint32 idx = Interleave(j, i);\n\n uint64 *outPtr = reinterpret_cast<uint64 *>(dcj.outBuf);\n outPtr[idx] = blocks[j*blocksW + i];\n }\n }\n }\n\n} \/\/ namespace PVRTCC\n<|endoftext|>"} {"text":"<commit_before>\/**************************************************************************\r\n* Copyright(c) 1998-1999, ALICE Experiment at CERN, All rights reserved. *\r\n* *\r\n* Author: The ALICE Off-line Project. *\r\n* Contributors are mentioned in the code where appropriate. *\r\n* *\r\n* Permission to use, copy, modify and distribute this software and its *\r\n* documentation strictly for non-commercial purposes is hereby granted *\r\n* without fee, provided that the above copyright notice appears in all *\r\n* copies and that both the copyright notice and this permission notice *\r\n* appear in the supporting documentation. The authors make no claims *\r\n* about the suitability of this software for any purpose. It is *\r\n* provided \"as is\" without express or implied warranty. *\r\n**************************************************************************\/\r\n\r\n\/\/------------------------------------------------------------------------------\r\n\/\/ Implementation of the AliPerformanceTask class. It checks reconstruction performance \r\n\/\/ for the reconstructed vs MC particle tracks under several conditions. For real data \r\n\/\/ the control QA histograms are filled.\r\n\/\/\r\n\/\/ The comparison output objects deriving from AliPerformanceObject \r\n\/\/ (e.g. AliPerformanceRes, AliPerformanceEff, AliPerformanceDEdx, AliPerformanceDCA ...) \r\n\/\/ are stored in the output file (details in description of these classes).\r\n\/\/ \r\n\/\/ Author: J.Otwinowski 01\/04\/2009 \r\n\/\/ Changes by M.Knichel 15\/10\/2010\r\n\/\/------------------------------------------------------------------------------\r\n\r\n#include \"iostream\"\r\n\r\n#include \"TChain.h\"\r\n#include \"TTree.h\"\r\n#include \"TH1F.h\"\r\n#include \"TCanvas.h\"\r\n#include \"TList.h\"\r\n#include \"TFile.h\"\r\n#include \"TSystem.h\"\r\n\r\n#include \"AliAnalysisTask.h\"\r\n#include \"AliAnalysisManager.h\"\r\n#include \"AliESDEvent.h\"\r\n#include \"AliESDfriend.h\"\r\n#include \"AliMCEvent.h\"\r\n#include \"AliESDInputHandler.h\"\r\n#include \"AliMCEventHandler.h\"\r\n#include \"AliESDVertex.h\"\r\n#include \"AliMagF.h\"\r\n#include \"AliTracker.h\"\r\n#include \"AliGeomManager.h\"\r\n\r\n#include \"AliMCInfo.h\"\r\n#include \"AliESDRecInfo.h\"\r\n#include \"AliMCInfoCuts.h\"\r\n#include \"AliRecInfoCuts.h\"\r\n#include \"AliComparisonObject.h\"\r\n#include \"AliPerformanceObject.h\"\r\n#include \"AliTPCPerformanceSummary.h\"\r\n#include \"AliPerformanceTPC.h\"\r\n#include \"AliPerformanceDEdx.h\"\r\n#include \"AliPerformanceTask.h\"\r\n\r\n\r\nusing namespace std;\r\n\r\nClassImp(AliPerformanceTask)\r\n\r\n\/\/_____________________________________________________________________________\r\nAliPerformanceTask::AliPerformanceTask() \r\n : AliAnalysisTaskSE(\"Performance\")\r\n , fESD(0)\r\n , fESDfriend(0)\r\n , fMC(0)\r\n , fOutput(0)\r\n , fOutputSummary(0)\r\n , fPitList(0)\r\n , fCompList(0)\r\n , fUseMCInfo(kFALSE)\r\n , fUseESDfriend(kFALSE)\r\n , fUseHLT(kFALSE)\r\n{\r\n \/\/ Dummy Constructor\r\n \/\/ should not be used\r\n}\r\n\r\n\/\/_____________________________________________________________________________\r\nAliPerformanceTask::AliPerformanceTask(const char *name, const char *\/*title*\/) \r\n : AliAnalysisTaskSE(name)\r\n , fESD(0)\r\n , fESDfriend(0)\r\n , fMC(0)\r\n , fOutput(0)\r\n , fOutputSummary(0)\r\n , fPitList(0)\r\n , fCompList(0)\r\n , fUseMCInfo(kFALSE)\r\n , fUseESDfriend(kFALSE)\r\n , fUseHLT(kFALSE)\r\n{\r\n \/\/ Constructor\r\n\r\n \/\/ Define input and output slots here\r\n DefineOutput(1, TList::Class());\r\n DefineOutput(2, TTree::Class());\r\n\r\n \/\/ create the list for comparison objects\r\n fCompList = new TList;\r\n}\r\n\r\n\/\/_____________________________________________________________________________\r\nAliPerformanceTask::~AliPerformanceTask()\r\n{\r\n if (fOutput) delete fOutput; fOutput = 0; \r\n if (fOutputSummary) delete fOutputSummary; fOutputSummary = 0;\r\n if (fCompList) delete fCompList; fCompList = 0; \r\n}\r\n\r\n\/\/_____________________________________________________________________________\r\nBool_t AliPerformanceTask::AddPerformanceObject(AliPerformanceObject *pObj) \r\n{\r\n \/\/ add comparison object to the list\r\n if(pObj == 0) {\r\n Printf(\"ERROR: Could not add comparison object\");\r\n return kFALSE;\r\n }\r\n\r\n \/\/ add object to the list\r\n fCompList->AddLast(pObj);\r\n \r\nreturn kTRUE;\r\n}\r\n\r\n\/\/_____________________________________________________________________________\r\nvoid AliPerformanceTask::UserCreateOutputObjects()\r\n{\r\n \/\/ Create histograms\r\n \/\/ Called once\r\n\r\n \/\/ create output list\r\n fOutput = new TList;\r\n fOutput->SetOwner();\r\n fPitList = fOutput->MakeIterator();\r\n \r\n \/\/ create output list\r\n \/\/fOutputSummary = new TTree;\r\n \r\n \/\/ add comparison objects to the output\r\n AliPerformanceObject *pObj=0;\r\n Int_t count=0;\r\n TIterator *pitCompList = fCompList->MakeIterator();\r\n pitCompList->Reset();\r\n while(( pObj = (AliPerformanceObject *)pitCompList->Next()) != NULL) {\r\n fOutput->Add(pObj);\r\n count++;\r\n }\r\n Printf(\"UserCreateOutputObjects(): Number of output comparison objects: %d \\n\", count);\r\n \r\n PostData(1, fOutput); \r\n \/\/PostData(2, fOutputSummary); \r\n}\r\n\r\n\/\/_____________________________________________________________________________\r\nvoid AliPerformanceTask::UserExec(Option_t *) \r\n{\r\n \/\/ Main loop\r\n \/\/ Called for each event\r\n\r\n \/\/ Decide whether to use HLT or Offline ESD\r\n if(fUseHLT){\r\n\r\n AliESDInputHandler *esdH = dynamic_cast<AliESDInputHandler*> \r\n (AliAnalysisManager::GetAnalysisManager()->GetInputEventHandler());\r\n \r\n if (!esdH) {\r\n printf(\"ERROR: Could not get ESDInputHandler\");\r\n return;\r\n } \r\n fESD = esdH->GetHLTEvent();\r\n }\/\/ end if fUseHLT\r\n else \r\n fESD = (AliESDEvent*) (InputEvent());\r\n\r\n if(fUseESDfriend)\r\n {\r\n fESDfriend = static_cast<AliESDfriend*>(fESD->FindListObject(\"AliESDfriend\"));\r\n if(!fESDfriend) {\r\n Printf(\"ERROR: ESD friends not available\");\r\n }\r\n }\r\n \r\n if(fUseMCInfo) {\r\n fMC = MCEvent();\r\n } \r\n\r\n \/\/\r\n AliPerformanceObject *pObj=0;\r\n\r\n if (!fESD) {\r\n Printf(\"ERROR: ESD event not available\");\r\n return;\r\n }\r\n \r\n if (fUseMCInfo && !fMC) {\r\n Printf(\"ERROR: MC event not available\");\r\n return;\r\n }\r\n\r\n if(fUseESDfriend)\r\n {\r\n if(!fESDfriend) {\r\n Printf(\"ERROR: ESD friends not available\");\r\n }\r\n }\r\n\r\n \/\/ Process comparison\r\n fPitList->Reset();\r\n while(( pObj = (AliPerformanceObject *)fPitList->Next()) != NULL) {\r\n pObj->Exec(fMC,fESD,fESDfriend,fUseMCInfo,fUseESDfriend);\r\n }\r\n\r\n \/\/ Post output data.\r\n PostData(1, fOutput);\r\n}\r\n\r\n\/\/_____________________________________________________________________________\r\nvoid AliPerformanceTask::Terminate(Option_t *) \r\n{\r\n \/\/ Called once at the end \r\n \r\n \/\/ check output data\r\n fOutputSummary = dynamic_cast<TTree*> (GetOutputData(2));\r\n fOutput = dynamic_cast<TList*> (GetOutputData(1));\r\n if (!fOutput) {\r\n Printf(\"ERROR: AliPerformanceTask::Terminate(): fOutput data not available ...\" );\r\n return;\r\n }\r\n if (fOutputSummary) { delete fOutputSummary; fOutputSummary=0; } \r\n AliPerformanceObject* pObj=0;\r\n AliPerformanceTPC* pTPC = 0;\r\n AliPerformanceDEdx* pDEdx = 0;\r\n TIterator* itOut = fOutput->MakeIterator();\r\n itOut->Reset();\r\n while(( pObj = dynamic_cast<AliPerformanceObject*>(itOut->Next())) != NULL) { \r\n if (! pTPC) { pTPC = dynamic_cast<AliPerformanceTPC*>(pObj); }\r\n if (! pDEdx) { pDEdx = dynamic_cast<AliPerformanceDEdx*>(pObj); }\r\n }\r\n if (! AliCDBManager::Instance()->GetDefaultStorage()) { AliCDBManager::Instance()->SetDefaultStorage(\"raw:\/\/\"); }\r\n TUUID uuid;\r\n TString tmpFile = gSystem->TempDirectory() + TString(\"\/TPCQASummary.\") + uuid.AsString() + TString(\".root\");\r\n AliTPCPerformanceSummary::WriteToFile(pTPC, pDEdx, tmpFile.Data());\r\n TChain* chain = new TChain(\"tpcQA\");\r\n chain->Add(tmpFile.Data());\r\n TTree *tree = chain->CopyTree(\"1\");\r\n if (chain) { delete chain; chain=0; }\r\n fOutputSummary = tree;\r\n \r\n \/\/ Post output data.\r\n PostData(2, fOutputSummary);\r\n\r\n}\r\n\r\n\/\/_____________________________________________________________________________\r\nvoid AliPerformanceTask::FinishTaskOutput()\r\n{\r\n \/\/ called once at the end of each job (on the workernode)\r\n \/\/\r\n \/\/ projects THnSparse to TH1,2,3\r\n \r\n fOutput = dynamic_cast<TList*> (GetOutputData(1));\r\n if (!fOutput) {\r\n Printf(\"ERROR: AliPerformanceTask::FinishTaskOutput(): fOutput data not available ...\" );\r\n return;\r\n }\r\n\r\n AliPerformanceObject* pObj=0;\r\n TIterator* itOut = fOutput->MakeIterator(); \r\n itOut->Reset();\r\n while(( pObj = dynamic_cast<AliPerformanceObject*>(itOut->Next())) != NULL) {\r\n pObj->SetRunNumber(fCurrentRunNumber);\r\n pObj->Analyse();\r\n }\r\n \r\n \/\/ Post output data.\r\n PostData(1, fOutput);\r\n}\r\n\r\n\/\/_____________________________________________________________________________\r\nBool_t AliPerformanceTask::Notify()\r\n{\r\n static Int_t count = 0;\r\n count++;\r\n Printf(\"Processing %d. file\", count);\r\n\r\n return kTRUE;\r\n}\r\n<commit_msg>missing include<commit_after>\/**************************************************************************\r\n* Copyright(c) 1998-1999, ALICE Experiment at CERN, All rights reserved. *\r\n* *\r\n* Author: The ALICE Off-line Project. *\r\n* Contributors are mentioned in the code where appropriate. *\r\n* *\r\n* Permission to use, copy, modify and distribute this software and its *\r\n* documentation strictly for non-commercial purposes is hereby granted *\r\n* without fee, provided that the above copyright notice appears in all *\r\n* copies and that both the copyright notice and this permission notice *\r\n* appear in the supporting documentation. The authors make no claims *\r\n* about the suitability of this software for any purpose. It is *\r\n* provided \"as is\" without express or implied warranty. *\r\n**************************************************************************\/\r\n\r\n\/\/------------------------------------------------------------------------------\r\n\/\/ Implementation of the AliPerformanceTask class. It checks reconstruction performance \r\n\/\/ for the reconstructed vs MC particle tracks under several conditions. For real data \r\n\/\/ the control QA histograms are filled.\r\n\/\/\r\n\/\/ The comparison output objects deriving from AliPerformanceObject \r\n\/\/ (e.g. AliPerformanceRes, AliPerformanceEff, AliPerformanceDEdx, AliPerformanceDCA ...) \r\n\/\/ are stored in the output file (details in description of these classes).\r\n\/\/ \r\n\/\/ Author: J.Otwinowski 01\/04\/2009 \r\n\/\/ Changes by M.Knichel 15\/10\/2010\r\n\/\/------------------------------------------------------------------------------\r\n\r\n#include \"iostream\"\r\n\r\n#include \"TChain.h\"\r\n#include \"TTree.h\"\r\n#include \"TH1F.h\"\r\n#include \"TCanvas.h\"\r\n#include \"TList.h\"\r\n#include \"TFile.h\"\r\n#include \"TSystem.h\"\r\n\r\n#include \"AliAnalysisTask.h\"\r\n#include \"AliAnalysisManager.h\"\r\n#include \"AliESDEvent.h\"\r\n#include \"AliESDfriend.h\"\r\n#include \"AliMCEvent.h\"\r\n#include \"AliESDInputHandler.h\"\r\n#include \"AliMCEventHandler.h\"\r\n#include \"AliESDVertex.h\"\r\n#include \"AliMagF.h\"\r\n#include \"AliTracker.h\"\r\n#include \"AliGeomManager.h\"\r\n#include \"AliCDBManager.h\"\r\n\r\n#include \"AliMCInfo.h\"\r\n#include \"AliESDRecInfo.h\"\r\n#include \"AliMCInfoCuts.h\"\r\n#include \"AliRecInfoCuts.h\"\r\n#include \"AliComparisonObject.h\"\r\n#include \"AliPerformanceObject.h\"\r\n#include \"AliTPCPerformanceSummary.h\"\r\n#include \"AliPerformanceTPC.h\"\r\n#include \"AliPerformanceDEdx.h\"\r\n#include \"AliPerformanceTask.h\"\r\n\r\n\r\nusing namespace std;\r\n\r\nClassImp(AliPerformanceTask)\r\n\r\n\/\/_____________________________________________________________________________\r\nAliPerformanceTask::AliPerformanceTask() \r\n : AliAnalysisTaskSE(\"Performance\")\r\n , fESD(0)\r\n , fESDfriend(0)\r\n , fMC(0)\r\n , fOutput(0)\r\n , fOutputSummary(0)\r\n , fPitList(0)\r\n , fCompList(0)\r\n , fUseMCInfo(kFALSE)\r\n , fUseESDfriend(kFALSE)\r\n , fUseHLT(kFALSE)\r\n{\r\n \/\/ Dummy Constructor\r\n \/\/ should not be used\r\n}\r\n\r\n\/\/_____________________________________________________________________________\r\nAliPerformanceTask::AliPerformanceTask(const char *name, const char *\/*title*\/) \r\n : AliAnalysisTaskSE(name)\r\n , fESD(0)\r\n , fESDfriend(0)\r\n , fMC(0)\r\n , fOutput(0)\r\n , fOutputSummary(0)\r\n , fPitList(0)\r\n , fCompList(0)\r\n , fUseMCInfo(kFALSE)\r\n , fUseESDfriend(kFALSE)\r\n , fUseHLT(kFALSE)\r\n{\r\n \/\/ Constructor\r\n\r\n \/\/ Define input and output slots here\r\n DefineOutput(1, TList::Class());\r\n DefineOutput(2, TTree::Class());\r\n\r\n \/\/ create the list for comparison objects\r\n fCompList = new TList;\r\n}\r\n\r\n\/\/_____________________________________________________________________________\r\nAliPerformanceTask::~AliPerformanceTask()\r\n{\r\n if (fOutput) delete fOutput; fOutput = 0; \r\n if (fOutputSummary) delete fOutputSummary; fOutputSummary = 0;\r\n if (fCompList) delete fCompList; fCompList = 0; \r\n}\r\n\r\n\/\/_____________________________________________________________________________\r\nBool_t AliPerformanceTask::AddPerformanceObject(AliPerformanceObject *pObj) \r\n{\r\n \/\/ add comparison object to the list\r\n if(pObj == 0) {\r\n Printf(\"ERROR: Could not add comparison object\");\r\n return kFALSE;\r\n }\r\n\r\n \/\/ add object to the list\r\n fCompList->AddLast(pObj);\r\n \r\nreturn kTRUE;\r\n}\r\n\r\n\/\/_____________________________________________________________________________\r\nvoid AliPerformanceTask::UserCreateOutputObjects()\r\n{\r\n \/\/ Create histograms\r\n \/\/ Called once\r\n\r\n \/\/ create output list\r\n fOutput = new TList;\r\n fOutput->SetOwner();\r\n fPitList = fOutput->MakeIterator();\r\n \r\n \/\/ create output list\r\n \/\/fOutputSummary = new TTree;\r\n \r\n \/\/ add comparison objects to the output\r\n AliPerformanceObject *pObj=0;\r\n Int_t count=0;\r\n TIterator *pitCompList = fCompList->MakeIterator();\r\n pitCompList->Reset();\r\n while(( pObj = (AliPerformanceObject *)pitCompList->Next()) != NULL) {\r\n fOutput->Add(pObj);\r\n count++;\r\n }\r\n Printf(\"UserCreateOutputObjects(): Number of output comparison objects: %d \\n\", count);\r\n \r\n PostData(1, fOutput); \r\n \/\/PostData(2, fOutputSummary); \r\n}\r\n\r\n\/\/_____________________________________________________________________________\r\nvoid AliPerformanceTask::UserExec(Option_t *) \r\n{\r\n \/\/ Main loop\r\n \/\/ Called for each event\r\n\r\n \/\/ Decide whether to use HLT or Offline ESD\r\n if(fUseHLT){\r\n\r\n AliESDInputHandler *esdH = dynamic_cast<AliESDInputHandler*> \r\n (AliAnalysisManager::GetAnalysisManager()->GetInputEventHandler());\r\n \r\n if (!esdH) {\r\n printf(\"ERROR: Could not get ESDInputHandler\");\r\n return;\r\n } \r\n fESD = esdH->GetHLTEvent();\r\n }\/\/ end if fUseHLT\r\n else \r\n fESD = (AliESDEvent*) (InputEvent());\r\n\r\n if(fUseESDfriend)\r\n {\r\n fESDfriend = static_cast<AliESDfriend*>(fESD->FindListObject(\"AliESDfriend\"));\r\n if(!fESDfriend) {\r\n Printf(\"ERROR: ESD friends not available\");\r\n }\r\n }\r\n \r\n if(fUseMCInfo) {\r\n fMC = MCEvent();\r\n } \r\n\r\n \/\/\r\n AliPerformanceObject *pObj=0;\r\n\r\n if (!fESD) {\r\n Printf(\"ERROR: ESD event not available\");\r\n return;\r\n }\r\n \r\n if (fUseMCInfo && !fMC) {\r\n Printf(\"ERROR: MC event not available\");\r\n return;\r\n }\r\n\r\n if(fUseESDfriend)\r\n {\r\n if(!fESDfriend) {\r\n Printf(\"ERROR: ESD friends not available\");\r\n }\r\n }\r\n\r\n \/\/ Process comparison\r\n fPitList->Reset();\r\n while(( pObj = (AliPerformanceObject *)fPitList->Next()) != NULL) {\r\n pObj->Exec(fMC,fESD,fESDfriend,fUseMCInfo,fUseESDfriend);\r\n }\r\n\r\n \/\/ Post output data.\r\n PostData(1, fOutput);\r\n}\r\n\r\n\/\/_____________________________________________________________________________\r\nvoid AliPerformanceTask::Terminate(Option_t *) \r\n{\r\n \/\/ Called once at the end \r\n \r\n \/\/ check output data\r\n fOutputSummary = dynamic_cast<TTree*> (GetOutputData(2));\r\n fOutput = dynamic_cast<TList*> (GetOutputData(1));\r\n if (!fOutput) {\r\n Printf(\"ERROR: AliPerformanceTask::Terminate(): fOutput data not available ...\" );\r\n return;\r\n }\r\n if (fOutputSummary) { delete fOutputSummary; fOutputSummary=0; } \r\n AliPerformanceObject* pObj=0;\r\n AliPerformanceTPC* pTPC = 0;\r\n AliPerformanceDEdx* pDEdx = 0;\r\n TIterator* itOut = fOutput->MakeIterator();\r\n itOut->Reset();\r\n while(( pObj = dynamic_cast<AliPerformanceObject*>(itOut->Next())) != NULL) { \r\n if (! pTPC) { pTPC = dynamic_cast<AliPerformanceTPC*>(pObj); }\r\n if (! pDEdx) { pDEdx = dynamic_cast<AliPerformanceDEdx*>(pObj); }\r\n }\r\n if (! AliCDBManager::Instance()->GetDefaultStorage()) { AliCDBManager::Instance()->SetDefaultStorage(\"raw:\/\/\"); }\r\n TUUID uuid;\r\n TString tmpFile = gSystem->TempDirectory() + TString(\"\/TPCQASummary.\") + uuid.AsString() + TString(\".root\");\r\n AliTPCPerformanceSummary::WriteToFile(pTPC, pDEdx, tmpFile.Data());\r\n TChain* chain = new TChain(\"tpcQA\");\r\n chain->Add(tmpFile.Data());\r\n TTree *tree = chain->CopyTree(\"1\");\r\n if (chain) { delete chain; chain=0; }\r\n fOutputSummary = tree;\r\n \r\n \/\/ Post output data.\r\n PostData(2, fOutputSummary);\r\n\r\n}\r\n\r\n\/\/_____________________________________________________________________________\r\nvoid AliPerformanceTask::FinishTaskOutput()\r\n{\r\n \/\/ called once at the end of each job (on the workernode)\r\n \/\/\r\n \/\/ projects THnSparse to TH1,2,3\r\n \r\n fOutput = dynamic_cast<TList*> (GetOutputData(1));\r\n if (!fOutput) {\r\n Printf(\"ERROR: AliPerformanceTask::FinishTaskOutput(): fOutput data not available ...\" );\r\n return;\r\n }\r\n\r\n AliPerformanceObject* pObj=0;\r\n TIterator* itOut = fOutput->MakeIterator(); \r\n itOut->Reset();\r\n while(( pObj = dynamic_cast<AliPerformanceObject*>(itOut->Next())) != NULL) {\r\n pObj->SetRunNumber(fCurrentRunNumber);\r\n pObj->Analyse();\r\n }\r\n \r\n \/\/ Post output data.\r\n PostData(1, fOutput);\r\n}\r\n\r\n\/\/_____________________________________________________________________________\r\nBool_t AliPerformanceTask::Notify()\r\n{\r\n static Int_t count = 0;\r\n count++;\r\n Printf(\"Processing %d. file\", count);\r\n\r\n return kTRUE;\r\n}\r\n<|endoftext|>"} {"text":"<commit_before>\/** @file\n\n A brief file description\n\n @section license License\n\n Licensed to the Apache Software Foundation (ASF) under one\n or more contributor license agreements. See the NOTICE file\n distributed with this work for additional information\n regarding copyright ownership. The ASF licenses this file\n to you under the Apache License, Version 2.0 (the\n \"License\"); you may not use this file except in compliance\n with the License. You may obtain a copy of the License at\n\n http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n\n Unless required by applicable law or agreed to in writing, software\n distributed under the License is distributed on an \"AS IS\" BASIS,\n WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n See the License for the specific language governing permissions and\n limitations under the License.\n *\/\n\n\/****************************************************************************\n\n Basic Threads\n\n\n\n**************************************************************************\/\n#include \"P_EventSystem.h\"\n#include \"ts\/ink_string.h\"\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ Common Interface impl \/\/\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nstatic ink_thread_key init_thread_key();\n\nink_hrtime Thread::cur_time = ink_get_hrtime_internal();\ninkcoreapi ink_thread_key Thread::thread_data_key = init_thread_key();\n\nThread::Thread()\n{\n mutex = new_ProxyMutex();\n MUTEX_TAKE_LOCK(mutex, (EThread *)this);\n mutex->nthread_holding += THREAD_MUTEX_THREAD_HOLDING;\n}\n\nThread::~Thread()\n{\n ink_release_assert(mutex->thread_holding == (EThread *)this);\n mutex->nthread_holding -= THREAD_MUTEX_THREAD_HOLDING;\n MUTEX_UNTAKE_LOCK(mutex, (EThread *)this);\n}\n\nink_thread_key\ninit_thread_key()\n{\n ink_thread_key_create(&Thread::thread_data_key, nullptr);\n return Thread::thread_data_key;\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ Unix & non-NT Interface impl \/\/\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nstruct thread_data_internal {\n ThreadFunction f; \/\/\/< Function to excecute in the thread.\n Thread *me; \/\/\/< The class instance.\n char name[MAX_THREAD_NAME_LENGTH]; \/\/\/< Name for the thread.\n};\n\nstatic void *\nspawn_thread_internal(void *a)\n{\n auto *p = static_cast<thread_data_internal *>(a);\n\n p->me->set_specific();\n ink_set_thread_name(p->name);\n\n if (p->f) {\n p->f();\n } else {\n p->me->execute();\n }\n\n delete p;\n return nullptr;\n}\n\nink_thread\nThread::start(const char *name, void *stack, size_t stacksize, ThreadFunction const &f)\n{\n auto *p = new thread_data_internal{f, this, \"\"};\n\n ink_zero(p->name);\n ink_strlcpy(p->name, name, MAX_THREAD_NAME_LENGTH);\n if (stacksize == 0) {\n stacksize = DEFAULT_STACKSIZE;\n }\n tid = ink_thread_create(spawn_thread_internal, p, 0, stacksize, stack);\n\n return tid;\n}\n<commit_msg>Fix race condition in thread startup.<commit_after>\/** @file\n\n A brief file description\n\n @section license License\n\n Licensed to the Apache Software Foundation (ASF) under one\n or more contributor license agreements. See the NOTICE file\n distributed with this work for additional information\n regarding copyright ownership. The ASF licenses this file\n to you under the Apache License, Version 2.0 (the\n \"License\"); you may not use this file except in compliance\n with the License. You may obtain a copy of the License at\n\n http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n\n Unless required by applicable law or agreed to in writing, software\n distributed under the License is distributed on an \"AS IS\" BASIS,\n WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n See the License for the specific language governing permissions and\n limitations under the License.\n *\/\n\n\/****************************************************************************\n\n Basic Threads\n\n\n\n**************************************************************************\/\n#include \"P_EventSystem.h\"\n#include \"ts\/ink_string.h\"\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ Common Interface impl \/\/\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nstatic ink_thread_key init_thread_key();\n\nink_hrtime Thread::cur_time = ink_get_hrtime_internal();\ninkcoreapi ink_thread_key Thread::thread_data_key = init_thread_key();\n\nThread::Thread()\n{\n mutex = new_ProxyMutex();\n MUTEX_TAKE_LOCK(mutex, (EThread *)this);\n mutex->nthread_holding += THREAD_MUTEX_THREAD_HOLDING;\n}\n\nThread::~Thread()\n{\n ink_release_assert(mutex->thread_holding == (EThread *)this);\n mutex->nthread_holding -= THREAD_MUTEX_THREAD_HOLDING;\n MUTEX_UNTAKE_LOCK(mutex, (EThread *)this);\n}\n\nink_thread_key\ninit_thread_key()\n{\n ink_thread_key_create(&Thread::thread_data_key, nullptr);\n return Thread::thread_data_key;\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ Unix & non-NT Interface impl \/\/\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nstruct thread_data_internal {\n ThreadFunction f; \/\/\/< Function to excecute in the thread.\n Thread *me; \/\/\/< The class instance.\n ink_mutex mutex; \/\/\/< Startup mutex.\n char name[MAX_THREAD_NAME_LENGTH]; \/\/\/< Name for the thread.\n};\n\nstatic void *\nspawn_thread_internal(void *a)\n{\n auto *p = static_cast<thread_data_internal *>(a);\n\n { \/\/ force wait until parent thread is ready.\n ink_scoped_mutex_lock lock(p->mutex);\n }\n ink_mutex_destroy(&p->mutex);\n\n p->me->set_specific();\n ink_set_thread_name(p->name);\n\n if (p->f) {\n p->f();\n } else {\n p->me->execute();\n }\n\n delete p;\n return nullptr;\n}\n\nink_thread\nThread::start(const char *name, void *stack, size_t stacksize, ThreadFunction const &f)\n{\n auto *p = new thread_data_internal{f, this, {}, {0}};\n\n ink_zero(p->name);\n ink_strlcpy(p->name, name, MAX_THREAD_NAME_LENGTH);\n ink_mutex_init(&p->mutex);\n if (stacksize == 0) {\n stacksize = DEFAULT_STACKSIZE;\n }\n { \/\/ must force assignment to complete before thread touches \"this\".\n ink_scoped_mutex_lock lock(&p->mutex);\n tid = ink_thread_create(spawn_thread_internal, p, 0, stacksize, stack);\n }\n\n return tid;\n}\n<|endoftext|>"} {"text":"<commit_before>\/**\n * \\file\n * \\brief StaticRawFifoQueue class header\n *\n * \\author Copyright (C) 2015 Kamil Szczygiel http:\/\/www.distortec.com http:\/\/www.freddiechopin.info\n *\n * \\par License\n * This Source Code Form is subject to the terms of the Mozilla Public License, v. 2.0. If a copy of the MPL was not\n * distributed with this file, You can obtain one at http:\/\/mozilla.org\/MPL\/2.0\/.\n *\n * \\date 2015-01-09\n *\/\n\n#ifndef INCLUDE_DISTORTOS_STATICRAWFIFOQUEUE_HPP_\n#define INCLUDE_DISTORTOS_STATICRAWFIFOQUEUE_HPP_\n\n#include \"RawFifoQueue.hpp\"\n\nnamespace distortos\n{\n\n\/**\n * \\brief StaticRawFifoQueue class is a variant of RawFifoQueue that has automatic storage for queue's contents.\n *\n * \\param T is the type of data in queue\n * \\param QueueSize is the maximum number of elements in queue\n *\/\n\ntemplate<typename T, size_t QueueSize>\nclass StaticRawFifoQueue : public RawFifoQueue\n{\npublic:\n\n\t\/**\n\t * \\brief StaticRawFifoQueue's constructor\n\t *\/\n\n\texplicit StaticRawFifoQueue() :\n\t\t\tRawFifoQueue{storage_}\n\t{\n\n\t}\n\nprivate:\n\n\t\/\/\/ storage for queue's contents\n\tstd::array<typename std::aligned_storage<sizeof(T), alignof(T)>::type, QueueSize> storage_;\n};\n\n\/**\n * \\brief StaticRawFifoQueueFromSize type alias is a variant of StaticRawFifoQueue which uses size of element (instead\n * of type) as template argument.\n *\n * \\param ElementSize is the size of single queue element, bytes\n * \\param QueueSize is the maximum number of elements in queue\n *\/\n\ntemplate<size_t ElementSize, size_t QueueSize>\nusing StaticRawFifoQueueFromSize =\n\t\tStaticRawFifoQueue<typename std::aligned_storage<ElementSize, ElementSize>::type, QueueSize>;\n\n}\t\/\/ namespace distortos\n\n#endif\t\/\/ INCLUDE_DISTORTOS_STATICRAWFIFOQUEUE_HPP_\n<commit_msg>StaticRawFifoQueue: use composition instead of inheritance<commit_after>\/**\n * \\file\n * \\brief StaticRawFifoQueue class header\n *\n * \\author Copyright (C) 2015 Kamil Szczygiel http:\/\/www.distortec.com http:\/\/www.freddiechopin.info\n *\n * \\par License\n * This Source Code Form is subject to the terms of the Mozilla Public License, v. 2.0. If a copy of the MPL was not\n * distributed with this file, You can obtain one at http:\/\/mozilla.org\/MPL\/2.0\/.\n *\n * \\date 2015-10-15\n *\/\n\n#ifndef INCLUDE_DISTORTOS_STATICRAWFIFOQUEUE_HPP_\n#define INCLUDE_DISTORTOS_STATICRAWFIFOQUEUE_HPP_\n\n#include \"RawFifoQueue.hpp\"\n\nnamespace distortos\n{\n\n\/**\n * \\brief StaticRawFifoQueue class is a wrapper for RawFifoQueue that also provides automatic storage for queue's\n * contents.\n *\n * \\note Objects of this class can be safely casted to (const) reference to RawFifoQueue.\n *\n * \\param T is the type of data in queue\n * \\param QueueSize is the maximum number of elements in queue\n *\/\n\ntemplate<typename T, size_t QueueSize>\nclass StaticRawFifoQueue\n{\npublic:\n\n\t\/**\n\t * \\brief StaticRawFifoQueue's constructor\n\t *\/\n\n\texplicit StaticRawFifoQueue() :\n\t\t\trawFifoQueue_{storage_}\n\t{\n\n\t}\n\n\t\/**\n\t * \\brief conversion to RawFifoQueue&\n\t *\n\t * \\return reference to internal RawFifoQueue object\n\t *\/\n\n\toperator RawFifoQueue&()\n\t{\n\t\treturn rawFifoQueue_;\n\t}\n\n\t\/**\n\t * \\brief conversion to const RawFifoQueue&\n\t *\n\t * \\return const reference to internal RawFifoQueue object\n\t *\/\n\n\toperator const RawFifoQueue&() const\n\t{\n\t\treturn rawFifoQueue_;\n\t}\n\n\t\/**\n\t * \\brief Wrapper for RawFifoQueue::pop(void*, size_t)\n\t *\/\n\n\tint pop(void* const buffer, const size_t size)\n\t{\n\t\treturn rawFifoQueue_.pop(buffer, size);\n\t}\n\n\t\/**\n\t * \\brief Wrapper for RawFifoQueue::pop(T&)\n\t *\/\n\n\ttemplate<typename U>\n\tint pop(U& buffer)\n\t{\n\t\treturn rawFifoQueue_.pop(buffer);\n\t}\n\n\t\/**\n\t * \\brief Wrapper for RawFifoQueue::push(const void*, size_t)\n\t *\/\n\n\tint push(const void* const data, const size_t size)\n\t{\n\t\treturn rawFifoQueue_.push(data, size);\n\t}\n\n\t\/**\n\t * \\brief Wrapper for RawFifoQueue::push(const T&)\n\t *\/\n\n\ttemplate<typename U>\n\tint push(const U& data)\n\t{\n\t\treturn rawFifoQueue_.push(data);\n\t}\n\n\t\/**\n\t * \\brief Wrapper for RawFifoQueue::tryPop(void*, size_t)\n\t *\/\n\n\tint tryPop(void* const buffer, const size_t size)\n\t{\n\t\treturn rawFifoQueue_.tryPop(buffer, size);\n\t}\n\n\t\/**\n\t * \\brief Wrapper for RawFifoQueue::tryPop(T&)\n\t *\/\n\n\ttemplate<typename U>\n\tint tryPop(U& buffer)\n\t{\n\t\treturn rawFifoQueue_.tryPop(buffer);\n\t}\n\n\t\/**\n\t * \\brief Wrapper for RawFifoQueue::tryPopFor(std::chrono::duration<Rep, Period>, void*, size_t)\n\t *\/\n\n\ttemplate<typename Rep, typename Period>\n\tint tryPopFor(const std::chrono::duration<Rep, Period> duration, void* const buffer, const size_t size)\n\t{\n\t\treturn rawFifoQueue_.tryPopFor(duration, buffer, size);\n\t}\n\n\t\/**\n\t * \\brief Wrapper for RawFifoQueue::tryPopFor(std::chrono::duration<Rep, Period>, T&)\n\t *\/\n\n\ttemplate<typename Rep, typename Period, typename U>\n\tint tryPopFor(const std::chrono::duration<Rep, Period> duration, U& buffer)\n\t{\n\t\treturn rawFifoQueue_.tryPopFor(duration, buffer);\n\t}\n\n\t\/**\n\t * \\brief Wrapper for RawFifoQueue::tryPopUntil(std::chrono::time_point<TickClock, Duration>, void*, size_t)\n\t *\/\n\n\ttemplate<typename Duration>\n\tint tryPopUntil(const std::chrono::time_point<TickClock, Duration> timePoint, void* const buffer, const size_t size)\n\t{\n\t\treturn rawFifoQueue_.tryPopUntil(timePoint, buffer, size);\n\t}\n\n\t\/**\n\t * \\brief Wrapper for RawFifoQueue::tryPopUntil(std::chrono::time_point<TickClock, Duration>, T&)\n\t *\/\n\n\ttemplate<typename Duration, typename U>\n\tint tryPopUntil(const std::chrono::time_point<TickClock, Duration> timePoint, U& buffer)\n\t{\n\t\treturn rawFifoQueue_.tryPopUntil(timePoint, buffer);\n\t}\n\n\t\/**\n\t * \\brief Wrapper for RawFifoQueue::tryPush(const void*, size_t)\n\t *\/\n\n\tint tryPush(const void* const data, const size_t size)\n\t{\n\t\treturn rawFifoQueue_.tryPush(data, size);\n\t}\n\n\t\/**\n\t * \\brief Wrapper for RawFifoQueue::tryPush(const T&)\n\t *\/\n\n\ttemplate<typename U>\n\tint tryPush(const U& data)\n\t{\n\t\treturn rawFifoQueue_.tryPush(data);\n\t}\n\n\t\/**\n\t * \\brief Wrapper for RawFifoQueue::tryPushFor(std::chrono::duration<Rep, Period>, const void*, size_t)\n\t *\/\n\n\ttemplate<typename Rep, typename Period>\n\tint tryPushFor(const std::chrono::duration<Rep, Period> duration, const void* const data, const size_t size)\n\t{\n\t\treturn rawFifoQueue_.tryPushFor(duration, data, size);\n\t}\n\n\t\/**\n\t * \\brief Wrapper for RawFifoQueue::tryPushFor(std::chrono::duration<Rep, Period>, const T&)\n\t *\/\n\n\ttemplate<typename Rep, typename Period, typename U>\n\tint tryPushFor(const std::chrono::duration<Rep, Period> duration, const U& data)\n\t{\n\t\treturn rawFifoQueue_.tryPushFor(duration, data);\n\t}\n\n\t\/**\n\t * \\brief Wrapper for RawFifoQueue::tryPushUntil(std::chrono::time_point<TickClock, Duration>, const void*, size_t)\n\t *\/\n\n\ttemplate<typename Duration>\n\tint tryPushUntil(const std::chrono::time_point<TickClock, Duration> timePoint, const void* const data,\n\t\t\tconst size_t size)\n\t{\n\t\treturn rawFifoQueue_.tryPushUntil(timePoint, data, size);\n\t}\n\n\t\/**\n\t * \\brief Wrapper for RawFifoQueue::tryPushUntil(std::chrono::time_point<TickClock, Duration>, const T&)\n\t *\/\n\n\ttemplate<typename Duration, typename U>\n\tint tryPushUntil(const std::chrono::time_point<TickClock, Duration> timePoint, const U& data)\n\t{\n\t\treturn rawFifoQueue_.tryPushUntil(timePoint, data);\n\t}\n\nprivate:\n\n\t\/\/\/ storage for queue's contents\n\tstd::array<typename std::aligned_storage<sizeof(T), alignof(T)>::type, QueueSize> storage_;\n\n\t\/\/\/ internal RawFifoQueue object\n\tRawFifoQueue rawFifoQueue_;\n};\n\n\/**\n * \\brief StaticRawFifoQueueFromSize type alias is a variant of StaticRawFifoQueue which uses size of element (instead\n * of type) as template argument.\n *\n * \\param ElementSize is the size of single queue element, bytes\n * \\param QueueSize is the maximum number of elements in queue\n *\/\n\ntemplate<size_t ElementSize, size_t QueueSize>\nusing StaticRawFifoQueueFromSize =\n\t\tStaticRawFifoQueue<typename std::aligned_storage<ElementSize, ElementSize>::type, QueueSize>;\n\n}\t\/\/ namespace distortos\n\n#endif\t\/\/ INCLUDE_DISTORTOS_STATICRAWFIFOQUEUE_HPP_\n<|endoftext|>"} {"text":"<commit_before>#include <iostream>\n\nusing std::cin;\nusing std::cout;\nusing std::endl;\n\nint menu();\n\nint main(int argc, char*argv[]){\n\n\tif (menu() == 1){\n\t\tcout << \"prueba1\";\n\t}else if (menu() == 2){\n\t\tcout << \"prueba2\";\n\t}else if (menu() == 3){\n\t\tcout << \"prueba3\";\n\t}\n\n\treturn 0;\n}\n\nint menu(){\n\tint opcion;\n\n\tcout << \"Programa #1 (16)\" << endl\n\t\t<< \"Porgrama #2 (21)\" << endl\n\t\t<< \"Programa #3(357)\" << endl\n\t\t<< \"Ingrese una opcion: \";\n\tcin >> opcion; \n\n\treturn opcion;\n}\n\n\n<commit_msg>haciendo ejercicio numero 16<commit_after>#include <iostream>\n#include <cmath>\n\nusing std::cin;\nusing std::cout;\nusing std::endl;\nusing std::string;\n\nint menu();\ndouble PowerDigitSum(double, double);\n\nint main(int argc, char*argv[]){\n\n\tif (menu() == 1){\n\t\tdouble base, expo;\n\t\tcout << endl;\n\n\t\tcout << \"Ingrese una base: \";\n\t\tcin >> base;\n\n\t\tcout << \"Ingrese una potencia: \";\n\t\tcin >> expo;\n\t\tcout << endl;\n\n\t\tPowerDigitSum(base, expo);\n\n\t}else if (menu() == 2){\n\t\tcout << \"prueba2\";\n\t}else if (menu() == 3){\n\t\tcout << \"prueba3\";\n\t}\n\n\treturn 0;\n}\n\nint menu(){\n\tint opcion;\n\n\tcout << \"Programa #1 (16)\" << endl\n\t\t<< \"Porgrama #2 (21)\" << endl\n\t\t<< \"Programa #3(357)\" << endl\n\t\t<< \"Ingrese una opcion: \";\n\tcin >> opcion; \n\n\treturn opcion;\n}\n\ndouble PowerDigitSum(double base, double expo){\/\/no esta terminado\n\tdouble exponencial = pow(base, expo);\n\n\tcout << resultado;\n\n\treturn resultado;\n}\n\n\n<|endoftext|>"} {"text":"<commit_before><commit_msg>#103861#; use also for the onscreen position the parent position<commit_after><|endoftext|>"} {"text":"<commit_before><commit_msg>INTEGRATION: CWS changefileheader (1.2.234); FILE MERGED 2008\/04\/01 12:38:47 thb 1.2.234.2: #i85898# Stripping all external header guards 2008\/03\/31 13:58:01 rt 1.2.234.1: #i87441# Change license header to LPGL v3.<commit_after><|endoftext|>"} {"text":"<commit_before><commit_msg>renaissance1: #i107215# Fixed 64bit compilation problem.<commit_after><|endoftext|>"} {"text":"<commit_before>#pragma once\n#include \"mtao\/geometry\/prune_vertices.hpp\"\n#include <map>\n\nnamespace mtao { namespace geometry {\n \/\/expects a mtao::vector<mtao::Vector<T,D>>\n template <typename Container \n , typename Vec = typename Container::value_type\n , typename T = typename Vec::Scalar\n , int D = Vec::RowsAtCompileTime\n >\n std::tuple<Container,std::map<size_t,size_t>> prune(const Container& V, T eps = T(1e-8)) {\n Container ret_vec;\n KDTree<T,D> tree;\n std::map<size_t,size_t> remap;\n for(size_t i=0; i<V.size(); ++i) {\n remap[i] = tree.pruning_insertion(V[i],eps);\n }\n return {tree.points(),remap};\n }\n\n}}\n<commit_msg>updating for pruning functionality<commit_after>#pragma once\n#include \"mtao\/geometry\/prune_vertices.hpp\"\n#include <map>\n\nnamespace mtao { namespace geometry {\n \/\/expects a mtao::vector<mtao::Vector<T,D>>\n template <typename Container \n , typename Vec = typename Container::value_type\n , typename T = typename Vec::Scalar\n , int D = Vec::RowsAtCompileTime\n >\n std::tuple<Container,std::map<size_t,size_t>> prune(const Container& V, T eps = T(1e-8)) {\n using mtao::geometry;\n Container ret_vec;\n KDTree<T,D> tree;\n std::map<size_t,size_t> remap;\n for(size_t i=0; i<V.size(); ++i) {\n remap[i] = tree.pruning_insertion(V[i],eps);\n }\n return {tree.points(),remap};\n }\n\n}}\n<|endoftext|>"} {"text":"<commit_before><commit_msg>Add to response md5_content<commit_after><|endoftext|>"} {"text":"<commit_before>\/\/ Copyright (c) 2019 Dr. Colin Hirsch and Daniel Frey\n\/\/ Please see LICENSE for license or visit https:\/\/github.com\/taocpp\/PEGTL\/\n\n#ifndef TAO_PEGTL_CONTRIB_REP_STRING_HPP\n#define TAO_PEGTL_CONTRIB_REP_STRING_HPP\n\n#include <cstddef>\n\n#include \"..\/config.hpp\"\n#include \"..\/internal\/string.hpp\"\n\nnamespace tao\n{\n namespace TAO_PEGTL_NAMESPACE\n {\n namespace internal\n {\n template< std::size_t, typename, char... >\n struct make_rep_string;\n\n template< char... Ss, char... Cs >\n struct make_rep_string< 0, string< Ss... >, Cs... >\n {\n using type = string< Ss... >;\n };\n\n template< std::size_t N, char... Ss, char... Cs >\n struct make_rep_string< N, string< Ss... >, Cs... >\n : make_rep_string< N - 1, string< Ss..., Cs... >, Cs... >\n {\n };\n\n } \/\/ namespace internal\n\n inline namespace ascii\n {\n template< std::size_t N, char... Cs >\n struct rep_string\n : internal::make_rep_string< N, string<>, Cs... >::type\n {};\n\n } \/\/ namespace ascii\n\n } \/\/ namespace TAO_PEGTL_NAMESPACE\n\n} \/\/ namespace tao\n\n#endif\n<commit_msg>Add missing qualification<commit_after>\/\/ Copyright (c) 2019 Dr. Colin Hirsch and Daniel Frey\n\/\/ Please see LICENSE for license or visit https:\/\/github.com\/taocpp\/PEGTL\/\n\n#ifndef TAO_PEGTL_CONTRIB_REP_STRING_HPP\n#define TAO_PEGTL_CONTRIB_REP_STRING_HPP\n\n#include <cstddef>\n\n#include \"..\/config.hpp\"\n#include \"..\/internal\/string.hpp\"\n\nnamespace tao\n{\n namespace TAO_PEGTL_NAMESPACE\n {\n namespace internal\n {\n template< std::size_t, typename, char... >\n struct make_rep_string;\n\n template< char... Ss, char... Cs >\n struct make_rep_string< 0, string< Ss... >, Cs... >\n {\n using type = string< Ss... >;\n };\n\n template< std::size_t N, char... Ss, char... Cs >\n struct make_rep_string< N, string< Ss... >, Cs... >\n : make_rep_string< N - 1, string< Ss..., Cs... >, Cs... >\n {\n };\n\n } \/\/ namespace internal\n\n inline namespace ascii\n {\n template< std::size_t N, char... Cs >\n struct rep_string\n : internal::make_rep_string< N, internal::string<>, Cs... >::type\n {};\n\n } \/\/ namespace ascii\n\n } \/\/ namespace TAO_PEGTL_NAMESPACE\n\n} \/\/ namespace tao\n\n#endif\n<|endoftext|>"} {"text":"<commit_before>\/\/ Copyright (c) 2011-2013 Zeex\n\/\/ All rights 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#define _GNU_SOURCE\n\n#include <cassert>\n#include <cstring>\n#include <vector>\n\n#include <dlfcn.h>\n#include <signal.h>\n\n#include \"os.h\"\n\nstd::string os::GetModulePathFromAddr(void *address, std::size_t max_length) {\n std::vector<char> name(max_length + 1);\n if (address != 0) {\n Dl_info info;\n dladdr(address, &info);\n strncpy(&name[0], info.dli_fname, max_length);\n }\n return std::string(&name[0]);\n}\n\nstatic os::ExceptionHandler except_handler = 0;\nstatic struct sigaction prev_sigsegv_action;\nstatic __thread bool this_thread_handles_sigsegv;\n\nstatic void HandleSIGSEGV(int sig, siginfo_t *info, void *context)\n{\n if (!::this_thread_handles_sigsegv) {\n return;\n }\n\n if (::except_handler != 0) {\n ::except_handler(context);\n }\n\n sigaction(sig, &::prev_sigsegv_action, 0);\n raise(sig);\n}\n\nvoid os::SetExceptionHandler(ExceptionHandler handler) {\n assert(::except_handler == 0 && \"Only one thread may set exception handler\");\n\n ::this_thread_handles_sigsegv = true;\n ::except_handler = handler;\n\n struct sigaction action = {0};\n sigemptyset(&action.sa_mask);\n action.sa_sigaction = HandleSIGSEGV;\n action.sa_flags = SA_SIGINFO;\n\n sigaction(SIGSEGV, &action, &::prev_sigsegv_action);\n}\n\nstatic os::InterruptHandler interrupt_handler;\nstatic struct sigaction prev_sigint_action;\nstatic __thread bool this_thread_handles_sigint;\n\nstatic void HandleSIGINT(int sig, siginfo_t *info, void *context) {\n if (!::this_thread_handles_sigint) {\n return;\n }\n\n if (::interrupt_handler != 0) {\n ::interrupt_handler(context);\n }\n\n sigaction(sig, &::prev_sigint_action, 0);\n raise(sig);\n}\n\nvoid os::SetInterruptHandler(InterruptHandler handler) {\n assert(::except_handler == 0 && \"Only one thread may set interrupt handler\");\n\n ::this_thread_handles_sigint = true;\n ::interrupt_handler = handler;\n\n struct sigaction action = {0};\n sigemptyset(&action.sa_mask);\n action.sa_sigaction = HandleSIGINT;\n action.sa_flags = SA_SIGINFO;\n\n sigaction(SIGINT, &action, &::prev_sigint_action);\n}\n<commit_msg>Fix assert() condition<commit_after>\/\/ Copyright (c) 2011-2013 Zeex\n\/\/ All rights 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#define _GNU_SOURCE\n\n#include <cassert>\n#include <cstring>\n#include <vector>\n\n#include <dlfcn.h>\n#include <signal.h>\n\n#include \"os.h\"\n\nstd::string os::GetModulePathFromAddr(void *address, std::size_t max_length) {\n std::vector<char> name(max_length + 1);\n if (address != 0) {\n Dl_info info;\n dladdr(address, &info);\n strncpy(&name[0], info.dli_fname, max_length);\n }\n return std::string(&name[0]);\n}\n\nstatic os::ExceptionHandler except_handler = 0;\nstatic struct sigaction prev_sigsegv_action;\nstatic __thread bool this_thread_handles_sigsegv;\n\nstatic void HandleSIGSEGV(int sig, siginfo_t *info, void *context)\n{\n if (!::this_thread_handles_sigsegv) {\n return;\n }\n\n if (::except_handler != 0) {\n ::except_handler(context);\n }\n\n sigaction(sig, &::prev_sigsegv_action, 0);\n raise(sig);\n}\n\nvoid os::SetExceptionHandler(ExceptionHandler handler) {\n assert(::except_handler == 0 && \"Only one thread may set exception handler\");\n\n ::this_thread_handles_sigsegv = true;\n ::except_handler = handler;\n\n struct sigaction action = {0};\n sigemptyset(&action.sa_mask);\n action.sa_sigaction = HandleSIGSEGV;\n action.sa_flags = SA_SIGINFO;\n\n sigaction(SIGSEGV, &action, &::prev_sigsegv_action);\n}\n\nstatic os::InterruptHandler interrupt_handler;\nstatic struct sigaction prev_sigint_action;\nstatic __thread bool this_thread_handles_sigint;\n\nstatic void HandleSIGINT(int sig, siginfo_t *info, void *context) {\n if (!::this_thread_handles_sigint) {\n return;\n }\n\n if (::interrupt_handler != 0) {\n ::interrupt_handler(context);\n }\n\n sigaction(sig, &::prev_sigint_action, 0);\n raise(sig);\n}\n\nvoid os::SetInterruptHandler(InterruptHandler handler) {\n assert(::interrupt_handler == 0 && \"Only one thread may set interrupt handler\");\n\n ::this_thread_handles_sigint = true;\n ::interrupt_handler = handler;\n\n struct sigaction action = {0};\n sigemptyset(&action.sa_mask);\n action.sa_sigaction = HandleSIGINT;\n action.sa_flags = SA_SIGINFO;\n\n sigaction(SIGINT, &action, &::prev_sigint_action);\n}\n<|endoftext|>"} {"text":"<commit_before><commit_msg>Fix fapi2::current_err bug in checker.H<commit_after><|endoftext|>"} {"text":"<commit_before>#include <windows.h>\r\n#include <screen_capturer.h>\r\n#include <tchar.h>\r\n#include <psapi.h>\r\n#include <iostream>\r\n#include <ostream>\r\n#include <stdio.h>\r\n#include <boost\/thread\/mutex.hpp>\r\n#include <winuser.h>\r\n#include <wingdi.h>\r\n#include <img_processing.h>\r\n#include <ancillary_functions.h>\r\n#include <gdiplus.h>\r\n\r\nstruct result_data Screen_Capturer::takeSnapshot(std::string p_name, struct result_data (*foo)(void*, void*), void* arg){\t \r\n\tHWND main_window = retrieveHWND(p_name);\r\n\tstruct result_data rdt;\r\n\trdt.difference = NULL;\r\n\trdt.threshold = NULL;\r\n\tstd::cout << \"Handle in screen capturer \" << main_window << \"\\n\";\r\n\tif(main_window == 0){\r\n\t\tstd::cout << \"Main Window still not found\\n\";\r\n\t\treturn rdt;\r\n\t}\r\n\tRECT dimensions;\r\n\tGetWindowRect(main_window, &dimensions);\r\n\t\/\/***********************************************************************************************************************\r\n\t\/\/http:\/\/stackoverflow.com\/questions\/7292757\/how-to-get-screenshot-of-a-window-as-bitmap-object-in-c : Davide Piras******\r\n\t\/\/***********************************************************************************************************************\r\n HDC hdcScreen = GetDC(NULL);\r\n \/\/Sets image size\r\n HBITMAP hbmp = CreateCompatibleBitmap(hdcScreen, dimensions.right - dimensions.left, dimensions.bottom - dimensions.top);\r\n \tHDC pic = CreateCompatibleDC(hdcScreen);\r\n SelectObject(pic, hbmp);\r\n\tif(!PrintWindow(main_window, pic, PW_CLIENTONLY)){\r\n\t\tstd::cerr << \"\\nCouldn't Find Process\\n\";\r\n\t\tmain_window = 0; \/\/if this fails, the process must be closed\r\n\t\tDeleteDC(pic);\r\n\t\tDeleteDC(hdcScreen);\r\n\t\tDeleteObject(hbmp);\r\n\t\tCloseHandle(main_window);\r\n\t\treturn rdt;\r\n\t}\r\n\trdt = (*foo)(hbmp, arg);\r\n\t\/\/***********************************************************************************************************************\r\n\t\/\/http:\/\/stackoverflow.com\/questions\/7292757\/how-to-get-screenshot-of-a-window-as-bitmap-object-in-c : Davide Piras******\r\n\t\/\/***********************************************************************************************************************\r\n DeleteDC(pic);\r\n DeleteDC(hdcScreen);\r\n DeleteObject(hbmp);\r\n\tCloseHandle(main_window);\r\n\treturn rdt;\r\n}\r\n\r\nfloat Screen_Capturer::saveHBITMAP_SC(void* bmp, void* name){\r\n\tHBITMAP hbmp = (HBITMAP) bmp;\r\n\tconst char* rname = (char*) name;\r\n\treturn saveHBITMAP(hbmp, rname);\r\n}\r\n\r\nfloat Screen_Capturer::compHBITMAP_WSC(void* sc_bmp, void* o_bmp){\r\n\tHBITMAP sc_bmp_hb = (HBITMAP) sc_bmp;\r\n\tHBITMAP o_bmp_hb = (HBITMAP) o_bmp;\r\n\tfloat result = Img_Processing::compareMemoryImg(sc_bmp_hb, o_bmp_hb);\r\n\treturn result;\r\n}\r\n\r\nstruct result_data Screen_Capturer::compHBITMAP_SEL(void* sc_bmp, void* data){\r\n\tHBITMAP sc_bmp_hb = (HBITMAP) sc_bmp;\r\n\tstruct Scaling_Info* scaling = (struct Scaling_Info*) data;\r\n\tGdiplus::Bitmap img1(scaling->pic_data_array->bmp, NULL);\r\n\t\/\/std::cout << \"Dimensions precrop: \" << img1.GetWidth() << \" \" << img1.GetHeight() << std::endl;\r\n\treturn Img_Processing::compareMemoryImgSel(sc_bmp_hb, scaling->pic_data_array->bmp, scaling->pic_data_array->x, scaling->pic_data_array->y, scaling);\r\n}<commit_msg>changed for namespace added methods, fixed memory leaks<commit_after>#include <windows.h>\r\n#include <screen_capturer.h>\r\n#include <tchar.h>\r\n#include <psapi.h>\r\n#include <iostream>\r\n#include <ostream>\r\n#include <stdio.h>\r\n#include <winuser.h>\r\n#include <wingdi.h>\r\n#include <img_processing.h>\r\n\/\/#include <ancillary_functions.h>\r\n\r\nusing namespace Ancillary_Function;\r\n\r\nnamespace Screen_Capturer{\r\n\r\n\tint takeSnapshot(Gdiplus::Bitmap** m, std::string p_name){\r\n\t\tHWND main_window = retrieveHWND(p_name);\r\n\t\tRECT dimensions;\r\n\t\tdelete *m; \/\/ clear old image\r\n\r\n\t\tGetWindowRect(main_window, &dimensions);\r\n\t\t\/\/***********************************************************************************************************************\r\n\t\t\/\/http:\/\/stackoverflow.com\/questions\/7292757\/how-to-get-screenshot-of-a-window-as-bitmap-object-in-c : Davide Piras******\r\n\t\t\/\/***********************************************************************************************************************\r\n\t HDC hdcScreen = GetDC(NULL);\r\n\t \/\/Sets image size\r\n\t HBITMAP hbmp = CreateCompatibleBitmap(hdcScreen, dimensions.right - dimensions.left, dimensions.bottom - dimensions.top);\r\n\t \tHDC pic = CreateCompatibleDC(hdcScreen);\r\n\t SelectObject(pic, hbmp);\r\n\t\tif(!PrintWindow(main_window, pic, PW_CLIENTONLY)){\r\n\t\t\t*m = NULL;\r\n\t\t\t\/\/main_window = 0; \/\/if this fails, the process must be closed\r\n\t\t\tDeleteDC(pic);\r\n\t\t\tDeleteDC(hdcScreen);\r\n\t\t\tDeleteObject(hbmp);\r\n\t\t\tCloseHandle(main_window);\r\n\t\t\treturn -1;\r\n\t\t}\r\n\t\t\/\/***********************************************************************************************************************\r\n\t\t\/\/http:\/\/stackoverflow.com\/questions\/7292757\/how-to-get-screenshot-of-a-window-as-bitmap-object-in-c : Davide Piras******\r\n\t\t\/\/***********************************************************************************************************************\r\n\t *m = Gdiplus::Bitmap::FromHBITMAP(hbmp, NULL);\r\n\t DeleteDC(pic);\r\n\t DeleteDC(hdcScreen);\r\n\t DeleteObject(hbmp);\r\n\t\tif(GetHandleInformation(main_window, NULL)) CloseHandle(main_window);\r\n\t\treturn 0;\r\n\t}\r\n\r\n\tresult_data takeSnapshot(std::string p_name, struct result_data (*foo)(void*, void*), void* arg){\t \r\n\t\tHWND main_window = retrieveHWND(p_name);\r\n\t\tstruct result_data rdt;\r\n\t\trdt.difference = NULL;\r\n\t\trdt.threshold = NULL;\r\n\t\tstd::cout << \"Handle in screen capturer \" << main_window << \"\\n\";\r\n\t\tif(main_window == 0){\r\n\t\t\tstd::cout << \"Main Window still not found\\n\";\r\n\t\t\treturn rdt;\r\n\t\t}\r\n\t\tRECT dimensions;\r\n\t\tGetWindowRect(main_window, &dimensions);\r\n\t\t\/\/***********************************************************************************************************************\r\n\t\t\/\/http:\/\/stackoverflow.com\/questions\/7292757\/how-to-get-screenshot-of-a-window-as-bitmap-object-in-c : Davide Piras******\r\n\t\t\/\/***********************************************************************************************************************\r\n\t HDC hdcScreen = GetDC(NULL);\r\n\t \/\/Sets image size\r\n\t HBITMAP hbmp = CreateCompatibleBitmap(hdcScreen, dimensions.right - dimensions.left, dimensions.bottom - dimensions.top);\r\n\t \tHDC pic = CreateCompatibleDC(hdcScreen);\r\n\t SelectObject(pic, hbmp);\r\n\t\tif(!PrintWindow(main_window, pic, PW_CLIENTONLY)){\r\n\t\t\tstd::cerr << \"\\nCouldn't Find Process\\n\";\r\n\t\t\tmain_window = 0; \/\/if this fails, the process must be closed\r\n\t\t\tDeleteDC(pic);\r\n\t\t\tDeleteDC(hdcScreen);\r\n\t\t\tDeleteObject(hbmp);\r\n\t\t\tCloseHandle(main_window);\r\n\t\t\treturn rdt;\r\n\t\t}\r\n\t\trdt = (*foo)(hbmp, arg);\r\n\t\t\/\/***********************************************************************************************************************\r\n\t\t\/\/http:\/\/stackoverflow.com\/questions\/7292757\/how-to-get-screenshot-of-a-window-as-bitmap-object-in-c : Davide Piras******\r\n\t\t\/\/***********************************************************************************************************************\r\n\t DeleteDC(pic);\r\n\t DeleteDC(hdcScreen);\r\n\t DeleteObject(hbmp);\r\n\t\tCloseHandle(main_window);\r\n\t\treturn rdt;\r\n\t}\r\n\r\n\tfloat saveHBITMAP_SC(void* bmp, void* name){\r\n\t\tHBITMAP hbmp = (HBITMAP) bmp;\r\n\t\tconst char* rname = (char*) name;\r\n\t\treturn saveHBITMAP(hbmp, rname);\r\n\t}\r\n\r\n\tfloat compHBITMAP_WSC(void* sc_bmp, void* o_bmp){\r\n\t\tHBITMAP sc_bmp_hb = (HBITMAP) sc_bmp;\r\n\t\tHBITMAP o_bmp_hb = (HBITMAP) o_bmp;\r\n\t\tfloat result = Img_Processing::compareMemoryImg(sc_bmp_hb, o_bmp_hb);\r\n\t\treturn result;\r\n\t}\r\n\r\n\tresult_data compHBITMAP_SEL(void* sc_bmp, void* data){\r\n\t\tHBITMAP sc_bmp_hb = (HBITMAP) sc_bmp;\r\n\t\tstruct Scaling_Info* scaling = (struct Scaling_Info*) data;\r\n\t\tGdiplus::Bitmap img1(scaling->pic_data_array->bmp, NULL);\r\n\t\t\/\/std::cout << \"Dimensions precrop: \" << img1.GetWidth() << \" \" << img1.GetHeight() << std::endl;\r\n\t\treturn Img_Processing::compareMemoryImgSel(sc_bmp_hb, scaling->pic_data_array->bmp, scaling->pic_data_array->x, scaling->pic_data_array->y, scaling);\r\n\t}\r\n}<|endoftext|>"} {"text":"<commit_before>\/\/ Copyright (c) 2013 Intel Corporation. All rights reserved.\n\/\/ Use of this source code is governed by a BSD-style license that can be\n\/\/ found in the LICENSE file.\n\n#include \"xwalk\/runtime\/browser\/xwalk_browser_main_parts_android.h\"\n\n#include \"base\/android\/path_utils.h\"\n#include \"base\/base_paths_android.h\"\n#include \"base\/files\/file_path.h\"\n#include \"base\/file_util.h\"\n#include \"base\/message_loop\/message_loop.h\"\n#include \"base\/path_service.h\"\n#include \"base\/strings\/string_number_conversions.h\"\n#include \"base\/sys_info.h\"\n#include \"base\/threading\/sequenced_worker_pool.h\"\n#include \"cc\/base\/switches.h\"\n#include \"content\/public\/browser\/android\/compositor.h\"\n#include \"content\/public\/browser\/browser_thread.h\"\n#include \"content\/public\/browser\/cookie_store_factory.h\"\n#include \"content\/public\/common\/content_switches.h\"\n#include \"content\/public\/common\/result_codes.h\"\n#include \"grit\/net_resources.h\"\n#include \"net\/android\/network_change_notifier_factory_android.h\"\n#include \"net\/base\/network_change_notifier.h\"\n#include \"net\/base\/net_module.h\"\n#include \"net\/base\/net_util.h\"\n#include \"ui\/base\/layout.h\"\n#include \"ui\/base\/l10n\/l10n_util_android.h\"\n#include \"ui\/base\/resource\/resource_bundle.h\"\n#include \"xwalk\/extensions\/browser\/xwalk_extension_service.h\"\n#include \"xwalk\/extensions\/common\/xwalk_extension.h\"\n#include \"xwalk\/extensions\/common\/xwalk_extension_switches.h\"\n#include \"xwalk\/runtime\/browser\/android\/cookie_manager.h\"\n#include \"xwalk\/runtime\/browser\/runtime_context.h\"\n#include \"xwalk\/runtime\/browser\/xwalk_runner.h\"\n#include \"xwalk\/runtime\/common\/xwalk_runtime_features.h\"\n\nnamespace {\n\nbase::StringPiece PlatformResourceProvider(int key) {\n if (key == IDR_DIR_HEADER_HTML) {\n base::StringPiece html_data =\n ui::ResourceBundle::GetSharedInstance().GetRawDataResource(\n IDR_DIR_HEADER_HTML);\n return html_data;\n }\n return base::StringPiece();\n}\n\n} \/\/ namespace\n\nnamespace xwalk {\n\nusing content::BrowserThread;\nusing extensions::XWalkExtension;\n\nXWalkBrowserMainPartsAndroid::XWalkBrowserMainPartsAndroid(\n const content::MainFunctionParams& parameters)\n : XWalkBrowserMainParts(parameters) {\n}\n\nXWalkBrowserMainPartsAndroid::~XWalkBrowserMainPartsAndroid() {\n}\n\nvoid XWalkBrowserMainPartsAndroid::PreEarlyInitialization() {\n net::NetworkChangeNotifier::SetFactory(\n new net::NetworkChangeNotifierFactoryAndroid());\n\n CommandLine::ForCurrentProcess()->AppendSwitch(\n cc::switches::kCompositeToMailbox);\n\n \/\/ Initialize the Compositor.\n content::Compositor::Initialize();\n\n XWalkBrowserMainParts::PreEarlyInitialization();\n}\n\nvoid XWalkBrowserMainPartsAndroid::PreMainMessageLoopStart() {\n CommandLine* command_line = CommandLine::ForCurrentProcess();\n \/\/ Disable ExtensionProcess for Android.\n \/\/ External extensions will run in the BrowserProcess (in process mode).\n command_line->AppendSwitch(switches::kXWalkDisableExtensionProcess);\n\n \/\/ Enable WebGL for Android.\n command_line->AppendSwitch(switches::kIgnoreGpuBlacklist);\n\n \/\/ Disable HW encoding\/decoding acceleration for WebRTC on Android.\n \/\/ FIXME: Remove these switches for Android when Android OS is removed from\n \/\/ GPU accelerated_video_decode blacklist or we stop ignoring the GPU\n \/\/ blacklist.\n command_line->AppendSwitch(switches::kDisableWebRtcHWDecoding);\n command_line->AppendSwitch(switches::kDisableWebRtcHWEncoding);\n\n if (!command_line->HasSwitch(cc::switches::kNumRasterThreads)) {\n \/\/ Enable multiple threads for rasterization to take advantage of multi CPU\n \/\/ cores. Only valid when ImplSidePainting is enabled.\n const int num_of_cpu_cores = base::SysInfo::NumberOfProcessors();\n command_line->AppendSwitchASCII(cc::switches::kNumRasterThreads,\n base::IntToString(num_of_cpu_cores));\n }\n\n XWalkBrowserMainParts::PreMainMessageLoopStart();\n\n startup_url_ = GURL();\n}\n\nvoid XWalkBrowserMainPartsAndroid::PostMainMessageLoopStart() {\n base::MessageLoopForUI::current()->Start();\n}\n\nvoid XWalkBrowserMainPartsAndroid::PreMainMessageLoopRun() {\n net::NetModule::SetResourceProvider(PlatformResourceProvider);\n if (parameters_.ui_task) {\n parameters_.ui_task->Run();\n delete parameters_.ui_task;\n run_default_message_loop_ = false;\n }\n\n xwalk_runner_->PreMainMessageLoopRun();\n\n runtime_context_ = xwalk_runner_->runtime_context();\n extension_service_ = xwalk_runner_->extension_service();\n\n \/\/ Prepare the cookie store.\n base::FilePath user_data_dir;\n if (!PathService::Get(base::DIR_ANDROID_APP_DATA, &user_data_dir)) {\n NOTREACHED() << \"Failed to get app data directory for Crosswalk\";\n }\n\n base::FilePath cookie_store_path = user_data_dir.Append(\n FILE_PATH_LITERAL(\"Cookies\"));\n scoped_refptr<base::SequencedTaskRunner> background_task_runner =\n BrowserThread::GetBlockingPool()->GetSequencedTaskRunner(\n BrowserThread::GetBlockingPool()->GetSequenceToken());\n\n cookie_store_ = content::CreatePersistentCookieStore(\n cookie_store_path,\n true,\n NULL,\n NULL,\n BrowserThread::GetMessageLoopProxyForThread(BrowserThread::IO),\n background_task_runner);\n\n cookie_store_->GetCookieMonster()->SetPersistSessionCookies(true);\n SetCookieMonsterOnNetworkStackInit(cookie_store_->GetCookieMonster());\n}\n\nvoid XWalkBrowserMainPartsAndroid::PostMainMessageLoopRun() {\n XWalkBrowserMainParts::PostMainMessageLoopRun();\n\n base::MessageLoopForUI::current()->Start();\n}\n\nvoid XWalkBrowserMainPartsAndroid::CreateInternalExtensionsForExtensionThread(\n content::RenderProcessHost* host,\n extensions::XWalkExtensionVector* extensions) {\n \/\/ On Android part, the ownership of each extension object will be transferred\n \/\/ to XWalkExtensionServer after this method is called. It is a rule enforced\n \/\/ by extension system that XWalkExtensionServer must own the extension\n \/\/ objects and extension instances.\n extensions::XWalkExtensionVector::const_iterator it = extensions_.begin();\n for (; it != extensions_.end(); ++it)\n extensions->push_back(*it);\n}\n\nvoid XWalkBrowserMainPartsAndroid::RegisterExtension(\n scoped_ptr<XWalkExtension> extension) {\n \/\/ Since the creation of extension object is driven by Java side, and each\n \/\/ Java extension is backed by a native extension object. However, the Java\n \/\/ object may be destroyed by Android lifecycle management without destroying\n \/\/ the native side object. We keep the reference to native extension object\n \/\/ to make sure we can reuse the native object if Java extension is re-created\n \/\/ on resuming.\n extensions_.push_back(extension.release());\n}\n\nXWalkExtension* XWalkBrowserMainPartsAndroid::LookupExtension(\n const std::string& name) {\n extensions::XWalkExtensionVector::const_iterator it = extensions_.begin();\n for (; it != extensions_.end(); ++it) {\n XWalkExtension* extension = *it;\n if (name == extension->name()) return extension;\n }\n\n return NULL;\n}\n\n} \/\/ namespace xwalk\n<commit_msg>[Android] Only force enabling WebGL for Android on IA.<commit_after>\/\/ Copyright (c) 2013 Intel Corporation. All rights reserved.\n\/\/ Use of this source code is governed by a BSD-style license that can be\n\/\/ found in the LICENSE file.\n\n#include \"xwalk\/runtime\/browser\/xwalk_browser_main_parts_android.h\"\n\n#include \"base\/android\/path_utils.h\"\n#include \"base\/base_paths_android.h\"\n#include \"base\/files\/file_path.h\"\n#include \"base\/file_util.h\"\n#include \"base\/message_loop\/message_loop.h\"\n#include \"base\/path_service.h\"\n#include \"base\/strings\/string_number_conversions.h\"\n#include \"base\/sys_info.h\"\n#include \"base\/threading\/sequenced_worker_pool.h\"\n#include \"cc\/base\/switches.h\"\n#include \"content\/public\/browser\/android\/compositor.h\"\n#include \"content\/public\/browser\/browser_thread.h\"\n#include \"content\/public\/browser\/cookie_store_factory.h\"\n#include \"content\/public\/common\/content_switches.h\"\n#include \"content\/public\/common\/result_codes.h\"\n#include \"grit\/net_resources.h\"\n#include \"net\/android\/network_change_notifier_factory_android.h\"\n#include \"net\/base\/network_change_notifier.h\"\n#include \"net\/base\/net_module.h\"\n#include \"net\/base\/net_util.h\"\n#include \"ui\/base\/layout.h\"\n#include \"ui\/base\/l10n\/l10n_util_android.h\"\n#include \"ui\/base\/resource\/resource_bundle.h\"\n#include \"xwalk\/extensions\/browser\/xwalk_extension_service.h\"\n#include \"xwalk\/extensions\/common\/xwalk_extension.h\"\n#include \"xwalk\/extensions\/common\/xwalk_extension_switches.h\"\n#include \"xwalk\/runtime\/browser\/android\/cookie_manager.h\"\n#include \"xwalk\/runtime\/browser\/runtime_context.h\"\n#include \"xwalk\/runtime\/browser\/xwalk_runner.h\"\n#include \"xwalk\/runtime\/common\/xwalk_runtime_features.h\"\n\nnamespace {\n\nbase::StringPiece PlatformResourceProvider(int key) {\n if (key == IDR_DIR_HEADER_HTML) {\n base::StringPiece html_data =\n ui::ResourceBundle::GetSharedInstance().GetRawDataResource(\n IDR_DIR_HEADER_HTML);\n return html_data;\n }\n return base::StringPiece();\n}\n\n} \/\/ namespace\n\nnamespace xwalk {\n\nusing content::BrowserThread;\nusing extensions::XWalkExtension;\n\nXWalkBrowserMainPartsAndroid::XWalkBrowserMainPartsAndroid(\n const content::MainFunctionParams& parameters)\n : XWalkBrowserMainParts(parameters) {\n}\n\nXWalkBrowserMainPartsAndroid::~XWalkBrowserMainPartsAndroid() {\n}\n\nvoid XWalkBrowserMainPartsAndroid::PreEarlyInitialization() {\n net::NetworkChangeNotifier::SetFactory(\n new net::NetworkChangeNotifierFactoryAndroid());\n\n CommandLine::ForCurrentProcess()->AppendSwitch(\n cc::switches::kCompositeToMailbox);\n\n \/\/ Initialize the Compositor.\n content::Compositor::Initialize();\n\n XWalkBrowserMainParts::PreEarlyInitialization();\n}\n\nvoid XWalkBrowserMainPartsAndroid::PreMainMessageLoopStart() {\n CommandLine* command_line = CommandLine::ForCurrentProcess();\n \/\/ Disable ExtensionProcess for Android.\n \/\/ External extensions will run in the BrowserProcess (in process mode).\n command_line->AppendSwitch(switches::kXWalkDisableExtensionProcess);\n\n \/\/ Only force to enable WebGL for Android for IA platforms because\n \/\/ we've tested the WebGL conformance test. For other platforms, just\n \/\/ follow up the behavior defined by Chromium upstream.\n#if defined(ARCH_CPU_X86)\n command_line->AppendSwitch(switches::kIgnoreGpuBlacklist);\n#endif\n\n \/\/ Disable HW encoding\/decoding acceleration for WebRTC on Android.\n \/\/ FIXME: Remove these switches for Android when Android OS is removed from\n \/\/ GPU accelerated_video_decode blacklist or we stop ignoring the GPU\n \/\/ blacklist.\n command_line->AppendSwitch(switches::kDisableWebRtcHWDecoding);\n command_line->AppendSwitch(switches::kDisableWebRtcHWEncoding);\n\n if (!command_line->HasSwitch(cc::switches::kNumRasterThreads)) {\n \/\/ Enable multiple threads for rasterization to take advantage of multi CPU\n \/\/ cores. Only valid when ImplSidePainting is enabled.\n const int num_of_cpu_cores = base::SysInfo::NumberOfProcessors();\n command_line->AppendSwitchASCII(cc::switches::kNumRasterThreads,\n base::IntToString(num_of_cpu_cores));\n }\n\n XWalkBrowserMainParts::PreMainMessageLoopStart();\n\n startup_url_ = GURL();\n}\n\nvoid XWalkBrowserMainPartsAndroid::PostMainMessageLoopStart() {\n base::MessageLoopForUI::current()->Start();\n}\n\nvoid XWalkBrowserMainPartsAndroid::PreMainMessageLoopRun() {\n net::NetModule::SetResourceProvider(PlatformResourceProvider);\n if (parameters_.ui_task) {\n parameters_.ui_task->Run();\n delete parameters_.ui_task;\n run_default_message_loop_ = false;\n }\n\n xwalk_runner_->PreMainMessageLoopRun();\n\n runtime_context_ = xwalk_runner_->runtime_context();\n extension_service_ = xwalk_runner_->extension_service();\n\n \/\/ Prepare the cookie store.\n base::FilePath user_data_dir;\n if (!PathService::Get(base::DIR_ANDROID_APP_DATA, &user_data_dir)) {\n NOTREACHED() << \"Failed to get app data directory for Crosswalk\";\n }\n\n base::FilePath cookie_store_path = user_data_dir.Append(\n FILE_PATH_LITERAL(\"Cookies\"));\n scoped_refptr<base::SequencedTaskRunner> background_task_runner =\n BrowserThread::GetBlockingPool()->GetSequencedTaskRunner(\n BrowserThread::GetBlockingPool()->GetSequenceToken());\n\n cookie_store_ = content::CreatePersistentCookieStore(\n cookie_store_path,\n true,\n NULL,\n NULL,\n BrowserThread::GetMessageLoopProxyForThread(BrowserThread::IO),\n background_task_runner);\n\n cookie_store_->GetCookieMonster()->SetPersistSessionCookies(true);\n SetCookieMonsterOnNetworkStackInit(cookie_store_->GetCookieMonster());\n}\n\nvoid XWalkBrowserMainPartsAndroid::PostMainMessageLoopRun() {\n XWalkBrowserMainParts::PostMainMessageLoopRun();\n\n base::MessageLoopForUI::current()->Start();\n}\n\nvoid XWalkBrowserMainPartsAndroid::CreateInternalExtensionsForExtensionThread(\n content::RenderProcessHost* host,\n extensions::XWalkExtensionVector* extensions) {\n \/\/ On Android part, the ownership of each extension object will be transferred\n \/\/ to XWalkExtensionServer after this method is called. It is a rule enforced\n \/\/ by extension system that XWalkExtensionServer must own the extension\n \/\/ objects and extension instances.\n extensions::XWalkExtensionVector::const_iterator it = extensions_.begin();\n for (; it != extensions_.end(); ++it)\n extensions->push_back(*it);\n}\n\nvoid XWalkBrowserMainPartsAndroid::RegisterExtension(\n scoped_ptr<XWalkExtension> extension) {\n \/\/ Since the creation of extension object is driven by Java side, and each\n \/\/ Java extension is backed by a native extension object. However, the Java\n \/\/ object may be destroyed by Android lifecycle management without destroying\n \/\/ the native side object. We keep the reference to native extension object\n \/\/ to make sure we can reuse the native object if Java extension is re-created\n \/\/ on resuming.\n extensions_.push_back(extension.release());\n}\n\nXWalkExtension* XWalkBrowserMainPartsAndroid::LookupExtension(\n const std::string& name) {\n extensions::XWalkExtensionVector::const_iterator it = extensions_.begin();\n for (; it != extensions_.end(); ++it) {\n XWalkExtension* extension = *it;\n if (name == extension->name()) return extension;\n }\n\n return NULL;\n}\n\n} \/\/ namespace xwalk\n<|endoftext|>"} {"text":"<commit_before>#ifdef HAVE_CONFIG_H\n#include <config.h>\n#endif\n\n#include <string>\n#include <cctype>\n\n#include \"list.hxx\"\n#include \"..\/interp.hxx\"\n#include \"..\/command.hxx\"\n#include \"..\/argument.hxx\"\n#include \"..\/function.hxx\"\n#include \"..\/common.hxx\"\n#include \"default_tokeniser.hxx\"\n\nusing namespace std;\n\nnamespace tglng {\n bool list::escape(wstring* out, const wstring* in,\n Interpreter& interp, unsigned) {\n wstring str(in[0]);\n\n \/\/See what characters of concern are present\n bool\n hasSpace = false,\n hasParen = false,\n hasBrack = false,\n hasBrace = false,\n hasSlash = false;\n for (unsigned i = 0; i < str.size(); ++i) {\n hasSpace |= iswspace(str[i]);\n hasParen |= str[i] == L'(' || str[i] == L')';\n hasBrack |= str[i] == L'[' || str[i] == L']';\n hasBrace |= str[i] == L'{' || str[i] == L'}';\n hasSlash |= str[i] == L'\\\\';\n }\n\n \/* The string must be enclosed in a parenthesis-like pair only if it\n * contains spaces or any other parentheses.\n * Try to use a paren which is not present in the string. If all types are\n * used, use braces and escape the others.\n *\/\n bool escapeBraces = hasParen && hasBrack && hasBrace;\n\n \/\/Escape backslashes, and braces if needed\n if (hasSlash || escapeBraces) {\n for (unsigned i = 0; i < str.size(); ++i) {\n if (str[i] == L'\\\\')\n str.insert(i++, 1, L'\\\\');\n else if ((str[i] == L'{' || str[i] == L'}') &&\n escapeBraces)\n str.insert(i++, 1, L'\\\\');\n }\n }\n\n if (hasSpace || hasParen || hasBrack || hasBrace) {\n if (!hasParen)\n str = L'(' + str + L')';\n else if (!hasBrack)\n str = L'[' + str + L']';\n else\n str = L'{' + str + L'}';\n }\n\n out[0] = str;\n return true;\n }\n\n bool list::append(wstring* out, const wstring* in,\n Interpreter& interp, unsigned) {\n if (!escape(out, in+1, interp, 0)) return false;\n if (!in[0].empty())\n out[0] = in[0] + L' ' + out[0];\n return true;\n }\n\n bool list::car(wstring* out, const wstring* in,\n Interpreter& interp, unsigned silent) {\n wstring preout[2], prein[2];\n prein[0] = in[0];\n prein[1] = L\"e\";\n if (!defaultTokeniserPreprocessor(preout, prein,\n interp, 0))\n return false;\n\n if (preout[0].empty()) {\n if (!silent)\n wcerr << L\"tglng: error: list-car: empty list\" << endl;\n return false;\n }\n\n prein[0] = preout[0];\n return defaultTokeniser(out, prein, interp, 0);\n }\n\n bool list::map(wstring* out, const wstring* in,\n Interpreter& interp, unsigned) {\n Function fun;\n if (!Function::get(fun, interp,\n in[0], 1, 1))\n return false;\n\n out[0].clear();\n\n wstring carout[2];\n wstring remainder(in[1]);\n while (car(carout, &remainder, interp, 1)) {\n wstring appin[2];\n if (!fun.exec(appin+1, carout, interp, fun.parm))\n return false;\n\n appin[0] = out[0];\n remainder = carout[1];\n if (!append(out, appin, interp, 0))\n return false;\n }\n\n return true;\n }\n\n bool list::fold(wstring* out, const wstring* in,\n Interpreter& interp, unsigned) {\n Function fun;\n if (!Function::get(fun, interp,\n in[0], 1, 2))\n return false;\n\n out[0] = in[2];\n\n wstring carout[2];\n wstring remainder(in[1]);\n while (car(carout, &remainder, interp, 1)) {\n wstring funin[2];\n funin[0] = carout[0];\n funin[1] = out[0];\n if (!fun.exec(out, funin, interp, fun.parm))\n return false;\n\n remainder = carout[1];\n }\n\n return true;\n }\n\n bool list::filter(wstring* out, const wstring* in,\n Interpreter& interp, unsigned) {\n Function fun;\n if (!Function::get(fun, interp,\n in[0], 1, 1))\n return false;\n\n out[0].clear();\n wstring carout[2];\n wstring remainder(in[1]);\n while (car(carout, &remainder, interp, 1)) {\n wstring appin[2];\n if (!fun.exec(appin+1, carout, interp, fun.parm))\n return false;\n\n if (parseBool(appin[1])) {\n appin[1] = carout[0];\n appin[0] = out[0];\n if (!append(out, appin, interp, 0))\n return false;\n }\n\n remainder = carout[1];\n }\n\n return true;\n }\n\n static GlobalBinding<TFunctionParser<1,1,list::escape> >\n _listEscape(L\"list-escape\");\n static GlobalBinding<TFunctionParser<1,2,list::append> >\n _listAppend(L\"list-append\");\n static GlobalBinding<TFunctionParser<1,2,list::map> >\n _listMap(L\"list-map\");\n static GlobalBinding<TFunctionParser<1,3,list::fold> >\n _listFold(L\"list-fold\");\n static GlobalBinding<TFunctionParser<1,2,list::filter> >\n _listFilter(L\"list-filter\");\n}\n<commit_msg>Add missing binding to list-car.<commit_after>#ifdef HAVE_CONFIG_H\n#include <config.h>\n#endif\n\n#include <string>\n#include <cctype>\n\n#include \"list.hxx\"\n#include \"..\/interp.hxx\"\n#include \"..\/command.hxx\"\n#include \"..\/argument.hxx\"\n#include \"..\/function.hxx\"\n#include \"..\/common.hxx\"\n#include \"default_tokeniser.hxx\"\n\nusing namespace std;\n\nnamespace tglng {\n bool list::escape(wstring* out, const wstring* in,\n Interpreter& interp, unsigned) {\n wstring str(in[0]);\n\n \/\/See what characters of concern are present\n bool\n hasSpace = false,\n hasParen = false,\n hasBrack = false,\n hasBrace = false,\n hasSlash = false;\n for (unsigned i = 0; i < str.size(); ++i) {\n hasSpace |= iswspace(str[i]);\n hasParen |= str[i] == L'(' || str[i] == L')';\n hasBrack |= str[i] == L'[' || str[i] == L']';\n hasBrace |= str[i] == L'{' || str[i] == L'}';\n hasSlash |= str[i] == L'\\\\';\n }\n\n \/* The string must be enclosed in a parenthesis-like pair only if it\n * contains spaces or any other parentheses.\n * Try to use a paren which is not present in the string. If all types are\n * used, use braces and escape the others.\n *\/\n bool escapeBraces = hasParen && hasBrack && hasBrace;\n\n \/\/Escape backslashes, and braces if needed\n if (hasSlash || escapeBraces) {\n for (unsigned i = 0; i < str.size(); ++i) {\n if (str[i] == L'\\\\')\n str.insert(i++, 1, L'\\\\');\n else if ((str[i] == L'{' || str[i] == L'}') &&\n escapeBraces)\n str.insert(i++, 1, L'\\\\');\n }\n }\n\n if (hasSpace || hasParen || hasBrack || hasBrace) {\n if (!hasParen)\n str = L'(' + str + L')';\n else if (!hasBrack)\n str = L'[' + str + L']';\n else\n str = L'{' + str + L'}';\n }\n\n out[0] = str;\n return true;\n }\n\n bool list::append(wstring* out, const wstring* in,\n Interpreter& interp, unsigned) {\n if (!escape(out, in+1, interp, 0)) return false;\n if (!in[0].empty())\n out[0] = in[0] + L' ' + out[0];\n return true;\n }\n\n bool list::car(wstring* out, const wstring* in,\n Interpreter& interp, unsigned silent) {\n wstring preout[2], prein[2];\n prein[0] = in[0];\n prein[1] = L\"e\";\n if (!defaultTokeniserPreprocessor(preout, prein,\n interp, 0))\n return false;\n\n if (preout[0].empty()) {\n if (!silent)\n wcerr << L\"tglng: error: list-car: empty list\" << endl;\n return false;\n }\n\n prein[0] = preout[0];\n return defaultTokeniser(out, prein, interp, 0);\n }\n\n bool list::map(wstring* out, const wstring* in,\n Interpreter& interp, unsigned) {\n Function fun;\n if (!Function::get(fun, interp,\n in[0], 1, 1))\n return false;\n\n out[0].clear();\n\n wstring carout[2];\n wstring remainder(in[1]);\n while (car(carout, &remainder, interp, 1)) {\n wstring appin[2];\n if (!fun.exec(appin+1, carout, interp, fun.parm))\n return false;\n\n appin[0] = out[0];\n remainder = carout[1];\n if (!append(out, appin, interp, 0))\n return false;\n }\n\n return true;\n }\n\n bool list::fold(wstring* out, const wstring* in,\n Interpreter& interp, unsigned) {\n Function fun;\n if (!Function::get(fun, interp,\n in[0], 1, 2))\n return false;\n\n out[0] = in[2];\n\n wstring carout[2];\n wstring remainder(in[1]);\n while (car(carout, &remainder, interp, 1)) {\n wstring funin[2];\n funin[0] = carout[0];\n funin[1] = out[0];\n if (!fun.exec(out, funin, interp, fun.parm))\n return false;\n\n remainder = carout[1];\n }\n\n return true;\n }\n\n bool list::filter(wstring* out, const wstring* in,\n Interpreter& interp, unsigned) {\n Function fun;\n if (!Function::get(fun, interp,\n in[0], 1, 1))\n return false;\n\n out[0].clear();\n wstring carout[2];\n wstring remainder(in[1]);\n while (car(carout, &remainder, interp, 1)) {\n wstring appin[2];\n if (!fun.exec(appin+1, carout, interp, fun.parm))\n return false;\n\n if (parseBool(appin[1])) {\n appin[1] = carout[0];\n appin[0] = out[0];\n if (!append(out, appin, interp, 0))\n return false;\n }\n\n remainder = carout[1];\n }\n\n return true;\n }\n\n static GlobalBinding<TFunctionParser<2,1,list::car> >\n _listCar(L\"list-car\");\n static GlobalBinding<TFunctionParser<1,1,list::escape> >\n _listEscape(L\"list-escape\");\n static GlobalBinding<TFunctionParser<1,2,list::append> >\n _listAppend(L\"list-append\");\n static GlobalBinding<TFunctionParser<1,2,list::map> >\n _listMap(L\"list-map\");\n static GlobalBinding<TFunctionParser<1,3,list::fold> >\n _listFold(L\"list-fold\");\n static GlobalBinding<TFunctionParser<1,2,list::filter> >\n _listFilter(L\"list-filter\");\n}\n<|endoftext|>"} {"text":"<commit_before>\/*\n Copyright (c) 2010, The Mineserver Project\n All rights reserved.\n\n Redistribution and use in source and binary forms, with or without\n modification, are permitted provided that the following conditions are met:\n * Redistributions of source code must retain the above copyright\n notice, this list of conditions and the following disclaimer.\n * Redistributions in binary form must reproduce the above copyright\n notice, this list of conditions and the following disclaimer in the\n documentation and\/or other materials provided with the distribution.\n * Neither the name of the The Mineserver Project nor the\n names of its contributors may be used to endorse or promote products\n derived from this software without specific prior written permission.\n\n THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS \"AS IS\" AND\n ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED\n WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE\n DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER BE LIABLE FOR ANY\n DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES\n (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;\n LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND\n ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT\n (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS\n SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.\n *\/\n\n#include <cstdlib>\n#include <cstdio>\n#include <iostream>\n#include <deque>\n#include <fstream>\n#include <vector>\n#include <ctime>\n#include <math.h>\n#ifdef WIN32\n #include <winsock2.h>\n#else\n #include <netinet\/in.h>\n #include <string.h>\n#endif\n\n#include \"logger.h\"\n#include \"constants.h\"\n\n#include \"tools.h\"\n#include \"map.h\"\n#include \"user.h\"\n#include \"chat.h\"\n#include \"config.h\"\n#include \"physics.h\"\n\nnamespace\n{\n\nvoid reportError(User *user, std::string message)\n{\n Chat::get().sendMsg(user, COLOR_DARK_MAGENTA + \"Error! \" + COLOR_RED + message, Chat::USER);\n}\n\nvoid playerList(User *user, std::string command, std::deque<std::string> args)\n{\n Chat::get().sendUserlist(user);\n}\n\nvoid about(User *user, std::string command, std::deque<std::string> args)\n{\n Chat::get().sendMsg(user, COLOR_DARK_MAGENTA + Conf::get().sValue(\"servername\")+\n \"Running Mineserver v.\" + VERSION, Chat::USER);\n}\n\n\/\/ TODO: Check if rulesfile exists\nvoid rules(User *user, std::string command, std::deque<std::string> args)\n{\n User *tUser = user;\n if(!args.empty() && user->admin)\n tUser = getUserByNick(args[0]);\n if(tUser != NULL)\n {\n \/\/ Send rules\n std::ifstream ifs( RULESFILE.c_str());\n std::string temp;\n\n if(ifs.fail())\n {\n std::cout << \"> Warning: \" << RULESFILE << \" not found.\" << std::endl;\n return;\n }\n else\n {\n while(getline(ifs, temp))\n {\n \/\/ If not a comment\n if(temp.empty() || temp[0] == COMMENTPREFIX)\n Chat::get().sendMsg(tUser, temp, Chat::USER);\n }\n ifs.close();\n }\n }\n else\n reportError(user, \"User \" + args[0] + \" not found (see \/players)\");\n}\n\nvoid home(User *user, std::string command, std::deque<std::string> args)\n{\n Chat::get().sendMsg(user, COLOR_DARK_MAGENTA + \"Teleported you home!\", Chat::USER);\n user->teleport(Map::get().spawnPos.x(), Map::get().spawnPos.y() + 2, Map::get().spawnPos.z());\n}\n\nvoid kit(User *user, std::string command, std::deque<std::string> args)\n{\n if(!args.empty())\n {\n std::vector<int> kitItems = Conf::get().vValue(\"kit_\" + args[0]);\n \/\/ If kit is found\n if(!kitItems.empty())\n {\n for(std::vector<int>::iterator iter = kitItems.begin(), end = kitItems.end();\n iter != end;\n ++iter)\n {\n spawnedItem item;\n item.EID = generateEID();\n item.item = *iter;\n item.count = 1;\n item.health=0;\n item.pos.x() = static_cast<int>(user->pos.x*32 + (rand() % 30));\n item.pos.y() = static_cast<int>(user->pos.y*32);\n item.pos.z() = static_cast<int>(user->pos.z*32 + (rand() % 30));\n Map::get().sendPickupSpawn(item);\n kitItems.pop_back();\n }\n }\n else\n reportError(user, \"Kit \" + args[0] + \" not found\");\n }\n}\n\nvoid saveMap(User *user, std::string command, std::deque<std::string> args)\n{\n Map::get().saveWholeMap();\n Chat::get().sendMsg(user, COLOR_DARK_MAGENTA + \"SERVER:\" + COLOR_RED + \" Saved map to disc\",\n Chat::USER);\n}\n\nvoid kick(User *user, std::string command, std::deque<std::string> args)\n{\n if(!args.empty())\n {\n std::string victim = args[0];\n\n User *tUser = getUserByNick(victim);\n\n if(tUser != NULL)\n {\n args.pop_front();\n std::string kickMsg;\n if(args.empty())\n kickMsg = Conf::get().sValue(\"default_kick_message\");\n else\n {\n while(!args.empty())\n {\n kickMsg += args[0] + \" \";\n args.pop_front();\n }\n }\n\n tUser->kick(kickMsg);\n }\n else\n reportError(user, \"User \" + victim + \" not found (see \/players)\");\n }\n else\n reportError(user, \"Usage: \/kick user [reason]\");\n}\n\nvoid coordinateTeleport(User *user, std::string command, std::deque<std::string> args)\n{\n if(args.size() > 2)\n {\n LOG(user->nick + \" teleport to: \" + args[0] + \" \" + args[1] + \" \" + args[2]);\n double x = atof(args[0].c_str());\n double y = atof(args[1].c_str());\n double z = atof(args[2].c_str());\n user->teleport(x, y, z);\n }\n}\n\nvoid userTeleport(User *user, std::string command, std::deque<std::string> args)\n{\n if(args.size() == 1)\n {\n LOG(user->nick + \" teleport to: \" + args[0]);\n User *tUser = getUserByNick(args[0]);\n if(tUser != NULL)\n user->teleport(tUser->pos.x, tUser->pos.y + 2, tUser->pos.z);\n else\n reportError(user, \"User \" + args[0] + \" not found (see \/players)\");\n }\n else if(args.size() == 2)\n {\n LOG(user->nick + \": teleport \" + args[0] + \" to \" + args[1]);\n\n User *whoUser = getUserByNick(args[0]);\n User *toUser = getUserByNick(args[1]);\n\n if(whoUser != NULL && toUser != NULL)\n {\n whoUser->teleport(toUser->pos.x, toUser->pos.y + 2, toUser->pos.z);\n Chat::get().sendMsg(user, COLOR_MAGENTA + \"Teleported!\", Chat::USER);\n }\n else\n {\n reportError(user, \"User \" + (whoUser == NULL ? args[0] : args[1])+\n \" not found (see \/players\");\n }\n }\n}\n\nvoid reloadConfiguration(User *user, std::string command, std::deque<std::string> args)\n{\n Chat::get().loadAdmins(ADMINFILE);\n Conf::get().load(CONFIGFILE);\n\n \/\/ Set physics enable state based on config\n Physics::get().enabled = ((Conf::get().iValue(\"liquid_physics\") == 0) ? false : true);\n\n Chat::get().sendMsg(user, COLOR_DARK_MAGENTA + \"SERVER:\" + COLOR_RED+\n \" Reloaded admins and config\", Chat::USER);\n\n \/\/ Note that the MOTD is loaded on-demand each time it is requested\n}\n\nbool isValidItem(int id)\n{\n if(id < 1) \/\/ zero or negative items are all invalid\n return false;\n\n if(id > 91 && id < 256) \/\/ these are undefined blocks and items\n return false;\n\n if(id == 2256 || id == 2257) \/\/ records are special cased\n return true;\n\n if(id > 350) \/\/ high items are invalid\n return false;\n\n if(id >= BLOCK_RED_CLOTH && id <= BLOCK_GRAY_CLOTH) \/\/ coloured cloth causes client crashes\n return false;\n\n return true;\n}\n\nint roundUpTo(int x, int nearest) \n{ \n x += (nearest - 1); \n x \/= nearest; \n x *= nearest; \n return x; \n} \n\nvoid giveItems(User *user, std::string command, std::deque<std::string> args)\n{\n User *tUser = NULL;\n int itemId = 0, itemCount = 1, itemStacks = 1;\n\n if(args.size() > 1)\n {\n tUser = getUserByNick(args[0]);\n\n \/\/First check if item is a number\n itemId = atoi(args[1].c_str());\n\n \/\/If item was not a number, search the name from config\n if(itemId == 0)\n itemId = Conf::get().iValue(args[1]);\n\n \/\/ Check item validity\n if(!isValidItem(itemId))\n {\n reportError(user, \"Item \" + args[1] + \" not found.\");\n return;\n }\n\n if(args.size() > 2)\n {\n itemCount = atoi(args[2].c_str());\n \/\/ If multiple stacks\n itemStacks = roundUpTo(itemCount, 64) \/ 64; \n itemCount -= (itemStacks-1) * 64; \n }\n }\n else\n reportError(user, \"Too few parameters.\");\n\n if(tUser)\n {\n int amount = 64;\n for(int i = 0; i < itemStacks; i++)\n {\n \/\/ if last stack\n if(i == itemStacks - 1)\n amount = itemCount;\n\n spawnedItem item;\n item.EID = generateEID();\n item.item = itemId;\n item.health = 0;\n item.count = amount;\n item.pos.x() = static_cast<int>(tUser->pos.x * 32);\n item.pos.y() = static_cast<int>(tUser->pos.y * 32);\n item.pos.z() = static_cast<int>(tUser->pos.z * 32);\n\n Map::get().sendPickupSpawn(item);\n }\n\n Chat::get().sendMsg(user, COLOR_RED + user->nick + \" spawned \" + args[1], Chat::ADMINS);\n }\n else\n reportError(user, \"User \" + args[0] + \" not found (see \/players)\");\n}\n\n}\n\nvoid Chat::registerStandardCommands()\n{\n registerCommand(\"players\", playerList, false);\n registerCommand(\"about\", about, false);\n registerCommand(\"rules\", rules, false);\n registerCommand(\"home\", home, false);\n registerCommand(\"kit\", kit, false);\n registerCommand(\"save\", saveMap, true);\n registerCommand(\"kick\", kick, true);\n registerCommand(\"ctp\", coordinateTeleport, true);\n registerCommand(\"tp\", userTeleport, true);\n registerCommand(\"reload\", reloadConfiguration, true);\n registerCommand(\"give\", giveItems, true);\n}\n<commit_msg>Fixed rules and give<commit_after>\/*\n Copyright (c) 2010, The Mineserver Project\n All rights reserved.\n\n Redistribution and use in source and binary forms, with or without\n modification, are permitted provided that the following conditions are met:\n * Redistributions of source code must retain the above copyright\n notice, this list of conditions and the following disclaimer.\n * Redistributions in binary form must reproduce the above copyright\n notice, this list of conditions and the following disclaimer in the\n documentation and\/or other materials provided with the distribution.\n * Neither the name of the The Mineserver Project nor the\n names of its contributors may be used to endorse or promote products\n derived from this software without specific prior written permission.\n\n THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS \"AS IS\" AND\n ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED\n WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE\n DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER BE LIABLE FOR ANY\n DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES\n (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;\n LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND\n ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT\n (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS\n SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.\n *\/\n\n#include <cstdlib>\n#include <cstdio>\n#include <iostream>\n#include <deque>\n#include <fstream>\n#include <vector>\n#include <ctime>\n#include <math.h>\n#ifdef WIN32\n #include <winsock2.h>\n#else\n #include <netinet\/in.h>\n #include <string.h>\n#endif\n\n#include \"logger.h\"\n#include \"constants.h\"\n\n#include \"tools.h\"\n#include \"map.h\"\n#include \"user.h\"\n#include \"chat.h\"\n#include \"config.h\"\n#include \"physics.h\"\n\nnamespace\n{\n\nvoid reportError(User *user, std::string message)\n{\n Chat::get().sendMsg(user, COLOR_DARK_MAGENTA + \"Error! \" + COLOR_RED + message, Chat::USER);\n}\n\nvoid playerList(User *user, std::string command, std::deque<std::string> args)\n{\n Chat::get().sendUserlist(user);\n}\n\nvoid about(User *user, std::string command, std::deque<std::string> args)\n{\n Chat::get().sendMsg(user, COLOR_DARK_MAGENTA + Conf::get().sValue(\"servername\")+\n \"Running Mineserver v.\" + VERSION, Chat::USER);\n}\n\n\/\/ TODO: Check if rulesfile exists\nvoid rules(User *user, std::string command, std::deque<std::string> args)\n{\n User *tUser = user;\n if(!args.empty() && user->admin)\n tUser = getUserByNick(args[0]);\n if(tUser != NULL)\n {\n \/\/ Send rules\n std::ifstream ifs( RULESFILE.c_str());\n std::string temp;\n\n if(ifs.fail())\n {\n std::cout << \"> Warning: \" << RULESFILE << \" not found.\" << std::endl;\n return;\n }\n else\n {\n while(getline(ifs, temp))\n {\n \/\/ If not a comment\n if(temp.empty() || temp[0] != COMMENTPREFIX)\n Chat::get().sendMsg(tUser, temp, Chat::USER);\n }\n ifs.close();\n }\n }\n else\n reportError(user, \"User \" + args[0] + \" not found (see \/players)\");\n}\n\nvoid home(User *user, std::string command, std::deque<std::string> args)\n{\n Chat::get().sendMsg(user, COLOR_DARK_MAGENTA + \"Teleported you home!\", Chat::USER);\n user->teleport(Map::get().spawnPos.x(), Map::get().spawnPos.y() + 2, Map::get().spawnPos.z());\n}\n\nvoid kit(User *user, std::string command, std::deque<std::string> args)\n{\n if(!args.empty())\n {\n std::vector<int> kitItems = Conf::get().vValue(\"kit_\" + args[0]);\n \/\/ If kit is found\n if(!kitItems.empty())\n {\n for(std::vector<int>::iterator iter = kitItems.begin(), end = kitItems.end();\n iter != end;\n ++iter)\n {\n spawnedItem item;\n item.EID = generateEID();\n item.item = *iter;\n item.count = 1;\n item.health=0;\n item.pos.x() = static_cast<int>(user->pos.x*32 + (rand() % 30));\n item.pos.y() = static_cast<int>(user->pos.y*32);\n item.pos.z() = static_cast<int>(user->pos.z*32 + (rand() % 30));\n Map::get().sendPickupSpawn(item);\n kitItems.pop_back();\n }\n }\n else\n reportError(user, \"Kit \" + args[0] + \" not found\");\n }\n}\n\nvoid saveMap(User *user, std::string command, std::deque<std::string> args)\n{\n Map::get().saveWholeMap();\n Chat::get().sendMsg(user, COLOR_DARK_MAGENTA + \"SERVER:\" + COLOR_RED + \" Saved map to disc\",\n Chat::USER);\n}\n\nvoid kick(User *user, std::string command, std::deque<std::string> args)\n{\n if(!args.empty())\n {\n std::string victim = args[0];\n\n User *tUser = getUserByNick(victim);\n\n if(tUser != NULL)\n {\n args.pop_front();\n std::string kickMsg;\n if(args.empty())\n kickMsg = Conf::get().sValue(\"default_kick_message\");\n else\n {\n while(!args.empty())\n {\n kickMsg += args[0] + \" \";\n args.pop_front();\n }\n }\n\n tUser->kick(kickMsg);\n }\n else\n reportError(user, \"User \" + victim + \" not found (see \/players)\");\n }\n else\n reportError(user, \"Usage: \/kick user [reason]\");\n}\n\nvoid coordinateTeleport(User *user, std::string command, std::deque<std::string> args)\n{\n if(args.size() > 2)\n {\n LOG(user->nick + \" teleport to: \" + args[0] + \" \" + args[1] + \" \" + args[2]);\n double x = atof(args[0].c_str());\n double y = atof(args[1].c_str());\n double z = atof(args[2].c_str());\n user->teleport(x, y, z);\n }\n}\n\nvoid userTeleport(User *user, std::string command, std::deque<std::string> args)\n{\n if(args.size() == 1)\n {\n LOG(user->nick + \" teleport to: \" + args[0]);\n User *tUser = getUserByNick(args[0]);\n if(tUser != NULL)\n user->teleport(tUser->pos.x, tUser->pos.y + 2, tUser->pos.z);\n else\n reportError(user, \"User \" + args[0] + \" not found (see \/players)\");\n }\n else if(args.size() == 2)\n {\n LOG(user->nick + \": teleport \" + args[0] + \" to \" + args[1]);\n\n User *whoUser = getUserByNick(args[0]);\n User *toUser = getUserByNick(args[1]);\n\n if(whoUser != NULL && toUser != NULL)\n {\n whoUser->teleport(toUser->pos.x, toUser->pos.y + 2, toUser->pos.z);\n Chat::get().sendMsg(user, COLOR_MAGENTA + \"Teleported!\", Chat::USER);\n }\n else\n {\n reportError(user, \"User \" + (whoUser == NULL ? args[0] : args[1])+\n \" not found (see \/players\");\n }\n }\n}\n\nvoid reloadConfiguration(User *user, std::string command, std::deque<std::string> args)\n{\n Chat::get().loadAdmins(ADMINFILE);\n Conf::get().load(CONFIGFILE);\n\n \/\/ Set physics enable state based on config\n Physics::get().enabled = ((Conf::get().iValue(\"liquid_physics\") == 0) ? false : true);\n\n Chat::get().sendMsg(user, COLOR_DARK_MAGENTA + \"SERVER:\" + COLOR_RED+\n \" Reloaded admins and config\", Chat::USER);\n\n \/\/ Note that the MOTD is loaded on-demand each time it is requested\n}\n\nbool isValidItem(int id)\n{\n if(id < 1) \/\/ zero or negative items are all invalid\n return false;\n\n if(id > 91 && id < 256) \/\/ these are undefined blocks and items\n return false;\n\n if(id == 2256 || id == 2257) \/\/ records are special cased\n return true;\n\n if(id > 350) \/\/ high items are invalid\n return false;\n\n if(id >= BLOCK_RED_CLOTH && id <= BLOCK_GRAY_CLOTH) \/\/ coloured cloth causes client crashes\n return false;\n\n return true;\n}\n\nint roundUpTo(int x, int nearest) \n{ \n x += (nearest - 1); \n x \/= nearest; \n x *= nearest; \n return x; \n} \n\nvoid giveItems(User *user, std::string command, std::deque<std::string> args)\n{\n User *tUser = NULL;\n int itemId = 0, itemCount = 1, itemStacks = 1;\n\n if(args.size() > 1)\n {\n tUser = getUserByNick(args[0]);\n\n \/\/First check if item is a number\n itemId = atoi(args[1].c_str());\n\n \/\/If item was not a number, search the name from config\n if(itemId == 0)\n itemId = Conf::get().iValue(args[1]);\n\n \/\/ Check item validity\n if(!isValidItem(itemId))\n {\n reportError(user, \"Item \" + args[1] + \" not found.\");\n return;\n }\n\n if(args.size() > 2)\n {\n itemCount = atoi(args[2].c_str());\n \/\/ If multiple stacks\n itemStacks = roundUpTo(itemCount, 64) \/ 64; \n itemCount -= (itemStacks-1) * 64; \n }\n }\n else\n {\n reportError(user, \"Too few parameters.\");\n\t return;\n }\n\n if(tUser)\n {\n int amount = 64;\n for(int i = 0; i < itemStacks; i++)\n {\n \/\/ if last stack\n if(i == itemStacks - 1)\n amount = itemCount;\n\n spawnedItem item;\n item.EID = generateEID();\n item.item = itemId;\n item.health = 0;\n item.count = amount;\n item.pos.x() = static_cast<int>(tUser->pos.x * 32);\n item.pos.y() = static_cast<int>(tUser->pos.y * 32);\n item.pos.z() = static_cast<int>(tUser->pos.z * 32);\n\n Map::get().sendPickupSpawn(item);\n }\n\n Chat::get().sendMsg(user, COLOR_RED + user->nick + \" spawned \" + args[1], Chat::ADMINS);\n }\n else\n reportError(user, \"User \" + args[0] + \" not found (see \/players)\");\n}\n\nvoid Chat::registerStandardCommands()\n{\n registerCommand(\"players\", playerList, false);\n registerCommand(\"about\", about, false);\n registerCommand(\"rules\", rules, false);\n registerCommand(\"home\", home, false);\n registerCommand(\"kit\", kit, false);\n registerCommand(\"save\", saveMap, true);\n registerCommand(\"kick\", kick, true);\n registerCommand(\"ctp\", coordinateTeleport, true);\n registerCommand(\"tp\", userTeleport, true);\n registerCommand(\"reload\", reloadConfiguration, true);\n registerCommand(\"give\", giveItems, true);\n}\n<|endoftext|>"} {"text":"<commit_before>\/** \n *\n * Copyright (c) 2011-2012, Kitty Barnett\n * \n * The source code in this file is provided to you under the terms of the \n * GNU Lesser General Public License, version 2.1, but WITHOUT ANY WARRANTY;\n * without even the implied warranty of MERCHANTABILITY or FITNESS FOR A \n * PARTICULAR PURPOSE. Terms of the LGPL can be found in doc\/LGPL-licence.txt \n * in this distribution, or online at http:\/\/www.gnu.org\/licenses\/lgpl-2.1.txt\n * \n * By copying, modifying or distributing this software, you acknowledge that\n * you have read and understood your obligations described above, and agree to \n * abide by those obligations.\n * \n *\/\n\n#include \"llviewerprecompiledheaders.h\"\n\n#include \"llagent.h\"\n#include \"llassetuploadresponders.h\"\n#include \"llcheckboxctrl.h\"\n#include \"lldiriterator.h\"\n#include \"llfloaterreg.h\"\n#include \"llfolderview.h\"\n#include \"llinventoryfunctions.h\"\n#include \"llinventorymodel.h\"\n#include \"llinventorypanel.h\"\n#include \"llscrolllistctrl.h\"\n#include \"llviewerassettype.h\"\n#include \"llviewerinventory.h\"\n#include \"llviewerregion.h\"\n\n#include \"llfloaterscriptrecover.h\"\n\nconst std::string NEW_LSL_NAME = \"New Script\";\n\nstd::string fixNewScriptDefaultName(const std::string& scriptName)\n{\n\tstd::string fixedScriptName = scriptName;\n\tif (scriptName == NEW_LSL_NAME)\n\t{\n\t\tLLStringUtil::replaceChar(fixedScriptName, ' ', '_');\n\t}\n\treturn fixedScriptName;\n}\n\n\/\/ ============================================================================\n\/\/ LLFloaterScriptRecover\n\/\/\n\nLLFloaterScriptRecover::LLFloaterScriptRecover(const LLSD& sdKey)\n\t: LLFloater(sdKey)\n{\n}\n\nvoid LLFloaterScriptRecover::onOpen(const LLSD& sdKey)\n{\n\tLLScrollListCtrl* pListCtrl = findChild<LLScrollListCtrl>(\"script_list\");\n\n\tLLSD sdBhvrRow; LLSD& sdBhvrColumns = sdBhvrRow[\"columns\"];\n\tsdBhvrColumns[0] = LLSD().with(\"column\", \"script_check\").with(\"type\", \"checkbox\");\n\tsdBhvrColumns[1] = LLSD().with(\"column\", \"script_name\").with(\"type\", \"text\");\n\n\tpListCtrl->clearRows();\n\tfor (LLSD::array_const_iterator itFile = sdKey[\"files\"].beginArray(), endFile = sdKey[\"files\"].endArray(); \n\t\t\titFile != endFile; ++itFile)\n\t{\n\t\tconst LLSD& sdFile = *itFile;\n\n\t\tsdBhvrRow[\"value\"] = sdFile;\n\t\tsdBhvrColumns[0][\"value\"] = true;\n\t\tsdBhvrColumns[1][\"value\"] = sdFile[\"name\"];\n\n\t\tpListCtrl->addElement(sdBhvrRow, ADD_BOTTOM);\n\t}\n}\n\nBOOL LLFloaterScriptRecover::postBuild()\n{\n\tfindChild<LLUICtrl>(\"recover_btn\")->setCommitCallback(boost::bind(&LLFloaterScriptRecover::onBtnRecover, this));\n\tfindChild<LLUICtrl>(\"cancel_btn\")->setCommitCallback(boost::bind(&LLFloaterScriptRecover::onBtnCancel, this));\n\n\treturn TRUE;\n}\n\nvoid LLFloaterScriptRecover::onBtnCancel()\n{\n\tLLScrollListCtrl* pListCtrl = findChild<LLScrollListCtrl>(\"script_list\");\n\n\t\/\/ Delete all listed files\n\tstd::vector<LLScrollListItem*> items = pListCtrl->getAllData();\n\tfor (std::vector<LLScrollListItem*>::const_iterator itItem = items.begin(); itItem != items.end(); ++itItem)\n\t{\n\t\tLLFile::remove((*itItem)->getValue().asString());\n\t}\n\n\tcloseFloater();\n}\n\nvoid LLFloaterScriptRecover::onBtnRecover()\n{\n\tLLScrollListCtrl* pListCtrl = findChild<LLScrollListCtrl>(\"script_list\");\n\n\t\/\/ Recover all selected, delete any unselected\n\tstd::vector<LLScrollListItem*> items = pListCtrl->getAllData(); LLSD sdFiles;\n\tfor (std::vector<LLScrollListItem*>::const_iterator itItem = items.begin(); itItem != items.end(); ++itItem)\n\t{\n\t\tLLScrollListCheck* pCheckColumn = dynamic_cast<LLScrollListCheck*>((*itItem)->getColumn(0));\n\t\tif (!pCheckColumn)\n\t\t\tcontinue;\n\n\t\tconst LLSD sdFile = (*itItem)->getValue();\n\t\tif (pCheckColumn->getCheckBox()->getValue().asBoolean())\n\t\t\tsdFiles.append(sdFile);\n\t\telse\n\t\t\tLLFile::remove(sdFile[\"path\"]);\n\t}\n\n\tif (!sdFiles.emptyArray())\n\t\tnew LLScriptRecoverQueue(sdFiles);\n\n\tcloseFloater();\n}\n\n\/\/ ============================================================================\n\/\/ LLCreateRecoverScriptCallback\n\/\/\n\nclass LLCreateRecoverScriptCallback : public LLInventoryCallback\n{\npublic:\n\tLLCreateRecoverScriptCallback(LLScriptRecoverQueue* pRecoverQueue)\n\t\t: LLInventoryCallback(), mRecoverQueue(pRecoverQueue)\n\t{\n\t}\n\n\tvoid fire(const LLUUID& idItem)\n\t{\n\t\tmRecoverQueue->onCreateScript(idItem);\n\t}\n\nprotected:\n\tLLScriptRecoverQueue* mRecoverQueue;\n};\n\n\/\/ ============================================================================\n\/\/ LLScriptRecoverQueue\n\/\/\n\n\/\/ static\nvoid LLScriptRecoverQueue::recoverIfNeeded()\n{\n\tconst std::string strTempPath = LLFile::tmpdir();\n\tLLSD sdData, &sdFiles = sdData[\"files\"];\n\n\tLLDirIterator itFiles(strTempPath, \"*.lslbackup\"); std::string strFilename;\n\twhile (itFiles.next(strFilename))\n\t{\n\t\t\/\/ Build a friendly name for the file\n\t\tstd::string strName = gDirUtilp->getBaseFileName(strFilename, true);\n\t\tstd::string::size_type offset = strName.find_last_of(\"-\");\n\t\tif ( (std::string::npos != offset) && (offset != 0) && (offset == strName.length() - 9))\n\t\t\tstrName.erase(strName.length() - 9);\n\n\t\tLLStringUtil::trim(strName);\n\t\tif (0 == strName.length())\n\t\t\tstrName = \"(Unknown script)\";\n\n\t\tsdFiles.append(LLSD().with(\"path\", strTempPath + strFilename).with(\"name\", strName));\n\t}\n\n\tif (sdFiles.size())\n\t\tLLFloaterReg::showInstance(\"script_recover\", sdData);\n}\n\nLLScriptRecoverQueue::LLScriptRecoverQueue(const LLSD& sdFiles)\n{\n\tfor (LLSD::array_const_iterator itFile = sdFiles.beginArray(), endFile = sdFiles.endArray(); itFile != endFile; ++itFile)\n\t{\n\t\tconst LLSD& sdFile = *itFile;\n\t\tif (LLFile::isfile(sdFile[\"path\"]))\n\t\t\tm_FileQueue.insert(std::pair<std::string, LLSD>(sdFile[\"path\"], sdFile));\n\t}\n\trecoverNext();\n}\n\nbool LLScriptRecoverQueue::recoverNext()\n{\n\t\/**\n\t * Steps:\n\t * (1) create a script inventory item under Lost and Found\n\t * (2) once we have the item's UUID we can upload the script\n\t * (3) once the script is uploaded we move on to the next item\n\t *\/\n\tconst LLUUID idFNF = gInventory.findCategoryUUIDForType(LLFolderType::FT_LOST_AND_FOUND);\n\n\t\/\/ Sanity check - if the associated UUID is non-null then this file is already being processed\n\tfilename_queue_t::const_iterator itFile = m_FileQueue.begin();\n\twhile ( (itFile != m_FileQueue.end()) && (itFile->second.has(\"item\")) && (itFile->second[\"item\"].asUUID().notNull()) )\n\t\t++itFile;\n\n\tif (m_FileQueue.end() == itFile) \n\t{\n\t\tLLInventoryPanel* pInvPanel = LLInventoryPanel::getActiveInventoryPanel(TRUE);\n\t\tif (pInvPanel)\n\t\t{\n\t\t\tLLFolderViewFolder* pFVF = dynamic_cast<LLFolderViewFolder*>(pInvPanel->getRootFolder()->getItemByID(idFNF));\n\t\t\tif (pFVF)\n\t\t\t{\n\t\t\t\tpFVF->setOpenArrangeRecursively(TRUE, LLFolderViewFolder::RECURSE_UP);\n\t\t\t\tpInvPanel->setSelection(idFNF, TRUE);\n\t\t\t}\n\t\t}\n\n\t\tdelete this;\n\t\treturn false;\n\t}\n\n\tstd::string strItemDescr;\n\tLLViewerAssetType::generateDescriptionFor(LLAssetType::AT_LSL_TEXT, strItemDescr);\n\n\t\/\/ Ansariel: Need to work around a bug preventing us from creating a\n\t\/\/ script with the default name for new scripts\n\tstd::string strScriptName = fixNewScriptDefaultName(itFile->second[\"name\"].asString());\n\n\tcreate_inventory_item(gAgent.getID(), gAgent.getSessionID(), idFNF, LLTransactionID::tnull, \n\t strScriptName, strItemDescr, LLAssetType::AT_LSL_TEXT, LLInventoryType::IT_LSL,\n\t NOT_WEARABLE, PERM_MOVE | PERM_TRANSFER, new LLCreateRecoverScriptCallback(this));\n\treturn true;\n}\n\nvoid LLScriptRecoverQueue::onCreateScript(const LLUUID& idItem)\n{\n\tconst LLViewerInventoryItem* pItem = gInventory.getItem(idItem);\n\tif (!pItem)\n\t{\n\t\t\/\/ TODO: error handling\n\t\treturn;\n\t}\n\n\tstd::string strFileName;\n\tfor (filename_queue_t::iterator itFile = m_FileQueue.begin(); itFile != m_FileQueue.end(); ++itFile)\n\t{\n\t\tif (fixNewScriptDefaultName(itFile->second[\"name\"].asString()) != pItem->getName())\n\t\t\tcontinue;\n\t\tstrFileName = itFile->second[\"path\"].asString();\n\t\titFile->second[\"item\"] = idItem;\n\t\tbreak;\n\t}\n\n\tLLSD sdBody;\n\tsdBody[\"item_id\"] = idItem;\n\tsdBody[\"target\"] = \"lsl2\";\n\n\tstd::string strCapsUrl = gAgent.getRegion()->getCapability(\"UpdateScriptAgent\");\n\tLLHTTPClient::post(strCapsUrl, sdBody, \n\t new LLUpdateAgentInventoryResponder(sdBody, strFileName, LLAssetType::AT_LSL_TEXT, \n\t boost::bind(&LLScriptRecoverQueue::onSavedScript, this, _1, _2, _3),\n\t boost::bind(&LLScriptRecoverQueue::onUploadError, this, _1)));\n}\n\nvoid LLScriptRecoverQueue::onSavedScript(const LLUUID& idItem, const LLSD&, bool fSuccess)\n{\n\tLLPointer<LLViewerInventoryItem> pItem = gInventory.getItem(idItem);\n\tif (pItem.notNull())\n\t{\n\t\tfilename_queue_t::iterator itFile = m_FileQueue.begin();\n\t\twhile ( (itFile != m_FileQueue.end()) && ((!itFile->second.has(\"item\")) || (itFile->second[\"item\"].asUUID() != idItem)) )\n\t\t\t++itFile;\n\t\tif (itFile != m_FileQueue.end())\n\t\t{\n\t\t\t\/\/ Ansariel: Rename back scripts with default name\n\t\t\tstd::string strScriptName = itFile->second[\"name\"].asString();\n\t\t\tif (strScriptName == NEW_LSL_NAME)\n\t\t\t{\n\t\t\t\tLLPointer<LLViewerInventoryItem> pNewItem = new LLViewerInventoryItem(pItem);\n\t\t\t\tpNewItem->rename(strScriptName);\n\t\t\t\tpNewItem->updateServer(FALSE);\n\t\t\t\tgInventory.updateItem(pNewItem);\n\t\t\t\tgInventory.notifyObservers();\n\t\t\t}\n\n\t\t\tLLFile::remove(itFile->first);\n\t\t\tm_FileQueue.erase(itFile);\n\t\t}\n\t}\n\trecoverNext();\n}\n\nbool LLScriptRecoverQueue::onUploadError(const std::string& strFilename)\n{\n\t\/\/ Skip over the file when there's an error, we can try again on the next relog\n\tfilename_queue_t::iterator itFile = m_FileQueue.find(strFilename);\n\tif (itFile != m_FileQueue.end())\n\t{\n\t\tLLViewerInventoryItem* pItem = gInventory.getItem(itFile->second[\"item\"]);\n\t\tif (pItem)\n\t\t\tgInventory.changeItemParent(pItem, gInventory.findCategoryUUIDForType(LLFolderType::FT_TRASH), FALSE);\n\t\tm_FileQueue.erase(itFile);\n\t}\n\trecoverNext();\n\treturn false;\n}\n\n\/\/ ============================================================================\n<commit_msg>Build fix in llfloaterscriptrecover.cpp<commit_after>\/** \n *\n * Copyright (c) 2011-2012, Kitty Barnett\n * \n * The source code in this file is provided to you under the terms of the \n * GNU Lesser General Public License, version 2.1, but WITHOUT ANY WARRANTY;\n * without even the implied warranty of MERCHANTABILITY or FITNESS FOR A \n * PARTICULAR PURPOSE. Terms of the LGPL can be found in doc\/LGPL-licence.txt \n * in this distribution, or online at http:\/\/www.gnu.org\/licenses\/lgpl-2.1.txt\n * \n * By copying, modifying or distributing this software, you acknowledge that\n * you have read and understood your obligations described above, and agree to \n * abide by those obligations.\n * \n *\/\n\n#include \"llviewerprecompiledheaders.h\"\n\n#include \"llagent.h\"\n#include \"llassetuploadresponders.h\"\n#include \"llcheckboxctrl.h\"\n#include \"lldiriterator.h\"\n#include \"llfloaterreg.h\"\n#include \"llfolderview.h\"\n#include \"llinventoryfunctions.h\"\n#include \"llinventorymodel.h\"\n#include \"llinventorypanel.h\"\n#include \"llscrolllistctrl.h\"\n#include \"llviewerassettype.h\"\n#include \"llviewerinventory.h\"\n#include \"llviewerregion.h\"\n\n#include \"llfloaterscriptrecover.h\"\n\nconst std::string NEW_LSL_NAME = \"New Script\";\n\nstd::string fixNewScriptDefaultName(const std::string& scriptName)\n{\n\tstd::string fixedScriptName = scriptName;\n\tif (scriptName == NEW_LSL_NAME)\n\t{\n\t\tLLStringUtil::replaceChar(fixedScriptName, ' ', '_');\n\t}\n\treturn fixedScriptName;\n}\n\n\/\/ ============================================================================\n\/\/ LLFloaterScriptRecover\n\/\/\n\nLLFloaterScriptRecover::LLFloaterScriptRecover(const LLSD& sdKey)\n\t: LLFloater(sdKey)\n{\n}\n\nvoid LLFloaterScriptRecover::onOpen(const LLSD& sdKey)\n{\n\tLLScrollListCtrl* pListCtrl = findChild<LLScrollListCtrl>(\"script_list\");\n\n\tLLSD sdBhvrRow; LLSD& sdBhvrColumns = sdBhvrRow[\"columns\"];\n\tsdBhvrColumns[0] = LLSD().with(\"column\", \"script_check\").with(\"type\", \"checkbox\");\n\tsdBhvrColumns[1] = LLSD().with(\"column\", \"script_name\").with(\"type\", \"text\");\n\n\tpListCtrl->clearRows();\n\tfor (LLSD::array_const_iterator itFile = sdKey[\"files\"].beginArray(), endFile = sdKey[\"files\"].endArray(); \n\t\t\titFile != endFile; ++itFile)\n\t{\n\t\tconst LLSD& sdFile = *itFile;\n\n\t\tsdBhvrRow[\"value\"] = sdFile;\n\t\tsdBhvrColumns[0][\"value\"] = true;\n\t\tsdBhvrColumns[1][\"value\"] = sdFile[\"name\"];\n\n\t\tpListCtrl->addElement(sdBhvrRow, ADD_BOTTOM);\n\t}\n}\n\nBOOL LLFloaterScriptRecover::postBuild()\n{\n\tfindChild<LLUICtrl>(\"recover_btn\")->setCommitCallback(boost::bind(&LLFloaterScriptRecover::onBtnRecover, this));\n\tfindChild<LLUICtrl>(\"cancel_btn\")->setCommitCallback(boost::bind(&LLFloaterScriptRecover::onBtnCancel, this));\n\n\treturn TRUE;\n}\n\nvoid LLFloaterScriptRecover::onBtnCancel()\n{\n\tLLScrollListCtrl* pListCtrl = findChild<LLScrollListCtrl>(\"script_list\");\n\n\t\/\/ Delete all listed files\n\tstd::vector<LLScrollListItem*> items = pListCtrl->getAllData();\n\tfor (std::vector<LLScrollListItem*>::const_iterator itItem = items.begin(); itItem != items.end(); ++itItem)\n\t{\n\t\tLLFile::remove((*itItem)->getValue().asString());\n\t}\n\n\tcloseFloater();\n}\n\nvoid LLFloaterScriptRecover::onBtnRecover()\n{\n\tLLScrollListCtrl* pListCtrl = findChild<LLScrollListCtrl>(\"script_list\");\n\n\t\/\/ Recover all selected, delete any unselected\n\tstd::vector<LLScrollListItem*> items = pListCtrl->getAllData(); LLSD sdFiles;\n\tfor (std::vector<LLScrollListItem*>::const_iterator itItem = items.begin(); itItem != items.end(); ++itItem)\n\t{\n\t\tLLScrollListCheck* pCheckColumn = dynamic_cast<LLScrollListCheck*>((*itItem)->getColumn(0));\n\t\tif (!pCheckColumn)\n\t\t\tcontinue;\n\n\t\tconst LLSD sdFile = (*itItem)->getValue();\n\t\tif (pCheckColumn->getCheckBox()->getValue().asBoolean())\n\t\t\tsdFiles.append(sdFile);\n\t\telse\n\t\t\tLLFile::remove(sdFile[\"path\"]);\n\t}\n\n\tif (!sdFiles.emptyArray())\n\t\tnew LLScriptRecoverQueue(sdFiles);\n\n\tcloseFloater();\n}\n\n\/\/ ============================================================================\n\/\/ LLCreateRecoverScriptCallback\n\/\/\n\nclass LLCreateRecoverScriptCallback : public LLInventoryCallback\n{\npublic:\n\tLLCreateRecoverScriptCallback(LLScriptRecoverQueue* pRecoverQueue)\n\t\t: LLInventoryCallback(), mRecoverQueue(pRecoverQueue)\n\t{\n\t}\n\n\tvoid fire(const LLUUID& idItem)\n\t{\n\t\tmRecoverQueue->onCreateScript(idItem);\n\t}\n\nprotected:\n\tLLScriptRecoverQueue* mRecoverQueue;\n};\n\n\/\/ ============================================================================\n\/\/ LLScriptRecoverQueue\n\/\/\n\n\/\/ static\nvoid LLScriptRecoverQueue::recoverIfNeeded()\n{\n\tconst std::string strTempPath = LLFile::tmpdir();\n\tLLSD sdData, &sdFiles = sdData[\"files\"];\n\n\tLLDirIterator itFiles(strTempPath, \"*.lslbackup\"); std::string strFilename;\n\twhile (itFiles.next(strFilename))\n\t{\n\t\t\/\/ Build a friendly name for the file\n\t\tstd::string strName = gDirUtilp->getBaseFileName(strFilename, true);\n\t\tstd::string::size_type offset = strName.find_last_of(\"-\");\n\t\tif ( (std::string::npos != offset) && (offset != 0) && (offset == strName.length() - 9))\n\t\t\tstrName.erase(strName.length() - 9);\n\n\t\tLLStringUtil::trim(strName);\n\t\tif (0 == strName.length())\n\t\t\tstrName = \"(Unknown script)\";\n\n\t\tsdFiles.append(LLSD().with(\"path\", strTempPath + strFilename).with(\"name\", strName));\n\t}\n\n\tif (sdFiles.size())\n\t\tLLFloaterReg::showInstance(\"script_recover\", sdData);\n}\n\nLLScriptRecoverQueue::LLScriptRecoverQueue(const LLSD& sdFiles)\n{\n\tfor (LLSD::array_const_iterator itFile = sdFiles.beginArray(), endFile = sdFiles.endArray(); itFile != endFile; ++itFile)\n\t{\n\t\tconst LLSD& sdFile = *itFile;\n\t\tif (LLFile::isfile(sdFile[\"path\"]))\n\t\t\tm_FileQueue.insert(std::pair<std::string, LLSD>(sdFile[\"path\"], sdFile));\n\t}\n\trecoverNext();\n}\n\nbool LLScriptRecoverQueue::recoverNext()\n{\n\t\/**\n\t * Steps:\n\t * (1) create a script inventory item under Lost and Found\n\t * (2) once we have the item's UUID we can upload the script\n\t * (3) once the script is uploaded we move on to the next item\n\t *\/\n\tconst LLUUID idFNF = gInventory.findCategoryUUIDForType(LLFolderType::FT_LOST_AND_FOUND);\n\n\t\/\/ Sanity check - if the associated UUID is non-null then this file is already being processed\n\tfilename_queue_t::const_iterator itFile = m_FileQueue.begin();\n\twhile ( (itFile != m_FileQueue.end()) && (itFile->second.has(\"item\")) && (itFile->second[\"item\"].asUUID().notNull()) )\n\t\t++itFile;\n\n\tif (m_FileQueue.end() == itFile) \n\t{\n\t\tLLInventoryPanel* pInvPanel = LLInventoryPanel::getActiveInventoryPanel(TRUE);\n\t\tLLFolderViewFolder* pFVF = dynamic_cast<LLFolderViewFolder*>(pInvPanel ? pInvPanel->getItemByID(idFNF) : NULL);\n\t\tif (pFVF)\n\t\t{\n\t\t\tpFVF->setOpenArrangeRecursively(TRUE, LLFolderViewFolder::RECURSE_UP);\n\t\t\tpInvPanel->setSelection(idFNF, TRUE);\n\t\t}\n\n\t\tdelete this;\n\t\treturn false;\n\t}\n\n\tstd::string strItemDescr;\n\tLLViewerAssetType::generateDescriptionFor(LLAssetType::AT_LSL_TEXT, strItemDescr);\n\n\t\/\/ Ansariel: Need to work around a bug preventing us from creating a\n\t\/\/ script with the default name for new scripts\n\tstd::string strScriptName = fixNewScriptDefaultName(itFile->second[\"name\"].asString());\n\n\tcreate_inventory_item(gAgent.getID(), gAgent.getSessionID(), idFNF, LLTransactionID::tnull, \n\t strScriptName, strItemDescr, LLAssetType::AT_LSL_TEXT, LLInventoryType::IT_LSL,\n\t NOT_WEARABLE, PERM_MOVE | PERM_TRANSFER, new LLCreateRecoverScriptCallback(this));\n\treturn true;\n}\n\nvoid LLScriptRecoverQueue::onCreateScript(const LLUUID& idItem)\n{\n\tconst LLViewerInventoryItem* pItem = gInventory.getItem(idItem);\n\tif (!pItem)\n\t{\n\t\t\/\/ TODO: error handling\n\t\treturn;\n\t}\n\n\tstd::string strFileName;\n\tfor (filename_queue_t::iterator itFile = m_FileQueue.begin(); itFile != m_FileQueue.end(); ++itFile)\n\t{\n\t\tif (fixNewScriptDefaultName(itFile->second[\"name\"].asString()) != pItem->getName())\n\t\t\tcontinue;\n\t\tstrFileName = itFile->second[\"path\"].asString();\n\t\titFile->second[\"item\"] = idItem;\n\t\tbreak;\n\t}\n\n\tLLSD sdBody;\n\tsdBody[\"item_id\"] = idItem;\n\tsdBody[\"target\"] = \"lsl2\";\n\n\tstd::string strCapsUrl = gAgent.getRegion()->getCapability(\"UpdateScriptAgent\");\n\tLLHTTPClient::post(strCapsUrl, sdBody, \n\t new LLUpdateAgentInventoryResponder(sdBody, strFileName, LLAssetType::AT_LSL_TEXT, \n\t boost::bind(&LLScriptRecoverQueue::onSavedScript, this, _1, _2, _3),\n\t boost::bind(&LLScriptRecoverQueue::onUploadError, this, _1)));\n}\n\nvoid LLScriptRecoverQueue::onSavedScript(const LLUUID& idItem, const LLSD&, bool fSuccess)\n{\n\tLLPointer<LLViewerInventoryItem> pItem = gInventory.getItem(idItem);\n\tif (pItem.notNull())\n\t{\n\t\tfilename_queue_t::iterator itFile = m_FileQueue.begin();\n\t\twhile ( (itFile != m_FileQueue.end()) && ((!itFile->second.has(\"item\")) || (itFile->second[\"item\"].asUUID() != idItem)) )\n\t\t\t++itFile;\n\t\tif (itFile != m_FileQueue.end())\n\t\t{\n\t\t\t\/\/ Ansariel: Rename back scripts with default name\n\t\t\tstd::string strScriptName = itFile->second[\"name\"].asString();\n\t\t\tif (strScriptName == NEW_LSL_NAME)\n\t\t\t{\n\t\t\t\tLLPointer<LLViewerInventoryItem> pNewItem = new LLViewerInventoryItem(pItem);\n\t\t\t\tpNewItem->rename(strScriptName);\n\t\t\t\tpNewItem->updateServer(FALSE);\n\t\t\t\tgInventory.updateItem(pNewItem);\n\t\t\t\tgInventory.notifyObservers();\n\t\t\t}\n\n\t\t\tLLFile::remove(itFile->first);\n\t\t\tm_FileQueue.erase(itFile);\n\t\t}\n\t}\n\trecoverNext();\n}\n\nbool LLScriptRecoverQueue::onUploadError(const std::string& strFilename)\n{\n\t\/\/ Skip over the file when there's an error, we can try again on the next relog\n\tfilename_queue_t::iterator itFile = m_FileQueue.find(strFilename);\n\tif (itFile != m_FileQueue.end())\n\t{\n\t\tLLViewerInventoryItem* pItem = gInventory.getItem(itFile->second[\"item\"]);\n\t\tif (pItem)\n\t\t\tgInventory.changeItemParent(pItem, gInventory.findCategoryUUIDForType(LLFolderType::FT_TRASH), FALSE);\n\t\tm_FileQueue.erase(itFile);\n\t}\n\trecoverNext();\n\treturn false;\n}\n\n\/\/ ============================================================================\n<|endoftext|>"} {"text":"<commit_before>#pragma once\n\n#include \"Quantities.hpp\"\n#include \"NamedQuantities.hpp\"\n#include \"Numbers.hpp\"\n#include \"SI.hpp\"\n\nnamespace principia {\n\/\/ This namespace contains the non-SI units associated with the CGS and the CGS-\n\/\/ Gaussian system of units listed in the BIPM's SI brochure 8, section 4.1,\n\/\/ table 9, http:\/\/www.bipm.org\/en\/si\/si_brochure\/chapter4\/table9.html.\nnamespace CGS {\nquantities::Length const Centimetre = SI::Centi(SI::Metre);\nusing SI::Gram;\nusing SI::Second;\n\nquantities::Energy const Erg = 1e-7 * SI::Joule;\nquantities::Force const Dyne = 1e-5 * SI::Newton;\n\nquantities::Pressure const Barye = 1 * Dyne \/ Centimetre.Pow<2>();\n\nquantities::DynamicViscosity const Poise = Barye * Second;\nquantities::KinematicViscosity const Stokes = Centimetre.Pow<2>() \/ Second;\n\nquantities::Luminance const Stilb = SI::Candela * Centimetre.Pow<-2>();\nquantities::Illuminance const Phot = Stilb * SI::Steradian ;\n\nquantities::Acceleration const Gal = Centimetre \/ Second.Pow<2>();\n\nquantities::MagneticFluxDensity const Gauss = 1e-4 * SI::Tesla;\nquantities::MagneticFlux const Maxwell = Gauss * Centimetre.Pow<2>();\nquantities::MagneticField const Œrsted = 1e3 \/ (4 * π * SI::Steradian) *\n SI::Ampere \/ SI::Metre;\n\nquantities::SpectroscopicWavenumber const Kayser = SI::Cycle \/ Centimetre;\n} \/\/ namespace CGS\n} \/\/ namespace principia\n<commit_msg>namespace cgs.<commit_after>#pragma once\n\n#include \"Quantities.hpp\"\n#include \"NamedQuantities.hpp\"\n#include \"Numbers.hpp\"\n#include \"SI.hpp\"\n\nnamespace principia {\n\/\/ This namespace contains the non-SI units associated with the CGS and the CGS-\n\/\/ Gaussian system of units listed in the BIPM's SI brochure 8, section 4.1,\n\/\/ table 9, http:\/\/www.bipm.org\/en\/si\/si_brochure\/chapter4\/table9.html.\nnamespace cgs {\nquantities::Length const Centimetre = SI::Centi(SI::Metre);\nusing SI::Gram;\nusing SI::Second;\n\nquantities::Energy const Erg = 1e-7 * SI::Joule;\nquantities::Force const Dyne = 1e-5 * SI::Newton;\n\nquantities::Pressure const Barye = 1 * Dyne \/ Centimetre.Pow<2>();\n\nquantities::DynamicViscosity const Poise = Barye * Second;\nquantities::KinematicViscosity const Stokes = Centimetre.Pow<2>() \/ Second;\n\nquantities::Luminance const Stilb = SI::Candela * Centimetre.Pow<-2>();\nquantities::Illuminance const Phot = Stilb * SI::Steradian ;\n\nquantities::Acceleration const Gal = Centimetre \/ Second.Pow<2>();\n\nquantities::MagneticFluxDensity const Gauss = 1e-4 * SI::Tesla;\nquantities::MagneticFlux const Maxwell = Gauss * Centimetre.Pow<2>();\nquantities::MagneticField const Œrsted = 1e3 \/ (4 * π * SI::Steradian) *\n SI::Ampere \/ SI::Metre;\n\nquantities::SpectroscopicWavenumber const Kayser = SI::Cycle \/ Centimetre;\n} \/\/ namespace cgs\n} \/\/ namespace principia\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_CPP_TYPES_HPP_\n#define REQL_CPP_TYPES_HPP_\n\n#include <map>\n#include <memory>\n#include <string>\n#include <vector>\n\nnamespace ReQL {\n\nnamespace _C {\n\nextern \"C\" {\n\n#include \".\/ReQL.h\"\n\n}\n\nnamespace CTypes {\n\ntypedef std::unique_ptr<ReQL_Byte[]> string;\ntypedef std::unique_ptr<ReQL_Obj_t> object;\ntypedef std::unique_ptr<ReQL_Obj_t*[]> array;\ntypedef std::unique_ptr<ReQL_Pair_t[]> pairs;\ntypedef std::unique_ptr<ReQL_Conn_t> connection;\ntypedef std::unique_ptr<ReQL_Cur_t> cursor;\n\n} \/\/ namespace Types\n} \/\/ namespace _C\n\nclass Query;\n\nnamespace Types {\n\ntypedef std::string string;\ntypedef std::vector<Query> array;\ntypedef std::map<string, Query> object;\n\n} \/\/ namespace Types\n} \/\/ namespace ReQL\n\n#endif \/\/ REQL_CPP_TYPES_HPP_\n<commit_msg>Fix comment.<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_CPP_TYPES_HPP_\n#define REQL_CPP_TYPES_HPP_\n\n#include <map>\n#include <memory>\n#include <string>\n#include <vector>\n\nnamespace ReQL {\n\nnamespace _C {\n\n#include \".\/ReQL.h\"\n\nnamespace CTypes {\n\ntypedef std::unique_ptr<ReQL_Byte[]> string;\ntypedef std::unique_ptr<ReQL_Obj_t> object;\ntypedef std::unique_ptr<ReQL_Obj_t*[]> array;\ntypedef std::unique_ptr<ReQL_Pair_t[]> pairs;\ntypedef std::unique_ptr<ReQL_Conn_t> connection;\ntypedef std::unique_ptr<ReQL_Cur_t> cursor;\n\n} \/\/ namespace CTypes\n} \/\/ namespace _C\n\nclass Query;\n\nnamespace Types {\n\ntypedef std::string string;\ntypedef std::vector<Query> array;\ntypedef std::map<string, Query> object;\n\n} \/\/ namespace Types\n} \/\/ namespace ReQL\n\n#endif \/\/ REQL_CPP_TYPES_HPP_\n<|endoftext|>"} {"text":"<commit_before>\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\n\/\/ SneezyMUD - All rights reserved, SneezyMUD Coding Team\n\/\/\n\/\/\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n#include \"stdsneezy.h\"\n#include \"cmd_trophy.h\"\n#include \"database.h\"\n\n\nTTrophy::TTrophy(sstring n) :\n db(new TDatabase(DB_SNEEZY)),\n parent(NULL),\n name(n)\n{\n}\n\nTTrophy::TTrophy(TBeing *p) :\n db(new TDatabase(DB_SNEEZY)),\n parent(p),\n name(\"\")\n{\n}\n\nsstring TTrophy::getMyName(){\n if(parent){\n \n if (parent->specials.act & ACT_POLYSELF) {\n return parent->desc->original->getName();\n } else { \n return parent->getName();\n }\n } else {\n \/\/ name should be \"\" if we're uninitialized, so just return it either way\n return name;\n }\n}\n\nvoid TTrophy::setName(sstring n){\n parent=NULL;\n name=n;\n}\n\nvoid TTrophy::addToCount(int vnum, double add){\n if(vnum==-1 || vnum==0 || getMyName()==\"\"){ return; }\n\n int player_id=parent->getPlayerID();\n\n db->query(\"select * from trophy where player_id=%i and mobvnum=%i\",\n\t player_id, vnum);\n if(!db->fetchRow()){\n db->query(\"insert into trophy values (%i, %i, %f)\",\n\t player_id, vnum, add);\n } else {\n db->query(\"update trophy set count=count+%f where player_id=%i and mobvnum=%i\",\n\t add, player_id, vnum);\n }\n\n db->query(\"update trophyplayer set total=total+%f where player_id=%i\",\n\t add, player_id);\n}\n\n\nfloat TTrophy::getCount(int vnum)\n{\n db->query(\"select count from trophy where player_id=%i and mobvnum=%i\",\n\t parent->getPlayerID(), vnum);\n if(db->fetchRow())\n return convertTo<float>((*db)[\"count\"]);\n else \n return 0.0;\n}\n\n\nfloat TTrophy::getExpModVal(float count)\n{\n float min_mod=0.3;\n float max_mod=1.0; \/\/ shouldn't ever be above 1.0\n float free_kills=8; \/\/ how many kills you get before trophy kicks in\n float step_mod=0.5; \/\/ mod per step\n float num_steps=14.0; \/\/ number of steps\n\n float t1, t2, t3, t4, t5;\n\n t1=(double)(count-free_kills);\n t2=step_mod \/ num_steps;\n t3=t1*t2;\n t4=max_mod-t3;\n t5=(double)(max(t4*100, min_mod*100)\/100);\n t5=(double)(min(t5*100, max_mod*100)\/100);\n\n \/\/ vlogf(LOG_PEEL, fmt(\"%f %f %f %f %f\") % t1 % t2 % t3 % t4 % t5);\n\n return t5;\n}\n\n\nconst char *TTrophy::getExpModDescr(float count)\n{\n float f=getExpModVal(count);\n\n return((f == 1.0) ? \"<Y>full<1>\" :\n\t ((f >= 0.90) ? \"<o>much<1>\" :\n\t ((f >= 0.80) ? \"a fair amount of\" :\n\t ((f >= 0.70) ? \"<w>some<1>\" : \"<k>little<1>\"))));\n}\n\n\/\/ this function is a little messy, I apologize\nvoid TBeing::doTrophy(const sstring &arg)\n{\n int mcount=0, vnum, header=0, zcount=0, bottom=0, zcountt=0;\n int zonesearch=0, processrow=1, active_zcount=0;\n bool summary=false;\n float count;\n sstring buf, sb, arg1, arg2;\n unsigned int zone;\n\n if(!isPc()){\n sendTo(\"Mobs can't use this command!\\n\\r\");\n return;\n }\n\n TBeing *per = NULL;\n if (specials.act & ACT_POLYSELF)\n per = desc->original;\n else per = this;\n \n TTrophy trophy(per->getName());\n\n arg1=arg.word(0);\n arg2=arg.word(1);\n\n if(arg1==\"zone\"){\n if(!arg2.empty()){\n arg1=arg2;\n zonesearch=-1;\n } else {\n zonesearch=roomp->getZoneNum();\n }\n } else if(arg1==\"summary\"){\n summary=true;\n }\n\n TDatabase db(DB_SNEEZY);\n db.query(\"select mobvnum, count from trophy where player_id=%i order by mobvnum\", per->getPlayerID());\n\n for (zone = 0; zone < zone_table.size(); zone++) {\n zoneData &zd = zone_table[zone];\n \n while(1){\n if(processrow){\n\tif(!db.fetchRow()){\n\t break;\n\t}\n }\n\n \/\/ sometimes we get an entry of 0 for med mobs I think\n vnum=convertTo<int>(db[\"mobvnum\"]);\n if(vnum==0){\n\tcontinue;\n }\n\n \/\/ this mob doesn't belong to this zone, so break out to the zone loop\n if(vnum>zd.top){\n\tprocessrow=0; \/\/ don't get the next row yet\n\tbreak;\n } else {\n\tprocessrow=1;\n }\n\n int rnum = real_mobile(convertTo<int>(db[\"mobvnum\"]));\n if (rnum < 0) {\n\tvlogf(LOG_BUG, fmt(\"DoTrophy detected bad mobvnum=%d for name='%s'\") % \n\t convertTo<int>(db[\"mobvnum\"]) % per->getName());\n\tcontinue;\n }\n\n if(zonesearch==-1){\n\tif(!isname(arg1, zd.name))\n\t continue;\n } else if(zonesearch>0){\n\tif(zonesearch!=zd.zone_nr)\n\t continue;\n } else if(!summary){\n\tif(!arg1.empty() && !isname(arg1, mob_index[rnum].name))\n\t continue;\n }\n\n \/\/ print the zone header if we haven't already\n \/\/ we do it here, so we can prevent printing headers for empty zones\n if(!header){\n\tbuf = fmt(\"\\n--%s\\n\") % zd.name;\n\tsb += buf; \n\theader=1;\n }\n\n count=convertTo<float>(db[\"count\"]);\n\n if(!summary){\n\tbuf = fmt(\"You will gain %s experience when fighting %s.\\n\\r\") %\n\t\ttrophy.getExpModDescr(count) % mob_index[rnum].short_desc;\n\tsb += buf;\n }\n\n ++mcount;\n ++zcount;\n\n if(mob_index[rnum].doesLoad)\n\t++active_zcount;\n\n processrow=1; \/\/ ok to get the next row\n }\n\n \/\/ we have some mobs for this zone, so do some tallies\n if(header){\n buf = fmt(\"Total mobs: %i\\n\\r\") % zcount;\n sb += buf;\n\n unsigned int objnx;\n for (objnx = 0; objnx < mob_index.size(); objnx++) {\n\tif(mob_index[objnx].virt >= bottom &&\n\t mob_index[objnx].virt <= zd.top &&\n\t mob_index[objnx].doesLoad){\n\t ++zcountt;\n\t}\n }\n\n buf = fmt(\"You have killed %1.2f%c of mobs in this zone.\\n\\r\") %((float)((float)active_zcount\/(float)zcountt)*100.0) % '%';\n sb += buf;\n }\n\n header=zcount=zcountt=active_zcount=0;\n bottom=zd.top+1;\n }\n\n\n\n int activemobcount=0;\n for (unsigned int mobnum = 0; mobnum < mob_index.size(); mobnum++) {\n for (unsigned int zone = 0; zone < zone_table.size(); zone++) {\n if(mob_index[mobnum].virt <= zone_table[zone].top &&\n\t mob_index[mobnum].doesLoad){\n\tif(zone_table[zone].enabled)\n\t activemobcount++;\n\tbreak;\n }\n }\n }\n\n\n\n buf = fmt(\"\\n--\\nTotal mobs: %i\\n\\r\") % mcount;\n sb += buf;\n if(mcount>0){\n buf = fmt(\"You have killed %1.2f%c of all mobs.\\n\\r\") %((float)((float)mcount\/(float)activemobcount)*100.0) % '%';\n sb += buf;\n }\n\n if (desc)\n desc->page_string(sb, SHOWNOW_NO, ALLOWREP_YES);\n \n\n return;\n}\n\n\n\nvoid TTrophy::wipe(){\n db->query(\"select id from player where name='%s'\", getMyName());\n \n if(db.fetchRow())\n db->query(\"delete from trophy where player_id=%i\", convertTo<int>(db[\"id\"]));\n\n}\n<commit_msg>typo fix<commit_after>\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\n\/\/ SneezyMUD - All rights reserved, SneezyMUD Coding Team\n\/\/\n\/\/\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n#include \"stdsneezy.h\"\n#include \"cmd_trophy.h\"\n#include \"database.h\"\n\n\nTTrophy::TTrophy(sstring n) :\n db(new TDatabase(DB_SNEEZY)),\n parent(NULL),\n name(n)\n{\n}\n\nTTrophy::TTrophy(TBeing *p) :\n db(new TDatabase(DB_SNEEZY)),\n parent(p),\n name(\"\")\n{\n}\n\nsstring TTrophy::getMyName(){\n if(parent){\n \n if (parent->specials.act & ACT_POLYSELF) {\n return parent->desc->original->getName();\n } else { \n return parent->getName();\n }\n } else {\n \/\/ name should be \"\" if we're uninitialized, so just return it either way\n return name;\n }\n}\n\nvoid TTrophy::setName(sstring n){\n parent=NULL;\n name=n;\n}\n\nvoid TTrophy::addToCount(int vnum, double add){\n if(vnum==-1 || vnum==0 || getMyName()==\"\"){ return; }\n\n int player_id=parent->getPlayerID();\n\n db->query(\"select * from trophy where player_id=%i and mobvnum=%i\",\n\t player_id, vnum);\n if(!db->fetchRow()){\n db->query(\"insert into trophy values (%i, %i, %f)\",\n\t player_id, vnum, add);\n } else {\n db->query(\"update trophy set count=count+%f where player_id=%i and mobvnum=%i\",\n\t add, player_id, vnum);\n }\n\n db->query(\"update trophyplayer set total=total+%f where player_id=%i\",\n\t add, player_id);\n}\n\n\nfloat TTrophy::getCount(int vnum)\n{\n db->query(\"select count from trophy where player_id=%i and mobvnum=%i\",\n\t parent->getPlayerID(), vnum);\n if(db->fetchRow())\n return convertTo<float>((*db)[\"count\"]);\n else \n return 0.0;\n}\n\n\nfloat TTrophy::getExpModVal(float count)\n{\n float min_mod=0.3;\n float max_mod=1.0; \/\/ shouldn't ever be above 1.0\n float free_kills=8; \/\/ how many kills you get before trophy kicks in\n float step_mod=0.5; \/\/ mod per step\n float num_steps=14.0; \/\/ number of steps\n\n float t1, t2, t3, t4, t5;\n\n t1=(double)(count-free_kills);\n t2=step_mod \/ num_steps;\n t3=t1*t2;\n t4=max_mod-t3;\n t5=(double)(max(t4*100, min_mod*100)\/100);\n t5=(double)(min(t5*100, max_mod*100)\/100);\n\n \/\/ vlogf(LOG_PEEL, fmt(\"%f %f %f %f %f\") % t1 % t2 % t3 % t4 % t5);\n\n return t5;\n}\n\n\nconst char *TTrophy::getExpModDescr(float count)\n{\n float f=getExpModVal(count);\n\n return((f == 1.0) ? \"<Y>full<1>\" :\n\t ((f >= 0.90) ? \"<o>much<1>\" :\n\t ((f >= 0.80) ? \"a fair amount of\" :\n\t ((f >= 0.70) ? \"<w>some<1>\" : \"<k>little<1>\"))));\n}\n\n\/\/ this function is a little messy, I apologize\nvoid TBeing::doTrophy(const sstring &arg)\n{\n int mcount=0, vnum, header=0, zcount=0, bottom=0, zcountt=0;\n int zonesearch=0, processrow=1, active_zcount=0;\n bool summary=false;\n float count;\n sstring buf, sb, arg1, arg2;\n unsigned int zone;\n\n if(!isPc()){\n sendTo(\"Mobs can't use this command!\\n\\r\");\n return;\n }\n\n TBeing *per = NULL;\n if (specials.act & ACT_POLYSELF)\n per = desc->original;\n else per = this;\n \n TTrophy trophy(per->getName());\n\n arg1=arg.word(0);\n arg2=arg.word(1);\n\n if(arg1==\"zone\"){\n if(!arg2.empty()){\n arg1=arg2;\n zonesearch=-1;\n } else {\n zonesearch=roomp->getZoneNum();\n }\n } else if(arg1==\"summary\"){\n summary=true;\n }\n\n TDatabase db(DB_SNEEZY);\n db.query(\"select mobvnum, count from trophy where player_id=%i order by mobvnum\", per->getPlayerID());\n\n for (zone = 0; zone < zone_table.size(); zone++) {\n zoneData &zd = zone_table[zone];\n \n while(1){\n if(processrow){\n\tif(!db.fetchRow()){\n\t break;\n\t}\n }\n\n \/\/ sometimes we get an entry of 0 for med mobs I think\n vnum=convertTo<int>(db[\"mobvnum\"]);\n if(vnum==0){\n\tcontinue;\n }\n\n \/\/ this mob doesn't belong to this zone, so break out to the zone loop\n if(vnum>zd.top){\n\tprocessrow=0; \/\/ don't get the next row yet\n\tbreak;\n } else {\n\tprocessrow=1;\n }\n\n int rnum = real_mobile(convertTo<int>(db[\"mobvnum\"]));\n if (rnum < 0) {\n\tvlogf(LOG_BUG, fmt(\"DoTrophy detected bad mobvnum=%d for name='%s'\") % \n\t convertTo<int>(db[\"mobvnum\"]) % per->getName());\n\tcontinue;\n }\n\n if(zonesearch==-1){\n\tif(!isname(arg1, zd.name))\n\t continue;\n } else if(zonesearch>0){\n\tif(zonesearch!=zd.zone_nr)\n\t continue;\n } else if(!summary){\n\tif(!arg1.empty() && !isname(arg1, mob_index[rnum].name))\n\t continue;\n }\n\n \/\/ print the zone header if we haven't already\n \/\/ we do it here, so we can prevent printing headers for empty zones\n if(!header){\n\tbuf = fmt(\"\\n--%s\\n\") % zd.name;\n\tsb += buf; \n\theader=1;\n }\n\n count=convertTo<float>(db[\"count\"]);\n\n if(!summary){\n\tbuf = fmt(\"You will gain %s experience when fighting %s.\\n\\r\") %\n\t\ttrophy.getExpModDescr(count) % mob_index[rnum].short_desc;\n\tsb += buf;\n }\n\n ++mcount;\n ++zcount;\n\n if(mob_index[rnum].doesLoad)\n\t++active_zcount;\n\n processrow=1; \/\/ ok to get the next row\n }\n\n \/\/ we have some mobs for this zone, so do some tallies\n if(header){\n buf = fmt(\"Total mobs: %i\\n\\r\") % zcount;\n sb += buf;\n\n unsigned int objnx;\n for (objnx = 0; objnx < mob_index.size(); objnx++) {\n\tif(mob_index[objnx].virt >= bottom &&\n\t mob_index[objnx].virt <= zd.top &&\n\t mob_index[objnx].doesLoad){\n\t ++zcountt;\n\t}\n }\n\n buf = fmt(\"You have killed %1.2f%c of mobs in this zone.\\n\\r\") %((float)((float)active_zcount\/(float)zcountt)*100.0) % '%';\n sb += buf;\n }\n\n header=zcount=zcountt=active_zcount=0;\n bottom=zd.top+1;\n }\n\n\n\n int activemobcount=0;\n for (unsigned int mobnum = 0; mobnum < mob_index.size(); mobnum++) {\n for (unsigned int zone = 0; zone < zone_table.size(); zone++) {\n if(mob_index[mobnum].virt <= zone_table[zone].top &&\n\t mob_index[mobnum].doesLoad){\n\tif(zone_table[zone].enabled)\n\t activemobcount++;\n\tbreak;\n }\n }\n }\n\n\n\n buf = fmt(\"\\n--\\nTotal mobs: %i\\n\\r\") % mcount;\n sb += buf;\n if(mcount>0){\n buf = fmt(\"You have killed %1.2f%c of all mobs.\\n\\r\") %((float)((float)mcount\/(float)activemobcount)*100.0) % '%';\n sb += buf;\n }\n\n if (desc)\n desc->page_string(sb, SHOWNOW_NO, ALLOWREP_YES);\n \n\n return;\n}\n\n\n\nvoid TTrophy::wipe(){\n db->query(\"select id from player where name='%s'\", getMyName().c_str());\n \n if(db->fetchRow())\n db->query(\"delete from trophy where player_id=%i\", convertTo<int>((*db)[\"id\"]));\n\n}\n<|endoftext|>"} {"text":"<commit_before>#include \"stdsneezy.h\"\n#include \"database.h\"\n\n#include <vector>\n#include <string>\n\n#include \"cgicc\/Cgicc.h\"\n#include \"cgicc\/HTTPHTMLHeader.h\"\n#include \"cgicc\/HTMLClasses.h\"\n\nusing namespace cgicc;\n\n\nvoid print_form()\n{\n cout << \"<form method=post action=\\\"\/low\/objlog.cgi\\\">\" << endl;\n cout << \"Filter on Object Name: <input type=text name=name><br>\" << endl;\n cout << \"Filter on Object VNum: <input type=text name=vnum><br>\" << endl;\n cout << \"<input type=hidden name=start value=1\" << \">\";\n cout << \"<input type=submit><br>\" << endl;\n cout << \"Notes:<br>\" << endl;\n cout << \"1. Leaving both fields blank will list all entries in the log.<br>\" << endl;\n cout << \"2. The object name field should use the % wildcard character. Example: %shield%<br>\" << endl;\n cout << \"3. If both fields are filled in, the script ignores the VNum field.<br>\" << endl;\n}\n\nint main(int argc, char **argv)\n{\n Cgicc cgi;\n TDatabase db(DB_SNEEZYPROD);\n \/\/ TDatabase db(DB_SNEEZYBETA);\n toggleInfo.loadToggles();\n\n form_iterator name = cgi.getElement(\"name\");\n form_iterator vnum = cgi.getElement(\"vnum\");\n form_iterator start = cgi.getElement(\"start\");\n\n if (start == cgi.getElements().end()) {\n cout << HTTPHTMLHeader() << endl;\n cout << html() << head(title(\"Object Load Logs\")) << endl;\n cout << body() << endl;\n print_form();\n cout << body() << endl;\n } else {\n cout << HTTPHTMLHeader() << endl;\n cout << html() << head(title(\"Object Load Logs\")) << endl;\n cout << body() << endl;\n\n print_form();\n cout << \"<table border=1>\" << endl;\n cout << \" <tr>\" << endl;\n cout << \" <th align center>VNum<\/th>\" << endl;\n cout << \" <th align center>Object Name<\/th>\" << endl;\n cout << \" <th align center>Loadtime<\/th>\" << endl;\n cout << \" <th align center>Count<\/th>\" << endl;\n cout << \" <\/tr>\" << endl;\n\n if ((**vnum).empty() && (**name).empty()) {\n db.query(\"select l.vnum, o.name, l.loadtime::timestamp(0), l.objcount from objlog l, obj o where l.vnum = o.vnum order by l.loadtime\");\n } else if ((**vnum).empty()) {\n db.query(\"select l.vnum, o.name, l.loadtime::timestamp(0), l.objcount from objlog l, obj o where l.vnum = o.vnum and o.name like '%s' order by l.loadtime\", (**name).c_str());\n } else if ((**name).empty()) {\n db.query(\"select l.vnum, o.name, l.loadtime::timestamp(0), l.objcount from objlog l, obj o where l.vnum = o.vnum and l.vnum=%i order by l.loadtime\", convertTo<int>(**vnum));\n }\n while(db.fetchRow()){\n cout << \" <tr valign=top>\" << endl;\n cout << \" <td align=right>\" << stripColorCodes(db[\"vnum\"]) << \"<\/td>\" << endl;\n cout << \" <td align=right>\" << stripColorCodes(db[\"name\"]) << \"<\/td>\" << endl;\n cout << \" <td align=right>\" << stripColorCodes(db[\"loadtime\"]) << \"<\/td>\" << endl;\n cout << \" <td align=right>\" << stripColorCodes(db[\"objcount\"]) << \"<\/td>\" << endl;\n cout << \" <\/tr>\" << endl;\n }\n cout << \"<\/table>\" << endl;\n cout << body() << endl;\n }\n cout << html() << endl;\n}\n<commit_msg>Improved the logic flow a bit and reduced the number of repeated lines.<commit_after>#include \"stdsneezy.h\"\n#include \"database.h\"\n\n#include <vector>\n#include <string>\n\n#include \"cgicc\/Cgicc.h\"\n#include \"cgicc\/HTTPHTMLHeader.h\"\n#include \"cgicc\/HTMLClasses.h\"\n\nusing namespace cgicc;\n\n\nvoid print_form()\n{\n cout << \"<form method=post action=\\\"\/low\/objlog.cgi\\\">\" << endl;\n cout << \"Filter on Object Name: <input type=text name=name><br>\" << endl;\n cout << \"Filter on Object VNum: <input type=text name=vnum><br>\" << endl;\n cout << \"<input type=hidden name=start value=1\" << \">\";\n cout << \"<input type=submit><br>\" << endl;\n cout << \"Notes:<br>\" << endl;\n cout << \"1. Leaving both fields blank will list all entries in the log.<br>\" << endl;\n cout << \"2. The object name field should use the % wildcard character. Example: %shield%<br>\" << endl;\n cout << \"3. If both fields are filled in, the script ignores the VNum field.<br>\" << endl;\n}\n\nint main(int argc, char **argv)\n{\n Cgicc cgi;\n string my_query;\n TDatabase db(DB_SNEEZYPROD);\n \/\/ TDatabase db(DB_SNEEZYBETA);\n\n toggleInfo.loadToggles();\n\n form_iterator name = cgi.getElement(\"name\");\n form_iterator vnum = cgi.getElement(\"vnum\");\n form_iterator start = cgi.getElement(\"start\");\n\n if (start == cgi.getElements().end()) {\n cout << HTTPHTMLHeader() << endl;\n cout << html() << head(title(\"Object Load Logs\")) << endl;\n cout << body() << endl;\n print_form();\n cout << body() << endl;\n } else {\n cout << HTTPHTMLHeader() << endl;\n cout << html() << head(title(\"Object Load Logs\")) << endl;\n cout << body() << endl;\n\n print_form();\n cout << \"<table border=1>\" << endl;\n cout << \" <tr>\" << endl;\n cout << \" <th align center>VNum<\/th>\" << endl;\n cout << \" <th align center>Object Name<\/th>\" << endl;\n cout << \" <th align center>Loadtime<\/th>\" << endl;\n cout << \" <th align center>Count<\/th>\" << endl;\n cout << \" <\/tr>\" << endl;\n\n my_query = \"select l.vnum, o.name, l.loadtime::timestamp(0), l.objcount from objlog l, obj o where l.vnum = o.vnum\";\n if ((**vnum).empty() && (**name).empty()) {\n my_query += \" order by l.loadtime\";\n db.query(my_query.c_str());\n } else if ((**name).empty()) {\n my_query += \" and l.vnum=%i order by l.loadtime\";\n db.query(my_query.c_str(), convertTo<int>(**vnum));\n } else {\n my_query += \" and o.name like '%s' order by l.loadtime\";\n db.query(my_query.c_str(), (**name).c_str());\n }\n while(db.fetchRow()){\n cout << \" <tr valign=top>\" << endl;\n cout << \" <td align=right>\" << stripColorCodes(db[\"vnum\"]) << \"<\/td>\" << endl;\n cout << \" <td align=right>\" << stripColorCodes(db[\"name\"]) << \"<\/td>\" << endl;\n cout << \" <td align=right>\" << stripColorCodes(db[\"loadtime\"]) << \"<\/td>\" << endl;\n cout << \" <td align=right>\" << stripColorCodes(db[\"objcount\"]) << \"<\/td>\" << endl;\n cout << \" <\/tr>\" << endl;\n }\n cout << \"<\/table>\" << endl;\n cout << body() << endl;\n }\n cout << html() << endl;\n}\n<|endoftext|>"} {"text":"<commit_before>\/* -*- Mode: C++; tab-width: 4; indent-tabs-mode: nil; c-basic-offset: 4 -*- *\/\n\/*\n * This file is part of the LibreOffice project.\n *\n * This Source Code Form is subject to the terms of the Mozilla Public\n * License, v. 2.0. If a copy of the MPL was not distributed with this\n * file, You can obtain one at http:\/\/mozilla.org\/MPL\/2.0\/.\n *\n * This file incorporates work covered by the following license notice:\n *\n * Licensed to the Apache Software Foundation (ASF) under one or more\n * contributor license agreements. See the NOTICE file distributed\n * with this work for additional information regarding copyright\n * ownership. The ASF licenses this file to you under the Apache\n * License, Version 2.0 (the \"License\"); you may not use this file\n * except in compliance with the License. You may obtain a copy of\n * the License at http:\/\/www.apache.org\/licenses\/LICENSE-2.0 .\n *\/\n\n\n#include \"propacc.hxx\"\n\n#include <basic\/sbstar.hxx>\n#include <basic\/sbuno.hxx>\n#include <sbunoobj.hxx>\n#include <limits.h>\n\nusing com::sun::star::uno::Reference;\nusing namespace com::sun::star;\nusing namespace com::sun::star::uno;\nusing namespace com::sun::star::lang;\nusing namespace com::sun::star::beans;\nusing namespace cppu;\n\nstruct SbCompare_UString_PropertyValue_Impl\n{\n bool operator() (PropertyValue const & lhs, const OUString& rhs)\n {\n return lhs.Name.compareTo(rhs) < 0;\n }\n};\n\nextern \"C\" int SAL_CALL SbCompare_UString_Property_Impl( const void *arg1, const void *arg2 )\n{\n const OUString *pArg1 = (OUString*) arg1;\n const Property *pArg2 = (Property*) arg2;\n return pArg1->compareTo( pArg2->Name );\n}\n\n\n\nSbPropertyValues::SbPropertyValues()\n{\n}\n\n\n\nSbPropertyValues::~SbPropertyValues()\n{\n m_xInfo.clear();\n}\n\n\n\nReference< XPropertySetInfo > SbPropertyValues::getPropertySetInfo(void) throw( RuntimeException, std::exception )\n{\n \/\/ create on demand?\n if (!m_xInfo.is())\n {\n SbPropertySetInfo *pInfo = new SbPropertySetInfo( m_aPropVals );\n m_xInfo.set(pInfo);\n }\n return m_xInfo;\n}\n\n\n\nsize_t SbPropertyValues::GetIndex_Impl( const OUString &rPropName ) const\n{\n SbPropertyValueArr_Impl::const_iterator it = std::lower_bound(\n m_aPropVals.begin(), m_aPropVals.end(), rPropName,\n SbCompare_UString_PropertyValue_Impl() );\n if (it == m_aPropVals.end())\n {\n throw beans::UnknownPropertyException(\n \"Property not found: \" + rPropName,\n const_cast<SbPropertyValues&>(*this));\n }\n return it - m_aPropVals.begin();\n}\n\n\n\nvoid SbPropertyValues::setPropertyValue(\n const OUString& aPropertyName,\n const 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, std::exception)\n{\n size_t const nIndex = GetIndex_Impl( aPropertyName );\n PropertyValue & rPropVal = m_aPropVals[nIndex];\n rPropVal.Value = aValue;\n}\n\n\n\nAny SbPropertyValues::getPropertyValue(\n const OUString& aPropertyName)\n throw(::com::sun::star::beans::UnknownPropertyException,\n ::com::sun::star::lang::WrappedTargetException,\n ::com::sun::star::uno::RuntimeException, std::exception)\n{\n size_t const nIndex = GetIndex_Impl( aPropertyName );\n return m_aPropVals[nIndex].Value;\n}\n\n\n\nvoid SbPropertyValues::addPropertyChangeListener(\n const OUString& aPropertyName,\n const Reference< XPropertyChangeListener >& )\n throw (std::exception)\n{\n (void)aPropertyName;\n}\n\n\n\nvoid SbPropertyValues::removePropertyChangeListener(\n const OUString& aPropertyName,\n const Reference< XPropertyChangeListener >& )\n throw (std::exception)\n{\n (void)aPropertyName;\n}\n\n\n\nvoid SbPropertyValues::addVetoableChangeListener(\n const OUString& aPropertyName,\n const Reference< XVetoableChangeListener >& )\n throw(std::exception)\n{\n (void)aPropertyName;\n}\n\n\n\nvoid SbPropertyValues::removeVetoableChangeListener(\n const OUString& aPropertyName,\n const Reference< XVetoableChangeListener >& )\n throw(std::exception)\n{\n (void)aPropertyName;\n}\n\n\n\nSequence< PropertyValue > SbPropertyValues::getPropertyValues(void) throw (::com::sun::star::uno::RuntimeException, std::exception)\n{\n Sequence<PropertyValue> aRet( m_aPropVals.size() );\n for (size_t n = 0; n < m_aPropVals.size(); ++n)\n aRet.getArray()[n] = m_aPropVals[n];\n return aRet;\n}\n\n\n\nvoid SbPropertyValues::setPropertyValues(const Sequence< PropertyValue >& rPropertyValues )\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, std::exception)\n{\n if ( !m_aPropVals.empty() )\n throw PropertyExistException();\n\n const PropertyValue *pPropVals = rPropertyValues.getConstArray();\n for (sal_Int32 n = 0; n < rPropertyValues.getLength(); ++n)\n {\n PropertyValue *pPropVal = new PropertyValue(pPropVals[n]);\n m_aPropVals.push_back( pPropVal );\n }\n}\n\n\n\/\/PropertySetInfoImpl\n\nPropertySetInfoImpl::PropertySetInfoImpl()\n{\n}\n\nsal_Int32 PropertySetInfoImpl::GetIndex_Impl( const OUString &rPropName ) const\n{\n Property *pP;\n pP = (Property*)\n bsearch( &rPropName, _aProps.getConstArray(), _aProps.getLength(),\n sizeof( Property ),\n SbCompare_UString_Property_Impl );\n return pP ? sal::static_int_cast<sal_Int32>( pP - _aProps.getConstArray() ) : -1;\n}\n\nSequence< Property > PropertySetInfoImpl::getProperties(void) throw()\n{\n return _aProps;\n}\n\nProperty PropertySetInfoImpl::getPropertyByName(const OUString& Name) throw( RuntimeException )\n{\n sal_Int32 nIndex = GetIndex_Impl( Name );\n if( USHRT_MAX != nIndex )\n return _aProps.getConstArray()[ nIndex ];\n return Property();\n}\n\nbool PropertySetInfoImpl::hasPropertyByName(const OUString& Name) throw( RuntimeException )\n{\n sal_Int32 nIndex = GetIndex_Impl( Name );\n return USHRT_MAX != nIndex;\n}\n\n\n\n\nSbPropertySetInfo::SbPropertySetInfo( const SbPropertyValueArr_Impl &rPropVals )\n{\n aImpl._aProps.realloc( rPropVals.size() );\n for ( sal_uInt16 n = 0; n < rPropVals.size(); ++n )\n {\n Property &rProp = aImpl._aProps.getArray()[n];\n const PropertyValue &rPropVal = rPropVals[n];\n rProp.Name = rPropVal.Name;\n rProp.Handle = rPropVal.Handle;\n rProp.Type = getCppuVoidType();\n rProp.Attributes = 0;\n }\n}\n\n\n\nSbPropertySetInfo::~SbPropertySetInfo()\n{\n}\n\n\n\nSequence< Property > SbPropertySetInfo::getProperties(void) throw( RuntimeException, std::exception )\n{\n return aImpl.getProperties();\n}\n\nProperty SbPropertySetInfo::getPropertyByName(const OUString& Name)\n throw( RuntimeException, std::exception )\n{\n return aImpl.getPropertyByName( Name );\n}\n\nsal_Bool SbPropertySetInfo::hasPropertyByName(const OUString& Name)\n throw( RuntimeException, std::exception )\n{\n return aImpl.hasPropertyByName( Name );\n}\n\n\n\nvoid RTL_Impl_CreatePropertySet( StarBASIC* pBasic, SbxArray& rPar, bool bWrite )\n{\n (void)pBasic;\n (void)bWrite;\n\n \/\/ We need at least one parameter\n \/\/ TODO: In this case < 2 is not correct ;-)\n if ( rPar.Count() < 2 )\n {\n StarBASIC::Error( SbERR_BAD_ARGUMENT );\n return;\n }\n\n \/\/ Get class names of struct\n OUString aServiceName( \"stardiv.uno.beans.PropertySet\");\n\n Reference< XInterface > xInterface = (OWeakObject*) new SbPropertyValues();\n\n SbxVariableRef refVar = rPar.Get(0);\n if( xInterface.is() )\n {\n \/\/ Set PropertyValues\n Any aArgAsAny = sbxToUnoValue( rPar.Get(1),\n getCppuType( (Sequence<PropertyValue>*)0 ) );\n Sequence<PropertyValue> *pArg =\n (Sequence<PropertyValue>*) aArgAsAny.getValue();\n Reference< XPropertyAccess > xPropAcc = Reference< XPropertyAccess >::query( xInterface );\n xPropAcc->setPropertyValues( *pArg );\n\n \/\/ Build a SbUnoObject and return it\n Any aAny;\n aAny <<= xInterface;\n SbUnoObjectRef xUnoObj = new SbUnoObject( aServiceName, aAny );\n if( xUnoObj->getUnoAny().getValueType().getTypeClass() != TypeClass_VOID )\n {\n \/\/ Return object\n refVar->PutObject( (SbUnoObject*)xUnoObj );\n return;\n }\n }\n\n \/\/ Object could not be created\n refVar->PutObject( NULL );\n}\n\n\/* vim:set shiftwidth=4 softtabstop=4 expandtab: *\/\n<commit_msg>coverity#706231 Uncaught exception<commit_after>\/* -*- Mode: C++; tab-width: 4; indent-tabs-mode: nil; c-basic-offset: 4 -*- *\/\n\/*\n * This file is part of the LibreOffice project.\n *\n * This Source Code Form is subject to the terms of the Mozilla Public\n * License, v. 2.0. If a copy of the MPL was not distributed with this\n * file, You can obtain one at http:\/\/mozilla.org\/MPL\/2.0\/.\n *\n * This file incorporates work covered by the following license notice:\n *\n * Licensed to the Apache Software Foundation (ASF) under one or more\n * contributor license agreements. See the NOTICE file distributed\n * with this work for additional information regarding copyright\n * ownership. The ASF licenses this file to you under the Apache\n * License, Version 2.0 (the \"License\"); you may not use this file\n * except in compliance with the License. You may obtain a copy of\n * the License at http:\/\/www.apache.org\/licenses\/LICENSE-2.0 .\n *\/\n\n\n#include \"propacc.hxx\"\n\n#include <basic\/sbstar.hxx>\n#include <basic\/sbuno.hxx>\n#include <sbunoobj.hxx>\n#include <limits.h>\n\nusing com::sun::star::uno::Reference;\nusing namespace com::sun::star;\nusing namespace com::sun::star::uno;\nusing namespace com::sun::star::lang;\nusing namespace com::sun::star::beans;\nusing namespace cppu;\n\nstruct SbCompare_UString_PropertyValue_Impl\n{\n bool operator() (PropertyValue const & lhs, const OUString& rhs)\n {\n return lhs.Name.compareTo(rhs) < 0;\n }\n};\n\nextern \"C\" int SAL_CALL SbCompare_UString_Property_Impl( const void *arg1, const void *arg2 )\n{\n const OUString *pArg1 = (OUString*) arg1;\n const Property *pArg2 = (Property*) arg2;\n return pArg1->compareTo( pArg2->Name );\n}\n\n\n\nSbPropertyValues::SbPropertyValues()\n{\n}\n\n\n\nSbPropertyValues::~SbPropertyValues()\n{\n m_xInfo.clear();\n}\n\n\n\nReference< XPropertySetInfo > SbPropertyValues::getPropertySetInfo(void) throw( RuntimeException, std::exception )\n{\n \/\/ create on demand?\n if (!m_xInfo.is())\n {\n SbPropertySetInfo *pInfo = new SbPropertySetInfo( m_aPropVals );\n m_xInfo.set(pInfo);\n }\n return m_xInfo;\n}\n\n\n\nsize_t SbPropertyValues::GetIndex_Impl( const OUString &rPropName ) const\n{\n SbPropertyValueArr_Impl::const_iterator it = std::lower_bound(\n m_aPropVals.begin(), m_aPropVals.end(), rPropName,\n SbCompare_UString_PropertyValue_Impl() );\n if (it == m_aPropVals.end())\n {\n throw beans::UnknownPropertyException(\n \"Property not found: \" + rPropName,\n const_cast<SbPropertyValues&>(*this));\n }\n return it - m_aPropVals.begin();\n}\n\n\n\nvoid SbPropertyValues::setPropertyValue(\n const OUString& aPropertyName,\n const 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, std::exception)\n{\n size_t const nIndex = GetIndex_Impl( aPropertyName );\n PropertyValue & rPropVal = m_aPropVals[nIndex];\n rPropVal.Value = aValue;\n}\n\n\n\nAny SbPropertyValues::getPropertyValue(\n const OUString& aPropertyName)\n throw(::com::sun::star::beans::UnknownPropertyException,\n ::com::sun::star::lang::WrappedTargetException,\n ::com::sun::star::uno::RuntimeException, std::exception)\n{\n size_t const nIndex = GetIndex_Impl( aPropertyName );\n return m_aPropVals[nIndex].Value;\n}\n\n\n\nvoid SbPropertyValues::addPropertyChangeListener(\n const OUString& aPropertyName,\n const Reference< XPropertyChangeListener >& )\n throw (std::exception)\n{\n (void)aPropertyName;\n}\n\n\n\nvoid SbPropertyValues::removePropertyChangeListener(\n const OUString& aPropertyName,\n const Reference< XPropertyChangeListener >& )\n throw (std::exception)\n{\n (void)aPropertyName;\n}\n\n\n\nvoid SbPropertyValues::addVetoableChangeListener(\n const OUString& aPropertyName,\n const Reference< XVetoableChangeListener >& )\n throw(std::exception)\n{\n (void)aPropertyName;\n}\n\n\n\nvoid SbPropertyValues::removeVetoableChangeListener(\n const OUString& aPropertyName,\n const Reference< XVetoableChangeListener >& )\n throw(std::exception)\n{\n (void)aPropertyName;\n}\n\n\n\nSequence< PropertyValue > SbPropertyValues::getPropertyValues(void) throw (::com::sun::star::uno::RuntimeException, std::exception)\n{\n Sequence<PropertyValue> aRet( m_aPropVals.size() );\n for (size_t n = 0; n < m_aPropVals.size(); ++n)\n aRet.getArray()[n] = m_aPropVals[n];\n return aRet;\n}\n\n\n\nvoid SbPropertyValues::setPropertyValues(const Sequence< PropertyValue >& rPropertyValues )\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, std::exception)\n{\n if ( !m_aPropVals.empty() )\n throw IllegalArgumentException();\n\n const PropertyValue *pPropVals = rPropertyValues.getConstArray();\n for (sal_Int32 n = 0; n < rPropertyValues.getLength(); ++n)\n {\n PropertyValue *pPropVal = new PropertyValue(pPropVals[n]);\n m_aPropVals.push_back( pPropVal );\n }\n}\n\n\n\/\/PropertySetInfoImpl\n\nPropertySetInfoImpl::PropertySetInfoImpl()\n{\n}\n\nsal_Int32 PropertySetInfoImpl::GetIndex_Impl( const OUString &rPropName ) const\n{\n Property *pP;\n pP = (Property*)\n bsearch( &rPropName, _aProps.getConstArray(), _aProps.getLength(),\n sizeof( Property ),\n SbCompare_UString_Property_Impl );\n return pP ? sal::static_int_cast<sal_Int32>( pP - _aProps.getConstArray() ) : -1;\n}\n\nSequence< Property > PropertySetInfoImpl::getProperties(void) throw()\n{\n return _aProps;\n}\n\nProperty PropertySetInfoImpl::getPropertyByName(const OUString& Name) throw( RuntimeException )\n{\n sal_Int32 nIndex = GetIndex_Impl( Name );\n if( USHRT_MAX != nIndex )\n return _aProps.getConstArray()[ nIndex ];\n return Property();\n}\n\nbool PropertySetInfoImpl::hasPropertyByName(const OUString& Name) throw( RuntimeException )\n{\n sal_Int32 nIndex = GetIndex_Impl( Name );\n return USHRT_MAX != nIndex;\n}\n\n\n\n\nSbPropertySetInfo::SbPropertySetInfo( const SbPropertyValueArr_Impl &rPropVals )\n{\n aImpl._aProps.realloc( rPropVals.size() );\n for ( sal_uInt16 n = 0; n < rPropVals.size(); ++n )\n {\n Property &rProp = aImpl._aProps.getArray()[n];\n const PropertyValue &rPropVal = rPropVals[n];\n rProp.Name = rPropVal.Name;\n rProp.Handle = rPropVal.Handle;\n rProp.Type = getCppuVoidType();\n rProp.Attributes = 0;\n }\n}\n\n\n\nSbPropertySetInfo::~SbPropertySetInfo()\n{\n}\n\n\n\nSequence< Property > SbPropertySetInfo::getProperties(void) throw( RuntimeException, std::exception )\n{\n return aImpl.getProperties();\n}\n\nProperty SbPropertySetInfo::getPropertyByName(const OUString& Name)\n throw( RuntimeException, std::exception )\n{\n return aImpl.getPropertyByName( Name );\n}\n\nsal_Bool SbPropertySetInfo::hasPropertyByName(const OUString& Name)\n throw( RuntimeException, std::exception )\n{\n return aImpl.hasPropertyByName( Name );\n}\n\n\n\nvoid RTL_Impl_CreatePropertySet( StarBASIC* pBasic, SbxArray& rPar, bool bWrite )\n{\n (void)pBasic;\n (void)bWrite;\n\n \/\/ We need at least one parameter\n \/\/ TODO: In this case < 2 is not correct ;-)\n if ( rPar.Count() < 2 )\n {\n StarBASIC::Error( SbERR_BAD_ARGUMENT );\n return;\n }\n\n \/\/ Get class names of struct\n OUString aServiceName( \"stardiv.uno.beans.PropertySet\");\n\n Reference< XInterface > xInterface = (OWeakObject*) new SbPropertyValues();\n\n SbxVariableRef refVar = rPar.Get(0);\n if( xInterface.is() )\n {\n \/\/ Set PropertyValues\n Any aArgAsAny = sbxToUnoValue( rPar.Get(1),\n getCppuType( (Sequence<PropertyValue>*)0 ) );\n Sequence<PropertyValue> *pArg =\n (Sequence<PropertyValue>*) aArgAsAny.getValue();\n Reference< XPropertyAccess > xPropAcc = Reference< XPropertyAccess >::query( xInterface );\n xPropAcc->setPropertyValues( *pArg );\n\n \/\/ Build a SbUnoObject and return it\n Any aAny;\n aAny <<= xInterface;\n SbUnoObjectRef xUnoObj = new SbUnoObject( aServiceName, aAny );\n if( xUnoObj->getUnoAny().getValueType().getTypeClass() != TypeClass_VOID )\n {\n \/\/ Return object\n refVar->PutObject( (SbUnoObject*)xUnoObj );\n return;\n }\n }\n\n \/\/ Object could not be created\n refVar->PutObject( NULL );\n}\n\n\/* vim:set shiftwidth=4 softtabstop=4 expandtab: *\/\n<|endoftext|>"} {"text":"<commit_before>\/*\n * Copyright (c) 2003-2009, John Wiegley. All rights 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 New Artisans LLC 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 <system.hh>\n\n#include \"pyinterp.h\"\n#include \"pyutils.h\"\n#include \"hooks.h\"\n#include \"journal.h\"\n#include \"xact.h\"\n\nnamespace ledger {\n\nusing namespace boost::python;\n\nnamespace {\n\n account_t& py_account_master(journal_t& journal) {\n return *journal.master;\n }\n\n commodity_pool_t& py_commodity_pool(journal_t& journal) {\n return *journal.commodity_pool;\n }\n\n long xacts_len(journal_t& journal)\n {\n return journal.xacts.size();\n }\n\n xact_t& xacts_getitem(journal_t& journal, long i)\n {\n static long last_index = 0;\n static journal_t * last_journal = NULL;\n static xacts_list::iterator elem;\n\n long len = journal.xacts.size();\n\n if (labs(i) >= len) {\n PyErr_SetString(PyExc_IndexError, _(\"Index out of range\"));\n throw_error_already_set();\n }\n\n if (&journal == last_journal && i == last_index + 1) {\n last_index = i;\n return **++elem;\n }\n\n long x = i < 0 ? len + i : i;\n elem = journal.xacts.begin();\n while (--x >= 0)\n elem++;\n\n last_journal = &journal;\n last_index = i;\n\n return **elem;\n }\n\n long accounts_len(account_t& account)\n {\n return account.accounts.size();\n }\n\n account_t& accounts_getitem(account_t& account, long i)\n {\n static long last_index = 0;\n static account_t * last_account = NULL;\n static accounts_map::iterator elem;\n\n long len = account.accounts.size();\n\n if (labs(i) >= len) {\n PyErr_SetString(PyExc_IndexError, _(\"Index out of range\"));\n throw_error_already_set();\n }\n\n if (&account == last_account && i == last_index + 1) {\n last_index = i;\n return *(*++elem).second;\n }\n\n long x = i < 0 ? len + i : i;\n elem = account.accounts.begin();\n while (--x >= 0)\n elem++;\n\n last_account = &account;\n last_index = i;\n\n return *(*elem).second;\n }\n\n account_t * py_find_account_1(journal_t& journal, const string& name)\n {\n return journal.find_account(name);\n }\n\n account_t * py_find_account_2(journal_t& journal, const string& name,\n\t\t\t\tconst bool auto_create)\n {\n return journal.find_account(name, auto_create);\n }\n\n struct py_xact_finalizer_t : public xact_finalizer_t {\n object pyobj;\n py_xact_finalizer_t() {}\n py_xact_finalizer_t(object obj) : pyobj(obj) {}\n py_xact_finalizer_t(const py_xact_finalizer_t& other)\n : pyobj(other.pyobj) {}\n virtual bool operator()(xact_t& xact, bool post) {\n return call<bool>(pyobj.ptr(), xact, post);\n }\n };\n\n std::list<py_xact_finalizer_t> py_finalizers;\n\n void py_add_xact_finalizer(journal_t& journal, object x)\n {\n py_finalizers.push_back(py_xact_finalizer_t(x));\n journal.add_xact_finalizer(&py_finalizers.back());\n }\n\n void py_remove_xact_finalizer(journal_t& journal, object x)\n {\n for (std::list<py_xact_finalizer_t>::iterator i = py_finalizers.begin();\n\t i != py_finalizers.end();\n\t i++)\n if ((*i).pyobj == x) {\n\tjournal.remove_xact_finalizer(&(*i));\n\tpy_finalizers.erase(i);\n\treturn;\n }\n }\n\n void py_run_xact_finalizers(journal_t& journal, xact_t& xact, bool post)\n {\n journal.xact_finalize_hooks.run_hooks(xact, post);\n }\n\n} \/\/ unnamed namespace\n\nvoid export_journal()\n{\n class_< journal_t::fileinfo_t > (\"FileInfo\")\n .def(init<path>())\n\n .add_property(\"filename\",\n\t\t make_getter(&journal_t::fileinfo_t::filename),\n\t\t make_setter(&journal_t::fileinfo_t::filename))\n .add_property(\"size\",\n\t\t make_getter(&journal_t::fileinfo_t::size),\n\t\t make_setter(&journal_t::fileinfo_t::size))\n .add_property(\"modtime\",\n\t\t make_getter(&journal_t::fileinfo_t::modtime),\n\t\t make_setter(&journal_t::fileinfo_t::modtime))\n .add_property(\"from_stream\",\n\t\t make_getter(&journal_t::fileinfo_t::from_stream),\n\t\t make_setter(&journal_t::fileinfo_t::from_stream))\n ;\n\n class_< journal_t, boost::noncopyable > (\"Journal\")\n .def(init<path>())\n .def(init<string>())\n\n .add_property(\"master\", make_getter(&journal_t::master,\n\t\t\t\t\treturn_internal_reference<>()))\n .add_property(\"bucket\",\n\t\t make_getter(&journal_t::bucket,\n\t\t\t return_internal_reference<>()),\n\t\t make_setter(&journal_t::bucket))\n .add_property(\"was_loaded\", make_getter(&journal_t::was_loaded))\n .add_property(\"commodity_pool\",\n\t\t make_getter(&journal_t::commodity_pool,\n\t\t\t return_internal_reference<>()))\n#if 0\n .add_property(\"xact_finalize_hooks\",\n\t\t make_getter(&journal_t::xact_finalize_hooks),\n\t\t make_setter(&journal_t::xact_finalize_hooks))\n#endif\n\n .def(\"add_account\", &journal_t::add_account)\n .def(\"remove_account\", &journal_t::remove_account)\n\n .def(\"find_account\", py_find_account_1, return_internal_reference<>())\n .def(\"find_account\", py_find_account_2, return_internal_reference<>())\n .def(\"find_account_re\", &journal_t::find_account_re,\n\t return_internal_reference<>())\n\n .def(\"add_xact\", &journal_t::add_xact)\n .def(\"remove_xact\", &journal_t::remove_xact)\n\n .def(\"add_xact_finalizer\", py_add_xact_finalizer)\n .def(\"remove_xact_finalizer\", py_remove_xact_finalizer)\n .def(\"run_xact_finalizers\", py_run_xact_finalizers)\n\n .def(\"__len__\", xacts_len)\n .def(\"__getitem__\", xacts_getitem, return_internal_reference<1>())\n\n .def(\"__iter__\", range<return_internal_reference<> >\n\t (&journal_t::xacts_begin, &journal_t::xacts_end))\n .def(\"xacts\", range<return_internal_reference<> >\n\t (&journal_t::xacts_begin, &journal_t::xacts_end))\n .def(\"auto_xacts\", range<return_internal_reference<> >\n\t (&journal_t::auto_xacts_begin, &journal_t::auto_xacts_end))\n .def(\"period_xacts\", range<return_internal_reference<> >\n\t (&journal_t::period_xacts_begin, &journal_t::period_xacts_end))\n .def(\"sources\", range<return_internal_reference<> >\n\t (&journal_t::sources_begin, &journal_t::sources_end))\n\n .def(\"clear_xdata\", &journal_t::clear_xdata)\n\n .def(\"valid\", &journal_t::valid)\n ;\n}\n\n} \/\/ namespace ledger\n<commit_msg>Expose journal_t::read to Python<commit_after>\/*\n * Copyright (c) 2003-2009, John Wiegley. All rights 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 New Artisans LLC 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 <system.hh>\n\n#include \"pyinterp.h\"\n#include \"pyutils.h\"\n#include \"hooks.h\"\n#include \"journal.h\"\n#include \"xact.h\"\n\nnamespace ledger {\n\nusing namespace boost::python;\n\nnamespace {\n\n account_t& py_account_master(journal_t& journal) {\n return *journal.master;\n }\n\n commodity_pool_t& py_commodity_pool(journal_t& journal) {\n return *journal.commodity_pool;\n }\n\n long xacts_len(journal_t& journal)\n {\n return journal.xacts.size();\n }\n\n xact_t& xacts_getitem(journal_t& journal, long i)\n {\n static long last_index = 0;\n static journal_t * last_journal = NULL;\n static xacts_list::iterator elem;\n\n long len = journal.xacts.size();\n\n if (labs(i) >= len) {\n PyErr_SetString(PyExc_IndexError, _(\"Index out of range\"));\n throw_error_already_set();\n }\n\n if (&journal == last_journal && i == last_index + 1) {\n last_index = i;\n return **++elem;\n }\n\n long x = i < 0 ? len + i : i;\n elem = journal.xacts.begin();\n while (--x >= 0)\n elem++;\n\n last_journal = &journal;\n last_index = i;\n\n return **elem;\n }\n\n long accounts_len(account_t& account)\n {\n return account.accounts.size();\n }\n\n account_t& accounts_getitem(account_t& account, long i)\n {\n static long last_index = 0;\n static account_t * last_account = NULL;\n static accounts_map::iterator elem;\n\n long len = account.accounts.size();\n\n if (labs(i) >= len) {\n PyErr_SetString(PyExc_IndexError, _(\"Index out of range\"));\n throw_error_already_set();\n }\n\n if (&account == last_account && i == last_index + 1) {\n last_index = i;\n return *(*++elem).second;\n }\n\n long x = i < 0 ? len + i : i;\n elem = account.accounts.begin();\n while (--x >= 0)\n elem++;\n\n last_account = &account;\n last_index = i;\n\n return *(*elem).second;\n }\n\n account_t * py_find_account_1(journal_t& journal, const string& name)\n {\n return journal.find_account(name);\n }\n\n account_t * py_find_account_2(journal_t& journal, const string& name,\n\t\t\t\tconst bool auto_create)\n {\n return journal.find_account(name, auto_create);\n }\n\n struct py_xact_finalizer_t : public xact_finalizer_t {\n object pyobj;\n py_xact_finalizer_t() {}\n py_xact_finalizer_t(object obj) : pyobj(obj) {}\n py_xact_finalizer_t(const py_xact_finalizer_t& other)\n : pyobj(other.pyobj) {}\n virtual bool operator()(xact_t& xact, bool post) {\n return call<bool>(pyobj.ptr(), xact, post);\n }\n };\n\n std::list<py_xact_finalizer_t> py_finalizers;\n\n void py_add_xact_finalizer(journal_t& journal, object x)\n {\n py_finalizers.push_back(py_xact_finalizer_t(x));\n journal.add_xact_finalizer(&py_finalizers.back());\n }\n\n void py_remove_xact_finalizer(journal_t& journal, object x)\n {\n for (std::list<py_xact_finalizer_t>::iterator i = py_finalizers.begin();\n\t i != py_finalizers.end();\n\t i++)\n if ((*i).pyobj == x) {\n\tjournal.remove_xact_finalizer(&(*i));\n\tpy_finalizers.erase(i);\n\treturn;\n }\n }\n\n void py_run_xact_finalizers(journal_t& journal, xact_t& xact, bool post)\n {\n journal.xact_finalize_hooks.run_hooks(xact, post);\n }\n\n std::size_t py_read(journal_t& journal, const string& pathname)\n {\n return journal.read(pathname);\n }\n\n} \/\/ unnamed namespace\n\nvoid export_journal()\n{\n class_< journal_t::fileinfo_t > (\"FileInfo\")\n .def(init<path>())\n\n .add_property(\"filename\",\n\t\t make_getter(&journal_t::fileinfo_t::filename),\n\t\t make_setter(&journal_t::fileinfo_t::filename))\n .add_property(\"size\",\n\t\t make_getter(&journal_t::fileinfo_t::size),\n\t\t make_setter(&journal_t::fileinfo_t::size))\n .add_property(\"modtime\",\n\t\t make_getter(&journal_t::fileinfo_t::modtime),\n\t\t make_setter(&journal_t::fileinfo_t::modtime))\n .add_property(\"from_stream\",\n\t\t make_getter(&journal_t::fileinfo_t::from_stream),\n\t\t make_setter(&journal_t::fileinfo_t::from_stream))\n ;\n\n class_< journal_t, boost::noncopyable > (\"Journal\")\n .def(init<path>())\n .def(init<string>())\n\n .add_property(\"master\", make_getter(&journal_t::master,\n\t\t\t\t\treturn_internal_reference<>()))\n .add_property(\"bucket\",\n\t\t make_getter(&journal_t::bucket,\n\t\t\t return_internal_reference<>()),\n\t\t make_setter(&journal_t::bucket))\n .add_property(\"was_loaded\", make_getter(&journal_t::was_loaded))\n .add_property(\"commodity_pool\",\n\t\t make_getter(&journal_t::commodity_pool,\n\t\t\t return_internal_reference<>()))\n#if 0\n .add_property(\"xact_finalize_hooks\",\n\t\t make_getter(&journal_t::xact_finalize_hooks),\n\t\t make_setter(&journal_t::xact_finalize_hooks))\n#endif\n\n .def(\"add_account\", &journal_t::add_account)\n .def(\"remove_account\", &journal_t::remove_account)\n\n .def(\"find_account\", py_find_account_1, return_internal_reference<>())\n .def(\"find_account\", py_find_account_2, return_internal_reference<>())\n .def(\"find_account_re\", &journal_t::find_account_re,\n\t return_internal_reference<>())\n\n .def(\"add_xact\", &journal_t::add_xact)\n .def(\"remove_xact\", &journal_t::remove_xact)\n\n .def(\"add_xact_finalizer\", py_add_xact_finalizer)\n .def(\"remove_xact_finalizer\", py_remove_xact_finalizer)\n .def(\"run_xact_finalizers\", py_run_xact_finalizers)\n\n .def(\"__len__\", xacts_len)\n .def(\"__getitem__\", xacts_getitem, return_internal_reference<1>())\n\n .def(\"__iter__\", range<return_internal_reference<> >\n\t (&journal_t::xacts_begin, &journal_t::xacts_end))\n .def(\"xacts\", range<return_internal_reference<> >\n\t (&journal_t::xacts_begin, &journal_t::xacts_end))\n .def(\"auto_xacts\", range<return_internal_reference<> >\n\t (&journal_t::auto_xacts_begin, &journal_t::auto_xacts_end))\n .def(\"period_xacts\", range<return_internal_reference<> >\n\t (&journal_t::period_xacts_begin, &journal_t::period_xacts_end))\n .def(\"sources\", range<return_internal_reference<> >\n\t (&journal_t::sources_begin, &journal_t::sources_end))\n\n .def(\"read\", py_read)\n\n .def(\"clear_xdata\", &journal_t::clear_xdata)\n\n .def(\"valid\", &journal_t::valid)\n ;\n}\n\n} \/\/ namespace ledger\n<|endoftext|>"} {"text":"<commit_before>\/*\n * Race.cpp\n *\n * Created on: 2009-09-25\n * Author: chudy\n *\/\n\n#include \"Race.h\"\n\n#include <stdlib.h>\n\n#include \"Message.h\"\n#include \"graphics\/Stage.h\"\n#include \"network\/events.h\"\n#include \"network\/Client.h\"\n\nRace::Race(CL_DisplayWindow *p_window, Player *p_player, Client *p_client) :\n\tm_lapsNum(0),\n\tm_localPlayer(p_player),\n\tm_level(),\n\tm_inputLock(false),\n\tm_raceClient(&p_client->getRaceClient()),\n\tm_raceScene(this),\n\tm_displayWindow(p_window)\n{\n\t\/\/ listen for local car status change\n\tm_slots.connect(m_localPlayer.getCar().sigStatusChange(), this, &Race::slotCarStateChangedLocal);\n\t\/\/ and for remote car status change\n\tm_slots.connect(m_raceClient->signalCarStateReceived(), this, &Race::slotCarStateChangedRemote);\n\t\/\/ race start countdown\n\tm_slots.connect(m_raceClient->signalStartCountdown(), this, &Race::slotStartCountdown);\n\t\/\/ countdown ends\n\tm_raceStartTimer.func_expired().set(this, &Race::slotCountdownEnds);\n\t\/\/ car lock\n\tm_slots.connect(m_raceClient->signalLockCar(), this, &Race::slotInputLock);\n\t\/\/ race state\n\tm_slots.connect(m_raceClient->signalRaceStateChanged(), this, &Race::slotRaceStateChanged);\n\n\t\/\/ player join\n\tm_slots.connect(p_client->signalPlayerConnected(), this, &Race::slotPlayerReady);\n\t\/\/ player leave\n\tm_slots.connect(p_client->signalPlayerDisconnected(), this, &Race::slotPlayerLeaving);\n\n}\n\nRace::~Race()\n{\n}\n\nvoid Race::exec()\n{\n\n\tm_level.addCar(&m_localPlayer.getCar());\n\n\tloadAll();\n\n\tunsigned lastTime = CL_System::get_time();\n\n\twhile (true) { \/\/ FIXME: Check when race is finished\n\n\t\tconst unsigned delta = CL_System::get_time() - lastTime;\n\t\tlastTime += delta;\n\n\t\tm_iterationMutex.lock();\n\n\t\tgrabInput(delta);\n\t\tupdateWorld(delta);\n\t\tdrawScene(delta);\n\n\t\tm_iterationMutex.unlock();\n\n\t\t\/\/ Avoid using 100% CPU in the loop:\n\t\tstatic const int MS_60 = 1000 \/ 60;\n\t\tconst int sleepTime = MS_60 - delta;\n\n\t\tif (sleepTime > 0) {\n\t\t\tCL_System::sleep(sleepTime);\n\t\t}\n\n\t}\n}\n\nvoid Race::loadAll()\n{\n\tDebug::out() << \"Loading race...\" << std::endl;\n\tconst unsigned start = CL_System::get_time();\n\n\tCL_GraphicContext gc = m_displayWindow->get_gc();\n\tm_raceScene.load(gc);\n\n\tconst unsigned duration = CL_System::get_time() - start;\n\tDebug::out() << \"Loaded in \" << duration << \" ms\" << std::endl;\n}\n\nvoid Race::grabInput(unsigned delta)\n{\n\tCL_InputDevice keyboard = m_displayWindow->get_ic().get_keyboard();\n\tCar &car = m_localPlayer.getCar();\n\n\tif (keyboard.get_keycode(CL_KEY_ESCAPE)) {\n\t\texit(0); \/\/ TODO: Find better way to exit the race\n\t}\n\n\tif (!m_inputLock) {\n\t\tif (keyboard.get_keycode(CL_KEY_LEFT) && !keyboard.get_keycode(CL_KEY_RIGHT)) {\n\t\t\tcar.setTurn(-1.0f);\n\t\t} else if (keyboard.get_keycode(CL_KEY_RIGHT) && !keyboard.get_keycode(CL_KEY_LEFT)) {\n\t\t\tcar.setTurn(1.0f);\n\t\t} else {\n\t\t\tcar.setTurn(0.0f);\n\t\t}\n\n\t\tif (keyboard.get_keycode(CL_KEY_UP)) {\n\t\t\tcar.setAcceleration(true);\n\t\t} else {\n\t\t\tcar.setAcceleration(false);\n\t\t}\n\n\t\tif (keyboard.get_keycode(CL_KEY_DOWN)) {\n\t\t\tcar.setBrake(true);\n\t\t} else {\n\t\t\tcar.setBrake(false);\n\t\t}\n\t}\n\n#ifndef NDEBUG\n\t\/\/ viewport change\n\tif (keyboard.get_keycode(CL_KEY_ADD)) {\n\t\tconst float scale = m_raceScene.getViewport().getScale();\n\t\tm_raceScene.getViewport().setScale(scale + scale * 0.01f);\n\t}\n\n\tif (keyboard.get_keycode(CL_KEY_SUBTRACT)) {\n\t\tconst float scale = m_raceScene.getViewport().getScale();\n\t\tm_raceScene.getViewport().setScale(scale - scale * 0.01f);\n\t}\n\n\t\/\/ trigger race start\n\tif (keyboard.get_keycode(CL_KEY_BACKSPACE)) {\n\t\tm_raceClient->triggerRaceStart(3);\n\t}\n\n#endif\n}\n\nvoid Race::updateWorld(unsigned p_delta)\n{\n\t\/\/ update all cars\n\tm_localPlayer.getCar().update(p_delta);\n\n\tconst size_t remotePlayersSize = m_remotePlayers.size();\n\n\tfor (size_t i = 0; i < remotePlayersSize; ++i) {\n\t\tm_remotePlayers[i]->getCar().update(p_delta);\n\t}\n\n\t\/\/ update the level\n\tm_level.update(p_delta);\n\n\t\/\/ update race scene\n\tm_raceScene.update(p_delta);\n}\n\nvoid Race::drawScene(unsigned p_delta)\n{\n\tCL_GraphicContext gc = m_displayWindow->get_gc();\n\n\tgc.clear(CL_Colorf::cadetblue);\n\n\tm_raceScene.draw(gc);\n\n\tStage::getDebugLayer()->draw(gc);\n\n\t\/\/ Make the stuff visible:\n\tm_displayWindow->flip();\n\n\t\/\/ Read messages from the windowing system message queue,\n\t\/\/ if any are available:\n\tCL_KeepAlive::process();\n}\n\nvoid Race::slotCarStateChangedRemote(const CL_NetGameEvent& p_event)\n{\n\n\tDebug::out() << \"handling \" << p_event.get_name().c_str() << std::endl;\n\n\t\/\/ first argument will be name of player\n\tconst CL_String name = (CL_String) p_event.get_argument(0);\n\n\tif (name.size() == 0) {\n\t\t\/\/ this is about me!\n\t\tcl_log_event(\"event\", \"setting myself to start position\");\n\t\tm_localPlayer.getCar().applyStatusEvent(p_event, 1);\n\t} else {\n\t\t\/\/ remote player state\n\t\tRacePlayer *racePlayer = findPlayer(name);\n\n\t\tif (racePlayer == NULL) {\n\t\t\tDebug::err() << \"remote player '\" << name.c_str() << \"' not found\" << std::endl;\n\t\t\treturn;\n\t\t}\n\n\t\tCar &car = racePlayer->getCar();\n\t\tcar.applyStatusEvent(p_event, 1);\n\t}\n}\n\nRacePlayer *Race::findPlayer(const CL_String& p_name)\n{\n\tconst size_t remotePlayersSize = m_remotePlayers.size();\n\n\tfor (size_t i = 0; i < remotePlayersSize; ++i) {\n\t\tif (m_remotePlayers[i]->getPlayer().getName() == p_name) {\n\t\t\treturn m_remotePlayers[i];\n\t\t}\n\t}\n\n\treturn NULL;\n}\n\nvoid Race::slotCarStateChangedLocal(Car &p_car)\n{\n\tCL_NetGameEvent event(EVENT_CAR_STATE_CHANGE, m_localPlayer.getPlayer().getName());\n\tp_car.prepareStatusEvent(event);\n\n\tm_raceClient->sendCarStateEvent(event);\n}\n\nvoid Race::slotPlayerReady(Player* p_player)\n{\n\n\tDebug::out() << \"Player '\" << p_player->getName().c_str() << \"' has arrived\" << std::endl;\n\n\tRacePlayer *racePlayer = new RacePlayer(p_player);\n\n\tm_iterationMutex.lock();\n\n\tm_remotePlayers.push_back(racePlayer);\n\tm_level.addCar(&racePlayer->getCar());\n\n\tm_iterationMutex.unlock();\n}\n\nvoid Race::slotPlayerLeaving(Player* p_player)\n{\n\n\tDebug::out() << \"Player '\" << p_player->getName().c_str() << \"' is leaving\" << std::endl;\n\n\tm_iterationMutex.lock();\n\n\tfor (\n\t\tstd::vector<RacePlayer*>::iterator itor = m_remotePlayers.begin();\n\t\titor != m_remotePlayers.end();\n\t\t++itor\n\t) {\n\t\tif (&(*itor)->getPlayer() == p_player) {\n\n\t\t\t\/\/ remove car\n\t\t\tm_level.removeCar(&(*itor)->getCar());\n\n\t\t\tdelete *itor;\n\t\t\tm_remotePlayers.erase(itor);\n\t\t}\n\t}\n\n\tm_iterationMutex.unlock();\n}\n\nvoid Race::slotStartCountdown()\n{\n\tcl_log_event(\"race\", \"starting countdown...\");\n\n\tstatic const unsigned RACE_START_COUNTDOWN_TIME = 3000;\n\n\tm_raceStartTimer.start(RACE_START_COUNTDOWN_TIME, false);\n\tm_raceScene.getUI().displayCountdown();\n}\n\nvoid Race::slotCountdownEnds()\n{\n\tm_inputLock = false;\n}\n\nvoid Race::slotInputLock()\n{\n\tm_inputLock = true;\n}\n\nvoid Race::slotRaceStateChanged(int p_lapsNum)\n{\n\tm_lapsNum = p_lapsNum;\n\tm_localPlayer.getCar().setLap(1);\n}\n<commit_msg>* Added handbrake action to SPACE<commit_after>\/*\n * Race.cpp\n *\n * Created on: 2009-09-25\n * Author: chudy\n *\/\n\n#include \"Race.h\"\n\n#include <stdlib.h>\n\n#include \"Message.h\"\n#include \"graphics\/Stage.h\"\n#include \"network\/events.h\"\n#include \"network\/Client.h\"\n\nRace::Race(CL_DisplayWindow *p_window, Player *p_player, Client *p_client) :\n\tm_lapsNum(0),\n\tm_localPlayer(p_player),\n\tm_level(),\n\tm_inputLock(false),\n\tm_raceClient(&p_client->getRaceClient()),\n\tm_raceScene(this),\n\tm_displayWindow(p_window)\n{\n\t\/\/ listen for local car status change\n\tm_slots.connect(m_localPlayer.getCar().sigStatusChange(), this, &Race::slotCarStateChangedLocal);\n\t\/\/ and for remote car status change\n\tm_slots.connect(m_raceClient->signalCarStateReceived(), this, &Race::slotCarStateChangedRemote);\n\t\/\/ race start countdown\n\tm_slots.connect(m_raceClient->signalStartCountdown(), this, &Race::slotStartCountdown);\n\t\/\/ countdown ends\n\tm_raceStartTimer.func_expired().set(this, &Race::slotCountdownEnds);\n\t\/\/ car lock\n\tm_slots.connect(m_raceClient->signalLockCar(), this, &Race::slotInputLock);\n\t\/\/ race state\n\tm_slots.connect(m_raceClient->signalRaceStateChanged(), this, &Race::slotRaceStateChanged);\n\n\t\/\/ player join\n\tm_slots.connect(p_client->signalPlayerConnected(), this, &Race::slotPlayerReady);\n\t\/\/ player leave\n\tm_slots.connect(p_client->signalPlayerDisconnected(), this, &Race::slotPlayerLeaving);\n\n}\n\nRace::~Race()\n{\n}\n\nvoid Race::exec()\n{\n\n\tm_level.addCar(&m_localPlayer.getCar());\n\n\tloadAll();\n\n\tunsigned lastTime = CL_System::get_time();\n\n\twhile (true) { \/\/ FIXME: Check when race is finished\n\n\t\tconst unsigned delta = CL_System::get_time() - lastTime;\n\t\tlastTime += delta;\n\n\t\tm_iterationMutex.lock();\n\n\t\tgrabInput(delta);\n\t\tupdateWorld(delta);\n\t\tdrawScene(delta);\n\n\t\tm_iterationMutex.unlock();\n\n\t\t\/\/ Avoid using 100% CPU in the loop:\n\t\tstatic const int MS_60 = 1000 \/ 60;\n\t\tconst int sleepTime = MS_60 - delta;\n\n\t\tif (sleepTime > 0) {\n\t\t\tCL_System::sleep(sleepTime);\n\t\t}\n\n\t}\n}\n\nvoid Race::loadAll()\n{\n\tDebug::out() << \"Loading race...\" << std::endl;\n\tconst unsigned start = CL_System::get_time();\n\n\tCL_GraphicContext gc = m_displayWindow->get_gc();\n\tm_raceScene.load(gc);\n\n\tconst unsigned duration = CL_System::get_time() - start;\n\tDebug::out() << \"Loaded in \" << duration << \" ms\" << std::endl;\n}\n\nvoid Race::grabInput(unsigned delta)\n{\n\tCL_InputDevice keyboard = m_displayWindow->get_ic().get_keyboard();\n\tCar &car = m_localPlayer.getCar();\n\n\tif (keyboard.get_keycode(CL_KEY_ESCAPE)) {\n\t\texit(0); \/\/ TODO: Find better way to exit the race\n\t}\n\n\tif (!m_inputLock) {\n\t\tif (keyboard.get_keycode(CL_KEY_LEFT) && !keyboard.get_keycode(CL_KEY_RIGHT)) {\n\t\t\tcar.setTurn(-1.0f);\n\t\t} else if (keyboard.get_keycode(CL_KEY_RIGHT) && !keyboard.get_keycode(CL_KEY_LEFT)) {\n\t\t\tcar.setTurn(1.0f);\n\t\t} else {\n\t\t\tcar.setTurn(0.0f);\n\t\t}\n\n\t\tif (keyboard.get_keycode(CL_KEY_UP)) {\n\t\t\tcar.setAcceleration(true);\n\t\t} else {\n\t\t\tcar.setAcceleration(false);\n\t\t}\n\n\t\tif (keyboard.get_keycode(CL_KEY_DOWN)) {\n\t\t\tcar.setBrake(true);\n\t\t} else {\n\t\t\tcar.setBrake(false);\n\t\t}\n\n\t\tif (keyboard.get_keycode(CL_KEY_SPACE)) {\n\t\t\tcar.setHandbrake(true);\n\t\t} else {\n\t\t\tcar.setHandbrake(false);\n\t\t}\n\t}\n\n#ifndef NDEBUG\n\t\/\/ viewport change\n\tif (keyboard.get_keycode(CL_KEY_ADD)) {\n\t\tconst float scale = m_raceScene.getViewport().getScale();\n\t\tm_raceScene.getViewport().setScale(scale + scale * 0.01f);\n\t}\n\n\tif (keyboard.get_keycode(CL_KEY_SUBTRACT)) {\n\t\tconst float scale = m_raceScene.getViewport().getScale();\n\t\tm_raceScene.getViewport().setScale(scale - scale * 0.01f);\n\t}\n\n\t\/\/ trigger race start\n\tif (keyboard.get_keycode(CL_KEY_BACKSPACE)) {\n\t\tm_raceClient->triggerRaceStart(3);\n\t}\n\n#endif\n}\n\nvoid Race::updateWorld(unsigned p_delta)\n{\n\t\/\/ update all cars\n\tm_localPlayer.getCar().update(p_delta);\n\n\tconst size_t remotePlayersSize = m_remotePlayers.size();\n\n\tfor (size_t i = 0; i < remotePlayersSize; ++i) {\n\t\tm_remotePlayers[i]->getCar().update(p_delta);\n\t}\n\n\t\/\/ update the level\n\tm_level.update(p_delta);\n\n\t\/\/ update race scene\n\tm_raceScene.update(p_delta);\n}\n\nvoid Race::drawScene(unsigned p_delta)\n{\n\tCL_GraphicContext gc = m_displayWindow->get_gc();\n\n\tgc.clear(CL_Colorf::cadetblue);\n\n\tm_raceScene.draw(gc);\n\n\tStage::getDebugLayer()->draw(gc);\n\n\t\/\/ Make the stuff visible:\n\tm_displayWindow->flip();\n\n\t\/\/ Read messages from the windowing system message queue,\n\t\/\/ if any are available:\n\tCL_KeepAlive::process();\n}\n\nvoid Race::slotCarStateChangedRemote(const CL_NetGameEvent& p_event)\n{\n\n\tDebug::out() << \"handling \" << p_event.get_name().c_str() << std::endl;\n\n\t\/\/ first argument will be name of player\n\tconst CL_String name = (CL_String) p_event.get_argument(0);\n\n\tif (name.size() == 0) {\n\t\t\/\/ this is about me!\n\t\tcl_log_event(\"event\", \"setting myself to start position\");\n\t\tm_localPlayer.getCar().applyStatusEvent(p_event, 1);\n\t} else {\n\t\t\/\/ remote player state\n\t\tRacePlayer *racePlayer = findPlayer(name);\n\n\t\tif (racePlayer == NULL) {\n\t\t\tDebug::err() << \"remote player '\" << name.c_str() << \"' not found\" << std::endl;\n\t\t\treturn;\n\t\t}\n\n\t\tCar &car = racePlayer->getCar();\n\t\tcar.applyStatusEvent(p_event, 1);\n\t}\n}\n\nRacePlayer *Race::findPlayer(const CL_String& p_name)\n{\n\tconst size_t remotePlayersSize = m_remotePlayers.size();\n\n\tfor (size_t i = 0; i < remotePlayersSize; ++i) {\n\t\tif (m_remotePlayers[i]->getPlayer().getName() == p_name) {\n\t\t\treturn m_remotePlayers[i];\n\t\t}\n\t}\n\n\treturn NULL;\n}\n\nvoid Race::slotCarStateChangedLocal(Car &p_car)\n{\n\tCL_NetGameEvent event(EVENT_CAR_STATE_CHANGE, m_localPlayer.getPlayer().getName());\n\tp_car.prepareStatusEvent(event);\n\n\tm_raceClient->sendCarStateEvent(event);\n}\n\nvoid Race::slotPlayerReady(Player* p_player)\n{\n\n\tDebug::out() << \"Player '\" << p_player->getName().c_str() << \"' has arrived\" << std::endl;\n\n\tRacePlayer *racePlayer = new RacePlayer(p_player);\n\n\tm_iterationMutex.lock();\n\n\tm_remotePlayers.push_back(racePlayer);\n\tm_level.addCar(&racePlayer->getCar());\n\n\tm_iterationMutex.unlock();\n}\n\nvoid Race::slotPlayerLeaving(Player* p_player)\n{\n\n\tDebug::out() << \"Player '\" << p_player->getName().c_str() << \"' is leaving\" << std::endl;\n\n\tm_iterationMutex.lock();\n\n\tfor (\n\t\tstd::vector<RacePlayer*>::iterator itor = m_remotePlayers.begin();\n\t\titor != m_remotePlayers.end();\n\t\t++itor\n\t) {\n\t\tif (&(*itor)->getPlayer() == p_player) {\n\n\t\t\t\/\/ remove car\n\t\t\tm_level.removeCar(&(*itor)->getCar());\n\n\t\t\tdelete *itor;\n\t\t\tm_remotePlayers.erase(itor);\n\t\t}\n\t}\n\n\tm_iterationMutex.unlock();\n}\n\nvoid Race::slotStartCountdown()\n{\n\tcl_log_event(\"race\", \"starting countdown...\");\n\n\tstatic const unsigned RACE_START_COUNTDOWN_TIME = 3000;\n\n\tm_raceStartTimer.start(RACE_START_COUNTDOWN_TIME, false);\n\tm_raceScene.getUI().displayCountdown();\n}\n\nvoid Race::slotCountdownEnds()\n{\n\tm_inputLock = false;\n}\n\nvoid Race::slotInputLock()\n{\n\tm_inputLock = true;\n}\n\nvoid Race::slotRaceStateChanged(int p_lapsNum)\n{\n\tm_lapsNum = p_lapsNum;\n\tm_localPlayer.getCar().setLap(1);\n}\n<|endoftext|>"} {"text":"<commit_before>\/\/ This file is distributed under the MIT license.\n\/\/ See the LICENSE file for details.\n\n#include <common\/config.h>\n\n#if VSNRAY_COMMON_HAVE_3DCONNEXIONCLIENT\n\n#include <cassert>\n\n#include <3DConnexionClient\/ConnexionClient.h>\n#include <3DConnexionClient\/ConnexionClientAPI.h>\n\n#include \"space_mouse.h\"\n\n\/\/ Import weak so we can later check if the\n\/\/ driver is loaded by checking for NULL\nextern int16_t SetConnexionHandlers(\n ConnexionMessageHandlerProc messageHandler,\n ConnexionAddedHandlerProc addedHandler,\n ConnexionRemovedHandlerProc removedHandler,\n bool useSeparateThread\n ) __attribute__((weak_import));\n\nnamespace visionaray\n{\nnamespace space_mouse\n{\n\nstatic uint16_t client_id = -1;\n\nstatic event_callback event_callbacks[EventTypeCount] = { nullptr };\n\nstatic void message_handler(unsigned product_id, unsigned message_type, void* message_arg)\n{\n switch (message_type)\n {\n case kConnexionMsgDeviceState:\n {\n ConnexionDeviceState* state = reinterpret_cast<ConnexionDeviceState*>(message_arg);\n\n if (state->client == client_id)\n {\n switch (state->command)\n {\n case kConnexionCmdHandleAxis:\n {\n \/\/ Call translation handler\n if (event_callbacks[Translation] != nullptr && (state->axis[0] || state->axis[1] || state->axis[2]))\n {\n event_callbacks[Translation](\n space_mouse_event(Translation, pos(state->axis[0], state->axis[1], state->axis[2]))\n );\n }\n\n \/\/ Call rotation handler\n if (event_callbacks[Rotation] != nullptr && (state->axis[3] || state->axis[4] || state->axis[5]))\n {\n event_callbacks[Rotation](\n space_mouse_event(Rotation, pos(state->axis[3], state->axis[4], state->axis[5]))\n );\n }\n break;\n }\n case kConnexionCmdHandleButtons:\n \/\/ TODO\n break;\n }\n }\n }\n default:\n break;\n }\n}\n\nbool init()\n{\n if (SetConnexionHandlers == 0)\n {\n \/\/ Driver not loaded\n return false;\n }\n\n \/\/ Register callback\n int16_t err = SetConnexionHandlers(message_handler, 0, 0, false);\n\n \/\/ Take space mouse over system-wide\n client_id = RegisterConnexionClient(\n 'vsnr',\n 0,\n kConnexionClientModeTakeOver,\n kConnexionMaskAll\n );\n\n return true;\n}\n\nvoid register_event_callback(event_type type, event_callback cb)\n{\n assert(type < EventTypeCount);\n\n event_callbacks[type] = cb;\n}\n\nvoid cleanup()\n{\n\tif (SetConnexionHandlers != 0)\n\t{\n if (client_id)\n {\n UnregisterConnexionClient(client_id);\n }\n\n CleanupConnexionHandlers();\n\t}\n}\n\n} \/\/ space_mouse\n} \/\/ visionaray\n\n#else\n\n\/\/-------------------------------------------------------------------------------------------------\n\/\/ No 3DconnexionClient API\n\/\/\n\nnamespace visionaray\n{\nnamespace space_mouse\n{\n\nbool init() { return false; }\nvoid register_event_callback(event_type, event_callback) {}\nvoid cleanup() {}\n\n} \/\/ space_mouse\n} \/\/ visionaray\n\n#endif\n<commit_msg>Compile fix<commit_after>\/\/ This file is distributed under the MIT license.\n\/\/ See the LICENSE file for details.\n\n#include <common\/config.h>\n\n#include <cassert>\n\n#if VSNRAY_COMMON_HAVE_3DCONNEXIONCLIENT\n#include <3DConnexionClient\/ConnexionClient.h>\n#include <3DConnexionClient\/ConnexionClientAPI.h>\n#endif\n\n#include \"space_mouse.h\"\n\n#if VSNRAY_COMMON_HAVE_3DCONNEXIONCLIENT\n\n\/\/ Import weak so we can later check if the\n\/\/ driver is loaded by checking for NULL\nextern int16_t SetConnexionHandlers(\n ConnexionMessageHandlerProc messageHandler,\n ConnexionAddedHandlerProc addedHandler,\n ConnexionRemovedHandlerProc removedHandler,\n bool useSeparateThread\n ) __attribute__((weak_import));\n\nnamespace visionaray\n{\nnamespace space_mouse\n{\n\nstatic uint16_t client_id = -1;\n\nstatic event_callback event_callbacks[EventTypeCount] = { nullptr };\n\nstatic void message_handler(unsigned product_id, unsigned message_type, void* message_arg)\n{\n switch (message_type)\n {\n case kConnexionMsgDeviceState:\n {\n ConnexionDeviceState* state = reinterpret_cast<ConnexionDeviceState*>(message_arg);\n\n if (state->client == client_id)\n {\n switch (state->command)\n {\n case kConnexionCmdHandleAxis:\n {\n \/\/ Call translation handler\n if (event_callbacks[Translation] != nullptr && (state->axis[0] || state->axis[1] || state->axis[2]))\n {\n event_callbacks[Translation](\n space_mouse_event(Translation, pos(state->axis[0], state->axis[1], state->axis[2]))\n );\n }\n\n \/\/ Call rotation handler\n if (event_callbacks[Rotation] != nullptr && (state->axis[3] || state->axis[4] || state->axis[5]))\n {\n event_callbacks[Rotation](\n space_mouse_event(Rotation, pos(state->axis[3], state->axis[4], state->axis[5]))\n );\n }\n break;\n }\n case kConnexionCmdHandleButtons:\n \/\/ TODO\n break;\n }\n }\n }\n default:\n break;\n }\n}\n\nbool init()\n{\n if (SetConnexionHandlers == 0)\n {\n \/\/ Driver not loaded\n return false;\n }\n\n \/\/ Register callback\n int16_t err = SetConnexionHandlers(message_handler, 0, 0, false);\n\n \/\/ Take space mouse over system-wide\n client_id = RegisterConnexionClient(\n 'vsnr',\n 0,\n kConnexionClientModeTakeOver,\n kConnexionMaskAll\n );\n\n return true;\n}\n\nvoid register_event_callback(event_type type, event_callback cb)\n{\n assert(type < EventTypeCount);\n\n event_callbacks[type] = cb;\n}\n\nvoid cleanup()\n{\n\tif (SetConnexionHandlers != 0)\n\t{\n if (client_id)\n {\n UnregisterConnexionClient(client_id);\n }\n\n CleanupConnexionHandlers();\n\t}\n}\n\n} \/\/ space_mouse\n} \/\/ visionaray\n\n#else\n\n\/\/-------------------------------------------------------------------------------------------------\n\/\/ No 3DconnexionClient API\n\/\/\n\nnamespace visionaray\n{\nnamespace space_mouse\n{\n\nbool init() { return false; }\nvoid register_event_callback(event_type, event_callback) {}\nvoid cleanup() {}\n\n} \/\/ space_mouse\n} \/\/ visionaray\n\n#endif\n<|endoftext|>"} {"text":"<commit_before><commit_msg>Add failing example from issue 41<commit_after><|endoftext|>"} {"text":"<commit_before>\/* Copyright (C) 2012,2013 IBM Corp.\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.\n * See the 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 * 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA\n *\/\n#include <iostream>\n#include <vector>\n#include <iomanip>\n#include <cassert>\n\nusing namespace std;\n\n\n\/**\n * @class Cube\n * @brief Indexing into a hypercube\n **\/\nclass Cube {\nclass Cube {\nprivate:\n vector<int> dims; \/\/ dims[i] is the size along the i'th diemnsion\n vector<int> prods; \/\/ prods[i] = \\prod_{j=i}^{n-1} dims[i]\n vector<int> data;\n int size;\n\n Cube();\n\npublic:\n Cube(const vector<int>& idims) {\n dims = idims;\n int n = dims.size();\n assert(n > 0);\n\n \n prods.resize(n+1);\n prods[n] = 1;\n for (int i = n-1; i >= 0; i--) {\n assert(dims[i] > 0);\n prods[i] = dims[i]*prods[i+1];\n }\n\n\n size = prods[0];\n data.resize(size);\n for (int i = 0; i < size; i++) data[i] = 0; \n }\n\n bool operator==(const Cube& that) const {\n return dims == that.dims && data == that.data;\n }\n\n bool operator!=(const Cube& that) const {\n return !(*this == that);\n }\n\n const vector<int>& getDims() const { return dims; }\n\n int getSize() const { return size; }\n\n int getNumDims() const { return dims.size(); }\n\n int getDim(int d) const { return dims.at(d); }\n\n int getCoord(int i, int d) const {\n assert(i >= 0 && i < size);\n \n return (i % prods.at(d)) \/ prods.at(d+1); \n }\n\n int addCoord(int i, int d, int offset) const {\n assert(i >= 0 && i < size);\n \n offset = offset % dims.at(d);\n if (offset < 0) offset += dims.at(d);\n\n int i_d = getCoord(i, d);\n int i_d1 = (i_d + offset) % dims.at(d);\n\n int i1 = i + (i_d1 - i_d) * prods.at(d+1);\n\n return i1;\n\n }\n\n int& at(int i) { return data.at(i); }\n\n const int& at(int i) const { return data.at(i); }\n\n};\n\n\n\nCube simpleRotate(const Cube& c, int offset) {\n\n assert(offset >= 0);\n Cube c1(c.getDims());\n\n int size = c.getSize();\n\n for (int i = 0; i < size; i++) {\n c1.at((i+offset)%size) = c.at(i);\n }\n\n return c1;\n\n}\n\nCube rotate1D(const Cube& c, int d, int offset) {\n\n assert(offset >= 0);\n\n Cube c1(c.getDims());\n\n int size = c.getSize();\n\n for (int i = 0; i < size; i++) {\n c1.at(c.addCoord(i, d, offset)) = c.at(i);\n }\n\n return c1;\n\n}\n\nCube operator+(const Cube& c1, const Cube& c2) {\n const vector<int>& dims1 = c1.getDims();\n const vector<int>& dims2 = c2.getDims();\n assert(dims1 == dims2);\n\n Cube c(dims1);\n int size = c.getSize();\n\n for (int i = 0; i < size; i++) \n c.at(i) = c1.at(i) + c2.at(i); \n \n return c;\n}\n\n\nCube operator*(const Cube& c1, const Cube& c2) {\n const vector<int>& dims1 = c1.getDims();\n const vector<int>& dims2 = c2.getDims();\n assert(dims1 == dims2);\n\n Cube c(dims1);\n int size = c.getSize();\n\n for (int i = 0; i < size; i++) \n c.at(i) = c1.at(i) * c2.at(i); \n \n return c;\n}\n\n\nCube operator!(const Cube& c1) {\n const vector<int>& dims1 = c1.getDims();\n\n Cube c(dims1);\n int size = c.getSize();\n\n for (int i = 0; i < size; i++) \n c.at(i) = c1.at(i) == 0 ? 1 : 0;\n \n return c;\n}\n\nCube computeMask(const vector<int>& dims, int d, int k) {\n Cube c(dims);\n int size = c.getSize();\n\n for (int i = 0; i < size; i++) {\n if (c.getCoord(i, d) >= k)\n c.at(i) = 1;\n }\n\n return c;\n}\n\n\nvoid print3D(const Cube& c) {\n const vector<int>& dims = c.getDims();\n assert(dims.size() == 3);\n\n int size = c.getSize();\n\n for (int i = 0; i < size; i++) {\n cout << setw(3) << c.at(i);\n if ((i+1) % dims.at(2) == 0) cout << endl;\n if ((i+1) % (dims.at(1)*dims.at(2)) == 0) cout << endl;\n }\n}\n\n\nCube fancyRotate(const Cube& c, int offset) {\n\n const vector<int>& dims = c.getDims();\n\n assert(offset >= 0);\n offset = offset % c.getSize();\n\n\n Cube c1 = c;\n Cube mask = !Cube(dims); \/\/ the all-1 cube\n\n for (int d = dims.size()-1; d >= 0; d--) {\n int k = c.getCoord(offset, d);\n\n c1 = (rotate1D(c1, d, k)*mask) + (rotate1D(c1, d, k+1)*(!mask));\n mask = computeMask(dims, d, k)*mask + computeMask(dims, d, k+1)*(!mask); \n }\n\n return c1;\n}\n\n\n\nint main()\n{\n vector<int> dims(5);\n dims[0] = 5;\n dims[1] = 4;\n dims[2] = 3;\n dims[3] = 3;\n dims[4] = 4;\n\n\n Cube c(dims);\n int size = c.getSize();\n for (int i = 0; i < size; i++) c.at(i) = i;\n\n bool fail=false;\n for (int offset = 1; offset < size; offset++) {\n Cube c1 = simpleRotate(c, offset);\n Cube c2 = fancyRotate(c, offset);\n if (c1 != c2) { \n\tcout << offset << \": BOO HOO\\n\";\n\tfail = true;\n }\n }\n if (!fail) cout << \"YEE HA\\n\";\n}\n\n<commit_msg>deleted empty lines to much overall coding style<commit_after>\/* Copyright (C) 2012,2013 IBM Corp.\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.\n * See the 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 * 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA\n *\/\n#include <iostream>\n#include <vector>\n#include <iomanip>\n#include <cassert>\n\nusing namespace std;\n\n\n\/**\n * @class Cube\n * @brief Indexing into a hypercube\n **\/\nclass Cube {\nclass Cube {\nprivate:\n vector<int> dims; \/\/ dims[i] is the size along the i'th diemnsion\n vector<int> prods; \/\/ prods[i] = \\prod_{j=i}^{n-1} dims[i]\n vector<int> data;\n int size;\n\n Cube();\n\npublic:\n Cube(const vector<int>& idims) {\n dims = idims;\n int n = dims.size();\n assert(n > 0);\n\n \n prods.resize(n+1);\n prods[n] = 1;\n for (int i = n-1; i >= 0; i--) {\n assert(dims[i] > 0);\n prods[i] = dims[i]*prods[i+1];\n }\n\n\n size = prods[0];\n data.resize(size);\n for (int i = 0; i < size; i++) data[i] = 0; \n }\n\n bool operator==(const Cube& that) const {\n return dims == that.dims && data == that.data;\n }\n\n bool operator!=(const Cube& that) const {\n return !(*this == that);\n }\n\n const vector<int>& getDims() const { return dims; }\n\n int getSize() const { return size; }\n\n int getNumDims() const { return dims.size(); }\n\n int getDim(int d) const { return dims.at(d); }\n\n int getCoord(int i, int d) const {\n assert(i >= 0 && i < size);\n \n return (i % prods.at(d)) \/ prods.at(d+1); \n }\n\n int addCoord(int i, int d, int offset) const {\n assert(i >= 0 && i < size);\n \n offset = offset % dims.at(d);\n if (offset < 0) offset += dims.at(d);\n\n int i_d = getCoord(i, d);\n int i_d1 = (i_d + offset) % dims.at(d);\n\n int i1 = i + (i_d1 - i_d) * prods.at(d+1);\n\n return i1;\n\n }\n\n int& at(int i) { return data.at(i); }\n\n const int& at(int i) const { return data.at(i); }\n\n};\n\n\n\nCube simpleRotate(const Cube& c, int offset) {\n\n assert(offset >= 0);\n Cube c1(c.getDims());\n\n int size = c.getSize();\n\n for (int i = 0; i < size; i++) {\n c1.at((i+offset)%size) = c.at(i);\n }\n\n return c1;\n}\n\nCube rotate1D(const Cube& c, int d, int offset) {\n\n assert(offset >= 0);\n\n Cube c1(c.getDims());\n\n int size = c.getSize();\n\n for (int i = 0; i < size; i++) {\n c1.at(c.addCoord(i, d, offset)) = c.at(i);\n }\n\n return c1;\n}\n\nCube operator+(const Cube& c1, const Cube& c2) {\n const vector<int>& dims1 = c1.getDims();\n const vector<int>& dims2 = c2.getDims();\n assert(dims1 == dims2);\n\n Cube c(dims1);\n int size = c.getSize();\n\n for (int i = 0; i < size; i++) \n c.at(i) = c1.at(i) + c2.at(i); \n \n return c;\n}\n\n\nCube operator*(const Cube& c1, const Cube& c2) {\n const vector<int>& dims1 = c1.getDims();\n const vector<int>& dims2 = c2.getDims();\n assert(dims1 == dims2);\n\n Cube c(dims1);\n int size = c.getSize();\n\n for (int i = 0; i < size; i++) \n c.at(i) = c1.at(i) * c2.at(i); \n \n return c;\n}\n\n\nCube operator!(const Cube& c1) {\n const vector<int>& dims1 = c1.getDims();\n\n Cube c(dims1);\n int size = c.getSize();\n\n for (int i = 0; i < size; i++) \n c.at(i) = c1.at(i) == 0 ? 1 : 0;\n \n return c;\n}\n\nCube computeMask(const vector<int>& dims, int d, int k) {\n Cube c(dims);\n int size = c.getSize();\n\n for (int i = 0; i < size; i++) {\n if (c.getCoord(i, d) >= k)\n c.at(i) = 1;\n }\n\n return c;\n}\n\n\nvoid print3D(const Cube& c) {\n const vector<int>& dims = c.getDims();\n assert(dims.size() == 3);\n\n int size = c.getSize();\n\n for (int i = 0; i < size; i++) {\n cout << setw(3) << c.at(i);\n if ((i+1) % dims.at(2) == 0) cout << endl;\n if ((i+1) % (dims.at(1)*dims.at(2)) == 0) cout << endl;\n }\n}\n\n\nCube fancyRotate(const Cube& c, int offset) {\n\n const vector<int>& dims = c.getDims();\n\n assert(offset >= 0);\n offset = offset % c.getSize();\n\n\n Cube c1 = c;\n Cube mask = !Cube(dims); \/\/ the all-1 cube\n\n for (int d = dims.size()-1; d >= 0; d--) {\n int k = c.getCoord(offset, d);\n\n c1 = (rotate1D(c1, d, k)*mask) + (rotate1D(c1, d, k+1)*(!mask));\n mask = computeMask(dims, d, k)*mask + computeMask(dims, d, k+1)*(!mask); \n }\n\n return c1;\n}\n\n\n\nint main()\n{\n vector<int> dims(5);\n dims[0] = 5;\n dims[1] = 4;\n dims[2] = 3;\n dims[3] = 3;\n dims[4] = 4;\n\n\n Cube c(dims);\n int size = c.getSize();\n for (int i = 0; i < size; i++) c.at(i) = i;\n\n bool fail=false;\n for (int offset = 1; offset < size; offset++) {\n Cube c1 = simpleRotate(c, offset);\n Cube c2 = fancyRotate(c, offset);\n if (c1 != c2) { \n\tcout << offset << \": BOO HOO\\n\";\n\tfail = true;\n }\n }\n if (!fail) cout << \"YEE HA\\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: FullScreenPane.cxx,v $\n *\n * $Revision: 1.4 $\n *\n * This file is part of OpenOffice.org.\n *\n * OpenOffice.org is free software: you can redistribute it and\/or modify\n * it under the terms of the GNU Lesser General Public License version 3\n * only, as published by the Free Software Foundation.\n *\n * OpenOffice.org is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the\n * GNU Lesser General Public License version 3 for more details\n * (a copy is included in the LICENSE file that accompanied this code).\n *\n * You should have received a copy of the GNU Lesser General Public License\n * version 3 along with OpenOffice.org. If not, see\n * <http:\/\/www.openoffice.org\/license.html>\n * for a copy of the LGPLv3 License.\n *\n ************************************************************************\/\n\n#include \"precompiled_sd.hxx\"\n\n#include \"FullScreenPane.hxx\"\n#include \"ViewShellBase.hxx\"\n#include <cppcanvas\/vclfactory.hxx>\n#include <sfx2\/dispatch.hxx>\n#include <vcl\/svapp.hxx>\n#include <vcl\/dialog.hxx>\n#include <toolkit\/helper\/vclunohelper.hxx>\n#include <com\/sun\/star\/beans\/XPropertySet.hpp>\n#include <com\/sun\/star\/frame\/XLayoutManager.hpp>\n#include <com\/sun\/star\/lang\/IllegalArgumentException.hpp>\n#include <com\/sun\/star\/lang\/XInitialization.hpp>\n#include <com\/sun\/star\/util\/URL.hpp>\n\nusing namespace ::com::sun::star;\nusing namespace ::com::sun::star::uno;\nusing namespace ::com::sun::star::drawing::framework;\nusing ::rtl::OUString;\n\n#define A2S(pString) (::rtl::OUString(RTL_CONSTASCII_USTRINGPARAM(pString)))\n\nnamespace sd { namespace framework {\n\nFullScreenPane::FullScreenPane (\n const Reference<XComponentContext>& rxComponentContext,\n const Reference<XResourceId>& rxPaneId,\n const ::Window* pViewShellWindow)\n : FrameWindowPane(rxPaneId,NULL),\n mxComponentContext(rxComponentContext),\n mpWorkWindow(NULL)\n{\n ::Window* pParent = NULL;\n mpWorkWindow.reset(new WorkWindow(\n pParent,\n 0)); \/\/ For debugging (non-fullscreen) use WB_BORDER | WB_MOVEABLE | WB_SIZEABLE));\n\n if ( ! rxPaneId.is())\n throw lang::IllegalArgumentException();\n\n sal_Int32 nScreenNumber = 1;\n ExtractArguments(rxPaneId, nScreenNumber);\n\n if (mpWorkWindow.get() == NULL)\n return;\n\n \/\/ Create a new top-leve window that is displayed full screen.\n mpWorkWindow->ShowFullScreenMode(TRUE, nScreenNumber);\n \/\/ For debugging (non-fullscreen) use mpWorkWindow->SetScreenNumber(nScreenNumber);\n mpWorkWindow->SetMenuBarMode(MENUBAR_MODE_HIDE);\n mpWorkWindow->SetBorderStyle(WINDOW_BORDER_REMOVEBORDER);\n mpWorkWindow->SetBackground(Wallpaper());\n \/\/ Don't show the window right now in order to allow the setting of an\n \/\/ accessibility object: accessibility objects are typically\n \/\/ requested by AT-tools when the window is shown. Chaning it\n \/\/ afterwards may or may not work.\n\n \/\/ Add resize listener at the work window.\n Link aWindowEventHandler (LINK(this, FullScreenPane, WindowEventHandler));\n mpWorkWindow->AddEventListener(aWindowEventHandler);\n\n \/\/ Set title and icon of the new window to those of the current window\n \/\/ of the view shell.\n if (pViewShellWindow != NULL)\n {\n const SystemWindow* pSystemWindow = pViewShellWindow->GetSystemWindow();\n mpWorkWindow->SetText(pSystemWindow->GetText());\n mpWorkWindow->SetIcon(pSystemWindow->GetIcon());\n }\n\n \/\/ For some reason the VCL canvas can not paint into a WorkWindow.\n \/\/ Therefore a child window is created that covers the WorkWindow\n \/\/ completely.\n mpWindow = new ::Window(mpWorkWindow.get());\n mpWindow->SetPosSizePixel(Point(0,0), mpWorkWindow->GetSizePixel());\n mpWindow->SetBackground(Wallpaper());\n mxWindow = VCLUnoHelper::GetInterface(mpWindow);\n\n \/\/ Create the canvas.\n mxCanvas = CreateCanvas();\n\n mpWindow->GrabFocus();\n}\n\n\n\n\nFullScreenPane::~FullScreenPane (void) throw()\n{\n}\n\n\n\n\nvoid SAL_CALL FullScreenPane::disposing (void)\n{\n \/\/ We have created the window pointed to by mpWindow, we delete it.\n if (mpWindow != NULL)\n {\n delete mpWindow;\n }\n\n if (mpWorkWindow.get() != NULL)\n {\n Link aWindowEventHandler (LINK(this, FullScreenPane, WindowEventHandler));\n mpWorkWindow->RemoveEventListener(aWindowEventHandler);\n mpWorkWindow.reset();\n }\n\n\n FrameWindowPane::disposing();\n}\n\n\n\n\n\/\/----- XPane -----------------------------------------------------------------\n\nsal_Bool SAL_CALL FullScreenPane::isVisible (void)\n throw (RuntimeException)\n{\n ThrowIfDisposed();\n\n if (mpWindow != NULL)\n return mpWindow->IsReallyVisible();\n else\n return false;\n}\n\n\n\n\nvoid SAL_CALL FullScreenPane::setVisible (const sal_Bool bIsVisible)\n throw (RuntimeException)\n{\n ThrowIfDisposed();\n\n if (mpWindow != NULL)\n mpWindow->Show(bIsVisible);\n if (mpWorkWindow != NULL)\n mpWorkWindow->Show(bIsVisible);\n}\n\n\n\n\nReference<accessibility::XAccessible> SAL_CALL FullScreenPane::getAccessible (void)\n throw (RuntimeException)\n{\n ThrowIfDisposed();\n\n if (mpWorkWindow != NULL)\n return mpWorkWindow->GetAccessible(FALSE);\n else\n return NULL;\n}\n\n\n\n\nvoid SAL_CALL FullScreenPane::setAccessible (\n const Reference<accessibility::XAccessible>& rxAccessible)\n throw (RuntimeException)\n{\n ThrowIfDisposed();\n\n if (mpWindow != NULL)\n {\n Reference<lang::XInitialization> xInitializable (rxAccessible, UNO_QUERY);\n if (xInitializable.is())\n {\n ::Window* pParentWindow = mpWindow->GetParent();\n Reference<accessibility::XAccessible> xAccessibleParent;\n if (pParentWindow != NULL)\n xAccessibleParent = pParentWindow->GetAccessible();\n Sequence<Any> aArguments (1);\n aArguments[0] = Any(xAccessibleParent);\n xInitializable->initialize(aArguments);\n }\n GetWindow()->SetAccessible(rxAccessible);\n }\n}\n\n\n\n\n\/\/-----------------------------------------------------------------------------\n\nIMPL_LINK(FullScreenPane, WindowEventHandler, VclWindowEvent*, pEvent)\n{\n switch (pEvent->GetId())\n {\n case VCLEVENT_WINDOW_RESIZE:\n GetWindow()->SetPosPixel(Point(0,0));\n GetWindow()->SetSizePixel(Size(\n mpWorkWindow->GetSizePixel().Width(),\n mpWorkWindow->GetSizePixel().Height()));\n break;\n\n case VCLEVENT_OBJECT_DYING:\n mpWorkWindow.reset();\n break;\n }\n return 1;\n}\n\n\n\n\nReference<rendering::XCanvas> FullScreenPane::CreateCanvas (void)\n throw (RuntimeException)\n{\n ::Window* pWindow = VCLUnoHelper::GetWindow(mxWindow);\n if (pWindow != NULL)\n {\n Sequence<Any> aArg (5);\n\n \/\/ common: first any is VCL pointer to window (for VCL canvas)\n aArg[0] = makeAny(reinterpret_cast<sal_Int64>(pWindow));\n aArg[1] = Any();\n aArg[2] = makeAny(::com::sun::star::awt::Rectangle());\n aArg[3] = makeAny(sal_False);\n aArg[4] = makeAny(mxWindow);\n\n Reference<lang::XMultiServiceFactory> xFactory (\n mxComponentContext->getServiceManager(), UNO_QUERY_THROW);\n return Reference<rendering::XCanvas>(\n xFactory->createInstanceWithArguments(\n OUString::createFromAscii(\"com.sun.star.rendering.SpriteCanvas.VCL\"),\n aArg),\n UNO_QUERY);\n }\n else\n throw RuntimeException();\n}\n\n\n\n\nvoid FullScreenPane::ExtractArguments (\n const Reference<XResourceId>& rxPaneId,\n sal_Int32& rnScreenNumberReturnValue)\n{\n \/\/ Extract arguments from the resource URL.\n const util::URL aURL = rxPaneId->getFullResourceURL();\n sal_Int32 nIndex = 0;\n while (nIndex >= 0)\n {\n const OUString aToken = aURL.Arguments.getToken(0, '&', nIndex);\n if (aToken.getLength() > 0)\n {\n \/\/ Split at the first '='.\n const sal_Int32 nAssign = aToken.indexOf('=');\n const OUString sKey = aToken.copy(0, nAssign);\n const OUString sValue = aToken.copy(nAssign+1);\n\n if (sKey.compareToAscii(\"ScreenNumber\") == 0)\n {\n rnScreenNumberReturnValue = sValue.toInt32();\n }\n }\n }\n}\n\n\n} } \/\/ end of namespace sd::framework\n<commit_msg>#i10000#<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: FullScreenPane.cxx,v $\n *\n * $Revision: 1.4 $\n *\n * This file is part of OpenOffice.org.\n *\n * OpenOffice.org is free software: you can redistribute it and\/or modify\n * it under the terms of the GNU Lesser General Public License version 3\n * only, as published by the Free Software Foundation.\n *\n * OpenOffice.org is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the\n * GNU Lesser General Public License version 3 for more details\n * (a copy is included in the LICENSE file that accompanied this code).\n *\n * You should have received a copy of the GNU Lesser General Public License\n * version 3 along with OpenOffice.org. If not, see\n * <http:\/\/www.openoffice.org\/license.html>\n * for a copy of the LGPLv3 License.\n *\n ************************************************************************\/\n\n#include \"precompiled_sd.hxx\"\n\n#include \"FullScreenPane.hxx\"\n#include \"ViewShellBase.hxx\"\n#include <cppcanvas\/vclfactory.hxx>\n#include <sfx2\/dispatch.hxx>\n#include <vcl\/wrkwin.hxx>\n#include <vcl\/svapp.hxx>\n#include <vcl\/dialog.hxx>\n#include <toolkit\/helper\/vclunohelper.hxx>\n#include <com\/sun\/star\/beans\/XPropertySet.hpp>\n#include <com\/sun\/star\/frame\/XLayoutManager.hpp>\n#include <com\/sun\/star\/lang\/IllegalArgumentException.hpp>\n#include <com\/sun\/star\/lang\/XInitialization.hpp>\n#include <com\/sun\/star\/util\/URL.hpp>\n\nusing namespace ::com::sun::star;\nusing namespace ::com::sun::star::uno;\nusing namespace ::com::sun::star::drawing::framework;\nusing ::rtl::OUString;\n\n#define A2S(pString) (::rtl::OUString(RTL_CONSTASCII_USTRINGPARAM(pString)))\n\nnamespace sd { namespace framework {\n\nFullScreenPane::FullScreenPane (\n const Reference<XComponentContext>& rxComponentContext,\n const Reference<XResourceId>& rxPaneId,\n const ::Window* pViewShellWindow)\n : FrameWindowPane(rxPaneId,NULL),\n mxComponentContext(rxComponentContext),\n mpWorkWindow(NULL)\n{\n ::Window* pParent = NULL;\n mpWorkWindow.reset(new WorkWindow(\n pParent,\n 0)); \/\/ For debugging (non-fullscreen) use WB_BORDER | WB_MOVEABLE | WB_SIZEABLE));\n\n if ( ! rxPaneId.is())\n throw lang::IllegalArgumentException();\n\n sal_Int32 nScreenNumber = 1;\n ExtractArguments(rxPaneId, nScreenNumber);\n\n if (mpWorkWindow.get() == NULL)\n return;\n\n \/\/ Create a new top-leve window that is displayed full screen.\n mpWorkWindow->ShowFullScreenMode(TRUE, nScreenNumber);\n \/\/ For debugging (non-fullscreen) use mpWorkWindow->SetScreenNumber(nScreenNumber);\n mpWorkWindow->SetMenuBarMode(MENUBAR_MODE_HIDE);\n mpWorkWindow->SetBorderStyle(WINDOW_BORDER_REMOVEBORDER);\n mpWorkWindow->SetBackground(Wallpaper());\n \/\/ Don't show the window right now in order to allow the setting of an\n \/\/ accessibility object: accessibility objects are typically\n \/\/ requested by AT-tools when the window is shown. Chaning it\n \/\/ afterwards may or may not work.\n\n \/\/ Add resize listener at the work window.\n Link aWindowEventHandler (LINK(this, FullScreenPane, WindowEventHandler));\n mpWorkWindow->AddEventListener(aWindowEventHandler);\n\n \/\/ Set title and icon of the new window to those of the current window\n \/\/ of the view shell.\n if (pViewShellWindow != NULL)\n {\n const SystemWindow* pSystemWindow = pViewShellWindow->GetSystemWindow();\n mpWorkWindow->SetText(pSystemWindow->GetText());\n mpWorkWindow->SetIcon(pSystemWindow->GetIcon());\n }\n\n \/\/ For some reason the VCL canvas can not paint into a WorkWindow.\n \/\/ Therefore a child window is created that covers the WorkWindow\n \/\/ completely.\n mpWindow = new ::Window(mpWorkWindow.get());\n mpWindow->SetPosSizePixel(Point(0,0), mpWorkWindow->GetSizePixel());\n mpWindow->SetBackground(Wallpaper());\n mxWindow = VCLUnoHelper::GetInterface(mpWindow);\n\n \/\/ Create the canvas.\n mxCanvas = CreateCanvas();\n\n mpWindow->GrabFocus();\n}\n\n\n\n\nFullScreenPane::~FullScreenPane (void) throw()\n{\n}\n\n\n\n\nvoid SAL_CALL FullScreenPane::disposing (void)\n{\n \/\/ We have created the window pointed to by mpWindow, we delete it.\n if (mpWindow != NULL)\n {\n delete mpWindow;\n }\n\n if (mpWorkWindow.get() != NULL)\n {\n Link aWindowEventHandler (LINK(this, FullScreenPane, WindowEventHandler));\n mpWorkWindow->RemoveEventListener(aWindowEventHandler);\n mpWorkWindow.reset();\n }\n\n\n FrameWindowPane::disposing();\n}\n\n\n\n\n\/\/----- XPane -----------------------------------------------------------------\n\nsal_Bool SAL_CALL FullScreenPane::isVisible (void)\n throw (RuntimeException)\n{\n ThrowIfDisposed();\n\n if (mpWindow != NULL)\n return mpWindow->IsReallyVisible();\n else\n return false;\n}\n\n\n\n\nvoid SAL_CALL FullScreenPane::setVisible (const sal_Bool bIsVisible)\n throw (RuntimeException)\n{\n ThrowIfDisposed();\n\n if (mpWindow != NULL)\n mpWindow->Show(bIsVisible);\n if (mpWorkWindow != NULL)\n mpWorkWindow->Show(bIsVisible);\n}\n\n\n\n\nReference<accessibility::XAccessible> SAL_CALL FullScreenPane::getAccessible (void)\n throw (RuntimeException)\n{\n ThrowIfDisposed();\n\n if (mpWorkWindow != NULL)\n return mpWorkWindow->GetAccessible(FALSE);\n else\n return NULL;\n}\n\n\n\n\nvoid SAL_CALL FullScreenPane::setAccessible (\n const Reference<accessibility::XAccessible>& rxAccessible)\n throw (RuntimeException)\n{\n ThrowIfDisposed();\n\n if (mpWindow != NULL)\n {\n Reference<lang::XInitialization> xInitializable (rxAccessible, UNO_QUERY);\n if (xInitializable.is())\n {\n ::Window* pParentWindow = mpWindow->GetParent();\n Reference<accessibility::XAccessible> xAccessibleParent;\n if (pParentWindow != NULL)\n xAccessibleParent = pParentWindow->GetAccessible();\n Sequence<Any> aArguments (1);\n aArguments[0] = Any(xAccessibleParent);\n xInitializable->initialize(aArguments);\n }\n GetWindow()->SetAccessible(rxAccessible);\n }\n}\n\n\n\n\n\/\/-----------------------------------------------------------------------------\n\nIMPL_LINK(FullScreenPane, WindowEventHandler, VclWindowEvent*, pEvent)\n{\n switch (pEvent->GetId())\n {\n case VCLEVENT_WINDOW_RESIZE:\n GetWindow()->SetPosPixel(Point(0,0));\n GetWindow()->SetSizePixel(Size(\n mpWorkWindow->GetSizePixel().Width(),\n mpWorkWindow->GetSizePixel().Height()));\n break;\n\n case VCLEVENT_OBJECT_DYING:\n mpWorkWindow.reset();\n break;\n }\n return 1;\n}\n\n\n\n\nReference<rendering::XCanvas> FullScreenPane::CreateCanvas (void)\n throw (RuntimeException)\n{\n ::Window* pWindow = VCLUnoHelper::GetWindow(mxWindow);\n if (pWindow != NULL)\n {\n Sequence<Any> aArg (5);\n\n \/\/ common: first any is VCL pointer to window (for VCL canvas)\n aArg[0] = makeAny(reinterpret_cast<sal_Int64>(pWindow));\n aArg[1] = Any();\n aArg[2] = makeAny(::com::sun::star::awt::Rectangle());\n aArg[3] = makeAny(sal_False);\n aArg[4] = makeAny(mxWindow);\n\n Reference<lang::XMultiServiceFactory> xFactory (\n mxComponentContext->getServiceManager(), UNO_QUERY_THROW);\n return Reference<rendering::XCanvas>(\n xFactory->createInstanceWithArguments(\n OUString::createFromAscii(\"com.sun.star.rendering.SpriteCanvas.VCL\"),\n aArg),\n UNO_QUERY);\n }\n else\n throw RuntimeException();\n}\n\n\n\n\nvoid FullScreenPane::ExtractArguments (\n const Reference<XResourceId>& rxPaneId,\n sal_Int32& rnScreenNumberReturnValue)\n{\n \/\/ Extract arguments from the resource URL.\n const util::URL aURL = rxPaneId->getFullResourceURL();\n sal_Int32 nIndex = 0;\n while (nIndex >= 0)\n {\n const OUString aToken = aURL.Arguments.getToken(0, '&', nIndex);\n if (aToken.getLength() > 0)\n {\n \/\/ Split at the first '='.\n const sal_Int32 nAssign = aToken.indexOf('=');\n const OUString sKey = aToken.copy(0, nAssign);\n const OUString sValue = aToken.copy(nAssign+1);\n\n if (sKey.compareToAscii(\"ScreenNumber\") == 0)\n {\n rnScreenNumberReturnValue = sValue.toInt32();\n }\n }\n }\n}\n\n\n} } \/\/ end of namespace sd::framework\n<|endoftext|>"} {"text":"<commit_before>\/**************************************************************************\n *\n * Copyright 2011 Jose Fonseca\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#include <assert.h>\n#include <stdlib.h>\n\n#include \"trace_file.hpp\"\n#include \"trace_snappyfile.hpp\"\n#include \"trace_parser.hpp\"\n\n\n#define TRACE_VERBOSE 0\n\n\nnamespace Trace {\n\n\nParser::Parser() {\n file = NULL;\n next_call_no = 0;\n version = 0;\n}\n\n\nParser::~Parser() {\n close();\n}\n\n\nbool Parser::open(const char *filename) {\n assert(!file);\n if (File::isZLibCompressed(filename)) {\n file = new ZLibFile;\n } else {\n file = new SnappyFile;\n }\n\n if (!file->open(filename, File::Read)) {\n return false;\n }\n\n version = read_uint();\n if (version > TRACE_VERSION) {\n std::cerr << \"error: unsupported trace format version \" << version << \"\\n\";\n return false;\n }\n\n return true;\n}\n\ntemplate <typename Iter>\ninline void\ndeleteAll(Iter begin, Iter end)\n{\n while (begin != end) {\n delete *begin;\n ++begin;\n }\n}\n\ntemplate <typename Container>\ninline void\ndeleteAll(const Container &c)\n{\n deleteAll(c.begin(), c.end());\n}\n\nvoid Parser::close(void) {\n if (file) {\n file->close();\n delete file;\n file = NULL;\n }\n\n deleteAll(calls);\n deleteAll(functions);\n deleteAll(structs);\n deleteAll(enums);\n deleteAll(bitmasks);\n}\n\n\nCall *Parser::parse_call(void) {\n do {\n int c = read_byte();\n switch(c) {\n case Trace::EVENT_ENTER:\n parse_enter();\n break;\n case Trace::EVENT_LEAVE:\n return parse_leave();\n default:\n std::cerr << \"error: unknown event \" << c << \"\\n\";\n exit(1);\n case -1:\n for (CallList::iterator it = calls.begin(); it != calls.end(); ++it) {\n std::cerr << \"warning: incomplete call \" << (*it)->name() << \"\\n\";\n std::cerr << **it << \"\\n\";\n }\n return NULL;\n }\n } while(true);\n}\n\n\n\/**\n * Helper function to lookup an ID in a vector, resizing the vector if it doesn't fit.\n *\/\ntemplate<class T>\nT *lookup(std::vector<T *> &map, size_t index) {\n if (index >= map.size()) {\n map.resize(index + 1);\n return NULL;\n } else {\n return map[index];\n }\n}\n\n\nvoid Parser::parse_enter(void) {\n size_t id = read_uint();\n\n FunctionSig *sig = lookup(functions, id);\n if (!sig) {\n sig = new FunctionSig;\n sig->id = id;\n sig->name = read_string();\n sig->num_args = read_uint();\n const char **arg_names = new const char *[sig->num_args];\n for (unsigned i = 0; i < sig->num_args; ++i) {\n arg_names[i] = read_string();\n }\n sig->arg_names = arg_names;\n functions[id] = sig;\n }\n assert(sig);\n\n Call *call = new Call(sig);\n call->no = next_call_no++;\n\n if (parse_call_details(call)) {\n calls.push_back(call);\n } else {\n delete call;\n }\n}\n\n\nCall *Parser::parse_leave(void) {\n unsigned call_no = read_uint();\n Call *call = NULL;\n for (CallList::iterator it = calls.begin(); it != calls.end(); ++it) {\n if ((*it)->no == call_no) {\n call = *it;\n calls.erase(it);\n break;\n }\n }\n if (!call) {\n return NULL;\n }\n\n if (parse_call_details(call)) {\n return call;\n } else {\n delete call;\n return NULL;\n }\n}\n\n\nbool Parser::parse_call_details(Call *call) {\n do {\n int c = read_byte();\n switch(c) {\n case Trace::CALL_END:\n return true;\n case Trace::CALL_ARG:\n parse_arg(call);\n break;\n case Trace::CALL_RET:\n call->ret = parse_value();\n break;\n default:\n std::cerr << \"error: (\"<<call->name()<< \") unknown call detail \"\n << c << \"\\n\";\n exit(1);\n case -1:\n return false;\n }\n } while(true);\n}\n\n\nvoid Parser::parse_arg(Call *call) {\n unsigned index = read_uint();\n Value *value = parse_value();\n if (index >= call->args.size()) {\n call->args.resize(index + 1);\n }\n call->args[index] = value;\n}\n\n\nValue *Parser::parse_value(void) {\n int c;\n Value *value;\n c = read_byte();\n switch(c) {\n case Trace::TYPE_NULL:\n value = new Null;\n break;\n case Trace::TYPE_FALSE:\n value = new Bool(false);\n break;\n case Trace::TYPE_TRUE:\n value = new Bool(true);\n break;\n case Trace::TYPE_SINT:\n value = parse_sint();\n break;\n case Trace::TYPE_UINT:\n value = parse_uint();\n break;\n case Trace::TYPE_FLOAT:\n value = parse_float();\n break;\n case Trace::TYPE_DOUBLE:\n value = parse_double();\n break;\n case Trace::TYPE_STRING:\n value = parse_string();\n break;\n case Trace::TYPE_ENUM:\n value = parse_enum();\n break;\n case Trace::TYPE_BITMASK:\n value = parse_bitmask();\n break;\n case Trace::TYPE_ARRAY:\n value = parse_array();\n break;\n case Trace::TYPE_STRUCT:\n value = parse_struct();\n break;\n case Trace::TYPE_BLOB:\n value = parse_blob();\n break;\n case Trace::TYPE_OPAQUE:\n value = parse_opaque();\n break;\n default:\n std::cerr << \"error: unknown type \" << c << \"\\n\";\n exit(1);\n case -1:\n value = NULL;\n break;\n }\n#if TRACE_VERBOSE\n if (value) {\n std::cerr << \"\\tVALUE \" << value << \"\\n\";\n }\n#endif\n return value;\n}\n\n\nValue *Parser::parse_sint() {\n return new SInt(-(signed long long)read_uint());\n}\n\n\nValue *Parser::parse_uint() {\n return new UInt(read_uint());\n}\n\n\nValue *Parser::parse_float() {\n float value;\n file->read(&value, sizeof value);\n return new Float(value);\n}\n\n\nValue *Parser::parse_double() {\n double value;\n file->read(&value, sizeof value);\n return new Float(value);\n}\n\n\nValue *Parser::parse_string() {\n return new String(read_string());\n}\n\n\nValue *Parser::parse_enum() {\n size_t id = read_uint();\n EnumSig *sig = lookup(enums, id);\n if (!sig) {\n sig = new EnumSig;\n sig->id = id;\n sig->name = read_string();\n Value *value = parse_value();\n sig->value = value->toSInt();\n delete value;\n enums[id] = sig;\n }\n assert(sig);\n return new Enum(sig);\n}\n\n\nValue *Parser::parse_bitmask() {\n size_t id = read_uint();\n BitmaskSig *sig = lookup(bitmasks, id);\n if (!sig) {\n sig = new BitmaskSig;\n sig->id = id;\n sig->num_flags = read_uint();\n BitmaskFlag *flags = new BitmaskFlag[sig->num_flags];\n for (BitmaskFlag *it = flags; it != flags + sig->num_flags; ++it) {\n it->name = read_string();\n it->value = read_uint();\n if (it->value == 0 && it != flags) {\n std::cerr << \"warning: bitmask \" << it->name << \" is zero but is not first flag\\n\";\n }\n }\n sig->flags = flags;\n bitmasks[id] = sig;\n }\n assert(sig);\n\n unsigned long long value = read_uint();\n\n return new Bitmask(sig, value);\n}\n\n\nValue *Parser::parse_array(void) {\n size_t len = read_uint();\n Array *array = new Array(len);\n for (size_t i = 0; i < len; ++i) {\n array->values[i] = parse_value();\n }\n return array;\n}\n\n\nValue *Parser::parse_blob(void) {\n size_t size = read_uint();\n Blob *blob = new Blob(size);\n if (size) {\n file->read(blob->buf, (unsigned)size);\n }\n return blob;\n}\n\n\nValue *Parser::parse_struct() {\n size_t id = read_uint();\n\n StructSig *sig = lookup(structs, id);\n if (!sig) {\n sig = new StructSig;\n sig->id = id;\n sig->name = read_string();\n sig->num_members = read_uint();\n const char **member_names = new const char *[sig->num_members];\n for (unsigned i = 0; i < sig->num_members; ++i) {\n member_names[i] = read_string();\n }\n sig->member_names = member_names;\n structs[id] = sig;\n }\n assert(sig);\n\n Struct *value = new Struct(sig);\n\n for (size_t i = 0; i < sig->num_members; ++i) {\n value->members[i] = parse_value();\n }\n\n return value;\n}\n\n\nValue *Parser::parse_opaque() {\n unsigned long long addr;\n addr = read_uint();\n return new Pointer(addr);\n}\n\n\nconst char * Parser::read_string(void) {\n size_t len = read_uint();\n char * value = new char[len + 1];\n if (len) {\n file->read(value, (unsigned)len);\n }\n value[len] = 0;\n#if TRACE_VERBOSE\n std::cerr << \"\\tSTRING \\\"\" << value << \"\\\"\\n\";\n#endif\n return value;\n}\n\n\nunsigned long long Parser::read_uint(void) {\n unsigned long long value = 0;\n int c;\n unsigned shift = 0;\n do {\n c = file->getc();\n if (c == -1) {\n break;\n }\n value |= (unsigned long long)(c & 0x7f) << shift;\n shift += 7;\n } while(c & 0x80);\n#if TRACE_VERBOSE\n std::cerr << \"\\tUINT \" << value << \"\\n\";\n#endif\n return value;\n}\n\n\ninline int Parser::read_byte(void) {\n int c = file->getc();\n#if TRACE_VERBOSE\n if (c < 0)\n std::cerr << \"\\tEOF\" << \"\\n\";\n else\n std::cerr << \"\\tBYTE 0x\" << std::hex << c << std::dec << \"\\n\";\n#endif\n return c;\n}\n\n\n} \/* namespace Trace *\/\n<commit_msg>Reset the container after deleting all the elements.<commit_after>\/**************************************************************************\n *\n * Copyright 2011 Jose Fonseca\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#include <assert.h>\n#include <stdlib.h>\n\n#include \"trace_file.hpp\"\n#include \"trace_snappyfile.hpp\"\n#include \"trace_parser.hpp\"\n\n\n#define TRACE_VERBOSE 0\n\n\nnamespace Trace {\n\n\nParser::Parser() {\n file = NULL;\n next_call_no = 0;\n version = 0;\n}\n\n\nParser::~Parser() {\n close();\n}\n\n\nbool Parser::open(const char *filename) {\n assert(!file);\n if (File::isZLibCompressed(filename)) {\n file = new ZLibFile;\n } else {\n file = new SnappyFile;\n }\n\n if (!file->open(filename, File::Read)) {\n return false;\n }\n\n version = read_uint();\n if (version > TRACE_VERSION) {\n std::cerr << \"error: unsupported trace format version \" << version << \"\\n\";\n return false;\n }\n\n return true;\n}\n\ntemplate <typename Iter>\ninline void\ndeleteAll(Iter begin, Iter end)\n{\n while (begin != end) {\n delete *begin;\n ++begin;\n }\n}\n\ntemplate <typename Container>\ninline void\ndeleteAll(Container &c)\n{\n deleteAll(c.begin(), c.end());\n c.clear();\n}\n\nvoid Parser::close(void) {\n if (file) {\n file->close();\n delete file;\n file = NULL;\n }\n\n deleteAll(calls);\n deleteAll(functions);\n deleteAll(structs);\n deleteAll(enums);\n deleteAll(bitmasks);\n}\n\n\nCall *Parser::parse_call(void) {\n do {\n int c = read_byte();\n switch(c) {\n case Trace::EVENT_ENTER:\n parse_enter();\n break;\n case Trace::EVENT_LEAVE:\n return parse_leave();\n default:\n std::cerr << \"error: unknown event \" << c << \"\\n\";\n exit(1);\n case -1:\n for (CallList::iterator it = calls.begin(); it != calls.end(); ++it) {\n std::cerr << \"warning: incomplete call \" << (*it)->name() << \"\\n\";\n std::cerr << **it << \"\\n\";\n }\n return NULL;\n }\n } while(true);\n}\n\n\n\/**\n * Helper function to lookup an ID in a vector, resizing the vector if it doesn't fit.\n *\/\ntemplate<class T>\nT *lookup(std::vector<T *> &map, size_t index) {\n if (index >= map.size()) {\n map.resize(index + 1);\n return NULL;\n } else {\n return map[index];\n }\n}\n\n\nvoid Parser::parse_enter(void) {\n size_t id = read_uint();\n\n FunctionSig *sig = lookup(functions, id);\n if (!sig) {\n sig = new FunctionSig;\n sig->id = id;\n sig->name = read_string();\n sig->num_args = read_uint();\n const char **arg_names = new const char *[sig->num_args];\n for (unsigned i = 0; i < sig->num_args; ++i) {\n arg_names[i] = read_string();\n }\n sig->arg_names = arg_names;\n functions[id] = sig;\n }\n assert(sig);\n\n Call *call = new Call(sig);\n call->no = next_call_no++;\n\n if (parse_call_details(call)) {\n calls.push_back(call);\n } else {\n delete call;\n }\n}\n\n\nCall *Parser::parse_leave(void) {\n unsigned call_no = read_uint();\n Call *call = NULL;\n for (CallList::iterator it = calls.begin(); it != calls.end(); ++it) {\n if ((*it)->no == call_no) {\n call = *it;\n calls.erase(it);\n break;\n }\n }\n if (!call) {\n return NULL;\n }\n\n if (parse_call_details(call)) {\n return call;\n } else {\n delete call;\n return NULL;\n }\n}\n\n\nbool Parser::parse_call_details(Call *call) {\n do {\n int c = read_byte();\n switch(c) {\n case Trace::CALL_END:\n return true;\n case Trace::CALL_ARG:\n parse_arg(call);\n break;\n case Trace::CALL_RET:\n call->ret = parse_value();\n break;\n default:\n std::cerr << \"error: (\"<<call->name()<< \") unknown call detail \"\n << c << \"\\n\";\n exit(1);\n case -1:\n return false;\n }\n } while(true);\n}\n\n\nvoid Parser::parse_arg(Call *call) {\n unsigned index = read_uint();\n Value *value = parse_value();\n if (index >= call->args.size()) {\n call->args.resize(index + 1);\n }\n call->args[index] = value;\n}\n\n\nValue *Parser::parse_value(void) {\n int c;\n Value *value;\n c = read_byte();\n switch(c) {\n case Trace::TYPE_NULL:\n value = new Null;\n break;\n case Trace::TYPE_FALSE:\n value = new Bool(false);\n break;\n case Trace::TYPE_TRUE:\n value = new Bool(true);\n break;\n case Trace::TYPE_SINT:\n value = parse_sint();\n break;\n case Trace::TYPE_UINT:\n value = parse_uint();\n break;\n case Trace::TYPE_FLOAT:\n value = parse_float();\n break;\n case Trace::TYPE_DOUBLE:\n value = parse_double();\n break;\n case Trace::TYPE_STRING:\n value = parse_string();\n break;\n case Trace::TYPE_ENUM:\n value = parse_enum();\n break;\n case Trace::TYPE_BITMASK:\n value = parse_bitmask();\n break;\n case Trace::TYPE_ARRAY:\n value = parse_array();\n break;\n case Trace::TYPE_STRUCT:\n value = parse_struct();\n break;\n case Trace::TYPE_BLOB:\n value = parse_blob();\n break;\n case Trace::TYPE_OPAQUE:\n value = parse_opaque();\n break;\n default:\n std::cerr << \"error: unknown type \" << c << \"\\n\";\n exit(1);\n case -1:\n value = NULL;\n break;\n }\n#if TRACE_VERBOSE\n if (value) {\n std::cerr << \"\\tVALUE \" << value << \"\\n\";\n }\n#endif\n return value;\n}\n\n\nValue *Parser::parse_sint() {\n return new SInt(-(signed long long)read_uint());\n}\n\n\nValue *Parser::parse_uint() {\n return new UInt(read_uint());\n}\n\n\nValue *Parser::parse_float() {\n float value;\n file->read(&value, sizeof value);\n return new Float(value);\n}\n\n\nValue *Parser::parse_double() {\n double value;\n file->read(&value, sizeof value);\n return new Float(value);\n}\n\n\nValue *Parser::parse_string() {\n return new String(read_string());\n}\n\n\nValue *Parser::parse_enum() {\n size_t id = read_uint();\n EnumSig *sig = lookup(enums, id);\n if (!sig) {\n sig = new EnumSig;\n sig->id = id;\n sig->name = read_string();\n Value *value = parse_value();\n sig->value = value->toSInt();\n delete value;\n enums[id] = sig;\n }\n assert(sig);\n return new Enum(sig);\n}\n\n\nValue *Parser::parse_bitmask() {\n size_t id = read_uint();\n BitmaskSig *sig = lookup(bitmasks, id);\n if (!sig) {\n sig = new BitmaskSig;\n sig->id = id;\n sig->num_flags = read_uint();\n BitmaskFlag *flags = new BitmaskFlag[sig->num_flags];\n for (BitmaskFlag *it = flags; it != flags + sig->num_flags; ++it) {\n it->name = read_string();\n it->value = read_uint();\n if (it->value == 0 && it != flags) {\n std::cerr << \"warning: bitmask \" << it->name << \" is zero but is not first flag\\n\";\n }\n }\n sig->flags = flags;\n bitmasks[id] = sig;\n }\n assert(sig);\n\n unsigned long long value = read_uint();\n\n return new Bitmask(sig, value);\n}\n\n\nValue *Parser::parse_array(void) {\n size_t len = read_uint();\n Array *array = new Array(len);\n for (size_t i = 0; i < len; ++i) {\n array->values[i] = parse_value();\n }\n return array;\n}\n\n\nValue *Parser::parse_blob(void) {\n size_t size = read_uint();\n Blob *blob = new Blob(size);\n if (size) {\n file->read(blob->buf, (unsigned)size);\n }\n return blob;\n}\n\n\nValue *Parser::parse_struct() {\n size_t id = read_uint();\n\n StructSig *sig = lookup(structs, id);\n if (!sig) {\n sig = new StructSig;\n sig->id = id;\n sig->name = read_string();\n sig->num_members = read_uint();\n const char **member_names = new const char *[sig->num_members];\n for (unsigned i = 0; i < sig->num_members; ++i) {\n member_names[i] = read_string();\n }\n sig->member_names = member_names;\n structs[id] = sig;\n }\n assert(sig);\n\n Struct *value = new Struct(sig);\n\n for (size_t i = 0; i < sig->num_members; ++i) {\n value->members[i] = parse_value();\n }\n\n return value;\n}\n\n\nValue *Parser::parse_opaque() {\n unsigned long long addr;\n addr = read_uint();\n return new Pointer(addr);\n}\n\n\nconst char * Parser::read_string(void) {\n size_t len = read_uint();\n char * value = new char[len + 1];\n if (len) {\n file->read(value, (unsigned)len);\n }\n value[len] = 0;\n#if TRACE_VERBOSE\n std::cerr << \"\\tSTRING \\\"\" << value << \"\\\"\\n\";\n#endif\n return value;\n}\n\n\nunsigned long long Parser::read_uint(void) {\n unsigned long long value = 0;\n int c;\n unsigned shift = 0;\n do {\n c = file->getc();\n if (c == -1) {\n break;\n }\n value |= (unsigned long long)(c & 0x7f) << shift;\n shift += 7;\n } while(c & 0x80);\n#if TRACE_VERBOSE\n std::cerr << \"\\tUINT \" << value << \"\\n\";\n#endif\n return value;\n}\n\n\ninline int Parser::read_byte(void) {\n int c = file->getc();\n#if TRACE_VERBOSE\n if (c < 0)\n std::cerr << \"\\tEOF\" << \"\\n\";\n else\n std::cerr << \"\\tBYTE 0x\" << std::hex << c << std::dec << \"\\n\";\n#endif\n return c;\n}\n\n\n} \/* namespace Trace *\/\n<|endoftext|>"} {"text":"<commit_before>\/** @file dbfactory.cc\n * @brief Database factories for non-remote databases.\n *\/\n\/* Copyright 2002,2003,2004,2005,2006,2007,2008,2009,2011,2012,2013,2014,2015,2016,2017,2019 Olly Betts\n * Copyright 2008 Lemur Consulting Ltd\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,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the\n * GNU General Public License for more details.\n *\n * You should have received a copy of the GNU General Public License\n * along with this program; if not, write to the Free Software\n * Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301\n * USA\n *\/\n\n#include \"config.h\"\n\n#include \"xapian\/dbfactory.h\"\n\n#include \"xapian\/constants.h\"\n#include \"xapian\/database.h\"\n#include \"xapian\/error.h\"\n#include \"xapian\/version.h\" \/\/ For XAPIAN_HAS_XXX_BACKEND.\n\n#include \"xapian\/backends\/backends.h\"\n#include \"xapian\/backends\/databasehelpers.h\"\n#include \"xapian\/common\/debuglog.h\"\n#include \"xapian\/common\/filetests.h\"\n#include \"xapian\/common\/fileutils.h\"\n#include \"xapian\/common\/posixy_wrapper.h\"\n#include \"xapian\/common\/str.h\"\n\n#include <cerrno>\n#include <cstdlib> \/\/ For atoi().\n\n#ifdef XAPIAN_HAS_GLASS_BACKEND\n# include \"xapian\/backends\/glass\/glass_database.h\"\n#endif\n#include \"xapian\/backends\/glass\/glass_defs.h\"\n#ifdef XAPIAN_HAS_HONEY_BACKEND\n# include \"xapian\/backends\/honey\/honey_database.h\"\n#endif\n#include \"xapian\/backends\/honey\/honey_defs.h\"\n#ifdef XAPIAN_HAS_INMEMORY_BACKEND\n# include \"xapian\/backends\/inmemory\/inmemory_database.h\"\n#endif\n\/\/ Even if none of the above get included, we still need a definition of\n\/\/ Database::Internal.\n#include \"xapian\/backends\/databaseinternal.h\"\n\n#include <fstream>\n#include <string>\n\nusing namespace std;\n\nnamespace Xapian {\n\nstatic void\nopen_stub(Database& db, const string& file)\n{\n read_stub_file(file,\n\t\t [&db](const string& path) {\n\t\t db.add_database(Database(path));\n\t\t },\n\t\t [&db](const string& path) {\n#ifdef XAPIAN_HAS_GLASS_BACKEND\n\t\t db.add_database(Database(new GlassDatabase(path)));\n#else\n\t\t (void)path;\n#endif\n\t\t },\n\t\t [&db](const string& path) {\n#ifdef XAPIAN_HAS_HONEY_BACKEND\n\t\t db.add_database(Database(new HoneyDatabase(path)));\n#else\n\t\t (void)path;\n#endif\n\t\t },\n\t\t [&db](const string& prog, const string& args) {\n#ifdef XAPIAN_HAS_REMOTE_BACKEND\n\t\t db.add_database(Remote::open(prog, args));\n#else\n\t\t (void)prog;\n\t\t (void)args;\n#endif\n\t\t },\n\t\t [&db](const string& host, unsigned port) {\n#ifdef XAPIAN_HAS_REMOTE_BACKEND\n\t\t db.add_database(Remote::open(host, port));\n#else\n\t\t (void)host;\n\t\t (void)port;\n#endif\n\t\t },\n\t\t [&db]() {\n#ifdef XAPIAN_HAS_INMEMORY_BACKEND\n\t\t db.add_database(Database(string(), DB_BACKEND_INMEMORY));\n#endif\n\t\t });\n\n \/\/ Allowing a stub database with no databases listed allows things like\n \/\/ a \"search all databases\" feature to be implemented by generating a\n \/\/ stub database file without having to special case there not being any\n \/\/ databases yet.\n \/\/\n \/\/ 1.0.x threw DatabaseOpeningError here, but with a \"Bad line\" message\n \/\/ with the line number just past the end of the file, which was a bit odd.\n}\n\nstatic void\nopen_stub(WritableDatabase& db, const string& file, int flags)\n{\n read_stub_file(file,\n\t\t [&db, flags](const string& path) {\n\t\t db.add_database(WritableDatabase(path, flags));\n\t\t },\n\t\t [&db, &flags](const string& path) {\n\t\t flags |= DB_BACKEND_GLASS;\n\t\t db.add_database(WritableDatabase(path, flags));\n\t\t },\n\t\t [](const string&) {\n\t\t auto msg = \"Honey databases don't support writing\";\n\t\t throw Xapian::DatabaseOpeningError(msg);\n\t\t },\n\t\t [&db, flags](const string& prog, const string& args) {\n#ifdef XAPIAN_HAS_REMOTE_BACKEND\n\t\t db.add_database(Remote::open_writable(prog, args,\n\t\t\t\t\t\t\t 0, flags));\n#else\n\t\t (void)prog;\n\t\t (void)args;\n#endif\n\t\t },\n\t\t [&db, flags](const string& host, unsigned port) {\n#ifdef XAPIAN_HAS_REMOTE_BACKEND\n\t\t db.add_database(Remote::open_writable(host, port,\n\t\t\t\t\t\t\t 0, 10000, flags));\n#else\n\t\t (void)host;\n\t\t (void)port;\n#endif\n\t\t },\n\t\t [&db]() {\n\t\t db.add_database(WritableDatabase(string(),\n\t\t\t\t\t\t\tDB_BACKEND_INMEMORY));\n\t\t });\n\n if (db.internal->size() == 0) {\n\tthrow DatabaseOpeningError(file + \": No databases listed\");\n }\n}\n\nDatabase::Database(const string& path, int flags)\n : Database()\n{\n LOGCALL_CTOR(API, \"Database\", path|flags);\n\n int type = flags & DB_BACKEND_MASK_;\n switch (type) {\n\tcase DB_BACKEND_CHERT:\n\t throw FeatureUnavailableError(\"Chert backend no longer supported\");\n\tcase DB_BACKEND_GLASS:\n#ifdef XAPIAN_HAS_GLASS_BACKEND\n\t internal = new GlassDatabase(path);\n\t return;\n#else\n\t throw FeatureUnavailableError(\"Glass backend disabled\");\n#endif\n\tcase DB_BACKEND_HONEY:\n#ifdef XAPIAN_HAS_HONEY_BACKEND\n\t internal = new HoneyDatabase(path);\n\t return;\n#else\n\t throw FeatureUnavailableError(\"Honey backend disabled\");\n#endif\n\tcase DB_BACKEND_STUB:\n\t open_stub(*this, path);\n\t return;\n\tcase DB_BACKEND_INMEMORY:\n#ifdef XAPIAN_HAS_INMEMORY_BACKEND\n\t internal = new InMemoryDatabase();\n\t return;\n#else\n\t throw FeatureUnavailableError(\"Inmemory backend disabled\");\n#endif\n }\n\n struct stat statbuf;\n if (stat(path.c_str(), &statbuf) == -1) {\n\tthrow DatabaseOpeningError(\"Couldn't stat '\" + path + \"'\", errno);\n }\n\n if (S_ISREG(statbuf.st_mode)) {\n\t\/\/ Could be a stub database file, or a single file glass database.\n\n\t\/\/ Initialise to avoid bogus warning from GCC 4.9.2 with -Os.\n\tint fd = -1;\n\tswitch (test_if_single_file_db(statbuf, path, &fd)) {\n\t case BACKEND_GLASS:\n#ifdef XAPIAN_HAS_GLASS_BACKEND\n\t\t\/\/ Single file glass format.\n\t\tinternal = new GlassDatabase(fd);\n\t\treturn;\n#else\n\t\tthrow FeatureUnavailableError(\"Glass backend disabled\");\n#endif\n\t case BACKEND_HONEY:\n#ifdef XAPIAN_HAS_HONEY_BACKEND\n\t\t\/\/ Single file honey format.\n\t\tinternal = new HoneyDatabase(fd);\n\t\treturn;\n#else\n\t\tthrow FeatureUnavailableError(\"Honey backend disabled\");\n#endif\n\t}\n\n\topen_stub(*this, path);\n\treturn;\n }\n\n if (rare(!S_ISDIR(statbuf.st_mode))) {\n\tthrow DatabaseOpeningError(\"Not a regular file or directory: '\" + path + \"'\");\n }\n\n#ifdef XAPIAN_HAS_GLASS_BACKEND\n if (file_exists(path + \"\/iamglass\")) {\n\tinternal = new GlassDatabase(path);\n\treturn;\n }\n#endif\n\n#ifdef XAPIAN_HAS_HONEY_BACKEND\n if (file_exists(path + \"\/iamhoney\")) {\n\tinternal = new HoneyDatabase(path);\n\treturn;\n }\n#endif\n\n \/\/ Check for \"stub directories\".\n string stub_file = path;\n stub_file += \"\/XAPIANDB\";\n if (usual(file_exists(stub_file))) {\n\topen_stub(*this, stub_file);\n\treturn;\n }\n\n#ifndef XAPIAN_HAS_GLASS_BACKEND\n if (file_exists(path + \"\/iamglass\")) {\n\tthrow FeatureUnavailableError(\"Glass backend disabled\");\n }\n#endif\n#ifndef XAPIAN_HAS_HONEY_BACKEND\n if (file_exists(path + \"\/iamhoney\")) {\n\tthrow FeatureUnavailableError(\"Honey backend disabled\");\n }\n#endif\n if (file_exists(path + \"\/iamchert\")) {\n\tthrow FeatureUnavailableError(\"Chert backend no longer supported\");\n }\n if (file_exists(path + \"\/iamflint\")) {\n\tthrow FeatureUnavailableError(\"Flint backend no longer supported\");\n }\n\n throw DatabaseOpeningError(\"Couldn't detect type of database\");\n}\n\nDatabase::Database(int fd, int flags)\n{\n LOGCALL_CTOR(API, \"Database\", fd|flags);\n\n if (rare(fd < 0))\n\tthrow InvalidArgumentError(\"fd < 0\");\n\n#ifdef XAPIAN_HAS_GLASS_BACKEND\n int type = flags & DB_BACKEND_MASK_;\n switch (type) {\n\tcase 0:\n\tcase DB_BACKEND_GLASS:\n\t internal = new GlassDatabase(fd);\n }\n#else\n (void)flags;\n#endif\n\n (void)::close(fd);\n throw DatabaseOpeningError(\"Couldn't detect type of database\");\n}\n\n#if defined XAPIAN_HAS_GLASS_BACKEND\n#define HAVE_DISK_BACKEND\n#endif\n\nWritableDatabase::WritableDatabase(const std::string &path, int flags, int block_size)\n : Database()\n{\n LOGCALL_CTOR(API, \"WritableDatabase\", path|flags|block_size);\n \/\/ Avoid warning if all disk-based backends are disabled.\n (void)block_size;\n int type = flags & DB_BACKEND_MASK_;\n \/\/ Clear the backend bits, so we just pass on other flags to open_stub, etc.\n flags &= ~DB_BACKEND_MASK_;\n if (type == 0) {\n\tstruct stat statbuf;\n\tif (stat(path.c_str(), &statbuf) == -1) {\n\t \/\/ ENOENT probably just means that we need to create the directory.\n\t if (errno != ENOENT)\n\t\tthrow DatabaseOpeningError(\"Couldn't stat '\" + path + \"'\", errno);\n\t} else {\n\t \/\/ File or directory already exists.\n\n\t if (S_ISREG(statbuf.st_mode)) {\n\t\t\/\/ The path is a file, so assume it is a stub database file.\n\t\topen_stub(*this, path, flags);\n\t\treturn;\n\t }\n\n\t if (rare(!S_ISDIR(statbuf.st_mode))) {\n\t\tthrow DatabaseOpeningError(\"Not a regular file or directory: '\" + path + \"'\");\n\t }\n\n\t if (file_exists(path + \"\/iamglass\")) {\n\t\t\/\/ Existing glass DB.\n#ifdef XAPIAN_HAS_GLASS_BACKEND\n\t\ttype = DB_BACKEND_GLASS;\n#else\n\t\tthrow FeatureUnavailableError(\"Glass backend disabled\");\n#endif\n\t } else if (file_exists(path + \"\/iamhoney\")) {\n\t\t\/\/ Existing honey DB.\n\t\tthrow InvalidOperationError(\"Honey backend doesn't support \"\n\t\t\t\t\t \"updating existing databases\");\n\t } else if (file_exists(path + \"\/iamchert\")) {\n\t\t\/\/ Existing chert DB.\n\t\tthrow FeatureUnavailableError(\"Chert backend no longer supported\");\n\t } else if (file_exists(path + \"\/iamflint\")) {\n\t\t\/\/ Existing flint DB.\n\t\tthrow FeatureUnavailableError(\"Flint backend no longer supported\");\n\t } else {\n\t\t\/\/ Check for \"stub directories\".\n\t\tstring stub_file = path;\n\t\tstub_file += \"\/XAPIANDB\";\n\t\tif (usual(file_exists(stub_file))) {\n\t\t open_stub(*this, stub_file, flags);\n\t\t return;\n\t\t}\n\t }\n\t}\n }\n\n switch (type) {\n\tcase DB_BACKEND_STUB:\n\t open_stub(*this, path, flags);\n\t return;\n\tcase 0:\n\t \/\/ Fall through to first enabled case, so order the remaining cases\n\t \/\/ by preference.\n#ifdef XAPIAN_HAS_GLASS_BACKEND\n\tcase DB_BACKEND_GLASS:\n\t internal = new GlassWritableDatabase(path, flags, block_size);\n\t return;\n#endif\n\tcase DB_BACKEND_HONEY:\n\t throw InvalidArgumentError(\"Honey backend doesn't support \"\n\t\t\t\t \"updating existing databases\");\n\tcase DB_BACKEND_CHERT:\n\t throw FeatureUnavailableError(\"Chert backend no longer supported\");\n\tcase DB_BACKEND_INMEMORY:\n#ifdef XAPIAN_HAS_INMEMORY_BACKEND\n\t internal = new InMemoryDatabase();\n\t return;\n#else\n\t throw FeatureUnavailableError(\"Inmemory backend disabled\");\n#endif\n }\n#ifndef HAVE_DISK_BACKEND\n throw FeatureUnavailableError(\"No disk-based writable backend is enabled\");\n#endif\n}\n\n}\n<commit_msg>xapian-core: Throw DatabaseNotFoundError if directory doesn't exist<commit_after>\/** @file dbfactory.cc\n * @brief Database factories for non-remote databases.\n *\/\n\/* Copyright 2002,2003,2004,2005,2006,2007,2008,2009,2011,2012,2013,2014,2015,2016,2017,2019 Olly Betts\n * Copyright 2008 Lemur Consulting Ltd\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,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the\n * GNU General Public License for more details.\n *\n * You should have received a copy of the GNU General Public License\n * along with this program; if not, write to the Free Software\n * Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301\n * USA\n *\/\n\n#include \"config.h\"\n\n#include \"xapian\/dbfactory.h\"\n\n#include \"xapian\/constants.h\"\n#include \"xapian\/database.h\"\n#include \"xapian\/error.h\"\n#include \"xapian\/version.h\" \/\/ For XAPIAN_HAS_XXX_BACKEND.\n\n#include \"xapian\/backends\/backends.h\"\n#include \"xapian\/backends\/databasehelpers.h\"\n#include \"xapian\/common\/debuglog.h\"\n#include \"xapian\/common\/filetests.h\"\n#include \"xapian\/common\/fileutils.h\"\n#include \"xapian\/common\/posixy_wrapper.h\"\n#include \"xapian\/common\/str.h\"\n\n#include <cerrno>\n#include <cstdlib> \/\/ For atoi().\n\n#ifdef XAPIAN_HAS_GLASS_BACKEND\n# include \"xapian\/backends\/glass\/glass_database.h\"\n#endif\n#include \"xapian\/backends\/glass\/glass_defs.h\"\n#ifdef XAPIAN_HAS_HONEY_BACKEND\n# include \"xapian\/backends\/honey\/honey_database.h\"\n#endif\n#include \"xapian\/backends\/honey\/honey_defs.h\"\n#ifdef XAPIAN_HAS_INMEMORY_BACKEND\n# include \"xapian\/backends\/inmemory\/inmemory_database.h\"\n#endif\n\/\/ Even if none of the above get included, we still need a definition of\n\/\/ Database::Internal.\n#include \"xapian\/backends\/databaseinternal.h\"\n\n#include <fstream>\n#include <string>\n\nusing namespace std;\n\nnamespace Xapian {\n\nstatic void\nopen_stub(Database& db, const string& file)\n{\n read_stub_file(file,\n\t\t [&db](const string& path) {\n\t\t db.add_database(Database(path));\n\t\t },\n\t\t [&db](const string& path) {\n#ifdef XAPIAN_HAS_GLASS_BACKEND\n\t\t db.add_database(Database(new GlassDatabase(path)));\n#else\n\t\t (void)path;\n#endif\n\t\t },\n\t\t [&db](const string& path) {\n#ifdef XAPIAN_HAS_HONEY_BACKEND\n\t\t db.add_database(Database(new HoneyDatabase(path)));\n#else\n\t\t (void)path;\n#endif\n\t\t },\n\t\t [&db](const string& prog, const string& args) {\n#ifdef XAPIAN_HAS_REMOTE_BACKEND\n\t\t db.add_database(Remote::open(prog, args));\n#else\n\t\t (void)prog;\n\t\t (void)args;\n#endif\n\t\t },\n\t\t [&db](const string& host, unsigned port) {\n#ifdef XAPIAN_HAS_REMOTE_BACKEND\n\t\t db.add_database(Remote::open(host, port));\n#else\n\t\t (void)host;\n\t\t (void)port;\n#endif\n\t\t },\n\t\t [&db]() {\n#ifdef XAPIAN_HAS_INMEMORY_BACKEND\n\t\t db.add_database(Database(string(), DB_BACKEND_INMEMORY));\n#endif\n\t\t });\n\n \/\/ Allowing a stub database with no databases listed allows things like\n \/\/ a \"search all databases\" feature to be implemented by generating a\n \/\/ stub database file without having to special case there not being any\n \/\/ databases yet.\n \/\/\n \/\/ 1.0.x threw DatabaseOpeningError here, but with a \"Bad line\" message\n \/\/ with the line number just past the end of the file, which was a bit odd.\n}\n\nstatic void\nopen_stub(WritableDatabase& db, const string& file, int flags)\n{\n read_stub_file(file,\n\t\t [&db, flags](const string& path) {\n\t\t db.add_database(WritableDatabase(path, flags));\n\t\t },\n\t\t [&db, &flags](const string& path) {\n\t\t flags |= DB_BACKEND_GLASS;\n\t\t db.add_database(WritableDatabase(path, flags));\n\t\t },\n\t\t [](const string&) {\n\t\t auto msg = \"Honey databases don't support writing\";\n\t\t throw Xapian::DatabaseOpeningError(msg);\n\t\t },\n\t\t [&db, flags](const string& prog, const string& args) {\n#ifdef XAPIAN_HAS_REMOTE_BACKEND\n\t\t db.add_database(Remote::open_writable(prog, args,\n\t\t\t\t\t\t\t 0, flags));\n#else\n\t\t (void)prog;\n\t\t (void)args;\n#endif\n\t\t },\n\t\t [&db, flags](const string& host, unsigned port) {\n#ifdef XAPIAN_HAS_REMOTE_BACKEND\n\t\t db.add_database(Remote::open_writable(host, port,\n\t\t\t\t\t\t\t 0, 10000, flags));\n#else\n\t\t (void)host;\n\t\t (void)port;\n#endif\n\t\t },\n\t\t [&db]() {\n\t\t db.add_database(WritableDatabase(string(),\n\t\t\t\t\t\t\tDB_BACKEND_INMEMORY));\n\t\t });\n\n if (db.internal->size() == 0) {\n\tthrow DatabaseOpeningError(file + \": No databases listed\");\n }\n}\n\nDatabase::Database(const string& path, int flags)\n : Database()\n{\n LOGCALL_CTOR(API, \"Database\", path|flags);\n\n int type = flags & DB_BACKEND_MASK_;\n switch (type) {\n\tcase DB_BACKEND_CHERT:\n\t throw FeatureUnavailableError(\"Chert backend no longer supported\");\n\tcase DB_BACKEND_GLASS:\n#ifdef XAPIAN_HAS_GLASS_BACKEND\n\t internal = new GlassDatabase(path);\n\t return;\n#else\n\t throw FeatureUnavailableError(\"Glass backend disabled\");\n#endif\n\tcase DB_BACKEND_HONEY:\n#ifdef XAPIAN_HAS_HONEY_BACKEND\n\t internal = new HoneyDatabase(path);\n\t return;\n#else\n\t throw FeatureUnavailableError(\"Honey backend disabled\");\n#endif\n\tcase DB_BACKEND_STUB:\n\t open_stub(*this, path);\n\t return;\n\tcase DB_BACKEND_INMEMORY:\n#ifdef XAPIAN_HAS_INMEMORY_BACKEND\n\t internal = new InMemoryDatabase();\n\t return;\n#else\n\t throw FeatureUnavailableError(\"Inmemory backend disabled\");\n#endif\n }\n\n struct stat statbuf;\n if (stat(path.c_str(), &statbuf) == -1) {\n\tif (errno == ENOENT) {\n\t throw DatabaseNotFoundError(\"Couldn't stat '\" + path + \"'\", errno);\n\t} else {\n\t throw DatabaseOpeningError(\"Couldn't stat '\" + path + \"'\", errno);\n\t}\n }\n\n if (S_ISREG(statbuf.st_mode)) {\n\t\/\/ Could be a stub database file, or a single file glass database.\n\n\t\/\/ Initialise to avoid bogus warning from GCC 4.9.2 with -Os.\n\tint fd = -1;\n\tswitch (test_if_single_file_db(statbuf, path, &fd)) {\n\t case BACKEND_GLASS:\n#ifdef XAPIAN_HAS_GLASS_BACKEND\n\t\t\/\/ Single file glass format.\n\t\tinternal = new GlassDatabase(fd);\n\t\treturn;\n#else\n\t\tthrow FeatureUnavailableError(\"Glass backend disabled\");\n#endif\n\t case BACKEND_HONEY:\n#ifdef XAPIAN_HAS_HONEY_BACKEND\n\t\t\/\/ Single file honey format.\n\t\tinternal = new HoneyDatabase(fd);\n\t\treturn;\n#else\n\t\tthrow FeatureUnavailableError(\"Honey backend disabled\");\n#endif\n\t}\n\n\topen_stub(*this, path);\n\treturn;\n }\n\n if (rare(!S_ISDIR(statbuf.st_mode))) {\n\tthrow DatabaseOpeningError(\"Not a regular file or directory: '\" + path + \"'\");\n }\n\n#ifdef XAPIAN_HAS_GLASS_BACKEND\n if (file_exists(path + \"\/iamglass\")) {\n\tinternal = new GlassDatabase(path);\n\treturn;\n }\n#endif\n\n#ifdef XAPIAN_HAS_HONEY_BACKEND\n if (file_exists(path + \"\/iamhoney\")) {\n\tinternal = new HoneyDatabase(path);\n\treturn;\n }\n#endif\n\n \/\/ Check for \"stub directories\".\n string stub_file = path;\n stub_file += \"\/XAPIANDB\";\n if (usual(file_exists(stub_file))) {\n\topen_stub(*this, stub_file);\n\treturn;\n }\n\n#ifndef XAPIAN_HAS_GLASS_BACKEND\n if (file_exists(path + \"\/iamglass\")) {\n\tthrow FeatureUnavailableError(\"Glass backend disabled\");\n }\n#endif\n#ifndef XAPIAN_HAS_HONEY_BACKEND\n if (file_exists(path + \"\/iamhoney\")) {\n\tthrow FeatureUnavailableError(\"Honey backend disabled\");\n }\n#endif\n if (file_exists(path + \"\/iamchert\")) {\n\tthrow FeatureUnavailableError(\"Chert backend no longer supported\");\n }\n if (file_exists(path + \"\/iamflint\")) {\n\tthrow FeatureUnavailableError(\"Flint backend no longer supported\");\n }\n\n throw DatabaseNotFoundError(\"Couldn't detect type of database\");\n}\n\nDatabase::Database(int fd, int flags)\n{\n LOGCALL_CTOR(API, \"Database\", fd|flags);\n\n if (rare(fd < 0))\n\tthrow InvalidArgumentError(\"fd < 0\");\n\n#ifdef XAPIAN_HAS_GLASS_BACKEND\n int type = flags & DB_BACKEND_MASK_;\n switch (type) {\n\tcase 0:\n\tcase DB_BACKEND_GLASS:\n\t internal = new GlassDatabase(fd);\n }\n#else\n (void)flags;\n#endif\n\n (void)::close(fd);\n throw DatabaseOpeningError(\"Couldn't detect type of database\");\n}\n\n#if defined XAPIAN_HAS_GLASS_BACKEND\n#define HAVE_DISK_BACKEND\n#endif\n\nWritableDatabase::WritableDatabase(const std::string &path, int flags, int block_size)\n : Database()\n{\n LOGCALL_CTOR(API, \"WritableDatabase\", path|flags|block_size);\n \/\/ Avoid warning if all disk-based backends are disabled.\n (void)block_size;\n int type = flags & DB_BACKEND_MASK_;\n \/\/ Clear the backend bits, so we just pass on other flags to open_stub, etc.\n flags &= ~DB_BACKEND_MASK_;\n if (type == 0) {\n\tstruct stat statbuf;\n\tif (stat(path.c_str(), &statbuf) == -1) {\n\t \/\/ ENOENT probably just means that we need to create the directory.\n\t if (errno != ENOENT)\n\t\tthrow DatabaseOpeningError(\"Couldn't stat '\" + path + \"'\", errno);\n\t} else {\n\t \/\/ File or directory already exists.\n\n\t if (S_ISREG(statbuf.st_mode)) {\n\t\t\/\/ The path is a file, so assume it is a stub database file.\n\t\topen_stub(*this, path, flags);\n\t\treturn;\n\t }\n\n\t if (rare(!S_ISDIR(statbuf.st_mode))) {\n\t\tthrow DatabaseOpeningError(\"Not a regular file or directory: '\" + path + \"'\");\n\t }\n\n\t if (file_exists(path + \"\/iamglass\")) {\n\t\t\/\/ Existing glass DB.\n#ifdef XAPIAN_HAS_GLASS_BACKEND\n\t\ttype = DB_BACKEND_GLASS;\n#else\n\t\tthrow FeatureUnavailableError(\"Glass backend disabled\");\n#endif\n\t } else if (file_exists(path + \"\/iamhoney\")) {\n\t\t\/\/ Existing honey DB.\n\t\tthrow InvalidOperationError(\"Honey backend doesn't support \"\n\t\t\t\t\t \"updating existing databases\");\n\t } else if (file_exists(path + \"\/iamchert\")) {\n\t\t\/\/ Existing chert DB.\n\t\tthrow FeatureUnavailableError(\"Chert backend no longer supported\");\n\t } else if (file_exists(path + \"\/iamflint\")) {\n\t\t\/\/ Existing flint DB.\n\t\tthrow FeatureUnavailableError(\"Flint backend no longer supported\");\n\t } else {\n\t\t\/\/ Check for \"stub directories\".\n\t\tstring stub_file = path;\n\t\tstub_file += \"\/XAPIANDB\";\n\t\tif (usual(file_exists(stub_file))) {\n\t\t open_stub(*this, stub_file, flags);\n\t\t return;\n\t\t}\n\t }\n\t}\n }\n\n switch (type) {\n\tcase DB_BACKEND_STUB:\n\t open_stub(*this, path, flags);\n\t return;\n\tcase 0:\n\t \/\/ Fall through to first enabled case, so order the remaining cases\n\t \/\/ by preference.\n#ifdef XAPIAN_HAS_GLASS_BACKEND\n\tcase DB_BACKEND_GLASS:\n\t internal = new GlassWritableDatabase(path, flags, block_size);\n\t return;\n#endif\n\tcase DB_BACKEND_HONEY:\n\t throw InvalidArgumentError(\"Honey backend doesn't support \"\n\t\t\t\t \"updating existing databases\");\n\tcase DB_BACKEND_CHERT:\n\t throw FeatureUnavailableError(\"Chert backend no longer supported\");\n\tcase DB_BACKEND_INMEMORY:\n#ifdef XAPIAN_HAS_INMEMORY_BACKEND\n\t internal = new InMemoryDatabase();\n\t return;\n#else\n\t throw FeatureUnavailableError(\"Inmemory backend disabled\");\n#endif\n }\n#ifndef HAVE_DISK_BACKEND\n throw FeatureUnavailableError(\"No disk-based writable backend is enabled\");\n#endif\n}\n\n}\n<|endoftext|>"} {"text":"<commit_before>#include \"MainMenuScene.h\"\n#include \"NNInputSystem.h\"\n#include \"NNSceneDirector.h\"\n#include \"NNApplication.h\"\n\n#include \"StoryScene.h\"\n\nMainMenuScene::MainMenuScene()\n\t: m_MainMenuImage(nullptr)\n{\n\tm_MenuSellction = 0;\n\n\tfloat width = (float)NNApplication::GetInstance()->GetScreenWidth();\n\tfloat height = (float)NNApplication::GetInstance()->GetScreenHeight();\n\t\n\t\n\tm_MainMenuImage = NNSprite::Create( L\"Sprite\/MainMenu.jpg\" );\n\tm_MainMenuImage->SetPosition( width\/2, height\/2 );\n\tm_MainMenuImage->SetCenter( m_MainMenuImage->GetPositionX()\/2.f, m_MainMenuImage->GetPositionY()\/2.f + 70.f );\n\tAddChild( m_MainMenuImage );\n\n\t\/* MenuSellectionBar type\n\tm_MainMenuSellcetionBar = NNSprite::Create( L\"Sprite\/MenuSellectionBar.png\");\n\tm_MainMenuSellcetionBar->SetPosition( width\/2 + 200.f, height\/2 + 200.f + m_MenuSellction * 50 );\n\tAddChild( m_MainMenuSellcetionBar ) ;\n\t*\/\n\n\tm_MainMenuSellcetionBar = NNSprite::Create( L\"Sprite\/MenuSellecter.gif\");\n\tm_MainMenuSellcetionBar->SetPosition( width\/2, height\/2 );\n\tm_MainMenuSellcetionBar->SetScale( 0.5f, 0.5f );\n\tAddChild( m_MainMenuSellcetionBar ) ;\n\n\tm_MianMenuLable[MENU_PLAY] = NNLabel::Create( L\"Play\", L\" \", 35.f );\n\tm_MianMenuLable[MENU_PLAY]->SetPosition( width\/2 + 200.f, height\/2 + 150.f );\n\tAddChild( m_MianMenuLable[MENU_PLAY] );\n\n\tm_MianMenuLable[MENU_EXIT] = NNLabel::Create( L\"Exit\", L\" \", 35.f );\n\tm_MianMenuLable[MENU_EXIT]->SetPosition( width\/2 + 200.f, height\/2 + 200.f);\n\tAddChild( m_MianMenuLable[MENU_EXIT] );\n\n\n}\n\nMainMenuScene::~MainMenuScene()\n{\n}\n\nvoid MainMenuScene::Render()\n{\n\tNNScene::Render();\n}\n\nvoid MainMenuScene::Update( float dTime )\n{\n\tNNScene::Update( dTime );\n\n\tm_MainMenuImage->SetVisible( true );\n\n\tfloat width = (float)NNApplication::GetInstance()->GetScreenWidth();\n\tfloat height = (float)NNApplication::GetInstance()->GetScreenHeight();\n\t\n\tif ( NNInputSystem::GetInstance()->GetKeyState( VK_UP ) == KEY_DOWN\n\t\t|| NNInputSystem::GetInstance()->GetKeyState( VK_LEFT ) == KEY_DOWN )\n\t{\n\t\t--m_MenuSellction;\n\t}\n\tif ( NNInputSystem::GetInstance()->GetKeyState( VK_DOWN ) == KEY_DOWN\n\t\t|| NNInputSystem::GetInstance()->GetKeyState( VK_RIGHT ) == KEY_DOWN )\n\t{\n\t\t++m_MenuSellction;\n\t}\n\n\tm_MainMenuSellcetionBar->SetPosition( width\/2 + 150.f, height\/2 + 150.f + m_MenuSellction * 50 );\n\n\tm_MenuSellction = ( m_MenuSellction + MENU_EXIT + 1 ) % ( MENU_EXIT + 1);\n\n\tif ( m_MenuSellction == 0 && NNInputSystem::GetInstance()->GetKeyState(VK_RETURN) == KEY_UP )\n\t{\n\t\tNNSceneDirector::GetInstance()->ChangeScene( StoryScene::Create() );\n\t}\n\telse if ( m_MenuSellction == 1 )\n\t{\n\t\t\/\/ exit\n\t}\n}<commit_msg>@ MenuSellecter changed<commit_after>#include \"MainMenuScene.h\"\n#include \"NNInputSystem.h\"\n#include \"NNSceneDirector.h\"\n#include \"NNApplication.h\"\n\n#include \"StoryScene.h\"\n\nMainMenuScene::MainMenuScene()\n\t: m_MainMenuImage(nullptr)\n{\n\tm_MenuSellction = 0;\n\n\tfloat width = (float)NNApplication::GetInstance()->GetScreenWidth();\n\tfloat height = (float)NNApplication::GetInstance()->GetScreenHeight();\n\t\n\t\n\tm_MainMenuImage = NNSprite::Create( L\"Sprite\/MainMenu.jpg\" );\n\tm_MainMenuImage->SetPosition( width\/2, height\/2 );\n\tm_MainMenuImage->SetCenter( m_MainMenuImage->GetPositionX()\/2.f, m_MainMenuImage->GetPositionY()\/2.f + 70.f );\n\tAddChild( m_MainMenuImage );\n\n\t\/* MenuSellectionBar type\n\tm_MainMenuSellcetionBar = NNSprite::Create( L\"Sprite\/MenuSellectionBar.png\");\n\tm_MainMenuSellcetionBar->SetPosition( width\/2 + 200.f, height\/2 + 200.f + m_MenuSellction * 50 );\n\tAddChild( m_MainMenuSellcetionBar ) ;\n\t*\/\n\n\tm_MainMenuSellcetionBar = NNSprite::Create( L\"Sprite\/MenuSellecter.gif\");\n\tm_MainMenuSellcetionBar->SetPosition( width\/2, height\/2 );\n\tm_MainMenuSellcetionBar->SetScale( 0.5f, 0.5f );\n\tAddChild( m_MainMenuSellcetionBar ) ;\n\n\tm_MianMenuLable[MENU_PLAY] = NNLabel::Create( L\"Play\", L\" \", 35.f );\n\tm_MianMenuLable[MENU_PLAY]->SetPosition( width\/2 + 200.f, height\/2 + 150.f );\n\tAddChild( m_MianMenuLable[MENU_PLAY] );\n\n\tm_MianMenuLable[MENU_EXIT] = NNLabel::Create( L\"Exit\", L\" \", 35.f );\n\tm_MianMenuLable[MENU_EXIT]->SetPosition( width\/2 + 200.f, height\/2 + 200.f);\n\tAddChild( m_MianMenuLable[MENU_EXIT] );\n\n}\n\nMainMenuScene::~MainMenuScene()\n{\n}\n\nvoid MainMenuScene::Render()\n{\n\tNNScene::Render();\n}\n\nvoid MainMenuScene::Update( float dTime )\n{\n\tNNScene::Update( dTime );\n\n\tm_MainMenuImage->SetVisible( true );\n\n\tfloat width = (float)NNApplication::GetInstance()->GetScreenWidth();\n\tfloat height = (float)NNApplication::GetInstance()->GetScreenHeight();\n\t\n\tif ( NNInputSystem::GetInstance()->GetKeyState( VK_UP ) == KEY_DOWN\n\t\t|| NNInputSystem::GetInstance()->GetKeyState( VK_LEFT ) == KEY_DOWN )\n\t{\n\t\t--m_MenuSellction;\n\t}\n\tif ( NNInputSystem::GetInstance()->GetKeyState( VK_DOWN ) == KEY_DOWN\n\t\t|| NNInputSystem::GetInstance()->GetKeyState( VK_RIGHT ) == KEY_DOWN )\n\t{\n\t\t++m_MenuSellction;\n\t}\n\n\tm_MainMenuSellcetionBar->SetPosition( width\/2 + 150.f, height\/2 + 150.f + m_MenuSellction * 50 );\n\n\tm_MenuSellction = ( m_MenuSellction + MENU_EXIT + 1 ) % ( MENU_EXIT + 1);\n\n\tif ( m_MenuSellction == 0 && NNInputSystem::GetInstance()->GetKeyState(VK_RETURN) == KEY_UP )\n\t{\n\t\tNNSceneDirector::GetInstance()->ChangeScene( StoryScene::Create() );\n\t}\n\telse if ( m_MenuSellction == 1 )\n\t{\n\t\t\/\/ exit\n\t}\n}<|endoftext|>"} {"text":"<commit_before>#include <iostream>\n#include <string>\n\n#include \"acmacs-base\/argc-argv.hh\"\n#include \"acmacs-base\/quicklook.hh\"\n#include \"seqdb\/seqdb.hh\"\n\n#include \"signature-page.hh\"\n#include \"settings.hh\"\n\nusing namespace std::string_literals;\n\n\/\/ ----------------------------------------------------------------------\n\nint main(int argc, const char *argv[])\n{\n try {\n argc_argv args(argc, argv, {\n {\"--db-dir\", \"\"},\n {\"--seqdb\", \"\"},\n\n {\"-s\", argc_argv::strings{}}, \/\/value<std::vector<std::string>>(&aOptions.settings_filename), \"signature page drawing settings (json) filename\")\n {\"--init-settings\", \"\"}, \/\/ value<std::string>(&aOptions.init_settings_filename), \"initialize signature page drawing settings (json) filename\")\n {\"--report-cumulative\", false}, \/\/ bool_switch(&aOptions.report_cumulative)->default_value(false), \"report cumulative edge lengths for leaf nodes of the tree\")\n {\"--report-hz-section_antigens\", false}, \/\/ bool_switch(&aOptions.report_antigens_in_hz_sections)->default_value(false), \"report antigens in each hz section\")\n {\"--list-ladderized\", false}, \/\/ bool_switch(&aOptions.list_ladderized)->default_value(false), \"list strain names after ladderizing\")\n {\"--no-draw\", false}, \/\/ bool_switch(&aOptions.no_draw)->default_value(false), \"do not generate pdf\")\n {\"--chart\", \"\"}, \/\/ value<std::string>(&aOptions.chart_filename), \"path to a chart for the signature page\")\n\n {\"--open\", false},\n {\"-v\", false},\n {\"--verbose\", false},\n {\"-h\", false},\n {\"--help\", false},\n });\n\n \/\/ {\"tree\", value<std::string>(&aOptions.tree_filename)->required(), \"path to tree to draw\")\n \/\/ (\"output,o\", value<std::string>(&aOptions.output_filename)->required(), \"output pdf\")\n\n if (args[\"-h\"] || args[\"--help\"] || args.number_of_arguments() != 2) {\n throw std::runtime_error(\"Usage: \"s + args.program() + \" [options] <tree.json> <output.pdf>\\n\" + args.usage_options());\n }\n const bool verbose = args[\"-v\"] || args[\"--verbose\"];\n seqdb::setup_dbs(args[\"--db-dir\"], verbose);\n if (args[\"--seqdb\"])\n seqdb::setup(args[\"--seqdb\"], verbose);\n\n SignaturePageDraw signature_page;\n\n auto load_settings = [&signature_page,verbose](argc_argv::strings aFilenames) {\n for (auto fn: aFilenames) {\n if (verbose)\n std::cerr << \"DEBUG: reading settings from \" << fn << '\\n';\n signature_page.load_settings(fn);\n }\n };\n if (args[\"-s\"])\n load_settings(args[\"-s\"]);\n\n signature_page.tree(args[0]);\n if (args[\"--chart\"])\n signature_page.chart(args[\"--chart\"]); \/\/ before make_surface!\n signature_page.make_surface(args[1], args[\"--init-settings\"], !args[\"--no-draw\"]); \/\/ before init_layout!\n if (args[\"--init-settings\"]) {\n signature_page.init_layout();\n signature_page.init_settings();\n }\n signature_page.prepare();\n if (args[\"--report-cumulative\"])\n signature_page.tree().report_cumulative_edge_length(std::cout);\n if (args[\"--list-ladderized\"])\n signature_page.tree().list_strains(std::cout);\n if (!args[\"--no-draw\"])\n signature_page.draw(args[\"--report-hz-section_antigens\"]);\n if (args[\"--init-settings\"])\n signature_page.write_initialized_settings(args[\"--init-settings\"]);\n\n if (args[\"--open\"])\n acmacs::open(args[1], 2);\n\n return 0;\n }\n catch (std::exception& err) {\n std::cerr << \"ERROR: \" << err.what() << '\\n';\n return 1;\n }\n}\n\n\/\/ ----------------------------------------------------------------------\n\/\/\/ Local Variables:\n\/\/\/ eval: (if (fboundp 'eu-rename-buffer) (eu-rename-buffer))\n\/\/\/ End:\n<commit_msg>minor improvement<commit_after>#include <iostream>\n#include <string>\n\n#include \"acmacs-base\/argc-argv.hh\"\n#include \"acmacs-base\/quicklook.hh\"\n#include \"seqdb\/seqdb.hh\"\n\n#include \"signature-page.hh\"\n#include \"settings.hh\"\n\nusing namespace std::string_literals;\n\n\/\/ ----------------------------------------------------------------------\n\nint main(int argc, const char *argv[])\n{\n try {\n argc_argv args(argc, argv, {\n {\"--db-dir\", \"\"},\n {\"--seqdb\", \"\"},\n\n {\"-s\", argc_argv::strings{}}, \/\/value<std::vector<std::string>>(&aOptions.settings_filename), \"signature page drawing settings (json) filename\")\n {\"--init-settings\", \"\"}, \/\/ value<std::string>(&aOptions.init_settings_filename), \"initialize signature page drawing settings (json) filename\")\n {\"--report-cumulative\", false}, \/\/ bool_switch(&aOptions.report_cumulative)->default_value(false), \"report cumulative edge lengths for leaf nodes of the tree\")\n {\"--report-hz-section_antigens\", false}, \/\/ bool_switch(&aOptions.report_antigens_in_hz_sections)->default_value(false), \"report antigens in each hz section\")\n {\"--list-ladderized\", false}, \/\/ bool_switch(&aOptions.list_ladderized)->default_value(false), \"list strain names after ladderizing\")\n {\"--no-draw\", false}, \/\/ bool_switch(&aOptions.no_draw)->default_value(false), \"do not generate pdf\")\n {\"--chart\", \"\"}, \/\/ value<std::string>(&aOptions.chart_filename), \"path to a chart for the signature page\")\n\n {\"--open\", false},\n {\"-v\", false},\n {\"--verbose\", false},\n {\"-h\", false},\n {\"--help\", false},\n });\n\n \/\/ {\"tree\", value<std::string>(&aOptions.tree_filename)->required(), \"path to tree to draw\")\n \/\/ (\"output,o\", value<std::string>(&aOptions.output_filename)->required(), \"output pdf\")\n\n if (args[\"-h\"] || args[\"--help\"] || args.number_of_arguments() != 2) {\n throw std::runtime_error(\"Usage: \"s + args.program() + \" [options] <tree.json> <output.pdf>\\n\" + args.usage_options());\n }\n const bool verbose = args[\"-v\"] || args[\"--verbose\"];\n seqdb::setup_dbs(args[\"--db-dir\"], verbose);\n if (args[\"--seqdb\"])\n seqdb::setup(args[\"--seqdb\"], verbose);\n\n {\n SignaturePageDraw signature_page;\n\n auto load_settings = [&signature_page,verbose](argc_argv::strings aFilenames) {\n for (auto fn: aFilenames) {\n if (verbose)\n std::cerr << \"DEBUG: reading settings from \" << fn << '\\n';\n signature_page.load_settings(fn);\n }\n };\n if (args[\"-s\"])\n load_settings(args[\"-s\"]);\n\n signature_page.tree(args[0]);\n if (args[\"--chart\"])\n signature_page.chart(args[\"--chart\"]); \/\/ before make_surface!\n signature_page.make_surface(args[1], args[\"--init-settings\"], !args[\"--no-draw\"]); \/\/ before init_layout!\n if (args[\"--init-settings\"]) {\n signature_page.init_layout();\n signature_page.init_settings();\n }\n signature_page.prepare();\n if (args[\"--report-cumulative\"])\n signature_page.tree().report_cumulative_edge_length(std::cout);\n if (args[\"--list-ladderized\"])\n signature_page.tree().list_strains(std::cout);\n if (!args[\"--no-draw\"])\n signature_page.draw(args[\"--report-hz-section_antigens\"]);\n if (args[\"--init-settings\"])\n signature_page.write_initialized_settings(args[\"--init-settings\"]);\n }\n\n if (args[\"--open\"])\n acmacs::open(args[1], 2);\n\n return 0;\n }\n catch (std::exception& err) {\n std::cerr << \"ERROR: \" << err.what() << '\\n';\n return 1;\n }\n}\n\n\/\/ ----------------------------------------------------------------------\n\/\/\/ Local Variables:\n\/\/\/ eval: (if (fboundp 'eu-rename-buffer) (eu-rename-buffer))\n\/\/\/ End:\n<|endoftext|>"} {"text":"<commit_before>#ifndef STAN_MATH_REV_MAT_FUN_TO_VAR_HPP\n#define STAN_MATH_REV_MAT_FUN_TO_VAR_HPP\n\n#include <stan\/math\/rev\/meta.hpp>\n#include <stan\/math\/prim\/mat\/fun\/Eigen.hpp>\n#include <stan\/math\/prim\/mat\/fun\/typedefs.hpp>\n#include <stan\/math\/rev\/core.hpp>\n#include <stan\/math\/rev\/mat\/fun\/typedefs.hpp>\n#include <stan\/math\/rev\/scal\/fun\/to_var.hpp>\n\nnamespace stan {\nnamespace math {\n\n\/**\n * Converts argument to an automatic differentiation variable.\n *\n * Returns a var variable with the input value.\n *\n * @param[in] m A Matrix with scalars\n * @return A Matrix with automatic differentiation variables\n *\/\ninline matrix_v to_var(const matrix_d& m) {\n matrix_v m_v = m;\n return m_v;\n}\n\n\/**\n * Specialization of to_var for non-const matrices of vars\n *\n *\n * @param[in,out] m A matrix of automatic differentation variables.\n * @return The input matrix of automatic differentiation variables.\n *\/\n inline matrix_v& to_var(matrix_v& m) { return m; }\n\n\/**\n * Specialization of to_var for const matrices of vars\n *\n *\n * @param[in,out] m A matrix of automatic differentation variables.\n * @return The input matrix of automatic differentiation variables.\n *\/\ninline const matrix_v& to_var(const matrix_v& m) { return m; }\n\n\/**\n * Converts argument to an automatic differentiation variable.\n *\n * Returns a var variable with the input value.\n *\n * @param[in] v A Vector of scalars\n * @return A Vector of automatic differentiation variables with\n * values of v\n *\/\ninline vector_v to_var(const vector_d& v) {\n vector_v v_v = v;\n return v_v;\n}\n\n\/**\n * Specialization of to_var for const column vector of vars\n *\n *\n * @param[in,out] v A column vector of automatic differentation variables.\n * @return The input column vector of automatic differentiation variables.\n *\/\ninline const vector_v& to_var(const vector_v& v) { return v; }\n\n\/**\n * Specialization of to_var for non-const column vector of vars\n *\n *\n * @param[in,out] v A column vector of automatic differentation variables.\n * @return The input column vector of automatic differentiation variables.\n *\/\ninline vector_v& to_var(vector_v& v) { return v; }\n\n\/**\n * Converts argument to an automatic differentiation variable.\n *\n * Returns a var variable with the input value.\n *\n * @param[in] rv A row vector of scalars\n * @return A row vector of automatic differentation variables with\n * values of rv.\n *\/\ninline row_vector_v to_var(const row_vector_d& rv) {\n row_vector_v rv_v = rv;\n return rv_v;\n}\n\n\/**\n * Specialization of to_var for const row vector of vars\n *\n *\n * @param[in,out] rv A column vector of automatic differentation variables.\n * @return The input row vector of automatic differentiation variables.\n *\/\ninline const row_vector_v& to_var(const row_vector_v& rv) { return rv; }\n\n\/**\n * Specialization of to_var for non-const row vector of vars\n *\n *\n * @param[in,out] rv A column vector of automatic differentation variables.\n * @return The input row vector of automatic differentiation variables.\n *\/\ninline row_vector_v& to_var(row_vector_v& rv) { return rv; }\n\n} \/\/ namespace math\n} \/\/ namespace stan\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_REV_MAT_FUN_TO_VAR_HPP\n#define STAN_MATH_REV_MAT_FUN_TO_VAR_HPP\n\n#include <stan\/math\/rev\/meta.hpp>\n#include <stan\/math\/prim\/mat\/fun\/Eigen.hpp>\n#include <stan\/math\/prim\/mat\/fun\/typedefs.hpp>\n#include <stan\/math\/rev\/core.hpp>\n#include <stan\/math\/rev\/mat\/fun\/typedefs.hpp>\n#include <stan\/math\/rev\/scal\/fun\/to_var.hpp>\n\nnamespace stan {\nnamespace math {\n\n\/**\n * Converts argument to an automatic differentiation variable.\n *\n * Returns a var variable with the input value.\n *\n * @param[in] m A Matrix with scalars\n * @return A Matrix with automatic differentiation variables\n *\/\ninline matrix_v to_var(const matrix_d& m) {\n matrix_v m_v = m;\n return m_v;\n}\n\n\/**\n * Specialization of to_var for non-const matrices of vars\n *\n *\n * @param[in,out] m A matrix of automatic differentation variables.\n * @return The input matrix of automatic differentiation variables.\n *\/\ninline matrix_v& to_var(matrix_v& m) { return m; }\n\n\/**\n * Specialization of to_var for const matrices of vars\n *\n *\n * @param[in,out] m A matrix of automatic differentation variables.\n * @return The input matrix of automatic differentiation variables.\n *\/\ninline const matrix_v& to_var(const matrix_v& m) { return m; }\n\n\/**\n * Converts argument to an automatic differentiation variable.\n *\n * Returns a var variable with the input value.\n *\n * @param[in] v A Vector of scalars\n * @return A Vector of automatic differentiation variables with\n * values of v\n *\/\ninline vector_v to_var(const vector_d& v) {\n vector_v v_v = v;\n return v_v;\n}\n\n\/**\n * Specialization of to_var for const column vector of vars\n *\n *\n * @param[in,out] v A column vector of automatic differentation variables.\n * @return The input column vector of automatic differentiation variables.\n *\/\ninline const vector_v& to_var(const vector_v& v) { return v; }\n\n\/**\n * Specialization of to_var for non-const column vector of vars\n *\n *\n * @param[in,out] v A column vector of automatic differentation variables.\n * @return The input column vector of automatic differentiation variables.\n *\/\ninline vector_v& to_var(vector_v& v) { return v; }\n\n\/**\n * Converts argument to an automatic differentiation variable.\n *\n * Returns a var variable with the input value.\n *\n * @param[in] rv A row vector of scalars\n * @return A row vector of automatic differentation variables with\n * values of rv.\n *\/\ninline row_vector_v to_var(const row_vector_d& rv) {\n row_vector_v rv_v = rv;\n return rv_v;\n}\n\n\/**\n * Specialization of to_var for const row vector of vars\n *\n *\n * @param[in,out] rv A column vector of automatic differentation variables.\n * @return The input row vector of automatic differentiation variables.\n *\/\ninline const row_vector_v& to_var(const row_vector_v& rv) { return rv; }\n\n\/**\n * Specialization of to_var for non-const row vector of vars\n *\n *\n * @param[in,out] rv A column vector of automatic differentation variables.\n * @return The input row vector of automatic differentiation variables.\n *\/\ninline row_vector_v& to_var(row_vector_v& rv) { return rv; }\n\n} \/\/ namespace math\n} \/\/ namespace stan\n#endif\n<|endoftext|>"} {"text":"<commit_before><commit_msg>INTEGRATION: CWS eforms2 (1.2.44); FILE MERGED 2004\/10\/14 10:32:18 dvo 1.2.44.1: resolve merge conflicts<commit_after><|endoftext|>"} {"text":"<commit_before><commit_msg>Fixed fixme: Narrowed include.<commit_after><|endoftext|>"} {"text":"<commit_before>#include \"mitkBoundingObjectGroup.h\"\n#include \"vtkTransform.h\"\n\nmitk::BoundingObjectGroup::BoundingObjectGroup()\n: m_Counter(0), m_CSGMode(Difference) \/\/m_CSGMode(Union) m_CSGMode(Intersection)\n{\n m_Geometry3D->Initialize();\n m_BoundingObjects = mitk::BoundingObjectGroup::BoundingObjectContainer::New();\n SetVtkPolyData(NULL);\n}\n\nmitk::BoundingObjectGroup::~BoundingObjectGroup()\n{\n} \n\nvoid mitk::BoundingObjectGroup::SetRequestedRegionToLargestPossibleRegion()\n{\n}\n\nbool mitk::BoundingObjectGroup::RequestedRegionIsOutsideOfTheBufferedRegion()\n{\n return ! VerifyRequestedRegion();\n}\n\nbool mitk::BoundingObjectGroup::VerifyRequestedRegion()\n{\n assert(m_Geometry3D.IsNotNull());\n return true;\n}\n\nvoid mitk::BoundingObjectGroup::SetRequestedRegion(itk::DataObject *data)\n{\n}\n\nvoid mitk::BoundingObjectGroup::UpdateOutputInformation()\n{ \n float bounds[6]={0,1,0,1,0,1}; \/\/ {xmin,x_max, ymin,y_max,zmin,z_max};\n \n \/\/ calculate global bounding box\n mitk::BoundingObjectGroup::BoundingObjectContainer::ConstIterator boundingObjectsIterator = m_BoundingObjects->Begin();\n const mitk::BoundingObjectGroup::BoundingObjectContainer::ConstIterator boundingObjectsIteratorEnd = m_BoundingObjects->End();\n\n if(boundingObjectsIterator == boundingObjectsIteratorEnd) \/\/ if there is no BoundingObject, the bounding box is zero\n {\n bounds[0] = bounds[1] = bounds[2] = bounds[3] = bounds[4] = bounds[5] = 0.0;\n return; \n }\n mitk::BoundingBox::Pointer boundingBox;\n mitk::BoundingBox::PointType minPoint;\n mitk::BoundingBox::PointType globalMinPoint; \n mitk::BoundingBox::PointType globalMaxPoint;\n float* posPoint;\n\n \/* Initialize globalMin\/MaxPoints *\/\n boundingObjectsIterator.Value()->UpdateOutputInformation();\n boundingBox = const_cast<mitk::BoundingBox*>(boundingObjectsIterator.Value()->GetGeometry()->GetBoundingBox());\n \n minPoint = boundingBox->GetMinimum();\n mitk::ScalarType min[3];\n min[0] = minPoint[0]; min[1] = minPoint[1]; min[2] = minPoint[2];\n boundingObjectsIterator.Value()->GetGeometry()->GetVtkTransform()->TransformPoint(min, min);\n globalMinPoint[0] = min[0]; globalMinPoint[1] = min[1]; globalMinPoint[2] = min[2]; \n globalMaxPoint[0] = min[0]; globalMaxPoint[1] = min[1]; globalMaxPoint[2] = min[2];\n \/\/boundingObjectsIterator++; \n while (boundingObjectsIterator != boundingObjectsIteratorEnd) \/\/ calculate a bounding box that includes all BoundingObjects\n { \n boundingObjectsIterator.Value()->UpdateOutputInformation(); \n boundingBox = const_cast<mitk::BoundingBox*>(boundingObjectsIterator.Value()->GetGeometry()->GetBoundingBox());\n\n \/* create all 8 points of the bounding box *\/\n mitk::BoundingBox::PointsContainerPointer points = mitk::BoundingBox::PointsContainer::New();\n mitk::ITKPoint3D p;\n p = boundingBox->GetMinimum();\n points->InsertElement(0, p);\n p[0] = -p[0];\n points->InsertElement(1, p);\n p = boundingBox->GetMinimum();\n p[1] = -p[1]; \n points->InsertElement(2, p);\n p = boundingBox->GetMinimum();\n p[2] = -p[2]; \n points->InsertElement(3, p);\n p = boundingBox->GetMaximum();\n points->InsertElement(4, p);\n p[0] = -p[0];\n points->InsertElement(5, p);\n p = boundingBox->GetMaximum();\n p[1] = -p[1]; \n points->InsertElement(6, p);\n p = boundingBox->GetMaximum();\n p[2] = -p[2]; \n points->InsertElement(7, p);\n mitk::BoundingBox::PointsContainerConstIterator pointsIterator = points->Begin();\n mitk::BoundingBox::PointsContainerConstIterator pointsIteratorEnd = points->End();\n while (pointsIterator != pointsIteratorEnd) \/\/ for each vertex of the bounding box\n {\n minPoint = pointsIterator->Value();\n min[0] = minPoint[0]; min[1] = minPoint[1]; min[2] = minPoint[2];\n boundingObjectsIterator.Value()->GetGeometry()->GetVtkTransform()->TransformPoint(min, min); \/\/ transform vertex point to world coordinates\n\n globalMinPoint[0] = (min[0] < globalMinPoint[0]) ? min[0] : globalMinPoint[0]; \/\/ check if world point\n globalMinPoint[1] = (min[1] < globalMinPoint[1]) ? min[1] : globalMinPoint[1]; \/\/ has a lower or a\n globalMinPoint[2] = (min[2] < globalMinPoint[2]) ? min[2] : globalMinPoint[2]; \/\/ higher value as\n globalMaxPoint[0] = (min[0] > globalMaxPoint[0]) ? min[0] : globalMaxPoint[0]; \/\/ the last known highest\n globalMaxPoint[1] = (min[1] > globalMaxPoint[1]) ? min[1] : globalMaxPoint[1]; \/\/ value\n globalMaxPoint[2] = (min[2] > globalMaxPoint[2]) ? min[2] : globalMaxPoint[2]; \/\/ in each axis\n pointsIterator++;\n }\n boundingObjectsIterator++;\n }\n\n \/* BoundingBox is centered around the center of all sub bounding objects *\/\n mitk::BoundingBox::PointType centerPoint;\n centerPoint[0] = (globalMinPoint[0] + globalMaxPoint[0])\/ 2.0;\n centerPoint[1] = (globalMinPoint[1] + globalMaxPoint[1])\/ 2.0;\n centerPoint[2] = (globalMinPoint[2] + globalMaxPoint[2])\/ 2.0;\n\n bounds[0] = globalMinPoint[0] - centerPoint[0]; \/\/ x Min\n bounds[1] = globalMaxPoint[0] - centerPoint[0]; \/\/ x Max\n bounds[2] = globalMinPoint[1] - centerPoint[1]; \/\/ y Min\n bounds[3] = globalMaxPoint[1] - centerPoint[1]; \/\/ y Max\n bounds[4] = globalMinPoint[2] - centerPoint[2]; \/\/ z Min\n bounds[5] = globalMaxPoint[2] - centerPoint[2]; \/\/ z Max\n m_Geometry3D->SetBoundingBox(bounds);\n\n \/* the objects position is the center of all sub bounding objects *\/\n m_Geometry3D->GetVtkTransform()->Identity();\n m_Geometry3D->GetVtkTransform()->Translate(centerPoint[0], centerPoint[1], centerPoint[2]);\n \n}\n\nvoid mitk::BoundingObjectGroup::AddBoundingObject(mitk::BoundingObject::Pointer boundingObject)\n{\n m_BoundingObjects->InsertElement( m_Counter++, boundingObject);\n UpdateOutputInformation();\n}\n\nbool mitk::BoundingObjectGroup::IsInside(mitk::ITKPoint3D p)\n{\n mitk::BoundingObjectGroup::BoundingObjectContainer::ConstIterator boundingObjectsIterator = m_BoundingObjects->Begin();\n const mitk::BoundingObjectGroup::BoundingObjectContainer::ConstIterator boundingObjectsIteratorEnd = m_BoundingObjects->End();\n \n bool inside; \/\/ initialize with true for intersection, with false for union\n \n switch(m_CSGMode)\n {\n case Intersection:\n {\n inside = true;\n while (boundingObjectsIterator != boundingObjectsIteratorEnd) \/\/ check each BoundingObject\n { \/\/ calculate intersection: each point, that is inside each BoundingObject is considered inside the group\n inside = boundingObjectsIterator.Value()->IsInside(p) && inside;\n if (!inside) \/\/ shortcut, it is enough to find one object that does not contain the point\n break;\n boundingObjectsIterator++;\n }\n break;\n }\n case Difference:\n {\n bool posInside = false;\n bool negInside = false;\n while (boundingObjectsIterator != boundingObjectsIteratorEnd) \/\/ check each BoundingObject\n {\n \/\/ calculate union: each point, that is inside least one BoundingObject is considered inside the group \n if (boundingObjectsIterator.Value()->GetPositive())\n posInside = boundingObjectsIterator.Value()->IsInside(p) || posInside;\n else\n negInside = boundingObjectsIterator.Value()->IsInside(p) || negInside;\n \n boundingObjectsIterator++;\n }\n if (posInside && !negInside)\n inside = true;\n else\n inside = false;\n break;\n }\n case Union:\n default:\n {\n inside = false;\n while (boundingObjectsIterator != boundingObjectsIteratorEnd) \/\/ check each BoundingObject\n { \/\/ calculate union: each point, that is inside least one BoundingObject is considered inside the group\n inside = boundingObjectsIterator.Value()->IsInside(p) || inside; \n if (inside) \/\/ shortcut, it is enough to find one object that contains the point\n break;\n boundingObjectsIterator++;\n }\n break;\n }\n }\n return inside;\n}\n\nunsigned int mitk::BoundingObjectGroup::GetCount() const\n{\n return m_Counter;\n}\n<commit_msg>code cleanup<commit_after>#include \"mitkBoundingObjectGroup.h\"\n#include \"vtkTransform.h\"\n\nmitk::BoundingObjectGroup::BoundingObjectGroup()\n: m_Counter(0), m_CSGMode(Difference) \/\/m_CSGMode(Union) m_CSGMode(Intersection)\n{\n m_Geometry3D->Initialize();\n m_BoundingObjects = mitk::BoundingObjectGroup::BoundingObjectContainer::New();\n SetVtkPolyData(NULL);\n}\n\nmitk::BoundingObjectGroup::~BoundingObjectGroup()\n{\n} \n\nvoid mitk::BoundingObjectGroup::SetRequestedRegionToLargestPossibleRegion()\n{\n}\n\nbool mitk::BoundingObjectGroup::RequestedRegionIsOutsideOfTheBufferedRegion()\n{\n return ! VerifyRequestedRegion();\n}\n\nbool mitk::BoundingObjectGroup::VerifyRequestedRegion()\n{\n assert(m_Geometry3D.IsNotNull());\n return true;\n}\n\nvoid mitk::BoundingObjectGroup::SetRequestedRegion(itk::DataObject *data)\n{\n}\n\nvoid mitk::BoundingObjectGroup::UpdateOutputInformation()\n{ \n float bounds[6]={0,1,0,1,0,1}; \/\/ {xmin,x_max, ymin,y_max,zmin,z_max};\n \n \/\/ calculate global bounding box\n mitk::BoundingObjectGroup::BoundingObjectContainer::ConstIterator boundingObjectsIterator = m_BoundingObjects->Begin();\n const mitk::BoundingObjectGroup::BoundingObjectContainer::ConstIterator boundingObjectsIteratorEnd = m_BoundingObjects->End();\n\n if(boundingObjectsIterator == boundingObjectsIteratorEnd) \/\/ if there is no BoundingObject, the bounding box is zero\n {\n bounds[0] = bounds[1] = bounds[2] = bounds[3] = bounds[4] = bounds[5] = 0.0;\n return; \n }\n mitk::BoundingBox::Pointer boundingBox;\n mitk::BoundingBox::PointType minPoint;\n mitk::BoundingBox::PointType globalMinPoint; \n mitk::BoundingBox::PointType globalMaxPoint;\n\n \/* Initialize globalMin\/MaxPoints *\/\n boundingObjectsIterator.Value()->UpdateOutputInformation();\n boundingBox = const_cast<mitk::BoundingBox*>(boundingObjectsIterator.Value()->GetGeometry()->GetBoundingBox());\n \n minPoint = boundingBox->GetMinimum();\n mitk::ScalarType min[3];\n min[0] = minPoint[0]; min[1] = minPoint[1]; min[2] = minPoint[2];\n boundingObjectsIterator.Value()->GetGeometry()->GetVtkTransform()->TransformPoint(min, min);\n globalMinPoint[0] = min[0]; globalMinPoint[1] = min[1]; globalMinPoint[2] = min[2]; \n globalMaxPoint[0] = min[0]; globalMaxPoint[1] = min[1]; globalMaxPoint[2] = min[2];\n \/\/boundingObjectsIterator++; \n while (boundingObjectsIterator != boundingObjectsIteratorEnd) \/\/ calculate a bounding box that includes all BoundingObjects\n { \n boundingObjectsIterator.Value()->UpdateOutputInformation(); \n boundingBox = const_cast<mitk::BoundingBox*>(boundingObjectsIterator.Value()->GetGeometry()->GetBoundingBox());\n\n \/* create all 8 points of the bounding box *\/\n mitk::BoundingBox::PointsContainerPointer points = mitk::BoundingBox::PointsContainer::New();\n mitk::ITKPoint3D p;\n p = boundingBox->GetMinimum();\n points->InsertElement(0, p);\n p[0] = -p[0];\n points->InsertElement(1, p);\n p = boundingBox->GetMinimum();\n p[1] = -p[1]; \n points->InsertElement(2, p);\n p = boundingBox->GetMinimum();\n p[2] = -p[2]; \n points->InsertElement(3, p);\n p = boundingBox->GetMaximum();\n points->InsertElement(4, p);\n p[0] = -p[0];\n points->InsertElement(5, p);\n p = boundingBox->GetMaximum();\n p[1] = -p[1]; \n points->InsertElement(6, p);\n p = boundingBox->GetMaximum();\n p[2] = -p[2]; \n points->InsertElement(7, p);\n mitk::BoundingBox::PointsContainerConstIterator pointsIterator = points->Begin();\n mitk::BoundingBox::PointsContainerConstIterator pointsIteratorEnd = points->End();\n while (pointsIterator != pointsIteratorEnd) \/\/ for each vertex of the bounding box\n {\n minPoint = pointsIterator->Value();\n min[0] = minPoint[0]; min[1] = minPoint[1]; min[2] = minPoint[2];\n boundingObjectsIterator.Value()->GetGeometry()->GetVtkTransform()->TransformPoint(min, min); \/\/ transform vertex point to world coordinates\n\n globalMinPoint[0] = (min[0] < globalMinPoint[0]) ? min[0] : globalMinPoint[0]; \/\/ check if world point\n globalMinPoint[1] = (min[1] < globalMinPoint[1]) ? min[1] : globalMinPoint[1]; \/\/ has a lower or a\n globalMinPoint[2] = (min[2] < globalMinPoint[2]) ? min[2] : globalMinPoint[2]; \/\/ higher value as\n globalMaxPoint[0] = (min[0] > globalMaxPoint[0]) ? min[0] : globalMaxPoint[0]; \/\/ the last known highest\n globalMaxPoint[1] = (min[1] > globalMaxPoint[1]) ? min[1] : globalMaxPoint[1]; \/\/ value\n globalMaxPoint[2] = (min[2] > globalMaxPoint[2]) ? min[2] : globalMaxPoint[2]; \/\/ in each axis\n pointsIterator++;\n }\n boundingObjectsIterator++;\n }\n\n \/* BoundingBox is centered around the center of all sub bounding objects *\/\n mitk::BoundingBox::PointType centerPoint;\n centerPoint[0] = (globalMinPoint[0] + globalMaxPoint[0])\/ 2.0;\n centerPoint[1] = (globalMinPoint[1] + globalMaxPoint[1])\/ 2.0;\n centerPoint[2] = (globalMinPoint[2] + globalMaxPoint[2])\/ 2.0;\n\n bounds[0] = globalMinPoint[0] - centerPoint[0]; \/\/ x Min\n bounds[1] = globalMaxPoint[0] - centerPoint[0]; \/\/ x Max\n bounds[2] = globalMinPoint[1] - centerPoint[1]; \/\/ y Min\n bounds[3] = globalMaxPoint[1] - centerPoint[1]; \/\/ y Max\n bounds[4] = globalMinPoint[2] - centerPoint[2]; \/\/ z Min\n bounds[5] = globalMaxPoint[2] - centerPoint[2]; \/\/ z Max\n m_Geometry3D->SetBoundingBox(bounds);\n\n \/* the objects position is the center of all sub bounding objects *\/\n m_Geometry3D->GetVtkTransform()->Identity();\n m_Geometry3D->GetVtkTransform()->Translate(centerPoint[0], centerPoint[1], centerPoint[2]);\n \n}\n\nvoid mitk::BoundingObjectGroup::AddBoundingObject(mitk::BoundingObject::Pointer boundingObject)\n{\n m_BoundingObjects->InsertElement( m_Counter++, boundingObject);\n UpdateOutputInformation();\n}\n\nbool mitk::BoundingObjectGroup::IsInside(mitk::ITKPoint3D p)\n{\n mitk::BoundingObjectGroup::BoundingObjectContainer::ConstIterator boundingObjectsIterator = m_BoundingObjects->Begin();\n const mitk::BoundingObjectGroup::BoundingObjectContainer::ConstIterator boundingObjectsIteratorEnd = m_BoundingObjects->End();\n \n bool inside; \/\/ initialize with true for intersection, with false for union\n \n switch(m_CSGMode)\n {\n case Intersection:\n {\n inside = true;\n while (boundingObjectsIterator != boundingObjectsIteratorEnd) \/\/ check each BoundingObject\n { \/\/ calculate intersection: each point, that is inside each BoundingObject is considered inside the group\n inside = boundingObjectsIterator.Value()->IsInside(p) && inside;\n if (!inside) \/\/ shortcut, it is enough to find one object that does not contain the point\n break;\n boundingObjectsIterator++;\n }\n break;\n }\n case Difference:\n {\n bool posInside = false;\n bool negInside = false;\n while (boundingObjectsIterator != boundingObjectsIteratorEnd) \/\/ check each BoundingObject\n {\n \/\/ calculate union: each point, that is inside least one BoundingObject is considered inside the group \n if (boundingObjectsIterator.Value()->GetPositive())\n posInside = boundingObjectsIterator.Value()->IsInside(p) || posInside;\n else\n negInside = boundingObjectsIterator.Value()->IsInside(p) || negInside;\n \n boundingObjectsIterator++;\n }\n if (posInside && !negInside)\n inside = true;\n else\n inside = false;\n break;\n }\n case Union:\n default:\n {\n inside = false;\n while (boundingObjectsIterator != boundingObjectsIteratorEnd) \/\/ check each BoundingObject\n { \/\/ calculate union: each point, that is inside least one BoundingObject is considered inside the group\n inside = boundingObjectsIterator.Value()->IsInside(p) || inside; \n if (inside) \/\/ shortcut, it is enough to find one object that contains the point\n break;\n boundingObjectsIterator++;\n }\n break;\n }\n }\n return inside;\n}\n\nunsigned int mitk::BoundingObjectGroup::GetCount() const\n{\n return m_Counter;\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 \"main.h\"\n#include \"db.h\"\n#include \"init.h\"\n#include \"freicoinrpc.h\"\n\nusing namespace json_spirit;\nusing namespace std;\n\nValue getgenerate(const Array& params, bool fHelp)\n{\n if (fHelp || params.size() != 0)\n throw runtime_error(\n \"getgenerate\\n\"\n \"Returns true or false.\");\n\n return GetBoolArg(\"-gen\");\n}\n\n\nValue setgenerate(const Array& params, bool fHelp)\n{\n if (fHelp || params.size() < 1 || params.size() > 2)\n throw runtime_error(\n \"setgenerate <generate> [genproclimit]\\n\"\n \"<generate> is true or false to turn generation on or off.\\n\"\n \"Generation is limited to [genproclimit] processors, -1 is unlimited.\");\n\n bool fGenerate = true;\n if (params.size() > 0)\n fGenerate = params[0].get_bool();\n\n if (params.size() > 1)\n {\n int nGenProcLimit = params[1].get_int();\n mapArgs[\"-genproclimit\"] = itostr(nGenProcLimit);\n if (nGenProcLimit == 0)\n fGenerate = false;\n }\n mapArgs[\"-gen\"] = (fGenerate ? \"1\" : \"0\");\n\n GenerateFreicoins(fGenerate, pwalletMain);\n return Value::null;\n}\n\n\nValue gethashespersec(const Array& params, bool fHelp)\n{\n if (fHelp || params.size() != 0)\n throw runtime_error(\n \"gethashespersec\\n\"\n \"Returns a recent hashes per second performance measurement while generating.\");\n\n if (GetTimeMillis() - nHPSTimerStart > 8000)\n return (boost::int64_t)0;\n return (boost::int64_t)dHashesPerSec;\n}\n\n\nValue getmininginfo(const Array& params, bool fHelp)\n{\n if (fHelp || params.size() != 0)\n throw runtime_error(\n \"getmininginfo\\n\"\n \"Returns an object containing mining-related information.\");\n\n Object obj;\n obj.push_back(Pair(\"blocks\", (int)nBestHeight));\n obj.push_back(Pair(\"currentblocksize\",(uint64_t)nLastBlockSize));\n obj.push_back(Pair(\"currentblocktx\",(uint64_t)nLastBlockTx));\n obj.push_back(Pair(\"difficulty\", (double)GetDifficulty()));\n obj.push_back(Pair(\"errors\", GetWarnings(\"statusbar\")));\n obj.push_back(Pair(\"generate\", GetBoolArg(\"-gen\")));\n obj.push_back(Pair(\"genproclimit\", (int)GetArg(\"-genproclimit\", -1)));\n obj.push_back(Pair(\"hashespersec\", gethashespersec(params, false)));\n obj.push_back(Pair(\"pooledtx\", (uint64_t)mempool.size()));\n obj.push_back(Pair(\"testnet\", fTestNet));\n return obj;\n}\n\n\nValue getwork(const Array& params, bool fHelp)\n{\n if (fHelp || params.size() > 1)\n throw runtime_error(\n \"getwork [data]\\n\"\n \"If [data] is not specified, returns formatted hash data to work on:\\n\"\n \" \\\"midstate\\\" : precomputed hash state after hashing the first half of the data (DEPRECATED)\\n\" \/\/ deprecated\n \" \\\"data\\\" : block data\\n\"\n \" \\\"hash1\\\" : formatted hash buffer for second hash (DEPRECATED)\\n\" \/\/ deprecated\n \" \\\"target\\\" : little endian hash target\\n\"\n \"If [data] is specified, tries to solve the block and returns true if it was successful.\");\n\n if (vNodes.empty())\n throw JSONRPCError(RPC_CLIENT_NOT_CONNECTED, \"Freicoin is not connected!\");\n\n if (IsInitialBlockDownload())\n throw JSONRPCError(RPC_CLIENT_IN_INITIAL_DOWNLOAD, \"Freicoin is downloading blocks...\");\n\n typedef map<uint256, pair<CBlock*, CScript> > mapNewBlock_t;\n static mapNewBlock_t mapNewBlock; \/\/ FIXME: thread safety\n static vector<CBlock*> vNewBlock;\n static CReserveKey reservekey(pwalletMain);\n\n if (params.size() == 0)\n {\n \/\/ Update block\n static unsigned int nTransactionsUpdatedLast;\n static CBlockIndex* pindexPrev;\n static int64 nStart;\n static CBlock* pblock;\n if (pindexPrev != pindexBest ||\n (nTransactionsUpdated != nTransactionsUpdatedLast && GetTime() - nStart > 60))\n {\n if (pindexPrev != pindexBest)\n {\n \/\/ Deallocate old blocks since they're obsolete now\n mapNewBlock.clear();\n BOOST_FOREACH(CBlock* pblock, vNewBlock)\n delete pblock;\n vNewBlock.clear();\n }\n\n \/\/ Clear pindexPrev so future getworks make a new block, despite any failures from here on\n pindexPrev = NULL;\n\n \/\/ Store the pindexBest used before CreateNewBlock, to avoid races\n nTransactionsUpdatedLast = nTransactionsUpdated;\n CBlockIndex* pindexPrevNew = pindexBest;\n nStart = GetTime();\n\n \/\/ Create new block\n pblock = CreateNewBlock(reservekey);\n if (!pblock)\n throw JSONRPCError(RPC_OUT_OF_MEMORY, \"Out of memory\");\n vNewBlock.push_back(pblock);\n\n \/\/ Need to update only after we know CreateNewBlock succeeded\n pindexPrev = pindexPrevNew;\n }\n\n \/\/ Update nTime\n pblock->UpdateTime(pindexPrev);\n pblock->nNonce = 0;\n\n \/\/ Update nExtraNonce\n static unsigned int nExtraNonce = 0;\n IncrementExtraNonce(pblock, pindexPrev, nExtraNonce);\n\n \/\/ Save\n mapNewBlock[pblock->hashMerkleRoot] = make_pair(pblock, pblock->vtx[0].vin[0].scriptSig);\n\n \/\/ Pre-build hash buffers\n char pmidstate[32];\n char pdata[128];\n char phash1[64];\n FormatHashBuffers(pblock, pmidstate, pdata, phash1);\n\n uint256 hashTarget = CBigNum().SetCompact(pblock->nBits).getuint256();\n\n Object result;\n result.push_back(Pair(\"midstate\", HexStr(BEGIN(pmidstate), END(pmidstate)))); \/\/ deprecated\n result.push_back(Pair(\"data\", HexStr(BEGIN(pdata), END(pdata))));\n result.push_back(Pair(\"hash1\", HexStr(BEGIN(phash1), END(phash1)))); \/\/ deprecated\n result.push_back(Pair(\"target\", HexStr(BEGIN(hashTarget), END(hashTarget))));\n return result;\n }\n else\n {\n \/\/ Parse parameters\n vector<unsigned char> vchData = ParseHex(params[0].get_str());\n if (vchData.size() != 128)\n throw JSONRPCError(RPC_INVALID_PARAMETER, \"Invalid parameter\");\n CBlock* pdata = (CBlock*)&vchData[0];\n\n \/\/ Byte reverse\n for (int i = 0; i < 128\/4; i++)\n ((unsigned int*)pdata)[i] = ByteReverse(((unsigned int*)pdata)[i]);\n\n \/\/ Get saved block\n if (!mapNewBlock.count(pdata->hashMerkleRoot))\n return false;\n CBlock* pblock = mapNewBlock[pdata->hashMerkleRoot].first;\n\n pblock->nTime = pdata->nTime;\n pblock->nNonce = pdata->nNonce;\n pblock->vtx[0].vin[0].scriptSig = mapNewBlock[pdata->hashMerkleRoot].second;\n pblock->hashMerkleRoot = pblock->BuildMerkleTree();\n\n return CheckWork(pblock, *pwalletMain, reservekey);\n }\n}\n\n\nValue getblocktemplate(const Array& params, bool fHelp)\n{\n if (fHelp || params.size() > 1)\n throw runtime_error(\n \"getblocktemplate [params]\\n\"\n \"Returns data needed to construct a block to work on:\\n\"\n \" \\\"version\\\" : block version\\n\"\n \" \\\"previousblockhash\\\" : hash of current highest block\\n\"\n \" \\\"transactions\\\" : contents of non-coinbase transactions that should be included in the next block\\n\"\n \" \\\"coinbaseaux\\\" : data that should be included in coinbase\\n\"\n \" \\\"coinbasevalue\\\" : maximum allowable input to coinbase transaction, including the generation award and transaction fees\\n\"\n \" \\\"budget\\\" : required outputs of the coinbase transaction\"\n \" \\\"target\\\" : hash target\\n\"\n \" \\\"mintime\\\" : minimum timestamp appropriate for next block\\n\"\n \" \\\"curtime\\\" : current timestamp\\n\"\n \" \\\"mutable\\\" : list of ways the block template may be changed\\n\"\n \" \\\"noncerange\\\" : range of valid nonces\\n\"\n \" \\\"sigoplimit\\\" : limit of sigops in blocks\\n\"\n \" \\\"sizelimit\\\" : limit of block size\\n\"\n \" \\\"bits\\\" : compressed target of next block\\n\"\n \" \\\"height\\\" : height of the next block\\n\"\n \"See https:\/\/en.bitcoin.it\/wiki\/BIP_0022 for full specification.\");\n\n std::string strMode = \"template\";\n if (params.size() > 0)\n {\n const Object& oparam = params[0].get_obj();\n const Value& modeval = find_value(oparam, \"mode\");\n if (modeval.type() == str_type)\n strMode = modeval.get_str();\n else if (modeval.type() == null_type)\n {\n \/* Do nothing *\/\n }\n else\n throw JSONRPCError(RPC_INVALID_PARAMETER, \"Invalid mode\");\n }\n\n if (strMode != \"template\")\n throw JSONRPCError(RPC_INVALID_PARAMETER, \"Invalid mode\");\n\n if (vNodes.empty())\n throw JSONRPCError(RPC_CLIENT_NOT_CONNECTED, \"Freicoin is not connected!\");\n\n if (IsInitialBlockDownload())\n throw JSONRPCError(RPC_CLIENT_IN_INITIAL_DOWNLOAD, \"Freicoin is downloading blocks...\");\n\n static CReserveKey reservekey(pwalletMain);\n\n \/\/ Update block\n static unsigned int nTransactionsUpdatedLast;\n static CBlockIndex* pindexPrev;\n static int64 nStart;\n static CBlock* pblock;\n if (pindexPrev != pindexBest ||\n (nTransactionsUpdated != nTransactionsUpdatedLast && GetTime() - nStart > 5))\n {\n \/\/ Clear pindexPrev so future calls make a new block, despite any failures from here on\n pindexPrev = NULL;\n\n \/\/ Store the pindexBest used before CreateNewBlock, to avoid races\n nTransactionsUpdatedLast = nTransactionsUpdated;\n CBlockIndex* pindexPrevNew = pindexBest;\n nStart = GetTime();\n\n \/\/ Create new block\n if(pblock)\n {\n delete pblock;\n pblock = NULL;\n }\n pblock = CreateNewBlock(reservekey);\n if (!pblock)\n throw JSONRPCError(RPC_OUT_OF_MEMORY, \"Out of memory\");\n\n \/\/ Need to update only after we know CreateNewBlock succeeded\n pindexPrev = pindexPrevNew;\n }\n\n \/\/ Update nTime\n pblock->UpdateTime(pindexPrev);\n pblock->nNonce = 0;\n\n Array transactions;\n map<uint256, int64_t> setTxIndex;\n int i = 0;\n CTxDB txdb(\"r\");\n BOOST_FOREACH (CTransaction& tx, pblock->vtx)\n {\n uint256 txHash = tx.GetHash();\n setTxIndex[txHash] = i++;\n\n if (tx.IsCoinBase())\n continue;\n\n Object entry;\n\n CDataStream ssTx(SER_NETWORK, PROTOCOL_VERSION);\n ssTx << tx;\n entry.push_back(Pair(\"data\", HexStr(ssTx.begin(), ssTx.end())));\n\n entry.push_back(Pair(\"hash\", txHash.GetHex()));\n\n MapPrevTx mapInputs;\n map<uint256, CTxIndex> mapUnused;\n bool fInvalid = false;\n if (tx.FetchInputs(txdb, mapUnused, false, false, mapInputs, fInvalid))\n {\n mpq nFee = tx.GetValueIn(mapInputs) - tx.GetValueOut();\n entry.push_back(Pair(\"fee\", FormatMoney(nFee)));\n\n Array deps;\n BOOST_FOREACH (MapPrevTx::value_type& inp, mapInputs)\n {\n if (setTxIndex.count(inp.first))\n deps.push_back(setTxIndex[inp.first]);\n }\n entry.push_back(Pair(\"depends\", deps));\n\n int64_t nSigOps = tx.GetLegacySigOpCount();\n nSigOps += tx.GetP2SHSigOpCount(mapInputs);\n entry.push_back(Pair(\"sigops\", nSigOps));\n }\n\n transactions.push_back(entry);\n }\n\n Object aux;\n aux.push_back(Pair(\"flags\", HexStr(COINBASE_FLAGS.begin(), COINBASE_FLAGS.end())));\n\n uint256 hashTarget = CBigNum().SetCompact(pblock->nBits).getuint256();\n\n static Array aMutable;\n if (aMutable.empty())\n {\n aMutable.push_back(\"time\");\n aMutable.push_back(\"transactions\");\n aMutable.push_back(\"prevblock\");\n }\n\n Object result;\n result.push_back(Pair(\"version\", pblock->nVersion));\n result.push_back(Pair(\"previousblockhash\", pblock->hashPrevBlock.GetHex()));\n result.push_back(Pair(\"transactions\", transactions));\n result.push_back(Pair(\"coinbaseaux\", aux));\n Array aBudget;\n BOOST_FOREACH(const CTxOut& txout, pblock->vtx[0].vout) {\n if ( txout != pblock->vtx[0].vout[0] ) {\n Object entry;\n CTxDestination addr;\n if ( ExtractDestination(txout.scriptPubKey, addr) )\n entry.push_back(Pair(\"address\", CFreicoinAddress(addr).ToString()));\n else\n entry.push_back(Pair(\"script\", txout.scriptPubKey.ToString()));\n entry.push_back(Pair(\"value\", (int64_t)txout.nValue));\n aBudget.push_back(entry);\n }\n }\n result.push_back(Pair(\"coinbasevalue\", (int64_t)pblock->vtx[0].vout[0].nValue));\n result.push_back(Pair(\"budget\", aBudget));\n result.push_back(Pair(\"target\", hashTarget.GetHex()));\n result.push_back(Pair(\"mintime\", (int64_t)pindexPrev->GetMedianTimePast()+1));\n result.push_back(Pair(\"mutable\", aMutable));\n result.push_back(Pair(\"noncerange\", \"00000000ffffffff\"));\n result.push_back(Pair(\"sigoplimit\", (int64_t)MAX_BLOCK_SIGOPS));\n result.push_back(Pair(\"sizelimit\", (int64_t)MAX_BLOCK_SIZE));\n result.push_back(Pair(\"curtime\", (int64_t)pblock->nTime));\n result.push_back(Pair(\"bits\", HexBits(pblock->nBits)));\n result.push_back(Pair(\"height\", (int64_t)(pindexPrev->nHeight+1)));\n\n return result;\n}\n\nValue submitblock(const Array& params, bool fHelp)\n{\n if (fHelp || params.size() < 1 || params.size() > 2)\n throw runtime_error(\n \"submitblock <hex data> [optional-params-obj]\\n\"\n \"[optional-params-obj] parameter is currently ignored.\\n\"\n \"Attempts to submit new block to network.\\n\"\n \"See https:\/\/en.bitcoin.it\/wiki\/BIP_0022 for full specification.\");\n\n vector<unsigned char> blockData(ParseHex(params[0].get_str()));\n CDataStream ssBlock(blockData, SER_NETWORK, PROTOCOL_VERSION);\n CBlock block;\n try {\n ssBlock >> block;\n }\n catch (std::exception &e) {\n throw JSONRPCError(RPC_DESERIALIZATION_ERROR, \"Block decode failed\");\n }\n\n bool fAccepted = ProcessBlock(NULL, &block);\n if (!fAccepted)\n return \"rejected\";\n\n return Value::null;\n}\n\n<commit_msg>Restructure output of 'budget' entry to match the output of the various gettransaction calls.<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 \"main.h\"\n#include \"db.h\"\n#include \"init.h\"\n#include \"freicoinrpc.h\"\n\nusing namespace json_spirit;\nusing namespace std;\n\nextern void ScriptPubKeyToJSON(const CScript& scriptPubKey, Object& out);\n\nValue getgenerate(const Array& params, bool fHelp)\n{\n if (fHelp || params.size() != 0)\n throw runtime_error(\n \"getgenerate\\n\"\n \"Returns true or false.\");\n\n return GetBoolArg(\"-gen\");\n}\n\n\nValue setgenerate(const Array& params, bool fHelp)\n{\n if (fHelp || params.size() < 1 || params.size() > 2)\n throw runtime_error(\n \"setgenerate <generate> [genproclimit]\\n\"\n \"<generate> is true or false to turn generation on or off.\\n\"\n \"Generation is limited to [genproclimit] processors, -1 is unlimited.\");\n\n bool fGenerate = true;\n if (params.size() > 0)\n fGenerate = params[0].get_bool();\n\n if (params.size() > 1)\n {\n int nGenProcLimit = params[1].get_int();\n mapArgs[\"-genproclimit\"] = itostr(nGenProcLimit);\n if (nGenProcLimit == 0)\n fGenerate = false;\n }\n mapArgs[\"-gen\"] = (fGenerate ? \"1\" : \"0\");\n\n GenerateFreicoins(fGenerate, pwalletMain);\n return Value::null;\n}\n\n\nValue gethashespersec(const Array& params, bool fHelp)\n{\n if (fHelp || params.size() != 0)\n throw runtime_error(\n \"gethashespersec\\n\"\n \"Returns a recent hashes per second performance measurement while generating.\");\n\n if (GetTimeMillis() - nHPSTimerStart > 8000)\n return (boost::int64_t)0;\n return (boost::int64_t)dHashesPerSec;\n}\n\n\nValue getmininginfo(const Array& params, bool fHelp)\n{\n if (fHelp || params.size() != 0)\n throw runtime_error(\n \"getmininginfo\\n\"\n \"Returns an object containing mining-related information.\");\n\n Object obj;\n obj.push_back(Pair(\"blocks\", (int)nBestHeight));\n obj.push_back(Pair(\"currentblocksize\",(uint64_t)nLastBlockSize));\n obj.push_back(Pair(\"currentblocktx\",(uint64_t)nLastBlockTx));\n obj.push_back(Pair(\"difficulty\", (double)GetDifficulty()));\n obj.push_back(Pair(\"errors\", GetWarnings(\"statusbar\")));\n obj.push_back(Pair(\"generate\", GetBoolArg(\"-gen\")));\n obj.push_back(Pair(\"genproclimit\", (int)GetArg(\"-genproclimit\", -1)));\n obj.push_back(Pair(\"hashespersec\", gethashespersec(params, false)));\n obj.push_back(Pair(\"pooledtx\", (uint64_t)mempool.size()));\n obj.push_back(Pair(\"testnet\", fTestNet));\n return obj;\n}\n\n\nValue getwork(const Array& params, bool fHelp)\n{\n if (fHelp || params.size() > 1)\n throw runtime_error(\n \"getwork [data]\\n\"\n \"If [data] is not specified, returns formatted hash data to work on:\\n\"\n \" \\\"midstate\\\" : precomputed hash state after hashing the first half of the data (DEPRECATED)\\n\" \/\/ deprecated\n \" \\\"data\\\" : block data\\n\"\n \" \\\"hash1\\\" : formatted hash buffer for second hash (DEPRECATED)\\n\" \/\/ deprecated\n \" \\\"target\\\" : little endian hash target\\n\"\n \"If [data] is specified, tries to solve the block and returns true if it was successful.\");\n\n if (vNodes.empty())\n throw JSONRPCError(RPC_CLIENT_NOT_CONNECTED, \"Freicoin is not connected!\");\n\n if (IsInitialBlockDownload())\n throw JSONRPCError(RPC_CLIENT_IN_INITIAL_DOWNLOAD, \"Freicoin is downloading blocks...\");\n\n typedef map<uint256, pair<CBlock*, CScript> > mapNewBlock_t;\n static mapNewBlock_t mapNewBlock; \/\/ FIXME: thread safety\n static vector<CBlock*> vNewBlock;\n static CReserveKey reservekey(pwalletMain);\n\n if (params.size() == 0)\n {\n \/\/ Update block\n static unsigned int nTransactionsUpdatedLast;\n static CBlockIndex* pindexPrev;\n static int64 nStart;\n static CBlock* pblock;\n if (pindexPrev != pindexBest ||\n (nTransactionsUpdated != nTransactionsUpdatedLast && GetTime() - nStart > 60))\n {\n if (pindexPrev != pindexBest)\n {\n \/\/ Deallocate old blocks since they're obsolete now\n mapNewBlock.clear();\n BOOST_FOREACH(CBlock* pblock, vNewBlock)\n delete pblock;\n vNewBlock.clear();\n }\n\n \/\/ Clear pindexPrev so future getworks make a new block, despite any failures from here on\n pindexPrev = NULL;\n\n \/\/ Store the pindexBest used before CreateNewBlock, to avoid races\n nTransactionsUpdatedLast = nTransactionsUpdated;\n CBlockIndex* pindexPrevNew = pindexBest;\n nStart = GetTime();\n\n \/\/ Create new block\n pblock = CreateNewBlock(reservekey);\n if (!pblock)\n throw JSONRPCError(RPC_OUT_OF_MEMORY, \"Out of memory\");\n vNewBlock.push_back(pblock);\n\n \/\/ Need to update only after we know CreateNewBlock succeeded\n pindexPrev = pindexPrevNew;\n }\n\n \/\/ Update nTime\n pblock->UpdateTime(pindexPrev);\n pblock->nNonce = 0;\n\n \/\/ Update nExtraNonce\n static unsigned int nExtraNonce = 0;\n IncrementExtraNonce(pblock, pindexPrev, nExtraNonce);\n\n \/\/ Save\n mapNewBlock[pblock->hashMerkleRoot] = make_pair(pblock, pblock->vtx[0].vin[0].scriptSig);\n\n \/\/ Pre-build hash buffers\n char pmidstate[32];\n char pdata[128];\n char phash1[64];\n FormatHashBuffers(pblock, pmidstate, pdata, phash1);\n\n uint256 hashTarget = CBigNum().SetCompact(pblock->nBits).getuint256();\n\n Object result;\n result.push_back(Pair(\"midstate\", HexStr(BEGIN(pmidstate), END(pmidstate)))); \/\/ deprecated\n result.push_back(Pair(\"data\", HexStr(BEGIN(pdata), END(pdata))));\n result.push_back(Pair(\"hash1\", HexStr(BEGIN(phash1), END(phash1)))); \/\/ deprecated\n result.push_back(Pair(\"target\", HexStr(BEGIN(hashTarget), END(hashTarget))));\n return result;\n }\n else\n {\n \/\/ Parse parameters\n vector<unsigned char> vchData = ParseHex(params[0].get_str());\n if (vchData.size() != 128)\n throw JSONRPCError(RPC_INVALID_PARAMETER, \"Invalid parameter\");\n CBlock* pdata = (CBlock*)&vchData[0];\n\n \/\/ Byte reverse\n for (int i = 0; i < 128\/4; i++)\n ((unsigned int*)pdata)[i] = ByteReverse(((unsigned int*)pdata)[i]);\n\n \/\/ Get saved block\n if (!mapNewBlock.count(pdata->hashMerkleRoot))\n return false;\n CBlock* pblock = mapNewBlock[pdata->hashMerkleRoot].first;\n\n pblock->nTime = pdata->nTime;\n pblock->nNonce = pdata->nNonce;\n pblock->vtx[0].vin[0].scriptSig = mapNewBlock[pdata->hashMerkleRoot].second;\n pblock->hashMerkleRoot = pblock->BuildMerkleTree();\n\n return CheckWork(pblock, *pwalletMain, reservekey);\n }\n}\n\n\nValue getblocktemplate(const Array& params, bool fHelp)\n{\n if (fHelp || params.size() > 1)\n throw runtime_error(\n \"getblocktemplate [params]\\n\"\n \"Returns data needed to construct a block to work on:\\n\"\n \" \\\"version\\\" : block version\\n\"\n \" \\\"previousblockhash\\\" : hash of current highest block\\n\"\n \" \\\"transactions\\\" : contents of non-coinbase transactions that should be included in the next block\\n\"\n \" \\\"coinbaseaux\\\" : data that should be included in coinbase\\n\"\n \" \\\"coinbasevalue\\\" : maximum allowable input to coinbase transaction, including the generation award and transaction fees\\n\"\n \" \\\"budget\\\" : required outputs of the coinbase transaction\"\n \" \\\"target\\\" : hash target\\n\"\n \" \\\"mintime\\\" : minimum timestamp appropriate for next block\\n\"\n \" \\\"curtime\\\" : current timestamp\\n\"\n \" \\\"mutable\\\" : list of ways the block template may be changed\\n\"\n \" \\\"noncerange\\\" : range of valid nonces\\n\"\n \" \\\"sigoplimit\\\" : limit of sigops in blocks\\n\"\n \" \\\"sizelimit\\\" : limit of block size\\n\"\n \" \\\"bits\\\" : compressed target of next block\\n\"\n \" \\\"height\\\" : height of the next block\\n\"\n \"See https:\/\/en.bitcoin.it\/wiki\/BIP_0022 for full specification.\");\n\n std::string strMode = \"template\";\n if (params.size() > 0)\n {\n const Object& oparam = params[0].get_obj();\n const Value& modeval = find_value(oparam, \"mode\");\n if (modeval.type() == str_type)\n strMode = modeval.get_str();\n else if (modeval.type() == null_type)\n {\n \/* Do nothing *\/\n }\n else\n throw JSONRPCError(RPC_INVALID_PARAMETER, \"Invalid mode\");\n }\n\n if (strMode != \"template\")\n throw JSONRPCError(RPC_INVALID_PARAMETER, \"Invalid mode\");\n\n if (vNodes.empty())\n throw JSONRPCError(RPC_CLIENT_NOT_CONNECTED, \"Freicoin is not connected!\");\n\n if (IsInitialBlockDownload())\n throw JSONRPCError(RPC_CLIENT_IN_INITIAL_DOWNLOAD, \"Freicoin is downloading blocks...\");\n\n static CReserveKey reservekey(pwalletMain);\n\n \/\/ Update block\n static unsigned int nTransactionsUpdatedLast;\n static CBlockIndex* pindexPrev;\n static int64 nStart;\n static CBlock* pblock;\n if (pindexPrev != pindexBest ||\n (nTransactionsUpdated != nTransactionsUpdatedLast && GetTime() - nStart > 5))\n {\n \/\/ Clear pindexPrev so future calls make a new block, despite any failures from here on\n pindexPrev = NULL;\n\n \/\/ Store the pindexBest used before CreateNewBlock, to avoid races\n nTransactionsUpdatedLast = nTransactionsUpdated;\n CBlockIndex* pindexPrevNew = pindexBest;\n nStart = GetTime();\n\n \/\/ Create new block\n if(pblock)\n {\n delete pblock;\n pblock = NULL;\n }\n pblock = CreateNewBlock(reservekey);\n if (!pblock)\n throw JSONRPCError(RPC_OUT_OF_MEMORY, \"Out of memory\");\n\n \/\/ Need to update only after we know CreateNewBlock succeeded\n pindexPrev = pindexPrevNew;\n }\n\n \/\/ Update nTime\n pblock->UpdateTime(pindexPrev);\n pblock->nNonce = 0;\n\n Array transactions;\n map<uint256, int64_t> setTxIndex;\n int i = 0;\n CTxDB txdb(\"r\");\n BOOST_FOREACH (CTransaction& tx, pblock->vtx)\n {\n uint256 txHash = tx.GetHash();\n setTxIndex[txHash] = i++;\n\n if (tx.IsCoinBase())\n continue;\n\n Object entry;\n\n CDataStream ssTx(SER_NETWORK, PROTOCOL_VERSION);\n ssTx << tx;\n entry.push_back(Pair(\"data\", HexStr(ssTx.begin(), ssTx.end())));\n\n entry.push_back(Pair(\"hash\", txHash.GetHex()));\n\n MapPrevTx mapInputs;\n map<uint256, CTxIndex> mapUnused;\n bool fInvalid = false;\n if (tx.FetchInputs(txdb, mapUnused, false, false, mapInputs, fInvalid))\n {\n mpq nFee = tx.GetValueIn(mapInputs) - tx.GetValueOut();\n entry.push_back(Pair(\"fee\", FormatMoney(nFee)));\n\n Array deps;\n BOOST_FOREACH (MapPrevTx::value_type& inp, mapInputs)\n {\n if (setTxIndex.count(inp.first))\n deps.push_back(setTxIndex[inp.first]);\n }\n entry.push_back(Pair(\"depends\", deps));\n\n int64_t nSigOps = tx.GetLegacySigOpCount();\n nSigOps += tx.GetP2SHSigOpCount(mapInputs);\n entry.push_back(Pair(\"sigops\", nSigOps));\n }\n\n transactions.push_back(entry);\n }\n\n Object aux;\n aux.push_back(Pair(\"flags\", HexStr(COINBASE_FLAGS.begin(), COINBASE_FLAGS.end())));\n\n uint256 hashTarget = CBigNum().SetCompact(pblock->nBits).getuint256();\n\n static Array aMutable;\n if (aMutable.empty())\n {\n aMutable.push_back(\"time\");\n aMutable.push_back(\"transactions\");\n aMutable.push_back(\"prevblock\");\n }\n\n Object result;\n result.push_back(Pair(\"version\", pblock->nVersion));\n result.push_back(Pair(\"previousblockhash\", pblock->hashPrevBlock.GetHex()));\n result.push_back(Pair(\"transactions\", transactions));\n result.push_back(Pair(\"coinbaseaux\", aux));\n Array aBudget;\n BOOST_FOREACH(const CTxOut& txout, pblock->vtx[0].vout) {\n if ( txout != pblock->vtx[0].vout[0] ) {\n Object entry, script;\n ScriptPubKeyToJSON(txout.scriptPubKey, script);\n entry.push_back(Pair(\"scriptPubKey\", script));\n entry.push_back(Pair(\"value\", (int64_t)txout.nValue));\n aBudget.push_back(entry);\n }\n }\n result.push_back(Pair(\"coinbasevalue\", (int64_t)pblock->vtx[0].vout[0].nValue));\n result.push_back(Pair(\"budget\", aBudget));\n result.push_back(Pair(\"target\", hashTarget.GetHex()));\n result.push_back(Pair(\"mintime\", (int64_t)pindexPrev->GetMedianTimePast()+1));\n result.push_back(Pair(\"mutable\", aMutable));\n result.push_back(Pair(\"noncerange\", \"00000000ffffffff\"));\n result.push_back(Pair(\"sigoplimit\", (int64_t)MAX_BLOCK_SIGOPS));\n result.push_back(Pair(\"sizelimit\", (int64_t)MAX_BLOCK_SIZE));\n result.push_back(Pair(\"curtime\", (int64_t)pblock->nTime));\n result.push_back(Pair(\"bits\", HexBits(pblock->nBits)));\n result.push_back(Pair(\"height\", (int64_t)(pindexPrev->nHeight+1)));\n\n return result;\n}\n\nValue submitblock(const Array& params, bool fHelp)\n{\n if (fHelp || params.size() < 1 || params.size() > 2)\n throw runtime_error(\n \"submitblock <hex data> [optional-params-obj]\\n\"\n \"[optional-params-obj] parameter is currently ignored.\\n\"\n \"Attempts to submit new block to network.\\n\"\n \"See https:\/\/en.bitcoin.it\/wiki\/BIP_0022 for full specification.\");\n\n vector<unsigned char> blockData(ParseHex(params[0].get_str()));\n CDataStream ssBlock(blockData, SER_NETWORK, PROTOCOL_VERSION);\n CBlock block;\n try {\n ssBlock >> block;\n }\n catch (std::exception &e) {\n throw JSONRPCError(RPC_DESERIALIZATION_ERROR, \"Block decode failed\");\n }\n\n bool fAccepted = ProcessBlock(NULL, &block);\n if (!fAccepted)\n return \"rejected\";\n\n return Value::null;\n}\n\n<|endoftext|>"} {"text":"<commit_before>{\n \/\/\n \/\/ This macro displays the physical ROOT file structure\n \/\/\n gROOT->Reset();\n c1 = new TCanvas(\"c1\",\"ROOT File description\",200,10,700,550);\n\n c1->Range(0,-0.25,21,14);\n TPaveLabel title(5,12,15,13.7,c1->GetTitle());\n title.SetFillColor(16);\n title.Draw();\n\n \/\/ horizonthal file layout\n TPave file(1,8.5,20,11);\n file.SetFillColor(11);\n file.Draw();\n TPave fileh(1,8.5,2.5,11);\n fileh.SetFillColor(44);\n fileh.Draw();\n TPave lrh(2.5,8.5,3.3,11,1);\n lrh.SetFillColor(33);\n lrh.Draw();\n lrh.DrawPave(6.9,8.5,7.7,11,1);\n lrh.DrawPave(10.5,8.5,11.3,11,1);\n lrh.DrawPave(14.5,8.5,15.3,11,1);\n TLine ldot(1,8.5,0.5,6.5);\n ldot.SetLineStyle(2);\n ldot.Draw();\n ldot.DrawLine(2.5, 8.5, 9.4, 6.5);\n ldot.DrawLine(10.5, 8.5, 10, 6.5);\n ldot.DrawLine(11.3, 8.5, 19.5, 6.5);\n TLine line(2.6,11,2.6,11.5);\n line.Draw();\n line.DrawLine(2.6,11.5,7,11.5);\n TArrow arrow(7,11.5,7,11.1,0.01,\"|>\");\n arrow.SetFillStyle(1001);\n arrow.Draw();\n line.DrawLine( 7, 8.5, 7, 8.0);\n line.DrawLine( 7, 8.0, 10.6, 8);\n arrow.DrawArrow( 10.6,8, 10.6, 8.4,0.01,\"|>\");\n line.DrawLine( 10.6, 11, 10.6, 11.5);\n line.DrawLine( 10.6, 11.5, 14.6, 11.5);\n arrow.DrawArrow( 14.6,11.5, 14.6,11.1,0.01,\"|>\");\n line.DrawLine( 14.6, 8.5, 14.6, 8.0);\n line.DrawLine( 14.6, 8.0, 16, 8);\n ldot.DrawLine(16, 8, 19, 8);\n TText vert(1.5,9.75,\"File\");\n vert.SetTextAlign(21);\n vert.SetTextAngle(90);\n vert.SetTextSize(0.025);\n vert.Draw();\n vert.DrawText(2.0, 9.75,\"Header\");\n vert.DrawText(2.9, 9.75,\"Logical Record\");\n vert.DrawText(3.2, 9.75,\"Header\");\n vert.DrawText(7.3, 9.75,\"Logical Record\");\n vert.DrawText(7.6, 9.75,\"Header\");\n vert.DrawText(10.9,9.75,\"Logical Record\");\n vert.DrawText(11.2,9.75,\"Header\");\n vert.DrawText(14.9,9.75,\"Logical Record\");\n vert.DrawText(15.2,9.75,\"Header\");\n TText hori(4.75,10,\"Object\");\n hori.SetTextAlign(22);\n hori.SetTextSize(0.035);\n hori.Draw();\n hori.DrawText(4.75, 9.5,\"Data\");\n hori.DrawText(9.2, 10,\"Deleted\");\n hori.DrawText(9.2, 9.5,\"Object\");\n line.DrawLine( 6.9, 8.5, 10.5, 11);\n line.DrawLine( 6.9, 11, 10.5, 8.5);\n TText tbig(17,9.75,\"............\");\n tbig.SetTextAlign(22);\n tbig.SetTextSize(0.03);\n tbig.Draw();\n tbig.DrawText(2.6, 7, \"fBEGIN\");\n tbig.DrawText(20., 7, \"fEND\");\n arrow.DrawArrow( 2.6,7, 2.6,8.4,0.01,\"|>\");\n arrow.DrawArrow( 20,7, 20,8.4,0.01,\"|>\");\n\n \/\/file header\n TPaveText header(0.5,.2,9.4,6.5);\n header.SetFillColor(44);\n header.Draw();\n TText *fh=header.AddText(\"File Header\");\n fh->SetTextAlign(23);\n fh->SetTextSize(0.04);\n header.SetTextSize(0.027);\n header.SetTextAlign(12);\n header.AddText(\" \");\n header.AddLine(0,0,0,0);\n header.AddText(\"\\\"root\\\": Root File Identifier\");\n header.AddText(\"fVersion: File version identifier\");\n header.AddText(\"fBEGIN: Pointer to first data record\");\n header.AddText(\"fEND: Pointer to first free word at EOF\");\n header.AddText(\"fSeekFree: Pointer to FREE data record\");\n header.AddText(\"fNbytesFree: Number of bytes in FREE\");\n header.AddText(\"fNfree: Number of free data records\");\n header.AddText(\"fNbytesName: Number of bytes in name\/title\");\n header.AddText(\"fUnits: Number of bytes for pointers\");\n header.AddText(\"fCompress: Compression level\");\n\n \/\/logical record header\n TPaveText lrecord(10,0.2,19.5,6.5);\n lrecord.SetFillColor(33);\n lrecord.Draw();\n TText *tlrh=lrecord.AddText(\"Logical Record Header (TKEY)\");\n tlrh->SetTextAlign(23);\n tlrh->SetTextSize(0.04);\n lrecord.SetTextSize(0.027);\n lrecord.SetTextAlign(12);\n lrecord.AddText(\" \");\n lrecord.AddLine(0,0,0,0);\n lrecord.AddText(\"fNbytes: Length of compressed object\");\n lrecord.AddText(\"fVersion: Key version identifier\");\n lrecord.AddText(\"fObjLen: Length of uncompressed object\");\n lrecord.AddText(\"fDatime: Date\/Time when written to store\");\n lrecord.AddText(\"fKeylen: Number of bytes for the key\");\n lrecord.AddText(\"fCycle : Cycle number\");\n lrecord.AddText(\"fSeekKey: Pointer to object on file\");\n lrecord.AddText(\"fSeekPdir: Pointer to directory on file\");\n lrecord.AddText(\"fClassName: class name of the object\");\n lrecord.AddText(\"fName: name of the object\");\n lrecord.AddText(\"fTitle: title of the object\");\n\n c1->Update();\n}\n<commit_msg>header text was not properly placed (showed more clearly with new TTF implementation). By Olivier.<commit_after>{\n \/\/\n \/\/ This macro displays the physical ROOT file structure\n \/\/\n gROOT->Reset();\n c1 = new TCanvas(\"c1\",\"ROOT File description\",200,10,700,550);\n\n c1->Range(0,-0.25,21,14);\n TPaveLabel title(5,12,15,13.7,c1->GetTitle());\n title.SetFillColor(16);\n title.Draw();\n\n \/\/ horizonthal file layout\n TPave file(1,8.5,20,11);\n file.SetFillColor(11);\n file.Draw();\n TPave fileh(1,8.5,2.5,11);\n fileh.SetFillColor(44);\n fileh.Draw();\n TPave lrh(2.5,8.5,3.3,11,1);\n lrh.SetFillColor(33);\n lrh.Draw();\n lrh.DrawPave(6.9,8.5,7.7,11,1);\n lrh.DrawPave(10.5,8.5,11.3,11,1);\n lrh.DrawPave(14.5,8.5,15.3,11,1);\n TLine ldot(1,8.5,0.5,6.5);\n ldot.SetLineStyle(2);\n ldot.Draw();\n ldot.DrawLine(2.5, 8.5, 9.4, 6.5);\n ldot.DrawLine(10.5, 8.5, 10, 6.5);\n ldot.DrawLine(11.3, 8.5, 19.5, 6.5);\n TLine line(2.6,11,2.6,11.5);\n line.Draw();\n line.DrawLine(2.6,11.5,7,11.5);\n TArrow arrow(7,11.5,7,11.1,0.01,\"|>\");\n arrow.SetFillStyle(1001);\n arrow.Draw();\n line.DrawLine( 7, 8.5, 7, 8.0);\n line.DrawLine( 7, 8.0, 10.6, 8);\n arrow.DrawArrow( 10.6,8, 10.6, 8.4,0.01,\"|>\");\n line.DrawLine( 10.6, 11, 10.6, 11.5);\n line.DrawLine( 10.6, 11.5, 14.6, 11.5);\n arrow.DrawArrow( 14.6,11.5, 14.6,11.1,0.01,\"|>\");\n line.DrawLine( 14.6, 8.5, 14.6, 8.0);\n line.DrawLine( 14.6, 8.0, 16, 8);\n ldot.DrawLine(16, 8, 19, 8);\n TText vert(1.5,9.75,\"File\");\n vert.SetTextAlign(21);\n vert.SetTextAngle(90);\n vert.SetTextSize(0.025);\n vert.Draw();\n vert.DrawText(2.0, 9.75,\"Header\");\n vert.DrawText(2.9, 9.75,\"Logical Record\");\n vert.DrawText(3.2, 9.75,\"Header\");\n vert.DrawText(7.3, 9.75,\"Logical Record\");\n vert.DrawText(7.6, 9.75,\"Header\");\n vert.DrawText(10.9,9.75,\"Logical Record\");\n vert.DrawText(11.2,9.75,\"Header\");\n vert.DrawText(14.9,9.75,\"Logical Record\");\n vert.DrawText(15.2,9.75,\"Header\");\n TText hori(4.75,10,\"Object\");\n hori.SetTextAlign(22);\n hori.SetTextSize(0.035);\n hori.Draw();\n hori.DrawText(4.75, 9.5,\"Data\");\n hori.DrawText(9.2, 10,\"Deleted\");\n hori.DrawText(9.2, 9.5,\"Object\");\n line.DrawLine( 6.9, 8.5, 10.5, 11);\n line.DrawLine( 6.9, 11, 10.5, 8.5);\n TText tbig(17,9.75,\"............\");\n tbig.SetTextAlign(22);\n tbig.SetTextSize(0.03);\n tbig.Draw();\n tbig.DrawText(2.6, 7, \"fBEGIN\");\n tbig.DrawText(20., 7, \"fEND\");\n arrow.DrawArrow( 2.6,7, 2.6,8.4,0.01,\"|>\");\n arrow.DrawArrow( 20,7, 20,8.4,0.01,\"|>\");\n\n \/\/file header\n TPaveText header(0.5,.2,9.4,6.5);\n header.SetFillColor(44);\n header.Draw();\n TText *fh=header.AddText(\"File Header\");\n fh->SetTextAlign(22);\n fh->SetTextSize(0.04);\n header.SetTextSize(0.027);\n header.SetTextAlign(12);\n header.AddText(\" \");\n header.AddLine(0,0,0,0);\n header.AddText(\"\\\"root\\\": Root File Identifier\");\n header.AddText(\"fVersion: File version identifier\");\n header.AddText(\"fBEGIN: Pointer to first data record\");\n header.AddText(\"fEND: Pointer to first free word at EOF\");\n header.AddText(\"fSeekFree: Pointer to FREE data record\");\n header.AddText(\"fNbytesFree: Number of bytes in FREE\");\n header.AddText(\"fNfree: Number of free data records\");\n header.AddText(\"fNbytesName: Number of bytes in name\/title\");\n header.AddText(\"fUnits: Number of bytes for pointers\");\n header.AddText(\"fCompress: Compression level\");\n\n \/\/logical record header\n TPaveText lrecord(10,0.2,19.5,6.5);\n lrecord.SetFillColor(33);\n lrecord.Draw();\n TText *tlrh=lrecord.AddText(\"Logical Record Header (TKEY)\");\n tlrh->SetTextAlign(22);\n tlrh->SetTextSize(0.04);\n lrecord.SetTextSize(0.027);\n lrecord.SetTextAlign(12);\n lrecord.AddText(\" \");\n lrecord.AddLine(0,0,0,0);\n lrecord.AddText(\"fNbytes: Length of compressed object\");\n lrecord.AddText(\"fVersion: Key version identifier\");\n lrecord.AddText(\"fObjLen: Length of uncompressed object\");\n lrecord.AddText(\"fDatime: Date\/Time when written to store\");\n lrecord.AddText(\"fKeylen: Number of bytes for the key\");\n lrecord.AddText(\"fCycle : Cycle number\");\n lrecord.AddText(\"fSeekKey: Pointer to object on file\");\n lrecord.AddText(\"fSeekPdir: Pointer to directory on file\");\n lrecord.AddText(\"fClassName: class name of the object\");\n lrecord.AddText(\"fName: name of the object\");\n lrecord.AddText(\"fTitle: title of the object\");\n\n c1->Update();\n}\n<|endoftext|>"} {"text":"<commit_before>\/**\n * \\ file GainCompressorFilter.cpp\n *\/\n\n#include <ATK\/Dynamic\/GainCompressorFilter.h>\n\n#include <ATK\/Core\/InPointerFilter.h>\n#include <ATK\/Core\/OutPointerFilter.h>\n\n#define BOOST_TEST_DYN_LINK\n#define BOOST_TEST_NO_MAIN\n#include <boost\/test\/unit_test.hpp>\n\n#include <boost\/math\/constants\/constants.hpp>\n\n#define PROCESSSIZE (64)\n\nBOOST_AUTO_TEST_CASE( GainCompressorFilter_const_1_test )\n{\n std::array<float, PROCESSSIZE> data;\n for(ptrdiff_t i = 0; i < PROCESSSIZE; ++i)\n {\n data[i] = 1;\n }\n \n ATK::InPointerFilter<float> generator(data.data(), 1, PROCESSSIZE, false);\n generator.set_output_sampling_rate(48000);\n\n std::array<float, PROCESSSIZE> outdata;\n\n ATK::GainFilter<ATK::GainCompressorFilter<float>> filter(1);\n filter.set_input_sampling_rate(48000);\n filter.set_input_port(0, &generator, 0);\n filter.set_threshold(10);\n\n ATK::OutPointerFilter<float> output(outdata.data(), 1, PROCESSSIZE, false);\n output.set_input_sampling_rate(48000);\n output.set_input_port(0, &filter, 0);\n\n output.process(PROCESSSIZE);\n \n for(ptrdiff_t i = 0; i < PROCESSSIZE; ++i)\n {\n BOOST_REQUIRE_CLOSE(1, outdata[i], 0.1);\n }\n}\n\nBOOST_AUTO_TEST_CASE( GainCompressorFilter_const_0_test )\n{\n std::array<float, PROCESSSIZE> data;\n for(ptrdiff_t i = 0; i < PROCESSSIZE; ++i)\n {\n data[i] = 0;\n }\n\n ATK::InPointerFilter<float> generator(data.data(), 1, PROCESSSIZE, false);\n generator.set_output_sampling_rate(48000);\n\n std::array<float, PROCESSSIZE> outdata;\n\n ATK::GainFilter<ATK::GainCompressorFilter<float>> filter(1);\n filter.set_input_sampling_rate(48000);\n filter.set_input_port(0, &generator, 0);\n\n ATK::OutPointerFilter<float> output(outdata.data(), 1, PROCESSSIZE, false);\n output.set_input_sampling_rate(48000);\n output.set_input_port(0, &filter, 0);\n\n output.process(PROCESSSIZE);\n\n for(ptrdiff_t i = 0; i < PROCESSSIZE; ++i)\n {\n BOOST_REQUIRE_CLOSE(1, outdata[i], 0.1); \/\/ if input is zero, we still need a gain of 1 to have a progression of 1 for values < threshold\n }\n}\n\nBOOST_AUTO_TEST_CASE( GainCompressorFilter_const_1_threshold_05_ratio_2_test )\n{\n std::array<float, PROCESSSIZE> data;\n for(ptrdiff_t i = 0; i < PROCESSSIZE; ++i)\n {\n data[i] = 1;\n }\n\n ATK::InPointerFilter<float> generator(data.data(), 1, PROCESSSIZE, false);\n generator.set_output_sampling_rate(48000);\n\n std::array<float, PROCESSSIZE> outdata;\n\n ATK::GainFilter<ATK::GainCompressorFilter<float>> filter(1);\n filter.set_input_sampling_rate(48000);\n filter.set_input_port(0, &generator, 0);\n filter.set_threshold(0.5);\n filter.set_ratio(2);\n filter.set_softness(1);\n\n ATK::OutPointerFilter<float> output(outdata.data(), 1, PROCESSSIZE, false);\n output.set_input_sampling_rate(48000);\n output.set_input_port(0, &filter, 0);\n\n output.process(PROCESSSIZE);\n\n for(ptrdiff_t i = 0; i < PROCESSSIZE; ++i)\n {\n BOOST_REQUIRE_CLOSE(0.836990654, outdata[i], 0.1);\n }\n}\n\nBOOST_AUTO_TEST_CASE( GainCompressorFilter_const_1_threshold_05_ratio_4_test )\n{\n std::array<float, PROCESSSIZE> data;\n for(ptrdiff_t i = 0; i < PROCESSSIZE; ++i)\n {\n data[i] = 1;\n }\n\n ATK::InPointerFilter<float> generator(data.data(), 1, PROCESSSIZE, false);\n generator.set_output_sampling_rate(48000);\n\n std::array<float, PROCESSSIZE> outdata;\n\n ATK::GainFilter<ATK::GainCompressorFilter<float>> filter(1);\n filter.set_input_sampling_rate(48000);\n filter.set_input_port(0, &generator, 0);\n filter.set_threshold(0.5);\n filter.set_ratio(4);\n filter.set_softness(1);\n\n ATK::OutPointerFilter<float> output(outdata.data(), 1, PROCESSSIZE, false);\n output.set_input_sampling_rate(48000);\n output.set_input_port(0, &filter, 0);\n\n output.process(PROCESSSIZE);\n\n for(ptrdiff_t i = 0; i < PROCESSSIZE; ++i)\n {\n BOOST_REQUIRE_CLOSE(0.765739262, outdata[i], 0.1);\n }\n}\n<commit_msg>Adding tests for threshold and ratio<commit_after>\/**\n * \\ file GainCompressorFilter.cpp\n *\/\n\n#include <ATK\/Dynamic\/GainCompressorFilter.h>\n\n#include <ATK\/Core\/InPointerFilter.h>\n#include <ATK\/Core\/OutPointerFilter.h>\n\n#define BOOST_TEST_DYN_LINK\n#define BOOST_TEST_NO_MAIN\n#include <boost\/test\/unit_test.hpp>\n\n#include <boost\/math\/constants\/constants.hpp>\n\nconst size_t PROCESSSIZE = 64;\n\nBOOST_AUTO_TEST_CASE( GainFilter_threshold_test )\n{\n ATK::GainFilter<ATK::GainCompressorFilter<float>> filter;\n filter.set_threshold(10);\n BOOST_CHECK_EQUAL(filter.get_threshold(), 10);\n}\n\nBOOST_AUTO_TEST_CASE( GainFilter_threshold_db_test )\n{\n ATK::GainFilter<ATK::GainCompressorFilter<float>> filter;\n filter.set_threshold_db(20);\n BOOST_CHECK_EQUAL(filter.get_threshold(), 100);\n}\n\nBOOST_AUTO_TEST_CASE( GainFilter_threshold_range_test )\n{\n ATK::GainFilter<ATK::GainCompressorFilter<float>> filter;\n BOOST_CHECK_THROW(filter.set_threshold(0), std::out_of_range);\n}\n\nBOOST_AUTO_TEST_CASE( GainFilter_ratio_test )\n{\n ATK::GainFilter<ATK::GainCompressorFilter<float>> filter;\n filter.set_ratio(10);\n BOOST_CHECK_EQUAL(filter.get_ratio(), 10);\n}\n\nBOOST_AUTO_TEST_CASE( GainFilter_ratio_range_test )\n{\n ATK::GainFilter<ATK::GainCompressorFilter<float>> filter;\n BOOST_CHECK_THROW(filter.set_ratio(0), std::out_of_range);\n}\n\nBOOST_AUTO_TEST_CASE( GainCompressorFilter_const_1_test )\n{\n std::array<float, PROCESSSIZE> data;\n for(ptrdiff_t i = 0; i < PROCESSSIZE; ++i)\n {\n data[i] = 1;\n }\n \n ATK::InPointerFilter<float> generator(data.data(), 1, PROCESSSIZE, false);\n generator.set_output_sampling_rate(48000);\n\n std::array<float, PROCESSSIZE> outdata;\n\n ATK::GainFilter<ATK::GainCompressorFilter<float>> filter;\n filter.set_input_sampling_rate(48000);\n filter.set_input_port(0, &generator, 0);\n filter.set_threshold(10);\n\n ATK::OutPointerFilter<float> output(outdata.data(), 1, PROCESSSIZE, false);\n output.set_input_sampling_rate(48000);\n output.set_input_port(0, &filter, 0);\n\n output.process(PROCESSSIZE);\n \n for(ptrdiff_t i = 0; i < PROCESSSIZE; ++i)\n {\n BOOST_REQUIRE_CLOSE(1, outdata[i], 0.1);\n }\n}\n\nBOOST_AUTO_TEST_CASE( GainCompressorFilter_const_0_test )\n{\n std::array<float, PROCESSSIZE> data;\n for(ptrdiff_t i = 0; i < PROCESSSIZE; ++i)\n {\n data[i] = 0;\n }\n\n ATK::InPointerFilter<float> generator(data.data(), 1, PROCESSSIZE, false);\n generator.set_output_sampling_rate(48000);\n\n std::array<float, PROCESSSIZE> outdata;\n\n ATK::GainFilter<ATK::GainCompressorFilter<float>> filter(1);\n filter.set_input_sampling_rate(48000);\n filter.set_input_port(0, &generator, 0);\n\n ATK::OutPointerFilter<float> output(outdata.data(), 1, PROCESSSIZE, false);\n output.set_input_sampling_rate(48000);\n output.set_input_port(0, &filter, 0);\n\n output.process(PROCESSSIZE);\n\n for(ptrdiff_t i = 0; i < PROCESSSIZE; ++i)\n {\n BOOST_REQUIRE_CLOSE(1, outdata[i], 0.1); \/\/ if input is zero, we still need a gain of 1 to have a progression of 1 for values < threshold\n }\n}\n\nBOOST_AUTO_TEST_CASE( GainCompressorFilter_const_1_threshold_05_ratio_2_test )\n{\n std::array<float, PROCESSSIZE> data;\n for(ptrdiff_t i = 0; i < PROCESSSIZE; ++i)\n {\n data[i] = 1;\n }\n\n ATK::InPointerFilter<float> generator(data.data(), 1, PROCESSSIZE, false);\n generator.set_output_sampling_rate(48000);\n\n std::array<float, PROCESSSIZE> outdata;\n\n ATK::GainFilter<ATK::GainCompressorFilter<float>> filter(1);\n filter.set_input_sampling_rate(48000);\n filter.set_input_port(0, &generator, 0);\n filter.set_threshold(0.5);\n filter.set_ratio(2);\n filter.set_softness(1);\n\n ATK::OutPointerFilter<float> output(outdata.data(), 1, PROCESSSIZE, false);\n output.set_input_sampling_rate(48000);\n output.set_input_port(0, &filter, 0);\n\n output.process(PROCESSSIZE);\n\n for(ptrdiff_t i = 0; i < PROCESSSIZE; ++i)\n {\n BOOST_REQUIRE_CLOSE(0.836990654, outdata[i], 0.1);\n }\n}\n\nBOOST_AUTO_TEST_CASE( GainCompressorFilter_const_1_threshold_05_ratio_4_test )\n{\n std::array<float, PROCESSSIZE> data;\n for(ptrdiff_t i = 0; i < PROCESSSIZE; ++i)\n {\n data[i] = 1;\n }\n\n ATK::InPointerFilter<float> generator(data.data(), 1, PROCESSSIZE, false);\n generator.set_output_sampling_rate(48000);\n\n std::array<float, PROCESSSIZE> outdata;\n\n ATK::GainFilter<ATK::GainCompressorFilter<float>> filter(1);\n filter.set_input_sampling_rate(48000);\n filter.set_input_port(0, &generator, 0);\n filter.set_threshold(0.5);\n filter.set_ratio(4);\n filter.set_softness(1);\n\n ATK::OutPointerFilter<float> output(outdata.data(), 1, PROCESSSIZE, false);\n output.set_input_sampling_rate(48000);\n output.set_input_port(0, &filter, 0);\n\n output.process(PROCESSSIZE);\n\n for(ptrdiff_t i = 0; i < PROCESSSIZE; ++i)\n {\n BOOST_REQUIRE_CLOSE(0.765739262, outdata[i], 0.1);\n }\n}\n<|endoftext|>"} {"text":"<commit_before>\/*=========================================================================\n\n Program: Insight Segmentation & Registration Toolkit\n Module: CellularSegmentation1.cxx\n Language: C++\n Date: $Date$\n Version: $Revision$\n\n Copyright (c) Insight Software Consortium. All rights reserved.\n See ITKCopyright.txt or http:\/\/www.itk.org\/HTML\/Copyright.htm for details.\n\n This software is distributed WITHOUT ANY WARRANTY; without even \n the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR \n PURPOSE. See the above copyright notices for more information.\n\n=========================================================================*\/\n\n\/\/ Software Guide : BeginLatex\n\/\/\n\/\/ \\index{itk::bio::CellularAggregate}\n\/\/\n\/\/ The following example illustrates the use of Cellular Algorithms for performing image segmentation.\n\/\/ Cellular algorithms are implemented by combining the following classes \n\/\/\n\/\/ \\subdoxygen{bio}{CellularAggregate}\n\/\/ \\subdoxygen{bio}{Cell}\n\/\/\n\/\/\n\/\/ Software Guide : EndLatex \n\n\n\/\/ Software Guide : BeginCodeSnippet\n#include \"itkBioCellularAggregate.h\"\n#include \"itkBioCell.h\"\n\/\/ Software Guide : EndCodeSnippet\n\n\n#include \"itkImage.h\"\n#include \"itkImageFileReader.h\"\n\n\nint main( int argc, char *argv[] )\n{\n if( argc < 7 )\n {\n std::cerr << \"Missing Parameters \" << std::endl;\n std::cerr << \"Usage: \" << argv[0];\n std::cerr << \" inputImage seedX seedY lowThreshold highThreshold iterations\" << std::endl;\n return 1;\n }\n\n\n \/\/ Software Guide : BeginLatex\n \/\/ \n \/\/ We now define the image type using a pixel type and a particular\n \/\/ dimension. In this case the \\code{float} type is used for the pixels due\n \/\/ to the requirements of the smoothing filter. \n \/\/\n \/\/ Software Guide : EndLatex \n\n \/\/ Software Guide : BeginCodeSnippet\n typedef float InternalPixelType;\n const unsigned int Dimension = 2;\n typedef itk::Image< InternalPixelType, Dimension > ImageType;\n \/\/ Software Guide : EndCodeSnippet\n\n\n \/\/ Software Guide : BeginLatex\n \/\/ \n \/\/ The \\subdoxygen{bio}{CellularAggregate} class must be instantiated using\n \/\/ the dimension of the image to be segmented.\n \/\/\n \/\/ Software Guide : EndLatex \n\n \/\/ Software Guide : BeginCodeSnippet\n typedef itk::bio::CellularAggregate< Dimension > CellularAggregateType;\n typedef CellularAggregateType::BioCellType CellType;\n \/\/ Software Guide : EndCodeSnippet\n\n\n \/\/ Software Guide : BeginLatex\n \/\/ \n \/\/ Then an object of this class can be constructed by invoking the\n \/\/ \\code{New} operator and receiving the result in a \\code{SmartPointer},\n \/\/\n \/\/ Software Guide : EndLatex \n\n \/\/ Software Guide : BeginCodeSnippet\n CellularAggregateType::Pointer cellularAggregate = CellularAggregateType::New();\n \/\/ Software Guide : EndCodeSnippet\n\n\n\n\n \/\/ We instantiate reader and writer types\n typedef itk::ImageFileReader< ImageType > ReaderType;\n ReaderType::Pointer reader = ReaderType::New();\n reader->SetFileName( argv[1] );\n\n try\n {\n reader->Update();\n }\n catch( itk::ExceptionObject & excep )\n {\n std::cerr << \"Exception caught !\" << std::endl;\n std::cerr << excep << std::endl;\n }\n\n \/\/ Software Guide : BeginLatex\n \/\/ \n \/\/ The CellularAggregate considers the image as a chemical substrate in\n \/\/ which the Cells are going to develop. The intensity values of the image\n \/\/ will influence the behavior of the Cells, in particular they will\n \/\/ intervine to regulate the Cell Cycle. A Cellular Aggregate could be\n \/\/ gathering information from several images simultaneously, in this context\n \/\/ each image can bee seen as a map of concentration of a particular\n \/\/ chemical compound. The set of images will describe the chemical\n \/\/ composition of the extra cellular matrix.\n \/\/\n \/\/ Software Guide : EndLatex \n\n \/\/ Software Guide : BeginCodeSnippet\n cellularAggregate->AddSubstrate( reader->GetOutput() );\n \/\/ Software Guide : EndCodeSnippet\n\n\n\n \/\/ Software Guide : BeginLatex\n \/\/\n \/\/ The initialization of the algorithm requires the user to provide a seed\n \/\/ point. It is convenient to select this point to be placed in a\n \/\/ \\emph{typical} region of the anatomical structure to be segmented. A\n \/\/ small neighborhood around the seed point will be used to compute the\n \/\/ initial mean and standard deviation for the inclusion criterion. The\n \/\/ seed is passed in the form of a \\doxygen{Index} to the \\code{SetSeed()}\n \/\/ method.\n \/\/\n \/\/ \\index{itk::ConfidenceConnectedImageFilter!SetSeed()}\n \/\/ \\index{itk::ConfidenceConnectedImageFilter!SetInitialNeighborhoodRadius()}\n \/\/\n \/\/ Software Guide : EndLatex \n\n ImageType::IndexType index;\n \n index[0] = atoi( argv[2] );\n index[1] = atoi( argv[3] );\n\n CellType::PointType position;\n\n reader->GetOutput()->TransformIndexToPhysicalPoint( index, position );\n\n\n \/\/ Software Guide : BeginLatex\n \/\/\n \/\/ Individual Cell do not derive from the \\doxygen{Object} class in order to\n \/\/ avoid the penalties of Mutex operations when passing pointers to them.\n \/\/ The Creation of a new cell is done by invoking the normal \\code{new}\n \/\/ operator. \n \/\/ \n \/\/ \\index{itk::bio::Cell!Creation}\n \/\/ \\index{itk::bio::Cell!pointer}\n \/\/\n \/\/ Software Guide : EndLatex \n\n \/\/ Software Guide : BeginCodeSnippet\n CellType * egg = new CellType;\n \/\/ Software Guide : EndCodeSnippet\n\n\n \/\/ Software Guide : BeginLatex\n \/\/\n \/\/ In this particular example, the Cell cycle is going to be controled\n \/\/ mostly by the intensity values of the image. These values are asimilated\n \/\/ to concentrations of a particular chemical compound. Cell will feel\n \/\/ compfortable at when the concentration of this chemical is inside a\n \/\/ particular range. In this circumstances cells will be able to\n \/\/ proliferate. When the chemical concentration is out of the range, cell\n \/\/ will not enter their division stage and will anchor to the cellular\n \/\/ matrix. The values defining this range can be set by invoking the methods\n \/\/ \\code{SetChemoAttractantHighThreshold} and\n \/\/ \\code{SetChemoAttractantLowThreshold). These to methods are static and\n \/\/ set the values to be used by all the cells.\n \/\/ \n \/\/ \\index{itk::bio::Cell!SetChemoAttractantLowThreshold}\n \/\/ \\index{itk::bio::Cell!SetChemoAttractantHighThreshold}\n \/\/\n \/\/ Software Guide : EndLatex \n\n \/\/ Software Guide : BeginCodeSnippet\n CellType::SetChemoAttractantLowThreshold( atof( argv[4] ) );\n CellType::SetChemoAttractantHighThreshold( atof( argv[5] ) );\n \/\/ Software Guide : EndCodeSnippet\n \n\n \/\/ Software Guide : BeginLatex\n \/\/\n \/\/ The newly created Cell is passed to the \\code{CellularAggregate} object\n \/\/ that will take care of controling the development of the cells.\n \/\/ \n \/\/ \\index{itk::bio::CellularAggregate!SetEgg}\n \/\/\n \/\/ Software Guide : EndLatex \n\n \/\/ Software Guide : BeginCodeSnippet\n cellularAggregate->SetEgg( egg, position );\n \/\/ Software Guide : EndCodeSnippet\n \n \/\/ Software Guide : BeginLatex\n \/\/\n \/\/ The CellularAggregate will update the life cycle of all the cells in an\n \/\/ iterative way. The User must select how many iterations to run.\n \/\/ CellularAlgorithms can in principle run forever. It is up to the User to\n \/\/ define an stopping criterion. One of the simplest options is to set a\n \/\/ limit to the number of iterations, by invoking the AdvanceTimeStep()\n \/\/ method inside a for loop. \n \/\/ \n \/\/ \\index{itk::bio::CellularAggregate!SetEgg}\n \/\/\n \/\/ Software Guide : EndLatex \n\n \/\/ Software Guide : BeginCodeSnippet\n unsigned int numberOfIterations = atoi( argv[6] );\n\n for(unsigned int i=0; i<numberOfIterations; i++)\n {\n cellularAggregate->AdvanceTimeStep();\n }\n \/\/ Software Guide : EndCodeSnippet\n\n\n return 0;\n}\n\n\n\n\n<commit_msg>BUG: Cells should only be created by CreateEgg() (only one), the Cellular Aggregate takes care of replication. The Cell() constructor is now protected in order to enforce this rule.<commit_after>\/*=========================================================================\n\n Program: Insight Segmentation & Registration Toolkit\n Module: CellularSegmentation1.cxx\n Language: C++\n Date: $Date$\n Version: $Revision$\n\n Copyright (c) Insight Software Consortium. All rights reserved.\n See ITKCopyright.txt or http:\/\/www.itk.org\/HTML\/Copyright.htm for details.\n\n This software is distributed WITHOUT ANY WARRANTY; without even \n the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR \n PURPOSE. See the above copyright notices for more information.\n\n=========================================================================*\/\n\n\/\/ Software Guide : BeginLatex\n\/\/\n\/\/ \\index{itk::bio::CellularAggregate}\n\/\/\n\/\/ The following example illustrates the use of Cellular Algorithms for performing image segmentation.\n\/\/ Cellular algorithms are implemented by combining the following classes \n\/\/\n\/\/ \\subdoxygen{bio}{CellularAggregate}\n\/\/ \\subdoxygen{bio}{Cell}\n\/\/\n\/\/\n\/\/ Software Guide : EndLatex \n\n\n\/\/ Software Guide : BeginCodeSnippet\n#include \"itkBioCellularAggregate.h\"\n#include \"itkBioCell.h\"\n\/\/ Software Guide : EndCodeSnippet\n\n\n#include \"itkImage.h\"\n#include \"itkImageFileReader.h\"\n\n\nint main( int argc, char *argv[] )\n{\n if( argc < 7 )\n {\n std::cerr << \"Missing Parameters \" << std::endl;\n std::cerr << \"Usage: \" << argv[0];\n std::cerr << \" inputImage seedX seedY lowThreshold highThreshold iterations\" << std::endl;\n return 1;\n }\n\n\n \/\/ Software Guide : BeginLatex\n \/\/ \n \/\/ We now define the image type using a pixel type and a particular\n \/\/ dimension. In this case the \\code{float} type is used for the pixels due\n \/\/ to the requirements of the smoothing filter. \n \/\/\n \/\/ Software Guide : EndLatex \n\n \/\/ Software Guide : BeginCodeSnippet\n typedef float InternalPixelType;\n const unsigned int Dimension = 2;\n typedef itk::Image< InternalPixelType, Dimension > ImageType;\n \/\/ Software Guide : EndCodeSnippet\n\n\n \/\/ Software Guide : BeginLatex\n \/\/ \n \/\/ The \\subdoxygen{bio}{CellularAggregate} class must be instantiated using\n \/\/ the dimension of the image to be segmented.\n \/\/\n \/\/ Software Guide : EndLatex \n\n \/\/ Software Guide : BeginCodeSnippet\n typedef itk::bio::CellularAggregate< Dimension > CellularAggregateType;\n typedef CellularAggregateType::BioCellType CellType;\n \/\/ Software Guide : EndCodeSnippet\n\n\n \/\/ Software Guide : BeginLatex\n \/\/ \n \/\/ Then an object of this class can be constructed by invoking the\n \/\/ \\code{New} operator and receiving the result in a \\code{SmartPointer},\n \/\/\n \/\/ Software Guide : EndLatex \n\n \/\/ Software Guide : BeginCodeSnippet\n CellularAggregateType::Pointer cellularAggregate = CellularAggregateType::New();\n \/\/ Software Guide : EndCodeSnippet\n\n\n\n\n \/\/ We instantiate reader and writer types\n typedef itk::ImageFileReader< ImageType > ReaderType;\n ReaderType::Pointer reader = ReaderType::New();\n reader->SetFileName( argv[1] );\n\n std::cout << \"Filename = \" << argv[1] << std::endl;\n\n try\n {\n reader->Update();\n }\n catch( itk::ExceptionObject & excep )\n {\n std::cerr << \"Exception caught !\" << std::endl;\n std::cerr << excep << std::endl;\n }\n\n \/\/ Software Guide : BeginLatex\n \/\/ \n \/\/ The CellularAggregate considers the image as a chemical substrate in\n \/\/ which the Cells are going to develop. The intensity values of the image\n \/\/ will influence the behavior of the Cells, in particular they will\n \/\/ intervine to regulate the Cell Cycle. A Cellular Aggregate could be\n \/\/ gathering information from several images simultaneously, in this context\n \/\/ each image can bee seen as a map of concentration of a particular\n \/\/ chemical compound. The set of images will describe the chemical\n \/\/ composition of the extra cellular matrix.\n \/\/\n \/\/ Software Guide : EndLatex \n\n \/\/ Software Guide : BeginCodeSnippet\n cellularAggregate->AddSubstrate( reader->GetOutput() );\n \/\/ Software Guide : EndCodeSnippet\n\n\n\n \/\/ Software Guide : BeginLatex\n \/\/\n \/\/ The initialization of the algorithm requires the user to provide a seed\n \/\/ point. It is convenient to select this point to be placed in a\n \/\/ \\emph{typical} region of the anatomical structure to be segmented. A\n \/\/ small neighborhood around the seed point will be used to compute the\n \/\/ initial mean and standard deviation for the inclusion criterion. The\n \/\/ seed is passed in the form of a \\doxygen{Index} to the \\code{SetSeed()}\n \/\/ method.\n \/\/\n \/\/ \\index{itk::ConfidenceConnectedImageFilter!SetSeed()}\n \/\/ \\index{itk::ConfidenceConnectedImageFilter!SetInitialNeighborhoodRadius()}\n \/\/\n \/\/ Software Guide : EndLatex \n\n ImageType::IndexType index;\n \n index[0] = atoi( argv[2] );\n index[1] = atoi( argv[3] );\n\n CellType::PointType position;\n\n reader->GetOutput()->TransformIndexToPhysicalPoint( index, position );\n\n std::cout << \"Egg position index = \" << index << std::endl;\n std::cout << \"Egg position point = \" << position << std::endl;\n\n \/\/ Software Guide : BeginLatex\n \/\/\n \/\/ Individual Cell do not derive from the \\doxygen{Object} class in order to\n \/\/ avoid the penalties of Mutex operations when passing pointers to them.\n \/\/ The Creation of a new cell is done by invoking the normal \\code{new}\n \/\/ operator. \n \/\/ \n \/\/ \\index{itk::bio::Cell!Creation}\n \/\/ \\index{itk::bio::Cell!pointer}\n \/\/\n \/\/ Software Guide : EndLatex \n\n \/\/ Software Guide : BeginCodeSnippet\n CellType * egg = CellType::CreateEgg();\n \/\/ Software Guide : EndCodeSnippet\n\n\n \/\/ Software Guide : BeginLatex\n \/\/\n \/\/ In this particular example, the Cell cycle is going to be controled\n \/\/ mostly by the intensity values of the image. These values are asimilated\n \/\/ to concentrations of a particular chemical compound. Cell will feel\n \/\/ compfortable at when the concentration of this chemical is inside a\n \/\/ particular range. In this circumstances cells will be able to\n \/\/ proliferate. When the chemical concentration is out of the range, cell\n \/\/ will not enter their division stage and will anchor to the cellular\n \/\/ matrix. The values defining this range can be set by invoking the methods\n \/\/ \\code{SetChemoAttractantHighThreshold} and\n \/\/ \\code{SetChemoAttractantLowThreshold). These to methods are static and\n \/\/ set the values to be used by all the cells.\n \/\/ \n \/\/ \\index{itk::bio::Cell!SetChemoAttractantLowThreshold}\n \/\/ \\index{itk::bio::Cell!SetChemoAttractantHighThreshold}\n \/\/\n \/\/ Software Guide : EndLatex \n\n \/\/ Software Guide : BeginCodeSnippet\n CellType::SetChemoAttractantLowThreshold( atof( argv[4] ) );\n CellType::SetChemoAttractantHighThreshold( atof( argv[5] ) );\n \/\/ Software Guide : EndCodeSnippet\n \n\n \/\/ Software Guide : BeginLatex\n \/\/\n \/\/ The newly created Cell is passed to the \\code{CellularAggregate} object\n \/\/ that will take care of controling the development of the cells.\n \/\/ \n \/\/ \\index{itk::bio::CellularAggregate!SetEgg}\n \/\/\n \/\/ Software Guide : EndLatex \n\n \/\/ Software Guide : BeginCodeSnippet\n cellularAggregate->SetEgg( egg, position );\n \/\/ Software Guide : EndCodeSnippet\n \n\n\n \/\/ Software Guide : BeginLatex\n \/\/\n \/\/ The CellularAggregate will update the life cycle of all the cells in an\n \/\/ iterative way. The User must select how many iterations to run.\n \/\/ CellularAlgorithms can in principle run forever. It is up to the User to\n \/\/ define an stopping criterion. One of the simplest options is to set a\n \/\/ limit to the number of iterations, by invoking the AdvanceTimeStep()\n \/\/ method inside a for loop. \n \/\/ \n \/\/ \\index{itk::bio::CellularAggregate!SetEgg}\n \/\/\n \/\/ Software Guide : EndLatex \n\n \/\/ Software Guide : BeginCodeSnippet\n unsigned int numberOfIterations = atoi( argv[6] );\n\n std::cout << \"numberOfIterations \" << numberOfIterations << std::endl;\n\n for(unsigned int i=0; i<numberOfIterations; i++)\n {\n cellularAggregate->AdvanceTimeStep();\n }\n \/\/ Software Guide : EndCodeSnippet\n\n\n std::cout << \" Final number of Cells = \" << cellularAggregate->GetNumberOfCells() << std::endl;\n\n return 0;\n}\n\n\n\n\n<|endoftext|>"} {"text":"<commit_before>\/*\n * Copyright (C) 2015-2018 Dubalu LLC. All rights reserved.\n *\n * Permission is hereby granted, free of charge, to any person obtaining a copy\n * of this software and associated documentation files (the \"Software\"), to deal\n * in the Software without restriction, including without limitation the rights\n * to use, copy, modify, merge, publish, distribute, sublicense, and\/or sell\n * copies of the Software, and to permit persons to whom the Software is\n * furnished to do so, subject to the following conditions:\n *\n * The above copyright notice and this permission notice shall be included in\n * all copies or substantial portions of the Software.\n *\n * THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\n * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\n * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE\n * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\n * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,\n * OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN\n * THE SOFTWARE.\n *\/\n\n#include \"udp.h\"\n\n#include <arpa\/inet.h> \/\/ for inet_addr, htonl, htons\n#include <cstring> \/\/ for memset\n#include <errno.h> \/\/ for errno\n#include <utility>\n#include <fcntl.h> \/\/ for fcntl, F_GETFL, F_SETFL, O_NONBLOCK\n#include <sys\/socket.h> \/\/ for setsockopt, bind, recvfrom, sendto\n#include <sysexits.h> \/\/ for EX_CONFIG\n\n#include \"error.hh\" \/\/ for error:name, error::description\n#include \"exception.h\" \/\/ for MSG_NetworkError, NetworkError\n#include \"io.hh\" \/\/ for close, ignored_errno\n#include \"length.h\" \/\/ for serialise_string, unserialise_string\n#include \"log.h\" \/\/ for L_ERR, L_OBJ, L_CRIT, L_CONN, L_UDP_WIRE\n#include \"manager.h\" \/\/ for XapiandManager, sig_exit, Xapiand...\n#include \"opts.h\" \/\/ for opts\n\n\nUDP::UDP(int port, const char* description, uint8_t major_version, uint8_t minor_version, int flags)\n\t: port(port),\n\t sock(-1),\n\t closed(true),\n\t flags(flags),\n\t description(description),\n\t major_version(major_version),\n\t minor_version(minor_version)\n{}\n\n\nUDP::~UDP()\n{\n\tif (sock != -1) {\n\t\tio::close(sock);\n\t}\n}\n\n\nbool\nUDP::close(bool close) {\n\tbool was_closed = closed.exchange(true);\n\tif (!was_closed && sock != -1) {\n\t\tif (close) {\n\t\t\t\/\/ Dangerously close socket!\n\t\t\t\/\/ (make sure no threads are using the file descriptor)\n\t\t\tio::close(sock);\n\t\t\tsock = -1;\n\t\t} else {\n\t\t\tio::shutdown(sock, SHUT_RDWR);\n\t\t}\n\t}\n\treturn was_closed;\n}\n\n\nvoid\nUDP::bind(int tries, const std::string& group)\n{\n\tif (!closed.exchange(false)) {\n\t\treturn;\n\t}\n\n\tint optval = 1;\n\tunsigned char ttl = 3;\n\tstruct ip_mreq mreq;\n\n\tif ((sock = io::socket(PF_INET, SOCK_DGRAM, 0)) < 0) {\n\t\tL_CRIT(\"ERROR: %s socket: %s (%d): %s\", description, error::name(errno), errno, error::description(errno));\n\t\tsig_exit(-EX_CONFIG);\n\t}\n\n\tif (io::setsockopt(sock, SOL_SOCKET, SO_REUSEADDR, &optval, sizeof(optval)) == -1) {\n\t\tL_ERR(\"ERROR: %s setsockopt SO_REUSEADDR (sock=%d): %s (%d): %s\", description, sock, error::name(errno), errno, error::description(errno));\n\t}\n\n\tif ((flags & UDP_SO_REUSEPORT) != 0) {\n#ifdef SO_REUSEPORT_LB\n\t\tif (io::setsockopt(sock, SOL_SOCKET, SO_REUSEPORT_LB, &optval, sizeof(optval)) == -1) {\n\t\t\tL_ERR(\"ERROR: %s setsockopt SO_REUSEPORT_LB (sock=%d): %s (%d): %s\", description, sock, error::name(errno), errno, error::description(errno));\n\t\t}\n#else\n\t\tif (io::setsockopt(sock, SOL_SOCKET, SO_REUSEPORT, &optval, sizeof(optval)) == -1) {\n\t\t\tL_ERR(\"ERROR: %s setsockopt SO_REUSEPORT (sock=%d): %s (%d): %s\", description, sock, error::name(errno), errno, error::description(errno));\n\t\t}\n#endif\n\t}\n\n\tif (io::setsockopt(sock, IPPROTO_IP, IP_MULTICAST_LOOP, &optval, sizeof(optval)) == -1) {\n\t\tL_ERR(\"ERROR: %s setsockopt IP_MULTICAST_LOOP (sock=%d): %s (%d): %s\", description, sock, error::name(errno), errno, error::description(errno));\n\t}\n\n\tif (io::setsockopt(sock, IPPROTO_IP, IP_MULTICAST_TTL, &ttl, sizeof(ttl)) == -1) {\n\t\tL_ERR(\"ERROR: %s setsockopt IP_MULTICAST_TTL (sock=%d): %s (%d): %s\", description, sock, error::name(errno), errno, error::description(errno));\n\t}\n\n\t\/\/ use io::setsockopt() to request that the kernel join a multicast group\n\tmemset(&mreq, 0, sizeof(mreq));\n\tmreq.imr_multiaddr.s_addr = inet_addr(group.c_str());\n\tmreq.imr_interface.s_addr = htonl(INADDR_ANY);\n\tif (io::setsockopt(sock, IPPROTO_IP, IP_ADD_MEMBERSHIP, &mreq, sizeof(mreq)) == -1) {\n\t\tL_CRIT(\"ERROR: %s setsockopt IP_ADD_MEMBERSHIP (sock=%d): %s (%d): %s\", description, sock, error::name(errno), errno, error::description(errno));\n\t\tclose();\n\t\tsig_exit(-EX_CONFIG);\n\t}\n\n\tmemset(&addr, 0, sizeof(addr));\n\taddr.sin_family = AF_INET;\n\taddr.sin_addr.s_addr = htonl(INADDR_ANY); \/\/ bind to all addresses (differs from sender)\n\n\tfor (int i = 0; i < tries; ++i, ++port) {\n\t\taddr.sin_port = htons(port);\n\n\t\tif (io::bind(sock, (struct sockaddr *)&addr, sizeof(addr)) == -1) {\n\t\t\tif (!io::ignored_errno(errno, true, true, true)) {\n\t\t\t\tif (i == tries - 1) { break; }\n\t\t\t\tL_CONN(\"ERROR: %s bind error (sock=%d): %s (%d): %s\", description, sock, error::name(errno), errno, error::description(errno));\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t}\n\n\t\tif (io::fcntl(sock, F_SETFL, io::fcntl(sock, F_GETFL, 0) | O_NONBLOCK) == -1) {\n\t\t\tL_CRIT(\"ERROR: fcntl O_NONBLOCK (sock=%d): %s (%d): %s\", sock, error::name(errno), errno, error::description(errno));\n\t\t\tsig_exit(-EX_CONFIG);\n\t\t}\n\n\t\taddr.sin_addr.s_addr = inet_addr(group.c_str()); \/\/ setup s_addr for sender (send to group)\n\n\t\t\/\/ Flush socket\n\t\tL_DELAYED_N(1s, \"UDP flush is taking too long...\");\n\t\twhile (true) {\n\t\t\tchar buf[1024];\n\t\t\tssize_t received = io::recv(sock, buf, sizeof(buf), 0);\n\t\t\tif (received < 0 && !io::ignored_errno(errno, false, true, true)) {\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t\tL_DELAYED_N_CLEAR();\n\n\t\treturn;\n\t}\n\n\tL_CRIT(\"ERROR: %s bind error (sock=%d): %s (%d): %s\", description, sock, error::name(errno), errno, error::description(errno));\n\tclose();\n\tsig_exit(-EX_CONFIG);\n}\n\n\nssize_t\nUDP::send_message(const std::string& message)\n{\n\tif (!closed) {\n\t\tL_UDP_WIRE(\"(sock=%d) <<-- %s\", sock, repr(message));\n\n#ifdef MSG_NOSIGNAL\n\t\tssize_t written = io::sendto(sock, message.c_str(), message.size(), MSG_NOSIGNAL, (struct sockaddr *)&addr, sizeof(addr));\n#else\n\t\tssize_t written = io::sendto(sock, message.c_str(), message.size(), 0, (struct sockaddr *)&addr, sizeof(addr));\n#endif\n\n\t\tif (written < 0) {\n\t\t\tL_ERR(\"ERROR: sendto error (sock=%d): %s (%d): %s\", sock, error::name(errno), errno, error::description(errno));\n\t\t}\n\t\treturn written;\n\t}\n\treturn 0;\n}\n\n\nssize_t\nUDP::send_message(char type, const std::string& content)\n{\n\tif (!content.empty()) {\n\t\tstd::string message;\n\t\tmessage.push_back(major_version);\n\t\tmessage.push_back(minor_version);\n\t\tmessage.push_back(type);\n\t\tmessage.append(serialise_string(opts.cluster_name));\n\t\tmessage.append(content);\n\t\treturn send_message(message);\n\t}\n\treturn 0;\n}\n\n\nchar\nUDP::get_message(std::string& result, char max_type)\n{\n\tchar buf[1024];\n\tssize_t received = io::recv(sock, buf, sizeof(buf), 0);\n\tif (received < 0) {\n\t\tif (!io::ignored_errno(errno, true, true, true)) {\n\t\t\tL_ERR(\"ERROR: read error (sock=%d): %s (%d): %s\", sock, error::name(errno), errno, error::description(errno));\n\t\t\tTHROW(NetworkError, error::description(errno));\n\t\t}\n\t\tL_CONN(\"Received EOF (sock=%d)!\", sock);\n\t\treturn '\\xff';\n\t} else if (received == 0) {\n\t\t\/\/ If no messages are available to be received and the peer has performed an orderly shutdown.\n\t\tL_CONN(\"Received EOF (sock=%d)!\", sock);\n\t\treturn '\\xff';\n\t} else if (received < 4) {\n\t\tL_CONN(\"Badly formed message: Incomplete!\");\n\t}\n\n\tL_UDP_WIRE(\"(sock=%d) -->> %s\", sock, repr(buf, received));\n\n\tconst char *p = buf;\n\tconst char *p_end = p + received;\n\n\tuint8_t received_major_version = *p++;\n\tuint8_t received_minor_version = *p++;\n\tif (received_major_version > major_version || (received_major_version == major_version && received_minor_version > minor_version)) {\n\t\tL_CONN(\"Badly formed message: Protocol version mismatch!\");\n\t\treturn '\\xff';\n\t}\n\n\tchar type = *p++;\n\tif (type >= max_type) {\n\t\tL_CONN(\"Badly formed message: Invalid message type %u\", unsigned(type));\n\t\treturn '\\xff';\n\t}\n\n\tauto remote_cluster_name = unserialise_string(&p, p_end);\n\tif (remote_cluster_name.empty()) {\n\t\tL_CONN(\"Badly formed message: No cluster name!\");\n\t\treturn '\\xff';\n\t}\n\n\tif (remote_cluster_name != opts.cluster_name) {\n\t\treturn '\\xff';\n\t}\n\n\tresult = std::string(p, p_end - p);\n\treturn type;\n}\n<commit_msg>UDP: Ignore certain UDP errors<commit_after>\/*\n * Copyright (C) 2015-2018 Dubalu LLC. All rights reserved.\n *\n * Permission is hereby granted, free of charge, to any person obtaining a copy\n * of this software and associated documentation files (the \"Software\"), to deal\n * in the Software without restriction, including without limitation the rights\n * to use, copy, modify, merge, publish, distribute, sublicense, and\/or sell\n * copies of the Software, and to permit persons to whom the Software is\n * furnished to do so, subject to the following conditions:\n *\n * The above copyright notice and this permission notice shall be included in\n * all copies or substantial portions of the Software.\n *\n * THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\n * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\n * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE\n * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\n * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,\n * OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN\n * THE SOFTWARE.\n *\/\n\n#include \"udp.h\"\n\n#include <arpa\/inet.h> \/\/ for inet_addr, htonl, htons\n#include <cstring> \/\/ for memset\n#include <errno.h> \/\/ for errno\n#include <utility>\n#include <fcntl.h> \/\/ for fcntl, F_GETFL, F_SETFL, O_NONBLOCK\n#include <sys\/socket.h> \/\/ for setsockopt, bind, recvfrom, sendto\n#include <sysexits.h> \/\/ for EX_CONFIG\n\n#include \"error.hh\" \/\/ for error:name, error::description\n#include \"exception.h\" \/\/ for MSG_NetworkError, NetworkError\n#include \"io.hh\" \/\/ for close, ignored_errno\n#include \"length.h\" \/\/ for serialise_string, unserialise_string\n#include \"log.h\" \/\/ for L_ERR, L_OBJ, L_CRIT, L_CONN, L_UDP_WIRE\n#include \"manager.h\" \/\/ for XapiandManager, sig_exit, Xapiand...\n#include \"opts.h\" \/\/ for opts\n\n\nUDP::UDP(int port, const char* description, uint8_t major_version, uint8_t minor_version, int flags)\n\t: port(port),\n\t sock(-1),\n\t closed(true),\n\t flags(flags),\n\t description(description),\n\t major_version(major_version),\n\t minor_version(minor_version)\n{}\n\n\nUDP::~UDP()\n{\n\tif (sock != -1) {\n\t\tio::close(sock);\n\t}\n}\n\n\nbool\nUDP::close(bool close) {\n\tbool was_closed = closed.exchange(true);\n\tif (!was_closed && sock != -1) {\n\t\tif (close) {\n\t\t\t\/\/ Dangerously close socket!\n\t\t\t\/\/ (make sure no threads are using the file descriptor)\n\t\t\tio::close(sock);\n\t\t\tsock = -1;\n\t\t} else {\n\t\t\tio::shutdown(sock, SHUT_RDWR);\n\t\t}\n\t}\n\treturn was_closed;\n}\n\n\nvoid\nUDP::bind(int tries, const std::string& group)\n{\n\tif (!closed.exchange(false)) {\n\t\treturn;\n\t}\n\n\tint optval = 1;\n\tunsigned char ttl = 3;\n\tstruct ip_mreq mreq;\n\n\tif ((sock = io::socket(PF_INET, SOCK_DGRAM, 0)) < 0) {\n\t\tL_CRIT(\"ERROR: %s socket: %s (%d): %s\", description, error::name(errno), errno, error::description(errno));\n\t\tsig_exit(-EX_CONFIG);\n\t}\n\n\tif (io::setsockopt(sock, SOL_SOCKET, SO_REUSEADDR, &optval, sizeof(optval)) == -1) {\n\t\tL_ERR(\"ERROR: %s setsockopt SO_REUSEADDR (sock=%d): %s (%d): %s\", description, sock, error::name(errno), errno, error::description(errno));\n\t}\n\n\tif ((flags & UDP_SO_REUSEPORT) != 0) {\n#ifdef SO_REUSEPORT_LB\n\t\tif (io::setsockopt(sock, SOL_SOCKET, SO_REUSEPORT_LB, &optval, sizeof(optval)) == -1) {\n\t\t\tL_ERR(\"ERROR: %s setsockopt SO_REUSEPORT_LB (sock=%d): %s (%d): %s\", description, sock, error::name(errno), errno, error::description(errno));\n\t\t}\n#else\n\t\tif (io::setsockopt(sock, SOL_SOCKET, SO_REUSEPORT, &optval, sizeof(optval)) == -1) {\n\t\t\tL_ERR(\"ERROR: %s setsockopt SO_REUSEPORT (sock=%d): %s (%d): %s\", description, sock, error::name(errno), errno, error::description(errno));\n\t\t}\n#endif\n\t}\n\n\tif (io::setsockopt(sock, IPPROTO_IP, IP_MULTICAST_LOOP, &optval, sizeof(optval)) == -1) {\n\t\tL_ERR(\"ERROR: %s setsockopt IP_MULTICAST_LOOP (sock=%d): %s (%d): %s\", description, sock, error::name(errno), errno, error::description(errno));\n\t}\n\n\tif (io::setsockopt(sock, IPPROTO_IP, IP_MULTICAST_TTL, &ttl, sizeof(ttl)) == -1) {\n\t\tL_ERR(\"ERROR: %s setsockopt IP_MULTICAST_TTL (sock=%d): %s (%d): %s\", description, sock, error::name(errno), errno, error::description(errno));\n\t}\n\n\t\/\/ use io::setsockopt() to request that the kernel join a multicast group\n\tmemset(&mreq, 0, sizeof(mreq));\n\tmreq.imr_multiaddr.s_addr = inet_addr(group.c_str());\n\tmreq.imr_interface.s_addr = htonl(INADDR_ANY);\n\tif (io::setsockopt(sock, IPPROTO_IP, IP_ADD_MEMBERSHIP, &mreq, sizeof(mreq)) == -1) {\n\t\tL_CRIT(\"ERROR: %s setsockopt IP_ADD_MEMBERSHIP (sock=%d): %s (%d): %s\", description, sock, error::name(errno), errno, error::description(errno));\n\t\tclose();\n\t\tsig_exit(-EX_CONFIG);\n\t}\n\n\tmemset(&addr, 0, sizeof(addr));\n\taddr.sin_family = AF_INET;\n\taddr.sin_addr.s_addr = htonl(INADDR_ANY); \/\/ bind to all addresses (differs from sender)\n\n\tfor (int i = 0; i < tries; ++i, ++port) {\n\t\taddr.sin_port = htons(port);\n\n\t\tif (io::bind(sock, (struct sockaddr *)&addr, sizeof(addr)) == -1) {\n\t\t\tif (!io::ignored_errno(errno, true, true, true)) {\n\t\t\t\tif (i == tries - 1) { break; }\n\t\t\t\tL_CONN(\"ERROR: %s bind error (sock=%d): %s (%d): %s\", description, sock, error::name(errno), errno, error::description(errno));\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t}\n\n\t\tif (io::fcntl(sock, F_SETFL, io::fcntl(sock, F_GETFL, 0) | O_NONBLOCK) == -1) {\n\t\t\tL_CRIT(\"ERROR: fcntl O_NONBLOCK (sock=%d): %s (%d): %s\", sock, error::name(errno), errno, error::description(errno));\n\t\t\tsig_exit(-EX_CONFIG);\n\t\t}\n\n\t\taddr.sin_addr.s_addr = inet_addr(group.c_str()); \/\/ setup s_addr for sender (send to group)\n\n\t\t\/\/ Flush socket\n\t\tL_DELAYED_N(1s, \"UDP flush is taking too long...\");\n\t\twhile (true) {\n\t\t\tchar buf[1024];\n\t\t\tssize_t received = io::recv(sock, buf, sizeof(buf), 0);\n\t\t\tif (received < 0 && !io::ignored_errno(errno, false, true, true)) {\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t\tL_DELAYED_N_CLEAR();\n\n\t\treturn;\n\t}\n\n\tL_CRIT(\"ERROR: %s bind error (sock=%d): %s (%d): %s\", description, sock, error::name(errno), errno, error::description(errno));\n\tclose();\n\tsig_exit(-EX_CONFIG);\n}\n\n\nssize_t\nUDP::send_message(const std::string& message)\n{\n\tif (!closed) {\n\t\tL_UDP_WIRE(\"(sock=%d) <<-- %s\", sock, repr(message));\n\n#ifdef MSG_NOSIGNAL\n\t\tssize_t written = io::sendto(sock, message.c_str(), message.size(), MSG_NOSIGNAL, (struct sockaddr *)&addr, sizeof(addr));\n#else\n\t\tssize_t written = io::sendto(sock, message.c_str(), message.size(), 0, (struct sockaddr *)&addr, sizeof(addr));\n#endif\n\n\t\tif (written < 0) {\n\t\t\tif (!io::ignored_errno(errno, true, true, true)) {\n\t\t\t\tL_ERR(\"ERROR: sendto error (sock=%d): %s (%d): %s\", sock, error::name(errno), errno, error::description(errno));\n\t\t\t}\n\t\t}\n\t\treturn written;\n\t}\n\treturn 0;\n}\n\n\nssize_t\nUDP::send_message(char type, const std::string& content)\n{\n\tif (!content.empty()) {\n\t\tstd::string message;\n\t\tmessage.push_back(major_version);\n\t\tmessage.push_back(minor_version);\n\t\tmessage.push_back(type);\n\t\tmessage.append(serialise_string(opts.cluster_name));\n\t\tmessage.append(content);\n\t\treturn send_message(message);\n\t}\n\treturn 0;\n}\n\n\nchar\nUDP::get_message(std::string& result, char max_type)\n{\n\tchar buf[1024];\n\tssize_t received = io::recv(sock, buf, sizeof(buf), 0);\n\tif (received < 0) {\n\t\tif (!io::ignored_errno(errno, true, true, true)) {\n\t\t\tL_ERR(\"ERROR: read error (sock=%d): %s (%d): %s\", sock, error::name(errno), errno, error::description(errno));\n\t\t\tTHROW(NetworkError, error::description(errno));\n\t\t}\n\t\tL_CONN(\"Received EOF (sock=%d)!\", sock);\n\t\treturn '\\xff';\n\t} else if (received == 0) {\n\t\t\/\/ If no messages are available to be received and the peer has performed an orderly shutdown.\n\t\tL_CONN(\"Received EOF (sock=%d)!\", sock);\n\t\treturn '\\xff';\n\t} else if (received < 4) {\n\t\tL_CONN(\"Badly formed message: Incomplete!\");\n\t}\n\n\tL_UDP_WIRE(\"(sock=%d) -->> %s\", sock, repr(buf, received));\n\n\tconst char *p = buf;\n\tconst char *p_end = p + received;\n\n\tuint8_t received_major_version = *p++;\n\tuint8_t received_minor_version = *p++;\n\tif (received_major_version > major_version || (received_major_version == major_version && received_minor_version > minor_version)) {\n\t\tL_CONN(\"Badly formed message: Protocol version mismatch!\");\n\t\treturn '\\xff';\n\t}\n\n\tchar type = *p++;\n\tif (type >= max_type) {\n\t\tL_CONN(\"Badly formed message: Invalid message type %u\", unsigned(type));\n\t\treturn '\\xff';\n\t}\n\n\tauto remote_cluster_name = unserialise_string(&p, p_end);\n\tif (remote_cluster_name.empty()) {\n\t\tL_CONN(\"Badly formed message: No cluster name!\");\n\t\treturn '\\xff';\n\t}\n\n\tif (remote_cluster_name != opts.cluster_name) {\n\t\treturn '\\xff';\n\t}\n\n\tresult = std::string(p, p_end - p);\n\treturn type;\n}\n<|endoftext|>"} {"text":"<commit_before>#include <QtTest\/QtTest>\n\n#include \"..\/OpenGestureControl\/bluetoothdevicelistmodel.h\"\n\nclass TestBluetoothDeviceListModel : public QObject\n{\n Q_OBJECT\nprivate slots:\n void storingAndRetrievingBluetoothDevice();\n};\n\nvoid TestBluetoothDeviceListModel::storingAndRetrievingBluetoothDevice()\n{\n \/\/ Arrange\n QString name = \"Example device\";\n QString deviceId = \"00000000-0000-1000-8000-00805F9B34FB\";\n\n BluetoothDeviceListModel *bluetoothDeviceListModel = new BluetoothDeviceListModel();\n BluetoothDevice *bluetoothDevice = new BluetoothDevice(name, deviceId);\n\n \/\/ Act\n bluetoothDeviceListModel->addDevice(bluetoothDevice);\n BluetoothDevice *retrievedBluetoothDevice = bluetoothDeviceListModel->get(0);\n\n \/\/ Assert\n QVERIFY(retrievedBluetoothDevice->name() == name);\n QVERIFY(retrievedBluetoothDevice->deviceId() == deviceId);\n}\n\nQTEST_MAIN(TestBluetoothDeviceListModel)\n#include \"testbluetoothdevicelistmodel.moc\"\n<commit_msg>added BT tests to test rest of BluetoothDeviceListModel<commit_after>#include <QtTest\/QtTest>\n\n#include \"..\/OpenGestureControl\/bluetoothdevicelistmodel.h\"\n\nclass TestBluetoothDeviceListModel : public QObject\n{\n Q_OBJECT\nprivate slots:\n void storingAndRetrievingBluetoothDevice();\n void getCorrectBluetoothDeviceCount();\n void correctlyClearBluetoothDeviceCount();\n};\n\nvoid TestBluetoothDeviceListModel::storingAndRetrievingBluetoothDevice()\n{\n \/\/ Arrange\n QString name = \"Example device\";\n QString deviceId = \"00000000-0000-1000-8000-00805F9B34FB\";\n\n BluetoothDeviceListModel *bluetoothDeviceListModel = new BluetoothDeviceListModel();\n BluetoothDevice *bluetoothDevice = new BluetoothDevice(name, deviceId);\n\n \/\/ Act\n bluetoothDeviceListModel->addDevice(bluetoothDevice);\n BluetoothDevice *retrievedBluetoothDevice = bluetoothDeviceListModel->get(0);\n\n \/\/ Assert\n QVERIFY(retrievedBluetoothDevice->name() == name);\n QVERIFY(retrievedBluetoothDevice->deviceId() == deviceId);\n}\n\nvoid TestBluetoothDeviceListModel::getCorrectBluetoothDeviceCount()\n{\n \/\/ Arrange\n QString name1 = \"Example device 1\";\n QString name2 = \"Example device 2\";\n QString name3 = \"Example device 3\";\n QString deviceId1 = \"00000000-0000-1000-8000-00805F9B34FA\";\n QString deviceId2 = \"00000000-0000-1000-8000-00805F9B34FB\";\n QString deviceId3 = \"00000000-0000-1000-8000-00805F9B34FC\";\n\n BluetoothDeviceListModel *bluetoothDeviceListModel = new BluetoothDeviceListModel();\n BluetoothDevice *bluetoothDevice1 = new BluetoothDevice(name1, deviceId1);\n BluetoothDevice *bluetoothDevice2 = new BluetoothDevice(name2, deviceId2);\n BluetoothDevice *bluetoothDevice3 = new BluetoothDevice(name3, deviceId3);\n\n bluetoothDeviceListModel->addDevice(bluetoothDevice1);\n bluetoothDeviceListModel->addDevice(bluetoothDevice2);\n bluetoothDeviceListModel->addDevice(bluetoothDevice3);\n\n \/\/ Act\n int deviceCount = bluetoothDeviceListModel->rowCount();\n\n \/\/ Assert\n QVERIFY(deviceCount == 3);\n}\n\nvoid TestBluetoothDeviceListModel::correctlyClearBluetoothDeviceCount()\n{\n \/\/ Arrange\n QString name1 = \"Example device 1\";\n QString name2 = \"Example device 2\";\n QString name3 = \"Example device 3\";\n QString deviceId1 = \"00000000-0000-1000-8000-00805F9B34FA\";\n QString deviceId2 = \"00000000-0000-1000-8000-00805F9B34FB\";\n QString deviceId3 = \"00000000-0000-1000-8000-00805F9B34FC\";\n\n BluetoothDeviceListModel *bluetoothDeviceListModel = new BluetoothDeviceListModel();\n BluetoothDevice *bluetoothDevice1 = new BluetoothDevice(name1, deviceId1);\n BluetoothDevice *bluetoothDevice2 = new BluetoothDevice(name2, deviceId2);\n BluetoothDevice *bluetoothDevice3 = new BluetoothDevice(name3, deviceId3);\n\n bluetoothDeviceListModel->addDevice(bluetoothDevice1);\n bluetoothDeviceListModel->addDevice(bluetoothDevice2);\n bluetoothDeviceListModel->addDevice(bluetoothDevice3);\n\n \/\/ Act\n bluetoothDeviceListModel->clear();\n\n \/\/ Assert\n QVERIFY(bluetoothDeviceListModel->rowCount() == 0);\n}\n\nQTEST_MAIN(TestBluetoothDeviceListModel)\n#include \"testbluetoothdevicelistmodel.moc\"\n<|endoftext|>"} {"text":"<commit_before>\n\/\/ Copyright 2015 XLGAMES Inc.\n\/\/\n\/\/ Distributed under the MIT License (See\n\/\/ accompanying file \"LICENSE\" or the website\n\/\/ http:\/\/www.opensource.org\/licenses\/mit-license.php)\n\n#include \"XLELayerUtils.h\"\n#include \"..\/..\/Tools\/ToolsRig\/VisualisationUtils.h\"\n#include \"..\/..\/Tools\/EntityInterface\/EntityInterface.h\"\n#include \"..\/..\/Tools\/GuiLayer\/MarshalString.h\"\n#include \"..\/..\/Tools\/GuiLayer\/NativeEngineDevice.h\"\n#include \"..\/..\/RenderCore\/Techniques\/TechniqueUtils.h\"\n#include \"..\/..\/Math\/Transformations.h\"\n#include \"..\/..\/ConsoleRig\/LogStartup.h\"\n#include \"..\/..\/ConsoleRig\/GlobalServices.h\"\n\nusing namespace Sce::Atf;\nusing namespace Sce::Atf::Applications;\n\nnamespace XLEBridgeUtils\n{\n public interface class INativeDocumentAdapter\n {\n public:\n property EntityInterface::DocumentId NativeDocumentId { EntityInterface::DocumentId get(); }\n };\n\n GUILayer::CameraDescWrapper^ Utils::AsCameraDesc(Sce::Atf::Rendering::Camera^ camera)\n {\n ToolsRig::VisCameraSettings visCam;\n visCam._position = AsFloat3(camera->WorldEye);\n visCam._focus = AsFloat3(camera->WorldLookAtPoint);\n visCam._verticalFieldOfView = camera->YFov * 180.f \/ gPI;\n visCam._nearClip = camera->NearZ;\n visCam._farClip = camera->FarZ;\n return gcnew GUILayer::CameraDescWrapper(visCam);\n }\n\n GUILayer::IntersectionTestContextWrapper^\n Utils::CreateIntersectionTestContext(\n GUILayer::EngineDevice^ engineDevice,\n GUILayer::TechniqueContextWrapper^ techniqueContext,\n Sce::Atf::Rendering::Camera^ camera,\n unsigned viewportWidth, unsigned viewportHeight)\n {\n return GUILayer::EditorInterfaceUtils::CreateIntersectionTestContext(\n engineDevice, techniqueContext, \n AsCameraDesc(camera), viewportWidth, viewportHeight);\n }\n\n Sce::Atf::VectorMath::Matrix4F^ Utils::MakeFrustumMatrix(\n Sce::Atf::Rendering::Camera^ camera,\n System::Drawing::RectangleF rectangle,\n System::Drawing::Size viewportSize)\n {\n \/\/ Given a camera and rectangle, calculate a\n \/\/ frustum matrix that will represents that area.\n System::Drawing::RectangleF fRect(\n rectangle.Left \/ float(viewportSize.Width), rectangle.Top \/ float(viewportSize.Height),\n rectangle.Width \/ float(viewportSize.Width), rectangle.Height \/ float(viewportSize.Height));\n\n \/\/ skew XY in the projection matrix to suit the rectangle\n float sx = 1.f \/ (fRect.Width);\n float sy = 1.f \/ (fRect.Height);\n float tx = -(2.f * .5f * (fRect.Left + fRect.Right) - 1.f) * sx;\n float ty = -(-2.f * .5f * (fRect.Top + fRect.Bottom) + 1.f) * sy;\n\n Float4x4 rectangleAdj = MakeFloat4x4(\n sx, 0.f, 0.f, tx,\n 0.f, sy, 0.f, ty,\n 0.f, 0.f, 1.f, 0.f,\n 0.f, 0.f, 0.f, 1.f);\n\n std::unique_ptr<Float4x4> worldToProjPtr;\n worldToProjPtr.reset((Float4x4*)GUILayer::EditorInterfaceUtils::CalculateWorldToProjection(\n AsCameraDesc(camera), viewportSize.Width \/ float(viewportSize.Height)));\n \n auto worldToProj = Combine(*worldToProjPtr, rectangleAdj);\n\n \/\/ note -- forcing a transpose here!\n return gcnew Sce::Atf::VectorMath::Matrix4F(\n worldToProj(0,0), worldToProj(1,0), worldToProj(2,0), worldToProj(3,0),\n worldToProj(0,1), worldToProj(1,1), worldToProj(2,1), worldToProj(3,1),\n worldToProj(0,2), worldToProj(1,2), worldToProj(2,2), worldToProj(3,2),\n worldToProj(0,3), worldToProj(1,3), worldToProj(2,3), worldToProj(3,3));\n }\n\n DomChangeInspector::DomChangeInspector(IContextRegistry^ contextRegistry) \n : m_contextRegistry(contextRegistry)\n {\n m_observableContext = nullptr;\n contextRegistry->ActiveContextChanged += \n gcnew EventHandler(this, &DomChangeInspector::ContextRegistry_ActiveContextChanged);\n }\n\n void DomChangeInspector::ContextRegistry_ActiveContextChanged(System::Object^ sender, EventArgs^ e)\n {\n using namespace LevelEditorCore;\n IGameContext^ game = m_contextRegistry->GetActiveContext<IGameContext^>();\n auto observableContext = Sce::Atf::Adaptation::Adapters::As<IObservableContext^>(game);\n if (m_observableContext == observableContext) return;\n if (m_observableContext != nullptr) {\n m_observableContext->ItemInserted -= gcnew EventHandler<ItemInsertedEventArgs<System::Object^>^>(this, &DomChangeInspector::m_observableContext_ItemInserted);\n m_observableContext->ItemRemoved -= gcnew EventHandler<ItemRemovedEventArgs<System::Object^>^>(this, &DomChangeInspector::m_observableContext_ItemRemoved);\n m_observableContext->ItemChanged -= gcnew EventHandler<Sce::Atf::ItemChangedEventArgs<System::Object^>^>(this, &DomChangeInspector::m_observableContext_ItemChanged);\n m_observableContext->Reloaded -= gcnew EventHandler(this, &DomChangeInspector::m_observableContext_Reloaded);\n }\n m_observableContext = observableContext;\n\n if (m_observableContext != nullptr) {\n m_observableContext->ItemInserted += gcnew EventHandler<ItemInsertedEventArgs<System::Object^>^>(this, &DomChangeInspector::m_observableContext_ItemInserted);\n m_observableContext->ItemRemoved += gcnew EventHandler<ItemRemovedEventArgs<System::Object^>^>(this, &DomChangeInspector::m_observableContext_ItemRemoved);\n m_observableContext->ItemChanged += gcnew EventHandler<Sce::Atf::ItemChangedEventArgs<System::Object^>^>(this, &DomChangeInspector::m_observableContext_ItemChanged);\n m_observableContext->Reloaded += gcnew EventHandler(this, &DomChangeInspector::m_observableContext_Reloaded);\n }\n OnActiveContextChanged(sender);\n }\n\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n namespace Internal \n { \n static Sce::Atf::OutputMessageType AsOutputMessageType(ConsoleRig::LogLevel level)\n {\n switch (level) {\n default:\n case ConsoleRig::LogLevel::Fatal: \n case ConsoleRig::LogLevel::Error: return Sce::Atf::OutputMessageType::Error;\n case ConsoleRig::LogLevel::Warning: return Sce::Atf::OutputMessageType::Warning;\n case ConsoleRig::LogLevel::Info:\n case ConsoleRig::LogLevel::Verbose: return Sce::Atf::OutputMessageType::Info;\n }\n }\n\n class LoggingRedirectHelper : public ConsoleRig::LogCallback\n {\n public:\n virtual void OnDispatch(ConsoleRig::LogLevel level, const std::string& str)\n {\n if (!str.empty()) {\n auto s = clix::marshalString<clix::E_UTF8>(str);\n \/\/ we must append a new line if one isn't already there!\n \/\/ this falls in line with the behaviour of easylogging++,\n \/\/ which will automatically add a new line at the end of each\n \/\/ message.\n if (!s->EndsWith(System::Environment::NewLine))\n s += System::Environment::NewLine;\n Sce::Atf::Outputs::Write(AsOutputMessageType(level), s);\n }\n }\n\n LoggingRedirectHelper() {}\n ~LoggingRedirectHelper() {}\n };\n }\n\n LoggingRedirect::LoggingRedirect()\n {\n _helper = std::make_shared<Internal::LoggingRedirectHelper>();\n _helper->Enable();\n }\n\n LoggingRedirect::~LoggingRedirect() {}\n LoggingRedirect::!LoggingRedirect() {}\n\n\n static ConsoleRig::AttachRef<ConsoleRig::GlobalServices> s_attachRef;\n\n void Utils::AttachLibrary(GUILayer::EngineDevice^ device)\n {\n if (!s_attachRef) {\n s_attachRef = device->GetNative().GetGlobalServices()->Attach();\n }\n }\n\n void Utils::DetachLibrary()\n {\n s_attachRef.Detach();\n }\n\n}\n\n<commit_msg>Delayed logging to level editor window - this prevents a problem where windows messages (like WM_PAINT) were being handled in the middle of a logging dispatch operation - it prevents a problem that was resulting in a call to std::abort() sometimes<commit_after>\n\/\/ Copyright 2015 XLGAMES Inc.\n\/\/\n\/\/ Distributed under the MIT License (See\n\/\/ accompanying file \"LICENSE\" or the website\n\/\/ http:\/\/www.opensource.org\/licenses\/mit-license.php)\n\n#include \"XLELayerUtils.h\"\n#include \"..\/..\/Tools\/ToolsRig\/VisualisationUtils.h\"\n#include \"..\/..\/Tools\/EntityInterface\/EntityInterface.h\"\n#include \"..\/..\/Tools\/GuiLayer\/MarshalString.h\"\n#include \"..\/..\/Tools\/GuiLayer\/NativeEngineDevice.h\"\n#include \"..\/..\/RenderCore\/Techniques\/TechniqueUtils.h\"\n#include \"..\/..\/Math\/Transformations.h\"\n#include \"..\/..\/ConsoleRig\/LogStartup.h\"\n#include \"..\/..\/ConsoleRig\/GlobalServices.h\"\n\nusing namespace Sce::Atf;\nusing namespace Sce::Atf::Applications;\n\nnamespace XLEBridgeUtils\n{\n public interface class INativeDocumentAdapter\n {\n public:\n property EntityInterface::DocumentId NativeDocumentId { EntityInterface::DocumentId get(); }\n };\n\n GUILayer::CameraDescWrapper^ Utils::AsCameraDesc(Sce::Atf::Rendering::Camera^ camera)\n {\n ToolsRig::VisCameraSettings visCam;\n visCam._position = AsFloat3(camera->WorldEye);\n visCam._focus = AsFloat3(camera->WorldLookAtPoint);\n visCam._verticalFieldOfView = camera->YFov * 180.f \/ gPI;\n visCam._nearClip = camera->NearZ;\n visCam._farClip = camera->FarZ;\n return gcnew GUILayer::CameraDescWrapper(visCam);\n }\n\n GUILayer::IntersectionTestContextWrapper^\n Utils::CreateIntersectionTestContext(\n GUILayer::EngineDevice^ engineDevice,\n GUILayer::TechniqueContextWrapper^ techniqueContext,\n Sce::Atf::Rendering::Camera^ camera,\n unsigned viewportWidth, unsigned viewportHeight)\n {\n return GUILayer::EditorInterfaceUtils::CreateIntersectionTestContext(\n engineDevice, techniqueContext, \n AsCameraDesc(camera), viewportWidth, viewportHeight);\n }\n\n Sce::Atf::VectorMath::Matrix4F^ Utils::MakeFrustumMatrix(\n Sce::Atf::Rendering::Camera^ camera,\n System::Drawing::RectangleF rectangle,\n System::Drawing::Size viewportSize)\n {\n \/\/ Given a camera and rectangle, calculate a\n \/\/ frustum matrix that will represents that area.\n System::Drawing::RectangleF fRect(\n rectangle.Left \/ float(viewportSize.Width), rectangle.Top \/ float(viewportSize.Height),\n rectangle.Width \/ float(viewportSize.Width), rectangle.Height \/ float(viewportSize.Height));\n\n \/\/ skew XY in the projection matrix to suit the rectangle\n float sx = 1.f \/ (fRect.Width);\n float sy = 1.f \/ (fRect.Height);\n float tx = -(2.f * .5f * (fRect.Left + fRect.Right) - 1.f) * sx;\n float ty = -(-2.f * .5f * (fRect.Top + fRect.Bottom) + 1.f) * sy;\n\n Float4x4 rectangleAdj = MakeFloat4x4(\n sx, 0.f, 0.f, tx,\n 0.f, sy, 0.f, ty,\n 0.f, 0.f, 1.f, 0.f,\n 0.f, 0.f, 0.f, 1.f);\n\n std::unique_ptr<Float4x4> worldToProjPtr;\n worldToProjPtr.reset((Float4x4*)GUILayer::EditorInterfaceUtils::CalculateWorldToProjection(\n AsCameraDesc(camera), viewportSize.Width \/ float(viewportSize.Height)));\n \n auto worldToProj = Combine(*worldToProjPtr, rectangleAdj);\n\n \/\/ note -- forcing a transpose here!\n return gcnew Sce::Atf::VectorMath::Matrix4F(\n worldToProj(0,0), worldToProj(1,0), worldToProj(2,0), worldToProj(3,0),\n worldToProj(0,1), worldToProj(1,1), worldToProj(2,1), worldToProj(3,1),\n worldToProj(0,2), worldToProj(1,2), worldToProj(2,2), worldToProj(3,2),\n worldToProj(0,3), worldToProj(1,3), worldToProj(2,3), worldToProj(3,3));\n }\n\n DomChangeInspector::DomChangeInspector(IContextRegistry^ contextRegistry) \n : m_contextRegistry(contextRegistry)\n {\n m_observableContext = nullptr;\n contextRegistry->ActiveContextChanged += \n gcnew EventHandler(this, &DomChangeInspector::ContextRegistry_ActiveContextChanged);\n }\n\n void DomChangeInspector::ContextRegistry_ActiveContextChanged(System::Object^ sender, EventArgs^ e)\n {\n using namespace LevelEditorCore;\n IGameContext^ game = m_contextRegistry->GetActiveContext<IGameContext^>();\n auto observableContext = Sce::Atf::Adaptation::Adapters::As<IObservableContext^>(game);\n if (m_observableContext == observableContext) return;\n if (m_observableContext != nullptr) {\n m_observableContext->ItemInserted -= gcnew EventHandler<ItemInsertedEventArgs<System::Object^>^>(this, &DomChangeInspector::m_observableContext_ItemInserted);\n m_observableContext->ItemRemoved -= gcnew EventHandler<ItemRemovedEventArgs<System::Object^>^>(this, &DomChangeInspector::m_observableContext_ItemRemoved);\n m_observableContext->ItemChanged -= gcnew EventHandler<Sce::Atf::ItemChangedEventArgs<System::Object^>^>(this, &DomChangeInspector::m_observableContext_ItemChanged);\n m_observableContext->Reloaded -= gcnew EventHandler(this, &DomChangeInspector::m_observableContext_Reloaded);\n }\n m_observableContext = observableContext;\n\n if (m_observableContext != nullptr) {\n m_observableContext->ItemInserted += gcnew EventHandler<ItemInsertedEventArgs<System::Object^>^>(this, &DomChangeInspector::m_observableContext_ItemInserted);\n m_observableContext->ItemRemoved += gcnew EventHandler<ItemRemovedEventArgs<System::Object^>^>(this, &DomChangeInspector::m_observableContext_ItemRemoved);\n m_observableContext->ItemChanged += gcnew EventHandler<Sce::Atf::ItemChangedEventArgs<System::Object^>^>(this, &DomChangeInspector::m_observableContext_ItemChanged);\n m_observableContext->Reloaded += gcnew EventHandler(this, &DomChangeInspector::m_observableContext_Reloaded);\n }\n OnActiveContextChanged(sender);\n }\n\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n namespace Internal \n { \n static Sce::Atf::OutputMessageType AsOutputMessageType(ConsoleRig::LogLevel level)\n {\n switch (level) {\n default:\n case ConsoleRig::LogLevel::Fatal: \n case ConsoleRig::LogLevel::Error: return Sce::Atf::OutputMessageType::Error;\n case ConsoleRig::LogLevel::Warning: return Sce::Atf::OutputMessageType::Warning;\n case ConsoleRig::LogLevel::Info:\n case ConsoleRig::LogLevel::Verbose: return Sce::Atf::OutputMessageType::Info;\n }\n }\n\n ref class LoggingRedirectDelegate\n {\n public:\n static void Callback(Object^ obj)\n {\n LoggingRedirectDelegate^ del = (LoggingRedirectDelegate^)obj;\n Sce::Atf::Outputs::Write(del->Type, del->Msg);\n }\n\n property System::String^ Msg;\n property Sce::Atf::OutputMessageType Type;\n };\n\n class LoggingRedirectHelper : public ConsoleRig::LogCallback\n {\n public:\n virtual void OnDispatch(ConsoleRig::LogLevel level, const std::string& str)\n {\n \/\/ Note -- it is not safe to handle this message immediately\n \/\/ Calling Sce::Atf::Outputs::Write can invoke a windows events (such as WM_PAINT)\n \/\/ This is a problem because we can enter this function at any time. \n \/\/ If we are currently in the middle of one paint operation, this can effectively\n \/\/ cause us to paint recursively. \n \/\/\n \/\/ But there's another worse issue. This thread will currently have the logging mutex\n \/\/ locked. So if any paint or other operations cause a log operation, then the logging\n \/\/ system will attempt a recursive lock on it's mutex -- which results in an exception\n \/\/ and ends up causing a call to std::abort()\n \/\/\n \/\/ We have to delay handling the message by invoking a delegate in the main message loop.\n \/\/ However; note that this could cause the log messages to end up in the wrong order\n \/\/ (if we are getting log messages from different sources)\n\n if (!str.empty()) {\n auto s = clix::marshalString<clix::E_UTF8>(str);\n \/\/ We must append a new line if one isn't already there!\n \/\/ this falls in line with the behaviour of easylogging++,\n \/\/ which will automatically add a new line at the end of each\n \/\/ message.\n if (!s->EndsWith(System::Environment::NewLine))\n s += System::Environment::NewLine;\n \n LoggingRedirectDelegate^ del = gcnew LoggingRedirectDelegate;\n del->Msg = s;\n del->Type = AsOutputMessageType(level);\n _context->Post(\n gcnew System::Threading::SendOrPostCallback(&LoggingRedirectDelegate::Callback), \n del);\n }\n }\n\n LoggingRedirectHelper() \n {\n \/\/ note -- expecting to be called from the main thread.\n _context = System::Threading::SynchronizationContext::Current;\n }\n\n ~LoggingRedirectHelper() {}\n\n protected:\n gcroot<System::Threading::SynchronizationContext^> _context;\n };\n }\n\n LoggingRedirect::LoggingRedirect()\n {\n _helper = std::make_shared<Internal::LoggingRedirectHelper>();\n _helper->Enable();\n }\n\n LoggingRedirect::~LoggingRedirect() {}\n LoggingRedirect::!LoggingRedirect() {}\n\n\n static ConsoleRig::AttachRef<ConsoleRig::GlobalServices> s_attachRef;\n\n void Utils::AttachLibrary(GUILayer::EngineDevice^ device)\n {\n if (!s_attachRef) {\n s_attachRef = device->GetNative().GetGlobalServices()->Attach();\n }\n }\n\n void Utils::DetachLibrary()\n {\n s_attachRef.Detach();\n }\n\n}\n\n<|endoftext|>"} {"text":"<commit_before>#include \"TTExtensionLoader.h\"\n#include \"TTFoundation.h\"\n#include \"TTEnvironment.h\"\n#include <vector>\n#include <string>\n\n\/\/ The organization here is as follows : \n\/\/ 1. TTLoadExtensions is called and selects the paths \n\/\/ where the extensions should be searched, in order.\n\/\/ As soon as extensions are found in a folder, the search stops.\n\/\/ 2. Platforms are defined as classes : \n\/\/ - UnixCommon contains generic data for Unix-like systems\n\/\/ - OS X, Linux, Android, Windows are the available platforms.\n\/\/ 3. Each platform has a specific way to list what's in a folder :\n\/\/ The relevant method is Platform::loadClassesFromFolder \n\/\/ 4. The algorithm to load a file is generic : loadClass. The \n\/\/ platform provides the algorithm with functions to get a handle.\n\n\nusing namespace std;\nusing StringVector = vector<string>;\n\n\/\/ Utility compile-time functions to work with string constants.\n\/\/ Except on windows, where constexpr will only be in VS2015 (hopefully...)\n\/\/ This would allow to shrink this file size by a small half.\n#if !defined(TT_PLATFORM_WIN)\ntemplate <typename T, size_t n>\nconstexpr size_t array_length(const T (&)[n])\n{ return n; }\n\ntemplate <typename T>\nconstexpr size_t string_length(T&& t)\n{ return array_length(forward<T&&>(t)) - 1; }\n\ntemplate<typename T>\nconstexpr bool string_empty(T&& t)\n{ return string_length(forward<T&&>(t)) == 0; }\n#endif\n\ntemplate<typename OS>\n\/\/ Returns true if the filename (ex. : AudioEngine.ttdylib)\n\/\/ is a correct extension filename for the platform we're in.\nbool isExtensionFilename(const string& filename)\n{\n\tauto res = mismatch(begin(OS::extensionPrefix), \n\t\t\t\t\t\tend(OS::extensionPrefix), \n\t\t\t\t\t\tbegin(filename));\n\n\tif (string_empty(OS::extensionPrefix) || res.first == (end(OS::extensionPrefix)))\n\t{\n\t\tif(filename.length() >= string_length(OS::extensionSuffix))\n\t\t{\n\t\t\treturn (0 == filename.compare(\n\t\t\t\t\t\t\tfilename.length() - string_length(OS::extensionSuffix),\n\t\t\t\t\t\t\tstring_length(OS::extensionSuffix),\n\t\t\t\t\t\t\tOS::extensionSuffix));\n\t\t}\n\t}\n\n\treturn false;\n}\n\ntemplate<typename OS>\n\/\/ Gets the extension name from the file name.\n\/\/ ex. : libWebSocket.so on Android -> WebSocket\nstring filenameToExtensionName(string name)\n{\n\t\/\/ Remove the prefix\n\tif(!string_empty(OS::extensionPrefix))\n\t\tname.erase(begin(name),\n\t\t\t\t begin(name) + string_length(OS::extensionPrefix));\n\n\t\/\/ Remove the suffix\n\tif(!string_empty(OS::extensionSuffix))\n\t\tname.erase(end(name) - string_length(OS::extensionSuffix),\n\t\t\t\t end(name));\n\n\treturn name;\n}\n\ntemplate<typename OS, typename Loader, typename GetProc>\n\/\/ A generic way to load classes.\n\/\/ Loader : a callable object that takes a filename of a shared object, \n\/\/ and returns a handle.\n\/\/ GetProc : a callable object that takes a handle and a function name, \n\/\/ and returns a pointer to the function.\nbool loadClass(const string& filename, \n\t\t\t const string& folder,\n\t\t\t Loader&& handle_fun, \n\t\t\t GetProc&& getproc_fun)\n{\n\t\/\/ Check if the file is a Jamoma extension\n\tif(!isExtensionFilename<OS>(filename))\n\t\treturn false;\n\n\t\/\/ Get a handle\n\tvoid *handle = handle_fun((folder + \"\/\" + filename).c_str());\n\tif (!handle)\n\t{\n\t\tTTLogMessage(\"Error when trying to get an handle on %s.\\n\", filename.c_str());\n\t\treturn false;\n\t}\n\n\t\/\/ Load the Jamoma extension\n\tstring initFun = \"TTLoadJamomaExtension_\" + filenameToExtensionName<OS>(filename);\n\tauto initializer = reinterpret_cast<TTExtensionInitializationMethod>(getproc_fun(handle, initFun.c_str()));\n\tif (initializer)\n\t{\n\t\tauto err = initializer();\n\t\tif(err != kTTErrNone)\n\t\t{\n\t\t\tTTLogMessage(\"Error when initializing extension %s.\\n\", filename.c_str());\n\t\t\treturn false;\n\t\t}\n\t\treturn true;\n\t}\n\treturn false;\n}\n\n\/\/ Here is the platform-specific code.\n\/\/ It is organized in the following fashion :\n\/\/\n\/\/ * Each platform has an extension prefix (e.g. \"lib\", required on Android) and suffix (e.g. \".ttdylib\").\n\/\/ * Platforms have these paths defined (they will be evaluated in this order) :\n\/\/ * A computed relative path (the path of the JamomaFoundation shared object)\n\/\/\t * Built-in relative paths (e.g. in an app bundle on OS X)\n\/\/\t * Built-in absolute paths (standard paths, e.g. \"\/usr\/local\/jamoma\"...\n\/\/\t and a compiled-in absolute path (to allow package maintainers to add their own paths)\n\/\/ * Common code for Unix-like platforms is abstracted in UnixCommon.\n#if defined(TT_PLATFORM_MAC) || defined(TT_PLATFORM_LINUX)\n#include <dlfcn.h>\n#include <dirent.h>\n\n\/\/ This class contains informations that are applicable to\n\/\/ UNIX-like systems (i.e. they respect the Filesystem Hierarchy Standard\n\/\/ and load shared objects using dlopen \/ dlsym).\nclass UnixCommon\n{\n\tpublic:\n\t\tstatic StringVector builtinAbsolutePaths()\n\t\t{\n\t\t\treturn {\n#if defined(JAMOMA_EXTENSIONS_INSTALL_PREFIX)\n\t\t\t\tJAMOMA_EXTENSIONS_INSTALL_PREFIX,\n#endif\n\t\t\t\t\"\/usr\/lib\/jamoma\",\n\t\t\t\t\"\/usr\/local\/lib\/jamoma\",\n\t\t\t\t\"\/usr\/jamoma\/lib\",\n\t\t\t\t\"\/usr\/jamoma\/extensions\",\n\t\t\t\t\"\/usr\/local\/jamoma\/lib\",\n\t\t\t\t\"\/usr\/local\/jamoma\/extensions\"\n\t\t\t};\n\t\t}\n\n\t\ttemplate<typename OS>\n\t\t\/\/ Try to load extensions. Returns \"true\" only if at least one extension was loaded.\n\t\tstatic bool loadClassesFromFolder(const string& folder)\n\t\t{\n\t\t\tDIR* dirp = opendir(folder.c_str());\n\t\t\tif(!dirp)\n\t\t\t\treturn false;\n\n\t\t\tdirent* dp{};\n\t\t\tint count = 0; \/\/ Number of extensions loaded.\n\t\t\twhile ((dp = readdir(dirp)))\n\t\t\t{\n\t\t\t\tif(loadClass<OS>(dp->d_name, \n\t\t\t\t\t\t\t\t folder,\n\t\t\t\t\t\t\t\t[] (const char * file) \n\t\t\t\t\t\t\t\t{ return dlopen(file, RTLD_LAZY); },\n\t\t\t\t\t\t\t\t[] (void* handle, const char * fun) \n\t\t\t\t\t\t\t\t{ return dlsym(handle, fun); }))\n\t\t\t\t{\n\t\t\t\t\t++count;\n\t\t\t\t}\n\t\t\t}\n\t\t\t\n\t\t\tclosedir(dirp);\n\t\t\t\n\t\t\tif(count > 0)\n\t\t\t{\n\t\t\t\tTTFoundationBinaryPath = folder.c_str();\n\t\t\t\treturn true;\n\t\t\t}\n\t\t\t\n\t\t\treturn false;\n\t\t}\n\n\t\t\/\/ Returns the path of the extensions\n\t\t\/\/ relative to the folder of the JamomaFoundation library\n\t\t\/\/ the application uses.\n\t\tstatic string computedRelativePath()\n\t\t{\n\t\t\tDl_info\t\tinfo;\n\t\t\tchar\t\tmainBundleStr[4096];\n\n\t\t\t\/\/ Use the path of JamomaFoundation\n\t\t\tif (dladdr((const void*)TTLoadExtensions, &info))\n\t\t\t{\n\t\t\t\tchar *c = 0;\n\n\t\t\t\tTTLogMessage(\"computedRelativePath(): %s\\n\", info.dli_fname);\n\n\t\t\t\tstrncpy(mainBundleStr, info.dli_fname, 4096);\n\t\t\t\tc = strrchr(mainBundleStr, '\/');\n\t\t\t\tif (c)\n\t\t\t\t\t*c = 0; \/\/ chop the \"\/JamomaFoundation.dylib\/so off of the path\n\t\t\t}\n\n\t\t\treturn mainBundleStr;\n\t\t}\n};\n#endif\n\n#if defined(TT_PLATFORM_MAC)\nclass OSXSpecific\n{\n\tpublic:\n\t\tstatic constexpr const char extensionPrefix[]{\"\"};\n\t\tstatic constexpr const char extensionSuffix[]{\".ttdylib\"};\n\n\t\tstatic string computedRelativePath()\n\t\t{ return UnixCommon::computedRelativePath(); }\n\n\t\tstatic StringVector builtinRelativePaths()\n\t\t{ return {\"..\/Frameworks\/jamoma\/extensions\"}; }\n\n\t\tstatic StringVector builtinAbsolutePaths()\n\t\t{ return UnixCommon::builtinAbsolutePaths(); }\n\n\t\tstatic bool loadClassesFromFolder(const string& folderName)\n\t\t{ return UnixCommon::loadClassesFromFolder<OSXSpecific>(folderName); }\n};\nusing OperatingSystem = OSXSpecific;\n#endif\n\/\/ TODO iOS & Static loading.\n\n#if defined(TT_PLATFORM_LINUX) && defined(__ANDROID_API__)\n#include <unistd.h>\n#include <iostream>\n\nclass AndroidSpecific\n{\n\tpublic:\n\t\tstatic constexpr const char extensionPrefix[]{\"lib\"};\n\t\tstatic constexpr const char extensionSuffix[]{\".so\"};\n\n\t\tstatic string computedRelativePath()\n\t\t{\n\t\t\tstring s{\"\/proc\/\" + string{getpid()} + \"\/cmdline\"};\n\t\t\tifstream input{s.c_str()};\n\t\t\tstring line;\n\t\t\tgetline(input, line);\n\t\t\treturn string{\"\/data\/data\/\"} + line + string{\"\/lib\"};\n\t\t}\n\n\t\tstatic StringVector builtinRelativePaths()\n\t\t{ return {}; }\n\n\t\tstatic StringVector builtinAbsolutePaths()\n\t\t{ return {}; }\n\n\t\tstatic bool loadClassesFromFolder(const string& folderName)\n\t\t{ return UnixCommon::loadClassesFromFolder<AndroidSpecific>(folderName); }\n};\nusing OperatingSystem = AndroidSpecific;\n#endif\n\n\n#if defined(TT_PLATFORM_LINUX)\nclass LinuxSpecific\n{\n\tpublic:\n\t\tstatic constexpr const char extensionPrefix[]{\"\"};\n\t\tstatic constexpr const char extensionSuffix[]{\".ttso\"};\n\n\t\tstatic string computedRelativePath()\n\t\t{ return UnixCommon::computedRelativePath(); }\n\n\t\tstatic StringVector builtinRelativePaths()\n\t\t{ return {\".\/extensions\"}; }\n\n\t\tstatic StringVector builtinAbsolutePaths()\n\t\t{ return UnixCommon::builtinAbsolutePaths(); }\n\n\t\tstatic bool loadClassesFromFolder(const string& folderName)\n\t\t{ return UnixCommon::loadClassesFromFolder<LinuxSpecific>(folderName); }\n};\nusing OperatingSystem = LinuxSpecific;\n#endif\n\n\n#if defined(TT_PLATFORM_WIN)\n#include <ShlObj.h>\n\nclass WinSpecific\n{\n\tpublic:\n\t\tstatic const char* extensionPrefix;\n\t\tstatic const char* extensionSuffix;\n\n\t\tstatic string computedRelativePath();\n\t\tstatic StringVector builtinRelativePaths();\n\t\tstatic StringVector builtinAbsolutePaths();\n\t\tstatic bool loadClassesFromFolder(const string& folder);\n};\n\n\/\/ Specializations since windows does not support constexpr yet.\ntemplate<>\nstring filenameToExtensionName<WinSpecific>(string name)\n{\n\tname.erase(end(name) - strlen(WinSpecific::extensionSuffix), end(name));\n\treturn name;\n}\n\ntemplate<>\nbool isExtensionFilename<WinSpecific>(const string& filename)\n{\n\tauto suffix_len = strlen(WinSpecific::extensionSuffix);\n\tif(filename.length() >= suffix_len)\n\t{\n\t\treturn (0 == filename.compare(\n\t\t\t\t\t\tfilename.length() - suffix_len,\n\t\t\t\t\t\tsuffix_len,\n\t\t\t\t\t\tWinSpecific::extensionSuffix));\n\t}\n\t\n\treturn false;\n}\n\nstring WinSpecific::computedRelativePath()\n{\n\tTTString\tfullpath{};\n\tchar\t\ttemppath[4096];\n\tLONG\t\tlRes;\n\n\tLPCSTR moduleName = \"JamomaFoundation.dll\";\n\tHMODULE\thmodule = GetModuleHandle(moduleName);\n\t\/\/ get the path\n\tGetModuleFileName(hmodule, (LPSTR)temppath, 4096);\n\n\tif (!FAILED(hmodule) && temppath[0]) \n\t{\n\t\tfullpath = temppath;\n\t\t\n\t\t\/\/ get support folder path\n\t\tfullpath = fullpath.substr(0, fullpath.length() - (strlen(moduleName) + 1));\n\t\tlRes = SHCreateDirectory(NULL, (LPCWSTR)fullpath.c_str());\n\t}\n\n\treturn fullpath.c_str();\n}\n\nStringVector WinSpecific::builtinRelativePaths()\n{\n\treturn {\".\/extensions\"};\n}\n\nStringVector WinSpecific::builtinAbsolutePaths()\n{\n\treturn {\n#if defined(JAMOMA_EXTENSIONS_INSTALL_PREFIX)\n\t\tJAMOMA_EXTENSIONS_INSTALL_PREFIX,\n#endif\n\t\t\"c:\\\\Program Files (x86)\\\\Jamoma\\\\extensions\"\n\t};\n}\n\nbool WinSpecific::loadClassesFromFolder(const string& folder)\n{\n\tauto windowsPathSpec = folder\n\t\t\t\t\t\t\t+ \"\/*\" \n\t\t\t\t\t\t\t+ string{WinSpecific::extensionSuffix};\n\tWIN32_FIND_DATA FindFileData;\n\tHANDLE hFind = FindFirstFile(windowsPathSpec.c_str(), &FindFileData);\n\n\tint count = 0; \/\/ Number of extensions loaded.\n\tif (hFind == INVALID_HANDLE_VALUE)\n\t\treturn false;\n\t\n\tdo {\n\t\tif(loadClass<WinSpecific>(\n\t\t\t\t\t\t FindFileData.cFileName, \n\t\t\t\t\t\t folder,\n\t\t\t\t\t\t[] (const char * file) \n\t\t\t\t\t\t{ return LoadLibrary(file); },\n\t\t\t\t\t\t[] (void* handle, const char * fun) \n\t\t\t\t\t\t{ return GetProcAddress((HMODULE) handle, fun); }))\n\t\t{\n\t\t\t++count;\n\t\t}\n\n\t} while (FindNextFile(hFind, &FindFileData));\n\tFindClose(hFind);\n\t\n\tif(count > 0)\n\t{\n\t\tTTFoundationBinaryPath = folder.c_str();\n\t\treturn true;\n\t}\n\t\t\t\n\treturn false;\n}\n\nusing OperatingSystem = WinSpecific;\n#endif\n\n\/\/ Because these members are static they have to be allocated in this compilation unit.\n#if defined(TT_PLATFORM_WIN)\nconst char* OperatingSystem::extensionPrefix{\"\"};\nconst char* OperatingSystem::extensionSuffix{\".ttdll\"};\n#else\nconstexpr const char OperatingSystem::extensionPrefix[array_length(OperatingSystem::extensionPrefix)];\nconstexpr const char OperatingSystem::extensionSuffix[array_length(OperatingSystem::extensionSuffix)];\n#endif\n\ntemplate<typename OS>\n\/\/ Try to load Jamoma classes from a vector of paths.\n\/\/ This will return on the first successful folder.\nbool loadClassesFromPaths(StringVector&& v)\n{\n\treturn find_if(begin(v), end(v), [] (const string& path)\n\t\t\t{ return OS::loadClassesFromFolder(path); }) != end(v);\n}\n\ntemplate<typename OS>\n\/\/ Try to load Jamoma classes from a path computed at runtime.\nbool loadClassesFromComputedPaths()\n{\n\tauto computedPath = OperatingSystem::computedRelativePath();\n\treturn (!computedPath.empty()\n\t\t\t&& OperatingSystem::loadClassesFromFolder(computedPath));\n}\n\ntemplate<typename OS>\n\/\/ Try to load Jamoma classes from the paths built-in for the \n\/\/ platform.\nbool loadClassesFromBuiltinPaths()\n{\n\treturn loadClassesFromPaths<OS>(OS::builtinRelativePaths()) || \n\t\t loadClassesFromPaths<OS>(OS::builtinAbsolutePaths());\n}\n\nvoid TTLoadExtensions(const char* pathToBinaries, bool loadFromOtherPaths)\n{\n\tif(!pathToBinaries)\n\t{\n\t\tif(!loadClassesFromComputedPaths<OperatingSystem>() && loadFromOtherPaths)\n\t\t{\n\t\t\tloadClassesFromBuiltinPaths<OperatingSystem>();\n\t\t}\n\t}\n\telse\n\t{\n\t\tif(!OperatingSystem::loadClassesFromFolder(pathToBinaries) && loadFromOtherPaths)\n\t\t{\n\t\t\tif(!loadClassesFromComputedPaths<OperatingSystem>())\n\t\t\t{\n\t\t\t\tloadClassesFromBuiltinPaths<OperatingSystem>();\n\t\t\t}\n\t\t}\n\t}\n\t\n\tif(TTFoundationBinaryPath == \"\")\n\t{\n\t\tTTLogMessage(\"Warning: no classes were loaded.\");\n\t}\n}\n<commit_msg>Fixes code style of TTExtensionLoader<commit_after>#include \"TTExtensionLoader.h\"\n#include \"TTFoundation.h\"\n#include \"TTEnvironment.h\"\n#include <vector>\n#include <string>\n\n\/\/ The organization here is as follows :\n\/\/ 1. TTLoadExtensions is called and selects the paths\n\/\/ where the extensions should be searched, in order.\n\/\/ As soon as extensions are found in a folder, the search stops.\n\/\/ 2. Platforms are defined as classes :\n\/\/ - TTUnixCommon contains generic data for Unix-like systems\n\/\/ - OS X, Linux, Android, Windows are the available platforms.\n\/\/ 3. Each platform has a specific way to list what's in a folder :\n\/\/ The relevant method is TTPlatform::TTLoadExtensionsFromFolder\n\/\/ 4. The algorithm to load a file is generic : TTLoadExtension. The\n\/\/ platform provides the algorithm with functions to get a handle.\n\n\nusing namespace std;\nusing TTStringVector = vector<string>;\n\n\/\/ Utility compile-time functions to work with string constants.\n\/\/ Except on windows, where constexpr will only be in VS2015 (hopefully...)\n\/\/ This would allow to shrink this file size by a small half.\n#if !defined(TT_PLATFORM_WIN)\ntemplate <typename T, size_t n>\nconstexpr size_t array_length(const T (&)[n])\n{ return n; }\n\ntemplate <typename T>\nconstexpr size_t string_length(T&& t)\n{ return array_length(forward<T&&>(t)) - 1; }\n\ntemplate<typename T>\nconstexpr bool string_empty(T&& t)\n{ return string_length(forward<T&&>(t)) == 0; }\n#endif\n\ntemplate<typename OS>\n\/\/ Returns true if the filename (ex. : AudioEngine.ttdylib)\n\/\/ is a correct extension filename for the platform we're in.\nbool TTIsExtensionFilename(const string& filename)\n{\n\tauto res = mismatch(begin(OS::extensionPrefix),\n\t\t\t\t\t\tend(OS::extensionPrefix),\n\t\t\t\t\t\tbegin(filename));\n\n\tif (string_empty(OS::extensionPrefix) || res.first == (end(OS::extensionPrefix)))\n\t{\n\t\tif(filename.length() >= string_length(OS::extensionSuffix))\n\t\t{\n\t\t\treturn (0 == filename.compare(\n\t\t\t\t\t\t\tfilename.length() - string_length(OS::extensionSuffix),\n\t\t\t\t\t\t\tstring_length(OS::extensionSuffix),\n\t\t\t\t\t\t\tOS::extensionSuffix));\n\t\t}\n\t}\n\n\treturn false;\n}\n\ntemplate<typename OS>\n\/\/ Gets the extension name from the file name.\n\/\/ ex. : libWebSocket.so on Android -> WebSocket\nstring TTFilenameToExtensionName(string name)\n{\n\t\/\/ Remove the prefix\n\tif(!string_empty(OS::extensionPrefix))\n\t\tname.erase(begin(name),\n\t\t\t\t begin(name) + string_length(OS::extensionPrefix));\n\n\t\/\/ Remove the suffix\n\tif(!string_empty(OS::extensionSuffix))\n\t\tname.erase(end(name) - string_length(OS::extensionSuffix),\n\t\t\t\t end(name));\n\n\treturn name;\n}\n\ntemplate<typename OS, typename Loader, typename GetProc>\n\/\/ A generic way to load classes.\n\/\/ Loader : a callable object that takes a filename of a shared object,\n\/\/ and returns a handle.\n\/\/ GetProc : a callable object that takes a handle and a function name,\n\/\/ and returns a pointer to the function.\nbool TTLoadExtension(const string& filename,\n\t\t\t const string& folder,\n\t\t\t Loader&& handle_fun,\n\t\t\t GetProc&& getproc_fun)\n{\n\t\/\/ Check if the file is a Jamoma extension\n\tif(!TTIsExtensionFilename<OS>(filename))\n\t\treturn false;\n\n\t\/\/ Get a handle\n\tvoid *handle = handle_fun((folder + \"\/\" + filename).c_str());\n\tif (!handle)\n\t{\n\t\tTTLogMessage(\"Error when trying to get an handle on %s.\\n\", filename.c_str());\n\t\treturn false;\n\t}\n\n\t\/\/ Load the Jamoma extension\n\tstring initFun = \"TTLoadJamomaExtension_\" + TTFilenameToExtensionName<OS>(filename);\n\tauto initializer = reinterpret_cast<TTExtensionInitializationMethod>(getproc_fun(handle, initFun.c_str()));\n\tif (initializer)\n\t{\n\t\tauto err = initializer();\n\t\tif(err != kTTErrNone)\n\t\t{\n\t\t\tTTLogMessage(\"Error when initializing extension %s.\\n\", filename.c_str());\n\t\t\treturn false;\n\t\t}\n\t\treturn true;\n\t}\n\treturn false;\n}\n\n\/\/ Here is the platform-specific code.\n\/\/ It is organized in the following fashion :\n\/\/\n\/\/ * Each platform has an extension prefix (e.g. \"lib\", required on Android) and suffix (e.g. \".ttdylib\").\n\/\/ * Platforms have these paths defined (they will be evaluated in this order) :\n\/\/ * A computed relative path (the path of the JamomaFoundation shared object)\n\/\/\t * Built-in relative paths (e.g. in an app bundle on OS X)\n\/\/\t * Built-in absolute paths (standard paths, e.g. \"\/usr\/local\/jamoma\"...\n\/\/\t and a compiled-in absolute path (to allow package maintainers to add their own paths)\n\/\/ * Common code for Unix-like platforms is abstracted in TTUnixCommon.\n#if defined(TT_PLATFORM_MAC) || defined(TT_PLATFORM_LINUX)\n#include <dlfcn.h>\n#include <dirent.h>\n\n\/\/ This class contains informations that are applicable to\n\/\/ UNIX-like systems (i.e. they respect the Filesystem Hierarchy Standard\n\/\/ and load shared objects using dlopen \/ dlsym).\nclass TTUnixCommon\n{\n\tpublic:\n\t\tstatic TTStringVector builtinAbsolutePaths()\n\t\t{\n\t\t\treturn {\n#if defined(JAMOMA_EXTENSIONS_INSTALL_PREFIX)\n\t\t\t\tJAMOMA_EXTENSIONS_INSTALL_PREFIX,\n#endif\n\t\t\t\t\"\/usr\/lib\/jamoma\",\n\t\t\t\t\"\/usr\/local\/lib\/jamoma\",\n\t\t\t\t\"\/usr\/jamoma\/lib\",\n\t\t\t\t\"\/usr\/jamoma\/extensions\",\n\t\t\t\t\"\/usr\/local\/jamoma\/lib\",\n\t\t\t\t\"\/usr\/local\/jamoma\/extensions\"\n\t\t\t};\n\t\t}\n\n\t\ttemplate<typename OS>\n\t\t\/\/ Try to load extensions. Returns \"true\" only if at least one extension was loaded.\n\t\tstatic bool TTLoadExtensionsFromFolder(const string& folder)\n\t\t{\n\t\t\tDIR* dirp = opendir(folder.c_str());\n\t\t\tif(!dirp)\n\t\t\t\treturn false;\n\n\t\t\tdirent* dp{};\n\t\t\tint count = 0; \/\/ Number of extensions loaded.\n\t\t\twhile ((dp = readdir(dirp)))\n\t\t\t{\n\t\t\t\tif(TTLoadExtension<OS>(dp->d_name,\n\t\t\t\t\t\t\t\t folder,\n\t\t\t\t\t\t\t\t[] (const char * file)\n\t\t\t\t\t\t\t\t{ return dlopen(file, RTLD_LAZY); },\n\t\t\t\t\t\t\t\t[] (void* handle, const char * fun)\n\t\t\t\t\t\t\t\t{ return dlsym(handle, fun); }))\n\t\t\t\t{\n\t\t\t\t\t++count;\n\t\t\t\t}\n\t\t\t}\n\n\t\t\tclosedir(dirp);\n\n\t\t\tif(count > 0)\n\t\t\t{\n\t\t\t\tTTFoundationBinaryPath = folder.c_str();\n\t\t\t\treturn true;\n\t\t\t}\n\n\t\t\treturn false;\n\t\t}\n\n\t\t\/\/ Returns the path of the extensions\n\t\t\/\/ relative to the folder of the JamomaFoundation library\n\t\t\/\/ the application uses.\n\t\tstatic string computedRelativePath()\n\t\t{\n\t\t\tDl_info\t\tinfo;\n\t\t\tchar\t\tmainBundleStr[4096];\n\n\t\t\t\/\/ Use the path of JamomaFoundation\n\t\t\tif (dladdr((const void*)TTLoadExtensions, &info))\n\t\t\t{\n\t\t\t\tchar *c = 0;\n\n\t\t\t\tTTLogMessage(\"computedRelativePath(): %s\\n\", info.dli_fname);\n\n\t\t\t\tstrncpy(mainBundleStr, info.dli_fname, 4096);\n\t\t\t\tc = strrchr(mainBundleStr, '\/');\n\t\t\t\tif (c)\n\t\t\t\t\t*c = 0; \/\/ chop the \"\/JamomaFoundation.dylib\/so off of the path\n\t\t\t}\n\n\t\t\treturn mainBundleStr;\n\t\t}\n};\n#endif\n\n#if defined(TT_PLATFORM_MAC)\nclass TTOSXSpecific\n{\n\tpublic:\n\t\tstatic constexpr const char extensionPrefix[]{\"\"};\n\t\tstatic constexpr const char extensionSuffix[]{\".ttdylib\"};\n\n\t\tstatic string computedRelativePath()\n\t\t{ return TTUnixCommon::computedRelativePath(); }\n\n\t\tstatic TTStringVector builtinRelativePaths()\n\t\t{ return {\"..\/Frameworks\/jamoma\/extensions\"}; }\n\n\t\tstatic TTStringVector builtinAbsolutePaths()\n\t\t{ return TTUnixCommon::builtinAbsolutePaths(); }\n\n\t\tstatic bool TTLoadExtensionsFromFolder(const string& folderName)\n\t\t{ return TTUnixCommon::TTLoadExtensionsFromFolder<TTOSXSpecific>(folderName); }\n};\nusing TTOperatingSystem = TTOSXSpecific;\n#endif\n\/\/ TODO iOS & Static loading.\n\n#if defined(TT_PLATFORM_LINUX) && defined(__ANDROID_API__)\n#include <unistd.h>\n#include <iostream>\n\nclass TTAndroidSpecific\n{\n\tpublic:\n\t\tstatic constexpr const char extensionPrefix[]{\"lib\"};\n\t\tstatic constexpr const char extensionSuffix[]{\".so\"};\n\n\t\tstatic string computedRelativePath()\n\t\t{\n\t\t\tstring s{\"\/proc\/\" + string{getpid()} + \"\/cmdline\"};\n\t\t\tifstream input{s.c_str()};\n\t\t\tstring line;\n\t\t\tgetline(input, line);\n\t\t\treturn string{\"\/data\/data\/\"} + line + string{\"\/lib\"};\n\t\t}\n\n\t\tstatic TTStringVector builtinRelativePaths()\n\t\t{ return {}; }\n\n\t\tstatic TTStringVector builtinAbsolutePaths()\n\t\t{ return {}; }\n\n\t\tstatic bool TTLoadExtensionsFromFolder(const string& folderName)\n\t\t{ return TTUnixCommon::TTLoadExtensionsFromFolder<TTAndroidSpecific>(folderName); }\n};\nusing TTOperatingSystem = TTAndroidSpecific;\n#endif\n\n\n#if defined(TT_PLATFORM_LINUX)\nclass TTLinuxSpecific\n{\n\tpublic:\n\t\tstatic constexpr const char extensionPrefix[]{\"\"};\n\t\tstatic constexpr const char extensionSuffix[]{\".ttso\"};\n\n\t\tstatic string computedRelativePath()\n\t\t{ return TTUnixCommon::computedRelativePath(); }\n\n\t\tstatic TTStringVector builtinRelativePaths()\n\t\t{ return {\".\/extensions\"}; }\n\n\t\tstatic TTStringVector builtinAbsolutePaths()\n\t\t{ return TTUnixCommon::builtinAbsolutePaths(); }\n\n\t\tstatic bool TTLoadExtensionsFromFolder(const string& folderName)\n\t\t{ return TTUnixCommon::TTLoadExtensionsFromFolder<TTLinuxSpecific>(folderName); }\n};\nusing TTOperatingSystem = TTLinuxSpecific;\n#endif\n\n\n#if defined(TT_PLATFORM_WIN)\n#include <ShlObj.h>\n\nclass TTWinSpecific\n{\n\tpublic:\n\t\tstatic const char* extensionPrefix;\n\t\tstatic const char* extensionSuffix;\n\n\t\tstatic string computedRelativePath();\n\t\tstatic TTStringVector builtinRelativePaths();\n\t\tstatic TTStringVector builtinAbsolutePaths();\n\t\tstatic bool TTLoadExtensionsFromFolder(const string& folder);\n};\n\n\/\/ Specializations since windows does not support constexpr yet.\ntemplate<>\nstring TTFilenameToExtensionName<TTWinSpecific>(string name)\n{\n\tname.erase(end(name) - strlen(TTWinSpecific::extensionSuffix), end(name));\n\treturn name;\n}\n\ntemplate<>\nbool TTIsExtensionFilename<TTWinSpecific>(const string& filename)\n{\n\tauto suffix_len = strlen(TTWinSpecific::extensionSuffix);\n\tif(filename.length() >= suffix_len)\n\t{\n\t\treturn (0 == filename.compare(\n\t\t\t\t\t\tfilename.length() - suffix_len,\n\t\t\t\t\t\tsuffix_len,\n\t\t\t\t\t\tTTWinSpecific::extensionSuffix));\n\t}\n\n\treturn false;\n}\n\nstring TTWinSpecific::computedRelativePath()\n{\n\tTTString\tfullpath{};\n\tchar\t\ttemppath[4096];\n\tLONG\t\tlRes;\n\n\tLPCSTR moduleName = \"JamomaFoundation.dll\";\n\tHMODULE\thmodule = GetModuleHandle(moduleName);\n\t\/\/ get the path\n\tGetModuleFileName(hmodule, (LPSTR)temppath, 4096);\n\n\tif (!FAILED(hmodule) && temppath[0])\n\t{\n\t\tfullpath = temppath;\n\n\t\t\/\/ get support folder path\n\t\tfullpath = fullpath.substr(0, fullpath.length() - (strlen(moduleName) + 1));\n\t\tlRes = SHCreateDirectory(NULL, (LPCWSTR)fullpath.c_str());\n\t}\n\n\treturn fullpath.c_str();\n}\n\nTTStringVector TTWinSpecific::builtinRelativePaths()\n{\n\treturn {\".\/extensions\"};\n}\n\nTTStringVector TTWinSpecific::builtinAbsolutePaths()\n{\n\treturn {\n#if defined(JAMOMA_EXTENSIONS_INSTALL_PREFIX)\n\t\tJAMOMA_EXTENSIONS_INSTALL_PREFIX,\n#endif\n\t\t\"c:\\\\Program Files (x86)\\\\Jamoma\\\\extensions\"\n\t};\n}\n\nbool TTWinSpecific::TTLoadExtensionsFromFolder(const string& folder)\n{\n\tauto windowsPathSpec = folder\n\t\t\t\t\t\t\t+ \"\/*\"\n\t\t\t\t\t\t\t+ string{TTWinSpecific::extensionSuffix};\n\tWIN32_FIND_DATA FindFileData;\n\tHANDLE hFind = FindFirstFile(windowsPathSpec.c_str(), &FindFileData);\n\n\tint count = 0; \/\/ Number of extensions loaded.\n\tif (hFind == INVALID_HANDLE_VALUE)\n\t\treturn false;\n\n\tdo {\n\t\tif(TTLoadExtension<TTWinSpecific>(\n\t\t\t\t\t\t FindFileData.cFileName,\n\t\t\t\t\t\t folder,\n\t\t\t\t\t\t[] (const char * file)\n\t\t\t\t\t\t{ return LoadLibrary(file); },\n\t\t\t\t\t\t[] (void* handle, const char * fun)\n\t\t\t\t\t\t{ return GetProcAddress((HMODULE) handle, fun); }))\n\t\t{\n\t\t\t++count;\n\t\t}\n\n\t} while (FindNextFile(hFind, &FindFileData));\n\tFindClose(hFind);\n\n\tif(count > 0)\n\t{\n\t\tTTFoundationBinaryPath = folder.c_str();\n\t\treturn true;\n\t}\n\n\treturn false;\n}\n\nusing TTOperatingSystem = TTWinSpecific;\n#endif\n\n\/\/ Because these members are static they have to be allocated in this compilation unit.\n#if defined(TT_PLATFORM_WIN)\nconst char* TTOperatingSystem::extensionPrefix{\"\"};\nconst char* TTOperatingSystem::extensionSuffix{\".ttdll\"};\n#else\nconstexpr const char TTOperatingSystem::extensionPrefix[array_length(TTOperatingSystem::extensionPrefix)];\nconstexpr const char TTOperatingSystem::extensionSuffix[array_length(TTOperatingSystem::extensionSuffix)];\n#endif\n\ntemplate<typename OS>\n\/\/ Try to load Jamoma classes from a vector of paths.\n\/\/ This will return on the first successful folder.\nbool TTLoadExtensionsFromPaths(TTStringVector&& v)\n{\n\treturn find_if(begin(v), end(v), [] (const string& path)\n\t\t\t{ return OS::TTLoadExtensionsFromFolder(path); }) != end(v);\n}\n\ntemplate<typename OS>\n\/\/ Try to load Jamoma classes from a path computed at runtime.\nbool TTLoadExtensionsFromComputedPaths()\n{\n\tauto computedPath = TTOperatingSystem::computedRelativePath();\n\treturn (!computedPath.empty()\n\t\t\t&& TTOperatingSystem::TTLoadExtensionsFromFolder(computedPath));\n}\n\ntemplate<typename OS>\n\/\/ Try to load Jamoma classes from the paths built-in for the\n\/\/ platform.\nbool TTLoadExtensionsFromBuiltinPaths()\n{\n\treturn TTLoadExtensionsFromPaths<OS>(OS::builtinRelativePaths()) ||\n\t\t TTLoadExtensionsFromPaths<OS>(OS::builtinAbsolutePaths());\n}\n\nvoid TTLoadExtensions(const char* pathToBinaries, bool loadFromOtherPaths)\n{\n\tif(!pathToBinaries)\n\t{\n\t\tif(!TTLoadExtensionsFromComputedPaths<TTOperatingSystem>() && loadFromOtherPaths)\n\t\t{\n\t\t\tTTLoadExtensionsFromBuiltinPaths<TTOperatingSystem>();\n\t\t}\n\t}\n\telse\n\t{\n\t\tif(!TTOperatingSystem::TTLoadExtensionsFromFolder(pathToBinaries) && loadFromOtherPaths)\n\t\t{\n\t\t\tif(!TTLoadExtensionsFromComputedPaths<TTOperatingSystem>())\n\t\t\t{\n\t\t\t\tTTLoadExtensionsFromBuiltinPaths<TTOperatingSystem>();\n\t\t\t}\n\t\t}\n\t}\n\n\tif(TTFoundationBinaryPath == \"\")\n\t{\n\t\tTTLogMessage(\"Warning: no classes were loaded.\");\n\t}\n}\n<|endoftext|>"} {"text":"<commit_before>#include <QPainter>\n#include <QTimer>\n\n#include \"CommentLib.h\"\n\n#include \"AssassinWar.h\"\n#include \"MapLoader.h\"\n\nAssassinWar::AssassinWar(QWidget *parent, Qt::WFlags flags)\n : QMainWindow(parent, flags),\n m_pRepaintTimer(NULL)\n{\n ui.setupUi(this);\n\n MapLoader mapLoader;\n QWidget* pMapWidget = mapLoader.LoadMap(\".\/map\/map1.ui\");\n mapLoader.LoadMapTerrain(*pMapWidget);\n\n m_pRepaintTimer = new QTimer(this);\n connect(m_pRepaintTimer, SIGNAL(timeout()), this, SLOT(repaint()));\n m_pRepaintTimer->start(250);\n}\n\nAssassinWar::~AssassinWar()\n{\n m_pRepaintTimer->stop();\n}\n\nvoid AssassinWar::paintEvent(QPaintEvent *PaintEvent)\n{\n static float a = 0.0f;\n\n if(60 < a)\n {\n a = 0.0f;\n }\n\n QPainter painter(this);\n painter.drawLine(++a, 0.0, 15.0, 25.0);\/\/ drawing code\n}<commit_msg>Signed-off-by: flymianmian <flymianmian@163.com><commit_after>#include <QPainter>\n#include <QTimer>\n\n#include \"CommentLib.h\"\n\n#include \"AssassinWar.h\"\n#include \"MapLoader.h\"\n\nAssassinWar::AssassinWar(QWidget *parent, Qt::WFlags flags)\n : QMainWindow(parent, flags),\n m_pRepaintTimer(NULL)\n{\n ui.setupUi(this);\n\n MapLoader mapLoader;\n QWidget* pMapWidget = mapLoader.LoadMap(\".\/map\/map1.ui\");\n mapLoader.LoadMapTerrain(*pMapWidget);\n\n showFullScreen();\n\n ui.mainToolBar->hide();\n\n m_pRepaintTimer = new QTimer(this);\n connect(m_pRepaintTimer, SIGNAL(timeout()), this, SLOT(repaint()));\n m_pRepaintTimer->start(240);\n}\n\nAssassinWar::~AssassinWar()\n{\n m_pRepaintTimer->stop();\n}\n\nvoid AssassinWar::paintEvent(QPaintEvent *PaintEvent)\n{\n static float a = 0.0f;\n\n if(60 < a)\n {\n a = 0.0f;\n }\n\n QPainter painter(this);\n painter.drawLine(++a, 0.0, 15.0, 25.0);\/\/ drawing code\n}<|endoftext|>"} {"text":"<commit_before>\/*\n * Copyright 2008-2009 NVIDIA Corporation\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n *\/\n\n\n\/*! \\file reduce.inl\n * \\brief Inline file for reduce.h\n *\/\n\n#pragma once\n\n\/\/ do not attempt to compile this file with any other compiler\n#ifdef __CUDACC__\n\n\/\/ to configure launch parameters\n#include <thrust\/experimental\/arch.h>\n\n#include <thrust\/detail\/raw_buffer.h>\n#include <thrust\/detail\/device\/cuda\/block\/reduce.h>\n\nnamespace thrust\n{\nnamespace detail\n{\nnamespace device\n{\nnamespace cuda\n{\n\n\/*\n * Reduce a vector of n elements using binary_op()\n *\n * The order of reduction is not defined, so binary_op() should\n * be a commutative (and associative) operator such as \n * (integer) addition. Since floating point operations\n * do not completely satisfy these criteria, the result is \n * generally not the same as a consecutive reduction of \n * the elements.\n * \n * Uses the same pattern as reduce6() in the CUDA SDK\n *\n *\/\n\ntemplate<typename InputIterator,\n typename OutputType,\n typename BinaryFunction>\n __global__ void\n reduce_n_kernel(InputIterator input,\n const unsigned int n,\n OutputType * block_results, \n BinaryFunction binary_op)\n{\n extern __shared__ OutputType sdata[];\n\n \/\/ perform first level of reduction,\n \/\/ write per-block results to global memory for second level reduction\n \n const unsigned int grid_size = blockDim.x * gridDim.x;\n unsigned int i = blockDim.x * blockIdx.x + threadIdx.x;\n\n \/\/ local (per-thread) sum\n OutputType sum;\n \n \/\/ initialize local sum \n if (i < n)\n {\n sum = thrust::detail::device::dereference(input, i);\n i += grid_size;\n }\n\n \/\/ update sum\n while (i < n)\n {\n sum = binary_op(sum, thrust::detail::device::dereference(input, i));\n i += grid_size;\n } \n\n \/\/ copy local sum to shared memory\n sdata[threadIdx.x] = sum; __syncthreads();\n\n \/\/ compute reduction across block\n block::reduce_n(sdata, min(n, blockDim.x), binary_op);\n\n \/\/ write result for this block to global mem \n if (threadIdx.x == 0) \n block_results[blockIdx.x] = sdata[threadIdx.x];\n\n} \/\/ end reduce_n_kernel()\n\n\ntemplate<typename InputIterator,\n typename SizeType,\n typename OutputType,\n typename BinaryFunction>\n OutputType reduce_n(InputIterator first,\n SizeType n,\n OutputType init,\n BinaryFunction binary_op)\n{\n \/\/ handle zero length array case first\n if( n == 0 )\n return init;\n\n \/\/ determine launch parameters\n const size_t block_size = thrust::experimental::arch::max_blocksize_with_highest_occupancy(reduce_n_kernel<InputIterator, OutputType, BinaryFunction>, sizeof(OutputType));\n const size_t smem_size = block_size * sizeof(OutputType);\n const size_t max_blocks = thrust::experimental::arch::max_active_blocks(reduce_n_kernel<InputIterator, OutputType, BinaryFunction>, block_size, smem_size);\n const size_t num_blocks = std::min(max_blocks, std::max((size_t) 1, n \/ block_size));\n\n \/\/ allocate storage for per-block results\n thrust::detail::raw_device_buffer<OutputType> temp(num_blocks + 1);\n\n \/\/ set first element of temp array to init\n temp[0] = init;\n\n \/\/ reduce input to per-block sums\n reduce_n_kernel<<<num_blocks, block_size, smem_size>>>(first, n, raw_pointer_cast(&temp[1]), binary_op);\n\n \/\/ reduce per-block sums together with init\n reduce_n_kernel<<< 1, block_size, smem_size>>>(raw_pointer_cast(&temp[0]), num_blocks + 1, raw_pointer_cast(&temp[0]), binary_op);\n\n return temp[0];\n} \/\/ end reduce_n()\n\n} \/\/ end namespace cuda\n} \/\/ end namespace device\n} \/\/ end namespace detail\n} \/\/ end namespace thrust\n\n#endif \/\/ __CUDACC__\n\n<commit_msg>cuda::reduce() now works for partially used blocks<commit_after>\/*\n * Copyright 2008-2009 NVIDIA Corporation\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n *\/\n\n\n\/*! \\file reduce.inl\n * \\brief Inline file for reduce.h\n *\/\n\n\/\/ do not attempt to compile this file with any other compiler\n#ifdef __CUDACC__\n\n\/\/ to configure launch parameters\n#include <thrust\/experimental\/arch.h>\n\n#include <thrust\/detail\/raw_buffer.h>\n#include <thrust\/detail\/device\/cuda\/block\/reduce.h>\n\nnamespace thrust\n{\nnamespace detail\n{\nnamespace device\n{\nnamespace cuda\n{\n\n\/*\n * Reduce a vector of n elements using binary_op()\n *\n * The order of reduction is not defined, so binary_op() should\n * be a commutative (and associative) operator such as \n * (integer) addition. Since floating point operations\n * do not completely satisfy these criteria, the result is \n * generally not the same as a consecutive reduction of \n * the elements.\n * \n * Uses the same pattern as reduce6() in the CUDA SDK\n *\n *\/\n\ntemplate<typename InputIterator,\n typename OutputType,\n typename BinaryFunction>\n __global__ void\n reduce_n_kernel(InputIterator input,\n const unsigned int n,\n OutputType * block_results, \n BinaryFunction binary_op)\n{\n extern __shared__ OutputType sdata[];\n\n \/\/ perform first level of reduction,\n \/\/ write per-block results to global memory for second level reduction\n \n const unsigned int grid_size = blockDim.x * gridDim.x;\n unsigned int i = blockDim.x * blockIdx.x + threadIdx.x;\n\n \/\/ local (per-thread) sum\n OutputType sum;\n \n \/\/ initialize local sum \n if (i < n)\n {\n sum = thrust::detail::device::dereference(input, i);\n i += grid_size;\n } \n\n \/\/ accumulate local sum\n while (i < n)\n {\n sum = binary_op(sum, thrust::detail::device::dereference(input, i));\n i += grid_size;\n } \n\n \/\/ copy local sum to shared memory\n sdata[threadIdx.x] = sum; __syncthreads();\n\n \/\/ compute reduction across block\n block::reduce_n(sdata, min(n - blockDim.x * blockIdx.x, blockDim.x), binary_op);\n\n \/\/ write result for this block to global mem \n if (threadIdx.x == 0) \n block_results[blockIdx.x] = sdata[threadIdx.x];\n\n} \/\/ end reduce_n_kernel()\n\n\ntemplate<typename InputIterator,\n typename SizeType,\n typename OutputType,\n typename BinaryFunction>\n OutputType reduce_n(InputIterator first,\n SizeType n,\n OutputType init,\n BinaryFunction binary_op)\n{\n \/\/ handle zero length array case first\n if( n == 0 )\n return init;\n\n \/\/ determine launch parameters\n const size_t block_size = thrust::experimental::arch::max_blocksize_with_highest_occupancy(reduce_n_kernel<InputIterator, OutputType, BinaryFunction>, sizeof(OutputType));\n const size_t smem_size = block_size * sizeof(OutputType);\n const size_t max_blocks = thrust::experimental::arch::max_active_blocks(reduce_n_kernel<InputIterator, OutputType, BinaryFunction>, block_size, smem_size);\n const size_t num_blocks = std::min(max_blocks, (n + block_size - 1) \/ block_size);\n\n \/\/ allocate storage for per-block results\n thrust::detail::raw_device_buffer<OutputType> temp(num_blocks + 1);\n\n \/\/ set first element of temp array to init\n temp[0] = init;\n\n \/\/ reduce input to per-block sums\n reduce_n_kernel<<<num_blocks, block_size, smem_size>>>(first, n, raw_pointer_cast(&temp[1]), binary_op);\n\n \/\/ reduce per-block sums together with init\n reduce_n_kernel<<< 1, block_size, smem_size>>>(raw_pointer_cast(&temp[0]), num_blocks + 1, raw_pointer_cast(&temp[0]), binary_op);\n\n return temp[0];\n} \/\/ end reduce_n()\n\n} \/\/ end namespace cuda\n} \/\/ end namespace device\n} \/\/ end namespace detail\n} \/\/ end namespace thrust\n\n#endif \/\/ __CUDACC__\n\n<|endoftext|>"} {"text":"<commit_before>\/*\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\/\/ SKIRT -- an advanced radiative transfer code \/\/\/\/\n\/\/\/\/ © Astronomical Observatory, Ghent University \/\/\/\/\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/*\/\n\n#include <cmath>\n#include <fstream>\n#include \"FatalError.hpp\"\n#include \"FilePaths.hpp\"\n#include \"ISRF.hpp\"\n#include \"Log.hpp\"\n#include \"NR.hpp\"\n#include \"PlanckFunction.hpp\"\n#include \"WavelengthGrid.hpp\"\n\nusing namespace std;\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nArray ISRF::mathis(SimulationItem* simitem)\n{\n WavelengthGrid* lambdagrid = simitem->find<WavelengthGrid>();\n int Nlambda = lambdagrid->Nlambda();\n\n const double Wv[] = {1e-14,1e-13,4e-13};\n const double Tv[] = {7500.0,4000.0,3000.0};\n const double lambda912 = 912e-10;\n const double lambda110 = 110e-9;\n const double lambda134 = 134e-9;\n const double lambda246 = 246e-9;\n const Array& lambdav = lambdagrid->lambdav();\n int ell912 = NR::locate_clip(lambdav,lambda912);\n int ell110 = NR::locate_clip(lambdav,lambda110);\n int ell134 = NR::locate_clip(lambdav,lambda134);\n int ell246 = NR::locate_clip(lambdav,lambda246);\n\n Array Jv(Nlambda);\n for (int ell=ell912+1; ell<=ell110; ell++)\n Jv[ell] = 38.57 * pow(lambdav[ell]*1e6,3.4172);\n for (int ell=ell110+1; ell<=ell134; ell++)\n Jv[ell] = 2.045e-2;\n for (int ell=ell134+1; ell<=ell246; ell++)\n Jv[ell] = 7.115e-4 * pow(lambdav[ell]*1e6,-1.6678);\n for (int ell=0; ell<=ell246; ell++)\n Jv[ell] *= 1e3; \/\/ conversion from erg\/cm2\/s\/micron to W\/m3\n for (int i=0; i<3; i++)\n {\n PlanckFunction B(Tv[i]);\n for (int ell=ell246+1; ell<Nlambda; ell++)\n Jv[ell] += 4*M_PI* Wv[i] * B(lambdav[ell]);\n }\n Jv \/= (4*M_PI);\n return Jv;\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nArray ISRF::kruegel(SimulationItem* simitem)\n{\n \/\/ Read the data from the file into local vectors lambdav[k] and Jv[k]\n const int Nlambda = 435;\n QString filename = FilePaths::resource(\"ISRF\/ISRF-Kruegel.dat\");\n ifstream file(filename.toLocal8Bit().constData());\n if (! file.is_open()) throw FATALERROR(\"Could not open the data file \" + filename);\n simitem->find<Log>()->info(\"Reading ISRF data from file \" + filename + \"...\");\n Array lambdav(Nlambda);\n Array Jv(Nlambda);\n for (int k = 0; k<Nlambda; k++)\n {\n file >> lambdav[k] >> Jv[k];\n }\n file.close();\n simitem->find<Log>()->info(\"File \" + filename + \" closed.\");\n\n \/\/ resample on the simulation's wavelength grid\n WavelengthGrid* lambdagrid = simitem->find<WavelengthGrid>();\n return NR::resample<NR::interpolate_loglog>(lambdagrid->lambdav(), lambdav, Jv);\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n<commit_msg>adjust Mathis ISRF to SHG benchmark parametrization<commit_after>\/*\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\/\/ SKIRT -- an advanced radiative transfer code \/\/\/\/\n\/\/\/\/ © Astronomical Observatory, Ghent University \/\/\/\/\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/*\/\n\n#include <cmath>\n#include <fstream>\n#include \"FatalError.hpp\"\n#include \"FilePaths.hpp\"\n#include \"ISRF.hpp\"\n#include \"Log.hpp\"\n#include \"NR.hpp\"\n#include \"PlanckFunction.hpp\"\n#include \"WavelengthGrid.hpp\"\n\nusing namespace std;\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nArray ISRF::mathis(SimulationItem* simitem)\n{\n WavelengthGrid* lambdagrid = simitem->find<WavelengthGrid>();\n const Array& lambdav = lambdagrid->lambdav();\n int Nlambda = lambdagrid->Nlambda();\n int ellA = NR::locate_clip(lambdav, 0.0912e-6);\n int ellB = NR::locate_clip(lambdav, 0.110e-6);\n int ellC = NR::locate_clip(lambdav, 0.134e-6);\n int ellD = NR::locate_clip(lambdav, 0.250e-6);\n\n const double Wv[] = {1e-14,1e-13,4e-13};\n const double Tv[] = {7500,4000,3000};\n\n Array Jv(Nlambda);\n for (int ell=ellA+1; ell<=ellB; ell++)\n Jv[ell] = 3069. * pow(lambdav[ell]*1e6,3.4172);\n for (int ell=ellB+1; ell<=ellC; ell++)\n Jv[ell] = 1.627;\n for (int ell=ellC+1; ell<=ellD; ell++)\n Jv[ell] = 0.0566 * pow(lambdav[ell]*1e6,-1.6678);\n for (int i=0; i<3; i++)\n {\n PlanckFunction B(Tv[i]);\n for (int ell=ellD+1; ell<Nlambda; ell++)\n Jv[ell] += Wv[i] * B(lambdav[ell]);\n }\n return Jv;\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nArray ISRF::kruegel(SimulationItem* simitem)\n{\n \/\/ Read the data from the file into local vectors lambdav[k] and Jv[k]\n const int Nlambda = 435;\n QString filename = FilePaths::resource(\"ISRF\/ISRF-Kruegel.dat\");\n ifstream file(filename.toLocal8Bit().constData());\n if (! file.is_open()) throw FATALERROR(\"Could not open the data file \" + filename);\n simitem->find<Log>()->info(\"Reading ISRF data from file \" + filename + \"...\");\n Array lambdav(Nlambda);\n Array Jv(Nlambda);\n for (int k = 0; k<Nlambda; k++)\n {\n file >> lambdav[k] >> Jv[k];\n }\n file.close();\n simitem->find<Log>()->info(\"File \" + filename + \" closed.\");\n\n \/\/ resample on the simulation's wavelength grid\n WavelengthGrid* lambdagrid = simitem->find<WavelengthGrid>();\n return NR::resample<NR::interpolate_loglog>(lambdagrid->lambdav(), lambdav, Jv);\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n<|endoftext|>"} {"text":"<commit_before>\/*\n * Copyright (c) 2017 Axel Isouard <axel@isouard.fr>\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n *\/\n\n#include <uv.h>\n#include <algorithm>\n#include <iterator>\n#include \"event.h\"\n#include \"eventqueue.h\"\n\nEventQueue::EventQueue() {\n _async = new uv_async_t;\n uv_async_init(uv_default_loop(), _async,\n reinterpret_cast<uv_async_cb>(EventQueue::AsyncCallback));\n\n _async->data = this;\n uv_mutex_init(&_async_lock);\n}\n\nEventQueue::~EventQueue() {\n uv_mutex_destroy(&_async_lock);\n}\n\nvoid EventQueue::AsyncCallback(uv_async_t *handle, int status) {\n EventQueue *self = reinterpret_cast<EventQueue*>(handle->data);\n\n if (!self) {\n return;\n }\n\n self->Flush();\n}\n\nvoid EventQueue::HandleEvent(Event *event) {\n event->Handle();\n delete event;\n}\n\nvoid EventQueue::PushEvent(Event *event) {\n uv_mutex_lock(&_async_lock);\n\n _queue.push_back(event);\n\n uv_mutex_unlock(&_async_lock);\n uv_async_send(this->_async);\n}\n\nvoid EventQueue::Flush() {\n std::vector<Event*> eventList;\n\n uv_mutex_lock(&_async_lock);\n\n if (_queue.empty()) {\n uv_mutex_unlock(&_async_lock);\n return;\n }\n\n std::copy(_queue.begin(), _queue.end(), std::back_inserter(eventList));\n _queue.clear();\n\n uv_mutex_unlock(&_async_lock);\n std::for_each(eventList.begin(), eventList.end(), EventQueue::HandleEvent);\n eventList.clear();\n}\n<commit_msg>EventQueue: Delete async handle during destruction<commit_after>\/*\n * Copyright (c) 2017 Axel Isouard <axel@isouard.fr>\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n *\/\n\n#include <uv.h>\n#include <algorithm>\n#include <iterator>\n#include \"event.h\"\n#include \"eventqueue.h\"\n\nEventQueue::EventQueue() {\n _async = new uv_async_t;\n uv_async_init(uv_default_loop(), _async,\n reinterpret_cast<uv_async_cb>(EventQueue::AsyncCallback));\n\n _async->data = this;\n uv_mutex_init(&_async_lock);\n}\n\nEventQueue::~EventQueue() {\n uv_mutex_destroy(&_async_lock);\n delete _async;\n}\n\nvoid EventQueue::AsyncCallback(uv_async_t *handle, int status) {\n EventQueue *self = reinterpret_cast<EventQueue*>(handle->data);\n\n if (!self) {\n return;\n }\n\n self->Flush();\n}\n\nvoid EventQueue::HandleEvent(Event *event) {\n event->Handle();\n delete event;\n}\n\nvoid EventQueue::PushEvent(Event *event) {\n uv_mutex_lock(&_async_lock);\n\n _queue.push_back(event);\n\n uv_mutex_unlock(&_async_lock);\n uv_async_send(this->_async);\n}\n\nvoid EventQueue::Flush() {\n std::vector<Event*> eventList;\n\n uv_mutex_lock(&_async_lock);\n\n if (_queue.empty()) {\n uv_mutex_unlock(&_async_lock);\n return;\n }\n\n std::copy(_queue.begin(), _queue.end(), std::back_inserter(eventList));\n _queue.clear();\n\n uv_mutex_unlock(&_async_lock);\n std::for_each(eventList.begin(), eventList.end(), EventQueue::HandleEvent);\n eventList.clear();\n}\n<|endoftext|>"} {"text":"<commit_before>\/\/===------------------------ exception.cpp -------------------------------===\/\/\n\/\/\n\/\/ The LLVM Compiler Infrastructure\n\/\/\n\/\/ This file is dual licensed under the MIT and the University of Illinois Open\n\/\/ Source Licenses. See LICENSE.TXT for details.\n\/\/\n\/\/===----------------------------------------------------------------------===\/\/\n#include <stdlib.h>\n\n#include \"exception\"\n\n#if __APPLE__\n #include <cxxabi.h>\n\n using namespace __cxxabiv1;\n #define HAVE_DEPENDENT_EH_ABI 1\n #ifndef _LIBCPPABI_VERSION\n using namespace __cxxabiapple;\n \/\/ On Darwin, there are two STL shared libraries and a lower level ABI\n \/\/ shared libray. The globals holding the current terminate handler and\n \/\/ current unexpected handler are in the ABI library.\n #define __terminate_handler __cxxabiapple::__cxa_terminate_handler\n #define __unexpected_handler __cxxabiapple::__cxa_unexpected_handler\n #endif \/\/ _LIBCPPABI_VERSION\n#elif defined(LIBCXXRT)\n #include <cxxabi.h>\n using namespace __cxxabiv1;\n #define HAVE_DEPENDENT_EH_ABI 1\n#else \/\/ __APPLE__\n static std::terminate_handler __terminate_handler;\n static std::unexpected_handler __unexpected_handler;\n#endif \/\/ __APPLE__\n\nnamespace std\n{\n\n#if !defined(LIBCXXRT) && !defined(_LIBCPPABI_VERSION)\n\n\/\/ libcxxrt provides implementations of these functions itself.\nunexpected_handler\nset_unexpected(unexpected_handler func) _NOEXCEPT\n{\n return __sync_lock_test_and_set(&__unexpected_handler, func);\n}\n\nunexpected_handler\nget_unexpected() _NOEXCEPT\n{\n return __sync_fetch_and_add(&__unexpected_handler, (unexpected_handler)0);\n}\n\n_ATTRIBUTE(noreturn)\nvoid\nunexpected()\n{\n (*get_unexpected())();\n \/\/ unexpected handler should not return\n terminate();\n}\n\nterminate_handler\nset_terminate(terminate_handler func) _NOEXCEPT\n{\n return __sync_lock_test_and_set(&__terminate_handler, func);\n}\n\nterminate_handler\nget_terminate() _NOEXCEPT\n{\n return __sync_fetch_and_add(&__terminate_handler, (terminate_handler)0);\n}\n\n_ATTRIBUTE(noreturn)\nvoid\nterminate() _NOEXCEPT\n{\n#ifndef _LIBCPP_NO_EXCEPTIONS\n try\n {\n#endif \/\/ _LIBCPP_NO_EXCEPTIONS\n (*get_terminate())();\n \/\/ handler should not return\n ::abort ();\n#ifndef _LIBCPP_NO_EXCEPTIONS\n }\n catch (...)\n {\n \/\/ handler should not throw exception\n ::abort ();\n }\n#endif \/\/ _LIBCPP_NO_EXCEPTIONS\n}\n#endif \/\/ !defined(LIBCXXRT) && !defined(_LIBCPPABI_VERSION)\n\n#ifndef LIBCXXRT\nbool uncaught_exception() _NOEXCEPT\n{\n#if __APPLE__\n \/\/ on Darwin, there is a helper function so __cxa_get_globals is private\n return __cxa_uncaught_exception();\n#elif LIBCXXRT\n __cxa_eh_globals * globals = __cxa_get_globals();\n return (globals->uncaughtExceptions != 0);\n#else \/\/ __APPLE__\n #warning uncaught_exception not yet implemented\n ::abort();\n#endif \/\/ __APPLE__\n}\n\n#ifndef _LIBCPPABI_VERSION\n\nexception::~exception() _NOEXCEPT\n{\n}\n\nconst char* exception::what() const _NOEXCEPT\n{\n return \"std::exception\";\n}\n\n#endif \/\/ _LIBCPPABI_VERSION\n#endif \/\/LIBCXXRT\n#ifndef _LIBCPPABI_VERSION\n\nbad_exception::~bad_exception() _NOEXCEPT\n{\n}\n\nconst char* bad_exception::what() const _NOEXCEPT\n{\n return \"std::bad_exception\";\n}\n\n#endif\n\n\nexception_ptr::~exception_ptr() _NOEXCEPT\n{\n#if HAVE_DEPENDENT_EH_ABI\n __cxa_decrement_exception_refcount(__ptr_);\n#else\n #warning exception_ptr not yet implemented\n ::abort();\n#endif \/\/ __APPLE__\n}\n\nexception_ptr::exception_ptr(const exception_ptr& other) _NOEXCEPT\n : __ptr_(other.__ptr_)\n{\n#if HAVE_DEPENDENT_EH_ABI\n __cxa_increment_exception_refcount(__ptr_);\n#else\n #warning exception_ptr not yet implemented\n ::abort();\n#endif \/\/ __APPLE__\n}\n\nexception_ptr& exception_ptr::operator=(const exception_ptr& other) _NOEXCEPT\n{\n#if HAVE_DEPENDENT_EH_ABI\n if (__ptr_ != other.__ptr_)\n {\n __cxa_increment_exception_refcount(other.__ptr_);\n __cxa_decrement_exception_refcount(__ptr_);\n __ptr_ = other.__ptr_;\n }\n return *this;\n#else \/\/ __APPLE__\n #warning exception_ptr not yet implemented\n ::abort();\n#endif \/\/ __APPLE__\n}\n\nnested_exception::nested_exception() _NOEXCEPT\n : __ptr_(current_exception())\n{\n}\n\nnested_exception::~nested_exception() _NOEXCEPT\n{\n}\n\n_ATTRIBUTE(noreturn)\nvoid\nnested_exception::rethrow_nested() const\n{\n if (__ptr_ == nullptr)\n terminate();\n rethrow_exception(__ptr_);\n}\n\n\nexception_ptr current_exception() _NOEXCEPT\n{\n#if HAVE_DEPENDENT_EH_ABI\n \/\/ be nicer if there was a constructor that took a ptr, then\n \/\/ this whole function would be just:\n \/\/ return exception_ptr(__cxa_current_primary_exception());\n exception_ptr ptr;\n ptr.__ptr_ = __cxa_current_primary_exception();\n return ptr;\n#else \/\/ __APPLE__\n #warning exception_ptr not yet implemented\n ::abort();\n#endif \/\/ __APPLE__\n}\n\n_ATTRIBUTE(noreturn)\nvoid rethrow_exception(exception_ptr p)\n{\n#if HAVE_DEPENDENT_EH_ABI\n __cxa_rethrow_primary_exception(p.__ptr_);\n \/\/ if p.__ptr_ is NULL, above returns so we terminate\n terminate();\n#else \/\/ __APPLE__\n #warning exception_ptr not yet implemented\n ::abort();\n#endif \/\/ __APPLE__\n}\n} \/\/ std\n<commit_msg>Teach libc++ to check for libc++abi and use its features if they're available.<commit_after>\/\/===------------------------ exception.cpp -------------------------------===\/\/\n\/\/\n\/\/ The LLVM Compiler Infrastructure\n\/\/\n\/\/ This file is dual licensed under the MIT and the University of Illinois Open\n\/\/ Source Licenses. See LICENSE.TXT for details.\n\/\/\n\/\/===----------------------------------------------------------------------===\/\/\n#include <stdlib.h>\n\n#include \"exception\"\n\n#ifndef __has_include\n#define __has_include(inc) 0\n#endif\n\n#if __APPLE__\n #include <cxxabi.h>\n\n using namespace __cxxabiv1;\n #define HAVE_DEPENDENT_EH_ABI 1\n #ifndef _LIBCPPABI_VERSION\n using namespace __cxxabiapple;\n \/\/ On Darwin, there are two STL shared libraries and a lower level ABI\n \/\/ shared libray. The globals holding the current terminate handler and\n \/\/ current unexpected handler are in the ABI library.\n #define __terminate_handler __cxxabiapple::__cxa_terminate_handler\n #define __unexpected_handler __cxxabiapple::__cxa_unexpected_handler\n #endif \/\/ _LIBCPPABI_VERSION\n#elif defined(LIBCXXRT) || __has_include(<cxxabi.h>)\n #include <cxxabi.h>\n using namespace __cxxabiv1;\n #if defined(LIBCXXRT) || defined(_LIBCPPABI_VERSION)\n #define HAVE_DEPENDENT_EH_ABI 1\n #endif\n#else \/\/ __has_include(<cxxabi.h>)\n static std::terminate_handler __terminate_handler;\n static std::unexpected_handler __unexpected_handler;\n#endif \/\/ __has_include(<cxxabi.h>)\n\nnamespace std\n{\n\n#if !defined(LIBCXXRT) && !defined(_LIBCPPABI_VERSION)\n\n\/\/ libcxxrt provides implementations of these functions itself.\nunexpected_handler\nset_unexpected(unexpected_handler func) _NOEXCEPT\n{\n return __sync_lock_test_and_set(&__unexpected_handler, func);\n}\n\nunexpected_handler\nget_unexpected() _NOEXCEPT\n{\n return __sync_fetch_and_add(&__unexpected_handler, (unexpected_handler)0);\n}\n\n_ATTRIBUTE(noreturn)\nvoid\nunexpected()\n{\n (*get_unexpected())();\n \/\/ unexpected handler should not return\n terminate();\n}\n\nterminate_handler\nset_terminate(terminate_handler func) _NOEXCEPT\n{\n return __sync_lock_test_and_set(&__terminate_handler, func);\n}\n\nterminate_handler\nget_terminate() _NOEXCEPT\n{\n return __sync_fetch_and_add(&__terminate_handler, (terminate_handler)0);\n}\n\n_ATTRIBUTE(noreturn)\nvoid\nterminate() _NOEXCEPT\n{\n#ifndef _LIBCPP_NO_EXCEPTIONS\n try\n {\n#endif \/\/ _LIBCPP_NO_EXCEPTIONS\n (*get_terminate())();\n \/\/ handler should not return\n ::abort ();\n#ifndef _LIBCPP_NO_EXCEPTIONS\n }\n catch (...)\n {\n \/\/ handler should not throw exception\n ::abort ();\n }\n#endif \/\/ _LIBCPP_NO_EXCEPTIONS\n}\n#endif \/\/ !defined(LIBCXXRT) && !defined(_LIBCPPABI_VERSION)\n\n#ifndef LIBCXXRT\nbool uncaught_exception() _NOEXCEPT\n{\n#if __APPLE__ || defined(_LIBCPPABI_VERSION)\n \/\/ on Darwin, there is a helper function so __cxa_get_globals is private\n return __cxa_uncaught_exception();\n#else \/\/ __APPLE__\n #warning uncaught_exception not yet implemented\n ::abort();\n#endif \/\/ __APPLE__\n}\n\n#ifndef _LIBCPPABI_VERSION\n\nexception::~exception() _NOEXCEPT\n{\n}\n\nconst char* exception::what() const _NOEXCEPT\n{\n return \"std::exception\";\n}\n\n#endif \/\/ _LIBCPPABI_VERSION\n#endif \/\/LIBCXXRT\n#ifndef _LIBCPPABI_VERSION\n\nbad_exception::~bad_exception() _NOEXCEPT\n{\n}\n\nconst char* bad_exception::what() const _NOEXCEPT\n{\n return \"std::bad_exception\";\n}\n\n#endif\n\n\nexception_ptr::~exception_ptr() _NOEXCEPT\n{\n#if HAVE_DEPENDENT_EH_ABI\n __cxa_decrement_exception_refcount(__ptr_);\n#else\n #warning exception_ptr not yet implemented\n ::abort();\n#endif \/\/ __APPLE__\n}\n\nexception_ptr::exception_ptr(const exception_ptr& other) _NOEXCEPT\n : __ptr_(other.__ptr_)\n{\n#if HAVE_DEPENDENT_EH_ABI\n __cxa_increment_exception_refcount(__ptr_);\n#else\n #warning exception_ptr not yet implemented\n ::abort();\n#endif \/\/ __APPLE__\n}\n\nexception_ptr& exception_ptr::operator=(const exception_ptr& other) _NOEXCEPT\n{\n#if HAVE_DEPENDENT_EH_ABI\n if (__ptr_ != other.__ptr_)\n {\n __cxa_increment_exception_refcount(other.__ptr_);\n __cxa_decrement_exception_refcount(__ptr_);\n __ptr_ = other.__ptr_;\n }\n return *this;\n#else \/\/ __APPLE__\n #warning exception_ptr not yet implemented\n ::abort();\n#endif \/\/ __APPLE__\n}\n\nnested_exception::nested_exception() _NOEXCEPT\n : __ptr_(current_exception())\n{\n}\n\nnested_exception::~nested_exception() _NOEXCEPT\n{\n}\n\n_ATTRIBUTE(noreturn)\nvoid\nnested_exception::rethrow_nested() const\n{\n if (__ptr_ == nullptr)\n terminate();\n rethrow_exception(__ptr_);\n}\n\n\nexception_ptr current_exception() _NOEXCEPT\n{\n#if HAVE_DEPENDENT_EH_ABI\n \/\/ be nicer if there was a constructor that took a ptr, then\n \/\/ this whole function would be just:\n \/\/ return exception_ptr(__cxa_current_primary_exception());\n exception_ptr ptr;\n ptr.__ptr_ = __cxa_current_primary_exception();\n return ptr;\n#else \/\/ __APPLE__\n #warning exception_ptr not yet implemented\n ::abort();\n#endif \/\/ __APPLE__\n}\n\n_ATTRIBUTE(noreturn)\nvoid rethrow_exception(exception_ptr p)\n{\n#if HAVE_DEPENDENT_EH_ABI\n __cxa_rethrow_primary_exception(p.__ptr_);\n \/\/ if p.__ptr_ is NULL, above returns so we terminate\n terminate();\n#else \/\/ __APPLE__\n #warning exception_ptr not yet implemented\n ::abort();\n#endif \/\/ __APPLE__\n}\n} \/\/ std\n<|endoftext|>"} {"text":"<commit_before>\/* Please refer to license.txt *\/\n\n#include <sys\/stat.h>\n#include <errno.h>\n#include <stdio.h>\n#include <iostream>\n#include <string.h>\n#include <dirent.h>\n\n#include \"file.hpp\"\n\n#include \"..\/error\/error.hpp\"\n\n#include \"..\/string\/string.hpp\"\n\n#include \"..\/internal_header.hpp\"\n\nnamespace mfile\n{\n\nFileManager::FileManager()\n{\n}\n\nFileManager::~FileManager()\n{\n}\n\nvoid FileManager::exportFile(std::string filepath, std::string output_data, bool overwrite) \/\/Export a file.\n{\n\tFILE *file = nullptr; \/\/The file.\n\n\tif (overwrite) file = fopen(filepath.c_str(), \"w+\"); \/\/Open the file for writing, overwriting whatever currently exists, if anything.\n\telse file = fopen(filepath.c_str(), \"a\"); \/\/Open the file for writing. Do not overwrite, append.\n\n\tif (!file) \/\/Error checking.\n\t{\n\t\t\/\/cout << \"Failed to open file: \\\"\" << filepath << \"\\\".\\n\"; \/\/Let the user know there was an error.\n\t\t\/\/cout << \"Attempting to create folder...\\n\"; \/\/Let the user know we're trying to create the directory.\n\n\t\t\/\/TODO: This portiong needs to be put into a \"make_directories_until()\" function.\n\n\t\t\/\/TODO: This needs to be adjusted to recursively make the missing folders.\n\n\t\tbool start_saving = false; \/\/Start saving the characters from the string?\n\t\tstd::string folderpath = \"\"; \/\/The folderpath.\n\t\tstd::string temp_string = \"\"; \/\/Folderpath is initially read into this, backwards. Used for ordering it correctly.\n\t\tfor (int i = filepath.length() - 1; i >= 0; --i) \/\/Loop through and extract the folderpath\n\t\t{\n\t\t\tif (!start_saving && (filepath[i] == '\\\\' || filepath[i] == '\/')) \/\/If not already saving the characters...Check if it's a \/ or \\ character.\n\t\t\t{\n\t\t\t\tstart_saving = true; \/\/Yay, end of filename found, now we can extract the folderpath.\n\t\t\t}\n\t\t\tif (start_saving) \/\/Ok, it is saving the characters.\n\t\t\t{\n\t\t\t\ttemp_string += filepath[i]; \/\/Save the character.\n\t\t\t}\n\t\t}\n\t\tfor (int i = temp_string.length() - 1; i >= 0; --i) \/\/Now reverse the order of characters so that the folderpath is no longer backwards.\n\t\t{\n\t\t\tfolderpath += temp_string[i]; \/\/Save the character.\n\t\t}\n\n\t\ttry\n\t\t{\n\t\t\tmkDir(\".\/\" + folderpath); \/\/Create the folder. With error checking.\n\t\t}\n\t\tcatch (...)\n\t\t{\n\t\t\tstd::string *filename = new std::string; \/\/The filename.\n\t\t\t*filename = mstring::toString(__FILE__); \/\/Convert the char* that is filename to a string.\n\t\t\tstd::string *message = new std::string;\n\t\t\t*message = \"Failed to create directory: \\\"\";\n\t\t\t*message += folderpath;\n\t\t\t*message += \"\\\".\";\n\t\t\tmerror::Error *error = generateError(merror::FUNCTION_FAILURE, message, merror::SEVERITY_IGNORE, __LINE__, filename);\n\t\t\tthrow error;\n\t\t}\n\n\t\tif (overwrite) file = fopen(filepath.c_str(), \"w+\"); \/\/Open the file for writing, overwriting any currently existing file.\n\t\telse file = fopen(filepath.c_str(), \"a\"); \/\/Open the file for writing. Do not overwrite, append.\n\n\t\tif (!file) \/\/Error checking.\n\t\t{\n\t\t\tstd::string *filename = new std::string; \/\/The filename.\n\t\t\t*filename = mstring::toString(__FILE__); \/\/Convert the char* that is filename to a string.\n\t\t\tstd::string *message = new std::string;\n\t\t\t*message = \"Failed to create file.\";\n\t\t\tmerror::Error *error = generateError(merror::FUNCTION_FAILURE, message, merror::SEVERITY_IGNORE, __LINE__, filename);\n\t\t\tthrow error; \/\/Failure.\n\t\t}\n\n\t\t\/\/TODO: End portion that needs being put into a \"make_directories_until()\" function.\n\t}\n\n\tfprintf(file, output_data.c_str()); \/\/Write out the string.\n\n\tfclose(file); \/\/Close the file.\n} \/\/FileManager::exportFile()\n\nvoid FileManager::mkDir(std::string path) \/\/Create a directory at the specified location.\n{\n\t#if OS == OS_WINDOWS \/\/If the operating system is windows.\n\t\tif (mkdir(path.c_str()) == -1) \/\/Create the directory.\n\t\t{\n\t\t\t\/\/throw strerror(errno); \/\/Throw an error. \/\/TODO: Refine the error to use the error module.\n\t\t\tstd::string *error_message = new std::string; \/\/The error message.\n\t\t\t*error_message = mstring::toString(strerror(errno)); \/\/Convert the char* that is strerror to a string.\n\t\t\tstd::string *filename = new std::string; \/\/The filename.\n\t\t\t*filename = mstring::toString(__FILE__); \/\/Convert the char* that is filename to a string.\n\t\t\tmerror::Error *error = generateError(merror::FUNCTION_FAILURE, error_message, merror::SEVERITY_IGNORE, __LINE__, filename);\n\t\t\tthrow error;\n\t\t}\n\t#else \/\/OS is not windows.\n\t\tif (mkdir(path.c_str(), 0777) == -1)\/\/creating a directory\n\t\t{\n\t\t\t\/\/throw strerror(errno); \/\/Throw an error. \/\/TODO: Refine the error to use the error module.\n\t\t\tstd::string *error_message = new std::string; \/\/The error message.\n\t\t\t*error_message = mstring::toString(strerror(errno)); \/\/Convert the char* that is strerror to a string.\n\t\t\tstd::string *filename = new std::string; \/\/The filename.\n\t\t\t*filename = mstring::toString(__FILE__); \/\/Convert the char* that is filename to a string.\n\t\t\tmerror::Error *error = generateError(merror::FUNCTION_FAILURE, error_message, merror::SEVERITY_IGNORE, __LINE__, filename);\n\t\t\tthrow error;\n\t\t}\n\t#endif\n}\n\nbool FileManager::directoryExists(std::string path) \/\/Checks if specified directory exists.\n{\n\t\/\/This function could probably be done better with a call to an external library's superoptimised directory_exists() function.\n\t\/\/But, until such a time that we have such a library, this will be used.\n\n\t\/\/TODO: This portion probably can be put into an external function.\n\n\t\/\/This portion of code determines the path to the directory the directory we're looking for is in.\n\n\tbool start_saving = false; \/\/Start saving the characters from the string?\n\tstd::string folderpath = \"\"; \/\/The folderpath.\n\tstd::string temp_string = \"\"; \/\/Folderpath is initially read into this, backwards. Used for ordering it correctly.\n\tstd::string directory_name_reverse = \"\"; \/\/The name of the folder it's looking for. Reversed. This is used because the path is read backwards and everything after the slash is chopped off, thus determining the directory we're looking for's name.\n\tstd::string directory_name = \"\"; \/\/The name of the folder it's looking for.\n\tfor (int i = path.length() - 1; i >= 0; --i) \/\/Loop through and extract the folderpath. Pretty much the folder the folder is in.\n\t{\n\t\tif (!start_saving && (path[i] == '\\\\' || path[i] == '\/')) \/\/If not already saving the characters...Check if it's a \/ or \\ character.\n\t\t{\n\t\t\tstart_saving = true; \/\/Yay, end of filename found, now we can extract the folderpath.\n\t\t\tdirectory_name_reverse += path[i];\n\t\t}\n\t\telse if (start_saving) \/\/Ok, it is saving the characters.\n\t\t{\n\t\t\ttemp_string += path[i]; \/\/Save the character.\n\t\t}\n\t}\n\tfor (int i = temp_string.length() - 1; i >= 0; --i) \/\/Now reverse the order of characters so that the folderpath is no longer backwards.\n\t{\n\t\tfolderpath += temp_string[i]; \/\/Save the character.\n\t}\n\tfor (int i = directory_name_reverse.length() - 1; i >= 0; --i)\n\t{\n\t\tif (directory_name_reverse[i] != '\\\\' && directory_name_reverse[i] != '\/') directory_name += directory_name_reverse[i];\n\t}\n\t\/\/TODO: End portion that can be put in external function.\n\n\t\/\/This portion of code looks at all the contents in the directory of the directory we're checking the existence of, and looks to see if the directory exists.\n\t\/\/If it does, then return true. Else return false.\n\n\tstd::vector<std::string> folders; \/\/Stores all the folder names it finds.\n\n\tgetFolders(folderpath, folders); \/\/Grabs all the folders in the folder containing the folder which we're checking the existence of.\n\t\t\n\tif (folders.size() == 0)\n\t{\n\t\treturn false; \/\/If it found nothing...The directory definitely does not exist!\n\t}\n\n\tfor (unsigned int i = 0; i < folders.size(); ++i)\n\t{\n\t\tif (folders[i] == directory_name) return true; \/\/Yes, directory exists.\n\t}\n\n\treturn false; \/\/Default case: does not exist.\n} \/\/FileManager::directoryExists()\n\nvoid FileManager::seperatePathFromFilename(std::string &path_with_filename, std::string &path)\n{\n\t\/\/Loop from the back, find the \/, chop off everything.\n\n\tint count = 0;\n\tstd::string input(path_with_filename);\n\tstd::cout << \"Starting with: \" << input << \"\\n\";\n\tstd::string::iterator i = input.end();\n\tbool done = false;\n\twhile (!done)\n\t{\n\t\t\/\/If it found where the filepath ends...\n\t\tif ((*i) != '\\\\')\n\t\t{\n\t\t\t--i; \/\/Keep going.\n\t\t\tinput.pop_back(); \/\/Delete the last character.\n\t\t\tcount++;\n\t\t}\n\t\telse\n\t\t{\n\t\t\tdone = true;\n\t\t}\n\t}\n\n\tpath = input;\n}\n\nvoid FileManager::getFolders(std::string path, std::vector<std::string> &folders) \/\/Get all the folders in a directory.\n{\n\t#if OS == OS_WINDOWS\n\t\tstruct stat s; \/\/Required for the Windows version of the code \n\t#endif\n\n\tDIR *dir ; \/\/Open the bases folder.\n\n\tif ((dir = opendir(path.c_str())) == nullptr) \/\/Open directory. With error checking.\n\t{\n\t\tstd::string *filename = new std::string; \/\/The filename.\n\t\t*filename = mstring::toString(__FILE__); \/\/Convert the char* that is filename to a string.\n\t\tstd::string *message = new std::string;\n\t\t*message = \"Failed to open directory.\";\n\t\tmerror::Error *error = generateError(merror::FUNCTION_FAILURE, message, merror::SEVERITY_IGNORE, __LINE__, filename);\n\t\tthrow error;\n\t}\n\n\tstruct dirent *entry = readdir(dir); \/\/The current directory entry\n\n\twhile (entry != NULL) \/\/Loop through all the folders (and files) in this directory.\n\t{\n\t\t#if OS == OS_WINDOWS\n\n\t\t\t\/\/TODO: Test this to see if it works in Windows.\n\n\t\t\tstat(entry->d_name, &s);\n\t\t\tif (s.st_mode & S_IFDIR)\n\t\t\t{\n\t\t\t\tif (strcmp(entry->d_name, \".\") != 0 && strcmp(entry->d_name, \"..\") != 0) \/\/Make sure it's not the current directory, or the one containing this directory!\n\t\t\t\t{\n\t\t\t\t\tfolders.push_back(entry->d_name);\n\t\t\t\t}\n\t\t\t}\n\n\t\t\tentry = readdir(dir); \/\/Load in the next entry.\n\n\t\t#else\n\n\t\t\tif (entry->d_type == DT_DIR) \/\/If the entry type is a folder.\n\t\t\t{\n\t\t\t\tif (strcmp(entry->d_name, \".\") != 0 && strcmp(entry->d_name, \"..\") != 0) \/\/Make sure it's not the current directory, or the one containing this directory!\n\t\t\t\t{\n\t\t\t\t\tfolders.push_back(entry->d_name);\n\t\t\t\t}\n\t\t\t}\n\n\t\t#endif\n\t}\n\n\tclosedir(dir);\n} \/\/FileManager::getFolders()\n\n} \/\/namespace mfile\n<commit_msg>Done testing, fixed the seperatePathFromFilename function (it should be fixed anyway.<commit_after>\/* Please refer to license.txt *\/\n\n#include <sys\/stat.h>\n#include <errno.h>\n#include <stdio.h>\n#include <iostream>\n#include <string.h>\n#include <dirent.h>\n\n#include \"file.hpp\"\n\n#include \"..\/error\/error.hpp\"\n\n#include \"..\/string\/string.hpp\"\n\n#include \"..\/internal_header.hpp\"\n\nnamespace mfile\n{\n\nFileManager::FileManager()\n{\n}\n\nFileManager::~FileManager()\n{\n}\n\nvoid FileManager::exportFile(std::string filepath, std::string output_data, bool overwrite) \/\/Export a file.\n{\n\tFILE *file = nullptr; \/\/The file.\n\n\tif (overwrite) file = fopen(filepath.c_str(), \"w+\"); \/\/Open the file for writing, overwriting whatever currently exists, if anything.\n\telse file = fopen(filepath.c_str(), \"a\"); \/\/Open the file for writing. Do not overwrite, append.\n\n\tif (!file) \/\/Error checking.\n\t{\n\t\t\/\/cout << \"Failed to open file: \\\"\" << filepath << \"\\\".\\n\"; \/\/Let the user know there was an error.\n\t\t\/\/cout << \"Attempting to create folder...\\n\"; \/\/Let the user know we're trying to create the directory.\n\n\t\t\/\/TODO: This portiong needs to be put into a \"make_directories_until()\" function.\n\n\t\t\/\/TODO: This needs to be adjusted to recursively make the missing folders.\n\n\t\tbool start_saving = false; \/\/Start saving the characters from the string?\n\t\tstd::string folderpath = \"\"; \/\/The folderpath.\n\t\tstd::string temp_string = \"\"; \/\/Folderpath is initially read into this, backwards. Used for ordering it correctly.\n\t\tfor (int i = filepath.length() - 1; i >= 0; --i) \/\/Loop through and extract the folderpath\n\t\t{\n\t\t\tif (!start_saving && (filepath[i] == '\\\\' || filepath[i] == '\/')) \/\/If not already saving the characters...Check if it's a \/ or \\ character.\n\t\t\t{\n\t\t\t\tstart_saving = true; \/\/Yay, end of filename found, now we can extract the folderpath.\n\t\t\t}\n\t\t\tif (start_saving) \/\/Ok, it is saving the characters.\n\t\t\t{\n\t\t\t\ttemp_string += filepath[i]; \/\/Save the character.\n\t\t\t}\n\t\t}\n\t\tfor (int i = temp_string.length() - 1; i >= 0; --i) \/\/Now reverse the order of characters so that the folderpath is no longer backwards.\n\t\t{\n\t\t\tfolderpath += temp_string[i]; \/\/Save the character.\n\t\t}\n\n\t\ttry\n\t\t{\n\t\t\tmkDir(\".\/\" + folderpath); \/\/Create the folder. With error checking.\n\t\t}\n\t\tcatch (...)\n\t\t{\n\t\t\tstd::string *filename = new std::string; \/\/The filename.\n\t\t\t*filename = mstring::toString(__FILE__); \/\/Convert the char* that is filename to a string.\n\t\t\tstd::string *message = new std::string;\n\t\t\t*message = \"Failed to create directory: \\\"\";\n\t\t\t*message += folderpath;\n\t\t\t*message += \"\\\".\";\n\t\t\tmerror::Error *error = generateError(merror::FUNCTION_FAILURE, message, merror::SEVERITY_IGNORE, __LINE__, filename);\n\t\t\tthrow error;\n\t\t}\n\n\t\tif (overwrite) file = fopen(filepath.c_str(), \"w+\"); \/\/Open the file for writing, overwriting any currently existing file.\n\t\telse file = fopen(filepath.c_str(), \"a\"); \/\/Open the file for writing. Do not overwrite, append.\n\n\t\tif (!file) \/\/Error checking.\n\t\t{\n\t\t\tstd::string *filename = new std::string; \/\/The filename.\n\t\t\t*filename = mstring::toString(__FILE__); \/\/Convert the char* that is filename to a string.\n\t\t\tstd::string *message = new std::string;\n\t\t\t*message = \"Failed to create file.\";\n\t\t\tmerror::Error *error = generateError(merror::FUNCTION_FAILURE, message, merror::SEVERITY_IGNORE, __LINE__, filename);\n\t\t\tthrow error; \/\/Failure.\n\t\t}\n\n\t\t\/\/TODO: End portion that needs being put into a \"make_directories_until()\" function.\n\t}\n\n\tfprintf(file, output_data.c_str()); \/\/Write out the string.\n\n\tfclose(file); \/\/Close the file.\n} \/\/FileManager::exportFile()\n\nvoid FileManager::mkDir(std::string path) \/\/Create a directory at the specified location.\n{\n\t#if OS == OS_WINDOWS \/\/If the operating system is windows.\n\t\tif (mkdir(path.c_str()) == -1) \/\/Create the directory.\n\t\t{\n\t\t\t\/\/throw strerror(errno); \/\/Throw an error. \/\/TODO: Refine the error to use the error module.\n\t\t\tstd::string *error_message = new std::string; \/\/The error message.\n\t\t\t*error_message = mstring::toString(strerror(errno)); \/\/Convert the char* that is strerror to a string.\n\t\t\tstd::string *filename = new std::string; \/\/The filename.\n\t\t\t*filename = mstring::toString(__FILE__); \/\/Convert the char* that is filename to a string.\n\t\t\tmerror::Error *error = generateError(merror::FUNCTION_FAILURE, error_message, merror::SEVERITY_IGNORE, __LINE__, filename);\n\t\t\tthrow error;\n\t\t}\n\t#else \/\/OS is not windows.\n\t\tif (mkdir(path.c_str(), 0777) == -1)\/\/creating a directory\n\t\t{\n\t\t\t\/\/throw strerror(errno); \/\/Throw an error. \/\/TODO: Refine the error to use the error module.\n\t\t\tstd::string *error_message = new std::string; \/\/The error message.\n\t\t\t*error_message = mstring::toString(strerror(errno)); \/\/Convert the char* that is strerror to a string.\n\t\t\tstd::string *filename = new std::string; \/\/The filename.\n\t\t\t*filename = mstring::toString(__FILE__); \/\/Convert the char* that is filename to a string.\n\t\t\tmerror::Error *error = generateError(merror::FUNCTION_FAILURE, error_message, merror::SEVERITY_IGNORE, __LINE__, filename);\n\t\t\tthrow error;\n\t\t}\n\t#endif\n}\n\nbool FileManager::directoryExists(std::string path) \/\/Checks if specified directory exists.\n{\n\t\/\/This function could probably be done better with a call to an external library's superoptimised directory_exists() function.\n\t\/\/But, until such a time that we have such a library, this will be used.\n\n\t\/\/TODO: This portion probably can be put into an external function.\n\n\t\/\/This portion of code determines the path to the directory the directory we're looking for is in.\n\n\tbool start_saving = false; \/\/Start saving the characters from the string?\n\tstd::string folderpath = \"\"; \/\/The folderpath.\n\tstd::string temp_string = \"\"; \/\/Folderpath is initially read into this, backwards. Used for ordering it correctly.\n\tstd::string directory_name_reverse = \"\"; \/\/The name of the folder it's looking for. Reversed. This is used because the path is read backwards and everything after the slash is chopped off, thus determining the directory we're looking for's name.\n\tstd::string directory_name = \"\"; \/\/The name of the folder it's looking for.\n\tfor (int i = path.length() - 1; i >= 0; --i) \/\/Loop through and extract the folderpath. Pretty much the folder the folder is in.\n\t{\n\t\tif (!start_saving && (path[i] == '\\\\' || path[i] == '\/')) \/\/If not already saving the characters...Check if it's a \/ or \\ character.\n\t\t{\n\t\t\tstart_saving = true; \/\/Yay, end of filename found, now we can extract the folderpath.\n\t\t\tdirectory_name_reverse += path[i];\n\t\t}\n\t\telse if (start_saving) \/\/Ok, it is saving the characters.\n\t\t{\n\t\t\ttemp_string += path[i]; \/\/Save the character.\n\t\t}\n\t}\n\tfor (int i = temp_string.length() - 1; i >= 0; --i) \/\/Now reverse the order of characters so that the folderpath is no longer backwards.\n\t{\n\t\tfolderpath += temp_string[i]; \/\/Save the character.\n\t}\n\tfor (int i = directory_name_reverse.length() - 1; i >= 0; --i)\n\t{\n\t\tif (directory_name_reverse[i] != '\\\\' && directory_name_reverse[i] != '\/') directory_name += directory_name_reverse[i];\n\t}\n\t\/\/TODO: End portion that can be put in external function.\n\n\t\/\/This portion of code looks at all the contents in the directory of the directory we're checking the existence of, and looks to see if the directory exists.\n\t\/\/If it does, then return true. Else return false.\n\n\tstd::vector<std::string> folders; \/\/Stores all the folder names it finds.\n\n\tgetFolders(folderpath, folders); \/\/Grabs all the folders in the folder containing the folder which we're checking the existence of.\n\t\t\n\tif (folders.size() == 0)\n\t{\n\t\treturn false; \/\/If it found nothing...The directory definitely does not exist!\n\t}\n\n\tfor (unsigned int i = 0; i < folders.size(); ++i)\n\t{\n\t\tif (folders[i] == directory_name) return true; \/\/Yes, directory exists.\n\t}\n\n\treturn false; \/\/Default case: does not exist.\n} \/\/FileManager::directoryExists()\n\nvoid FileManager::seperatePathFromFilename(std::string &path_with_filename, std::string &path)\n{\n\t\/\/Loop from the back, find the \/, chop off everything.\n\n\tstd::string input(path_with_filename);\n\tstd::string::iterator i = input.end();\n\tbool done = false;\n\twhile (!done)\n\t{\n\t\t\/\/If it found where the filepath ends...\n\t\tif ((*i) != '\/')\n\t\t{\n\t\t\t--i; \/\/Keep going.\n\t\t\tinput.pop_back(); \/\/Delete the last character.\n\t\t}\n\t\telse\n\t\t{\n\t\t\tdone = true;\n\t\t}\n\t}\n\n\tpath = input;\n}\n\nvoid FileManager::getFolders(std::string path, std::vector<std::string> &folders) \/\/Get all the folders in a directory.\n{\n\t#if OS == OS_WINDOWS\n\t\tstruct stat s; \/\/Required for the Windows version of the code \n\t#endif\n\n\tDIR *dir ; \/\/Open the bases folder.\n\n\tif ((dir = opendir(path.c_str())) == nullptr) \/\/Open directory. With error checking.\n\t{\n\t\tstd::string *filename = new std::string; \/\/The filename.\n\t\t*filename = mstring::toString(__FILE__); \/\/Convert the char* that is filename to a string.\n\t\tstd::string *message = new std::string;\n\t\t*message = \"Failed to open directory.\";\n\t\tmerror::Error *error = generateError(merror::FUNCTION_FAILURE, message, merror::SEVERITY_IGNORE, __LINE__, filename);\n\t\tthrow error;\n\t}\n\n\tstruct dirent *entry = readdir(dir); \/\/The current directory entry\n\n\twhile (entry != NULL) \/\/Loop through all the folders (and files) in this directory.\n\t{\n\t\t#if OS == OS_WINDOWS\n\n\t\t\t\/\/TODO: Test this to see if it works in Windows.\n\n\t\t\tstat(entry->d_name, &s);\n\t\t\tif (s.st_mode & S_IFDIR)\n\t\t\t{\n\t\t\t\tif (strcmp(entry->d_name, \".\") != 0 && strcmp(entry->d_name, \"..\") != 0) \/\/Make sure it's not the current directory, or the one containing this directory!\n\t\t\t\t{\n\t\t\t\t\tfolders.push_back(entry->d_name);\n\t\t\t\t}\n\t\t\t}\n\n\t\t\tentry = readdir(dir); \/\/Load in the next entry.\n\n\t\t#else\n\n\t\t\tif (entry->d_type == DT_DIR) \/\/If the entry type is a folder.\n\t\t\t{\n\t\t\t\tif (strcmp(entry->d_name, \".\") != 0 && strcmp(entry->d_name, \"..\") != 0) \/\/Make sure it's not the current directory, or the one containing this directory!\n\t\t\t\t{\n\t\t\t\t\tfolders.push_back(entry->d_name);\n\t\t\t\t}\n\t\t\t}\n\n\t\t#endif\n\t}\n\n\tclosedir(dir);\n} \/\/FileManager::getFolders()\n\n} \/\/namespace mfile\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 <limits>\n\n#include \"grpc\/grpc.h\"\n#include \"grpc\/support\/time.h\"\n#include \"timeval.h\"\n\nnamespace grpc {\nnamespace node {\n\ngpr_timespec MillisecondsToTimespec(double millis) {\n if (millis == std::numeric_limits<double>::infinity()) {\n return gpr_inf_future(GPR_CLOCK_REALTIME);\n } else if (millis == -std::numeric_limits<double>::infinity()) {\n return gpr_inf_past(GPR_CLOCK_REALTIME);\n } else {\n return gpr_time_from_micros(static_cast<int64_t>(millis * 1000),\n GPR_CLOCK_REALTIME);\n }\n}\n\ndouble TimespecToMilliseconds(gpr_timespec timespec) {\n if (gpr_time_cmp(timespec, gpr_inf_future(GPR_CLOCK_REALTIME)) == 0) {\n return std::numeric_limits<double>::infinity();\n } else if (gpr_time_cmp(timespec, gpr_inf_past(GPR_CLOCK_REALTIME)) == 0) {\n return -std::numeric_limits<double>::infinity();\n } else {\n return (static_cast<double>(timespec.tv_sec) * 1000 +\n static_cast<double>(timespec.tv_nsec) \/ 1000000);\n }\n}\n\n} \/\/ namespace node\n} \/\/ namespace grpc\n<commit_msg>Make the server report monotonic times for deadlines<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 <limits>\n\n#include \"grpc\/grpc.h\"\n#include \"grpc\/support\/time.h\"\n#include \"timeval.h\"\n\nnamespace grpc {\nnamespace node {\n\ngpr_timespec MillisecondsToTimespec(double millis) {\n if (millis == std::numeric_limits<double>::infinity()) {\n return gpr_inf_future(GPR_CLOCK_REALTIME);\n } else if (millis == -std::numeric_limits<double>::infinity()) {\n return gpr_inf_past(GPR_CLOCK_REALTIME);\n } else {\n return gpr_time_from_micros(static_cast<int64_t>(millis * 1000),\n GPR_CLOCK_REALTIME);\n }\n}\n\ndouble TimespecToMilliseconds(gpr_timespec timespec) {\n timespec = gpr_convert_clock_type(timespec, GPR_CLOCK_REALTIME);\n if (gpr_time_cmp(timespec, gpr_inf_future(GPR_CLOCK_REALTIME)) == 0) {\n return std::numeric_limits<double>::infinity();\n } else if (gpr_time_cmp(timespec, gpr_inf_past(GPR_CLOCK_REALTIME)) == 0) {\n return -std::numeric_limits<double>::infinity();\n } else {\n return (static_cast<double>(timespec.tv_sec) * 1000 +\n static_cast<double>(timespec.tv_nsec) \/ 1000000);\n }\n}\n\n} \/\/ namespace node\n} \/\/ namespace grpc\n<|endoftext|>"} {"text":"<commit_before>#include <string.h>\n#include <stdio.h>\n#include <stddef.h>\n#include \"COP_SCU.h\"\n#include \"MIPS.h\"\n#include \"Jitter.h\"\n#include \"offsetof_def.h\"\n\nconst char* CCOP_SCU::m_sRegName[] = \n{\n\t\"Index\",\n\t\"Random\",\n\t\"EntryLo0\",\n\t\"EntryLo1\",\n\t\"Context\",\n\t\"PageMask\",\n\t\"Wired\",\n\t\"*RESERVED*\",\n\t\"BadVAddr\",\n\t\"Count\",\n\t\"EntryHi\",\n\t\"Compare\",\n\t\"Status\",\n\t\"Cause\",\n\t\"EPC\",\n\t\"PrevID\",\n\t\"Config\",\n\t\"LLAddr\",\n\t\"WatchLo\",\n\t\"WatchHi\",\n\t\"XContext\",\n\t\"CPCOND0\",\n\t\"*RESERVED*\",\n\t\"*RESERVED*\",\n\t\"*RESERVED*\",\n\t\"*RESERVED*\",\n\t\"PErr\",\n\t\"CacheErr\",\n\t\"TagLo\",\n\t\"TagHi\",\n\t\"ErrorEPC\",\n\t\"*RESERVED*\"\n};\n\nCCOP_SCU::CCOP_SCU(MIPS_REGSIZE nRegSize) \n: CMIPSCoprocessor(nRegSize)\n, m_nRT(0)\n, m_nRD(0)\n{\n\tSetupReflectionTables();\n}\n\nvoid CCOP_SCU::CompileInstruction(uint32 nAddress, CMipsJitter* codeGen, CMIPS* pCtx)\n{\n\tSetupQuickVariables(nAddress, codeGen, pCtx);\n\n\tm_nRT\t= (uint8)((m_nOpcode >> 16) & 0x1F);\n\tm_nRD\t= (uint8)((m_nOpcode >> 11) & 0x1F);\n\n\t((this)->*(m_pOpGeneral[(m_nOpcode >> 21) & 0x1F]))();\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/General Opcodes\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n\/\/00\nvoid CCOP_SCU::MFC0()\n{\n m_codeGen->PushRel(offsetof(CMIPS, m_State.nCOP0[m_nRD]));\n\n\tif(m_regSize == MIPS_REGSIZE_64)\n\t{\n\t\tm_codeGen->PushTop();\n\t\tm_codeGen->SignExt();\n\t\tm_codeGen->PullRel(offsetof(CMIPS, m_State.nGPR[m_nRT].nV[1]));\n\t}\n m_codeGen->PullRel(offsetof(CMIPS, m_State.nGPR[m_nRT].nV[0]));\n}\n\n\/\/04\nvoid CCOP_SCU::MTC0()\n{\n m_codeGen->PushRel(offsetof(CMIPS, m_State.nGPR[m_nRT].nV[0]));\n\n\tif(m_nRD == CCOP_SCU::STATUS)\n\t{\n\t\t\/\/Keep the EXL bit\n\t\t\/\/This is needed for Valkyrie Profile 2 which resets the EXL bit\n\t\tm_codeGen->PushRel(offsetof(CMIPS, m_State.nCOP0[m_nRD]));\n\t\tm_codeGen->PushCst(CMIPS::STATUS_EXL);\n\t\tm_codeGen->And();\n\t\tm_codeGen->Or();\n\t}\n\n\tm_codeGen->PullRel(offsetof(CMIPS, m_State.nCOP0[m_nRD]));\n}\n\n\/\/08\nvoid CCOP_SCU::BC0()\n{\n\t((this)->*(m_pOpBC0[m_nRT]))();\n}\n\n\/\/10\nvoid CCOP_SCU::C0()\n{\n\t((this)->*(m_pOpC0[(m_nOpcode & 0x3F)]))();\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/Branches\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n\/\/00\nvoid CCOP_SCU::BC0F()\n{\n\tm_codeGen->PushRel(offsetof(CMIPS, m_State.nCOP0[CPCOND0]));\n\tm_codeGen->PushCst(0);\n\tBranch(Jitter::CONDITION_EQ);\n}\n\n\/\/01\nvoid CCOP_SCU::BC0T()\n{\n\tm_codeGen->PushRel(offsetof(CMIPS, m_State.nCOP0[CPCOND0]));\n\tm_codeGen->PushCst(0);\n\tBranch(Jitter::CONDITION_NE);\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/Coprocessor Specific Opcodes\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n\/\/18\nvoid CCOP_SCU::ERET()\n{\n\tm_codeGen->PushRel(offsetof(CMIPS, m_State.nCOP0[STATUS]));\n\tm_codeGen->PushCst(CMIPS::STATUS_ERL);\n\tm_codeGen->And();\n\t\n\tm_codeGen->PushCst(0);\n\tm_codeGen->BeginIf(Jitter::CONDITION_NE);\n\t{\n\t\t\/\/ERL bit was set\n\t\tm_codeGen->PushRel(offsetof(CMIPS, m_State.nCOP0[ERROREPC]));\n m_codeGen->PullRel(offsetof(CMIPS, m_State.nDelayedJumpAddr));\n\n\t\t\/\/Clear ERL bit\n\t\tm_codeGen->PushRel(offsetof(CMIPS, m_State.nCOP0[STATUS]));\n\t\tm_codeGen->PushCst(~CMIPS::STATUS_ERL);\n\t\tm_codeGen->And();\n\t\tm_codeGen->PullRel(offsetof(CMIPS, m_State.nCOP0[STATUS]));\n\t}\n\tm_codeGen->Else();\n\t{\n\t\t\/\/EXL bit was set\n\t\tm_codeGen->PushRel(offsetof(CMIPS, m_State.nCOP0[EPC]));\n m_codeGen->PullRel(offsetof(CMIPS, m_State.nDelayedJumpAddr));\n\n\t\t\/\/Clear EXL bit\n\t\tm_codeGen->PushRel(offsetof(CMIPS, m_State.nCOP0[STATUS]));\n\t\tm_codeGen->PushCst(~CMIPS::STATUS_EXL);\n\t\tm_codeGen->And();\n\t\tm_codeGen->PullRel(offsetof(CMIPS, m_State.nCOP0[STATUS]));\n\t}\n\tm_codeGen->EndIf();\n}\n\n\/\/38\nvoid CCOP_SCU::EI()\n{\n\tm_codeGen->PushRel(offsetof(CMIPS, m_State.nCOP0[STATUS]));\n\tm_codeGen->PushCst(0x00010001);\n\tm_codeGen->Or();\n\tm_codeGen->PullRel(offsetof(CMIPS, m_State.nCOP0[STATUS]));\n\n\t\/\/Force the main loop to check for pending interrupts\n\tm_codeGen->PushCst(MIPS_EXCEPTION_CHECKPENDINGINT);\n\tm_codeGen->PullRel(offsetof(CMIPS, m_State.nHasException));\n}\n\n\/\/39\nvoid CCOP_SCU::DI()\n{\n m_codeGen->PushRel(offsetof(CMIPS, m_State.nCOP0[STATUS]));\n m_codeGen->PushCst(~0x00010001);\n m_codeGen->And();\n m_codeGen->PullRel(offsetof(CMIPS, m_State.nCOP0[STATUS]));\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/Opcode Tables\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nCCOP_SCU::InstructionFuncConstant CCOP_SCU::m_pOpGeneral[0x20] = \n{\n\t\/\/0x00\n\t&CCOP_SCU::MFC0,\t\t&CCOP_SCU::Illegal,\t\t&CCOP_SCU::Illegal,\t\t&CCOP_SCU::Illegal,\t\t&CCOP_SCU::MTC0,\t\t&CCOP_SCU::Illegal,\t\t&CCOP_SCU::Illegal,\t\t&CCOP_SCU::Illegal,\n\t\/\/0x08\n\t&CCOP_SCU::BC0, \t\t&CCOP_SCU::Illegal,\t\t&CCOP_SCU::Illegal,\t\t&CCOP_SCU::Illegal,\t\t&CCOP_SCU::Illegal,\t\t&CCOP_SCU::Illegal,\t\t&CCOP_SCU::Illegal,\t\t&CCOP_SCU::Illegal,\n\t\/\/0x10\n\t&CCOP_SCU::C0,\t\t\t&CCOP_SCU::Illegal,\t\t&CCOP_SCU::Illegal,\t\t&CCOP_SCU::Illegal,\t\t&CCOP_SCU::Illegal,\t\t&CCOP_SCU::Illegal,\t\t&CCOP_SCU::Illegal,\t\t&CCOP_SCU::Illegal,\n\t\/\/0x18\n\t&CCOP_SCU::Illegal,\t\t&CCOP_SCU::Illegal,\t\t&CCOP_SCU::Illegal,\t\t&CCOP_SCU::Illegal,\t\t&CCOP_SCU::Illegal,\t\t&CCOP_SCU::Illegal,\t\t&CCOP_SCU::Illegal,\t\t&CCOP_SCU::Illegal,\n};\n\nCCOP_SCU::InstructionFuncConstant CCOP_SCU::m_pOpBC0[0x20] = \n{\n\t\/\/0x00\n\t&CCOP_SCU::BC0F,\t\t&CCOP_SCU::BC0T, \t\t&CCOP_SCU::Illegal,\t\t&CCOP_SCU::Illegal,\t\t&CCOP_SCU::Illegal,\t\t&CCOP_SCU::Illegal,\t\t&CCOP_SCU::Illegal,\t\t&CCOP_SCU::Illegal,\n\t\/\/0x08\n\t&CCOP_SCU::Illegal,\t\t&CCOP_SCU::Illegal,\t\t&CCOP_SCU::Illegal,\t\t&CCOP_SCU::Illegal,\t\t&CCOP_SCU::Illegal,\t\t&CCOP_SCU::Illegal,\t\t&CCOP_SCU::Illegal,\t\t&CCOP_SCU::Illegal,\n\t\/\/0x10\n\t&CCOP_SCU::Illegal,\t\t&CCOP_SCU::Illegal,\t\t&CCOP_SCU::Illegal,\t\t&CCOP_SCU::Illegal,\t\t&CCOP_SCU::Illegal,\t\t&CCOP_SCU::Illegal,\t\t&CCOP_SCU::Illegal,\t\t&CCOP_SCU::Illegal,\n\t\/\/0x18\n\t&CCOP_SCU::Illegal,\t\t&CCOP_SCU::Illegal,\t\t&CCOP_SCU::Illegal,\t\t&CCOP_SCU::Illegal,\t\t&CCOP_SCU::Illegal,\t\t&CCOP_SCU::Illegal,\t\t&CCOP_SCU::Illegal,\t\t&CCOP_SCU::Illegal,\n};\n\nCCOP_SCU::InstructionFuncConstant CCOP_SCU::m_pOpC0[0x40] =\n{\n\t\/\/0x00\n\t&CCOP_SCU::Illegal,\t\t&CCOP_SCU::Illegal,\t\t&CCOP_SCU::Illegal,\t\t&CCOP_SCU::Illegal,\t\t&CCOP_SCU::Illegal,\t\t&CCOP_SCU::Illegal,\t\t&CCOP_SCU::Illegal,\t\t&CCOP_SCU::Illegal,\n\t\/\/0x08\n\t&CCOP_SCU::Illegal,\t\t&CCOP_SCU::Illegal,\t\t&CCOP_SCU::Illegal,\t\t&CCOP_SCU::Illegal,\t\t&CCOP_SCU::Illegal,\t\t&CCOP_SCU::Illegal,\t\t&CCOP_SCU::Illegal,\t\t&CCOP_SCU::Illegal,\n\t\/\/0x10\n\t&CCOP_SCU::Illegal,\t\t&CCOP_SCU::Illegal,\t\t&CCOP_SCU::Illegal,\t\t&CCOP_SCU::Illegal,\t\t&CCOP_SCU::Illegal,\t\t&CCOP_SCU::Illegal,\t\t&CCOP_SCU::Illegal,\t\t&CCOP_SCU::Illegal,\n\t\/\/0x18\n\t&CCOP_SCU::ERET,\t\t&CCOP_SCU::Illegal,\t\t&CCOP_SCU::Illegal,\t\t&CCOP_SCU::Illegal,\t\t&CCOP_SCU::Illegal,\t\t&CCOP_SCU::Illegal,\t\t&CCOP_SCU::Illegal,\t\t&CCOP_SCU::Illegal,\n\t\/\/0x20\n\t&CCOP_SCU::Illegal,\t\t&CCOP_SCU::Illegal,\t\t&CCOP_SCU::Illegal,\t\t&CCOP_SCU::Illegal,\t\t&CCOP_SCU::Illegal,\t\t&CCOP_SCU::Illegal,\t\t&CCOP_SCU::Illegal,\t\t&CCOP_SCU::Illegal,\n\t\/\/0x28\n\t&CCOP_SCU::Illegal,\t\t&CCOP_SCU::Illegal,\t\t&CCOP_SCU::Illegal,\t\t&CCOP_SCU::Illegal,\t\t&CCOP_SCU::Illegal,\t\t&CCOP_SCU::Illegal,\t\t&CCOP_SCU::Illegal,\t\t&CCOP_SCU::Illegal,\n\t\/\/0x30\n\t&CCOP_SCU::Illegal,\t\t&CCOP_SCU::Illegal,\t\t&CCOP_SCU::Illegal,\t\t&CCOP_SCU::Illegal,\t\t&CCOP_SCU::Illegal,\t\t&CCOP_SCU::Illegal,\t\t&CCOP_SCU::Illegal,\t\t&CCOP_SCU::Illegal,\n\t\/\/0x38\n\t&CCOP_SCU::EI,\t\t\t&CCOP_SCU::DI,\t\t\t&CCOP_SCU::Illegal,\t\t&CCOP_SCU::Illegal,\t\t&CCOP_SCU::Illegal,\t\t&CCOP_SCU::Illegal,\t\t&CCOP_SCU::Illegal,\t\t&CCOP_SCU::Illegal,\n};\n<commit_msg>Cleanup.<commit_after>#include <string.h>\n#include <stdio.h>\n#include <stddef.h>\n#include \"COP_SCU.h\"\n#include \"MIPS.h\"\n#include \"Jitter.h\"\n#include \"offsetof_def.h\"\n\nconst char* CCOP_SCU::m_sRegName[] = \n{\n\t\"Index\",\n\t\"Random\",\n\t\"EntryLo0\",\n\t\"EntryLo1\",\n\t\"Context\",\n\t\"PageMask\",\n\t\"Wired\",\n\t\"*RESERVED*\",\n\t\"BadVAddr\",\n\t\"Count\",\n\t\"EntryHi\",\n\t\"Compare\",\n\t\"Status\",\n\t\"Cause\",\n\t\"EPC\",\n\t\"PrevID\",\n\t\"Config\",\n\t\"LLAddr\",\n\t\"WatchLo\",\n\t\"WatchHi\",\n\t\"XContext\",\n\t\"CPCOND0\",\n\t\"*RESERVED*\",\n\t\"*RESERVED*\",\n\t\"*RESERVED*\",\n\t\"*RESERVED*\",\n\t\"PErr\",\n\t\"CacheErr\",\n\t\"TagLo\",\n\t\"TagHi\",\n\t\"ErrorEPC\",\n\t\"*RESERVED*\"\n};\n\nCCOP_SCU::CCOP_SCU(MIPS_REGSIZE nRegSize) \n: CMIPSCoprocessor(nRegSize)\n, m_nRT(0)\n, m_nRD(0)\n{\n\tSetupReflectionTables();\n}\n\nvoid CCOP_SCU::CompileInstruction(uint32 nAddress, CMipsJitter* codeGen, CMIPS* pCtx)\n{\n\tSetupQuickVariables(nAddress, codeGen, pCtx);\n\n\tm_nRT\t= (uint8)((m_nOpcode >> 16) & 0x1F);\n\tm_nRD\t= (uint8)((m_nOpcode >> 11) & 0x1F);\n\n\t((this)->*(m_pOpGeneral[(m_nOpcode >> 21) & 0x1F]))();\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/General Opcodes\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n\/\/00\nvoid CCOP_SCU::MFC0()\n{\n m_codeGen->PushRel(offsetof(CMIPS, m_State.nCOP0[m_nRD]));\n\n\tif(m_regSize == MIPS_REGSIZE_64)\n\t{\n\t\tm_codeGen->PushTop();\n\t\tm_codeGen->SignExt();\n\t\tm_codeGen->PullRel(offsetof(CMIPS, m_State.nGPR[m_nRT].nV[1]));\n\t}\n m_codeGen->PullRel(offsetof(CMIPS, m_State.nGPR[m_nRT].nV[0]));\n}\n\n\/\/04\nvoid CCOP_SCU::MTC0()\n{\n m_codeGen->PushRel(offsetof(CMIPS, m_State.nGPR[m_nRT].nV[0]));\n\n\tif(m_nRD == CCOP_SCU::STATUS)\n\t{\n\t\t\/\/Keep the EXL bit\n\t\t\/\/This is needed for Valkyrie Profile 2 which resets the EXL bit\n\t\tm_codeGen->PushRel(offsetof(CMIPS, m_State.nCOP0[m_nRD]));\n\t\tm_codeGen->PushCst(CMIPS::STATUS_EXL);\n\t\tm_codeGen->And();\n\t\tm_codeGen->Or();\n\t}\n\n\tm_codeGen->PullRel(offsetof(CMIPS, m_State.nCOP0[m_nRD]));\n}\n\n\/\/08\nvoid CCOP_SCU::BC0()\n{\n\t((this)->*(m_pOpBC0[m_nRT]))();\n}\n\n\/\/10\nvoid CCOP_SCU::C0()\n{\n\t((this)->*(m_pOpC0[(m_nOpcode & 0x3F)]))();\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/Branches\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n\/\/00\nvoid CCOP_SCU::BC0F()\n{\n\tm_codeGen->PushRel(offsetof(CMIPS, m_State.nCOP0[CPCOND0]));\n\tm_codeGen->PushCst(0);\n\tBranch(Jitter::CONDITION_EQ);\n}\n\n\/\/01\nvoid CCOP_SCU::BC0T()\n{\n\tm_codeGen->PushRel(offsetof(CMIPS, m_State.nCOP0[CPCOND0]));\n\tm_codeGen->PushCst(0);\n\tBranch(Jitter::CONDITION_NE);\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/Coprocessor Specific Opcodes\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n\/\/18\nvoid CCOP_SCU::ERET()\n{\n\tm_codeGen->PushRel(offsetof(CMIPS, m_State.nCOP0[STATUS]));\n\tm_codeGen->PushCst(CMIPS::STATUS_ERL);\n\tm_codeGen->And();\n\t\n\tm_codeGen->PushCst(0);\n\tm_codeGen->BeginIf(Jitter::CONDITION_NE);\n\t{\n\t\t\/\/ERL bit was set\n\t\tm_codeGen->PushRel(offsetof(CMIPS, m_State.nCOP0[ERROREPC]));\n\t\tm_codeGen->PullRel(offsetof(CMIPS, m_State.nDelayedJumpAddr));\n\n\t\t\/\/Clear ERL bit\n\t\tm_codeGen->PushRel(offsetof(CMIPS, m_State.nCOP0[STATUS]));\n\t\tm_codeGen->PushCst(~CMIPS::STATUS_ERL);\n\t\tm_codeGen->And();\n\t\tm_codeGen->PullRel(offsetof(CMIPS, m_State.nCOP0[STATUS]));\n\t}\n\tm_codeGen->Else();\n\t{\n\t\t\/\/EXL bit was set\n\t\tm_codeGen->PushRel(offsetof(CMIPS, m_State.nCOP0[EPC]));\n\t\tm_codeGen->PullRel(offsetof(CMIPS, m_State.nDelayedJumpAddr));\n\n\t\t\/\/Clear EXL bit\n\t\tm_codeGen->PushRel(offsetof(CMIPS, m_State.nCOP0[STATUS]));\n\t\tm_codeGen->PushCst(~CMIPS::STATUS_EXL);\n\t\tm_codeGen->And();\n\t\tm_codeGen->PullRel(offsetof(CMIPS, m_State.nCOP0[STATUS]));\n\t}\n\tm_codeGen->EndIf();\n}\n\n\/\/38\nvoid CCOP_SCU::EI()\n{\n\tm_codeGen->PushRel(offsetof(CMIPS, m_State.nCOP0[STATUS]));\n\tm_codeGen->PushCst(0x00010001);\n\tm_codeGen->Or();\n\tm_codeGen->PullRel(offsetof(CMIPS, m_State.nCOP0[STATUS]));\n\n\t\/\/Force the main loop to check for pending interrupts\n\tm_codeGen->PushCst(MIPS_EXCEPTION_CHECKPENDINGINT);\n\tm_codeGen->PullRel(offsetof(CMIPS, m_State.nHasException));\n}\n\n\/\/39\nvoid CCOP_SCU::DI()\n{\n m_codeGen->PushRel(offsetof(CMIPS, m_State.nCOP0[STATUS]));\n m_codeGen->PushCst(~0x00010001);\n m_codeGen->And();\n m_codeGen->PullRel(offsetof(CMIPS, m_State.nCOP0[STATUS]));\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/Opcode Tables\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nCCOP_SCU::InstructionFuncConstant CCOP_SCU::m_pOpGeneral[0x20] = \n{\n\t\/\/0x00\n\t&CCOP_SCU::MFC0,\t\t&CCOP_SCU::Illegal,\t\t&CCOP_SCU::Illegal,\t\t&CCOP_SCU::Illegal,\t\t&CCOP_SCU::MTC0,\t\t&CCOP_SCU::Illegal,\t\t&CCOP_SCU::Illegal,\t\t&CCOP_SCU::Illegal,\n\t\/\/0x08\n\t&CCOP_SCU::BC0, \t\t&CCOP_SCU::Illegal,\t\t&CCOP_SCU::Illegal,\t\t&CCOP_SCU::Illegal,\t\t&CCOP_SCU::Illegal,\t\t&CCOP_SCU::Illegal,\t\t&CCOP_SCU::Illegal,\t\t&CCOP_SCU::Illegal,\n\t\/\/0x10\n\t&CCOP_SCU::C0,\t\t\t&CCOP_SCU::Illegal,\t\t&CCOP_SCU::Illegal,\t\t&CCOP_SCU::Illegal,\t\t&CCOP_SCU::Illegal,\t\t&CCOP_SCU::Illegal,\t\t&CCOP_SCU::Illegal,\t\t&CCOP_SCU::Illegal,\n\t\/\/0x18\n\t&CCOP_SCU::Illegal,\t\t&CCOP_SCU::Illegal,\t\t&CCOP_SCU::Illegal,\t\t&CCOP_SCU::Illegal,\t\t&CCOP_SCU::Illegal,\t\t&CCOP_SCU::Illegal,\t\t&CCOP_SCU::Illegal,\t\t&CCOP_SCU::Illegal,\n};\n\nCCOP_SCU::InstructionFuncConstant CCOP_SCU::m_pOpBC0[0x20] = \n{\n\t\/\/0x00\n\t&CCOP_SCU::BC0F,\t\t&CCOP_SCU::BC0T, \t\t&CCOP_SCU::Illegal,\t\t&CCOP_SCU::Illegal,\t\t&CCOP_SCU::Illegal,\t\t&CCOP_SCU::Illegal,\t\t&CCOP_SCU::Illegal,\t\t&CCOP_SCU::Illegal,\n\t\/\/0x08\n\t&CCOP_SCU::Illegal,\t\t&CCOP_SCU::Illegal,\t\t&CCOP_SCU::Illegal,\t\t&CCOP_SCU::Illegal,\t\t&CCOP_SCU::Illegal,\t\t&CCOP_SCU::Illegal,\t\t&CCOP_SCU::Illegal,\t\t&CCOP_SCU::Illegal,\n\t\/\/0x10\n\t&CCOP_SCU::Illegal,\t\t&CCOP_SCU::Illegal,\t\t&CCOP_SCU::Illegal,\t\t&CCOP_SCU::Illegal,\t\t&CCOP_SCU::Illegal,\t\t&CCOP_SCU::Illegal,\t\t&CCOP_SCU::Illegal,\t\t&CCOP_SCU::Illegal,\n\t\/\/0x18\n\t&CCOP_SCU::Illegal,\t\t&CCOP_SCU::Illegal,\t\t&CCOP_SCU::Illegal,\t\t&CCOP_SCU::Illegal,\t\t&CCOP_SCU::Illegal,\t\t&CCOP_SCU::Illegal,\t\t&CCOP_SCU::Illegal,\t\t&CCOP_SCU::Illegal,\n};\n\nCCOP_SCU::InstructionFuncConstant CCOP_SCU::m_pOpC0[0x40] =\n{\n\t\/\/0x00\n\t&CCOP_SCU::Illegal,\t\t&CCOP_SCU::Illegal,\t\t&CCOP_SCU::Illegal,\t\t&CCOP_SCU::Illegal,\t\t&CCOP_SCU::Illegal,\t\t&CCOP_SCU::Illegal,\t\t&CCOP_SCU::Illegal,\t\t&CCOP_SCU::Illegal,\n\t\/\/0x08\n\t&CCOP_SCU::Illegal,\t\t&CCOP_SCU::Illegal,\t\t&CCOP_SCU::Illegal,\t\t&CCOP_SCU::Illegal,\t\t&CCOP_SCU::Illegal,\t\t&CCOP_SCU::Illegal,\t\t&CCOP_SCU::Illegal,\t\t&CCOP_SCU::Illegal,\n\t\/\/0x10\n\t&CCOP_SCU::Illegal,\t\t&CCOP_SCU::Illegal,\t\t&CCOP_SCU::Illegal,\t\t&CCOP_SCU::Illegal,\t\t&CCOP_SCU::Illegal,\t\t&CCOP_SCU::Illegal,\t\t&CCOP_SCU::Illegal,\t\t&CCOP_SCU::Illegal,\n\t\/\/0x18\n\t&CCOP_SCU::ERET,\t\t&CCOP_SCU::Illegal,\t\t&CCOP_SCU::Illegal,\t\t&CCOP_SCU::Illegal,\t\t&CCOP_SCU::Illegal,\t\t&CCOP_SCU::Illegal,\t\t&CCOP_SCU::Illegal,\t\t&CCOP_SCU::Illegal,\n\t\/\/0x20\n\t&CCOP_SCU::Illegal,\t\t&CCOP_SCU::Illegal,\t\t&CCOP_SCU::Illegal,\t\t&CCOP_SCU::Illegal,\t\t&CCOP_SCU::Illegal,\t\t&CCOP_SCU::Illegal,\t\t&CCOP_SCU::Illegal,\t\t&CCOP_SCU::Illegal,\n\t\/\/0x28\n\t&CCOP_SCU::Illegal,\t\t&CCOP_SCU::Illegal,\t\t&CCOP_SCU::Illegal,\t\t&CCOP_SCU::Illegal,\t\t&CCOP_SCU::Illegal,\t\t&CCOP_SCU::Illegal,\t\t&CCOP_SCU::Illegal,\t\t&CCOP_SCU::Illegal,\n\t\/\/0x30\n\t&CCOP_SCU::Illegal,\t\t&CCOP_SCU::Illegal,\t\t&CCOP_SCU::Illegal,\t\t&CCOP_SCU::Illegal,\t\t&CCOP_SCU::Illegal,\t\t&CCOP_SCU::Illegal,\t\t&CCOP_SCU::Illegal,\t\t&CCOP_SCU::Illegal,\n\t\/\/0x38\n\t&CCOP_SCU::EI,\t\t\t&CCOP_SCU::DI,\t\t\t&CCOP_SCU::Illegal,\t\t&CCOP_SCU::Illegal,\t\t&CCOP_SCU::Illegal,\t\t&CCOP_SCU::Illegal,\t\t&CCOP_SCU::Illegal,\t\t&CCOP_SCU::Illegal,\n};\n<|endoftext|>"} {"text":"<commit_before>#include \"ExactDiagonalizationSolver.h\"\n#include \"FockSpace.h\"\n#include \"FileWriter.h\"\n#include \"DOS.h\"\n#include \"DiagonalizationSolver.h\"\n#include \"DPropertyExtractor.h\"\n#include \"SumRule.h\"\n#include \"DifferenceRule.h\"\n#include \"WrapperRule.h\"\n#include \"Timer.h\"\n\nusing namespace std;\n\nnamespace TBTK{\n\nExactDiagonalizationSolver::ExactDiagonalizationSolver(Model *model){\n\tthis->model = model;\n}\n\nExactDiagonalizationSolver::~ExactDiagonalizationSolver(){\n}\n\nunsigned int ExactDiagonalizationSolver::addSubspace(initializer_list<const FockStateRule::WrapperRule> rules){\n\tunsigned int numSubspaces = subspaceContexts.size();\n\n\tsubspaceContexts.push_back(SubspaceContext(rules));\n\n\treturn numSubspaces;\n}\n\nvoid ExactDiagonalizationSolver::run(unsigned int subspace){\n\tSubspaceContext &subspaceContext = subspaceContexts.at(subspace);\n\tif(subspaceContext.manyBodyModel == NULL){\n\t\tsetupManyBodyModel(subspace);\n\t\tsubspaceContext.dSolver = new DiagonalizationSolver();\n\t\tsubspaceContext.dSolver->setModel(subspaceContext.manyBodyModel);\n\t\tsubspaceContext.dSolver->run();\n\n\/*\t\tDPropertyExtractor pe(subspaceContext.dSolver);\n\t\tpe.setEnergyWindow(-10., 10., 1000);\n\t\tProperty::DOS *dos = pe.calculateDOS();\n\t\tFileWriter::writeDOS(dos);\n\t\tdelete dos;*\/\n\t}\n}\n\ntemplate<>\nvoid ExactDiagonalizationSolver::setupManyBodyModel<BitRegister>(unsigned int subspace){\n\/\/\tFockSpace<BitRegister> *fockSpace = manyBodyContext.getFockSpaceBitRegister();\n\tFockSpace<BitRegister> *fockSpace = model->getManyBodyContext()->getFockSpaceBitRegister();\n\tLadderOperator<BitRegister> **operators = fockSpace->getOperators();\n\tSubspaceContext &subspaceContext = subspaceContexts.at(subspace);\n\tFockStateMap::FockStateMap<BitRegister> *fockStateMap = fockSpace->createFockStateMap(\n\t\tsubspaceContext.rules\n\t);\n\n\tsubspaceContext.manyBodyModel = new Model();\n\tfor(unsigned int n = 0; n < fockStateMap->getBasisSize(); n++){\n\t\tHoppingAmplitudeSet::Iterator it = model->getHoppingAmplitudeSet()->getIterator();\n\t\tconst HoppingAmplitude *ha;\n\t\twhile((ha = it.getHA())){\n\t\t\tit.searchNextHA();\n\n\t\t\tFockState<BitRegister> fockState = fockStateMap->getFockState(n);\n\n\t\t\tint from = fockStateMap->getBasisIndex(fockState);\n\n\t\t\toperators[model->getBasisIndex(ha->fromIndex)][1]*fockState;\n\t\t\tif(fockState.isNull())\n\t\t\t\tcontinue;\n\t\t\toperators[model->getBasisIndex(ha->toIndex)][0]*fockState;\n\t\t\tif(fockState.isNull())\n\t\t\t\tcontinue;\n\n\t\t\tint to = fockStateMap->getBasisIndex(fockState);\n\n\t\t\tsubspaceContext.manyBodyModel->addHA(HoppingAmplitude(\n\t\t\t\tha->getAmplitude()*(double)fockState.getPrefactor(),\n\t\t\t\t{to},\n\t\t\t\t{from}\n\t\t\t));\n\t\t}\n\n\/\/\t\tfor(unsigned int c = 0; c < interactionAmplitudeSet->getNumInteractionAmplitudes(); c++){\n\t\tfor(unsigned int c = 0; c < model->getManyBodyContext()->getInteractionAmplitudeSet()->getNumInteractionAmplitudes(); c++){\n\t\t\tFockState<BitRegister> fockState = fockStateMap->getFockState(n);\n\n\t\t\tint from = fockStateMap->getBasisIndex(fockState);\n\n\/\/\t\t\tInteractionAmplitude ia = interactionAmplitudeSet->getInteractionAmplitude(c);\n\t\t\tInteractionAmplitude ia = model->getManyBodyContext()->getInteractionAmplitudeSet()->getInteractionAmplitude(c);\n\t\t\tfor(int k = ia.getNumAnnihilationOperators() - 1; k >= 0; k--){\n\t\t\t\toperators[model->getBasisIndex(ia.getAnnihilationOperatorIndex(k))][1]*fockState;\n\t\t\t\tif(fockState.isNull())\n\t\t\t\t\tbreak;\n\t\t\t}\n\t\t\tif(fockState.isNull())\n\t\t\t\tcontinue;\n\n\t\t\tfor(int k = ia.getNumCreationOperators() - 1; k >= 0; k--){\n\t\t\t\toperators[model->getBasisIndex(ia.getCreationOperatorIndex(k))][0]*fockState;\n\t\t\t\tif(fockState.isNull())\n\t\t\t\t\tbreak;\n\t\t\t}\n\t\t\tif(fockState.isNull())\n\t\t\t\tcontinue;\n\n\t\t\tint to = fockStateMap->getBasisIndex(fockState);\n\n\t\t\tsubspaceContext.manyBodyModel->addHA(HoppingAmplitude(\n\t\t\t\tia.getAmplitude()*(double)fockState.getPrefactor(),\n\t\t\t\t{to},\n\t\t\t\t{from}\n\t\t\t));\n\t\t}\n\t}\n\tsubspaceContext.manyBodyModel->construct();\n\n\tdelete fockStateMap;\n}\n\ntemplate<>\nvoid ExactDiagonalizationSolver::setupManyBodyModel<ExtensiveBitRegister>(unsigned int subspace){\n\/\/\tFockSpace<ExtensiveBitRegister> *fockSpace = manyBodyContext.getFockSpaceExtensiveBitRegister();\n\tFockSpace<ExtensiveBitRegister> *fockSpace = model->getManyBodyContext()->getFockSpaceExtensiveBitRegister();\n\tLadderOperator<ExtensiveBitRegister> **operators = fockSpace->getOperators();\n\tSubspaceContext &subspaceContext = subspaceContexts.at(subspace);\n\tFockStateMap::FockStateMap<ExtensiveBitRegister> *fockStateMap = fockSpace->createFockStateMap(\n\t\tsubspaceContext.rules\n\t);\n\n\tsubspaceContext.manyBodyModel = new Model();\n\tfor(unsigned int n = 0; n < fockStateMap->getBasisSize(); n++){\n\t\tHoppingAmplitudeSet::Iterator it = model->getHoppingAmplitudeSet()->getIterator();\n\t\tconst HoppingAmplitude *ha;\n\t\twhile((ha = it.getHA())){\n\t\t\tit.searchNextHA();\n\n\t\t\tFockState<ExtensiveBitRegister> fockState = fockStateMap->getFockState(n);\n\n\t\t\tint from = fockStateMap->getBasisIndex(fockState);\n\n\t\t\toperators[model->getBasisIndex(ha->fromIndex)][1]*fockState;\n\t\t\tif(fockState.isNull())\n\t\t\t\tcontinue;\n\t\t\toperators[model->getBasisIndex(ha->toIndex)][0]*fockState;\n\t\t\tif(fockState.isNull())\n\t\t\t\tcontinue;\n\n\t\t\tint to = fockStateMap->getBasisIndex(fockState);\n\n\t\t\tsubspaceContext.manyBodyModel->addHA(HoppingAmplitude(\n\t\t\t\tha->getAmplitude()*(double)fockState.getPrefactor(),\n\t\t\t\t{to},\n\t\t\t\t{from}\n\t\t\t));\n\t\t}\n\n\/\/\t\tfor(unsigned int c = 0; c < interactionAmplitudeSet->getNumInteractionAmplitudes(); c++){\n\t\tfor(unsigned int c = 0; c < model->getManyBodyContext()->getInteractionAmplitudeSet()->getNumInteractionAmplitudes(); c++){\n\t\t\tFockState<ExtensiveBitRegister> fockState = fockStateMap->getFockState(n);\n\n\t\t\tint from = fockStateMap->getBasisIndex(fockState);\n\n\/\/\t\t\tInteractionAmplitude ia = interactionAmplitudeSet->getInteractionAmplitude(c);\n\t\t\tInteractionAmplitude ia = model->getManyBodyContext()->getInteractionAmplitudeSet()->getInteractionAmplitude(c);\n\t\t\tfor(int k = ia.getNumAnnihilationOperators() - 1; k >= 0; k--){\n\t\t\t\toperators[model->getBasisIndex(ia.getAnnihilationOperatorIndex(k))][1]*fockState;\n\t\t\t\tif(fockState.isNull())\n\t\t\t\t\tbreak;\n\t\t\t}\n\t\t\tif(fockState.isNull())\n\t\t\t\tcontinue;\n\n\t\t\tfor(int k = ia.getNumCreationOperators() - 1; k >= 0; k--){\n\t\t\t\toperators[model->getBasisIndex(ia.getCreationOperatorIndex(k))][0]*fockState;\n\t\t\t\tif(fockState.isNull())\n\t\t\t\t\tbreak;\n\t\t\t}\n\t\t\tif(fockState.isNull())\n\t\t\t\tcontinue;\n\n\t\t\tint to = fockStateMap->getBasisIndex(fockState);\n\n\t\t\tsubspaceContext.manyBodyModel->addHA(HoppingAmplitude(\n\t\t\t\tia.getAmplitude()*(double)fockState.getPrefactor(),\n\t\t\t\t{to},\n\t\t\t\t{from}\n\t\t\t));\n\t\t}\n\t}\n\tsubspaceContext.manyBodyModel->construct();\n\n\tdelete fockStateMap;\n}\n\nvoid ExactDiagonalizationSolver::setupManyBodyModel(unsigned int subspace){\n\tmodel->getManyBodyContext();\n\/\/\tif(manyBodyContext.wrapsBitRegister())\n\tif(model->getManyBodyContext()->wrapsBitRegister())\n\t\tsetupManyBodyModel<BitRegister>(subspace);\n\telse\n\t\tsetupManyBodyModel<ExtensiveBitRegister>(subspace);\n}\n\nExactDiagonalizationSolver::SubspaceContext::SubspaceContext(\n\tinitializer_list<const FockStateRule::WrapperRule> rules\n){\n\tfor(unsigned int n = 0; n < rules.size(); n++)\n\t\tthis->rules.push_back(*(rules.begin()+n));\n\n\tmanyBodyModel = NULL;\n\tdSolver = NULL;\n}\n\nExactDiagonalizationSolver::SubspaceContext::~SubspaceContext(){\n\tif(manyBodyModel != NULL)\n\t\tdelete manyBodyModel;\n\tif(dSolver != NULL)\n\t\tdelete dSolver;\n}\n\n};\t\/\/End of namespace TBTK\n<commit_msg>Removed commented out legacy code<commit_after>#include \"ExactDiagonalizationSolver.h\"\n#include \"FockSpace.h\"\n#include \"FileWriter.h\"\n#include \"DOS.h\"\n#include \"DiagonalizationSolver.h\"\n#include \"DPropertyExtractor.h\"\n#include \"SumRule.h\"\n#include \"DifferenceRule.h\"\n#include \"WrapperRule.h\"\n#include \"Timer.h\"\n\nusing namespace std;\n\nnamespace TBTK{\n\nExactDiagonalizationSolver::ExactDiagonalizationSolver(Model *model){\n\tthis->model = model;\n}\n\nExactDiagonalizationSolver::~ExactDiagonalizationSolver(){\n}\n\nunsigned int ExactDiagonalizationSolver::addSubspace(initializer_list<const FockStateRule::WrapperRule> rules){\n\tunsigned int numSubspaces = subspaceContexts.size();\n\n\tsubspaceContexts.push_back(SubspaceContext(rules));\n\n\treturn numSubspaces;\n}\n\nvoid ExactDiagonalizationSolver::run(unsigned int subspace){\n\tSubspaceContext &subspaceContext = subspaceContexts.at(subspace);\n\tif(subspaceContext.manyBodyModel == NULL){\n\t\tsetupManyBodyModel(subspace);\n\t\tsubspaceContext.dSolver = new DiagonalizationSolver();\n\t\tsubspaceContext.dSolver->setModel(subspaceContext.manyBodyModel);\n\t\tsubspaceContext.dSolver->run();\n\t}\n}\n\ntemplate<>\nvoid ExactDiagonalizationSolver::setupManyBodyModel<BitRegister>(unsigned int subspace){\n\tFockSpace<BitRegister> *fockSpace = model->getManyBodyContext()->getFockSpaceBitRegister();\n\tLadderOperator<BitRegister> **operators = fockSpace->getOperators();\n\tSubspaceContext &subspaceContext = subspaceContexts.at(subspace);\n\tFockStateMap::FockStateMap<BitRegister> *fockStateMap = fockSpace->createFockStateMap(\n\t\tsubspaceContext.rules\n\t);\n\n\tsubspaceContext.manyBodyModel = new Model();\n\tfor(unsigned int n = 0; n < fockStateMap->getBasisSize(); n++){\n\t\tHoppingAmplitudeSet::Iterator it = model->getHoppingAmplitudeSet()->getIterator();\n\t\tconst HoppingAmplitude *ha;\n\t\twhile((ha = it.getHA())){\n\t\t\tit.searchNextHA();\n\n\t\t\tFockState<BitRegister> fockState = fockStateMap->getFockState(n);\n\n\t\t\tint from = fockStateMap->getBasisIndex(fockState);\n\n\t\t\toperators[model->getBasisIndex(ha->fromIndex)][1]*fockState;\n\t\t\tif(fockState.isNull())\n\t\t\t\tcontinue;\n\t\t\toperators[model->getBasisIndex(ha->toIndex)][0]*fockState;\n\t\t\tif(fockState.isNull())\n\t\t\t\tcontinue;\n\n\t\t\tint to = fockStateMap->getBasisIndex(fockState);\n\n\t\t\tsubspaceContext.manyBodyModel->addHA(HoppingAmplitude(\n\t\t\t\tha->getAmplitude()*(double)fockState.getPrefactor(),\n\t\t\t\t{to},\n\t\t\t\t{from}\n\t\t\t));\n\t\t}\n\n\t\tfor(unsigned int c = 0; c < model->getManyBodyContext()->getInteractionAmplitudeSet()->getNumInteractionAmplitudes(); c++){\n\t\t\tFockState<BitRegister> fockState = fockStateMap->getFockState(n);\n\n\t\t\tint from = fockStateMap->getBasisIndex(fockState);\n\n\t\t\tInteractionAmplitude ia = model->getManyBodyContext()->getInteractionAmplitudeSet()->getInteractionAmplitude(c);\n\t\t\tfor(int k = ia.getNumAnnihilationOperators() - 1; k >= 0; k--){\n\t\t\t\toperators[model->getBasisIndex(ia.getAnnihilationOperatorIndex(k))][1]*fockState;\n\t\t\t\tif(fockState.isNull())\n\t\t\t\t\tbreak;\n\t\t\t}\n\t\t\tif(fockState.isNull())\n\t\t\t\tcontinue;\n\n\t\t\tfor(int k = ia.getNumCreationOperators() - 1; k >= 0; k--){\n\t\t\t\toperators[model->getBasisIndex(ia.getCreationOperatorIndex(k))][0]*fockState;\n\t\t\t\tif(fockState.isNull())\n\t\t\t\t\tbreak;\n\t\t\t}\n\t\t\tif(fockState.isNull())\n\t\t\t\tcontinue;\n\n\t\t\tint to = fockStateMap->getBasisIndex(fockState);\n\n\t\t\tsubspaceContext.manyBodyModel->addHA(HoppingAmplitude(\n\t\t\t\tia.getAmplitude()*(double)fockState.getPrefactor(),\n\t\t\t\t{to},\n\t\t\t\t{from}\n\t\t\t));\n\t\t}\n\t}\n\tsubspaceContext.manyBodyModel->construct();\n\n\tdelete fockStateMap;\n}\n\ntemplate<>\nvoid ExactDiagonalizationSolver::setupManyBodyModel<ExtensiveBitRegister>(unsigned int subspace){\n\tFockSpace<ExtensiveBitRegister> *fockSpace = model->getManyBodyContext()->getFockSpaceExtensiveBitRegister();\n\tLadderOperator<ExtensiveBitRegister> **operators = fockSpace->getOperators();\n\tSubspaceContext &subspaceContext = subspaceContexts.at(subspace);\n\tFockStateMap::FockStateMap<ExtensiveBitRegister> *fockStateMap = fockSpace->createFockStateMap(\n\t\tsubspaceContext.rules\n\t);\n\n\tsubspaceContext.manyBodyModel = new Model();\n\tfor(unsigned int n = 0; n < fockStateMap->getBasisSize(); n++){\n\t\tHoppingAmplitudeSet::Iterator it = model->getHoppingAmplitudeSet()->getIterator();\n\t\tconst HoppingAmplitude *ha;\n\t\twhile((ha = it.getHA())){\n\t\t\tit.searchNextHA();\n\n\t\t\tFockState<ExtensiveBitRegister> fockState = fockStateMap->getFockState(n);\n\n\t\t\tint from = fockStateMap->getBasisIndex(fockState);\n\n\t\t\toperators[model->getBasisIndex(ha->fromIndex)][1]*fockState;\n\t\t\tif(fockState.isNull())\n\t\t\t\tcontinue;\n\t\t\toperators[model->getBasisIndex(ha->toIndex)][0]*fockState;\n\t\t\tif(fockState.isNull())\n\t\t\t\tcontinue;\n\n\t\t\tint to = fockStateMap->getBasisIndex(fockState);\n\n\t\t\tsubspaceContext.manyBodyModel->addHA(HoppingAmplitude(\n\t\t\t\tha->getAmplitude()*(double)fockState.getPrefactor(),\n\t\t\t\t{to},\n\t\t\t\t{from}\n\t\t\t));\n\t\t}\n\n\t\tfor(unsigned int c = 0; c < model->getManyBodyContext()->getInteractionAmplitudeSet()->getNumInteractionAmplitudes(); c++){\n\t\t\tFockState<ExtensiveBitRegister> fockState = fockStateMap->getFockState(n);\n\n\t\t\tint from = fockStateMap->getBasisIndex(fockState);\n\n\t\t\tInteractionAmplitude ia = model->getManyBodyContext()->getInteractionAmplitudeSet()->getInteractionAmplitude(c);\n\t\t\tfor(int k = ia.getNumAnnihilationOperators() - 1; k >= 0; k--){\n\t\t\t\toperators[model->getBasisIndex(ia.getAnnihilationOperatorIndex(k))][1]*fockState;\n\t\t\t\tif(fockState.isNull())\n\t\t\t\t\tbreak;\n\t\t\t}\n\t\t\tif(fockState.isNull())\n\t\t\t\tcontinue;\n\n\t\t\tfor(int k = ia.getNumCreationOperators() - 1; k >= 0; k--){\n\t\t\t\toperators[model->getBasisIndex(ia.getCreationOperatorIndex(k))][0]*fockState;\n\t\t\t\tif(fockState.isNull())\n\t\t\t\t\tbreak;\n\t\t\t}\n\t\t\tif(fockState.isNull())\n\t\t\t\tcontinue;\n\n\t\t\tint to = fockStateMap->getBasisIndex(fockState);\n\n\t\t\tsubspaceContext.manyBodyModel->addHA(HoppingAmplitude(\n\t\t\t\tia.getAmplitude()*(double)fockState.getPrefactor(),\n\t\t\t\t{to},\n\t\t\t\t{from}\n\t\t\t));\n\t\t}\n\t}\n\tsubspaceContext.manyBodyModel->construct();\n\n\tdelete fockStateMap;\n}\n\nvoid ExactDiagonalizationSolver::setupManyBodyModel(unsigned int subspace){\n\tif(model->getManyBodyContext()->wrapsBitRegister())\n\t\tsetupManyBodyModel<BitRegister>(subspace);\n\telse\n\t\tsetupManyBodyModel<ExtensiveBitRegister>(subspace);\n}\n\nExactDiagonalizationSolver::SubspaceContext::SubspaceContext(\n\tinitializer_list<const FockStateRule::WrapperRule> rules\n){\n\tfor(unsigned int n = 0; n < rules.size(); n++)\n\t\tthis->rules.push_back(*(rules.begin()+n));\n\n\tmanyBodyModel = NULL;\n\tdSolver = NULL;\n}\n\nExactDiagonalizationSolver::SubspaceContext::~SubspaceContext(){\n\tif(manyBodyModel != NULL)\n\t\tdelete manyBodyModel;\n\tif(dSolver != NULL)\n\t\tdelete dSolver;\n}\n\n};\t\/\/End of namespace TBTK\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: vclxdevice.hxx,v $\n * $Revision: 1.7 $\n *\n * This file is part of OpenOffice.org.\n *\n * OpenOffice.org is free software: you can redistribute it and\/or modify\n * it under the terms of the GNU Lesser General Public License version 3\n * only, as published by the Free Software Foundation.\n *\n * OpenOffice.org is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the\n * GNU Lesser General Public License version 3 for more details\n * (a copy is included in the LICENSE file that accompanied this code).\n *\n * You should have received a copy of the GNU Lesser General Public License\n * version 3 along with OpenOffice.org. If not, see\n * <http:\/\/www.openoffice.org\/license.html>\n * for a copy of the LGPLv3 License.\n *\n ************************************************************************\/\n\n#ifndef _TOOLKIT_AWT_VCLXDEVICE_HXX_\n#define _TOOLKIT_AWT_VCLXDEVICE_HXX_\n\n#include <toolkit\/dllapi.h>\n#include <com\/sun\/star\/awt\/XDevice.hpp>\n#include <com\/sun\/star\/lang\/XTypeProvider.hpp>\n#include <com\/sun\/star\/lang\/XUnoTunnel.hpp>\n#include <cppuhelper\/weak.hxx>\n#include <vos\/mutex.hxx>\n\nclass OutputDevice;\nclass VirtualDevice;\n\n\/\/ ----------------------------------------------------\n\/\/ class VCLXDevice\n\/\/ ----------------------------------------------------\n\n\/\/ For using nDummy, no incompatible update, add a BOOL bCreatedWithToolkitMember later...\n#define FLAGS_CREATEDWITHTOOLKIT 0x00000001\n\nclass TOOLKIT_DLLPUBLIC VCLXDevice : public ::com::sun::star::awt::XDevice,\n public ::com::sun::star::lang::XTypeProvider,\n public ::com::sun::star::lang::XUnoTunnel,\n public ::cppu::OWeakObject\n{\n friend class VCLXGraphics;\n\nprivate:\n NAMESPACE_VOS(IMutex)& mrMutex; \/\/ Reference to SolarMutex\n OutputDevice* mpOutputDevice;\n\npublic:\n void* pDummy;\n sal_uInt32 nFlags;\n\nprotected:\n NAMESPACE_VOS(IMutex)& GetMutex() { return mrMutex; }\n void DestroyOutputDevice();\n\npublic:\n VCLXDevice();\n ~VCLXDevice();\n\n void SetOutputDevice( OutputDevice* pOutDev ) { mpOutputDevice = pOutDev; }\n OutputDevice* GetOutputDevice() const { return mpOutputDevice; }\n\n void SetCreatedWithToolkit( sal_Bool bCreatedWithToolkit );\n sal_Bool IsCreatedWithToolkit() const;\n\n \/\/ ::com::sun::star::uno::XInterface\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() { OWeakObject::acquire(); }\n void SAL_CALL release() throw() { OWeakObject::release(); }\n\n \/\/ ::com::sun::star::lang::XUnoTunnel\n static const ::com::sun::star::uno::Sequence< sal_Int8 >& GetUnoTunnelId() throw();\n static VCLXDevice* GetImplementation( const ::com::sun::star::uno::Reference< ::com::sun::star::uno::XInterface >& rxIFace ) throw();\n sal_Int64 SAL_CALL getSomething( const ::com::sun::star::uno::Sequence< sal_Int8 >& rIdentifier ) throw(::com::sun::star::uno::RuntimeException);\n\n \/\/ ::com::sun::star::lang::XTypeProvider\n ::com::sun::star::uno::Sequence< ::com::sun::star::uno::Type > SAL_CALL getTypes() throw(::com::sun::star::uno::RuntimeException);\n ::com::sun::star::uno::Sequence< sal_Int8 > SAL_CALL getImplementationId() throw(::com::sun::star::uno::RuntimeException);\n\n \/\/ ::com::sun::star::awt::XDevice,\n ::com::sun::star::uno::Reference< ::com::sun::star::awt::XGraphics > SAL_CALL createGraphics( ) throw(::com::sun::star::uno::RuntimeException);\n ::com::sun::star::uno::Reference< ::com::sun::star::awt::XDevice > SAL_CALL createDevice( sal_Int32 nWidth, sal_Int32 nHeight ) throw(::com::sun::star::uno::RuntimeException);\n ::com::sun::star::awt::DeviceInfo SAL_CALL getInfo() throw(::com::sun::star::uno::RuntimeException);\n ::com::sun::star::uno::Sequence< ::com::sun::star::awt::FontDescriptor > SAL_CALL getFontDescriptors( ) throw(::com::sun::star::uno::RuntimeException);\n ::com::sun::star::uno::Reference< ::com::sun::star::awt::XFont > SAL_CALL getFont( const ::com::sun::star::awt::FontDescriptor& aDescriptor ) throw(::com::sun::star::uno::RuntimeException);\n ::com::sun::star::uno::Reference< ::com::sun::star::awt::XBitmap > SAL_CALL createBitmap( sal_Int32 nX, sal_Int32 nY, sal_Int32 nWidth, sal_Int32 nHeight ) throw(::com::sun::star::uno::RuntimeException);\n ::com::sun::star::uno::Reference< ::com::sun::star::awt::XDisplayBitmap > SAL_CALL createDisplayBitmap( const ::com::sun::star::uno::Reference< ::com::sun::star::awt::XBitmap >& Bitmap ) throw(::com::sun::star::uno::RuntimeException);\n};\n\n\/\/ ----------------------------------------------------\n\/\/ class VCLXVirtualDevice\n\/\/ ----------------------------------------------------\n\nclass VCLXVirtualDevice : public VCLXDevice\n{\nprivate:\n VirtualDevice* mpVDev;\n\npublic:\n ~VCLXVirtualDevice();\n\n void SetVirtualDevice( VirtualDevice* pVDev ) { SetOutputDevice( (OutputDevice*)pVDev ); }\n};\n\n\n\n\n#endif \/\/ _TOOLKIT_AWT_VCLXDEVICE_HXX_\n\n<commit_msg>INTEGRATION: CWS rptwizard01 (1.6.320); FILE MERGED 2008\/05\/21 10:11:51 lla 1.6.320.4: RESYNC: (1.6-1.7); FILE MERGED 2008\/03\/14 14:06:08 lla 1.6.320.3: #i86925# cleanup 2008\/03\/14 14:02:46 lla 1.6.320.2: #i86925# cleanup 2008\/03\/14 13:47:15 lla 1.6.320.1: #i86925# Unit Converter<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: vclxdevice.hxx,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#ifndef _TOOLKIT_AWT_VCLXDEVICE_HXX_\n#define _TOOLKIT_AWT_VCLXDEVICE_HXX_\n\n#include <toolkit\/dllapi.h>\n#include <com\/sun\/star\/awt\/XDevice.hpp>\n#include <com\/sun\/star\/lang\/XTypeProvider.hpp>\n#include <com\/sun\/star\/lang\/XUnoTunnel.hpp>\n#include <cppuhelper\/weak.hxx>\n#include <vos\/mutex.hxx>\n\n\/\/ #include <com\/sun\/star\/awt\/XTextConstraints.hpp>\n#include <com\/sun\/star\/awt\/XUnitConversion.hpp>\n\nclass OutputDevice;\nclass VirtualDevice;\n\n\/\/ ----------------------------------------------------\n\/\/ class VCLXDevice\n\/\/ ----------------------------------------------------\n\n\/\/ For using nDummy, no incompatible update, add a BOOL bCreatedWithToolkitMember later...\n#define FLAGS_CREATEDWITHTOOLKIT 0x00000001\n\nclass TOOLKIT_DLLPUBLIC VCLXDevice : public ::com::sun::star::awt::XDevice,\n public ::com::sun::star::lang::XTypeProvider,\n public ::com::sun::star::lang::XUnoTunnel,\n\/* public ::com::sun::star::awt::XTextConstraints,*\/\n public ::com::sun::star::awt::XUnitConversion,\n public ::cppu::OWeakObject\n{\n friend class VCLXGraphics;\n\nprivate:\n NAMESPACE_VOS(IMutex)& mrMutex; \/\/ Reference to SolarMutex\n OutputDevice* mpOutputDevice;\n\npublic:\n void* pDummy;\n sal_uInt32 nFlags;\n\nprotected:\n NAMESPACE_VOS(IMutex)& GetMutex() { return mrMutex; }\n void DestroyOutputDevice();\n\npublic:\n VCLXDevice();\n ~VCLXDevice();\n\n void SetOutputDevice( OutputDevice* pOutDev ) { mpOutputDevice = pOutDev; }\n OutputDevice* GetOutputDevice() const { return mpOutputDevice; }\n\n void SetCreatedWithToolkit( sal_Bool bCreatedWithToolkit );\n sal_Bool IsCreatedWithToolkit() const;\n\n \/\/ ::com::sun::star::uno::XInterface\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() { OWeakObject::acquire(); }\n void SAL_CALL release() throw() { OWeakObject::release(); }\n\n \/\/ ::com::sun::star::lang::XUnoTunnel\n static const ::com::sun::star::uno::Sequence< sal_Int8 >& GetUnoTunnelId() throw();\n static VCLXDevice* GetImplementation( const ::com::sun::star::uno::Reference< ::com::sun::star::uno::XInterface >& rxIFace ) throw();\n sal_Int64 SAL_CALL getSomething( const ::com::sun::star::uno::Sequence< sal_Int8 >& rIdentifier ) throw(::com::sun::star::uno::RuntimeException);\n\n \/\/ ::com::sun::star::lang::XTypeProvider\n ::com::sun::star::uno::Sequence< ::com::sun::star::uno::Type > SAL_CALL getTypes() throw(::com::sun::star::uno::RuntimeException);\n ::com::sun::star::uno::Sequence< sal_Int8 > SAL_CALL getImplementationId() throw(::com::sun::star::uno::RuntimeException);\n\n \/\/ ::com::sun::star::awt::XDevice,\n ::com::sun::star::uno::Reference< ::com::sun::star::awt::XGraphics > SAL_CALL createGraphics( ) throw(::com::sun::star::uno::RuntimeException);\n ::com::sun::star::uno::Reference< ::com::sun::star::awt::XDevice > SAL_CALL createDevice( sal_Int32 nWidth, sal_Int32 nHeight ) throw(::com::sun::star::uno::RuntimeException);\n ::com::sun::star::awt::DeviceInfo SAL_CALL getInfo() throw(::com::sun::star::uno::RuntimeException);\n ::com::sun::star::uno::Sequence< ::com::sun::star::awt::FontDescriptor > SAL_CALL getFontDescriptors( ) throw(::com::sun::star::uno::RuntimeException);\n ::com::sun::star::uno::Reference< ::com::sun::star::awt::XFont > SAL_CALL getFont( const ::com::sun::star::awt::FontDescriptor& aDescriptor ) throw(::com::sun::star::uno::RuntimeException);\n ::com::sun::star::uno::Reference< ::com::sun::star::awt::XBitmap > SAL_CALL createBitmap( sal_Int32 nX, sal_Int32 nY, sal_Int32 nWidth, sal_Int32 nHeight ) throw(::com::sun::star::uno::RuntimeException);\n ::com::sun::star::uno::Reference< ::com::sun::star::awt::XDisplayBitmap > SAL_CALL createDisplayBitmap( const ::com::sun::star::uno::Reference< ::com::sun::star::awt::XBitmap >& Bitmap ) throw(::com::sun::star::uno::RuntimeException);\n\n \/\/ ::com::sun::star::awt::XTextConstraints\n \/\/ ::sal_Int32 SAL_CALL getTextWidth( const ::rtl::OUString& Text ) throw (::com::sun::star::uno::RuntimeException);\n \/\/ ::sal_Int32 SAL_CALL getTextHeight( ) throw (::com::sun::star::uno::RuntimeException);\n\n \/\/ ::com::sun::star::awt::XUnitConversion\n ::com::sun::star::awt::Point SAL_CALL convertPointToLogic( const ::com::sun::star::awt::Point& aPoint, ::sal_Int16 TargetUnit ) throw (::com::sun::star::lang::IllegalArgumentException, ::com::sun::star::uno::RuntimeException);\n ::com::sun::star::awt::Point SAL_CALL convertPointToPixel( const ::com::sun::star::awt::Point& aPoint, ::sal_Int16 SourceUnit ) throw (::com::sun::star::lang::IllegalArgumentException, ::com::sun::star::uno::RuntimeException);\n ::com::sun::star::awt::Size SAL_CALL convertSizeToLogic( const ::com::sun::star::awt::Size& aSize, ::sal_Int16 TargetUnit ) throw (::com::sun::star::lang::IllegalArgumentException, ::com::sun::star::uno::RuntimeException);\n ::com::sun::star::awt::Size SAL_CALL convertSizeToPixel( const ::com::sun::star::awt::Size& aSize, ::sal_Int16 SourceUnit ) throw (::com::sun::star::lang::IllegalArgumentException, ::com::sun::star::uno::RuntimeException);\n\n\n};\n\n\/\/ ----------------------------------------------------\n\/\/ class VCLXVirtualDevice\n\/\/ ----------------------------------------------------\n\nclass VCLXVirtualDevice : public VCLXDevice\n{\nprivate:\n VirtualDevice* mpVDev;\n\npublic:\n ~VCLXVirtualDevice();\n\n void SetVirtualDevice( VirtualDevice* pVDev ) { SetOutputDevice( (OutputDevice*)pVDev ); }\n};\n\n\n\n\n#endif \/\/ _TOOLKIT_AWT_VCLXDEVICE_HXX_\n\n<|endoftext|>"} {"text":"<commit_before><commit_msg>Make AliDataFile ignore AliPhysics version tags<commit_after><|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 \"mitkSegmentationTaskList.h\"\n\n#include <mitkIOUtil.h>\n#include <mitkProperties.h>\n\nmitk::SegmentationTaskList::Task::Task()\n : m_Defaults(nullptr)\n{\n}\n\nmitk::SegmentationTaskList::Task::~Task()\n{\n}\n\nvoid mitk::SegmentationTaskList::Task::SetDefaults(const Task* defaults)\n{\n m_Defaults = defaults;\n}\n\nmitk::SegmentationTaskList::SegmentationTaskList()\n{\n \/\/ A base data cannot be serialized if empty. To be not considered empty its\n \/\/ geometry must consist of at least one time step. However, a segmentation\n \/\/ task would then appear as invisible spacial object in a scene. This can\n \/\/ be prevented by excluding it from the scene's bounding box calculations.\n this->GetTimeGeometry()->Expand(1);\n this->SetProperty(\"includeInBoundingBox\", BoolProperty::New(false));\n}\n\nmitk::SegmentationTaskList::SegmentationTaskList(const Self& other)\n : BaseData(other)\n{\n}\n\nmitk::SegmentationTaskList::~SegmentationTaskList()\n{\n}\n\nsize_t mitk::SegmentationTaskList::GetNumberOfTasks() const\n{\n return m_Tasks.size();\n}\n\nsize_t mitk::SegmentationTaskList::AddTask(const Task& subtask)\n{\n m_Tasks.push_back(subtask);\n m_Tasks.back().SetDefaults(&m_Defaults);\n return m_Tasks.size() - 1;\n}\n\nconst mitk::SegmentationTaskList::Task* mitk::SegmentationTaskList::GetTask(size_t index) const\n{\n return &m_Tasks.at(index);\n}\n\nmitk::SegmentationTaskList::Task* mitk::SegmentationTaskList::GetTask(size_t index)\n{\n return &m_Tasks.at(index);\n}\n\nconst mitk::SegmentationTaskList::Task& mitk::SegmentationTaskList::GetDefaults() const\n{\n return m_Defaults;\n}\n\nvoid mitk::SegmentationTaskList::SetDefaults(const Task& defaults)\n{\n m_Defaults = defaults;\n\n for (auto& subtask : m_Tasks)\n subtask.SetDefaults(&m_Defaults);\n}\n\nbool mitk::SegmentationTaskList::IsDone() const\n{\n for (size_t i = 0; i < m_Tasks.size(); ++i)\n {\n if (!this->IsDone(i))\n return false;\n }\n\n return true;\n}\n\nbool mitk::SegmentationTaskList::IsDone(size_t index) const\n{\n return fs::exists(this->GetAbsolutePath(m_Tasks.at(index).GetResult()));\n}\n\nfs::path mitk::SegmentationTaskList::GetInputLocation() const\n{\n std::string inputLocation;\n this->GetPropertyList()->GetStringProperty(\"MITK.IO.reader.inputlocation\", inputLocation);\n\n return !inputLocation.empty()\n ? fs::path(inputLocation).lexically_normal()\n : fs::path();\n}\n\nfs::path mitk::SegmentationTaskList::GetBasePath() const\n{\n return this->GetInputLocation().remove_filename();\n}\n\nfs::path mitk::SegmentationTaskList::GetAbsolutePath(const fs::path& path) const\n{\n if (path.empty())\n return path;\n\n auto normalizedPath = path.lexically_normal();\n\n return !normalizedPath.is_absolute()\n ? this->GetBasePath() \/ normalizedPath\n : normalizedPath;\n}\n\nvoid mitk::SegmentationTaskList::SaveTask(size_t index, const BaseData* segmentation)\n{\n if (segmentation == nullptr)\n return;\n\n auto path = this->GetAbsolutePath(this->GetResult(index));\n IOUtil::Save(segmentation, path.string());\n}\n\nstd::vector<mitk::SegmentationTaskList::Task>::const_iterator mitk::SegmentationTaskList::begin() const\n{\n return m_Tasks.begin();\n}\n\nstd::vector<mitk::SegmentationTaskList::Task>::const_iterator mitk::SegmentationTaskList::end() const\n{\n return m_Tasks.end();\n}\n\nstd::vector<mitk::SegmentationTaskList::Task>::iterator mitk::SegmentationTaskList::begin()\n{\n return m_Tasks.begin();\n}\n\nstd::vector<mitk::SegmentationTaskList::Task>::iterator mitk::SegmentationTaskList::end()\n{\n return m_Tasks.end();\n}\n\nvoid mitk::SegmentationTaskList::SetRequestedRegionToLargestPossibleRegion()\n{\n}\n\nbool mitk::SegmentationTaskList::RequestedRegionIsOutsideOfTheBufferedRegion()\n{\n return false;\n}\n\nbool mitk::SegmentationTaskList::VerifyRequestedRegion()\n{\n return true;\n}\n\nvoid mitk::SegmentationTaskList::SetRequestedRegion(const itk::DataObject*)\n{\n}\n<commit_msg>Remove calls to lexically_normal()<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 \"mitkSegmentationTaskList.h\"\n\n#include <mitkIOUtil.h>\n#include <mitkProperties.h>\n\nmitk::SegmentationTaskList::Task::Task()\n : m_Defaults(nullptr)\n{\n}\n\nmitk::SegmentationTaskList::Task::~Task()\n{\n}\n\nvoid mitk::SegmentationTaskList::Task::SetDefaults(const Task* defaults)\n{\n m_Defaults = defaults;\n}\n\nmitk::SegmentationTaskList::SegmentationTaskList()\n{\n \/\/ A base data cannot be serialized if empty. To be not considered empty its\n \/\/ geometry must consist of at least one time step. However, a segmentation\n \/\/ task would then appear as invisible spacial object in a scene. This can\n \/\/ be prevented by excluding it from the scene's bounding box calculations.\n this->GetTimeGeometry()->Expand(1);\n this->SetProperty(\"includeInBoundingBox\", BoolProperty::New(false));\n}\n\nmitk::SegmentationTaskList::SegmentationTaskList(const Self& other)\n : BaseData(other)\n{\n}\n\nmitk::SegmentationTaskList::~SegmentationTaskList()\n{\n}\n\nsize_t mitk::SegmentationTaskList::GetNumberOfTasks() const\n{\n return m_Tasks.size();\n}\n\nsize_t mitk::SegmentationTaskList::AddTask(const Task& subtask)\n{\n m_Tasks.push_back(subtask);\n m_Tasks.back().SetDefaults(&m_Defaults);\n return m_Tasks.size() - 1;\n}\n\nconst mitk::SegmentationTaskList::Task* mitk::SegmentationTaskList::GetTask(size_t index) const\n{\n return &m_Tasks.at(index);\n}\n\nmitk::SegmentationTaskList::Task* mitk::SegmentationTaskList::GetTask(size_t index)\n{\n return &m_Tasks.at(index);\n}\n\nconst mitk::SegmentationTaskList::Task& mitk::SegmentationTaskList::GetDefaults() const\n{\n return m_Defaults;\n}\n\nvoid mitk::SegmentationTaskList::SetDefaults(const Task& defaults)\n{\n m_Defaults = defaults;\n\n for (auto& subtask : m_Tasks)\n subtask.SetDefaults(&m_Defaults);\n}\n\nbool mitk::SegmentationTaskList::IsDone() const\n{\n for (size_t i = 0; i < m_Tasks.size(); ++i)\n {\n if (!this->IsDone(i))\n return false;\n }\n\n return true;\n}\n\nbool mitk::SegmentationTaskList::IsDone(size_t index) const\n{\n return fs::exists(this->GetAbsolutePath(m_Tasks.at(index).GetResult()));\n}\n\nfs::path mitk::SegmentationTaskList::GetInputLocation() const\n{\n std::string inputLocation;\n this->GetPropertyList()->GetStringProperty(\"MITK.IO.reader.inputlocation\", inputLocation);\n\n return !inputLocation.empty()\n ? fs::path(inputLocation)\/*.lexically_normal()*\/ \/\/ See T29246\n : fs::path();\n}\n\nfs::path mitk::SegmentationTaskList::GetBasePath() const\n{\n return this->GetInputLocation().remove_filename();\n}\n\nfs::path mitk::SegmentationTaskList::GetAbsolutePath(const fs::path& path) const\n{\n if (path.empty())\n return path;\n\n auto normalizedPath = path\/*.lexically_normal()*\/; \/\/ See T29246\n\n return !normalizedPath.is_absolute()\n ? this->GetBasePath() \/ normalizedPath\n : normalizedPath;\n}\n\nvoid mitk::SegmentationTaskList::SaveTask(size_t index, const BaseData* segmentation)\n{\n if (segmentation == nullptr)\n return;\n\n auto path = this->GetAbsolutePath(this->GetResult(index));\n IOUtil::Save(segmentation, path.string());\n}\n\nstd::vector<mitk::SegmentationTaskList::Task>::const_iterator mitk::SegmentationTaskList::begin() const\n{\n return m_Tasks.begin();\n}\n\nstd::vector<mitk::SegmentationTaskList::Task>::const_iterator mitk::SegmentationTaskList::end() const\n{\n return m_Tasks.end();\n}\n\nstd::vector<mitk::SegmentationTaskList::Task>::iterator mitk::SegmentationTaskList::begin()\n{\n return m_Tasks.begin();\n}\n\nstd::vector<mitk::SegmentationTaskList::Task>::iterator mitk::SegmentationTaskList::end()\n{\n return m_Tasks.end();\n}\n\nvoid mitk::SegmentationTaskList::SetRequestedRegionToLargestPossibleRegion()\n{\n}\n\nbool mitk::SegmentationTaskList::RequestedRegionIsOutsideOfTheBufferedRegion()\n{\n return false;\n}\n\nbool mitk::SegmentationTaskList::VerifyRequestedRegion()\n{\n return true;\n}\n\nvoid mitk::SegmentationTaskList::SetRequestedRegion(const itk::DataObject*)\n{\n}\n<|endoftext|>"} {"text":"<commit_before>\/\/ Natron\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 * Created by Alexandre GAUTHIER-FOICHAT on 6\/1\/2012.\n * contact: immarespond at gmail dot com\n *\n *\/\n\n\n#include \"BaseTest.h\"\n\n#include \"Engine\/Node.h\"\n#include \"Engine\/Project.h\"\n#include \"Engine\/AppManager.h\"\n#include \"Engine\/AppInstance.h\"\n#include \"Engine\/EffectInstance.h\"\n#include \"Engine\/Plugin.h\"\nusing namespace Natron;\n\n\nBaseTest::BaseTest()\n : testing::Test()\n , _app(0)\n{\n}\n\nBaseTest::~BaseTest()\n{\n}\n\nvoid\nBaseTest::registerTestPlugins()\n{\n _allTestPluginIDs.clear();\n\n _dotGeneratorPluginID = PLUGINID_OFX_DOTEXAMPLE;\n _allTestPluginIDs.push_back(_dotGeneratorPluginID);\n\n _readOIIOPluginID = PLUGINID_OFX_READOIIO;\n _allTestPluginIDs.push_back(_readOIIOPluginID);\n\n _writeOIIOPluginID = PLUGINID_OFX_WRITEOIIO;\n _allTestPluginIDs.push_back(_writeOIIOPluginID);\n\n for (unsigned int i = 0; i < _allTestPluginIDs.size(); ++i) {\n \/\/\/make sure the generic test plugin is present\n Natron::LibraryBinary* bin = NULL;\n try {\n Natron::Plugin* p = appPTR->getPluginBinary(_allTestPluginIDs[i], -1, -1);\n if (p) {\n bin = p->getLibraryBinary();\n }\n \n } catch (const std::exception & e) {\n std::cout << e.what() << std::endl;\n }\n\n ASSERT_TRUE(bin != NULL);\n }\n}\n\nvoid\nBaseTest::SetUp()\n{\n AppManager* manager = new AppManager;\n int argc = 0;\n\n manager->load(argc,NULL,QString(),QStringList(),std::list<std::pair<int,int> >(),QString());\n\n _app = manager->getTopLevelInstance();\n\n registerTestPlugins();\n}\n\nvoid\nBaseTest::TearDown()\n{\n _app->quit();\n _app = 0;\n appPTR->setNumberOfThreads(0);\n delete appPTR;\n}\n\nboost::shared_ptr<Natron::Node> BaseTest::createNode(const QString & pluginID,\n int majorVersion,\n int minorVersion)\n{\n boost::shared_ptr<Node> ret = _app->createNode( CreateNodeArgs(pluginID,\n \"\",\n majorVersion,minorVersion,-1,true,INT_MIN,INT_MIN,true,true,\n QString(),CreateNodeArgs::DefaultValuesList()) );\n\n EXPECT_NE(ret.get(),(Natron::Node*)NULL);\n\n return ret;\n}\n\nvoid\nBaseTest::connectNodes(boost::shared_ptr<Natron::Node> input,\n boost::shared_ptr<Natron::Node> output,\n int inputNumber,\n bool expectedReturnValue)\n{\n if (expectedReturnValue) {\n \/\/\/check that the connections are internally all set as \"expected\"\n\n EXPECT_EQ( (Natron::Node*)NULL,output->getInput(inputNumber).get() );\n EXPECT_FALSE( output->isInputConnected(inputNumber) );\n } else {\n \/\/\/the call can only fail for those 2 reasons\n EXPECT_TRUE(inputNumber > output->getMaxInputCount() || \/\/< inputNumber is greater than the maximum input number\n output->getInput(inputNumber).get() != (Natron::Node*)NULL); \/\/< input slot is already filled with another node\n }\n\n\n bool ret = _app->getProject()->connectNodes(inputNumber,input,output.get());\n EXPECT_EQ(expectedReturnValue,ret);\n\n if (expectedReturnValue) {\n EXPECT_TRUE( input->hasOutputConnected() );\n EXPECT_EQ(output->getInput(inputNumber),input);\n EXPECT_TRUE( output->isInputConnected(inputNumber) );\n }\n}\n\nvoid\nBaseTest::disconnectNodes(boost::shared_ptr<Natron::Node> input,\n boost::shared_ptr<Natron::Node> output,\n bool expectedReturnvalue)\n{\n if (expectedReturnvalue) {\n \/\/\/check that the connections are internally all set as \"expected\"\n\n \/\/\/the input must have in its output the node 'output'\n EXPECT_TRUE( input->hasOutputConnected() );\n const std::list<Natron::Node*> & outputs = input->getOutputs();\n bool foundOutput = false;\n for (std::list<Natron::Node* >::const_iterator it = outputs.begin(); it != outputs.end(); ++it) {\n if ( *it == output.get() ) {\n foundOutput = true;\n break;\n }\n }\n\n \/\/\/the output must have in its inputs the node 'input'\n const std::vector<boost::shared_ptr<Natron::Node> > & inputs = output->getInputs_mt_safe();\n int inputIndex = 0;\n bool foundInput = false;\n for (U32 i = 0; i < inputs.size(); ++i) {\n if (inputs[i] == input) {\n foundInput = true;\n break;\n }\n ++inputIndex;\n }\n\n EXPECT_TRUE(foundInput);\n EXPECT_TRUE(foundOutput);\n EXPECT_EQ(output->getInput(inputIndex),input);\n EXPECT_TRUE( output->isInputConnected(inputIndex) );\n }\n\n \/\/\/call disconnect\n bool ret = _app->getProject()->disconnectNodes(input.get(),output.get());\n EXPECT_EQ(expectedReturnvalue,ret);\n\n if (expectedReturnvalue) {\n \/\/\/check that the disconnection went OK\n\n const std::list<Natron::Node*> & outputs = input->getOutputs();\n bool foundOutput = false;\n for (std::list<Natron::Node* >::const_iterator it = outputs.begin(); it != outputs.end(); ++it) {\n if ( (*it) == output.get() ) {\n foundOutput = true;\n break;\n }\n }\n\n \/\/\/the output must have in its inputs the node 'input'\n const std::vector<boost::shared_ptr<Natron::Node> > & inputs = output->getInputs_mt_safe();\n int inputIndex = 0;\n bool foundInput = false;\n for (U32 i = 0; i < inputs.size(); ++i) {\n if (inputs[i] == input) {\n foundInput = true;\n break;\n }\n ++inputIndex;\n }\n\n EXPECT_FALSE(foundOutput);\n EXPECT_FALSE(foundInput);\n EXPECT_EQ( (Natron::Node*)NULL,output->getInput(inputIndex).get() );\n EXPECT_FALSE( output->isInputConnected(inputIndex) );\n }\n} \/\/ disconnectNodes\n\n\/\/\/High level test: render 1 frame of dot generator\nTEST_F(BaseTest,GenerateDot)\n{\n \/\/\/create the generator\n boost::shared_ptr<Node> generator = createNode(_dotGeneratorPluginID);\n\n \/\/\/create the writer and set its output filename\n boost::shared_ptr<Node> writer = createNode(_writeOIIOPluginID);\n\n writer->setOutputFilesForWriter(\"test_dot_generator#.jpg\");\n\n \/\/\/attempt to connect the 2 nodes together\n connectNodes(generator, writer, 0, true);\n\n \/\/\/and start rendering. This call is blocking.\n std::list<AppInstance::RenderWork> works;\n AppInstance::RenderWork w;\n w.writer = dynamic_cast<Natron::OutputEffectInstance*>(writer->getLiveInstance());\n assert(w.writer);\n w.firstFrame = INT_MIN;\n w.lastFrame = INT_MAX;\n works.push_back(w);\n _app->startWritersRendering(works);\n}\n\n\/\/\/High level test: simple node connections test\nTEST_F(BaseTest,SimpleNodeConnections) {\n \/\/\/create the generator\n boost::shared_ptr<Node> generator = createNode(_dotGeneratorPluginID);\n\n \/\/\/create the writer and set its output filename\n boost::shared_ptr<Node> writer = createNode(_writeOIIOPluginID);\n\n connectNodes(generator, writer, 0, true);\n connectNodes(generator, writer, 0, false); \/\/< expect it to fail\n disconnectNodes(generator, writer, true);\n disconnectNodes(generator, writer, false);\n connectNodes(generator, writer, 0, true);\n}\n<commit_msg>Fix unit test<commit_after>\/\/ Natron\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 * Created by Alexandre GAUTHIER-FOICHAT on 6\/1\/2012.\n * contact: immarespond at gmail dot com\n *\n *\/\n\n\n#include \"BaseTest.h\"\n\n#include \"Engine\/Node.h\"\n#include \"Engine\/Project.h\"\n#include \"Engine\/AppManager.h\"\n#include \"Engine\/AppInstance.h\"\n#include \"Engine\/EffectInstance.h\"\n#include \"Engine\/Plugin.h\"\nusing namespace Natron;\n\n\nBaseTest::BaseTest()\n : testing::Test()\n , _app(0)\n{\n}\n\nBaseTest::~BaseTest()\n{\n}\n\nvoid\nBaseTest::registerTestPlugins()\n{\n _allTestPluginIDs.clear();\n\n _dotGeneratorPluginID = PLUGINID_OFX_DOTEXAMPLE;\n _allTestPluginIDs.push_back(_dotGeneratorPluginID);\n\n _readOIIOPluginID = PLUGINID_OFX_READOIIO;\n _allTestPluginIDs.push_back(_readOIIOPluginID);\n\n _writeOIIOPluginID = PLUGINID_OFX_WRITEOIIO;\n _allTestPluginIDs.push_back(_writeOIIOPluginID);\n\n for (unsigned int i = 0; i < _allTestPluginIDs.size(); ++i) {\n \/\/\/make sure the generic test plugin is present\n Natron::LibraryBinary* bin = NULL;\n try {\n Natron::Plugin* p = appPTR->getPluginBinary(_allTestPluginIDs[i], -1, -1, false);\n if (p) {\n bin = p->getLibraryBinary();\n }\n \n } catch (const std::exception & e) {\n std::cout << e.what() << std::endl;\n }\n\n ASSERT_TRUE(bin != NULL);\n }\n}\n\nvoid\nBaseTest::SetUp()\n{\n AppManager* manager = new AppManager;\n int argc = 0;\n\n manager->load(argc,NULL,QString(),QStringList(),std::list<std::pair<int,int> >(),QString());\n\n _app = manager->getTopLevelInstance();\n\n registerTestPlugins();\n}\n\nvoid\nBaseTest::TearDown()\n{\n _app->quit();\n _app = 0;\n appPTR->setNumberOfThreads(0);\n delete appPTR;\n}\n\nboost::shared_ptr<Natron::Node> BaseTest::createNode(const QString & pluginID,\n int majorVersion,\n int minorVersion)\n{\n boost::shared_ptr<Node> ret = _app->createNode( CreateNodeArgs(pluginID,\n \"\",\n majorVersion,minorVersion,-1,true,INT_MIN,INT_MIN,true,true,\n QString(),CreateNodeArgs::DefaultValuesList()) );\n\n EXPECT_NE(ret.get(),(Natron::Node*)NULL);\n\n return ret;\n}\n\nvoid\nBaseTest::connectNodes(boost::shared_ptr<Natron::Node> input,\n boost::shared_ptr<Natron::Node> output,\n int inputNumber,\n bool expectedReturnValue)\n{\n if (expectedReturnValue) {\n \/\/\/check that the connections are internally all set as \"expected\"\n\n EXPECT_EQ( (Natron::Node*)NULL,output->getInput(inputNumber).get() );\n EXPECT_FALSE( output->isInputConnected(inputNumber) );\n } else {\n \/\/\/the call can only fail for those 2 reasons\n EXPECT_TRUE(inputNumber > output->getMaxInputCount() || \/\/< inputNumber is greater than the maximum input number\n output->getInput(inputNumber).get() != (Natron::Node*)NULL); \/\/< input slot is already filled with another node\n }\n\n\n bool ret = _app->getProject()->connectNodes(inputNumber,input,output.get());\n EXPECT_EQ(expectedReturnValue,ret);\n\n if (expectedReturnValue) {\n EXPECT_TRUE( input->hasOutputConnected() );\n EXPECT_EQ(output->getInput(inputNumber),input);\n EXPECT_TRUE( output->isInputConnected(inputNumber) );\n }\n}\n\nvoid\nBaseTest::disconnectNodes(boost::shared_ptr<Natron::Node> input,\n boost::shared_ptr<Natron::Node> output,\n bool expectedReturnvalue)\n{\n if (expectedReturnvalue) {\n \/\/\/check that the connections are internally all set as \"expected\"\n\n \/\/\/the input must have in its output the node 'output'\n EXPECT_TRUE( input->hasOutputConnected() );\n const std::list<Natron::Node*> & outputs = input->getOutputs();\n bool foundOutput = false;\n for (std::list<Natron::Node* >::const_iterator it = outputs.begin(); it != outputs.end(); ++it) {\n if ( *it == output.get() ) {\n foundOutput = true;\n break;\n }\n }\n\n \/\/\/the output must have in its inputs the node 'input'\n const std::vector<boost::shared_ptr<Natron::Node> > & inputs = output->getInputs_mt_safe();\n int inputIndex = 0;\n bool foundInput = false;\n for (U32 i = 0; i < inputs.size(); ++i) {\n if (inputs[i] == input) {\n foundInput = true;\n break;\n }\n ++inputIndex;\n }\n\n EXPECT_TRUE(foundInput);\n EXPECT_TRUE(foundOutput);\n EXPECT_EQ(output->getInput(inputIndex),input);\n EXPECT_TRUE( output->isInputConnected(inputIndex) );\n }\n\n \/\/\/call disconnect\n bool ret = _app->getProject()->disconnectNodes(input.get(),output.get());\n EXPECT_EQ(expectedReturnvalue,ret);\n\n if (expectedReturnvalue) {\n \/\/\/check that the disconnection went OK\n\n const std::list<Natron::Node*> & outputs = input->getOutputs();\n bool foundOutput = false;\n for (std::list<Natron::Node* >::const_iterator it = outputs.begin(); it != outputs.end(); ++it) {\n if ( (*it) == output.get() ) {\n foundOutput = true;\n break;\n }\n }\n\n \/\/\/the output must have in its inputs the node 'input'\n const std::vector<boost::shared_ptr<Natron::Node> > & inputs = output->getInputs_mt_safe();\n int inputIndex = 0;\n bool foundInput = false;\n for (U32 i = 0; i < inputs.size(); ++i) {\n if (inputs[i] == input) {\n foundInput = true;\n break;\n }\n ++inputIndex;\n }\n\n EXPECT_FALSE(foundOutput);\n EXPECT_FALSE(foundInput);\n EXPECT_EQ( (Natron::Node*)NULL,output->getInput(inputIndex).get() );\n EXPECT_FALSE( output->isInputConnected(inputIndex) );\n }\n} \/\/ disconnectNodes\n\n\/\/\/High level test: render 1 frame of dot generator\nTEST_F(BaseTest,GenerateDot)\n{\n \/\/\/create the generator\n boost::shared_ptr<Node> generator = createNode(_dotGeneratorPluginID);\n\n \/\/\/create the writer and set its output filename\n boost::shared_ptr<Node> writer = createNode(_writeOIIOPluginID);\n\n writer->setOutputFilesForWriter(\"test_dot_generator#.jpg\");\n\n \/\/\/attempt to connect the 2 nodes together\n connectNodes(generator, writer, 0, true);\n\n \/\/\/and start rendering. This call is blocking.\n std::list<AppInstance::RenderWork> works;\n AppInstance::RenderWork w;\n w.writer = dynamic_cast<Natron::OutputEffectInstance*>(writer->getLiveInstance());\n assert(w.writer);\n w.firstFrame = INT_MIN;\n w.lastFrame = INT_MAX;\n works.push_back(w);\n _app->startWritersRendering(works);\n}\n\n\/\/\/High level test: simple node connections test\nTEST_F(BaseTest,SimpleNodeConnections) {\n \/\/\/create the generator\n boost::shared_ptr<Node> generator = createNode(_dotGeneratorPluginID);\n\n \/\/\/create the writer and set its output filename\n boost::shared_ptr<Node> writer = createNode(_writeOIIOPluginID);\n\n connectNodes(generator, writer, 0, true);\n connectNodes(generator, writer, 0, false); \/\/< expect it to fail\n disconnectNodes(generator, writer, true);\n disconnectNodes(generator, writer, false);\n connectNodes(generator, writer, 0, true);\n}\n<|endoftext|>"} {"text":"<commit_before>\/*********************************************************************\n * Software License Agreement (BSD License)\n *\n * Copyright (c) 2016, CITEC, Bielefeld University\n * All rights reserved.\n *\n * Redistribution and use in source and binary forms, with or without\n * modification, are permitted provided that the following conditions\n * are met:\n *\n * * Redistributions of source code must retain the above copyright\n * notice, this list of conditions and the following disclaimer.\n * * Redistributions in binary form must reproduce the above\n * copyright notice, this list of conditions and the following\n * disclaimer in the documentation and\/or other materials provided\n * with the distribution.\n * * Neither the name of Willow Garage nor the names of its\n * contributors may be used to endorse or promote products derived\n * from this software without specific prior written permission.\n *\n * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS\n * \"AS IS\" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT\n * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS\n * FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE\n * COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT,\n * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING,\n * BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;\n * LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER\n * CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT\n * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN\n * ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE\n * POSSIBILITY OF SUCH DAMAGE.\n *********************************************************************\/\n\n\/* Author: Robert Haschke *\/\n\n#include \"collision_linear_model.h\"\n#include \"collision_matrix_model.h\"\n\n#include <QItemSelection>\n#include <QPainter>\n\nusing namespace moveit_setup_assistant;\n\nCollisionLinearModel::CollisionLinearModel(CollisionMatrixModel* src, QObject* parent) : QAbstractProxyModel(parent)\n{\n setSourceModel(src);\n}\nCollisionLinearModel::~CollisionLinearModel()\n{\n delete sourceModel();\n}\n\nQModelIndex CollisionLinearModel::mapFromSource(const QModelIndex& sourceIndex) const\n{\n \/\/ map (row,column) index to linear index k\n \/\/ http:\/\/stackoverflow.com\/questions\/27086195\/linear-index-upper-triangular-matrix\n int r = sourceIndex.row(), c = sourceIndex.column();\n int n = this->sourceModel()->columnCount();\n if (r == c)\n return QModelIndex(); \/\/ main diagonal elements are invalid\n if (r > c) \/\/ only consider upper triagonal matrix\n std::swap(r, c); \/\/ swap r,c if below diagonal\n\n int k = (n * (n - 1) \/ 2) - (n - r) * ((n - r) - 1) \/ 2 + c - r - 1;\n return index(k, 2);\n}\n\nQModelIndex CollisionLinearModel::mapToSource(const QModelIndex& proxyIndex) const\n{\n \/\/ map linear index k to (row, column)\n \/\/ http:\/\/stackoverflow.com\/questions\/27086195\/linear-index-upper-triangular-matrix\n int n = sourceModel()->columnCount();\n int k = proxyIndex.row(); \/\/ linear (row) index\n int r = n - 2 - (int)(sqrt(-8 * k + 4 * n * (n - 1) - 7) \/ 2.0 - 0.5);\n int c = k + r + 1 - n * (n - 1) \/ 2 + (n - r) * ((n - r) - 1) \/ 2;\n return sourceModel()->index(r, c);\n}\n\nint CollisionLinearModel::rowCount(const QModelIndex& parent) const\n{\n int n = this->sourceModel()->rowCount();\n return (n * (n - 1) \/ 2);\n}\n\nint CollisionLinearModel::columnCount(const QModelIndex& parent) const\n{\n return 4;\n}\n\nQModelIndex CollisionLinearModel::index(int row, int column, const QModelIndex& parent) const\n{\n return createIndex(row, column);\n}\n\nQModelIndex CollisionLinearModel::parent(const QModelIndex& child) const\n{\n return QModelIndex();\n}\n\nQVariant CollisionLinearModel::data(const QModelIndex& index, int role) const\n{\n QModelIndex srcIndex = this->mapToSource(index);\n switch (index.column())\n {\n case 0: \/\/ link name 1\n if (role != Qt::DisplayRole)\n return QVariant();\n else\n return this->sourceModel()->headerData(srcIndex.row(), Qt::Horizontal, Qt::DisplayRole);\n case 1: \/\/ link name 2\n if (role != Qt::DisplayRole)\n return QVariant();\n return this->sourceModel()->headerData(srcIndex.column(), Qt::Vertical, Qt::DisplayRole);\n case 2: \/\/ checkbox\n if (role != Qt::CheckStateRole)\n return QVariant();\n else\n return this->sourceModel()->data(srcIndex, Qt::CheckStateRole);\n case 3: \/\/ reason\n if (role != Qt::DisplayRole)\n return QVariant();\n else\n return this->sourceModel()->data(srcIndex, Qt::ToolTipRole);\n }\n return QVariant();\n}\n\nDisabledReason CollisionLinearModel::reason(int row) const\n{\n QModelIndex srcIndex = this->mapToSource(index(row, 0));\n return qobject_cast<CollisionMatrixModel*>(sourceModel())->reason(srcIndex);\n}\n\nbool CollisionLinearModel::setData(const QModelIndex& index, const QVariant& value, int role)\n{\n QModelIndex srcIndex = this->mapToSource(index);\n\n if (role == Qt::CheckStateRole)\n {\n sourceModel()->setData(srcIndex, value, role);\n int r = index.row();\n Q_EMIT dataChanged(this->index(r, 2), this->index(r, 3)); \/\/ reason changed too\n return true;\n }\n return false; \/\/ reject all other changes\n}\n\nvoid CollisionLinearModel::setEnabled(const QItemSelection& selection, bool value)\n{\n for (const auto idx : selection.indexes())\n {\n if (idx.column() != 2) \/\/ only consider checkbox indexes\n continue;\n setData(idx, value ? Qt::Checked : Qt::Unchecked, Qt::CheckStateRole);\n }\n}\n\nQt::ItemFlags CollisionLinearModel::flags(const QModelIndex& index) const\n{\n if (index.column() == 2)\n return Qt::ItemIsUserCheckable | QAbstractItemModel::flags(index);\n else\n return QAbstractItemModel::flags(index);\n}\n\nQVariant CollisionLinearModel::headerData(int section, Qt::Orientation orientation, int role) const\n{\n if (role != Qt::DisplayRole)\n return QVariant();\n\n if (orientation == Qt::Horizontal)\n {\n switch (section)\n {\n case 0:\n return \"Link A\";\n case 1:\n return \"Link B\";\n case 2:\n return \"Disabled\";\n case 3:\n return \"Reason to Disable\";\n }\n }\n else if (orientation == Qt::Vertical)\n {\n return section + 1;\n }\n return QVariant();\n}\n\nSortFilterProxyModel::SortFilterProxyModel(QObject* parent) : QSortFilterProxyModel(parent), show_all_(false)\n{\n#if (QT_VERSION >= QT_VERSION_CHECK(5, 0, 0))\n connect(this, SIGNAL(sourceModelChanged()), this, SLOT(initSorting()));\n#endif\n\n \/\/ by default: sort by link A (col 0), then link B (col 1)\n sort_columns_ << 0 << 1;\n sort_orders_ << Qt::AscendingOrder << Qt::AscendingOrder;\n}\n\nQVariant SortFilterProxyModel::headerData(int section, Qt::Orientation orientation, int role) const\n{\n if (role == Qt::DisplayRole && orientation == Qt::Vertical)\n return section + 1; \/\/ simply enumerate rows\n else\n return QSortFilterProxyModel::headerData(section, orientation, role);\n}\n\nvoid SortFilterProxyModel::setEnabled(const QItemSelection& selection, bool value)\n{\n static_cast<CollisionLinearModel*>(sourceModel())->setEnabled(mapSelectionToSource(selection), value);\n}\n\nvoid SortFilterProxyModel::initSorting()\n{\n int cols = sourceModel()->columnCount();\n int prev_size = sort_columns_.size();\n sort_columns_.resize(cols);\n sort_orders_.resize(cols);\n\n \/\/ initialize new entries to -1\n for (int i = prev_size, end = sort_columns_.size(); i < end; ++i)\n sort_columns_[i] = -1;\n}\n\nvoid SortFilterProxyModel::setShowAll(bool show_all)\n{\n if (show_all_ == show_all)\n return;\n\n show_all_ = show_all;\n invalidateFilter();\n}\n\nbool SortFilterProxyModel::filterAcceptsRow(int source_row, const QModelIndex& source_parent) const\n{\n CollisionLinearModel* m = qobject_cast<CollisionLinearModel*>(sourceModel());\n if (!(show_all_ || m->reason(source_row) <= moveit_setup_assistant::ALWAYS ||\n m->data(m->index(source_row, 2), Qt::CheckStateRole) == Qt::Checked))\n return false; \/\/ not accepted due to check state\n\n const QRegExp regexp = this->filterRegExp();\n if (regexp.isEmpty())\n return true;\n\n return m->data(m->index(source_row, 0, source_parent), Qt::DisplayRole).toString().contains(regexp) ||\n m->data(m->index(source_row, 1, source_parent), Qt::DisplayRole).toString().contains(regexp);\n}\n\n\/\/ define a fallback comparison operator for QVariants\n#if (QT_VERSION < QT_VERSION_CHECK(5, 0, 0))\nnamespace {\nbool operator<(const QVariant& left, const QVariant& right) {\n if (left.userType() == QVariant::Type::Int)\n return left.toInt() < right.toInt();\n else\n return left.toString() < right.toString();\n}\n}\n#endif\n\nbool SortFilterProxyModel::lessThan(const QModelIndex& src_left, const QModelIndex& src_right) const\n{\n int row_left = src_left.row();\n int row_right = src_right.row();\n QAbstractItemModel* m = sourceModel();\n\n for (int i = 0, end = sort_columns_.size(); i < end && sort_columns_[i] >= 0; ++i)\n {\n QVariant value_left = m->data(m->index(row_left, sort_columns_[i]));\n QVariant value_right = m->data(m->index(row_right, sort_columns_[i]));\n\n if (value_left == value_right)\n continue;\n\n bool smaller = (value_left < value_right);\n if (sort_orders_[i] == Qt::DescendingOrder)\n smaller = !smaller;\n return smaller;\n }\n return false;\n}\n\nvoid SortFilterProxyModel::sort(int column, Qt::SortOrder order)\n{\n beginResetModel();\n if (column < 0)\n initSorting();\n else\n {\n \/\/ remember sorting history\n int prev_idx = sort_columns_.indexOf(column);\n if (prev_idx < 0)\n prev_idx = sort_columns_.size() - 1;\n \/\/ remove old entries\n sort_columns_.takeAt(prev_idx);\n sort_orders_.remove(prev_idx);\n \/\/ add new entries at front\n sort_columns_.insert(0, column);\n sort_orders_.insert(0, order);\n }\n QSortFilterProxyModel::sort(column, Qt::AscendingOrder);\n endResetModel();\n}\n<commit_msg>fix sort role for checkbox column<commit_after>\/*********************************************************************\n * Software License Agreement (BSD License)\n *\n * Copyright (c) 2016, CITEC, Bielefeld University\n * All rights reserved.\n *\n * Redistribution and use in source and binary forms, with or without\n * modification, are permitted provided that the following conditions\n * are met:\n *\n * * Redistributions of source code must retain the above copyright\n * notice, this list of conditions and the following disclaimer.\n * * Redistributions in binary form must reproduce the above\n * copyright notice, this list of conditions and the following\n * disclaimer in the documentation and\/or other materials provided\n * with the distribution.\n * * Neither the name of Willow Garage nor the names of its\n * contributors may be used to endorse or promote products derived\n * from this software without specific prior written permission.\n *\n * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS\n * \"AS IS\" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT\n * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS\n * FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE\n * COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT,\n * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING,\n * BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;\n * LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER\n * CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT\n * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN\n * ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE\n * POSSIBILITY OF SUCH DAMAGE.\n *********************************************************************\/\n\n\/* Author: Robert Haschke *\/\n\n#include \"collision_linear_model.h\"\n#include \"collision_matrix_model.h\"\n\n#include <QItemSelection>\n#include <QPainter>\n\nusing namespace moveit_setup_assistant;\n\nCollisionLinearModel::CollisionLinearModel(CollisionMatrixModel* src, QObject* parent) : QAbstractProxyModel(parent)\n{\n setSourceModel(src);\n}\nCollisionLinearModel::~CollisionLinearModel()\n{\n delete sourceModel();\n}\n\nQModelIndex CollisionLinearModel::mapFromSource(const QModelIndex& sourceIndex) const\n{\n \/\/ map (row,column) index to linear index k\n \/\/ http:\/\/stackoverflow.com\/questions\/27086195\/linear-index-upper-triangular-matrix\n int r = sourceIndex.row(), c = sourceIndex.column();\n int n = this->sourceModel()->columnCount();\n if (r == c)\n return QModelIndex(); \/\/ main diagonal elements are invalid\n if (r > c) \/\/ only consider upper triagonal matrix\n std::swap(r, c); \/\/ swap r,c if below diagonal\n\n int k = (n * (n - 1) \/ 2) - (n - r) * ((n - r) - 1) \/ 2 + c - r - 1;\n return index(k, 2);\n}\n\nQModelIndex CollisionLinearModel::mapToSource(const QModelIndex& proxyIndex) const\n{\n \/\/ map linear index k to (row, column)\n \/\/ http:\/\/stackoverflow.com\/questions\/27086195\/linear-index-upper-triangular-matrix\n int n = sourceModel()->columnCount();\n int k = proxyIndex.row(); \/\/ linear (row) index\n int r = n - 2 - (int)(sqrt(-8 * k + 4 * n * (n - 1) - 7) \/ 2.0 - 0.5);\n int c = k + r + 1 - n * (n - 1) \/ 2 + (n - r) * ((n - r) - 1) \/ 2;\n return sourceModel()->index(r, c);\n}\n\nint CollisionLinearModel::rowCount(const QModelIndex& parent) const\n{\n int n = this->sourceModel()->rowCount();\n return (n * (n - 1) \/ 2);\n}\n\nint CollisionLinearModel::columnCount(const QModelIndex& parent) const\n{\n return 4;\n}\n\nQModelIndex CollisionLinearModel::index(int row, int column, const QModelIndex& parent) const\n{\n return createIndex(row, column);\n}\n\nQModelIndex CollisionLinearModel::parent(const QModelIndex& child) const\n{\n return QModelIndex();\n}\n\nQVariant CollisionLinearModel::data(const QModelIndex& index, int role) const\n{\n QModelIndex srcIndex = this->mapToSource(index);\n switch (index.column())\n {\n case 0: \/\/ link name 1\n if (role != Qt::DisplayRole)\n return QVariant();\n else\n return this->sourceModel()->headerData(srcIndex.row(), Qt::Horizontal, Qt::DisplayRole);\n case 1: \/\/ link name 2\n if (role != Qt::DisplayRole)\n return QVariant();\n return this->sourceModel()->headerData(srcIndex.column(), Qt::Vertical, Qt::DisplayRole);\n case 2: \/\/ checkbox\n if (role != Qt::CheckStateRole)\n return QVariant();\n else\n return this->sourceModel()->data(srcIndex, Qt::CheckStateRole);\n case 3: \/\/ reason\n if (role != Qt::DisplayRole)\n return QVariant();\n else\n return this->sourceModel()->data(srcIndex, Qt::ToolTipRole);\n }\n return QVariant();\n}\n\nDisabledReason CollisionLinearModel::reason(int row) const\n{\n QModelIndex srcIndex = this->mapToSource(index(row, 0));\n return qobject_cast<CollisionMatrixModel*>(sourceModel())->reason(srcIndex);\n}\n\nbool CollisionLinearModel::setData(const QModelIndex& index, const QVariant& value, int role)\n{\n QModelIndex srcIndex = this->mapToSource(index);\n\n if (role == Qt::CheckStateRole)\n {\n sourceModel()->setData(srcIndex, value, role);\n int r = index.row();\n Q_EMIT dataChanged(this->index(r, 2), this->index(r, 3)); \/\/ reason changed too\n return true;\n }\n return false; \/\/ reject all other changes\n}\n\nvoid CollisionLinearModel::setEnabled(const QItemSelection& selection, bool value)\n{\n for (const auto idx : selection.indexes())\n {\n if (idx.column() != 2) \/\/ only consider checkbox indexes\n continue;\n setData(idx, value ? Qt::Checked : Qt::Unchecked, Qt::CheckStateRole);\n }\n}\n\nQt::ItemFlags CollisionLinearModel::flags(const QModelIndex& index) const\n{\n if (index.column() == 2)\n return Qt::ItemIsUserCheckable | QAbstractItemModel::flags(index);\n else\n return QAbstractItemModel::flags(index);\n}\n\nQVariant CollisionLinearModel::headerData(int section, Qt::Orientation orientation, int role) const\n{\n if (role != Qt::DisplayRole)\n return QVariant();\n\n if (orientation == Qt::Horizontal)\n {\n switch (section)\n {\n case 0:\n return \"Link A\";\n case 1:\n return \"Link B\";\n case 2:\n return \"Disabled\";\n case 3:\n return \"Reason to Disable\";\n }\n }\n else if (orientation == Qt::Vertical)\n {\n return section + 1;\n }\n return QVariant();\n}\n\nSortFilterProxyModel::SortFilterProxyModel(QObject* parent) : QSortFilterProxyModel(parent), show_all_(false)\n{\n#if (QT_VERSION >= QT_VERSION_CHECK(5, 0, 0))\n connect(this, SIGNAL(sourceModelChanged()), this, SLOT(initSorting()));\n#endif\n\n \/\/ by default: sort by link A (col 0), then link B (col 1)\n sort_columns_ << 0 << 1;\n sort_orders_ << Qt::AscendingOrder << Qt::AscendingOrder;\n}\n\nQVariant SortFilterProxyModel::headerData(int section, Qt::Orientation orientation, int role) const\n{\n if (role == Qt::DisplayRole && orientation == Qt::Vertical)\n return section + 1; \/\/ simply enumerate rows\n else\n return QSortFilterProxyModel::headerData(section, orientation, role);\n}\n\nvoid SortFilterProxyModel::setEnabled(const QItemSelection& selection, bool value)\n{\n static_cast<CollisionLinearModel*>(sourceModel())->setEnabled(mapSelectionToSource(selection), value);\n}\n\nvoid SortFilterProxyModel::initSorting()\n{\n int cols = sourceModel()->columnCount();\n int prev_size = sort_columns_.size();\n sort_columns_.resize(cols);\n sort_orders_.resize(cols);\n\n \/\/ initialize new entries to -1\n for (int i = prev_size, end = sort_columns_.size(); i < end; ++i)\n sort_columns_[i] = -1;\n}\n\nvoid SortFilterProxyModel::setShowAll(bool show_all)\n{\n if (show_all_ == show_all)\n return;\n\n show_all_ = show_all;\n invalidateFilter();\n}\n\nbool SortFilterProxyModel::filterAcceptsRow(int source_row, const QModelIndex& source_parent) const\n{\n CollisionLinearModel* m = qobject_cast<CollisionLinearModel*>(sourceModel());\n if (!(show_all_ || m->reason(source_row) <= moveit_setup_assistant::ALWAYS ||\n m->data(m->index(source_row, 2), Qt::CheckStateRole) == Qt::Checked))\n return false; \/\/ not accepted due to check state\n\n const QRegExp regexp = this->filterRegExp();\n if (regexp.isEmpty())\n return true;\n\n return m->data(m->index(source_row, 0, source_parent), Qt::DisplayRole).toString().contains(regexp) ||\n m->data(m->index(source_row, 1, source_parent), Qt::DisplayRole).toString().contains(regexp);\n}\n\n\/\/ define a fallback comparison operator for QVariants\n#if (QT_VERSION < QT_VERSION_CHECK(5, 0, 0))\nnamespace {\nbool operator<(const QVariant& left, const QVariant& right) {\n if (left.userType() == QVariant::Type::Int)\n return left.toInt() < right.toInt();\n else\n return left.toString() < right.toString();\n}\n}\n#endif\n\nbool SortFilterProxyModel::lessThan(const QModelIndex& src_left, const QModelIndex& src_right) const\n{\n int row_left = src_left.row();\n int row_right = src_right.row();\n QAbstractItemModel* m = sourceModel();\n\n for (int i = 0, end = sort_columns_.size(); i < end && sort_columns_[i] >= 0; ++i)\n {\n int sc = sort_columns_[i];\n int role = sc == 2 ? Qt::CheckStateRole : Qt::DisplayRole;\n QVariant value_left = m->data(m->index(row_left, sc), role);\n QVariant value_right = m->data(m->index(row_right, sc), role);\n\n if (value_left == value_right)\n continue;\n\n bool smaller = (value_left < value_right);\n if (sort_orders_[i] == Qt::DescendingOrder)\n smaller = !smaller;\n return smaller;\n }\n return false;\n}\n\nvoid SortFilterProxyModel::sort(int column, Qt::SortOrder order)\n{\n beginResetModel();\n if (column < 0)\n initSorting();\n else\n {\n \/\/ remember sorting history\n int prev_idx = sort_columns_.indexOf(column);\n if (prev_idx < 0)\n prev_idx = sort_columns_.size() - 1;\n \/\/ remove old entries\n sort_columns_.takeAt(prev_idx);\n sort_orders_.remove(prev_idx);\n \/\/ add new entries at front\n sort_columns_.insert(0, column);\n sort_orders_.insert(0, order);\n }\n QSortFilterProxyModel::sort(column, Qt::AscendingOrder);\n endResetModel();\n}\n<|endoftext|>"} {"text":"<commit_before><commit_msg>INTEGRATION: CWS changefileheader (1.20.12); FILE MERGED 2008\/04\/01 15:11:00 thb 1.20.12.2: #i85898# Stripping all external header guards 2008\/03\/31 07:23:37 rt 1.20.12.1: #i87441# Change license header to LPGL v3.<commit_after><|endoftext|>"} {"text":"<commit_before>#include \"MetaImageStreamer.hpp\"\n#include \"MetaImageImporter.hpp\"\n#include \"DeviceManager.hpp\"\n#include \"Exception.hpp\"\nusing namespace fast;\n\n\/**\n * Dummy function to get into the class again\n *\/\nvoid stubStreamThread(MetaImageStreamer * streamer) {\n streamer->producerStream();\n}\n\nDynamicImage::pointer MetaImageStreamer::getOutput() {\n if(mOutput.isValid()) {\n mOutput->setParent(mPtr.lock());\n\n DynamicImage::pointer newSmartPtr;\n newSmartPtr.swap(mOutput);\n\n return newSmartPtr;\n } else {\n return mOutput2.lock();\n }\n}\n\nMetaImageStreamer::MetaImageStreamer() {\n mOutput = DynamicImage::New();\n mOutput2 = mOutput;\n mStreamIsStarted = false;\n mIsModified = true;\n thread = NULL;\n mFirstFrameIsInserted = false;\n mDevice = DeviceManager::getInstance().getDefaultComputationDevice();\n}\n\n\ninline void MetaImageStreamer::execute() {\n if(!mStreamIsStarted) {\n mStreamIsStarted = true;\n thread = new boost::thread(&stubStreamThread, this);\n }\n\n \/\/ Wait here for first frame\n \/\/ TODO use condition variable instead\n while(!mFirstFrameIsInserted);\n}\n\nvoid MetaImageStreamer::setFilenameFormat(std::string str) {\n mFilenameFormat = str;\n}\n\nvoid MetaImageStreamer::setDevice(ExecutionDevice::pointer device) {\n mDevice = device;\n}\n\ninline std::string intToString(int number) {\n std::stringstream ss;\/\/create a stringstream\n ss << number;\/\/add number to the stream\n return ss.str();\/\/return a string with the contents of the stream\n}\n\nvoid MetaImageStreamer::producerStream() {\n int i = 0;\n while(true) {\n std::string filename = mFilenameFormat;\n filename.replace(\n filename.find(\"#\"),\n 1,\n intToString(i));\n try {\n MetaImageImporter::pointer importer = MetaImageImporter::New();\n importer->setFilename(filename);\n importer->setDevice(mDevice);\n Image::pointer image = importer->getOutput();\n image->update();\n DynamicImage::pointer ptr = mOutput2.lock();\n if(ptr.isValid()) {\n ptr->addFrame(image);\n mFirstFrameIsInserted = true;\n } else {\n std::cout << \"DynamicImage object destroyed, stream can stop.\" << std::endl;\n break;\n }\n i++;\n } catch(FileNotFoundException &e) {\n if(i > 0) {\n std::cout << \"Reached end of stream\" << std::endl;\n \/\/ Reached end of stream\n break;\n } else {\n throw e;\n }\n }\n }\n}\n\nMetaImageStreamer::~MetaImageStreamer() {\n std::cout << \"Joining the thread\" << std::endl;\n \/\/ TODO stop thread as well\n thread->join();\n delete thread;\n}\n<commit_msg>copy the streaming mode to the output dynamic image in MetaImageStreamer<commit_after>#include \"MetaImageStreamer.hpp\"\n#include \"MetaImageImporter.hpp\"\n#include \"DeviceManager.hpp\"\n#include \"Exception.hpp\"\nusing namespace fast;\n\n\/**\n * Dummy function to get into the class again\n *\/\nvoid stubStreamThread(MetaImageStreamer * streamer) {\n streamer->producerStream();\n}\n\nDynamicImage::pointer MetaImageStreamer::getOutput() {\n if(mOutput.isValid()) {\n mOutput->setParent(mPtr.lock());\n mOutput->setStreamingMode(this->getStreamingMode());\n\n DynamicImage::pointer newSmartPtr;\n newSmartPtr.swap(mOutput);\n\n return newSmartPtr;\n } else {\n return mOutput2.lock();\n }\n}\n\nMetaImageStreamer::MetaImageStreamer() {\n mOutput = DynamicImage::New();\n mOutput2 = mOutput;\n mStreamIsStarted = false;\n mIsModified = true;\n thread = NULL;\n mFirstFrameIsInserted = false;\n mDevice = DeviceManager::getInstance().getDefaultComputationDevice();\n}\n\n\ninline void MetaImageStreamer::execute() {\n if(!mStreamIsStarted) {\n mStreamIsStarted = true;\n thread = new boost::thread(&stubStreamThread, this);\n }\n\n \/\/ Wait here for first frame\n \/\/ TODO use condition variable instead\n while(!mFirstFrameIsInserted);\n}\n\nvoid MetaImageStreamer::setFilenameFormat(std::string str) {\n mFilenameFormat = str;\n}\n\nvoid MetaImageStreamer::setDevice(ExecutionDevice::pointer device) {\n mDevice = device;\n}\n\ninline std::string intToString(int number) {\n std::stringstream ss;\/\/create a stringstream\n ss << number;\/\/add number to the stream\n return ss.str();\/\/return a string with the contents of the stream\n}\n\nvoid MetaImageStreamer::producerStream() {\n int i = 0;\n while(true) {\n std::string filename = mFilenameFormat;\n filename.replace(\n filename.find(\"#\"),\n 1,\n intToString(i));\n try {\n MetaImageImporter::pointer importer = MetaImageImporter::New();\n importer->setFilename(filename);\n importer->setDevice(mDevice);\n Image::pointer image = importer->getOutput();\n image->update();\n DynamicImage::pointer ptr = mOutput2.lock();\n ptr->setStreamingMode(this->getStreamingMode());\n if(ptr.isValid()) {\n ptr->addFrame(image);\n mFirstFrameIsInserted = true;\n } else {\n std::cout << \"DynamicImage object destroyed, stream can stop.\" << std::endl;\n break;\n }\n i++;\n } catch(FileNotFoundException &e) {\n if(i > 0) {\n std::cout << \"Reached end of stream\" << std::endl;\n \/\/ Reached end of stream\n break;\n } else {\n throw e;\n }\n }\n }\n}\n\nMetaImageStreamer::~MetaImageStreamer() {\n std::cout << \"Joining the thread\" << std::endl;\n \/\/ TODO stop thread as well\n thread->join();\n delete thread;\n}\n<|endoftext|>"} {"text":"<commit_before>#include <boost\/scoped_array.hpp>\r\n#include <stdio.h>\r\n#include \"TextureManager.h\"\r\n#include \"Exceptions.h\"\r\n\r\nnamespace typing\r\n{\r\n \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\r\n \/\/ Texture\r\n \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\r\n\r\n void Texture::Load(const std::string& textureName)\r\n {\r\n FILE *textureFile = fopen(textureName.c_str(), \"rb\");\r\n\r\n if (!textureFile)\r\n {\r\n throw FileNotFoundException(textureName);\r\n }\r\n\r\n unsigned char expectedHeader[12] = { 0,0,2,0,0,0,0,0,0,0,0,0 };\r\n unsigned char header[12];\r\n if (fread(header, sizeof(unsigned char), sizeof(header), textureFile) != sizeof(header) ||\r\n memcmp(header, expectedHeader, sizeof(expectedHeader)))\r\n {\r\n fclose(textureFile);\r\n throw FileCorruptException(textureName);\r\n }\r\n\r\n unsigned char info[6];\r\n if (fread(info, sizeof(unsigned char), sizeof(info), textureFile) != sizeof(info))\r\n {\r\n fclose(textureFile);\r\n throw FileCorruptException(textureName);\r\n }\r\n\r\n unsigned int width = info[1] * 256 + info[0];\r\n unsigned int height = info[3] * 256 + info[2];\r\n unsigned int bpp = info[4];\r\n\r\n if (width == 0 || height == 0 || (bpp != 24 && bpp != 32))\r\n {\r\n fclose(textureFile);\r\n throw FileCorruptException(textureName);\r\n }\r\n unsigned int size = width * height * (bpp \/ 8);\r\n\r\n boost::scoped_array<unsigned char> data(new unsigned char[size]);\r\n if (!data.get())\r\n {\r\n fclose(textureFile);\r\n throw MemoryAllocationError(__FUNCTION__);\r\n }\r\n\r\n if (fread(data.get(), 1, size, textureFile) != size)\r\n {\r\n fclose(textureFile);\r\n throw FileCorruptException(textureName);\r\n }\r\n\r\n unsigned char temp;\r\n for (unsigned int i = 0; i < size; i += (bpp \/ 8))\r\n {\r\n temp = data[i];\r\n data[i] = data[i + 2];\r\n data[i + 2] = temp;\r\n }\r\n\r\n fclose(textureFile);\r\n\r\n glGenTextures(1, &m_id);\r\n glBindTexture(GL_TEXTURE_2D, m_id);\r\n glTexParameteri(GL_TEXTURE_2D, GL_TEXTURE_MIN_FILTER, GL_LINEAR);\r\n glTexParameteri(GL_TEXTURE_2D, GL_TEXTURE_MAG_FILTER, GL_LINEAR_MIPMAP_LINEAR);\r\n glTexParameteri(GL_TEXTURE_2D, GL_TEXTURE_WRAP_S, GL_REPEAT);\r\n glTexParameteri(GL_TEXTURE_2D, GL_TEXTURE_WRAP_T, GL_REPEAT);\r\n glTexParameteri(GL_TEXTURE_2D, GL_GENERATE_MIPMAP, GL_TRUE);\r\n glTexImage2D(GL_TEXTURE_2D, 0, GL_RGBA8, width, height, 0, GL_BGRA, GL_UNSIGNED_BYTE, data.get());\r\n }\r\n\r\n void Texture::Bind() const\r\n {\r\n glBindTexture(GL_TEXTURE_2D, m_id);\r\n }\r\n\r\n\r\n \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\r\n \/\/ TextureManager\r\n \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\r\n\r\n std::auto_ptr<TextureManager> TextureManager::m_singleton(new TextureManager);\r\n TextureManager& TextureManager::GetTextureManager()\r\n {\r\n return *(m_singleton.get());\r\n }\r\n\r\n void TextureManager::Add(const std::string& textureName)\r\n {\r\n if (m_textureMap.find(textureName) == m_textureMap.end())\r\n {\r\n TexturePtr texture(new Texture());\r\n texture->Load(textureName);\r\n m_textureMap[textureName] = texture;\r\n }\r\n }\r\n\r\n const Texture& TextureManager::Get(const std::string& textureName) const\r\n {\r\n TextureMap::const_iterator iter = m_textureMap.find(textureName);\r\n if (iter == m_textureMap.end())\r\n {\r\n throw MediaNotLoadedException(textureName);\r\n }\r\n else\r\n {\r\n return *(iter->second);\r\n }\r\n }\r\n\r\n void TextureManager::Bind(const std::string& textureName) const\r\n {\r\n Get(textureName).Bind();\r\n }\r\n}\r\n<commit_msg>Pass correct pixel formats to glTexture2D. Fixes #6<commit_after>#include <boost\/scoped_array.hpp>\r\n#include <stdio.h>\r\n#include \"TextureManager.h\"\r\n#include \"Exceptions.h\"\r\n\r\nnamespace typing\r\n{\r\n \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\r\n \/\/ Texture\r\n \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\r\n\r\n void Texture::Load(const std::string& textureName)\r\n {\r\n FILE *textureFile = fopen(textureName.c_str(), \"rb\");\r\n\r\n if (!textureFile)\r\n {\r\n throw FileNotFoundException(textureName);\r\n }\r\n\r\n unsigned char expectedHeader[12] = { 0,0,2,0,0,0,0,0,0,0,0,0 };\r\n unsigned char header[12];\r\n if (fread(header, sizeof(unsigned char), sizeof(header), textureFile) != sizeof(header) ||\r\n memcmp(header, expectedHeader, sizeof(expectedHeader)))\r\n {\r\n fclose(textureFile);\r\n throw FileCorruptException(textureName);\r\n }\r\n\r\n unsigned char info[6];\r\n if (fread(info, sizeof(unsigned char), sizeof(info), textureFile) != sizeof(info))\r\n {\r\n fclose(textureFile);\r\n throw FileCorruptException(textureName);\r\n }\r\n\r\n unsigned int width = info[1] * 256 + info[0];\r\n unsigned int height = info[3] * 256 + info[2];\r\n unsigned int bpp = info[4];\r\n\r\n if (width == 0 || height == 0 || (bpp != 24 && bpp != 32))\r\n {\r\n fclose(textureFile);\r\n throw FileCorruptException(textureName);\r\n }\r\n unsigned int size = width * height * (bpp \/ 8);\r\n\r\n boost::scoped_array<unsigned char> data(new unsigned char[size]);\r\n if (!data.get())\r\n {\r\n fclose(textureFile);\r\n throw MemoryAllocationError(__FUNCTION__);\r\n }\r\n\r\n if (fread(data.get(), 1, size, textureFile) != size)\r\n {\r\n fclose(textureFile);\r\n throw FileCorruptException(textureName);\r\n }\r\n\r\n unsigned char temp;\r\n for (unsigned int i = 0; i < size; i += (bpp \/ 8))\r\n {\r\n temp = data[i];\r\n data[i] = data[i + 2];\r\n data[i + 2] = temp;\r\n }\r\n\r\n fclose(textureFile);\r\n\r\n glGenTextures(1, &m_id);\r\n glBindTexture(GL_TEXTURE_2D, m_id);\r\n glTexParameteri(GL_TEXTURE_2D, GL_TEXTURE_MIN_FILTER, GL_LINEAR);\r\n glTexParameteri(GL_TEXTURE_2D, GL_TEXTURE_MAG_FILTER, GL_LINEAR_MIPMAP_LINEAR);\r\n glTexParameteri(GL_TEXTURE_2D, GL_TEXTURE_WRAP_S, GL_REPEAT);\r\n glTexParameteri(GL_TEXTURE_2D, GL_TEXTURE_WRAP_T, GL_REPEAT);\r\n glTexParameteri(GL_TEXTURE_2D, GL_GENERATE_MIPMAP, GL_TRUE);\r\n\r\n glPixelStorei(GL_UNPACK_ROW_LENGTH, width);\r\n glPixelStorei(GL_UNPACK_ALIGNMENT, bpp == 32 ? 2 : 1);\r\n glTexImage2D(GL_TEXTURE_2D, 0,\r\n bpp == 32 ? GL_RGBA8 : GL_RGB8,\r\n width, height, 0,\r\n bpp == 32 ? GL_BGRA : GL_BGR,\r\n GL_UNSIGNED_BYTE, data.get());\r\n }\r\n\r\n void Texture::Bind() const\r\n {\r\n glBindTexture(GL_TEXTURE_2D, m_id);\r\n }\r\n\r\n\r\n \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\r\n \/\/ TextureManager\r\n \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\r\n\r\n std::auto_ptr<TextureManager> TextureManager::m_singleton(new TextureManager);\r\n TextureManager& TextureManager::GetTextureManager()\r\n {\r\n return *(m_singleton.get());\r\n }\r\n\r\n void TextureManager::Add(const std::string& textureName)\r\n {\r\n if (m_textureMap.find(textureName) == m_textureMap.end())\r\n {\r\n TexturePtr texture(new Texture());\r\n texture->Load(textureName);\r\n m_textureMap[textureName] = texture;\r\n }\r\n }\r\n\r\n const Texture& TextureManager::Get(const std::string& textureName) const\r\n {\r\n TextureMap::const_iterator iter = m_textureMap.find(textureName);\r\n if (iter == m_textureMap.end())\r\n {\r\n throw MediaNotLoadedException(textureName);\r\n }\r\n else\r\n {\r\n return *(iter->second);\r\n }\r\n }\r\n\r\n void TextureManager::Bind(const std::string& textureName) const\r\n {\r\n Get(textureName).Bind();\r\n }\r\n}\r\n<|endoftext|>"} {"text":"<commit_before>\/*---------------------------------------------------------------------------*\\\n * OpenSG *\n * *\n * *\n * Copyright (C) 2007 by the OpenSG Forum *\n * *\n * www.opensg.org *\n * *\n * contact: dirk@opensg.org, gerrit.voss@vossg.org, jbehr@zgdv.de *\n * *\n\\*---------------------------------------------------------------------------*\/\n\/*---------------------------------------------------------------------------*\\\n * License *\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 *\n * by the Free Software Foundation, version 2. *\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 * 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., 675 Mass Ave, Cambridge, MA 02139, USA. *\n * *\n\\*---------------------------------------------------------------------------*\/\n\/*---------------------------------------------------------------------------*\\\n * Changes *\n * *\n * *\n * *\n * *\n * *\n * *\n\\*---------------------------------------------------------------------------*\/\n\n#include \"OSGOSBImageElement.h\"\n\n#include \"OSGOSBRootElement.h\"\n#include \"OSGImage.h\"\n#include \"OSGImageFileHandler.h\"\n\nOSG_USING_NAMESPACE\n\n\/*-------------------------------------------------------------------------*\/\n\/* OSBImageElement *\/\n\/*-------------------------------------------------------------------------*\/\n\n\/*-------------------------------------------------------------------------*\/\n\/* Static members *\/\n\nOSBElementRegistrationHelper<OSBImageElement>\n OSBImageElement::_regHelper =\n OSBElementRegistrationHelper<OSBImageElement>(\"Image\");\n\nconst UInt8 OSBImageElement::FlagPixelDataCompressedMask;\nconst UInt8 OSBImageElement::FlagPixelDataCompressed;\nconst UInt8 OSBImageElement::FlagPixelDataOutOfLineMask;\nconst UInt8 OSBImageElement::FlagPixelDataOutOfLine;\n\n\/*-------------------------------------------------------------------------*\/\n\/* Constructor *\/\n\nOSBImageElement::OSBImageElement(OSBRootElement *root)\n : Inherited (root, OSGOSBHeaderVersion200),\n _hasJPEGSupport(false ),\n _version (OSGOSBHeaderVersion200 )\n{\n}\n\n\/*-------------------------------------------------------------------------*\/\n\/* Destructor *\/\n\nOSBImageElement::~OSBImageElement(void)\n{\n}\n\n\/*-------------------------------------------------------------------------*\/\n\/* Reading *\/\n\nvoid\nOSBImageElement::read(const std::string &typeName)\n{\n FDEBUG((\"OSBImageElement::read [%s]\\n\", typeName.c_str()));\n\n const OSBRootElement *root = getRoot();\n BinaryReadHandler *rh = editRoot()->getReadHandler();\n UInt8 fcPtrType;\n\n if(root->getHeaderVersion() >= OSGOSBHeaderVersion200)\n {\n if(root->getHeaderVersion() > OSGOSBHeaderVersion200)\n {\n FINFO((\"OSBImageElement::read: \"\n \"Unknown version, trying to process as latest.\\n\"));\n }\n\n rh->getValue(fcPtrType);\n }\n\n ImageUnrecPtr img = Image::create();\n setContainer(img);\n\n rh->getValue(_version);\n\n if(_version >= OSGOSBHeaderVersion200)\n {\n UInt8 flags;\n rh->getValue(flags);\n\n if(flags & FlagPixelDataCompressedMask)\n {\n std::string endMarker = \"'pixel'\";\n std::string fieldName = readFields(\"\", endMarker);\n\n if(fieldName == \"pixel\")\n {\n readCompressedPixelData();\n }\n }\n else if(flags & FlagPixelDataOutOfLineMask)\n {\n readFields(\"\", \"\");\n\n \/\/ read out-of-line image data\n const std::string &fileName = img->getName();\n img = ImageFileHandler::the()->read(fileName.c_str());\n setContainer(img);\n }\n }\n else if(_version >= OSGOSBHeaderVersion100)\n {\n std::string endMarker = \"'cpixel'\";\n std::string fieldName = readFields(\"\", endMarker);\n\n \/\/ read compressed pixel data - should be the last field\n if(fieldName == \"cpixel\")\n {\n readCompressedPixelData();\n }\n\n \/\/ read any remaining fields - should be none, but this is safe to do.\n readFieldsContinue(fieldName, \"\", \"\");\n\n \/\/ read out-of-line image data\n if(img->getMFPixel()->empty())\n {\n const std::string &fileName = img->getName();\n img = ImageFileHandler::the()->read(fileName.c_str());\n setContainer(img);\n }\n }\n}\n\nvoid\nOSBImageElement::postRead(void)\n{\n \/\/ nothing to do\n}\n\n\/*-------------------------------------------------------------------------*\/\n\/* Writing *\/\n\nvoid\nOSBImageElement::preWrite(FieldContainer * const fc)\n{\n FDEBUG((\"OSBImageElement::preWrite\\n\"));\n\n preWriteFieldContainer(fc, \"\");\n}\n\nvoid\nOSBImageElement::write(void)\n{\n FDEBUG((\"OSBImageElement::write\\n\"));\n\n if(getContainer() == NULL)\n {\n FWARNING((\"OSBImageElement::write: Attempt to write NULL.\\n\"));\n return;\n }\n\n Image *img = dynamic_cast<Image *>(getContainer());\n BinaryWriteHandler *wh = editRoot()->getWriteHandler();\n const OSBRootElement *root = getRoot();\n UInt8 flags = 0;\n\n wh->putValue(getFCPtrType(getContainer()));\n wh->putValue(getVersion() );\n\n std::string excludeFields = \"\";\n bool compressTextures = false;\n\n if(getRoot()->getOptions().inlineTextures() == false)\n {\n \/\/ only write \"name\" field\n flags |= FlagPixelDataOutOfLine;\n excludeFields.append(\"'dimension' 'width' 'height' 'depth' 'bpp' \"\n \"'mipMapCount' 'frameCount' 'frameDelay' \"\n \"'pixelFormat' 'pixel' 'frameSize' \" );\n }\n else\n {\n if(_hasJPEGSupport && root->getOptions().compressTextures() &&\n (img->getDataType() == Image::OSG_UINT8_IMAGEDATA) &&\n ((img->getBpp() == 1) || (img->getBpp() == 3)) )\n {\n compressTextures = true;\n flags |= FlagPixelDataCompressed;\n excludeFields.append(\"'pixel'\");\n }\n }\n\n \/\/ write flags\n wh->putValue(flags);\n\n \/\/ write all fields that do not require special handling\n writeFields(excludeFields, false);\n\n if(compressTextures)\n writeCompressedPixelData();\n\n writeEndMarker();\n}\n\n\/*-------------------------------------------------------------------------*\/\n\/* Reading Helper Functions *\/\n\nvoid\nOSBImageElement::readCompressedPixelData(void)\n{\n BinaryReadHandler *rh = editRoot()->getReadHandler();\n Image *img = dynamic_cast<Image *>(getContainer());\n\n std::string fieldTypeName;\n UInt32 fieldSize;\n UInt32 byteSize;\n std::vector<UInt8> buffer;\n\n rh->getValue(fieldTypeName);\n rh->getValue(fieldSize );\n\n if(!_hasJPEGSupport)\n {\n FWARNING((\"OSBImageElement::readCompressedPixelData: \"\n \"JPEG Support not available, skipping compressed \"\n \"texture data.\\n\"));\n rh->skip(fieldSize);\n return;\n }\n\n rh->getValue(byteSize);\n\n \/\/ allocate and fill buffer\n buffer.resize(byteSize);\n rh->getValues(&buffer.front(), byteSize);\n\n img->restore(&buffer.front(), byteSize);\n}\n\n\/*-------------------------------------------------------------------------*\/\n\/* Writing Helper Functions *\/\n\nvoid\nOSBImageElement::writeCompressedPixelData(void)\n{\n \/\/ FIXME Inline Images are disabled right now. A more recent versin of\n \/\/ the ImageFileHandler from CVS needs to be ported to OpenSG 2.\n\n const OSBRootElement *root = getRoot();\n BinaryWriteHandler *wh = editRoot()->getWriteHandler();\n\n Image *img = dynamic_cast<Image *>(getContainer());\n std::string imageType = root->getOptions().texturesImageType();\n\/\/ std::string imageType = \"jpeg\";\n\n std::vector<UInt8> buffer;\n UInt32 factor = 1;\n\n \/\/ JPEG always uses RGB, so single channel images need additional memory\n if((imageType == \"jpeg\") && (img->getBpp() == 1))\n factor = 3;\n\n \/\/ some extra space is needed for the image header\n UInt32 bufferSize =\n ImageFileHandler::the()->getDefaultType()->maxBufferSize(img) * factor +\n 16384;\n\n buffer.resize(bufferSize);\n UInt64 compressedSize = img->store(imageType.c_str(), &buffer.front());\n\/\/ UInt64 compressedSize = 0;\n\n UInt32 byteSize = static_cast<UInt32>(compressedSize);\n UInt32 fieldSize = sizeof(UInt32) + sizeof(UInt8) * byteSize;\n\n wh->putValue (fieldSize );\n wh->putValue (byteSize );\n wh->putValues(&buffer.front(), byteSize);\n}\n<commit_msg><commit_after>\/*---------------------------------------------------------------------------*\\\n * OpenSG *\n * *\n * *\n * Copyright (C) 2007 by the OpenSG Forum *\n * *\n * www.opensg.org *\n * *\n * contact: dirk@opensg.org, gerrit.voss@vossg.org, jbehr@zgdv.de *\n * *\n\\*---------------------------------------------------------------------------*\/\n\/*---------------------------------------------------------------------------*\\\n * License *\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 *\n * by the Free Software Foundation, version 2. *\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 * 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., 675 Mass Ave, Cambridge, MA 02139, USA. *\n * *\n\\*---------------------------------------------------------------------------*\/\n\/*---------------------------------------------------------------------------*\\\n * Changes *\n * *\n * *\n * *\n * *\n * *\n * *\n\\*---------------------------------------------------------------------------*\/\n\n#include \"OSGOSBImageElement.h\"\n\n#include \"OSGOSBRootElement.h\"\n#include \"OSGImage.h\"\n#include \"OSGImageFileHandler.h\"\n\nOSG_USING_NAMESPACE\n\n\/*-------------------------------------------------------------------------*\/\n\/* OSBImageElement *\/\n\/*-------------------------------------------------------------------------*\/\n\n\/*-------------------------------------------------------------------------*\/\n\/* Static members *\/\n\nOSBElementRegistrationHelper<OSBImageElement>\n OSBImageElement::_regHelper =\n OSBElementRegistrationHelper<OSBImageElement>(\"Image\");\n\nconst UInt8 OSBImageElement::FlagPixelDataCompressedMask;\nconst UInt8 OSBImageElement::FlagPixelDataCompressed;\nconst UInt8 OSBImageElement::FlagPixelDataOutOfLineMask;\nconst UInt8 OSBImageElement::FlagPixelDataOutOfLine;\n\n\/*-------------------------------------------------------------------------*\/\n\/* Constructor *\/\n\nOSBImageElement::OSBImageElement(OSBRootElement *root)\n : Inherited (root, OSGOSBHeaderVersion200),\n _hasJPEGSupport(false ),\n _version (OSGOSBHeaderVersion200 )\n{\n}\n\n\/*-------------------------------------------------------------------------*\/\n\/* Destructor *\/\n\nOSBImageElement::~OSBImageElement(void)\n{\n}\n\n\/*-------------------------------------------------------------------------*\/\n\/* Reading *\/\n\nvoid\nOSBImageElement::read(const std::string &typeName)\n{\n FDEBUG((\"OSBImageElement::read [%s]\\n\", typeName.c_str()));\n\n const OSBRootElement *root = getRoot();\n BinaryReadHandler *rh = editRoot()->getReadHandler();\n UInt8 fcPtrType;\n\n if(root->getHeaderVersion() >= OSGOSBHeaderVersion200)\n {\n if(root->getHeaderVersion() > OSGOSBHeaderVersion200)\n {\n FINFO((\"OSBImageElement::read: \"\n \"Unknown version, trying to process as latest.\\n\"));\n }\n\n rh->getValue(fcPtrType);\n }\n\n ImageUnrecPtr img = Image::create();\n setContainer(img);\n\n rh->getValue(_version);\n\n if(_version >= OSGOSBHeaderVersion200)\n {\n UInt8 flags;\n rh->getValue(flags);\n\n if(flags & FlagPixelDataCompressedMask)\n {\n \/\/ compressed inline texture\n std::string endMarker = \"'pixel'\";\n std::string fieldName = readFields(\"\", endMarker);\n\n if(fieldName == \"pixel\")\n {\n readCompressedPixelData();\n }\n }\n else\n {\n \/\/ read fields stored in file\n readFields(\"\", \"\");\n \n if(flags & FlagPixelDataOutOfLineMask)\n {\n \/\/ read out-of-line image data\n const std::string &fileName = img->getName();\n img = ImageFileHandler::the()->read(fileName.c_str());\n setContainer(img);\n }\n }\n }\n else if(_version >= OSGOSBHeaderVersion100)\n {\n std::string endMarker = \"'cpixel'\";\n std::string fieldName = readFields(\"\", endMarker);\n\n \/\/ read compressed pixel data - should be the last field\n if(fieldName == \"cpixel\")\n {\n readCompressedPixelData();\n }\n\n \/\/ read any remaining fields - should be none, but this is safe to do.\n readFieldsContinue(fieldName, \"\", \"\");\n\n \/\/ read out-of-line image data\n if(img->getMFPixel()->empty())\n {\n const std::string &fileName = img->getName();\n img = ImageFileHandler::the()->read(fileName.c_str());\n setContainer(img);\n }\n }\n}\n\nvoid\nOSBImageElement::postRead(void)\n{\n \/\/ nothing to do\n}\n\n\/*-------------------------------------------------------------------------*\/\n\/* Writing *\/\n\nvoid\nOSBImageElement::preWrite(FieldContainer * const fc)\n{\n FDEBUG((\"OSBImageElement::preWrite\\n\"));\n\n preWriteFieldContainer(fc, \"\");\n}\n\nvoid\nOSBImageElement::write(void)\n{\n FDEBUG((\"OSBImageElement::write\\n\"));\n\n if(getContainer() == NULL)\n {\n FWARNING((\"OSBImageElement::write: Attempt to write NULL.\\n\"));\n return;\n }\n\n Image *img = dynamic_cast<Image *>(getContainer());\n BinaryWriteHandler *wh = editRoot()->getWriteHandler();\n const OSBRootElement *root = getRoot();\n UInt8 flags = 0;\n\n wh->putValue(getFCPtrType(getContainer()));\n wh->putValue(getVersion() );\n\n std::string excludeFields = \"\";\n bool compressTextures = false;\n\n if(getRoot()->getOptions().inlineTextures() == false)\n {\n \/\/ only write \"name\" field\n flags |= FlagPixelDataOutOfLine;\n excludeFields.append(\"'dimension' 'width' 'height' 'depth' 'bpp' \"\n \"'mipMapCount' 'frameCount' 'frameDelay' \"\n \"'pixelFormat' 'pixel' 'frameSize' \" );\n }\n else\n {\n if(_hasJPEGSupport && root->getOptions().compressTextures() &&\n (img->getDataType() == Image::OSG_UINT8_IMAGEDATA) &&\n ((img->getBpp() == 1) || (img->getBpp() == 3)) )\n {\n compressTextures = true;\n flags |= FlagPixelDataCompressed;\n excludeFields.append(\"'pixel'\");\n }\n }\n\n \/\/ write flags\n wh->putValue(flags);\n\n \/\/ write all fields that do not require special handling\n writeFields(excludeFields, false);\n\n if(compressTextures)\n writeCompressedPixelData();\n\n writeEndMarker();\n}\n\n\/*-------------------------------------------------------------------------*\/\n\/* Reading Helper Functions *\/\n\nvoid\nOSBImageElement::readCompressedPixelData(void)\n{\n BinaryReadHandler *rh = editRoot()->getReadHandler();\n Image *img = dynamic_cast<Image *>(getContainer());\n\n std::string fieldTypeName;\n UInt32 fieldSize;\n UInt32 byteSize;\n std::vector<UInt8> buffer;\n\n rh->getValue(fieldTypeName);\n rh->getValue(fieldSize );\n\n if(!_hasJPEGSupport)\n {\n FWARNING((\"OSBImageElement::readCompressedPixelData: \"\n \"JPEG Support not available, skipping compressed \"\n \"texture data.\\n\"));\n rh->skip(fieldSize);\n return;\n }\n\n rh->getValue(byteSize);\n\n \/\/ allocate and fill buffer\n buffer.resize(byteSize);\n rh->getValues(&buffer.front(), byteSize);\n\n img->restore(&buffer.front(), byteSize);\n}\n\n\/*-------------------------------------------------------------------------*\/\n\/* Writing Helper Functions *\/\n\nvoid\nOSBImageElement::writeCompressedPixelData(void)\n{\n \/\/ FIXME Inline Images are disabled right now. A more recent versin of\n \/\/ the ImageFileHandler from CVS needs to be ported to OpenSG 2.\n\n const OSBRootElement *root = getRoot();\n BinaryWriteHandler *wh = editRoot()->getWriteHandler();\n\n Image *img = dynamic_cast<Image *>(getContainer());\n std::string imageType = root->getOptions().texturesImageType();\n\/\/ std::string imageType = \"jpeg\";\n\n std::vector<UInt8> buffer;\n UInt32 factor = 1;\n\n \/\/ JPEG always uses RGB, so single channel images need additional memory\n if((imageType == \"jpeg\") && (img->getBpp() == 1))\n factor = 3;\n\n \/\/ some extra space is needed for the image header\n UInt32 bufferSize =\n ImageFileHandler::the()->getDefaultType()->maxBufferSize(img) * factor +\n 16384;\n\n buffer.resize(bufferSize);\n UInt64 compressedSize = img->store(imageType.c_str(), &buffer.front());\n\/\/ UInt64 compressedSize = 0;\n\n UInt32 byteSize = static_cast<UInt32>(compressedSize);\n UInt32 fieldSize = sizeof(UInt32) + sizeof(UInt8) * byteSize;\n\n wh->putValue (fieldSize );\n wh->putValue (byteSize );\n wh->putValues(&buffer.front(), byteSize);\n}\n<|endoftext|>"} {"text":"<commit_before>\/*\n * Copyright (C) 2010 Google, Inc. All Rights Reserved.\n *\n * Redistribution and use in source and binary forms, with or without\n * modification, are permitted provided that the following conditions\n * are met:\n * 1. Redistributions of source code must retain the above copyright\n * notice, this list of conditions and the following disclaimer.\n * 2. Redistributions in binary form must reproduce the above copyright\n * notice, this list of conditions and the following disclaimer in the\n * documentation and\/or other materials provided with the distribution.\n *\n * THIS SOFTWARE IS PROVIDED BY APPLE INC. ``AS IS'' AND ANY\n * EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE\n * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR\n * PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL APPLE INC. OR\n * CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,\n * EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,\n * PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR\n * PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY\n * OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT\n * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE\n * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.\n *\/\n\n#include \"config.h\"\n#include \"core\/html\/parser\/HTMLParserScheduler.h\"\n\n#include \"core\/dom\/Document.h\"\n#include \"core\/html\/parser\/HTMLDocumentParser.h\"\n#include \"core\/frame\/FrameView.h\"\n\nnamespace WebCore {\n\n\/\/ parserChunkSize is used to define how many tokens the parser will\n\/\/ process before checking against parserTimeLimit and possibly yielding.\n\/\/ This is a performance optimization to prevent checking after every token.\nconst int HTMLParserScheduler::parserChunkSize = 4096;\n\n\/\/ parserTimeLimit is the seconds the parser will run in one write() call\n\/\/ before yielding. Inline <script> execution can cause it to exceed the limit.\nconst double HTMLParserScheduler::parserTimeLimit = 0.2;\n\nActiveParserSession::ActiveParserSession(Document* document)\n : m_document(document)\n{\n if (!m_document)\n return;\n m_document->incrementActiveParserCount();\n}\n\nActiveParserSession::~ActiveParserSession()\n{\n if (!m_document)\n return;\n m_document->decrementActiveParserCount();\n}\n\nPumpSession::PumpSession(unsigned& nestingLevel, Document* document)\n : NestingLevelIncrementer(nestingLevel)\n , ActiveParserSession(document)\n \/\/ Setting processedTokens to INT_MAX causes us to check for yields\n \/\/ after any token during any parse where yielding is allowed.\n \/\/ At that time we'll initialize startTime.\n , processedTokens(INT_MAX)\n , startTime(0)\n , needsYield(false)\n , didSeeScript(false)\n{\n}\n\nPumpSession::~PumpSession()\n{\n}\n\nHTMLParserScheduler::HTMLParserScheduler(HTMLDocumentParser* parser)\n : m_parser(parser)\n , m_continueNextChunkTimer(this, &HTMLParserScheduler::continueNextChunkTimerFired)\n , m_isSuspendedWithActiveTimer(false)\n{\n}\n\nHTMLParserScheduler::~HTMLParserScheduler()\n{\n m_continueNextChunkTimer.stop();\n}\n\nvoid HTMLParserScheduler::continueNextChunkTimerFired(Timer<HTMLParserScheduler>* timer)\n{\n ASSERT_UNUSED(timer, timer == &m_continueNextChunkTimer);\n \/\/ FIXME: The timer class should handle timer priorities instead of this code.\n \/\/ If a layout is scheduled, wait again to let the layout timer run first.\n \/\/ FIXME: We should fix this by reducing the max-parse-time instead of\n \/\/ artificially forcing the parser to yield agressively before first layout.\n if (m_parser->document()->shouldParserYieldAgressivelyBeforeScriptExecution()) {\n m_continueNextChunkTimer.startOneShot(0, FROM_HERE);\n return;\n }\n m_parser->resumeParsingAfterYield();\n}\n\nvoid HTMLParserScheduler::checkForYieldBeforeScript(PumpSession& session)\n{\n \/\/ If we've never painted before and a layout is pending, yield prior to running\n \/\/ scripts to give the page a chance to paint earlier.\n Document* document = m_parser->document();\n bool needsFirstPaint = document->view() && !document->view()->hasEverPainted();\n if (needsFirstPaint && document->shouldParserYieldAgressivelyBeforeScriptExecution())\n session.needsYield = true;\n session.didSeeScript = true;\n}\n\nvoid HTMLParserScheduler::scheduleForResume()\n{\n m_continueNextChunkTimer.startOneShot(0, FROM_HERE);\n}\n\n\nvoid HTMLParserScheduler::suspend()\n{\n ASSERT(!m_isSuspendedWithActiveTimer);\n if (!m_continueNextChunkTimer.isActive())\n return;\n m_isSuspendedWithActiveTimer = true;\n m_continueNextChunkTimer.stop();\n}\n\nvoid HTMLParserScheduler::resume()\n{\n ASSERT(!m_continueNextChunkTimer.isActive());\n if (!m_isSuspendedWithActiveTimer)\n return;\n m_isSuspendedWithActiveTimer = false;\n m_continueNextChunkTimer.startOneShot(0, FROM_HERE);\n}\n\n}\n<commit_msg>Remove hack in HTMLParserScheduler for deferring to layout while parsing.<commit_after>\/*\n * Copyright (C) 2010 Google, Inc. All Rights Reserved.\n *\n * Redistribution and use in source and binary forms, with or without\n * modification, are permitted provided that the following conditions\n * are met:\n * 1. Redistributions of source code must retain the above copyright\n * notice, this list of conditions and the following disclaimer.\n * 2. Redistributions in binary form must reproduce the above copyright\n * notice, this list of conditions and the following disclaimer in the\n * documentation and\/or other materials provided with the distribution.\n *\n * THIS SOFTWARE IS PROVIDED BY APPLE INC. ``AS IS'' AND ANY\n * EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE\n * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR\n * PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL APPLE INC. OR\n * CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,\n * EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,\n * PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR\n * PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY\n * OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT\n * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE\n * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.\n *\/\n\n#include \"config.h\"\n#include \"core\/html\/parser\/HTMLParserScheduler.h\"\n\n#include \"core\/dom\/Document.h\"\n#include \"core\/html\/parser\/HTMLDocumentParser.h\"\n#include \"core\/frame\/FrameView.h\"\n\nnamespace WebCore {\n\n\/\/ parserChunkSize is used to define how many tokens the parser will\n\/\/ process before checking against parserTimeLimit and possibly yielding.\n\/\/ This is a performance optimization to prevent checking after every token.\nconst int HTMLParserScheduler::parserChunkSize = 4096;\n\n\/\/ parserTimeLimit is the seconds the parser will run in one write() call\n\/\/ before yielding. Inline <script> execution can cause it to exceed the limit.\nconst double HTMLParserScheduler::parserTimeLimit = 0.2;\n\nActiveParserSession::ActiveParserSession(Document* document)\n : m_document(document)\n{\n if (!m_document)\n return;\n m_document->incrementActiveParserCount();\n}\n\nActiveParserSession::~ActiveParserSession()\n{\n if (!m_document)\n return;\n m_document->decrementActiveParserCount();\n}\n\nPumpSession::PumpSession(unsigned& nestingLevel, Document* document)\n : NestingLevelIncrementer(nestingLevel)\n , ActiveParserSession(document)\n \/\/ Setting processedTokens to INT_MAX causes us to check for yields\n \/\/ after any token during any parse where yielding is allowed.\n \/\/ At that time we'll initialize startTime.\n , processedTokens(INT_MAX)\n , startTime(0)\n , needsYield(false)\n , didSeeScript(false)\n{\n}\n\nPumpSession::~PumpSession()\n{\n}\n\nHTMLParserScheduler::HTMLParserScheduler(HTMLDocumentParser* parser)\n : m_parser(parser)\n , m_continueNextChunkTimer(this, &HTMLParserScheduler::continueNextChunkTimerFired)\n , m_isSuspendedWithActiveTimer(false)\n{\n}\n\nHTMLParserScheduler::~HTMLParserScheduler()\n{\n m_continueNextChunkTimer.stop();\n}\n\nvoid HTMLParserScheduler::continueNextChunkTimerFired(Timer<HTMLParserScheduler>* timer)\n{\n ASSERT_UNUSED(timer, timer == &m_continueNextChunkTimer);\n m_parser->resumeParsingAfterYield();\n}\n\nvoid HTMLParserScheduler::checkForYieldBeforeScript(PumpSession& session)\n{\n \/\/ If we've never painted before and a layout is pending, yield prior to running\n \/\/ scripts to give the page a chance to paint earlier.\n Document* document = m_parser->document();\n bool needsFirstPaint = document->view() && !document->view()->hasEverPainted();\n if (needsFirstPaint && document->shouldParserYieldAgressivelyBeforeScriptExecution())\n session.needsYield = true;\n session.didSeeScript = true;\n}\n\nvoid HTMLParserScheduler::scheduleForResume()\n{\n m_continueNextChunkTimer.startOneShot(0, FROM_HERE);\n}\n\nvoid HTMLParserScheduler::suspend()\n{\n ASSERT(!m_isSuspendedWithActiveTimer);\n if (!m_continueNextChunkTimer.isActive())\n return;\n m_isSuspendedWithActiveTimer = true;\n m_continueNextChunkTimer.stop();\n}\n\nvoid HTMLParserScheduler::resume()\n{\n ASSERT(!m_continueNextChunkTimer.isActive());\n if (!m_isSuspendedWithActiveTimer)\n return;\n m_isSuspendedWithActiveTimer = false;\n m_continueNextChunkTimer.startOneShot(0, FROM_HERE);\n}\n\n}\n<|endoftext|>"} {"text":"<commit_before>\/**\n * This file is part of TelepathyQt4\n *\n * @copyright Copyright (C) 2010 Collabora Ltd. <http:\/\/www.collabora.co.uk\/>\n * @license LGPL 2.1\n *\n * This library is free software; you can redistribute it and\/or\n * modify it under the terms of the GNU Lesser General Public\n * License as published by the Free Software Foundation; either\n * version 2.1 of the License, or (at your option) any later version.\n *\n * This library is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU\n * Lesser General Public License for more details.\n *\n * You should have received a copy of the GNU Lesser General Public\n * License along with this library; if not, write to the Free Software\n * Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA\n *\/\n\n\n#include <TelepathyQt4\/PendingStreamTubeConnection>\n\n#include \"TelepathyQt4\/_gen\/pending-stream-tube-connection.moc.hpp\"\n\n#include \"TelepathyQt4\/debug-internal.h\"\n\n#include <TelepathyQt4\/IncomingStreamTubeChannel>\n#include <TelepathyQt4\/PendingVariant>\n#include <TelepathyQt4\/Types>\n\nnamespace Tp\n{\n\nstruct TELEPATHY_QT4_NO_EXPORT PendingStreamTubeConnection::Private\n{\n Private(PendingStreamTubeConnection *parent);\n ~Private();\n\n \/\/ Public object\n PendingStreamTubeConnection *parent;\n\n IncomingStreamTubeChannelPtr tube;\n SocketAddressType type;\n QHostAddress hostAddress;\n quint16 port;\n QString socketPath;\n bool requiresCredentials;\n uchar credentialByte;\n};\n\nPendingStreamTubeConnection::Private::Private(PendingStreamTubeConnection *parent)\n : parent(parent),\n requiresCredentials(false),\n credentialByte(0)\n{\n\n}\n\nPendingStreamTubeConnection::Private::~Private()\n{\n\n}\n\nPendingStreamTubeConnection::PendingStreamTubeConnection(\n PendingVariant *acceptOperation,\n SocketAddressType type,\n bool requiresCredentials,\n uchar credentialByte,\n const IncomingStreamTubeChannelPtr &channel)\n : PendingOperation(channel),\n mPriv(new Private(this))\n{\n mPriv->tube = channel;\n mPriv->type = type;\n mPriv->requiresCredentials = requiresCredentials;\n mPriv->credentialByte = credentialByte;\n\n \/* keep track of channel invalidation *\/\n connect(channel.data(),\n SIGNAL(invalidated(Tp::DBusProxy*,QString,QString)),\n SLOT(onChannelInvalidated(Tp::DBusProxy*,QString,QString)));\n\n connect(acceptOperation,\n SIGNAL(finished(Tp::PendingOperation*)),\n SLOT(onAcceptFinished(Tp::PendingOperation*)));\n}\n\n\/**\n * \\class PendingStreamTubeConnection\n * \\ingroup clientchannel\n * \\headerfile TelepathyQt4\/incoming-stream-tube-channel.h <TelepathyQt4\/PendingStreamTubeConnection>\n *\n * \\brief The PendingStreamTubeConnection class represents an asynchronous\n * operation for accepting a stream tube.\n *\n * When the operation is finished, you can access the resulting device\n * through device().\n * Otherwise, you can access the bare address through either tcpAddress() or\n * localAddress().\n *\/\n\nPendingStreamTubeConnection::PendingStreamTubeConnection(\n const QString& errorName,\n const QString& errorMessage,\n const IncomingStreamTubeChannelPtr &channel)\n : PendingOperation(channel),\n mPriv(new PendingStreamTubeConnection::Private(this))\n{\n setFinishedWithError(errorName, errorMessage);\n}\n\n\/**\n * Class destructor.\n *\/\nPendingStreamTubeConnection::~PendingStreamTubeConnection()\n{\n delete mPriv;\n}\n\n\/**\n * This method returns the address type of the opened socket.\n *\n * Calling this method when the operation has not been completed or has failed, will cause it\n * to return an unmeaningful value.\n *\n * \\return The type of socket this PendingStreamTubeConnection has created\n *\n * \\note This function will return a valid value only after the operation has been\n * finished successfully.\n *\n * \\see localAddress\n * \\see tcpAddress\n *\/\nSocketAddressType PendingStreamTubeConnection::addressType() const\n{\n return mPriv->tube->addressType();\n}\n\n\/**\n * This method returns the local address of the opened socket.\n *\n * Calling this method when the operation has not been completed or has failed, will cause it\n * to return an unmeaningful value. The same will happen if the socket which has been opened has a\n * different type from SocketAddressTypeUnix or SocketAddressTypeAbstractUnix. Use #ipAddress if\n * that is the case.\n *\n * \\return The local address obtained from this PendingStreamTubeConnection as a QString,\n * if the connection has been estabilished through a SocketAddressTypeUnix or\n * a SocketAddressTypeAbstractUnix.\n *\n * \\note This function will return a valid value only after the operation has been\n * finished successfully.\n *\n * \\see addressType\n *\/\nQString PendingStreamTubeConnection::localAddress() const\n{\n return mPriv->tube->localAddress();\n}\n\n\/**\n * This method returns the IP address of the opened socket.\n *\n * Calling this method when the operation has not been completed or has failed, will cause it\n * to return an unmeaningful value. The same will happen if the socket which has been opened has a\n * different type from SocketAddressTypeIpv4 or SocketAddressTypeIPv6. Use #localAddress if\n * that is the case.\n *\n * \\return The IP address and port obtained from this PendingStreamTubeConnection as a QHostAddress,\n * if the connection has been estabilished through a SocketAddressTypeIpv4 or\n * a SocketAddressTypeIPv6.\n *\n * \\note This function will return a valid value only after the operation has been\n * finished successfully.\n *\n * \\see addressType\n *\/\nQPair<QHostAddress, quint16> PendingStreamTubeConnection::ipAddress() const\n{\n return mPriv->tube->ipAddress();\n}\n\n\/**\n * Return whether sending a credential byte once connecting to the socket is required.\n *\n * Note that if this method returns \\c true, one should send a SCM_CREDS or SCM_CREDENTIALS\n * and the credentialByte() once connected. If SCM_CREDS or SCM_CREDENTIALS cannot be sent,\n * the credentialByte() should still be sent.\n *\n * \\return \\c true if sending credentials is required, \\c false otherwise.\n * \\sa credentialByte()\n *\/\nbool PendingStreamTubeConnection::requiresCredentials() const\n{\n return mPriv->requiresCredentials;\n}\n\n\/**\n * Return the credential byte to send once connecting to the socket if requiresCredentials() is \\c\n * true.\n *\n * \\return The credential byte.\n * \\sa requiresCredentials()\n *\/\nuchar PendingStreamTubeConnection::credentialByte() const\n{\n return mPriv->credentialByte;\n}\n\nvoid PendingStreamTubeConnection::onChannelInvalidated(DBusProxy *proxy,\n const QString &errorName, const QString &errorMessage)\n{\n Q_UNUSED(proxy);\n\n if (isFinished()) {\n return;\n }\n\n setFinishedWithError(errorName, errorMessage);\n}\n\nvoid PendingStreamTubeConnection::onAcceptFinished(PendingOperation *op)\n{\n if (isFinished()) {\n return;\n }\n\n if (op->isError()) {\n setFinishedWithError(op->errorName(), op->errorMessage());\n return;\n }\n\n debug() << \"Accept tube finished successfully\";\n\n PendingVariant *pv = qobject_cast<PendingVariant *>(op);\n \/\/ Build the address\n if (mPriv->type == SocketAddressTypeIPv4) {\n SocketAddressIPv4 addr = qdbus_cast<SocketAddressIPv4>(pv->result());\n debug().nospace() << \"Got address \" << addr.address <<\n \":\" << addr.port;\n mPriv->hostAddress = QHostAddress(addr.address);\n mPriv->port = addr.port;\n } else if (mPriv->type == SocketAddressTypeIPv6) {\n SocketAddressIPv6 addr = qdbus_cast<SocketAddressIPv6>(pv->result());\n debug().nospace() << \"Got address \" << addr.address <<\n \":\" << addr.port;\n mPriv->hostAddress = QHostAddress(addr.address);\n mPriv->port = addr.port;\n } else {\n \/\/ Unix socket\n mPriv->socketPath = QLatin1String(qdbus_cast<QByteArray>(pv->result()));\n debug() << \"Got socket \" << mPriv->socketPath;\n }\n\n \/\/ It might have been already opened - check\n if (mPriv->tube->state() == TubeChannelStateOpen) {\n onTubeStateChanged(mPriv->tube->state());\n } else {\n \/\/ Wait until the tube gets opened on the other side\n connect(mPriv->tube.data(), SIGNAL(stateChanged(Tp::TubeChannelState)),\n this, SLOT(onTubeStateChanged(Tp::TubeChannelState)));\n }\n}\n\nvoid PendingStreamTubeConnection::onTubeStateChanged(TubeChannelState state)\n{\n debug() << \"Tube state changed to \" << state;\n if (state == TubeChannelStateOpen) {\n \/\/ The tube is ready, populate its properties\n if (mPriv->type == SocketAddressTypeIPv4 || mPriv->type == SocketAddressTypeIPv6) {\n mPriv->tube->setIpAddress(qMakePair<QHostAddress, quint16>(mPriv->hostAddress,\n mPriv->port));\n } else {\n \/\/ Unix socket\n mPriv->tube->setLocalAddress(mPriv->socketPath);\n }\n\n \/\/ Mark the operation as finished\n setFinished();\n } else if (state != TubeChannelStateLocalPending) {\n \/\/ Something happened\n setFinishedWithError(QLatin1String(\"Connection refused\"),\n QLatin1String(\"The connection to this tube was refused\"));\n }\n}\n\n}\n<commit_msg>PendingStreamTubeConnection: Improve debugs.<commit_after>\/**\n * This file is part of TelepathyQt4\n *\n * @copyright Copyright (C) 2010 Collabora Ltd. <http:\/\/www.collabora.co.uk\/>\n * @license LGPL 2.1\n *\n * This library is free software; you can redistribute it and\/or\n * modify it under the terms of the GNU Lesser General Public\n * License as published by the Free Software Foundation; either\n * version 2.1 of the License, or (at your option) any later version.\n *\n * This library is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU\n * Lesser General Public License for more details.\n *\n * You should have received a copy of the GNU Lesser General Public\n * License along with this library; if not, write to the Free Software\n * Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA\n *\/\n\n\n#include <TelepathyQt4\/PendingStreamTubeConnection>\n\n#include \"TelepathyQt4\/_gen\/pending-stream-tube-connection.moc.hpp\"\n\n#include \"TelepathyQt4\/debug-internal.h\"\n\n#include <TelepathyQt4\/IncomingStreamTubeChannel>\n#include <TelepathyQt4\/PendingVariant>\n#include <TelepathyQt4\/Types>\n\nnamespace Tp\n{\n\nstruct TELEPATHY_QT4_NO_EXPORT PendingStreamTubeConnection::Private\n{\n Private(PendingStreamTubeConnection *parent);\n ~Private();\n\n \/\/ Public object\n PendingStreamTubeConnection *parent;\n\n IncomingStreamTubeChannelPtr tube;\n SocketAddressType type;\n QHostAddress hostAddress;\n quint16 port;\n QString socketPath;\n bool requiresCredentials;\n uchar credentialByte;\n};\n\nPendingStreamTubeConnection::Private::Private(PendingStreamTubeConnection *parent)\n : parent(parent),\n requiresCredentials(false),\n credentialByte(0)\n{\n\n}\n\nPendingStreamTubeConnection::Private::~Private()\n{\n\n}\n\nPendingStreamTubeConnection::PendingStreamTubeConnection(\n PendingVariant *acceptOperation,\n SocketAddressType type,\n bool requiresCredentials,\n uchar credentialByte,\n const IncomingStreamTubeChannelPtr &channel)\n : PendingOperation(channel),\n mPriv(new Private(this))\n{\n mPriv->tube = channel;\n mPriv->type = type;\n mPriv->requiresCredentials = requiresCredentials;\n mPriv->credentialByte = credentialByte;\n\n \/* keep track of channel invalidation *\/\n connect(channel.data(),\n SIGNAL(invalidated(Tp::DBusProxy*,QString,QString)),\n SLOT(onChannelInvalidated(Tp::DBusProxy*,QString,QString)));\n\n connect(acceptOperation,\n SIGNAL(finished(Tp::PendingOperation*)),\n SLOT(onAcceptFinished(Tp::PendingOperation*)));\n}\n\n\/**\n * \\class PendingStreamTubeConnection\n * \\ingroup clientchannel\n * \\headerfile TelepathyQt4\/incoming-stream-tube-channel.h <TelepathyQt4\/PendingStreamTubeConnection>\n *\n * \\brief The PendingStreamTubeConnection class represents an asynchronous\n * operation for accepting a stream tube.\n *\n * When the operation is finished, you can access the resulting device\n * through device().\n * Otherwise, you can access the bare address through either tcpAddress() or\n * localAddress().\n *\/\n\nPendingStreamTubeConnection::PendingStreamTubeConnection(\n const QString& errorName,\n const QString& errorMessage,\n const IncomingStreamTubeChannelPtr &channel)\n : PendingOperation(channel),\n mPriv(new PendingStreamTubeConnection::Private(this))\n{\n setFinishedWithError(errorName, errorMessage);\n}\n\n\/**\n * Class destructor.\n *\/\nPendingStreamTubeConnection::~PendingStreamTubeConnection()\n{\n delete mPriv;\n}\n\n\/**\n * This method returns the address type of the opened socket.\n *\n * Calling this method when the operation has not been completed or has failed, will cause it\n * to return an unmeaningful value.\n *\n * \\return The type of socket this PendingStreamTubeConnection has created\n *\n * \\note This function will return a valid value only after the operation has been\n * finished successfully.\n *\n * \\see localAddress\n * \\see tcpAddress\n *\/\nSocketAddressType PendingStreamTubeConnection::addressType() const\n{\n return mPriv->tube->addressType();\n}\n\n\/**\n * This method returns the local address of the opened socket.\n *\n * Calling this method when the operation has not been completed or has failed, will cause it\n * to return an unmeaningful value. The same will happen if the socket which has been opened has a\n * different type from SocketAddressTypeUnix or SocketAddressTypeAbstractUnix. Use #ipAddress if\n * that is the case.\n *\n * \\return The local address obtained from this PendingStreamTubeConnection as a QString,\n * if the connection has been estabilished through a SocketAddressTypeUnix or\n * a SocketAddressTypeAbstractUnix.\n *\n * \\note This function will return a valid value only after the operation has been\n * finished successfully.\n *\n * \\see addressType\n *\/\nQString PendingStreamTubeConnection::localAddress() const\n{\n return mPriv->tube->localAddress();\n}\n\n\/**\n * This method returns the IP address of the opened socket.\n *\n * Calling this method when the operation has not been completed or has failed, will cause it\n * to return an unmeaningful value. The same will happen if the socket which has been opened has a\n * different type from SocketAddressTypeIpv4 or SocketAddressTypeIPv6. Use #localAddress if\n * that is the case.\n *\n * \\return The IP address and port obtained from this PendingStreamTubeConnection as a QHostAddress,\n * if the connection has been estabilished through a SocketAddressTypeIpv4 or\n * a SocketAddressTypeIPv6.\n *\n * \\note This function will return a valid value only after the operation has been\n * finished successfully.\n *\n * \\see addressType\n *\/\nQPair<QHostAddress, quint16> PendingStreamTubeConnection::ipAddress() const\n{\n return mPriv->tube->ipAddress();\n}\n\n\/**\n * Return whether sending a credential byte once connecting to the socket is required.\n *\n * Note that if this method returns \\c true, one should send a SCM_CREDS or SCM_CREDENTIALS\n * and the credentialByte() once connected. If SCM_CREDS or SCM_CREDENTIALS cannot be sent,\n * the credentialByte() should still be sent.\n *\n * \\return \\c true if sending credentials is required, \\c false otherwise.\n * \\sa credentialByte()\n *\/\nbool PendingStreamTubeConnection::requiresCredentials() const\n{\n return mPriv->requiresCredentials;\n}\n\n\/**\n * Return the credential byte to send once connecting to the socket if requiresCredentials() is \\c\n * true.\n *\n * \\return The credential byte.\n * \\sa requiresCredentials()\n *\/\nuchar PendingStreamTubeConnection::credentialByte() const\n{\n return mPriv->credentialByte;\n}\n\nvoid PendingStreamTubeConnection::onChannelInvalidated(DBusProxy *proxy,\n const QString &errorName, const QString &errorMessage)\n{\n Q_UNUSED(proxy);\n\n if (isFinished()) {\n return;\n }\n\n warning().nospace() << \"StreamTube.Accept failed because channel was invalidated with \" <<\n errorName << \": \" << errorMessage;\n\n setFinishedWithError(errorName, errorMessage);\n}\n\nvoid PendingStreamTubeConnection::onAcceptFinished(PendingOperation *op)\n{\n if (isFinished()) {\n return;\n }\n\n if (op->isError()) {\n warning().nospace() << \"StreamTube.Accept failed with \" <<\n op->errorName() << \": \" << op->errorMessage();\n setFinishedWithError(op->errorName(), op->errorMessage());\n return;\n }\n\n debug() << \"StreamTube.Accept finished successfully\";\n\n PendingVariant *pv = qobject_cast<PendingVariant *>(op);\n \/\/ Build the address\n if (mPriv->type == SocketAddressTypeIPv4) {\n SocketAddressIPv4 addr = qdbus_cast<SocketAddressIPv4>(pv->result());\n debug().nospace() << \"Got address \" << addr.address << \":\" << addr.port;\n mPriv->hostAddress = QHostAddress(addr.address);\n mPriv->port = addr.port;\n } else if (mPriv->type == SocketAddressTypeIPv6) {\n SocketAddressIPv6 addr = qdbus_cast<SocketAddressIPv6>(pv->result());\n debug().nospace() << \"Got address \" << addr.address << \":\" << addr.port;\n mPriv->hostAddress = QHostAddress(addr.address);\n mPriv->port = addr.port;\n } else {\n \/\/ Unix socket\n mPriv->socketPath = QLatin1String(qdbus_cast<QByteArray>(pv->result()));\n debug() << \"Got socket \" << mPriv->socketPath;\n }\n\n \/\/ It might have been already opened - check\n if (mPriv->tube->state() == TubeChannelStateOpen) {\n onTubeStateChanged(mPriv->tube->state());\n } else {\n \/\/ Wait until the tube gets opened on the other side\n connect(mPriv->tube.data(), SIGNAL(stateChanged(Tp::TubeChannelState)),\n this, SLOT(onTubeStateChanged(Tp::TubeChannelState)));\n }\n}\n\nvoid PendingStreamTubeConnection::onTubeStateChanged(TubeChannelState state)\n{\n debug() << \"Tube state changed to \" << state;\n if (state == TubeChannelStateOpen) {\n \/\/ The tube is ready, populate its properties\n if (mPriv->type == SocketAddressTypeIPv4 || mPriv->type == SocketAddressTypeIPv6) {\n mPriv->tube->setIpAddress(qMakePair<QHostAddress, quint16>(mPriv->hostAddress,\n mPriv->port));\n } else {\n \/\/ Unix socket\n mPriv->tube->setLocalAddress(mPriv->socketPath);\n }\n\n \/\/ Mark the operation as finished\n setFinished();\n } else if (state != TubeChannelStateLocalPending) {\n \/\/ Something happened\n setFinishedWithError(QLatin1String(\"Connection refused\"),\n QLatin1String(\"The connection to this tube was refused\"));\n }\n}\n\n}\n<|endoftext|>"} {"text":"<commit_before>\/\/\n\/\/ WFSClient.cpp\n\/\/\n\/\/ Web Feature Server Client\n\/\/\n\/\/ Copyright (c) 2002 Virtual Terrain Project\n\/\/ Free for all uses, see license.txt for details.\n\/\/\n\n\/\/ C:\\APIs\\w3c-libwww-5.4.0\\Library\\src\n\n#include \"Features.h\"\n#include \"config_vtdata.h\"\n#include \"FilePath.h\"\n\n\/\/ The dependency on Libwww is optional. If not desired, skip this file.\n#if SUPPORT_HTTP\n\n\/\/ Includes for libwww (used for HTTP requests)\n\/\/ first, avoid preprocessor conflicts between GDAL(cpl) and WWWLib\n#undef HAVE_VPRINTF\n#undef STDC_HEADERS\n\/\/ avoid preprocessor conflict between MSVC errno.h and WWWlib\n#undef EINVAL\n#include \"WWWLib.h\"\n#include \"WWWInit.h\"\n\n#ifdef _MSC_VER\n\/\/ We will now need to link with several of the Libwww libraries. This can\n\/\/ be done automatically with MSVC as follows:\n#pragma comment(lib, \"wwwapp.lib\")\n#pragma comment(lib, \"wwwcore.lib\")\n#pragma comment(lib, \"wwwinit.lib\")\n#pragma comment(lib, \"wwwutils.lib\")\n#endif\n\n#define DEFAULT_TIMEOUT\t10\t\t\t\t \/* timeout in secs *\/\n#define MILLIES\t\t\t1000\n\n#include \"xmlhelper\/easyxml.hpp\"\n\nclass ReqContext\n{\npublic:\n\tReqContext();\n\t~ReqContext();\n\tchar *GetURL(const char *url);\n\n\tHTRequest *\trequest;\n\tHTAnchor *\tanchor;\n\tchar *\t\tcwd;\t\t\t\t \/* Current dir URL *\/\n\n\tchar *\t\trealm;\t\t\t\/* For automated authentication *\/\n\tchar *\t\tuser;\n\tchar *\t\tpassword;\n};\n\nPRIVATE int printer (const char * fmt, va_list pArgs)\n{\n\tchar buf[20000];\n\tint ret = vsprintf(buf, fmt, pArgs);\n\tOutputDebugString(buf);\n\treturn ret;\n}\n\nPRIVATE int tracer (const char * fmt, va_list pArgs)\n{\n\tchar buf[20000];\n\tint ret = vsprintf(buf, fmt, pArgs);\n\tOutputDebugString(buf);\n\treturn ret;\n}\n\nPRIVATE BOOL PromptUsernameAndPassword (HTRequest * request, HTAlertOpcode op,\n\t\t\t\t\tint msgnum, const char * dfault,\n\t\t\t\t\tvoid * input, HTAlertPar * reply)\n{\n\treturn NO;\n}\n\nPRIVATE int term_handler (HTRequest * request, HTResponse * response,\n\t\t\t\t void * param, int status) \n{\n\t\/* Check for status *\/\n\tHTPrint(\"Load resulted in status %d\\n\", status);\n\t\n\t\/* we're not handling other requests *\/\n\tHTEventList_stopLoop ();\n \n\t\/* stop here *\/\n\treturn HT_ERROR;\n}\n\n\n\/\/-------------------------------------------------------------------------\n\nReqContext::ReqContext()\n{\n\tstatic bFirst = true;\n\tif (bFirst)\n\t{\n\t\tHTList * converters = HTList_new();\t\t\/* List of converters *\/\n\t\tHTList * encodings = HTList_new();\t\t\/* List of encoders *\/\n\t\t\n\t\t\/* Initialize libwww core *\/\n\t\tHTLibInit(\"vtdata\", __DATE__);\n\n\t\t\/* Need our own trace and print functions *\/\n\t\tHTPrint_setCallback(printer);\n\t\tHTTrace_setCallback(tracer);\n\n\t\t\/* On windows we must always set up the eventloop *\/\n#ifdef WIN32\n\t\tHTEventInit();\n#endif\n\n\t\t\/* Register the default set of transport protocols *\/\n\t\tHTTransportInit();\n\n\t\t\/* Register the default set of protocol modules *\/\n\t\tHTProtocolInit();\n\n\t\t\/* Register the default set of BEFORE and AFTER callback functions *\/\n\t\tHTNetInit();\n\n\t\t\/* Register the default set of converters *\/\n\t\tHTConverterInit(converters);\n\t\tHTFormat_setConversion(converters);\n\n\t\t\/* Register the default set of transfer encoders and decoders *\/\n\t\tHTTransferEncoderInit(encodings);\n\t\tHTFormat_setTransferCoding(encodings);\n\n\t\t\/* Register the default set of MIME header parsers *\/\n\t\tHTMIMEInit();\n\n\t\t\/* Add our own filter to handle termination *\/\n\t\tHTNet_addAfter(term_handler, NULL, NULL, HT_ALL, HT_FILTER_LAST);\n\n\t\t\/* Setting event timeout *\/\n\t\tint timer = DEFAULT_TIMEOUT*MILLIES;\n\t\tHTHost_setEventTimeout(timer);\n\n\t\t\/\/ Don't know what this will do, just trying:\n\t\tHTHost_setActiveTimeout(timer);\n\n\t\tbFirst = false;\n\t}\n\n\tcwd = HTGetCurrentDirectoryURL();\n\n\t\/* Bind the ConLine object together with the Request Object *\/\n\trequest = HTRequest_new();\n\tHTRequest_setOutputFormat(request, WWW_SOURCE);\n\n\t\/\/ Setting preemptive to NO doesn't seem to make a difference\n\tHTRequest_setPreemptive(request, YES);\n\n\tHTRequest_setContext(request, this);\n}\n\nReqContext::~ReqContext()\n{\n\tHTRequest_delete(request);\n\tHT_FREE(cwd);\n}\n\nchar *ReqContext::GetURL(const char *url)\n{\n\tHTChunk * chunk = NULL;\n \n\tchar *absolute_url = HTParse(url, cwd, PARSE_ALL);\n\tanchor = HTAnchor_findAddress(absolute_url);\n\tchunk = HTLoadAnchorToChunk(anchor, request);\n\tHT_FREE(absolute_url);\n\n\t\/* If chunk != NULL then we have the data *\/\n\tif (!chunk)\n\t\treturn NULL;\n\n\tchar *string;\n\t\/* wait until the request is over *\/\n\tHTEventList_loop(request);\n\tstring = HTChunk_toCString(chunk);\n\/\/\tHTPrint(\"%s\", string ? string : \"no text\");\n\treturn string;\n}\n\nbool vtFeatures::ReadFeaturesFromWFS(const char *szServerURL, const char *layername)\n{\n\tvtString url = szServerURL;\n\turl += \"GetFeature?typeName=\";\n\turl += layername;\n\n\tReqContext cl;\n\tchar *string = cl.GetURL(url);\n\tif (!string)\n\t\treturn false;\n\n\tchar *temp_fname = \"C:\/temp\/gml_temp.gml\";\n\tFILE *fp = fopen(temp_fname, \"wb\");\n\tif (!fp)\n\t\treturn false;\n\n\tfwrite(string, 1, strlen(string), fp);\n\tfclose(fp);\n\tHT_FREE(string);\n\n\treturn LoadFromGML(temp_fname);\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ Visitor class, for XML parsing of WFS Layer List files.\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nclass LayerListVisitor : public XMLVisitor\n{\npublic:\n\tLayerListVisitor(WFSLayerArray *pLayers) :\n\t\tm_pLayers(pLayers), _level(0) {}\n\n\tvirtual ~LayerListVisitor () {}\n\n\tvoid startXML ();\n\tvoid endXML ();\n\tvoid startElement (const char * name, const XMLAttributes &atts);\n\tvoid endElement (const char * name);\n\tvoid data (const char * s, int length);\n\nprivate:\n\tstring _data;\n\tint _level;\n\n\tWFSLayerArray *m_pLayers;\n\tvtTagArray *m_pTags;\n};\n\nvoid LayerListVisitor::startXML ()\n{\n\t_level = 0;\n}\n\nvoid LayerListVisitor::endXML ()\n{\n\t_level = 0;\n}\n\nvoid LayerListVisitor::startElement (const char * name, const XMLAttributes &atts)\n{\n\tif (_level == 0)\n\t{\n\t\tif (string(name) == \"FeatureType\")\n\t\t{\n\t\t\t_level = 1;\n\t\t\tm_pTags = new vtTagArray;\n\t\t}\n\t}\n\t_data = \"\";\n}\n\nvoid LayerListVisitor::endElement(const char * name)\n{\n\tif (_level == 1)\n\t{\n\t\tif (string(name) == \"FeatureType\")\n\t\t{\n\t\t\tm_pLayers->Append(m_pTags);\n\t\t\t_level = 0;\n\t\t\treturn;\n\t\t}\n\t\tconst char *value = _data.c_str();\n\t\tm_pTags->AddTag(name, value);\n\t}\n}\n\nvoid LayerListVisitor::data(const char *s, int length)\n{\n\tif (_level == 1)\n\t\t_data.append(string(s, length));\n}\n\n\/\/\n\/\/\n\/\/\nbool GetLayersFromWFS(const char *szServerURL, WFSLayerArray &layers)\n{\n\tvtString url = szServerURL;\n\turl += \"GetCapabilities?version=0.0.14\";\n\n\tReqContext cl;\n\tchar *string = cl.GetURL(url);\n\tif (!string)\n\t\treturn false;\n\n\tchar *temp_fname = \"C:\/temp\/layers_temp.xml\";\n\tFILE *fp = fopen(temp_fname, \"wb\");\n\tif (!fp)\n\t\treturn false;\n\tfwrite(string, 1, strlen(string), fp);\n\tHT_FREE(string);\n\tfclose(fp);\n\n\tLayerListVisitor visitor(&layers);\n\ttry\n\t{\n\t\treadXML(temp_fname, visitor);\n\t}\n\tcatch (xh_exception &)\n\t{\n\t\t\/\/ TODO: would be good to pass back the error message.\n\t\treturn false;\n\t}\n\treturn true;\n}\n\n#else\n\/\/ no support for HTTP\nbool vtFeatures::ReadFeaturesFromWFS(const char *url)\n{\n\treturn false;\n}\n#endif\t\/\/ SUPPORT_HTTP\n<commit_msg>fixes to !SUPPORT_HTTP case<commit_after>\/\/\n\/\/ WFSClient.cpp\n\/\/\n\/\/ Web Feature Server Client\n\/\/\n\/\/ Copyright (c) 2002 Virtual Terrain Project\n\/\/ Free for all uses, see license.txt for details.\n\/\/\n\n\/\/ C:\\APIs\\w3c-libwww-5.4.0\\Library\\src\n\n#include \"Features.h\"\n#include \"config_vtdata.h\"\n#include \"FilePath.h\"\n\n\/\/ The dependency on Libwww is optional. If not desired, skip this file.\n#if SUPPORT_HTTP\n\n\/\/ Includes for libwww (used for HTTP requests)\n\/\/ first, avoid preprocessor conflicts between GDAL(cpl) and WWWLib\n#undef HAVE_VPRINTF\n#undef STDC_HEADERS\n\/\/ avoid preprocessor conflict between MSVC errno.h and WWWlib\n#undef EINVAL\n#include \"WWWLib.h\"\n#include \"WWWInit.h\"\n\n#ifdef _MSC_VER\n\/\/ We will now need to link with several of the Libwww libraries. This can\n\/\/ be done automatically with MSVC as follows:\n#pragma comment(lib, \"wwwapp.lib\")\n#pragma comment(lib, \"wwwcore.lib\")\n#pragma comment(lib, \"wwwinit.lib\")\n#pragma comment(lib, \"wwwutils.lib\")\n#endif\n\n#define DEFAULT_TIMEOUT\t10\t\t\t\t \/* timeout in secs *\/\n#define MILLIES\t\t\t1000\n\n#include \"xmlhelper\/easyxml.hpp\"\n\nclass ReqContext\n{\npublic:\n\tReqContext();\n\t~ReqContext();\n\tchar *GetURL(const char *url);\n\n\tHTRequest *\trequest;\n\tHTAnchor *\tanchor;\n\tchar *\t\tcwd;\t\t\t\t \/* Current dir URL *\/\n\n\tchar *\t\trealm;\t\t\t\/* For automated authentication *\/\n\tchar *\t\tuser;\n\tchar *\t\tpassword;\n};\n\nPRIVATE int printer (const char * fmt, va_list pArgs)\n{\n\tchar buf[20000];\n\tint ret = vsprintf(buf, fmt, pArgs);\n\tOutputDebugString(buf);\n\treturn ret;\n}\n\nPRIVATE int tracer (const char * fmt, va_list pArgs)\n{\n\tchar buf[20000];\n\tint ret = vsprintf(buf, fmt, pArgs);\n\tOutputDebugString(buf);\n\treturn ret;\n}\n\nPRIVATE BOOL PromptUsernameAndPassword (HTRequest * request, HTAlertOpcode op,\n\t\t\t\t\tint msgnum, const char * dfault,\n\t\t\t\t\tvoid * input, HTAlertPar * reply)\n{\n\treturn NO;\n}\n\nPRIVATE int term_handler (HTRequest * request, HTResponse * response,\n\t\t\t\t void * param, int status) \n{\n\t\/* Check for status *\/\n\tHTPrint(\"Load resulted in status %d\\n\", status);\n\t\n\t\/* we're not handling other requests *\/\n\tHTEventList_stopLoop ();\n \n\t\/* stop here *\/\n\treturn HT_ERROR;\n}\n\n\n\/\/-------------------------------------------------------------------------\n\nReqContext::ReqContext()\n{\n\tstatic bFirst = true;\n\tif (bFirst)\n\t{\n\t\tHTList * converters = HTList_new();\t\t\/* List of converters *\/\n\t\tHTList * encodings = HTList_new();\t\t\/* List of encoders *\/\n\t\t\n\t\t\/* Initialize libwww core *\/\n\t\tHTLibInit(\"vtdata\", __DATE__);\n\n\t\t\/* Need our own trace and print functions *\/\n\t\tHTPrint_setCallback(printer);\n\t\tHTTrace_setCallback(tracer);\n\n\t\t\/* On windows we must always set up the eventloop *\/\n#ifdef WIN32\n\t\tHTEventInit();\n#endif\n\n\t\t\/* Register the default set of transport protocols *\/\n\t\tHTTransportInit();\n\n\t\t\/* Register the default set of protocol modules *\/\n\t\tHTProtocolInit();\n\n\t\t\/* Register the default set of BEFORE and AFTER callback functions *\/\n\t\tHTNetInit();\n\n\t\t\/* Register the default set of converters *\/\n\t\tHTConverterInit(converters);\n\t\tHTFormat_setConversion(converters);\n\n\t\t\/* Register the default set of transfer encoders and decoders *\/\n\t\tHTTransferEncoderInit(encodings);\n\t\tHTFormat_setTransferCoding(encodings);\n\n\t\t\/* Register the default set of MIME header parsers *\/\n\t\tHTMIMEInit();\n\n\t\t\/* Add our own filter to handle termination *\/\n\t\tHTNet_addAfter(term_handler, NULL, NULL, HT_ALL, HT_FILTER_LAST);\n\n\t\t\/* Setting event timeout *\/\n\t\tint timer = DEFAULT_TIMEOUT*MILLIES;\n\t\tHTHost_setEventTimeout(timer);\n\n\t\t\/\/ Don't know what this will do, just trying:\n\t\tHTHost_setActiveTimeout(timer);\n\n\t\tbFirst = false;\n\t}\n\n\tcwd = HTGetCurrentDirectoryURL();\n\n\t\/* Bind the ConLine object together with the Request Object *\/\n\trequest = HTRequest_new();\n\tHTRequest_setOutputFormat(request, WWW_SOURCE);\n\n\t\/\/ Setting preemptive to NO doesn't seem to make a difference\n\tHTRequest_setPreemptive(request, YES);\n\n\tHTRequest_setContext(request, this);\n}\n\nReqContext::~ReqContext()\n{\n\tHTRequest_delete(request);\n\tHT_FREE(cwd);\n}\n\nchar *ReqContext::GetURL(const char *url)\n{\n\tHTChunk * chunk = NULL;\n \n\tchar *absolute_url = HTParse(url, cwd, PARSE_ALL);\n\tanchor = HTAnchor_findAddress(absolute_url);\n\tchunk = HTLoadAnchorToChunk(anchor, request);\n\tHT_FREE(absolute_url);\n\n\t\/* If chunk != NULL then we have the data *\/\n\tif (!chunk)\n\t\treturn NULL;\n\n\tchar *string;\n\t\/* wait until the request is over *\/\n\tHTEventList_loop(request);\n\tstring = HTChunk_toCString(chunk);\n\/\/\tHTPrint(\"%s\", string ? string : \"no text\");\n\treturn string;\n}\n\nbool vtFeatures::ReadFeaturesFromWFS(const char *szServerURL, const char *layername)\n{\n\tvtString url = szServerURL;\n\turl += \"GetFeature?typeName=\";\n\turl += layername;\n\n\tReqContext cl;\n\tchar *string = cl.GetURL(url);\n\tif (!string)\n\t\treturn false;\n\n\tchar *temp_fname = \"C:\/temp\/gml_temp.gml\";\n\tFILE *fp = fopen(temp_fname, \"wb\");\n\tif (!fp)\n\t\treturn false;\n\n\tfwrite(string, 1, strlen(string), fp);\n\tfclose(fp);\n\tHT_FREE(string);\n\n\treturn LoadFromGML(temp_fname);\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ Visitor class, for XML parsing of WFS Layer List files.\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nclass LayerListVisitor : public XMLVisitor\n{\npublic:\n\tLayerListVisitor(WFSLayerArray *pLayers) :\n\t\tm_pLayers(pLayers), _level(0) {}\n\n\tvirtual ~LayerListVisitor () {}\n\n\tvoid startXML ();\n\tvoid endXML ();\n\tvoid startElement (const char * name, const XMLAttributes &atts);\n\tvoid endElement (const char * name);\n\tvoid data (const char * s, int length);\n\nprivate:\n\tstring _data;\n\tint _level;\n\n\tWFSLayerArray *m_pLayers;\n\tvtTagArray *m_pTags;\n};\n\nvoid LayerListVisitor::startXML ()\n{\n\t_level = 0;\n}\n\nvoid LayerListVisitor::endXML ()\n{\n\t_level = 0;\n}\n\nvoid LayerListVisitor::startElement (const char * name, const XMLAttributes &atts)\n{\n\tif (_level == 0)\n\t{\n\t\tif (string(name) == \"FeatureType\")\n\t\t{\n\t\t\t_level = 1;\n\t\t\tm_pTags = new vtTagArray;\n\t\t}\n\t}\n\t_data = \"\";\n}\n\nvoid LayerListVisitor::endElement(const char * name)\n{\n\tif (_level == 1)\n\t{\n\t\tif (string(name) == \"FeatureType\")\n\t\t{\n\t\t\tm_pLayers->Append(m_pTags);\n\t\t\t_level = 0;\n\t\t\treturn;\n\t\t}\n\t\tconst char *value = _data.c_str();\n\t\tm_pTags->AddTag(name, value);\n\t}\n}\n\nvoid LayerListVisitor::data(const char *s, int length)\n{\n\tif (_level == 1)\n\t\t_data.append(string(s, length));\n}\n\n\/\/\n\/\/\n\/\/\nbool GetLayersFromWFS(const char *szServerURL, WFSLayerArray &layers)\n{\n\tvtString url = szServerURL;\n\turl += \"GetCapabilities?version=0.0.14\";\n\n\tReqContext cl;\n\tchar *string = cl.GetURL(url);\n\tif (!string)\n\t\treturn false;\n\n\tchar *temp_fname = \"C:\/temp\/layers_temp.xml\";\n\tFILE *fp = fopen(temp_fname, \"wb\");\n\tif (!fp)\n\t\treturn false;\n\tfwrite(string, 1, strlen(string), fp);\n\tHT_FREE(string);\n\tfclose(fp);\n\n\tLayerListVisitor visitor(&layers);\n\ttry\n\t{\n\t\treadXML(temp_fname, visitor);\n\t}\n\tcatch (xh_exception &)\n\t{\n\t\t\/\/ TODO: would be good to pass back the error message.\n\t\treturn false;\n\t}\n\treturn true;\n}\n\n#else\n\/\/ no support for HTTP\nbool vtFeatures::ReadFeaturesFromWFS(const char *, const char *)\n{\n\treturn false;\n}\n#endif\t\/\/ SUPPORT_HTTP\n<|endoftext|>"} {"text":"<commit_before>\/*******************************\n * \n * Monarch decoder v1.0.0\n * Author: Roger Hsiao\n * \n * Works with mbc_code.c v5.2.3 and above\n * Usage: .\/decoder.exe [packets] [date.log | 0] [time.log | 0] [light out file] [temp out file]\n *\n * v1.0.0: \n * Added automatic time translation\n *\n * v1.0.1:\n * Decoding doesn't halt when encountering an Unrecognized code anymore\n *\n * v1.0.2:\n * Updated decoder to use local date instead of epoch date\n *\n * v1.0.3:\n * Not subtracting timezone difference in time.log to get GMT time\n *\n * v1.0.4:\n * Fixed decoder index bug that doesn't update index properly, which causes a timeshift\n *\n *\n *******************************\/\n\n\n#include <iostream>\n#include <fstream>\n#include <bitset>\n#include <string>\n#include <map>\n#include <cmath>\n#include \"..\/pre_v20e\/software\/mbc_code\/huffman_encodings.h\"\n\/\/ #include \"\/home\/rogerhh\/M-ulator\/platforms\/m3\/pre_v20e\/software\/mbc_code\/huffman_encodings.h\"\n\n#define DAWN 0\n#define NOON 1\n#define DUSK 2\n#define NIGHT 3\n\nusing namespace std;\n\nusing Unit = bitset<272>;\n\nUnit create_unit(const string packets[]);\nuint32_t get_data(Unit& u, int len);\n\nuint16_t resample_indices[4] = {32, 40, 44, 1000};\nuint16_t intervals[4] = {1, 2, 8, 32};\n\nclass LightParser {\npublic:\n uint32_t sys_time_in_min = 0;\n int day_state = 0;\n int index = 0;\n map<uint32_t, double> data;\n map<int, map<int, int>> codes;\n\n void parse_unit(Unit& u);\n void read_header(Unit& u);\n void read_timestamp(Unit& u);\n\n LightParser();\n};\n\nclass TempParser {\npublic:\n map<uint32_t, double> data;\n map<int, map<int, int>> codes;\n\n void parse_unit(Unit& u);\n\n TempParser();\n};\n\nint main(int argc, char** argv) {\n if(argc != 6) {\n cerr << \"Usage: .\/decoder.exe [packet file] [date.log] [time.log] [light output file] [temp output file]\" << endl;\n return 1;\n }\n\n string packet_filename = string(argv[1]);\n ifstream fin(packet_filename);\n if(!fin.is_open()) {\n cerr << \"Error opening: \" << packet_filename << endl;\n return 1;\n }\n string date_log = string(argv[2]);\n ifstream date_fin(date_log);\n if(date_log != \"0\" && !date_fin.is_open()) {\n cerr << \"Error opening: \" << date_log << endl;\n return 1;\n }\n string time_log = string(argv[3]);\n ifstream time_fin(time_log);\n if(time_log != \"0\" && !time_fin.is_open()) {\n cerr << \"Error opening: \" << time_log << endl;\n return 1;\n }\n bool no_time_translation = date_log == \"0\";\n\n string light_filename = string(argv[4]);\n ofstream light_fout(light_filename);\n if(!light_fout.is_open()) {\n cerr << \"Error opening: \" << light_filename << endl;\n return 1;\n }\n string temp_filename = string(argv[5]);\n ofstream temp_fout(temp_filename);\n if(!temp_fout.is_open()) {\n cerr << \"Error opening: \" << temp_filename << endl;\n return 1;\n }\n\n double abs_time = 0, programmed_time = 0, tz = 0, trigger_fire_date = 0, date_tz = 0;\n\n if(!no_time_translation) {\n \/\/ Read UTC offset\n int programmed_date = 0;\n string trash;\n getline(date_fin, trash, ':');\n date_fin >> trigger_fire_date;\n getline(date_fin, trash, ':');\n date_fin >> date_tz;\n getline(date_fin, trash, ':');\n date_fin >> programmed_date;\n cout << trigger_fire_date << \" \" << programmed_date << endl;\n\n char c;\n getline(time_fin, trash, ':');\n time_fin >> abs_time;\n getline(time_fin, trash, ':');\n time_fin >> programmed_time >> c >> c >> tz;\n\n cout << programmed_date << \" \" << (int) abs_time << \" \" << programmed_time << \" \" << tz << endl;\n }\n else {\n cout << \"No auto time translation\" << endl;\n }\n\n LightParser lp;\n TempParser tp;\n\n string packets[4];\n while(fin >> packets[0] >> packets[1] >> packets[2] >> packets[3]) {\n auto u = create_unit(packets);\n if(stoi(packets[0].substr(0, 1), 0, 16) & 0b1000) {\n \/\/ is light\n lp.parse_unit(u);\n } \n else {\n \/\/ is temp\n tp.parse_unit(u);\n }\n }\n\n for(auto p : lp.data) {\n \/\/ Not doing anything with timezone because it seems like it's already done by python\n light_fout << fixed << p.first << \" \" << p.first + abs_time + 0 * tz << \" \" << p.second << \" \" << pow(2, (p.second \/ 32.0)) << endl;\n }\n for(auto p : tp.data) {\n temp_fout << fixed << p.first + trigger_fire_date * 86400 - date_tz << \" \" << pow(2, ((p.second + 128) \/ 16.0)) << endl;\n }\n}\n\nUnit create_unit(const string packets[]) {\n Unit u = Unit(0);\n for(int i = 0; i < 4; i++) {\n for(int j = 3; j < packets[i].size(); j++) {\n u <<= 4;\n u |= Unit(stoi(packets[i].substr(j, 1), 0, 16));\n }\n }\n cout << u << endl;\n return u;\n}\n\nuint32_t get_data(Unit& u, int len) {\n uint32_t mask = (1 << len) - 1;\n auto temp = u;\n temp >>= (272 - len);\n temp &= mask;\n u <<= len;\n return temp.to_ulong();\n}\n\nLightParser::LightParser() {\n \/\/ preprocess codes\n for(int i = 0; i < 67; i++) {\n auto code = light_diff_codes[i];\n auto len = light_code_lengths[i];\n if(i == 64) {\n codes[len][code] = 0x1FF;\n }\n else if(i == 65) {\n codes[len][code] = 0x7FF;\n }\n else if(i == 66) {\n codes[len][code] = 0x1000;\n }\n else {\n codes[len][code] = i - 32;\n }\n }\n}\n\nuint32_t sign_extend(uint32_t src, int len) {\n if(src & (1 << (len - 1))) {\n cout << \"sign extend neg\" << endl;\n return src - (1 << len);\n }\n else {\n return src;\n }\n}\n\nvoid LightParser::read_timestamp(Unit& u) {\n auto t = get_data(u, 17); \n \/\/ Not worried about overflow for now\n sys_time_in_min = t;\n cout << \"parsed time in min = \" << sys_time_in_min << endl;\n}\n\nvoid LightParser::read_header(Unit& u) {\n day_state = get_data(u, 2);\n cout << \"day state = \" << day_state << endl;\n if(day_state == NIGHT) {\n throw runtime_error(\"Invalid day state!\");\n }\n\n index = get_data(u, 7);\n cout << \"index: \" << index << endl;\n cout << \"day state = \" << day_state << endl;\n}\n\nvoid LightParser::parse_unit(Unit& u) {\n bool has_header = false;\n bool has_timestamp = false;\n bool has_cur = false;\n int cur = 0;\n\n cout << \"light_unit\" << endl;\n\n while(u.any()) {\n cout << \"u any = \" << u.any() << \" \" << u << endl;\n if(!has_timestamp) {\n read_timestamp(u);\n has_timestamp = true;\n }\n if(!has_header) {\n read_header(u);\n has_header = true;\n }\n if(!has_cur) {\n \/\/ read initial val\n cur = get_data(u, 11);\n has_cur = true;\n }\n else {\n \/\/ else read code\n int len = 0;\n int tmp = 0;\n bool flag = false;\n while(len < 12) {\n int b = get_data(u, 1);\n tmp <<= 1;\n tmp |= b;\n len++;\n cout << \"codes: \" << len << \" \" << tmp << \" \" << bitset<12>(tmp) << endl;\n auto it = codes.find(len);\n if(it == codes.end()) {\n continue;\n }\n auto it2 = codes[len].find(tmp);\n if(it2 == codes[len].end()) {\n continue;\n }\n auto code = it2->second;\n\n cout << \"code: \" << code << endl;\n\n if(code == 0x1000) {\n day_state = (day_state + 1) & 0b11;\n if(day_state == NIGHT) {\n day_state = DAWN;\n }\n index = 0;\n cout << \"end day state\" << endl;\n cout << \"day state = \" << day_state << \"; index = \" << 0 << endl;\n has_timestamp = false;\n }\n else if(code == 0x7FF) {\n \/\/ don't use diff\n code = get_data(u, 11);\n cout << \"diff 11\" << endl;\n cur = code;\n }\n else if(code == 0x1FF) {\n code = get_data(u, 9);\n cout << \"diff 9: code: \" << bitset<9>(code) << endl;\n code = sign_extend(code, 9);\n cout << \"exteneded: \" << code << endl;\n cur += code;\n }\n else {\n cur += code;\n }\n flag = true;\n break;\n }\n if(!flag) {\n cout << u << endl;\n cout << \"Unrecognized code\" << endl;\n continue;\n throw runtime_error(\"Unrecognized code: \" + to_string(tmp));\n\n }\n if(!has_timestamp) {\n continue;\n }\n }\n data[sys_time_in_min * 60] = cur;\n cout << sys_time_in_min << \" \" << sys_time_in_min * 60 << \" \" << cur << endl;\n index++;\n\n \/\/ update sys_time_in_min\n if(u.any()) {\n if(day_state == DAWN) {\n for(int i = 0; i < 4; i++) {\n if(index < resample_indices[i]) {\n sys_time_in_min += intervals[i];\n cout << \" test\" << endl;\n break;\n }\n }\n }\n else if(day_state == DUSK) {\n for(int i = 0; i < 4; i++) {\n if(index < resample_indices[i]) {\n sys_time_in_min -= intervals[i];\n break;\n }\n }\n }\n else {\n sys_time_in_min += 32;\n }\n }\n }\n cout << \"End unit. sys_time_in_min = \" << sys_time_in_min << endl << endl;\n\n return;\n}\n\nvoid TempParser::parse_unit(Unit& u) {\n uint32_t day_count = get_data(u, 7);\n uint32_t timestamp_in_half_hour = get_data(u, 6);\n uint32_t cur_value = get_data(u, 7);\n\n data[day_count * 86400 + timestamp_in_half_hour * 1800] = cur_value;\n\n while(u.any()) {\n cout << u << endl;\n int len = 0;\n int tmp = 0;\n bool flag = false;\n while(len < 4) {\n int b = get_data(u, 1);\n tmp <<= 1;\n tmp |= b;\n len++;\n cout << \"temp codes: \" << len << \" \" << tmp << \" \" << bitset<4>(tmp) << endl;\n auto it = codes.find(len);\n if(it == codes.end()) {\n continue;\n }\n auto it2 = codes[len].find(tmp);\n if(it2 == codes[len].end()) {\n continue;\n }\n auto code = it2->second;\n\n cout << \"temp code: \" << code << endl;\n\n if(code == 0x7F) {\n code = get_data(u, 7);\n cout << \"diff 7\" << endl;\n cur_value = code;\n }\n else {\n cur_value += code;\n }\n flag = true;\n break;\n }\n\n if(!flag) {\n cout << \"Unrecognized code\" << endl;\n continue;\n throw runtime_error(\"Unrecognized code: \" + to_string(tmp));\n }\n\n timestamp_in_half_hour++;\n if(timestamp_in_half_hour >= 48) {\n timestamp_in_half_hour = 0;\n day_count++;\n }\n\n data[day_count * 86400 + timestamp_in_half_hour * 1800] = cur_value;\n cout << day_count << \" \" << timestamp_in_half_hour << endl;\n cout << day_count * 86400 + timestamp_in_half_hour * 1800 << \" \" << cur_value << endl;\n \n }\n\n cout << \"End temp unit\" << endl;\n\n return;\n}\n\nTempParser::TempParser() {\n \/\/ preprocess codes\n for(int i = 0; i < 5; i++) {\n auto code = temp_diff_codes[i];\n auto len = temp_code_lengths[i];\n if(i == 4) {\n codes[len][code] = 0x7F;\n }\n else {\n codes[len][code] = i - 2;\n }\n }\n}\n\n<commit_msg>decoder v1.0.4<commit_after>\/*******************************\n * \n * Monarch decoder v1.0.0\n * Author: Roger Hsiao\n * \n * Works with mbc_code.c v5.2.3 and above\n * Usage: .\/decoder.exe [packets] [date.log | 0] [time.log | 0] [light out file] [temp out file]\n *\n * v1.0.0: \n * Added automatic time translation\n *\n * v1.0.1:\n * Decoding doesn't halt when encountering an Unrecognized code anymore\n *\n * v1.0.2:\n * Updated decoder to use local date instead of epoch date\n *\n * v1.0.3:\n * Not subtracting timezone difference in time.log to get GMT time\n *\n * v1.0.4:\n * Fixed decoder index bug that doesn't update index properly, which causes a timeshift\n * Removed timezone shift in decoded data, so now the decoded data is strictly GMT\n *\n *\n *******************************\/\n\n\n#include <iostream>\n#include <fstream>\n#include <bitset>\n#include <string>\n#include <map>\n#include <cmath>\n#include \"..\/pre_v20e\/software\/mbc_code\/huffman_encodings.h\"\n\/\/ #include \"\/home\/rogerhh\/M-ulator\/platforms\/m3\/pre_v20e\/software\/mbc_code\/huffman_encodings.h\"\n\n#define DAWN 0\n#define NOON 1\n#define DUSK 2\n#define NIGHT 3\n\nusing namespace std;\n\nusing Unit = bitset<272>;\n\nUnit create_unit(const string packets[]);\nuint32_t get_data(Unit& u, int len);\n\nuint16_t resample_indices[4] = {32, 40, 44, 1000};\nuint16_t intervals[4] = {1, 2, 8, 32};\n\nclass LightParser {\npublic:\n uint32_t sys_time_in_min = 0;\n int day_state = 0;\n int index = 0;\n map<uint32_t, double> data;\n map<int, map<int, int>> codes;\n\n void parse_unit(Unit& u);\n void read_header(Unit& u);\n void read_timestamp(Unit& u);\n\n LightParser();\n};\n\nclass TempParser {\npublic:\n map<uint32_t, double> data;\n map<int, map<int, int>> codes;\n\n void parse_unit(Unit& u);\n\n TempParser();\n};\n\nint main(int argc, char** argv) {\n if(argc != 6) {\n cerr << \"Usage: .\/decoder.exe [packet file] [date.log] [time.log] [light output file] [temp output file]\" << endl;\n return 1;\n }\n\n string packet_filename = string(argv[1]);\n ifstream fin(packet_filename);\n if(!fin.is_open()) {\n cerr << \"Error opening: \" << packet_filename << endl;\n return 1;\n }\n string date_log = string(argv[2]);\n ifstream date_fin(date_log);\n if(date_log != \"0\" && !date_fin.is_open()) {\n cerr << \"Error opening: \" << date_log << endl;\n return 1;\n }\n string time_log = string(argv[3]);\n ifstream time_fin(time_log);\n if(time_log != \"0\" && !time_fin.is_open()) {\n cerr << \"Error opening: \" << time_log << endl;\n return 1;\n }\n bool no_time_translation = date_log == \"0\";\n\n string light_filename = string(argv[4]);\n ofstream light_fout(light_filename);\n if(!light_fout.is_open()) {\n cerr << \"Error opening: \" << light_filename << endl;\n return 1;\n }\n string temp_filename = string(argv[5]);\n ofstream temp_fout(temp_filename);\n if(!temp_fout.is_open()) {\n cerr << \"Error opening: \" << temp_filename << endl;\n return 1;\n }\n\n double abs_time = 0, programmed_time = 0, tz = 0, trigger_fire_date = 0, date_tz = 0;\n\n if(!no_time_translation) {\n \/\/ Read UTC offset\n int programmed_date = 0;\n string trash;\n getline(date_fin, trash, ':');\n date_fin >> trigger_fire_date;\n getline(date_fin, trash, ':');\n date_fin >> date_tz;\n getline(date_fin, trash, ':');\n date_fin >> programmed_date;\n cout << trigger_fire_date << \" \" << programmed_date << endl;\n\n char c;\n getline(time_fin, trash, ':');\n time_fin >> abs_time;\n getline(time_fin, trash, ':');\n time_fin >> programmed_time >> c >> c >> tz;\n\n cout << programmed_date << \" \" << (int) abs_time << \" \" << programmed_time << \" \" << tz << endl;\n }\n else {\n cout << \"No auto time translation\" << endl;\n }\n\n LightParser lp;\n TempParser tp;\n\n string packets[4];\n while(fin >> packets[0] >> packets[1] >> packets[2] >> packets[3]) {\n auto u = create_unit(packets);\n if(stoi(packets[0].substr(0, 1), 0, 16) & 0b1000) {\n \/\/ is light\n lp.parse_unit(u);\n } \n else {\n \/\/ is temp\n tp.parse_unit(u);\n }\n }\n\n for(auto p : lp.data) {\n \/\/ Not doing anything with timezone because it seems like it's already done by python\n light_fout << fixed << p.first << \" \" << p.first + abs_time + 0 * tz << \" \" << p.second << \" \" << pow(2, (p.second \/ 32.0)) << endl;\n }\n for(auto p : tp.data) {\n temp_fout << fixed << p.first + trigger_fire_date * 86400 - date_tz << \" \" << pow(2, ((p.second + 128) \/ 16.0)) << endl;\n }\n}\n\nUnit create_unit(const string packets[]) {\n Unit u = Unit(0);\n for(int i = 0; i < 4; i++) {\n for(int j = 3; j < packets[i].size(); j++) {\n u <<= 4;\n u |= Unit(stoi(packets[i].substr(j, 1), 0, 16));\n }\n }\n cout << u << endl;\n return u;\n}\n\nuint32_t get_data(Unit& u, int len) {\n uint32_t mask = (1 << len) - 1;\n auto temp = u;\n temp >>= (272 - len);\n temp &= mask;\n u <<= len;\n return temp.to_ulong();\n}\n\nLightParser::LightParser() {\n \/\/ preprocess codes\n for(int i = 0; i < 67; i++) {\n auto code = light_diff_codes[i];\n auto len = light_code_lengths[i];\n if(i == 64) {\n codes[len][code] = 0x1FF;\n }\n else if(i == 65) {\n codes[len][code] = 0x7FF;\n }\n else if(i == 66) {\n codes[len][code] = 0x1000;\n }\n else {\n codes[len][code] = i - 32;\n }\n }\n}\n\nuint32_t sign_extend(uint32_t src, int len) {\n if(src & (1 << (len - 1))) {\n cout << \"sign extend neg\" << endl;\n return src - (1 << len);\n }\n else {\n return src;\n }\n}\n\nvoid LightParser::read_timestamp(Unit& u) {\n auto t = get_data(u, 17); \n \/\/ Not worried about overflow for now\n sys_time_in_min = t;\n cout << \"parsed time in min = \" << sys_time_in_min << endl;\n}\n\nvoid LightParser::read_header(Unit& u) {\n day_state = get_data(u, 2);\n cout << \"day state = \" << day_state << endl;\n if(day_state == NIGHT) {\n throw runtime_error(\"Invalid day state!\");\n }\n\n index = get_data(u, 7);\n cout << \"index: \" << index << endl;\n cout << \"day state = \" << day_state << endl;\n}\n\nvoid LightParser::parse_unit(Unit& u) {\n bool has_header = false;\n bool has_timestamp = false;\n bool has_cur = false;\n int cur = 0;\n\n cout << \"light_unit\" << endl;\n\n while(u.any()) {\n cout << \"u any = \" << u.any() << \" \" << u << endl;\n if(!has_timestamp) {\n read_timestamp(u);\n has_timestamp = true;\n }\n if(!has_header) {\n read_header(u);\n has_header = true;\n }\n if(!has_cur) {\n \/\/ read initial val\n cur = get_data(u, 11);\n has_cur = true;\n }\n else {\n \/\/ else read code\n int len = 0;\n int tmp = 0;\n bool flag = false;\n while(len < 12) {\n int b = get_data(u, 1);\n tmp <<= 1;\n tmp |= b;\n len++;\n cout << \"codes: \" << len << \" \" << tmp << \" \" << bitset<12>(tmp) << endl;\n auto it = codes.find(len);\n if(it == codes.end()) {\n continue;\n }\n auto it2 = codes[len].find(tmp);\n if(it2 == codes[len].end()) {\n continue;\n }\n auto code = it2->second;\n\n cout << \"code: \" << code << endl;\n\n if(code == 0x1000) {\n day_state = (day_state + 1) & 0b11;\n if(day_state == NIGHT) {\n day_state = DAWN;\n }\n index = 0;\n cout << \"end day state\" << endl;\n cout << \"day state = \" << day_state << \"; index = \" << 0 << endl;\n has_timestamp = false;\n }\n else if(code == 0x7FF) {\n \/\/ don't use diff\n code = get_data(u, 11);\n cout << \"diff 11\" << endl;\n cur = code;\n }\n else if(code == 0x1FF) {\n code = get_data(u, 9);\n cout << \"diff 9: code: \" << bitset<9>(code) << endl;\n code = sign_extend(code, 9);\n cout << \"exteneded: \" << code << endl;\n cur += code;\n }\n else {\n cur += code;\n }\n flag = true;\n break;\n }\n if(!flag) {\n cout << u << endl;\n cout << \"Unrecognized code\" << endl;\n continue;\n throw runtime_error(\"Unrecognized code: \" + to_string(tmp));\n\n }\n if(!has_timestamp) {\n continue;\n }\n }\n data[sys_time_in_min * 60] = cur;\n cout << sys_time_in_min << \" \" << sys_time_in_min * 60 << \" \" << cur << endl;\n index++;\n\n \/\/ update sys_time_in_min\n if(u.any()) {\n if(day_state == DAWN) {\n for(int i = 0; i < 4; i++) {\n if(index < resample_indices[i]) {\n sys_time_in_min += intervals[i];\n cout << \" test\" << endl;\n break;\n }\n }\n }\n else if(day_state == DUSK) {\n for(int i = 0; i < 4; i++) {\n if(index < resample_indices[i]) {\n sys_time_in_min -= intervals[i];\n break;\n }\n }\n }\n else {\n sys_time_in_min += 32;\n }\n }\n }\n cout << \"End unit. sys_time_in_min = \" << sys_time_in_min << endl << endl;\n\n return;\n}\n\nvoid TempParser::parse_unit(Unit& u) {\n uint32_t day_count = get_data(u, 7);\n uint32_t timestamp_in_half_hour = get_data(u, 6);\n uint32_t cur_value = get_data(u, 7);\n\n data[day_count * 86400 + timestamp_in_half_hour * 1800] = cur_value;\n\n while(u.any()) {\n cout << u << endl;\n int len = 0;\n int tmp = 0;\n bool flag = false;\n while(len < 4) {\n int b = get_data(u, 1);\n tmp <<= 1;\n tmp |= b;\n len++;\n cout << \"temp codes: \" << len << \" \" << tmp << \" \" << bitset<4>(tmp) << endl;\n auto it = codes.find(len);\n if(it == codes.end()) {\n continue;\n }\n auto it2 = codes[len].find(tmp);\n if(it2 == codes[len].end()) {\n continue;\n }\n auto code = it2->second;\n\n cout << \"temp code: \" << code << endl;\n\n if(code == 0x7F) {\n code = get_data(u, 7);\n cout << \"diff 7\" << endl;\n cur_value = code;\n }\n else {\n cur_value += code;\n }\n flag = true;\n break;\n }\n\n if(!flag) {\n cout << \"Unrecognized code\" << endl;\n continue;\n throw runtime_error(\"Unrecognized code: \" + to_string(tmp));\n }\n\n timestamp_in_half_hour++;\n if(timestamp_in_half_hour >= 48) {\n timestamp_in_half_hour = 0;\n day_count++;\n }\n\n data[day_count * 86400 + timestamp_in_half_hour * 1800] = cur_value;\n cout << day_count << \" \" << timestamp_in_half_hour << endl;\n cout << day_count * 86400 + timestamp_in_half_hour * 1800 << \" \" << cur_value << endl;\n \n }\n\n cout << \"End temp unit\" << endl;\n\n return;\n}\n\nTempParser::TempParser() {\n \/\/ preprocess codes\n for(int i = 0; i < 5; i++) {\n auto code = temp_diff_codes[i];\n auto len = temp_code_lengths[i];\n if(i == 4) {\n codes[len][code] = 0x7F;\n }\n else {\n codes[len][code] = i - 2;\n }\n }\n}\n\n<|endoftext|>"} {"text":"<commit_before>#pragma once\n\n#include \"geometry\/shapes\/ray.hh\"\n#include \"intersection.hh\"\n\n#include \"eigen.hh\"\n\n#include <limits>\n\nnamespace geometry {\nnamespace spatial {\n\n\/\/ Axis aligned bounding box, with some nice geometric helpers.\ntemplate <int DIM = 3, typename Scalar = double>\nclass BoundingBox {\n public:\n using Vec = Eigen::Matrix<Scalar, DIM, 1>;\n\n \/\/ Expand to contain a point\n void expand(const Vec &point) {\n lower_ = lower_.cwiseMin(point);\n upper_ = upper_.cwiseMax(point);\n }\n\n \/\/ Expand to contain another axis-aligned bounding box\n void expand(const BoundingBox<DIM> &box) {\n expand(box.lower());\n expand(box.upper());\n }\n\n bool contains(const Vec &point) const {\n return (point.array() < upper_.array()).all() &&\n (point.array() > lower_.array()).all();\n }\n\n Vec center() const {\n return (upper_ + lower_) * 0.5;\n }\n\n double surface_area() const {\n static_assert(DIM == 3, \"Dimension must be 3 because how do I higher dimensions?\");\n const Vec delta = upper_ - lower_;\n double sa = 0.0;\n for (int i = 0; i < DIM; ++i) {\n sa += 2.0 * delta(i) * delta((i + 1) % DIM);\n }\n return sa;\n }\n\n \/\/ Compute an intersection using the slab method\n Intersection intersect(const Ray &ray) const {\n static_assert(DIM == 3, \"Dimension must be 3 because rays are of dim 3 so\");\n\n double max_t_near = std::numeric_limits<double>::lowest();\n double min_t_far = std::numeric_limits<double>::max();\n\n for (int i = 0; i < DIM; ++i) {\n \/\/ Note: We're really just trying to avoid denormals, in principle the operations\n \/\/ that follow are permissible for arbitrary nonzero floats\n constexpr double EPS = 1e-10;\n if (std::abs(ray.direction(i)) < EPS) {\n if (ray.origin(i) < lower_(i) || ray.origin(i) > upper_(i)) {\n return {-1.0, false};\n }\n }\n\n const double inv_direction_i = 1.0 \/ ray.direction(i);\n const double t1 = (lower_(i) - ray.origin(i)) * inv_direction_i;\n const double t2 = (upper_(i) - ray.origin(i)) * inv_direction_i;\n\n const double t_near = std::min(t1, t2);\n const double t_far = std::max(t1, t2);\n\n max_t_near = std::max(max_t_near, t_near);\n min_t_far = std::min(min_t_far, t_far);\n }\n\n Intersection intersection;\n if (contains(ray.origin)) {\n intersection.intersected = true;\n intersection.distance = min_t_far;\n } else {\n intersection.intersected = (max_t_near < min_t_far) && max_t_near >= 0.0;\n intersection.distance = max_t_near;\n }\n return intersection;\n }\n\n Eigen::Vector3d nearest_point(const Eigen::Vector3d &point) const {\n static_assert(DIM == 3, \"Dimension must be 3 (I think...)\");\n using Vec3 = Eigen::Vector3d;\n const Vec3 pc = point - center();\n const Vec3 b = upper() - center();\n const Vec3 abs_pt = (pc.cwiseAbs() - b).cwiseMax(Vec3::Zero());\n return point - (abs_pt.array() * pc.cwiseSign().array()).matrix();\n }\n\n double ud_box(const Eigen::Vector3d &point) const {\n static_assert(DIM == 3, \"Dimension must be 3 (I think...)\");\n using Vec3 = Eigen::Vector3d;\n const Vec3 pc = point - center();\n const Vec3 b = upper() - center();\n return (pc.cwiseAbs() - b).cwiseMax(Vec3::Zero()).norm();\n }\n\n const Vec &lower() const {\n return lower_;\n }\n\n const Vec &upper() const {\n return upper_;\n }\n\n private:\n Vec lower_ = Vec::Ones() * std::numeric_limits<double>::max();\n Vec upper_ = Vec::Ones() * std::numeric_limits<double>::lowest();\n};\n} \/\/ namespace spatial\n} \/\/ namespace geometry\n<commit_msg>Fix reference to intersection header in bounding box<commit_after>#pragma once\n\n#include \"geometry\/shapes\/ray.hh\"\n#include \"geometry\/spatial\/intersection.hh\"\n\n#include \"eigen.hh\"\n\n#include <limits>\n\nnamespace geometry {\nnamespace spatial {\n\n\/\/ Axis aligned bounding box, with some nice geometric helpers.\ntemplate <int DIM = 3, typename Scalar = double>\nclass BoundingBox {\n public:\n using Vec = Eigen::Matrix<Scalar, DIM, 1>;\n\n \/\/ Expand to contain a point\n void expand(const Vec &point) {\n lower_ = lower_.cwiseMin(point);\n upper_ = upper_.cwiseMax(point);\n }\n\n \/\/ Expand to contain another axis-aligned bounding box\n void expand(const BoundingBox<DIM> &box) {\n expand(box.lower());\n expand(box.upper());\n }\n\n bool contains(const Vec &point) const {\n return (point.array() < upper_.array()).all() &&\n (point.array() > lower_.array()).all();\n }\n\n Vec center() const {\n return (upper_ + lower_) * 0.5;\n }\n\n double surface_area() const {\n static_assert(DIM == 3, \"Dimension must be 3 because how do I higher dimensions?\");\n const Vec delta = upper_ - lower_;\n double sa = 0.0;\n for (int i = 0; i < DIM; ++i) {\n sa += 2.0 * delta(i) * delta((i + 1) % DIM);\n }\n return sa;\n }\n\n \/\/ Compute an intersection using the slab method\n Intersection intersect(const Ray &ray) const {\n static_assert(DIM == 3, \"Dimension must be 3 because rays are of dim 3 so\");\n\n double max_t_near = std::numeric_limits<double>::lowest();\n double min_t_far = std::numeric_limits<double>::max();\n\n for (int i = 0; i < DIM; ++i) {\n \/\/ Note: We're really just trying to avoid denormals, in principle the operations\n \/\/ that follow are permissible for arbitrary nonzero floats\n constexpr double EPS = 1e-10;\n if (std::abs(ray.direction(i)) < EPS) {\n if (ray.origin(i) < lower_(i) || ray.origin(i) > upper_(i)) {\n return {-1.0, false};\n }\n }\n\n const double inv_direction_i = 1.0 \/ ray.direction(i);\n const double t1 = (lower_(i) - ray.origin(i)) * inv_direction_i;\n const double t2 = (upper_(i) - ray.origin(i)) * inv_direction_i;\n\n const double t_near = std::min(t1, t2);\n const double t_far = std::max(t1, t2);\n\n max_t_near = std::max(max_t_near, t_near);\n min_t_far = std::min(min_t_far, t_far);\n }\n\n Intersection intersection;\n if (contains(ray.origin)) {\n intersection.intersected = true;\n intersection.distance = min_t_far;\n } else {\n intersection.intersected = (max_t_near < min_t_far) && max_t_near >= 0.0;\n intersection.distance = max_t_near;\n }\n return intersection;\n }\n\n Eigen::Vector3d nearest_point(const Eigen::Vector3d &point) const {\n static_assert(DIM == 3, \"Dimension must be 3 (I think...)\");\n using Vec3 = Eigen::Vector3d;\n const Vec3 pc = point - center();\n const Vec3 b = upper() - center();\n const Vec3 abs_pt = (pc.cwiseAbs() - b).cwiseMax(Vec3::Zero());\n return point - (abs_pt.array() * pc.cwiseSign().array()).matrix();\n }\n\n double ud_box(const Eigen::Vector3d &point) const {\n static_assert(DIM == 3, \"Dimension must be 3 (I think...)\");\n using Vec3 = Eigen::Vector3d;\n const Vec3 pc = point - center();\n const Vec3 b = upper() - center();\n return (pc.cwiseAbs() - b).cwiseMax(Vec3::Zero()).norm();\n }\n\n const Vec &lower() const {\n return lower_;\n }\n\n const Vec &upper() const {\n return upper_;\n }\n\n private:\n Vec lower_ = Vec::Ones() * std::numeric_limits<double>::max();\n Vec upper_ = Vec::Ones() * std::numeric_limits<double>::lowest();\n};\n} \/\/ namespace spatial\n} \/\/ namespace geometry\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#include \"cnttransformname.h\"\n\n#include <QDebug>\n\nQList<CContactItemField *> CntTransformName::transformDetailL(const QContactDetail &detail)\n{\n if(detail.definitionName() != QContactName::DefinitionName)\n User::Leave(KErrArgument);\n\n QList<CContactItemField *> fieldList;\n\n \/\/cast to name\n const QContactName &name(static_cast<const QContactName&>(detail));\n\n \/\/create new fields without contexts\n transformToTextFieldL(name, fieldList, name.prefix(), KUidContactFieldPrefixName, KUidContactFieldVCardMapUnusedN, false);\n transformToTextFieldL(name, fieldList, name.firstName(), KUidContactFieldGivenName, KUidContactFieldVCardMapUnusedN, false);\n transformToTextFieldL(name, fieldList, name.middleName(), KUidContactFieldAdditionalName, KUidContactFieldVCardMapUnusedN, false);\n transformToTextFieldL(name, fieldList, name.lastName(), KUidContactFieldFamilyName, KUidContactFieldVCardMapUnusedN, false);\n transformToTextFieldL(name, fieldList, name.suffix(), KUidContactFieldSuffixName, KUidContactFieldVCardMapUnusedN, false);\n transformToTextFieldL(name, fieldList, name.customLabel(), KUidContactFieldTemplateLabel, KUidContactFieldVCardMapUnusedN, false);\n\n return fieldList;\n}\n\n\nQContactDetail *CntTransformName::transformItemField(const CContactItemField& field, const QContact &contact)\n{\n QContactName *name = new QContactName(contact.detail<QContactName>());\n\n CContactTextField* storage = field.TextStorage();\n QString nameValue = QString::fromUtf16(storage->Text().Ptr(), storage->Text().Length());\n\n for (int i = 0; i < field.ContentType().FieldTypeCount(); i++) {\n \/\/Prefix\n if (field.ContentType().FieldType(i) == KUidContactFieldPrefixName) {\n name->setPrefix(nameValue);\n }\n \/\/First name\n else if (field.ContentType().FieldType(i) == KUidContactFieldGivenName) {\n name->setFirstName(nameValue);\n }\n \/\/Middle name\n else if (field.ContentType().FieldType(i) == KUidContactFieldAdditionalName) {\n name->setMiddleName(nameValue);\n }\n \/\/Last name\n else if (field.ContentType().FieldType(i) == KUidContactFieldFamilyName) {\n name->setLastName(nameValue);\n }\n \/\/Suffix\n else if (field.ContentType().FieldType(i) == KUidContactFieldSuffixName) {\n name->setSuffix(nameValue);\n }\n \/\/ custom label\n else if (field.ContentType().FieldType(i) == KUidContactFieldTemplateLabel) {\n name->setCustomLabel(nameValue);\n }\n }\n\n return name;\n}\n\nbool CntTransformName::supportsField(TUint32 fieldType) const\n{\n bool ret = false;\n if (fieldType == KUidContactFieldPrefixName.iUid\n || fieldType == KUidContactFieldGivenName.iUid\n || fieldType == KUidContactFieldAdditionalName.iUid\n || fieldType == KUidContactFieldFamilyName.iUid\n || fieldType == KUidContactFieldSuffixName.iUid\n || fieldType == KUidContactFieldTemplateLabel.iUid ) {\n ret = true;\n }\n return ret;\n}\n\nbool CntTransformName::supportsDetail(QString detailName) const\n{\n bool ret = false;\n if (detailName == QContactName::DefinitionName) {\n ret = true;\n }\n return ret;\n}\n\nQList<TUid> CntTransformName::supportedSortingFieldTypes(QString detailFieldName) const\n{\n QList<TUid> uids;\n\n if (detailFieldName == QContactName::FieldPrefix)\n return uids << KUidContactFieldPrefixName;\n\n if (detailFieldName == QContactName::FieldFirst)\n return uids << KUidContactFieldGivenName;\n\n if (detailFieldName == QContactName::FieldMiddle)\n return uids << KUidContactFieldAdditionalName;\n\n if (detailFieldName == QContactName::FieldLast)\n return uids << KUidContactFieldFamilyName;\n\n if (detailFieldName == QContactName::FieldSuffix)\n return uids << KUidContactFieldSuffixName;\n\n if (detailFieldName == QContactName::FieldCustomLabel)\n return uids << KUidContactFieldTemplateLabel;\n\n return uids;\n}\n\n\/*!\n * Checks whether the subtype is supported\n *\n * \\a subType The subtype to be checked\n * \\return True if this subtype is supported\n *\/\nbool CntTransformName::supportsSubType(const QString& subType) const\n{\n Q_UNUSED(subType);\n return false;\n}\n\n\/*!\n * Returns the filed id corresponding to a field\n *\n * \\a fieldName The name of the supported field\n * \\return fieldId for the fieldName, 0 if not supported\n *\/\nquint32 CntTransformName::getIdForField(const QString& fieldName) const\n{\n if (QContactName::FieldPrefix == fieldName)\n return KUidContactFieldPrefixName.iUid;\n else if (QContactName::FieldFirst == fieldName)\n return KUidContactFieldGivenName.iUid;\n else if (QContactName::FieldMiddle == fieldName)\n return KUidContactFieldAdditionalName.iUid;\n else if (QContactName::FieldLast == fieldName)\n return KUidContactFieldFamilyName.iUid;\n else if (QContactName::FieldSuffix == fieldName)\n return KUidContactFieldSuffixName.iUid;\n else if (QContactName::FieldCustomLabel == fieldName)\n return KUidContactFieldTemplateLabel.iUid;\n else\n return 0;\n}\n\n\/*!\n * Modifies the detail definitions. The default detail definitions are\n * queried from QContactManagerEngine::schemaDefinitions and then modified\n * with this function in the transform leaf classes.\n *\n * \\a definitions The detail definitions to modify.\n * \\a contactType The contact type the definitions apply for.\n *\/\nvoid CntTransformName::detailDefinitions(QMap<QString, QContactDetailDefinition> &definitions, const QString& contactType) const\n{\n if(definitions.contains(QContactName::DefinitionName)) {\n QContactDetailDefinition d = definitions.value(QContactName::DefinitionName);\n QMap<QString, QContactDetailFieldDefinition> fields = d.fields();\n\n \/\/ groups support only custom label\n if(contactType == QContactType::TypeGroup) {\n fields.remove(QContactName::FieldPrefix);\n fields.remove(QContactName::FieldFirst);\n fields.remove(QContactName::FieldMiddle);\n fields.remove(QContactName::FieldLast);\n fields.remove(QContactName::FieldSuffix);\n } else {\n \/\/ Note: Custom labels cannot be enabled for a contact in pre-10.1\n \/\/ platforms because setting custom label for a contact causes\n \/\/ issues for S60 Phonebook editor. If custom label support is\n \/\/ needed in 10.1 or later, it needs to be variated away from\n \/\/ pre-10.1 platforms.\n fields.remove(QContactName::FieldCustomLabel);\n }\n\n \/\/ Context not supported in symbian back-end, remove\n fields.remove(QContactName::FieldContext);\n\n d.setFields(fields);\n d.setUnique(true);\n\n \/\/ Replace original definitions\n definitions.insert(d.name(), d);\n }\n}\n<commit_msg>Fixing contact saving with custom label in symbian backend<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#include \"cnttransformname.h\"\n\n#include <QDebug>\n\nQList<CContactItemField *> CntTransformName::transformDetailL(const QContactDetail &detail)\n{\n if(detail.definitionName() != QContactName::DefinitionName)\n User::Leave(KErrArgument);\n\n QList<CContactItemField *> fieldList;\n\n \/\/cast to name\n const QContactName &name(static_cast<const QContactName&>(detail));\n\n \/\/create new fields without contexts\n transformToTextFieldL(name, fieldList, name.prefix(), KUidContactFieldPrefixName, KUidContactFieldVCardMapUnusedN, false);\n transformToTextFieldL(name, fieldList, name.firstName(), KUidContactFieldGivenName, KUidContactFieldVCardMapUnusedN, false);\n transformToTextFieldL(name, fieldList, name.middleName(), KUidContactFieldAdditionalName, KUidContactFieldVCardMapUnusedN, false);\n transformToTextFieldL(name, fieldList, name.lastName(), KUidContactFieldFamilyName, KUidContactFieldVCardMapUnusedN, false);\n transformToTextFieldL(name, fieldList, name.suffix(), KUidContactFieldSuffixName, KUidContactFieldVCardMapUnusedN, false);\n transformToTextFieldL(name, fieldList, name.customLabel(), KUidContactFieldTemplateLabel, KUidContactFieldVCardMapUnusedN, false);\n\n return fieldList;\n}\n\n\nQContactDetail *CntTransformName::transformItemField(const CContactItemField& field, const QContact &contact)\n{\n QContactName *name = new QContactName(contact.detail<QContactName>());\n\n CContactTextField* storage = field.TextStorage();\n QString nameValue = QString::fromUtf16(storage->Text().Ptr(), storage->Text().Length());\n\n for (int i = 0; i < field.ContentType().FieldTypeCount(); i++) {\n \/\/Prefix\n if (field.ContentType().FieldType(i) == KUidContactFieldPrefixName) {\n name->setPrefix(nameValue);\n }\n \/\/First name\n else if (field.ContentType().FieldType(i) == KUidContactFieldGivenName) {\n name->setFirstName(nameValue);\n }\n \/\/Middle name\n else if (field.ContentType().FieldType(i) == KUidContactFieldAdditionalName) {\n name->setMiddleName(nameValue);\n }\n \/\/Last name\n else if (field.ContentType().FieldType(i) == KUidContactFieldFamilyName) {\n name->setLastName(nameValue);\n }\n \/\/Suffix\n else if (field.ContentType().FieldType(i) == KUidContactFieldSuffixName) {\n name->setSuffix(nameValue);\n }\n \/\/ custom label\n else if (field.ContentType().FieldType(i) == KUidContactFieldTemplateLabel) {\n name->setCustomLabel(nameValue);\n }\n }\n\n return name;\n}\n\nbool CntTransformName::supportsField(TUint32 fieldType) const\n{\n bool ret = false;\n if (fieldType == KUidContactFieldPrefixName.iUid\n || fieldType == KUidContactFieldGivenName.iUid\n || fieldType == KUidContactFieldAdditionalName.iUid\n || fieldType == KUidContactFieldFamilyName.iUid\n || fieldType == KUidContactFieldSuffixName.iUid\n || fieldType == KUidContactFieldTemplateLabel.iUid ) {\n ret = true;\n }\n return ret;\n}\n\nbool CntTransformName::supportsDetail(QString detailName) const\n{\n bool ret = false;\n if (detailName == QContactName::DefinitionName) {\n ret = true;\n }\n return ret;\n}\n\nQList<TUid> CntTransformName::supportedSortingFieldTypes(QString detailFieldName) const\n{\n QList<TUid> uids;\n\n if (detailFieldName == QContactName::FieldPrefix)\n return uids << KUidContactFieldPrefixName;\n\n if (detailFieldName == QContactName::FieldFirst)\n return uids << KUidContactFieldGivenName;\n\n if (detailFieldName == QContactName::FieldMiddle)\n return uids << KUidContactFieldAdditionalName;\n\n if (detailFieldName == QContactName::FieldLast)\n return uids << KUidContactFieldFamilyName;\n\n if (detailFieldName == QContactName::FieldSuffix)\n return uids << KUidContactFieldSuffixName;\n\n if (detailFieldName == QContactName::FieldCustomLabel)\n return uids << KUidContactFieldTemplateLabel;\n\n return uids;\n}\n\n\/*!\n * Checks whether the subtype is supported\n *\n * \\a subType The subtype to be checked\n * \\return True if this subtype is supported\n *\/\nbool CntTransformName::supportsSubType(const QString& subType) const\n{\n Q_UNUSED(subType);\n return false;\n}\n\n\/*!\n * Returns the filed id corresponding to a field\n *\n * \\a fieldName The name of the supported field\n * \\return fieldId for the fieldName, 0 if not supported\n *\/\nquint32 CntTransformName::getIdForField(const QString& fieldName) const\n{\n if (QContactName::FieldPrefix == fieldName)\n return KUidContactFieldPrefixName.iUid;\n else if (QContactName::FieldFirst == fieldName)\n return KUidContactFieldGivenName.iUid;\n else if (QContactName::FieldMiddle == fieldName)\n return KUidContactFieldAdditionalName.iUid;\n else if (QContactName::FieldLast == fieldName)\n return KUidContactFieldFamilyName.iUid;\n else if (QContactName::FieldSuffix == fieldName)\n return KUidContactFieldSuffixName.iUid;\n else if (QContactName::FieldCustomLabel == fieldName)\n return KUidContactFieldTemplateLabel.iUid;\n else\n return 0;\n}\n\n\/*!\n * Modifies the detail definitions. The default detail definitions are\n * queried from QContactManagerEngine::schemaDefinitions and then modified\n * with this function in the transform leaf classes.\n *\n * \\a definitions The detail definitions to modify.\n * \\a contactType The contact type the definitions apply for.\n *\/\nvoid CntTransformName::detailDefinitions(QMap<QString, QContactDetailDefinition> &definitions, const QString& contactType) const\n{\n if(definitions.contains(QContactName::DefinitionName)) {\n QContactDetailDefinition d = definitions.value(QContactName::DefinitionName);\n QMap<QString, QContactDetailFieldDefinition> fields = d.fields();\n\n \/\/ groups support only custom label\n if(contactType == QContactType::TypeGroup) {\n fields.remove(QContactName::FieldPrefix);\n fields.remove(QContactName::FieldFirst);\n fields.remove(QContactName::FieldMiddle);\n fields.remove(QContactName::FieldLast);\n fields.remove(QContactName::FieldSuffix);\n } else {\n \/\/ Note: Custom labels cannot be enabled for a contact in pre-10.1\n \/\/ platforms because setting custom label for a contact causes\n \/\/ issues for S60 Phonebook editor. If custom label support is\n \/\/ needed in 10.1 or later, it needs to be variated away from\n \/\/ pre-10.1 platforms.\n#ifndef SYMBIAN_BACKEND_USE_SQLITE \n fields.remove(QContactName::FieldCustomLabel);\n#endif \n }\n\n \/\/ Context not supported in symbian back-end, remove\n fields.remove(QContactName::FieldContext);\n\n d.setFields(fields);\n d.setUnique(true);\n\n \/\/ Replace original definitions\n definitions.insert(d.name(), d);\n }\n}\n<|endoftext|>"} {"text":"<commit_before>#include \"Host.h\"\n#include <math.h> \/\/ ceil\n\nstatic const int INITIAL_WINDOW_SIZE = 0; \/\/ TODO: change this number\nstatic const int DATA_PKT_SIZE = 1; \/\/ TODO: change this number\n\nHost::Host(CongestionAlg congestion_algorithm , Link& host_link, float rt) : my_link(host_link)\n{\n window_size = INITIAL_WINDOW_SIZE;\n congestion_alg = congestion_algorithm;\n my_link = host_link;\n packet_id = 0;\n unack_packets = 0;\n RTO = rt;\n}\n\nvoid Host::addFlow(std::string dest, float data_size)\n{\n float temp_num_pkts = data_size \/ DATA_PKT_SIZE;\n int num_packets = (int) ceil(temp_num_pkts);\n \n std::queue<Packet> flow;\n \n for (int count = 0; count < num_packets; count++){\n std::string pack_id = this->uuid + std::to_string(packet_id);\n Packet new_packet(pack_id, dest, this->uuid, DATA_PKT_SIZE, false, false, count+1);\n flow.push(new_packet);\n packet_id++;\n }\n \n packet_queue.addQueue(flow);\n}\n\nvoid Host::sendPacket(Packet new_pack, int time_now)\n{\n \/\/ Insert packet to the eventHeap\n PacketEvent packet_event = PacketEvent(new_pack, new_pack.final_dest, new_pack.source, time_now);\n eventHeap.push(packet_event);\n \n \/\/ Insert to the eventHeap an event which is triggered once a packet has timed out\n UnackEvent unack_event = UnackEvent(new_pack, this->getId(), this->getId(), time_now + RTO);\n eventHeap.push(unack_event);\n \n unacknowledged_packets.insert(new_pack.uuid);\n unack_packets++;\n}\n\nvoid Host::giveEvent(std::unique_ptr<FlowEvent> flow_event)\n{\n \/\/ Create queue of packets for host to make events out of\n addFlow(flow_event->destination, flow_event->data_size);\n \n \/\/ Create PacketEvents based on queue of packets based on\n \/\/ number of unacknowledged packets\n int num_events = window_size - unack_packets;\n float time_now = flow_event->eventTime();\n \/\/ push PacketEvents onto eventheap\n for (int pck = 1; pck <= num_events; pck++) {\n Packet new_pack = packet_queue.pop();\n time_now += float(new_pack.size) \/ throughput;\n sendPacket(new_pack, time_now);\n }\n}\n\nvoid Host::giveEvent(std::unique_ptr<UnackEvent> unack_event)\n{\n Packet new_pack = unack_event->packet;\n \n \/\/ Check if packet has been acknowledged, if not resend\n if (unacknowledged_packets.count(new_pack.uuid) != 0)\n sendPacket(new_pack, unack_event->eventTime());\n}\n\nvoid Host::giveEvent(std::unique_ptr<PacketEvent> new_event)\n{\n Packet pkt = new_event->packet;\n \n if (pkt.ack)\n {\n unack_packets--;\n unacknowledged_packets.erase(pkt.uuid);\n\n Packet new_packet = new_event->packet;\n std::string source = new_event->source;\n float now = new_event->eventTime();\n int test;\n }\n}\n\n<commit_msg>test2<commit_after>#include \"Host.h\"\n#include <math.h> \/\/ ceil\n \nstatic const int INITIAL_WINDOW_SIZE = 0; \/\/ TODO: change this number\nstatic const int DATA_PKT_SIZE = 1; \/\/ TODO: change this number\n\nHost::Host(CongestionAlg congestion_algorithm , Link& host_link, float rt) : my_link(host_link)\n{\n window_size = INITIAL_WINDOW_SIZE;\n congestion_alg = congestion_algorithm;\n my_link = host_link;\n packet_id = 0;\n unack_packets = 0;\n RTO = rt;\n}\n\nvoid Host::addFlow(std::string dest, float data_size)\n{\n float temp_num_pkts = data_size \/ DATA_PKT_SIZE;\n int num_packets = (int) ceil(temp_num_pkts);\n \n std::queue<Packet> flow;\n \n for (int count = 0; count < num_packets; count++){\n std::string pack_id = this->uuid + std::to_string(packet_id);\n Packet new_packet(pack_id, dest, this->uuid, DATA_PKT_SIZE, false, false, count+1);\n flow.push(new_packet);\n packet_id++;\n }\n \n packet_queue.addQueue(flow);\n}\n\nvoid Host::sendPacket(Packet new_pack, int time_now)\n{\n \/\/ Insert packet to the eventHeap\n PacketEvent packet_event = PacketEvent(new_pack, new_pack.final_dest, new_pack.source, time_now);\n eventHeap.push(packet_event);\n \n \/\/ Insert to the eventHeap an event which is triggered once a packet has timed out\n UnackEvent unack_event = UnackEvent(new_pack, this->getId(), this->getId(), time_now + RTO);\n eventHeap.push(unack_event);\n \n unacknowledged_packets.insert(new_pack.uuid);\n unack_packets++;\n}\n\nvoid Host::giveEvent(std::unique_ptr<FlowEvent> flow_event)\n{\n \/\/ Create queue of packets for host to make events out of\n addFlow(flow_event->destination, flow_event->data_size);\n \n \/\/ Create PacketEvents based on queue of packets based on\n \/\/ number of unacknowledged packets\n int num_events = window_size - unack_packets;\n float time_now = flow_event->eventTime();\n \/\/ push PacketEvents onto eventheap\n for (int pck = 1; pck <= num_events; pck++) {\n Packet new_pack = packet_queue.pop();\n time_now += float(new_pack.size) \/ throughput;\n sendPacket(new_pack, time_now);\n }\n}\n\nvoid Host::giveEvent(std::unique_ptr<UnackEvent> unack_event)\n{\n Packet new_pack = unack_event->packet;\n \n \/\/ Check if packet has been acknowledged, if not resend\n if (unacknowledged_packets.count(new_pack.uuid) != 0)\n sendPacket(new_pack, unack_event->eventTime());\n}\n\nvoid Host::giveEvent(std::unique_ptr<PacketEvent> new_event)\n{\n Packet pkt = new_event->packet;\n \n if (pkt.ack)\n {\n unack_packets--;\n unacknowledged_packets.erase(pkt.uuid);\n\n Packet new_packet = new_event->packet;\n std::string source = new_event->source;\n float now = new_event->eventTime();\n int test;\n }\n}\n\n<|endoftext|>"} {"text":"<commit_before>\/***********************************************************************************************************************\n **\n ** Copyright (c) 2011, 2014 ETH Zurich\n ** All rights reserved.\n **\n ** Redistribution and use in source and binary forms, with or without modification, are permitted provided that the\n ** following conditions are met:\n **\n ** * Redistributions of source code must retain the above copyright notice, this list of conditions and the\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#include \"OverlayGroup.h\"\n\n#include \"OverlayAccessor.h\"\n#include \"..\/items\/Item.h\"\n#include \"..\/Scene.h\"\n\nnamespace Visualization {\n\nOverlayGroup::~OverlayGroup()\n{\n\tfor (auto & overlay : overlays_) SAFE_DELETE(overlay);\n}\n\nOverlayGroup::OverlayGroup(Scene* scene, QString name) : scene_{scene}, name_{name}\n{\n\tQ_ASSERT(scene);\n\tQ_ASSERT(!name.isEmpty());\n}\n\nvoid OverlayGroup::hide()\n{\n\thidden_ = true;\n\tfor (auto& o : overlays_) o->overlayItem()->hide();\n}\n\nvoid OverlayGroup::show()\n{\n\thidden_ = false;\n\tfor (auto& o : overlays_) o->overlayItem()->show();\n}\n\nvoid OverlayGroup::addOverlay(OverlayAccessor* overlay)\n{\n\toverlays_.append(overlay);\n\toverlay->overlayItem()->setUpdateNeeded(Item::StandardUpdate);\n\tif (hidden_) overlay->overlayItem()->hide();\n\n\tscene_->addItem(overlay->overlayItem());\n\tscene_->scheduleUpdate();\n}\n\nbool OverlayGroup::removeOverlay(OverlayAccessor* overlay)\n{\n\treturn removeOverlay(std::find(overlays_.begin(), overlays_.end(), overlay));\n}\n\nbool OverlayGroup::removeOverlay(Item* overlay)\n{\n\treturn removeOverlay( std::find_if(overlays_.begin(), overlays_.end(),\n\t\t\t[=](OverlayAccessor* o){return o->overlayItem() == overlay;}));\n}\n\nbool OverlayGroup::removeOverlayOf(Item* itemWithOverlay)\n{\n\treturn removeOverlay( std::find_if(overlays_.begin(), overlays_.end(),\n\t\t\t[=](OverlayAccessor* o){return o->associatedItems().contains(itemWithOverlay);}));\n}\n\nbool OverlayGroup::removeOverlay(QList<OverlayAccessor*>::iterator it)\n{\n\tif (it != overlays_.end())\n\t{\n\t\tSAFE_DELETE(*it);\n\t\toverlays_.erase(it);\n\t\tscene_->scheduleUpdate();\n\t\treturn true;\n\t}\n\telse return false;\n}\n\nvoid OverlayGroup::clear()\n{\n\tfor (auto& overlay : overlays_) SAFE_DELETE(overlay);\n\toverlays_.clear();\n}\n\nvoid OverlayGroup::setDynamic1Item(ItemGetter1Item getter)\n{\n\titemGetterFunction1_ = getter;\n}\n\nvoid OverlayGroup::setDynamic2Items(ItemGetter2Items getter)\n{\n\titemGetterFunction2_ = getter;\n}\n\nvoid OverlayGroup::setOverlayConstructor1Arg(OverlayConstructor1Arg constructor)\n{\n\tconstructorFunction1_ = constructor;\n}\n\nvoid OverlayGroup::setOverlayConstructor2Args(OverlayConstructor2Args constructor)\n{\n\tconstructorFunction2_ = constructor;\n}\n\nvoid OverlayGroup::setPostUpdateFunction(PostUpdateFunction function)\n{\n\tpostUpdateFunction_ = function;\n}\n\nvoid OverlayGroup::addOverlayFor(Item* item)\n{\n\taddOverlay(constructorFunction1_(item));\n}\n\nvoid OverlayGroup::addOverlayFor(Item* item1, Item* item2)\n{\n\taddOverlay(constructorFunction2_(item1, item2));\n}\n\nQList<OverlayAccessor*> OverlayGroup::overlaysForItem(const Item* item) const\n{\n\tQ_ASSERT(item);\n\tQList<OverlayAccessor*> result;\n\tfor (auto accessor: overlays_)\n\t\tif (accessor->associatedItems().contains(const_cast<Item* const>(item))) \/\/ TODO: is this really the best way?\n\t\t\tresult << accessor;\n\treturn result;\n}\n\nvoid OverlayGroup::update()\n{\n\tif (!hidden_)\n\t{\n\t\tif (itemGetterFunction1_)\n\t\t{\n\t\t\tQ_ASSERT(constructorFunction1_);\n\t\t\tItem::synchronizeCollections(nullptr, itemGetterFunction1_(), overlays_,\n\t\t\t\t\t[](Item* itemToOverlay, OverlayAccessor* overlay)\n\t\t\t\t\t{\n\t\t\t\t\t\treturn itemToOverlay == overlay->associatedItems().first();\n\t\t\t\t\t},\n\t\t\t\t\t[this](Item*, Item* itemToOverlay)\n\t\t\t\t\t{\n\t\t\t\t\t\tauto overlay = constructorFunction1_(itemToOverlay);\n\t\t\t\t\t\tQ_ASSERT(overlay);\n\t\t\t\t\t\tscene_->addItem(overlay->overlayItem());\n\t\t\t\t\t\treturn overlay;\n\t\t\t\t\t},\n\t\t\t\t\t[](Item*, Item*, OverlayAccessor*) {return false;}\n\t\t\t\t\t);\n\t\t}\n\n\t\tif (itemGetterFunction2_)\n\t\t{\n\t\t\tQ_ASSERT(constructorFunction2_);\n\t\t\tItem::synchronizeCollections(nullptr, itemGetterFunction2_(), overlays_,\n\t\t\t\t\t[](const QPair<Item*, Item*>& pair, OverlayAccessor* overlay)\n\t\t\t\t\t{\n\t\t\t\t\t\treturn overlay->associatedItems().size() == 2\n\t\t\t\t\t\t\t\t&& pair.first == overlay->associatedItems().first()\n\t\t\t\t\t\t\t\t&& pair.second == overlay->associatedItems().at(1);\n\t\t\t\t\t},\n\t\t\t\t\t[this](Item*, const QPair<Item*, Item*>& pair)\n\t\t\t\t\t{\n\t\t\t\t\t\tauto overlay = constructorFunction2_(pair.first, pair.second);\n\t\t\t\t\t\tQ_ASSERT(overlay);\n\t\t\t\t\t\tscene_->addItem(overlay->overlayItem());\n\t\t\t\t\t\treturn overlay;\n\t\t\t\t\t},\n\t\t\t\t\t[](Item*, const QPair<Item*, Item*>&, OverlayAccessor*){return false;}\n\t\t\t\t\t);\n\t\t}\n\n\t\tfor (auto& overlay : overlays_)\n\t\t{\n\t\t\toverlay->overlayItem()->setUpdateNeeded(Item::StandardUpdate);\n\t\t\toverlay->overlayItem()->updateSubtree();\n\t\t}\n\n\t\tif (postUpdateFunction_) postUpdateFunction_(*this);\n\t}\n}\n\n} \/* namespace Visualization *\/\n<commit_msg>Fix overlays remaining on screen after switching views<commit_after>\/***********************************************************************************************************************\n **\n ** Copyright (c) 2011, 2014 ETH Zurich\n ** All rights reserved.\n **\n ** Redistribution and use in source and binary forms, with or without modification, are permitted provided that the\n ** following conditions are met:\n **\n ** * Redistributions of source code must retain the above copyright notice, this list of conditions and the\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#include \"OverlayGroup.h\"\n\n#include \"OverlayAccessor.h\"\n#include \"..\/items\/Item.h\"\n#include \"..\/Scene.h\"\n\nnamespace Visualization {\n\nOverlayGroup::~OverlayGroup()\n{\n\tfor (auto & overlay : overlays_) SAFE_DELETE(overlay);\n}\n\nOverlayGroup::OverlayGroup(Scene* scene, QString name) : scene_{scene}, name_{name}\n{\n\tQ_ASSERT(scene);\n\tQ_ASSERT(!name.isEmpty());\n}\n\nvoid OverlayGroup::hide()\n{\n\thidden_ = true;\n\tfor (auto& o : overlays_) o->overlayItem()->hide();\n}\n\nvoid OverlayGroup::show()\n{\n\thidden_ = false;\n\tfor (auto& o : overlays_) o->overlayItem()->show();\n}\n\nvoid OverlayGroup::addOverlay(OverlayAccessor* overlay)\n{\n\toverlays_.append(overlay);\n\toverlay->overlayItem()->setUpdateNeeded(Item::StandardUpdate);\n\tif (hidden_) overlay->overlayItem()->hide();\n\n\tscene_->addItem(overlay->overlayItem());\n\tscene_->scheduleUpdate();\n}\n\nbool OverlayGroup::removeOverlay(OverlayAccessor* overlay)\n{\n\treturn removeOverlay(std::find(overlays_.begin(), overlays_.end(), overlay));\n}\n\nbool OverlayGroup::removeOverlay(Item* overlay)\n{\n\treturn removeOverlay( std::find_if(overlays_.begin(), overlays_.end(),\n\t\t\t[=](OverlayAccessor* o){return o->overlayItem() == overlay;}));\n}\n\nbool OverlayGroup::removeOverlayOf(Item* itemWithOverlay)\n{\n\treturn removeOverlay( std::find_if(overlays_.begin(), overlays_.end(),\n\t\t\t[=](OverlayAccessor* o){return o->associatedItems().contains(itemWithOverlay);}));\n}\n\nbool OverlayGroup::removeOverlay(QList<OverlayAccessor*>::iterator it)\n{\n\tif (it != overlays_.end())\n\t{\n\t\tSAFE_DELETE(*it);\n\t\toverlays_.erase(it);\n\t\tscene_->scheduleUpdate();\n\t\treturn true;\n\t}\n\telse return false;\n}\n\nvoid OverlayGroup::clear()\n{\n\tfor (auto& overlay : overlays_) SAFE_DELETE(overlay);\n\toverlays_.clear();\n}\n\nvoid OverlayGroup::setDynamic1Item(ItemGetter1Item getter)\n{\n\titemGetterFunction1_ = getter;\n}\n\nvoid OverlayGroup::setDynamic2Items(ItemGetter2Items getter)\n{\n\titemGetterFunction2_ = getter;\n}\n\nvoid OverlayGroup::setOverlayConstructor1Arg(OverlayConstructor1Arg constructor)\n{\n\tconstructorFunction1_ = constructor;\n}\n\nvoid OverlayGroup::setOverlayConstructor2Args(OverlayConstructor2Args constructor)\n{\n\tconstructorFunction2_ = constructor;\n}\n\nvoid OverlayGroup::setPostUpdateFunction(PostUpdateFunction function)\n{\n\tpostUpdateFunction_ = function;\n}\n\nvoid OverlayGroup::addOverlayFor(Item* item)\n{\n\taddOverlay(constructorFunction1_(item));\n}\n\nvoid OverlayGroup::addOverlayFor(Item* item1, Item* item2)\n{\n\taddOverlay(constructorFunction2_(item1, item2));\n}\n\nQList<OverlayAccessor*> OverlayGroup::overlaysForItem(const Item* item) const\n{\n\tQ_ASSERT(item);\n\tQList<OverlayAccessor*> result;\n\tfor (auto accessor: overlays_)\n\t\tif (accessor->associatedItems().contains(const_cast<Item* const>(item))) \/\/ TODO: is this really the best way?\n\t\t\tresult << accessor;\n\treturn result;\n}\n\nvoid OverlayGroup::update()\n{\n\tif (!hidden_)\n\t{\n\t\tif (itemGetterFunction1_)\n\t\t{\n\t\t\tQ_ASSERT(constructorFunction1_);\n\t\t\tItem::synchronizeCollections(nullptr, itemGetterFunction1_(), overlays_,\n\t\t\t\t\t[](Item* itemToOverlay, OverlayAccessor* overlay)\n\t\t\t\t\t{\n\t\t\t\t\t\treturn itemToOverlay == overlay->associatedItems().first();\n\t\t\t\t\t},\n\t\t\t\t\t[this](Item*, Item* itemToOverlay)\n\t\t\t\t\t{\n\t\t\t\t\t\tauto overlay = constructorFunction1_(itemToOverlay);\n\t\t\t\t\t\tQ_ASSERT(overlay);\n\t\t\t\t\t\tscene_->addItem(overlay->overlayItem());\n\t\t\t\t\t\treturn overlay;\n\t\t\t\t\t},\n\t\t\t\t\t[](Item*, Item*, OverlayAccessor*) {return false;}\n\t\t\t\t\t);\n\t\t}\n\n\t\tif (itemGetterFunction2_)\n\t\t{\n\t\t\tQ_ASSERT(constructorFunction2_);\n\t\t\tItem::synchronizeCollections(nullptr, itemGetterFunction2_(), overlays_,\n\t\t\t\t\t[](const QPair<Item*, Item*>& pair, OverlayAccessor* overlay)\n\t\t\t\t\t{\n\t\t\t\t\t\treturn overlay->associatedItems().size() == 2\n\t\t\t\t\t\t\t\t&& pair.first == overlay->associatedItems().first()\n\t\t\t\t\t\t\t\t&& pair.second == overlay->associatedItems().at(1);\n\t\t\t\t\t},\n\t\t\t\t\t[this](Item*, const QPair<Item*, Item*>& pair)\n\t\t\t\t\t{\n\t\t\t\t\t\tauto overlay = constructorFunction2_(pair.first, pair.second);\n\t\t\t\t\t\tQ_ASSERT(overlay);\n\t\t\t\t\t\tscene_->addItem(overlay->overlayItem());\n\t\t\t\t\t\treturn overlay;\n\t\t\t\t\t},\n\t\t\t\t\t[](Item*, const QPair<Item*, Item*>&, OverlayAccessor*){return false;}\n\t\t\t\t\t);\n\t\t}\n\n\t\tfor (auto& overlay : overlays_)\n\t\t{\n\t\t\t\/\/ Hide\/show overlays depending on whether their associated items are visible (e.g. when changing views)\n\t\t\tbool allVisible = std::all_of(overlay->associatedItems().begin(), overlay->associatedItems().end(),\n\t\t\t\t\t\t\t\t\t\t\t\t\t[](Item* item) {return item->isVisible();});\n\t\t\tif (allVisible != overlay->overlayItem()->isVisible())\n\t\t\t\toverlay->overlayItem()->setVisible(allVisible);\n\n\t\t\toverlay->overlayItem()->setUpdateNeeded(Item::StandardUpdate);\n\t\t\toverlay->overlayItem()->updateSubtree();\n\t\t}\n\n\t\tif (postUpdateFunction_) postUpdateFunction_(*this);\n\t}\n}\n\n} \/* namespace Visualization *\/\n<|endoftext|>"} {"text":"<commit_before>#ifndef PIXELBOOST_DISABLE_GRAPHICS\n\n#include <algorithm>\n#include <set>\n\n#include \"pixelboost\/graphics\/camera\/camera.h\"\n#include \"pixelboost\/graphics\/camera\/viewport.h\"\n#include \"pixelboost\/graphics\/device\/device.h\"\n#include \"pixelboost\/graphics\/effect\/effect.h\"\n#include \"pixelboost\/graphics\/effect\/manager.h\"\n#include \"pixelboost\/graphics\/renderer\/common\/irenderer.h\"\n#include \"pixelboost\/graphics\/renderer\/common\/renderable.h\"\n#include \"pixelboost\/graphics\/renderer\/common\/renderer.h\"\n\nusing namespace pb;\n\nRenderer* Renderer::Renderer::_Instance = 0;\n\nRenderer::Renderer()\n{\n _Instance = this;\n \n _EffectManager = new EffectManager();\n}\n\nRenderer::~Renderer()\n{\n _Instance = 0;\n}\n\nRenderer* Renderer::Instance()\n{\n return _Instance;\n}\n\nvoid Renderer::Render()\n{\n for (ViewportList::iterator it = _Viewports.begin(); it != _Viewports.end(); ++it)\n {\n (*it)->Render();\n \n FlushBuffer(*it);\n }\n}\n\nEffectManager* Renderer::GetEffectManager()\n{\n return _EffectManager;\n}\n\nvoid Renderer::AddItem(Renderable* renderable)\n{\n _Renderables[renderable->GetLayer()].push_back(renderable);\n}\n\nvoid Renderer::AddViewport(Viewport* viewport)\n{\n _Viewports.push_back(viewport);\n}\n\nvoid Renderer::RemoveViewport(Viewport* viewport)\n{\n for (ViewportList::iterator it = _Viewports.begin(); it != _Viewports.end(); ++it)\n {\n if (*it == viewport)\n {\n _Viewports.erase(it);\n return;\n }\n }\n}\n\nvoid Renderer::SetHandler(int renderableType, IRenderer* renderer)\n{\n _RenderableHandlers[renderableType] = renderer;\n}\n\nvoid Renderer::FlushBuffer(Viewport* viewport)\n{\n for (int i=0; i<8; i++)\n {\n RenderableList& renderables = _Renderables[i];\n \n if (!renderables.size())\n continue;\n \n Uid type = renderables[0]->GetRenderableType();\n Effect* effect = renderables[0]->GetEffect();\n int start = 0;\n int count = 0;\n \n for (int i=0; i < renderables.size(); i++)\n {\n Uid newType = renderables[i]->GetRenderableType();\n Effect* newEffect = renderables[i]->GetEffect();\n \n if (type == newType && effect == newEffect)\n {\n count++;\n } else {\n RenderBatch(viewport, count, &renderables[start], effect);\n start = i;\n count = 1;\n type = newType;\n effect = newEffect;\n }\n }\n \n if (count > 0)\n {\n RenderBatch(viewport, count, &renderables[start], effect);\n }\n }\n \n _Renderables.clear();\n}\n\nvoid Renderer::RenderBatch(Viewport* viewport, int count, Renderable** renderable, Effect* effect)\n{\n if (!effect)\n return;\n \n RenderableHandlerMap::iterator it = _RenderableHandlers.find(renderable[0]->GetRenderableType());\n \n if (it != _RenderableHandlers.end())\n {\n EffectTechnique* technique = effect->GetTechnique(viewport->GetRenderScheme());\n \n if (!technique)\n {\n for (int i=0; i < count; i++)\n {\n technique = viewport->GetTechnique(renderable[i], effect);\n \n if (technique)\n {\n for (int j=0; j<technique->GetNumPasses(); j++)\n {\n EffectPass* pass = technique->GetPass(j);\n pass->Bind();\n it->second->Render(1, &renderable[i], viewport, pass);\n }\n }\n }\n } else\n {\n for (int i=0; i<technique->GetNumPasses(); i++)\n {\n EffectPass* pass = technique->GetPass(i);\n pass->Bind();\n it->second->Render(count, renderable, viewport, pass);\n }\n }\n }\n}\n\n#endif\n<commit_msg>Support up to 16 layers<commit_after>#ifndef PIXELBOOST_DISABLE_GRAPHICS\n\n#include <algorithm>\n#include <set>\n\n#include \"pixelboost\/graphics\/camera\/camera.h\"\n#include \"pixelboost\/graphics\/camera\/viewport.h\"\n#include \"pixelboost\/graphics\/device\/device.h\"\n#include \"pixelboost\/graphics\/effect\/effect.h\"\n#include \"pixelboost\/graphics\/effect\/manager.h\"\n#include \"pixelboost\/graphics\/renderer\/common\/irenderer.h\"\n#include \"pixelboost\/graphics\/renderer\/common\/renderable.h\"\n#include \"pixelboost\/graphics\/renderer\/common\/renderer.h\"\n\nusing namespace pb;\n\nRenderer* Renderer::Renderer::_Instance = 0;\n\nRenderer::Renderer()\n{\n _Instance = this;\n \n _EffectManager = new EffectManager();\n}\n\nRenderer::~Renderer()\n{\n _Instance = 0;\n}\n\nRenderer* Renderer::Instance()\n{\n return _Instance;\n}\n\nvoid Renderer::Render()\n{\n for (ViewportList::iterator it = _Viewports.begin(); it != _Viewports.end(); ++it)\n {\n (*it)->Render();\n \n FlushBuffer(*it);\n }\n}\n\nEffectManager* Renderer::GetEffectManager()\n{\n return _EffectManager;\n}\n\nvoid Renderer::AddItem(Renderable* renderable)\n{\n _Renderables[renderable->GetLayer()].push_back(renderable);\n}\n\nvoid Renderer::AddViewport(Viewport* viewport)\n{\n _Viewports.push_back(viewport);\n}\n\nvoid Renderer::RemoveViewport(Viewport* viewport)\n{\n for (ViewportList::iterator it = _Viewports.begin(); it != _Viewports.end(); ++it)\n {\n if (*it == viewport)\n {\n _Viewports.erase(it);\n return;\n }\n }\n}\n\nvoid Renderer::SetHandler(int renderableType, IRenderer* renderer)\n{\n _RenderableHandlers[renderableType] = renderer;\n}\n\nvoid Renderer::FlushBuffer(Viewport* viewport)\n{\n for (int i=0; i<16; i++)\n {\n RenderableList& renderables = _Renderables[i];\n \n if (!renderables.size())\n continue;\n \n Uid type = renderables[0]->GetRenderableType();\n Effect* effect = renderables[0]->GetEffect();\n int start = 0;\n int count = 0;\n \n for (int i=0; i < renderables.size(); i++)\n {\n Uid newType = renderables[i]->GetRenderableType();\n Effect* newEffect = renderables[i]->GetEffect();\n \n if (type == newType && effect == newEffect)\n {\n count++;\n } else {\n RenderBatch(viewport, count, &renderables[start], effect);\n start = i;\n count = 1;\n type = newType;\n effect = newEffect;\n }\n }\n \n if (count > 0)\n {\n RenderBatch(viewport, count, &renderables[start], effect);\n }\n }\n \n _Renderables.clear();\n}\n\nvoid Renderer::RenderBatch(Viewport* viewport, int count, Renderable** renderable, Effect* effect)\n{\n if (!effect)\n return;\n \n RenderableHandlerMap::iterator it = _RenderableHandlers.find(renderable[0]->GetRenderableType());\n \n if (it != _RenderableHandlers.end())\n {\n EffectTechnique* technique = effect->GetTechnique(viewport->GetRenderScheme());\n \n if (!technique)\n {\n for (int i=0; i < count; i++)\n {\n technique = viewport->GetTechnique(renderable[i], effect);\n \n if (technique)\n {\n for (int j=0; j<technique->GetNumPasses(); j++)\n {\n EffectPass* pass = technique->GetPass(j);\n pass->Bind();\n it->second->Render(1, &renderable[i], viewport, pass);\n }\n }\n }\n } else\n {\n for (int i=0; i<technique->GetNumPasses(); i++)\n {\n EffectPass* pass = technique->GetPass(i);\n pass->Bind();\n it->second->Render(count, renderable, viewport, pass);\n }\n }\n }\n}\n\n#endif\n<|endoftext|>"} {"text":"<commit_before>void AnaJets(Int_t evNumber1=0, Int_t evNumber2=0) \n{\n\/\/*-- Author: Andreas Morsch (CERN)\n\n if (gClassTable->GetID(\"AliRun\") < 0) {\n\tgROOT->LoadMacro(\"..\/macros\/loadlibs.C\");\n\tloadlibs();\n }\n\/\/ Connect the Root Galice file containing Geometry, Kine and Hits\n\n TFile *file = (TFile*)gROOT->GetListOfFiles()->FindObject(\"galice.root\");\n \n if (!file) {\n\tprintf(\"\\n Creating galice.root \\n\");\n\tfile = new TFile(\"galice.root\");\n } else {\n\tprintf(\"\\n galice.root found in file list\");\n }\n\/\/ Get AliRun object from file or create it if not on file\n if (!gAlice) {\n\tgAlice = (AliRun*)(file->Get(\"gAlice\"));\n\tif (gAlice) printf(\"AliRun object found on file\\n\");\n\tif (!gAlice) {\n\t printf(\"\\n create new gAlice object\");\n\t gAlice = new AliRun(\"gAlice\",\"Alice test program\");\n\t}\n }\n\/\/ Book histos \n TH1F *eH = new TH1F(\"eH\",\"Energy\", 150, 0.0, 150.);\n TH1F *etaH = new TH1F(\"eEta\",\"Eta\", 180, -0.9, 0.9);\n TH1F *phiH = new TH1F(\"ePhi\",\"Phi\", 62, -3.1, 3.1);\n \n\n TClonesArray* jets = new TClonesArray(\"AliEMCALJet\",10000);\n\n for (int nev=0; nev<= evNumber2; nev++) {\n\tprintf(\"\\n Event .............%d\", nev);\n\tInt_t nparticles = gAlice->GetEvent(nev);\n\tInt_t nbytes = 0;\n\tAliEMCAL *pEMCAL = (AliEMCAL*) gAlice->GetModule(\"EMCAL\");\n\tif (pEMCAL) {\n\t TTree *TR = gAlice->TreeR();\n\t Int_t nent=TR->GetEntries();\n\t TR->SetBranchAddress(\"Jets\", &jets);\n\t nbytes += TR->GetEntry(0);\n\t Int_t nJet = jets->GetEntries();\n\t printf(\"\\n Number of Jets %d\", nJet);\n\t AliEMCALJet *mJet;\n\t for (Int_t ij=0; ij < nJet; ij++) {\n\t\tmJet = (AliEMCALJet*)jets->UncheckedAt(ij);\n\t\tprintf(\"\\n Jet:%d E %f phi %f eta %f\\n\", ij, \n\t\t mJet->Energy(), mJet->Phi(), mJet->Eta());\n\t\tetaH->Fill(mJet->Eta());\n\t\tphiH->Fill(mJet->Phi());\n\t\teH ->Fill(mJet->Energy());\t\t\n\t } \/\/ jet\n } \/\/ ?EMCAL\n } \/\/ event\n TCanvas *c1 = new TCanvas(\"c1\",\"Canvas 1\",400,10,600,700);\n c1->Divide(2,2);\n c1->cd(1); eH->Draw();\n c1->cd(2); etaH->Draw();\n c1->cd(3); phiH->Draw();\n}\n<commit_msg>Analyse track information.<commit_after>void AnaJets(Int_t evNumber1=0, Int_t evNumber2=0) \n{\n\/\/*-- Author: Andreas Morsch (CERN)\n\n if (gClassTable->GetID(\"AliRun\") < 0) {\n\tgROOT->LoadMacro(\"loadlibs.C\");\n\tloadlibs();\n }\n\/\/ Connect the Root Galice file containing Geometry, Kine and Hits\n \n TFile *file = (TFile*)gROOT->GetListOfFiles()->FindObject(\"galice.root\");\n \n if (!file) {\n\tprintf(\"\\n Creating galice.root \\n\");\n\tfile = new TFile(\"galice.root\");\n } else {\n\tprintf(\"\\n galice.root found in file list\");\n }\n\/\/ Get AliRun object from file or create it if not on file\n if (!gAlice) {\n\tgAlice = (AliRun*)(file->Get(\"gAlice\"));\n\tif (gAlice) printf(\"AliRun object found on file\\n\");\n\tif (!gAlice) {\n\t printf(\"\\n create new gAlice object\");\n\t gAlice = new AliRun(\"gAlice\",\"Alice test program\");\n\t}\n }\n\/\/ Book histos \n TH1F *eH = new TH1F(\"eH\",\"Energy\", 150, 0.0, 150.);\n TH1F *etaH = new TH1F(\"eEta\",\"Eta\", 180, -0.9, 0.9);\n TH1F *phiH = new TH1F(\"ePhi\",\"Phi\", 62, -3.1, 3.1);\n TH1F *tH = new TH1F(\"tH\",\"n tracks\", 30, 0.5, 29.5);\n TH1F *ptH = new TH1F(\"ptH\",\"Track pT\", 100., 0., 100.);\n TH1F *drH = new TH1F(\"drH\",\"Track dR\", 120., 0., 6.); \n \n Float_t phiT[50], etaT[50], ptT[50];\n \n\n TClonesArray* jets = new TClonesArray(\"AliEMCALJet\",10000);\n \n for (int nev=0; nev<= evNumber2; nev++) {\n\tprintf(\"\\n Event .............%d\", nev);\n\tInt_t nparticles = gAlice->GetEvent(nev);\n\tInt_t nbytes = 0;\n\tAliEMCAL *pEMCAL = (AliEMCAL*) gAlice->GetModule(\"EMCAL\");\n\tif (pEMCAL) {\n\t TTree *TR = gAlice->TreeR();\n\t Int_t nent=TR->GetEntries();\n\t TR->SetBranchAddress(\"EMCALJets\", &jets);\n\t nbytes += TR->GetEntry(0);\n\t Int_t nJet = jets->GetEntries();\n\t printf(\"\\n Number of Jets %d\", nJet);\n\t AliEMCALJet *mJet;\n\t for (Int_t ij=0; ij < nJet; ij++) {\n\t\tmJet = (AliEMCALJet*)jets->UncheckedAt(ij);\n\t\tFloat_t eta = mJet->Eta();\n\t\t\n\t\tprintf(\"\\n Jet:%d E %f phi %f eta %f tracks %d\\n\", ij, \n\t\t mJet->Energy(), mJet->Phi(), eta,\n\t\t mJet->NTracks());\n\t\tetaH->Fill(mJet->Eta());\n\t\tphiH->Fill(mJet->Phi());\n\t\tif (TMath::Abs(eta) < 0.4) \n\t\t eH->Fill(mJet->Energy());\n\t\ttH ->Fill((Float_t)mJet->NTracks());\n\t\t\n\t\tmJet->TrackList(ptT, etaT, phiT);\n\t\tfor (Int_t it = 0; it < mJet->NTracks(); it++)\n\t\t{\n\t\t printf(\"\\n Track: %5d pT %8.3f eta %8.3f phi %8.3f\",\n\t\t\t it, ptT[it], etaT[it], phiT[it]);\n\t\t ptH->Fill(ptT[it]);\n\t\t Float_t dPhi = phiT[it]-mJet->Phi();\n\t\t Float_t dEta = etaT[it]-mJet->Eta();\n\t\t Float_t dr = TMath::Sqrt(dPhi*dPhi+dEta*dEta);\n\t\t drH->Fill(dr);\n\t\t}\n\t } \/\/ jet\n } \/\/ ?EMCAL\n } \/\/ event\n TCanvas *c1 = new TCanvas(\"c1\",\"Canvas 1\",400,10,600,700);\n c1->Divide(2,2);\n c1->cd(1); eH->Draw();\n c1->cd(2); etaH->Draw();\n c1->cd(3); phiH->Draw();\n c1->cd(4); tH->Draw();\n\n TCanvas *c2 = new TCanvas(\"c2\",\"Canvas 2\",400,10,600,700);\n c2->Divide(2,2);\n c2->cd(1); ptH->Draw();\n c2->cd(2); drH->Draw();\n}\n\n<|endoftext|>"} {"text":"<commit_before>#include \"Core.hh\"\n#include \"PluginsManager.hh\"\n\/\/#include \"TestEventSystem1.hh\"\n\/\/#include \"TestEventSystem2.hh\"\n\/\/#include \"VulkanRenderer.hh\"\n\nint main()\n{\n\tObake::Core c;\n\t\/\/System::TestEventSystem1 system1;\n\t\/\/System::TestEventSystem2 system2;\n\t\/\/System::VulkanRenderer vulkan;\n\n\t\/\/system1.registerCore(&c);\n\t\/\/system2.registerCore(&c);\n\t\/\/vulkan.registerCore(&c);\n\t\/\/system1.initialize();\n\t\/\/system2.initialize();\n\t\/\/vulkan.initialize();\n\n\t\/\/c.registerSystem(&system1);\n\t\/\/c.registerSystem(&system2);\n\n\t\/\/Obake::SharedLibrary testLib;\n\n\t\/\/if (!testLib.open(\".\\\\Plugins\\\\TestPlugin.dll\"))\n\t\/\/\tstd::cout << \"Failed to open dll\" << std::endl;\n\t\/\/else\n\t\/\/{\n\t\/\/\tObake::PluginInfos* infos;\n\n\t\/\/\ttestLib.sym(\"exports\", reinterpret_cast<void**>(&infos));\n\t\/\/\tstd::cout << \"Plugin Info: \"\n\t\/\/\t\t<< \"\\n\\tAPI Version: \" << infos->apiVersion\n\t\/\/\t\t<< \"\\n\\tFile Name: \" << infos->fileName\n\t\/\/\t\t<< \"\\n\\tClass Name: \" << infos->className\n\t\/\/\t\t<< \"\\n\\tPlugin Name: \" << infos->pluginName\n\t\/\/\t\t<< \"\\n\\tPlugin Version: \" << infos->pluginVersion\n\t\/\/\t\t<< std::endl;\n\t\/\/}\n\n\tObake::PluginsManager pluginsManager;\n\n\tpluginsManager.loadAllAvailablePlugins();\n\tpluginsManager.displayPluginsInfos();\n\tconst std::vector<Obake::AvailablePlugin*>& availablePlugins = pluginsManager.getAllAvailablePlugins();\n\n\tfor (Obake::AvailablePlugin* plugin : availablePlugins)\n\t{\n\t\tif (plugin->isLoaded())\n\t\t{\n\t\t\tc.registerSystem(plugin->getPlugin());\n\t\t\tplugin->getPlugin()->sayHello();\n\t\t}\n\t}\n\n\n\t\/\/ Vulkan tests\n\t\/*\n\t{\n\tauto device = vkRender._device;\n\tauto queue = vkRender._queue;\n\n\t\/\/ SYNCHRONISATION VAR\n\t\/\/ Waits for the GPU to be ready on the CPU side\n\tVkFence fence;\n\t{\n\tVkFenceCreateInfo fenceCreateInfo =\n\t{\n\t\/\/ (MANDATORY) sType is the type of the structure\n\tfenceCreateInfo.sType = VK_STRUCTURE_TYPE_FENCE_CREATE_INFO,\n\t\/\/ (MANDATORY) pNext is NULL or a pointer to an extension-specific structure.\n\tfenceCreateInfo.pNext = nullptr,\n\t\/\/ A flag that defines the initial state and behavior of the fence. Either signaled or unsignaled.\n\tfenceCreateInfo.flags = 0\n\t};\n\tvkCreateFence(device, &fenceCreateInfo, nullptr, &fence);\n\t}\n\n\t\/\/ Tells the GPU when other process in the GPU are completed\n\tVkSemaphore semaphore; \n\t{\n\tVkSemaphoreCreateInfo semaphoreCreateInfo =\n\t{\n\t\/\/ (MANDATORY) sType is the type of the structure\n\tsemaphoreCreateInfo.sType = VK_STRUCTURE_TYPE_SEMAPHORE_CREATE_INFO,\n\t\/\/ (MANDATORY) pNext is NULL or a pointer to an extension-specific structure.\n\tsemaphoreCreateInfo.pNext = nullptr,\n\t\/\/ Flag reserved for future use\n\tsemaphoreCreateInfo.flags = 0\n\t};\n\n\tvkCreateSemaphore(device, &semaphoreCreateInfo, nullptr, &semaphore);\n\t}\n\t\/\/ - - -\n\n\t\/\/ COMMAND BUFFERS\n\tVkCommandPool commandPool;\n\t{\n\tVkCommandPoolCreateInfo poolCreateInfo =\n\t{\n\t\/\/ (MANDATORY) sType is the type of the structure\n\tpoolCreateInfo.sType = VK_STRUCTURE_TYPE_COMMAND_POOL_CREATE_INFO,\n\t\/\/ (MANDATORY) pNext is NULL or a pointer to an extension-specific structure.\n\tpoolCreateInfo.pNext = nullptr,\n\t\/\/ A bitmask indicating usage behavior for the pool and command buffers allocated from it\n\tpoolCreateInfo.flags = VK_COMMAND_POOL_CREATE_RESET_COMMAND_BUFFER_BIT,\n\t\/\/ (NOTE) All command buffers created from this command pool must be submitted on queues from the same queue family.\n\tpoolCreateInfo.queueFamilyIndex = vkRender._graphicsFamilyIndex\n\t};\n\tvkCreateCommandPool(device, &poolCreateInfo, nullptr, &commandPool);\n\t}\n\n\tVkCommandBuffer commandBuffer[2];\n\t{\n\tVkCommandBufferAllocateInfo commandBufferInfo =\n\t{\n\t\/\/ (MANDATORY) sType is the type of the structure\n\tcommandBufferInfo.sType = VK_STRUCTURE_TYPE_COMMAND_BUFFER_ALLOCATE_INFO,\n\t\/\/ (MANDATORY) pNext is NULL or a pointer to an extension-specific structure.\n\tcommandBufferInfo.pNext = nullptr,\n\t\/\/ The command pool that will be used to allocate the command buffer(s)\n\tcommandBufferInfo.commandPool = commandPool,\n\t\/\/ Determines whether the command buffers are primary or secondary command buffers. Secondary command buffers are contained in primary command buffers.\n\tcommandBufferInfo.level = VK_COMMAND_BUFFER_LEVEL_PRIMARY,\n\t\/\/ The number of command buffers you want to allocate\n\tcommandBufferInfo.commandBufferCount = 2\n\t};\n\n\tvkAllocateCommandBuffers(device, &commandBufferInfo, commandBuffer);\n\t}\n\t\/\/ - - -\n\n\t\/\/ RECORDING IN COMMAND BUFFER(S)\n\t{\n\t{\n\tVkCommandBufferBeginInfo beginInfo =\n\t{\n\t\/\/ (MANDATORY) sType is the type of the structure\n\tbeginInfo.sType = VK_STRUCTURE_TYPE_COMMAND_BUFFER_BEGIN_INFO,\n\t\/\/ (MANDATORY) pNext is NULL or a pointer to an extension-specific structure.\n\tbeginInfo.pNext = nullptr,\n\t\/\/ A bitmask indicating usage behavior for the command buffer.\n\tbeginInfo.flags = VK_COMMAND_BUFFER_USAGE_SIMULTANEOUS_USE_BIT,\n\t\/\/ A pointer to a VkCommandBufferInheritanceInfo structure, which is used if commandBuffer is a secondary command buffer.\n\tbeginInfo.pInheritanceInfo = nullptr\n\t};\n\tvkBeginCommandBuffer(commandBuffer[0], &beginInfo);\n\n\tvkCmdPipelineBarrier(\n\tcommandBuffer[0],\n\tVK_PIPELINE_STAGE_ALL_COMMANDS_BIT,\n\tVK_PIPELINE_STAGE_ALL_COMMANDS_BIT,\n\t0,\n\t0, nullptr,\n\t0, nullptr,\n\t0, nullptr);\n\n\t\/\/ Filling the command buffer\n\t{\n\tVkViewport viewport =\n\t{\n\tviewport.maxDepth = 1.0f,\n\tviewport.minDepth = 0.0f,\n\tviewport.width = 512,\n\tviewport.height = 512,\n\tviewport.x = 0,\n\tviewport.y = 0\n\t};\n\tvkCmdSetViewport(commandBuffer[0], 0, 1, &viewport);\n\t}\n\n\tvkEndCommandBuffer(commandBuffer[0]);\n\t}\n\n\t{\n\tVkCommandBufferBeginInfo beginInfo =\n\t{\n\t\/\/ (MANDATORY) sType is the type of the structure\n\tbeginInfo.sType = VK_STRUCTURE_TYPE_COMMAND_BUFFER_BEGIN_INFO,\n\t\/\/ (MANDATORY) pNext is NULL or a pointer to an extension-specific structure.\n\tbeginInfo.pNext = nullptr,\n\t\/\/ A bitmask indicating usage behavior for the command buffer.\n\tbeginInfo.flags = VK_COMMAND_BUFFER_USAGE_SIMULTANEOUS_USE_BIT,\n\t\/\/ A pointer to a VkCommandBufferInheritanceInfo structure, which is used if commandBuffer is a secondary command buffer.\n\tbeginInfo.pInheritanceInfo = nullptr\n\t};\n\tvkBeginCommandBuffer(commandBuffer[1], &beginInfo);\n\n\tVkViewport viewport{};\n\tviewport.maxDepth = 1.0f;\n\tviewport.minDepth = 0.0f;\n\tviewport.width = 512;\n\tviewport.height = 512;\n\tviewport.x = 0;\n\tviewport.y = 0;\n\tvkCmdSetViewport(commandBuffer[1], 0, 1, &viewport);\n\n\tvkEndCommandBuffer(commandBuffer[1]);\n\t}\n\n\t{\n\tVkSubmitInfo submitInfo =\n\t{\n\t\/\/ (MANDATORY) sType is the type of the structure\n\tsubmitInfo.sType = VK_STRUCTURE_TYPE_SUBMIT_INFO,\n\t\/\/ (MANDATORY) pNext is NULL or a pointer to an extension-specific structure.\n\tsubmitInfo.pNext = nullptr,\n\t\/\/ The number of semaphores upon which to wait before executing the command buffers for the batch.\n\tsubmitInfo.waitSemaphoreCount = 0,\n\t\/\/ A pointer to an array of semaphores upon which to wait before executing the command buffers in the batch\n\tsubmitInfo.pWaitSemaphores = nullptr,\n\t\/\/ A pointer to an array of pipeline stages at which each corresponding semaphore wait will occur.\n\tsubmitInfo.pWaitDstStageMask = nullptr,\n\t\/\/ Contains the number of command buffers to execute in the batch\n\tsubmitInfo.commandBufferCount = 1,\n\t\/\/ A pointer to an array of command buffers to execute in the batch.\n\t\/\/ The command buffers submitted in a batch begin execution in the order they appear in pCommandBuffers, but may complete out of order\n\tsubmitInfo.pCommandBuffers = &commandBuffer[0],\n\t\/\/ The number of semaphores to be signaled once the commands specified in pCommandBuffers have completed execution.\n\tsubmitInfo.signalSemaphoreCount = 1,\n\t\/\/ A pointer to an array of semaphores which will be signaled when the command buffers for this batch have completed execution.\n\tsubmitInfo.pSignalSemaphores = &semaphore\n\t};\n\n\tvkQueueSubmit(queue, 1, &submitInfo, VK_NULL_HANDLE);\n\t}\n\t{\n\tVkPipelineStageFlags flags[]{ VK_PIPELINE_STAGE_ALL_COMMANDS_BIT };\n\tVkSubmitInfo submitInfo =\n\t{\n\t\/\/ (MANDATORY) sType is the type of the structure\n\tsubmitInfo.sType = VK_STRUCTURE_TYPE_SUBMIT_INFO,\n\t\/\/ (MANDATORY) pNext is NULL or a pointer to an extension-specific structure.\n\tsubmitInfo.pNext = nullptr,\n\t\/\/ The number of semaphores upon which to wait before executing the command buffers for the batch.\n\tsubmitInfo.waitSemaphoreCount = 1,\n\t\/\/ A pointer to an array of semaphores upon which to wait before executing the command buffers in the batch\n\tsubmitInfo.pWaitSemaphores = &semaphore,\n\t\/\/ A pointer to an array of pipeline stages at which each corresponding semaphore wait will occur.\n\tsubmitInfo.pWaitDstStageMask = flags,\n\t\/\/ Contains the number of command buffers to execute in the batch\n\tsubmitInfo.commandBufferCount = 1,\n\t\/\/ A pointer to an array of command buffers to execute in the batch.\n\t\/\/ The command buffers submitted in a batch begin execution in the order they appear in pCommandBuffers, but may complete out of order\n\tsubmitInfo.pCommandBuffers = &commandBuffer[1],\n\t\/\/ The number of semaphores to be signaled once the commands specified in pCommandBuffers have completed execution.\n\tsubmitInfo.signalSemaphoreCount = 1,\n\t\/\/ A pointer to an array of semaphores which will be signaled when the command buffers for this batch have completed execution.\n\tsubmitInfo.pSignalSemaphores = &semaphore\n\t};\n\n\tvkQueueSubmit(queue, 1, &submitInfo, VK_NULL_HANDLE);\n\t}\n\t}\n\n\t\/\/ Synchronisation\n\t{\n\t\/\/\t\t\tvkWaitForFences(device, 1, &fence, VK_TRUE, UINT64_MAX);\n\tvkQueueWaitIdle(queue);\n\t}\n\n\t\/\/ Freeing up things that have been allocated\n\t{\n\tvkDestroyCommandPool(device, commandPool, nullptr);\n\tvkDestroyFence(device, fence, nullptr);\n\tvkDestroySemaphore(device, semaphore, nullptr);\n\t}\n\t}\n\t*\/\n\n\t\/\/int runRet = c.run();\n\tsystem(\"Pause\");\n\t\/\/return runRet;\n\treturn 0;\n}\n<commit_msg>[ADD] window & vulkan link. Need to fix core error<commit_after>#include \"Core.hh\"\n#include \"PluginsManager.hh\"\n\/\/#include \"TestEventSystem1.hh\"\n\/\/#include \"TestEventSystem2.hh\"\n\/\/#include \"VulkanRenderer.hh\"\n\nint main()\n{\n\tObake::Core core;\n\t\/\/System::TestEventSystem1 system1;\n\t\/\/System::TestEventSystem2 system2;\n\t\/\/System::VulkanRenderer vulkan;\n\n\t\/\/system1.registerCore(&c);\n\t\/\/system2.registerCore(&c);\n\t\/\/vulkan.registerCore(&c);\n\t\/\/system1.initialize();\n\t\/\/system2.initialize();\n\t\/\/vulkan.initialize();\n\n\tObake::PluginsManager pluginsManager;\n\n\tpluginsManager.loadAllAvailablePlugins();\n\tpluginsManager.displayPluginsInfos();\n\tconst std::vector<Obake::AvailablePlugin*>& availablePlugins = pluginsManager.getAllAvailablePlugins();\n\n\tfor (Obake::AvailablePlugin* plugin : availablePlugins)\n\t{\n\t\tif (plugin->isLoaded())\n\t\t{\n\t\t\tplugin->getPlugin()->registerCore(&core);\n\t\t\tplugin->getPlugin()->initialize();\n\t\t\tcore.registerSystem(reinterpret_cast<Obake::ASystem*>(plugin->getPlugin()));\n\t\t}\n\t}\n\n\n\t\/\/ Vulkan tests\n\t\/*\n\t{\n\tauto device = vkRender._device;\n\tauto queue = vkRender._queue;\n\n\t\/\/ SYNCHRONISATION VAR\n\t\/\/ Waits for the GPU to be ready on the CPU side\n\tVkFence fence;\n\t{\n\tVkFenceCreateInfo fenceCreateInfo =\n\t{\n\t\/\/ (MANDATORY) sType is the type of the structure\n\tfenceCreateInfo.sType = VK_STRUCTURE_TYPE_FENCE_CREATE_INFO,\n\t\/\/ (MANDATORY) pNext is NULL or a pointer to an extension-specific structure.\n\tfenceCreateInfo.pNext = nullptr,\n\t\/\/ A flag that defines the initial state and behavior of the fence. Either signaled or unsignaled.\n\tfenceCreateInfo.flags = 0\n\t};\n\tvkCreateFence(device, &fenceCreateInfo, nullptr, &fence);\n\t}\n\n\t\/\/ Tells the GPU when other process in the GPU are completed\n\tVkSemaphore semaphore; \n\t{\n\tVkSemaphoreCreateInfo semaphoreCreateInfo =\n\t{\n\t\/\/ (MANDATORY) sType is the type of the structure\n\tsemaphoreCreateInfo.sType = VK_STRUCTURE_TYPE_SEMAPHORE_CREATE_INFO,\n\t\/\/ (MANDATORY) pNext is NULL or a pointer to an extension-specific structure.\n\tsemaphoreCreateInfo.pNext = nullptr,\n\t\/\/ Flag reserved for future use\n\tsemaphoreCreateInfo.flags = 0\n\t};\n\n\tvkCreateSemaphore(device, &semaphoreCreateInfo, nullptr, &semaphore);\n\t}\n\t\/\/ - - -\n\n\t\/\/ COMMAND BUFFERS\n\tVkCommandPool commandPool;\n\t{\n\tVkCommandPoolCreateInfo poolCreateInfo =\n\t{\n\t\/\/ (MANDATORY) sType is the type of the structure\n\tpoolCreateInfo.sType = VK_STRUCTURE_TYPE_COMMAND_POOL_CREATE_INFO,\n\t\/\/ (MANDATORY) pNext is NULL or a pointer to an extension-specific structure.\n\tpoolCreateInfo.pNext = nullptr,\n\t\/\/ A bitmask indicating usage behavior for the pool and command buffers allocated from it\n\tpoolCreateInfo.flags = VK_COMMAND_POOL_CREATE_RESET_COMMAND_BUFFER_BIT,\n\t\/\/ (NOTE) All command buffers created from this command pool must be submitted on queues from the same queue family.\n\tpoolCreateInfo.queueFamilyIndex = vkRender._graphicsFamilyIndex\n\t};\n\tvkCreateCommandPool(device, &poolCreateInfo, nullptr, &commandPool);\n\t}\n\n\tVkCommandBuffer commandBuffer[2];\n\t{\n\tVkCommandBufferAllocateInfo commandBufferInfo =\n\t{\n\t\/\/ (MANDATORY) sType is the type of the structure\n\tcommandBufferInfo.sType = VK_STRUCTURE_TYPE_COMMAND_BUFFER_ALLOCATE_INFO,\n\t\/\/ (MANDATORY) pNext is NULL or a pointer to an extension-specific structure.\n\tcommandBufferInfo.pNext = nullptr,\n\t\/\/ The command pool that will be used to allocate the command buffer(s)\n\tcommandBufferInfo.commandPool = commandPool,\n\t\/\/ Determines whether the command buffers are primary or secondary command buffers. Secondary command buffers are contained in primary command buffers.\n\tcommandBufferInfo.level = VK_COMMAND_BUFFER_LEVEL_PRIMARY,\n\t\/\/ The number of command buffers you want to allocate\n\tcommandBufferInfo.commandBufferCount = 2\n\t};\n\n\tvkAllocateCommandBuffers(device, &commandBufferInfo, commandBuffer);\n\t}\n\t\/\/ - - -\n\n\t\/\/ RECORDING IN COMMAND BUFFER(S)\n\t{\n\t{\n\tVkCommandBufferBeginInfo beginInfo =\n\t{\n\t\/\/ (MANDATORY) sType is the type of the structure\n\tbeginInfo.sType = VK_STRUCTURE_TYPE_COMMAND_BUFFER_BEGIN_INFO,\n\t\/\/ (MANDATORY) pNext is NULL or a pointer to an extension-specific structure.\n\tbeginInfo.pNext = nullptr,\n\t\/\/ A bitmask indicating usage behavior for the command buffer.\n\tbeginInfo.flags = VK_COMMAND_BUFFER_USAGE_SIMULTANEOUS_USE_BIT,\n\t\/\/ A pointer to a VkCommandBufferInheritanceInfo structure, which is used if commandBuffer is a secondary command buffer.\n\tbeginInfo.pInheritanceInfo = nullptr\n\t};\n\tvkBeginCommandBuffer(commandBuffer[0], &beginInfo);\n\n\tvkCmdPipelineBarrier(\n\tcommandBuffer[0],\n\tVK_PIPELINE_STAGE_ALL_COMMANDS_BIT,\n\tVK_PIPELINE_STAGE_ALL_COMMANDS_BIT,\n\t0,\n\t0, nullptr,\n\t0, nullptr,\n\t0, nullptr);\n\n\t\/\/ Filling the command buffer\n\t{\n\tVkViewport viewport =\n\t{\n\tviewport.maxDepth = 1.0f,\n\tviewport.minDepth = 0.0f,\n\tviewport.width = 512,\n\tviewport.height = 512,\n\tviewport.x = 0,\n\tviewport.y = 0\n\t};\n\tvkCmdSetViewport(commandBuffer[0], 0, 1, &viewport);\n\t}\n\n\tvkEndCommandBuffer(commandBuffer[0]);\n\t}\n\n\t{\n\tVkCommandBufferBeginInfo beginInfo =\n\t{\n\t\/\/ (MANDATORY) sType is the type of the structure\n\tbeginInfo.sType = VK_STRUCTURE_TYPE_COMMAND_BUFFER_BEGIN_INFO,\n\t\/\/ (MANDATORY) pNext is NULL or a pointer to an extension-specific structure.\n\tbeginInfo.pNext = nullptr,\n\t\/\/ A bitmask indicating usage behavior for the command buffer.\n\tbeginInfo.flags = VK_COMMAND_BUFFER_USAGE_SIMULTANEOUS_USE_BIT,\n\t\/\/ A pointer to a VkCommandBufferInheritanceInfo structure, which is used if commandBuffer is a secondary command buffer.\n\tbeginInfo.pInheritanceInfo = nullptr\n\t};\n\tvkBeginCommandBuffer(commandBuffer[1], &beginInfo);\n\n\tVkViewport viewport{};\n\tviewport.maxDepth = 1.0f;\n\tviewport.minDepth = 0.0f;\n\tviewport.width = 512;\n\tviewport.height = 512;\n\tviewport.x = 0;\n\tviewport.y = 0;\n\tvkCmdSetViewport(commandBuffer[1], 0, 1, &viewport);\n\n\tvkEndCommandBuffer(commandBuffer[1]);\n\t}\n\n\t{\n\tVkSubmitInfo submitInfo =\n\t{\n\t\/\/ (MANDATORY) sType is the type of the structure\n\tsubmitInfo.sType = VK_STRUCTURE_TYPE_SUBMIT_INFO,\n\t\/\/ (MANDATORY) pNext is NULL or a pointer to an extension-specific structure.\n\tsubmitInfo.pNext = nullptr,\n\t\/\/ The number of semaphores upon which to wait before executing the command buffers for the batch.\n\tsubmitInfo.waitSemaphoreCount = 0,\n\t\/\/ A pointer to an array of semaphores upon which to wait before executing the command buffers in the batch\n\tsubmitInfo.pWaitSemaphores = nullptr,\n\t\/\/ A pointer to an array of pipeline stages at which each corresponding semaphore wait will occur.\n\tsubmitInfo.pWaitDstStageMask = nullptr,\n\t\/\/ Contains the number of command buffers to execute in the batch\n\tsubmitInfo.commandBufferCount = 1,\n\t\/\/ A pointer to an array of command buffers to execute in the batch.\n\t\/\/ The command buffers submitted in a batch begin execution in the order they appear in pCommandBuffers, but may complete out of order\n\tsubmitInfo.pCommandBuffers = &commandBuffer[0],\n\t\/\/ The number of semaphores to be signaled once the commands specified in pCommandBuffers have completed execution.\n\tsubmitInfo.signalSemaphoreCount = 1,\n\t\/\/ A pointer to an array of semaphores which will be signaled when the command buffers for this batch have completed execution.\n\tsubmitInfo.pSignalSemaphores = &semaphore\n\t};\n\n\tvkQueueSubmit(queue, 1, &submitInfo, VK_NULL_HANDLE);\n\t}\n\t{\n\tVkPipelineStageFlags flags[]{ VK_PIPELINE_STAGE_ALL_COMMANDS_BIT };\n\tVkSubmitInfo submitInfo =\n\t{\n\t\/\/ (MANDATORY) sType is the type of the structure\n\tsubmitInfo.sType = VK_STRUCTURE_TYPE_SUBMIT_INFO,\n\t\/\/ (MANDATORY) pNext is NULL or a pointer to an extension-specific structure.\n\tsubmitInfo.pNext = nullptr,\n\t\/\/ The number of semaphores upon which to wait before executing the command buffers for the batch.\n\tsubmitInfo.waitSemaphoreCount = 1,\n\t\/\/ A pointer to an array of semaphores upon which to wait before executing the command buffers in the batch\n\tsubmitInfo.pWaitSemaphores = &semaphore,\n\t\/\/ A pointer to an array of pipeline stages at which each corresponding semaphore wait will occur.\n\tsubmitInfo.pWaitDstStageMask = flags,\n\t\/\/ Contains the number of command buffers to execute in the batch\n\tsubmitInfo.commandBufferCount = 1,\n\t\/\/ A pointer to an array of command buffers to execute in the batch.\n\t\/\/ The command buffers submitted in a batch begin execution in the order they appear in pCommandBuffers, but may complete out of order\n\tsubmitInfo.pCommandBuffers = &commandBuffer[1],\n\t\/\/ The number of semaphores to be signaled once the commands specified in pCommandBuffers have completed execution.\n\tsubmitInfo.signalSemaphoreCount = 1,\n\t\/\/ A pointer to an array of semaphores which will be signaled when the command buffers for this batch have completed execution.\n\tsubmitInfo.pSignalSemaphores = &semaphore\n\t};\n\n\tvkQueueSubmit(queue, 1, &submitInfo, VK_NULL_HANDLE);\n\t}\n\t}\n\n\t\/\/ Synchronisation\n\t{\n\t\/\/\t\t\tvkWaitForFences(device, 1, &fence, VK_TRUE, UINT64_MAX);\n\tvkQueueWaitIdle(queue);\n\t}\n\n\t\/\/ Freeing up things that have been allocated\n\t{\n\tvkDestroyCommandPool(device, commandPool, nullptr);\n\tvkDestroyFence(device, fence, nullptr);\n\tvkDestroySemaphore(device, semaphore, nullptr);\n\t}\n\t}\n\t*\/\n\n\t\/\/int runRet = core.run();\n\tsystem(\"Pause\");\n\t\/\/return runRet;\n\n\tfor (Obake::AvailablePlugin* plugin : availablePlugins)\n\t{\n\t\tif (plugin->isLoaded())\n\t\t{\n\t\t\tplugin->getPlugin()->unload();\n\t\t}\n\t}\n\n\treturn 0;\n}\n<|endoftext|>"} {"text":"<commit_before>\/* IBM_PROLOG_BEGIN_TAG *\/\n\/* This is an automatically generated prolog. *\/\n\/* *\/\n\/* $Source: src\/import\/chips\/p9\/procedures\/hwp\/initfiles\/p9a_omi_scom.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\/\/\/ @file p9a_omi_scom.C\n\/\/\/\n\/\/ *HWP HWP Owner: Benjamin Gass <bgass@us.ibm.com>\n\/\/ *HWP HWP Backup: Daniel Crowell <dcrowell@us.ibm.com>\n\/\/ *HWP Team:\n\/\/ *HWP Level: 2\n\/\/ *HWP Consumed by: HB\n<commit_msg>Adding omi_init procedures.<commit_after>\/* IBM_PROLOG_BEGIN_TAG *\/\n\/* This is an automatically generated prolog. *\/\n\/* *\/\n\/* $Source: src\/import\/chips\/p9\/procedures\/hwp\/initfiles\/p9a_omi_scom.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#include \"p9a_omi_scom.H\"\n#include <stdint.h>\n#include <stddef.h>\n#include <fapi2.H>\n\nusing namespace fapi2;\n\nconstexpr uint64_t literal_0 = 0;\nconstexpr uint64_t literal_2 = 2;\nconstexpr uint64_t literal_0b1 = 0b1;\nconstexpr uint64_t literal_1 = 1;\n\nfapi2::ReturnCode p9a_omi_scom(const fapi2::Target<fapi2::TARGET_TYPE_MI>& TGT0,\n const fapi2::Target<fapi2::TARGET_TYPE_OMI>& TGT1, const fapi2::Target<fapi2::TARGET_TYPE_MCC>& TGT2,\n const fapi2::Target<fapi2::TARGET_TYPE_SYSTEM>& TGT3)\n{\n {\n fapi2::ATTR_CHIP_UNIT_POS_Type l_TGT1_ATTR_CHIP_UNIT_POS;\n FAPI_TRY(FAPI_ATTR_GET(fapi2::ATTR_CHIP_UNIT_POS, TGT1, l_TGT1_ATTR_CHIP_UNIT_POS));\n uint64_t l_def_OMI_POSITION = (l_TGT1_ATTR_CHIP_UNIT_POS % literal_2);\n fapi2::ATTR_CHIP_UNIT_POS_Type l_TGT2_ATTR_CHIP_UNIT_POS;\n FAPI_TRY(FAPI_ATTR_GET(fapi2::ATTR_CHIP_UNIT_POS, TGT2, l_TGT2_ATTR_CHIP_UNIT_POS));\n uint64_t l_def_MCC_POSITION = (l_TGT2_ATTR_CHIP_UNIT_POS % literal_2);\n fapi2::buffer<uint64_t> l_scom_buffer;\n {\n FAPI_TRY(fapi2::getScom( TGT0, 0x5010813ull, l_scom_buffer ));\n\n if (((l_def_MCC_POSITION == literal_0) && (l_def_OMI_POSITION == literal_0)))\n {\n l_scom_buffer.insert<53, 1, 63, uint64_t>(literal_0b1 );\n }\n\n if (((l_def_MCC_POSITION == literal_0) && (l_def_OMI_POSITION == literal_1)))\n {\n l_scom_buffer.insert<54, 1, 63, uint64_t>(literal_0b1 );\n }\n\n if (((l_def_MCC_POSITION == literal_1) && (l_def_OMI_POSITION == literal_0)))\n {\n l_scom_buffer.insert<55, 1, 63, uint64_t>(literal_0b1 );\n }\n\n if (((l_def_MCC_POSITION == literal_1) && (l_def_OMI_POSITION == literal_1)))\n {\n l_scom_buffer.insert<56, 1, 63, uint64_t>(literal_0b1 );\n }\n\n FAPI_TRY(fapi2::putScom(TGT0, 0x5010813ull, l_scom_buffer));\n }\n\n };\nfapi_try_exit:\n return fapi2::current_err;\n}\n<|endoftext|>"} {"text":"<commit_before>#include \"FrameBuffer.h\"\n\n#include <string>\n\nFrameBuffer::FrameBuffer(void)\n{\n\thandle\t\t\t= 0;\n\n\tmemset(colourTex, 0, sizeof(colourTex));\n\t\n\tnumTargets\t\t= 0;\n\n\tdepthTex\t\t= 0;\n\n\twidth = height\t= 0;\n\n\tmaxSize\t\t\t= 4096;\n}\n\n\nFrameBuffer::~FrameBuffer(void)\n{\n\t\/\/Release everything from graphics memory\n\tRelease();\n}\n\n\nvoid FrameBuffer::Release(void)\n{\n\t\/\/Can only release data if there is a handle to get the data\n\tif(handle)\n\t{\n\t\t\/\/Delete the FBO\n\t\tglBindFramebuffer(GL_FRAMEBUFFER, 0);\n\t\tglDeleteFramebuffers(1, &handle);\n\n\t\t\/\/Delete the textures\n\t\tglBindTexture(GL_TEXTURE_2D, 0);\n\t\tif(*colourTex)\n\t\t{\n\t\t\tglDeleteTextures(1, colourTex);\n\t\t}\n\n\t\t\/\/Reset the values\n\t\thandle\t\t\t= 0;\n\t\tmemset(colourTex, 0, sizeof(colourTex));\n\t\tnumTargets\t\t= 0;\n\t\tdepthTex\t\t= 0;\n\t\twidth = height\t= 0;\n\t}\n}\n\nint FrameBuffer::Initialize(unsigned int w, unsigned int h,\n\t\t\t\t\t\t\tunsigned int colour, bool useDepth, bool useHDR,\n\t\t\t\t\t\t\tbool useLinearFilter, bool clamp)\n{\n\tif(w && h && (colour || useDepth))\n\t{\n\t\t\/\/Maximum dimension \n\t\tif(w <= maxSize && h <= maxSize)\n\t\t{\n\t\t\tconst unsigned short filtering = useLinearFilter ? \n\t\t\t\tGL_LINEAR : GL_NEAREST;\n\t\t\tconst unsigned short wrapping = clamp ? \n\t\t\t\tGL_CLAMP_TO_EDGE : GL_REPEAT;\n\t\t\tconst unsigned short colourBit = useHDR ? \n\t\t\t\tGL_UNSIGNED_SHORT : GL_UNSIGNED_BYTE;\n\t\t\tconst unsigned short colourFormat = useHDR ? \n\t\t\t\tGL_RGBA16 : GL_RGBA8;\n\n\t\t\tthis->width\t\t= w;\n\t\t\tthis->height\t= h;\n\n\t\t\t\/\/init FBO\n\t\t\tglGenFramebuffers(1, &handle);\n\t\t\tglBindFramebuffer(GL_FRAMEBUFFER, handle);\n\n\t\t\tif(colour)\n\t\t\t{\n\t\t\t\tint maxTargets;\n\t\t\t\tglGetIntegerv(GL_MAX_COLOR_ATTACHMENTS, &maxTargets);\n\t\t\t\tnumTargets = (int)colour <= maxTargets ? colour : maxTargets;\n\n\t\t\t\tglGenTextures(1, colourTex);\n\n\t\t\t\tfor(unsigned int i = 0; i < numTargets ; ++i)\n\t\t\t\t{\n\t\t\t\t\tglGenTextures(1, colourTex + i);\n\t\t\t\t\tglBindTexture(GL_TEXTURE_2D, *colourTex);\n\t\t\t\t\tglTexImage2D(GL_TEXTURE_2D, 0, colourFormat, width, height, 0, GL_RGBA, colourBit, 0);\n\n\t\t\t\t\tglTexParameteri(GL_TEXTURE_2D, GL_TEXTURE_MIN_FILTER, filtering);\n\t\t\t\t\tglTexParameteri(GL_TEXTURE_2D, GL_TEXTURE_MAG_FILTER, filtering);\n\t\t\t\t\tglTexParameteri(GL_TEXTURE_2D, GL_TEXTURE_WRAP_S, wrapping);\n\t\t\t\t\tglTexParameteri(GL_TEXTURE_2D, GL_TEXTURE_WRAP_T, wrapping);\n\n\t\t\t\t\tglFramebufferTexture2D(GL_FRAMEBUFFER, GL_COLOR_ATTACHMENT0 + i, GL_TEXTURE_2D, *(colourTex + i), 0);\n\t\t\t\t}\n\t\t\t}\n\n\t\t\tif(useDepth)\n\t\t\t{\n\t\t\t\tglGenTextures(1, &depthTex);\n\t\t\t\tglBindTexture(GL_TEXTURE_2D, depthTex);\n\t\t\t\tglTexImage2D(GL_TEXTURE_2D, 0, GL_DEPTH_COMPONENT24, width, height, 0, GL_DEPTH_COMPONENT, GL_UNSIGNED_INT, 0);\n\n\t\t\t\tglTexParameteri(GL_TEXTURE_2D, GL_TEXTURE_MIN_FILTER, filtering);\n\t\t\t\tglTexParameteri(GL_TEXTURE_2D, GL_TEXTURE_MAG_FILTER, filtering);\n\t\t\t\tglTexParameteri(GL_TEXTURE_2D, GL_TEXTURE_WRAP_S, wrapping);\n\t\t\t\tglTexParameteri(GL_TEXTURE_2D, GL_TEXTURE_WRAP_T, wrapping);\n\n\t\t\t\tglFramebufferTexture2D(GL_FRAMEBUFFER, GL_DEPTH_ATTACHMENT, GL_TEXTURE_2D, depthTex, 0);\n\t\t\t}\n\n\t\t\tint status = glCheckFramebufferStatus(GL_FRAMEBUFFER);\n\n\t\t\tif(status == GL_FRAMEBUFFER_COMPLETE)\n\t\t\t{\n\t\t\t\tglBindTexture(GL_TEXTURE_2D, 0);\n\t\t\t\tglBindFramebuffer(GL_FRAMEBUFFER, 0);\n\n\t\t\t\treturn 1;\n\t\t\t}\n\n\t\t\tRelease();\n\t\t}\n\t}\n\n\treturn 0;\n}\n\nvoid FrameBuffer::Activate() const\n{\n\t\/\/If the FBO has been created and has a handle\n\tif(handle)\n\t{\n\t\t\/\/Bind the FBO\n\t\tglBindFramebuffer(GL_FRAMEBUFFER, handle);\n\n\t\tif(numTargets)\n\t\t{\n\t\t\tconst GLenum targetName[16] = {\n\t\t\t\tGL_COLOR_ATTACHMENT0,\n\t\t\t\tGL_COLOR_ATTACHMENT1,\n\t\t\t\tGL_COLOR_ATTACHMENT2,\n\t\t\t\tGL_COLOR_ATTACHMENT3,\n\t\t\t\tGL_COLOR_ATTACHMENT4,\n\t\t\t\tGL_COLOR_ATTACHMENT5,\n\t\t\t\tGL_COLOR_ATTACHMENT6,\n\t\t\t\tGL_COLOR_ATTACHMENT7,\n\t\t\t\tGL_COLOR_ATTACHMENT8,\n\t\t\t\tGL_COLOR_ATTACHMENT9,\n\t\t\t\tGL_COLOR_ATTACHMENT10,\n\t\t\t\tGL_COLOR_ATTACHMENT11,\n\t\t\t\tGL_COLOR_ATTACHMENT12,\n\t\t\t\tGL_COLOR_ATTACHMENT13,\n\t\t\t\tGL_COLOR_ATTACHMENT14,\n\t\t\t\tGL_COLOR_ATTACHMENT15,\n\t\t\t};\n\n\t\t\tglDrawBuffers(numTargets, targetName);\n\t\t}\n\t\telse\n\t\t{\n\t\t\tglDrawBuffer(GL_NONE);\n\t\t}\n\n\t\tif(depthTex)\n\t\t{\n\t\t\tglEnable(GL_DEPTH_TEST);\n\t\t}\n\t\telse\n\t\t{\n\t\t\tglDisable(GL_DEPTH_TEST);\n\t\t}\n\t}\n}\n\nvoid FrameBuffer::Deactivate(void)\n{\n\tglBindFramebuffer(GL_FRAMEBUFFER, 0);\n\n\tglDrawBuffer(GL_BACK);\n\n\tglEnable(GL_DEPTH_TEST);\n}\n\nvoid FrameBuffer::UnbindTextures(void)\n{\n\tglBindTexture(GL_TEXTURE_2D, 0);\n}\n\n\/\/\/\/\/\/\/\/\/\/\n\/\/SETTERS\n\/\/\/\/\/\/\/\/\/\/\n\nvoid FrameBuffer::BindColour(unsigned int target) const\n{\n\tif(target < 16)\n\t{\n\t\tif(numTargets)\n\t\t{\n\t\t\tglBindTexture(GL_TEXTURE_2D, *(colourTex + target));\n\t\t}\n\t}\n}\n\nvoid FrameBuffer::BindDepth() const\n{\n\tif(depthTex)\n\t{\n\t\tglBindTexture(GL_TEXTURE_2D, depthTex);\n\t}\n}\n\nvoid FrameBuffer::SetTexture(unsigned int texture)\n{\n\tif(texture < 16)\n\t{\n\t\tglActiveTexture(GL_TEXTURE0 + texture);\n\t}\n}<commit_msg>Fixed Frame buffer MRTs<commit_after>#include \"FrameBuffer.h\"\n\n#include <string>\n\nFrameBuffer::FrameBuffer(void)\n{\n\thandle = 0;\n\n\tmemset(colourTex, 0, sizeof(colourTex));\n\n\tnumTargets = 0;\n\n\tdepthTex = 0;\n\n\twidth = height = 0;\n\n\tmaxSize = 4096;\n}\n\n\nFrameBuffer::~FrameBuffer(void)\n{\n\t\/\/Release everything from graphics memory\n\tRelease();\n}\n\n\nvoid FrameBuffer::Release(void)\n{\n\t\/\/Can only release data if there is a handle to get the data\n\tif (handle)\n\t{\n\t\t\/\/Delete the FBO\n\t\tglBindFramebuffer(GL_FRAMEBUFFER, 0);\n\t\tglDeleteFramebuffers(1, &handle);\n\n\t\t\/\/Delete the textures\n\t\tglBindTexture(GL_TEXTURE_2D, 0);\n\t\tif (*colourTex)\n\t\t{\n\t\t\tglDeleteTextures(1, colourTex);\n\t\t}\n\n\t\t\/\/Reset the values\n\t\thandle = 0;\n\t\tmemset(colourTex, 0, sizeof(colourTex));\n\t\tnumTargets = 0;\n\t\tdepthTex = 0;\n\t\twidth = height = 0;\n\t}\n}\n\nint FrameBuffer::Initialize(unsigned int w, unsigned int h,\n\tunsigned int colour, bool useDepth, bool useHDR,\n\tbool useLinearFilter, bool clamp)\n{\n\tif (w && h && (colour || useDepth))\n\t{\n\t\tif (w < maxSize && w < maxSize)\n\t\t{\n\t\t\twidth = w;\n\t\t\theight = h;\n\n\t\t\tconst unsigned short filtering = useLinearFilter ?\n\t\t\tGL_LINEAR : GL_NEAREST;\n\t\t\tconst unsigned short wrapping = clamp ?\n\t\t\tGL_CLAMP_TO_EDGE : GL_REPEAT;\n\t\t\tconst unsigned short colourBit = useHDR ?\n\t\t\tGL_UNSIGNED_SHORT : GL_UNSIGNED_BYTE;\n\t\t\tconst unsigned short colourFormat = useHDR ?\n\t\t\tGL_RGBA16 : GL_RGBA8;\n\n\t\t\tglGenFramebuffers(1, &handle);\n\t\t\tglBindFramebuffer(GL_FRAMEBUFFER, handle);\n\n\t\t\tif (colour)\n\t\t\t{\n\t\t\t\t\/\/Get the maximum number of targets aloud\n\t\t\t\tint maxTargets;\n\t\t\t\tglGetIntegerv(GL_MAX_COLOR_ATTACHMENTS, &maxTargets);\n\n\t\t\t\t\/\/Detremine the number of targets this FBO will have\n\t\t\t\tif (colour > maxTargets)\n\t\t\t\t\tnumTargets = maxTargets;\n\t\t\t\telse\n\t\t\t\t\tnumTargets = colour;\n\n\t\t\t\tglGenTextures(numTargets, colourTex);\n\n\t\t\t\tfor (unsigned int i = 0; i < numTargets; ++i)\n\t\t\t\t{\n\t\t\t\t\tglBindTexture(GL_TEXTURE_2D, *colourTex + i);\n\n\t\t\t\t\tglTexImage2D(GL_TEXTURE_2D, 0, colourFormat, width, height, 0, GL_RGBA, colourBit, 0);\n\n\t\t\t\t\tglTexParameteri(GL_TEXTURE_2D, GL_TEXTURE_MIN_FILTER, filtering);\n\t\t\t\t\tglTexParameteri(GL_TEXTURE_2D, GL_TEXTURE_MAG_FILTER, filtering);\n\t\t\t\t\tglTexParameteri(GL_TEXTURE_2D, GL_TEXTURE_WRAP_S, wrapping);\n\t\t\t\t\tglTexParameteri(GL_TEXTURE_2D, GL_TEXTURE_WRAP_T, wrapping);\n\n\t\t\t\t\tglFramebufferTexture(GL_FRAMEBUFFER, GL_COLOR_ATTACHMENT0 + i, *colourTex + i, 0);\n\t\t\t\t}\n\t\t\t}\n\n\t\t\tif (useDepth)\n\t\t\t{\n\t\t\t\tglGenTextures(1, &depthTex);\n\t\t\t\tglBindTexture(GL_TEXTURE_2D, depthTex);\n\t\t\t\tglTexImage2D(GL_TEXTURE_2D, 0, GL_DEPTH_COMPONENT24, width, height, 0, GL_DEPTH_COMPONENT, GL_FLOAT, 0);\n\n\t\t\t\tglTexParameteri(GL_TEXTURE_2D, GL_TEXTURE_MIN_FILTER, filtering);\n\t\t\t\tglTexParameteri(GL_TEXTURE_2D, GL_TEXTURE_MAG_FILTER, filtering);\n\t\t\t\tglTexParameteri(GL_TEXTURE_2D, GL_TEXTURE_WRAP_S, wrapping);\n\t\t\t\tglTexParameteri(GL_TEXTURE_2D, GL_TEXTURE_WRAP_T, wrapping);\n\n\t\t\t\t\/\/glFramebufferTexture2D(GL_FRAMEBUFFER, GL_DEPTH_ATTACHMENT, GL_TEXTURE_2D, depthTex, 0);\n\t\t\t\tglFramebufferTexture(GL_FRAMEBUFFER, GL_DEPTH_ATTACHMENT, depthTex, 0);\n\t\t\t}\n\n\t\t\treturn true;\n\t\t}\n\t}\n\n\treturn false;\n}\n\nvoid FrameBuffer::Activate() const\n{\n\t\/\/If the FBO has been created and has a handle\n\tif (handle)\n\t{\n\t\t\/\/Bind the FBO\n\t\tglBindFramebuffer(GL_FRAMEBUFFER, handle);\n\n\t\tif (numTargets)\n\t\t{\n\t\t\tconst GLenum targetName[16] = {\n\t\t\t\tGL_COLOR_ATTACHMENT0,\n\t\t\t\tGL_COLOR_ATTACHMENT1,\n\t\t\t\tGL_COLOR_ATTACHMENT2,\n\t\t\t\tGL_COLOR_ATTACHMENT3,\n\t\t\t\tGL_COLOR_ATTACHMENT4,\n\t\t\t\tGL_COLOR_ATTACHMENT5,\n\t\t\t\tGL_COLOR_ATTACHMENT6,\n\t\t\t\tGL_COLOR_ATTACHMENT7,\n\t\t\t\tGL_COLOR_ATTACHMENT8,\n\t\t\t\tGL_COLOR_ATTACHMENT9,\n\t\t\t\tGL_COLOR_ATTACHMENT10,\n\t\t\t\tGL_COLOR_ATTACHMENT11,\n\t\t\t\tGL_COLOR_ATTACHMENT12,\n\t\t\t\tGL_COLOR_ATTACHMENT13,\n\t\t\t\tGL_COLOR_ATTACHMENT14,\n\t\t\t\tGL_COLOR_ATTACHMENT15,\n\t\t\t};\n\n\t\t\tglDrawBuffers(numTargets, targetName);\n\t\t}\n\t\telse\n\t\t{\n\t\t\tglDrawBuffer(GL_NONE);\n\t\t}\n\n\t\tif (depthTex)\n\t\t{\n\t\t\tglEnable(GL_DEPTH_TEST);\n\t\t}\n\t\telse\n\t\t{\n\t\t\tglDisable(GL_DEPTH_TEST);\n\t\t}\n\t}\n}\n\nvoid FrameBuffer::Deactivate(void)\n{\n\tglBindFramebuffer(GL_FRAMEBUFFER, 0);\n\n\tglDrawBuffer(GL_FRONT);\n\n\tglEnable(GL_DEPTH_TEST);\n}\n\nvoid FrameBuffer::UnbindTextures(void)\n{\n\tglBindTexture(GL_TEXTURE_2D, 0);\n}\n\n\/\/\/\/\/\/\/\/\/\/\n\/\/SETTERS\n\/\/\/\/\/\/\/\/\/\/\n\nvoid FrameBuffer::BindColour(unsigned int target) const\n{\n\tif (target < 16)\n\t{\n\t\tif (numTargets)\n\t\t{\n\t\t\tglBindTexture(GL_TEXTURE_2D, *(colourTex + target));\n\t\t}\n\t}\n}\n\nvoid FrameBuffer::BindDepth() const\n{\n\tif (depthTex)\n\t{\n\t\tglBindTexture(GL_TEXTURE_2D, depthTex);\n\t}\n}\n\nvoid FrameBuffer::SetTexture(unsigned int texture)\n{\n\tif (texture < 16)\n\t{\n\t\tglActiveTexture(GL_TEXTURE0 + texture);\n\t}\n}<|endoftext|>"} {"text":"<commit_before>#include \"GameProcess.h\"\n#include \"Object.h\"\n#include \"Engine.h\"\n#include \"World.h\"\n#include \"App.h\"\n#include \"ToolsCamera.h\"\n#include \"ControlsApp.h\"\n#include \"MathLib.h\"\n#include \"Game.h\"\n#include \"Editor.h\"\n#include \"Input.h\"\n#include \"BlueRayUtils.h\"\n#include \"World.h\"\n#include \"Action.h\"\n#include \"FPSRoleLocal.h\"\n#include \"StarControl.h\"\n#include \"RayControl.h\"\n\nusing namespace MathLib;\n\nCGameProcess::CGameProcess(void)\n{\n\n}\n\nCGameProcess::~CGameProcess(void)\n{\n\n}\nint CGameProcess::Init()\n{\n\tg_Engine.pFileSystem->CacheFilesFormExt(\"char\");\n\tg_Engine.pFileSystem->CacheFilesFormExt(\"node\");\n\tg_Engine.pFileSystem->CacheFilesFormExt(\"smesh\");\n\tg_Engine.pFileSystem->CacheFilesFormExt(\"sanim\");\n\n\tg_Engine.pWorld->LoadWorld(\"data\/scene\/terrain\/test\/test.world\");\n\t\/\/g_Engine.pWorld->LoadWorld(\"data\/scene\/terrain\/cj\/cj.world\"); \n\tg_Engine.pControls->SetKeyPressFunc(KeyPress);\n\tg_Engine.pControls->SetKeyReleaseFunc(KeyRelease);\n\n\tm_pRole = new CFPSRoleLocal();\n\tm_pRole->Init(10001, \"data\/role\/hero\/FpsRole\/fps.char\");\t\t\n\n\tm_pRole->SetActorPosition(vec3(0, 0, 0));\t\/\/设置角色初始位置。以门处作为原点，三维坐标系vec3是向量\n\tm_pSkillSystem = new CSkillSystem(this);\n\tm_pCameraBase = new CCameraBase();\n\tm_pCameraBase->SetEnabled(1);\n\tg_pSysControl->SetMouseGrab(1);\n\n\tm_pStarControl = new CStarControl();\n\tm_pRayControl = new CRayControl();\n\n\treturn 1;\n}\n\nint CGameProcess::ShutDown()\t\t\t\/\/关闭游戏进程\n{\n\tdelete m_pRole;\n\tdelete m_pSkillSystem;\n\tdelete m_pCameraBase;\n\tdelete m_pStarControl;\n\tdelete m_pRayControl;\n\n\tDelAllListen();\n\treturn 0;\n}\n\nint CGameProcess::Update()\n{\n\tfloat ifps = g_Engine.pGame->GetIFps();\n\n\tif (g_Engine.pInput->IsKeyDown('1'))\n\t{\n\t\tCAction* pAction = m_pRole->OrceAction(\"attack02\");\n\t\tif (pAction)\n\t\t{\n\t\t\tpAction->SetupSkillThrow(vec3_zero, -1.0f, 2.0f);\n\t\t\tm_pRole->StopMove();\n\t\t}\n\t}\n\telse if (g_Engine.pInput->IsKeyDown('2'))\n\t{\n\t\tCAction* pAction = m_pRole->OrceAction(\"skill01\");\n\t\tif (pAction)\n\t\t{\n\t\t\tm_pRole->StopMove();\n\t\t}\n\t}\n\telse if (g_Engine.pInput->IsKeyDown('3'))\n\t{\n\t\tCAction* pAction = m_pRole->OrceAction(\"skill02\");\n\t\tif (pAction)\n\t\t{\n\t\t\tm_pRole->StopMove();\n\t\t\tCRoleBase* pTarget = NULL;\n\t\t\tfor (int i = 0; i < 20; i++)\n\t\t\t{\n\t\t\t\tfloat l = (m_vAIList[i]->GetPosition() - m_pRole->GetPosition()).length();\n\t\t\t\tif (l > 5.0f && l < 15.0f)\n\t\t\t\t{\n\t\t\t\t\tpTarget = m_vAIList[i];\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t\tif (pTarget)\n\t\t\t{\n\t\t\t\tCVector<int> vTarget;\n\t\t\t\tvTarget.Append(pTarget->GetRoleID());\n\t\t\t\tpAction->SetupSkillBulletTarget(vTarget);\n\t\t\t\tm_pRole->SetDirection((pTarget->GetPosition() - m_pRole->GetPosition()).normalize(), 1);\n\t\t\t}\n\t\t}\n\t}\n\telse if (g_Engine.pInput->IsKeyDown('4'))\/\/多发子弹\n\t{\n\t\tCAction* pAction = m_pRole->OrceAction(\"skill02\");\n\t\tif (pAction)\n\t\t{\n\t\t\tm_pRole->StopMove();\n\t\t\tCVector<int> vTarget;\n\t\t\tfor (int i = 0; i < 20; i++)\n\t\t\t{\n\t\t\t\tfloat l = (m_vAIList[i]->GetPosition() - m_pRole->GetPosition()).length();\n\t\t\t\tif (l > 5.0f && l < 20.0f)\n\t\t\t\t{\n\t\t\t\t\tvTarget.Append(m_vAIList[i]->GetRoleID());\n\t\t\t\t}\n\t\t\t}\n\t\t\tif (!vTarget.Empty())\n\t\t\t{\n\t\t\t\tpAction->SetupSkillBulletTarget(vTarget);\n\t\t\t}\n\t\t}\n\t}\n\telse if (g_Engine.pInput->IsKeyDown('5'))\n\t{\n\t\tCAction* pAction = m_pRole->OrceAction(\"skill03\");\n\t\tif (pAction)\n\t\t{\n\t\t\tm_pRole->StopMove();\n\t\t\tCVector<vec3> vPos;\n\t\t\tpAction->SetupSkillTargetPoint(vPos);\n\t\t}\n\t}\n\telse if (g_Engine.pInput->IsKeyDown('6'))\n\t{\n\t\tCAction* pAction = m_pRole->OrceAction(\"skill06\");\n\t\tif (pAction)\n\t\t{\n\t\t\tm_pRole->StopMove();\n\t\t\tCVector<vec3> vPos;\n\t\t\tfor (int i = 0; i < 20; i++)\n\t\t\t{\n\t\t\t\tfloat l = (m_vAIList[i]->GetPosition() - m_pRole->GetPosition()).length();\n\t\t\t\tif (l > 5.0f && l < 20.0f)\n\t\t\t\t\tvPos.Append(m_vAIList[i]->GetPosition());\n\n\t\t\t}\n\t\t\tpAction->SetupSkillTargetPoint(vPos);\n\t\t}\n\t}\n\telse if (g_Engine.pInput->IsKeyDown('7'))\n\t{\n\t\tCAction* pAction = m_pRole->OrceAction(\"skill05\");\n\t\tif (pAction)\n\t\t{\n\t\t\tm_pRole->StopMove();\n\t\t\tCVector<int> vTarget;\n\t\t\tfor (int i = 0; i < 20; i++)\n\t\t\t{\n\t\t\t\tfloat l = (m_vAIList[i]->GetPosition() - m_pRole->GetPosition()).length();\n\t\t\t\tif (l > 5.0f && l < 20.0f)\n\t\t\t\t\tvTarget.Append(m_vAIList[i]->GetRoleID());\n\t\t\t}\n\t\t\tif (!vTarget.Empty())\n\t\t\t{\n\t\t\t\tpAction->SetupSkillBulletTarget(vTarget);\n\t\t\t}\n\t\t}\n\t}\n\telse if (g_Engine.pInput->IsKeyDown('8'))\n\t{\n\t\tCAction* pAction = m_pRole->OrceAction(\"skill07\");\n\t\tif (pAction)\n\t\t{\n\t\t\tm_pRole->StopMove();\n\t\t\tCVector<vec3> vPos;\n\t\t\tfor (int i = 0; i < 20; i++)\n\t\t\t{\n\t\t\t\tfloat l = (m_vAIList[i]->GetPosition() - m_pRole->GetPosition()).length();\n\t\t\t\tif (l > 5.0f && l < 20.0f)\n\t\t\t\t\tvPos.Append(m_vAIList[i]->GetPosition());\n\t\t\t}\n\t\t\tpAction->SetupSkillBulletPosition(vPos);\n\t\t}\n\t}\n\telse if (g_Engine.pInput->IsKeyDown('9'))\n\t{\n\t\tCAction* pAction = m_pRole->OrceAction(\"skill08\");\n\t\tif (pAction)\n\t\t{\n\t\t\tm_pRole->StopMove();\n\t\t\tpAction->SetupSkillBulletDirection(1);\n\t\t}\n\n\t}\n\telse if (g_Engine.pInput->IsKeyUp(CInput::KEY_ESC))\n\t{\n\t\tg_Engine.pApp->Exit();\n\t}\n\tif(g_Engine.pInput->IsLBDown())\n\t{\n\t\tvec3 p0,p1;\n\t\tBlueRay::GetPlayerMouseDirection(p0,p1);\n\t\tvec3 vRetPoint,vRetNormal;\n\t\tint nS = -1;\n\t\tg_Engine.pWorld->GetIntersection(p0,p1,CBRObject::MASK_SCENE,vRetPoint,vRetNormal,nS);\n\n\t\tif(-1 != nS)\n\t\t{\n\t\t\tm_pRole->MoveToPath(vRetPoint);\n\t\t}\n\t}\n\tfor(int i = 0;i < 20;i++)\n\t{\n\t\tif(!m_vAIList[i]->IsMoveing())\n\t\t{\n\t\t\tvec3 vPos = vec3(g_Engine.pGame->GetRandomFloat(-20.0f,20.0f),g_Engine.pGame->GetRandomFloat(-20.0f,20.0f),1.1f);\n\t\t\tm_vAIList[i]->MoveToPath(vPos);\n\t\t}\n\n\t\tm_vAIList[i]->Update(ifps);\n\t}\n\tif (g_Engine.pInput->IsLBDown())\t\/\/shubiaozuojian\n\t{\n\t\tg_pSysControl->SetMouseGrab(1);\n\t\tm_pStarControl->Click();\n\t}\n\tif (g_Engine.pInput->IsKeyDown(CInput::KEY_ESC))\t\t\n\t{\n\t\tg_pSysControl->SetMouseGrab(0);\n\t}\n\tm_pCameraBase->SetMouseControls(g_pSysControl->GetMouseGrab());\n\tm_pCameraBase->Update(ifps);\n\n\tm_pRole->SetActorDirection(m_pCameraBase->GetViewDirection());\n\tm_pRole->UpdateActor(ifps);\n\tm_pCameraBase->SetPosition(m_pRole->GetActorPosition() + m_pRole->GetCameraOffset());\n\n\tvec3 x = m_pCameraBase->GetModelview().getRow3(0);\n\tvec3 y = m_pCameraBase->GetModelview().getRow3(1);\n\tvec3 z = m_pCameraBase->GetModelview().getRow3(2);\n\n\tmat4 r = mat4_identity;\n\n\tr.setColumn3(0, -x);\t\/\/\n\tr.setColumn3(1, z);\t\t\/\/\n\tr.setColumn3(2, y);\t\t\/\/\n\n\treturn 0;\n}\n\n\n<commit_msg>Signed-off-by: mrlitong <litongtongxue@gmail.com><commit_after>#include \"GameProcess.h\"\n#include \"Object.h\"\n#include \"Engine.h\"\n#include \"World.h\"\n#include \"App.h\"\n#include \"ToolsCamera.h\"\n#include \"ControlsApp.h\"\n#include \"MathLib.h\"\n#include \"Game.h\"\n#include \"Editor.h\"\n#include \"Input.h\"\n#include \"BlueRayUtils.h\"\n#include \"World.h\"\n#include \"Action.h\"\n#include \"FPSRoleLocal.h\"\n#include \"StarControl.h\"\n#include \"RayControl.h\"\n\nusing namespace MathLib;\n\nCGameProcess::CGameProcess(void)\n{\n\n}\n\nCGameProcess::~CGameProcess(void)\n{\n\n}\nint CGameProcess::Init()\n{\n\tg_Engine.pFileSystem->CacheFilesFormExt(\"char\");\n\tg_Engine.pFileSystem->CacheFilesFormExt(\"node\");\n\tg_Engine.pFileSystem->CacheFilesFormExt(\"smesh\");\n\tg_Engine.pFileSystem->CacheFilesFormExt(\"sanim\");\n\n\tg_Engine.pWorld->LoadWorld(\"data\/scene\/terrain\/test\/test.world\");\n\t\/\/g_Engine.pWorld->LoadWorld(\"data\/scene\/terrain\/cj\/cj.world\"); \n\tg_Engine.pControls->SetKeyPressFunc(KeyPress);\n\tg_Engine.pControls->SetKeyReleaseFunc(KeyRelease);\n\n\tm_pRole = new CFPSRoleLocal();\n\tm_pRole->Init(10001, \"data\/role\/hero\/FpsRole\/fps.char\");\t\t\n\n\tm_pRole->SetActorPosition(vec3(0, 0, 0));\t\/\/设置角色初始位置。以门处作为原点，三维坐标系vec3是向量\n\tm_pSkillSystem = new CSkillSystem(this);\n\tm_pCameraBase = new CCameraBase();\n\tm_pCameraBase->SetEnabled(1);\n\tg_pSysControl->SetMouseGrab(1);\n\n\tm_pStarControl = new CStarControl();\n\tm_pRayControl = new CRayControl();\n\n\treturn 1;\n}\n\nint CGameProcess::ShutDown()\t\t\t\/\/关闭游戏进程\n{\n\tdelete m_pRole;\n\tdelete m_pSkillSystem;\n\tdelete m_pCameraBase;\n\tdelete m_pStarControl;\n\tdelete m_pRayControl;\n\n\tDelAllListen();\n\treturn 0;\n}\n\nint CGameProcess::Update()\n{\n\tfloat ifps = g_Engine.pGame->GetIFps();\n\n\tif (g_Engine.pInput->IsKeyDown('1'))\n\t{\n\t\tCAction* pAction = m_pRole->OrceAction(\"attack02\");\n\t\tif (pAction)\n\t\t{\n\t\t\tpAction->SetupSkillThrow(vec3_zero, -1.0f, 2.0f);\n\t\t\tm_pRole->StopMove();\n\t\t}\n\t}\n\telse if (g_Engine.pInput->IsKeyDown('2'))\n\t{\n\t\tCAction* pAction = m_pRole->OrceAction(\"skill01\");\n\t\tif (pAction)\n\t\t{\n\t\t\tm_pRole->StopMove();\n\t\t}\n\t}\n\telse if (g_Engine.pInput->IsKeyDown('3'))\n\t{\n\t\tCAction* pAction = m_pRole->OrceAction(\"skill02\");\n\t\tif (pAction)\n\t\t{\n\t\t\tm_pRole->StopMove();\n\t\t\tCRoleBase* pTarget = NULL;\n\t\t\tfor (int i = 0; i < 20; i++)\n\t\t\t{\n\t\t\t\tfloat l = (m_vAIList[i]->GetPosition() - m_pRole->GetPosition()).length();\n\t\t\t\tif (l > 5.0f && l < 15.0f)\n\t\t\t\t{\n\t\t\t\t\tpTarget = m_vAIList[i];\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t\tif (pTarget)\n\t\t\t{\n\t\t\t\tCVector<int> vTarget;\n\t\t\t\tvTarget.Append(pTarget->GetRoleID());\n\t\t\t\tpAction->SetupSkillBulletTarget(vTarget);\n\t\t\t\tm_pRole->SetDirection((pTarget->GetPosition() - m_pRole->GetPosition()).normalize(), 1);\n\t\t\t}\n\t\t}\n\t}\n\telse if (g_Engine.pInput->IsKeyDown('4'))\/\/多发子弹\n\t{\n\t\tCAction* pAction = m_pRole->OrceAction(\"skill02\");\n\t\tif (pAction)\n\t\t{\n\t\t\tm_pRole->StopMove();\n\t\t\tCVector<int> vTarget;\n\t\t\tfor (int i = 0; i < 20; i++)\n\t\t\t{\n\t\t\t\tfloat l = (m_vAIList[i]->GetPosition() - m_pRole->GetPosition()).length();\n\t\t\t\tif (l > 5.0f && l < 20.0f)\n\t\t\t\t{\n\t\t\t\t\tvTarget.Append(m_vAIList[i]->GetRoleID());\n\t\t\t\t}\n\t\t\t}\n\t\t\tif (!vTarget.Empty())\n\t\t\t{\n\t\t\t\tpAction->SetupSkillBulletTarget(vTarget);\n\t\t\t}\n\t\t}\n\t}\n\telse if (g_Engine.pInput->IsKeyDown('5'))\n\t{\n\t\tCAction* pAction = m_pRole->OrceAction(\"skill03\");\n\t\tif (pAction)\n\t\t{\n\t\t\tm_pRole->StopMove();\n\t\t\tCVector<vec3> vPos;\n\t\t\tpAction->SetupSkillTargetPoint(vPos);\n\t\t}\n\t}\n\telse if (g_Engine.pInput->IsKeyDown('6'))\n\t{\n\t\tCAction* pAction = m_pRole->OrceAction(\"skill06\");\n\t\tif (pAction)\n\t\t{\n\t\t\tm_pRole->StopMove();\n\t\t\tCVector<vec3> vPos;\n\t\t\tfor (int i = 0; i < 20; i++)\n\t\t\t{\n\t\t\t\tfloat l = (m_vAIList[i]->GetPosition() - m_pRole->GetPosition()).length();\n\t\t\t\tif (l > 5.0f && l < 20.0f)\n\t\t\t\t\tvPos.Append(m_vAIList[i]->GetPosition());\n\n\t\t\t}\n\t\t\tpAction->SetupSkillTargetPoint(vPos);\n\t\t}\n\t}\n\telse if (g_Engine.pInput->IsKeyDown('7'))\n\t{\n\t\tCAction* pAction = m_pRole->OrceAction(\"skill05\");\n\t\tif (pAction)\n\t\t{\n\t\t\tm_pRole->StopMove();\n\t\t\tCVector<int> vTarget;\n\t\t\tfor (int i = 0; i < 20; i++)\n\t\t\t{\n\t\t\t\tfloat l = (m_vAIList[i]->GetPosition() - m_pRole->GetPosition()).length();\n\t\t\t\tif (l > 5.0f && l < 20.0f)\n\t\t\t\t\tvTarget.Append(m_vAIList[i]->GetRoleID());\n\t\t\t}\n\t\t\tif (!vTarget.Empty())\n\t\t\t{\n\t\t\t\tpAction->SetupSkillBulletTarget(vTarget);\n\t\t\t}\n\t\t}\n\t}\n\telse if (g_Engine.pInput->IsKeyDown('8'))\n\t{\n\t\tCAction* pAction = m_pRole->OrceAction(\"skill07\");\n\t\tif (pAction)\n\t\t{\n\t\t\tm_pRole->StopMove();\n\t\t\tCVector<vec3> vPos;\n\t\t\tfor (int i = 0; i < 20; i++)\n\t\t\t{\n\t\t\t\tfloat l = (m_vAIList[i]->GetPosition() - m_pRole->GetPosition()).length();\n\t\t\t\tif (l > 5.0f && l < 20.0f)\n\t\t\t\t\tvPos.Append(m_vAIList[i]->GetPosition());\n\t\t\t}\n\t\t\tpAction->SetupSkillBulletPosition(vPos);\n\t\t}\n\t}\n\telse if (g_Engine.pInput->IsKeyDown('9'))\n\t{\n\t\tCAction* pAction = m_pRole->OrceAction(\"skill08\");\n\t\tif (pAction)\n\t\t{\n\t\t\tm_pRole->StopMove();\n\t\t\tpAction->SetupSkillBulletDirection(1);\n\t\t}\n\n\t}\n\telse if (g_Engine.pInput->IsKeyUp(CInput::KEY_ESC))\n\t{\n\t\tg_Engine.pApp->Exit();\n\t}\n\tif(g_Engine.pInput->IsLBDown())\n\t{\n\t\tvec3 p0,p1;\n\t\tBlueRay::GetPlayerMouseDirection(p0,p1);\n\t\tvec3 vRetPoint,vRetNormal;\n\t\tint nS = -1;\n\t\tg_Engine.pWorld->GetIntersection(p0,p1,CBRObject::MASK_SCENE,vRetPoint,vRetNormal,nS);\n\n\t\tif(-1 != nS)\n\t\t{\n\t\t\tm_pRole->MoveToPath(vRetPoint);\n\t\t}\n\t}\n\tfor(int i = 0;i < 20;i++)\n\t{\n\t\tif(!m_vAIList[i]->IsMoveing())\n\t\t{\n\t\t\tvec3 vPos = vec3(g_Engine.pGame->GetRandomFloat(-20.0f,20.0f),g_Engine.pGame->GetRandomFloat(-20.0f,20.0f),1.1f);\n\t\t\tm_vAIList[i]->MoveToPath(vPos);\n\t\t}\n\n\t\tm_vAIList[i]->Update(ifps);\n\t}\n\tif (g_Engine.pInput->IsLBDown())\t\/\/shubiaozuojian\n\t{\n\t\tg_pSysControl->SetMouseGrab(1);\n\t\tm_pStarControl->Click();\n\t}\n\tif (g_Engine.pInput->IsKeyDown(CInput::KEY_ESC))\t\t\n\t{\n\t\tg_pSysControl->SetMouseGrab(0);\n\t}\n\tm_pCameraBase->SetMouseControls(g_pSysControl->GetMouseGrab());\n\tm_pCameraBase->Update(ifps);\n\n\tm_pRole->SetActorDirection(m_pCameraBase->GetViewDirection());\n\tm_pRole->UpdateActor(ifps);\n\tm_pCameraBase->SetPosition(m_pRole->GetActorPosition() + m_pRole->GetCameraOffset());\n\n\tvec3 x = m_pCameraBase->GetModelview().getRow3(0);\n\tvec3 y = m_pCameraBase->GetModelview().getRow3(1);\n\tvec3 z = m_pCameraBase->GetModelview().getRow3(2);\n\n\tmat4 r = mat4_identity;\n\n\tr.setColumn3(0, -x);\t\/\/\n\tr.setColumn3(1, z);\t\t\/\/\n\tr.setColumn3(2, y);\t\t\/\/\n\n\tm_pRole->UpdateTransform(r);\n\n\n\n\treturn 0;\n}\n\n\n<|endoftext|>"} {"text":"<commit_before>\/***************************************************************************\n * Copyright (C) 2004 by Sashmit Bhaduri *\n * smt@vfemail.net *\n * *\n * Licensed under GPL. *\n ***************************************************************************\/\n\n#include \"articleviewer.h\"\n#include \"feed.h\"\n\n#include <kapplication.h>\n#include <kglobalsettings.h>\n#include <kstandarddirs.h>\n#include <klocale.h>\n\n#include <qdatetime.h>\n#include <qvaluelist.h>\n\nusing namespace Akregator;\n\n\/\/ from kmail::headerstyle.cpp\nstatic inline QString directionOf(const QString &str)\n{\n return str.isRightToLeft() ? \"rtl\" : \"ltr\" ;\n}\n\nint pointsToPixel(const QPaintDeviceMetrics &metrics, int pointSize)\n{\n return ( pointSize * metrics.logicalDpiY() + 36 ) \/ 72 ;\n}\n\nArticleViewer::ArticleViewer(QWidget *parent, const char *name)\n : KHTMLPart(parent, name), m_metrics(widget())\n{\n generateCSS();\n \/\/ to be on a safe side\n setJScriptEnabled(false);\n setJavaEnabled(false);\n setMetaRefreshEnabled(false);\n setPluginsEnabled(false);\n setDNDEnabled(false);\n setAutoloadImages(true);\n setStatusMessagesEnabled(true);\n}\n\nvoid ArticleViewer::openDefault()\n{\n openURL( ::locate( \"data\", \"akregatorpart\/welcome.html\" ) );\n}\n\nvoid ArticleViewer::generateCSS()\n{\n const QColorGroup & cg = QApplication::palette().active();\n\tm_htmlHead=QString(\"<!DOCTYPE HTML PUBLIC \\\"-\/\/W3C\/\/DTD HTML 4.01 Transitional\/\/EN\\\">\\n\"\n\t\t\t\t\t\t\"<html><head><title><\/title><\/head><body>\");\n m_htmlHead += QString (\n \"<style type=\\\"text\/css\\\">\"\n \"body {\\n\"\n \" font-family: \\\"%1\\\" ! important;\\n\"\n\/\/ from kmail::headerstyle.cpp\n \" font-size: %2 ! important;\\n\"\n \" color: %3 ! important;\\n\"\n \" background: %4 ! important;\\n\"\n \"}\\n\\n\"\n \"a {\\n\"\n \" color: %5 ! important;\\n\"\n \" text-decoration: none ! important;\"\n \"}\\n\\n\"\n \"#headerbox {\\n\"\n \" background: %6 ! important;\\n\"\n \" color: %7 ! important;\\n\"\n \" border:1px solid #000;\\n\"\n \" margin-bottom: 10pt;\\n\"\n \" width: 100%;\\n\"\n \"}\\n\\n\"\n \"#headertitle {\\n\"\n \" background: %8 ! important;\\n\"\n \" padding:2px;\\n\"\n \" color: %9 ! important;\\n\"\n \" font-weight: bold;\\n\"\n \"}\\n\\n\"\n \"#header {\\n\"\n \" font-weight: bold;\\n\"\n \" padding:2px;\\n\"\n \" margin-right: 5px;\\n\"\n \"}\\n\\n\"\n \"#headertext {\\n\"\n \"}\\n\\n\"\n \"#headimage {\\n\"\n \"float: right;\\n\"\n \"}\\n\\n\"\n \"#content {\\n\"\n \"clear: none;\\n\"\n \"overflow: auto;\\n\"\n \"}\\n\\n\"\n \"<\/style>\\n\")\n .arg(KGlobalSettings::generalFont().family()).\n arg(QString::number( pointsToPixel( m_metrics, KGlobalSettings::generalFont().pointSize()))+\"px\").\n arg(cg.text().name()).\n arg(cg.base().name()).\n arg(cg.link().name()).\n arg(cg.background().name()).\n arg(cg.text().name()).\n arg(cg.highlight().name()).\n arg(cg.highlightedText().name());\n}\n\nvoid ArticleViewer::reload()\n{\n generateCSS();\n begin( KURL( \"file:\"+KGlobal::dirs()->saveLocation(\"cache\", \"akregator\/Media\/\") ) );\n write(m_htmlHead + m_currentText);\n end();\n}\n\nQString ArticleViewer::formatArticle(Feed *f, MyArticle a)\n{\n QString text;\n text = QString(\"<div id=\\\"headerbox\\\" dir=\\\"%1\\\">\\n\").arg(QApplication::reverseLayout() ? \"rtl\" : \"ltr\");\n\n if (!a.title().isEmpty())\n {\n text += QString(\"<div id=\\\"headertitle\\\" dir=\\\"%1\\\">\\n\").arg(directionOf(a.title()));\n text += a.title()+\"<\/div>\\n\";\n }\n if (a.pubDate().isValid())\n {\n text += QString(\"<span id=\\\"header\\\" dir=\\\"%1\\\">\").arg(directionOf(i18n(\"Date\")));\n text += QString (\"%1:\").arg(i18n(\"Date\"));\n text += \"<\/span><span id=\\\"headertext\\\">\";\n text += KGlobal::locale()->formatDateTime(a.pubDate(), false, false)+\"<\/span>\\n\"; \/\/ TODO: might need RTL?\n }\n text += \"<\/div>\\n\"; \/\/ end headerbox\n\n if (f && !f->image.isNull())\n text += QString(\"<a href=\\\"\"+f->htmlUrl+\"\\\"><img id=\\\"headimage\\\" src=\\\"\"+f->title()+\".png\"+\"\\\"><\/a>\\n\");\n\n text += \"<div id=\\\"content\\\">\"+a.description();\n if (a.link().isValid())\n {\n if (!a.description().isNull())\n text += \"<p>\\n\";\n text += \"<a href=\\\"\";\n text += a.link().url();\n text += \"\\\">\" + i18n( \"Full Story\" ) + \"<\/a>\";\n if (!a.description().isNull()) \n text += \"<p>\\n\";\n }\n text += \"<\/div>\";\n return text;\n\n}\n\nvoid ArticleViewer::show(Feed *f)\n{\n QString art, text;\n \n begin( KURL( \"file:\"+KGlobal::dirs()->saveLocation(\"cache\", \"akregator\/Media\/\") ) );\n write(m_htmlHead);\n \n ArticleSequence::iterator it;\n for ( it = f->articles.begin(); it != f->articles.end(); ++it )\n {\n art=formatArticle(0, *it); \/\/ we set f to 0 to not show feed image\n text += art;\n write(art);\n }\n \n m_currentText = text + \"<\/body><\/html>\";\n write(\"<\/body><\/html>\");\n end();\n}\n\nvoid ArticleViewer::show(Feed *f, MyArticle a)\n{\n begin( KURL( \"file:\"+KGlobal::dirs()->saveLocation(\"cache\", \"akregator\/Media\/\") ) );\n\n QString text=formatArticle(f, a) +\"<\/body><\/html>\";\n m_currentText=text;\n\n write(m_htmlHead + text);\n end();\n}\n\n#include \"articleviewer.moc\"\n<commit_msg>pretty (um, I think) up combined mode<commit_after>\/***************************************************************************\n * Copyright (C) 2004 by Sashmit Bhaduri *\n * smt@vfemail.net *\n * *\n * Licensed under GPL. *\n ***************************************************************************\/\n\n#include \"articleviewer.h\"\n#include \"feed.h\"\n\n#include <kapplication.h>\n#include <kglobalsettings.h>\n#include <kstandarddirs.h>\n#include <klocale.h>\n\n#include <qdatetime.h>\n#include <qvaluelist.h>\n\nusing namespace Akregator;\n\n\/\/ from kmail::headerstyle.cpp\nstatic inline QString directionOf(const QString &str)\n{\n return str.isRightToLeft() ? \"rtl\" : \"ltr\" ;\n}\n\nint pointsToPixel(const QPaintDeviceMetrics &metrics, int pointSize)\n{\n return ( pointSize * metrics.logicalDpiY() + 36 ) \/ 72 ;\n}\n\nArticleViewer::ArticleViewer(QWidget *parent, const char *name)\n : KHTMLPart(parent, name), m_metrics(widget())\n{\n generateCSS();\n \/\/ to be on a safe side\n setJScriptEnabled(false);\n setJavaEnabled(false);\n setMetaRefreshEnabled(false);\n setPluginsEnabled(false);\n setDNDEnabled(false);\n setAutoloadImages(true);\n setStatusMessagesEnabled(true);\n}\n\nvoid ArticleViewer::openDefault()\n{\n openURL( ::locate( \"data\", \"akregatorpart\/welcome.html\" ) );\n}\n\nvoid ArticleViewer::generateCSS()\n{\n const QColorGroup & cg = QApplication::palette().active();\n\tm_htmlHead=QString(\"<!DOCTYPE HTML PUBLIC \\\"-\/\/W3C\/\/DTD HTML 4.01 Transitional\/\/EN\\\">\\n\"\n\t\t\t\t\t\t\"<html><head><title><\/title><\/head><body>\");\n m_htmlHead += QString (\n \"<style type=\\\"text\/css\\\">\"\n \"body {\\n\"\n \" font-family: \\\"%1\\\" ! important;\\n\"\n\/\/ from kmail::headerstyle.cpp\n \" font-size: %2 ! important;\\n\"\n \" color: %3 ! important;\\n\"\n \" background: %4 ! important;\\n\"\n \"}\\n\\n\"\n \"a {\\n\"\n \" color: %5 ! important;\\n\"\n \" text-decoration: none ! important;\"\n \"}\\n\\n\"\n \"#headerbox {\\n\"\n \" background: %6 ! important;\\n\"\n \" color: %7 ! important;\\n\"\n \" border:1px solid #000;\\n\"\n \" margin-bottom: 10pt;\\n\"\n \" width: 100%;\\n\"\n \"}\\n\\n\"\n \"#headertitle {\\n\"\n \" background: %8 ! important;\\n\"\n \" padding:2px;\\n\"\n \" color: %9 ! important;\\n\"\n \" font-weight: bold;\\n\"\n \"}\\n\\n\"\n \"#header {\\n\"\n \" font-weight: bold;\\n\"\n \" padding:2px;\\n\"\n \" margin-right: 5px;\\n\"\n \"}\\n\\n\"\n \"#headertext {\\n\"\n \"}\\n\\n\"\n \"#headimage {\\n\"\n \"float: right;\\n\"\n \"}\\n\\n\"\n \"#content {\\n\"\n \"clear: none;\\n\"\n \"overflow: auto;\\n\"\n \"}\\n\\n\"\n \"#article {\\n\"\n \"overflow: hidden;\\n\"\n \"border:1px dashed #000;\\n\"\n \"padding: 3px;\\n\"\n \"padding-right: 6px;}\\n\\n\"\n \"<\/style>\\n\")\n .arg(KGlobalSettings::generalFont().family()).\n arg(QString::number( pointsToPixel( m_metrics, KGlobalSettings::generalFont().pointSize()))+\"px\").\n arg(cg.text().name()).\n arg(cg.base().name()).\n arg(cg.link().name()).\n arg(cg.background().name()).\n arg(cg.text().name()).\n arg(cg.highlight().name()).\n arg(cg.highlightedText().name());\n}\n\nvoid ArticleViewer::reload()\n{\n generateCSS();\n begin( KURL( \"file:\"+KGlobal::dirs()->saveLocation(\"cache\", \"akregator\/Media\/\") ) );\n write(m_htmlHead + m_currentText);\n end();\n}\n\nQString ArticleViewer::formatArticle(Feed *f, MyArticle a)\n{\n QString text;\n text = QString(\"<div id=\\\"headerbox\\\" dir=\\\"%1\\\">\\n\").arg(QApplication::reverseLayout() ? \"rtl\" : \"ltr\");\n\n if (!a.title().isEmpty())\n {\n text += QString(\"<div id=\\\"headertitle\\\" dir=\\\"%1\\\">\\n\").arg(directionOf(a.title()));\n text += a.title()+\"<\/div>\\n\";\n }\n if (a.pubDate().isValid())\n {\n text += QString(\"<span id=\\\"header\\\" dir=\\\"%1\\\">\").arg(directionOf(i18n(\"Date\")));\n text += QString (\"%1:\").arg(i18n(\"Date\"));\n text += \"<\/span><span id=\\\"headertext\\\">\";\n text += KGlobal::locale()->formatDateTime(a.pubDate(), false, false)+\"<\/span>\\n\"; \/\/ TODO: might need RTL?\n }\n text += \"<\/div>\\n\"; \/\/ end headerbox\n\n if (f && !f->image.isNull())\n text += QString(\"<a href=\\\"\"+f->htmlUrl+\"\\\"><img id=\\\"headimage\\\" src=\\\"\"+f->title()+\".png\"+\"\\\"><\/a>\\n\");\n\n text += \"<div id=\\\"content\\\">\"+a.description();\n if (a.link().isValid())\n {\n if (!a.description().isNull())\n text += \"<p>\\n\";\n text += \"<a href=\\\"\";\n text += a.link().url();\n text += \"\\\">\" + i18n( \"Full Story\" ) + \"<\/a>\";\n if (!a.description().isNull()) \n text += \"<p>\\n\";\n }\n text += \"<\/div>\";\n return text;\n\n}\n\nvoid ArticleViewer::show(Feed *f)\n{\n QString art, text;\n \n begin( KURL( \"file:\"+KGlobal::dirs()->saveLocation(\"cache\", \"akregator\/Media\/\") ) );\n write(m_htmlHead);\n \n ArticleSequence::iterator it;\n for ( it = f->articles.begin(); it != f->articles.end(); ++it )\n {\n \/\/ we set f to 0 to not show feed image\n art=\"<p><div id=\\\"article\\\">\"+formatArticle(0, *it)+\"<\/div><p>\"; \n text += art;\n write(art);\n }\n \n m_currentText = text + \"<\/body><\/html>\";\n write(\"<\/body><\/html>\");\n end();\n}\n\nvoid ArticleViewer::show(Feed *f, MyArticle a)\n{\n begin( KURL( \"file:\"+KGlobal::dirs()->saveLocation(\"cache\", \"akregator\/Media\/\") ) );\n\n QString text=formatArticle(f, a) +\"<\/body><\/html>\";\n m_currentText=text;\n\n write(m_htmlHead + text);\n end();\n}\n\n#include \"articleviewer.moc\"\n<|endoftext|>"} {"text":"<commit_before><commit_msg>Update android\/ringqt\/project\/main.cpp<commit_after><|endoftext|>"} {"text":"<commit_before>#include \"stdafx.h\"\n\nint _tmain(int, _TCHAR*[])\n{\n\tFreeConsole();\n\tRegisterHotKey(nullptr, 1, MOD_CONTROL | MOD_ALT, VK_CANCEL);\n\tMSG msg = {0};\n\twhile (GetMessage(&msg, nullptr, 0, 0) != NULL)\n\t{\n\t\tif (msg.message == WM_HOTKEY)\n\t\t{\n\t\t\tauto hDevInfo = SetupDiGetClassDevs(&GUID_DEVCLASS_DISPLAY, REGSTR_KEY_PCIENUM, nullptr, DIGCF_PRESENT | DIGCF_ALLCLASSES);\n\t\t\tSP_DEVINFO_DATA deviceInfoData;\n\t\t\tdeviceInfoData.cbSize = sizeof(SP_DEVINFO_DATA);\n\t\t\tfor (DWORD i = 0; SetupDiEnumDeviceInfo(hDevInfo, i, &deviceInfoData); i++)\n\t\t\t{\n\t\t\t\tSP_PROPCHANGE_PARAMS params;\n\t\t\t\tparams.ClassInstallHeader.cbSize = sizeof(SP_CLASSINSTALL_HEADER);\n\t\t\t\tparams.ClassInstallHeader.InstallFunction = DIF_PROPERTYCHANGE;\n\t\t\t\tparams.Scope = DICS_FLAG_GLOBAL ;\n\t\t\t\tparams.StateChange = DICS_DISABLE;\n\t\t\t\tSetupDiSetClassInstallParams(hDevInfo, &deviceInfoData, ¶ms.ClassInstallHeader, sizeof(params));\n\t\t\t\tSetupDiCallClassInstaller(DIF_PROPERTYCHANGE, hDevInfo, &deviceInfoData);\n\t\t\t\tparams.StateChange = DICS_ENABLE;\n\t\t\t\tSetupDiSetClassInstallParams(hDevInfo, &deviceInfoData, ¶ms.ClassInstallHeader, sizeof(params));\n\t\t\t\tSetupDiCallClassInstaller(DIF_PROPERTYCHANGE, hDevInfo, &deviceInfoData);\n\t\t\t}\n\t\t}\n\t}\n\n\treturn EXIT_SUCCESS;\n}\n<commit_msg>Minor fixes and formatting changes<commit_after>#include \"stdafx.h\"\n\nint _tmain(int, _TCHAR*[])\n{\n FreeConsole();\n RegisterHotKey(nullptr, NULL, MOD_CONTROL | MOD_ALT, VK_CANCEL);\n MSG msg = { nullptr };\n while (GetMessage(&msg, nullptr, 0, 0))\n {\n if (msg.message == WM_HOTKEY)\n {\n auto hDevInfo = SetupDiGetClassDevs(&GUID_DEVCLASS_DISPLAY, REGSTR_KEY_PCIENUM, nullptr, DIGCF_PRESENT | DIGCF_ALLCLASSES);\n SP_DEVINFO_DATA deviceInfoData;\n deviceInfoData.cbSize = sizeof(SP_DEVINFO_DATA);\n for (DWORD i = 0; SetupDiEnumDeviceInfo(hDevInfo, i, &deviceInfoData); i++)\n {\n SP_PROPCHANGE_PARAMS params;\n params.ClassInstallHeader.cbSize = sizeof(SP_CLASSINSTALL_HEADER);\n params.ClassInstallHeader.InstallFunction = DIF_PROPERTYCHANGE;\n params.Scope = DICS_FLAG_GLOBAL;\n params.StateChange = DICS_DISABLE;\n SetupDiSetClassInstallParams(hDevInfo, &deviceInfoData, ¶ms.ClassInstallHeader, sizeof(params));\n SetupDiCallClassInstaller(DIF_PROPERTYCHANGE, hDevInfo, &deviceInfoData);\n params.StateChange = DICS_ENABLE;\n SetupDiSetClassInstallParams(hDevInfo, &deviceInfoData, ¶ms.ClassInstallHeader, sizeof(params));\n SetupDiCallClassInstaller(DIF_PROPERTYCHANGE, hDevInfo, &deviceInfoData);\n }\n }\n }\n\n return EXIT_SUCCESS;\n}\n<|endoftext|>"} {"text":"<commit_before>\/*\n * The Apache Software License, Version 1.1\n *\n * Copyright (c) 2001 The Apache Software Foundation. All rights\n * reserved.\n *\n * Redistribution and use in source and binary forms, with or without\n * modification, are permitted provided that the following conditions\n * are met:\n *\n * 1. Redistributions of source code must retain the above copyright\n * notice, this list of conditions and the following disclaimer.\n *\n * 2. Redistributions in binary form must reproduce the above copyright\n * notice, this list of conditions and the following disclaimer in\n * the documentation and\/or other materials provided with the\n * distribution.\n *\n * 3. The end-user documentation included with the redistribution,\n * if any, must include the following acknowledgment:\n * \"This product includes software developed by the\n * Apache Software Foundation (http:\/\/www.apache.org\/).\"\n * Alternately, this acknowledgment may appear in the software itself,\n * if and wherever such third-party acknowledgments normally appear.\n *\n * 4. The names \"Xerces\" and \"Apache Software Foundation\" must\n * not be used to endorse or promote products derived from this\n * software without prior written permission. For written\n * permission, please contact apache\\@apache.org.\n *\n * 5. Products derived from this software may not be called \"Apache\",\n * nor may \"Apache\" appear in their name, without prior written\n * permission of the Apache Software Foundation.\n *\n * THIS SOFTWARE IS PROVIDED ``AS IS'' AND ANY EXPRESSED OR IMPLIED\n * WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES\n * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE\n * DISCLAIMED. IN NO EVENT SHALL THE APACHE SOFTWARE FOUNDATION OR\n * ITS CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,\n * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT\n * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF\n * USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND\n * ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,\n * OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT\n * OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF\n * SUCH DAMAGE.\n * ====================================================================\n *\n * This software consists of voluntary contributions made by many\n * individuals on behalf of the Apache Software Foundation, and was\n * originally based on software copyright (c) 2001, International\n * Business Machines, Inc., http:\/\/www.ibm.com . For more information\n * on the Apache Software Foundation, please see\n * <http:\/\/www.apache.org\/>.\n *\/\n\n\/*\n * $Id$\n * $Log$\n * Revision 1.10 2003\/12\/17 00:18:38 cargilld\n * Update to memory management so that the static memory manager (one used to call Initialize) is only for static data.\n *\n * Revision 1.9 2003\/10\/01 16:32:41 neilg\n * improve handling of out of memory conditions, bug #23415. Thanks to David Cargill.\n *\n * Revision 1.8 2003\/10\/01 00:27:12 knoaman\n * Performance: call a static method to check the validity of URI instead of\n * creating\/deleting local objects.\n *\n * Revision 1.7 2003\/09\/30 21:31:30 peiyongz\n * Implementation of Serialization\/Deserialization\n *\n * Revision 1.6 2003\/05\/18 14:02:07 knoaman\n * Memory manager implementation: pass per instance manager.\n *\n * Revision 1.5 2003\/05\/16 06:01:57 knoaman\n * Partial implementation of the configurable memory manager.\n *\n * Revision 1.4 2003\/05\/15 18:53:26 knoaman\n * Partial implementation of the configurable memory manager.\n *\n * Revision 1.3 2002\/12\/18 14:17:55 gareth\n * Fix to bug #13438. When you eant a vector that calls delete[] on its members you should use RefArrayVectorOf.\n *\n * Revision 1.2 2002\/11\/04 14:53:27 tng\n * C++ Namespace Support.\n *\n * Revision 1.1.1.1 2002\/02\/01 22:22:40 peiyongz\n * sane_include\n *\n * Revision 1.10 2001\/10\/10 14:18:26 peiyongz\n * no message\n *\n * Revision 1.9 2001\/10\/09 20:53:58 peiyongz\n * init(): take 1 arg.\n *\n * Revision 1.8 2001\/10\/02 18:59:29 peiyongz\n * Invalid_Facet_Tag to display the tag name\n *\n * Revision 1.7 2001\/09\/24 15:33:15 peiyongz\n * DTV Reorganization: virtual methods moved to *.cpp\n *\n * Revision 1.6 2001\/09\/19 18:49:17 peiyongz\n * DTV reorganization: move inline to class declaration to avoid inline\n * function interdependency.\n *\n * Revision 1.5 2001\/09\/18 20:38:03 peiyongz\n * DTV reorganization: inherit from AbstractStringValidator.\n *\n * Revision 1.4 2001\/08\/21 18:42:53 peiyongz\n * Bugzilla# 2816: cleanUp() declared with external linkage and called\n * before defined as inline\n *\n * Revision 1.3 2001\/08\/14 22:11:56 peiyongz\n * new exception message added\n *\n * Revision 1.2 2001\/08\/10 16:21:19 peiyongz\n * use XMLUri instead of XMLURL\n *\n * Revision 1.1 2001\/08\/01 18:49:16 peiyongz\n * AnyRUIDatatypeValidator\n *\n *\n *\/\n\n\/\/ ---------------------------------------------------------------------------\n\/\/ Includes\n\/\/ ---------------------------------------------------------------------------\n#include <xercesc\/validators\/datatype\/AnyURIDatatypeValidator.hpp>\n#include <xercesc\/validators\/datatype\/InvalidDatatypeFacetException.hpp>\n#include <xercesc\/validators\/datatype\/InvalidDatatypeValueException.hpp>\n#include <xercesc\/util\/OutOfMemoryException.hpp>\n\nXERCES_CPP_NAMESPACE_BEGIN\n\n\/\/\n\/\/http:\/\/www.template.com\n\/\/\nstatic const XMLCh BASE_URI[] =\n{\n chLatin_h, chLatin_t, chLatin_t, chLatin_p,\n chColon, chForwardSlash, chForwardSlash,\n chLatin_w, chLatin_w, chLatin_w, chPeriod,\n chLatin_t, chLatin_e, chLatin_m, chLatin_p, chLatin_l,\n chLatin_a, chLatin_t, chLatin_e, chPeriod,\n chLatin_c, chLatin_o, chLatin_m, chNull\n};\n\n\/\/ ---------------------------------------------------------------------------\n\/\/ Constructors and Destructor\n\/\/ ---------------------------------------------------------------------------\nAnyURIDatatypeValidator::AnyURIDatatypeValidator(MemoryManager* const manager)\n:AbstractStringValidator(0, 0, 0, DatatypeValidator::AnyURI, manager)\n{}\n\nAnyURIDatatypeValidator::~AnyURIDatatypeValidator()\n{ \n}\n\nAnyURIDatatypeValidator::AnyURIDatatypeValidator(\n DatatypeValidator* const baseValidator\n , RefHashTableOf<KVStringPair>* const facets\n , RefArrayVectorOf<XMLCh>* const enums\n , const int finalSet\n , MemoryManager* const manager)\n:AbstractStringValidator(baseValidator, facets, finalSet, DatatypeValidator::AnyURI, manager)\n{\n try\n {\n init(enums, manager);\n }\n catch(const OutOfMemoryException&)\n {\n throw;\n }\n catch (...)\n { \n throw;\n }\n}\n\nDatatypeValidator* AnyURIDatatypeValidator::newInstance(\n RefHashTableOf<KVStringPair>* const facets\n , RefArrayVectorOf<XMLCh>* const enums\n , const int finalSet\n , MemoryManager* const manager)\n{\n return (DatatypeValidator*) new (manager) AnyURIDatatypeValidator(this, facets, enums, finalSet, manager);\n}\n\n\/\/ ---------------------------------------------------------------------------\n\/\/ Utilities\n\/\/ ---------------------------------------------------------------------------\n\nvoid AnyURIDatatypeValidator::checkValueSpace(const XMLCh* const content\n , MemoryManager* const manager)\n{\n\n \/\/ check 3.2.17.c0 must: URI (rfc 2396\/2723)\n try\n {\n \/\/ Support for relative URLs\n \/\/ According to Java 1.1: URLs may also be specified with a\n \/\/ String and the URL object that it is related to.\n \/\/\n if (XMLString::stringLen(content))\n { \n if (!XMLUri::isValidURI(true, content))\n ThrowXMLwithMemMgr1(InvalidDatatypeValueException\n , XMLExcepts::VALUE_URI_Malformed\n , content\n , manager);\n }\n }\n catch(const OutOfMemoryException&)\n {\n throw;\n }\n catch (...)\n {\n ThrowXMLwithMemMgr1(InvalidDatatypeValueException\n , XMLExcepts::VALUE_URI_Malformed\n , content\n , manager);\n }\n\n}\n\n\/***\n * Support for Serialization\/De-serialization\n ***\/\n\nIMPL_XSERIALIZABLE_TOCREATE(AnyURIDatatypeValidator)\n\nvoid AnyURIDatatypeValidator::serialize(XSerializeEngine& serEng)\n{\n AbstractStringValidator::serialize(serEng);\n}\n\nXERCES_CPP_NAMESPACE_END\n\n\/**\n * End of file AnyURIDatatypeValidator.cpp\n *\/\n<commit_msg>remove unused static member<commit_after>\/*\n * The Apache Software License, Version 1.1\n *\n * Copyright (c) 2001-2004 The Apache Software Foundation. All rights\n * reserved.\n *\n * Redistribution and use in source and binary forms, with or without\n * modification, are permitted provided that the following conditions\n * are met:\n *\n * 1. Redistributions of source code must retain the above copyright\n * notice, this list of conditions and the following disclaimer.\n *\n * 2. Redistributions in binary form must reproduce the above copyright\n * notice, this list of conditions and the following disclaimer in\n * the documentation and\/or other materials provided with the\n * distribution.\n *\n * 3. The end-user documentation included with the redistribution,\n * if any, must include the following acknowledgment:\n * \"This product includes software developed by the\n * Apache Software Foundation (http:\/\/www.apache.org\/).\"\n * Alternately, this acknowledgment may appear in the software itself,\n * if and wherever such third-party acknowledgments normally appear.\n *\n * 4. The names \"Xerces\" and \"Apache Software Foundation\" must\n * not be used to endorse or promote products derived from this\n * software without prior written permission. For written\n * permission, please contact apache\\@apache.org.\n *\n * 5. Products derived from this software may not be called \"Apache\",\n * nor may \"Apache\" appear in their name, without prior written\n * permission of the Apache Software Foundation.\n *\n * THIS SOFTWARE IS PROVIDED ``AS IS'' AND ANY EXPRESSED OR IMPLIED\n * WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES\n * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE\n * DISCLAIMED. IN NO EVENT SHALL THE APACHE SOFTWARE FOUNDATION OR\n * ITS CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,\n * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT\n * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF\n * USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND\n * ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,\n * OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT\n * OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF\n * SUCH DAMAGE.\n * ====================================================================\n *\n * This software consists of voluntary contributions made by many\n * individuals on behalf of the Apache Software Foundation, and was\n * originally based on software copyright (c) 2001, International\n * Business Machines, Inc., http:\/\/www.ibm.com . For more information\n * on the Apache Software Foundation, please see\n * <http:\/\/www.apache.org\/>.\n *\/\n\n\/*\n * $Id$\n * $Log$\n * Revision 1.11 2004\/01\/12 23:02:18 neilg\n * remove unused static member\n *\n * Revision 1.10 2003\/12\/17 00:18:38 cargilld\n * Update to memory management so that the static memory manager (one used to call Initialize) is only for static data.\n *\n * Revision 1.9 2003\/10\/01 16:32:41 neilg\n * improve handling of out of memory conditions, bug #23415. Thanks to David Cargill.\n *\n * Revision 1.8 2003\/10\/01 00:27:12 knoaman\n * Performance: call a static method to check the validity of URI instead of\n * creating\/deleting local objects.\n *\n * Revision 1.7 2003\/09\/30 21:31:30 peiyongz\n * Implementation of Serialization\/Deserialization\n *\n * Revision 1.6 2003\/05\/18 14:02:07 knoaman\n * Memory manager implementation: pass per instance manager.\n *\n * Revision 1.5 2003\/05\/16 06:01:57 knoaman\n * Partial implementation of the configurable memory manager.\n *\n * Revision 1.4 2003\/05\/15 18:53:26 knoaman\n * Partial implementation of the configurable memory manager.\n *\n * Revision 1.3 2002\/12\/18 14:17:55 gareth\n * Fix to bug #13438. When you eant a vector that calls delete[] on its members you should use RefArrayVectorOf.\n *\n * Revision 1.2 2002\/11\/04 14:53:27 tng\n * C++ Namespace Support.\n *\n * Revision 1.1.1.1 2002\/02\/01 22:22:40 peiyongz\n * sane_include\n *\n * Revision 1.10 2001\/10\/10 14:18:26 peiyongz\n * no message\n *\n * Revision 1.9 2001\/10\/09 20:53:58 peiyongz\n * init(): take 1 arg.\n *\n * Revision 1.8 2001\/10\/02 18:59:29 peiyongz\n * Invalid_Facet_Tag to display the tag name\n *\n * Revision 1.7 2001\/09\/24 15:33:15 peiyongz\n * DTV Reorganization: virtual methods moved to *.cpp\n *\n * Revision 1.6 2001\/09\/19 18:49:17 peiyongz\n * DTV reorganization: move inline to class declaration to avoid inline\n * function interdependency.\n *\n * Revision 1.5 2001\/09\/18 20:38:03 peiyongz\n * DTV reorganization: inherit from AbstractStringValidator.\n *\n * Revision 1.4 2001\/08\/21 18:42:53 peiyongz\n * Bugzilla# 2816: cleanUp() declared with external linkage and called\n * before defined as inline\n *\n * Revision 1.3 2001\/08\/14 22:11:56 peiyongz\n * new exception message added\n *\n * Revision 1.2 2001\/08\/10 16:21:19 peiyongz\n * use XMLUri instead of XMLURL\n *\n * Revision 1.1 2001\/08\/01 18:49:16 peiyongz\n * AnyRUIDatatypeValidator\n *\n *\n *\/\n\n\/\/ ---------------------------------------------------------------------------\n\/\/ Includes\n\/\/ ---------------------------------------------------------------------------\n#include <xercesc\/validators\/datatype\/AnyURIDatatypeValidator.hpp>\n#include <xercesc\/validators\/datatype\/InvalidDatatypeFacetException.hpp>\n#include <xercesc\/validators\/datatype\/InvalidDatatypeValueException.hpp>\n#include <xercesc\/util\/OutOfMemoryException.hpp>\n\nXERCES_CPP_NAMESPACE_BEGIN\n\n\/\/ ---------------------------------------------------------------------------\n\/\/ Constructors and Destructor\n\/\/ ---------------------------------------------------------------------------\nAnyURIDatatypeValidator::AnyURIDatatypeValidator(MemoryManager* const manager)\n:AbstractStringValidator(0, 0, 0, DatatypeValidator::AnyURI, manager)\n{}\n\nAnyURIDatatypeValidator::~AnyURIDatatypeValidator()\n{ \n}\n\nAnyURIDatatypeValidator::AnyURIDatatypeValidator(\n DatatypeValidator* const baseValidator\n , RefHashTableOf<KVStringPair>* const facets\n , RefArrayVectorOf<XMLCh>* const enums\n , const int finalSet\n , MemoryManager* const manager)\n:AbstractStringValidator(baseValidator, facets, finalSet, DatatypeValidator::AnyURI, manager)\n{\n try\n {\n init(enums, manager);\n }\n catch(const OutOfMemoryException&)\n {\n throw;\n }\n catch (...)\n { \n throw;\n }\n}\n\nDatatypeValidator* AnyURIDatatypeValidator::newInstance(\n RefHashTableOf<KVStringPair>* const facets\n , RefArrayVectorOf<XMLCh>* const enums\n , const int finalSet\n , MemoryManager* const manager)\n{\n return (DatatypeValidator*) new (manager) AnyURIDatatypeValidator(this, facets, enums, finalSet, manager);\n}\n\n\/\/ ---------------------------------------------------------------------------\n\/\/ Utilities\n\/\/ ---------------------------------------------------------------------------\n\nvoid AnyURIDatatypeValidator::checkValueSpace(const XMLCh* const content\n , MemoryManager* const manager)\n{\n\n \/\/ check 3.2.17.c0 must: URI (rfc 2396\/2723)\n try\n {\n \/\/ Support for relative URLs\n \/\/ According to Java 1.1: URLs may also be specified with a\n \/\/ String and the URL object that it is related to.\n \/\/\n if (XMLString::stringLen(content))\n { \n if (!XMLUri::isValidURI(true, content))\n ThrowXMLwithMemMgr1(InvalidDatatypeValueException\n , XMLExcepts::VALUE_URI_Malformed\n , content\n , manager);\n }\n }\n catch(const OutOfMemoryException&)\n {\n throw;\n }\n catch (...)\n {\n ThrowXMLwithMemMgr1(InvalidDatatypeValueException\n , XMLExcepts::VALUE_URI_Malformed\n , content\n , manager);\n }\n\n}\n\n\/***\n * Support for Serialization\/De-serialization\n ***\/\n\nIMPL_XSERIALIZABLE_TOCREATE(AnyURIDatatypeValidator)\n\nvoid AnyURIDatatypeValidator::serialize(XSerializeEngine& serEng)\n{\n AbstractStringValidator::serialize(serEng);\n}\n\nXERCES_CPP_NAMESPACE_END\n\n\/**\n * End of file AnyURIDatatypeValidator.cpp\n *\/\n<|endoftext|>"} {"text":"<commit_before>#include \"skp_local_application.h\"\n#include \"skpLog.h\"\n#include \"gmock\/gmock.h\"\n\/\/#include <gperftools\/profiler.h>\n\/\/#include <gperftools\/heap-profiler.h>\n\nSkpLog *g_log = skp_null;\n\nint main(int argc, char *argv[])\n{\n \/\/ProfilerStart(NULL);\n \/\/HeapProfilerStart(NULL);\n\n g_log = new SkpLog(\"\", \"main_server_\", Skp::LOG_ERROR, \/*Skp::LOG_TO_FILE | *\/Skp::LOG_TO_STDERR,skp_true,0,1024 * 1024 *100, skp_true);\n\n\/\/ testing::InitGoogleMock(&argc, argv);\n\/\/ return RUN_ALL_TESTS();\n\n SkpLocalApplication app(argc, argv);\n int res = app.exec();\n\n \/\/ProfilerStop();\n \/\/HeapProfilerStop();\n return res;\n}\n<commit_msg>update<commit_after>#include \"skp_local_application.h\"\n#include \"skpLog.h\"\n#include \"gmock\/gmock.h\"\n\/\/#include <gperftools\/profiler.h>\n\/\/#include <gperftools\/heap-profiler.h>\n\nSkpLog *g_log = skp_null;\n\nint main(int argc, char *argv[])\n{\n \/\/ProfilerStart(NULL);\n \/\/HeapProfilerStart(NULL);\n\n g_log = new SkpLog(\"\", \"main_server_\", Skp::LOG_ERROR, \/*Skp::LOG_TO_FILE | *\/Skp::LOG_TO_STDERR,skp_true,0,1024 * 1024 *100, skp_true);\n\n\/\/ testing::InitGoogleMock(&argc, argv);\n\/\/ return RUN_ALL_TESTS();\n\n\n SkpLocalApplication app(argc, argv);\n int res = app.exec();\n\n \/\/ProfilerStop();\n \/\/HeapProfilerStop();\n return res;\n}\n<|endoftext|>"} {"text":"<commit_before>\/**\n * Copyright 2013 Truphone\n *\/\n#include \"SpyCommand.h\"\n\n#include <QString>\n#include <QList>\n#include <QObject>\n#include <QSignalSpy>\n\n#include \"Utils.h\"\n#include \"Connection.h\"\n\nnamespace truphone\n{\nnamespace test\n{\nnamespace cascades\n{\n \/*!\n * \\brief The Spy class is a wrapper for the Signal Spy\n *\n * @since test-cascades 1.0.0\n *\/\n class Spy : public QObject\n {\n public:\n \/*!\n * \\brief Spy Create a new spy\n *\n * \\param name The name of the spy\n * \\param object The object name to spy on\n * \\param signal The signal on @c object to spy on\n * \\param parent The parent object\n *\n * @since test-cascades 1.0.0\n *\/\n Spy(const QString &name,\n const QString &object,\n const QString &signal,\n QObject * parent = 0)\n : QObject(parent),\n mySpyName(name),\n myObject(object),\n mySignal(signal),\n spy(NULL),\n spyObject(NULL)\n {\n }\n\n \/*!\n * \\brief ~Spy Destructor\n *\n * @since test-cascades 1.0.0\n *\/\n virtual ~Spy()\n {\n this->kill();\n }\n\n \/*!\n * \\brief connect Create and connect the SignalSpy to the object\n *\n * \\return True if the connection worked\n *\n * @since test-cascades 1.0.0\n *\/\n bool connect()\n {\n bool ret = true;\n if (this->spy)\n {\n delete this->spy;\n }\n if (this->myObject.isNull() or this->myObject.isEmpty())\n {\n ret = false;\n }\n if (ret)\n {\n this->spyObject = Utils::findObject(this->myObject);\n }\n if (not this->spyObject)\n {\n ret = false;\n }\n if (this->mySignal.isNull() or this->mySignal.isEmpty())\n {\n ret = false;\n }\n if (ret)\n {\n const char * const signalName = this->mySignal.toUtf8().constData();\n this->spy = new QSignalSpy(this->spyObject, signalName);\n ret = this->spy->isValid();\n }\n return ret;\n }\n\n \/*!\n * \\brief count The number of signals that were fired once spying started\n *\n * \\param valid Pointer to a boolean valid that states if the return count\n * can be trusted. If the spy is broken or not connected then @c valid\n * will be set to false.\n *\n * \\return The number of times the assigned signal has fired\n *\n * @since test-cascades 1.0.0\n *\/\n int count(bool * valid = 0) const\n {\n int c = 0;\n\n if (this->spy and this->spy->isValid())\n {\n c = this->spy->count();\n if (valid)\n {\n *valid = true;\n }\n }\n\n return c;\n }\n\n \/*!\n * \\brief kill Kills the spy and removes it from the object\n *\n * @since test-cascades 1.0.0\n *\/\n void kill()\n {\n if (this->spy)\n {\n delete this->spy;\n }\n this->spy = NULL;\n }\n\n protected:\n private:\n \/*!\n * \\brief mySpyName The name of the spy\n *\/\n const QString mySpyName;\n \/*!\n * \\brief myObject The object to spy on\n *\/\n const QString myObject;\n \/*!\n * \\brief mySignal The signal to spy on\n *\/\n const QString mySignal;\n \/*!\n * \\brief spy Our spy\n *\/\n QSignalSpy * spy;\n \/*!\n * \\brief spyObject The object to spy on\n *\/\n QObject * spyObject;\n };\n\n \/*!\n * \\brief The SpyCommandPrivate class is used to maintain all the spies\n *\n * @since test-cascades 1.0.0\n *\/\n class SpyCommandPrivate : public QObject\n {\n public:\n \/*!\n * \\brief SpyCommandPrivate Constructor\n *\n * \\param parent The parent object\n *\n * @since test-cascades 1.0.0\n *\/\n explicit SpyCommandPrivate(QObject * parent = 0)\n : QObject(parent)\n {\n }\n \/*!\n * \\brief ~SpyCommandPrivate Destructor.\n *\n * @since test-cascades 1.0.0\n *\/\n virtual ~SpyCommandPrivate()\n {\n Q_FOREACH(Spy * spy, this->spies)\n {\n if (spy)\n {\n spy->kill();\n delete spy;\n }\n }\n this->spies.clear();\n }\n \/*!\n * \\brief addSpy Add a new spy\n *\n * \\param name The name of the spy\n * \\param object The object to spy on\n * \\param signal The signal to spy on\n * \\return @c true if the signal is created and connected ok\n *\n * @since test-cascades 1.0.0\n *\/\n bool addSpy(const QString &name,\n const QString &object,\n const QString &signal)\n {\n bool ret = false;\n Spy * const spy = new Spy(name, object, signal, this);\n if (spy)\n {\n ret = spy->connect();\n if (ret)\n {\n this->spies.insert(name, spy);\n }\n else\n {\n delete spy;\n }\n }\n\n return ret;\n }\n \/*!\n * \\brief getSpy Return a spy\n *\n * \\param name The name of the spy to get\n * \\return The spy instance\n *\n * @since test-cascades 1.0.0\n *\/\n Spy * getSpy(const QString &name)\n {\n return this->spies[name];\n }\n \/*!\n * \\brief removeSpy Remove, disconnet and delete as spy\n *\n * \\param name The name of the spy\n * \\return @c true if the spy was found and deleted\n *\n * @since test-cascades 1.0.0\n *\/\n bool removeSpy(const QString &name)\n {\n bool found = false;\n Spy * const spy = this->spies[name];\n if (spy)\n {\n spy->kill();\n delete spy;\n this->spies.remove(name);\n found = true;\n }\n return found;\n }\n\n protected:\n private:\n \/*!\n * \\brief spies All the spies.\n *\/\n QHash<QString, Spy*> spies;\n };\n\n const QString SpyCommand::CMD_NAME = \"spy\";\n SpyCommandPrivate * SpyCommand::spyPrivateSingleton;\n\n SpyCommand::SpyCommand(Connection * const socket,\n QObject* parent)\n : Command(parent),\n client(socket),\n spyPrivate(((spyPrivateSingleton == NULL)\n ? spyPrivateSingleton = new SpyCommandPrivate() : spyPrivateSingleton))\n {\n }\n\n SpyCommand::~SpyCommand()\n {\n }\n\n bool SpyCommand::executeCommand(QStringList * const arguments)\n {\n bool ret = false;\n\n if (arguments->size() >= 2)\n {\n const QString command = arguments->first();\n arguments->removeFirst();\n if (command == \"create\")\n {\n if (arguments->size() == 3)\n {\n const QString name = arguments->first();\n arguments->removeFirst();;\n const QString object = arguments->first();\n arguments->removeFirst();\n const QString signal = arguments->first();\n arguments->removeFirst();\n ret = this->spyPrivate->addSpy(name,\n object,\n \"2\" + signal);\n if (not ret)\n {\n this->client->write\n (tr(\"ERROR: Couldn't connect to the signal on that object\")\n + \"\\r\\n\");\n }\n }\n else\n {\n this->client->write(tr(\"ERROR: The create command needs a name,\" \\\n \"object and signal\") + \"\\r\\n\");\n }\n }\n else if (command == \"count\")\n {\n if (arguments->size() >=2 )\n {\n const QString name = arguments->first();\n arguments->removeFirst();;\n bool countOk = false;\n const int expectedCount = arguments->first().toInt(&countOk);\n if (not countOk)\n {\n this->client->write(tr(\"ERROR: The expected count number isn't a number\")\n + \"\\r\\n\");\n }\n else\n {\n const Spy * const spy = this->spyPrivate->getSpy(name);\n if (not spy)\n {\n this->client->write(tr(\"ERROR: Couldn't find a spy with that name\")\n + \"\\r\\n\");\n }\n else\n {\n bool valid = false;\n const int count = spy->count(&valid);\n if (not valid)\n {\n this->client->write(tr(\"ERROR: Couldn't get the signal \" \\\n \"count for the spy\") + \"\\r\\n\");\n }\n else\n {\n if (count == expectedCount)\n {\n ret = true;\n }\n else\n {\n this->client->write(tr(\"ERROR: The spy's signal \" \\\n \"count doesn't match the expected count\") + \"\\r\\n\");\n }\n }\n }\n }\n }\n else\n {\n this->client->write(tr(\"ERROR: Count needs at least two parameter\") + \"\\r\\n\");\n }\n }\n else if (command == \"kill\")\n {\n const QString name = arguments->first();\n if (this->spyPrivate->removeSpy(name))\n {\n ret = true;\n }\n else\n {\n this->client->write(tr(\"ERROR: Can't delete an unknown spy\") + \"\\r\\n\");\n }\n }\n else\n {\n this->client->write(tr(\"ERROR: Unknown spy command\") + \"\\r\\n\");\n }\n }\n else\n {\n this->client->write(tr(\"ERROR: Spy commands need at least two parameters\") + \"\\r\\n\");\n }\n\n return ret;\n }\n\n void SpyCommand::showHelp()\n {\n this->client->write(tr(\"> spy create <spyName> <object> <signal> - create a new Spy\")\n + \"\\r\\n\");\n this->client->write(tr(\"> spy count <spyName> <count> - check that the signal count for \" \\\n \"a spy is <count>\") + \"\\r\\n\");\n this->client->write(tr(\"> spy kill <spyName> - remove a spy\") + \"\\r\\n\");\n }\n} \/\/ namespace cascades\n} \/\/ namespace test\n} \/\/ namespace truphone\n<commit_msg>Spy command now accepts parameters.<commit_after>\/**\n * Copyright 2013 Truphone\n *\/\n#include \"SpyCommand.h\"\n\n#include <QString>\n#include <QList>\n#include <QObject>\n#include <QSignalSpy>\n\n#include \"Utils.h\"\n#include \"Connection.h\"\n\nnamespace truphone\n{\nnamespace test\n{\nnamespace cascades\n{\n \/*!\n * \\brief The Spy class is a wrapper for the Signal Spy\n *\n * @since test-cascades 1.0.0\n *\/\n class Spy : public QObject\n {\n public:\n \/*!\n * \\brief Spy Create a new spy\n *\n * \\param name The name of the spy\n * \\param object The object name to spy on\n * \\param signal The signal on @c object to spy on\n * \\param parent The parent object\n *\n * @since test-cascades 1.0.0\n *\/\n Spy(const QString &name,\n const QString &object,\n const QString &signal,\n QObject * parent = 0)\n : QObject(parent),\n mySpyName(name),\n myObject(object),\n mySignal(signal),\n spy(NULL),\n spyObject(NULL)\n {\n }\n\n \/*!\n * \\brief ~Spy Destructor\n *\n * @since test-cascades 1.0.0\n *\/\n virtual ~Spy()\n {\n this->kill();\n }\n\n \/*!\n * \\brief connect Create and connect the SignalSpy to the object\n *\n * \\return True if the connection worked\n *\n * @since test-cascades 1.0.0\n *\/\n bool connect()\n {\n bool ret = true;\n if (this->spy)\n {\n delete this->spy;\n }\n if (this->myObject.isNull() or this->myObject.isEmpty())\n {\n ret = false;\n }\n if (ret)\n {\n this->spyObject = Utils::findObject(this->myObject);\n }\n if (not this->spyObject)\n {\n ret = false;\n }\n if (this->mySignal.isNull() or this->mySignal.isEmpty())\n {\n ret = false;\n }\n if (ret)\n {\n const char * const signalName = this->mySignal.toUtf8().constData();\n this->spy = new QSignalSpy(this->spyObject, signalName);\n ret = this->spy->isValid();\n }\n return ret;\n }\n\n \/*!\n * \\brief count The number of signals that were fired once spying started\n *\n * \\param valid Pointer to a boolean valid that states if the return count\n * can be trusted. If the spy is broken or not connected then @c valid\n * will be set to false.\n *\n * \\return The number of times the assigned signal has fired\n *\n * @since test-cascades 1.0.0\n *\/\n int count(bool * valid = 0) const\n {\n int c = 0;\n\n if (this->spy and this->spy->isValid())\n {\n c = this->spy->count();\n if (valid)\n {\n *valid = true;\n }\n }\n\n return c;\n }\n\n \/*!\n * \\brief kill Kills the spy and removes it from the object\n *\n * @since test-cascades 1.0.0\n *\/\n void kill()\n {\n if (this->spy)\n {\n delete this->spy;\n }\n this->spy = NULL;\n }\n\n protected:\n private:\n \/*!\n * \\brief mySpyName The name of the spy\n *\/\n const QString mySpyName;\n \/*!\n * \\brief myObject The object to spy on\n *\/\n const QString myObject;\n \/*!\n * \\brief mySignal The signal to spy on\n *\/\n const QString mySignal;\n \/*!\n * \\brief spy Our spy\n *\/\n QSignalSpy * spy;\n \/*!\n * \\brief spyObject The object to spy on\n *\/\n QObject * spyObject;\n };\n\n \/*!\n * \\brief The SpyCommandPrivate class is used to maintain all the spies\n *\n * @since test-cascades 1.0.0\n *\/\n class SpyCommandPrivate : public QObject\n {\n public:\n \/*!\n * \\brief SpyCommandPrivate Constructor\n *\n * \\param parent The parent object\n *\n * @since test-cascades 1.0.0\n *\/\n explicit SpyCommandPrivate(QObject * parent = 0)\n : QObject(parent)\n {\n }\n \/*!\n * \\brief ~SpyCommandPrivate Destructor.\n *\n * @since test-cascades 1.0.0\n *\/\n virtual ~SpyCommandPrivate()\n {\n Q_FOREACH(Spy * spy, this->spies)\n {\n if (spy)\n {\n spy->kill();\n delete spy;\n }\n }\n this->spies.clear();\n }\n \/*!\n * \\brief addSpy Add a new spy\n *\n * \\param name The name of the spy\n * \\param object The object to spy on\n * \\param signal The signal to spy on\n * \\return @c true if the signal is created and connected ok\n *\n * @since test-cascades 1.0.0\n *\/\n bool addSpy(const QString &name,\n const QString &object,\n const QString &signal)\n {\n bool ret = false;\n Spy * const spy = new Spy(name, object, signal, this);\n if (spy)\n {\n ret = spy->connect();\n if (ret)\n {\n this->spies.insert(name, spy);\n }\n else\n {\n delete spy;\n }\n }\n\n return ret;\n }\n \/*!\n * \\brief getSpy Return a spy\n *\n * \\param name The name of the spy to get\n * \\return The spy instance\n *\n * @since test-cascades 1.0.0\n *\/\n Spy * getSpy(const QString &name)\n {\n return this->spies[name];\n }\n \/*!\n * \\brief removeSpy Remove, disconnet and delete as spy\n *\n * \\param name The name of the spy\n * \\return @c true if the spy was found and deleted\n *\n * @since test-cascades 1.0.0\n *\/\n bool removeSpy(const QString &name)\n {\n bool found = false;\n Spy * const spy = this->spies[name];\n if (spy)\n {\n spy->kill();\n delete spy;\n this->spies.remove(name);\n found = true;\n }\n return found;\n }\n\n protected:\n private:\n \/*!\n * \\brief spies All the spies.\n *\/\n QHash<QString, Spy*> spies;\n };\n\n const QString SpyCommand::CMD_NAME = \"spy\";\n SpyCommandPrivate * SpyCommand::spyPrivateSingleton;\n\n SpyCommand::SpyCommand(Connection * const socket,\n QObject* parent)\n : Command(parent),\n client(socket),\n spyPrivate(((spyPrivateSingleton == NULL)\n ? spyPrivateSingleton = new SpyCommandPrivate() : spyPrivateSingleton))\n {\n }\n\n SpyCommand::~SpyCommand()\n {\n }\n\n bool SpyCommand::executeCommand(QStringList * const arguments)\n {\n bool ret = false;\n\n if (arguments->size() >= 2)\n {\n const QString command = arguments->first();\n arguments->removeFirst();\n if (command == \"create\")\n {\n if (arguments->size() >= 3)\n {\n const QString name = arguments->first();\n arguments->removeFirst();;\n const QString object = arguments->first();\n arguments->removeFirst();\n const QString signal = arguments->join(\"\");\n arguments->removeFirst();\n ret = this->spyPrivate->addSpy(name,\n object,\n \"2\" + signal);\n if (not ret)\n {\n this->client->write\n (tr(\"ERROR: Couldn't connect to the signal on that object\")\n + \"\\r\\n\");\n }\n }\n else\n {\n this->client->write(tr(\"ERROR: The create command needs a name,\" \\\n \"object and signal\") + \"\\r\\n\");\n }\n }\n else if (command == \"count\")\n {\n if (arguments->size() >=2 )\n {\n const QString name = arguments->first();\n arguments->removeFirst();;\n bool countOk = false;\n const int expectedCount = arguments->first().toInt(&countOk);\n if (not countOk)\n {\n this->client->write(tr(\"ERROR: The expected count number isn't a number\")\n + \"\\r\\n\");\n }\n else\n {\n const Spy * const spy = this->spyPrivate->getSpy(name);\n if (not spy)\n {\n this->client->write(tr(\"ERROR: Couldn't find a spy with that name\")\n + \"\\r\\n\");\n }\n else\n {\n bool valid = false;\n const int count = spy->count(&valid);\n if (not valid)\n {\n this->client->write(tr(\"ERROR: Couldn't get the signal \" \\\n \"count for the spy\") + \"\\r\\n\");\n }\n else\n {\n if (count == expectedCount)\n {\n ret = true;\n }\n else\n {\n this->client->write(tr(\"ERROR: The spy's signal \" \\\n \"count doesn't match the expected count\") + \"\\r\\n\");\n }\n }\n }\n }\n }\n else\n {\n this->client->write(tr(\"ERROR: Count needs at least two parameter\") + \"\\r\\n\");\n }\n }\n else if (command == \"kill\")\n {\n const QString name = arguments->first();\n if (this->spyPrivate->removeSpy(name))\n {\n ret = true;\n }\n else\n {\n this->client->write(tr(\"ERROR: Can't delete an unknown spy\") + \"\\r\\n\");\n }\n }\n else\n {\n this->client->write(tr(\"ERROR: Unknown spy command\") + \"\\r\\n\");\n }\n }\n else\n {\n this->client->write(tr(\"ERROR: Spy commands need at least two parameters\") + \"\\r\\n\");\n }\n\n return ret;\n }\n\n void SpyCommand::showHelp()\n {\n this->client->write(tr(\"> spy create <spyName> <object> <signal> - create a new Spy\")\n + \"\\r\\n\");\n this->client->write(tr(\"> spy count <spyName> <count> - check that the signal count for \" \\\n \"a spy is <count>\") + \"\\r\\n\");\n this->client->write(tr(\"> spy kill <spyName> - remove a spy\") + \"\\r\\n\");\n }\n} \/\/ namespace cascades\n} \/\/ namespace test\n} \/\/ namespace truphone\n<|endoftext|>"} {"text":"<commit_before>#include <stan\/math\/prim.hpp>\n#include <gtest\/gtest.h>\n#include <vector>\n\nTEST(MathFunctionsPoissonBinomialLogProbs, check_scalar_y) {\n using stan::math::poisson_binomial_log_probs;\n using vec = Eigen::Matrix<double, Eigen::Dynamic, 1>;\n\n vec p(3, 1);\n p << 0.5, 0.2, 0.7;\n std::vector<double> vals{-2.12026, -0.84397, -0.967584, -2.65926};\n\n for (int i = 0; i < 4; i++) {\n auto x = poisson_binomial_log_probs(i, p);\n EXPECT_EQ(x.rows(), i + 1);\n EXPECT_EQ(x.cols(), 1);\n for (int j = 0; j <= i; ++j) {\n EXPECT_NEAR(vals[j], x(j), 0.001);\n }\n }\n}\n\nTEST(MathFunctionsPoissonBinomialLogProbs, check_vectorial_y) {\n using stan::math::poisson_binomial_log_probs;\n using vec = Eigen::Matrix<double, Eigen::Dynamic, 1>;\n\n vec p(3, 1);\n p << 0.5, 0.2, 0.7;\n std::vector<int> y{0, 1};\n auto x = poisson_binomial_log_probs(y, p);\n\n EXPECT_EQ(x.size(), 2);\n EXPECT_EQ(x[0].rows(), 1);\n EXPECT_EQ(x[0].cols(), 1);\n EXPECT_EQ(x[1].rows(), 2);\n EXPECT_EQ(x[1].cols(), 1);\n}\n\nTEST(MathFunctionsPoissonBinomialLogProbs, check_vectorial_y_vectorial_theta) {\n using stan::math::poisson_binomial_log_probs;\n using vec = Eigen::Matrix<double, Eigen::Dynamic, 1>;\n\n vec p(3, 1);\n p << 0.5, 0.2, 0.7;\n std::vector<int> y{0, 1};\n std::vector<vec> ps{p, p};\n auto x = poisson_binomial_log_probs(y, ps);\n\n EXPECT_EQ(x.size(), 2);\n EXPECT_EQ(x[0].rows(), 1);\n EXPECT_EQ(x[0].cols(), 1);\n EXPECT_EQ(x[1].rows(), 2);\n EXPECT_EQ(x[1].cols(), 1);\n}<commit_msg>Cpplint again<commit_after>#include <stan\/math\/prim.hpp>\n#include <gtest\/gtest.h>\n#include <vector>\n\nTEST(MathFunctionsPoissonBinomialLogProbs, check_scalar_y) {\n using stan::math::poisson_binomial_log_probs;\n using vec = Eigen::Matrix<double, Eigen::Dynamic, 1>;\n\n vec p(3, 1);\n p << 0.5, 0.2, 0.7;\n std::vector<double> vals{-2.12026, -0.84397, -0.967584, -2.65926};\n\n for (int i = 0; i < 4; i++) {\n auto x = poisson_binomial_log_probs(i, p);\n EXPECT_EQ(x.rows(), i + 1);\n EXPECT_EQ(x.cols(), 1);\n for (int j = 0; j <= i; ++j) {\n EXPECT_NEAR(vals[j], x(j), 0.001);\n }\n }\n}\n\nTEST(MathFunctionsPoissonBinomialLogProbs, check_vectorial_y) {\n using stan::math::poisson_binomial_log_probs;\n using vec = Eigen::Matrix<double, Eigen::Dynamic, 1>;\n\n vec p(3, 1);\n p << 0.5, 0.2, 0.7;\n std::vector<int> y{0, 1};\n auto x = poisson_binomial_log_probs(y, p);\n\n EXPECT_EQ(x.size(), 2);\n EXPECT_EQ(x[0].rows(), 1);\n EXPECT_EQ(x[0].cols(), 1);\n EXPECT_EQ(x[1].rows(), 2);\n EXPECT_EQ(x[1].cols(), 1);\n}\n\nTEST(MathFunctionsPoissonBinomialLogProbs, check_vectorial_y_vectorial_theta) {\n using stan::math::poisson_binomial_log_probs;\n using vec = Eigen::Matrix<double, Eigen::Dynamic, 1>;\n\n vec p(3, 1);\n p << 0.5, 0.2, 0.7;\n std::vector<int> y{0, 1};\n std::vector<vec> ps{p, p};\n auto x = poisson_binomial_log_probs(y, ps);\n\n EXPECT_EQ(x.size(), 2);\n EXPECT_EQ(x[0].rows(), 1);\n EXPECT_EQ(x[0].cols(), 1);\n EXPECT_EQ(x[1].rows(), 2);\n EXPECT_EQ(x[1].cols(), 1);\n}\n<|endoftext|>"} {"text":"<commit_before>\/*\n* Copyright (c) 2020 - 2021 Advanced Micro Devices, Inc. All rights reserved.\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* The above copyright notice and this permission notice shall be included in\n* all copies or substantial portions of the Software.\n* THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANNTY OF ANY KIND, EXPRESS OR\n* IMPLIED, INNCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\n* FITNNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE\n* AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANNY CLAIM, DAMAGES OR OTHER\n* LIABILITY, WHETHER INN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,\n* OUT OF OR INN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN\n* THE SOFTWARE.\n*\/\n\n\/\/ Testcase Description: This test case checks whether hipStreamSynchronize() is taking\n\/\/ lesser time after the Callback() function launched by hipStreamAddCallback() api.\n\n\/* HIT_START\n * BUILD: %t %s ..\/..\/test_common.cpp NVCC_OPTIONS --std=c++11\n * TEST: %t\n * HIT_END\n *\/\n\n#include <stdio.h>\n#include <chrono>\n#include <atomic>\n#include \"hip\/hip_runtime.h\"\n#include \"test_common.h\"\n\n#ifdef __HIP_PLATFORM_AMD__\n#define HIPRT_CB\n#endif\n\n#define SECONDS_TO_WAIT 2\n#define TO_MICROSECONDS 1000000\n\nhipStream_t mystream;\nsize_t N_elmts = 4096;\nbool cbDone = false;\nstd::atomic<int> Data_mismatch{0};\n\n__global__ void vector_square(float* C_d, float* A_d, size_t N_elmts) {\n size_t offset = (blockIdx.x * blockDim.x + threadIdx.x);\n size_t stride = blockDim.x * gridDim.x;\n\n for (size_t i = offset; i < N_elmts; i += stride) {\n C_d[i] = A_d[i] * A_d[i];\n }\n\n \/\/ Delay the thread 1\n if (offset == 1) {\n unsigned long long int wait_t = 3200000000, start = clock64(), cur;\n do {\n cur = clock64() - start;\n } while (cur < wait_t);\n }\n}\n\nfloat *A_h, *C_h;\n\nstatic void HIPRT_CB Callback1(hipStream_t stream, hipError_t status,\n void* userData) {\n \/\/ Validate the data\n for (size_t i = 0; i < N_elmts; i++) {\n if (C_h[i] != A_h[i] * A_h[i]) {\n Data_mismatch++;\n }\n }\n\n \/\/ Delay the callback completion\n std::this_thread::sleep_for (std::chrono::seconds(SECONDS_TO_WAIT));\n cbDone = true;\n}\n\nint main(int argc, char* argv[]) {\n float *A_d, *C_d;\n size_t Nbytes = N_elmts * sizeof(float);\n float tElapsed = 1.0f;\n\n A_h = (float*)malloc(Nbytes);\n HIPCHECK(A_h == 0 ? hipErrorOutOfMemory : hipSuccess);\n C_h = (float*)malloc(Nbytes);\n HIPCHECK(C_h == 0 ? hipErrorOutOfMemory : hipSuccess);\n\n \/\/ Fill with Phi + i\n for (size_t i = 0; i < N_elmts; i++) {\n A_h[i] = 1.618f + i;\n }\n\n HIPCHECK(hipMalloc(&A_d, Nbytes));\n HIPCHECK(hipMalloc(&C_d, Nbytes));\n\n HIPCHECK(hipStreamCreateWithFlags(&mystream, hipStreamNonBlocking));\n\n HIPCHECK(hipMemcpyAsync(A_d, A_h, Nbytes, hipMemcpyHostToDevice, mystream));\n\n const unsigned threadsPerBlock = 256;\n const unsigned blocks = (N_elmts + 255)\/threadsPerBlock;\n\n hipLaunchKernelGGL((vector_square), dim3(blocks), dim3(threadsPerBlock), 0,\n mystream, C_d, A_d, N_elmts);\n HIPCHECK(hipMemcpyAsync(C_h, C_d, Nbytes, hipMemcpyDeviceToHost, mystream));\n HIPCHECK(hipStreamAddCallback(mystream, Callback1, NULL, 0));\n\n \/\/ Wait untill Callback() function changes the cbDone value to true\n while (!cbDone) {\n std::this_thread::sleep_for (std::chrono::milliseconds(10));\n }\n\n \/\/ Since the callback is supposed to be called only after an implicit stream\n \/\/ synchronization, and the runtime cannot continue until the callback is done\n \/\/ hipStreamSynchronize call should not take much time.\n auto start = std::chrono::high_resolution_clock::now();\n HIPCHECK(hipStreamSynchronize(mystream));\n auto stop = std::chrono::high_resolution_clock::now();\n auto duration = std::chrono::duration_cast<std::chrono::microseconds>(stop - start);\n\n HIPCHECK(hipStreamDestroy(mystream));\n HIPCHECK(hipFree(A_d));\n HIPCHECK(hipFree(C_d));\n free(A_h);\n free(C_h);\n\n if (Data_mismatch.load() != 0) {\n failed(\"Output from kernel execution is not as expected\");\n }\n\n \/\/ HIP runtime cannot proceed further in the queue until callback completes\n \/\/ Stream synchronize should not have much task to do after callback\n \/\/ It should just be an extra empty marker wait\n \/\/ Therefore the hipStreamSynchronize() in the\n \/\/ main thread should hardly take any time to complete.\n\n if (duration.count() < 100) {\n passed();\n } else {\n failed(\"hipStreamSynchronize is taking more time than expected after Callback()\");\n }\n}\n<commit_msg>SWDEV-346657 - increase time for random failure (#3025)<commit_after>\/*\n* Copyright (c) 2020 - 2021 Advanced Micro Devices, Inc. All rights reserved.\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* The above copyright notice and this permission notice shall be included in\n* all copies or substantial portions of the Software.\n* THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANNTY OF ANY KIND, EXPRESS OR\n* IMPLIED, INNCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\n* FITNNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE\n* AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANNY CLAIM, DAMAGES OR OTHER\n* LIABILITY, WHETHER INN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,\n* OUT OF OR INN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN\n* THE SOFTWARE.\n*\/\n\n\/\/ Testcase Description: This test case checks whether hipStreamSynchronize() is taking\n\/\/ lesser time after the Callback() function launched by hipStreamAddCallback() api.\n\n\/* HIT_START\n * BUILD: %t %s ..\/..\/test_common.cpp NVCC_OPTIONS --std=c++11\n * TEST: %t\n * HIT_END\n *\/\n\n#include <stdio.h>\n#include <chrono>\n#include <atomic>\n#include \"hip\/hip_runtime.h\"\n#include \"test_common.h\"\n\n#ifdef __HIP_PLATFORM_AMD__\n#define HIPRT_CB\n#endif\n\n#define SECONDS_TO_WAIT 2\n#define TO_MICROSECONDS 1000000\n\nhipStream_t mystream;\nsize_t N_elmts = 4096;\nbool cbDone = false;\nstd::atomic<int> Data_mismatch{0};\n\n__global__ void vector_square(float* C_d, float* A_d, size_t N_elmts) {\n size_t offset = (blockIdx.x * blockDim.x + threadIdx.x);\n size_t stride = blockDim.x * gridDim.x;\n\n for (size_t i = offset; i < N_elmts; i += stride) {\n C_d[i] = A_d[i] * A_d[i];\n }\n\n \/\/ Delay the thread 1\n if (offset == 1) {\n unsigned long long int wait_t = 3200000000, start = clock64(), cur;\n do {\n cur = clock64() - start;\n } while (cur < wait_t);\n }\n}\n\nfloat *A_h, *C_h;\n\nstatic void HIPRT_CB Callback1(hipStream_t stream, hipError_t status,\n void* userData) {\n \/\/ Validate the data\n for (size_t i = 0; i < N_elmts; i++) {\n if (C_h[i] != A_h[i] * A_h[i]) {\n Data_mismatch++;\n }\n }\n\n \/\/ Delay the callback completion\n std::this_thread::sleep_for (std::chrono::seconds(SECONDS_TO_WAIT));\n cbDone = true;\n}\n\nint main(int argc, char* argv[]) {\n float *A_d, *C_d;\n size_t Nbytes = N_elmts * sizeof(float);\n float tElapsed = 1.0f;\n\n A_h = (float*)malloc(Nbytes);\n HIPCHECK(A_h == 0 ? hipErrorOutOfMemory : hipSuccess);\n C_h = (float*)malloc(Nbytes);\n HIPCHECK(C_h == 0 ? hipErrorOutOfMemory : hipSuccess);\n\n \/\/ Fill with Phi + i\n for (size_t i = 0; i < N_elmts; i++) {\n A_h[i] = 1.618f + i;\n }\n\n HIPCHECK(hipMalloc(&A_d, Nbytes));\n HIPCHECK(hipMalloc(&C_d, Nbytes));\n\n HIPCHECK(hipStreamCreateWithFlags(&mystream, hipStreamNonBlocking));\n\n HIPCHECK(hipMemcpyAsync(A_d, A_h, Nbytes, hipMemcpyHostToDevice, mystream));\n\n const unsigned threadsPerBlock = 256;\n const unsigned blocks = (N_elmts + 255)\/threadsPerBlock;\n\n hipLaunchKernelGGL((vector_square), dim3(blocks), dim3(threadsPerBlock), 0,\n mystream, C_d, A_d, N_elmts);\n HIPCHECK(hipMemcpyAsync(C_h, C_d, Nbytes, hipMemcpyDeviceToHost, mystream));\n HIPCHECK(hipStreamAddCallback(mystream, Callback1, NULL, 0));\n\n \/\/ Wait untill Callback() function changes the cbDone value to true\n while (!cbDone) {\n std::this_thread::sleep_for (std::chrono::milliseconds(10));\n }\n\n \/\/ Since the callback is supposed to be called only after an implicit stream\n \/\/ synchronization, and the runtime cannot continue until the callback is done\n \/\/ hipStreamSynchronize call should not take much time.\n auto start = std::chrono::high_resolution_clock::now();\n HIPCHECK(hipStreamSynchronize(mystream));\n auto stop = std::chrono::high_resolution_clock::now();\n auto duration = std::chrono::duration_cast<std::chrono::microseconds>(stop - start);\n\n HIPCHECK(hipStreamDestroy(mystream));\n HIPCHECK(hipFree(A_d));\n HIPCHECK(hipFree(C_d));\n free(A_h);\n free(C_h);\n\n if (Data_mismatch.load() != 0) {\n failed(\"Output from kernel execution is not as expected\");\n }\n\n \/\/ HIP runtime cannot proceed further in the queue until callback completes\n \/\/ Stream synchronize should not have much task to do after callback\n \/\/ It should just be an extra empty marker wait\n \/\/ Therefore the hipStreamSynchronize() in the\n \/\/ main thread should hardly take any time to complete.\n\n if (duration.count() < 200) {\n passed();\n } else {\n failed(\"hipStreamSynchronize is taking more time than expected after Callback()\");\n }\n}\n<|endoftext|>"} {"text":"<commit_before>\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\n\/\/ File: ProcessVorticity.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: Computes Q Criterion field.\n\/\/\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n#include <string>\n#include <iostream>\nusing namespace std;\n\n#include \"ProcessQCriterion.h\"\n\n#include <LibUtilities\/BasicUtils\/SharedArray.hpp>\n#include <LibUtilities\/BasicUtils\/ParseUtils.hpp>\n\nnamespace Nektar\n{\n namespace Utilities\n {\n ModuleKey ProcessQCriterion::className =\n GetModuleFactory().RegisterCreatorFunction(\n ModuleKey(eProcessModule, \"QCriterion\"),\n ProcessQCriterion::create, \"Computes Q Criterion (but now it's actually just a test).\");\n\n ProcessQCriterion::ProcessQCriterion(FieldSharedPtr f) : ProcessModule(f)\n {\n }\n\n ProcessQCriterion::~ProcessQCriterion()\n {\n }\n\n void ProcessQCriterion::Process(po::variables_map &vm)\n {\n if (m_f->m_verbose)\n {\n cout << \"ProcessQCriterion: Calculating Q Criterion...\" << endl;\n }\n \n int i, j;\n int expdim = m_f->m_graph->GetMeshDimension();\n int spacedim = expdim;\n if ((m_f->m_fielddef[0]->m_numHomogeneousDir) == 1 ||\n (m_f->m_fielddef[0]->m_numHomogeneousDir) == 2)\n {\n spacedim = 3;\n }\n int nfields = m_f->m_fielddef[0]->m_fields.size();\n if (spacedim == 1)\n {\n ASSERTL0(false, \"Error: ProcessQCriterion for a 1D problem cannot \"\n \"be computed\")\n }\n int addfields = (spacedim == 2)? 1:3;\n \n int npoints = m_f->m_exp[0]->GetNpoints();\n Array<OneD, Array<OneD, NekDouble> > grad(nfields*nfields);\n Array<OneD, Array<OneD, NekDouble> > outfield(addfields);\n m_f->m_exp.resize(nfields+addfields);\n\n \n for (i = 0; i < nfields*nfields; ++i)\n {\n grad[i] = Array<OneD, NekDouble>(npoints);\n }\n \n for (i = 0; i < addfields; ++i)\n {\n outfield[i] = Array<OneD, NekDouble>(npoints);\n }\n \n \/\/ Calculate Gradient & Vorticity\n if (spacedim == 2)\n {\n for (i = 0; i < nfields; ++i)\n {\n m_f->m_exp[i]->PhysDeriv(m_f->m_exp[i]->GetPhys(), \n grad[i*nfields], \n grad[i*nfields+1]);\n }\n \/\/ W_z = Vx - Uy\n Vmath::Vsub(npoints, grad[1*nfields+0], 1, \n grad[0*nfields+1], 1, \n outfield[0], 1);\n }\n else\n {\n for (i = 0; i < nfields; ++i)\n {\n\n m_f->m_exp[i]->PhysDeriv(m_f->m_exp[i]->GetPhys(), \n grad[i*nfields], \n grad[i*nfields+1],\n grad[i*nfields+2]);\n }\n \n \/\/ W_x = Wy - Vz\n Vmath::Vsub(npoints, grad[2*nfields+1], 1, grad[1*nfields+2], 1, \n outfield[0],1);\n \/\/ W_y = Uz - Wx\n Vmath::Vsub(npoints, grad[0*nfields+2], 1, grad[2*nfields+0], 1, \n outfield[1], 1);\n \/\/ W_z = Vx - Uy\n Vmath::Vsub(npoints, grad[1*nfields+0], 1, grad[0*nfields+1], 1, \n outfield[2], 1);\n }\n\n for (i = 0; i < addfields; ++i)\n {\n m_f->m_exp[nfields + i] = m_f->AppendExpList();\n m_f->m_exp[nfields + i]->UpdatePhys() = outfield[i];\n m_f->m_exp[nfields + i]->FwdTrans(outfield[i],\n m_f->m_exp[nfields + i]->UpdateCoeffs());\n }\n \n vector<string > outname;\n if (addfields == 1)\n {\n outname.push_back(\"W_z\");\n }\n else\n {\n outname.push_back(\"Q_x\");\n outname.push_back(\"Q_y\");\n outname.push_back(\"Q_z\");\n }\n \n std::vector<LibUtilities::FieldDefinitionsSharedPtr> FieldDef\n = m_f->m_exp[0]->GetFieldDefinitions();\n std::vector<std::vector<NekDouble> > FieldData(FieldDef.size());\n \n for (j = 0; j < nfields + addfields; ++j)\n {\n for (i = 0; i < FieldDef.size(); ++i)\n { \n if (j >= nfields)\n {\n FieldDef[i]->m_fields.push_back(outname[j-nfields]);\n }\n else\n {\n FieldDef[i]->m_fields.push_back(m_f->m_fielddef[0]->m_fields[j]);\n }\n m_f->m_exp[j]->AppendFieldData(FieldDef[i], FieldData[i]);\n }\n }\n \n m_f->m_fielddef = FieldDef;\n m_f->m_data = FieldData;\n\n\n }\n }\n}\n<commit_msg>Q-Criterion implemented<commit_after>\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\n\/\/ File: ProcessVorticity.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: Computes Q Criterion field.\n\/\/\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n#include <string>\n#include <iostream>\nusing namespace std;\n\n#include \"ProcessQCriterion.h\"\n\n#include <LibUtilities\/BasicUtils\/SharedArray.hpp>\n#include <LibUtilities\/BasicUtils\/ParseUtils.hpp>\n\nnamespace Nektar\n{\n namespace Utilities\n {\n ModuleKey ProcessQCriterion::className =\n\t\tGetModuleFactory().RegisterCreatorFunction(\n\t\t\t\t\t\t\t\t\t\t\t\t ModuleKey(eProcessModule, \"QCriterion\"),\n\t\t\t\t\t\t\t\t\t\t\t\t ProcessQCriterion::create, \"Computes Q Criterion (but now it's actually just a test).\");\n\t\t\n ProcessQCriterion::ProcessQCriterion(FieldSharedPtr f) : ProcessModule(f)\n {\n }\n\t\t\n ProcessQCriterion::~ProcessQCriterion()\n {\n }\n\t\t\n void ProcessQCriterion::Process(po::variables_map &vm)\n {\n if (m_f->m_verbose)\n {\n cout << \"ProcessQCriterion: Calculating Q Criterion...\" << endl;\n }\n \n int i, j;\n int expdim = m_f->m_graph->GetMeshDimension();\n int spacedim = expdim;\n if ((m_f->m_fielddef[0]->m_numHomogeneousDir) == 1 ||\n (m_f->m_fielddef[0]->m_numHomogeneousDir) == 2)\n {\n spacedim = 3;\n }\n int nfields = m_f->m_fielddef[0]->m_fields.size();\n if (spacedim == 1 || spacedim == 2)\n {\n ASSERTL0(false, \"Error: ProcessQCriterion must be computed for a 3D (or quasi-3D) case.\")\n }\n \/\/int addfields = (spacedim == 2)? 1:3;\n\t\t\tint addfields = 1; \/\/For calculating Q-Criterion only 1 field must be added\n \n int npoints = m_f->m_exp[0]->GetNpoints();\n\t\t\t\n \/\/Array<OneD, Array<OneD, NekDouble> > grad(nfields*nfields);\n \/\/Array<OneD, Array<OneD, NekDouble> > outfield(addfields);\n\t\t\t\n\t\t\tArray<OneD, Array<OneD, NekDouble> > grad(nfields * nfields);\n\t\t\t\n\t\t\tArray<OneD, Array<OneD, NekDouble> > omega(nfields * nfields);\n\t\t\tArray<OneD, Array<OneD, NekDouble> > S (nfields * nfields);\n\t\t\t\n\t\t\tArray<OneD, Array<OneD, NekDouble> > outfield (addfields);\n\t\t\tArray<OneD, Array<OneD, NekDouble> > outfield1(addfields);\n\t\t\tArray<OneD, Array<OneD, NekDouble> > outfield2(addfields);\n\t\t\tArray<OneD, Array<OneD, NekDouble> > outfield3(addfields);\n\t\t\t\n\t\t\t\n m_f->m_exp.resize(nfields+addfields);\n\t\t\t\n \n for (i = 0; i < nfields*nfields; ++i)\n {\n grad[i] = Array<OneD, NekDouble>(npoints);\n }\n \n for (i = 0; i < addfields; ++i)\n {\n outfield[i] = Array<OneD, NekDouble>(npoints); \/\/Will store the Q-Criterion\n\t\t\t\toutfield1[i] = Array<OneD, NekDouble>(npoints);\n\t\t\t\toutfield2[i] = Array<OneD, NekDouble>(npoints);\n\t\t\t\toutfield3[i] = Array<OneD, NekDouble>(npoints);\n\t\t\t\t\n\t\t\t\tomega[i] = Array<OneD, NekDouble>(npoints);\n\t\t\t\tS[i] = Array<OneD, NekDouble>(npoints);\n }\n \n \/\/ Calculate Gradient & Vorticity\n\t\t\t\/\/ if (spacedim == 2)\n\t\t\t\/\/ {\n\t\t\t\/\/ cerr << \"Q-Criterion calculation needs a 3D mesh.\" << endl;\n\t\t\t\/\/ }\n\t\t\tfor (i = 0; i < nfields; ++i)\n\t\t\t{\n\t\t\t\t\n\t\t\t\tm_f->m_exp[i]->PhysDeriv(m_f->m_exp[i]->GetPhys(),\n\t\t\t\t\t\t\t\t\t\t grad[i*nfields],\n\t\t\t\t\t\t\t\t\t\t grad[i*nfields+1],\n\t\t\t\t\t\t\t\t\t\t grad[i*nfields+2]);\n\t\t\t}\n\t\t\t\n\t\t\t\/\/ W_x = Wy - Vz\n\t\t\t\/\/Vmath::Vsub(npoints, grad[2*nfields+1], 1, grad[1*nfields+2], 1,\n\t\t\t\/\/ outfield[0],1);\n\t\t\t\/\/ W_y = Uz - Wx\n\t\t\t\/\/Vmath::Vsub(npoints, grad[0*nfields+2], 1, grad[2*nfields+0], 1,\n\t\t\t\/\/ outfield[1], 1);\n\t\t\t\/\/ W_z = Vx - Uy\n\t\t\t\/\/Vmath::Vsub(npoints, grad[1*nfields+0], 1, grad[0*nfields+1], 1,\n\t\t\t\/\/ outfield[2], 1);\n\t\t\t\n\t\t\t\/\/=================================================================\n\t\t\t\/\/=================================================================\n\t\t\t\/\/=================================================================\n\t\t\t\n\t\t\t\/\/ W_x = Wy - Vz\n\t\t\tVmath::Vsub(npoints, grad[2 * nfields + 1], 1, grad[1 * nfields + 2], 1,\n\t\t\t\t\t\toutfield1[0], 1);\n\t\t\t\/\/ W_x^2\n\t\t\tVmath::Vmul(npoints, outfield1[0], 1, outfield1[0], 1, outfield1[0], 1);\n\t\t\t\n\t\t\t\/\/ W_y = Uz - Wx\n\t\t\tVmath::Vsub(npoints, grad[0 * nfields + 2], 1, grad[2 * nfields + 0], 1,\n\t\t\t\t\t\toutfield2[0], 1);\n\t\t\t\/\/ W_y^2\n\t\t\tVmath::Vmul(npoints, outfield2[0], 1, outfield2[0], 1, outfield2[0], 1);\n\t\t\t\n\t\t\t\/\/ W_z = Vx - Uy\n\t\t\tVmath::Vsub(npoints, grad[1 * nfields + 0], 1, grad[0 * nfields + 1], 1,\n\t\t\t\t\t\toutfield3[0], 1);\n\t\t\t\/\/ W_z^2\n\t\t\tVmath::Vmul(npoints, outfield3[0], 1, outfield3[0], 1, outfield3[0], 1);\n\t\t\t\n\t\t\t\/\/ add fields omega = 0.5*(W_x^2 + W_y^2 + W_z^2)\n\t\t\t\n\t\t\tNekDouble fac = 0.5;\n\t\t\tVmath::Vadd(npoints, &outfield1[0][0], 1, &outfield2[0][0], 1, &omega[0][0], 1);\n\t\t\tVmath::Vadd(npoints, &omega[0][0], 1, &outfield3[0][0], 1, &omega[0][0], 1);\n\t\t\t\n\t\t\tfor (int k = 0; k < addfields; ++k)\n\t\t\t{\n\t\t\t\tVmath::Smul(npoints, fac, &omega[k][0], 1, &omega[k][0], 1);\n\t\t\t}\n\t\t\t\n\t\t\tVmath::Zero(npoints, &outfield1[0][0], 1);\n\t\t\tVmath::Zero(npoints, &outfield2[0][0], 1);\n\t\t\tVmath::Zero(npoints, &outfield3[0][0], 1);\n\t\t\t\n\t\t\tVmath::Vmul(npoints, grad[0 * nfields + 0], 1, grad[0 * nfields + 0], 1,\n\t\t\t\t\t\toutfield1[0], 1);\n\t\t\tVmath::Vmul(npoints, grad[1 * nfields + 1], 1, grad[1 * nfields + 1], 1,\n\t\t\t\t\t\toutfield2[0], 1);\n\t\t\tVmath::Vmul(npoints, grad[2 * nfields + 2], 1, grad[2 * nfields + 2], 1,\n\t\t\t\t\t\toutfield3[0], 1);\n\t\t\t\n\t\t\tVmath::Vadd(npoints, &outfield1[0][0], 1, &outfield2[0][0], 1, &S[0][0], 1);\n\t\t\tVmath::Vadd(npoints, &S[0][0], 1, &outfield3[0][0], 1, &S[0][0], 1);\n\t\t\t\n\t\t\t\/\/ W_y + V_z\n\t\t\tVmath::Vadd(npoints, grad[2 * nfields + 1], 1, grad[1 * nfields + 2], 1,\n\t\t\t\t\t\toutfield1[0], 1);\n\t\t\tVmath::Vmul(npoints, &outfield1[0][0], 1, &outfield1[0][0], 1,\n\t\t\t\t\t\t&outfield1[0][0], 1);\n\t\t\t\n\t\t\t\/\/ U_z + W_x\n\t\t\tVmath::Vadd(npoints, grad[0 * nfields + 2], 1, grad[2 * nfields + 0], 1,\n\t\t\t\t\t\toutfield2[0], 1);\n\t\t\tVmath::Vmul(npoints, &outfield2[0][0], 1, &outfield2[0][0], 1,\n\t\t\t\t\t\t&outfield2[0][0], 1);\n\t\t\t\n\t\t\t\/\/ V_x + U_y\n\t\t\tVmath::Vadd(npoints, grad[1 * nfields + 0], 1, grad[0 * nfields + 1], 1,\n\t\t\t\t\t\toutfield3[0], 1);\n\t\t\tVmath::Vmul(npoints, &outfield3[0][0], 1, &outfield3[0][0], 1,\n\t\t\t\t\t\t&outfield3[0][0], 1);\n\t\t\t\n\t\t\tVmath::Vadd(npoints, &outfield1[0][0], 1, &outfield2[0][0], 1,\n\t\t\t\t\t\t&outfield2[0][0], 1);\n\t\t\tVmath::Vadd(npoints, &outfield2[0][0], 1, &outfield3[0][0], 1,\n\t\t\t\t\t\t&outfield3[0][0], 1);\n\t\t\t\n\t\t\tfor (int k = 0; k < addfields; ++k)\n\t\t\t{\n\t\t\t\tVmath::Smul(npoints, fac, &outfield3[k][0], 1, &outfield3[k][0], 1);\n\t\t\t}\n\t\t\t\n\t\t\tVmath::Vadd(npoints, &outfield3[0][0], 1, &S[0][0], 1, &S[0][0], 1);\n\t\t\tVmath::Vsub(npoints, omega[0], 1, S[0], 1, outfield[0], 1);\n\t\t\t\n\t\t\tfor (int k = 0; k < addfields; ++k)\n\t\t\t{\n\t\t\t\tVmath::Smul(npoints, fac, &outfield[k][0], 1, &outfield[k][0], 1);\n\t\t\t}\n\t\t\t\n\t\t\t\/\/=================================================================\n\t\t\t\/\/=================================================================\n\t\t\t\/\/=================================================================\n \n\t\t\t\n for (i = 0; i < addfields; ++i)\n {\n m_f->m_exp[nfields + i] = m_f->AppendExpList();\n m_f->m_exp[nfields + i]->UpdatePhys() = outfield[i];\n m_f->m_exp[nfields + i]->FwdTrans(outfield[i],\n\t\t\t\t\t\t\t\t\t\t\t\t m_f->m_exp[nfields + i]->UpdateCoeffs());\n }\n \n\t\t\t\/\/ vector<string > outname;\n\t\t\t\/\/ if (addfields == 1)\n\t\t\t\/\/ {\n\t\t\t\/\/ outname.push_back(\"W_z\");\n\t\t\t\/\/ }\n\t\t\t\/\/ else\n\t\t\t\/\/ {\n\t\t\t\/\/ outname.push_back(\"Q_x\");\n\t\t\t\/\/ outname.push_back(\"Q_y\");\n\t\t\t\/\/ outname.push_back(\"Q_z\");\n\t\t\t\/\/ }\n\t\t\t\n\t\t\tvector<string> outname;\n\t\t\toutname.push_back(\"Q\");\n \n std::vector<LibUtilities::FieldDefinitionsSharedPtr> FieldDef\n\t\t\t= m_f->m_exp[0]->GetFieldDefinitions();\n std::vector<std::vector<NekDouble> > FieldData(FieldDef.size());\n \n for (j = 0; j < nfields + addfields; ++j)\n {\n for (i = 0; i < FieldDef.size(); ++i)\n {\n if (j >= nfields)\n {\n FieldDef[i]->m_fields.push_back(outname[j-nfields]);\n }\n else\n {\n FieldDef[i]->m_fields.push_back(m_f->m_fielddef[0]->m_fields[j]);\n }\n m_f->m_exp[j]->AppendFieldData(FieldDef[i], FieldData[i]);\n }\n }\n \n m_f->m_fielddef = FieldDef;\n m_f->m_data = FieldData;\n\t\t\t\n\t\t\t\n }\n }\n}\n<|endoftext|>"} {"text":"<commit_before>\/\/ Copyright (c) 2006-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 <windows.h>\n#include <commctrl.h>\n#include \"base\/command_line.h\"\n#include \"base\/event_recorder.h\"\n#include \"base\/gfx\/native_theme.h\"\n#include \"base\/resource_util.h\"\n#include \"base\/win_util.h\"\n#include \"webkit\/tools\/test_shell\/foreground_helper.h\"\n#include \"webkit\/tools\/test_shell\/test_shell.h\"\n#include \"webkit\/tools\/test_shell\/test_shell_platform_delegate.h\"\n\nTestShellPlatformDelegate::TestShellPlatformDelegate(\n const CommandLine& command_line)\n : command_line_(command_line) {\n#ifdef _CRTDBG_MAP_ALLOC\n _CrtSetReportFile(_CRT_WARN, _CRTDBG_FILE_STDERR);\n _CrtSetReportMode(_CRT_WARN, _CRTDBG_MODE_FILE);\n#endif\n}\n\nTestShellPlatformDelegate::~TestShellPlatformDelegate() {\n#ifdef _CRTDBG_MAP_ALLOC\n _CrtDumpMemoryLeaks();\n#endif\n}\n\nvoid TestShellPlatformDelegate::PreflightArgs(int *argc, char ***argv) {\n}\n\n\/\/ This test approximates whether you have the Windows XP theme selected by\n\/\/ inspecting a couple of metrics. It does not catch all cases, but it does\n\/\/ pick up on classic vs xp, and normal vs large fonts. Something it misses\n\/\/ is changes to the color scheme (which will infact cause pixel test\n\/\/ failures).\n\/\/\n\/\/ ** Expected dependencies **\n\/\/ + Theme: Windows XP\n\/\/ + Color scheme: Default (blue)\n\/\/ + Font size: Normal\n\/\/ + Font smoothing: off (minor impact).\n\/\/\nstatic bool HasLayoutTestThemeDependenciesWin() {\n \/\/ This metric will be 17 when font size is \"Normal\". The size of drop-down\n \/\/ menus depends on it.\n if (::GetSystemMetrics(SM_CXVSCROLL) != 17)\n return false;\n\n \/\/ Check that the system fonts RenderThemeWin relies on are Tahoma 11 pt.\n NONCLIENTMETRICS metrics;\n win_util::GetNonClientMetrics(&metrics);\n LOGFONTW* system_fonts[] =\n { &metrics.lfStatusFont, &metrics.lfMenuFont, &metrics.lfSmCaptionFont };\n\n for (size_t i = 0; i < arraysize(system_fonts); ++i) {\n if (system_fonts[i]->lfHeight != -11 ||\n 0 != wcscmp(L\"Tahoma\", system_fonts[i]->lfFaceName))\n return false;\n }\n return true;\n}\n\nbool TestShellPlatformDelegate::CheckLayoutTestSystemDependencies() {\n bool has_deps = HasLayoutTestThemeDependenciesWin();\n if (!has_deps) {\n fprintf(stderr,\n \"\\n\"\n \"###############################################################\\n\"\n \"## Layout test system dependencies check failed.\\n\"\n \"## Some layout tests may fail due to unexpected theme.\\n\"\n \"##\\n\"\n \"## To fix, go to Display Properties -> Appearance, and select:\\n\"\n \"## + Windows and buttons: Windows XP style\\n\"\n \"## + Color scheme: Default (blue)\\n\"\n \"## + Font size: Normal\\n\"\n \"###############################################################\\n\");\n }\n return has_deps;\n}\n\nvoid TestShellPlatformDelegate::SuppressErrorReporting() {\n _set_abort_behavior(0, _WRITE_ABORT_MSG);\n}\n\nvoid TestShellPlatformDelegate::InitializeGUI() {\n INITCOMMONCONTROLSEX InitCtrlEx;\n\n InitCtrlEx.dwSize = sizeof(INITCOMMONCONTROLSEX);\n InitCtrlEx.dwICC = ICC_STANDARD_CLASSES;\n InitCommonControlsEx(&InitCtrlEx);\n TestShell::RegisterWindowClass();\n}\n\nvoid TestShellPlatformDelegate::SelectUnifiedTheme() {\n gfx::NativeTheme::instance()->DisableTheming();\n}\n\nvoid TestShellPlatformDelegate::SetWindowPositionForRecording(\n TestShell *shell) {\n \/\/ Move the window to the upper left corner for consistent\n \/\/ record\/playback mode. For automation, we want this to work\n \/\/ on build systems where the script invoking us is a background\n \/\/ process. So for this case, make our window the topmost window\n \/\/ as well.\n ForegroundHelper::SetForeground(shell->mainWnd());\n ::SetWindowPos(shell->mainWnd(), HWND_TOP, 0, 0, 600, 800, 0);\n}\n<commit_msg>redo CL 21368 - fix test shell on windows to accept vista sys deps<commit_after>\/\/ Copyright (c) 2006-2009 The Chromium Authors. All rights reserved.\n\/\/ Use of this source code is governed by a BSD-style license that can be\n\/\/ found in the LICENSE file.\n\n#include <string>\n#include <list>\n#include <windows.h>\n#include <commctrl.h>\n#include \"base\/command_line.h\"\n#include \"base\/event_recorder.h\"\n#include \"base\/gfx\/native_theme.h\"\n#include \"base\/resource_util.h\"\n#include \"base\/win_util.h\"\n#include \"webkit\/tools\/test_shell\/foreground_helper.h\"\n#include \"webkit\/tools\/test_shell\/test_shell.h\"\n#include \"webkit\/tools\/test_shell\/test_shell_platform_delegate.h\"\n\nTestShellPlatformDelegate::TestShellPlatformDelegate(\n const CommandLine& command_line)\n : command_line_(command_line) {\n#ifdef _CRTDBG_MAP_ALLOC\n _CrtSetReportFile(_CRT_WARN, _CRTDBG_FILE_STDERR);\n _CrtSetReportMode(_CRT_WARN, _CRTDBG_MODE_FILE);\n#endif\n}\n\nTestShellPlatformDelegate::~TestShellPlatformDelegate() {\n#ifdef _CRTDBG_MAP_ALLOC\n _CrtDumpMemoryLeaks();\n#endif\n}\n\nvoid TestShellPlatformDelegate::PreflightArgs(int *argc, char ***argv) {\n}\n\n\n\n\/\/ This test approximates whether you are running the default themes for\n\/\/ your platform by inspecting a couple of metrics.\n\/\/ It does not catch all cases, but it does pick up on classic vs xp,\n\/\/ and normal vs large fonts. Something it misses is changes to the color\n\/\/ scheme (which will infact cause pixel test failures).\nbool TestShellPlatformDelegate::CheckLayoutTestSystemDependencies() {\n std::list<std::string> errors;\n\n OSVERSIONINFOEX osvi;\n ::ZeroMemory(&osvi, sizeof(OSVERSIONINFOEX));\n osvi.dwOSVersionInfoSize = sizeof(OSVERSIONINFOEX);\n ::GetVersionEx((OSVERSIONINFO *)&osvi);\n\n \/\/ default to XP metrics, override if on Vista\n int requiredVScrollSize = 17;\n int requiredFontSize = -11; \/\/ 8 pt\n const WCHAR *requiredFont = L\"Tahoma\";\n bool isVista = false;\n if (osvi.dwMajorVersion == 6\n && osvi.dwMinorVersion == 0\n && osvi.wProductType == VER_NT_WORKSTATION) {\n requiredFont = L\"Segoe UI\";\n requiredFontSize = -12; \/\/ 9 pt\n isVista = true;\n } else if (osvi.dwMajorVersion == 5\n && osvi.dwMinorVersion == 1\n && osvi.wProductType == VER_NT_WORKSTATION) {\n \/\/ XP;\n } else {\n errors.push_back(\"Unsupported Operating System version \"\n \"(must use XP or Vista)\");\n }\n\n \/\/ on both XP and Vista, this metric will be 17 when font size is \"Normal\".\n \/\/ The size of drop-down menus depends on it.\n int vScrollSize = ::GetSystemMetrics(SM_CXVSCROLL);\n if (vScrollSize != requiredVScrollSize) {\n errors.push_back(\"Must use normal size fonts (96 dpi)\");\n }\n\n \/\/ font smoothing (including ClearType) must be disabled\n BOOL bFontSmoothing;\n SystemParametersInfo(SPI_GETFONTSMOOTHING, (UINT)0,\n (PVOID)&bFontSmoothing, (UINT)0);\n if (bFontSmoothing) {\n errors.push_back(\"Font smoothing (ClearType) must be disabled\");\n }\n\n \/\/ Check that we're using the default system fonts\n NONCLIENTMETRICS metrics;\n win_util::GetNonClientMetrics(&metrics);\n LOGFONTW* system_fonts[] =\n { &metrics.lfStatusFont, &metrics.lfMenuFont, &metrics.lfSmCaptionFont };\n\n for (size_t i = 0; i < arraysize(system_fonts); ++i) {\n if (system_fonts[i]->lfHeight != requiredFontSize ||\n wcscmp(requiredFont, system_fonts[i]->lfFaceName)) {\n if (isVista)\n errors.push_back(\"Must use either the Aero or Basic theme\");\n else\n errors.push_back(\"Must use the default XP theme (Luna)\");\n break;\n }\n }\n\n if (!errors.empty()) {\n fprintf(stderr, \"%s\",\n \"##################################################################\\n\"\n \"## Layout test system dependencies check failed.\\n\"\n \"##\\n\");\n for (std::list<std::string>::iterator it = errors.begin();\n it != errors.end();\n ++it) {\n fprintf(stderr, \"## %s\\n\", it->c_str());\n }\n fprintf(stderr, \"%s\",\n \"##\\n\"\n \"##################################################################\\n\");\n }\n return errors.empty();\n}\n\nvoid TestShellPlatformDelegate::SuppressErrorReporting() {\n _set_abort_behavior(0, _WRITE_ABORT_MSG);\n}\n\nvoid TestShellPlatformDelegate::InitializeGUI() {\n INITCOMMONCONTROLSEX InitCtrlEx;\n\n InitCtrlEx.dwSize = sizeof(INITCOMMONCONTROLSEX);\n InitCtrlEx.dwICC = ICC_STANDARD_CLASSES;\n InitCommonControlsEx(&InitCtrlEx);\n TestShell::RegisterWindowClass();\n}\n\nvoid TestShellPlatformDelegate::SelectUnifiedTheme() {\n gfx::NativeTheme::instance()->DisableTheming();\n}\n\nvoid TestShellPlatformDelegate::SetWindowPositionForRecording(\n TestShell *shell) {\n \/\/ Move the window to the upper left corner for consistent\n \/\/ record\/playback mode. For automation, we want this to work\n \/\/ on build systems where the script invoking us is a background\n \/\/ process. So for this case, make our window the topmost window\n \/\/ as well.\n ForegroundHelper::SetForeground(shell->mainWnd());\n ::SetWindowPos(shell->mainWnd(), HWND_TOP, 0, 0, 600, 800, 0);\n}\n<|endoftext|>"} {"text":"<commit_before>\/\/ Copyright 2018-2020 Intel Corporation\n\/\/ SPDX-License-Identifier: Apache-2.0\n\n#include \"GLFWOSPRayWindow.h\"\n#include \"example_common.h\"\n\nusing namespace ospray;\nusing rkcommon::make_unique;\n\nint main(int argc, const char *argv[])\n{\n bool denoiser = ospLoadModule(\"denoiser\") == OSP_NO_ERROR;\n\n initializeOSPRay(argc, argv);\n\n auto glfwOSPRayWindow =\n make_unique<GLFWOSPRayWindow>(vec2i(1024, 768), denoiser);\n glfwOSPRayWindow->mainLoop();\n glfwOSPRayWindow.reset();\n\n ospShutdown();\n\n return 0;\n}\n<commit_msg>Load the denoiser module after initializing OSPRay<commit_after>\/\/ Copyright 2018-2020 Intel Corporation\n\/\/ SPDX-License-Identifier: Apache-2.0\n\n#include \"GLFWOSPRayWindow.h\"\n#include \"example_common.h\"\n\nusing namespace ospray;\nusing rkcommon::make_unique;\n\nint main(int argc, const char *argv[])\n{\n initializeOSPRay(argc, argv);\n\n bool denoiser = ospLoadModule(\"denoiser\") == OSP_NO_ERROR;\n\n auto glfwOSPRayWindow =\n make_unique<GLFWOSPRayWindow>(vec2i(1024, 768), denoiser);\n glfwOSPRayWindow->mainLoop();\n glfwOSPRayWindow.reset();\n\n ospShutdown();\n\n return 0;\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-2018 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#include \"AFCAccountModule.h\"\n#include \"Server\/Interface\/AFINetServerModule.h\"\n\nbool AFCAccountModule::Init()\n{\n mnRoleHallContainer = -3;\n mnConnectContainer = -1;\n\n m_pKernelModule = pPluginManager->FindModule<AFIKernelModule>();\n m_pElementInfoModule = pPluginManager->FindModule<AFIElementModule>();\n m_pUUIDModule = pPluginManager->FindModule<AFIGUIDModule>();\n\n \/\/m_pEventProcessModule->AddEventCallBack(0, AFED_ON_DATABASE_SERVER_LOADROE_BEGIN, OnLoadRoleBeginEvent);\n \/\/m_pEventProcessModule->AddEventCallBack(0, AFED_ON_DATABASE_SERVER_LOADROE_FINAL_RESULTS, OnLoadRoleFinalEvent);\n \/\/m_pEventProcessModule->AddEventCallBack(0, AFED_ON_CLIENT_CREATEROLE, OnCreateRoleEvent);\n \/\/m_pEventProcessModule->AddEventCallBack(0, AFED_ON_CLIENT_DELETEROLE, OnDeleteRoleEvent);\n \/\/m_pEventProcessModule->AddEventCallBack(0, AFED_ON_CLIENT_LEAVE_GAME, OnAcountDisConnectEvent);\n\n return true;\n}\n\nbool AFCAccountModule::Shut()\n{\n return true;\n}\n\nbool AFCAccountModule::Update()\n{\n return true;\n}\n\nint AFCAccountModule::OnLoadRoleFinalEvent(const AFGUID& object, const int nEventID, const AFIDataList& var)\n{\n \/\/if(9 != var.GetCount())\n \/\/{\n \/\/ return -1;\n \/\/}\n\n \/\/\/\/赋予属性\n \/\/const char* pstrAccount = var.StringVal(0);\n \/\/AFCValueList valueInfo;\n \/\/valueInfo << pstrAccount;\n\n \/\/int nCount = 0;\n \/\/for(int i = 1; i <= 7; i += 2)\n \/\/{\n \/\/ const char* pstrRoleName = var.StringVal(i);\n \/\/ if(strlen(pstrRoleName) > 0)\n \/\/ {\n \/\/ \/\/看容器中是否已经存在，存在则不创建\n \/\/ AFCValueList varHallObjectList;\n \/\/ AFCValueList varHalvalueInfo;\n \/\/ varHalvalueInfo << pstrRoleName;\n \/\/ int nHallObjectCount = m_pKernelModule->GetObjectByProperty(mnRoleHallContainer, \"RoleName\", varHalvalueInfo, varHallObjectList);\n \/\/ if(nHallObjectCount > 0)\n \/\/ {\n\n \/\/ for(int j = 0; j < varHallObjectList.GetCount(); j++)\n \/\/ {\n \/\/ m_pKernelModule->LogErrorObject(varHallObjectList.ObjectVal(j));\n \/\/ m_pKernelModule->DestroyObject(varHallObjectList.ObjectVal(j));\n \/\/ }\n \/\/ }\n\n \/\/ GTProperty* gtPproperty = m_pElementInfoModule->GetPropertyManager(\"Scene0\")->GetElement(\"RelivePos\");\n \/\/ const char* pstrRelivePos = gtPproperty->QueryString();\n \/\/ AFCValueList valueRelivePos(pstrRelivePos, \",\");\n\n \/\/ char szConfigIindex[MAX_PATH] = { 0 };\n \/\/ sprintf(szConfigIindex, \"%d\", var.IntVal(i + 1));\n\n \/\/ AFCValueList arg;\n \/\/ arg << \"Account\" << pstrAccount;\n \/\/ arg << \"RoleName\" << pstrRoleName;\n \/\/ arg << \"SceneID\" << mnRoleHallContainer;\n \/\/ arg << \"X\" << atof(valueRelivePos.StringVal(0));\n \/\/ arg << \"Y\" << atof(valueRelivePos.StringVal(1));\n \/\/ arg << \"Z\" << atof(valueRelivePos.StringVal(2));\n \/\/ m_pKernelModule->CreateObject(0, mnRoleHallContainer, 0, \"Player\", szConfigIindex, arg);\n\n \/\/ nCount++;\n \/\/ }\n \/\/}\n\n \/\/char szInfo[MAX_PATH] = { 0 };\n \/\/sprintf(szInfo, \"Load data final, %s: have %d role.\", pstrAccount, nCount);\n \/\/m_pKernelModule->LogInfo(szInfo);\n\n return 0;\n}\n\nbool AFCAccountModule::PostInit()\n{\n \/\/m_pKernelModule->CreateContainer(mnRoleHallContainer, \"\");\n\n \/\/m_pKernelModule->LogInfo(\" -3 RoleHallContainer \");\n\n return true;\n}\n\nbool AFCAccountModule::GetRoleList(const std::string& strAccount, AFMsg::AckRoleLiteInfoList& xAckRoleLiteInfoList)\n{\n\n return true;\n}\n\nbool AFCAccountModule::CreateRole(const std::string& strAccount, AFMsg::AckRoleLiteInfoList& xAckRoleLiteInfoList, const AFIDataList& varList)\n{\n AFMsg::RoleLiteInfo* pData = xAckRoleLiteInfoList.add_char_data();\n pData->mutable_id()->CopyFrom(AFINetModule::GUIDToPB(m_pUUIDModule->CreateGUID()));\n\n int nCareer = varList.Int(0);\n int sex = varList.Int(1);\n int race = varList.Int(2);\n std::string noob_name = varList.String(3);\n int game_id = varList.Int(4);\n\n pData->set_career(nCareer);\n pData->set_sex(sex);\n pData->set_race(race);\n pData->set_noob_name(noob_name);\n pData->set_game_id(game_id);\n pData->set_role_level(1);\n pData->set_delete_time(0);\n pData->set_reg_time(0);\n pData->set_last_offline_time(0);\n pData->set_last_offline_ip(0);\n pData->set_view_record(\"\");\n\n return true;\n}\n\nbool AFCAccountModule::DeleteRole(const std::string& strAccount, AFMsg::AckRoleLiteInfoList& xAckRoleLiteInfoList)\n{\n return true;\n}\n\nint AFCAccountModule::OnCreateRoleEvent(const AFGUID& object, const int nEventID, const AFIDataList& var)\n{\n \/\/if(6 != var.GetCount())\n \/\/{\n \/\/ return 0;\n \/\/}\n\n \/\/\/\/如果有4个玩家则不让创建\n \/\/const char* pstrAccountName = var.StringVal(0);\n \/\/const char* pstrRoleName = var.StringVal(1);\n \/\/int nRoleSex = var.IntVal(2);\n \/\/int nRoleJob = var.IntVal(3);\n \/\/int nRoleRace = var.IntVal(4);\n \/\/int nRoleCamp = var.IntVal(5);\n\n \/\/AFCValueList roleLlist;\n \/\/if(m_pNoSqlModule->QueryAccountRoleList(pstrAccountName, roleLlist) >= 4)\n \/\/ \/\/if (m_pDataBaseModule->QueryAccountRoleList(pstrAccountName, roleLlist) >= 4)\n \/\/{\n \/\/ return 0;\n \/\/}\n \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n \/\/\/\/创建人物直接走了数据库\n \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n \/\/if(m_pNoSqlModule->CreateRole(pstrAccountName, pstrRoleName) <= 0)\n \/\/ \/\/if (m_pDataBaseModule->CreateRole(pstrAccountName, pstrRoleName) <= 0)\n \/\/{\n \/\/ return 0;\n \/\/}\n\n \/\/AFCValueList varPropertyKeyList;\n \/\/AFCValueList varPropertyValueList;\n\n \/\/varPropertyKeyList << \"RoleName\"\n \/\/ << \"Sex\"\n \/\/ << \"Job\"\n \/\/ << \"Race\"\n \/\/ << \"Camp\"\n \/\/ << \"SceneID\"\n \/\/ << \"LastContainerID\"\n \/\/ << \"ClassName\";\n\n \/\/varPropertyValueList << pstrRoleName\n \/\/ << nRoleSex\n \/\/ << nRoleJob\n \/\/ << nRoleRace\n \/\/ << nRoleCamp\n \/\/ << mnRoleHallContainer\n \/\/ << 1\n \/\/ << \"Player\";\n\n \/\/int nConfigName = nRoleJob + nRoleSex * 10;\n \/\/char szConfigName[MAX_PATH] = { 0 };\n \/\/sprintf(szConfigName, \"%d\", nConfigName);\n\n \/\/\/\/弄到所有的属性\n \/\/GTPropertyManager* pConfigPropertyManager = m_pElementInfoModule->GetPropertyManager(szConfigName);\n \/\/if(pConfigPropertyManager)\n \/\/{\n \/\/ GTProperty* pConfigPropertyInfo = pConfigPropertyManager->First();\n \/\/ while(pConfigPropertyInfo)\n \/\/ {\n \/\/ \/\/看属性是否需要保存,不需要保存的就别村\n \/\/ if(!pConfigPropertyInfo->GetSave())\n \/\/ {\n \/\/ pConfigPropertyInfo = pConfigPropertyManager->Next();\n \/\/ continue;\n \/\/ }\n \/\/ \/\/这个属性RoleName是玩家的，因此，这里不能有RoleName\n \/\/ const AFIDataList& valueList = pConfigPropertyInfo->GetValue();\n\n\n \/\/ if(0 != strcmp(pConfigPropertyInfo->GetKey(), \"RoleName\")\n \/\/ && 0 != strcmp(pConfigPropertyInfo->GetKey(), \"Sex\")\n \/\/ && 0 != strcmp(pConfigPropertyInfo->GetKey(), \"Job\")\n \/\/ && 0 != strcmp(pConfigPropertyInfo->GetKey(), \"Race\")\n \/\/ && 0 != strcmp(pConfigPropertyInfo->GetKey(), \"Camp\")\n \/\/ && 0 != strcmp(pConfigPropertyInfo->GetKey(), \"Account\")\n \/\/ && 0 != strcmp(pConfigPropertyInfo->GetKey(), \"SceneID\")\n \/\/ && 0 != strcmp(pConfigPropertyInfo->GetKey(), \"LastContainerID\")\n \/\/ && 0 != strcmp(pConfigPropertyInfo->GetKey(), \"ClassName\"))\n \/\/ {\n \/\/ varPropertyKeyList << pConfigPropertyInfo->GetKey();\n \/\/ varPropertyValueList.Append(valueList, 0, 1);\n \/\/ }\n\n \/\/ pConfigPropertyInfo = pConfigPropertyManager->Next();\n \/\/ }\n \/\/}\n \/\/varPropertyKeyList << \"RoleName\";\n \/\/varPropertyValueList << pstrRoleName;\n \/\/varPropertyKeyList << \"Sex\";\n \/\/varPropertyValueList << nRoleSex;\n \/\/varPropertyKeyList << \"Job\";\n \/\/varPropertyValueList << nRoleJob;\n \/\/varPropertyKeyList << \"Race\";\n \/\/varPropertyValueList << nRoleRace;\n \/\/varPropertyKeyList << \"Camp\";\n \/\/varPropertyValueList << nRoleCamp;\n \/\/varPropertyKeyList << \"SceneID\";\n \/\/varPropertyValueList << mnRoleHallContainer;\n \/\/varPropertyKeyList << \"LastContainerID\";\n \/\/varPropertyValueList << 1;\/\/1号场景为新手村\n \/\/varPropertyKeyList << \"ClassName\";\n \/\/varPropertyValueList << \"Player\";\n \/\/varPropertyKeyList << \"Level\";\n \/\/varPropertyValueList << 1;\n\n \/\/m_pNoSqlModule->SetRoleProperty(pstrRoleName, varPropertyKeyList, varPropertyValueList);\n\n \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n \/\/GTProperty* gtPproperty = m_pElementInfoModule->GetPropertyManager(\"Scene0\")->GetElement(\"RelivePos\");\n \/\/const char* pstrRelivePos = gtPproperty->QueryString();\n \/\/AFCValueList valueRelivePos(pstrRelivePos, \",\");\n\n \/\/AFCValueList arg;\n \/\/arg << \"Account\" << pstrAccountName;\n \/\/arg << \"RoleName\" << pstrRoleName;\n \/\/arg << \"SceneID\" << mnRoleHallContainer;\n \/\/arg << \"X\" << atof(valueRelivePos.StringVal(0));\n \/\/arg << \"Y\" << atof(valueRelivePos.StringVal(1));\n \/\/arg << \"Z\" << atof(valueRelivePos.StringVal(2));\n \/\/m_pKernelModule->CreateObject(0, mnRoleHallContainer, 0, \"Player\", szConfigName, arg);\n \/\/\/\/nosql 则不需要这样了\n \/\/\/\/m_pEventProcessModule->DoEvent(0, AFED_ON_DATABASE_SERVER_LOADROE_BEGIN, AFCValueList() << pstrAccountName);\n\n return 0;\n}\n\nint AFCAccountModule::OnDeleteRoleEvent(const AFGUID& object, const int nEventID, const AFIDataList& var)\n{\n \/\/if(2 != var.GetCount())\n \/\/{\n \/\/ return 0;\n \/\/}\n\n \/\/const char* pstrAccountName = var.StringVal(0);\n \/\/const char* pstrRoleName = var.StringVal(1);\n\n \/\/AFCValueList valObjctList;\n \/\/m_pKernelModule->GetObjectByProperty(mnRoleHallContainer, \"RoleName\", AFCValueList() << pstrRoleName, valObjctList);\n \/\/if(valObjctList.GetCount() == 1)\n \/\/{\n \/\/ m_pNoSqlModule->DeleteRole(pstrAccountName, pstrRoleName);\n \/\/ \/\/m_pDataBaseModule->DeleteRole(pstrAccountName, pstrRoleName);\n \/\/ m_pKernelModule->DestroyObject(valObjctList.ObjectVal(0));\n \/\/ \/\/m_pEventProcessModule->DoEvent( 0, AFED_ON_CLIENT_DELETEROLE_RESULTS, AFCValueList() << pstrAccountName << pstrRoleName );\n \/\/}\n\n return 0;\n}\n\nint AFCAccountModule::OnAcountDisConnectEvent(const AFGUID& object, const int nEventID, const AFIDataList& var)\n{\n \/* if(var.GetCount() == 3)\n {\n const char* pstrAccount = var.StringVal(0);\n const char* pstrRoleName = var.StringVal(1);\n AFGUID ident = var.ObjectVal(2);\n\n if(strlen(pstrAccount) > 0)\n {\n if(m_pGameLogicModule->GetGameID() == 1)\n {\n\n if(!ident.IsNull())\n {\n m_pKernelModule->DestroyObject(ident);\n }\n else\n {\n AFCValueList varHallObjectList;\n AFCValueList varHalvalueInfo;\n varHalvalueInfo << pstrAccount;\n\n int nHallObjectCount = m_pKernelModule->GetObjectByProperty(mnRoleHallContainer, \"Account\", varHalvalueInfo, varHallObjectList);\n for(int i = 0; i < varHallObjectList.GetCount(); i++)\n {\n AFGUID identHall = varHallObjectList.ObjectVal(i);\n if(ident.nSerial == m_pGameLogicModule->GetGameID()\n && m_pKernelModule->GetObject(identHall))\n {\n m_pKernelModule->DestroyObject(identHall);\n }\n }\n }\n }\n }\n }\n *\/\n return 0;\n}\n\nint AFCAccountModule::OnLoadRoleBeginEvent(const AFGUID& object, const int nEventID, const AFIDataList& var)\n{\n \/\/\/\/直接从NOSQL数据库拉\n \/\/const char* pstrAccount = var.StringVal(0);\n \/\/AFCValueList roleLlist;\n \/\/if(m_pNoSqlModule->QueryAccountRoleList(pstrAccount, roleLlist) > 0)\n \/\/{\n \/\/ for(int i = 0; i < roleLlist.GetCount(); i++)\n \/\/ {\n \/\/ const char* pstrRoleName = roleLlist.StringVal(i);\n \/\/ if(strlen(pstrRoleName) > 0)\n \/\/ {\n \/\/ \/\/看容器中是否已经存在，存在则不创建\n \/\/ AFCValueList varHallObjectList;\n \/\/ AFCValueList varHalvalueInfo;\n \/\/ varHalvalueInfo << pstrRoleName;\n \/\/ int nHallObjectCount = m_pKernelModule->GetObjectByProperty(mnRoleHallContainer, \"RoleName\", varHalvalueInfo, varHallObjectList);\n \/\/ if(nHallObjectCount > 0)\n \/\/ {\n \/\/ for(int j = 0; j < varHallObjectList.GetCount(); j++)\n \/\/ {\n \/\/ m_pKernelModule->LogErrorObject(varHallObjectList.ObjectVal(j));\n \/\/ m_pKernelModule->DestroyObject(varHallObjectList.ObjectVal(j));\n \/\/ }\n \/\/ }\n\n \/\/ GTProperty* gtPproperty = m_pElementInfoModule->GetPropertyManager(\"Scene0\")->GetElement(\"RelivePos\");\n \/\/ const char* pstrRelivePos = gtPproperty->QueryString();\n \/\/ AFCValueList valueRelivePos(pstrRelivePos, \",\");\n\n \/\/ char szConfigIindex[MAX_PATH] = { 0 };\n \/\/ sprintf(szConfigIindex, \"%d\", var.IntVal(i + 1));\n\n \/\/ AFCValueList arg;\n \/\/ arg << \"Account\" << pstrAccount;\n \/\/ arg << \"RoleName\" << pstrRoleName;\n \/\/ arg << \"SceneID\" << mnRoleHallContainer;\n \/\/ arg << \"X\" << atof(valueRelivePos.StringVal(0));\n \/\/ arg << \"Y\" << atof(valueRelivePos.StringVal(1));\n \/\/ arg << \"Z\" << atof(valueRelivePos.StringVal(2));\n \/\/ m_pKernelModule->CreateObject(0, mnRoleHallContainer, 0, \"Player\", szConfigIindex, arg);\n \/\/ }\n \/\/ }\n \/\/}\n\n return 0;\n}\n\n<commit_msg>fix sonar bug<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-2018 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#include \"AFCAccountModule.h\"\n#include \"Server\/Interface\/AFINetServerModule.h\"\n\nbool AFCAccountModule::Init()\n{\n mnRoleHallContainer = -3;\n mnConnectContainer = -1;\n\n m_pKernelModule = pPluginManager->FindModule<AFIKernelModule>();\n m_pElementInfoModule = pPluginManager->FindModule<AFIElementModule>();\n m_pUUIDModule = pPluginManager->FindModule<AFIGUIDModule>();\n return true;\n}\n\nbool AFCAccountModule::Shut()\n{\n return true;\n}\n\nbool AFCAccountModule::Update()\n{\n return true;\n}\n\nint AFCAccountModule::OnLoadRoleFinalEvent(const AFGUID& object, const int nEventID, const AFIDataList& var)\n{\n return 0;\n}\n\nbool AFCAccountModule::PostInit()\n{\n return true;\n}\n\nbool AFCAccountModule::GetRoleList(const std::string& strAccount, AFMsg::AckRoleLiteInfoList& xAckRoleLiteInfoList)\n{\n\n return true;\n}\n\nbool AFCAccountModule::CreateRole(const std::string& strAccount, AFMsg::AckRoleLiteInfoList& xAckRoleLiteInfoList, const AFIDataList& varList)\n{\n AFMsg::RoleLiteInfo* pData = xAckRoleLiteInfoList.add_char_data();\n pData->mutable_id()->CopyFrom(AFINetModule::GUIDToPB(m_pUUIDModule->CreateGUID()));\n\n int nCareer = varList.Int(0);\n int sex = varList.Int(1);\n int race = varList.Int(2);\n std::string noob_name = varList.String(3);\n int game_id = varList.Int(4);\n\n pData->set_career(nCareer);\n pData->set_sex(sex);\n pData->set_race(race);\n pData->set_noob_name(noob_name);\n pData->set_game_id(game_id);\n pData->set_role_level(1);\n pData->set_delete_time(0);\n pData->set_reg_time(0);\n pData->set_last_offline_time(0);\n pData->set_last_offline_ip(0);\n pData->set_view_record(\"\");\n\n return true;\n}\n\nbool AFCAccountModule::DeleteRole(const std::string& strAccount, AFMsg::AckRoleLiteInfoList& xAckRoleLiteInfoList)\n{\n return true;\n}\n\nint AFCAccountModule::OnCreateRoleEvent(const AFGUID& object, const int nEventID, const AFIDataList& var)\n{\n return 0;\n}\n\nint AFCAccountModule::OnDeleteRoleEvent(const AFGUID& object, const int nEventID, const AFIDataList& var)\n{\n return 0;\n}\n\nint AFCAccountModule::OnAcountDisConnectEvent(const AFGUID& object, const int nEventID, const AFIDataList& var)\n{\n return 0;\n}\n\nint AFCAccountModule::OnLoadRoleBeginEvent(const AFGUID& object, const int nEventID, const AFIDataList& var)\n{\n return 0;\n}\n\n<|endoftext|>"} {"text":"<commit_before>\/\/ ----------------------------------------------------------------------------\r\n\/\/ PSP Player Emulation Suite\r\n\/\/ Copyright (C) 2006 Ben Vanik (noxa)\r\n\/\/ Licensed under the LGPL - see License.txt in the project root for details\r\n\/\/ ----------------------------------------------------------------------------\r\n\r\n#include \"StdAfx.h\"\r\n#include \"R4000Generator.h\"\r\n#include \"R4000Cpu.h\"\r\n#include \"R4000Core.h\"\r\n#include \"R4000Memory.h\"\r\n#include \"R4000GenContext.h\"\r\n\r\n#include \"Loader.hpp\"\r\n#include \"CodeGenerator.hpp\"\r\n\r\nusing namespace System::Diagnostics;\r\nusing namespace Noxa::Emulation::Psp;\r\nusing namespace Noxa::Emulation::Psp::Cpu;\r\nusing namespace SoftWire;\r\n\r\n#define g context->Generator\r\n\r\nGenerationResult SYSCALL( R4000GenContext^ context, int pass, int address, uint code, byte opcode, byte rs, byte rt, byte rd, byte shamt, byte function )\r\n{\r\n\tif( pass == 0 )\r\n\t{\r\n\t}\r\n\telse if( pass == 1 )\r\n\t{\r\n\t}\r\n\treturn GenerationResult::Invalid;\r\n}\r\n\r\nGenerationResult BREAK( R4000GenContext^ context, int pass, int address, uint code, byte opcode, byte rs, byte rt, byte rd, byte shamt, byte function )\r\n{\r\n\tif( pass == 0 )\r\n\t{\r\n\t}\r\n\telse if( pass == 1 )\r\n\t{\r\n\t}\r\n\treturn GenerationResult::Invalid;\r\n}\r\n\r\nGenerationResult SYNC( R4000GenContext^ context, int pass, int address, uint code, byte opcode, byte rs, byte rt, byte rd, byte shamt, byte function )\r\n{\r\n\tif( pass == 0 )\r\n\t{\r\n\t}\r\n\telse if( pass == 1 )\r\n\t{\r\n\t}\r\n\treturn GenerationResult::Invalid;\r\n}\r\n\r\nGenerationResult COP1( R4000GenContext^ context, int pass, int address, uint code, byte opcode, byte rs, byte rt, ushort imm )\r\n{\r\n\tif( pass == 0 )\r\n\t{\r\n\t}\r\n\telse if( pass == 1 )\r\n\t{\r\n\t}\r\n\treturn GenerationResult::Invalid;\r\n}\r\n\r\nGenerationResult COP2( R4000GenContext^ context, int pass, int address, uint code, byte opcode, byte rs, byte rt, ushort imm )\r\n{\r\n\tif( pass == 0 )\r\n\t{\r\n\t}\r\n\telse if( pass == 1 )\r\n\t{\r\n\t}\r\n\treturn GenerationResult::Invalid;\r\n}\r\n\r\nGenerationResult HALT( R4000GenContext^ context, int pass, int address, uint code, byte opcode, byte rs, byte rt, byte rd, byte shamt, byte function )\r\n{\r\n\tif( pass == 0 )\r\n\t{\r\n\t}\r\n\telse if( pass == 1 )\r\n\t{\r\n\t}\r\n\treturn GenerationResult::Invalid;\r\n}\r\n\r\nGenerationResult MFIC( R4000GenContext^ context, int pass, int address, uint code, byte opcode, byte rs, byte rt, byte rd, byte shamt, byte function )\r\n{\r\n\tif( pass == 0 )\r\n\t{\r\n\t}\r\n\telse if( pass == 1 )\r\n\t{\r\n\t}\r\n\treturn GenerationResult::Invalid;\r\n}\r\n\r\nGenerationResult MTIC( R4000GenContext^ context, int pass, int address, uint code, byte opcode, byte rs, byte rt, byte rd, byte shamt, byte function )\r\n{\r\n\tif( pass == 0 )\r\n\t{\r\n\t}\r\n\telse if( pass == 1 )\r\n\t{\r\n\t}\r\n\treturn GenerationResult::Invalid;\r\n}\r\n<commit_msg>The code I had forgot to checkin - special instructions besides SYSCALL (needs to be converted).<commit_after>\/\/ ----------------------------------------------------------------------------\r\n\/\/ PSP Player Emulation Suite\r\n\/\/ Copyright (C) 2006 Ben Vanik (noxa)\r\n\/\/ Licensed under the LGPL - see License.txt in the project root for details\r\n\/\/ ----------------------------------------------------------------------------\r\n\r\n#include \"StdAfx.h\"\r\n#include \"R4000Generator.h\"\r\n#include \"R4000Cpu.h\"\r\n#include \"R4000Core.h\"\r\n#include \"R4000Memory.h\"\r\n#include \"R4000GenContext.h\"\r\n\r\n#include \"Loader.hpp\"\r\n#include \"CodeGenerator.hpp\"\r\n\r\nusing namespace System::Diagnostics;\r\nusing namespace Noxa::Emulation::Psp;\r\nusing namespace Noxa::Emulation::Psp::Bios;\r\nusing namespace Noxa::Emulation::Psp::Cpu;\r\nusing namespace SoftWire;\r\n\r\n#define g context->Generator\r\n\r\nGenerationResult SYSCALL( R4000GenContext^ context, int pass, int address, uint code, byte opcode, byte rs, byte rt, byte rd, byte shamt, byte function )\r\n{\r\n\tint syscall = ( int )( ( code >> 6 ) & 0xFFFFF );\r\n\r\n\tBiosFunction^ biosFunction = context->Cpu->_syscalls[ syscall ];\r\n\tbool willCall;\r\n\tbool hasReturn;\r\n\tint paramCount;\r\n\tif( biosFunction != nullptr )\r\n\t{\r\n\t\twillCall = biosFunction->IsImplemented;\r\n\t\thasReturn = biosFunction->HasReturn;\r\n\t\tparamCount = biosFunction->ParameterCount;\r\n\r\n\t\tif( biosFunction->IsImplemented == false )\r\n\t\t{\r\n\t\t\tif( pass == 0 )\r\n\t\t\t{\r\n\t\t\t\tDebug::WriteLine( String::Format( \"R4000Generator: NID 0x{0:X8} {1} is not implemented\",\r\n\t\t\t\t\tbiosFunction->NID, biosFunction->Name ) );\r\n\t\t\t}\r\n\t\t}\r\n\t}\r\n\telse\r\n\t{\r\n\t\twillCall = false;\r\n\t\thasReturn = false;\r\n\t\tparamCount = 0;\r\n\r\n\t\tif( pass == 0 )\r\n\t\t\tDebug::WriteLine( \"R4000Generator: unregistered syscall attempt\" );\r\n\t}\r\n\/*\r\n\tif( pass == 0 )\r\n\t{\r\n\t}\r\n\telse if( pass == 1 )\r\n\t{\r\n\t\t\/\/ It's important that we save what we think is the current PC\r\n\t\t\/\/ If we had an UpdatePc, it means a branch has updated it before us\r\n\t\t\/\/ and we need to save it - otherwise, save the PC following us\r\n\t\tcontext.ILGen.Emit( OpCodes.Ldarg_0 );\r\n\t\tif( context.UpdatePc == true )\r\n\t\t\tcontext.ILGen.Emit( OpCodes.Ldloc_2 );\r\n\t\telse\r\n\t\t\tcontext.ILGen.Emit( OpCodes.Ldc_I4, address + 4 );\r\n\t\tcontext.ILGen.Emit( OpCodes.Stfld, context.Core0Pc );\r\n\r\n\t\tif( willCall == true )\r\n\t\t{\r\n\t\t\t\/\/ Lame, but we need the object this gets called on and\r\n\t\t\t\/\/ there is no way to communicate what we know now to the final IL\r\n\t\t\t\/\/context.Cpu._syscalls[ syscall ].Target.Target;\r\n\t\t\tcontext.ILGen.Emit( OpCodes.Ldarg_3 );\r\n\t\t\tcontext.ILGen.Emit( OpCodes.Ldc_I4, syscall );\r\n\t\t\tcontext.ILGen.Emit( OpCodes.Ldelem, typeof( BiosFunction ) );\r\n\t\t\tcontext.ILGen.Emit( OpCodes.Ldfld, context.BiosFunctionTarget );\r\n\t\t\tcontext.ILGen.Emit( OpCodes.Call, context.DelegateTargetGet );\r\n\t\t\t\r\n\t\t\t\/\/ Memory\r\n\t\t\tcontext.ILGen.Emit( OpCodes.Ldarg_1 );\r\n\r\n\t\t\tif( paramCount > 0 )\r\n\t\t\t{\r\n\t\t\t\tEmitLoadRegister( context, 4 );\r\n\t\t\t\tif( paramCount > 1 )\r\n\t\t\t\t{\r\n\t\t\t\t\tEmitLoadRegister( context, 5 );\r\n\t\t\t\t\tif( paramCount > 2 )\r\n\t\t\t\t\t{\r\n\t\t\t\t\t\tEmitLoadRegister( context, 6 );\r\n\t\t\t\t\t\tif( paramCount > 3 )\r\n\t\t\t\t\t\t{\r\n\t\t\t\t\t\t\tEmitLoadRegister( context, 7 );\r\n\t\t\t\t\t\t\tif( paramCount > 4 )\r\n\t\t\t\t\t\t\t{\r\n\t\t\t\t\t\t\t\t\/\/ Maybe this should always go?\r\n\t\t\t\t\t\t\t\tEmitLoadRegister( context, 29 );\r\n\t\t\t\t\t\t\t}\r\n\t\t\t\t\t\t\telse\r\n\t\t\t\t\t\t\t\tcontext.ILGen.Emit( OpCodes.Ldc_I4_0 );\r\n\t\t\t\t\t\t}\r\n\t\t\t\t\t\telse\r\n\t\t\t\t\t\t{\r\n\t\t\t\t\t\t\tcontext.ILGen.Emit( OpCodes.Ldc_I4_0 );\r\n\t\t\t\t\t\t\tcontext.ILGen.Emit( OpCodes.Ldc_I4_0 );\r\n\t\t\t\t\t\t}\r\n\t\t\t\t\t}\r\n\t\t\t\t\telse\r\n\t\t\t\t\t{\r\n\t\t\t\t\t\tcontext.ILGen.Emit( OpCodes.Ldc_I4_0 );\r\n\t\t\t\t\t\tcontext.ILGen.Emit( OpCodes.Ldc_I4_0 );\r\n\t\t\t\t\t\tcontext.ILGen.Emit( OpCodes.Ldc_I4_0 );\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\tcontext.ILGen.Emit( OpCodes.Ldc_I4_0 );\r\n\t\t\t\t\tcontext.ILGen.Emit( OpCodes.Ldc_I4_0 );\r\n\t\t\t\t\tcontext.ILGen.Emit( OpCodes.Ldc_I4_0 );\r\n\t\t\t\t\tcontext.ILGen.Emit( OpCodes.Ldc_I4_0 );\r\n\t\t\t\t}\r\n\t\t\t}\r\n\t\t\telse\r\n\t\t\t{\r\n\t\t\t\tcontext.ILGen.Emit( OpCodes.Ldc_I4_0 );\r\n\t\t\t\tcontext.ILGen.Emit( OpCodes.Ldc_I4_0 );\r\n\t\t\t\tcontext.ILGen.Emit( OpCodes.Ldc_I4_0 );\r\n\t\t\t\tcontext.ILGen.Emit( OpCodes.Ldc_I4_0 );\r\n\t\t\t\tcontext.ILGen.Emit( OpCodes.Ldc_I4_0 );\r\n\t\t\t}\r\n\r\n\t\t\tif( biosFunction.Target.Method.IsFinal == true )\r\n\t\t\t\tcontext.ILGen.Emit( OpCodes.Call, biosFunction.Target.Method );\r\n\t\t\telse\r\n\t\t\t\tcontext.ILGen.Emit( OpCodes.Callvirt, biosFunction.Target.Method );\r\n\r\n\t\t\t\/\/ Function returns a value - may need to ignore\r\n\t\t\tif( hasReturn == true )\r\n\t\t\t\tEmitStoreRegister( context, 2 );\r\n\t\t\telse\r\n\t\t\t\tcontext.ILGen.Emit( OpCodes.Pop );\r\n\t\t}\r\n\t\telse\r\n\t\t{\r\n\t\t\t\/\/ When we fail, we need to make sure to handle the cases where\r\n\t\t\t\/\/ the method has a return or else things could get even worse!\r\n\t\t\tif( biosFunction != null )\r\n\t\t\t{\r\n\t\t\t\tif( hasReturn == true )\r\n\t\t\t\t{\r\n\t\t\t\t\tcontext.ILGen.Emit( OpCodes.Ldc_I4, -1 );\r\n\t\t\t\t\tEmitStoreRegister( context, 2 );\r\n\t\t\t\t}\r\n\t\t\t}\r\n\t\t}\r\n\t}*\/\r\n\treturn GenerationResult::Syscall;\r\n}\r\n\r\nGenerationResult BREAK( R4000GenContext^ context, int pass, int address, uint code, byte opcode, byte rs, byte rt, byte rd, byte shamt, byte function )\r\n{\r\n\tif( pass == 0 )\r\n\t{\r\n\t\tDebug::WriteLine( \"R4000Generator: BREAK not implemented\" );\r\n\t}\r\n\telse if( pass == 1 )\r\n\t{\r\n\t}\r\n\treturn GenerationResult::Success;\r\n}\r\n\r\nGenerationResult SYNC( R4000GenContext^ context, int pass, int address, uint code, byte opcode, byte rs, byte rt, byte rd, byte shamt, byte function )\r\n{\r\n\t\/\/ pg 629 - not needed?\r\n\tif( pass == 0 )\r\n\t{\r\n\t\tDebug::WriteLine( \"R4000Generator: SYNC not implemented\" );\r\n\t}\r\n\telse if( pass == 1 )\r\n\t{\r\n\t}\r\n\treturn GenerationResult::Success;\r\n}\r\n\r\nGenerationResult COP1( R4000GenContext^ context, int pass, int address, uint code, byte opcode, byte rs, byte rt, ushort imm )\r\n{\r\n\tif( pass == 0 )\r\n\t{\r\n\t}\r\n\telse if( pass == 1 )\r\n\t{\r\n\t}\r\n\treturn GenerationResult::Invalid;\r\n}\r\n\r\nGenerationResult COP2( R4000GenContext^ context, int pass, int address, uint code, byte opcode, byte rs, byte rt, ushort imm )\r\n{\r\n\tif( pass == 0 )\r\n\t{\r\n\t}\r\n\telse if( pass == 1 )\r\n\t{\r\n\t}\r\n\treturn GenerationResult::Invalid;\r\n}\r\n\r\nGenerationResult HALT( R4000GenContext^ context, int pass, int address, uint code, byte opcode, byte rs, byte rt, byte rd, byte shamt, byte function )\r\n{\r\n\tif( pass == 0 )\r\n\t{\r\n\t\tDebug::WriteLine( \"R4000Generator: HALT not implemented\" );\r\n\t}\r\n\telse if( pass == 1 )\r\n\t{\r\n\t}\r\n\treturn GenerationResult::Success;\r\n}\r\n\r\nGenerationResult MFIC( R4000GenContext^ context, int pass, int address, uint code, byte opcode, byte rs, byte rt, byte rd, byte shamt, byte function )\r\n{\r\n\tif( pass == 0 )\r\n\t{\r\n\t\tDebug::WriteLine( \"R4000Generator: MFIC not implemented\" );\r\n\t}\r\n\telse if( pass == 1 )\r\n\t{\r\n\t}\r\n\treturn GenerationResult::Success;\r\n}\r\n\r\nGenerationResult MTIC( R4000GenContext^ context, int pass, int address, uint code, byte opcode, byte rs, byte rt, byte rd, byte shamt, byte function )\r\n{\r\n\tif( pass == 0 )\r\n\t{\r\n\t\tDebug::WriteLine( \"R4000Generator: MTIC not implemented\" );\r\n\t}\r\n\telse if( pass == 1 )\r\n\t{\r\n\t}\r\n\treturn GenerationResult::Success;\r\n}\r\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\n#include \"OgreRoot.h\"\n#include \"OgreException.h\"\n#include \"OgreLogManager.h\"\n#include \"OgreStringConverter.h\"\n#include \"OgreWindowEventUtilities.h\"\n\n#include \"OgreGLES2Prerequisites.h\"\n#include \"OgreGLES2RenderSystem.h\"\n\n#include \"OgreAndroidEGLSupport.h\"\n#include \"OgreAndroidEGLWindow.h\"\n#include \"OgreAndroidEGLContext.h\"\n#include \"OgreAndroidResourceManager.h\"\n\n#include <iostream>\n#include <algorithm>\n#include <climits>\n\nnamespace Ogre {\n\tAndroidEGLWindow::AndroidEGLWindow(AndroidEGLSupport *glsupport)\n\t\t: EGLWindow(glsupport),\n\t\t mMaxBufferSize(32),\n\t\t mMinBufferSize(16),\n\t\t mMaxDepthSize(16),\n\t\t mMaxStencilSize(0),\n\t\t mMSAA(0),\n\t\t mCSAA(0)\n\t{\n\t}\n\n\tAndroidEGLWindow::~AndroidEGLWindow()\n\t{\n\t}\n\n\tEGLContext* AndroidEGLWindow::createEGLContext() const\n\t{\n\t\treturn new AndroidEGLContext(mEglDisplay, mGLSupport, mEglConfig, mEglSurface);\n\t}\n\n\tvoid AndroidEGLWindow::getLeftAndTopFromNativeWindow( int & left, int & top, uint width, uint height )\n\t{\n\t\t\/\/ We don't have a native window.... but I think all android windows are origined\n\t\tleft = top = 0;\n\t}\n\n\tvoid AndroidEGLWindow::initNativeCreatedWindow(const NameValuePairList *miscParams)\n\t{\n\t}\n\n\tvoid AndroidEGLWindow::createNativeWindow( int &left, int &top, uint &width, uint &height, String &title )\n\t{\n\t}\n\n\tvoid AndroidEGLWindow::reposition( int left, int top )\n\t{\n\t}\n\n\tvoid AndroidEGLWindow::resize(uint width, uint height)\n\t{\n\t}\n\n\tvoid AndroidEGLWindow::windowMovedOrResized()\n\t{\n if(mActive)\n {\n eglQuerySurface(mEglDisplay, mEglSurface, EGL_WIDTH, (EGLint*)&mWidth);\n eglQuerySurface(mEglDisplay, mEglSurface, EGL_HEIGHT, (EGLint*)&mHeight);\n \n \/\/ Notify viewports of resize\n ViewportList::iterator it = mViewportList.begin();\n while( it != mViewportList.end() )\n (*it++).second->_updateDimensions();\n }\n\t}\n\t\n void AndroidEGLWindow::switchFullScreen(bool fullscreen)\n {\n \n }\n \n void AndroidEGLWindow::create(const String& name, uint width, uint height,\n bool fullScreen, const NameValuePairList *miscParams)\n {\n\t\tmName = name;\n mWidth = width;\n mHeight = height;\n mLeft = 0;\n mTop = 0;\n mIsFullScreen = fullScreen;\n void* eglContext = NULL;\n AConfiguration* config = NULL;\n \n if (miscParams)\n {\n NameValuePairList::const_iterator opt;\n NameValuePairList::const_iterator end = miscParams->end();\n \n if ((opt = miscParams->find(\"currentGLContext\")) != end &&\n StringConverter::parseBool(opt->second))\n {\n eglContext = eglGetCurrentContext();\n if (eglContext)\n {\n OGRE_EXCEPT(Exception::ERR_RENDERINGAPI_ERROR,\n \"currentGLContext was specified with no current GL context\",\n \"EGLWindow::create\");\n }\n \n eglContext = eglGetCurrentContext();\n mEglSurface = eglGetCurrentSurface(EGL_DRAW);\n }\n \n \n if((opt = miscParams->find(\"externalWindowHandle\")) != end)\n {\n mWindow = (ANativeWindow*)(Ogre::StringConverter::parseInt(opt->second));\n }\n \n if((opt = miscParams->find(\"androidConfig\")) != end)\n {\n config = (AConfiguration*)(Ogre::StringConverter::parseInt(opt->second));\n }\n \n int ctxHandle = -1;\n if((miscParams->find(\"externalGLContext\")) != end)\n {\n mIsExternalGLControl = true;\n ctxHandle = Ogre::StringConverter::parseInt(opt->second);\n }\n\t\t\t\n\t\t\tif((opt = miscParams->find(\"maxColourBufferSize\")) != end)\n {\n mMaxBufferSize = Ogre::StringConverter::parseInt(opt->second);\n }\n\t\t\t\n\t\t\tif((opt = miscParams->find(\"maxDepthBufferSize\")) != end)\n {\n mMaxDepthSize = Ogre::StringConverter::parseInt(opt->second);\n }\n\t\t\t\n\t\t\tif((opt = miscParams->find(\"maxStencilBufferSize\")) != end)\n {\n mMaxStencilSize = Ogre::StringConverter::parseInt(opt->second);\n }\n\n\t\t\tif((opt = miscParams->find(\"minColourBufferSize\")) != end)\n {\n mMinBufferSize = Ogre::StringConverter::parseInt(opt->second);\n if (mMinBufferSize > mMaxBufferSize) mMinBufferSize = mMaxBufferSize;\n }\n\n\t\t\tif((opt = miscParams->find(\"MSAA\")) != end)\n {\n mMSAA = Ogre::StringConverter::parseInt(opt->second);\n }\n\t\t\t\n\t\t\tif((opt = miscParams->find(\"CSAA\")) != end)\n {\n mCSAA = Ogre::StringConverter::parseInt(opt->second);\n }\n }\n \n initNativeCreatedWindow(miscParams);\n \n if (mEglSurface)\n {\n mEglConfig = mGLSupport->getGLConfigFromDrawable (mEglSurface, &width, &height);\n }\n \n if (!mEglConfig && eglContext)\n {\n mEglConfig = mGLSupport->getGLConfigFromContext(eglContext);\n \n if (!mEglConfig)\n {\n \/\/ This should never happen.\n OGRE_EXCEPT(Exception::ERR_RENDERINGAPI_ERROR,\n \"Unexpected failure to determine a EGLFBConfig\",\n \"EGLWindow::create\");\n }\n }\n \n mIsExternal = (mEglSurface != 0);\n \n if (!mEglConfig)\n {\n\t\t\t_createInternalResources(mWindow, config);\n mHwGamma = false;\n }\n \n mContext = createEGLContext();\n mContext->setCurrent();\n\t\t \n eglQuerySurface(mEglDisplay, mEglSurface, EGL_WIDTH, (EGLint*)&mWidth);\n eglQuerySurface(mEglDisplay, mEglSurface, EGL_HEIGHT, (EGLint*)&mHeight);\n EGL_CHECK_ERROR\n\n\t\tmActive = true;\n\t\tmVisible = true;\n\t\tmClosed = false;\n\t}\n\n void AndroidEGLWindow::_destroyInternalResources()\n {\n GLES2RenderSystem::getResourceManager()->notifyOnContextLost();\n mContext->_destroyInternalResources();\n \n eglDestroySurface(mEglDisplay, mEglSurface);\n EGL_CHECK_ERROR\n \n eglTerminate(mEglDisplay);\n EGL_CHECK_ERROR\n \n mEglDisplay = 0;\n mEglSurface = 0;\n \n mActive = false;\n\t\tmVisible = false;\n mClosed = true;\n }\n \n void AndroidEGLWindow::_createInternalResources(NativeWindowType window, AConfiguration* config)\n {\n mWindow = window;\n \n int minAttribs[] = {\n EGL_RENDERABLE_TYPE, EGL_OPENGL_ES2_BIT,\n EGL_BUFFER_SIZE, mMinBufferSize,\n EGL_DEPTH_SIZE, 16,\n EGL_NONE\n };\n \n int maxAttribs[] = {\n EGL_RENDERABLE_TYPE, EGL_OPENGL_ES2_BIT,\n\t\t\tEGL_BUFFER_SIZE, mMaxBufferSize,\n EGL_DEPTH_SIZE, mMaxDepthSize,\n EGL_STENCIL_SIZE, mMaxStencilSize,\n EGL_NONE\n };\n\n\t\tbool bAASuccess = false;\n\t\tif (mCSAA)\n\t\t{\n\t\t\ttry\n\t\t\t{\n\t\t\t\tint CSAAminAttribs[] = {\n\t\t\t\t\tEGL_RENDERABLE_TYPE, EGL_OPENGL_ES2_BIT,\n\t\t\t\t\tEGL_BUFFER_SIZE, mMinBufferSize,\n\t\t\t\t\tEGL_DEPTH_SIZE, 16,\n\t\t\t\t\tEGL_COVERAGE_BUFFERS_NV, 1,\n\t\t\t\t\tEGL_COVERAGE_SAMPLES_NV, mMSAA,\n\t\t\t\t\tEGL_NONE\n\t\t\t\t};\n\t\t\t\tint CSAAmaxAttribs[] = {\n\t\t\t\t\tEGL_RENDERABLE_TYPE, EGL_OPENGL_ES2_BIT,\n\t\t\t\t\tEGL_BUFFER_SIZE, mMaxBufferSize,\n\t\t\t\t\tEGL_DEPTH_SIZE, mMaxDepthSize,\n\t\t\t\t\tEGL_STENCIL_SIZE, mMaxStencilSize,\n\t\t\t\t\tEGL_COVERAGE_BUFFERS_NV, 1,\n\t\t\t\t\tEGL_COVERAGE_SAMPLES_NV, mMSAA,\n\t\t\t\t\tEGL_NONE\n\t\t\t\t};\n\t\t\t\tmEglConfig = mGLSupport->selectGLConfig(CSAAminAttribs, CSAAmaxAttribs);\n\t\t\t\tbAASuccess = true;\n\t\t\t}\n\t\t\tcatch (Exception& e)\n\t\t\t{\n\t\t\t\tLogManager::getSingleton().logMessage(\"AndroidEGLWindow::_createInternalResources: setting CSAA failed\");\n\t\t\t}\n\t\t}\n\n\t\tif (mMSAA && !bAASuccess)\n\t\t{\n\t\t\ttry\n\t\t\t{\n\t\t\t\tint MSAAminAttribs[] = {\n\t\t\t\t\tEGL_RENDERABLE_TYPE, EGL_OPENGL_ES2_BIT,\n\t\t\t\t\tEGL_BUFFER_SIZE, mMinBufferSize,\n\t\t\t\t\tEGL_DEPTH_SIZE, 16,\n\t\t\t\t\tEGL_SAMPLE_BUFFERS, 1,\n\t\t\t\t\tEGL_SAMPLES, mMSAA,\n\t\t\t\t\tEGL_NONE\n\t\t\t\t};\n\t\t\t\tint MSAAmaxAttribs[] = {\n\t\t\t\t\tEGL_RENDERABLE_TYPE, EGL_OPENGL_ES2_BIT,\n\t\t\t\t\tEGL_BUFFER_SIZE, mMaxBufferSize,\n\t\t\t\t\tEGL_DEPTH_SIZE, mMaxDepthSize,\n\t\t\t\t\tEGL_STENCIL_SIZE, mMaxStencilSize,\n\t\t\t\t\tEGL_SAMPLE_BUFFERS, 1,\n\t\t\t\t\tEGL_SAMPLES, mMSAA,\n\t\t\t\t\tEGL_NONE\n\t\t\t\t};\n\t\t\t\tmEglConfig = mGLSupport->selectGLConfig(MSAAminAttribs, MSAAmaxAttribs);\n\t\t\t\tbAASuccess = true;\n\t\t\t}\n\t\t\tcatch (Exception& e)\n\t\t\t{\n\t\t\t\tLogManager::getSingleton().logMessage(\"AndroidEGLWindow::_createInternalResources: setting MSAA failed\");\n\t\t\t}\n\t\t}\n \n mEglDisplay = mGLSupport->getGLDisplay();\n if (!bAASuccess) mEglConfig = mGLSupport->selectGLConfig(minAttribs, maxAttribs);\n \n EGLint format;\n eglGetConfigAttrib(mEglDisplay, mEglConfig, EGL_NATIVE_VISUAL_ID, &format);\n EGL_CHECK_ERROR\n \n ANativeWindow_setBuffersGeometry(mWindow, 0, 0, format);\n \n mEglSurface = createSurfaceFromWindow(mEglDisplay, mWindow);\n \n if(config)\n {\n bool isLandscape = (int)AConfiguration_getOrientation(config) == 2;\n mGLSupport->setConfigOption(\"Orientation\", isLandscape ? \"Landscape\" : \"Portrait\");\n }\n \n if(mContext)\n {\n mActive = true;\n mVisible = true;\n mClosed = false;\n \n mContext->_createInternalResources(mEglDisplay, mEglConfig, mEglSurface, NULL);\n mContext->setCurrent();\n \n windowMovedOrResized();\n static_cast<GLES2RenderSystem*>(Ogre::Root::getSingletonPtr()->getRenderSystem())->resetRenderer(this);\n }\n }\n}<commit_msg>fixed passing mMSAA into EGL_COVERAGE_SAMPLES_NV<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\n#include \"OgreRoot.h\"\n#include \"OgreException.h\"\n#include \"OgreLogManager.h\"\n#include \"OgreStringConverter.h\"\n#include \"OgreWindowEventUtilities.h\"\n\n#include \"OgreGLES2Prerequisites.h\"\n#include \"OgreGLES2RenderSystem.h\"\n\n#include \"OgreAndroidEGLSupport.h\"\n#include \"OgreAndroidEGLWindow.h\"\n#include \"OgreAndroidEGLContext.h\"\n#include \"OgreAndroidResourceManager.h\"\n\n#include <iostream>\n#include <algorithm>\n#include <climits>\n\nnamespace Ogre {\n\tAndroidEGLWindow::AndroidEGLWindow(AndroidEGLSupport *glsupport)\n\t\t: EGLWindow(glsupport),\n\t\t mMaxBufferSize(32),\n\t\t mMinBufferSize(16),\n\t\t mMaxDepthSize(16),\n\t\t mMaxStencilSize(0),\n\t\t mMSAA(0),\n\t\t mCSAA(0)\n\t{\n\t}\n\n\tAndroidEGLWindow::~AndroidEGLWindow()\n\t{\n\t}\n\n\tEGLContext* AndroidEGLWindow::createEGLContext() const\n\t{\n\t\treturn new AndroidEGLContext(mEglDisplay, mGLSupport, mEglConfig, mEglSurface);\n\t}\n\n\tvoid AndroidEGLWindow::getLeftAndTopFromNativeWindow( int & left, int & top, uint width, uint height )\n\t{\n\t\t\/\/ We don't have a native window.... but I think all android windows are origined\n\t\tleft = top = 0;\n\t}\n\n\tvoid AndroidEGLWindow::initNativeCreatedWindow(const NameValuePairList *miscParams)\n\t{\n\t}\n\n\tvoid AndroidEGLWindow::createNativeWindow( int &left, int &top, uint &width, uint &height, String &title )\n\t{\n\t}\n\n\tvoid AndroidEGLWindow::reposition( int left, int top )\n\t{\n\t}\n\n\tvoid AndroidEGLWindow::resize(uint width, uint height)\n\t{\n\t}\n\n\tvoid AndroidEGLWindow::windowMovedOrResized()\n\t{\n if(mActive)\n {\n eglQuerySurface(mEglDisplay, mEglSurface, EGL_WIDTH, (EGLint*)&mWidth);\n eglQuerySurface(mEglDisplay, mEglSurface, EGL_HEIGHT, (EGLint*)&mHeight);\n \n \/\/ Notify viewports of resize\n ViewportList::iterator it = mViewportList.begin();\n while( it != mViewportList.end() )\n (*it++).second->_updateDimensions();\n }\n\t}\n\t\n void AndroidEGLWindow::switchFullScreen(bool fullscreen)\n {\n \n }\n \n void AndroidEGLWindow::create(const String& name, uint width, uint height,\n bool fullScreen, const NameValuePairList *miscParams)\n {\n\t\tmName = name;\n mWidth = width;\n mHeight = height;\n mLeft = 0;\n mTop = 0;\n mIsFullScreen = fullScreen;\n void* eglContext = NULL;\n AConfiguration* config = NULL;\n \n if (miscParams)\n {\n NameValuePairList::const_iterator opt;\n NameValuePairList::const_iterator end = miscParams->end();\n \n if ((opt = miscParams->find(\"currentGLContext\")) != end &&\n StringConverter::parseBool(opt->second))\n {\n eglContext = eglGetCurrentContext();\n if (eglContext)\n {\n OGRE_EXCEPT(Exception::ERR_RENDERINGAPI_ERROR,\n \"currentGLContext was specified with no current GL context\",\n \"EGLWindow::create\");\n }\n \n eglContext = eglGetCurrentContext();\n mEglSurface = eglGetCurrentSurface(EGL_DRAW);\n }\n \n \n if((opt = miscParams->find(\"externalWindowHandle\")) != end)\n {\n mWindow = (ANativeWindow*)(Ogre::StringConverter::parseInt(opt->second));\n }\n \n if((opt = miscParams->find(\"androidConfig\")) != end)\n {\n config = (AConfiguration*)(Ogre::StringConverter::parseInt(opt->second));\n }\n \n int ctxHandle = -1;\n if((miscParams->find(\"externalGLContext\")) != end)\n {\n mIsExternalGLControl = true;\n ctxHandle = Ogre::StringConverter::parseInt(opt->second);\n }\n\t\t\t\n\t\t\tif((opt = miscParams->find(\"maxColourBufferSize\")) != end)\n {\n mMaxBufferSize = Ogre::StringConverter::parseInt(opt->second);\n }\n\t\t\t\n\t\t\tif((opt = miscParams->find(\"maxDepthBufferSize\")) != end)\n {\n mMaxDepthSize = Ogre::StringConverter::parseInt(opt->second);\n }\n\t\t\t\n\t\t\tif((opt = miscParams->find(\"maxStencilBufferSize\")) != end)\n {\n mMaxStencilSize = Ogre::StringConverter::parseInt(opt->second);\n }\n\n\t\t\tif((opt = miscParams->find(\"minColourBufferSize\")) != end)\n {\n mMinBufferSize = Ogre::StringConverter::parseInt(opt->second);\n if (mMinBufferSize > mMaxBufferSize) mMinBufferSize = mMaxBufferSize;\n }\n\n\t\t\tif((opt = miscParams->find(\"MSAA\")) != end)\n {\n mMSAA = Ogre::StringConverter::parseInt(opt->second);\n }\n\t\t\t\n\t\t\tif((opt = miscParams->find(\"CSAA\")) != end)\n {\n mCSAA = Ogre::StringConverter::parseInt(opt->second);\n }\n }\n \n initNativeCreatedWindow(miscParams);\n \n if (mEglSurface)\n {\n mEglConfig = mGLSupport->getGLConfigFromDrawable (mEglSurface, &width, &height);\n }\n \n if (!mEglConfig && eglContext)\n {\n mEglConfig = mGLSupport->getGLConfigFromContext(eglContext);\n \n if (!mEglConfig)\n {\n \/\/ This should never happen.\n OGRE_EXCEPT(Exception::ERR_RENDERINGAPI_ERROR,\n \"Unexpected failure to determine a EGLFBConfig\",\n \"EGLWindow::create\");\n }\n }\n \n mIsExternal = (mEglSurface != 0);\n \n if (!mEglConfig)\n {\n\t\t\t_createInternalResources(mWindow, config);\n mHwGamma = false;\n }\n \n mContext = createEGLContext();\n mContext->setCurrent();\n\t\t \n eglQuerySurface(mEglDisplay, mEglSurface, EGL_WIDTH, (EGLint*)&mWidth);\n eglQuerySurface(mEglDisplay, mEglSurface, EGL_HEIGHT, (EGLint*)&mHeight);\n EGL_CHECK_ERROR\n\n\t\tmActive = true;\n\t\tmVisible = true;\n\t\tmClosed = false;\n\t}\n\n void AndroidEGLWindow::_destroyInternalResources()\n {\n GLES2RenderSystem::getResourceManager()->notifyOnContextLost();\n mContext->_destroyInternalResources();\n \n eglDestroySurface(mEglDisplay, mEglSurface);\n EGL_CHECK_ERROR\n \n eglTerminate(mEglDisplay);\n EGL_CHECK_ERROR\n \n mEglDisplay = 0;\n mEglSurface = 0;\n \n mActive = false;\n\t\tmVisible = false;\n mClosed = true;\n }\n \n void AndroidEGLWindow::_createInternalResources(NativeWindowType window, AConfiguration* config)\n {\n mWindow = window;\n \n int minAttribs[] = {\n EGL_RENDERABLE_TYPE, EGL_OPENGL_ES2_BIT,\n EGL_BUFFER_SIZE, mMinBufferSize,\n EGL_DEPTH_SIZE, 16,\n EGL_NONE\n };\n \n int maxAttribs[] = {\n EGL_RENDERABLE_TYPE, EGL_OPENGL_ES2_BIT,\n\t\t\tEGL_BUFFER_SIZE, mMaxBufferSize,\n EGL_DEPTH_SIZE, mMaxDepthSize,\n EGL_STENCIL_SIZE, mMaxStencilSize,\n EGL_NONE\n };\n\n\t\tbool bAASuccess = false;\n\t\tif (mCSAA)\n\t\t{\n\t\t\ttry\n\t\t\t{\n\t\t\t\tint CSAAminAttribs[] = {\n\t\t\t\t\tEGL_RENDERABLE_TYPE, EGL_OPENGL_ES2_BIT,\n\t\t\t\t\tEGL_BUFFER_SIZE, mMinBufferSize,\n\t\t\t\t\tEGL_DEPTH_SIZE, 16,\n\t\t\t\t\tEGL_COVERAGE_BUFFERS_NV, 1,\n\t\t\t\t\tEGL_COVERAGE_SAMPLES_NV, mCSAA,\n\t\t\t\t\tEGL_NONE\n\t\t\t\t};\n\t\t\t\tint CSAAmaxAttribs[] = {\n\t\t\t\t\tEGL_RENDERABLE_TYPE, EGL_OPENGL_ES2_BIT,\n\t\t\t\t\tEGL_BUFFER_SIZE, mMaxBufferSize,\n\t\t\t\t\tEGL_DEPTH_SIZE, mMaxDepthSize,\n\t\t\t\t\tEGL_STENCIL_SIZE, mMaxStencilSize,\n\t\t\t\t\tEGL_COVERAGE_BUFFERS_NV, 1,\n\t\t\t\t\tEGL_COVERAGE_SAMPLES_NV, mCSAA,\n\t\t\t\t\tEGL_NONE\n\t\t\t\t};\n\t\t\t\tmEglConfig = mGLSupport->selectGLConfig(CSAAminAttribs, CSAAmaxAttribs);\n\t\t\t\tbAASuccess = true;\n\t\t\t}\n\t\t\tcatch (Exception& e)\n\t\t\t{\n\t\t\t\tLogManager::getSingleton().logMessage(\"AndroidEGLWindow::_createInternalResources: setting CSAA failed\");\n\t\t\t}\n\t\t}\n\n\t\tif (mMSAA && !bAASuccess)\n\t\t{\n\t\t\ttry\n\t\t\t{\n\t\t\t\tint MSAAminAttribs[] = {\n\t\t\t\t\tEGL_RENDERABLE_TYPE, EGL_OPENGL_ES2_BIT,\n\t\t\t\t\tEGL_BUFFER_SIZE, mMinBufferSize,\n\t\t\t\t\tEGL_DEPTH_SIZE, 16,\n\t\t\t\t\tEGL_SAMPLE_BUFFERS, 1,\n\t\t\t\t\tEGL_SAMPLES, mMSAA,\n\t\t\t\t\tEGL_NONE\n\t\t\t\t};\n\t\t\t\tint MSAAmaxAttribs[] = {\n\t\t\t\t\tEGL_RENDERABLE_TYPE, EGL_OPENGL_ES2_BIT,\n\t\t\t\t\tEGL_BUFFER_SIZE, mMaxBufferSize,\n\t\t\t\t\tEGL_DEPTH_SIZE, mMaxDepthSize,\n\t\t\t\t\tEGL_STENCIL_SIZE, mMaxStencilSize,\n\t\t\t\t\tEGL_SAMPLE_BUFFERS, 1,\n\t\t\t\t\tEGL_SAMPLES, mMSAA,\n\t\t\t\t\tEGL_NONE\n\t\t\t\t};\n\t\t\t\tmEglConfig = mGLSupport->selectGLConfig(MSAAminAttribs, MSAAmaxAttribs);\n\t\t\t\tbAASuccess = true;\n\t\t\t}\n\t\t\tcatch (Exception& e)\n\t\t\t{\n\t\t\t\tLogManager::getSingleton().logMessage(\"AndroidEGLWindow::_createInternalResources: setting MSAA failed\");\n\t\t\t}\n\t\t}\n \n mEglDisplay = mGLSupport->getGLDisplay();\n if (!bAASuccess) mEglConfig = mGLSupport->selectGLConfig(minAttribs, maxAttribs);\n \n EGLint format;\n eglGetConfigAttrib(mEglDisplay, mEglConfig, EGL_NATIVE_VISUAL_ID, &format);\n EGL_CHECK_ERROR\n \n ANativeWindow_setBuffersGeometry(mWindow, 0, 0, format);\n \n mEglSurface = createSurfaceFromWindow(mEglDisplay, mWindow);\n \n if(config)\n {\n bool isLandscape = (int)AConfiguration_getOrientation(config) == 2;\n mGLSupport->setConfigOption(\"Orientation\", isLandscape ? \"Landscape\" : \"Portrait\");\n }\n \n if(mContext)\n {\n mActive = true;\n mVisible = true;\n mClosed = false;\n \n mContext->_createInternalResources(mEglDisplay, mEglConfig, mEglSurface, NULL);\n mContext->setCurrent();\n \n windowMovedOrResized();\n static_cast<GLES2RenderSystem*>(Ogre::Root::getSingletonPtr()->getRenderSystem())->resetRenderer(this);\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 \"OgreGLSLESLinkProgram.h\"\n#include \"OgreGLSLESExtSupport.h\"\n#include \"OgreGLSLESGpuProgram.h\"\n#include \"OgreGLSLESProgram.h\"\n#include \"OgreGLSLESLinkProgramManager.h\"\n#include \"OgreStringVector.h\"\n#include \"OgreLogManager.h\"\n#include \"OgreGpuProgramManager.h\"\n#include \"OgreStringConverter.h\"\n\nnamespace Ogre {\n\n\t\/\/-----------------------------------------------------------------------\n\tGLSLESLinkProgram::GLSLESLinkProgram(GLSLESGpuProgram* vertexProgram, GLSLESGpuProgram* fragmentProgram)\n : mVertexProgram(vertexProgram)\n\t\t, mFragmentProgram(fragmentProgram)\n\t\t, mUniformRefsBuilt(false)\n , mLinked(false)\n\t\t, mTriedToLinkAndFailed(false)\n\t{\n\t\t\/\/ init CustomAttributesIndexs\n\t\tfor(size_t i = 0 ; i < VES_COUNT; i++)\n\t\t\tfor(size_t j = 0 ; j < OGRE_MAX_TEXTURE_COORD_SETS; j++)\n\t\t{\n\t\t\tmCustomAttributesIndexes[i][j] = NULL_CUSTOM_ATTRIBUTES_INDEX;\n\t\t}\n \n if (!mVertexProgram && !mFragmentProgram)\n {\n OGRE_EXCEPT(Exception::ERR_RENDERINGAPI_ERROR,\n \"Attempted to create a shader program without both a vertex and fragment program.\",\n \"GLSLESLinkProgram::GLSLESLinkProgram\");\n }\n\t}\n\n\t\/\/-----------------------------------------------------------------------\n\tGLSLESLinkProgram::~GLSLESLinkProgram(void)\n\t{\n\t\tglDeleteProgram(mGLHandle);\n GL_CHECK_ERROR;\n\t}\n\n\t\/\/-----------------------------------------------------------------------\n\tOgre::String GLSLESLinkProgram::getCombinedName()\n\t{\n\t\tString name;\n\t\tif (mVertexProgram)\n\t\t{\n\t\t\tname += \"Vertex Program:\" ;\n\t\t\tname += mVertexProgram->getName();\n\t\t}\n\t\tif (mFragmentProgram)\n\t\t{\n\t\t\tname += \" Fragment Program:\" ;\n\t\t\tname += mFragmentProgram->getName();\n\t\t}\n\t\treturn name;\n\t}\n\t\/\/-----------------------------------------------------------------------\n\tvoid GLSLESLinkProgram::activate(void)\n\t{\n\t\tif (!mLinked && !mTriedToLinkAndFailed)\n\t\t{\n\t\t\tglGetError(); \/\/ Clean up the error. Otherwise will flood log.\n\t\t\tmGLHandle = glCreateProgram();\n\t\t\tGL_CHECK_ERROR\n\n\t\t\tif ( GpuProgramManager::getSingleton().canGetCompiledShaderBuffer() &&\n\t\t\t\tGpuProgramManager::getSingleton().isMicrocodeAvailableInCache(getCombinedName()) )\n\t\t\t{\n\t\t\t\tgetMicrocodeFromCache();\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\tcompileAndLink();\n\t\t\t}\n\n\t\t\tbuildGLUniformReferences();\n\t\t}\n\n\t\tif (mLinked)\n\t\t{\n GL_CHECK_ERROR\n glUseProgram( mGLHandle );\n GL_CHECK_ERROR\n\t\t}\n\t}\n\t\/\/-----------------------------------------------------------------------\n\tvoid GLSLESLinkProgram::getMicrocodeFromCache(void)\n\t{\n\t\tGpuProgramManager::Microcode cacheMicrocode = \n\t\t\tGpuProgramManager::getSingleton().getMicrocodeFromCache(getCombinedName());\n\n\t\t\/\/ add to the microcode to the cache\n\t\tString name;\n\t\tname = getCombinedName();\n\n\t\t\/\/ turns out we need this param when loading\n\t\tGLenum binaryFormat = 0;\n\n\t\tcacheMicrocode->seek(0);\n\n\t\t\/\/ get size of binary\n\t\tcacheMicrocode->read(&binaryFormat, sizeof(GLenum));\n\n#if GL_OES_get_program_binary\n\t\t\/\/ load binary\n\t\tglProgramBinaryOES( mGLHandle, \n\t\t\t\t\t\t\tbinaryFormat, \n\t\t\t\t\t\t\tcacheMicrocode->getPtr(),\n\t\t\t\t\t\t\tbinaryLength\n\t\t\t);\n#endif\n\t\tGLint success = 0;\n\t\tglGetProgramiv(mGLHandle, GL_LINK_STATUS, &success);\n\t\tif (!success)\n\t\t{\n\t\t\t\/\/\n\t\t\t\/\/ Something must have changed since the program binaries\n\t\t\t\/\/ were cached away. Fallback to source shader loading path,\n\t\t\t\/\/ and then retrieve and cache new program binaries once again.\n\t\t\t\/\/\n\t\t\tcompileAndLink();\n\t\t}\n\n\t}\n\n\t\/\/-----------------------------------------------------------------------\n\tvoid GLSLESLinkProgram::compileAndLink()\n\t{\n\t\t\/\/ compile and attach Vertex Program\n\t\tif (!mVertexProgram->getGLSLProgram()->compile(true))\n\t\t{\n\t\t\t\/\/ todo error\n\t\t\treturn;\n\t\t}\n mVertexProgram->getGLSLProgram()->attachToProgramObject(mGLHandle);\n setSkeletalAnimationIncluded(mVertexProgram->isSkeletalAnimationIncluded());\n \n\t\t\/\/ compile and attach Fragment Program\n\t\tif (!mFragmentProgram->getGLSLProgram()->compile(true))\n\t\t{\n\t\t\t\/\/ todo error\n\t\t\treturn;\n\t\t}\t\t\n mFragmentProgram->getGLSLProgram()->attachToProgramObject(mGLHandle);\n\n\t\t\/\/ the link\n\t\tglLinkProgram( mGLHandle );\n\t\tGL_CHECK_ERROR\n\t\t\tglGetProgramiv( mGLHandle, GL_LINK_STATUS, &mLinked );\n\t\tGL_CHECK_ERROR\n\t\n\t\tmTriedToLinkAndFailed = !mLinked;\n\n\t\tlogObjectInfo( getCombinedName() + String(\"GLSL link result : \"), mGLHandle );\n\t\tif(mLinked)\n\t\t{\n\t\t\tif ( GpuProgramManager::getSingleton().getSaveMicrocodesToCache() )\n\t\t\t{\n\t\t\t\t\/\/ add to the microcode to the cache\n\t\t\t\tString name;\n\t\t\t\tname = getCombinedName();\n\n\t\t\t\t\/\/ get buffer size\n\t\t\t\tGLint binaryLength = 0;\n#if GL_OES_get_program_binary\n\t\t\t\tglGetProgramiv(mGLHandle, GL_PROGRAM_BINARY_LENGTH_OES, &binaryLength);\n#endif\n\n \/\/ create microcode\n GpuProgramManager::Microcode newMicrocode = \n GpuProgramManager::getSingleton().createMicrocode(binaryLength + sizeof(GLenum));\n\n#if GL_OES_get_program_binary\n\t\t\t\t\/\/ get binary\n\t\t\t\tglGetProgramBinaryOES(mGLHandle, binaryLength, NULL, (GLenum *)newMicrocode->getPtr(), newMicrocode->getPtr() + sizeof(GLenum));\n#endif\n\n \t\t\/\/ add to the microcode to the cache\n\t\t\t\tGpuProgramManager::getSingleton().addMicrocodeToCache(name, newMicrocode);\n\t\t\t}\n\t\t}\n\t}\n\t\/\/-----------------------------------------------------------------------\n\tconst char * getAttributeSemanticString(VertexElementSemantic semantic)\n\t{\n\t\tswitch(semantic)\n\t\t{\n\t\t\tcase VES_POSITION:\n\t\t\t\treturn \"vertex\";\n\t\t\tcase VES_BLEND_WEIGHTS:\n\t\t\t\treturn \"blendWeights\";\n\t\t\tcase VES_NORMAL:\n\t\t\t\treturn \"normal\";\n\t\t\tcase VES_DIFFUSE:\n\t\t\t\treturn \"colour\";\n\t\t\tcase VES_SPECULAR:\n\t\t\t\treturn \"secondary_colour\";\n\t\t\tcase VES_BLEND_INDICES:\n\t\t\t\treturn \"blendIndices\";\n\t\t\tcase VES_TANGENT:\n\t\t\t\treturn \"tangent\";\n\t\t\tcase VES_BINORMAL:\n\t\t\t\treturn \"binormal\";\n\t\t\tcase VES_TEXTURE_COORDINATES:\n\t\t\t\treturn \"uv\";\n\t\t\tdefault:\n\t\t\t\tassert(false && \"Missing attribute!\");\n\t\t\t\treturn 0;\n\t\t};\n\n\t}\n\t\/\/-----------------------------------------------------------------------\n\tGLuint GLSLESLinkProgram::getAttributeIndex(VertexElementSemantic semantic, uint index)\n\t{\n\t\tGLint res = mCustomAttributesIndexes[semantic-1][index];\n\t\tif (res == NULL_CUSTOM_ATTRIBUTES_INDEX)\n\t\t{\n\t\t\tconst char * attString = getAttributeSemanticString(semantic);\n\t\t\tGLint attrib = glGetAttribLocation(mGLHandle, attString);\n\n\t\t\t\/\/ sadly position is a special case \n\t\t\tif (attrib == NOT_FOUND_CUSTOM_ATTRIBUTES_INDEX && semantic == VES_POSITION)\n\t\t\t{\n\t\t\t\tattrib = glGetAttribLocation(mGLHandle, \"position\");\n\t\t\t}\n\n\t\t\t\/\/ for uv and other case the index is a part of the name\n\t\t\tif (attrib == NOT_FOUND_CUSTOM_ATTRIBUTES_INDEX)\n\t\t\t{\n\t\t\t\tString attStringWithSemantic = String(attString) + StringConverter::toString(index);\n\t\t\t\tattrib = glGetAttribLocation(mGLHandle, attStringWithSemantic.c_str());\n\t\t\t}\n\n\t\t\t\/\/ update mCustomAttributesIndexes with the index we found (or didn't find) \n\t\t\tmCustomAttributesIndexes[semantic-1][index] = attrib;\n\t\t\tres = attrib;\n\t\t}\n\t\treturn (GLuint)res;\n\t}\n\t\/\/-----------------------------------------------------------------------\n\tbool GLSLESLinkProgram::isAttributeValid(VertexElementSemantic semantic, uint index)\n\t{\n\t\treturn (GLint)(getAttributeIndex(semantic, index)) != NOT_FOUND_CUSTOM_ATTRIBUTES_INDEX;\n\t}\n\t\/\/-----------------------------------------------------------------------\n\tvoid GLSLESLinkProgram::buildGLUniformReferences(void)\n\t{\n\t\tif (!mUniformRefsBuilt)\n\t\t{\n\t\t\tconst GpuConstantDefinitionMap* vertParams = 0;\n\t\t\tconst GpuConstantDefinitionMap* fragParams = 0;\n\t\t\tif (mVertexProgram)\n\t\t\t{\n\t\t\t\tvertParams = &(mVertexProgram->getGLSLProgram()->getConstantDefinitions().map);\n\t\t\t}\n\t\t\tif (mFragmentProgram)\n\t\t\t{\n\t\t\t\tfragParams = &(mFragmentProgram->getGLSLProgram()->getConstantDefinitions().map);\n\t\t\t}\n\n\t\t\tGLSLESLinkProgramManager::getSingleton().extractUniforms(\n\t\t\t\tmGLHandle, vertParams, fragParams, mGLUniformReferences);\n\n\t\t\tmUniformRefsBuilt = true;\n\t\t}\n\t}\n\n\t\/\/-----------------------------------------------------------------------\n\tvoid GLSLESLinkProgram::updateUniforms(GpuProgramParametersSharedPtr params, \n\t\tuint16 mask, GpuProgramType fromProgType)\n\t{\n\t\t\/\/ Iterate through uniform reference list and update uniform values\n\t\tGLUniformReferenceIterator currentUniform = mGLUniformReferences.begin();\n\t\tGLUniformReferenceIterator endUniform = mGLUniformReferences.end();\n\n\t\tfor (;currentUniform != endUniform; ++currentUniform)\n\t\t{\n\t\t\t\/\/ Only pull values from buffer it's supposed to be in (vertex or fragment)\n\t\t\t\/\/ This method will be called twice, once for vertex program params, \n\t\t\t\/\/ and once for fragment program params.\n\t\t\tif (fromProgType == currentUniform->mSourceProgType)\n\t\t\t{\n\t\t\t\tconst GpuConstantDefinition* def = currentUniform->mConstantDef;\n\t\t\t\tif (def->variability & mask)\n\t\t\t\t{\n\t\t\t\t\tGLsizei glArraySize = (GLsizei)def->arraySize;\n\n\t\t\t\t\t\/\/ Get the index in the parameter real list\n\t\t\t\t\tswitch (def->constType)\n\t\t\t\t\t{\n\t\t\t\t\tcase GCT_FLOAT1:\n\t\t\t\t\t\tglUniform1fv(currentUniform->mLocation, glArraySize, \n\t\t\t\t\t\t\tparams->getFloatPointer(def->physicalIndex));\n\t\t\t\t\t\tbreak;\n\t\t\t\t\tcase GCT_FLOAT2:\n\t\t\t\t\t\tglUniform2fv(currentUniform->mLocation, glArraySize, \n\t\t\t\t\t\t\tparams->getFloatPointer(def->physicalIndex));\n\t\t\t\t\t\tbreak;\n\t\t\t\t\tcase GCT_FLOAT3:\n\t\t\t\t\t\tglUniform3fv(currentUniform->mLocation, glArraySize, \n\t\t\t\t\t\t\tparams->getFloatPointer(def->physicalIndex));\n\t\t\t\t\t\tbreak;\n\t\t\t\t\tcase GCT_FLOAT4:\n\t\t\t\t\t\tglUniform4fv(currentUniform->mLocation, glArraySize, \n\t\t\t\t\t\t\tparams->getFloatPointer(def->physicalIndex));\n\t\t\t\t\t\tbreak;\n\t\t\t\t\tcase GCT_MATRIX_2X2:\n\t\t\t\t\t\tglUniformMatrix2fv(currentUniform->mLocation, glArraySize, \n\t\t\t\t\t\t\tGL_FALSE, params->getFloatPointer(def->physicalIndex));\n\t\t\t\t\t\tbreak;\n\t\t\t\t\tcase GCT_MATRIX_3X3:\n\t\t\t\t\t\tglUniformMatrix3fv(currentUniform->mLocation, glArraySize, \n\t\t\t\t\t\t\tGL_FALSE, params->getFloatPointer(def->physicalIndex));\n\t\t\t\t\t\tbreak;\n\t\t\t\t\tcase GCT_MATRIX_4X4:\n\t\t\t\t\t\tglUniformMatrix4fv(currentUniform->mLocation, glArraySize, \n\t\t\t\t\t\t\tGL_FALSE, params->getFloatPointer(def->physicalIndex));\n\t\t\t\t\t\tbreak;\n\t\t\t\t\tcase GCT_INT1:\n\t\t\t\t\t\tglUniform1iv(currentUniform->mLocation, glArraySize, \n\t\t\t\t\t\t\t(GLint*)params->getIntPointer(def->physicalIndex));\n\t\t\t\t\t\tbreak;\n\t\t\t\t\tcase GCT_INT2:\n\t\t\t\t\t\tglUniform2iv(currentUniform->mLocation, glArraySize, \n\t\t\t\t\t\t\t(GLint*)params->getIntPointer(def->physicalIndex));\n\t\t\t\t\t\tbreak;\n\t\t\t\t\tcase GCT_INT3:\n\t\t\t\t\t\tglUniform3iv(currentUniform->mLocation, glArraySize, \n\t\t\t\t\t\t\t(GLint*)params->getIntPointer(def->physicalIndex));\n\t\t\t\t\t\tbreak;\n\t\t\t\t\tcase GCT_INT4:\n\t\t\t\t\t\tglUniform4iv(currentUniform->mLocation, glArraySize, \n\t\t\t\t\t\t\t(GLint*)params->getIntPointer(def->physicalIndex));\n\t\t\t\t\t\tbreak;\n\t\t\t\t\tcase GCT_SAMPLER1D:\n\t\t\t\t\tcase GCT_SAMPLER1DSHADOW:\n\t\t\t\t\tcase GCT_SAMPLER2D:\n\t\t\t\t\tcase GCT_SAMPLER2DSHADOW:\n\t\t\t\t\tcase GCT_SAMPLER3D:\n\t\t\t\t\tcase GCT_SAMPLERCUBE:\n\t\t\t\t\t\t\/\/ Samplers handled like 1-element ints\n\t\t\t\t\t\tglUniform1iv(currentUniform->mLocation, 1, \n\t\t\t\t\t\t\t(GLint*)params->getIntPointer(def->physicalIndex));\n\t\t\t\t\t\tbreak;\n\t\t\t\t\tcase GCT_MATRIX_2X3:\n\t\t\t\t\tcase GCT_MATRIX_2X4:\n\t\t\t\t\tcase GCT_MATRIX_3X2:\n\t\t\t\t\tcase GCT_MATRIX_3X4:\n\t\t\t\t\tcase GCT_MATRIX_4X2:\n\t\t\t\t\tcase GCT_MATRIX_4X3:\n case GCT_UNKNOWN:\n break;\n\n\t\t\t\t\t} \/\/ End switch\n GL_CHECK_ERROR;\n\t\t\t\t} \/\/ Variability & mask\n\t\t\t} \/\/ fromProgType == currentUniform->mSourceProgType\n \n \t\t} \/\/ End for\n\t}\n\t\/\/-----------------------------------------------------------------------\n\tvoid GLSLESLinkProgram::updatePassIterationUniforms(GpuProgramParametersSharedPtr params)\n\t{\n\t\tif (params->hasPassIterationNumber())\n\t\t{\n\t\t\tsize_t index = params->getPassIterationNumberIndex();\n\n\t\t\tGLUniformReferenceIterator currentUniform = mGLUniformReferences.begin();\n\t\t\tGLUniformReferenceIterator endUniform = mGLUniformReferences.end();\n\n\t\t\t\/\/ Need to find the uniform that matches the multi pass entry\n\t\t\tfor (;currentUniform != endUniform; ++currentUniform)\n\t\t\t{\n\t\t\t\t\/\/ Get the index in the parameter real list\n\t\t\t\tif (index == currentUniform->mConstantDef->physicalIndex)\n\t\t\t\t{\n\t\t\t\t\tglUniform1fv(currentUniform->mLocation, 1, params->getFloatPointer(index));\n GL_CHECK_ERROR;\n\t\t\t\t\t\/\/ There will only be one multipass entry\n\t\t\t\t\treturn;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n }\n} \/\/ namespace Ogre\n<commit_msg>GLES2 render system: Added a var init that was missing (binaryLength in GLSLESLinkProgram::getMicrocodeFromCache).<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 \"OgreGLSLESLinkProgram.h\"\n#include \"OgreGLSLESExtSupport.h\"\n#include \"OgreGLSLESGpuProgram.h\"\n#include \"OgreGLSLESProgram.h\"\n#include \"OgreGLSLESLinkProgramManager.h\"\n#include \"OgreStringVector.h\"\n#include \"OgreLogManager.h\"\n#include \"OgreGpuProgramManager.h\"\n#include \"OgreStringConverter.h\"\n\nnamespace Ogre {\n\n\t\/\/-----------------------------------------------------------------------\n\tGLSLESLinkProgram::GLSLESLinkProgram(GLSLESGpuProgram* vertexProgram, GLSLESGpuProgram* fragmentProgram)\n : mVertexProgram(vertexProgram)\n\t\t, mFragmentProgram(fragmentProgram)\n\t\t, mUniformRefsBuilt(false)\n , mLinked(false)\n\t\t, mTriedToLinkAndFailed(false)\n\t{\n\t\t\/\/ init CustomAttributesIndexs\n\t\tfor(size_t i = 0 ; i < VES_COUNT; i++)\n\t\t\tfor(size_t j = 0 ; j < OGRE_MAX_TEXTURE_COORD_SETS; j++)\n\t\t{\n\t\t\tmCustomAttributesIndexes[i][j] = NULL_CUSTOM_ATTRIBUTES_INDEX;\n\t\t}\n \n if (!mVertexProgram && !mFragmentProgram)\n {\n OGRE_EXCEPT(Exception::ERR_RENDERINGAPI_ERROR,\n \"Attempted to create a shader program without both a vertex and fragment program.\",\n \"GLSLESLinkProgram::GLSLESLinkProgram\");\n }\n\t}\n\n\t\/\/-----------------------------------------------------------------------\n\tGLSLESLinkProgram::~GLSLESLinkProgram(void)\n\t{\n\t\tglDeleteProgram(mGLHandle);\n GL_CHECK_ERROR;\n\t}\n\n\t\/\/-----------------------------------------------------------------------\n\tOgre::String GLSLESLinkProgram::getCombinedName()\n\t{\n\t\tString name;\n\t\tif (mVertexProgram)\n\t\t{\n\t\t\tname += \"Vertex Program:\" ;\n\t\t\tname += mVertexProgram->getName();\n\t\t}\n\t\tif (mFragmentProgram)\n\t\t{\n\t\t\tname += \" Fragment Program:\" ;\n\t\t\tname += mFragmentProgram->getName();\n\t\t}\n\t\treturn name;\n\t}\n\t\/\/-----------------------------------------------------------------------\n\tvoid GLSLESLinkProgram::activate(void)\n\t{\n\t\tif (!mLinked && !mTriedToLinkAndFailed)\n\t\t{\n\t\t\tglGetError(); \/\/ Clean up the error. Otherwise will flood log.\n\t\t\tmGLHandle = glCreateProgram();\n\t\t\tGL_CHECK_ERROR\n\n\t\t\tif ( GpuProgramManager::getSingleton().canGetCompiledShaderBuffer() &&\n\t\t\t\tGpuProgramManager::getSingleton().isMicrocodeAvailableInCache(getCombinedName()) )\n\t\t\t{\n\t\t\t\tgetMicrocodeFromCache();\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\tcompileAndLink();\n\t\t\t}\n\n\t\t\tbuildGLUniformReferences();\n\t\t}\n\n\t\tif (mLinked)\n\t\t{\n GL_CHECK_ERROR\n glUseProgram( mGLHandle );\n GL_CHECK_ERROR\n\t\t}\n\t}\n\t\/\/-----------------------------------------------------------------------\n\tvoid GLSLESLinkProgram::getMicrocodeFromCache(void)\n\t{\n\t\tGpuProgramManager::Microcode cacheMicrocode = \n\t\t\tGpuProgramManager::getSingleton().getMicrocodeFromCache(getCombinedName());\n\n\t\t\/\/ add to the microcode to the cache\n\t\tString name;\n\t\tname = getCombinedName();\n\n\t\t\/\/ turns out we need this param when loading\n\t\tGLenum binaryFormat = 0;\n\n\t\tcacheMicrocode->seek(0);\n\n\t\t\/\/ get size of binary\n\t\tcacheMicrocode->read(&binaryFormat, sizeof(GLenum));\n\n GLint binaryLength = cacheMicrocode->size() - sizeof(GLenum);\n\n#if GL_OES_get_program_binary\n\t\t\/\/ load binary\n\t\tglProgramBinaryOES( mGLHandle, \n\t\t\t\t\t\t\tbinaryFormat, \n\t\t\t\t\t\t\tcacheMicrocode->getPtr(),\n\t\t\t\t\t\t\tbinaryLength\n\t\t\t);\n#endif\n\t\tGLint success = 0;\n\t\tglGetProgramiv(mGLHandle, GL_LINK_STATUS, &success);\n\t\tif (!success)\n\t\t{\n\t\t\t\/\/\n\t\t\t\/\/ Something must have changed since the program binaries\n\t\t\t\/\/ were cached away. Fallback to source shader loading path,\n\t\t\t\/\/ and then retrieve and cache new program binaries once again.\n\t\t\t\/\/\n\t\t\tcompileAndLink();\n\t\t}\n\n\t}\n\n\t\/\/-----------------------------------------------------------------------\n\tvoid GLSLESLinkProgram::compileAndLink()\n\t{\n\t\t\/\/ compile and attach Vertex Program\n\t\tif (!mVertexProgram->getGLSLProgram()->compile(true))\n\t\t{\n\t\t\t\/\/ todo error\n\t\t\treturn;\n\t\t}\n mVertexProgram->getGLSLProgram()->attachToProgramObject(mGLHandle);\n setSkeletalAnimationIncluded(mVertexProgram->isSkeletalAnimationIncluded());\n \n\t\t\/\/ compile and attach Fragment Program\n\t\tif (!mFragmentProgram->getGLSLProgram()->compile(true))\n\t\t{\n\t\t\t\/\/ todo error\n\t\t\treturn;\n\t\t}\t\t\n mFragmentProgram->getGLSLProgram()->attachToProgramObject(mGLHandle);\n\n\t\t\/\/ the link\n\t\tglLinkProgram( mGLHandle );\n\t\tGL_CHECK_ERROR\n\t\t\tglGetProgramiv( mGLHandle, GL_LINK_STATUS, &mLinked );\n\t\tGL_CHECK_ERROR\n\t\n\t\tmTriedToLinkAndFailed = !mLinked;\n\n\t\tlogObjectInfo( getCombinedName() + String(\"GLSL link result : \"), mGLHandle );\n\t\tif(mLinked)\n\t\t{\n\t\t\tif ( GpuProgramManager::getSingleton().getSaveMicrocodesToCache() )\n\t\t\t{\n\t\t\t\t\/\/ add to the microcode to the cache\n\t\t\t\tString name;\n\t\t\t\tname = getCombinedName();\n\n\t\t\t\t\/\/ get buffer size\n\t\t\t\tGLint binaryLength = 0;\n#if GL_OES_get_program_binary\n\t\t\t\tglGetProgramiv(mGLHandle, GL_PROGRAM_BINARY_LENGTH_OES, &binaryLength);\n#endif\n\n \/\/ create microcode\n GpuProgramManager::Microcode newMicrocode = \n GpuProgramManager::getSingleton().createMicrocode(binaryLength + sizeof(GLenum));\n\n#if GL_OES_get_program_binary\n\t\t\t\t\/\/ get binary\n\t\t\t\tglGetProgramBinaryOES(mGLHandle, binaryLength, NULL, (GLenum *)newMicrocode->getPtr(), newMicrocode->getPtr() + sizeof(GLenum));\n#endif\n\n \t\t\/\/ add to the microcode to the cache\n\t\t\t\tGpuProgramManager::getSingleton().addMicrocodeToCache(name, newMicrocode);\n\t\t\t}\n\t\t}\n\t}\n\t\/\/-----------------------------------------------------------------------\n\tconst char * getAttributeSemanticString(VertexElementSemantic semantic)\n\t{\n\t\tswitch(semantic)\n\t\t{\n\t\t\tcase VES_POSITION:\n\t\t\t\treturn \"vertex\";\n\t\t\tcase VES_BLEND_WEIGHTS:\n\t\t\t\treturn \"blendWeights\";\n\t\t\tcase VES_NORMAL:\n\t\t\t\treturn \"normal\";\n\t\t\tcase VES_DIFFUSE:\n\t\t\t\treturn \"colour\";\n\t\t\tcase VES_SPECULAR:\n\t\t\t\treturn \"secondary_colour\";\n\t\t\tcase VES_BLEND_INDICES:\n\t\t\t\treturn \"blendIndices\";\n\t\t\tcase VES_TANGENT:\n\t\t\t\treturn \"tangent\";\n\t\t\tcase VES_BINORMAL:\n\t\t\t\treturn \"binormal\";\n\t\t\tcase VES_TEXTURE_COORDINATES:\n\t\t\t\treturn \"uv\";\n\t\t\tdefault:\n\t\t\t\tassert(false && \"Missing attribute!\");\n\t\t\t\treturn 0;\n\t\t};\n\n\t}\n\t\/\/-----------------------------------------------------------------------\n\tGLuint GLSLESLinkProgram::getAttributeIndex(VertexElementSemantic semantic, uint index)\n\t{\n\t\tGLint res = mCustomAttributesIndexes[semantic-1][index];\n\t\tif (res == NULL_CUSTOM_ATTRIBUTES_INDEX)\n\t\t{\n\t\t\tconst char * attString = getAttributeSemanticString(semantic);\n\t\t\tGLint attrib = glGetAttribLocation(mGLHandle, attString);\n\n\t\t\t\/\/ sadly position is a special case \n\t\t\tif (attrib == NOT_FOUND_CUSTOM_ATTRIBUTES_INDEX && semantic == VES_POSITION)\n\t\t\t{\n\t\t\t\tattrib = glGetAttribLocation(mGLHandle, \"position\");\n\t\t\t}\n\n\t\t\t\/\/ for uv and other case the index is a part of the name\n\t\t\tif (attrib == NOT_FOUND_CUSTOM_ATTRIBUTES_INDEX)\n\t\t\t{\n\t\t\t\tString attStringWithSemantic = String(attString) + StringConverter::toString(index);\n\t\t\t\tattrib = glGetAttribLocation(mGLHandle, attStringWithSemantic.c_str());\n\t\t\t}\n\n\t\t\t\/\/ update mCustomAttributesIndexes with the index we found (or didn't find) \n\t\t\tmCustomAttributesIndexes[semantic-1][index] = attrib;\n\t\t\tres = attrib;\n\t\t}\n\t\treturn (GLuint)res;\n\t}\n\t\/\/-----------------------------------------------------------------------\n\tbool GLSLESLinkProgram::isAttributeValid(VertexElementSemantic semantic, uint index)\n\t{\n\t\treturn (GLint)(getAttributeIndex(semantic, index)) != NOT_FOUND_CUSTOM_ATTRIBUTES_INDEX;\n\t}\n\t\/\/-----------------------------------------------------------------------\n\tvoid GLSLESLinkProgram::buildGLUniformReferences(void)\n\t{\n\t\tif (!mUniformRefsBuilt)\n\t\t{\n\t\t\tconst GpuConstantDefinitionMap* vertParams = 0;\n\t\t\tconst GpuConstantDefinitionMap* fragParams = 0;\n\t\t\tif (mVertexProgram)\n\t\t\t{\n\t\t\t\tvertParams = &(mVertexProgram->getGLSLProgram()->getConstantDefinitions().map);\n\t\t\t}\n\t\t\tif (mFragmentProgram)\n\t\t\t{\n\t\t\t\tfragParams = &(mFragmentProgram->getGLSLProgram()->getConstantDefinitions().map);\n\t\t\t}\n\n\t\t\tGLSLESLinkProgramManager::getSingleton().extractUniforms(\n\t\t\t\tmGLHandle, vertParams, fragParams, mGLUniformReferences);\n\n\t\t\tmUniformRefsBuilt = true;\n\t\t}\n\t}\n\n\t\/\/-----------------------------------------------------------------------\n\tvoid GLSLESLinkProgram::updateUniforms(GpuProgramParametersSharedPtr params, \n\t\tuint16 mask, GpuProgramType fromProgType)\n\t{\n\t\t\/\/ Iterate through uniform reference list and update uniform values\n\t\tGLUniformReferenceIterator currentUniform = mGLUniformReferences.begin();\n\t\tGLUniformReferenceIterator endUniform = mGLUniformReferences.end();\n\n\t\tfor (;currentUniform != endUniform; ++currentUniform)\n\t\t{\n\t\t\t\/\/ Only pull values from buffer it's supposed to be in (vertex or fragment)\n\t\t\t\/\/ This method will be called twice, once for vertex program params, \n\t\t\t\/\/ and once for fragment program params.\n\t\t\tif (fromProgType == currentUniform->mSourceProgType)\n\t\t\t{\n\t\t\t\tconst GpuConstantDefinition* def = currentUniform->mConstantDef;\n\t\t\t\tif (def->variability & mask)\n\t\t\t\t{\n\t\t\t\t\tGLsizei glArraySize = (GLsizei)def->arraySize;\n\n\t\t\t\t\t\/\/ Get the index in the parameter real list\n\t\t\t\t\tswitch (def->constType)\n\t\t\t\t\t{\n\t\t\t\t\tcase GCT_FLOAT1:\n\t\t\t\t\t\tglUniform1fv(currentUniform->mLocation, glArraySize, \n\t\t\t\t\t\t\tparams->getFloatPointer(def->physicalIndex));\n\t\t\t\t\t\tbreak;\n\t\t\t\t\tcase GCT_FLOAT2:\n\t\t\t\t\t\tglUniform2fv(currentUniform->mLocation, glArraySize, \n\t\t\t\t\t\t\tparams->getFloatPointer(def->physicalIndex));\n\t\t\t\t\t\tbreak;\n\t\t\t\t\tcase GCT_FLOAT3:\n\t\t\t\t\t\tglUniform3fv(currentUniform->mLocation, glArraySize, \n\t\t\t\t\t\t\tparams->getFloatPointer(def->physicalIndex));\n\t\t\t\t\t\tbreak;\n\t\t\t\t\tcase GCT_FLOAT4:\n\t\t\t\t\t\tglUniform4fv(currentUniform->mLocation, glArraySize, \n\t\t\t\t\t\t\tparams->getFloatPointer(def->physicalIndex));\n\t\t\t\t\t\tbreak;\n\t\t\t\t\tcase GCT_MATRIX_2X2:\n\t\t\t\t\t\tglUniformMatrix2fv(currentUniform->mLocation, glArraySize, \n\t\t\t\t\t\t\tGL_FALSE, params->getFloatPointer(def->physicalIndex));\n\t\t\t\t\t\tbreak;\n\t\t\t\t\tcase GCT_MATRIX_3X3:\n\t\t\t\t\t\tglUniformMatrix3fv(currentUniform->mLocation, glArraySize, \n\t\t\t\t\t\t\tGL_FALSE, params->getFloatPointer(def->physicalIndex));\n\t\t\t\t\t\tbreak;\n\t\t\t\t\tcase GCT_MATRIX_4X4:\n\t\t\t\t\t\tglUniformMatrix4fv(currentUniform->mLocation, glArraySize, \n\t\t\t\t\t\t\tGL_FALSE, params->getFloatPointer(def->physicalIndex));\n\t\t\t\t\t\tbreak;\n\t\t\t\t\tcase GCT_INT1:\n\t\t\t\t\t\tglUniform1iv(currentUniform->mLocation, glArraySize, \n\t\t\t\t\t\t\t(GLint*)params->getIntPointer(def->physicalIndex));\n\t\t\t\t\t\tbreak;\n\t\t\t\t\tcase GCT_INT2:\n\t\t\t\t\t\tglUniform2iv(currentUniform->mLocation, glArraySize, \n\t\t\t\t\t\t\t(GLint*)params->getIntPointer(def->physicalIndex));\n\t\t\t\t\t\tbreak;\n\t\t\t\t\tcase GCT_INT3:\n\t\t\t\t\t\tglUniform3iv(currentUniform->mLocation, glArraySize, \n\t\t\t\t\t\t\t(GLint*)params->getIntPointer(def->physicalIndex));\n\t\t\t\t\t\tbreak;\n\t\t\t\t\tcase GCT_INT4:\n\t\t\t\t\t\tglUniform4iv(currentUniform->mLocation, glArraySize, \n\t\t\t\t\t\t\t(GLint*)params->getIntPointer(def->physicalIndex));\n\t\t\t\t\t\tbreak;\n\t\t\t\t\tcase GCT_SAMPLER1D:\n\t\t\t\t\tcase GCT_SAMPLER1DSHADOW:\n\t\t\t\t\tcase GCT_SAMPLER2D:\n\t\t\t\t\tcase GCT_SAMPLER2DSHADOW:\n\t\t\t\t\tcase GCT_SAMPLER3D:\n\t\t\t\t\tcase GCT_SAMPLERCUBE:\n\t\t\t\t\t\t\/\/ Samplers handled like 1-element ints\n\t\t\t\t\t\tglUniform1iv(currentUniform->mLocation, 1, \n\t\t\t\t\t\t\t(GLint*)params->getIntPointer(def->physicalIndex));\n\t\t\t\t\t\tbreak;\n\t\t\t\t\tcase GCT_MATRIX_2X3:\n\t\t\t\t\tcase GCT_MATRIX_2X4:\n\t\t\t\t\tcase GCT_MATRIX_3X2:\n\t\t\t\t\tcase GCT_MATRIX_3X4:\n\t\t\t\t\tcase GCT_MATRIX_4X2:\n\t\t\t\t\tcase GCT_MATRIX_4X3:\n case GCT_UNKNOWN:\n break;\n\n\t\t\t\t\t} \/\/ End switch\n GL_CHECK_ERROR;\n\t\t\t\t} \/\/ Variability & mask\n\t\t\t} \/\/ fromProgType == currentUniform->mSourceProgType\n \n \t\t} \/\/ End for\n\t}\n\t\/\/-----------------------------------------------------------------------\n\tvoid GLSLESLinkProgram::updatePassIterationUniforms(GpuProgramParametersSharedPtr params)\n\t{\n\t\tif (params->hasPassIterationNumber())\n\t\t{\n\t\t\tsize_t index = params->getPassIterationNumberIndex();\n\n\t\t\tGLUniformReferenceIterator currentUniform = mGLUniformReferences.begin();\n\t\t\tGLUniformReferenceIterator endUniform = mGLUniformReferences.end();\n\n\t\t\t\/\/ Need to find the uniform that matches the multi pass entry\n\t\t\tfor (;currentUniform != endUniform; ++currentUniform)\n\t\t\t{\n\t\t\t\t\/\/ Get the index in the parameter real list\n\t\t\t\tif (index == currentUniform->mConstantDef->physicalIndex)\n\t\t\t\t{\n\t\t\t\t\tglUniform1fv(currentUniform->mLocation, 1, params->getFloatPointer(index));\n GL_CHECK_ERROR;\n\t\t\t\t\t\/\/ There will only be one multipass entry\n\t\t\t\t\treturn;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n }\n} \/\/ namespace Ogre\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 \"stopwatch.hxx\"\n#include \"pool.hxx\"\n#include \"net\/SocketDescriptor.hxx\"\n#include \"net\/StaticSocketAddress.hxx\"\n#include \"net\/ToString.hxx\"\n#include \"util\/StaticArray.hxx\"\n#include \"util\/WritableBuffer.hxx\"\n\n#include <daemon\/log.h>\n\n#include <chrono>\n\n#include <time.h>\n#include <assert.h>\n#include <string.h>\n#include <sys\/resource.h>\n\nenum {\n STOPWATCH_VERBOSE = 3,\n};\n\nstruct StopwatchEvent {\n const char *name;\n\n std::chrono::steady_clock::time_point time;\n\n void Init(const char *_name) {\n name = _name;\n time = std::chrono::steady_clock::now();\n }\n};\n\nstruct Stopwatch {\n struct pool *pool;\n\n#ifndef NDEBUG\n struct pool_notify_state pool_notify;\n#endif\n\n const char *const name;\n\n StaticArray<StopwatchEvent, 16> events;\n\n \/**\n * Our own resource usage, measured when the stopwatch was\n * started.\n *\/\n struct rusage self;\n\n Stopwatch(struct pool &_pool, const char *_name)\n :pool(&_pool), name(_name) {\n ::pool_notify(pool, &pool_notify);\n\n events.append().Init(name);\n\n getrusage(RUSAGE_SELF, &self);\n }\n};\n\nstatic bool stopwatch_enabled;\n\nvoid\nstopwatch_enable()\n{\n assert(!stopwatch_enabled);\n\n stopwatch_enabled = true;\n}\n\nbool\nstopwatch_is_enabled()\n{\n return stopwatch_enabled && daemon_log_config.verbose >= STOPWATCH_VERBOSE;\n}\n\nStopwatch *\nstopwatch_new(struct pool *pool, const char *name, const char *suffix)\n{\n if (!stopwatch_enabled || daemon_log_config.verbose < STOPWATCH_VERBOSE)\n return nullptr;\n\n if (suffix == nullptr)\n name = p_strdup(pool, name);\n else\n name = p_strcat(pool, name, suffix, nullptr);\n\n constexpr size_t MAX_NAME = 96;\n if (strlen(name) > MAX_NAME)\n name = p_strndup(pool, name, MAX_NAME);\n\n return NewFromPool<Stopwatch>(*pool, *pool, name);\n}\n\nStopwatch *\nstopwatch_new(struct pool *pool, SocketAddress address, const char *suffix)\n{\n char buffer[1024];\n\n if (!stopwatch_enabled || daemon_log_config.verbose < STOPWATCH_VERBOSE)\n return nullptr;\n\n const char *name = ToString(buffer, sizeof(buffer), address)\n ? buffer\n : \"unknown\";\n\n return stopwatch_new(pool, name, suffix);\n}\n\nStopwatch *\nstopwatch_new(struct pool *pool, SocketDescriptor fd, const char *suffix)\n{\n if (!stopwatch_enabled || daemon_log_config.verbose < STOPWATCH_VERBOSE)\n return nullptr;\n\n const auto address = fd.GetPeerAddress();\n return address.IsDefined()\n ? stopwatch_new(pool, address, suffix)\n : stopwatch_new(pool, \"unknown\", suffix);\n}\n\nvoid\nstopwatch_event(Stopwatch *stopwatch, const char *name)\n{\n if (!stopwatch_enabled || daemon_log_config.verbose < STOPWATCH_VERBOSE)\n return;\n\n assert(stopwatch != nullptr);\n assert(name != nullptr);\n\n if (stopwatch->events.full())\n \/* array is full, do not record any more events *\/\n return;\n\n stopwatch->events.append().Init(name);\n}\n\nstatic constexpr long\nToLongMs(std::chrono::steady_clock::duration d)\n{\n return std::chrono::duration_cast<std::chrono::milliseconds>(d).count();\n}\n\nstatic long\ntimeval_diff_ms(const struct timeval *a, const struct timeval *b)\n{\n return (a->tv_sec - b->tv_sec) * 1000 +\n (a->tv_usec - b->tv_usec) \/ 1000;\n}\n\ntemplate<typename... Args>\nstatic void\nAppendFormat(WritableBuffer<char> &buffer, const char *fmt, Args&&... args)\n{\n int r = snprintf(buffer.data, buffer.size, fmt, args...);\n if (r > 0)\n buffer.skip_front(std::min(size_t(r), buffer.size - 1));\n}\n\nvoid\nstopwatch_dump(const Stopwatch *stopwatch)\n{\n struct rusage self;\n\n if (!stopwatch_enabled || daemon_log_config.verbose < STOPWATCH_VERBOSE)\n return;\n\n assert(stopwatch != nullptr);\n assert(!stopwatch->events.empty());\n\n if (stopwatch->events.size() < 2)\n \/* nothing was recorded (except for the initial event) *\/\n return;\n\n char message[1024];\n\n WritableBuffer<char> b(message, sizeof(message));\n AppendFormat(b, \"stopwatch[%s]:\", stopwatch->name);\n\n for (const auto &i : stopwatch->events)\n AppendFormat(b, \" %s=%ldms\",\n i.name,\n ToLongMs(i.time - stopwatch->events.front().time));\n\n getrusage(RUSAGE_SELF, &self);\n AppendFormat(b, \" (beng-proxy=%ld+%ldms)\",\n timeval_diff_ms(&self.ru_utime,\n &stopwatch->self.ru_utime),\n timeval_diff_ms(&self.ru_stime,\n &stopwatch->self.ru_stime));\n\n daemon_log(STOPWATCH_VERBOSE, \"%s\\n\", message);\n}\n<commit_msg>stopwatch: use stopwatch_is_enabled() internally<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 \"stopwatch.hxx\"\n#include \"pool.hxx\"\n#include \"net\/SocketDescriptor.hxx\"\n#include \"net\/StaticSocketAddress.hxx\"\n#include \"net\/ToString.hxx\"\n#include \"util\/StaticArray.hxx\"\n#include \"util\/WritableBuffer.hxx\"\n\n#include <daemon\/log.h>\n\n#include <chrono>\n\n#include <time.h>\n#include <assert.h>\n#include <string.h>\n#include <sys\/resource.h>\n\nenum {\n STOPWATCH_VERBOSE = 3,\n};\n\nstruct StopwatchEvent {\n const char *name;\n\n std::chrono::steady_clock::time_point time;\n\n void Init(const char *_name) {\n name = _name;\n time = std::chrono::steady_clock::now();\n }\n};\n\nstruct Stopwatch {\n struct pool *pool;\n\n#ifndef NDEBUG\n struct pool_notify_state pool_notify;\n#endif\n\n const char *const name;\n\n StaticArray<StopwatchEvent, 16> events;\n\n \/**\n * Our own resource usage, measured when the stopwatch was\n * started.\n *\/\n struct rusage self;\n\n Stopwatch(struct pool &_pool, const char *_name)\n :pool(&_pool), name(_name) {\n ::pool_notify(pool, &pool_notify);\n\n events.append().Init(name);\n\n getrusage(RUSAGE_SELF, &self);\n }\n};\n\nstatic bool stopwatch_enabled;\n\nvoid\nstopwatch_enable()\n{\n assert(!stopwatch_enabled);\n\n stopwatch_enabled = true;\n}\n\nbool\nstopwatch_is_enabled()\n{\n return stopwatch_enabled && daemon_log_config.verbose >= STOPWATCH_VERBOSE;\n}\n\nStopwatch *\nstopwatch_new(struct pool *pool, const char *name, const char *suffix)\n{\n if (!stopwatch_is_enabled())\n return nullptr;\n\n if (suffix == nullptr)\n name = p_strdup(pool, name);\n else\n name = p_strcat(pool, name, suffix, nullptr);\n\n constexpr size_t MAX_NAME = 96;\n if (strlen(name) > MAX_NAME)\n name = p_strndup(pool, name, MAX_NAME);\n\n return NewFromPool<Stopwatch>(*pool, *pool, name);\n}\n\nStopwatch *\nstopwatch_new(struct pool *pool, SocketAddress address, const char *suffix)\n{\n char buffer[1024];\n\n if (!stopwatch_is_enabled())\n return nullptr;\n\n const char *name = ToString(buffer, sizeof(buffer), address)\n ? buffer\n : \"unknown\";\n\n return stopwatch_new(pool, name, suffix);\n}\n\nStopwatch *\nstopwatch_new(struct pool *pool, SocketDescriptor fd, const char *suffix)\n{\n if (!stopwatch_is_enabled())\n return nullptr;\n\n const auto address = fd.GetPeerAddress();\n return address.IsDefined()\n ? stopwatch_new(pool, address, suffix)\n : stopwatch_new(pool, \"unknown\", suffix);\n}\n\nvoid\nstopwatch_event(Stopwatch *stopwatch, const char *name)\n{\n if (!stopwatch_is_enabled())\n return;\n\n assert(stopwatch != nullptr);\n assert(name != nullptr);\n\n if (stopwatch->events.full())\n \/* array is full, do not record any more events *\/\n return;\n\n stopwatch->events.append().Init(name);\n}\n\nstatic constexpr long\nToLongMs(std::chrono::steady_clock::duration d)\n{\n return std::chrono::duration_cast<std::chrono::milliseconds>(d).count();\n}\n\nstatic long\ntimeval_diff_ms(const struct timeval *a, const struct timeval *b)\n{\n return (a->tv_sec - b->tv_sec) * 1000 +\n (a->tv_usec - b->tv_usec) \/ 1000;\n}\n\ntemplate<typename... Args>\nstatic void\nAppendFormat(WritableBuffer<char> &buffer, const char *fmt, Args&&... args)\n{\n int r = snprintf(buffer.data, buffer.size, fmt, args...);\n if (r > 0)\n buffer.skip_front(std::min(size_t(r), buffer.size - 1));\n}\n\nvoid\nstopwatch_dump(const Stopwatch *stopwatch)\n{\n struct rusage self;\n\n if (!stopwatch_is_enabled())\n return;\n\n assert(stopwatch != nullptr);\n assert(!stopwatch->events.empty());\n\n if (stopwatch->events.size() < 2)\n \/* nothing was recorded (except for the initial event) *\/\n return;\n\n char message[1024];\n\n WritableBuffer<char> b(message, sizeof(message));\n AppendFormat(b, \"stopwatch[%s]:\", stopwatch->name);\n\n for (const auto &i : stopwatch->events)\n AppendFormat(b, \" %s=%ldms\",\n i.name,\n ToLongMs(i.time - stopwatch->events.front().time));\n\n getrusage(RUSAGE_SELF, &self);\n AppendFormat(b, \" (beng-proxy=%ld+%ldms)\",\n timeval_diff_ms(&self.ru_utime,\n &stopwatch->self.ru_utime),\n timeval_diff_ms(&self.ru_stime,\n &stopwatch->self.ru_stime));\n\n daemon_log(STOPWATCH_VERBOSE, \"%s\\n\", message);\n}\n<|endoftext|>"} {"text":"<commit_before>#include \"choiceview.h\"\n\n#include <QKeyEvent>\n#include <QPaintEvent>\n#include <QPainter>\n\nChoice::Choice(const QString &title, const QString &id, const QStringList ¶ms)\n : _id(id), _title(title), _params(params) {\n}\n\nconst QString &Choice::id() const {\n return _id;\n}\n\nconst QString &Choice::title() const {\n return _title;\n}\n\nconst QStringList &Choice::params() const {\n return _params;\n}\n\nChoiceView::ChoiceView(QWidget *parent)\n : QWidget(parent),\n _offset(0) {\n\n setFocusPolicy(Qt::StrongFocus);\n setFont(QFont(\"Liberation Serif\", 20));\n}\n\nChoiceView::~ChoiceView() { }\n\nstatic const int arrowHeight = 8;\n\nstatic char _hotkeys[] = { '1', '2', '3', '4', '5', '6', '7', '8', '9', '0' };\nvoid ChoiceView::paintEvent(QPaintEvent *event) {\n QFontMetrics metrics(font());\n QPainter painter(this);\n\n int y = arrowHeight + 2;\n const int baseline = metrics.leading() + metrics.ascent() + 1;\n const int w = width(), h = height() - (y * 2);\n const int yInc = h \/ 10;\n const int labelWidth = w - yInc - 10;\n const int hotkeyCenter = w - (yInc \/ 2);\n\n \/\/ Top arrow\n const int center = w \/ 2;\n painter.eraseRect(0, 0, w, y);\n if (_offset > 0) {\n painter.drawLine(center, 0, center - arrowHeight, arrowHeight);\n painter.drawLine(center, 0, center + arrowHeight, arrowHeight);\n painter.drawLine(center - arrowHeight, arrowHeight, center + arrowHeight, arrowHeight);\n }\n \n \/\/ Bottom arrow\n painter.eraseRect(0, height() - y, w, y);\n if (_offset + 10 < _choices.size()) {\n painter.drawLine(center, height() - 1, center - arrowHeight, height() - arrowHeight - 1);\n painter.drawLine(center, height() - 1, center + arrowHeight, height() - arrowHeight - 1);\n painter.drawLine(center - arrowHeight, height() - arrowHeight - 1,\n center + arrowHeight, height() - arrowHeight - 1);\n }\n \n \/\/ Choice area\n for (int row = 0; row < NUM_CHOICES; row++) {\n const int item = row + _offset;\n painter.eraseRect(0, y, w, yInc);\n if (item < _choices.size()) {\n const Choice &c = _choices[item];\n painter.drawText(0, y + baseline,\n metrics.elidedText(c.title(), Qt::ElideMiddle, labelWidth));\n\n painter.save();\n if (row > 0) {\n painter.setPen(QColor(0xAA, 0xAA, 0xAA));\n painter.drawLine(50, y - 10, w - 50, y - 10);\n }\n\n painter.setPen(QColor(0x55, 0x55, 0x55));\n painter.drawRect(labelWidth + 10, y + metrics.leading(), yInc - 1, metrics.height());\n painter.drawText(hotkeyCenter - (metrics.width(_hotkeys[row]) \/ 2), y + baseline,\n QString(1, _hotkeys[row]));\n\n painter.restore();\n }\n y += yInc;\n }\n}\n\nvoid ChoiceView::keyPressEvent(QKeyEvent *event) {\n if (event->key() >= Qt::Key_0 && event->key() <= Qt::Key_9) {\n int chosen = event->key() - Qt::Key_0 + _offset - 1;\n if (chosen < _offset) chosen += 10;\n if (chosen < _choices.size()) {\n choose(chosen);\n return;\n }\n } else if (event->key() == Qt::Key_Escape) {\n goBack();\n return;\n } else if (event->key() == Qt::Key_Down) {\n pageDown();\n return;\n } else if (event->key() == Qt::Key_Up) {\n pageUp();\n return;\n }\n QWidget::keyPressEvent(event);\n}\n\nvoid ChoiceView::choose(int chosen) {\n emit choiceMade(_choices[chosen]);\n}\n\nvoid ChoiceView::goBack() {\n emit back();\n}\n\nvoid ChoiceView::setChoices(const QList<Choice> choices) {\n _choices = choices;\n if (_offset >= _choices.size()) {\n \/\/ Integer division floors here.\n _offset = (_choices.size() \/ 10) * 10;\n }\n emit morePages(_choices.size() \/ 10);\n refreshLabels();\n}\n\nvoid ChoiceView::pageDown() {\n if (_offset < _choices.size() - 10) {\n _offset += 10;\n refreshLabels();\n }\n}\n\nvoid ChoiceView::pageUp() {\n if (_offset >= 10) {\n _offset -= 10;\n refreshLabels();\n }\n}\n\nvoid ChoiceView::refreshLabels() {\n update();\n emit switchedToPage(_offset \/ 10);\n}\n\nbool operator<(Choice a, Choice b) {\n return a.title().compare(b.title(), Qt::CaseInsensitive) < 0;\n}\n<commit_msg>Long menu items now fade at the edge.<commit_after>#include \"choiceview.h\"\n\n#include <QKeyEvent>\n#include <QPaintEvent>\n#include <QPainter>\n\nChoice::Choice(const QString &title, const QString &id, const QStringList ¶ms)\n : _id(id), _title(title), _params(params) {\n}\n\nconst QString &Choice::id() const {\n return _id;\n}\n\nconst QString &Choice::title() const {\n return _title;\n}\n\nconst QStringList &Choice::params() const {\n return _params;\n}\n\nChoiceView::ChoiceView(QWidget *parent)\n : QWidget(parent),\n _offset(0) {\n\n setFocusPolicy(Qt::StrongFocus);\n setFont(QFont(\"Liberation Serif\", 20));\n}\n\nChoiceView::~ChoiceView() { }\n\nstatic const int arrowHeight = 8;\n\nstatic char _hotkeys[] = { '1', '2', '3', '4', '5', '6', '7', '8', '9', '0' };\nvoid ChoiceView::paintEvent(QPaintEvent *event) {\n QFontMetrics metrics(font());\n QPainter painter(this);\n\n int y = arrowHeight + 2;\n const int baseline = metrics.leading() + metrics.ascent() + 1;\n const int w = width(), h = height() - (y * 2);\n const int yInc = h \/ 10;\n const int labelWidth = w - yInc - 10;\n const int hotkeyCenter = w - (yInc \/ 2);\n\n \/\/ Top arrow\n const int center = w \/ 2;\n painter.eraseRect(0, 0, w, y);\n if (_offset > 0) {\n painter.drawLine(center, 0, center - arrowHeight, arrowHeight);\n painter.drawLine(center, 0, center + arrowHeight, arrowHeight);\n painter.drawLine(center - arrowHeight, arrowHeight, center + arrowHeight, arrowHeight);\n }\n \n \/\/ Bottom arrow\n painter.eraseRect(0, height() - y, w, y);\n if (_offset + 10 < _choices.size()) {\n painter.drawLine(center, height() - 1, center - arrowHeight, height() - arrowHeight - 1);\n painter.drawLine(center, height() - 1, center + arrowHeight, height() - arrowHeight - 1);\n painter.drawLine(center - arrowHeight, height() - arrowHeight - 1,\n center + arrowHeight, height() - arrowHeight - 1);\n }\n\n QLinearGradient fade(QPointF(0,0), QPointF(labelWidth, 0));\n fade.setColorAt(0, Qt::black);\n fade.setColorAt(0.95, Qt::black);\n fade.setColorAt(1.0, QColor(0xAA, 0xAA, 0xAA));\n \n QTextOption noWrap;\n noWrap.setWrapMode(QTextOption::NoWrap);\n\n \/\/ Choice area\n for (int row = 0; row < NUM_CHOICES; row++) {\n const int item = row + _offset;\n painter.eraseRect(0, y, w, yInc);\n if (item < _choices.size()) {\n const Choice &c = _choices[item];\n if (metrics.width(c.title()) > labelWidth) {\n painter.setPen(QPen(QBrush(fade), 1));\n } else {\n painter.setPen(QPen(Qt::black));\n }\n\n painter.drawText(QRectF(0, y, labelWidth, yInc), c.title(), noWrap);\n\n painter.save();\n if (row > 0) {\n painter.setPen(QColor(0xAA, 0xAA, 0xAA));\n painter.drawLine(50, y - 10, w - 50, y - 10);\n }\n\n painter.setPen(QColor(0x55, 0x55, 0x55));\n painter.drawRect(labelWidth + 10, y + metrics.leading(), yInc - 1, metrics.height());\n painter.drawText(hotkeyCenter - (metrics.width(_hotkeys[row]) \/ 2), y + baseline,\n QString(1, _hotkeys[row]));\n\n painter.restore();\n }\n y += yInc;\n }\n}\n\nvoid ChoiceView::keyPressEvent(QKeyEvent *event) {\n if (event->key() >= Qt::Key_0 && event->key() <= Qt::Key_9) {\n int chosen = event->key() - Qt::Key_0 + _offset - 1;\n if (chosen < _offset) chosen += 10;\n if (chosen < _choices.size()) {\n choose(chosen);\n return;\n }\n } else if (event->key() == Qt::Key_Escape) {\n goBack();\n return;\n } else if (event->key() == Qt::Key_Down) {\n pageDown();\n return;\n } else if (event->key() == Qt::Key_Up) {\n pageUp();\n return;\n }\n QWidget::keyPressEvent(event);\n}\n\nvoid ChoiceView::choose(int chosen) {\n emit choiceMade(_choices[chosen]);\n}\n\nvoid ChoiceView::goBack() {\n emit back();\n}\n\nvoid ChoiceView::setChoices(const QList<Choice> choices) {\n _choices = choices;\n if (_offset >= _choices.size()) {\n \/\/ Integer division floors here.\n _offset = (_choices.size() \/ 10) * 10;\n }\n emit morePages(_choices.size() \/ 10);\n refreshLabels();\n}\n\nvoid ChoiceView::pageDown() {\n if (_offset < _choices.size() - 10) {\n _offset += 10;\n refreshLabels();\n }\n}\n\nvoid ChoiceView::pageUp() {\n if (_offset >= 10) {\n _offset -= 10;\n refreshLabels();\n }\n}\n\nvoid ChoiceView::refreshLabels() {\n update();\n emit switchedToPage(_offset \/ 10);\n}\n\nbool operator<(Choice a, Choice b) {\n return a.title().compare(b.title(), Qt::CaseInsensitive) < 0;\n}\n<|endoftext|>"} {"text":"<commit_before>\/\/ -*- c-basic-offset: 2; related-file-name: \"aggwrap.h\" -*-\n\/*\n * @(#)$Id$\n * \n * This file is distributed under the terms in the attached INTEL-LICENSE file.\n * If you do not find these files, copies can be found by writing to:\n * Intel Research Berkeley, 2150 Shattuck Avenue, Suite 1300,\n * Berkeley, CA, 94704. Attention: Intel License Inquiry.\n * \n *\/\n\n#include \"aggwrap.h\"\n#include \"trace.h\"\n#include \"val_int32.h\"\n\nAggwrap::Aggwrap(str aggfn, int aggfield)\n : Element(strbuf() << \"Aggwrap<\" << aggfn << \",\" << aggfield << \">\", 2, 2),\n _aggfn(aggfn), _aggfield(aggfield),\n inner_accepting(true),\n ext_in_cb(cbv_null), \n ext_out_cb(cbv_null)\n{\n numJoins = 0;\n if (aggfn == \"min\") {\n log(LoggerI::INFO, 0, str(strbuf() << \"min aggregation \" << _aggfield));\n } else if (aggfn == \"max\") {\n log(LoggerI::INFO, 0, str(strbuf() << \"max aggregation \" << _aggfield));\n } else if (aggfn == \"count\") { \n log(LoggerI::INFO, 0, str(strbuf() << \"count aggregation \" << _aggfield));\n } else {\n log(LoggerI::INFO, 0, \"HELP: Don't understand agg function '\" << aggfn << \"'\");\n }\n}\n\n\/\/\n\/\/ A new tuple is coming in from outside. \n\/\/\nint Aggwrap::push(int port, TupleRef t, cbv cb)\n{\n log(LoggerI::INFO, 0, str(strbuf() << \" Push: \" << port << \",\" << t->toString()));\n\n \/\/ if receive the next one when previous has not finished, then keep in queue?\n\n \/\/ Is this the right port?\n switch (port) {\n case 0:\n ext_in_cb = cb;\n switch(aggState) {\n case 0: \/\/ Waiting\n log(LoggerI::INFO, 0, str(strbuf() << \" received a tuple from outside!\" << t->toString()));\n assert(inner_accepting);\n agg_init();\n inner_accepting = output(1)->push(t, wrap(this, &Aggwrap::int_push_cb));\n break;\n case 1:\n log(LoggerI::INFO, 0, \"FAIL: pushed when processing!\");\n \/\/ Discard tuple\n break;\n case 2:\n log(LoggerI::INFO, 0, \"FAIL: pushed when done pending\");\n break;\n default:\n log(LoggerI::INFO, 0, str(strbuf() << \"FAIL: weird state \" << aggState));\n } \n return 0;\n case 1:\n switch(aggState) {\n case 0: \/\/ Waiting\n log(LoggerI::INFO, 0, \"OOPS: unexpected result tuple when in state waiting\");\n break;\n case 1:\n agg_accum(t);\n break;\n case 2:\n log(LoggerI::INFO, 0, \"FAIL: pushed when done pending\");\n break;\n default:\n log(LoggerI::INFO, 0, str(strbuf() << \"FAIL: weird state \" << aggState));\n } \n return 1;\n default:\n assert(port < 2);\n return 0;\n }\n\n}\n\n\/\/ \n\/\/ Callback from the inner graph when we can push more tuples. \n\/\/ \nvoid Aggwrap::int_push_cb()\n{\n TRC_FN;\n inner_accepting = true;\n log(LoggerI::INFO, 0, str(strbuf() << \"Callback from inner graph on successful push\" << aggState));\n if (aggState == 0 && ext_in_cb) {\n log(LoggerI::INFO, 0, str(strbuf() << \"Invoke ext_in_cb\"));\n ext_in_cb();\n }\n}\n\n\n\/\/\n\/\/ Completion callback\n\/\/\nvoid Aggwrap::comp_cb(int jnum)\n{\n TRC_FN;\n log(LoggerI::INFO, 0, str(strbuf() << \"Join \" << jnum << \" completed.\"));\n if (curJoin < jnum) { \n curJoin = jnum;\n }\n \n if (curJoin >= numJoins - 1) {\n \/\/ Presumably, we're now done.\n agg_finalize();\n }\n}\n\n\/\/\n\/\/ Getting hold of a closure for the above\n\/\/\ncbv Aggwrap::get_comp_cb()\n{\n log(LoggerI::INFO, 0, str(strbuf() << \"Joins so far: \" << numJoins + 1));\n return wrap(this,&Aggwrap::comp_cb,numJoins++);\n}\n\n\/\/\n\/\/ Finally, the aggregation functions\n\/\/\nvoid Aggwrap::agg_init() {\n TRC_FN;\n curJoin = -1;\n aggState = 1;\n if ( _aggfn == \"count\") {\n count = 0;\n } else {\n aggResult = NULL;\n }\n}\n\nvoid Aggwrap::agg_accum(TupleRef t) {\n TRC_FN;\n if ( _aggfn == \"count\") {\n count++;\n return;\n } \n\n if ( aggResult == NULL ) {\n aggResult = t;\n log(LoggerI::INFO, 0, str(strbuf() << \"After Agg accumulation: \" << aggResult->toString()));\n return;\n }\n\n log(LoggerI::INFO, 0, str(strbuf() << \"Before Agg accumulation: \" << aggResult->toString()));\n int cr = (*t)[_aggfield]->compareTo((*aggResult)[_aggfield]);\n if ((cr == -1 && _aggfn == \"min\") || (cr == 1 && _aggfn == \"max\")) {\n aggResult = t;\n }\n log(LoggerI::INFO, 0, str(strbuf() << \"After Agg accumulation: \" << aggResult->toString() << cr \n\t\t\t << \" \" << (*t)[_aggfield]->toString() << \" \" << (*aggResult)[_aggfield]->toString()));\n}\n\nvoid Aggwrap::agg_finalize() {\n TRC_FN;\n if (_aggfn == \"count\") {\n aggResult = Tuple::mk();\n aggResult->append(Val_Int32::mk(count));\n aggResult->freeze();\n }\n if (aggResult) {\n log(LoggerI::INFO, 0, str(strbuf() << \" finalize: Pushing tuple\" << aggResult->toString()));\n output(0)->push(aggResult, cbv_null);\n\n if (ext_in_cb) {\n ext_in_cb(); \/\/ accept new tuples to be pushed in via outer\n }\n } else {\n log(LoggerI::INFO, 0, \"Finalize: Alas, nothing to push\");\n }\n aggState = 0;\n}\n<commit_msg>Aggwrap<commit_after>\/\/ -*- c-basic-offset: 2; related-file-name: \"aggwrap.h\" -*-\n\/*\n * @(#)$Id$\n * \n * This file is distributed under the terms in the attached INTEL-LICENSE file.\n * If you do not find these files, copies can be found by writing to:\n * Intel Research Berkeley, 2150 Shattuck Avenue, Suite 1300,\n * Berkeley, CA, 94704. Attention: Intel License Inquiry.\n * \n *\/\n\n#include \"aggwrap.h\"\n#include \"trace.h\"\n#include \"val_int32.h\"\n\nAggwrap::Aggwrap(str aggfn, int aggfield)\n : Element(strbuf() << \"Aggwrap<\" << aggfn << \",\" << aggfield << \">\", 2, 2),\n _aggfn(aggfn), _aggfield(aggfield),\n inner_accepting(true),\n ext_in_cb(cbv_null), \n ext_out_cb(cbv_null)\n{\n numJoins = 0;\n if (aggfn == \"min\") {\n log(LoggerI::INFO, 0, str(strbuf() << \"min aggregation \" << _aggfield));\n } else if (aggfn == \"max\") {\n log(LoggerI::INFO, 0, str(strbuf() << \"max aggregation \" << _aggfield));\n } else if (aggfn == \"count\") { \n log(LoggerI::INFO, 0, str(strbuf() << \"count aggregation \" << _aggfield));\n } else {\n log(LoggerI::INFO, 0, \"HELP: Don't understand agg function '\" << aggfn << \"'\");\n }\n}\n\n\/\/\n\/\/ A new tuple is coming in from outside. \n\/\/\nint Aggwrap::push(int port, TupleRef t, cbv cb)\n{\n log(LoggerI::INFO, 0, str(strbuf() << \" Push: \" << port << \",\" << t->toString()));\n\n \/\/ if receive the next one when previous has not finished, then keep in queue?\n\n \/\/ Is this the right port?\n switch (port) {\n case 0:\n ext_in_cb = cb;\n switch(aggState) {\n case 0: \/\/ Waiting\n log(LoggerI::INFO, 0, str(strbuf() << \" received a tuple from outside!\" << t->toString()));\n assert(inner_accepting);\n agg_init();\n inner_accepting = output(1)->push(t, wrap(this, &Aggwrap::int_push_cb));\n break;\n case 1:\n log(LoggerI::INFO, 0, \"FAIL: pushed when processing!\");\n \/\/ Discard tuple\n break;\n case 2:\n log(LoggerI::INFO, 0, \"FAIL: pushed when done pending\");\n break;\n default:\n log(LoggerI::INFO, 0, str(strbuf() << \"FAIL: weird state \" << aggState));\n } \n return 0;\n case 1:\n switch(aggState) {\n case 0: \/\/ Waiting\n log(LoggerI::INFO, 0, \"OOPS: unexpected result tuple when in state waiting\");\n break;\n case 1:\n agg_accum(t);\n break;\n case 2:\n log(LoggerI::INFO, 0, \"FAIL: pushed when done pending\");\n break;\n default:\n log(LoggerI::INFO, 0, str(strbuf() << \"FAIL: weird state \" << aggState));\n } \n return 1;\n default:\n assert(port < 2);\n return 0;\n }\n\n}\n\n\/\/ \n\/\/ Callback from the inner graph when we can push more tuples. \n\/\/ \nvoid Aggwrap::int_push_cb()\n{\n TRC_FN;\n inner_accepting = true;\n log(LoggerI::INFO, 0, str(strbuf() << \"Callback from inner graph on successful push\" << aggState));\n if (aggState == 0 && ext_in_cb) {\n log(LoggerI::INFO, 0, str(strbuf() << \"Invoke ext_in_cb\"));\n ext_in_cb();\n }\n}\n\n\n\/\/\n\/\/ Completion callback\n\/\/\nvoid Aggwrap::comp_cb(int jnum)\n{\n TRC_FN;\n log(LoggerI::INFO, 0, str(strbuf() << \"Join \" << jnum << \" completed.\"));\n if (curJoin < jnum) { \n curJoin = jnum;\n }\n \n if (curJoin >= numJoins - 1) {\n \/\/ Presumably, we're now done.\n agg_finalize();\n }\n}\n\n\/\/\n\/\/ Getting hold of a closure for the above\n\/\/\ncbv Aggwrap::get_comp_cb()\n{\n log(LoggerI::INFO, 0, str(strbuf() << \"Joins so far: \" << numJoins + 1));\n return wrap(this,&Aggwrap::comp_cb,numJoins++);\n}\n\n\/\/\n\/\/ Finally, the aggregation functions\n\/\/\nvoid Aggwrap::agg_init() {\n TRC_FN;\n curJoin = -1;\n aggState = 1;\n if ( _aggfn == \"count\") {\n count = 0;\n } else {\n aggResult = NULL;\n }\n}\n\nvoid Aggwrap::agg_accum(TupleRef t) {\n TRC_FN;\n if ( _aggfn == \"count\") {\n count++;\n return;\n } \n\n if ( aggResult == NULL ) {\n aggResult = t;\n log(LoggerI::INFO, 0, str(strbuf() << \"After Agg accumulation: \" << aggResult->toString()));\n return;\n }\n\n log(LoggerI::INFO, 0, str(strbuf() << \"Before Agg accumulation: \" << aggResult->toString()));\n int cr = (*t)[_aggfield]->compareTo((*aggResult)[_aggfield]);\n if ((cr == -1 && _aggfn == \"min\") || (cr == 1 && _aggfn == \"max\")) {\n aggResult = t;\n }\n log(LoggerI::INFO, 0, str(strbuf() << \"After Agg accumulation: \" << aggResult->toString() << cr \n\t\t\t << \" \" << (*t)[_aggfield]->toString() << \" \" << (*aggResult)[_aggfield]->toString()));\n}\n\nvoid Aggwrap::agg_finalize() {\n TRC_FN;\n if (_aggfn == \"count\") {\n aggResult = Tuple::mk();\n aggResult->append(Val_Int32::mk(count));\n aggResult->freeze();\n }\n if (aggResult) {\n log(LoggerI::INFO, 0, str(strbuf() << \" finalize: Pushing tuple\" << aggResult->toString()));\n output(0)->push(aggResult, cbv_null);\n } else {\n log(LoggerI::INFO, 0, \"Finalize: Alas, nothing to push\");\n }\n if (ext_in_cb) {\n ext_in_cb(); \/\/ accept new tuples to be pushed in via outer regardless of any outputs\n }\n aggState = 0;\n}\n<|endoftext|>"} {"text":"<commit_before>#include <cstdlib>\n#include <cmath>\n#include <fstream>\n#include <sstream>\n#include <iostream>\n#include <iomanip>\n#include <string>\n#include <vector>\n#include <algorithm>\n#include <exception>\n#include <sys\/time.h>\n#include \"modules\/htmTree.h\"\n#include \"modules\/kdTree.h\"\n#include \"misc.h\"\n#include \"feat.h\"\n#include \"structs.h\"\n#include \"collision.h\"\n#include \"global.h\"\n\/\/reduce redistributes, updates 07\/02\/15 rnc\nint main(int argc, char **argv) {\n \/\/\/\/ Initializations ---------------------------------------------\n srand48(1234); \/\/ Make sure we have reproducability\n check_args(argc);\n Time t, time; \/\/ t for global, time for local\n init_time(t);\n Feat F;\n MTL M;\n \n\n \/\/ Read parameters file \/\/\n F.readInputFile(argv[1]);\n printFile(argv[1]);\n \/\/ Read Secretfile\n \/\/ Secret contains the identity of each target: QSO-Ly-a, QSO-tracers, LRG, ELG, fake QSO, fake LRG, SS, SF\n Gals Secret;\n init_time_at(time,\"# reading Secret file\",t);\n\n Secret=read_Secretfile(F.Secretfile,F);\n printf(\"# Read %d galaxies from %s \\n\",Secret.size(),F.Secretfile.c_str());\n print_time(time,\"# ... took :\");\n std::vector<int> count(10);\n count=count_galaxies(Secret);\n printf(\" Number of galaxies by type, QSO-Ly-a, QSO-tracers, LRG, ELG, fake QSO, fake LRG, SS, SF\\n\");\n for(int i=0;i<8;i++){if(count[i]>0)printf (\" type %d number %d \\n\",i, count[i]);}\n \/\/read the three input fits files\n init_time_at(time,\"# read target, SS, SF files\",t);\n MTL Targ=read_MTLfile(F.Targfile,F,0,0);\n MTL SStars=read_MTLfile(F.SStarsfile,F,1,0);\n MTL SkyF=read_MTLfile(F.SkyFfile,F,0,1);\n \n if(Targ.size() == 0) {\n std::cerr << \"ERROR: No targets found in \" << F.Targfile << std::endl;\n myexit(1);\n }\n \n print_time(time,\"# ... took :\");\n \/\/combine the three input files\n M=Targ;\n printf(\" M size %d \\n\",M.size());\n M.insert(M.end(),SStars.begin(),SStars.end());\n printf(\" M size %d \\n\",M.size());\n M.insert(M.end(),SkyF.begin(),SkyF.end());\n printf(\" M size %d \\n\",M.size());\n F.Ngal=M.size();\n F.Ntarg=Secret.size();\n \n \/\/establish priority classes\n init_time_at(time,\"# establish priority clasess\",t);\n assign_priority_class(M);\n std::vector <int> count_class(M.priority_list.size(),0);\n for(int i;i<M.size();++i){\n if(!M[i].SS&&!M[i].SF){\n count_class[M[i].priority_class]+=1;\n }\n }\n for(int i;i<M.priority_list.size();++i){\n printf(\" class %d priority %d number %d\\n\",i,M.priority_list[i],count_class[i]);\n }\n print_time(time,\"# ... took :\");\n \n \/\/ fiber positioners\n PP pp;\n pp.read_fiber_positions(F); \n F.Nfiber = pp.fp.size()\/2; \n F.Npetal = max(pp.spectrom)+1;\n F.Nfbp = (int) (F.Nfiber\/F.Npetal);\/\/ fibers per petal = 500\n pp.get_neighbors(F);\n pp.compute_fibsofsp(F);\n printf(\"computed neighbors\\n\");\n std::cout.flush();\n \/\/P tiles in order specified by surveyFile\n Plates P = read_plate_centers(F);\n F.Nplate=P.size();\n printf(\"# Read %d plates from %s and %d fibers from %s\\n\",F.Nplate,F.tileFile.c_str(),F.Nfiber,F.fibFile.c_str());\n\n \/\/ Computes geometries of cb and fh: pieces of positioner - used to determine possible collisions\n F.cb = create_cb(); \/\/ cb=central body\n F.fh = create_fh(); \/\/ fh=fiber holder\n\n \/\/\/\/ Collect available galaxies <-> tilefibers --------------------\n \/\/ HTM Tree of galaxies\n const double MinTreeSize = 0.01;\n init_time_at(time,\"# Start building HTM tree\",t);\n\n htmTree<struct target> T(M,MinTreeSize);\n print_time(time,\"# ... took :\");\/\/T.stats();\n init_time_at(time,\"# collect galaxies at \",t);\n \n \/\/ For plates\/fibers, collect available galaxies; done in parallel\n collect_galaxies_for_all(M,T,P,pp,F);\n print_time(time,\"# ... took :\");\/\/T.stats();\n init_time_at(time,\"# collect available tile-fibers at\",t);\n \/\/ For each galaxy, computes available tilefibers G[i].av_tfs = [(j1,k1),(j2,k2),..]\n collect_available_tilefibers(M,P,F);\n \n \/\/results_on_inputs(\"doc\/figs\/\",G,P,F,true);\n\n \/\/\/\/ Assignment |||||||||||||||||||||||||||||||||||||||||||||||||||\n printf(\" Nplate %d Ngal %d Nfiber %d \\n\", F.Nplate, F.Ngal, F.Nfiber);\n Assignment A(M,F);\n \n print_time(t,\"# Start assignment at : \");\n\n \/\/ Make a plan ----------------------------------------------------\n \/\/ Plans whole survey without sky fibers, standard stars\n \/\/ assumes maximum number of observations needed for QSOs, LRGs\n\n simple_assign(M,P,pp,F,A);\n\n \/\/check to see if there are tiles with no galaxies\n \/\/need to keep mapping of old tile list to new tile list\n \/\/and inverse map\n A.inv_order=initList(F.Nplate,-1);\n int inv_count=0;\n for (int j=0;j<F.Nplate ;++j){\n \n bool not_done=true;\n for(int k=0;k<F.Nfiber && not_done;++k){\n if(A.TF[j][k]!=-1){\/\/fiber and therefore plate is used\n A.suborder.push_back(j);\/\/suborder[jused] is jused-th used plate\n not_done=false;\n A.inv_order[j]=inv_count;\/\/inv_order[j] is -1 unless used\n \/\/and otherwise the position of plate j in list of used plates\n inv_count++;\n }\n }\n }\n F.NUsedplate=A.suborder.size();\n printf(\" Plates actually used %d \\n\",F.NUsedplate);\n\n if(F.diagnose)diagnostic(M,Secret,F,A);\n\n print_hist(\"Unused fibers\",5,histogram(A.unused_fbp(pp,F),5),false); \/\/ Hist of unused fibs\n \n \/\/ Smooth out distribution of free fibers, and increase the number of assignments\n \n for (int i=0; i<1; i++) redistribute_tf(M,P,pp,F,A,0);\/\/ more iterations will improve performance slightly\n for (int i=0; i<1; i++) {\n improve(M,P,pp,F,A,0);\n redistribute_tf(M,P,pp,F,A,0);\n }\n print_hist(\"Unused fibers\",5,histogram(A.unused_fbp(pp,F),5),false);\n \/\/try assigning SF and SS before real time assignment\n for (int jused=0;jused<F.NUsedplate;++jused){\n int j=A.suborder[jused];\n assign_sf_ss(j,M,P,pp,F,A); \/\/ Assign SS and SF for each tile\n assign_unused(j,M,P,pp,F,A);\n }\n if(F.diagnose)diagnostic(M,Secret,F,A);\n init_time_at(time,\"# Begin real time assignment\",t);\n\n \/\/Execute plan, updating targets at intervals\n for(int i=0;i<F.pass_intervals.size();i++){\n printf(\" i=%d interval %d \\n\",i,F.pass_intervals[i]);\n }\n std::vector <int> update_intervals=F.pass_intervals;\n update_intervals.push_back(F.NUsedplate);\/\/to end intervals at last plate\n for(int i=0;i<update_intervals.size();++i){\n printf(\"i %d update_interval %d\\n\",i, update_intervals[i]);\n }\n for(int i=0;i<update_intervals.size()-1;++i){\/\/go plate by used plate\n int starter=update_intervals[i];\n printf(\"-- interval %d\\n\",i);\n for (int jused=starter; jused<update_intervals[i+1] && jused<A.suborder.size()-1; jused++) {\n\n if (0<=jused-F.Analysis) {\n update_plan_from_one_obs(jused,Secret,M,P,pp,F,A);\n }\n else printf(\"\\n no update\\n\");\n \/\/ Update corrects all future occurrences of wrong QSOs etc and tries to observe something else\n\n }\n printf(\"-- redistribute %d\\n\",i); \n redistribute_tf(M,P,pp,F,A,starter);\n printf(\"-- improve %d\\n\",i); \n improve(M,P,pp,F,A,starter);\n printf(\"-- improve again %d\\n\",i); \n redistribute_tf(M,P,pp,F,A,starter);\n printf(\"-- diagnose %d\\n\",i); \n if(F.diagnose)diagnostic(M,Secret,F,A);\n\n }\n \/\/ check on SS and SF\n\n printf(\"-- Checking SS\/SF\\n\");\n List SS_hist=initList(11,0);\n List SF_hist=initList(41,0);\n for(int jused=0;jused<F.NUsedplate;++jused){\n int j=A.suborder[jused];\n for (int p=0;p<F.Npetal;++p){\n int count_SS=0;\n int count_SF=0;\n for (int k=0;k<F.Nfbp;++k){\n int kk=pp.fibers_of_sp[p][k];\n int g=A.TF[j][kk];\n if(g!=-1 && M[g].SS)count_SS++;\n if(g!=-1 && M[g].SF)count_SF++;\n }\n SS_hist[count_SS]++;\n SF_hist[count_SF]++;\n }\n }\n printf(\" SS distribution \\n\");\n for(int i=0;i<10;i++)printf(\"%8d\",SS_hist[i]);\n printf(\"\\n %8d \\n\",SS_hist[10]);\n \n printf(\" SF distribution \\n\");\n for(int i=0;i<10;i++)printf(\"%8d\",SF_hist[i]);\n printf(\"\\n\");\n for(int i=10;i<20;i++)printf(\"%8d\",SF_hist[i]);\n printf(\"\\n\");\n for(int i=20;i<30;i++)printf(\"%8d\",SF_hist[i]);\n printf(\"\\n\");\n for(int i=30;i<40;i++)printf(\"%8d\",SF_hist[i]);\n printf(\"\\n %8d \\n\",SF_hist[40]);\n\n \n\n \n \/\/ Results -------------------------------------------------------\n \n \/\/special for clustering group 6\/28\/16\n \/\/for each tile how many fibers free? how many to each type of target?\n int free_tot=0;\n for (int jused=0;jused<F.NUsedplate;jused++){\n int free=0;\n int j=A.suborder[jused];\n for (int k=0);k<F.Nfiber;++k){\n if A.TF[j][k]==-1{\n free+=1;\n free_tot+=1;\n }\n }\n printf(\" jused %d j %d free %d free total %d \\n\",jused,j,free,free_tot)\n }\n \n \n if (F.PrintAscii){\n for (int jused=0; jused<F.NUsedplate; jused++){\n int j=A.suborder[jused];\n write_FAtile_ascii(A.suborder[jused],F.outDir,M,P,pp,F,A);\n }\n }\n \n if (F.PrintFits) {\n for (int jused=0; jused<F.NUsedplate; jused++){\n int j=A.suborder[jused];\n fa_write(A.suborder[jused],F.outDir,M,P,pp,F,A); \/\/ Write outpu\n }\n }\n \n\n\tdisplay_results(\"doc\/figs\/\",Secret,M,P,pp,F,A,F.Nplate,true);\n\tif (F.Verif) A.verif(P,M,pp,F); \/\/ Verification that the assignment is sane\n\n\n print_time(t,\"# Finished !... in\");\n\n return(0);\n \n}\n<commit_msg>get free fibers each plate<commit_after>#include <cstdlib>\n#include <cmath>\n#include <fstream>\n#include <sstream>\n#include <iostream>\n#include <iomanip>\n#include <string>\n#include <vector>\n#include <algorithm>\n#include <exception>\n#include <sys\/time.h>\n#include \"modules\/htmTree.h\"\n#include \"modules\/kdTree.h\"\n#include \"misc.h\"\n#include \"feat.h\"\n#include \"structs.h\"\n#include \"collision.h\"\n#include \"global.h\"\n\/\/reduce redistributes, updates 07\/02\/15 rnc\nint main(int argc, char **argv) {\n \/\/\/\/ Initializations ---------------------------------------------\n srand48(1234); \/\/ Make sure we have reproducability\n check_args(argc);\n Time t, time; \/\/ t for global, time for local\n init_time(t);\n Feat F;\n MTL M;\n \n\n \/\/ Read parameters file \/\/\n F.readInputFile(argv[1]);\n printFile(argv[1]);\n \/\/ Read Secretfile\n \/\/ Secret contains the identity of each target: QSO-Ly-a, QSO-tracers, LRG, ELG, fake QSO, fake LRG, SS, SF\n Gals Secret;\n init_time_at(time,\"# reading Secret file\",t);\n\n Secret=read_Secretfile(F.Secretfile,F);\n printf(\"# Read %d galaxies from %s \\n\",Secret.size(),F.Secretfile.c_str());\n print_time(time,\"# ... took :\");\n std::vector<int> count(10);\n count=count_galaxies(Secret);\n printf(\" Number of galaxies by type, QSO-Ly-a, QSO-tracers, LRG, ELG, fake QSO, fake LRG, SS, SF\\n\");\n for(int i=0;i<8;i++){if(count[i]>0)printf (\" type %d number %d \\n\",i, count[i]);}\n \/\/read the three input fits files\n init_time_at(time,\"# read target, SS, SF files\",t);\n MTL Targ=read_MTLfile(F.Targfile,F,0,0);\n MTL SStars=read_MTLfile(F.SStarsfile,F,1,0);\n MTL SkyF=read_MTLfile(F.SkyFfile,F,0,1);\n \n if(Targ.size() == 0) {\n std::cerr << \"ERROR: No targets found in \" << F.Targfile << std::endl;\n myexit(1);\n }\n \n print_time(time,\"# ... took :\");\n \/\/combine the three input files\n M=Targ;\n printf(\" M size %d \\n\",M.size());\n M.insert(M.end(),SStars.begin(),SStars.end());\n printf(\" M size %d \\n\",M.size());\n M.insert(M.end(),SkyF.begin(),SkyF.end());\n printf(\" M size %d \\n\",M.size());\n F.Ngal=M.size();\n F.Ntarg=Secret.size();\n \n \/\/establish priority classes\n init_time_at(time,\"# establish priority clasess\",t);\n assign_priority_class(M);\n std::vector <int> count_class(M.priority_list.size(),0);\n for(int i;i<M.size();++i){\n if(!M[i].SS&&!M[i].SF){\n count_class[M[i].priority_class]+=1;\n }\n }\n for(int i;i<M.priority_list.size();++i){\n printf(\" class %d priority %d number %d\\n\",i,M.priority_list[i],count_class[i]);\n }\n print_time(time,\"# ... took :\");\n \n \/\/ fiber positioners\n PP pp;\n pp.read_fiber_positions(F); \n F.Nfiber = pp.fp.size()\/2; \n F.Npetal = max(pp.spectrom)+1;\n F.Nfbp = (int) (F.Nfiber\/F.Npetal);\/\/ fibers per petal = 500\n pp.get_neighbors(F);\n pp.compute_fibsofsp(F);\n printf(\"computed neighbors\\n\");\n std::cout.flush();\n \/\/P tiles in order specified by surveyFile\n Plates P = read_plate_centers(F);\n F.Nplate=P.size();\n printf(\"# Read %d plates from %s and %d fibers from %s\\n\",F.Nplate,F.tileFile.c_str(),F.Nfiber,F.fibFile.c_str());\n\n \/\/ Computes geometries of cb and fh: pieces of positioner - used to determine possible collisions\n F.cb = create_cb(); \/\/ cb=central body\n F.fh = create_fh(); \/\/ fh=fiber holder\n\n \/\/\/\/ Collect available galaxies <-> tilefibers --------------------\n \/\/ HTM Tree of galaxies\n const double MinTreeSize = 0.01;\n init_time_at(time,\"# Start building HTM tree\",t);\n\n htmTree<struct target> T(M,MinTreeSize);\n print_time(time,\"# ... took :\");\/\/T.stats();\n init_time_at(time,\"# collect galaxies at \",t);\n \n \/\/ For plates\/fibers, collect available galaxies; done in parallel\n collect_galaxies_for_all(M,T,P,pp,F);\n print_time(time,\"# ... took :\");\/\/T.stats();\n init_time_at(time,\"# collect available tile-fibers at\",t);\n \/\/ For each galaxy, computes available tilefibers G[i].av_tfs = [(j1,k1),(j2,k2),..]\n collect_available_tilefibers(M,P,F);\n \n \/\/results_on_inputs(\"doc\/figs\/\",G,P,F,true);\n\n \/\/\/\/ Assignment |||||||||||||||||||||||||||||||||||||||||||||||||||\n printf(\" Nplate %d Ngal %d Nfiber %d \\n\", F.Nplate, F.Ngal, F.Nfiber);\n Assignment A(M,F);\n \n print_time(t,\"# Start assignment at : \");\n\n \/\/ Make a plan ----------------------------------------------------\n \/\/ Plans whole survey without sky fibers, standard stars\n \/\/ assumes maximum number of observations needed for QSOs, LRGs\n\n simple_assign(M,P,pp,F,A);\n\n \/\/check to see if there are tiles with no galaxies\n \/\/need to keep mapping of old tile list to new tile list\n \/\/and inverse map\n A.inv_order=initList(F.Nplate,-1);\n int inv_count=0;\n for (int j=0;j<F.Nplate ;++j){\n \n bool not_done=true;\n for(int k=0;k<F.Nfiber && not_done;++k){\n if(A.TF[j][k]!=-1){\/\/fiber and therefore plate is used\n A.suborder.push_back(j);\/\/suborder[jused] is jused-th used plate\n not_done=false;\n A.inv_order[j]=inv_count;\/\/inv_order[j] is -1 unless used\n \/\/and otherwise the position of plate j in list of used plates\n inv_count++;\n }\n }\n }\n F.NUsedplate=A.suborder.size();\n printf(\" Plates actually used %d \\n\",F.NUsedplate);\n\n if(F.diagnose)diagnostic(M,Secret,F,A);\n\n print_hist(\"Unused fibers\",5,histogram(A.unused_fbp(pp,F),5),false); \/\/ Hist of unused fibs\n \n \/\/ Smooth out distribution of free fibers, and increase the number of assignments\n \n for (int i=0; i<1; i++) redistribute_tf(M,P,pp,F,A,0);\/\/ more iterations will improve performance slightly\n for (int i=0; i<1; i++) {\n improve(M,P,pp,F,A,0);\n redistribute_tf(M,P,pp,F,A,0);\n }\n print_hist(\"Unused fibers\",5,histogram(A.unused_fbp(pp,F),5),false);\n \/\/try assigning SF and SS before real time assignment\n for (int jused=0;jused<F.NUsedplate;++jused){\n int j=A.suborder[jused];\n assign_sf_ss(j,M,P,pp,F,A); \/\/ Assign SS and SF for each tile\n assign_unused(j,M,P,pp,F,A);\n }\n if(F.diagnose)diagnostic(M,Secret,F,A);\n init_time_at(time,\"# Begin real time assignment\",t);\n\n \/\/Execute plan, updating targets at intervals\n for(int i=0;i<F.pass_intervals.size();i++){\n printf(\" i=%d interval %d \\n\",i,F.pass_intervals[i]);\n }\n std::vector <int> update_intervals=F.pass_intervals;\n update_intervals.push_back(F.NUsedplate);\/\/to end intervals at last plate\n for(int i=0;i<update_intervals.size();++i){\n printf(\"i %d update_interval %d\\n\",i, update_intervals[i]);\n }\n for(int i=0;i<update_intervals.size()-1;++i){\/\/go plate by used plate\n int starter=update_intervals[i];\n printf(\"-- interval %d\\n\",i);\n for (int jused=starter; jused<update_intervals[i+1] && jused<A.suborder.size()-1; jused++) {\n\n if (0<=jused-F.Analysis) {\n update_plan_from_one_obs(jused,Secret,M,P,pp,F,A);\n }\n else printf(\"\\n no update\\n\");\n \/\/ Update corrects all future occurrences of wrong QSOs etc and tries to observe something else\n\n }\n printf(\"-- redistribute %d\\n\",i); \n redistribute_tf(M,P,pp,F,A,starter);\n printf(\"-- improve %d\\n\",i); \n improve(M,P,pp,F,A,starter);\n printf(\"-- improve again %d\\n\",i); \n redistribute_tf(M,P,pp,F,A,starter);\n printf(\"-- diagnose %d\\n\",i); \n if(F.diagnose)diagnostic(M,Secret,F,A);\n\n }\n \/\/ check on SS and SF\n\n printf(\"-- Checking SS\/SF\\n\");\n List SS_hist=initList(11,0);\n List SF_hist=initList(41,0);\n for(int jused=0;jused<F.NUsedplate;++jused){\n int j=A.suborder[jused];\n for (int p=0;p<F.Npetal;++p){\n int count_SS=0;\n int count_SF=0;\n for (int k=0;k<F.Nfbp;++k){\n int kk=pp.fibers_of_sp[p][k];\n int g=A.TF[j][kk];\n if(g!=-1 && M[g].SS)count_SS++;\n if(g!=-1 && M[g].SF)count_SF++;\n }\n SS_hist[count_SS]++;\n SF_hist[count_SF]++;\n }\n }\n printf(\" SS distribution \\n\");\n for(int i=0;i<10;i++)printf(\"%8d\",SS_hist[i]);\n printf(\"\\n %8d \\n\",SS_hist[10]);\n \n printf(\" SF distribution \\n\");\n for(int i=0;i<10;i++)printf(\"%8d\",SF_hist[i]);\n printf(\"\\n\");\n for(int i=10;i<20;i++)printf(\"%8d\",SF_hist[i]);\n printf(\"\\n\");\n for(int i=20;i<30;i++)printf(\"%8d\",SF_hist[i]);\n printf(\"\\n\");\n for(int i=30;i<40;i++)printf(\"%8d\",SF_hist[i]);\n printf(\"\\n %8d \\n\",SF_hist[40]);\n\n \n\n \n \/\/ Results -------------------------------------------------------\n \n \/\/special for clustering group 6\/28\/16\n \/\/for each tile how many fibers free? how many to each type of target?\n int free_tot=0;\n for (int jused=0;jused<F.NUsedplate;jused++){\n int free=0;\n int j=A.suborder[jused];\n for (int k=0;k<F.Nfiber;++k){\n if A.TF[j][k]==-1{\n free+=1;\n free_tot+=1;\n }\n }\n printf(\" jused %d j %d free %d free total %d \\n\",jused,j,free,free_tot)\n }\n \n \n if (F.PrintAscii){\n for (int jused=0; jused<F.NUsedplate; jused++){\n int j=A.suborder[jused];\n write_FAtile_ascii(A.suborder[jused],F.outDir,M,P,pp,F,A);\n }\n }\n \n if (F.PrintFits) {\n for (int jused=0; jused<F.NUsedplate; jused++){\n int j=A.suborder[jused];\n fa_write(A.suborder[jused],F.outDir,M,P,pp,F,A); \/\/ Write outpu\n }\n }\n \n\n\tdisplay_results(\"doc\/figs\/\",Secret,M,P,pp,F,A,F.Nplate,true);\n\tif (F.Verif) A.verif(P,M,pp,F); \/\/ Verification that the assignment is sane\n\n\n print_time(t,\"# Finished !... in\");\n\n return(0);\n \n}\n<|endoftext|>"} {"text":"<commit_before>#include <cassert>\n#include <iostream>\n\n#include \"Workspace\/Application\/LanguageUtils\/streamqstring.h\"\n#include \"Workspace\/DataExecution\/DataObjects\/typedobject.h\"\n#include \"Workspace\/DataExecution\/InputOutput\/inputscalar.h\"\n#include \"Workspace\/DataExecution\/InputOutput\/inputarray.h\"\n#include \"Workspace\/DataExecution\/InputOutput\/output.h\"\n#include \"Workspace\/DataExecution\/Operations\/typedoperationfactory.h\"\n\n\/\/OpenCV core for ellipse\n#include \"opencv2\/imgproc.hpp\"\n\n#include \"qimage.h\"\n\n#include \"volcanoplugin.h\"\n#include \"ellipticalpile.h\"\n\n\nnamespace RF\n{\n \/**\n * \\internal\n *\/\n class EllipticalPileImpl\n {\n \/\/ Allow string translation to work properly\n Q_DECLARE_TR_FUNCTIONS(RF::EllipticalPileImpl)\n\n public:\n EllipticalPile& op_;\n\n \/\/ Data objects\n CSIRO::DataExecution::TypedObject< double > dataCenterX_;\n CSIRO::DataExecution::TypedObject< double > dataCenterY_;\n CSIRO::DataExecution::TypedObject< double > dataMajorLen_;\n CSIRO::DataExecution::TypedObject< double > dataMinorLen_;\n CSIRO::DataExecution::TypedObject< double > dataAngle_;\n CSIRO::DataExecution::TypedObject< GDALDatasetH > dataBaseDataSet_;\n CSIRO::DataExecution::TypedObject< GDALDatasetH > dataOutputEllipse_;\n\t\tCSIRO::DataExecution::TypedObject< QString > dataOutputRasterName_;\n\t\tCSIRO::DataExecution::TypedObject< int > dataRasterBand_;\n\t\tCSIRO::DataExecution::TypedObject< double > dataVolume_;\n\n\n \/\/ Inputs and outputs\n CSIRO::DataExecution::InputScalar inputCenterX_;\n CSIRO::DataExecution::InputScalar inputCenterY_;\n CSIRO::DataExecution::InputScalar inputMajorLen_;\n CSIRO::DataExecution::InputScalar inputMinorLen_;\n CSIRO::DataExecution::InputScalar inputAngle_;\n CSIRO::DataExecution::InputScalar inputBaseDataSet_;\n\t\tCSIRO::DataExecution::InputScalar inputOutputRasterName_;\n\t\tCSIRO::DataExecution::Output outputOutputEllipse_;\n\t\tCSIRO::DataExecution::InputScalar inputRasterBand_;\n\t\tCSIRO::DataExecution::InputScalar inputVolume_;\n\n\n EllipticalPileImpl(EllipticalPile& op);\n\n bool execute();\n void logText(const QString& msg) { op_.logText(msg); }\n };\n\n\n \/**\n *\n *\/\n EllipticalPileImpl::EllipticalPileImpl(EllipticalPile& op) :\n op_(op),\n dataCenterX_(),\n dataCenterY_(),\n dataMajorLen_(),\n dataMinorLen_(),\n dataAngle_(),\n dataBaseDataSet_(),\n dataOutputEllipse_(),\n dataVolume_(),\n\t inputCenterX_(\"Center X\", dataCenterX_, op_),\n inputCenterY_(\"Center Y\", dataCenterY_, op_),\n inputMajorLen_(\"Major axis length\", dataMajorLen_, op_),\n inputMinorLen_(\"Minor axis length\", dataMinorLen_, op_),\n inputAngle_(\"Angle\", dataAngle_, op_),\n inputBaseDataSet_(\"BaseDataSet\", dataBaseDataSet_, op_),\n outputOutputEllipse_(\"Output Ellipse\", dataOutputEllipse_, op_),\n\t\tinputOutputRasterName_(\"Output Raster name\", dataOutputRasterName_, op_),\n\t\tinputRasterBand_(\"Raster Band\", dataRasterBand_, op_),\n inputVolume_(\"Target volume\", dataVolume_, op_)\n {\n \/\/ Make sure all of our inputs have data by default. If your operation accepts a\n \/\/ large data structure as input, you may wish to remove this call and replace it\n \/\/ with constructors for each input in the initialisation list above.\n op_.ensureHasData();\n\n \/\/ Recommend setting a description of the operation and each input \/ output here:\n \/\/ op_.setDescription(tr(\"My operation does this, that and this other thing.\"));\n \/\/ input_.setDescription(tr(\"Used for such and such.\"));\n \/\/ output_.setDescription(tr(\"Results of the blah-di-blah.\"));\n }\n\n\n \/**\n *\n *\/\n bool EllipticalPileImpl::execute()\n {\n double& centerX = *dataCenterX_;\n double& centerY = *dataCenterY_;\n double& majorLen = *dataMajorLen_;\n double& minorLen = *dataMinorLen_;\n double& angle = *dataAngle_;\n GDALDatasetH& baseDataSet = *dataBaseDataSet_;\n\t\tQString& outputRasterName = *dataOutputRasterName_;\n\t\tGDALDatasetH& outputEllipse = *dataOutputEllipse_;\n\t\tint& rasterBand = *dataRasterBand_;\n double& volume = *dataVolume_;\n \n\n\t\t\/\/Solve for max height of ellipse (h = 3*(2*Vol)\/(4*pi*a*b))\n\t\tdouble height = 3 * ((volume*2) \/ (4 * M_PI*majorLen*minorLen));\n\t\tstd::cout << QString(\"Maximum height of ellipse is %1 metres.\").arg(height) + \"\\n\";\n\n\t\t\/\/Start with the raster\n\t\tGDALRasterBandH hBand;\n\n\t\tif (rasterBand > GDALGetRasterCount(baseDataSet))\n\t\t{\n\t\t\tstd::cout << QString(\"ERROR: Not enough raster bands, number of bands is %1, band selected is %2\").arg(GDALGetRasterCount(baseDataSet)).arg(rasterBand) + \"\\n\";\n\t\t}\n\n\t\thBand = GDALGetRasterBand(baseDataSet, rasterBand);\n\n\t\t\/*\n\t\tCoefficients between Pixel Line and Projected (Yp, Xp space)\n\t\tXp = padfTransform[0] + P*padfTransform[1] + L*padfTransform[2];\n\t\tYp = padfTransform[3] + P*padfTransform[4] + L*padfTransform[5];\n\t\t*\/\n\t\t\n\t\t\/\/Get Transform and invert to get pixel\/line\n\t\tdouble transform[6], invTransform[6];\n\t\tGDALGetGeoTransform(baseDataSet, transform);\n\t\tGDALInvGeoTransform(transform, invTransform);\n\n\t\t\/\/Work out the pixel centre, pixel size of data\n\t\tcv::Point pixelCentre; \n\t\tpixelCentre.x = (int)floor(invTransform[0] + invTransform[1] * centerX + invTransform[2] * centerY);\n\t\tpixelCentre.y = (int)floor(invTransform[3] + invTransform[4] * centerX + invTransform[5] * centerY);\n\n\t\tcv::Size axes((int) floor(majorLen\/transform[1]),\n\t\t\t\t\t\t(int) floor(minorLen\/transform[1]));\n\n\n\t\t\/\/Nodata stuff\n\t\tint srcNoData;\n\t\tfloat srcNoDataValue;\n\t\tsrcNoDataValue = (float)GDALGetRasterNoDataValue(hBand, &srcNoData);\n\n\t\t\/\/Create elliptical raster array\n\t\tfloat * ellipseRaster;\n\t\tellipseRaster = new float[GDALGetRasterBandXSize(hBand)*GDALGetRasterBandYSize(hBand)];\n\n\t\t\n\t\t\/\/Convert float array to an openCV mat (assuming rows = Y)\n\t\tcv::Mat dataToMat(GDALGetRasterBandYSize(hBand), GDALGetRasterBandXSize(hBand), CV_32F, ellipseRaster);\n\t\t\t\t\t\n\t\t\/\/Create ellipse\n\t\tcv::ellipse(dataToMat,\n\t\t\tpixelCentre,\n\t\t\taxes,\n\t\t\tangle,\n\t\t\t0, 360,\n\t\t\tcv::Scalar(10.0), cv::FILLED);\n\n\n\t\t\n\t\tdouble radAngle = M_PI - (angle * DEG2RAD);\n\t\tdouble bigA, bigB, z;\n\t\tstd::cout << QString(\"Rotating ellipse by %1 radians.\").arg(radAngle) + \"\\n\";\n\n\t\t\/\/Loop through the Mat and set heights\n\t\tfor (int y = 0; y < dataToMat.rows; y++)\n\t\t{\n\t\t\tfor (int x = 0; x < dataToMat.cols; x++)\n\t\t\t{\n\t\t\t\tif (dataToMat.at<float>(y, x) > 0.0)\/\/value within ellipse\n\t\t\t\t{\n\t\t\t\t\t\/\/Work in cell coords\n\t\t\t\t\tdouble xdistance = abs(pixelCentre.x - x);\n\t\t\t\t\tdouble ydistance = abs(pixelCentre.y - y);\n\n\t\t\t\t\t\/\/Calculate values A and B (see http:\/\/math.stackexchange.com\/questions\/426150\/what-is-the-general-equation-of-the-ellipse-that-is-not-in-the-origin-and-rotate)\n\t\t\t\t\tbigA = pow(((xdistance)*cos(radAngle) + (ydistance)*sin(radAngle)), 2) \/ pow(axes.width, 2);\n\t\t\t\t\tbigB = pow(((xdistance)*sin(radAngle) + (ydistance)*cos(radAngle)), 2) \/ pow(axes.height, 2);\n\t\t\t\t\tz = sqrt(pow(height, 2)*(1 - bigA - bigB));\n\t\t\t\t\tdataToMat.at<float>(y, x) = (float)z;\n\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\t\/\/Now write to the new gdalDataset\n\n\t\toutputEllipse = GDALCreate(GDALGetDatasetDriver(baseDataSet),\n\t\t\toutputRasterName.toLocal8Bit().constData(),\n\t\t\tGDALGetRasterXSize(baseDataSet), GDALGetRasterYSize(baseDataSet),\n\t\t\t1,\n\t\t\tGDT_Float32, NULL);\n\n\t\tGDALRasterBandH destBand = GDALGetRasterBand(outputEllipse, 1);\n\t\tGDALSetGeoTransform(outputEllipse, transform);\n\t\tGDALSetProjection(outputEllipse, GDALGetProjectionRef(baseDataSet));\n\t\tGDALSetRasterNoDataValue(destBand, srcNoDataValue);\n\n\t\tCPLErr error;\n\t\terror = GDALRasterIO(destBand, GF_Write,\n\t\t\t0, 0,\n\t\t\tGDALGetRasterBandXSize(hBand), GDALGetRasterBandYSize(hBand),\n\t\t\tdataToMat.data,\n\t\t\tGDALGetRasterBandXSize(hBand), GDALGetRasterBandYSize(hBand),\n\t\t\tGDT_Float32,\n\t\t\t0, 0);\n\n\t\tif (error != CE_None)\n\t\t{\n\t\t\tstd::cout << QString(\"ERROR: GDALRasterIO write operation failed.\") + \"\\n\";\n\t\t}\n\n return true;\n }\n\n\n \/**\n *\n *\/\n EllipticalPile::EllipticalPile() :\n CSIRO::DataExecution::Operation(\n CSIRO::DataExecution::OperationFactoryTraits< EllipticalPile >::getInstance(),\n tr(\"Create Elliptical Pile\"))\n {\n pImpl_ = new EllipticalPileImpl(*this);\n }\n\n\n \/**\n *\n *\/\n EllipticalPile::~EllipticalPile()\n {\n delete pImpl_;\n }\n\n\n \/**\n *\n *\/\n bool EllipticalPile::execute()\n {\n return pImpl_->execute();\n }\n}\n\n\nusing namespace RF;\nDEFINE_WORKSPACE_OPERATION_FACTORY(EllipticalPile, \n RF::VolcanoPlugin::getInstance(),\n CSIRO::DataExecution::Operation::tr(\"Geospatial\"))\n\n<commit_msg>Made ellipse in any rotation working<commit_after>#include <cassert>\n#include <iostream>\n\n#include \"Workspace\/Application\/LanguageUtils\/streamqstring.h\"\n#include \"Workspace\/DataExecution\/DataObjects\/typedobject.h\"\n#include \"Workspace\/DataExecution\/InputOutput\/inputscalar.h\"\n#include \"Workspace\/DataExecution\/InputOutput\/inputarray.h\"\n#include \"Workspace\/DataExecution\/InputOutput\/output.h\"\n#include \"Workspace\/DataExecution\/Operations\/typedoperationfactory.h\"\n\n\/\/OpenCV core for ellipse\n#include \"opencv2\/imgproc.hpp\"\n#include \"qimage.h\"\n\n#include \"volcanoplugin.h\"\n#include \"ellipticalpile.h\"\n\n\nnamespace RF\n{\n \/**\n * \\internal\n *\/\n class EllipticalPileImpl\n {\n \/\/ Allow string translation to work properly\n Q_DECLARE_TR_FUNCTIONS(RF::EllipticalPileImpl)\n\n public:\n EllipticalPile& op_;\n\n \/\/ Data objects\n CSIRO::DataExecution::TypedObject< double > dataCenterX_;\n CSIRO::DataExecution::TypedObject< double > dataCenterY_;\n CSIRO::DataExecution::TypedObject< double > dataMajorLen_;\n CSIRO::DataExecution::TypedObject< double > dataMinorLen_;\n CSIRO::DataExecution::TypedObject< double > dataAngle_;\n CSIRO::DataExecution::TypedObject< GDALDatasetH > dataBaseDataSet_;\n CSIRO::DataExecution::TypedObject< GDALDatasetH > dataOutputEllipse_;\n\t\tCSIRO::DataExecution::TypedObject< QString > dataOutputRasterName_;\n\t\tCSIRO::DataExecution::TypedObject< int > dataRasterBand_;\n\t\tCSIRO::DataExecution::TypedObject< double > dataVolume_;\n\n\n \/\/ Inputs and outputs\n CSIRO::DataExecution::InputScalar inputCenterX_;\n CSIRO::DataExecution::InputScalar inputCenterY_;\n CSIRO::DataExecution::InputScalar inputMajorLen_;\n CSIRO::DataExecution::InputScalar inputMinorLen_;\n CSIRO::DataExecution::InputScalar inputAngle_;\n CSIRO::DataExecution::InputScalar inputBaseDataSet_;\n\t\tCSIRO::DataExecution::InputScalar inputOutputRasterName_;\n\t\tCSIRO::DataExecution::Output outputOutputEllipse_;\n\t\tCSIRO::DataExecution::InputScalar inputRasterBand_;\n\t\tCSIRO::DataExecution::InputScalar inputVolume_;\n\n\n EllipticalPileImpl(EllipticalPile& op);\n\n bool execute();\n void logText(const QString& msg) { op_.logText(msg); }\n };\n\n\n \/**\n *\n *\/\n EllipticalPileImpl::EllipticalPileImpl(EllipticalPile& op) :\n op_(op),\n dataCenterX_(),\n dataCenterY_(),\n dataMajorLen_(),\n dataMinorLen_(),\n dataAngle_(),\n dataBaseDataSet_(),\n dataOutputEllipse_(),\n dataVolume_(),\n\t inputCenterX_(\"Center X\", dataCenterX_, op_),\n inputCenterY_(\"Center Y\", dataCenterY_, op_),\n inputMajorLen_(\"Major axis length\", dataMajorLen_, op_),\n inputMinorLen_(\"Minor axis length\", dataMinorLen_, op_),\n inputAngle_(\"Angle\", dataAngle_, op_),\n inputBaseDataSet_(\"BaseDataSet\", dataBaseDataSet_, op_),\n outputOutputEllipse_(\"Output Ellipse\", dataOutputEllipse_, op_),\n\t\tinputOutputRasterName_(\"Output Raster name\", dataOutputRasterName_, op_),\n\t\tinputRasterBand_(\"Raster Band\", dataRasterBand_, op_),\n inputVolume_(\"Target volume\", dataVolume_, op_)\n {\n \/\/ Make sure all of our inputs have data by default. If your operation accepts a\n \/\/ large data structure as input, you may wish to remove this call and replace it\n \/\/ with constructors for each input in the initialisation list above.\n op_.ensureHasData();\n\n \/\/ Recommend setting a description of the operation and each input \/ output here:\n \/\/ op_.setDescription(tr(\"My operation does this, that and this other thing.\"));\n \/\/ input_.setDescription(tr(\"Used for such and such.\"));\n \/\/ output_.setDescription(tr(\"Results of the blah-di-blah.\"));\n }\n\n\n \/**\n *\n *\/\n bool EllipticalPileImpl::execute()\n {\n double& centerX = *dataCenterX_;\n double& centerY = *dataCenterY_;\n double& majorLen = *dataMajorLen_;\n double& minorLen = *dataMinorLen_;\n double& angle = *dataAngle_;\n GDALDatasetH& baseDataSet = *dataBaseDataSet_;\n\t\tQString& outputRasterName = *dataOutputRasterName_;\n\t\tGDALDatasetH& outputEllipse = *dataOutputEllipse_;\n\t\tint& rasterBand = *dataRasterBand_;\n double& volume = *dataVolume_;\n \n\n\t\t\/\/Solve for max height of ellipse (h = 3*(2*Vol)\/(4*pi*a*b))\n\t\tdouble height = 3 * ((volume*2) \/ (4 * M_PI*majorLen*minorLen));\n\t\tstd::cout << QString(\"Maximum height of ellipse is %1 metres.\").arg(height) + \"\\n\";\n\n\t\t\/\/Start with the raster\n\t\tGDALRasterBandH hBand;\n\n\t\tif (rasterBand > GDALGetRasterCount(baseDataSet))\n\t\t{\n\t\t\tstd::cout << QString(\"ERROR: Not enough raster bands, number of bands is %1, band selected is %2\").arg(GDALGetRasterCount(baseDataSet)).arg(rasterBand) + \"\\n\";\n\t\t}\n\n\t\thBand = GDALGetRasterBand(baseDataSet, rasterBand);\n\n\t\t\n\t\t\/*\n\t\tCoefficients between Pixel Line and Projected (Yp, Xp space)\n\t\tXp = padfTransform[0] + P*padfTransform[1] + L*padfTransform[2];\n\t\tYp = padfTransform[3] + P*padfTransform[4] + L*padfTransform[5];\n\t\t*\/\n\t\t\n\t\t\/\/Get Transform and invert to get pixel\/line\n\t\tdouble transform[6], invTransform[6];\n\t\tGDALGetGeoTransform(baseDataSet, transform);\n\t\tGDALInvGeoTransform(transform, invTransform);\n\n\t\t\/\/Work out the pixel centre, pixel size of data\n\t\tcv::Point pixelCentre; \n\t\tpixelCentre.x = (int)floor(invTransform[0] + invTransform[1] * centerX + invTransform[2] * centerY);\n\t\tpixelCentre.y = (int)floor(invTransform[3] + invTransform[4] * centerX + invTransform[5] * centerY);\n\n\t\tcv::Size axes((int) floor(majorLen\/transform[1]),\n\t\t\t\t\t\t(int) floor(minorLen\/transform[1]));\n\n\n\t\t\/\/Nodata stuff\n\t\tint srcNoData;\n\t\tfloat srcNoDataValue;\n\t\tsrcNoDataValue = (float)GDALGetRasterNoDataValue(hBand, &srcNoData);\n\n\t\t\/\/Create elliptical raster array\n\t\tfloat * ellipseRaster;\n\t\tellipseRaster = new float[GDALGetRasterBandXSize(hBand)*GDALGetRasterBandYSize(hBand)];\n\n\t\t\n\t\t\/\/Convert float array to an openCV mat (assuming rows = Y)\n\t\tcv::Mat dataToMat(GDALGetRasterBandYSize(hBand), GDALGetRasterBandXSize(hBand), CV_32F, ellipseRaster);\n\t\t\t\t\t\n\t\t\/\/Create ellipse\n\t\tcv::ellipse(dataToMat,\n\t\t\tpixelCentre,\n\t\t\taxes,\n\t\t\tangle,\n\t\t\t0, 360,\n\t\t\tcv::Scalar(10.0), cv::FILLED);\n\n\n\t\t\n\t\tdouble radAngle = (angle * DEG2RAD);\n\t\tdouble bigA, bigB, z;\n\t\tstd::cout << QString(\"Rotating ellipse by %1 radians.\").arg(radAngle) + \"\\n\";\n\n\t\t\/\/Loop through the Mat and set heights\n\t\tfor (int y = 0; y < dataToMat.rows; y++)\n\t\t{\n\t\t\tfor (int x = 0; x < dataToMat.cols; x++)\n\t\t\t{\n\t\t\t\tif (dataToMat.at<float>(y, x) > 0.0)\/\/value within ellipse\n\t\t\t\t{\n\t\t\t\t\t\/\/Work in cell coords\n\t\t\t\t\tdouble xdistance = (pixelCentre.x - x);\n\t\t\t\t\tdouble ydistance = (pixelCentre.y - y);\n\n\t\t\t\t\t\/\/Calculate values A and B (Rotation of coordinates (xcos(t)+ysin(t),(ycos(t)-xsin(t))\n\t\t\t\t\tbigA = pow(((xdistance)*cos(radAngle) + (ydistance)*sin(radAngle)), 2) \/ pow(axes.width, 2);\n\t\t\t\t\tbigB = pow(((ydistance)*cos(radAngle) - (xdistance)*sin(radAngle)), 2) \/ pow(axes.height, 2);\n\t\t\t\t\tz = sqrt(pow(height, 2)*(1 - bigA - bigB));\n\t\t\t\t\tdataToMat.at<float>(y, x) = (float)z;\n\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\t\/\/Now write to the new gdalDataset\n\n\t\toutputEllipse = GDALCreate(GDALGetDatasetDriver(baseDataSet),\n\t\t\toutputRasterName.toLocal8Bit().constData(),\n\t\t\tGDALGetRasterXSize(baseDataSet), GDALGetRasterYSize(baseDataSet),\n\t\t\t1,\n\t\t\tGDT_Float32, NULL);\n\n\t\tGDALRasterBandH destBand = GDALGetRasterBand(outputEllipse, 1);\n\t\tGDALSetGeoTransform(outputEllipse, transform);\n\t\tGDALSetProjection(outputEllipse, GDALGetProjectionRef(baseDataSet));\n\t\tGDALSetRasterNoDataValue(destBand, srcNoDataValue);\n\n\t\tCPLErr error;\n\t\terror = GDALRasterIO(destBand, GF_Write,\n\t\t\t0, 0,\n\t\t\tGDALGetRasterBandXSize(hBand), GDALGetRasterBandYSize(hBand),\n\t\t\tdataToMat.data,\n\t\t\tGDALGetRasterBandXSize(hBand), GDALGetRasterBandYSize(hBand),\n\t\t\tGDT_Float32,\n\t\t\t0, 0);\n\n\t\tif (error != CE_None)\n\t\t{\n\t\t\tstd::cout << QString(\"ERROR: GDALRasterIO write operation failed.\") + \"\\n\";\n\t\t}\n\n return true;\n }\n\n\n \/**\n *\n *\/\n EllipticalPile::EllipticalPile() :\n CSIRO::DataExecution::Operation(\n CSIRO::DataExecution::OperationFactoryTraits< EllipticalPile >::getInstance(),\n tr(\"Create Elliptical Pile\"))\n {\n pImpl_ = new EllipticalPileImpl(*this);\n }\n\n\n \/**\n *\n *\/\n EllipticalPile::~EllipticalPile()\n {\n delete pImpl_;\n }\n\n\n \/**\n *\n *\/\n bool EllipticalPile::execute()\n {\n return pImpl_->execute();\n }\n}\n\n\nusing namespace RF;\nDEFINE_WORKSPACE_OPERATION_FACTORY(EllipticalPile, \n RF::VolcanoPlugin::getInstance(),\n CSIRO::DataExecution::Operation::tr(\"Geospatial\"))\n\n<|endoftext|>"} {"text":"<commit_before>#include <fstream>\n#include <iostream>\n#include <math.h>\n#include <opencv2\/core\/core.hpp>\n#include <opencv2\/highgui\/highgui.hpp>\n#include <opencv2\/imgproc\/imgproc.hpp>\n\nusing namespace cv;\nusing namespace std;\n\nconst double PI = 3.1415926536;\nconst int angle2step = 120;\n\ntypedef struct angles {\n float a;\n float b;\n float r;\n} angles;\n\ntypedef struct xyz {\n float x;\n float y;\n float z;\n} xyz;\n\nangles cal_angle(xyz coord);\nstring f_dirsteps(xyz curr, xyz next);\nstring num2str(int i);\nvoid gen_coord(string file_path);\nxyz find_dot(xyz circle, int *cp_img, int width, int height);\n\nint main() {\n gen_coord(\"..\/data\/img\/sketch.jpg\");\n return 0;\n}\n\nvoid gen_coord(string file_path) {\n Mat src = imread(file_path, 1);\n ofstream out(\"out.txt\");\n int width = src.cols;\n int height = src.rows;\n int cp_img[height][width];\n\n for (int h = 0; h < height; h++) {\n uchar *P = src.ptr<uchar>(h);\n for (int w = 0; w < width; w++) {\n cp_img[h][w] = P[w];\n }\n }\n xyz center = {0, 0, 0};\n xyz next_center = {-1, -1, -1};\n int find_tag = 0;\n for (int h = 0; h < height; h++) {\n for (int w = 0; w < width; w++) {\n if (cp_img[h][w] == 255) {\n center = {w, h, 0};\n find_tag = 1;\n break;\n }\n }\n if (find_tag == 1)\n break;\n }\n\n while (1) {\n next_center = find_dot(center, (int *)cp_img, width, height);\n if (next_center.z == -1)\n break;\n if (next_center.z > 3) {\n xyz temp1 = center;\n temp1.z = 1;\n f_dirsteps(center, temp1);\n next_center.z = 1;\n xyz temp2 = next_center;\n f_dirsteps(temp1, temp2);\n next_center.z = 0;\n f_dirsteps(temp2, next_center);\n center = next_center;\n } else {\n next_center.z = 0;\n f_dirsteps(center, next_center);\n center = next_center;\n }\n cp_img[int(center.y)][int(center.x)] = 0;\n }\n out.close();\n}\n\nxyz find_dot(xyz center, int *cp_img, int width, int height) {\n int x = center.x;\n int y = center.y;\n xyz next_dot;\n int map[height][width];\n for (int h = 0; h < height; h++) {\n for (int w = 0; w < width; w++) {\n map[h][w] = *(cp_img + width * h + w);\n }\n }\n int max_cr = max(max(max(x, y), abs(x - width - 1)), abs(y - height - 1));\n for (int cr = 1; cr < max_cr + 1; cr++) { \/\/分层找点\n for (int dn = -cr + 1; dn < cr + 1; dn++) { \/\/下面的边\n if (y + cr + 1 > height)\n break;\n if (x + dn < 0)\n continue;\n if (x + dn + 1 > width)\n break;\n if (!map[x + dn][y + cr]) {\n next_dot = {x + dn, y + cr, cr};\n map[x + dn][y + cr] = 0;\n return next_dot;\n }\n }\n\n for (int rt = -cr + 1; rt < cr + 1; rt++) { \/\/右面的边\n if (x + cr + 1 > width)\n break;\n if (y - rt + 1 > height)\n continue;\n if (y - rt < 0)\n break;\n if (!map[x + cr][y - rt]) {\n next_dot = {x + cr, y - rt, cr};\n map[x + cr][y - rt] = 0;\n return next_dot;\n }\n }\n\n for (int up = -cr + 1; up < cr + 1; up++) { \/\/上面的边\n if (y - cr < 0)\n break;\n if (x - up + 1 > width)\n continue;\n if (x - up < 0)\n break;\n if (!map[x - up][y - cr]) {\n next_dot = {x - up, y - cr, cr};\n map[x - up][y - cr] = 0;\n return next_dot;\n }\n }\n\n for (int lt = -cr + 1; lt < cr + 1; lt++) { \/\/左面的边\n if (x - cr < 0)\n break;\n if (y + lt < 0)\n continue;\n if (y + lt + 1 > height)\n break;\n if (!map[x - cr][y + lt]) {\n next_dot = {x - cr, y + lt, cr};\n map[x - cr][y + lt] = 0;\n return next_dot;\n }\n }\n }\n next_dot = {-1, -1, -1};\n return next_dot;\n}\n\nangles cal_angle(xyz coord) {\n float p = 0.0;\n angles angle;\n p = sqrt(coord.x * coord.x + coord.y * coord.y + coord.z * coord.z);\n if (coord.x <= 0)\n angle.a = asin(-coord.y \/ sqrt(coord.x * coord.x + coord.y * coord.y)) *\n 180 \/ PI;\n else\n angle.a = asin(coord.y \/ sqrt(coord.x * coord.x + coord.y * coord.y)) *\n 180 \/ PI +\n 180;\n\n coord.y = coord.y + 80 * sin(angle.a);\n coord.x = coord.x + 80 * cos(angle.a);\n p = sqrt(coord.x * coord.x + coord.y * coord.y + coord.z * coord.z);\n if (coord.x <= 0)\n angle.a = asin(-coord.y \/ sqrt(coord.x * coord.x + coord.y * coord.y)) *\n 180 \/ PI;\n else\n angle.a = asin(coord.y \/ sqrt(coord.x * coord.x + coord.y * coord.y)) *\n 180 \/ PI +\n 180;\n\n angle.b = (acos((45 \/ p) + (p \/ 500)) + asin(-coord.z \/ p)) * 180 \/ PI;\n angle.r =\n (acos((p * p - 22500) \/ (400 * p)) + acos(-coord.z \/ p)) * 180 \/ PI;\n\n return angle;\n}\n\nstring f_dirsteps(xyz curr, xyz next) {\n string fpath = \"$\";\n angles curr_angles = cal_angle(curr);\n angles next_angles = cal_angle(next);\n float angle_a = next_angles.a - curr_angles.a;\n float angle_b = next_angles.b - curr_angles.b;\n float angle_r = next_angles.r - curr_angles.r;\n if (angle_a > 0)\n fpath = fpath + \"1\" + num2str(round(angle_a * angle2step)) + \"#\";\n else\n fpath = fpath + \"0\" + num2str(round(-angle_a * angle2step)) + \"#\";\n\n if (angle_b > 0)\n fpath = fpath + \"1\" + num2str(round(angle_b * angle2step)) + \"#\";\n else\n fpath = fpath + \"0\" + num2str(round(-angle_b * angle2step)) + \"#\";\n\n if (angle_r > 0)\n fpath = fpath + \"1\" + num2str(round(angle_r * angle2step)) + \"#\";\n else\n fpath = fpath + \"0\" + num2str(round(-angle_r * angle2step)) + \"#\";\n\n fpath = fpath + \"@\";\n return fpath;\n}\n\nstring num2str(int i) {\n stringstream ss;\n ss << i;\n return ss.str();\n}\n<commit_msg>a completed program for generate steps and dirrection<commit_after>#include <fstream>\n#include <iostream>\n#include <math.h>\n#include <opencv2\/core\/core.hpp>\n#include <opencv2\/highgui\/highgui.hpp>\n#include <opencv2\/imgproc\/imgproc.hpp>\n\nusing namespace cv;\nusing namespace std;\n\nconst double PI = 3.1415926535897932384626433832795;\nconst float angle2step = 6875.4935;\nconst float std_z = -260;\n\ntypedef struct angles {\n float a;\n float b;\n float r;\n} angles;\n\ntypedef struct xyz {\n float x;\n float y;\n float z;\n} xyz;\n\nangles cal_angle(xyz coord);\nstring f_dirsteps(xyz curr, xyz next);\nstring num2str(int i);\nvoid gen_coord(string file_path);\nxyz find_dot(xyz circle, int *cp_img, int width, int height);\nxyz convert_coord(xyz origin_coord, int width, int height);\n\nxyz init_coord = {280, 0, -250};\n\nint main() {\n gen_coord(\"..\/data\/img\/sketch.jpg\");\n return 0;\n}\n\nvoid gen_coord(string file_path) {\n Mat src = imread(file_path, 1);\n ofstream out(\"out.txt\");\n int width = src.cols;\n int height = src.rows;\n int cp_img[height][width];\n\n for (int h = 0; h < height; h++) {\n uchar *P = src.ptr<uchar>(h);\n for (int w = 0; w < width; w++) {\n cp_img[h][w] = P[w];\n }\n }\n xyz center = {0, 0, 0};\n xyz next_center = {-1, -1, -1};\n int find_tag = 0;\n for (int h = 0; h < height; h++) {\n for (int w = 0; w < width; w++) {\n if (cp_img[h][w] == 255) {\n center = {w, h, 1};\n find_tag = 1;\n break;\n }\n }\n if (find_tag == 1)\n break;\n }\n\n f_dirsteps(init_coord, convert_coord(center, width, height));\n center.z = 0;\n while (1) {\n next_center = find_dot(center, (int *)cp_img, width, height);\n if (next_center.z == -1)\n break;\n if (next_center.z > 3) {\n xyz temp1 = center;\n temp1.z = 1;\n f_dirsteps(convert_coord(center, width, height),\n convert_coord(temp1, width, height));\n next_center.z = 1;\n xyz temp2 = next_center;\n f_dirsteps(convert_coord(temp1, width, height),\n convert_coord(temp2, width, height));\n next_center.z = 0;\n f_dirsteps(convert_coord(temp2, width, height),\n convert_coord(next_center, width, height));\n } else {\n next_center.z = 0;\n f_dirsteps(convert_coord(center, width, height),\n convert_coord(next_center, width, height));\n }\n cp_img[int(center.y)][int(center.x)] = 0;\n center = next_center;\n }\n next_center = center;\n next_center.z = 1;\n f_dirsteps(convert_coord(center, width, height),\n convert_coord(next_center, width, height));\n f_dirsteps(convert_coord(next_center, width, height), init_coord);\n out.close();\n}\n\nxyz find_dot(xyz center, int *cp_img, int width, int height) {\n int x = center.x;\n int y = center.y;\n xyz next_dot;\n int map[height][width];\n for (int h = 0; h < height; h++) {\n for (int w = 0; w < width; w++) {\n map[h][w] = *(cp_img + width * h + w);\n }\n }\n int max_cr = max(max(max(x, y), abs(x - width - 1)), abs(y - height - 1));\n for (int cr = 1; cr < max_cr + 1; cr++) { \/\/分层找点\n for (int dn = -cr + 1; dn < cr + 1; dn++) { \/\/下面的边\n if (y + cr + 1 > height)\n break;\n if (x + dn < 0)\n continue;\n if (x + dn + 1 > width)\n break;\n if (!map[x + dn][y + cr]) {\n next_dot = {x + dn, y + cr, cr};\n map[x + dn][y + cr] = 0;\n return next_dot;\n }\n }\n\n for (int rt = -cr + 1; rt < cr + 1; rt++) { \/\/右面的边\n if (x + cr + 1 > width)\n break;\n if (y - rt + 1 > height)\n continue;\n if (y - rt < 0)\n break;\n if (!map[x + cr][y - rt]) {\n next_dot = {x + cr, y - rt, cr};\n map[x + cr][y - rt] = 0;\n return next_dot;\n }\n }\n\n for (int up = -cr + 1; up < cr + 1; up++) { \/\/上面的边\n if (y - cr < 0)\n break;\n if (x - up + 1 > width)\n continue;\n if (x - up < 0)\n break;\n if (!map[x - up][y - cr]) {\n next_dot = {x - up, y - cr, cr};\n map[x - up][y - cr] = 0;\n return next_dot;\n }\n }\n\n for (int lt = -cr + 1; lt < cr + 1; lt++) { \/\/左面的边\n if (x - cr < 0)\n break;\n if (y + lt < 0)\n continue;\n if (y + lt + 1 > height)\n break;\n if (!map[x - cr][y + lt]) {\n next_dot = {x - cr, y + lt, cr};\n map[x - cr][y + lt] = 0;\n return next_dot;\n }\n }\n }\n next_dot = {-1, -1, -1};\n return next_dot;\n}\n\nangles cal_angle(xyz coord) {\n float p = 0.0;\n angles angle;\n if (coord.x >= 0)\n angle.a = asin(coord.y \/ sqrt(coord.x * coord.x + coord.y * coord.y));\n else\n angle.a =\n asin(-coord.y \/ sqrt(coord.x * coord.x + coord.y * coord.y)) - PI;\n\n coord.y = coord.y - 80 * sin(angle.a);\n coord.x = coord.x - 80 * cos(angle.a);\n p = sqrt(coord.x * coord.x + coord.y * coord.y + coord.z * coord.z);\n angle.b = (acos((45 \/ p) + (p \/ 500)) + asin(-coord.z \/ p));\n angle.r = (acos((p * p - 22500) \/ (400 * p)) + acos(-coord.z \/ p));\n\n return angle;\n}\n\nstring f_dirsteps(xyz curr, xyz next) {\n string fpath = \"$\";\n angles curr_angles = cal_angle(curr);\n angles next_angles = cal_angle(next);\n float angle_a = next_angles.a - curr_angles.a;\n float angle_b = next_angles.b - curr_angles.b;\n float angle_r = next_angles.r - curr_angles.r;\n\n if (angle_a >= 0)\n fpath = fpath + \"1\" + num2str(round(angle_a * angle2step)) + \"#\";\n else\n fpath = fpath + \"0\" + num2str(round(-angle_a * angle2step)) + \"#\";\n\n if (angle_b >= 0)\n fpath = fpath + \"1\" + num2str(round(angle_b * angle2step)) + \"#\";\n else\n fpath = fpath + \"0\" + num2str(round(-angle_b * angle2step)) + \"#\";\n\n if (angle_r >= 0)\n fpath = fpath + \"1\" + num2str(round(angle_r * angle2step)) + \"#\";\n else\n fpath = fpath + \"0\" + num2str(round(-angle_r * angle2step)) + \"#\";\n\n fpath = fpath + \"@\";\n return fpath;\n}\n\nstring num2str(int i) {\n stringstream ss;\n ss << i;\n return ss.str();\n}\n\nxyz convert_coord(xyz origin_coord, int width, int height) {\n xyz cvt_coord;\n int std_width = 7 * width;\n int std_height = 10 * height;\n float ratio;\n if (width >= height) {\n if (std_width < std_height) {\n ratio = 210.0 \/ height;\n cvt_coord.x = 330 - int(origin_coord.y * ratio);\n cvt_coord.y = (50 - (300 - int(origin_coord.x * ratio)) \/ 2) -\n int(origin_coord.x * ratio);\n cvt_coord.z = std_z - 30 * origin_coord.z;\n } else {\n ratio = 300.0 \/ width;\n cvt_coord.x = (330 - (210 - int(origin_coord.y * ratio)) \/ 2) -\n int(origin_coord.y * ratio);\n cvt_coord.y = 50 - int(origin_coord.x * ratio);\n cvt_coord.z = std_z - 30 * origin_coord.z;\n }\n } else {\n if (std_width < std_height) {\n ratio = 300.0 \/ height;\n cvt_coord.x = (120 + (210 - int(origin_coord.x * ratio)) \/ 2) +\n int(origin_coord.x * ratio);\n cvt_coord.y = 50 - int(origin_coord.y * ratio);\n cvt_coord.z = std_z - 30 * origin_coord.z;\n } else {\n ratio = 210.0 \/ width;\n cvt_coord.x = 120 + int(origin_coord.x * ratio);\n cvt_coord.y = (50 - (300 - int(origin_coord.y * ratio)) \/ 2) +\n int(origin_coord.y * ratio);\n cvt_coord.z = std_z - 30 * origin_coord.z;\n }\n }\n return cvt_coord;\n}<|endoftext|>"} {"text":"<commit_before>#include \"tcpserver.h\"\n\n#include <algorithm>\n#include <errno.h>\n#include <sys\/types.h>\n#include <sys\/wait.h>\n#include <signal.h>\n#include <assert.h>\n#include <time.h>\n\n#include \"address.h\"\n#include \"sockutil.h\"\n#include \"log.h\"\n#include \"acceptor.h\"\n#include \"connection.h\"\n#include \"ioloop.h\"\n#include \"signaler.h\"\n#include \"timer.h\"\n#include \"process.h\"\n#include \"timingwheel.h\"\n\nusing namespace std;\n\nnamespace tnet\n{\n const int defaultIdleTimeout = 120;\n\n void dummyRunCallback(IOLoop*)\n {\n }\n\n TcpServer::TcpServer()\n : m_loop(0)\n {\n m_process = std::make_shared<Process>();\n \n m_running = false;\n \n m_maxIdleTimeout = defaultIdleTimeout;\n\n m_runCallback = std::bind(&dummyRunCallback, _1);\n }\n \n TcpServer::~TcpServer()\n {\n if(m_loop)\n {\n delete m_loop;\n }\n }\n\n int TcpServer::listen(const Address& addr, const ConnEventCallback_t& callback)\n {\n LOG_INFO(\"listen %s:%d\", addr.ipstr().c_str(), addr.port());\n NewConnCallback_t cb = std::bind(&TcpServer::onNewConnection, this, _1, _2, callback);\n AcceptorPtr_t acceptor = std::make_shared<Acceptor>(cb);\n if(acceptor->listen(addr) < 0)\n {\n return -1; \n } \n\n m_acceptors.push_back(acceptor);\n return 0;\n }\n\n void TcpServer::run()\n {\n if(m_running)\n {\n return; \n }\n\n m_loop = new IOLoop();\n \n m_running = true;\n \n \n m_loop->addCallback(std::bind(&TcpServer::onRun, this));\n\n m_loop->start();\n }\n\n void TcpServer::onRun()\n {\n LOG_INFO(\"tcp server on run\");\n \n for_each(m_acceptors.begin(), m_acceptors.end(), \n std::bind(&Acceptor::start, _1, m_loop));\n\n vector<int> signums{SIGINT, SIGTERM};\n m_signaler = std::make_shared<Signaler>(signums, std::bind(&TcpServer::onSignal, this, _1, _2)); \n \n m_signaler->start(m_loop);\n\n m_idleWheel = std::make_shared<TimingWheel>(1000, 3600);\n\n m_idleWheel->start(m_loop);\n\n m_runCallback(m_loop);\n }\n\n void TcpServer::start(size_t maxProcess)\n {\n if(maxProcess > 1)\n {\n m_process->wait(maxProcess, std::bind(&TcpServer::run, this)); \n }\n else\n {\n run();\n }\n } \n\n void TcpServer::onStop()\n {\n LOG_INFO(\"tcp server on stop\");\n if(!m_running)\n {\n return; \n }\n\n m_running = false;\n\n m_idleWheel->stop();\n\n m_signaler->stop();\n \n for_each_all(m_acceptors, std::bind(&Acceptor::stop, _1));\n \n m_loop->stop(); \n }\n\n void TcpServer::stop()\n {\n LOG_INFO(\"stop server\");\n m_process->stop(); \n\n onStop();\n }\n\n void TcpServer::onNewConnection(IOLoop* loop, int fd, const ConnEventCallback_t& callback)\n {\n ConnectionPtr_t conn = std::make_shared<Connection>(loop, fd);\n \n conn->setEventCallback(callback);\n\n conn->onEstablished();\n\n \/\/check interval is (maxIdleTimeout * 9 \/ 10) * 1000\n m_idleWheel->add(std::bind(&TcpServer::onIdleConnCheck, this, _1, WeakConnectionPtr_t(conn)), m_maxIdleTimeout * 900);\n\n return;\n }\n\n void TcpServer::onIdleConnCheck(const TimingWheelPtr_t& wheel, const WeakConnectionPtr_t& conn)\n {\n ConnectionPtr_t c = conn.lock();\n if(!c)\n {\n return;\n } \n \n struct timespec t;\n clock_gettime(CLOCK_MONOTONIC, &t);\n uint64_t now = t.tv_sec;\n\n if(now - c->lastActiveTime() > (uint64_t)m_maxIdleTimeout)\n {\n LOG_INFO(\"timeout, force shutdown\");\n c->shutDown();\n }\n else\n { \n m_idleWheel->add(std::bind(&TcpServer::onIdleConnCheck, this, _1, WeakConnectionPtr_t(c)), m_maxIdleTimeout * 900);\n }\n }\n\n void TcpServer::onSignal(const SignalerPtr_t& signaler, int signum)\n {\n switch(signum)\n {\n case SIGINT:\n case SIGTERM:\n {\n onStop();\n }\n break;\n default:\n LOG_ERROR(\"invalid signal %d\", signum);\n break;\n } \n }\n}\n<commit_msg>change first idle check time, using random to scatter<commit_after>#include \"tcpserver.h\"\n\n#include <algorithm>\n#include <errno.h>\n#include <sys\/types.h>\n#include <sys\/wait.h>\n#include <signal.h>\n#include <assert.h>\n#include <time.h>\n#include <stdlib.h>\n\n#include \"address.h\"\n#include \"sockutil.h\"\n#include \"log.h\"\n#include \"acceptor.h\"\n#include \"connection.h\"\n#include \"ioloop.h\"\n#include \"signaler.h\"\n#include \"timer.h\"\n#include \"process.h\"\n#include \"timingwheel.h\"\n\nusing namespace std;\n\nnamespace tnet\n{\n const int defaultIdleTimeout = 120;\n\n void dummyRunCallback(IOLoop*)\n {\n }\n\n TcpServer::TcpServer()\n : m_loop(0)\n {\n m_process = std::make_shared<Process>();\n \n m_running = false;\n \n m_maxIdleTimeout = defaultIdleTimeout;\n\n m_runCallback = std::bind(&dummyRunCallback, _1);\n }\n \n TcpServer::~TcpServer()\n {\n if(m_loop)\n {\n delete m_loop;\n }\n }\n\n int TcpServer::listen(const Address& addr, const ConnEventCallback_t& callback)\n {\n LOG_INFO(\"listen %s:%d\", addr.ipstr().c_str(), addr.port());\n NewConnCallback_t cb = std::bind(&TcpServer::onNewConnection, this, _1, _2, callback);\n AcceptorPtr_t acceptor = std::make_shared<Acceptor>(cb);\n if(acceptor->listen(addr) < 0)\n {\n return -1; \n } \n\n m_acceptors.push_back(acceptor);\n return 0;\n }\n\n void TcpServer::run()\n {\n if(m_running)\n {\n return; \n }\n\n m_loop = new IOLoop();\n \n m_running = true;\n \n \n m_loop->addCallback(std::bind(&TcpServer::onRun, this));\n\n m_loop->start();\n }\n\n void TcpServer::onRun()\n {\n LOG_INFO(\"tcp server on run\");\n \n for_each(m_acceptors.begin(), m_acceptors.end(), \n std::bind(&Acceptor::start, _1, m_loop));\n\n vector<int> signums{SIGINT, SIGTERM};\n m_signaler = std::make_shared<Signaler>(signums, std::bind(&TcpServer::onSignal, this, _1, _2)); \n \n m_signaler->start(m_loop);\n\n m_idleWheel = std::make_shared<TimingWheel>(1000, 3600);\n\n m_idleWheel->start(m_loop);\n\n m_runCallback(m_loop);\n }\n\n void TcpServer::start(size_t maxProcess)\n {\n if(maxProcess > 1)\n {\n m_process->wait(maxProcess, std::bind(&TcpServer::run, this)); \n }\n else\n {\n run();\n }\n } \n\n void TcpServer::onStop()\n {\n LOG_INFO(\"tcp server on stop\");\n if(!m_running)\n {\n return; \n }\n\n m_running = false;\n\n m_idleWheel->stop();\n\n m_signaler->stop();\n \n for_each_all(m_acceptors, std::bind(&Acceptor::stop, _1));\n \n m_loop->stop(); \n }\n\n void TcpServer::stop()\n {\n LOG_INFO(\"stop server\");\n m_process->stop(); \n\n onStop();\n }\n\n void TcpServer::onNewConnection(IOLoop* loop, int fd, const ConnEventCallback_t& callback)\n {\n ConnectionPtr_t conn = std::make_shared<Connection>(loop, fd);\n \n conn->setEventCallback(callback);\n\n conn->onEstablished();\n\n int afterCheck = m_maxIdleTimeout \/ 2 + random() % m_maxIdleTimeout;\n m_idleWheel->add(std::bind(&TcpServer::onIdleConnCheck, this, _1, WeakConnectionPtr_t(conn)), afterCheck * 1000);\n\n return;\n }\n\n void TcpServer::onIdleConnCheck(const TimingWheelPtr_t& wheel, const WeakConnectionPtr_t& conn)\n {\n ConnectionPtr_t c = conn.lock();\n if(!c)\n {\n return;\n } \n \n struct timespec t;\n clock_gettime(CLOCK_MONOTONIC, &t);\n uint64_t now = t.tv_sec;\n\n if(now - c->lastActiveTime() > (uint64_t)m_maxIdleTimeout)\n {\n LOG_INFO(\"timeout, force shutdown\");\n c->shutDown();\n }\n else\n { \n \/\/check interval is (maxIdleTimeout * 9 \/ 10) * 1000\n m_idleWheel->add(std::bind(&TcpServer::onIdleConnCheck, this, _1, WeakConnectionPtr_t(c)), m_maxIdleTimeout * 900);\n }\n }\n\n void TcpServer::onSignal(const SignalerPtr_t& signaler, int signum)\n {\n switch(signum)\n {\n case SIGINT:\n case SIGTERM:\n {\n onStop();\n }\n break;\n default:\n LOG_ERROR(\"invalid signal %d\", signum);\n break;\n } \n }\n}\n<|endoftext|>"} {"text":"<commit_before>\/*\nCopyright libCellML Contributors\n\nLicensed under the Apache License, Version 2.0 (the \"License\");\nyou may not use this file except in compliance with the License.\nYou may obtain a copy of the License at\n\n http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n\nUnless required by applicable law or agreed to in writing, software\ndistributed under the License is distributed on an \"AS IS\" BASIS,\nWITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\nSee the License for the specific language governing permissions and\nlimitations under the License.\n*\/\n\n#include \"xmldoc.h\"\n\n#include \"libcellml\/component.h\"\n#include \"libcellml\/generator.h\"\n#include \"libcellml\/model.h\"\n#include \"libcellml\/validator.h\"\n\n#include <vector>\n\nnamespace libcellml{\n\nstruct GeneratorVariable\n{\n};\n\ntypedef std::shared_ptr<GeneratorVariable> GeneratorVariablePtr;\n\nstruct Generator::GeneratorImpl\n{\n bool mWithNames;\n\n std::vector<GeneratorVariablePtr> mStates;\n std::vector<GeneratorVariablePtr> mVariables;\n\n void processNode(const XmlNodePtr &node);\n};\n\nvoid Generator::GeneratorImpl::processNode(const XmlNodePtr &node)\n{\n(void) node;\n\n\/\/TODO\n}\n\nGenerator::Generator()\n : mPimpl(new GeneratorImpl())\n{\n}\n\nGenerator::~Generator()\n{\n delete mPimpl;\n}\n\nGenerator::Generator(const Generator &rhs)\n : Logger(rhs)\n , mPimpl(new GeneratorImpl())\n{\n mPimpl->mStates = rhs.mPimpl->mStates;\n mPimpl->mVariables = rhs.mPimpl->mVariables;\n}\n\nGenerator::Generator(Generator &&rhs)\n : Logger(std::move(rhs))\n , mPimpl(rhs.mPimpl)\n{\n rhs.mPimpl = nullptr;\n}\n\nGenerator& Generator::operator=(Generator rhs)\n{\n Logger::operator =(rhs);\n rhs.swap(*this);\n return *this;\n}\n\nvoid Generator::swap(Generator &rhs)\n{\n std::swap(this->mPimpl, rhs.mPimpl);\n}\n\nvoid Generator::processModel(const ModelPtr &model)\n{\n \/\/ Make sure that the model is valid before processing it\n\/*TODO: reenable the validation once it is known to work fine...\n libcellml::Validator validator;\n\n validator.validateModel(model);\n\n if (validator.errorCount() > 0) {\n \/\/ The model is not valid, so retrieve the validation errors and keep a\n \/\/ copy of them\n\n for (size_t i = 0; i < validator.errorCount(); ++i)\n addError(validator.getError(i));\n\n return;\n }\n*\/\n \/\/ Determine the order in which equations should be executed by processing\n \/\/ each of the components in the given model\n\n for (size_t i = 0; i < model->componentCount(); ++i) {\n \/\/ Retrieve the math string associated with the given component and\n \/\/ process it, one equation at a time\n \/\/ Note: at this stage, we know the model is valid, so no point in\n \/\/ revalidating the math string...\n\n ComponentPtr component = model->getComponent(i);\n XmlDocPtr xmlDoc = std::make_shared<XmlDoc>();\n std::string math = component->getMath();\n\n xmlDoc->parse(math);\n\n XmlNodePtr mathNode = xmlDoc->getRootNode();\n\n for (XmlNodePtr node = mathNode->getFirstChild();\n node != nullptr; node = node->getNext()) {\n mPimpl->processNode(node);\n }\n }\n}\n\nvoid Generator::setWithNames(bool withNames)\n{\n mPimpl->mWithNames = withNames;\n}\n\nsize_t Generator::stateCount() const\n{\n return mPimpl->mStates.size();\n}\n\nsize_t Generator::rateCount() const\n{\n return stateCount();\n}\n\nsize_t Generator::variableCount() const\n{\n return mPimpl->mVariables.size();\n}\n\nstd::string Generator::initializeVariables() const\n{\n return \"\";\n}\n\nstd::string Generator::computeConstantEquations() const\n{\n return \"\";\n}\n\nstd::string Generator::computeRateEquations() const\n{\n return \"\";\n}\n\nstd::string Generator::computeAlgebraicEquations() const\n{\n return \"\";\n}\n\n}\n<commit_msg>Some minor cleaning up.<commit_after>\/*\nCopyright libCellML Contributors\n\nLicensed under the Apache License, Version 2.0 (the \"License\");\nyou may not use this file except in compliance with the License.\nYou may obtain a copy of the License at\n\n http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n\nUnless required by applicable law or agreed to in writing, software\ndistributed under the License is distributed on an \"AS IS\" BASIS,\nWITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\nSee the License for the specific language governing permissions and\nlimitations under the License.\n*\/\n\n#include \"xmldoc.h\"\n\n#include <vector>\n\n#include \"libcellml\/component.h\"\n#include \"libcellml\/generator.h\"\n#include \"libcellml\/model.h\"\n#include \"libcellml\/validator.h\"\n\nnamespace libcellml{\n\nstruct GeneratorVariable\n{\n};\n\ntypedef std::shared_ptr<GeneratorVariable> GeneratorVariablePtr;\n\nstruct Generator::GeneratorImpl\n{\n bool mWithNames;\n\n std::vector<GeneratorVariablePtr> mStates;\n std::vector<GeneratorVariablePtr> mVariables;\n\n void processNode(const XmlNodePtr &node);\n};\n\nvoid Generator::GeneratorImpl::processNode(const XmlNodePtr &node)\n{\n(void) node;\n\n\/\/TODO\n}\n\nGenerator::Generator()\n : mPimpl(new GeneratorImpl())\n{\n}\n\nGenerator::~Generator()\n{\n delete mPimpl;\n}\n\nGenerator::Generator(const Generator &rhs)\n : Logger(rhs)\n , mPimpl(new GeneratorImpl())\n{\n mPimpl->mStates = rhs.mPimpl->mStates;\n mPimpl->mVariables = rhs.mPimpl->mVariables;\n}\n\nGenerator::Generator(Generator &&rhs)\n : Logger(std::move(rhs))\n , mPimpl(rhs.mPimpl)\n{\n rhs.mPimpl = nullptr;\n}\n\nGenerator& Generator::operator=(Generator rhs)\n{\n Logger::operator =(rhs);\n rhs.swap(*this);\n return *this;\n}\n\nvoid Generator::swap(Generator &rhs)\n{\n std::swap(this->mPimpl, rhs.mPimpl);\n}\n\nvoid Generator::processModel(const ModelPtr &model)\n{\n \/\/ Make sure that the model is valid before processing it\n\/*TODO: reenable the validation once it is known to work fine...\n libcellml::Validator validator;\n\n validator.validateModel(model);\n\n if (validator.errorCount() > 0) {\n \/\/ The model is not valid, so retrieve the validation errors and keep a\n \/\/ copy of them\n\n for (size_t i = 0; i < validator.errorCount(); ++i)\n addError(validator.getError(i));\n\n return;\n }\n*\/\n \/\/ Determine the order in which equations should be executed by processing\n \/\/ each of the components in the given model\n\n for (size_t i = 0; i < model->componentCount(); ++i) {\n \/\/ Retrieve the math string associated with the given component and\n \/\/ process it, one equation at a time\n \/\/ Note: at this stage, we know the model is valid, so no point in\n \/\/ revalidating the math string...\n\n ComponentPtr component = model->getComponent(i);\n XmlDocPtr xmlDoc = std::make_shared<XmlDoc>();\n std::string math = component->getMath();\n\n xmlDoc->parse(math);\n\n XmlNodePtr mathNode = xmlDoc->getRootNode();\n\n for (XmlNodePtr node = mathNode->getFirstChild();\n node != nullptr; node = node->getNext()) {\n mPimpl->processNode(node);\n }\n }\n}\n\nvoid Generator::setWithNames(bool withNames)\n{\n mPimpl->mWithNames = withNames;\n}\n\nsize_t Generator::stateCount() const\n{\n return mPimpl->mStates.size();\n}\n\nsize_t Generator::rateCount() const\n{\n return stateCount();\n}\n\nsize_t Generator::variableCount() const\n{\n return mPimpl->mVariables.size();\n}\n\nstd::string Generator::initializeVariables() const\n{\n return \"\";\n}\n\nstd::string Generator::computeConstantEquations() const\n{\n return \"\";\n}\n\nstd::string Generator::computeRateEquations() const\n{\n return \"\";\n}\n\nstd::string Generator::computeAlgebraicEquations() const\n{\n return \"\";\n}\n\n}\n<|endoftext|>"} {"text":"<commit_before>#include <asiocurl\/easy.hpp>\n\n\n#include <asiocurl\/exception.hpp>\n#include <asiocurl\/io_service.hpp>\n#include <asiocurl\/optional.hpp>\n#include <boost\/asio.hpp>\n#include <curl\/curl.h>\n#include <thread>\n#include <catch.hpp>\n\n\nnamespace {\n\n\n\tclass fixture {\n\n\n\t\tprotected:\n\n\n\t\t\tboost::asio::io_service ios;\n\t\t\tasiocurl::io_service curl;\n\n\n\t\tprivate:\n\n\t\t\t\n\t\t\tasiocurl::optional<boost::asio::io_service::work> work_;\n\t\t\tstd::thread t_;\n\n\n\t\tpublic:\n\n\n\t\t\tfixture () : curl(ios), work_(asiocurl::in_place,ios) {\n\n\t\t\t\tt_=std::thread([&] () noexcept {\tios.run();\t});\n\n\t\t\t}\n\n\n\t\t\t~fixture () noexcept {\n\n\t\t\t\twork_=asiocurl::nullopt;\n\t\t\t\tt_.join();\n\n\t\t\t}\n\n\n\t};\n\n\n}\n\n\nSCENARIO_METHOD(fixture,\"asiocurl::easy_with_error_buffer captures detailed error messages from libcurl\",\"[asiocurl][easy][easy_with_error_buffer]\") {\n\n\tGIVEN(\"An asiocurl::easy_with_error_buffer object which represents a transfer which will fail\") {\n\n\t\tasiocurl::easy_with_error_buffer easy;\n\t\tconst char * str=\"http:\/\/foo.corge\";\t\/\/\tNXDOMAIN\n\t\tauto result=curl_easy_setopt(easy,CURLOPT_URL,str);\n\t\tif (result!=CURLE_OK) throw asiocurl::easy_error(result);\n\n\t\tWHEN(\"The transfer is started\") {\n\n\t\t\tauto f=curl.add(easy);\n\n\t\t\tTHEN(\"It completes\") {\n\n\t\t\t\tauto s=f.get();\n\n\t\t\t\tAND_THEN(\"The transfer failed\") {\n\n\t\t\t\t\tCHECK(s.data.result==CURLE_COULDNT_RESOLVE_HOST);\n\n\t\t\t\t\tAND_THEN(\"The asio::easy_with_error_buffer contains a detailed error message\") {\n\n\t\t\t\t\t\tCHECK(!easy.empty());\n\n\t\t\t\t\t}\n\n\t\t\t\t}\n\n\t\t\t}\n\n\t\t}\n\n\t}\n\n}\n<commit_msg>asiocurl::easy_with_error_buffer Tests - CURLOPT_VERBOSE<commit_after>#include <asiocurl\/easy.hpp>\n\n\n#include <asiocurl\/exception.hpp>\n#include <asiocurl\/io_service.hpp>\n#include <asiocurl\/optional.hpp>\n#include <boost\/asio.hpp>\n#include <curl\/curl.h>\n#include <thread>\n#include <catch.hpp>\n\n\nnamespace {\n\n\n\tclass fixture {\n\n\n\t\tprotected:\n\n\n\t\t\tboost::asio::io_service ios;\n\t\t\tasiocurl::io_service curl;\n\n\n\t\tprivate:\n\n\t\t\t\n\t\t\tasiocurl::optional<boost::asio::io_service::work> work_;\n\t\t\tstd::thread t_;\n\n\n\t\tpublic:\n\n\n\t\t\tfixture () : curl(ios), work_(asiocurl::in_place,ios) {\n\n\t\t\t\tt_=std::thread([&] () noexcept {\tios.run();\t});\n\n\t\t\t}\n\n\n\t\t\t~fixture () noexcept {\n\n\t\t\t\twork_=asiocurl::nullopt;\n\t\t\t\tt_.join();\n\n\t\t\t}\n\n\n\t};\n\n\n}\n\n\nSCENARIO_METHOD(fixture,\"asiocurl::easy_with_error_buffer captures detailed error messages from libcurl\",\"[asiocurl][easy][easy_with_error_buffer]\") {\n\n\tGIVEN(\"An asiocurl::easy_with_error_buffer object which represents a transfer which will fail\") {\n\n\t\tasiocurl::easy_with_error_buffer easy;\n\t\tconst char * str=\"http:\/\/foo.corge\";\t\/\/\tNXDOMAIN\n\t\tauto result=curl_easy_setopt(easy,CURLOPT_URL,str);\n\t\tif (result!=CURLE_OK) throw asiocurl::easy_error(result);\n\t\tlong v=1;\n\t\tif ((result=curl_easy_setopt(easy,CURLOPT_VERBOSE,v))!=CURLE_OK) throw asiocurl::easy_error(result);\n\n\t\tWHEN(\"The transfer is started\") {\n\n\t\t\tauto f=curl.add(easy);\n\n\t\t\tTHEN(\"It completes\") {\n\n\t\t\t\tauto s=f.get();\n\n\t\t\t\tAND_THEN(\"The transfer failed\") {\n\n\t\t\t\t\tCHECK(s.data.result==CURLE_COULDNT_RESOLVE_HOST);\n\n\t\t\t\t\tAND_THEN(\"The asio::easy_with_error_buffer contains a detailed error message\") {\n\n\t\t\t\t\t\tCHECK(!easy.empty());\n\n\t\t\t\t\t}\n\n\t\t\t\t}\n\n\t\t\t}\n\n\t\t}\n\n\t}\n\n}\n<|endoftext|>"} {"text":"<commit_before>#ifndef TOPAZ_GL2_OUTPUT_HPP\n#define TOPAZ_GL2_OUTPUT_HPP\n#include \"core\/window.hpp\"\n#include \"gl\/api\/output.hpp\"\n#include \"gl\/component.hpp\"\n\nnamespace tz::gl\n{\n\tstruct ImageOutputInfo\n\t{\n\t\ttz::BasicList<IComponent*> colours;\n\t\tIComponent* depth = nullptr;\n\t};\n\n\tclass ImageOutput final : public IOutput\n\t{\n\tpublic:\n\t\tImageOutput(ImageOutputInfo info);\n\t\tconstexpr virtual OutputTarget get_target() const override\n\t\t{\n\t\t\treturn OutputTarget::OffscreenImage;\n\t\t}\n\n\t\tvirtual std::unique_ptr<IOutput> unique_clone() const override\n\t\t{\n\t\t\treturn std::make_unique<ImageOutput>(*this);\n\t\t}\n\n\t\tstd::size_t colour_attachment_count() const;\n\t\tbool has_depth_attachment() const;\n\n\t\tconst ImageComponent& get_colour_attachment(std::size_t colour_attachment_idx) const;\n\t\tImageComponent& get_colour_attachment(std::size_t colour_attachment_idx);\n\t\t\n\t\tconst ImageComponent& get_depth_attachment() const;\n\t\tImageComponent& get_depth_attachment();\n\tprivate:\n\t\tstd::vector<ImageComponent*> colour_attachments;\n\t\tImageComponent* depth_attachment;\n\t};\n\n\tclass WindowOutput final : public IOutput\n\t{\n\tpublic:\n\t\tWindowOutput(const tz::Window& window);\n\t\tconstexpr virtual OutputTarget get_target() const override\n\t\t{\n\t\t\treturn OutputTarget::Window;\n\t\t}\n\n\t\tvirtual std::unique_ptr<IOutput> unique_clone() const override\n\t\t{\n\t\t\treturn std::make_unique<WindowOutput>(*this);\n\t\t}\n\n\t\tconst tz::Window& get_window() const;\n\tprivate:\n\t\tconst tz::Window* wnd;\n\t};\n}\n\n#endif \/\/ TOPAZ_GL2_OUTPUT_HPP\n<commit_msg>* Fix missing basic_list includfe<commit_after>#ifndef TOPAZ_GL2_OUTPUT_HPP\n#define TOPAZ_GL2_OUTPUT_HPP\n#include \"core\/window.hpp\"\n#include \"core\/containers\/basic_list.hpp\"\n#include \"gl\/api\/output.hpp\"\n#include \"gl\/component.hpp\"\n\nnamespace tz::gl\n{\n\tstruct ImageOutputInfo\n\t{\n\t\ttz::BasicList<IComponent*> colours;\n\t\tIComponent* depth = nullptr;\n\t};\n\n\tclass ImageOutput final : public IOutput\n\t{\n\tpublic:\n\t\tImageOutput(ImageOutputInfo info);\n\t\tconstexpr virtual OutputTarget get_target() const override\n\t\t{\n\t\t\treturn OutputTarget::OffscreenImage;\n\t\t}\n\n\t\tvirtual std::unique_ptr<IOutput> unique_clone() const override\n\t\t{\n\t\t\treturn std::make_unique<ImageOutput>(*this);\n\t\t}\n\n\t\tstd::size_t colour_attachment_count() const;\n\t\tbool has_depth_attachment() const;\n\n\t\tconst ImageComponent& get_colour_attachment(std::size_t colour_attachment_idx) const;\n\t\tImageComponent& get_colour_attachment(std::size_t colour_attachment_idx);\n\t\t\n\t\tconst ImageComponent& get_depth_attachment() const;\n\t\tImageComponent& get_depth_attachment();\n\tprivate:\n\t\tstd::vector<ImageComponent*> colour_attachments;\n\t\tImageComponent* depth_attachment;\n\t};\n\n\tclass WindowOutput final : public IOutput\n\t{\n\tpublic:\n\t\tWindowOutput(const tz::Window& window);\n\t\tconstexpr virtual OutputTarget get_target() const override\n\t\t{\n\t\t\treturn OutputTarget::Window;\n\t\t}\n\n\t\tvirtual std::unique_ptr<IOutput> unique_clone() const override\n\t\t{\n\t\t\treturn std::make_unique<WindowOutput>(*this);\n\t\t}\n\n\t\tconst tz::Window& get_window() const;\n\tprivate:\n\t\tconst tz::Window* wnd;\n\t};\n}\n\n#endif \/\/ TOPAZ_GL2_OUTPUT_HPP\n<|endoftext|>"} {"text":"<commit_before>#include <node.h>\n#include <node_buffer.h>\n#include \"gn_encoder.h\"\n#include \"gn_playlist.h\"\n#include \"gn_playlist_item.h\"\n\nusing namespace v8;\n\nGNEncoder::GNEncoder() {};\nGNEncoder::~GNEncoder() {\n groove_encoder_destroy(encoder);\n};\n\nPersistent<Function> GNEncoder::constructor;\n\ntemplate <typename target_t, typename func_t>\nstatic void AddGetter(target_t tpl, const char* name, func_t fn) {\n tpl->PrototypeTemplate()->SetAccessor(String::NewSymbol(name), fn);\n}\n\ntemplate <typename target_t, typename func_t>\nstatic void AddMethod(target_t tpl, const char* name, func_t fn) {\n tpl->PrototypeTemplate()->Set(String::NewSymbol(name),\n FunctionTemplate::New(fn)->GetFunction());\n}\n\nvoid GNEncoder::Init() {\n \/\/ Prepare constructor template\n Local<FunctionTemplate> tpl = FunctionTemplate::New(New);\n tpl->SetClassName(String::NewSymbol(\"GrooveEncoder\"));\n tpl->InstanceTemplate()->SetInternalFieldCount(1);\n \/\/ Fields\n AddGetter(tpl, \"id\", GetId);\n AddGetter(tpl, \"playlist\", GetPlaylist);\n \/\/ Methods\n AddMethod(tpl, \"attach\", Attach);\n AddMethod(tpl, \"detach\", Detach);\n AddMethod(tpl, \"getBuffer\", GetBuffer);\n\n constructor = Persistent<Function>::New(tpl->GetFunction());\n}\n\nHandle<Value> GNEncoder::New(const Arguments& args) {\n HandleScope scope;\n\n GNEncoder *obj = new GNEncoder();\n obj->Wrap(args.This());\n \n return scope.Close(args.This());\n}\n\nHandle<Value> GNEncoder::NewInstance(GrooveEncoder *encoder) {\n HandleScope scope;\n\n Local<Object> instance = constructor->NewInstance();\n\n GNEncoder *gn_encoder = node::ObjectWrap::Unwrap<GNEncoder>(instance);\n gn_encoder->encoder = encoder;\n\n return scope.Close(instance);\n}\n\nHandle<Value> GNEncoder::GetId(Local<String> property, const AccessorInfo &info) {\n HandleScope scope;\n GNEncoder *gn_encoder = node::ObjectWrap::Unwrap<GNEncoder>(info.This());\n char buf[64];\n snprintf(buf, sizeof(buf), \"%p\", gn_encoder->encoder);\n return scope.Close(String::New(buf));\n}\n\nHandle<Value> GNEncoder::GetPlaylist(Local<String> property,\n const AccessorInfo &info)\n{\n HandleScope scope;\n GNEncoder *gn_encoder = node::ObjectWrap::Unwrap<GNEncoder>(info.This());\n GroovePlaylist *playlist = gn_encoder->encoder->playlist;\n if (playlist) {\n return scope.Close(GNPlaylist::NewInstance(playlist));\n } else {\n return scope.Close(Null());\n }\n}\n\nstruct AttachReq {\n uv_work_t req;\n Persistent<Function> callback;\n GrooveEncoder *encoder;\n GroovePlaylist *playlist;\n int errcode;\n Persistent<Object> instance;\n String::Utf8Value *format_short_name;\n String::Utf8Value *codec_short_name;\n String::Utf8Value *filename;\n String::Utf8Value *mime_type;\n};\n\nstatic void AttachAsync(uv_work_t *req) {\n AttachReq *r = reinterpret_cast<AttachReq *>(req->data);\n\n r->encoder->format_short_name = r->format_short_name ? **r->format_short_name : NULL;\n r->encoder->codec_short_name = r->codec_short_name ? **r->codec_short_name : NULL;\n r->encoder->filename = r->filename ? **r->filename : NULL;\n r->encoder->mime_type = r->mime_type ? **r->mime_type : NULL;\n\n r->errcode = groove_encoder_attach(r->encoder, r->playlist);\n if (r->format_short_name) {\n delete r->format_short_name;\n r->format_short_name = NULL;\n }\n if (r->codec_short_name) {\n delete r->codec_short_name;\n r->codec_short_name = NULL;\n }\n if (r->filename) {\n delete r->filename;\n r->filename = NULL;\n }\n if (r->mime_type) {\n delete r->mime_type;\n r->mime_type = NULL;\n }\n}\n\nstatic void AttachAfter(uv_work_t *req) {\n HandleScope scope;\n AttachReq *r = reinterpret_cast<AttachReq *>(req->data);\n\n const unsigned argc = 1;\n Handle<Value> argv[argc];\n if (r->errcode < 0) {\n argv[0] = Exception::Error(String::New(\"encoder attach failed\"));\n } else {\n argv[0] = Null();\n\n Local<Object> actualAudioFormat = Object::New();\n actualAudioFormat->Set(String::NewSymbol(\"sampleRate\"),\n Number::New(r->encoder->actual_audio_format.sample_rate));\n actualAudioFormat->Set(String::NewSymbol(\"channelLayout\"),\n Number::New(r->encoder->actual_audio_format.channel_layout));\n actualAudioFormat->Set(String::NewSymbol(\"sampleFormat\"),\n Number::New(r->encoder->actual_audio_format.sample_fmt));\n\n r->instance->Set(String::NewSymbol(\"actualAudioFormat\"), actualAudioFormat);\n }\n\n TryCatch try_catch;\n r->callback->Call(Context::GetCurrent()->Global(), argc, argv);\n\n delete r;\n\n if (try_catch.HasCaught()) {\n node::FatalException(try_catch);\n }\n}\n\nHandle<Value> GNEncoder::Create(const Arguments& args) {\n HandleScope scope;\n\n GrooveEncoder *encoder = groove_encoder_create();\n Handle<Object> instance = NewInstance(encoder)->ToObject();\n\n \/\/ set properties on the instance with default values from\n \/\/ GrooveEncoder struct\n Local<Object> targetAudioFormat = Object::New();\n targetAudioFormat->Set(String::NewSymbol(\"sampleRate\"),\n Number::New(encoder->target_audio_format.sample_rate));\n targetAudioFormat->Set(String::NewSymbol(\"channelLayout\"),\n Number::New(encoder->target_audio_format.channel_layout));\n targetAudioFormat->Set(String::NewSymbol(\"sampleFormat\"),\n Number::New(encoder->target_audio_format.sample_fmt));\n\n instance->Set(String::NewSymbol(\"bitRate\"), Number::New(encoder->bit_rate));\n instance->Set(String::NewSymbol(\"actualAudioFormat\"), Null());\n instance->Set(String::NewSymbol(\"targetAudioFormat\"), targetAudioFormat);\n instance->Set(String::NewSymbol(\"formatShortName\"), Null());\n instance->Set(String::NewSymbol(\"codecShortName\"), Null());\n instance->Set(String::NewSymbol(\"filename\"), Null());\n instance->Set(String::NewSymbol(\"mimeType\"), Null());\n\n return scope.Close(instance);\n}\n\nHandle<Value> GNEncoder::Attach(const Arguments& args) {\n HandleScope scope;\n\n GNEncoder *gn_encoder = node::ObjectWrap::Unwrap<GNEncoder>(args.This());\n\n if (args.Length() < 1 || !args[0]->IsObject()) {\n ThrowException(Exception::TypeError(String::New(\"Expected object arg[0]\")));\n return scope.Close(Undefined());\n }\n if (args.Length() < 2 || !args[1]->IsFunction()) {\n ThrowException(Exception::TypeError(String::New(\"Expected function arg[1]\")));\n return scope.Close(Undefined());\n }\n\n Local<Object> instance = args.This();\n Local<Value> targetAudioFormatValue = instance->Get(String::NewSymbol(\"targetAudioFormat\"));\n if (!targetAudioFormatValue->IsObject()) {\n ThrowException(Exception::TypeError(String::New(\"Expected targetAudioFormat to be an object\")));\n return scope.Close(Undefined());\n }\n\n GNPlaylist *gn_playlist = node::ObjectWrap::Unwrap<GNPlaylist>(args[0]->ToObject());\n\n AttachReq *request = new AttachReq;\n\n request->req.data = request;\n request->callback = Persistent<Function>::New(Local<Function>::Cast(args[1]));\n request->instance = Persistent<Object>::New(args.This());\n request->playlist = gn_playlist->playlist;\n GrooveEncoder *encoder = gn_encoder->encoder;\n request->encoder = encoder;\n\n \/\/ copy the properties from our instance to the encoder\n Local<Value> formatShortName = instance->Get(String::NewSymbol(\"formatShortName\"));\n if (formatShortName->IsNull() || formatShortName->IsUndefined()) {\n request->format_short_name = NULL;\n } else {\n request->format_short_name = new String::Utf8Value(formatShortName->ToString());\n }\n Local<Value> codecShortName = instance->Get(String::NewSymbol(\"codecShortName\"));\n if (codecShortName->IsNull() || codecShortName->IsUndefined()) {\n request->codec_short_name = NULL;\n } else {\n request->codec_short_name = new String::Utf8Value(codecShortName->ToString());\n }\n Local<Value> filenameStr = instance->Get(String::NewSymbol(\"filename\"));\n if (filenameStr->IsNull() || filenameStr->IsUndefined()) {\n request->filename = NULL;\n } else {\n request->filename = new String::Utf8Value(filenameStr->ToString());\n }\n Local<Value> mimeType = instance->Get(String::NewSymbol(\"mimeType\"));\n if (mimeType->IsNull() || mimeType->IsUndefined()) {\n request->mime_type = NULL;\n } else {\n request->mime_type = new String::Utf8Value(mimeType->ToString());\n }\n\n Local<Object> targetAudioFormat = targetAudioFormatValue->ToObject();\n Local<Value> sampleRate = targetAudioFormat->Get(String::NewSymbol(\"sampleRate\"));\n double sample_rate = sampleRate->NumberValue();\n double channel_layout = targetAudioFormat->Get(String::NewSymbol(\"channelLayout\"))->NumberValue();\n double sample_fmt = targetAudioFormat->Get(String::NewSymbol(\"sampleFormat\"))->NumberValue();\n encoder->target_audio_format.sample_rate = (int)sample_rate;\n encoder->target_audio_format.channel_layout = (int)channel_layout;\n encoder->target_audio_format.sample_fmt = (enum GrooveSampleFormat)(int)sample_fmt;\n\n double bit_rate = instance->Get(String::NewSymbol(\"bitRate\"))->NumberValue();\n encoder->bit_rate = (int)bit_rate;\n\n uv_queue_work(uv_default_loop(), &request->req, AttachAsync,\n (uv_after_work_cb)AttachAfter);\n\n return scope.Close(Undefined());\n}\n\nstruct DetachReq {\n uv_work_t req;\n GrooveEncoder *encoder;\n Persistent<Function> callback;\n int errcode;\n};\n\nstatic void DetachAsync(uv_work_t *req) {\n DetachReq *r = reinterpret_cast<DetachReq *>(req->data);\n r->errcode = groove_encoder_detach(r->encoder);\n}\n\nstatic void DetachAfter(uv_work_t *req) {\n HandleScope scope;\n DetachReq *r = reinterpret_cast<DetachReq *>(req->data);\n\n const unsigned argc = 1;\n Handle<Value> argv[argc];\n if (r->errcode < 0) {\n argv[0] = Exception::Error(String::New(\"encoder detach failed\"));\n } else {\n argv[0] = Null();\n }\n TryCatch try_catch;\n r->callback->Call(Context::GetCurrent()->Global(), argc, argv);\n\n delete r;\n\n if (try_catch.HasCaught()) {\n node::FatalException(try_catch);\n }\n}\n\nHandle<Value> GNEncoder::Detach(const Arguments& args) {\n HandleScope scope;\n GNEncoder *gn_encoder = node::ObjectWrap::Unwrap<GNEncoder>(args.This());\n\n if (args.Length() < 1 || !args[0]->IsFunction()) {\n ThrowException(Exception::TypeError(String::New(\"Expected function arg[0]\")));\n return scope.Close(Undefined());\n }\n\n GrooveEncoder *encoder = gn_encoder->encoder;\n\n if (!encoder->playlist) {\n ThrowException(Exception::Error(String::New(\"detach: not attached\")));\n return scope.Close(Undefined());\n }\n\n DetachReq *request = new DetachReq;\n\n request->req.data = request;\n request->callback = Persistent<Function>::New(Local<Function>::Cast(args[0]));\n request->encoder = encoder;\n\n uv_queue_work(uv_default_loop(), &request->req, DetachAsync,\n (uv_after_work_cb)DetachAfter);\n\n return scope.Close(Undefined());\n}\n\nstatic void buffer_free(char *data, void *hint) {\n GrooveBuffer *buffer = reinterpret_cast<GrooveBuffer*>(hint);\n groove_buffer_unref(buffer);\n}\n\nHandle<Value> GNEncoder::GetBuffer(const Arguments& args) {\n HandleScope scope;\n GNEncoder *gn_encoder = node::ObjectWrap::Unwrap<GNEncoder>(args.This());\n GrooveEncoder *encoder = gn_encoder->encoder;\n\n GrooveBuffer *buffer;\n switch (groove_encoder_get_buffer(encoder, &buffer, 0)) {\n case GROOVE_BUFFER_YES: {\n Local<Object> object = Object::New();\n\n Handle<Object> bufferObject = node::Buffer::New(\n reinterpret_cast<char*>(buffer->data[0]), buffer->size,\n buffer_free, buffer)->handle_;\n object->Set(String::NewSymbol(\"buffer\"), bufferObject);\n\n object->Set(String::NewSymbol(\"item\"), GNPlaylistItem::NewInstance(buffer->item));\n object->Set(String::NewSymbol(\"pos\"), Number::New(buffer->pos));\n return scope.Close(object);\n }\n case GROOVE_BUFFER_END: {\n Local<Object> object = Object::New();\n object->Set(String::NewSymbol(\"buffer\"), Null());\n object->Set(String::NewSymbol(\"item\"), Null());\n object->Set(String::NewSymbol(\"pos\"), Null());\n return scope.Close(object);\n }\n default:\n return scope.Close(Null());\n }\n}\n<commit_msg>encoder: set playlist item to null when appropriate<commit_after>#include <node.h>\n#include <node_buffer.h>\n#include \"gn_encoder.h\"\n#include \"gn_playlist.h\"\n#include \"gn_playlist_item.h\"\n\nusing namespace v8;\n\nGNEncoder::GNEncoder() {};\nGNEncoder::~GNEncoder() {\n groove_encoder_destroy(encoder);\n};\n\nPersistent<Function> GNEncoder::constructor;\n\ntemplate <typename target_t, typename func_t>\nstatic void AddGetter(target_t tpl, const char* name, func_t fn) {\n tpl->PrototypeTemplate()->SetAccessor(String::NewSymbol(name), fn);\n}\n\ntemplate <typename target_t, typename func_t>\nstatic void AddMethod(target_t tpl, const char* name, func_t fn) {\n tpl->PrototypeTemplate()->Set(String::NewSymbol(name),\n FunctionTemplate::New(fn)->GetFunction());\n}\n\nvoid GNEncoder::Init() {\n \/\/ Prepare constructor template\n Local<FunctionTemplate> tpl = FunctionTemplate::New(New);\n tpl->SetClassName(String::NewSymbol(\"GrooveEncoder\"));\n tpl->InstanceTemplate()->SetInternalFieldCount(1);\n \/\/ Fields\n AddGetter(tpl, \"id\", GetId);\n AddGetter(tpl, \"playlist\", GetPlaylist);\n \/\/ Methods\n AddMethod(tpl, \"attach\", Attach);\n AddMethod(tpl, \"detach\", Detach);\n AddMethod(tpl, \"getBuffer\", GetBuffer);\n\n constructor = Persistent<Function>::New(tpl->GetFunction());\n}\n\nHandle<Value> GNEncoder::New(const Arguments& args) {\n HandleScope scope;\n\n GNEncoder *obj = new GNEncoder();\n obj->Wrap(args.This());\n \n return scope.Close(args.This());\n}\n\nHandle<Value> GNEncoder::NewInstance(GrooveEncoder *encoder) {\n HandleScope scope;\n\n Local<Object> instance = constructor->NewInstance();\n\n GNEncoder *gn_encoder = node::ObjectWrap::Unwrap<GNEncoder>(instance);\n gn_encoder->encoder = encoder;\n\n return scope.Close(instance);\n}\n\nHandle<Value> GNEncoder::GetId(Local<String> property, const AccessorInfo &info) {\n HandleScope scope;\n GNEncoder *gn_encoder = node::ObjectWrap::Unwrap<GNEncoder>(info.This());\n char buf[64];\n snprintf(buf, sizeof(buf), \"%p\", gn_encoder->encoder);\n return scope.Close(String::New(buf));\n}\n\nHandle<Value> GNEncoder::GetPlaylist(Local<String> property,\n const AccessorInfo &info)\n{\n HandleScope scope;\n GNEncoder *gn_encoder = node::ObjectWrap::Unwrap<GNEncoder>(info.This());\n GroovePlaylist *playlist = gn_encoder->encoder->playlist;\n if (playlist) {\n return scope.Close(GNPlaylist::NewInstance(playlist));\n } else {\n return scope.Close(Null());\n }\n}\n\nstruct AttachReq {\n uv_work_t req;\n Persistent<Function> callback;\n GrooveEncoder *encoder;\n GroovePlaylist *playlist;\n int errcode;\n Persistent<Object> instance;\n String::Utf8Value *format_short_name;\n String::Utf8Value *codec_short_name;\n String::Utf8Value *filename;\n String::Utf8Value *mime_type;\n};\n\nstatic void AttachAsync(uv_work_t *req) {\n AttachReq *r = reinterpret_cast<AttachReq *>(req->data);\n\n r->encoder->format_short_name = r->format_short_name ? **r->format_short_name : NULL;\n r->encoder->codec_short_name = r->codec_short_name ? **r->codec_short_name : NULL;\n r->encoder->filename = r->filename ? **r->filename : NULL;\n r->encoder->mime_type = r->mime_type ? **r->mime_type : NULL;\n\n r->errcode = groove_encoder_attach(r->encoder, r->playlist);\n if (r->format_short_name) {\n delete r->format_short_name;\n r->format_short_name = NULL;\n }\n if (r->codec_short_name) {\n delete r->codec_short_name;\n r->codec_short_name = NULL;\n }\n if (r->filename) {\n delete r->filename;\n r->filename = NULL;\n }\n if (r->mime_type) {\n delete r->mime_type;\n r->mime_type = NULL;\n }\n}\n\nstatic void AttachAfter(uv_work_t *req) {\n HandleScope scope;\n AttachReq *r = reinterpret_cast<AttachReq *>(req->data);\n\n const unsigned argc = 1;\n Handle<Value> argv[argc];\n if (r->errcode < 0) {\n argv[0] = Exception::Error(String::New(\"encoder attach failed\"));\n } else {\n argv[0] = Null();\n\n Local<Object> actualAudioFormat = Object::New();\n actualAudioFormat->Set(String::NewSymbol(\"sampleRate\"),\n Number::New(r->encoder->actual_audio_format.sample_rate));\n actualAudioFormat->Set(String::NewSymbol(\"channelLayout\"),\n Number::New(r->encoder->actual_audio_format.channel_layout));\n actualAudioFormat->Set(String::NewSymbol(\"sampleFormat\"),\n Number::New(r->encoder->actual_audio_format.sample_fmt));\n\n r->instance->Set(String::NewSymbol(\"actualAudioFormat\"), actualAudioFormat);\n }\n\n TryCatch try_catch;\n r->callback->Call(Context::GetCurrent()->Global(), argc, argv);\n\n delete r;\n\n if (try_catch.HasCaught()) {\n node::FatalException(try_catch);\n }\n}\n\nHandle<Value> GNEncoder::Create(const Arguments& args) {\n HandleScope scope;\n\n GrooveEncoder *encoder = groove_encoder_create();\n Handle<Object> instance = NewInstance(encoder)->ToObject();\n\n \/\/ set properties on the instance with default values from\n \/\/ GrooveEncoder struct\n Local<Object> targetAudioFormat = Object::New();\n targetAudioFormat->Set(String::NewSymbol(\"sampleRate\"),\n Number::New(encoder->target_audio_format.sample_rate));\n targetAudioFormat->Set(String::NewSymbol(\"channelLayout\"),\n Number::New(encoder->target_audio_format.channel_layout));\n targetAudioFormat->Set(String::NewSymbol(\"sampleFormat\"),\n Number::New(encoder->target_audio_format.sample_fmt));\n\n instance->Set(String::NewSymbol(\"bitRate\"), Number::New(encoder->bit_rate));\n instance->Set(String::NewSymbol(\"actualAudioFormat\"), Null());\n instance->Set(String::NewSymbol(\"targetAudioFormat\"), targetAudioFormat);\n instance->Set(String::NewSymbol(\"formatShortName\"), Null());\n instance->Set(String::NewSymbol(\"codecShortName\"), Null());\n instance->Set(String::NewSymbol(\"filename\"), Null());\n instance->Set(String::NewSymbol(\"mimeType\"), Null());\n\n return scope.Close(instance);\n}\n\nHandle<Value> GNEncoder::Attach(const Arguments& args) {\n HandleScope scope;\n\n GNEncoder *gn_encoder = node::ObjectWrap::Unwrap<GNEncoder>(args.This());\n\n if (args.Length() < 1 || !args[0]->IsObject()) {\n ThrowException(Exception::TypeError(String::New(\"Expected object arg[0]\")));\n return scope.Close(Undefined());\n }\n if (args.Length() < 2 || !args[1]->IsFunction()) {\n ThrowException(Exception::TypeError(String::New(\"Expected function arg[1]\")));\n return scope.Close(Undefined());\n }\n\n Local<Object> instance = args.This();\n Local<Value> targetAudioFormatValue = instance->Get(String::NewSymbol(\"targetAudioFormat\"));\n if (!targetAudioFormatValue->IsObject()) {\n ThrowException(Exception::TypeError(String::New(\"Expected targetAudioFormat to be an object\")));\n return scope.Close(Undefined());\n }\n\n GNPlaylist *gn_playlist = node::ObjectWrap::Unwrap<GNPlaylist>(args[0]->ToObject());\n\n AttachReq *request = new AttachReq;\n\n request->req.data = request;\n request->callback = Persistent<Function>::New(Local<Function>::Cast(args[1]));\n request->instance = Persistent<Object>::New(args.This());\n request->playlist = gn_playlist->playlist;\n GrooveEncoder *encoder = gn_encoder->encoder;\n request->encoder = encoder;\n\n \/\/ copy the properties from our instance to the encoder\n Local<Value> formatShortName = instance->Get(String::NewSymbol(\"formatShortName\"));\n if (formatShortName->IsNull() || formatShortName->IsUndefined()) {\n request->format_short_name = NULL;\n } else {\n request->format_short_name = new String::Utf8Value(formatShortName->ToString());\n }\n Local<Value> codecShortName = instance->Get(String::NewSymbol(\"codecShortName\"));\n if (codecShortName->IsNull() || codecShortName->IsUndefined()) {\n request->codec_short_name = NULL;\n } else {\n request->codec_short_name = new String::Utf8Value(codecShortName->ToString());\n }\n Local<Value> filenameStr = instance->Get(String::NewSymbol(\"filename\"));\n if (filenameStr->IsNull() || filenameStr->IsUndefined()) {\n request->filename = NULL;\n } else {\n request->filename = new String::Utf8Value(filenameStr->ToString());\n }\n Local<Value> mimeType = instance->Get(String::NewSymbol(\"mimeType\"));\n if (mimeType->IsNull() || mimeType->IsUndefined()) {\n request->mime_type = NULL;\n } else {\n request->mime_type = new String::Utf8Value(mimeType->ToString());\n }\n\n Local<Object> targetAudioFormat = targetAudioFormatValue->ToObject();\n Local<Value> sampleRate = targetAudioFormat->Get(String::NewSymbol(\"sampleRate\"));\n double sample_rate = sampleRate->NumberValue();\n double channel_layout = targetAudioFormat->Get(String::NewSymbol(\"channelLayout\"))->NumberValue();\n double sample_fmt = targetAudioFormat->Get(String::NewSymbol(\"sampleFormat\"))->NumberValue();\n encoder->target_audio_format.sample_rate = (int)sample_rate;\n encoder->target_audio_format.channel_layout = (int)channel_layout;\n encoder->target_audio_format.sample_fmt = (enum GrooveSampleFormat)(int)sample_fmt;\n\n double bit_rate = instance->Get(String::NewSymbol(\"bitRate\"))->NumberValue();\n encoder->bit_rate = (int)bit_rate;\n\n uv_queue_work(uv_default_loop(), &request->req, AttachAsync,\n (uv_after_work_cb)AttachAfter);\n\n return scope.Close(Undefined());\n}\n\nstruct DetachReq {\n uv_work_t req;\n GrooveEncoder *encoder;\n Persistent<Function> callback;\n int errcode;\n};\n\nstatic void DetachAsync(uv_work_t *req) {\n DetachReq *r = reinterpret_cast<DetachReq *>(req->data);\n r->errcode = groove_encoder_detach(r->encoder);\n}\n\nstatic void DetachAfter(uv_work_t *req) {\n HandleScope scope;\n DetachReq *r = reinterpret_cast<DetachReq *>(req->data);\n\n const unsigned argc = 1;\n Handle<Value> argv[argc];\n if (r->errcode < 0) {\n argv[0] = Exception::Error(String::New(\"encoder detach failed\"));\n } else {\n argv[0] = Null();\n }\n TryCatch try_catch;\n r->callback->Call(Context::GetCurrent()->Global(), argc, argv);\n\n delete r;\n\n if (try_catch.HasCaught()) {\n node::FatalException(try_catch);\n }\n}\n\nHandle<Value> GNEncoder::Detach(const Arguments& args) {\n HandleScope scope;\n GNEncoder *gn_encoder = node::ObjectWrap::Unwrap<GNEncoder>(args.This());\n\n if (args.Length() < 1 || !args[0]->IsFunction()) {\n ThrowException(Exception::TypeError(String::New(\"Expected function arg[0]\")));\n return scope.Close(Undefined());\n }\n\n GrooveEncoder *encoder = gn_encoder->encoder;\n\n if (!encoder->playlist) {\n ThrowException(Exception::Error(String::New(\"detach: not attached\")));\n return scope.Close(Undefined());\n }\n\n DetachReq *request = new DetachReq;\n\n request->req.data = request;\n request->callback = Persistent<Function>::New(Local<Function>::Cast(args[0]));\n request->encoder = encoder;\n\n uv_queue_work(uv_default_loop(), &request->req, DetachAsync,\n (uv_after_work_cb)DetachAfter);\n\n return scope.Close(Undefined());\n}\n\nstatic void buffer_free(char *data, void *hint) {\n GrooveBuffer *buffer = reinterpret_cast<GrooveBuffer*>(hint);\n groove_buffer_unref(buffer);\n}\n\nHandle<Value> GNEncoder::GetBuffer(const Arguments& args) {\n HandleScope scope;\n GNEncoder *gn_encoder = node::ObjectWrap::Unwrap<GNEncoder>(args.This());\n GrooveEncoder *encoder = gn_encoder->encoder;\n\n GrooveBuffer *buffer;\n switch (groove_encoder_get_buffer(encoder, &buffer, 0)) {\n case GROOVE_BUFFER_YES: {\n Local<Object> object = Object::New();\n\n Handle<Object> bufferObject = node::Buffer::New(\n reinterpret_cast<char*>(buffer->data[0]), buffer->size,\n buffer_free, buffer)->handle_;\n object->Set(String::NewSymbol(\"buffer\"), bufferObject);\n\n if (buffer->item) {\n object->Set(String::NewSymbol(\"item\"), GNPlaylistItem::NewInstance(buffer->item));\n } else {\n object->Set(String::NewSymbol(\"item\"), Null());\n }\n object->Set(String::NewSymbol(\"pos\"), Number::New(buffer->pos));\n return scope.Close(object);\n }\n case GROOVE_BUFFER_END: {\n Local<Object> object = Object::New();\n object->Set(String::NewSymbol(\"buffer\"), Null());\n object->Set(String::NewSymbol(\"item\"), Null());\n object->Set(String::NewSymbol(\"pos\"), Null());\n return scope.Close(object);\n }\n default:\n return scope.Close(Null());\n }\n}\n<|endoftext|>"} {"text":"<commit_before>\/*\n * Copyright (C) 2015 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 <algorithm>\n#include <cstring>\n#include <fstream>\n#include <iostream>\n#include <thread>\n\n#include <math\/vec3.h>\n\n#include <image\/ImageOps.h>\n\n#include <imageio\/ImageDecoder.h>\n#include <imageio\/ImageEncoder.h>\n\n#include <utils\/JobSystem.h>\n#include <utils\/Path.h>\n\n#include <getopt\/getopt.h>\n\nusing namespace math;\nusing namespace image;\nusing namespace utils;\n\nstatic ImageEncoder::Format g_format = ImageEncoder::Format::PNG_LINEAR;\nstatic bool g_formatSpecified = false;\nstatic bool g_linearOutput = false;\nstatic std::string g_compression;\n\nstatic Path g_roughnessMap;\nstatic float g_roughness = 0.0;\n\nstatic void printUsage(const char* name) {\n std::string execName(Path(name).getName());\n std::string usage(\n \"ROUGHNESSPREFILTER generates pre-filtered roughness maps from normal maps\\n\"\n \"to help mitigate specular aliasing.\\n\"\n \"Usage:\\n\"\n \" ROUGHNESSPREFILTER [options] <normal-map> <output-roughness-map>\\n\"\n \"\\n\"\n \"Output note:\\n\"\n \" One file will be generated per mip-level. The size of the first level will be\\n\"\n \" the greater of the input normal map and input roughness map.\\n\"\n \"\\n\"\n \"Supported input formats:\\n\"\n \" PNG, 8 and 16 bits\\n\"\n \" Radiance (.hdr)\\n\"\n \" Photoshop (.psd), 16 and 32 bits\\n\"\n \" OpenEXR (.exr)\\n\"\n \"\\n\"\n \"Options:\\n\"\n \" --help, -h\\n\"\n \" print this message\\n\\n\"\n \" --license\\n\"\n \" Print copyright and license information\\n\\n\"\n \" --roughness=[0..1], -r [0..1]\\n\"\n \" desired constant roughness, ignored if --roughness-map is specified\\n\\n\"\n \" --roughness-map=<input-roughness-map>, -m <input-roughness-map>\\n\"\n \" input roughness map\\n\\n\"\n \" --format=[exr|hdr|psd|png|dds], -f [exr|hdr|psd|png|dds]\\n\"\n \" specify output file format, inferred from file name if omitted\\n\\n\"\n \" --compression=COMPRESSION, -c COMPRESSION\\n\"\n \" format specific compression:\\n\"\n \" PNG: Ignored\\n\"\n \" Radiance: Ignored\\n\"\n \" Photoshop: 16 (default), 32\\n\"\n \" OpenEXR: RAW, RLE, ZIPS, ZIP, PIZ (default)\\n\"\n \" DDS: 8, 16 (default), 32\\n\\n\"\n \" --linear, -l\\n\"\n \" force linear output when the PNG format is selected\\n\\n\"\n );\n\n const std::string from(\"ROUGHNESSPREFILTER\");\n for (size_t pos = usage.find(from); pos != std::string::npos; pos = usage.find(from, pos)) {\n usage.replace(pos, from.length(), execName);\n }\n printf(\"%s\", usage.c_str());\n}\n\nstatic void license() {\n std::cout <<\n #include \"licenses\/licenses.inc\"\n ;\n}\n\nstatic int handleArguments(int argc, char* argv[]) {\n static constexpr const char* OPTSTR = \"hr:c:f:m:l\";\n static const struct option OPTIONS[] = {\n { \"help\", no_argument, nullptr, 'h' },\n { \"license\", no_argument, nullptr, 's' },\n { \"format\", required_argument, nullptr, 'f' },\n { \"compression\", required_argument, nullptr, 'c' },\n { \"roughness\", required_argument, nullptr, 'r' },\n { \"roughness-map\", required_argument, nullptr, 'm' },\n { \"linear\", no_argument, nullptr, 'l' },\n { nullptr, 0, nullptr, 0 } \/\/ termination of the option list\n };\n\n int opt;\n int optionIndex = 0;\n\n while ((opt = getopt_long(argc, argv, OPTSTR, OPTIONS, &optionIndex)) >= 0) {\n std::string arg(optarg ? optarg : \"\");\n switch (opt) {\n default:\n case 'h':\n printUsage(argv[0]);\n exit(0);\n \/\/ break;\n case 's':\n license();\n exit(0);\n \/\/ break;\n case 'f':\n if (arg == \"png\") {\n g_format = ImageEncoder::Format::PNG;\n g_formatSpecified = true;\n }\n if (arg == \"hdr\") {\n g_format = ImageEncoder::Format::HDR;\n g_formatSpecified = true;\n }\n if (arg == \"exr\") {\n g_format = ImageEncoder::Format::EXR;\n g_formatSpecified = true;\n }\n if (arg == \"psd\") {\n g_format = ImageEncoder::Format::PSD;\n g_formatSpecified = true;\n }\n if (arg == \"dds\") {\n g_format = ImageEncoder::Format::DDS_LINEAR;\n g_formatSpecified = true;\n }\n break;\n case 'c':\n g_compression = arg;\n break;\n case 'r':\n try {\n g_roughness = std::stof(arg);\n } catch (std::invalid_argument& e) {\n std::cerr << \"The specified roughness must be [0..1]: \" << arg << std::endl;\n exit(1);\n } catch (std::out_of_range& e) {\n std::cerr << \"The specified roughness must be [0..1]: \" << arg << std::endl;\n exit(1);\n }\n break;\n case 'm':\n g_roughnessMap = arg;\n break;\n case 'l':\n g_linearOutput = true;\n break;\n }\n }\n\n return optind;\n}\n\ninline bool isPOT(size_t x) {\n return !(x & (x - 1));\n}\n\nfloat solveVMF(const float2& pos, const size_t sampleCount, const float roughness,\n const LinearImage& normal) {\n\n float3 averageNormal(0.0f);\n float2 topLeft(-float(sampleCount) \/ 2.0f + 0.5f);\n\n for (size_t y = 0; y < sampleCount; y++) {\n for (size_t x = 0; x < sampleCount; x++) {\n float2 offset(topLeft + float2(x, y));\n float2 samplePos(floor(pos + offset) + 0.5f);\n float3 sampleNormal = *normal.get<float3>(size_t(samplePos.x), size_t(samplePos.y));\n sampleNormal = sampleNormal * 2.0f - 1.0f;\n\n averageNormal += normalize(sampleNormal);\n }\n }\n\n averageNormal \/= (sampleCount * sampleCount);\n\n float r = length(averageNormal);\n float kappa = 10000.0f;\n\n if (r < 1.0f) {\n kappa = (3.0f * r - r * r * r) \/ (1.0f - r * r);\n }\n\n \/\/ See: Karis, 2018, \"Normal map filtering using vMF (part 3)\"\n \/\/ The original formulation in Neubelt et al. 2013,\n \/\/ \"Crafting a Next-Gen Material Pipeline for The Order: 1886\" contains an error\n \/\/ and defines alpha' = sqrt(alpha^2 + 1 \/ kappa)\n return std::sqrt(roughness * roughness + (2.0f \/ kappa));\n}\n\nvoid prefilter(const LinearImage& normal, const size_t mipLevel, LinearImage& output) {\n const size_t width = output.getWidth();\n const size_t height = output.getHeight();\n const size_t sampleCount = 1u << mipLevel;\n\n for (size_t y = 0; y < height; y++) {\n auto outputRow = output.get<float3>(0, y);\n for (size_t x = 0; x < width; x++, outputRow++) {\n const float2 uv = (float2(x, y) + 0.5f) \/ float2(width, height);\n const float2 pos = uv * normal.getWidth();\n const float roughness = g_roughness;\n *outputRow = float3(solveVMF(pos, sampleCount, roughness, normal));\n }\n }\n}\n\ntemplate<bool FIRST_MIP>\nvoid prefilter(const LinearImage& normal, const LinearImage& roughness, const size_t mipLevel,\n LinearImage& output) {\n const size_t width = output.getWidth();\n const size_t height = output.getHeight();\n const size_t sampleCount = 1u << mipLevel;\n\n for (size_t y = 0; y < height; y++) {\n auto outputRow = output.get<float3>(0, y);\n for (size_t x = 0; x < width; x++, outputRow++) {\n auto data = roughness.get<float3>(x, y);\n if (FIRST_MIP) {\n *outputRow = *data;\n } else {\n const float2 uv = (float2(x, y) + 0.5f) \/ float2(width, height);\n const float2 pos = uv * normal.getWidth();\n *outputRow = float3(solveVMF(pos, sampleCount, data->r, normal));\n }\n }\n }\n}\n\nint main(int argc, char* argv[]) {\n int optionIndex = handleArguments(argc, argv);\n\n int numArgs = argc - optionIndex;\n if (numArgs < 2) {\n printUsage(argv[0]);\n return 1;\n }\n\n Path normalMap(argv[optionIndex ]);\n Path outputMap(argv[optionIndex + 1]);\n\n if (!normalMap.exists()) {\n std::cerr << \"The input normal map does not exist: \" << normalMap << std::endl;\n exit(1);\n }\n\n \/\/ make sure we load the normal maps as linear data\n std::ifstream inputStream(normalMap, std::ios::binary);\n LinearImage normalImage = ImageDecoder::decode(inputStream, normalMap,\n ImageDecoder::ColorSpace::LINEAR);\n inputStream.close();\n\n if (!normalImage.isValid()) {\n std::cerr << \"The input normal map is invalid: \" << normalMap << std::endl;\n exit(1);\n }\n\n if (!isPOT(normalImage.getWidth()) || !isPOT(normalImage.getHeight()) ||\n normalImage.getWidth() != normalImage.getHeight()) {\n std::cerr << \"The input normal map must have equal power-of-2 dimensions: \" <<\n normalImage.getWidth() << \"x\" << normalImage.getHeight() << std::endl;\n exit(1);\n }\n\n LinearImage roughnessImage;\n std::vector<LinearImage> mipImages;\n bool hasRoughnessMap = false;\n\n if (!g_roughnessMap.isEmpty()) {\n Path roughnessMap(g_roughnessMap);\n if (!roughnessMap.exists()) {\n std::cerr << \"The input roughness map does not exist: \" << roughnessMap << std::endl;\n exit(1);\n }\n\n hasRoughnessMap = true;\n\n inputStream.open(roughnessMap, std::ios::binary);\n roughnessImage = ImageDecoder::decode(inputStream, roughnessMap,\n ImageDecoder::ColorSpace::LINEAR);\n inputStream.close();\n\n if (!roughnessImage.isValid()) {\n std::cerr << \"The input roughness map is invalid: \" << roughnessMap << std::endl;\n exit(1);\n }\n\n if (!isPOT(roughnessImage.getWidth()) || !isPOT(roughnessImage.getHeight()) ||\n roughnessImage.getWidth() != roughnessImage.getHeight()) {\n std::cerr << \"The input roughness map must have equal power-of-2 dimensions: \" <<\n roughnessImage.getWidth() << \"x\" << roughnessImage.getHeight() << std::endl;\n exit(1);\n }\n\n if (roughnessImage.getWidth() != normalImage.getWidth() ||\n roughnessImage.getHeight() != normalImage.getHeight()) {\n std::cerr << \"The input normal and roughness maps must have the same dimensions\" << std::endl;\n exit(1);\n }\n }\n\n if (!g_formatSpecified) {\n g_format = ImageEncoder::chooseFormat(outputMap, g_linearOutput);\n } else {\n if (g_format == ImageEncoder::Format::PNG && g_linearOutput) {\n g_format = ImageEncoder::Format::PNG_LINEAR;\n }\n }\n\n const size_t width = hasRoughnessMap ? roughnessImage.getWidth() : normalImage.getWidth();\n const size_t height = hasRoughnessMap ? roughnessImage.getHeight() : normalImage.getHeight();\n const size_t mipLevels = size_t(std::log2f(width)) + 1;\n\n bool exportGrayscale = false;\n switch (g_format) {\n case ImageEncoder::Format::DDS:\n case ImageEncoder::Format::DDS_LINEAR:\n case ImageEncoder::Format::PNG:\n case ImageEncoder::Format::PNG_LINEAR:\n exportGrayscale = true;\n break;\n default:\n break;\n }\n\n if (hasRoughnessMap) {\n mipImages.push_back(std::move(roughnessImage));\n LinearImage* prevMip = &mipImages.at(0);\n\n for (size_t i = 1; i <= mipLevels; i++) {\n const size_t w = width >> i;\n const size_t h = height >> i;\n\n LinearImage image(w, h, 3);\n\n for (size_t y = 0; y < h; y++) {\n auto dst = image.get<float3>(0, y);\n for (size_t x = 0; x < w; x++, dst++) {\n float3 aa = *prevMip->get<float3>(x * 2, y * 2);\n float3 ba = *prevMip->get<float3>(x * 2 + 1, y * 2);\n float3 ab = *prevMip->get<float3>(x * 2, y * 2 + 1);\n float3 bb = *prevMip->get<float3>(x * 2 + 1, y * 2 + 1);\n *dst = (aa + ba + ab + bb) \/ 4.0f;\n }\n }\n\n mipImages.push_back(std::move(image));\n prevMip = &mipImages.at(i);\n }\n }\n\n JobSystem js;\n js.adopt();\n\n JobSystem::Job* parent = js.createJob();\n for (size_t i = 0; i < mipLevels; i++) {\n JobSystem::Job* mip = jobs::createJob(js, parent,\n [&normalImage, &mipImages, outputMap, i, width, height, exportGrayscale, hasRoughnessMap]() {\n const size_t w = width >> i;\n const size_t h = height >> i;\n\n LinearImage image(w, h, 3);\n\n if (i == 0) {\n if (hasRoughnessMap) {\n if (mipImages.at(0).getWidth() == image.getWidth()) {\n const size_t size = image.getWidth() * image.getHeight() * 12;\n memcpy(image.getPixelRef(), mipImages.at(0).getPixelRef(), size);\n } else {\n prefilter<true>(normalImage, mipImages.at(0), 0, image);\n }\n } else {\n std::fill_n(image.get<float3>(), w * h, float3(g_roughness));\n }\n } else {\n if (hasRoughnessMap) {\n prefilter<false>(normalImage, mipImages.at(i), i, image);\n } else {\n prefilter(normalImage, i, image);\n }\n }\n\n const std::string ext = outputMap.getExtension();\n const std::string name = outputMap.getNameWithoutExtension();\n Path out = Path(outputMap.getParent()).concat(\n name + \"_\" + std::to_string(i) + \".\" + ext); \/\/ NOLINT\n\n std::ofstream outputStream(out, std::ios::binary | std::ios::trunc);\n if (!outputStream.good()) {\n std::cerr << \"The output file cannot be opened: \" << out << std::endl;\n return;\n }\n if (exportGrayscale) {\n image = extractChannel(image, 0);\n }\n ImageEncoder::encode(outputStream, g_format, image, g_compression, out.getPath());\n outputStream.close();\n if (!outputStream.good()) {\n std::cerr << \"An error occurred while writing the output file: \" << out <<\n std::endl;\n }\n });\n js.run(mip);\n }\n js.runAndWait(parent);\n}\n<commit_msg>Fix \/ simplify roughness-prefilter.<commit_after>\/*\n * Copyright (C) 2015 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 <algorithm>\n#include <cstring>\n#include <fstream>\n#include <iostream>\n#include <thread>\n\n#include <math\/vec3.h>\n\n#include <image\/ImageOps.h>\n#include <image\/ImageSampler.h>\n\n#include <imageio\/ImageDecoder.h>\n#include <imageio\/ImageEncoder.h>\n\n#include <utils\/JobSystem.h>\n#include <utils\/Path.h>\n\n#include <getopt\/getopt.h>\n\nusing namespace math;\nusing namespace image;\nusing namespace utils;\n\nstatic ImageEncoder::Format g_format = ImageEncoder::Format::PNG_LINEAR;\nstatic bool g_formatSpecified = false;\nstatic bool g_linearOutput = false;\nstatic std::string g_compression;\n\nstatic Path g_roughnessMap;\nstatic float g_roughness = 0.0;\n\nstatic void printUsage(const char* name) {\n std::string execName(Path(name).getName());\n std::string usage(\n \"ROUGHNESSPREFILTER generates pre-filtered roughness maps from normal maps\\n\"\n \"to help mitigate specular aliasing.\\n\"\n \"Usage:\\n\"\n \" ROUGHNESSPREFILTER [options] <normal-map> <output-roughness-map>\\n\"\n \"\\n\"\n \"Output note:\\n\"\n \" One file will be generated per mip-level. The size of the first level will be\\n\"\n \" the greater of the input normal map and input roughness map.\\n\"\n \"\\n\"\n \"Supported input formats:\\n\"\n \" PNG, 8 and 16 bits\\n\"\n \" Radiance (.hdr)\\n\"\n \" Photoshop (.psd), 16 and 32 bits\\n\"\n \" OpenEXR (.exr)\\n\"\n \"\\n\"\n \"Options:\\n\"\n \" --help, -h\\n\"\n \" print this message\\n\\n\"\n \" --license\\n\"\n \" Print copyright and license information\\n\\n\"\n \" --roughness=[0..1], -r [0..1]\\n\"\n \" desired constant roughness, ignored if --roughness-map is specified\\n\\n\"\n \" --roughness-map=<input-roughness-map>, -m <input-roughness-map>\\n\"\n \" input roughness map\\n\\n\"\n \" --format=[exr|hdr|psd|png|dds], -f [exr|hdr|psd|png|dds]\\n\"\n \" specify output file format, inferred from file name if omitted\\n\\n\"\n \" --compression=COMPRESSION, -c COMPRESSION\\n\"\n \" format specific compression:\\n\"\n \" PNG: Ignored\\n\"\n \" Radiance: Ignored\\n\"\n \" Photoshop: 16 (default), 32\\n\"\n \" OpenEXR: RAW, RLE, ZIPS, ZIP, PIZ (default)\\n\"\n \" DDS: 8, 16 (default), 32\\n\\n\"\n \" --linear, -l\\n\"\n \" force linear output when the PNG format is selected\\n\\n\"\n );\n\n const std::string from(\"ROUGHNESSPREFILTER\");\n for (size_t pos = usage.find(from); pos != std::string::npos; pos = usage.find(from, pos)) {\n usage.replace(pos, from.length(), execName);\n }\n printf(\"%s\", usage.c_str());\n}\n\nstatic void license() {\n std::cout <<\n #include \"licenses\/licenses.inc\"\n ;\n}\n\nstatic int handleArguments(int argc, char* argv[]) {\n static constexpr const char* OPTSTR = \"hr:c:f:m:l\";\n static const struct option OPTIONS[] = {\n { \"help\", no_argument, nullptr, 'h' },\n { \"license\", no_argument, nullptr, 's' },\n { \"format\", required_argument, nullptr, 'f' },\n { \"compression\", required_argument, nullptr, 'c' },\n { \"roughness\", required_argument, nullptr, 'r' },\n { \"roughness-map\", required_argument, nullptr, 'm' },\n { \"linear\", no_argument, nullptr, 'l' },\n { nullptr, 0, nullptr, 0 } \/\/ termination of the option list\n };\n\n int opt;\n int optionIndex = 0;\n\n while ((opt = getopt_long(argc, argv, OPTSTR, OPTIONS, &optionIndex)) >= 0) {\n std::string arg(optarg ? optarg : \"\");\n switch (opt) {\n default:\n case 'h':\n printUsage(argv[0]);\n exit(0);\n \/\/ break;\n case 's':\n license();\n exit(0);\n \/\/ break;\n case 'f':\n if (arg == \"png\") {\n g_format = ImageEncoder::Format::PNG;\n g_formatSpecified = true;\n }\n if (arg == \"hdr\") {\n g_format = ImageEncoder::Format::HDR;\n g_formatSpecified = true;\n }\n if (arg == \"exr\") {\n g_format = ImageEncoder::Format::EXR;\n g_formatSpecified = true;\n }\n if (arg == \"psd\") {\n g_format = ImageEncoder::Format::PSD;\n g_formatSpecified = true;\n }\n if (arg == \"dds\") {\n g_format = ImageEncoder::Format::DDS_LINEAR;\n g_formatSpecified = true;\n }\n break;\n case 'c':\n g_compression = arg;\n break;\n case 'r':\n try {\n g_roughness = std::stof(arg);\n } catch (std::invalid_argument& e) {\n std::cerr << \"The specified roughness must be [0..1]: \" << arg << std::endl;\n exit(1);\n } catch (std::out_of_range& e) {\n std::cerr << \"The specified roughness must be [0..1]: \" << arg << std::endl;\n exit(1);\n }\n break;\n case 'm':\n g_roughnessMap = arg;\n break;\n case 'l':\n g_linearOutput = true;\n break;\n }\n }\n\n return optind;\n}\n\ninline bool isPOT(size_t x) {\n return !(x & (x - 1));\n}\n\nfloat solveVMF(const float2& pos, const size_t sampleCount, const float roughness,\n const LinearImage& normal) {\n\n float3 averageNormal(0.0f);\n float2 topLeft(-float(sampleCount) \/ 2.0f + 0.5f);\n\n for (size_t y = 0; y < sampleCount; y++) {\n for (size_t x = 0; x < sampleCount; x++) {\n float2 offset(topLeft + float2(x, y));\n float2 samplePos(floor(pos + offset) + 0.5f);\n float3 sampleNormal = *normal.get<float3>(size_t(samplePos.x), size_t(samplePos.y));\n sampleNormal = sampleNormal * 2.0f - 1.0f;\n\n averageNormal += normalize(sampleNormal);\n }\n }\n\n averageNormal \/= (sampleCount * sampleCount);\n\n float r = length(averageNormal);\n float kappa = 10000.0f;\n\n if (r < 1.0f) {\n kappa = (3.0f * r - r * r * r) \/ (1.0f - r * r);\n }\n\n \/\/ See: Karis, 2018, \"Normal map filtering using vMF (part 3)\"\n \/\/ The original formulation in Neubelt et al. 2013,\n \/\/ \"Crafting a Next-Gen Material Pipeline for The Order: 1886\" contains an error\n \/\/ and defines alpha' = sqrt(alpha^2 + 1 \/ kappa)\n return std::sqrt(roughness * roughness + (2.0f \/ kappa));\n}\n\nvoid prefilter(const LinearImage& normal, const size_t mipLevel, LinearImage& output) {\n const size_t width = output.getWidth();\n const size_t height = output.getHeight();\n const size_t sampleCount = 1u << mipLevel;\n\n for (size_t y = 0; y < height; y++) {\n auto outputRow = output.get<float>(0, y);\n for (size_t x = 0; x < width; x++, outputRow++) {\n const float2 uv = (float2(x, y) + 0.5f) \/ float2(width, height);\n const float2 pos = uv * normal.getWidth();\n const float roughness = g_roughness;\n *outputRow = solveVMF(pos, sampleCount, roughness, normal);\n }\n }\n}\n\ntemplate<bool FIRST_MIP>\nvoid prefilter(const LinearImage& normal, const LinearImage& roughness, const size_t mipLevel,\n LinearImage& output) {\n const size_t width = output.getWidth();\n const size_t height = output.getHeight();\n const size_t sampleCount = 1u << mipLevel;\n\n for (size_t y = 0; y < height; y++) {\n auto outputRow = output.get<float>(0, y);\n for (size_t x = 0; x < width; x++, outputRow++) {\n auto data = roughness.get<float>(x, y);\n if (FIRST_MIP) {\n *outputRow = *data;\n } else {\n const float2 uv = (float2(x, y) + 0.5f) \/ float2(width, height);\n const float2 pos = uv * normal.getWidth();\n *outputRow = solveVMF(pos, sampleCount, *data, normal);\n }\n }\n }\n}\n\nint main(int argc, char* argv[]) {\n int optionIndex = handleArguments(argc, argv);\n\n int numArgs = argc - optionIndex;\n if (numArgs < 2) {\n printUsage(argv[0]);\n return 1;\n }\n\n Path normalMap(argv[optionIndex ]);\n Path outputMap(argv[optionIndex + 1]);\n\n if (!normalMap.exists()) {\n std::cerr << \"The input normal map does not exist: \" << normalMap << std::endl;\n exit(1);\n }\n\n \/\/ make sure we load the normal maps as linear data\n std::ifstream inputStream(normalMap, std::ios::binary);\n LinearImage normalImage = ImageDecoder::decode(inputStream, normalMap,\n ImageDecoder::ColorSpace::LINEAR);\n inputStream.close();\n\n if (!normalImage.isValid()) {\n std::cerr << \"The input normal map is invalid: \" << normalMap << std::endl;\n exit(1);\n }\n\n if (!isPOT(normalImage.getWidth()) || !isPOT(normalImage.getHeight()) ||\n normalImage.getWidth() != normalImage.getHeight()) {\n std::cerr << \"The input normal map must have equal power-of-2 dimensions: \" <<\n normalImage.getWidth() << \"x\" << normalImage.getHeight() << std::endl;\n exit(1);\n }\n\n LinearImage roughnessImage;\n std::vector<LinearImage> mipImages;\n bool hasRoughnessMap = false;\n\n if (!g_roughnessMap.isEmpty()) {\n Path roughnessMap(g_roughnessMap);\n if (!roughnessMap.exists()) {\n std::cerr << \"The input roughness map does not exist: \" << roughnessMap << std::endl;\n exit(1);\n }\n\n hasRoughnessMap = true;\n\n inputStream.open(roughnessMap, std::ios::binary);\n roughnessImage = ImageDecoder::decode(inputStream, roughnessMap,\n ImageDecoder::ColorSpace::LINEAR);\n inputStream.close();\n\n if (!roughnessImage.isValid()) {\n std::cerr << \"The input roughness map is invalid: \" << roughnessMap << std::endl;\n exit(1);\n }\n\n if (!isPOT(roughnessImage.getWidth()) || !isPOT(roughnessImage.getHeight()) ||\n roughnessImage.getWidth() != roughnessImage.getHeight()) {\n std::cerr << \"The input roughness map must have equal power-of-2 dimensions: \" <<\n roughnessImage.getWidth() << \"x\" << roughnessImage.getHeight() << std::endl;\n exit(1);\n }\n\n if (roughnessImage.getWidth() != normalImage.getWidth() ||\n roughnessImage.getHeight() != normalImage.getHeight()) {\n std::cerr << \"The input normal and roughness maps must have the same dimensions\" << std::endl;\n exit(1);\n }\n\n roughnessImage = extractChannel(roughnessImage, 0);\n }\n\n if (!g_formatSpecified) {\n g_format = ImageEncoder::chooseFormat(outputMap, g_linearOutput);\n } else {\n if (g_format == ImageEncoder::Format::PNG && g_linearOutput) {\n g_format = ImageEncoder::Format::PNG_LINEAR;\n }\n }\n\n const size_t width = hasRoughnessMap ? roughnessImage.getWidth() : normalImage.getWidth();\n const size_t height = hasRoughnessMap ? roughnessImage.getHeight() : normalImage.getHeight();\n const size_t mipLevels = size_t(std::log2f(width)) + 1;\n\n if (hasRoughnessMap) {\n mipImages.resize(mipLevels);\n mipImages[0] = roughnessImage;\n image::generateMipmaps(roughnessImage, image::Filter::BOX, &mipImages[1], mipLevels - 1);\n }\n\n JobSystem js;\n js.adopt();\n\n JobSystem::Job* parent = js.createJob();\n for (size_t i = 0; i < mipLevels; i++) {\n JobSystem::Job* mip = jobs::createJob(js, parent,\n [&normalImage, &mipImages, outputMap, i, width, height, hasRoughnessMap]() {\n const size_t w = width >> i;\n const size_t h = height >> i;\n\n LinearImage image(w, h, 1);\n\n if (i == 0) {\n if (hasRoughnessMap) {\n if (mipImages.at(0).getWidth() == image.getWidth()) {\n const size_t size = image.getWidth() * image.getHeight() * sizeof(float);\n memcpy(image.getPixelRef(), mipImages.at(0).getPixelRef(), size);\n } else {\n prefilter<true>(normalImage, mipImages.at(0), 0, image);\n }\n } else {\n std::fill_n(image.get<float>(), w * h, g_roughness);\n }\n } else {\n if (hasRoughnessMap) {\n prefilter<false>(normalImage, mipImages.at(i), i, image);\n } else {\n prefilter(normalImage, i, image);\n }\n }\n\n const std::string ext = outputMap.getExtension();\n const std::string name = outputMap.getNameWithoutExtension();\n Path out = Path(outputMap.getParent()).concat(\n name + \"_\" + std::to_string(i) + \".\" + ext); \/\/ NOLINT\n\n std::ofstream outputStream(out, std::ios::binary | std::ios::trunc);\n if (!outputStream.good()) {\n std::cerr << \"The output file cannot be opened: \" << out << std::endl;\n return;\n }\n ImageEncoder::encode(outputStream, g_format, image, g_compression, out.getPath());\n outputStream.close();\n if (!outputStream.good()) {\n std::cerr << \"An error occurred while writing the output file: \" << out <<\n std::endl;\n }\n });\n js.run(mip);\n }\n js.runAndWait(parent);\n}\n<|endoftext|>"} {"text":"<commit_before>\/*\n This file is part of KXForms.\n\n Copyright (c) 2006 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., 51 Franklin Street, Fifth Floor,\n Boston, MA 02110-1301, USA.\n*\/\n\n#include \"formcreator.h\"\n\n#include \"xmlbuilder.h\"\n\n#include <QDebug>\n\nusing namespace KXForms;\n\nFormCreator::FormCreator()\n{\n}\n\nQString FormCreator::create( const Schema::Document &schemaDocument )\n{\n qDebug() << \"---FormCreator::create()\";\n\n mDocument = schemaDocument;\n\n mCollapsedForms.clear();\n\n XmlBuilder xml( \"kxforms\" );\n\n createForm( &xml, schemaDocument.startElement() );\n\n foreach ( Schema::Element element, schemaDocument.usedElements() ) {\n if ( element.identifier() != schemaDocument.startElement().identifier() ) {\n createForm( &xml, element );\n }\n }\n\n qDebug() << \"---FormCreator::create() done\";\n\n return xml.print();\n}\n\nvoid FormCreator::createForm( XmlBuilder *xml, const Schema::Element &element )\n{\n if ( mCollapsedForms.contains( element.name() ) ) return;\n\n qDebug() << \"ELEMENT\" << element.name();\n XmlBuilder *form = xml->tag( \"form\" )->attribute( \"ref\", element.name() );\n\n form->tag( \"xf:label\", humanizeString( element.name() ) );\n\n parseAttributes( element, form );\n\n parseElement( element, form );\n}\n\nvoid FormCreator::parseAttributes( const Schema::Element &element, XmlBuilder *xml )\n{\n foreach( Schema::Relation r, element.attributeRelations() ) {\n Schema::Attribute a = mDocument.attribute( r );\n\n qDebug() << \" ATTRIBUTE: \" << a.identifier();\n\n if ( a.type() == Schema::Attribute::String ) {\n XmlBuilder *input = xml->tag( \"xf:input\" );\n input->attribute( \"ref\", a.ref() );\n createLabel( input, a );\n } else if ( a.type() == Schema::Attribute::Enumeration ) {\n XmlBuilder *select1 = xml->tag( \"xf:select1\" );\n select1->attribute( \"ref\", a.ref() );\n createLabel( select1, a );\n foreach( QString value, a.enumerationValues() ) {\n XmlBuilder *item = select1->tag( \"xf:item\" );\n QString itemLabel;\n Hint hint = mHints.hint( element.identifier() + '\/' + a.ref() );\n if ( hint.isValid() ) itemLabel = hint.enumValue( value );\n if ( itemLabel.isEmpty() ) itemLabel = humanizeString( value );\n item->tag( \"xf:label\", itemLabel );\n item->tag( \"xf:value\", value );\n }\n } else {\n qDebug() << \"Unsupported type: \" << a.type();\n }\n }\n}\n\nvoid FormCreator::parseElement( const Schema::Element &element, XmlBuilder *xml )\n{\n if ( element.type() == Schema::Node::String ) {\n XmlBuilder *textArea = xml->tag( \"xf:textarea\" );\n textArea->attribute( \"ref\", \".\" );\n createLabel( textArea, element );\n } else if ( element.type() == Schema::Node::NormalizedString ||\n element.type() == Schema::Node::Token ) {\n XmlBuilder *input = xml->tag( \"xf:input\" );\n input->attribute( \"ref\", \".\" );\n createLabel( input, element );\n } else if ( element.type() == Schema::Node::ComplexType ) {\n parseComplexType( element, xml, true );\n } else {\n qDebug() << \"Unsupported type: \" << element.type();\n }\n}\n\nvoid FormCreator::parseComplexType( const Schema::Element &element, XmlBuilder *xml, bool topLevel )\n{\n QString currentChoice;\n\n XmlBuilder *section;\n\n bool choiceOnly = true;\n foreach( Schema::Relation r, element.elementRelations() ) {\n if( r.choice().isEmpty() )\n choiceOnly = false;\n }\n\n if( !topLevel && \n !element.mixed() && \n !choiceOnly && \n element.elementRelations().size() > 1 ) {\n section = xml->tag( \"kxf:section\" );\n createLabel( section, element );\n } \/*else if( !topLevel && element.type() == ) {\n section = xml->tag( \"kxf:section\" );\n createLabel( section, element );\n } *\/else {\n section = xml;\n }\n\n XmlBuilder *list = 0;\n XmlBuilder *choice = 0;\n foreach( Schema::Relation r, element.elementRelations() ) {\n qDebug() << \" CHILD ELEMENT\" << r.target();\n qDebug() << \" CHOICE\" << r.choice();\n if ( r.isList() ) {\n bool isMixedList = r.choice().contains( \"+\" );\n if ( !list || r.choice().isEmpty() || currentChoice != r.choice() ) {\n list = section->tag( \"list\" );\n QString label;\n if ( isMixedList ) {\n label = \"Item\";\n } else {\n label = getLabel( element.identifier() + '[' + r.target() + ']' );\n if ( label.isEmpty() ) {\n label = humanizeString( r.target(), true );\n }\n }\n list->tag( \"xf:label\", label );\n }\n XmlBuilder *item = list->tag( \"itemclass\" );\n item->attribute( \"ref\", r.target() );\n QString itemLabel;\n itemLabel = getLabel( element.identifier() + '\/' + r.target() );\n\n Schema::Element itemElement = mDocument.element( r );\n\n if ( itemLabel.isEmpty() ) {\n \/\/ Try to guess a suitable item label.\n foreach( Schema::Relation r2, itemElement.attributeRelations() ) {\n if ( r2.target() == \"name\" ) {\n if ( isMixedList ) {\n itemLabel = humanizeString( itemElement.name() ) + \": \";\n }\n itemLabel += \"<arg ref=\\\"@name\\\"\/>\";\n break;\n }\n }\n }\n\n if ( itemLabel.isEmpty() ) {\n if ( itemElement.type() == Schema::Node::String ) {\n itemLabel += \"<arg ref=\\\".\\\" truncate=\\\"40\\\"\/>\";\n } else if ( itemElement.type() == Schema::Node::NormalizedString ||\n itemElement.type() == Schema::Node::Token ) {\n itemLabel += \"<arg ref=\\\".\\\"\/>\";\n }\n }\n\n if ( itemLabel.isEmpty() ) itemLabel = humanizeString( r.target() );\n item->tag( \"itemlabel\", itemLabel );\n\n currentChoice = r.choice();\n } else if( !r.choice().isEmpty() ) {\n if( !choice ) {\n choice = section->tag( \"xf:select1\" );\n choice->tag( \"xf:label\", getLabel( element.ref(), element.name() ) );\n }\n Schema::Element choiceElement = mDocument.element( r );\n XmlBuilder *item = choice->tag( \"xf:item\" );\n QString value = choiceElement.name();\n QString itemLabel = getLabel( choiceElement.ref(), choiceElement.name() );\n\n item->tag( \"xf:label\", itemLabel );\n item->tag( \"xf:value\", value );\n } else{\n Schema::Element textElement = mDocument.element( r.target() );\n if( textElement.type() == Schema::Node::ComplexType && !textElement.mixed() ) {\n parseComplexType( textElement, section, false );\n } else {\n XmlBuilder *textInput = 0;\n if ( textElement.type() == Schema::Node::NormalizedString ) {\n textInput = section->tag( \"xf:input\" );\n } else {\n textInput = section->tag( \"xf:textarea\" );\n }\n textInput->attribute( \"ref\", textElement.name() );\n createLabel( textInput, textElement );\n mCollapsedForms.append( r.target() );\n }\n }\n }\n if( element.elementRelations().size() == 0 ) {\n XmlBuilder *textInput = 0;\n textInput = section->tag( \"xf:textarea\" );\n textInput->attribute( \"ref\", element.name() );\n createLabel( textInput, element );\n }\n}\n\nQString FormCreator::humanizeString( const QString &str, bool pluralize )\n{\n if ( str.isEmpty() ) return str;\n QString result = str[0].toUpper() + str.mid( 1 );\n if ( pluralize ) {\n if ( result.endsWith( \"y\" ) ) {\n result = result.left( str.length() - 1 ) + \"ies\";\n } else {\n result += 's';\n }\n }\n\n return result;\n}\n\nvoid FormCreator::setHints( const Hints &hints )\n{\n mHints = hints;\n}\n\nvoid FormCreator::mergeHints( const Hints &hints )\n{\n foreach( Hint h, hints.hints() ) {\n mHints.insertHint( h );\n }\n}\n\nvoid FormCreator::createLabel( XmlBuilder *parent, const Schema::Node &node )\n{\n parent->tag( \"xf:label\", getLabel( node.identifier(), node.name() ) );\n}\n\nQString FormCreator::getLabel( const QString &ref, const QString &fallback,\n bool pluralize )\n{\n\/\/ qDebug() << \"GETLABEL: \" << ref;\n\n QString label;\n\n Hint hint = mHints.hint( ref );\n\n if ( hint.isValid() ) label = hint.label();\n\n if ( label.isEmpty() ) label = humanizeString( fallback, pluralize );\n\n return label;\n}\n\nHints FormCreator::hints() const\n{\n return mHints;\n}\n<commit_msg>Add missing reference in choice elements.<commit_after>\/*\n This file is part of KXForms.\n\n Copyright (c) 2006 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., 51 Franklin Street, Fifth Floor,\n Boston, MA 02110-1301, USA.\n*\/\n\n#include \"formcreator.h\"\n\n#include \"xmlbuilder.h\"\n\n#include <QDebug>\n\nusing namespace KXForms;\n\nFormCreator::FormCreator()\n{\n}\n\nQString FormCreator::create( const Schema::Document &schemaDocument )\n{\n qDebug() << \"---FormCreator::create()\";\n\n mDocument = schemaDocument;\n\n mCollapsedForms.clear();\n\n XmlBuilder xml( \"kxforms\" );\n\n createForm( &xml, schemaDocument.startElement() );\n\n foreach ( Schema::Element element, schemaDocument.usedElements() ) {\n if ( element.identifier() != schemaDocument.startElement().identifier() ) {\n createForm( &xml, element );\n }\n }\n\n qDebug() << \"---FormCreator::create() done\";\n\n return xml.print();\n}\n\nvoid FormCreator::createForm( XmlBuilder *xml, const Schema::Element &element )\n{\n if ( mCollapsedForms.contains( element.name() ) ) return;\n\n qDebug() << \"ELEMENT\" << element.name();\n XmlBuilder *form = xml->tag( \"form\" )->attribute( \"ref\", element.name() );\n\n form->tag( \"xf:label\", humanizeString( element.name() ) );\n\n parseAttributes( element, form );\n\n parseElement( element, form );\n}\n\nvoid FormCreator::parseAttributes( const Schema::Element &element, XmlBuilder *xml )\n{\n foreach( Schema::Relation r, element.attributeRelations() ) {\n Schema::Attribute a = mDocument.attribute( r );\n\n qDebug() << \" ATTRIBUTE: \" << a.identifier();\n\n if ( a.type() == Schema::Attribute::String ) {\n XmlBuilder *input = xml->tag( \"xf:input\" );\n input->attribute( \"ref\", a.ref() );\n createLabel( input, a );\n } else if ( a.type() == Schema::Attribute::Enumeration ) {\n XmlBuilder *select1 = xml->tag( \"xf:select1\" );\n select1->attribute( \"ref\", a.ref() );\n createLabel( select1, a );\n foreach( QString value, a.enumerationValues() ) {\n XmlBuilder *item = select1->tag( \"xf:item\" );\n QString itemLabel;\n Hint hint = mHints.hint( element.identifier() + '\/' + a.ref() );\n if ( hint.isValid() ) itemLabel = hint.enumValue( value );\n if ( itemLabel.isEmpty() ) itemLabel = humanizeString( value );\n item->tag( \"xf:label\", itemLabel );\n item->tag( \"xf:value\", value );\n }\n } else {\n qDebug() << \"Unsupported type: \" << a.type();\n }\n }\n}\n\nvoid FormCreator::parseElement( const Schema::Element &element, XmlBuilder *xml )\n{\n if ( element.type() == Schema::Node::String ) {\n XmlBuilder *textArea = xml->tag( \"xf:textarea\" );\n textArea->attribute( \"ref\", \".\" );\n createLabel( textArea, element );\n } else if ( element.type() == Schema::Node::NormalizedString ||\n element.type() == Schema::Node::Token ) {\n XmlBuilder *input = xml->tag( \"xf:input\" );\n input->attribute( \"ref\", \".\" );\n createLabel( input, element );\n } else if ( element.type() == Schema::Node::ComplexType ) {\n parseComplexType( element, xml, true );\n } else {\n qDebug() << \"Unsupported type: \" << element.type();\n }\n}\n\nvoid FormCreator::parseComplexType( const Schema::Element &element, XmlBuilder *xml, bool topLevel )\n{\n QString currentChoice;\n\n XmlBuilder *section;\n\n bool choiceOnly = true;\n foreach( Schema::Relation r, element.elementRelations() ) {\n if( r.choice().isEmpty() )\n choiceOnly = false;\n }\n\n if( !topLevel && \n !element.mixed() && \n !choiceOnly && \n element.elementRelations().size() > 1 ) {\n section = xml->tag( \"kxf:section\" );\n createLabel( section, element );\n } \/*else if( !topLevel && element.type() == ) {\n section = xml->tag( \"kxf:section\" );\n createLabel( section, element );\n } *\/else {\n section = xml;\n }\n\n XmlBuilder *list = 0;\n XmlBuilder *choice = 0;\n foreach( Schema::Relation r, element.elementRelations() ) {\n qDebug() << \" CHILD ELEMENT\" << r.target();\n qDebug() << \" CHOICE\" << r.choice();\n if ( r.isList() ) {\n bool isMixedList = r.choice().contains( \"+\" );\n if ( !list || r.choice().isEmpty() || currentChoice != r.choice() ) {\n list = section->tag( \"list\" );\n QString label;\n if ( isMixedList ) {\n label = \"Item\";\n } else {\n label = getLabel( element.identifier() + '[' + r.target() + ']' );\n if ( label.isEmpty() ) {\n label = humanizeString( r.target(), true );\n }\n }\n list->tag( \"xf:label\", label );\n }\n XmlBuilder *item = list->tag( \"itemclass\" );\n item->attribute( \"ref\", r.target() );\n QString itemLabel;\n itemLabel = getLabel( element.identifier() + '\/' + r.target() );\n\n Schema::Element itemElement = mDocument.element( r );\n\n if ( itemLabel.isEmpty() ) {\n \/\/ Try to guess a suitable item label.\n foreach( Schema::Relation r2, itemElement.attributeRelations() ) {\n if ( r2.target() == \"name\" ) {\n if ( isMixedList ) {\n itemLabel = humanizeString( itemElement.name() ) + \": \";\n }\n itemLabel += \"<arg ref=\\\"@name\\\"\/>\";\n break;\n }\n }\n }\n\n if ( itemLabel.isEmpty() ) {\n if ( itemElement.type() == Schema::Node::String ) {\n itemLabel += \"<arg ref=\\\".\\\" truncate=\\\"40\\\"\/>\";\n } else if ( itemElement.type() == Schema::Node::NormalizedString ||\n itemElement.type() == Schema::Node::Token ) {\n itemLabel += \"<arg ref=\\\".\\\"\/>\";\n }\n }\n\n if ( itemLabel.isEmpty() ) itemLabel = humanizeString( r.target() );\n item->tag( \"itemlabel\", itemLabel );\n\n currentChoice = r.choice();\n } else if( !r.choice().isEmpty() ) {\n if( !choice ) {\n choice = section->tag( \"xf:select1\" );\n choice->tag( \"xf:label\", getLabel( element.ref(), element.name() ) );\n choice->attribute( \"ref\", element.ref() );\n }\n Schema::Element choiceElement = mDocument.element( r );\n XmlBuilder *item = choice->tag( \"xf:item\" );\n QString value = choiceElement.name();\n QString itemLabel = getLabel( choiceElement.ref(), choiceElement.name() );\n\n item->tag( \"xf:label\", itemLabel );\n item->tag( \"xf:value\", value );\n } else{\n Schema::Element textElement = mDocument.element( r.target() );\n if( textElement.type() == Schema::Node::ComplexType && !textElement.mixed() ) {\n parseComplexType( textElement, section, false );\n } else {\n XmlBuilder *textInput = 0;\n if ( textElement.type() == Schema::Node::NormalizedString ) {\n textInput = section->tag( \"xf:input\" );\n } else {\n textInput = section->tag( \"xf:textarea\" );\n }\n textInput->attribute( \"ref\", textElement.name() );\n createLabel( textInput, textElement );\n mCollapsedForms.append( r.target() );\n }\n }\n }\n if( element.elementRelations().size() == 0 ) {\n XmlBuilder *textInput = 0;\n textInput = section->tag( \"xf:textarea\" );\n textInput->attribute( \"ref\", element.name() );\n createLabel( textInput, element );\n }\n}\n\nQString FormCreator::humanizeString( const QString &str, bool pluralize )\n{\n if ( str.isEmpty() ) return str;\n QString result = str[0].toUpper() + str.mid( 1 );\n if ( pluralize ) {\n if ( result.endsWith( \"y\" ) ) {\n result = result.left( str.length() - 1 ) + \"ies\";\n } else {\n result += 's';\n }\n }\n\n return result;\n}\n\nvoid FormCreator::setHints( const Hints &hints )\n{\n mHints = hints;\n}\n\nvoid FormCreator::mergeHints( const Hints &hints )\n{\n foreach( Hint h, hints.hints() ) {\n mHints.insertHint( h );\n }\n}\n\nvoid FormCreator::createLabel( XmlBuilder *parent, const Schema::Node &node )\n{\n parent->tag( \"xf:label\", getLabel( node.identifier(), node.name() ) );\n}\n\nQString FormCreator::getLabel( const QString &ref, const QString &fallback,\n bool pluralize )\n{\n\/\/ qDebug() << \"GETLABEL: \" << ref;\n\n QString label;\n\n Hint hint = mHints.hint( ref );\n\n if ( hint.isValid() ) label = hint.label();\n\n if ( label.isEmpty() ) label = humanizeString( fallback, pluralize );\n\n return label;\n}\n\nHints FormCreator::hints() const\n{\n return mHints;\n}\n<|endoftext|>"} {"text":"<commit_before>#include \"twsClient.h\"\n#include \"twsUtil.h\"\n#include \"debug.h\"\n\n\/\/ from global installed ibtws\n#include \"ibtws\/Contract.h\"\n#include \"ibtws\/Order.h\"\n#include \"ibtws\/OrderState.h\"\n#include \"ibtws\/Execution.h\"\n#include \"ibtws\/TwsSocketClientErrors.h\"\n#include \"ibtws\/EWrapper.h\"\n#include \"ibtws\/EPosixClientSocket.h\"\n\n#include <unistd.h>\n#include <errno.h>\n#include <string.h>\n\n\n\/\/ debug verbosity 0...n\n#define tws_debug_level 1\n#define TWS_DEBUG( _level, _fmt, _msg... ) \\\n\tif( tws_debug_level >= _level ) { \\\n\t\tDEBUG_PRINTF(\"tws debug: \" _fmt, ## _msg); \\\n\t}\n\n\n\n\nTWSClient::TWSClient( IB::EWrapper *ew ) :\n\tmyEWrapper(ew),\n\tePosixClient(NULL)\n{\n}\n\n\nTWSClient::~TWSClient()\n{\n\tif( ePosixClient != NULL ) {\n\t\tdelete ePosixClient;\n\t}\n}\n\n\nbool TWSClient::isConnected() const\n{\n\treturn ( (ePosixClient != NULL) && ePosixClient->isConnected() );\n}\n\n\nvoid TWSClient::connectTWS( const std::string &host, int port, int clientId )\n{\n\tDEBUG_PRINTF(\"connect: %s:%d, clientId: %d\", host.c_str(), port, clientId);\n\t\n\tif( isConnected() ) {\n\t\tmyEWrapper->error( IB::NO_VALID_ID, IB::ALREADY_CONNECTED.code(),\n\t\t\tIB::ALREADY_CONNECTED.msg() );\n\t\treturn;\n\t} else if( ePosixClient != NULL ) {\n\t\tdelete ePosixClient;\n\t}\n\t\n\tePosixClient = new IB::EPosixClientSocket(myEWrapper);\n\t\n\tePosixClient->eConnect( host.c_str(), port, clientId );\n}\n\n\nvoid TWSClient::disconnectTWS()\n{\n\tDEBUG_PRINTF(\"disconnect TWS\");\n\t\n\tif ( !isConnected()) {\n\t\treturn;\n\t}\n\t\n\tePosixClient->eDisconnect();\n\tmyEWrapper->connectionClosed();\n\tDEBUG_PRINTF(\"We are disconnected\");\n}\n\n\nvoid TWSClient::selectStuff( int msec )\n{\n\tstruct timeval tval;\n\ttval.tv_usec = msec * 1000;\n\ttval.tv_sec = 0;\n\t\n\tfd_set readSet, writeSet, errorSet;\n\t\n\tFD_ZERO( &readSet);\n\terrorSet = writeSet = readSet;\n\t\n\tint fd = -1;\n\tif( isConnected() ) {\n\t\t\/\/ if not connected then all sets are zero and select will just timeout\n\t\tfd = ePosixClient->fd();\n\t\tassert( fd >= 0 );\n\t\t\n\t\tFD_SET( fd, &readSet);\n\t\tif( !ePosixClient->isOutBufferEmpty()) {\n\t\t\tFD_SET( fd, &writeSet);\n\t\t}\n\t\tFD_CLR( fd, &errorSet);\n\t}\n\tint ret = select( fd + 1,\n\t\t&readSet, &writeSet, &errorSet, &tval );\n\t\/\/\/\/\/ blocking \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\t\n\tif( ret == 0) {\n\t\tTWS_DEBUG( 5 , \"Select timeouted.\" );\n\t\treturn;\n\t} else if( ret < 0) {\n\t\tTWS_DEBUG( 1 , \"Select failed with failed with errno: %s.\",\n\t\t\tstrerror(errno) );\n\t\tdisconnectTWS();\n\t\treturn;\n\t}\n\t\n\tif( FD_ISSET( fd, &errorSet)) {\n\t\tTWS_DEBUG( 1 ,\"Error on socket.\" );\n\t\tePosixClient->onError(); \/\/ might disconnect us\n\t\tif( !isConnected() ) {\n\t\t\treturn;\n\t\t}\n\t}\n\t\n\tif( FD_ISSET( fd, &writeSet)) {\n\t\tTWS_DEBUG( 1 ,\"Socket is ready for writing.\" );\n\t\tePosixClient->onSend(); \/\/ might disconnect us on socket errors\n\t\tif( !isConnected() ) {\n\t\t\treturn;\n\t\t}\n\t}\n\t\n\tif( FD_ISSET( fd, &readSet)) {\n\t\tTWS_DEBUG( 6 ,\"Socket is ready for reading.\" );\n\t\tePosixClient->onReceive(); \/\/ might disconnect us on socket errors\n\t}\n}\n\n\nint TWSClient::serverVersion()\n{\n\treturn ePosixClient->serverVersion();\n}\n\nstd::string TWSClient::TwsConnectionTime()\n{\n\treturn ePosixClient->TwsConnectionTime();\n}\n\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n\nvoid TWSClient::reqMktData(int tickerId, const IB::Contract &contract,\n\tconst std::string &genericTickList, bool snapshot)\n{\n\tDEBUG_PRINTF( \"REQ_MKT_DATA %d \"\n\t\t\"'%s' '%s' '%s' '%s' '%s' '%g' '%s' '%s' '%s' %d\",\n\t\ttickerId, contract.symbol.c_str(), contract.exchange.c_str(),\n\t\tcontract.secType.c_str(), contract.expiry.c_str(),\n\t\tcontract.right.c_str(), contract.strike, contract.currency.c_str(),\n\t\tcontract.localSymbol.c_str(), genericTickList.c_str(), snapshot );\n\t\n\tePosixClient->reqMktData( tickerId, contract, genericTickList, snapshot );\n}\n\n\nvoid TWSClient::cancelMktData ( int tickerId )\n{\n\tDEBUG_PRINTF(\"CANCEL_MKT_DATA %d\", tickerId);\n\t\n\tePosixClient->cancelMktData( tickerId );\n}\n\n\nvoid TWSClient::placeOrder ( int id, const IB::Contract &contract,\n\tconst IB::Order &order )\n{\n\tDEBUG_PRINTF(\"PLACE_ORDER %d '%s' %ld '%s' %g '%s'\",\n\t\tid, order.orderType.c_str(), order.totalQuantity, order.action.c_str(),\n\t\torder.lmtPrice, contract.symbol.c_str() );\n\t\n\tePosixClient->placeOrder( id, contract, order );\n}\n\n\nvoid TWSClient::cancelOrder ( int id )\n{\n\tDEBUG_PRINTF(\"CANCEL_ORDER %d\", id);\n\t\n\tePosixClient->cancelOrder( id );\n}\n\n\nvoid TWSClient::reqOpenOrders()\n{\n\tDEBUG_PRINTF(\"REQ_OPEN_ORDERS\");\n\t\n\tePosixClient->reqOpenOrders();\n}\n\n\nvoid TWSClient::reqAllOpenOrders()\n{\n\tDEBUG_PRINTF(\"REQ_ALL_OPEN_ORDERS\");\n\tePosixClient->reqAllOpenOrders();\n}\n\n\nvoid TWSClient::reqAutoOpenOrders( bool bAutoBind )\n{\n\tDEBUG_PRINTF(\"REQ_AUTO_OPEN_ORDERS %d\", bAutoBind);\n\tePosixClient->reqAutoOpenOrders( bAutoBind );\n}\n\n\nvoid TWSClient::reqAccountUpdates( bool subscribe, const std::string &acctCode )\n{\n\tDEBUG_PRINTF(\"REQ_ACCOUNT_DATA %d '%s'\", subscribe, acctCode.c_str() );\n\t\n\tePosixClient->reqAccountUpdates( subscribe, acctCode );\n}\n\n\nvoid TWSClient::reqExecutions(int reqId, const IB::ExecutionFilter& filter)\n{\n\tDEBUG_PRINTF(\"REQ_EXECUTIONS %d\", reqId);\n\t\n\tePosixClient->reqExecutions(reqId, filter);\n}\n\n\nvoid TWSClient::reqIds( int numIds)\n{\n\tDEBUG_PRINTF(\"REQ_IDS %d\", numIds);\n\t\n\tePosixClient->reqIds( numIds );\n}\n\n\nvoid TWSClient::reqContractDetails( int reqId, const IB::Contract &contract )\n{\n\tDEBUG_PRINTF(\"REQ_CONTRACT_DATA %d '%s' '%s' '%s'\",\n\t\treqId, contract.symbol.c_str(), contract.secType.c_str(),\n\t\tcontract.exchange.c_str() );\n\t\n\tePosixClient->reqContractDetails( reqId, contract );\n}\n\n\nvoid TWSClient::setServerLogLevel( int logLevel )\n{\n\tDEBUG_PRINTF(\"SET_SERVER_LOGLEVEL %d\", logLevel);\n\t\n\tePosixClient->setServerLogLevel( logLevel );\n}\n\n\nvoid TWSClient::reqHistoricalData ( int tickerId, const IB::Contract &contract,\n\tconst std::string &endDateTime, const std::string &durationStr,\n\tconst std::string &barSizeSetting, const std::string &whatToShow,\n\tint useRTH, int formatDate )\n{\n\tDEBUG_PRINTF(\"REQ_HISTORICAL_DATA %d \"\n\t\t\"'%s' '%s' '%s' '%s' '%s' '%s' '%s' %d %d\",\n\t\ttickerId, contract.symbol.c_str(), contract.secType.c_str(),\n\t\tcontract.exchange.c_str(), endDateTime.c_str(), durationStr.c_str(),\n\t\tbarSizeSetting.c_str(), whatToShow.c_str(), useRTH, formatDate );\n\t\n\tePosixClient->reqHistoricalData( tickerId, contract, endDateTime,\n\t\tdurationStr, barSizeSetting, whatToShow, useRTH, formatDate );\n}\n\n\nvoid TWSClient::reqCurrentTime()\n{\n\tDEBUG_PRINTF(\"REQ_CURRENT_TIME\");\n\t\n\tePosixClient->reqCurrentTime();\n}\n\n<commit_msg>TWSClient, don't select errorSet<commit_after>#include \"twsClient.h\"\n#include \"twsUtil.h\"\n#include \"debug.h\"\n\n\/\/ from global installed ibtws\n#include \"ibtws\/Contract.h\"\n#include \"ibtws\/Order.h\"\n#include \"ibtws\/OrderState.h\"\n#include \"ibtws\/Execution.h\"\n#include \"ibtws\/TwsSocketClientErrors.h\"\n#include \"ibtws\/EWrapper.h\"\n#include \"ibtws\/EPosixClientSocket.h\"\n\n#include <unistd.h>\n#include <errno.h>\n#include <string.h>\n\n\n\/\/ debug verbosity 0...n\n#define tws_debug_level 1\n#define TWS_DEBUG( _level, _fmt, _msg... ) \\\n\tif( tws_debug_level >= _level ) { \\\n\t\tDEBUG_PRINTF(\"tws debug: \" _fmt, ## _msg); \\\n\t}\n\n\n\n\nTWSClient::TWSClient( IB::EWrapper *ew ) :\n\tmyEWrapper(ew),\n\tePosixClient(NULL)\n{\n}\n\n\nTWSClient::~TWSClient()\n{\n\tif( ePosixClient != NULL ) {\n\t\tdelete ePosixClient;\n\t}\n}\n\n\nbool TWSClient::isConnected() const\n{\n\treturn ( (ePosixClient != NULL) && ePosixClient->isConnected() );\n}\n\n\nvoid TWSClient::connectTWS( const std::string &host, int port, int clientId )\n{\n\tDEBUG_PRINTF(\"connect: %s:%d, clientId: %d\", host.c_str(), port, clientId);\n\t\n\tif( isConnected() ) {\n\t\tmyEWrapper->error( IB::NO_VALID_ID, IB::ALREADY_CONNECTED.code(),\n\t\t\tIB::ALREADY_CONNECTED.msg() );\n\t\treturn;\n\t} else if( ePosixClient != NULL ) {\n\t\tdelete ePosixClient;\n\t}\n\t\n\tePosixClient = new IB::EPosixClientSocket(myEWrapper);\n\t\n\tePosixClient->eConnect( host.c_str(), port, clientId );\n}\n\n\nvoid TWSClient::disconnectTWS()\n{\n\tDEBUG_PRINTF(\"disconnect TWS\");\n\t\n\tif ( !isConnected()) {\n\t\treturn;\n\t}\n\t\n\tePosixClient->eDisconnect();\n\tmyEWrapper->connectionClosed();\n\tDEBUG_PRINTF(\"We are disconnected\");\n}\n\n\nvoid TWSClient::selectStuff( int msec )\n{\n\tstruct timeval tval;\n\ttval.tv_usec = msec * 1000;\n\ttval.tv_sec = 0;\n\t\n\tfd_set readSet, writeSet;\n\t\n\tFD_ZERO( &readSet);\n\twriteSet = readSet;\n\t\n\tint fd = -1;\n\tif( isConnected() ) {\n\t\t\/\/ if not connected then all sets are zero and select will just timeout\n\t\tfd = ePosixClient->fd();\n\t\tassert( fd >= 0 );\n\t\t\n\t\tFD_SET( fd, &readSet);\n\t\tif( !ePosixClient->isOutBufferEmpty()) {\n\t\t\tFD_SET( fd, &writeSet);\n\t\t}\n\t}\n\tint ret = select( fd + 1,\n\t\t&readSet, &writeSet, NULL, &tval );\n\t\/\/\/\/\/ blocking \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\t\n\tif( ret == 0) {\n\t\tTWS_DEBUG( 5 , \"Select timeouted.\" );\n\t\treturn;\n\t} else if( ret < 0) {\n\t\tTWS_DEBUG( 1 , \"Select failed with failed with errno: %s.\",\n\t\t\tstrerror(errno) );\n\t\tdisconnectTWS();\n\t\treturn;\n\t}\n\t\n\tif( FD_ISSET( fd, &writeSet)) {\n\t\tTWS_DEBUG( 1 ,\"Socket is ready for writing.\" );\n\t\tePosixClient->onSend(); \/\/ might disconnect us on socket errors\n\t\tif( !isConnected() ) {\n\t\t\treturn;\n\t\t}\n\t}\n\t\n\tif( FD_ISSET( fd, &readSet)) {\n\t\tTWS_DEBUG( 6 ,\"Socket is ready for reading.\" );\n\t\tePosixClient->onReceive(); \/\/ might disconnect us on socket errors\n\t}\n}\n\n\nint TWSClient::serverVersion()\n{\n\treturn ePosixClient->serverVersion();\n}\n\nstd::string TWSClient::TwsConnectionTime()\n{\n\treturn ePosixClient->TwsConnectionTime();\n}\n\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n\nvoid TWSClient::reqMktData(int tickerId, const IB::Contract &contract,\n\tconst std::string &genericTickList, bool snapshot)\n{\n\tDEBUG_PRINTF( \"REQ_MKT_DATA %d \"\n\t\t\"'%s' '%s' '%s' '%s' '%s' '%g' '%s' '%s' '%s' %d\",\n\t\ttickerId, contract.symbol.c_str(), contract.exchange.c_str(),\n\t\tcontract.secType.c_str(), contract.expiry.c_str(),\n\t\tcontract.right.c_str(), contract.strike, contract.currency.c_str(),\n\t\tcontract.localSymbol.c_str(), genericTickList.c_str(), snapshot );\n\t\n\tePosixClient->reqMktData( tickerId, contract, genericTickList, snapshot );\n}\n\n\nvoid TWSClient::cancelMktData ( int tickerId )\n{\n\tDEBUG_PRINTF(\"CANCEL_MKT_DATA %d\", tickerId);\n\t\n\tePosixClient->cancelMktData( tickerId );\n}\n\n\nvoid TWSClient::placeOrder ( int id, const IB::Contract &contract,\n\tconst IB::Order &order )\n{\n\tDEBUG_PRINTF(\"PLACE_ORDER %d '%s' %ld '%s' %g '%s'\",\n\t\tid, order.orderType.c_str(), order.totalQuantity, order.action.c_str(),\n\t\torder.lmtPrice, contract.symbol.c_str() );\n\t\n\tePosixClient->placeOrder( id, contract, order );\n}\n\n\nvoid TWSClient::cancelOrder ( int id )\n{\n\tDEBUG_PRINTF(\"CANCEL_ORDER %d\", id);\n\t\n\tePosixClient->cancelOrder( id );\n}\n\n\nvoid TWSClient::reqOpenOrders()\n{\n\tDEBUG_PRINTF(\"REQ_OPEN_ORDERS\");\n\t\n\tePosixClient->reqOpenOrders();\n}\n\n\nvoid TWSClient::reqAllOpenOrders()\n{\n\tDEBUG_PRINTF(\"REQ_ALL_OPEN_ORDERS\");\n\tePosixClient->reqAllOpenOrders();\n}\n\n\nvoid TWSClient::reqAutoOpenOrders( bool bAutoBind )\n{\n\tDEBUG_PRINTF(\"REQ_AUTO_OPEN_ORDERS %d\", bAutoBind);\n\tePosixClient->reqAutoOpenOrders( bAutoBind );\n}\n\n\nvoid TWSClient::reqAccountUpdates( bool subscribe, const std::string &acctCode )\n{\n\tDEBUG_PRINTF(\"REQ_ACCOUNT_DATA %d '%s'\", subscribe, acctCode.c_str() );\n\t\n\tePosixClient->reqAccountUpdates( subscribe, acctCode );\n}\n\n\nvoid TWSClient::reqExecutions(int reqId, const IB::ExecutionFilter& filter)\n{\n\tDEBUG_PRINTF(\"REQ_EXECUTIONS %d\", reqId);\n\t\n\tePosixClient->reqExecutions(reqId, filter);\n}\n\n\nvoid TWSClient::reqIds( int numIds)\n{\n\tDEBUG_PRINTF(\"REQ_IDS %d\", numIds);\n\t\n\tePosixClient->reqIds( numIds );\n}\n\n\nvoid TWSClient::reqContractDetails( int reqId, const IB::Contract &contract )\n{\n\tDEBUG_PRINTF(\"REQ_CONTRACT_DATA %d '%s' '%s' '%s'\",\n\t\treqId, contract.symbol.c_str(), contract.secType.c_str(),\n\t\tcontract.exchange.c_str() );\n\t\n\tePosixClient->reqContractDetails( reqId, contract );\n}\n\n\nvoid TWSClient::setServerLogLevel( int logLevel )\n{\n\tDEBUG_PRINTF(\"SET_SERVER_LOGLEVEL %d\", logLevel);\n\t\n\tePosixClient->setServerLogLevel( logLevel );\n}\n\n\nvoid TWSClient::reqHistoricalData ( int tickerId, const IB::Contract &contract,\n\tconst std::string &endDateTime, const std::string &durationStr,\n\tconst std::string &barSizeSetting, const std::string &whatToShow,\n\tint useRTH, int formatDate )\n{\n\tDEBUG_PRINTF(\"REQ_HISTORICAL_DATA %d \"\n\t\t\"'%s' '%s' '%s' '%s' '%s' '%s' '%s' %d %d\",\n\t\ttickerId, contract.symbol.c_str(), contract.secType.c_str(),\n\t\tcontract.exchange.c_str(), endDateTime.c_str(), durationStr.c_str(),\n\t\tbarSizeSetting.c_str(), whatToShow.c_str(), useRTH, formatDate );\n\t\n\tePosixClient->reqHistoricalData( tickerId, contract, endDateTime,\n\t\tdurationStr, barSizeSetting, whatToShow, useRTH, formatDate );\n}\n\n\nvoid TWSClient::reqCurrentTime()\n{\n\tDEBUG_PRINTF(\"REQ_CURRENT_TIME\");\n\t\n\tePosixClient->reqCurrentTime();\n}\n\n<|endoftext|>"} {"text":"<commit_before>#include <spdlog\/spdlog.h>\n#include <src\/pugixml.hpp>\n#include <nanogui\/layout.h>\n#include <nanogui\/opengl.h>\n#include \"glshadersource.hpp\"\n#include \"glshaderobject.hpp\"\n#include \"clickablelabel.hpp\"\n#include \"directpopup.hpp\"\n#include \"sink.hpp\"\n#include \"source.hpp\"\n#include \"graphnodelink.hpp\"\n#include \"graphnode.hpp\"\n#include \"graph.hpp\"\n\n\nNAMESPACE_BEGIN(QCE);\n\nGraphNode::GraphNode(Widget *parent, Graph *parentGraph, const std::string &title) :\n Window(parent, title),\n mParentGraph(parentGraph),\n mAnchorPos(Eigen::Vector2i::Zero()),\n mAnchorHeight(30),\n mShaderObject(nullptr)\n{\n mSize = Eigen::Vector2i(100, 80);\n\n mPopup = new DirectPopup(this, this);\n mPopup->setId(\"graphNodePopup\");\n mPopup->setSize(Eigen::Vector2i(10, 10));\n mPopup->setLayout(new nanogui::GroupLayout());\n mPopup->setVisible(false);\n\n ClickableLabel *removeButton = new ClickableLabel(mPopup, \"Remove\");\n removeButton->setId(\"removeGraphNodeButton\");\n removeButton->setCallback([this](const Eigen::Vector2i &p) {\n spdlog::get(\"qde\")->debug(\n \"GraphNode '{}': Removing\",\n mTitle\n );\n mShaderSource->decTimesUsed();\n \/\/ TODO: Check if this really is the proper way to delete an\n \/\/ object. What happens with the instance here?\n Graph *parentGraph = dynamic_cast<Graph *>(mParent);\n parentGraph->removeChild(this);\n mPopup->setVisible(false);\n });\n}\n\nvoid GraphNode::draw(NVGcontext* ctx)\n{\n refreshRelativePlacement();\n Window::draw(ctx);\n}\n\nvoid GraphNode::addSink(Sink* sink)\n{\n mInputs.push_back(sink);\n sink->incRef();\n}\n\nvoid GraphNode::removeSink(const int index)\n{\n Sink *sink = mInputs[index];\n mInputs.erase(mInputs.begin() + index);\n sink->decRef();\n}\n\nvoid GraphNode::removeSink(const Sink *sink)\n{\n mInputs.erase(std::remove(\n mInputs.begin(),\n mInputs.end(),\n sink\n ), mInputs.end());\n sink->decRef();\n}\n\nvoid GraphNode::addSource(Source *source)\n{\n mOutputs.push_back(source);\n source->incRef();\n}\n\nvoid GraphNode::removeSource(const int index)\n{\n Source *source = mOutputs[index];\n mOutputs.erase(mOutputs.begin() + index);\n source->decRef();\n}\n\nvoid GraphNode::removeSource(const Source *source)\n{\n mOutputs.erase(std::remove(\n mOutputs.begin(),\n mOutputs.end(),\n source\n ), mOutputs.end());\n source->decRef();\n}\n\nbool GraphNode::mouseButtonEvent(const Eigen::Vector2i &p, int button, bool down, int modifiers)\n{\n Window::mouseButtonEvent(p, button, down, modifiers);\n\n if (button == GLFW_MOUSE_BUTTON_1 && mEnabled && down) {\n Graph *parentGraph = dynamic_cast<Graph *>(mParent);\n parentGraph->nodeSelectedEvent(this);\n \n return true;\n }\n\n if (button == GLFW_MOUSE_BUTTON_2 && mEnabled && down) {\n int offsetX = p.x() - mPos.x();\n int offsetY = p.y() - mPos.y();\n Eigen::Vector2i position(offsetX, offsetY);\n mPopup->setAnchorPos(position);\n mPopup->setVisible(!mPopup->visible());\n\n return true;\n }\n\n return false;\n}\n\nbool GraphNode::sinkConnectedEvent(Connector *sink)\n{\n \/\/ May be overridden by child classes.\n return true;\n}\n\n\/\/ May be overridden by child classes.\nstd::string GraphNode::calculateOutput()\n{\n fmt::MemoryWriter output;\n\n for (auto input : mInputs) {\n if (input->link()) {\n GraphNodeLink *link = input->link();\n \/\/ spdlog::get(\"qde\")->debug(\"Node '{}': Input has link: '{}'\", mId, link->id());\n\n if (link->source()) {\n GraphNode *node = dynamic_cast<GraphNode *>(link->source()->parent());\n output << node->calculateOutput();\n spdlog::get(\"qde\")->debug(\"Node '{}': Link has source: '{}'\", mId, node->id());\n }\n }\n }\n\n return output.str();\n}\n\nNAMESPACE_END(QCE);<commit_msg>Log when a mouse button event happens<commit_after>#include <spdlog\/spdlog.h>\n#include <src\/pugixml.hpp>\n#include <nanogui\/layout.h>\n#include <nanogui\/opengl.h>\n#include \"glshadersource.hpp\"\n#include \"glshaderobject.hpp\"\n#include \"clickablelabel.hpp\"\n#include \"directpopup.hpp\"\n#include \"sink.hpp\"\n#include \"source.hpp\"\n#include \"graphnodelink.hpp\"\n#include \"graphnode.hpp\"\n#include \"graph.hpp\"\n\n\nNAMESPACE_BEGIN(QCE);\n\nGraphNode::GraphNode(Widget *parent, Graph *parentGraph, const std::string &title) :\n Window(parent, title),\n mParentGraph(parentGraph),\n mAnchorPos(Eigen::Vector2i::Zero()),\n mAnchorHeight(30),\n mShaderObject(nullptr)\n{\n mSize = Eigen::Vector2i(100, 80);\n\n mPopup = new DirectPopup(this, this);\n mPopup->setId(\"graphNodePopup\");\n mPopup->setSize(Eigen::Vector2i(10, 10));\n mPopup->setLayout(new nanogui::GroupLayout());\n mPopup->setVisible(false);\n\n ClickableLabel *removeButton = new ClickableLabel(mPopup, \"Remove\");\n removeButton->setId(\"removeGraphNodeButton\");\n removeButton->setCallback([this](const Eigen::Vector2i &p) {\n spdlog::get(\"qde\")->debug(\n \"GraphNode '{}': Removing\",\n mTitle\n );\n mShaderSource->decTimesUsed();\n \/\/ TODO: Check if this really is the proper way to delete an\n \/\/ object. What happens with the instance here?\n Graph *parentGraph = dynamic_cast<Graph *>(mParent);\n parentGraph->removeChild(this);\n mPopup->setVisible(false);\n });\n}\n\nvoid GraphNode::draw(NVGcontext* ctx)\n{\n refreshRelativePlacement();\n Window::draw(ctx);\n}\n\nvoid GraphNode::addSink(Sink* sink)\n{\n mInputs.push_back(sink);\n sink->incRef();\n}\n\nvoid GraphNode::removeSink(const int index)\n{\n Sink *sink = mInputs[index];\n mInputs.erase(mInputs.begin() + index);\n sink->decRef();\n}\n\nvoid GraphNode::removeSink(const Sink *sink)\n{\n mInputs.erase(std::remove(\n mInputs.begin(),\n mInputs.end(),\n sink\n ), mInputs.end());\n sink->decRef();\n}\n\nvoid GraphNode::addSource(Source *source)\n{\n mOutputs.push_back(source);\n source->incRef();\n}\n\nvoid GraphNode::removeSource(const int index)\n{\n Source *source = mOutputs[index];\n mOutputs.erase(mOutputs.begin() + index);\n source->decRef();\n}\n\nvoid GraphNode::removeSource(const Source *source)\n{\n mOutputs.erase(std::remove(\n mOutputs.begin(),\n mOutputs.end(),\n source\n ), mOutputs.end());\n source->decRef();\n}\n\nbool GraphNode::mouseButtonEvent(const Eigen::Vector2i &p, int button, bool down, int modifiers)\n{\n spdlog::get(\"qde\")->debug(\n \"GraphNode '{}': Received mouse button event at ({},{}): {}, {}\",\n mTitle, p.x(), p.y(), button, down\n );\n\n Window::mouseButtonEvent(p, button, down, modifiers);\n\n if (button == GLFW_MOUSE_BUTTON_1 && mEnabled && down) {\n Graph *parentGraph = dynamic_cast<Graph *>(mParent);\n parentGraph->nodeSelectedEvent(this);\n\n return true;\n }\n\n if (button == GLFW_MOUSE_BUTTON_2 && mEnabled && down) {\n int offsetX = p.x() - mPos.x();\n int offsetY = p.y() - mPos.y();\n Eigen::Vector2i position(offsetX, offsetY);\n mPopup->setAnchorPos(position);\n mPopup->setVisible(!mPopup->visible());\n\n return true;\n }\n\n return false;\n}\n\nbool GraphNode::sinkConnectedEvent(Connector *sink)\n{\n \/\/ May be overridden by child classes.\n return true;\n}\n\n\/\/ May be overridden by child classes.\nstd::string GraphNode::calculateOutput()\n{\n fmt::MemoryWriter output;\n\n for (auto input : mInputs) {\n if (input->link()) {\n GraphNodeLink *link = input->link();\n \/\/ spdlog::get(\"qde\")->debug(\"Node '{}': Input has link: '{}'\", mId, link->id());\n\n if (link->source()) {\n GraphNode *node = dynamic_cast<GraphNode *>(link->source()->parent());\n output << node->calculateOutput();\n spdlog::get(\"qde\")->debug(\"Node '{}': Link has source: '{}'\", mId, node->id());\n }\n }\n }\n\n return output.str();\n}\n\nNAMESPACE_END(QCE);\n<|endoftext|>"} {"text":"<commit_before>#include \"buffer.hh\"\n#include \"assert.hh\"\n#include \"editor.hh\"\n#include \"selectors.hh\"\n\nusing namespace Kakoune;\n\nvoid test_buffer()\n{\n Buffer buffer(\"test\", Buffer::Type::Scratch, \"allo ?\\nmais que fais la police\\n hein ?\\n youpi\\n\");\n assert(buffer.line_count() == 4);\n\n BufferIterator i = buffer.begin();\n assert(*i == 'a');\n i += 6;\n assert(buffer.line_and_column_at(i) == BufferCoord{0 COMMA 6});\n i += 1;\n assert(buffer.line_and_column_at(i) == BufferCoord{1 COMMA 0});\n --i;\n assert(buffer.line_and_column_at(i) == BufferCoord{0 COMMA 6});\n ++i;\n assert(buffer.line_and_column_at(i) == BufferCoord{1 COMMA 0});\n buffer.modify(Modification::make_insert(i, \"tchou kanaky\\n\"));\n assert(buffer.line_count() == 5);\n\n BufferIterator begin = buffer.iterator_at({ 4, 1 });\n BufferIterator end = buffer.iterator_at({ 4, 5 }) + 1;\n String str = buffer.string(begin, end);\n assert(str == \"youpi\");\n}\n\nvoid test_editor()\n{\n Buffer buffer(\"test\", Buffer::Type::Scratch, \"test\\n\\nyoupi\\n\");\n Editor editor(buffer);\n\n using namespace std::placeholders;\n\n editor.select(select_whole_buffer);\n editor.multi_select(std::bind(select_all_matches, _1, \"\\n\\\\h*\"));\n for (auto& sel : editor.selections())\n {\n assert(*sel.begin() == '\\n');\n editor.buffer().modify(Modification::make_erase(sel.begin(), sel.end()));\n }\n}\n\nvoid test_string()\n{\n assert(int_to_str(124) == \"124\");\n assert(int_to_str(-129) == \"-129\");\n assert(int_to_str(0) == \"0\");\n\n assert(String(\"youpi \") + \"matin\" == \"youpi matin\");\n\n std::vector<String> splited = split(\"youpi:matin::tchou\", ':');\n assert(splited[0] == \"youpi\");\n assert(splited[1] == \"matin\");\n assert(splited[2] == \"\");\n assert(splited[3] == \"tchou\");\n}\n\nvoid run_unit_tests()\n{\n test_string();\n test_buffer();\n test_editor();\n}\n<commit_msg>Correct multi select unit test<commit_after>#include \"buffer.hh\"\n#include \"assert.hh\"\n#include \"editor.hh\"\n#include \"selectors.hh\"\n\nusing namespace Kakoune;\n\nvoid test_buffer()\n{\n Buffer buffer(\"test\", Buffer::Type::Scratch, \"allo ?\\nmais que fais la police\\n hein ?\\n youpi\\n\");\n assert(buffer.line_count() == 4);\n\n BufferIterator i = buffer.begin();\n assert(*i == 'a');\n i += 6;\n assert(buffer.line_and_column_at(i) == BufferCoord{0 COMMA 6});\n i += 1;\n assert(buffer.line_and_column_at(i) == BufferCoord{1 COMMA 0});\n --i;\n assert(buffer.line_and_column_at(i) == BufferCoord{0 COMMA 6});\n ++i;\n assert(buffer.line_and_column_at(i) == BufferCoord{1 COMMA 0});\n buffer.modify(Modification::make_insert(i, \"tchou kanaky\\n\"));\n assert(buffer.line_count() == 5);\n\n BufferIterator begin = buffer.iterator_at({ 4, 1 });\n BufferIterator end = buffer.iterator_at({ 4, 5 }) + 1;\n String str = buffer.string(begin, end);\n assert(str == \"youpi\");\n}\n\nvoid test_editor()\n{\n Buffer buffer(\"test\", Buffer::Type::Scratch, \"test\\n\\nyoupi\\n\");\n Editor editor(buffer);\n\n using namespace std::placeholders;\n\n editor.select(select_whole_buffer);\n editor.multi_select(std::bind(select_all_matches, _1, \"\\\\n\\\\h*\"));\n for (auto& sel : editor.selections())\n {\n assert(*sel.begin() == '\\n');\n editor.buffer().modify(Modification::make_erase(sel.begin(), sel.end()));\n }\n}\n\nvoid test_string()\n{\n assert(int_to_str(124) == \"124\");\n assert(int_to_str(-129) == \"-129\");\n assert(int_to_str(0) == \"0\");\n\n assert(String(\"youpi \") + \"matin\" == \"youpi matin\");\n\n std::vector<String> splited = split(\"youpi:matin::tchou\", ':');\n assert(splited[0] == \"youpi\");\n assert(splited[1] == \"matin\");\n assert(splited[2] == \"\");\n assert(splited[3] == \"tchou\");\n}\n\nvoid run_unit_tests()\n{\n test_string();\n test_buffer();\n test_editor();\n}\n<|endoftext|>"} {"text":"<commit_before>\/* $Id$ *\/\n\n\/*\n * Copyright (c) 2013 Roland van Rijswijk-Deij\n * All 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 ``AS IS'' AND ANY EXPRESS OR\n * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED\n * WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE\n * ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY\n * DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL\n * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE\n * GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS\n * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER\n * IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR\n * OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN\n * IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.\n *\/\n\n\/*****************************************************************************\n silvia_keygen.cpp\n\n Issuer key generation utility\n *****************************************************************************\/\n\n#include \"config.h\"\n#include \"silvia_issuer_keygen.h\"\n#include \"silvia_parameters.h\"\n#include \"silvia_macros.h\"\n#include <string>\n#include <unistd.h>\n\n\/\/ Default modulus size for new keys\n#define DEFAULT_BITSIZE 2048\n\nvoid version(void)\n{\n\tprintf(\"The Simple Library for Verifying and Issuing Attributes (silvia)\\n\");\n\tprintf(\"\\n\");\n\tprintf(\"Issuer key generation utility version %s\\n\", VERSION);\n\tprintf(\"\\n\");\n\tprintf(\"Copyright (c) 2013 Roland van Rijswijk-Deij\\n\\n\");\n\tprintf(\"Use, modification and redistribution of this software is subject to the terms\\n\");\n\tprintf(\"of the license agreement. This software is licensed under a 2-clause BSD-style\\n\");\n\tprintf(\"license a copy of which is included as the file LICENSE in the distribution.\\n\");\n}\n\nvoid usage(void)\n{\n\tprintf(\"Silvia issuer key generation utility %s\\n\\n\", VERSION);\n\tprintf(\"Usage:\\n\");\n\tprintf(\"\\tsilvia_keygen -a <#-attribs> [-n <bits>] [-p <file>] [-P <file>]\\n\");\n\tprintf(\"\\tsilvia_keygen -h\\n\");\n\tprintf(\"\\tsilvia_keygen -v\\n\");\n\tprintf(\"\\n\");\n\tprintf(\"\\t-a <#-attribs> Generate a key-pair supporting credentials with at most\\n\");\n\tprintf(\"\\t <#-attribs> attributes per credentials\\n\");\n\tprintf(\"\\t-n <bits> Generate a key-pair with a <bits>-bit modulus (defaults\\n\");\n\tprintf(\"\\t to %d)\\n\", DEFAULT_BITSIZE);\n\tprintf(\"\\t-p <file> Output the public key to <file> (defaults to stdout)\\n\");\n\tprintf(\"\\t-P <file> Output the private key to <file> (defaults to stdout)\\n\");\n\tprintf(\"\\n\");\n\tprintf(\"\\t-h Print this help message\\n\");\n\tprintf(\"\\n\");\n\tprintf(\"\\t-v Print the version number\\n\");\n}\n\nint generate_key_pair(FILE* pub_key_file, FILE* priv_key_file, size_t num_attribs, size_t bit_size)\n{\n\tprintf(\"Generating %zd-bit issuer key pair for %zd attributes ... \", bit_size, num_attribs); fflush(stdout);\n\t\n\t\/\/ Set key size\n\tsilvia_system_parameters::i()->set_l_n(bit_size);\n\t\n\t\/\/ Generate key-pair\n\tsilvia_pub_key* pub_key;\n\tsilvia_priv_key* priv_key;\n\t\n\tsilvia_issuer_keyfactory::i()->generate_keypair(num_attribs, &pub_key, &priv_key);\n\t\n\tprintf(\"OK\\n\");\n\t\n\t\/\/ Output the public key\n\tfprintf(pub_key_file, \"<?xml version=\\\"1.0\\\" encoding=\\\"UTF-8\\\" standalone=\\\"no\\\"?>\\n\");\n\tfprintf(pub_key_file, \"<IssuerPublicKey xmlns=\\\"http:\/\/www.zurich.ibm.com\/security\/idemix\\\" xmlns:xs=\\\"http:\/\/www.w3.org\/2001\/XMLSchema\\\" xmlns:xsi=\\\"http:\/\/www.w3.org\/2001\/XMLSchema-instance\\\" xsi:schemaLocation=\\\"http:\/\/www.zurich.ibm.com\/security\/idemix IssuerPublicKey.xsd\\\">\\n\");\n\tfprintf(pub_key_file, \" <References>\\n\");\n fprintf(pub_key_file, \" <GroupParameters>http:\/\/www.zurich.ibm.com\/security\/idmx\/v2\/gp.xml<\/GroupParameters>\\n\");\n\tfprintf(pub_key_file, \" <\/References>\\n\");\n\tfprintf(pub_key_file, \" <Elements>\\n\");\n fprintf(pub_key_file, \" <S>\"); fprintmpzdec(pub_key_file, pub_key->get_S()); fprintf(pub_key_file, \"<\/S>\\n\");\n fprintf(pub_key_file, \" <Z>\"); fprintmpzdec(pub_key_file, pub_key->get_Z()); fprintf(pub_key_file, \"<\/Z>\\n\");\n fprintf(pub_key_file, \" <n>\"); fprintmpzdec(pub_key_file, pub_key->get_n()); fprintf(pub_key_file, \"<\/n>\\n\");\n fprintf(pub_key_file, \" <Bases num=\\\"%zd\\\">\\n\", num_attribs);\n \n for (size_t i = 0; i < num_attribs; i++)\n {\n\t\tfprintf(pub_key_file, \" <Base_%zd>\", i); fprintmpzdec(pub_key_file, pub_key->get_R()[i]); fprintf(pub_key_file, \"<\/Base_%zd>\\n\", i);\n\t}\n \n fprintf(pub_key_file, \" <\/Bases>\\n\");\n\tfprintf(pub_key_file, \" <\/Elements>\\n\");\n\tfprintf(pub_key_file, \" <Features>\\n\");\n fprintf(pub_key_file, \" <Epoch length=\\\"432000\\\"\/>\\n\");\n\tfprintf(pub_key_file, \" <\/Features>\\n\");\n\tfprintf(pub_key_file, \"<\/IssuerPublicKey>\\n\");\n\t\n\t\/\/ Output the private key\n\tfprintf(priv_key_file, \"<?xml version=\\\"1.0\\\" encoding=\\\"UTF-8\\\" standalone=\\\"no\\\"?>\\n\");\n\tfprintf(priv_key_file, \"<IssuerPrivateKey xmlns=\\\"http:\/\/www.zurich.ibm.com\/security\/idemix\\\" xmlns:xs=\\\"http:\/\/www.w3.org\/2001\/XMLSchema\\\" xmlns:xsi=\\\"http:\/\/www.w3.org\/2001\/XMLSchema-instance\\\" xsi:schemaLocation=\\\"http:\/\/www.zurich.ibm.com\/security\/idemix IssuerPrivateKey.xsd\\\">\\n\");\n\tfprintf(priv_key_file, \" <References>\\n\");\n fprintf(priv_key_file, \" <IssuerPublicKey>http:\/\/www.issuer.com\/ipk.xml<\/IssuerPublicKey>\\n\");\n\tfprintf(priv_key_file, \" <\/References>\\n\");\n\tfprintf(priv_key_file, \" <Elements>\\n\");\n fprintf(priv_key_file, \" <n>\"); fprintmpzdec(priv_key_file, pub_key->get_n()); fprintf(priv_key_file, \"<\/n>\\n\");\n fprintf(priv_key_file, \" <p>\"); fprintmpzdec(priv_key_file, priv_key->get_p()); fprintf(priv_key_file, \"<\/p>\\n\");\n fprintf(priv_key_file, \" <pPrime>\"); fprintmpzdec(priv_key_file, priv_key->get_p_prime()); fprintf(priv_key_file, \"<\/pPrime>\\n\");\n fprintf(priv_key_file, \" <q>\"); fprintmpzdec(priv_key_file, priv_key->get_q()); fprintf(priv_key_file, \"<\/q>\\n\");\n fprintf(priv_key_file, \" <qPrime>\"); fprintmpzdec(priv_key_file, priv_key->get_q_prime()); fprintf(priv_key_file, \"<\/qPrime>\\n\");\n\tfprintf(priv_key_file, \" <\/Elements>\\n\");\n\tfprintf(priv_key_file, \"<\/IssuerPrivateKey>\\n\");\n\t\n\treturn 1;\n}\n\nint main(int argc, char* argv[])\n{\n\t\/\/ Program parameters\n\tsize_t bit_size = DEFAULT_BITSIZE;\n\tsize_t num_attribs = 0;\n\tstd::string pub_key_filename;\n\tstd::string priv_key_filename;\n\tint c = 0;\n\t\n\twhile ((c = getopt(argc, argv, \"a:n:p:P:hv\")) != -1)\n\t{\n\t\tswitch (c)\n\t\t{\n\t\tcase 'h':\n\t\t\tusage();\n\t\t\treturn 0;\n\t\tcase 'v':\n\t\t\tversion();\n\t\t\treturn 0;\n\t\tcase 'a':\n\t\t\tnum_attribs = atoi(optarg);\n\t\t\tbreak;\n\t\tcase 'n':\n\t\t\tbit_size = atoi(optarg);\n\t\t\tbreak;\n\t\tcase 'p':\n\t\t\tpub_key_filename = std::string(optarg);\n\t\t\tbreak;\n\t\tcase 'P':\n\t\t\tpriv_key_filename = std::string(optarg);\n\t\t\tbreak;\n\t\t}\n\t}\n\t\n\tif (num_attribs <= 0)\n\t{\n\t\tfprintf(stderr, \"Missing argument -a; please specify a number of attributes\\n\");\n\t\t\n\t\treturn -1;\n\t}\n\t\n\tFILE* pub_key_file = stdout;\n\tFILE* priv_key_file = stdout;\n\t\n\tif (!pub_key_filename.empty())\n\t{\n\t\tpub_key_file = fopen(pub_key_filename.c_str(), \"w\");\n\t\t\n\t\tif (pub_key_file == NULL)\n\t\t{\n\t\t\tfprintf(stderr, \"Failed to open %s for writing\\n\", pub_key_filename.c_str());\n\t\t\t\n\t\t\treturn -1;\n\t\t}\n\t\t\n\t\tprintf(\"Writing public key to %s\\n\", pub_key_filename.c_str());\n\t}\n\t\n\tif (!priv_key_filename.empty())\n\t{\n\t\tpriv_key_file = fopen(priv_key_filename.c_str(), \"w\");\n\t\t\n\t\tif (priv_key_file == NULL)\n\t\t{\n\t\t\tfprintf(stderr, \"Failed to open %s for writing\\n\", priv_key_filename.c_str());\n\t\t\t\n\t\t\treturn -1;\n\t\t}\n\t\t\n\t\tprintf(\"Writing private key to %s\\n\", priv_key_filename.c_str());\n\t}\n\t\n\tgenerate_key_pair(pub_key_file, priv_key_file, num_attribs, bit_size);\n\t\n\tif (!pub_key_filename.empty()) fclose(pub_key_file);\n\tif (!priv_key_filename.empty()) fclose(priv_key_file);\n\t\n\treturn 0;\n}\n<commit_msg>Corrected an off-by-one error, with n attributes n+1 bases are needed<commit_after>\/* $Id$ *\/\n\n\/*\n * Copyright (c) 2013 Roland van Rijswijk-Deij\n * All 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 ``AS IS'' AND ANY EXPRESS OR\n * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED\n * WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE\n * ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY\n * DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL\n * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE\n * GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS\n * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER\n * IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR\n * OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN\n * IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.\n *\/\n\n\/*****************************************************************************\n silvia_keygen.cpp\n\n Issuer key generation utility\n *****************************************************************************\/\n\n#include \"config.h\"\n#include \"silvia_issuer_keygen.h\"\n#include \"silvia_parameters.h\"\n#include \"silvia_macros.h\"\n#include <string>\n#include <unistd.h>\n\n\/\/ Default modulus size for new keys\n#define DEFAULT_BITSIZE 2048\n\nvoid version(void)\n{\n\tprintf(\"The Simple Library for Verifying and Issuing Attributes (silvia)\\n\");\n\tprintf(\"\\n\");\n\tprintf(\"Issuer key generation utility version %s\\n\", VERSION);\n\tprintf(\"\\n\");\n\tprintf(\"Copyright (c) 2013 Roland van Rijswijk-Deij\\n\\n\");\n\tprintf(\"Use, modification and redistribution of this software is subject to the terms\\n\");\n\tprintf(\"of the license agreement. This software is licensed under a 2-clause BSD-style\\n\");\n\tprintf(\"license a copy of which is included as the file LICENSE in the distribution.\\n\");\n}\n\nvoid usage(void)\n{\n\tprintf(\"Silvia issuer key generation utility %s\\n\\n\", VERSION);\n\tprintf(\"Usage:\\n\");\n\tprintf(\"\\tsilvia_keygen -a <#-attribs> [-n <bits>] [-p <file>] [-P <file>]\\n\");\n\tprintf(\"\\tsilvia_keygen -h\\n\");\n\tprintf(\"\\tsilvia_keygen -v\\n\");\n\tprintf(\"\\n\");\n\tprintf(\"\\t-a <#-attribs> Generate a key-pair supporting credentials with at most\\n\");\n\tprintf(\"\\t <#-attribs> attributes per credentials\\n\");\n\tprintf(\"\\t-n <bits> Generate a key-pair with a <bits>-bit modulus (defaults\\n\");\n\tprintf(\"\\t to %d)\\n\", DEFAULT_BITSIZE);\n\tprintf(\"\\t-p <file> Output the public key to <file> (defaults to stdout)\\n\");\n\tprintf(\"\\t-P <file> Output the private key to <file> (defaults to stdout)\\n\");\n\tprintf(\"\\n\");\n\tprintf(\"\\t-h Print this help message\\n\");\n\tprintf(\"\\n\");\n\tprintf(\"\\t-v Print the version number\\n\");\n}\n\nint generate_key_pair(FILE* pub_key_file, FILE* priv_key_file, size_t num_attribs, size_t bit_size)\n{\n\tprintf(\"Generating %zd-bit issuer key pair for %zd attributes ... \", bit_size, num_attribs); fflush(stdout);\n\t\n\t\/\/ Set key size\n\tsilvia_system_parameters::i()->set_l_n(bit_size);\n\t\n\t\/\/ Generate key-pair\n\tsilvia_pub_key* pub_key;\n\tsilvia_priv_key* priv_key;\n\t\n\tsilvia_issuer_keyfactory::i()->generate_keypair(num_attribs + 1, &pub_key, &priv_key);\n\t\n\tprintf(\"OK\\n\");\n\t\n\t\/\/ Output the public key\n\tfprintf(pub_key_file, \"<?xml version=\\\"1.0\\\" encoding=\\\"UTF-8\\\" standalone=\\\"no\\\"?>\\n\");\n\tfprintf(pub_key_file, \"<IssuerPublicKey xmlns=\\\"http:\/\/www.zurich.ibm.com\/security\/idemix\\\" xmlns:xs=\\\"http:\/\/www.w3.org\/2001\/XMLSchema\\\" xmlns:xsi=\\\"http:\/\/www.w3.org\/2001\/XMLSchema-instance\\\" xsi:schemaLocation=\\\"http:\/\/www.zurich.ibm.com\/security\/idemix IssuerPublicKey.xsd\\\">\\n\");\n\tfprintf(pub_key_file, \" <References>\\n\");\n fprintf(pub_key_file, \" <GroupParameters>http:\/\/www.zurich.ibm.com\/security\/idmx\/v2\/gp.xml<\/GroupParameters>\\n\");\n\tfprintf(pub_key_file, \" <\/References>\\n\");\n\tfprintf(pub_key_file, \" <Elements>\\n\");\n fprintf(pub_key_file, \" <S>\"); fprintmpzdec(pub_key_file, pub_key->get_S()); fprintf(pub_key_file, \"<\/S>\\n\");\n fprintf(pub_key_file, \" <Z>\"); fprintmpzdec(pub_key_file, pub_key->get_Z()); fprintf(pub_key_file, \"<\/Z>\\n\");\n fprintf(pub_key_file, \" <n>\"); fprintmpzdec(pub_key_file, pub_key->get_n()); fprintf(pub_key_file, \"<\/n>\\n\");\n fprintf(pub_key_file, \" <Bases num=\\\"%zd\\\">\\n\", num_attribs);\n \n for (size_t i = 0; i < num_attribs; i++)\n {\n\t\tfprintf(pub_key_file, \" <Base_%zd>\", i); fprintmpzdec(pub_key_file, pub_key->get_R()[i]); fprintf(pub_key_file, \"<\/Base_%zd>\\n\", i);\n\t}\n \n fprintf(pub_key_file, \" <\/Bases>\\n\");\n\tfprintf(pub_key_file, \" <\/Elements>\\n\");\n\tfprintf(pub_key_file, \" <Features>\\n\");\n fprintf(pub_key_file, \" <Epoch length=\\\"432000\\\"\/>\\n\");\n\tfprintf(pub_key_file, \" <\/Features>\\n\");\n\tfprintf(pub_key_file, \"<\/IssuerPublicKey>\\n\");\n\t\n\t\/\/ Output the private key\n\tfprintf(priv_key_file, \"<?xml version=\\\"1.0\\\" encoding=\\\"UTF-8\\\" standalone=\\\"no\\\"?>\\n\");\n\tfprintf(priv_key_file, \"<IssuerPrivateKey xmlns=\\\"http:\/\/www.zurich.ibm.com\/security\/idemix\\\" xmlns:xs=\\\"http:\/\/www.w3.org\/2001\/XMLSchema\\\" xmlns:xsi=\\\"http:\/\/www.w3.org\/2001\/XMLSchema-instance\\\" xsi:schemaLocation=\\\"http:\/\/www.zurich.ibm.com\/security\/idemix IssuerPrivateKey.xsd\\\">\\n\");\n\tfprintf(priv_key_file, \" <References>\\n\");\n fprintf(priv_key_file, \" <IssuerPublicKey>http:\/\/www.issuer.com\/ipk.xml<\/IssuerPublicKey>\\n\");\n\tfprintf(priv_key_file, \" <\/References>\\n\");\n\tfprintf(priv_key_file, \" <Elements>\\n\");\n fprintf(priv_key_file, \" <n>\"); fprintmpzdec(priv_key_file, pub_key->get_n()); fprintf(priv_key_file, \"<\/n>\\n\");\n fprintf(priv_key_file, \" <p>\"); fprintmpzdec(priv_key_file, priv_key->get_p()); fprintf(priv_key_file, \"<\/p>\\n\");\n fprintf(priv_key_file, \" <pPrime>\"); fprintmpzdec(priv_key_file, priv_key->get_p_prime()); fprintf(priv_key_file, \"<\/pPrime>\\n\");\n fprintf(priv_key_file, \" <q>\"); fprintmpzdec(priv_key_file, priv_key->get_q()); fprintf(priv_key_file, \"<\/q>\\n\");\n fprintf(priv_key_file, \" <qPrime>\"); fprintmpzdec(priv_key_file, priv_key->get_q_prime()); fprintf(priv_key_file, \"<\/qPrime>\\n\");\n\tfprintf(priv_key_file, \" <\/Elements>\\n\");\n\tfprintf(priv_key_file, \"<\/IssuerPrivateKey>\\n\");\n\t\n\treturn 1;\n}\n\nint main(int argc, char* argv[])\n{\n\t\/\/ Program parameters\n\tsize_t bit_size = DEFAULT_BITSIZE;\n\tsize_t num_attribs = 0;\n\tstd::string pub_key_filename;\n\tstd::string priv_key_filename;\n\tint c = 0;\n\t\n\twhile ((c = getopt(argc, argv, \"a:n:p:P:hv\")) != -1)\n\t{\n\t\tswitch (c)\n\t\t{\n\t\tcase 'h':\n\t\t\tusage();\n\t\t\treturn 0;\n\t\tcase 'v':\n\t\t\tversion();\n\t\t\treturn 0;\n\t\tcase 'a':\n\t\t\tnum_attribs = atoi(optarg);\n\t\t\tbreak;\n\t\tcase 'n':\n\t\t\tbit_size = atoi(optarg);\n\t\t\tbreak;\n\t\tcase 'p':\n\t\t\tpub_key_filename = std::string(optarg);\n\t\t\tbreak;\n\t\tcase 'P':\n\t\t\tpriv_key_filename = std::string(optarg);\n\t\t\tbreak;\n\t\t}\n\t}\n\t\n\tif (num_attribs <= 0)\n\t{\n\t\tfprintf(stderr, \"Missing argument -a; please specify a number of attributes\\n\");\n\t\t\n\t\treturn -1;\n\t}\n\t\n\tFILE* pub_key_file = stdout;\n\tFILE* priv_key_file = stdout;\n\t\n\tif (!pub_key_filename.empty())\n\t{\n\t\tpub_key_file = fopen(pub_key_filename.c_str(), \"w\");\n\t\t\n\t\tif (pub_key_file == NULL)\n\t\t{\n\t\t\tfprintf(stderr, \"Failed to open %s for writing\\n\", pub_key_filename.c_str());\n\t\t\t\n\t\t\treturn -1;\n\t\t}\n\t\t\n\t\tprintf(\"Writing public key to %s\\n\", pub_key_filename.c_str());\n\t}\n\t\n\tif (!priv_key_filename.empty())\n\t{\n\t\tpriv_key_file = fopen(priv_key_filename.c_str(), \"w\");\n\t\t\n\t\tif (priv_key_file == NULL)\n\t\t{\n\t\t\tfprintf(stderr, \"Failed to open %s for writing\\n\", priv_key_filename.c_str());\n\t\t\t\n\t\t\treturn -1;\n\t\t}\n\t\t\n\t\tprintf(\"Writing private key to %s\\n\", priv_key_filename.c_str());\n\t}\n\t\n\tgenerate_key_pair(pub_key_file, priv_key_file, num_attribs, bit_size);\n\t\n\tif (!pub_key_filename.empty()) fclose(pub_key_file);\n\tif (!priv_key_filename.empty()) fclose(priv_key_file);\n\t\n\treturn 0;\n}\n<|endoftext|>"} {"text":"<commit_before>#include <mysql_priv.h>\n#include <mysql\/plugin.h>\n#include <groonga.h>\n#include \"ha_groonga.h\"\n\ngrn_ctx *mrn_ctx_sys;\nconst char *mrn_log_name=\"groonga.log\";\nstatic FILE *mrn_log_file = NULL;\n\nvoid mrn_logger_func(int level, const char *time, const char *title,\n\t\t const char *msg, const char *location, void *func_arg)\n{\n const char slev[] = \" EACewnid-\";\n if (mrn_log_file) {\n fprintf(mrn_log_file, \"%s|%c|%u|%s %s\\n\", time,\n\t *(slev + level), (uint)pthread_self(), location, msg);\n fflush(mrn_log_file);\n }\n}\n\ngrn_logger_info mrn_logger_info = {\n GRN_LOG_DUMP,\n GRN_LOG_TIME|GRN_LOG_MESSAGE|GRN_LOG_LOCATION,\n mrn_logger_func,\n NULL\n};\n\n\n#ifdef __cplusplus\nextern \"C\" {\n#endif\n\nstatic int mrn_init(void *p);\nstatic int mrn_fin(void *p);\nstatic handler *mrn_handler_create(handlerton *hton,\n\t\t\t\t TABLE_SHARE *share,\n\t\t\t\t MEM_ROOT *root);\n\nstruct st_mysql_storage_engine storage_engine_structure =\n{ MYSQL_HANDLERTON_INTERFACE_VERSION };\n\nmysql_declare_plugin(groonga)\n{\n MYSQL_STORAGE_ENGINE_PLUGIN,\n &storage_engine_structure,\n \"Groonga\",\n \"Tetsuro IKEDA\",\n \"An Embeddable Fulltext Search Engine\",\n PLUGIN_LICENSE_GPL,\n mrn_init,\n mrn_fin,\n 0x0001,\n NULL,\n NULL,\n NULL\n}\nmysql_declare_plugin_end;\n\nha_groonga::ha_groonga(handlerton *hton, TABLE_SHARE *share)\n :handler(hton, share)\n{\n MRN_ENTER;\n MRN_RETURN_VOID;\n}\n\nha_groonga::~ha_groonga()\n{\n MRN_ENTER;\n MRN_RETURN_VOID;\n}\n\nconst char *ha_groonga::table_type() const\n{\n MRN_ENTER;\n MRN_RETURN_S(\"Groonga\");\n}\n\nstatic const char*ha_groonga_exts[] = {\n NullS\n};\nconst char **ha_groonga::bas_ext() const\n{\n MRN_ENTER;\n MRN_RETURN_P(ha_groonga_exts);\n}\n\nulonglong ha_groonga::table_flags() const\n{\n MRN_ENTER;\n MRN_RETURN(0);\n}\n\nulong ha_groonga::index_flags(uint idx, uint part, bool all_parts) const\n{\n MRN_ENTER;\n MRN_RETURN(0);\n}\n\nint ha_groonga::create(const char *name, TABLE *form, HA_CREATE_INFO *info)\n{\n MRN_ENTER;\n MRN_RETURN(0);\n}\n\nint ha_groonga::open(const char *name, int mode, uint test_if_locked)\n{\n MRN_ENTER;\n MRN_RETURN(0);\n}\n\nint ha_groonga::close()\n{\n MRN_ENTER;\n MRN_RETURN(0);\n}\n\nint ha_groonga::info(uint flag)\n{\n MRN_ENTER;\n MRN_RETURN(0);\n}\n\nTHR_LOCK_DATA **ha_groonga::store_lock(THD *thd,\n\t\t\t\t THR_LOCK_DATA **to,\n\t\t\t\t enum thr_lock_type lock_type)\n{\n MRN_ENTER;\n MRN_RETURN(0);\n}\n\nint ha_groonga::rnd_init(bool scan)\n{\n MRN_ENTER;\n MRN_RETURN(0);\n}\n\nint ha_groonga::rnd_next(uchar *buf)\n{\n MRN_ENTER;\n MRN_RETURN(HA_ERR_END_OF_FILE);\n}\n\nint ha_groonga::rnd_pos(uchar *buf, uchar *pos)\n{\n MRN_ENTER;\n MRN_RETURN(HA_ERR_WRONG_COMMAND);\n}\n\nvoid ha_groonga::position(const uchar *record)\n{\n MRN_ENTER;\n MRN_RETURN_VOID;\n}\n\nbool mrn_flush_logs(handlerton *hton)\n{\n MRN_ENTER;\n MRN_LOG(GRN_LOG_NOTICE, \"logfile closed by FLUSH LOGS\");\n fflush(mrn_log_file);\n fclose(mrn_log_file);\n mrn_log_file = fopen(mrn_log_name, \"a\");\n MRN_LOG(GRN_LOG_NOTICE, \"logfile re-opened by FLUSH LOGS\");\n MRN_RETURN(true);\n}\n\nstatic int mrn_init(void *p)\n{\n MRN_ENTER;\n handlerton *hton;\n hton = (handlerton *)p;\n hton->state = SHOW_OPTION_YES;\n hton->create = mrn_handler_create;\n hton->flush_logs = mrn_flush_logs;\n hton->flags = 0;\n grn_init();\n mrn_ctx_sys = (grn_ctx *) malloc(sizeof (grn_ctx));\n grn_ctx_init(mrn_ctx_sys, GRN_CTX_USE_DB, GRN_ENC_UTF8);\n if (!(mrn_log_file = fopen(mrn_log_name, \"a\"))) {\n MRN_RETURN(-1);\n }\n grn_logger_info_set(mrn_ctx_sys, &mrn_logger_info);\n MRN_LOG(GRN_LOG_NOTICE, \"gronnga engine started\");\n MRN_RETURN(0);\n}\n\nstatic int mrn_fin(void *p)\n{\n MRN_ENTER;\n MRN_LOG(GRN_LOG_NOTICE, \"stopping groonga engine\");\n fflush(mrn_log_file);\n fclose(mrn_log_file);\n grn_fin();\n MRN_RETURN(0);\n}\n\nstatic handler *mrn_handler_create(handlerton *hton,\n\t\t\t\t TABLE_SHARE *share,\n\t\t\t\t MEM_ROOT *root)\n{\n MRN_ENTER;\n MRN_RETURN_P(new (root) ha_groonga(hton, share));\n}\n\n#ifdef __cplusplus\n}\n#endif\n\n<commit_msg>added global mutex object added mutex-lock on mrn_flush_logs \tmodified: src\/ha_groonga.cc<commit_after>#include <mysql_priv.h>\n#include <mysql\/plugin.h>\n#include <groonga.h>\n#include \"ha_groonga.h\"\n#include <pthread.h>\n\npthread_mutex_t mrn_mutex_sys;\ngrn_ctx *mrn_ctx_sys;\nconst char *mrn_log_name=\"groonga.log\";\nstatic FILE *mrn_log_file = NULL;\n\nvoid mrn_logger_func(int level, const char *time, const char *title,\n\t\t const char *msg, const char *location, void *func_arg)\n{\n const char slev[] = \" EACewnid-\";\n if (mrn_log_file) {\n fprintf(mrn_log_file, \"%s|%c|%u|%s %s\\n\", time,\n\t *(slev + level), (uint)pthread_self(), location, msg);\n fflush(mrn_log_file);\n }\n}\n\ngrn_logger_info mrn_logger_info = {\n GRN_LOG_DUMP,\n GRN_LOG_TIME|GRN_LOG_MESSAGE|GRN_LOG_LOCATION,\n mrn_logger_func,\n NULL\n};\n\n\n#ifdef __cplusplus\nextern \"C\" {\n#endif\n\nstatic int mrn_init(void *p);\nstatic int mrn_fin(void *p);\nstatic handler *mrn_handler_create(handlerton *hton,\n\t\t\t\t TABLE_SHARE *share,\n\t\t\t\t MEM_ROOT *root);\n\nstruct st_mysql_storage_engine storage_engine_structure =\n{ MYSQL_HANDLERTON_INTERFACE_VERSION };\n\nmysql_declare_plugin(groonga)\n{\n MYSQL_STORAGE_ENGINE_PLUGIN,\n &storage_engine_structure,\n \"Groonga\",\n \"Tetsuro IKEDA\",\n \"An Embeddable Fulltext Search Engine\",\n PLUGIN_LICENSE_GPL,\n mrn_init,\n mrn_fin,\n 0x0001,\n NULL,\n NULL,\n NULL\n}\nmysql_declare_plugin_end;\n\nha_groonga::ha_groonga(handlerton *hton, TABLE_SHARE *share)\n :handler(hton, share)\n{\n MRN_ENTER;\n MRN_RETURN_VOID;\n}\n\nha_groonga::~ha_groonga()\n{\n MRN_ENTER;\n MRN_RETURN_VOID;\n}\n\nconst char *ha_groonga::table_type() const\n{\n MRN_ENTER;\n MRN_RETURN_S(\"Groonga\");\n}\n\nstatic const char*ha_groonga_exts[] = {\n NullS\n};\nconst char **ha_groonga::bas_ext() const\n{\n MRN_ENTER;\n MRN_RETURN_P(ha_groonga_exts);\n}\n\nulonglong ha_groonga::table_flags() const\n{\n MRN_ENTER;\n MRN_RETURN(0);\n}\n\nulong ha_groonga::index_flags(uint idx, uint part, bool all_parts) const\n{\n MRN_ENTER;\n MRN_RETURN(0);\n}\n\nint ha_groonga::create(const char *name, TABLE *form, HA_CREATE_INFO *info)\n{\n MRN_ENTER;\n MRN_RETURN(0);\n}\n\nint ha_groonga::open(const char *name, int mode, uint test_if_locked)\n{\n MRN_ENTER;\n MRN_RETURN(0);\n}\n\nint ha_groonga::close()\n{\n MRN_ENTER;\n MRN_RETURN(0);\n}\n\nint ha_groonga::info(uint flag)\n{\n MRN_ENTER;\n MRN_RETURN(0);\n}\n\nTHR_LOCK_DATA **ha_groonga::store_lock(THD *thd,\n\t\t\t\t THR_LOCK_DATA **to,\n\t\t\t\t enum thr_lock_type lock_type)\n{\n MRN_ENTER;\n MRN_RETURN(0);\n}\n\nint ha_groonga::rnd_init(bool scan)\n{\n MRN_ENTER;\n MRN_RETURN(0);\n}\n\nint ha_groonga::rnd_next(uchar *buf)\n{\n MRN_ENTER;\n MRN_RETURN(HA_ERR_END_OF_FILE);\n}\n\nint ha_groonga::rnd_pos(uchar *buf, uchar *pos)\n{\n MRN_ENTER;\n MRN_RETURN(HA_ERR_WRONG_COMMAND);\n}\n\nvoid ha_groonga::position(const uchar *record)\n{\n MRN_ENTER;\n MRN_RETURN_VOID;\n}\n\nbool mrn_flush_logs(handlerton *hton)\n{\n MRN_ENTER;\n pthread_mutex_lock(&mrn_mutex_sys);\n MRN_LOG(GRN_LOG_NOTICE, \"logfile closed by FLUSH LOGS\");\n fflush(mrn_log_file);\n fclose(mrn_log_file);\n mrn_log_file = fopen(mrn_log_name, \"a\");\n MRN_LOG(GRN_LOG_NOTICE, \"logfile re-opened by FLUSH LOGS\");\n pthread_mutex_unlock(&mrn_mutex_sys);\n MRN_RETURN(true);\n}\n\nstatic int mrn_init(void *p)\n{\n MRN_ENTER;\n handlerton *hton;\n hton = (handlerton *)p;\n hton->state = SHOW_OPTION_YES;\n hton->create = mrn_handler_create;\n hton->flush_logs = mrn_flush_logs;\n hton->flags = 0;\n\n pthread_mutex_init(&mrn_mutex_sys, MY_MUTEX_INIT_FAST);\n\n grn_init();\n mrn_ctx_sys = (grn_ctx *) malloc(sizeof (grn_ctx));\n grn_ctx_init(mrn_ctx_sys, GRN_CTX_USE_DB, GRN_ENC_UTF8);\n\n if (!(mrn_log_file = fopen(mrn_log_name, \"a\"))) {\n MRN_RETURN(-1);\n }\n grn_logger_info_set(mrn_ctx_sys, &mrn_logger_info);\n\n MRN_LOG(GRN_LOG_NOTICE, \"gronnga engine started\");\n MRN_RETURN(0);\n}\n\nstatic int mrn_fin(void *p)\n{\n MRN_ENTER;\n MRN_LOG(GRN_LOG_NOTICE, \"stopping groonga engine\");\n fflush(mrn_log_file);\n fclose(mrn_log_file);\n grn_fin();\n MRN_RETURN(0);\n}\n\nstatic handler *mrn_handler_create(handlerton *hton,\n\t\t\t\t TABLE_SHARE *share,\n\t\t\t\t MEM_ROOT *root)\n{\n MRN_ENTER;\n MRN_RETURN_P(new (root) ha_groonga(hton, share));\n}\n\n#ifdef __cplusplus\n}\n#endif\n\n<|endoftext|>"} {"text":"<commit_before>\/\/ Copyright (c) 2009-2010 Satoshi Nakamoto\n\/\/ Copyright (c) 2009-2019 The Bitcoin Core developers\n\/\/ Distributed under the MIT software license, see the accompanying\n\/\/ file COPYING or http:\/\/www.opensource.org\/licenses\/mit-license.php.\n\n#if defined(HAVE_CONFIG_H)\n#include <config\/bitcoin-config.h>\n#endif\n\n#include <compat.h>\n#include <util\/time.h>\n\n#include <boost\/date_time\/posix_time\/posix_time.hpp>\n\n#include <tinyformat.h>\n\n#include <atomic>\n#include <ctime>\n#include <thread>\n\nvoid UninterruptibleSleep(const std::chrono::microseconds &n) {\n std::this_thread::sleep_for(n);\n}\n\n\/\/! For unit testing\nstatic std::atomic<int64_t> nMockTime(0);\n\nint64_t GetTime() {\n int64_t mocktime = nMockTime.load(std::memory_order_relaxed);\n if (mocktime) {\n return mocktime;\n }\n\n time_t now = time(nullptr);\n assert(now > 0);\n return now;\n}\n\nbool ChronoSanityCheck() {\n \/\/ std::chrono::system_clock.time_since_epoch and time_t(0) are not\n \/\/ guaranteed to use the Unix epoch timestamp, prior to C++20, but in\n \/\/ practice they almost certainly will. Any differing behavior will be\n \/\/ assumed to be an error, unless certain platforms prove to consistently\n \/\/ deviate, at which point we'll cope with it by adding offsets.\n\n \/\/ Create a new clock from time_t(0) and make sure that it represents 0\n \/\/ seconds from the system_clock's time_since_epoch. Then convert that back\n \/\/ to a time_t and verify that it's the same as before.\n const time_t time_t_epoch{};\n auto clock = std::chrono::system_clock::from_time_t(time_t_epoch);\n if (std::chrono::duration_cast<std::chrono::seconds>(\n clock.time_since_epoch())\n .count() != 0) {\n return false;\n }\n\n time_t time_val = std::chrono::system_clock::to_time_t(clock);\n if (time_val != time_t_epoch) {\n return false;\n }\n\n \/\/ Check that the above zero time is actually equal to the known unix\n \/\/ timestamp.\n struct tm epoch;\n#ifdef _WIN32\n if (gmtime_s(&epoch, &time_val) != 0) {\n#else\n if (gmtime_r(&time_val, &epoch) == nullptr) {\n#endif\n return false;\n }\n\n if ((epoch.tm_sec != 0) || (epoch.tm_min != 0) || (epoch.tm_hour != 0) ||\n (epoch.tm_mday != 1) || (epoch.tm_mon != 0) || (epoch.tm_year != 70)) {\n return false;\n }\n return true;\n}\n\ntemplate <typename T> T GetTime() {\n const std::chrono::seconds mocktime{\n nMockTime.load(std::memory_order_relaxed)};\n\n return std::chrono::duration_cast<T>(\n mocktime.count() ? mocktime\n : std::chrono::microseconds{GetTimeMicros()});\n}\ntemplate std::chrono::seconds GetTime();\ntemplate std::chrono::milliseconds GetTime();\ntemplate std::chrono::microseconds GetTime();\n\ntemplate <typename T> static T GetSystemTime() {\n const auto now = std::chrono::duration_cast<T>(\n std::chrono::system_clock::now().time_since_epoch());\n assert(now.count() > 0);\n return now;\n}\n\nvoid SetMockTime(int64_t nMockTimeIn) {\n assert(nMockTimeIn >= 0);\n nMockTime.store(nMockTimeIn, std::memory_order_relaxed);\n}\n\nint64_t GetMockTime() {\n return nMockTime.load(std::memory_order_relaxed);\n}\n\nint64_t GetTimeMillis() {\n return int64_t{GetSystemTime<std::chrono::milliseconds>().count()};\n}\n\nint64_t GetTimeMicros() {\n return int64_t{GetSystemTime<std::chrono::microseconds>().count()};\n}\n\nint64_t GetTimeSeconds() {\n return int64_t{GetSystemTime<std::chrono::seconds>().count()};\n}\n\nstd::string FormatISO8601DateTime(int64_t nTime) {\n struct tm ts;\n time_t time_val = nTime;\n#ifdef _WIN32\n if (gmtime_s(&ts, &time_val) != 0) {\n#else\n if (gmtime_r(&time_val, &ts) == nullptr) {\n#endif\n return {};\n }\n return strprintf(\"%04i-%02i-%02iT%02i:%02i:%02iZ\", ts.tm_year + 1900,\n ts.tm_mon + 1, ts.tm_mday, ts.tm_hour, ts.tm_min,\n ts.tm_sec);\n}\n\nstd::string FormatISO8601Date(int64_t nTime) {\n struct tm ts;\n time_t time_val = nTime;\n#ifdef _WIN32\n if (gmtime_s(&ts, &time_val) != 0) {\n#else\n if (gmtime_r(&time_val, &ts) == nullptr) {\n#endif\n return {};\n }\n return strprintf(\"%04i-%02i-%02i\", ts.tm_year + 1900, ts.tm_mon + 1,\n ts.tm_mday);\n}\n\nint64_t ParseISO8601DateTime(const std::string &str) {\n static const boost::posix_time::ptime epoch =\n boost::posix_time::from_time_t(0);\n static const std::locale loc(\n std::locale::classic(),\n new boost::posix_time::time_input_facet(\"%Y-%m-%dT%H:%M:%SZ\"));\n std::istringstream iss(str);\n iss.imbue(loc);\n boost::posix_time::ptime ptime(boost::date_time::not_a_date_time);\n iss >> ptime;\n if (ptime.is_not_a_date_time() || epoch > ptime) {\n return 0;\n }\n return (ptime - epoch).total_seconds();\n}\n\nstruct timeval MillisToTimeval(int64_t nTimeout) {\n struct timeval timeout;\n timeout.tv_sec = nTimeout \/ 1000;\n timeout.tv_usec = (nTimeout % 1000) * 1000;\n return timeout;\n}\n\nstruct timeval MillisToTimeval(std::chrono::milliseconds ms) {\n return MillisToTimeval(count_milliseconds(ms));\n}\n<commit_msg>Simplify GetTime<commit_after>\/\/ Copyright (c) 2009-2010 Satoshi Nakamoto\n\/\/ Copyright (c) 2009-2019 The Bitcoin Core developers\n\/\/ Distributed under the MIT software license, see the accompanying\n\/\/ file COPYING or http:\/\/www.opensource.org\/licenses\/mit-license.php.\n\n#if defined(HAVE_CONFIG_H)\n#include <config\/bitcoin-config.h>\n#endif\n\n#include <compat.h>\n#include <util\/time.h>\n\n#include <boost\/date_time\/posix_time\/posix_time.hpp>\n\n#include <tinyformat.h>\n\n#include <atomic>\n#include <ctime>\n#include <thread>\n\nvoid UninterruptibleSleep(const std::chrono::microseconds &n) {\n std::this_thread::sleep_for(n);\n}\n\n\/\/! For unit testing\nstatic std::atomic<int64_t> nMockTime(0);\n\nbool ChronoSanityCheck() {\n \/\/ std::chrono::system_clock.time_since_epoch and time_t(0) are not\n \/\/ guaranteed to use the Unix epoch timestamp, prior to C++20, but in\n \/\/ practice they almost certainly will. Any differing behavior will be\n \/\/ assumed to be an error, unless certain platforms prove to consistently\n \/\/ deviate, at which point we'll cope with it by adding offsets.\n\n \/\/ Create a new clock from time_t(0) and make sure that it represents 0\n \/\/ seconds from the system_clock's time_since_epoch. Then convert that back\n \/\/ to a time_t and verify that it's the same as before.\n const time_t time_t_epoch{};\n auto clock = std::chrono::system_clock::from_time_t(time_t_epoch);\n if (std::chrono::duration_cast<std::chrono::seconds>(\n clock.time_since_epoch())\n .count() != 0) {\n return false;\n }\n\n time_t time_val = std::chrono::system_clock::to_time_t(clock);\n if (time_val != time_t_epoch) {\n return false;\n }\n\n \/\/ Check that the above zero time is actually equal to the known unix\n \/\/ timestamp.\n struct tm epoch;\n#ifdef _WIN32\n if (gmtime_s(&epoch, &time_val) != 0) {\n#else\n if (gmtime_r(&time_val, &epoch) == nullptr) {\n#endif\n return false;\n }\n\n if ((epoch.tm_sec != 0) || (epoch.tm_min != 0) || (epoch.tm_hour != 0) ||\n (epoch.tm_mday != 1) || (epoch.tm_mon != 0) || (epoch.tm_year != 70)) {\n return false;\n }\n return true;\n}\n\ntemplate <typename T> T GetTime() {\n const std::chrono::seconds mocktime{\n nMockTime.load(std::memory_order_relaxed)};\n\n const auto ret{\n mocktime.count()\n ? mocktime\n : std::chrono::duration_cast<T>(\n std::chrono::system_clock::now().time_since_epoch())};\n assert(ret > 0s);\n return ret;\n}\ntemplate std::chrono::seconds GetTime();\ntemplate std::chrono::milliseconds GetTime();\ntemplate std::chrono::microseconds GetTime();\n\ntemplate <typename T> static T GetSystemTime() {\n const auto now = std::chrono::duration_cast<T>(\n std::chrono::system_clock::now().time_since_epoch());\n assert(now.count() > 0);\n return now;\n}\n\nvoid SetMockTime(int64_t nMockTimeIn) {\n assert(nMockTimeIn >= 0);\n nMockTime.store(nMockTimeIn, std::memory_order_relaxed);\n}\n\nint64_t GetMockTime() {\n return nMockTime.load(std::memory_order_relaxed);\n}\n\nint64_t GetTimeMillis() {\n return int64_t{GetSystemTime<std::chrono::milliseconds>().count()};\n}\n\nint64_t GetTimeMicros() {\n return int64_t{GetSystemTime<std::chrono::microseconds>().count()};\n}\n\nint64_t GetTimeSeconds() {\n return int64_t{GetSystemTime<std::chrono::seconds>().count()};\n}\n\nint64_t GetTime() {\n return GetTime<std::chrono::seconds>().count();\n}\n\nstd::string FormatISO8601DateTime(int64_t nTime) {\n struct tm ts;\n time_t time_val = nTime;\n#ifdef _WIN32\n if (gmtime_s(&ts, &time_val) != 0) {\n#else\n if (gmtime_r(&time_val, &ts) == nullptr) {\n#endif\n return {};\n }\n return strprintf(\"%04i-%02i-%02iT%02i:%02i:%02iZ\", ts.tm_year + 1900,\n ts.tm_mon + 1, ts.tm_mday, ts.tm_hour, ts.tm_min,\n ts.tm_sec);\n}\n\nstd::string FormatISO8601Date(int64_t nTime) {\n struct tm ts;\n time_t time_val = nTime;\n#ifdef _WIN32\n if (gmtime_s(&ts, &time_val) != 0) {\n#else\n if (gmtime_r(&time_val, &ts) == nullptr) {\n#endif\n return {};\n }\n return strprintf(\"%04i-%02i-%02i\", ts.tm_year + 1900, ts.tm_mon + 1,\n ts.tm_mday);\n}\n\nint64_t ParseISO8601DateTime(const std::string &str) {\n static const boost::posix_time::ptime epoch =\n boost::posix_time::from_time_t(0);\n static const std::locale loc(\n std::locale::classic(),\n new boost::posix_time::time_input_facet(\"%Y-%m-%dT%H:%M:%SZ\"));\n std::istringstream iss(str);\n iss.imbue(loc);\n boost::posix_time::ptime ptime(boost::date_time::not_a_date_time);\n iss >> ptime;\n if (ptime.is_not_a_date_time() || epoch > ptime) {\n return 0;\n }\n return (ptime - epoch).total_seconds();\n}\n\nstruct timeval MillisToTimeval(int64_t nTimeout) {\n struct timeval timeout;\n timeout.tv_sec = nTimeout \/ 1000;\n timeout.tv_usec = (nTimeout % 1000) * 1000;\n return timeout;\n}\n\nstruct timeval MillisToTimeval(std::chrono::milliseconds ms) {\n return MillisToTimeval(count_milliseconds(ms));\n}\n<|endoftext|>"} {"text":"<commit_before>\/\/ Copyright (c) 2013, German Neuroinformatics Node (G-Node)\n\/\/\n\/\/ All rights reserved.\n\/\/\n\/\/ Redistribution and use in source and binary forms, with or without\n\/\/ modification, are permitted under the terms of the BSD License. See\n\/\/ LICENSE file in the root of the Project.\n\n#include <string>\n#include <cstdlib>\n#include <mutex>\n#include <math.h>\n\n#include <boost\/date_time\/posix_time\/posix_time.hpp>\n#include <boost\/regex.hpp>\n#include <nix\/util\/util.hpp>\n\n\nusing namespace std;\n\nnamespace nix {\nnamespace util {\n\n\/\/ default id base (16 or 32)\nconst int ID_BASE = 32;\n\/\/ Base32hex alphabet (RFC 4648)\nconst char* ID_ALPHABET = \"0123456789abcdefghijklmnopqrstuv\";\n\/\/ Unit scaling, SI only, substitutions for micro and ohm...\nconst string PREFIXES = \"(Y|Z|E|P|T|G|M|k|h|da|d|c|m|u|n|p|f|a|z|y)\";\nconst string UNITS = \"(m|g|s|A|K|mol|cd|Hz|N|Pa|J|W|C|V|F|S|Wb|T|H|lm|lx|Bq|Gy|Sv|kat|l|L|Ohm|%|dB)\";\nconst string POWER = \"(\\\\^[+-]?[1-9]\\\\d*)\";\n\nconst map<string, double> PREFIX_FACTORS = {{\"y\", 1.0e-24}, {\"z\", 1.0e-21}, {\"a\", 1.0e-18}, {\"f\", 1.0e-15},\n {\"p\", 1.0e-12}, {\"n\",1.0e-9}, {\"u\", 1.0e-6}, {\"m\", 1.0e-3}, {\"c\", 1.0e-2}, {\"d\",1.0e-1}, {\"da\", 1.0e1}, {\"h\", 1.0e2},\n {\"k\", 1.0e3}, {\"M\",1.0e6}, {\"G\", 1.0e9}, {\"T\", 1.0e12}, {\"P\", 1.0e15}, {\"E\",1.0e18}, {\"Z\", 1.0e21}, {\"Y\", 1.0e24}};\n\n\nstring createId(string prefix, int length) {\n static std::once_flag rand_init;\n std::call_once(rand_init, []() { srand(static_cast<unsigned int>(time(0))); });\n\n string id;\n if (prefix.length() > 0) {\n id.append(prefix);\n id.append(\"_\");\n }\n for (int i = 0; i < length; i++) {\n char c = ID_ALPHABET[(size_t) (((double) (rand())) \/ RAND_MAX * ID_BASE)];\n id.push_back(c);\n }\n return id;\n}\n\n\nstring timeToStr(time_t time) {\n using namespace boost::posix_time;\n ptime timetmp = from_time_t(time);\n return to_iso_string(timetmp);\n}\n\n\ntime_t strToTime(const string &time) {\n using namespace boost::posix_time;\n ptime timetmp(from_iso_string(time));\n ptime epoch(boost::gregorian::date(1970, 1, 1));\n return (timetmp - epoch).total_seconds();\n}\n\n\ntime_t getTime() {\n return time(NULL);\n}\n\n\nvoid deblankString(std::string &str) {\n typedef std::string::value_type char_type;\n\n str.erase(std::remove_if(str.begin(),\n str.end(),\n [](char_type c) { return std::isblank(c); }),\n str.end());\n}\n\nstd::string deblankString(const std::string &str) {\n std::string str_copy = str;\n deblankString(str_copy);\n return str_copy;\n}\n\nstd::string unitSanitizer(const std::string &unit) {\n std::string new_unit = deblankString(unit);\n while (new_unit.find(\"mu\") != string::npos) {\n size_t pos = new_unit.find(\"mu\");\n new_unit = new_unit.replace(pos, 2, \"u\");\n\n }\n while (new_unit.find(\"µ\") != string::npos) {\n size_t pos = new_unit.find(\"µ\");\n new_unit = new_unit.replace(pos, 2, \"u\");\n }\n return new_unit;\n}\n\nvoid splitUnit(const string &combinedUnit, string &prefix, string &unit, string &power) {\n boost::regex prefix_and_unit_and_power(PREFIXES + UNITS + POWER);\n boost::regex prefix_and_unit(PREFIXES + UNITS);\n boost::regex unit_and_power(UNITS + POWER);\n boost::regex unit_only(UNITS);\n boost::regex prefix_only(PREFIXES);\n\n if (boost::regex_match(combinedUnit, prefix_and_unit_and_power)) {\n boost::match_results<std::string::const_iterator> m;\n boost::regex_search(combinedUnit, m, prefix_only);\n prefix = m[0];\n string suffix = m.suffix();\n boost::regex_search(suffix, m, unit_only);\n unit = m[0];\n power = m.suffix();\n power = power.substr(1);\n } else if (boost::regex_match(combinedUnit, unit_and_power)) {\n prefix = \"\";\n boost::match_results<std::string::const_iterator> m;\n boost::regex_search(combinedUnit, m, unit_only);\n unit = m[0];\n power = m.suffix();\n power = power.substr(1);\n } else if (boost::regex_match(combinedUnit, prefix_and_unit)) {\n boost::match_results<std::string::const_iterator> m;\n boost::regex_search(combinedUnit, m, prefix_only);\n prefix = m[0];\n unit = m.suffix();\n power = \"\";\n } else {\n unit = combinedUnit;\n prefix = \"\";\n power = \"\";\n }\n}\n\n\nvoid splitCompoundUnit(const std::string &compoundUnit, std::vector<std::string> &atomicUnits) {\n string s = compoundUnit;\n boost::regex opt_prefix_and_unit_and_power(PREFIXES + \"?\" + UNITS + POWER + \"?\");\n boost::regex separator(\"(\\\\*|\/)\");\n boost::match_results<std::string::const_iterator> m;\n\n while (boost::regex_search(s, m, opt_prefix_and_unit_and_power) && (m.suffix().length() > 0)) {\n string suffix = m.suffix();\n atomicUnits.push_back(m[0]);\n s = suffix.substr(1);\n }\n atomicUnits.push_back(m[0]);\n}\n\n\nbool isSIUnit(const string &unit) {\n boost::regex opt_prefix_and_unit_and_power(PREFIXES + \"?\" + UNITS + POWER + \"?\");\n return boost::regex_match(unit, opt_prefix_and_unit_and_power);\n}\n\n\nbool isCompoundSIUnit(const string &unit) {\n string atomic_unit = PREFIXES + \"?\" + UNITS + POWER + \"?\";\n boost::regex compound_unit(\"(\" + atomic_unit + \"(\\\\*|\/))+\"+ atomic_unit);\n return boost::regex_match(unit, compound_unit);\n}\n\n\nbool isScalable(const string &unitA, const string &unitB) {\n if (!(isSIUnit(unitA) && isSIUnit(unitB))) {\n return false;\n }\n string a_unit, a_prefix, a_power;\n string b_unit, b_prefix, b_power;\n splitUnit(unitA, a_prefix, a_unit, a_power);\n splitUnit(unitB, b_prefix, b_unit, b_power);\n if (!(a_unit == b_unit) || !(a_power == b_power) ) {\n return false;\n }\n return true;\n}\n\n\ndouble getSIScaling(const string &originUnit, const string &destinationUnit) {\n double scaling = 1.0;\n if (!isScalable(originUnit, destinationUnit)) {\n throw nix::InvalidUnit(\"Origin unit and destination unit are not scalable versions of the same SI unit!\",\n \"nix::util::getSIScaling\");\n }\n \n string org_unit, org_prefix, org_power;\n string dest_unit, dest_prefix, dest_power;\n splitUnit(originUnit, org_prefix, org_unit, org_power);\n splitUnit(destinationUnit, dest_prefix, dest_unit, dest_power);\n\n if ((org_prefix == dest_prefix) && (org_power == dest_power)) {\n return scaling;\n }\n if (dest_prefix.empty() && !org_prefix.empty()) {\n scaling = PREFIX_FACTORS.at(org_prefix);\n } else if (org_prefix.empty() && !dest_prefix.empty()) {\n scaling = 1.0 \/ PREFIX_FACTORS.at(dest_prefix);\n } else if (!org_prefix.empty() && !dest_prefix.empty()) {\n scaling = PREFIX_FACTORS.at(org_prefix) \/ PREFIX_FACTORS.at(dest_prefix);\n }\n if (!org_power.empty()) {\n int power = std::stoi(org_power);\n scaling = pow(scaling, power);\n }\n return scaling;\n}\n\n} \/\/ namespace util\n} \/\/ namespace nix\n<commit_msg>Moved function bodies of \"convertTo*\" functions from util.hpp to cpp<commit_after>\/\/ Copyright (c) 2013, German Neuroinformatics Node (G-Node)\n\/\/\n\/\/ All rights reserved.\n\/\/\n\/\/ Redistribution and use in source and binary forms, with or without\n\/\/ modification, are permitted under the terms of the BSD License. See\n\/\/ LICENSE file in the root of the Project.\n\n#include <string>\n#include <cstdlib>\n#include <mutex>\n#include <math.h>\n\n#include <boost\/date_time\/posix_time\/posix_time.hpp>\n#include <boost\/regex.hpp>\n#include <nix\/util\/util.hpp>\n\n\nusing namespace std;\n\nnamespace nix {\nnamespace util {\n\n\/\/ default id base (16 or 32)\nconst int ID_BASE = 32;\n\/\/ Base32hex alphabet (RFC 4648)\nconst char* ID_ALPHABET = \"0123456789abcdefghijklmnopqrstuv\";\n\/\/ Unit scaling, SI only, substitutions for micro and ohm...\nconst string PREFIXES = \"(Y|Z|E|P|T|G|M|k|h|da|d|c|m|u|n|p|f|a|z|y)\";\nconst string UNITS = \"(m|g|s|A|K|mol|cd|Hz|N|Pa|J|W|C|V|F|S|Wb|T|H|lm|lx|Bq|Gy|Sv|kat|l|L|Ohm|%|dB)\";\nconst string POWER = \"(\\\\^[+-]?[1-9]\\\\d*)\";\n\nconst map<string, double> PREFIX_FACTORS = {{\"y\", 1.0e-24}, {\"z\", 1.0e-21}, {\"a\", 1.0e-18}, {\"f\", 1.0e-15},\n {\"p\", 1.0e-12}, {\"n\",1.0e-9}, {\"u\", 1.0e-6}, {\"m\", 1.0e-3}, {\"c\", 1.0e-2}, {\"d\",1.0e-1}, {\"da\", 1.0e1}, {\"h\", 1.0e2},\n {\"k\", 1.0e3}, {\"M\",1.0e6}, {\"G\", 1.0e9}, {\"T\", 1.0e12}, {\"P\", 1.0e15}, {\"E\",1.0e18}, {\"Z\", 1.0e21}, {\"Y\", 1.0e24}};\n\n\nstring createId(string prefix, int length) {\n static std::once_flag rand_init;\n std::call_once(rand_init, []() { srand(static_cast<unsigned int>(time(0))); });\n\n string id;\n if (prefix.length() > 0) {\n id.append(prefix);\n id.append(\"_\");\n }\n for (int i = 0; i < length; i++) {\n char c = ID_ALPHABET[(size_t) (((double) (rand())) \/ RAND_MAX * ID_BASE)];\n id.push_back(c);\n }\n return id;\n}\n\n\nstring timeToStr(time_t time) {\n using namespace boost::posix_time;\n ptime timetmp = from_time_t(time);\n return to_iso_string(timetmp);\n}\n\n\ntime_t strToTime(const string &time) {\n using namespace boost::posix_time;\n ptime timetmp(from_iso_string(time));\n ptime epoch(boost::gregorian::date(1970, 1, 1));\n return (timetmp - epoch).total_seconds();\n}\n\n\ntime_t getTime() {\n return time(NULL);\n}\n\n\nvoid deblankString(std::string &str) {\n typedef std::string::value_type char_type;\n\n str.erase(std::remove_if(str.begin(),\n str.end(),\n [](char_type c) { return std::isblank(c); }),\n str.end());\n}\n\nstd::string deblankString(const std::string &str) {\n std::string str_copy = str;\n deblankString(str_copy);\n return str_copy;\n}\n\nstd::string unitSanitizer(const std::string &unit) {\n std::string new_unit = deblankString(unit);\n while (new_unit.find(\"mu\") != string::npos) {\n size_t pos = new_unit.find(\"mu\");\n new_unit = new_unit.replace(pos, 2, \"u\");\n\n }\n while (new_unit.find(\"µ\") != string::npos) {\n size_t pos = new_unit.find(\"µ\");\n new_unit = new_unit.replace(pos, 2, \"u\");\n }\n return new_unit;\n}\n\nvoid splitUnit(const string &combinedUnit, string &prefix, string &unit, string &power) {\n boost::regex prefix_and_unit_and_power(PREFIXES + UNITS + POWER);\n boost::regex prefix_and_unit(PREFIXES + UNITS);\n boost::regex unit_and_power(UNITS + POWER);\n boost::regex unit_only(UNITS);\n boost::regex prefix_only(PREFIXES);\n\n if (boost::regex_match(combinedUnit, prefix_and_unit_and_power)) {\n boost::match_results<std::string::const_iterator> m;\n boost::regex_search(combinedUnit, m, prefix_only);\n prefix = m[0];\n string suffix = m.suffix();\n boost::regex_search(suffix, m, unit_only);\n unit = m[0];\n power = m.suffix();\n power = power.substr(1);\n } else if (boost::regex_match(combinedUnit, unit_and_power)) {\n prefix = \"\";\n boost::match_results<std::string::const_iterator> m;\n boost::regex_search(combinedUnit, m, unit_only);\n unit = m[0];\n power = m.suffix();\n power = power.substr(1);\n } else if (boost::regex_match(combinedUnit, prefix_and_unit)) {\n boost::match_results<std::string::const_iterator> m;\n boost::regex_search(combinedUnit, m, prefix_only);\n prefix = m[0];\n unit = m.suffix();\n power = \"\";\n } else {\n unit = combinedUnit;\n prefix = \"\";\n power = \"\";\n }\n}\n\n\nvoid splitCompoundUnit(const std::string &compoundUnit, std::vector<std::string> &atomicUnits) {\n string s = compoundUnit;\n boost::regex opt_prefix_and_unit_and_power(PREFIXES + \"?\" + UNITS + POWER + \"?\");\n boost::regex separator(\"(\\\\*|\/)\");\n boost::match_results<std::string::const_iterator> m;\n\n while (boost::regex_search(s, m, opt_prefix_and_unit_and_power) && (m.suffix().length() > 0)) {\n string suffix = m.suffix();\n atomicUnits.push_back(m[0]);\n s = suffix.substr(1);\n }\n atomicUnits.push_back(m[0]);\n}\n\n\ntemplate <typename T>\nNIXAPI T convertToSeconds(const std::string &unit, T value) {\n T seconds;\n if (unit == \"min\") {\n seconds = value * 60;\n } else if (unit == \"h\") {\n std::string new_unit = \"min\";\n seconds = convertToSeconds(new_unit, value * 60);\n } else if (unit == \"s\") {\n seconds = value;\n } else {\n std::cerr << \"[nix::util::convertToSeconds] Warning: given unit is not supported!\" << std::endl;\n seconds = value;\n }\n return seconds;\n}\n\n\ntemplate<typename T>\nNIXAPI T convertToKelvin(const std::string &unit, T value) {\n T temperature;\n if (unit == \"°C\" || unit == \"C\") {\n temperature = value + 273.15;\n } else if (unit == \"°F\" || unit == \"F\") {\n double temp = (value - 32) * 5.0\/9 + 273.15;\n temperature = std::is_integral<T>::value ? std::round(temp) : temp;\n } else if (unit == \"°K\" || unit == \"K\") {\n temperature = value;\n } else {\n std::cerr << \"[nix::util::convertToKelvin] Warning: given unit is not supported\" << std::endl;\n temperature = value;\n }\n return temperature;\n}\n\n\nbool isSIUnit(const string &unit) {\n boost::regex opt_prefix_and_unit_and_power(PREFIXES + \"?\" + UNITS + POWER + \"?\");\n return boost::regex_match(unit, opt_prefix_and_unit_and_power);\n}\n\n\nbool isCompoundSIUnit(const string &unit) {\n string atomic_unit = PREFIXES + \"?\" + UNITS + POWER + \"?\";\n boost::regex compound_unit(\"(\" + atomic_unit + \"(\\\\*|\/))+\"+ atomic_unit);\n return boost::regex_match(unit, compound_unit);\n}\n\n\nbool isScalable(const string &unitA, const string &unitB) {\n if (!(isSIUnit(unitA) && isSIUnit(unitB))) {\n return false;\n }\n string a_unit, a_prefix, a_power;\n string b_unit, b_prefix, b_power;\n splitUnit(unitA, a_prefix, a_unit, a_power);\n splitUnit(unitB, b_prefix, b_unit, b_power);\n if (!(a_unit == b_unit) || !(a_power == b_power) ) {\n return false;\n }\n return true;\n}\n\n\ndouble getSIScaling(const string &originUnit, const string &destinationUnit) {\n double scaling = 1.0;\n if (!isScalable(originUnit, destinationUnit)) {\n throw nix::InvalidUnit(\"Origin unit and destination unit are not scalable versions of the same SI unit!\",\n \"nix::util::getSIScaling\");\n }\n \n string org_unit, org_prefix, org_power;\n string dest_unit, dest_prefix, dest_power;\n splitUnit(originUnit, org_prefix, org_unit, org_power);\n splitUnit(destinationUnit, dest_prefix, dest_unit, dest_power);\n\n if ((org_prefix == dest_prefix) && (org_power == dest_power)) {\n return scaling;\n }\n if (dest_prefix.empty() && !org_prefix.empty()) {\n scaling = PREFIX_FACTORS.at(org_prefix);\n } else if (org_prefix.empty() && !dest_prefix.empty()) {\n scaling = 1.0 \/ PREFIX_FACTORS.at(dest_prefix);\n } else if (!org_prefix.empty() && !dest_prefix.empty()) {\n scaling = PREFIX_FACTORS.at(org_prefix) \/ PREFIX_FACTORS.at(dest_prefix);\n }\n if (!org_power.empty()) {\n int power = std::stoi(org_power);\n scaling = pow(scaling, power);\n }\n return scaling;\n}\n\n} \/\/ namespace util\n} \/\/ namespace nix\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 <assert.h>\n#include <math.h>\n#include <string.h>\n#include <chartsql\/expressions\/math.h>\n\nnamespace csql {\nnamespace expressions {\n\nvoid addExpr(int argc, SValue* argv, SValue* out) {\n if (argc != 2) {\n RAISE(\n kRuntimeError,\n \"wrong number of arguments for add. expected: 2, got: %i\", argc);\n }\n\n SValue* lhs = argv;\n SValue* rhs = argv + 1;\n\n switch(lhs->testTypeWithNumericConversion()) {\n case SValue::T_INTEGER:\n switch(rhs->testTypeWithNumericConversion()) {\n case SValue::T_INTEGER:\n *out = SValue((int64_t) (lhs->getInteger() + rhs->getInteger()));\n return;\n case SValue::T_FLOAT:\n *out = SValue((double) (lhs->getInteger() + rhs->getFloat()));\n return;\n default:\n break;\n }\n break;\n case SValue::T_FLOAT:\n switch(rhs->testTypeWithNumericConversion()) {\n case SValue::T_INTEGER:\n *out = SValue((double) (lhs->getFloat() + rhs->getInteger()));\n return;\n case SValue::T_FLOAT:\n *out = SValue((double) (lhs->getFloat() + rhs->getFloat()));\n return;\n default:\n break;\n }\n break;\n default:\n break;\n }\n\n *out = SValue(lhs->toString() + rhs->toString());\n}\n\nvoid subExpr(int argc, SValue* argv, SValue* out) {\n if (argc != 2) {\n RAISE(\n kRuntimeError,\n \"wrong number of arguments for sub. expected: 2, got: %i\", argc);\n }\n\n SValue* lhs = argv;\n SValue* rhs = argv + 1;\n\n switch(lhs->testTypeWithNumericConversion()) {\n case SValue::T_INTEGER:\n switch(rhs->testTypeWithNumericConversion()) {\n case SValue::T_INTEGER:\n *out = SValue((int64_t) (lhs->getInteger() - rhs->getInteger()));\n return;\n case SValue::T_FLOAT:\n *out = SValue((double) (lhs->getInteger() - rhs->getFloat()));\n return;\n default:\n break;\n }\n break;\n case SValue::T_FLOAT:\n switch(rhs->testTypeWithNumericConversion()) {\n case SValue::T_INTEGER:\n *out = SValue((double) (lhs->getFloat() - rhs->getInteger()));\n return;\n case SValue::T_FLOAT:\n *out = SValue((double) (lhs->getFloat() - rhs->getFloat()));\n return;\n default:\n break;\n }\n break;\n default:\n break;\n }\n\n RAISE(kRuntimeError, \"can't subtract %s and %s\",\n lhs->getTypeName(),\n rhs->getTypeName());\n}\n\nvoid mulExpr(int argc, SValue* argv, SValue* out) {\n if (argc != 2) {\n RAISE(\n kRuntimeError,\n \"wrong number of arguments for mul. expected: 2, got: %i\", argc);\n }\n\n SValue* lhs = argv;\n SValue* rhs = argv + 1;\n\n switch(lhs->testTypeWithNumericConversion()) {\n case SValue::T_INTEGER:\n switch(rhs->testTypeWithNumericConversion()) {\n case SValue::T_INTEGER:\n *out = SValue((int64_t) (lhs->getInteger() * rhs->getInteger()));\n return;\n case SValue::T_FLOAT:\n *out = SValue((double) (lhs->getInteger() * rhs->getFloat()));\n return;\n default:\n break;\n }\n break;\n case SValue::T_FLOAT:\n switch(rhs->testTypeWithNumericConversion()) {\n case SValue::T_INTEGER:\n *out = SValue((double) (lhs->getFloat() * rhs->getInteger()));\n return;\n case SValue::T_FLOAT:\n *out = SValue((double) (lhs->getFloat() * rhs->getFloat()));\n return;\n default:\n break;\n }\n break;\n default:\n break;\n }\n\n RAISE(kRuntimeError, \"can't multiply %s and %s\",\n lhs->getTypeName(),\n rhs->getTypeName());\n}\n\nvoid divExpr(int argc, SValue* argv, SValue* out) {\n if (argc != 2) {\n RAISE(\n kRuntimeError,\n \"wrong number of arguments for div. expected: 2, got: %i\", argc);\n }\n\n SValue* lhs = argv;\n SValue* rhs = argv + 1;\n\n switch(lhs->testTypeWithNumericConversion()) {\n case SValue::T_INTEGER:\n switch(rhs->testTypeWithNumericConversion()) {\n case SValue::T_INTEGER:\n *out = SValue((int64_t) (lhs->getInteger() \/ rhs->getInteger()));\n return;\n case SValue::T_FLOAT:\n *out = SValue((double) (lhs->getInteger() \/ rhs->getFloat()));\n return;\n default:\n break;\n }\n break;\n case SValue::T_FLOAT:\n switch(rhs->testTypeWithNumericConversion()) {\n case SValue::T_INTEGER:\n *out = SValue((double) (lhs->getFloat() \/ rhs->getInteger()));\n return;\n case SValue::T_FLOAT:\n *out = SValue((double) (lhs->getFloat() \/ rhs->getFloat()));\n return;\n default:\n break;\n }\n break;\n default:\n break;\n }\n\n RAISE(kRuntimeError, \"can't divide %s and %s\",\n lhs->getTypeName(),\n rhs->getTypeName());\n}\n\nvoid modExpr(int argc, SValue* argv, SValue* out) {\n if (argc != 2) {\n RAISE(\n kRuntimeError,\n \"wrong number of arguments for mod. expected: 2, got: %i\", argc);\n }\n\n SValue* lhs = argv;\n SValue* rhs = argv + 1;\n\n switch(lhs->testTypeWithNumericConversion()) {\n case SValue::T_INTEGER:\n switch(rhs->testTypeWithNumericConversion()) {\n case SValue::T_INTEGER:\n *out = SValue((int64_t) (lhs->getInteger() % rhs->getInteger()));\n return;\n case SValue::T_FLOAT:\n *out = SValue(fmod(lhs->getInteger(), rhs->getFloat()));\n return;\n default:\n break;\n }\n break;\n case SValue::T_FLOAT:\n switch(rhs->testTypeWithNumericConversion()) {\n case SValue::T_INTEGER:\n *out = SValue(fmod(lhs->getFloat(), rhs->getInteger()));\n return;\n case SValue::T_FLOAT:\n *out = SValue(fmod(lhs->getFloat(), rhs->getFloat()));\n return;\n default:\n break;\n }\n break;\n default:\n break;\n }\n\n RAISE(kRuntimeError, \"can't modulo %s and %s\",\n lhs->getTypeName(),\n rhs->getTypeName());\n}\n\nvoid powExpr(int argc, SValue* argv, SValue* out) {\n if (argc != 2) {\n RAISE(\n kRuntimeError,\n \"wrong number of arguments for pow. expected: 2, got: %i\", argc);\n }\n\n SValue* lhs = argv;\n SValue* rhs = argv + 1;\n\n switch(lhs->testTypeWithNumericConversion()) {\n case SValue::T_INTEGER:\n switch(rhs->testTypeWithNumericConversion()) {\n case SValue::T_INTEGER:\n *out = SValue((int64_t) pow(lhs->getInteger(), rhs->getInteger()));\n return;\n case SValue::T_FLOAT:\n *out = SValue((double) pow(lhs->getInteger(), rhs->getFloat()));\n return;\n default:\n break;\n }\n break;\n case SValue::T_FLOAT:\n switch(rhs->testTypeWithNumericConversion()) {\n case SValue::T_INTEGER:\n *out = SValue((double) pow(lhs->getFloat(), rhs->getInteger()));\n return;\n case SValue::T_FLOAT:\n *out = SValue((double) pow(lhs->getFloat(), rhs->getFloat()));\n return;\n default:\n break;\n }\n break;\n default:\n break;\n }\n\n RAISE(kRuntimeError, \"can't pow %s and %s\",\n lhs->getTypeName(),\n rhs->getTypeName());\n}\n\n}\n}\n<commit_msg>handle NULL in math expressions<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 <assert.h>\n#include <math.h>\n#include <string.h>\n#include <chartsql\/expressions\/math.h>\n\nnamespace csql {\nnamespace expressions {\n\nvoid addExpr(int argc, SValue* argv, SValue* out) {\n if (argc != 2) {\n RAISE(\n kRuntimeError,\n \"wrong number of arguments for add. expected: 2, got: %i\", argc);\n }\n\n SValue* lhs = argv;\n SValue* rhs = argv + 1;\n\n switch(lhs->testTypeWithNumericConversion()) {\n case SValue::T_INTEGER:\n switch(rhs->testTypeWithNumericConversion()) {\n case SValue::T_INTEGER:\n *out = SValue((int64_t) (lhs->getInteger() + rhs->getInteger()));\n return;\n case SValue::T_FLOAT:\n *out = SValue((double) (lhs->getInteger() + rhs->getFloat()));\n return;\n case SValue::T_NULL:\n *out = SValue();\n return;\n default:\n break;\n }\n break;\n case SValue::T_FLOAT:\n switch(rhs->testTypeWithNumericConversion()) {\n case SValue::T_INTEGER:\n *out = SValue((double) (lhs->getFloat() + rhs->getInteger()));\n return;\n case SValue::T_FLOAT:\n *out = SValue((double) (lhs->getFloat() + rhs->getFloat()));\n return;\n case SValue::T_NULL:\n *out = SValue();\n return;\n default:\n break;\n }\n break;\n case SValue::T_NULL:\n *out = SValue();\n return;\n default:\n break;\n }\n\n *out = SValue(lhs->toString() + rhs->toString());\n}\n\nvoid subExpr(int argc, SValue* argv, SValue* out) {\n if (argc != 2) {\n RAISE(\n kRuntimeError,\n \"wrong number of arguments for sub. expected: 2, got: %i\", argc);\n }\n\n SValue* lhs = argv;\n SValue* rhs = argv + 1;\n\n switch(lhs->testTypeWithNumericConversion()) {\n case SValue::T_INTEGER:\n switch(rhs->testTypeWithNumericConversion()) {\n case SValue::T_INTEGER:\n *out = SValue((int64_t) (lhs->getInteger() - rhs->getInteger()));\n return;\n case SValue::T_FLOAT:\n *out = SValue((double) (lhs->getInteger() - rhs->getFloat()));\n return;\n case SValue::T_NULL:\n *out = SValue();\n return;\n default:\n break;\n }\n break;\n case SValue::T_FLOAT:\n switch(rhs->testTypeWithNumericConversion()) {\n case SValue::T_INTEGER:\n *out = SValue((double) (lhs->getFloat() - rhs->getInteger()));\n return;\n case SValue::T_FLOAT:\n *out = SValue((double) (lhs->getFloat() - rhs->getFloat()));\n return;\n case SValue::T_NULL:\n *out = SValue();\n return;\n default:\n break;\n }\n break;\n case SValue::T_NULL:\n *out = SValue();\n return;\n default:\n break;\n }\n\n RAISE(kRuntimeError, \"can't subtract %s and %s\",\n lhs->getTypeName(),\n rhs->getTypeName());\n}\n\nvoid mulExpr(int argc, SValue* argv, SValue* out) {\n if (argc != 2) {\n RAISE(\n kRuntimeError,\n \"wrong number of arguments for mul. expected: 2, got: %i\", argc);\n }\n\n SValue* lhs = argv;\n SValue* rhs = argv + 1;\n\n switch(lhs->testTypeWithNumericConversion()) {\n case SValue::T_INTEGER:\n switch(rhs->testTypeWithNumericConversion()) {\n case SValue::T_INTEGER:\n *out = SValue((int64_t) (lhs->getInteger() * rhs->getInteger()));\n return;\n case SValue::T_FLOAT:\n *out = SValue((double) (lhs->getInteger() * rhs->getFloat()));\n return;\n case SValue::T_NULL:\n *out = SValue();\n return;\n default:\n break;\n }\n break;\n case SValue::T_FLOAT:\n switch(rhs->testTypeWithNumericConversion()) {\n case SValue::T_INTEGER:\n *out = SValue((double) (lhs->getFloat() * rhs->getInteger()));\n return;\n case SValue::T_FLOAT:\n *out = SValue((double) (lhs->getFloat() * rhs->getFloat()));\n return;\n case SValue::T_NULL:\n *out = SValue();\n return;\n default:\n break;\n }\n break;\n case SValue::T_NULL:\n *out = SValue();\n return;\n default:\n break;\n }\n\n RAISE(kRuntimeError, \"can't multiply %s and %s\",\n lhs->getTypeName(),\n rhs->getTypeName());\n}\n\nvoid divExpr(int argc, SValue* argv, SValue* out) {\n if (argc != 2) {\n RAISE(\n kRuntimeError,\n \"wrong number of arguments for div. expected: 2, got: %i\", argc);\n }\n\n SValue* lhs = argv;\n SValue* rhs = argv + 1;\n\n switch(lhs->testTypeWithNumericConversion()) {\n case SValue::T_INTEGER:\n switch(rhs->testTypeWithNumericConversion()) {\n case SValue::T_INTEGER:\n *out = SValue((int64_t) (lhs->getInteger() \/ rhs->getInteger()));\n return;\n case SValue::T_FLOAT:\n *out = SValue((double) (lhs->getInteger() \/ rhs->getFloat()));\n return;\n case SValue::T_NULL:\n *out = SValue();\n return;\n default:\n break;\n }\n break;\n case SValue::T_FLOAT:\n switch(rhs->testTypeWithNumericConversion()) {\n case SValue::T_INTEGER:\n *out = SValue((double) (lhs->getFloat() \/ rhs->getInteger()));\n return;\n case SValue::T_FLOAT:\n *out = SValue((double) (lhs->getFloat() \/ rhs->getFloat()));\n return;\n case SValue::T_NULL:\n *out = SValue();\n return;\n default:\n break;\n }\n break;\n case SValue::T_NULL:\n *out = SValue();\n return;\n default:\n break;\n }\n\n RAISE(kRuntimeError, \"can't divide %s and %s\",\n lhs->getTypeName(),\n rhs->getTypeName());\n}\n\nvoid modExpr(int argc, SValue* argv, SValue* out) {\n if (argc != 2) {\n RAISE(\n kRuntimeError,\n \"wrong number of arguments for mod. expected: 2, got: %i\", argc);\n }\n\n SValue* lhs = argv;\n SValue* rhs = argv + 1;\n\n switch(lhs->testTypeWithNumericConversion()) {\n case SValue::T_INTEGER:\n switch(rhs->testTypeWithNumericConversion()) {\n case SValue::T_INTEGER:\n *out = SValue((int64_t) (lhs->getInteger() % rhs->getInteger()));\n return;\n case SValue::T_FLOAT:\n *out = SValue(fmod(lhs->getInteger(), rhs->getFloat()));\n return;\n case SValue::T_NULL:\n *out = SValue();\n return;\n default:\n break;\n }\n break;\n case SValue::T_FLOAT:\n switch(rhs->testTypeWithNumericConversion()) {\n case SValue::T_INTEGER:\n *out = SValue(fmod(lhs->getFloat(), rhs->getInteger()));\n return;\n case SValue::T_FLOAT:\n *out = SValue(fmod(lhs->getFloat(), rhs->getFloat()));\n return;\n case SValue::T_NULL:\n *out = SValue();\n return;\n default:\n break;\n }\n break;\n case SValue::T_NULL:\n *out = SValue();\n return;\n default:\n break;\n }\n\n RAISE(kRuntimeError, \"can't modulo %s and %s\",\n lhs->getTypeName(),\n rhs->getTypeName());\n}\n\nvoid powExpr(int argc, SValue* argv, SValue* out) {\n if (argc != 2) {\n RAISE(\n kRuntimeError,\n \"wrong number of arguments for pow. expected: 2, got: %i\", argc);\n }\n\n SValue* lhs = argv;\n SValue* rhs = argv + 1;\n\n switch(lhs->testTypeWithNumericConversion()) {\n case SValue::T_INTEGER:\n switch(rhs->testTypeWithNumericConversion()) {\n case SValue::T_INTEGER:\n *out = SValue((int64_t) pow(lhs->getInteger(), rhs->getInteger()));\n return;\n case SValue::T_FLOAT:\n *out = SValue((double) pow(lhs->getInteger(), rhs->getFloat()));\n return;\n case SValue::T_NULL:\n *out = SValue();\n return;\n default:\n break;\n }\n break;\n case SValue::T_FLOAT:\n switch(rhs->testTypeWithNumericConversion()) {\n case SValue::T_INTEGER:\n *out = SValue((double) pow(lhs->getFloat(), rhs->getInteger()));\n return;\n case SValue::T_FLOAT:\n *out = SValue((double) pow(lhs->getFloat(), rhs->getFloat()));\n return;\n case SValue::T_NULL:\n *out = SValue();\n return;\n default:\n break;\n }\n break;\n case SValue::T_NULL:\n *out = SValue();\n return;\n default:\n break;\n }\n\n RAISE(kRuntimeError, \"can't pow %s and %s\",\n lhs->getTypeName(),\n rhs->getTypeName());\n}\n\n}\n}\n<|endoftext|>"} {"text":"<commit_before>\/* See LICENSE file for copyright and license details. *\/\n\n#include <QPoint>\n#include <utility>\n#include <algorithm>\n#include <QPainter>\n#include <QGraphicsSceneMouseEvent>\n#include <QGraphicsDropShadowEffect>\n#include <iostream>\n#include <QMetaProperty>\n#include <QDebug>\n\n#include \"scene.hpp\"\n#include \"graphicsnode.hpp\"\n#include \"socket.hpp\"\n\n#include \"edge.hpp\"\n\n using namespace std;\n\n GraphicsDirectedEdge::GraphicsDirectedEdge(QPoint start, QPoint stop,\n qreal factor)\n :_effect(new QGraphicsDropShadowEffect()),\n _start(start),\n _stop(stop),\n _factor(factor),\n _label(new EditableLabel(this)) {\n\n \/\/setFlag(QGraphicsItem::ItemIsSelectable);\n\n _pen.setWidth(2);\n setZValue(-1);\n\n _effect->setBlurRadius(15.0);\n _effect->setColor(QColor(\"#99050505\"));\n setGraphicsEffect(_effect);\n\n _label->setDefaultTextColor(QColor(\"#888888\"));\n \/\/qWarning() << \"[G] Created edge\";\n\n}\n\n GraphicsDirectedEdge::GraphicsDirectedEdge()\n : GraphicsDirectedEdge(QPoint(0, 0), QPoint(0, 0)) {}\n\n GraphicsDirectedEdge::~GraphicsDirectedEdge() {\n\n delete _label;\n delete _effect;\n\n \/\/if (_connection.expired())\n \/\/ qWarning() << \"[G] Edge deleted (connection already dead)\";\n \/\/else\n \/\/ qWarning() << \"[G] Edge deleted (connection \"\n \/\/ << QString::fromStdString(_connection.lock()->name) << \")\";\n }\n\n void GraphicsDirectedEdge::mousePressEvent(QGraphicsSceneMouseEvent* event) {\n QGraphicsPathItem::mousePressEvent(event);\n }\n\n void GraphicsDirectedEdge::set_start(QPoint p) {\n _start = p;\n this->update_path();\n placeLabel();\n }\n\n void GraphicsDirectedEdge::set_stop(QPoint p) {\n _stop = p;\n update_path();\n placeLabel();\n }\n\n void GraphicsDirectedEdge::connect(GraphicsNode* source_node,\n Port* source_port,\n GraphicsNode* sink_node,\n Port* sink_port) {\n connect_source(source_node->getPort(source_port).get()); \/\/ non-owning access to the socket\n connect_sink(sink_node->getPort(sink_port).get()); \/\/ non-owning access to the socket\n}\n\nvoid GraphicsDirectedEdge::establishConnection() {\n\n emit connectionEstablished(shared_from_this());\n\n if(_connection.use_count() == 0)\n throw std::logic_error(\"At that point, the edge should have its underlying connection set!!\");\n\n _label->setPlainText(QString::fromStdString(_connection.lock()->name));\n QObject::connect(_label, &EditableLabel::contentUpdated,\n this, &GraphicsDirectedEdge::setConnectionName);\n\n}\n\nvoid GraphicsDirectedEdge::connect_sink(GraphicsNodeSocket* sink) {\n if (_sink == sink) return;\n\n if (_sink) disconnect_sink();\n\n _sink = sink;\n if (_sink) _sink->connect_edge(shared_from_this());\n\n if (_source) establishConnection();\n}\n\nvoid GraphicsDirectedEdge::connect_source(GraphicsNodeSocket* source) {\n if (_source == source) return;\n\n if (_source) disconnect_source();\n\n _source = source;\n if (_source) _source->connect_edge(shared_from_this());\n\n if (_sink) establishConnection();\n}\n\nvoid GraphicsDirectedEdge::disconnect() {\n disconnect_source();\n disconnect_sink();\n}\n\nvoid GraphicsDirectedEdge::disconnect_sink() {\n if (_sink && _source &&\n _sink->is_connected_to(shared_from_this()) && _source->is_connected_to(shared_from_this()))\n emit connectionDisrupted(shared_from_this());\n\n if (_sink) _sink->disconnect_edge(shared_from_this());\n}\n\nvoid GraphicsDirectedEdge::disconnect_source() {\n if (_sink && _source &&\n _sink->is_connected_to(shared_from_this()) && _source->is_connected_to(shared_from_this()))\n emit connectionDisrupted(shared_from_this());\n\n if (_source) _source->disconnect_edge(shared_from_this());\n}\n\nvoid GraphicsDirectedEdge::placeLabel() {\n QPointF corner{_start + (_stop - _start)\/2};\n _label->setPos(corner);\n}\n\n\nvoid GraphicsDirectedEdge::setConnectionName(const QString& name) {\n _connection.lock()->name = name.toStdString();\n}\n\nvoid GraphicsBezierEdge::update_path() {\n QPoint c1, c2;\n QPainterPath path(_start);\n\n \/\/ compute anchor point offsets\n const qreal min_dist = 0.f;\n \/\/ const qreal max_dist = 250.f;\n qreal dist = 0;\n if (_start.x() <= _stop.x()) {\n dist = std::max(min_dist, (_stop.x() - _start.x()) * _factor);\n } else {\n dist = std::max(min_dist, (_start.x() - _stop.x()) * _factor);\n }\n\n \/\/ dist = std::min(dist, max_dist);\n c1.setX(_start.x() + dist);\n c1.setY(_start.y());\n\n c2.setX(_stop.x() - dist);\n c2.setY(_stop.y());\n\n path.cubicTo(c1, c2, _stop);\n setPath(path);\n}\n\nvoid GraphicsBezierEdge::paint(QPainter* painter,\n const QStyleOptionGraphicsItem* \/*option*\/,\n QWidget* \/*widget*\/) {\n painter->setPen(_pen);\n painter->drawPath(path());\n}\n<commit_msg>Set edge label width<commit_after>\/* See LICENSE file for copyright and license details. *\/\n\n#include <QPoint>\n#include <utility>\n#include <algorithm>\n#include <QPainter>\n#include <QGraphicsSceneMouseEvent>\n#include <QGraphicsDropShadowEffect>\n#include <iostream>\n#include <QMetaProperty>\n#include <QDebug>\n\n#include \"scene.hpp\"\n#include \"graphicsnode.hpp\"\n#include \"socket.hpp\"\n\n#include \"edge.hpp\"\n\n using namespace std;\n\n GraphicsDirectedEdge::GraphicsDirectedEdge(QPoint start, QPoint stop,\n qreal factor)\n :_effect(new QGraphicsDropShadowEffect()),\n _start(start),\n _stop(stop),\n _factor(factor),\n _label(new EditableLabel(this)) {\n\n \/\/setFlag(QGraphicsItem::ItemIsSelectable);\n\n _pen.setWidth(2);\n setZValue(-1);\n\n _effect->setBlurRadius(15.0);\n _effect->setColor(QColor(\"#99050505\"));\n setGraphicsEffect(_effect);\n\n _label->setDefaultTextColor(QColor(\"#888888\"));\n _label->setTextWidth(100);\n \/\/qWarning() << \"[G] Created edge\";\n\n}\n\n GraphicsDirectedEdge::GraphicsDirectedEdge()\n : GraphicsDirectedEdge(QPoint(0, 0), QPoint(0, 0)) {}\n\n GraphicsDirectedEdge::~GraphicsDirectedEdge() {\n\n delete _label;\n delete _effect;\n\n \/\/if (_connection.expired())\n \/\/ qWarning() << \"[G] Edge deleted (connection already dead)\";\n \/\/else\n \/\/ qWarning() << \"[G] Edge deleted (connection \"\n \/\/ << QString::fromStdString(_connection.lock()->name) << \")\";\n }\n\n void GraphicsDirectedEdge::mousePressEvent(QGraphicsSceneMouseEvent* event) {\n QGraphicsPathItem::mousePressEvent(event);\n }\n\n void GraphicsDirectedEdge::set_start(QPoint p) {\n _start = p;\n this->update_path();\n placeLabel();\n }\n\n void GraphicsDirectedEdge::set_stop(QPoint p) {\n _stop = p;\n update_path();\n placeLabel();\n }\n\n void GraphicsDirectedEdge::connect(GraphicsNode* source_node,\n Port* source_port,\n GraphicsNode* sink_node,\n Port* sink_port) {\n connect_source(source_node->getPort(source_port).get()); \/\/ non-owning access to the socket\n connect_sink(sink_node->getPort(sink_port).get()); \/\/ non-owning access to the socket\n}\n\nvoid GraphicsDirectedEdge::establishConnection() {\n\n emit connectionEstablished(shared_from_this());\n\n if(_connection.use_count() == 0)\n throw std::logic_error(\"At that point, the edge should have its underlying connection set!!\");\n\n _label->setPlainText(QString::fromStdString(_connection.lock()->name));\n QObject::connect(_label, &EditableLabel::contentUpdated,\n this, &GraphicsDirectedEdge::setConnectionName);\n\n}\n\nvoid GraphicsDirectedEdge::connect_sink(GraphicsNodeSocket* sink) {\n if (_sink == sink) return;\n\n if (_sink) disconnect_sink();\n\n _sink = sink;\n if (_sink) _sink->connect_edge(shared_from_this());\n\n if (_source) establishConnection();\n}\n\nvoid GraphicsDirectedEdge::connect_source(GraphicsNodeSocket* source) {\n if (_source == source) return;\n\n if (_source) disconnect_source();\n\n _source = source;\n if (_source) _source->connect_edge(shared_from_this());\n\n if (_sink) establishConnection();\n}\n\nvoid GraphicsDirectedEdge::disconnect() {\n disconnect_source();\n disconnect_sink();\n}\n\nvoid GraphicsDirectedEdge::disconnect_sink() {\n if (_sink && _source &&\n _sink->is_connected_to(shared_from_this()) && _source->is_connected_to(shared_from_this()))\n emit connectionDisrupted(shared_from_this());\n\n if (_sink) _sink->disconnect_edge(shared_from_this());\n}\n\nvoid GraphicsDirectedEdge::disconnect_source() {\n if (_sink && _source &&\n _sink->is_connected_to(shared_from_this()) && _source->is_connected_to(shared_from_this()))\n emit connectionDisrupted(shared_from_this());\n\n if (_source) _source->disconnect_edge(shared_from_this());\n}\n\nvoid GraphicsDirectedEdge::placeLabel() {\n QPointF corner{_start + (_stop - _start)\/2};\n _label->setPos(corner);\n}\n\n\nvoid GraphicsDirectedEdge::setConnectionName(const QString& name) {\n _connection.lock()->name = name.toStdString();\n}\n\nvoid GraphicsBezierEdge::update_path() {\n QPoint c1, c2;\n QPainterPath path(_start);\n\n \/\/ compute anchor point offsets\n const qreal min_dist = 0.f;\n \/\/ const qreal max_dist = 250.f;\n qreal dist = 0;\n if (_start.x() <= _stop.x()) {\n dist = std::max(min_dist, (_stop.x() - _start.x()) * _factor);\n } else {\n dist = std::max(min_dist, (_start.x() - _stop.x()) * _factor);\n }\n\n \/\/ dist = std::min(dist, max_dist);\n c1.setX(_start.x() + dist);\n c1.setY(_start.y());\n\n c2.setX(_stop.x() - dist);\n c2.setY(_stop.y());\n\n path.cubicTo(c1, c2, _stop);\n setPath(path);\n}\n\nvoid GraphicsBezierEdge::paint(QPainter* painter,\n const QStyleOptionGraphicsItem* \/*option*\/,\n QWidget* \/*widget*\/) {\n painter->setPen(_pen);\n painter->drawPath(path());\n}\n<|endoftext|>"} {"text":"<commit_before>\/*\n * Copyright 2007-2017 Content Management AG\n * All rights reserved.\n *\n * author: Max Kellermann <mk@cm4all.com>\n *\n * Redistribution and use in source and binary forms, with or without\n * modification, are permitted provided that the following conditions\n * are met:\n *\n * - Redistributions of source code must retain the above copyright\n * notice, this list of conditions and the following disclaimer.\n *\n * - Redistributions in binary form must reproduce the above copyright\n * notice, this list of conditions and the following disclaimer in the\n * documentation and\/or other materials provided with the\n * distribution.\n *\n * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS\n * ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT\n * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS\n * FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE\n * FOUNDATION OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT,\n * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES\n * (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR\n * SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)\n * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT,\n * STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)\n * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED\n * OF THE POSSIBILITY OF SUCH DAMAGE.\n *\/\n\n#include \"Stock.hxx\"\n#include \"Launch.hxx\"\n#include \"stock\/MapStock.hxx\"\n#include \"stock\/Stock.hxx\"\n#include \"stock\/Class.hxx\"\n#include \"stock\/Item.hxx\"\n#include \"access_log\/ChildErrorLog.hxx\"\n#include \"spawn\/ChildOptions.hxx\"\n#include \"spawn\/ExitListener.hxx\"\n#include \"spawn\/Interface.hxx\"\n#include \"pool\/tpool.hxx\"\n#include \"pool\/StringBuilder.hxx\"\n#include \"event\/SocketEvent.hxx\"\n#include \"event\/TimerEvent.hxx\"\n#include \"net\/log\/Datagram.hxx\"\n#include \"io\/Logger.hxx\"\n#include \"util\/Cancellable.hxx\"\n#include \"util\/ConstBuffer.hxx\"\n#include \"util\/Cast.hxx\"\n\n#include <was\/protocol.h>\n\n#include <string>\n\n#include <assert.h>\n#include <stdlib.h>\n#include <unistd.h>\n#include <fcntl.h>\n#include <errno.h>\n#include <string.h>\n#include <sys\/socket.h>\n#include <sys\/un.h>\n#include <signal.h>\n#include <stdlib.h>\n\nstatic constexpr Event::Duration was_idle_timeout = std::chrono::minutes(5);\n\nstruct WasChildParams {\n const char *executable_path;\n\n ConstBuffer<const char *> args;\n\n const ChildOptions &options;\n\n WasChildParams(const char *_executable_path,\n ConstBuffer<const char *> _args,\n const ChildOptions &_options) noexcept\n :executable_path(_executable_path), args(_args),\n options(_options) {}\n\n const char *GetStockKey(struct pool &pool) const noexcept;\n};\n\nclass WasChild final : public StockItem, ExitListener {\n const LLogger logger;\n\n SpawnService &spawn_service;\n\n const std::string tag;\n\n const SocketDescriptor log_socket;\n ChildErrorLog log;\n\n WasProcess process;\n SocketEvent event;\n TimerEvent idle_timeout_event;\n\n \/**\n * If true, then we're waiting for PREMATURE (after the #WasClient\n * has sent #WAS_COMMAND_STOP).\n *\/\n bool stopping = false;\n\n \/**\n * The number of bytes received before #WAS_COMMAND_STOP was sent.\n *\/\n uint64_t input_received;\n\npublic:\n explicit WasChild(CreateStockItem c, SpawnService &_spawn_service,\n const char *_tag, SocketDescriptor _log_socket) noexcept\n :StockItem(c), logger(GetStockName()), spawn_service(_spawn_service),\n tag(_tag != nullptr ? _tag : \"\"),\n log_socket(_log_socket),\n event(c.stock.GetEventLoop(), BIND_THIS_METHOD(EventCallback)),\n idle_timeout_event(c.stock.GetEventLoop(),\n BIND_THIS_METHOD(OnIdleTimeout))\n {\n \/* mark this object as \"unused\" so the destructor doesn't\n attempt to kill the process *\/\n process.pid = -1;\n }\n\n ~WasChild() noexcept override;\n\n auto &GetEventLoop() noexcept {\n return event.GetEventLoop();\n }\n\n bool IsTag(const char *other_tag) const noexcept {\n return tag == other_tag;\n }\n\n \/**\n * Throws on error.\n *\/\n void Launch(const WasChildParams ¶ms) {\n process = was_launch(spawn_service,\n GetStockName(),\n params.executable_path,\n params.args,\n params.options,\n log.EnableClient(GetEventLoop(), log_socket),\n this);\n event.Open(process.control);\n }\n\n void SetSite(const char *_site) noexcept {\n log.SetSite(_site);\n }\n\n void SetUri(const char *_uri) noexcept {\n log.SetUri(_uri);\n }\n\n const WasProcess &GetProcess() const noexcept {\n return process;\n }\n\n void Stop(uint64_t _received) noexcept {\n assert(!is_idle);\n assert(!stopping);\n\n stopping = true;\n input_received = _received;\n }\n\nprivate:\n enum class ReceiveResult {\n SUCCESS, ERROR, AGAIN,\n };\n\n \/**\n * Receive data on the control channel.\n *\/\n ReceiveResult ReceiveControl(void *p, size_t size) noexcept;\n\n \/**\n * Receive and discard data on the control channel.\n *\n * @return true on success\n *\/\n bool DiscardControl(size_t size) noexcept;\n\n \/**\n * Discard the given amount of data from the input pipe.\n *\n * @return true on success\n *\/\n bool DiscardInput(uint64_t remaining) noexcept;\n\n \/**\n * Attempt to recover after the WAS client sent STOP to the\n * application. This method waits for PREMATURE and discards\n * excess data from the pipe.\n *\/\n void RecoverStop() noexcept;\n\n void EventCallback(unsigned events) noexcept;\n void OnIdleTimeout() noexcept;\n\npublic:\n \/* virtual methods from class StockItem *\/\n bool Borrow() noexcept override {\n if (stopping)\n \/* we havn't yet recovered from #WAS_COMMAND_STOP - give\n up this child process *\/\n \/\/ TODO: improve recovery for this case\n return false;\n\n event.Cancel();\n idle_timeout_event.Cancel();\n return true;\n }\n\n bool Release() noexcept override {\n event.ScheduleRead();\n idle_timeout_event.Schedule(was_idle_timeout);\n unclean = stopping;\n return true;\n }\n\nprivate:\n \/* virtual methods from class ExitListener *\/\n void OnChildProcessExit(gcc_unused int status) noexcept override {\n process.pid = -1;\n }\n};\n\nconst char *\nWasChildParams::GetStockKey(struct pool &pool) const noexcept\n{\n PoolStringBuilder<256> b;\n b.push_back(executable_path);\n\n for (auto i : args) {\n b.push_back(\" \");\n b.push_back(i);\n }\n\n for (auto i : options.env) {\n b.push_back(\"$\");\n b.push_back(i);\n }\n\n char options_buffer[16384];\n b.emplace_back(options_buffer,\n options.MakeId(options_buffer));\n\n return b(pool);\n}\n\nWasChild::ReceiveResult\nWasChild::ReceiveControl(void *p, size_t size) noexcept\n{\n ssize_t nbytes = recv(process.control.Get(), p, size, MSG_DONTWAIT);\n if (nbytes == (ssize_t)size)\n return ReceiveResult::SUCCESS;\n\n if (nbytes < 0 && errno == EAGAIN) {\n \/* the WAS application didn't send enough data (yet); don't\n bother waiting for more, just give up on this process *\/\n return ReceiveResult::AGAIN;\n }\n\n if (nbytes < 0)\n logger(2, \"error on idle WAS control connection: \", strerror(errno));\n else if (nbytes > 0)\n logger(2, \"unexpected data from idle WAS control connection\");\n return ReceiveResult::ERROR;\n}\n\nbool\nWasChild::DiscardControl(size_t size) noexcept\n{\n while (size > 0) {\n char buffer[1024];\n ssize_t nbytes = recv(process.control.Get(), buffer,\n std::min(size, sizeof(buffer)),\n MSG_DONTWAIT);\n if (nbytes <= 0)\n return false;\n\n size -= nbytes;\n }\n\n return true;\n}\n\ninline bool\nWasChild::DiscardInput(uint64_t remaining) noexcept\n{\n while (remaining > 0) {\n uint8_t buffer[16384];\n size_t size = std::min(remaining, uint64_t(sizeof(buffer)));\n ssize_t nbytes = process.input.Read(buffer, size);\n if (nbytes <= 0)\n return false;\n\n remaining -= nbytes;\n }\n\n return true;\n}\n\ninline void\nWasChild::RecoverStop() noexcept\n{\n uint64_t premature;\n\n while (true) {\n struct was_header header;\n switch (ReceiveControl(&header, sizeof(header))) {\n case ReceiveResult::SUCCESS:\n break;\n\n case ReceiveResult::ERROR:\n InvokeIdleDisconnect();\n return;\n\n case ReceiveResult::AGAIN:\n \/* wait for more data *\/\n return;\n }\n\n switch ((enum was_command)header.command) {\n case WAS_COMMAND_NOP:\n \/* ignore *\/\n continue;\n\n case WAS_COMMAND_HEADER:\n case WAS_COMMAND_STATUS:\n case WAS_COMMAND_NO_DATA:\n case WAS_COMMAND_DATA:\n case WAS_COMMAND_LENGTH:\n case WAS_COMMAND_STOP:\n \/* discard & ignore *\/\n if (!DiscardControl(header.length)) {\n InvokeIdleDisconnect();\n return;\n }\n continue;\n\n case WAS_COMMAND_REQUEST:\n case WAS_COMMAND_METHOD:\n case WAS_COMMAND_URI:\n case WAS_COMMAND_SCRIPT_NAME:\n case WAS_COMMAND_PATH_INFO:\n case WAS_COMMAND_QUERY_STRING:\n case WAS_COMMAND_PARAMETER:\n logger(2, \"unexpected data from idle WAS control connection '\",\n GetStockName(), \"'\");\n InvokeIdleDisconnect();\n return;\n\n case WAS_COMMAND_PREMATURE:\n \/* this is what we're waiting for *\/\n break;\n }\n\n if (ReceiveControl(&premature, sizeof(premature)) != ReceiveResult::SUCCESS) {\n InvokeIdleDisconnect();\n return;\n }\n\n break;\n }\n\n if (premature < input_received) {\n InvokeIdleDisconnect();\n return;\n }\n\n if (!DiscardInput(premature - input_received)) {\n InvokeIdleDisconnect();\n return;\n }\n\n stopping = false;\n unclean = false;\n}\n\n\/*\n * libevent callback\n *\n *\/\n\ninline void\nWasChild::EventCallback(unsigned) noexcept\n{\n if (stopping) {\n RecoverStop();\n return;\n }\n\n char buffer;\n ssize_t nbytes = recv(process.control.Get(), &buffer, sizeof(buffer),\n MSG_DONTWAIT);\n if (nbytes < 0)\n logger(2, \"error on idle WAS control connection: \",\n strerror(errno));\n else if (nbytes > 0)\n logger(2, \"unexpected data from idle WAS control connection\");\n\n InvokeIdleDisconnect();\n}\n\ninline void\nWasChild::OnIdleTimeout() noexcept\n{\n InvokeIdleDisconnect();\n}\n\n\/*\n * stock class\n *\n *\/\n\nclass WasStock final : StockClass {\n SpawnService &spawn_service;\n const SocketDescriptor log_socket;\n StockMap stock;\n\npublic:\n explicit WasStock(EventLoop &event_loop, SpawnService &_spawn_service,\n const SocketDescriptor _log_socket,\n unsigned limit, unsigned max_idle) noexcept\n :spawn_service(_spawn_service),\n log_socket(_log_socket),\n stock(event_loop, *this, limit, max_idle) {}\n\n StockMap &GetStock() noexcept {\n return stock;\n }\n\n void FadeTag(const char *tag) noexcept {\n stock.FadeIf([tag](const StockItem &item){\n const auto &child = (const WasChild &)item;\n return child.IsTag(tag);\n });\n }\n\nprivate:\n \/* virtual methods from class StockClass *\/\n void Create(CreateStockItem c, void *info, struct pool &caller_pool,\n CancellablePointer &cancel_ptr) override;\n};\n\nvoid\nWasStock::Create(CreateStockItem c,\n void *info,\n gcc_unused struct pool &caller_pool,\n gcc_unused CancellablePointer &cancel_ptr)\n{\n WasChildParams *params = (WasChildParams *)info;\n\n assert(params != nullptr);\n assert(params->executable_path != nullptr);\n\n auto *child = new WasChild(c, spawn_service, params->options.tag,\n log_socket);\n\n try {\n child->Launch(*params);\n } catch (...) {\n child->InvokeCreateError(std::current_exception());\n return;\n }\n\n child->InvokeCreateSuccess();\n}\n\nWasChild::~WasChild() noexcept\n{\n if (process.pid >= 0)\n spawn_service.KillChildProcess(process.pid);\n}\n\n\/*\n * interface\n *\n *\/\n\nStockMap *\nwas_stock_new(unsigned limit, unsigned max_idle,\n EventLoop &event_loop, SpawnService &spawn_service,\n SocketDescriptor log_socket) noexcept\n{\n auto *stock = new WasStock(event_loop, spawn_service, log_socket,\n limit, max_idle);\n return &stock->GetStock();\n}\n\nvoid\nwas_stock_free(StockMap *_stock) noexcept\n{\n auto *stock = (WasStock *)&_stock->GetClass();\n delete stock;\n}\n\nvoid\nwas_stock_fade_tag(StockMap &_stock, const char *tag) noexcept\n{\n auto &stock = (WasStock &)_stock.GetClass();\n stock.FadeTag(tag);\n}\n\nvoid\nwas_stock_get(StockMap *hstock, struct pool *pool,\n const ChildOptions &options,\n const char *executable_path,\n ConstBuffer<const char *> args,\n StockGetHandler &handler,\n CancellablePointer &cancel_ptr) noexcept\n{\n const AutoRewindPool auto_rewind(*tpool);\n\n auto params = NewFromPool<WasChildParams>(*pool, executable_path, args,\n options);\n\n hstock->Get(*pool, params->GetStockKey(*tpool), params,\n handler, cancel_ptr);\n}\n\nvoid\nwas_stock_item_set_site(StockItem &item, const char *site) noexcept\n{\n auto &child = (WasChild &)item;\n child.SetSite(site);\n}\n\nvoid\nwas_stock_item_set_uri(StockItem &item, const char *uri) noexcept\n{\n auto &child = (WasChild &)item;\n child.SetUri(uri);\n}\n\nconst WasProcess &\nwas_stock_item_get(const StockItem &item) noexcept\n{\n auto *child = (const WasChild *)&item;\n\n return child->GetProcess();\n}\n\nvoid\nwas_stock_item_stop(StockItem &item, uint64_t received) noexcept\n{\n auto &child = (WasChild &)item;\n child.Stop(received);\n}\n<commit_msg>was\/Stock: rethrow instead of calling InvokeCreateError()<commit_after>\/*\n * Copyright 2007-2017 Content Management AG\n * All rights reserved.\n *\n * author: Max Kellermann <mk@cm4all.com>\n *\n * Redistribution and use in source and binary forms, with or without\n * modification, are permitted provided that the following conditions\n * are met:\n *\n * - Redistributions of source code must retain the above copyright\n * notice, this list of conditions and the following disclaimer.\n *\n * - Redistributions in binary form must reproduce the above copyright\n * notice, this list of conditions and the following disclaimer in the\n * documentation and\/or other materials provided with the\n * distribution.\n *\n * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS\n * ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT\n * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS\n * FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE\n * FOUNDATION OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT,\n * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES\n * (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR\n * SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)\n * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT,\n * STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)\n * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED\n * OF THE POSSIBILITY OF SUCH DAMAGE.\n *\/\n\n#include \"Stock.hxx\"\n#include \"Launch.hxx\"\n#include \"stock\/MapStock.hxx\"\n#include \"stock\/Stock.hxx\"\n#include \"stock\/Class.hxx\"\n#include \"stock\/Item.hxx\"\n#include \"access_log\/ChildErrorLog.hxx\"\n#include \"spawn\/ChildOptions.hxx\"\n#include \"spawn\/ExitListener.hxx\"\n#include \"spawn\/Interface.hxx\"\n#include \"pool\/tpool.hxx\"\n#include \"pool\/StringBuilder.hxx\"\n#include \"event\/SocketEvent.hxx\"\n#include \"event\/TimerEvent.hxx\"\n#include \"net\/log\/Datagram.hxx\"\n#include \"io\/Logger.hxx\"\n#include \"util\/Cancellable.hxx\"\n#include \"util\/ConstBuffer.hxx\"\n#include \"util\/Cast.hxx\"\n\n#include <was\/protocol.h>\n\n#include <string>\n\n#include <assert.h>\n#include <stdlib.h>\n#include <unistd.h>\n#include <fcntl.h>\n#include <errno.h>\n#include <string.h>\n#include <sys\/socket.h>\n#include <sys\/un.h>\n#include <signal.h>\n#include <stdlib.h>\n\nstatic constexpr Event::Duration was_idle_timeout = std::chrono::minutes(5);\n\nstruct WasChildParams {\n const char *executable_path;\n\n ConstBuffer<const char *> args;\n\n const ChildOptions &options;\n\n WasChildParams(const char *_executable_path,\n ConstBuffer<const char *> _args,\n const ChildOptions &_options) noexcept\n :executable_path(_executable_path), args(_args),\n options(_options) {}\n\n const char *GetStockKey(struct pool &pool) const noexcept;\n};\n\nclass WasChild final : public StockItem, ExitListener {\n const LLogger logger;\n\n SpawnService &spawn_service;\n\n const std::string tag;\n\n const SocketDescriptor log_socket;\n ChildErrorLog log;\n\n WasProcess process;\n SocketEvent event;\n TimerEvent idle_timeout_event;\n\n \/**\n * If true, then we're waiting for PREMATURE (after the #WasClient\n * has sent #WAS_COMMAND_STOP).\n *\/\n bool stopping = false;\n\n \/**\n * The number of bytes received before #WAS_COMMAND_STOP was sent.\n *\/\n uint64_t input_received;\n\npublic:\n explicit WasChild(CreateStockItem c, SpawnService &_spawn_service,\n const char *_tag, SocketDescriptor _log_socket) noexcept\n :StockItem(c), logger(GetStockName()), spawn_service(_spawn_service),\n tag(_tag != nullptr ? _tag : \"\"),\n log_socket(_log_socket),\n event(c.stock.GetEventLoop(), BIND_THIS_METHOD(EventCallback)),\n idle_timeout_event(c.stock.GetEventLoop(),\n BIND_THIS_METHOD(OnIdleTimeout))\n {\n \/* mark this object as \"unused\" so the destructor doesn't\n attempt to kill the process *\/\n process.pid = -1;\n }\n\n ~WasChild() noexcept override;\n\n auto &GetEventLoop() noexcept {\n return event.GetEventLoop();\n }\n\n bool IsTag(const char *other_tag) const noexcept {\n return tag == other_tag;\n }\n\n \/**\n * Throws on error.\n *\/\n void Launch(const WasChildParams ¶ms) {\n process = was_launch(spawn_service,\n GetStockName(),\n params.executable_path,\n params.args,\n params.options,\n log.EnableClient(GetEventLoop(), log_socket),\n this);\n event.Open(process.control);\n }\n\n void SetSite(const char *_site) noexcept {\n log.SetSite(_site);\n }\n\n void SetUri(const char *_uri) noexcept {\n log.SetUri(_uri);\n }\n\n const WasProcess &GetProcess() const noexcept {\n return process;\n }\n\n void Stop(uint64_t _received) noexcept {\n assert(!is_idle);\n assert(!stopping);\n\n stopping = true;\n input_received = _received;\n }\n\nprivate:\n enum class ReceiveResult {\n SUCCESS, ERROR, AGAIN,\n };\n\n \/**\n * Receive data on the control channel.\n *\/\n ReceiveResult ReceiveControl(void *p, size_t size) noexcept;\n\n \/**\n * Receive and discard data on the control channel.\n *\n * @return true on success\n *\/\n bool DiscardControl(size_t size) noexcept;\n\n \/**\n * Discard the given amount of data from the input pipe.\n *\n * @return true on success\n *\/\n bool DiscardInput(uint64_t remaining) noexcept;\n\n \/**\n * Attempt to recover after the WAS client sent STOP to the\n * application. This method waits for PREMATURE and discards\n * excess data from the pipe.\n *\/\n void RecoverStop() noexcept;\n\n void EventCallback(unsigned events) noexcept;\n void OnIdleTimeout() noexcept;\n\npublic:\n \/* virtual methods from class StockItem *\/\n bool Borrow() noexcept override {\n if (stopping)\n \/* we havn't yet recovered from #WAS_COMMAND_STOP - give\n up this child process *\/\n \/\/ TODO: improve recovery for this case\n return false;\n\n event.Cancel();\n idle_timeout_event.Cancel();\n return true;\n }\n\n bool Release() noexcept override {\n event.ScheduleRead();\n idle_timeout_event.Schedule(was_idle_timeout);\n unclean = stopping;\n return true;\n }\n\nprivate:\n \/* virtual methods from class ExitListener *\/\n void OnChildProcessExit(gcc_unused int status) noexcept override {\n process.pid = -1;\n }\n};\n\nconst char *\nWasChildParams::GetStockKey(struct pool &pool) const noexcept\n{\n PoolStringBuilder<256> b;\n b.push_back(executable_path);\n\n for (auto i : args) {\n b.push_back(\" \");\n b.push_back(i);\n }\n\n for (auto i : options.env) {\n b.push_back(\"$\");\n b.push_back(i);\n }\n\n char options_buffer[16384];\n b.emplace_back(options_buffer,\n options.MakeId(options_buffer));\n\n return b(pool);\n}\n\nWasChild::ReceiveResult\nWasChild::ReceiveControl(void *p, size_t size) noexcept\n{\n ssize_t nbytes = recv(process.control.Get(), p, size, MSG_DONTWAIT);\n if (nbytes == (ssize_t)size)\n return ReceiveResult::SUCCESS;\n\n if (nbytes < 0 && errno == EAGAIN) {\n \/* the WAS application didn't send enough data (yet); don't\n bother waiting for more, just give up on this process *\/\n return ReceiveResult::AGAIN;\n }\n\n if (nbytes < 0)\n logger(2, \"error on idle WAS control connection: \", strerror(errno));\n else if (nbytes > 0)\n logger(2, \"unexpected data from idle WAS control connection\");\n return ReceiveResult::ERROR;\n}\n\nbool\nWasChild::DiscardControl(size_t size) noexcept\n{\n while (size > 0) {\n char buffer[1024];\n ssize_t nbytes = recv(process.control.Get(), buffer,\n std::min(size, sizeof(buffer)),\n MSG_DONTWAIT);\n if (nbytes <= 0)\n return false;\n\n size -= nbytes;\n }\n\n return true;\n}\n\ninline bool\nWasChild::DiscardInput(uint64_t remaining) noexcept\n{\n while (remaining > 0) {\n uint8_t buffer[16384];\n size_t size = std::min(remaining, uint64_t(sizeof(buffer)));\n ssize_t nbytes = process.input.Read(buffer, size);\n if (nbytes <= 0)\n return false;\n\n remaining -= nbytes;\n }\n\n return true;\n}\n\ninline void\nWasChild::RecoverStop() noexcept\n{\n uint64_t premature;\n\n while (true) {\n struct was_header header;\n switch (ReceiveControl(&header, sizeof(header))) {\n case ReceiveResult::SUCCESS:\n break;\n\n case ReceiveResult::ERROR:\n InvokeIdleDisconnect();\n return;\n\n case ReceiveResult::AGAIN:\n \/* wait for more data *\/\n return;\n }\n\n switch ((enum was_command)header.command) {\n case WAS_COMMAND_NOP:\n \/* ignore *\/\n continue;\n\n case WAS_COMMAND_HEADER:\n case WAS_COMMAND_STATUS:\n case WAS_COMMAND_NO_DATA:\n case WAS_COMMAND_DATA:\n case WAS_COMMAND_LENGTH:\n case WAS_COMMAND_STOP:\n \/* discard & ignore *\/\n if (!DiscardControl(header.length)) {\n InvokeIdleDisconnect();\n return;\n }\n continue;\n\n case WAS_COMMAND_REQUEST:\n case WAS_COMMAND_METHOD:\n case WAS_COMMAND_URI:\n case WAS_COMMAND_SCRIPT_NAME:\n case WAS_COMMAND_PATH_INFO:\n case WAS_COMMAND_QUERY_STRING:\n case WAS_COMMAND_PARAMETER:\n logger(2, \"unexpected data from idle WAS control connection '\",\n GetStockName(), \"'\");\n InvokeIdleDisconnect();\n return;\n\n case WAS_COMMAND_PREMATURE:\n \/* this is what we're waiting for *\/\n break;\n }\n\n if (ReceiveControl(&premature, sizeof(premature)) != ReceiveResult::SUCCESS) {\n InvokeIdleDisconnect();\n return;\n }\n\n break;\n }\n\n if (premature < input_received) {\n InvokeIdleDisconnect();\n return;\n }\n\n if (!DiscardInput(premature - input_received)) {\n InvokeIdleDisconnect();\n return;\n }\n\n stopping = false;\n unclean = false;\n}\n\n\/*\n * libevent callback\n *\n *\/\n\ninline void\nWasChild::EventCallback(unsigned) noexcept\n{\n if (stopping) {\n RecoverStop();\n return;\n }\n\n char buffer;\n ssize_t nbytes = recv(process.control.Get(), &buffer, sizeof(buffer),\n MSG_DONTWAIT);\n if (nbytes < 0)\n logger(2, \"error on idle WAS control connection: \",\n strerror(errno));\n else if (nbytes > 0)\n logger(2, \"unexpected data from idle WAS control connection\");\n\n InvokeIdleDisconnect();\n}\n\ninline void\nWasChild::OnIdleTimeout() noexcept\n{\n InvokeIdleDisconnect();\n}\n\n\/*\n * stock class\n *\n *\/\n\nclass WasStock final : StockClass {\n SpawnService &spawn_service;\n const SocketDescriptor log_socket;\n StockMap stock;\n\npublic:\n explicit WasStock(EventLoop &event_loop, SpawnService &_spawn_service,\n const SocketDescriptor _log_socket,\n unsigned limit, unsigned max_idle) noexcept\n :spawn_service(_spawn_service),\n log_socket(_log_socket),\n stock(event_loop, *this, limit, max_idle) {}\n\n StockMap &GetStock() noexcept {\n return stock;\n }\n\n void FadeTag(const char *tag) noexcept {\n stock.FadeIf([tag](const StockItem &item){\n const auto &child = (const WasChild &)item;\n return child.IsTag(tag);\n });\n }\n\nprivate:\n \/* virtual methods from class StockClass *\/\n void Create(CreateStockItem c, void *info, struct pool &caller_pool,\n CancellablePointer &cancel_ptr) override;\n};\n\nvoid\nWasStock::Create(CreateStockItem c,\n void *info,\n gcc_unused struct pool &caller_pool,\n gcc_unused CancellablePointer &cancel_ptr)\n{\n WasChildParams *params = (WasChildParams *)info;\n\n assert(params != nullptr);\n assert(params->executable_path != nullptr);\n\n auto *child = new WasChild(c, spawn_service, params->options.tag,\n log_socket);\n\n try {\n child->Launch(*params);\n } catch (...) {\n delete child;\n throw;\n }\n\n child->InvokeCreateSuccess();\n}\n\nWasChild::~WasChild() noexcept\n{\n if (process.pid >= 0)\n spawn_service.KillChildProcess(process.pid);\n}\n\n\/*\n * interface\n *\n *\/\n\nStockMap *\nwas_stock_new(unsigned limit, unsigned max_idle,\n EventLoop &event_loop, SpawnService &spawn_service,\n SocketDescriptor log_socket) noexcept\n{\n auto *stock = new WasStock(event_loop, spawn_service, log_socket,\n limit, max_idle);\n return &stock->GetStock();\n}\n\nvoid\nwas_stock_free(StockMap *_stock) noexcept\n{\n auto *stock = (WasStock *)&_stock->GetClass();\n delete stock;\n}\n\nvoid\nwas_stock_fade_tag(StockMap &_stock, const char *tag) noexcept\n{\n auto &stock = (WasStock &)_stock.GetClass();\n stock.FadeTag(tag);\n}\n\nvoid\nwas_stock_get(StockMap *hstock, struct pool *pool,\n const ChildOptions &options,\n const char *executable_path,\n ConstBuffer<const char *> args,\n StockGetHandler &handler,\n CancellablePointer &cancel_ptr) noexcept\n{\n const AutoRewindPool auto_rewind(*tpool);\n\n auto params = NewFromPool<WasChildParams>(*pool, executable_path, args,\n options);\n\n hstock->Get(*pool, params->GetStockKey(*tpool), params,\n handler, cancel_ptr);\n}\n\nvoid\nwas_stock_item_set_site(StockItem &item, const char *site) noexcept\n{\n auto &child = (WasChild &)item;\n child.SetSite(site);\n}\n\nvoid\nwas_stock_item_set_uri(StockItem &item, const char *uri) noexcept\n{\n auto &child = (WasChild &)item;\n child.SetUri(uri);\n}\n\nconst WasProcess &\nwas_stock_item_get(const StockItem &item) noexcept\n{\n auto *child = (const WasChild *)&item;\n\n return child->GetProcess();\n}\n\nvoid\nwas_stock_item_stop(StockItem &item, uint64_t received) noexcept\n{\n auto &child = (WasChild &)item;\n child.Stop(received);\n}\n<|endoftext|>"} {"text":"<commit_before>#include <cstring>\n#include <string>\n#include <map>\n#include <set>\n\n#include <unistd.h>\n#include <fcntl.h>\n#include <sys\/socket.h>\n#include <netinet\/in.h>\n\n#include \"webserver.h\"\n\n#include \"global.h\"\n#include \"judge.h\"\n#include \"scoreboard.h\"\n\nusing namespace std;\n\nstruct Request {\n string line;\n map<string, string> headers;\n Request(int sd) {\n \/\/ read socket\n vector<char> buf; {\n char c;\n for (bool done = false; !done;) {\n while (!done && read(sd, &c, 1) == 1) {\n buf.push_back(c);\n if (c == '\\n' && buf.size() >= 4 && buf[buf.size()-4] == '\\r') {\n done = true;\n }\n }\n }\n }\n int i = 0;\n \n \/\/ parse request line\n for (; buf[i] != '\\r'; i++) line += buf[i];\n i += 2;\n \n \/\/ parse headers\n while (true) {\n string line;\n for (; buf[i] != '\\r'; i++) line += buf[i];\n i += 2;\n if (line == \"\") break;\n int j = 0;\n string header;\n for (; j < int(line.size()) && line[j] != ':'; j++) header += line[j];\n string content;\n for (j += 2; j < int(line.size()); j++) content += line[j];\n headers[header] = content;\n }\n }\n};\n\nstruct Client {\n sockaddr_in addr;\n int sd;\n};\n\nstatic pthread_mutex_t login_mutex = PTHREAD_MUTEX_INITIALIZER;\nstatic map<in_addr_t, pair<string, string>> teambyip;\nstatic map<string, set<in_addr_t>> teambylogin;\n\nstatic void showlogin(int sd) {\n string form =\n \"HTTP\/1.1 200 OK\\r\\n\"\n \"Connection: close\\r\\r\"\n \"Content-Type: text\/html\\r\\n\"\n \"\\r\\n\"\n \"<html id=\\\"root\\\">\\n\"\n \" <head>\\n\"\n \" <script>\\n\"\n \" function sendform() {\\n\"\n \" team = document.getElementById(\\\"team\\\").value;\\n\"\n \" pass = document.getElementById(\\\"pass\\\").value;\\n\"\n \" if (window.XMLHttpRequest)\\n\"\n \" xmlhttp = new XMLHttpRequest();\\n\"\n \" else\\n\"\n \" xmlhttp = new ActiveXObject(\\\"Microsoft.XMLHTTP\\\");\\n\"\n \" xmlhttp.onreadystatechange = function() {\\n\"\n \" if (xmlhttp.readyState == 4 && xmlhttp.status == 200) {\\n\"\n \" if (xmlhttp.responseText[0] == 'I') {\\n\"\n \" response = document.getElementById(\\\"response\\\");\\n\"\n \" response.innerHTML = xmlhttp.responseText;\\n\"\n \" } else window.location = \\\"\/\\\";\\n\"\n \" }\\n\"\n \" }\\n\"\n \" xmlhttp.open(\\\"POST\\\", \\\"login\\\", true);\\n\"\n \" xmlhttp.setRequestHeader(\\\"Team\\\", team);\\n\"\n \" xmlhttp.setRequestHeader(\\\"Password\\\", pass);\\n\"\n \" xmlhttp.send();\\n\"\n \" }\\n\"\n \" <\/script>\\n\"\n \" <\/head>\\n\"\n \" <body>\\n\"\n \" <h1 align=\\\"center\\\">Pimenta Judgezzz~*~*<\/h1>\\n\"\n \" <h2 align=\\\"center\\\">Login<\/h2>\\n\"\n \" <h4 align=\\\"center\\\" id=\\\"response\\\"><\/h4>\\n\"\n \" <table align=\\\"center\\\">\\n\"\n \" <tr>\\n\"\n \" <td>Team:<\/td>\\n\"\n \" <td><input type=\\\"text\\\" id=\\\"team\\\" autofocus\/><\/td>\\n\"\n \" <\/tr>\\n\"\n \" <tr>\\n\"\n \" <td>Password:<\/td>\\n\"\n \" <td><input type=\\\"password\\\" id=\\\"pass\\\" \/><\/td>\\n\"\n \" <\/tr>\\n\"\n \" <tr><td><button onclick=\\\"sendform()\\\">Login<\/button><\/td><\/tr>\\n\"\n \" <\/table>\\n\"\n \" <\/body>\\n\"\n \"<\/html>\\n\"\n ;\n write(sd, form.c_str(), form.size());\n}\n\nstatic string login(const string& team, const string& password) {\n FILE* fp = fopen(\"teams.txt\", \"r\");\n if (!fp) return \"\";\n string name;\n for (fgetc(fp); name == \"\" && !feof(fp); fgetc(fp)) {\n string ntmp;\n for (char c = fgetc(fp); c != '\"'; c = fgetc(fp)) ntmp += c;\n fgetc(fp);\n string tmp;\n for (char c = fgetc(fp); c != ' '; c = fgetc(fp)) tmp += c;\n string pass;\n for (char c = fgetc(fp); c != '\\n'; c = fgetc(fp)) pass += c;\n if (team == tmp && password == pass) name = ntmp;\n }\n fclose(fp);\n return name;\n}\n\nstatic void* zenity(void* ptr) {\n string* sptr = (string*)ptr;\n system(\"zenity --warning --text=\\\"%s\\\"\", sptr->c_str());\n delete sptr;\n return nullptr;\n}\n\nstatic void statement(int sd) {\n Settings settings;\n string response;\n bool send = false;\n if (time(nullptr) < settings.begin) {\n response =\n \"HTTP\/1.1 403 Forbidden\\r\\n\"\n \"Connection: close\\r\\r\"\n \"\\r\\n\"\n ;\n }\n else {\n response =\n \"HTTP\/1.1 200 OK\\r\\n\"\n \"Connection: close\\r\\r\"\n \"Content-Type: application\/octet-stream\\r\\n\"\n \"Content-Disposition: attachment; filename=\\\"contest.pdf\\\"\\r\\n\"\n \"\\r\\n\"\n ;\n send = true;\n }\n write(sd, response.c_str(), response.size());\n if (!send) return;\n FILE* fp = fopen(\"contest.pdf\", \"rb\");\n if (!fp) return;\n char* buf = new char[1<<20];\n for (size_t rd = 0; (rd = fread(buf, 1, 1 << 20, fp)) > 0;) {\n write(sd, buf, rd);\n }\n delete[] buf;\n fclose(fp);\n}\n\nstatic void* client(void* ptr) {\n Client* cptr = (Client*)ptr;\n Request req(cptr->sd);\n \n \/\/ login\n pthread_mutex_lock(&login_mutex);\n if (teambyip.find(cptr->addr.sin_addr.s_addr) == teambyip.end()) {\n if (req.line[0] == 'P' && req.line.find(\"login\") != string::npos) {\n string teamname = login(req.headers[\"Team\"], req.headers[\"Password\"]);\n if (teamname == \"\") write(cptr->sd, \"Invalid team\/password!\", 22);\n else {\n auto& ips = teambylogin[req.headers[\"Team\"]];\n ips.insert(cptr->addr.sin_addr.s_addr);\n if (ips.size() > 1) {\n string msg =\n \"team \"+req.headers[\"Team\"]+\" logging with multiple ips:\\n\"\n ;\n for (in_addr_t x : ips) msg += (to<string>(x)+\"\\n\");\n pthread_t thread;\n pthread_create(&thread, nullptr, zenity, new string(msg));\n pthread_detach(thread);\n }\n teambyip[cptr->addr.sin_addr.s_addr].first = teamname;\n teambyip[cptr->addr.sin_addr.s_addr].second = req.headers[\"Team\"];\n write(cptr->sd, \"k\", 1);\n }\n }\n else showlogin(cptr->sd);\n pthread_mutex_unlock(&login_mutex);\n }\n \/\/ logout\n else if (req.line.find(\"logout\") != string::npos) {\n teambyip.erase(cptr->addr.sin_addr.s_addr);\n pthread_mutex_unlock(&login_mutex);\n write(cptr->sd, \"Logged out.\", 11);\n }\n else {\n auto& team = teambyip[cptr->addr.sin_addr.s_addr];\n pthread_mutex_unlock(&login_mutex);\n \n \/\/ fetch uri\n stringstream ss;\n ss << req.line;\n string uri;\n ss >> uri;\n ss >> uri;\n \n \/\/ post\n if (req.line[0] == 'P') {\n if (uri.find(\"submission\") != string::npos) {\n Judge::attempt(\n cptr->sd,\n team.first, team.second,\n req.headers[\"File-name\"], to<int>(req.headers[\"File-size\"])\n );\n }\n else {\n \/\/TODO clarifs.\n }\n }\n \/\/ data request\n else if (uri.find(\"?\") != string::npos) {\n if (uri.find(\"teamname\") != string::npos) {\n write(cptr->sd, team.first.c_str(), team.first.size());\n }\n else if (uri.find(\"scoreboard\") != string::npos) {\n Scoreboard::send(cptr->sd);\n }\n else if (uri.find(\"statement\") != string::npos) {\n statement(cptr->sd);\n }\n }\n \/\/ file request\n else {\n string ctype;\n if (uri.find(\".css\") != string::npos) {\n ctype = \"text\/css\";\n }\n else if (uri.find(\".js\") != string::npos) {\n ctype = \"application\/javascript\";\n }\n else if (uri.find(\".gif\") != string::npos) {\n ctype = \"application\/octet-stream\";\n }\n else {\n ctype = \"text\/html\";\n uri = \"\/index.html\";\n }\n if (ctype != \"\") {\n string header =\n \"HTTP\/1.1 200 OK\\r\\n\"\n \"Connection: close\\r\\r\"\n \"Content-Type: \"+ctype+\"\\r\\n\"\n \"\\r\\n\"\n ;\n FILE* fp = fopen((\"www\"+uri).c_str(), \"rb\");\n if (fp) {\n char* buf = new char[1<<10];\n int sz;\n write(cptr->sd, header.c_str(), header.size());\n while ((sz = fread(buf, 1, 1<<10, fp)) > 0) write(cptr->sd, buf, sz);\n delete[] buf;\n fclose(fp);\n }\n }\n }\n }\n \n close(cptr->sd);\n delete cptr;\n return nullptr;\n}\n\nstatic void* server(void*) {\n \/\/ create socket\n int sd = socket(AF_INET, SOCK_STREAM, 0);\n int opt = 1;\n setsockopt(sd, SOL_SOCKET, SO_REUSEADDR, &opt, sizeof opt);\n fcntl(sd, F_SETFL, FNDELAY);\n \n \/\/ set addr\n sockaddr_in addr;\n memset(&addr, 0, sizeof addr);\n addr.sin_family = AF_INET;\n addr.sin_port = htons(to<uint16_t>(Global::arg[2]));\n addr.sin_addr.s_addr = htonl(INADDR_ANY);\n bind(sd, (sockaddr*)&addr, sizeof addr);\n \n \/\/ listen\n listen(sd, SOMAXCONN);\n while (Global::alive()) {\n socklen_t alen;\n Client c;\n c.sd = accept(sd, (sockaddr*)&c.addr, &alen);\n if (c.sd < 0) { usleep(25000); continue; }\n pthread_t thread;\n pthread_create(&thread, nullptr, client, new Client(c));\n pthread_detach(thread);\n }\n \n \/\/ close\n close(sd);\n return nullptr;\n}\n\nnamespace WebServer {\n\nvoid fire() {\n Global::fire(server);\n}\n\n} \/\/ namespace WebServer\n<commit_msg>Fixing bug<commit_after>#include <cstring>\n#include <string>\n#include <map>\n#include <set>\n\n#include <unistd.h>\n#include <fcntl.h>\n#include <sys\/socket.h>\n#include <netinet\/in.h>\n\n#include \"webserver.h\"\n\n#include \"global.h\"\n#include \"judge.h\"\n#include \"scoreboard.h\"\n\nusing namespace std;\n\nstruct Request {\n string line;\n map<string, string> headers;\n Request(int sd) {\n \/\/ read socket\n vector<char> buf; {\n char c;\n for (bool done = false; !done;) {\n while (!done && read(sd, &c, 1) == 1) {\n buf.push_back(c);\n if (c == '\\n' && buf.size() >= 4 && buf[buf.size()-4] == '\\r') {\n done = true;\n }\n }\n }\n }\n int i = 0;\n \n \/\/ parse request line\n for (; buf[i] != '\\r'; i++) line += buf[i];\n i += 2;\n \n \/\/ parse headers\n while (true) {\n string line;\n for (; buf[i] != '\\r'; i++) line += buf[i];\n i += 2;\n if (line == \"\") break;\n int j = 0;\n string header;\n for (; j < int(line.size()) && line[j] != ':'; j++) header += line[j];\n string content;\n for (j += 2; j < int(line.size()); j++) content += line[j];\n headers[header] = content;\n }\n }\n};\n\nstruct Client {\n sockaddr_in addr;\n int sd;\n};\n\nstatic pthread_mutex_t login_mutex = PTHREAD_MUTEX_INITIALIZER;\nstatic map<in_addr_t, pair<string, string>> teambyip;\nstatic map<string, set<in_addr_t>> teambylogin;\n\nstatic void showlogin(int sd) {\n string form =\n \"HTTP\/1.1 200 OK\\r\\n\"\n \"Connection: close\\r\\r\"\n \"Content-Type: text\/html\\r\\n\"\n \"\\r\\n\"\n \"<html id=\\\"root\\\">\\n\"\n \" <head>\\n\"\n \" <script>\\n\"\n \" function sendform() {\\n\"\n \" team = document.getElementById(\\\"team\\\").value;\\n\"\n \" pass = document.getElementById(\\\"pass\\\").value;\\n\"\n \" if (window.XMLHttpRequest)\\n\"\n \" xmlhttp = new XMLHttpRequest();\\n\"\n \" else\\n\"\n \" xmlhttp = new ActiveXObject(\\\"Microsoft.XMLHTTP\\\");\\n\"\n \" xmlhttp.onreadystatechange = function() {\\n\"\n \" if (xmlhttp.readyState == 4 && xmlhttp.status == 200) {\\n\"\n \" if (xmlhttp.responseText[0] == 'I') {\\n\"\n \" response = document.getElementById(\\\"response\\\");\\n\"\n \" response.innerHTML = xmlhttp.responseText;\\n\"\n \" } else window.location = \\\"\/\\\";\\n\"\n \" }\\n\"\n \" }\\n\"\n \" xmlhttp.open(\\\"POST\\\", \\\"login\\\", true);\\n\"\n \" xmlhttp.setRequestHeader(\\\"Team\\\", team);\\n\"\n \" xmlhttp.setRequestHeader(\\\"Password\\\", pass);\\n\"\n \" xmlhttp.send();\\n\"\n \" }\\n\"\n \" <\/script>\\n\"\n \" <\/head>\\n\"\n \" <body>\\n\"\n \" <h1 align=\\\"center\\\">Pimenta Judgezzz~*~*<\/h1>\\n\"\n \" <h2 align=\\\"center\\\">Login<\/h2>\\n\"\n \" <h4 align=\\\"center\\\" id=\\\"response\\\"><\/h4>\\n\"\n \" <table align=\\\"center\\\">\\n\"\n \" <tr>\\n\"\n \" <td>Team:<\/td>\\n\"\n \" <td><input type=\\\"text\\\" id=\\\"team\\\" autofocus\/><\/td>\\n\"\n \" <\/tr>\\n\"\n \" <tr>\\n\"\n \" <td>Password:<\/td>\\n\"\n \" <td><input type=\\\"password\\\" id=\\\"pass\\\" \/><\/td>\\n\"\n \" <\/tr>\\n\"\n \" <tr><td><button onclick=\\\"sendform()\\\">Login<\/button><\/td><\/tr>\\n\"\n \" <\/table>\\n\"\n \" <\/body>\\n\"\n \"<\/html>\\n\"\n ;\n write(sd, form.c_str(), form.size());\n}\n\nstatic string login(const string& team, const string& password) {\n FILE* fp = fopen(\"teams.txt\", \"r\");\n if (!fp) return \"\";\n string name;\n for (fgetc(fp); name == \"\" && !feof(fp); fgetc(fp)) {\n string ntmp;\n for (char c = fgetc(fp); c != '\"'; c = fgetc(fp)) ntmp += c;\n fgetc(fp);\n string tmp;\n for (char c = fgetc(fp); c != ' '; c = fgetc(fp)) tmp += c;\n string pass;\n for (char c = fgetc(fp); c != '\\n'; c = fgetc(fp)) pass += c;\n if (team == tmp && password == pass) name = ntmp;\n }\n fclose(fp);\n return name;\n}\n\nstatic void* zenity(void* ptr) {\n string* sptr = (string*)ptr;\n system(\"zenity --warning --text=\\\"%s\\\"\", sptr->c_str());\n delete sptr;\n return nullptr;\n}\n\nstatic void statement(int sd) {\n Settings settings;\n string response;\n bool send = false;\n if (time(nullptr) < settings.begin) {\n response =\n \"HTTP\/1.1 403 Forbidden\\r\\n\"\n \"Connection: close\\r\\r\"\n \"\\r\\n\"\n ;\n }\n else {\n response =\n \"HTTP\/1.1 200 OK\\r\\n\"\n \"Connection: close\\r\\r\"\n \"Content-Type: application\/octet-stream\\r\\n\"\n \"Content-Disposition: attachment; filename=\\\"contest.pdf\\\"\\r\\n\"\n \"\\r\\n\"\n ;\n send = true;\n }\n write(sd, response.c_str(), response.size());\n if (!send) return;\n FILE* fp = fopen(\"contest.pdf\", \"rb\");\n if (!fp) return;\n char* buf = new char[1<<20];\n for (size_t rd = 0; (rd = fread(buf, 1, 1 << 20, fp)) > 0;) {\n write(sd, buf, rd);\n }\n delete[] buf;\n fclose(fp);\n}\n\nstatic void* client(void* ptr) {\n Client* cptr = (Client*)ptr;\n Request req(cptr->sd);\n \n \/\/ login\n pthread_mutex_lock(&login_mutex);\n if (teambyip.find(cptr->addr.sin_addr.s_addr) == teambyip.end()) {\n if (req.line[0] == 'P' && req.line.find(\"login\") != string::npos) {\n string teamname = login(req.headers[\"Team\"], req.headers[\"Password\"]);\n if (teamname == \"\") write(cptr->sd, \"Invalid team\/password!\", 22);\n else {\n auto& ips = teambylogin[req.headers[\"Team\"]];\n ips.insert(cptr->addr.sin_addr.s_addr);\n if (ips.size() > 1) {\n string msg =\n \"team \"+req.headers[\"Team\"]+\" logging with multiple ips:\\n\"\n ;\n for (in_addr_t x : ips) msg += (to<string>(x)+\"\\n\");\n pthread_t thread;\n pthread_create(&thread, nullptr, zenity, new string(msg));\n pthread_detach(thread);\n }\n teambyip[cptr->addr.sin_addr.s_addr].first = teamname;\n teambyip[cptr->addr.sin_addr.s_addr].second = req.headers[\"Team\"];\n write(cptr->sd, \"k\", 1);\n }\n }\n else showlogin(cptr->sd);\n pthread_mutex_unlock(&login_mutex);\n }\n \/\/ logout\n else if (req.line.find(\"logout\") != string::npos) {\n teambyip.erase(cptr->addr.sin_addr.s_addr);\n pthread_mutex_unlock(&login_mutex);\n showlogin(cptr->sd);\n }\n else {\n auto& team = teambyip[cptr->addr.sin_addr.s_addr];\n pthread_mutex_unlock(&login_mutex);\n \n \/\/ fetch uri\n stringstream ss;\n ss << req.line;\n string uri;\n ss >> uri;\n ss >> uri;\n \n \/\/ post\n if (req.line[0] == 'P') {\n if (uri.find(\"submission\") != string::npos) {\n Judge::attempt(\n cptr->sd,\n team.first, team.second,\n req.headers[\"File-name\"], to<int>(req.headers[\"File-size\"])\n );\n }\n else {\n \/\/TODO clarifs.\n }\n }\n \/\/ data request\n else if (uri.find(\"?\") != string::npos) {\n if (uri.find(\"teamname\") != string::npos) {\n write(cptr->sd, team.first.c_str(), team.first.size());\n }\n else if (uri.find(\"scoreboard\") != string::npos) {\n Scoreboard::send(cptr->sd);\n }\n else if (uri.find(\"statement\") != string::npos) {\n statement(cptr->sd);\n }\n }\n \/\/ file request\n else {\n string ctype;\n if (uri.find(\".css\") != string::npos) {\n ctype = \"text\/css\";\n }\n else if (uri.find(\".js\") != string::npos) {\n ctype = \"application\/javascript\";\n }\n else if (uri.find(\".gif\") != string::npos) {\n ctype = \"application\/octet-stream\";\n }\n else {\n ctype = \"text\/html\";\n uri = \"\/index.html\";\n }\n if (ctype != \"\") {\n string header =\n \"HTTP\/1.1 200 OK\\r\\n\"\n \"Connection: close\\r\\r\"\n \"Content-Type: \"+ctype+\"\\r\\n\"\n \"\\r\\n\"\n ;\n FILE* fp = fopen((\"www\"+uri).c_str(), \"rb\");\n if (fp) {\n char* buf = new char[1<<10];\n int sz;\n write(cptr->sd, header.c_str(), header.size());\n while ((sz = fread(buf, 1, 1<<10, fp)) > 0) write(cptr->sd, buf, sz);\n delete[] buf;\n fclose(fp);\n }\n }\n }\n }\n \n close(cptr->sd);\n delete cptr;\n return nullptr;\n}\n\nstatic void* server(void*) {\n \/\/ create socket\n int sd = socket(AF_INET, SOCK_STREAM, 0);\n int opt = 1;\n setsockopt(sd, SOL_SOCKET, SO_REUSEADDR, &opt, sizeof opt);\n fcntl(sd, F_SETFL, FNDELAY);\n \n \/\/ set addr\n sockaddr_in addr;\n memset(&addr, 0, sizeof addr);\n addr.sin_family = AF_INET;\n addr.sin_port = htons(to<uint16_t>(Global::arg[2]));\n addr.sin_addr.s_addr = htonl(INADDR_ANY);\n bind(sd, (sockaddr*)&addr, sizeof addr);\n \n \/\/ listen\n listen(sd, SOMAXCONN);\n while (Global::alive()) {\n socklen_t alen;\n Client c;\n c.sd = accept(sd, (sockaddr*)&c.addr, &alen);\n if (c.sd < 0) { usleep(25000); continue; }\n pthread_t thread;\n pthread_create(&thread, nullptr, client, new Client(c));\n pthread_detach(thread);\n }\n \n \/\/ close\n close(sd);\n return nullptr;\n}\n\nnamespace WebServer {\n\nvoid fire() {\n Global::fire(server);\n}\n\n} \/\/ namespace WebServer\n<|endoftext|>"} {"text":"<commit_before>#include <inventory.h>\n#include <entities.h>\n#include <ui.h>\n\n#define ITEM_COUNT 5\t\/\/ Total number of items that actually exist\n\nextern Player *player;\nextern GLuint invUI;\n\nstatic const Item item[ITEM_COUNT]= {\n\t#include \"..\/config\/items.h\"\n};\n\nstatic GLuint itemtex[ITEM_COUNT];\n\nvoid itemDraw(Player *p,ITEM_ID id);\n\nvoid initInventorySprites(void){\n\tunsigned int i;\n\tfor(i = 0;i < ITEM_COUNT;i++){\n\t\titemtex[i] = Texture::loadTexture(getItemTexturePath((ITEM_ID)i));\n\t}\n}\n\nchar *getItemTexturePath(ITEM_ID id){\n\treturn item[id].textureLoc;\n}\n\nItem::Item(ITEM_ID i, const char *n, ITEM_TYPE t, float w, float h, int m, const char *tl){\n\tid = i;\n\ttype = t;\n\twidth = w;\n\theight = h;\n\tmaxStackSize = m;\n\n\tname \t\t= new char[strlen(n)+1];\n\ttextureLoc \t= new char[strlen(tl)+1];\n\n\tstrcpy(name,n);\n\tstrcpy(textureLoc,tl);\n\n\t\/\/tex= new Texturec(1,textureLoc);\n}\n\nInventory::Inventory(unsigned int s){\n\tsel=0;\n\tsize=s;\n\tinv = new struct item_t[size];\n\tmemset(inv,0,size*sizeof(struct item_t));\n}\n\nInventory::~Inventory(void){\n\tdelete[] inv;\n}\n\nvoid Inventory::setSelection(unsigned int s){\n\tsel=s;\n}\n\nint Inventory::addItem(ITEM_ID id,unsigned char count){\n\t\/\/std::cout << id << \",\" << inv[os].id << std::endl;\n\t\n\tfor(unsigned int i = 0; i < size; i++){\n\t\tif(id == inv[i].id){\n\t\t\tinv[i].count += count;\n\t\t\tbreak;\n\t\t}else if(id){\n\t\t\tinv[os].id = id;\n\t\t\tinv[os].count = count;\n\t\t\tos++;\n\t\t\tbreak;\n\t\t}\n\t}\n\n#ifdef DEBUG\n\tDEBUG_printf(\"Gave player %u more %s(s)(ID: %d).\\n\",count,item[id].name,item[id].id);\n#endif \/\/ DEBUG\n\n\treturn 0;\n}\n\nint Inventory::takeItem(ITEM_ID id,unsigned char count){\n\tfor(unsigned int i = 0;i < size;i++){\n\t\tif(inv[i].id == id){\n#ifdef DEBUG\n\t\t\tDEBUG_printf(\"Took %u of player's %s(s).\\n\",count,item[i].name);\n#endif \/\/ DEBUG\n\t\t\tinv[i].count-=count;\n\t\t\treturn 0;\n\t\t}\n\t}\n\treturn -1;\n}\n\nvoid Inventory::draw(void){\n\tstatic unsigned int lop = 0;\n\tstatic unsigned int numSlot = 7;\n\tstatic std::vector<int>dfp(numSlot);\n\tstatic std::vector<Ray>iray(numSlot);\n\tstatic std::vector<vec2>curCoord(numSlot);\n\tstatic int range = 200;\n\tstatic int itemWide = 45;\n\tfloat angleB = (float)180\/(float)numSlot;\n\tfloat angle = float(angleB\/2.0f);\n\tunsigned int a = 0;\n\tunsigned int end = 0;\n\tstatic vec2 mouseStart = {0,0};\n\tfor(auto &r : iray){\n\t\tr.start.x = player->loc.x + (player->width\/2);\n\t\tr.start.y = player->loc.y + (player->height\/2);\n\t\tcurCoord[a] = r.start;\n\t\t\/\/dfp[a] = 0;\n\t\ta++;\n\t}a=0;\n\tif(invOpening){\n\t\tend = 0;\n\t\tfor(auto &d : dfp){\n\t\t\tif(a != 0){\n\t\t\t\tif(dfp[a-1]>50)d+=1.65*deltaTime;\n\t\t\t}else{\n\t\t\t\td += 1.65*deltaTime;\n\t\t\t}\n\t\t\tif(d >= range)\n\t\t\t\td = range;\n\t\t\ta++;\n\t\t}a=0;\n\t\tif(end < numSlot)invOpen=true;\n\t}else if(!invOpening){\n\t\tfor(auto &d : dfp){\n\t\t\tif(d > 0){\n\t\t\t\td-=1.65*deltaTime;\n\t\t\t}else end++;\n\t\t}\n\t\tif(end >= numSlot)invOpen=false;\n\t}\n\tif(invOpen){\n\t\tfor(auto &r : iray){\n\t\t\tangle=180-(angleB*a) - angleB\/2.0f;\n\t\t\tcurCoord[a].x += float((dfp[a]) * cos(angle*PI\/180));\n\t\t\tcurCoord[a].y += float((dfp[a]) * sin(angle*PI\/180));\n\t\t\tr.end = curCoord[a];\n\n\t\t\tglColor4f(0.0f, 0.0f, 0.0f, ((float)dfp[a]\/(float)range)*0.4f);\n \t\t\tglBegin(GL_QUADS);\n\t\t\t\tglVertex2i(r.end.x-(itemWide\/2),\t\t\tr.end.y-(itemWide\/2));\n\t\t\t\tglVertex2i(r.end.x-(itemWide\/2)+itemWide,\tr.end.y-(itemWide\/2));\n\t\t\t\tglVertex2i(r.end.x-(itemWide\/2)+itemWide,\tr.end.y-(itemWide\/2)+itemWide);\n\t\t\t\tglVertex2i(r.end.x-(itemWide\/2),\t\t\tr.end.y-(itemWide\/2)+itemWide);\n\t\t\tglEnd();\n\n\t\t\tif(inv[a].count > 0){\n\t\t\t\tglEnable(GL_TEXTURE_2D);\n\t\t\t\tglBindTexture(GL_TEXTURE_2D, itemtex[inv[a].id]);\t\t\t\n\t\t\t\tglColor4f(1.0f, 1.0f, 1.0f, ((float)dfp[a]\/(float)range)*0.8f);\n\t \t\t\tglBegin(GL_QUADS);\n\t\t\t\t\tglTexCoord2i(0,1);glVertex2i(r.end.x-(itemWide\/2),\t\t\tr.end.y-(itemWide\/2));\n\t\t\t\t\tglTexCoord2i(1,1);glVertex2i(r.end.x-(itemWide\/2)+itemWide,\tr.end.y-(itemWide\/2));\n\t\t\t\t\tglTexCoord2i(1,0);glVertex2i(r.end.x-(itemWide\/2)+itemWide,\tr.end.y-(itemWide\/2)+itemWide);\n\t\t\t\t\tglTexCoord2i(0,0);glVertex2i(r.end.x-(itemWide\/2),\t\t\tr.end.y-(itemWide\/2)+itemWide);\n\t\t\t\tglEnd();\n\t\t\t\tglDisable(GL_TEXTURE_2D);\n\t\t\t\tui::putText(r.end.x-(itemWide\/2)+(itemWide*.85),r.end.y-(itemWide\/1.75),\"%d\",inv[a].count);\n\t\t\t}\n\t\t\ta++;\n\t\t}\n\t}else if(invHover){\n\t\tstatic int highlight = 0;\n\t\tstd::cout << ui::mouse.x << \",\" << mouseStart.x << \",\" << mouseSel << std::endl;\n\t\tif(!mouseSel){\n\t\t\tmouseStart.x = ui::mouse.x;\n\t\t\thighlight = sel;\n\t\t\tmouseSel=true;\n\t\t}else{\n\t\t\tif(ui::mouse.x >= mouseStart.x){\n\t\t\t\thighlight = (ui::mouse.x - mouseStart.x)\/45;\n\t\t\t\tif(highlight>numSlot)highlight=numSlot;\n\t\t\t\tif(SDL_GetMouseState(NULL, NULL) & SDL_BUTTON(SDL_BUTTON_RIGHT)){\n\t\t\t\t\tsel = highlight;\n\t\t\t\t\tmouseSel=false;\n\t\t\t\t\tinvHover=false;\n\t\t\t\t\tselected = true;\n\t\t\t\t}\n\t\t\t}\n\t\t\tif(ui::mouse.x < mouseStart.x){\n\t\t\t\thighlight = (mouseStart.x - ui::mouse.x)\/45;\n\t\t\t\tif(highlight<0)highlight=0;\n\t\t\t\tif(SDL_GetMouseState(NULL, NULL) & SDL_BUTTON(SDL_BUTTON_RIGHT)){\n\t\t\t\t\tsel = highlight;\n\t\t\t\t\tmouseSel=false;\n\t\t\t\t\tinvHover=false;\n\t\t\t\t\tselected = true;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tfor(auto &r : iray){\n\t\t\tangle=180-(angleB*a) - angleB\/2.0f;\n\t\t\tcurCoord[a].x += float(range) * cos(angle*PI\/180);\n\t\t\tcurCoord[a].y += float(range) * sin(angle*PI\/180);\n\t\t\tr.end = curCoord[a];\n\n\t\t\tglColor4f(0.0f, 0.0f, 0.0f, 0.1f);\n \t\t\tglBegin(GL_QUADS);\n\t\t\t\tglVertex2i(r.end.x-(itemWide\/2),\t\t\tr.end.y-(itemWide\/2));\n\t\t\t\tglVertex2i(r.end.x-(itemWide\/2)+itemWide,\tr.end.y-(itemWide\/2));\n\t\t\t\tglVertex2i(r.end.x-(itemWide\/2)+itemWide,\tr.end.y-(itemWide\/2)+itemWide);\n\t\t\t\tglVertex2i(r.end.x-(itemWide\/2),\t\t\tr.end.y-(itemWide\/2)+itemWide);\n\t\t\tglEnd();\n\n\t\t\tif(inv[a].count > 0){\n\t\t\t\tglEnable(GL_TEXTURE_2D);\n\t\t\t\tglBindTexture(GL_TEXTURE_2D, itemtex[inv[a].id]);\t\t\t\n\t\t\t\tglColor4f(1.0f, 1.0f, 1.0f, a == highlight ? 0.4f : 0.2f);\n\t \t\t\tglBegin(GL_QUADS);\n\t\t\t\t\tglTexCoord2i(0,1);glVertex2i(r.end.x-(itemWide\/2),\t\t\tr.end.y-(itemWide\/2));\n\t\t\t\t\tglTexCoord2i(1,1);glVertex2i(r.end.x-(itemWide\/2)+itemWide,\tr.end.y-(itemWide\/2));\n\t\t\t\t\tglTexCoord2i(1,0);glVertex2i(r.end.x-(itemWide\/2)+itemWide,\tr.end.y-(itemWide\/2)+itemWide);\n\t\t\t\t\tglTexCoord2i(0,0);glVertex2i(r.end.x-(itemWide\/2),\t\t\tr.end.y-(itemWide\/2)+itemWide);\n\t\t\t\tglEnd();\n\t\t\t\tglDisable(GL_TEXTURE_2D);\n\t\t\t\tui::putText(r.end.x-(itemWide\/2)+(itemWide*.85),r.end.y-(itemWide\/1.75),\"%d\",inv[a].count);\n\t\t\t}\n\t\t\ta++;\n\t\t}\n\t}\n\tif(inv[sel].count)itemDraw(player,inv[sel].id);\n\tlop++;\n}\n\nvoid itemDraw(Player *p,ITEM_ID id){\n\tif(!id)return;\n\tglEnable(GL_TEXTURE_2D);\n\tglBindTexture(GL_TEXTURE_2D,itemtex[id]);\n\tglColor4ub(255,255,255,255);\n\tglBegin(GL_QUADS);\n\t\tglTexCoord2i(0,1);glVertex2f(p->loc.x,\t\t\t\t p->loc.y);\n\t\tglTexCoord2i(1,1);glVertex2f(p->loc.x+item[id].width,p->loc.y);\n\t\tglTexCoord2i(1,0);glVertex2f(p->loc.x+item[id].width,p->loc.y+item[id].height);\n\t\tglTexCoord2i(0,0);glVertex2f(p->loc.x,\t\t\t\t p->loc.y+item[id].height);\n\tglEnd();\n\tglDisable(GL_TEXTURE_2D);\n}\n\nint Inventory::useItem(void){\n\tITEM_ID id = item[inv[sel].id].id;\n\tswitch(id){\n\tcase FLASHLIGHT:\n\t\tplayer->light ^= true;\n\t\tbreak;\n\tdefault:\n\t\t\/\/ui::dialogBox(item[id].name,NULL,\"You cannot use this item.\");\n\t\tbreak;\n\t}\n\treturn 0;\n}\n\n<commit_msg>fixes for wall<commit_after>#include <inventory.h>\n#include <entities.h>\n#include <ui.h>\n\n#define ITEM_COUNT 5\t\/\/ Total number of items that actually exist\n\nextern Player *player;\nextern GLuint invUI;\n\nstatic const Item item[ITEM_COUNT]= {\n\t#include \"..\/config\/items.h\"\n};\n\nstatic GLuint itemtex[ITEM_COUNT];\n\nvoid itemDraw(Player *p,ITEM_ID id);\n\nvoid initInventorySprites(void){\n\tunsigned int i;\n\tfor(i = 0;i < ITEM_COUNT;i++){\n\t\titemtex[i] = Texture::loadTexture(getItemTexturePath((ITEM_ID)i));\n\t}\n}\n\nchar *getItemTexturePath(ITEM_ID id){\n\treturn item[id].textureLoc;\n}\n\nItem::Item(ITEM_ID i, const char *n, ITEM_TYPE t, float w, float h, int m, const char *tl){\n\tid = i;\n\ttype = t;\n\twidth = w;\n\theight = h;\n\tmaxStackSize = m;\n\n\tname \t\t= new char[strlen(n)+1];\n\ttextureLoc \t= new char[strlen(tl)+1];\n\n\tstrcpy(name,n);\n\tstrcpy(textureLoc,tl);\n\n\t\/\/tex= new Texturec(1,textureLoc);\n}\n\nInventory::Inventory(unsigned int s){\n\tsel=0;\n\tsize=s;\n\tinv = new struct item_t[size];\n\tmemset(inv,0,size*sizeof(struct item_t));\n}\n\nInventory::~Inventory(void){\n\tdelete[] inv;\n}\n\nvoid Inventory::setSelection(unsigned int s){\n\tsel=s;\n}\n\nint Inventory::addItem(ITEM_ID id,unsigned char count){\n\t\/\/std::cout << id << \",\" << inv[os].id << std::endl;\n\t\n\tfor(unsigned int i = 0; i < size; i++){\n\t\tif(id == inv[i].id){\n\t\t\tinv[i].count += count;\n\t\t\tbreak;\n\t\t}else if(id){\n\t\t\tinv[os].id = id;\n\t\t\tinv[os].count = count;\n\t\t\tos++;\n\t\t\tbreak;\n\t\t}\n\t}\n\n#ifdef DEBUG\n\tDEBUG_printf(\"Gave player %u more %s(s)(ID: %d).\\n\",count,item[id].name,item[id].id);\n#endif \/\/ DEBUG\n\n\treturn 0;\n}\n\nint Inventory::takeItem(ITEM_ID id,unsigned char count){\n\tfor(unsigned int i = 0;i < size;i++){\n\t\tif(inv[i].id == id){\n#ifdef DEBUG\n\t\t\tDEBUG_printf(\"Took %u of player's %s(s).\\n\",count,item[i].name);\n#endif \/\/ DEBUG\n\t\t\tinv[i].count-=count;\n\t\t\treturn 0;\n\t\t}\n\t}\n\treturn -1;\n}\n\nvoid Inventory::draw(void){\n\tstatic unsigned int lop = 0;\n\tstatic unsigned int numSlot = 7;\n\tstatic std::vector<int>dfp(numSlot);\n\tstatic std::vector<Ray>iray(numSlot);\n\tstatic std::vector<vec2>curCoord(numSlot);\n\tstatic int range = 200;\n\tstatic int itemWide = 45;\n\tfloat angleB = (float)180\/(float)numSlot;\n\tfloat angle = float(angleB\/2.0f);\n\tunsigned int a = 0;\n\tunsigned int end = 0;\n\tstatic vec2 mouseStart = {0,0};\n\tfor(auto &r : iray){\n\t\tr.start.x = player->loc.x + (player->width\/2);\n\t\tr.start.y = player->loc.y + (player->height\/2);\n\t\tcurCoord[a] = r.start;\n\t\t\/\/dfp[a] = 0;\n\t\ta++;\n\t}a=0;\n\tif(invOpening){\n\t\tend = 0;\n\t\tfor(auto &d : dfp){\n\t\t\tif(a != 0){\n\t\t\t\tif(dfp[a-1]>50)d+=1.65*deltaTime;\n\t\t\t}else{\n\t\t\t\td += 1.65*deltaTime;\n\t\t\t}\n\t\t\tif(d >= range)\n\t\t\t\td = range;\n\t\t\ta++;\n\t\t}a=0;\n\t\tif(end < numSlot)invOpen=true;\n\t}else if(!invOpening){\n\t\tfor(auto &d : dfp){\n\t\t\tif(d > 0){\n\t\t\t\td-=1.65*deltaTime;\n\t\t\t}else end++;\n\t\t}\n\t\tif(end >= numSlot)invOpen=false;\n\t}\n\tif(invOpen){\n\t\tfor(auto &r : iray){\n\t\t\tangle=180-(angleB*a) - angleB\/2.0f;\n\t\t\tcurCoord[a].x += float((dfp[a]) * cos(angle*PI\/180));\n\t\t\tcurCoord[a].y += float((dfp[a]) * sin(angle*PI\/180));\n\t\t\tr.end = curCoord[a];\n\n\t\t\tglColor4f(0.0f, 0.0f, 0.0f, ((float)dfp[a]\/(float)range)*0.4f);\n \t\t\tglBegin(GL_QUADS);\n\t\t\t\tglVertex2i(r.end.x-(itemWide\/2),\t\t\tr.end.y-(itemWide\/2));\n\t\t\t\tglVertex2i(r.end.x-(itemWide\/2)+itemWide,\tr.end.y-(itemWide\/2));\n\t\t\t\tglVertex2i(r.end.x-(itemWide\/2)+itemWide,\tr.end.y-(itemWide\/2)+itemWide);\n\t\t\t\tglVertex2i(r.end.x-(itemWide\/2),\t\t\tr.end.y-(itemWide\/2)+itemWide);\n\t\t\tglEnd();\n\n\t\t\tif(inv[a].count > 0){\n\t\t\t\tglEnable(GL_TEXTURE_2D);\n\t\t\t\tglBindTexture(GL_TEXTURE_2D, itemtex[inv[a].id]);\t\t\t\n\t\t\t\tglColor4f(1.0f, 1.0f, 1.0f, ((float)dfp[a]\/(float)range)*0.8f);\n\t \t\t\tglBegin(GL_QUADS);\n\t\t\t\t\tglTexCoord2i(0,1);glVertex2i(r.end.x-(itemWide\/2),\t\t\tr.end.y-(itemWide\/2));\n\t\t\t\t\tglTexCoord2i(1,1);glVertex2i(r.end.x-(itemWide\/2)+itemWide,\tr.end.y-(itemWide\/2));\n\t\t\t\t\tglTexCoord2i(1,0);glVertex2i(r.end.x-(itemWide\/2)+itemWide,\tr.end.y-(itemWide\/2)+itemWide);\n\t\t\t\t\tglTexCoord2i(0,0);glVertex2i(r.end.x-(itemWide\/2),\t\t\tr.end.y-(itemWide\/2)+itemWide);\n\t\t\t\tglEnd();\n\t\t\t\tglDisable(GL_TEXTURE_2D);\n\t\t\t\tui::putText(r.end.x-(itemWide\/2)+(itemWide*.85),r.end.y-(itemWide\/1.75),\"%d\",inv[a].count);\n\t\t\t}\n\t\t\ta++;\n\t\t}\n\t}else if(invHover){\n\t\tstatic unsigned int highlight = 0;\n\t\tstd::cout << ui::mouse.x << \",\" << mouseStart.x << \",\" << mouseSel << std::endl;\n\t\tif(!mouseSel){\n\t\t\tmouseStart.x = ui::mouse.x;\n\t\t\thighlight = sel;\n\t\t\tmouseSel=true;\n\t\t}else{\n\t\t\tif(ui::mouse.x >= mouseStart.x){\n\t\t\t\thighlight = (ui::mouse.x - mouseStart.x)\/45;\n\t\t\t\tif(highlight>numSlot)highlight=numSlot;\n\t\t\t\tif(SDL_GetMouseState(NULL, NULL) & SDL_BUTTON(SDL_BUTTON_RIGHT)){\n\t\t\t\t\tsel = highlight;\n\t\t\t\t\tmouseSel=false;\n\t\t\t\t\tinvHover=false;\n\t\t\t\t\tselected = true;\n\t\t\t\t}\n\t\t\t}\n\t\t\tif(ui::mouse.x < mouseStart.x){\n\t\t\t\thighlight = (mouseStart.x - ui::mouse.x)\/45;\n\t\t\t\t\/\/if(highlight<0)highlight=0;\n\t\t\t\tif(SDL_GetMouseState(NULL, NULL) & SDL_BUTTON(SDL_BUTTON_RIGHT)){\n\t\t\t\t\tsel = highlight;\n\t\t\t\t\tmouseSel=false;\n\t\t\t\t\tinvHover=false;\n\t\t\t\t\tselected = true;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tfor(auto &r : iray){\n\t\t\tangle=180-(angleB*a) - angleB\/2.0f;\n\t\t\tcurCoord[a].x += float(range) * cos(angle*PI\/180);\n\t\t\tcurCoord[a].y += float(range) * sin(angle*PI\/180);\n\t\t\tr.end = curCoord[a];\n\n\t\t\tglColor4f(0.0f, 0.0f, 0.0f, 0.1f);\n \t\t\tglBegin(GL_QUADS);\n\t\t\t\tglVertex2i(r.end.x-(itemWide\/2),\t\t\tr.end.y-(itemWide\/2));\n\t\t\t\tglVertex2i(r.end.x-(itemWide\/2)+itemWide,\tr.end.y-(itemWide\/2));\n\t\t\t\tglVertex2i(r.end.x-(itemWide\/2)+itemWide,\tr.end.y-(itemWide\/2)+itemWide);\n\t\t\t\tglVertex2i(r.end.x-(itemWide\/2),\t\t\tr.end.y-(itemWide\/2)+itemWide);\n\t\t\tglEnd();\n\n\t\t\tif(inv[a].count > 0){\n\t\t\t\tglEnable(GL_TEXTURE_2D);\n\t\t\t\tglBindTexture(GL_TEXTURE_2D, itemtex[inv[a].id]);\t\t\t\n\t\t\t\tglColor4f(1.0f, 1.0f, 1.0f, a == highlight ? 0.4f : 0.2f);\n\t \t\t\tglBegin(GL_QUADS);\n\t\t\t\t\tglTexCoord2i(0,1);glVertex2i(r.end.x-(itemWide\/2),\t\t\tr.end.y-(itemWide\/2));\n\t\t\t\t\tglTexCoord2i(1,1);glVertex2i(r.end.x-(itemWide\/2)+itemWide,\tr.end.y-(itemWide\/2));\n\t\t\t\t\tglTexCoord2i(1,0);glVertex2i(r.end.x-(itemWide\/2)+itemWide,\tr.end.y-(itemWide\/2)+itemWide);\n\t\t\t\t\tglTexCoord2i(0,0);glVertex2i(r.end.x-(itemWide\/2),\t\t\tr.end.y-(itemWide\/2)+itemWide);\n\t\t\t\tglEnd();\n\t\t\t\tglDisable(GL_TEXTURE_2D);\n\t\t\t\tui::putText(r.end.x-(itemWide\/2)+(itemWide*.85),r.end.y-(itemWide\/1.75),\"%d\",inv[a].count);\n\t\t\t}\n\t\t\ta++;\n\t\t}\n\t}\n\tif(inv[sel].count)itemDraw(player,inv[sel].id);\n\tlop++;\n}\n\nvoid itemDraw(Player *p,ITEM_ID id){\n\tif(!id)return;\n\tglEnable(GL_TEXTURE_2D);\n\tglBindTexture(GL_TEXTURE_2D,itemtex[id]);\n\tglColor4ub(255,255,255,255);\n\tglBegin(GL_QUADS);\n\t\tglTexCoord2i(0,1);glVertex2f(p->loc.x,\t\t\t\t p->loc.y);\n\t\tglTexCoord2i(1,1);glVertex2f(p->loc.x+item[id].width,p->loc.y);\n\t\tglTexCoord2i(1,0);glVertex2f(p->loc.x+item[id].width,p->loc.y+item[id].height);\n\t\tglTexCoord2i(0,0);glVertex2f(p->loc.x,\t\t\t\t p->loc.y+item[id].height);\n\tglEnd();\n\tglDisable(GL_TEXTURE_2D);\n}\n\nint Inventory::useItem(void){\n\tITEM_ID id = item[inv[sel].id].id;\n\tswitch(id){\n\tcase FLASHLIGHT:\n\t\tplayer->light ^= true;\n\t\tbreak;\n\tdefault:\n\t\t\/\/ui::dialogBox(item[id].name,NULL,\"You cannot use this item.\");\n\t\tbreak;\n\t}\n\treturn 0;\n}\n\n<|endoftext|>"} {"text":"<commit_before>\/*\n===========================================================================\nDaemon BSD Source Code\nCopyright (c) 2013-2016, 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 \"CommandBuffer.h\"\n\nnamespace IPC {\n\n void CommandBuffer::Init(void* memory, size_t size) {\n if (size < DATA_OFFSET) {\n Sys::Drop(\"Buffer is too small, size is %i\", size);\n }\n\n this->size = size - DATA_OFFSET;\n base = reinterpret_cast<char*>(memory);\n writerOffset = SAFETY_OFFSET;\n readerOffset = 0;\n }\n\n void CommandBuffer::Reset() {\n \/\/ The writer starts at the safety offset to have the invariant at init.\n reinterpret_cast<SharedWriterData*>(base + WRITER_OFFSET)->offset.store(SAFETY_OFFSET);\n reinterpret_cast<SharedReaderData*>(base + READER_OFFSET)->offset.store(0);\n }\n\n void CommandBuffer::LoadWriterData() {\n writerOffset = reinterpret_cast<SharedWriterData*>(base + WRITER_OFFSET)->offset.load(std::memory_order_acquire);\n if (writerOffset >= size) {\n Sys::Drop(\"Invalid writerOffset %i for size %i\", writerOffset, size);\n }\n }\n\n void CommandBuffer::LoadReaderData() {\n readerOffset = reinterpret_cast<SharedReaderData*>(base + READER_OFFSET)->offset.load(std::memory_order_acquire);\n if (readerOffset >= size) {\n Sys::Drop(\"Invalid readerOffset %i for size %i\", readerOffset, size);\n }\n }\n\n size_t CommandBuffer::GetMaxReadLength() const {\n return FromRead(writerOffset) - SAFETY_OFFSET;\n }\n\n size_t CommandBuffer::GetMaxWriteLength() const {\n return FromWrite(readerOffset) - SAFETY_OFFSET;\n }\n\n bool CommandBuffer::CanRead(size_t len) const {\n return FromRead(writerOffset) - SAFETY_OFFSET >= len;\n }\n\n bool CommandBuffer::CanWrite(size_t len) const {\n return FromWrite(readerOffset) - SAFETY_OFFSET >= len;\n }\n\n void CommandBuffer::Read(char* out, size_t len, size_t offset) {\n \/\/ Add an additional SAFETY_OFFSET to catch what the write pointer has written.\n InternalRead(readerOffset + offset + SAFETY_OFFSET, out, len);\n }\n\n void CommandBuffer::Write(const char* in, size_t len, size_t offset) {\n InternalWrite(writerOffset + offset, in, len);\n }\n\n void CommandBuffer::AdvanceReadPointer(size_t offset) {\n \/\/ TODO assert that offset is < size\n \/\/ Realign the offset to be a multiple of 4\n offset = (offset + 3) & ~3;\n readerOffset = Normalize(readerOffset + offset);\n reinterpret_cast<SharedReaderData*>(base + READER_OFFSET)->offset.store(readerOffset, std::memory_order_release);\n }\n\n void CommandBuffer::AdvanceWritePointer(size_t offset) {\n \/\/ TODO assert that offset is < size\n \/\/ Realign the offset to be a multiple of 4\n offset = (offset + 3) & ~3;\n writerOffset = Normalize(writerOffset + offset);\n reinterpret_cast<SharedWriterData*>(base + WRITER_OFFSET)->offset.store(writerOffset, std::memory_order_release);\n }\n\n size_t CommandBuffer::GetSize() const {\n return size;\n }\n\n size_t CommandBuffer::Normalize(size_t offset) const {\n if (offset >= size) {\n offset -= size;\n }\n if (offset >= size) {\n offset -= size;\n }\n \/\/TODO assert < size\n return offset;\n }\n\n size_t CommandBuffer::FromRead(size_t offset) const {\n if (offset < readerOffset) {\n offset += size;\n }\n return offset - readerOffset;\n }\n\n size_t CommandBuffer::FromWrite(size_t offset) const {\n if (offset < writerOffset) {\n offset += size;\n }\n return offset - writerOffset;\n }\n\n void CommandBuffer::InternalRead(size_t offset, char* out, size_t len) {\n char* data = base + DATA_OFFSET;\n offset = Normalize(offset);\n size_t canRead = size - offset;\n if (len >= canRead) {\n memcpy(out, data + offset, canRead);\n len -= canRead;\n out += canRead;\n memcpy(out, data, len);\n } else {\n memcpy(out, data + offset, len);\n }\n }\n\n void CommandBuffer::InternalWrite(size_t offset, const char* in, size_t len) {\n char* data = base + DATA_OFFSET;\n offset = Normalize(offset);\n size_t canWrite = size - offset;\n if (len >= canWrite) {\n memcpy(data + offset, in, canWrite);\n len -= canWrite;\n in += canWrite;\n memcpy(data, in, len);\n } else {\n memcpy(data + offset, in, len);\n }\n }\n\n} \/\/ namespace IPC\n<commit_msg>[fmt] Use correct format specifier for size<commit_after>\/*\n===========================================================================\nDaemon BSD Source Code\nCopyright (c) 2013-2016, 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 \"CommandBuffer.h\"\n\nnamespace IPC {\n\n void CommandBuffer::Init(void* memory, size_t size) {\n if (size < DATA_OFFSET) {\n Sys::Drop(\"Buffer is too small, size is %u\", (unsigned)size);\n }\n\n this->size = size - DATA_OFFSET;\n base = reinterpret_cast<char*>(memory);\n writerOffset = SAFETY_OFFSET;\n readerOffset = 0;\n }\n\n void CommandBuffer::Reset() {\n \/\/ The writer starts at the safety offset to have the invariant at init.\n reinterpret_cast<SharedWriterData*>(base + WRITER_OFFSET)->offset.store(SAFETY_OFFSET);\n reinterpret_cast<SharedReaderData*>(base + READER_OFFSET)->offset.store(0);\n }\n\n void CommandBuffer::LoadWriterData() {\n writerOffset = reinterpret_cast<SharedWriterData*>(base + WRITER_OFFSET)->offset.load(std::memory_order_acquire);\n if (writerOffset >= size) {\n Sys::Drop(\"Invalid writerOffset %i for size %i\", writerOffset, size);\n }\n }\n\n void CommandBuffer::LoadReaderData() {\n readerOffset = reinterpret_cast<SharedReaderData*>(base + READER_OFFSET)->offset.load(std::memory_order_acquire);\n if (readerOffset >= size) {\n Sys::Drop(\"Invalid readerOffset %i for size %i\", readerOffset, size);\n }\n }\n\n size_t CommandBuffer::GetMaxReadLength() const {\n return FromRead(writerOffset) - SAFETY_OFFSET;\n }\n\n size_t CommandBuffer::GetMaxWriteLength() const {\n return FromWrite(readerOffset) - SAFETY_OFFSET;\n }\n\n bool CommandBuffer::CanRead(size_t len) const {\n return FromRead(writerOffset) - SAFETY_OFFSET >= len;\n }\n\n bool CommandBuffer::CanWrite(size_t len) const {\n return FromWrite(readerOffset) - SAFETY_OFFSET >= len;\n }\n\n void CommandBuffer::Read(char* out, size_t len, size_t offset) {\n \/\/ Add an additional SAFETY_OFFSET to catch what the write pointer has written.\n InternalRead(readerOffset + offset + SAFETY_OFFSET, out, len);\n }\n\n void CommandBuffer::Write(const char* in, size_t len, size_t offset) {\n InternalWrite(writerOffset + offset, in, len);\n }\n\n void CommandBuffer::AdvanceReadPointer(size_t offset) {\n \/\/ TODO assert that offset is < size\n \/\/ Realign the offset to be a multiple of 4\n offset = (offset + 3) & ~3;\n readerOffset = Normalize(readerOffset + offset);\n reinterpret_cast<SharedReaderData*>(base + READER_OFFSET)->offset.store(readerOffset, std::memory_order_release);\n }\n\n void CommandBuffer::AdvanceWritePointer(size_t offset) {\n \/\/ TODO assert that offset is < size\n \/\/ Realign the offset to be a multiple of 4\n offset = (offset + 3) & ~3;\n writerOffset = Normalize(writerOffset + offset);\n reinterpret_cast<SharedWriterData*>(base + WRITER_OFFSET)->offset.store(writerOffset, std::memory_order_release);\n }\n\n size_t CommandBuffer::GetSize() const {\n return size;\n }\n\n size_t CommandBuffer::Normalize(size_t offset) const {\n if (offset >= size) {\n offset -= size;\n }\n if (offset >= size) {\n offset -= size;\n }\n \/\/TODO assert < size\n return offset;\n }\n\n size_t CommandBuffer::FromRead(size_t offset) const {\n if (offset < readerOffset) {\n offset += size;\n }\n return offset - readerOffset;\n }\n\n size_t CommandBuffer::FromWrite(size_t offset) const {\n if (offset < writerOffset) {\n offset += size;\n }\n return offset - writerOffset;\n }\n\n void CommandBuffer::InternalRead(size_t offset, char* out, size_t len) {\n char* data = base + DATA_OFFSET;\n offset = Normalize(offset);\n size_t canRead = size - offset;\n if (len >= canRead) {\n memcpy(out, data + offset, canRead);\n len -= canRead;\n out += canRead;\n memcpy(out, data, len);\n } else {\n memcpy(out, data + offset, len);\n }\n }\n\n void CommandBuffer::InternalWrite(size_t offset, const char* in, size_t len) {\n char* data = base + DATA_OFFSET;\n offset = Normalize(offset);\n size_t canWrite = size - offset;\n if (len >= canWrite) {\n memcpy(data + offset, in, canWrite);\n len -= canWrite;\n in += canWrite;\n memcpy(data, in, len);\n } else {\n memcpy(data + offset, in, len);\n }\n }\n\n} \/\/ namespace IPC\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 \"disk_types.hh\"\n#include \"core\/enum.hh\"\n#include \"bytes.hh\"\n#include \"gc_clock.hh\"\n#include \"tombstone.hh\"\n#include \"streaming_histogram.hh\"\n#include \"estimated_histogram.hh\"\n#include \"column_name_helper.hh\"\n#include \"sstables\/key.hh\"\n#include \"db\/commitlog\/replay_position.hh\"\n#include <vector>\n#include <unordered_map>\n#include <type_traits>\n\n\/\/ While the sstable code works with char, bytes_view works with int8_t\n\/\/ (signed char). Rather than change all the code, let's do a cast.\nstatic inline bytes_view to_bytes_view(const temporary_buffer<char>& b) {\n using byte = bytes_view::value_type;\n return bytes_view(reinterpret_cast<const byte*>(b.get()), b.size());\n}\n\nnamespace sstables {\n\nstruct option {\n disk_string<uint16_t> key;\n disk_string<uint16_t> value;\n\n template <typename Describer>\n auto describe_type(Describer f) { return f(key, value); }\n};\n\nstruct filter {\n uint32_t hashes;\n disk_array<uint32_t, uint64_t> buckets;\n\n template <typename Describer>\n auto describe_type(Describer f) { return f(hashes, buckets); }\n\n \/\/ Create an always positive filter if nothing else is specified.\n filter() : hashes(0), buckets({}) {}\n explicit filter(int hashes, std::deque<uint64_t> buckets) : hashes(hashes), buckets({std::move(buckets)}) {}\n};\n\nclass index_entry {\n temporary_buffer<char> _key;\n uint64_t _position;\n temporary_buffer<char> _promoted_index;\npublic:\n\n bytes_view get_key_bytes() const {\n return to_bytes_view(_key);\n }\n\n key_view get_key() const {\n return { get_key_bytes() };\n }\n\n uint64_t position() const {\n return _position;\n }\n\n index_entry(temporary_buffer<char>&& key, uint64_t position, temporary_buffer<char>&& promoted_index)\n : _key(std::move(key)), _position(position), _promoted_index(std::move(promoted_index)) {}\n\n};\n\nstruct summary_entry {\n bytes key;\n uint64_t position;\n\n key_view get_key() const {\n return { key };\n }\n\n bool operator==(const summary_entry& x) const {\n return position == x.position && key == x.key;\n }\n};\n\n\/\/ Note: Sampling level is present in versions ka and higher. We ATM only support ka,\n\/\/ so it's always there. But we need to make this conditional if we ever want to support\n\/\/ other formats.\nstruct summary_ka {\n struct header {\n \/\/ The minimum possible amount of indexes per group (sampling level)\n uint32_t min_index_interval;\n \/\/ The number of entries in the Summary File\n uint32_t size;\n \/\/ The memory to be consumed to map the whole Summary into memory.\n uint64_t memory_size;\n \/\/ The actual sampling level.\n uint32_t sampling_level;\n \/\/ The number of entries the Summary *would* have if the sampling\n \/\/ level would be equal to min_index_interval.\n uint32_t size_at_full_sampling;\n } header;\n \/\/ The position in the Summary file for each of the indexes.\n \/\/ NOTE1 that its actual size is determined by the \"size\" parameter, not\n \/\/ by its preceding size_at_full_sampling\n \/\/ NOTE2: They are laid out in *MEMORY* order, not BE.\n \/\/ NOTE3: The sizes in this array represent positions in the memory stream,\n \/\/ not the file. The memory stream effectively begins after the header,\n \/\/ so every position here has to be added of sizeof(header).\n std::deque<uint32_t> positions; \/\/ can be large, so use a deque instead of a vector\n std::deque<summary_entry> entries;\n\n disk_string<uint32_t> first_key;\n disk_string<uint32_t> last_key;\n\n \/\/ Used to determine when a summary entry should be added based on min_index_interval.\n \/\/ NOTE: keys_written isn't part of on-disk format of summary.\n size_t keys_written;\n\n \/\/ NOTE4: There is a structure written by Cassandra into the end of the Summary\n \/\/ file, after the field last_key, that we haven't understand yet, but we know\n \/\/ that its content isn't related to the summary itself.\n \/\/ The structure is basically as follow:\n \/\/ struct { disk_string<uint16_t>; uint32_t; uint64_t; disk_string<uint16_t>; }\n \/\/ Another interesting fact about this structure is that it is apparently always\n \/\/ filled with the same data. It's too early to judge that the data is useless.\n \/\/ However, it was tested that Cassandra loads successfully a Summary file with\n \/\/ this structure removed from it. Anyway, let's pay attention to it.\n\n \/*\n * Returns total amount of memory used by the summary\n * Similar to origin off heap size\n *\/\n uint64_t memory_footprint() const {\n return sizeof(summary_entry) * entries.size() + sizeof(uint32_t) * positions.size() + sizeof(*this);\n }\n\n explicit operator bool() const {\n return entries.size();\n }\n};\nusing summary = summary_ka;\n\nstruct metadata {\n virtual ~metadata() {}\n};\n\nstruct validation_metadata : public metadata {\n disk_string<uint16_t> partitioner;\n double filter_chance;\n\n size_t serialized_size() {\n return sizeof(uint16_t) + partitioner.value.size() + sizeof(filter_chance);\n }\n\n template <typename Describer>\n auto describe_type(Describer f) { return f(partitioner, filter_chance); }\n};\n\nstruct compaction_metadata : public metadata {\n disk_array<uint32_t, uint32_t> ancestors;\n disk_array<uint32_t, uint8_t> cardinality;\n\n size_t serialized_size() {\n return sizeof(uint32_t) + (ancestors.elements.size() * sizeof(uint32_t)) +\n sizeof(uint32_t) + (cardinality.elements.size() * sizeof(uint8_t));\n }\n\n template <typename Describer>\n auto describe_type(Describer f) { return f(ancestors, cardinality); }\n};\n\nstruct ka_stats_metadata : public metadata {\n estimated_histogram estimated_row_size;\n estimated_histogram estimated_column_count;\n db::replay_position position;\n int64_t min_timestamp;\n int64_t max_timestamp;\n int32_t max_local_deletion_time;\n double compression_ratio;\n streaming_histogram estimated_tombstone_drop_time;\n uint32_t sstable_level;\n uint64_t repaired_at;\n disk_array<uint32_t, disk_string<uint16_t>> min_column_names;\n disk_array<uint32_t, disk_string<uint16_t>> max_column_names;\n bool has_legacy_counter_shards;\n\n template <typename Describer>\n auto describe_type(Describer f) {\n return f(\n estimated_row_size,\n estimated_column_count,\n position,\n min_timestamp,\n max_timestamp,\n max_local_deletion_time,\n compression_ratio,\n estimated_tombstone_drop_time,\n sstable_level,\n repaired_at,\n min_column_names,\n max_column_names,\n has_legacy_counter_shards\n );\n }\n};\nusing stats_metadata = ka_stats_metadata;\n\n\/\/ Numbers are found on disk, so they do matter. Also, setting their sizes of\n\/\/ that of an uint32_t is a bit wasteful, but it simplifies the code a lot\n\/\/ since we can now still use a strongly typed enum without introducing a\n\/\/ notion of \"disk-size\" vs \"memory-size\".\nenum class metadata_type : uint32_t {\n Validation = 0,\n Compaction = 1,\n Stats = 2,\n};\n\n\nstatic constexpr int DEFAULT_CHUNK_SIZE = 65536;\n\n\/\/ checksums are generated using adler32 algorithm.\nstruct checksum {\n uint32_t chunk_size;\n std::deque<uint32_t> checksums;\n\n template <typename Describer>\n auto describe_type(Describer f) { return f(chunk_size, checksums); }\n};\n\n}\n\nnamespace std {\n\ntemplate <>\nstruct hash<sstables::metadata_type> : enum_hash<sstables::metadata_type> {};\n\n}\n\nnamespace sstables {\n\nstruct statistics {\n disk_hash<uint32_t, metadata_type, uint32_t> hash;\n std::unordered_map<metadata_type, std::unique_ptr<metadata>> contents;\n};\n\nstruct deletion_time {\n int32_t local_deletion_time;\n int64_t marked_for_delete_at;\n\n template <typename Describer>\n auto describe_type(Describer f) { return f(local_deletion_time, marked_for_delete_at); }\n\n bool live() const {\n return (local_deletion_time == std::numeric_limits<int32_t>::max()) &&\n (marked_for_delete_at == std::numeric_limits<int64_t>::min());\n }\n\n bool operator==(const deletion_time& d) {\n return local_deletion_time == d.local_deletion_time &&\n marked_for_delete_at == d.marked_for_delete_at;\n }\n bool operator!=(const deletion_time& d) {\n return !(*this == d);\n }\n explicit operator tombstone() {\n return !live() ? tombstone(marked_for_delete_at, gc_clock::time_point(gc_clock::duration(local_deletion_time))) : tombstone();\n }\n};\n\nenum class column_mask : uint8_t {\n none = 0x0,\n deletion = 0x01,\n expiration = 0x02,\n counter = 0x04,\n counter_update = 0x08,\n range_tombstone = 0x10,\n};\n\ninline column_mask operator&(column_mask m1, column_mask m2) {\n return column_mask(static_cast<uint8_t>(m1) & static_cast<uint8_t>(m2));\n}\n\ninline column_mask operator|(column_mask m1, column_mask m2) {\n return column_mask(static_cast<uint8_t>(m1) | static_cast<uint8_t>(m2));\n}\n}\n\n<commit_msg>sstables: expose promoted index in index entry<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 \"disk_types.hh\"\n#include \"core\/enum.hh\"\n#include \"bytes.hh\"\n#include \"gc_clock.hh\"\n#include \"tombstone.hh\"\n#include \"streaming_histogram.hh\"\n#include \"estimated_histogram.hh\"\n#include \"column_name_helper.hh\"\n#include \"sstables\/key.hh\"\n#include \"db\/commitlog\/replay_position.hh\"\n#include <vector>\n#include <unordered_map>\n#include <type_traits>\n\n\/\/ While the sstable code works with char, bytes_view works with int8_t\n\/\/ (signed char). Rather than change all the code, let's do a cast.\nstatic inline bytes_view to_bytes_view(const temporary_buffer<char>& b) {\n using byte = bytes_view::value_type;\n return bytes_view(reinterpret_cast<const byte*>(b.get()), b.size());\n}\n\nnamespace sstables {\n\nstruct option {\n disk_string<uint16_t> key;\n disk_string<uint16_t> value;\n\n template <typename Describer>\n auto describe_type(Describer f) { return f(key, value); }\n};\n\nstruct filter {\n uint32_t hashes;\n disk_array<uint32_t, uint64_t> buckets;\n\n template <typename Describer>\n auto describe_type(Describer f) { return f(hashes, buckets); }\n\n \/\/ Create an always positive filter if nothing else is specified.\n filter() : hashes(0), buckets({}) {}\n explicit filter(int hashes, std::deque<uint64_t> buckets) : hashes(hashes), buckets({std::move(buckets)}) {}\n};\n\nclass index_entry {\n temporary_buffer<char> _key;\n uint64_t _position;\n temporary_buffer<char> _promoted_index;\npublic:\n\n bytes_view get_key_bytes() const {\n return to_bytes_view(_key);\n }\n\n key_view get_key() const {\n return { get_key_bytes() };\n }\n\n uint64_t position() const {\n return _position;\n }\n\n bytes_view get_promoted_index_bytes() const {\n return to_bytes_view(_promoted_index);\n }\n\n index_entry(temporary_buffer<char>&& key, uint64_t position, temporary_buffer<char>&& promoted_index)\n : _key(std::move(key)), _position(position), _promoted_index(std::move(promoted_index)) {}\n\n};\n\nstruct summary_entry {\n bytes key;\n uint64_t position;\n\n key_view get_key() const {\n return { key };\n }\n\n bool operator==(const summary_entry& x) const {\n return position == x.position && key == x.key;\n }\n};\n\n\/\/ Note: Sampling level is present in versions ka and higher. We ATM only support ka,\n\/\/ so it's always there. But we need to make this conditional if we ever want to support\n\/\/ other formats.\nstruct summary_ka {\n struct header {\n \/\/ The minimum possible amount of indexes per group (sampling level)\n uint32_t min_index_interval;\n \/\/ The number of entries in the Summary File\n uint32_t size;\n \/\/ The memory to be consumed to map the whole Summary into memory.\n uint64_t memory_size;\n \/\/ The actual sampling level.\n uint32_t sampling_level;\n \/\/ The number of entries the Summary *would* have if the sampling\n \/\/ level would be equal to min_index_interval.\n uint32_t size_at_full_sampling;\n } header;\n \/\/ The position in the Summary file for each of the indexes.\n \/\/ NOTE1 that its actual size is determined by the \"size\" parameter, not\n \/\/ by its preceding size_at_full_sampling\n \/\/ NOTE2: They are laid out in *MEMORY* order, not BE.\n \/\/ NOTE3: The sizes in this array represent positions in the memory stream,\n \/\/ not the file. The memory stream effectively begins after the header,\n \/\/ so every position here has to be added of sizeof(header).\n std::deque<uint32_t> positions; \/\/ can be large, so use a deque instead of a vector\n std::deque<summary_entry> entries;\n\n disk_string<uint32_t> first_key;\n disk_string<uint32_t> last_key;\n\n \/\/ Used to determine when a summary entry should be added based on min_index_interval.\n \/\/ NOTE: keys_written isn't part of on-disk format of summary.\n size_t keys_written;\n\n \/\/ NOTE4: There is a structure written by Cassandra into the end of the Summary\n \/\/ file, after the field last_key, that we haven't understand yet, but we know\n \/\/ that its content isn't related to the summary itself.\n \/\/ The structure is basically as follow:\n \/\/ struct { disk_string<uint16_t>; uint32_t; uint64_t; disk_string<uint16_t>; }\n \/\/ Another interesting fact about this structure is that it is apparently always\n \/\/ filled with the same data. It's too early to judge that the data is useless.\n \/\/ However, it was tested that Cassandra loads successfully a Summary file with\n \/\/ this structure removed from it. Anyway, let's pay attention to it.\n\n \/*\n * Returns total amount of memory used by the summary\n * Similar to origin off heap size\n *\/\n uint64_t memory_footprint() const {\n return sizeof(summary_entry) * entries.size() + sizeof(uint32_t) * positions.size() + sizeof(*this);\n }\n\n explicit operator bool() const {\n return entries.size();\n }\n};\nusing summary = summary_ka;\n\nstruct metadata {\n virtual ~metadata() {}\n};\n\nstruct validation_metadata : public metadata {\n disk_string<uint16_t> partitioner;\n double filter_chance;\n\n size_t serialized_size() {\n return sizeof(uint16_t) + partitioner.value.size() + sizeof(filter_chance);\n }\n\n template <typename Describer>\n auto describe_type(Describer f) { return f(partitioner, filter_chance); }\n};\n\nstruct compaction_metadata : public metadata {\n disk_array<uint32_t, uint32_t> ancestors;\n disk_array<uint32_t, uint8_t> cardinality;\n\n size_t serialized_size() {\n return sizeof(uint32_t) + (ancestors.elements.size() * sizeof(uint32_t)) +\n sizeof(uint32_t) + (cardinality.elements.size() * sizeof(uint8_t));\n }\n\n template <typename Describer>\n auto describe_type(Describer f) { return f(ancestors, cardinality); }\n};\n\nstruct ka_stats_metadata : public metadata {\n estimated_histogram estimated_row_size;\n estimated_histogram estimated_column_count;\n db::replay_position position;\n int64_t min_timestamp;\n int64_t max_timestamp;\n int32_t max_local_deletion_time;\n double compression_ratio;\n streaming_histogram estimated_tombstone_drop_time;\n uint32_t sstable_level;\n uint64_t repaired_at;\n disk_array<uint32_t, disk_string<uint16_t>> min_column_names;\n disk_array<uint32_t, disk_string<uint16_t>> max_column_names;\n bool has_legacy_counter_shards;\n\n template <typename Describer>\n auto describe_type(Describer f) {\n return f(\n estimated_row_size,\n estimated_column_count,\n position,\n min_timestamp,\n max_timestamp,\n max_local_deletion_time,\n compression_ratio,\n estimated_tombstone_drop_time,\n sstable_level,\n repaired_at,\n min_column_names,\n max_column_names,\n has_legacy_counter_shards\n );\n }\n};\nusing stats_metadata = ka_stats_metadata;\n\n\/\/ Numbers are found on disk, so they do matter. Also, setting their sizes of\n\/\/ that of an uint32_t is a bit wasteful, but it simplifies the code a lot\n\/\/ since we can now still use a strongly typed enum without introducing a\n\/\/ notion of \"disk-size\" vs \"memory-size\".\nenum class metadata_type : uint32_t {\n Validation = 0,\n Compaction = 1,\n Stats = 2,\n};\n\n\nstatic constexpr int DEFAULT_CHUNK_SIZE = 65536;\n\n\/\/ checksums are generated using adler32 algorithm.\nstruct checksum {\n uint32_t chunk_size;\n std::deque<uint32_t> checksums;\n\n template <typename Describer>\n auto describe_type(Describer f) { return f(chunk_size, checksums); }\n};\n\n}\n\nnamespace std {\n\ntemplate <>\nstruct hash<sstables::metadata_type> : enum_hash<sstables::metadata_type> {};\n\n}\n\nnamespace sstables {\n\nstruct statistics {\n disk_hash<uint32_t, metadata_type, uint32_t> hash;\n std::unordered_map<metadata_type, std::unique_ptr<metadata>> contents;\n};\n\nstruct deletion_time {\n int32_t local_deletion_time;\n int64_t marked_for_delete_at;\n\n template <typename Describer>\n auto describe_type(Describer f) { return f(local_deletion_time, marked_for_delete_at); }\n\n bool live() const {\n return (local_deletion_time == std::numeric_limits<int32_t>::max()) &&\n (marked_for_delete_at == std::numeric_limits<int64_t>::min());\n }\n\n bool operator==(const deletion_time& d) {\n return local_deletion_time == d.local_deletion_time &&\n marked_for_delete_at == d.marked_for_delete_at;\n }\n bool operator!=(const deletion_time& d) {\n return !(*this == d);\n }\n explicit operator tombstone() {\n return !live() ? tombstone(marked_for_delete_at, gc_clock::time_point(gc_clock::duration(local_deletion_time))) : tombstone();\n }\n};\n\nenum class column_mask : uint8_t {\n none = 0x0,\n deletion = 0x01,\n expiration = 0x02,\n counter = 0x04,\n counter_update = 0x08,\n range_tombstone = 0x10,\n};\n\ninline column_mask operator&(column_mask m1, column_mask m2) {\n return column_mask(static_cast<uint8_t>(m1) & static_cast<uint8_t>(m2));\n}\n\ninline column_mask operator|(column_mask m1, column_mask m2) {\n return column_mask(static_cast<uint8_t>(m1) | static_cast<uint8_t>(m2));\n}\n}\n\n<|endoftext|>"} {"text":"<commit_before>#define BOOST_SPIRIT_NO_PREDEFINED_TERMINALS\n\/\/ #define BOOST_SPIRIT_QI_DEBUG\n\n#include <boost\/algorithm\/string.hpp>\n#include <boost\/foreach.hpp>\n#include <boost\/property_tree\/ptree.hpp>\n#include <boost\/property_tree\/xml_parser.hpp>\n#include <boost\/spirit\/include\/phoenix_function.hpp>\n#include <boost\/spirit\/include\/qi.hpp>\n#include <boost\/spirit\/include\/support_istream_iterator.hpp>\n#include <cassert>\n#include <sstream>\n\n#include \"formast.hpp\"\n\n\/\/ upgrade structs to fusion sequences\n\nBOOST_FUSION_ADAPT_STRUCT(\n formast::Attr,\n (std::string, class_name)\n (std::string, name)\n (boost::optional<formast::Doc>, doc)\n)\n\nBOOST_FUSION_ADAPT_STRUCT(\n formast::Class,\n (std::string, name)\n (boost::optional<std::string>, base_name)\n (boost::optional<formast::Doc>, doc)\n (boost::optional<formast::Stats>, stats)\n)\n\nBOOST_FUSION_ADAPT_STRUCT(\n formast::If,\n (formast::Expr, expr)\n (formast::Stats, stats)\n)\n\nBOOST_FUSION_ADAPT_STRUCT(\n formast::IfElifsElse,\n (std::vector<formast::If>, ifs_)\n (boost::optional<formast::Stats>, else_)\n)\n\n\/\/ a few shorthands\n\nnamespace qi = boost::spirit::qi;\nnamespace ascii = boost::spirit::ascii;\nnamespace ast = formast::detail::ast;\n\n\/\/ phoenix functions for constructing the abstract syntax tree with\n\/\/ semantic actions\n\ntemplate <typename T> \/\/ T is a terminal type, i.e. uint64_t or std::string\nstruct copy_func {\n template <typename T1, typename T2 = void>\n struct result {\n typedef void type;\n };\n\n void operator()(ast::Expr & left, ast::Expr const & right) const {\n assert(right != 0);\n left = right;\n }\n};\n\ntemplate <typename T> \/\/ T is a terminal type, i.e. uint64_t or std::string\nstruct assign_func {\n template <typename T1, typename T2 = void>\n struct result {\n typedef void type;\n };\n\n void operator()(ast::Expr & left, const T & right) const {\n left = ast::Expr(new ast::ExprNode(right));\n }\n};\n\ntemplate <char Op>\nstruct binary_func {\n template <typename T1, typename T2 = void>\n struct result {\n typedef void type;\n };\n\n void operator()(ast::Expr & left, ast::Expr const & right) const {\n assert(left != 0);\n assert(right != 0);\n left = ast::Expr(new ast::ExprNode(ast::binary_op(Op, left, right)));\n }\n};\n\ntemplate <char Op>\nstruct unary_func {\n template <typename T1, typename T2 = void>\n struct result {\n typedef void type;\n };\n\n void operator()(ast::Expr & left, ast::Expr & right) const {\n assert(right != 0);\n left = ast::Expr(new ast::ExprNode(ast::unary_op(Op, right)));\n }\n};\n\nboost::phoenix::function<binary_func<'+'> > const _add;\nboost::phoenix::function<binary_func<'-'> > const _sub;\nboost::phoenix::function<binary_func<'*'> > const _mul;\nboost::phoenix::function<binary_func<'\/'> > const _div;\nboost::phoenix::function<unary_func<'+'> > const _pos;\nboost::phoenix::function<unary_func<'-'> > const _neg;\nboost::phoenix::function<assign_func<boost::uint64_t> > const _uint;\nboost::phoenix::function<copy_func<boost::uint64_t> > const _copy;\n\n\/\/ error handler\n\nstruct error_handler_ {\n template <typename, typename, typename>\n struct result {\n typedef void type;\n };\n\n template <typename Iterator>\n void operator()(\n qi::info const& what, Iterator err_pos, Iterator last) const {\n std::cerr\n << \"Error! Expecting \"\n << what\n << \" here: \\\"\"\n << std::string(err_pos, last)\n << \"\\\"\"\n << std::endl\n ;\n }\n};\n\nboost::phoenix::function<error_handler_> const error_handler = error_handler_();\n\n\/\/ the actual grammar\n\ntemplate <typename Iterator>\nstruct expr_grammar : qi::grammar<Iterator, ast::Expr(), ascii::space_type> {\n\n expr_grammar() : expr_grammar::base_type(expr) {\n\n qi::char_type char_;\n qi::uint_type uint_;\n qi::_val_type _val;\n qi::_1_type _1;\n qi::_2_type _2;\n qi::_3_type _3;\n qi::_4_type _4;\n\n using qi::on_error;\n using qi::fail;\n\n expr =\n term [_copy(_val, _1)]\n >> *( ('+' > term [_add(_val, _1)])\n | ('-' > term [_sub(_val, _1)])\n )\n ;\n\n term =\n factor [_copy(_val, _1)]\n >> *( ('*' > factor [_mul(_val, _1)])\n | ('\/' > factor [_div(_val, _1)])\n )\n ;\n\n factor =\n uint_ [_uint(_val, _1)]\n | '(' > expr [_copy(_val, _1)] > ')'\n | ('-' > factor [_neg(_val, _1)])\n | ('+' > factor [_pos(_val, _1)])\n ;\n\n \/\/ Debugging and error handling and reporting support.\n BOOST_SPIRIT_DEBUG_NODE(expr);\n BOOST_SPIRIT_DEBUG_NODE(term);\n BOOST_SPIRIT_DEBUG_NODE(factor);\n\n \/\/ Error handling\n on_error<fail>(expr, error_handler(_4, _3, _2));\n}\n\nqi::rule<Iterator, ast::Expr(), ascii::space_type> expr, term, factor;\n};\n\n\/\/ helper function for parsing expression from stream\nvoid _expr_parse_stream(std::istream & is, ast::Expr & e)\n{\n \/\/ disable white space skipping\n is.unsetf(std::ios::skipws);\n typedef boost::spirit::istream_iterator iterator_type;\n iterator_type iter(is);\n iterator_type end;\n expr_grammar<iterator_type> grammar;\n ascii::space_type space;\n\n bool success = qi::phrase_parse(iter, end, grammar, space, e);\n if (!success) {\n throw std::runtime_error(\"Syntax error.\");\n }\n if (iter != end) {\n throw std::runtime_error(\"End of stream not reached.\");\n }\n}\n\n\/\/ helper function for parsing expression from string\nvoid _expr_parse_string(std::string const & s, ast::Expr & e)\n{\n std::istringstream is(s);\n _expr_parse_stream(is, e);\n}\n\nformast::Parser::Parser()\n{\n}\n\nvoid formast::Parser::parse_string(std::string const & s, ast::Top & top)\n{\n std::istringstream is(s);\n parse_stream(is, top);\n}\n\nformast::XmlParser::XmlParser()\n : Parser()\n{\n}\n\nvoid formast::XmlParser::parse_stream(std::istream & is, ast::Top & top)\n{\n \/\/ disable skipping of whitespace\n is.unsetf(std::ios::skipws);\n\n \/\/ read xml into property tree\n boost::property_tree::ptree pt;\n boost::property_tree::xml_parser::read_xml(is, pt);\n \/\/boost::property_tree::info_parser::write_info(std::cout, pt); \/\/ DEBUG\n\n BOOST_FOREACH(boost::property_tree::ptree::value_type & decl, pt.get_child(\"niftoolsxml\")) {\n if (decl.first == \"basic\") {\n Class class_;\n class_.name = decl.second.get<std::string>(\"<xmlattr>.name\");\n std::string doc = decl.second.data();\n boost::algorithm::trim(doc);\n if (!doc.empty()) {\n class_.doc = doc;\n }\n top.push_back(class_);\n } else if (decl.first == \"compound\" || decl.first == \"niobject\") {\n Class class_;\n class_.name = decl.second.get<std::string>(\"<xmlattr>.name\");\n std::string doc = decl.second.data();\n boost::algorithm::trim(doc);\n class_.doc = doc;\n if (!doc.empty()) {\n class_.doc = doc;\n }\n class_.base_name = decl.second.get_optional<std::string>(\"<xmlattr>.inherit\");\n ast::Stats stats;\n BOOST_FOREACH(boost::property_tree::ptree::value_type & add, decl.second) {\n if (add.first == \"add\") {\n Attr attr;\n attr.class_name = add.second.get<std::string>(\"<xmlattr>.type\");\n attr.name = add.second.get<std::string>(\"<xmlattr>.name\");\n std::string doc = add.second.data();\n boost::algorithm::trim(doc);\n if (!doc.empty()) {\n attr.doc = doc;\n }\n \/\/ conditioning disabled for now, can't parse it completely yet\n boost::optional<std::string> cond = add.second.get_optional<std::string>(\"<xmlattr>.cond\");\n if (!cond) {\n stats.push_back(attr);\n } else {\n formast::IfElifsElse ifelifselse;\n formast::If if_;\n _expr_parse_string(cond.get(), if_.expr);\n if_.stats.push_back(attr);\n ifelifselse.ifs_.push_back(if_);\n stats.push_back(ifelifselse);\n }\n };\n };\n if (!stats.empty()) {\n class_.stats = stats;\n };\n top.push_back(class_);\n };\n };\n}\n<commit_msg>Class doc bugfix.<commit_after>#define BOOST_SPIRIT_NO_PREDEFINED_TERMINALS\n\/\/ #define BOOST_SPIRIT_QI_DEBUG\n\n#include <boost\/algorithm\/string.hpp>\n#include <boost\/foreach.hpp>\n#include <boost\/property_tree\/ptree.hpp>\n#include <boost\/property_tree\/xml_parser.hpp>\n#include <boost\/spirit\/include\/phoenix_function.hpp>\n#include <boost\/spirit\/include\/qi.hpp>\n#include <boost\/spirit\/include\/support_istream_iterator.hpp>\n#include <cassert>\n#include <sstream>\n\n#include \"formast.hpp\"\n\n\/\/ upgrade structs to fusion sequences\n\nBOOST_FUSION_ADAPT_STRUCT(\n formast::Attr,\n (std::string, class_name)\n (std::string, name)\n (boost::optional<formast::Doc>, doc)\n)\n\nBOOST_FUSION_ADAPT_STRUCT(\n formast::Class,\n (std::string, name)\n (boost::optional<std::string>, base_name)\n (boost::optional<formast::Doc>, doc)\n (boost::optional<formast::Stats>, stats)\n)\n\nBOOST_FUSION_ADAPT_STRUCT(\n formast::If,\n (formast::Expr, expr)\n (formast::Stats, stats)\n)\n\nBOOST_FUSION_ADAPT_STRUCT(\n formast::IfElifsElse,\n (std::vector<formast::If>, ifs_)\n (boost::optional<formast::Stats>, else_)\n)\n\n\/\/ a few shorthands\n\nnamespace qi = boost::spirit::qi;\nnamespace ascii = boost::spirit::ascii;\nnamespace ast = formast::detail::ast;\n\n\/\/ phoenix functions for constructing the abstract syntax tree with\n\/\/ semantic actions\n\ntemplate <typename T> \/\/ T is a terminal type, i.e. uint64_t or std::string\nstruct copy_func {\n template <typename T1, typename T2 = void>\n struct result {\n typedef void type;\n };\n\n void operator()(ast::Expr & left, ast::Expr const & right) const {\n assert(right != 0);\n left = right;\n }\n};\n\ntemplate <typename T> \/\/ T is a terminal type, i.e. uint64_t or std::string\nstruct assign_func {\n template <typename T1, typename T2 = void>\n struct result {\n typedef void type;\n };\n\n void operator()(ast::Expr & left, const T & right) const {\n left = ast::Expr(new ast::ExprNode(right));\n }\n};\n\ntemplate <char Op>\nstruct binary_func {\n template <typename T1, typename T2 = void>\n struct result {\n typedef void type;\n };\n\n void operator()(ast::Expr & left, ast::Expr const & right) const {\n assert(left != 0);\n assert(right != 0);\n left = ast::Expr(new ast::ExprNode(ast::binary_op(Op, left, right)));\n }\n};\n\ntemplate <char Op>\nstruct unary_func {\n template <typename T1, typename T2 = void>\n struct result {\n typedef void type;\n };\n\n void operator()(ast::Expr & left, ast::Expr & right) const {\n assert(right != 0);\n left = ast::Expr(new ast::ExprNode(ast::unary_op(Op, right)));\n }\n};\n\nboost::phoenix::function<binary_func<'+'> > const _add;\nboost::phoenix::function<binary_func<'-'> > const _sub;\nboost::phoenix::function<binary_func<'*'> > const _mul;\nboost::phoenix::function<binary_func<'\/'> > const _div;\nboost::phoenix::function<unary_func<'+'> > const _pos;\nboost::phoenix::function<unary_func<'-'> > const _neg;\nboost::phoenix::function<assign_func<boost::uint64_t> > const _uint;\nboost::phoenix::function<copy_func<boost::uint64_t> > const _copy;\n\n\/\/ error handler\n\nstruct error_handler_ {\n template <typename, typename, typename>\n struct result {\n typedef void type;\n };\n\n template <typename Iterator>\n void operator()(\n qi::info const& what, Iterator err_pos, Iterator last) const {\n std::cerr\n << \"Error! Expecting \"\n << what\n << \" here: \\\"\"\n << std::string(err_pos, last)\n << \"\\\"\"\n << std::endl\n ;\n }\n};\n\nboost::phoenix::function<error_handler_> const error_handler = error_handler_();\n\n\/\/ the actual grammar\n\ntemplate <typename Iterator>\nstruct expr_grammar : qi::grammar<Iterator, ast::Expr(), ascii::space_type> {\n\n expr_grammar() : expr_grammar::base_type(expr) {\n\n qi::char_type char_;\n qi::uint_type uint_;\n qi::_val_type _val;\n qi::_1_type _1;\n qi::_2_type _2;\n qi::_3_type _3;\n qi::_4_type _4;\n\n using qi::on_error;\n using qi::fail;\n\n expr =\n term [_copy(_val, _1)]\n >> *( ('+' > term [_add(_val, _1)])\n | ('-' > term [_sub(_val, _1)])\n )\n ;\n\n term =\n factor [_copy(_val, _1)]\n >> *( ('*' > factor [_mul(_val, _1)])\n | ('\/' > factor [_div(_val, _1)])\n )\n ;\n\n factor =\n uint_ [_uint(_val, _1)]\n | '(' > expr [_copy(_val, _1)] > ')'\n | ('-' > factor [_neg(_val, _1)])\n | ('+' > factor [_pos(_val, _1)])\n ;\n\n \/\/ Debugging and error handling and reporting support.\n BOOST_SPIRIT_DEBUG_NODE(expr);\n BOOST_SPIRIT_DEBUG_NODE(term);\n BOOST_SPIRIT_DEBUG_NODE(factor);\n\n \/\/ Error handling\n on_error<fail>(expr, error_handler(_4, _3, _2));\n}\n\nqi::rule<Iterator, ast::Expr(), ascii::space_type> expr, term, factor;\n};\n\n\/\/ helper function for parsing expression from stream\nvoid _expr_parse_stream(std::istream & is, ast::Expr & e)\n{\n \/\/ disable white space skipping\n is.unsetf(std::ios::skipws);\n typedef boost::spirit::istream_iterator iterator_type;\n iterator_type iter(is);\n iterator_type end;\n expr_grammar<iterator_type> grammar;\n ascii::space_type space;\n\n bool success = qi::phrase_parse(iter, end, grammar, space, e);\n if (!success) {\n throw std::runtime_error(\"Syntax error.\");\n }\n if (iter != end) {\n throw std::runtime_error(\"End of stream not reached.\");\n }\n}\n\n\/\/ helper function for parsing expression from string\nvoid _expr_parse_string(std::string const & s, ast::Expr & e)\n{\n std::istringstream is(s);\n _expr_parse_stream(is, e);\n}\n\nformast::Parser::Parser()\n{\n}\n\nvoid formast::Parser::parse_string(std::string const & s, ast::Top & top)\n{\n std::istringstream is(s);\n parse_stream(is, top);\n}\n\nformast::XmlParser::XmlParser()\n : Parser()\n{\n}\n\nvoid formast::XmlParser::parse_stream(std::istream & is, ast::Top & top)\n{\n \/\/ disable skipping of whitespace\n is.unsetf(std::ios::skipws);\n\n \/\/ read xml into property tree\n boost::property_tree::ptree pt;\n boost::property_tree::xml_parser::read_xml(is, pt);\n \/\/boost::property_tree::info_parser::write_info(std::cout, pt); \/\/ DEBUG\n\n BOOST_FOREACH(boost::property_tree::ptree::value_type & decl, pt.get_child(\"niftoolsxml\")) {\n if (decl.first == \"basic\") {\n Class class_;\n class_.name = decl.second.get<std::string>(\"<xmlattr>.name\");\n std::string doc = decl.second.data();\n boost::algorithm::trim(doc);\n if (!doc.empty()) {\n class_.doc = doc;\n }\n top.push_back(class_);\n } else if (decl.first == \"compound\" || decl.first == \"niobject\") {\n Class class_;\n class_.name = decl.second.get<std::string>(\"<xmlattr>.name\");\n std::string doc = decl.second.data();\n boost::algorithm::trim(doc);\n if (!doc.empty()) {\n class_.doc = doc;\n }\n class_.base_name = decl.second.get_optional<std::string>(\"<xmlattr>.inherit\");\n ast::Stats stats;\n BOOST_FOREACH(boost::property_tree::ptree::value_type & add, decl.second) {\n if (add.first == \"add\") {\n Attr attr;\n attr.class_name = add.second.get<std::string>(\"<xmlattr>.type\");\n attr.name = add.second.get<std::string>(\"<xmlattr>.name\");\n std::string doc = add.second.data();\n boost::algorithm::trim(doc);\n if (!doc.empty()) {\n attr.doc = doc;\n }\n \/\/ conditioning disabled for now, can't parse it completely yet\n boost::optional<std::string> cond = add.second.get_optional<std::string>(\"<xmlattr>.cond\");\n if (!cond) {\n stats.push_back(attr);\n } else {\n formast::IfElifsElse ifelifselse;\n formast::If if_;\n _expr_parse_string(cond.get(), if_.expr);\n if_.stats.push_back(attr);\n ifelifselse.ifs_.push_back(if_);\n stats.push_back(ifelifselse);\n }\n };\n };\n if (!stats.empty()) {\n class_.stats = stats;\n };\n top.push_back(class_);\n };\n };\n}\n<|endoftext|>"} {"text":"<commit_before>#ifndef OBJECT_BUFFER_HPP\n#define OBJECT_BUFFER_HPP\n\n#include \"errors.hpp\"\n\ntemplate <class T>\nclass object_buffer_t {\npublic:\n\n \/\/ TODO: this object makes no guarantees that its parent still exists when it is destroyed\n \/\/ is that ok?\n class destruction_sentinel_t {\n public:\n explicit destruction_sentinel_t(object_buffer_t<T> *_parent) : parent(_parent) { }\n\n ~destruction_sentinel_t() {\n if (parent->has()) {\n parent->reset();\n }\n }\n private:\n object_buffer_t<T> *parent;\n };\n\n object_buffer_t() : instantiated(false) { };\n ~object_buffer_t() {\n if (instantiated) {\n reset();\n }\n };\n\n#define OBJECT_BUFFER_CREATE_INTERNAL(...) { rassert(!instantiated); instantiated = true; return new (&object_data[0]) T(__VA_ARGS__); }\n\n \/\/ 9 arguments ought to be enough for anybody\n T * create()\n { OBJECT_BUFFER_CREATE_INTERNAL(); }\n\n template <class arg1_t>\n T * create(arg1_t arg1)\n { OBJECT_BUFFER_CREATE_INTERNAL(arg1); }\n\n template <class arg1_t, class arg2_t>\n T * create(const arg1_t &arg1, const arg2_t &arg2)\n { OBJECT_BUFFER_CREATE_INTERNAL(arg1, arg2); }\n\n template <class arg1_t, class arg2_t, class arg3_t>\n T * create(const arg1_t &arg1, const arg2_t &arg2, const arg3_t &arg3)\n { OBJECT_BUFFER_CREATE_INTERNAL(arg1, arg2, arg3); }\n\n template <class arg1_t, class arg2_t, class arg3_t, class arg4_t>\n T * create(const arg1_t &arg1, const arg2_t &arg2, const arg3_t &arg3, const arg4_t &arg4)\n { OBJECT_BUFFER_CREATE_INTERNAL(arg1, arg2, arg3, arg4); }\n\n template <class arg1_t, class arg2_t, class arg3_t, class arg4_t, class arg5_t>\n T * create(const arg1_t &arg1, const arg2_t &arg2, const arg3_t &arg3, const arg4_t &arg4, const arg5_t &arg5)\n { OBJECT_BUFFER_CREATE_INTERNAL(arg1, arg2, arg3, arg4, arg5); }\n\n template <class arg1_t, class arg2_t, class arg3_t, class arg4_t, class arg5_t, class arg6_t>\n T * create(const arg1_t &arg1, const arg2_t &arg2, const arg3_t &arg3, const arg4_t &arg4, const arg5_t &arg5, const arg6_t &arg6)\n { OBJECT_BUFFER_CREATE_INTERNAL(arg1, arg2, arg3, arg4, arg5, arg6); }\n\n template <class arg1_t, class arg2_t, class arg3_t, class arg4_t, class arg5_t, class arg6_t, class arg7_t>\n T * create(const arg1_t &arg1, const arg2_t &arg2, const arg3_t &arg3, const arg4_t &arg4, const arg5_t &arg5, const arg6_t &arg6, const arg7_t &arg7)\n { OBJECT_BUFFER_CREATE_INTERNAL(arg1, arg2, arg3, arg4, arg5, arg6, arg7); }\n\n template <class arg1_t, class arg2_t, class arg3_t, class arg4_t, class arg5_t, class arg6_t, class arg7_t, class arg8_t>\n T * create(const arg1_t &arg1, const arg2_t &arg2, const arg3_t &arg3, const arg4_t &arg4, const arg5_t &arg5, const arg6_t &arg6, const arg7_t &arg7, const arg8_t &arg8)\n { OBJECT_BUFFER_CREATE_INTERNAL(arg1, arg2, arg3, arg4, arg5, arg6, arg7, arg8); }\n\n template <class arg1_t, class arg2_t, class arg3_t, class arg4_t, class arg5_t, class arg6_t, class arg7_t, class arg8_t, class arg9_t>\n T * create(const arg1_t &arg1, const arg2_t &arg2, const arg3_t &arg3, const arg4_t &arg4, const arg5_t &arg5, const arg6_t &arg6, const arg7_t &arg7, const arg8_t &arg8, const arg9_t &arg9)\n { OBJECT_BUFFER_CREATE_INTERNAL(arg1, arg2, arg3, arg4, arg5, arg6, arg7, arg8, arg9); }\n\n T * get() {\n rassert(instantiated);\n return reinterpret_cast<T *>(&object_data[0]);\n }\n\n const T * get() const {\n rassert(instantiated);\n return reinterpret_cast<const T *>(&object_data[0]);\n }\n\n void reset() {\n rassert(instantiated);\n get()->~T();\n instantiated = false;\n }\n\n bool has() const {\n return instantiated;\n }\n\nprivate:\n bool instantiated;\n uint8_t object_data[sizeof(T)];\n};\n\n#endif\n<commit_msg>replaced ad-hoc dynamic memory reduction in wait_any_t with object_buffer_t<commit_after>#ifndef OBJECT_BUFFER_HPP\n#define OBJECT_BUFFER_HPP\n\n#include \"errors.hpp\"\n\ntemplate <class T>\nclass object_buffer_t {\npublic:\n\n \/\/ TODO: this object makes no guarantees that its parent still exists when it is destroyed\n \/\/ is that ok?\n class destruction_sentinel_t {\n public:\n explicit destruction_sentinel_t(object_buffer_t<T> *_parent) : parent(_parent) { }\n\n ~destruction_sentinel_t() {\n if (parent->has()) {\n parent->reset();\n }\n }\n private:\n object_buffer_t<T> *parent;\n };\n\n object_buffer_t() : instantiated(false) { };\n ~object_buffer_t() {\n if (instantiated) {\n reset();\n }\n };\n\n#define OBJECT_BUFFER_CREATE_INTERNAL(...) { rassert(!instantiated); instantiated = true; return new (&object_data[0]) T(__VA_ARGS__); }\n\n \/\/ 9 arguments ought to be enough for anybody\n T * create()\n { OBJECT_BUFFER_CREATE_INTERNAL(); }\n\n template <class arg1_t>\n T * create(const arg1_t &arg1)\n { OBJECT_BUFFER_CREATE_INTERNAL(arg1); }\n\n template <class arg1_t, class arg2_t>\n T * create(const arg1_t &arg1, const arg2_t &arg2)\n { OBJECT_BUFFER_CREATE_INTERNAL(arg1, arg2); }\n\n template <class arg1_t, class arg2_t, class arg3_t>\n T * create(const arg1_t &arg1, const arg2_t &arg2, const arg3_t &arg3)\n { OBJECT_BUFFER_CREATE_INTERNAL(arg1, arg2, arg3); }\n\n template <class arg1_t, class arg2_t, class arg3_t, class arg4_t>\n T * create(const arg1_t &arg1, const arg2_t &arg2, const arg3_t &arg3, const arg4_t &arg4)\n { OBJECT_BUFFER_CREATE_INTERNAL(arg1, arg2, arg3, arg4); }\n\n template <class arg1_t, class arg2_t, class arg3_t, class arg4_t, class arg5_t>\n T * create(const arg1_t &arg1, const arg2_t &arg2, const arg3_t &arg3, const arg4_t &arg4, const arg5_t &arg5)\n { OBJECT_BUFFER_CREATE_INTERNAL(arg1, arg2, arg3, arg4, arg5); }\n\n template <class arg1_t, class arg2_t, class arg3_t, class arg4_t, class arg5_t, class arg6_t>\n T * create(const arg1_t &arg1, const arg2_t &arg2, const arg3_t &arg3, const arg4_t &arg4, const arg5_t &arg5, const arg6_t &arg6)\n { OBJECT_BUFFER_CREATE_INTERNAL(arg1, arg2, arg3, arg4, arg5, arg6); }\n\n template <class arg1_t, class arg2_t, class arg3_t, class arg4_t, class arg5_t, class arg6_t, class arg7_t>\n T * create(const arg1_t &arg1, const arg2_t &arg2, const arg3_t &arg3, const arg4_t &arg4, const arg5_t &arg5, const arg6_t &arg6, const arg7_t &arg7)\n { OBJECT_BUFFER_CREATE_INTERNAL(arg1, arg2, arg3, arg4, arg5, arg6, arg7); }\n\n template <class arg1_t, class arg2_t, class arg3_t, class arg4_t, class arg5_t, class arg6_t, class arg7_t, class arg8_t>\n T * create(const arg1_t &arg1, const arg2_t &arg2, const arg3_t &arg3, const arg4_t &arg4, const arg5_t &arg5, const arg6_t &arg6, const arg7_t &arg7, const arg8_t &arg8)\n { OBJECT_BUFFER_CREATE_INTERNAL(arg1, arg2, arg3, arg4, arg5, arg6, arg7, arg8); }\n\n template <class arg1_t, class arg2_t, class arg3_t, class arg4_t, class arg5_t, class arg6_t, class arg7_t, class arg8_t, class arg9_t>\n T * create(const arg1_t &arg1, const arg2_t &arg2, const arg3_t &arg3, const arg4_t &arg4, const arg5_t &arg5, const arg6_t &arg6, const arg7_t &arg7, const arg8_t &arg8, const arg9_t &arg9)\n { OBJECT_BUFFER_CREATE_INTERNAL(arg1, arg2, arg3, arg4, arg5, arg6, arg7, arg8, arg9); }\n\n T * get() {\n rassert(instantiated);\n return reinterpret_cast<T *>(&object_data[0]);\n }\n\n const T * get() const {\n rassert(instantiated);\n return reinterpret_cast<const T *>(&object_data[0]);\n }\n\n void reset() {\n rassert(instantiated);\n get()->~T();\n instantiated = false;\n }\n\n bool has() const {\n return instantiated;\n }\n\nprivate:\n bool instantiated;\n uint8_t object_data[sizeof(T)];\n};\n\n#endif\n<|endoftext|>"} {"text":"<commit_before>\/*\n * Copyright (c) 2019, The OpenThread Authors.\n * All rights reserved.\n *\n * Redistribution and use in source and binary forms, with or without\n * modification, are permitted provided that the following conditions are met:\n * 1. Redistributions of source code must retain the above copyright\n * notice, this list of conditions and the following disclaimer.\n * 2. Redistributions in binary form must reproduce the above copyright\n * notice, this list of conditions and the following disclaimer in the\n * documentation and\/or other materials provided with the distribution.\n * 3. Neither the name of the copyright holder nor the\n * names of its contributors may be used to endorse or promote products\n * derived from this software without specific prior written permission.\n *\n * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS \"AS IS\"\n * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE\n * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE\n * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE\n * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR\n * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF\n * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS\n * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN\n * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)\n * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE\n * POSSIBILITY OF SUCH DAMAGE.\n *\/\n\n\/**\n * @file\n * This file includes macros for static assert for C++03.\n *\/\n\n#ifndef OPENTHREAD_STATIC_ASSERT_HPP_\n#define OPENTHREAD_STATIC_ASSERT_HPP_\n\n#ifdef __cplusplus\n\nnamespace ot {\n\ntemplate <int> struct StaticAssertError;\ntemplate <> struct StaticAssertError<true>\n{\n StaticAssertError(...);\n};\n\n} \/\/ namespace ot\n\n#define __OT_STATIC_ASSERT_ERROR(aError, aLine) aError##aLine\n#define _OT_STATIC_ASSERT_ERROR(aLine) __OT_STATIC_ASSERT_ERROR(StaticAssertError, aLine)\n\n\/**\n * This macro does static assert.\n *\n * @param[in] aExpression An expression to assert.\n * @param[in] aMessage A message to describe what is wrong when @p aExpression is false.\n *\n *\/\n#define OT_STATIC_ASSERT(aExpression, aMessage) \\\n enum \\\n { \\\n _OT_STATIC_ASSERT_ERROR(__COUNTER__) = sizeof(ot::StaticAssertError<(aExpression) != 0>(aMessage)), \\\n }\n\n#endif \/\/ __cplusplus\n\n#endif \/\/ OPENTHREAD_STATIC_ASSERT_HPP_\n<commit_msg>[toolchain] define __COUNTER__ for keil compiler (#3545)<commit_after>\/*\n * Copyright (c) 2019, The OpenThread Authors.\n * All rights reserved.\n *\n * Redistribution and use in source and binary forms, with or without\n * modification, are permitted provided that the following conditions are met:\n * 1. Redistributions of source code must retain the above copyright\n * notice, this list of conditions and the following disclaimer.\n * 2. Redistributions in binary form must reproduce the above copyright\n * notice, this list of conditions and the following disclaimer in the\n * documentation and\/or other materials provided with the distribution.\n * 3. Neither the name of the copyright holder nor the\n * names of its contributors may be used to endorse or promote products\n * derived from this software without specific prior written permission.\n *\n * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS \"AS IS\"\n * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE\n * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE\n * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE\n * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR\n * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF\n * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS\n * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN\n * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)\n * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE\n * POSSIBILITY OF SUCH DAMAGE.\n *\/\n\n\/**\n * @file\n * This file includes macros for static assert for C++03.\n *\/\n\n#ifndef OPENTHREAD_STATIC_ASSERT_HPP_\n#define OPENTHREAD_STATIC_ASSERT_HPP_\n\n#ifdef __cplusplus\n\n\/**\n * Some compilers such as Keil MDK-ARM does not support __COUNTER__ macro.\n *\/\n#ifndef __COUNTER__\n#define __COUNTER__ __LINE__\n#endif\n\nnamespace ot {\n\ntemplate <int> struct StaticAssertError;\ntemplate <> struct StaticAssertError<true>\n{\n StaticAssertError(...);\n};\n\n} \/\/ namespace ot\n\n#define __OT_STATIC_ASSERT_ERROR(aError, aLine) aError##aLine\n#define _OT_STATIC_ASSERT_ERROR(aLine) __OT_STATIC_ASSERT_ERROR(StaticAssertError, aLine)\n\n\/**\n * This macro does static assert.\n *\n * @param[in] aExpression An expression to assert.\n * @param[in] aMessage A message to describe what is wrong when @p aExpression is false.\n *\n *\/\n#define OT_STATIC_ASSERT(aExpression, aMessage) \\\n enum \\\n { \\\n _OT_STATIC_ASSERT_ERROR(__COUNTER__) = sizeof(ot::StaticAssertError<(aExpression) != 0>(aMessage)), \\\n }\n\n#endif \/\/ __cplusplus\n\n#endif \/\/ OPENTHREAD_STATIC_ASSERT_HPP_\n<|endoftext|>"} {"text":"<commit_before>\/*\n * DesktopUtils.cpp\n *\n * Copyright (C) 2009-18 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 \"DesktopUtils.hpp\"\n\n#include <set>\n\n#include <QPushButton>\n#include <QTimer>\n#include <QDesktopServices>\n\n#include <core\/FileSerializer.hpp>\n#include <core\/system\/Environment.hpp>\n\n#include \"DesktopOptions.hpp\"\n#include \"DesktopMainWindow.hpp\"\n\n#ifdef Q_OS_WIN\n#include <windows.h>\n#endif\n\nusing namespace rstudio::core;\n\nnamespace rstudio {\nnamespace desktop {\n\nQFontDatabase& fontDatabase()\n{\n static QFontDatabase instance;\n return instance;\n}\n\n#ifdef Q_OS_WIN\n\nvoid reattachConsoleIfNecessary()\n{\n if (::AttachConsole(ATTACH_PARENT_PROCESS))\n {\n freopen(\"CONOUT$\",\"wb\",stdout);\n freopen(\"CONOUT$\",\"wb\",stderr);\n freopen(\"CONIN$\",\"rb\",stdin);\n std::ios::sync_with_stdio();\n }\n}\n\n#else\n\nvoid reattachConsoleIfNecessary()\n{\n\n}\n\n#endif\n\n\/\/ NOTE: this code is duplicated in diagnostics as well (and also in\n\/\/ SessionOptions.hpp although the code path isn't exactly the same)\nFilePath userLogPath()\n{\n FilePath userHomePath = core::system::userHomePath(\"R_USER|HOME\");\n FilePath logPath = core::system::userSettingsPath(\n userHomePath,\n \"RStudio-Desktop\").childPath(\"log\");\n return logPath;\n}\n\nbool isWindows()\n{\n#ifdef Q_OS_WIN\n return true;\n#else\n return false;\n#endif\n}\n\n#ifndef Q_OS_MAC\ndouble devicePixelRatio(QMainWindow* pMainWindow)\n{\n return 1.0;\n}\n\nbool isOSXMavericks()\n{\n return false;\n}\n\n\/\/ NOTE: also RHEL\nbool isCentOS()\n{\n FilePath redhatRelease(\"\/etc\/redhat-release\");\n if (!redhatRelease.exists())\n return false;\n\n std::string contents;\n Error error = readStringFromFile(redhatRelease, &contents);\n if (error)\n return false;\n\n return contents.find(\"CentOS\") != std::string::npos ||\n contents.find(\"Red Hat Enterprise Linux\") != std::string::npos;\n}\n\n#endif\n\nbool isGnomeDesktop()\n{\n return core::system::getenv(\"DESKTOP_SESSION\") == \"gnome\";\n}\n\n#ifndef Q_OS_MAC\n\nQString getFixedWidthFontList()\n{\n QFontDatabase& db = desktop::fontDatabase();\n QStringList fonts;\n for (const QString& family : db.families())\n {\n \n#ifdef _WIN32\n \/\/ screen out annoying Qt warnings when attempting to\n \/\/ initialize incompatible fonts\n static std::set<std::string> blacklist = {\n \"Fixedsys\",\n \"Modern\",\n \"MS Sans Serif\",\n \"MS Serif\",\n \"Roman\",\n \"Script\",\n \"Small Fonts\",\n \"System\",\n \"Terminal\"\n };\n\n if (blacklist.count(family.toStdString()))\n continue;\n#endif\n\n if (isFixedWidthFont(QFont(family, 12)))\n fonts.append(family);\n }\n return fonts.join(QStringLiteral(\"\\n\"));\n}\n\n#endif\n\nvoid applyDesktopTheme(QWidget* window, bool isDark)\n{\n#ifndef Q_OS_MAC\n std::string lightSheetName = isWindows()\n ? \"rstudio-windows-light.qss\"\n : \"rstudio-gnome-light.qss\";\n\n std::string darkSheetName = isWindows()\n ? \"rstudio-windows-dark.qss\"\n : \"rstudio-gnome-dark.qss\";\n\n FilePath stylePath = isDark\n ? options().resourcesPath().complete(\"stylesheets\").complete(darkSheetName)\n : options().resourcesPath().complete(\"stylesheets\").complete(lightSheetName);\n\n std::string stylesheet;\n Error error = core::readStringFromFile(stylePath, &stylesheet);\n if (error)\n LOG_ERROR(error);\n\n window->setStyleSheet(QString::fromStdString(stylesheet));\n#endif\n}\n\n#ifndef Q_OS_MAC\n\nvoid enableFullscreenMode(QMainWindow* pMainWindow, bool primary)\n{\n\n}\n\nvoid toggleFullscreenMode(QMainWindow* pMainWindow)\n{\n\n}\n\nbool supportsFullscreenMode(QMainWindow* pMainWindow)\n{\n return false;\n}\n\nvoid initializeLang()\n{\n}\n\nvoid finalPlatformInitialize(MainWindow* pMainWindow)\n{\n\n}\n\n#endif\n\nvoid raiseAndActivateWindow(QWidget* pWindow)\n{\n \/\/ WId wid = pWindow->effectiveWinId(); -- gets X11 window id\n \/\/ gtk_window_present_with_time(GTK_WINDOW, timestamp)\n\n if (pWindow->isMinimized())\n {\n pWindow->setWindowState(\n pWindow->windowState() & ~Qt::WindowMinimized);\n }\n\n pWindow->raise();\n pWindow->activateWindow();\n}\n\nvoid moveWindowBeneath(QWidget* pTop, QWidget* pBottom)\n{\n#ifdef WIN32\n HWND hwndTop = reinterpret_cast<HWND>(pTop->winId());\n HWND hwndBottom = reinterpret_cast<HWND>(pBottom->winId());\n ::SetWindowPos(hwndBottom, hwndTop, 0, 0, 0, 0,\n SWP_NOMOVE | SWP_NOSIZE | SWP_NOACTIVATE);\n#endif\n \/\/ not currently supported on Linux--Qt doesn't provide a way to view or\n \/\/ change the window stacking order\n}\n\nvoid closeWindow(QWidget* pWindow)\n{\n pWindow->close();\n}\n\nQMessageBox::Icon safeMessageBoxIcon(QMessageBox::Icon icon)\n{\n \/\/ if a gtk theme has a missing or corrupt icon for one of the stock\n \/\/ dialog images, qt crashes when attempting to show the dialog\n#ifdef Q_OS_LINUX\n return QMessageBox::NoIcon;\n#else\n return icon;\n#endif\n}\n\nbool showYesNoDialog(QMessageBox::Icon icon,\n QWidget *parent,\n const QString &title,\n const QString& text,\n const QString& informativeText,\n bool yesDefault)\n{\n \/\/ basic message box attributes\n QMessageBox messageBox(parent);\n messageBox.setIcon(safeMessageBoxIcon(icon));\n messageBox.setWindowTitle(title);\n messageBox.setText(text);\n if (informativeText.length() > 0)\n messageBox.setInformativeText(informativeText);\n messageBox.setWindowModality(Qt::WindowModal);\n messageBox.setWindowFlag(Qt::WindowContextHelpButtonHint, false);\n\n \/\/ initialize buttons\n QPushButton* pYes = messageBox.addButton(QMessageBox::Yes);\n QPushButton* pNo = messageBox.addButton(QMessageBox::No);\n if (yesDefault)\n messageBox.setDefaultButton(pYes);\n else\n messageBox.setDefaultButton(pNo);\n\n \/\/ show the dialog modally\n messageBox.exec();\n\n \/\/ return true if the user clicked yes\n return messageBox.clickedButton() == pYes;\n}\n\nvoid showMessageBox(QMessageBox::Icon icon,\n QWidget *parent,\n const QString &title,\n const QString& text,\n const QString& informativeText)\n{\n QMessageBox messageBox(parent);\n messageBox.setIcon(safeMessageBoxIcon(icon));\n messageBox.setWindowTitle(title);\n messageBox.setText(text);\n if (informativeText.length() > 0)\n messageBox.setInformativeText(informativeText);\n messageBox.setWindowModality(Qt::WindowModal);\n messageBox.setWindowFlag(Qt::WindowContextHelpButtonHint, false);\n messageBox.addButton(new QPushButton(QString::fromUtf8(\"OK\")), QMessageBox::AcceptRole);\n messageBox.exec();\n}\n\nvoid showError(QWidget *parent,\n const QString &title,\n const QString& text,\n const QString& informativeText)\n{\n showMessageBox(QMessageBox::Critical, parent, title, text, informativeText);\n}\n\nvoid showWarning(QWidget *parent,\n const QString &title,\n const QString& text,\n const QString& informativeText)\n{\n showMessageBox(QMessageBox::Warning, parent, title, text, informativeText);\n}\n\nvoid showInfo(QWidget* parent,\n const QString& title,\n const QString& text,\n const QString& informativeText)\n{\n showMessageBox(QMessageBox::Information, parent, title, text, informativeText);\n}\n\nvoid showFileError(const QString& action,\n const QString& file,\n const QString& error)\n{\n QString msg = QString::fromUtf8(\"Error \") + action +\n QString::fromUtf8(\" \") + file +\n QString::fromUtf8(\" - \") + error;\n showMessageBox(QMessageBox::Critical,\n nullptr,\n QString::fromUtf8(\"File Error\"),\n msg,\n QString());\n}\n\nbool isFixedWidthFont(const QFont& font)\n{\n QFontMetrics metrics(font);\n int width = metrics.width(QChar::fromLatin1(' '));\n char chars[] = {'m', 'i', 'A', '\/', '-', '1', 'l', '!', 'x', 'X', 'y', 'Y'};\n for (char i : chars)\n {\n if (metrics.width(QChar::fromLatin1(i)) != width)\n return false;\n }\n return true;\n}\n\nint getDpi()\n{\n \/\/ TODO: we may need to tweak this to ensure that the DPI\n \/\/ discovered respects the screen a particular instance\n \/\/ that RStudio lives on (e.g. for users with multiple\n \/\/ displays with different DPIs)\n return (int) qApp->primaryScreen()->logicalDotsPerInch();\n}\n\ndouble getDpiZoomScaling()\n{\n \/\/ TODO: because Qt is already high-DPI aware and automatically\n \/\/ scales in most scenarios, we no longer need to detect and\n \/\/ apply a custom scale -- but more testing is warranted\n return 1.0;\n}\n\n#ifdef _WIN32\n\nvoid openFile(const QString& file)\n{\n return openUrl(QUrl::fromLocalFile(file));\n}\n\n\/\/ on Win32 open urls using our special urlopener.exe -- this is\n\/\/ so that the shell exec is made out from under our windows \"job\"\nvoid openUrl(const QUrl& url)\n{\n \/\/ we allow default handling for mailto and file schemes because qt\n \/\/ does custom handling for them and they aren't affected by the chrome\n \/\/job object issue noted above\n if (url.scheme() == QString::fromUtf8(\"mailto\") ||\n url.scheme() == QString::fromUtf8(\"file\"))\n {\n QDesktopServices::openUrl(url);\n }\n else\n {\n core::system::ProcessOptions options;\n options.breakawayFromJob = true;\n options.detachProcess = true;\n\n std::vector<std::string> args;\n args.push_back(url.toString().toStdString());\n\n core::system::ProcessResult result;\n Error error = core::system::runProgram(\n desktop::options().urlopenerPath().absolutePath(),\n args,\n \"\",\n options,\n &result);\n\n if (error)\n LOG_ERROR(error);\n else if (result.exitStatus != EXIT_SUCCESS)\n LOG_ERROR_MESSAGE(result.stdErr);\n }\n}\n\n\/\/ Qt 4.8.3 on Win7 (32-bit) has problems with opening the ~ directory\n\/\/ (it attempts to navigate to the \"Documents library\" and then hangs)\n\/\/ So we use the Qt file dialog implementations when we are running\n\/\/ on Win32\nQFileDialog::Options standardFileDialogOptions()\n{\n return 0;\n}\n\n#else\n\nvoid openFile(const QString& file)\n{\n QDesktopServices::openUrl(QUrl::fromLocalFile(file));\n}\n\nvoid openUrl(const QUrl& url)\n{\n QDesktopServices::openUrl(url);\n}\n\nQFileDialog::Options standardFileDialogOptions()\n{\n return nullptr;\n}\n\n#endif\n\n} \/\/ namespace desktop\n} \/\/ namespace rstudio\n<commit_msg>augment GNOME checks (was mis-detecting Ubuntu 18.04.1)<commit_after>\/*\n * DesktopUtils.cpp\n *\n * Copyright (C) 2009-18 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 \"DesktopUtils.hpp\"\n\n#include <set>\n\n#include <QPushButton>\n#include <QTimer>\n#include <QDesktopServices>\n\n#include <core\/FileSerializer.hpp>\n#include <core\/system\/Environment.hpp>\n\n#include \"DesktopOptions.hpp\"\n#include \"DesktopMainWindow.hpp\"\n\n#ifdef Q_OS_WIN\n#include <windows.h>\n#endif\n\nusing namespace rstudio::core;\n\nnamespace rstudio {\nnamespace desktop {\n\nQFontDatabase& fontDatabase()\n{\n static QFontDatabase instance;\n return instance;\n}\n\n#ifdef Q_OS_WIN\n\nvoid reattachConsoleIfNecessary()\n{\n if (::AttachConsole(ATTACH_PARENT_PROCESS))\n {\n freopen(\"CONOUT$\",\"wb\",stdout);\n freopen(\"CONOUT$\",\"wb\",stderr);\n freopen(\"CONIN$\",\"rb\",stdin);\n std::ios::sync_with_stdio();\n }\n}\n\n#else\n\nvoid reattachConsoleIfNecessary()\n{\n\n}\n\n#endif\n\n\/\/ NOTE: this code is duplicated in diagnostics as well (and also in\n\/\/ SessionOptions.hpp although the code path isn't exactly the same)\nFilePath userLogPath()\n{\n FilePath userHomePath = core::system::userHomePath(\"R_USER|HOME\");\n FilePath logPath = core::system::userSettingsPath(\n userHomePath,\n \"RStudio-Desktop\").childPath(\"log\");\n return logPath;\n}\n\nbool isWindows()\n{\n#ifdef Q_OS_WIN\n return true;\n#else\n return false;\n#endif\n}\n\n#ifndef Q_OS_MAC\ndouble devicePixelRatio(QMainWindow* pMainWindow)\n{\n return 1.0;\n}\n\nbool isOSXMavericks()\n{\n return false;\n}\n\n\/\/ NOTE: also RHEL\nbool isCentOS()\n{\n FilePath redhatRelease(\"\/etc\/redhat-release\");\n if (!redhatRelease.exists())\n return false;\n\n std::string contents;\n Error error = readStringFromFile(redhatRelease, &contents);\n if (error)\n return false;\n\n return contents.find(\"CentOS\") != std::string::npos ||\n contents.find(\"Red Hat Enterprise Linux\") != std::string::npos;\n}\n\n#endif\n\nbool isGnomeDesktop()\n{\n if (core::system::getenv(\"DESKTOP_SESSION\") == \"gnome\")\n return true;\n\n std::string desktop = core::system::getenv(\"XDG_CURRENT_DESKTOP\");\n if (desktop.find(\"GNOME\") != std::string::npos)\n return true;\n\n return false;\n}\n\n#ifndef Q_OS_MAC\n\nQString getFixedWidthFontList()\n{\n QFontDatabase& db = desktop::fontDatabase();\n QStringList fonts;\n for (const QString& family : db.families())\n {\n \n#ifdef _WIN32\n \/\/ screen out annoying Qt warnings when attempting to\n \/\/ initialize incompatible fonts\n static std::set<std::string> blacklist = {\n \"Fixedsys\",\n \"Modern\",\n \"MS Sans Serif\",\n \"MS Serif\",\n \"Roman\",\n \"Script\",\n \"Small Fonts\",\n \"System\",\n \"Terminal\"\n };\n\n if (blacklist.count(family.toStdString()))\n continue;\n#endif\n\n if (isFixedWidthFont(QFont(family, 12)))\n fonts.append(family);\n }\n return fonts.join(QStringLiteral(\"\\n\"));\n}\n\n#endif\n\nvoid applyDesktopTheme(QWidget* window, bool isDark)\n{\n#ifndef Q_OS_MAC\n std::string lightSheetName = isWindows()\n ? \"rstudio-windows-light.qss\"\n : \"rstudio-gnome-light.qss\";\n\n std::string darkSheetName = isWindows()\n ? \"rstudio-windows-dark.qss\"\n : \"rstudio-gnome-dark.qss\";\n\n FilePath stylePath = isDark\n ? options().resourcesPath().complete(\"stylesheets\").complete(darkSheetName)\n : options().resourcesPath().complete(\"stylesheets\").complete(lightSheetName);\n\n std::string stylesheet;\n Error error = core::readStringFromFile(stylePath, &stylesheet);\n if (error)\n LOG_ERROR(error);\n\n window->setStyleSheet(QString::fromStdString(stylesheet));\n#endif\n}\n\n#ifndef Q_OS_MAC\n\nvoid enableFullscreenMode(QMainWindow* pMainWindow, bool primary)\n{\n\n}\n\nvoid toggleFullscreenMode(QMainWindow* pMainWindow)\n{\n\n}\n\nbool supportsFullscreenMode(QMainWindow* pMainWindow)\n{\n return false;\n}\n\nvoid initializeLang()\n{\n}\n\nvoid finalPlatformInitialize(MainWindow* pMainWindow)\n{\n\n}\n\n#endif\n\nvoid raiseAndActivateWindow(QWidget* pWindow)\n{\n \/\/ WId wid = pWindow->effectiveWinId(); -- gets X11 window id\n \/\/ gtk_window_present_with_time(GTK_WINDOW, timestamp)\n\n if (pWindow->isMinimized())\n {\n pWindow->setWindowState(\n pWindow->windowState() & ~Qt::WindowMinimized);\n }\n\n pWindow->raise();\n pWindow->activateWindow();\n}\n\nvoid moveWindowBeneath(QWidget* pTop, QWidget* pBottom)\n{\n#ifdef WIN32\n HWND hwndTop = reinterpret_cast<HWND>(pTop->winId());\n HWND hwndBottom = reinterpret_cast<HWND>(pBottom->winId());\n ::SetWindowPos(hwndBottom, hwndTop, 0, 0, 0, 0,\n SWP_NOMOVE | SWP_NOSIZE | SWP_NOACTIVATE);\n#endif\n \/\/ not currently supported on Linux--Qt doesn't provide a way to view or\n \/\/ change the window stacking order\n}\n\nvoid closeWindow(QWidget* pWindow)\n{\n pWindow->close();\n}\n\nQMessageBox::Icon safeMessageBoxIcon(QMessageBox::Icon icon)\n{\n \/\/ if a gtk theme has a missing or corrupt icon for one of the stock\n \/\/ dialog images, qt crashes when attempting to show the dialog\n#ifdef Q_OS_LINUX\n return QMessageBox::NoIcon;\n#else\n return icon;\n#endif\n}\n\nbool showYesNoDialog(QMessageBox::Icon icon,\n QWidget *parent,\n const QString &title,\n const QString& text,\n const QString& informativeText,\n bool yesDefault)\n{\n \/\/ basic message box attributes\n QMessageBox messageBox(parent);\n messageBox.setIcon(safeMessageBoxIcon(icon));\n messageBox.setWindowTitle(title);\n messageBox.setText(text);\n if (informativeText.length() > 0)\n messageBox.setInformativeText(informativeText);\n messageBox.setWindowModality(Qt::WindowModal);\n messageBox.setWindowFlag(Qt::WindowContextHelpButtonHint, false);\n\n \/\/ initialize buttons\n QPushButton* pYes = messageBox.addButton(QMessageBox::Yes);\n QPushButton* pNo = messageBox.addButton(QMessageBox::No);\n if (yesDefault)\n messageBox.setDefaultButton(pYes);\n else\n messageBox.setDefaultButton(pNo);\n\n \/\/ show the dialog modally\n messageBox.exec();\n\n \/\/ return true if the user clicked yes\n return messageBox.clickedButton() == pYes;\n}\n\nvoid showMessageBox(QMessageBox::Icon icon,\n QWidget *parent,\n const QString &title,\n const QString& text,\n const QString& informativeText)\n{\n QMessageBox messageBox(parent);\n messageBox.setIcon(safeMessageBoxIcon(icon));\n messageBox.setWindowTitle(title);\n messageBox.setText(text);\n if (informativeText.length() > 0)\n messageBox.setInformativeText(informativeText);\n messageBox.setWindowModality(Qt::WindowModal);\n messageBox.setWindowFlag(Qt::WindowContextHelpButtonHint, false);\n messageBox.addButton(new QPushButton(QString::fromUtf8(\"OK\")), QMessageBox::AcceptRole);\n messageBox.exec();\n}\n\nvoid showError(QWidget *parent,\n const QString &title,\n const QString& text,\n const QString& informativeText)\n{\n showMessageBox(QMessageBox::Critical, parent, title, text, informativeText);\n}\n\nvoid showWarning(QWidget *parent,\n const QString &title,\n const QString& text,\n const QString& informativeText)\n{\n showMessageBox(QMessageBox::Warning, parent, title, text, informativeText);\n}\n\nvoid showInfo(QWidget* parent,\n const QString& title,\n const QString& text,\n const QString& informativeText)\n{\n showMessageBox(QMessageBox::Information, parent, title, text, informativeText);\n}\n\nvoid showFileError(const QString& action,\n const QString& file,\n const QString& error)\n{\n QString msg = QString::fromUtf8(\"Error \") + action +\n QString::fromUtf8(\" \") + file +\n QString::fromUtf8(\" - \") + error;\n showMessageBox(QMessageBox::Critical,\n nullptr,\n QString::fromUtf8(\"File Error\"),\n msg,\n QString());\n}\n\nbool isFixedWidthFont(const QFont& font)\n{\n QFontMetrics metrics(font);\n int width = metrics.width(QChar::fromLatin1(' '));\n char chars[] = {'m', 'i', 'A', '\/', '-', '1', 'l', '!', 'x', 'X', 'y', 'Y'};\n for (char i : chars)\n {\n if (metrics.width(QChar::fromLatin1(i)) != width)\n return false;\n }\n return true;\n}\n\nint getDpi()\n{\n \/\/ TODO: we may need to tweak this to ensure that the DPI\n \/\/ discovered respects the screen a particular instance\n \/\/ that RStudio lives on (e.g. for users with multiple\n \/\/ displays with different DPIs)\n return (int) qApp->primaryScreen()->logicalDotsPerInch();\n}\n\ndouble getDpiZoomScaling()\n{\n \/\/ TODO: because Qt is already high-DPI aware and automatically\n \/\/ scales in most scenarios, we no longer need to detect and\n \/\/ apply a custom scale -- but more testing is warranted\n return 1.0;\n}\n\n#ifdef _WIN32\n\nvoid openFile(const QString& file)\n{\n return openUrl(QUrl::fromLocalFile(file));\n}\n\n\/\/ on Win32 open urls using our special urlopener.exe -- this is\n\/\/ so that the shell exec is made out from under our windows \"job\"\nvoid openUrl(const QUrl& url)\n{\n \/\/ we allow default handling for mailto and file schemes because qt\n \/\/ does custom handling for them and they aren't affected by the chrome\n \/\/job object issue noted above\n if (url.scheme() == QString::fromUtf8(\"mailto\") ||\n url.scheme() == QString::fromUtf8(\"file\"))\n {\n QDesktopServices::openUrl(url);\n }\n else\n {\n core::system::ProcessOptions options;\n options.breakawayFromJob = true;\n options.detachProcess = true;\n\n std::vector<std::string> args;\n args.push_back(url.toString().toStdString());\n\n core::system::ProcessResult result;\n Error error = core::system::runProgram(\n desktop::options().urlopenerPath().absolutePath(),\n args,\n \"\",\n options,\n &result);\n\n if (error)\n LOG_ERROR(error);\n else if (result.exitStatus != EXIT_SUCCESS)\n LOG_ERROR_MESSAGE(result.stdErr);\n }\n}\n\n\/\/ Qt 4.8.3 on Win7 (32-bit) has problems with opening the ~ directory\n\/\/ (it attempts to navigate to the \"Documents library\" and then hangs)\n\/\/ So we use the Qt file dialog implementations when we are running\n\/\/ on Win32\nQFileDialog::Options standardFileDialogOptions()\n{\n return 0;\n}\n\n#else\n\nvoid openFile(const QString& file)\n{\n QDesktopServices::openUrl(QUrl::fromLocalFile(file));\n}\n\nvoid openUrl(const QUrl& url)\n{\n QDesktopServices::openUrl(url);\n}\n\nQFileDialog::Options standardFileDialogOptions()\n{\n return nullptr;\n}\n\n#endif\n\n} \/\/ namespace desktop\n} \/\/ namespace rstudio\n<|endoftext|>"} {"text":"<commit_before>\/*\n * ServerPAMAuth.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#include \"ServerPAMAuth.hpp\"\n\n\n#include <core\/Error.hpp>\n#include <core\/PeriodicCommand.hpp>\n#include <core\/system\/Process.hpp>\n#include <core\/system\/Crypto.hpp>\n#include <core\/system\/PosixSystem.hpp>\n\n#include <core\/http\/Request.hpp>\n#include <core\/http\/Response.hpp>\n#include <core\/http\/URL.hpp>\n#include <core\/http\/AsyncUriHandler.hpp>\n#include <core\/text\/TemplateFilter.hpp>\n\n#include <monitor\/MonitorClient.hpp>\n\n#include <server\/auth\/ServerValidateUser.hpp>\n#include <server\/auth\/ServerSecureUriHandler.hpp>\n#include <server\/auth\/ServerAuthHandler.hpp>\n#include <server\/auth\/ServerSecureCookie.hpp>\n\n#include <server\/ServerOptions.hpp>\n#include <server\/ServerUriHandlers.hpp>\n\n#include \"ServerSessionProxy.hpp\"\n\nnamespace server {\nnamespace pam_auth {\n\nnamespace {\n\nvoid assumeRootPriv()\n{\n \/\/ RedHat 5 returns PAM_SYSTEM_ERR from pam_authenticate if we're\n \/\/ running with geteuid != getuid (as is the case when we temporarily\n \/\/ drop privileges). We've also seen kerberos on Ubuntu require\n \/\/ priv to work correctly -- so, restore privilliges in the child\n if (core::system::realUserIsRoot())\n {\n Error error = core::system::restorePriv();\n if (error)\n {\n LOG_ERROR(error);\n \/\/ intentionally fail forward (see note above)\n }\n }\n}\n\nbool pamLogin(const std::string& username, const std::string& password)\n{\n \/\/ get path to pam helper\n FilePath pamHelperPath(server::options().authPamHelperPath());\n if (!pamHelperPath.exists())\n {\n LOG_ERROR_MESSAGE(\"PAM helper binary does not exist at \" +\n pamHelperPath.absolutePath());\n return false;\n }\n\n \/\/ form args\n std::vector<std::string> args;\n args.push_back(username);\n\n \/\/ options (assume priv after fork)\n core::system::ProcessOptions options;\n options.onAfterFork = assumeRootPriv;\n\n \/\/ run pam helper\n core::system::ProcessResult result;\n Error error = core::system::runProgram(pamHelperPath.absolutePath(),\n args,\n password,\n options,\n &result);\n if (error)\n {\n LOG_ERROR(error);\n return false;\n }\n\n \/\/ check for success\n return result.exitStatus == 0;\n}\n\n\n\nconst char * const kUserId = \"user-id\";\n\n\/\/ It's important that URIs be in the root directory, so the cookie\n\/\/ gets set\/unset at the correct scope!\nconst char * const kDoSignIn = \"\/auth-do-sign-in\";\nconst char * const kPublicKey = \"\/auth-public-key\";\n\nconst char * const kAppUri = \"appUri\";\n\nconst char * const kErrorParam = \"error\";\nconst char * const kErrorDisplay = \"errorDisplay\";\nconst char * const kErrorMessage = \"errorMessage\";\n\n\nstd::string applicationURL(const http::Request& request,\n const std::string& path = std::string())\n{\n return http::URL::uncomplete(\n request.uri(),\n path);\n}\n\nstd::string applicationSignInURL(const http::Request& request,\n const std::string& appUri,\n const std::string& errorMessage=std::string())\n{\n \/\/ build fields\n http::Fields fields ;\n if (appUri != \"\/\")\n fields.push_back(std::make_pair(kAppUri, appUri));\n if (!errorMessage.empty())\n fields.push_back(std::make_pair(kErrorParam, errorMessage));\n\n \/\/ build query string\n std::string queryString ;\n if (!fields.empty())\n http::util::buildQueryString(fields, &queryString);\n\n \/\/ generate url\n std::string signInURL = applicationURL(request, auth::handler::kSignIn);\n if (!queryString.empty())\n signInURL += (\"?\" + queryString);\n return signInURL;\n}\n\nstd::string getUserIdentifier(const core::http::Request& request)\n{\n return auth::secure_cookie::readSecureCookie(request, kUserId);\n}\n\nstd::string userIdentifierToLocalUsername(const std::string& userIdentifier)\n{\n return userIdentifier;\n}\n\nbool mainPageFilter(const http::Request& request,\n http::Response* pResponse)\n{\n \/\/ check for user identity, if we have one then allow the request to proceed\n std::string userIdentifier = getUserIdentifier(request);\n if (userIdentifier.empty())\n {\n \/\/ otherwise redirect to sign-in\n pResponse->setMovedTemporarily(request, applicationSignInURL(request, request.uri()));\n return false;\n }\n else\n {\n return true;\n }\n}\n\nvoid signInThenContinue(const core::http::Request& request,\n core::http::Response* pResponse)\n{\n pResponse->setMovedTemporarily(request, applicationSignInURL(request, request.uri()));\n}\n\nvoid refreshCredentialsThenContinue(\n boost::shared_ptr<core::http::AsyncConnection> pConnection)\n{\n \/\/ no silent refresh possible so delegate to sign-in and continue\n signInThenContinue(pConnection->request(),\n &(pConnection->response()));\n\n \/\/ write response\n pConnection->writeResponse();\n}\n\nvoid signIn(const http::Request& request,\n http::Response* pResponse)\n{\n auth::secure_cookie::remove(request, kUserId, \"\", pResponse);\n\n std::map<std::string,std::string> variables;\n variables[\"action\"] = applicationURL(request, kDoSignIn);\n variables[\"publicKeyUrl\"] = applicationURL(request, kPublicKey);\n\n \/\/ setup template variables\n std::string error = request.queryParamValue(kErrorParam);\n variables[kErrorMessage] = error;\n variables[kErrorDisplay] = error.empty() ? \"none\" : \"block\";\n\n variables[kAppUri] = request.queryParamValue(kAppUri);\n\n \/\/ get the path to the JS file\n Options& options = server::options();\n FilePath wwwPath(options.wwwLocalPath());\n FilePath signInPath = wwwPath.complete(\"templates\/encrypted-sign-in.htm\");\n\n text::TemplateFilter filter(variables);\n\n pResponse->setFile(signInPath, request, filter);\n pResponse->setContentType(\"text\/html\");\n}\n\nvoid publicKey(const http::Request&,\n http::Response* pResponse)\n{\n std::string exp, mod;\n core::system::crypto::rsaPublicKey(&exp, &mod);\n pResponse->setNoCacheHeaders();\n pResponse->setBody(exp + \":\" + mod);\n pResponse->setContentType(\"text\/plain\");\n}\n\nvoid doSignIn(const http::Request& request,\n http::Response* pResponse)\n{\n std::string appUri = request.formFieldValue(kAppUri);\n if (appUri.empty())\n appUri = \"\/\";\n\n std::string encryptedValue = request.formFieldValue(\"v\");\n bool persist = request.formFieldValue(\"persist\") == \"1\";\n std::string plainText;\n Error error = core::system::crypto::rsaPrivateDecrypt(encryptedValue,\n &plainText);\n if (error)\n {\n LOG_ERROR(error);\n pResponse->setMovedTemporarily(\n request,\n applicationSignInURL(request,\n appUri,\n \"Temporary server error,\"\n \" please try again\"));\n return;\n }\n\n size_t splitAt = plainText.find('\\n');\n if (splitAt == std::string::npos)\n {\n LOG_ERROR_MESSAGE(\"Didn't find newline in plaintext\");\n pResponse->setMovedTemporarily(\n request,\n applicationSignInURL(request,\n appUri,\n \"Temporary server error,\"\n \" please try again\"));\n return;\n }\n\n std::string username = plainText.substr(0, splitAt);\n std::string password = plainText.substr(splitAt + 1, plainText.size());\n\n if ( pamLogin(username, password) && server::auth::validateUser(username))\n {\n if (appUri.size() > 0 && appUri[0] != '\/')\n appUri = \"\/\" + appUri;\n\n boost::optional<boost::gregorian::days> expiry;\n if (persist)\n expiry = boost::gregorian::days(3652);\n else\n expiry = boost::none;\n\n auth::secure_cookie::set(kUserId,\n username,\n request,\n boost::posix_time::time_duration(24*3652,\n 0,\n 0,\n 0),\n expiry,\n std::string(),\n pResponse);\n pResponse->setMovedTemporarily(request, appUri);\n\n \/\/ register login with monitor\n using namespace monitor::events;\n monitor::monitorClient().logEvent(Event(kAuthScope,\n kAuthLoginEvent,\n username));\n }\n else\n {\n pResponse->setMovedTemporarily(\n request,\n applicationSignInURL(request,\n appUri,\n \"Incorrect or invalid username\/password\"));\n }\n}\n\nvoid signOut(const http::Request& request,\n http::Response* pResponse)\n{\n \/\/ register logout with monitor if we have the username\n std::string userIdentifier = getUserIdentifier(request);\n if (!userIdentifier.empty())\n {\n std::string username = userIdentifierToLocalUsername(userIdentifier);\n\n using namespace monitor::events;\n monitor::monitorClient().logEvent(Event(kAuthScope,\n kAuthLogoutEvent,\n username));\n }\n\n auth::secure_cookie::remove(request, kUserId, \"\", pResponse);\n pResponse->setMovedTemporarily(request, auth::handler::kSignIn);\n}\n\n} \/\/ anonymous namespace\n\n\nError initialize()\n{\n \/\/ register ourselves as the auth handler\n server::auth::handler::Handler pamHandler;\n pamHandler.getUserIdentifier = getUserIdentifier;\n pamHandler.userIdentifierToLocalUsername = userIdentifierToLocalUsername;\n pamHandler.mainPageFilter = mainPageFilter;\n pamHandler.signInThenContinue = signInThenContinue;\n pamHandler.refreshCredentialsThenContinue = refreshCredentialsThenContinue;\n pamHandler.signIn = signIn;\n pamHandler.signOut = signOut;\n auth::handler::registerHandler(pamHandler);\n\n \/\/ add pam-specific auth handlers\n uri_handlers::addBlocking(kDoSignIn, doSignIn);\n uri_handlers::addBlocking(kPublicKey, publicKey);\n\n \/\/ initialize crypto\n return core::system::crypto::rsaInit();\n}\n\n\n} \/\/ namespace pam_auth\n} \/\/ namespace server\n<commit_msg>log username correctly<commit_after>\/*\n * ServerPAMAuth.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#include \"ServerPAMAuth.hpp\"\n\n\n#include <core\/Error.hpp>\n#include <core\/PeriodicCommand.hpp>\n#include <core\/system\/Process.hpp>\n#include <core\/system\/Crypto.hpp>\n#include <core\/system\/PosixSystem.hpp>\n\n#include <core\/http\/Request.hpp>\n#include <core\/http\/Response.hpp>\n#include <core\/http\/URL.hpp>\n#include <core\/http\/AsyncUriHandler.hpp>\n#include <core\/text\/TemplateFilter.hpp>\n\n#include <monitor\/MonitorClient.hpp>\n\n#include <server\/auth\/ServerValidateUser.hpp>\n#include <server\/auth\/ServerSecureUriHandler.hpp>\n#include <server\/auth\/ServerAuthHandler.hpp>\n#include <server\/auth\/ServerSecureCookie.hpp>\n\n#include <server\/ServerOptions.hpp>\n#include <server\/ServerUriHandlers.hpp>\n\n#include \"ServerSessionProxy.hpp\"\n\nnamespace server {\nnamespace pam_auth {\n\nnamespace {\n\nvoid assumeRootPriv()\n{\n \/\/ RedHat 5 returns PAM_SYSTEM_ERR from pam_authenticate if we're\n \/\/ running with geteuid != getuid (as is the case when we temporarily\n \/\/ drop privileges). We've also seen kerberos on Ubuntu require\n \/\/ priv to work correctly -- so, restore privilliges in the child\n if (core::system::realUserIsRoot())\n {\n Error error = core::system::restorePriv();\n if (error)\n {\n LOG_ERROR(error);\n \/\/ intentionally fail forward (see note above)\n }\n }\n}\n\nbool pamLogin(const std::string& username, const std::string& password)\n{\n \/\/ get path to pam helper\n FilePath pamHelperPath(server::options().authPamHelperPath());\n if (!pamHelperPath.exists())\n {\n LOG_ERROR_MESSAGE(\"PAM helper binary does not exist at \" +\n pamHelperPath.absolutePath());\n return false;\n }\n\n \/\/ form args\n std::vector<std::string> args;\n args.push_back(username);\n\n \/\/ options (assume priv after fork)\n core::system::ProcessOptions options;\n options.onAfterFork = assumeRootPriv;\n\n \/\/ run pam helper\n core::system::ProcessResult result;\n Error error = core::system::runProgram(pamHelperPath.absolutePath(),\n args,\n password,\n options,\n &result);\n if (error)\n {\n LOG_ERROR(error);\n return false;\n }\n\n \/\/ check for success\n return result.exitStatus == 0;\n}\n\n\n\nconst char * const kUserId = \"user-id\";\n\n\/\/ It's important that URIs be in the root directory, so the cookie\n\/\/ gets set\/unset at the correct scope!\nconst char * const kDoSignIn = \"\/auth-do-sign-in\";\nconst char * const kPublicKey = \"\/auth-public-key\";\n\nconst char * const kAppUri = \"appUri\";\n\nconst char * const kErrorParam = \"error\";\nconst char * const kErrorDisplay = \"errorDisplay\";\nconst char * const kErrorMessage = \"errorMessage\";\n\n\nstd::string applicationURL(const http::Request& request,\n const std::string& path = std::string())\n{\n return http::URL::uncomplete(\n request.uri(),\n path);\n}\n\nstd::string applicationSignInURL(const http::Request& request,\n const std::string& appUri,\n const std::string& errorMessage=std::string())\n{\n \/\/ build fields\n http::Fields fields ;\n if (appUri != \"\/\")\n fields.push_back(std::make_pair(kAppUri, appUri));\n if (!errorMessage.empty())\n fields.push_back(std::make_pair(kErrorParam, errorMessage));\n\n \/\/ build query string\n std::string queryString ;\n if (!fields.empty())\n http::util::buildQueryString(fields, &queryString);\n\n \/\/ generate url\n std::string signInURL = applicationURL(request, auth::handler::kSignIn);\n if (!queryString.empty())\n signInURL += (\"?\" + queryString);\n return signInURL;\n}\n\nstd::string getUserIdentifier(const core::http::Request& request)\n{\n return auth::secure_cookie::readSecureCookie(request, kUserId);\n}\n\nstd::string userIdentifierToLocalUsername(const std::string& userIdentifier)\n{\n return userIdentifier;\n}\n\nbool mainPageFilter(const http::Request& request,\n http::Response* pResponse)\n{\n \/\/ check for user identity, if we have one then allow the request to proceed\n std::string userIdentifier = getUserIdentifier(request);\n if (userIdentifier.empty())\n {\n \/\/ otherwise redirect to sign-in\n pResponse->setMovedTemporarily(request, applicationSignInURL(request, request.uri()));\n return false;\n }\n else\n {\n return true;\n }\n}\n\nvoid signInThenContinue(const core::http::Request& request,\n core::http::Response* pResponse)\n{\n pResponse->setMovedTemporarily(request, applicationSignInURL(request, request.uri()));\n}\n\nvoid refreshCredentialsThenContinue(\n boost::shared_ptr<core::http::AsyncConnection> pConnection)\n{\n \/\/ no silent refresh possible so delegate to sign-in and continue\n signInThenContinue(pConnection->request(),\n &(pConnection->response()));\n\n \/\/ write response\n pConnection->writeResponse();\n}\n\nvoid signIn(const http::Request& request,\n http::Response* pResponse)\n{\n auth::secure_cookie::remove(request, kUserId, \"\", pResponse);\n\n std::map<std::string,std::string> variables;\n variables[\"action\"] = applicationURL(request, kDoSignIn);\n variables[\"publicKeyUrl\"] = applicationURL(request, kPublicKey);\n\n \/\/ setup template variables\n std::string error = request.queryParamValue(kErrorParam);\n variables[kErrorMessage] = error;\n variables[kErrorDisplay] = error.empty() ? \"none\" : \"block\";\n\n variables[kAppUri] = request.queryParamValue(kAppUri);\n\n \/\/ get the path to the JS file\n Options& options = server::options();\n FilePath wwwPath(options.wwwLocalPath());\n FilePath signInPath = wwwPath.complete(\"templates\/encrypted-sign-in.htm\");\n\n text::TemplateFilter filter(variables);\n\n pResponse->setFile(signInPath, request, filter);\n pResponse->setContentType(\"text\/html\");\n}\n\nvoid publicKey(const http::Request&,\n http::Response* pResponse)\n{\n std::string exp, mod;\n core::system::crypto::rsaPublicKey(&exp, &mod);\n pResponse->setNoCacheHeaders();\n pResponse->setBody(exp + \":\" + mod);\n pResponse->setContentType(\"text\/plain\");\n}\n\nvoid doSignIn(const http::Request& request,\n http::Response* pResponse)\n{\n std::string appUri = request.formFieldValue(kAppUri);\n if (appUri.empty())\n appUri = \"\/\";\n\n std::string encryptedValue = request.formFieldValue(\"v\");\n bool persist = request.formFieldValue(\"persist\") == \"1\";\n std::string plainText;\n Error error = core::system::crypto::rsaPrivateDecrypt(encryptedValue,\n &plainText);\n if (error)\n {\n LOG_ERROR(error);\n pResponse->setMovedTemporarily(\n request,\n applicationSignInURL(request,\n appUri,\n \"Temporary server error,\"\n \" please try again\"));\n return;\n }\n\n size_t splitAt = plainText.find('\\n');\n if (splitAt == std::string::npos)\n {\n LOG_ERROR_MESSAGE(\"Didn't find newline in plaintext\");\n pResponse->setMovedTemporarily(\n request,\n applicationSignInURL(request,\n appUri,\n \"Temporary server error,\"\n \" please try again\"));\n return;\n }\n\n std::string username = plainText.substr(0, splitAt);\n std::string password = plainText.substr(splitAt + 1, plainText.size());\n\n if ( pamLogin(username, password) && server::auth::validateUser(username))\n {\n if (appUri.size() > 0 && appUri[0] != '\/')\n appUri = \"\/\" + appUri;\n\n boost::optional<boost::gregorian::days> expiry;\n if (persist)\n expiry = boost::gregorian::days(3652);\n else\n expiry = boost::none;\n\n auth::secure_cookie::set(kUserId,\n username,\n request,\n boost::posix_time::time_duration(24*3652,\n 0,\n 0,\n 0),\n expiry,\n std::string(),\n pResponse);\n pResponse->setMovedTemporarily(request, appUri);\n\n \/\/ register login with monitor\n using namespace monitor::events;\n monitor::monitorClient().logEvent(Event(\n kAuthScope,\n kAuthLoginEvent,\n username,\n core::system::currentProcessId()));\n }\n else\n {\n pResponse->setMovedTemporarily(\n request,\n applicationSignInURL(request,\n appUri,\n \"Incorrect or invalid username\/password\"));\n }\n}\n\nvoid signOut(const http::Request& request,\n http::Response* pResponse)\n{\n \/\/ register logout with monitor if we have the username\n std::string userIdentifier = getUserIdentifier(request);\n if (!userIdentifier.empty())\n {\n std::string username = userIdentifierToLocalUsername(userIdentifier);\n\n using namespace monitor::events;\n monitor::monitorClient().logEvent(Event(\n kAuthScope,\n kAuthLogoutEvent,\n username,\n core::system::currentProcessId()));\n }\n\n auth::secure_cookie::remove(request, kUserId, \"\", pResponse);\n pResponse->setMovedTemporarily(request, auth::handler::kSignIn);\n}\n\n} \/\/ anonymous namespace\n\n\nError initialize()\n{\n \/\/ register ourselves as the auth handler\n server::auth::handler::Handler pamHandler;\n pamHandler.getUserIdentifier = getUserIdentifier;\n pamHandler.userIdentifierToLocalUsername = userIdentifierToLocalUsername;\n pamHandler.mainPageFilter = mainPageFilter;\n pamHandler.signInThenContinue = signInThenContinue;\n pamHandler.refreshCredentialsThenContinue = refreshCredentialsThenContinue;\n pamHandler.signIn = signIn;\n pamHandler.signOut = signOut;\n auth::handler::registerHandler(pamHandler);\n\n \/\/ add pam-specific auth handlers\n uri_handlers::addBlocking(kDoSignIn, doSignIn);\n uri_handlers::addBlocking(kPublicKey, publicKey);\n\n \/\/ initialize crypto\n return core::system::crypto::rsaInit();\n}\n\n\n} \/\/ namespace pam_auth\n} \/\/ namespace server\n<|endoftext|>"} {"text":"<commit_before>\/*\n * Illarionserver - server for the game Illarion\n * Copyright 2011 Illarion e.V.\n *\n * This file is part of Illarionserver.\n *\n * Illarionserver is free software: you can redistribute it and\/or modify it\n * under the terms of the GNU Affero General Public License as published by the Free\n * Software Foundation, either version 3 of the License, or (at your option) any\n * later version.\n *\n * Illarionserver is distributed in the hope that it will be useful, but WITHOUT\n * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or\n * FITNESS FOR A PARTICULAR PURPOSE. See the GNU Affero General Public License for more\n * details.\n *\n * You should have received a copy of the GNU Affero General Public License along with\n * Illarionserver. If not, see <http:\/\/www.gnu.org\/licenses\/>.\n *\/\n\n#include \"data\/LongTimeEffectTable.hpp\"\n\nauto LongTimeEffectTable::getTableName() const -> std::string { return \"longtimeeffects\"; }\n\nauto LongTimeEffectTable::getColumnNames() -> std::vector<std::string> {\n return {\"lte_effectid\", \"lte_effectname\", \"lte_scriptname\"};\n}\n\nauto LongTimeEffectTable::assignId(const Database::ResultTuple &row) -> uint16_t {\n return row[\"lte_effectid\"].as<uint16_t>();\n}\n\nauto LongTimeEffectTable::assignTable(const Database::ResultTuple &row) -> LongTimeEffectStruct {\n LongTimeEffectStruct lte;\n lte.effectid = assignId(row);\n lte.effectname = row[\"lte_effectid\"].as<std::string>();\n return lte;\n}\n\nauto LongTimeEffectTable::assignScriptName(const Database::ResultTuple &row) -> std::string {\n return row[\"lte_scriptname\"].as<std::string>(\"\");\n}\n<commit_msg>Correctly load LTE name<commit_after>\/*\n * Illarionserver - server for the game Illarion\n * Copyright 2011 Illarion e.V.\n *\n * This file is part of Illarionserver.\n *\n * Illarionserver is free software: you can redistribute it and\/or modify it\n * under the terms of the GNU Affero General Public License as published by the Free\n * Software Foundation, either version 3 of the License, or (at your option) any\n * later version.\n *\n * Illarionserver is distributed in the hope that it will be useful, but WITHOUT\n * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or\n * FITNESS FOR A PARTICULAR PURPOSE. See the GNU Affero General Public License for more\n * details.\n *\n * You should have received a copy of the GNU Affero General Public License along with\n * Illarionserver. If not, see <http:\/\/www.gnu.org\/licenses\/>.\n *\/\n\n#include \"data\/LongTimeEffectTable.hpp\"\n\nauto LongTimeEffectTable::getTableName() const -> std::string { return \"longtimeeffects\"; }\n\nauto LongTimeEffectTable::getColumnNames() -> std::vector<std::string> {\n return {\"lte_effectid\", \"lte_effectname\", \"lte_scriptname\"};\n}\n\nauto LongTimeEffectTable::assignId(const Database::ResultTuple &row) -> uint16_t {\n return row[\"lte_effectid\"].as<uint16_t>();\n}\n\nauto LongTimeEffectTable::assignTable(const Database::ResultTuple &row) -> LongTimeEffectStruct {\n LongTimeEffectStruct lte;\n lte.effectid = assignId(row);\n lte.effectname = row[\"lte_effectname\"].as<std::string>();\n return lte;\n}\n\nauto LongTimeEffectTable::assignScriptName(const Database::ResultTuple &row) -> std::string {\n return row[\"lte_scriptname\"].as<std::string>(\"\");\n}\n<|endoftext|>"} {"text":"<commit_before>#include <common.h>\n\n\n\n\n\/\/ ========================================================================\n\/\/ ===================== Critical Macrodefinitions ========================\n\/\/ ========================================================================\n\n\n\n\n\/*\n * FOSC = 1MHz is confugured via Flash Fuses CKSEL=1 and SUT=2.\n *\/\n\n#define IBUF_SIZE 16\n#define OBUF_SIZE 32\n#define BAUD_RATE 4800 \/\/ 4.8kbps\n#define FOSC 1000000 \/\/ 1MHz\n#define TC2_PRESCALE 1 \/\/ no Timer\/Counter2 prescale\n\n\n\n#include <usart.h>\n#include <pwm.h>\n\n\n\n#define REMUX(c) ADMUX = (3<<REFS0)|(1<<ADLAR)|(c<<MUX0)\n\n\n\n\n\/\/ ========================================================================\n\/\/ ===================== Initialization ===================================\n\/\/ ========================================================================\n\n\n\n\ninline __monitor void init()\n{\n \/* USART initialization *\/\n usart_init();\n \/* Timer\/Counter2 initialization *\/\n init_tc2_wg();\n \/* ADC initialization (1\/8 prescaling,\n 1st channel, internal Vref, left alignment) *\/\n REMUX(0);\n ADCSR = (1<<ADEN)|(3<<ADPS0);\n \n \/* Pin configuration *\/\n PORTB = (1<<PORTB0)|(1<<PORTB1)|(1<<PORTB2)|\n (0<<PORTB3)|(1<<PORTB4)|(1<<PORTB5)|\n (1<<PORTB6)|(1<<PORTB7);\n DDRB = (0<<DDB0)|(0<<DDB1)|(0<<DDB2)|\n (1<<DDB3)|(0<<DDB4)|(0<<DDB5)|\n (0<<DDB6)|(0<<DDB7);\n PORTC = (0<<PORTC0)|(0<<PORTC1)|(1<<PORTC2)|\n (1<<PORTC3)|(1<<PORTC4)|(1<<PORTC5)|\n (1<<PORTC6);\n DDRC = (0<<DDC0)|(0<<DDC1)|(0<<DDC2)|\n (0<<DDC3)|(0<<DDC4)|(0<<DDC5)|\n (0<<DDC6);\n PORTD = (0<<PORTD0)|(0<<PORTD1)|(1<<PORTD2)|\n (1<<PORTD3)|(1<<PORTD4)|(1<<PORTD5)|\n (1<<PORTD6)|(1<<PORTD7);\n DDRD = (0<<DDD0)|(1<<DDD1)|(0<<DDD2)|\n (0<<DDD3)|(0<<DDD4)|(0<<DDD5)|\n (0<<DDD6)|(0<<DDD7);\n}\n\n\n\n\n\n\/\/ ========================================================================\n\/\/ ===================== Common Variables =================================\n\/\/ ========================================================================\n\n\n\n\n\nsbyte kp = 1, \/* proportional factor *\/\n ki = -7, \/* memory factor *\/\n ks = 8 \/* scale factor *\/\n ;\n\nbool pause = false; \/* paused state *\/\nbool sync = false; \/* USART async\/sync transmit operation *\/\n\nbyte adc1, adc2; \/* ADC 1st and 2nd channel *\/\n\nint err = 0; \/* current error *\/\n\n\n\n\n\n\/\/ ========================================================================\n\/\/ ===================== Message Loop Variables ===========================\n\/\/ ========================================================================\n\n\n\n\n\/*\n * #33 <enchancement>\n *\n * Simplify IO protocol.\n *\n * The new protocol is user-friendly and quite simple.\n * The typical command starts with `METHOD`\n * (1 byte: `SET`, `GET`, `ECHO`, etc.). The next byte is\n * method-dependent. E.g. `VARIABLE` for `SET` and `GET`.\n * `SET` method also requires the variable value (1..any bytes)\n * to be set.\n *\n * COMMAND = METHOD [CONTENT]\n * METHOD = `SET` | `GET` | `ECHO` | BYTE\n * CONTENT = {\n * METHOD=`SET` => VARIABLE [DATA],\n * METHOD=`GET` => VARIABLE,\n * METHOD=`ECHO` => BYTE,\n * METHOD=BYTE => any\n * }\n * VARIABLE = BYTE\n * DATA = any\n *\n * BYTE = 1 any byte\n * any = any bytes\n *\/\n\n\nbyte command_method;\nbool command_present = false;\nbyte command_variable;\nbool command_variable_present = false;\n\n\n#define METHOD_GET (byte) 0\n#define METHOD_SET (byte) 1\n#define METHOD_ECHO (byte) 2\n\n\/\/ SET\n#define VAR_PAUSE (byte) 0\n#define VAR_SYNC_USART (byte) 1\n#define VAR_KP (byte) 2\n#define VAR_KI (byte) 3\n#define VAR_KS (byte) 4\n\n\/\/ GET\n#define NO_OUTPUT (byte) 0\n#define VAR_ADC1 (byte) 1\n#define VAR_ADC2 (byte) 2\n#define VAR_INT_ERR (byte) 3\n#define VAR_CUR_ERR (byte) 4\n#define VAR_PWM (byte) 5\n#define VAR_OCR2 (byte) 6\n\n\nbyte output_mode = NO_OUTPUT;\n\n\n\n\n\n\n\/\/ ========================================================================\n\/\/ ===================== Utility Functions ================================\n\/\/ ========================================================================\n\n\n\n\n\n\n\nvoid send_all(byte *data, byte size)\n{\n if (!sync)\n {\n transmit_all(data, size);\n }\n else\n {\n while (!transmit_all(data, size)) \/\/ wait in sync mode\n ;\n }\n}\n\n\nvoid send_byte(byte data)\n{\n send_all(&data, 1);\n}\n\n\nvoid send_int(unsigned int data)\n{\n byte lo_hi[2] = { (byte) (data & 0xff), (byte) (data >> 8) };\n send_all(lo_hi, 2);\n}\n\n\n\n\n\n\/\/ ========================================================================\n\/\/ ===================== Command Processors ===============================\n\/\/ ========================================================================\n\n\n\n\n\nbool process_set_variable()\n{\n byte value;\n if (!receive(&value)) return false; \/\/ wait for the value\n switch(command_variable)\n {\n case VAR_PAUSE:\n pause = value;\n break;\n case VAR_SYNC_USART:\n sync = value;\n break;\n case VAR_KP:\n kp = (sbyte) value;\n break;\n case VAR_KI:\n ki = (sbyte) value;\n break;\n case VAR_KS:\n ks = (sbyte) value;\n break;\n }\n return true;\n}\n\n\nvoid process_command()\n{\n byte echo_value;\n switch(command_method)\n {\n case METHOD_ECHO:\n if (!receive(&echo_value)) return; \/\/ wait for the value to send back\n send_byte(echo_value);\n break;\n case METHOD_GET:\n if (!receive(&output_mode)) return; \/\/ wait for the variable\n break;\n case METHOD_SET:\n \/\/ wait for the variable\n if (!command_variable_present)\n {\n if (!(command_variable_present = receive(&command_variable))) return;\n }\n if (!process_set_variable()) return; \/\/ wait for the argument(s)\n break;\n }\n command_present = false;\n command_variable_present = false;\n}\n\n\n\n\n\n\/\/ ========================================================================\n\/\/ ===================== Program Logic ====================================\n\/\/ ========================================================================\n\n\n\n\n\nvoid do_computations()\n{\n \/* Read ADC input *\/\n \n REMUX(0); \/* 1st ADC channel *\/\n ADCSR |= (1 << ADSC); \/* Initialize single-ended conversion *\/\n while(!(ADCSR & (1 << ADIF))) \/* Wait for the end of the conversion *\/\n ;\n adc1 = ADCH; \/* Read the 8-bit conversion result *\/\n ADCSR &= ~(1 << ADIF); \/* Clear Conversion Complete flag *\/\n \n REMUX(1); \/* 2nd ADC channel *\/\n ADCSR |= (1 << ADSC); \/* Initialize single-ended conversion *\/\n while(!(ADCSR & (1 << ADIF))) \/* Wait for the end of the conversion *\/\n ;\n adc2 = ADCH; \/* Read the 8-bit conversion result *\/\n ADCSR &= ~(1 << ADIF); \/* Clear Conversion Complete flag *\/\n \n \/* Calculate PWM width *\/\n \n \/*\n * pwmw = KP * e + KI * err, where KP = 2^kp, KI = 2^ki\n *\/\n \n int e = ((int)(adc2) - (int)(adc1));\n int pwmw = ABS(err);\n if (ulog2(pwmw) + ki <= 15) \/\/ signed 16bit int = sign bit + 15bit\n {\n pwmw = (ki < 0 ? (err >> (-ki)) : (err << ki));\n pwmw = safe_add(pwmw, (kp < 0 ? (e >> (-kp)) : (e << kp)));\n }\n else\n {\n pwmw = (err < 0 ? INT_MIN : INT_MAX);\n }\n \n err = safe_add(err, e);\n \n \/* Setup PWM width *\/\n \n \/*\n * Must transform pwmw from signed int to unsigned byte.\n * Add INT_MAX to get rid of negative values and divide\n * by 2^ks.\n *\/\n \n OCR2 = (\n pwmw < 0 ?\n INT_MAX + pwmw :\n (unsigned int) (pwmw) + INT_MAX\n ) >> ks;\n\n \/* Report back *\/\n \n switch(output_mode)\n {\n case NO_OUTPUT:\n break;\n case VAR_ADC1:\n send_byte(adc1);\n break;\n case VAR_ADC2:\n send_byte(adc2);\n break;\n case VAR_INT_ERR:\n send_int(err);\n break;\n case VAR_CUR_ERR:\n send_int(e);\n break;\n case VAR_PWM:\n send_int(pwmw);\n break;\n case VAR_OCR2:\n send_byte(OCR2);\n break;\n }\n}\n\n\n\n\n\n\/\/ ========================================================================\n\/\/ ===================== Program Entry Point ==============================\n\/\/ ========================================================================\n\n\n\n\n\nint main()\n{\n \n \/* Initialization here *\/\n \n \n init();\n \n __enable_interrupt();\n \n \n \/* Program Loop *\/\n \n \n for(;;)\n {\n \n \n \/* Message Loop *\/\n \n \n if (command_present)\n {\n process_command();\n }\n else\n {\n command_present = receive(&command_method);\n }\n \n \n \/* Program Body *\/\n \n \n if (!pause)\n {\n do_computations();\n }\n \n \n }\n \n \n return 0;\n}\n<commit_msg>The IO protocol and controller code updated<commit_after>#include <common.h>\n\n\n\n\n\/\/ ========================================================================\n\/\/ ===================== Critical Macrodefinitions ========================\n\/\/ ========================================================================\n\n\n\n\n\/*\n * FOSC = 1MHz is confugured via Flash Fuses CKSEL=1 and SUT=2.\n *\/\n\n#define IBUF_SIZE 16\n#define OBUF_SIZE 32\n#define BAUD_RATE 4800 \/\/ 4.8kbps\n#define FOSC 1000000 \/\/ 1MHz\n#define TC2_PRESCALE 1 \/\/ no Timer\/Counter2 prescale\n\n\n\n#include <usart.h>\n#include <pwm.h>\n\n\n\n#define REMUX(c) ADMUX = (3<<REFS0)|(1<<ADLAR)|(c<<MUX0)\n\n\n\n\n\/\/ ========================================================================\n\/\/ ===================== Initialization ===================================\n\/\/ ========================================================================\n\n\n\n\ninline __monitor void init()\n{\n \/* USART initialization *\/\n usart_init();\n \/* Timer\/Counter2 initialization *\/\n init_tc2_wg();\n \/* ADC initialization (1\/8 prescaling,\n 1st channel, internal Vref, left alignment) *\/\n REMUX(0);\n ADCSR = (1<<ADEN)|(3<<ADPS0);\n \n \/* Pin configuration *\/\n PORTB = (1<<PORTB0)|(1<<PORTB1)|(1<<PORTB2)|\n (0<<PORTB3)|(1<<PORTB4)|(1<<PORTB5)|\n (1<<PORTB6)|(1<<PORTB7);\n DDRB = (0<<DDB0)|(0<<DDB1)|(0<<DDB2)|\n (1<<DDB3)|(0<<DDB4)|(0<<DDB5)|\n (0<<DDB6)|(0<<DDB7);\n PORTC = (0<<PORTC0)|(0<<PORTC1)|(1<<PORTC2)|\n (1<<PORTC3)|(1<<PORTC4)|(1<<PORTC5)|\n (1<<PORTC6);\n DDRC = (0<<DDC0)|(0<<DDC1)|(0<<DDC2)|\n (0<<DDC3)|(0<<DDC4)|(0<<DDC5)|\n (0<<DDC6);\n PORTD = (0<<PORTD0)|(0<<PORTD1)|(1<<PORTD2)|\n (1<<PORTD3)|(1<<PORTD4)|(1<<PORTD5)|\n (1<<PORTD6)|(1<<PORTD7);\n DDRD = (0<<DDD0)|(1<<DDD1)|(0<<DDD2)|\n (0<<DDD3)|(0<<DDD4)|(0<<DDD5)|\n (0<<DDD6)|(0<<DDD7);\n}\n\n\n\n\n\n\/\/ ========================================================================\n\/\/ ===================== Common Variables =================================\n\/\/ ========================================================================\n\n\n\n\/*\n * #40 <bug> <enchancement>\n *\n * Modify coefficient format.\n *\n * Let C = one of { KP KI KS }.\n *\n * C * x = (M * x) >> d\n *\n * Since ATMega8 does not support floating point operations,\n * and just (x << d) or (x >> d) cannot provide precise regulation.\n *\/\n\n\nunsigned int kp_m = 0; byte kp_d = 0; \/* proportional factor *\/\nunsigned int ki_m = 0; byte ki_d = 0; \/* integral factor *\/\nunsigned int ks_m = 0; byte ks_d = 0; \/* scale factor *\/\n\n#define COEF(c, x) (((long) x) * (c##_m)) >> (c##_d)\n\nbool pause = false; \/* paused state *\/\nbool sync = false; \/* USART async\/sync transmit operation *\/\n\nbyte adc1, adc2; \/* ADC 1st and 2nd channel *\/\n\nint int_err = 0; \/* integral error *\/\nint cur_err = 0; \/* current error *\/\nint pwm = 0; \/* PWM *\/\n\n\n\n\n\n\/\/ ========================================================================\n\/\/ ===================== Message Loop Variables ===========================\n\/\/ ========================================================================\n\n\n\n\n\/*\n * #33 <enchancement>\n *\n * Simplify IO protocol.\n *\n * The new protocol is user-friendly and quite simple.\n * The typical command starts with `METHOD`\n * (1 byte: `SET`, `GET`, `ECHO`, etc.). The next byte is\n * method-dependent. E.g. `VARIABLE` for `SET` and `GET`.\n * `SET` method also requires the variable value (1..any bytes)\n * to be set.\n *\n * COMMAND = METHOD [CONTENT]\n * METHOD = `SET` | `GET` | `ECHO` | BYTE\n * CONTENT = {\n * METHOD=`SET` => VARIABLE [DATA],\n * METHOD=`GET` => VARIABLE,\n * METHOD=`ECHO` => BYTE,\n * METHOD=BYTE => any\n * }\n * VARIABLE = BYTE\n * DATA = any\n *\n * BYTE = 1 any byte\n * any = any bytes\n *\/\n\n\nbyte command_method;\nbool command_present = false;\nbyte command_variable;\nbool command_variable_present = false;\n\n\/*\n * #47 <enchancement>\n *\n * Add `COEFS` variable and `PACKET` output format\n * to support controller-gui tool.\n *\n * Data packet GET format is:\n * <0 ADC1 ADC2 CUR_ERR INT_ERR PWM OCR2>\n * Coefficient packet SET format is:\n * <KP KI KS>\n *\/\n\n#define METHOD_GET (byte) 0\n#define METHOD_SET (byte) 1\n#define METHOD_ECHO (byte) 2\n\n\/\/ SET\n#define VAR_PAUSE (byte) 0\n#define VAR_SYNC_USART (byte) 1\n#define VAR_KP (byte) 2\n#define VAR_KI (byte) 3\n#define VAR_KS (byte) 4\n#define VAR_COEFS (byte) 5\n\n\/\/ GET\n#define NO_OUTPUT (byte) 0\n#define VAR_ADC1 (byte) 1\n#define VAR_ADC2 (byte) 2\n#define VAR_INT_ERR (byte) 3\n#define VAR_CUR_ERR (byte) 4\n#define VAR_PWM (byte) 5\n#define VAR_OCR2 (byte) 6\n#define VAR_PACKET (byte) 7\n\n\nbyte output_mode = NO_OUTPUT;\n\n\n\n\n\n\n\/\/ ========================================================================\n\/\/ ===================== Utility Functions ================================\n\/\/ ========================================================================\n\n\n\n\n\n\n\nvoid send_all(byte *data, byte size)\n{\n if (!sync)\n {\n transmit_all(data, size);\n }\n else\n {\n while (!transmit_all(data, size)) \/\/ wait in sync mode\n ;\n }\n}\n\n\nvoid send_byte(byte data)\n{\n send_all(&data, 1);\n}\n\n\nvoid send_int(unsigned int data)\n{\n byte lo_hi[2] = { (byte) (data & 0xff), (byte) (data >> 8) };\n send_all(lo_hi, 2);\n}\n\n\nvoid send_packet(\/* byte adc1, byte adc2, int cur_err, int int_err, int pwm, byte OCR2 *\/)\n{\n byte packet[10] = {\n 0,\n adc1,\n adc2,\n ((unsigned int) cur_err) >> 8, cur_err & 0xff,\n ((unsigned int) int_err) >> 8, int_err & 0xff,\n ((unsigned int) pwm) >> 8, pwm & 0xff,\n OCR2\n };\n send_all(packet, 10);\n}\n\n\n\n\n\n\/\/ ========================================================================\n\/\/ ===================== Command Processors ===============================\n\/\/ ========================================================================\n\n\n\n\n\nbool process_set_variable()\n{\n byte packet[9];\n switch(command_variable)\n {\n case VAR_PAUSE:\n if (!receive(&packet[0])) return false; \/\/ wait for the value\n pause = packet[0];\n break;\n case VAR_SYNC_USART:\n if (!receive(packet)) return false; \/\/ wait for the value\n sync = packet[0];\n break;\n case VAR_KP:\n if (!receive_all(packet, 3)) return false; \/\/ wait for the value\n kp_m = (((unsigned int) packet[0]) << 8) | (packet[1]);\n kp_d = packet[2];\n break;\n case VAR_KI:\n if (!receive_all(packet, 3)) return false; \/\/ wait for the value\n ki_m = (((unsigned int) packet[0]) << 8) | (packet[1]);\n ki_d = packet[2];\n break;\n case VAR_KS:\n if (!receive_all(packet, 3)) return false; \/\/ wait for the value\n ks_m = (((unsigned int) packet[0]) << 8) | (packet[1]);\n ks_d = packet[2];\n break;\n case VAR_COEFS:\n if (!receive_all(packet, 9)) return false; \/\/ wait for the value\n kp_m = (((unsigned int) packet[0]) << 8) | (packet[1]);\n kp_d = packet[2];\n ki_m = (((unsigned int) packet[3]) << 8) | (packet[4]);\n ki_d = packet[5];\n ks_m = (((unsigned int) packet[6]) << 8) | (packet[7]);\n ks_d = packet[8];\n break;\n }\n return true;\n}\n\n\nvoid process_command()\n{\n byte echo_value;\n switch(command_method)\n {\n case METHOD_ECHO:\n if (!receive(&echo_value)) return; \/\/ wait for the value to send back\n send_byte(echo_value);\n break;\n case METHOD_GET:\n if (!receive(&output_mode)) return; \/\/ wait for the variable\n break;\n case METHOD_SET:\n \/\/ wait for the variable\n if (!command_variable_present)\n {\n if (!(command_variable_present = receive(&command_variable))) return;\n }\n if (!process_set_variable()) return; \/\/ wait for the argument(s)\n break;\n }\n command_present = false;\n command_variable_present = false;\n}\n\n\n\n\n\n\/\/ ========================================================================\n\/\/ ===================== Program Logic ====================================\n\/\/ ========================================================================\n\n\n\n\n\nvoid do_computations()\n{\n \/* Read ADC input *\/\n \n REMUX(0); \/* 1st ADC channel *\/\n ADCSR |= (1 << ADSC); \/* Initialize single-ended conversion *\/\n while(!(ADCSR & (1 << ADIF))) \/* Wait for the end of the conversion *\/\n ;\n adc1 = ADCH; \/* Read the 8-bit conversion result *\/\n ADCSR &= ~(1 << ADIF); \/* Clear Conversion Complete flag *\/\n \n REMUX(1); \/* 2nd ADC channel *\/\n ADCSR |= (1 << ADSC); \/* Initialize single-ended conversion *\/\n while(!(ADCSR & (1 << ADIF))) \/* Wait for the end of the conversion *\/\n ;\n adc2 = ADCH; \/* Read the 8-bit conversion result *\/\n ADCSR &= ~(1 << ADIF); \/* Clear Conversion Complete flag *\/\n \n \/* Calculate PWM width *\/\n \n \/*\n * pwm = KP * e + KI * err\n *\/\n \n cur_err = ((int)(adc2) - (int)(adc1));\n \n long p = COEF(kp, cur_err), q = COEF(ki, int_err);\n if (ABS(p) > INT_MAX) p = ((p < 0) ? (INT_MIN) : (INT_MAX));\n if (ABS(q) > INT_MAX) q = ((q < 0) ? (INT_MIN) : (INT_MAX));\n pwm = safe_add((int) p, (int) q);\n \n int_err = safe_add(int_err, cur_err);\n \n \/* Setup PWM width *\/\n \n \/*\n * Must transform pwmw from signed int to unsigned byte.\n * Add INT_MAX to get rid of negative values and divide\n * by 2^ks.\n *\/\n \n long t = COEF(ks, pwm) + INT_MAX;\n if (ABS(t) > INT_MAX) t = ((p < 0) ? (INT_MIN) : (INT_MAX));\n \n OCR2 = (((unsigned int) t) + INT_MAX) >> 8;\n\n \/* Report back *\/\n \n switch(output_mode)\n {\n case NO_OUTPUT:\n break;\n case VAR_ADC1:\n send_byte(adc1);\n break;\n case VAR_ADC2:\n send_byte(adc2);\n break;\n case VAR_INT_ERR:\n send_int(int_err);\n break;\n case VAR_CUR_ERR:\n send_int(cur_err);\n break;\n case VAR_PWM:\n send_int(pwm);\n break;\n case VAR_OCR2:\n send_byte(OCR2);\n break;\n case VAR_PACKET:\n send_packet();\n break;\n }\n}\n\n\n\n\n\n\/\/ ========================================================================\n\/\/ ===================== Program Entry Point ==============================\n\/\/ ========================================================================\n\n\n\n\n\nint main()\n{\n \n \/* Initialization here *\/\n \n \n init();\n \n __enable_interrupt();\n \n \n \/* Program Loop *\/\n \n \n for(;;)\n {\n \n \n \/* Message Loop *\/\n \n \n if (command_present)\n {\n process_command();\n }\n else\n {\n command_present = receive(&command_method);\n }\n \n \n \/* Program Body *\/\n \n \n if (!pause)\n {\n do_computations();\n }\n \n \n }\n \n \n return 0;\n}\n<|endoftext|>"} {"text":"<commit_before>\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\n\/\/ main\/pbrt.cpp*\n#include \"stdafx.h\"\n#include \"api.h\"\n#include \"probes.h\"\n#include \"parser.h\"\n#include \"parallel.h\"\n\n\/\/ main program\nint main(int argc, char *argv[]) {\n Options options;\n vector<string> filenames;\n \/\/ Process command-line arguments\n for (int i = 1; i < argc; ++i) {\n if (!strcmp(argv[i], \"--ncores\")) options.nCores = atoi(argv[++i]);\n else if (!strcmp(argv[i], \"--outfile\")) options.imageFile = argv[++i];\n else if (!strcmp(argv[i], \"--quick\")) options.quickRender = true;\n else if (!strcmp(argv[i], \"--quiet\")) options.quiet = true;\n else if (!strcmp(argv[i], \"--verbose\")) options.verbose = true;\n else if (!strcmp(argv[i], \"--help\") || !strcmp(argv[i], \"-h\")) {\n printf(\"usage: pbrt [--ncores n] [--outfile filename] [--quick] [--quiet] \"\n \"[--verbose] [--help] <filename.pbrt> ...\\n\");\n return 0;\n }\n else filenames.push_back(argv[i]);\n }\n\n \/\/ Print welcome banner\n if (!options.quiet) {\n printf(\"pbrt version %s of %s at %s [Detected %d core(s)]\\n\",\n PBRT_VERSION, __DATE__, __TIME__, NumSystemCores());\n printf(\"Copyright (c)1998-2010 Matt Pharr and Greg Humphreys.\\n\");\n printf(\"The source code to pbrt (but *not* the book contents) is covered by the GNU GPL.\\n\");\n printf(\"See the file COPYING.txt for the conditions of the license.\\n\");\n fflush(stdout);\n }\n pbrtInit(options);\n \/\/ Process scene description\n PBRT_STARTED_PARSING();\n if (filenames.size() == 0) {\n \/\/ Parse scene from standard input\n ParseFile(\"-\");\n } else {\n \/\/ Parse scene from input files\n for (u_int i = 0; i < filenames.size(); i++)\n if (!ParseFile(filenames[i]))\n Error(\"Couldn't open scene file \\\"%s\\\"\", filenames[i].c_str());\n }\n pbrtCleanup();\n return 0;\n}\n\n\n<commit_msg>Bump copyright to 2012<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\n\/\/ main\/pbrt.cpp*\n#include \"stdafx.h\"\n#include \"api.h\"\n#include \"probes.h\"\n#include \"parser.h\"\n#include \"parallel.h\"\n\n\/\/ main program\nint main(int argc, char *argv[]) {\n Options options;\n vector<string> filenames;\n \/\/ Process command-line arguments\n for (int i = 1; i < argc; ++i) {\n if (!strcmp(argv[i], \"--ncores\")) options.nCores = atoi(argv[++i]);\n else if (!strcmp(argv[i], \"--outfile\")) options.imageFile = argv[++i];\n else if (!strcmp(argv[i], \"--quick\")) options.quickRender = true;\n else if (!strcmp(argv[i], \"--quiet\")) options.quiet = true;\n else if (!strcmp(argv[i], \"--verbose\")) options.verbose = true;\n else if (!strcmp(argv[i], \"--help\") || !strcmp(argv[i], \"-h\")) {\n printf(\"usage: pbrt [--ncores n] [--outfile filename] [--quick] [--quiet] \"\n \"[--verbose] [--help] <filename.pbrt> ...\\n\");\n return 0;\n }\n else filenames.push_back(argv[i]);\n }\n\n \/\/ Print welcome banner\n if (!options.quiet) {\n printf(\"pbrt version %s of %s at %s [Detected %d core(s)]\\n\",\n PBRT_VERSION, __DATE__, __TIME__, NumSystemCores());\n printf(\"Copyright (c)1998-2012 Matt Pharr and Greg Humphreys.\\n\");\n printf(\"The source code to pbrt (but *not* the book contents) is covered by the GNU GPL.\\n\");\n printf(\"See the file COPYING.txt for the conditions of the license.\\n\");\n fflush(stdout);\n }\n pbrtInit(options);\n \/\/ Process scene description\n PBRT_STARTED_PARSING();\n if (filenames.size() == 0) {\n \/\/ Parse scene from standard input\n ParseFile(\"-\");\n } else {\n \/\/ Parse scene from input files\n for (u_int i = 0; i < filenames.size(); i++)\n if (!ParseFile(filenames[i]))\n Error(\"Couldn't open scene file \\\"%s\\\"\", filenames[i].c_str());\n }\n pbrtCleanup();\n return 0;\n}\n\n\n<|endoftext|>"} {"text":"<commit_before>#include \"io.h\"\n#include \"multiclass.h\"\n#include \"Snap.h\"\n\n#include <vector>\n\nint main()\n{\n\tMNM_Dlink *_link;\n\tMNM_Dlink_Multiclass *_link_m;\n\n\tprintf(\"BEGIN multiclass test!\\n\");\n\n\t\/\/ On ubuntu (PC)\n\tstd::string folder = \"\/home\/alanpi\/Desktop\/MAC-POSTS\/data\/input_files_MckeesRocks_SPC\";\n\t\/\/ std::string folder = \"\/home\/lemma\/Documents\/MAC-POSTS\/src\/examples\/mcDODE\/a6e7b31067d2ead8d3725fc0ed587d06c958f63c\";\n\t\/\/ std::string folder = \"\/home\/alanpi\/Desktop\/MAC-POSTS\/data\/input_files_7link_multiclass\";\n\n\t\/\/ on macOS (Mac air)\n\t\/\/ std::string folder = \"\/Users\/alan-air\/Dropbox\/MAC-POSTS\/data\/input_files_MckeesRocks_SPC\";\n\t\/\/ std::string folder = \"\/Users\/alan-air\/Dropbox\/MAC-POSTS\/data\/input_files_7link_multiclass\";\n\n\n\tMNM_Dta_Multiclass *test_dta = new MNM_Dta_Multiclass(folder);\n\n\tprintf(\"================================ DTA set! =================================\\n\");\n\t\n\ttest_dta -> build_from_files();\n\tprintf(\"========================= Finished initialization! ========================\\n\");\n\n\ttest_dta -> hook_up_node_and_link();\n\tprintf(\"====================== Finished node and link hook-up! ====================\\n\");\n\n\ttest_dta -> is_ok();\n\tprintf(\"============================ DTA is OK to run! ============================\\n\");\n\n\tTInt _current_inter = 0;\n\tTInt _assign_inter = test_dta -> m_start_assign_interval;\n\ttest_dta -> pre_loading();\n\tprintf(\"========================== Finished pre_loading! ==========================\\n\");\n\n\tprintf(\"\\n\\n\\n====================================== Start loading! =======================================\\n\");\n\tbool _verbose = false;\n\tbool output_link_cong = false; \/\/ if true output link congestion level every cong_frequency\n\tTInt cong_frequency = 180; \/\/ 15 minutes\n\tbool output_veh_locs = false; \/\/ if true output veh location every vis_frequency\n\tTInt vis_frequency = 60; \/\/ 5 minutes\n\tMNM_Veh_Multiclass* _veh;\n\tstd::ofstream _vis_file;\n\tstd::string _str;\n\tif (output_veh_locs){\n\t\t_vis_file.open(folder + \"\/veh_loc\/veh_loc_raw.txt\", std::ofstream::out); \n\t\tif (! _vis_file.is_open()){\n \tprintf(\"Error happens when open _vis_file\\n\");\n \texit(-1);\n }\n\t}\n\n\twhile (!test_dta -> finished_loading(_current_inter)){\n\t\tprintf(\"Current interval: %d\\n\", _current_inter());\n\t\ttest_dta -> load_once(_verbose, _current_inter, _assign_inter);\n\t\tif (_current_inter % test_dta -> m_assign_freq == 0 || _current_inter == 0){\n\t\t\t_assign_inter += 1;\n\t\t}\n\t\tif (output_veh_locs && (_current_inter % vis_frequency == 0)){\n\t\t\tfor (auto _map_it : test_dta -> m_veh_factory -> m_veh_map){\n\t\t\t\tif (_map_it.second -> m_finish_time < 0) {\n\t\t\t\t\t_veh = dynamic_cast<MNM_Veh_Multiclass *>(_map_it.second);\n\t\t\t\t\tif (_veh -> m_class == 0){\n\t\t\t\t\t\t_str = \"Car \";\n\t\t\t\t\t}\n\t\t\t\t\telse {\n\t\t\t\t\t\t_str = \"Truck \";\n\t\t\t\t\t}\n\t\t\t\t\t_str += std::to_string(_current_inter) + \" \";\n\t\t\t\t\t_str += std::to_string(_veh -> get_current_link() -> m_link_ID) + \" \";\n\t\t\t\t\t_str += std::to_string(_veh -> m_visual_position_on_link);\n\t\t\t\t\t_str += \"\\n\";\n\t\t\t\t\t_vis_file << _str;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\t_current_inter += 1;\n\t\tif (_current_inter > 600) break;\n\t}\n\n\t\/\/ Output total travels and travel time, before divided by flow_scalar\n\tTInt _count_car = 0, _count_truck = 0;\n\tTFlt _tot_tt = 0.0;\n\tfor (auto _map_it : test_dta -> m_veh_factory -> m_veh_map){\n\t\tif (_map_it.second -> m_finish_time > 0) {\n\t\t\t_veh = dynamic_cast<MNM_Veh_Multiclass *>(_map_it.second);\n\t\t\tif (_veh -> m_class == 0){\n\t\t\t\t_count_car += 1;\n\t\t\t}\n\t\t\telse {\n\t\t\t\t_count_truck += 1;\n\t\t\t}\n\t\t\t_tot_tt += (_veh -> m_finish_time - _veh -> m_start_time) * 5.0 \/ 3600.0;\n\t\t}\n\t}\n\tprintf(\"\\n\\n\\nTotal car: %d, Total truck: %d, Total tt: %.2f hours\\n\\n\\n\\n\", int(_count_car), int(_count_truck), float(_tot_tt));\n\n\n\n\tif (output_veh_locs){\n\t\tif (_vis_file.is_open()) _vis_file.close();\n\t}\n\n\n\tstd::ofstream _vis_file2;\n\tif (output_link_cong){\n\t\t_vis_file2.open(folder + \"\/link_cong\/link_cong_raw.txt\", std::ofstream::out); \n\t\tif (! _vis_file2.is_open()){\n \tprintf(\"Error happens when open _vis_file2\\n\");\n \texit(-1);\n }\n\t\tTInt _iter = 0;\n\t\twhile (_iter < _current_inter){\n\t\t\tif (_iter % cong_frequency == 0){\n\t\t\t\tprintf(\"Current iteration: %d\\n\", int(_iter));\n\t\t\t\tfor (auto _link_it = test_dta -> m_link_factory -> m_link_map.begin(); \n\t\t\t\t\t\t _link_it != test_dta -> m_link_factory -> m_link_map.end(); _link_it++){\n\t\t\t\t\t_link = _link_it -> second;\n\t\t\t\t\t_link_m = dynamic_cast<MNM_Dlink_Multiclass*>(_link);\n\t\t\t\t\t_str = std::to_string(_link -> m_link_ID()) + \" \";\n\t\t\t\t\t_str += std::to_string(_iter) + \" \";\n\t\t\t\t\t_str += std::to_string(MNM_DTA_GRADIENT::get_link_inflow_car(_link_m, _iter, _iter + 1)) + \" \";\n\t\t\t\t\t_str += std::to_string(MNM_DTA_GRADIENT::get_link_inflow_truck(_link_m, _iter, _iter + 1)) + \" \";\n\t\t\t\t\t_str += std::to_string(MNM_DTA_GRADIENT::get_travel_time_car(_link_m, TFlt(_iter + 1))) + \" \";\n\t\t\t\t\t_str += std::to_string(MNM_DTA_GRADIENT::get_travel_time_truck(_link_m, TFlt(_iter + 1))) + \" \";\n\t\t\t\t\t_str += std::to_string(_link_m -> get_link_freeflow_tt_car()) + \" \";\n\t\t\t\t\t_str += std::to_string(_link_m -> get_link_freeflow_tt_truck()) + \" \";\n\t\t\t\t\t_str += std::to_string(_link_m -> m_length\/MNM_DTA_GRADIENT::get_travel_time_car(_link_m, TFlt(_iter + 1))*3600\/1600) + \" \";\n\t\t\t\t\t_str += std::to_string(_link_m -> m_length\/MNM_DTA_GRADIENT::get_travel_time_truck(_link_m, TFlt(_iter + 1))*3600\/1600) + \"\\n\";\n\t\t\t\t\t_vis_file2 << _str;\n\t\t\t\t}\n\t\t\t}\n\t\t\t_iter += 1;\n\t\t}\n\t\tif (_vis_file2.is_open()) _vis_file2.close();\n\t}\n\t\n\t\/\/ output tt of some special links\n\tfor (auto _link_it = test_dta -> m_link_factory -> m_link_map.begin(); _link_it != test_dta -> m_link_factory -> m_link_map.end(); _link_it++){\n\t\t\t_link = _link_it -> second;\n\t\t\tif (_link -> m_link_ID() == 7186) {\n\t\t\t\tTInt _iter = 0;\n\t\t\t\twhile (_iter < _current_inter){\n\t\t\t\t\t\/\/ if (_iter == 984){\n\t\t\t\t\t\t_link_m = dynamic_cast<MNM_Dlink_Multiclass*>(_link);\n\t\t\t\t\t\tprintf(\"%d,%.2f,%.2f\\n\", int(_iter),\n\t\t\t\t\t\t\tdouble(MNM_DTA_GRADIENT::get_travel_time_car(_link_m, TFlt(_iter + 1))), \n\t\t\t\t\t\t\tdouble(MNM_DTA_GRADIENT::get_travel_time_truck(_link_m, TFlt(_iter + 1))));\n\t\t\t\t\t\/\/ }\n\t\t\t\t\t_iter += 1;\n\t\t\t\t}\n\t\t\t}\n\t}\n\n\t\/\/ output CC of some special links\n\tfor (auto _link_it = test_dta -> m_link_factory -> m_link_map.begin(); \n\t\t\t\t _link_it != test_dta -> m_link_factory -> m_link_map.end(); _link_it++){\n\t\t\t_link = _link_it -> second;\n\t\tif (_link -> m_link_ID() == 7186){\n\t\t\t_link_m = dynamic_cast<MNM_Dlink_Multiclass*>(_link);\n\t\t\tprintf(\"\\n\\nm_N_in_car: \\n\");\n\t\t\tstd::cout <<_link_m -> m_N_in_car -> to_string() << std::endl;\n\t\t\tprintf(\"\\n\\nm_N_out_car: \\n\");\n\t\t\tstd::cout <<_link_m -> m_N_out_car -> to_string() << std::endl;\n\t\t\tprintf(\"\\n\\nm_N_in_truck: \\n\");\n\t\t\tstd::cout <<_link_m -> m_N_in_truck -> to_string() << std::endl;\n\t\t\tprintf(\"\\n\\nm_N_out_truck: \\n\");\n\t\t\tstd::cout <<_link_m -> m_N_out_truck -> to_string() << std::endl;\n\t\t}\n\t}\n\n\tdelete test_dta;\n\tprintf(\"Finished delete test_dta!\\n\\n\\n\");\n\n\treturn 0;\n}<commit_msg>update test<commit_after>#include \"io.h\"\n#include \"multiclass.h\"\n#include \"Snap.h\"\n\n#include <vector>\n\nint main()\n{\n\tMNM_Dlink *_link;\n\tMNM_Dlink_Multiclass *_link_m;\n\n\tprintf(\"BEGIN multiclass test!\\n\");\n\n\t\/\/ On ubuntu (PC)\n\tstd::string folder = \"\/home\/alanpi\/Desktop\/MAC-POSTS\/data\/input_files_MckeesRocks_SPC\";\n\t\/\/ std::string folder = \"\/home\/lemma\/Documents\/MAC-POSTS\/src\/examples\/mcDODE\/a6e7b31067d2ead8d3725fc0ed587d06c958f63c\";\n\t\/\/ std::string folder = \"\/home\/alanpi\/Desktop\/MAC-POSTS\/data\/input_files_7link_multiclass\";\n\n\t\/\/ on macOS (Mac air)\n\t\/\/ std::string folder = \"\/Users\/alan-air\/Dropbox\/MAC-POSTS\/data\/input_files_MckeesRocks_SPC\";\n\t\/\/ std::string folder = \"\/Users\/alan-air\/Dropbox\/MAC-POSTS\/data\/input_files_7link_multiclass\";\n\n\n\tMNM_Dta_Multiclass *test_dta = new MNM_Dta_Multiclass(folder);\n\n\tprintf(\"================================ DTA set! =================================\\n\");\n\t\n\ttest_dta -> build_from_files();\n\tprintf(\"========================= Finished initialization! ========================\\n\");\n\n\ttest_dta -> hook_up_node_and_link();\n\tprintf(\"====================== Finished node and link hook-up! ====================\\n\");\n\n\ttest_dta -> is_ok();\n\tprintf(\"============================ DTA is OK to run! ============================\\n\");\n\n\tTInt _current_inter = 0;\n\tTInt _assign_inter = test_dta -> m_start_assign_interval;\n\ttest_dta -> pre_loading();\n\tprintf(\"========================== Finished pre_loading! ==========================\\n\");\n\n\tprintf(\"\\n\\n\\n====================================== Start loading! =======================================\\n\");\n\tbool _verbose = false;\n\tbool output_link_cong = false; \/\/ if true output link congestion level every cong_frequency\n\tTInt cong_frequency = 180; \/\/ 15 minutes\n\tbool output_veh_locs = false; \/\/ if true output veh location every vis_frequency\n\tTInt vis_frequency = 60; \/\/ 5 minutes\n\tMNM_Veh_Multiclass* _veh;\n\tstd::ofstream _vis_file;\n\tstd::string _str;\n\tif (output_veh_locs){\n\t\t_vis_file.open(folder + \"\/veh_loc\/veh_loc_raw.txt\", std::ofstream::out); \n\t\tif (! _vis_file.is_open()){\n \tprintf(\"Error happens when open _vis_file\\n\");\n \texit(-1);\n }\n\t}\n\n\twhile (!test_dta -> finished_loading(_current_inter)){\n\t\tprintf(\"Current interval: %d\\n\", _current_inter());\n\t\ttest_dta -> load_once(_verbose, _current_inter, _assign_inter);\n\t\tif (_current_inter % test_dta -> m_assign_freq == 0 || _current_inter == 0){\n\t\t\t_assign_inter += 1;\n\t\t}\n\t\tif (output_veh_locs && (_current_inter % vis_frequency == 0)){\n\t\t\tfor (auto _map_it : test_dta -> m_veh_factory -> m_veh_map){\n\t\t\t\tif (_map_it.second -> m_finish_time < 0) {\n\t\t\t\t\t_veh = dynamic_cast<MNM_Veh_Multiclass *>(_map_it.second);\n\t\t\t\t\tif (_veh -> m_class == 0){\n\t\t\t\t\t\t_str = \"Car \";\n\t\t\t\t\t}\n\t\t\t\t\telse {\n\t\t\t\t\t\t_str = \"Truck \";\n\t\t\t\t\t}\n\t\t\t\t\t_str += std::to_string(_current_inter) + \" \";\n\t\t\t\t\t_str += std::to_string(_veh -> get_current_link() -> m_link_ID) + \" \";\n\t\t\t\t\t_str += std::to_string(_veh -> m_visual_position_on_link);\n\t\t\t\t\t_str += \"\\n\";\n\t\t\t\t\t_vis_file << _str;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\t_current_inter += 1;\n\t\tif (_current_inter > 600) break;\n\t}\n\n\t\/\/ Output total travels and travel time, before divided by flow_scalar\n\tTInt _count_car = 0, _count_truck = 0;\n\tTFlt _tot_tt = 0.0;\n\tfor (auto _map_it : test_dta -> m_veh_factory -> m_veh_map){\n\t\tif (_map_it.second -> m_finish_time > 0) {\n\t\t\t_veh = dynamic_cast<MNM_Veh_Multiclass *>(_map_it.second);\n\t\t\tif (_veh -> m_class == 0){\n\t\t\t\t_count_car += 1;\n\t\t\t}\n\t\t\telse {\n\t\t\t\t_count_truck += 1;\n\t\t\t}\n\t\t\t_tot_tt += (_veh -> m_finish_time - _veh -> m_start_time) * 5.0 \/ 3600.0;\n\t\t}\n\t}\n\tprintf(\"\\n\\n\\nTotal car: %d, Total truck: %d, Total tt: %.2f hours\\n\\n\\n\\n\", int(_count_car), int(_count_truck), float(_tot_tt));\n\n\n\n\tif (output_veh_locs){\n\t\tif (_vis_file.is_open()) _vis_file.close();\n\t}\n\n\n\tstd::ofstream _vis_file2;\n\tif (output_link_cong){\n\t\t_vis_file2.open(folder + \"\/link_cong\/link_cong_raw.txt\", std::ofstream::out); \n\t\tif (! _vis_file2.is_open()){\n \tprintf(\"Error happens when open _vis_file2\\n\");\n \texit(-1);\n }\n\t\tTInt _iter = 0;\n\t\twhile (_iter < _current_inter){\n\t\t\tif (_iter % cong_frequency == 0){\n\t\t\t\tprintf(\"Current iteration: %d\\n\", int(_iter));\n\t\t\t\tfor (auto _link_it = test_dta -> m_link_factory -> m_link_map.begin(); \n\t\t\t\t\t\t _link_it != test_dta -> m_link_factory -> m_link_map.end(); _link_it++){\n\t\t\t\t\t_link = _link_it -> second;\n\t\t\t\t\t_link_m = dynamic_cast<MNM_Dlink_Multiclass*>(_link);\n\t\t\t\t\t_str = std::to_string(_link -> m_link_ID()) + \" \";\n\t\t\t\t\t_str += std::to_string(_iter) + \" \";\n\t\t\t\t\t_str += std::to_string(MNM_DTA_GRADIENT::get_link_inflow_car(_link_m, _iter, _iter + 1)) + \" \";\n\t\t\t\t\t_str += std::to_string(MNM_DTA_GRADIENT::get_link_inflow_truck(_link_m, _iter, _iter + 1)) + \" \";\n\t\t\t\t\t_str += std::to_string(MNM_DTA_GRADIENT::get_travel_time_car(_link_m, TFlt(_iter + 1))) + \" \";\n\t\t\t\t\t_str += std::to_string(MNM_DTA_GRADIENT::get_travel_time_truck(_link_m, TFlt(_iter + 1))) + \" \";\n\t\t\t\t\t_str += std::to_string(_link_m -> get_link_freeflow_tt_car()) + \" \";\n\t\t\t\t\t_str += std::to_string(_link_m -> get_link_freeflow_tt_truck()) + \" \";\n\t\t\t\t\t_str += std::to_string(_link_m -> m_length\/MNM_DTA_GRADIENT::get_travel_time_car(_link_m, TFlt(_iter + 1))*3600\/1600) + \" \";\n\t\t\t\t\t_str += std::to_string(_link_m -> m_length\/MNM_DTA_GRADIENT::get_travel_time_truck(_link_m, TFlt(_iter + 1))*3600\/1600) + \"\\n\";\n\t\t\t\t\t_vis_file2 << _str;\n\t\t\t\t}\n\t\t\t}\n\t\t\t_iter += 1;\n\t\t}\n\t\tif (_vis_file2.is_open()) _vis_file2.close();\n\t}\n\t\n\t\/\/ \/\/ output tt of some special links\n\t\/\/ for (auto _link_it = test_dta -> m_link_factory -> m_link_map.begin(); _link_it != test_dta -> m_link_factory -> m_link_map.end(); _link_it++){\n\t\/\/ \t\t_link = _link_it -> second;\n\t\/\/ \t\tif (_link -> m_link_ID() == 7186) {\n\t\/\/ \t\t\tTInt _iter = 0;\n\t\/\/ \t\t\twhile (_iter < _current_inter){\n\t\/\/ \t\t\t\t\/\/ if (_iter == 984){\n\t\/\/ \t\t\t\t\t_link_m = dynamic_cast<MNM_Dlink_Multiclass*>(_link);\n\t\/\/ \t\t\t\t\tprintf(\"%d,%.2f,%.2f\\n\", int(_iter),\n\t\/\/ \t\t\t\t\t\tdouble(MNM_DTA_GRADIENT::get_travel_time_car(_link_m, TFlt(_iter + 1))), \n\t\/\/ \t\t\t\t\t\tdouble(MNM_DTA_GRADIENT::get_travel_time_truck(_link_m, TFlt(_iter + 1))));\n\t\/\/ \t\t\t\t\/\/ }\n\t\/\/ \t\t\t\t_iter += 1;\n\t\/\/ \t\t\t}\n\t\/\/ \t\t}\n\t\/\/ }\n\n\t\/\/ \/\/ output CC of some special links\n\t\/\/ for (auto _link_it = test_dta -> m_link_factory -> m_link_map.begin(); \n\t\/\/ \t\t\t _link_it != test_dta -> m_link_factory -> m_link_map.end(); _link_it++){\n\t\/\/ \t\t_link = _link_it -> second;\n\t\/\/ \tif (_link -> m_link_ID() == 7186){\n\t\/\/ \t\t_link_m = dynamic_cast<MNM_Dlink_Multiclass*>(_link);\n\t\/\/ \t\tprintf(\"\\n\\nm_N_in_car: \\n\");\n\t\/\/ \t\tstd::cout <<_link_m -> m_N_in_car -> to_string() << std::endl;\n\t\/\/ \t\tprintf(\"\\n\\nm_N_out_car: \\n\");\n\t\/\/ \t\tstd::cout <<_link_m -> m_N_out_car -> to_string() << std::endl;\n\t\/\/ \t\tprintf(\"\\n\\nm_N_in_truck: \\n\");\n\t\/\/ \t\tstd::cout <<_link_m -> m_N_in_truck -> to_string() << std::endl;\n\t\/\/ \t\tprintf(\"\\n\\nm_N_out_truck: \\n\");\n\t\/\/ \t\tstd::cout <<_link_m -> m_N_out_truck -> to_string() << std::endl;\n\t\/\/ \t}\n\t\/\/ }\n\n\tdelete test_dta;\n\tprintf(\"Finished delete test_dta!\\n\\n\\n\");\n\n\treturn 0;\n}<|endoftext|>"} {"text":"<commit_before>#include <errno.h>\n#include <stdlib.h>\n#include <getopt.h>\n#include <string>\n\n#include <boost\/asio.hpp>\n#include <boost\/lexical_cast.hpp>\n#include \"logger.h\"\n#include <libwatcher\/client.h>\n#include <libwatcher\/labelMessage.h>\n#include \"sendMessageHandler.h\"\n\nusing namespace std;\nusing namespace watcher;\nusing namespace watcher::event;\nusing namespace boost;\n\nvoid usage(const char *progName)\n{ \n fprintf(stderr, \"Usage: %s [args] [optional args]\\n\", basename(progName)); \n fprintf(stderr, \"Args:\\n\");\n fprintf(stderr, \" -l, --label=label The text to put in the label\\n\");\n fprintf(stderr, \" -s, --server=server The name\/address of the watcherd server\\n\");\n fprintf(stderr, \" -h,-H,-?,-help Show this usage message\\n\"); \n fprintf(stderr, \"\\n\");\n fprintf(stderr, \"Optional args:\\n\");\n fprintf(stderr, \" If address is specified, the label will attach to the node with that address. If cooridinates are\\n\");\n fprintf(stderr, \" specified, the label will float at those coordinates. The node address takes precedence. If neither\\n\"); \n fprintf(stderr, \" option is specified, the label will attach to the local node in the watcher.\\n\"); \n fprintf(stderr, \" -n, --node=address The node to attach the label to.\\n\"); \n fprintf(stderr, \" -x, --latitude=coord The latitude to float the node at.\\n\"); \n fprintf(stderr, \" -y, --longitude=coord The longitude to float the node at.\\n\"); \n fprintf(stderr, \" -z, --altitiude=coord The altitude to float the node at.\\n\"); \n fprintf(stderr, \"\\n\");\n fprintf(stderr, \" -p, --logProps log.properties file, which controls logging for this program\\n\");\n fprintf(stderr, \" -t, --fontSize=size The font size of the label\\n\");\n fprintf(stderr, \" -f, --foreground=color The foreground color of the label. Can be ROYGBIV or RGBA format, string or hex value.\\n\"); \n fprintf(stderr, \" -b, --background=color The background color of the label. Can be ROYGBIV or RGBA format, string or hex value.\\n\");\n fprintf(stderr, \" -e, --expiration=seconds How long in secondt to diplay the label\\n\");\n fprintf(stderr, \" -r, --remove Remove the label if it is attached\\n\"); \n fprintf(stderr, \" -L, --layer=layer Which layer the label is part of. Default is physical\\n\"); \n\n exit(1); \n}\n\nint main(int argc, char **argv)\n{\n TRACE_ENTER();\n\n int c;\n string label;\n string server;\n string logProps(\"sendMessage.log.properties\");\n unsigned int fontSize=10;\n asio::ip::address address;\n Color fg=Color::black;\n Color bg=Color::white;\n uint32_t expiration=10000;\n float lat=0.0, lng=0.0, alt=0.0;\n bool remove=false;\n GUILayer layer=PHYSICAL_LAYER;\n\n while (true) \n {\n int option_index = 0;\n static struct option long_options[] = {\n {\"label\", required_argument, 0, 'l'},\n {\"server\", required_argument, 0, 's'},\n {\"node\", required_argument, 0, 'n'},\n {\"latitude\", required_argument, 0, 'x'},\n {\"longitude\", required_argument, 0, 'y'},\n {\"altitiude\", required_argument, 0, 'z'},\n {\"logProps\", required_argument, 0, 'p'},\n {\"fontSize\", required_argument, 0, 't'},\n {\"foreground\", required_argument, 0, 'f'},\n {\"background\", required_argument, 0, 'b'},\n {\"expiration\", required_argument, 0, 'e'},\n {\"remove\", no_argument, 0, 'r'},\n {\"layer\", required_argument, 0, 'L'},\n {\"help\", no_argument, 0, 'h'},\n {0, 0, 0, 0}\n };\n\n c = getopt_long(argc, argv, \"l:s:n:x:y:t:p:z:f:b:e:L:rhH?\", long_options, &option_index);\n\n if (c == -1)\n break;\n\n switch(c)\n {\n case 'l': label=optarg; break;\n case 's': server=optarg; break;\n case 'p': logProps=optarg; break;\n case 't': fontSize=lexical_cast<unsigned int>(optarg); break;\n case 'f': { bool val=fg.fromString(optarg); if (!val) { printf(\"\\nBad argument for fg color\\n\\n\"); usage(argv[0]); } break; }\n case 'b': { bool val=bg.fromString(optarg); if (!val) { printf(\"\\nBad argument for bg color\\n\\n\"); usage(argv[0]); } break; }\n case 'e': expiration=lexical_cast<uint32_t>(optarg); break;\n case 'n': \n {\n boost::system::error_code e;\n address=asio::ip::address::from_string(optarg, e);\n if (e)\n {\n fprintf(stderr, \"\\nI did not understand the \\\"node\\\" argument: %s. It should be a host address.\\n\\n\", optarg);\n usage(argv[0]);\n TRACE_EXIT_RET(EXIT_FAILURE);\n return EXIT_FAILURE;\n }\n }\n break;\n case 'x': lat=lexical_cast<float>(optarg); break; \/\/ GTL should try{}catch{} here for invalid values.\n case 'y': lng=lexical_cast<float>(optarg); break; \/\/ GTL should try{}catch{} here for invalid values.\n case 'z': alt=lexical_cast<float>(optarg); break; \/\/ GTL should try{}catch{} here for invalid values.\n case 'r': remove=true; break;\n case 'L': label=optarg; break;\n case 'h':\n case 'H':\n case '?':\n default:\n usage(argv[0]); \n break;\n }\n }\n\n if (server==\"\" || label==\"\")\n {\n usage(argv[0]);\n exit(1); \n }\n\n \/\/\n \/\/ Now do some actual work.\n \/\/ \n LOAD_LOG_PROPS(logProps);\n\n watcher::Client client(server); \n LOG_INFO(\"Connecting to \" << server << \" and sending message.\"); \n client.addMessageHandler(SendMessageHandler::create());\n \n LabelMessagePtr lm = LabelMessagePtr(new LabelMessage);\n\n lm->label=label;\n lm->fontSize=fontSize;\n lm->fromNodeID=address;\n lm->foreground=fg;\n lm->background=bg;\n lm->expiration=expiration;\n lm->lat=lat;\n lm->lng=lng;\n lm->alt=alt;\n lm->addLabel=!remove;\n lm->layer=layer;\n\n if(!client.sendMessage(lm))\n {\n LOG_ERROR(\"Error sending label message: \" << *lm);\n TRACE_EXIT_RET(EXIT_FAILURE);\n return EXIT_FAILURE;\n }\n\n client.wait(); \n\n TRACE_EXIT_RET(EXIT_SUCCESS);\n return EXIT_SUCCESS;\n}\n\n<commit_msg>sendLabelMessage: fix thinko.<commit_after>#include <errno.h>\n#include <stdlib.h>\n#include <getopt.h>\n#include <string>\n\n#include <boost\/asio.hpp>\n#include <boost\/lexical_cast.hpp>\n#include \"logger.h\"\n#include <libwatcher\/client.h>\n#include <libwatcher\/labelMessage.h>\n#include \"sendMessageHandler.h\"\n\nusing namespace std;\nusing namespace watcher;\nusing namespace watcher::event;\nusing namespace boost;\n\nvoid usage(const char *progName)\n{ \n fprintf(stderr, \"Usage: %s [args] [optional args]\\n\", basename(progName)); \n fprintf(stderr, \"Args:\\n\");\n fprintf(stderr, \" -l, --label=label The text to put in the label\\n\");\n fprintf(stderr, \" -s, --server=server The name\/address of the watcherd server\\n\");\n fprintf(stderr, \" -h,-H,-?,-help Show this usage message\\n\"); \n fprintf(stderr, \"\\n\");\n fprintf(stderr, \"Optional args:\\n\");\n fprintf(stderr, \" If address is specified, the label will attach to the node with that address. If cooridinates are\\n\");\n fprintf(stderr, \" specified, the label will float at those coordinates. The node address takes precedence. If neither\\n\"); \n fprintf(stderr, \" option is specified, the label will attach to the local node in the watcher.\\n\"); \n fprintf(stderr, \" -n, --node=address The node to attach the label to.\\n\"); \n fprintf(stderr, \" -x, --latitude=coord The latitude to float the node at.\\n\"); \n fprintf(stderr, \" -y, --longitude=coord The longitude to float the node at.\\n\"); \n fprintf(stderr, \" -z, --altitiude=coord The altitude to float the node at.\\n\"); \n fprintf(stderr, \"\\n\");\n fprintf(stderr, \" -p, --logProps log.properties file, which controls logging for this program\\n\");\n fprintf(stderr, \" -t, --fontSize=size The font size of the label\\n\");\n fprintf(stderr, \" -f, --foreground=color The foreground color of the label. Can be ROYGBIV or RGBA format, string or hex value.\\n\"); \n fprintf(stderr, \" -b, --background=color The background color of the label. Can be ROYGBIV or RGBA format, string or hex value.\\n\");\n fprintf(stderr, \" -e, --expiration=seconds How long in secondt to diplay the label\\n\");\n fprintf(stderr, \" -r, --remove Remove the label if it is attached\\n\"); \n fprintf(stderr, \" -L, --layer=layer Which layer the label is part of. Default is physical\\n\"); \n\n exit(1); \n}\n\nint main(int argc, char **argv)\n{\n TRACE_ENTER();\n\n int c;\n string label;\n string server;\n string logProps(\"sendMessage.log.properties\");\n unsigned int fontSize=10;\n asio::ip::address address;\n Color fg=Color::black;\n Color bg=Color::white;\n uint32_t expiration=10000;\n float lat=0.0, lng=0.0, alt=0.0;\n bool remove=false;\n GUILayer layer=PHYSICAL_LAYER;\n\n while (true) \n {\n int option_index = 0;\n static struct option long_options[] = {\n {\"label\", required_argument, 0, 'l'},\n {\"server\", required_argument, 0, 's'},\n {\"node\", required_argument, 0, 'n'},\n {\"latitude\", required_argument, 0, 'x'},\n {\"longitude\", required_argument, 0, 'y'},\n {\"altitiude\", required_argument, 0, 'z'},\n {\"logProps\", required_argument, 0, 'p'},\n {\"fontSize\", required_argument, 0, 't'},\n {\"foreground\", required_argument, 0, 'f'},\n {\"background\", required_argument, 0, 'b'},\n {\"expiration\", required_argument, 0, 'e'},\n {\"remove\", no_argument, 0, 'r'},\n {\"layer\", required_argument, 0, 'L'},\n {\"help\", no_argument, 0, 'h'},\n {0, 0, 0, 0}\n };\n\n c = getopt_long(argc, argv, \"l:s:n:x:y:t:p:z:f:b:e:L:rhH?\", long_options, &option_index);\n\n if (c == -1)\n break;\n\n switch(c)\n {\n case 'l': label=optarg; break;\n case 's': server=optarg; break;\n case 'p': logProps=optarg; break;\n case 't': fontSize=lexical_cast<unsigned int>(optarg); break;\n case 'f': { bool val=fg.fromString(optarg); if (!val) { printf(\"\\nBad argument for fg color\\n\\n\"); usage(argv[0]); } break; }\n case 'b': { bool val=bg.fromString(optarg); if (!val) { printf(\"\\nBad argument for bg color\\n\\n\"); usage(argv[0]); } break; }\n case 'e': expiration=lexical_cast<uint32_t>(optarg); break;\n case 'n': \n {\n boost::system::error_code e;\n address=asio::ip::address::from_string(optarg, e);\n if (e)\n {\n fprintf(stderr, \"\\nI did not understand the \\\"node\\\" argument: %s. It should be a host address.\\n\\n\", optarg);\n usage(argv[0]);\n TRACE_EXIT_RET(EXIT_FAILURE);\n return EXIT_FAILURE;\n }\n }\n break;\n case 'x': lat=lexical_cast<float>(optarg); break; \/\/ GTL should try{}catch{} here for invalid values.\n case 'y': lng=lexical_cast<float>(optarg); break; \/\/ GTL should try{}catch{} here for invalid values.\n case 'z': alt=lexical_cast<float>(optarg); break; \/\/ GTL should try{}catch{} here for invalid values.\n case 'r': remove=true; break;\n case 'L': layer=optarg; break;\n case 'h':\n case 'H':\n case '?':\n default:\n usage(argv[0]); \n break;\n }\n }\n\n if (server==\"\" || label==\"\")\n {\n usage(argv[0]);\n exit(1); \n }\n\n \/\/\n \/\/ Now do some actual work.\n \/\/ \n LOAD_LOG_PROPS(logProps);\n\n watcher::Client client(server); \n LOG_INFO(\"Connecting to \" << server << \" and sending message.\"); \n client.addMessageHandler(SendMessageHandler::create());\n \n LabelMessagePtr lm = LabelMessagePtr(new LabelMessage);\n\n lm->label=label;\n lm->fontSize=fontSize;\n lm->fromNodeID=address;\n lm->foreground=fg;\n lm->background=bg;\n lm->expiration=expiration;\n lm->lat=lat;\n lm->lng=lng;\n lm->alt=alt;\n lm->addLabel=!remove;\n lm->layer=layer;\n\n if(!client.sendMessage(lm))\n {\n LOG_ERROR(\"Error sending label message: \" << *lm);\n TRACE_EXIT_RET(EXIT_FAILURE);\n return EXIT_FAILURE;\n }\n\n client.wait(); \n\n TRACE_EXIT_RET(EXIT_SUCCESS);\n return EXIT_SUCCESS;\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 \"kudu\/ranger\/ranger_client.h\"\n\n#include <ostream>\n#include <string>\n#include <utility>\n#include <vector>\n\n#include <gflags\/gflags.h>\n#include <glog\/logging.h>\n\n#include \"kudu\/common\/table_util.h\"\n#include \"kudu\/gutil\/macros.h\"\n#include \"kudu\/gutil\/map-util.h\"\n#include \"kudu\/gutil\/strings\/join.h\"\n#include \"kudu\/gutil\/strings\/substitute.h\"\n#include \"kudu\/ranger\/ranger.pb.h\"\n#include \"kudu\/util\/env.h\"\n#include \"kudu\/util\/flag_tags.h\"\n#include \"kudu\/util\/metrics.h\"\n#include \"kudu\/util\/path_util.h\"\n#include \"kudu\/util\/slice.h\"\n#include \"kudu\/util\/status.h\"\n\nDEFINE_string(ranger_config_path, \"\",\n \"Path to directory containing Ranger client configuration. \"\n \"Enables Ranger authorization provider. \"\n \"sentry_service_rpc_addresses must not be set if this is \"\n \"enabled.\");\nTAG_FLAG(ranger_config_path, experimental);\n\nDEFINE_string(ranger_jar_path, \"\",\n \"Path to the JAR file containing the Ranger subprocess.\");\nTAG_FLAG(ranger_jar_path, experimental);\n\nMETRIC_DEFINE_histogram(server, ranger_subprocess_execution_time_ms,\n \"Ranger subprocess execution time (ms)\",\n kudu::MetricUnit::kMilliseconds,\n \"Duration of time in ms spent executing the Ranger subprocess request, excluding \"\n \"time spent spent in the subprocess queues\",\n kudu::MetricLevel::kInfo,\n 60000LU, 1);\nMETRIC_DEFINE_histogram(server, ranger_subprocess_inbound_queue_length,\n \"Ranger subprocess inbound queue length\",\n kudu::MetricUnit::kMessages,\n \"Number of request messages in the Ranger subprocess' inbound request queue\",\n kudu::MetricLevel::kInfo,\n 1000, 1);\nMETRIC_DEFINE_histogram(server, ranger_subprocess_inbound_queue_time_ms,\n \"Ranger subprocess inbound queue time (ms)\",\n kudu::MetricUnit::kMilliseconds,\n \"Duration of time in ms spent in the Ranger subprocess' inbound request queue\",\n kudu::MetricLevel::kInfo,\n 60000LU, 1);\nMETRIC_DEFINE_histogram(server, ranger_subprocess_outbound_queue_length,\n \"Ranger subprocess outbound queue length\",\n kudu::MetricUnit::kMessages,\n \"Number of request messages in the Ranger subprocess' outbound response queue\",\n kudu::MetricLevel::kInfo,\n 1000, 1);\nMETRIC_DEFINE_histogram(server, ranger_subprocess_outbound_queue_time_ms,\n \"Ranger subprocess outbound queue time (ms)\",\n kudu::MetricUnit::kMilliseconds,\n \"Duration of time in ms spent in the Ranger subprocess' outbound response queue\",\n kudu::MetricLevel::kInfo,\n 60000LU, 1);\nMETRIC_DEFINE_histogram(server, ranger_server_inbound_queue_size_bytes,\n \"Ranger server inbound queue size (bytes)\",\n kudu::MetricUnit::kBytes,\n \"Number of bytes in the inbound response queue of the Ranger server, recorded \"\n \"at the time a new response is read from the pipe and added to the inbound queue\",\n kudu::MetricLevel::kInfo,\n 4 * 1024 * 1024, 1);\nMETRIC_DEFINE_histogram(server, ranger_server_inbound_queue_time_ms,\n \"Ranger server inbound queue time (ms)\",\n kudu::MetricUnit::kMilliseconds,\n \"Duration of time in ms spent in the Ranger server's inbound response queue\",\n kudu::MetricLevel::kInfo,\n 60000LU, 1);\nMETRIC_DEFINE_histogram(server, ranger_server_outbound_queue_size_bytes,\n \"Ranger server outbound queue size (bytes)\",\n kudu::MetricUnit::kBytes,\n \"Number of bytes in the outbound request queue of the Ranger server, recorded \"\n \"at the time a new request is added to the outbound request queue\",\n kudu::MetricLevel::kInfo,\n 4 * 1024 * 1024, 1);\nMETRIC_DEFINE_histogram(server, ranger_server_outbound_queue_time_ms,\n \"Ranger server outbound queue time (ms)\",\n kudu::MetricUnit::kMilliseconds,\n \"Duration of time in ms spent in the Ranger server's outbound request queue\",\n kudu::MetricLevel::kInfo,\n 60000LU, 1);\n\nnamespace kudu {\nnamespace ranger {\n\nusing kudu::subprocess::SubprocessMetrics;\nusing std::move;\nusing std::string;\nusing std::unordered_set;\nusing std::vector;\nusing strings::Substitute;\n\nstatic const char* kUnauthorizedAction = \"Unauthorized action\";\nstatic const char* kDenyNonRangerTableTemplate = \"Denying action on table with invalid name $0. \"\n \"Use 'kudu table rename_table' to rename it to \"\n \"a Ranger-compatible name.\";\nconst char* kMainClass = \"org.apache.kudu.subprocess.ranger.RangerSubprocessMain\";\n\n#define HISTINIT(member, x) member = METRIC_##x.Instantiate(entity)\nRangerSubprocessMetrics::RangerSubprocessMetrics(const scoped_refptr<MetricEntity>& entity) {\n HISTINIT(sp_inbound_queue_length, ranger_subprocess_inbound_queue_length);\n HISTINIT(sp_inbound_queue_time_ms, ranger_subprocess_inbound_queue_time_ms);\n HISTINIT(sp_outbound_queue_length, ranger_subprocess_outbound_queue_length);\n HISTINIT(sp_outbound_queue_time_ms, ranger_subprocess_outbound_queue_time_ms);\n HISTINIT(sp_execution_time_ms, ranger_subprocess_execution_time_ms);\n HISTINIT(server_inbound_queue_size_bytes, ranger_server_inbound_queue_size_bytes);\n HISTINIT(server_inbound_queue_time_ms, ranger_server_inbound_queue_time_ms);\n HISTINIT(server_outbound_queue_size_bytes, ranger_server_outbound_queue_size_bytes);\n HISTINIT(server_outbound_queue_time_ms, ranger_server_outbound_queue_time_ms);\n}\n#undef HISTINIT\n\nRangerClient::RangerClient(const scoped_refptr<MetricEntity>& metric_entity) :\n subprocess_({\"java\", \"-cp\", GetJavaClasspath()}, metric_entity) {}\n\nStatus RangerClient::Start() {\n VLOG(1) << \"Initializing Ranger subprocess server\";\n return subprocess_.Start();\n}\n\n\/\/ TODO(abukor): refactor to avoid code duplication\nStatus RangerClient::AuthorizeAction(const string& user_name,\n const ActionPB& action,\n const string& table_name) {\n string db;\n Slice tbl;\n\n auto s = ParseRangerTableIdentifier(table_name, &db, &tbl);\n if (PREDICT_FALSE(!s.ok())) {\n LOG(WARNING) << Substitute(kDenyNonRangerTableTemplate, table_name);\n return Status::NotAuthorized(kUnauthorizedAction);\n }\n\n RangerRequestListPB req_list;\n RangerResponseListPB resp_list;\n req_list.set_user(user_name);\n\n RangerRequestPB* req = req_list.add_requests();\n\n req->set_action(action);\n req->set_database(db);\n req->set_table(tbl.ToString());\n\n RETURN_NOT_OK(subprocess_.Execute(req_list, &resp_list));\n\n CHECK_EQ(1, resp_list.responses_size());\n if (resp_list.responses().begin()->allowed()) {\n return Status::OK();\n }\n\n LOG(WARNING) << Substitute(\"User $0 is not authorized to perform $1 on $2\",\n user_name, ActionPB_Name(action), table_name);\n return Status::NotAuthorized(kUnauthorizedAction);\n}\n\nStatus RangerClient::AuthorizeActionMultipleColumns(const string& user_name,\n const ActionPB& action,\n const string& table_name,\n unordered_set<string>* column_names) {\n DCHECK(!column_names->empty());\n\n string db;\n Slice tbl;\n\n auto s = ParseRangerTableIdentifier(table_name, &db, &tbl);\n if (PREDICT_FALSE(!s.ok())) {\n LOG(WARNING) << Substitute(kDenyNonRangerTableTemplate, table_name);\n return Status::NotAuthorized(kUnauthorizedAction);\n }\n\n RangerRequestListPB req_list;\n RangerResponseListPB resp_list;\n req_list.set_user(user_name);\n\n for (const auto& col : *column_names) {\n auto req = req_list.add_requests();\n req->set_action(action);\n req->set_database(db);\n req->set_table(tbl.ToString());\n req->set_column(col);\n }\n\n RETURN_NOT_OK(subprocess_.Execute(req_list, &resp_list));\n\n DCHECK_EQ(column_names->size(), resp_list.responses_size());\n\n unordered_set<string> allowed_columns;\n for (auto i = 0; i < req_list.requests_size(); ++i) {\n if (resp_list.responses(i).allowed()) {\n EmplaceOrDie(&allowed_columns, move(req_list.requests(i).column()));\n }\n }\n\n if (allowed_columns.empty()) {\n LOG(WARNING) << Substitute(\"User $0 is not authorized to perform $1 on table $2\",\n user_name, ActionPB_Name(action), table_name);\n return Status::NotAuthorized(kUnauthorizedAction);\n }\n\n *column_names = move(allowed_columns);\n\n return Status::OK();\n}\n\nStatus RangerClient::AuthorizeActionMultipleTables(const string& user_name,\n const ActionPB& action,\n unordered_set<string>* table_names) {\n if (table_names->empty()) {\n return Status::InvalidArgument(\"Empty set of tables\");\n }\n\n RangerRequestListPB req_list;\n RangerResponseListPB resp_list;\n req_list.set_user(user_name);\n\n vector<string> orig_table_names;\n\n for (const auto& table : *table_names) {\n string db;\n Slice tbl;\n\n auto s = ParseRangerTableIdentifier(table, &db, &tbl);\n if (PREDICT_TRUE(s.ok())) {\n orig_table_names.emplace_back(table);\n\n auto req = req_list.add_requests();\n req->set_action(action);\n req->set_database(db);\n req->set_table(tbl.ToString());\n } else {\n LOG(WARNING) << Substitute(kDenyNonRangerTableTemplate, table);\n }\n }\n\n RETURN_NOT_OK(subprocess_.Execute(req_list, &resp_list));\n\n DCHECK_EQ(orig_table_names.size(), resp_list.responses_size());\n\n unordered_set<string> allowed_tables;\n for (auto i = 0; i < orig_table_names.size(); ++i) {\n if (resp_list.responses(i).allowed()) {\n EmplaceOrDie(&allowed_tables, move(orig_table_names[i]));\n }\n }\n\n if (allowed_tables.empty()) {\n LOG(WARNING) << Substitute(\"User $0 is not authorized to perform $1 on $2 tables\",\n user_name, ActionPB_Name(action), table_names->size());\n return Status::NotAuthorized(kUnauthorizedAction);\n }\n\n *table_names = move(allowed_tables);\n\n return Status::OK();\n}\n\nStatus RangerClient::AuthorizeActions(const string& user_name,\n const string& table_name,\n unordered_set<ActionPB, ActionHash>* actions) {\n DCHECK(!actions->empty());\n\n string db;\n Slice tbl;\n\n auto s = ParseRangerTableIdentifier(table_name, &db, &tbl);\n if (PREDICT_FALSE(!s.ok())) {\n LOG(WARNING) << Substitute(kDenyNonRangerTableTemplate, table_name);\n return Status::NotAuthorized(kUnauthorizedAction);\n }\n\n RangerRequestListPB req_list;\n RangerResponseListPB resp_list;\n req_list.set_user(user_name);\n\n for (const auto& action : *actions) {\n auto req = req_list.add_requests();\n req->set_action(action);\n req->set_database(db);\n req->set_table(tbl.ToString());\n }\n\n RETURN_NOT_OK(subprocess_.Execute(req_list, &resp_list));\n\n DCHECK_EQ(actions->size(), resp_list.responses_size());\n\n unordered_set<ActionPB, ActionHash> allowed_actions;\n for (auto i = 0; i < req_list.requests_size(); ++i) {\n if (resp_list.responses(i).allowed()) {\n EmplaceOrDie(&allowed_actions, move(req_list.requests(i).action()));\n }\n }\n\n if (allowed_actions.empty()) {\n LOG(WARNING) << Substitute(\"User $0 is not authorized to perform actions $1 on table $2\",\n user_name, JoinMapped(*actions, ActionPB_Name, \", \"), table_name);\n return Status::NotAuthorized(kUnauthorizedAction);\n }\n\n *actions = move(allowed_actions);\n\n return Status::OK();\n}\n\nstring RangerClient::GetJavaClasspath() {\n Env* env = Env::Default();\n string exe;\n CHECK_OK(env->GetExecutablePath(&exe));\n const string bin_dir = DirName(exe);\n string jar_path = FLAGS_ranger_jar_path.empty() ?\n JoinPathSegments(bin_dir, \"kudu-subprocess.jar\") :\n FLAGS_ranger_jar_path;\n\n return Substitute(\"$0:$1\", jar_path, FLAGS_ranger_config_path);\n}\n\n} \/\/ namespace ranger\n} \/\/ namespace kudu\n<commit_msg>[ranger] parameterize the Java binary path for the subprocess<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 \"kudu\/ranger\/ranger_client.h\"\n\n#include <ostream>\n#include <string>\n#include <utility>\n#include <vector>\n\n#include <gflags\/gflags.h>\n#include <glog\/logging.h>\n\n#include \"kudu\/common\/table_util.h\"\n#include \"kudu\/gutil\/macros.h\"\n#include \"kudu\/gutil\/map-util.h\"\n#include \"kudu\/gutil\/strings\/join.h\"\n#include \"kudu\/gutil\/strings\/substitute.h\"\n#include \"kudu\/ranger\/ranger.pb.h\"\n#include \"kudu\/util\/env.h\"\n#include \"kudu\/util\/flag_tags.h\"\n#include \"kudu\/util\/flag_validators.h\"\n#include \"kudu\/util\/metrics.h\"\n#include \"kudu\/util\/path_util.h\"\n#include \"kudu\/util\/slice.h\"\n#include \"kudu\/util\/status.h\"\n#include \"kudu\/util\/subprocess.h\"\n\nDEFINE_string(ranger_java_path, \"java\",\n \"The path where the Java binary was installed. If \"\n \"the value isn't an absolute path, it will be evaluated \"\n \"using the Kudu user's PATH.\");\nTAG_FLAG(ranger_java_path, experimental);\n\nDEFINE_string(ranger_config_path, \"\",\n \"Path to directory containing Ranger client configuration. \"\n \"Enables Ranger authorization provider. \"\n \"sentry_service_rpc_addresses must not be set if this is \"\n \"enabled.\");\nTAG_FLAG(ranger_config_path, experimental);\n\nDEFINE_string(ranger_jar_path, \"\",\n \"Path to the JAR file containing the Ranger subprocess.\");\nTAG_FLAG(ranger_jar_path, experimental);\n\nMETRIC_DEFINE_histogram(server, ranger_subprocess_execution_time_ms,\n \"Ranger subprocess execution time (ms)\",\n kudu::MetricUnit::kMilliseconds,\n \"Duration of time in ms spent executing the Ranger subprocess request, excluding \"\n \"time spent spent in the subprocess queues\",\n kudu::MetricLevel::kInfo,\n 60000LU, 1);\nMETRIC_DEFINE_histogram(server, ranger_subprocess_inbound_queue_length,\n \"Ranger subprocess inbound queue length\",\n kudu::MetricUnit::kMessages,\n \"Number of request messages in the Ranger subprocess' inbound request queue\",\n kudu::MetricLevel::kInfo,\n 1000, 1);\nMETRIC_DEFINE_histogram(server, ranger_subprocess_inbound_queue_time_ms,\n \"Ranger subprocess inbound queue time (ms)\",\n kudu::MetricUnit::kMilliseconds,\n \"Duration of time in ms spent in the Ranger subprocess' inbound request queue\",\n kudu::MetricLevel::kInfo,\n 60000LU, 1);\nMETRIC_DEFINE_histogram(server, ranger_subprocess_outbound_queue_length,\n \"Ranger subprocess outbound queue length\",\n kudu::MetricUnit::kMessages,\n \"Number of request messages in the Ranger subprocess' outbound response queue\",\n kudu::MetricLevel::kInfo,\n 1000, 1);\nMETRIC_DEFINE_histogram(server, ranger_subprocess_outbound_queue_time_ms,\n \"Ranger subprocess outbound queue time (ms)\",\n kudu::MetricUnit::kMilliseconds,\n \"Duration of time in ms spent in the Ranger subprocess' outbound response queue\",\n kudu::MetricLevel::kInfo,\n 60000LU, 1);\nMETRIC_DEFINE_histogram(server, ranger_server_inbound_queue_size_bytes,\n \"Ranger server inbound queue size (bytes)\",\n kudu::MetricUnit::kBytes,\n \"Number of bytes in the inbound response queue of the Ranger server, recorded \"\n \"at the time a new response is read from the pipe and added to the inbound queue\",\n kudu::MetricLevel::kInfo,\n 4 * 1024 * 1024, 1);\nMETRIC_DEFINE_histogram(server, ranger_server_inbound_queue_time_ms,\n \"Ranger server inbound queue time (ms)\",\n kudu::MetricUnit::kMilliseconds,\n \"Duration of time in ms spent in the Ranger server's inbound response queue\",\n kudu::MetricLevel::kInfo,\n 60000LU, 1);\nMETRIC_DEFINE_histogram(server, ranger_server_outbound_queue_size_bytes,\n \"Ranger server outbound queue size (bytes)\",\n kudu::MetricUnit::kBytes,\n \"Number of bytes in the outbound request queue of the Ranger server, recorded \"\n \"at the time a new request is added to the outbound request queue\",\n kudu::MetricLevel::kInfo,\n 4 * 1024 * 1024, 1);\nMETRIC_DEFINE_histogram(server, ranger_server_outbound_queue_time_ms,\n \"Ranger server outbound queue time (ms)\",\n kudu::MetricUnit::kMilliseconds,\n \"Duration of time in ms spent in the Ranger server's outbound request queue\",\n kudu::MetricLevel::kInfo,\n 60000LU, 1);\n\nnamespace kudu {\nnamespace ranger {\n\nusing kudu::subprocess::SubprocessMetrics;\nusing std::move;\nusing std::string;\nusing std::unordered_set;\nusing std::vector;\nusing strings::Substitute;\n\nstatic bool ValidateRangerJavaPath() {\n \/\/ First, check the specified path.\n if (!FLAGS_ranger_config_path.empty() &&\n !Env::Default()->FileExists(FLAGS_ranger_java_path)) {\n \/\/ Otherwise, since the specified path is not absolute, check if\n \/\/ the Java binary is on the PATH.\n string p;\n Status s = Subprocess::Call({ \"which\", FLAGS_ranger_java_path }, \"\", &p);\n if (!s.ok()) {\n LOG(ERROR) << Substitute(\"FLAGS_ranger_java_path has invalid java binary path: $0\",\n FLAGS_ranger_java_path);\n return false;\n }\n }\n return true;\n}\nGROUP_FLAG_VALIDATOR(ranger_java_path_flags, ValidateRangerJavaPath);\n\nstatic const char* kUnauthorizedAction = \"Unauthorized action\";\nstatic const char* kDenyNonRangerTableTemplate = \"Denying action on table with invalid name $0. \"\n \"Use 'kudu table rename_table' to rename it to \"\n \"a Ranger-compatible name.\";\nconst char* kMainClass = \"org.apache.kudu.subprocess.ranger.RangerSubprocessMain\";\n\n#define HISTINIT(member, x) member = METRIC_##x.Instantiate(entity)\nRangerSubprocessMetrics::RangerSubprocessMetrics(const scoped_refptr<MetricEntity>& entity) {\n HISTINIT(sp_inbound_queue_length, ranger_subprocess_inbound_queue_length);\n HISTINIT(sp_inbound_queue_time_ms, ranger_subprocess_inbound_queue_time_ms);\n HISTINIT(sp_outbound_queue_length, ranger_subprocess_outbound_queue_length);\n HISTINIT(sp_outbound_queue_time_ms, ranger_subprocess_outbound_queue_time_ms);\n HISTINIT(sp_execution_time_ms, ranger_subprocess_execution_time_ms);\n HISTINIT(server_inbound_queue_size_bytes, ranger_server_inbound_queue_size_bytes);\n HISTINIT(server_inbound_queue_time_ms, ranger_server_inbound_queue_time_ms);\n HISTINIT(server_outbound_queue_size_bytes, ranger_server_outbound_queue_size_bytes);\n HISTINIT(server_outbound_queue_time_ms, ranger_server_outbound_queue_time_ms);\n}\n#undef HISTINIT\n\nRangerClient::RangerClient(const scoped_refptr<MetricEntity>& metric_entity) :\n subprocess_({ FLAGS_ranger_java_path, \"-cp\", GetJavaClasspath(), kMainClass },\n metric_entity) {}\n\nStatus RangerClient::Start() {\n VLOG(1) << \"Initializing Ranger subprocess server\";\n return subprocess_.Start();\n}\n\n\/\/ TODO(abukor): refactor to avoid code duplication\nStatus RangerClient::AuthorizeAction(const string& user_name,\n const ActionPB& action,\n const string& table_name) {\n string db;\n Slice tbl;\n\n auto s = ParseRangerTableIdentifier(table_name, &db, &tbl);\n if (PREDICT_FALSE(!s.ok())) {\n LOG(WARNING) << Substitute(kDenyNonRangerTableTemplate, table_name);\n return Status::NotAuthorized(kUnauthorizedAction);\n }\n\n RangerRequestListPB req_list;\n RangerResponseListPB resp_list;\n req_list.set_user(user_name);\n\n RangerRequestPB* req = req_list.add_requests();\n\n req->set_action(action);\n req->set_database(db);\n req->set_table(tbl.ToString());\n\n RETURN_NOT_OK(subprocess_.Execute(req_list, &resp_list));\n\n CHECK_EQ(1, resp_list.responses_size());\n if (resp_list.responses().begin()->allowed()) {\n return Status::OK();\n }\n\n LOG(WARNING) << Substitute(\"User $0 is not authorized to perform $1 on $2\",\n user_name, ActionPB_Name(action), table_name);\n return Status::NotAuthorized(kUnauthorizedAction);\n}\n\nStatus RangerClient::AuthorizeActionMultipleColumns(const string& user_name,\n const ActionPB& action,\n const string& table_name,\n unordered_set<string>* column_names) {\n DCHECK(!column_names->empty());\n\n string db;\n Slice tbl;\n\n auto s = ParseRangerTableIdentifier(table_name, &db, &tbl);\n if (PREDICT_FALSE(!s.ok())) {\n LOG(WARNING) << Substitute(kDenyNonRangerTableTemplate, table_name);\n return Status::NotAuthorized(kUnauthorizedAction);\n }\n\n RangerRequestListPB req_list;\n RangerResponseListPB resp_list;\n req_list.set_user(user_name);\n\n for (const auto& col : *column_names) {\n auto req = req_list.add_requests();\n req->set_action(action);\n req->set_database(db);\n req->set_table(tbl.ToString());\n req->set_column(col);\n }\n\n RETURN_NOT_OK(subprocess_.Execute(req_list, &resp_list));\n\n DCHECK_EQ(column_names->size(), resp_list.responses_size());\n\n unordered_set<string> allowed_columns;\n for (auto i = 0; i < req_list.requests_size(); ++i) {\n if (resp_list.responses(i).allowed()) {\n EmplaceOrDie(&allowed_columns, move(req_list.requests(i).column()));\n }\n }\n\n if (allowed_columns.empty()) {\n LOG(WARNING) << Substitute(\"User $0 is not authorized to perform $1 on table $2\",\n user_name, ActionPB_Name(action), table_name);\n return Status::NotAuthorized(kUnauthorizedAction);\n }\n\n *column_names = move(allowed_columns);\n\n return Status::OK();\n}\n\nStatus RangerClient::AuthorizeActionMultipleTables(const string& user_name,\n const ActionPB& action,\n unordered_set<string>* table_names) {\n if (table_names->empty()) {\n return Status::InvalidArgument(\"Empty set of tables\");\n }\n\n RangerRequestListPB req_list;\n RangerResponseListPB resp_list;\n req_list.set_user(user_name);\n\n vector<string> orig_table_names;\n\n for (const auto& table : *table_names) {\n string db;\n Slice tbl;\n\n auto s = ParseRangerTableIdentifier(table, &db, &tbl);\n if (PREDICT_TRUE(s.ok())) {\n orig_table_names.emplace_back(table);\n\n auto req = req_list.add_requests();\n req->set_action(action);\n req->set_database(db);\n req->set_table(tbl.ToString());\n } else {\n LOG(WARNING) << Substitute(kDenyNonRangerTableTemplate, table);\n }\n }\n\n RETURN_NOT_OK(subprocess_.Execute(req_list, &resp_list));\n\n DCHECK_EQ(orig_table_names.size(), resp_list.responses_size());\n\n unordered_set<string> allowed_tables;\n for (auto i = 0; i < orig_table_names.size(); ++i) {\n if (resp_list.responses(i).allowed()) {\n EmplaceOrDie(&allowed_tables, move(orig_table_names[i]));\n }\n }\n\n if (allowed_tables.empty()) {\n LOG(WARNING) << Substitute(\"User $0 is not authorized to perform $1 on $2 tables\",\n user_name, ActionPB_Name(action), table_names->size());\n return Status::NotAuthorized(kUnauthorizedAction);\n }\n\n *table_names = move(allowed_tables);\n\n return Status::OK();\n}\n\nStatus RangerClient::AuthorizeActions(const string& user_name,\n const string& table_name,\n unordered_set<ActionPB, ActionHash>* actions) {\n DCHECK(!actions->empty());\n\n string db;\n Slice tbl;\n\n auto s = ParseRangerTableIdentifier(table_name, &db, &tbl);\n if (PREDICT_FALSE(!s.ok())) {\n LOG(WARNING) << Substitute(kDenyNonRangerTableTemplate, table_name);\n return Status::NotAuthorized(kUnauthorizedAction);\n }\n\n RangerRequestListPB req_list;\n RangerResponseListPB resp_list;\n req_list.set_user(user_name);\n\n for (const auto& action : *actions) {\n auto req = req_list.add_requests();\n req->set_action(action);\n req->set_database(db);\n req->set_table(tbl.ToString());\n }\n\n RETURN_NOT_OK(subprocess_.Execute(req_list, &resp_list));\n\n DCHECK_EQ(actions->size(), resp_list.responses_size());\n\n unordered_set<ActionPB, ActionHash> allowed_actions;\n for (auto i = 0; i < req_list.requests_size(); ++i) {\n if (resp_list.responses(i).allowed()) {\n EmplaceOrDie(&allowed_actions, move(req_list.requests(i).action()));\n }\n }\n\n if (allowed_actions.empty()) {\n LOG(WARNING) << Substitute(\"User $0 is not authorized to perform actions $1 on table $2\",\n user_name, JoinMapped(*actions, ActionPB_Name, \", \"), table_name);\n return Status::NotAuthorized(kUnauthorizedAction);\n }\n\n *actions = move(allowed_actions);\n\n return Status::OK();\n}\n\nstring RangerClient::GetJavaClasspath() {\n Env* env = Env::Default();\n string exe;\n CHECK_OK(env->GetExecutablePath(&exe));\n const string bin_dir = DirName(exe);\n string jar_path = FLAGS_ranger_jar_path.empty() ?\n JoinPathSegments(bin_dir, \"kudu-subprocess.jar\") :\n FLAGS_ranger_jar_path;\n\n return Substitute(\"$0:$1\", jar_path, FLAGS_ranger_config_path);\n}\n\n} \/\/ namespace ranger\n} \/\/ namespace kudu\n<|endoftext|>"} {"text":"<commit_before>\/***************************************************************\n *\n * Copyright (C) 2009-2011 Red Hat, Inc.\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\"); you\n * may not use this file except in compliance with the License. You may\n * obtain a copy of the License at\n *\n * http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n *\n ***************************************************************\/\n\n#include <axutil_error_default.h>\n#include <axutil_log_default.h>\n#include <axutil_thread_pool.h>\n#include <axiom_xml_reader.h>\n#include <axutil_file_handler.h>\n\n#include \"Axis2SoapProvider.h\"\n\nusing namespace aviary::soap;\n\nAxis2SoapProvider::Axis2SoapProvider(int _log_level, const char* _log_file, const char* _repo_path)\n{\n if (_log_file) {\n m_log_file = _log_file;\n }\n if (_repo_path) {\n m_repo_path = _repo_path;\n }\n m_log_level = axutil_log_levels_t(_log_level);\n m_env = NULL;\n m_http_server = NULL;\n m_svr_thread = NULL;\n m_init = false;\n m_http_socket_read_timeout = AXIS2_HTTP_DEFAULT_SO_TIMEOUT;\n}\n\nAxis2SoapProvider::~Axis2SoapProvider()\n{\n if (m_http_server) {\n axis2_transport_receiver_free(m_http_server, m_env);\n }\n \n if (m_svr_thread) {\n axis2_http_svr_thread_free(m_svr_thread, m_env);\n }\n\n if (m_env) {\n axutil_env_free(m_env);\n }\n\n axiom_xml_reader_cleanup();\n\n}\n\nbool\nAxis2SoapProvider::init(int _port, int _read_timeout, std::string& _error)\n{\n m_http_socket_read_timeout = _read_timeout;\n \n if (m_log_file.empty() || m_repo_path.empty()) {\n _error = \"Log file or repo path is NULL\";\n return false;\n }\n\n if (!m_init) {\n axutil_allocator_t* allocator = axutil_allocator_init(NULL);\n axutil_error_t *error = axutil_error_create(allocator);\n axutil_log_t *log = axutil_log_create(allocator, NULL, m_log_file.c_str());\n\n \/\/ TODO: not sure we need a TP but don't wanted to get tripped up by a NP\n \/\/ deeper in the stack\n axutil_thread_pool_t *thread_pool = axutil_thread_pool_init(allocator);\n axiom_xml_reader_init();\n m_env = axutil_env_create(allocator);\n axutil_error_init();\n\n m_env = axutil_env_create_with_error_log_thread_pool(allocator, error, log, thread_pool);\n m_env->log->level = m_log_level;\n\n axis2_status_t status = axutil_file_handler_access(m_repo_path.c_str(), AXIS2_R_OK);\n\n if (status != AXIS2_SUCCESS) {\n\t\t\t_error = m_repo_path;\n\t\t\t_error += \" does not exist or insufficient permissions\";\n AXIS2_LOG_ERROR(m_env->log, AXIS2_LOG_SI,_error.c_str());\n return m_init;\n }\n\n m_http_server = axis2_http_server_create_with_file(m_env, m_repo_path.c_str(), _port);\n if (!m_http_server) {\n\t\t\t_error = AXIS2_ERROR_GET_MESSAGE(m_env->error);\n AXIS2_LOG_ERROR(m_env->log, AXIS2_LOG_SI, \"HTTP server create failed: %d: %s\",\n m_env->error->error_number,_error.c_str());\n return m_init;\n }\n\n m_svr_thread = createReceiver(m_env,m_http_server,_error); \n if (!m_svr_thread) {\n\t\t\t_error = AXIS2_ERROR_GET_MESSAGE(m_env->error);\n\t\t\tAXIS2_LOG_ERROR(m_env->log, AXIS2_LOG_SI, \"HTTP receiver create failed: %d: %s\",\n m_env->error->error_number,_error.c_str());\n return m_init;\n }\n\n m_init = true;\n }\n\n return m_init;\n\n}\n\naxis2_http_svr_thread_t*\nAxis2SoapProvider::createReceiver(axutil_env_t* _env, axis2_transport_receiver_t* _server, std::string& \/*_error *\/)\n{\n\n axis2_http_server_impl_t *server_impl = NULL;\n axis2_http_worker_t *worker = NULL;\n\n server_impl = AXIS2_INTF_TO_IMPL(_server);\n server_impl->svr_thread = axis2_http_svr_thread_create(_env, server_impl->port);\n\n \/\/ shouldn't bother checking this for ST but we'll play along\n if(!server_impl->svr_thread) {\n AXIS2_LOG_ERROR(_env->log, AXIS2_LOG_SI, \"unable to create server thread for port %d\",\n server_impl->port);\n return NULL;\n }\n\n worker = axis2_http_worker_create(_env, server_impl->conf_ctx);\n if(!worker) {\n AXIS2_LOG_ERROR(_env->log, AXIS2_LOG_SI, \"axis2 http worker creation failed\");\n axis2_http_svr_thread_free(server_impl->svr_thread, _env);\n server_impl->svr_thread = NULL;\n return NULL;\n }\n\n axis2_http_worker_set_svr_port(worker, _env, server_impl->port);\n axis2_http_svr_thread_set_worker(server_impl->svr_thread, _env, worker);\n return server_impl->svr_thread;\n\n}\n\nSOCKET\nAxis2SoapProvider::getListenerSocket()\n{\n SOCKET socket = INVALID_SOCKET;\n if (m_svr_thread) {\n socket = m_svr_thread->listen_socket;\n }\n return socket;\n}\n\nbool\nAxis2SoapProvider::processRequest(std::string& _error)\n{\n if (!m_init) {\n _error = \"Axis2SoapPovider has not been initialized yet\";\n return false;\n }\n else {\n\n AXIS2_ENV_CHECK(m_env, AXIS2_FAILURE);\n\n int socket = INVALID_SOCKET;\n axis2_http_svr_thd_args_t *arg_list = NULL;\n\n if (INVALID_SOCKET == (socket = this->processAccept())) {\n _error = \"Failed to accept connection\";\n return false;\n }\n\n if(!m_svr_thread->worker)\n {\n AXIS2_LOG_ERROR(m_env->log, AXIS2_LOG_SI,\n \"Worker not ready yet. Cannot serve the request\");\n axutil_network_handler_close_socket(m_env, socket);\n return false;\n }\n\n arg_list = (axis2_http_svr_thd_args_t *)AXIS2_MALLOC(m_env->allocator, sizeof(axis2_http_svr_thd_args_t));\n if(!arg_list)\n {\n AXIS2_LOG_ERROR(m_env->log, AXIS2_LOG_SI,\n \"Memory allocation error in the svr thread loop\");\n return false;\n }\n\n arg_list->env = (axutil_env_t *)m_env;\n arg_list->socket = socket;\n arg_list->worker = m_svr_thread->worker;\n\n \/\/ single-threaded for DC\n invokeWorker(NULL, (void *)arg_list);\n }\n\n return true;\n}\n\nSOCKET Axis2SoapProvider::processAccept() {\n return (SOCKET)axutil_network_handler_svr_socket_accept(m_env, m_svr_thread->listen_socket);\n}\n\nvoid* Axis2SoapProvider::createServerConnection(axutil_env_t *thread_env, SOCKET socket) {\n return axis2_simple_http_svr_conn_create(thread_env, (SOCKET)socket);\n}\n\nvoid *AXIS2_THREAD_FUNC\nAxis2SoapProvider::invokeWorker(\n axutil_thread_t * \/*thd *\/,\n void *data)\n{\n struct AXIS2_PLATFORM_TIMEB t1, t2;\n axis2_simple_http_svr_conn_t *svr_conn = NULL;\n axis2_http_simple_request_t *request = NULL;\n int millisecs = 0;\n double secs = 0;\n axis2_http_worker_t *tmp = NULL;\n axis2_status_t status = AXIS2_FAILURE;\n axutil_env_t *env = NULL;\n axis2_socket_t socket;\n axutil_env_t *thread_env = NULL;\n axis2_http_svr_thd_args_t *arg_list = NULL;\n\n#ifndef WIN32\n#ifdef AXIS2_SVR_MULTI_THREADED\n signal(SIGPIPE, SIG_IGN);\n#endif\n#endif\n\n if(!data)\n {\n return NULL;\n }\n arg_list = (axis2_http_svr_thd_args_t *)data;\n\n env = arg_list->env;\n thread_env = axutil_init_thread_env(env);\n\n IF_AXIS2_LOG_DEBUG_ENABLED(env->log)\n {\n AXIS2_PLATFORM_GET_TIME_IN_MILLIS(&t1);\n }\n\n socket = arg_list->socket;\n svr_conn = (axis2_simple_http_svr_conn_t*)(this->createServerConnection(thread_env, (int)socket));\n \n if(!svr_conn)\n {\n AXIS2_LOG_ERROR(env->log, AXIS2_LOG_SI, \"creating simple_http_svr_connection failed\");\n return NULL;\n }\n\n axis2_simple_http_svr_conn_set_rcv_timeout(svr_conn, thread_env, m_http_socket_read_timeout);\n\n \/* read HTTPMethod, URL, HTTP Version and http headers. Leave the remaining in the stream *\/\n request = axis2_simple_http_svr_conn_read_request(svr_conn, thread_env);\n if(!request)\n {\n AXIS2_LOG_ERROR(env->log, AXIS2_LOG_SI, \"Could not create request\");\n return NULL;\n }\n\n tmp = arg_list->worker;\n status = axis2_http_worker_process_request(tmp, thread_env, svr_conn, request);\n axis2_simple_http_svr_conn_free(svr_conn, thread_env);\n axis2_http_simple_request_free(request, thread_env);\n\n IF_AXIS2_LOG_DEBUG_ENABLED(env->log)\n {\n AXIS2_PLATFORM_GET_TIME_IN_MILLIS(&t2);\n millisecs = t2.millitm - t1.millitm;\n secs = difftime(t2.time, t1.time);\n if(millisecs < 0)\n {\n millisecs += 1000;\n secs--;\n }\n secs += millisecs \/ 1000.0;\n\n AXIS2_LOG_DEBUG(thread_env->log, AXIS2_LOG_SI, \"Request processed in %.3f seconds\", secs);\n }\n\n if(status == AXIS2_SUCCESS) {\n AXIS2_LOG_DEBUG(thread_env->log, AXIS2_LOG_SI, \"Request served successfully\");\n }\n else {\n AXIS2_LOG_WARNING(thread_env->log, AXIS2_LOG_SI, \"Error occurred in processing request \");\n }\n\n \/\/ just ST here\n AXIS2_FREE(thread_env->allocator, arg_list);\n axutil_free_thread_env(thread_env);\n thread_env = NULL;\n\n return NULL;\n}\n<commit_msg>Connection cleanup on failed\/timeout reads in aviary contrib to fail faster for clients<commit_after>\/***************************************************************\n *\n * Copyright (C) 2009-2011 Red Hat, Inc.\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\"); you\n * may not use this file except in compliance with the License. You may\n * obtain a copy of the License at\n *\n * http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n *\n ***************************************************************\/\n\n#include <axutil_error_default.h>\n#include <axutil_log_default.h>\n#include <axutil_thread_pool.h>\n#include <axiom_xml_reader.h>\n#include <axutil_file_handler.h>\n\n#include \"Axis2SoapProvider.h\"\n\nusing namespace aviary::soap;\n\nAxis2SoapProvider::Axis2SoapProvider(int _log_level, const char* _log_file, const char* _repo_path)\n{\n if (_log_file) {\n m_log_file = _log_file;\n }\n if (_repo_path) {\n m_repo_path = _repo_path;\n }\n m_log_level = axutil_log_levels_t(_log_level);\n m_env = NULL;\n m_http_server = NULL;\n m_svr_thread = NULL;\n m_init = false;\n m_http_socket_read_timeout = AXIS2_HTTP_DEFAULT_SO_TIMEOUT;\n}\n\nAxis2SoapProvider::~Axis2SoapProvider()\n{\n if (m_http_server) {\n axis2_transport_receiver_free(m_http_server, m_env);\n }\n \n if (m_svr_thread) {\n axis2_http_svr_thread_free(m_svr_thread, m_env);\n }\n\n if (m_env) {\n axutil_env_free(m_env);\n }\n\n axiom_xml_reader_cleanup();\n\n}\n\nbool\nAxis2SoapProvider::init(int _port, int _read_timeout, std::string& _error)\n{\n m_http_socket_read_timeout = _read_timeout;\n \n if (m_log_file.empty() || m_repo_path.empty()) {\n _error = \"Log file or repo path is NULL\";\n return false;\n }\n\n if (!m_init) {\n axutil_allocator_t* allocator = axutil_allocator_init(NULL);\n axutil_error_t *error = axutil_error_create(allocator);\n axutil_log_t *log = axutil_log_create(allocator, NULL, m_log_file.c_str());\n\n \/\/ TODO: not sure we need a TP but don't wanted to get tripped up by a NP\n \/\/ deeper in the stack\n axutil_thread_pool_t *thread_pool = axutil_thread_pool_init(allocator);\n axiom_xml_reader_init();\n m_env = axutil_env_create(allocator);\n axutil_error_init();\n\n m_env = axutil_env_create_with_error_log_thread_pool(allocator, error, log, thread_pool);\n m_env->log->level = m_log_level;\n\n axis2_status_t status = axutil_file_handler_access(m_repo_path.c_str(), AXIS2_R_OK);\n\n if (status != AXIS2_SUCCESS) {\n\t\t\t_error = m_repo_path;\n\t\t\t_error += \" does not exist or insufficient permissions\";\n AXIS2_LOG_ERROR(m_env->log, AXIS2_LOG_SI,_error.c_str());\n return m_init;\n }\n\n m_http_server = axis2_http_server_create_with_file(m_env, m_repo_path.c_str(), _port);\n if (!m_http_server) {\n\t\t\t_error = AXIS2_ERROR_GET_MESSAGE(m_env->error);\n AXIS2_LOG_ERROR(m_env->log, AXIS2_LOG_SI, \"HTTP server create failed: %d: %s\",\n m_env->error->error_number,_error.c_str());\n return m_init;\n }\n\n m_svr_thread = createReceiver(m_env,m_http_server,_error); \n if (!m_svr_thread) {\n\t\t\t_error = AXIS2_ERROR_GET_MESSAGE(m_env->error);\n\t\t\tAXIS2_LOG_ERROR(m_env->log, AXIS2_LOG_SI, \"HTTP receiver create failed: %d: %s\",\n m_env->error->error_number,_error.c_str());\n return m_init;\n }\n\n m_init = true;\n }\n\n return m_init;\n\n}\n\naxis2_http_svr_thread_t*\nAxis2SoapProvider::createReceiver(axutil_env_t* _env, axis2_transport_receiver_t* _server, std::string& \/*_error *\/)\n{\n\n axis2_http_server_impl_t *server_impl = NULL;\n axis2_http_worker_t *worker = NULL;\n\n server_impl = AXIS2_INTF_TO_IMPL(_server);\n server_impl->svr_thread = axis2_http_svr_thread_create(_env, server_impl->port);\n\n \/\/ shouldn't bother checking this for ST but we'll play along\n if(!server_impl->svr_thread) {\n AXIS2_LOG_ERROR(_env->log, AXIS2_LOG_SI, \"unable to create server thread for port %d\",\n server_impl->port);\n return NULL;\n }\n\n worker = axis2_http_worker_create(_env, server_impl->conf_ctx);\n if(!worker) {\n AXIS2_LOG_ERROR(_env->log, AXIS2_LOG_SI, \"axis2 http worker creation failed\");\n axis2_http_svr_thread_free(server_impl->svr_thread, _env);\n server_impl->svr_thread = NULL;\n return NULL;\n }\n\n axis2_http_worker_set_svr_port(worker, _env, server_impl->port);\n axis2_http_svr_thread_set_worker(server_impl->svr_thread, _env, worker);\n return server_impl->svr_thread;\n\n}\n\nSOCKET\nAxis2SoapProvider::getListenerSocket()\n{\n SOCKET socket = INVALID_SOCKET;\n if (m_svr_thread) {\n socket = m_svr_thread->listen_socket;\n }\n return socket;\n}\n\nbool\nAxis2SoapProvider::processRequest(std::string& _error)\n{\n if (!m_init) {\n _error = \"Axis2SoapPovider has not been initialized yet\";\n return false;\n }\n else {\n\n AXIS2_ENV_CHECK(m_env, AXIS2_FAILURE);\n\n int socket = INVALID_SOCKET;\n axis2_http_svr_thd_args_t *arg_list = NULL;\n\n if (INVALID_SOCKET == (socket = this->processAccept())) {\n _error = \"Failed to accept connection\";\n return false;\n }\n\n if(!m_svr_thread->worker)\n {\n AXIS2_LOG_ERROR(m_env->log, AXIS2_LOG_SI,\n \"Worker not ready yet. Cannot serve the request\");\n axutil_network_handler_close_socket(m_env, socket);\n return false;\n }\n\n arg_list = (axis2_http_svr_thd_args_t *)AXIS2_MALLOC(m_env->allocator, sizeof(axis2_http_svr_thd_args_t));\n if(!arg_list)\n {\n AXIS2_LOG_ERROR(m_env->log, AXIS2_LOG_SI,\n \"Memory allocation error in the svr thread loop\");\n return false;\n }\n\n arg_list->env = (axutil_env_t *)m_env;\n arg_list->socket = socket;\n arg_list->worker = m_svr_thread->worker;\n\n \/\/ single-threaded for DC\n invokeWorker(NULL, (void *)arg_list);\n }\n\n return true;\n}\n\nSOCKET Axis2SoapProvider::processAccept() {\n return (SOCKET)axutil_network_handler_svr_socket_accept(m_env, m_svr_thread->listen_socket);\n}\n\nvoid* Axis2SoapProvider::createServerConnection(axutil_env_t *thread_env, SOCKET socket) {\n return axis2_simple_http_svr_conn_create(thread_env, (SOCKET)socket);\n}\n\nvoid *AXIS2_THREAD_FUNC\nAxis2SoapProvider::invokeWorker(\n axutil_thread_t * \/*thd *\/,\n void *data)\n{\n struct AXIS2_PLATFORM_TIMEB t1, t2;\n axis2_simple_http_svr_conn_t *svr_conn = NULL;\n axis2_http_simple_request_t *request = NULL;\n int millisecs = 0;\n double secs = 0;\n axis2_http_worker_t *tmp = NULL;\n axis2_status_t status = AXIS2_FAILURE;\n axutil_env_t *env = NULL;\n axis2_socket_t socket;\n axutil_env_t *thread_env = NULL;\n axis2_http_svr_thd_args_t *arg_list = NULL;\n\n#ifndef WIN32\n#ifdef AXIS2_SVR_MULTI_THREADED\n signal(SIGPIPE, SIG_IGN);\n#endif\n#endif\n\n if(!data)\n {\n return NULL;\n }\n arg_list = (axis2_http_svr_thd_args_t *)data;\n\n env = arg_list->env;\n thread_env = axutil_init_thread_env(env);\n\n IF_AXIS2_LOG_DEBUG_ENABLED(env->log)\n {\n AXIS2_PLATFORM_GET_TIME_IN_MILLIS(&t1);\n }\n\n socket = arg_list->socket;\n svr_conn = (axis2_simple_http_svr_conn_t*)(this->createServerConnection(thread_env, (int)socket));\n \n if(!svr_conn)\n {\n AXIS2_LOG_ERROR(env->log, AXIS2_LOG_SI, \"creating simple_http_svr_connection failed\");\n return NULL;\n }\n\n axis2_simple_http_svr_conn_set_rcv_timeout(svr_conn, thread_env, m_http_socket_read_timeout);\n\n \/* read HTTPMethod, URL, HTTP Version and http headers. Leave the remaining in the stream *\/\n request = axis2_simple_http_svr_conn_read_request(svr_conn, thread_env);\n if(!request)\n {\n AXIS2_LOG_ERROR(env->log, AXIS2_LOG_SI, \"Could not create request\");\n axis2_simple_http_svr_conn_free(svr_conn, thread_env);\n return NULL;\n }\n\n tmp = arg_list->worker;\n status = axis2_http_worker_process_request(tmp, thread_env, svr_conn, request);\n axis2_simple_http_svr_conn_free(svr_conn, thread_env);\n axis2_http_simple_request_free(request, thread_env);\n\n IF_AXIS2_LOG_DEBUG_ENABLED(env->log)\n {\n AXIS2_PLATFORM_GET_TIME_IN_MILLIS(&t2);\n millisecs = t2.millitm - t1.millitm;\n secs = difftime(t2.time, t1.time);\n if(millisecs < 0)\n {\n millisecs += 1000;\n secs--;\n }\n secs += millisecs \/ 1000.0;\n\n AXIS2_LOG_DEBUG(thread_env->log, AXIS2_LOG_SI, \"Request processed in %.3f seconds\", secs);\n }\n\n if(status == AXIS2_SUCCESS) {\n AXIS2_LOG_DEBUG(thread_env->log, AXIS2_LOG_SI, \"Request served successfully\");\n }\n else {\n AXIS2_LOG_WARNING(thread_env->log, AXIS2_LOG_SI, \"Error occurred in processing request \");\n }\n\n \/\/ just ST here\n AXIS2_FREE(thread_env->allocator, arg_list);\n axutil_free_thread_env(thread_env);\n thread_env = NULL;\n\n return NULL;\n}\n<|endoftext|>"} {"text":"<commit_before>\/*\n * NotebookPlots.cpp\n *\n * Copyright (C) 2009-16 by RStudio, Inc.\n *\n * Unless you have received this program directly from RStudio pursuant\n * to the terms of a commercial license agreement with RStudio, then\n * this program is licensed to you under the terms of version 3 of the\n * GNU Affero General Public License. This program is distributed WITHOUT\n * ANY EXPRESS OR IMPLIED WARRANTY, INCLUDING THOSE OF NON-INFRINGEMENT,\n * MERCHANTABILITY OR FITNESS FOR A PARTICULAR PURPOSE. Please refer to the\n * AGPL (http:\/\/www.gnu.org\/licenses\/agpl-3.0.txt) for more details.\n *\n *\/\n\n#include \"SessionRmdNotebook.hpp\"\n#include \"NotebookPlots.hpp\"\n#include \"..\/SessionPlots.hpp\"\n\n#include <boost\/format.hpp>\n#include <boost\/foreach.hpp>\n\n#include <core\/system\/FileMonitor.hpp>\n#include <core\/StringUtils.hpp>\n\n#include <session\/SessionModuleContext.hpp>\n\n#include <r\/RExec.hpp>\n#include <r\/session\/RGraphics.hpp>\n\n#define kPlotPrefix \"_rs_chunk_plot_\"\n\nusing namespace rstudio::core;\n\nnamespace rstudio {\nnamespace session {\nnamespace modules {\nnamespace rmarkdown {\nnamespace notebook {\nnamespace {\n\nclass PlotState\n{\npublic:\n PlotState():\n hasPlots(false),\n sexpMargins(R_NilValue)\n { }\n\n bool hasPlots;\n SEXP sexpMargins;\n r::sexp::Protect protect;\n};\n\nbool isPlotPath(const FilePath& path)\n{\n return path.hasExtensionLowerCase(\".png\") &&\n string_utils::isPrefixOf(path.stem(), kPlotPrefix);\n}\n\nvoid processPlots(const FilePath& plotFolder, bool fireEvents)\n{\n \/\/ ensure plot folder exists\n if (!plotFolder.exists())\n return;\n\n \/\/ collect plots from the folder\n std::vector<FilePath> folderContents;\n Error error = plotFolder.children(&folderContents);\n if (error)\n LOG_ERROR(error);\n\n BOOST_FOREACH(const FilePath& path, folderContents)\n {\n if (isPlotPath(path))\n {\n if (fireEvents)\n events().onPlotOutput(path);\n\n \/\/ clean up the plot so it isn't emitted twice\n error = path.removeIfExists();\n if (error)\n LOG_ERROR(error);\n }\n }\n}\n\nvoid removeGraphicsDevice(const FilePath& plotFolder, \n boost::shared_ptr<PlotState> pPlotState)\n{\n\n \/\/ restore the figure margins\n Error error = r::exec::RFunction(\"par\", pPlotState->sexpMargins).call();\n if (error)\n LOG_ERROR(error);\n\n \/\/ turn off the graphics device -- this has the side effect of writing the\n \/\/ device's remaining output to files\n error = r::exec::RFunction(\"dev.off\").call();\n if (error)\n LOG_ERROR(error);\n\n#ifdef _WIN32\n \/\/ on Windows, turning off the PNG device writes an empty PNG file if no \n \/\/ plot output occurs; we avoid treating that empty file as an actual plot\n \/\/ by only emitting an event if a plot occurred.\n \/\/\n \/\/ TODO: not all plot libraries cause the new plot hooks to invoke, so this\n \/\/ heuristic may cause us to miss a plot on Windows; we may need some\n \/\/ mechanism by which we can determine whether the device or its output is\n \/\/ empty.\n processPlots(plotFolder, hasPlots);\n#else\n processPlots(plotFolder, true);\n#endif\n}\n\nvoid onNewPlot(const FilePath& plotFolder,\n boost::shared_ptr<PlotState> pPlotState)\n{\n pPlotState->hasPlots = true;\n processPlots(plotFolder, true);\n}\n\nvoid onConsolePrompt(const FilePath& plotFolder,\n boost::shared_ptr<PlotState> pPlotState,\n const std::string& )\n{\n removeGraphicsDevice(plotFolder, pPlotState);\n\n module_context::events().onConsolePrompt.disconnect(\n boost::bind(onConsolePrompt, plotFolder, pPlotState, _1));\n\n plots::events().onNewPlot.disconnect(\n boost::bind(onNewPlot, pPlotState, _1));\n}\n\n} \/\/ anonymous namespace\n\n\/\/ begins capturing plot output\ncore::Error beginPlotCapture(const FilePath& plotFolder)\n{\n \/\/ clean up any stale plots from the folder\n std::vector<FilePath> folderContents;\n Error error = plotFolder.children(&folderContents);\n if (error)\n return error;\n\n BOOST_FOREACH(const core::FilePath& file, folderContents)\n {\n \/\/ remove if it looks like a plot \n if (isPlotPath(file)) \n {\n error = file.remove();\n if (error)\n {\n \/\/ this is non-fatal \n LOG_ERROR(error);\n }\n }\n }\n\n \/\/ generate code for creating PNG device\n boost::format fmt(\"{ require(grDevices, quietly=TRUE); \"\n \" png(file = \\\"%1%\/\" kPlotPrefix \"%%03d.png\\\", \"\n \" width = 6.5, height = 4, \"\n \" units=\\\"in\\\", res = 96 %2%)\"\n \"}\");\n\n \/\/ marker for content; this is necessary because on Windows, turning off\n \/\/ the png device writes an empty PNG file even if nothing was plotted, and\n \/\/ we need to avoid treating that file as though it were an actual plot\n boost::shared_ptr<PlotState> pPlotState = boost::make_shared<PlotState>();\n\n \/\/ create the PNG device\n error = r::exec::executeString(\n (fmt % string_utils::utf8ToSystem(plotFolder.absolutePath())\n % r::session::graphics::extraBitmapParams()).str());\n if (error)\n return error;\n\n \/\/ save old plot state\n r::exec::RFunction par(\"par\");\n par.addParam(\"no.readonly\", true);\n error = par.call(&pPlotState->sexpMargins, &pPlotState->protect);\n if (error)\n LOG_ERROR(error);\n\n \/\/ set notebook-friendly figure margins\n \/\/ bot left top right\n error = r::exec::executeString(\"par(mar = c(5.1, 4.1, 2.1, 2.1))\");\n if (error)\n LOG_ERROR(error);\n \n \/\/ complete the capture on the next console prompt\n module_context::events().onConsolePrompt.connect(\n boost::bind(onConsolePrompt, plotFolder, pPlotState, _1));\n\n plots::events().onNewPlot.connect(\n boost::bind(onNewPlot, plotFolder, pPlotState));\n\n return Success();\n}\n\n\n} \/\/ namespace notebook\n} \/\/ namespace rmarkdown\n} \/\/ namespace modules\n} \/\/ namespace session\n} \/\/ namespace rstudio\n\n<commit_msg>use preserved SEXP to guard old plot state<commit_after>\/*\n * NotebookPlots.cpp\n *\n * Copyright (C) 2009-16 by RStudio, Inc.\n *\n * Unless you have received this program directly from RStudio pursuant\n * to the terms of a commercial license agreement with RStudio, then\n * this program is licensed to you under the terms of version 3 of the\n * GNU Affero General Public License. This program is distributed WITHOUT\n * ANY EXPRESS OR IMPLIED WARRANTY, INCLUDING THOSE OF NON-INFRINGEMENT,\n * MERCHANTABILITY OR FITNESS FOR A PARTICULAR PURPOSE. Please refer to the\n * AGPL (http:\/\/www.gnu.org\/licenses\/agpl-3.0.txt) for more details.\n *\n *\/\n\n#include \"SessionRmdNotebook.hpp\"\n#include \"NotebookPlots.hpp\"\n#include \"..\/SessionPlots.hpp\"\n\n#include <boost\/format.hpp>\n#include <boost\/foreach.hpp>\n\n#include <core\/system\/FileMonitor.hpp>\n#include <core\/StringUtils.hpp>\n\n#include <session\/SessionModuleContext.hpp>\n\n#include <r\/RExec.hpp>\n#include <r\/RSexp.hpp>\n#include <r\/session\/RGraphics.hpp>\n\n#define kPlotPrefix \"_rs_chunk_plot_\"\n\nusing namespace rstudio::core;\n\nnamespace rstudio {\nnamespace session {\nnamespace modules {\nnamespace rmarkdown {\nnamespace notebook {\nnamespace {\n\nclass PlotState\n{\npublic:\n PlotState():\n hasPlots(false)\n { }\n\n bool hasPlots;\n r::sexp::PreservedSEXP sexpMargins;\n};\n\nbool isPlotPath(const FilePath& path)\n{\n return path.hasExtensionLowerCase(\".png\") &&\n string_utils::isPrefixOf(path.stem(), kPlotPrefix);\n}\n\nvoid processPlots(const FilePath& plotFolder, bool fireEvents)\n{\n \/\/ ensure plot folder exists\n if (!plotFolder.exists())\n return;\n\n \/\/ collect plots from the folder\n std::vector<FilePath> folderContents;\n Error error = plotFolder.children(&folderContents);\n if (error)\n LOG_ERROR(error);\n\n BOOST_FOREACH(const FilePath& path, folderContents)\n {\n if (isPlotPath(path))\n {\n if (fireEvents)\n events().onPlotOutput(path);\n\n \/\/ clean up the plot so it isn't emitted twice\n error = path.removeIfExists();\n if (error)\n LOG_ERROR(error);\n }\n }\n}\n\nvoid removeGraphicsDevice(const FilePath& plotFolder, \n boost::shared_ptr<PlotState> pPlotState)\n{\n\n \/\/ restore the figure margins\n Error error = r::exec::RFunction(\"par\", pPlotState->sexpMargins).call();\n if (error)\n LOG_ERROR(error);\n\n \/\/ turn off the graphics device -- this has the side effect of writing the\n \/\/ device's remaining output to files\n error = r::exec::RFunction(\"dev.off\").call();\n if (error)\n LOG_ERROR(error);\n\n#ifdef _WIN32\n \/\/ on Windows, turning off the PNG device writes an empty PNG file if no \n \/\/ plot output occurs; we avoid treating that empty file as an actual plot\n \/\/ by only emitting an event if a plot occurred.\n \/\/\n \/\/ TODO: not all plot libraries cause the new plot hooks to invoke, so this\n \/\/ heuristic may cause us to miss a plot on Windows; we may need some\n \/\/ mechanism by which we can determine whether the device or its output is\n \/\/ empty.\n processPlots(plotFolder, hasPlots);\n#else\n processPlots(plotFolder, true);\n#endif\n}\n\nvoid onNewPlot(const FilePath& plotFolder,\n boost::shared_ptr<PlotState> pPlotState)\n{\n pPlotState->hasPlots = true;\n processPlots(plotFolder, true);\n}\n\nvoid onConsolePrompt(const FilePath& plotFolder,\n boost::shared_ptr<PlotState> pPlotState,\n const std::string& )\n{\n removeGraphicsDevice(plotFolder, pPlotState);\n\n module_context::events().onConsolePrompt.disconnect(\n boost::bind(onConsolePrompt, plotFolder, pPlotState, _1));\n\n plots::events().onNewPlot.disconnect(\n boost::bind(onNewPlot, pPlotState, _1));\n}\n\n} \/\/ anonymous namespace\n\n\/\/ begins capturing plot output\ncore::Error beginPlotCapture(const FilePath& plotFolder)\n{\n \/\/ clean up any stale plots from the folder\n std::vector<FilePath> folderContents;\n Error error = plotFolder.children(&folderContents);\n if (error)\n return error;\n\n BOOST_FOREACH(const core::FilePath& file, folderContents)\n {\n \/\/ remove if it looks like a plot \n if (isPlotPath(file)) \n {\n error = file.remove();\n if (error)\n {\n \/\/ this is non-fatal \n LOG_ERROR(error);\n }\n }\n }\n\n \/\/ generate code for creating PNG device\n boost::format fmt(\"{ require(grDevices, quietly=TRUE); \"\n \" png(file = \\\"%1%\/\" kPlotPrefix \"%%03d.png\\\", \"\n \" width = 6.5, height = 4, \"\n \" units=\\\"in\\\", res = 96 %2%)\"\n \"}\");\n\n \/\/ marker for content; this is necessary because on Windows, turning off\n \/\/ the png device writes an empty PNG file even if nothing was plotted, and\n \/\/ we need to avoid treating that file as though it were an actual plot\n boost::shared_ptr<PlotState> pPlotState = boost::make_shared<PlotState>();\n\n \/\/ create the PNG device\n error = r::exec::executeString(\n (fmt % string_utils::utf8ToSystem(plotFolder.absolutePath())\n % r::session::graphics::extraBitmapParams()).str());\n if (error)\n return error;\n\n \/\/ save old plot state\n r::exec::RFunction par(\"par\");\n par.addParam(\"no.readonly\", true);\n r::sexp::Protect protect;\n SEXP sexpMargins;\n error = par.call(&sexpMargins, &protect);\n if (error)\n LOG_ERROR(error);\n\n \/\/ preserve until chunk is finished executing\n pPlotState->sexpMargins.set(sexpMargins);\n\n \/\/ set notebook-friendly figure margins\n \/\/ bot left top right\n error = r::exec::executeString(\"par(mar = c(5.1, 4.1, 2.1, 2.1))\");\n if (error)\n LOG_ERROR(error);\n \n \/\/ complete the capture on the next console prompt\n module_context::events().onConsolePrompt.connect(\n boost::bind(onConsolePrompt, plotFolder, pPlotState, _1));\n\n plots::events().onNewPlot.connect(\n boost::bind(onNewPlot, plotFolder, pPlotState));\n\n return Success();\n}\n\n\n} \/\/ namespace notebook\n} \/\/ namespace rmarkdown\n} \/\/ namespace modules\n} \/\/ namespace session\n} \/\/ namespace rstudio\n\n<|endoftext|>"} {"text":"<commit_before>\/*\n * (C) 2009 Nikhil Marathe <nsm.nikhil@gmail.com>\n * Licensed under the GNU General Public License.\n * See LICENSE for details\n *\/\n#include <QSettings>\n#include <QNetworkInterface>\n#include <QMessageBox>\n\n#include \"messenger.h\"\n\nMember member_me(\"\", QHostInfo::localHostName(), QHostAddress(QHostAddress::LocalHost).toString(), \"Available\");\nGroup group_me(\"\");\n\nMessenger* m = NULL;\n\nMessenger* messenger()\n{\n if(!m)\n m = new Messenger;\n return m;\n}\n\nMember me()\n{\n return member_me;\n}\n\nGroup myGroup()\n{\n return group_me;\n}\n\nMessage::Message(quint32 pNo, Member* sender, quint32 cmd, QByteArray payload)\n{\n setPacketNo(pNo);\n setSender(sender);\n setCommand(cmd);\n setPayload(payload);\n}\n\nQByteArray Message::toAscii()\n{\n QByteArray arr;\n \n arr += QByteArray::number(INT_VERSION);\n arr += ':';\n arr += QByteArray::number(packetNo());\n arr += ':';\n arr += sender()->name().toAscii();\n arr += ':';\n arr += sender()->host().toAscii();\n arr += ':';\n arr += QByteArray::number(command());\n arr += ':';\n arr += payload();\n \n return arr;\n}\n\nQString Message::toString()\n{\n return QString(toAscii());\n}\n\nMessage Message::fromAscii(QByteArray arr)\n{\n QList<QByteArray> tokens = arr.split(':');\n \n \/\/ reconstitute payload, if payload itself contains ':'\n for(int i = 6; i < tokens.size(); i++)\n tokens[5] += \":\"+tokens[i];\n \n quint32 pNo = tokens[1].toInt();\n \n Member* m = new Member;\n m->setName(QString(tokens[2])); \/\/ default name, this will be replaced when BR_ENTRY is received\n m->setHost(QString(tokens[3]));\n m->setStatus(\"Available\");\n \n quint32 cmd = tokens[4].toInt();\n QByteArray py = tokens[5];\n \n return Message(pNo, m, cmd, py);\n}\n\nMessage Message::fromString(QString s)\n{\n return Message::fromAscii(s.toAscii());\n}\n\nMessenger::Messenger() : QObject()\n{\n socket = NULL;\n reset();\n}\n\nvoid Messenger::reset()\n{\n m_packetNo = 1;\n \n if(socket) {\n socket->close();\n delete socket;\n socket = NULL;\n }\n \n socket = new QUdpSocket(this);\n \n if(!socket->bind(UDP_PORT))\n {\n QMessageBox::critical(0, tr(\"Connection Error\"), tr(\"Could not bind, perhaps port %1 is being used by another application.\").arg(UDP_PORT));\n exit(1);\n }\n \n refreshSettings();\n connect(socket, SIGNAL(readyRead()), this, SLOT(receiveData()));\n}\n\nMessage Messenger::makeMessage(quint32 command, QByteArray payload)\n{\n Message msg(packetNo(), &member_me, command, payload);\n \/\/ NOTE: This is an IMPORTANT step. that's why sniffing the data will give you big command numbers\n msg.setCommand(msg.command());\n \n return msg;\n}\n\nbool Messenger::sendMessage(quint32 command, QByteArray payload, Member* to)\n{\n return sendMessage( makeMessage(command, payload), to );\n}\n\nbool Messenger::sendMessage(Message msg, Member* to)\n{ \n const QByteArray data = msg.toAscii();\n return socket->writeDatagram(data, to->address(), UDP_PORT) != -1;\n}\n\n\/*\n * Sends a broadcast\n * and then also multicasts to all ips stored in the Settings\n *\/\nbool Messenger::multicast(quint32 command, QByteArray payload)\n{\n QByteArray data = makeMessage(command, payload).toAscii();\n \n socket->writeDatagram(data, QHostAddress::Broadcast, UDP_PORT);\n \n QString ip;\n foreach(ip, ips())\n {\n socket->writeDatagram(data, QHostAddress(ip), UDP_PORT);\n }\n}\n\nvoid Messenger::receiveData()\n{\n while(socket->hasPendingDatagrams())\n {\n QByteArray data;\n data.resize(socket->pendingDatagramSize());\n QHostAddress from;\n \n socket->readDatagram(data.data(), data.size(), &from);\n \n if(QNetworkInterface::allAddresses().contains(from))\n {\n continue;\n }\n \n data.replace('\\0', QOM_HOSTLIST_SEPARATOR);\n \n Message msg = Message::fromAscii(data.data());\n\n msg.sender()->setAddress(from.toString());\n \n \/\/qDebug() << \"Received\" << msg.toAscii() ;\n \/\/qDebug() << \"from\" << msg.sender()->name() << msg.sender()->addressString();\n \n switch(msg.command() & QOM_COMMAND_MASK)\n {\n case QOM_ANSENTRY:\n emit msg_ansEntry(msg);\n break;\n \n case QOM_BR_ENTRY:\n emit msg_entry(msg);\n break;\n \n case QOM_BR_EXIT:\n emit msg_exit(msg);\n break;\n \n case QOM_SENDMSG:\n if(msg.command() & QOM_FILEATTACHOPT)\n emit msg_fileRecvRequest(msg);\n else\n emit msg_recvMsg(msg);\n break;\n \n case QOM_RECVMSG:\n emit msg_recvConfirmMsg(msg);\n break;\n \n case QOM_READMSG:\n emit msg_readConfirmMsg(msg);\n break;\n \n case QOM_GETABSENCEINFO:\n emit msg_getAbsenceInfo(msg);\n \n case QOM_BR_ABSENCE:\n emit msg_absence(msg);\n }\n }\n}\n\nQStringList Messenger::ips() const\n{\n QSettings s;\n s.beginGroup(\"ips\");\n \n QStringList ret;\n \n QString ipKey;\n foreach(ipKey, s.childKeys())\n {\n ret << s.value(ipKey).toString();\n }\n \n return ret;\n}\n\nbool Messenger::login()\n{\n multicast(QOM_BR_ENTRY, member_me.name().toAscii()+'\\0'+group_me.name().toAscii());\n}\n\nbool Messenger::logout()\n{\n multicast(QOM_BR_EXIT, member_me.name().toAscii()+'\\0'+group_me.name().toAscii());\n}\n\nbool Messenger::nickChanged()\n{\n refreshSettings();\n multicast(QOM_BR_ABSENCE, member_me.name().toAscii()+'\\0'+group_me.name().toAscii());\n}\n\nbool Messenger::refreshSettings()\n{ \n QSettings s;\n member_me.setName(s.value(\"nick\", QString(getenv(\"USER\"))).toString());\n group_me.setName(s.value(\"group\").toString());\n}\n<commit_msg>Fetch manual IPs from IPMsg's settings<commit_after>\/*\n * (C) 2009 Nikhil Marathe <nsm.nikhil@gmail.com>\n * Licensed under the GNU General Public License.\n * See LICENSE for details\n *\/\n#include <QSettings>\n#include <QNetworkInterface>\n#include <QMessageBox>\n\n#include \"messenger.h\"\n\nMember member_me(\"\", QHostInfo::localHostName(), QHostAddress(QHostAddress::LocalHost).toString(), \"Available\");\nGroup group_me(\"\");\n\nMessenger* m = NULL;\n\nMessenger* messenger()\n{\n if(!m)\n m = new Messenger;\n return m;\n}\n\nMember me()\n{\n return member_me;\n}\n\nGroup myGroup()\n{\n return group_me;\n}\n\nMessage::Message(quint32 pNo, Member* sender, quint32 cmd, QByteArray payload)\n{\n setPacketNo(pNo);\n setSender(sender);\n setCommand(cmd);\n setPayload(payload);\n}\n\nQByteArray Message::toAscii()\n{\n QByteArray arr;\n \n arr += QByteArray::number(INT_VERSION);\n arr += ':';\n arr += QByteArray::number(packetNo());\n arr += ':';\n arr += sender()->name().toAscii();\n arr += ':';\n arr += sender()->host().toAscii();\n arr += ':';\n arr += QByteArray::number(command());\n arr += ':';\n arr += payload();\n \n return arr;\n}\n\nQString Message::toString()\n{\n return QString(toAscii());\n}\n\nMessage Message::fromAscii(QByteArray arr)\n{\n QList<QByteArray> tokens = arr.split(':');\n \n \/\/ reconstitute payload, if payload itself contains ':'\n for(int i = 6; i < tokens.size(); i++)\n tokens[5] += \":\"+tokens[i];\n \n quint32 pNo = tokens[1].toInt();\n \n Member* m = new Member;\n m->setName(QString(tokens[2])); \/\/ default name, this will be replaced when BR_ENTRY is received\n m->setHost(QString(tokens[3]));\n m->setStatus(\"Available\");\n \n quint32 cmd = tokens[4].toInt();\n QByteArray py = tokens[5];\n \n return Message(pNo, m, cmd, py);\n}\n\nMessage Message::fromString(QString s)\n{\n return Message::fromAscii(s.toAscii());\n}\n\nMessenger::Messenger() : QObject()\n{\n socket = NULL;\n reset();\n}\n\nvoid Messenger::reset()\n{\n m_packetNo = 1;\n \n if(socket) {\n socket->close();\n delete socket;\n socket = NULL;\n }\n \n socket = new QUdpSocket(this);\n \n if(!socket->bind(UDP_PORT))\n {\n QMessageBox::critical(0, tr(\"Connection Error\"), tr(\"Could not bind, perhaps port %1 is being used by another application.\").arg(UDP_PORT));\n exit(1);\n }\n \n refreshSettings();\n connect(socket, SIGNAL(readyRead()), this, SLOT(receiveData()));\n}\n\nMessage Messenger::makeMessage(quint32 command, QByteArray payload)\n{\n Message msg(packetNo(), &member_me, command, payload);\n \/\/ NOTE: This is an IMPORTANT step. that's why sniffing the data will give you big command numbers\n msg.setCommand(msg.command());\n \n return msg;\n}\n\nbool Messenger::sendMessage(quint32 command, QByteArray payload, Member* to)\n{\n return sendMessage( makeMessage(command, payload), to );\n}\n\nbool Messenger::sendMessage(Message msg, Member* to)\n{ \n const QByteArray data = msg.toAscii();\n return socket->writeDatagram(data, to->address(), UDP_PORT) != -1;\n}\n\n\/*\n * Sends a broadcast\n * and then also multicasts to all ips stored in the Settings\n *\/\nbool Messenger::multicast(quint32 command, QByteArray payload)\n{\n QByteArray data = makeMessage(command, payload).toAscii();\n \n socket->writeDatagram(data, QHostAddress::Broadcast, UDP_PORT);\n \n QString ip;\n foreach(ip, ips())\n {\n socket->writeDatagram(data, QHostAddress(ip), UDP_PORT);\n }\n}\n\nvoid Messenger::receiveData()\n{\n while(socket->hasPendingDatagrams())\n {\n QByteArray data;\n data.resize(socket->pendingDatagramSize());\n QHostAddress from;\n \n socket->readDatagram(data.data(), data.size(), &from);\n \n if(QNetworkInterface::allAddresses().contains(from))\n {\n continue;\n }\n \n data.replace('\\0', QOM_HOSTLIST_SEPARATOR);\n \n Message msg = Message::fromAscii(data.data());\n\n msg.sender()->setAddress(from.toString());\n \n \/\/qDebug() << \"Received\" << msg.toAscii() ;\n \/\/qDebug() << \"from\" << msg.sender()->name() << msg.sender()->addressString();\n \n switch(msg.command() & QOM_COMMAND_MASK)\n {\n case QOM_ANSENTRY:\n emit msg_ansEntry(msg);\n break;\n \n case QOM_BR_ENTRY:\n emit msg_entry(msg);\n break;\n \n case QOM_BR_EXIT:\n emit msg_exit(msg);\n break;\n \n case QOM_SENDMSG:\n if(msg.command() & QOM_FILEATTACHOPT)\n emit msg_fileRecvRequest(msg);\n else\n emit msg_recvMsg(msg);\n break;\n \n case QOM_RECVMSG:\n emit msg_recvConfirmMsg(msg);\n break;\n \n case QOM_READMSG:\n emit msg_readConfirmMsg(msg);\n break;\n \n case QOM_GETABSENCEINFO:\n emit msg_getAbsenceInfo(msg);\n \n case QOM_BR_ABSENCE:\n emit msg_absence(msg);\n }\n }\n}\n\nQStringList Messenger::ips() const\n{\n QSettings s;\n s.beginGroup(\"ips\");\n \n QStringList ret;\n \n QString ipKey;\n foreach(ipKey, s.childKeys()) {\n ret << s.value(ipKey).toString();\n }\n\n \/\/ fetch IP Messenger IPs\n QSettings ipmsg(\"HSTools\", \"IpMsgEng\");\n ipmsg.beginGroup(\"BroadCast\");\n foreach(ipKey, ipmsg.childKeys()) {\n ret << ipmsg.value(ipKey).toString();\n }\n \n return ret;\n}\n\nbool Messenger::login()\n{\n multicast(QOM_BR_ENTRY, member_me.name().toAscii()+'\\0'+group_me.name().toAscii());\n}\n\nbool Messenger::logout()\n{\n multicast(QOM_BR_EXIT, member_me.name().toAscii()+'\\0'+group_me.name().toAscii());\n}\n\nbool Messenger::nickChanged()\n{\n refreshSettings();\n multicast(QOM_BR_ABSENCE, member_me.name().toAscii()+'\\0'+group_me.name().toAscii());\n}\n\nbool Messenger::refreshSettings()\n{ \n QSettings s;\n member_me.setName(s.value(\"nick\", QString(getenv(\"USER\"))).toString());\n group_me.setName(s.value(\"group\").toString());\n}\n<|endoftext|>"} {"text":"<commit_before>#ifndef MUDI_JSON_HPP\n#define MUDI_JSON_HPP\n\n#include <unordered_map>\n#include <vector>\n#include <string>\n\n#include <utility> \/\/ make_pair\n#include <memory> \/\/ share_ptr\n#include <exception>\n\n#define MUDI_NS_BEGIN namespace mundi {\n#define MUDI_NS_END }\n\n#define MUDI_N_NS_BEGIN namespace mundi { namespace {\n#define MUDI_N_NS_END }}\n\nMUDI_N_NS_BEGIN\nenum class value_type\n{\n array,\n object,\n string,\n number,\n boolean,\n null,\n};\n\nMUDI_N_NS_END\n\n\/\/ exception\n\nMUDI_NS_BEGIN\n\nclass not_supported: public std::exception\n{\npublic:\n const char* what() const noexcept override\n {\n return \"Not supported operation\";\n }\n};\n\nclass key_not_found: public std::exception\n{\npublic:\n const char* what() const noexcept override\n {\n return \"Key not found\";\n }\n};\n\nMUDI_NS_END\n\n\/\/ interface\n\nMUDI_NS_BEGIN\n\nclass json_value\n{\npublic:\n virtual ~json_value() noexcept;\n\n virtual const json_value& operator[](const std::string& key) const\n {\n throw not_supported();\n }\n\n virtual const json_value& operator[](unsigned int index) const\n {\n throw not_supported();\n }\n\n virtual bool boolean_value() const noexcept\n {\n return false;\n }\n\n virtual std::string string_value() const noexcept\n {\n return \"null\";\n }\n\n virtual int int_value() const noexcept\n {\n return 0;\n }\n\n virtual double double_value() const noexcept\n {\n return 0;\n }\n\n bool is_bool() const noexcept\n {\n return type() == value_type::boolean;\n }\n\n bool is_array() const noexcept\n {\n return type() == value_type::array;\n }\n\n bool is_string() const noexcept\n {\n return type() == value_type::string;\n }\n\n bool is_number() const noexcept\n {\n return type() == value_type::number;\n }\n\n bool is_object() const noexcept\n {\n return type() == value_type::object;\n }\n\n bool is_null() const noexcept\n {\n return type() == value_type::null;\n }\n\nprotected:\n virtual value_type type() const noexcept\n {\n return value_type::null;\n }\n};\n\nstd::unique_ptr<json_value> parse_string(const std::string& str);\nstd::unique_ptr<json_value> parse_cstring(const char* cstr, unsigned int len);\n\nMUDI_NS_END\n\n\/\/ string\n\nMUDI_N_NS_BEGIN\n\ntypedef std::shared_ptr<std::string> buffer_ptr;\n\nclass json_string: public json_value\n{\npublic:\n json_string(unsigned int pos, unsigned int len, buffer_ptr buf): pos{ pos }, len{ len }, buffer{ buf }\n {}\n\n json_string(const json_string& rhs): pos{ rhs.pos }, len{ rhs.len }, buffer{ rhs.buffer }\n {}\n\n json_string& operator=(const json_string& rhs)\n {\n if (&rhs == this) {\n return *this;\n }\n\n auto tmp = rhs;\n std::swap(*this, tmp);\n return *this;\n }\n\n json_string(json_string&& rhs): pos{ rhs.pos }, len{ rhs.len }\n {\n buffer = std::move(rhs.buffer);\n }\n\n json_string& operator=(json_string&& rhs)\n {\n pos = rhs.pos;\n len = rhs.len;\n buffer = std::move(rhs.buffer);\n\n return *this;\n }\n\n std::string string_value() const noexcept override\n {\n return buffer->substr(pos, len);\n }\n\nprotected:\n value_type type() const noexcept override\n {\n return value_type::string;\n }\n\nprivate:\n unsigned int pos;\n unsigned int len;\n buffer_ptr buffer;\n};\n\nMUDI_N_NS_END\n\n\/\/ array\n\nMUDI_N_NS_BEGIN\n\nclass json_array: public json_value\n{\npublic:\n json_array() = default;\n\n json_array(const json_array& rhs): data{ rhs.data }\n {}\n\n json_array& operator=(const json_array& rhs)\n {\n if (&rhs == this) {\n return *this;\n }\n\n auto tmp = rhs;\n std::swap(*this, tmp);\n return *this;\n }\n\n json_array(json_array&& rhs)\n {\n data = std::move(rhs.data);\n }\n\n json_array& operator=(json_array&& rhs)\n {\n data = std::move(rhs.data);\n return *this;\n }\n\n ~json_array()\n {\n for (auto& v : data) {\n delete v;\n }\n data.clear();\n }\n\n const json_value& operator[](unsigned int index) const override\n {\n return *data.at(index);\n }\n\nprotected:\n value_type type() const noexcept override\n {\n return value_type::array;\n }\n\nprivate:\n void append(json_value* val) noexcept\n {\n data.push_back(val);\n }\n\nprivate:\n std::vector<json_value*> data;\n};\n\nMUDI_N_NS_END\n\n\/\/ object\n\nMUDI_N_NS_BEGIN\n\nclass json_object: public json_value\n{\npublic:\n json_object() = default;\n\n json_object(const json_object& rhs): data{ rhs.data }\n {}\n\n json_object& operator=(const json_object& rhs)\n {\n data = rhs.data;\n return *this;\n }\n\n json_object(json_object&& rhs)\n {\n data = std::move(rhs.data);\n }\n\n json_object& operator=(json_object&& rhs)\n {\n data = std::move(rhs.data);\n return *this;\n }\n\n const json_value& operator[](const std::string& key) const override\n {\n auto found = data.find(key);\n if (found == data.cend()) {\n throw key_not_found();\n } else {\n return *(found->second);\n }\n }\n\n ~json_object()\n {\n for (auto& o : data) {\n delete o.second;\n }\n data.clear();\n }\n\n bool append(const std::string& key, json_value* value) noexcept\n {\n auto ret = data.insert(std::make_pair(key, value));\n return ret.second;\n }\n\n void remove(const std::string& key)\n {\n auto found = data.find(key);\n if (found != data.end())\n data.erase(found);\n }\n\nprotected:\n value_type type() const noexcept override\n {\n return value_type::object;\n }\n\nprivate:\n std::unordered_map<std::string, json_value*> data;\n};\n\nMUDI_N_NS_END\n\n\/\/ number\n\nMUDI_N_NS_BEGIN\n\nclass json_number: public json_value\n{\npublic:\n json_number(unsigned int pos, unsigned int len, buffer_ptr buf): pos{ pos }, len{ len }, buffer{ buf }\n {}\n\n json_number(const json_number& rhs): pos{ rhs.pos }, len{ rhs.len }, buffer{ rhs.buffer }\n {}\n\n json_number& operator=(const json_number& rhs)\n {\n if (&rhs == this) {\n return *this;\n }\n\n pos = rhs.pos;\n len = rhs.len;\n buffer = rhs.buffer;\n\n return *this;\n }\n\n json_number(json_number&& rhs): pos{ rhs.pos }, len{ rhs.len }\n {\n buffer = std::move(rhs.buffer);\n }\n\n json_number& operator=(json_number&& rhs)\n {\n pos = rhs.pos;\n len = rhs.len;\n buffer = std::move(rhs.buffer);\n\n return *this;\n }\n\n int int_value() const noexcept override\n {\n return 0;\n }\n\n double double_value() const noexcept override\n {\n return 0;\n }\n\nprotected:\n value_type type() const noexcept override\n {\n return value_type::number;\n }\n\nprivate:\n unsigned int pos;\n unsigned int len;\n buffer_ptr buffer;\n};\n\nMUDI_N_NS_END\n\n\/\/ boolean\n\nMUDI_N_NS_BEGIN\n\nclass json_boolean: public json_value\n{\npublic:\n json_boolean(unsigned int pos, unsigned int len, buffer_ptr buf): pos{ pos }, len{ len }, buffer{ buf }\n {}\n\n json_boolean(const json_boolean& rhs): pos{ rhs.pos }, len{ rhs.len }, buffer{ rhs.buffer }\n {}\n\n json_boolean& operator=(const json_boolean& rhs)\n {\n if (&rhs == this) {\n return *this;\n }\n\n pos = rhs.pos;\n len = rhs.len;\n buffer = rhs.buffer;\n\n return *this;\n }\n\n json_boolean(json_boolean&& rhs): pos{ rhs.pos }, len{ rhs.len }\n {\n buffer = std::move(rhs.buffer);\n }\n\n json_boolean& operator=(json_boolean&& rhs)\n {\n pos = rhs.pos;\n len = rhs.len;\n buffer = std::move(rhs.buffer);\n\n return *this;\n }\n\n bool boolean_value() const noexcept override\n {\n auto str = buffer->substr(pos, len);\n if (0 == str.compare(\"true\")) {\n return true;\n } else {\n return false;\n }\n }\n\nprotected:\n value_type type() const noexcept override\n {\n return value_type::boolean;\n }\n\nprivate:\n unsigned int pos;\n unsigned int len;\n buffer_ptr buffer;\n};\n\nMUDI_N_NS_END\n\n#endif\n<commit_msg>parser<commit_after>#ifndef MUDI_JSON_HPP\n#define MUDI_JSON_HPP\n\n#include <unordered_map>\n#include <vector>\n#include <string>\n\n#include <utility> \/\/ make_pair\n#include <memory> \/\/ share_ptr\n#include <cctype> \/\/ isspace\n#include <exception>\n\n#define MUDI_NS_BEGIN namespace mundi {\n#define MUDI_NS_END }\n\n#define MUDI_N_NS_BEGIN namespace mundi { namespace {\n#define MUDI_N_NS_END }}\n\nMUDI_N_NS_BEGIN\nenum class value_type\n{\n array,\n object,\n string,\n number,\n boolean,\n null,\n};\n\nMUDI_N_NS_END\n\n\/\/ exception\n\nMUDI_N_NS_BEGIN\n\nclass not_supported: public std::exception\n{\npublic:\n const char* what() const noexcept override\n {\n return \"Not supported operation\";\n }\n};\n\nclass key_not_found: public std::exception\n{\npublic:\n const char* what() const noexcept override\n {\n return \"Key not found\";\n }\n};\n\nclass premature_eof: public std::exception\n{\npublic:\n const char* what() const noexcept override\n {\n return \"Input end prematurely\";\n }\n};\n\nclass unknown_input: public std::exception\n{\npublic:\n const char* what() const noexcept override\n {\n return \"Unknown input\";\n }\n};\n\nMUDI_N_NS_END\n\n\/\/ interface\n\nMUDI_NS_BEGIN\n\nclass json_value\n{\npublic:\n virtual ~json_value() noexcept;\n\n virtual const json_value& operator[](const std::string& key) const\n {\n throw not_supported();\n }\n\n virtual const json_value& operator[](unsigned int index) const\n {\n throw not_supported();\n }\n\n virtual bool boolean_value() const noexcept\n {\n return false;\n }\n\n virtual std::string string_value() const noexcept\n {\n return \"null\";\n }\n\n virtual int int_value() const noexcept\n {\n return 0;\n }\n\n virtual double double_value() const noexcept\n {\n return 0;\n }\n\n bool is_bool() const noexcept\n {\n return type() == value_type::boolean;\n }\n\n bool is_array() const noexcept\n {\n return type() == value_type::array;\n }\n\n bool is_string() const noexcept\n {\n return type() == value_type::string;\n }\n\n bool is_number() const noexcept\n {\n return type() == value_type::number;\n }\n\n bool is_object() const noexcept\n {\n return type() == value_type::object;\n }\n\n bool is_null() const noexcept\n {\n return type() == value_type::null;\n }\n\nprotected:\n virtual value_type type() const noexcept\n {\n return value_type::null;\n }\n};\n\nstd::unique_ptr<json_value> parse_string(const std::string& str)\n{\n json_parser p{ str };\n return p.parse();\n}\n\nstd::unique_ptr<json_value> parse_cstring(const char* cstr, unsigned int len)\n{\n json_parser p{cstr, len}\n return p.parse();\n}\n\nMUDI_NS_END\n\n\/\/ string\n\nMUDI_N_NS_BEGIN\n\ntypedef std::shared_ptr<std::string> buffer_ptr;\n\nclass json_string: public json_value\n{\npublic:\n json_string(unsigned int pos, unsigned int len, buffer_ptr buf): pos{ pos }, len{ len }, buffer{ buf }\n {}\n\n json_string(const json_string& rhs): pos{ rhs.pos }, len{ rhs.len }, buffer{ rhs.buffer }\n {}\n\n json_string& operator=(const json_string& rhs)\n {\n if (&rhs == this) {\n return *this;\n }\n\n auto tmp = rhs;\n std::swap(*this, tmp);\n return *this;\n }\n\n json_string(json_string&& rhs): pos{ rhs.pos }, len{ rhs.len }\n {\n buffer = std::move(rhs.buffer);\n }\n\n json_string& operator=(json_string&& rhs)\n {\n pos = rhs.pos;\n len = rhs.len;\n buffer = std::move(rhs.buffer);\n\n return *this;\n }\n\n std::string string_value() const noexcept override\n {\n return buffer->substr(pos, len);\n }\n\nprotected:\n value_type type() const noexcept override\n {\n return value_type::string;\n }\n\nprivate:\n unsigned int pos;\n unsigned int len;\n buffer_ptr buffer;\n};\n\nMUDI_N_NS_END\n\n\/\/ array\n\nMUDI_N_NS_BEGIN\n\nclass json_array: public json_value\n{\npublic:\n json_array() = default;\n\n json_array(const json_array& rhs): data{ rhs.data }\n {}\n\n json_array& operator=(const json_array& rhs)\n {\n if (&rhs == this) {\n return *this;\n }\n\n auto tmp = rhs;\n std::swap(*this, tmp);\n return *this;\n }\n\n json_array(json_array&& rhs)\n {\n data = std::move(rhs.data);\n }\n\n json_array& operator=(json_array&& rhs)\n {\n data = std::move(rhs.data);\n return *this;\n }\n\n ~json_array()\n {\n for (auto& v : data) {\n delete v;\n }\n data.clear();\n }\n\n const json_value& operator[](unsigned int index) const override\n {\n return *data.at(index);\n }\n\nprotected:\n value_type type() const noexcept override\n {\n return value_type::array;\n }\n\nprivate:\n void append(json_value* val) noexcept\n {\n data.push_back(val);\n }\n\nprivate:\n std::vector<json_value*> data;\n};\n\nMUDI_N_NS_END\n\n\/\/ object\n\nMUDI_N_NS_BEGIN\n\nclass json_object: public json_value\n{\npublic:\n json_object() = default;\n\n json_object(const json_object& rhs): data{ rhs.data }\n {}\n\n json_object& operator=(const json_object& rhs)\n {\n data = rhs.data;\n return *this;\n }\n\n json_object(json_object&& rhs)\n {\n data = std::move(rhs.data);\n }\n\n json_object& operator=(json_object&& rhs)\n {\n data = std::move(rhs.data);\n return *this;\n }\n\n const json_value& operator[](const std::string& key) const override\n {\n auto found = data.find(key);\n if (found == data.cend()) {\n throw key_not_found();\n } else {\n return *(found->second);\n }\n }\n\n ~json_object()\n {\n for (auto& o : data) {\n delete o.second;\n }\n data.clear();\n }\n\n bool append(const std::string& key, json_value* value) noexcept\n {\n auto ret = data.insert(std::make_pair(key, value));\n return ret.second;\n }\n\n void remove(const std::string& key)\n {\n auto found = data.find(key);\n if (found != data.end())\n data.erase(found);\n }\n\nprotected:\n value_type type() const noexcept override\n {\n return value_type::object;\n }\n\nprivate:\n std::unordered_map<std::string, json_value*> data;\n};\n\nMUDI_N_NS_END\n\n\/\/ number\n\nMUDI_N_NS_BEGIN\n\nclass json_number: public json_value\n{\npublic:\n json_number(unsigned int pos, unsigned int len, buffer_ptr buf): pos{ pos }, len{ len }, buffer{ buf }\n {}\n\n json_number(const json_number& rhs): pos{ rhs.pos }, len{ rhs.len }, buffer{ rhs.buffer }\n {}\n\n json_number& operator=(const json_number& rhs)\n {\n if (&rhs == this) {\n return *this;\n }\n\n pos = rhs.pos;\n len = rhs.len;\n buffer = rhs.buffer;\n\n return *this;\n }\n\n json_number(json_number&& rhs): pos{ rhs.pos }, len{ rhs.len }\n {\n buffer = std::move(rhs.buffer);\n }\n\n json_number& operator=(json_number&& rhs)\n {\n pos = rhs.pos;\n len = rhs.len;\n buffer = std::move(rhs.buffer);\n\n return *this;\n }\n\n int int_value() const noexcept override\n {\n return 0;\n }\n\n double double_value() const noexcept override\n {\n return 0;\n }\n\nprotected:\n value_type type() const noexcept override\n {\n return value_type::number;\n }\n\nprivate:\n unsigned int pos;\n unsigned int len;\n buffer_ptr buffer;\n};\n\nMUDI_N_NS_END\n\n\/\/ boolean\n\nMUDI_N_NS_BEGIN\n\nclass json_boolean: public json_value\n{\npublic:\n json_boolean(unsigned int pos, unsigned int len, buffer_ptr buf): pos{ pos }, len{ len }, buffer{ buf }\n {}\n\n json_boolean(const json_boolean& rhs): pos{ rhs.pos }, len{ rhs.len }, buffer{ rhs.buffer }\n {}\n\n json_boolean& operator=(const json_boolean& rhs)\n {\n if (&rhs == this) {\n return *this;\n }\n\n pos = rhs.pos;\n len = rhs.len;\n buffer = rhs.buffer;\n\n return *this;\n }\n\n json_boolean(json_boolean&& rhs): pos{ rhs.pos }, len{ rhs.len }\n {\n buffer = std::move(rhs.buffer);\n }\n\n json_boolean& operator=(json_boolean&& rhs)\n {\n pos = rhs.pos;\n len = rhs.len;\n buffer = std::move(rhs.buffer);\n\n return *this;\n }\n\n bool boolean_value() const noexcept override\n {\n auto str = buffer->substr(pos, len);\n if (0 == str.compare(\"true\")) {\n return true;\n } else {\n return false;\n }\n }\n\nprotected:\n value_type type() const noexcept override\n {\n return value_type::boolean;\n }\n\nprivate:\n unsigned int pos;\n unsigned int len;\n buffer_ptr buffer;\n};\n\nMUDI_N_NS_END\n\n\/\/ parser\n\nMUDI_N_NS_BEGIN\n\nvoid Ensures(bool pred)\n{\n assert(pred);\n}\n\nclass json_parser\n{\npublic:\n json_parser(const std::string& input): cursor{ 0 }\n {\n buffer = make_shared(input);\n end = input.length();\n }\n\n json_parser(const char* input, unsigned int len): cursor{ 0 }, end{ len }\n {\n buffer = make_shared(input, len);\n }\n\n json_parser(const json_parser&) = delete;\n json_parser& operator=(const json_parser&) = delete;\n\n std::unique_ptr<json_value> parse()\n {\n\n }\n\nprivate:\n value_type get_next_value_type()\n {\n for(;;) {\n char c = peek_or_throw();\n if (isspace(c) || c == ':' || c == ',') {\n continue;\n } else if (c == '{') {\n return value_type::object;\n } else if (c == '[') {\n return value_type::array;\n } else if (c == '\\\"') {\n return value_type::string;\n } else if (isdigit(c)) {\n return value_type::number;\n } else if (c == '-') {\n char next = peek_or_throw(2);\n if (isdigit(next)) {\n return value_type::number;\n } else {\n throw unknown_input();\n }\n }\n }\n }\n\n char peek_or_throw(unsigned int delta = 1)\n {\n if (cursor + delta < end) {\n return buffer->at(cursor);\n }\n throw premature_eof();\n }\n\n char get_next_or_throw()\n {\n char ret = peek_or_throw();\n cursor += 1;\n return ret;\n }\n\n json_number parse_number();\n json_string parse_string();\n\nprivate:\n unsigned int cursor;\n unsigned int end;\n buffer_ptr buffer;\n};\n\njson_number json_parser::parse_number()\n{\n\n}\n\njson_string json_parser::pase_string()\n{\n Ensures(buffer->at(cursor) == \"\\\"\"); \/\/ precondition\n\n cursor += 1;\n unsigned int begin = cursor;\n\n for (unsigned int i = cursor; i < end; ++i) {\n char c = buffer->at(i);\n if (c == \"\\\\\") {\n char next = get_next_or_throw();\n if (next == \"\\\"\") {\n continue;\n }\n }\n\n if (c == \"\\\"\") {\n break;\n }\n }\n\n Ensures(buffer->at(cursor - 1) == \"\\\"\"); \/\/ postcondition\n}\n\nMUDI_N_NS_END\n\n#endif\n<|endoftext|>"} {"text":"<commit_before>#include \"command.hh\"\n#include \"globals.hh\"\n#include \"eval.hh\"\n#include \"eval-inline.hh\"\n#include \"names.hh\"\n#include \"get-drvs.hh\"\n#include \"common-args.hh\"\n#include \"json.hh\"\n#include \"shared.hh\"\n#include \"eval-cache.hh\"\n#include \"attr-path.hh\"\n\n#include <regex>\n#include <fstream>\n\nusing namespace nix;\n\nstd::string wrap(std::string prefix, std::string s)\n{\n return prefix + s + ANSI_NORMAL;\n}\n\nstd::string hilite(const std::string & s, const std::smatch & m, std::string postfix)\n{\n return\n m.empty()\n ? s\n : std::string(m.prefix())\n + ANSI_GREEN + std::string(m.str()) + postfix\n + std::string(m.suffix());\n}\n\nstruct CmdSearch : InstallableCommand, MixJSON\n{\n std::vector<std::string> res;\n\n CmdSearch()\n {\n expectArgs(\"regex\", &res);\n }\n\n std::string description() override\n {\n return \"query available packages\";\n }\n\n Examples examples() override\n {\n return {\n Example{\n \"To show all packages in the flake in the current directory:\",\n \"nix search\"\n },\n Example{\n \"To show packages in the 'nixpkgs' flake containing 'blender' in its name or description:\",\n \"nix search nixpkgs blender\"\n },\n Example{\n \"To search for Firefox or Chromium:\",\n \"nix search nixpkgs 'firefox|chromium'\"\n },\n Example{\n \"To search for packages containing 'git' and either 'frontend' or 'gui':\",\n \"nix search nixpkgs git 'frontend|gui'\"\n }\n };\n }\n\n Strings getDefaultFlakeAttrPaths() override\n {\n return {\n \"packages.\" + settings.thisSystem.get() + \".\",\n \"legacyPackages.\" + settings.thisSystem.get() + \".\"\n };\n }\n\n void run(ref<Store> store) override\n {\n settings.readOnlyMode = true;\n\n \/\/ Empty search string should match all packages\n \/\/ Use \"^\" here instead of \".*\" due to differences in resulting highlighting\n \/\/ (see #1893 -- libc++ claims empty search string is not in POSIX grammar)\n if (res.empty())\n res.push_back(\"^\");\n\n std::vector<std::regex> regexes;\n regexes.reserve(res.size());\n\n for (auto & re : res)\n regexes.push_back(std::regex(re, std::regex::extended | std::regex::icase));\n\n auto state = getEvalState();\n\n auto jsonOut = json ? std::make_unique<JSONObject>(std::cout) : nullptr;\n\n uint64_t results = 0;\n\n std::function<void(eval_cache::AttrCursor & cursor, const std::vector<Symbol> & attrPath)> visit;\n\n visit = [&](eval_cache::AttrCursor & cursor, const std::vector<Symbol> & attrPath)\n {\n Activity act(*logger, lvlInfo, actUnknown,\n fmt(\"evaluating '%s'\", concatStringsSep(\".\", attrPath)));\n try {\n auto recurse = [&]()\n {\n for (const auto & attr : cursor.getAttrs()) {\n auto cursor2 = cursor.getAttr(attr);\n auto attrPath2(attrPath);\n attrPath2.push_back(attr);\n visit(*cursor2, attrPath2);\n }\n };\n\n if (cursor.isDerivation()) {\n size_t found = 0;\n\n DrvName name(cursor.getAttr(\"name\")->getString());\n\n auto aMeta = cursor.maybeGetAttr(\"meta\");\n auto aDescription = aMeta ? aMeta->maybeGetAttr(\"description\") : nullptr;\n auto description = aDescription ? aDescription->getString() : \"\";\n std::replace(description.begin(), description.end(), '\\n', ' ');\n auto attrPath2 = concatStringsSep(\".\", attrPath);\n\n std::smatch attrPathMatch;\n std::smatch descriptionMatch;\n std::smatch nameMatch;\n\n for (auto & regex : regexes) {\n std::regex_search(attrPath2, attrPathMatch, regex);\n std::regex_search(name.name, nameMatch, regex);\n std::regex_search(description, descriptionMatch, regex);\n if (!attrPathMatch.empty()\n || !nameMatch.empty()\n || !descriptionMatch.empty())\n found++;\n }\n\n if (found == res.size()) {\n results++;\n if (json) {\n auto jsonElem = jsonOut->object(attrPath2);\n jsonElem.attr(\"pkgName\", name.name);\n jsonElem.attr(\"version\", name.version);\n jsonElem.attr(\"description\", description);\n } else {\n auto name2 = hilite(name.name, nameMatch, \"\\e[0;2m\")\n + std::string(name.fullName, name.name.length());\n if (results > 1) logger->stdout(\"\");\n logger->stdout(\n \"* %s (%s)\",\n wrap(\"\\e[0;1m\", hilite(attrPath2, attrPathMatch, \"\\e[0;1m\")),\n wrap(\"\\e[0;2m\", hilite(name2, nameMatch, \"\\e[0;2m\")));\n if (description != \"\")\n logger->stdout(\n \" %s\", hilite(description, descriptionMatch, ANSI_NORMAL));\n }\n }\n }\n\n else if (\n attrPath.size() == 0\n || (attrPath[0] == \"legacyPackages\" && attrPath.size() <= 2)\n || (attrPath[0] == \"packages\" && attrPath.size() <= 2))\n recurse();\n\n } catch (EvalError & e) {\n if (!(attrPath.size() > 0 && attrPath[0] == \"legacyPackages\"))\n throw;\n }\n };\n\n for (auto & [cursor, prefix] : installable->getCursor(*state, true))\n visit(*cursor, parseAttrPath(*state, prefix));\n\n if (!results)\n throw Error(\"no results for the given search term(s)!\");\n }\n};\n\nstatic auto r1 = registerCommand<CmdSearch>(\"search\");\n<commit_msg>nix search: Show version<commit_after>#include \"command.hh\"\n#include \"globals.hh\"\n#include \"eval.hh\"\n#include \"eval-inline.hh\"\n#include \"names.hh\"\n#include \"get-drvs.hh\"\n#include \"common-args.hh\"\n#include \"json.hh\"\n#include \"shared.hh\"\n#include \"eval-cache.hh\"\n#include \"attr-path.hh\"\n\n#include <regex>\n#include <fstream>\n\nusing namespace nix;\n\nstd::string wrap(std::string prefix, std::string s)\n{\n return prefix + s + ANSI_NORMAL;\n}\n\nstd::string hilite(const std::string & s, const std::smatch & m, std::string postfix)\n{\n return\n m.empty()\n ? s\n : std::string(m.prefix())\n + ANSI_GREEN + std::string(m.str()) + postfix\n + std::string(m.suffix());\n}\n\nstruct CmdSearch : InstallableCommand, MixJSON\n{\n std::vector<std::string> res;\n\n CmdSearch()\n {\n expectArgs(\"regex\", &res);\n }\n\n std::string description() override\n {\n return \"query available packages\";\n }\n\n Examples examples() override\n {\n return {\n Example{\n \"To show all packages in the flake in the current directory:\",\n \"nix search\"\n },\n Example{\n \"To show packages in the 'nixpkgs' flake containing 'blender' in its name or description:\",\n \"nix search nixpkgs blender\"\n },\n Example{\n \"To search for Firefox or Chromium:\",\n \"nix search nixpkgs 'firefox|chromium'\"\n },\n Example{\n \"To search for packages containing 'git' and either 'frontend' or 'gui':\",\n \"nix search nixpkgs git 'frontend|gui'\"\n }\n };\n }\n\n Strings getDefaultFlakeAttrPaths() override\n {\n return {\n \"packages.\" + settings.thisSystem.get() + \".\",\n \"legacyPackages.\" + settings.thisSystem.get() + \".\"\n };\n }\n\n void run(ref<Store> store) override\n {\n settings.readOnlyMode = true;\n\n \/\/ Empty search string should match all packages\n \/\/ Use \"^\" here instead of \".*\" due to differences in resulting highlighting\n \/\/ (see #1893 -- libc++ claims empty search string is not in POSIX grammar)\n if (res.empty())\n res.push_back(\"^\");\n\n std::vector<std::regex> regexes;\n regexes.reserve(res.size());\n\n for (auto & re : res)\n regexes.push_back(std::regex(re, std::regex::extended | std::regex::icase));\n\n auto state = getEvalState();\n\n auto jsonOut = json ? std::make_unique<JSONObject>(std::cout) : nullptr;\n\n uint64_t results = 0;\n\n std::function<void(eval_cache::AttrCursor & cursor, const std::vector<Symbol> & attrPath)> visit;\n\n visit = [&](eval_cache::AttrCursor & cursor, const std::vector<Symbol> & attrPath)\n {\n Activity act(*logger, lvlInfo, actUnknown,\n fmt(\"evaluating '%s'\", concatStringsSep(\".\", attrPath)));\n try {\n auto recurse = [&]()\n {\n for (const auto & attr : cursor.getAttrs()) {\n auto cursor2 = cursor.getAttr(attr);\n auto attrPath2(attrPath);\n attrPath2.push_back(attr);\n visit(*cursor2, attrPath2);\n }\n };\n\n if (cursor.isDerivation()) {\n size_t found = 0;\n\n DrvName name(cursor.getAttr(\"name\")->getString());\n\n auto aMeta = cursor.maybeGetAttr(\"meta\");\n auto aDescription = aMeta ? aMeta->maybeGetAttr(\"description\") : nullptr;\n auto description = aDescription ? aDescription->getString() : \"\";\n std::replace(description.begin(), description.end(), '\\n', ' ');\n auto attrPath2 = concatStringsSep(\".\", attrPath);\n\n std::smatch attrPathMatch;\n std::smatch descriptionMatch;\n std::smatch nameMatch;\n\n for (auto & regex : regexes) {\n std::regex_search(attrPath2, attrPathMatch, regex);\n std::regex_search(name.name, nameMatch, regex);\n std::regex_search(description, descriptionMatch, regex);\n if (!attrPathMatch.empty()\n || !nameMatch.empty()\n || !descriptionMatch.empty())\n found++;\n }\n\n if (found == res.size()) {\n results++;\n if (json) {\n auto jsonElem = jsonOut->object(attrPath2);\n jsonElem.attr(\"pname\", name.name);\n jsonElem.attr(\"version\", name.version);\n jsonElem.attr(\"description\", description);\n } else {\n auto name2 = hilite(name.name, nameMatch, \"\\e[0;2m\");\n if (results > 1) logger->stdout(\"\");\n logger->stdout(\n \"* %s%s\",\n wrap(\"\\e[0;1m\", hilite(attrPath2, attrPathMatch, \"\\e[0;1m\")),\n name.version != \"\" ? \" (\" + name.version + \")\" : \"\");\n if (description != \"\")\n logger->stdout(\n \" %s\", hilite(description, descriptionMatch, ANSI_NORMAL));\n }\n }\n }\n\n else if (\n attrPath.size() == 0\n || (attrPath[0] == \"legacyPackages\" && attrPath.size() <= 2)\n || (attrPath[0] == \"packages\" && attrPath.size() <= 2))\n recurse();\n\n } catch (EvalError & e) {\n if (!(attrPath.size() > 0 && attrPath[0] == \"legacyPackages\"))\n throw;\n }\n };\n\n for (auto & [cursor, prefix] : installable->getCursor(*state, true))\n visit(*cursor, parseAttrPath(*state, prefix));\n\n if (!results)\n throw Error(\"no results for the given search term(s)!\");\n }\n};\n\nstatic auto r1 = registerCommand<CmdSearch>(\"search\");\n<|endoftext|>"} {"text":"<commit_before>#include \"json_v8_renderer.hpp\"\n\n\/\/ v8\n#include <nan.h>\n\n\/\/ OSRM\n#include <osrm\/json_container.hpp>\n#include <osrm\/libosrm_config.hpp>\n#include <osrm\/osrm.hpp>\n#include <osrm\/route_parameters.hpp>\n\n\/\/ STL\n#include <iostream>\n#include <memory>\n\nnamespace node_osrm {\n\ntypedef std::unique_ptr<OSRM> osrm_ptr;\ntypedef std::unique_ptr<RouteParameters> route_parameters_ptr;\nnamespace {\ntemplate <class T, class... Types>\nstd::unique_ptr<T> make_unique(Types &&... Args)\n{\n return (std::unique_ptr<T>(new T(std::forward<Types>(Args)...)));\n}\n}\n\nusing namespace v8;\n\nclass Engine final : public node::ObjectWrap {\npublic:\n static Persistent<FunctionTemplate> constructor;\n static void Initialize(Handle<Object>);\n static NAN_METHOD(New);\n static NAN_METHOD(route);\n static NAN_METHOD(locate);\n static NAN_METHOD(nearest);\n static NAN_METHOD(table);\n\n static void Run(_NAN_METHOD_ARGS, route_parameters_ptr);\n static void AsyncRun(uv_work_t*);\n static void AfterRun(uv_work_t*);\n\nprivate:\n Engine(libosrm_config &lib_config)\n : ObjectWrap(),\n this_(make_unique<OSRM>(lib_config))\n {}\n\n osrm_ptr this_;\n};\n\nPersistent<FunctionTemplate> Engine::constructor;\n\nvoid Engine::Initialize(Handle<Object> target) {\n NanScope();\n Local<FunctionTemplate> lcons = NanNew<FunctionTemplate>(Engine::New);\n lcons->InstanceTemplate()->SetInternalFieldCount(1);\n lcons->SetClassName(NanNew(\"OSRM\"));\n NODE_SET_PROTOTYPE_METHOD(lcons, \"route\", route);\n NODE_SET_PROTOTYPE_METHOD(lcons, \"locate\", locate);\n NODE_SET_PROTOTYPE_METHOD(lcons, \"nearest\", nearest);\n NODE_SET_PROTOTYPE_METHOD(lcons, \"table\", table);\n target->Set(NanNew(\"OSRM\"), lcons->GetFunction());\n NanAssignPersistent(constructor, lcons);\n}\n\nNAN_METHOD(Engine::New)\n{\n NanScope();\n\n if (!args.IsConstructCall()) {\n NanThrowTypeError(\"Cannot call constructor as function, you need to use 'new' keyword\");\n NanReturnUndefined();\n }\n\n try {\n libosrm_config lib_config;\n if (args.Length() == 1) {\n std::string base = *String::Utf8Value(args[0]->ToString());\n lib_config.server_paths[\"base\"] = base;\n lib_config.use_shared_memory = false;\n } else if (args.Length() >= 2) {\n if (!args[1]->IsUint32()) {\n NanThrowError(\"the maximum number of locations in the distance table must be an unsigned integer\");\n NanReturnUndefined();\n }\n lib_config.max_locations_distance_table = args[1]->ToUint32()->Value();\n }\n\n auto im = new Engine(lib_config);\n im->Wrap(args.This());\n NanReturnValue(args.This());\n } catch (std::exception const& ex) {\n NanThrowTypeError(ex.what());\n NanReturnUndefined();\n }\n}\n\nstruct RunQueryBaton {\n uv_work_t request;\n Engine * machine;\n osrm::json::Object result;\n route_parameters_ptr params;\n Persistent<Function> cb;\n std::string error;\n};\n\nNAN_METHOD(Engine::route)\n{\n NanScope();\n\n if (args.Length() < 2) {\n NanThrowTypeError(\"two arguments required\");\n NanReturnUndefined();\n }\n\n if (!args[0]->IsObject()) {\n NanThrowTypeError(\"two arguments required\");\n NanReturnUndefined();\n }\n\n Local<Object> obj = args[0]->ToObject();\n if (obj->IsNull() || obj->IsUndefined()) {\n NanThrowError(\"first arg must be an object\");\n NanReturnUndefined();\n }\n\n route_parameters_ptr params = make_unique<RouteParameters>();\n\n params->zoom_level = 18; \/\/no generalization\n params->print_instructions = false; \/\/turn by turn instructions\n params->alternate_route = true; \/\/get an alternate route, too\n params->geometry = true; \/\/retrieve geometry of route\n params->compression = true; \/\/polyline encoding\n params->check_sum = 0; \/\/see wiki\n params->service = \"viaroute\"; \/\/that's routing\n params->output_format = \"json\";\n params->jsonp_parameter = \"\"; \/\/set for jsonp wrapping\n params->language = \"\"; \/\/unused atm\n\n if (!obj->Has(NanNew(\"coordinates\"))) {\n NanThrowError(\"must provide a coordinates property\");\n NanReturnUndefined();\n }\n\n Local<Value> coordinates = obj->Get(NanNew(\"coordinates\"));\n if (!coordinates->IsArray()) {\n NanThrowError(\"coordinates must be an array of (lat\/long) pairs\");\n NanReturnUndefined();\n }\n\n Local<Array> coordinates_array = Local<Array>::Cast(coordinates);\n if (coordinates_array->Length() < 2) {\n NanThrowError(\"at least two coordinates must be provided\");\n NanReturnUndefined();\n }\n\n for (uint32_t i = 0; i < coordinates_array->Length(); ++i) {\n Local<Value> coordinate = coordinates_array->Get(i);\n\n if (!coordinate->IsArray()) {\n NanThrowError(\"coordinates must be an array of (lat\/long) pairs\");\n NanReturnUndefined();\n }\n\n Local<Array> coordinate_pair = Local<Array>::Cast(coordinate);\n if (coordinate_pair->Length() != 2) {\n NanThrowError(\"coordinates must be an array of (lat\/long) pairs\");\n NanReturnUndefined();\n }\n\n params->coordinates.emplace_back(static_cast<int>(coordinate_pair->Get(0)->NumberValue()*COORDINATE_PRECISION),\n static_cast<int>(coordinate_pair->Get(1)->NumberValue()*COORDINATE_PRECISION));\n }\n\n if (obj->Has(NanNew(\"alternateRoute\"))) {\n params->alternate_route = obj->Get(NanNew(\"alternateRoute\"))->BooleanValue();\n }\n\n if (obj->Has(NanNew(\"checksum\"))) {\n params->check_sum = static_cast<unsigned>(obj->Get(NanNew(\"checksum\"))->Uint32Value());\n }\n\n if (obj->Has(NanNew(\"zoomLevel\"))) {\n params->zoom_level = static_cast<short>(obj->Get(NanNew(\"zoomLevel\"))->Int32Value());\n }\n\n if (obj->Has(NanNew(\"printInstructions\"))) {\n params->print_instructions = obj->Get(NanNew(\"printInstructions\"))->BooleanValue();\n }\n\n if (obj->Has(NanNew(\"jsonpParameter\"))) {\n params->jsonp_parameter = *v8::String::Utf8Value(obj->Get(NanNew(\"jsonpParameter\")));\n }\n\n if (obj->Has(NanNew(\"hints\"))) {\n Local<Value> hints = obj->Get(NanNew(\"hints\"));\n\n if (!hints->IsArray()) {\n NanThrowError(\"hints must be an array of strings\/null\");\n NanReturnUndefined();\n }\n\n Local<Array> hints_array = Local<Array>::Cast(hints);\n for (uint32_t i = 0; i < hints_array->Length(); ++i) {\n Local<Value> hint = hints_array->Get(i);\n if (hint->IsString()) {\n params->hints.push_back(*v8::String::Utf8Value(hint));\n } else if(hint->IsNull()){\n params->hints.push_back(\"\");\n }else{\n NanThrowError(\"hint must be null or string\");\n NanReturnUndefined();\n }\n }\n }\n\n Run(args, std::move(params));\n NanReturnUndefined();\n}\n\nNAN_METHOD(Engine::locate)\n{\n NanScope();\n if (args.Length() < 2) {\n NanThrowTypeError(\"two arguments required\");\n NanReturnUndefined();\n }\n\n Local<Value> coordinate = args[0];\n if (!coordinate->IsArray()) {\n NanThrowError(\"first argument must be an array of lat, long\");\n NanReturnUndefined();\n }\n\n Local<Array> coordinate_pair = Local<Array>::Cast(coordinate);\n if (coordinate_pair->Length() != 2) {\n NanThrowError(\"first argument must be an array of lat, long\");\n NanReturnUndefined();\n }\n\n route_parameters_ptr params = make_unique<RouteParameters>();\n\n params->service = \"locate\";\n params->coordinates.emplace_back(static_cast<int>(coordinate_pair->Get(0)->NumberValue()*COORDINATE_PRECISION),\n static_cast<int>(coordinate_pair->Get(1)->NumberValue()*COORDINATE_PRECISION));\n\n Run(args, std::move(params));\n NanReturnUndefined();\n}\n\nNAN_METHOD(Engine::table)\n{\n NanScope();\n if (args.Length() < 2) {\n NanThrowTypeError(\"two arguments required\");\n NanReturnUndefined();\n }\n\n Local<Object> obj = args[0]->ToObject();\n if (obj->IsNull() || obj->IsUndefined()) {\n NanThrowError(\"first arg must be an object\");\n NanReturnUndefined();\n }\n\n Local<Value> coordinates = obj->Get(NanNew(\"coordinates\"));\n if (!coordinates->IsArray()) {\n NanThrowError(\"coordinates must be an array of (lat\/long) pairs\");\n NanReturnUndefined();\n }\n\n Local<Array> coordinates_array = Local<Array>::Cast(coordinates);\n if (coordinates_array->Length() < 2) {\n NanThrowError(\"at least two coordinates must be provided\");\n NanReturnUndefined();\n }\n\n route_parameters_ptr params = make_unique<RouteParameters>();\n params->service = \"table\";\n\n \/\/ add all coordinates\n for (uint32_t i = 0; i < coordinates_array->Length(); ++i) {\n Local<Value> coordinate = coordinates_array->Get(i);\n\n if (!coordinate->IsArray()) {\n NanThrowError(\"coordinates must be an array of (lat\/long) pairs\");\n NanReturnUndefined();\n }\n\n Local<Array> coordinate_pair = Local<Array>::Cast(coordinate);\n if (coordinate_pair->Length() != 2) {\n NanThrowError(\"coordinates must be an array of (lat\/long) pairs\");\n NanReturnUndefined();\n }\n\n params->coordinates.emplace_back(static_cast<int>(coordinate_pair->Get(0)->NumberValue()*COORDINATE_PRECISION),\n static_cast<int>(coordinate_pair->Get(1)->NumberValue()*COORDINATE_PRECISION));\n }\n\n Run(args, std::move(params));\n NanReturnUndefined();\n}\n\nNAN_METHOD(Engine::nearest)\n{\n NanScope();\n if (args.Length() < 2) {\n NanThrowTypeError(\"two arguments required\");\n NanReturnUndefined();\n }\n\n Local<Value> coordinate = args[0];\n if (!coordinate->IsArray()) {\n NanThrowError(\"first argument must be an array of lat, long\");\n NanReturnUndefined();\n }\n\n Local<Array> coordinate_pair = Local<Array>::Cast(coordinate);\n if (coordinate_pair->Length() != 2) {\n NanThrowError(\"first argument must be an array of lat, long\");\n NanReturnUndefined();\n }\n\n route_parameters_ptr params = make_unique<RouteParameters>();\n\n params->service = \"nearest\";\n params->coordinates.emplace_back(static_cast<int>(coordinate_pair->Get(0)->NumberValue()*COORDINATE_PRECISION),\n static_cast<int>(coordinate_pair->Get(1)->NumberValue()*COORDINATE_PRECISION));\n Run(args, std::move(params));\n NanReturnUndefined();\n}\n\nvoid Engine::Run(_NAN_METHOD_ARGS, route_parameters_ptr params)\n{\n NanScope();\n Local<Value> callback = args[args.Length()-1];\n\n if (!callback->IsFunction()) {\n NanThrowTypeError(\"last argument must be a callback function\");\n return;\n }\n\n auto closure = new RunQueryBaton();\n closure->request.data = closure;\n closure->machine = ObjectWrap::Unwrap<Engine>(args.This());\n closure->params = std::move(params);\n closure->error = \"\";\n NanAssignPersistent(closure->cb, callback.As<Function>());\n uv_queue_work(uv_default_loop(), &closure->request, AsyncRun, reinterpret_cast<uv_after_work_cb>(AfterRun));\n closure->machine->Ref();\n return;\n}\n\nvoid Engine::AsyncRun(uv_work_t* req) {\n RunQueryBaton *closure = static_cast<RunQueryBaton *>(req->data);\n try {\n closure->machine->this_->RunQuery(*closure->params, closure->result);\n } catch(std::exception const& ex) {\n closure->error = ex.what();\n }\n}\n\nvoid Engine::AfterRun(uv_work_t* req) {\n NanScope();\n RunQueryBaton *closure = static_cast<RunQueryBaton *>(req->data);\n TryCatch try_catch;\n if (closure->error.size() > 0) {\n Local<Value> argv[1] = { NanError(closure->error.c_str()) };\n NanMakeCallback(NanGetCurrentContext()->Global(), NanNew(closure->cb), 1, argv);\n } else {\n Local<Value> result;\n osrm::json::render(result, closure->result);\n Local<Value> argv[2] = { NanNull(), result };\n NanMakeCallback(NanGetCurrentContext()->Global(), NanNew(closure->cb), 2, argv);\n }\n if (try_catch.HasCaught()) {\n node::FatalException(try_catch);\n }\n closure->machine->Unref();\n NanDisposePersistent(closure->cb);\n delete closure;\n}\n\nextern \"C\" {\n static void start(Handle<Object> target) {\n Engine::Initialize(target);\n }\n}\n\n} \/\/ namespace node_osrm\n\nNODE_MODULE(osrm, node_osrm::start)\n<commit_msg>Add interface for match service.<commit_after>#include \"json_v8_renderer.hpp\"\n\n\/\/ v8\n#include <nan.h>\n\n\/\/ OSRM\n#include <osrm\/json_container.hpp>\n#include <osrm\/libosrm_config.hpp>\n#include <osrm\/osrm.hpp>\n#include <osrm\/route_parameters.hpp>\n\n\/\/ STL\n#include <iostream>\n#include <memory>\n\nnamespace node_osrm {\n\ntypedef std::unique_ptr<OSRM> osrm_ptr;\ntypedef std::unique_ptr<RouteParameters> route_parameters_ptr;\nnamespace {\ntemplate <class T, class... Types>\nstd::unique_ptr<T> make_unique(Types &&... Args)\n{\n return (std::unique_ptr<T>(new T(std::forward<Types>(Args)...)));\n}\n}\n\nusing namespace v8;\n\nclass Engine final : public node::ObjectWrap {\npublic:\n static Persistent<FunctionTemplate> constructor;\n static void Initialize(Handle<Object>);\n static NAN_METHOD(New);\n static NAN_METHOD(route);\n static NAN_METHOD(locate);\n static NAN_METHOD(nearest);\n static NAN_METHOD(table);\n static NAN_METHOD(match);\n\n static void Run(_NAN_METHOD_ARGS, route_parameters_ptr);\n static void AsyncRun(uv_work_t*);\n static void AfterRun(uv_work_t*);\n\nprivate:\n Engine(libosrm_config &lib_config)\n : ObjectWrap(),\n this_(make_unique<OSRM>(lib_config))\n {}\n\n osrm_ptr this_;\n};\n\nPersistent<FunctionTemplate> Engine::constructor;\n\nvoid Engine::Initialize(Handle<Object> target) {\n NanScope();\n Local<FunctionTemplate> lcons = NanNew<FunctionTemplate>(Engine::New);\n lcons->InstanceTemplate()->SetInternalFieldCount(1);\n lcons->SetClassName(NanNew(\"OSRM\"));\n NODE_SET_PROTOTYPE_METHOD(lcons, \"route\", route);\n NODE_SET_PROTOTYPE_METHOD(lcons, \"locate\", locate);\n NODE_SET_PROTOTYPE_METHOD(lcons, \"nearest\", nearest);\n NODE_SET_PROTOTYPE_METHOD(lcons, \"table\", table);\n NODE_SET_PROTOTYPE_METHOD(lcons, \"match\", match);\n target->Set(NanNew(\"OSRM\"), lcons->GetFunction());\n NanAssignPersistent(constructor, lcons);\n}\n\nNAN_METHOD(Engine::New)\n{\n NanScope();\n\n if (!args.IsConstructCall()) {\n NanThrowTypeError(\"Cannot call constructor as function, you need to use 'new' keyword\");\n NanReturnUndefined();\n }\n\n try {\n libosrm_config lib_config;\n if (args.Length() == 1) {\n std::string base = *String::Utf8Value(args[0]->ToString());\n lib_config.server_paths[\"base\"] = base;\n lib_config.use_shared_memory = false;\n } else if (args.Length() >= 2) {\n if (!args[1]->IsUint32()) {\n NanThrowError(\"the maximum number of locations in the distance table must be an unsigned integer\");\n NanReturnUndefined();\n }\n lib_config.max_locations_distance_table = args[1]->ToUint32()->Value();\n }\n\n auto im = new Engine(lib_config);\n im->Wrap(args.This());\n NanReturnValue(args.This());\n } catch (std::exception const& ex) {\n NanThrowTypeError(ex.what());\n NanReturnUndefined();\n }\n}\n\nstruct RunQueryBaton {\n uv_work_t request;\n Engine * machine;\n osrm::json::Object result;\n route_parameters_ptr params;\n Persistent<Function> cb;\n std::string error;\n};\n\nNAN_METHOD(Engine::route)\n{\n NanScope();\n\n if (args.Length() < 2) {\n NanThrowTypeError(\"two arguments required\");\n NanReturnUndefined();\n }\n\n if (!args[0]->IsObject()) {\n NanThrowTypeError(\"two arguments required\");\n NanReturnUndefined();\n }\n\n Local<Object> obj = args[0]->ToObject();\n if (obj->IsNull() || obj->IsUndefined()) {\n NanThrowError(\"first arg must be an object\");\n NanReturnUndefined();\n }\n\n route_parameters_ptr params = make_unique<RouteParameters>();\n\n params->zoom_level = 18; \/\/no generalization\n params->print_instructions = false; \/\/turn by turn instructions\n params->alternate_route = true; \/\/get an alternate route, too\n params->geometry = true; \/\/retrieve geometry of route\n params->compression = true; \/\/polyline encoding\n params->check_sum = 0; \/\/see wiki\n params->service = \"viaroute\"; \/\/that's routing\n params->output_format = \"json\";\n params->jsonp_parameter = \"\"; \/\/set for jsonp wrapping\n params->language = \"\"; \/\/unused atm\n\n if (!obj->Has(NanNew(\"coordinates\"))) {\n NanThrowError(\"must provide a coordinates property\");\n NanReturnUndefined();\n }\n\n Local<Value> coordinates = obj->Get(NanNew(\"coordinates\"));\n if (!coordinates->IsArray()) {\n NanThrowError(\"coordinates must be an array of (lat\/long) pairs\");\n NanReturnUndefined();\n }\n\n Local<Array> coordinates_array = Local<Array>::Cast(coordinates);\n if (coordinates_array->Length() < 2) {\n NanThrowError(\"at least two coordinates must be provided\");\n NanReturnUndefined();\n }\n\n for (uint32_t i = 0; i < coordinates_array->Length(); ++i) {\n Local<Value> coordinate = coordinates_array->Get(i);\n\n if (!coordinate->IsArray()) {\n NanThrowError(\"coordinates must be an array of (lat\/long) pairs\");\n NanReturnUndefined();\n }\n\n Local<Array> coordinate_pair = Local<Array>::Cast(coordinate);\n if (coordinate_pair->Length() != 2) {\n NanThrowError(\"coordinates must be an array of (lat\/long) pairs\");\n NanReturnUndefined();\n }\n\n params->coordinates.emplace_back(static_cast<int>(coordinate_pair->Get(0)->NumberValue()*COORDINATE_PRECISION),\n static_cast<int>(coordinate_pair->Get(1)->NumberValue()*COORDINATE_PRECISION));\n }\n\n if (obj->Has(NanNew(\"alternateRoute\"))) {\n params->alternate_route = obj->Get(NanNew(\"alternateRoute\"))->BooleanValue();\n }\n\n if (obj->Has(NanNew(\"checksum\"))) {\n params->check_sum = static_cast<unsigned>(obj->Get(NanNew(\"checksum\"))->Uint32Value());\n }\n\n if (obj->Has(NanNew(\"zoomLevel\"))) {\n params->zoom_level = static_cast<short>(obj->Get(NanNew(\"zoomLevel\"))->Int32Value());\n }\n\n if (obj->Has(NanNew(\"printInstructions\"))) {\n params->print_instructions = obj->Get(NanNew(\"printInstructions\"))->BooleanValue();\n }\n\n if (obj->Has(NanNew(\"jsonpParameter\"))) {\n params->jsonp_parameter = *v8::String::Utf8Value(obj->Get(NanNew(\"jsonpParameter\")));\n }\n\n if (obj->Has(NanNew(\"hints\"))) {\n Local<Value> hints = obj->Get(NanNew(\"hints\"));\n\n if (!hints->IsArray()) {\n NanThrowError(\"hints must be an array of strings\/null\");\n NanReturnUndefined();\n }\n\n Local<Array> hints_array = Local<Array>::Cast(hints);\n for (uint32_t i = 0; i < hints_array->Length(); ++i) {\n Local<Value> hint = hints_array->Get(i);\n if (hint->IsString()) {\n params->hints.push_back(*v8::String::Utf8Value(hint));\n } else if(hint->IsNull()){\n params->hints.push_back(\"\");\n }else{\n NanThrowError(\"hint must be null or string\");\n NanReturnUndefined();\n }\n }\n }\n\n Run(args, std::move(params));\n NanReturnUndefined();\n}\n\nNAN_METHOD(Engine::locate)\n{\n NanScope();\n if (args.Length() < 2) {\n NanThrowTypeError(\"two arguments required\");\n NanReturnUndefined();\n }\n\n Local<Value> coordinate = args[0];\n if (!coordinate->IsArray()) {\n NanThrowError(\"first argument must be an array of lat, long\");\n NanReturnUndefined();\n }\n\n Local<Array> coordinate_pair = Local<Array>::Cast(coordinate);\n if (coordinate_pair->Length() != 2) {\n NanThrowError(\"first argument must be an array of lat, long\");\n NanReturnUndefined();\n }\n\n route_parameters_ptr params = make_unique<RouteParameters>();\n\n params->service = \"locate\";\n params->coordinates.emplace_back(static_cast<int>(coordinate_pair->Get(0)->NumberValue()*COORDINATE_PRECISION),\n static_cast<int>(coordinate_pair->Get(1)->NumberValue()*COORDINATE_PRECISION));\n\n Run(args, std::move(params));\n NanReturnUndefined();\n}\n\nNAN_METHOD(Engine::match)\n{\n NanScope();\n if (args.Length() < 2) {\n NanThrowTypeError(\"two arguments required\");\n NanReturnUndefined();\n }\n\n Local<Object> obj = args[0]->ToObject();\n if (obj->IsNull() || obj->IsUndefined()) {\n NanThrowError(\"first arg must be an object\");\n NanReturnUndefined();\n }\n\n Local<Value> coordinates = obj->Get(NanNew(\"coordinates\"));\n if (!coordinates->IsArray()) {\n NanThrowError(\"coordinates must be an array of (lat\/long) pairs\");\n NanReturnUndefined();\n }\n\n Local<Array> coordinates_array = Local<Array>::Cast(coordinates);\n if (coordinates_array->Length() < 2) {\n NanThrowError(\"at least two coordinates must be provided\");\n NanReturnUndefined();\n }\n\n Local<Value> timestamps = obj->Get(NanNew(\"timestamps\"));\n if (!coordinates->IsArray() && !timestamps->IsUndefined()) {\n NanThrowError(\"timestamps must be an array of integers (or undefined)\");\n NanReturnUndefined();\n }\n\n route_parameters_ptr params = make_unique<RouteParameters>();\n params->service = \"match\";\n\n if (timestamps->IsArray()) {\n Local<Array> timestamps_array = Local<Array>::Cast(timestamps);\n if (coordinates_array->Length() != timestamps_array->Length()) {\n NanThrowError(\"timestamp array must have the same size as the coordinates array\");\n NanReturnUndefined();\n }\n\n \/\/ add all timestamps\n for (uint32_t i = 0; i < timestamps_array->Length(); ++i) {\n params->timestamps.emplace_back(static_cast<unsigned>(timestamps_array->Get(i)->NumberValue()));\n }\n }\n\n \/\/ add all coordinates\n for (uint32_t i = 0; i < coordinates_array->Length(); ++i) {\n Local<Value> coordinate = coordinates_array->Get(i);\n\n if (!coordinate->IsArray()) {\n NanThrowError(\"coordinates must be an array of (lat\/long) pairs\");\n NanReturnUndefined();\n }\n\n Local<Array> coordinate_pair = Local<Array>::Cast(coordinate);\n if (coordinate_pair->Length() != 2) {\n NanThrowError(\"coordinates must be an array of (lat\/long) pairs\");\n NanReturnUndefined();\n }\n\n params->coordinates.emplace_back(static_cast<int>(coordinate_pair->Get(0)->NumberValue()*COORDINATE_PRECISION),\n static_cast<int>(coordinate_pair->Get(1)->NumberValue()*COORDINATE_PRECISION));\n\n }\n\n Run(args, std::move(params));\n NanReturnUndefined();\n}\n\nNAN_METHOD(Engine::table)\n{\n NanScope();\n if (args.Length() < 2) {\n NanThrowTypeError(\"two arguments required\");\n NanReturnUndefined();\n }\n\n Local<Object> obj = args[0]->ToObject();\n if (obj->IsNull() || obj->IsUndefined()) {\n NanThrowError(\"first arg must be an object\");\n NanReturnUndefined();\n }\n\n Local<Value> coordinates = obj->Get(NanNew(\"coordinates\"));\n if (!coordinates->IsArray()) {\n NanThrowError(\"coordinates must be an array of (lat\/long) pairs\");\n NanReturnUndefined();\n }\n\n Local<Array> coordinates_array = Local<Array>::Cast(coordinates);\n if (coordinates_array->Length() < 2) {\n NanThrowError(\"at least two coordinates must be provided\");\n NanReturnUndefined();\n }\n\n route_parameters_ptr params = make_unique<RouteParameters>();\n params->service = \"table\";\n\n \/\/ add all coordinates\n for (uint32_t i = 0; i < coordinates_array->Length(); ++i) {\n Local<Value> coordinate = coordinates_array->Get(i);\n\n if (!coordinate->IsArray()) {\n NanThrowError(\"coordinates must be an array of (lat\/long) pairs\");\n NanReturnUndefined();\n }\n\n Local<Array> coordinate_pair = Local<Array>::Cast(coordinate);\n if (coordinate_pair->Length() != 2) {\n NanThrowError(\"coordinates must be an array of (lat\/long) pairs\");\n NanReturnUndefined();\n }\n\n params->coordinates.emplace_back(static_cast<int>(coordinate_pair->Get(0)->NumberValue()*COORDINATE_PRECISION),\n static_cast<int>(coordinate_pair->Get(1)->NumberValue()*COORDINATE_PRECISION));\n }\n\n Run(args, std::move(params));\n NanReturnUndefined();\n}\n\nNAN_METHOD(Engine::nearest)\n{\n NanScope();\n if (args.Length() < 2) {\n NanThrowTypeError(\"two arguments required\");\n NanReturnUndefined();\n }\n\n Local<Value> coordinate = args[0];\n if (!coordinate->IsArray()) {\n NanThrowError(\"first argument must be an array of lat, long\");\n NanReturnUndefined();\n }\n\n Local<Array> coordinate_pair = Local<Array>::Cast(coordinate);\n if (coordinate_pair->Length() != 2) {\n NanThrowError(\"first argument must be an array of lat, long\");\n NanReturnUndefined();\n }\n\n route_parameters_ptr params = make_unique<RouteParameters>();\n\n params->service = \"nearest\";\n params->coordinates.emplace_back(static_cast<int>(coordinate_pair->Get(0)->NumberValue()*COORDINATE_PRECISION),\n static_cast<int>(coordinate_pair->Get(1)->NumberValue()*COORDINATE_PRECISION));\n Run(args, std::move(params));\n NanReturnUndefined();\n}\n\nvoid Engine::Run(_NAN_METHOD_ARGS, route_parameters_ptr params)\n{\n NanScope();\n Local<Value> callback = args[args.Length()-1];\n\n if (!callback->IsFunction()) {\n NanThrowTypeError(\"last argument must be a callback function\");\n return;\n }\n\n auto closure = new RunQueryBaton();\n closure->request.data = closure;\n closure->machine = ObjectWrap::Unwrap<Engine>(args.This());\n closure->params = std::move(params);\n closure->error = \"\";\n NanAssignPersistent(closure->cb, callback.As<Function>());\n uv_queue_work(uv_default_loop(), &closure->request, AsyncRun, reinterpret_cast<uv_after_work_cb>(AfterRun));\n closure->machine->Ref();\n return;\n}\n\nvoid Engine::AsyncRun(uv_work_t* req) {\n RunQueryBaton *closure = static_cast<RunQueryBaton *>(req->data);\n try {\n closure->machine->this_->RunQuery(*closure->params, closure->result);\n } catch(std::exception const& ex) {\n closure->error = ex.what();\n }\n}\n\nvoid Engine::AfterRun(uv_work_t* req) {\n NanScope();\n RunQueryBaton *closure = static_cast<RunQueryBaton *>(req->data);\n TryCatch try_catch;\n if (closure->error.size() > 0) {\n Local<Value> argv[1] = { NanError(closure->error.c_str()) };\n NanMakeCallback(NanGetCurrentContext()->Global(), NanNew(closure->cb), 1, argv);\n } else {\n Local<Value> result;\n osrm::json::render(result, closure->result);\n Local<Value> argv[2] = { NanNull(), result };\n NanMakeCallback(NanGetCurrentContext()->Global(), NanNew(closure->cb), 2, argv);\n }\n if (try_catch.HasCaught()) {\n node::FatalException(try_catch);\n }\n closure->machine->Unref();\n NanDisposePersistent(closure->cb);\n delete closure;\n}\n\nextern \"C\" {\n static void start(Handle<Object> target) {\n Engine::Initialize(target);\n }\n}\n\n} \/\/ namespace node_osrm\n\nNODE_MODULE(osrm, node_osrm::start)\n<|endoftext|>"} {"text":"<commit_before>\/\/ Copyright (c) 2018 alex v\n\/\/ Distributed under the MIT software license, see the accompanying\n\/\/ file COPYING or http:\/\/www.opensource.org\/licenses\/mit-license.php.\n\n#include \"init.h\"\n#include \"ntpclient.h\"\n#include \"random.h\"\n#include \"timedata.h\"\n#include \"util.h\"\n\n#include <sstream>\n#include <iomanip>\n\nusing namespace boost;\nusing namespace boost::asio;\n\nbool CNtpClient::getTimestamp(uint64_t &timeRecv)\n{\n\n io_service io_service;\n\n LogPrint(\"ntp\", \"[NTP] Opening socket to NTP server %s.\\n\", sHostName);\n try\n {\n\n ip::udp::resolver resolver(io_service);\n ip::udp::resolver::query query(boost::asio::ip::udp::v4(), sHostName, \"ntp\");\n\n ip::udp::endpoint receiver_endpoint = *resolver.resolve(query);\n\n ip::udp::socket socket(io_service);\n socket.open(ip::udp::v4());\n\n boost::array<unsigned char, 48> sendBuf = {{010,0,0,0,0,0,0,0,0}};\n\n socket.send_to(boost::asio::buffer(sendBuf), receiver_endpoint);\n\n boost::array<uint32_t, 1024> recvBuf;\n ip::udp::endpoint sender_endpoint;\n\n try\n {\n\n fd_set fileDescriptorSet;\n struct timeval timeStruct;\n\n timeStruct.tv_sec = GetArg(\"-ntptimeout\", DEFAULT_NTP_TIMEOUT);\n timeStruct.tv_usec = 0;\n FD_ZERO(&fileDescriptorSet);\n\n int nativeSocket = socket.native();\n\n FD_SET(nativeSocket,&fileDescriptorSet);\n\n select(nativeSocket+1,&fileDescriptorSet,NULL,NULL,&timeStruct);\n\n if(!FD_ISSET(nativeSocket,&fileDescriptorSet))\n {\n\n LogPrint(\"ntp\", \"[NTP] Could not read socket from NTP server %s (Read timeout)\\n\", sHostName);\n\n }\n else\n {\n\n socket.receive_from(boost::asio::buffer(recvBuf), sender_endpoint);\n\n timeRecv = ntohl((uint32_t)recvBuf[8]);\n\n if(timeRecv > 2208988800U) \/\/ Sanity check\n {\n\n timeRecv-= 2208988800U; \/\/ Substract 01\/01\/1970 == 2208988800U\n LogPrint(\"ntp\", \"[NTP] Received timestamp: %ll\\n\", (uint64_t)timeRecv);\n\n return true;\n\n }\n else\n {\n\n LogPrintf(\"[NTP] Received wrong clock from NTP server %s (bad timestamp format)\\n\", sHostName);\n\n }\n\n }\n\n }\n catch (std::exception& e)\n {\n\n LogPrintf(\"[NTP] Could not read clock from NTP server %s (%s)\\n\", sHostName, e.what());\n\n }\n\n }\n catch (std::exception& e)\n {\n\n LogPrintf(\"[NTP] Could not open socket to NTP server %s (%s)\\n\", sHostName, e.what());\n\n }\n\n return false;\n}\n\nbool NtpClockSync()\n{\n LogPrintf(\"[NTP] Starting clock sync...\\n\");\n\n std::vector<std::string> vNtpServers;\n std::vector<int64_t> vResults;\n\n if (mapMultiArgs[\"-ntpserver\"].size() > 0)\n {\n vNtpServers = mapMultiArgs[\"-ntpserver\"];\n }\n else\n {\n vNtpServers = vDefaultNtpServers;\n }\n\n string sReport = \"\";\n string sPrevServer = \"\";\n int64_t nPrevMeasure = -1;\n\n random_shuffle(vNtpServers.begin(), vNtpServers.end(), GetRandInt);\n\n unsigned int nMeasureCount = 0;\n\n for(unsigned int i = 0; i < vNtpServers.size(); i++)\n {\n string s = vNtpServers[i];\n CNtpClient ntpClient(s);\n uint64_t nTimestamp = 0;\n\n if (ShutdownRequested())\n return false;\n\n if(ntpClient.getTimestamp(nTimestamp))\n {\n int64_t nClockDrift = GetTimeNow() - nTimestamp;\n nMeasureCount++;\n\n \/\/ We push if its the first entry\n if(nMeasureCount == 1)\n {\n vResults.push_back(nClockDrift);\n\n string sign = \"\";\n if(nClockDrift > 0)\n sign = \"+\";\n\n sReport += s + \"[\" + sign + to_string(nClockDrift) + \"sec.] \";\n }\n \/\/ or if n.measure is odd, including prev measure too\n else if (nMeasureCount % 2 == 1)\n {\n vResults.push_back(nClockDrift);\n\n string sign = \"\";\n if(nClockDrift > 0)\n sign = \"+\";\n\n sReport += s + \"[\" + sign + to_string(nClockDrift) + \"sec.] \";\n\n vResults.push_back(nPrevMeasure);\n\n sign = \"\";\n if(nPrevMeasure > 0)\n sign = \"+\";\n\n sReport += sPrevServer + \"[\" + sign + to_string(nPrevMeasure) + \"sec.] \";\n }\n else\n {\n nPrevMeasure = nClockDrift;\n sPrevServer = s;\n }\n\n if (vResults.size() >= 5)\n break;\n }\n }\n\n assert(vResults.size() % 2 == 1 || vResults.size() == 0);\n\n unsigned int nMin = GetArg(\"-ntpminmeasures\", MINIMUM_NTP_MEASURE);\n\n if (vResults.size() >= nMin)\n {\n LogPrintf(\"[NTP] Measured: %s\\n\", sReport);\n\n static CMedianFilter<int64_t> vNtpTimeOffsets(vResults.size(), 0);\n\n for(unsigned int i = 0; i < vResults.size(); i++)\n {\n vNtpTimeOffsets.input(vResults[i]);\n }\n\n SetNtpTimeOffset(vNtpTimeOffsets.median());\n\n LogPrintf(\"[NTP] Calculated offset from median: %d\\n\", GetNtpTimeOffset());\n return true;\n }\n else\n {\n return false;\n }\n}\n<commit_msg>Use native_handle instead of native on sockets<commit_after>\/\/ Copyright (c) 2018 alex v\n\/\/ Distributed under the MIT software license, see the accompanying\n\/\/ file COPYING or http:\/\/www.opensource.org\/licenses\/mit-license.php.\n\n#include \"init.h\"\n#include \"ntpclient.h\"\n#include \"random.h\"\n#include \"timedata.h\"\n#include \"util.h\"\n\n#include <sstream>\n#include <iomanip>\n\nusing namespace boost;\nusing namespace boost::asio;\n\nbool CNtpClient::getTimestamp(uint64_t &timeRecv)\n{\n\n io_service io_service;\n\n LogPrint(\"ntp\", \"[NTP] Opening socket to NTP server %s.\\n\", sHostName);\n try\n {\n\n ip::udp::resolver resolver(io_service);\n ip::udp::resolver::query query(boost::asio::ip::udp::v4(), sHostName, \"ntp\");\n\n ip::udp::endpoint receiver_endpoint = *resolver.resolve(query);\n\n ip::udp::socket socket(io_service);\n socket.open(ip::udp::v4());\n\n boost::array<unsigned char, 48> sendBuf = {{010,0,0,0,0,0,0,0,0}};\n\n socket.send_to(boost::asio::buffer(sendBuf), receiver_endpoint);\n\n boost::array<uint32_t, 1024> recvBuf;\n ip::udp::endpoint sender_endpoint;\n\n try\n {\n\n fd_set fileDescriptorSet;\n struct timeval timeStruct;\n\n timeStruct.tv_sec = GetArg(\"-ntptimeout\", DEFAULT_NTP_TIMEOUT);\n timeStruct.tv_usec = 0;\n FD_ZERO(&fileDescriptorSet);\n\n int nativeSocket = socket.native_handle();\n\n FD_SET(nativeSocket,&fileDescriptorSet);\n\n select(nativeSocket+1,&fileDescriptorSet,NULL,NULL,&timeStruct);\n\n if(!FD_ISSET(nativeSocket,&fileDescriptorSet))\n {\n\n LogPrint(\"ntp\", \"[NTP] Could not read socket from NTP server %s (Read timeout)\\n\", sHostName);\n\n }\n else\n {\n\n socket.receive_from(boost::asio::buffer(recvBuf), sender_endpoint);\n\n timeRecv = ntohl((uint32_t)recvBuf[8]);\n\n if(timeRecv > 2208988800U) \/\/ Sanity check\n {\n\n timeRecv-= 2208988800U; \/\/ Substract 01\/01\/1970 == 2208988800U\n LogPrint(\"ntp\", \"[NTP] Received timestamp: %ll\\n\", (uint64_t)timeRecv);\n\n return true;\n\n }\n else\n {\n\n LogPrintf(\"[NTP] Received wrong clock from NTP server %s (bad timestamp format)\\n\", sHostName);\n\n }\n\n }\n\n }\n catch (std::exception& e)\n {\n\n LogPrintf(\"[NTP] Could not read clock from NTP server %s (%s)\\n\", sHostName, e.what());\n\n }\n\n }\n catch (std::exception& e)\n {\n\n LogPrintf(\"[NTP] Could not open socket to NTP server %s (%s)\\n\", sHostName, e.what());\n\n }\n\n return false;\n}\n\nbool NtpClockSync()\n{\n LogPrintf(\"[NTP] Starting clock sync...\\n\");\n\n std::vector<std::string> vNtpServers;\n std::vector<int64_t> vResults;\n\n if (mapMultiArgs[\"-ntpserver\"].size() > 0)\n {\n vNtpServers = mapMultiArgs[\"-ntpserver\"];\n }\n else\n {\n vNtpServers = vDefaultNtpServers;\n }\n\n string sReport = \"\";\n string sPrevServer = \"\";\n int64_t nPrevMeasure = -1;\n\n random_shuffle(vNtpServers.begin(), vNtpServers.end(), GetRandInt);\n\n unsigned int nMeasureCount = 0;\n\n for(unsigned int i = 0; i < vNtpServers.size(); i++)\n {\n string s = vNtpServers[i];\n CNtpClient ntpClient(s);\n uint64_t nTimestamp = 0;\n\n if (ShutdownRequested())\n return false;\n\n if(ntpClient.getTimestamp(nTimestamp))\n {\n int64_t nClockDrift = GetTimeNow() - nTimestamp;\n nMeasureCount++;\n\n \/\/ We push if its the first entry\n if(nMeasureCount == 1)\n {\n vResults.push_back(nClockDrift);\n\n string sign = \"\";\n if(nClockDrift > 0)\n sign = \"+\";\n\n sReport += s + \"[\" + sign + to_string(nClockDrift) + \"sec.] \";\n }\n \/\/ or if n.measure is odd, including prev measure too\n else if (nMeasureCount % 2 == 1)\n {\n vResults.push_back(nClockDrift);\n\n string sign = \"\";\n if(nClockDrift > 0)\n sign = \"+\";\n\n sReport += s + \"[\" + sign + to_string(nClockDrift) + \"sec.] \";\n\n vResults.push_back(nPrevMeasure);\n\n sign = \"\";\n if(nPrevMeasure > 0)\n sign = \"+\";\n\n sReport += sPrevServer + \"[\" + sign + to_string(nPrevMeasure) + \"sec.] \";\n }\n else\n {\n nPrevMeasure = nClockDrift;\n sPrevServer = s;\n }\n\n if (vResults.size() >= 5)\n break;\n }\n }\n\n assert(vResults.size() % 2 == 1 || vResults.size() == 0);\n\n unsigned int nMin = GetArg(\"-ntpminmeasures\", MINIMUM_NTP_MEASURE);\n\n if (vResults.size() >= nMin)\n {\n LogPrintf(\"[NTP] Measured: %s\\n\", sReport);\n\n static CMedianFilter<int64_t> vNtpTimeOffsets(vResults.size(), 0);\n\n for(unsigned int i = 0; i < vResults.size(); i++)\n {\n vNtpTimeOffsets.input(vResults[i]);\n }\n\n SetNtpTimeOffset(vNtpTimeOffsets.median());\n\n LogPrintf(\"[NTP] Calculated offset from median: %d\\n\", GetNtpTimeOffset());\n return true;\n }\n else\n {\n return false;\n }\n}\n<|endoftext|>"} {"text":"<commit_before>\/*\n * jsreader.cpp\n * glia\n *\n * Created by Deniz Kural on 8\/1\/12.\n * Copyright 2012 __MyCompanyName__. All rights reserved.\n *\n *\/\n\n#include \"jsreader.h\"\n\nusing namespace std;\n\nint json_example(vector<sn*> &nlist) {\n\t\n\tmap<string, sn*> node_lookup;\n\t\/\/node_lookup[\"n1\"] = *sn;\n\t\n\t\n\t\/\/cout << \"Starting JSON Example\" << endl;\n\tJson::Value root; \/\/ will contains the root value after parsing.\n\tJson::Reader dagreader;\n\tJson::StyledWriter dagwriter;\n\n\tcout << \"Loading JSON file\" << endl;\n\tifstream input_json_file(\"\/Users\/kural\/indel.json\");\n\n\tbool parsingSuccessful = dagreader.parse( input_json_file, root );\n\t\n\n\tif ( !parsingSuccessful ) {\n\t\t\n\t\t\/\/ report to the user the failure and their locations in the document.\n\t\tcout << \"Failed to parse configuration\\n\"\n\t\t\t << dagreader.getFormattedErrorMessages();\n \n\t\treturn 0;\n\t}\n\t\n\t\/\/ example: retrieve string:string pair\n\t\/\/string encoding = dagroot.get(\"encoding\", \"UTF-8\" ).asString();\n\t\n\tconst Json::Value dag = root[\"dag\"];\n\t\n\t\t\t\n\tfor ( int index = 0; index < dag.size(); ++index ) {\n\t\t\n\t\tJson::Value node = dag[index];\n\t\t\n\t\tsn* cnode;\n\t\tcnode = new sn;\n\t\t\n\t\tcnode->name = node.get(\"id\",\"NA\").asString();\n\t\tcnode->sequence = node.get(\"sequence\",\"\").asString();\n\t\tcnode->seq_len = cnode->sequence.length();\n\t\tcnode->depth = node.get(\"depth\",-1).asInt();\n\t\t\n\t\t\/\/ add to the lookup table\n\t\tnode_lookup[cnode->name] = cnode;\n\t\tnlist.push_back(cnode); \n\t\t\n\t}\n\t\n\tfor ( int index = 0; index < dag.size(); ++index ) {\n\t\t\n\t\tJson::Value node = dag[index];\n\n\t\tJson::Value p3 = node[\"p3\"];\n\t\tfor (int j = 0; j < p3.size(); ++j ) {\n\t\t\t\/\/cout << p3.get(j,\"NA\").asString() << endl;\n\t\t\tnlist[index]->p3.push_back(node_lookup[p3.get(j,\"NA\").asString()]);\n\t\t}\n\t\n\t\tJson::Value p5 = node[\"p5\"];\n\t\tfor (int j = 0; j < p5.size(); ++j ) {\n\t\t\t\/\/cout << p5.get(j,\"NA\").asString() << endl;\n\t\t\tnlist[index]->p5.push_back(node_lookup[p5.get(j,\"NA\").asString()]);\n\t\t}\t\t\n\n\t}\n\t\n\tcout << dag;\n\treturn 0;\n}\n\t\n\t\t\n\t\n\t\n\t\t\n\t\t\/\/loadPlugIn( plugins[index].asString() );\n\t\n\t\/\/setIndentLength( root[\"indent\"].get(\"length\", 3).asInt() );\n\t\/\/setIndentUseSpace( root[\"indent\"].get(\"use_space\", true).asBool() );\n\t\n\t\/\/ ...\n\t\/\/ At application shutdown to make the new configuration document:\n\t\/\/ Since Json::Value has implicit constructor for all value types, it is not\n\t\/\/ necessary to explicitly construct the Json::Value object:\n\n\t\/\/root[\"encoding\"] = getCurrentEncoding();\n\t\/\/root[\"indent\"][\"length\"] = getCurrentIndentLength();\n\t\/\/root[\"indent\"][\"use_space\"] = getCurrentIndentUseSpace();\n\t\n\t\/\/ Make a new JSON document for the configuration. Preserve original comments.\n\t\/\/string outputConfig = dagwriter.write( root );\n\n\t\/\/ You can also use streams. This will put the contents of any JSON\n\t\/\/ stream at a particular sub-value, if you'd like.\n\t\/\/cin >> dagroot[\"subtree\"];\n\t\n\t\/\/ And you can write to a stream, using the StyledWriter automatically.\n\t\/\/cout << root;\n\t\n \/\/return 0;\n\n<commit_msg>delete json fwd<commit_after>\/*\n * jsreader.cpp\n * glia\n *\n * Created by Deniz Kural on 8\/1\/12.\n * Copyright 2012 __MyCompanyName__. All rights reserved.\n *\n *\/\n\n#include \"jsreader.h\"\n\nusing namespace std;\n\nint json_example(vector<sn*> &nlist) {\n\t\n\tmap<string, sn*> node_lookup;\n\t\/\/node_lookup[\"n1\"] = *sn;\n\t\n\t\n\t\/\/cout << \"Starting JSON Example\" << endl;\n\tJson::Value root; \/\/ will contains the root value after parsing.\n\tJson::Reader dagreader;\n\tJson::StyledWriter dagwriter;\n\n\tcout << \"Loading JSON file\" << endl;\n\tifstream input_json_file(\"\/Users\/kural\/indel.json\");\n\n\tbool parsingSuccessful = dagreader.parse( input_json_file, root );\n\t\n\n\tif ( !parsingSuccessful ) {\n\t\t\n\t\t\/\/ report to the user the failure and their locations in the document.\n\t\tcout << \"Failed to parse configuration\\n\"\n\t\t\t << dagreader.getFormattedErrorMessages();\n \n\t\treturn 0;\n\t}\n\t\n\t\/\/ example: retrieve string:string pair\n\t\/\/string encoding = dagroot.get(\"encoding\", \"UTF-8\" ).asString();\n\t\n\tconst Json::Value dag = root[\"dag\"];\n\t\n\t\t\t\n\tfor ( int index = 0; index < dag.size(); ++index ) {\n\t\t\n\t\tJson::Value node = dag[index];\n\t\t\n\t\tsn* cnode;\n\t\tcnode = new sn;\n\t\t\n\t\tcnode->name = node.get(\"id\",\"NA\").asString();\n\t\tcnode->sequence = node.get(\"sequence\",\"\").asString();\n\t\tcnode->seq_len = cnode->sequence.length();\n\t\tcnode->depth = node.get(\"depth\",-1).asInt();\n\t\t\n\t\t\/\/ add to the lookup table\n\t\tnode_lookup[cnode->name] = cnode;\n\t\tnlist.push_back(cnode); \n\t\t\n\t}\n\t\n\tfor ( int index = 0; index < dag.size(); ++index ) {\n\t\t\n\t\tJson::Value node = dag[index];\n\n\t\tJson::Value p3 = node[\"p3\"];\n\t\tfor (int j = 0; j < p3.size(); ++j ) {\n\t\t\t\/\/cout << p3.get(j,\"NA\").asString() << endl;\n\t\t\tnlist[index]->p3.push_back(node_lookup[p3.get(j,\"NA\").asString()]);\n\t\t}\n\t\n\t\tJson::Value p5 = node[\"p5\"];\n\t\tfor (int j = 0; j < p5.size(); ++j ) {\n\t\t\t\/\/cout << p5.get(j,\"NA\").asString() << endl;\n\t\t\tnlist[index]->p5.push_back(node_lookup[p5.get(j,\"NA\").asString()]);\n\t\t}\t\t\n\n\t}\n\t\n\tcout << dag;\n\treturn 0;\n}\n\t\n\t\t\n\t\n\t\n\t\t\n \/\/loadPlugIn( plugins[index].asString() );\n\t\n\t\/\/setIndentLength( root[\"indent\"].get(\"length\", 3).asInt() );\n\t\/\/setIndentUseSpace( root[\"indent\"].get(\"use_space\", true).asBool() );\n\t\n\t\/\/ ...\n\t\/\/ At application shutdown to make the new configuration document:\n\t\/\/ Since Json::Value has implicit constructor for all value types, it is not\n\t\/\/ necessary to explicitly construct the Json::Value object:\n\n\t\/\/root[\"encoding\"] = getCurrentEncoding();\n\t\/\/root[\"indent\"][\"length\"] = getCurrentIndentLength();\n\t\/\/root[\"indent\"][\"use_space\"] = getCurrentIndentUseSpace();\n\t\n\t\/\/ Make a new JSON document for the configuration. Preserve original comments.\n\t\/\/string outputConfig = dagwriter.write( root );\n\n\t\/\/ You can also use streams. This will put the contents of any JSON\n\t\/\/ stream at a particular sub-value, if you'd like.\n\t\/\/cin >> dagroot[\"subtree\"];\n\t\n\t\/\/ And you can write to a stream, using the StyledWriter automatically.\n\t\/\/cout << root;\n\t\n \/\/return 0;\n\n<|endoftext|>"} {"text":"<commit_before>#pragma once\r\n\/\/=====================================================================\/\/\r\n\/*!\t@file\r\n\t@brief\tルネサス RX ペリフェラル／デバイス選択\r\n @author 平松邦仁 (hira@rvf-rc45.net)\r\n\t@copyright\tCopyright (C) 2016, 2022 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 \"common\/byte_order.h\"\r\n#include \"common\/vect.h\"\r\n#include \"common\/delay.hpp\"\r\n#include \"common\/device.hpp\"\r\n\r\n#if defined(SIG_RX621) || defined(SIG_RX62N)\r\n#include \"RX62x\/lvd.hpp\"\r\n#include \"RX62x\/bus.hpp\"\r\n#include \"RX62x\/system.hpp\"\r\n#include \"RX62x\/system_io.hpp\"\r\n#include \"RX600\/dmac.hpp\"\r\n#include \"RX600\/exdmac.hpp\"\r\n#include \"RX62x\/port.hpp\"\r\n#include \"RX62x\/mtu2.hpp\"\r\n#include \"RX62x\/poe2.hpp\"\r\n#include \"RX600\/ppg.hpp\"\r\n\/\/ RTC\r\n#include \"RX62x\/wdt.hpp\"\r\n#include \"RX600\/etherc.hpp\"\r\n#include \"RX600\/edmac.hpp\"\r\n\/\/ USB\r\n#include \"RX600\/crc.hpp\"\r\n#include \"RX600\/can.hpp\"\r\n#include \"RX62x\/s12ad.hpp\"\r\n#include \"RX62x\/ad.hpp\"\r\n#include \"RX62x\/da.hpp\"\r\n#include \"RX62x\/flash.hpp\"\r\n\r\n#elif defined(SIG_RX24T)\r\n#include \"RX600\/lvda.hpp\"\r\n#include \"RX600\/bus.hpp\"\r\n\r\n#include \"RX24T\/system.hpp\"\r\n#include \"RX24T\/system_io.hpp\"\r\n#include \"RX600\/cac.hpp\"\r\n#include \"RX600\/port.hpp\"\r\n#include \"RX600\/mtu3.hpp\"\r\n#include \"RX600\/poe3.hpp\"\r\n#include \"RX600\/gpt.hpp\"\r\n#include \"RX24T\/s12ad.hpp\"\r\n#include \"RX24T\/adc_in.hpp\"\r\n#include \"RX24T\/da.hpp\"\r\n#include \"RX600\/cmpc.hpp\"\r\n#include \"RX24T\/flash.hpp\"\r\n#include \"RX24T\/flash_io.hpp\"\r\n#include \"RX24T\/dac_out.hpp\"\r\n#include \"RX600\/crc.hpp\"\r\n#include \"RX600\/doc.hpp\"\r\n\r\n#elif defined(SIG_RX64M) || defined(SIG_RX71M)\r\n#include \"RX600\/lvda.hpp\"\r\n#include \"RX600\/bus.hpp\"\r\n\r\n#include \"RX600\/system.hpp\"\r\n#include \"RX600\/system_io.hpp\"\r\n#include \"RX600\/cac.hpp\"\r\n#include \"RX600\/port.hpp\"\r\n#include \"RX600\/mtu3.hpp\"\r\n#include \"RX600\/poe3.hpp\"\r\n#include \"RX600\/dmac.hpp\"\r\n#include \"RX600\/elc.hpp\"\r\n#include \"RX600\/exdmac.hpp\"\r\n#include \"RX600\/mpc.hpp\"\r\n#include \"RX600\/tpu.hpp\"\r\n#include \"RX600\/gpt.hpp\"\r\n#include \"RX600\/ppg.hpp\"\r\n#include \"RX600\/cmtw.hpp\"\r\n#include \"RX600\/can.hpp\"\r\n#include \"RX600\/qspi.hpp\"\r\n#include \"RX600\/s12adc.hpp\"\r\n#include \"RX600\/adc_in.hpp\"\r\n#include \"RX600\/r12da.hpp\"\r\n#include \"RX600\/dac_out.hpp\"\r\n#include \"RX600\/sdram.hpp\"\r\n#include \"RX600\/etherc.hpp\"\r\n#include \"RX600\/eptpc.hpp\"\r\n#include \"RX600\/edmac.hpp\"\r\n#include \"RX600\/usb.hpp\"\r\n#include \"RX600\/usba.hpp\"\r\n#include \"RX600\/scif.hpp\"\r\n#include \"RX600\/rtc.hpp\"\r\n#include \"RX600\/rtc_io.hpp\"\r\n#include \"RX600\/wdta.hpp\"\r\n#include \"RX600\/flash.hpp\"\r\n#include \"RX600\/flash_io.hpp\"\r\n#include \"RX600\/ether_io.hpp\"\r\n#include \"RX600\/ssi.hpp\"\r\n#include \"RX600\/src.hpp\"\r\n#include \"RX600\/sdhi.hpp\"\r\n#include \"RX600\/sdhi_io.hpp\"\r\n#include \"RX600\/mmcif.hpp\"\r\n#include \"RX600\/pdc.hpp\"\r\n#include \"RX600\/standby_ram.hpp\"\r\n#include \"RX600\/ssi_io.hpp\"\r\n#include \"RX600\/dmac_mgr.hpp\"\r\n#include \"RX600\/crc.hpp\"\r\n#include \"RX600\/doc.hpp\"\r\n\r\n#elif defined(SIG_RX65N)\r\n#include \"RX600\/lvda.hpp\"\r\n#include \"RX600\/bus.hpp\"\r\n\r\n#include \"RX600\/system.hpp\"\r\n#include \"RX600\/system_io.hpp\"\r\n#include \"RX600\/cac.hpp\"\r\n#include \"RX600\/port.hpp\"\r\n#include \"RX600\/mtu3.hpp\"\r\n#include \"RX600\/poe3.hpp\"\r\n#include \"RX600\/dmac.hpp\"\r\n#include \"RX600\/elc.hpp\"\r\n#include \"RX600\/exdmac.hpp\"\r\n#include \"RX600\/mpc.hpp\"\r\n#include \"RX600\/tpu.hpp\"\r\n#include \"RX600\/ppg.hpp\"\r\n#include \"RX600\/cmtw.hpp\"\r\n#include \"RX600\/qspi.hpp\"\r\n#include \"RX600\/can.hpp\"\r\n#include \"RX600\/s12adf.hpp\"\r\n#include \"RX600\/adc_in.hpp\"\r\n#include \"RX600\/r12da.hpp\"\r\n#include \"RX600\/dac_out.hpp\"\r\n#include \"RX600\/sdram.hpp\"\r\n#include \"RX600\/etherc.hpp\"\r\n#include \"RX600\/edmac.hpp\"\r\n#include \"RX600\/usb.hpp\"\r\n#include \"RX600\/rtc.hpp\"\r\n#include \"RX600\/rtc_io.hpp\"\r\n#include \"RX600\/wdta.hpp\"\r\n#include \"RX600\/flash.hpp\"\r\n#include \"RX600\/flash_io.hpp\"\r\n#include \"RX600\/ether_io.hpp\"\r\n#include \"RX600\/sdhi.hpp\"\r\n#include \"RX600\/sdhi_io.hpp\"\r\n#include \"RX600\/sdsi.hpp\"\r\n#include \"RX600\/mmcif.hpp\"\r\n#include \"RX600\/pdc.hpp\"\r\n#include \"RX600\/standby_ram.hpp\"\r\n#include \"RX600\/glcdc.hpp\"\r\n#include \"RX600\/glcdc_mgr.hpp\"\r\n#include \"RX600\/drw2d.hpp\"\r\n#include \"RX600\/drw2d_mgr.hpp\"\r\n#include \"RX600\/dmac_mgr.hpp\"\r\n#include \"RX600\/crca.hpp\"\r\n#include \"RX600\/doc.hpp\"\r\n\r\n#elif defined(SIG_RX72M) || defined(SIG_RX72N)\r\n#include \"RX600\/lvda.hpp\"\r\n#include \"RX600\/bus.hpp\"\r\n\r\n#include \"RX600\/system.hpp\"\r\n#include \"RX600\/system_io.hpp\"\r\n#include \"RX600\/cac.hpp\"\r\n#include \"RX600\/port.hpp\"\r\n#include \"RX600\/mtu3.hpp\"\r\n#include \"RX600\/poe3.hpp\"\r\n#include \"RX600\/dmac.hpp\"\r\n#include \"RX600\/elc.hpp\"\r\n#include \"RX600\/exdmac.hpp\"\r\n#include \"RX600\/mpc.hpp\"\r\n#include \"RX600\/tpu.hpp\"\r\n#include \"RX600\/ppg.hpp\"\r\n#include \"RX600\/gptw.hpp\"\r\n#include \"RX600\/ppg.hpp\"\r\n#include \"RX600\/cmtw.hpp\"\r\n#include \"RX600\/can.hpp\"\r\n#include \"RX600\/qspi.hpp\"\r\n#include \"RX600\/s12adf.hpp\"\r\n#include \"RX600\/adc_in.hpp\"\r\n#include \"RX600\/r12da.hpp\"\r\n#include \"RX600\/dac_out.hpp\"\r\n#include \"RX600\/sdram.hpp\"\r\n#include \"RX600\/etherc.hpp\"\r\n#include \"RX600\/eptpc.hpp\"\r\n#include \"RX600\/edmac.hpp\"\r\n#include \"RX600\/pmgi.hpp\"\r\n#include \"RX600\/usb.hpp\"\r\n#include \"RX600\/scif.hpp\"\r\n#include \"RX600\/rtc.hpp\"\r\n#include \"RX600\/rtc_io.hpp\"\r\n#include \"RX600\/wdta.hpp\"\r\n#include \"RX600\/flash.hpp\"\r\n#include \"RX600\/flash_io.hpp\"\r\n#include \"RX600\/ether_io.hpp\"\r\n#include \"RX600\/ssie.hpp\"\r\n#include \"RX600\/ssie_io.hpp\"\r\n#include \"RX600\/sdhi.hpp\"\r\n#include \"RX600\/sdhi_io.hpp\"\r\n#include \"RX600\/mmcif.hpp\"\r\n#include \"RX600\/pdc.hpp\"\r\n#if defined(SIG_RX72M)\r\n#include \"RX600\/dsmif.hpp\"\r\n#endif\r\n#include \"RX600\/standby_ram.hpp\"\r\n\r\n#include \"RX600\/glcdc.hpp\"\r\n#include \"RX600\/glcdc_mgr.hpp\"\r\n#include \"RX600\/drw2d.hpp\"\r\n#include \"RX600\/drw2d_mgr.hpp\"\r\n\r\n#include \"RX600\/dmac_mgr.hpp\"\r\n#include \"RX600\/crca.hpp\"\r\n#include \"RX600\/doc.hpp\"\r\n\r\n#elif defined(SIG_RX66T) || defined(SIG_RX72T)\r\n#include \"RX600\/lvda.hpp\"\r\n#include \"RX600\/bus.hpp\"\r\n\r\n#include \"RX600\/system.hpp\"\r\n#include \"RX600\/system_io.hpp\"\r\n#include \"RX600\/cac.hpp\"\r\n#include \"RX600\/port.hpp\"\r\n#include \"RX600\/mtu3.hpp\"\r\n#include \"RX600\/poe3.hpp\"\r\n#include \"RX600\/dmac.hpp\"\r\n#include \"RX600\/elc.hpp\"\r\n#include \"RX600\/mpc.hpp\"\r\n#include \"RX600\/gptw.hpp\"\r\n#include \"RX600\/hrpwm.hpp\"\r\n#include \"RX600\/poeg.hpp\"\r\n#include \"RX600\/can.hpp\"\r\n#include \"RX72T\/s12adh.hpp\"\r\n#include \"RX600\/r12da.hpp\"\r\n#include \"RX600\/dac_out.hpp\"\r\n#include \"RX600\/usb.hpp\"\r\n#include \"RX600\/wdta.hpp\"\r\n#include \"RX600\/flash.hpp\"\r\n#include \"RX600\/flash_io.hpp\"\r\n#include \"RX600\/cmpc.hpp\"\r\n#include \"RX600\/dmac_mgr.hpp\"\r\n#include \"RX600\/crca.hpp\"\r\n#include \"RX600\/doc.hpp\"\r\n\r\n#else\r\n# error \"renesas.hpp: Requires SIG_RXxxx to be defined\"\r\n#endif\r\n\r\n\/\/ RX マイコン共通ペリフェラル\r\n#include \"RX600\/dtc.hpp\"\r\n#include \"RX600\/tmr.hpp\"\r\n#include \"RX600\/cmt.hpp\"\r\n#include \"RX600\/iwdt.hpp\"\r\n#include \"RX600\/sci.hpp\"\r\n#include \"RX600\/riic.hpp\"\r\n#include \"RX600\/rspi.hpp\"\r\n#include \"RX600\/mpu.hpp\"\r\n<commit_msg>Update: add include apth for RX62N<commit_after>#pragma once\r\n\/\/=====================================================================\/\/\r\n\/*!\t@file\r\n\t@brief\tルネサス RX ペリフェラル／デバイス選択\r\n @author 平松邦仁 (hira@rvf-rc45.net)\r\n\t@copyright\tCopyright (C) 2016, 2022 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 \"common\/byte_order.h\"\r\n#include \"common\/vect.h\"\r\n#include \"common\/delay.hpp\"\r\n#include \"common\/device.hpp\"\r\n\r\n#if defined(SIG_RX621) || defined(SIG_RX62N)\r\n#include \"RX62x\/lvd.hpp\"\r\n#include \"RX62x\/bus.hpp\"\r\n#include \"RX62x\/system.hpp\"\r\n#include \"RX62x\/system_io.hpp\"\r\n#include \"RX600\/dmac.hpp\"\r\n#include \"RX600\/exdmac.hpp\"\r\n#include \"RX62x\/port.hpp\"\r\n#include \"RX62x\/mtu2.hpp\"\r\n#include \"RX62x\/poe2.hpp\"\r\n#include \"RX600\/ppg.hpp\"\r\n\/\/ RTC\r\n#include \"RX62x\/wdt.hpp\"\r\n#include \"RX600\/etherc.hpp\"\r\n#include \"RX600\/edmac.hpp\"\r\n\/\/ USB\r\n#include \"RX600\/crc.hpp\"\r\n#include \"RX600\/can.hpp\"\r\n#include \"RX62x\/s12ad.hpp\"\r\n#include \"RX62x\/ad.hpp\"\r\n#include \"RX62x\/da.hpp\"\r\n#include \"RX62x\/flash.hpp\"\r\n#include \"RX62x\/flash_io.hpp\"\r\n\r\n#elif defined(SIG_RX24T)\r\n#include \"RX600\/lvda.hpp\"\r\n#include \"RX600\/bus.hpp\"\r\n\r\n#include \"RX24T\/system.hpp\"\r\n#include \"RX24T\/system_io.hpp\"\r\n#include \"RX600\/cac.hpp\"\r\n#include \"RX600\/port.hpp\"\r\n#include \"RX600\/mtu3.hpp\"\r\n#include \"RX600\/poe3.hpp\"\r\n#include \"RX600\/gpt.hpp\"\r\n#include \"RX24T\/s12ad.hpp\"\r\n#include \"RX24T\/adc_in.hpp\"\r\n#include \"RX24T\/da.hpp\"\r\n#include \"RX600\/cmpc.hpp\"\r\n#include \"RX24T\/flash.hpp\"\r\n#include \"RX24T\/flash_io.hpp\"\r\n#include \"RX24T\/dac_out.hpp\"\r\n#include \"RX600\/crc.hpp\"\r\n#include \"RX600\/doc.hpp\"\r\n\r\n#elif defined(SIG_RX64M) || defined(SIG_RX71M)\r\n#include \"RX600\/lvda.hpp\"\r\n#include \"RX600\/bus.hpp\"\r\n\r\n#include \"RX600\/system.hpp\"\r\n#include \"RX600\/system_io.hpp\"\r\n#include \"RX600\/cac.hpp\"\r\n#include \"RX600\/port.hpp\"\r\n#include \"RX600\/mtu3.hpp\"\r\n#include \"RX600\/poe3.hpp\"\r\n#include \"RX600\/dmac.hpp\"\r\n#include \"RX600\/elc.hpp\"\r\n#include \"RX600\/exdmac.hpp\"\r\n#include \"RX600\/mpc.hpp\"\r\n#include \"RX600\/tpu.hpp\"\r\n#include \"RX600\/gpt.hpp\"\r\n#include \"RX600\/ppg.hpp\"\r\n#include \"RX600\/cmtw.hpp\"\r\n#include \"RX600\/can.hpp\"\r\n#include \"RX600\/qspi.hpp\"\r\n#include \"RX600\/s12adc.hpp\"\r\n#include \"RX600\/adc_in.hpp\"\r\n#include \"RX600\/r12da.hpp\"\r\n#include \"RX600\/dac_out.hpp\"\r\n#include \"RX600\/sdram.hpp\"\r\n#include \"RX600\/etherc.hpp\"\r\n#include \"RX600\/eptpc.hpp\"\r\n#include \"RX600\/edmac.hpp\"\r\n#include \"RX600\/usb.hpp\"\r\n#include \"RX600\/usba.hpp\"\r\n#include \"RX600\/scif.hpp\"\r\n#include \"RX600\/rtc.hpp\"\r\n#include \"RX600\/rtc_io.hpp\"\r\n#include \"RX600\/wdta.hpp\"\r\n#include \"RX600\/flash.hpp\"\r\n#include \"RX600\/flash_io.hpp\"\r\n#include \"RX600\/ether_io.hpp\"\r\n#include \"RX600\/ssi.hpp\"\r\n#include \"RX600\/src.hpp\"\r\n#include \"RX600\/sdhi.hpp\"\r\n#include \"RX600\/sdhi_io.hpp\"\r\n#include \"RX600\/mmcif.hpp\"\r\n#include \"RX600\/pdc.hpp\"\r\n#include \"RX600\/standby_ram.hpp\"\r\n#include \"RX600\/ssi_io.hpp\"\r\n#include \"RX600\/dmac_mgr.hpp\"\r\n#include \"RX600\/crc.hpp\"\r\n#include \"RX600\/doc.hpp\"\r\n\r\n#elif defined(SIG_RX65N)\r\n#include \"RX600\/lvda.hpp\"\r\n#include \"RX600\/bus.hpp\"\r\n\r\n#include \"RX600\/system.hpp\"\r\n#include \"RX600\/system_io.hpp\"\r\n#include \"RX600\/cac.hpp\"\r\n#include \"RX600\/port.hpp\"\r\n#include \"RX600\/mtu3.hpp\"\r\n#include \"RX600\/poe3.hpp\"\r\n#include \"RX600\/dmac.hpp\"\r\n#include \"RX600\/elc.hpp\"\r\n#include \"RX600\/exdmac.hpp\"\r\n#include \"RX600\/mpc.hpp\"\r\n#include \"RX600\/tpu.hpp\"\r\n#include \"RX600\/ppg.hpp\"\r\n#include \"RX600\/cmtw.hpp\"\r\n#include \"RX600\/qspi.hpp\"\r\n#include \"RX600\/can.hpp\"\r\n#include \"RX600\/s12adf.hpp\"\r\n#include \"RX600\/adc_in.hpp\"\r\n#include \"RX600\/r12da.hpp\"\r\n#include \"RX600\/dac_out.hpp\"\r\n#include \"RX600\/sdram.hpp\"\r\n#include \"RX600\/etherc.hpp\"\r\n#include \"RX600\/edmac.hpp\"\r\n#include \"RX600\/usb.hpp\"\r\n#include \"RX600\/rtc.hpp\"\r\n#include \"RX600\/rtc_io.hpp\"\r\n#include \"RX600\/wdta.hpp\"\r\n#include \"RX600\/flash.hpp\"\r\n#include \"RX600\/flash_io.hpp\"\r\n#include \"RX600\/ether_io.hpp\"\r\n#include \"RX600\/sdhi.hpp\"\r\n#include \"RX600\/sdhi_io.hpp\"\r\n#include \"RX600\/sdsi.hpp\"\r\n#include \"RX600\/mmcif.hpp\"\r\n#include \"RX600\/pdc.hpp\"\r\n#include \"RX600\/standby_ram.hpp\"\r\n#include \"RX600\/glcdc.hpp\"\r\n#include \"RX600\/glcdc_mgr.hpp\"\r\n#include \"RX600\/drw2d.hpp\"\r\n#include \"RX600\/drw2d_mgr.hpp\"\r\n#include \"RX600\/dmac_mgr.hpp\"\r\n#include \"RX600\/crca.hpp\"\r\n#include \"RX600\/doc.hpp\"\r\n\r\n#elif defined(SIG_RX72M) || defined(SIG_RX72N)\r\n#include \"RX600\/lvda.hpp\"\r\n#include \"RX600\/bus.hpp\"\r\n\r\n#include \"RX600\/system.hpp\"\r\n#include \"RX600\/system_io.hpp\"\r\n#include \"RX600\/cac.hpp\"\r\n#include \"RX600\/port.hpp\"\r\n#include \"RX600\/mtu3.hpp\"\r\n#include \"RX600\/poe3.hpp\"\r\n#include \"RX600\/dmac.hpp\"\r\n#include \"RX600\/elc.hpp\"\r\n#include \"RX600\/exdmac.hpp\"\r\n#include \"RX600\/mpc.hpp\"\r\n#include \"RX600\/tpu.hpp\"\r\n#include \"RX600\/ppg.hpp\"\r\n#include \"RX600\/gptw.hpp\"\r\n#include \"RX600\/ppg.hpp\"\r\n#include \"RX600\/cmtw.hpp\"\r\n#include \"RX600\/can.hpp\"\r\n#include \"RX600\/qspi.hpp\"\r\n#include \"RX600\/s12adf.hpp\"\r\n#include \"RX600\/adc_in.hpp\"\r\n#include \"RX600\/r12da.hpp\"\r\n#include \"RX600\/dac_out.hpp\"\r\n#include \"RX600\/sdram.hpp\"\r\n#include \"RX600\/etherc.hpp\"\r\n#include \"RX600\/eptpc.hpp\"\r\n#include \"RX600\/edmac.hpp\"\r\n#include \"RX600\/pmgi.hpp\"\r\n#include \"RX600\/usb.hpp\"\r\n#include \"RX600\/scif.hpp\"\r\n#include \"RX600\/rtc.hpp\"\r\n#include \"RX600\/rtc_io.hpp\"\r\n#include \"RX600\/wdta.hpp\"\r\n#include \"RX600\/flash.hpp\"\r\n#include \"RX600\/flash_io.hpp\"\r\n#include \"RX600\/ether_io.hpp\"\r\n#include \"RX600\/ssie.hpp\"\r\n#include \"RX600\/ssie_io.hpp\"\r\n#include \"RX600\/sdhi.hpp\"\r\n#include \"RX600\/sdhi_io.hpp\"\r\n#include \"RX600\/mmcif.hpp\"\r\n#include \"RX600\/pdc.hpp\"\r\n#if defined(SIG_RX72M)\r\n#include \"RX600\/dsmif.hpp\"\r\n#endif\r\n#include \"RX600\/standby_ram.hpp\"\r\n\r\n#include \"RX600\/glcdc.hpp\"\r\n#include \"RX600\/glcdc_mgr.hpp\"\r\n#include \"RX600\/drw2d.hpp\"\r\n#include \"RX600\/drw2d_mgr.hpp\"\r\n\r\n#include \"RX600\/dmac_mgr.hpp\"\r\n#include \"RX600\/crca.hpp\"\r\n#include \"RX600\/doc.hpp\"\r\n\r\n#elif defined(SIG_RX66T) || defined(SIG_RX72T)\r\n#include \"RX600\/lvda.hpp\"\r\n#include \"RX600\/bus.hpp\"\r\n\r\n#include \"RX600\/system.hpp\"\r\n#include \"RX600\/system_io.hpp\"\r\n#include \"RX600\/cac.hpp\"\r\n#include \"RX600\/port.hpp\"\r\n#include \"RX600\/mtu3.hpp\"\r\n#include \"RX600\/poe3.hpp\"\r\n#include \"RX600\/dmac.hpp\"\r\n#include \"RX600\/elc.hpp\"\r\n#include \"RX600\/mpc.hpp\"\r\n#include \"RX600\/gptw.hpp\"\r\n#include \"RX600\/hrpwm.hpp\"\r\n#include \"RX600\/poeg.hpp\"\r\n#include \"RX600\/can.hpp\"\r\n#include \"RX72T\/s12adh.hpp\"\r\n#include \"RX600\/r12da.hpp\"\r\n#include \"RX600\/dac_out.hpp\"\r\n#include \"RX600\/usb.hpp\"\r\n#include \"RX600\/wdta.hpp\"\r\n#include \"RX600\/flash.hpp\"\r\n#include \"RX600\/flash_io.hpp\"\r\n#include \"RX600\/cmpc.hpp\"\r\n#include \"RX600\/dmac_mgr.hpp\"\r\n#include \"RX600\/crca.hpp\"\r\n#include \"RX600\/doc.hpp\"\r\n\r\n#else\r\n# error \"renesas.hpp: Requires SIG_RXxxx to be defined\"\r\n#endif\r\n\r\n\/\/ RX マイコン共通ペリフェラル\r\n#include \"RX600\/dtc.hpp\"\r\n#include \"RX600\/tmr.hpp\"\r\n#include \"RX600\/cmt.hpp\"\r\n#include \"RX600\/iwdt.hpp\"\r\n#include \"RX600\/sci.hpp\"\r\n#include \"RX600\/riic.hpp\"\r\n#include \"RX600\/rspi.hpp\"\r\n#include \"RX600\/mpu.hpp\"\r\n<|endoftext|>"} {"text":"<commit_before>\/***************************************************************************\n * common\/verbose.cpp\n *\n * Part of the STXXL. See http:\/\/stxxl.sourceforge.net\n *\n * Copyright (C) 2009 Andreas Beckmann <beckmann@cs.uni-frankfurt.de>\n *\n * Distributed under the Boost Software License, Version 1.0.\n * (See accompanying file LICENSE_1_0.txt or copy at\n * http:\/\/www.boost.org\/LICENSE_1_0.txt)\n **************************************************************************\/\n\n#include <iostream>\n#include <cstdio>\n#include <cmath>\n#include <stxxl\/bits\/verbose.h>\n#include <stxxl\/bits\/common\/log.h>\n#include <stxxl\/bits\/common\/timer.h>\n\n#ifdef STXXL_BOOST_CONFIG\n#include <boost\/config.hpp>\n#endif\n\n#ifdef BOOST_MSVC\n#define snprintf _snprintf\n#endif\n\n\n__STXXL_BEGIN_NAMESPACE\n\nstatic const double program_start_time_stamp = timestamp();\n\nvoid print_msg(const char * label, const std::string & msg, unsigned flags)\n{\n std::string s;\n if (flags & _STXXL_PRNT_TIMESTAMP) {\n double t = timestamp() - program_start_time_stamp;\n char tstr[23]; \/* \"[364:23:59:59.999999] \" *\/\n snprintf(tstr, sizeof(tstr), \"[%d.%02d:%02d:%02d.%06d] \",\n int(t \/ (24 * 60 * 60)),\n int(t \/ (60 * 60)) % 24,\n int(t \/ 60) % 60, int(t) % 60,\n int((t - floor(t)) * 10000));\n s += tstr;\n }\n if (label) {\n s += '[';\n s += label;\n s += \"] \";\n }\n s += msg;\n if (flags & _STXXL_PRNT_ADDNEWLINE)\n s += '\\n';\n if (flags & _STXXL_PRNT_COUT)\n std::cout << s << std::flush;\n if (flags & _STXXL_PRNT_CERR)\n std::cerr << s << std::flush;\n logger * logger_instance = logger::get_instance();\n if (flags & _STXXL_PRNT_LOG)\n logger_instance->log_stream() << s << std::flush;\n if (flags & _STXXL_PRNT_ERRLOG)\n logger_instance->errlog_stream() << s << std::flush;\n}\n\n__STXXL_END_NAMESPACE\n\n\/\/ vim: et:ts=4:sw=4\n<commit_msg>correctly scale fractional seconds<commit_after>\/***************************************************************************\n * common\/verbose.cpp\n *\n * Part of the STXXL. See http:\/\/stxxl.sourceforge.net\n *\n * Copyright (C) 2009 Andreas Beckmann <beckmann@cs.uni-frankfurt.de>\n *\n * Distributed under the Boost Software License, Version 1.0.\n * (See accompanying file LICENSE_1_0.txt or copy at\n * http:\/\/www.boost.org\/LICENSE_1_0.txt)\n **************************************************************************\/\n\n#include <iostream>\n#include <cstdio>\n#include <cmath>\n#include <stxxl\/bits\/verbose.h>\n#include <stxxl\/bits\/common\/log.h>\n#include <stxxl\/bits\/common\/timer.h>\n\n#ifdef STXXL_BOOST_CONFIG\n#include <boost\/config.hpp>\n#endif\n\n#ifdef BOOST_MSVC\n#define snprintf _snprintf\n#endif\n\n\n__STXXL_BEGIN_NAMESPACE\n\nstatic const double program_start_time_stamp = timestamp();\n\nvoid print_msg(const char * label, const std::string & msg, unsigned flags)\n{\n std::string s;\n if (flags & _STXXL_PRNT_TIMESTAMP) {\n double t = timestamp() - program_start_time_stamp;\n char tstr[23]; \/* \"[364:23:59:59.999999] \" *\/\n snprintf(tstr, sizeof(tstr), \"[%d.%02d:%02d:%02d.%06d] \",\n int(t \/ (24 * 60 * 60)),\n int(t \/ (60 * 60)) % 24,\n int(t \/ 60) % 60, int(t) % 60,\n int((t - floor(t)) * 1000000));\n s += tstr;\n }\n if (label) {\n s += '[';\n s += label;\n s += \"] \";\n }\n s += msg;\n if (flags & _STXXL_PRNT_ADDNEWLINE)\n s += '\\n';\n if (flags & _STXXL_PRNT_COUT)\n std::cout << s << std::flush;\n if (flags & _STXXL_PRNT_CERR)\n std::cerr << s << std::flush;\n logger * logger_instance = logger::get_instance();\n if (flags & _STXXL_PRNT_LOG)\n logger_instance->log_stream() << s << std::flush;\n if (flags & _STXXL_PRNT_ERRLOG)\n logger_instance->errlog_stream() << s << std::flush;\n}\n\n__STXXL_END_NAMESPACE\n\n\/\/ vim: et:ts=4:sw=4\n<|endoftext|>"} {"text":"<commit_before>#include \"k\/context.h\"\n\n#include \"etl\/array_count.h\"\n#include \"etl\/armv7m\/mpu.h\"\n#include \"etl\/armv7m\/types.h\"\n\n#include \"common\/abi_sizes.h\"\n#include \"common\/message.h\"\n#include \"common\/descriptor.h\"\n\n#include \"k\/memory.h\"\n#include \"k\/context_layout.h\"\n#include \"k\/object_table.h\"\n#include \"k\/registers.h\"\n#include \"k\/reply_gate.h\"\n#include \"k\/reply_sender.h\"\n#include \"k\/scheduler.h\"\n#include \"k\/unprivileged.h\"\n\nusing etl::armv7m::Word;\n\nnamespace k {\n\ntemplate struct ObjectSubclassChecks<Context, kabi::context_size>;\n\nstatic_assert(__builtin_offsetof(Context::Body, save) == 0,\n \"Context::Body::save offset is wrong (should be zero, isn't)\");\n\nstatic_assert(K_CONTEXT_BODY_STACK_OFFSET ==\n __builtin_offsetof(Context::Body, save.named.stack),\n \"K_CONTEXT_BODY_STACK_OFFSET is wrong\");\n\n\/*******************************************************************************\n * Context-specific stuff\n *\/\n\nContext::Context(Generation g, Body & body)\n : Object{g},\n _body(body) {\n body.ctx_item.owner = this;\n body.sender_item.owner = this;\n}\n\nvoid Context::nullify_exchanged_keys(unsigned preserved) {\n \/\/ Had to do this somewhere, this is as good a place as any.\n \/\/ (The fields in question are private, so this can't be at top level.)\n \/\/ (Putting it in the ctor hits the ill-defined non-trivial ctor rules.)\n static_assert(K_CONTEXT_BODY_OFFSET == __builtin_offsetof(Context, _body),\n \"K_CONTEXT_BODY_OFFSET is wrong\");\n\n \/\/ Right, actual implementation now:\n for (unsigned i = preserved; i < config::n_message_keys; ++i) {\n _body.keys[i] = Key::null();\n }\n}\n\nvoid Context::set_reply_gate(ReplyGate & g) {\n ETL_ASSERT(!g.is_bound());\n _body.reply_gate = &g;\n g.set_owner(this);\n}\n\nuint32_t Context::do_ipc(uint32_t stack, Descriptor d) {\n set_stack(stack);\n\n \/\/ Perform first phase of IPC.\n if (d.get_send_enabled()) {\n key(d.get_target()).deliver_from(this);\n } else if (d.get_receive_enabled()) {\n key(d.get_source()).get()->deliver_to(this);\n }\n \/\/ Note that if neither bit is set, we'll just return with the registers\n \/\/ unchanged.\n\n do_deferred_switch();\n\n return current->stack();\n}\n\nvoid Context::do_key_op(uint32_t sysnum, Descriptor d) {\n switch (sysnum) {\n case 1: \/\/ Copy Key\n key(d.get_target()) = key(d.get_source());\n return;\n\n case 2: \/\/ Discard Keys\n for (unsigned k = d.get_source(); k <= d.get_target(); ++k) {\n key(k) = Key::null();\n }\n return;\n\n default:\n \/\/ Bad sysnum used. This should probably become a fault?\n return;\n }\n}\n\nvoid Context::complete_receive(BlockingSender * sender) {\n _body.save.sys = sender->on_blocked_delivery_accepted(get_message_keys());\n}\n\nvoid Context::complete_receive(Exception e, uint32_t param) {\n _body.save.sys = { Message::failure(e, param), 0 };\n nullify_exchanged_keys();\n}\n\nvoid Context::block_in_receive(List<Context> & list) {\n \/\/ TODO should we decide to permit non-blocking recieves... here's the spot.\n _body.ctx_item.unlink();\n list.insert(&_body.ctx_item);\n _body.state = State::receiving;\n\n pend_switch();\n}\n\nvoid Context::block_in_reply() {\n _body.ctx_item.unlink();\n _body.state = State::receiving;\n\n pend_switch();\n}\n\nvoid Context::complete_blocked_receive(Brand brand, Sender * sender) {\n runnable.insert(&_body.ctx_item);\n _body.state = State::runnable;\n _body.save.sys.brand = brand;\n\n pend_switch();\n\n _body.save.sys.m = sender->on_delivery_accepted(get_message_keys());\n}\n\nvoid Context::complete_blocked_receive(Exception e, uint32_t param) {\n runnable.insert(&_body.ctx_item);\n _body.state = State::runnable;\n\n pend_switch();\n\n complete_receive(e, param);\n}\n\nvoid Context::apply_to_mpu() {\n using etl::armv7m::mpu;\n\n for (unsigned i = 0; i < config::n_task_regions; ++i) {\n mpu.write_rnr(i);\n auto object = _body.memory_regions[i].get();\n auto region =\n object->get_region_for_brand(_body.memory_regions[i].get_brand());\n mpu.write_rbar(region.rbar);\n mpu.write_rasr(region.rasr);\n }\n}\n\nvoid Context::make_runnable() {\n switch (_body.state) {\n case State::sending:\n _body.sender_item.unlink();\n on_blocked_delivery_aborted();\n break;\n\n case State::receiving:\n _body.ctx_item.unlink();\n complete_blocked_receive(Exception::would_block);\n break;\n\n case State::stopped:\n runnable.insert(&_body.ctx_item);\n _body.state = State::runnable;\n break;\n\n case State::runnable:\n break;\n }\n}\n\n\n\/*******************************************************************************\n * Implementation of Sender and BlockingSender\n *\/\n\nPriority Context::get_priority() const {\n return _body.priority;\n}\n\nMessage Context::on_delivery_accepted(Keys & k) {\n auto d = get_descriptor();\n\n auto m = _body.save.sys.m.sanitized();\n\n k.keys[0] = d.is_call() ? make_reply_key() : Key::null();\n for (unsigned ki = 1; ki < config::n_message_keys; ++ki) {\n k.keys[ki] = key(ki);\n }\n\n if (d.get_receive_enabled()) {\n auto & source = d.is_call() ? k.keys[0]\n : key(d.get_source());\n source.get()->deliver_to(this);\n }\n\n return m;\n}\n\nvoid Context::block_in_send(Brand brand, List<BlockingSender> & list) {\n ETL_ASSERT(this == current);\n\n if (get_descriptor().get_block()) {\n _body.saved_brand = brand;\n list.insert(&_body.sender_item);\n _body.ctx_item.unlink();\n _body.state = State::sending;\n\n pend_switch();\n } else {\n \/\/ Unprivileged code is unwilling to block for delivery.\n _body.save.sys = { Message::failure(Exception::would_block), 0 };\n }\n}\n\nReceivedMessage Context::on_blocked_delivery_accepted(Keys & k) {\n runnable.insert(&_body.ctx_item);\n _body.state = State::runnable;\n\n pend_switch();\n return {\n .m = on_delivery_accepted(k),\n .brand = _body.saved_brand,\n };\n}\n\nvoid Context::on_blocked_delivery_aborted() {\n runnable.insert(&_body.ctx_item);\n _body.state = State::runnable;\n pend_switch();\n\n _body.save.sys = { Message::failure(Exception::would_block), 0 };\n}\n\nKey Context::make_reply_key() const {\n if (_body.reply_gate) {\n auto maybe_key = _body.reply_gate.ref()->make_key(0);\n if (maybe_key) return maybe_key.ref();\n }\n return Key::null();\n}\n\n\n\/*******************************************************************************\n * Implementation of Context protocol.\n *\/\n\nusing IpcImpl = void (Context::*)(ScopedReplySender &,\n Brand,\n Message const &,\n Keys &);\n\nvoid Context::deliver_from(Brand brand, Sender * sender) {\n Keys k;\n Message m = sender->on_delivery_accepted(k);\n\n static constexpr IpcImpl dispatch[] {\n &Context::do_read_register,\n &Context::do_write_register,\n &Context::do_read_key,\n &Context::do_write_key,\n &Context::do_read_region,\n &Context::do_write_region,\n &Context::do_make_runnable,\n &Context::do_read_priority,\n &Context::do_write_priority,\n &Context::do_save_kernel_registers,\n &Context::do_restore_kernel_registers,\n };\n if (m.d0.get_selector() < etl::array_count(dispatch)) {\n ScopedReplySender reply_sender{k.keys[0]};\n auto fn = dispatch[m.d0.get_selector()];\n (this->*fn)(reply_sender, brand, m, k);\n } else {\n do_badop(m, k);\n }\n}\n\nvoid Context::do_read_register(ScopedReplySender & reply_sender,\n Brand,\n Message const & arg,\n Keys &) {\n if (arg.d1 < etl::array_count(_body.save.raw)) {\n reply_sender.get_message().d1 = _body.save.raw[arg.d1];\n } else {\n reply_sender.get_message() = Message::failure(Exception::bad_argument);\n }\n}\n\nvoid Context::do_write_register(ScopedReplySender & reply_sender,\n Brand,\n Message const & arg,\n Keys &) {\n if (arg.d1 < etl::array_count(_body.save.raw)) {\n _body.save.raw[arg.d1] = arg.d2;\n } else {\n reply_sender.get_message() = Message::failure(Exception::bad_argument);\n }\n}\n\nvoid Context::do_read_key(ScopedReplySender & reply_sender,\n Brand,\n Message const & arg,\n Keys &) {\n auto r = arg.d1;\n\n if (r >= config::n_task_keys) {\n reply_sender.get_message() = Message::failure(Exception::bad_argument);\n } else {\n reply_sender.set_key(1, key(r));\n }\n}\n\nvoid Context::do_write_key(ScopedReplySender & reply_sender,\n Brand,\n Message const & arg,\n Keys & k) {\n auto r = arg.d1;\n\n if (r >= config::n_task_keys) {\n reply_sender.get_message() = Message::failure(Exception::bad_argument);\n } else {\n key(r) = k.keys[1];\n }\n}\n\nvoid Context::do_read_region(ScopedReplySender & reply_sender,\n Brand,\n Message const & arg,\n Keys &) {\n auto n = arg.d1;\n\n if (n < config::n_task_regions) {\n reply_sender.set_key(1, _body.memory_regions[n]);\n } else {\n reply_sender.get_message() = Message::failure(Exception::bad_argument);\n }\n}\n\nvoid Context::do_write_region(ScopedReplySender & reply_sender,\n Brand,\n Message const & arg,\n Keys & k) {\n auto n = arg.d1;\n\n if (n < config::n_task_regions) {\n _body.memory_regions[n] = k.keys[1];\n } else {\n reply_sender.get_message() = Message::failure(Exception::bad_argument);\n }\n\n if (current == this) apply_to_mpu();\n}\n\nvoid Context::do_make_runnable(ScopedReplySender &,\n Brand,\n Message const &,\n Keys &) {\n make_runnable();\n pend_switch();\n}\n\nvoid Context::do_read_priority(ScopedReplySender & reply_sender,\n Brand,\n Message const &,\n Keys &) {\n reply_sender.get_message().d1 = _body.priority;\n}\n\nvoid Context::do_write_priority(ScopedReplySender & reply_sender,\n Brand,\n Message const & arg,\n Keys &) {\n auto priority = arg.d1;\n\n if (priority < config::n_priorities) {\n _body.priority = priority;\n \n if (_body.ctx_item.is_linked()) _body.ctx_item.reinsert();\n if (_body.sender_item.is_linked()) _body.sender_item.reinsert();\n } else {\n reply_sender.get_message() = Message::failure(Exception::bad_argument);\n }\n}\n\nvoid Context::do_save_kernel_registers(ScopedReplySender & reply_sender,\n Brand,\n Message const & arg,\n Keys &) {\n uint32_t * dest = reinterpret_cast<uint32_t *>(arg.d1);\n\n for (unsigned i = 0; i < etl::array_count(_body.save.raw); ++i) {\n if (!ustore(&dest[i], _body.save.raw[i])) {\n reply_sender.get_message() = Message::failure(Exception::fault);\n return;\n }\n }\n}\n\nvoid Context::do_restore_kernel_registers(ScopedReplySender & reply_sender,\n Brand,\n Message const & arg,\n Keys &) {\n uint32_t const * src = reinterpret_cast<uint32_t const *>(arg.d1);\n\n for (unsigned i = 0; i < etl::array_count(_body.save.raw); ++i) {\n if (auto mval = uload(&src[i])) {\n _body.save.raw[i] = mval.ref();\n } else {\n reply_sender.get_message() = Message::failure(Exception::fault);\n return;\n }\n }\n}\n\n} \/\/ namespace k\n<commit_msg>Context: improve comments in on_delivery_accepted.<commit_after>#include \"k\/context.h\"\n\n#include \"etl\/array_count.h\"\n#include \"etl\/armv7m\/mpu.h\"\n#include \"etl\/armv7m\/types.h\"\n\n#include \"common\/abi_sizes.h\"\n#include \"common\/message.h\"\n#include \"common\/descriptor.h\"\n\n#include \"k\/memory.h\"\n#include \"k\/context_layout.h\"\n#include \"k\/object_table.h\"\n#include \"k\/registers.h\"\n#include \"k\/reply_gate.h\"\n#include \"k\/reply_sender.h\"\n#include \"k\/scheduler.h\"\n#include \"k\/unprivileged.h\"\n\nusing etl::armv7m::Word;\n\nnamespace k {\n\ntemplate struct ObjectSubclassChecks<Context, kabi::context_size>;\n\nstatic_assert(__builtin_offsetof(Context::Body, save) == 0,\n \"Context::Body::save offset is wrong (should be zero, isn't)\");\n\nstatic_assert(K_CONTEXT_BODY_STACK_OFFSET ==\n __builtin_offsetof(Context::Body, save.named.stack),\n \"K_CONTEXT_BODY_STACK_OFFSET is wrong\");\n\n\/*******************************************************************************\n * Context-specific stuff\n *\/\n\nContext::Context(Generation g, Body & body)\n : Object{g},\n _body(body) {\n body.ctx_item.owner = this;\n body.sender_item.owner = this;\n}\n\nvoid Context::nullify_exchanged_keys(unsigned preserved) {\n \/\/ Had to do this somewhere, this is as good a place as any.\n \/\/ (The fields in question are private, so this can't be at top level.)\n \/\/ (Putting it in the ctor hits the ill-defined non-trivial ctor rules.)\n static_assert(K_CONTEXT_BODY_OFFSET == __builtin_offsetof(Context, _body),\n \"K_CONTEXT_BODY_OFFSET is wrong\");\n\n \/\/ Right, actual implementation now:\n for (unsigned i = preserved; i < config::n_message_keys; ++i) {\n _body.keys[i] = Key::null();\n }\n}\n\nvoid Context::set_reply_gate(ReplyGate & g) {\n ETL_ASSERT(!g.is_bound());\n _body.reply_gate = &g;\n g.set_owner(this);\n}\n\nuint32_t Context::do_ipc(uint32_t stack, Descriptor d) {\n set_stack(stack);\n\n \/\/ Perform first phase of IPC.\n if (d.get_send_enabled()) {\n key(d.get_target()).deliver_from(this);\n } else if (d.get_receive_enabled()) {\n key(d.get_source()).get()->deliver_to(this);\n }\n \/\/ Note that if neither bit is set, we'll just return with the registers\n \/\/ unchanged.\n\n do_deferred_switch();\n\n return current->stack();\n}\n\nvoid Context::do_key_op(uint32_t sysnum, Descriptor d) {\n switch (sysnum) {\n case 1: \/\/ Copy Key\n key(d.get_target()) = key(d.get_source());\n return;\n\n case 2: \/\/ Discard Keys\n for (unsigned k = d.get_source(); k <= d.get_target(); ++k) {\n key(k) = Key::null();\n }\n return;\n\n default:\n \/\/ Bad sysnum used. This should probably become a fault?\n return;\n }\n}\n\nvoid Context::complete_receive(BlockingSender * sender) {\n _body.save.sys = sender->on_blocked_delivery_accepted(get_message_keys());\n}\n\nvoid Context::complete_receive(Exception e, uint32_t param) {\n _body.save.sys = { Message::failure(e, param), 0 };\n nullify_exchanged_keys();\n}\n\nvoid Context::block_in_receive(List<Context> & list) {\n \/\/ TODO should we decide to permit non-blocking recieves... here's the spot.\n _body.ctx_item.unlink();\n list.insert(&_body.ctx_item);\n _body.state = State::receiving;\n\n pend_switch();\n}\n\nvoid Context::block_in_reply() {\n _body.ctx_item.unlink();\n _body.state = State::receiving;\n\n pend_switch();\n}\n\nvoid Context::complete_blocked_receive(Brand brand, Sender * sender) {\n runnable.insert(&_body.ctx_item);\n _body.state = State::runnable;\n _body.save.sys.brand = brand;\n\n pend_switch();\n\n _body.save.sys.m = sender->on_delivery_accepted(get_message_keys());\n}\n\nvoid Context::complete_blocked_receive(Exception e, uint32_t param) {\n runnable.insert(&_body.ctx_item);\n _body.state = State::runnable;\n\n pend_switch();\n\n complete_receive(e, param);\n}\n\nvoid Context::apply_to_mpu() {\n using etl::armv7m::mpu;\n\n for (unsigned i = 0; i < config::n_task_regions; ++i) {\n mpu.write_rnr(i);\n auto object = _body.memory_regions[i].get();\n auto region =\n object->get_region_for_brand(_body.memory_regions[i].get_brand());\n mpu.write_rbar(region.rbar);\n mpu.write_rasr(region.rasr);\n }\n}\n\nvoid Context::make_runnable() {\n switch (_body.state) {\n case State::sending:\n _body.sender_item.unlink();\n on_blocked_delivery_aborted();\n break;\n\n case State::receiving:\n _body.ctx_item.unlink();\n complete_blocked_receive(Exception::would_block);\n break;\n\n case State::stopped:\n runnable.insert(&_body.ctx_item);\n _body.state = State::runnable;\n break;\n\n case State::runnable:\n break;\n }\n}\n\n\n\/*******************************************************************************\n * Implementation of Sender and BlockingSender\n *\/\n\nPriority Context::get_priority() const {\n return _body.priority;\n}\n\nMessage Context::on_delivery_accepted(Keys & k) {\n \/\/ We're either synchronously delivering our message, or have been found on a\n \/\/ block list and asked to deliver.\n\n \/\/ We assume that the descriptor is unchanged from when we sent. If it is\n \/\/ not, it only affects us, since the recipient has been chosen.\n auto d = get_descriptor();\n\n \/\/ Make a copy of the message we're trying to send, sanitized. We need to do\n \/\/ this because we may be about to receive into the same memory, below.\n auto m = _body.save.sys.m.sanitized();\n\n k.keys[0] = d.is_call() ? make_reply_key() : Key::null();\n for (unsigned ki = 1; ki < config::n_message_keys; ++ki) {\n k.keys[ki] = key(ki);\n }\n\n \/\/ Atomically transition to receive state if requested by the program.\n if (d.get_receive_enabled()) {\n \/\/ If we're calling, reuse the reply key we just minted:\n auto & source = d.is_call() ? k.keys[0]\n : key(d.get_source());\n \/\/ And this is where our outgoing message would be overwritten; thus the\n \/\/ copy above.\n source.get()->deliver_to(this);\n }\n\n return m;\n}\n\nvoid Context::block_in_send(Brand brand, List<BlockingSender> & list) {\n ETL_ASSERT(this == current);\n\n if (get_descriptor().get_block()) {\n _body.saved_brand = brand;\n list.insert(&_body.sender_item);\n _body.ctx_item.unlink();\n _body.state = State::sending;\n\n pend_switch();\n } else {\n \/\/ Unprivileged code is unwilling to block for delivery.\n _body.save.sys = { Message::failure(Exception::would_block), 0 };\n }\n}\n\nReceivedMessage Context::on_blocked_delivery_accepted(Keys & k) {\n runnable.insert(&_body.ctx_item);\n _body.state = State::runnable;\n\n pend_switch();\n return {\n .m = on_delivery_accepted(k),\n .brand = _body.saved_brand,\n };\n}\n\nvoid Context::on_blocked_delivery_aborted() {\n runnable.insert(&_body.ctx_item);\n _body.state = State::runnable;\n pend_switch();\n\n _body.save.sys = { Message::failure(Exception::would_block), 0 };\n}\n\nKey Context::make_reply_key() const {\n if (_body.reply_gate) {\n auto maybe_key = _body.reply_gate.ref()->make_key(0);\n if (maybe_key) return maybe_key.ref();\n }\n return Key::null();\n}\n\n\n\/*******************************************************************************\n * Implementation of Context protocol.\n *\/\n\nusing IpcImpl = void (Context::*)(ScopedReplySender &,\n Brand,\n Message const &,\n Keys &);\n\nvoid Context::deliver_from(Brand brand, Sender * sender) {\n Keys k;\n Message m = sender->on_delivery_accepted(k);\n\n static constexpr IpcImpl dispatch[] {\n &Context::do_read_register,\n &Context::do_write_register,\n &Context::do_read_key,\n &Context::do_write_key,\n &Context::do_read_region,\n &Context::do_write_region,\n &Context::do_make_runnable,\n &Context::do_read_priority,\n &Context::do_write_priority,\n &Context::do_save_kernel_registers,\n &Context::do_restore_kernel_registers,\n };\n if (m.d0.get_selector() < etl::array_count(dispatch)) {\n ScopedReplySender reply_sender{k.keys[0]};\n auto fn = dispatch[m.d0.get_selector()];\n (this->*fn)(reply_sender, brand, m, k);\n } else {\n do_badop(m, k);\n }\n}\n\nvoid Context::do_read_register(ScopedReplySender & reply_sender,\n Brand,\n Message const & arg,\n Keys &) {\n if (arg.d1 < etl::array_count(_body.save.raw)) {\n reply_sender.get_message().d1 = _body.save.raw[arg.d1];\n } else {\n reply_sender.get_message() = Message::failure(Exception::bad_argument);\n }\n}\n\nvoid Context::do_write_register(ScopedReplySender & reply_sender,\n Brand,\n Message const & arg,\n Keys &) {\n if (arg.d1 < etl::array_count(_body.save.raw)) {\n _body.save.raw[arg.d1] = arg.d2;\n } else {\n reply_sender.get_message() = Message::failure(Exception::bad_argument);\n }\n}\n\nvoid Context::do_read_key(ScopedReplySender & reply_sender,\n Brand,\n Message const & arg,\n Keys &) {\n auto r = arg.d1;\n\n if (r >= config::n_task_keys) {\n reply_sender.get_message() = Message::failure(Exception::bad_argument);\n } else {\n reply_sender.set_key(1, key(r));\n }\n}\n\nvoid Context::do_write_key(ScopedReplySender & reply_sender,\n Brand,\n Message const & arg,\n Keys & k) {\n auto r = arg.d1;\n\n if (r >= config::n_task_keys) {\n reply_sender.get_message() = Message::failure(Exception::bad_argument);\n } else {\n key(r) = k.keys[1];\n }\n}\n\nvoid Context::do_read_region(ScopedReplySender & reply_sender,\n Brand,\n Message const & arg,\n Keys &) {\n auto n = arg.d1;\n\n if (n < config::n_task_regions) {\n reply_sender.set_key(1, _body.memory_regions[n]);\n } else {\n reply_sender.get_message() = Message::failure(Exception::bad_argument);\n }\n}\n\nvoid Context::do_write_region(ScopedReplySender & reply_sender,\n Brand,\n Message const & arg,\n Keys & k) {\n auto n = arg.d1;\n\n if (n < config::n_task_regions) {\n _body.memory_regions[n] = k.keys[1];\n } else {\n reply_sender.get_message() = Message::failure(Exception::bad_argument);\n }\n\n if (current == this) apply_to_mpu();\n}\n\nvoid Context::do_make_runnable(ScopedReplySender &,\n Brand,\n Message const &,\n Keys &) {\n make_runnable();\n pend_switch();\n}\n\nvoid Context::do_read_priority(ScopedReplySender & reply_sender,\n Brand,\n Message const &,\n Keys &) {\n reply_sender.get_message().d1 = _body.priority;\n}\n\nvoid Context::do_write_priority(ScopedReplySender & reply_sender,\n Brand,\n Message const & arg,\n Keys &) {\n auto priority = arg.d1;\n\n if (priority < config::n_priorities) {\n _body.priority = priority;\n \n if (_body.ctx_item.is_linked()) _body.ctx_item.reinsert();\n if (_body.sender_item.is_linked()) _body.sender_item.reinsert();\n } else {\n reply_sender.get_message() = Message::failure(Exception::bad_argument);\n }\n}\n\nvoid Context::do_save_kernel_registers(ScopedReplySender & reply_sender,\n Brand,\n Message const & arg,\n Keys &) {\n uint32_t * dest = reinterpret_cast<uint32_t *>(arg.d1);\n\n for (unsigned i = 0; i < etl::array_count(_body.save.raw); ++i) {\n if (!ustore(&dest[i], _body.save.raw[i])) {\n reply_sender.get_message() = Message::failure(Exception::fault);\n return;\n }\n }\n}\n\nvoid Context::do_restore_kernel_registers(ScopedReplySender & reply_sender,\n Brand,\n Message const & arg,\n Keys &) {\n uint32_t const * src = reinterpret_cast<uint32_t const *>(arg.d1);\n\n for (unsigned i = 0; i < etl::array_count(_body.save.raw); ++i) {\n if (auto mval = uload(&src[i])) {\n _body.save.raw[i] = mval.ref();\n } else {\n reply_sender.get_message() = Message::failure(Exception::fault);\n return;\n }\n }\n}\n\n} \/\/ namespace k\n<|endoftext|>"} {"text":"<commit_before><commit_msg>correct reading datum error<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 <sofa\/gui\/PickHandler.h>\n\n#include <sofa\/component\/collision\/ComponentMouseInteraction.h>\n#include <sofa\/component\/collision\/RayContact.h>\n\n#include <sofa\/simulation\/common\/InitVisitor.h>\n#include <sofa\/simulation\/common\/DeleteVisitor.h>\n#include <sofa\/simulation\/common\/MechanicalVisitor.h>\n\n#include <sofa\/helper\/Factory.inl>\n\n#include <iostream>\n\n\n\n\n\nnamespace sofa\n{\nusing namespace component::collision;\nhelper::Creator<ComponentMouseInteraction::ComponentMouseInteractionFactory,TComponentMouseInteraction<defaulttype::Vec3dTypes> > ComponentMouseInteractionVec3dClass (\"MouseSpringVec3d\",true);\nhelper::Creator<ComponentMouseInteraction::ComponentMouseInteractionFactory, TComponentMouseInteraction<defaulttype::Vec3fTypes> > ComponentMouseInteractionVec3fClass (\"MouseSpringVec3f\",true);\n\nnamespace gui\n{\n\nPickHandler::PickHandler():interactorInUse(false), mouseStatus(DEACTIVATED),mouseButton(NONE)\n{\n operations[NONE] =\n operations[LEFT] =\n operations[MIDDLE] =\n operations[RIGHT] = NULL;\n\n mouseNode = simulation::getSimulation()->newNode(\"Mouse\");\n\n mouseContainer = new MouseContainer; mouseContainer->resize(1);\n mouseContainer->setName(\"MousePosition\");\n mouseNode->addObject(mouseContainer);\n\n\n mouseCollision = new MouseCollisionModel;\n mouseCollision->setNbRay(1);\n mouseCollision->getRay(0).l() = 1000000;\n mouseCollision->setName(\"MouseCollisionModel\");\n mouseNode->addObject(mouseCollision);\n\n\n mouseNode->init();\n mouseContainer->init();\n mouseCollision->init();\n\n\n\n\n typedef component::collision::ComponentMouseInteraction::ComponentMouseInteractionFactory MouseFactory;\n const MouseFactory *factory = MouseFactory::getInstance();\n for (MouseFactory::const_iterator it = factory->begin(); it != factory->end(); ++it)\n {\n instanceComponents.push_back(it->second->createInstance(NULL));\n instanceComponents.back()->init(mouseNode);\n }\n interaction = instanceComponents.back();\n}\n\nPickHandler::~PickHandler()\n{\n\/\/ for (unsigned int i=0;i<instanceComponents.size();++i) delete instanceComponents[i];\n}\n\nvoid PickHandler::init()\n{\n core::componentmodel::collision::Pipeline *pipeline;\n simulation::getSimulation()->getContext()->get(pipeline, core::objectmodel::BaseContext::SearchRoot);\n\n useCollisions = (pipeline != NULL);\n}\n\nvoid PickHandler::reset()\n{\n activateRay(false);\n mouseButton = NONE;\n for (unsigned int i=0; i<instanceComponents.size(); ++i) instanceComponents[i]->reset();\n}\n\nvoid PickHandler::activateRay(bool act)\n{\n if (interactorInUse && !act)\n {\n mouseNode->detachFromGraph();\n\n\n operations[LEFT]->end();\n operations[MIDDLE]->end();\n operations[RIGHT]->end();\n\n interaction->deactivate();\n\n interactorInUse=false;\n }\n else if (!interactorInUse && act)\n {\n Node *root = static_cast<Node*>(simulation::getSimulation()->getContext());\n root->addChild(mouseNode);\n interaction->activate();\n interactorInUse=true;\n }\n}\n\n\n\n\nbool PickHandler::needToCastRay()\n{\n return !getInteraction()->mouseInteractor->isMouseAttached();\n}\n\n\nvoid PickHandler::setCompatibleInteractor()\n{\n if (useCollisions)\n {\n if (!lastPicked.body ) return;\n\n if (interaction->isCompatible(lastPicked.body->getContext())) return;\n for (unsigned int i=0; i<instanceComponents.size(); ++i)\n {\n if (instanceComponents[i] != interaction &&\n instanceComponents[i]->isCompatible(lastPicked.body->getContext()))\n {\n interaction->deactivate();\n interaction = instanceComponents[i];\n interaction->activate();\n }\n }\n }\n else\n {\n if (!lastPicked.mstate) return;\n\n if (interaction->isCompatible(lastPicked.mstate->getContext())) return;\n for (unsigned int i=0; i<instanceComponents.size(); ++i)\n {\n if (instanceComponents[i] != interaction &&\n instanceComponents[i]->isCompatible(lastPicked.mstate->getContext()))\n {\n interaction->deactivate();\n interaction = instanceComponents[i];\n interaction->activate();\n }\n }\n }\n\n}\n\n\nvoid PickHandler::updateRay(const sofa::defaulttype::Vector3 &position,const sofa::defaulttype::Vector3 &orientation)\n{\n if (!interactorInUse) return;\n mouseCollision->getRay(0).origin() = position+orientation*interaction->mouseInteractor->getDistanceFromMouse();\n mouseCollision->getRay(0).direction() = orientation;\n\n if (needToCastRay())\n {\n lastPicked=findCollision();\n setCompatibleInteractor();\n interaction->mouseInteractor->setMouseRayModel(mouseCollision);\n interaction->mouseInteractor->setBodyPicked(lastPicked);\n }\n\n\n if(mouseButton != NONE)\n {\n switch (mouseStatus)\n {\n case PRESSED:\n {\n operations[mouseButton]->start();\n mouseStatus=ACTIVATED;\n break;\n }\n case RELEASED:\n {\n operations[mouseButton]->end();\n mouseStatus=DEACTIVATED;\n break;\n }\n case ACTIVATED:\n {\n operations[mouseButton]->execution();\n }\n case DEACTIVATED:\n {\n operations[mouseButton]->wait();\n }\n }\n }\n}\n\n\/\/Clear the node create, and destroy all its components\nvoid PickHandler::handleMouseEvent(MOUSE_STATUS status, MOUSE_BUTTON button)\n{\n if (!interaction) return;\n\n mouseButton=button;\n mouseStatus=status;\n}\n\n\nComponentMouseInteraction *PickHandler::getInteraction()\n{\n return interaction;\n}\n\n\ncomponent::collision::BodyPicked PickHandler::findCollision()\n{\n if (useCollisions) return findCollisionUsingPipeline();\n else return findCollisionUsingBruteForce();\n}\n\ncomponent::collision::BodyPicked PickHandler::findCollisionUsingPipeline()\n{\n const defaulttype::Vector3& origin = mouseCollision->getRay(0).origin();\n const defaulttype::Vector3& direction = mouseCollision->getRay(0).direction();\n const double& maxLength = mouseCollision->getRay(0).l();\n\n BodyPicked result;\n const std::set< sofa::component::collision::BaseRayContact*> &contacts = mouseCollision->getContacts();\n for (std::set< sofa::component::collision::BaseRayContact*>::const_iterator it=contacts.begin(); it != contacts.end(); ++it)\n {\n\n const sofa::helper::vector<core::componentmodel::collision::DetectionOutput*>& output = (*it)->getDetectionOutputs();\n sofa::core::CollisionModel *modelInCollision;\n for (unsigned int i=0; i<output.size(); ++i)\n {\n\n if (output[i]->elem.first.getCollisionModel() == mouseCollision)\n {\n modelInCollision = output[i]->elem.second.getCollisionModel();\n if (!modelInCollision->isSimulated()) continue;\n\n\n const double d = (output[i]->point[1]-origin)*direction;\n if (d<0.0 || d>maxLength) continue;\n if (result.body == NULL || d < result.rayLength)\n {\n result.body=modelInCollision;\n result.indexCollisionElement = output[i]->elem.second.getIndex();\n result.point = output[i]->point[1];\n result.dist = (output[i]->point[1]-output[i]->point[0]).norm();\n result.rayLength = d;\n }\n }\n else if (output[i]->elem.second.getCollisionModel() == mouseCollision)\n {\n modelInCollision = output[i]->elem.first.getCollisionModel();\n if (!modelInCollision->isSimulated()) continue;\n\n const double d = (output[i]->point[0]-origin)*direction;\n if (d<0.0 || d>maxLength) continue;\n if (result.body == NULL || d < result.rayLength)\n {\n result.body=modelInCollision;\n result.indexCollisionElement = output[i]->elem.first.getIndex();\n result.point = output[i]->point[0];\n result.dist = (output[i]->point[1]-output[i]->point[0]).norm();\n result.rayLength = d;\n }\n }\n }\n }\n return result;\n}\n\ncomponent::collision::BodyPicked PickHandler::findCollisionUsingBruteForce()\n{\n const defaulttype::Vector3& origin = mouseCollision->getRay(0).origin();\n const defaulttype::Vector3& direction = mouseCollision->getRay(0).direction();\n const double& maxLength = mouseCollision->getRay(0).l();\n\n return findCollisionUsingBruteForce(origin, direction, maxLength);\n}\n\n\ncomponent::collision::BodyPicked PickHandler::findCollisionUsingBruteForce(const defaulttype::Vector3& origin,\n const defaulttype::Vector3& direction,\n double maxLength)\n{\n BodyPicked result;\n \/\/ Look for particles hit by this ray\n simulation::MechanicalPickParticlesVisitor picker(origin, direction, maxLength, 0);\n core::objectmodel::BaseNode* rootNode = dynamic_cast<core::objectmodel::BaseNode*>(sofa::simulation::getSimulation()->getContext());\n\n if (rootNode) picker.execute(rootNode->getContext());\n else std::cerr << \"ERROR: root node not found.\" << std::endl;\n\n if (!picker.particles.empty())\n {\n core::componentmodel::behavior::BaseMechanicalState *mstate = picker.particles.begin()->second.first;\n result.mstate=mstate;\n result.indexCollisionElement = picker.particles.begin()->second.second;\n result.point[0] = mstate->getPX(result.indexCollisionElement);\n result.point[1] = mstate->getPY(result.indexCollisionElement);\n result.point[2] = mstate->getPZ(result.indexCollisionElement);\n result.dist = 0;\n result.rayLength = (result.point-origin)*direction;\n }\n return result;\n}\n\n}\n}\n\n<commit_msg>r5492\/sofa-dev : FIX : Compilation with only SOFA_DOUBLE.<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 <sofa\/gui\/PickHandler.h>\n\n#include <sofa\/component\/collision\/ComponentMouseInteraction.h>\n#include <sofa\/component\/collision\/RayContact.h>\n\n#include <sofa\/simulation\/common\/InitVisitor.h>\n#include <sofa\/simulation\/common\/DeleteVisitor.h>\n#include <sofa\/simulation\/common\/MechanicalVisitor.h>\n\n#include <sofa\/helper\/Factory.inl>\n\n#include <iostream>\n\n\n\n\n\nnamespace sofa\n{\nusing namespace component::collision;\n#ifndef SOFA_FLOAT\nhelper::Creator<ComponentMouseInteraction::ComponentMouseInteractionFactory,TComponentMouseInteraction<defaulttype::Vec3dTypes> > ComponentMouseInteractionVec3dClass (\"MouseSpringVec3d\",true);\n#endif\n#ifndef SOFA_DOUBLE\nhelper::Creator<ComponentMouseInteraction::ComponentMouseInteractionFactory, TComponentMouseInteraction<defaulttype::Vec3fTypes> > ComponentMouseInteractionVec3fClass (\"MouseSpringVec3f\",true);\n#endif\n\nnamespace gui\n{\n\nPickHandler::PickHandler():interactorInUse(false), mouseStatus(DEACTIVATED),mouseButton(NONE)\n{\n operations[NONE] =\n operations[LEFT] =\n operations[MIDDLE] =\n operations[RIGHT] = NULL;\n\n mouseNode = simulation::getSimulation()->newNode(\"Mouse\");\n\n mouseContainer = new MouseContainer; mouseContainer->resize(1);\n mouseContainer->setName(\"MousePosition\");\n mouseNode->addObject(mouseContainer);\n\n\n mouseCollision = new MouseCollisionModel;\n mouseCollision->setNbRay(1);\n mouseCollision->getRay(0).l() = 1000000;\n mouseCollision->setName(\"MouseCollisionModel\");\n mouseNode->addObject(mouseCollision);\n\n\n mouseNode->init();\n mouseContainer->init();\n mouseCollision->init();\n\n\n\n\n typedef component::collision::ComponentMouseInteraction::ComponentMouseInteractionFactory MouseFactory;\n const MouseFactory *factory = MouseFactory::getInstance();\n for (MouseFactory::const_iterator it = factory->begin(); it != factory->end(); ++it)\n {\n instanceComponents.push_back(it->second->createInstance(NULL));\n instanceComponents.back()->init(mouseNode);\n }\n interaction = instanceComponents.back();\n}\n\nPickHandler::~PickHandler()\n{\n\/\/ for (unsigned int i=0;i<instanceComponents.size();++i) delete instanceComponents[i];\n}\n\nvoid PickHandler::init()\n{\n core::componentmodel::collision::Pipeline *pipeline;\n simulation::getSimulation()->getContext()->get(pipeline, core::objectmodel::BaseContext::SearchRoot);\n\n useCollisions = (pipeline != NULL);\n}\n\nvoid PickHandler::reset()\n{\n activateRay(false);\n mouseButton = NONE;\n for (unsigned int i=0; i<instanceComponents.size(); ++i) instanceComponents[i]->reset();\n}\n\nvoid PickHandler::activateRay(bool act)\n{\n if (interactorInUse && !act)\n {\n mouseNode->detachFromGraph();\n\n\n operations[LEFT]->end();\n operations[MIDDLE]->end();\n operations[RIGHT]->end();\n\n interaction->deactivate();\n\n interactorInUse=false;\n }\n else if (!interactorInUse && act)\n {\n Node *root = static_cast<Node*>(simulation::getSimulation()->getContext());\n root->addChild(mouseNode);\n interaction->activate();\n interactorInUse=true;\n }\n}\n\n\n\n\nbool PickHandler::needToCastRay()\n{\n return !getInteraction()->mouseInteractor->isMouseAttached();\n}\n\n\nvoid PickHandler::setCompatibleInteractor()\n{\n if (useCollisions)\n {\n if (!lastPicked.body ) return;\n\n if (interaction->isCompatible(lastPicked.body->getContext())) return;\n for (unsigned int i=0; i<instanceComponents.size(); ++i)\n {\n if (instanceComponents[i] != interaction &&\n instanceComponents[i]->isCompatible(lastPicked.body->getContext()))\n {\n interaction->deactivate();\n interaction = instanceComponents[i];\n interaction->activate();\n }\n }\n }\n else\n {\n if (!lastPicked.mstate) return;\n\n if (interaction->isCompatible(lastPicked.mstate->getContext())) return;\n for (unsigned int i=0; i<instanceComponents.size(); ++i)\n {\n if (instanceComponents[i] != interaction &&\n instanceComponents[i]->isCompatible(lastPicked.mstate->getContext()))\n {\n interaction->deactivate();\n interaction = instanceComponents[i];\n interaction->activate();\n }\n }\n }\n\n}\n\n\nvoid PickHandler::updateRay(const sofa::defaulttype::Vector3 &position,const sofa::defaulttype::Vector3 &orientation)\n{\n if (!interactorInUse) return;\n mouseCollision->getRay(0).origin() = position+orientation*interaction->mouseInteractor->getDistanceFromMouse();\n mouseCollision->getRay(0).direction() = orientation;\n\n if (needToCastRay())\n {\n lastPicked=findCollision();\n setCompatibleInteractor();\n interaction->mouseInteractor->setMouseRayModel(mouseCollision);\n interaction->mouseInteractor->setBodyPicked(lastPicked);\n }\n\n\n if(mouseButton != NONE)\n {\n switch (mouseStatus)\n {\n case PRESSED:\n {\n operations[mouseButton]->start();\n mouseStatus=ACTIVATED;\n break;\n }\n case RELEASED:\n {\n operations[mouseButton]->end();\n mouseStatus=DEACTIVATED;\n break;\n }\n case ACTIVATED:\n {\n operations[mouseButton]->execution();\n }\n case DEACTIVATED:\n {\n operations[mouseButton]->wait();\n }\n }\n }\n}\n\n\/\/Clear the node create, and destroy all its components\nvoid PickHandler::handleMouseEvent(MOUSE_STATUS status, MOUSE_BUTTON button)\n{\n if (!interaction) return;\n\n mouseButton=button;\n mouseStatus=status;\n}\n\n\nComponentMouseInteraction *PickHandler::getInteraction()\n{\n return interaction;\n}\n\n\ncomponent::collision::BodyPicked PickHandler::findCollision()\n{\n if (useCollisions) return findCollisionUsingPipeline();\n else return findCollisionUsingBruteForce();\n}\n\ncomponent::collision::BodyPicked PickHandler::findCollisionUsingPipeline()\n{\n const defaulttype::Vector3& origin = mouseCollision->getRay(0).origin();\n const defaulttype::Vector3& direction = mouseCollision->getRay(0).direction();\n const double& maxLength = mouseCollision->getRay(0).l();\n\n BodyPicked result;\n const std::set< sofa::component::collision::BaseRayContact*> &contacts = mouseCollision->getContacts();\n for (std::set< sofa::component::collision::BaseRayContact*>::const_iterator it=contacts.begin(); it != contacts.end(); ++it)\n {\n\n const sofa::helper::vector<core::componentmodel::collision::DetectionOutput*>& output = (*it)->getDetectionOutputs();\n sofa::core::CollisionModel *modelInCollision;\n for (unsigned int i=0; i<output.size(); ++i)\n {\n\n if (output[i]->elem.first.getCollisionModel() == mouseCollision)\n {\n modelInCollision = output[i]->elem.second.getCollisionModel();\n if (!modelInCollision->isSimulated()) continue;\n\n\n const double d = (output[i]->point[1]-origin)*direction;\n if (d<0.0 || d>maxLength) continue;\n if (result.body == NULL || d < result.rayLength)\n {\n result.body=modelInCollision;\n result.indexCollisionElement = output[i]->elem.second.getIndex();\n result.point = output[i]->point[1];\n result.dist = (output[i]->point[1]-output[i]->point[0]).norm();\n result.rayLength = d;\n }\n }\n else if (output[i]->elem.second.getCollisionModel() == mouseCollision)\n {\n modelInCollision = output[i]->elem.first.getCollisionModel();\n if (!modelInCollision->isSimulated()) continue;\n\n const double d = (output[i]->point[0]-origin)*direction;\n if (d<0.0 || d>maxLength) continue;\n if (result.body == NULL || d < result.rayLength)\n {\n result.body=modelInCollision;\n result.indexCollisionElement = output[i]->elem.first.getIndex();\n result.point = output[i]->point[0];\n result.dist = (output[i]->point[1]-output[i]->point[0]).norm();\n result.rayLength = d;\n }\n }\n }\n }\n return result;\n}\n\ncomponent::collision::BodyPicked PickHandler::findCollisionUsingBruteForce()\n{\n const defaulttype::Vector3& origin = mouseCollision->getRay(0).origin();\n const defaulttype::Vector3& direction = mouseCollision->getRay(0).direction();\n const double& maxLength = mouseCollision->getRay(0).l();\n\n return findCollisionUsingBruteForce(origin, direction, maxLength);\n}\n\n\ncomponent::collision::BodyPicked PickHandler::findCollisionUsingBruteForce(const defaulttype::Vector3& origin,\n const defaulttype::Vector3& direction,\n double maxLength)\n{\n BodyPicked result;\n \/\/ Look for particles hit by this ray\n simulation::MechanicalPickParticlesVisitor picker(origin, direction, maxLength, 0);\n core::objectmodel::BaseNode* rootNode = dynamic_cast<core::objectmodel::BaseNode*>(sofa::simulation::getSimulation()->getContext());\n\n if (rootNode) picker.execute(rootNode->getContext());\n else std::cerr << \"ERROR: root node not found.\" << std::endl;\n\n if (!picker.particles.empty())\n {\n core::componentmodel::behavior::BaseMechanicalState *mstate = picker.particles.begin()->second.first;\n result.mstate=mstate;\n result.indexCollisionElement = picker.particles.begin()->second.second;\n result.point[0] = mstate->getPX(result.indexCollisionElement);\n result.point[1] = mstate->getPY(result.indexCollisionElement);\n result.point[2] = mstate->getPZ(result.indexCollisionElement);\n result.dist = 0;\n result.rayLength = (result.point-origin)*direction;\n }\n return result;\n}\n\n}\n}\n\n<|endoftext|>"} {"text":"<commit_before>#include \"dbreader.h\"\n\n#define DEBUG if (0) qDebug() << __PRETTY_FUNCTION__\n\nDbReader::DbReader(QObject *parent)\n : QObject(parent), m_stop(false)\n{\n qRegisterMetaType<QList<QSqlRecord> >();\n qRegisterMetaType<QSqlDatabase>();\n qRegisterMetaType<QSqlQuery>();\n qRegisterMetaType<DbReader *>();\n qRegisterMetaType<void *>();\n}\n\nDbReader::~DbReader()\n{\n QSqlDatabase::removeDatabase(m_db.connectionName());\n}\n\nvoid DbReader::stop() \n{\n m_stop = true;\n}\n\nvoid DbReader::initialize(const QSqlDatabase &db)\n{\n m_db = QSqlDatabase::cloneDatabase(db, QUuid::createUuid().toString());\n if (!m_db.open())\n qFatal(\"Erorr opening database: %s\", qPrintable(m_db.lastError().text()));\n}\n\nvoid DbReader::execute(const QSqlQuery &q, void *userData)\n{\n QSqlQuery query(q);\n query.setForwardOnly(true);\n if (!query.exec())\n qFatal(\"Error executing query: %s\", qPrintable(query.lastQuery()));\n\n QList<QSqlRecord> data = readRecords(query);\n DEBUG << \"Read \" << data.count() << \"records\";\n\n if (!m_stop)\n emit dataReady(this, data, userData);\n}\n\nQList<QSqlRecord> DbReader::readRecords(QSqlQuery &query)\n{\n QList<QSqlRecord> data;\n while (query.next() && !m_stop) {\n data.append(query.record());\n }\n return data;\n}\n\n<commit_msg>Clear database variable, to avoid warning when closing the connection<commit_after>#include \"dbreader.h\"\n\n#define DEBUG if (0) qDebug() << __PRETTY_FUNCTION__\n\nDbReader::DbReader(QObject *parent)\n : QObject(parent), m_stop(false)\n{\n qRegisterMetaType<QList<QSqlRecord> >();\n qRegisterMetaType<QSqlDatabase>();\n qRegisterMetaType<QSqlQuery>();\n qRegisterMetaType<DbReader *>();\n qRegisterMetaType<void *>();\n}\n\nDbReader::~DbReader()\n{\n m_db = QSqlDatabase();\n QSqlDatabase::removeDatabase(m_db.connectionName());\n}\n\nvoid DbReader::stop() \n{\n m_stop = true;\n}\n\nvoid DbReader::initialize(const QSqlDatabase &db)\n{\n m_db = QSqlDatabase::cloneDatabase(db, QUuid::createUuid().toString());\n if (!m_db.open())\n qFatal(\"Erorr opening database: %s\", qPrintable(m_db.lastError().text()));\n}\n\nvoid DbReader::execute(const QSqlQuery &q, void *userData)\n{\n QSqlQuery query(q);\n query.setForwardOnly(true);\n if (!query.exec())\n qFatal(\"Error executing query: %s\", qPrintable(query.lastQuery()));\n\n QList<QSqlRecord> data = readRecords(query);\n DEBUG << \"Read \" << data.count() << \"records\";\n\n if (!m_stop)\n emit dataReady(this, data, userData);\n}\n\nQList<QSqlRecord> DbReader::readRecords(QSqlQuery &query)\n{\n QList<QSqlRecord> data;\n while (query.next() && !m_stop) {\n data.append(query.record());\n }\n return data;\n}\n\n<|endoftext|>"} {"text":"<commit_before><commit_msg>Set port for floodechos subrequests<commit_after><|endoftext|>"} {"text":"<commit_before>\/******************************************************************************\\\n* File: process.cpp\n* Purpose: Implementation of class 'wxExProcess'\n* Author: Anton van Wezenbeek\n* RCS-ID: $Id$\n*\n* Copyright (c) 1998-2009 Anton van Wezenbeek\n* All rights are reserved. Reproduction in whole or part is prohibited\n* without the written consent of the copyright owner.\n\\******************************************************************************\/\n\n#include <wx\/wxprec.h>\n#ifndef WX_PRECOMP\n#include <wx\/wx.h>\n#endif\n#include <wx\/regex.h>\n#include <wx\/tokenzr.h>\n#include <wx\/txtstrm.h> \/\/ for wxTextInputStream\n#include <wx\/extension\/configdlg.h>\n#include <wx\/extension\/log.h>\n#include <wx\/extension\/util.h> \/\/ for wxExConfigFirstOf\n#include <wx\/extension\/report\/process.h>\n#include <wx\/extension\/report\/defs.h>\n#include <wx\/extension\/report\/frame.h>\n#include <wx\/extension\/report\/listitem.h>\n#include <wx\/extension\/report\/listview.h>\n\nBEGIN_EVENT_TABLE(wxExProcess, wxProcess)\n EVT_TIMER(-1, wxExProcess::OnTimer)\nEND_EVENT_TABLE()\n\nwxString wxExProcess::m_Command;\nwxString wxExProcess::m_WorkingDirKey = _(\"Process folder\");\n\nwxExProcess::wxExProcess(\n wxExFrameWithHistory* frame,\n const wxString& command)\n : wxProcess(NULL, -1)\n , m_Frame(frame)\n , m_ListView(NULL)\n , m_Timer(this)\n{\n if (!command.empty())\n {\n m_Command = command;\n }\n\n Redirect();\n}\n\nbool wxExProcess::CheckInput()\n{\n if (m_ListView == NULL)\n {\n return false;\n }\n\n bool hasInput = false;\n\n \/\/ This assumes that the output is always line buffered.\n wxString line;\n\n if (IsInputAvailable())\n {\n wxTextInputStream tis(*GetInputStream());\n line << tis.ReadLine();\n hasInput = true;\n }\n else if (IsErrorAvailable())\n {\n wxTextInputStream tis(*GetErrorStream());\n line << tis.ReadLine();\n hasInput = true;\n }\n\n if (hasInput && !line.empty())\n {\n wxString lineno;\n wxString path;\n\n \/\/ Check on error in php script output.\n const wxRegEx regex(\".*in \\\\(.*\\\\) on line \\\\(.*\\\\)\", wxRE_ADVANCED);\n\n if (regex.Matches(line))\n {\n size_t start, len;\n\n if (regex.GetMatch(&start, &len, 1))\n {\n path = line.substr(start, len);\n }\n\n if (regex.GetMatch(&start, &len, 2))\n {\n lineno = line.substr(start, len);\n }\n }\n else\n {\n \/\/ Check on error in gcc output (and some others).\n wxStringTokenizer tkz(line, ':');\n path = tkz.GetNextToken();\n\n if (tkz.HasMoreTokens())\n {\n const wxString number = tkz.GetNextToken();\n if (atoi(number.c_str()) != 0) lineno = number;\n }\n }\n\n wxFileName fn(path);\n\n fn.Normalize();\n\n if (fn.FileExists())\n {\n wxExListItem item(m_ListView, fn);\n item.Insert();\n item.SetItem(_(\"Line\"), line);\n item.SetItem(_(\"Line No\"), lineno);\n }\n else\n {\n m_ListView->InsertItem(m_ListView->GetItemCount(), line, -1);\n }\n\n \/\/ If nothing selected, then ensure last line is visible.\n \/\/ Otherwise you are busy inspecting some line, and\n \/\/ it would be irritating to get it out of view.\n if (m_ListView->GetSelectedItemCount() == 0)\n {\n m_ListView->EnsureVisible(m_ListView->GetItemCount() - 1);\n }\n\n#if wxUSE_STATUSBAR\n m_ListView->UpdateStatusBar();\n#endif\n }\n\n return hasInput;\n}\n\nint wxExProcess::ConfigDialog(\n wxWindow* parent,\n const wxString& title)\n{\n std::vector<wxExConfigItem> v;\n\n v.push_back(wxExConfigItem(\n _(\"Process\"), \n CONFIG_COMBOBOX, \n wxEmptyString));\n\n v.push_back(wxExConfigItem(\n m_WorkingDirKey, \n CONFIG_COMBOBOXDIR, \n wxEmptyString,\n true,\n 1000));\n\n const auto result = wxExConfigDialog(parent,\n v,\n title).ShowModal();\n\n if (result == wxID_OK)\n {\n m_Command = wxExConfigFirstOf(_(\"Process\"));\n }\n\n return result;\n}\n\nlong wxExProcess::Execute()\n{\n if (m_Command.empty())\n {\n if (ConfigDialog(m_ListView) == wxID_CANCEL)\n {\n return 0;\n }\n }\n\n wxString cwd;\n const wxString dir = wxExConfigFirstOf(m_WorkingDirKey);\n\n if (!dir.empty())\n {\n cwd = wxGetCwd();\n if (!wxSetWorkingDirectory(dir))\n {\n wxLogError(_(\"Cannot set working directory\"));\n return 0;\n }\n }\n\n m_ListView = m_Frame->Activate(wxExListViewStandard::LIST_PROCESS);\n\n if (m_ListView == NULL)\n {\n \/\/ Only show a message, and continue,\n \/\/ easier for testing.\n wxLogMessage(_(\"No listview to collect output\"));\n }\n\n const long pid = wxExecute(m_Command, wxEXEC_ASYNC, this);\n\n if (pid > 0)\n {\n SetPid(pid);\n\n#if wxUSE_STATUSBAR\n wxExFrame::StatusText(m_Command);\n#endif\n wxExLog::Get()->Log(m_Command);\n\n m_Timer.Start(1000); \/\/ each 1000 milliseconds\n }\n else\n {\n wxLogError(_(\"Cannot execute\") + \": \" + m_Command);\n }\n\n if (!cwd.empty())\n {\n wxSetWorkingDirectory(cwd);\n }\n\n return pid;\n}\n\nbool wxExProcess::IsRunning() const\n{\n if (GetPid() < 0)\n {\n return false;\n }\n\n return Exists(GetPid());\n}\n\nwxKillError wxExProcess::Kill(wxSignal sig)\n{\n if (!IsRunning())\n {\n return wxKILL_NO_PROCESS;\n }\n\n m_Timer.Stop();\n \n#if wxUSE_STATUSBAR\n wxExFrame::StatusText(_(\"Stopped\"));\n#endif\n\n DeletePendingEvents();\n\n delete this;\n\n return wxProcess::Kill(GetPid(), sig);\n}\n\nvoid wxExProcess::OnTerminate(\n int WXUNUSED(pid), \n int WXUNUSED(status))\n{\n m_Timer.Stop();\n\n \/\/ Collect remaining input.\n while (CheckInput())\n {\n \/\/ Do nothing.\n }\n\n#if wxUSE_STATUSBAR\n wxExFrame::StatusText(_(\"Ready\"));\n#endif\n\n wxCommandEvent event(wxEVT_COMMAND_MENU_SELECTED, ID_TERMINATED_PROCESS);\n wxPostEvent(wxTheApp->GetTopWindow(), event);\n}\n\nvoid wxExProcess::OnTimer(wxTimerEvent& event)\n{\n while (CheckInput())\n {\n \/\/ Do nothing.\n }\n}\n<commit_msg>do not delete process any more<commit_after>\/******************************************************************************\\\n* File: process.cpp\n* Purpose: Implementation of class 'wxExProcess'\n* Author: Anton van Wezenbeek\n* RCS-ID: $Id$\n*\n* Copyright (c) 1998-2009 Anton van Wezenbeek\n* All rights are reserved. Reproduction in whole or part is prohibited\n* without the written consent of the copyright owner.\n\\******************************************************************************\/\n\n#include <wx\/wxprec.h>\n#ifndef WX_PRECOMP\n#include <wx\/wx.h>\n#endif\n#include <wx\/regex.h>\n#include <wx\/tokenzr.h>\n#include <wx\/txtstrm.h> \/\/ for wxTextInputStream\n#include <wx\/extension\/configdlg.h>\n#include <wx\/extension\/log.h>\n#include <wx\/extension\/util.h> \/\/ for wxExConfigFirstOf\n#include <wx\/extension\/report\/process.h>\n#include <wx\/extension\/report\/defs.h>\n#include <wx\/extension\/report\/frame.h>\n#include <wx\/extension\/report\/listitem.h>\n#include <wx\/extension\/report\/listview.h>\n\nBEGIN_EVENT_TABLE(wxExProcess, wxProcess)\n EVT_TIMER(-1, wxExProcess::OnTimer)\nEND_EVENT_TABLE()\n\nwxString wxExProcess::m_Command;\nwxString wxExProcess::m_WorkingDirKey = _(\"Process folder\");\n\nwxExProcess::wxExProcess(\n wxExFrameWithHistory* frame,\n const wxString& command)\n : wxProcess(NULL, -1)\n , m_Frame(frame)\n , m_ListView(NULL)\n , m_Timer(this)\n{\n if (!command.empty())\n {\n m_Command = command;\n }\n\n Redirect();\n}\n\nbool wxExProcess::CheckInput()\n{\n if (m_ListView == NULL)\n {\n return false;\n }\n\n bool hasInput = false;\n\n \/\/ This assumes that the output is always line buffered.\n wxString line;\n\n if (IsInputAvailable())\n {\n wxTextInputStream tis(*GetInputStream());\n line << tis.ReadLine();\n hasInput = true;\n }\n else if (IsErrorAvailable())\n {\n wxTextInputStream tis(*GetErrorStream());\n line << tis.ReadLine();\n hasInput = true;\n }\n\n if (hasInput && !line.empty())\n {\n wxString lineno;\n wxString path;\n\n \/\/ Check on error in php script output.\n const wxRegEx regex(\".*in \\\\(.*\\\\) on line \\\\(.*\\\\)\", wxRE_ADVANCED);\n\n if (regex.Matches(line))\n {\n size_t start, len;\n\n if (regex.GetMatch(&start, &len, 1))\n {\n path = line.substr(start, len);\n }\n\n if (regex.GetMatch(&start, &len, 2))\n {\n lineno = line.substr(start, len);\n }\n }\n else\n {\n \/\/ Check on error in gcc output (and some others).\n wxStringTokenizer tkz(line, ':');\n path = tkz.GetNextToken();\n\n if (tkz.HasMoreTokens())\n {\n const wxString number = tkz.GetNextToken();\n if (atoi(number.c_str()) != 0) lineno = number;\n }\n }\n\n wxFileName fn(path);\n\n fn.Normalize();\n\n if (fn.FileExists())\n {\n wxExListItem item(m_ListView, fn);\n item.Insert();\n item.SetItem(_(\"Line\"), line);\n item.SetItem(_(\"Line No\"), lineno);\n }\n else\n {\n m_ListView->InsertItem(m_ListView->GetItemCount(), line, -1);\n }\n\n \/\/ If nothing selected, then ensure last line is visible.\n \/\/ Otherwise you are busy inspecting some line, and\n \/\/ it would be irritating to get it out of view.\n if (m_ListView->GetSelectedItemCount() == 0)\n {\n m_ListView->EnsureVisible(m_ListView->GetItemCount() - 1);\n }\n\n#if wxUSE_STATUSBAR\n m_ListView->UpdateStatusBar();\n#endif\n }\n\n return hasInput;\n}\n\nint wxExProcess::ConfigDialog(\n wxWindow* parent,\n const wxString& title)\n{\n std::vector<wxExConfigItem> v;\n\n v.push_back(wxExConfigItem(\n _(\"Process\"), \n CONFIG_COMBOBOX, \n wxEmptyString));\n\n v.push_back(wxExConfigItem(\n m_WorkingDirKey, \n CONFIG_COMBOBOXDIR, \n wxEmptyString,\n true,\n 1000));\n\n const auto result = wxExConfigDialog(parent,\n v,\n title).ShowModal();\n\n if (result == wxID_OK)\n {\n m_Command = wxExConfigFirstOf(_(\"Process\"));\n }\n\n return result;\n}\n\nlong wxExProcess::Execute()\n{\n if (m_Command.empty())\n {\n if (ConfigDialog(m_ListView) == wxID_CANCEL)\n {\n return 0;\n }\n }\n\n wxString cwd;\n const wxString dir = wxExConfigFirstOf(m_WorkingDirKey);\n\n if (!dir.empty())\n {\n cwd = wxGetCwd();\n if (!wxSetWorkingDirectory(dir))\n {\n wxLogError(_(\"Cannot set working directory\"));\n return 0;\n }\n }\n\n m_ListView = m_Frame->Activate(wxExListViewStandard::LIST_PROCESS);\n\n if (m_ListView == NULL)\n {\n \/\/ Only show a message, and continue,\n \/\/ easier for testing.\n wxLogMessage(_(\"No listview to collect output\"));\n }\n\n const long pid = wxExecute(m_Command, wxEXEC_ASYNC, this);\n\n if (pid > 0)\n {\n SetPid(pid);\n\n#if wxUSE_STATUSBAR\n wxExFrame::StatusText(m_Command);\n#endif\n wxExLog::Get()->Log(m_Command);\n\n m_Timer.Start(1000); \/\/ each 1000 milliseconds\n }\n else\n {\n wxLogError(_(\"Cannot execute\") + \": \" + m_Command);\n }\n\n if (!cwd.empty())\n {\n wxSetWorkingDirectory(cwd);\n }\n\n return pid;\n}\n\nbool wxExProcess::IsRunning() const\n{\n if (GetPid() < 0)\n {\n return false;\n }\n\n return Exists(GetPid());\n}\n\nwxKillError wxExProcess::Kill(wxSignal sig)\n{\n if (!IsRunning())\n {\n return wxKILL_NO_PROCESS;\n }\n\n m_Timer.Stop();\n \n#if wxUSE_STATUSBAR\n wxExFrame::StatusText(_(\"Stopped\"));\n#endif\n\n DeletePendingEvents();\n\n return wxProcess::Kill(GetPid(), sig);\n}\n\nvoid wxExProcess::OnTerminate(\n int WXUNUSED(pid), \n int WXUNUSED(status))\n{\n m_Timer.Stop();\n\n \/\/ Collect remaining input.\n while (CheckInput())\n {\n \/\/ Do nothing.\n }\n\n#if wxUSE_STATUSBAR\n wxExFrame::StatusText(_(\"Ready\"));\n#endif\n\n wxCommandEvent event(wxEVT_COMMAND_MENU_SELECTED, ID_TERMINATED_PROCESS);\n wxPostEvent(wxTheApp->GetTopWindow(), event);\n}\n\nvoid wxExProcess::OnTimer(wxTimerEvent& event)\n{\n while (CheckInput())\n {\n \/\/ Do nothing.\n }\n}\n<|endoftext|>"} {"text":"<commit_before>\/*\n This file is part of the PhantomJS project from Ofi Labs.\n\n Copyright (C) 2010 Ariya Hidayat <ariya.hidayat@gmail.com>\n\n Redistribution and use in source and binary forms, with or without\n modification, are permitted provided that the following conditions are met:\n\n * Redistributions of source code must retain the above copyright\n notice, this list of conditions and the following disclaimer.\n * Redistributions in binary form must reproduce the above copyright\n notice, this list of conditions and the following disclaimer in the\n documentation and\/or other materials provided with the distribution.\n * Neither the name of the <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\n#include <QtGui>\n#include <QtWebKit>\n#include <iostream>\n\n#if QT_VERSION < QT_VERSION_CHECK(4, 5, 0)\n#error Use Qt 4.5 or later version\n#endif\n\n#define PHANTOMJS_VERSION_MAJOR 1\n#define PHANTOMJS_VERSION_MINOR 1\n#define PHANTOMJS_VERSION_PATCH 0\n#define PHANTOMJS_VERSION_STRING \"1.1.0\"\n\nclass WebPage: public QWebPage\n{\n Q_OBJECT\npublic:\n WebPage(QObject *parent = 0);\n\npublic slots:\n bool shouldInterruptJavaScript();\n\nprotected:\n void javaScriptAlert(QWebFrame *originatingFrame, const QString &msg);\n void javaScriptConsoleMessage(const QString &message, int lineNumber, const QString &sourceID);\n QString userAgentForUrl(const QUrl &url) const;\n\nprivate:\n QString m_userAgent;\n friend class Phantom;\n};\n\nWebPage::WebPage(QObject *parent)\n : QWebPage(parent)\n{\n m_userAgent = QWebPage::userAgentForUrl(QUrl());\n}\n\nvoid WebPage::javaScriptAlert(QWebFrame *originatingFrame, const QString &msg)\n{\n Q_UNUSED(originatingFrame);\n std::cout << \"JavaScript alert: \" << qPrintable(msg) << std::endl;\n}\n\nvoid WebPage::javaScriptConsoleMessage(const QString &message, int lineNumber, const QString &sourceID)\n{\n if (!sourceID.isEmpty())\n std::cout << qPrintable(sourceID) << \":\" << lineNumber << \" \";\n std::cout << qPrintable(message) << std::endl;\n}\n\nbool WebPage::shouldInterruptJavaScript()\n{\n QApplication::processEvents(QEventLoop::AllEvents, 42);\n return false;\n}\n\nQString WebPage::userAgentForUrl(const QUrl &url) const\n{\n Q_UNUSED(url);\n return m_userAgent;\n}\n\nclass Phantom: public QObject\n{\n Q_OBJECT\n Q_PROPERTY(QStringList args READ args)\n Q_PROPERTY(QString content READ content WRITE setContent)\n Q_PROPERTY(QString loadStatus READ loadStatus)\n Q_PROPERTY(QString state READ state WRITE setState)\n Q_PROPERTY(QString userAgent READ userAgent WRITE setUserAgent)\n Q_PROPERTY(QVariantMap version READ version)\n Q_PROPERTY(QVariantMap viewportSize READ viewportSize WRITE setViewportSize)\n\npublic:\n Phantom(QObject *parent = 0);\n\n QStringList args() const;\n\n QString content() const;\n void setContent(const QString &content);\n\n void execute(const QString &fileName);\n int returnValue() const;\n\n QString loadStatus() const;\n\n void setState(const QString &value);\n QString state() const;\n\n void setUserAgent(const QString &ua);\n QString userAgent() const;\n\n QVariantMap version() const;\n\n void setViewportSize(const QVariantMap &size);\n QVariantMap viewportSize() const;\n\npublic slots:\n void exit(int code = 0);\n void open(const QString &address);\n bool render(const QString &fileName);\n void sleep(int ms);\n\nprivate slots:\n void inject();\n void finish(bool);\n\nprivate:\n QStringList m_args;\n QString m_loadStatus;\n WebPage m_page;\n int m_returnValue;\n QString m_script;\n QString m_state;\n};\n\nPhantom::Phantom(QObject *parent)\n : QObject(parent)\n , m_returnValue(0)\n{\n QPalette palette = m_page.palette();\n palette.setBrush(QPalette::Base, Qt::transparent);\n m_page.setPalette(palette);\n\n \/\/ first argument: program name (phantomjs)\n \/\/ second argument: script name\n m_args = QApplication::arguments();\n m_args.removeFirst();\n m_args.removeFirst();\n\n connect(m_page.mainFrame(), SIGNAL(javaScriptWindowObjectCleared()), SLOT(inject()));\n connect(&m_page, SIGNAL(loadFinished(bool)), this, SLOT(finish(bool)));\n\n m_page.settings()->setAttribute(QWebSettings::OfflineStorageDatabaseEnabled, true);\n m_page.settings()->setOfflineStoragePath(QDesktopServices::storageLocation(QDesktopServices::DataLocation));\n\n#if QT_VERSION < QT_VERSION_CHECK(4, 6, 0)\n m_page.settings()->setAttribute(QWebSettings::LocalStorageDatabaseEnabled, true);\n#else\n m_page.settings()->setAttribute(QWebSettings::FrameFlatteningEnabled, true);\n m_page.settings()->setAttribute(QWebSettings::LocalStorageEnabled, true);\n m_page.settings()->setLocalStoragePath(QDesktopServices::storageLocation(QDesktopServices::DataLocation));\n#endif\n\n \/\/ Ensure we have document.body.\n m_page.mainFrame()->setHtml(\"<html><body><\/body><\/html>\");\n\n m_page.mainFrame()->setScrollBarPolicy(Qt::Horizontal, Qt::ScrollBarAlwaysOff);\n m_page.mainFrame()->setScrollBarPolicy(Qt::Vertical, Qt::ScrollBarAlwaysOff);\n}\n\nQStringList Phantom::args() const\n{\n return m_args;\n}\n\nQString Phantom::content() const\n{\n return m_page.mainFrame()->toHtml();\n}\n\nvoid Phantom::setContent(const QString &content)\n{\n m_page.mainFrame()->setHtml(content);\n}\n\nvoid Phantom::execute(const QString &fileName)\n{\n QFile file;\n file.setFileName(fileName);\n if (!file.open(QFile::ReadOnly)) {\n std::cerr << \"Can't open \" << qPrintable(fileName) << std::endl << std::endl;\n exit(1);\n return;\n }\n m_script = QString::fromUtf8(file.readAll());\n file.close();\n\n m_page.mainFrame()->evaluateJavaScript(m_script);\n}\n\nvoid Phantom::exit(int code)\n{\n m_returnValue = code;\n disconnect(&m_page, SIGNAL(loadFinished(bool)), this, SLOT(finish(bool)));\n QTimer::singleShot(0, qApp, SLOT(quit()));\n}\n\nvoid Phantom::finish(bool success)\n{\n m_loadStatus = success ? \"success\" : \"fail\";\n m_page.mainFrame()->evaluateJavaScript(m_script);\n}\n\nvoid Phantom::inject()\n{\n m_page.mainFrame()->addToJavaScriptWindowObject(\"phantom\", this);\n}\n\nQString Phantom::loadStatus() const\n{\n return m_loadStatus;\n}\n\nvoid Phantom::open(const QString &address)\n{\n m_page.triggerAction(QWebPage::Stop);\n m_loadStatus = \"loading\";\n m_page.mainFrame()->setUrl(address);\n}\n\nbool Phantom::render(const QString &fileName)\n{\n QFileInfo fileInfo(fileName);\n QDir dir;\n dir.mkpath(fileInfo.absolutePath());\n\n if (fileName.toLower().endsWith(\".pdf\")) {\n QPrinter printer;\n printer.setOutputFormat(QPrinter::PdfFormat);\n printer.setOutputFileName(fileName);\n m_page.mainFrame()->print(&printer);\n return true;\n }\n\n QSize viewportSize = m_page.viewportSize();\n QSize pageSize = m_page.mainFrame()->contentsSize();\n if (pageSize.isEmpty())\n return false;\n\n QImage buffer(pageSize, QImage::Format_ARGB32);\n buffer.fill(qRgba(255, 255, 255, 0));\n QPainter p(&buffer);\n p.setRenderHint(QPainter::Antialiasing, true);\n p.setRenderHint(QPainter::TextAntialiasing, true);\n p.setRenderHint(QPainter::SmoothPixmapTransform, true);\n m_page.setViewportSize(pageSize);\n m_page.mainFrame()->render(&p);\n p.end();\n m_page.setViewportSize(viewportSize);\n return buffer.save(fileName);\n}\n\nint Phantom::returnValue() const\n{\n return m_returnValue;\n}\n\nvoid Phantom::sleep(int ms)\n{\n QTime startTime = QTime::currentTime();\n while (true) {\n QApplication::processEvents(QEventLoop::AllEvents, 25);\n if (startTime.msecsTo(QTime::currentTime()) > ms)\n break;\n }\n}\n\nvoid Phantom::setState(const QString &value)\n{\n m_state = value;\n}\n\nQString Phantom::state() const\n{\n return m_state;\n}\n\nvoid Phantom::setUserAgent(const QString &ua)\n{\n m_page.m_userAgent = ua;\n}\n\nQString Phantom::userAgent() const\n{\n return m_page.m_userAgent;\n}\n\nQVariantMap Phantom::version() const\n{\n QVariantMap result;\n result[\"major\"] = PHANTOMJS_VERSION_MAJOR;\n result[\"minor\"] = PHANTOMJS_VERSION_MINOR;\n result[\"patch\"] = PHANTOMJS_VERSION_PATCH;\n return result;\n}\n\nvoid Phantom::setViewportSize(const QVariantMap &size)\n{\n int w = size.value(\"width\").toInt();\n int h = size.value(\"height\").toInt();\n if (w > 0 && h > 0)\n m_page.setViewportSize(QSize(w, h));\n}\n\nQVariantMap Phantom::viewportSize() const\n{\n QVariantMap result;\n QSize size = m_page.viewportSize();\n result[\"width\"] = size.width();\n result[\"height\"] = size.height();\n return result;\n}\n\n#include \"phantomjs.moc\"\n\nint main(int argc, char** argv)\n{\n if (argc < 2) {\n std::cerr << \"phantomjs script.js\" << std::endl << std::endl;\n return 1;\n }\n\n QNetworkProxyFactory::setUseSystemConfiguration(true);\n\n QApplication app(argc, argv);\n\n app.setWindowIcon(QIcon(\":\/phantomjs-icon.png\"));\n app.setApplicationName(\"PhantomJS\");\n app.setOrganizationName(\"Ofi Labs\");\n app.setOrganizationDomain(\"www.ofilabs.com\");\n app.setApplicationVersion(PHANTOMJS_VERSION_STRING);\n\n Phantom phantom;\n phantom.execute(QString::fromLocal8Bit(argv[1]));\n app.exec();\n return phantom.returnValue();\n}\n<commit_msg>Make it compile with Qt 4.6.<commit_after>\/*\n This file is part of the PhantomJS project from Ofi Labs.\n\n Copyright (C) 2010 Ariya Hidayat <ariya.hidayat@gmail.com>\n\n Redistribution and use in source and binary forms, with or without\n modification, are permitted provided that the following conditions are met:\n\n * Redistributions of source code must retain the above copyright\n notice, this list of conditions and the following disclaimer.\n * Redistributions in binary form must reproduce the above copyright\n notice, this list of conditions and the following disclaimer in the\n documentation and\/or other materials provided with the distribution.\n * Neither the name of the <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\n#include <QtGui>\n#include <QtWebKit>\n#include <iostream>\n\n#if QT_VERSION < QT_VERSION_CHECK(4, 5, 0)\n#error Use Qt 4.5 or later version\n#endif\n\n#define PHANTOMJS_VERSION_MAJOR 1\n#define PHANTOMJS_VERSION_MINOR 1\n#define PHANTOMJS_VERSION_PATCH 0\n#define PHANTOMJS_VERSION_STRING \"1.1.0\"\n\nclass WebPage: public QWebPage\n{\n Q_OBJECT\npublic:\n WebPage(QObject *parent = 0);\n\npublic slots:\n bool shouldInterruptJavaScript();\n\nprotected:\n void javaScriptAlert(QWebFrame *originatingFrame, const QString &msg);\n void javaScriptConsoleMessage(const QString &message, int lineNumber, const QString &sourceID);\n QString userAgentForUrl(const QUrl &url) const;\n\nprivate:\n QString m_userAgent;\n friend class Phantom;\n};\n\nWebPage::WebPage(QObject *parent)\n : QWebPage(parent)\n{\n m_userAgent = QWebPage::userAgentForUrl(QUrl());\n}\n\nvoid WebPage::javaScriptAlert(QWebFrame *originatingFrame, const QString &msg)\n{\n Q_UNUSED(originatingFrame);\n std::cout << \"JavaScript alert: \" << qPrintable(msg) << std::endl;\n}\n\nvoid WebPage::javaScriptConsoleMessage(const QString &message, int lineNumber, const QString &sourceID)\n{\n if (!sourceID.isEmpty())\n std::cout << qPrintable(sourceID) << \":\" << lineNumber << \" \";\n std::cout << qPrintable(message) << std::endl;\n}\n\nbool WebPage::shouldInterruptJavaScript()\n{\n QApplication::processEvents(QEventLoop::AllEvents, 42);\n return false;\n}\n\nQString WebPage::userAgentForUrl(const QUrl &url) const\n{\n Q_UNUSED(url);\n return m_userAgent;\n}\n\nclass Phantom: public QObject\n{\n Q_OBJECT\n Q_PROPERTY(QStringList args READ args)\n Q_PROPERTY(QString content READ content WRITE setContent)\n Q_PROPERTY(QString loadStatus READ loadStatus)\n Q_PROPERTY(QString state READ state WRITE setState)\n Q_PROPERTY(QString userAgent READ userAgent WRITE setUserAgent)\n Q_PROPERTY(QVariantMap version READ version)\n Q_PROPERTY(QVariantMap viewportSize READ viewportSize WRITE setViewportSize)\n\npublic:\n Phantom(QObject *parent = 0);\n\n QStringList args() const;\n\n QString content() const;\n void setContent(const QString &content);\n\n void execute(const QString &fileName);\n int returnValue() const;\n\n QString loadStatus() const;\n\n void setState(const QString &value);\n QString state() const;\n\n void setUserAgent(const QString &ua);\n QString userAgent() const;\n\n QVariantMap version() const;\n\n void setViewportSize(const QVariantMap &size);\n QVariantMap viewportSize() const;\n\npublic slots:\n void exit(int code = 0);\n void open(const QString &address);\n bool render(const QString &fileName);\n void sleep(int ms);\n\nprivate slots:\n void inject();\n void finish(bool);\n\nprivate:\n QStringList m_args;\n QString m_loadStatus;\n WebPage m_page;\n int m_returnValue;\n QString m_script;\n QString m_state;\n};\n\nPhantom::Phantom(QObject *parent)\n : QObject(parent)\n , m_returnValue(0)\n{\n QPalette palette = m_page.palette();\n palette.setBrush(QPalette::Base, Qt::transparent);\n m_page.setPalette(palette);\n\n \/\/ first argument: program name (phantomjs)\n \/\/ second argument: script name\n m_args = QApplication::arguments();\n m_args.removeFirst();\n m_args.removeFirst();\n\n connect(m_page.mainFrame(), SIGNAL(javaScriptWindowObjectCleared()), SLOT(inject()));\n connect(&m_page, SIGNAL(loadFinished(bool)), this, SLOT(finish(bool)));\n\n m_page.settings()->setAttribute(QWebSettings::OfflineStorageDatabaseEnabled, true);\n m_page.settings()->setOfflineStoragePath(QDesktopServices::storageLocation(QDesktopServices::DataLocation));\n\n m_page.settings()->setAttribute(QWebSettings::LocalStorageDatabaseEnabled, true);\n\n#if QT_VERSION >= QT_VERSION_CHECK(4, 6, 0)\n m_page.settings()->setAttribute(QWebSettings::FrameFlatteningEnabled, true);\n m_page.settings()->setAttribute(QWebSettings::LocalStorageEnabled, true);\n m_page.settings()->setLocalStoragePath(QDesktopServices::storageLocation(QDesktopServices::DataLocation));\n#endif\n\n \/\/ Ensure we have document.body.\n m_page.mainFrame()->setHtml(\"<html><body><\/body><\/html>\");\n\n m_page.mainFrame()->setScrollBarPolicy(Qt::Horizontal, Qt::ScrollBarAlwaysOff);\n m_page.mainFrame()->setScrollBarPolicy(Qt::Vertical, Qt::ScrollBarAlwaysOff);\n}\n\nQStringList Phantom::args() const\n{\n return m_args;\n}\n\nQString Phantom::content() const\n{\n return m_page.mainFrame()->toHtml();\n}\n\nvoid Phantom::setContent(const QString &content)\n{\n m_page.mainFrame()->setHtml(content);\n}\n\nvoid Phantom::execute(const QString &fileName)\n{\n QFile file;\n file.setFileName(fileName);\n if (!file.open(QFile::ReadOnly)) {\n std::cerr << \"Can't open \" << qPrintable(fileName) << std::endl << std::endl;\n exit(1);\n return;\n }\n m_script = QString::fromUtf8(file.readAll());\n file.close();\n\n m_page.mainFrame()->evaluateJavaScript(m_script);\n}\n\nvoid Phantom::exit(int code)\n{\n m_returnValue = code;\n disconnect(&m_page, SIGNAL(loadFinished(bool)), this, SLOT(finish(bool)));\n QTimer::singleShot(0, qApp, SLOT(quit()));\n}\n\nvoid Phantom::finish(bool success)\n{\n m_loadStatus = success ? \"success\" : \"fail\";\n m_page.mainFrame()->evaluateJavaScript(m_script);\n}\n\nvoid Phantom::inject()\n{\n m_page.mainFrame()->addToJavaScriptWindowObject(\"phantom\", this);\n}\n\nQString Phantom::loadStatus() const\n{\n return m_loadStatus;\n}\n\nvoid Phantom::open(const QString &address)\n{\n m_page.triggerAction(QWebPage::Stop);\n m_loadStatus = \"loading\";\n m_page.mainFrame()->setUrl(address);\n}\n\nbool Phantom::render(const QString &fileName)\n{\n QFileInfo fileInfo(fileName);\n QDir dir;\n dir.mkpath(fileInfo.absolutePath());\n\n if (fileName.toLower().endsWith(\".pdf\")) {\n QPrinter printer;\n printer.setOutputFormat(QPrinter::PdfFormat);\n printer.setOutputFileName(fileName);\n m_page.mainFrame()->print(&printer);\n return true;\n }\n\n QSize viewportSize = m_page.viewportSize();\n QSize pageSize = m_page.mainFrame()->contentsSize();\n if (pageSize.isEmpty())\n return false;\n\n QImage buffer(pageSize, QImage::Format_ARGB32);\n buffer.fill(qRgba(255, 255, 255, 0));\n QPainter p(&buffer);\n p.setRenderHint(QPainter::Antialiasing, true);\n p.setRenderHint(QPainter::TextAntialiasing, true);\n p.setRenderHint(QPainter::SmoothPixmapTransform, true);\n m_page.setViewportSize(pageSize);\n m_page.mainFrame()->render(&p);\n p.end();\n m_page.setViewportSize(viewportSize);\n return buffer.save(fileName);\n}\n\nint Phantom::returnValue() const\n{\n return m_returnValue;\n}\n\nvoid Phantom::sleep(int ms)\n{\n QTime startTime = QTime::currentTime();\n while (true) {\n QApplication::processEvents(QEventLoop::AllEvents, 25);\n if (startTime.msecsTo(QTime::currentTime()) > ms)\n break;\n }\n}\n\nvoid Phantom::setState(const QString &value)\n{\n m_state = value;\n}\n\nQString Phantom::state() const\n{\n return m_state;\n}\n\nvoid Phantom::setUserAgent(const QString &ua)\n{\n m_page.m_userAgent = ua;\n}\n\nQString Phantom::userAgent() const\n{\n return m_page.m_userAgent;\n}\n\nQVariantMap Phantom::version() const\n{\n QVariantMap result;\n result[\"major\"] = PHANTOMJS_VERSION_MAJOR;\n result[\"minor\"] = PHANTOMJS_VERSION_MINOR;\n result[\"patch\"] = PHANTOMJS_VERSION_PATCH;\n return result;\n}\n\nvoid Phantom::setViewportSize(const QVariantMap &size)\n{\n int w = size.value(\"width\").toInt();\n int h = size.value(\"height\").toInt();\n if (w > 0 && h > 0)\n m_page.setViewportSize(QSize(w, h));\n}\n\nQVariantMap Phantom::viewportSize() const\n{\n QVariantMap result;\n QSize size = m_page.viewportSize();\n result[\"width\"] = size.width();\n result[\"height\"] = size.height();\n return result;\n}\n\n#include \"phantomjs.moc\"\n\nint main(int argc, char** argv)\n{\n if (argc < 2) {\n std::cerr << \"phantomjs script.js\" << std::endl << std::endl;\n return 1;\n }\n\n QNetworkProxyFactory::setUseSystemConfiguration(true);\n\n QApplication app(argc, argv);\n\n app.setWindowIcon(QIcon(\":\/phantomjs-icon.png\"));\n app.setApplicationName(\"PhantomJS\");\n app.setOrganizationName(\"Ofi Labs\");\n app.setOrganizationDomain(\"www.ofilabs.com\");\n app.setApplicationVersion(PHANTOMJS_VERSION_STRING);\n\n Phantom phantom;\n phantom.execute(QString::fromLocal8Bit(argv[1]));\n app.exec();\n return phantom.returnValue();\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\/examples\/tree_view_example.h\"\n\n#include \"base\/utf_string_conversions.h\"\n#include \"ui\/views\/controls\/menu\/menu_model_adapter.h\"\n#include \"ui\/views\/controls\/menu\/menu_runner.h\"\n#include \"ui\/views\/controls\/tree\/tree_view.h\"\n#include \"ui\/views\/controls\/tree\/tree_view.h\"\n#include \"ui\/views\/layout\/grid_layout.h\"\n\nnamespace views {\nnamespace examples {\n\nTreeViewExample::TreeViewExample()\n : ExampleBase(\"Tree View\"),\n model_(new NodeType(ASCIIToUTF16(\"root\"), 1)) {\n}\n\nTreeViewExample::~TreeViewExample() {\n \/\/ Delete the view before the model.\n delete tree_view_;\n tree_view_ = NULL;\n}\n\nvoid TreeViewExample::CreateExampleView(View* container) {\n \/\/ Add some sample data.\n NodeType* colors_node = new NodeType(ASCIIToUTF16(\"colors\"), 1);\n model_.GetRoot()->Add(colors_node, 0);\n colors_node->Add(new NodeType(ASCIIToUTF16(\"red\"), 1), 0);\n colors_node->Add(new NodeType(ASCIIToUTF16(\"green\"), 1), 1);\n colors_node->Add(new NodeType(ASCIIToUTF16(\"blue\"), 1), 2);\n\n NodeType* sheep_node = new NodeType(ASCIIToUTF16(\"sheep\"), 1);\n model_.GetRoot()->Add(sheep_node, 0);\n sheep_node->Add(new NodeType(ASCIIToUTF16(\"Sheep 1\"), 1), 0);\n sheep_node->Add(new NodeType(ASCIIToUTF16(\"Sheep 2\"), 1), 1);\n\n tree_view_ = new TreeView();\n tree_view_->set_context_menu_controller(this);\n tree_view_->SetRootShown(false);\n tree_view_->set_lines_at_root(true);\n tree_view_->SetModel(&model_);\n tree_view_->SetController(this);\n add_ = new TextButton(this, ASCIIToUTF16(\"Add\"));\n add_->set_focusable(true);\n remove_ = new TextButton(this, ASCIIToUTF16(\"Remove\"));\n remove_->set_focusable(true);\n change_title_ = new TextButton(this, ASCIIToUTF16(\"Change Title\"));\n change_title_->set_focusable(true);\n\n GridLayout* layout = new GridLayout(container);\n container->SetLayoutManager(layout);\n\n const int tree_view_column = 0;\n ColumnSet* column_set = layout->AddColumnSet(tree_view_column);\n column_set->AddColumn(GridLayout::FILL, GridLayout::FILL,\n 1.0f, GridLayout::USE_PREF, 0, 0);\n layout->StartRow(1 \/* expand *\/, tree_view_column);\n layout->AddView(tree_view_->CreateParentIfNecessary());\n\n \/\/ Add control buttons horizontally.\n const int button_column = 1;\n column_set = layout->AddColumnSet(button_column);\n for (int i = 0; i < 3; i++) {\n column_set->AddColumn(GridLayout::FILL, GridLayout::FILL,\n 1.0f, GridLayout::USE_PREF, 0, 0);\n }\n\n layout->StartRow(0 \/* no expand *\/, button_column);\n layout->AddView(add_);\n layout->AddView(remove_);\n layout->AddView(change_title_);\n}\n\nvoid TreeViewExample::AddNewNode() {\n NodeType* selected_node =\n static_cast<NodeType*>(tree_view_->GetSelectedNode());\n if (!selected_node)\n selected_node = model_.GetRoot();\n NodeType* new_node = new NodeType(selected_node->GetTitle(), 1);\n model_.Add(selected_node, new_node, selected_node->child_count());\n tree_view_->SetSelectedNode(new_node);\n}\n\nbool TreeViewExample::IsCommandIdEnabled(int command_id) {\n return command_id != ID_REMOVE ||\n tree_view_->GetSelectedNode() != model_.GetRoot();\n}\n\nvoid TreeViewExample::ButtonPressed(Button* sender, const Event& event) {\n NodeType* selected_node =\n static_cast<NodeType*>(tree_view_->GetSelectedNode());\n if (sender == add_) {\n AddNewNode();\n } else if (sender == remove_) {\n DCHECK(selected_node);\n DCHECK_NE(model_.GetRoot(), selected_node);\n model_.Remove(selected_node->parent(), selected_node);\n } else if (sender == change_title_) {\n DCHECK(selected_node);\n model_.SetTitle(selected_node,\n selected_node->GetTitle() + ASCIIToUTF16(\"new\"));\n }\n}\n\nvoid TreeViewExample::OnTreeViewSelectionChanged(TreeView* tree_view) {\n ui::TreeModelNode* node = tree_view_->GetSelectedNode();\n if (node) {\n change_title_->SetEnabled(true);\n remove_->SetEnabled(node != model_.GetRoot());\n } else {\n change_title_->SetEnabled(false);\n remove_->SetEnabled(false);\n }\n}\n\nbool TreeViewExample::CanEdit(TreeView* tree_view,\n ui::TreeModelNode* node) {\n return true;\n}\n\nvoid TreeViewExample::ShowContextMenuForView(View* source,\n const gfx::Point& point) {\n ui::SimpleMenuModel context_menu_model(this);\n context_menu_model.AddItem(ID_EDIT, ASCIIToUTF16(\"Edit\"));\n context_menu_model.AddItem(ID_REMOVE, ASCIIToUTF16(\"Remove\"));\n context_menu_model.AddItem(ID_ADD, ASCIIToUTF16(\"Add\"));\n views::MenuModelAdapter menu_adapter(&context_menu_model);\n context_menu_runner_.reset(new views::MenuRunner(menu_adapter.CreateMenu()));\n if (context_menu_runner_->RunMenuAt(source->GetWidget(), NULL,\n gfx::Rect(point, gfx::Size()), views::MenuItemView::TOPLEFT, 0) ==\n views::MenuRunner::MENU_DELETED)\n return;\n}\n\nbool TreeViewExample::IsCommandIdChecked(int command_id) const {\n return false;\n}\n\nbool TreeViewExample::IsCommandIdEnabled(int command_id) const {\n return const_cast<TreeViewExample*>(this)->IsCommandIdEnabled(command_id);\n}\n\nbool TreeViewExample::GetAcceleratorForCommandId(\n int command_id,\n ui::Accelerator* accelerator) {\n return false;\n}\n\nvoid TreeViewExample::ExecuteCommand(int command_id) {\n NodeType* selected_node =\n static_cast<NodeType*>(tree_view_->GetSelectedNode());\n switch (command_id) {\n case ID_EDIT:\n tree_view_->StartEditing(selected_node);\n break;\n case ID_REMOVE:\n model_.Remove(selected_node->parent(), selected_node);\n break;\n case ID_ADD:\n AddNewNode();\n break;\n default:\n NOTREACHED();\n }\n}\n\n} \/\/ namespace examples\n} \/\/ namespace views\n<commit_msg>views\/examples: Fix crash when closing views examples window.<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\/examples\/tree_view_example.h\"\n\n#include \"base\/utf_string_conversions.h\"\n#include \"ui\/views\/controls\/menu\/menu_model_adapter.h\"\n#include \"ui\/views\/controls\/menu\/menu_runner.h\"\n#include \"ui\/views\/controls\/tree\/tree_view.h\"\n#include \"ui\/views\/controls\/tree\/tree_view.h\"\n#include \"ui\/views\/layout\/grid_layout.h\"\n\nnamespace views {\nnamespace examples {\n\nTreeViewExample::TreeViewExample()\n : ExampleBase(\"Tree View\"),\n tree_view_(NULL),\n model_(new NodeType(ASCIIToUTF16(\"root\"), 1)) {\n}\n\nTreeViewExample::~TreeViewExample() {\n \/\/ Delete the view before the model.\n delete tree_view_;\n tree_view_ = NULL;\n}\n\nvoid TreeViewExample::CreateExampleView(View* container) {\n \/\/ Add some sample data.\n NodeType* colors_node = new NodeType(ASCIIToUTF16(\"colors\"), 1);\n model_.GetRoot()->Add(colors_node, 0);\n colors_node->Add(new NodeType(ASCIIToUTF16(\"red\"), 1), 0);\n colors_node->Add(new NodeType(ASCIIToUTF16(\"green\"), 1), 1);\n colors_node->Add(new NodeType(ASCIIToUTF16(\"blue\"), 1), 2);\n\n NodeType* sheep_node = new NodeType(ASCIIToUTF16(\"sheep\"), 1);\n model_.GetRoot()->Add(sheep_node, 0);\n sheep_node->Add(new NodeType(ASCIIToUTF16(\"Sheep 1\"), 1), 0);\n sheep_node->Add(new NodeType(ASCIIToUTF16(\"Sheep 2\"), 1), 1);\n\n tree_view_ = new TreeView();\n tree_view_->set_context_menu_controller(this);\n tree_view_->SetRootShown(false);\n tree_view_->set_lines_at_root(true);\n tree_view_->SetModel(&model_);\n tree_view_->SetController(this);\n add_ = new TextButton(this, ASCIIToUTF16(\"Add\"));\n add_->set_focusable(true);\n remove_ = new TextButton(this, ASCIIToUTF16(\"Remove\"));\n remove_->set_focusable(true);\n change_title_ = new TextButton(this, ASCIIToUTF16(\"Change Title\"));\n change_title_->set_focusable(true);\n\n GridLayout* layout = new GridLayout(container);\n container->SetLayoutManager(layout);\n\n const int tree_view_column = 0;\n ColumnSet* column_set = layout->AddColumnSet(tree_view_column);\n column_set->AddColumn(GridLayout::FILL, GridLayout::FILL,\n 1.0f, GridLayout::USE_PREF, 0, 0);\n layout->StartRow(1 \/* expand *\/, tree_view_column);\n layout->AddView(tree_view_->CreateParentIfNecessary());\n\n \/\/ Add control buttons horizontally.\n const int button_column = 1;\n column_set = layout->AddColumnSet(button_column);\n for (int i = 0; i < 3; i++) {\n column_set->AddColumn(GridLayout::FILL, GridLayout::FILL,\n 1.0f, GridLayout::USE_PREF, 0, 0);\n }\n\n layout->StartRow(0 \/* no expand *\/, button_column);\n layout->AddView(add_);\n layout->AddView(remove_);\n layout->AddView(change_title_);\n}\n\nvoid TreeViewExample::AddNewNode() {\n NodeType* selected_node =\n static_cast<NodeType*>(tree_view_->GetSelectedNode());\n if (!selected_node)\n selected_node = model_.GetRoot();\n NodeType* new_node = new NodeType(selected_node->GetTitle(), 1);\n model_.Add(selected_node, new_node, selected_node->child_count());\n tree_view_->SetSelectedNode(new_node);\n}\n\nbool TreeViewExample::IsCommandIdEnabled(int command_id) {\n return command_id != ID_REMOVE ||\n tree_view_->GetSelectedNode() != model_.GetRoot();\n}\n\nvoid TreeViewExample::ButtonPressed(Button* sender, const Event& event) {\n NodeType* selected_node =\n static_cast<NodeType*>(tree_view_->GetSelectedNode());\n if (sender == add_) {\n AddNewNode();\n } else if (sender == remove_) {\n DCHECK(selected_node);\n DCHECK_NE(model_.GetRoot(), selected_node);\n model_.Remove(selected_node->parent(), selected_node);\n } else if (sender == change_title_) {\n DCHECK(selected_node);\n model_.SetTitle(selected_node,\n selected_node->GetTitle() + ASCIIToUTF16(\"new\"));\n }\n}\n\nvoid TreeViewExample::OnTreeViewSelectionChanged(TreeView* tree_view) {\n ui::TreeModelNode* node = tree_view_->GetSelectedNode();\n if (node) {\n change_title_->SetEnabled(true);\n remove_->SetEnabled(node != model_.GetRoot());\n } else {\n change_title_->SetEnabled(false);\n remove_->SetEnabled(false);\n }\n}\n\nbool TreeViewExample::CanEdit(TreeView* tree_view,\n ui::TreeModelNode* node) {\n return true;\n}\n\nvoid TreeViewExample::ShowContextMenuForView(View* source,\n const gfx::Point& point) {\n ui::SimpleMenuModel context_menu_model(this);\n context_menu_model.AddItem(ID_EDIT, ASCIIToUTF16(\"Edit\"));\n context_menu_model.AddItem(ID_REMOVE, ASCIIToUTF16(\"Remove\"));\n context_menu_model.AddItem(ID_ADD, ASCIIToUTF16(\"Add\"));\n views::MenuModelAdapter menu_adapter(&context_menu_model);\n context_menu_runner_.reset(new views::MenuRunner(menu_adapter.CreateMenu()));\n if (context_menu_runner_->RunMenuAt(source->GetWidget(), NULL,\n gfx::Rect(point, gfx::Size()), views::MenuItemView::TOPLEFT, 0) ==\n views::MenuRunner::MENU_DELETED)\n return;\n}\n\nbool TreeViewExample::IsCommandIdChecked(int command_id) const {\n return false;\n}\n\nbool TreeViewExample::IsCommandIdEnabled(int command_id) const {\n return const_cast<TreeViewExample*>(this)->IsCommandIdEnabled(command_id);\n}\n\nbool TreeViewExample::GetAcceleratorForCommandId(\n int command_id,\n ui::Accelerator* accelerator) {\n return false;\n}\n\nvoid TreeViewExample::ExecuteCommand(int command_id) {\n NodeType* selected_node =\n static_cast<NodeType*>(tree_view_->GetSelectedNode());\n switch (command_id) {\n case ID_EDIT:\n tree_view_->StartEditing(selected_node);\n break;\n case ID_REMOVE:\n model_.Remove(selected_node->parent(), selected_node);\n break;\n case ID_ADD:\n AddNewNode();\n break;\n default:\n NOTREACHED();\n }\n}\n\n} \/\/ namespace examples\n} \/\/ namespace views\n<|endoftext|>"} {"text":"<commit_before><commit_msg>修正解析obj纹理坐标的一个BUG<commit_after><|endoftext|>"} {"text":"<commit_before>#include <stdio.h>\r\n\r\n#ifdef WIN32\r\n#include <winsock2.h>\r\n#else\r\n#include <sys\/types.h>\r\n#include <sys\/socket.h>\r\n#include <unistd.h>\r\n#include <netinet\/in.h>\r\n#include <arpa\/inet.h>\r\n#endif\r\n\r\n#include \"socket.h\"\r\n\r\n#ifdef WIN32\r\nbool wsaStartupDone = false;\r\n#endif\r\n\r\nClientSocket::ClientSocket()\r\n{\r\n sockfd = -1;\r\n\r\n#ifdef WIN32\r\n if (!wsaStartupDone)\r\n {\r\n WSADATA wsaData = {0};\r\n \/\/WSAStartup needs to be called on windows before sockets can be used. Request version 1.1, which is supported on windows 98 and higher.\r\n WSAStartup(MAKEWORD(1, 1), &wsaData);\r\n wsaStartupDone = true;\r\n }\r\n#endif\r\n}\r\n\r\nvoid ClientSocket::connectTo(std::string host, int port)\r\n{\r\n struct sockaddr_in serv_addr;\r\n sockfd = socket(AF_INET, SOCK_STREAM, 0);\r\n \r\n memset(&serv_addr, '0', sizeof(serv_addr)); \r\n serv_addr.sin_family = AF_INET;\r\n serv_addr.sin_port = htons(port);\r\n serv_addr.sin_addr.s_addr = inet_addr(host.c_str());\r\n if (connect(sockfd, (struct sockaddr *)&serv_addr, sizeof(serv_addr)) < 0)\r\n {\r\n printf(\"Connect to %s:%d failed\\n\", host.c_str(), port);\r\n close();\r\n return;\r\n }\r\n}\r\n\r\nClientSocket::~ClientSocket()\r\n{\r\n close();\r\n}\r\n\r\nvoid ClientSocket::sendNr(int nr)\r\n{\r\n sendAll(&nr, sizeof(int));\r\n}\r\n\r\nvoid ClientSocket::sendAll(const void* data, int length)\r\n{\r\n if (sockfd == -1)\r\n return;\r\n const char* ptr = (const char*)data;\r\n while(length > 0)\r\n {\r\n int n = send(sockfd, ptr, length, 0);\r\n if (n <= 0)\r\n {\r\n close();\r\n return;\r\n }\r\n ptr += length;\r\n length -= n;\r\n }\r\n}\r\n\r\nint ClientSocket::recvNr()\r\n{\r\n int ret = 0;\r\n recvAll(&ret, 4);\r\n return ret;\r\n}\r\n\r\nvoid ClientSocket::recvAll(void* data, int length)\r\n{\r\n if (sockfd == -1)\r\n return;\r\n char* ptr = (char*)data;\r\n while(length > 0)\r\n {\r\n int n = recv(sockfd, ptr, length, 0);\r\n if (n <= 0)\r\n {\r\n close();\r\n return;\r\n }\r\n ptr += length;\r\n length -= n;\r\n }\r\n}\r\n\r\nvoid ClientSocket::close()\r\n{\r\n if (sockfd == -1)\r\n return;\r\n#ifdef WIN32\r\n closesocket(sockfd);\r\n#else\r\n close(sockfd);\r\n#endif\r\n sockfd = -1;\r\n}\r\n<commit_msg>Add missing include and proper close call for linux.<commit_after>#include <stdio.h>\r\n#include <string.h>\r\n\r\n#ifdef WIN32\r\n#include <winsock2.h>\r\n#else\r\n#include <sys\/types.h>\r\n#include <sys\/socket.h>\r\n#include <unistd.h>\r\n#include <netinet\/in.h>\r\n#include <arpa\/inet.h>\r\n#endif\r\n\r\n#include \"socket.h\"\r\n\r\n#ifdef WIN32\r\nbool wsaStartupDone = false;\r\n#endif\r\n\r\nClientSocket::ClientSocket()\r\n{\r\n sockfd = -1;\r\n\r\n#ifdef WIN32\r\n if (!wsaStartupDone)\r\n {\r\n WSADATA wsaData = {0};\r\n \/\/WSAStartup needs to be called on windows before sockets can be used. Request version 1.1, which is supported on windows 98 and higher.\r\n WSAStartup(MAKEWORD(1, 1), &wsaData);\r\n wsaStartupDone = true;\r\n }\r\n#endif\r\n}\r\n\r\nvoid ClientSocket::connectTo(std::string host, int port)\r\n{\r\n struct sockaddr_in serv_addr;\r\n sockfd = socket(AF_INET, SOCK_STREAM, 0);\r\n \r\n memset(&serv_addr, '0', sizeof(serv_addr)); \r\n serv_addr.sin_family = AF_INET;\r\n serv_addr.sin_port = htons(port);\r\n serv_addr.sin_addr.s_addr = inet_addr(host.c_str());\r\n if (connect(sockfd, (struct sockaddr *)&serv_addr, sizeof(serv_addr)) < 0)\r\n {\r\n printf(\"Connect to %s:%d failed\\n\", host.c_str(), port);\r\n close();\r\n return;\r\n }\r\n}\r\n\r\nClientSocket::~ClientSocket()\r\n{\r\n close();\r\n}\r\n\r\nvoid ClientSocket::sendNr(int nr)\r\n{\r\n sendAll(&nr, sizeof(int));\r\n}\r\n\r\nvoid ClientSocket::sendAll(const void* data, int length)\r\n{\r\n if (sockfd == -1)\r\n return;\r\n const char* ptr = (const char*)data;\r\n while(length > 0)\r\n {\r\n int n = send(sockfd, ptr, length, 0);\r\n if (n <= 0)\r\n {\r\n close();\r\n return;\r\n }\r\n ptr += length;\r\n length -= n;\r\n }\r\n}\r\n\r\nint ClientSocket::recvNr()\r\n{\r\n int ret = 0;\r\n recvAll(&ret, 4);\r\n return ret;\r\n}\r\n\r\nvoid ClientSocket::recvAll(void* data, int length)\r\n{\r\n if (sockfd == -1)\r\n return;\r\n char* ptr = (char*)data;\r\n while(length > 0)\r\n {\r\n int n = recv(sockfd, ptr, length, 0);\r\n if (n <= 0)\r\n {\r\n close();\r\n return;\r\n }\r\n ptr += length;\r\n length -= n;\r\n }\r\n}\r\n\r\nvoid ClientSocket::close()\r\n{\r\n if (sockfd == -1)\r\n return;\r\n#ifdef WIN32\r\n closesocket(sockfd);\r\n#else\r\n ::close(sockfd);\r\n#endif\r\n sockfd = -1;\r\n}\r\n<|endoftext|>"} {"text":"<commit_before>\/\/===- Cloning.cpp - Unit tests for the Cloner ----------------------------===\/\/\n\/\/\n\/\/ The LLVM Compiler Infrastructure\n\/\/\n\/\/ This file is distributed under the University of Illinois Open Source\n\/\/ License. See LICENSE.TXT for details.\n\/\/\n\/\/===----------------------------------------------------------------------===\/\/\n\n#include \"llvm\/Transforms\/Utils\/Cloning.h\"\n#include \"llvm\/ADT\/ArrayRef.h\"\n#include \"llvm\/ADT\/STLExtras.h\"\n#include \"llvm\/ADT\/SmallPtrSet.h\"\n#include \"llvm\/IR\/Argument.h\"\n#include \"llvm\/IR\/Constant.h\"\n#include \"llvm\/IR\/DIBuilder.h\"\n#include \"llvm\/IR\/DebugInfo.h\"\n#include \"llvm\/IR\/Function.h\"\n#include \"llvm\/IR\/IRBuilder.h\"\n#include \"llvm\/IR\/InstIterator.h\"\n#include \"llvm\/IR\/Instructions.h\"\n#include \"llvm\/IR\/IntrinsicInst.h\"\n#include \"llvm\/IR\/LLVMContext.h\"\n#include \"llvm\/IR\/Module.h\"\n#include \"gtest\/gtest.h\"\n\nusing namespace llvm;\n\nnamespace {\n\nclass CloneInstruction : public ::testing::Test {\nprotected:\n virtual void SetUp() {\n V = nullptr;\n }\n\n template <typename T>\n T *clone(T *V1) {\n Value *V2 = V1->clone();\n Orig.insert(V1);\n Clones.insert(V2);\n return cast<T>(V2);\n }\n\n void eraseClones() {\n DeleteContainerPointers(Clones);\n }\n\n virtual void TearDown() {\n eraseClones();\n DeleteContainerPointers(Orig);\n delete V;\n }\n\n SmallPtrSet<Value *, 4> Orig; \/\/ Erase on exit\n SmallPtrSet<Value *, 4> Clones; \/\/ Erase in eraseClones\n\n LLVMContext context;\n Value *V;\n};\n\nTEST_F(CloneInstruction, OverflowBits) {\n V = new Argument(Type::getInt32Ty(context));\n\n BinaryOperator *Add = BinaryOperator::Create(Instruction::Add, V, V);\n BinaryOperator *Sub = BinaryOperator::Create(Instruction::Sub, V, V);\n BinaryOperator *Mul = BinaryOperator::Create(Instruction::Mul, V, V);\n\n BinaryOperator *AddClone = this->clone(Add);\n BinaryOperator *SubClone = this->clone(Sub);\n BinaryOperator *MulClone = this->clone(Mul);\n\n EXPECT_FALSE(AddClone->hasNoUnsignedWrap());\n EXPECT_FALSE(AddClone->hasNoSignedWrap());\n EXPECT_FALSE(SubClone->hasNoUnsignedWrap());\n EXPECT_FALSE(SubClone->hasNoSignedWrap());\n EXPECT_FALSE(MulClone->hasNoUnsignedWrap());\n EXPECT_FALSE(MulClone->hasNoSignedWrap());\n\n eraseClones();\n\n Add->setHasNoUnsignedWrap();\n Sub->setHasNoUnsignedWrap();\n Mul->setHasNoUnsignedWrap();\n\n AddClone = this->clone(Add);\n SubClone = this->clone(Sub);\n MulClone = this->clone(Mul);\n\n EXPECT_TRUE(AddClone->hasNoUnsignedWrap());\n EXPECT_FALSE(AddClone->hasNoSignedWrap());\n EXPECT_TRUE(SubClone->hasNoUnsignedWrap());\n EXPECT_FALSE(SubClone->hasNoSignedWrap());\n EXPECT_TRUE(MulClone->hasNoUnsignedWrap());\n EXPECT_FALSE(MulClone->hasNoSignedWrap());\n\n eraseClones();\n\n Add->setHasNoSignedWrap();\n Sub->setHasNoSignedWrap();\n Mul->setHasNoSignedWrap();\n\n AddClone = this->clone(Add);\n SubClone = this->clone(Sub);\n MulClone = this->clone(Mul);\n\n EXPECT_TRUE(AddClone->hasNoUnsignedWrap());\n EXPECT_TRUE(AddClone->hasNoSignedWrap());\n EXPECT_TRUE(SubClone->hasNoUnsignedWrap());\n EXPECT_TRUE(SubClone->hasNoSignedWrap());\n EXPECT_TRUE(MulClone->hasNoUnsignedWrap());\n EXPECT_TRUE(MulClone->hasNoSignedWrap());\n\n eraseClones();\n\n Add->setHasNoUnsignedWrap(false);\n Sub->setHasNoUnsignedWrap(false);\n Mul->setHasNoUnsignedWrap(false);\n\n AddClone = this->clone(Add);\n SubClone = this->clone(Sub);\n MulClone = this->clone(Mul);\n\n EXPECT_FALSE(AddClone->hasNoUnsignedWrap());\n EXPECT_TRUE(AddClone->hasNoSignedWrap());\n EXPECT_FALSE(SubClone->hasNoUnsignedWrap());\n EXPECT_TRUE(SubClone->hasNoSignedWrap());\n EXPECT_FALSE(MulClone->hasNoUnsignedWrap());\n EXPECT_TRUE(MulClone->hasNoSignedWrap());\n}\n\nTEST_F(CloneInstruction, Inbounds) {\n V = new Argument(Type::getInt32PtrTy(context));\n\n Constant *Z = Constant::getNullValue(Type::getInt32Ty(context));\n std::vector<Value *> ops;\n ops.push_back(Z);\n GetElementPtrInst *GEP =\n GetElementPtrInst::Create(Type::getInt32Ty(context), V, ops);\n EXPECT_FALSE(this->clone(GEP)->isInBounds());\n\n GEP->setIsInBounds();\n EXPECT_TRUE(this->clone(GEP)->isInBounds());\n}\n\nTEST_F(CloneInstruction, Exact) {\n V = new Argument(Type::getInt32Ty(context));\n\n BinaryOperator *SDiv = BinaryOperator::Create(Instruction::SDiv, V, V);\n EXPECT_FALSE(this->clone(SDiv)->isExact());\n\n SDiv->setIsExact(true);\n EXPECT_TRUE(this->clone(SDiv)->isExact());\n}\n\nTEST_F(CloneInstruction, Attributes) {\n Type *ArgTy1[] = { Type::getInt32PtrTy(context) };\n FunctionType *FT1 = FunctionType::get(Type::getVoidTy(context), ArgTy1, false);\n\n Function *F1 = Function::Create(FT1, Function::ExternalLinkage);\n BasicBlock *BB = BasicBlock::Create(context, \"\", F1);\n IRBuilder<> Builder(BB);\n Builder.CreateRetVoid();\n\n Function *F2 = Function::Create(FT1, Function::ExternalLinkage);\n\n Attribute::AttrKind AK[] = { Attribute::NoCapture };\n AttributeSet AS = AttributeSet::get(context, 0, AK);\n Argument *A = F1->arg_begin();\n A->addAttr(AS);\n\n SmallVector<ReturnInst*, 4> Returns;\n ValueToValueMapTy VMap;\n VMap[A] = UndefValue::get(A->getType());\n\n CloneFunctionInto(F2, F1, VMap, false, Returns);\n EXPECT_FALSE(F2->arg_begin()->hasNoCaptureAttr());\n\n delete F1;\n delete F2;\n}\n\nTEST_F(CloneInstruction, CallingConvention) {\n Type *ArgTy1[] = { Type::getInt32PtrTy(context) };\n FunctionType *FT1 = FunctionType::get(Type::getVoidTy(context), ArgTy1, false);\n\n Function *F1 = Function::Create(FT1, Function::ExternalLinkage);\n F1->setCallingConv(CallingConv::Cold);\n BasicBlock *BB = BasicBlock::Create(context, \"\", F1);\n IRBuilder<> Builder(BB);\n Builder.CreateRetVoid();\n\n Function *F2 = Function::Create(FT1, Function::ExternalLinkage);\n\n SmallVector<ReturnInst*, 4> Returns;\n ValueToValueMapTy VMap;\n VMap[F1->arg_begin()] = F2->arg_begin();\n\n CloneFunctionInto(F2, F1, VMap, false, Returns);\n EXPECT_EQ(CallingConv::Cold, F2->getCallingConv());\n\n delete F1;\n delete F2;\n}\n\nclass CloneFunc : public ::testing::Test {\nprotected:\n virtual void SetUp() {\n SetupModule();\n CreateOldFunc();\n CreateNewFunc();\n SetupFinder();\n }\n\n virtual void TearDown() {\n delete Finder;\n }\n\n void SetupModule() {\n M = new Module(\"\", C);\n }\n\n void CreateOldFunc() {\n FunctionType* FuncType = FunctionType::get(Type::getVoidTy(C), false);\n OldFunc = Function::Create(FuncType, GlobalValue::PrivateLinkage, \"f\", M);\n CreateOldFunctionBodyAndDI();\n }\n\n void CreateOldFunctionBodyAndDI() {\n DIBuilder DBuilder(*M);\n IRBuilder<> IBuilder(C);\n\n \/\/ Function DI\n DIFile File = DBuilder.createFile(\"filename.c\", \"\/file\/dir\/\");\n DITypeArray ParamTypes = DBuilder.getOrCreateTypeArray(None);\n DICompositeType FuncType = DBuilder.createSubroutineType(File, ParamTypes);\n DICompileUnit CU = DBuilder.createCompileUnit(dwarf::DW_LANG_C99,\n \"filename.c\", \"\/file\/dir\", \"CloneFunc\", false, \"\", 0);\n\n DISubprogram Subprogram = DBuilder.createFunction(CU, \"f\", \"f\", File, 4,\n FuncType, true, true, 3, 0, false, OldFunc);\n\n \/\/ Function body\n BasicBlock* Entry = BasicBlock::Create(C, \"\", OldFunc);\n IBuilder.SetInsertPoint(Entry);\n DebugLoc Loc = DebugLoc::get(3, 2, Subprogram);\n IBuilder.SetCurrentDebugLocation(Loc);\n AllocaInst* Alloca = IBuilder.CreateAlloca(IntegerType::getInt32Ty(C));\n IBuilder.SetCurrentDebugLocation(DebugLoc::get(4, 2, Subprogram));\n Value* AllocaContent = IBuilder.getInt32(1);\n Instruction* Store = IBuilder.CreateStore(AllocaContent, Alloca);\n IBuilder.SetCurrentDebugLocation(DebugLoc::get(5, 2, Subprogram));\n Instruction* Terminator = IBuilder.CreateRetVoid();\n\n \/\/ Create a local variable around the alloca\n DIType IntType = DBuilder.createBasicType(\"int\", 32, 0,\n dwarf::DW_ATE_signed);\n DIExpression E = DBuilder.createExpression();\n DIVariable Variable = DBuilder.createLocalVariable(\n dwarf::DW_TAG_auto_variable, Subprogram, \"x\", File, 5, IntType, true);\n DBuilder.insertDeclare(Alloca, Variable, E, Store);\n DBuilder.insertDbgValueIntrinsic(AllocaContent, 0, Variable, E, Terminator);\n \/\/ Finalize the debug info\n DBuilder.finalize();\n\n\n \/\/ Create another, empty, compile unit\n DIBuilder DBuilder2(*M);\n DBuilder2.createCompileUnit(dwarf::DW_LANG_C99,\n \"extra.c\", \"\/file\/dir\", \"CloneFunc\", false, \"\", 0);\n DBuilder2.finalize();\n }\n\n void CreateNewFunc() {\n ValueToValueMapTy VMap;\n NewFunc = CloneFunction(OldFunc, VMap, true, nullptr);\n M->getFunctionList().push_back(NewFunc);\n }\n\n void SetupFinder() {\n Finder = new DebugInfoFinder();\n Finder->processModule(*M);\n }\n\n LLVMContext C;\n Function* OldFunc;\n Function* NewFunc;\n Module* M;\n DebugInfoFinder* Finder;\n};\n\n\/\/ Test that a new, distinct function was created.\nTEST_F(CloneFunc, NewFunctionCreated) {\n EXPECT_NE(OldFunc, NewFunc);\n}\n\n\/\/ Test that a new subprogram entry was added and is pointing to the new\n\/\/ function, while the original subprogram still points to the old one.\nTEST_F(CloneFunc, Subprogram) {\n unsigned SubprogramCount = Finder->subprogram_count();\n EXPECT_EQ(2U, SubprogramCount);\n\n auto Iter = Finder->subprograms().begin();\n DISubprogram Sub1(*Iter);\n EXPECT_TRUE(Sub1.Verify());\n Iter++;\n DISubprogram Sub2(*Iter);\n EXPECT_TRUE(Sub2.Verify());\n\n EXPECT_TRUE((Sub1.getFunction() == OldFunc && Sub2.getFunction() == NewFunc)\n || (Sub1.getFunction() == NewFunc && Sub2.getFunction() == OldFunc));\n}\n\n\/\/ Test that the new subprogram entry was not added to the CU which doesn't\n\/\/ contain the old subprogram entry.\nTEST_F(CloneFunc, SubprogramInRightCU) {\n EXPECT_EQ(2U, Finder->compile_unit_count());\n\n auto Iter = Finder->compile_units().begin();\n DICompileUnit CU1(*Iter);\n EXPECT_TRUE(CU1.Verify());\n Iter++;\n DICompileUnit CU2(*Iter);\n EXPECT_TRUE(CU2.Verify());\n EXPECT_TRUE(CU1.getSubprograms().getNumElements() == 0\n || CU2.getSubprograms().getNumElements() == 0);\n}\n\n\/\/ Test that instructions in the old function still belong to it in the\n\/\/ metadata, while instruction in the new function belong to the new one.\nTEST_F(CloneFunc, InstructionOwnership) {\n inst_iterator OldIter = inst_begin(OldFunc);\n inst_iterator OldEnd = inst_end(OldFunc);\n inst_iterator NewIter = inst_begin(NewFunc);\n inst_iterator NewEnd = inst_end(NewFunc);\n while (OldIter != OldEnd && NewIter != NewEnd) {\n Instruction& OldI = *OldIter;\n Instruction& NewI = *NewIter;\n EXPECT_NE(&OldI, &NewI);\n\n EXPECT_EQ(OldI.hasMetadata(), NewI.hasMetadata());\n if (OldI.hasMetadata()) {\n const DebugLoc& OldDL = OldI.getDebugLoc();\n const DebugLoc& NewDL = NewI.getDebugLoc();\n\n \/\/ Verify that the debug location data is the same\n EXPECT_EQ(OldDL.getLine(), NewDL.getLine());\n EXPECT_EQ(OldDL.getCol(), NewDL.getCol());\n \n \/\/ But that they belong to different functions\n DISubprogram OldSubprogram(OldDL.getScope(C));\n DISubprogram NewSubprogram(NewDL.getScope(C));\n EXPECT_TRUE(OldSubprogram.Verify());\n EXPECT_TRUE(NewSubprogram.Verify());\n EXPECT_EQ(OldFunc, OldSubprogram.getFunction());\n EXPECT_EQ(NewFunc, NewSubprogram.getFunction());\n }\n\n ++OldIter;\n ++NewIter;\n }\n EXPECT_EQ(OldEnd, OldIter);\n EXPECT_EQ(NewEnd, NewIter);\n}\n\n\/\/ Test that the arguments for debug intrinsics in the new function were\n\/\/ properly cloned\nTEST_F(CloneFunc, DebugIntrinsics) {\n inst_iterator OldIter = inst_begin(OldFunc);\n inst_iterator OldEnd = inst_end(OldFunc);\n inst_iterator NewIter = inst_begin(NewFunc);\n inst_iterator NewEnd = inst_end(NewFunc);\n while (OldIter != OldEnd && NewIter != NewEnd) {\n Instruction& OldI = *OldIter;\n Instruction& NewI = *NewIter;\n if (DbgDeclareInst* OldIntrin = dyn_cast<DbgDeclareInst>(&OldI)) {\n DbgDeclareInst* NewIntrin = dyn_cast<DbgDeclareInst>(&NewI);\n EXPECT_TRUE(NewIntrin);\n\n \/\/ Old address must belong to the old function\n EXPECT_EQ(OldFunc, cast<AllocaInst>(OldIntrin->getAddress())->\n getParent()->getParent());\n \/\/ New address must belong to the new function\n EXPECT_EQ(NewFunc, cast<AllocaInst>(NewIntrin->getAddress())->\n getParent()->getParent());\n\n \/\/ Old variable must belong to the old function\n EXPECT_EQ(OldFunc, DISubprogram(DIVariable(OldIntrin->getVariable())\n .getContext()).getFunction());\n \/\/ New variable must belong to the New function\n EXPECT_EQ(NewFunc, DISubprogram(DIVariable(NewIntrin->getVariable())\n .getContext()).getFunction());\n } else if (DbgValueInst* OldIntrin = dyn_cast<DbgValueInst>(&OldI)) {\n DbgValueInst* NewIntrin = dyn_cast<DbgValueInst>(&NewI);\n EXPECT_TRUE(NewIntrin);\n\n \/\/ Old variable must belong to the old function\n EXPECT_EQ(OldFunc, DISubprogram(DIVariable(OldIntrin->getVariable())\n .getContext()).getFunction());\n \/\/ New variable must belong to the New function\n EXPECT_EQ(NewFunc, DISubprogram(DIVariable(NewIntrin->getVariable())\n .getContext()).getFunction());\n }\n\n ++OldIter;\n ++NewIter;\n }\n}\n\n}\n<commit_msg>Transforms: Fix a use of the old DebugLoc in unittests<commit_after>\/\/===- Cloning.cpp - Unit tests for the Cloner ----------------------------===\/\/\n\/\/\n\/\/ The LLVM Compiler Infrastructure\n\/\/\n\/\/ This file is distributed under the University of Illinois Open Source\n\/\/ License. See LICENSE.TXT for details.\n\/\/\n\/\/===----------------------------------------------------------------------===\/\/\n\n#include \"llvm\/Transforms\/Utils\/Cloning.h\"\n#include \"llvm\/ADT\/ArrayRef.h\"\n#include \"llvm\/ADT\/STLExtras.h\"\n#include \"llvm\/ADT\/SmallPtrSet.h\"\n#include \"llvm\/IR\/Argument.h\"\n#include \"llvm\/IR\/Constant.h\"\n#include \"llvm\/IR\/DIBuilder.h\"\n#include \"llvm\/IR\/DebugInfo.h\"\n#include \"llvm\/IR\/Function.h\"\n#include \"llvm\/IR\/IRBuilder.h\"\n#include \"llvm\/IR\/InstIterator.h\"\n#include \"llvm\/IR\/Instructions.h\"\n#include \"llvm\/IR\/IntrinsicInst.h\"\n#include \"llvm\/IR\/LLVMContext.h\"\n#include \"llvm\/IR\/Module.h\"\n#include \"gtest\/gtest.h\"\n\nusing namespace llvm;\n\nnamespace {\n\nclass CloneInstruction : public ::testing::Test {\nprotected:\n virtual void SetUp() {\n V = nullptr;\n }\n\n template <typename T>\n T *clone(T *V1) {\n Value *V2 = V1->clone();\n Orig.insert(V1);\n Clones.insert(V2);\n return cast<T>(V2);\n }\n\n void eraseClones() {\n DeleteContainerPointers(Clones);\n }\n\n virtual void TearDown() {\n eraseClones();\n DeleteContainerPointers(Orig);\n delete V;\n }\n\n SmallPtrSet<Value *, 4> Orig; \/\/ Erase on exit\n SmallPtrSet<Value *, 4> Clones; \/\/ Erase in eraseClones\n\n LLVMContext context;\n Value *V;\n};\n\nTEST_F(CloneInstruction, OverflowBits) {\n V = new Argument(Type::getInt32Ty(context));\n\n BinaryOperator *Add = BinaryOperator::Create(Instruction::Add, V, V);\n BinaryOperator *Sub = BinaryOperator::Create(Instruction::Sub, V, V);\n BinaryOperator *Mul = BinaryOperator::Create(Instruction::Mul, V, V);\n\n BinaryOperator *AddClone = this->clone(Add);\n BinaryOperator *SubClone = this->clone(Sub);\n BinaryOperator *MulClone = this->clone(Mul);\n\n EXPECT_FALSE(AddClone->hasNoUnsignedWrap());\n EXPECT_FALSE(AddClone->hasNoSignedWrap());\n EXPECT_FALSE(SubClone->hasNoUnsignedWrap());\n EXPECT_FALSE(SubClone->hasNoSignedWrap());\n EXPECT_FALSE(MulClone->hasNoUnsignedWrap());\n EXPECT_FALSE(MulClone->hasNoSignedWrap());\n\n eraseClones();\n\n Add->setHasNoUnsignedWrap();\n Sub->setHasNoUnsignedWrap();\n Mul->setHasNoUnsignedWrap();\n\n AddClone = this->clone(Add);\n SubClone = this->clone(Sub);\n MulClone = this->clone(Mul);\n\n EXPECT_TRUE(AddClone->hasNoUnsignedWrap());\n EXPECT_FALSE(AddClone->hasNoSignedWrap());\n EXPECT_TRUE(SubClone->hasNoUnsignedWrap());\n EXPECT_FALSE(SubClone->hasNoSignedWrap());\n EXPECT_TRUE(MulClone->hasNoUnsignedWrap());\n EXPECT_FALSE(MulClone->hasNoSignedWrap());\n\n eraseClones();\n\n Add->setHasNoSignedWrap();\n Sub->setHasNoSignedWrap();\n Mul->setHasNoSignedWrap();\n\n AddClone = this->clone(Add);\n SubClone = this->clone(Sub);\n MulClone = this->clone(Mul);\n\n EXPECT_TRUE(AddClone->hasNoUnsignedWrap());\n EXPECT_TRUE(AddClone->hasNoSignedWrap());\n EXPECT_TRUE(SubClone->hasNoUnsignedWrap());\n EXPECT_TRUE(SubClone->hasNoSignedWrap());\n EXPECT_TRUE(MulClone->hasNoUnsignedWrap());\n EXPECT_TRUE(MulClone->hasNoSignedWrap());\n\n eraseClones();\n\n Add->setHasNoUnsignedWrap(false);\n Sub->setHasNoUnsignedWrap(false);\n Mul->setHasNoUnsignedWrap(false);\n\n AddClone = this->clone(Add);\n SubClone = this->clone(Sub);\n MulClone = this->clone(Mul);\n\n EXPECT_FALSE(AddClone->hasNoUnsignedWrap());\n EXPECT_TRUE(AddClone->hasNoSignedWrap());\n EXPECT_FALSE(SubClone->hasNoUnsignedWrap());\n EXPECT_TRUE(SubClone->hasNoSignedWrap());\n EXPECT_FALSE(MulClone->hasNoUnsignedWrap());\n EXPECT_TRUE(MulClone->hasNoSignedWrap());\n}\n\nTEST_F(CloneInstruction, Inbounds) {\n V = new Argument(Type::getInt32PtrTy(context));\n\n Constant *Z = Constant::getNullValue(Type::getInt32Ty(context));\n std::vector<Value *> ops;\n ops.push_back(Z);\n GetElementPtrInst *GEP =\n GetElementPtrInst::Create(Type::getInt32Ty(context), V, ops);\n EXPECT_FALSE(this->clone(GEP)->isInBounds());\n\n GEP->setIsInBounds();\n EXPECT_TRUE(this->clone(GEP)->isInBounds());\n}\n\nTEST_F(CloneInstruction, Exact) {\n V = new Argument(Type::getInt32Ty(context));\n\n BinaryOperator *SDiv = BinaryOperator::Create(Instruction::SDiv, V, V);\n EXPECT_FALSE(this->clone(SDiv)->isExact());\n\n SDiv->setIsExact(true);\n EXPECT_TRUE(this->clone(SDiv)->isExact());\n}\n\nTEST_F(CloneInstruction, Attributes) {\n Type *ArgTy1[] = { Type::getInt32PtrTy(context) };\n FunctionType *FT1 = FunctionType::get(Type::getVoidTy(context), ArgTy1, false);\n\n Function *F1 = Function::Create(FT1, Function::ExternalLinkage);\n BasicBlock *BB = BasicBlock::Create(context, \"\", F1);\n IRBuilder<> Builder(BB);\n Builder.CreateRetVoid();\n\n Function *F2 = Function::Create(FT1, Function::ExternalLinkage);\n\n Attribute::AttrKind AK[] = { Attribute::NoCapture };\n AttributeSet AS = AttributeSet::get(context, 0, AK);\n Argument *A = F1->arg_begin();\n A->addAttr(AS);\n\n SmallVector<ReturnInst*, 4> Returns;\n ValueToValueMapTy VMap;\n VMap[A] = UndefValue::get(A->getType());\n\n CloneFunctionInto(F2, F1, VMap, false, Returns);\n EXPECT_FALSE(F2->arg_begin()->hasNoCaptureAttr());\n\n delete F1;\n delete F2;\n}\n\nTEST_F(CloneInstruction, CallingConvention) {\n Type *ArgTy1[] = { Type::getInt32PtrTy(context) };\n FunctionType *FT1 = FunctionType::get(Type::getVoidTy(context), ArgTy1, false);\n\n Function *F1 = Function::Create(FT1, Function::ExternalLinkage);\n F1->setCallingConv(CallingConv::Cold);\n BasicBlock *BB = BasicBlock::Create(context, \"\", F1);\n IRBuilder<> Builder(BB);\n Builder.CreateRetVoid();\n\n Function *F2 = Function::Create(FT1, Function::ExternalLinkage);\n\n SmallVector<ReturnInst*, 4> Returns;\n ValueToValueMapTy VMap;\n VMap[F1->arg_begin()] = F2->arg_begin();\n\n CloneFunctionInto(F2, F1, VMap, false, Returns);\n EXPECT_EQ(CallingConv::Cold, F2->getCallingConv());\n\n delete F1;\n delete F2;\n}\n\nclass CloneFunc : public ::testing::Test {\nprotected:\n virtual void SetUp() {\n SetupModule();\n CreateOldFunc();\n CreateNewFunc();\n SetupFinder();\n }\n\n virtual void TearDown() {\n delete Finder;\n }\n\n void SetupModule() {\n M = new Module(\"\", C);\n }\n\n void CreateOldFunc() {\n FunctionType* FuncType = FunctionType::get(Type::getVoidTy(C), false);\n OldFunc = Function::Create(FuncType, GlobalValue::PrivateLinkage, \"f\", M);\n CreateOldFunctionBodyAndDI();\n }\n\n void CreateOldFunctionBodyAndDI() {\n DIBuilder DBuilder(*M);\n IRBuilder<> IBuilder(C);\n\n \/\/ Function DI\n DIFile File = DBuilder.createFile(\"filename.c\", \"\/file\/dir\/\");\n DITypeArray ParamTypes = DBuilder.getOrCreateTypeArray(None);\n DICompositeType FuncType = DBuilder.createSubroutineType(File, ParamTypes);\n DICompileUnit CU = DBuilder.createCompileUnit(dwarf::DW_LANG_C99,\n \"filename.c\", \"\/file\/dir\", \"CloneFunc\", false, \"\", 0);\n\n DISubprogram Subprogram = DBuilder.createFunction(CU, \"f\", \"f\", File, 4,\n FuncType, true, true, 3, 0, false, OldFunc);\n\n \/\/ Function body\n BasicBlock* Entry = BasicBlock::Create(C, \"\", OldFunc);\n IBuilder.SetInsertPoint(Entry);\n DebugLoc Loc = DebugLoc::get(3, 2, Subprogram);\n IBuilder.SetCurrentDebugLocation(Loc);\n AllocaInst* Alloca = IBuilder.CreateAlloca(IntegerType::getInt32Ty(C));\n IBuilder.SetCurrentDebugLocation(DebugLoc::get(4, 2, Subprogram));\n Value* AllocaContent = IBuilder.getInt32(1);\n Instruction* Store = IBuilder.CreateStore(AllocaContent, Alloca);\n IBuilder.SetCurrentDebugLocation(DebugLoc::get(5, 2, Subprogram));\n Instruction* Terminator = IBuilder.CreateRetVoid();\n\n \/\/ Create a local variable around the alloca\n DIType IntType = DBuilder.createBasicType(\"int\", 32, 0,\n dwarf::DW_ATE_signed);\n DIExpression E = DBuilder.createExpression();\n DIVariable Variable = DBuilder.createLocalVariable(\n dwarf::DW_TAG_auto_variable, Subprogram, \"x\", File, 5, IntType, true);\n DBuilder.insertDeclare(Alloca, Variable, E, Store);\n DBuilder.insertDbgValueIntrinsic(AllocaContent, 0, Variable, E, Terminator);\n \/\/ Finalize the debug info\n DBuilder.finalize();\n\n\n \/\/ Create another, empty, compile unit\n DIBuilder DBuilder2(*M);\n DBuilder2.createCompileUnit(dwarf::DW_LANG_C99,\n \"extra.c\", \"\/file\/dir\", \"CloneFunc\", false, \"\", 0);\n DBuilder2.finalize();\n }\n\n void CreateNewFunc() {\n ValueToValueMapTy VMap;\n NewFunc = CloneFunction(OldFunc, VMap, true, nullptr);\n M->getFunctionList().push_back(NewFunc);\n }\n\n void SetupFinder() {\n Finder = new DebugInfoFinder();\n Finder->processModule(*M);\n }\n\n LLVMContext C;\n Function* OldFunc;\n Function* NewFunc;\n Module* M;\n DebugInfoFinder* Finder;\n};\n\n\/\/ Test that a new, distinct function was created.\nTEST_F(CloneFunc, NewFunctionCreated) {\n EXPECT_NE(OldFunc, NewFunc);\n}\n\n\/\/ Test that a new subprogram entry was added and is pointing to the new\n\/\/ function, while the original subprogram still points to the old one.\nTEST_F(CloneFunc, Subprogram) {\n unsigned SubprogramCount = Finder->subprogram_count();\n EXPECT_EQ(2U, SubprogramCount);\n\n auto Iter = Finder->subprograms().begin();\n DISubprogram Sub1(*Iter);\n EXPECT_TRUE(Sub1.Verify());\n Iter++;\n DISubprogram Sub2(*Iter);\n EXPECT_TRUE(Sub2.Verify());\n\n EXPECT_TRUE((Sub1.getFunction() == OldFunc && Sub2.getFunction() == NewFunc)\n || (Sub1.getFunction() == NewFunc && Sub2.getFunction() == OldFunc));\n}\n\n\/\/ Test that the new subprogram entry was not added to the CU which doesn't\n\/\/ contain the old subprogram entry.\nTEST_F(CloneFunc, SubprogramInRightCU) {\n EXPECT_EQ(2U, Finder->compile_unit_count());\n\n auto Iter = Finder->compile_units().begin();\n DICompileUnit CU1(*Iter);\n EXPECT_TRUE(CU1.Verify());\n Iter++;\n DICompileUnit CU2(*Iter);\n EXPECT_TRUE(CU2.Verify());\n EXPECT_TRUE(CU1.getSubprograms().getNumElements() == 0\n || CU2.getSubprograms().getNumElements() == 0);\n}\n\n\/\/ Test that instructions in the old function still belong to it in the\n\/\/ metadata, while instruction in the new function belong to the new one.\nTEST_F(CloneFunc, InstructionOwnership) {\n inst_iterator OldIter = inst_begin(OldFunc);\n inst_iterator OldEnd = inst_end(OldFunc);\n inst_iterator NewIter = inst_begin(NewFunc);\n inst_iterator NewEnd = inst_end(NewFunc);\n while (OldIter != OldEnd && NewIter != NewEnd) {\n Instruction& OldI = *OldIter;\n Instruction& NewI = *NewIter;\n EXPECT_NE(&OldI, &NewI);\n\n EXPECT_EQ(OldI.hasMetadata(), NewI.hasMetadata());\n if (OldI.hasMetadata()) {\n const DebugLoc& OldDL = OldI.getDebugLoc();\n const DebugLoc& NewDL = NewI.getDebugLoc();\n\n \/\/ Verify that the debug location data is the same\n EXPECT_EQ(OldDL.getLine(), NewDL.getLine());\n EXPECT_EQ(OldDL.getCol(), NewDL.getCol());\n\n \/\/ But that they belong to different functions\n DISubprogram OldSubprogram(OldDL.getScope());\n DISubprogram NewSubprogram(NewDL.getScope());\n EXPECT_TRUE(OldSubprogram.Verify());\n EXPECT_TRUE(NewSubprogram.Verify());\n EXPECT_EQ(OldFunc, OldSubprogram.getFunction());\n EXPECT_EQ(NewFunc, NewSubprogram.getFunction());\n }\n\n ++OldIter;\n ++NewIter;\n }\n EXPECT_EQ(OldEnd, OldIter);\n EXPECT_EQ(NewEnd, NewIter);\n}\n\n\/\/ Test that the arguments for debug intrinsics in the new function were\n\/\/ properly cloned\nTEST_F(CloneFunc, DebugIntrinsics) {\n inst_iterator OldIter = inst_begin(OldFunc);\n inst_iterator OldEnd = inst_end(OldFunc);\n inst_iterator NewIter = inst_begin(NewFunc);\n inst_iterator NewEnd = inst_end(NewFunc);\n while (OldIter != OldEnd && NewIter != NewEnd) {\n Instruction& OldI = *OldIter;\n Instruction& NewI = *NewIter;\n if (DbgDeclareInst* OldIntrin = dyn_cast<DbgDeclareInst>(&OldI)) {\n DbgDeclareInst* NewIntrin = dyn_cast<DbgDeclareInst>(&NewI);\n EXPECT_TRUE(NewIntrin);\n\n \/\/ Old address must belong to the old function\n EXPECT_EQ(OldFunc, cast<AllocaInst>(OldIntrin->getAddress())->\n getParent()->getParent());\n \/\/ New address must belong to the new function\n EXPECT_EQ(NewFunc, cast<AllocaInst>(NewIntrin->getAddress())->\n getParent()->getParent());\n\n \/\/ Old variable must belong to the old function\n EXPECT_EQ(OldFunc, DISubprogram(DIVariable(OldIntrin->getVariable())\n .getContext()).getFunction());\n \/\/ New variable must belong to the New function\n EXPECT_EQ(NewFunc, DISubprogram(DIVariable(NewIntrin->getVariable())\n .getContext()).getFunction());\n } else if (DbgValueInst* OldIntrin = dyn_cast<DbgValueInst>(&OldI)) {\n DbgValueInst* NewIntrin = dyn_cast<DbgValueInst>(&NewI);\n EXPECT_TRUE(NewIntrin);\n\n \/\/ Old variable must belong to the old function\n EXPECT_EQ(OldFunc, DISubprogram(DIVariable(OldIntrin->getVariable())\n .getContext()).getFunction());\n \/\/ New variable must belong to the New function\n EXPECT_EQ(NewFunc, DISubprogram(DIVariable(NewIntrin->getVariable())\n .getContext()).getFunction());\n }\n\n ++OldIter;\n ++NewIter;\n }\n}\n\n}\n<|endoftext|>"} {"text":"<commit_before><commit_msg>Blacklist the QPointerBase class.<commit_after><|endoftext|>"} {"text":"<commit_before><commit_msg>Added a place holder test for mobilab signal<commit_after><|endoftext|>"} {"text":"<commit_before><commit_msg>fixed assert<commit_after><|endoftext|>"} {"text":"<commit_before><commit_msg>INTEGRATION: CWS changefileheader (1.5.72); FILE MERGED 2008\/04\/01 16:02:19 thb 1.5.72.3: #i85898# Stripping all external header guards 2008\/04\/01 12:58:12 thb 1.5.72.2: #i85898# Stripping all external header guards 2008\/03\/31 15:30:22 rt 1.5.72.1: #i87441# Change license header to LPGL v3.<commit_after><|endoftext|>"} {"text":"<commit_before>#include \"QDisplayDataWidget.h\"\n#include \"ModifyObject.h\"\n#include \"QMonitorTableWidget.h\"\n\n\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{\nQDisplayDataWidget::QDisplayDataWidget(QWidget* parent,\n BaseData* data,\n const ModifyObjectFlags& flags):Q3GroupBox(parent),\n data_(data),\n datainfowidget_(NULL),\n datawidget_(NULL),\n numWidgets_(0)\n\n{\n if(data_ == NULL)\n {\n return;\n }\n\n setTitle(data_->getName().c_str());\n setInsideMargin(4);\n setInsideSpacing(2);\n\n const 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);\n numWidgets_ += datainfowidget_->getNumLines()\/3;\n\n }\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 std::string widget = data_->getWidget();\n\n if (widget.empty())\n datawidget_ = DataWidgetFactory::CreateAnyObject(dwarg);\n else\n datawidget_ = DataWidgetFactory::CreateObject(dwarg.data->getWidget(), dwarg);\n if (datawidget_ == NULL)\n {\n datawidget_ = new QDataSimpleEdit(this,data_->getName().c_str(), data_);\n datawidget_->createWidgets();\n datawidget_->setEnabled( !(data_->isReadOnly() && flags.READONLY_FLAG) );\n assert(datawidget_ != NULL);\n }\n\n setColumns(datawidget_->numColumnWidget());\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}\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 if( str.length() > TEXTSIZE_THRESHOLD )\n {\n innerWidget_.type = TEXTEDIT;\n innerWidget_.widget.textEdit = new QTextEdit(this->parentWidget());\n connect(innerWidget_.widget.textEdit , SIGNAL( textChanged() ), this, SLOT ( setWidgetDirty() ) );\n innerWidget_.widget.textEdit->setText(str);\n }\n else\n {\n innerWidget_.type = LINEEDIT;\n innerWidget_.widget.lineEdit = new QLineEdit(this->parentWidget());\n connect( innerWidget_.widget.lineEdit, SIGNAL(textChanged(const QString&)), this, SLOT( setWidgetDirty() ) );\n innerWidget_.widget.lineEdit->setText(str);\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}\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::TData<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>r7010\/sofa-dev : FIX: compilation <commit_after>#include \"QDisplayDataWidget.h\"\n#include \"ModifyObject.h\"\n\n\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{\nQDisplayDataWidget::QDisplayDataWidget(QWidget* parent,\n BaseData* data,\n const ModifyObjectFlags& flags):Q3GroupBox(parent),\n data_(data),\n datainfowidget_(NULL),\n datawidget_(NULL),\n numWidgets_(0)\n\n{\n if(data_ == NULL)\n {\n return;\n }\n\n setTitle(data_->getName().c_str());\n setInsideMargin(4);\n setInsideSpacing(2);\n\n const 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);\n numWidgets_ += datainfowidget_->getNumLines()\/3;\n\n }\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 std::string widget = data_->getWidget();\n\n if (widget.empty())\n datawidget_ = DataWidgetFactory::CreateAnyObject(dwarg);\n else\n datawidget_ = DataWidgetFactory::CreateObject(dwarg.data->getWidget(), dwarg);\n if (datawidget_ == NULL)\n {\n datawidget_ = new QDataSimpleEdit(this,data_->getName().c_str(), data_);\n datawidget_->createWidgets();\n datawidget_->setEnabled( !(data_->isReadOnly() && flags.READONLY_FLAG) );\n assert(datawidget_ != NULL);\n }\n\n setColumns(datawidget_->numColumnWidget());\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}\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 if( str.length() > TEXTSIZE_THRESHOLD )\n {\n innerWidget_.type = TEXTEDIT;\n innerWidget_.widget.textEdit = new QTextEdit(this->parentWidget());\n connect(innerWidget_.widget.textEdit , SIGNAL( textChanged() ), this, SLOT ( setWidgetDirty() ) );\n innerWidget_.widget.textEdit->setText(str);\n }\n else\n {\n innerWidget_.type = LINEEDIT;\n innerWidget_.widget.lineEdit = new QLineEdit(this->parentWidget());\n connect( innerWidget_.widget.lineEdit, SIGNAL(textChanged(const QString&)), this, SLOT( setWidgetDirty() ) );\n innerWidget_.widget.lineEdit->setText(str);\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}\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::TData<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) 2012 Lasath Fernando <kde@lasath.org>\n\n This library is free software; you can redistribute it and\/or\n modify it under the terms of the GNU Lesser General Public\n License as published by the Free Software Foundation; either\n version 2.1 of the License, or (at your option) any later version.\n\n This library is distributed in the hope that it will be useful,\n but WITHOUT ANY WARRANTY; without even the implied warranty of\n MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU\n Lesser General Public License for more details.\n\n You should have received a copy of the GNU Lesser General Public\n License along with this library; if not, write to the Free Software\n Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA\n*\/\n\n\n#include \"message.h\"\n\n#include <KDebug>\n#include <QSharedData>\n\n#include <TelepathyQt\/ContactManager>\n#include <TelepathyQt\/Connection>\n\n#include <TelepathyLoggerQt4\/Entity>\n\nusing namespace KTp;\n\nclass Message::Private : public QSharedData {\n\n public:\n Private() :\n isHistory(false)\n {};\n QDateTime sentTime;\n QString token;\n Tp::ChannelTextMessageType messageType;\n QVariantMap properties;\n QString mainPart;\n QStringList parts;\n QStringList scripts;\n bool isHistory;\n MessageDirection direction;\n};\n\nMessage::Message(const Tp::Message &original, const KTp::MessageContext &context) :\n d(new Private)\n{\n Q_UNUSED(context)\n d->sentTime = original.sent();\n d->token = original.messageToken();\n d->messageType = original.messageType();\n d->isHistory = false;\n d->direction = KTp::Message::LocalToRemote;\n setMainMessagePart(original.text());\n}\n\nMessage::Message(const Tp::ReceivedMessage &original, const KTp::MessageContext &context) :\n d(new Private)\n{\n Q_UNUSED(context)\n d->sentTime = original.sent();\n d->token = original.messageToken();\n d->messageType = original.messageType();\n d->isHistory = original.isScrollback();\n d->direction = KTp::Message::RemoteToLocal;\n\n setMainMessagePart(original.text());\n}\n\nMessage::Message(const Tpl::TextEventPtr &original, const KTp::MessageContext &context) :\n d(new Private)\n{\n d->sentTime = original->timestamp();\n d->token = original->messageToken();\n d->messageType = original->messageType();\n d->isHistory = true;\n\n if (original->sender()->identifier() == context.account()->normalizedName()) {\n d->direction = KTp::Message::LocalToRemote;\n } else {\n d->direction = KTp::Message::RemoteToLocal;\n }\n\n setMainMessagePart(original->message());\n}\n\nMessage::Message(const Message& other):\n d(other.d)\n{\n}\n\nMessage::~Message()\n{\n}\n\nQString Message::mainMessagePart() const\n{\n return d->mainPart;\n}\n\nvoid Message::setMainMessagePart(const QString& message)\n{\n d->mainPart = message;\n}\n\nvoid Message::appendMessagePart(const QString& part)\n{\n d->parts << part;\n}\n\nvoid Message::appendScript(const QString& script)\n{\n \/\/ Append the script only if it is not already appended to avoid multiple\n \/\/ execution of the scripts.\n if (!d->scripts.contains(script)) {\n d->scripts << script;\n }\n}\n\nQString Message::finalizedMessage() const\n{\n QString msg = d->mainPart + QLatin1String(\"\\n\") +\n d->parts.join(QLatin1String(\"\\n\"));\n\n\/\/ kDebug() << msg;\n return msg;\n}\n\nQString Message::finalizedScript() const\n{\n if (d->scripts.empty()) {\n return QString();\n }\n\n QString finalScript = d->scripts.join(QLatin1String(\"\"));\n\n if (!finalScript.isEmpty()) {\n finalScript.append(QLatin1String(\"false;\"));\n }\n\n\/\/ kDebug() << finalScript;\n return finalScript;\n}\n\nQVariant Message::property(const char *name) const\n{\n return d->properties[QLatin1String(name)];\n}\n\nvoid Message::setProperty(const char *name, const QVariant& value)\n{\n d->properties[QLatin1String(name)] = value;\n}\n\nQDateTime Message::time() const\n{\n return d->sentTime;\n}\n\nQString Message::token() const\n{\n return d->token;\n}\n\nTp::ChannelTextMessageType Message::type() const\n{\n return d->messageType;\n}\n\nint Message::partsSize() const\n{\n return d->parts.size();\n}\n\nbool Message::isHistory() const\n{\n return d->isHistory;\n}\n\nKTp::Message::MessageDirection Message::direction() const\n{\n return d->direction;\n}\n<commit_msg>Make message store sender<commit_after>\/*\n Copyright (C) 2012 Lasath Fernando <kde@lasath.org>\n\n This library is free software; you can redistribute it and\/or\n modify it under the terms of the GNU Lesser General Public\n License as published by the Free Software Foundation; either\n version 2.1 of the License, or (at your option) any later version.\n\n This library is distributed in the hope that it will be useful,\n but WITHOUT ANY WARRANTY; without even the implied warranty of\n MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU\n Lesser General Public License for more details.\n\n You should have received a copy of the GNU Lesser General Public\n License along with this library; if not, write to the Free Software\n Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA\n*\/\n\n\n#include \"message.h\"\n\n#include <KDebug>\n#include <QSharedData>\n\n#include <TelepathyQt\/ContactManager>\n#include <TelepathyQt\/Connection>\n\n#include <TelepathyLoggerQt4\/Entity>\n\nusing namespace KTp;\n\nclass Message::Private : public QSharedData {\n\n public:\n Private() :\n isHistory(false)\n {};\n QDateTime sentTime;\n QString token;\n Tp::ChannelTextMessageType messageType;\n QVariantMap properties;\n QString mainPart;\n QStringList parts;\n QStringList scripts;\n bool isHistory;\n MessageDirection direction;\n};\n\nMessage::Message(const Tp::Message &original, const KTp::MessageContext &context) :\n d(new Private)\n{\n Q_UNUSED(context)\n d->sentTime = original.sent();\n d->token = original.messageToken();\n d->messageType = original.messageType();\n d->isHistory = false;\n d->direction = KTp::Message::LocalToRemote;\n\n setMainMessagePart(original.text());\n\n setProperty(\"sender\", context.account()->nickname());\n setProperty(\"sender-avatar\", context.account()->avatar().avatarData);\n}\n\nMessage::Message(const Tp::ReceivedMessage &original, const KTp::MessageContext &context) :\n d(new Private)\n{\n Q_UNUSED(context)\n d->sentTime = original.sent();\n d->token = original.messageToken();\n d->messageType = original.messageType();\n d->isHistory = original.isScrollback();\n d->direction = KTp::Message::RemoteToLocal;\n\n setMainMessagePart(original.text());\n\n if (!original.sender().isNull()) {\n setProperty(\"sender\", original.sender()->alias());\n setProperty(\"sender-avatar\", original.sender()->avatarData().fileName);\n } else {\n setProperty(\"sender\", original.senderNickname());\n }\n}\n\nMessage::Message(const Tpl::TextEventPtr &original, const KTp::MessageContext &context) :\n d(new Private)\n{\n d->sentTime = original->timestamp();\n d->token = original->messageToken();\n d->messageType = original->messageType();\n d->isHistory = true;\n\n if (original->sender()->identifier() == context.account()->normalizedName()) {\n d->direction = KTp::Message::LocalToRemote;\n } else {\n d->direction = KTp::Message::RemoteToLocal;\n }\n\n setMainMessagePart(original->message());\n\n setProperty(\"sender\", original->sender()->alias());\n setProperty(\"sender-avatar\", original->sender()->avatarToken());\n}\n\nMessage::Message(const Message& other):\n d(other.d)\n{\n}\n\nMessage::~Message()\n{\n}\n\nQString Message::mainMessagePart() const\n{\n return d->mainPart;\n}\n\nvoid Message::setMainMessagePart(const QString& message)\n{\n d->mainPart = message;\n}\n\nvoid Message::appendMessagePart(const QString& part)\n{\n d->parts << part;\n}\n\nvoid Message::appendScript(const QString& script)\n{\n \/\/ Append the script only if it is not already appended to avoid multiple\n \/\/ execution of the scripts.\n if (!d->scripts.contains(script)) {\n d->scripts << script;\n }\n}\n\nQString Message::finalizedMessage() const\n{\n QString msg = d->mainPart + QLatin1String(\"\\n\") +\n d->parts.join(QLatin1String(\"\\n\"));\n\n\/\/ kDebug() << msg;\n return msg;\n}\n\nQString Message::finalizedScript() const\n{\n if (d->scripts.empty()) {\n return QString();\n }\n\n QString finalScript = d->scripts.join(QLatin1String(\"\"));\n\n if (!finalScript.isEmpty()) {\n finalScript.append(QLatin1String(\"false;\"));\n }\n\n\/\/ kDebug() << finalScript;\n return finalScript;\n}\n\nQVariant Message::property(const char *name) const\n{\n return d->properties[QLatin1String(name)];\n}\n\nvoid Message::setProperty(const char *name, const QVariant& value)\n{\n d->properties[QLatin1String(name)] = value;\n}\n\nQDateTime Message::time() const\n{\n return d->sentTime;\n}\n\nQString Message::token() const\n{\n return d->token;\n}\n\nTp::ChannelTextMessageType Message::type() const\n{\n return d->messageType;\n}\n\nint Message::partsSize() const\n{\n return d->parts.size();\n}\n\nbool Message::isHistory() const\n{\n return d->isHistory;\n}\n\nKTp::Message::MessageDirection Message::direction() const\n{\n return d->direction;\n}\n<|endoftext|>"} {"text":"<commit_before>#include \"filename\/filename-execution-visitor.h\"\n#include <QDateTime>\n#include <QJSEngine>\n#include <QJSValue>\n#include <QSet>\n#include <QSettings>\n#include <QSharedPointer>\n#include <QStringList>\n#include <QTimeZone>\n#include <QVariant>\n#include <algorithm>\n#include \"filename\/ast\/filename-node-condition-ignore.h\"\n#include \"filename\/ast\/filename-node-condition-tag.h\"\n#include \"filename\/ast\/filename-node-condition-token.h\"\n#include \"filename\/ast\/filename-node-conditional.h\"\n#include \"filename\/ast\/filename-node-javascript.h\"\n#include \"filename\/ast\/filename-node-root.h\"\n#include \"filename\/ast\/filename-node-text.h\"\n#include \"filename\/ast\/filename-node-variable.h\"\n#include \"filename\/filename-condition-visitor.h\"\n#include \"loader\/token.h\"\n#include \"logger.h\"\n#include \"models\/image.h\"\n\n\nFilenameExecutionVisitor::FilenameExecutionVisitor(const QMap<QString, Token> &tokens, QSettings *settings)\n\t: FilenameVisitorJavaScript(settings), m_tokens(tokens), m_settings(settings)\n{}\n\nvoid FilenameExecutionVisitor::setEscapeMethod(QString (*escapeMethod)(const QVariant &))\n{\n\tm_escapeMethod = escapeMethod;\n}\n\nvoid FilenameExecutionVisitor::setKeepInvalidTokens(bool keepInvalidTokens)\n{\n\tm_keepInvalidTokens = keepInvalidTokens;\n}\n\n\nQString FilenameExecutionVisitor::run(const FilenameNodeRoot &node)\n{\n\tm_result.clear();\n\n\tnode.accept(*this);\n\n\treturn m_result;\n}\n\n\nvoid FilenameExecutionVisitor::visit(const FilenameNodeConditional &node)\n{\n\tFilenameConditionVisitor conditionVisitor(m_tokens, m_settings);\n\tbool valid = conditionVisitor.run(*node.condition);\n\n\tif (valid && node.ifTrue != nullptr) {\n\t\tnode.ifTrue->accept(*this);\n\t} else if (!valid && node.ifFalse != nullptr) {\n\t\tnode.ifFalse->accept(*this);\n\t}\n}\n\nvoid FilenameExecutionVisitor::visit(const FilenameNodeConditionIgnore &node)\n{\n\tQ_UNUSED(node);\n\n\t\/\/ No-op\n}\n\nvoid FilenameExecutionVisitor::visit(const FilenameNodeConditionTag &node)\n{\n\tm_result += cleanVariable(node.tag.text());\n}\n\nvoid FilenameExecutionVisitor::visit(const FilenameNodeConditionToken &node)\n{\n\tvisitVariable(node.token);\n}\n\nvoid FilenameExecutionVisitor::visit(const FilenameNodeJavaScript &node)\n{\n\tQJSEngine engine;\n\tsetJavaScriptVariables(engine, m_tokens, engine.globalObject());\n\n\tQJSValue result = engine.evaluate(node.script);\n\tif (result.isError()) {\n\t\tlog(\"Error in Javascript evaluation:<br\/>\" + result.toString());\n\t\treturn;\n\t}\n\n\tm_result += result.toString();\n}\n\nvoid FilenameExecutionVisitor::visit(const FilenameNodeText &node)\n{\n\tm_result += node.text;\n}\n\nvoid FilenameExecutionVisitor::visit(const FilenameNodeVariable &node)\n{\n\tvisitVariable(node.name, node.opts);\n}\n\n\nvoid FilenameExecutionVisitor::visitVariable(const QString &fullName, const QMap<QString, QString> &options)\n{\n\t\/\/ Contexts \"obj.var\"\n\tbool found = true;\n\tQStringList var = fullName.split('.');\n\tQString name = var.takeFirst();\n\tQMap<QString, Token> context = m_tokens;\n\twhile (found && !var.isEmpty()) {\n\t\tif (context.contains(name)) {\n\t\t\tconst QVariant &val = context[name].value();\n\t\t\tif (val.canConvert<QMap<QString, Token>>()) {\n\t\t\t\tcontext = val.value<QMap<QString, Token>>();\n\t\t\t\tname = var.takeFirst();\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t\tbreak;\n\t\t}\n\t\tfound = false;\n\t}\n\n\t\/\/ Variable not found\n\tif (!found || !context.contains(name)) {\n\t\tstatic const QSet<QString> keptTokens { \"path\", \"num\" };\n\t\tif (m_keepInvalidTokens || keptTokens.contains(name)) {\n\t\t\tQString strOpts;\n\t\t\tfor (auto it = options.constBegin(); it != options.constEnd(); ++it) {\n\t\t\t\tstrOpts += it.key();\n\t\t\t\tif (!it.value().isEmpty()) {\n\t\t\t\t\tstrOpts += \"=\" + it.value();\n\t\t\t\t}\n\t\t\t}\n\t\t\tm_result += \"%\" + name + (!strOpts.isEmpty() ? \":\" + strOpts : \"\") + \"%\"; \/\/ FIXME: get original value\/proper toString()\n\t\t}\n\t\treturn;\n\t}\n\n\tQVariant val = context[name].value();\n\tQString res;\n\tbool clean = false;\n\n\t\/\/ Convert value to a basic string using the given options\n\tif (val.type() == QVariant::DateTime) {\n\t\tres = variableToString(name, val.toDateTime(), options);\n\t} else if (val.type() == QVariant::ULongLong) {\n\t\tres = variableToString(name, val.toULongLong(), options);\n\t} else if (val.type() == QVariant::LongLong) {\n\t\tres = variableToString(name, val.toLongLong(), options);\n\t} else if (val.type() == QVariant::UInt) {\n\t\tres = variableToString(name, val.toUInt(), options);\n\t} else if (val.type() == QVariant::Int) {\n\t\tres = variableToString(name, val.toInt(), options);\n\t} else if (val.type() == QVariant::StringList) {\n\t\tres = variableToString(name, val.toStringList(), options);\n\t\tclean = true;\n\t} else {\n\t\tres = val.toString();\n\t}\n\n\t\/\/ String options\n\tif (options.contains(\"maxlength\")) {\n\t\tres = res.left(options[\"maxlength\"].toInt());\n\t}\n\tif (options.contains(\"htmlescape\")) {\n\t\tres = res.toHtmlEscaped();\n\t}\n\n\t\/\/ Forbidden characters and spaces replacement settings\n\tif (name != \"allo\" && !name.startsWith(\"url_\") && name != \"filename\" && name != \"directory\" && name != \"old_filename\" && name != \"old_directory\" && !clean) {\n\t\tres = cleanVariable(res, options);\n\t}\n\n\t\/\/ Escape if necessary\n\tif (m_escapeMethod != nullptr && options.contains(\"escape\")) {\n\t\tres = m_escapeMethod(res);\n\t}\n\n\tm_result += res;\n}\n\nQString FilenameExecutionVisitor::variableToString(const QString &name, QDateTime val, const QMap<QString, QString> &options)\n{\n\tQ_UNUSED(name);\n\n\tconst QString timeZone = options.value(\"timezone\", \"\");\n\tif (!timeZone.isEmpty() && timeZone != QLatin1String(\"server\")) {\n\t\tif (timeZone == QLatin1String(\"local\")) {\n\t\t\tval = val.toLocalTime();\n\t\t} else {\n\t\t\tQTimeZone tz(timeZone.toLatin1());\n\t\t\tif (tz.isValid()) {\n\t\t\t\tval = val.toTimeZone(tz);\n\t\t\t} else {\n\t\t\t\tlog(QString(\"Unknown timeZone '%1'\").arg(timeZone), Logger::Error);\n\t\t\t}\n\t\t}\n\t}\n\n\tconst QString format = options.value(\"format\", \"MM-dd-yyyy HH.mm\");\n\treturn val.toString(format);\n}\n\ntemplate <typename T>\nQString FilenameExecutionVisitor::variableToString(const QString &name, T val, const QMap<QString, QString> &options)\n{\n\tQ_UNUSED(name);\n\n\treturn options.contains(\"length\")\n\t\t? QString(\"%1\").arg(val, options[\"length\"].toInt(), 10, QChar('0'))\n\t\t: QString::number(val);\n}\n\nQString FilenameExecutionVisitor::variableToString(const QString &name, QStringList val, const QMap<QString, QString> &options)\n{\n\t\/\/ Count\n\tif (options.contains(\"count\")) {\n\t\treturn variableToString(name, val.count(), options);\n\t}\n\n\t\/\/ Namespaces\n\tbool ignoreNamespace = options.contains(\"ignorenamespace\");\n\tbool includeNamespace = options.contains(\"includenamespace\");\n\tif (ignoreNamespace || includeNamespace) {\n\t\tQStringList namespaces = m_tokens[\"all_namespaces\"].value().toStringList();\n\n\t\tif (options.contains(\"ignorenamespace\")) {\n\t\t\tQStringList ignored = options[\"ignorenamespace\"].split(' ');\n\t\t\tQStringList filtered, filteredNamespaces;\n\t\t\tfor (int i = 0; i < val.count(); ++i) {\n\t\t\t\tconst QString &nspace = name == \"all\" ? namespaces[i] : name;\n\t\t\t\tif (!ignored.contains(nspace)) {\n\t\t\t\t\tfiltered.append(val[i]);\n\t\t\t\t\tfilteredNamespaces.append(namespaces[i]);\n\t\t\t\t}\n\t\t\t}\n\t\t\tval = filtered;\n\t\t\tnamespaces = filteredNamespaces;\n\t\t}\n\t\tif (options.contains(\"includenamespace\")) {\n\t\t\tQStringList excluded;\n\t\t\tif (options.contains(\"excludenamespace\")) {\n\t\t\t\texcluded = options[\"excludenamespace\"].split(' ');\n\t\t\t}\n\n\t\t\tQStringList namespaced;\n\t\t\tfor (int i = 0; i < val.count(); ++i) {\n\t\t\t\tconst QString nspace = name == \"all\" ? namespaces[i] : name;\n\t\t\t\tnamespaced.append((!excluded.contains(nspace) ? nspace + \":\" : QString()) + val[i]);\n\t\t\t}\n\t\t\tval = namespaced;\n\t\t}\n\t}\n\n\tif (options.contains(\"sort\")) {\n\t\tstd::sort(val.begin(), val.end());\n\t}\n\n\t\/\/ Clean each value separately\n\tif (!name.startsWith(\"source\")) {\n\t\tfor (QString &t : val) {\n\t\t\tt = cleanVariable(t, options);\n\t\t}\n\t}\n\n\t\/\/ Separator\n\tQString mainSeparator = m_settings->value(\"Save\/separator\", \" \").toString();\n\tQString tagSeparator = m_settings->value(\"Save\/\" + name + \"_sep\", mainSeparator).toString();\n\tQString separator = options.value(\"separator\", tagSeparator);\n\tseparator.replace(\"\\\\n\", \"\\n\").replace(\"\\\\r\", \"\\r\");\n\n\treturn val.join(separator);\n}\n\n\nQString FilenameExecutionVisitor::cleanVariable(QString res, const QMap<QString, QString> &options) const\n{\n\t\/\/ Forbidden characters\n\tif (!options.contains(\"unsafe\")) {\n\t\tres = res.replace(\"\\\\\", \"_\").replace(\"%\", \"_\").replace(\"\/\", \"_\").replace(\":\", \"_\").replace(\"|\", \"_\").replace(\"*\", \"_\").replace(\"?\", \"_\").replace(\"\\\"\", \"_\").replace(\"<\", \"_\").replace(\">\", \"_\").replace(\"__\", \"_\").replace(\"__\", \"_\").replace(\"__\", \"_\").trimmed();\n\t}\n\n\t\/\/ Replace underscores by spaces\n\tif (!options.contains(\"underscores\") && (!m_settings->value(\"Save\/replaceblanks\", false).toBool() || options.contains(\"spaces\"))) {\n\t\tres = res.replace(\"_\", \" \");\n\t}\n\n\treturn res;\n}\n<commit_msg>Add explicit template instantiation for variableToString<T><commit_after>#include \"filename\/filename-execution-visitor.h\"\n#include <QDateTime>\n#include <QJSEngine>\n#include <QJSValue>\n#include <QSet>\n#include <QSettings>\n#include <QSharedPointer>\n#include <QStringList>\n#include <QTimeZone>\n#include <QVariant>\n#include <algorithm>\n#include \"filename\/ast\/filename-node-condition-ignore.h\"\n#include \"filename\/ast\/filename-node-condition-tag.h\"\n#include \"filename\/ast\/filename-node-condition-token.h\"\n#include \"filename\/ast\/filename-node-conditional.h\"\n#include \"filename\/ast\/filename-node-javascript.h\"\n#include \"filename\/ast\/filename-node-root.h\"\n#include \"filename\/ast\/filename-node-text.h\"\n#include \"filename\/ast\/filename-node-variable.h\"\n#include \"filename\/filename-condition-visitor.h\"\n#include \"loader\/token.h\"\n#include \"logger.h\"\n#include \"models\/image.h\"\n\n\nFilenameExecutionVisitor::FilenameExecutionVisitor(const QMap<QString, Token> &tokens, QSettings *settings)\n\t: FilenameVisitorJavaScript(settings), m_tokens(tokens), m_settings(settings)\n{}\n\nvoid FilenameExecutionVisitor::setEscapeMethod(QString (*escapeMethod)(const QVariant &))\n{\n\tm_escapeMethod = escapeMethod;\n}\n\nvoid FilenameExecutionVisitor::setKeepInvalidTokens(bool keepInvalidTokens)\n{\n\tm_keepInvalidTokens = keepInvalidTokens;\n}\n\n\nQString FilenameExecutionVisitor::run(const FilenameNodeRoot &node)\n{\n\tm_result.clear();\n\n\tnode.accept(*this);\n\n\treturn m_result;\n}\n\n\nvoid FilenameExecutionVisitor::visit(const FilenameNodeConditional &node)\n{\n\tFilenameConditionVisitor conditionVisitor(m_tokens, m_settings);\n\tbool valid = conditionVisitor.run(*node.condition);\n\n\tif (valid && node.ifTrue != nullptr) {\n\t\tnode.ifTrue->accept(*this);\n\t} else if (!valid && node.ifFalse != nullptr) {\n\t\tnode.ifFalse->accept(*this);\n\t}\n}\n\nvoid FilenameExecutionVisitor::visit(const FilenameNodeConditionIgnore &node)\n{\n\tQ_UNUSED(node);\n\n\t\/\/ No-op\n}\n\nvoid FilenameExecutionVisitor::visit(const FilenameNodeConditionTag &node)\n{\n\tm_result += cleanVariable(node.tag.text());\n}\n\nvoid FilenameExecutionVisitor::visit(const FilenameNodeConditionToken &node)\n{\n\tvisitVariable(node.token);\n}\n\nvoid FilenameExecutionVisitor::visit(const FilenameNodeJavaScript &node)\n{\n\tQJSEngine engine;\n\tsetJavaScriptVariables(engine, m_tokens, engine.globalObject());\n\n\tQJSValue result = engine.evaluate(node.script);\n\tif (result.isError()) {\n\t\tlog(\"Error in Javascript evaluation:<br\/>\" + result.toString());\n\t\treturn;\n\t}\n\n\tm_result += result.toString();\n}\n\nvoid FilenameExecutionVisitor::visit(const FilenameNodeText &node)\n{\n\tm_result += node.text;\n}\n\nvoid FilenameExecutionVisitor::visit(const FilenameNodeVariable &node)\n{\n\tvisitVariable(node.name, node.opts);\n}\n\n\nvoid FilenameExecutionVisitor::visitVariable(const QString &fullName, const QMap<QString, QString> &options)\n{\n\t\/\/ Contexts \"obj.var\"\n\tbool found = true;\n\tQStringList var = fullName.split('.');\n\tQString name = var.takeFirst();\n\tQMap<QString, Token> context = m_tokens;\n\twhile (found && !var.isEmpty()) {\n\t\tif (context.contains(name)) {\n\t\t\tconst QVariant &val = context[name].value();\n\t\t\tif (val.canConvert<QMap<QString, Token>>()) {\n\t\t\t\tcontext = val.value<QMap<QString, Token>>();\n\t\t\t\tname = var.takeFirst();\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t\tbreak;\n\t\t}\n\t\tfound = false;\n\t}\n\n\t\/\/ Variable not found\n\tif (!found || !context.contains(name)) {\n\t\tstatic const QSet<QString> keptTokens { \"path\", \"num\" };\n\t\tif (m_keepInvalidTokens || keptTokens.contains(name)) {\n\t\t\tQString strOpts;\n\t\t\tfor (auto it = options.constBegin(); it != options.constEnd(); ++it) {\n\t\t\t\tstrOpts += it.key();\n\t\t\t\tif (!it.value().isEmpty()) {\n\t\t\t\t\tstrOpts += \"=\" + it.value();\n\t\t\t\t}\n\t\t\t}\n\t\t\tm_result += \"%\" + name + (!strOpts.isEmpty() ? \":\" + strOpts : \"\") + \"%\"; \/\/ FIXME: get original value\/proper toString()\n\t\t}\n\t\treturn;\n\t}\n\n\tQVariant val = context[name].value();\n\tQString res;\n\tbool clean = false;\n\n\t\/\/ Convert value to a basic string using the given options\n\tif (val.type() == QVariant::DateTime) {\n\t\tres = variableToString(name, val.toDateTime(), options);\n\t} else if (val.type() == QVariant::ULongLong) {\n\t\tres = variableToString(name, val.toULongLong(), options);\n\t} else if (val.type() == QVariant::LongLong) {\n\t\tres = variableToString(name, val.toLongLong(), options);\n\t} else if (val.type() == QVariant::UInt) {\n\t\tres = variableToString(name, val.toUInt(), options);\n\t} else if (val.type() == QVariant::Int) {\n\t\tres = variableToString(name, val.toInt(), options);\n\t} else if (val.type() == QVariant::StringList) {\n\t\tres = variableToString(name, val.toStringList(), options);\n\t\tclean = true;\n\t} else {\n\t\tres = val.toString();\n\t}\n\n\t\/\/ String options\n\tif (options.contains(\"maxlength\")) {\n\t\tres = res.left(options[\"maxlength\"].toInt());\n\t}\n\tif (options.contains(\"htmlescape\")) {\n\t\tres = res.toHtmlEscaped();\n\t}\n\n\t\/\/ Forbidden characters and spaces replacement settings\n\tif (name != \"allo\" && !name.startsWith(\"url_\") && name != \"filename\" && name != \"directory\" && name != \"old_filename\" && name != \"old_directory\" && !clean) {\n\t\tres = cleanVariable(res, options);\n\t}\n\n\t\/\/ Escape if necessary\n\tif (m_escapeMethod != nullptr && options.contains(\"escape\")) {\n\t\tres = m_escapeMethod(res);\n\t}\n\n\tm_result += res;\n}\n\nQString FilenameExecutionVisitor::variableToString(const QString &name, QDateTime val, const QMap<QString, QString> &options)\n{\n\tQ_UNUSED(name);\n\n\tconst QString timeZone = options.value(\"timezone\", \"\");\n\tif (!timeZone.isEmpty() && timeZone != QLatin1String(\"server\")) {\n\t\tif (timeZone == QLatin1String(\"local\")) {\n\t\t\tval = val.toLocalTime();\n\t\t} else {\n\t\t\tQTimeZone tz(timeZone.toLatin1());\n\t\t\tif (tz.isValid()) {\n\t\t\t\tval = val.toTimeZone(tz);\n\t\t\t} else {\n\t\t\t\tlog(QString(\"Unknown timeZone '%1'\").arg(timeZone), Logger::Error);\n\t\t\t}\n\t\t}\n\t}\n\n\tconst QString format = options.value(\"format\", \"MM-dd-yyyy HH.mm\");\n\treturn val.toString(format);\n}\n\ntemplate <typename T>\nQString FilenameExecutionVisitor::variableToString(const QString &name, T val, const QMap<QString, QString> &options)\n{\n\tQ_UNUSED(name);\n\n\treturn options.contains(\"length\")\n\t\t? QString(\"%1\").arg(val, options[\"length\"].toInt(), 10, QChar('0'))\n\t\t: QString::number(val);\n}\ntemplate QString FilenameExecutionVisitor::variableToString<int>(const QString &name, int val, const QMap<QString, QString> &options);\ntemplate QString FilenameExecutionVisitor::variableToString<uint>(const QString &name, uint val, const QMap<QString, QString> &options);\ntemplate QString FilenameExecutionVisitor::variableToString<qlonglong>(const QString &name, qlonglong val, const QMap<QString, QString> &options);\ntemplate QString FilenameExecutionVisitor::variableToString<qulonglong>(const QString &name, qulonglong val, const QMap<QString, QString> &options);\n\nQString FilenameExecutionVisitor::variableToString(const QString &name, QStringList val, const QMap<QString, QString> &options)\n{\n\t\/\/ Count\n\tif (options.contains(\"count\")) {\n\t\treturn variableToString(name, val.count(), options);\n\t}\n\n\t\/\/ Namespaces\n\tbool ignoreNamespace = options.contains(\"ignorenamespace\");\n\tbool includeNamespace = options.contains(\"includenamespace\");\n\tif (ignoreNamespace || includeNamespace) {\n\t\tQStringList namespaces = m_tokens[\"all_namespaces\"].value().toStringList();\n\n\t\tif (options.contains(\"ignorenamespace\")) {\n\t\t\tQStringList ignored = options[\"ignorenamespace\"].split(' ');\n\t\t\tQStringList filtered, filteredNamespaces;\n\t\t\tfor (int i = 0; i < val.count(); ++i) {\n\t\t\t\tconst QString &nspace = name == \"all\" ? namespaces[i] : name;\n\t\t\t\tif (!ignored.contains(nspace)) {\n\t\t\t\t\tfiltered.append(val[i]);\n\t\t\t\t\tfilteredNamespaces.append(namespaces[i]);\n\t\t\t\t}\n\t\t\t}\n\t\t\tval = filtered;\n\t\t\tnamespaces = filteredNamespaces;\n\t\t}\n\t\tif (options.contains(\"includenamespace\")) {\n\t\t\tQStringList excluded;\n\t\t\tif (options.contains(\"excludenamespace\")) {\n\t\t\t\texcluded = options[\"excludenamespace\"].split(' ');\n\t\t\t}\n\n\t\t\tQStringList namespaced;\n\t\t\tfor (int i = 0; i < val.count(); ++i) {\n\t\t\t\tconst QString nspace = name == \"all\" ? namespaces[i] : name;\n\t\t\t\tnamespaced.append((!excluded.contains(nspace) ? nspace + \":\" : QString()) + val[i]);\n\t\t\t}\n\t\t\tval = namespaced;\n\t\t}\n\t}\n\n\tif (options.contains(\"sort\")) {\n\t\tstd::sort(val.begin(), val.end());\n\t}\n\n\t\/\/ Clean each value separately\n\tif (!name.startsWith(\"source\")) {\n\t\tfor (QString &t : val) {\n\t\t\tt = cleanVariable(t, options);\n\t\t}\n\t}\n\n\t\/\/ Separator\n\tQString mainSeparator = m_settings->value(\"Save\/separator\", \" \").toString();\n\tQString tagSeparator = m_settings->value(\"Save\/\" + name + \"_sep\", mainSeparator).toString();\n\tQString separator = options.value(\"separator\", tagSeparator);\n\tseparator.replace(\"\\\\n\", \"\\n\").replace(\"\\\\r\", \"\\r\");\n\n\treturn val.join(separator);\n}\n\n\nQString FilenameExecutionVisitor::cleanVariable(QString res, const QMap<QString, QString> &options) const\n{\n\t\/\/ Forbidden characters\n\tif (!options.contains(\"unsafe\")) {\n\t\tres = res.replace(\"\\\\\", \"_\").replace(\"%\", \"_\").replace(\"\/\", \"_\").replace(\":\", \"_\").replace(\"|\", \"_\").replace(\"*\", \"_\").replace(\"?\", \"_\").replace(\"\\\"\", \"_\").replace(\"<\", \"_\").replace(\">\", \"_\").replace(\"__\", \"_\").replace(\"__\", \"_\").replace(\"__\", \"_\").trimmed();\n\t}\n\n\t\/\/ Replace underscores by spaces\n\tif (!options.contains(\"underscores\") && (!m_settings->value(\"Save\/replaceblanks\", false).toBool() || options.contains(\"spaces\"))) {\n\t\tres = res.replace(\"_\", \" \");\n\t}\n\n\treturn res;\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#include \"qlandmarkabstractrequest.h\"\n#include \"qlandmarkabstractrequest_p.h\"\n#include \"qlandmarkmanagerengine.h\"\n#include \"qlandmarkmanager_p.h\"\n#include <QDebug>\n#include <QMutexLocker>\n\nQTM_USE_NAMESPACE\n\nQLandmarkAbstractRequestPrivate::QLandmarkAbstractRequestPrivate(QLandmarkManager *mgr)\n : type(QLandmarkAbstractRequest::InvalidRequest),\n state(QLandmarkAbstractRequest::InactiveState),\n error(QLandmarkManager::NoError),\n errorString(QString()),\n manager(mgr)\n{\n}\n\n\/*!\n \\class QLandmarkAbstractRequest\n \\brief The QLandmarkAbstractRequest class provides the interface\n from which all asynchronous request classes inherit.\n\n\n \\inmodule QtLocation\n\n \\ingroup landmarks-request\n\n It allows a client to asynchronously request some functionality of a\n particular QLandmarkManager. Instances of the class will emit signals when\n the state of the request changes, or when more results become available.\n\n Clients should not attempt to create instances of this class directly, but\n should instead use the use-case-specific classes derived from this class.\n\n All such request classes have a similar interface: clients set the\n parameters of the asynchronous call, then call the start() slot of the request. The manager\n will then enqueue or begin to process the request, at which point the\n request's state will transition from the \\c InactiveState to \\c ActiveState.\n After any state transition, the request will emit the stateChanged()\n signal. The manager may (if it supports it)\n periodically update the request with results, at\n which point the request will emit the resultsAvailable() signal. These\n results are not guaranteed to have a stable ordering. Error information is\n considered a result, so some requests will emit the resultsAvailable()\n signal even if no results are possible from the request (for example, a\n landmark remove request) when the manager updates the request with\n information about any errors which may have occurred.\n\n Clients can choose which signals they wish to handle from a request. If the\n client is not interested in interim results, they can choose to handle only\n the stateChanged() signal, and in the slot to which that signal is\n connected, check whether the state has changed to the \\c FinishedState\n (which signifies that the manager has finished handling the request, and\n that the request will not be updated with any more results). If the client\n is not interested in any results (including error information), they may\n choose to delete the request after calling \\l start(), or simply may not\n connect the the request's signals to any slots. (Please see the note\n below if you are working on Symbian with QtMobility 1.1.0)\n\n If the request is allocated via operator new, the client must delete the\n request when they are no longer using it in order to avoid leaking memory.\n That is, the client retains ownership of the request.\n\n The client may delete a heap-allocated request in various ways: by deleting\n it directly (but not within a slot connected to a signal emitted by the\n request), or by using the deleteLater() slot to schedule the request for\n deletion when control returns to the event loop (from within a slot\n connected to a signal emitted by the request, for example \\l\n stateChanged()).\n\n An active request may be deleted by the client, but the client will\n not receive notifications about whether the request succeeded or not,\n nor the results of the request.\n\n Because clients retain ownership of any request object, and may delete a\n request object at any time, the manager engine, implementers must be\n careful to ensue that they do not assume that a request has not been\n deleted at some time point during processing of a request, particularly\n if the engine has a multithreaded implementation.\n*\/\n\nQLandmarkAbstractRequestPrivate::~QLandmarkAbstractRequestPrivate()\n{\n}\n\nvoid QLandmarkAbstractRequestPrivate::notifyEngine(QLandmarkAbstractRequest* request)\n{\n Q_ASSERT(request);\n QLandmarkAbstractRequestPrivate* d = request->d_ptr;\n if (d) {\n QMutexLocker ml(&d->mutex);\n QLandmarkManagerEngine *engine = QLandmarkManagerPrivate::getEngine(d->manager);\n ml.unlock();\n if (engine) {\n engine->requestDestroyed(request);\n }\n }\n}\n\n\/*!\n \\enum QLandmarkAbstractRequest::RequestType\n Defines the possible types of asynchronous requests.\n \\value InvalidRequest An invalid request\n \\value LandmarkIdFetchRequest A request to fetch a list of landmark\n identifiers.\n \\value CategoryIdFetchRequest A request to fetch a list of catgory\n identifiers.\n\n \\value LandmarkFetchRequest A request to fetch a list of landmarks\n \\value LandmarkFetchByIdRequest A request to fetch a list of landmarks by id.\n \\value CategoryFetchRequest A request to fetch a list of categories\n \\value CategoryFetchByIdRequest A request to fetch a list of categories by id\n \\value LandmarkSaveRequest A request to save a list of landmarks.\n \\value LandmarkRemoveRequest A request to remove a list of landmarks.\n \\value CategorySaveRequest A request to save a list of categories.\n \\value CategoryRemoveRequest A request to remove a list of categories.\n \\value ImportRequest A request import landmarks.\n \\value ExportRequest A request export landmarks.\n*\/\n\n\/*!\n \\enum QLandmarkAbstractRequest::State\n Defines the possible states of asynchronous requests.\n \\value InactiveState Operation not yet started.\n \\value ActiveState Operation started, not yet finished.\n \\value FinishedState Operation completed. (Can be mean either successful or\n unsuccessful completion).\n*\/\n\n\/*!\n Constructs a new, invalid asynchronous request with the given \\a manager and \\a parent.\n*\/\nQLandmarkAbstractRequest::QLandmarkAbstractRequest(QLandmarkManager *manager, QObject *parent)\n : QObject(parent),\n d_ptr(new QLandmarkAbstractRequestPrivate(manager))\n{\n}\n\n\/*!\n \\internal\n*\/\nQLandmarkAbstractRequest::QLandmarkAbstractRequest(QLandmarkAbstractRequestPrivate *dd, QObject *parent)\n : QObject(parent),\n d_ptr(dd)\n{\n}\n\n\/*!\n Destroys the asynchronous request. Because the request object is effectiely a handle to a\n request operation, the operation may continue or it may just be canceled, depending upon\n the enine implementation, even though the request itself has been destroyed.\n The sqlite engine continues the operation behind the scenes if the\n request is destroyed whilst active. For the symbian engine see the note below.\n*\/\nQLandmarkAbstractRequest::~QLandmarkAbstractRequest()\n{\n QLandmarkAbstractRequestPrivate::notifyEngine(this);\n delete d_ptr;\n}\n\n\/*!\n Returns the type of this asynchronous request.\n*\/\nQLandmarkAbstractRequest::RequestType QLandmarkAbstractRequest::type() const\n{\n QMutexLocker ml(&d_ptr->mutex);\n return d_ptr->type;\n}\n\n\/*!\n Returns the state of the request\n*\/\nQLandmarkAbstractRequest::State QLandmarkAbstractRequest::state()\n{\n QMutexLocker ml(&d_ptr->mutex);\n return d_ptr->state;\n}\n\n\/*!\n Returns true if the request is in the \\c QLandmarkAbstractRequest::Inactive state;\n otherwise, returns false.\n \\sa state()\n*\/\nbool QLandmarkAbstractRequest::isInactive() const\n{\n QMutexLocker ml(&d_ptr->mutex);\n return d_ptr->state == QLandmarkAbstractRequest::InactiveState;\n}\n\n\/*!\n Returns true if the request is in the \\c QLandmarkAbstractRequest::Active state;\n otherwise, returns false.\n \\sa state()\n*\/\nbool QLandmarkAbstractRequest::isActive() const\n{\n QMutexLocker ml(&d_ptr->mutex);\n return d_ptr->state == QLandmarkAbstractRequest::ActiveState;\n}\n\n\/*!\n Returns true if the request is in the \\c QLandmarkAbstractRequest::Finished state;\n otherwise, returns false.\n \\sa state()\n*\/\nbool QLandmarkAbstractRequest::isFinished() const\n{\n QMutexLocker ml(&d_ptr->mutex);\n return d_ptr->state == QLandmarkAbstractRequest::FinishedState;\n}\n\n\/*!\n Returns the overall error of the most recent asynchronous operation.\n \\sa errorString()\n*\/\nQLandmarkManager::Error QLandmarkAbstractRequest::error() const\n{\n QMutexLocker ml(&d_ptr->mutex);\n return d_ptr->error;\n}\n\n\/*!\n Returns a human readable string of the last error\n that occurred. This error string is intended to be used\n by developers only and should not be seen by end users.\n \\sa error()\n*\/\nQString QLandmarkAbstractRequest::errorString() const\n{\n QMutexLocker ml(&d_ptr->mutex);\n return d_ptr->errorString;\n}\n\n\/*!\n Returns a pointer to the landmark manager which\n this request operates on.\n*\/\nQLandmarkManager *QLandmarkAbstractRequest::manager() const\n{\n QMutexLocker ml(&d_ptr->mutex);\n return d_ptr->manager;\n}\n\n\/*!\n Sets the \\a manager which this request operates on.\n\n Note that if a NULL manager is set, the functions\n start(), cancel() and waitForFinished() will return false and\n error will be set to QLandmarkManager::InvalidManagerError.\n\n A manager cannot be assigned while the request is in the\n QLandmarkAbstractRequest::ActiveState.\n*\/\nvoid QLandmarkAbstractRequest::setManager(QLandmarkManager *manager)\n{\n QMutexLocker ml(&d_ptr->mutex);\n if (d_ptr->state == QLandmarkAbstractRequest::ActiveState && d_ptr->manager)\n return;\n d_ptr->manager = manager;\n}\n\n\/*!\n Attempts to start the request.\n\n Returns true if the request was started, otherwise false. Trying to start a\n request that is already active returns false.\n \\sa cancel().\n*\/\nbool QLandmarkAbstractRequest::start()\n{\n QMutexLocker ml(&d_ptr->mutex);\n if (!d_ptr->manager) {\n d_ptr->error = QLandmarkManager::BadArgumentError;\n d_ptr->errorString = \"No manager assigned to landmark request object\";\n qWarning() << d_ptr->errorString;\n return false;\n }\n QLandmarkManagerEngine *engine = d_ptr->manager->engine();\n if (!engine) {\n d_ptr->error = QLandmarkManager::InvalidManagerError;\n d_ptr->errorString = \"The manager is invalid\";\n return false;\n }\n\n if (d_ptr->state != QLandmarkAbstractRequest::ActiveState) {\n ml.unlock();\n return engine->startRequest(this);\n }\n else {\n return false;\n }\n}\n\n\/*!\n Notifies the request that it should be canceled.\n\n Returns true if the request was successfully notified\n that it should be canceled. The request may or may not honor\n the cancel notification. Returns false if the notification\n could not be made or the request is not in the\n QLandmarkManager::Active state.\n\n \\sa start()\n*\/\nbool QLandmarkAbstractRequest::cancel()\n{\n QMutexLocker ml(&d_ptr->mutex);\n if (!d_ptr->manager) {\n d_ptr->error = QLandmarkManager::BadArgumentError;\n d_ptr->errorString = \"No manager assigned to landmark request object\";\n qWarning() << d_ptr->errorString;\n return false;\n }\n QLandmarkManagerEngine *engine = d_ptr->manager->engine();\n\n if(d_ptr->state == QLandmarkAbstractRequest::ActiveState) {\n ml.unlock();\n return engine->cancelRequest(this);\n }\n else\n return false;\n}\n\n\/*!\n Blocks until the request has been completed or until \\a msecs milliseconds\n has elapsed. If \\a msecs is zero or negative, this function will block indefinitely.\n\n Returns true if the request was canceled or completed\n within the given period, otherwise returns false. Some backends may be unable\n to support this operation safely and will return false immediately.\n The sqlite and sparql managers currently do not support waitForFinished(),\n while the symbian manager does (with the exception of an import request,\n which will always return false on symbian when waitForFinished() is called).\n\n Note that any signals generated while waiting for the request to be complete\n may be queued and delivered sometime after this function has returned, when\n the calling thread's event loop is dispatched. If your code depends on\n your slots being invoked, you may need to process events after calling\n this function.\n*\/\nbool QLandmarkAbstractRequest::waitForFinished(int msecs)\n{\n\n QMutexLocker ml(&d_ptr->mutex);\n if (!d_ptr->manager) {\n d_ptr->error = QLandmarkManager::BadArgumentError;\n d_ptr->errorString = \"No manager assigned to landmark request object\";\n qWarning() << d_ptr->errorString;\n return false;\n }\n QLandmarkManagerEngine *engine = d_ptr->manager->engine();\n\n switch(d_ptr->state) {\n case QLandmarkAbstractRequest::ActiveState:\n ml.unlock();\n return engine->waitForRequestFinished(this, msecs);\n case QLandmarkAbstractRequest::FinishedState:\n return true;\n default:\n return false;\n }\n return false;\n}\n\n\/*!\n \\fn void QLandmarkAbstractRequest::resultsAvailable()\n This signal is emitted when new results are available. Results\n can include the operation error which may be accessed via error(),\n or derived-class specific results which are accessible through\n the derived class API.\n\n \\sa error()\n*\/\n\n\/*!\n \\fn void QLandmarkAbstractRequest::stateChanged(QLandmarkAbstractRequest::State newState)\n This signal is emitted when the state of the request is changed. The new state of\n the request will be contained in \\a newState.\n*\/\n\n#include \"moc_qlandmarkabstractrequest.cpp\"\n\n\n\n\n\n<commit_msg>doc update<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#include \"qlandmarkabstractrequest.h\"\n#include \"qlandmarkabstractrequest_p.h\"\n#include \"qlandmarkmanagerengine.h\"\n#include \"qlandmarkmanager_p.h\"\n#include <QDebug>\n#include <QMutexLocker>\n\nQTM_USE_NAMESPACE\n\nQLandmarkAbstractRequestPrivate::QLandmarkAbstractRequestPrivate(QLandmarkManager *mgr)\n : type(QLandmarkAbstractRequest::InvalidRequest),\n state(QLandmarkAbstractRequest::InactiveState),\n error(QLandmarkManager::NoError),\n errorString(QString()),\n manager(mgr)\n{\n}\n\n\/*!\n \\class QLandmarkAbstractRequest\n \\brief The QLandmarkAbstractRequest class provides the interface\n from which all asynchronous request classes inherit.\n\n\n \\inmodule QtLocation\n\n \\ingroup landmarks-request\n\n It allows a client to asynchronously request some functionality of a\n particular QLandmarkManager. Instances of the class will emit signals when\n the state of the request changes, or when more results become available.\n\n Clients should not attempt to create instances of this class directly, but\n should instead use the use-case-specific classes derived from this class.\n\n All such request classes have a similar interface: clients set the\n parameters of the asynchronous call, then call the start() slot of the request. The manager\n will then enqueue or begin to process the request, at which point the\n request's state will transition from the \\c InactiveState to \\c ActiveState.\n After any state transition, the request will emit the stateChanged()\n signal. The manager may (if it supports it)\n periodically update the request with results, at\n which point the request will emit the resultsAvailable() signal. These\n results are not guaranteed to have a stable ordering. Error information is\n considered a result, so some requests will emit the resultsAvailable()\n signal even if no results are possible from the request (for example, a\n landmark remove request) when the manager updates the request with\n information about any errors which may have occurred.\n\n Clients can choose which signals they wish to handle from a request. If the\n client is not interested in interim results, they can choose to handle only\n the stateChanged() signal, and in the slot to which that signal is\n connected, check whether the state has changed to the \\c FinishedState\n (which signifies that the manager has finished handling the request, and\n that the request will not be updated with any more results). If the client\n is not interested in any results (including error information), they may\n choose to delete the request after calling \\l start(), or simply may not\n connect the the request's signals to any slots. (Please see the note\n below if you are working on Symbian with QtMobility 1.1.0)\n\n If the request is allocated via operator new, the client must delete the\n request when they are no longer using it in order to avoid leaking memory.\n That is, the client retains ownership of the request.\n\n The client may delete a heap-allocated request in various ways: by deleting\n it directly (but not within a slot connected to a signal emitted by the\n request), or by using the deleteLater() slot to schedule the request for\n deletion when control returns to the event loop (from within a slot\n connected to a signal emitted by the request, for example \\l\n stateChanged()).\n\n An active request may be deleted by the client, but the client will\n not receive notifications about whether the request succeeded or not,\n nor the results of the request.\n\n Because clients retain ownership of any request object, and may delete a\n request object at any time, the manager engine, implementers must be\n careful to ensue that they do not assume that a request has not been\n deleted at some time point during processing of a request, particularly\n if the engine has a multithreaded implementation.\n*\/\n\nQLandmarkAbstractRequestPrivate::~QLandmarkAbstractRequestPrivate()\n{\n}\n\nvoid QLandmarkAbstractRequestPrivate::notifyEngine(QLandmarkAbstractRequest* request)\n{\n Q_ASSERT(request);\n QLandmarkAbstractRequestPrivate* d = request->d_ptr;\n if (d) {\n QMutexLocker ml(&d->mutex);\n QLandmarkManagerEngine *engine = QLandmarkManagerPrivate::getEngine(d->manager);\n ml.unlock();\n if (engine) {\n engine->requestDestroyed(request);\n }\n }\n}\n\n\/*!\n \\enum QLandmarkAbstractRequest::RequestType\n Defines the possible types of asynchronous requests.\n \\value InvalidRequest An invalid request\n \\value LandmarkIdFetchRequest A request to fetch a list of landmark\n identifiers.\n \\value CategoryIdFetchRequest A request to fetch a list of catgory\n identifiers.\n\n \\value LandmarkFetchRequest A request to fetch a list of landmarks\n \\value LandmarkFetchByIdRequest A request to fetch a list of landmarks by id.\n \\value CategoryFetchRequest A request to fetch a list of categories\n \\value CategoryFetchByIdRequest A request to fetch a list of categories by id\n \\value LandmarkSaveRequest A request to save a list of landmarks.\n \\value LandmarkRemoveRequest A request to remove a list of landmarks.\n \\value CategorySaveRequest A request to save a list of categories.\n \\value CategoryRemoveRequest A request to remove a list of categories.\n \\value ImportRequest A request import landmarks.\n \\value ExportRequest A request export landmarks.\n*\/\n\n\/*!\n \\enum QLandmarkAbstractRequest::State\n Defines the possible states of asynchronous requests.\n \\value InactiveState Operation not yet started.\n \\value ActiveState Operation started, not yet finished.\n \\value FinishedState Operation completed. (Can be mean either successful or\n unsuccessful completion).\n*\/\n\n\/*!\n Constructs a new, invalid asynchronous request with the given \\a manager and \\a parent.\n*\/\nQLandmarkAbstractRequest::QLandmarkAbstractRequest(QLandmarkManager *manager, QObject *parent)\n : QObject(parent),\n d_ptr(new QLandmarkAbstractRequestPrivate(manager))\n{\n}\n\n\/*!\n \\internal\n*\/\nQLandmarkAbstractRequest::QLandmarkAbstractRequest(QLandmarkAbstractRequestPrivate *dd, QObject *parent)\n : QObject(parent),\n d_ptr(dd)\n{\n}\n\n\/*!\n Destroys the asynchronous request. Because the request object is effectiely a handle to a\n request operation, the operation may continue or it may just be canceled, depending upon\n the enine implementation, even though the request itself has been destroyed.\n The sqlite engine continues the operation behind the scenes if the\n request is destroyed whilst active. For the symbian engine see the note below.\n*\/\nQLandmarkAbstractRequest::~QLandmarkAbstractRequest()\n{\n QLandmarkAbstractRequestPrivate::notifyEngine(this);\n delete d_ptr;\n}\n\n\/*!\n Returns the type of this asynchronous request.\n*\/\nQLandmarkAbstractRequest::RequestType QLandmarkAbstractRequest::type() const\n{\n QMutexLocker ml(&d_ptr->mutex);\n return d_ptr->type;\n}\n\n\/*!\n Returns the state of the request\n*\/\nQLandmarkAbstractRequest::State QLandmarkAbstractRequest::state()\n{\n QMutexLocker ml(&d_ptr->mutex);\n return d_ptr->state;\n}\n\n\/*!\n Returns true if the request is in the \\c QLandmarkAbstractRequest::Inactive state;\n otherwise, returns false.\n \\sa state()\n*\/\nbool QLandmarkAbstractRequest::isInactive() const\n{\n QMutexLocker ml(&d_ptr->mutex);\n return d_ptr->state == QLandmarkAbstractRequest::InactiveState;\n}\n\n\/*!\n Returns true if the request is in the \\c QLandmarkAbstractRequest::Active state;\n otherwise, returns false.\n \\sa state()\n*\/\nbool QLandmarkAbstractRequest::isActive() const\n{\n QMutexLocker ml(&d_ptr->mutex);\n return d_ptr->state == QLandmarkAbstractRequest::ActiveState;\n}\n\n\/*!\n Returns true if the request is in the \\c QLandmarkAbstractRequest::Finished state;\n otherwise, returns false.\n \\sa state()\n*\/\nbool QLandmarkAbstractRequest::isFinished() const\n{\n QMutexLocker ml(&d_ptr->mutex);\n return d_ptr->state == QLandmarkAbstractRequest::FinishedState;\n}\n\n\/*!\n Returns the overall error of the most recent asynchronous operation.\n \\sa errorString()\n*\/\nQLandmarkManager::Error QLandmarkAbstractRequest::error() const\n{\n QMutexLocker ml(&d_ptr->mutex);\n return d_ptr->error;\n}\n\n\/*!\n Returns a human readable string of the last error\n that occurred. This error string is intended to be used\n by developers only and should not be seen by end users.\n \\sa error()\n*\/\nQString QLandmarkAbstractRequest::errorString() const\n{\n QMutexLocker ml(&d_ptr->mutex);\n return d_ptr->errorString;\n}\n\n\/*!\n Returns a pointer to the landmark manager which\n this request operates on.\n*\/\nQLandmarkManager *QLandmarkAbstractRequest::manager() const\n{\n QMutexLocker ml(&d_ptr->mutex);\n return d_ptr->manager;\n}\n\n\/*!\n Sets the \\a manager which this request operates on.\n\n Note that if a NULL manager is set, the functions\n start(), cancel() and waitForFinished() will return false and\n error will be set to QLandmarkManager::InvalidManagerError.\n\n A manager cannot be assigned while the request is in the\n QLandmarkAbstractRequest::ActiveState.\n*\/\nvoid QLandmarkAbstractRequest::setManager(QLandmarkManager *manager)\n{\n QMutexLocker ml(&d_ptr->mutex);\n if (d_ptr->state == QLandmarkAbstractRequest::ActiveState && d_ptr->manager)\n return;\n d_ptr->manager = manager;\n}\n\n\/*!\n Attempts to start the request.\n\n Returns true if the request was started, otherwise false. Trying to start a\n request that is already active returns false.\n \\sa cancel().\n*\/\nbool QLandmarkAbstractRequest::start()\n{\n QMutexLocker ml(&d_ptr->mutex);\n if (!d_ptr->manager) {\n d_ptr->error = QLandmarkManager::BadArgumentError;\n d_ptr->errorString = \"No manager assigned to landmark request object\";\n qWarning() << d_ptr->errorString;\n return false;\n }\n QLandmarkManagerEngine *engine = d_ptr->manager->engine();\n if (!engine) {\n d_ptr->error = QLandmarkManager::InvalidManagerError;\n d_ptr->errorString = \"The manager is invalid\";\n return false;\n }\n\n if (d_ptr->state != QLandmarkAbstractRequest::ActiveState) {\n ml.unlock();\n return engine->startRequest(this);\n }\n else {\n return false;\n }\n}\n\n\/*!\n Notifies the request that it should be canceled.\n\n Returns true if the request was successfully notified\n that it should be canceled. The request may or may not honor\n the cancel notification. Returns false if the notification\n could not be made or the request is not in the\n QLandmarkManager::Active state.\n\n \\sa start()\n*\/\nbool QLandmarkAbstractRequest::cancel()\n{\n QMutexLocker ml(&d_ptr->mutex);\n if (!d_ptr->manager) {\n d_ptr->error = QLandmarkManager::BadArgumentError;\n d_ptr->errorString = \"No manager assigned to landmark request object\";\n qWarning() << d_ptr->errorString;\n return false;\n }\n QLandmarkManagerEngine *engine = d_ptr->manager->engine();\n\n if(d_ptr->state == QLandmarkAbstractRequest::ActiveState) {\n ml.unlock();\n return engine->cancelRequest(this);\n }\n else\n return false;\n}\n\n\/*!\n Blocks until the request has been completed or until \\a msecs milliseconds\n has elapsed. If \\a msecs is zero or negative, this function will block indefinitely.\n\n Returns true if the request was canceled or completed\n within the given period, otherwise returns false. Some backends may be unable\n to support this operation safely and will return false immediately.\n The sqlite and sparql managers currently do not support waitForFinished(),\n while the symbian manager does.\n\n Note that any signals generated while waiting for the request to be complete\n may be queued and delivered sometime after this function has returned, when\n the calling thread's event loop is dispatched. If your code depends on\n your slots being invoked, you may need to process events after calling\n this function.\n*\/\nbool QLandmarkAbstractRequest::waitForFinished(int msecs)\n{\n\n QMutexLocker ml(&d_ptr->mutex);\n if (!d_ptr->manager) {\n d_ptr->error = QLandmarkManager::BadArgumentError;\n d_ptr->errorString = \"No manager assigned to landmark request object\";\n qWarning() << d_ptr->errorString;\n return false;\n }\n QLandmarkManagerEngine *engine = d_ptr->manager->engine();\n\n switch(d_ptr->state) {\n case QLandmarkAbstractRequest::ActiveState:\n ml.unlock();\n return engine->waitForRequestFinished(this, msecs);\n case QLandmarkAbstractRequest::FinishedState:\n return true;\n default:\n return false;\n }\n return false;\n}\n\n\/*!\n \\fn void QLandmarkAbstractRequest::resultsAvailable()\n This signal is emitted when new results are available. Results\n can include the operation error which may be accessed via error(),\n or derived-class specific results which are accessible through\n the derived class API.\n\n \\sa error()\n*\/\n\n\/*!\n \\fn void QLandmarkAbstractRequest::stateChanged(QLandmarkAbstractRequest::State newState)\n This signal is emitted when the state of the request is changed. The new state of\n the request will be contained in \\a newState.\n*\/\n\n#include \"moc_qlandmarkabstractrequest.cpp\"\n\n\n\n\n\n<|endoftext|>"} {"text":"<commit_before><commit_msg>Cleaned up implementation<commit_after><|endoftext|>"} {"text":"<commit_before><commit_msg>Rename MRegisterInfo to TargetRegisterInfo.<commit_after><|endoftext|>"} {"text":"<commit_before>\/*\n* Copyright 2008 Free Software Foundation, Inc.\n*\n*\n* This software is distributed under the terms of the GNU Affero Public License.\n* See the COPYING file in the main directory for details.\n*\n* This use of this software may be subject to additional restrictions.\n* See the LEGAL file in the main directory for details.\n\n\tThis program is free software: you can redistribute it and\/or modify\n\tit under the terms of the GNU Affero General Public License as published by\n\tthe Free Software Foundation, either version 3 of the License, or\n\t(at your option) any later version.\n\n\tThis program is distributed in the hope that it will be useful,\n\tbut WITHOUT ANY WARRANTY; without even the implied warranty of\n\tMERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the\n\tGNU Affero General Public License for more details.\n\n\tYou should have received a copy of the GNU Affero General Public License\n\talong with this program. If not, see <http:\/\/www.gnu.org\/licenses\/>.\n\n*\/\n\n\n\n\n#include \"Sockets.h\"\n#include \"Threads.h\"\n#include <stdio.h>\n#include <stdlib.h>\n#include <unistd.h>\n#include <signal.h>\n\nstatic const int gNumToSend = 10;\n\nstatic void sigalarm_handler(int foo)\n{\n\tprintf(\"FAIL: test did not run successfully\\n\");\n\texit(EXIT_FAILURE);\n}\n\nvoid *testReaderIP(void *param)\n{\n\tUDPSocket *readSocket = (UDPSocket *)param;\n\treadSocket->nonblocking();\n\tint rc = 0;\n\twhile (rc<gNumToSend) {\n\t\tchar buf[MAX_UDP_LENGTH] = { 0 };\n\t\tint count = readSocket->read(buf, MAX_UDP_LENGTH);\n\t\tif (count>0) {\n\t\t\tCERR(\"read: \" << buf);\n\t\t\trc++;\n\t\t} else {\n\t\t\tsleep(2);\n\t\t}\n\t}\n\treturn NULL;\n}\n\nint main(int argc, char * argv[] )\n{\n int count;\n\n if (signal(SIGALRM, sigalarm_handler) == SIG_ERR) {\n perror(\"signal\");\n exit(EXIT_FAILURE);\n }\n\n \/* If the test takes longer than 2*gNumToSend seconds, abort it *\/\n alarm(2* gNumToSend);\n\n UDPSocket readSocket(\"127.0.0.1\", 0);\n UDPSocket socket1(\"127.0.0.1\", 0, \"localhost\", readSocket.port());\n\n CERR(\"socket1: \" << socket1.port() << \", readSocket: \" << readSocket.port());\n\n Thread readerThreadIP;\n readerThreadIP.start(testReaderIP, &readSocket);\n\n \/\/ give the readers time to open\n sleep(1);\n\n for (int i=0; i<gNumToSend; i++) {\n CERR(\"write\");\n count = socket1.write(\"Hello IP land\");\n if (count < 0) {\n COUT(\"FAIL: write\");\n exit(EXIT_FAILURE);\n }\n sleep(1);\n }\n\n readerThreadIP.join();\n\n printf(\"Done\\n\");\n}\n\n\/\/ vim: ts=4 sw=4\n<commit_msg>SocketsTest.testReaderIP(): Zero terminate received buffer<commit_after>\/*\n* Copyright 2008 Free Software Foundation, Inc.\n*\n*\n* This software is distributed under the terms of the GNU Affero Public License.\n* See the COPYING file in the main directory for details.\n*\n* This use of this software may be subject to additional restrictions.\n* See the LEGAL file in the main directory for details.\n\n\tThis program is free software: you can redistribute it and\/or modify\n\tit under the terms of the GNU Affero General Public License as published by\n\tthe Free Software Foundation, either version 3 of the License, or\n\t(at your option) any later version.\n\n\tThis program is distributed in the hope that it will be useful,\n\tbut WITHOUT ANY WARRANTY; without even the implied warranty of\n\tMERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the\n\tGNU Affero General Public License for more details.\n\n\tYou should have received a copy of the GNU Affero General Public License\n\talong with this program. If not, see <http:\/\/www.gnu.org\/licenses\/>.\n\n*\/\n\n\n\n\n#include \"Sockets.h\"\n#include \"Threads.h\"\n#include <stdio.h>\n#include <stdlib.h>\n#include <unistd.h>\n#include <signal.h>\n\nstatic const int gNumToSend = 10;\n\nstatic void sigalarm_handler(int foo)\n{\n\tprintf(\"FAIL: test did not run successfully\\n\");\n\texit(EXIT_FAILURE);\n}\n\nvoid *testReaderIP(void *param)\n{\n\tUDPSocket *readSocket = (UDPSocket *)param;\n\treadSocket->nonblocking();\n\tint rc = 0;\n\twhile (rc<gNumToSend) {\n\t\tchar buf[MAX_UDP_LENGTH+1] = { 0 };\n\t\tint count = readSocket->read(buf, MAX_UDP_LENGTH);\n\t\tif (count>0) {\n\t\t\tbuf[count] = 0;\n\t\t\tCERR(\"read: \" << buf);\n\t\t\trc++;\n\t\t} else {\n\t\t\tsleep(2);\n\t\t}\n\t}\n\treturn NULL;\n}\n\nint main(int argc, char * argv[] )\n{\n int count;\n\n if (signal(SIGALRM, sigalarm_handler) == SIG_ERR) {\n perror(\"signal\");\n exit(EXIT_FAILURE);\n }\n\n \/* If the test takes longer than 2*gNumToSend seconds, abort it *\/\n alarm(2* gNumToSend);\n\n UDPSocket readSocket(\"127.0.0.1\", 0);\n UDPSocket socket1(\"127.0.0.1\", 0, \"localhost\", readSocket.port());\n\n CERR(\"socket1: \" << socket1.port() << \", readSocket: \" << readSocket.port());\n\n Thread readerThreadIP;\n readerThreadIP.start(testReaderIP, &readSocket);\n\n \/\/ give the readers time to open\n sleep(1);\n\n for (int i=0; i<gNumToSend; i++) {\n CERR(\"write\");\n count = socket1.write(\"Hello IP land\");\n if (count < 0) {\n COUT(\"FAIL: write\");\n exit(EXIT_FAILURE);\n }\n sleep(1);\n }\n\n readerThreadIP.join();\n\n printf(\"Done\\n\");\n}\n\n\/\/ vim: ts=4 sw=4\n<|endoftext|>"} {"text":"<commit_before>\/*\n *\n * Copyright 2017 Asylo 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 \"asylo\/platform\/arch\/sgx\/untrusted\/sgx_client.h\"\n\n#include <cstdint>\n#include <string>\n\n#include \"absl\/memory\/memory.h\"\n#include \"absl\/strings\/str_cat.h\"\n#include \"absl\/strings\/string_view.h\"\n#include \"absl\/types\/span.h\"\n#include \"asylo\/util\/logging.h\"\n#include \"asylo\/platform\/arch\/sgx\/sgx_error_space.h\"\n#include \"asylo\/platform\/arch\/sgx\/untrusted\/generated_bridge_u.h\"\n#include \"asylo\/platform\/common\/bridge_functions.h\"\n#include \"asylo\/platform\/common\/bridge_types.h\"\n#include \"asylo\/util\/elf_reader.h\"\n#include \"asylo\/util\/file_mapping.h\"\n#include \"asylo\/util\/posix_error_space.h\"\n#include \"asylo\/util\/status_macros.h\"\n\nnamespace asylo {\nnamespace {\n\nconstexpr absl::string_view kCallingProcessBinaryFile = \"\/proc\/self\/exe\";\n\nconstexpr int kMaxEnclaveCreateAttempts = 5;\n\n\/\/ Creates an SGX enclave from |buffer|, updating |token| and |enclave_id| with\n\/\/ the appropriate data. If enclave creation fails due to an interruption in the\n\/\/ enclave creation process, retries the enclave creation up to a total of\n\/\/ kMaxEnclaveCreateAttempts tries.\nStatus LoadFromBuffer(absl::Span<const uint8_t> buffer, bool debug,\n sgx_launch_token_t *token, sgx_enclave_id_t *enclave_id,\n void **enclave_base_addr) {\n int updated;\n sgx_status_t sgx_status;\n for (int i = 0; i < kMaxEnclaveCreateAttempts; ++i) {\n sgx_status = sgx_create_enclave_from_buffer(\n const_cast<uint8_t *>(buffer.data()), buffer.size(), debug, token,\n &updated, enclave_id, \/*misc_attr=*\/nullptr, enclave_base_addr);\n\n if (sgx_status == SGX_SUCCESS) {\n break;\n }\n\n if (sgx_status != SGX_INTERNAL_ERROR_ENCLAVE_CREATE_INTERRUPTED) {\n return Status(sgx_status, \"Failed to create an enclave\");\n }\n }\n\n return Status::OkStatus();\n}\n\n} \/\/ namespace\n\n\n\/\/ Enters the enclave and invokes the initialization entry-point. If the ecall\n\/\/ fails, or the enclave does not return any output, returns a non-OK status. In\n\/\/ this case, the caller cannot make any assumptions about the contents of\n\/\/ |output|. Otherwise, |output| points to a buffer of length *|output_len| that\n\/\/ contains output from the enclave.\nstatic Status initialize(sgx_enclave_id_t eid, const char *name,\n const char *input, size_t input_len, char **output,\n size_t *output_len) {\n int result;\n sgx_status_t sgx_status = ecall_initialize(\n eid, &result, name, input, static_cast<bridge_size_t>(input_len), output,\n static_cast<bridge_size_t *>(output_len));\n if (sgx_status != SGX_SUCCESS) {\n \/\/ Return a Status object in the SGX error space.\n return Status(sgx_status, \"Call to ecall_initialize failed\");\n } else if (result || *output_len == 0) {\n \/\/ Non-zero return code indicates that the enclave was not able to return\n \/\/ any output from Initialize().\n return Status(error::GoogleError::INTERNAL, \"No output from enclave\");\n }\n\n return Status::OkStatus();\n}\n\n\/\/ Enters the enclave and invokes the execution entry-point. If the ecall fails,\n\/\/ or the enclave does not return any output, returns a non-OK status. In this\n\/\/ case, the caller cannot make any assumptions about the contents of |output|.\n\/\/ Otherwise, |output| points to a buffer of length *|output_len| that contains\n\/\/ output from the enclave.\nstatic Status run(sgx_enclave_id_t eid, const char *input, size_t input_len,\n char **output, size_t *output_len) {\n int result;\n sgx_status_t sgx_status =\n ecall_run(eid, &result, input, static_cast<bridge_size_t>(input_len),\n output, static_cast<bridge_size_t *>(output_len));\n if (sgx_status != SGX_SUCCESS) {\n \/\/ Return a Status object in the SGX error space.\n return Status(sgx_status, \"Call to ecall_run failed\");\n } else if (result || *output_len == 0) {\n \/\/ Ecall succeeded but did not return a value. The indicates that the\n \/\/ trusted code failed to propagate error information over the enclave\n \/\/ boundary (e.g. serialization failure).\n return Status(error::GoogleError::INTERNAL, \"No output from enclave\");\n }\n\n return Status::OkStatus();\n}\n\n\/\/ Enters the enclave and invokes the finalization entry-point. If the ecall\n\/\/ fails, or the enclave does not return any output, returns a non-OK status. In\n\/\/ this case, the caller cannot make any assumptions about the contents of\n\/\/ |output|. Otherwise, |output| points to a buffer of length *|output_len| that\n\/\/ contains output from the enclave.\nstatic Status finalize(sgx_enclave_id_t eid, const char *input,\n size_t input_len, char **output, size_t *output_len) {\n int result;\n sgx_status_t sgx_status =\n ecall_finalize(eid, &result, input, static_cast<bridge_size_t>(input_len),\n output, static_cast<bridge_size_t *>(output_len));\n if (sgx_status != SGX_SUCCESS) {\n \/\/ Return a Status object in the SGX error space.\n return Status(sgx_status, \"Call to ecall_finalize failed\");\n } else if (result || *output_len == 0) {\n \/\/ Non-zero return code indicates that the enclave was not able to return\n \/\/ any output from Finalize().\n return Status(error::GoogleError::INTERNAL, \"No output from enclave\");\n }\n\n return Status::OkStatus();\n}\n\nstatic int donate_thread(sgx_enclave_id_t eid, sgx_status_t *status) {\n int result;\n sgx_status_t local_status = ecall_donate_thread(eid, &result);\n if (status) *status = local_status;\n if (local_status != SGX_SUCCESS) {\n return -1;\n }\n return result;\n}\n\n\/\/ Enters the enclave and invokes the signal handle entry-point. If the ecall\n\/\/ fails, returns a non-OK status.\nstatic Status handle_signal(sgx_enclave_id_t eid, const char *input,\n size_t input_len) {\n int result;\n sgx_status_t sgx_status = ecall_handle_signal(\n eid, &result, input, static_cast<bridge_size_t>(input_len));\n if (sgx_status != SGX_SUCCESS) {\n \/\/ Return a Status object in the SGX error space.\n return Status(sgx_status, \"Call to ecall_handle_signal failed\");\n } else if (result) {\n std::string message;\n switch (result) {\n case 1:\n message = \"Invalid or unregistered incoming signal\";\n break;\n case 2:\n message = \"Enclave unable to handle signal in current state\";\n break;\n case -1:\n message = \"Incoming signal is blocked inside the enclave\";\n break;\n default:\n message = \"Unexpected error while handling signal\";\n }\n return Status(error::GoogleError::INTERNAL, message);\n }\n return Status::OkStatus();\n}\n\nStatusOr<std::unique_ptr<EnclaveClient>> SgxLoader::LoadEnclave(\n const std::string &name, void *base_address) const {\n std::unique_ptr<SgxClient> client = absl::make_unique<SgxClient>(name);\n client->base_address_ = base_address;\n\n FileMapping enclave_file_mapping;\n ASYLO_ASSIGN_OR_RETURN(enclave_file_mapping,\n FileMapping::CreateFromFile(enclave_path_));\n\n ASYLO_RETURN_IF_ERROR(LoadFromBuffer(enclave_file_mapping.buffer(), debug_,\n &client->token_, &client->id_,\n &client->base_address_));\n\n return std::unique_ptr<EnclaveClient>(client.release());\n}\n\nStatusOr<std::unique_ptr<EnclaveClient>> SgxEmbeddedLoader::LoadEnclave(\n const std::string &name, void *base_address) const {\n std::unique_ptr<SgxClient> client = absl::make_unique<SgxClient>(name);\n client->base_address_ = base_address;\n\n FileMapping self_binary_mapping;\n ASYLO_ASSIGN_OR_RETURN(self_binary_mapping, FileMapping::CreateFromFile(\n kCallingProcessBinaryFile));\n\n ElfReader self_binary_reader;\n ASYLO_ASSIGN_OR_RETURN(self_binary_reader, ElfReader::CreateFromSpan(\n self_binary_mapping.buffer()));\n\n absl::Span<const uint8_t> enclave_buffer;\n ASYLO_ASSIGN_OR_RETURN(enclave_buffer,\n self_binary_reader.GetSectionData(section_name_));\n\n ASYLO_RETURN_IF_ERROR(LoadFromBuffer(enclave_buffer, debug_, &client->token_,\n &client->id_, &client->base_address_));\n\n return std::unique_ptr<EnclaveClient>(client.release());\n}\n\nStatus SgxClient::EnterAndInitialize(const EnclaveConfig &config) {\n std::string buf;\n if (!config.SerializeToString(&buf)) {\n return Status(error::GoogleError::INVALID_ARGUMENT,\n \"Failed to serialize EnclaveConfig\");\n }\n\n char *output = nullptr;\n size_t output_len = 0;\n ASYLO_RETURN_IF_ERROR(initialize(id_, get_name().c_str(), buf.data(),\n buf.size(), &output, &output_len));\n\n \/\/ Enclave entry-point was successfully invoked. |output| is guaranteed to\n \/\/ have a value.\n StatusProto status_proto;\n if (!status_proto.ParseFromArray(output, output_len)) {\n return Status(error::GoogleError::INTERNAL,\n \"Failed to deserialize StatusProto\");\n }\n Status status;\n status.RestoreFrom(status_proto);\n\n \/\/ |output| points to an untrusted memory buffer allocated by the enclave. It\n \/\/ is the untrusted caller's responsibility to free this buffer.\n free(output);\n\n return status;\n}\n\nStatus SgxClient::EnterAndRun(const EnclaveInput &input,\n EnclaveOutput *output) {\n std::string buf;\n if (!input.SerializeToString(&buf)) {\n return Status(error::GoogleError::INVALID_ARGUMENT,\n \"Failed to serialize EnclaveInput\");\n }\n\n char *output_buf = nullptr;\n size_t output_len = 0;\n ASYLO_RETURN_IF_ERROR(\n run(id_, buf.data(), buf.size(), &output_buf, &output_len));\n\n \/\/ Enclave entry-point was successfully invoked. |output_buf| is guaranteed to\n \/\/ have a value.\n EnclaveOutput local_output;\n local_output.ParseFromArray(output_buf, output_len);\n Status status;\n status.RestoreFrom(local_output.status());\n\n \/\/ If |output| is not null, then |output_buf| points to a memory buffer\n \/\/ allocated inside the enclave using enc_untrusted_malloc(). It is the\n \/\/ caller's responsibility to free this buffer.\n free(output_buf);\n\n \/\/ Set the output parameter if necessary.\n if (output) {\n *output = local_output;\n }\n\n return status;\n}\n\nStatus SgxClient::EnterAndFinalize(const EnclaveFinal &final_input) {\n std::string buf;\n if (!final_input.SerializeToString(&buf)) {\n return Status(error::GoogleError::INVALID_ARGUMENT,\n \"Failed to serialize EnclaveFinal\");\n }\n\n char *output = nullptr;\n size_t output_len = 0;\n\n ASYLO_RETURN_IF_ERROR(\n finalize(id_, buf.data(), buf.size(), &output, &output_len));\n\n \/\/ Enclave entry-point was successfully invoked. |output| is guaranteed to\n \/\/ have a value.\n StatusProto status_proto;\n status_proto.ParseFromArray(output, output_len);\n Status status;\n status.RestoreFrom(status_proto);\n\n \/\/ |output| points to an untrusted memory buffer allocated by the enclave. It\n \/\/ is the untrusted caller's responsibility to free this buffer.\n free(output);\n\n return status;\n}\n\nStatus SgxClient::EnterAndDonateThread() {\n sgx_status_t sgx_status;\n int result = donate_thread(id_, &sgx_status);\n Status status;\n if (sgx_status != SGX_SUCCESS) {\n status = Status(sgx_status, \"Failed to donate thread to enclave\");\n } else if (result) {\n status = Status(static_cast<error::PosixError>(result),\n \"Failed to donate thread to enclave\");\n }\n if (!status.ok()) {\n LOG(ERROR) << \"EnterAndDonateThread failed \" << status;\n }\n return status;\n}\n\nStatus SgxClient::EnterAndHandleSignal(const EnclaveSignal &signal) {\n EnclaveSignal enclave_signal;\n int bridge_signum = ToBridgeSignal(signal.signum());\n if (bridge_signum < 0) {\n return Status(error::GoogleError::INVALID_ARGUMENT,\n absl::StrCat(\"Failed to convert signum (\", signal.signum(),\n \") to bridge signum\"));\n }\n enclave_signal.set_signum(bridge_signum);\n std::string serialized_enclave_signal;\n if (!enclave_signal.SerializeToString(&serialized_enclave_signal)) {\n return Status(error::GoogleError::INVALID_ARGUMENT,\n \"Failed to serialize EnclaveSignal\");\n }\n return handle_signal(id_, serialized_enclave_signal.data(),\n serialized_enclave_signal.size());\n}\n\nStatus SgxClient::DestroyEnclave() {\n sgx_status_t rc = sgx_destroy_enclave(id_);\n if (rc != SGX_SUCCESS) {\n return Status(rc, \"Failed to destroy an enclave\");\n }\n return Status::OkStatus();\n}\n\nbool SgxClient::IsTcsActive() { return (sgx_is_tcs_active(id_) != 0); }\n\n} \/\/ namespace asylo\n<commit_msg>Load enclave from file when available<commit_after>\/*\n *\n * Copyright 2017 Asylo 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 \"asylo\/platform\/arch\/sgx\/untrusted\/sgx_client.h\"\n\n#include <cstdint>\n#include <string>\n\n#include \"absl\/memory\/memory.h\"\n#include \"absl\/strings\/str_cat.h\"\n#include \"absl\/strings\/string_view.h\"\n#include \"absl\/types\/span.h\"\n#include \"asylo\/util\/logging.h\"\n#include \"asylo\/platform\/arch\/sgx\/sgx_error_space.h\"\n#include \"asylo\/platform\/arch\/sgx\/untrusted\/generated_bridge_u.h\"\n#include \"asylo\/platform\/common\/bridge_functions.h\"\n#include \"asylo\/platform\/common\/bridge_types.h\"\n#include \"asylo\/util\/elf_reader.h\"\n#include \"asylo\/util\/file_mapping.h\"\n#include \"asylo\/util\/posix_error_space.h\"\n#include \"asylo\/util\/status_macros.h\"\n\nnamespace asylo {\nnamespace {\n\nconstexpr absl::string_view kCallingProcessBinaryFile = \"\/proc\/self\/exe\";\n\nconstexpr int kMaxEnclaveCreateAttempts = 5;\n\n} \/\/ namespace\n\n\n\/\/ Enters the enclave and invokes the initialization entry-point. If the ecall\n\/\/ fails, or the enclave does not return any output, returns a non-OK status. In\n\/\/ this case, the caller cannot make any assumptions about the contents of\n\/\/ |output|. Otherwise, |output| points to a buffer of length *|output_len| that\n\/\/ contains output from the enclave.\nstatic Status initialize(sgx_enclave_id_t eid, const char *name,\n const char *input, size_t input_len, char **output,\n size_t *output_len) {\n int result;\n sgx_status_t sgx_status = ecall_initialize(\n eid, &result, name, input, static_cast<bridge_size_t>(input_len), output,\n static_cast<bridge_size_t *>(output_len));\n if (sgx_status != SGX_SUCCESS) {\n \/\/ Return a Status object in the SGX error space.\n return Status(sgx_status, \"Call to ecall_initialize failed\");\n } else if (result || *output_len == 0) {\n \/\/ Non-zero return code indicates that the enclave was not able to return\n \/\/ any output from Initialize().\n return Status(error::GoogleError::INTERNAL, \"No output from enclave\");\n }\n\n return Status::OkStatus();\n}\n\n\/\/ Enters the enclave and invokes the execution entry-point. If the ecall fails,\n\/\/ or the enclave does not return any output, returns a non-OK status. In this\n\/\/ case, the caller cannot make any assumptions about the contents of |output|.\n\/\/ Otherwise, |output| points to a buffer of length *|output_len| that contains\n\/\/ output from the enclave.\nstatic Status run(sgx_enclave_id_t eid, const char *input, size_t input_len,\n char **output, size_t *output_len) {\n int result;\n sgx_status_t sgx_status =\n ecall_run(eid, &result, input, static_cast<bridge_size_t>(input_len),\n output, static_cast<bridge_size_t *>(output_len));\n if (sgx_status != SGX_SUCCESS) {\n \/\/ Return a Status object in the SGX error space.\n return Status(sgx_status, \"Call to ecall_run failed\");\n } else if (result || *output_len == 0) {\n \/\/ Ecall succeeded but did not return a value. The indicates that the\n \/\/ trusted code failed to propagate error information over the enclave\n \/\/ boundary (e.g. serialization failure).\n return Status(error::GoogleError::INTERNAL, \"No output from enclave\");\n }\n\n return Status::OkStatus();\n}\n\n\/\/ Enters the enclave and invokes the finalization entry-point. If the ecall\n\/\/ fails, or the enclave does not return any output, returns a non-OK status. In\n\/\/ this case, the caller cannot make any assumptions about the contents of\n\/\/ |output|. Otherwise, |output| points to a buffer of length *|output_len| that\n\/\/ contains output from the enclave.\nstatic Status finalize(sgx_enclave_id_t eid, const char *input,\n size_t input_len, char **output, size_t *output_len) {\n int result;\n sgx_status_t sgx_status =\n ecall_finalize(eid, &result, input, static_cast<bridge_size_t>(input_len),\n output, static_cast<bridge_size_t *>(output_len));\n if (sgx_status != SGX_SUCCESS) {\n \/\/ Return a Status object in the SGX error space.\n return Status(sgx_status, \"Call to ecall_finalize failed\");\n } else if (result || *output_len == 0) {\n \/\/ Non-zero return code indicates that the enclave was not able to return\n \/\/ any output from Finalize().\n return Status(error::GoogleError::INTERNAL, \"No output from enclave\");\n }\n\n return Status::OkStatus();\n}\n\nstatic int donate_thread(sgx_enclave_id_t eid, sgx_status_t *status) {\n int result;\n sgx_status_t local_status = ecall_donate_thread(eid, &result);\n if (status) *status = local_status;\n if (local_status != SGX_SUCCESS) {\n return -1;\n }\n return result;\n}\n\n\/\/ Enters the enclave and invokes the signal handle entry-point. If the ecall\n\/\/ fails, returns a non-OK status.\nstatic Status handle_signal(sgx_enclave_id_t eid, const char *input,\n size_t input_len) {\n int result;\n sgx_status_t sgx_status = ecall_handle_signal(\n eid, &result, input, static_cast<bridge_size_t>(input_len));\n if (sgx_status != SGX_SUCCESS) {\n \/\/ Return a Status object in the SGX error space.\n return Status(sgx_status, \"Call to ecall_handle_signal failed\");\n } else if (result) {\n std::string message;\n switch (result) {\n case 1:\n message = \"Invalid or unregistered incoming signal\";\n break;\n case 2:\n message = \"Enclave unable to handle signal in current state\";\n break;\n case -1:\n message = \"Incoming signal is blocked inside the enclave\";\n break;\n default:\n message = \"Unexpected error while handling signal\";\n }\n return Status(error::GoogleError::INTERNAL, message);\n }\n return Status::OkStatus();\n}\n\nStatusOr<std::unique_ptr<EnclaveClient>> SgxLoader::LoadEnclave(\n const std::string &name, void *base_address) const {\n std::unique_ptr<SgxClient> client = absl::make_unique<SgxClient>(name);\n client->base_address_ = base_address;\n\n int updated;\n sgx_status_t status;\n for (int i = 0; i < kMaxEnclaveCreateAttempts; ++i) {\n status = sgx_create_enclave(enclave_path_.c_str(), debug_, &client->token_,\n &updated, &client->id_,\n \/*misc_attr=*\/nullptr, &client->base_address_);\n\n if (status != SGX_INTERNAL_ERROR_ENCLAVE_CREATE_INTERRUPTED) {\n break;\n }\n }\n\n if (status != SGX_SUCCESS) {\n return Status(status, \"Failed to create an enclave\");\n }\n\n return std::unique_ptr<EnclaveClient>(client.release());\n}\n\nStatusOr<std::unique_ptr<EnclaveClient>> SgxEmbeddedLoader::LoadEnclave(\n const std::string &name, void *base_address) const {\n std::unique_ptr<SgxClient> client = absl::make_unique<SgxClient>(name);\n client->base_address_ = base_address;\n\n FileMapping self_binary_mapping;\n ASYLO_ASSIGN_OR_RETURN(self_binary_mapping, FileMapping::CreateFromFile(\n kCallingProcessBinaryFile));\n\n ElfReader self_binary_reader;\n ASYLO_ASSIGN_OR_RETURN(self_binary_reader, ElfReader::CreateFromSpan(\n self_binary_mapping.buffer()));\n\n absl::Span<const uint8_t> enclave_buffer;\n ASYLO_ASSIGN_OR_RETURN(enclave_buffer,\n self_binary_reader.GetSectionData(section_name_));\n\n int updated;\n sgx_status_t status;\n for (int i = 0; i < kMaxEnclaveCreateAttempts; ++i) {\n status = sgx_create_enclave_from_buffer(\n const_cast<uint8_t *>(enclave_buffer.data()), enclave_buffer.size(),\n debug_, &client->token_, &updated, &client->id_, \/*misc_attr=*\/nullptr,\n &client->base_address_);\n\n if (status != SGX_INTERNAL_ERROR_ENCLAVE_CREATE_INTERRUPTED) {\n break;\n }\n }\n\n if (status != SGX_SUCCESS) {\n return Status(status, \"Failed to create an enclave\");\n }\n\n return std::unique_ptr<EnclaveClient>(client.release());\n}\n\nStatus SgxClient::EnterAndInitialize(const EnclaveConfig &config) {\n std::string buf;\n if (!config.SerializeToString(&buf)) {\n return Status(error::GoogleError::INVALID_ARGUMENT,\n \"Failed to serialize EnclaveConfig\");\n }\n\n char *output = nullptr;\n size_t output_len = 0;\n ASYLO_RETURN_IF_ERROR(initialize(id_, get_name().c_str(), buf.data(),\n buf.size(), &output, &output_len));\n\n \/\/ Enclave entry-point was successfully invoked. |output| is guaranteed to\n \/\/ have a value.\n StatusProto status_proto;\n if (!status_proto.ParseFromArray(output, output_len)) {\n return Status(error::GoogleError::INTERNAL,\n \"Failed to deserialize StatusProto\");\n }\n Status status;\n status.RestoreFrom(status_proto);\n\n \/\/ |output| points to an untrusted memory buffer allocated by the enclave. It\n \/\/ is the untrusted caller's responsibility to free this buffer.\n free(output);\n\n return status;\n}\n\nStatus SgxClient::EnterAndRun(const EnclaveInput &input,\n EnclaveOutput *output) {\n std::string buf;\n if (!input.SerializeToString(&buf)) {\n return Status(error::GoogleError::INVALID_ARGUMENT,\n \"Failed to serialize EnclaveInput\");\n }\n\n char *output_buf = nullptr;\n size_t output_len = 0;\n ASYLO_RETURN_IF_ERROR(\n run(id_, buf.data(), buf.size(), &output_buf, &output_len));\n\n \/\/ Enclave entry-point was successfully invoked. |output_buf| is guaranteed to\n \/\/ have a value.\n EnclaveOutput local_output;\n local_output.ParseFromArray(output_buf, output_len);\n Status status;\n status.RestoreFrom(local_output.status());\n\n \/\/ If |output| is not null, then |output_buf| points to a memory buffer\n \/\/ allocated inside the enclave using enc_untrusted_malloc(). It is the\n \/\/ caller's responsibility to free this buffer.\n free(output_buf);\n\n \/\/ Set the output parameter if necessary.\n if (output) {\n *output = local_output;\n }\n\n return status;\n}\n\nStatus SgxClient::EnterAndFinalize(const EnclaveFinal &final_input) {\n std::string buf;\n if (!final_input.SerializeToString(&buf)) {\n return Status(error::GoogleError::INVALID_ARGUMENT,\n \"Failed to serialize EnclaveFinal\");\n }\n\n char *output = nullptr;\n size_t output_len = 0;\n\n ASYLO_RETURN_IF_ERROR(\n finalize(id_, buf.data(), buf.size(), &output, &output_len));\n\n \/\/ Enclave entry-point was successfully invoked. |output| is guaranteed to\n \/\/ have a value.\n StatusProto status_proto;\n status_proto.ParseFromArray(output, output_len);\n Status status;\n status.RestoreFrom(status_proto);\n\n \/\/ |output| points to an untrusted memory buffer allocated by the enclave. It\n \/\/ is the untrusted caller's responsibility to free this buffer.\n free(output);\n\n return status;\n}\n\nStatus SgxClient::EnterAndDonateThread() {\n sgx_status_t sgx_status;\n int result = donate_thread(id_, &sgx_status);\n Status status;\n if (sgx_status != SGX_SUCCESS) {\n status = Status(sgx_status, \"Failed to donate thread to enclave\");\n } else if (result) {\n status = Status(static_cast<error::PosixError>(result),\n \"Failed to donate thread to enclave\");\n }\n if (!status.ok()) {\n LOG(ERROR) << \"EnterAndDonateThread failed \" << status;\n }\n return status;\n}\n\nStatus SgxClient::EnterAndHandleSignal(const EnclaveSignal &signal) {\n EnclaveSignal enclave_signal;\n int bridge_signum = ToBridgeSignal(signal.signum());\n if (bridge_signum < 0) {\n return Status(error::GoogleError::INVALID_ARGUMENT,\n absl::StrCat(\"Failed to convert signum (\", signal.signum(),\n \") to bridge signum\"));\n }\n enclave_signal.set_signum(bridge_signum);\n std::string serialized_enclave_signal;\n if (!enclave_signal.SerializeToString(&serialized_enclave_signal)) {\n return Status(error::GoogleError::INVALID_ARGUMENT,\n \"Failed to serialize EnclaveSignal\");\n }\n return handle_signal(id_, serialized_enclave_signal.data(),\n serialized_enclave_signal.size());\n}\n\nStatus SgxClient::DestroyEnclave() {\n sgx_status_t rc = sgx_destroy_enclave(id_);\n if (rc != SGX_SUCCESS) {\n return Status(rc, \"Failed to destroy an enclave\");\n }\n return Status::OkStatus();\n}\n\nbool SgxClient::IsTcsActive() { return (sgx_is_tcs_active(id_) != 0); }\n\n} \/\/ namespace asylo\n<|endoftext|>"} {"text":"<commit_before>\/* auto_encoder_stack.cc -*- C++ -*-\n Jeremy Barnes, 11 November 2009\n Copyright (c) 2009 Jeremy Barnes. All rights reserved.\n\n Implementation of a stack of auto-encoders.\n*\/\n\n#include \"auto_encoder_stack.h\"\n#include \"boosting\/registry.h\"\n#include \"layer_stack_impl.h\"\n\n\nnamespace ML {\n\n\n\/*****************************************************************************\/\n\/* AUTO_ENCODER_STACK *\/\n\/*****************************************************************************\/\n\n\/** A stack of auto-encoders, that acts as a whole like an auto-encoder. *\/\n\nAuto_Encoder_Stack::\nAuto_Encoder_Stack()\n{\n}\n\nAuto_Encoder_Stack::\nAuto_Encoder_Stack(const std::string & name)\n : layers_(name)\n{\n}\n\nAuto_Encoder_Stack::\nAuto_Encoder_Stack(const Auto_Encoder_Stack & other, Deep_Copy_Tag)\n : Auto_Encoder(other),\n layers_(other.layers_, Deep_Copy_Tag())\n{\n}\n\nvoid\nAuto_Encoder_Stack::\nswap(Auto_Encoder_Stack & other)\n{\n layers_.swap(other.layers_);\n}\n\nvoid\nAuto_Encoder_Stack::\nclear()\n{\n layers_.clear();\n}\n\nvoid\nAuto_Encoder_Stack::\nadd(Auto_Encoder * layer)\n{\n layers_.add(layer);\n Layer::init(name(), layers_.inputs(), layers_.outputs());\n update_parameters();\n}\n\nvoid\nAuto_Encoder_Stack::\nadd(boost::shared_ptr<Auto_Encoder> layer)\n{\n layers_.add(layer);\n Layer::init(name(), layers_.inputs(), layers_.outputs());\n update_parameters();\n}\n\nstd::string\nAuto_Encoder_Stack::\nprint() const\n{\n return layers_.print();\n}\n\nstd::string\nAuto_Encoder_Stack::\nclass_id() const\n{\n return \"Auto_Encoder_Stack\";\n}\n\nvoid\nAuto_Encoder_Stack::\nserialize(DB::Store_Writer & store) const\n{\n store << (char)1 \/\/ version\n << layers_;\n}\n\nvoid\nAuto_Encoder_Stack::\nreconstitute(DB::Store_Reader & store)\n{\n char version;\n store >> version;\n if (version != 1)\n throw Exception(\"Auto_Encoder_Stack::reconstitute(): invalid version\");\n store >> layers_;\n}\n\nvoid\nAuto_Encoder_Stack::\nadd_parameters(Parameters & params)\n{\n layers_.add_parameters(params);\n}\n\nvoid\nAuto_Encoder_Stack::\napply(const float * input, float * output) const\n{\n return layers_.apply(input, output);\n}\n\nvoid\nAuto_Encoder_Stack::\napply(const double * input, double * output) const\n{\n return layers_.apply(input, output);\n}\n\nsize_t\nAuto_Encoder_Stack::\nfprop_temporary_space_required() const\n{\n return layers_.fprop_temporary_space_required();\n}\n\nvoid\nAuto_Encoder_Stack::\nfprop(const float * inputs,\n float * temp_space, size_t temp_space_size,\n float * outputs) const\n{\n layers_.fprop(inputs, temp_space, temp_space_size, outputs);\n}\n\nvoid\nAuto_Encoder_Stack::\nfprop(const double * inputs,\n double * temp_space, size_t temp_space_size,\n double * outputs) const\n{\n layers_.fprop(inputs, temp_space, temp_space_size, outputs);\n}\n\nvoid\nAuto_Encoder_Stack::\nbprop(const float * inputs,\n const float * outputs,\n const float * temp_space, size_t temp_space_size,\n const float * output_errors,\n float * input_errors,\n Parameters & gradient,\n double example_weight) const\n{\n layers_.bprop(inputs, outputs, temp_space, temp_space_size,\n output_errors, input_errors, gradient, example_weight);\n}\n\nvoid\nAuto_Encoder_Stack::\nbprop(const double * inputs,\n const double * outputs,\n const double * temp_space, size_t temp_space_size,\n const double * output_errors,\n double * input_errors,\n Parameters & gradient,\n double example_weight) const\n{\n layers_.bprop(inputs, outputs, temp_space, temp_space_size,\n output_errors, input_errors, gradient, example_weight);\n}\n\nvoid\nAuto_Encoder_Stack::\niapply(const float * output, float * input) const\n{\n iapply<float>(output, input);\n}\n\nvoid\nAuto_Encoder_Stack::\niapply(const double * output, double * input) const\n{\n iapply<double>(output, input);\n}\n\ntemplate<typename F>\nvoid\nAuto_Encoder_Stack::\niapply(const F * output, F * input) const\n{\n F tmp[layers_.max_internal_width()];\n\n for (int l = layers_.size() - 1; l >= 0; --l) {\n F * i = (l == 0 ? input : tmp);\n const F * o = (l == layers_.size() - 1 ? output : tmp);\n\n layers_[l].iapply(o, i);\n }\n}\n\nsize_t\nAuto_Encoder_Stack::\nifprop_temporary_space_required() const\n{\n \/\/ We need: inputs of all layers except the first,\n \/\/ temporary space of all layers in between.\n \/\/\n \/\/ +-----------+-------+-------------+--------+---...\n \/\/ | l0 tmp | l0 out| l1 tmp | l1 out| l2 tmp\n \/\/ +-----------+-------+-------------+--------+---...\n\n size_t result = 0;\n\n for (unsigned i = 0; i < size(); ++i) {\n if (i != 0) result += layers_[i].inputs();\n result += layers_[i].ifprop_temporary_space_required();\n }\n\n return result;\n}\n\nvoid\nAuto_Encoder_Stack::\nifprop(const float * outputs,\n float * temp_space, size_t temp_space_size,\n float * inputs) const\n{\n ifprop<float>(outputs, temp_space, temp_space_size, inputs);\n}\n\nvoid\nAuto_Encoder_Stack::\nifprop(const double * outputs,\n double * temp_space, size_t temp_space_size,\n double * inputs) const\n{\n ifprop<double>(outputs, temp_space, temp_space_size, inputs);\n}\n\ntemplate<typename F>\nvoid\nAuto_Encoder_Stack::\nifprop(const F * outputs,\n F * temp_space, size_t temp_space_size,\n F * inputs) const\n{\n F * temp_space_start = temp_space;\n F * temp_space_end = temp_space_start + temp_space_size;\n\n const F * curr_outputs = outputs;\n\n for (int i = size() - 1; i >= 0; --i) {\n int layer_temp_space_size\n = layers_[i].ifprop_temporary_space_required();\n\n F * curr_inputs\n = (i == 0\n ? inputs\n : temp_space + layer_temp_space_size);\n \n layers_[i].ifprop(curr_outputs, temp_space, layer_temp_space_size,\n curr_inputs);\n\n curr_outputs = curr_inputs;\n\n temp_space += layer_temp_space_size;\n if (i != 0) temp_space += layers_[i].inputs();\n\n if (temp_space > temp_space_end\n || (i == 0 && temp_space != temp_space_end))\n throw Exception(\"temp space out of sync\");\n }\n}\n\nvoid\nAuto_Encoder_Stack::\nibprop(const float * outputs,\n const float * inputs,\n const float * temp_space, size_t temp_space_size,\n const float * input_errors,\n float * output_errors,\n Parameters & gradient,\n double example_weight) const\n{\n ibprop<float>(outputs, inputs, temp_space, temp_space_size,\n input_errors, output_errors, gradient, example_weight);\n}\n\nvoid\nAuto_Encoder_Stack::\nibprop(const double * outputs,\n const double * inputs,\n const double * temp_space, size_t temp_space_size,\n const double * input_errors,\n double * output_errors,\n Parameters & gradient,\n double example_weight) const\n{\n ibprop<double>(outputs, inputs, temp_space, temp_space_size,\n input_errors, output_errors, gradient, example_weight);\n}\n\ntemplate<typename F>\nvoid\nAuto_Encoder_Stack::\nibprop(const F * outputs,\n const F * inputs,\n const F * temp_space, size_t temp_space_size,\n const F * input_errors,\n F * output_errors,\n Parameters & gradient,\n double example_weight) const\n{\n const F * temp_space_start = temp_space;\n const F * temp_space_end = temp_space_start + temp_space_size;\n const F * curr_temp_space = temp_space_end;\n\n const F * curr_inputs = inputs;\n\n \/\/ Storage for the errors kept between the layers\n F error_storage[layers_.max_internal_width()];\n\n for (int i = 0; i < layers_.size(); ++i) {\n int layer_temp_space_size\n = layers_[i].ifprop_temporary_space_required();\n\n curr_temp_space -= layer_temp_space_size;\n\n const F * curr_outputs\n = (i == size() - 1\n ? outputs\n : curr_temp_space - layers_[i].outputs());\n\n const F * curr_input_errors\n = (i == 0 ? input_errors : error_storage);\n\n F * curr_output_errors\n = (i == size() - 1 ? output_errors : error_storage);\n\n layers_[i].ibprop(curr_outputs, curr_inputs, curr_temp_space,\n layer_temp_space_size, curr_input_errors,\n curr_output_errors,\n gradient.subparams(i, layers_[i].name()),\n example_weight);\n\n if (curr_temp_space < temp_space_start)\n throw Exception(\"Layer temp space was out of sync\");\n\n curr_inputs = curr_outputs;\n if (i != layers_.size() - 1) curr_temp_space -= layers_[i].outputs();\n }\n \n if (curr_temp_space != temp_space_start)\n throw Exception(\"Layer_Stack::bprop(): out of sync\");\n}\n\nvoid\nAuto_Encoder_Stack::\nrandom_fill(float limit, Thread_Context & context)\n{\n layers_.random_fill(limit, context);\n}\n\nvoid\nAuto_Encoder_Stack::\nzero_fill()\n{\n layers_.zero_fill();\n}\n\nsize_t\nAuto_Encoder_Stack::\nparameter_count() const\n{\n return layers_.parameter_count();\n}\n\nstd::pair<float, float>\nAuto_Encoder_Stack::\ntargets(float maximum) const\n{\n return layers_.targets(maximum);\n}\n\nAuto_Encoder_Stack *\nAuto_Encoder_Stack::\nmake_copy() const\n{\n return new Auto_Encoder_Stack(*this);\n}\n\nAuto_Encoder_Stack *\nAuto_Encoder_Stack::\ndeep_copy() const\n{\n return new Auto_Encoder_Stack(*this, Deep_Copy_Tag());\n}\n\nbool\nAuto_Encoder_Stack::\nequal_impl(const Layer & other) const\n{\n if (typeid(*this) != typeid(other)) return false;\n return layers_.equal_impl(other);\n}\n\nbool\nAuto_Encoder_Stack::\noperator == (const Auto_Encoder_Stack & other) const\n{\n return layers_.operator == (other.layers_);\n}\n\nnamespace {\n\nRegister_Factory<Layer, Auto_Encoder_Stack>\nAES_REGISTER(\"Auto_Encoder_Stack\");\n\n} \/\/ file scope\n\ntemplate class Layer_Stack<Auto_Encoder>;\n\n\n} \/\/ namespace ML\n<commit_msg>NaN checking in auto_encoder implementation<commit_after>\/* auto_encoder_stack.cc -*- C++ -*-\n Jeremy Barnes, 11 November 2009\n Copyright (c) 2009 Jeremy Barnes. All rights reserved.\n\n Implementation of a stack of auto-encoders.\n*\/\n\n#undef NDEBUG\n\n#include \"auto_encoder_stack.h\"\n#include \"boosting\/registry.h\"\n#include \"layer_stack_impl.h\"\n#include \"utils\/check_not_nan.h\"\n\n\nusing namespace std;\n\n\nnamespace ML {\n\n\n\/*****************************************************************************\/\n\/* AUTO_ENCODER_STACK *\/\n\/*****************************************************************************\/\n\n\/** A stack of auto-encoders, that acts as a whole like an auto-encoder. *\/\n\nAuto_Encoder_Stack::\nAuto_Encoder_Stack()\n{\n}\n\nAuto_Encoder_Stack::\nAuto_Encoder_Stack(const std::string & name)\n : layers_(name)\n{\n}\n\nAuto_Encoder_Stack::\nAuto_Encoder_Stack(const Auto_Encoder_Stack & other, Deep_Copy_Tag)\n : Auto_Encoder(other),\n layers_(other.layers_, Deep_Copy_Tag())\n{\n}\n\nvoid\nAuto_Encoder_Stack::\nswap(Auto_Encoder_Stack & other)\n{\n layers_.swap(other.layers_);\n}\n\nvoid\nAuto_Encoder_Stack::\nclear()\n{\n layers_.clear();\n}\n\nvoid\nAuto_Encoder_Stack::\nadd(Auto_Encoder * layer)\n{\n layers_.add(layer);\n Layer::init(name(), layers_.inputs(), layers_.outputs());\n update_parameters();\n}\n\nvoid\nAuto_Encoder_Stack::\nadd(boost::shared_ptr<Auto_Encoder> layer)\n{\n layers_.add(layer);\n Layer::init(name(), layers_.inputs(), layers_.outputs());\n update_parameters();\n}\n\nstd::string\nAuto_Encoder_Stack::\nprint() const\n{\n return layers_.print();\n}\n\nstd::string\nAuto_Encoder_Stack::\nclass_id() const\n{\n return \"Auto_Encoder_Stack\";\n}\n\nvoid\nAuto_Encoder_Stack::\nserialize(DB::Store_Writer & store) const\n{\n store << (char)1 \/\/ version\n << layers_;\n}\n\nvoid\nAuto_Encoder_Stack::\nreconstitute(DB::Store_Reader & store)\n{\n char version;\n store >> version;\n if (version != 1)\n throw Exception(\"Auto_Encoder_Stack::reconstitute(): invalid version\");\n store >> layers_;\n}\n\nvoid\nAuto_Encoder_Stack::\nadd_parameters(Parameters & params)\n{\n layers_.add_parameters(params);\n}\n\nvoid\nAuto_Encoder_Stack::\napply(const float * input, float * output) const\n{\n return layers_.apply(input, output);\n}\n\nvoid\nAuto_Encoder_Stack::\napply(const double * input, double * output) const\n{\n return layers_.apply(input, output);\n}\n\nsize_t\nAuto_Encoder_Stack::\nfprop_temporary_space_required() const\n{\n return layers_.fprop_temporary_space_required();\n}\n\nvoid\nAuto_Encoder_Stack::\nfprop(const float * inputs,\n float * temp_space, size_t temp_space_size,\n float * outputs) const\n{\n layers_.fprop(inputs, temp_space, temp_space_size, outputs);\n}\n\nvoid\nAuto_Encoder_Stack::\nfprop(const double * inputs,\n double * temp_space, size_t temp_space_size,\n double * outputs) const\n{\n layers_.fprop(inputs, temp_space, temp_space_size, outputs);\n}\n\nvoid\nAuto_Encoder_Stack::\nbprop(const float * inputs,\n const float * outputs,\n const float * temp_space, size_t temp_space_size,\n const float * output_errors,\n float * input_errors,\n Parameters & gradient,\n double example_weight) const\n{\n layers_.bprop(inputs, outputs, temp_space, temp_space_size,\n output_errors, input_errors, gradient, example_weight);\n}\n\nvoid\nAuto_Encoder_Stack::\nbprop(const double * inputs,\n const double * outputs,\n const double * temp_space, size_t temp_space_size,\n const double * output_errors,\n double * input_errors,\n Parameters & gradient,\n double example_weight) const\n{\n layers_.bprop(inputs, outputs, temp_space, temp_space_size,\n output_errors, input_errors, gradient, example_weight);\n}\n\nvoid\nAuto_Encoder_Stack::\niapply(const float * output, float * input) const\n{\n iapply<float>(output, input);\n}\n\nvoid\nAuto_Encoder_Stack::\niapply(const double * output, double * input) const\n{\n iapply<double>(output, input);\n}\n\ntemplate<typename F>\nvoid\nAuto_Encoder_Stack::\niapply(const F * output, F * input) const\n{\n F tmp[layers_.max_internal_width()];\n\n for (int l = layers_.size() - 1; l >= 0; --l) {\n F * i = (l == 0 ? input : tmp);\n const F * o = (l == layers_.size() - 1 ? output : tmp);\n\n layers_[l].iapply(o, i);\n }\n}\n\nsize_t\nAuto_Encoder_Stack::\nifprop_temporary_space_required() const\n{\n \/\/ We need: inputs of all layers except the first,\n \/\/ temporary space of all layers in between.\n \/\/\n \/\/ +-----------+-------+-------------+--------+---...\n \/\/ | l0 tmp | l0 out| l1 tmp | l1 out| l2 tmp\n \/\/ +-----------+-------+-------------+--------+---...\n\n size_t result = 0;\n\n for (unsigned i = 0; i < size(); ++i) {\n if (i != 0) result += layers_[i].inputs();\n result += layers_[i].ifprop_temporary_space_required();\n }\n\n return result;\n}\n\nvoid\nAuto_Encoder_Stack::\nifprop(const float * outputs,\n float * temp_space, size_t temp_space_size,\n float * inputs) const\n{\n ifprop<float>(outputs, temp_space, temp_space_size, inputs);\n}\n\nvoid\nAuto_Encoder_Stack::\nifprop(const double * outputs,\n double * temp_space, size_t temp_space_size,\n double * inputs) const\n{\n ifprop<double>(outputs, temp_space, temp_space_size, inputs);\n}\n\ntemplate<typename F>\nvoid\nAuto_Encoder_Stack::\nifprop(const F * outputs,\n F * temp_space, size_t temp_space_size,\n F * inputs) const\n{\n F * temp_space_start = temp_space;\n F * temp_space_end = temp_space_start + temp_space_size;\n\n const F * curr_outputs = outputs;\n\n for (int i = size() - 1; i >= 0; --i) {\n int layer_temp_space_size\n = layers_[i].ifprop_temporary_space_required();\n\n F * curr_inputs\n = (i == 0\n ? inputs\n : temp_space + layer_temp_space_size);\n \n layers_[i].ifprop(curr_outputs, temp_space, layer_temp_space_size,\n curr_inputs);\n\n curr_outputs = curr_inputs;\n\n temp_space += layer_temp_space_size;\n if (i != 0) temp_space += layers_[i].inputs();\n\n if (temp_space > temp_space_end\n || (i == 0 && temp_space != temp_space_end))\n throw Exception(\"temp space out of sync\");\n }\n}\n\nvoid\nAuto_Encoder_Stack::\nibprop(const float * outputs,\n const float * inputs,\n const float * temp_space, size_t temp_space_size,\n const float * input_errors,\n float * output_errors,\n Parameters & gradient,\n double example_weight) const\n{\n ibprop<float>(outputs, inputs, temp_space, temp_space_size,\n input_errors, output_errors, gradient, example_weight);\n}\n\nvoid\nAuto_Encoder_Stack::\nibprop(const double * outputs,\n const double * inputs,\n const double * temp_space, size_t temp_space_size,\n const double * input_errors,\n double * output_errors,\n Parameters & gradient,\n double example_weight) const\n{\n ibprop<double>(outputs, inputs, temp_space, temp_space_size,\n input_errors, output_errors, gradient, example_weight);\n}\n\ntemplate<typename F>\nvoid\nAuto_Encoder_Stack::\nibprop(const F * outputs,\n const F * inputs,\n const F * temp_space, size_t temp_space_size,\n const F * input_errors,\n F * output_errors,\n Parameters & gradient,\n double example_weight) const\n{\n int ni = this->inputs(), no = this->outputs();\n\n CHECK_NOT_NAN_N(outputs, no);\n CHECK_NOT_NAN_N(inputs, ni);\n CHECK_NOT_NAN_N(input_errors, ni);\n \n const F * temp_space_start = temp_space;\n const F * temp_space_end = temp_space_start + temp_space_size;\n const F * curr_temp_space = temp_space_end;\n\n const F * curr_inputs = inputs;\n\n \/\/ Storage for the errors kept between the layers\n F error_storage[layers_.max_internal_width()];\n\n for (int i = 0; i < layers_.size(); ++i) {\n int layer_temp_space_size\n = layers_[i].ifprop_temporary_space_required();\n\n curr_temp_space -= layer_temp_space_size;\n\n const F * curr_outputs\n = (i == size() - 1\n ? outputs\n : curr_temp_space - layers_[i].outputs());\n\n const F * curr_input_errors\n = (i == 0 ? input_errors : error_storage);\n \n F * curr_output_errors\n = (i == size() - 1 ? output_errors : error_storage);\n\n \/\/cerr << \"i = \" << i << endl;\n\n layers_[i].ibprop(curr_outputs, curr_inputs, curr_temp_space,\n layer_temp_space_size, curr_input_errors,\n curr_output_errors,\n gradient.subparams(i, layers_[i].name()),\n example_weight);\n\n if (curr_temp_space < temp_space_start)\n throw Exception(\"Layer temp space was out of sync\");\n\n curr_inputs = curr_outputs;\n if (i != layers_.size() - 1) curr_temp_space -= layers_[i].outputs();\n }\n \n if (curr_temp_space != temp_space_start)\n throw Exception(\"Layer_Stack::bprop(): out of sync\");\n}\n\nvoid\nAuto_Encoder_Stack::\nrandom_fill(float limit, Thread_Context & context)\n{\n layers_.random_fill(limit, context);\n}\n\nvoid\nAuto_Encoder_Stack::\nzero_fill()\n{\n layers_.zero_fill();\n}\n\nsize_t\nAuto_Encoder_Stack::\nparameter_count() const\n{\n return layers_.parameter_count();\n}\n\nstd::pair<float, float>\nAuto_Encoder_Stack::\ntargets(float maximum) const\n{\n return layers_.targets(maximum);\n}\n\nAuto_Encoder_Stack *\nAuto_Encoder_Stack::\nmake_copy() const\n{\n return new Auto_Encoder_Stack(*this);\n}\n\nAuto_Encoder_Stack *\nAuto_Encoder_Stack::\ndeep_copy() const\n{\n return new Auto_Encoder_Stack(*this, Deep_Copy_Tag());\n}\n\nbool\nAuto_Encoder_Stack::\nequal_impl(const Layer & other) const\n{\n if (typeid(*this) != typeid(other)) return false;\n return layers_.equal_impl(other);\n}\n\nbool\nAuto_Encoder_Stack::\noperator == (const Auto_Encoder_Stack & other) const\n{\n return layers_.operator == (other.layers_);\n}\n\nnamespace {\n\nRegister_Factory<Layer, Auto_Encoder_Stack>\nAES_REGISTER(\"Auto_Encoder_Stack\");\n\n} \/\/ file scope\n\ntemplate class Layer_Stack<Auto_Encoder>;\n\n\n} \/\/ namespace ML\n<|endoftext|>"} {"text":"<commit_before><commit_msg>fdo#52204 add more diacritics for Arabic<commit_after><|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 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#include <algorithm> \/\/ sort\n#include <iomanip>\n#include <iostream>\n#include <set>\n#include <sstream>\n#include <vector>\n\n#include <assert.h>\n#include <map>\n#include <nupic\/math\/ArrayAlgo.hpp> \/\/ is_in\n#include <nupic\/math\/StlIo.hpp> \/\/ binary_save\n#include <nupic\/utils\/Log.hpp>\n#include <nupic\/utils\/Random.hpp>\n\n#include <nupic\/algorithms\/Segment.hpp>\n\nusing namespace nupic::algorithms::Cells4;\n\n\/\/----------------------------------------------------------------------\n\/**\n * Utility routine. Given a src cell index, prints synapse as:\n * [column, cell within col]\n *\/\nvoid printSynapse(UInt srcCellIdx, UInt nCellsPerCol) {\n UInt col = (UInt)(srcCellIdx \/ nCellsPerCol);\n UInt cell = srcCellIdx - col * nCellsPerCol;\n std::cout << \"[\" << col << \",\" << cell << \"] \";\n}\n\n\/\/----------------------------------------------------------------------\nSegment::Segment(InSynapses _s, Real frequency, bool seqSegFlag,\n Real permConnected, UInt iteration)\n : _totalActivations(1), _positiveActivations(1), _lastActiveIteration(0),\n _lastPosDutyCycle(1.0 \/ iteration), _lastPosDutyCycleIteration(iteration),\n _seqSegFlag(seqSegFlag), _frequency(frequency), _synapses(std::move(_s)),\n _nConnected(0) {\n for (UInt i = 0; i != _synapses.size(); ++i)\n if (_synapses[i].permanence() >= permConnected)\n ++_nConnected;\n\n std::sort(_synapses.begin(), _synapses.end(), InSynapseOrder());\n NTA_ASSERT(invariants());\n}\n\n\/\/--------------------------------------------------------------------------------\nSegment &Segment::operator=(const Segment &o) {\n if (&o != this) {\n _seqSegFlag = o._seqSegFlag;\n _frequency = o._frequency;\n _synapses = o._synapses;\n _nConnected = o._nConnected;\n _totalActivations = o._totalActivations;\n _positiveActivations = o._positiveActivations;\n _lastActiveIteration = o._lastActiveIteration;\n _lastPosDutyCycle = o._lastPosDutyCycle;\n _lastPosDutyCycleIteration = o._lastPosDutyCycleIteration;\n }\n NTA_ASSERT(invariants());\n return *this;\n}\n\n\/\/--------------------------------------------------------------------------------\nbool Segment::operator==(const Segment &other) const {\n if (_totalActivations != other._totalActivations ||\n _positiveActivations != other._positiveActivations ||\n _lastActiveIteration != other._lastActiveIteration ||\n !nearlyEqual(_lastPosDutyCycle, other._lastPosDutyCycle) ||\n _lastPosDutyCycleIteration != other._lastPosDutyCycleIteration ||\n _seqSegFlag != other._seqSegFlag ||\n !nearlyEqual(_frequency, other._frequency) ||\n _nConnected != other._nConnected) {\n return false;\n }\n return _synapses == other._synapses;\n}\n\n\/\/--------------------------------------------------------------------------------\nSegment::Segment(const Segment &o)\n : _totalActivations(o._totalActivations),\n _positiveActivations(o._positiveActivations),\n _lastActiveIteration(o._lastActiveIteration),\n _lastPosDutyCycle(o._lastPosDutyCycle),\n _lastPosDutyCycleIteration(o._lastPosDutyCycleIteration),\n _seqSegFlag(o._seqSegFlag), _frequency(o._frequency),\n _synapses(o._synapses), _nConnected(o._nConnected) {\n NTA_ASSERT(invariants());\n}\n\nbool Segment::isActive(const CState &activities, Real permConnected,\n UInt activationThreshold) const {\n { NTA_ASSERT(invariants()); }\n\n UInt activity = 0;\n\n if (_nConnected < activationThreshold)\n return false;\n\n \/\/ TODO: maintain nPermConnected incrementally??\n for (UInt i = 0; i != size() && activity < activationThreshold; ++i)\n if (_synapses[i].permanence() >= permConnected &&\n activities.isSet(_synapses[i].srcCellIdx()))\n activity++;\n\n return activity >= activationThreshold;\n}\n\n\/\/----------------------------------------------------------------------\n\/**\n * Compute\/update and return the positive activations duty cycle of\n * this segment. This is a measure of how often this segment is\n * providing good predictions.\n *\n *\/\nReal Segment::dutyCycle(UInt iteration, bool active, bool readOnly) {\n { NTA_ASSERT(iteration > 0); }\n\n Real dutyCycle = 0.0;\n\n \/\/ For tier 0, compute it from total number of positive activations seen\n if (iteration <= _dutyCycleTiers[1]) {\n dutyCycle = ((Real)_positiveActivations) \/ iteration;\n if (!readOnly) {\n _lastPosDutyCycleIteration = iteration;\n _lastPosDutyCycle = dutyCycle;\n }\n return dutyCycle;\n }\n\n \/\/ How old is our update?\n UInt age = iteration - _lastPosDutyCycleIteration;\n\n \/\/ If it's already up to date we can return our cached value\n if (age == 0 && !active)\n return _lastPosDutyCycle;\n\n \/\/ Figure out which alpha we're using\n Real alpha = 0;\n for (UInt tierIdx = _numTiers - 1; tierIdx > 0; tierIdx--) {\n if (iteration > _dutyCycleTiers[tierIdx]) {\n alpha = _dutyCycleAlphas[tierIdx];\n break;\n }\n }\n\n \/\/ Update duty cycle\n dutyCycle = (Real)pow((Real64)(1.0 - alpha), (Real64)age) * _lastPosDutyCycle;\n if (active)\n dutyCycle += alpha;\n\n \/\/ Update the time we computed it\n if (!readOnly) {\n _lastPosDutyCycle = dutyCycle;\n _lastPosDutyCycleIteration = iteration;\n }\n\n return dutyCycle;\n}\n\nUInt Segment::computeActivity(const CState &activities, Real permConnected,\n bool connectedSynapsesOnly) const\n\n{\n { NTA_ASSERT(invariants()); }\n\n UInt activity = 0;\n\n if (connectedSynapsesOnly) {\n for (UInt i = 0; i != size(); ++i)\n if (activities.isSet(_synapses[i].srcCellIdx()) &&\n (_synapses[i].permanence() >= permConnected))\n activity++;\n } else {\n for (UInt i = 0; i != size(); ++i)\n if (activities.isSet(_synapses[i].srcCellIdx()))\n activity++;\n }\n\n return activity;\n}\n\nvoid Segment::addSynapses(const std::set<UInt> &srcCells, Real initStrength,\n Real permConnected) {\n auto srcCellIdx = srcCells.begin();\n\n for (; srcCellIdx != srcCells.end(); ++srcCellIdx) {\n _synapses.push_back(InSynapse(*srcCellIdx, initStrength));\n if (initStrength >= permConnected)\n ++_nConnected;\n }\n\n sort(_synapses, InSynapseOrder());\n NTA_ASSERT(invariants()); \/\/ will catch non-unique synapses\n}\n\nvoid Segment::decaySynapses(Real decay, std::vector<UInt> &removed,\n Real permConnected, bool doDecay) {\n NTA_ASSERT(invariants());\n\n if (_synapses.empty())\n return;\n\n static std::vector<UInt> del;\n del.clear(); \/\/ purge residual data\n\n for (UInt i = 0; i != _synapses.size(); ++i) {\n\n int wasConnected = (int)(_synapses[i].permanence() >= permConnected);\n\n if (_synapses[i].permanence() < decay) {\n\n removed.push_back(_synapses[i].srcCellIdx());\n del.push_back(i);\n\n } else if (doDecay) {\n _synapses[i].permanence() -= decay;\n }\n\n int isConnected = (int)(_synapses[i].permanence() >= permConnected);\n\n _nConnected += isConnected - wasConnected;\n }\n\n _removeSynapses(del);\n\n NTA_ASSERT(invariants());\n}\n\n\/\/--------------------------------------------------------------------------------\n\/**\n * Subtract decay from each synapses' permanence value.\n * Synapses whose permanence drops below 0 are removed and their indices\n * are inserted into the \"removed\" list.\n *\n *\/\nvoid Segment::decaySynapses2(Real decay, std::vector<UInt> &removed,\n Real permConnected) {\n NTA_ASSERT(invariants());\n\n if (_synapses.empty())\n return;\n\n static std::vector<UInt> del;\n del.clear(); \/\/ purge residual data\n\n for (UInt i = 0; i != _synapses.size(); ++i) {\n\n \/\/ Remove synapse whose permanence will go to zero or below.\n if (_synapses[i].permanence() <= decay) {\n\n \/\/ If it was connected, reduce our connected count\n if (_synapses[i].permanence() >= permConnected)\n _nConnected--;\n\n \/\/ Add this synapse to list of synapses to be removed\n removed.push_back(_synapses[i].srcCellIdx());\n del.push_back(i);\n\n } else {\n\n _synapses[i].permanence() -= decay;\n\n \/\/ If it was connected and is now below permanence, reduce connected count\n if ((_synapses[i].permanence() + decay >= permConnected) &&\n (_synapses[i].permanence() < permConnected))\n _nConnected--;\n }\n }\n\n _removeSynapses(del);\n\n NTA_ASSERT(invariants());\n}\n\n\/\/-----------------------------------------------------------------------\n\/**\n * Sort order for InSynapse's. Cells are sorted in order of increasing\n * permanence.\n *\n *\/\nstruct InPermanenceOrder {\n inline bool operator()(const InSynapse &a, const InSynapse &b) const {\n return a.permanence() < b.permanence();\n }\n};\n\n\/\/-----------------------------------------------------------------------\n\/**\n * Sort order for list of source cell indices. Cells are sorted in order of\n * increasing source cell index.\n *\n *\/\nstruct InSrcCellOrder {\n inline bool operator()(const UInt a, const UInt b) const { return a < b; }\n};\n\n\/\/----------------------------------------------------------------------\n\/**\n * Free up some synapses in this segment. We always free up inactive\n * synapses (lowest permanence freed up first) before we start to free\n * up active ones.\n *\/\nvoid Segment::freeNSynapses(UInt numToFree,\n std::vector<UInt> &inactiveSynapseIndices,\n std::vector<UInt> &inactiveSegmentIndices,\n std::vector<UInt> &activeSynapseIndices,\n std::vector<UInt> &activeSegmentIndices,\n std::vector<UInt> &removed, UInt verbosity,\n UInt nCellsPerCol, Real permMax) {\n NTA_ASSERT(inactiveSegmentIndices.size() == inactiveSynapseIndices.size());\n NTA_ASSERT(activeSegmentIndices.size() == activeSynapseIndices.size());\n NTA_ASSERT(numToFree <= _synapses.size());\n NTA_ASSERT(numToFree <=\n (inactiveSegmentIndices.size() + activeSegmentIndices.size()));\n\n if (verbosity >= 4) {\n std::cout << \"\\nIn CPP freeNSynapses with numToFree = \" << numToFree\n << \", inactiveSynapses = \";\n for (auto &inactiveSynapseIndice : inactiveSynapseIndices) {\n printSynapse(inactiveSynapseIndice, nCellsPerCol);\n }\n std::cout << \"\\n\";\n }\n\n \/\/----------------------------------------------------------------------\n \/\/ Collect candidate synapses for deletion\n\n \/\/ We first choose from inactive synapses, in order of increasing permanence\n InSynapses candidates;\n for (UInt i = 0; i < inactiveSegmentIndices.size(); i++) {\n \/\/ Put in *segment indices*, not source cell indices\n candidates.push_back(\n InSynapse(inactiveSegmentIndices[i],\n _synapses[inactiveSegmentIndices[i]].permanence()));\n }\n\n \/\/ If we need more, choose from active synapses in order of increasing\n \/\/ permanence values. This set has lower priority than inactive synapses\n \/\/ so we add a constant permanence value for sorting purposes\n if (candidates.size() < numToFree) {\n for (UInt i = 0; i < activeSegmentIndices.size(); i++) {\n \/\/ Put in *segment indices*, not source cell indices\n candidates.push_back(\n InSynapse(activeSegmentIndices[i],\n _synapses[activeSegmentIndices[i]].permanence() + permMax));\n }\n }\n\n \/\/ Now sort the list of candidate synapses\n std::stable_sort(candidates.begin(), candidates.end(), InPermanenceOrder());\n\n \/\/----------------------------------------------------------------------\n \/\/ Create the final list of synapses we will remove\n static std::vector<UInt> del;\n del.clear(); \/\/ purge residual data\n for (UInt i = 0; i < numToFree; i++) {\n del.push_back(candidates[i].srcCellIdx());\n UInt cellIdx = _synapses[candidates[i].srcCellIdx()].srcCellIdx();\n removed.push_back(cellIdx);\n }\n\n \/\/ Debug statements\n if (verbosity >= 4) {\n std::cout << \"Removing these synapses: \";\n for (auto &elem : removed) {\n printSynapse(elem, nCellsPerCol);\n }\n std::cout << \"\\n\";\n\n std::cout << \"Segment BEFORE remove synapses: \";\n print(std::cout, nCellsPerCol);\n std::cout << \"\\n\";\n }\n\n \/\/----------------------------------------------------------------------\n \/\/ Remove the synapses\n if (numToFree > 0) {\n std::sort(del.begin(), del.end(), InSrcCellOrder());\n _removeSynapses(del);\n }\n\n \/\/ Debug statements\n if (verbosity >= 4) {\n std::cout << \"Segment AFTER remove synapses: \";\n print(std::cout, nCellsPerCol);\n std::cout << \"\\n\";\n }\n}\n\nvoid Segment::print(std::ostream &outStream, UInt nCellsPerCol) const {\n outStream << (_seqSegFlag ? \"True \" : \"False \") << \"dc\"\n << std::setprecision(4) << _lastPosDutyCycle << \" (\"\n << _positiveActivations << \"\/\" << _totalActivations << \") \";\n for (UInt i = 0; i != _synapses.size(); ++i) {\n if (nCellsPerCol > 0) {\n UInt cellIdx = _synapses[i].srcCellIdx();\n UInt col = (UInt)(cellIdx \/ nCellsPerCol);\n UInt cell = cellIdx - col * nCellsPerCol;\n outStream << \"[\" << col << \",\" << cell << \"]\" << std::setprecision(4)\n << _synapses[i].permanence() << \" \";\n } else {\n outStream << _synapses[i];\n }\n if (i < _synapses.size() -1)\n outStream << \" \";\n }\n outStream << std::endl;\n}\n\nnamespace nupic{\n namespace algorithms {\n namespace Cells4 {\n\nstd::ostream &operator<<(std::ostream &outStream, const Segment &seg) {\n seg.print(outStream);\n return outStream;\n}\n\nstd::ostream &operator<<(std::ostream &outStream, const CState &cstate) {\n cstate.print(outStream);\n return outStream;\n}\n\nstd::ostream &operator<<(std::ostream &outStream, const CStateIndexed &cstate) {\n cstate.print(outStream);\n return outStream;\n}\n} \/\/ namespace Cells4\n} \/\/ namespace algorithms\n} \/\/ namespace nupic\n<commit_msg>Segment: fix equals redefinition<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 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#include <algorithm> \/\/ sort\n#include <iomanip>\n#include <iostream>\n#include <set>\n#include <sstream>\n#include <vector>\n\n#include <assert.h>\n#include <map>\n#include <nupic\/math\/ArrayAlgo.hpp> \/\/ is_in\n#include <nupic\/math\/StlIo.hpp> \/\/ binary_save\n#include <nupic\/utils\/Log.hpp>\n#include <nupic\/utils\/Random.hpp>\n\n#include <nupic\/algorithms\/Segment.hpp>\n\nusing namespace nupic::algorithms::Cells4;\n\n\/\/----------------------------------------------------------------------\n\/**\n * Utility routine. Given a src cell index, prints synapse as:\n * [column, cell within col]\n *\/\nvoid printSynapse(UInt srcCellIdx, UInt nCellsPerCol) {\n UInt col = (UInt)(srcCellIdx \/ nCellsPerCol);\n UInt cell = srcCellIdx - col * nCellsPerCol;\n std::cout << \"[\" << col << \",\" << cell << \"] \";\n}\n\n\/\/----------------------------------------------------------------------\nSegment::Segment(InSynapses _s, Real frequency, bool seqSegFlag,\n Real permConnected, UInt iteration)\n : _totalActivations(1), _positiveActivations(1), _lastActiveIteration(0),\n _lastPosDutyCycle(1.0 \/ iteration), _lastPosDutyCycleIteration(iteration),\n _seqSegFlag(seqSegFlag), _frequency(frequency), _synapses(std::move(_s)),\n _nConnected(0) {\n for (UInt i = 0; i != _synapses.size(); ++i)\n if (_synapses[i].permanence() >= permConnected)\n ++_nConnected;\n\n std::sort(_synapses.begin(), _synapses.end(), InSynapseOrder());\n NTA_ASSERT(invariants());\n}\n\n\/\/--------------------------------------------------------------------------------\nSegment &Segment::operator=(const Segment &o) {\n if (&o != this) {\n _seqSegFlag = o._seqSegFlag;\n _frequency = o._frequency;\n _synapses = o._synapses;\n _nConnected = o._nConnected;\n _totalActivations = o._totalActivations;\n _positiveActivations = o._positiveActivations;\n _lastActiveIteration = o._lastActiveIteration;\n _lastPosDutyCycle = o._lastPosDutyCycle;\n _lastPosDutyCycleIteration = o._lastPosDutyCycleIteration;\n }\n NTA_ASSERT(invariants());\n return *this;\n}\n\n\/\/--------------------------------------------------------------------------------\nbool Segment::equals(const Segment &other) const {\n if (_totalActivations != other._totalActivations ||\n _positiveActivations != other._positiveActivations ||\n _lastActiveIteration != other._lastActiveIteration ||\n !nearlyEqual(_lastPosDutyCycle, other._lastPosDutyCycle) ||\n _lastPosDutyCycleIteration != other._lastPosDutyCycleIteration ||\n _seqSegFlag != other._seqSegFlag ||\n !nearlyEqual(_frequency, other._frequency) ||\n _nConnected != other._nConnected) {\n return false;\n }\n return _synapses == other._synapses;\n}\n\n\/\/--------------------------------------------------------------------------------\nSegment::Segment(const Segment &o)\n : _totalActivations(o._totalActivations),\n _positiveActivations(o._positiveActivations),\n _lastActiveIteration(o._lastActiveIteration),\n _lastPosDutyCycle(o._lastPosDutyCycle),\n _lastPosDutyCycleIteration(o._lastPosDutyCycleIteration),\n _seqSegFlag(o._seqSegFlag), _frequency(o._frequency),\n _synapses(o._synapses), _nConnected(o._nConnected) {\n NTA_ASSERT(invariants());\n}\n\nbool Segment::isActive(const CState &activities, Real permConnected,\n UInt activationThreshold) const {\n { NTA_ASSERT(invariants()); }\n\n UInt activity = 0;\n\n if (_nConnected < activationThreshold)\n return false;\n\n \/\/ TODO: maintain nPermConnected incrementally??\n for (UInt i = 0; i != size() && activity < activationThreshold; ++i)\n if (_synapses[i].permanence() >= permConnected &&\n activities.isSet(_synapses[i].srcCellIdx()))\n activity++;\n\n return activity >= activationThreshold;\n}\n\n\/\/----------------------------------------------------------------------\n\/**\n * Compute\/update and return the positive activations duty cycle of\n * this segment. This is a measure of how often this segment is\n * providing good predictions.\n *\n *\/\nReal Segment::dutyCycle(UInt iteration, bool active, bool readOnly) {\n { NTA_ASSERT(iteration > 0); }\n\n Real dutyCycle = 0.0;\n\n \/\/ For tier 0, compute it from total number of positive activations seen\n if (iteration <= _dutyCycleTiers[1]) {\n dutyCycle = ((Real)_positiveActivations) \/ iteration;\n if (!readOnly) {\n _lastPosDutyCycleIteration = iteration;\n _lastPosDutyCycle = dutyCycle;\n }\n return dutyCycle;\n }\n\n \/\/ How old is our update?\n UInt age = iteration - _lastPosDutyCycleIteration;\n\n \/\/ If it's already up to date we can return our cached value\n if (age == 0 && !active)\n return _lastPosDutyCycle;\n\n \/\/ Figure out which alpha we're using\n Real alpha = 0;\n for (UInt tierIdx = _numTiers - 1; tierIdx > 0; tierIdx--) {\n if (iteration > _dutyCycleTiers[tierIdx]) {\n alpha = _dutyCycleAlphas[tierIdx];\n break;\n }\n }\n\n \/\/ Update duty cycle\n dutyCycle = (Real)pow((Real64)(1.0 - alpha), (Real64)age) * _lastPosDutyCycle;\n if (active)\n dutyCycle += alpha;\n\n \/\/ Update the time we computed it\n if (!readOnly) {\n _lastPosDutyCycle = dutyCycle;\n _lastPosDutyCycleIteration = iteration;\n }\n\n return dutyCycle;\n}\n\nUInt Segment::computeActivity(const CState &activities, Real permConnected,\n bool connectedSynapsesOnly) const\n\n{\n { NTA_ASSERT(invariants()); }\n\n UInt activity = 0;\n\n if (connectedSynapsesOnly) {\n for (UInt i = 0; i != size(); ++i)\n if (activities.isSet(_synapses[i].srcCellIdx()) &&\n (_synapses[i].permanence() >= permConnected))\n activity++;\n } else {\n for (UInt i = 0; i != size(); ++i)\n if (activities.isSet(_synapses[i].srcCellIdx()))\n activity++;\n }\n\n return activity;\n}\n\nvoid Segment::addSynapses(const std::set<UInt> &srcCells, Real initStrength,\n Real permConnected) {\n auto srcCellIdx = srcCells.begin();\n\n for (; srcCellIdx != srcCells.end(); ++srcCellIdx) {\n _synapses.push_back(InSynapse(*srcCellIdx, initStrength));\n if (initStrength >= permConnected)\n ++_nConnected;\n }\n\n sort(_synapses, InSynapseOrder());\n NTA_ASSERT(invariants()); \/\/ will catch non-unique synapses\n}\n\nvoid Segment::decaySynapses(Real decay, std::vector<UInt> &removed,\n Real permConnected, bool doDecay) {\n NTA_ASSERT(invariants());\n\n if (_synapses.empty())\n return;\n\n static std::vector<UInt> del;\n del.clear(); \/\/ purge residual data\n\n for (UInt i = 0; i != _synapses.size(); ++i) {\n\n int wasConnected = (int)(_synapses[i].permanence() >= permConnected);\n\n if (_synapses[i].permanence() < decay) {\n\n removed.push_back(_synapses[i].srcCellIdx());\n del.push_back(i);\n\n } else if (doDecay) {\n _synapses[i].permanence() -= decay;\n }\n\n int isConnected = (int)(_synapses[i].permanence() >= permConnected);\n\n _nConnected += isConnected - wasConnected;\n }\n\n _removeSynapses(del);\n\n NTA_ASSERT(invariants());\n}\n\n\/\/--------------------------------------------------------------------------------\n\/**\n * Subtract decay from each synapses' permanence value.\n * Synapses whose permanence drops below 0 are removed and their indices\n * are inserted into the \"removed\" list.\n *\n *\/\nvoid Segment::decaySynapses2(Real decay, std::vector<UInt> &removed,\n Real permConnected) {\n NTA_ASSERT(invariants());\n\n if (_synapses.empty())\n return;\n\n static std::vector<UInt> del;\n del.clear(); \/\/ purge residual data\n\n for (UInt i = 0; i != _synapses.size(); ++i) {\n\n \/\/ Remove synapse whose permanence will go to zero or below.\n if (_synapses[i].permanence() <= decay) {\n\n \/\/ If it was connected, reduce our connected count\n if (_synapses[i].permanence() >= permConnected)\n _nConnected--;\n\n \/\/ Add this synapse to list of synapses to be removed\n removed.push_back(_synapses[i].srcCellIdx());\n del.push_back(i);\n\n } else {\n\n _synapses[i].permanence() -= decay;\n\n \/\/ If it was connected and is now below permanence, reduce connected count\n if ((_synapses[i].permanence() + decay >= permConnected) &&\n (_synapses[i].permanence() < permConnected))\n _nConnected--;\n }\n }\n\n _removeSynapses(del);\n\n NTA_ASSERT(invariants());\n}\n\n\/\/-----------------------------------------------------------------------\n\/**\n * Sort order for InSynapse's. Cells are sorted in order of increasing\n * permanence.\n *\n *\/\nstruct InPermanenceOrder {\n inline bool operator()(const InSynapse &a, const InSynapse &b) const {\n return a.permanence() < b.permanence();\n }\n};\n\n\/\/-----------------------------------------------------------------------\n\/**\n * Sort order for list of source cell indices. Cells are sorted in order of\n * increasing source cell index.\n *\n *\/\nstruct InSrcCellOrder {\n inline bool operator()(const UInt a, const UInt b) const { return a < b; }\n};\n\n\/\/----------------------------------------------------------------------\n\/**\n * Free up some synapses in this segment. We always free up inactive\n * synapses (lowest permanence freed up first) before we start to free\n * up active ones.\n *\/\nvoid Segment::freeNSynapses(UInt numToFree,\n std::vector<UInt> &inactiveSynapseIndices,\n std::vector<UInt> &inactiveSegmentIndices,\n std::vector<UInt> &activeSynapseIndices,\n std::vector<UInt> &activeSegmentIndices,\n std::vector<UInt> &removed, UInt verbosity,\n UInt nCellsPerCol, Real permMax) {\n NTA_ASSERT(inactiveSegmentIndices.size() == inactiveSynapseIndices.size());\n NTA_ASSERT(activeSegmentIndices.size() == activeSynapseIndices.size());\n NTA_ASSERT(numToFree <= _synapses.size());\n NTA_ASSERT(numToFree <=\n (inactiveSegmentIndices.size() + activeSegmentIndices.size()));\n\n if (verbosity >= 4) {\n std::cout << \"\\nIn CPP freeNSynapses with numToFree = \" << numToFree\n << \", inactiveSynapses = \";\n for (auto &inactiveSynapseIndice : inactiveSynapseIndices) {\n printSynapse(inactiveSynapseIndice, nCellsPerCol);\n }\n std::cout << \"\\n\";\n }\n\n \/\/----------------------------------------------------------------------\n \/\/ Collect candidate synapses for deletion\n\n \/\/ We first choose from inactive synapses, in order of increasing permanence\n InSynapses candidates;\n for (UInt i = 0; i < inactiveSegmentIndices.size(); i++) {\n \/\/ Put in *segment indices*, not source cell indices\n candidates.push_back(\n InSynapse(inactiveSegmentIndices[i],\n _synapses[inactiveSegmentIndices[i]].permanence()));\n }\n\n \/\/ If we need more, choose from active synapses in order of increasing\n \/\/ permanence values. This set has lower priority than inactive synapses\n \/\/ so we add a constant permanence value for sorting purposes\n if (candidates.size() < numToFree) {\n for (UInt i = 0; i < activeSegmentIndices.size(); i++) {\n \/\/ Put in *segment indices*, not source cell indices\n candidates.push_back(\n InSynapse(activeSegmentIndices[i],\n _synapses[activeSegmentIndices[i]].permanence() + permMax));\n }\n }\n\n \/\/ Now sort the list of candidate synapses\n std::stable_sort(candidates.begin(), candidates.end(), InPermanenceOrder());\n\n \/\/----------------------------------------------------------------------\n \/\/ Create the final list of synapses we will remove\n static std::vector<UInt> del;\n del.clear(); \/\/ purge residual data\n for (UInt i = 0; i < numToFree; i++) {\n del.push_back(candidates[i].srcCellIdx());\n UInt cellIdx = _synapses[candidates[i].srcCellIdx()].srcCellIdx();\n removed.push_back(cellIdx);\n }\n\n \/\/ Debug statements\n if (verbosity >= 4) {\n std::cout << \"Removing these synapses: \";\n for (auto &elem : removed) {\n printSynapse(elem, nCellsPerCol);\n }\n std::cout << \"\\n\";\n\n std::cout << \"Segment BEFORE remove synapses: \";\n print(std::cout, nCellsPerCol);\n std::cout << \"\\n\";\n }\n\n \/\/----------------------------------------------------------------------\n \/\/ Remove the synapses\n if (numToFree > 0) {\n std::sort(del.begin(), del.end(), InSrcCellOrder());\n _removeSynapses(del);\n }\n\n \/\/ Debug statements\n if (verbosity >= 4) {\n std::cout << \"Segment AFTER remove synapses: \";\n print(std::cout, nCellsPerCol);\n std::cout << \"\\n\";\n }\n}\n\nvoid Segment::print(std::ostream &outStream, UInt nCellsPerCol) const {\n outStream << (_seqSegFlag ? \"True \" : \"False \") << \"dc\"\n << std::setprecision(4) << _lastPosDutyCycle << \" (\"\n << _positiveActivations << \"\/\" << _totalActivations << \") \";\n for (UInt i = 0; i != _synapses.size(); ++i) {\n if (nCellsPerCol > 0) {\n UInt cellIdx = _synapses[i].srcCellIdx();\n UInt col = (UInt)(cellIdx \/ nCellsPerCol);\n UInt cell = cellIdx - col * nCellsPerCol;\n outStream << \"[\" << col << \",\" << cell << \"]\" << std::setprecision(4)\n << _synapses[i].permanence() << \" \";\n } else {\n outStream << _synapses[i];\n }\n if (i < _synapses.size() -1)\n outStream << \" \";\n }\n outStream << std::endl;\n}\n\nnamespace nupic{\n namespace algorithms {\n namespace Cells4 {\n\nstd::ostream &operator<<(std::ostream &outStream, const Segment &seg) {\n seg.print(outStream);\n return outStream;\n}\n\nstd::ostream &operator<<(std::ostream &outStream, const CState &cstate) {\n cstate.print(outStream);\n return outStream;\n}\n\nstd::ostream &operator<<(std::ostream &outStream, const CStateIndexed &cstate) {\n cstate.print(outStream);\n return outStream;\n}\n} \/\/ namespace Cells4\n} \/\/ namespace algorithms\n} \/\/ namespace nupic\n<|endoftext|>"} {"text":"<commit_before>\/*************************************************************************\n *\n * OpenOffice.org - a multi-platform office productivity suite\n *\n * $RCSfile: i_nnfinder.hxx,v $\n *\n * $Revision: 1.3 $\n *\n * last change: $Author: hr $ $Date: 2007-11-02 15:45: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#ifndef ARY_IDL_NNFINDER_HXX\n#define ARY_IDL_NNFINDER_HXX\n\n\/\/ USED SERVICES\n#include \"is_ce.hxx\"\n\n\n\n\nnamespace ary\n{\nnamespace idl\n{\n\n\n\/** Gives context info for tree search functions.\n\n @collab ->ary::Search_SubTree<>()\n @collab ->ary::Search_SubTree_UpTillRoot<>()\n*\/\nclass Find_ModuleNode\n{\n public:\n typedef Ce_id id_type;\n typedef StringVector::const_iterator name_iterator;\n\n \/\/ LIFECYCLE\n Find_ModuleNode(\n const Ce_Storage & i_rStorage,\n name_iterator it_begin,\n name_iterator it_end,\n const String & i_sName )\n : rStorage(i_rStorage),\n itBegin(it_begin),\n itEnd(it_end),\n sName2Search(i_sName) { if (itBegin != itEnd ? (*itBegin).empty() : false) ++itBegin; }\n \/\/ OPERATIONS\n const Module * operator()(\n id_type i_id ) const\n { return i_id.IsValid()\n ? & ary_cast<Module>(rStorage[i_id])\n : 0; }\n\n name_iterator Begin() const { return itBegin; }\n name_iterator End() const { return itEnd; }\n const String & Name2Search() const { return sName2Search; }\n\n private:\n \/\/ DATA\n const Ce_Storage & rStorage;\n name_iterator itBegin;\n name_iterator itEnd;\n String sName2Search;\n};\n\n\n\n\nclass Types_forSetCe_Id\n{\n public:\n typedef Ce_id element_type;\n typedef Ce_Storage find_type;\n\n \/\/ KORR_FUTURE: Check, if this sorting is right or the ary standard\n \/\/ sorting should be used.\n struct sort_type\n {\n sort_type(\n const find_type & i_rFinder )\n : rFinder(i_rFinder) {}\n bool operator()(\n const element_type &\n i_r1,\n const element_type &\n i_r2 ) const\n {\n return rFinder[i_r1].LocalName()\n < rFinder[i_r2].LocalName();\n }\n\n private:\n const find_type & rFinder;\n\n };\n};\n\n\n} \/\/ namespace idl\n} \/\/ namespace ary\n#endif\n<commit_msg>INTEGRATION: CWS changefileheader (1.3.22); FILE MERGED 2008\/03\/28 16:01:45 rt 1.3.22.1: #i87441# Change license header to LPGL v3.<commit_after>\/*************************************************************************\n *\n * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.\n *\n * Copyright 2008 by Sun Microsystems, Inc.\n *\n * OpenOffice.org - a multi-platform office productivity suite\n *\n * $RCSfile: i_nnfinder.hxx,v $\n * $Revision: 1.4 $\n *\n * This file is part of OpenOffice.org.\n *\n * OpenOffice.org is free software: you can redistribute it and\/or modify\n * it under the terms of the GNU Lesser General Public License version 3\n * only, as published by the Free Software Foundation.\n *\n * OpenOffice.org is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the\n * GNU Lesser General Public License version 3 for more details\n * (a copy is included in the LICENSE file that accompanied this code).\n *\n * You should have received a copy of the GNU Lesser General Public License\n * version 3 along with OpenOffice.org. If not, see\n * <http:\/\/www.openoffice.org\/license.html>\n * for a copy of the LGPLv3 License.\n *\n ************************************************************************\/\n\n#ifndef ARY_IDL_NNFINDER_HXX\n#define ARY_IDL_NNFINDER_HXX\n\n\/\/ USED SERVICES\n#include \"is_ce.hxx\"\n\n\n\n\nnamespace ary\n{\nnamespace idl\n{\n\n\n\/** Gives context info for tree search functions.\n\n @collab ->ary::Search_SubTree<>()\n @collab ->ary::Search_SubTree_UpTillRoot<>()\n*\/\nclass Find_ModuleNode\n{\n public:\n typedef Ce_id id_type;\n typedef StringVector::const_iterator name_iterator;\n\n \/\/ LIFECYCLE\n Find_ModuleNode(\n const Ce_Storage & i_rStorage,\n name_iterator it_begin,\n name_iterator it_end,\n const String & i_sName )\n : rStorage(i_rStorage),\n itBegin(it_begin),\n itEnd(it_end),\n sName2Search(i_sName) { if (itBegin != itEnd ? (*itBegin).empty() : false) ++itBegin; }\n \/\/ OPERATIONS\n const Module * operator()(\n id_type i_id ) const\n { return i_id.IsValid()\n ? & ary_cast<Module>(rStorage[i_id])\n : 0; }\n\n name_iterator Begin() const { return itBegin; }\n name_iterator End() const { return itEnd; }\n const String & Name2Search() const { return sName2Search; }\n\n private:\n \/\/ DATA\n const Ce_Storage & rStorage;\n name_iterator itBegin;\n name_iterator itEnd;\n String sName2Search;\n};\n\n\n\n\nclass Types_forSetCe_Id\n{\n public:\n typedef Ce_id element_type;\n typedef Ce_Storage find_type;\n\n \/\/ KORR_FUTURE: Check, if this sorting is right or the ary standard\n \/\/ sorting should be used.\n struct sort_type\n {\n sort_type(\n const find_type & i_rFinder )\n : rFinder(i_rFinder) {}\n bool operator()(\n const element_type &\n i_r1,\n const element_type &\n i_r2 ) const\n {\n return rFinder[i_r1].LocalName()\n < rFinder[i_r2].LocalName();\n }\n\n private:\n const find_type & rFinder;\n\n };\n};\n\n\n} \/\/ namespace idl\n} \/\/ namespace ary\n#endif\n<|endoftext|>"} {"text":"<commit_before>\/*************************************************************************\n *\n * $RCSfile: cross_refs.hxx,v $\n *\n * $Revision: 1.1 $\n *\n * last change: $Author: np $ $Date: 2002-11-01 17:13:40 $\n *\n * The Contents of this file are made available subject to the terms of\n * either of the following licenses\n *\n * - GNU Lesser General Public License Version 2.1\n * - Sun Industry Standards Source License Version 1.1\n *\n * Sun Microsystems Inc., October, 2000\n *\n * GNU Lesser General Public License Version 2.1\n * =============================================\n * Copyright 2000 by Sun Microsystems, Inc.\n * 901 San Antonio Road, Palo Alto, CA 94303, USA\n *\n * This library is free software; you can redistribute it and\/or\n * modify it under the terms of the GNU Lesser General Public\n * License version 2.1, as published by the Free Software Foundation.\n *\n * This library is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU\n * Lesser General Public License for more details.\n *\n * You should have received a copy of the GNU Lesser General Public\n * License along with this library; if not, write to the Free Software\n * Foundation, Inc., 59 Temple Place, Suite 330, Boston,\n * MA 02111-1307 USA\n *\n *\n * Sun Industry Standards Source License Version 1.1\n * =================================================\n * The contents of this file are subject to the Sun Industry Standards\n * Source License Version 1.1 (the \"License\"); You may not use this file\n * except in compliance with the License. You may obtain a copy of the\n * License at http:\/\/www.openoffice.org\/license.html.\n *\n * Software provided under this License is provided on an \"AS IS\" basis,\n * WITHOUT WARRANTY OF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING,\n * WITHOUT LIMITATION, WARRANTIES THAT THE SOFTWARE IS FREE OF DEFECTS,\n * MERCHANTABLE, FIT FOR A PARTICULAR PURPOSE, OR NON-INFRINGING.\n * See the License for the specific provisions governing your rights and\n * obligations concerning the Software.\n *\n * The Initial Developer of the Original Code is: Sun Microsystems, Inc.\n *\n * Copyright: 2000 by Sun Microsystems, Inc.\n *\n * All Rights Reserved.\n *\n * Contributor(s): _______________________________________\n *\n *\n ************************************************************************\/\n\n#ifndef ARY_CROSS_REFS_HXX\n#define ARY_CROSS_REFS_HXX\n\n\n\n\/\/ USED SERVICES\n \/\/ BASE CLASSES\n \/\/ COMPONENTS\n \/\/ PARAMETERS\n#include \"sorted_idset.hxx\"\n\n\ntemplate <class VALUE_LIST, class TYPES>\nclass CrossReferences\n{\n public:\n typedef TYPES::element_type element;\n\n \/\/\/ Checks for double occurences\n void Add(\n VALUE_LIST::index_type\n i_nPosition\n const element & i_rElem );\n void Get_List(\n Dyn_StdConstIterator<element> &\n o_rResult ) const;\n private:\n SortedIdSet<TYPES> aData[VALUE_LIST::max];\n};\n\n\n\nnamespace ary\n{\n\ntemplate <class TYPES>\nclass SortedIdSet\n{\n public:\n typedef typename TYPES::element_type element;\n typedef typename TYPES::sort_type sorter;\n typedef typename TYPES::find_type finder;\n\n SortedIdSet(\n const finder & i_rFinder )\n : aSorter(i_rFinder),\n aData(aSorter) {}\n ~SortedIdSet() {}\n\n void Get_Begin(\n Dyn_StdConstIterator<element> &\n o_rResult )\n { o_rResult = new SCI_Set<FINDER>(aData); }\n void Add(\n const element & i_rElement )\n { aData.insert(i_rElement); }\n\n private:\n typedef std::set<element, sorter> Set;\n\n \/\/ DATA\n sorter aSorter;\n Set aData;\n};\n\n\n} \/\/ namespace ary\n\n\n\n#endif\n\n<commit_msg>INTEGRATION: CWS ooo19126 (1.1.132); FILE MERGED 2005\/09\/05 13:10:13 rt 1.1.132.1: #i54170# Change license header: remove SISSL<commit_after>\/*************************************************************************\n *\n * OpenOffice.org - a multi-platform office productivity suite\n *\n * $RCSfile: cross_refs.hxx,v $\n *\n * $Revision: 1.2 $\n *\n * last change: $Author: rt $ $Date: 2005-09-07 16:57:57 $\n *\n * The Contents of this file are made available subject to\n * the terms of GNU Lesser General Public License Version 2.1.\n *\n *\n * GNU Lesser General Public License Version 2.1\n * =============================================\n * Copyright 2005 by Sun Microsystems, Inc.\n * 901 San Antonio Road, Palo Alto, CA 94303, USA\n *\n * This library is free software; you can redistribute it and\/or\n * modify it under the terms of the GNU Lesser General Public\n * License version 2.1, as published by the Free Software Foundation.\n *\n * This library is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU\n * Lesser General Public License for more details.\n *\n * You should have received a copy of the GNU Lesser General Public\n * License along with this library; if not, write to the Free Software\n * Foundation, Inc., 59 Temple Place, Suite 330, Boston,\n * MA 02111-1307 USA\n *\n ************************************************************************\/\n\n#ifndef ARY_CROSS_REFS_HXX\n#define ARY_CROSS_REFS_HXX\n\n\n\n\/\/ USED SERVICES\n \/\/ BASE CLASSES\n \/\/ COMPONENTS\n \/\/ PARAMETERS\n#include \"sorted_idset.hxx\"\n\n\ntemplate <class VALUE_LIST, class TYPES>\nclass CrossReferences\n{\n public:\n typedef TYPES::element_type element;\n\n \/\/\/ Checks for double occurences\n void Add(\n VALUE_LIST::index_type\n i_nPosition\n const element & i_rElem );\n void Get_List(\n Dyn_StdConstIterator<element> &\n o_rResult ) const;\n private:\n SortedIdSet<TYPES> aData[VALUE_LIST::max];\n};\n\n\n\nnamespace ary\n{\n\ntemplate <class TYPES>\nclass SortedIdSet\n{\n public:\n typedef typename TYPES::element_type element;\n typedef typename TYPES::sort_type sorter;\n typedef typename TYPES::find_type finder;\n\n SortedIdSet(\n const finder & i_rFinder )\n : aSorter(i_rFinder),\n aData(aSorter) {}\n ~SortedIdSet() {}\n\n void Get_Begin(\n Dyn_StdConstIterator<element> &\n o_rResult )\n { o_rResult = new SCI_Set<FINDER>(aData); }\n void Add(\n const element & i_rElement )\n { aData.insert(i_rElement); }\n\n private:\n typedef std::set<element, sorter> Set;\n\n \/\/ DATA\n sorter aSorter;\n Set aData;\n};\n\n\n} \/\/ namespace ary\n\n\n\n#endif\n\n<|endoftext|>"} {"text":"<commit_before>#include \"PageBuilder.h\"\n\nPageBuilder::PageBuilder(const std::set<PageInfo> &Pages)\n{\n pages = Pages;\n}\n\nint PageBuilder::build(const PageInfo &PageToBuild)\n{\n pageToBuild = PageToBuild;\n\n std::cout << std::endl;\n\n \/\/ensures content and template files exist\n if(!std::ifstream(pageToBuild.contentPath.str()))\n {\n std::cout << \"error: cannot build \" << pageToBuild.pagePath << \" as content file \" << pageToBuild.contentPath << \" does not exist\" << std::endl;\n return 1;\n }\n if(!std::ifstream(pageToBuild.templatePath.str()))\n {\n std::cout << \"error: cannot build \" << pageToBuild.pagePath << \" as template file \" << pageToBuild.templatePath << \" does not exist.\" << std::endl;\n return 1;\n }\n\n std::cout << \"building page \" << pageToBuild.pagePath << std::endl;\n\n \/\/makes sure variables are at default values\n codeBlockDepth = htmlCommentDepth = 0;\n indentAmount = \"\";\n contentAdded = 0;\n processedPage.clear();\n processedPage.str(std::string());\n pageDeps.clear();\n contentAdded = 0;\n\n \/\/adds content and template paths to dependencies\n pageDeps.insert(pageToBuild.contentPath);\n pageDeps.insert(pageToBuild.templatePath);\n\n \/\/creates anti-deps of readPath set\n std::set<Path> antiDepsOfReadPath;\n\n \/\/starts read_and_process from templatePath\n if(read_and_process(pageToBuild.templatePath, antiDepsOfReadPath) > 0)\n return 1;\n\n \/\/ensures @inputcontent was found inside template tree\n if(!contentAdded)\n {\n std::cout << \"error: @inputcontent not found within template file \" << pageToBuild.templatePath << \" or any of its dependencies, content from \" << pageToBuild.contentPath << \" has not been inserted\" << std::endl;\n return 1;\n }\n\n \/\/makes sure page file exists\n pageToBuild.pagePath.ensurePathExists();\n\n \/\/makes sure we can write to page file\n chmod(pageToBuild.pagePath.str().c_str(), 0644);\n\n \/\/writes processed page to page file\n std::ofstream pageStream(pageToBuild.pagePath.str());\n pageStream << processedPage.str();\n pageStream.close();\n\n \/\/makes sure user can't accidentally write to page file\n chmod(pageToBuild.pagePath.str().c_str(), 0444);\n\n \/\/gets path for storing page information\n Path pageInfoPath = pageToBuild.pagePath.getInfoPath();\n\n \/\/makes sure page info file exists\n pageInfoPath.ensurePathExists();\n\n \/\/makes sure we can write to info file_\n chmod(pageInfoPath.str().c_str(), 0644);\n\n \/\/writes page info file\n std::ofstream infoStream(pageInfoPath.str());\n infoStream << currentTime() << \" \" << currentDate() << std::endl;\n infoStream << this->pageToBuild << std::endl << std::endl;\n for(auto pageDep=pageDeps.begin(); pageDep != pageDeps.end(); pageDep++)\n infoStream << *pageDep << std::endl;\n infoStream.close();\n\n \/\/makes sure user can't accidentally write to info file\n chmod(pageInfoPath.str().c_str(), 0444);\n\n std::cout << \"page build successful\" << std::endl;\n\n return 0;\n};\n\n\/\/reads file whilst writing processed version to ofs\nint PageBuilder::read_and_process(const Path &readPath, std::set<Path> antiDepsOfReadPath)\n{\n \/\/adds read path to anti dependencies of read path\n antiDepsOfReadPath.insert(readPath);\n\n std::ifstream ifs(readPath.str());\n std::string baseIndentAmount = indentAmount;\n int baseCodeBlockDepth = codeBlockDepth;\n\n int lineNo = 0,\n openCodeLineNo = 0;\n std::string inLine;\n while(getline(ifs, inLine))\n {\n lineNo++;\n\n if(lineNo > 1)\n {\n indentAmount = baseIndentAmount;\n processedPage << std::endl << baseIndentAmount;\n }\n\n for(size_t linePos=0; linePos<inLine.length();)\n {\n if(inLine[linePos] == '\\\\') \/\/checks whether to escape\n {\n linePos++;\n \/*\n see http:\/\/dev.w3.org\/html5\/html-author\/charref for\n more character references than you could ever need!\n *\/\n switch(inLine[linePos])\n {\n case '~':\n processedPage << \"˜\";\n linePos++;\n indentAmount += std::string(7, ' ');\n break;\n case '!':\n processedPage << \"!\";\n linePos++;\n indentAmount += std::string(6, ' ');\n break;\n case '@':\n processedPage << \"@\";\n linePos++;\n indentAmount += std::string(8, ' ');\n break;\n case '#':\n processedPage << \"#\";\n linePos++;\n indentAmount += std::string(5, ' ');\n break;\n \/*case '$': \/\/MUST HAVE MATHJAX HANDLE THIS\n processedPage << \"$\";\n linePos++;\n indentAmount += string(8, ' ');\n break;*\/\n case '%':\n processedPage << \"%\";\n linePos++;\n indentAmount += std::string(8, ' ');\n break;\n case '^':\n processedPage << \"^\";\n linePos++;\n indentAmount += std::string(5, ' ');\n break;\n case '&':\n processedPage << \"&\";\n linePos++;\n indentAmount += std::string(5, ' ');\n break;\n case '*':\n processedPage << \"*\";\n linePos++;\n indentAmount += std::string(5, ' ');\n break;\n case '?':\n processedPage << \"?\";\n linePos++;\n indentAmount += std::string(7, ' ');\n break;\n case '<':\n processedPage << \"<\";\n linePos++;\n indentAmount += std::string(4, ' ');\n break;\n case '>':\n processedPage << \">\";\n linePos++;\n indentAmount += std::string(4, ' ');\n break;\n default:\n processedPage << \"\\\\\";\n indentAmount += \" \";\n }\n }\n else if(inLine[linePos] == '<') \/\/checks about code blocks and html comments opening\n {\n \/\/checks whether we're going down code block depth\n if(htmlCommentDepth == 0 && inLine.substr(linePos+1, 4) == \"\/pre\")\n {\n codeBlockDepth--;\n if(codeBlockDepth < baseCodeBlockDepth)\n {\n std::cout << \"error: \" << readPath << \": line \" << lineNo << \": <\/pre> close tag has no preceding <pre*> open tag.\" << std::endl << std::endl;\n return 1;\n }\n }\n\n \/\/checks whether to escape <\n if(codeBlockDepth > 0)\n {\n processedPage << \"<\";\n indentAmount += std::string(\"<\").length();\n }\n else\n {\n processedPage << '<';\n indentAmount += \" \";\n }\n\n \/\/checks whether we're going up code block depth\n if(htmlCommentDepth == 0 && inLine.substr(linePos+1, 3) == \"pre\")\n {\n if(codeBlockDepth == baseCodeBlockDepth)\n openCodeLineNo = lineNo;\n codeBlockDepth++;\n }\n\n \/\/checks whether we're going up html comment depth\n if(inLine.substr(linePos+1, 3) == \"!--\")\n htmlCommentDepth++;\n\n linePos++;\n }\n else if(inLine[linePos] == '-') \/\/checks about html comments closing\n {\n \/\/checks whether we're going down html depth\n if(inLine.substr(linePos+1, 2) == \"->\")\n htmlCommentDepth--;\n\n processedPage << '-';\n indentAmount += \" \";\n linePos++;\n }\n else if(inLine[linePos] == '@') \/\/checks for commands\n {\n if(linePos > 0 && inLine[linePos-1] == '\\\\')\n {\n processedPage << '@';\n indentAmount += \" \";\n linePos++;\n }\n else if(inLine.substr(linePos, 13) == \"@inputcontent\")\n {\n contentAdded = 1;\n std::string replaceText = \"@input(\" + pageToBuild.contentPath.str() + \")\";\n inLine.replace(linePos, 13, replaceText);\n }\n else if(inLine.substr(linePos, 7) == \"@input(\")\n {\n linePos+=std::string(\"@input(\").length();\n std::string inputPathStr=\"\";\n\n for(; inLine[linePos] != ')'; linePos++)\n if(inLine[linePos] != '\"' && inLine[linePos] != '\\'')\n inputPathStr += inLine[linePos];\n linePos++;\n\n Path inputPath;\n inputPath.set_file_path_from(inputPathStr);\n pageDeps.insert(inputPath);\n\n \/\/ensures insert file exists\n if(!std::ifstream(inputPathStr))\n {\n std::cout << \"error: \" << readPath << \": line \" << lineNo << \": inputting file \" << inputPath << \" failed as path does not exist\" << std::endl;\n return 1;\n }\n \/\/ensures insert file isn't an anti dep of read path\n if(antiDepsOfReadPath.count(inputPath))\n {\n std::cout << \"error: \" << readPath << \": line \" << lineNo << \": inputting file \" << inputPath << \" would result in an input loop\" << std::endl;\n return 1;\n }\n\n \/\/adds insert file\n if(read_and_process(inputPath, antiDepsOfReadPath) > 0)\n return 1;\n \/\/indent amount updated inside read_and_process\n }\n else if(inLine.substr(linePos, 8) == \"@pathto(\")\n {\n linePos+=std::string(\"@pathto(\").length();\n Name targetPageName=\"\";\n\n for(; inLine[linePos] != ')'; linePos++)\n if(inLine[linePos] != '\"' && inLine[linePos] != '\\'')\n targetPageName += inLine[linePos];\n linePos++;\n\n std::cout << targetPageName << std::endl;\n\n \/\/warns user if target targetPageName isn't being tracked by nsm\n PageInfo targetPageInfo;\n targetPageInfo.pageName = targetPageName;\n if(!pages.count(targetPageInfo))\n {\n std::cout << \"error: \" << readPath << \": line \" << lineNo << \": @pathto(\" << targetPageName << \") failed, nsm not tracking \" << targetPageName << std::endl;\n return 1;\n }\n\n\n Path targetPath = pages.find(targetPageInfo)->pagePath;\n \/\/targetPath.set_file_path_from(targetPathStr);\n\n std::cout << \"finding path between \" << pageToBuild.pagePath.dir << \" to \" << targetPath.dir << std::endl;\n\n Path pathToTarget(pathBetween(pageToBuild.pagePath.dir, targetPath.dir), targetPath.file);\n\n \/\/adds path to target\n processedPage << pathToTarget.str();\n indentAmount += pathToTarget.str().length();\n }\n else if(inLine.substr(linePos, 10) == \"@pagetitle\")\n {\n processedPage << pageToBuild.pageTitle.str;\n indentAmount+=pageToBuild.pageTitle.str.length();\n linePos+=std::string(\"@pagetitle\").length();\n }\n else if(inLine.substr(linePos, 12) == \"@currenttime\")\n {\n processedPage << dateTimeInfo.cTime;\n indentAmount+=dateTimeInfo.cTime.length();\n linePos+=std::string(\"@currenttime\").length();\n }\n else if(inLine.substr(linePos, 12) == \"@currentdate\")\n {\n processedPage << dateTimeInfo.cDate;\n indentAmount+=dateTimeInfo.cDate.length();\n linePos+=std::string(\"@currentdate\").length();\n }\n else if(inLine.substr(linePos, 9) == \"@timezone\")\n {\n processedPage << dateTimeInfo.cTimezone;\n indentAmount+=dateTimeInfo.cTimezone.length();\n linePos+=std::string(\"@timezone\").length();\n }\n else if(inLine.substr(linePos, 15) == \"@faviconinclude\") \/\/checks for favicon include\n {\n linePos+=std::string(\"@faviconinclude(\").length();\n std::string faviconPathStr=\"\";\n\n for(; inLine[linePos] != ')'; linePos++)\n if(inLine[linePos] != '\"' && inLine[linePos] != '\\'')\n faviconPathStr += inLine[linePos];\n linePos++;\n\n \/\/warns user if favicon file doesn't exist\n if(!std::ifstream(faviconPathStr.c_str()))\n {\n std::cout << \"warning: \" << readPath << \": line \" << lineNo << \": favicon file \" << faviconPathStr << \" does not exist\" << std::endl;\n }\n\n Path faviconPath;\n faviconPath.set_file_path_from(faviconPathStr);\n\n Path pathToFavicon(pathBetween(pageToBuild.pagePath.dir, faviconPath.dir), faviconPath.file);\n\n std::string faviconInclude=\"<link rel='icon' type='image\/png' href='\";\n faviconInclude += pathToFavicon.str();\n faviconInclude+=\"'>\";\n\n processedPage << faviconInclude;\n indentAmount += faviconInclude.length();\n }\n else if(inLine.substr(linePos, 12) == \"@cssinclude(\") \/\/checks for css includes\n {\n linePos+=std::string(\"@cssinclude(\").length();\n std::string cssPathStr=\"\";\n\n for(; inLine[linePos] != ')'; linePos++)\n if(inLine[linePos] != '\"' && inLine[linePos] != '\\'')\n cssPathStr += inLine[linePos];\n linePos++;\n\n \/\/warns user if css file doesn't exist\n if(!std::ifstream(cssPathStr.c_str()))\n {\n std::cout << \"warning: \" << readPath << \": line \" << lineNo << \": css file \" << cssPathStr << \"does not exist\" << std::endl;\n }\n\n Path cssPath;\n cssPath.set_file_path_from(cssPathStr);\n\n Path pathToCSSFile(pathBetween(pageToBuild.pagePath.dir, cssPath.dir), cssPath.file);\n\n std::string cssInclude=\"<link rel='stylesheet' type='text\/css' href='\";\n cssInclude += pathToCSSFile.str();\n cssInclude+=\"'>\";\n\n processedPage << cssInclude;\n indentAmount += cssInclude.length();\n }\n else if(inLine.substr(linePos, 11) == \"@jsinclude(\") \/\/checks for js includes\n {\n linePos+=std::string(\"@jsinclude(\").length();\n std::string jsPathStr=\"\";\n\n for(; inLine[linePos] != ')'; linePos++)\n if(inLine[linePos] != '\"' && inLine[linePos] != '\\'')\n jsPathStr += inLine[linePos];\n linePos++;\n\n \/\/warns user if js file doesn't exist\n if(!std::ifstream(jsPathStr.c_str()))\n std::cout << \"warning: \" << readPath << \": line \" << lineNo << \": js file \" << jsPathStr << \"does not exist\" << std::endl;\n\n Path jsPath;\n jsPath.set_file_path_from(jsPathStr);\n\n Path pathToJSFile(pathBetween(pageToBuild.pagePath.dir, jsPath.dir), jsPath.file);\n\n std::string jsInclude=\"<script type='text\/javascript' src='\";\n jsInclude += pathToJSFile.str();\n jsInclude+=\"'><\/script>\";\n\n processedPage << jsInclude;\n indentAmount += jsInclude.length();\n }\n else\n {\n processedPage << '@';\n indentAmount += \" \";\n linePos++;\n }\n }\n else \/\/regular character\n {\n if(inLine[linePos] == '\\t')\n indentAmount += '\\t';\n else\n indentAmount += ' ';\n processedPage << inLine[linePos++];\n }\n }\n }\n\n if(codeBlockDepth > baseCodeBlockDepth)\n {\n std::cout << \"error: \" << readPath << \": line \" << openCodeLineNo << \": <pre*> open tag has no following <\/pre> close tag.\" << std::endl << std::endl;\n return 1;\n }\n\n ifs.close();\n\n return 0;\n}\n<commit_msg>added error when @pathto fails<commit_after>#include \"PageBuilder.h\"\n\nPageBuilder::PageBuilder(const std::set<PageInfo> &Pages)\n{\n pages = Pages;\n}\n\nint PageBuilder::build(const PageInfo &PageToBuild)\n{\n pageToBuild = PageToBuild;\n\n std::cout << std::endl;\n\n \/\/ensures content and template files exist\n if(!std::ifstream(pageToBuild.contentPath.str()))\n {\n std::cout << \"error: cannot build \" << pageToBuild.pagePath << \" as content file \" << pageToBuild.contentPath << \" does not exist\" << std::endl;\n return 1;\n }\n if(!std::ifstream(pageToBuild.templatePath.str()))\n {\n std::cout << \"error: cannot build \" << pageToBuild.pagePath << \" as template file \" << pageToBuild.templatePath << \" does not exist.\" << std::endl;\n return 1;\n }\n\n std::cout << \"building page \" << pageToBuild.pagePath << std::endl;\n\n \/\/makes sure variables are at default values\n codeBlockDepth = htmlCommentDepth = 0;\n indentAmount = \"\";\n contentAdded = 0;\n processedPage.clear();\n processedPage.str(std::string());\n pageDeps.clear();\n contentAdded = 0;\n\n \/\/adds content and template paths to dependencies\n pageDeps.insert(pageToBuild.contentPath);\n pageDeps.insert(pageToBuild.templatePath);\n\n \/\/creates anti-deps of readPath set\n std::set<Path> antiDepsOfReadPath;\n\n \/\/starts read_and_process from templatePath\n if(read_and_process(pageToBuild.templatePath, antiDepsOfReadPath) > 0)\n return 1;\n\n \/\/ensures @inputcontent was found inside template tree\n if(!contentAdded)\n {\n std::cout << \"error: @inputcontent not found within template file \" << pageToBuild.templatePath << \" or any of its dependencies, content from \" << pageToBuild.contentPath << \" has not been inserted\" << std::endl;\n return 1;\n }\n\n \/\/makes sure page file exists\n pageToBuild.pagePath.ensurePathExists();\n\n \/\/makes sure we can write to page file\n chmod(pageToBuild.pagePath.str().c_str(), 0644);\n\n \/\/writes processed page to page file\n std::ofstream pageStream(pageToBuild.pagePath.str());\n pageStream << processedPage.str();\n pageStream.close();\n\n \/\/makes sure user can't accidentally write to page file\n chmod(pageToBuild.pagePath.str().c_str(), 0444);\n\n \/\/gets path for storing page information\n Path pageInfoPath = pageToBuild.pagePath.getInfoPath();\n\n \/\/makes sure page info file exists\n pageInfoPath.ensurePathExists();\n\n \/\/makes sure we can write to info file_\n chmod(pageInfoPath.str().c_str(), 0644);\n\n \/\/writes page info file\n std::ofstream infoStream(pageInfoPath.str());\n infoStream << currentTime() << \" \" << currentDate() << std::endl;\n infoStream << this->pageToBuild << std::endl << std::endl;\n for(auto pageDep=pageDeps.begin(); pageDep != pageDeps.end(); pageDep++)\n infoStream << *pageDep << std::endl;\n infoStream.close();\n\n \/\/makes sure user can't accidentally write to info file\n chmod(pageInfoPath.str().c_str(), 0444);\n\n std::cout << \"page build successful\" << std::endl;\n\n return 0;\n};\n\n\/\/reads file whilst writing processed version to ofs\nint PageBuilder::read_and_process(const Path &readPath, std::set<Path> antiDepsOfReadPath)\n{\n \/\/adds read path to anti dependencies of read path\n antiDepsOfReadPath.insert(readPath);\n\n std::ifstream ifs(readPath.str());\n std::string baseIndentAmount = indentAmount;\n int baseCodeBlockDepth = codeBlockDepth;\n\n int lineNo = 0,\n openCodeLineNo = 0;\n std::string inLine;\n while(getline(ifs, inLine))\n {\n lineNo++;\n\n if(lineNo > 1)\n {\n indentAmount = baseIndentAmount;\n processedPage << std::endl << baseIndentAmount;\n }\n\n for(size_t linePos=0; linePos<inLine.length();)\n {\n if(inLine[linePos] == '\\\\') \/\/checks whether to escape\n {\n linePos++;\n \/*\n see http:\/\/dev.w3.org\/html5\/html-author\/charref for\n more character references than you could ever need!\n *\/\n switch(inLine[linePos])\n {\n case '~':\n processedPage << \"˜\";\n linePos++;\n indentAmount += std::string(7, ' ');\n break;\n case '!':\n processedPage << \"!\";\n linePos++;\n indentAmount += std::string(6, ' ');\n break;\n case '@':\n processedPage << \"@\";\n linePos++;\n indentAmount += std::string(8, ' ');\n break;\n case '#':\n processedPage << \"#\";\n linePos++;\n indentAmount += std::string(5, ' ');\n break;\n \/*case '$': \/\/MUST HAVE MATHJAX HANDLE THIS\n processedPage << \"$\";\n linePos++;\n indentAmount += string(8, ' ');\n break;*\/\n case '%':\n processedPage << \"%\";\n linePos++;\n indentAmount += std::string(8, ' ');\n break;\n case '^':\n processedPage << \"^\";\n linePos++;\n indentAmount += std::string(5, ' ');\n break;\n case '&':\n processedPage << \"&\";\n linePos++;\n indentAmount += std::string(5, ' ');\n break;\n case '*':\n processedPage << \"*\";\n linePos++;\n indentAmount += std::string(5, ' ');\n break;\n case '?':\n processedPage << \"?\";\n linePos++;\n indentAmount += std::string(7, ' ');\n break;\n case '<':\n processedPage << \"<\";\n linePos++;\n indentAmount += std::string(4, ' ');\n break;\n case '>':\n processedPage << \">\";\n linePos++;\n indentAmount += std::string(4, ' ');\n break;\n default:\n processedPage << \"\\\\\";\n indentAmount += \" \";\n }\n }\n else if(inLine[linePos] == '<') \/\/checks about code blocks and html comments opening\n {\n \/\/checks whether we're going down code block depth\n if(htmlCommentDepth == 0 && inLine.substr(linePos+1, 4) == \"\/pre\")\n {\n codeBlockDepth--;\n if(codeBlockDepth < baseCodeBlockDepth)\n {\n std::cout << \"error: \" << readPath << \": line \" << lineNo << \": <\/pre> close tag has no preceding <pre*> open tag.\" << std::endl << std::endl;\n return 1;\n }\n }\n\n \/\/checks whether to escape <\n if(codeBlockDepth > 0)\n {\n processedPage << \"<\";\n indentAmount += std::string(\"<\").length();\n }\n else\n {\n processedPage << '<';\n indentAmount += \" \";\n }\n\n \/\/checks whether we're going up code block depth\n if(htmlCommentDepth == 0 && inLine.substr(linePos+1, 3) == \"pre\")\n {\n if(codeBlockDepth == baseCodeBlockDepth)\n openCodeLineNo = lineNo;\n codeBlockDepth++;\n }\n\n \/\/checks whether we're going up html comment depth\n if(inLine.substr(linePos+1, 3) == \"!--\")\n htmlCommentDepth++;\n\n linePos++;\n }\n else if(inLine[linePos] == '-') \/\/checks about html comments closing\n {\n \/\/checks whether we're going down html depth\n if(inLine.substr(linePos+1, 2) == \"->\")\n htmlCommentDepth--;\n\n processedPage << '-';\n indentAmount += \" \";\n linePos++;\n }\n else if(inLine[linePos] == '@') \/\/checks for commands\n {\n if(linePos > 0 && inLine[linePos-1] == '\\\\')\n {\n processedPage << '@';\n indentAmount += \" \";\n linePos++;\n }\n else if(inLine.substr(linePos, 13) == \"@inputcontent\")\n {\n contentAdded = 1;\n std::string replaceText = \"@input(\" + pageToBuild.contentPath.str() + \")\";\n inLine.replace(linePos, 13, replaceText);\n }\n else if(inLine.substr(linePos, 7) == \"@input(\")\n {\n linePos+=std::string(\"@input(\").length();\n std::string inputPathStr=\"\";\n\n for(; inLine[linePos] != ')'; linePos++)\n if(inLine[linePos] != '\"' && inLine[linePos] != '\\'')\n inputPathStr += inLine[linePos];\n linePos++;\n\n Path inputPath;\n inputPath.set_file_path_from(inputPathStr);\n pageDeps.insert(inputPath);\n\n \/\/ensures insert file exists\n if(!std::ifstream(inputPathStr))\n {\n std::cout << \"error: \" << readPath << \": line \" << lineNo << \": inputting file \" << inputPath << \" failed as path does not exist\" << std::endl;\n return 1;\n }\n \/\/ensures insert file isn't an anti dep of read path\n if(antiDepsOfReadPath.count(inputPath))\n {\n std::cout << \"error: \" << readPath << \": line \" << lineNo << \": inputting file \" << inputPath << \" would result in an input loop\" << std::endl;\n return 1;\n }\n\n \/\/adds insert file\n if(read_and_process(inputPath, antiDepsOfReadPath) > 0)\n return 1;\n \/\/indent amount updated inside read_and_process\n }\n else if(inLine.substr(linePos, 8) == \"@pathto(\")\n {\n linePos+=std::string(\"@pathto(\").length();\n Name targetPageName=\"\";\n\n for(; inLine[linePos] != ')'; linePos++)\n if(inLine[linePos] != '\"' && inLine[linePos] != '\\'')\n targetPageName += inLine[linePos];\n linePos++;\n\n \/\/warns user if target targetPageName isn't being tracked by nsm\n PageInfo targetPageInfo;\n targetPageInfo.pageName = targetPageName;\n if(!pages.count(targetPageInfo))\n {\n std::cout << \"error: \" << readPath << \": line \" << lineNo << \": @pathto(\" << targetPageName << \") failed, nsm not tracking \" << targetPageName << std::endl;\n return 1;\n }\n\n\n Path targetPath = pages.find(targetPageInfo)->pagePath;\n \/\/targetPath.set_file_path_from(targetPathStr);\n\n Path pathToTarget(pathBetween(pageToBuild.pagePath.dir, targetPath.dir), targetPath.file);\n\n \/\/adds path to target\n processedPage << pathToTarget.str();\n indentAmount += pathToTarget.str().length();\n }\n else if(inLine.substr(linePos, 10) == \"@pagetitle\")\n {\n processedPage << pageToBuild.pageTitle.str;\n indentAmount+=pageToBuild.pageTitle.str.length();\n linePos+=std::string(\"@pagetitle\").length();\n }\n else if(inLine.substr(linePos, 12) == \"@currenttime\")\n {\n processedPage << dateTimeInfo.cTime;\n indentAmount+=dateTimeInfo.cTime.length();\n linePos+=std::string(\"@currenttime\").length();\n }\n else if(inLine.substr(linePos, 12) == \"@currentdate\")\n {\n processedPage << dateTimeInfo.cDate;\n indentAmount+=dateTimeInfo.cDate.length();\n linePos+=std::string(\"@currentdate\").length();\n }\n else if(inLine.substr(linePos, 9) == \"@timezone\")\n {\n processedPage << dateTimeInfo.cTimezone;\n indentAmount+=dateTimeInfo.cTimezone.length();\n linePos+=std::string(\"@timezone\").length();\n }\n else if(inLine.substr(linePos, 15) == \"@faviconinclude\") \/\/checks for favicon include\n {\n linePos+=std::string(\"@faviconinclude(\").length();\n std::string faviconPathStr=\"\";\n\n for(; inLine[linePos] != ')'; linePos++)\n if(inLine[linePos] != '\"' && inLine[linePos] != '\\'')\n faviconPathStr += inLine[linePos];\n linePos++;\n\n \/\/warns user if favicon file doesn't exist\n if(!std::ifstream(faviconPathStr.c_str()))\n {\n std::cout << \"warning: \" << readPath << \": line \" << lineNo << \": favicon file \" << faviconPathStr << \" does not exist\" << std::endl;\n }\n\n Path faviconPath;\n faviconPath.set_file_path_from(faviconPathStr);\n\n Path pathToFavicon(pathBetween(pageToBuild.pagePath.dir, faviconPath.dir), faviconPath.file);\n\n std::string faviconInclude=\"<link rel='icon' type='image\/png' href='\";\n faviconInclude += pathToFavicon.str();\n faviconInclude+=\"'>\";\n\n processedPage << faviconInclude;\n indentAmount += faviconInclude.length();\n }\n else if(inLine.substr(linePos, 12) == \"@cssinclude(\") \/\/checks for css includes\n {\n linePos+=std::string(\"@cssinclude(\").length();\n std::string cssPathStr=\"\";\n\n for(; inLine[linePos] != ')'; linePos++)\n if(inLine[linePos] != '\"' && inLine[linePos] != '\\'')\n cssPathStr += inLine[linePos];\n linePos++;\n\n \/\/warns user if css file doesn't exist\n if(!std::ifstream(cssPathStr.c_str()))\n {\n std::cout << \"warning: \" << readPath << \": line \" << lineNo << \": css file \" << cssPathStr << \"does not exist\" << std::endl;\n }\n\n Path cssPath;\n cssPath.set_file_path_from(cssPathStr);\n\n Path pathToCSSFile(pathBetween(pageToBuild.pagePath.dir, cssPath.dir), cssPath.file);\n\n std::string cssInclude=\"<link rel='stylesheet' type='text\/css' href='\";\n cssInclude += pathToCSSFile.str();\n cssInclude+=\"'>\";\n\n processedPage << cssInclude;\n indentAmount += cssInclude.length();\n }\n else if(inLine.substr(linePos, 11) == \"@jsinclude(\") \/\/checks for js includes\n {\n linePos+=std::string(\"@jsinclude(\").length();\n std::string jsPathStr=\"\";\n\n for(; inLine[linePos] != ')'; linePos++)\n if(inLine[linePos] != '\"' && inLine[linePos] != '\\'')\n jsPathStr += inLine[linePos];\n linePos++;\n\n \/\/warns user if js file doesn't exist\n if(!std::ifstream(jsPathStr.c_str()))\n std::cout << \"warning: \" << readPath << \": line \" << lineNo << \": js file \" << jsPathStr << \"does not exist\" << std::endl;\n\n Path jsPath;\n jsPath.set_file_path_from(jsPathStr);\n\n Path pathToJSFile(pathBetween(pageToBuild.pagePath.dir, jsPath.dir), jsPath.file);\n\n std::string jsInclude=\"<script type='text\/javascript' src='\";\n jsInclude += pathToJSFile.str();\n jsInclude+=\"'><\/script>\";\n\n processedPage << jsInclude;\n indentAmount += jsInclude.length();\n }\n else\n {\n processedPage << '@';\n indentAmount += \" \";\n linePos++;\n }\n }\n else \/\/regular character\n {\n if(inLine[linePos] == '\\t')\n indentAmount += '\\t';\n else\n indentAmount += ' ';\n processedPage << inLine[linePos++];\n }\n }\n }\n\n if(codeBlockDepth > baseCodeBlockDepth)\n {\n std::cout << \"error: \" << readPath << \": line \" << openCodeLineNo << \": <pre*> open tag has no following <\/pre> close tag.\" << std::endl << std::endl;\n return 1;\n }\n\n ifs.close();\n\n return 0;\n}\n<|endoftext|>"} {"text":"<commit_before>\/*\n * Copyright (c) 2016, Facebook, Inc.\n * All rights reserved.\n *\n * This source code is licensed under the BSD-style license found in the\n * LICENSE file in the root directory of this source tree. An additional grant\n * of patent rights can be found in the PATENTS file in the same directory.\n *\n *\/\n#include <gtest\/gtest.h>\n\n#include <unistd.h>\n\n#include <folly\/Exception.h>\n#include <folly\/File.h>\n#include <folly\/io\/async\/EventBase.h>\n#include <folly\/Random.h>\n\n#include \"bistro\/bistro\/processes\/AsyncReadPipe.h\"\n#include \"bistro\/bistro\/processes\/tests\/utils.h\"\n\nusing namespace facebook::bistro;\n\n\/**\n * Reads lines from a pipe via asyncReadPipe() and readPipeLinesCallback().\n *\n * Writes message to a pipe in randomly sized chunks. Randomly alternates\n * between reading and writing (so that \"read read write\", and \"write write\n * read\" patterns are fairly probable, as are strict alternations).\n *\n * Checks that the lines conform to: a line always contains exactly one\n * delimiter (at the end of the line), except for EOF, in which case the\n * line has no delimiter.\n *\n * Checks that the concatenation of the lines reconstructs the message.\n *\/\nvoid checkPipeRead(const std::string& message) {\n folly::File read_pipe, write_pipe;\n makePipe(&read_pipe, &write_pipe);\n\n size_t cursor = 0;\n auto write_chunk_fn = [&]() {\n auto bytes_left = message.size() - cursor;\n if (!bytes_left) {\n write_pipe.close(); \/\/ idempotent\n return;\n }\n auto to_write = folly::Random::rand32(1, bytes_left + 1);\n auto written =\n folly::writeNoInt(write_pipe.fd(), message.data() + cursor, to_write);\n folly::checkUnixError(written, \"write\");\n LOG(INFO) << \"wrote: '\" << folly::StringPiece(\n message.data() + cursor, message.data() + cursor + written\n ) << \"'\";\n cursor += written;\n };\n\n folly::EventBase evb;\n int read_fd = read_pipe.fd();\n bool saw_eof = false; \/\/ Ensure the callback sees EOF exactly once\n std::string read_message; \/\/ Try to reconstruct the message\n auto closed = asyncReadPipe(\n &evb,\n std::move(read_pipe),\n readPipeLinesCallback([&](AsyncReadPipe*, folly::StringPiece s) {\n EXPECT_FALSE(saw_eof); \/\/ Saw EOF at most once\n read_message.append(s.begin(), s.end());\n if (!s.empty()) {\n LOG(INFO) << read_fd << \" read: '\" << s << \"'\";\n }\n if (s.empty() || s.back() != '\\n') {\n EXPECT_EQ(std::string::npos, folly::qfind(s, '\\n')); \/\/ No EOL at all\n LOG(INFO) << read_fd << \" - EOF\";\n saw_eof = true;\n } else {\n EXPECT_EQ(s.size() - 1, folly::qfind(s, '\\n')); \/\/ EOL only at the end\n }\n })\n )->pipeClosed();\n\n while (!closed.isReady()) {\n if (folly::Random::oneIn(2)) {\n write_chunk_fn();\n }\n if (folly::Random::oneIn(2)) {\n evb.loopOnce(EVLOOP_NONBLOCK);\n }\n }\n EXPECT_TRUE(saw_eof);\n EXPECT_EQ(message, read_message);\n}\n\nTEST(TestAsyncReadPipe, SimpleRead) {\n \/\/ Repeat the test a few times since it is randomized.\n for (size_t i = 0; i < 50; ++i) {\n checkPipeRead(\"\");\n checkPipeRead(\"bunnies eat carrots and cabbage\");\n checkPipeRead(\"\\n\\nbunnies\\n\\n\\neat\\ncarrots\\nand\\ncabbage\\n\\n\");\n }\n}\n\nnamespace { class TestError : public std::exception {}; }\n\nTEST(TestAsyncReadPipe, CallbackException) {\n folly::File read_pipe;\n makePipe(&read_pipe, nullptr);\n\n folly::EventBase evb;\n auto closed = asyncReadPipe(\n &evb,\n std::move(read_pipe),\n [&](AsyncReadPipe*) -> bool { throw TestError(); }\n )->pipeClosed();\n while (!closed.isReady()) { evb.loop(); }\n EXPECT_THROW(closed.get(), TestError);\n}\n\nTEST(TestAsyncReadPipe, PauseResume) {\n folly::File read_pipe, write_pipe;\n makePipe(&read_pipe, &write_pipe);\n\n size_t lines_before_pause = 3;\n folly::EventBase evb;\n auto pipe = asyncReadPipe(\n &evb,\n std::move(read_pipe),\n readPipeLinesCallback([&](AsyncReadPipe* pipe, folly::StringPiece s) {\n if (!s.empty()) {\n LOG(INFO) << \"Read: '\" << s << \"'\";\n --lines_before_pause;\n if (lines_before_pause == 0) {\n pipe->pause();\n }\n }\n }, 0, '\\n', 1) \/\/ 1-char buffer to ensure that pause is \"instant\"\n );\n auto closed = pipe->pipeClosed();\n\n auto write_fn = [&](const char* msg) {\n \/\/ Will deadlock if the pipe buffer fills up, but I'll take my chances.\n folly::writeFull(write_pipe.fd(), msg, strlen(msg));\n };\n\n evb.loopOnce(EVLOOP_NONBLOCK); \/\/ No data, no action\n EXPECT_EQ(3, lines_before_pause);\n\n \/\/ The first 3 are consumed, and then we pause.\n for (int i = 0; i < 6; ++i) {\n write_fn(\"a\\n\");\n evb.loopOnce(EVLOOP_NONBLOCK);\n EXPECT_EQ((i < 3) ? (2 - i) : 0, lines_before_pause);\n }\n\n \/\/ Consume all the lines, and check that no more events fire.\n lines_before_pause = 5;\n pipe->resume();\n EXPECT_EQ(5, lines_before_pause); \/\/ Doesn't fire without the EventBase\n evb.loopOnce(EVLOOP_NONBLOCK);\n EXPECT_EQ(2, lines_before_pause); \/\/ All 3 blocked lines get consumed\n evb.loopOnce(EVLOOP_NONBLOCK); \/\/ Nothing more to read yet.\n write_fn(\"b\\nc\\nd\\nf\\ng\\n\");\n EXPECT_EQ(2, lines_before_pause);\n evb.loopOnce(EVLOOP_NONBLOCK);\n EXPECT_EQ(0, lines_before_pause); \/\/ 2 consumed, 3 to go\n\n lines_before_pause = 1;\n pipe->resume();\n EXPECT_EQ(1, lines_before_pause);\n evb.loopOnce(EVLOOP_NONBLOCK);\n EXPECT_EQ(0, lines_before_pause); \/\/ 1 consumed, 2 to go\n\n lines_before_pause = 2;\n pipe->resume();\n EXPECT_EQ(2, lines_before_pause);\n evb.loopOnce(EVLOOP_NONBLOCK);\n EXPECT_EQ(0, lines_before_pause); \/\/ All consumed\n\n EXPECT_FALSE(closed.isReady());\n write_pipe.close();\n EXPECT_FALSE(closed.isReady()); \/\/ The EventBase didn't run yet\n evb.loopOnce(EVLOOP_NONBLOCK);\n EXPECT_FALSE(closed.isReady()); \/\/ The pipe is paused, so we didn't know\n pipe->resume();\n evb.loopOnce(EVLOOP_NONBLOCK);\n EXPECT_TRUE(closed.isReady()); \/\/ Now we know\n EXPECT_EQ(0, lines_before_pause); \/\/ No more lines were seen\n}\n\nTEST(TestAsyncReadPipe, ExternalClose) {\n folly::File read_pipe, write_pipe;\n makePipe(&read_pipe, &write_pipe);\n\n folly::EventBase evb;\n size_t num_lines = 0;\n auto pipe = asyncReadPipe(\n &evb,\n std::move(read_pipe),\n readPipeLinesCallback(\n [&](AsyncReadPipe* \/*pipe*\/, folly::StringPiece s) {\n if (!s.empty()) {\n LOG(INFO) << \"Read: '\" << s << \"'\";\n ++num_lines;\n }\n },\n 0,\n '\\n',\n 1) \/\/ 1-char buffer to ensure that close is \"instant\"\n );\n auto closed = pipe->pipeClosed();\n\n evb.loopOnce(EVLOOP_NONBLOCK); \/\/ No data, no action\n EXPECT_EQ(0, num_lines);\n EXPECT_FALSE(closed.isReady());\n\n auto write_fn = [&](const char* msg) {\n \/\/ Will deadlock if the pipe buffer fills up, but I'll take my chances.\n folly::writeFull(write_pipe.fd(), msg, strlen(msg));\n };\n\n \/\/ Feed through some lines without closing the pipe\n const int kMaxLines = 6;\n for (int i = 0; i < kMaxLines; ++i) {\n write_fn(\"a\\n\");\n evb.loopOnce(EVLOOP_NONBLOCK);\n EXPECT_EQ(i + 1, num_lines);\n EXPECT_FALSE(closed.isReady());\n }\n \/\/ These writes will get lost since we're synchronously closing the pipe.\n write_fn(\"b\\n\");\n write_fn(\"c\\n\");\n write_fn(\"d\\n\");\n pipe->close();\n EXPECT_TRUE(closed.isReady());\n\n \/\/ Nothing more happens on this event base, and we're the pipe's sole owner.\n evb.loopOnce(EVLOOP_NONBLOCK);\n EXPECT_EQ(kMaxLines, num_lines);\n EXPECT_EQ(1, pipe.use_count());\n}\n<commit_msg>use rvalue-qual Future::get(): pass 5<commit_after>\/*\n * Copyright (c) 2016-present, Facebook, Inc.\n * All rights reserved.\n *\n * This source code is licensed under the BSD-style license found in the\n * LICENSE file in the root directory of this source tree. An additional grant\n * of patent rights can be found in the PATENTS file in the same directory.\n *\n *\/\n#include <gtest\/gtest.h>\n\n#include <unistd.h>\n\n#include <folly\/Exception.h>\n#include <folly\/File.h>\n#include <folly\/io\/async\/EventBase.h>\n#include <folly\/Random.h>\n\n#include \"bistro\/bistro\/processes\/AsyncReadPipe.h\"\n#include \"bistro\/bistro\/processes\/tests\/utils.h\"\n\nusing namespace facebook::bistro;\n\n\/**\n * Reads lines from a pipe via asyncReadPipe() and readPipeLinesCallback().\n *\n * Writes message to a pipe in randomly sized chunks. Randomly alternates\n * between reading and writing (so that \"read read write\", and \"write write\n * read\" patterns are fairly probable, as are strict alternations).\n *\n * Checks that the lines conform to: a line always contains exactly one\n * delimiter (at the end of the line), except for EOF, in which case the\n * line has no delimiter.\n *\n * Checks that the concatenation of the lines reconstructs the message.\n *\/\nvoid checkPipeRead(const std::string& message) {\n folly::File read_pipe, write_pipe;\n makePipe(&read_pipe, &write_pipe);\n\n size_t cursor = 0;\n auto write_chunk_fn = [&]() {\n auto bytes_left = message.size() - cursor;\n if (!bytes_left) {\n write_pipe.close(); \/\/ idempotent\n return;\n }\n auto to_write = folly::Random::rand32(1, bytes_left + 1);\n auto written =\n folly::writeNoInt(write_pipe.fd(), message.data() + cursor, to_write);\n folly::checkUnixError(written, \"write\");\n LOG(INFO) << \"wrote: '\" << folly::StringPiece(\n message.data() + cursor, message.data() + cursor + written\n ) << \"'\";\n cursor += written;\n };\n\n folly::EventBase evb;\n int read_fd = read_pipe.fd();\n bool saw_eof = false; \/\/ Ensure the callback sees EOF exactly once\n std::string read_message; \/\/ Try to reconstruct the message\n auto closed = asyncReadPipe(\n &evb,\n std::move(read_pipe),\n readPipeLinesCallback([&](AsyncReadPipe*, folly::StringPiece s) {\n EXPECT_FALSE(saw_eof); \/\/ Saw EOF at most once\n read_message.append(s.begin(), s.end());\n if (!s.empty()) {\n LOG(INFO) << read_fd << \" read: '\" << s << \"'\";\n }\n if (s.empty() || s.back() != '\\n') {\n EXPECT_EQ(std::string::npos, folly::qfind(s, '\\n')); \/\/ No EOL at all\n LOG(INFO) << read_fd << \" - EOF\";\n saw_eof = true;\n } else {\n EXPECT_EQ(s.size() - 1, folly::qfind(s, '\\n')); \/\/ EOL only at the end\n }\n })\n )->pipeClosed();\n\n while (!closed.isReady()) {\n if (folly::Random::oneIn(2)) {\n write_chunk_fn();\n }\n if (folly::Random::oneIn(2)) {\n evb.loopOnce(EVLOOP_NONBLOCK);\n }\n }\n EXPECT_TRUE(saw_eof);\n EXPECT_EQ(message, read_message);\n}\n\nTEST(TestAsyncReadPipe, SimpleRead) {\n \/\/ Repeat the test a few times since it is randomized.\n for (size_t i = 0; i < 50; ++i) {\n checkPipeRead(\"\");\n checkPipeRead(\"bunnies eat carrots and cabbage\");\n checkPipeRead(\"\\n\\nbunnies\\n\\n\\neat\\ncarrots\\nand\\ncabbage\\n\\n\");\n }\n}\n\nnamespace { class TestError : public std::exception {}; }\n\nTEST(TestAsyncReadPipe, CallbackException) {\n folly::File read_pipe;\n makePipe(&read_pipe, nullptr);\n\n folly::EventBase evb;\n auto closed = asyncReadPipe(\n &evb,\n std::move(read_pipe),\n [&](AsyncReadPipe*) -> bool { throw TestError(); }\n )->pipeClosed();\n while (!closed.isReady()) { evb.loop(); }\n EXPECT_THROW(std::move(closed).get(), TestError);\n}\n\nTEST(TestAsyncReadPipe, PauseResume) {\n folly::File read_pipe, write_pipe;\n makePipe(&read_pipe, &write_pipe);\n\n size_t lines_before_pause = 3;\n folly::EventBase evb;\n auto pipe = asyncReadPipe(\n &evb,\n std::move(read_pipe),\n readPipeLinesCallback([&](AsyncReadPipe* pipe, folly::StringPiece s) {\n if (!s.empty()) {\n LOG(INFO) << \"Read: '\" << s << \"'\";\n --lines_before_pause;\n if (lines_before_pause == 0) {\n pipe->pause();\n }\n }\n }, 0, '\\n', 1) \/\/ 1-char buffer to ensure that pause is \"instant\"\n );\n auto closed = pipe->pipeClosed();\n\n auto write_fn = [&](const char* msg) {\n \/\/ Will deadlock if the pipe buffer fills up, but I'll take my chances.\n folly::writeFull(write_pipe.fd(), msg, strlen(msg));\n };\n\n evb.loopOnce(EVLOOP_NONBLOCK); \/\/ No data, no action\n EXPECT_EQ(3, lines_before_pause);\n\n \/\/ The first 3 are consumed, and then we pause.\n for (int i = 0; i < 6; ++i) {\n write_fn(\"a\\n\");\n evb.loopOnce(EVLOOP_NONBLOCK);\n EXPECT_EQ((i < 3) ? (2 - i) : 0, lines_before_pause);\n }\n\n \/\/ Consume all the lines, and check that no more events fire.\n lines_before_pause = 5;\n pipe->resume();\n EXPECT_EQ(5, lines_before_pause); \/\/ Doesn't fire without the EventBase\n evb.loopOnce(EVLOOP_NONBLOCK);\n EXPECT_EQ(2, lines_before_pause); \/\/ All 3 blocked lines get consumed\n evb.loopOnce(EVLOOP_NONBLOCK); \/\/ Nothing more to read yet.\n write_fn(\"b\\nc\\nd\\nf\\ng\\n\");\n EXPECT_EQ(2, lines_before_pause);\n evb.loopOnce(EVLOOP_NONBLOCK);\n EXPECT_EQ(0, lines_before_pause); \/\/ 2 consumed, 3 to go\n\n lines_before_pause = 1;\n pipe->resume();\n EXPECT_EQ(1, lines_before_pause);\n evb.loopOnce(EVLOOP_NONBLOCK);\n EXPECT_EQ(0, lines_before_pause); \/\/ 1 consumed, 2 to go\n\n lines_before_pause = 2;\n pipe->resume();\n EXPECT_EQ(2, lines_before_pause);\n evb.loopOnce(EVLOOP_NONBLOCK);\n EXPECT_EQ(0, lines_before_pause); \/\/ All consumed\n\n EXPECT_FALSE(closed.isReady());\n write_pipe.close();\n EXPECT_FALSE(closed.isReady()); \/\/ The EventBase didn't run yet\n evb.loopOnce(EVLOOP_NONBLOCK);\n EXPECT_FALSE(closed.isReady()); \/\/ The pipe is paused, so we didn't know\n pipe->resume();\n evb.loopOnce(EVLOOP_NONBLOCK);\n EXPECT_TRUE(closed.isReady()); \/\/ Now we know\n EXPECT_EQ(0, lines_before_pause); \/\/ No more lines were seen\n}\n\nTEST(TestAsyncReadPipe, ExternalClose) {\n folly::File read_pipe, write_pipe;\n makePipe(&read_pipe, &write_pipe);\n\n folly::EventBase evb;\n size_t num_lines = 0;\n auto pipe = asyncReadPipe(\n &evb,\n std::move(read_pipe),\n readPipeLinesCallback(\n [&](AsyncReadPipe* \/*pipe*\/, folly::StringPiece s) {\n if (!s.empty()) {\n LOG(INFO) << \"Read: '\" << s << \"'\";\n ++num_lines;\n }\n },\n 0,\n '\\n',\n 1) \/\/ 1-char buffer to ensure that close is \"instant\"\n );\n auto closed = pipe->pipeClosed();\n\n evb.loopOnce(EVLOOP_NONBLOCK); \/\/ No data, no action\n EXPECT_EQ(0, num_lines);\n EXPECT_FALSE(closed.isReady());\n\n auto write_fn = [&](const char* msg) {\n \/\/ Will deadlock if the pipe buffer fills up, but I'll take my chances.\n folly::writeFull(write_pipe.fd(), msg, strlen(msg));\n };\n\n \/\/ Feed through some lines without closing the pipe\n const int kMaxLines = 6;\n for (int i = 0; i < kMaxLines; ++i) {\n write_fn(\"a\\n\");\n evb.loopOnce(EVLOOP_NONBLOCK);\n EXPECT_EQ(i + 1, num_lines);\n EXPECT_FALSE(closed.isReady());\n }\n \/\/ These writes will get lost since we're synchronously closing the pipe.\n write_fn(\"b\\n\");\n write_fn(\"c\\n\");\n write_fn(\"d\\n\");\n pipe->close();\n EXPECT_TRUE(closed.isReady());\n\n \/\/ Nothing more happens on this event base, and we're the pipe's sole owner.\n evb.loopOnce(EVLOOP_NONBLOCK);\n EXPECT_EQ(kMaxLines, num_lines);\n EXPECT_EQ(1, pipe.use_count());\n}\n<|endoftext|>"} {"text":"<commit_before>\/*\n * Copyright 2004 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 <signal.h>\n#include <stdarg.h>\n\n#include \"webrtc\/base\/gunit.h\"\n#include \"webrtc\/base\/logging.h\"\n#include \"webrtc\/base\/physicalsocketserver.h\"\n#include \"webrtc\/base\/scoped_ptr.h\"\n#include \"webrtc\/base\/socket_unittest.h\"\n#include \"webrtc\/base\/testutils.h\"\n#include \"webrtc\/base\/thread.h\"\n#include \"webrtc\/test\/testsupport\/gtest_disable.h\"\n\nnamespace rtc {\n\nclass PhysicalSocketTest : public SocketTest {\n};\n\nTEST_F(PhysicalSocketTest, TestConnectIPv4) {\n SocketTest::TestConnectIPv4();\n}\n\n\/\/ Crashes on Linux. See webrtc:4923.\n#if defined(WEBRTC_LINUX)\n#define MAYBE_TestConnectIPv6 DISABLED_TestConnectIPv6\n#else\n#define MAYBE_TestConnectIPv6 TestConnectIPv6\n#endif\nTEST_F(PhysicalSocketTest, MAYBE_TestConnectIPv6) {\n SocketTest::TestConnectIPv6();\n}\n\nTEST_F(PhysicalSocketTest, TestConnectWithDnsLookupIPv4) {\n SocketTest::TestConnectWithDnsLookupIPv4();\n}\n\nTEST_F(PhysicalSocketTest, TestConnectWithDnsLookupIPv6) {\n SocketTest::TestConnectWithDnsLookupIPv6();\n}\n\nTEST_F(PhysicalSocketTest, TestConnectFailIPv4) {\n SocketTest::TestConnectFailIPv4();\n}\n\n\/\/ Crashes on Linux. See webrtc:4923.\n#if defined(WEBRTC_LINUX)\n#define MAYBE_TestConnectFailIPv6 DISABLED_TestConnectFailIPv6\n#else\n#define MAYBE_TestConnectFailIPv6 TestConnectFailIPv6\n#endif\nTEST_F(PhysicalSocketTest, MAYBE_TestConnectFailIPv6) {\n SocketTest::TestConnectFailIPv6();\n}\n\nTEST_F(PhysicalSocketTest, TestConnectWithDnsLookupFailIPv4) {\n SocketTest::TestConnectWithDnsLookupFailIPv4();\n}\n\n\/\/ Crashes on Linux. See webrtc:4923.\n#if defined(WEBRTC_LINUX)\n#define MAYBE_TestConnectWithDnsLookupFailIPv6 \\\n DISABLED_TestConnectWithDnsLookupFailIPv6\n#else\n#define MAYBE_TestConnectWithDnsLookupFailIPv6 \\\n TestConnectWithDnsLookupFailIPv6\n#endif\nTEST_F(PhysicalSocketTest, MAYBE_TestConnectWithDnsLookupFailIPv6) {\n SocketTest::TestConnectWithDnsLookupFailIPv6();\n}\n\n\nTEST_F(PhysicalSocketTest, TestConnectWithClosedSocketIPv4) {\n SocketTest::TestConnectWithClosedSocketIPv4();\n}\n\n\/\/ Crashes on Linux. See webrtc:4923.\n#if defined(WEBRTC_LINUX)\n#define MAYBE_TestConnectWithClosedSocketIPv6 \\\n DISABLED_TestConnectWithClosedSocketIPv6\n#else\n#define MAYBE_TestConnectWithClosedSocketIPv6 TestConnectWithClosedSocketIPv6\n#endif\nTEST_F(PhysicalSocketTest, MAYBE_TestConnectWithClosedSocketIPv6) {\n SocketTest::TestConnectWithClosedSocketIPv6();\n}\n\nTEST_F(PhysicalSocketTest, TestConnectWhileNotClosedIPv4) {\n SocketTest::TestConnectWhileNotClosedIPv4();\n}\n\n\/\/ Crashes on Linux. See webrtc:4923.\n#if defined(WEBRTC_LINUX)\n#define MAYBE_TestConnectWhileNotClosedIPv6 \\\n DISABLED_TestConnectWhileNotClosedIPv6\n#else\n#define MAYBE_TestConnectWhileNotClosedIPv6 TestConnectWhileNotClosedIPv6\n#endif\nTEST_F(PhysicalSocketTest, MAYBE_TestConnectWhileNotClosedIPv6) {\n SocketTest::TestConnectWhileNotClosedIPv6();\n}\n\nTEST_F(PhysicalSocketTest, TestServerCloseDuringConnectIPv4) {\n SocketTest::TestServerCloseDuringConnectIPv4();\n}\n\n\/\/ Crashes on Linux. See webrtc:4923.\n#if defined(WEBRTC_LINUX)\n#define MAYBE_TestServerCloseDuringConnectIPv6 \\\n DISABLED_TestServerCloseDuringConnectIPv6\n#else\n#define MAYBE_TestServerCloseDuringConnectIPv6 TestServerCloseDuringConnectIPv6\n#endif\nTEST_F(PhysicalSocketTest, MAYBE_TestServerCloseDuringConnectIPv6) {\n SocketTest::TestServerCloseDuringConnectIPv6();\n}\n\nTEST_F(PhysicalSocketTest, TestClientCloseDuringConnectIPv4) {\n SocketTest::TestClientCloseDuringConnectIPv4();\n}\n\n\/\/ Crashes on Linux. See webrtc:4923.\n#if defined(WEBRTC_LINUX)\n#define MAYBE_TestClientCloseDuringConnectIPv6 \\\n DISABLED_TestClientCloseDuringConnectIPv6\n#else\n#define MAYBE_TestClientCloseDuringConnectIPv6 TestClientCloseDuringConnectIPv6\n#endif\nTEST_F(PhysicalSocketTest, MAYBE_TestClientCloseDuringConnectIPv6) {\n SocketTest::TestClientCloseDuringConnectIPv6();\n}\n\nTEST_F(PhysicalSocketTest, TestServerCloseIPv4) {\n SocketTest::TestServerCloseIPv4();\n}\n\n\/\/ Crashes on Linux. See webrtc:4923.\n#if defined(WEBRTC_LINUX)\n#define MAYBE_TestServerCloseIPv6 DISABLED_TestServerCloseIPv6\n#else\n#define MAYBE_TestServerCloseIPv6 TestServerCloseIPv6\n#endif\nTEST_F(PhysicalSocketTest, MAYBE_TestServerCloseIPv6) {\n SocketTest::TestServerCloseIPv6();\n}\n\nTEST_F(PhysicalSocketTest, TestCloseInClosedCallbackIPv4) {\n SocketTest::TestCloseInClosedCallbackIPv4();\n}\n\n\/\/ Crashes on Linux. See webrtc:4923.\n#if defined(WEBRTC_LINUX)\n#define MAYBE_TestCloseInClosedCallbackIPv6 \\\n DISABLED_TestCloseInClosedCallbackIPv6\n#else\n#define MAYBE_TestCloseInClosedCallbackIPv6 TestCloseInClosedCallbackIPv6\n#endif\nTEST_F(PhysicalSocketTest, MAYBE_TestCloseInClosedCallbackIPv6) {\n SocketTest::TestCloseInClosedCallbackIPv6();\n}\n\nTEST_F(PhysicalSocketTest, TestSocketServerWaitIPv4) {\n SocketTest::TestSocketServerWaitIPv4();\n}\n\n\/\/ Crashes on Linux. See webrtc:4923.\n#if defined(WEBRTC_LINUX)\n#define MAYBE_TestSocketServerWaitIPv6 DISABLED_TestSocketServerWaitIPv6\n#else\n#define MAYBE_TestSocketServerWaitIPv6 TestSocketServerWaitIPv6\n#endif\nTEST_F(PhysicalSocketTest, MAYBE_TestSocketServerWaitIPv6) {\n SocketTest::TestSocketServerWaitIPv6();\n}\n\nTEST_F(PhysicalSocketTest, TestTcpIPv4) {\n SocketTest::TestTcpIPv4();\n}\n\n\/\/ Crashes on Linux. See webrtc:4923.\n#if defined(WEBRTC_LINUX)\n#define MAYBE_TestTcpIPv6 DISABLED_TestTcpIPv6\n#else\n#define MAYBE_TestTcpIPv6 TestTcpIPv6\n#endif\nTEST_F(PhysicalSocketTest, MAYBE_TestTcpIPv6) {\n SocketTest::TestTcpIPv6();\n}\n\nTEST_F(PhysicalSocketTest, TestUdpIPv4) {\n SocketTest::TestUdpIPv4();\n}\n\n\/\/ Crashes on Linux. See webrtc:4923.\n#if defined(WEBRTC_LINUX)\n#define MAYBE_TestUdpIPv6 DISABLED_TestUdpIPv6\n#else\n#define MAYBE_TestUdpIPv6 TestUdpIPv6\n#endif\nTEST_F(PhysicalSocketTest, MAYBE_TestUdpIPv6) {\n SocketTest::TestUdpIPv6();\n}\n\n\/\/ Disable for TSan v2, see\n\/\/ https:\/\/code.google.com\/p\/webrtc\/issues\/detail?id=3498 for details.\n\/\/ Also disable for MSan, see:\n\/\/ https:\/\/code.google.com\/p\/webrtc\/issues\/detail?id=4958\n\/\/ TODO(deadbeef): Enable again once test is reimplemented to be unflaky.\n\/\/ Also disable for ASan.\n#if defined(THREAD_SANITIZER) || defined(MEMORY_SANITIZER) || \\\n defined(ADDRESS_SANITIZER)\n#define MAYBE_TestUdpReadyToSendIPv4 DISABLED_TestUdpReadyToSendIPv4\n#else\n#define MAYBE_TestUdpReadyToSendIPv4 TestUdpReadyToSendIPv4\n#endif\nTEST_F(PhysicalSocketTest, MAYBE_TestUdpReadyToSendIPv4) {\n SocketTest::TestUdpReadyToSendIPv4();\n}\n\nTEST_F(PhysicalSocketTest, TestUdpReadyToSendIPv6) {\n SocketTest::TestUdpReadyToSendIPv6();\n}\n\nTEST_F(PhysicalSocketTest, TestGetSetOptionsIPv4) {\n SocketTest::TestGetSetOptionsIPv4();\n}\n\nTEST_F(PhysicalSocketTest, TestGetSetOptionsIPv6) {\n SocketTest::TestGetSetOptionsIPv6();\n}\n\n#if defined(WEBRTC_POSIX)\n\nclass PosixSignalDeliveryTest : public testing::Test {\n public:\n static void RecordSignal(int signum) {\n signals_received_.push_back(signum);\n signaled_thread_ = Thread::Current();\n }\n\n protected:\n void SetUp() {\n ss_.reset(new PhysicalSocketServer());\n }\n\n void TearDown() {\n ss_.reset(NULL);\n signals_received_.clear();\n signaled_thread_ = NULL;\n }\n\n bool ExpectSignal(int signum) {\n if (signals_received_.empty()) {\n LOG(LS_ERROR) << \"ExpectSignal(): No signal received\";\n return false;\n }\n if (signals_received_[0] != signum) {\n LOG(LS_ERROR) << \"ExpectSignal(): Received signal \" <<\n signals_received_[0] << \", expected \" << signum;\n return false;\n }\n signals_received_.erase(signals_received_.begin());\n return true;\n }\n\n bool ExpectNone() {\n bool ret = signals_received_.empty();\n if (!ret) {\n LOG(LS_ERROR) << \"ExpectNone(): Received signal \" << signals_received_[0]\n << \", expected none\";\n }\n return ret;\n }\n\n static std::vector<int> signals_received_;\n static Thread *signaled_thread_;\n\n scoped_ptr<PhysicalSocketServer> ss_;\n};\n\nstd::vector<int> PosixSignalDeliveryTest::signals_received_;\nThread *PosixSignalDeliveryTest::signaled_thread_ = NULL;\n\n\/\/ Test receiving a synchronous signal while not in Wait() and then entering\n\/\/ Wait() afterwards.\nTEST_F(PosixSignalDeliveryTest, RaiseThenWait) {\n ASSERT_TRUE(ss_->SetPosixSignalHandler(SIGTERM, &RecordSignal));\n raise(SIGTERM);\n EXPECT_TRUE(ss_->Wait(0, true));\n EXPECT_TRUE(ExpectSignal(SIGTERM));\n EXPECT_TRUE(ExpectNone());\n}\n\n\/\/ Test that we can handle getting tons of repeated signals and that we see all\n\/\/ the different ones.\nTEST_F(PosixSignalDeliveryTest, InsanelyManySignals) {\n ss_->SetPosixSignalHandler(SIGTERM, &RecordSignal);\n ss_->SetPosixSignalHandler(SIGINT, &RecordSignal);\n for (int i = 0; i < 10000; ++i) {\n raise(SIGTERM);\n }\n raise(SIGINT);\n EXPECT_TRUE(ss_->Wait(0, true));\n \/\/ Order will be lowest signal numbers first.\n EXPECT_TRUE(ExpectSignal(SIGINT));\n EXPECT_TRUE(ExpectSignal(SIGTERM));\n EXPECT_TRUE(ExpectNone());\n}\n\n\/\/ Test that a signal during a Wait() call is detected.\nTEST_F(PosixSignalDeliveryTest, SignalDuringWait) {\n ss_->SetPosixSignalHandler(SIGALRM, &RecordSignal);\n alarm(1);\n EXPECT_TRUE(ss_->Wait(1500, true));\n EXPECT_TRUE(ExpectSignal(SIGALRM));\n EXPECT_TRUE(ExpectNone());\n}\n\nclass RaiseSigTermRunnable : public Runnable {\n void Run(Thread *thread) {\n thread->socketserver()->Wait(1000, false);\n\n \/\/ Allow SIGTERM. This will be the only thread with it not masked so it will\n \/\/ be delivered to us.\n sigset_t mask;\n sigemptyset(&mask);\n pthread_sigmask(SIG_SETMASK, &mask, NULL);\n\n \/\/ Raise it.\n raise(SIGTERM);\n }\n};\n\n\/\/ Test that it works no matter what thread the kernel chooses to give the\n\/\/ signal to (since it's not guaranteed to be the one that Wait() runs on).\nTEST_F(PosixSignalDeliveryTest, SignalOnDifferentThread) {\n ss_->SetPosixSignalHandler(SIGTERM, &RecordSignal);\n \/\/ Mask out SIGTERM so that it can't be delivered to this thread.\n sigset_t mask;\n sigemptyset(&mask);\n sigaddset(&mask, SIGTERM);\n EXPECT_EQ(0, pthread_sigmask(SIG_SETMASK, &mask, NULL));\n \/\/ Start a new thread that raises it. It will have to be delivered to that\n \/\/ thread. Our implementation should safely handle it and dispatch\n \/\/ RecordSignal() on this thread.\n scoped_ptr<Thread> thread(new Thread());\n scoped_ptr<RaiseSigTermRunnable> runnable(new RaiseSigTermRunnable());\n thread->Start(runnable.get());\n EXPECT_TRUE(ss_->Wait(1500, true));\n EXPECT_TRUE(ExpectSignal(SIGTERM));\n EXPECT_EQ(Thread::Current(), signaled_thread_);\n EXPECT_TRUE(ExpectNone());\n}\n\n#endif\n\n} \/\/ namespace rtc\n<commit_msg>Disable PhysicalSocketTest.TestUdpReadyToSendIPv4 on Android.<commit_after>\/*\n * Copyright 2004 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 <signal.h>\n#include <stdarg.h>\n\n#include \"webrtc\/base\/gunit.h\"\n#include \"webrtc\/base\/logging.h\"\n#include \"webrtc\/base\/physicalsocketserver.h\"\n#include \"webrtc\/base\/scoped_ptr.h\"\n#include \"webrtc\/base\/socket_unittest.h\"\n#include \"webrtc\/base\/testutils.h\"\n#include \"webrtc\/base\/thread.h\"\n#include \"webrtc\/test\/testsupport\/gtest_disable.h\"\n\nnamespace rtc {\n\nclass PhysicalSocketTest : public SocketTest {\n};\n\nTEST_F(PhysicalSocketTest, TestConnectIPv4) {\n SocketTest::TestConnectIPv4();\n}\n\n\/\/ Crashes on Linux. See webrtc:4923.\n#if defined(WEBRTC_LINUX)\n#define MAYBE_TestConnectIPv6 DISABLED_TestConnectIPv6\n#else\n#define MAYBE_TestConnectIPv6 TestConnectIPv6\n#endif\nTEST_F(PhysicalSocketTest, MAYBE_TestConnectIPv6) {\n SocketTest::TestConnectIPv6();\n}\n\nTEST_F(PhysicalSocketTest, TestConnectWithDnsLookupIPv4) {\n SocketTest::TestConnectWithDnsLookupIPv4();\n}\n\nTEST_F(PhysicalSocketTest, TestConnectWithDnsLookupIPv6) {\n SocketTest::TestConnectWithDnsLookupIPv6();\n}\n\nTEST_F(PhysicalSocketTest, TestConnectFailIPv4) {\n SocketTest::TestConnectFailIPv4();\n}\n\n\/\/ Crashes on Linux. See webrtc:4923.\n#if defined(WEBRTC_LINUX)\n#define MAYBE_TestConnectFailIPv6 DISABLED_TestConnectFailIPv6\n#else\n#define MAYBE_TestConnectFailIPv6 TestConnectFailIPv6\n#endif\nTEST_F(PhysicalSocketTest, MAYBE_TestConnectFailIPv6) {\n SocketTest::TestConnectFailIPv6();\n}\n\nTEST_F(PhysicalSocketTest, TestConnectWithDnsLookupFailIPv4) {\n SocketTest::TestConnectWithDnsLookupFailIPv4();\n}\n\n\/\/ Crashes on Linux. See webrtc:4923.\n#if defined(WEBRTC_LINUX)\n#define MAYBE_TestConnectWithDnsLookupFailIPv6 \\\n DISABLED_TestConnectWithDnsLookupFailIPv6\n#else\n#define MAYBE_TestConnectWithDnsLookupFailIPv6 \\\n TestConnectWithDnsLookupFailIPv6\n#endif\nTEST_F(PhysicalSocketTest, MAYBE_TestConnectWithDnsLookupFailIPv6) {\n SocketTest::TestConnectWithDnsLookupFailIPv6();\n}\n\n\nTEST_F(PhysicalSocketTest, TestConnectWithClosedSocketIPv4) {\n SocketTest::TestConnectWithClosedSocketIPv4();\n}\n\n\/\/ Crashes on Linux. See webrtc:4923.\n#if defined(WEBRTC_LINUX)\n#define MAYBE_TestConnectWithClosedSocketIPv6 \\\n DISABLED_TestConnectWithClosedSocketIPv6\n#else\n#define MAYBE_TestConnectWithClosedSocketIPv6 TestConnectWithClosedSocketIPv6\n#endif\nTEST_F(PhysicalSocketTest, MAYBE_TestConnectWithClosedSocketIPv6) {\n SocketTest::TestConnectWithClosedSocketIPv6();\n}\n\nTEST_F(PhysicalSocketTest, TestConnectWhileNotClosedIPv4) {\n SocketTest::TestConnectWhileNotClosedIPv4();\n}\n\n\/\/ Crashes on Linux. See webrtc:4923.\n#if defined(WEBRTC_LINUX)\n#define MAYBE_TestConnectWhileNotClosedIPv6 \\\n DISABLED_TestConnectWhileNotClosedIPv6\n#else\n#define MAYBE_TestConnectWhileNotClosedIPv6 TestConnectWhileNotClosedIPv6\n#endif\nTEST_F(PhysicalSocketTest, MAYBE_TestConnectWhileNotClosedIPv6) {\n SocketTest::TestConnectWhileNotClosedIPv6();\n}\n\nTEST_F(PhysicalSocketTest, TestServerCloseDuringConnectIPv4) {\n SocketTest::TestServerCloseDuringConnectIPv4();\n}\n\n\/\/ Crashes on Linux. See webrtc:4923.\n#if defined(WEBRTC_LINUX)\n#define MAYBE_TestServerCloseDuringConnectIPv6 \\\n DISABLED_TestServerCloseDuringConnectIPv6\n#else\n#define MAYBE_TestServerCloseDuringConnectIPv6 TestServerCloseDuringConnectIPv6\n#endif\nTEST_F(PhysicalSocketTest, MAYBE_TestServerCloseDuringConnectIPv6) {\n SocketTest::TestServerCloseDuringConnectIPv6();\n}\n\nTEST_F(PhysicalSocketTest, TestClientCloseDuringConnectIPv4) {\n SocketTest::TestClientCloseDuringConnectIPv4();\n}\n\n\/\/ Crashes on Linux. See webrtc:4923.\n#if defined(WEBRTC_LINUX)\n#define MAYBE_TestClientCloseDuringConnectIPv6 \\\n DISABLED_TestClientCloseDuringConnectIPv6\n#else\n#define MAYBE_TestClientCloseDuringConnectIPv6 TestClientCloseDuringConnectIPv6\n#endif\nTEST_F(PhysicalSocketTest, MAYBE_TestClientCloseDuringConnectIPv6) {\n SocketTest::TestClientCloseDuringConnectIPv6();\n}\n\nTEST_F(PhysicalSocketTest, TestServerCloseIPv4) {\n SocketTest::TestServerCloseIPv4();\n}\n\n\/\/ Crashes on Linux. See webrtc:4923.\n#if defined(WEBRTC_LINUX)\n#define MAYBE_TestServerCloseIPv6 DISABLED_TestServerCloseIPv6\n#else\n#define MAYBE_TestServerCloseIPv6 TestServerCloseIPv6\n#endif\nTEST_F(PhysicalSocketTest, MAYBE_TestServerCloseIPv6) {\n SocketTest::TestServerCloseIPv6();\n}\n\nTEST_F(PhysicalSocketTest, TestCloseInClosedCallbackIPv4) {\n SocketTest::TestCloseInClosedCallbackIPv4();\n}\n\n\/\/ Crashes on Linux. See webrtc:4923.\n#if defined(WEBRTC_LINUX)\n#define MAYBE_TestCloseInClosedCallbackIPv6 \\\n DISABLED_TestCloseInClosedCallbackIPv6\n#else\n#define MAYBE_TestCloseInClosedCallbackIPv6 TestCloseInClosedCallbackIPv6\n#endif\nTEST_F(PhysicalSocketTest, MAYBE_TestCloseInClosedCallbackIPv6) {\n SocketTest::TestCloseInClosedCallbackIPv6();\n}\n\nTEST_F(PhysicalSocketTest, TestSocketServerWaitIPv4) {\n SocketTest::TestSocketServerWaitIPv4();\n}\n\n\/\/ Crashes on Linux. See webrtc:4923.\n#if defined(WEBRTC_LINUX)\n#define MAYBE_TestSocketServerWaitIPv6 DISABLED_TestSocketServerWaitIPv6\n#else\n#define MAYBE_TestSocketServerWaitIPv6 TestSocketServerWaitIPv6\n#endif\nTEST_F(PhysicalSocketTest, MAYBE_TestSocketServerWaitIPv6) {\n SocketTest::TestSocketServerWaitIPv6();\n}\n\nTEST_F(PhysicalSocketTest, TestTcpIPv4) {\n SocketTest::TestTcpIPv4();\n}\n\n\/\/ Crashes on Linux. See webrtc:4923.\n#if defined(WEBRTC_LINUX)\n#define MAYBE_TestTcpIPv6 DISABLED_TestTcpIPv6\n#else\n#define MAYBE_TestTcpIPv6 TestTcpIPv6\n#endif\nTEST_F(PhysicalSocketTest, MAYBE_TestTcpIPv6) {\n SocketTest::TestTcpIPv6();\n}\n\nTEST_F(PhysicalSocketTest, TestUdpIPv4) {\n SocketTest::TestUdpIPv4();\n}\n\n\/\/ Crashes on Linux. See webrtc:4923.\n#if defined(WEBRTC_LINUX)\n#define MAYBE_TestUdpIPv6 DISABLED_TestUdpIPv6\n#else\n#define MAYBE_TestUdpIPv6 TestUdpIPv6\n#endif\nTEST_F(PhysicalSocketTest, MAYBE_TestUdpIPv6) {\n SocketTest::TestUdpIPv6();\n}\n\n\/\/ Disable for TSan v2, see\n\/\/ https:\/\/code.google.com\/p\/webrtc\/issues\/detail?id=3498 for details.\n\/\/ Also disable for MSan, see:\n\/\/ https:\/\/code.google.com\/p\/webrtc\/issues\/detail?id=4958\n\/\/ TODO(deadbeef): Enable again once test is reimplemented to be unflaky.\n\/\/ Also disable for ASan.\n\/\/ Disabled on Android: https:\/\/code.google.com\/p\/webrtc\/issues\/detail?id=4364\n#if defined(THREAD_SANITIZER) || defined(MEMORY_SANITIZER) || \\\n defined(ADDRESS_SANITIZER) || defined(WEBRTC_ANDROID)\n#define MAYBE_TestUdpReadyToSendIPv4 DISABLED_TestUdpReadyToSendIPv4\n#else\n#define MAYBE_TestUdpReadyToSendIPv4 TestUdpReadyToSendIPv4\n#endif\nTEST_F(PhysicalSocketTest, MAYBE_TestUdpReadyToSendIPv4) {\n SocketTest::TestUdpReadyToSendIPv4();\n}\n\nTEST_F(PhysicalSocketTest, TestUdpReadyToSendIPv6) {\n SocketTest::TestUdpReadyToSendIPv6();\n}\n\nTEST_F(PhysicalSocketTest, TestGetSetOptionsIPv4) {\n SocketTest::TestGetSetOptionsIPv4();\n}\n\nTEST_F(PhysicalSocketTest, TestGetSetOptionsIPv6) {\n SocketTest::TestGetSetOptionsIPv6();\n}\n\n#if defined(WEBRTC_POSIX)\n\nclass PosixSignalDeliveryTest : public testing::Test {\n public:\n static void RecordSignal(int signum) {\n signals_received_.push_back(signum);\n signaled_thread_ = Thread::Current();\n }\n\n protected:\n void SetUp() {\n ss_.reset(new PhysicalSocketServer());\n }\n\n void TearDown() {\n ss_.reset(NULL);\n signals_received_.clear();\n signaled_thread_ = NULL;\n }\n\n bool ExpectSignal(int signum) {\n if (signals_received_.empty()) {\n LOG(LS_ERROR) << \"ExpectSignal(): No signal received\";\n return false;\n }\n if (signals_received_[0] != signum) {\n LOG(LS_ERROR) << \"ExpectSignal(): Received signal \" <<\n signals_received_[0] << \", expected \" << signum;\n return false;\n }\n signals_received_.erase(signals_received_.begin());\n return true;\n }\n\n bool ExpectNone() {\n bool ret = signals_received_.empty();\n if (!ret) {\n LOG(LS_ERROR) << \"ExpectNone(): Received signal \" << signals_received_[0]\n << \", expected none\";\n }\n return ret;\n }\n\n static std::vector<int> signals_received_;\n static Thread *signaled_thread_;\n\n scoped_ptr<PhysicalSocketServer> ss_;\n};\n\nstd::vector<int> PosixSignalDeliveryTest::signals_received_;\nThread *PosixSignalDeliveryTest::signaled_thread_ = NULL;\n\n\/\/ Test receiving a synchronous signal while not in Wait() and then entering\n\/\/ Wait() afterwards.\nTEST_F(PosixSignalDeliveryTest, RaiseThenWait) {\n ASSERT_TRUE(ss_->SetPosixSignalHandler(SIGTERM, &RecordSignal));\n raise(SIGTERM);\n EXPECT_TRUE(ss_->Wait(0, true));\n EXPECT_TRUE(ExpectSignal(SIGTERM));\n EXPECT_TRUE(ExpectNone());\n}\n\n\/\/ Test that we can handle getting tons of repeated signals and that we see all\n\/\/ the different ones.\nTEST_F(PosixSignalDeliveryTest, InsanelyManySignals) {\n ss_->SetPosixSignalHandler(SIGTERM, &RecordSignal);\n ss_->SetPosixSignalHandler(SIGINT, &RecordSignal);\n for (int i = 0; i < 10000; ++i) {\n raise(SIGTERM);\n }\n raise(SIGINT);\n EXPECT_TRUE(ss_->Wait(0, true));\n \/\/ Order will be lowest signal numbers first.\n EXPECT_TRUE(ExpectSignal(SIGINT));\n EXPECT_TRUE(ExpectSignal(SIGTERM));\n EXPECT_TRUE(ExpectNone());\n}\n\n\/\/ Test that a signal during a Wait() call is detected.\nTEST_F(PosixSignalDeliveryTest, SignalDuringWait) {\n ss_->SetPosixSignalHandler(SIGALRM, &RecordSignal);\n alarm(1);\n EXPECT_TRUE(ss_->Wait(1500, true));\n EXPECT_TRUE(ExpectSignal(SIGALRM));\n EXPECT_TRUE(ExpectNone());\n}\n\nclass RaiseSigTermRunnable : public Runnable {\n void Run(Thread *thread) {\n thread->socketserver()->Wait(1000, false);\n\n \/\/ Allow SIGTERM. This will be the only thread with it not masked so it will\n \/\/ be delivered to us.\n sigset_t mask;\n sigemptyset(&mask);\n pthread_sigmask(SIG_SETMASK, &mask, NULL);\n\n \/\/ Raise it.\n raise(SIGTERM);\n }\n};\n\n\/\/ Test that it works no matter what thread the kernel chooses to give the\n\/\/ signal to (since it's not guaranteed to be the one that Wait() runs on).\nTEST_F(PosixSignalDeliveryTest, SignalOnDifferentThread) {\n ss_->SetPosixSignalHandler(SIGTERM, &RecordSignal);\n \/\/ Mask out SIGTERM so that it can't be delivered to this thread.\n sigset_t mask;\n sigemptyset(&mask);\n sigaddset(&mask, SIGTERM);\n EXPECT_EQ(0, pthread_sigmask(SIG_SETMASK, &mask, NULL));\n \/\/ Start a new thread that raises it. It will have to be delivered to that\n \/\/ thread. Our implementation should safely handle it and dispatch\n \/\/ RecordSignal() on this thread.\n scoped_ptr<Thread> thread(new Thread());\n scoped_ptr<RaiseSigTermRunnable> runnable(new RaiseSigTermRunnable());\n thread->Start(runnable.get());\n EXPECT_TRUE(ss_->Wait(1500, true));\n EXPECT_TRUE(ExpectSignal(SIGTERM));\n EXPECT_EQ(Thread::Current(), signaled_thread_);\n EXPECT_TRUE(ExpectNone());\n}\n\n#endif\n\n} \/\/ namespace rtc\n<|endoftext|>"} {"text":"<commit_before>#include <osg\/LightSource>\n\n#include <osgDB\/ReadFile>\n\n#if defined(_MSC_VER)\n#pragma warning( disable : 4505 )\n#pragma warning( default : 4996 )\n#endif\n#include <fbxsdk.h>\n\n#include \"fbxReader.h\"\n\nosgDB::ReaderWriter::ReadResult OsgFbxReader::readFbxLight(FbxNode* pNode, int& nLightCount)\n{\n const FbxLight* fbxLight = FbxCast<FbxLight>(pNode->GetNodeAttribute());\n\n if (!fbxLight)\n {\n return osgDB::ReaderWriter::ReadResult::ERROR_IN_READING_FILE;\n }\n\n osg::Light* osgLight = new osg::Light;\n osg::LightSource* osgLightSource = new osg::LightSource;\n\n osgLightSource->setLight(osgLight);\n osgLight->setLightNum(nLightCount++);\n\n FbxLight::EType fbxLightType = fbxLight->LightType.IsValid() ?\n fbxLight->LightType.Get() : FbxLight::ePoint;\n\n osgLight->setPosition(osg::Vec4(0,0,0,fbxLightType != FbxLight::eDirectional));\n\n if (fbxLightType == FbxLight::eSpot)\n {\n double coneAngle = fbxLight->OuterAngle.Get();\n double hotSpot = fbxLight->InnerAngle.Get();\n const float MIN_HOTSPOT = 0.467532f;\n\n osgLight->setSpotCutoff(static_cast<float>(coneAngle));\n\n \/\/Approximate the hotspot using the GL light exponent.\n \/\/ This formula maps a hotspot of 180 to exponent 0 (uniform light\n \/\/ distribution) and a hotspot of 45 to exponent 1 (effective light\n \/\/ intensity is attenuated by the cosine of the angle between the\n \/\/ direction of the light and the direction from the light to the vertex\n \/\/ being lighted). A hotspot close to 0 maps to exponent 128 (maximum).\n float exponent = (180.0f \/ (std::max)(static_cast<float>(hotSpot),\n MIN_HOTSPOT) - 1.0f) \/ 3.0f;\n osgLight->setSpotExponent(exponent);\n }\n\n if (fbxLight->DecayType.IsValid() &&\n fbxLight->DecayStart.IsValid())\n {\n double fbxDecayStart = fbxLight->DecayStart.Get();\n\n switch (fbxLight->DecayType.Get())\n {\n case FbxLight::eNone:\n break;\n case FbxLight::eLinear:\n osgLight->setLinearAttenuation(fbxDecayStart);\n break;\n case FbxLight::eQuadratic:\n case FbxLight::eCubic:\n osgLight->setQuadraticAttenuation(fbxDecayStart);\n break;\n }\n }\n\n osg::Vec3f osgDiffuseSpecular(1.0f, 1.0f, 1.0f);\n osg::Vec3f osgAmbient(0.0f, 0.0f, 0.0f);\n if (fbxLight->Color.IsValid())\n {\n FbxDouble3 fbxColor = fbxLight->Color.Get();\n osgDiffuseSpecular.set(\n static_cast<float>(fbxColor[0]),\n static_cast<float>(fbxColor[1]),\n static_cast<float>(fbxColor[2]));\n }\n if (fbxLight->Intensity.IsValid())\n {\n osgDiffuseSpecular *= static_cast<float>(fbxLight->Intensity.Get()) * 0.01f;\n }\n if (fbxLight->ShadowColor.IsValid())\n {\n FbxDouble3 fbxShadowColor = fbxLight->ShadowColor.Get();\n osgAmbient.set(\n static_cast<float>(fbxShadowColor[0]),\n static_cast<float>(fbxShadowColor[1]),\n static_cast<float>(fbxShadowColor[2]));\n }\n\n osgLight->setDiffuse(osg::Vec4f(osgDiffuseSpecular, 1.0f));\n osgLight->setSpecular(osg::Vec4f(osgDiffuseSpecular, 1.0f));\n osgLight->setAmbient(osg::Vec4f(osgAmbient, 1.0f));\n\n return osgDB::ReaderWriter::ReadResult(osgLightSource);\n}\n<commit_msg>From Konstantin Matveyev, \"Multiple light fix in FBX-importer\"<commit_after>#include <osg\/LightSource>\n\n#include <osgDB\/ReadFile>\n\n#if defined(_MSC_VER)\n#pragma warning( disable : 4505 )\n#pragma warning( default : 4996 )\n#endif\n#include <fbxsdk.h>\n\n#include \"fbxReader.h\"\n\nosgDB::ReaderWriter::ReadResult OsgFbxReader::readFbxLight(FbxNode* pNode, int& nLightCount)\n{\n const FbxLight* fbxLight = FbxCast<FbxLight>(pNode->GetNodeAttribute());\n\n if (!fbxLight)\n {\n return osgDB::ReaderWriter::ReadResult::ERROR_IN_READING_FILE;\n }\n\n osg::Light* osgLight = new osg::Light;\n osgLight->setLightNum(nLightCount++);\n\n osg::LightSource* osgLightSource = new osg::LightSource;\n osgLightSource->setLight(osgLight);\n\n FbxLight::EType fbxLightType = fbxLight->LightType.IsValid() ?\n fbxLight->LightType.Get() : FbxLight::ePoint;\n\n osgLight->setPosition(osg::Vec4(0,0,0,fbxLightType != FbxLight::eDirectional));\n\n if (fbxLightType == FbxLight::eSpot)\n {\n double coneAngle = fbxLight->OuterAngle.Get();\n double hotSpot = fbxLight->InnerAngle.Get();\n const float MIN_HOTSPOT = 0.467532f;\n\n osgLight->setSpotCutoff(static_cast<float>(coneAngle));\n\n \/\/Approximate the hotspot using the GL light exponent.\n \/\/ This formula maps a hotspot of 180 to exponent 0 (uniform light\n \/\/ distribution) and a hotspot of 45 to exponent 1 (effective light\n \/\/ intensity is attenuated by the cosine of the angle between the\n \/\/ direction of the light and the direction from the light to the vertex\n \/\/ being lighted). A hotspot close to 0 maps to exponent 128 (maximum).\n float exponent = (180.0f \/ (std::max)(static_cast<float>(hotSpot),\n MIN_HOTSPOT) - 1.0f) \/ 3.0f;\n osgLight->setSpotExponent(exponent);\n }\n\n if (fbxLight->DecayType.IsValid() &&\n fbxLight->DecayStart.IsValid())\n {\n double fbxDecayStart = fbxLight->DecayStart.Get();\n\n switch (fbxLight->DecayType.Get())\n {\n case FbxLight::eNone:\n break;\n case FbxLight::eLinear:\n osgLight->setLinearAttenuation(fbxDecayStart);\n break;\n case FbxLight::eQuadratic:\n case FbxLight::eCubic:\n osgLight->setQuadraticAttenuation(fbxDecayStart);\n break;\n }\n }\n\n osg::Vec3f osgDiffuseSpecular(1.0f, 1.0f, 1.0f);\n osg::Vec3f osgAmbient(0.0f, 0.0f, 0.0f);\n if (fbxLight->Color.IsValid())\n {\n FbxDouble3 fbxColor = fbxLight->Color.Get();\n osgDiffuseSpecular.set(\n static_cast<float>(fbxColor[0]),\n static_cast<float>(fbxColor[1]),\n static_cast<float>(fbxColor[2]));\n }\n if (fbxLight->Intensity.IsValid())\n {\n osgDiffuseSpecular *= static_cast<float>(fbxLight->Intensity.Get()) * 0.01f;\n }\n if (fbxLight->ShadowColor.IsValid())\n {\n FbxDouble3 fbxShadowColor = fbxLight->ShadowColor.Get();\n osgAmbient.set(\n static_cast<float>(fbxShadowColor[0]),\n static_cast<float>(fbxShadowColor[1]),\n static_cast<float>(fbxShadowColor[2]));\n }\n\n osgLight->setDiffuse(osg::Vec4f(osgDiffuseSpecular, 1.0f));\n osgLight->setSpecular(osg::Vec4f(osgDiffuseSpecular, 1.0f));\n osgLight->setAmbient(osg::Vec4f(osgAmbient, 1.0f));\n\n return osgDB::ReaderWriter::ReadResult(osgLightSource);\n}\n<|endoftext|>"} {"text":"<commit_before>\/* -*-c++-*- OpenSceneGraph - Copyright (C) 1998-2003 Robert Osfield \n *\n * This library is open source and may be redistributed and\/or modified under \n * the terms of the OpenSceneGraph Public License (OSGPL) version 0.0 or \n * (at your option) any later version. The full license is in LICENSE file\n * included with this distribution, and on the openscenegraph.org website.\n * \n * This library is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the \n * OpenSceneGraph Public License for more details.\n*\/\n#include <osgUtil\/CubeMapGenerator>\n#include <stdlib.h>\n\nusing namespace osgUtil;\n\nCubeMapGenerator::CubeMapGenerator(int texture_size)\n: osg::Referenced(),\n texture_size_(texture_size)\n{\n for (int i=0; i<6; ++i)\n { \n osg::ref_ptr<osg::Image> image = new osg::Image;\n unsigned char* data = new unsigned char [texture_size*texture_size*4];\n image->setImage(texture_size, texture_size, 1, 4, GL_RGBA, GL_UNSIGNED_BYTE, data, osg::Image::USE_NEW_DELETE);\n images_.push_back(image);\n }\n}\n\nCubeMapGenerator::CubeMapGenerator(const CubeMapGenerator ©, const osg::CopyOp ©op)\n: osg::Referenced(copy),\n texture_size_(copy.texture_size_)\n{\n Image_list::const_iterator i;\n for (i=copy.images_.begin(); i!=copy.images_.end(); ++i)\n {\n images_.push_back(static_cast<osg::Image *>(copyop(i->get())));\n }\n}\n\nvoid CubeMapGenerator::generateMap(bool use_osg_system)\n{\n const float duv = 2.0f\/(texture_size_-1);\n \n float v = 1;\n for (int i=0; i<texture_size_; ++i) {\n float u = 1;\n for (int j=0; j<texture_size_; ++j) { \n if (use_osg_system) {\n set_pixel(0, j, i, compute_color(osg::Vec3(1, -u, v)));\n set_pixel(1, j, i, compute_color(osg::Vec3(-1, u, v)));\n set_pixel(2, j, i, compute_color(osg::Vec3(-u, v, 1)));\n set_pixel(3, j, i, compute_color(osg::Vec3(-u, -v, -1)));\n set_pixel(4, j, i, compute_color(osg::Vec3(-u, -1, v)));\n set_pixel(5, j, i, compute_color(osg::Vec3(u, 1, v)));\n } else {\n set_pixel(0, j, i, compute_color(osg::Vec3(1, v, -u)));\n set_pixel(1, j, i, compute_color(osg::Vec3(-1, v, u)));\n set_pixel(2, j, i, compute_color(osg::Vec3(-u, 1, v)));\n set_pixel(3, j, i, compute_color(osg::Vec3(-u, -1, -v)));\n set_pixel(4, j, i, compute_color(osg::Vec3(-u, v, -1)));\n set_pixel(5, j, i, compute_color(osg::Vec3(u, v, 1)));\n }\n u -= duv;\n }\n v -= duv;\n }\n}\n<commit_msg>From Marco Jez, improvement to the handling of coordinates frame in CubeMapGenerator.<commit_after>\/* -*-c++-*- OpenSceneGraph - Copyright (C) 1998-2003 Robert Osfield \n *\n * This library is open source and may be redistributed and\/or modified under \n * the terms of the OpenSceneGraph Public License (OSGPL) version 0.0 or \n * (at your option) any later version. The full license is in LICENSE file\n * included with this distribution, and on the openscenegraph.org website.\n * \n * This library is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the \n * OpenSceneGraph Public License for more details.\n*\/\n#include <osgUtil\/CubeMapGenerator>\n#include <stdlib.h>\n\n#include <osg\/Matrix>\n\nusing namespace osgUtil;\n\nCubeMapGenerator::CubeMapGenerator(int texture_size)\n: osg::Referenced(),\n texture_size_(texture_size)\n{\n for (int i=0; i<6; ++i)\n { \n osg::ref_ptr<osg::Image> image = new osg::Image;\n unsigned char* data = new unsigned char [texture_size*texture_size*4];\n image->setImage(texture_size, texture_size, 1, 4, GL_RGBA, GL_UNSIGNED_BYTE, data, osg::Image::USE_NEW_DELETE);\n images_.push_back(image);\n }\n}\n\nCubeMapGenerator::CubeMapGenerator(const CubeMapGenerator ©, const osg::CopyOp ©op)\n: osg::Referenced(copy),\n texture_size_(copy.texture_size_)\n{\n Image_list::const_iterator i;\n for (i=copy.images_.begin(); i!=copy.images_.end(); ++i)\n {\n images_.push_back(static_cast<osg::Image *>(copyop(i->get())));\n }\n}\n\nvoid CubeMapGenerator::generateMap(bool use_osg_system)\n{\n\tosg::Matrix M;\n\t\n\tif (use_osg_system) {\n\t\tM = osg::Matrix::rotate(osg::PI_2, osg::Vec3(1, 0, 0));\n\t} else {\n\t\tM = osg::Matrix::identity();\n\t}\n\n const float dst = 2.0f\/(texture_size_-1);\n \n float t = -1;\n for (int i=0; i<texture_size_; ++i) {\n float s = -1;\n for (int j=0; j<texture_size_; ++j) {\n\t\t\tset_pixel(0, j, i, compute_color(osg::Vec3(1, -t, -s) * M));\n set_pixel(1, j, i, compute_color(osg::Vec3(-1, -t, s) * M));\n set_pixel(2, j, i, compute_color(osg::Vec3(s, 1, t) * M));\n set_pixel(3, j, i, compute_color(osg::Vec3(s, -1, -t) * M));\n set_pixel(4, j, i, compute_color(osg::Vec3(s, -t, 1) * M));\n set_pixel(5, j, i, compute_color(osg::Vec3(-s, -t, -1) * M));\n s += dst;\n }\n t += dst;\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 <algorithm>\n#include <atomic>\n#include <fstream>\n#include <limits>\n#include <random>\n#include <thread>\n#include <unordered_set>\n\n#include \"network\/neural_network_trainer.h\"\n#include \"parser_nn.h\"\n#include \"parser_nn_trainer.h\"\n#include \"utils\/parse_double.h\"\n#include \"utils\/parse_int.h\"\n#include \"utils\/split.h\"\n\nnamespace ufal {\nnamespace parsito {\n\nvoid parser_nn_trainer::train(const string& transition_system_name, const string& transition_oracle_name,\n const string& embeddings_description, const string& nodes_description, const network_parameters& parameters,\n unsigned number_of_threads, const vector<tree>& train, const vector<tree>& heldout, binary_encoder& enc) {\n if (train.empty()) runtime_failure(\"No training data was given!\");\n\n \/\/ Random generator with fixed seed for reproducibility\n mt19937 generator(42);\n\n \/\/ Check that all non-root nodes have heads and nonempty deprel\n for (auto&& tree : train)\n for (auto&& node : tree.nodes)\n if (node.id) {\n if (node.head < 0) runtime_failure(\"The node '\" << node.form << \"' with id \" << node.id << \" has no head set!\");\n if (node.deprel.empty()) runtime_failure(\"The node '\" << node.form << \"' with id \" << node.id << \" has no deprel set!\");\n }\n\n \/\/ Generate labels for transition system\n parser_nn parser;\n unordered_set<string> labels_set;\n\n for (auto&& tree : train)\n for (auto&& node : tree.nodes)\n if (node.id && !labels_set.count(node.deprel)) {\n labels_set.insert(node.deprel);\n parser.labels.push_back(node.deprel);\n }\n\n \/\/ Create transition system and transition oracle\n parser.system.reset(transition_system::create(transition_system_name, parser.labels));\n if (!parser.system) runtime_failure(\"Cannot create transition system '\" << transition_system_name << \"'!\");\n\n unique_ptr<transition_oracle> oracle(parser.system->oracle(transition_oracle_name));\n if (!oracle) runtime_failure(\"Cannot create transition oracle '\" << transition_oracle_name << \"' for transition system '\" << transition_system_name << \"'!\");\n\n \/\/ Create node_extractor\n string error;\n if (!parser.nodes.create(nodes_description, error)) runtime_failure(error);\n\n \/\/ Load value_extractors and embeddings\n vector<string> value_names;\n vector<string_piece> lines, tokens;\n split(embeddings_description, '\\n', lines);\n for (auto&& line : lines) {\n \/\/ Ignore empty lines and comments\n if (!line.len || line.str[0] == '#') continue;\n\n split(line, ' ', tokens);\n if (!(tokens.size() >= 3 && tokens.size() <= 6))\n runtime_failure(\"Expected 3 to 6 columns on embedding description line '\" << line << \"'!\");\n\n value_names.emplace_back(string(tokens[0].str, tokens[0].len));\n parser.values.emplace_back();\n if (!parser.values.back().create(tokens[0], error)) runtime_failure(error);\n\n int dimension = parse_int(tokens[1], \"embedding dimension\");\n int min_count = parse_int(tokens[2], \"minimum frequency count\");\n unsigned updatable_index = 0;\n unsigned embeddings_from_file = 0;\n string embeddings_from_file_comment;\n vector<pair<string, vector<float>>> weights;\n unordered_set<string> weights_set;\n\n \/\/ Compute words and counts present in the training data\n string word;\n unordered_map<string, int> word_counts;\n for (auto&& tree : train)\n for (auto&& node : tree.nodes)\n if (node.id) {\n parser.values.back().extract(node, word);\n word_counts[word]++;\n }\n\n \/\/ Load embedding if it was given\n if (tokens.size() >= 4) {\n int update_weights = tokens.size() >= 5 ? parse_int(tokens[4], \"update weights\") : 1;\n int max_embeddings = tokens.size() >= 6 ? parse_int(tokens[5], \"maximum embeddings count\") : numeric_limits<int>::max();\n ifstream in(string(tokens[3].str, tokens[3].len));\n if (!in.is_open()) runtime_failure(\"Cannot load '\" << tokens[0] << \"' embedding from file '\" << tokens[4] << \"'!\");\n\n \/\/ Load first line containing dictionary size and dimensions\n string line;\n vector<string_piece> parts;\n if (!getline(in, line)) runtime_failure(\"Cannot read first line from embedding file '\" << tokens[4] << \"'!\");\n split(line, ' ', parts);\n if (parts.size() != 2) runtime_failure(\"Expected two numbers on the first line of embedding file '\" << tokens[4] << \"'!\");\n int file_dimension = parse_int(parts[1], \"embedding file dimension\");\n\n if (file_dimension < dimension) runtime_failure(\"The embedding file '\" << tokens[4] << \"' has lower dimension than required!\");\n\n \/\/ Generate random projection when smaller dimension is required\n vector<vector<float>> projection;\n if (file_dimension > dimension) {\n embeddings_from_file_comment = \"[dim\" + to_string(file_dimension) + \"->\" + to_string(dimension) + \"]\";\n\n uniform_real_distribution<double> uniform(0, 1);\n projection.resize(dimension);\n for (auto&& row : projection) {\n row.resize(file_dimension);\n for (auto&& weight : row) weight = uniform(generator);\n\n double sum = 0;\n for (auto&& weight : row) sum += weight;\n for (auto&& weight : row) weight \/= sum;\n }\n }\n\n \/\/ Load input embedding\n vector<double> input_weights(file_dimension);\n vector<float> projected_weights(dimension);\n while (getline(in, line) && int(weights.size()) < max_embeddings) {\n split(line, ' ', parts);\n if (!parts.empty() && !parts.back().len) parts.pop_back(); \/\/ Ignore space at the end of line\n if (int(parts.size()) != file_dimension + 1) runtime_failure(\"Wrong number of values on line '\" << line << \"' of embedding file '\" << tokens[4]);\n for (int i = 0; i < file_dimension; i++)\n input_weights[i] = parse_double(parts[1 + i], \"embedding weight\");\n\n string word(parts[0].str, parts[0].len);\n\n \/\/ For update_weights == 2, ignore embeddings for unknown words\n if (update_weights == 2 && !word_counts.count(word))\n continue;\n\n for (int i = 0; i < dimension; i++)\n if (file_dimension == dimension) {\n projected_weights[i] = input_weights[i];\n } else {\n projected_weights[i] = 0;\n for (int j = 0; j < file_dimension; j++)\n projected_weights[i] += projection[i][j] * input_weights[j];\n }\n\n if (!weights_set.count(word)) {\n weights.emplace_back(word, projected_weights);\n weights_set.insert(word);\n }\n }\n embeddings_from_file = weights.size();\n updatable_index = update_weights ? 0 : embeddings_from_file;\n }\n\n \/\/ Add embedding for non-present word with min_count\n {\n vector<float> word_weights(dimension);\n uniform_real_distribution<float> uniform(-1, 1);\n for (auto&& word_count : word_counts)\n if (word_count.second >= min_count && !weights_set.count(word_count.first)) {\n for (auto&& word_weight : word_weights)\n word_weight = uniform(generator);\n\n weights.emplace_back(word_count.first, word_weights);\n }\n }\n\n \/\/ Add the embedding\n parser.embeddings.emplace_back();\n parser.embeddings.back().create(dimension, updatable_index, weights);\n\n \/\/ Count the cover of this embedding\n string buffer;\n unsigned words_total = 0, words_covered = 0, words_covered_from_file = 0;\n for (auto&& tree : train)\n for (auto&& node : tree.nodes)\n if (node.id) {\n parser.values.back().extract(node, word);\n words_total++;\n int word_id = parser.embeddings.back().lookup_word(word, buffer);\n words_covered += word_id >= 0;\n words_covered_from_file += word_id >= 0 && unsigned(word_id) < embeddings_from_file;\n }\n\n cerr << \"Initialized '\" << tokens[0] << \"' embedding with \" << embeddings_from_file << embeddings_from_file_comment\n << \",\" << weights.size() << \" words and \" << fixed << setprecision(1) << 100. * words_covered_from_file \/ words_total\n << \"%,\" << 100. * words_covered \/ words_total << \"% coverage.\" << endl;\n }\n\n \/\/ Train the network\n unsigned total_dimension = 0, total_nodes = 0;\n for (auto&& embedding : parser.embeddings) total_dimension += embedding.dimension;\n for (auto&& tree : train) total_nodes += tree.nodes.size() - 1;\n auto scaled_parameters = parameters;\n scaled_parameters.l1_regularization \/= train.size();\n scaled_parameters.l2_regularization \/= total_nodes;\n neural_network_trainer network_trainer(parser.network, total_dimension * parser.nodes.node_count(), parser.system->transition_count(), scaled_parameters, generator);\n\n vector<int> permutation;\n for (size_t i = 0; i < train.size(); i++)\n permutation.push_back(permutation.size());\n\n for (int iteration = 1; network_trainer.next_iteration(); iteration++) {\n \/\/ Train on training data\n shuffle(permutation.begin(), permutation.end(), generator);\n\n atomic<unsigned> atomic_index(0);\n atomic<double> atomic_logprob(0);\n auto training = [&]() {\n tree t;\n configuration conf;\n string word, word_buffer;\n vector<vector<int>> nodes_embeddings;\n vector<int> extracted_nodes;\n vector<const vector<int>*> extracted_embeddings;\n neural_network_trainer::workspace workspace;\n double logprob = 0;\n\n for (unsigned current_index; (current_index = atomic_index++) < permutation.size();) {\n const tree& gold = train[permutation[current_index]];\n t = gold;\n t.unlink_all_nodes();\n conf.init(&t);\n\n \/\/ Compute embeddings\n if (t.nodes.size() > nodes_embeddings.size()) nodes_embeddings.resize(t.nodes.size());\n for (size_t i = 0; i < t.nodes.size(); i++) {\n nodes_embeddings[i].resize(parser.embeddings.size());\n for (size_t j = 0; j < parser.embeddings.size(); j++) {\n parser.values[j].extract(t.nodes[i], word);\n nodes_embeddings[i][j] = parser.embeddings[j].lookup_word(word, word_buffer);\n }\n }\n\n \/\/ Train the network\n while (!conf.final()) {\n \/\/ Extract nodes\n parser.nodes.extract(conf, extracted_nodes);\n extracted_embeddings.resize(extracted_nodes.size());\n for (size_t i = 0; i < extracted_nodes.size(); i++)\n extracted_embeddings[i] = extracted_nodes[i] >= 0 ? &nodes_embeddings[extracted_nodes[i]] : nullptr;\n\n \/\/ Propagate\n network_trainer.propagate(parser.embeddings, extracted_embeddings, workspace);\n\n \/\/ Find most probable applicable transition\n int network_best = -1;\n for (unsigned i = 0; i < workspace.outcomes.size(); i++)\n if (parser.system->applicable(conf, i) && (network_best < 0 || workspace.outcomes[i] > workspace.outcomes[network_best]))\n network_best = i;\n\n \/\/ Apply the oracle\n auto prediction = oracle->predict(conf, gold, network_best);\n\n \/\/ Update logprob\n if (workspace.outcomes[prediction.best])\n logprob += log(workspace.outcomes[prediction.best]);\n\n \/\/ Backpropagate the chosen outcome\n network_trainer.backpropagate(parser.embeddings, extracted_embeddings, prediction.best, workspace);\n\n \/\/ Follow the chosen outcome\n int child = parser.system->perform(conf, prediction.to_follow);\n\n \/\/ If a node was linked, recompute its not-found embeddings as deprel has changed\n if (child >= 0)\n for (size_t i = 0; i < parser.embeddings.size(); i++)\n if (nodes_embeddings[child][i] < 0) {\n parser.values[i].extract(t.nodes[child], word);\n nodes_embeddings[child][i] = parser.embeddings[i].lookup_word(word, word_buffer);\n }\n }\n network_trainer.finalize_sentence();\n }\n for (double old_atomic_logprob = atomic_logprob; atomic_logprob.compare_exchange_weak(old_atomic_logprob, old_atomic_logprob + logprob); ) {}\n };\n\n cerr << \"Iteration \" << iteration << \": \";\n if (number_of_threads > 1) {\n vector<thread> threads;\n for (unsigned i = 0; i < number_of_threads; i++) threads.emplace_back(training);\n for (; !threads.empty(); threads.pop_back()) threads.back().join();\n } else {\n training();\n }\n cerr << \"training logprob \" << scientific << setprecision(4) << atomic_logprob;\n\n \/\/ Evaluate heldout data if present\n if (!heldout.empty()) {\n tree t;\n\n unsigned total = 0, correct_unlabelled = 0, correct_labelled = 0;\n for (auto&& gold : heldout) {\n t = gold;\n t.unlink_all_nodes();\n parser.parse(t);\n for (size_t i = 1; i < t.nodes.size(); i++) {\n total++;\n correct_unlabelled += t.nodes[i].head == gold.nodes[i].head;\n correct_labelled += t.nodes[i].head == gold.nodes[i].head && t.nodes[i].deprel == gold.nodes[i].deprel;\n }\n }\n\n cerr << \", heldout UAS \" << fixed << setprecision(2) << (100. * correct_unlabelled \/ total) << \"%, LAS \" << (100. * correct_labelled \/ total) << \"%\";\n }\n\n cerr << endl;\n }\n\n \/\/ Encode transition system\n enc.add_2B(parser.labels.size());\n for (auto&& label : parser.labels)\n enc.add_str(label);\n enc.add_str(transition_system_name);\n\n \/\/ Encode nodes selector\n enc.add_str(nodes_description);\n\n \/\/ Encode value extractors and embeddings\n enc.add_2B(value_names.size());\n for (auto&& value_name : value_names)\n enc.add_str(value_name);\n for (auto&& embedding : parser.embeddings)\n embedding.save(enc);\n\n \/\/ Encode the network\n network_trainer.save_network(enc);\n}\n\n} \/\/ namespace parsito\n} \/\/ namespace ufal\n<commit_msg>Fix filename index in error outputs.<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 <algorithm>\n#include <atomic>\n#include <fstream>\n#include <limits>\n#include <random>\n#include <thread>\n#include <unordered_set>\n\n#include \"network\/neural_network_trainer.h\"\n#include \"parser_nn.h\"\n#include \"parser_nn_trainer.h\"\n#include \"utils\/parse_double.h\"\n#include \"utils\/parse_int.h\"\n#include \"utils\/split.h\"\n\nnamespace ufal {\nnamespace parsito {\n\nvoid parser_nn_trainer::train(const string& transition_system_name, const string& transition_oracle_name,\n const string& embeddings_description, const string& nodes_description, const network_parameters& parameters,\n unsigned number_of_threads, const vector<tree>& train, const vector<tree>& heldout, binary_encoder& enc) {\n if (train.empty()) runtime_failure(\"No training data was given!\");\n\n \/\/ Random generator with fixed seed for reproducibility\n mt19937 generator(42);\n\n \/\/ Check that all non-root nodes have heads and nonempty deprel\n for (auto&& tree : train)\n for (auto&& node : tree.nodes)\n if (node.id) {\n if (node.head < 0) runtime_failure(\"The node '\" << node.form << \"' with id \" << node.id << \" has no head set!\");\n if (node.deprel.empty()) runtime_failure(\"The node '\" << node.form << \"' with id \" << node.id << \" has no deprel set!\");\n }\n\n \/\/ Generate labels for transition system\n parser_nn parser;\n unordered_set<string> labels_set;\n\n for (auto&& tree : train)\n for (auto&& node : tree.nodes)\n if (node.id && !labels_set.count(node.deprel)) {\n labels_set.insert(node.deprel);\n parser.labels.push_back(node.deprel);\n }\n\n \/\/ Create transition system and transition oracle\n parser.system.reset(transition_system::create(transition_system_name, parser.labels));\n if (!parser.system) runtime_failure(\"Cannot create transition system '\" << transition_system_name << \"'!\");\n\n unique_ptr<transition_oracle> oracle(parser.system->oracle(transition_oracle_name));\n if (!oracle) runtime_failure(\"Cannot create transition oracle '\" << transition_oracle_name << \"' for transition system '\" << transition_system_name << \"'!\");\n\n \/\/ Create node_extractor\n string error;\n if (!parser.nodes.create(nodes_description, error)) runtime_failure(error);\n\n \/\/ Load value_extractors and embeddings\n vector<string> value_names;\n vector<string_piece> lines, tokens;\n split(embeddings_description, '\\n', lines);\n for (auto&& line : lines) {\n \/\/ Ignore empty lines and comments\n if (!line.len || line.str[0] == '#') continue;\n\n split(line, ' ', tokens);\n if (!(tokens.size() >= 3 && tokens.size() <= 6))\n runtime_failure(\"Expected 3 to 6 columns on embedding description line '\" << line << \"'!\");\n\n value_names.emplace_back(string(tokens[0].str, tokens[0].len));\n parser.values.emplace_back();\n if (!parser.values.back().create(tokens[0], error)) runtime_failure(error);\n\n int dimension = parse_int(tokens[1], \"embedding dimension\");\n int min_count = parse_int(tokens[2], \"minimum frequency count\");\n unsigned updatable_index = 0;\n unsigned embeddings_from_file = 0;\n string embeddings_from_file_comment;\n vector<pair<string, vector<float>>> weights;\n unordered_set<string> weights_set;\n\n \/\/ Compute words and counts present in the training data\n string word;\n unordered_map<string, int> word_counts;\n for (auto&& tree : train)\n for (auto&& node : tree.nodes)\n if (node.id) {\n parser.values.back().extract(node, word);\n word_counts[word]++;\n }\n\n \/\/ Load embedding if it was given\n if (tokens.size() >= 4) {\n int update_weights = tokens.size() >= 5 ? parse_int(tokens[4], \"update weights\") : 1;\n int max_embeddings = tokens.size() >= 6 ? parse_int(tokens[5], \"maximum embeddings count\") : numeric_limits<int>::max();\n ifstream in(string(tokens[3].str, tokens[3].len));\n if (!in.is_open()) runtime_failure(\"Cannot load '\" << tokens[0] << \"' embedding from file '\" << tokens[3] << \"'!\");\n\n \/\/ Load first line containing dictionary size and dimensions\n string line;\n vector<string_piece> parts;\n if (!getline(in, line)) runtime_failure(\"Cannot read first line from embedding file '\" << tokens[3] << \"'!\");\n split(line, ' ', parts);\n if (parts.size() != 2) runtime_failure(\"Expected two numbers on the first line of embedding file '\" << tokens[3] << \"'!\");\n int file_dimension = parse_int(parts[1], \"embedding file dimension\");\n\n if (file_dimension < dimension) runtime_failure(\"The embedding file '\" << tokens[3] << \"' has lower dimension than required!\");\n\n \/\/ Generate random projection when smaller dimension is required\n vector<vector<float>> projection;\n if (file_dimension > dimension) {\n embeddings_from_file_comment = \"[dim\" + to_string(file_dimension) + \"->\" + to_string(dimension) + \"]\";\n\n uniform_real_distribution<double> uniform(0, 1);\n projection.resize(dimension);\n for (auto&& row : projection) {\n row.resize(file_dimension);\n for (auto&& weight : row) weight = uniform(generator);\n\n double sum = 0;\n for (auto&& weight : row) sum += weight;\n for (auto&& weight : row) weight \/= sum;\n }\n }\n\n \/\/ Load input embedding\n vector<double> input_weights(file_dimension);\n vector<float> projected_weights(dimension);\n while (getline(in, line) && int(weights.size()) < max_embeddings) {\n split(line, ' ', parts);\n if (!parts.empty() && !parts.back().len) parts.pop_back(); \/\/ Ignore space at the end of line\n if (int(parts.size()) != file_dimension + 1) runtime_failure(\"Wrong number of values on line '\" << line << \"' of embedding file '\" << tokens[3]);\n for (int i = 0; i < file_dimension; i++)\n input_weights[i] = parse_double(parts[1 + i], \"embedding weight\");\n\n string word(parts[0].str, parts[0].len);\n\n \/\/ For update_weights == 2, ignore embeddings for unknown words\n if (update_weights == 2 && !word_counts.count(word))\n continue;\n\n for (int i = 0; i < dimension; i++)\n if (file_dimension == dimension) {\n projected_weights[i] = input_weights[i];\n } else {\n projected_weights[i] = 0;\n for (int j = 0; j < file_dimension; j++)\n projected_weights[i] += projection[i][j] * input_weights[j];\n }\n\n if (!weights_set.count(word)) {\n weights.emplace_back(word, projected_weights);\n weights_set.insert(word);\n }\n }\n embeddings_from_file = weights.size();\n updatable_index = update_weights ? 0 : embeddings_from_file;\n }\n\n \/\/ Add embedding for non-present word with min_count\n {\n vector<float> word_weights(dimension);\n uniform_real_distribution<float> uniform(-1, 1);\n for (auto&& word_count : word_counts)\n if (word_count.second >= min_count && !weights_set.count(word_count.first)) {\n for (auto&& word_weight : word_weights)\n word_weight = uniform(generator);\n\n weights.emplace_back(word_count.first, word_weights);\n }\n }\n\n \/\/ Add the embedding\n parser.embeddings.emplace_back();\n parser.embeddings.back().create(dimension, updatable_index, weights);\n\n \/\/ Count the cover of this embedding\n string buffer;\n unsigned words_total = 0, words_covered = 0, words_covered_from_file = 0;\n for (auto&& tree : train)\n for (auto&& node : tree.nodes)\n if (node.id) {\n parser.values.back().extract(node, word);\n words_total++;\n int word_id = parser.embeddings.back().lookup_word(word, buffer);\n words_covered += word_id >= 0;\n words_covered_from_file += word_id >= 0 && unsigned(word_id) < embeddings_from_file;\n }\n\n cerr << \"Initialized '\" << tokens[0] << \"' embedding with \" << embeddings_from_file << embeddings_from_file_comment\n << \",\" << weights.size() << \" words and \" << fixed << setprecision(1) << 100. * words_covered_from_file \/ words_total\n << \"%,\" << 100. * words_covered \/ words_total << \"% coverage.\" << endl;\n }\n\n \/\/ Train the network\n unsigned total_dimension = 0, total_nodes = 0;\n for (auto&& embedding : parser.embeddings) total_dimension += embedding.dimension;\n for (auto&& tree : train) total_nodes += tree.nodes.size() - 1;\n auto scaled_parameters = parameters;\n scaled_parameters.l1_regularization \/= train.size();\n scaled_parameters.l2_regularization \/= total_nodes;\n neural_network_trainer network_trainer(parser.network, total_dimension * parser.nodes.node_count(), parser.system->transition_count(), scaled_parameters, generator);\n\n vector<int> permutation;\n for (size_t i = 0; i < train.size(); i++)\n permutation.push_back(permutation.size());\n\n for (int iteration = 1; network_trainer.next_iteration(); iteration++) {\n \/\/ Train on training data\n shuffle(permutation.begin(), permutation.end(), generator);\n\n atomic<unsigned> atomic_index(0);\n atomic<double> atomic_logprob(0);\n auto training = [&]() {\n tree t;\n configuration conf;\n string word, word_buffer;\n vector<vector<int>> nodes_embeddings;\n vector<int> extracted_nodes;\n vector<const vector<int>*> extracted_embeddings;\n neural_network_trainer::workspace workspace;\n double logprob = 0;\n\n for (unsigned current_index; (current_index = atomic_index++) < permutation.size();) {\n const tree& gold = train[permutation[current_index]];\n t = gold;\n t.unlink_all_nodes();\n conf.init(&t);\n\n \/\/ Compute embeddings\n if (t.nodes.size() > nodes_embeddings.size()) nodes_embeddings.resize(t.nodes.size());\n for (size_t i = 0; i < t.nodes.size(); i++) {\n nodes_embeddings[i].resize(parser.embeddings.size());\n for (size_t j = 0; j < parser.embeddings.size(); j++) {\n parser.values[j].extract(t.nodes[i], word);\n nodes_embeddings[i][j] = parser.embeddings[j].lookup_word(word, word_buffer);\n }\n }\n\n \/\/ Train the network\n while (!conf.final()) {\n \/\/ Extract nodes\n parser.nodes.extract(conf, extracted_nodes);\n extracted_embeddings.resize(extracted_nodes.size());\n for (size_t i = 0; i < extracted_nodes.size(); i++)\n extracted_embeddings[i] = extracted_nodes[i] >= 0 ? &nodes_embeddings[extracted_nodes[i]] : nullptr;\n\n \/\/ Propagate\n network_trainer.propagate(parser.embeddings, extracted_embeddings, workspace);\n\n \/\/ Find most probable applicable transition\n int network_best = -1;\n for (unsigned i = 0; i < workspace.outcomes.size(); i++)\n if (parser.system->applicable(conf, i) && (network_best < 0 || workspace.outcomes[i] > workspace.outcomes[network_best]))\n network_best = i;\n\n \/\/ Apply the oracle\n auto prediction = oracle->predict(conf, gold, network_best);\n\n \/\/ Update logprob\n if (workspace.outcomes[prediction.best])\n logprob += log(workspace.outcomes[prediction.best]);\n\n \/\/ Backpropagate the chosen outcome\n network_trainer.backpropagate(parser.embeddings, extracted_embeddings, prediction.best, workspace);\n\n \/\/ Follow the chosen outcome\n int child = parser.system->perform(conf, prediction.to_follow);\n\n \/\/ If a node was linked, recompute its not-found embeddings as deprel has changed\n if (child >= 0)\n for (size_t i = 0; i < parser.embeddings.size(); i++)\n if (nodes_embeddings[child][i] < 0) {\n parser.values[i].extract(t.nodes[child], word);\n nodes_embeddings[child][i] = parser.embeddings[i].lookup_word(word, word_buffer);\n }\n }\n network_trainer.finalize_sentence();\n }\n for (double old_atomic_logprob = atomic_logprob; atomic_logprob.compare_exchange_weak(old_atomic_logprob, old_atomic_logprob + logprob); ) {}\n };\n\n cerr << \"Iteration \" << iteration << \": \";\n if (number_of_threads > 1) {\n vector<thread> threads;\n for (unsigned i = 0; i < number_of_threads; i++) threads.emplace_back(training);\n for (; !threads.empty(); threads.pop_back()) threads.back().join();\n } else {\n training();\n }\n cerr << \"training logprob \" << scientific << setprecision(4) << atomic_logprob;\n\n \/\/ Evaluate heldout data if present\n if (!heldout.empty()) {\n tree t;\n\n unsigned total = 0, correct_unlabelled = 0, correct_labelled = 0;\n for (auto&& gold : heldout) {\n t = gold;\n t.unlink_all_nodes();\n parser.parse(t);\n for (size_t i = 1; i < t.nodes.size(); i++) {\n total++;\n correct_unlabelled += t.nodes[i].head == gold.nodes[i].head;\n correct_labelled += t.nodes[i].head == gold.nodes[i].head && t.nodes[i].deprel == gold.nodes[i].deprel;\n }\n }\n\n cerr << \", heldout UAS \" << fixed << setprecision(2) << (100. * correct_unlabelled \/ total) << \"%, LAS \" << (100. * correct_labelled \/ total) << \"%\";\n }\n\n cerr << endl;\n }\n\n \/\/ Encode transition system\n enc.add_2B(parser.labels.size());\n for (auto&& label : parser.labels)\n enc.add_str(label);\n enc.add_str(transition_system_name);\n\n \/\/ Encode nodes selector\n enc.add_str(nodes_description);\n\n \/\/ Encode value extractors and embeddings\n enc.add_2B(value_names.size());\n for (auto&& value_name : value_names)\n enc.add_str(value_name);\n for (auto&& embedding : parser.embeddings)\n embedding.save(enc);\n\n \/\/ Encode the network\n network_trainer.save_network(enc);\n}\n\n} \/\/ namespace parsito\n} \/\/ namespace ufal\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\/\/ This file contains the default suppressions for ThreadSanitizer.\n\/\/ You can also pass additional suppressions via TSAN_OPTIONS:\n\/\/ TSAN_OPTIONS=suppressions=\/path\/to\/suppressions. Please refer to\n\/\/ http:\/\/dev.chromium.org\/developers\/testing\/threadsanitizer-tsan-v2\n\/\/ for more info.\n\n#if defined(THREAD_SANITIZER)\n\n\/\/ Please make sure the code below declares a single string variable\n\/\/ kTSanDefaultSuppressions contains TSan suppressions delimited by newlines.\n\/\/ See http:\/\/dev.chromium.org\/developers\/testing\/threadsanitizer-tsan-v2\n\/\/ for the instructions on writing suppressions.\nchar kTSanDefaultSuppressions[] =\n\/\/ False positives in libflashplayer.so and libglib.so. Since we don't\n\/\/ instrument them, we cannot reason about the synchronization in them.\n\"race:libflashplayer.so\\n\"\n\"race:libglib*.so\\n\"\n\n\/\/ Intentional race in ToolsSanityTest.DataRace in base_unittests.\n\"race:base\/tools_sanity_unittest.cc\\n\"\n\n\/\/ Data race on WatchdogCounter [test-only].\n\"race:base\/threading\/watchdog_unittest.cc\\n\"\n\n\/\/ Races in libevent, http:\/\/crbug.com\/23244.\n\"race:libevent\/event.c\\n\"\n\n\/\/ http:\/\/crbug.com\/46840.\n\"race:base::HistogramSamples::IncreaseSum\\n\"\n\"race:base::Histogram::Add\\n\"\n\"race:base::HistogramSamples::Add\\n\"\n\n\/\/ http:\/\/crbug.com\/84094.\n\"race:sqlite3StatusSet\\n\"\n\"race:pcache1EnforceMaxPage\\n\"\n\"race:pcache1AllocPage\\n\"\n\n\/\/ http:\/\/crbug.com\/102327.\n\/\/ Test-only race, won't fix.\n\"race:tracked_objects::ThreadData::ShutdownSingleThreadedCleanup\\n\"\n\n\/\/ http:\/\/crbug.com\/115540\n\"race:*GetCurrentThreadIdentifier\\n\"\n\n\/\/ http:\/\/crbug.com\/120808\n\"race:base\/threading\/watchdog.cc\\n\"\n\n\/\/ http:\/\/crbug.com\/157586\n\"race:third_party\/libvpx\/source\/libvpx\/vp8\/decoder\/threading.c\\n\"\n\n\/\/ http:\/\/crbug.com\/158718\n\"race:third_party\/ffmpeg\/libavcodec\/pthread.c\\n\"\n\"race:third_party\/ffmpeg\/libavcodec\/pthread_frame.c\\n\"\n\"race:third_party\/ffmpeg\/libavcodec\/vp8.c\\n\"\n\"race:third_party\/ffmpeg\/libavutil\/mem.c\\n\"\n\"race:*HashFrameForTesting\\n\"\n\"race:third_party\/ffmpeg\/libavcodec\/h264pred.c\\n\"\n\"race:media::ReleaseData\\n\"\n\n\/\/ http:\/\/crbug.com\/158922\n\"race:third_party\/libvpx\/source\/libvpx\/vp8\/encoder\/*\\n\"\n\n\/\/ http:\/\/crbug.com\/189177\n\"race:thread_manager\\n\"\n\"race:v8::Locker::Initialize\\n\"\n\n\/\/ http:\/\/crbug.com\/223352\n\"race:uprv_malloc_52\\n\"\n\"race:uprv_realloc_52\\n\"\n\n\/\/ http:\/\/crbug.com\/239359\n\"race:media::TestInputCallback::OnData\\n\"\n\n\/\/ http:\/\/crbug.com\/244368\n\"race:skia::BeginPlatformPaint\\n\"\n\n\/\/ http:\/\/crbug.com\/244385\n\"race:unixTempFileDir\\n\"\n\n\/\/ http:\/\/crbug.com\/244755\n\"race:v8::internal::Zone::NewExpand\\n\"\n\"race:TooLateToEnableNow\\n\"\n\"race:adjust_segment_bytes_allocated\\n\"\n\n\/\/ http:\/\/crbug.com\/244774\n\"race:webrtc::RTPReceiver::ProcessBitrate\\n\"\n\"race:webrtc::RTPSender::ProcessBitrate\\n\"\n\"race:webrtc::VideoCodingModuleImpl::Decode\\n\"\n\"race:webrtc::RTPSender::SendOutgoingData\\n\"\n\"race:webrtc::VP8EncoderImpl::GetEncodedPartitions\\n\"\n\"race:webrtc::VP8EncoderImpl::Encode\\n\"\n\"race:webrtc::ViEEncoder::DeliverFrame\\n\"\n\"race:webrtc::vcm::VideoReceiver::Decode\\n\"\n\"race:webrtc::VCMReceiver::FrameForDecoding\\n\"\n\"race:*trace_event_unique_catstatic*\\n\"\n\n\/\/ http:\/\/crbug.com\/244856\n\"race:AutoPulseLock\\n\"\n\n\/\/ http:\/\/crbug.com\/246968\n\"race:webrtc::VideoCodingModuleImpl::RegisterPacketRequestCallback\\n\"\n\n\/\/ http:\/\/crbug.com\/246970\n\"race:webrtc::EventPosix::StartTimer\\n\"\n\n\/\/ http:\/\/crbug.com\/246974\n\"race:content::GpuWatchdogThread::CheckArmed\\n\"\n\n\/\/ http:\/\/crbug.com\/257396\n\"race:base::debug::TraceEventTestFixture_TraceSamplingScope_Test::TestBody\\n\"\n\n\/\/ http:\/\/crbug.com\/258479\n\"race:SamplingStateScope\\n\"\n\"race:g_trace_state\\n\"\n\n\/\/ http:\/\/crbug.com\/258499\n\"race:third_party\/skia\/include\/core\/SkRefCnt.h\\n\"\n\n\/\/ http:\/\/crbug.com\/268924\n\"race:base::g_power_monitor\\n\"\n\"race:base::PowerMonitor::PowerMonitor\\n\"\n\"race:base::PowerMonitor::AddObserver\\n\"\n\"race:base::PowerMonitor::RemoveObserver\\n\"\n\"race:base::PowerMonitor::IsOnBatteryPower\\n\"\n\n\/\/ http:\/\/crbug.com\/268941\n\"race:tracked_objects::ThreadData::tls_index_\\n\"\n\n\/\/ http:\/\/crbug.com\/270037\n\"race:gLibCleanupFunctions\\n\"\n\n\/\/ http:\/\/crbug.com\/272095\n\"race:base::g_top_manager\\n\"\n\n\/\/ http:\/\/crbug.com\/272987\n\"race:webrtc::MediaStreamTrack<webrtc::AudioTrackInterface>::set_enabled\\n\"\n\n\/\/ http:\/\/crbug.com\/273047\n\"race:base::*::g_lazy_tls_ptr\\n\"\n\"race:IPC::SyncChannel::ReceivedSyncMsgQueue::lazy_tls_ptr_\\n\"\n\n\/\/ http:\/\/crbug.com\/280466\n\"race:content::WebRtcAudioCapturer::SetCapturerSource\\n\"\n\n\/\/ http:\/\/crbug.com\/285242\n\"race:media::PulseAudioOutputStream::SetVolume\\n\"\n\n\/\/ http:\/\/crbug.com\/296883\n\"race:net::URLFetcherCore::Stop\\n\"\n\n\/\/ http:\/\/crbug.com\/308590\n\"race:CustomThreadWatcher::~CustomThreadWatcher\\n\"\n\n\/\/ http:\/\/crbug.com\/310851\n\"race:net::ProxyResolverV8Tracing::Job::~Job\\n\"\n\n\/\/ http:\/\/crbug.com\/313726\n\"race:CallbackWasCalled\\n\"\n\n\/\/ http:\/\/crbug.com\/327330\n\"race:PrepareTextureMailbox\\n\"\n\"race:cc::LayerTreeHost::PaintLayerContents\\n\"\n\n\/\/ http:\/\/crbug.com\/328826\n\"race:gLCDOrder\\n\"\n\"race:gLCDOrientation\\n\"\n\n\/\/ http:\/\/crbug.com\/328868\n\"race:PR_Lock\\n\"\n\n\/\/ http:\/\/crbug.com\/329225\n\"race:blink::currentTimeFunction\\n\"\n\n\/\/ http:\/\/crbug.com\/329460\n\"race:extensions::InfoMap::AddExtension\\n\"\n\n\/\/ http:\/\/crbug.com\/333244\n\"race:content::\"\n \"VideoCaptureImplTest::MockVideoCaptureImpl::~MockVideoCaptureImpl\\n\"\n\n\/\/ http:\/\/crbug.com\/333871\n\"race:v8::internal::Interface::NewValue()::value_interface\\n\"\n\"race:v8::internal::IsMinusZero(double)::minus_zero\\n\"\n\"race:v8::internal::FastCloneShallowObjectStub::InitializeInterfaceDescriptor\\n\"\n\"race:v8::internal::KeyedLoadStubCompiler::registers\\n\"\n\"race:v8::internal::KeyedStoreStubCompiler::registers()::registers\\n\"\n\"race:v8::internal::KeyedLoadFastElementStub::InitializeInterfaceDescriptor\\n\"\n\"race:v8::internal::KeyedStoreFastElementStub::InitializeInterfaceDescriptor\\n\"\n\"race:v8::internal::LoadStubCompiler::registers\\n\"\n\"race:v8::internal::StoreStubCompiler::registers\\n\"\n\"race:v8::internal::HValue::LoopWeight\\n\"\n\n\/\/ http:\/\/crbug.com\/334140\n\"race:CommandLine::HasSwitch\\n\"\n\"race:CommandLine::current_process_commandline_\\n\"\n\"race:CommandLine::GetSwitchValueASCII\\n\"\n\n\/\/ http:\/\/crbug.com\/338675\n\"race:blink::s_platform\\n\"\n\"race:content::\"\n \"RendererWebKitPlatformSupportImpl::~RendererWebKitPlatformSupportImpl\\n\"\n\n\/\/ http:\/\/crbug.com\/345240\n\"race:WTF::s_shutdown\\n\"\n\n\/\/ http:\/\/crbug.com\/345245\n\"race:jingle_glue::JingleThreadWrapper::~JingleThreadWrapper\\n\"\n\"race:webrtc::voe::Channel::UpdatePacketDelay\\n\"\n\"race:webrtc::voe::Channel::GetDelayEstimate\\n\"\n\"race:webrtc::VCMCodecDataBase::DeregisterReceiveCodec\\n\"\n\"race:webrtc::GainControlImpl::set_stream_analog_level\\n\"\n\n\/\/ http:\/\/crbug.com\/345618\n\"race:WebCore::AudioDestinationNode::render\\n\"\n\n\/\/ http:\/\/crbug.com\/345624\n\"race:media::DataSource::set_host\\n\"\n\n\/\/ http:\/\/crbug.com\/347534\n\"race:v8::internal::V8::TearDown\\n\"\n\n\/\/ http:\/\/crbug.com\/347538\n\"race:sctp_timer_start\\n\"\n\n\/\/ http:\/\/crbug.com\/347548\n\"race:cricket::WebRtcVideoMediaChannel::MaybeResetVieSendCodec\\n\"\n\"race:cricket::WebRtcVideoMediaChannel::SetSendCodec\\n\"\n\n\/\/ http:\/\/crbug.com\/347553\n\"race:blink::WebString::reset\\n\"\n\n\/\/ http:\/\/crbug.com\/348511\n\"race:webrtc::acm1::AudioCodingModuleImpl::PlayoutData10Ms\\n\"\n\n\/\/ http:\/\/crbug.com\/348982\n\"race:cricket::P2PTransportChannel::OnConnectionDestroyed\\n\"\n\"race:cricket::P2PTransportChannel::AddConnection\\n\"\n\n\/\/ http:\/\/crbug.com\/348984\n\"race:sctp_express_handle_sack\\n\"\n\"race:system_base_info\\n\"\n\n\/\/ http:\/\/crbug.com\/363999\n\"race:v8::internal::EnterDebugger::*EnterDebugger\\n\"\n\n\/\/ http:\/\/crbug.com\/364006\n\"race:gfx::ImageFamily::~ImageFamily\\n\"\n\n\/\/ http:\/\/crbug.com\/364014\n\"race:WTF::Latin1Encoding()::globalLatin1Encoding\\n\"\n\n\/\/ https:\/\/code.google.com\/p\/v8\/issues\/detail?id=3143\n\"race:v8::internal::FLAG_track_double_fields\\n\"\n\n\/\/ https:\/\/crbug.com\/369257\n\/\/ TODO(mtklein): annotate properly and remove suppressions.\n\"race:SandboxIPCHandler::HandleFontMatchRequest\\n\"\n\"race:SkFontConfigInterfaceDirect::matchFamilyName\\n\"\n\"race:SkFontConfigInterface::GetSingletonDirectInterface\\n\"\n\"race:FcStrStaticName\\n\"\n\n\/\/ http:\/\/crbug.com\/372807\n\"deadlock:net::X509Certificate::CreateCertificateListFromBytes\\n\"\n\"deadlock:net::X509Certificate::CreateFromBytes\\n\"\n\"deadlock:net::SSLClientSocketNSS::Core::DoHandshakeLoop\\n\"\n\n\/\/ http:\/\/crbug.com\/374135\n\"race:media::AlsaWrapper::PcmWritei\\n\"\n\n\/\/ False positive in libc's tzset_internal, http:\/\/crbug.com\/379738.\n\"race:tzset_internal\\n\"\n\n\/\/ http:\/\/crbug.com\/380554\n\"deadlock:g_type_add_interface_static\\n\"\n\n\/\/ http::\/\/crbug.com\/386385\n\"race:content::AppCacheStorageImpl::DatabaseTask::CallRunCompleted\\n\"\n\n\/\/ http:\/\/crbug.com\/388730\n\"race:g_next_user_script_id\\n\"\n\n\/\/ http:\/\/crbug.com\/389098\n\"race:webrtc::RtpToNtpMs\\n\"\n\"race:webrtc::UpdateRtcpList\\n\"\n\"race:webrtc::RemoteNtpTimeEstimator::Estimate\\n\"\n\"race:webrtc::voe::TransmitMixer::EnableStereoChannelSwapping\\n\"\n\n\/\/ http:\/\/crbug.com\/397022\n\"deadlock:\"\n\"base::debug::TraceEventTestFixture_ThreadOnceBlocking_Test::TestBody\\n\"\n\n\/\/ http:\/\/crbug.com\/415472\n\"deadlock:base::debug::TraceLog::GetCategoryGroupEnabled\\n\"\n\n\/\/ http:\/\/crbug.com\/425057\n\"deadlock:webrtc::ViEChannelManagerScoped::ViEChannelManagerScoped\\n\"\n\n\/\/ https:\/\/crbug.com\/433993\n\"deadlock:content::WebRtcAudioDeviceImpl\\n\"\n\n\/\/ http:\/\/crbug.com\/417193\n\/\/ Suppressing both AudioContext.{cpp,h}.\n\"race:modules\/webaudio\/AudioContext\\n\"\n\n\/\/ https:\/\/code.google.com\/p\/skia\/issues\/detail?id=3294\n\"race:SkBaseMutex::acquire\\n\"\n\n\/\/ https:\/\/crbug.com\/447461\n\"race:net::SSLConfig::SSLConfig\\n\"\n\n\/\/ End of suppressions.\n; \/\/ Please keep this semicolon.\n\n#endif \/\/ THREAD_SANITIZER\n<commit_msg>Suppress a race between using a ChildGpuMemoryBufferManager and destroying it.<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\/\/ This file contains the default suppressions for ThreadSanitizer.\n\/\/ You can also pass additional suppressions via TSAN_OPTIONS:\n\/\/ TSAN_OPTIONS=suppressions=\/path\/to\/suppressions. Please refer to\n\/\/ http:\/\/dev.chromium.org\/developers\/testing\/threadsanitizer-tsan-v2\n\/\/ for more info.\n\n#if defined(THREAD_SANITIZER)\n\n\/\/ Please make sure the code below declares a single string variable\n\/\/ kTSanDefaultSuppressions contains TSan suppressions delimited by newlines.\n\/\/ See http:\/\/dev.chromium.org\/developers\/testing\/threadsanitizer-tsan-v2\n\/\/ for the instructions on writing suppressions.\nchar kTSanDefaultSuppressions[] =\n\/\/ False positives in libflashplayer.so and libglib.so. Since we don't\n\/\/ instrument them, we cannot reason about the synchronization in them.\n\"race:libflashplayer.so\\n\"\n\"race:libglib*.so\\n\"\n\n\/\/ Intentional race in ToolsSanityTest.DataRace in base_unittests.\n\"race:base\/tools_sanity_unittest.cc\\n\"\n\n\/\/ Data race on WatchdogCounter [test-only].\n\"race:base\/threading\/watchdog_unittest.cc\\n\"\n\n\/\/ Races in libevent, http:\/\/crbug.com\/23244.\n\"race:libevent\/event.c\\n\"\n\n\/\/ http:\/\/crbug.com\/46840.\n\"race:base::HistogramSamples::IncreaseSum\\n\"\n\"race:base::Histogram::Add\\n\"\n\"race:base::HistogramSamples::Add\\n\"\n\n\/\/ http:\/\/crbug.com\/84094.\n\"race:sqlite3StatusSet\\n\"\n\"race:pcache1EnforceMaxPage\\n\"\n\"race:pcache1AllocPage\\n\"\n\n\/\/ http:\/\/crbug.com\/102327.\n\/\/ Test-only race, won't fix.\n\"race:tracked_objects::ThreadData::ShutdownSingleThreadedCleanup\\n\"\n\n\/\/ http:\/\/crbug.com\/115540\n\"race:*GetCurrentThreadIdentifier\\n\"\n\n\/\/ http:\/\/crbug.com\/120808\n\"race:base\/threading\/watchdog.cc\\n\"\n\n\/\/ http:\/\/crbug.com\/157586\n\"race:third_party\/libvpx\/source\/libvpx\/vp8\/decoder\/threading.c\\n\"\n\n\/\/ http:\/\/crbug.com\/158718\n\"race:third_party\/ffmpeg\/libavcodec\/pthread.c\\n\"\n\"race:third_party\/ffmpeg\/libavcodec\/pthread_frame.c\\n\"\n\"race:third_party\/ffmpeg\/libavcodec\/vp8.c\\n\"\n\"race:third_party\/ffmpeg\/libavutil\/mem.c\\n\"\n\"race:*HashFrameForTesting\\n\"\n\"race:third_party\/ffmpeg\/libavcodec\/h264pred.c\\n\"\n\"race:media::ReleaseData\\n\"\n\n\/\/ http:\/\/crbug.com\/158922\n\"race:third_party\/libvpx\/source\/libvpx\/vp8\/encoder\/*\\n\"\n\n\/\/ http:\/\/crbug.com\/189177\n\"race:thread_manager\\n\"\n\"race:v8::Locker::Initialize\\n\"\n\n\/\/ http:\/\/crbug.com\/223352\n\"race:uprv_malloc_52\\n\"\n\"race:uprv_realloc_52\\n\"\n\n\/\/ http:\/\/crbug.com\/239359\n\"race:media::TestInputCallback::OnData\\n\"\n\n\/\/ http:\/\/crbug.com\/244368\n\"race:skia::BeginPlatformPaint\\n\"\n\n\/\/ http:\/\/crbug.com\/244385\n\"race:unixTempFileDir\\n\"\n\n\/\/ http:\/\/crbug.com\/244755\n\"race:v8::internal::Zone::NewExpand\\n\"\n\"race:TooLateToEnableNow\\n\"\n\"race:adjust_segment_bytes_allocated\\n\"\n\n\/\/ http:\/\/crbug.com\/244774\n\"race:webrtc::RTPReceiver::ProcessBitrate\\n\"\n\"race:webrtc::RTPSender::ProcessBitrate\\n\"\n\"race:webrtc::VideoCodingModuleImpl::Decode\\n\"\n\"race:webrtc::RTPSender::SendOutgoingData\\n\"\n\"race:webrtc::VP8EncoderImpl::GetEncodedPartitions\\n\"\n\"race:webrtc::VP8EncoderImpl::Encode\\n\"\n\"race:webrtc::ViEEncoder::DeliverFrame\\n\"\n\"race:webrtc::vcm::VideoReceiver::Decode\\n\"\n\"race:webrtc::VCMReceiver::FrameForDecoding\\n\"\n\"race:*trace_event_unique_catstatic*\\n\"\n\n\/\/ http:\/\/crbug.com\/244856\n\"race:AutoPulseLock\\n\"\n\n\/\/ http:\/\/crbug.com\/246968\n\"race:webrtc::VideoCodingModuleImpl::RegisterPacketRequestCallback\\n\"\n\n\/\/ http:\/\/crbug.com\/246970\n\"race:webrtc::EventPosix::StartTimer\\n\"\n\n\/\/ http:\/\/crbug.com\/246974\n\"race:content::GpuWatchdogThread::CheckArmed\\n\"\n\n\/\/ http:\/\/crbug.com\/257396\n\"race:base::debug::TraceEventTestFixture_TraceSamplingScope_Test::TestBody\\n\"\n\n\/\/ http:\/\/crbug.com\/258479\n\"race:SamplingStateScope\\n\"\n\"race:g_trace_state\\n\"\n\n\/\/ http:\/\/crbug.com\/258499\n\"race:third_party\/skia\/include\/core\/SkRefCnt.h\\n\"\n\n\/\/ http:\/\/crbug.com\/268924\n\"race:base::g_power_monitor\\n\"\n\"race:base::PowerMonitor::PowerMonitor\\n\"\n\"race:base::PowerMonitor::AddObserver\\n\"\n\"race:base::PowerMonitor::RemoveObserver\\n\"\n\"race:base::PowerMonitor::IsOnBatteryPower\\n\"\n\n\/\/ http:\/\/crbug.com\/268941\n\"race:tracked_objects::ThreadData::tls_index_\\n\"\n\n\/\/ http:\/\/crbug.com\/270037\n\"race:gLibCleanupFunctions\\n\"\n\n\/\/ http:\/\/crbug.com\/272095\n\"race:base::g_top_manager\\n\"\n\n\/\/ http:\/\/crbug.com\/272987\n\"race:webrtc::MediaStreamTrack<webrtc::AudioTrackInterface>::set_enabled\\n\"\n\n\/\/ http:\/\/crbug.com\/273047\n\"race:base::*::g_lazy_tls_ptr\\n\"\n\"race:IPC::SyncChannel::ReceivedSyncMsgQueue::lazy_tls_ptr_\\n\"\n\n\/\/ http:\/\/crbug.com\/280466\n\"race:content::WebRtcAudioCapturer::SetCapturerSource\\n\"\n\n\/\/ http:\/\/crbug.com\/285242\n\"race:media::PulseAudioOutputStream::SetVolume\\n\"\n\n\/\/ http:\/\/crbug.com\/296883\n\"race:net::URLFetcherCore::Stop\\n\"\n\n\/\/ http:\/\/crbug.com\/308590\n\"race:CustomThreadWatcher::~CustomThreadWatcher\\n\"\n\n\/\/ http:\/\/crbug.com\/310851\n\"race:net::ProxyResolverV8Tracing::Job::~Job\\n\"\n\n\/\/ http:\/\/crbug.com\/313726\n\"race:CallbackWasCalled\\n\"\n\n\/\/ http:\/\/crbug.com\/327330\n\"race:PrepareTextureMailbox\\n\"\n\"race:cc::LayerTreeHost::PaintLayerContents\\n\"\n\n\/\/ http:\/\/crbug.com\/328826\n\"race:gLCDOrder\\n\"\n\"race:gLCDOrientation\\n\"\n\n\/\/ http:\/\/crbug.com\/328868\n\"race:PR_Lock\\n\"\n\n\/\/ http:\/\/crbug.com\/329225\n\"race:blink::currentTimeFunction\\n\"\n\n\/\/ http:\/\/crbug.com\/329460\n\"race:extensions::InfoMap::AddExtension\\n\"\n\n\/\/ http:\/\/crbug.com\/333244\n\"race:content::\"\n \"VideoCaptureImplTest::MockVideoCaptureImpl::~MockVideoCaptureImpl\\n\"\n\n\/\/ http:\/\/crbug.com\/333871\n\"race:v8::internal::Interface::NewValue()::value_interface\\n\"\n\"race:v8::internal::IsMinusZero(double)::minus_zero\\n\"\n\"race:v8::internal::FastCloneShallowObjectStub::InitializeInterfaceDescriptor\\n\"\n\"race:v8::internal::KeyedLoadStubCompiler::registers\\n\"\n\"race:v8::internal::KeyedStoreStubCompiler::registers()::registers\\n\"\n\"race:v8::internal::KeyedLoadFastElementStub::InitializeInterfaceDescriptor\\n\"\n\"race:v8::internal::KeyedStoreFastElementStub::InitializeInterfaceDescriptor\\n\"\n\"race:v8::internal::LoadStubCompiler::registers\\n\"\n\"race:v8::internal::StoreStubCompiler::registers\\n\"\n\"race:v8::internal::HValue::LoopWeight\\n\"\n\n\/\/ http:\/\/crbug.com\/334140\n\"race:CommandLine::HasSwitch\\n\"\n\"race:CommandLine::current_process_commandline_\\n\"\n\"race:CommandLine::GetSwitchValueASCII\\n\"\n\n\/\/ http:\/\/crbug.com\/338675\n\"race:blink::s_platform\\n\"\n\"race:content::\"\n \"RendererWebKitPlatformSupportImpl::~RendererWebKitPlatformSupportImpl\\n\"\n\n\/\/ http:\/\/crbug.com\/345240\n\"race:WTF::s_shutdown\\n\"\n\n\/\/ http:\/\/crbug.com\/345245\n\"race:jingle_glue::JingleThreadWrapper::~JingleThreadWrapper\\n\"\n\"race:webrtc::voe::Channel::UpdatePacketDelay\\n\"\n\"race:webrtc::voe::Channel::GetDelayEstimate\\n\"\n\"race:webrtc::VCMCodecDataBase::DeregisterReceiveCodec\\n\"\n\"race:webrtc::GainControlImpl::set_stream_analog_level\\n\"\n\n\/\/ http:\/\/crbug.com\/345618\n\"race:WebCore::AudioDestinationNode::render\\n\"\n\n\/\/ http:\/\/crbug.com\/345624\n\"race:media::DataSource::set_host\\n\"\n\n\/\/ http:\/\/crbug.com\/347534\n\"race:v8::internal::V8::TearDown\\n\"\n\n\/\/ http:\/\/crbug.com\/347538\n\"race:sctp_timer_start\\n\"\n\n\/\/ http:\/\/crbug.com\/347548\n\"race:cricket::WebRtcVideoMediaChannel::MaybeResetVieSendCodec\\n\"\n\"race:cricket::WebRtcVideoMediaChannel::SetSendCodec\\n\"\n\n\/\/ http:\/\/crbug.com\/347553\n\"race:blink::WebString::reset\\n\"\n\n\/\/ http:\/\/crbug.com\/348511\n\"race:webrtc::acm1::AudioCodingModuleImpl::PlayoutData10Ms\\n\"\n\n\/\/ http:\/\/crbug.com\/348982\n\"race:cricket::P2PTransportChannel::OnConnectionDestroyed\\n\"\n\"race:cricket::P2PTransportChannel::AddConnection\\n\"\n\n\/\/ http:\/\/crbug.com\/348984\n\"race:sctp_express_handle_sack\\n\"\n\"race:system_base_info\\n\"\n\n\/\/ http:\/\/crbug.com\/363999\n\"race:v8::internal::EnterDebugger::*EnterDebugger\\n\"\n\n\/\/ http:\/\/crbug.com\/364006\n\"race:gfx::ImageFamily::~ImageFamily\\n\"\n\n\/\/ http:\/\/crbug.com\/364014\n\"race:WTF::Latin1Encoding()::globalLatin1Encoding\\n\"\n\n\/\/ https:\/\/code.google.com\/p\/v8\/issues\/detail?id=3143\n\"race:v8::internal::FLAG_track_double_fields\\n\"\n\n\/\/ https:\/\/crbug.com\/369257\n\/\/ TODO(mtklein): annotate properly and remove suppressions.\n\"race:SandboxIPCHandler::HandleFontMatchRequest\\n\"\n\"race:SkFontConfigInterfaceDirect::matchFamilyName\\n\"\n\"race:SkFontConfigInterface::GetSingletonDirectInterface\\n\"\n\"race:FcStrStaticName\\n\"\n\n\/\/ http:\/\/crbug.com\/372807\n\"deadlock:net::X509Certificate::CreateCertificateListFromBytes\\n\"\n\"deadlock:net::X509Certificate::CreateFromBytes\\n\"\n\"deadlock:net::SSLClientSocketNSS::Core::DoHandshakeLoop\\n\"\n\n\/\/ http:\/\/crbug.com\/374135\n\"race:media::AlsaWrapper::PcmWritei\\n\"\n\n\/\/ False positive in libc's tzset_internal, http:\/\/crbug.com\/379738.\n\"race:tzset_internal\\n\"\n\n\/\/ http:\/\/crbug.com\/380554\n\"deadlock:g_type_add_interface_static\\n\"\n\n\/\/ http::\/\/crbug.com\/386385\n\"race:content::AppCacheStorageImpl::DatabaseTask::CallRunCompleted\\n\"\n\n\/\/ http:\/\/crbug.com\/388730\n\"race:g_next_user_script_id\\n\"\n\n\/\/ http:\/\/crbug.com\/389098\n\"race:webrtc::RtpToNtpMs\\n\"\n\"race:webrtc::UpdateRtcpList\\n\"\n\"race:webrtc::RemoteNtpTimeEstimator::Estimate\\n\"\n\"race:webrtc::voe::TransmitMixer::EnableStereoChannelSwapping\\n\"\n\n\/\/ http:\/\/crbug.com\/397022\n\"deadlock:\"\n\"base::debug::TraceEventTestFixture_ThreadOnceBlocking_Test::TestBody\\n\"\n\n\/\/ http:\/\/crbug.com\/415472\n\"deadlock:base::debug::TraceLog::GetCategoryGroupEnabled\\n\"\n\n\/\/ http:\/\/crbug.com\/425057\n\"deadlock:webrtc::ViEChannelManagerScoped::ViEChannelManagerScoped\\n\"\n\n\/\/ https:\/\/crbug.com\/433993\n\"deadlock:content::WebRtcAudioDeviceImpl\\n\"\n\n\/\/ http:\/\/crbug.com\/417193\n\/\/ Suppressing both AudioContext.{cpp,h}.\n\"race:modules\/webaudio\/AudioContext\\n\"\n\n\/\/ https:\/\/code.google.com\/p\/skia\/issues\/detail?id=3294\n\"race:SkBaseMutex::acquire\\n\"\n\n\/\/ https:\/\/crbug.com\/447461\n\"race:net::SSLConfig::SSLConfig\\n\"\n\n\/\/ https:\/\/crbug.com\/430533\n\"race:content::ChildGpuMemoryBufferManager::~ChildGpuMemoryBufferManager\\n\"\n\n\/\/ End of suppressions.\n; \/\/ Please keep this semicolon.\n\n#endif \/\/ THREAD_SANITIZER\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\/\/ This file contains the default suppressions for ThreadSanitizer.\n\/\/ You can also pass additional suppressions via TSAN_OPTIONS:\n\/\/ TSAN_OPTIONS=suppressions=\/path\/to\/suppressions. Please refer to\n\/\/ http:\/\/dev.chromium.org\/developers\/testing\/threadsanitizer-tsan-v2\n\/\/ for more info.\n\n#if defined(THREAD_SANITIZER)\n\n\/\/ Please make sure the code below declares a single string variable\n\/\/ kTSanDefaultSuppressions contains TSan suppressions delimited by newlines.\n\/\/ See http:\/\/dev.chromium.org\/developers\/testing\/threadsanitizer-tsan-v2\n\/\/ for the instructions on writing suppressions.\nchar kTSanDefaultSuppressions[] =\n\/\/ False positives in libflashplayer.so and libglib.so. Since we don't\n\/\/ instrument them, we cannot reason about the synchronization in them.\n\"race:libflashplayer.so\\n\"\n\"race:libglib*.so\\n\"\n\n\/\/ Intentional race in ToolsSanityTest.DataRace in base_unittests.\n\"race:base\/tools_sanity_unittest.cc\\n\"\n\n\/\/ Data race on WatchdogCounter [test-only].\n\"race:base\/threading\/watchdog_unittest.cc\\n\"\n\n\/\/ Races in libevent, http:\/\/crbug.com\/23244.\n\"race:libevent\/event.c\\n\"\n\n\/\/ http:\/\/crbug.com\/46840.\n\"race:base::HistogramSamples::IncreaseSum\\n\"\n\"race:base::Histogram::Add\\n\"\n\"race:base::HistogramSamples::Add\\n\"\n\n\/\/ http:\/\/crbug.com\/84094.\n\"race:sqlite3StatusSet\\n\"\n\"race:pcache1EnforceMaxPage\\n\"\n\"race:pcache1AllocPage\\n\"\n\n\/\/ http:\/\/crbug.com\/102327.\n\/\/ Test-only race, won't fix.\n\"race:tracked_objects::ThreadData::ShutdownSingleThreadedCleanup\\n\"\n\n\/\/ http:\/\/crbug.com\/115540\n\"race:*GetCurrentThreadIdentifier\\n\"\n\n\/\/ http:\/\/crbug.com\/120808\n\"race:base\/threading\/watchdog.cc\\n\"\n\n\/\/ http:\/\/crbug.com\/157586\n\"race:third_party\/libvpx\/source\/libvpx\/vp8\/decoder\/threading.c\\n\"\n\n\/\/ http:\/\/crbug.com\/158718\n\"race:third_party\/ffmpeg\/libavcodec\/pthread.c\\n\"\n\"race:third_party\/ffmpeg\/libavcodec\/pthread_frame.c\\n\"\n\"race:third_party\/ffmpeg\/libavcodec\/vp8.c\\n\"\n\"race:third_party\/ffmpeg\/libavutil\/mem.c\\n\"\n\"race:*HashFrameForTesting\\n\"\n\"race:third_party\/ffmpeg\/libavcodec\/h264pred.c\\n\"\n\"race:media::ReleaseData\\n\"\n\n\/\/ http:\/\/crbug.com\/158922\n\"race:third_party\/libvpx\/source\/libvpx\/vp8\/encoder\/*\\n\"\n\"race:third_party\/libvpx\/source\/libvpx\/vp9\/encoder\/*\\n\"\n\n\/\/ http:\/\/crbug.com\/189177\n\"race:thread_manager\\n\"\n\"race:v8::Locker::Initialize\\n\"\n\n\/\/ http:\/\/crbug.com\/239359\n\"race:media::TestInputCallback::OnData\\n\"\n\n\/\/ http:\/\/crbug.com\/244368\n\"race:skia::BeginPlatformPaint\\n\"\n\n\/\/ http:\/\/crbug.com\/244385\n\"race:unixTempFileDir\\n\"\n\n\/\/ http:\/\/crbug.com\/244755\n\"race:v8::internal::Zone::NewExpand\\n\"\n\"race:TooLateToEnableNow\\n\"\n\"race:adjust_segment_bytes_allocated\\n\"\n\n\/\/ http:\/\/crbug.com\/244774\n\"race:webrtc::RTPReceiver::ProcessBitrate\\n\"\n\"race:webrtc::RTPSender::ProcessBitrate\\n\"\n\"race:webrtc::VideoCodingModuleImpl::Decode\\n\"\n\"race:webrtc::RTPSender::SendOutgoingData\\n\"\n\"race:webrtc::VP8EncoderImpl::GetEncodedPartitions\\n\"\n\"race:webrtc::VP8EncoderImpl::Encode\\n\"\n\"race:webrtc::ViEEncoder::DeliverFrame\\n\"\n\"race:webrtc::vcm::VideoReceiver::Decode\\n\"\n\"race:webrtc::VCMReceiver::FrameForDecoding\\n\"\n\"race:*trace_event_unique_catstatic*\\n\"\n\n\/\/ http:\/\/crbug.com\/244856\n\"race:AutoPulseLock\\n\"\n\n\/\/ http:\/\/crbug.com\/246968\n\"race:webrtc::VideoCodingModuleImpl::RegisterPacketRequestCallback\\n\"\n\n\/\/ http:\/\/crbug.com\/246974\n\"race:content::GpuWatchdogThread::CheckArmed\\n\"\n\n\/\/ http:\/\/crbug.com\/257396\n\"race:base::trace_event::\"\n \"TraceEventTestFixture_TraceSamplingScope_Test::TestBody\\n\"\n\n\/\/ http:\/\/crbug.com\/258479\n\"race:SamplingStateScope\\n\"\n\"race:g_trace_state\\n\"\n\n\/\/ http:\/\/crbug.com\/258499\n\"race:third_party\/skia\/include\/core\/SkRefCnt.h\\n\"\n\n\/\/ http:\/\/crbug.com\/268924\n\"race:base::g_power_monitor\\n\"\n\"race:base::PowerMonitor::PowerMonitor\\n\"\n\"race:base::PowerMonitor::AddObserver\\n\"\n\"race:base::PowerMonitor::RemoveObserver\\n\"\n\"race:base::PowerMonitor::IsOnBatteryPower\\n\"\n\n\/\/ http:\/\/crbug.com\/258935\n\"race:base::Thread::StopSoon\\n\"\n\n\/\/ http:\/\/crbug.com\/268941\n\"race:tracked_objects::ThreadData::tls_index_\\n\"\n\n\/\/ http:\/\/crbug.com\/272095\n\"race:base::g_top_manager\\n\"\n\n\/\/ http:\/\/crbug.com\/273047\n\"race:base::*::g_lazy_tls_ptr\\n\"\n\"race:IPC::SyncChannel::ReceivedSyncMsgQueue::lazy_tls_ptr_\\n\"\n\n\/\/ http:\/\/crbug.com\/280466\n\"race:content::WebRtcAudioCapturer::SetCapturerSource\\n\"\n\n\/\/ http:\/\/crbug.com\/285242\n\"race:media::PulseAudioOutputStream::SetVolume\\n\"\n\n\/\/ http:\/\/crbug.com\/296883\n\"race:net::URLFetcherCore::Stop\\n\"\n\n\/\/ http:\/\/crbug.com\/308590\n\"race:CustomThreadWatcher::~CustomThreadWatcher\\n\"\n\n\/\/ http:\/\/crbug.com\/310851\n\"race:net::ProxyResolverV8Tracing::Job::~Job\\n\"\n\n\/\/ http:\/\/crbug.com\/313726\n\"race:CallbackWasCalled\\n\"\n\n\/\/ http:\/\/crbug.com\/327330\n\"race:PrepareTextureMailbox\\n\"\n\"race:cc::LayerTreeHost::PaintLayerContents\\n\"\n\n\/\/ http:\/\/crbug.com\/328826\n\"race:gLCDOrder\\n\"\n\"race:gLCDOrientation\\n\"\n\n\/\/ http:\/\/crbug.com\/328868\n\"race:PR_Lock\\n\"\n\n\/\/ http:\/\/crbug.com\/329225\n\"race:blink::currentTimeFunction\\n\"\n\n\/\/ http:\/\/crbug.com\/329460\n\"race:extensions::InfoMap::AddExtension\\n\"\n\n\/\/ http:\/\/crbug.com\/333244\n\"race:content::\"\n \"VideoCaptureImplTest::MockVideoCaptureImpl::~MockVideoCaptureImpl\\n\"\n\n\/\/ http:\/\/crbug.com\/333871\n\"race:v8::internal::Interface::NewValue()::value_interface\\n\"\n\"race:v8::internal::IsMinusZero(double)::minus_zero\\n\"\n\"race:v8::internal::FastCloneShallowObjectStub::InitializeInterfaceDescriptor\\n\"\n\"race:v8::internal::KeyedLoadStubCompiler::registers\\n\"\n\"race:v8::internal::KeyedStoreStubCompiler::registers()::registers\\n\"\n\"race:v8::internal::KeyedLoadFastElementStub::InitializeInterfaceDescriptor\\n\"\n\"race:v8::internal::KeyedStoreFastElementStub::InitializeInterfaceDescriptor\\n\"\n\"race:v8::internal::LoadStubCompiler::registers\\n\"\n\"race:v8::internal::StoreStubCompiler::registers\\n\"\n\"race:v8::internal::HValue::LoopWeight\\n\"\n\n\/\/ http:\/\/crbug.com\/334140\n\"race:CommandLine::HasSwitch\\n\"\n\"race:CommandLine::current_process_commandline_\\n\"\n\"race:CommandLine::GetSwitchValueASCII\\n\"\n\n\/\/ http:\/\/crbug.com\/338675\n\"race:blink::s_platform\\n\"\n\"race:content::\"\n \"RendererWebKitPlatformSupportImpl::~RendererWebKitPlatformSupportImpl\\n\"\n\n\/\/ http:\/\/crbug.com\/345240\n\"race:WTF::s_shutdown\\n\"\n\n\/\/ http:\/\/crbug.com\/345245\n\"race:jingle_glue::JingleThreadWrapper::~JingleThreadWrapper\\n\"\n\"race:webrtc::voe::Channel::UpdatePacketDelay\\n\"\n\"race:webrtc::voe::Channel::GetDelayEstimate\\n\"\n\"race:webrtc::VCMCodecDataBase::DeregisterReceiveCodec\\n\"\n\"race:webrtc::GainControlImpl::set_stream_analog_level\\n\"\n\n\/\/ http:\/\/crbug.com\/345618\n\"race:WebCore::AudioDestinationNode::render\\n\"\n\n\/\/ http:\/\/crbug.com\/345624\n\"race:media::DataSource::set_host\\n\"\n\n\/\/ http:\/\/crbug.com\/347534\n\"race:v8::internal::V8::TearDown\\n\"\n\n\/\/ http:\/\/crbug.com\/347538\n\"race:sctp_timer_start\\n\"\n\n\/\/ http:\/\/crbug.com\/347548\n\"race:cricket::WebRtcVideoMediaChannel::MaybeResetVieSendCodec\\n\"\n\"race:cricket::WebRtcVideoMediaChannel::SetSendCodec\\n\"\n\n\/\/ http:\/\/crbug.com\/347553\n\"race:blink::WebString::reset\\n\"\n\n\/\/ http:\/\/crbug.com\/348511\n\"race:webrtc::acm1::AudioCodingModuleImpl::PlayoutData10Ms\\n\"\n\n\/\/ http:\/\/crbug.com\/348982\n\"race:cricket::P2PTransportChannel::OnConnectionDestroyed\\n\"\n\"race:cricket::P2PTransportChannel::AddConnection\\n\"\n\n\/\/ http:\/\/crbug.com\/348984\n\"race:sctp_express_handle_sack\\n\"\n\"race:system_base_info\\n\"\n\n\/\/ http:\/\/crbug.com\/363999\n\"race:v8::internal::EnterDebugger::*EnterDebugger\\n\"\n\n\/\/ https:\/\/code.google.com\/p\/v8\/issues\/detail?id=3143\n\"race:v8::internal::FLAG_track_double_fields\\n\"\n\n\/\/ https:\/\/crbug.com\/369257\n\/\/ TODO(mtklein): annotate properly and remove suppressions.\n\"race:SandboxIPCHandler::HandleFontMatchRequest\\n\"\n\"race:SkFontConfigInterfaceDirect::matchFamilyName\\n\"\n\"race:SkFontConfigInterface::GetSingletonDirectInterface\\n\"\n\"race:FcStrStaticName\\n\"\n\n\/\/ http:\/\/crbug.com\/372807\n\"deadlock:net::X509Certificate::CreateCertificateListFromBytes\\n\"\n\"deadlock:net::X509Certificate::CreateFromBytes\\n\"\n\"deadlock:net::SSLClientSocketNSS::Core::DoHandshakeLoop\\n\"\n\n\/\/ http:\/\/crbug.com\/374135\n\"race:media::AlsaWrapper::PcmWritei\\n\"\n\n\/\/ False positive in libc's tzset_internal, http:\/\/crbug.com\/379738.\n\"race:tzset_internal\\n\"\n\n\/\/ http:\/\/crbug.com\/380554\n\"deadlock:g_type_add_interface_static\\n\"\n\n\/\/ http::\/\/crbug.com\/386385\n\"race:content::AppCacheStorageImpl::DatabaseTask::CallRunCompleted\\n\"\n\n\/\/ http:\/\/crbug.com\/388730\n\"race:g_next_user_script_id\\n\"\n\n\/\/ http:\/\/crbug.com\/389098\n\"race:webrtc::RtpToNtpMs\\n\"\n\"race:webrtc::UpdateRtcpList\\n\"\n\"race:webrtc::RemoteNtpTimeEstimator::Estimate\\n\"\n\"race:webrtc::voe::TransmitMixer::EnableStereoChannelSwapping\\n\"\n\n\/\/ http:\/\/crbug.com\/397022\n\"deadlock:\"\n\"base::trace_event::TraceEventTestFixture_ThreadOnceBlocking_Test::TestBody\\n\"\n\n\/\/ http:\/\/crbug.com\/415472\n\"deadlock:base::trace_event::TraceLog::GetCategoryGroupEnabled\\n\"\n\n\/\/ http:\/\/crbug.com\/425057\n\"deadlock:webrtc::ViEChannelManagerScoped::ViEChannelManagerScoped\\n\"\n\n\/\/ http:\/\/crbug.com\/417193\n\/\/ Suppressing both AudioContext.{cpp,h}.\n\"race:modules\/webaudio\/AudioContext\\n\"\n\n\/\/ https:\/\/code.google.com\/p\/skia\/issues\/detail?id=3294\n\"race:SkBaseMutex::acquire\\n\"\n\n\/\/ https:\/\/crbug.com\/430533\n\"race:TileTaskGraphRunner::Run\\n\"\n\n\/\/ https:\/\/crbug.com\/448203\n\"race:blink::RemoteFrame::detach\\n\"\n\n\/\/ https:\/\/crbug.com\/454652\n\"race:net::NetworkChangeNotifier::SetTestNotificationsOnly\\n\"\n\n\/\/ https:\/\/crbug.com\/455638\n\"deadlock:dbus::Bus::ShutdownAndBlock\\n\"\n\n\/\/ https:\/\/crbug.com\/455665\n\"race:mojo::common::*::tick_clock\\n\"\n\n\/\/ https:\/\/crbug.com\/459429\n\"race:randomnessPid\\n\"\n\n\/\/ https:\/\/crbug.com\/454655\n\"race:content::BrowserTestBase::PostTaskToInProcessRendererAndWait\\n\"\n\n\/\/ End of suppressions.\n; \/\/ Please keep this semicolon.\n\n#endif \/\/ THREAD_SANITIZER\n<commit_msg>Suppress TSAN for cc::VideoLayerImpl::WillDraw<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\/\/ This file contains the default suppressions for ThreadSanitizer.\n\/\/ You can also pass additional suppressions via TSAN_OPTIONS:\n\/\/ TSAN_OPTIONS=suppressions=\/path\/to\/suppressions. Please refer to\n\/\/ http:\/\/dev.chromium.org\/developers\/testing\/threadsanitizer-tsan-v2\n\/\/ for more info.\n\n#if defined(THREAD_SANITIZER)\n\n\/\/ Please make sure the code below declares a single string variable\n\/\/ kTSanDefaultSuppressions contains TSan suppressions delimited by newlines.\n\/\/ See http:\/\/dev.chromium.org\/developers\/testing\/threadsanitizer-tsan-v2\n\/\/ for the instructions on writing suppressions.\nchar kTSanDefaultSuppressions[] =\n\/\/ False positives in libflashplayer.so and libglib.so. Since we don't\n\/\/ instrument them, we cannot reason about the synchronization in them.\n\"race:libflashplayer.so\\n\"\n\"race:libglib*.so\\n\"\n\n\/\/ Intentional race in ToolsSanityTest.DataRace in base_unittests.\n\"race:base\/tools_sanity_unittest.cc\\n\"\n\n\/\/ Data race on WatchdogCounter [test-only].\n\"race:base\/threading\/watchdog_unittest.cc\\n\"\n\n\/\/ Races in libevent, http:\/\/crbug.com\/23244.\n\"race:libevent\/event.c\\n\"\n\n\/\/ http:\/\/crbug.com\/46840.\n\"race:base::HistogramSamples::IncreaseSum\\n\"\n\"race:base::Histogram::Add\\n\"\n\"race:base::HistogramSamples::Add\\n\"\n\n\/\/ http:\/\/crbug.com\/84094.\n\"race:sqlite3StatusSet\\n\"\n\"race:pcache1EnforceMaxPage\\n\"\n\"race:pcache1AllocPage\\n\"\n\n\/\/ http:\/\/crbug.com\/102327.\n\/\/ Test-only race, won't fix.\n\"race:tracked_objects::ThreadData::ShutdownSingleThreadedCleanup\\n\"\n\n\/\/ http:\/\/crbug.com\/115540\n\"race:*GetCurrentThreadIdentifier\\n\"\n\n\/\/ http:\/\/crbug.com\/120808\n\"race:base\/threading\/watchdog.cc\\n\"\n\n\/\/ http:\/\/crbug.com\/157586\n\"race:third_party\/libvpx\/source\/libvpx\/vp8\/decoder\/threading.c\\n\"\n\n\/\/ http:\/\/crbug.com\/158718\n\"race:third_party\/ffmpeg\/libavcodec\/pthread.c\\n\"\n\"race:third_party\/ffmpeg\/libavcodec\/pthread_frame.c\\n\"\n\"race:third_party\/ffmpeg\/libavcodec\/vp8.c\\n\"\n\"race:third_party\/ffmpeg\/libavutil\/mem.c\\n\"\n\"race:*HashFrameForTesting\\n\"\n\"race:third_party\/ffmpeg\/libavcodec\/h264pred.c\\n\"\n\"race:media::ReleaseData\\n\"\n\n\/\/ http:\/\/crbug.com\/158922\n\"race:third_party\/libvpx\/source\/libvpx\/vp8\/encoder\/*\\n\"\n\"race:third_party\/libvpx\/source\/libvpx\/vp9\/encoder\/*\\n\"\n\n\/\/ http:\/\/crbug.com\/189177\n\"race:thread_manager\\n\"\n\"race:v8::Locker::Initialize\\n\"\n\n\/\/ http:\/\/crbug.com\/239359\n\"race:media::TestInputCallback::OnData\\n\"\n\n\/\/ http:\/\/crbug.com\/244368\n\"race:skia::BeginPlatformPaint\\n\"\n\n\/\/ http:\/\/crbug.com\/244385\n\"race:unixTempFileDir\\n\"\n\n\/\/ http:\/\/crbug.com\/244755\n\"race:v8::internal::Zone::NewExpand\\n\"\n\"race:TooLateToEnableNow\\n\"\n\"race:adjust_segment_bytes_allocated\\n\"\n\n\/\/ http:\/\/crbug.com\/244774\n\"race:webrtc::RTPReceiver::ProcessBitrate\\n\"\n\"race:webrtc::RTPSender::ProcessBitrate\\n\"\n\"race:webrtc::VideoCodingModuleImpl::Decode\\n\"\n\"race:webrtc::RTPSender::SendOutgoingData\\n\"\n\"race:webrtc::VP8EncoderImpl::GetEncodedPartitions\\n\"\n\"race:webrtc::VP8EncoderImpl::Encode\\n\"\n\"race:webrtc::ViEEncoder::DeliverFrame\\n\"\n\"race:webrtc::vcm::VideoReceiver::Decode\\n\"\n\"race:webrtc::VCMReceiver::FrameForDecoding\\n\"\n\"race:*trace_event_unique_catstatic*\\n\"\n\n\/\/ http:\/\/crbug.com\/244856\n\"race:AutoPulseLock\\n\"\n\n\/\/ http:\/\/crbug.com\/246968\n\"race:webrtc::VideoCodingModuleImpl::RegisterPacketRequestCallback\\n\"\n\n\/\/ http:\/\/crbug.com\/246974\n\"race:content::GpuWatchdogThread::CheckArmed\\n\"\n\n\/\/ http:\/\/crbug.com\/257396\n\"race:base::trace_event::\"\n \"TraceEventTestFixture_TraceSamplingScope_Test::TestBody\\n\"\n\n\/\/ http:\/\/crbug.com\/258479\n\"race:SamplingStateScope\\n\"\n\"race:g_trace_state\\n\"\n\n\/\/ http:\/\/crbug.com\/258499\n\"race:third_party\/skia\/include\/core\/SkRefCnt.h\\n\"\n\n\/\/ http:\/\/crbug.com\/268924\n\"race:base::g_power_monitor\\n\"\n\"race:base::PowerMonitor::PowerMonitor\\n\"\n\"race:base::PowerMonitor::AddObserver\\n\"\n\"race:base::PowerMonitor::RemoveObserver\\n\"\n\"race:base::PowerMonitor::IsOnBatteryPower\\n\"\n\n\/\/ http:\/\/crbug.com\/258935\n\"race:base::Thread::StopSoon\\n\"\n\n\/\/ http:\/\/crbug.com\/268941\n\"race:tracked_objects::ThreadData::tls_index_\\n\"\n\n\/\/ http:\/\/crbug.com\/272095\n\"race:base::g_top_manager\\n\"\n\n\/\/ http:\/\/crbug.com\/273047\n\"race:base::*::g_lazy_tls_ptr\\n\"\n\"race:IPC::SyncChannel::ReceivedSyncMsgQueue::lazy_tls_ptr_\\n\"\n\n\/\/ http:\/\/crbug.com\/280466\n\"race:content::WebRtcAudioCapturer::SetCapturerSource\\n\"\n\n\/\/ http:\/\/crbug.com\/285242\n\"race:media::PulseAudioOutputStream::SetVolume\\n\"\n\n\/\/ http:\/\/crbug.com\/296883\n\"race:net::URLFetcherCore::Stop\\n\"\n\n\/\/ http:\/\/crbug.com\/308590\n\"race:CustomThreadWatcher::~CustomThreadWatcher\\n\"\n\n\/\/ http:\/\/crbug.com\/310851\n\"race:net::ProxyResolverV8Tracing::Job::~Job\\n\"\n\n\/\/ http:\/\/crbug.com\/313726\n\"race:CallbackWasCalled\\n\"\n\n\/\/ http:\/\/crbug.com\/327330\n\"race:PrepareTextureMailbox\\n\"\n\"race:cc::LayerTreeHost::PaintLayerContents\\n\"\n\n\/\/ http:\/\/crbug.com\/476529\n\"deadlock:cc::VideoLayerImpl::WillDraw\\n\"\n\n\/\/ http:\/\/crbug.com\/328826\n\"race:gLCDOrder\\n\"\n\"race:gLCDOrientation\\n\"\n\n\/\/ http:\/\/crbug.com\/328868\n\"race:PR_Lock\\n\"\n\n\/\/ http:\/\/crbug.com\/329225\n\"race:blink::currentTimeFunction\\n\"\n\n\/\/ http:\/\/crbug.com\/329460\n\"race:extensions::InfoMap::AddExtension\\n\"\n\n\/\/ http:\/\/crbug.com\/333244\n\"race:content::\"\n \"VideoCaptureImplTest::MockVideoCaptureImpl::~MockVideoCaptureImpl\\n\"\n\n\/\/ http:\/\/crbug.com\/333871\n\"race:v8::internal::Interface::NewValue()::value_interface\\n\"\n\"race:v8::internal::IsMinusZero(double)::minus_zero\\n\"\n\"race:v8::internal::FastCloneShallowObjectStub::InitializeInterfaceDescriptor\\n\"\n\"race:v8::internal::KeyedLoadStubCompiler::registers\\n\"\n\"race:v8::internal::KeyedStoreStubCompiler::registers()::registers\\n\"\n\"race:v8::internal::KeyedLoadFastElementStub::InitializeInterfaceDescriptor\\n\"\n\"race:v8::internal::KeyedStoreFastElementStub::InitializeInterfaceDescriptor\\n\"\n\"race:v8::internal::LoadStubCompiler::registers\\n\"\n\"race:v8::internal::StoreStubCompiler::registers\\n\"\n\"race:v8::internal::HValue::LoopWeight\\n\"\n\n\/\/ http:\/\/crbug.com\/334140\n\"race:CommandLine::HasSwitch\\n\"\n\"race:CommandLine::current_process_commandline_\\n\"\n\"race:CommandLine::GetSwitchValueASCII\\n\"\n\n\/\/ http:\/\/crbug.com\/338675\n\"race:blink::s_platform\\n\"\n\"race:content::\"\n \"RendererWebKitPlatformSupportImpl::~RendererWebKitPlatformSupportImpl\\n\"\n\n\/\/ http:\/\/crbug.com\/345240\n\"race:WTF::s_shutdown\\n\"\n\n\/\/ http:\/\/crbug.com\/345245\n\"race:jingle_glue::JingleThreadWrapper::~JingleThreadWrapper\\n\"\n\"race:webrtc::voe::Channel::UpdatePacketDelay\\n\"\n\"race:webrtc::voe::Channel::GetDelayEstimate\\n\"\n\"race:webrtc::VCMCodecDataBase::DeregisterReceiveCodec\\n\"\n\"race:webrtc::GainControlImpl::set_stream_analog_level\\n\"\n\n\/\/ http:\/\/crbug.com\/345618\n\"race:WebCore::AudioDestinationNode::render\\n\"\n\n\/\/ http:\/\/crbug.com\/345624\n\"race:media::DataSource::set_host\\n\"\n\n\/\/ http:\/\/crbug.com\/347534\n\"race:v8::internal::V8::TearDown\\n\"\n\n\/\/ http:\/\/crbug.com\/347538\n\"race:sctp_timer_start\\n\"\n\n\/\/ http:\/\/crbug.com\/347548\n\"race:cricket::WebRtcVideoMediaChannel::MaybeResetVieSendCodec\\n\"\n\"race:cricket::WebRtcVideoMediaChannel::SetSendCodec\\n\"\n\n\/\/ http:\/\/crbug.com\/347553\n\"race:blink::WebString::reset\\n\"\n\n\/\/ http:\/\/crbug.com\/348511\n\"race:webrtc::acm1::AudioCodingModuleImpl::PlayoutData10Ms\\n\"\n\n\/\/ http:\/\/crbug.com\/348982\n\"race:cricket::P2PTransportChannel::OnConnectionDestroyed\\n\"\n\"race:cricket::P2PTransportChannel::AddConnection\\n\"\n\n\/\/ http:\/\/crbug.com\/348984\n\"race:sctp_express_handle_sack\\n\"\n\"race:system_base_info\\n\"\n\n\/\/ http:\/\/crbug.com\/363999\n\"race:v8::internal::EnterDebugger::*EnterDebugger\\n\"\n\n\/\/ https:\/\/code.google.com\/p\/v8\/issues\/detail?id=3143\n\"race:v8::internal::FLAG_track_double_fields\\n\"\n\n\/\/ https:\/\/crbug.com\/369257\n\/\/ TODO(mtklein): annotate properly and remove suppressions.\n\"race:SandboxIPCHandler::HandleFontMatchRequest\\n\"\n\"race:SkFontConfigInterfaceDirect::matchFamilyName\\n\"\n\"race:SkFontConfigInterface::GetSingletonDirectInterface\\n\"\n\"race:FcStrStaticName\\n\"\n\n\/\/ http:\/\/crbug.com\/372807\n\"deadlock:net::X509Certificate::CreateCertificateListFromBytes\\n\"\n\"deadlock:net::X509Certificate::CreateFromBytes\\n\"\n\"deadlock:net::SSLClientSocketNSS::Core::DoHandshakeLoop\\n\"\n\n\/\/ http:\/\/crbug.com\/374135\n\"race:media::AlsaWrapper::PcmWritei\\n\"\n\n\/\/ False positive in libc's tzset_internal, http:\/\/crbug.com\/379738.\n\"race:tzset_internal\\n\"\n\n\/\/ http:\/\/crbug.com\/380554\n\"deadlock:g_type_add_interface_static\\n\"\n\n\/\/ http::\/\/crbug.com\/386385\n\"race:content::AppCacheStorageImpl::DatabaseTask::CallRunCompleted\\n\"\n\n\/\/ http:\/\/crbug.com\/388730\n\"race:g_next_user_script_id\\n\"\n\n\/\/ http:\/\/crbug.com\/389098\n\"race:webrtc::RtpToNtpMs\\n\"\n\"race:webrtc::UpdateRtcpList\\n\"\n\"race:webrtc::RemoteNtpTimeEstimator::Estimate\\n\"\n\"race:webrtc::voe::TransmitMixer::EnableStereoChannelSwapping\\n\"\n\n\/\/ http:\/\/crbug.com\/397022\n\"deadlock:\"\n\"base::trace_event::TraceEventTestFixture_ThreadOnceBlocking_Test::TestBody\\n\"\n\n\/\/ http:\/\/crbug.com\/415472\n\"deadlock:base::trace_event::TraceLog::GetCategoryGroupEnabled\\n\"\n\n\/\/ http:\/\/crbug.com\/425057\n\"deadlock:webrtc::ViEChannelManagerScoped::ViEChannelManagerScoped\\n\"\n\n\/\/ http:\/\/crbug.com\/417193\n\/\/ Suppressing both AudioContext.{cpp,h}.\n\"race:modules\/webaudio\/AudioContext\\n\"\n\n\/\/ https:\/\/code.google.com\/p\/skia\/issues\/detail?id=3294\n\"race:SkBaseMutex::acquire\\n\"\n\n\/\/ https:\/\/crbug.com\/430533\n\"race:TileTaskGraphRunner::Run\\n\"\n\n\/\/ https:\/\/crbug.com\/448203\n\"race:blink::RemoteFrame::detach\\n\"\n\n\/\/ https:\/\/crbug.com\/454652\n\"race:net::NetworkChangeNotifier::SetTestNotificationsOnly\\n\"\n\n\/\/ https:\/\/crbug.com\/455638\n\"deadlock:dbus::Bus::ShutdownAndBlock\\n\"\n\n\/\/ https:\/\/crbug.com\/455665\n\"race:mojo::common::*::tick_clock\\n\"\n\n\/\/ https:\/\/crbug.com\/459429\n\"race:randomnessPid\\n\"\n\n\/\/ https:\/\/crbug.com\/454655\n\"race:content::BrowserTestBase::PostTaskToInProcessRendererAndWait\\n\"\n\n\/\/ End of suppressions.\n; \/\/ Please keep this semicolon.\n\n#endif \/\/ THREAD_SANITIZER\n<|endoftext|>"} {"text":"<commit_before>#include <algorithm>\n#include <string>\n\n#include <gtest\/gtest.h>\n\n#include \"prefix_function.hpp\"\n\n\nnamespace gt = testing;\n\n\nnamespace pk\n{\nnamespace testing\n{\n\n\nstruct prefix_function_tester : public gt::Test\n{\n static const int MAX_TEXT_SIZE = 100;\n\n \/\/ tested class:\n prefix_function<MAX_TEXT_SIZE> pf;\n};\n\n\nTEST_F(prefix_function_tester, tests_abcd)\n{\n \/\/ given\n const std::string text = \"abcd\";\n\n \/\/ when\n pf.run(text.c_str(), text.size());\n\n \/\/ then\n const int* prefix_suffix_table = pf.get_prefix_suffix_table();\n\n EXPECT_EQ(0, prefix_suffix_table[0]);\n EXPECT_EQ(0, prefix_suffix_table[1]);\n EXPECT_EQ(0, prefix_suffix_table[2]);\n EXPECT_EQ(0, prefix_suffix_table[3]);\n}\n\n\nTEST_F(prefix_function_tester, tests_aaaa)\n{\n \/\/ given\n const std::string text = \"aaaa\";\n\n \/\/ when\n pf.run(text.c_str(), text.size());\n\n \/\/ then\n const int* prefix_suffix_table = pf.get_prefix_suffix_table();\n\n EXPECT_EQ(0, prefix_suffix_table[0]);\n EXPECT_EQ(1, prefix_suffix_table[1]);\n EXPECT_EQ(2, prefix_suffix_table[2]);\n EXPECT_EQ(3, prefix_suffix_table[3]);\n}\n\n\nTEST_F(prefix_function_tester, tests_abcabcabc)\n{\n \/\/ given\n const std::string text = \"abcabcabc\";\n\n \/\/ when\n pf.run(text.c_str(), text.size());\n\n \/\/ then\n const int* prefix_suffix_table = pf.get_prefix_suffix_table();\n\n EXPECT_EQ(0, prefix_suffix_table[0]);\n EXPECT_EQ(0, prefix_suffix_table[1]);\n EXPECT_EQ(0, prefix_suffix_table[2]);\n EXPECT_EQ(1, prefix_suffix_table[3]);\n EXPECT_EQ(2, prefix_suffix_table[4]);\n EXPECT_EQ(3, prefix_suffix_table[5]);\n EXPECT_EQ(4, prefix_suffix_table[6]);\n EXPECT_EQ(5, prefix_suffix_table[7]);\n EXPECT_EQ(6, prefix_suffix_table[8]);\n}\n\n\nTEST_F(prefix_function_tester, tests_abcdabcaba)\n{\n \/\/ given\n const std::string text = \"abcdabcaba\";\n\n \/\/ when\n pf.run(text.c_str(), text.size());\n\n \/\/ then\n const int* prefix_suffix_table = pf.get_prefix_suffix_table();\n\n EXPECT_EQ(0, prefix_suffix_table[0]);\n EXPECT_EQ(0, prefix_suffix_table[1]);\n EXPECT_EQ(0, prefix_suffix_table[2]);\n EXPECT_EQ(0, prefix_suffix_table[3]);\n EXPECT_EQ(1, prefix_suffix_table[4]);\n EXPECT_EQ(2, prefix_suffix_table[5]);\n EXPECT_EQ(3, prefix_suffix_table[6]);\n EXPECT_EQ(1, prefix_suffix_table[7]);\n EXPECT_EQ(2, prefix_suffix_table[8]);\n EXPECT_EQ(1, prefix_suffix_table[9]);\n}\n\n\nTEST_F(prefix_function_tester, tests_pattern_searching_in_text)\n{\n \/\/ given\n const std::string pattern = \"abca\";\n const std::string text = \"abaabcdabcabdabcabcad\";\n \/\/ pattern ends at: ^ ^ ^\n\n \/\/ when\n std::string s = pattern + \"#\" + text;\n pf.run(s.c_str(), s.size());\n\n \/\/ then\n const int* prefix_suffix_table = pf.get_prefix_suffix_table();\n\n EXPECT_EQ(3u, std::count(prefix_suffix_table, prefix_suffix_table + s.size(), pattern.size()));\n\n const int first_occurance = pattern.size() + 1 + 10;\n EXPECT_EQ(pattern.size(), prefix_suffix_table[first_occurance]);\n\n const int second_occurance = pattern.size() + 1 + 16;\n EXPECT_EQ(pattern.size(), prefix_suffix_table[second_occurance]);\n\n const int third_occurance = pattern.size() + 1 + 19;\n EXPECT_EQ(pattern.size(), prefix_suffix_table[third_occurance]);\n}\n\n\n} \/\/ namespace testing\n} \/\/ namespace pk\n<commit_msg>Comparison between signed and unsigned integers removed<commit_after>#include <algorithm>\n#include <string>\n\n#include <gtest\/gtest.h>\n\n#include \"prefix_function.hpp\"\n\n\nnamespace gt = testing;\n\n\nnamespace pk\n{\nnamespace testing\n{\n\n\nstruct prefix_function_tester : public gt::Test\n{\n static const int MAX_TEXT_SIZE = 100;\n\n \/\/ tested class:\n prefix_function<MAX_TEXT_SIZE> pf;\n};\n\n\nTEST_F(prefix_function_tester, tests_abcd)\n{\n \/\/ given\n const std::string text = \"abcd\";\n\n \/\/ when\n pf.run(text.c_str(), text.size());\n\n \/\/ then\n const int* prefix_suffix_table = pf.get_prefix_suffix_table();\n\n EXPECT_EQ(0, prefix_suffix_table[0]);\n EXPECT_EQ(0, prefix_suffix_table[1]);\n EXPECT_EQ(0, prefix_suffix_table[2]);\n EXPECT_EQ(0, prefix_suffix_table[3]);\n}\n\n\nTEST_F(prefix_function_tester, tests_aaaa)\n{\n \/\/ given\n const std::string text = \"aaaa\";\n\n \/\/ when\n pf.run(text.c_str(), text.size());\n\n \/\/ then\n const int* prefix_suffix_table = pf.get_prefix_suffix_table();\n\n EXPECT_EQ(0, prefix_suffix_table[0]);\n EXPECT_EQ(1, prefix_suffix_table[1]);\n EXPECT_EQ(2, prefix_suffix_table[2]);\n EXPECT_EQ(3, prefix_suffix_table[3]);\n}\n\n\nTEST_F(prefix_function_tester, tests_abcabcabc)\n{\n \/\/ given\n const std::string text = \"abcabcabc\";\n\n \/\/ when\n pf.run(text.c_str(), text.size());\n\n \/\/ then\n const int* prefix_suffix_table = pf.get_prefix_suffix_table();\n\n EXPECT_EQ(0, prefix_suffix_table[0]);\n EXPECT_EQ(0, prefix_suffix_table[1]);\n EXPECT_EQ(0, prefix_suffix_table[2]);\n EXPECT_EQ(1, prefix_suffix_table[3]);\n EXPECT_EQ(2, prefix_suffix_table[4]);\n EXPECT_EQ(3, prefix_suffix_table[5]);\n EXPECT_EQ(4, prefix_suffix_table[6]);\n EXPECT_EQ(5, prefix_suffix_table[7]);\n EXPECT_EQ(6, prefix_suffix_table[8]);\n}\n\n\nTEST_F(prefix_function_tester, tests_abcdabcaba)\n{\n \/\/ given\n const std::string text = \"abcdabcaba\";\n\n \/\/ when\n pf.run(text.c_str(), text.size());\n\n \/\/ then\n const int* prefix_suffix_table = pf.get_prefix_suffix_table();\n\n EXPECT_EQ(0, prefix_suffix_table[0]);\n EXPECT_EQ(0, prefix_suffix_table[1]);\n EXPECT_EQ(0, prefix_suffix_table[2]);\n EXPECT_EQ(0, prefix_suffix_table[3]);\n EXPECT_EQ(1, prefix_suffix_table[4]);\n EXPECT_EQ(2, prefix_suffix_table[5]);\n EXPECT_EQ(3, prefix_suffix_table[6]);\n EXPECT_EQ(1, prefix_suffix_table[7]);\n EXPECT_EQ(2, prefix_suffix_table[8]);\n EXPECT_EQ(1, prefix_suffix_table[9]);\n}\n\n\nTEST_F(prefix_function_tester, tests_pattern_searching_in_text)\n{\n \/\/ given\n const std::string pattern = \"abca\";\n const std::string text = \"abaabcdabcabdabcabcad\";\n \/\/ pattern ends at: ^ ^ ^\n\n \/\/ when\n std::string s = pattern + \"#\" + text;\n pf.run(s.c_str(), s.size());\n\n \/\/ then\n const int* prefix_suffix_table = pf.get_prefix_suffix_table();\n\n EXPECT_EQ(3u, std::count(prefix_suffix_table, prefix_suffix_table + s.size(), pattern.size()));\n\n const int first_occurance = pattern.size() + 1 + 10;\n EXPECT_EQ(4, prefix_suffix_table[first_occurance]);\n\n const int second_occurance = pattern.size() + 1 + 16;\n EXPECT_EQ(4, prefix_suffix_table[second_occurance]);\n\n const int third_occurance = pattern.size() + 1 + 19;\n EXPECT_EQ(4, prefix_suffix_table[third_occurance]);\n}\n\n\n} \/\/ namespace testing\n} \/\/ namespace pk\n<|endoftext|>"} {"text":"<commit_before>#include \"tests\/Base.hh\"\n\n#include \"topology\/MaximalCliques.hh\"\n\n#include \"topology\/Simplex.hh\"\n#include \"topology\/SimplicialComplex.hh\"\n\n#include <algorithm>\n#include <vector>\n\nusing namespace aleph::topology;\nusing namespace aleph;\n\ntemplate <class Data, class Vertex> void triangles()\n{\n ALEPH_TEST_BEGIN( \"Triangles [connected & unconnected]\" );\n\n using Simplex = Simplex<Data, Vertex>;\n using SimplicialComplex = SimplicialComplex<Simplex>;\n\n \/\/ 2---1\n \/\/ | \/|\n \/\/ | \/ |\n \/\/ |\/ |\n \/\/ 0---3\n \/\/\n \/\/ Expected cliques: {0,1,2}, {0,3,1}\n std::vector<Simplex> trianglesConnected\n = {\n {0,1}, {0,2}, {0,3}, {1,2}, {1,3},\n {0,1,2}, {0,1,3}\n };\n\n \/\/ 2---1 5\n \/\/ | \/ \/|\n \/\/ | \/ \/ |\n \/\/ |\/ \/ |\n \/\/ 0---3---4\n \/\/\n \/\/ Expected cliques: {0,3}, {0,1,2}, {3,4,5}\n std::vector<Simplex> trianglesDisconnected\n = {\n {0,1}, {0,2}, {0,3}, {1,2}, {3,4}, {3,5}, {4,5},\n {0,1,2}, {3,4,5}\n };\n\n SimplicialComplex K1( trianglesConnected.begin() , trianglesConnected.end() );\n SimplicialComplex K2( trianglesDisconnected.begin(), trianglesDisconnected.end() );\n\n auto C11 = maximalCliquesBronKerbosch( K1 );\n auto C12 = maximalCliquesKoch( K1 );\n auto C21 = maximalCliquesBronKerbosch( K2 );\n auto C22 = maximalCliquesKoch( K2 );\n\n ALEPH_ASSERT_THROW( C11.empty() == false );\n ALEPH_ASSERT_THROW( C12.empty() == false );\n ALEPH_ASSERT_THROW( C21.empty() == false );\n ALEPH_ASSERT_THROW( C22.empty() == false );\n\n ALEPH_ASSERT_EQUAL( C11.size(), C12.size() );\n ALEPH_ASSERT_EQUAL( C21.size(), C22.size() );\n\n ALEPH_TEST_END();\n}\n\nint main()\n{\n triangles<double, unsigned>();\n triangles<float, unsigned>();\n}\n<commit_msg>Extended test case for maximal clique enumeration<commit_after>#include \"tests\/Base.hh\"\n\n#include \"topology\/MaximalCliques.hh\"\n\n#include \"topology\/Simplex.hh\"\n#include \"topology\/SimplicialComplex.hh\"\n\n#include <algorithm>\n#include <vector>\n\nusing namespace aleph::topology;\nusing namespace aleph;\n\ntemplate <class Data, class Vertex> void triangles()\n{\n ALEPH_TEST_BEGIN( \"Triangles [connected & unconnected]\" );\n\n using Simplex = Simplex<Data, Vertex>;\n using SimplicialComplex = SimplicialComplex<Simplex>;\n\n \/\/ 2---1\n \/\/ | \/|\n \/\/ | \/ |\n \/\/ |\/ |\n \/\/ 0---3\n \/\/\n \/\/ Expected cliques: {0,1,2}, {0,3,1}\n std::vector<Simplex> trianglesConnected\n = {\n {0,1}, {0,2}, {0,3}, {1,2}, {1,3},\n {0,1,2}, {0,1,3}\n };\n\n \/\/ 2---1 5\n \/\/ | \/ \/|\n \/\/ | \/ \/ |\n \/\/ |\/ \/ |\n \/\/ 0---3---4\n \/\/\n \/\/ Expected cliques: {0,3}, {0,1,2}, {3,4,5}\n std::vector<Simplex> trianglesDisconnected\n = {\n {0,1}, {0,2}, {0,3}, {1,2}, {3,4}, {3,5}, {4,5},\n {0,1,2}, {3,4,5}\n };\n\n SimplicialComplex K1( trianglesConnected.begin() , trianglesConnected.end() );\n SimplicialComplex K2( trianglesDisconnected.begin(), trianglesDisconnected.end() );\n\n auto C11 = maximalCliquesBronKerbosch( K1 );\n auto C12 = maximalCliquesKoch( K1 );\n auto C21 = maximalCliquesBronKerbosch( K2 );\n auto C22 = maximalCliquesKoch( K2 );\n\n ALEPH_ASSERT_THROW( C11.empty() == false );\n ALEPH_ASSERT_THROW( C12.empty() == false );\n ALEPH_ASSERT_THROW( C21.empty() == false );\n ALEPH_ASSERT_THROW( C22.empty() == false );\n\n ALEPH_ASSERT_EQUAL( C11.size(), C12.size() );\n ALEPH_ASSERT_EQUAL( C21.size(), C22.size() );\n\n ALEPH_ASSERT_EQUAL( C11.size(), 2 );\n ALEPH_ASSERT_EQUAL( C21.size(), 3 );\n\n ALEPH_ASSERT_THROW( C11 == C12 );\n ALEPH_ASSERT_THROW( C21 == C22 );\n\n ALEPH_ASSERT_THROW( std::find( C11.begin(), C11.end(), std::set<Vertex>( {0,1,2} ) ) != C11.end() );\n ALEPH_ASSERT_THROW( std::find( C11.begin(), C11.end(), std::set<Vertex>( {0,1,3} ) ) != C11.end() );\n\n ALEPH_ASSERT_THROW( std::find( C21.begin(), C21.end(), std::set<Vertex>( {0,3 } ) ) != C21.end() );\n ALEPH_ASSERT_THROW( std::find( C21.begin(), C21.end(), std::set<Vertex>( {0,1,2} ) ) != C21.end() );\n ALEPH_ASSERT_THROW( std::find( C21.begin(), C21.end(), std::set<Vertex>( {3,4,5} ) ) != C21.end() );\n\n ALEPH_TEST_END();\n}\n\nint main()\n{\n triangles<double, unsigned>();\n triangles<float, unsigned>();\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 2011 Dennis Nienhüser <earthwings@gentoo.org>\n\/\/\n\n#include \"OsmDatabase.h\"\n#include \"MarbleDebug.h\"\n#include \"MarbleMath.h\"\n#include \"MarbleLocale.h\"\n#include \"DatabaseQuery.h\"\n\n#include <QtCore\/QFile>\n#include <QtCore\/QDataStream>\n#include <QtCore\/QStringList>\n#include <QtCore\/QRegExp>\n#include <QtCore\/QVariant>\n#include <QtCore\/QTime>\n\n#include <QtSql\/QSqlDatabase>\n#include <QtSql\/QSqlQuery>\n#include <QtSql\/QSqlError>\n\nnamespace Marble {\n\nOsmDatabase::OsmDatabase()\n{\n m_database = QSqlDatabase::addDatabase( \"QSQLITE\" );\n}\n\nvoid OsmDatabase::addFile( const QString &fileName )\n{\n m_databases << fileName;\n}\n\nQList<OsmPlacemark> OsmDatabase::find( MarbleModel* model, const QString &searchTerm )\n{\n if ( m_databases.isEmpty() ) {\n return QList<OsmPlacemark>();\n }\n\n DatabaseQuery userQuery( model, searchTerm );\n\n QList<OsmPlacemark> result;\n QTime timer;\n timer.start();\n foreach( const QString &databaseFile, m_databases ) {\n m_database.setDatabaseName( databaseFile );\n if ( !m_database.open() ) {\n mDebug() << \"Failed to connect to database \" << databaseFile;\n }\n\n QString regionRestriction;\n if ( !userQuery.region().isEmpty() ) {\n \/\/ Nested set model to support region hierarchies, see http:\/\/en.wikipedia.org\/wiki\/Nested_set_model\n QSqlQuery regionsQuery( \"SELECT lft, rgt FROM regions WHERE name LIKE '%\" + userQuery.region() + \"%';\" );\n if ( regionsQuery.lastError().isValid() ) {\n mDebug() << \"Error when executing query\" << regionsQuery.executedQuery();\n mDebug() << \"Sql reports\" << regionsQuery.lastError();\n }\n regionRestriction = \" AND (\";\n bool first = true;\n while ( regionsQuery.next() ) {\n if ( first ) {\n first = false;\n } else {\n regionRestriction += \" OR \";\n }\n regionRestriction += \" (regions.lft >= \" + regionsQuery.value( 0 ).toString();\n regionRestriction += \" AND regions.lft <= \" + regionsQuery.value( 1 ).toString() + \")\";\n }\n regionRestriction += \")\";\n\n if ( first ) {\n return QList<OsmPlacemark>();\n }\n }\n\n QString queryString;\n\n queryString = \" SELECT regions.name,\"\n \" places.name, places.number,\"\n \" places.category, places.lon, places.lat\"\n \" FROM regions, places\";\n\n if ( userQuery.queryType() == DatabaseQuery::CategorySearch ) {\n queryString += \" WHERE regions.id = places.region AND places.category = %1\";\n queryString = queryString.arg( (qint32) userQuery.category() );\n if ( userQuery.resultFormat() == DatabaseQuery::DistanceFormat && userQuery.region().isEmpty() ) {\n queryString += \" ORDER BY ((places.lat-%1)*(places.lat-%1)+(places.lon-%2)*(places.lon-%2))\";\n GeoDataCoordinates position = userQuery.position();\n queryString = queryString.arg( position.latitude( GeoDataCoordinates::Degree ), 0, 'f', 8 )\n .arg( position.longitude( GeoDataCoordinates::Degree ), 0, 'f', 8 );\n } else {\n queryString += regionRestriction;\n }\n } else if ( userQuery.queryType() == DatabaseQuery::BroadSearch ) {\n queryString += \" WHERE regions.id = places.region\"\n \" AND places.name \" + wildcardQuery( searchTerm );\n } else {\n queryString += \" WHERE regions.id = places.region\"\n \" AND places.name \" + wildcardQuery( userQuery.street() );\n if ( !userQuery.houseNumber().isEmpty() ) {\n queryString += \" AND places.number \" + wildcardQuery( userQuery.houseNumber() );\n } else {\n queryString += \"AND places.number IS NULL\";\n }\n queryString += regionRestriction;\n }\n\n queryString += \" LIMIT 50;\";\n\n \/** @todo: sort\/filter results from several databases *\/\n\n QSqlQuery query;\n query.setForwardOnly( true );\n if ( !query.exec( queryString ) ) {\n mDebug() << \"Failed to execute query\" << query.lastError();\n return result;\n }\n\n while ( query.next() ) {\n OsmPlacemark placemark;\n if ( userQuery.resultFormat() == DatabaseQuery::DistanceFormat ) {\n GeoDataCoordinates coordinates( query.value(4).toFloat(), query.value(5).toFloat(), 0.0, GeoDataCoordinates::Degree );\n placemark.setAdditionalInformation( formatDistance( coordinates, userQuery.position() ) );\n } else {\n placemark.setAdditionalInformation( query.value( 0 ).toString() );\n }\n placemark.setName( query.value(1).toString() );\n placemark.setHouseNumber( query.value(2).toString() );\n placemark.setCategory( (OsmPlacemark::OsmCategory) query.value(3).toInt() );\n placemark.setLongitude( query.value(4).toFloat() );\n placemark.setLatitude( query.value(5).toFloat() );\n result.push_back( placemark );\n }\n\n \/\/ mDebug() << \"Query string: \" << queryString;\n }\n\n mDebug() << \"Offline OSM search query took \" << timer.elapsed() << \" ms.\";\n return result;\n}\n\nQString OsmDatabase::formatDistance( const GeoDataCoordinates &a, const GeoDataCoordinates &b ) const\n{\n qreal distance = EARTH_RADIUS * distanceSphere( a, b);\n\n int precision = 0;\n QString distanceUnit = \"m\";\n\n if ( MarbleGlobal::getInstance()->locale()->distanceUnit() == Marble::MilesFeet ) {\n precision = 1;\n distanceUnit = \"mi\";\n distance *= METER2KM;\n distance *= KM2MI;\n } else {\n if ( distance >= 1000 ) {\n distance \/= 1000;\n distanceUnit = \"km\";\n precision = 1;\n } else if ( distance >= 200 ) {\n distance = 50 * qRound( distance \/ 50 );\n } else if ( distance >= 100 ) {\n distance = 25 * qRound( distance \/ 25 );\n } else {\n distance = 10 * qRound( distance \/ 10 );\n }\n }\n\n QString const fuzzyDistance = QString( \"%1 %2\" ).arg( distance, 0, 'f', precision ).arg( distanceUnit );\n\n int direction = 180 + bearing( a, b ) * RAD2DEG;\n\n QString heading = QObject::tr( \"north\" );\n if ( direction > 337 ) {\n heading = QObject::tr( \"north\" );\n } else if ( direction > 292 ) {\n heading = QObject::tr( \"north-west\" );\n } else if ( direction > 247 ) {\n heading = QObject::tr( \"west\" );\n } else if ( direction > 202 ) {\n heading = QObject::tr( \"south-west\" );\n } else if ( direction > 157 ) {\n heading = QObject::tr( \"south\" );\n } else if ( direction > 112 ) {\n heading = QObject::tr( \"south-east\" );\n } else if ( direction > 67 ) {\n heading = QObject::tr( \"east\" );\n } else if ( direction > 22 ) {\n heading = QObject::tr( \"north-east\" );\n }\n\n return fuzzyDistance + \" \" + heading;\n}\n\nqreal OsmDatabase::bearing( const GeoDataCoordinates &a, const GeoDataCoordinates &b ) const\n{\n qreal delta = b.longitude() - a.longitude();\n qreal lat1 = a.latitude();\n qreal lat2 = b.latitude();\n return fmod( atan2( sin ( delta ) * cos ( lat2 ),\n cos( lat1 ) * sin( lat2 ) - sin( lat1 ) * cos( lat2 ) * cos ( delta ) ), 2 * M_PI );\n}\n\nQString OsmDatabase::wildcardQuery( const QString &term ) const\n{\n QString result = term;\n if ( term.contains( '*' ) ) {\n return \" LIKE '\" + result.replace( '*', '%' ) + \"'\";\n } else {\n return \" = '\" + result + \"'\";\n }\n}\n\n}\n<commit_msg>Fix region restriction for multiple databases.<commit_after>\/\/\n\/\/ This file is part of the Marble Virtual Globe.\n\/\/\n\/\/ This program is free software licensed under the GNU LGPL. You can\n\/\/ find a copy of this license in LICENSE.txt in the top directory of\n\/\/ the source code.\n\/\/\n\/\/ Copyright 2011 Dennis Nienhüser <earthwings@gentoo.org>\n\/\/\n\n#include \"OsmDatabase.h\"\n#include \"MarbleDebug.h\"\n#include \"MarbleMath.h\"\n#include \"MarbleLocale.h\"\n#include \"DatabaseQuery.h\"\n\n#include <QtCore\/QFile>\n#include <QtCore\/QDataStream>\n#include <QtCore\/QStringList>\n#include <QtCore\/QRegExp>\n#include <QtCore\/QVariant>\n#include <QtCore\/QTime>\n\n#include <QtSql\/QSqlDatabase>\n#include <QtSql\/QSqlQuery>\n#include <QtSql\/QSqlError>\n\nnamespace Marble {\n\nOsmDatabase::OsmDatabase()\n{\n m_database = QSqlDatabase::addDatabase( \"QSQLITE\" );\n}\n\nvoid OsmDatabase::addFile( const QString &fileName )\n{\n m_databases << fileName;\n}\n\nQList<OsmPlacemark> OsmDatabase::find( MarbleModel* model, const QString &searchTerm )\n{\n if ( m_databases.isEmpty() ) {\n return QList<OsmPlacemark>();\n }\n\n DatabaseQuery userQuery( model, searchTerm );\n\n QList<OsmPlacemark> result;\n QTime timer;\n timer.start();\n foreach( const QString &databaseFile, m_databases ) {\n m_database.setDatabaseName( databaseFile );\n if ( !m_database.open() ) {\n mDebug() << \"Failed to connect to database \" << databaseFile;\n }\n\n QString regionRestriction;\n if ( !userQuery.region().isEmpty() ) {\n \/\/ Nested set model to support region hierarchies, see http:\/\/en.wikipedia.org\/wiki\/Nested_set_model\n QSqlQuery regionsQuery( \"SELECT lft, rgt FROM regions WHERE name LIKE '%\" + userQuery.region() + \"%';\" );\n if ( regionsQuery.lastError().isValid() ) {\n mDebug() << \"Error when executing query\" << regionsQuery.executedQuery();\n mDebug() << \"Sql reports\" << regionsQuery.lastError();\n }\n regionRestriction = \" AND (\";\n bool first = true;\n while ( regionsQuery.next() ) {\n if ( first ) {\n first = false;\n } else {\n regionRestriction += \" OR \";\n }\n regionRestriction += \" (regions.lft >= \" + regionsQuery.value( 0 ).toString();\n regionRestriction += \" AND regions.lft <= \" + regionsQuery.value( 1 ).toString() + \")\";\n }\n regionRestriction += \")\";\n\n if ( first ) {\n continue;\n }\n }\n\n QString queryString;\n\n queryString = \" SELECT regions.name,\"\n \" places.name, places.number,\"\n \" places.category, places.lon, places.lat\"\n \" FROM regions, places\";\n\n if ( userQuery.queryType() == DatabaseQuery::CategorySearch ) {\n queryString += \" WHERE regions.id = places.region AND places.category = %1\";\n queryString = queryString.arg( (qint32) userQuery.category() );\n if ( userQuery.resultFormat() == DatabaseQuery::DistanceFormat && userQuery.region().isEmpty() ) {\n queryString += \" ORDER BY ((places.lat-%1)*(places.lat-%1)+(places.lon-%2)*(places.lon-%2))\";\n GeoDataCoordinates position = userQuery.position();\n queryString = queryString.arg( position.latitude( GeoDataCoordinates::Degree ), 0, 'f', 8 )\n .arg( position.longitude( GeoDataCoordinates::Degree ), 0, 'f', 8 );\n } else {\n queryString += regionRestriction;\n }\n } else if ( userQuery.queryType() == DatabaseQuery::BroadSearch ) {\n queryString += \" WHERE regions.id = places.region\"\n \" AND places.name \" + wildcardQuery( searchTerm );\n } else {\n queryString += \" WHERE regions.id = places.region\"\n \" AND places.name \" + wildcardQuery( userQuery.street() );\n if ( !userQuery.houseNumber().isEmpty() ) {\n queryString += \" AND places.number \" + wildcardQuery( userQuery.houseNumber() );\n } else {\n queryString += \"AND places.number IS NULL\";\n }\n queryString += regionRestriction;\n }\n\n queryString += \" LIMIT 50;\";\n\n \/** @todo: sort\/filter results from several databases *\/\n\n QSqlQuery query;\n query.setForwardOnly( true );\n if ( !query.exec( queryString ) ) {\n mDebug() << \"Failed to execute query\" << query.lastError();\n return result;\n }\n\n while ( query.next() ) {\n OsmPlacemark placemark;\n if ( userQuery.resultFormat() == DatabaseQuery::DistanceFormat ) {\n GeoDataCoordinates coordinates( query.value(4).toFloat(), query.value(5).toFloat(), 0.0, GeoDataCoordinates::Degree );\n placemark.setAdditionalInformation( formatDistance( coordinates, userQuery.position() ) );\n } else {\n placemark.setAdditionalInformation( query.value( 0 ).toString() );\n }\n placemark.setName( query.value(1).toString() );\n placemark.setHouseNumber( query.value(2).toString() );\n placemark.setCategory( (OsmPlacemark::OsmCategory) query.value(3).toInt() );\n placemark.setLongitude( query.value(4).toFloat() );\n placemark.setLatitude( query.value(5).toFloat() );\n result.push_back( placemark );\n }\n\n \/\/ mDebug() << \"Query string: \" << queryString;\n }\n\n mDebug() << \"Offline OSM search query took \" << timer.elapsed() << \" ms.\";\n return result;\n}\n\nQString OsmDatabase::formatDistance( const GeoDataCoordinates &a, const GeoDataCoordinates &b ) const\n{\n qreal distance = EARTH_RADIUS * distanceSphere( a, b);\n\n int precision = 0;\n QString distanceUnit = \"m\";\n\n if ( MarbleGlobal::getInstance()->locale()->distanceUnit() == Marble::MilesFeet ) {\n precision = 1;\n distanceUnit = \"mi\";\n distance *= METER2KM;\n distance *= KM2MI;\n } else {\n if ( distance >= 1000 ) {\n distance \/= 1000;\n distanceUnit = \"km\";\n precision = 1;\n } else if ( distance >= 200 ) {\n distance = 50 * qRound( distance \/ 50 );\n } else if ( distance >= 100 ) {\n distance = 25 * qRound( distance \/ 25 );\n } else {\n distance = 10 * qRound( distance \/ 10 );\n }\n }\n\n QString const fuzzyDistance = QString( \"%1 %2\" ).arg( distance, 0, 'f', precision ).arg( distanceUnit );\n\n int direction = 180 + bearing( a, b ) * RAD2DEG;\n\n QString heading = QObject::tr( \"north\" );\n if ( direction > 337 ) {\n heading = QObject::tr( \"north\" );\n } else if ( direction > 292 ) {\n heading = QObject::tr( \"north-west\" );\n } else if ( direction > 247 ) {\n heading = QObject::tr( \"west\" );\n } else if ( direction > 202 ) {\n heading = QObject::tr( \"south-west\" );\n } else if ( direction > 157 ) {\n heading = QObject::tr( \"south\" );\n } else if ( direction > 112 ) {\n heading = QObject::tr( \"south-east\" );\n } else if ( direction > 67 ) {\n heading = QObject::tr( \"east\" );\n } else if ( direction > 22 ) {\n heading = QObject::tr( \"north-east\" );\n }\n\n return fuzzyDistance + \" \" + heading;\n}\n\nqreal OsmDatabase::bearing( const GeoDataCoordinates &a, const GeoDataCoordinates &b ) const\n{\n qreal delta = b.longitude() - a.longitude();\n qreal lat1 = a.latitude();\n qreal lat2 = b.latitude();\n return fmod( atan2( sin ( delta ) * cos ( lat2 ),\n cos( lat1 ) * sin( lat2 ) - sin( lat1 ) * cos( lat2 ) * cos ( delta ) ), 2 * M_PI );\n}\n\nQString OsmDatabase::wildcardQuery( const QString &term ) const\n{\n QString result = term;\n if ( term.contains( '*' ) ) {\n return \" LIKE '\" + result.replace( '*', '%' ) + \"'\";\n } else {\n return \" = '\" + result + \"'\";\n }\n}\n\n}\n<|endoftext|>"} {"text":"<commit_before>\/*\n * Moon++ Scripts for Ascent MMORPG Server\n * Copyright (C) 2005-2007 Ascent Team <http:\/\/www.ascentemu.com\/>\n * Copyright (C) 2007-2008 Moon++ Team <http:\/\/www.moonplusplus.info\/>\n *\n * This program is free software: you can redistribute it and\/or modify\n * it under the terms of the GNU General Public License as published by\n * the Free Software Foundation, either version 3 of the License, or\n * any later version.\n *\n * This program is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the\n * GNU General Public License for more details.\n *\n * You should have received a copy of the GNU General Public License\n * along with this program. If not, see <http:\/\/www.gnu.org\/licenses\/>.\n *\/\n\n#include \"Setup.h\"\n\n\/\/ Event of Hallowen control\n\/\/#define EVENT_HALLOWEEN\t\t\/\/ Decomment this for enable the event on Innkeepers\n\n#define SPELL_TRICK_OR_TREATED 24755\n#define SPELL_TREAT 24715\n\/\/ -------------------------\n\nclass InnkeeperGossip : public Arcemu::Gossip::Script\n{\n\tpublic:\n\t\tvoid OnHello(Object* pObject, Player* Plr);\n\t\tvoid OnSelectOption(Object* pObject, Player* Plr, uint32 Id, const char* Code);\n\t\tvoid Destroy() { delete this; }\n};\n\nvoid InnkeeperGossip::OnHello(Object* pObject, Player* Plr)\n{\n\tCreature* pCreature = (pObject->IsCreature()) ? (TO_CREATURE(pObject)) : NULL;\n\tif(pCreature == NULL)\n\t\treturn;\n\tuint32 TextID = 820;\n\tuint32 Text = objmgr.GetGossipTextForNpc(pCreature->GetEntry());\n\tif(Text != 0)\n\t{\n\t\tGossipText* text = NpcTextStorage.LookupEntry(Text);\n\t\tif(text != 0)\n\t\t\tTextID = Text;\n\t}\n\tArcemu::Gossip::Menu menu(pCreature->GetGUID(), TextID, 0);\n\n#ifdef\tEVENT_HALLOWEEN\n\tif(!Plr->HasAura(SPELL_TRICK_OR_TREATED))\n\t\tmenu.AddItem(Arcemu::Gossip::ICON_CHAT, \"Trick or Treat!\", 4);\n#endif\n\n\tif(pCreature->isVendor())\n\t\tmenu.AddItem(Arcemu::Gossip::ICON_VENDOR, \"I would like to browse your goods.\", 1);\n\n\tmenu.AddItem(Arcemu::Gossip::ICON_CHAT, \"Make this inn your home.\", 2);\n\tmenu.AddItem(Arcemu::Gossip::ICON_CHAT, \"What can I do at an inn?\", 3);\n\n\tsQuestMgr.FillQuestMenu(pCreature, Plr, menu);\n\n\tmenu.Send(Plr);\n}\n\n\/\/#define SendQuickMenu(textid) objmgr.CreateGossipMenuForPlayer(&Menu, pCreature->GetGUID(), textid, Plr); \\\n\/\/ Menu->SendTo(Plr);\n\nvoid InnkeeperGossip::OnSelectOption(Object* pObject, Player* Plr, uint32 Id, const char* Code)\n{\n\tCreature* pCreature = (pObject->IsCreature()) ? (TO_CREATURE(pObject)) : NULL;\n\tif(pCreature == NULL)\n\t\treturn;\n\n\tswitch(Id)\n\t{\n\t\tcase 1: \/\/ VENDOR\n\t\t\tPlr->GetSession()->SendInventoryList(pCreature);\n\t\t\tbreak;\n\t\tcase 2: \/\/ BINDER\n\t\t\tPlr->GetSession()->SendInnkeeperBind(pCreature);\n\t\t\tbreak;\n\t\tcase 3: \/\/ WHAT CAN I DO ?\n\t\t\t\/\/ Prepare second menu\n\t\t\tArcemu::Gossip::Menu::SendQuickMenu(pCreature->GetGUID(), 1853, Plr, 2, Arcemu::Gossip::ICON_CHAT, \"Make this inn your home.\");\n\t\t\tbreak;\n\t\tcase 4: \/\/ EVENT OF HALLOWEEN\n\t\t\tif(!Plr->HasAura(SPELL_TRICK_OR_TREATED))\n\t\t\t{\n\t\t\t\tpCreature->CastSpell(Plr, SPELL_TRICK_OR_TREATED, true);\n\n\t\t\t\t\/\/ either trick or treat, 50% chance\n\t\t\t\tif(rand() % 2)\n\t\t\t\t{\n\t\t\t\t\tPlr->CastSpell(Plr, SPELL_TREAT, true);\n\t\t\t\t}\n\t\t\t\telse\n\t\t\t\t{\n\t\t\t\t\tint32 trickspell = 0;\n\t\t\t\t\tswitch(rand() % 9)\n\t\t\t\t\t{\n\t\t\t\t\t\tcase 0:\n\t\t\t\t\t\t\ttrickspell = 24753; \/\/ cannot cast, random 30sec\n\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\tcase 1:\n\t\t\t\t\t\t\ttrickspell = 24713; \/\/ lepper gnome costume\n\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\tcase 2:\n\t\t\t\t\t\t\tif(Plr->getGender() == 0)\n\t\t\t\t\t\t\t{\n\t\t\t\t\t\t\t\ttrickspell = 24735; \/\/ male ghost costume\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\ttrickspell = 24736; \/\/ female ghostcostume\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\tcase 3:\n\t\t\t\t\t\t\tif(Plr->getGender() == 0)\n\t\t\t\t\t\t\t{\n\t\t\t\t\t\t\t\ttrickspell = 24711; \/\/ male ninja costume\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\ttrickspell = 24710; \/\/ female ninja costume\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\tcase 4:\n\t\t\t\t\t\t\tif(Plr->getGender() == 0)\n\t\t\t\t\t\t\t{\n\t\t\t\t\t\t\t\ttrickspell = 24708; \/\/ male pirate costume\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\ttrickspell = 24709; \/\/ female pirate costume\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\tcase 5:\n\t\t\t\t\t\t\ttrickspell = 24723; \/\/ skeleton costume\n\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t}\n\t\t\t\t\tpCreature->CastSpell(Plr, trickspell, true);\n\t\t\t\t}\n\t\t\t}\n\t\t\tArcemu::Gossip::Menu::Complete(Plr);\n\t\t\tbreak;\n\t}\n}\n\nvoid SetupInnkeepers(ScriptMgr* mgr)\n{\n\tArcemu::Gossip::Script* gs = new InnkeeperGossip();\n\t\/* Innkeeper List *\/\n\tmgr->register_creature_gossip(15174, gs); \/\/Calandrath\n\tmgr->register_creature_gossip(18251, gs); \/\/Caregiver Abidaar\n\tmgr->register_creature_gossip(16739, gs); \/\/Caregiver Breel\n\tmgr->register_creature_gossip(16553, gs); \/\/Caregiver Chellan\n\tmgr->register_creature_gossip(18914, gs); \/\/Caregiver Isel\n\tmgr->register_creature_gossip(18906, gs); \/\/Caregiver Ophera Windfury\n\tmgr->register_creature_gossip(17553, gs); \/\/Caregiver Topher Loaal\n\tmgr->register_creature_gossip(21746, gs); \/\/Caretaker Aluuro\n\tmgr->register_creature_gossip(19352, gs); \/\/Dreg Cloudsweeper\n\tmgr->register_creature_gossip(19531, gs); \/\/Eyonix\n\tmgr->register_creature_gossip(21110, gs); \/\/Fizit \"Doc\" Clocktock\n\tmgr->register_creature_gossip(16602, gs); \/\/Floyd Pinkus\n\tmgr->register_creature_gossip(19470, gs); \/\/Gholah\n\tmgr->register_creature_gossip(23143, gs); \/\/Horus\n\tmgr->register_creature_gossip(11116, gs); \/\/Innkeeper Abeqwa\n\tmgr->register_creature_gossip(9501, gs); \/\/Innkeeper Adegwa\n\tmgr->register_creature_gossip(22922, gs); \/\/Innkeeper Aelerya\n\tmgr->register_creature_gossip(6740, gs); \/\/Innkeeper Allison\n\tmgr->register_creature_gossip(2352, gs); \/\/Innkeeper Anderson\n\tmgr->register_creature_gossip(6739, gs); \/\/Innkeeper Bates\n\tmgr->register_creature_gossip(18905, gs); \/\/Innkeeper Bazil Olof'tazun\n\tmgr->register_creature_gossip(1247, gs); \/\/Innkeeper Belm\n\tmgr->register_creature_gossip(19296, gs); \/\/Innkeeper Biribi\n\tmgr->register_creature_gossip(3934, gs); \/\/Innkeeper Boorand Plainswind\n\tmgr->register_creature_gossip(6727, gs); \/\/Innkeeper Brianna\n\tmgr->register_creature_gossip(7714, gs); \/\/Innkeeper Byula\n\tmgr->register_creature_gossip(18907, gs); \/\/Innkeeper Coryth Stoktron\n\tmgr->register_creature_gossip(19319, gs); \/\/Innkeeper Darg Bloodclaw\n\tmgr->register_creature_gossip(15433, gs); \/\/Innkeeper Delaniel\n\tmgr->register_creature_gossip(16458, gs); \/\/Innkeeper Faralia\n\tmgr->register_creature_gossip(295, gs); \/\/Innkeeper Farley\n\tmgr->register_creature_gossip(5111, gs); \/\/Innkeeper Firebrew\n\tmgr->register_creature_gossip(7733, gs); \/\/Innkeeper Fizzgrimble\n\tmgr->register_creature_gossip(7737, gs); \/\/Innkeeper Greul\n\tmgr->register_creature_gossip(18957, gs); \/\/Innkeeper Grilka\n\tmgr->register_creature_gossip(6928, gs); \/\/Innkeeper Grosk\n\tmgr->register_creature_gossip(6929, gs); \/\/Innkeeper Gryshka\n\tmgr->register_creature_gossip(19232, gs); \/\/Innkeeper Haelthol\n\tmgr->register_creature_gossip(6734, gs); \/\/Innkeeper Hearthstove\n\tmgr->register_creature_gossip(8931, gs); \/\/Innkeeper Heather\n\tmgr->register_creature_gossip(1464, gs); \/\/Innkeeper Helbrek\n\tmgr->register_creature_gossip(6272, gs); \/\/Innkeeper Janene\n\tmgr->register_creature_gossip(7731, gs); \/\/Innkeeper Jayka\n\tmgr->register_creature_gossip(17630, gs); \/\/Innkeeper Jovia\n\tmgr->register_creature_gossip(16542, gs); \/\/Innkeeper Kalarin\n\tmgr->register_creature_gossip(6930, gs); \/\/Innkeeper Karakul\n\tmgr->register_creature_gossip(6747, gs); \/\/Innkeeper Kauth\n\tmgr->register_creature_gossip(12196, gs); \/\/Innkeeper Kaylisk\n\tmgr->register_creature_gossip(6736, gs); \/\/Innkeeper Keldamyr\n\tmgr->register_creature_gossip(18908, gs); \/\/Innkeeper Kerp\n\tmgr->register_creature_gossip(6738, gs); \/\/Innkeeper Kimlya\n\tmgr->register_creature_gossip(11103, gs); \/\/Innkeeper Lyshaerya\n\tmgr->register_creature_gossip(6741, gs); \/\/Innkeeper Norman\n\tmgr->register_creature_gossip(6746, gs); \/\/Innkeeper Pala\n\tmgr->register_creature_gossip(19571, gs); \/\/Innkeeper Remi Dodoso\n\tmgr->register_creature_gossip(5688, gs); \/\/Innkeeper Renee\n\tmgr->register_creature_gossip(6735, gs); \/\/Innkeeper Saelienne\n\tmgr->register_creature_gossip(19495, gs); \/\/Innkeeper Shaunessy\n\tmgr->register_creature_gossip(6737, gs); \/\/Innkeeper Shaussiy\n\tmgr->register_creature_gossip(2388, gs); \/\/Innkeeper Shay\n\tmgr->register_creature_gossip(9356, gs); \/\/Innkeeper Shul'kar\n\tmgr->register_creature_gossip(7736, gs); \/\/Innkeeper Shyria\n\tmgr->register_creature_gossip(11106, gs); \/\/Innkeeper Sikewa\n\tmgr->register_creature_gossip(6807, gs); \/\/Innkeeper Skindle\n\tmgr->register_creature_gossip(5814, gs); \/\/Innkeeper Thulbek\n\tmgr->register_creature_gossip(7744, gs); \/\/Innkeeper Thulfram\n\tmgr->register_creature_gossip(6790, gs); \/\/Innkeeper Trelayne\n\tmgr->register_creature_gossip(16618, gs); \/\/Innkeeper Velandra\n\tmgr->register_creature_gossip(11118, gs); \/\/Innkeeper Vizzie\n\tmgr->register_creature_gossip(6791, gs); \/\/Innkeeper Wiley\n\tmgr->register_creature_gossip(16256, gs); \/\/Jessica Chambers\n\tmgr->register_creature_gossip(14731, gs); \/\/Lard\n\tmgr->register_creature_gossip(15397, gs); \/\/Marniel Amberlight\n\tmgr->register_creature_gossip(18913, gs); \/\/Matron Tikkit\n\tmgr->register_creature_gossip(21088, gs); \/\/Matron Varah\n\tmgr->register_creature_gossip(6778, gs); \/\/Melika Isenstrider\n\tmgr->register_creature_gossip(18245, gs); \/\/Merajit\n\tmgr->register_creature_gossip(19046, gs); \/\/Minalei\n\tmgr->register_creature_gossip(21744, gs); \/\/Roldemar\n\tmgr->register_creature_gossip(16826, gs); \/\/Sid Limbardi\n\tmgr->register_creature_gossip(6806, gs); \/\/Tannok Frosthammer\n\tmgr->register_creature_gossip(25036, gs); \/\/Caregiver Inaara\n\n\t\/\/cleanup:\n\t\/\/added 36 new Innkeeper's ,81 working innkeeper's now :P\n\t\/\/removed Innkeeper Monica(she dos not have gossip option she is from Old Hillsbrad Foothills)\n}\n<commit_msg>FIXED: Localization support for some world strings in Innkeeper gossips.<commit_after>\/*\n * Moon++ Scripts for Ascent MMORPG Server\n * Copyright (C) 2005-2007 Ascent Team <http:\/\/www.ascentemu.com\/>\n * Copyright (C) 2007-2008 Moon++ Team <http:\/\/www.moonplusplus.info\/>\n *\n * This program is free software: you can redistribute it and\/or modify\n * it under the terms of the GNU General Public License as published by\n * the Free Software Foundation, either version 3 of the License, or\n * any later version.\n *\n * This program is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the\n * GNU General Public License for more details.\n *\n * You should have received a copy of the GNU General Public License\n * along with this program. If not, see <http:\/\/www.gnu.org\/licenses\/>.\n *\/\n\n#include \"Setup.h\"\n\n\/\/ Event of Hallowen control\n\/\/#define EVENT_HALLOWEEN\t\t\/\/ Decomment this for enable the event on Innkeepers\n\n#define SPELL_TRICK_OR_TREATED 24755\n#define SPELL_TREAT 24715\n\/\/ -------------------------\n\nclass InnkeeperGossip : public Arcemu::Gossip::Script\n{\n\tpublic:\n\t\tvoid OnHello(Object* pObject, Player* Plr);\n\t\tvoid OnSelectOption(Object* pObject, Player* Plr, uint32 Id, const char* Code);\n\t\tvoid Destroy() { delete this; }\n};\n\nvoid InnkeeperGossip::OnHello(Object* pObject, Player* Plr)\n{\n\tCreature* pCreature = (pObject->IsCreature()) ? (TO_CREATURE(pObject)) : NULL;\n\tif(pCreature == NULL)\n\t\treturn;\n\tuint32 TextID = 820;\n\tuint32 Text = objmgr.GetGossipTextForNpc(pCreature->GetEntry());\n\tif(Text != 0)\n\t{\n\t\tGossipText* text = NpcTextStorage.LookupEntry(Text);\n\t\tif(text != 0)\n\t\t\tTextID = Text;\n\t}\n\tArcemu::Gossip::Menu menu(pCreature->GetGUID(), TextID, 0);\n\n#ifdef\tEVENT_HALLOWEEN\n\tif(!Plr->HasAura(SPELL_TRICK_OR_TREATED))\n\t\tmenu.AddItem(Arcemu::Gossip::ICON_CHAT, \"Trick or Treat!\", 4);\n#endif\n\n\tif(pCreature->isVendor())\n\t\tmenu.AddItem(Arcemu::Gossip::ICON_VENDOR, Plr->GetSession()->LocalizedWorldSrv(Arcemu::Gossip::VENDOR), 1);\n\n\tmenu.AddItem(Arcemu::Gossip::ICON_CHAT, Plr->GetSession()->LocalizedWorldSrv(Arcemu::Gossip::INNKEEPER), 2);\n\tmenu.AddItem(Arcemu::Gossip::ICON_CHAT, \"What can I do at an inn?\", 3);\n\n\tsQuestMgr.FillQuestMenu(pCreature, Plr, menu);\n\n\tmenu.Send(Plr);\n}\n\n\/\/#define SendQuickMenu(textid) objmgr.CreateGossipMenuForPlayer(&Menu, pCreature->GetGUID(), textid, Plr); \\\n\/\/ Menu->SendTo(Plr);\n\nvoid InnkeeperGossip::OnSelectOption(Object* pObject, Player* Plr, uint32 Id, const char* Code)\n{\n\tCreature* pCreature = (pObject->IsCreature()) ? (TO_CREATURE(pObject)) : NULL;\n\tif(pCreature == NULL)\n\t\treturn;\n\n\tswitch(Id)\n\t{\n\t\tcase 1: \/\/ VENDOR\n\t\t\tPlr->GetSession()->SendInventoryList(pCreature);\n\t\t\tbreak;\n\t\tcase 2: \/\/ BINDER\n\t\t\tPlr->GetSession()->SendInnkeeperBind(pCreature);\n\t\t\tbreak;\n\t\tcase 3: \/\/ WHAT CAN I DO ?\n\t\t\t\/\/ Prepare second menu\n\t\t\tArcemu::Gossip::Menu::SendQuickMenu(pCreature->GetGUID(), 1853, Plr, 2, Arcemu::Gossip::ICON_CHAT, Plr->GetSession()->LocalizedWorldSrv(Arcemu::Gossip::INNKEEPER));\n\t\t\tbreak;\n\t\tcase 4: \/\/ EVENT OF HALLOWEEN\n\t\t\tif(!Plr->HasAura(SPELL_TRICK_OR_TREATED))\n\t\t\t{\n\t\t\t\tpCreature->CastSpell(Plr, SPELL_TRICK_OR_TREATED, true);\n\n\t\t\t\t\/\/ either trick or treat, 50% chance\n\t\t\t\tif(rand() % 2)\n\t\t\t\t{\n\t\t\t\t\tPlr->CastSpell(Plr, SPELL_TREAT, true);\n\t\t\t\t}\n\t\t\t\telse\n\t\t\t\t{\n\t\t\t\t\tint32 trickspell = 0;\n\t\t\t\t\tswitch(rand() % 9)\n\t\t\t\t\t{\n\t\t\t\t\t\tcase 0:\n\t\t\t\t\t\t\ttrickspell = 24753; \/\/ cannot cast, random 30sec\n\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\tcase 1:\n\t\t\t\t\t\t\ttrickspell = 24713; \/\/ lepper gnome costume\n\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\tcase 2:\n\t\t\t\t\t\t\tif(Plr->getGender() == 0)\n\t\t\t\t\t\t\t{\n\t\t\t\t\t\t\t\ttrickspell = 24735; \/\/ male ghost costume\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\ttrickspell = 24736; \/\/ female ghostcostume\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\tcase 3:\n\t\t\t\t\t\t\tif(Plr->getGender() == 0)\n\t\t\t\t\t\t\t{\n\t\t\t\t\t\t\t\ttrickspell = 24711; \/\/ male ninja costume\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\ttrickspell = 24710; \/\/ female ninja costume\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\tcase 4:\n\t\t\t\t\t\t\tif(Plr->getGender() == 0)\n\t\t\t\t\t\t\t{\n\t\t\t\t\t\t\t\ttrickspell = 24708; \/\/ male pirate costume\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\ttrickspell = 24709; \/\/ female pirate costume\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\tcase 5:\n\t\t\t\t\t\t\ttrickspell = 24723; \/\/ skeleton costume\n\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t}\n\t\t\t\t\tpCreature->CastSpell(Plr, trickspell, true);\n\t\t\t\t}\n\t\t\t}\n\t\t\tArcemu::Gossip::Menu::Complete(Plr);\n\t\t\tbreak;\n\t}\n}\n\nvoid SetupInnkeepers(ScriptMgr* mgr)\n{\n\tArcemu::Gossip::Script* gs = new InnkeeperGossip();\n\t\/* Innkeeper List *\/\n\tmgr->register_creature_gossip(15174, gs); \/\/Calandrath\n\tmgr->register_creature_gossip(18251, gs); \/\/Caregiver Abidaar\n\tmgr->register_creature_gossip(16739, gs); \/\/Caregiver Breel\n\tmgr->register_creature_gossip(16553, gs); \/\/Caregiver Chellan\n\tmgr->register_creature_gossip(18914, gs); \/\/Caregiver Isel\n\tmgr->register_creature_gossip(18906, gs); \/\/Caregiver Ophera Windfury\n\tmgr->register_creature_gossip(17553, gs); \/\/Caregiver Topher Loaal\n\tmgr->register_creature_gossip(21746, gs); \/\/Caretaker Aluuro\n\tmgr->register_creature_gossip(19352, gs); \/\/Dreg Cloudsweeper\n\tmgr->register_creature_gossip(19531, gs); \/\/Eyonix\n\tmgr->register_creature_gossip(21110, gs); \/\/Fizit \"Doc\" Clocktock\n\tmgr->register_creature_gossip(16602, gs); \/\/Floyd Pinkus\n\tmgr->register_creature_gossip(19470, gs); \/\/Gholah\n\tmgr->register_creature_gossip(23143, gs); \/\/Horus\n\tmgr->register_creature_gossip(11116, gs); \/\/Innkeeper Abeqwa\n\tmgr->register_creature_gossip(9501, gs); \/\/Innkeeper Adegwa\n\tmgr->register_creature_gossip(22922, gs); \/\/Innkeeper Aelerya\n\tmgr->register_creature_gossip(6740, gs); \/\/Innkeeper Allison\n\tmgr->register_creature_gossip(2352, gs); \/\/Innkeeper Anderson\n\tmgr->register_creature_gossip(6739, gs); \/\/Innkeeper Bates\n\tmgr->register_creature_gossip(18905, gs); \/\/Innkeeper Bazil Olof'tazun\n\tmgr->register_creature_gossip(1247, gs); \/\/Innkeeper Belm\n\tmgr->register_creature_gossip(19296, gs); \/\/Innkeeper Biribi\n\tmgr->register_creature_gossip(3934, gs); \/\/Innkeeper Boorand Plainswind\n\tmgr->register_creature_gossip(6727, gs); \/\/Innkeeper Brianna\n\tmgr->register_creature_gossip(7714, gs); \/\/Innkeeper Byula\n\tmgr->register_creature_gossip(18907, gs); \/\/Innkeeper Coryth Stoktron\n\tmgr->register_creature_gossip(19319, gs); \/\/Innkeeper Darg Bloodclaw\n\tmgr->register_creature_gossip(15433, gs); \/\/Innkeeper Delaniel\n\tmgr->register_creature_gossip(16458, gs); \/\/Innkeeper Faralia\n\tmgr->register_creature_gossip(295, gs); \/\/Innkeeper Farley\n\tmgr->register_creature_gossip(5111, gs); \/\/Innkeeper Firebrew\n\tmgr->register_creature_gossip(7733, gs); \/\/Innkeeper Fizzgrimble\n\tmgr->register_creature_gossip(7737, gs); \/\/Innkeeper Greul\n\tmgr->register_creature_gossip(18957, gs); \/\/Innkeeper Grilka\n\tmgr->register_creature_gossip(6928, gs); \/\/Innkeeper Grosk\n\tmgr->register_creature_gossip(6929, gs); \/\/Innkeeper Gryshka\n\tmgr->register_creature_gossip(19232, gs); \/\/Innkeeper Haelthol\n\tmgr->register_creature_gossip(6734, gs); \/\/Innkeeper Hearthstove\n\tmgr->register_creature_gossip(8931, gs); \/\/Innkeeper Heather\n\tmgr->register_creature_gossip(1464, gs); \/\/Innkeeper Helbrek\n\tmgr->register_creature_gossip(6272, gs); \/\/Innkeeper Janene\n\tmgr->register_creature_gossip(7731, gs); \/\/Innkeeper Jayka\n\tmgr->register_creature_gossip(17630, gs); \/\/Innkeeper Jovia\n\tmgr->register_creature_gossip(16542, gs); \/\/Innkeeper Kalarin\n\tmgr->register_creature_gossip(6930, gs); \/\/Innkeeper Karakul\n\tmgr->register_creature_gossip(6747, gs); \/\/Innkeeper Kauth\n\tmgr->register_creature_gossip(12196, gs); \/\/Innkeeper Kaylisk\n\tmgr->register_creature_gossip(6736, gs); \/\/Innkeeper Keldamyr\n\tmgr->register_creature_gossip(18908, gs); \/\/Innkeeper Kerp\n\tmgr->register_creature_gossip(6738, gs); \/\/Innkeeper Kimlya\n\tmgr->register_creature_gossip(11103, gs); \/\/Innkeeper Lyshaerya\n\tmgr->register_creature_gossip(6741, gs); \/\/Innkeeper Norman\n\tmgr->register_creature_gossip(6746, gs); \/\/Innkeeper Pala\n\tmgr->register_creature_gossip(19571, gs); \/\/Innkeeper Remi Dodoso\n\tmgr->register_creature_gossip(5688, gs); \/\/Innkeeper Renee\n\tmgr->register_creature_gossip(6735, gs); \/\/Innkeeper Saelienne\n\tmgr->register_creature_gossip(19495, gs); \/\/Innkeeper Shaunessy\n\tmgr->register_creature_gossip(6737, gs); \/\/Innkeeper Shaussiy\n\tmgr->register_creature_gossip(2388, gs); \/\/Innkeeper Shay\n\tmgr->register_creature_gossip(9356, gs); \/\/Innkeeper Shul'kar\n\tmgr->register_creature_gossip(7736, gs); \/\/Innkeeper Shyria\n\tmgr->register_creature_gossip(11106, gs); \/\/Innkeeper Sikewa\n\tmgr->register_creature_gossip(6807, gs); \/\/Innkeeper Skindle\n\tmgr->register_creature_gossip(5814, gs); \/\/Innkeeper Thulbek\n\tmgr->register_creature_gossip(7744, gs); \/\/Innkeeper Thulfram\n\tmgr->register_creature_gossip(6790, gs); \/\/Innkeeper Trelayne\n\tmgr->register_creature_gossip(16618, gs); \/\/Innkeeper Velandra\n\tmgr->register_creature_gossip(11118, gs); \/\/Innkeeper Vizzie\n\tmgr->register_creature_gossip(6791, gs); \/\/Innkeeper Wiley\n\tmgr->register_creature_gossip(16256, gs); \/\/Jessica Chambers\n\tmgr->register_creature_gossip(14731, gs); \/\/Lard\n\tmgr->register_creature_gossip(15397, gs); \/\/Marniel Amberlight\n\tmgr->register_creature_gossip(18913, gs); \/\/Matron Tikkit\n\tmgr->register_creature_gossip(21088, gs); \/\/Matron Varah\n\tmgr->register_creature_gossip(6778, gs); \/\/Melika Isenstrider\n\tmgr->register_creature_gossip(18245, gs); \/\/Merajit\n\tmgr->register_creature_gossip(19046, gs); \/\/Minalei\n\tmgr->register_creature_gossip(21744, gs); \/\/Roldemar\n\tmgr->register_creature_gossip(16826, gs); \/\/Sid Limbardi\n\tmgr->register_creature_gossip(6806, gs); \/\/Tannok Frosthammer\n\tmgr->register_creature_gossip(25036, gs); \/\/Caregiver Inaara\n\n\t\/\/cleanup:\n\t\/\/added 36 new Innkeeper's ,81 working innkeeper's now :P\n\t\/\/removed Innkeeper Monica(she dos not have gossip option she is from Old Hillsbrad Foothills)\n}\n<|endoftext|>"} {"text":"<commit_before>#include <gtest\/gtest.h>\n#include <stan\/optimization\/bfgs_linesearch.hpp>\n#include <stan\/math\/matrix\/Eigen.hpp>\n\nTEST(OptimizationBfgsLinesearch, CubicInterp) {\n using stan::optimization::CubicInterp;\n static const unsigned int nVals = 5;\n static const double xVals[5] = { -2.0, -1.0, 0.0, 1.0, 2.0 };\n double xMin;\n\n for (unsigned int i = 0; i < nVals; i++) {\n const double &x0 = xVals[i];\n const double f0 = x0*x0*x0\/3.0 - x0;\n const double df0 = x0*x0 - 1.0;\n for (unsigned int j = 0; j < nVals; j++) {\n if (i == j)\n continue;\n\n const double &x1 = xVals[j];\n const double f1 = x1*x1*x1\/3.0 - x1;\n const double df1 = x1*x1 - 1.0;\n\n xMin = CubicInterp(x0,f0,df0,x1,f1,df1,-3.0,2.0);\n EXPECT_NEAR(-3.0,xMin,1e-8);\n\n xMin = CubicInterp(x0,f0,df0,x1,f1,df1,-3.0,0.0);\n EXPECT_NEAR(-3.0,xMin,1e-8);\n\n xMin = CubicInterp(x0,f0,df0,x1,f1,df1,-1.0,2.0);\n EXPECT_NEAR(1.0,xMin,1e-8);\n\n xMin = CubicInterp(x0,f0,df0,x1,f1,df1,0.0,2.0);\n EXPECT_NEAR(1.0,xMin,1e-8);\n\n xMin = CubicInterp(x0,f0,df0,x1,f1,df1,0.5,1.5);\n EXPECT_NEAR(1.0,xMin,1e-8);\n }\n }\n}\n\nTEST(OptimizationBfgsLinesearch, CubicInterp_6arg) {\n FAIL() \n << \"add tests for the 6 argument version of CubicInterp()\";\n}\n\nclass linesearch_testfunc {\npublic:\n double operator()(const Eigen::Matrix<double,Eigen::Dynamic,1> &x) {\n return x.dot(x) - 1.0;\n } \n int operator()(const Eigen::Matrix<double,Eigen::Dynamic,1> &x, \n double &f, Eigen::Matrix<double,Eigen::Dynamic,1> &g) {\n f = x.dot(x) - 1.0;\n g = 2.0*x;\n return 0;\n }\n};\n\nTEST(OptimizationBfgsLinesearch, WolfLSZoom) {\n FAIL()\n << \"add tests for WolfLSZoom()\";\n}\n\n\nTEST(OptimizationBfgsLinesearch, wolfeLineSearch) {\n using stan::optimization::WolfeLineSearch;\n\n static const double c1 = 1e-4;\n static const double c2 = 0.9;\n static const double minAlpha = 1e-16;\n\n linesearch_testfunc func1;\n Eigen::Matrix<double,-1,1> x0,x1;\n double f0,f1;\n Eigen::Matrix<double,-1,1> p, gradx0,gradx1;\n double alpha;\n int ret;\n\n x0.setOnes(5,1);\n func1(x0,f0,gradx0);\n\n p = -gradx0;\n\n alpha = 2.0;\n ret = WolfeLineSearch(func1, alpha,\n x1, f1, gradx1,\n p, x0, f0, gradx0,\n c1, c2, minAlpha);\n EXPECT_EQ(0,ret);\n EXPECT_NEAR(0.5,alpha,1e-8);\n EXPECT_NEAR(0,(x1 - (x0 + alpha*p)).norm(),1e-8);\n EXPECT_EQ(f1,func1(x1));\n EXPECT_LE(f1,f0 + c1*alpha*p.dot(gradx0));\n EXPECT_LE(std::fabs(p.dot(gradx1)),c2*std::fabs(p.dot(gradx0)));\n\n alpha = 10.0;\n ret = WolfeLineSearch(func1, alpha,\n x1, f1, gradx1,\n p, x0, f0, gradx0,\n c1, c2, minAlpha);\n EXPECT_EQ(0,ret);\n EXPECT_NEAR(0.5,alpha,1e-8);\n EXPECT_NEAR(0,(x1 - (x0 + alpha*p)).norm(),1e-8);\n EXPECT_EQ(f1,func1(x1));\n EXPECT_LE(f1,f0 + c1*alpha*p.dot(gradx0));\n EXPECT_LE(std::fabs(p.dot(gradx1)),c2*std::fabs(p.dot(gradx0)));\n\n alpha = 0.25;\n ret = WolfeLineSearch(func1, alpha,\n x1, f1, gradx1,\n p, x0, f0, gradx0,\n c1, c2, minAlpha);\n EXPECT_EQ(0,ret);\n EXPECT_NEAR(0.25,alpha,1e-8);\n EXPECT_NEAR(0,(x1 - (x0 + alpha*p)).norm(),1e-8);\n EXPECT_EQ(f1,func1(x1));\n EXPECT_LE(f1,f0 + c1*alpha*p.dot(gradx0));\n EXPECT_LE(std::fabs(p.dot(gradx1)),c2*std::fabs(p.dot(gradx0)));\n}\n<commit_msg>added bfgs_linesearch tests<commit_after>#include <gtest\/gtest.h>\n#include <stan\/optimization\/bfgs_linesearch.hpp>\n#include <stan\/math\/matrix\/Eigen.hpp>\n\nTEST(OptimizationBfgsLinesearch, CubicInterp) {\n using stan::optimization::CubicInterp;\n static const unsigned int nVals = 5;\n static const double xVals[5] = { -2.0, -1.0, 0.0, 1.0, 2.0 };\n double xMin;\n\n for (unsigned int i = 0; i < nVals; i++) {\n const double &x0 = xVals[i];\n const double f0 = x0*x0*x0\/3.0 - x0;\n const double df0 = x0*x0 - 1.0;\n for (unsigned int j = 0; j < nVals; j++) {\n if (i == j)\n continue;\n\n const double &x1 = xVals[j];\n const double f1 = x1*x1*x1\/3.0 - x1;\n const double df1 = x1*x1 - 1.0;\n\n xMin = CubicInterp(x0,f0,df0,x1,f1,df1,-3.0,2.0);\n EXPECT_NEAR(-3.0,xMin,1e-8);\n\n xMin = CubicInterp(x0,f0,df0,x1,f1,df1,-3.0,0.0);\n EXPECT_NEAR(-3.0,xMin,1e-8);\n\n xMin = CubicInterp(x0,f0,df0,x1,f1,df1,-1.0,2.0);\n EXPECT_NEAR(1.0,xMin,1e-8);\n\n xMin = CubicInterp(x0,f0,df0,x1,f1,df1,0.0,2.0);\n EXPECT_NEAR(1.0,xMin,1e-8);\n\n xMin = CubicInterp(x0,f0,df0,x1,f1,df1,0.5,1.5);\n EXPECT_NEAR(1.0,xMin,1e-8);\n }\n }\n}\n\nTEST(OptimizationBfgsLinesearch, CubicInterp_6arg) {\n using stan::optimization::CubicInterp;\n static const unsigned int nVals = 5;\n static const double xVals[5] = { -2.0, -1.0, 0.0, 1.0, 2.0 };\n double x;\n\n for (unsigned int i = 0; i < nVals; i++) {\n const double &x0 = xVals[i];\n const double f0 = x0*x0*x0\/3.0 - x0;\n const double df0 = x0*x0 - 1.0;\n for (unsigned int j = 0; j < nVals; j++) {\n if (i == j)\n continue;\n\n const double &x1 = xVals[j];\n const double f1 = x1*x1*x1\/3.0 - x1;\n const double df1 = x1*x1 - 1.0;\n\n x = CubicInterp(df0,x1-x0,f1-f0,df1,-3.0-x0,2.0-x0);\n EXPECT_NEAR(-3.0,x0+x,1e-8);\n\n x = CubicInterp(df0,x1-x0,f1-f0,df1,-3.0-x0,0.0-x0);\n EXPECT_NEAR(-3.0,x0+x,1e-8);\n\n x = CubicInterp(df0,x1-x0,f1-f0,df1,-1.0-x0,2.0-x0);\n EXPECT_NEAR(1.0,x0+x,1e-8);\n\n x = CubicInterp(df0,x1-x0,f1-f0,df1,0.0-x0,2.0-x0);\n EXPECT_NEAR(1.0,x0+x,1e-8);\n\n x = CubicInterp(df0,x1-x0,f1-f0,df1,0.5-x0,1.5-x0);\n EXPECT_NEAR(1.0,x0+x,1e-8);\n }\n }\n}\n\nclass linesearch_testfunc {\npublic:\n double operator()(const Eigen::Matrix<double,Eigen::Dynamic,1> &x) {\n return x.dot(x) - 1.0;\n } \n int operator()(const Eigen::Matrix<double,Eigen::Dynamic,1> &x, \n double &f, Eigen::Matrix<double,Eigen::Dynamic,1> &g) {\n f = x.dot(x) - 1.0;\n g = 2.0*x;\n return 0;\n }\n};\n\nTEST(OptimizationBfgsLinesearch, WolfLSZoom) {\n using stan::optimization::WolfLSZoom;\n\n static const double c1 = 1e-4;\n static const double c2 = 0.9;\n static const double minAlpha = 1e-16;\n\n linesearch_testfunc func1;\n Eigen::Matrix<double,-1,1> x0,x1;\n double f0,f1;\n Eigen::Matrix<double,-1,1> p, gradx0,gradx1;\n double alpha;\n int ret;\n\n x0.setOnes(5,1);\n p = -gradx0;\n\n func1(x0,f0,gradx0);\n\n p = -gradx0;\n\n double dfp = gradx0.dot(p);\n alpha = 2.0;\n x1 = x0 + alpha*p;\n func1(x1,f1,gradx1);\n\n double dfp2 = gradx1.dot(p);\n\n ret = WolfLSZoom(alpha, x1, f1, gradx1,\n func1, x0, f0, dfp,\n c1*dfp, c2*dfp, p,\n minAlpha, f0, dfp,\n alpha, f1, dfp2, 1e-16);\n EXPECT_EQ(0,ret);\n EXPECT_NEAR(0.5,alpha,1e-8);\n EXPECT_NEAR(0,(x1 - (x0 + alpha*p)).norm(),1e-8);\n EXPECT_EQ(f1,func1(x1));\n EXPECT_LE(f1,f0 + c1*alpha*p.dot(gradx0));\n EXPECT_LE(std::fabs(p.dot(gradx1)),c2*std::fabs(p.dot(gradx0)));\n\n alpha = 10.0;\n x1 = x0 + alpha*p;\n func1(x1,f1,gradx1);\n\n dfp2 = gradx1.dot(p);\n\n ret = WolfLSZoom(alpha, x1, f1, gradx1,\n func1, x0, f0, dfp,\n c1*dfp, c2*dfp, p,\n minAlpha, f0, dfp,\n alpha, f1, dfp2, 1e-16);\n\n EXPECT_EQ(0,ret);\n EXPECT_NEAR(0.5,alpha,1e-8);\n EXPECT_NEAR(0,(x1 - (x0 + alpha*p)).norm(),1e-8);\n EXPECT_EQ(f1,func1(x1));\n EXPECT_LE(f1,f0 + c1*alpha*p.dot(gradx0));\n EXPECT_LE(std::fabs(p.dot(gradx1)),c2*std::fabs(p.dot(gradx0)));\n}\n\n\nTEST(OptimizationBfgsLinesearch, wolfeLineSearch) {\n using stan::optimization::WolfeLineSearch;\n\n static const double c1 = 1e-4;\n static const double c2 = 0.9;\n static const double minAlpha = 1e-16;\n\n linesearch_testfunc func1;\n Eigen::Matrix<double,-1,1> x0,x1;\n double f0,f1;\n Eigen::Matrix<double,-1,1> p, gradx0,gradx1;\n double alpha;\n int ret;\n\n x0.setOnes(5,1);\n func1(x0,f0,gradx0);\n\n p = -gradx0;\n\n alpha = 2.0;\n ret = WolfeLineSearch(func1, alpha,\n x1, f1, gradx1,\n p, x0, f0, gradx0,\n c1, c2, minAlpha);\n EXPECT_EQ(0,ret);\n EXPECT_NEAR(0.5,alpha,1e-8);\n EXPECT_NEAR(0,(x1 - (x0 + alpha*p)).norm(),1e-8);\n EXPECT_EQ(f1,func1(x1));\n EXPECT_LE(f1,f0 + c1*alpha*p.dot(gradx0));\n EXPECT_LE(std::fabs(p.dot(gradx1)),c2*std::fabs(p.dot(gradx0)));\n\n alpha = 10.0;\n ret = WolfeLineSearch(func1, alpha,\n x1, f1, gradx1,\n p, x0, f0, gradx0,\n c1, c2, minAlpha);\n EXPECT_EQ(0,ret);\n EXPECT_NEAR(0.5,alpha,1e-8);\n EXPECT_NEAR(0,(x1 - (x0 + alpha*p)).norm(),1e-8);\n EXPECT_EQ(f1,func1(x1));\n EXPECT_LE(f1,f0 + c1*alpha*p.dot(gradx0));\n EXPECT_LE(std::fabs(p.dot(gradx1)),c2*std::fabs(p.dot(gradx0)));\n\n alpha = 0.25;\n ret = WolfeLineSearch(func1, alpha,\n x1, f1, gradx1,\n p, x0, f0, gradx0,\n c1, c2, minAlpha);\n EXPECT_EQ(0,ret);\n EXPECT_NEAR(0.25,alpha,1e-8);\n EXPECT_NEAR(0,(x1 - (x0 + alpha*p)).norm(),1e-8);\n EXPECT_EQ(f1,func1(x1));\n EXPECT_LE(f1,f0 + c1*alpha*p.dot(gradx0));\n EXPECT_LE(std::fabs(p.dot(gradx1)),c2*std::fabs(p.dot(gradx0)));\n}\n<|endoftext|>"} {"text":"<commit_before>\/*\n * Copyright 2004 The Apache Software Foundation.\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * imitations under the License.\n *\/\n\n\/*\n * XSEC\n *\n * XSECSOAPRequestorSimple := (Very) Basic implementation of a SOAP\n * HTTP wrapper for testing the client code.\n *\n *\n * $Id$\n *\n *\/\n\n#include <stdio.h>\n#include <stdlib.h>\n#include <string.h>\n\n#include <unistd.h>\n#include <sys\/types.h>\n#include <sys\/socket.h>\n#include <netinet\/in.h>\n#include <arpa\/inet.h>\n#include <netdb.h>\n#include <errno.h>\n\n#include <xsec\/utils\/XSECSOAPRequestorSimple.hpp>\n#include <xsec\/framework\/XSECError.hpp>\n\n#include <xercesc\/dom\/DOM.hpp>\n#include <xercesc\/util\/XMLNetAccessor.hpp>\n#include <xercesc\/util\/XMLString.hpp>\n#include <xercesc\/util\/XMLExceptMsgs.hpp>\n#include <xercesc\/util\/Janitor.hpp>\n#include <xercesc\/util\/XMLUniDefs.hpp>\n\nXERCES_CPP_NAMESPACE_USE\n\n\/\/ --------------------------------------------------------------------------------\n\/\/ Platform specific constructor\n\/\/ --------------------------------------------------------------------------------\n\n\nXSECSOAPRequestorSimple::XSECSOAPRequestorSimple(const XMLCh * uri) : m_uri(uri) {\n\n\n}\n\n\/\/ --------------------------------------------------------------------------------\n\/\/ Interface\n\/\/ --------------------------------------------------------------------------------\n\n\nDOMDocument * XSECSOAPRequestorSimple::doRequest(DOMDocument * request) {\n\n\n\tchar * content = wrapAndSerialise(request);\n\n\t\/\/ First we need to serialise\n\n char fBuffer[4000];\n char * fBufferEnd;\n char * fBufferPos;\n\n \/\/\n \/\/ Pull all of the parts of the URL out of th m_uri object, and transcode them\n \/\/ and transcode them back to ASCII.\n \/\/\n const XMLCh* hostName = m_uri.getHost();\n char* hostNameAsCharStar = XMLString::transcode(hostName);\n ArrayJanitor<char> janBuf1(hostNameAsCharStar);\n\n const XMLCh* path = m_uri.getPath();\n char* pathAsCharStar = XMLString::transcode(path);\n ArrayJanitor<char> janBuf2(pathAsCharStar);\n\n const XMLCh* fragment = m_uri.getFragment();\n char* fragmentAsCharStar = 0;\n if (fragment)\n fragmentAsCharStar = XMLString::transcode(fragment);\n ArrayJanitor<char> janBuf3(fragmentAsCharStar);\n\n const XMLCh* query = m_uri.getQueryString();\n char* queryAsCharStar = 0;\n if (query)\n queryAsCharStar = XMLString::transcode(query);\n ArrayJanitor<char> janBuf4(queryAsCharStar);\t\t\n\n unsigned short portNumber = (unsigned short) m_uri.getPort();\n\n\t\/\/ If no number is set, go with port 80\n\tif (portNumber == USHRT_MAX)\n\t\tportNumber = 80;\n\n \/\/\n \/\/ Set up a socket.\n \/\/\n struct hostent* hostEntPtr = 0;\n struct sockaddr_in sa;\n\n\n if ((hostEntPtr = gethostbyname(hostNameAsCharStar)) == NULL)\n {\n unsigned long numAddress = inet_addr(hostNameAsCharStar);\n if (numAddress == 0)\n {\n ThrowXML(NetAccessorException,\n XMLExcepts::NetAcc_TargetResolution);\n }\n if ((hostEntPtr =\n gethostbyaddr((char *) &numAddress,\n sizeof(unsigned long), AF_INET)) == NULL)\n {\n ThrowXML(NetAccessorException,\n XMLExcepts::NetAcc_TargetResolution);\n }\n }\n\n memcpy((void *) &sa.sin_addr,\n (const void *) hostEntPtr->h_addr, hostEntPtr->h_length);\n sa.sin_family = hostEntPtr->h_addrtype;\n sa.sin_port = htons(portNumber);\n\n int s = socket(hostEntPtr->h_addrtype, SOCK_STREAM, 0);\n if (s < 0)\n {\n throw XSECException(XSECException::HTTPURIInputStreamError,\n\t\t\t\t\t\t\t\"Error creating socket\");\n\n }\n\n if (connect(s, (struct sockaddr *) &sa, sizeof(sa)) < 0)\n {\n throw XSECException(XSECException::HTTPURIInputStreamError,\n\t\t\t\t\t\t\t\"Error connecting to end server\");\n }\n\n \/\/ The port is open and ready to go.\n \/\/ Build up the http GET command to send to the server.\n \/\/ To do: We should really support http 1.1. This implementation\n \/\/ is weak.\n\n memset(fBuffer, 0, sizeof(fBuffer));\n\n strcpy(fBuffer, \"POST \");\n strcat(fBuffer, pathAsCharStar);\n\n if (queryAsCharStar != 0)\n {\n \/\/ Tack on a ? before the fragment\n strcat(fBuffer,\"?\");\n strcat(fBuffer, queryAsCharStar);\n }\n\n if (fragmentAsCharStar != 0)\n {\n strcat(fBuffer, fragmentAsCharStar);\n }\n strcat(fBuffer, \" HTTP\/1.0\\r\\n\");\n\n\tstrcat(fBuffer, \"Content-Type: text\/xml; charset=utf-8\\r\\n\");\n\n\n strcat(fBuffer, \"Host: \");\n strcat(fBuffer, hostNameAsCharStar);\n if (portNumber != 80)\n {\n int i = strlen(fBuffer);\n\t\tsprintf(fBuffer+i, \":%d\", portNumber);\n }\n\tstrcat(fBuffer, \"\\r\\n\");\n\n\tstrcat(fBuffer, \"Content-Length: \");\n int i = (int) strlen(fBuffer);\n\tsprintf(fBuffer+i, \"%d\", strlen(content));\n\tstrcat(fBuffer, \"\\r\\n\");\n\tstrcat(fBuffer, \"SOAPAction: \\\"\\\"\\r\\n\");\n\n\/*\tstrcat(fBuffer, \"Connection: Close\\r\\n\");\n\tstrcat(fBuffer, \"Cache-Control: no-cache\\r\\n\");*\/\n strcat(fBuffer, \"\\r\\n\");\n\n\t\/\/ Now the content\n\tstrcat(fBuffer, content);\n\n \/\/ Send the http request\n int lent = strlen(fBuffer);\n int aLent = 0;\n if ((aLent = write(s, (void *) fBuffer, lent)) != lent)\n {\n throw XSECException(XSECException::HTTPURIInputStreamError,\n\t\t\t\t\t\t\t\"Error writing to socket\");\n }\n\n \/\/\n \/\/ get the response, check the http header for errors from the server.\n \/\/\n aLent = read(s, (void *)fBuffer, sizeof(fBuffer)-1);\n\t\/***\/\n\tfBuffer[aLent] = '\\0';\n\tprintf(fBuffer);\n\t\/***\/\n if (aLent <= 0)\n {\n throw XSECException(XSECException::HTTPURIInputStreamError,\n\t\t\t\t\t\t\t\"Error reported reading socket\");\n }\n\n fBufferEnd = fBuffer+aLent;\n *fBufferEnd = 0;\n\n \/\/ Find the break between the returned http header and any data.\n \/\/ (Delimited by a blank line)\n \/\/ Hang on to any data for use by the first read from this BinHTTPURLInputStream.\n \/\/\n fBufferPos = strstr(fBuffer, \"\\r\\n\\r\\n\");\n if (fBufferPos != 0)\n {\n fBufferPos += 4;\n *(fBufferPos-2) = 0;\n }\n else\n {\n fBufferPos = strstr(fBuffer, \"\\n\\n\");\n if (fBufferPos != 0)\n {\n fBufferPos += 2;\n *(fBufferPos-1) = 0;\n }\n else\n fBufferPos = fBufferEnd;\n }\n\n \/\/ Make sure the header includes an HTTP 200 OK response.\n \/\/\n char *p = strstr(fBuffer, \"HTTP\");\n if (p == 0)\n {\n throw XSECException(XSECException::HTTPURIInputStreamError,\n\t\t\t\t\t\t\t\"Error reported reading socket\");\n }\n\n p = strchr(p, ' ');\n if (p == 0)\n {\n throw XSECException(XSECException::HTTPURIInputStreamError,\n\t\t\t\t\t\t\t\"Error reported reading socket\");\n }\n\n int httpResponse = atoi(p);\n\n\tif (httpResponse == 302 || httpResponse == 301) {\n\t\t\/\/Once grows, should use a switch\n\t\tchar redirectBuf[256];\n\t\tint q;\n\n\t\t\/\/ Find the \"Location:\" string\n\t\tp = strstr(p, \"Location:\");\n\t\tif (p == 0)\n {\n\t\t\tthrow XSECException(XSECException::HTTPURIInputStreamError,\n\t\t\t\t\t\t\t\"Error reported reading socket\");\n\t\t}\n\t\tp = strchr(p, ' ');\n\t\tif (p == 0)\n\t\t{\n\t\t\tthrow XSECException(XSECException::HTTPURIInputStreamError,\n\t\t\t\t\t\t\t\"Error reported reading socket\");\n\t\t}\n\n\t\t\/\/ Now read \n\t\tp++;\n\t\tfor (q=0; q < 255 && p[q] != '\\r' && p[q] !='\\n'; ++q)\n\t\t\tredirectBuf[q] = p[q];\n\n\t\tredirectBuf[q] = '\\0';\n\t\t\n\t\t\/\/ Try to find this location\n\t\tm_uri = XMLUri(XMLString::transcode(redirectBuf));\n\n\t\treturn doRequest(request);\n\n\n\t}\n\n else if (httpResponse != 200)\n {\n \/\/ Most likely a 404 Not Found error.\n \/\/ Should recognize and handle the forwarding responses.\n \/\/\n\t\tthrow XSECException(XSECException::HTTPURIInputStreamError,\n\t\t\t\t\t\t\"Unknown HTTP Response\");\n }\n\t\/*\n\twhile (aLent != 0) {\n\t\taLent = read(s, (void *)fBuffer, sizeof(fBuffer)-1);\n\t\t\n\t\tfBuffer[aLent] = '\\0';\n\t\tprintf(fBuffer);\n\t\t\n\t}\n*\/\n\t\/* Now find out how long the return is *\/\n\n\tp = strstr(fBuffer, \"Content-Length:\");\n\tif (p == NULL) {\n throw XSECException(XSECException::HTTPURIInputStreamError,\n\t\t\t\t\t\t\t\"Content-Length required in SOAP HTTP Response\");\n\t}\n\n\tp = strchr(p, ' ');\n\tp++;\n\n\tint responseLength = atoi(p);\n\n\tchar * responseBuffer;\n\tXSECnew(responseBuffer, char[responseLength]);\n\tArrayJanitor<char> j_responseBuffer(responseBuffer);\n\n\tlent = fBufferEnd - fBufferPos;\n\tmemcpy(responseBuffer, fBufferPos, lent);\n\twhile (lent < responseLength) {\n\t aLent = read(s, &responseBuffer[lent], responseLength - lent);\n\t\tlent += aLent;\n\t}\n\t\n return parseAndUnwrap(responseBuffer, responseLength);\n\n}\n\n\n<commit_msg>Cleaned up Unix simple SOAP client<commit_after>\/*\n * Copyright 2004 The Apache Software Foundation.\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * imitations under the License.\n *\/\n\n\/*\n * XSEC\n *\n * XSECSOAPRequestorSimple := (Very) Basic implementation of a SOAP\n * HTTP wrapper for testing the client code.\n *\n *\n * $Id$\n *\n *\/\n\n#include <stdio.h>\n#include <stdlib.h>\n#include <string.h>\n\n#include <unistd.h>\n#include <sys\/types.h>\n#include <sys\/socket.h>\n#include <netinet\/in.h>\n#include <arpa\/inet.h>\n#include <netdb.h>\n#include <errno.h>\n\n#include <xsec\/utils\/XSECSOAPRequestorSimple.hpp>\n#include <xsec\/framework\/XSECError.hpp>\n\n#include <xercesc\/dom\/DOM.hpp>\n#include <xercesc\/util\/XMLNetAccessor.hpp>\n#include <xercesc\/util\/XMLString.hpp>\n#include <xercesc\/util\/XMLExceptMsgs.hpp>\n#include <xercesc\/util\/Janitor.hpp>\n#include <xercesc\/util\/XMLUniDefs.hpp>\n\nXERCES_CPP_NAMESPACE_USE\n\n\/\/ --------------------------------------------------------------------------------\n\/\/ Platform specific constructor\n\/\/ --------------------------------------------------------------------------------\n\n\nXSECSOAPRequestorSimple::XSECSOAPRequestorSimple(const XMLCh * uri) : m_uri(uri) {\n\n\n}\n\n\/\/ --------------------------------------------------------------------------------\n\/\/ Interface\n\/\/ --------------------------------------------------------------------------------\n\n\nDOMDocument * XSECSOAPRequestorSimple::doRequest(DOMDocument * request) {\n\n\n\tchar * content = wrapAndSerialise(request);\n\n\t\/\/ First we need to serialise\n\n char fBuffer[4000];\n char * fBufferEnd;\n char * fBufferPos;\n\n \/\/\n \/\/ Pull all of the parts of the URL out of th m_uri object, and transcode them\n \/\/ and transcode them back to ASCII.\n \/\/\n const XMLCh* hostName = m_uri.getHost();\n char* hostNameAsCharStar = XMLString::transcode(hostName);\n ArrayJanitor<char> janBuf1(hostNameAsCharStar);\n\n const XMLCh* path = m_uri.getPath();\n char* pathAsCharStar = XMLString::transcode(path);\n ArrayJanitor<char> janBuf2(pathAsCharStar);\n\n const XMLCh* fragment = m_uri.getFragment();\n char* fragmentAsCharStar = 0;\n if (fragment)\n fragmentAsCharStar = XMLString::transcode(fragment);\n ArrayJanitor<char> janBuf3(fragmentAsCharStar);\n\n const XMLCh* query = m_uri.getQueryString();\n char* queryAsCharStar = 0;\n if (query)\n queryAsCharStar = XMLString::transcode(query);\n ArrayJanitor<char> janBuf4(queryAsCharStar);\t\t\n\n unsigned short portNumber = (unsigned short) m_uri.getPort();\n\n\t\/\/ If no number is set, go with port 80\n\tif (portNumber == USHRT_MAX)\n\t\tportNumber = 80;\n\n \/\/\n \/\/ Set up a socket.\n \/\/\n struct hostent* hostEntPtr = 0;\n struct sockaddr_in sa;\n\n\n if ((hostEntPtr = gethostbyname(hostNameAsCharStar)) == NULL)\n {\n unsigned long numAddress = inet_addr(hostNameAsCharStar);\n if (numAddress == 0)\n {\n ThrowXML(NetAccessorException,\n XMLExcepts::NetAcc_TargetResolution);\n }\n if ((hostEntPtr =\n gethostbyaddr((char *) &numAddress,\n sizeof(unsigned long), AF_INET)) == NULL)\n {\n ThrowXML(NetAccessorException,\n XMLExcepts::NetAcc_TargetResolution);\n }\n }\n\n memcpy((void *) &sa.sin_addr,\n (const void *) hostEntPtr->h_addr, hostEntPtr->h_length);\n sa.sin_family = hostEntPtr->h_addrtype;\n sa.sin_port = htons(portNumber);\n\n int s = socket(hostEntPtr->h_addrtype, SOCK_STREAM, 0);\n if (s < 0)\n {\n throw XSECException(XSECException::HTTPURIInputStreamError,\n\t\t\t\t\t\t\t\"Error creating socket\");\n\n }\n\n if (connect(s, (struct sockaddr *) &sa, sizeof(sa)) < 0)\n {\n throw XSECException(XSECException::HTTPURIInputStreamError,\n\t\t\t\t\t\t\t\"Error connecting to end server\");\n }\n\n \/\/ The port is open and ready to go.\n \/\/ Build up the http GET command to send to the server.\n \/\/ To do: We should really support http 1.1. This implementation\n \/\/ is weak.\n\n memset(fBuffer, 0, sizeof(fBuffer));\n\n strcpy(fBuffer, \"POST \");\n strcat(fBuffer, pathAsCharStar);\n\n if (queryAsCharStar != 0)\n {\n \/\/ Tack on a ? before the fragment\n strcat(fBuffer,\"?\");\n strcat(fBuffer, queryAsCharStar);\n }\n\n if (fragmentAsCharStar != 0)\n {\n strcat(fBuffer, fragmentAsCharStar);\n }\n strcat(fBuffer, \" HTTP\/1.0\\r\\n\");\n\n\tstrcat(fBuffer, \"Content-Type: text\/xml; charset=utf-8\\r\\n\");\n\n\n strcat(fBuffer, \"Host: \");\n strcat(fBuffer, hostNameAsCharStar);\n if (portNumber != 80)\n {\n int i = strlen(fBuffer);\n\t\tsprintf(fBuffer+i, \":%d\", portNumber);\n }\n\tstrcat(fBuffer, \"\\r\\n\");\n\n\tstrcat(fBuffer, \"Content-Length: \");\n int i = (int) strlen(fBuffer);\n\tsprintf(fBuffer+i, \"%d\", strlen(content));\n\tstrcat(fBuffer, \"\\r\\n\");\n\tstrcat(fBuffer, \"SOAPAction: \\\"\\\"\\r\\n\");\n\n\/*\tstrcat(fBuffer, \"Connection: Close\\r\\n\");\n\tstrcat(fBuffer, \"Cache-Control: no-cache\\r\\n\");*\/\n strcat(fBuffer, \"\\r\\n\");\n\n\t\/\/ Now the content\n\tstrcat(fBuffer, content);\n\n \/\/ Send the http request\n int lent = strlen(fBuffer);\n int aLent = 0;\n if ((aLent = write(s, (void *) fBuffer, lent)) != lent)\n {\n throw XSECException(XSECException::HTTPURIInputStreamError,\n\t\t\t\t\t\t\t\"Error writing to socket\");\n }\n\n \/\/\n \/\/ get the response, check the http header for errors from the server.\n \/\/\n aLent = read(s, (void *)fBuffer, sizeof(fBuffer)-1);\n\t\/*\n\tfBuffer[aLent] = '\\0';\n\tprintf(fBuffer);\n\t*\/\n if (aLent <= 0)\n {\n throw XSECException(XSECException::HTTPURIInputStreamError,\n\t\t\t\t\t\t\t\"Error reported reading socket\");\n }\n\n fBufferEnd = fBuffer+aLent;\n *fBufferEnd = 0;\n\n \/\/ Find the break between the returned http header and any data.\n \/\/ (Delimited by a blank line)\n \/\/ Hang on to any data for use by the first read from this BinHTTPURLInputStream.\n \/\/\n fBufferPos = strstr(fBuffer, \"\\r\\n\\r\\n\");\n if (fBufferPos != 0)\n {\n fBufferPos += 4;\n *(fBufferPos-2) = 0;\n }\n else\n {\n fBufferPos = strstr(fBuffer, \"\\n\\n\");\n if (fBufferPos != 0)\n {\n fBufferPos += 2;\n *(fBufferPos-1) = 0;\n }\n else\n fBufferPos = fBufferEnd;\n }\n\n \/\/ Make sure the header includes an HTTP 200 OK response.\n \/\/\n char *p = strstr(fBuffer, \"HTTP\");\n if (p == 0)\n {\n throw XSECException(XSECException::HTTPURIInputStreamError,\n\t\t\t\t\t\t\t\"Error reported reading socket\");\n }\n\n p = strchr(p, ' ');\n if (p == 0)\n {\n throw XSECException(XSECException::HTTPURIInputStreamError,\n\t\t\t\t\t\t\t\"Error reported reading socket\");\n }\n\n int httpResponse = atoi(p);\n\n\tif (httpResponse == 302 || httpResponse == 301) {\n\t\t\/\/Once grows, should use a switch\n\t\tchar redirectBuf[256];\n\t\tint q;\n\n\t\t\/\/ Find the \"Location:\" string\n\t\tp = strstr(p, \"Location:\");\n\t\tif (p == 0)\n {\n\t\t\tthrow XSECException(XSECException::HTTPURIInputStreamError,\n\t\t\t\t\t\t\t\"Error reported reading socket\");\n\t\t}\n\t\tp = strchr(p, ' ');\n\t\tif (p == 0)\n\t\t{\n\t\t\tthrow XSECException(XSECException::HTTPURIInputStreamError,\n\t\t\t\t\t\t\t\"Error reported reading socket\");\n\t\t}\n\n\t\t\/\/ Now read \n\t\tp++;\n\t\tfor (q=0; q < 255 && p[q] != '\\r' && p[q] !='\\n'; ++q)\n\t\t\tredirectBuf[q] = p[q];\n\n\t\tredirectBuf[q] = '\\0';\n\t\t\n\t\t\/\/ Try to find this location\n\t\tm_uri = XMLUri(XMLString::transcode(redirectBuf));\n\n\t\treturn doRequest(request);\n\n\n\t}\n\n else if (httpResponse != 200)\n {\n \/\/ Most likely a 404 Not Found error.\n \/\/ Should recognize and handle the forwarding responses.\n \/\/\n\t\tthrow XSECException(XSECException::HTTPURIInputStreamError,\n\t\t\t\t\t\t\"Unknown HTTP Response\");\n }\n\n\t\/* Now find out how long the return is *\/\n\n\tp = strstr(fBuffer, \"Content-Length:\");\n\tif (p == NULL) {\n throw XSECException(XSECException::HTTPURIInputStreamError,\n\t\t\t\t\t\t\t\"Content-Length required in SOAP HTTP Response\");\n\t}\n\n\tp = strchr(p, ' ');\n\tp++;\n\n\tint responseLength = atoi(p);\n\n\tchar * responseBuffer;\n\tXSECnew(responseBuffer, char[responseLength]);\n\tArrayJanitor<char> j_responseBuffer(responseBuffer);\n\n\tlent = fBufferEnd - fBufferPos;\n\tmemcpy(responseBuffer, fBufferPos, lent);\n\twhile (lent < responseLength) {\n\t aLent = read(s, &responseBuffer[lent], responseLength - lent);\n\t\tlent += aLent;\n\t}\n\t\n return parseAndUnwrap(responseBuffer, responseLength);\n\n}\n\n\n<|endoftext|>"} {"text":"<commit_before>#include <stdio.h>\n#include <cmath>\n#include <boost\/shared_ptr.hpp>\n#include <lcm\/lcm-cpp.hpp>\n#include \"lcmtypes\/drc_lcmtypes.hpp\"\n#include <ConciseArgs>\n#include <string>\n#include <cstring>\n#include <fstream>\n#include \"CImg.h\"\nusing namespace cimg_library;\n\nusing namespace std;\n#include <path_util\/path_util.h>\n\nclass App{\n public:\n App(boost::shared_ptr<lcm::LCM> &lcm_, bool is_left);\n \n ~App(){\n }\n \n \n private:\n boost::shared_ptr<lcm::LCM> lcm_;\n bool is_left;\n string handtext; \/\/ Put RIGHT \/ LEFT\n static const int TACTILE_THRESHOLD = 3000;\n static const int NTACTILE = 32;\n void sandiaTactileStateHandler(const lcm::ReceiveBuffer* rbuf, \n const std::string& channel, const drc::hand_tactile_state_t* msg); \n \n void readCfg(const std::string& path_cfg);\n void getHeatColor(const float v, unsigned char color [3]);\n CImg<unsigned char> orig_img;\n CImg<unsigned char> disp_img;\n CImgDisplay main_disp;\n int img_x[NTACTILE], img_y[NTACTILE];\n}; \n\nApp::App(boost::shared_ptr<lcm::LCM> &lcm_, bool is_left):\n lcm_(lcm_), is_left(is_left){\n cout << \"enter APP()\" << endl;\n \n lcm_->subscribe(is_left ? \"SANDIA_LEFT_TACTILE_STATE\":\"SANDIA_RIGHT_TACTILE_STATE\", \n &App::sandiaTactileStateHandler, this); \n \n\n std::string cfg_path = std::string(getConfigPath()) +\"\/subsystems\/sandia_hands\/\";\n string path_img, path_cfg;\n string filename = \"sandia_hand_r\";\n path_img = cfg_path + filename + \".jpg\";\n path_cfg = cfg_path + filename + \".cfg\";\n \n readCfg(path_cfg);\n \n orig_img.load(path_img.c_str());\n \n disp_img = orig_img;\n main_disp.display(disp_img);\n main_disp.resize(orig_img.width()\/2, orig_img.height()\/2);\n cout << \"leave APP()\" << endl;\n}\n\nvoid App::readCfg(const std::string& path_cfg){\n \/\/649 1194 # hand origin on img\n \/\/8.17647058824 # 556\/68 px over real metric\n int hand_orig_x, hand_orig_y;\n float pixel_over_real;\n string garbage;\n ifstream fin(path_cfg.c_str());\n if(!fin)\n cout << \"open filepath \" << path_cfg << \" fail\" << endl;\n fin >> hand_orig_x >> hand_orig_y;\n getline(fin, garbage);\n fin >> pixel_over_real;\n getline(fin, garbage);\n for(int i=0;i<NTACTILE;i++){\n int id; float rx, ry, rz;\n fin >> id >> rx >> ry >> rz; \n img_x[i] = rx*pixel_over_real + hand_orig_x;\n img_y[i] = -ry*pixel_over_real + hand_orig_y;\n cout << i << \" \" << img_x[i] << \" \" << img_y[i] << endl;\n }\n fin.close();\n}\n\nvoid App::getHeatColor(const float v, unsigned char color [3]){\n \/\/ v: [0~1)\n \/\/ color: RGB (0,0,0)~(255,255,255)\n if(v < 0.5){\n color[0] = (unsigned char)0;\n color[1] = (unsigned char)(2*256*v);\n color[2] = (unsigned char)(255-2*256*v);\n }\n else{\n color[0] = (unsigned char)(2*256*(v-0.5));\n color[1] = (unsigned char)(255-2*256*(v-0.5));\n color[2] = (unsigned char)(0);\n }\n}\n\nvoid App::sandiaTactileStateHandler(const lcm::ReceiveBuffer* rbuf, \n const std::string& channel, const drc::hand_tactile_state_t* msg){\n \n \/\/ Draw hand img\n unsigned char color[3];\n \n disp_img = orig_img;\n for(size_t i=0;i<NTACTILE;i++){\n float v = (float)msg->palm[i] \/ 65536.0 * 2.5;\n if(v<0) v = 0;\n else if(v>=1) v=1-1e-8;\n getHeatColor(v, color);\n \/\/cout << color[0] << \" \" << color[1] << \" \" << color[2] <<endl;\n \/\/cout << i <<\" \" << img_x[i] << \" \" << img_y[i] <<endl;\n disp_img.draw_circle(img_x[i], img_y[i], \/*int radius*\/ 20, color);\n }\n main_disp.display(disp_img);\n \/\/main_disp.wait();\n \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n \n \n}\n \nint main(int argc, char *argv[]){\n bool lhand=false, rhand=false;\n ConciseArgs opt(argc, (char**)argv);\n opt.add(rhand, \"r\", \"right\",\"Process right hand message\");\n opt.add(lhand, \"l\", \"left\",\"Process left hand message\");\n \n opt.parse();\n if(rhand && lhand){\n printf(\"Only one hand at a time.\\n\");\n return 1;\n }\n if(!rhand && !lhand){\n printf(\"Please specify a hand. Type -h for usage.\\n\");\n return 1;\n }\n \n boost::shared_ptr<lcm::LCM> lcm(new lcm::LCM() );\n if(!lcm->good())\n return 1; \n \n App app(lcm, lhand);\n while(0 == lcm->handle());\n return 0;\n}\n<commit_msg>Inculde left hand config files in tactile viz<commit_after>#include <stdio.h>\n#include <cmath>\n#include <boost\/shared_ptr.hpp>\n#include <lcm\/lcm-cpp.hpp>\n#include \"lcmtypes\/drc_lcmtypes.hpp\"\n#include <ConciseArgs>\n#include <string>\n#include <cstring>\n#include <fstream>\n#include \"CImg.h\"\nusing namespace cimg_library;\n\nusing namespace std;\n#include <path_util\/path_util.h>\n\nclass App{\n public:\n App(boost::shared_ptr<lcm::LCM> &lcm_, bool is_left);\n \n ~App(){\n }\n \n \n private:\n boost::shared_ptr<lcm::LCM> lcm_;\n bool is_left;\n string handtext; \/\/ Put RIGHT \/ LEFT\n static const int TACTILE_THRESHOLD = 3000;\n static const int NTACTILE = 32;\n void sandiaTactileStateHandler(const lcm::ReceiveBuffer* rbuf, \n const std::string& channel, const drc::hand_tactile_state_t* msg); \n \n void readCfg(const std::string& path_cfg);\n void getHeatColor(const float v, unsigned char color [3]);\n CImg<unsigned char> orig_img;\n CImg<unsigned char> disp_img;\n CImgDisplay main_disp;\n int img_x[NTACTILE], img_y[NTACTILE];\n}; \n\nApp::App(boost::shared_ptr<lcm::LCM> &lcm_, bool is_left):\n lcm_(lcm_), is_left(is_left){\n cout << \"enter APP()\" << endl;\n \n lcm_->subscribe(is_left ? \"SANDIA_LEFT_TACTILE_STATE\":\"SANDIA_RIGHT_TACTILE_STATE\", \n &App::sandiaTactileStateHandler, this); \n \n\n std::string cfg_path = std::string(getConfigPath()) +\"\/subsystems\/sandia_hands\/\";\n string path_img, path_cfg;\n string filename = is_left ? \"sandia_hand_l\" : \"sandia_hand_r\";\n path_img = cfg_path + filename + \".jpg\";\n path_cfg = cfg_path + filename + \".cfg\";\n \n readCfg(path_cfg);\n \n orig_img.load(path_img.c_str());\n \n disp_img = orig_img;\n main_disp.display(disp_img);\n main_disp.resize(orig_img.width()\/2, orig_img.height()\/2);\n cout << \"leave APP()\" << endl;\n}\n\nvoid App::readCfg(const std::string& path_cfg){\n int hand_orig_x, hand_orig_y;\n float pixel_over_real;\n string garbage;\n ifstream fin(path_cfg.c_str());\n if(!fin)\n cout << \"open filepath \" << path_cfg << \" fail\" << endl;\n fin >> hand_orig_x >> hand_orig_y;\n getline(fin, garbage);\n fin >> pixel_over_real;\n getline(fin, garbage);\n for(int i=0;i<NTACTILE;i++){\n int id; float rx, ry, rz;\n fin >> id >> rx >> ry >> rz; \n img_x[i] = rx*pixel_over_real + hand_orig_x;\n img_y[i] = -ry*pixel_over_real + hand_orig_y;\n cout << i << \" \" << img_x[i] << \" \" << img_y[i] << endl;\n }\n fin.close();\n}\n\nvoid App::getHeatColor(const float v, unsigned char color [3]){\n \/\/ v: [0~1)\n \/\/ color: RGB (0,0,0)~(255,255,255)\n if(v < 0.5){\n color[0] = (unsigned char)0;\n color[1] = (unsigned char)(2*256*v);\n color[2] = (unsigned char)(255-2*256*v);\n }\n else{\n color[0] = (unsigned char)(2*256*(v-0.5));\n color[1] = (unsigned char)(255-2*256*(v-0.5));\n color[2] = (unsigned char)(0);\n }\n}\n\nvoid App::sandiaTactileStateHandler(const lcm::ReceiveBuffer* rbuf, \n const std::string& channel, const drc::hand_tactile_state_t* msg){\n \n \/\/ Draw hand img\n unsigned char color[3];\n \n disp_img = orig_img;\n for(size_t i=0;i<NTACTILE;i++){\n float v = (float)msg->palm[i] \/ 65536.0 * 2.5;\n if(v<0) v = 0;\n else if(v>=1) v=1-1e-8;\n getHeatColor(v, color);\n \/\/cout << color[0] << \" \" << color[1] << \" \" << color[2] <<endl;\n \/\/cout << i <<\" \" << img_x[i] << \" \" << img_y[i] <<endl;\n disp_img.draw_circle(img_x[i], img_y[i], \/*int radius*\/ 20, color);\n }\n main_disp.display(disp_img);\n \/\/main_disp.wait();\n \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n \n \n}\n \nint main(int argc, char *argv[]){\n bool lhand=false, rhand=false;\n ConciseArgs opt(argc, (char**)argv);\n opt.add(rhand, \"r\", \"right\",\"Process right hand message\");\n opt.add(lhand, \"l\", \"left\",\"Process left hand message\");\n \n opt.parse();\n if(rhand && lhand){\n printf(\"Only one hand at a time.\\n\");\n return 1;\n }\n if(!rhand && !lhand){\n printf(\"Please specify a hand. Type -h for usage.\\n\");\n return 1;\n }\n \n boost::shared_ptr<lcm::LCM> lcm(new lcm::LCM() );\n if(!lcm->good())\n return 1; \n \n App app(lcm, lhand);\n while(0 == lcm->handle());\n return 0;\n}\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#if defined(ENABLE_ONEDNN_OPENMP) && defined(ENABLE_MKL) && defined(_OPENMP)\n#ifndef DNNL_AARCH64_USE_ACL\n\/\/ Using LLVM's OpenMP header\n#include \"external\/llvm_openmp\/include\/omp.h\"\n\/* Added EIGEN_DONT_PARALLELIZE to avoid duplicating omp.h, please refer to\nthis link https:\/\/eigen.tuxfamily.org\/dox\/TopicMultiThreading.html for more\ninfo. It does not have any negative impact on performance. *\/\n#define EIGEN_DONT_PARALLELIZE\n#else\n#include \"omp.h\" \/\/ NOLINT\n#endif\n#endif \/\/ ENABLE_ONEDNN_OPENMP && ENABLE_MKL &&_OPENMP\n\n#include \"absl\/base\/call_once.h\"\n#include \"absl\/container\/flat_hash_set.h\"\n#include \"tensorflow\/core\/common_runtime\/local_device.h\"\n#include \"tensorflow\/core\/common_runtime\/scoped_allocator.h\"\n#include \"tensorflow\/core\/common_runtime\/scoped_allocator_mgr.h\"\n#include \"tensorflow\/core\/common_runtime\/threadpool_device.h\"\n#include \"tensorflow\/core\/framework\/allocator.h\"\n#include \"tensorflow\/core\/framework\/allocator_registry.h\"\n#include \"tensorflow\/core\/framework\/device_base.h\"\n#include \"tensorflow\/core\/framework\/op_kernel.h\"\n#include \"tensorflow\/core\/framework\/tensor.pb.h\"\n#include \"tensorflow\/core\/framework\/tensor_util.h\"\n#include \"tensorflow\/core\/framework\/types.h\"\n#include \"tensorflow\/core\/graph\/types.h\"\n#include \"tensorflow\/core\/lib\/hash\/hash.h\"\n#include \"tensorflow\/core\/platform\/tracing.h\"\n#include \"tensorflow\/core\/platform\/types.h\"\n#include \"tensorflow\/core\/public\/session_options.h\"\n#include \"tensorflow\/core\/util\/util.h\"\n\n#ifdef INTEL_MKL\n#include \"tensorflow\/core\/common_runtime\/mkl_cpu_allocator.h\"\n#include \"tensorflow\/core\/platform\/cpu_info.h\"\n#endif \/\/ INTEL_MKL\n\nnamespace tensorflow {\n\nThreadPoolDevice::ThreadPoolDevice(const SessionOptions& options,\n const string& name, Bytes memory_limit,\n const DeviceLocality& locality,\n Allocator* allocator)\n : LocalDevice(options, Device::BuildDeviceAttributes(\n name, DEVICE_CPU, memory_limit, locality)),\n allocator_(allocator),\n scoped_allocator_mgr_(new ScopedAllocatorMgr(name)) {\n auto s = NodeFileWriter::GetNodeFileWriterIfEnabled(name, env());\n if (!s.ok()) {\n LOG(ERROR) << s.status();\n } else {\n node_file_writer_ = *s;\n if (node_file_writer_) {\n LOG(INFO) << \"Writing NodeDefs to file: \"\n << node_file_writer_->filename();\n }\n }\n\n#if defined(ENABLE_ONEDNN_OPENMP) && defined(INTEL_MKL)\n \/\/ Early return when MKL is disabled\n if (!IsMKLEnabled()) return;\n#ifdef _OPENMP\n const char* user_omp_threads = getenv(\"OMP_NUM_THREADS\");\n static absl::once_flag num_threads_setting_flag;\n if (user_omp_threads == nullptr) {\n \/\/ OMP_NUM_THREADS controls MKL's intra-op parallelization\n \/\/ Default to available physical cores\n const int mkl_intra_op = port::NumSchedulableCPUs();\n const int ht = port::NumHyperthreadsPerCore();\n absl::call_once(num_threads_setting_flag, omp_set_num_threads,\n (mkl_intra_op + ht - 1) \/ ht);\n }\n\n#ifndef DNNL_AARCH64_USE_ACL\n const char* user_kmp_blocktime = getenv(\"KMP_BLOCKTIME\");\n static absl::once_flag blocktime_setting_flag;\n if (user_kmp_blocktime == nullptr) {\n \/\/ Sets the time, in milliseconds, that a thread should wait,\n \/\/ after completing the execution of a parallel region, before sleeping.\n absl::call_once(blocktime_setting_flag, kmp_set_blocktime, 1);\n }\n#endif\n\n#endif \/\/ _OPENMP\n#endif \/\/ defined(ENABLE_ONEDNN_OPENMP) && defined(INTEL_MKL)\n}\n\nThreadPoolDevice::~ThreadPoolDevice() {}\n\nAllocator* ThreadPoolDevice::GetAllocator(AllocatorAttributes attr) {\n return allocator_;\n}\n\nAllocator* ThreadPoolDevice::GetScopedAllocator(AllocatorAttributes attr,\n int64_t step_id) {\n if (attr.scope_id > 0) {\n return scoped_allocator_mgr_->GetContainer(step_id)->GetInstance(\n attr.scope_id);\n }\n LOG(FATAL) << \"Unexpected call to ThreadPoolDevice::GetScopedAllocator \"\n << \"attr.scope_id = \" << attr.scope_id;\n return allocator_;\n}\n\nStatus ThreadPoolDevice::MakeTensorFromProto(\n const TensorProto& tensor_proto, const AllocatorAttributes alloc_attrs,\n Tensor* tensor) {\n if (tensor_proto.dtype() > 0 && tensor_proto.dtype() <= DataType_MAX) {\n Tensor parsed(tensor_proto.dtype());\n if (parsed.FromProto(allocator_, tensor_proto)) {\n *tensor = std::move(parsed);\n return Status::OK();\n }\n }\n return errors::InvalidArgument(\"Cannot parse tensor from proto: \",\n tensor_proto.DebugString());\n}\n\nvoid ThreadPoolDevice::CopyTensorInSameDevice(\n const Tensor* input_tensor, Tensor* output_tensor,\n const DeviceContext* device_context, StatusCallback done) {\n if (input_tensor->NumElements() != output_tensor->NumElements()) {\n done(errors::Internal(\n \"CPU->CPU copy shape mismatch: input=\", input_tensor->shape(),\n \", output=\", output_tensor->shape()));\n return;\n }\n tensor::DeepCopy(*input_tensor, output_tensor);\n done(Status::OK());\n}\n\nnamespace {\nconst absl::flat_hash_set<std::string>* GetOpsToLogFromEnv() {\n auto* result = new absl::flat_hash_set<std::string>;\n const char* env = getenv(\"TF_CPU_DEBUG_OPS_TO_LOG\");\n if (!env) {\n return result;\n }\n\n std::vector<absl::string_view> ops = absl::StrSplit(env, ',');\n LOG(INFO) << \"Will log inputs & outputs from the following ops: \";\n for (absl::string_view op : ops) {\n result->insert(std::string(op));\n LOG(INFO) << \" |\" << op << \"|\";\n }\n\n return result;\n}\n\nbool ShouldLogInputsAndOutputs(OpKernel* op_kernel) {\n static const absl::flat_hash_set<std::string>& ops_to_log =\n *GetOpsToLogFromEnv();\n return ops_to_log.count(op_kernel->type_string());\n}\n} \/\/ namespace\n\nvoid ThreadPoolDevice::Compute(OpKernel* op_kernel, OpKernelContext* context) {\n bool should_log_inputs_and_outputs = ShouldLogInputsAndOutputs(op_kernel);\n\n if (should_log_inputs_and_outputs) {\n LogInputs(op_kernel, context);\n }\n\n op_kernel->Compute(context);\n\n if (context->status().ok() && node_file_writer_) {\n Status s = node_file_writer_->RecordNodeExecution(op_kernel, context);\n if (!s.ok()) {\n LOG(ERROR) << s;\n context->SetStatus(s);\n }\n }\n\n if (should_log_inputs_and_outputs) {\n LogOutputs(op_kernel, context);\n }\n}\n\nvoid ThreadPoolDevice::ComputeAsync(AsyncOpKernel* op_kernel,\n OpKernelContext* context,\n AsyncOpKernel::DoneCallback done) {\n bool should_log_inputs_and_outputs = ShouldLogInputsAndOutputs(op_kernel);\n\n if (should_log_inputs_and_outputs) {\n LogInputs(op_kernel, context);\n AsyncOpKernel::DoneCallback parent_done = done;\n done = [this, parent_done, op_kernel, context]() {\n LogOutputs(op_kernel, context);\n parent_done();\n };\n }\n\n op_kernel->ComputeAsync(context, done);\n}\n\nvoid ThreadPoolDevice::LogInputs(OpKernel* op_kernel,\n OpKernelContext* context) {\n LOG(INFO) << \"Inputs for \" << op_kernel->name() << \" (total \"\n << context->num_inputs() << \"):\";\n for (int i = 0; i < context->num_inputs(); i++) {\n if (!context->has_input(i)) {\n LOG(INFO) << \"input # \" << i << \" is absent\";\n continue;\n }\n LOG(INFO) << \"input # \" << i;\n LOG(INFO) << context->input(i).DebugString(-1);\n }\n LOG(INFO) << \"\";\n}\n\nvoid ThreadPoolDevice::LogOutputs(OpKernel* op_kernel,\n OpKernelContext* context) {\n if (!context->status().ok()) {\n LOG(INFO) << op_kernel->name()\n << \" failed: \" << context->status().error_message();\n return;\n }\n\n LOG(INFO) << \"Outputs for \" << op_kernel->name() << \" (total \"\n << context->num_inputs() << \"):\";\n for (int i = 0; i < context->num_outputs(); i++) {\n Tensor* output = context->mutable_output(i);\n if (output == nullptr) {\n LOG(INFO) << \"output # \" << i << \" is null\";\n } else {\n LOG(INFO) << \"output # \" << i;\n LOG(INFO) << output->DebugString(-1);\n }\n }\n LOG(INFO) << \"\";\n}\n\n#ifdef INTEL_MKL\nnamespace {\nclass MklCPUAllocatorFactory : public AllocatorFactory {\n public:\n bool NumaEnabled() override { return false; }\n\n Allocator* CreateAllocator() override { return new MklCPUAllocator; }\n\n \/\/ Note: Ignores numa_node, for now.\n virtual SubAllocator* CreateSubAllocator(int numa_node) {\n return new MklSubAllocator;\n }\n};\n\nREGISTER_MEM_ALLOCATOR(\"MklCPUAllocator\", (IsMKLEnabled() ? 200 : 50),\n MklCPUAllocatorFactory);\n\n} \/\/ namespace\n#endif \/\/ INTEL_MKL\n\n} \/\/ namespace tensorflow\n<commit_msg>Avoid expensive string building in the case where op input and output logging is completely disabled.<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#if defined(ENABLE_ONEDNN_OPENMP) && defined(ENABLE_MKL) && defined(_OPENMP)\n#ifndef DNNL_AARCH64_USE_ACL\n\/\/ Using LLVM's OpenMP header\n#include \"external\/llvm_openmp\/include\/omp.h\"\n\/* Added EIGEN_DONT_PARALLELIZE to avoid duplicating omp.h, please refer to\nthis link https:\/\/eigen.tuxfamily.org\/dox\/TopicMultiThreading.html for more\ninfo. It does not have any negative impact on performance. *\/\n#define EIGEN_DONT_PARALLELIZE\n#else\n#include \"omp.h\" \/\/ NOLINT\n#endif\n#endif \/\/ ENABLE_ONEDNN_OPENMP && ENABLE_MKL &&_OPENMP\n\n#include \"absl\/base\/call_once.h\"\n#include \"absl\/container\/flat_hash_set.h\"\n#include \"tensorflow\/core\/common_runtime\/local_device.h\"\n#include \"tensorflow\/core\/common_runtime\/scoped_allocator.h\"\n#include \"tensorflow\/core\/common_runtime\/scoped_allocator_mgr.h\"\n#include \"tensorflow\/core\/common_runtime\/threadpool_device.h\"\n#include \"tensorflow\/core\/framework\/allocator.h\"\n#include \"tensorflow\/core\/framework\/allocator_registry.h\"\n#include \"tensorflow\/core\/framework\/device_base.h\"\n#include \"tensorflow\/core\/framework\/op_kernel.h\"\n#include \"tensorflow\/core\/framework\/tensor.pb.h\"\n#include \"tensorflow\/core\/framework\/tensor_util.h\"\n#include \"tensorflow\/core\/framework\/types.h\"\n#include \"tensorflow\/core\/graph\/types.h\"\n#include \"tensorflow\/core\/lib\/hash\/hash.h\"\n#include \"tensorflow\/core\/platform\/tracing.h\"\n#include \"tensorflow\/core\/platform\/types.h\"\n#include \"tensorflow\/core\/public\/session_options.h\"\n#include \"tensorflow\/core\/util\/util.h\"\n\n#ifdef INTEL_MKL\n#include \"tensorflow\/core\/common_runtime\/mkl_cpu_allocator.h\"\n#include \"tensorflow\/core\/platform\/cpu_info.h\"\n#endif \/\/ INTEL_MKL\n\nnamespace tensorflow {\n\nThreadPoolDevice::ThreadPoolDevice(const SessionOptions& options,\n const string& name, Bytes memory_limit,\n const DeviceLocality& locality,\n Allocator* allocator)\n : LocalDevice(options, Device::BuildDeviceAttributes(\n name, DEVICE_CPU, memory_limit, locality)),\n allocator_(allocator),\n scoped_allocator_mgr_(new ScopedAllocatorMgr(name)) {\n auto s = NodeFileWriter::GetNodeFileWriterIfEnabled(name, env());\n if (!s.ok()) {\n LOG(ERROR) << s.status();\n } else {\n node_file_writer_ = *s;\n if (node_file_writer_) {\n LOG(INFO) << \"Writing NodeDefs to file: \"\n << node_file_writer_->filename();\n }\n }\n\n#if defined(ENABLE_ONEDNN_OPENMP) && defined(INTEL_MKL)\n \/\/ Early return when MKL is disabled\n if (!IsMKLEnabled()) return;\n#ifdef _OPENMP\n const char* user_omp_threads = getenv(\"OMP_NUM_THREADS\");\n static absl::once_flag num_threads_setting_flag;\n if (user_omp_threads == nullptr) {\n \/\/ OMP_NUM_THREADS controls MKL's intra-op parallelization\n \/\/ Default to available physical cores\n const int mkl_intra_op = port::NumSchedulableCPUs();\n const int ht = port::NumHyperthreadsPerCore();\n absl::call_once(num_threads_setting_flag, omp_set_num_threads,\n (mkl_intra_op + ht - 1) \/ ht);\n }\n\n#ifndef DNNL_AARCH64_USE_ACL\n const char* user_kmp_blocktime = getenv(\"KMP_BLOCKTIME\");\n static absl::once_flag blocktime_setting_flag;\n if (user_kmp_blocktime == nullptr) {\n \/\/ Sets the time, in milliseconds, that a thread should wait,\n \/\/ after completing the execution of a parallel region, before sleeping.\n absl::call_once(blocktime_setting_flag, kmp_set_blocktime, 1);\n }\n#endif\n\n#endif \/\/ _OPENMP\n#endif \/\/ defined(ENABLE_ONEDNN_OPENMP) && defined(INTEL_MKL)\n}\n\nThreadPoolDevice::~ThreadPoolDevice() {}\n\nAllocator* ThreadPoolDevice::GetAllocator(AllocatorAttributes attr) {\n return allocator_;\n}\n\nAllocator* ThreadPoolDevice::GetScopedAllocator(AllocatorAttributes attr,\n int64_t step_id) {\n if (attr.scope_id > 0) {\n return scoped_allocator_mgr_->GetContainer(step_id)->GetInstance(\n attr.scope_id);\n }\n LOG(FATAL) << \"Unexpected call to ThreadPoolDevice::GetScopedAllocator \"\n << \"attr.scope_id = \" << attr.scope_id;\n return allocator_;\n}\n\nStatus ThreadPoolDevice::MakeTensorFromProto(\n const TensorProto& tensor_proto, const AllocatorAttributes alloc_attrs,\n Tensor* tensor) {\n if (tensor_proto.dtype() > 0 && tensor_proto.dtype() <= DataType_MAX) {\n Tensor parsed(tensor_proto.dtype());\n if (parsed.FromProto(allocator_, tensor_proto)) {\n *tensor = std::move(parsed);\n return Status::OK();\n }\n }\n return errors::InvalidArgument(\"Cannot parse tensor from proto: \",\n tensor_proto.DebugString());\n}\n\nvoid ThreadPoolDevice::CopyTensorInSameDevice(\n const Tensor* input_tensor, Tensor* output_tensor,\n const DeviceContext* device_context, StatusCallback done) {\n if (input_tensor->NumElements() != output_tensor->NumElements()) {\n done(errors::Internal(\n \"CPU->CPU copy shape mismatch: input=\", input_tensor->shape(),\n \", output=\", output_tensor->shape()));\n return;\n }\n tensor::DeepCopy(*input_tensor, output_tensor);\n done(Status::OK());\n}\n\nnamespace {\nconst absl::flat_hash_set<std::string>* GetOpsToLogFromEnv() {\n auto* result = new absl::flat_hash_set<std::string>;\n const char* env = getenv(\"TF_CPU_DEBUG_OPS_TO_LOG\");\n if (!env) {\n return result;\n }\n\n std::vector<absl::string_view> ops = absl::StrSplit(env, ',');\n LOG(INFO) << \"Will log inputs & outputs from the following ops: \";\n for (absl::string_view op : ops) {\n result->insert(std::string(op));\n LOG(INFO) << \" |\" << op << \"|\";\n }\n\n return result;\n}\n\nbool ShouldLogInputsAndOutputs(OpKernel* op_kernel) {\n static const absl::flat_hash_set<std::string>& ops_to_log =\n *GetOpsToLogFromEnv();\n static const bool is_empty = ops_to_log.empty();\n if (is_empty) {\n return false;\n }\n return ops_to_log.count(op_kernel->type_string());\n}\n} \/\/ namespace\n\nvoid ThreadPoolDevice::Compute(OpKernel* op_kernel, OpKernelContext* context) {\n bool should_log_inputs_and_outputs = ShouldLogInputsAndOutputs(op_kernel);\n\n if (should_log_inputs_and_outputs) {\n LogInputs(op_kernel, context);\n }\n\n op_kernel->Compute(context);\n\n if (context->status().ok() && node_file_writer_) {\n Status s = node_file_writer_->RecordNodeExecution(op_kernel, context);\n if (!s.ok()) {\n LOG(ERROR) << s;\n context->SetStatus(s);\n }\n }\n\n if (should_log_inputs_and_outputs) {\n LogOutputs(op_kernel, context);\n }\n}\n\nvoid ThreadPoolDevice::ComputeAsync(AsyncOpKernel* op_kernel,\n OpKernelContext* context,\n AsyncOpKernel::DoneCallback done) {\n bool should_log_inputs_and_outputs = ShouldLogInputsAndOutputs(op_kernel);\n\n if (should_log_inputs_and_outputs) {\n LogInputs(op_kernel, context);\n AsyncOpKernel::DoneCallback parent_done = done;\n done = [this, parent_done, op_kernel, context]() {\n LogOutputs(op_kernel, context);\n parent_done();\n };\n }\n\n op_kernel->ComputeAsync(context, done);\n}\n\nvoid ThreadPoolDevice::LogInputs(OpKernel* op_kernel,\n OpKernelContext* context) {\n LOG(INFO) << \"Inputs for \" << op_kernel->name() << \" (total \"\n << context->num_inputs() << \"):\";\n for (int i = 0; i < context->num_inputs(); i++) {\n if (!context->has_input(i)) {\n LOG(INFO) << \"input # \" << i << \" is absent\";\n continue;\n }\n LOG(INFO) << \"input # \" << i;\n LOG(INFO) << context->input(i).DebugString(-1);\n }\n LOG(INFO) << \"\";\n}\n\nvoid ThreadPoolDevice::LogOutputs(OpKernel* op_kernel,\n OpKernelContext* context) {\n if (!context->status().ok()) {\n LOG(INFO) << op_kernel->name()\n << \" failed: \" << context->status().error_message();\n return;\n }\n\n LOG(INFO) << \"Outputs for \" << op_kernel->name() << \" (total \"\n << context->num_inputs() << \"):\";\n for (int i = 0; i < context->num_outputs(); i++) {\n Tensor* output = context->mutable_output(i);\n if (output == nullptr) {\n LOG(INFO) << \"output # \" << i << \" is null\";\n } else {\n LOG(INFO) << \"output # \" << i;\n LOG(INFO) << output->DebugString(-1);\n }\n }\n LOG(INFO) << \"\";\n}\n\n#ifdef INTEL_MKL\nnamespace {\nclass MklCPUAllocatorFactory : public AllocatorFactory {\n public:\n bool NumaEnabled() override { return false; }\n\n Allocator* CreateAllocator() override { return new MklCPUAllocator; }\n\n \/\/ Note: Ignores numa_node, for now.\n virtual SubAllocator* CreateSubAllocator(int numa_node) {\n return new MklSubAllocator;\n }\n};\n\nREGISTER_MEM_ALLOCATOR(\"MklCPUAllocator\", (IsMKLEnabled() ? 200 : 50),\n MklCPUAllocatorFactory);\n\n} \/\/ namespace\n#endif \/\/ INTEL_MKL\n\n} \/\/ namespace tensorflow\n<|endoftext|>"} {"text":"<commit_before>\/* Copyright 2016 The TensorFlow Authors. All Rights Reserved.\n\nLicensed under the Apache License, Version 2.0 (the \"License\");\nyou may not use this file except in compliance with the License.\nYou may obtain a copy of the License at\n\n http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n\nUnless required by applicable law or agreed to in writing, software\ndistributed under the License is distributed on an \"AS IS\" BASIS,\nWITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\nSee the License for the specific language governing permissions and\nlimitations under the License.\n==============================================================================*\/\n\n#include \"tensorflow\/core\/platform\/profile_utils\/cpu_utils.h\"\n\n#include <fstream>\n#include <limits>\n#include <mutex>\n\n#if defined(_WIN32)\n#include <windows.h>\n#endif\n\n#if defined(__APPLE__)\n#include <sys\/sysctl.h>\n#endif\n\n#include \"absl\/base\/call_once.h\"\n#include \"tensorflow\/core\/platform\/logging.h\"\n#include \"tensorflow\/core\/platform\/profile_utils\/android_armv7a_cpu_utils_helper.h\"\n\nnamespace tensorflow {\nnamespace profile_utils {\n\n\/* static *\/ constexpr int64 CpuUtils::INVALID_FREQUENCY;\n\nstatic ICpuUtilsHelper* cpu_utils_helper_instance_ = nullptr;\n\n#if (defined(__powerpc__) || \\\n defined(__ppc__) && (__BYTE_ORDER__ == __ORDER_LITTLE_ENDIAN__)) || \\\n (defined(__s390x__))\n\/* static *\/ uint64 CpuUtils::GetCycleCounterFrequency() {\n static const uint64 cpu_frequency = GetCycleCounterFrequencyImpl();\n return cpu_frequency;\n}\n#else\n\/* static *\/ int64 CpuUtils::GetCycleCounterFrequency() {\n static const int64 cpu_frequency = GetCycleCounterFrequencyImpl();\n return cpu_frequency;\n}\n#endif\n\n\/* static *\/ double CpuUtils::GetMicroSecPerClock() {\n static const double micro_sec_per_clock =\n (1000.0 * 1000.0) \/ static_cast<double>(GetCycleCounterFrequency());\n return micro_sec_per_clock;\n}\n\n\/* static *\/ void CpuUtils::ResetClockCycle() {\n GetCpuUtilsHelperSingletonInstance().ResetClockCycle();\n}\n\n\/* static *\/ void CpuUtils::EnableClockCycleProfiling() {\n GetCpuUtilsHelperSingletonInstance().EnableClockCycleProfiling();\n}\n\n\/* static *\/ void CpuUtils::DisableClockCycleProfiling() {\n GetCpuUtilsHelperSingletonInstance().DisableClockCycleProfiling();\n}\n\n\/* static *\/ std::chrono::duration<double> CpuUtils::ConvertClockCycleToTime(\n const int64 clock_cycle) {\n return std::chrono::duration<double>(static_cast<double>(clock_cycle) \/\n GetCycleCounterFrequency());\n}\n\n\/* static *\/ int64 CpuUtils::GetCycleCounterFrequencyImpl() {\n\/\/ TODO(satok): do not switch by macro here\n#if defined(__ANDROID__)\n return GetCpuUtilsHelperSingletonInstance().CalculateCpuFrequency();\n#elif defined(__linux__)\n \/\/ Read the contents of \/proc\/cpuinfo.\n std::ifstream cpuinfo(\"\/proc\/cpuinfo\");\n if (!cpuinfo) {\n LOG(WARNING) << \"Failed to open \/proc\/cpuinfo\";\n return INVALID_FREQUENCY;\n }\n string line;\n while (std::getline(cpuinfo, line)) {\n double cpu_freq = 0.0;\n int retval = 0;\n double freq_factor = 2.0;\n#if (defined(__powerpc__) || \\\n defined(__ppc__) && (__BYTE_ORDER__ == __ORDER_LITTLE_ENDIAN__))\n retval = sscanf(line.c_str(), \"clock : %lfMHz\", &cpu_freq);\n freq_factor = 1.0;\n#elif defined(__s390x__)\n retval = sscanf(line.c_str(), \"bogomips per cpu: %lf\", &cpu_freq);\n#else\n retval = sscanf(line.c_str(), \"bogomips : %lf\", &cpu_freq);\n#endif\n if (retval > 0) {\n const double freq_ghz = cpu_freq \/ 1000.0 \/ freq_factor;\n if (retval != 1 || freq_ghz < 0.01) {\n LOG(WARNING) << \"Failed to get CPU frequency: \" << freq_ghz << \" GHz\";\n return INVALID_FREQUENCY;\n }\n const int64 freq_n =\n static_cast<int64>(freq_ghz * 1000.0 * 1000.0 * 1000.0);\n LOG(INFO) << \"CPU Frequency: \" << freq_n << \" Hz\";\n return freq_n;\n }\n }\n LOG(WARNING)\n << \"Failed to find bogomips or clock in \/proc\/cpuinfo; cannot determine \"\n \"CPU frequency\";\n return INVALID_FREQUENCY;\n#elif defined(__APPLE__)\n int64 freq_hz = 0;\n size_t freq_size = sizeof(freq_hz);\n int retval =\n sysctlbyname(\"hw.cpufrequency_max\", &freq_hz, &freq_size, NULL, 0);\n if (retval != 0 || freq_hz < 1e6) {\n LOG(WARNING) << \"Failed to get CPU frequency: \" << freq_hz << \" Hz\";\n return INVALID_FREQUENCY;\n }\n return freq_hz;\n#elif defined(_WIN32)\n LARGE_INTEGER freq;\n QueryPerformanceFrequency(&freq);\n return freq.QuadPart;\n#else\n \/\/ TODO(satok): Support other OS if needed\n \/\/ Return INVALID_FREQUENCY on unsupported OS\n return INVALID_FREQUENCY;\n#endif\n}\n\n\/* static *\/ ICpuUtilsHelper& CpuUtils::GetCpuUtilsHelperSingletonInstance() {\n static absl::once_flag flag;\n absl::call_once(flag, []() {\n if (cpu_utils_helper_instance_ != nullptr) {\n LOG(FATAL) << \"cpu_utils_helper_instance_ is already instantiated.\";\n }\n#if defined(__ANDROID__) && (__ANDROID_API__ >= 21) && \\\n (defined(__ARM_ARCH_7A__) || defined(__aarch64__))\n cpu_utils_helper_instance_ = new AndroidArmV7ACpuUtilsHelper();\n#else\n cpu_utils_helper_instance_ = new DefaultCpuUtilsHelper();\n#endif\n });\n return *cpu_utils_helper_instance_;\n}\n\n} \/\/ namespace profile_utils\n} \/\/ namespace tensorflow\n<commit_msg>find bogomips on aarch64<commit_after>\/* Copyright 2016 The TensorFlow Authors. All Rights Reserved.\n\nLicensed under the Apache License, Version 2.0 (the \"License\");\nyou may not use this file except in compliance with the License.\nYou may obtain a copy of the License at\n\n http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n\nUnless required by applicable law or agreed to in writing, software\ndistributed under the License is distributed on an \"AS IS\" BASIS,\nWITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\nSee the License for the specific language governing permissions and\nlimitations under the License.\n==============================================================================*\/\n\n#include \"tensorflow\/core\/platform\/profile_utils\/cpu_utils.h\"\n\n#include <fstream>\n#include <limits>\n#include <mutex>\n\n#if defined(_WIN32)\n#include <windows.h>\n#endif\n\n#if defined(__APPLE__)\n#include <sys\/sysctl.h>\n#endif\n\n#include \"absl\/base\/call_once.h\"\n#include \"tensorflow\/core\/platform\/logging.h\"\n#include \"tensorflow\/core\/platform\/profile_utils\/android_armv7a_cpu_utils_helper.h\"\n\nnamespace tensorflow {\nnamespace profile_utils {\n\n\/* static *\/ constexpr int64 CpuUtils::INVALID_FREQUENCY;\n\nstatic ICpuUtilsHelper* cpu_utils_helper_instance_ = nullptr;\n\n#if (defined(__powerpc__) || \\\n defined(__ppc__) && (__BYTE_ORDER__ == __ORDER_LITTLE_ENDIAN__)) || \\\n (defined(__s390x__))\n\/* static *\/ uint64 CpuUtils::GetCycleCounterFrequency() {\n static const uint64 cpu_frequency = GetCycleCounterFrequencyImpl();\n return cpu_frequency;\n}\n#else\n\/* static *\/ int64 CpuUtils::GetCycleCounterFrequency() {\n static const int64 cpu_frequency = GetCycleCounterFrequencyImpl();\n return cpu_frequency;\n}\n#endif\n\n\/* static *\/ double CpuUtils::GetMicroSecPerClock() {\n static const double micro_sec_per_clock =\n (1000.0 * 1000.0) \/ static_cast<double>(GetCycleCounterFrequency());\n return micro_sec_per_clock;\n}\n\n\/* static *\/ void CpuUtils::ResetClockCycle() {\n GetCpuUtilsHelperSingletonInstance().ResetClockCycle();\n}\n\n\/* static *\/ void CpuUtils::EnableClockCycleProfiling() {\n GetCpuUtilsHelperSingletonInstance().EnableClockCycleProfiling();\n}\n\n\/* static *\/ void CpuUtils::DisableClockCycleProfiling() {\n GetCpuUtilsHelperSingletonInstance().DisableClockCycleProfiling();\n}\n\n\/* static *\/ std::chrono::duration<double> CpuUtils::ConvertClockCycleToTime(\n const int64 clock_cycle) {\n return std::chrono::duration<double>(static_cast<double>(clock_cycle) \/\n GetCycleCounterFrequency());\n}\n\n\/* static *\/ int64 CpuUtils::GetCycleCounterFrequencyImpl() {\n\/\/ TODO(satok): do not switch by macro here\n#if defined(__ANDROID__)\n return GetCpuUtilsHelperSingletonInstance().CalculateCpuFrequency();\n#elif defined(__linux__)\n \/\/ Read the contents of \/proc\/cpuinfo.\n std::ifstream cpuinfo(\"\/proc\/cpuinfo\");\n if (!cpuinfo) {\n LOG(WARNING) << \"Failed to open \/proc\/cpuinfo\";\n return INVALID_FREQUENCY;\n }\n string line;\n while (std::getline(cpuinfo, line)) {\n double cpu_freq = 0.0;\n int retval = 0;\n double freq_factor = 2.0;\n#if (defined(__powerpc__) || \\\n defined(__ppc__) && (__BYTE_ORDER__ == __ORDER_LITTLE_ENDIAN__))\n retval = sscanf(line.c_str(), \"clock : %lfMHz\", &cpu_freq);\n freq_factor = 1.0;\n#elif defined(__s390x__)\n retval = sscanf(line.c_str(), \"bogomips per cpu: %lf\", &cpu_freq);\n#elif defined(__aarch64__)\n retval = sscanf(line.c_str(), \"BogoMIPS : %lf\", &cpu_freq);\n#else\n retval = sscanf(line.c_str(), \"bogomips : %lf\", &cpu_freq);\n#endif\n if (retval > 0) {\n const double freq_ghz = cpu_freq \/ 1000.0 \/ freq_factor;\n if (retval != 1 || freq_ghz < 0.01) {\n LOG(WARNING) << \"Failed to get CPU frequency: \" << freq_ghz << \" GHz\";\n return INVALID_FREQUENCY;\n }\n const int64 freq_n =\n static_cast<int64>(freq_ghz * 1000.0 * 1000.0 * 1000.0);\n LOG(INFO) << \"CPU Frequency: \" << freq_n << \" Hz\";\n return freq_n;\n }\n }\n LOG(WARNING)\n << \"Failed to find bogomips or clock in \/proc\/cpuinfo; cannot determine \"\n \"CPU frequency\";\n return INVALID_FREQUENCY;\n#elif defined(__APPLE__)\n int64 freq_hz = 0;\n size_t freq_size = sizeof(freq_hz);\n int retval =\n sysctlbyname(\"hw.cpufrequency_max\", &freq_hz, &freq_size, NULL, 0);\n if (retval != 0 || freq_hz < 1e6) {\n LOG(WARNING) << \"Failed to get CPU frequency: \" << freq_hz << \" Hz\";\n return INVALID_FREQUENCY;\n }\n return freq_hz;\n#elif defined(_WIN32)\n LARGE_INTEGER freq;\n QueryPerformanceFrequency(&freq);\n return freq.QuadPart;\n#else\n \/\/ TODO(satok): Support other OS if needed\n \/\/ Return INVALID_FREQUENCY on unsupported OS\n return INVALID_FREQUENCY;\n#endif\n}\n\n\/* static *\/ ICpuUtilsHelper& CpuUtils::GetCpuUtilsHelperSingletonInstance() {\n static absl::once_flag flag;\n absl::call_once(flag, []() {\n if (cpu_utils_helper_instance_ != nullptr) {\n LOG(FATAL) << \"cpu_utils_helper_instance_ is already instantiated.\";\n }\n#if defined(__ANDROID__) && (__ANDROID_API__ >= 21) && \\\n (defined(__ARM_ARCH_7A__) || defined(__aarch64__))\n cpu_utils_helper_instance_ = new AndroidArmV7ACpuUtilsHelper();\n#else\n cpu_utils_helper_instance_ = new DefaultCpuUtilsHelper();\n#endif\n });\n return *cpu_utils_helper_instance_;\n}\n\n} \/\/ namespace profile_utils\n} \/\/ namespace tensorflow\n<|endoftext|>"} {"text":"<commit_before>\/* Copyright 2019 The TensorFlow Authors. All Rights Reserved.\n\nLicensed under the Apache License, Version 2.0 (the \"License\");\nyou may not use this file except in compliance with the License.\nYou may obtain a copy of the License at\n\n http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n\nUnless required by applicable law or agreed to in writing, software\ndistributed under the License is distributed on an \"AS IS\" BASIS,\nWITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\nSee the License for the specific language governing permissions and\nlimitations under the License.\n==============================================================================*\/\n\n#include \"tensorflow\/lite\/delegates\/gpu\/cl\/kernels\/pooling.h\"\n\n#include <string>\n\n#include \"tensorflow\/lite\/delegates\/gpu\/cl\/kernels\/util.h\"\n#include \"tensorflow\/lite\/delegates\/gpu\/cl\/kernels\/work_group_picking.h\"\n\nnamespace tflite {\nnamespace gpu {\nnamespace cl {\nnamespace {\n\nstd::string GetAveragePoolingKernelCode(\n const TensorDescriptor& src_descriptor,\n const TensorDescriptor& dst_descriptor, CalculationsPrecision precision,\n const CLDevice& device,\n const std::vector<ElementwiseOperation*>& linked_operations) {\n TensorCodeGenerator src_tensor(\"src_data\", \"src_size\", src_descriptor);\n TensorCodeGenerator dst_tensor(\"dst_data\", \"dst_size\", dst_descriptor);\n\n const auto address_mode = GetFastestZeroMode(device);\n\n std::string code = GetCommonDefines(precision);\n\n const bool manual_clamp =\n src_descriptor.storage_type == TensorStorageType::BUFFER ||\n src_descriptor.storage_type == TensorStorageType::IMAGE_BUFFER;\n\n code += \"__kernel void main_function(\\n\";\n code += src_tensor.GetDeclaration(AccessType::READ);\n code += GetArgsDeclaration(linked_operations);\n code += dst_tensor.GetDeclaration(AccessType::WRITE) + \",\\n\";\n code += \" int4 src_size, \\n\";\n code += \" int4 dst_size, \\n\";\n code += \" int2 kernel_size, \\n\";\n code += \" int2 padding, \\n\";\n code += \" int2 stride \\n\";\n code += \") {\\n\";\n code += \" int X = get_global_id(0);\\n\";\n code += \" int Y = get_global_id(1);\\n\";\n code += \" int Z = get_global_id(2);\\n\";\n code +=\n \" if (X >= dst_size.x || Y >= dst_size.y || Z >= dst_size.w) return; \\n\";\n code += \" float4 r = (float4)(0.0f);\\n\";\n code += \" float window_size = 0.0;\\n\";\n code += \" for (int ky = 0; ky < kernel_size.y; ++ky) {\\n\";\n code += \" int y_c = Y * stride.y - padding.y + ky;\\n\";\n code += \" bool outside_y = y_c < 0 || y_c >= src_size.y;\\n\";\n code += \" for (int kx = 0; kx < kernel_size.x; ++kx) {\\n\";\n code += \" int x_c = X * stride.x - padding.x + kx;\\n\";\n code += \" bool outside = outside_y || x_c < 0 || x_c >= src_size.x;\\n\";\n if (manual_clamp) {\n code += \" r += !outside ? \" +\n src_tensor.ReadAsFloat3D(\"x_c\", \"y_c\", \"Z\",\n TextureAddressMode::DONT_CARE) +\n \" : (float4)(0.0f);\\n\";\n } else {\n code += \" r += \" +\n src_tensor.ReadAsFloat3D(\"x_c\", \"y_c\", \"Z\", address_mode) + \";\\n\";\n }\n code += \" window_size += !outside ? 1.0 : 0.0;\\n\";\n code += \" }\\n\";\n code += \" }\\n\";\n \/\/ If window_size==0, window covered nothing. This situation is a sign of\n \/\/ incorrectly constructed operation. NaNs are expected as output.\n code += \" FLT4 result = TO_FLT4(r \/ window_size);\\n\";\n const LinkingContext context{\"result\", \"X\", \"Y\", \"Z\"};\n code += PostProcess(linked_operations, context);\n code += \" \" + dst_tensor.Write3D(\"result\", \"X\", \"Y\", \"Z\");\n code += \"}\\n\";\n\n return code;\n}\n\nstd::string GetMaxPoolingKernelCode(\n const TensorDescriptor& src_descriptor,\n const TensorDescriptor& dst_descriptor, CalculationsPrecision precision,\n const std::vector<ElementwiseOperation*>& linked_operations,\n bool output_indices) {\n TensorCodeGenerator src_tensor(\"src_data\", \"src_size\", src_descriptor);\n TensorCodeGenerator dst_tensor(\"dst_data\", \"dst_size\", dst_descriptor);\n TensorCodeGenerator indices_tensor(\"dst_indices\", \"dst_size\", dst_descriptor);\n\n std::string code = GetCommonDefines(precision);\n\n code += \"__kernel void main_function(\\n\";\n code += src_tensor.GetDeclaration(AccessType::READ);\n code += GetArgsDeclaration(linked_operations);\n code += dst_tensor.GetDeclaration(AccessType::WRITE) + \",\\n\";\n if (output_indices) {\n code += indices_tensor.GetDeclaration(AccessType::WRITE) + \",\\n\";\n }\n code += \" int4 src_size, \\n\";\n code += \" int4 dst_size, \\n\";\n code += \" int2 kernel_size, \\n\";\n code += \" int2 padding, \\n\";\n code += \" int2 stride \\n\";\n code += \") {\\n\";\n code += \" int X = get_global_id(0);\\n\";\n code += \" int Y = get_global_id(1);\\n\";\n code += \" int Z = get_global_id(2);\\n\";\n code +=\n \" if (X >= dst_size.x || Y >= dst_size.y || Z >= dst_size.w) return; \\n\";\n code += \" FLT4 maximum = (FLT4)(-10000.0f);\\n\";\n if (output_indices) {\n code += \" FLT4 indexes = (FLT4)(0.0f);\\n\";\n code += \" FLT index_counter = (FLT)(0.1f);\\n\";\n }\n code += \" for (int ky = 0; ky < kernel_size.y; ++ky) {\\n\";\n code += \" int y_c = Y * stride.y - padding.y + ky;\\n\";\n code += \" bool outside_y = y_c < 0 || y_c >= src_size.y;\\n\";\n code += \" for (int kx = 0; kx < kernel_size.x; ++kx) {\\n\";\n code += \" int x_c = X * stride.x - padding.x + kx;\\n\";\n code += \" bool outside_x = x_c < 0 || x_c >= src_size.x;\\n\";\n code += \" if (!outside_x && !outside_y) {\\n\";\n code += \" FLT4 src = \" +\n src_tensor.Read3D(\"x_c\", \"y_c\", \"Z\", TextureAddressMode::DONT_CARE) +\n \";\\n\";\n if (output_indices) {\n code += \" if (src.x > maximum.x) {\\n\";\n code += \" indexes.x = index_counter;\\n\";\n code += \" maximum.x = src.x;\\n\";\n code += \" }\\n\";\n code += \" if (src.y > maximum.y) {\\n\";\n code += \" indexes.y = index_counter;\\n\";\n code += \" maximum.y = src.y;\\n\";\n code += \" }\\n\";\n code += \" if (src.z > maximum.z) {\\n\";\n code += \" indexes.z = index_counter;\\n\";\n code += \" maximum.z = src.z;\\n\";\n code += \" }\\n\";\n code += \" if (src.w > maximum.w) {\\n\";\n code += \" indexes.w = index_counter;\\n\";\n code += \" maximum.w = src.w;\\n\";\n code += \" }\\n\";\n code += \" index_counter += (FLT)(1.0f);\\n\";\n }\n code += \" maximum = max(src, maximum);\\n\";\n code += \" };\\n\";\n code += \" }\\n\";\n code += \" }\\n\";\n const LinkingContext context{\"maximum\", \"X\", \"Y\", \"Z\"};\n code += PostProcess(linked_operations, context);\n code += \" \" + dst_tensor.Write3D(\"maximum\", \"X\", \"Y\", \"Z\");\n if (output_indices) {\n code += \" \" + indices_tensor.Write3D(\"indexes\", \"X\", \"Y\", \"Z\");\n }\n code += \"}\\n\";\n\n return code;\n}\n\n} \/\/ namespace\n\nPooling::Pooling(const OperationDef& definition,\n const Pooling2DAttributes& attr)\n : GPUOperation(definition),\n stride_(attr.strides.w, attr.strides.h),\n padding_(attr.padding.prepended.w, attr.padding.prepended.h),\n kernel_size_(attr.kernel.w, attr.kernel.h),\n type_(attr.type),\n output_indices_(attr.output_indices) {}\n\nPooling::Pooling(Pooling&& kernel)\n : GPUOperation(std::move(kernel)),\n stride_(kernel.stride_),\n padding_(kernel.padding_),\n kernel_size_(kernel.kernel_size_),\n type_(kernel.type_),\n output_indices_(kernel.output_indices_),\n kernel_(std::move(kernel.kernel_)),\n work_group_size_(kernel.work_group_size_) {}\n\nPooling& Pooling::operator=(Pooling&& kernel) {\n if (this != &kernel) {\n std::swap(stride_, kernel.stride_);\n std::swap(padding_, kernel.padding_);\n std::swap(kernel_size_, kernel.kernel_size_);\n std::swap(type_, kernel.type_);\n std::swap(output_indices_, kernel.output_indices_);\n kernel_ = std::move(kernel.kernel_);\n std::swap(work_group_size_, kernel.work_group_size_);\n GPUOperation::operator=(std::move(kernel));\n }\n return *this;\n}\n\nStatus Pooling::Compile(const CreationContext& creation_context) {\n std::string code;\n switch (type_) {\n case PoolingType::AVERAGE:\n code = GetAveragePoolingKernelCode(\n definition_.src_tensors[0], definition_.dst_tensors[0],\n definition_.precision, *creation_context.device, linked_operations_);\n break;\n case PoolingType::MAX:\n code = GetMaxPoolingKernelCode(\n definition_.src_tensors[0], definition_.dst_tensors[0],\n definition_.precision, linked_operations_, output_indices_);\n break;\n default:\n return InvalidArgumentError(\n \"You should create another kernel with this params\");\n break;\n }\n return creation_context.cache->GetOrCreateCLKernel(\n code, \"main_function\", *creation_context.context,\n *creation_context.device, &kernel_);\n}\n\nStatus Pooling::BindArguments() {\n kernel_.ResetBindingCounter();\n RETURN_IF_ERROR(kernel_.SetMemoryAuto(src_[0]->GetMemoryPtr()));\n RETURN_IF_ERROR(BindArgs(&kernel_, linked_operations_));\n RETURN_IF_ERROR(kernel_.SetMemoryAuto(dst_[0]->GetMemoryPtrForWriting()));\n if (output_indices_) {\n RETURN_IF_ERROR(kernel_.SetMemoryAuto(dst_[1]->GetMemoryPtrForWriting()));\n }\n RETURN_IF_ERROR(kernel_.SetBytesAuto(src_[0]->GetSizeWithDepth()));\n RETURN_IF_ERROR(kernel_.SetBytesAuto(dst_[0]->GetSizeWithDepth()));\n RETURN_IF_ERROR(kernel_.SetBytesAuto(kernel_size_));\n RETURN_IF_ERROR(kernel_.SetBytesAuto(padding_));\n RETURN_IF_ERROR(kernel_.SetBytesAuto(stride_));\n\n return OkStatus();\n}\n\nint3 Pooling::GetGridSize() const {\n const int grid_x = dst_[0]->Width();\n const int grid_y = dst_[0]->Height();\n const int grid_z = dst_[0]->Depth();\n return int3(grid_x, grid_y, grid_z);\n}\n\nStatus Pooling::Tune(const TuningParameters& params) {\n RETURN_IF_ERROR(BindArguments());\n return GetBestWorkGroup(params, kernel_, GetGridSize(), &work_group_size_);\n}\n\nStatus Pooling::AddToQueue(CLCommandQueue* queue) {\n RETURN_IF_ERROR(BindArguments());\n return queue->DispatchImplicit(kernel_, GetGridSize(), work_group_size_);\n}\n\nPooling CreatePooling(const OperationDef& definition,\n const Pooling2DAttributes& attr) {\n return Pooling(definition, attr);\n}\n\n} \/\/ namespace cl\n} \/\/ namespace gpu\n} \/\/ namespace tflite\n<commit_msg>Batch support for Pooling.<commit_after>\/* Copyright 2019 The TensorFlow Authors. All Rights Reserved.\n\nLicensed under the Apache License, Version 2.0 (the \"License\");\nyou may not use this file except in compliance with the License.\nYou may obtain a copy of the License at\n\n http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n\nUnless required by applicable law or agreed to in writing, software\ndistributed under the License is distributed on an \"AS IS\" BASIS,\nWITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\nSee the License for the specific language governing permissions and\nlimitations under the License.\n==============================================================================*\/\n\n#include \"tensorflow\/lite\/delegates\/gpu\/cl\/kernels\/pooling.h\"\n\n#include <string>\n\n#include \"tensorflow\/lite\/delegates\/gpu\/cl\/kernels\/util.h\"\n#include \"tensorflow\/lite\/delegates\/gpu\/cl\/kernels\/work_group_picking.h\"\n\nnamespace tflite {\nnamespace gpu {\nnamespace cl {\nnamespace {\n\nstd::string GetAveragePoolingKernelCode(\n const OperationDef& op_def, bool stride_correction, const CLDevice& device,\n const std::vector<ElementwiseOperation*>& linked_operations) {\n TensorCodeGenerator src_tensor(\"src_data\",\n {\"src_size.x\", \"src_size.y\", \"src_size.z\"},\n op_def.src_tensors[0]);\n TensorCodeGenerator dst_tensor(\"dst_data\",\n {\"dst_size.x\", \"dst_size.y\", \"dst_size.z\"},\n op_def.dst_tensors[0]);\n\n const auto address_mode = GetFastestZeroMode(device);\n\n std::string c = GetCommonDefines(op_def.precision);\n\n const bool manual_clamp =\n op_def.src_tensors[0].storage_type == TensorStorageType::BUFFER ||\n op_def.src_tensors[0].storage_type == TensorStorageType::IMAGE_BUFFER;\n\n c += \"__kernel void main_function(\\n\";\n c += src_tensor.GetDeclaration(AccessType::READ);\n c += GetArgsDeclaration(linked_operations);\n c += dst_tensor.GetDeclaration(AccessType::WRITE) + \",\\n\";\n c += \" int4 src_size, \\n\";\n c += \" int4 dst_size, \\n\";\n c += \" int2 kernel_size, \\n\";\n c += \" int2 padding, \\n\";\n c += \" int2 stride \\n\";\n c += \") {\\n\";\n c += \" int X = get_global_id(0);\\n\";\n c += \" int Y = get_global_id(1);\\n\";\n c += \" int Z = get_global_id(2);\\n\";\n c += \" if (X >= dst_size.x || Y >= dst_size.y || Z >= dst_size.z) return;\\n\";\n c += \" float4 r = (float4)(0.0f);\\n\";\n c += \" float window_size = 0.0;\\n\";\n if (stride_correction) {\n c += \" int xs = \" +\n GetXStrideCorrected(\"X\", \"src_size.w\", \"stride.x\", \"padding.x\") +\n \";\\n\";\n } else {\n c += \" int xs = X * stride.x + padding.x;\\n\";\n }\n c += \" int ys = Y * stride.y + padding.y;\\n\";\n c += \" for (int ky = 0; ky < kernel_size.y; ++ky) {\\n\";\n c += \" int y_c = ys + ky;\\n\";\n c += \" bool outside_y = y_c < 0 || y_c >= src_size.y;\\n\";\n c += \" for (int kx = 0; kx < kernel_size.x; ++kx) {\\n\";\n if (op_def.batch_support) {\n c += \" int x_c = xs + kx * src_size.w;\\n\";\n } else {\n c += \" int x_c = xs + kx;\\n\";\n }\n c += \" bool outside = outside_y || x_c < 0 || x_c >= src_size.x;\\n\";\n if (manual_clamp) {\n c += \" r += !outside ? \" +\n src_tensor.ReadAsFloat3D(\"x_c\", \"y_c\", \"Z\",\n TextureAddressMode::DONT_CARE) +\n \" : (float4)(0.0f);\\n\";\n } else {\n c += \" r += \" +\n src_tensor.ReadAsFloat3D(\"x_c\", \"y_c\", \"Z\", address_mode) + \";\\n\";\n }\n c += \" window_size += !outside ? 1.0 : 0.0;\\n\";\n c += \" }\\n\";\n c += \" }\\n\";\n \/\/ If window_size==0, window covered nothing. This situation is a sign of\n \/\/ incorrectly constructed operation. NaNs are expected as output.\n c += \" FLT4 result = TO_FLT4(r \/ window_size);\\n\";\n const LinkingContext context{\"result\", \"X\", \"Y\", \"Z\"};\n c += PostProcess(linked_operations, context);\n c += \" \" + dst_tensor.Write3D(\"result\", \"X\", \"Y\", \"Z\");\n c += \"}\\n\";\n\n return c;\n}\n\nstd::string GetMaxPoolingKernelCode(\n const OperationDef& op_def, bool stride_correction,\n const std::vector<ElementwiseOperation*>& linked_operations,\n bool output_indices) {\n TensorCodeGenerator src_tensor(\"src_data\",\n {\"src_size.x\", \"src_size.y\", \"src_size.z\"},\n op_def.src_tensors[0]);\n TensorCodeGenerator dst_tensor(\"dst_data\",\n {\"dst_size.x\", \"dst_size.y\", \"dst_size.z\"},\n op_def.dst_tensors[0]);\n TensorCodeGenerator indices_tensor(\"dst_indices\",\n {\"dst_size.x\", \"dst_size.y\", \"dst_size.z\"},\n op_def.dst_tensors[1]);\n\n std::string c = GetCommonDefines(op_def.precision);\n\n c += \"__kernel void main_function(\\n\";\n c += src_tensor.GetDeclaration(AccessType::READ);\n c += GetArgsDeclaration(linked_operations);\n c += dst_tensor.GetDeclaration(AccessType::WRITE) + \",\\n\";\n if (output_indices) {\n c += indices_tensor.GetDeclaration(AccessType::WRITE) + \",\\n\";\n }\n c += \" int4 src_size, \\n\";\n c += \" int4 dst_size, \\n\";\n c += \" int2 kernel_size, \\n\";\n c += \" int2 padding, \\n\";\n c += \" int2 stride \\n\";\n c += \") {\\n\";\n c += \" int X = get_global_id(0);\\n\";\n c += \" int Y = get_global_id(1);\\n\";\n c += \" int Z = get_global_id(2);\\n\";\n c +=\n \" if (X >= dst_size.x || Y >= dst_size.y || Z >= dst_size.z) return; \\n\";\n c += \" FLT4 maximum = (FLT4)(-10000.0f);\\n\";\n if (output_indices) {\n c += \" FLT4 indexes = (FLT4)(0.0f);\\n\";\n c += \" FLT index_counter = (FLT)(0.1f);\\n\";\n }\n if (stride_correction) {\n c += \" int xs = \" +\n GetXStrideCorrected(\"X\", \"src_size.w\", \"stride.x\", \"padding.x\") +\n \";\\n\";\n } else {\n c += \" int xs = X * stride.x + padding.x;\\n\";\n }\n c += \" int ys = Y * stride.y + padding.y;\\n\";\n c += \" for (int ky = 0; ky < kernel_size.y; ++ky) {\\n\";\n c += \" int y_c = ys + ky;\\n\";\n c += \" bool outside_y = y_c < 0 || y_c >= src_size.y;\\n\";\n c += \" for (int kx = 0; kx < kernel_size.x; ++kx) {\\n\";\n if (op_def.batch_support) {\n c += \" int x_c = xs + kx * src_size.w;\\n\";\n } else {\n c += \" int x_c = xs + kx;\\n\";\n }\n c += \" bool outside_x = x_c < 0 || x_c >= src_size.x;\\n\";\n c += \" if (!outside_x && !outside_y) {\\n\";\n c += \" FLT4 src = \" +\n src_tensor.Read3D(\"x_c\", \"y_c\", \"Z\", TextureAddressMode::DONT_CARE) +\n \";\\n\";\n if (output_indices) {\n c += \" if (src.x > maximum.x) {\\n\";\n c += \" indexes.x = index_counter;\\n\";\n c += \" maximum.x = src.x;\\n\";\n c += \" }\\n\";\n c += \" if (src.y > maximum.y) {\\n\";\n c += \" indexes.y = index_counter;\\n\";\n c += \" maximum.y = src.y;\\n\";\n c += \" }\\n\";\n c += \" if (src.z > maximum.z) {\\n\";\n c += \" indexes.z = index_counter;\\n\";\n c += \" maximum.z = src.z;\\n\";\n c += \" }\\n\";\n c += \" if (src.w > maximum.w) {\\n\";\n c += \" indexes.w = index_counter;\\n\";\n c += \" maximum.w = src.w;\\n\";\n c += \" }\\n\";\n c += \" index_counter += (FLT)(1.0f);\\n\";\n }\n c += \" maximum = max(src, maximum);\\n\";\n c += \" };\\n\";\n c += \" }\\n\";\n c += \" }\\n\";\n const LinkingContext context{\"maximum\", \"X\", \"Y\", \"Z\"};\n c += PostProcess(linked_operations, context);\n c += \" \" + dst_tensor.Write3D(\"maximum\", \"X\", \"Y\", \"Z\");\n if (output_indices) {\n c += \" \" + indices_tensor.Write3D(\"indexes\", \"X\", \"Y\", \"Z\");\n }\n c += \"}\\n\";\n\n return c;\n}\n\n} \/\/ namespace\n\nPooling::Pooling(const OperationDef& definition,\n const Pooling2DAttributes& attr)\n : GPUOperation(definition),\n stride_(attr.strides.w, attr.strides.h),\n padding_(-attr.padding.prepended.w, -attr.padding.prepended.h),\n kernel_size_(attr.kernel.w, attr.kernel.h),\n type_(attr.type),\n output_indices_(attr.output_indices) {}\n\nPooling::Pooling(Pooling&& kernel)\n : GPUOperation(std::move(kernel)),\n stride_(kernel.stride_),\n padding_(kernel.padding_),\n kernel_size_(kernel.kernel_size_),\n type_(kernel.type_),\n output_indices_(kernel.output_indices_),\n kernel_(std::move(kernel.kernel_)),\n work_group_size_(kernel.work_group_size_) {}\n\nPooling& Pooling::operator=(Pooling&& kernel) {\n if (this != &kernel) {\n std::swap(stride_, kernel.stride_);\n std::swap(padding_, kernel.padding_);\n std::swap(kernel_size_, kernel.kernel_size_);\n std::swap(type_, kernel.type_);\n std::swap(output_indices_, kernel.output_indices_);\n kernel_ = std::move(kernel.kernel_);\n std::swap(work_group_size_, kernel.work_group_size_);\n GPUOperation::operator=(std::move(kernel));\n }\n return *this;\n}\n\nStatus Pooling::Compile(const CreationContext& creation_context) {\n std::string code;\n const bool stride_correction = definition_.batch_support && stride_.x != 1;\n switch (type_) {\n case PoolingType::AVERAGE:\n code = GetAveragePoolingKernelCode(definition_, stride_correction,\n *creation_context.device,\n linked_operations_);\n break;\n case PoolingType::MAX:\n code = GetMaxPoolingKernelCode(definition_, stride_correction,\n linked_operations_, output_indices_);\n break;\n default:\n return InvalidArgumentError(\n \"You should create another kernel with this params\");\n break;\n }\n return creation_context.cache->GetOrCreateCLKernel(\n code, \"main_function\", *creation_context.context,\n *creation_context.device, &kernel_);\n}\n\nStatus Pooling::BindArguments() {\n kernel_.ResetBindingCounter();\n RETURN_IF_ERROR(kernel_.SetMemoryAuto(src_[0]->GetMemoryPtr()));\n RETURN_IF_ERROR(BindArgs(&kernel_, linked_operations_));\n RETURN_IF_ERROR(kernel_.SetMemoryAuto(dst_[0]->GetMemoryPtrForWriting()));\n if (output_indices_) {\n RETURN_IF_ERROR(kernel_.SetMemoryAuto(dst_[1]->GetMemoryPtrForWriting()));\n }\n RETURN_IF_ERROR(kernel_.SetBytesAuto(src_[0]->GetWBatchedHDB()));\n RETURN_IF_ERROR(kernel_.SetBytesAuto(dst_[0]->GetWBatchedHDB()));\n RETURN_IF_ERROR(kernel_.SetBytesAuto(kernel_size_));\n RETURN_IF_ERROR(\n kernel_.SetBytesAuto(int2(padding_.x * src_[0]->Batch(), padding_.y)));\n RETURN_IF_ERROR(kernel_.SetBytesAuto(stride_));\n\n return OkStatus();\n}\n\nint3 Pooling::GetGridSize() const {\n const int grid_x = dst_[0]->Width() * dst_[0]->Batch();\n const int grid_y = dst_[0]->Height();\n const int grid_z = dst_[0]->Depth();\n return int3(grid_x, grid_y, grid_z);\n}\n\nStatus Pooling::Tune(const TuningParameters& params) {\n RETURN_IF_ERROR(BindArguments());\n return GetBestWorkGroup(params, kernel_, GetGridSize(), &work_group_size_);\n}\n\nStatus Pooling::AddToQueue(CLCommandQueue* queue) {\n RETURN_IF_ERROR(BindArguments());\n return queue->DispatchImplicit(kernel_, GetGridSize(), work_group_size_);\n}\n\nPooling CreatePooling(const OperationDef& definition,\n const Pooling2DAttributes& attr) {\n return Pooling(definition, attr);\n}\n\n} \/\/ namespace cl\n} \/\/ namespace gpu\n} \/\/ namespace tflite\n<|endoftext|>"} {"text":"<commit_before>\n\n#include \"Globals.h\"\n\n#include \"IncrementalRedstoneSimulator.h\"\n#include \"Chunk.h\"\n\n#include \"CommandBlockHandler.h\"\n#include \"DoorHandler.h\"\n#include \"RedstoneHandler.h\"\n#include \"RedstoneTorchHandler.h\"\n#include \"RedstoneWireHandler.h\"\n#include \"RedstoneRepeaterHandler.h\"\n#include \"RedstoneToggleHandler.h\"\n#include \"SolidBlockHandler.h\"\n#include \"RedstoneLampHandler.h\"\n#include \"RedstoneBlockHandler.h\"\n#include \"PistonHandler.h\"\n#include \"SmallGateHandler.h\"\n#include \"NoteBlockHandler.h\"\n#include \"TNTHandler.h\"\n#include \"PoweredRailHandler.h\"\n#include \"PressurePlateHandler.h\"\n#include \"TripwireHookHandler.h\"\n#include \"DropSpenserHandler.h\"\n#include \"RedstoneComparatorHandler.h\"\n#include \"TrappedChestHandler.h\"\n\n\n\n\n\nstd::unique_ptr<cRedstoneHandler> cIncrementalRedstoneSimulator::CreateComponent(cWorld & a_World, BLOCKTYPE a_BlockType, cIncrementalRedstoneSimulatorChunkData * a_Data)\n{\n\tswitch (a_BlockType)\n\t{\n\t\tcase E_BLOCK_ACTIVATOR_RAIL:\n\t\tcase E_BLOCK_DETECTOR_RAIL:\n\t\tcase E_BLOCK_POWERED_RAIL: return cpp14::make_unique<cPoweredRailHandler>(a_World);\n\n\t\tcase E_BLOCK_ACTIVE_COMPARATOR:\n\t\tcase E_BLOCK_INACTIVE_COMPARATOR: return cpp14::make_unique<cRedstoneComparatorHandler>(a_World);\n\n\t\tcase E_BLOCK_DISPENSER:\n\t\tcase E_BLOCK_DROPPER: return cpp14::make_unique<cDropSpenserHandler>(a_World);\n\n\t\tcase E_BLOCK_HEAVY_WEIGHTED_PRESSURE_PLATE:\n\t\tcase E_BLOCK_LIGHT_WEIGHTED_PRESSURE_PLATE:\n\t\tcase E_BLOCK_STONE_PRESSURE_PLATE:\n\t\tcase E_BLOCK_WOODEN_PRESSURE_PLATE: return cpp14::make_unique<cPressurePlateHandler>(a_World);\n\n\t\tcase E_BLOCK_FENCE_GATE:\n\t\tcase E_BLOCK_IRON_TRAPDOOR:\n\t\tcase E_BLOCK_TRAPDOOR: return cpp14::make_unique<cSmallGateHandler>(a_World);\n\n\t\tcase E_BLOCK_REDSTONE_LAMP_OFF:\n\t\tcase E_BLOCK_REDSTONE_LAMP_ON: return cpp14::make_unique<cRedstoneLampHandler>(a_World);\n\n\t\tcase E_BLOCK_REDSTONE_REPEATER_OFF:\n\t\tcase E_BLOCK_REDSTONE_REPEATER_ON: return cpp14::make_unique<cRedstoneRepeaterHandler>(a_World);\n\n\t\tcase E_BLOCK_REDSTONE_TORCH_OFF:\n\t\tcase E_BLOCK_REDSTONE_TORCH_ON: return cpp14::make_unique<cRedstoneTorchHandler>(a_World);\n\n\t\tcase E_BLOCK_PISTON:\n\t\tcase E_BLOCK_STICKY_PISTON: return cpp14::make_unique<cPistonHandler>(a_World);\n\n\t\tcase E_BLOCK_LEVER:\n\t\tcase E_BLOCK_STONE_BUTTON:\n\t\tcase E_BLOCK_WOODEN_BUTTON: return cpp14::make_unique<cRedstoneToggleHandler>(a_World);\n\n\t\tcase E_BLOCK_BLOCK_OF_REDSTONE: return cpp14::make_unique<cRedstoneBlockHandler>(a_World);\n\t\tcase E_BLOCK_COMMAND_BLOCK: return cpp14::make_unique<cCommandBlockHandler>(a_World);\n\t\tcase E_BLOCK_NOTE_BLOCK: return cpp14::make_unique<cNoteBlockHandler>(a_World);\n\t\tcase E_BLOCK_REDSTONE_WIRE: return cpp14::make_unique<cRedstoneWireHandler>(a_World);\n\t\tcase E_BLOCK_TNT: return cpp14::make_unique<cTNTHandler>(a_World);\n\t\tcase E_BLOCK_TRAPPED_CHEST: return cpp14::make_unique<cTrappedChestHandler>(a_World);\n\t\tcase E_BLOCK_TRIPWIRE_HOOK: return cpp14::make_unique<cTripwireHookHandler>(a_World);\n\t\tdefault:\n\t\t{\n\t\t\tif (cBlockDoorHandler::IsDoorBlockType(a_BlockType))\n\t\t\t{\n\t\t\t\treturn cpp14::make_unique<cDoorHandler>(a_World);\n\t\t\t}\n\n\t\t\tif (cBlockInfo::FullyOccupiesVoxel(a_BlockType))\n\t\t\t{\n\t\t\t\treturn cpp14::make_unique<cSolidBlockHandler>(a_World);\n\t\t\t}\n\t\t\treturn nullptr;\n\t\t}\n\t}\n}\n\n\n\n\n\nvoid cIncrementalRedstoneSimulator::Simulate(float a_dt)\n{\n\tfor (auto & DelayInfo : m_Data.m_MechanismDelays)\n\t{\n\t\tif ((--DelayInfo.second.first) == 0)\n\t\t{\n\t\t\tm_Data.GetActiveBlocks().emplace_back(DelayInfo.first);\n\t\t}\n\t}\n\n\t\/\/ Build our work queue\n\tcVector3iArray WorkQueue;\n\tstd::swap(WorkQueue, m_Data.GetActiveBlocks());\n\n\t\/\/ Process the work queue\n\twhile (!WorkQueue.empty())\n\t{\n\t\t\/\/ Grab the first element and remove it from the list\n\t\tVector3i CurrentLocation = WorkQueue.back();\n\t\tWorkQueue.pop_back();\n\n\t\tBLOCKTYPE CurrentBlock;\n\t\tNIBBLETYPE CurrentMeta;\n\t\tif (!m_World.GetBlockTypeMeta(CurrentLocation.x, CurrentLocation.y, CurrentLocation.z, CurrentBlock, CurrentMeta))\n\t\t{\n\t\t\tcontinue;\n\t\t}\n\n\t\tauto CurrentHandler = cIncrementalRedstoneSimulator::CreateComponent(m_World, CurrentBlock, &m_Data);\n\t\tif (CurrentHandler == nullptr) \/\/ Block at CurrentPosition doesn't have a corresponding redstone handler\n\t\t{\n\t\t\t\/\/ Clean up cached PowerData for CurrentPosition\n\t\t\tstatic_cast<cIncrementalRedstoneSimulator *>(m_World.GetRedstoneSimulator())->GetChunkData()->ErasePowerData(CurrentLocation);\n\n\t\t\tcontinue;\n\t\t}\n\n\t\tcRedstoneHandler::PoweringData Power;\n\t\tfor (const auto & Location : CurrentHandler->GetValidSourcePositions(CurrentLocation, CurrentBlock, CurrentMeta))\n\t\t{\n\t\t\tif (!cChunk::IsValidHeight(Location.y))\n\t\t\t{\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t\tBLOCKTYPE PotentialBlock;\n\t\t\tNIBBLETYPE PotentialMeta;\n\t\t\tm_World.GetBlockTypeMeta(Location.x, Location.y, Location.z, PotentialBlock, PotentialMeta);\n\n\t\t\tauto PotentialSourceHandler = cIncrementalRedstoneSimulator::CreateComponent(m_World, PotentialBlock, &m_Data);\n\t\t\tif (PotentialSourceHandler == nullptr)\n\t\t\t{\n\t\t\t\tcontinue;\n\t\t\t}\n\n\t\t\tdecltype(Power) PotentialPower(PotentialBlock, PotentialSourceHandler->GetPowerDeliveredToPosition(Location, PotentialBlock, PotentialMeta, CurrentLocation, CurrentBlock));\n\t\t\tPower = std::max(Power, PotentialPower);\n\t\t}\n\n\t\t\/\/ Inform the handler to update\n\t\tcVector3iArray Updates = CurrentHandler->Update(CurrentLocation, CurrentBlock, CurrentMeta, Power);\n\t\tWorkQueue.insert(WorkQueue.end(), Updates.begin(), Updates.end());\n\n\t\tif (IsAlwaysTicked(CurrentBlock))\n\t\t{\n\t\t\tm_Data.GetActiveBlocks().emplace_back(CurrentLocation);\n\t\t}\n\t}\n}\n<commit_msg>Fix fence gates (#3683)<commit_after>\n\n#include \"Globals.h\"\n\n#include \"IncrementalRedstoneSimulator.h\"\n#include \"Chunk.h\"\n\n#include \"CommandBlockHandler.h\"\n#include \"DoorHandler.h\"\n#include \"RedstoneHandler.h\"\n#include \"RedstoneTorchHandler.h\"\n#include \"RedstoneWireHandler.h\"\n#include \"RedstoneRepeaterHandler.h\"\n#include \"RedstoneToggleHandler.h\"\n#include \"SolidBlockHandler.h\"\n#include \"RedstoneLampHandler.h\"\n#include \"RedstoneBlockHandler.h\"\n#include \"PistonHandler.h\"\n#include \"SmallGateHandler.h\"\n#include \"NoteBlockHandler.h\"\n#include \"TNTHandler.h\"\n#include \"PoweredRailHandler.h\"\n#include \"PressurePlateHandler.h\"\n#include \"TripwireHookHandler.h\"\n#include \"DropSpenserHandler.h\"\n#include \"RedstoneComparatorHandler.h\"\n#include \"TrappedChestHandler.h\"\n\n\n\n\n\nstd::unique_ptr<cRedstoneHandler> cIncrementalRedstoneSimulator::CreateComponent(cWorld & a_World, BLOCKTYPE a_BlockType, cIncrementalRedstoneSimulatorChunkData * a_Data)\n{\n\tswitch (a_BlockType)\n\t{\n\t\tcase E_BLOCK_ACTIVATOR_RAIL:\n\t\tcase E_BLOCK_DETECTOR_RAIL:\n\t\tcase E_BLOCK_POWERED_RAIL: return cpp14::make_unique<cPoweredRailHandler>(a_World);\n\n\t\tcase E_BLOCK_ACTIVE_COMPARATOR:\n\t\tcase E_BLOCK_INACTIVE_COMPARATOR: return cpp14::make_unique<cRedstoneComparatorHandler>(a_World);\n\n\t\tcase E_BLOCK_DISPENSER:\n\t\tcase E_BLOCK_DROPPER: return cpp14::make_unique<cDropSpenserHandler>(a_World);\n\n\t\tcase E_BLOCK_HEAVY_WEIGHTED_PRESSURE_PLATE:\n\t\tcase E_BLOCK_LIGHT_WEIGHTED_PRESSURE_PLATE:\n\t\tcase E_BLOCK_STONE_PRESSURE_PLATE:\n\t\tcase E_BLOCK_WOODEN_PRESSURE_PLATE: return cpp14::make_unique<cPressurePlateHandler>(a_World);\n\n\t\tcase E_BLOCK_ACACIA_FENCE_GATE:\n\t\tcase E_BLOCK_BIRCH_FENCE_GATE:\n\t\tcase E_BLOCK_DARK_OAK_FENCE_GATE:\n\t\tcase E_BLOCK_FENCE_GATE:\n\t\tcase E_BLOCK_IRON_TRAPDOOR:\n\t\tcase E_BLOCK_JUNGLE_FENCE_GATE:\n\t\tcase E_BLOCK_SPRUCE_FENCE_GATE:\n\t\tcase E_BLOCK_TRAPDOOR: return cpp14::make_unique<cSmallGateHandler>(a_World);\n\n\t\tcase E_BLOCK_REDSTONE_LAMP_OFF:\n\t\tcase E_BLOCK_REDSTONE_LAMP_ON: return cpp14::make_unique<cRedstoneLampHandler>(a_World);\n\n\t\tcase E_BLOCK_REDSTONE_REPEATER_OFF:\n\t\tcase E_BLOCK_REDSTONE_REPEATER_ON: return cpp14::make_unique<cRedstoneRepeaterHandler>(a_World);\n\n\t\tcase E_BLOCK_REDSTONE_TORCH_OFF:\n\t\tcase E_BLOCK_REDSTONE_TORCH_ON: return cpp14::make_unique<cRedstoneTorchHandler>(a_World);\n\n\t\tcase E_BLOCK_PISTON:\n\t\tcase E_BLOCK_STICKY_PISTON: return cpp14::make_unique<cPistonHandler>(a_World);\n\n\t\tcase E_BLOCK_LEVER:\n\t\tcase E_BLOCK_STONE_BUTTON:\n\t\tcase E_BLOCK_WOODEN_BUTTON: return cpp14::make_unique<cRedstoneToggleHandler>(a_World);\n\n\t\tcase E_BLOCK_BLOCK_OF_REDSTONE: return cpp14::make_unique<cRedstoneBlockHandler>(a_World);\n\t\tcase E_BLOCK_COMMAND_BLOCK: return cpp14::make_unique<cCommandBlockHandler>(a_World);\n\t\tcase E_BLOCK_NOTE_BLOCK: return cpp14::make_unique<cNoteBlockHandler>(a_World);\n\t\tcase E_BLOCK_REDSTONE_WIRE: return cpp14::make_unique<cRedstoneWireHandler>(a_World);\n\t\tcase E_BLOCK_TNT: return cpp14::make_unique<cTNTHandler>(a_World);\n\t\tcase E_BLOCK_TRAPPED_CHEST: return cpp14::make_unique<cTrappedChestHandler>(a_World);\n\t\tcase E_BLOCK_TRIPWIRE_HOOK: return cpp14::make_unique<cTripwireHookHandler>(a_World);\n\t\tdefault:\n\t\t{\n\t\t\tif (cBlockDoorHandler::IsDoorBlockType(a_BlockType))\n\t\t\t{\n\t\t\t\treturn cpp14::make_unique<cDoorHandler>(a_World);\n\t\t\t}\n\n\t\t\tif (cBlockInfo::FullyOccupiesVoxel(a_BlockType))\n\t\t\t{\n\t\t\t\treturn cpp14::make_unique<cSolidBlockHandler>(a_World);\n\t\t\t}\n\t\t\treturn nullptr;\n\t\t}\n\t}\n}\n\n\n\n\n\nvoid cIncrementalRedstoneSimulator::Simulate(float a_dt)\n{\n\tfor (auto & DelayInfo : m_Data.m_MechanismDelays)\n\t{\n\t\tif ((--DelayInfo.second.first) == 0)\n\t\t{\n\t\t\tm_Data.GetActiveBlocks().emplace_back(DelayInfo.first);\n\t\t}\n\t}\n\n\t\/\/ Build our work queue\n\tcVector3iArray WorkQueue;\n\tstd::swap(WorkQueue, m_Data.GetActiveBlocks());\n\n\t\/\/ Process the work queue\n\twhile (!WorkQueue.empty())\n\t{\n\t\t\/\/ Grab the first element and remove it from the list\n\t\tVector3i CurrentLocation = WorkQueue.back();\n\t\tWorkQueue.pop_back();\n\n\t\tBLOCKTYPE CurrentBlock;\n\t\tNIBBLETYPE CurrentMeta;\n\t\tif (!m_World.GetBlockTypeMeta(CurrentLocation.x, CurrentLocation.y, CurrentLocation.z, CurrentBlock, CurrentMeta))\n\t\t{\n\t\t\tcontinue;\n\t\t}\n\n\t\tauto CurrentHandler = cIncrementalRedstoneSimulator::CreateComponent(m_World, CurrentBlock, &m_Data);\n\t\tif (CurrentHandler == nullptr) \/\/ Block at CurrentPosition doesn't have a corresponding redstone handler\n\t\t{\n\t\t\t\/\/ Clean up cached PowerData for CurrentPosition\n\t\t\tstatic_cast<cIncrementalRedstoneSimulator *>(m_World.GetRedstoneSimulator())->GetChunkData()->ErasePowerData(CurrentLocation);\n\n\t\t\tcontinue;\n\t\t}\n\n\t\tcRedstoneHandler::PoweringData Power;\n\t\tfor (const auto & Location : CurrentHandler->GetValidSourcePositions(CurrentLocation, CurrentBlock, CurrentMeta))\n\t\t{\n\t\t\tif (!cChunk::IsValidHeight(Location.y))\n\t\t\t{\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t\tBLOCKTYPE PotentialBlock;\n\t\t\tNIBBLETYPE PotentialMeta;\n\t\t\tm_World.GetBlockTypeMeta(Location.x, Location.y, Location.z, PotentialBlock, PotentialMeta);\n\n\t\t\tauto PotentialSourceHandler = cIncrementalRedstoneSimulator::CreateComponent(m_World, PotentialBlock, &m_Data);\n\t\t\tif (PotentialSourceHandler == nullptr)\n\t\t\t{\n\t\t\t\tcontinue;\n\t\t\t}\n\n\t\t\tdecltype(Power) PotentialPower(PotentialBlock, PotentialSourceHandler->GetPowerDeliveredToPosition(Location, PotentialBlock, PotentialMeta, CurrentLocation, CurrentBlock));\n\t\t\tPower = std::max(Power, PotentialPower);\n\t\t}\n\n\t\t\/\/ Inform the handler to update\n\t\tcVector3iArray Updates = CurrentHandler->Update(CurrentLocation, CurrentBlock, CurrentMeta, Power);\n\t\tWorkQueue.insert(WorkQueue.end(), Updates.begin(), Updates.end());\n\n\t\tif (IsAlwaysTicked(CurrentBlock))\n\t\t{\n\t\t\tm_Data.GetActiveBlocks().emplace_back(CurrentLocation);\n\t\t}\n\t}\n}\n<|endoftext|>"} {"text":"<commit_before>\/*\n * Copyright 2017-present Facebook, Inc.\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n *\/\n\n#include <thrift\/lib\/cpp2\/transport\/util\/ConnectionThread.h>\n\n#include <folly\/portability\/GFlags.h>\n#include <glog\/logging.h>\n\n#include <folly\/Conv.h>\n#include <thrift\/lib\/cpp\/async\/TAsyncSSLSocket.h>\n#include <thrift\/lib\/cpp\/async\/TAsyncSocket.h>\n#include <thrift\/lib\/cpp\/async\/TAsyncTransport.h>\n#include <thrift\/lib\/cpp2\/transport\/http2\/client\/H2ClientConnection.h>\n\nDEFINE_string(transport, \"http2\", \"The transport to use (http2)\");\nDEFINE_bool(use_ssl, false, \"Create an encrypted client connection\");\n\nnamespace apache {\nnamespace thrift {\n\nusing apache::thrift::async::TAsyncSocket;\nusing apache::thrift::async::TAsyncSSLSocket;\nusing apache::thrift::async::TAsyncTransport;\n\nConnectionThread::~ConnectionThread() {\n getEventBase()->runInEventBaseThreadAndWait(\n [&] { connections_.wlock()->clear(); });\n}\n\nstd::shared_ptr<ClientConnectionIf> ConnectionThread::getConnection(\n const std::string& addr,\n uint16_t port) {\n std::string serverKey = folly::to<std::string>(addr, \":\", port);\n getEventBase()->runInEventBaseThreadAndWait(\n [&]() { maybeCreateConnection(serverKey, addr, port); });\n return connections_.withWLock(\n [&](auto& connections) { return connections[serverKey]; });\n}\n\nvoid ConnectionThread::maybeCreateConnection(\n const std::string& serverKey,\n const std::string& addr,\n uint16_t port) {\n LOG_IF(FATAL, FLAGS_transport == \"rsocket\" || FLAGS_transport == \"rocket\")\n << \"Use RSocketClientChannel::newChannel() or\"\n \" RocketClientChannel::newChannel()\";\n\n connections_.withWLock([&, this](auto& connections) {\n std::shared_ptr<ClientConnectionIf>& connection = connections[serverKey];\n if (connection == nullptr || !connection->good()) {\n TAsyncSocket::UniquePtr socket(\n new TAsyncSocket(this->getEventBase(), addr, port));\n if (FLAGS_use_ssl) {\n auto sslContext = std::make_shared<folly::SSLContext>();\n sslContext->setAdvertisedNextProtocols({\"h2\", \"http\"});\n auto sslSocket = new TAsyncSSLSocket(\n sslContext,\n this->getEventBase(),\n socket->detachNetworkSocket().toFd(),\n false);\n sslSocket->sslConn(nullptr);\n socket.reset(sslSocket);\n }\n if (FLAGS_transport != \"http2\") {\n LOG(ERROR) << \"Unknown transport \" << FLAGS_transport\n << \". Will use http2.\";\n }\n connection = H2ClientConnection::newHTTP2Connection(std::move(socket));\n }\n });\n}\n\n} \/\/ namespace thrift\n} \/\/ namespace apache\n<commit_msg>Don't call setAdvertisedNextProtocols() if OpenSSL is too old<commit_after>\/*\n * Copyright 2017-present Facebook, Inc.\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n *\/\n\n#include <thrift\/lib\/cpp2\/transport\/util\/ConnectionThread.h>\n\n#include <folly\/portability\/GFlags.h>\n#include <glog\/logging.h>\n\n#include <folly\/Conv.h>\n#include <thrift\/lib\/cpp\/async\/TAsyncSSLSocket.h>\n#include <thrift\/lib\/cpp\/async\/TAsyncSocket.h>\n#include <thrift\/lib\/cpp\/async\/TAsyncTransport.h>\n#include <thrift\/lib\/cpp2\/transport\/http2\/client\/H2ClientConnection.h>\n\nDEFINE_string(transport, \"http2\", \"The transport to use (http2)\");\nDEFINE_bool(use_ssl, false, \"Create an encrypted client connection\");\n\nnamespace apache {\nnamespace thrift {\n\nusing apache::thrift::async::TAsyncSocket;\nusing apache::thrift::async::TAsyncSSLSocket;\nusing apache::thrift::async::TAsyncTransport;\n\nConnectionThread::~ConnectionThread() {\n getEventBase()->runInEventBaseThreadAndWait(\n [&] { connections_.wlock()->clear(); });\n}\n\nstd::shared_ptr<ClientConnectionIf> ConnectionThread::getConnection(\n const std::string& addr,\n uint16_t port) {\n std::string serverKey = folly::to<std::string>(addr, \":\", port);\n getEventBase()->runInEventBaseThreadAndWait(\n [&]() { maybeCreateConnection(serverKey, addr, port); });\n return connections_.withWLock(\n [&](auto& connections) { return connections[serverKey]; });\n}\n\nvoid ConnectionThread::maybeCreateConnection(\n const std::string& serverKey,\n const std::string& addr,\n uint16_t port) {\n LOG_IF(FATAL, FLAGS_transport == \"rsocket\" || FLAGS_transport == \"rocket\")\n << \"Use RSocketClientChannel::newChannel() or\"\n \" RocketClientChannel::newChannel()\";\n\n connections_.withWLock([&, this](auto& connections) {\n std::shared_ptr<ClientConnectionIf>& connection = connections[serverKey];\n if (connection == nullptr || !connection->good()) {\n TAsyncSocket::UniquePtr socket(\n new TAsyncSocket(this->getEventBase(), addr, port));\n if (FLAGS_use_ssl) {\n auto sslContext = std::make_shared<folly::SSLContext>();\n#if FOLLY_OPENSSL_HAS_ALPN\n sslContext->setAdvertisedNextProtocols({\"h2\", \"http\"});\n#endif\n auto sslSocket = new TAsyncSSLSocket(\n sslContext,\n this->getEventBase(),\n socket->detachNetworkSocket().toFd(),\n false);\n sslSocket->sslConn(nullptr);\n socket.reset(sslSocket);\n }\n if (FLAGS_transport != \"http2\") {\n LOG(ERROR) << \"Unknown transport \" << FLAGS_transport\n << \". Will use http2.\";\n }\n connection = H2ClientConnection::newHTTP2Connection(std::move(socket));\n }\n });\n}\n\n} \/\/ namespace thrift\n} \/\/ namespace apache\n<|endoftext|>"} {"text":"<commit_before>\/*\nUses the sound_play library of ROS to play sound on the OS' default sound driver. \nListening on:\n\t\/tawi\/motors\/wheels to geometry_msgs::Twist (directions to drive)\nPublishing on:\n\n*\/\n#include <threemxl\/platform\/io\/configuration\/XMLConfiguration.h>\n#include <threemxl\/dxlassert.h>\n#include <ros\/ros.h>\n#include <threemxl\/C3mxlROS.h>\n#include <geometry_msgs\/Twist.h>\n#include \"drivingDriver.h\"\n\nDrivingDriver::DrivingDriver() {\n\tDrivingDriver(99999);\n}\n\nDrivingDriver::DrivingDriver(int id){\n\tros::NodeHandle handle(\"~\");\n\tID = id;\n\tsub = handle.subscribe<geometry_msgs::Twist>(\"\/base\/cmd_vel\", 10, &DrivingDriver::driveCallback, this);\n\t\n\n\t\/\/Stolen code to set some things. No idea where to find the parameters...\t\n\n\tROS_ASSERT(handle.getParam(\"motor_port\", motor_port_name));\n\tROS_ASSERT(handle.getParam(\"motor_config\", motor_config_name));\n\tROS_ASSERT(handle.getParam(\"wheel_diameter\", wheelDiameter));\n\tROS_ASSERT(handle.getParam(\"wheel_base\", wheelBase));\n\/*\t\n\n\tmotor_port_name = \"motor_comm\";\n\tmotor_config_name = \"wheels.xml\";\n\twheelDiameter = 0.295;\n\twheelBase = 0.54;\n*\/\n\tROS_ASSERT(motor_config_xml.loadFile(motor_config_name));\n\n\t\/\/End of stolen code\n\n\tinitMotors();\n\t\n\tDXL_SAFE_CALL(left_motor->set3MxlMode(motor_config_left.m3mxlMode));\n\tDXL_SAFE_CALL(right_motor->set3MxlMode(motor_config_right.m3mxlMode));\n}\n\nvoid DrivingDriver::driveCallback(const geometry_msgs::Twist::ConstPtr &msg){\n\n\tROS_INFO(\"driveCallback\");\n\tdouble v_x = msg->linear.x\/(wheelDiameter\/2);\n\tdouble v_theta = msg->angular.z * (wheelBase\/wheelDiameter);\n\n\tdouble leftMotorVelocity = v_x - v_theta;\n\tdouble rightMotorVelocity = v_x + v_theta;\n\n\tleft_motor->set3MxlMode(SPEED_MODE);\n\tleft_motor->setSpeed(leftMotorVelocity);\n\tright_motor->set3MxlMode(SPEED_MODE);\n\tright_motor->setSpeed(rightMotorVelocity);\n\n}\n\nint DrivingDriver::getID() {\n\treturn ID;\n}\n\n\nint DrivingDriver::getState(){\n\treturn state;\n}\n\nbool DrivingDriver::setPower(int level){\n\tcurrentPower = level;\n}\n\nint DrivingDriver::getPower(){\n\treturn currentPower;\n}\n\nbool DrivingDriver::drive(){\n\t\n\n\n\treturn true;\n}\n\nbool DrivingDriver::stop() {\n\t\/\/dingen\n\treturn false;\n}\n\nvoid DrivingDriver::initMotors(){\n\tros::Rate init_rate(1);\n\t\n\tmotor_config_left.readConfig(motor_config_xml.root().section(\"left\"));\n\tleft_motor = new C3mxlROS(motor_port_name.c_str());\n\tleft_motor->setConfig(&motor_config_left);\n\n\twhile (ros::ok() && left_motor->init() != DXL_SUCCESS) {\n\t\tROS_WARN_ONCE(\"Couldn't initialize left wheel motor, will continue trying every second\");\n\t\tinit_rate.sleep();\n\t}\n\n\tmotor_config_right.readConfig(motor_config_xml.root().section(\"right\"));\n\tright_motor = new C3mxlROS(motor_port_name.c_str());\n\tright_motor->setConfig(&motor_config_right);\n\n\twhile (ros::ok() && right_motor->init() != DXL_SUCCESS) {\n\t\tROS_WARN_ONCE(\"Couldn't initialize right wheel motor, will continue trying every second\");\n\t\tinit_rate.sleep();\n\t}\n}\n\nvoid DrivingDriver::spin() {\n\tROS_INFO(\"Spinning\");\n\n\tros::Rate r(1000);\n\n\twhile(ros::ok()) {\n\t\tros::spinOnce();\n\t\tr.sleep();\n\t}\n}\n\nint main(int argc, char **argv)\n{\n\n\tros::init(argc, argv, \"drivingDriver\");\n\tDrivingDriver dd;\n\tdd.spin();\n\n\treturn 0;\n}<commit_msg>Minor cleanup in drivingDriver.cpp<commit_after>\/*\nUses the sound_play library of ROS to play sound on the OS' default sound driver. \nListening on:\n\t\/tawi\/motors\/wheels to geometry_msgs::Twist (directions to drive)\nPublishing on:\n\n*\/\n#include <threemxl\/platform\/io\/configuration\/XMLConfiguration.h>\n#include <threemxl\/dxlassert.h>\n#include <ros\/ros.h>\n#include <threemxl\/C3mxlROS.h>\n#include <geometry_msgs\/Twist.h>\n#include \"drivingDriver.h\"\n\nDrivingDriver::DrivingDriver() {\n\tDrivingDriver(99999);\n}\n\nDrivingDriver::DrivingDriver(int id){\n\tros::NodeHandle handle(\"~\");\n\tID = id;\n\tsub = handle.subscribe<geometry_msgs::Twist>(\"\/base\/cmd_vel\", 10, &DrivingDriver::driveCallback, this);\n\n\t\/\/Parameters set in launch file.\n\tROS_ASSERT(handle.getParam(\"motor_port\", motor_port_name));\n\tROS_ASSERT(handle.getParam(\"motor_config\", motor_config_name));\n\tROS_ASSERT(handle.getParam(\"wheel_diameter\", wheelDiameter));\n\tROS_ASSERT(handle.getParam(\"wheel_base\", wheelBase));\n\n\tROS_ASSERT(motor_config_xml.loadFile(motor_config_name));\n\n\tinitMotors();\n\t\n\tDXL_SAFE_CALL(left_motor->set3MxlMode(motor_config_left.m3mxlMode));\n\tDXL_SAFE_CALL(right_motor->set3MxlMode(motor_config_right.m3mxlMode));\n}\n\nvoid DrivingDriver::driveCallback(const geometry_msgs::Twist::ConstPtr &msg){\n\n\tROS_INFO(\"driveCallback\");\n\tdouble v_x = msg->linear.x\/(wheelDiameter\/2);\n\tdouble v_theta = msg->angular.z * (wheelBase\/wheelDiameter);\n\n\tdouble leftMotorVelocity = v_x - v_theta;\n\tdouble rightMotorVelocity = v_x + v_theta;\n\n\tleft_motor->set3MxlMode(SPEED_MODE);\n\tleft_motor->setSpeed(leftMotorVelocity);\n\tright_motor->set3MxlMode(SPEED_MODE);\n\tright_motor->setSpeed(rightMotorVelocity);\n\n}\n\nint DrivingDriver::getID() {\n\treturn ID;\n}\n\n\nint DrivingDriver::getState(){\n\treturn state;\n}\n\nbool DrivingDriver::setPower(int level){\n\tcurrentPower = level;\n}\n\nint DrivingDriver::getPower(){\n\treturn currentPower;\n}\n\nbool DrivingDriver::drive(){\n\t\n\treturn true;\n}\n\nbool DrivingDriver::stop() {\n\t\/\/dingen\n\treturn false;\n}\n\nvoid DrivingDriver::initMotors(){\n\tros::Rate init_rate(1);\n\t\n\tmotor_config_left.readConfig(motor_config_xml.root().section(\"left\"));\n\tleft_motor = new C3mxlROS(motor_port_name.c_str());\n\tleft_motor->setConfig(&motor_config_left);\n\n\twhile (ros::ok() && left_motor->init() != DXL_SUCCESS) {\n\t\tROS_WARN_ONCE(\"Couldn't initialize left wheel motor, will continue trying every second\");\n\t\tinit_rate.sleep();\n\t}\n\n\tmotor_config_right.readConfig(motor_config_xml.root().section(\"right\"));\n\tright_motor = new C3mxlROS(motor_port_name.c_str());\n\tright_motor->setConfig(&motor_config_right);\n\n\twhile (ros::ok() && right_motor->init() != DXL_SUCCESS) {\n\t\tROS_WARN_ONCE(\"Couldn't initialize right wheel motor, will continue trying every second\");\n\t\tinit_rate.sleep();\n\t}\n}\n\nvoid DrivingDriver::spin() {\n\tROS_INFO(\"Spinning\");\n\n\tros::Rate r(1000);\n\n\twhile(ros::ok()) {\n\t\tros::spinOnce();\n\t\tr.sleep();\n\t}\n}\n\nint main(int argc, char **argv)\n{\n\n\tros::init(argc, argv, \"drivingDriver\");\n\tDrivingDriver dd;\n\tdd.spin();\n\n\treturn 0;\n}<|endoftext|>"} {"text":"<commit_before>\/\/ See Fossen 2011, chapter 12.3.2\n#include \"pseudoinverse_allocator.h\"\n\ntemplate<typename Derived>\ninline bool isFucked(const Eigen::MatrixBase<Derived>& x)\n{\n return !((x.array() == x.array())).all() && !( (x - x).array() == (x - x).array()).all();\n}\n\nPseudoinverseAllocator::PseudoinverseAllocator()\n{\n sub = nh.subscribe(\"rov_forces\", 10, &PseudoinverseAllocator::callback, this);\n pub = nh.advertise<vortex_msgs::ThrusterForces>(\"thruster_forces\", 10);\n\n W.setIdentity(); \/\/ Default to identity (i.e. equal weights)\n K.setIdentity(); \/\/ Scaling is done on Arduino, so this can be identity\n\n \/\/ Thruster configuration does not allow control of roll.\n T << 0 , 0.7071, -0.7071, 0 , 0.7071, -0.7071, \/\/ Surge\n 0 , -0.7071, -0.7071, 0 , 0.7071, 0.7071, \/\/ Sway\n 1 , 0 , 0 , 1 , 0 , 0 , \/\/ Heave\n -0.1600, -0.0467, 0.0467, 0.1600, -0.0467, 0.0467, \/\/ Pitch\n 0 , -0.2143, 0.2143, 0 , 0.2143, -0.2143; \/\/ Yaw\n\n K_inverse = K.inverse();\n computePseudoinverse();\n}\n\nvoid PseudoinverseAllocator::callback(const geometry_msgs::Wrench& tauMsg)\n{\n tau << tauMsg.force.x,\n tauMsg.force.y,\n tauMsg.force.z,\n tauMsg.torque.y,\n tauMsg.torque.z;\n\n u = K_inverse * T_pseudoinverse * tau;\n\n if (isFucked(K_inverse))\n ROS_WARN(\"K is not invertible\");\n\n vortex_msgs::ThrusterForces uMsg;\n uMsg.F1 = u(0);\n uMsg.F2 = u(1);\n uMsg.F3 = u(2);\n uMsg.F4 = u(3);\n uMsg.F5 = u(4);\n uMsg.F6 = u(5);\n pub.publish(uMsg);\n ROS_INFO(\"pseudoinverse_allocator: Publishing thruster forces.\");\n}\n\nvoid PseudoinverseAllocator::setWeights(const Eigen::MatrixXd &W_new)\n{\n bool isCorrectDimensions = ( W_new.rows() == r && W_new.cols() == r );\n if (!isCorrectDimensions)\n {\n ROS_WARN_STREAM(\"Attempt to set weight matrix in PseudoinverseAllocator with wrong dimensions \" << W_new.rows() << \"*\" << W_new.cols() << \".\");\n return;\n }\n\n W = W_new;\n\n \/\/ New weights require recomputing the generalized inverse of the thrust config matrix\n computePseudoinverse();\n}\n\nvoid PseudoinverseAllocator::computePseudoinverse()\n{\n T_pseudoinverse = W.inverse()*T.transpose() * (T*W.inverse()*T.transpose()).inverse();\n\n if (isFucked(T_pseudoinverse))\n ROS_WARN(\"NaN in T_pseudoinverse.\");\n if (isFucked(W.inverse()))\n ROS_WARN(\"W not invertible.\");\n if (isFucked((T*W.inverse()*T.transpose()).inverse()))\n ROS_WARN(\"T * W_inv * T transposed is not invertible.\");\n}\n<commit_msg>Add yaml matrix parser<commit_after>\/\/ See Fossen 2011, chapter 12.3.2\n#include \"pseudoinverse_allocator.h\"\n\ntemplate<typename Derived>\ninline bool isFucked(const Eigen::MatrixBase<Derived>& x)\n{\n return !((x.array() == x.array())).all() && !( (x - x).array() == (x - x).array()).all();\n}\n\nEigen::MatrixXd parseYamlMatrix(ros::NodeHandle nh, std::string matrixName)\n{\n \/\/ TODO: Don't use asserts like this, instead check for validity first and return something if invalid.\n\n XmlRpc::XmlRpcValue matrix;\n nh.getParam(matrixName, matrix);\n\n \/\/ The matrix will be an array of arrays. Thus the \"outer\" data type should be an array.\n ROS_ASSERT(matrix.getType() == XmlRpc::XmlRpcValue::TypeArray);\n\n const int rows = matrix.size();\n const int cols = matrix[0].size();\n Eigen::MatrixXd X(rows,cols);\n\n for (int i = 0; i < matrix.size(); ++i)\n {\n \/\/ Each row should also be an array.\n ROS_ASSERT(matrix[i].getType() == XmlRpc::XmlRpcValue::TypeArray);\n\n for (int j = 0; j < matrix[i].size(); ++j)\n {\n \/\/ Each element should be a double (maybe not require this?)\n ROS_ASSERT(matrix[i][j].getType() == XmlRpc::XmlRpcValue::TypeDouble);\n X(i,j) = matrix[i][j];\n }\n }\n\n return X;\n}\n\nPseudoinverseAllocator::PseudoinverseAllocator()\n{\n sub = nh.subscribe(\"rov_forces\", 10, &PseudoinverseAllocator::callback, this);\n pub = nh.advertise<vortex_msgs::ThrusterForces>(\"thruster_forces\", 10);\n\n W.setIdentity(); \/\/ Default to identity (i.e. equal weights)\n K.setIdentity(); \/\/ Scaling is done on Arduino, so this can be identity\n\n \/\/ Thruster configuration does not allow control of roll.\n T << 0 , 0.7071, -0.7071, 0 , 0.7071, -0.7071, \/\/ Surge\n 0 , -0.7071, -0.7071, 0 , 0.7071, 0.7071, \/\/ Sway\n 1 , 0 , 0 , 1 , 0 , 0 , \/\/ Heave\n -0.1600, -0.0467, 0.0467, 0.1600, -0.0467, 0.0467, \/\/ Pitch\n 0 , -0.2143, 0.2143, 0 , 0.2143, -0.2143; \/\/ Yaw\n\n K_inverse = K.inverse();\n computePseudoinverse();\n}\n\nvoid PseudoinverseAllocator::callback(const geometry_msgs::Wrench& tauMsg)\n{\n tau << tauMsg.force.x,\n tauMsg.force.y,\n tauMsg.force.z,\n tauMsg.torque.y,\n tauMsg.torque.z;\n\n u = K_inverse * T_pseudoinverse * tau;\n\n if (isFucked(K_inverse))\n ROS_WARN(\"K is not invertible\");\n\n vortex_msgs::ThrusterForces uMsg;\n uMsg.F1 = u(0);\n uMsg.F2 = u(1);\n uMsg.F3 = u(2);\n uMsg.F4 = u(3);\n uMsg.F5 = u(4);\n uMsg.F6 = u(5);\n pub.publish(uMsg);\n ROS_INFO(\"pseudoinverse_allocator: Publishing thruster forces.\");\n}\n\nvoid PseudoinverseAllocator::setWeights(const Eigen::MatrixXd &W_new)\n{\n bool isCorrectDimensions = ( W_new.rows() == r && W_new.cols() == r );\n if (!isCorrectDimensions)\n {\n ROS_WARN_STREAM(\"Attempt to set weight matrix in PseudoinverseAllocator with wrong dimensions \" << W_new.rows() << \"*\" << W_new.cols() << \".\");\n return;\n }\n\n W = W_new;\n\n \/\/ New weights require recomputing the generalized inverse of the thrust config matrix\n computePseudoinverse();\n}\n\nvoid PseudoinverseAllocator::computePseudoinverse()\n{\n T_pseudoinverse = W.inverse()*T.transpose() * (T*W.inverse()*T.transpose()).inverse();\n\n if (isFucked(T_pseudoinverse))\n ROS_WARN(\"NaN in T_pseudoinverse.\");\n if (isFucked(W.inverse()))\n ROS_WARN(\"W not invertible.\");\n if (isFucked((T*W.inverse()*T.transpose()).inverse()))\n ROS_WARN(\"T * W_inv * T transposed is not invertible.\");\n}\n<|endoftext|>"} {"text":"<commit_before>void RICHtest (Int_t evNumber1=0,Int_t evNumber2=0) \n{\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ This macro is a small example of a ROOT macro\n\/\/ illustrating how to read the output of GALICE\n\/\/ and do some analysis.\n\/\/ \n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n\/\/ Dynamically link some shared libs\n \n if (gClassTable->GetID(\"AliRun\") < 0) {\n\tgROOT->LoadMacro(\"loadlibs.C\");\n\tloadlibs();\n }\n\/\/ Connect the Root Galice file containing Geometry, Kine and Hits\n\n TFile *file = (TFile*)gROOT->GetListOfFiles()->FindObject(\"galice.root\");\n\n \n if (!file) {\n\tprintf(\"\\n Creating galice.root \\n\");\n\tfile = new TFile(\"galice.root\");\n } else {\n\tprintf(\"\\n galice.root found in file list\");\n }\n file->ls();\n \n\/\/ Get AliRun object from file or create it if not on file\n if (!gAlice) {\n\tgAlice = (AliRun*)(file->Get(\"gAlice\"));\n\tif (gAlice) printf(\"AliRun object found on file\\n\");\n\tif (!gAlice) {\n\t printf(\"\\n create new gAlice object\");\n\t gAlice = new AliRun(\"gAlice\",\"Alice test program\");\n\t}\n }\n \n\/\/ Create some histograms\n\n\n TH1F *ccharge1 = new TH1F(\"ccharge1\",\"Cluster Charge distribution\"\n\t\t\t ,100,0.,500.);\n TH1F *pcharge1 = new TH1F(\"pcharge1\",\"Pad Charge distribution\"\n\t\t\t ,100,0.,200.);\n TH1F *xresid1 = new TH1F(\"xresid1\",\"x-Residuals\"\n\t\t\t ,100,-0.5,0.5);\n TH1F *yresid1 = new TH1F(\"yresid1\",\"y-Residuals\"\n\t\t\t ,100,-0.2,0.2);\n TH1F *npads1 = new TH1F(\"npads1\" ,\"Pads per Hit\"\n\t\t\t ,20,-0.5,19.5);\n TH2F *xresys1 = new TH2F(\"xresys1\",\"x-Residuals systematics\"\n\t\t\t ,50,-2.0,2.0,100,-1.0,1.0);\n TH2F *yresys1 = new TH2F(\"yresys1\",\"y-Residuals systematics\"\n\t\t\t ,50,-0.4,0.4,100,-0.1,0.1);\n\n TH1F *ccharge2 = new TH1F(\"ccharge2\",\"Cluster Charge distribution\"\n\t\t\t ,100,0.,500.);\n TH1F *pcharge2 = new TH1F(\"pcharge2\",\"Pad Charge distribution\"\n\t\t\t ,100,0.,200.);\n TH1F *xresid2 = new TH1F(\"xresid2\",\"x-Residuals\"\n\t\t\t ,100,-0.5,0.5);\n TH1F *yresid2 = new TH1F(\"yresid2\",\"y-Residuals\"\n\t\t\t ,100,-0.2,0.2);\n TH1F *npads2 = new TH1F(\"npads2\" ,\"Pads per Hit\"\n\t\t\t ,20,-0.5,19.5);\n TH2F *xresys2 = new TH2F(\"xresys2\",\"x-Residuals systematics\"\n\t\t\t ,50,-2.0,2.0,100,-1.0,1.0);\n TH2F *yresys2 = new TH2F(\"yresys2\",\"y-Residuals systematics\"\n\t\t\t ,50,-0.4,0.4,100,-0.1,0.1);\n\n\n AliRICHchamber* iChamber;\n\/\/\n\/\/ Loop over events \n\/\/\n Int_t Nh=0;\n Int_t Nh1=0;\n for (Int_t nev=0; nev<= evNumber2; nev++) {\n \/\/cout << \"nev \" << nev <<endl;\n printf (\"Event Number : %d\\n\",nev);\n Int_t nparticles = gAlice->GetEvent(nev);\n \/\/cout << \"nparticles \" << nparticles <<endl;\n printf (\"Number of particles: %d\\n\",nparticles);\n if (nev < evNumber1) continue;\n if (nparticles <= 0) return;\n\n AliRICH *RICH = (AliRICH*) gAlice->GetDetector(\"RICH\");\n\t printf(\"\\n track %d %d \\n \", nev, RICH);\n\n TTree *TH = gAlice->TreeH();\n Int_t ntracks = TH->GetEntries();\n Int_t Nc=0;\n Int_t npad[2];\n Float_t Q[2], xmean[2],ymean[2],xres[2],yres[2], xonpad[2], yonpad[2];\n\n printf (\"Just got it\");\n\/\/\n\/\/ Loop over events\n\/\/\n for (Int_t track=0; track<ntracks;track++) {\n\t \n\t gAlice->ResetHits();\n\t Int_t nbytes += TH->GetEvent(track);\n\t if (RICH) {\n\t for(AliRICHhit* mHit=(AliRICHhit*)RICH->FirstHit(-1); \n\t\t mHit;\n\t\t mHit=(AliRICHhit*)RICH->NextHit()) \n\t {\n\t\t Int_t nch = mHit->fChamber; \/\/ chamber number\n\t\t Float_t x = mHit->fX; \/\/ x-pos of hit\n\t\t Float_t y = mHit->fY; \/\/ y-pos\n\/\/\n\/\/\n\t\t iChamber = & RICH->Chamber(nch-1);\n\t\t response=iChamber->GetResponseModel(mip);\n\/\/\n\/\/\n\t\t if (nch <= 1) {\n\t\t for (Int_t i=0; i<2; i++) {\n\t\t\t xmean[i]=0;\n\t\t\t ymean[i]=0;\n\t\t\t Q[i]=0;\n\t\t\t npad[i]=0;\n\t\t }\n\t\t for (AliRICHcluster *mPad=(AliRICHcluster*)RICH\n\t\t\t\t->FirstPad(mHit);\n\t\t\t mPad;\n\t\t\t mPad=(AliRICHcluster*)RICH->NextPad()\n\t\t\t )\n\t\t {\n\t\t\t Int_t nseg = mPad->fCathode; \/\/ segmentation \n\t\t\t Int_t nhit = mPad->fHitNumber; \/\/ hit number\n\t\t\t Int_t qtot = mPad->fQ; \/\/ charge\n\t\t\t Int_t ipx = mPad->fPadX; \/\/ pad number on X\n\t\t\t Int_t ipy = mPad->fPadY; \/\/ pad number on Y\n\t\t\t Int_t iqpad = mPad->fQpad; \/\/ charge per pad\n\t\t\t Int_t secpad = mPad->fRSec; \/\/ r-pos of pad\n\/\/\n\/\/\n\t\t\t segmentation=iChamber->GetSegmentationModel(nseg);\n\t\t\t Int_t ind=nseg-1;\n\/\/\t\t printf(\"Pad of hit, padx, pady, iqpad, ncha %d %d %d %d %d %d\\n\",\n\/\/\t\t\t nhit, ipx, ipy, iqpad, nseg, ind);\n\n\t\t\t \n\t\t\t if (nseg == 1) {\n\t\t\t pcharge1->Fill(iqpad,(float) 1);\n\t\t\t ccharge1->Fill(qtot ,(float) 1);\n\t\t\t } else {\n\t\t\t pcharge2->Fill(iqpad,(float) 1);\n\t\t\t ccharge2->Fill(qtot ,(float) 1);\n\t\t\t }\n\/\/ Calculate centre of gravity\n\/\/\n\t\t\t if (iqpad == 0 && ind==0) {\n\t\t\t printf(\"\\n attention iqpad 0\");\n\t\t\t }\n\t\t\t \n\t\t\t if (iqpad > 0 && secpad==1) {\n\t\t\t Float_t xc,yc;\n\t\t\t npad[ind]++;\n\t\t\t segmentation->GetPadCxy(ipx,ipy,xc,yc);\n\/\/\t\t\t printf(\"\\n pad %d %d \", ipx, ipy);\n\/\/\t\t\t printf(\"\\n pos %f %f \", xc, yc);\n\t\t\t xmean[ind]+=Float_t(iqpad*xc);\n\t\t\t ymean[ind]+=Float_t(iqpad*yc);\n\t\t\t Q[ind]+=iqpad;\n\t\t\t }\n\t\t\t \n\t\t } \/\/pad hit loop\n\t\t for (Int_t i=0; i<2; i++) {\n\t\t\t segmentation = iChamber->GetSegmentationModel(i+1);\n\t\t\t \n\/\/\t\t\t if (npad[i] ==0) {\n\/\/\t\t\t printf(\"\\n #pads=0 %f %f\",x,y);\n\/\/\t\t\t }\n\t\t\t \n\t\t\t if (Q[i] >0) {\n\t\t\t xmean[i] = xmean[i]\/Q[i];\n\t\t\t xres[i] = xmean[i]-x;\n\t\t\t ymean[i] = ymean[i]\/Q[i];\n\t\t\t yres[i] = ymean[i]-y;\n\/\/\t\t\t printf(\"\\n xmean, ymean %f %f\",xmean[i],ymean[i]);\n\/\/\t\t\t printf(\"\\n xhit, yhit %f %f\",x,y);\n\t\t\t \n\/\/ Systematic Error\n\/\/\n\t\t\t Int_t icx, icy;\n\t\t\t segmentation->\n\t\t\t\t GetPadIxy(x,y,icx,icy);\n\t\t\t segmentation->\n\t\t\t\t GetPadCxy(icx,icy,xonpad[i],yonpad[i]);\n\t\t\t xonpad[i]-=x;\n\t\t\t yonpad[i]-=y;\n\t\t\t }\n\t\t } \/\/ plane loop\n\t\t xresid1->Fill(xres[0],(float) 1);\n\t\t yresid1->Fill(yres[0],(float) 1);\n\t\t npads1->Fill(npad[0],(float) 1);\n\t\t if (npad[0] >=2 && Q[0] > 6 ) {\n\t\t\t xresys1->Fill(xonpad[0],xres[0],(float) 1);\n\t\t\t yresys1->Fill(yonpad[0],yres[0],(float) 1);\n\t\t }\n\t\t \n\t\t xresid2->Fill(xres[1],(float) 1);\n\t\t yresid2->Fill(yres[1],(float) 1);\n\t\t npads2->Fill(npad[1],(float) 1);\n\t\t if (npad[1] >=2 && Q[1] > 6) {\n\t\t\t xresys2->Fill(xonpad[1],xres[1],(float) 1);\n\t\t\t yresys2->Fill(yonpad[1],yres[1],(float) 1);\n\t\t }\n\t\t } \/\/ chamber 1\n\t } \/\/ hit loop\n\t } \/\/ if RICH\n } \/\/ track loop\n } \/\/ event loop \n \n\/\/Create a canvas, set the view range, show histograms\n TCanvas *c1 = new TCanvas(\"c1\",\"Charge and Residuals\",400,10,600,700);\n pad11 = new TPad(\"pad11\",\" \",0.01,0.51,0.49,0.99);\n pad12 = new TPad(\"pad12\",\" \",0.51,0.51,0.99,0.99);\n pad13 = new TPad(\"pad13\",\" \",0.01,0.01,0.49,0.49);\n pad14 = new TPad(\"pad14\",\" \",0.51,0.01,0.99,0.49);\n pad11->SetFillColor(11);\n pad12->SetFillColor(11);\n pad13->SetFillColor(11);\n pad14->SetFillColor(11);\n pad11->Draw();\n pad12->Draw();\n pad13->Draw();\n pad14->Draw();\n \n pad11->cd();\n ccharge1->SetFillColor(42);\n ccharge1->SetXTitle(\"ADC units\");\n ccharge1->Draw();\n\n pad12->cd();\n pcharge1->SetFillColor(42);\n pcharge1->SetXTitle(\"ADC units\");\n pcharge1->Draw();\n\n pad13->cd();\n xresid1->SetFillColor(42);\n xresid1->Draw();\n\n pad14->cd();\n yresid1->SetFillColor(42);\n yresid1->Draw();\n\n TCanvas *c2 = new TCanvas(\"c2\",\"Cluster Size\",400,10,600,700);\n pad21 = new TPad(\"pad21\",\" \",0.01,0.51,0.49,0.99);\n pad22 = new TPad(\"pad22\",\" \",0.51,0.51,0.99,0.99);\n pad23 = new TPad(\"pad23\",\" \",0.01,0.01,0.49,0.49);\n pad24 = new TPad(\"pad24\",\" \",0.51,0.01,0.99,0.49);\n pad21->SetFillColor(11);\n pad22->SetFillColor(11);\n pad23->SetFillColor(11);\n pad24->SetFillColor(11);\n pad21->Draw();\n pad22->Draw();\n pad23->Draw();\n pad24->Draw();\n \n pad21->cd();\n npads1->SetFillColor(42);\n npads1->SetXTitle(\"Cluster Size\");\n npads1->Draw();\n\n pad23->cd();\n xresys1->SetXTitle(\"x on pad\");\n xresys1->SetYTitle(\"x-xcog\");\n xresys1->Draw();\n\n pad24->cd();\n yresys1->SetXTitle(\"y on pad\");\n yresys1->SetYTitle(\"y-ycog\");\n yresys1->Draw();\n\n TCanvas *c3 = new TCanvas(\"c3\",\"Charge and Residuals\",400,10,600,700);\n pad31 = new TPad(\"pad31\",\" \",0.01,0.51,0.49,0.99);\n pad32 = new TPad(\"pad32\",\" \",0.51,0.51,0.99,0.99);\n pad33 = new TPad(\"pad33\",\" \",0.01,0.01,0.49,0.49);\n pad34 = new TPad(\"pad34\",\" \",0.51,0.01,0.99,0.49);\n pad31->SetFillColor(11);\n pad32->SetFillColor(11);\n pad33->SetFillColor(11);\n pad34->SetFillColor(11);\n pad31->Draw();\n pad32->Draw();\n pad33->Draw();\n pad34->Draw();\n \n pad31->cd();\n ccharge2->SetFillColor(42);\n ccharge2->SetXTitle(\"ADC units\");\n ccharge2->Draw();\n\n pad32->cd();\n pcharge2->SetFillColor(42);\n pcharge2->SetXTitle(\"ADC units\");\n pcharge2->Draw();\n\n pad33->cd();\n xresid2->SetFillColor(42);\n xresid2->Draw();\n\n pad34->cd();\n yresid2->SetFillColor(42);\n yresid2->Draw();\n\n TCanvas *c4 = new TCanvas(\"c4\",\"Cluster Size\",400,10,600,700);\n pad41 = new TPad(\"pad41\",\" \",0.01,0.51,0.49,0.99);\n pad42 = new TPad(\"pad42\",\" \",0.51,0.51,0.99,0.99);\n pad43 = new TPad(\"pad43\",\" \",0.01,0.01,0.49,0.49);\n pad44 = new TPad(\"pad44\",\" \",0.51,0.01,0.99,0.49);\n pad41->SetFillColor(11);\n pad42->SetFillColor(11);\n pad43->SetFillColor(11);\n pad44->SetFillColor(11);\n pad41->Draw();\n pad42->Draw();\n pad43->Draw();\n pad44->Draw();\n \n pad41->cd();\n npads2->SetFillColor(42);\n npads2->SetXTitle(\"Cluster Size\");\n npads2->Draw();\n\n pad43->cd();\n xresys2->SetXTitle(\"x on pad\");\n xresys2->SetYTitle(\"x-xcog\");\n xresys2->Draw();\n\n pad44->cd();\n yresys2->SetXTitle(\"y on pad\");\n yresys2->SetYTitle(\"y-ycog\");\n yresys2->Draw();\n \n}\n<commit_msg>obsolete<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\/content_settings\/content_settings_provider.h\"\n\nnamespace content_settings {\n\nProviderInterface::Rule::Rule() {\n}\n\nProviderInterface::Rule::Rule(const ContentSettingsPattern& requesting_pattern,\n const ContentSettingsPattern& embedding_pattern,\n ContentSetting setting)\n : requesting_url_pattern(requesting_pattern),\n embedding_url_pattern(embedding_pattern),\n content_setting(setting) {\n}\n\n} \/\/ namespace content_settings\n<commit_msg>Uninitialized struct member in ProviderInterface::Rule.<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\/content_settings\/content_settings_provider.h\"\n\nnamespace content_settings {\n\nProviderInterface::Rule::Rule()\n : content_setting(CONTENT_SETTING_DEFAULT) {\n}\n\nProviderInterface::Rule::Rule(const ContentSettingsPattern& requesting_pattern,\n const ContentSettingsPattern& embedding_pattern,\n ContentSetting setting)\n : requesting_url_pattern(requesting_pattern),\n embedding_url_pattern(embedding_pattern),\n content_setting(setting) {\n}\n\n} \/\/ namespace content_settings\n<|endoftext|>"} {"text":"<commit_before>\/\/ Copyright (c) 2010 The Chromium Authors. All rights reserved.\n\/\/ Use of this source code is governed by a BSD-style license that can be\n\/\/ found in the LICENSE file.\n\n#include \"base\/file_path.h\"\n#include \"base\/string_util.h\"\n#include \"chrome\/browser\/password_manager\/password_manager.h\"\n#include \"chrome\/browser\/password_manager\/password_store.h\"\n#include \"chrome\/browser\/pref_service.h\"\n#include \"chrome\/common\/url_constants.h\"\n#include \"chrome\/test\/testing_profile.h\"\n#include \"testing\/gtest\/include\/gtest\/gtest.h\"\n#include \"testing\/gmock\/include\/gmock\/gmock.h\"\n\nusing webkit_glue::PasswordForm;\nusing testing::_;\nusing testing::DoAll;\nusing ::testing::Exactly;\nusing ::testing::WithArg;\nusing ::testing::Return;\n\nclass MockPasswordManagerDelegate : public PasswordManager::Delegate {\n public:\n MOCK_METHOD1(FillPasswordForm, void(\n const webkit_glue::PasswordFormDomManager::FillData&));\n MOCK_METHOD1(AddSavePasswordInfoBar, void(PasswordFormManager*));\n MOCK_METHOD0(GetProfileForPasswordManager, Profile*());\n MOCK_METHOD0(DidLastPageLoadEncounterSSLErrors, bool());\n};\n\nclass TestingProfileWithPasswordStore : public TestingProfile {\n public:\n explicit TestingProfileWithPasswordStore(PasswordStore* store)\n : store_(store) {}\n virtual PasswordStore* GetPasswordStore(ServiceAccessType access) {\n return store_;\n }\n private:\n PasswordStore* store_;\n};\n\nclass MockPasswordStore : public PasswordStore {\n public:\n MOCK_METHOD1(RemoveLogin, void(const PasswordForm&));\n MOCK_METHOD2(GetLogins, int(const PasswordForm&, PasswordStoreConsumer*));\n MOCK_METHOD1(AddLogin, void(const PasswordForm&));\n MOCK_METHOD1(UpdateLogin, void(const PasswordForm&));\n MOCK_METHOD1(AddLoginImpl, void(const PasswordForm&));\n MOCK_METHOD1(UpdateLoginImpl, void(const PasswordForm&));\n MOCK_METHOD1(RemoveLoginImpl, void(const PasswordForm&));\n MOCK_METHOD2(RemoveLoginsCreatedBetweenImpl, void(const base::Time&,\n const base::Time&));\n MOCK_METHOD2(GetLoginsImpl, void(GetLoginsRequest*, const PasswordForm&));\n MOCK_METHOD1(GetAutofillableLoginsImpl, void(GetLoginsRequest*));\n MOCK_METHOD1(GetBlacklistLoginsImpl, void(GetLoginsRequest*));\n MOCK_METHOD1(FillAutofillableLogins,\n bool(std::vector<webkit_glue::PasswordForm*>*));\n MOCK_METHOD1(FillBlacklistLogins,\n bool(std::vector<webkit_glue::PasswordForm*>*));\n};\n\nACTION_P2(InvokeConsumer, handle, forms) {\n arg0->OnPasswordStoreRequestDone(handle, forms);\n}\n\nACTION_P(SaveToScopedPtr, scoped) {\n scoped->reset(arg0);\n}\n\nclass PasswordManagerTest : public testing::Test {\n public:\n PasswordManagerTest() {}\n protected:\n\n virtual void SetUp() {\n store_ = new MockPasswordStore();\n profile_.reset(new TestingProfileWithPasswordStore(store_));\n EXPECT_CALL(delegate_, GetProfileForPasswordManager())\n .WillRepeatedly(Return(profile_.get()));\n manager_.reset(new PasswordManager(&delegate_));\n EXPECT_CALL(delegate_, DidLastPageLoadEncounterSSLErrors())\n .WillRepeatedly(Return(false));\n }\n\n virtual void TearDown() {\n manager_.reset();\n store_ = NULL;\n }\n\n PasswordForm MakeSimpleForm() {\n PasswordForm form;\n form.origin = GURL(\"http:\/\/www.google.com\/a\/LoginAuth\");\n form.action = GURL(\"http:\/\/www.google.com\/a\/Login\");\n form.username_element = ASCIIToUTF16(\"Email\");\n form.password_element = ASCIIToUTF16(\"Passwd\");\n form.username_value = ASCIIToUTF16(\"google\");\n form.password_value = ASCIIToUTF16(\"password\");\n form.submit_element = ASCIIToUTF16(\"signIn\");\n form.signon_realm = \"http:\/\/www.google.com\";\n return form;\n }\n\n PasswordManager* manager() { return manager_.get(); }\n\n scoped_ptr<Profile> profile_;\n scoped_refptr<MockPasswordStore> store_;\n MockPasswordManagerDelegate delegate_; \/\/ Owned by manager_.\n scoped_ptr<PasswordManager> manager_;\n};\n\nMATCHER_P(FormMatches, form, \"\") {\n return form.signon_realm == arg.signon_realm &&\n form.origin == arg.origin &&\n form.action == arg.action &&\n form.username_element == arg.username_element &&\n form.password_element == arg.password_element &&\n form.submit_element == arg.submit_element;\n}\n\nTEST_F(PasswordManagerTest, FormSubmitEmptyStore) {\n \/\/ Test that observing a newly submitted form shows the save password bar.\n std::vector<PasswordForm*> result; \/\/ Empty password store.\n EXPECT_CALL(delegate_, FillPasswordForm(_)).Times(Exactly(0));\n EXPECT_CALL(*store_, GetLogins(_,_))\n .WillOnce(DoAll(WithArg<1>(InvokeConsumer(0, result)), Return(0)));\n std::vector<PasswordForm> observed;\n PasswordForm form(MakeSimpleForm());\n observed.push_back(form);\n manager()->PasswordFormsFound(observed); \/\/ The initial load.\n manager()->PasswordFormsVisible(observed); \/\/ The initial layout.\n\n \/\/ And the form submit contract is to call ProvisionallySavePassword.\n manager()->ProvisionallySavePassword(form);\n\n scoped_ptr<PasswordFormManager> form_to_save;\n EXPECT_CALL(delegate_, AddSavePasswordInfoBar(_))\n .WillOnce(WithArg<0>(SaveToScopedPtr(&form_to_save)));\n\n \/\/ Now the password manager waits for the navigation to complete.\n manager()->DidStopLoading();\n\n ASSERT_FALSE(NULL == form_to_save.get());\n EXPECT_CALL(*store_, AddLogin(FormMatches(form)));\n\n \/\/ Simulate saving the form, as if the info bar was accepted.\n form_to_save->Save();\n}\n\nTEST_F(PasswordManagerTest, FormSubmitNoGoodMatch) {\n \/\/ Same as above, except with an existing form for the same signon realm,\n \/\/ but different origin. Detailed cases like this are covered by\n \/\/ PasswordFormManagerTest.\n std::vector<PasswordForm*> result;\n PasswordForm* existing_different = new PasswordForm(MakeSimpleForm());\n existing_different->username_value = ASCIIToUTF16(\"google2\");\n result.push_back(existing_different);\n EXPECT_CALL(delegate_, FillPasswordForm(_));\n EXPECT_CALL(*store_, GetLogins(_,_))\n .WillOnce(DoAll(WithArg<1>(InvokeConsumer(0, result)), Return(0)));\n\n std::vector<PasswordForm> observed;\n PasswordForm form(MakeSimpleForm());\n observed.push_back(form);\n manager()->PasswordFormsFound(observed); \/\/ The initial load.\n manager()->PasswordFormsVisible(observed); \/\/ The initial layout.\n manager()->ProvisionallySavePassword(form);\n\n \/\/ We still expect an add, since we didn't have a good match.\n scoped_ptr<PasswordFormManager> form_to_save;\n EXPECT_CALL(delegate_, AddSavePasswordInfoBar(_))\n .WillOnce(WithArg<0>(SaveToScopedPtr(&form_to_save)));\n\n manager()->DidStopLoading();\n\n EXPECT_CALL(*store_, AddLogin(FormMatches(form)));\n \/\/ Simulate saving the form.\n form_to_save->Save();\n}\n\nTEST_F(PasswordManagerTest, FormSeenThenLeftPage) {\n std::vector<PasswordForm*> result; \/\/ Empty password store.\n EXPECT_CALL(delegate_, FillPasswordForm(_)).Times(Exactly(0));\n EXPECT_CALL(*store_, GetLogins(_,_))\n .WillOnce(DoAll(WithArg<1>(InvokeConsumer(0, result)), Return(0)));\n std::vector<PasswordForm> observed;\n PasswordForm form(MakeSimpleForm());\n observed.push_back(form);\n manager()->PasswordFormsFound(observed); \/\/ The initial load.\n manager()->PasswordFormsVisible(observed); \/\/ The initial layout.\n\n manager()->DidNavigate();\n\n \/\/ No expected calls.\n manager()->DidStopLoading();\n}\n\nTEST_F(PasswordManagerTest, FormSubmitFailedLogin) {\n std::vector<PasswordForm*> result; \/\/ Empty password store.\n EXPECT_CALL(delegate_, FillPasswordForm(_)).Times(Exactly(0));\n EXPECT_CALL(*store_, GetLogins(_,_))\n .WillRepeatedly(DoAll(WithArg<1>(InvokeConsumer(0, result)), Return(0)));\n std::vector<PasswordForm> observed;\n PasswordForm form(MakeSimpleForm());\n observed.push_back(form);\n manager()->PasswordFormsFound(observed); \/\/ The initial load.\n manager()->PasswordFormsVisible(observed); \/\/ The initial layout.\n\n manager()->ProvisionallySavePassword(form);\n\n \/\/ The form reappears, and is visible in the layout:\n manager()->PasswordFormsFound(observed);\n manager()->PasswordFormsVisible(observed);\n\n \/\/ No expected calls to the PasswordStore...\n manager()->DidStopLoading();\n}\n\nTEST_F(PasswordManagerTest, FormSubmitInvisibleLogin) {\n \/\/ Tests fix of issue 28911: if the login form reappears on the subsequent\n \/\/ page, but is invisible, it shouldn't count as a failed login.\n std::vector<PasswordForm*> result; \/\/ Empty password store.\n EXPECT_CALL(delegate_, FillPasswordForm(_)).Times(Exactly(0));\n EXPECT_CALL(*store_, GetLogins(_,_))\n .WillRepeatedly(DoAll(WithArg<1>(InvokeConsumer(0, result)), Return(0)));\n std::vector<PasswordForm> observed;\n PasswordForm form(MakeSimpleForm());\n observed.push_back(form);\n manager()->PasswordFormsFound(observed); \/\/ The initial load.\n manager()->PasswordFormsVisible(observed); \/\/ The initial layout.\n\n manager()->ProvisionallySavePassword(form);\n\n \/\/ The form reappears, but is not visible in the layout:\n manager()->PasswordFormsFound(observed);\n \/\/ No call to PasswordFormsVisible.\n\n \/\/ Expect info bar to appear:\n scoped_ptr<PasswordFormManager> form_to_save;\n EXPECT_CALL(delegate_, AddSavePasswordInfoBar(_))\n .WillOnce(WithArg<0>(SaveToScopedPtr(&form_to_save)));\n\n manager()->DidStopLoading();\n\n ASSERT_FALSE(NULL == form_to_save.get());\n EXPECT_CALL(*store_, AddLogin(FormMatches(form)));\n \/\/ Simulate saving the form.\n form_to_save->Save();\n}\n\nTEST_F(PasswordManagerTest, InitiallyInvisibleForm) {\n \/\/ Make sure an invisible login form still gets autofilled.\n std::vector<PasswordForm*> result;\n PasswordForm* existing = new PasswordForm(MakeSimpleForm());\n result.push_back(existing);\n EXPECT_CALL(delegate_, FillPasswordForm(_));\n EXPECT_CALL(*store_, GetLogins(_,_))\n .WillRepeatedly(DoAll(WithArg<1>(InvokeConsumer(0, result)), Return(0)));\n std::vector<PasswordForm> observed;\n PasswordForm form(MakeSimpleForm());\n observed.push_back(form);\n manager()->PasswordFormsFound(observed); \/\/ The initial load.\n \/\/ PasswordFormsVisible is not called.\n\n manager()->DidStopLoading();\n}\n<commit_msg>build fix in password manager unit 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 \"base\/file_path.h\"\n#include \"base\/string_util.h\"\n#include \"chrome\/browser\/password_manager\/password_manager.h\"\n#include \"chrome\/browser\/password_manager\/password_store.h\"\n#include \"chrome\/browser\/pref_service.h\"\n#include \"chrome\/common\/url_constants.h\"\n#include \"chrome\/test\/testing_profile.h\"\n#include \"testing\/gtest\/include\/gtest\/gtest.h\"\n#include \"testing\/gmock\/include\/gmock\/gmock.h\"\n\nusing webkit_glue::PasswordForm;\nusing testing::_;\nusing testing::DoAll;\nusing ::testing::Exactly;\nusing ::testing::WithArg;\nusing ::testing::Return;\n\nclass MockPasswordManagerDelegate : public PasswordManager::Delegate {\n public:\n MOCK_METHOD1(FillPasswordForm, void(\n const webkit_glue::PasswordFormDomManager::FillData&));\n MOCK_METHOD1(AddSavePasswordInfoBar, void(PasswordFormManager*));\n MOCK_METHOD0(GetProfileForPasswordManager, Profile*());\n MOCK_METHOD0(DidLastPageLoadEncounterSSLErrors, bool());\n};\n\nclass TestingProfileWithPasswordStore : public TestingProfile {\n public:\n explicit TestingProfileWithPasswordStore(PasswordStore* store)\n : store_(store) {}\n virtual PasswordStore* GetPasswordStore(ServiceAccessType access) {\n return store_;\n }\n private:\n PasswordStore* store_;\n};\n\nclass MockPasswordStore : public PasswordStore {\n public:\n MOCK_METHOD1(RemoveLogin, void(const PasswordForm&));\n MOCK_METHOD0(ReportMetricsImpl void());\n MOCK_METHOD2(GetLogins, int(const PasswordForm&, PasswordStoreConsumer*));\n MOCK_METHOD1(AddLogin, void(const PasswordForm&));\n MOCK_METHOD1(UpdateLogin, void(const PasswordForm&));\n MOCK_METHOD1(AddLoginImpl, void(const PasswordForm&));\n MOCK_METHOD1(UpdateLoginImpl, void(const PasswordForm&));\n MOCK_METHOD1(RemoveLoginImpl, void(const PasswordForm&));\n MOCK_METHOD2(RemoveLoginsCreatedBetweenImpl, void(const base::Time&,\n const base::Time&));\n MOCK_METHOD2(GetLoginsImpl, void(GetLoginsRequest*, const PasswordForm&));\n MOCK_METHOD1(GetAutofillableLoginsImpl, void(GetLoginsRequest*));\n MOCK_METHOD1(GetBlacklistLoginsImpl, void(GetLoginsRequest*));\n MOCK_METHOD1(FillAutofillableLogins,\n bool(std::vector<webkit_glue::PasswordForm*>*));\n MOCK_METHOD1(FillBlacklistLogins,\n bool(std::vector<webkit_glue::PasswordForm*>*));\n};\n\nACTION_P2(InvokeConsumer, handle, forms) {\n arg0->OnPasswordStoreRequestDone(handle, forms);\n}\n\nACTION_P(SaveToScopedPtr, scoped) {\n scoped->reset(arg0);\n}\n\nclass PasswordManagerTest : public testing::Test {\n public:\n PasswordManagerTest() {}\n protected:\n\n virtual void SetUp() {\n store_ = new MockPasswordStore();\n profile_.reset(new TestingProfileWithPasswordStore(store_));\n EXPECT_CALL(delegate_, GetProfileForPasswordManager())\n .WillRepeatedly(Return(profile_.get()));\n manager_.reset(new PasswordManager(&delegate_));\n EXPECT_CALL(delegate_, DidLastPageLoadEncounterSSLErrors())\n .WillRepeatedly(Return(false));\n }\n\n virtual void TearDown() {\n manager_.reset();\n store_ = NULL;\n }\n\n PasswordForm MakeSimpleForm() {\n PasswordForm form;\n form.origin = GURL(\"http:\/\/www.google.com\/a\/LoginAuth\");\n form.action = GURL(\"http:\/\/www.google.com\/a\/Login\");\n form.username_element = ASCIIToUTF16(\"Email\");\n form.password_element = ASCIIToUTF16(\"Passwd\");\n form.username_value = ASCIIToUTF16(\"google\");\n form.password_value = ASCIIToUTF16(\"password\");\n form.submit_element = ASCIIToUTF16(\"signIn\");\n form.signon_realm = \"http:\/\/www.google.com\";\n return form;\n }\n\n PasswordManager* manager() { return manager_.get(); }\n\n scoped_ptr<Profile> profile_;\n scoped_refptr<MockPasswordStore> store_;\n MockPasswordManagerDelegate delegate_; \/\/ Owned by manager_.\n scoped_ptr<PasswordManager> manager_;\n};\n\nMATCHER_P(FormMatches, form, \"\") {\n return form.signon_realm == arg.signon_realm &&\n form.origin == arg.origin &&\n form.action == arg.action &&\n form.username_element == arg.username_element &&\n form.password_element == arg.password_element &&\n form.submit_element == arg.submit_element;\n}\n\nTEST_F(PasswordManagerTest, FormSubmitEmptyStore) {\n \/\/ Test that observing a newly submitted form shows the save password bar.\n std::vector<PasswordForm*> result; \/\/ Empty password store.\n EXPECT_CALL(delegate_, FillPasswordForm(_)).Times(Exactly(0));\n EXPECT_CALL(*store_, GetLogins(_,_))\n .WillOnce(DoAll(WithArg<1>(InvokeConsumer(0, result)), Return(0)));\n std::vector<PasswordForm> observed;\n PasswordForm form(MakeSimpleForm());\n observed.push_back(form);\n manager()->PasswordFormsFound(observed); \/\/ The initial load.\n manager()->PasswordFormsVisible(observed); \/\/ The initial layout.\n\n \/\/ And the form submit contract is to call ProvisionallySavePassword.\n manager()->ProvisionallySavePassword(form);\n\n scoped_ptr<PasswordFormManager> form_to_save;\n EXPECT_CALL(delegate_, AddSavePasswordInfoBar(_))\n .WillOnce(WithArg<0>(SaveToScopedPtr(&form_to_save)));\n\n \/\/ Now the password manager waits for the navigation to complete.\n manager()->DidStopLoading();\n\n ASSERT_FALSE(NULL == form_to_save.get());\n EXPECT_CALL(*store_, AddLogin(FormMatches(form)));\n\n \/\/ Simulate saving the form, as if the info bar was accepted.\n form_to_save->Save();\n}\n\nTEST_F(PasswordManagerTest, FormSubmitNoGoodMatch) {\n \/\/ Same as above, except with an existing form for the same signon realm,\n \/\/ but different origin. Detailed cases like this are covered by\n \/\/ PasswordFormManagerTest.\n std::vector<PasswordForm*> result;\n PasswordForm* existing_different = new PasswordForm(MakeSimpleForm());\n existing_different->username_value = ASCIIToUTF16(\"google2\");\n result.push_back(existing_different);\n EXPECT_CALL(delegate_, FillPasswordForm(_));\n EXPECT_CALL(*store_, GetLogins(_,_))\n .WillOnce(DoAll(WithArg<1>(InvokeConsumer(0, result)), Return(0)));\n\n std::vector<PasswordForm> observed;\n PasswordForm form(MakeSimpleForm());\n observed.push_back(form);\n manager()->PasswordFormsFound(observed); \/\/ The initial load.\n manager()->PasswordFormsVisible(observed); \/\/ The initial layout.\n manager()->ProvisionallySavePassword(form);\n\n \/\/ We still expect an add, since we didn't have a good match.\n scoped_ptr<PasswordFormManager> form_to_save;\n EXPECT_CALL(delegate_, AddSavePasswordInfoBar(_))\n .WillOnce(WithArg<0>(SaveToScopedPtr(&form_to_save)));\n\n manager()->DidStopLoading();\n\n EXPECT_CALL(*store_, AddLogin(FormMatches(form)));\n \/\/ Simulate saving the form.\n form_to_save->Save();\n}\n\nTEST_F(PasswordManagerTest, FormSeenThenLeftPage) {\n std::vector<PasswordForm*> result; \/\/ Empty password store.\n EXPECT_CALL(delegate_, FillPasswordForm(_)).Times(Exactly(0));\n EXPECT_CALL(*store_, GetLogins(_,_))\n .WillOnce(DoAll(WithArg<1>(InvokeConsumer(0, result)), Return(0)));\n std::vector<PasswordForm> observed;\n PasswordForm form(MakeSimpleForm());\n observed.push_back(form);\n manager()->PasswordFormsFound(observed); \/\/ The initial load.\n manager()->PasswordFormsVisible(observed); \/\/ The initial layout.\n\n manager()->DidNavigate();\n\n \/\/ No expected calls.\n manager()->DidStopLoading();\n}\n\nTEST_F(PasswordManagerTest, FormSubmitFailedLogin) {\n std::vector<PasswordForm*> result; \/\/ Empty password store.\n EXPECT_CALL(delegate_, FillPasswordForm(_)).Times(Exactly(0));\n EXPECT_CALL(*store_, GetLogins(_,_))\n .WillRepeatedly(DoAll(WithArg<1>(InvokeConsumer(0, result)), Return(0)));\n std::vector<PasswordForm> observed;\n PasswordForm form(MakeSimpleForm());\n observed.push_back(form);\n manager()->PasswordFormsFound(observed); \/\/ The initial load.\n manager()->PasswordFormsVisible(observed); \/\/ The initial layout.\n\n manager()->ProvisionallySavePassword(form);\n\n \/\/ The form reappears, and is visible in the layout:\n manager()->PasswordFormsFound(observed);\n manager()->PasswordFormsVisible(observed);\n\n \/\/ No expected calls to the PasswordStore...\n manager()->DidStopLoading();\n}\n\nTEST_F(PasswordManagerTest, FormSubmitInvisibleLogin) {\n \/\/ Tests fix of issue 28911: if the login form reappears on the subsequent\n \/\/ page, but is invisible, it shouldn't count as a failed login.\n std::vector<PasswordForm*> result; \/\/ Empty password store.\n EXPECT_CALL(delegate_, FillPasswordForm(_)).Times(Exactly(0));\n EXPECT_CALL(*store_, GetLogins(_,_))\n .WillRepeatedly(DoAll(WithArg<1>(InvokeConsumer(0, result)), Return(0)));\n std::vector<PasswordForm> observed;\n PasswordForm form(MakeSimpleForm());\n observed.push_back(form);\n manager()->PasswordFormsFound(observed); \/\/ The initial load.\n manager()->PasswordFormsVisible(observed); \/\/ The initial layout.\n\n manager()->ProvisionallySavePassword(form);\n\n \/\/ The form reappears, but is not visible in the layout:\n manager()->PasswordFormsFound(observed);\n \/\/ No call to PasswordFormsVisible.\n\n \/\/ Expect info bar to appear:\n scoped_ptr<PasswordFormManager> form_to_save;\n EXPECT_CALL(delegate_, AddSavePasswordInfoBar(_))\n .WillOnce(WithArg<0>(SaveToScopedPtr(&form_to_save)));\n\n manager()->DidStopLoading();\n\n ASSERT_FALSE(NULL == form_to_save.get());\n EXPECT_CALL(*store_, AddLogin(FormMatches(form)));\n \/\/ Simulate saving the form.\n form_to_save->Save();\n}\n\nTEST_F(PasswordManagerTest, InitiallyInvisibleForm) {\n \/\/ Make sure an invisible login form still gets autofilled.\n std::vector<PasswordForm*> result;\n PasswordForm* existing = new PasswordForm(MakeSimpleForm());\n result.push_back(existing);\n EXPECT_CALL(delegate_, FillPasswordForm(_));\n EXPECT_CALL(*store_, GetLogins(_,_))\n .WillRepeatedly(DoAll(WithArg<1>(InvokeConsumer(0, result)), Return(0)));\n std::vector<PasswordForm> observed;\n PasswordForm form(MakeSimpleForm());\n observed.push_back(form);\n manager()->PasswordFormsFound(observed); \/\/ The initial load.\n \/\/ PasswordFormsVisible is not called.\n\n manager()->DidStopLoading();\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\/debug\/stack_trace.h\"\n\n#include <errno.h>\n#include <execinfo.h>\n#include <fcntl.h>\n#include <stdio.h>\n#include <stdlib.h>\n#include <sys\/param.h>\n#include <sys\/stat.h>\n#include <sys\/types.h>\n#include <unistd.h>\n\n#include <string>\n#include <vector>\n\n#if defined(__GLIBCXX__)\n#include <cxxabi.h>\n#endif\n\n#if defined(OS_MACOSX)\n#include <AvailabilityMacros.h>\n#endif\n\n#include <iostream>\n\n#include \"base\/basictypes.h\"\n#include \"base\/eintr_wrapper.h\"\n#include \"base\/logging.h\"\n#include \"base\/memory\/scoped_ptr.h\"\n#include \"base\/safe_strerror_posix.h\"\n#include \"base\/string_piece.h\"\n#include \"base\/stringprintf.h\"\n\n#if defined(USE_SYMBOLIZE)\n#include \"base\/third_party\/symbolize\/symbolize.h\"\n#endif\n\nnamespace base {\nnamespace debug {\n\nnamespace {\n\n\/\/ The prefix used for mangled symbols, per the Itanium C++ ABI:\n\/\/ http:\/\/www.codesourcery.com\/cxx-abi\/abi.html#mangling\nconst char kMangledSymbolPrefix[] = \"_Z\";\n\n\/\/ Characters that can be used for symbols, generated by Ruby:\n\/\/ (('a'..'z').to_a+('A'..'Z').to_a+('0'..'9').to_a + ['_']).join\nconst char kSymbolCharacters[] =\n \"abcdefghijklmnopqrstuvwxyzABCDEFGHIJKLMNOPQRSTUVWXYZ0123456789_\";\n\n#if !defined(USE_SYMBOLIZE)\n\/\/ Demangles C++ symbols in the given text. Example:\n\/\/\n\/\/ \"out\/Debug\/base_unittests(_ZN10StackTraceC1Ev+0x20) [0x817778c]\"\n\/\/ =>\n\/\/ \"out\/Debug\/base_unittests(StackTrace::StackTrace()+0x20) [0x817778c]\"\nvoid DemangleSymbols(std::string* text) {\n#if defined(__GLIBCXX__)\n\n std::string::size_type search_from = 0;\n while (search_from < text->size()) {\n \/\/ Look for the start of a mangled symbol, from search_from.\n std::string::size_type mangled_start =\n text->find(kMangledSymbolPrefix, search_from);\n if (mangled_start == std::string::npos) {\n break; \/\/ Mangled symbol not found.\n }\n\n \/\/ Look for the end of the mangled symbol.\n std::string::size_type mangled_end =\n text->find_first_not_of(kSymbolCharacters, mangled_start);\n if (mangled_end == std::string::npos) {\n mangled_end = text->size();\n }\n std::string mangled_symbol =\n text->substr(mangled_start, mangled_end - mangled_start);\n\n \/\/ Try to demangle the mangled symbol candidate.\n int status = 0;\n scoped_ptr_malloc<char> demangled_symbol(\n abi::__cxa_demangle(mangled_symbol.c_str(), NULL, 0, &status));\n if (status == 0) { \/\/ Demangling is successful.\n \/\/ Remove the mangled symbol.\n text->erase(mangled_start, mangled_end - mangled_start);\n \/\/ Insert the demangled symbol.\n text->insert(mangled_start, demangled_symbol.get());\n \/\/ Next time, we'll start right after the demangled symbol we inserted.\n search_from = mangled_start + strlen(demangled_symbol.get());\n } else {\n \/\/ Failed to demangle. Retry after the \"_Z\" we just found.\n search_from = mangled_start + 2;\n }\n }\n\n#endif \/\/ defined(__GLIBCXX__)\n}\n#endif \/\/ !defined(USE_SYMBOLIZE)\n\n\/\/ Gets the backtrace as a vector of strings. If possible, resolve symbol\n\/\/ names and attach these. Otherwise just use raw addresses. Returns true\n\/\/ if any symbol name is resolved. Returns false on error and *may* fill\n\/\/ in |error_message| if an error message is available.\nbool GetBacktraceStrings(void *const *trace, int size,\n std::vector<std::string>* trace_strings,\n std::string* error_message) {\n bool symbolized = false;\n\n#if defined(USE_SYMBOLIZE)\n for (int i = 0; i < size; ++i) {\n char symbol[1024];\n \/\/ Subtract by one as return address of function may be in the next\n \/\/ function when a function is annotated as noreturn.\n if (google::Symbolize(static_cast<char *>(trace[i]) - 1,\n symbol, sizeof(symbol))) {\n \/\/ Don't call DemangleSymbols() here as the symbol is demangled by\n \/\/ google::Symbolize().\n trace_strings->push_back(\n base::StringPrintf(\"%s [%p]\", symbol, trace[i]));\n symbolized = true;\n } else {\n trace_strings->push_back(base::StringPrintf(\"%p\", trace[i]));\n }\n }\n#else\n scoped_ptr_malloc<char*> trace_symbols(backtrace_symbols(trace, size));\n if (trace_symbols.get()) {\n for (int i = 0; i < size; ++i) {\n std::string trace_symbol = trace_symbols.get()[i];\n DemangleSymbols(&trace_symbol);\n trace_strings->push_back(trace_symbol);\n }\n symbolized = true;\n } else {\n if (error_message)\n *error_message = safe_strerror(errno);\n for (int i = 0; i < size; ++i) {\n trace_strings->push_back(base::StringPrintf(\"%p\", trace[i]));\n }\n }\n#endif \/\/ defined(USE_SYMBOLIZE)\n\n return symbolized;\n}\n\n} \/\/ namespace\n\nStackTrace::StackTrace() {\n#if defined(OS_MACOSX) && MAC_OS_X_VERSION_MIN_REQUIRED < MAC_OS_X_VERSION_10_5\n if (backtrace == NULL) {\n count_ = 0;\n return;\n }\n#endif\n \/\/ Though the backtrace API man page does not list any possible negative\n \/\/ return values, we take no chance.\n count_ = std::max(backtrace(trace_, arraysize(trace_)), 0);\n}\n\nvoid StackTrace::PrintBacktrace() const {\n#if defined(OS_MACOSX) && MAC_OS_X_VERSION_MIN_REQUIRED < MAC_OS_X_VERSION_10_5\n if (backtrace_symbols_fd == NULL)\n return;\n#endif\n fflush(stderr);\n std::vector<std::string> trace_strings;\n GetBacktraceStrings(trace_, count_, &trace_strings, NULL);\n for (size_t i = 0; i < trace_strings.size(); ++i) {\n std::cerr << \"\\t\" << trace_strings[i] << \"\\n\";\n }\n}\n\nvoid StackTrace::OutputToStream(std::ostream* os) const {\n#if defined(OS_MACOSX) && MAC_OS_X_VERSION_MIN_REQUIRED < MAC_OS_X_VERSION_10_5\n if (backtrace_symbols == NULL)\n return;\n#endif\n std::vector<std::string> trace_strings;\n std::string error_message;\n if (GetBacktraceStrings(trace_, count_, &trace_strings, &error_message)) {\n (*os) << \"Backtrace:\\n\";\n } else {\n if (!error_message.empty())\n error_message = \" (\" + error_message + \")\";\n (*os) << \"Unable to get symbols for backtrace\" << error_message << \". \"\n << \"Dumping raw addresses in trace:\\n\";\n }\n\n for (size_t i = 0; i < trace_strings.size(); ++i) {\n (*os) << \"\\t\" << trace_strings[i] << \"\\n\";\n }\n}\n\n} \/\/ namespace debug\n} \/\/ namespace base\n<commit_msg>Get rid of <iostream> include in stack_trace_posix (forces a static initializer)<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\/debug\/stack_trace.h\"\n\n#include <errno.h>\n#include <execinfo.h>\n#include <fcntl.h>\n#include <stdio.h>\n#include <stdlib.h>\n#include <sys\/param.h>\n#include <sys\/stat.h>\n#include <sys\/types.h>\n#include <unistd.h>\n\n#include <string>\n#include <vector>\n\n#if defined(__GLIBCXX__)\n#include <cxxabi.h>\n#endif\n\n#if defined(OS_MACOSX)\n#include <AvailabilityMacros.h>\n#endif\n\n#include \"base\/basictypes.h\"\n#include \"base\/eintr_wrapper.h\"\n#include \"base\/logging.h\"\n#include \"base\/memory\/scoped_ptr.h\"\n#include \"base\/safe_strerror_posix.h\"\n#include \"base\/string_piece.h\"\n#include \"base\/stringprintf.h\"\n\n#if defined(USE_SYMBOLIZE)\n#include \"base\/third_party\/symbolize\/symbolize.h\"\n#endif\n\nnamespace base {\nnamespace debug {\n\nnamespace {\n\n\/\/ The prefix used for mangled symbols, per the Itanium C++ ABI:\n\/\/ http:\/\/www.codesourcery.com\/cxx-abi\/abi.html#mangling\nconst char kMangledSymbolPrefix[] = \"_Z\";\n\n\/\/ Characters that can be used for symbols, generated by Ruby:\n\/\/ (('a'..'z').to_a+('A'..'Z').to_a+('0'..'9').to_a + ['_']).join\nconst char kSymbolCharacters[] =\n \"abcdefghijklmnopqrstuvwxyzABCDEFGHIJKLMNOPQRSTUVWXYZ0123456789_\";\n\n#if !defined(USE_SYMBOLIZE)\n\/\/ Demangles C++ symbols in the given text. Example:\n\/\/\n\/\/ \"out\/Debug\/base_unittests(_ZN10StackTraceC1Ev+0x20) [0x817778c]\"\n\/\/ =>\n\/\/ \"out\/Debug\/base_unittests(StackTrace::StackTrace()+0x20) [0x817778c]\"\nvoid DemangleSymbols(std::string* text) {\n#if defined(__GLIBCXX__)\n\n std::string::size_type search_from = 0;\n while (search_from < text->size()) {\n \/\/ Look for the start of a mangled symbol, from search_from.\n std::string::size_type mangled_start =\n text->find(kMangledSymbolPrefix, search_from);\n if (mangled_start == std::string::npos) {\n break; \/\/ Mangled symbol not found.\n }\n\n \/\/ Look for the end of the mangled symbol.\n std::string::size_type mangled_end =\n text->find_first_not_of(kSymbolCharacters, mangled_start);\n if (mangled_end == std::string::npos) {\n mangled_end = text->size();\n }\n std::string mangled_symbol =\n text->substr(mangled_start, mangled_end - mangled_start);\n\n \/\/ Try to demangle the mangled symbol candidate.\n int status = 0;\n scoped_ptr_malloc<char> demangled_symbol(\n abi::__cxa_demangle(mangled_symbol.c_str(), NULL, 0, &status));\n if (status == 0) { \/\/ Demangling is successful.\n \/\/ Remove the mangled symbol.\n text->erase(mangled_start, mangled_end - mangled_start);\n \/\/ Insert the demangled symbol.\n text->insert(mangled_start, demangled_symbol.get());\n \/\/ Next time, we'll start right after the demangled symbol we inserted.\n search_from = mangled_start + strlen(demangled_symbol.get());\n } else {\n \/\/ Failed to demangle. Retry after the \"_Z\" we just found.\n search_from = mangled_start + 2;\n }\n }\n\n#endif \/\/ defined(__GLIBCXX__)\n}\n#endif \/\/ !defined(USE_SYMBOLIZE)\n\n\/\/ Gets the backtrace as a vector of strings. If possible, resolve symbol\n\/\/ names and attach these. Otherwise just use raw addresses. Returns true\n\/\/ if any symbol name is resolved. Returns false on error and *may* fill\n\/\/ in |error_message| if an error message is available.\nbool GetBacktraceStrings(void *const *trace, int size,\n std::vector<std::string>* trace_strings,\n std::string* error_message) {\n bool symbolized = false;\n\n#if defined(USE_SYMBOLIZE)\n for (int i = 0; i < size; ++i) {\n char symbol[1024];\n \/\/ Subtract by one as return address of function may be in the next\n \/\/ function when a function is annotated as noreturn.\n if (google::Symbolize(static_cast<char *>(trace[i]) - 1,\n symbol, sizeof(symbol))) {\n \/\/ Don't call DemangleSymbols() here as the symbol is demangled by\n \/\/ google::Symbolize().\n trace_strings->push_back(\n base::StringPrintf(\"%s [%p]\", symbol, trace[i]));\n symbolized = true;\n } else {\n trace_strings->push_back(base::StringPrintf(\"%p\", trace[i]));\n }\n }\n#else\n scoped_ptr_malloc<char*> trace_symbols(backtrace_symbols(trace, size));\n if (trace_symbols.get()) {\n for (int i = 0; i < size; ++i) {\n std::string trace_symbol = trace_symbols.get()[i];\n DemangleSymbols(&trace_symbol);\n trace_strings->push_back(trace_symbol);\n }\n symbolized = true;\n } else {\n if (error_message)\n *error_message = safe_strerror(errno);\n for (int i = 0; i < size; ++i) {\n trace_strings->push_back(base::StringPrintf(\"%p\", trace[i]));\n }\n }\n#endif \/\/ defined(USE_SYMBOLIZE)\n\n return symbolized;\n}\n\n} \/\/ namespace\n\nStackTrace::StackTrace() {\n#if defined(OS_MACOSX) && MAC_OS_X_VERSION_MIN_REQUIRED < MAC_OS_X_VERSION_10_5\n if (backtrace == NULL) {\n count_ = 0;\n return;\n }\n#endif\n \/\/ Though the backtrace API man page does not list any possible negative\n \/\/ return values, we take no chance.\n count_ = std::max(backtrace(trace_, arraysize(trace_)), 0);\n}\n\nvoid StackTrace::PrintBacktrace() const {\n#if defined(OS_MACOSX) && MAC_OS_X_VERSION_MIN_REQUIRED < MAC_OS_X_VERSION_10_5\n if (backtrace_symbols_fd == NULL)\n return;\n#endif\n fflush(stderr);\n std::vector<std::string> trace_strings;\n GetBacktraceStrings(trace_, count_, &trace_strings, NULL);\n for (size_t i = 0; i < trace_strings.size(); ++i) {\n fprintf(stderr, \"\\t%s\\n\", trace_strings[i].c_str());\n }\n}\n\nvoid StackTrace::OutputToStream(std::ostream* os) const {\n#if defined(OS_MACOSX) && MAC_OS_X_VERSION_MIN_REQUIRED < MAC_OS_X_VERSION_10_5\n if (backtrace_symbols == NULL)\n return;\n#endif\n std::vector<std::string> trace_strings;\n std::string error_message;\n if (GetBacktraceStrings(trace_, count_, &trace_strings, &error_message)) {\n (*os) << \"Backtrace:\\n\";\n } else {\n if (!error_message.empty())\n error_message = \" (\" + error_message + \")\";\n (*os) << \"Unable to get symbols for backtrace\" << error_message << \". \"\n << \"Dumping raw addresses in trace:\\n\";\n }\n\n for (size_t i = 0; i < trace_strings.size(); ++i) {\n (*os) << \"\\t\" << trace_strings[i] << \"\\n\";\n }\n}\n\n} \/\/ namespace debug\n} \/\/ namespace base\n<|endoftext|>"} {"text":"<commit_before>\/\/ Copyright (c) 2006-2008 The Chromium Authors. All rights reserved.\n\/\/ Use of this source code is governed by a BSD-style license that can be\n\/\/ found in the LICENSE file.\n\n#include <process.h>\n\n#include \"base\/message_loop.h\"\n#include \"base\/object_watcher.h\"\n#include \"testing\/gtest\/include\/gtest\/gtest.h\"\n\nnamespace {\n\ntypedef testing::Test ObjectWatcherTest;\n\nclass QuitDelegate : public base::ObjectWatcher::Delegate {\n public:\n virtual void OnObjectSignaled(HANDLE object) {\n MessageLoop::current()->Quit();\n }\n};\n\nclass DecrementCountDelegate : public base::ObjectWatcher::Delegate {\n public:\n DecrementCountDelegate(int* counter) : counter_(counter) {\n }\n virtual void OnObjectSignaled(HANDLE object) {\n --(*counter_);\n }\n private:\n int* counter_;\n};\n\n} \/\/ namespace\n\nTEST(ObjectWatcherTest, BasicSignal) {\n MessageLoop message_loop;\n\n base::ObjectWatcher watcher;\n\n \/\/ A manual-reset event that is not yet signaled.\n HANDLE event = CreateEvent(NULL, TRUE, FALSE, NULL);\n\n QuitDelegate delegate;\n bool ok = watcher.StartWatching(event, &delegate);\n EXPECT_TRUE(ok);\n \n SetEvent(event);\n\n MessageLoop::current()->Run();\n\n CloseHandle(event);\n}\n\nTEST(ObjectWatcherTest, BasicCancel) {\n MessageLoop message_loop;\n\n base::ObjectWatcher watcher;\n\n \/\/ A manual-reset event that is not yet signaled.\n HANDLE event = CreateEvent(NULL, TRUE, FALSE, NULL);\n\n QuitDelegate delegate;\n bool ok = watcher.StartWatching(event, &delegate);\n EXPECT_TRUE(ok);\n \n watcher.StopWatching();\n\n CloseHandle(event);\n}\n\n\nTEST(ObjectWatcherTest, CancelAfterSet) {\n MessageLoop message_loop;\n\n base::ObjectWatcher watcher;\n\n int counter = 1;\n DecrementCountDelegate delegate(&counter);\n\n \/\/ A manual-reset event that is not yet signaled.\n HANDLE event = CreateEvent(NULL, TRUE, FALSE, NULL);\n\n bool ok = watcher.StartWatching(event, &delegate);\n EXPECT_TRUE(ok);\n \n SetEvent(event);\n \n \/\/ Let the background thread do its business\n Sleep(30);\n \n watcher.StopWatching();\n \n MessageLoop::current()->RunAllPending();\n\n \/\/ Our delegate should not have fired.\n EXPECT_EQ(1, counter);\n \n CloseHandle(event);\n}\n\nTEST(ObjectWatcherTest, OutlivesMessageLoop) {\n \/\/ Simulate a MessageLoop that dies before an ObjectWatcher. This ordinarily\n \/\/ doesn't happen when people use the Thread class, but it can happen when\n \/\/ people use the Singleton pattern or atexit.\n HANDLE event = CreateEvent(NULL, TRUE, FALSE, NULL); \/\/ not signaled\n {\n base::ObjectWatcher watcher;\n {\n MessageLoop message_loop;\n\n QuitDelegate delegate;\n watcher.StartWatching(event, &delegate);\n }\n }\n CloseHandle(event);\n}\n<commit_msg>Run ObjectWatcher unit tests against all types of message loops.<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 <process.h>\n\n#include \"base\/message_loop.h\"\n#include \"base\/object_watcher.h\"\n#include \"testing\/gtest\/include\/gtest\/gtest.h\"\n\nnamespace {\n\nclass QuitDelegate : public base::ObjectWatcher::Delegate {\n public:\n virtual void OnObjectSignaled(HANDLE object) {\n MessageLoop::current()->Quit();\n }\n};\n\nclass DecrementCountDelegate : public base::ObjectWatcher::Delegate {\n public:\n DecrementCountDelegate(int* counter) : counter_(counter) {\n }\n virtual void OnObjectSignaled(HANDLE object) {\n --(*counter_);\n }\n private:\n int* counter_;\n};\n\n} \/\/ namespace\n\nvoid RunTest_BasicSignal(MessageLoop::Type message_loop_type) {\n MessageLoop message_loop(message_loop_type);\n\n base::ObjectWatcher watcher;\n\n \/\/ A manual-reset event that is not yet signaled.\n HANDLE event = CreateEvent(NULL, TRUE, FALSE, NULL);\n\n QuitDelegate delegate;\n bool ok = watcher.StartWatching(event, &delegate);\n EXPECT_TRUE(ok);\n \n SetEvent(event);\n\n MessageLoop::current()->Run();\n\n CloseHandle(event);\n}\n\nvoid RunTest_BasicCancel(MessageLoop::Type message_loop_type) {\n MessageLoop message_loop(message_loop_type);\n\n base::ObjectWatcher watcher;\n\n \/\/ A manual-reset event that is not yet signaled.\n HANDLE event = CreateEvent(NULL, TRUE, FALSE, NULL);\n\n QuitDelegate delegate;\n bool ok = watcher.StartWatching(event, &delegate);\n EXPECT_TRUE(ok);\n \n watcher.StopWatching();\n\n CloseHandle(event);\n}\n\n\nvoid RunTest_CancelAfterSet(MessageLoop::Type message_loop_type) {\n MessageLoop message_loop(message_loop_type);\n\n base::ObjectWatcher watcher;\n\n int counter = 1;\n DecrementCountDelegate delegate(&counter);\n\n \/\/ A manual-reset event that is not yet signaled.\n HANDLE event = CreateEvent(NULL, TRUE, FALSE, NULL);\n\n bool ok = watcher.StartWatching(event, &delegate);\n EXPECT_TRUE(ok);\n \n SetEvent(event);\n \n \/\/ Let the background thread do its business\n Sleep(30);\n \n watcher.StopWatching();\n \n MessageLoop::current()->RunAllPending();\n\n \/\/ Our delegate should not have fired.\n EXPECT_EQ(1, counter);\n \n CloseHandle(event);\n}\n\nvoid RunTest_OutlivesMessageLoop(MessageLoop::Type message_loop_type) {\n \/\/ Simulate a MessageLoop that dies before an ObjectWatcher. This ordinarily\n \/\/ doesn't happen when people use the Thread class, but it can happen when\n \/\/ people use the Singleton pattern or atexit.\n HANDLE event = CreateEvent(NULL, TRUE, FALSE, NULL); \/\/ not signaled\n {\n base::ObjectWatcher watcher;\n {\n MessageLoop message_loop(message_loop_type);\n\n QuitDelegate delegate;\n watcher.StartWatching(event, &delegate);\n }\n }\n CloseHandle(event);\n}\n\n\/\/-----------------------------------------------------------------------------\n\nTEST(ObjectWatcherTest, BasicSignal) {\n RunTest_BasicSignal(MessageLoop::TYPE_DEFAULT);\n RunTest_BasicSignal(MessageLoop::TYPE_IO);\n RunTest_BasicSignal(MessageLoop::TYPE_UI);\n}\n\nTEST(ObjectWatcherTest, BasicCancel) {\n RunTest_BasicCancel(MessageLoop::TYPE_DEFAULT);\n RunTest_BasicCancel(MessageLoop::TYPE_IO);\n RunTest_BasicCancel(MessageLoop::TYPE_UI);\n}\n\nTEST(ObjectWatcherTest, CancelAfterSet) {\n RunTest_CancelAfterSet(MessageLoop::TYPE_DEFAULT);\n RunTest_CancelAfterSet(MessageLoop::TYPE_IO);\n RunTest_CancelAfterSet(MessageLoop::TYPE_UI);\n}\n\nTEST(ObjectWatcherTest, OutlivesMessageLoop) {\n RunTest_OutlivesMessageLoop(MessageLoop::TYPE_DEFAULT);\n RunTest_OutlivesMessageLoop(MessageLoop::TYPE_IO);\n RunTest_OutlivesMessageLoop(MessageLoop::TYPE_UI);\n}\n<|endoftext|>"} {"text":"<commit_before>#include \"loader.h\"\n#include \"elf.h\"\n#include \"except.h\"\n#include <fstream>\n#include <iostream>\nusing namespace Simulator;\nusing namespace std;\n\nstatic const int PAGE_SIZE = 4096;\n\n\/\/ Throws an exception if the expression is false\nstatic void Verify(bool expr, const char* error = \"invalid ELF file\")\n{\n\tif (!expr) {\n\t\tthrow Exception(error);\n\t}\n}\n\n\/\/ Load the program image into the memory\nstatic MemAddr LoadProgram(IMemoryAdmin* memory, void* _data, MemSize size, bool quiet)\n{\n\tchar* data = static_cast<char*>(_data);\n\tElf64_Ehdr ehdr = *static_cast<Elf64_Ehdr*>(_data);\n\t\n\t\/\/ Unmarshall header\n\tehdr.e_type = letohs (ehdr.e_type);\n\tehdr.e_machine = letohs (ehdr.e_machine);\n\tehdr.e_version = letohl (ehdr.e_version);\n\tehdr.e_entry = letohll(ehdr.e_entry);\n\tehdr.e_phoff = letohll(ehdr.e_phoff);\n\tehdr.e_shoff = letohll(ehdr.e_shoff);\n\tehdr.e_flags = letohl (ehdr.e_flags);\n\tehdr.e_ehsize = letohs (ehdr.e_ehsize);\n\tehdr.e_phentsize = letohs (ehdr.e_phentsize);\n\tehdr.e_phnum = letohs (ehdr.e_phnum);\n\tehdr.e_shentsize = letohs (ehdr.e_shentsize);\n\tehdr.e_shnum = letohs (ehdr.e_shnum);\n\tehdr.e_shstrndx = letohs (ehdr.e_shstrndx);\n\n\t\/\/ Check file signature\n\tif (size < sizeof(Elf64_Ehdr) ||\n\t\tehdr.e_ident[EI_MAG0] != ELFMAG0 || ehdr.e_ident[EI_MAG1] != ELFMAG1 ||\n\t\tehdr.e_ident[EI_MAG2] != ELFMAG2 || ehdr.e_ident[EI_MAG3] != ELFMAG3)\n\t{\n\t\t\/\/ Not an ELF file, load as flat binary, starts at address 0\n\t\tif (!quiet)\n\t\t{\n \t\tcout << \"Loaded flat binary to address 0\" << endl;\n \t}\n\t\tmemory->write(0, data, size, IMemory::PERM_READ | IMemory::PERM_WRITE | IMemory::PERM_EXECUTE);\n\t\treturn 0;\n\t}\n\n\t\/\/ Check that this file is for our 'architecture'\n\tVerify(ehdr.e_ident[EI_CLASS] == ELFCLASS64, \"file is not 64-bit\");\n\tVerify(ehdr.e_ident[EI_DATA] == ELFDATA2LSB, \"file is not little-endian\");\n\tVerify(ehdr.e_ident[EI_VERSION] == EV_CURRENT, \"ELF version mismatch\");\n\tVerify(ehdr.e_type == ET_EXEC, \"file is not an executable file\");\n\tVerify(ehdr.e_machine == EM_ALPHA, \"target architecture is not Alpha\");\n\tVerify(ehdr.e_phoff != 0 && ehdr.e_phnum != 0, \"file has no program header\");\n\tVerify(ehdr.e_phentsize == sizeof(Elf64_Phdr), \"file has an invalid program header\");\n\tVerify(ehdr.e_phoff + ehdr.e_phnum * ehdr.e_phentsize <= size, \"file has an invalid program header\");\n\n\tElf64_Phdr* phdr = static_cast<Elf64_Phdr*>(static_cast<void*>(data + ehdr.e_phoff));\n\n\t\/\/ Determine base address and check for loadable segments\n\tbool hasLoadable = false;\n\tElf64_Addr base = 0;\n\tfor (Elf64_Half i = 0; i < ehdr.e_phnum; i++)\n\t{\n\t phdr[i].p_type = letohl (phdr[i].p_type);\n\t phdr[i].p_flags = letohl (phdr[i].p_flags);\n\t phdr[i].p_offset = letohll(phdr[i].p_offset);\n\t phdr[i].p_vaddr = letohll(phdr[i].p_vaddr);\n\t phdr[i].p_paddr = letohll(phdr[i].p_paddr);\n\t phdr[i].p_filesz = letohll(phdr[i].p_filesz);\n\t phdr[i].p_memsz = letohll(phdr[i].p_memsz);\n\t phdr[i].p_align = letohll(phdr[i].p_align);\n\t \n\t\tif (phdr[i].p_type == PT_LOAD)\n\t\t{\n\t\t\tif (!hasLoadable || phdr[i].p_vaddr < base) {\n\t\t\t\tbase = phdr[i].p_vaddr;\n\t\t\t}\n\t\t\thasLoadable = true;\n\t\t}\n\t}\n\tVerify(hasLoadable, \"file has no loadable segments\");\n\tbase = base & -PAGE_SIZE;\n\n\t\/\/ Then copy the LOAD segments into their right locations\n\tfor (Elf64_Half i = 0; i < ehdr.e_phnum; i++)\n\t{\n\t\tif (phdr[i].p_type == PT_LOAD)\n\t\t{\n \t\t\tVerify(phdr[i].p_memsz >= phdr[i].p_filesz, \"file has an invalid segment\");\n \t\t\t\n\t\t\tint perm = 0;\n\t\t\tif (phdr[i].p_flags & PF_R) perm |= IMemory::PERM_READ;\n\t\t\tif (phdr[i].p_flags & PF_W) perm |= IMemory::PERM_WRITE;\n\t\t\tif (phdr[i].p_flags & PF_X) perm |= IMemory::PERM_EXECUTE;\n\n\t\t\tif (phdr[i].p_filesz > 0)\n\t\t\t{\n\t\t\t\tVerify(phdr[i].p_offset + phdr[i].p_filesz <= size, \"file has an invalid segment\");\n\n\t\t\t\tmemory->write(phdr[i].p_vaddr, data + phdr[i].p_offset, phdr[i].p_filesz, perm);\n\t\t\t}\n\n\t\t\t\/\/ Clear the difference between filesz and memsz\n\t\t\tstatic const char zero[256] = {0};\n\t\t\tElf64_Xword size = phdr[i].p_memsz - phdr[i].p_filesz;\n\t\t\twhile (size > 0)\n\t\t\t{\n\t\t\t\tElf64_Xword num = min(size, 256ULL);\n\t\t\t\tElf64_Addr addr = phdr[i].p_vaddr + phdr[i].p_filesz;\n\t\t\t\tmemory->write(addr, zero, num, perm);\n\t\t\t\tsize -= num;\n\t\t\t\taddr += num;\n\t\t\t}\n\t\t}\n\t}\n\t\n\tif (!quiet)\n\t{\n \tcout << \"Loaded ELF binary at address 0x\" << hex << base << endl;\n \tcout << \"Entry point: 0x\" << hex << ehdr.e_entry << endl;\n }\n\treturn ehdr.e_entry;\n}\n\n\/\/ Load the program file into the memory\nMemAddr LoadProgram(IMemoryAdmin* memory, const string& path, bool quiet)\n{\n ifstream input(path.c_str(), ios::binary);\n if (!input.is_open() || !input.good())\n {\n throw Exception(\"Unable to load program: \" + path);\n }\n\n\t\/\/ Read the entire file\n input.seekg(0, ios::end);\n streampos size = input.tellg();\n char* data = new char[size];\n\ttry\n\t{\n\t\tinput.seekg(0, ios::beg);\n\t\tinput.read(data, size);\n\t\tMemAddr entry = LoadProgram(memory, data, size, quiet);\n\t\tdelete[] data;\n\t\treturn entry;\n\t}\n\tcatch (Exception& e)\n\t{\n\t\tdelete[] data;\n\t\tthrow Exception(string(\"Unable to load program: \") + e.getMessage());\n\t}\n}\n<commit_msg>Fixed ELF loader bug with large bss segments<commit_after>#include \"loader.h\"\n#include \"elf.h\"\n#include \"except.h\"\n#include <fstream>\n#include <iostream>\nusing namespace Simulator;\nusing namespace std;\n\nstatic const int PAGE_SIZE = 4096;\n\n\/\/ Throws an exception if the expression is false\nstatic void Verify(bool expr, const char* error = \"invalid ELF file\")\n{\n\tif (!expr) {\n\t\tthrow Exception(error);\n\t}\n}\n\n\/\/ Load the program image into the memory\nstatic MemAddr LoadProgram(IMemoryAdmin* memory, void* _data, MemSize size, bool quiet)\n{\n\tchar* data = static_cast<char*>(_data);\n\tElf64_Ehdr ehdr = *static_cast<Elf64_Ehdr*>(_data);\n\t\n\t\/\/ Unmarshall header\n\tehdr.e_type = letohs (ehdr.e_type);\n\tehdr.e_machine = letohs (ehdr.e_machine);\n\tehdr.e_version = letohl (ehdr.e_version);\n\tehdr.e_entry = letohll(ehdr.e_entry);\n\tehdr.e_phoff = letohll(ehdr.e_phoff);\n\tehdr.e_shoff = letohll(ehdr.e_shoff);\n\tehdr.e_flags = letohl (ehdr.e_flags);\n\tehdr.e_ehsize = letohs (ehdr.e_ehsize);\n\tehdr.e_phentsize = letohs (ehdr.e_phentsize);\n\tehdr.e_phnum = letohs (ehdr.e_phnum);\n\tehdr.e_shentsize = letohs (ehdr.e_shentsize);\n\tehdr.e_shnum = letohs (ehdr.e_shnum);\n\tehdr.e_shstrndx = letohs (ehdr.e_shstrndx);\n\n\t\/\/ Check file signature\n\tif (size < sizeof(Elf64_Ehdr) ||\n\t\tehdr.e_ident[EI_MAG0] != ELFMAG0 || ehdr.e_ident[EI_MAG1] != ELFMAG1 ||\n\t\tehdr.e_ident[EI_MAG2] != ELFMAG2 || ehdr.e_ident[EI_MAG3] != ELFMAG3)\n\t{\n\t\t\/\/ Not an ELF file, load as flat binary, starts at address 0\n\t\tif (!quiet)\n\t\t{\n \t\tcout << \"Loaded flat binary to address 0\" << endl;\n \t}\n\t\tmemory->write(0, data, size, IMemory::PERM_READ | IMemory::PERM_WRITE | IMemory::PERM_EXECUTE);\n\t\treturn 0;\n\t}\n\n\t\/\/ Check that this file is for our 'architecture'\n\tVerify(ehdr.e_ident[EI_CLASS] == ELFCLASS64, \"file is not 64-bit\");\n\tVerify(ehdr.e_ident[EI_DATA] == ELFDATA2LSB, \"file is not little-endian\");\n\tVerify(ehdr.e_ident[EI_VERSION] == EV_CURRENT, \"ELF version mismatch\");\n\tVerify(ehdr.e_type == ET_EXEC, \"file is not an executable file\");\n\tVerify(ehdr.e_machine == EM_ALPHA, \"target architecture is not Alpha\");\n\tVerify(ehdr.e_phoff != 0 && ehdr.e_phnum != 0, \"file has no program header\");\n\tVerify(ehdr.e_phentsize == sizeof(Elf64_Phdr), \"file has an invalid program header\");\n\tVerify(ehdr.e_phoff + ehdr.e_phnum * ehdr.e_phentsize <= size, \"file has an invalid program header\");\n\n\tElf64_Phdr* phdr = static_cast<Elf64_Phdr*>(static_cast<void*>(data + ehdr.e_phoff));\n\n\t\/\/ Determine base address and check for loadable segments\n\tbool hasLoadable = false;\n\tElf64_Addr base = 0;\n\tfor (Elf64_Half i = 0; i < ehdr.e_phnum; i++)\n\t{\n\t phdr[i].p_type = letohl (phdr[i].p_type);\n\t phdr[i].p_flags = letohl (phdr[i].p_flags);\n\t phdr[i].p_offset = letohll(phdr[i].p_offset);\n\t phdr[i].p_vaddr = letohll(phdr[i].p_vaddr);\n\t phdr[i].p_paddr = letohll(phdr[i].p_paddr);\n\t phdr[i].p_filesz = letohll(phdr[i].p_filesz);\n\t phdr[i].p_memsz = letohll(phdr[i].p_memsz);\n\t phdr[i].p_align = letohll(phdr[i].p_align);\n\t \n\t\tif (phdr[i].p_type == PT_LOAD)\n\t\t{\n\t\t\tif (!hasLoadable || phdr[i].p_vaddr < base) {\n\t\t\t\tbase = phdr[i].p_vaddr;\n\t\t\t}\n\t\t\thasLoadable = true;\n\t\t}\n\t}\n\tVerify(hasLoadable, \"file has no loadable segments\");\n\tbase = base & -PAGE_SIZE;\n\n\t\/\/ Then copy the LOAD segments into their right locations\n\tfor (Elf64_Half i = 0; i < ehdr.e_phnum; i++)\n\t{\n\t\tif (phdr[i].p_type == PT_LOAD)\n\t\t{\n \t\t\tVerify(phdr[i].p_memsz >= phdr[i].p_filesz, \"file has an invalid segment\");\n \t\t\t\n\t\t\tint perm = 0;\n\t\t\tif (phdr[i].p_flags & PF_R) perm |= IMemory::PERM_READ;\n\t\t\tif (phdr[i].p_flags & PF_W) perm |= IMemory::PERM_WRITE;\n\t\t\tif (phdr[i].p_flags & PF_X) perm |= IMemory::PERM_EXECUTE;\n\n\t\t\tif (phdr[i].p_filesz > 0)\n\t\t\t{\n\t\t\t\tVerify(phdr[i].p_offset + phdr[i].p_filesz <= size, \"file has an invalid segment\");\n\n\t\t\t\tmemory->write(phdr[i].p_vaddr, data + phdr[i].p_offset, phdr[i].p_filesz, perm);\n\t\t\t}\n\n\t\t\t\/\/ Clear the difference between filesz and memsz\n\t\t\tstatic const char zero[256] = {0};\n\t\t\tElf64_Xword size = phdr[i].p_memsz - phdr[i].p_filesz;\n \t\tElf64_Addr addr = phdr[i].p_vaddr + phdr[i].p_filesz;\n\t\t\twhile (size > 0)\n\t\t\t{\n\t\t\t\tElf64_Xword num = min(size, 256ULL);\n\t\t\t\tmemory->write(addr, zero, num, perm);\n\t\t\t\tsize -= num;\n\t\t\t\taddr += num;\n\t\t\t}\n\t\t}\n\t}\n\t\n\tif (!quiet)\n\t{\n \tcout << \"Loaded ELF binary at address 0x\" << hex << base << endl;\n \tcout << \"Entry point: 0x\" << hex << ehdr.e_entry << endl;\n }\n\treturn ehdr.e_entry;\n}\n\n\/\/ Load the program file into the memory\nMemAddr LoadProgram(IMemoryAdmin* memory, const string& path, bool quiet)\n{\n ifstream input(path.c_str(), ios::binary);\n if (!input.is_open() || !input.good())\n {\n throw Exception(\"Unable to load program: \" + path);\n }\n\n\t\/\/ Read the entire file\n input.seekg(0, ios::end);\n streampos size = input.tellg();\n char* data = new char[size];\n\ttry\n\t{\n\t\tinput.seekg(0, ios::beg);\n\t\tinput.read(data, size);\n\t\tMemAddr entry = LoadProgram(memory, data, size, quiet);\n\t\tdelete[] data;\n\t\treturn entry;\n\t}\n\tcatch (Exception& e)\n\t{\n\t\tdelete[] data;\n\t\tthrow Exception(string(\"Unable to load program: \") + e.getMessage());\n\t}\n}\n<|endoftext|>"} {"text":"<commit_before>#include <stdio.h>\n#include <ctype.h>\n#include <list>\n#include <iostream>\n#include <string>\n#include <algorithm>\n#include <functional>\n#include <RhIO.hpp>\n#include \"Stream.h\"\n#include \"Shell.h\"\n#include \"utils.h\"\n\n\n#include <stdio.h>\n#include <stdlib.h>\n#include <fcntl.h>\n\nnamespace RhIO\n{\n Shell::Shell(std::string server_)\n : server(server_), client(NULL), clientSub(NULL), stream(NULL)\n {\n }\n\n void Shell::terminal_set_ioconfig() {\n struct termios custom;\n int fd=fileno(stdin);\n tcgetattr(fd, &termsave);\n custom=termsave;\n custom.c_lflag &= ~(ICANON|ECHO);\n tcsetattr(fd,TCSANOW,&custom);\n \/\/ fcntl(fd, F_SETFL, fcntl(fd, F_GETFL, 0)|O_NONBLOCK);\n fcntl(fd, F_SETFL, fcntl(fd, F_GETFL, 0)); \/\/blocking\n }\n\n void Shell::displayPrompt()\n {\n Terminal::setColor(\"yellow\", true);\n std::cout << \"RhIO\";\n Terminal::clear();\n std::cout << \":\";\n Terminal::setColor(\"blue\", true);\n std::cout << getPath();\n Terminal::clear();\n std::cout << \"# \" << std::flush;\n }\n\n void Shell::run()\n {\n\n terminal_set_ioconfig();\n\n std::string reqServer = \"tcp:\/\/\"+server+\":\"+ServerRepPort;\n std::string subServer = \"tcp:\/\/\"+server+\":\"+ServerPubPort;\n terminate = false;\n Terminal::setColor(\"white\", true);\n std::cout << \"Rhoban I\/O shell, welcome!\" << std::endl;\n std::cout << \"Connecting to \" << server << std::endl;\n client = new ClientReq(reqServer);\n clientSub = new ClientSub(subServer);\n stream = new Stream(this);\n std::cout << \"Downloading the tree...\" << std::endl;\n tree = new Node(client, \"\");\n Terminal::clear();\n\n \/\/ Reading lines from stdin\n while (!terminate ) {\n displayPrompt();\n std::string line;\n \/\/ std::getline(std::cin, line);\n line=getLine();\n parse(line);\n }\n\n tcsetattr(fileno(stdin),TCSANOW,&termsave);\n std::cout << std::endl << std::flush;\n\n }\n\n std::string Shell::getLine()\n {\n\n char c;\n std::string line(\"\");\n bool done=false;\n bool esc_mode=false;\n std::deque<std::string>::iterator hist_it=shell_history.end();\n int cursorpos=0;\n std::string lastcmd(\"\");\n\n while(!done)\n {\n if ((c = getchar())>0)\n {\n switch(c)\n {\n case 0x0a: \/\/enter\n\n putchar(c);\n done=true;\n\n lastcmd=\"\";\n if(shell_history.size()>0)\n lastcmd=shell_history.back();\n\n if(line.compare(\"\")!=0 and line.compare(lastcmd)!=0) \/\/store in history if non null and different than the last cmd\n {\n shell_history.push_back(line);\n if(shell_history.size()>MAX_HISTORY)\n shell_history.pop_front();\n hist_it=shell_history.begin();\n }\n return line;\n break;\/\/useless\n\n case 0x01: \/\/Ctrl-a goto begin of line\n Terminal::clearLine();\n displayPrompt();\n std::cout<<line;\n cursorpos=0;\n if(line.size()>0)\n Terminal::cursorNLeft(line.size());\n\n break;\n\n case 0x05: \/\/Ctrl-e goto end of line\n Terminal::clearLine();\n displayPrompt();\n std::cout<<line;\n\n if(cursorpos<line.size())\n {\n Terminal::cursorNRight(line.size()-cursorpos);\n cursorpos=line.size();\n }\n\n break;\n\n case 0xc: \/\/Ctrl-l clear screen\n Terminal::clearScreen();\n Terminal::clearLine();\n Terminal::initCursor();\n displayPrompt();\n line=\"\";\n cursorpos=0;\n break;\n\n case 0x1b: \/\/begin break mode (arrows)\n esc_mode=true;\n\n break;\n\n case 0x5b: \/\/just after 0x1b\n\n break;\n\n case 0x41: \/\/up\n if(esc_mode)\n {\n\n if(shell_history.size()>0 and hist_it!= shell_history.begin())\n {\n line=*--hist_it;\n cursorpos=line.size();\n Terminal::clearLine();\n displayPrompt();\n std::cout<<line;\n }\n esc_mode=false;\n }\n break;\n\n case 0x42: \/\/down\n if(esc_mode)\n {\n if(shell_history.size()>0 and hist_it!= shell_history.end())\n {\n line=*hist_it++;\n cursorpos=line.size();\n Terminal::clearLine();\n displayPrompt();\n std::cout<<line;\n }\n else if( hist_it== shell_history.end())\n {\n Terminal::clearLine();\n displayPrompt();\n line=\"\";\n cursorpos=0;\n }\n\n esc_mode=false;\n }\n break;\n\n case 0x43: \/\/right\n if(esc_mode)\n {\n\n if(cursorpos<line.size())\n {\n Terminal::cursorRight();\n cursorpos++;\n }\n esc_mode=false;\n }\n break;\n\n case 0x44: \/\/left\n if(esc_mode)\n {\n\n if(cursorpos>0)\n {\n Terminal::cursorLeft();\n cursorpos--;\n }\n esc_mode=false;\n }\n break;\n\n case 0x7f: \/\/backspace\n if(line.size()>0)\n {\n line.pop_back();\n Terminal::clearLine();\n displayPrompt();\n cursorpos--;\n std::cout<<line;\n }\n break;\n\n default:\n\n if(line.size()>0)\n {\n std::string tmp(\"\");\n tmp+=c;\n line.insert(cursorpos,tmp);\n }\n else{\n line+=c;\n }\n cursorpos++;\n Terminal::clearLine();\n displayPrompt();\n\n std::cout<<line;\n\n if(line.size()-cursorpos>0)\n Terminal::cursorNLeft(line.size()-cursorpos);\n\n break;\n }\n }\n }\n\n }\n\n void Shell::parse(std::string line)\n {\n \/\/ Try to interpret command as a set\n for (int i=0; i<line.size(); i++) {\n if (line[i] == '=') {\n std::string lvalue = line.substr(0, i);\n std::string rvalue = line.substr(i+1);\n trim(lvalue);\n trim(rvalue);\n set(lvalue, rvalue);\n return;\n }\n }\n\n \/\/ Try to split line into parts and execute it\n std::list<std::string> parts;\n std::string part;\n\n for (int i=0; i<line.size(); i++) {\n if (std::isspace(line[i])) {\n if (part != \"\") {\n parts.push_back(part);\n part = \"\";\n }\n } else {\n part += line[i];\n }\n }\n if (part != \"\") {\n parts.push_back(part);\n }\n\n if (parts.size()) {\n auto command = parts.front();\n parts.pop_front();\n process(command, parts);\n }\n }\n\n void Shell::process(std::string command, std::list<std::string> args)\n {\n \/\/ First, try to quit\/exit\n if (command == \"quit\" || command == \"exit\") {\n terminate = true;\n } else {\n \/\/ Checking for the command in the list\n if (commands.count(command)) {\n std::vector<std::string> argsV;\n for (auto part : args) {\n argsV.push_back(part);\n }\n commands[command]->process(argsV);\n } else {\n auto nodeValue = getNodeValue(command);\n auto value = nodeValue.value;\n\n if (value) {\n Node::get(this, nodeValue);\n std::cout << command << \"=\" << Node::toString(value) << std::endl;\n } else {\n Terminal::setColor(\"red\", true);\n std::cout << \"Unknown command: \" << command << std::endl;\n Terminal::clear();\n }\n }\n }\n }\n\n void Shell::set(std::string lvalue, std::string rvalue)\n {\n auto node = getCurrentNode();\n auto nodeValue = getNodeValue(lvalue);\n auto value = nodeValue.value;\n\n if (value) {\n Node::setFromString(this, nodeValue, rvalue);\n } else {\n Terminal::setColor(\"red\", true);\n std::cout << \"Unknown parameter: \" << lvalue << std::endl;\n Terminal::clear();\n }\n }\n\n void Shell::registerCommand(Command *command)\n {\n command->setShell(this);\n commands[command->getName()] = command;\n }\n\n std::map<std::string, Command*> Shell::getCommands()\n {\n return commands;\n }\n\n ClientReq *Shell::getClient()\n {\n return client;\n }\n\n ClientSub *Shell::getClientSub()\n {\n return clientSub;\n } \n \n void Shell::enterPath(std::string path_)\n {\n path.push_back(path_);\n }\n\n void Shell::upPath()\n {\n if (path.size()) {\n path.pop_back();\n }\n }\n\n bool Shell::goToPath(std::string spath)\n {\n if (auto node = getNode(spath)) {\n auto parts = pathToParts(node->getPath());\n\n path.clear();\n for (auto part : parts) {\n path.push_back(part);\n }\n return true;\n } else {\n return false;\n }\n }\n\n std::string Shell::getPath()\n {\n std::string p = \"\";\n\n for (auto part : path) {\n if (p != \"\") {\n p += \"\/\";\n }\n p += part;\n }\n\n return p;\n }\n\n std::vector<std::string> Shell::pathToParts(std::string spath)\n {\n auto parts = split(spath, '\/');\n std::vector<std::string> path;\n\n for (auto part : parts) {\n if (part != \"\") {\n path.push_back(part);\n }\n }\n\n return path;\n }\n\n Node *Shell::getNode(std::string spath)\n {\n if (spath.size()==0 || spath[0]!='\/') {\n auto myPath = getPath();\n if (myPath != \"\") {\n myPath += \"\/\";\n }\n spath = myPath + spath;\n }\n\n auto path = pathToParts(spath);\n\n Node *node = tree;\n for (auto part : path) {\n node = node->getChild(part);\n if (node == NULL) {\n return NULL;\n }\n }\n return node;\n }\n\n NodeValue Shell::getNodeValue(std::string path)\n {\n auto parts = pathToParts(path);\n\n if (parts.size() == 0) {\n return NodeValue(NULL, NULL);\n }\n\n \/\/ Child name\n auto name = parts[parts.size()-1];\n parts.pop_back();\n\n \/\/ Creating value path\n std::string prefix = \"\";\n for (auto part : parts) {\n if (prefix != \"\") prefix += \"\/\";\n prefix += part;\n }\n if (path[0] == '\/') {\n prefix = \"\/\" + prefix;\n }\n\n \/\/ Getting node\n auto node = getNode(prefix);\n if (node == NULL) {\n return NodeValue(NULL, NULL);\n }\n\n return node->getNodeValue(name);\n }\n \n Stream *Shell::getStream()\n {\n return stream;\n }\n\n ValueBase *Shell::getValue(std::string path)\n {\n return getNodeValue(path).value;\n }\n\n Node *Shell::getCurrentNode()\n {\n return getNode();\n }\n}\n<commit_msg>fix and<commit_after>#include <stdio.h>\n#include <ctype.h>\n#include <list>\n#include <iostream>\n#include <string>\n#include <algorithm>\n#include <functional>\n#include <RhIO.hpp>\n#include \"Stream.h\"\n#include \"Shell.h\"\n#include \"utils.h\"\n\n\n#include <stdio.h>\n#include <stdlib.h>\n#include <fcntl.h>\n\nnamespace RhIO\n{\n Shell::Shell(std::string server_)\n : server(server_), client(NULL), clientSub(NULL), stream(NULL)\n {\n }\n\n void Shell::terminal_set_ioconfig() {\n struct termios custom;\n int fd=fileno(stdin);\n tcgetattr(fd, &termsave);\n custom=termsave;\n custom.c_lflag &= ~(ICANON|ECHO);\n tcsetattr(fd,TCSANOW,&custom);\n \/\/ fcntl(fd, F_SETFL, fcntl(fd, F_GETFL, 0)|O_NONBLOCK);\n fcntl(fd, F_SETFL, fcntl(fd, F_GETFL, 0)); \/\/blocking\n }\n\n void Shell::displayPrompt()\n {\n Terminal::setColor(\"yellow\", true);\n std::cout << \"RhIO\";\n Terminal::clear();\n std::cout << \":\";\n Terminal::setColor(\"blue\", true);\n std::cout << getPath();\n Terminal::clear();\n std::cout << \"# \" << std::flush;\n }\n\n void Shell::run()\n {\n\n terminal_set_ioconfig();\n\n std::string reqServer = \"tcp:\/\/\"+server+\":\"+ServerRepPort;\n std::string subServer = \"tcp:\/\/\"+server+\":\"+ServerPubPort;\n terminate = false;\n Terminal::setColor(\"white\", true);\n std::cout << \"Rhoban I\/O shell, welcome!\" << std::endl;\n std::cout << \"Connecting to \" << server << std::endl;\n client = new ClientReq(reqServer);\n clientSub = new ClientSub(subServer);\n stream = new Stream(this);\n std::cout << \"Downloading the tree...\" << std::endl;\n tree = new Node(client, \"\");\n Terminal::clear();\n\n \/\/ Reading lines from stdin\n while (!terminate ) {\n displayPrompt();\n std::string line;\n \/\/ std::getline(std::cin, line);\n line=getLine();\n parse(line);\n }\n\n tcsetattr(fileno(stdin),TCSANOW,&termsave);\n std::cout << std::endl << std::flush;\n\n }\n\n std::string Shell::getLine()\n {\n\n char c;\n std::string line(\"\");\n bool done=false;\n bool esc_mode=false;\n std::deque<std::string>::iterator hist_it=shell_history.end();\n int cursorpos=0;\n std::string lastcmd(\"\");\n\n while(!done)\n {\n if ((c = getchar())>0)\n {\n switch(c)\n {\n case 0x0a: \/\/enter\n\n putchar(c);\n done=true;\n\n lastcmd=\"\";\n if(shell_history.size()>0)\n lastcmd=shell_history.back();\n\n if(line.compare(\"\")!=0 && line.compare(lastcmd)!=0) \/\/store in history if non null and different than the last cmd\n {\n shell_history.push_back(line);\n if(shell_history.size()>MAX_HISTORY)\n shell_history.pop_front();\n hist_it=shell_history.begin();\n }\n return line;\n break;\/\/useless\n\n case 0x01: \/\/Ctrl-a goto begin of line\n Terminal::clearLine();\n displayPrompt();\n std::cout<<line;\n cursorpos=0;\n if(line.size()>0)\n Terminal::cursorNLeft(line.size());\n\n break;\n\n case 0x05: \/\/Ctrl-e goto end of line\n Terminal::clearLine();\n displayPrompt();\n std::cout<<line;\n\n if(cursorpos<line.size() )\n {\n Terminal::cursorNRight(line.size()-cursorpos);\n cursorpos=line.size();\n }\n\n break;\n\n case 0xc: \/\/Ctrl-l clear screen\n Terminal::clearScreen();\n Terminal::clearLine();\n Terminal::initCursor();\n displayPrompt();\n line=\"\";\n cursorpos=0;\n break;\n\n case 0x1b: \/\/begin break mode (arrows)\n esc_mode=true;\n\n break;\n\n case 0x5b: \/\/just after 0x1b\n\n break;\n\n case 0x41: \/\/up\n if(esc_mode)\n {\n\n if(shell_history.size()>0 && hist_it!= shell_history.begin())\n {\n line=*--hist_it;\n cursorpos=line.size();\n Terminal::clearLine();\n displayPrompt();\n std::cout<<line;\n }\n esc_mode=false;\n }\n break;\n\n case 0x42: \/\/down\n if(esc_mode)\n {\n if(shell_history.size()>0 && hist_it!= shell_history.end())\n {\n line=*hist_it++;\n cursorpos=line.size();\n Terminal::clearLine();\n displayPrompt();\n std::cout<<line;\n }\n else if( hist_it== shell_history.end())\n {\n Terminal::clearLine();\n displayPrompt();\n line=\"\";\n cursorpos=0;\n }\n\n esc_mode=false;\n }\n break;\n\n case 0x43: \/\/right\n if(esc_mode)\n {\n\n if(cursorpos<line.size())\n {\n Terminal::cursorRight();\n cursorpos++;\n }\n esc_mode=false;\n }\n break;\n\n case 0x44: \/\/left\n if(esc_mode)\n {\n\n if(cursorpos>0)\n {\n Terminal::cursorLeft();\n cursorpos--;\n }\n esc_mode=false;\n }\n break;\n\n case 0x7f: \/\/backspace\n if(line.size()>0)\n {\n line.pop_back();\n Terminal::clearLine();\n displayPrompt();\n cursorpos--;\n std::cout<<line;\n }\n break;\n\n default:\n\n if(line.size()>0)\n {\n std::string tmp(\"\");\n tmp+=c;\n line.insert(cursorpos,tmp);\n }\n else{\n line+=c;\n }\n cursorpos++;\n Terminal::clearLine();\n displayPrompt();\n\n std::cout<<line;\n\n if(line.size()-cursorpos>0)\n Terminal::cursorNLeft(line.size()-cursorpos);\n\n break;\n }\n }\n }\n\n }\n\n void Shell::parse(std::string line)\n {\n \/\/ Try to interpret command as a set\n for (int i=0; i<line.size(); i++) {\n if (line[i] == '=') {\n std::string lvalue = line.substr(0, i);\n std::string rvalue = line.substr(i+1);\n trim(lvalue);\n trim(rvalue);\n set(lvalue, rvalue);\n return;\n }\n }\n\n \/\/ Try to split line into parts and execute it\n std::list<std::string> parts;\n std::string part;\n\n for (int i=0; i<line.size(); i++) {\n if (std::isspace(line[i])) {\n if (part != \"\") {\n parts.push_back(part);\n part = \"\";\n }\n } else {\n part += line[i];\n }\n }\n if (part != \"\") {\n parts.push_back(part);\n }\n\n if (parts.size()) {\n auto command = parts.front();\n parts.pop_front();\n process(command, parts);\n }\n }\n\n void Shell::process(std::string command, std::list<std::string> args)\n {\n \/\/ First, try to quit\/exit\n if (command == \"quit\" || command == \"exit\") {\n terminate = true;\n } else {\n \/\/ Checking for the command in the list\n if (commands.count(command)) {\n std::vector<std::string> argsV;\n for (auto part : args) {\n argsV.push_back(part);\n }\n commands[command]->process(argsV);\n } else {\n auto nodeValue = getNodeValue(command);\n auto value = nodeValue.value;\n\n if (value) {\n Node::get(this, nodeValue);\n std::cout << command << \"=\" << Node::toString(value) << std::endl;\n } else {\n Terminal::setColor(\"red\", true);\n std::cout << \"Unknown command: \" << command << std::endl;\n Terminal::clear();\n }\n }\n }\n }\n\n void Shell::set(std::string lvalue, std::string rvalue)\n {\n auto node = getCurrentNode();\n auto nodeValue = getNodeValue(lvalue);\n auto value = nodeValue.value;\n\n if (value) {\n Node::setFromString(this, nodeValue, rvalue);\n } else {\n Terminal::setColor(\"red\", true);\n std::cout << \"Unknown parameter: \" << lvalue << std::endl;\n Terminal::clear();\n }\n }\n\n void Shell::registerCommand(Command *command)\n {\n command->setShell(this);\n commands[command->getName()] = command;\n }\n\n std::map<std::string, Command*> Shell::getCommands()\n {\n return commands;\n }\n\n ClientReq *Shell::getClient()\n {\n return client;\n }\n\n ClientSub *Shell::getClientSub()\n {\n return clientSub;\n }\n\n void Shell::enterPath(std::string path_)\n {\n path.push_back(path_);\n }\n\n void Shell::upPath()\n {\n if (path.size()) {\n path.pop_back();\n }\n }\n\n bool Shell::goToPath(std::string spath)\n {\n if (auto node = getNode(spath)) {\n auto parts = pathToParts(node->getPath());\n\n path.clear();\n for (auto part : parts) {\n path.push_back(part);\n }\n return true;\n } else {\n return false;\n }\n }\n\n std::string Shell::getPath()\n {\n std::string p = \"\";\n\n for (auto part : path) {\n if (p != \"\") {\n p += \"\/\";\n }\n p += part;\n }\n\n return p;\n }\n\n std::vector<std::string> Shell::pathToParts(std::string spath)\n {\n auto parts = split(spath, '\/');\n std::vector<std::string> path;\n\n for (auto part : parts) {\n if (part != \"\") {\n path.push_back(part);\n }\n }\n\n return path;\n }\n\n Node *Shell::getNode(std::string spath)\n {\n if (spath.size()==0 || spath[0]!='\/') {\n auto myPath = getPath();\n if (myPath != \"\") {\n myPath += \"\/\";\n }\n spath = myPath + spath;\n }\n\n auto path = pathToParts(spath);\n\n Node *node = tree;\n for (auto part : path) {\n node = node->getChild(part);\n if (node == NULL) {\n return NULL;\n }\n }\n return node;\n }\n\n NodeValue Shell::getNodeValue(std::string path)\n {\n auto parts = pathToParts(path);\n\n if (parts.size() == 0) {\n return NodeValue(NULL, NULL);\n }\n\n \/\/ Child name\n auto name = parts[parts.size()-1];\n parts.pop_back();\n\n \/\/ Creating value path\n std::string prefix = \"\";\n for (auto part : parts) {\n if (prefix != \"\") prefix += \"\/\";\n prefix += part;\n }\n if (path[0] == '\/') {\n prefix = \"\/\" + prefix;\n }\n\n \/\/ Getting node\n auto node = getNode(prefix);\n if (node == NULL) {\n return NodeValue(NULL, NULL);\n }\n\n return node->getNodeValue(name);\n }\n\n Stream *Shell::getStream()\n {\n return stream;\n }\n\n ValueBase *Shell::getValue(std::string path)\n {\n return getNodeValue(path).value;\n }\n\n Node *Shell::getCurrentNode()\n {\n return getNode();\n }\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\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\n\/\/ Connects to the server at a the given port.\nvoid Connect(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 \/\/ Try each address until we successfully connect().\n \/\/ If socket() (or connect()) fails, close the socket and try 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\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 RequestSay(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 RequestLogin(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 RequestLogout() {\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 RequestJoin(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\/\/ 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(std::string input, char delimiter) {\n std::vector<std::string> result;\n std::string word = \"\";\n\n for (char c : input) {\n if (c != delimiter) {\n word += c;\n } else {\n result.push_back(word);\n word = \"\";\n }\n }\n result.push_back(word);\n\n return result;\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 RequestLogout();\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 << \"Invalid 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 std::string input;\n\n struct timeval timeout;\n fd_set read_set;\n int file_desc = 0;\n int result;\n char receive_buffer[SAY_MAX];\n memset(&receive_buffer, 0, SAY_MAX);\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 Connect(domain, port_str);\n\n RequestLogin(username);\n\n channel = (char *) \"Common\";\n RequestJoin(channel);\n\n \/\/ TODO handle response from send\n\n while(1) {\n FD_ZERO(&read_set);\n FD_SET(file_desc, &read_set);\n\n timeout.tv_sec = 5; \/\/ TODO change time value?\n timeout.tv_usec = 0;\n\n\/\/ if ((result = select(file_desc + 1, &read_set, NULL, NULL, NULL)) < 0) {\n\/\/ continue;\n\/\/ }\n if ((result = select(file_desc + 1, &read_set, NULL, NULL, NULL)) < 0) {\n Error(\"client: problem using select\");\n }\n\n\/\/ size_t size = sizeof(receive_buffer);\n\n\/\/ std::cout << \"past select, result: \" << result << std::endl;\n\n if (result > 0) {\n if (FD_ISSET(file_desc, &read_set)) {\n \/\/ Socket has data\n result = read(client_socket, receive_buffer, sizeof(receive_buffer));\n }\n\n if (result == 0) {\n close(file_desc);\n } else {\n \/\/ TODO capture user input, store, clean input, then print buffer, afterward replace input\n std::cout << \"[\" << channel << \"]\" << \"[\" << username << \"]: \" << receive_buffer << std::endl;\n }\n }\n\n\/\/ std::cout << \"past check result\" << std::endl;\n\n std::cout << \"> \";\n getline(std::cin, input);\n\n if (input[0] == '\/') {\n if (!ProcessInput(input)) {\n break;\n }\n } else {\n \/\/ Send chat messages\n RequestSay(input.c_str());\n std::cout << \"[\" << channel << \"]\" << \"[\" << username << \"]: \" << input << std::endl;\n }\n\n\/\/ if (FD_ISSET(STDIN_FILENO, &read_set)) {\n\/\/ std::cout << \"> \";\n\/\/ getline(std::cin, input);\n\/\/\n\/\/ if (input[0] == '\/') {\n\/\/ if (!ProcessInput(input)) {\n\/\/ break;\n\/\/ }\n\/\/ } else {\n\/\/ \/\/ Send chat messages\n\/\/ RequestSay(input.c_str());\n\/\/ std::cout << \"[\" << channel << \"]\" << \"[\" << username << \"]: \" << input << std::endl;\n\/\/ }\n\/\/ }\n\n\/\/ std::cout << \"past getline\" << std::endl;\n\n }\n\n return 0;\n}<commit_msg>remove timeout part 2<commit_after>#include <netdb.h>\n#include <unistd.h>\n#include <sys\/fcntl.h>\n\n#include \"client.h\"\n#include \"duckchat.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\n\/\/ Connects to the server at a the given port.\nvoid Connect(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 \/\/ Try each address until we successfully connect().\n \/\/ If socket() (or connect()) fails, close the socket and try 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\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 RequestSay(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 RequestLogin(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 RequestLogout() {\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 RequestJoin(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\/\/ 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(std::string input, char delimiter) {\n std::vector<std::string> result;\n std::string word = \"\";\n\n for (char c : input) {\n if (c != delimiter) {\n word += c;\n } else {\n result.push_back(word);\n word = \"\";\n }\n }\n result.push_back(word);\n\n return result;\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 RequestLogout();\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 << \"Invalid 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 std::string input;\n\n\/\/ struct timeval timeout;\n fd_set read_set;\n int file_desc = 0;\n int result;\n char receive_buffer[SAY_MAX];\n memset(&receive_buffer, 0, SAY_MAX);\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 Connect(domain, port_str);\n\n RequestLogin(username);\n\n channel = (char *) \"Common\";\n RequestJoin(channel);\n\n \/\/ TODO handle response from send\n\n while(1) {\n FD_ZERO(&read_set);\n FD_SET(file_desc, &read_set);\n\n timeout.tv_sec = 5; \/\/ TODO change time value?\n timeout.tv_usec = 0;\n\n\/\/ if ((result = select(file_desc + 1, &read_set, NULL, NULL, NULL)) < 0) {\n\/\/ continue;\n\/\/ }\n if ((result = select(file_desc + 1, &read_set, NULL, NULL, NULL)) < 0) {\n Error(\"client: problem using select\");\n }\n\n\/\/ size_t size = sizeof(receive_buffer);\n\n\/\/ std::cout << \"past select, result: \" << result << std::endl;\n\n if (result > 0) {\n if (FD_ISSET(file_desc, &read_set)) {\n \/\/ Socket has data\n result = read(client_socket, receive_buffer, sizeof(receive_buffer));\n }\n\n if (result == 0) {\n close(file_desc);\n } else {\n \/\/ TODO capture user input, store, clean input, then print buffer, afterward replace input\n std::cout << \"[\" << channel << \"]\" << \"[\" << username << \"]: \" << receive_buffer << std::endl;\n }\n }\n\n\/\/ std::cout << \"past check result\" << std::endl;\n\n std::cout << \"> \";\n getline(std::cin, input);\n\n if (input[0] == '\/') {\n if (!ProcessInput(input)) {\n break;\n }\n } else {\n \/\/ Send chat messages\n RequestSay(input.c_str());\n std::cout << \"[\" << channel << \"]\" << \"[\" << username << \"]: \" << input << std::endl;\n }\n\n\/\/ if (FD_ISSET(STDIN_FILENO, &read_set)) {\n\/\/ std::cout << \"> \";\n\/\/ getline(std::cin, input);\n\/\/\n\/\/ if (input[0] == '\/') {\n\/\/ if (!ProcessInput(input)) {\n\/\/ break;\n\/\/ }\n\/\/ } else {\n\/\/ \/\/ Send chat messages\n\/\/ RequestSay(input.c_str());\n\/\/ std::cout << \"[\" << channel << \"]\" << \"[\" << username << \"]: \" << input << std::endl;\n\/\/ }\n\/\/ }\n\n\/\/ std::cout << \"past getline\" << std::endl;\n\n }\n\n return 0;\n}<|endoftext|>"} {"text":"<commit_before>\/*****************************************************************************\n * discoSnp++: discovering polymorphism from raw unassembled NGS reads\n * A tool from the GATB (Genome Assembly Tool Box)\n * Copyright (C) 2014 INRIA\n * Authors: P.Peterlongo, E.Drezen\n *\n * This program is free software: you can redistribute it and\/or modify\n * it under the terms of the GNU Affero General Public License as\n * published by the Free Software Foundation, either version 3 of the\n * License, or (at your option) any later version.\n *\n * This program is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the\n * GNU Affero General Public License for more details.\n *\n * You should have received a copy of the GNU Affero General Public License\n * along with this program. If not, see <http:\/\/www.gnu.org\/licenses\/>.\n *****************************************************************************\/\n\n\/*\n * outputs.c\n *\n * Created on: 27 oct. 2010\n * Author: ppeterlo\n *\/\n\n\/\/#define DEBUG_QUALITY\n\n\n\/\/#if !HAVE_LOG2F\n\/\/#define log2f log\n\/\/#endif\n\n#include <outputs.h>\n\n\/\/\/*Calculates the phi coefficient of 2*2 contingency table. Value close to 1 indicates an association between the alleles and the conditions.*\/\n\/\/\/*Note that this value is valid if at least 3 out of the 4 values are non 0, or if the .Otherwise it output -1*\/\n\/\/float phi(int a,int b, int c,int d) {\n\/\/ \/\/ int denom=(a+b)*(c+d)*(a+c)*(b+d);\n\/\/ \/\/ if (denom==0)\n\/\/ \/\/ return 0;\n\/\/ \/\/ float Phi = (a*d-b*c)\/sqrt(denom);\n\/\/ \/\/ return Phi;\n\/\/ if((a+b)==0) return 0;\n\/\/ if((c+d)==0) return 0;\n\/\/ if((a+c)==0) return 0;\n\/\/ if((b+d)==0) return 0;\n\/\/ \/\/ avoid the computation of denom, possibly bigger than an int or an unsigned long long int...\n\/\/ return (a*d-b*c)\/(sqrt((float)(a+b))*sqrt((float)(c+d))*sqrt((float)(a+c))*sqrt((float)(b+d)));\n\/\/}\n\n\/*Computes the chi2 value of the matrix 2*number_of_read_sets *\/\nfloat rank_phi_N (const int *sum_up, const int *sum_lo, const int number_of_read_sets) {\n if (number_of_read_sets==1)\n return 0;\n int i;\n float n=0; for (i=0;i<number_of_read_sets;i++) n+=sum_up[i]+sum_lo[i];\n float all_up=0; for (i=0;i<number_of_read_sets;i++) all_up+=sum_up[i];\n float all_lo=0; for (i=0;i<number_of_read_sets;i++) all_lo+=sum_lo[i];\n float expected;\n \n \n float som=0;\n for(i=0;i<number_of_read_sets;i++){\n \/\/ UPPER PATH\n expected=(sum_up[i]+sum_lo[i])*all_up\/n;\n if(expected!=0) som+=pow(sum_up[i]-expected,2)\/expected;\n \/\/ LOWER PATH\n expected=(sum_up[i]+sum_lo[i])*all_lo\/n;\n if(expected!=0) som+=pow(sum_lo[i]-expected,2)\/expected;\n }\n \n return sqrt(som\/n);\n}\n\n\/\/\/*Computes all pairwise phi values for all pairs of conditions and returns the max*\/\n\/\/float rank_phi(const int *sum_up, const int *sum_lo, const int number_of_read_sets) {\n\/\/ float phimax=0;\n\/\/ if (number_of_read_sets==1)\n\/\/ return 0;\n\/\/ else\n\/\/ {\n\/\/ int i,j;\n\/\/ float phicur=0;\n\/\/ for (i=0;i<number_of_read_sets;i++)\n\/\/ for (j=i+1;j<number_of_read_sets;j++)\n\/\/ {\n\/\/ phicur=phi(sum_up[i],sum_up[j],sum_lo[i],sum_lo[j]);\n\/\/ phimax=MAX(phimax,ABS(phicur));\n\/\/ }\n\/\/ }\n\/\/ return phimax;\n\/\/}\n\n\/**\n * Computes the log10(Cnk)\n *\/\nconst double mylog10choose (const int n,const int k){\n if (n==k){\n return 0;\n }\n double res=0;\n int i;\n for(i=k+1;i<=n;i++){\n res+=log10(i);\n }\n \n for(i=1;i<=n-k;i++) {\n res-=log10(i);\n }\n \n return res;\n}\n\n\nchar * genotype_simple_model(const int c1, const int c2, const float err, const float prior_het){\n \n \/\/ LIKELIHOOD\n double lik0 = c1*log10(1-err)+c2*log10(err)+mylog10choose(c1+c2,c1);\n double lik1 = c2*log10(1-err)+c1*log10(err)+mylog10choose(c1+c2,c1);\n double lik2 = (c1+c2)*log10(0.5)+mylog10choose(c1+c2,c1);\n \n \/\/ PRIOR HETEROZYGOUS\n lik0+=log10((1-prior_het)\/2);\n lik1+=log10((1-prior_het)\/2);\n lik2+=log10(prior_het);\n \n \/\/ PHRED SCORE\n lik0=floor(-10*lik0);\n lik1=floor(-10*lik1);\n lik2=floor(-10*lik2);\n \n \/\/ FORMATING RESULTS\n char * append = (char *)malloc(sizeof(char)*2048); test_alloc(append);\n char geno[4];\n if (lik0<lik1 &&lik0<lik2){\n sprintf(geno, \"0\/0\");\n }\n else\n {\n \n if (lik1<lik0 && lik1<lik2){\n sprintf(geno, \"1\/1\");\n }\n \n else{\n sprintf(geno, \"0\/1\");\n }\n }\n sprintf(append, \"%s:%d,%d,%d\",geno,(int)lik0,(int)lik2,(int)lik1);\n return append;\n}\n\n\/**\n * prints a couple using the reads starting position instead of coverage per position\n *\/\nvoid print_couple_i(ofstream &fasta_out, FragmentIndex & index, int fragment_id, GlobalValues & gv){\n\t\n \n \/\/ on upper path\n\tint sum_up[gv.number_of_read_sets];\n\tint avg_up[gv.number_of_read_sets];\n \n\t\/\/ on lower path\n\tint sum_lo[gv.number_of_read_sets];\n\tint avg_lo[gv.number_of_read_sets];\n \n \n\tint read_set_id;\n \n \n \n \t\/\/if( gv.qual ){\n \n for(read_set_id=0;read_set_id<gv.number_of_read_sets;read_set_id++){\n avg_up[read_set_id] = 0;\n avg_lo[read_set_id] = 0;\n \n if (index.all_predictions[fragment_id ]->nb_mapped_qualities[read_set_id]>0)\n avg_up[read_set_id] += index.all_predictions[fragment_id ]->nb_mapped_qualities[read_set_id]==0?0:index.all_predictions[fragment_id ]->sum_qualities[read_set_id] \/ index.all_predictions[fragment_id ]->nb_mapped_qualities[read_set_id];\n if (index.all_predictions[fragment_id+1]->nb_mapped_qualities[read_set_id]>0)\n avg_lo[read_set_id] += index.all_predictions[fragment_id+1]->nb_mapped_qualities[read_set_id]==0?0:index.all_predictions[fragment_id+1]->sum_qualities[read_set_id] \/ index.all_predictions[fragment_id+1]->nb_mapped_qualities[read_set_id];\n }\n \/\/ }\n \n\t\/\/\tfloat sum=0;\n\tfor(int read_set_id=0;read_set_id<gv.number_of_read_sets;read_set_id++){\n sum_up[read_set_id]=index.all_predictions[fragment_id]->number_mapped_reads[read_set_id];\n sum_lo[read_set_id]=index.all_predictions[fragment_id+1]->number_mapped_reads[read_set_id];\n\t}\n const float err = 0.01;\n const float prior_het = 1\/(float)3;\n float rank = rank_phi_N(sum_up,sum_lo,gv.number_of_read_sets);\n char genotypes[819200]; genotypes[0]='\\0';\n char append[160000];\n \n if(gv.compute_genotypes){\n \/\/ CONSTRUCT THE COMMON HEADER COMMENT (Genotypes, Coverages, Qualities, Rank)\n for(read_set_id=0;read_set_id<gv.number_of_read_sets;read_set_id++){\n char * geno_likelihood = genotype_simple_model(sum_up[read_set_id], sum_lo[read_set_id], err, prior_het);\n sprintf(append, \"G%d_%s|\",read_set_id+1,geno_likelihood);\n free(geno_likelihood);\n strcat(genotypes,append);\n }\n }\n \/\/ cout<<\"genotypes\"<<genotypes<<endl; \/\/DEB\n \/\/ DEAL WITH STANDARD FASTA OR ONE LINE PER COUPLE (STARTING WITH THE RANK)\n char sep;\n if (gv.standard_fasta) {\n \n sep='\\n';\n }\n else{\n fasta_out<<setprecision(5)<<rank<<\" \";\n \/\/ fprintf(out, \"%2f \",rank);\n sep=';';\n }\n \n \n \/\/ UPPER PATH\n fasta_out<<\">\"<<index.all_predictions[fragment_id]->sequence.getComment()<<\"|\";\n for(read_set_id=0;read_set_id<gv.number_of_read_sets;read_set_id++){\n fasta_out<<\"C\"<<read_set_id+1<<\"_\"<<sum_up[read_set_id]<<\"|\";\n }\n for(read_set_id=0;read_set_id<gv.number_of_read_sets;read_set_id++){\n fasta_out<<\"Q\"<<read_set_id+1<<\"_\"<<avg_up[read_set_id]<<\"|\";\n }\n fasta_out<<genotypes;\n fasta_out<<\"rank_\"<<setprecision(5)<<rank;\n \n fasta_out<<sep<<index.all_predictions[fragment_id]->sequence.toString()<<sep;\n \n \/\/ LOWER PATH\n fasta_out<<\">\"<<index.all_predictions[fragment_id+1]->sequence.getComment()<<\"|\";\n for(read_set_id=0;read_set_id<gv.number_of_read_sets;read_set_id++){\n fasta_out<<\"C\"<<read_set_id+1<<\"_\"<<sum_lo[read_set_id]<<\"|\";\n }\n for(read_set_id=0;read_set_id<gv.number_of_read_sets;read_set_id++){\n fasta_out<<\"Q\"<<read_set_id+1<<\"_\"<<avg_lo[read_set_id]<<\"|\";\n }\n fasta_out<<genotypes;\n fasta_out<<\"rank_\"<<setprecision(5)<<rank;\n \n fasta_out<<sep<<index.all_predictions[fragment_id+1]->sequence.toString()<<endl;\n \n \n \n}\n\n\n\n\/**\n * checks if at least one read set provide read coherency for a path.\n *\/\ninline bool one_coherent(FragmentInfo * fragment, int number_of_read_sets, GlobalValues & gv){\n int i;\n for(i=0;i<number_of_read_sets;i++){\n\n if(fragment->read_coherent[i]) return true;\n \n }\n return false;\n}\n\n\nvoid print_results_2_paths_per_event(ofstream &coherent_out, ofstream &uncoherent_out, FragmentIndex &index, GlobalValues & gv){\n index.nb_coherent=0;\n index.nb_uncoherent=0;\n \/\/printf(\"number ofread sets = %d\\n\", number_of_read_sets);\n \n \/\/\n \/\/ C1 C2 C3 ....\n \/\/ path1 (i) [0\/1] [0\/1] [0\/1]...\n \/\/ path2 (i+1) [0\/1] [0\/1] [0\/1]...\n \/\/\n \/\/ event is kept only if each line has at least one \"1\" per line:\n \/\/\n \n \n \n for(int i=0;i<index.all_predictions.size();i+=2){\n \/\/ cout<<\"HEY \"<<one_coherent(index.all_predictions[i],gv.number_of_read_sets)<<\" -- \"<<one_coherent(index.all_predictions[i+1],gv.number_of_read_sets)<<endl; \/\/DEB\n if(one_coherent(index.all_predictions[i],gv.number_of_read_sets,gv) || one_coherent(index.all_predictions[i+1],gv.number_of_read_sets,gv))\n {\n index.nb_coherent++;\n print_couple_i(coherent_out, index, i, gv);\n }\n else{\n index.nb_uncoherent++;\n print_couple_i(uncoherent_out, index, i, gv);\n }\n }\n}\n\n\n\n\n\n<commit_msg>avoid to output a fake genotype 0\/1 when a variant is not read coherent of a read set<commit_after>\/*****************************************************************************\n * discoSnp++: discovering polymorphism from raw unassembled NGS reads\n * A tool from the GATB (Genome Assembly Tool Box)\n * Copyright (C) 2014 INRIA\n * Authors: P.Peterlongo, E.Drezen\n *\n * This program is free software: you can redistribute it and\/or modify\n * it under the terms of the GNU Affero General Public License as\n * published by the Free Software Foundation, either version 3 of the\n * License, or (at your option) any later version.\n *\n * This program is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the\n * GNU Affero General Public License for more details.\n *\n * You should have received a copy of the GNU Affero General Public License\n * along with this program. If not, see <http:\/\/www.gnu.org\/licenses\/>.\n *****************************************************************************\/\n\n\/*\n * outputs.c\n *\n * Created on: 27 oct. 2010\n * Author: ppeterlo\n *\/\n\n\/\/#define DEBUG_QUALITY\n\n\n\/\/#if !HAVE_LOG2F\n\/\/#define log2f log\n\/\/#endif\n\n#include <outputs.h>\n\n\/\/\/*Calculates the phi coefficient of 2*2 contingency table. Value close to 1 indicates an association between the alleles and the conditions.*\/\n\/\/\/*Note that this value is valid if at least 3 out of the 4 values are non 0, or if the .Otherwise it output -1*\/\n\/\/float phi(int a,int b, int c,int d) {\n\/\/ \/\/ int denom=(a+b)*(c+d)*(a+c)*(b+d);\n\/\/ \/\/ if (denom==0)\n\/\/ \/\/ return 0;\n\/\/ \/\/ float Phi = (a*d-b*c)\/sqrt(denom);\n\/\/ \/\/ return Phi;\n\/\/ if((a+b)==0) return 0;\n\/\/ if((c+d)==0) return 0;\n\/\/ if((a+c)==0) return 0;\n\/\/ if((b+d)==0) return 0;\n\/\/ \/\/ avoid the computation of denom, possibly bigger than an int or an unsigned long long int...\n\/\/ return (a*d-b*c)\/(sqrt((float)(a+b))*sqrt((float)(c+d))*sqrt((float)(a+c))*sqrt((float)(b+d)));\n\/\/}\n\n\/*Computes the chi2 value of the matrix 2*number_of_read_sets *\/\nfloat rank_phi_N (const int *sum_up, const int *sum_lo, const int number_of_read_sets) {\n if (number_of_read_sets==1)\n return 0;\n int i;\n float n=0; for (i=0;i<number_of_read_sets;i++) n+=sum_up[i]+sum_lo[i];\n float all_up=0; for (i=0;i<number_of_read_sets;i++) all_up+=sum_up[i];\n float all_lo=0; for (i=0;i<number_of_read_sets;i++) all_lo+=sum_lo[i];\n float expected;\n \n \n float som=0;\n for(i=0;i<number_of_read_sets;i++){\n \/\/ UPPER PATH\n expected=(sum_up[i]+sum_lo[i])*all_up\/n;\n if(expected!=0) som+=pow(sum_up[i]-expected,2)\/expected;\n \/\/ LOWER PATH\n expected=(sum_up[i]+sum_lo[i])*all_lo\/n;\n if(expected!=0) som+=pow(sum_lo[i]-expected,2)\/expected;\n }\n \n return sqrt(som\/n);\n}\n\n\/\/\/*Computes all pairwise phi values for all pairs of conditions and returns the max*\/\n\/\/float rank_phi(const int *sum_up, const int *sum_lo, const int number_of_read_sets) {\n\/\/ float phimax=0;\n\/\/ if (number_of_read_sets==1)\n\/\/ return 0;\n\/\/ else\n\/\/ {\n\/\/ int i,j;\n\/\/ float phicur=0;\n\/\/ for (i=0;i<number_of_read_sets;i++)\n\/\/ for (j=i+1;j<number_of_read_sets;j++)\n\/\/ {\n\/\/ phicur=phi(sum_up[i],sum_up[j],sum_lo[i],sum_lo[j]);\n\/\/ phimax=MAX(phimax,ABS(phicur));\n\/\/ }\n\/\/ }\n\/\/ return phimax;\n\/\/}\n\n\/**\n * Computes the log10(Cnk)\n *\/\nconst double mylog10choose (const int n,const int k){\n if (n==k){\n return 0;\n }\n double res=0;\n int i;\n for(i=k+1;i<=n;i++){\n res+=log10(i);\n }\n \n for(i=1;i<=n-k;i++) {\n res-=log10(i);\n }\n \n return res;\n}\n\n\nchar * genotype_simple_model(const int c1, const int c2, const float err, const float prior_het){\n \n \/\/ LIKELIHOOD\n double lik0 = c1*log10(1-err)+c2*log10(err)+mylog10choose(c1+c2,c1);\n double lik1 = c2*log10(1-err)+c1*log10(err)+mylog10choose(c1+c2,c1);\n double lik2 = (c1+c2)*log10(0.5)+mylog10choose(c1+c2,c1);\n \n \/\/ PRIOR HETEROZYGOUS\n lik0+=log10((1-prior_het)\/2);\n lik1+=log10((1-prior_het)\/2);\n lik2+=log10(prior_het);\n \n \/\/ PHRED SCORE\n lik0=floor(-10*lik0);\n lik1=floor(-10*lik1);\n lik2=floor(-10*lik2);\n \n \/\/ FORMATING RESULTS\n char * append = (char *)malloc(sizeof(char)*2048); test_alloc(append);\n char geno[4];\n if (lik0<lik1 &&lik0<lik2){\n sprintf(geno, \"0\/0\");\n }\n else\n {\n \n if (lik1<lik0 && lik1<lik2){\n sprintf(geno, \"1\/1\");\n }\n \n else{\n sprintf(geno, \"0\/1\");\n }\n }\n sprintf(append, \"%s:%d,%d,%d\",geno,(int)lik0,(int)lik2,(int)lik1);\n return append;\n}\n\n\/**\n * prints a couple using the reads starting position instead of coverage per position\n *\/\nvoid print_couple_i(ofstream &fasta_out, FragmentIndex & index, int fragment_id, GlobalValues & gv){\n\t\n \n \/\/ on upper path\n\tint sum_up[gv.number_of_read_sets];\n\tint avg_up[gv.number_of_read_sets];\n \n\t\/\/ on lower path\n\tint sum_lo[gv.number_of_read_sets];\n\tint avg_lo[gv.number_of_read_sets];\n \n \n\tint read_set_id;\n \n \n \n \t\/\/if( gv.qual ){\n \n for(read_set_id=0;read_set_id<gv.number_of_read_sets;read_set_id++){\n avg_up[read_set_id] = 0;\n avg_lo[read_set_id] = 0;\n \n if (index.all_predictions[fragment_id ]->nb_mapped_qualities[read_set_id]>0)\n avg_up[read_set_id] += index.all_predictions[fragment_id ]->nb_mapped_qualities[read_set_id]==0?0:index.all_predictions[fragment_id ]->sum_qualities[read_set_id] \/ index.all_predictions[fragment_id ]->nb_mapped_qualities[read_set_id];\n if (index.all_predictions[fragment_id+1]->nb_mapped_qualities[read_set_id]>0)\n avg_lo[read_set_id] += index.all_predictions[fragment_id+1]->nb_mapped_qualities[read_set_id]==0?0:index.all_predictions[fragment_id+1]->sum_qualities[read_set_id] \/ index.all_predictions[fragment_id+1]->nb_mapped_qualities[read_set_id];\n }\n \/\/ }\n \n\t\/\/\tfloat sum=0;\n\tfor(int read_set_id=0;read_set_id<gv.number_of_read_sets;read_set_id++){\n sum_up[read_set_id]=index.all_predictions[fragment_id]->number_mapped_reads[read_set_id];\n sum_lo[read_set_id]=index.all_predictions[fragment_id+1]->number_mapped_reads[read_set_id];\n\t}\n const float err = 0.01;\n const float prior_het = 1\/(float)3;\n float rank = rank_phi_N(sum_up,sum_lo,gv.number_of_read_sets);\n char genotypes[819200]; genotypes[0]='\\0';\n char append[160000];\n \n if(gv.compute_genotypes){\n \/\/ CONSTRUCT THE COMMON HEADER COMMENT (Genotypes, Coverages, Qualities, Rank)\n for(read_set_id=0;read_set_id<gv.number_of_read_sets;read_set_id++){\n char * geno_likelihood;\n if (!index.all_predictions[fragment_id]->read_coherent[read_set_id] && !index.all_predictions[fragment_id+1]->read_coherent[read_set_id]) {\n geno_likelihood= (char *) malloc(9*sizeof(char)); test_alloc(geno_likelihood);\n sprintf(geno_likelihood, \".\/.:.,.,.\");\n }\n else {\n geno_likelihood = genotype_simple_model(sum_up[read_set_id], sum_lo[read_set_id], err, prior_het);\n }\n sprintf(append, \"G%d_%s|\",read_set_id+1,geno_likelihood);\n free(geno_likelihood);\n strcat(genotypes,append);\n }\n }\n \/\/ cout<<\"genotypes\"<<genotypes<<endl; \/\/DEB\n \/\/ DEAL WITH STANDARD FASTA OR ONE LINE PER COUPLE (STARTING WITH THE RANK)\n char sep;\n if (gv.standard_fasta) {\n \n sep='\\n';\n }\n else{\n fasta_out<<setprecision(5)<<rank<<\" \";\n \/\/ fprintf(out, \"%2f \",rank);\n sep=';';\n }\n \n \n \/\/ UPPER PATH\n fasta_out<<\">\"<<index.all_predictions[fragment_id]->sequence.getComment()<<\"|\";\n for(read_set_id=0;read_set_id<gv.number_of_read_sets;read_set_id++){\n fasta_out<<\"C\"<<read_set_id+1<<\"_\"<<sum_up[read_set_id]<<\"|\";\n }\n for(read_set_id=0;read_set_id<gv.number_of_read_sets;read_set_id++){\n fasta_out<<\"Q\"<<read_set_id+1<<\"_\"<<avg_up[read_set_id]<<\"|\";\n }\n fasta_out<<genotypes;\n fasta_out<<\"rank_\"<<setprecision(5)<<rank;\n \n fasta_out<<sep<<index.all_predictions[fragment_id]->sequence.toString()<<sep;\n \n \/\/ LOWER PATH\n fasta_out<<\">\"<<index.all_predictions[fragment_id+1]->sequence.getComment()<<\"|\";\n for(read_set_id=0;read_set_id<gv.number_of_read_sets;read_set_id++){\n fasta_out<<\"C\"<<read_set_id+1<<\"_\"<<sum_lo[read_set_id]<<\"|\";\n }\n for(read_set_id=0;read_set_id<gv.number_of_read_sets;read_set_id++){\n fasta_out<<\"Q\"<<read_set_id+1<<\"_\"<<avg_lo[read_set_id]<<\"|\";\n }\n fasta_out<<genotypes;\n fasta_out<<\"rank_\"<<setprecision(5)<<rank;\n \n fasta_out<<sep<<index.all_predictions[fragment_id+1]->sequence.toString()<<endl;\n \n \n \n}\n\n\n\n\/**\n * checks if at least one read set provide read coherency for a path.\n *\/\ninline bool one_coherent(FragmentInfo * fragment, int number_of_read_sets, GlobalValues & gv){\n int read_set_id;\n for(read_set_id=0;read_set_id<number_of_read_sets;read_set_id++){\n\n if(fragment->read_coherent[read_set_id]) return true;\n \n }\n return false;\n}\n\n\nvoid print_results_2_paths_per_event(ofstream &coherent_out, ofstream &uncoherent_out, FragmentIndex &index, GlobalValues & gv){\n index.nb_coherent=0;\n index.nb_uncoherent=0;\n \/\/printf(\"number ofread sets = %d\\n\", number_of_read_sets);\n \n \/\/\n \/\/ C1 C2 C3 ....\n \/\/ path1 (i) [0\/1] [0\/1] [0\/1]...\n \/\/ path2 (i+1) [0\/1] [0\/1] [0\/1]...\n \/\/\n \/\/ event is kept only if each line has at least one \"1\" per line:\n \/\/\n \n \n \n for(int i=0;i<index.all_predictions.size();i+=2){\n \/\/ cout<<\"HEY \"<<one_coherent(index.all_predictions[i],gv.number_of_read_sets)<<\" -- \"<<one_coherent(index.all_predictions[i+1],gv.number_of_read_sets)<<endl; \/\/DEB\n if(one_coherent(index.all_predictions[i],gv.number_of_read_sets,gv) && one_coherent(index.all_predictions[i+1],gv.number_of_read_sets,gv))\n {\n index.nb_coherent++;\n print_couple_i(coherent_out, index, i, gv);\n }\n else{\n index.nb_uncoherent++;\n print_couple_i(uncoherent_out, index, i, gv);\n }\n }\n}\n\n\n\n\n\n<|endoftext|>"} {"text":"<commit_before><commit_msg>Made some changes to create_dm_device and modify_dm_device to call _display_info. _display_info prints the status and related information about the virtual disk created.<commit_after><|endoftext|>"} {"text":"<commit_before>\/*\n * Copyright 2018 The WebRTC project authors. All Rights Reserved.\n *\n * Use of this source code is governed by a BSD-style license\n * that can be found in the LICENSE file in the root of the source\n * tree. An additional intellectual property rights grant can be found\n * in the file PATENTS. All contributing project authors may\n * be found in the AUTHORS file in the root of the source tree.\n *\/\n\n#include \"test\/call_test.h\"\n#include \"test\/gtest.h\"\n#include \"test\/null_transport.h\"\n\nnamespace webrtc {\n\nclass ConfigEndToEndTest : public test::CallTest {};\n\nnamespace {\nvoid VerifyEmptyNackConfig(const NackConfig& config) {\n EXPECT_EQ(0, config.rtp_history_ms)\n << \"Enabling NACK requires rtcp-fb: nack negotiation.\";\n}\n\nvoid VerifyEmptyUlpfecConfig(const UlpfecConfig& config) {\n EXPECT_EQ(-1, config.ulpfec_payload_type)\n << \"Enabling ULPFEC requires rtpmap: ulpfec negotiation.\";\n EXPECT_EQ(-1, config.red_payload_type)\n << \"Enabling ULPFEC requires rtpmap: red negotiation.\";\n EXPECT_EQ(-1, config.red_rtx_payload_type)\n << \"Enabling RTX in ULPFEC requires rtpmap: rtx negotiation.\";\n}\n\nvoid VerifyEmptyFlexfecConfig(const RtpConfig::Flexfec& config) {\n EXPECT_EQ(-1, config.payload_type)\n << \"Enabling FlexFEC requires rtpmap: flexfec negotiation.\";\n EXPECT_EQ(0U, config.ssrc)\n << \"Enabling FlexFEC requires ssrc-group: FEC-FR negotiation.\";\n EXPECT_TRUE(config.protected_media_ssrcs.empty())\n << \"Enabling FlexFEC requires ssrc-group: FEC-FR negotiation.\";\n}\n} \/\/ namespace\n\nTEST_F(ConfigEndToEndTest, VerifyDefaultSendConfigParameters) {\n VideoSendStream::Config default_send_config(nullptr);\n EXPECT_EQ(0, default_send_config.rtp.nack.rtp_history_ms)\n << \"Enabling NACK require rtcp-fb: nack negotiation.\";\n EXPECT_TRUE(default_send_config.rtp.rtx.ssrcs.empty())\n << \"Enabling RTX requires rtpmap: rtx negotiation.\";\n EXPECT_TRUE(default_send_config.rtp.extensions.empty())\n << \"Enabling RTP extensions require negotiation.\";\n\n VerifyEmptyNackConfig(default_send_config.rtp.nack);\n VerifyEmptyUlpfecConfig(default_send_config.rtp.ulpfec);\n VerifyEmptyFlexfecConfig(default_send_config.rtp.flexfec);\n}\n\nTEST_F(ConfigEndToEndTest, VerifyDefaultVideoReceiveConfigParameters) {\n VideoReceiveStream::Config default_receive_config(nullptr);\n EXPECT_EQ(RtcpMode::kCompound, default_receive_config.rtp.rtcp_mode)\n << \"Reduced-size RTCP require rtcp-rsize to be negotiated.\";\n EXPECT_FALSE(default_receive_config.rtp.remb)\n << \"REMB require rtcp-fb: goog-remb to be negotiated.\";\n EXPECT_FALSE(\n default_receive_config.rtp.rtcp_xr.receiver_reference_time_report)\n << \"RTCP XR settings require rtcp-xr to be negotiated.\";\n EXPECT_EQ(0U, default_receive_config.rtp.rtx_ssrc)\n << \"Enabling RTX requires ssrc-group: FID negotiation\";\n EXPECT_TRUE(default_receive_config.rtp.rtx_associated_payload_types.empty())\n << \"Enabling RTX requires rtpmap: rtx negotiation.\";\n EXPECT_TRUE(default_receive_config.rtp.extensions.empty())\n << \"Enabling RTP extensions require negotiation.\";\n\n VerifyEmptyNackConfig(default_receive_config.rtp.nack);\n EXPECT_EQ(-1, default_receive_config.rtp.ulpfec_payload_type)\n << \"Enabling ULPFEC requires rtpmap: ulpfec negotiation.\";\n EXPECT_EQ(-1, default_receive_config.rtp.red_payload_type)\n << \"Enabling ULPFEC requires rtpmap: red negotiation.\";\n}\n\nTEST_F(ConfigEndToEndTest, VerifyDefaultFlexfecReceiveConfigParameters) {\n test::NullTransport rtcp_send_transport;\n FlexfecReceiveStream::Config default_receive_config(&rtcp_send_transport);\n EXPECT_EQ(-1, default_receive_config.payload_type)\n << \"Enabling FlexFEC requires rtpmap: flexfec negotiation.\";\n EXPECT_EQ(0U, default_receive_config.remote_ssrc)\n << \"Enabling FlexFEC requires ssrc-group: FEC-FR negotiation.\";\n EXPECT_TRUE(default_receive_config.protected_media_ssrcs.empty())\n << \"Enabling FlexFEC requires ssrc-group: FEC-FR negotiation.\";\n}\n\n} \/\/ namespace webrtc\n<commit_msg>Add expected default values to video configuration tests.<commit_after>\/*\n * Copyright 2018 The WebRTC project authors. All Rights Reserved.\n *\n * Use of this source code is governed by a BSD-style license\n * that can be found in the LICENSE file in the root of the source\n * tree. An additional intellectual property rights grant can be found\n * in the file PATENTS. All contributing project authors may\n * be found in the AUTHORS file in the root of the source tree.\n *\/\n\n#include \"test\/call_test.h\"\n#include \"test\/gtest.h\"\n#include \"test\/null_transport.h\"\n\nnamespace webrtc {\n\nclass ConfigEndToEndTest : public test::CallTest {};\n\nnamespace {\nvoid VerifyEmptyNackConfig(const NackConfig& config) {\n EXPECT_EQ(0, config.rtp_history_ms)\n << \"Enabling NACK requires rtcp-fb: nack negotiation.\";\n}\n\nvoid VerifyEmptyUlpfecConfig(const UlpfecConfig& config) {\n EXPECT_EQ(-1, config.ulpfec_payload_type)\n << \"Enabling ULPFEC requires rtpmap: ulpfec negotiation.\";\n EXPECT_EQ(-1, config.red_payload_type)\n << \"Enabling ULPFEC requires rtpmap: red negotiation.\";\n EXPECT_EQ(-1, config.red_rtx_payload_type)\n << \"Enabling RTX in ULPFEC requires rtpmap: rtx negotiation.\";\n}\n\nvoid VerifyEmptyFlexfecConfig(const RtpConfig::Flexfec& config) {\n EXPECT_EQ(-1, config.payload_type)\n << \"Enabling FlexFEC requires rtpmap: flexfec negotiation.\";\n EXPECT_EQ(0U, config.ssrc)\n << \"Enabling FlexFEC requires ssrc-group: FEC-FR negotiation.\";\n EXPECT_TRUE(config.protected_media_ssrcs.empty())\n << \"Enabling FlexFEC requires ssrc-group: FEC-FR negotiation.\";\n}\n} \/\/ namespace\n\nTEST_F(ConfigEndToEndTest, VerifyDefaultSendConfigParameters) {\n VideoSendStream::Config default_send_config(nullptr);\n EXPECT_EQ(0, default_send_config.rtp.nack.rtp_history_ms)\n << \"Enabling NACK require rtcp-fb: nack negotiation.\";\n EXPECT_TRUE(default_send_config.rtp.rtx.ssrcs.empty())\n << \"Enabling RTX requires rtpmap: rtx negotiation.\";\n EXPECT_TRUE(default_send_config.rtp.extensions.empty())\n << \"Enabling RTP extensions require negotiation.\";\n EXPECT_EQ(nullptr, default_send_config.frame_encryptor)\n << \"Enabling Frame Encryption requires a frame encryptor to be attached\";\n EXPECT_FALSE(\n default_send_config.crypto_options.sframe.require_frame_encryption)\n << \"Enabling Require Frame Encryption means an encryptor must be \"\n \"attached\";\n\n VerifyEmptyNackConfig(default_send_config.rtp.nack);\n VerifyEmptyUlpfecConfig(default_send_config.rtp.ulpfec);\n VerifyEmptyFlexfecConfig(default_send_config.rtp.flexfec);\n}\n\nTEST_F(ConfigEndToEndTest, VerifyDefaultVideoReceiveConfigParameters) {\n VideoReceiveStream::Config default_receive_config(nullptr);\n EXPECT_EQ(RtcpMode::kCompound, default_receive_config.rtp.rtcp_mode)\n << \"Reduced-size RTCP require rtcp-rsize to be negotiated.\";\n EXPECT_FALSE(default_receive_config.rtp.remb)\n << \"REMB require rtcp-fb: goog-remb to be negotiated.\";\n EXPECT_FALSE(\n default_receive_config.rtp.rtcp_xr.receiver_reference_time_report)\n << \"RTCP XR settings require rtcp-xr to be negotiated.\";\n EXPECT_EQ(0U, default_receive_config.rtp.rtx_ssrc)\n << \"Enabling RTX requires ssrc-group: FID negotiation\";\n EXPECT_TRUE(default_receive_config.rtp.rtx_associated_payload_types.empty())\n << \"Enabling RTX requires rtpmap: rtx negotiation.\";\n EXPECT_TRUE(default_receive_config.rtp.extensions.empty())\n << \"Enabling RTP extensions require negotiation.\";\n VerifyEmptyNackConfig(default_receive_config.rtp.nack);\n EXPECT_EQ(-1, default_receive_config.rtp.ulpfec_payload_type)\n << \"Enabling ULPFEC requires rtpmap: ulpfec negotiation.\";\n EXPECT_EQ(-1, default_receive_config.rtp.red_payload_type)\n << \"Enabling ULPFEC requires rtpmap: red negotiation.\";\n EXPECT_EQ(nullptr, default_receive_config.frame_decryptor)\n << \"Enabling Frame Decryption requires a frame decryptor to be attached\";\n EXPECT_FALSE(\n default_receive_config.crypto_options.sframe.require_frame_encryption)\n << \"Enabling Require Frame Encryption means a decryptor must be attached\";\n}\n\nTEST_F(ConfigEndToEndTest, VerifyDefaultFlexfecReceiveConfigParameters) {\n test::NullTransport rtcp_send_transport;\n FlexfecReceiveStream::Config default_receive_config(&rtcp_send_transport);\n EXPECT_EQ(-1, default_receive_config.payload_type)\n << \"Enabling FlexFEC requires rtpmap: flexfec negotiation.\";\n EXPECT_EQ(0U, default_receive_config.remote_ssrc)\n << \"Enabling FlexFEC requires ssrc-group: FEC-FR negotiation.\";\n EXPECT_TRUE(default_receive_config.protected_media_ssrcs.empty())\n << \"Enabling FlexFEC requires ssrc-group: FEC-FR negotiation.\";\n}\n\n} \/\/ namespace webrtc\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#include \"testing\/gtest\/include\/gtest\/gtest.h\"\n#include \"webrtc\/modules\/rtp_rtcp\/interface\/rtp_header_parser.h\"\n#include \"webrtc\/modules\/rtp_rtcp\/source\/rtcp_utility.h\"\n#include \"webrtc\/system_wrappers\/interface\/event_wrapper.h\"\n#include \"webrtc\/system_wrappers\/interface\/scoped_ptr.h\"\n#include \"webrtc\/video_engine\/test\/common\/fake_encoder.h\"\n#include \"webrtc\/video_engine\/test\/common\/frame_generator.h\"\n#include \"webrtc\/video_engine\/test\/common\/frame_generator_capturer.h\"\n#include \"webrtc\/video_engine\/test\/common\/null_transport.h\"\n#include \"webrtc\/video_engine\/new_include\/call.h\"\n#include \"webrtc\/video_engine\/new_include\/video_send_stream.h\"\n\nnamespace webrtc {\n\nclass SendTransportObserver : public test::NullTransport {\n public:\n explicit SendTransportObserver(unsigned long timeout_ms)\n : rtp_header_parser_(RtpHeaderParser::Create()),\n send_test_complete_(EventWrapper::Create()),\n timeout_ms_(timeout_ms) {}\n\n EventTypeWrapper Wait() { return send_test_complete_->Wait(timeout_ms_); }\n\n protected:\n scoped_ptr<RtpHeaderParser> rtp_header_parser_;\n scoped_ptr<EventWrapper> send_test_complete_;\n\n private:\n unsigned long timeout_ms_;\n};\n\nclass VideoSendStreamTest : public ::testing::Test {\n public:\n VideoSendStreamTest() : fake_encoder_(Clock::GetRealTimeClock()) {}\n\n protected:\n static const uint32_t kSendSsrc;\n void RunSendTest(Call* call,\n const VideoSendStream::Config& config,\n SendTransportObserver* observer) {\n VideoSendStream* send_stream = call->CreateSendStream(config);\n scoped_ptr<test::FrameGeneratorCapturer> frame_generator_capturer(\n test::FrameGeneratorCapturer::Create(\n send_stream->Input(),\n test::FrameGenerator::Create(320, 240, Clock::GetRealTimeClock()),\n 30));\n send_stream->StartSend();\n frame_generator_capturer->Start();\n\n EXPECT_EQ(kEventSignaled, observer->Wait());\n\n frame_generator_capturer->Stop();\n send_stream->StopSend();\n call->DestroySendStream(send_stream);\n }\n\n VideoSendStream::Config GetSendTestConfig(Call* call) {\n VideoSendStream::Config config = call->GetDefaultSendConfig();\n config.encoder = &fake_encoder_;\n config.internal_source = false;\n test::FakeEncoder::SetCodecSettings(&config.codec, 1);\n return config;\n }\n\n test::FakeEncoder fake_encoder_;\n};\n\nconst uint32_t VideoSendStreamTest::kSendSsrc = 0xC0FFEE;\n\nTEST_F(VideoSendStreamTest, SendsSetSsrc) {\n class SendSsrcObserver : public SendTransportObserver {\n public:\n SendSsrcObserver() : SendTransportObserver(30 * 1000) {}\n\n virtual bool SendRTP(const uint8_t* packet, size_t length) OVERRIDE {\n RTPHeader header;\n EXPECT_TRUE(\n rtp_header_parser_->Parse(packet, static_cast<int>(length), &header));\n\n if (header.ssrc == kSendSsrc)\n send_test_complete_->Set();\n\n return true;\n }\n } observer;\n\n Call::Config call_config(&observer);\n scoped_ptr<Call> call(Call::Create(call_config));\n\n VideoSendStream::Config send_config = GetSendTestConfig(call.get());\n send_config.rtp.ssrcs.push_back(kSendSsrc);\n\n RunSendTest(call.get(), send_config, &observer);\n}\n\nTEST_F(VideoSendStreamTest, SupportsCName) {\n static std::string kCName = \"PjQatC14dGfbVwGPUOA9IH7RlsFDbWl4AhXEiDsBizo=\";\n class CNameObserver : public SendTransportObserver {\n public:\n CNameObserver() : SendTransportObserver(30 * 1000) {}\n\n virtual bool SendRTCP(const uint8_t* packet, size_t length) OVERRIDE {\n RTCPUtility::RTCPParserV2 parser(packet, length, true);\n EXPECT_TRUE(parser.IsValid());\n\n RTCPUtility::RTCPPacketTypes packet_type = parser.Begin();\n while (packet_type != RTCPUtility::kRtcpNotValidCode) {\n if (packet_type == RTCPUtility::kRtcpSdesChunkCode) {\n EXPECT_EQ(parser.Packet().CName.CName, kCName);\n send_test_complete_->Set();\n }\n\n packet_type = parser.Iterate();\n }\n\n return true;\n }\n } observer;\n\n Call::Config call_config(&observer);\n scoped_ptr<Call> call(Call::Create(call_config));\n\n VideoSendStream::Config send_config = GetSendTestConfig(call.get());\n send_config.rtp.ssrcs.push_back(kSendSsrc);\n send_config.rtp.c_name = kCName;\n\n RunSendTest(call.get(), send_config, &observer);\n}\n\n} \/\/ namespace webrtc\n<commit_msg>Test that VideoSendStream responds to NACK.<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#include \"testing\/gtest\/include\/gtest\/gtest.h\"\n#include \"webrtc\/modules\/rtp_rtcp\/interface\/rtp_header_parser.h\"\n#include \"webrtc\/modules\/rtp_rtcp\/source\/rtcp_sender.h\"\n#include \"webrtc\/modules\/rtp_rtcp\/source\/rtcp_utility.h\"\n#include \"webrtc\/system_wrappers\/interface\/event_wrapper.h\"\n#include \"webrtc\/system_wrappers\/interface\/scoped_ptr.h\"\n#include \"webrtc\/system_wrappers\/interface\/thread_wrapper.h\"\n#include \"webrtc\/video_engine\/test\/common\/fake_encoder.h\"\n#include \"webrtc\/video_engine\/test\/common\/frame_generator.h\"\n#include \"webrtc\/video_engine\/test\/common\/frame_generator_capturer.h\"\n#include \"webrtc\/video_engine\/test\/common\/null_transport.h\"\n#include \"webrtc\/video_engine\/new_include\/call.h\"\n#include \"webrtc\/video_engine\/new_include\/video_send_stream.h\"\n\nnamespace webrtc {\n\nclass SendTransportObserver : public test::NullTransport {\n public:\n explicit SendTransportObserver(unsigned long timeout_ms)\n : rtp_header_parser_(RtpHeaderParser::Create()),\n send_test_complete_(EventWrapper::Create()),\n timeout_ms_(timeout_ms) {}\n\n EventTypeWrapper Wait() { return send_test_complete_->Wait(timeout_ms_); }\n\n protected:\n scoped_ptr<RtpHeaderParser> rtp_header_parser_;\n scoped_ptr<EventWrapper> send_test_complete_;\n\n private:\n unsigned long timeout_ms_;\n};\n\nclass VideoSendStreamTest : public ::testing::Test {\n public:\n VideoSendStreamTest() : fake_encoder_(Clock::GetRealTimeClock()) {}\n\n protected:\n static const uint32_t kSendSsrc;\n void RunSendTest(Call* call,\n const VideoSendStream::Config& config,\n SendTransportObserver* observer) {\n VideoSendStream* send_stream = call->CreateSendStream(config);\n scoped_ptr<test::FrameGeneratorCapturer> frame_generator_capturer(\n test::FrameGeneratorCapturer::Create(\n send_stream->Input(),\n test::FrameGenerator::Create(320, 240, Clock::GetRealTimeClock()),\n 30));\n send_stream->StartSend();\n frame_generator_capturer->Start();\n\n EXPECT_EQ(kEventSignaled, observer->Wait());\n\n frame_generator_capturer->Stop();\n send_stream->StopSend();\n call->DestroySendStream(send_stream);\n }\n\n VideoSendStream::Config GetSendTestConfig(Call* call) {\n VideoSendStream::Config config = call->GetDefaultSendConfig();\n config.encoder = &fake_encoder_;\n config.internal_source = false;\n config.rtp.ssrcs.push_back(kSendSsrc);\n test::FakeEncoder::SetCodecSettings(&config.codec, 1);\n return config;\n }\n\n test::FakeEncoder fake_encoder_;\n};\n\nconst uint32_t VideoSendStreamTest::kSendSsrc = 0xC0FFEE;\n\nTEST_F(VideoSendStreamTest, SendsSetSsrc) {\n class SendSsrcObserver : public SendTransportObserver {\n public:\n SendSsrcObserver() : SendTransportObserver(30 * 1000) {}\n\n virtual bool SendRTP(const uint8_t* packet, size_t length) OVERRIDE {\n RTPHeader header;\n EXPECT_TRUE(\n rtp_header_parser_->Parse(packet, static_cast<int>(length), &header));\n\n if (header.ssrc == kSendSsrc)\n send_test_complete_->Set();\n\n return true;\n }\n } observer;\n\n Call::Config call_config(&observer);\n scoped_ptr<Call> call(Call::Create(call_config));\n\n VideoSendStream::Config send_config = GetSendTestConfig(call.get());\n\n RunSendTest(call.get(), send_config, &observer);\n}\n\nTEST_F(VideoSendStreamTest, SupportsCName) {\n static std::string kCName = \"PjQatC14dGfbVwGPUOA9IH7RlsFDbWl4AhXEiDsBizo=\";\n class CNameObserver : public SendTransportObserver {\n public:\n CNameObserver() : SendTransportObserver(30 * 1000) {}\n\n virtual bool SendRTCP(const uint8_t* packet, size_t length) OVERRIDE {\n RTCPUtility::RTCPParserV2 parser(packet, length, true);\n EXPECT_TRUE(parser.IsValid());\n\n RTCPUtility::RTCPPacketTypes packet_type = parser.Begin();\n while (packet_type != RTCPUtility::kRtcpNotValidCode) {\n if (packet_type == RTCPUtility::kRtcpSdesChunkCode) {\n EXPECT_EQ(parser.Packet().CName.CName, kCName);\n send_test_complete_->Set();\n }\n\n packet_type = parser.Iterate();\n }\n\n return true;\n }\n } observer;\n\n Call::Config call_config(&observer);\n scoped_ptr<Call> call(Call::Create(call_config));\n\n VideoSendStream::Config send_config = GetSendTestConfig(call.get());\n send_config.rtp.c_name = kCName;\n\n RunSendTest(call.get(), send_config, &observer);\n}\n\nTEST_F(VideoSendStreamTest, RespondsToNack) {\n class NackObserver : public SendTransportObserver, webrtc::Transport {\n public:\n NackObserver()\n : SendTransportObserver(30 * 1000),\n thread_(ThreadWrapper::CreateThread(NackProcess, this)),\n send_call_receiver_(NULL),\n send_count_(0),\n ssrc_(0),\n nacked_sequence_number_(0) {}\n\n ~NackObserver() {\n EXPECT_TRUE(thread_->Stop());\n }\n\n void SetReceiver(PacketReceiver* send_call_receiver) {\n send_call_receiver_ = send_call_receiver;\n }\n\n \/\/ Sending NACKs must be done from a different \"network\" thread to prevent\n \/\/ violating locking orders. With this no locks are held prior to inserting\n \/\/ packets back into the sender.\n static bool NackProcess(void* observer) {\n return static_cast<NackObserver*>(observer)->SendNack();\n }\n\n bool SendNack() {\n NullReceiveStatistics null_stats;\n RTCPSender rtcp_sender(0, false, Clock::GetRealTimeClock(), &null_stats);\n EXPECT_EQ(0, rtcp_sender.RegisterSendTransport(this));\n\n rtcp_sender.SetRTCPStatus(kRtcpNonCompound);\n rtcp_sender.SetRemoteSSRC(ssrc_);\n\n RTCPSender::FeedbackState feedback_state;\n EXPECT_EQ(0, rtcp_sender.SendRTCP(\n feedback_state, kRtcpNack, 1, &nacked_sequence_number_));\n return false;\n }\n\n virtual int SendPacket(int channel, const void* data, int len) OVERRIDE {\n ADD_FAILURE()\n << \"This should never be reached. Only a NACK should be sent.\";\n return -1;\n }\n\n virtual int SendRTCPPacket(int channel,\n const void* data,\n int len) OVERRIDE {\n EXPECT_TRUE(send_call_receiver_->DeliverPacket(\n static_cast<const uint8_t*>(data), static_cast<size_t>(len)));\n return len;\n }\n\n virtual bool SendRTP(const uint8_t* packet, size_t length) OVERRIDE {\n EXPECT_TRUE(send_call_receiver_ != NULL);\n RTPHeader header;\n EXPECT_TRUE(\n rtp_header_parser_->Parse(packet, static_cast<int>(length), &header));\n\n \/\/ Nack second packet after receiving the third one.\n if (++send_count_ == 3) {\n ssrc_ = header.ssrc;\n nacked_sequence_number_ = header.sequenceNumber - 1;\n unsigned int id;\n EXPECT_TRUE(thread_->Start(id));\n }\n\n if (header.sequenceNumber == nacked_sequence_number_)\n send_test_complete_->Set();\n\n return true;\n }\n private:\n scoped_ptr<ThreadWrapper> thread_;\n PacketReceiver* send_call_receiver_;\n int send_count_;\n uint32_t ssrc_;\n uint16_t nacked_sequence_number_;\n } observer;\n\n Call::Config call_config(&observer);\n scoped_ptr<Call> call(Call::Create(call_config));\n observer.SetReceiver(call->Receiver());\n\n VideoSendStream::Config send_config = GetSendTestConfig(call.get());\n send_config.rtp.nack.rtp_history_ms = 1000;\n\n RunSendTest(call.get(), send_config, &observer);\n}\n\n} \/\/ namespace webrtc\n<|endoftext|>"} {"text":"<commit_before>\/**\n * @file posix\/net.cpp\n * @brief POSIX network access layer (using cURL)\n *\n * (c) 2013-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\nnamespace mega {\nCurlHttpIO::CurlHttpIO()\n{\n curl_global_init(CURL_GLOBAL_DEFAULT);\n\n curlm = curl_multi_init();\n\n curlsh = curl_share_init();\n curl_share_setopt(curlsh, CURLSHOPT_SHARE, CURL_LOCK_DATA_DNS);\n curl_share_setopt(curlsh, CURLSHOPT_SHARE, CURL_LOCK_DATA_SSL_SESSION);\n\n contenttypejson = curl_slist_append(NULL, \"Content-Type: application\/json\");\n contenttypejson = curl_slist_append(contenttypejson, \"Expect:\");\n\n contenttypebinary = curl_slist_append(NULL, \"Content-Type: application\/octet-stream\");\n contenttypebinary = curl_slist_append(contenttypebinary, \"Expect:\");\n}\n\nCurlHttpIO::~CurlHttpIO()\n{\n curl_global_cleanup();\n}\n\nvoid CurlHttpIO::setuseragent(string* u)\n{\n useragent = u;\n}\n\n\/\/ wake up from cURL I\/O\nvoid CurlHttpIO::addevents(Waiter* w, int flags)\n{\n int t;\n PosixWaiter* pw = (PosixWaiter*)w;\n\n curl_multi_fdset(curlm, &pw->rfds, &pw->wfds, &pw->efds, &t);\n\n pw->bumpmaxfd(t);\n}\n\n\/\/ POST request to URL\nvoid CurlHttpIO::post(HttpReq* req, const char* data, unsigned len)\n{\n if (debug)\n {\n cout << \"POST target URL: \" << req->posturl << endl;\n\n if (req->binary)\n {\n cout << \"[sending \" << req->out->size() << \" bytes of raw data]\" << endl;\n }\n else\n {\n cout << \"Sending: \" << *req->out << endl;\n }\n }\n\n CURL* curl;\n\n req->in.clear();\n\n if ((curl = curl_easy_init()))\n {\n curl_easy_setopt(curl, CURLOPT_URL, req->posturl.c_str());\n curl_easy_setopt(curl, CURLOPT_POSTFIELDS, data ? data : req->out->data());\n curl_easy_setopt(curl, CURLOPT_POSTFIELDSIZE, data ? len : req->out->size());\n curl_easy_setopt(curl, CURLOPT_USERAGENT, useragent->c_str());\n curl_easy_setopt(curl, CURLOPT_HTTPHEADER, req->type == REQ_JSON ? contenttypejson : contenttypebinary);\n curl_easy_setopt(curl, CURLOPT_ENCODING, \"\");\n curl_easy_setopt(curl, CURLOPT_SHARE, curlsh);\n curl_easy_setopt(curl, CURLOPT_WRITEFUNCTION, write_data);\n curl_easy_setopt(curl, CURLOPT_WRITEDATA, (void*)req);\n curl_easy_setopt(curl, CURLOPT_HEADERFUNCTION, check_header);\n curl_easy_setopt(curl, CURLOPT_HEADERDATA, (void*)req);\n curl_easy_setopt(curl, CURLOPT_PRIVATE, (void*)req);\n curl_easy_setopt(curl, CURLOPT_SSL_CTX_FUNCTION, ssl_ctx_function);\n curl_easy_setopt(curl, CURLOPT_SSL_VERIFYPEER, 1);\n curl_easy_setopt(curl, CURLOPT_SSL_VERIFYHOST, 0);\n\n#ifdef __ANDROID__\n \/\/cURL can't find the certstore on Android,\n \/\/so we rely on the public key pinning\n curl_easy_setopt(curl, CURLOPT_CAINFO, NULL);\n curl_easy_setopt(curl, CURLOPT_CAPATH, NULL);\n#endif\n\n if(proxyurl.size())\n {\n curl_easy_setopt(curl, CURLOPT_PROXYTYPE, CURLPROXY_HTTP);\n curl_easy_setopt(curl, CURLOPT_PROXY, proxyurl.c_str());\n if(proxyusername.size())\n {\n curl_easy_setopt(curl, CURLOPT_PROXYUSERNAME, proxyusername.c_str());\n curl_easy_setopt(curl, CURLOPT_PROXYPASSWORD, proxypassword.c_str());\n }\n curl_easy_setopt(curl, CURLOPT_HTTPPROXYTUNNEL, 1L);\n }\n\n curl_multi_add_handle(curlm, curl);\n\n req->status = REQ_INFLIGHT;\n\n req->httpiohandle = (void*)curl;\n }\n else\n {\n req->status = REQ_FAILURE;\n }\n}\n\nvoid CurlHttpIO::setproxy(Proxy* proxy)\n{\n if(proxy->getProxyType() != MegaProxySettings::CUSTOM)\n {\n \/\/Automatic proxy is not supported\n proxyurl.clear();\n return;\n }\n\n proxyurl = proxySettings->getProxyURL();\n proxyusername = proxySettings->getUsername();\n proxypassword = proxySettings->getPassword();\n}\n\nProxy* CurlHttpIO::getautoproxy()\n{\n Proxy *proxy = new Proxy();\n proxy->setProxyType(MegaProxySettings::NONE);\n return proxy;\n}\n\n\/\/ cancel pending HTTP request\nvoid CurlHttpIO::cancel(HttpReq* req)\n{\n if (req->httpiohandle)\n {\n curl_multi_remove_handle(curlm, (CURL*)req->httpiohandle);\n curl_easy_cleanup((CURL*)req->httpiohandle);\n\n req->httpstatus = 0;\n req->status = REQ_FAILURE;\n req->httpiohandle = NULL;\n }\n}\n\n\/\/ real-time progress information on POST data\nm_off_t CurlHttpIO::postpos(void* handle)\n{\n double bytes;\n\n curl_easy_getinfo(handle, CURLINFO_SIZE_UPLOAD, &bytes);\n\n return (m_off_t)bytes;\n}\n\n\/\/ process events\nbool CurlHttpIO::doio()\n{\n bool done = false;\n\n CURLMsg *msg;\n int dummy;\n\n curl_multi_perform(curlm, &dummy);\n\n while ((msg = curl_multi_info_read(curlm, &dummy)))\n {\n HttpReq* req;\n\n if ((curl_easy_getinfo(msg->easy_handle, CURLINFO_PRIVATE, (char**)&req) == CURLE_OK) && req)\n {\n req->httpio = NULL;\n\n if (msg->msg == CURLMSG_DONE)\n {\n curl_easy_getinfo(msg->easy_handle, CURLINFO_RESPONSE_CODE, &req->httpstatus);\n\n if (debug)\n {\n cout << \"CURLMSG_DONE with HTTP status: \" << req->httpstatus << endl;\n\n if (req->httpstatus)\n {\n if (req->binary)\n {\n cout << \"[received \" << req->in.size() << \" bytes of raw data]\" << endl;\n }\n else\n {\n cout << \"Received: \" << req->in.c_str() << endl;\n }\n }\n }\n\n \/\/ check httpstatus and response length\n req->status = (req->httpstatus == 200\n && req->contentlength == (req->buf ? req->bufpos : req->in.size()))\n ? REQ_SUCCESS : REQ_FAILURE;\n\n inetstatus(req->status);\n \n if (req->status == REQ_SUCCESS)\n {\n lastdata = Waiter::ds;\n }\n\n success = true;\n done = true;\n }\n else\n {\n req->status = REQ_FAILURE;\n }\n }\n\n curl_multi_remove_handle(curlm, msg->easy_handle);\n curl_easy_cleanup(msg->easy_handle);\n }\n\n return done;\n}\n\n\/\/ callback for incoming HTTP payload\nsize_t CurlHttpIO::write_data(void* ptr, size_t, size_t nmemb, void* target)\n{\n ((HttpReq*)target)->put(ptr, nmemb);\n ((HttpReq*)target)->httpio->lastdata = Waiter::ds;\n\n return nmemb;\n}\n\n\/\/ set contentlength according to Original-Content-Length header\nsize_t CurlHttpIO::check_header(void* ptr, size_t, size_t nmemb, void* target)\n{\n if (!memcmp(ptr, \"Content-Length:\", 15))\n {\n if (((HttpReq*)target)->contentlength < 0) ((HttpReq*)target)->setcontentlength(atol((char*)ptr + 15));\n }\n else\n {\n if (!memcmp(ptr, \"Original-Content-Length:\", 24))\n {\n ((HttpReq*)target)->setcontentlength(atol((char*)ptr + 24));\n }\n }\n\n if (((HttpReq*)target)->httpio)\n {\n ((HttpReq*)target)->httpio->lastdata = Waiter::ds;\n }\n\n return nmemb;\n}\n\nCURLcode CurlHttpIO::ssl_ctx_function(CURL* curl, void* sslctx, void*)\n{\n SSL_CTX_set_cert_verify_callback((SSL_CTX*)sslctx, cert_verify_callback, NULL);\n\n return CURLE_OK;\n}\n\n\/\/ SSL public key pinning\nint CurlHttpIO::cert_verify_callback(X509_STORE_CTX* ctx, void*)\n{\n unsigned char buf[sizeof(APISSLMODULUS1) - 1];\n EVP_PKEY* evp;\n int ok = 0;\n\n if ((evp = X509_PUBKEY_get(X509_get_X509_PUBKEY(ctx->cert))))\n {\n if (BN_num_bytes(evp->pkey.rsa->n) == sizeof APISSLMODULUS1 - 1\n && BN_num_bytes(evp->pkey.rsa->e) == sizeof APISSLEXPONENT - 1)\n {\n BN_bn2bin(evp->pkey.rsa->n, buf);\n\n if (!memcmp(buf, APISSLMODULUS1, sizeof APISSLMODULUS1 - 1) || !memcmp(buf, APISSLMODULUS2, sizeof APISSLMODULUS2 - 1))\n {\n BN_bn2bin(evp->pkey.rsa->e, buf);\n\n if (!memcmp(buf, APISSLEXPONENT, sizeof APISSLEXPONENT - 1))\n {\n ok = 1;\n }\n }\n }\n\n EVP_PKEY_free(evp);\n }\n\n return ok;\n}\n} \/\/ namespace\n<commit_msg>Fix compilation on Linux<commit_after>\/**\n * @file posix\/net.cpp\n * @brief POSIX network access layer (using cURL)\n *\n * (c) 2013-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\nnamespace mega {\nCurlHttpIO::CurlHttpIO()\n{\n curl_global_init(CURL_GLOBAL_DEFAULT);\n\n curlm = curl_multi_init();\n\n curlsh = curl_share_init();\n curl_share_setopt(curlsh, CURLSHOPT_SHARE, CURL_LOCK_DATA_DNS);\n curl_share_setopt(curlsh, CURLSHOPT_SHARE, CURL_LOCK_DATA_SSL_SESSION);\n\n contenttypejson = curl_slist_append(NULL, \"Content-Type: application\/json\");\n contenttypejson = curl_slist_append(contenttypejson, \"Expect:\");\n\n contenttypebinary = curl_slist_append(NULL, \"Content-Type: application\/octet-stream\");\n contenttypebinary = curl_slist_append(contenttypebinary, \"Expect:\");\n}\n\nCurlHttpIO::~CurlHttpIO()\n{\n curl_global_cleanup();\n}\n\nvoid CurlHttpIO::setuseragent(string* u)\n{\n useragent = u;\n}\n\n\/\/ wake up from cURL I\/O\nvoid CurlHttpIO::addevents(Waiter* w, int flags)\n{\n int t;\n PosixWaiter* pw = (PosixWaiter*)w;\n\n curl_multi_fdset(curlm, &pw->rfds, &pw->wfds, &pw->efds, &t);\n\n pw->bumpmaxfd(t);\n}\n\n\/\/ POST request to URL\nvoid CurlHttpIO::post(HttpReq* req, const char* data, unsigned len)\n{\n if (debug)\n {\n cout << \"POST target URL: \" << req->posturl << endl;\n\n if (req->binary)\n {\n cout << \"[sending \" << req->out->size() << \" bytes of raw data]\" << endl;\n }\n else\n {\n cout << \"Sending: \" << *req->out << endl;\n }\n }\n\n CURL* curl;\n\n req->in.clear();\n\n if ((curl = curl_easy_init()))\n {\n curl_easy_setopt(curl, CURLOPT_URL, req->posturl.c_str());\n curl_easy_setopt(curl, CURLOPT_POSTFIELDS, data ? data : req->out->data());\n curl_easy_setopt(curl, CURLOPT_POSTFIELDSIZE, data ? len : req->out->size());\n curl_easy_setopt(curl, CURLOPT_USERAGENT, useragent->c_str());\n curl_easy_setopt(curl, CURLOPT_HTTPHEADER, req->type == REQ_JSON ? contenttypejson : contenttypebinary);\n curl_easy_setopt(curl, CURLOPT_ENCODING, \"\");\n curl_easy_setopt(curl, CURLOPT_SHARE, curlsh);\n curl_easy_setopt(curl, CURLOPT_WRITEFUNCTION, write_data);\n curl_easy_setopt(curl, CURLOPT_WRITEDATA, (void*)req);\n curl_easy_setopt(curl, CURLOPT_HEADERFUNCTION, check_header);\n curl_easy_setopt(curl, CURLOPT_HEADERDATA, (void*)req);\n curl_easy_setopt(curl, CURLOPT_PRIVATE, (void*)req);\n curl_easy_setopt(curl, CURLOPT_SSL_CTX_FUNCTION, ssl_ctx_function);\n curl_easy_setopt(curl, CURLOPT_SSL_VERIFYPEER, 1);\n curl_easy_setopt(curl, CURLOPT_SSL_VERIFYHOST, 0);\n\n#ifdef __ANDROID__\n \/\/cURL can't find the certstore on Android,\n \/\/so we rely on the public key pinning\n curl_easy_setopt(curl, CURLOPT_CAINFO, NULL);\n curl_easy_setopt(curl, CURLOPT_CAPATH, NULL);\n#endif\n\n if(proxyurl.size())\n {\n curl_easy_setopt(curl, CURLOPT_PROXYTYPE, CURLPROXY_HTTP);\n curl_easy_setopt(curl, CURLOPT_PROXY, proxyurl.c_str());\n if(proxyusername.size())\n {\n curl_easy_setopt(curl, CURLOPT_PROXYUSERNAME, proxyusername.c_str());\n curl_easy_setopt(curl, CURLOPT_PROXYPASSWORD, proxypassword.c_str());\n }\n curl_easy_setopt(curl, CURLOPT_HTTPPROXYTUNNEL, 1L);\n }\n\n curl_multi_add_handle(curlm, curl);\n\n req->status = REQ_INFLIGHT;\n\n req->httpiohandle = (void*)curl;\n }\n else\n {\n req->status = REQ_FAILURE;\n }\n}\n\nvoid CurlHttpIO::setproxy(Proxy* proxy)\n{\n if(proxy->getProxyType() != Proxy::CUSTOM)\n {\n \/\/Automatic proxy is not supported\n proxyurl.clear();\n return;\n }\n\n proxyurl = proxy->getProxyURL();\n proxyusername = proxy->getUsername();\n proxypassword = proxy->getPassword();\n}\n\nProxy* CurlHttpIO::getautoproxy()\n{\n Proxy *proxy = new Proxy();\n proxy->setProxyType(Proxy::NONE);\n return proxy;\n}\n\n\/\/ cancel pending HTTP request\nvoid CurlHttpIO::cancel(HttpReq* req)\n{\n if (req->httpiohandle)\n {\n curl_multi_remove_handle(curlm, (CURL*)req->httpiohandle);\n curl_easy_cleanup((CURL*)req->httpiohandle);\n\n req->httpstatus = 0;\n req->status = REQ_FAILURE;\n req->httpiohandle = NULL;\n }\n}\n\n\/\/ real-time progress information on POST data\nm_off_t CurlHttpIO::postpos(void* handle)\n{\n double bytes;\n\n curl_easy_getinfo(handle, CURLINFO_SIZE_UPLOAD, &bytes);\n\n return (m_off_t)bytes;\n}\n\n\/\/ process events\nbool CurlHttpIO::doio()\n{\n bool done = false;\n\n CURLMsg *msg;\n int dummy;\n\n curl_multi_perform(curlm, &dummy);\n\n while ((msg = curl_multi_info_read(curlm, &dummy)))\n {\n HttpReq* req;\n\n if ((curl_easy_getinfo(msg->easy_handle, CURLINFO_PRIVATE, (char**)&req) == CURLE_OK) && req)\n {\n req->httpio = NULL;\n\n if (msg->msg == CURLMSG_DONE)\n {\n curl_easy_getinfo(msg->easy_handle, CURLINFO_RESPONSE_CODE, &req->httpstatus);\n\n if (debug)\n {\n cout << \"CURLMSG_DONE with HTTP status: \" << req->httpstatus << endl;\n\n if (req->httpstatus)\n {\n if (req->binary)\n {\n cout << \"[received \" << req->in.size() << \" bytes of raw data]\" << endl;\n }\n else\n {\n cout << \"Received: \" << req->in.c_str() << endl;\n }\n }\n }\n\n \/\/ check httpstatus and response length\n req->status = (req->httpstatus == 200\n && req->contentlength == (req->buf ? req->bufpos : req->in.size()))\n ? REQ_SUCCESS : REQ_FAILURE;\n\n inetstatus(req->status);\n \n if (req->status == REQ_SUCCESS)\n {\n lastdata = Waiter::ds;\n }\n\n success = true;\n done = true;\n }\n else\n {\n req->status = REQ_FAILURE;\n }\n }\n\n curl_multi_remove_handle(curlm, msg->easy_handle);\n curl_easy_cleanup(msg->easy_handle);\n }\n\n return done;\n}\n\n\/\/ callback for incoming HTTP payload\nsize_t CurlHttpIO::write_data(void* ptr, size_t, size_t nmemb, void* target)\n{\n ((HttpReq*)target)->put(ptr, nmemb);\n ((HttpReq*)target)->httpio->lastdata = Waiter::ds;\n\n return nmemb;\n}\n\n\/\/ set contentlength according to Original-Content-Length header\nsize_t CurlHttpIO::check_header(void* ptr, size_t, size_t nmemb, void* target)\n{\n if (!memcmp(ptr, \"Content-Length:\", 15))\n {\n if (((HttpReq*)target)->contentlength < 0) ((HttpReq*)target)->setcontentlength(atol((char*)ptr + 15));\n }\n else\n {\n if (!memcmp(ptr, \"Original-Content-Length:\", 24))\n {\n ((HttpReq*)target)->setcontentlength(atol((char*)ptr + 24));\n }\n }\n\n if (((HttpReq*)target)->httpio)\n {\n ((HttpReq*)target)->httpio->lastdata = Waiter::ds;\n }\n\n return nmemb;\n}\n\nCURLcode CurlHttpIO::ssl_ctx_function(CURL* curl, void* sslctx, void*)\n{\n SSL_CTX_set_cert_verify_callback((SSL_CTX*)sslctx, cert_verify_callback, NULL);\n\n return CURLE_OK;\n}\n\n\/\/ SSL public key pinning\nint CurlHttpIO::cert_verify_callback(X509_STORE_CTX* ctx, void*)\n{\n unsigned char buf[sizeof(APISSLMODULUS1) - 1];\n EVP_PKEY* evp;\n int ok = 0;\n\n if ((evp = X509_PUBKEY_get(X509_get_X509_PUBKEY(ctx->cert))))\n {\n if (BN_num_bytes(evp->pkey.rsa->n) == sizeof APISSLMODULUS1 - 1\n && BN_num_bytes(evp->pkey.rsa->e) == sizeof APISSLEXPONENT - 1)\n {\n BN_bn2bin(evp->pkey.rsa->n, buf);\n\n if (!memcmp(buf, APISSLMODULUS1, sizeof APISSLMODULUS1 - 1) || !memcmp(buf, APISSLMODULUS2, sizeof APISSLMODULUS2 - 1))\n {\n BN_bn2bin(evp->pkey.rsa->e, buf);\n\n if (!memcmp(buf, APISSLEXPONENT, sizeof APISSLEXPONENT - 1))\n {\n ok = 1;\n }\n }\n }\n\n EVP_PKEY_free(evp);\n }\n\n return ok;\n}\n} \/\/ namespace\n<|endoftext|>"} {"text":"<commit_before>\n\/\/\n\/\/ libavg - Media Playback Engine. \n\/\/ Copyright (C) 2003-2008 Ulrich von Zadow\n\/\/\n\/\/ This library is free software; you can redistribute it and\/or\n\/\/ modify it under the terms of the GNU Lesser General Public\n\/\/ License as published by the Free Software Foundation; either\n\/\/ version 2 of the License, or (at your option) any later version.\n\/\/\n\/\/ This library is distributed in the hope that it will be useful,\n\/\/ but WITHOUT ANY WARRANTY; without even the implied warranty of\n\/\/ MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU\n\/\/ Lesser General Public License for more details.\n\/\/\n\/\/ You should have received a copy of the GNU Lesser General Public\n\/\/ License along with this library; if not, write to the Free Software\n\/\/ Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA\n\/\/\n\/\/ Current versions can be found at www.libavg.de\n\/\/\n\n#include \"VideoWriterThread.h\"\n\nusing namespace std;\n\nnamespace avg {\n\nconst unsigned int VIDEO_BUFFER_SIZE = 400000;\nconst ffmpeg::PixelFormat STREAM_PIXEL_FORMAT = ffmpeg::PIX_FMT_YUVJ420P;\n\nVideoWriterThread::VideoWriterThread(CQueue& CmdQueue, const string& sFileName,\n IntPoint size, int frameRate, int qMin, int qMax)\n : WorkerThread<VideoWriterThread>(sFileName, CmdQueue),\n m_Size(size)\n{\n open(sFileName, size, frameRate, qMin, qMax);\n}\n\nVideoWriterThread::~VideoWriterThread()\n{\n}\n\nvoid VideoWriterThread::encodeFrame(BitmapPtr pBmp)\n{\n convertImage(pBmp);\n writeFrame(m_pConvertedFrame);\n}\n\nbool VideoWriterThread::work()\n{\n return true;\n}\n\nvoid VideoWriterThread::deinit()\n{\n ffmpeg::av_write_trailer(m_pOutputFormatContext);\n ffmpeg::avcodec_close(m_pVideoStream->codec);\n\n for (unsigned int i=0; i<m_pOutputFormatContext->nb_streams; i++) {\n ffmpeg::AVStream* pStream = m_pOutputFormatContext->streams[i];\n\n pStream->discard = ffmpeg::AVDISCARD_ALL;\n ffmpeg::av_freep(&m_pOutputFormatContext->streams[i]->codec);\n ffmpeg::av_freep(&m_pOutputFormatContext->streams[i]);\n }\n\n if (!(m_pOutputFormat->flags & AVFMT_NOFILE)) {\n ffmpeg::url_fclose(m_pOutputFormatContext->pb);\n }\n\n ffmpeg::av_free(m_pOutputFormatContext);\n ffmpeg::av_free(m_pVideoBuffer);\n ffmpeg::av_free(m_pConvertedFrame);\n ffmpeg::av_free(m_pPictureBuffer);\n ffmpeg::sws_freeContext(m_pFrameConversionContext);\n}\n\nvoid VideoWriterThread::open(const string& sFileName, IntPoint size, int frameRate,\n int qMin, int qMax)\n{\n ffmpeg::av_register_all(); \/\/ TODO: make sure this is only done once. \n\/\/ ffmpeg::av_log_set_level(AV_LOG_DEBUG);\n m_pOutputFormat = ffmpeg::guess_format(\"mov\", NULL, NULL);\n m_pOutputFormat->video_codec = ffmpeg::CODEC_ID_MJPEG;\n\n m_pOutputFormatContext = ffmpeg::av_alloc_format_context();\n\n m_pOutputFormatContext->oformat = m_pOutputFormat;\n\n snprintf(m_pOutputFormatContext->filename, sizeof(m_pOutputFormatContext->filename),\n \"%s\", sFileName.c_str());\n\n if (m_pOutputFormat->video_codec != ffmpeg::CODEC_ID_NONE) {\n setupVideoStream(frameRate, qMin, qMax);\n }\n\n av_set_parameters(m_pOutputFormatContext, NULL);\n\n double muxPreload = 0.5;\n double muxMaxDelay = 0.7;\n m_pOutputFormatContext->preload = int(muxPreload * AV_TIME_BASE);\n m_pOutputFormatContext->max_delay = int(muxMaxDelay * AV_TIME_BASE);\n\n ffmpeg::dump_format(m_pOutputFormatContext, 0, sFileName.c_str(), 1);\n\n openVideoCodec();\n\n m_pVideoBuffer = NULL;\n if (!(m_pOutputFormatContext->oformat->flags & AVFMT_RAWPICTURE)) {\n \/* allocate output buffer *\/\n \/* XXX: API change will be done *\/\n \/* buffers passed into lav* can be allocated any way you prefer,\n as long as they're aligned enough for the architecture, and\n they're freed appropriately (such as using av_free for buffers\n allocated with av_malloc) *\/\n m_pVideoBuffer = (unsigned char*)(ffmpeg::av_malloc(VIDEO_BUFFER_SIZE));\n }\n\n if (!(m_pOutputFormat->flags & AVFMT_NOFILE)) {\n int retVal = url_fopen(&m_pOutputFormatContext->pb, sFileName.c_str(),\n URL_WRONLY);\n if (retVal < 0) {\n \/\/ TODO: Throw exception\n cerr << \"Could not open output file: \" << sFileName << endl;\n }\n }\n\n m_pFrameConversionContext = ffmpeg::sws_getContext(m_Size.x, m_Size.y, \n ffmpeg::PIX_FMT_BGRA, m_Size.x, m_Size.y, STREAM_PIXEL_FORMAT, \n SWS_BICUBIC, NULL, NULL, NULL);\n\n m_pConvertedFrame = createFrame(STREAM_PIXEL_FORMAT, m_Size);\n\n ffmpeg::av_write_header(m_pOutputFormatContext);\n}\n\nvoid VideoWriterThread::setupVideoStream(int frameRate, int qMin, int qMax)\n{\n m_pVideoStream = ffmpeg::av_new_stream(m_pOutputFormatContext, 0);\n\n ffmpeg::AVCodecContext* pCodecContext = m_pVideoStream->codec;\n pCodecContext->codec_id = static_cast<ffmpeg::CodecID>(m_pOutputFormat->video_codec);\n pCodecContext->codec_type = ffmpeg::CODEC_TYPE_VIDEO;\n\n \/* put sample parameters *\/\n pCodecContext->bit_rate = 400000;\n \/* resolution must be a multiple of two *\/\n pCodecContext->width = m_Size.x;\n pCodecContext->height = m_Size.y;\n \/* time base: this is the fundamental unit of time (in seconds) in terms\n of which frame timestamps are represented. for fixed-fps content,\n timebase should be 1\/framerate and timestamp increments should be\n identically 1. *\/\n pCodecContext->time_base.den = frameRate;\n pCodecContext->time_base.num = 1;\n pCodecContext->gop_size = 12; \/* emit one intra frame every twelve frames at most *\/\n pCodecContext->pix_fmt = STREAM_PIXEL_FORMAT;\n \/\/ Quality of quantization\n pCodecContext->qmin = qMin;\n pCodecContext->qmax = qMax;\n \/\/ some formats want stream headers to be separate\n if (m_pOutputFormatContext->oformat->flags & AVFMT_GLOBALHEADER) {\n pCodecContext->flags |= CODEC_FLAG_GLOBAL_HEADER;\n }\n}\n\nvoid VideoWriterThread::openVideoCodec()\n{\n \/* find the video encoder *\/\n ffmpeg::AVCodec* videoCodec = ffmpeg::avcodec_find_encoder(\n m_pVideoStream->codec->codec_id);\n if (!videoCodec) {\n cerr << \"codec not found\" << endl;\n }\n\n \/* open the codec *\/\n if (ffmpeg::avcodec_open(m_pVideoStream->codec, videoCodec) < 0) {\n cerr << \"could not open codec\" << endl;\n }\n}\n\nffmpeg::AVFrame* VideoWriterThread::createFrame(ffmpeg::PixelFormat pixelFormat,\n IntPoint size)\n{\n ffmpeg::AVFrame* pPicture;\n\n pPicture = ffmpeg::avcodec_alloc_frame();\n if (!pPicture) {\n return NULL;\n }\n\n int memNeeded = ffmpeg::avpicture_get_size(pixelFormat, size.x, size.y);\n m_pPictureBuffer = static_cast<unsigned char*>(ffmpeg::av_malloc(memNeeded));\n if (!m_pPictureBuffer) {\n ffmpeg::av_free(pPicture);\n return NULL;\n }\n ffmpeg::avpicture_fill(reinterpret_cast<ffmpeg::AVPicture*>(pPicture),\n m_pPictureBuffer, pixelFormat, size.x, size.y);\n\n return pPicture;\n}\n\nvoid VideoWriterThread::convertImage(BitmapPtr pBitmap)\n{\n unsigned char* rgbData[3] = {pBitmap->getPixels(), NULL, NULL};\n int rgbStride[3] = {pBitmap->getLineLen(), 0, 0};\n\n sws_scale(m_pFrameConversionContext, rgbData, rgbStride,\n 0, m_Size.y, m_pConvertedFrame->data, m_pConvertedFrame->linesize);\n}\n\nvoid VideoWriterThread::writeFrame(ffmpeg::AVFrame* pFrame)\n{\n ffmpeg::AVCodecContext* pCodecContext = m_pVideoStream->codec;\n int out_size = ffmpeg::avcodec_encode_video(pCodecContext, m_pVideoBuffer,\n VIDEO_BUFFER_SIZE, pFrame);\n\n \/* if zero size, it means the image was buffered *\/\n if (out_size > 0) {\n ffmpeg::AVPacket packet;\n ffmpeg::av_init_packet(&packet);\n\n if (pCodecContext->coded_frame->pts != AV_NOPTS_VALUE) {\n packet.pts = av_rescale_q(pCodecContext->coded_frame->pts,\n pCodecContext->time_base, m_pVideoStream->time_base);\n }\n\n if (pCodecContext->coded_frame->key_frame) {\n packet.flags |= PKT_FLAG_KEY;\n }\n packet.stream_index = m_pVideoStream->index;\n packet.data = m_pVideoBuffer;\n packet.size = out_size;\n\n \/* write the compressed frame in the media file *\/\n int ret = ffmpeg::av_interleaved_write_frame(m_pOutputFormatContext, &packet);\n if (ret != 0) {\n std::cerr << \"Error while writing video frame\" << std::endl;\n assert(false);\n }\n }\n\n}\n\n}\n\n<commit_msg>Replaced snprintf by strncpy to fix windows build.<commit_after>\n\/\/\n\/\/ libavg - Media Playback Engine. \n\/\/ Copyright (C) 2003-2008 Ulrich von Zadow\n\/\/\n\/\/ This library is free software; you can redistribute it and\/or\n\/\/ modify it under the terms of the GNU Lesser General Public\n\/\/ License as published by the Free Software Foundation; either\n\/\/ version 2 of the License, or (at your option) any later version.\n\/\/\n\/\/ This library is distributed in the hope that it will be useful,\n\/\/ but WITHOUT ANY WARRANTY; without even the implied warranty of\n\/\/ MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU\n\/\/ Lesser General Public License for more details.\n\/\/\n\/\/ You should have received a copy of the GNU Lesser General Public\n\/\/ License along with this library; if not, write to the Free Software\n\/\/ Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA\n\/\/\n\/\/ Current versions can be found at www.libavg.de\n\/\/\n\n#include \"VideoWriterThread.h\"\n\nusing namespace std;\n\nnamespace avg {\n\nconst unsigned int VIDEO_BUFFER_SIZE = 400000;\nconst ffmpeg::PixelFormat STREAM_PIXEL_FORMAT = ffmpeg::PIX_FMT_YUVJ420P;\n\nVideoWriterThread::VideoWriterThread(CQueue& CmdQueue, const string& sFileName,\n IntPoint size, int frameRate, int qMin, int qMax)\n : WorkerThread<VideoWriterThread>(sFileName, CmdQueue),\n m_Size(size)\n{\n open(sFileName, size, frameRate, qMin, qMax);\n}\n\nVideoWriterThread::~VideoWriterThread()\n{\n}\n\nvoid VideoWriterThread::encodeFrame(BitmapPtr pBmp)\n{\n convertImage(pBmp);\n writeFrame(m_pConvertedFrame);\n}\n\nbool VideoWriterThread::work()\n{\n return true;\n}\n\nvoid VideoWriterThread::deinit()\n{\n ffmpeg::av_write_trailer(m_pOutputFormatContext);\n ffmpeg::avcodec_close(m_pVideoStream->codec);\n\n for (unsigned int i=0; i<m_pOutputFormatContext->nb_streams; i++) {\n ffmpeg::AVStream* pStream = m_pOutputFormatContext->streams[i];\n\n pStream->discard = ffmpeg::AVDISCARD_ALL;\n ffmpeg::av_freep(&m_pOutputFormatContext->streams[i]->codec);\n ffmpeg::av_freep(&m_pOutputFormatContext->streams[i]);\n }\n\n if (!(m_pOutputFormat->flags & AVFMT_NOFILE)) {\n ffmpeg::url_fclose(m_pOutputFormatContext->pb);\n }\n\n ffmpeg::av_free(m_pOutputFormatContext);\n ffmpeg::av_free(m_pVideoBuffer);\n ffmpeg::av_free(m_pConvertedFrame);\n ffmpeg::av_free(m_pPictureBuffer);\n ffmpeg::sws_freeContext(m_pFrameConversionContext);\n}\n\nvoid VideoWriterThread::open(const string& sFileName, IntPoint size, int frameRate,\n int qMin, int qMax)\n{\n ffmpeg::av_register_all(); \/\/ TODO: make sure this is only done once. \n\/\/ ffmpeg::av_log_set_level(AV_LOG_DEBUG);\n m_pOutputFormat = ffmpeg::guess_format(\"mov\", NULL, NULL);\n m_pOutputFormat->video_codec = ffmpeg::CODEC_ID_MJPEG;\n\n m_pOutputFormatContext = ffmpeg::av_alloc_format_context();\n\n m_pOutputFormatContext->oformat = m_pOutputFormat;\n\n strncpy(m_pOutputFormatContext->filename, sFileName.c_str(),\n sizeof(m_pOutputFormatContext->filename));\n\n if (m_pOutputFormat->video_codec != ffmpeg::CODEC_ID_NONE) {\n setupVideoStream(frameRate, qMin, qMax);\n }\n\n av_set_parameters(m_pOutputFormatContext, NULL);\n\n double muxPreload = 0.5;\n double muxMaxDelay = 0.7;\n m_pOutputFormatContext->preload = int(muxPreload * AV_TIME_BASE);\n m_pOutputFormatContext->max_delay = int(muxMaxDelay * AV_TIME_BASE);\n\n ffmpeg::dump_format(m_pOutputFormatContext, 0, sFileName.c_str(), 1);\n\n openVideoCodec();\n\n m_pVideoBuffer = NULL;\n if (!(m_pOutputFormatContext->oformat->flags & AVFMT_RAWPICTURE)) {\n \/* allocate output buffer *\/\n \/* XXX: API change will be done *\/\n \/* buffers passed into lav* can be allocated any way you prefer,\n as long as they're aligned enough for the architecture, and\n they're freed appropriately (such as using av_free for buffers\n allocated with av_malloc) *\/\n m_pVideoBuffer = (unsigned char*)(ffmpeg::av_malloc(VIDEO_BUFFER_SIZE));\n }\n\n if (!(m_pOutputFormat->flags & AVFMT_NOFILE)) {\n int retVal = url_fopen(&m_pOutputFormatContext->pb, sFileName.c_str(),\n URL_WRONLY);\n if (retVal < 0) {\n \/\/ TODO: Throw exception\n cerr << \"Could not open output file: \" << sFileName << endl;\n }\n }\n\n m_pFrameConversionContext = ffmpeg::sws_getContext(m_Size.x, m_Size.y, \n ffmpeg::PIX_FMT_BGRA, m_Size.x, m_Size.y, STREAM_PIXEL_FORMAT, \n SWS_BICUBIC, NULL, NULL, NULL);\n\n m_pConvertedFrame = createFrame(STREAM_PIXEL_FORMAT, m_Size);\n\n ffmpeg::av_write_header(m_pOutputFormatContext);\n}\n\nvoid VideoWriterThread::setupVideoStream(int frameRate, int qMin, int qMax)\n{\n m_pVideoStream = ffmpeg::av_new_stream(m_pOutputFormatContext, 0);\n\n ffmpeg::AVCodecContext* pCodecContext = m_pVideoStream->codec;\n pCodecContext->codec_id = static_cast<ffmpeg::CodecID>(m_pOutputFormat->video_codec);\n pCodecContext->codec_type = ffmpeg::CODEC_TYPE_VIDEO;\n\n \/* put sample parameters *\/\n pCodecContext->bit_rate = 400000;\n \/* resolution must be a multiple of two *\/\n pCodecContext->width = m_Size.x;\n pCodecContext->height = m_Size.y;\n \/* time base: this is the fundamental unit of time (in seconds) in terms\n of which frame timestamps are represented. for fixed-fps content,\n timebase should be 1\/framerate and timestamp increments should be\n identically 1. *\/\n pCodecContext->time_base.den = frameRate;\n pCodecContext->time_base.num = 1;\n pCodecContext->gop_size = 12; \/* emit one intra frame every twelve frames at most *\/\n pCodecContext->pix_fmt = STREAM_PIXEL_FORMAT;\n \/\/ Quality of quantization\n pCodecContext->qmin = qMin;\n pCodecContext->qmax = qMax;\n \/\/ some formats want stream headers to be separate\n if (m_pOutputFormatContext->oformat->flags & AVFMT_GLOBALHEADER) {\n pCodecContext->flags |= CODEC_FLAG_GLOBAL_HEADER;\n }\n}\n\nvoid VideoWriterThread::openVideoCodec()\n{\n \/* find the video encoder *\/\n ffmpeg::AVCodec* videoCodec = ffmpeg::avcodec_find_encoder(\n m_pVideoStream->codec->codec_id);\n if (!videoCodec) {\n cerr << \"codec not found\" << endl;\n }\n\n \/* open the codec *\/\n if (ffmpeg::avcodec_open(m_pVideoStream->codec, videoCodec) < 0) {\n cerr << \"could not open codec\" << endl;\n }\n}\n\nffmpeg::AVFrame* VideoWriterThread::createFrame(ffmpeg::PixelFormat pixelFormat,\n IntPoint size)\n{\n ffmpeg::AVFrame* pPicture;\n\n pPicture = ffmpeg::avcodec_alloc_frame();\n if (!pPicture) {\n return NULL;\n }\n\n int memNeeded = ffmpeg::avpicture_get_size(pixelFormat, size.x, size.y);\n m_pPictureBuffer = static_cast<unsigned char*>(ffmpeg::av_malloc(memNeeded));\n if (!m_pPictureBuffer) {\n ffmpeg::av_free(pPicture);\n return NULL;\n }\n ffmpeg::avpicture_fill(reinterpret_cast<ffmpeg::AVPicture*>(pPicture),\n m_pPictureBuffer, pixelFormat, size.x, size.y);\n\n return pPicture;\n}\n\nvoid VideoWriterThread::convertImage(BitmapPtr pBitmap)\n{\n unsigned char* rgbData[3] = {pBitmap->getPixels(), NULL, NULL};\n int rgbStride[3] = {pBitmap->getLineLen(), 0, 0};\n\n sws_scale(m_pFrameConversionContext, rgbData, rgbStride,\n 0, m_Size.y, m_pConvertedFrame->data, m_pConvertedFrame->linesize);\n}\n\nvoid VideoWriterThread::writeFrame(ffmpeg::AVFrame* pFrame)\n{\n ffmpeg::AVCodecContext* pCodecContext = m_pVideoStream->codec;\n int out_size = ffmpeg::avcodec_encode_video(pCodecContext, m_pVideoBuffer,\n VIDEO_BUFFER_SIZE, pFrame);\n\n \/* if zero size, it means the image was buffered *\/\n if (out_size > 0) {\n ffmpeg::AVPacket packet;\n ffmpeg::av_init_packet(&packet);\n\n if (pCodecContext->coded_frame->pts != AV_NOPTS_VALUE) {\n packet.pts = av_rescale_q(pCodecContext->coded_frame->pts,\n pCodecContext->time_base, m_pVideoStream->time_base);\n }\n\n if (pCodecContext->coded_frame->key_frame) {\n packet.flags |= PKT_FLAG_KEY;\n }\n packet.stream_index = m_pVideoStream->index;\n packet.data = m_pVideoBuffer;\n packet.size = out_size;\n\n \/* write the compressed frame in the media file *\/\n int ret = ffmpeg::av_interleaved_write_frame(m_pOutputFormatContext, &packet);\n if (ret != 0) {\n std::cerr << \"Error while writing video frame\" << std::endl;\n assert(false);\n }\n }\n\n}\n\n}\n\n<|endoftext|>"} {"text":"<commit_before>\/\/ Copyright (c) 2008 The Chromium Authors. All rights reserved. Use of this\n\/\/ source code is governed by a BSD-style license that can be found in the\n\/\/ LICENSE file.\n\n#include \"config.h\"\n#include \"PluginData.h\"\n\n#include \"PluginInfoStore.h\"\n\n#undef LOG\n#include \"webkit\/glue\/glue_util.h\"\n#include \"webkit\/glue\/webkit_glue.h\"\n\nnamespace WebCore {\n\nstatic bool refreshData = false;\n\nvoid PluginData::initPlugins()\n{\n std::vector<WebPluginInfo> plugins;\n if (!webkit_glue::GetPlugins(refreshData, &plugins))\n return;\n refreshData = false;\n\n PluginInfoStore c;\n for (size_t i = 0; i < plugins.size(); ++i) {\n PluginInfo* info = c.createPluginInfoForPluginAtIndex(i);\n m_plugins.append(info);\n }\n}\n\nvoid PluginData::refresh()\n{\n \/\/ When next we initialize a PluginData, it'll be fresh.\n refreshData = true;\n}\n\n}\n<commit_msg>Fix plugin data refreshing to work again.<commit_after>\/\/ Copyright (c) 2008, Google Inc.\n\/\/ All rights reserved.\n\/\/ \n\/\/ Redistribution and use in source and binary forms, with or without\n\/\/ modification, are permitted provided that the following conditions are\n\/\/ met:\n\/\/ \n\/\/ * Redistributions of source code must retain the above copyright\n\/\/ notice, this list of conditions and the following disclaimer.\n\/\/ * Redistributions in binary form must reproduce the above\n\/\/ copyright notice, this list of conditions and the following disclaimer\n\/\/ in the documentation and\/or other materials provided with the\n\/\/ distribution.\n\/\/ * Neither the name of Google Inc. nor the names of its\n\/\/ contributors may be used to endorse or promote products derived from\n\/\/ this software without specific prior written permission.\n\/\/ \n\/\/ THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS\n\/\/ \"AS IS\" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT\n\/\/ LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR\n\/\/ A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT\n\/\/ OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,\n\/\/ SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT\n\/\/ LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,\n\/\/ DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY\n\/\/ THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT\n\/\/ (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE\n\/\/ OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.\n\n#include \"config.h\"\n#include \"PluginData.h\"\n\n#include \"PluginInfoStore.h\"\n\nnamespace WebCore {\n\nvoid PluginData::initPlugins()\n{\n PluginInfoStore c;\n for (size_t i = 0; i < c.pluginCount(); ++i)\n m_plugins.append(c.createPluginInfoForPluginAtIndex(i));\n}\n\nvoid PluginData::refresh()\n{\n refreshPlugins(true);\n}\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\n\n#define WIN32_LEAN_AND_MEAN\n#include <Windows.h>\n#include <wincodec.h>\n#include \"SkAutoCoInitialize.h\"\n#include \"SkImageDecoder.h\"\n#include \"SkImageEncoder.h\"\n#include \"SkIStream.h\"\n#include \"SkMovie.h\"\n#include \"SkStream.h\"\n#include \"SkTScopedComPtr.h\"\n\nclass SkImageDecoder_WIC : public SkImageDecoder {\nprotected:\n virtual bool onDecode(SkStream* stream, SkBitmap* bm, Mode mode);\n};\n\nbool SkImageDecoder_WIC::onDecode(SkStream* stream, SkBitmap* bm, Mode mode) {\n \/\/Initialize COM.\n SkAutoCoInitialize scopedCo;\n if (!scopedCo.succeeded()) {\n return false;\n }\n\n HRESULT hr = S_OK;\n\n \/\/Create Windows Imaging Component ImagingFactory.\n SkTScopedComPtr<IWICImagingFactory> piImagingFactory;\n if (SUCCEEDED(hr)) {\n hr = CoCreateInstance(\n CLSID_WICImagingFactory\n , NULL\n , CLSCTX_INPROC_SERVER\n , IID_PPV_ARGS(&piImagingFactory)\n );\n }\n\n \/\/Convert SkStream to IStream.\n SkTScopedComPtr<IStream> piStream;\n if (SUCCEEDED(hr)) {\n hr = SkIStream::CreateFromSkStream(stream, false, &piStream);\n }\n\n \/\/Make sure we're at the beginning of the stream.\n if (SUCCEEDED(hr)) {\n LARGE_INTEGER liBeginning = { 0 };\n hr = piStream->Seek(liBeginning, STREAM_SEEK_SET, NULL);\n }\n\n \/\/Create the decoder from the stream content.\n SkTScopedComPtr<IWICBitmapDecoder> piBitmapDecoder;\n if (SUCCEEDED(hr)) {\n hr = piImagingFactory->CreateDecoderFromStream(\n piStream.get() \/\/Image to be decoded\n , NULL \/\/No particular vendor\n , WICDecodeMetadataCacheOnDemand \/\/Cache metadata when needed\n , &piBitmapDecoder \/\/Pointer to the decoder\n );\n }\n\n \/\/Get the first frame from the decoder.\n SkTScopedComPtr<IWICBitmapFrameDecode> piBitmapFrameDecode;\n if (SUCCEEDED(hr)) {\n hr = piBitmapDecoder->GetFrame(0, &piBitmapFrameDecode);\n }\n\n \/\/Get the BitmapSource interface of the frame.\n SkTScopedComPtr<IWICBitmapSource> piBitmapSourceOriginal;\n if (SUCCEEDED(hr)) {\n hr = piBitmapFrameDecode->QueryInterface(\n IID_PPV_ARGS(&piBitmapSourceOriginal)\n );\n }\n\n \/\/Get the size of the bitmap.\n UINT width;\n UINT height;\n if (SUCCEEDED(hr)) {\n hr = piBitmapSourceOriginal->GetSize(&width, &height);\n }\n\n \/\/Exit early if we're only looking for the bitmap bounds.\n if (SUCCEEDED(hr)) {\n bm->setConfig(SkBitmap::kARGB_8888_Config, width, height);\n if (SkImageDecoder::kDecodeBounds_Mode == mode) {\n return true;\n }\n if (!this->allocPixelRef(bm, NULL)) {\n return false;\n }\n }\n\n \/\/Create a format converter.\n SkTScopedComPtr<IWICFormatConverter> piFormatConverter;\n if (SUCCEEDED(hr)) {\n hr = piImagingFactory->CreateFormatConverter(&piFormatConverter);\n }\n\n if (SUCCEEDED(hr)) {\n hr = piFormatConverter->Initialize(\n piBitmapSourceOriginal.get() \/\/Input bitmap to convert\n , GUID_WICPixelFormat32bppPBGRA \/\/Destination pixel format\n , WICBitmapDitherTypeNone \/\/Specified dither patterm\n , NULL \/\/Specify a particular palette\n , 0.f \/\/Alpha threshold\n , WICBitmapPaletteTypeCustom \/\/Palette translation type\n );\n }\n\n \/\/Get the BitmapSource interface of the format converter.\n SkTScopedComPtr<IWICBitmapSource> piBitmapSourceConverted;\n if (SUCCEEDED(hr)) {\n hr = piFormatConverter->QueryInterface(\n IID_PPV_ARGS(&piBitmapSourceConverted)\n );\n }\n\n \/\/Copy the pixels into the bitmap.\n if (SUCCEEDED(hr)) {\n SkAutoLockPixels alp(*bm);\n bm->eraseColor(0);\n const int stride = bm->rowBytes();\n hr = piBitmapSourceConverted->CopyPixels(\n NULL, \/\/Get all the pixels\n stride,\n stride * height,\n reinterpret_cast<BYTE *>(bm->getPixels())\n );\n }\n\n return SUCCEEDED(hr);\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nSkImageDecoder* SkImageDecoder::Factory(SkStream* stream) {\n return SkNEW(SkImageDecoder_WIC);\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nSkMovie* SkMovie::DecodeStream(SkStream* stream) {\n return NULL;\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nclass SkImageEncoder_WIC : public SkImageEncoder {\npublic:\n SkImageEncoder_WIC(Type t) : fType(t) {}\n\nprotected:\n virtual bool onEncode(SkWStream* stream, const SkBitmap& bm, int quality);\n\nprivate:\n Type fType;\n};\n\nbool SkImageEncoder_WIC::onEncode(SkWStream* stream\n , const SkBitmap& bitmapOrig\n , int quality)\n{\n GUID type;\n switch (fType) {\n case kJPEG_Type:\n type = GUID_ContainerFormatJpeg;\n break;\n case kPNG_Type:\n type = GUID_ContainerFormatPng;\n break;\n default:\n return false;\n }\n\n \/\/Convert to 8888 if needed.\n const SkBitmap* bitmap;\n SkBitmap bitmapCopy;\n if (SkBitmap::kARGB_8888_Config == bitmapOrig.config()) {\n bitmap = &bitmapOrig;\n } else {\n if (!bitmapOrig.copyTo(&bitmapCopy, SkBitmap::kARGB_8888_Config)) {\n return false;\n }\n bitmap = &bitmapCopy;\n }\n\n \/\/Initialize COM.\n SkAutoCoInitialize scopedCo;\n if (!scopedCo.succeeded()) {\n return false;\n }\n\n HRESULT hr = S_OK;\n\n \/\/Create Windows Imaging Component ImagingFactory.\n SkTScopedComPtr<IWICImagingFactory> piImagingFactory;\n if (SUCCEEDED(hr)) {\n hr = CoCreateInstance(\n CLSID_WICImagingFactory\n , NULL\n , CLSCTX_INPROC_SERVER\n , IID_PPV_ARGS(&piImagingFactory)\n );\n }\n\n \/\/Convert the SkWStream to an IStream.\n SkTScopedComPtr<IStream> piStream;\n if (SUCCEEDED(hr)) {\n hr = SkWIStream::CreateFromSkWStream(stream, &piStream);\n }\n\n \/\/Create an encode of the appropriate type.\n SkTScopedComPtr<IWICBitmapEncoder> piEncoder;\n if (SUCCEEDED(hr)) {\n hr = piImagingFactory->CreateEncoder(type, NULL, &piEncoder);\n }\n\n if (SUCCEEDED(hr)) {\n hr = piEncoder->Initialize(piStream.get(), WICBitmapEncoderNoCache);\n }\n\n \/\/Create a the frame.\n SkTScopedComPtr<IWICBitmapFrameEncode> piBitmapFrameEncode;\n SkTScopedComPtr<IPropertyBag2> piPropertybag;\n if (SUCCEEDED(hr)) {\n hr = piEncoder->CreateNewFrame(&piBitmapFrameEncode, &piPropertybag);\n }\n\n if (SUCCEEDED(hr)) {\n PROPBAG2 name = { 0 };\n name.dwType = PROPBAG2_TYPE_DATA;\n name.vt = VT_R4;\n name.pstrName = L\"ImageQuality\";\n\n VARIANT value;\n VariantInit(&value);\n value.vt = VT_R4;\n value.fltVal = (FLOAT)(quality \/ 100.0);\n\n \/\/Ignore result code.\n \/\/ This returns E_FAIL if the named property is not in the bag.\n \/\/TODO(bungeman) enumerate the properties,\n \/\/ write and set hr iff property exists.\n piPropertybag->Write(1, &name, &value);\n }\n if (SUCCEEDED(hr)) {\n hr = piBitmapFrameEncode->Initialize(piPropertybag.get());\n }\n\n \/\/Set the size of the frame.\n const UINT width = bitmap->width();\n const UINT height = bitmap->height();\n if (SUCCEEDED(hr)) {\n hr = piBitmapFrameEncode->SetSize(width, height);\n }\n\n \/\/Set the pixel format of the frame.\n const WICPixelFormatGUID formatDesired = GUID_WICPixelFormat32bppBGRA;\n WICPixelFormatGUID formatGUID = formatDesired;\n if (SUCCEEDED(hr)) {\n hr = piBitmapFrameEncode->SetPixelFormat(&formatGUID);\n }\n if (SUCCEEDED(hr)) {\n \/\/Be sure the image format is the one requested.\n hr = IsEqualGUID(formatGUID, formatDesired) ? S_OK : E_FAIL;\n }\n\n \/\/Write the pixels into the frame.\n if (SUCCEEDED(hr)) {\n SkAutoLockPixels alp(*bitmap);\n hr = piBitmapFrameEncode->WritePixels(\n height\n , bitmap->rowBytes()\n , bitmap->rowBytes()*height\n , reinterpret_cast<BYTE*>(bitmap->getPixels()));\n }\n\n if (SUCCEEDED(hr)) {\n hr = piBitmapFrameEncode->Commit();\n }\n\n if (SUCCEEDED(hr)) {\n hr = piEncoder->Commit();\n }\n\n return SUCCEEDED(hr);\n}\n\nSkImageEncoder* SkImageEncoder::Create(Type t) {\n switch (t) {\n case kJPEG_Type:\n case kPNG_Type:\n break;\n default:\n return NULL;\n }\n return SkNEW_ARGS(SkImageEncoder_WIC, (t));\n}\n\n<commit_msg>Update WIC Image decoder to unpremul colors before save<commit_after>\n\/*\n * Copyright 2011 Google Inc.\n *\n * Use of this source code is governed by a BSD-style license that can be\n * found in the LICENSE file.\n *\/\n\n\n#define WIN32_LEAN_AND_MEAN\n#include <Windows.h>\n#include <wincodec.h>\n#include \"SkAutoCoInitialize.h\"\n#include \"SkImageDecoder.h\"\n#include \"SkImageEncoder.h\"\n#include \"SkIStream.h\"\n#include \"SkMovie.h\"\n#include \"SkStream.h\"\n#include \"SkTScopedComPtr.h\"\n#include \"SkUnPreMultiply.h\"\n\nclass SkImageDecoder_WIC : public SkImageDecoder {\nprotected:\n virtual bool onDecode(SkStream* stream, SkBitmap* bm, Mode mode);\n};\n\nbool SkImageDecoder_WIC::onDecode(SkStream* stream, SkBitmap* bm, Mode mode) {\n \/\/Initialize COM.\n SkAutoCoInitialize scopedCo;\n if (!scopedCo.succeeded()) {\n return false;\n }\n\n HRESULT hr = S_OK;\n\n \/\/Create Windows Imaging Component ImagingFactory.\n SkTScopedComPtr<IWICImagingFactory> piImagingFactory;\n if (SUCCEEDED(hr)) {\n hr = CoCreateInstance(\n CLSID_WICImagingFactory\n , NULL\n , CLSCTX_INPROC_SERVER\n , IID_PPV_ARGS(&piImagingFactory)\n );\n }\n\n \/\/Convert SkStream to IStream.\n SkTScopedComPtr<IStream> piStream;\n if (SUCCEEDED(hr)) {\n hr = SkIStream::CreateFromSkStream(stream, false, &piStream);\n }\n\n \/\/Make sure we're at the beginning of the stream.\n if (SUCCEEDED(hr)) {\n LARGE_INTEGER liBeginning = { 0 };\n hr = piStream->Seek(liBeginning, STREAM_SEEK_SET, NULL);\n }\n\n \/\/Create the decoder from the stream content.\n SkTScopedComPtr<IWICBitmapDecoder> piBitmapDecoder;\n if (SUCCEEDED(hr)) {\n hr = piImagingFactory->CreateDecoderFromStream(\n piStream.get() \/\/Image to be decoded\n , NULL \/\/No particular vendor\n , WICDecodeMetadataCacheOnDemand \/\/Cache metadata when needed\n , &piBitmapDecoder \/\/Pointer to the decoder\n );\n }\n\n \/\/Get the first frame from the decoder.\n SkTScopedComPtr<IWICBitmapFrameDecode> piBitmapFrameDecode;\n if (SUCCEEDED(hr)) {\n hr = piBitmapDecoder->GetFrame(0, &piBitmapFrameDecode);\n }\n\n \/\/Get the BitmapSource interface of the frame.\n SkTScopedComPtr<IWICBitmapSource> piBitmapSourceOriginal;\n if (SUCCEEDED(hr)) {\n hr = piBitmapFrameDecode->QueryInterface(\n IID_PPV_ARGS(&piBitmapSourceOriginal)\n );\n }\n\n \/\/Get the size of the bitmap.\n UINT width;\n UINT height;\n if (SUCCEEDED(hr)) {\n hr = piBitmapSourceOriginal->GetSize(&width, &height);\n }\n\n \/\/Exit early if we're only looking for the bitmap bounds.\n if (SUCCEEDED(hr)) {\n bm->setConfig(SkBitmap::kARGB_8888_Config, width, height);\n if (SkImageDecoder::kDecodeBounds_Mode == mode) {\n return true;\n }\n if (!this->allocPixelRef(bm, NULL)) {\n return false;\n }\n }\n\n \/\/Create a format converter.\n SkTScopedComPtr<IWICFormatConverter> piFormatConverter;\n if (SUCCEEDED(hr)) {\n hr = piImagingFactory->CreateFormatConverter(&piFormatConverter);\n }\n\n if (SUCCEEDED(hr)) {\n hr = piFormatConverter->Initialize(\n piBitmapSourceOriginal.get() \/\/Input bitmap to convert\n , GUID_WICPixelFormat32bppPBGRA \/\/Destination pixel format\n , WICBitmapDitherTypeNone \/\/Specified dither patterm\n , NULL \/\/Specify a particular palette\n , 0.f \/\/Alpha threshold\n , WICBitmapPaletteTypeCustom \/\/Palette translation type\n );\n }\n\n \/\/Get the BitmapSource interface of the format converter.\n SkTScopedComPtr<IWICBitmapSource> piBitmapSourceConverted;\n if (SUCCEEDED(hr)) {\n hr = piFormatConverter->QueryInterface(\n IID_PPV_ARGS(&piBitmapSourceConverted)\n );\n }\n\n \/\/Copy the pixels into the bitmap.\n if (SUCCEEDED(hr)) {\n SkAutoLockPixels alp(*bm);\n bm->eraseColor(0);\n const int stride = bm->rowBytes();\n hr = piBitmapSourceConverted->CopyPixels(\n NULL, \/\/Get all the pixels\n stride,\n stride * height,\n reinterpret_cast<BYTE *>(bm->getPixels())\n );\n\n \/\/ Note: we don't need to premultiply here since we specified PBGRA\n bm->computeAndSetOpaquePredicate();\n }\n\n return SUCCEEDED(hr);\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nSkImageDecoder* SkImageDecoder::Factory(SkStream* stream) {\n return SkNEW(SkImageDecoder_WIC);\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nSkMovie* SkMovie::DecodeStream(SkStream* stream) {\n return NULL;\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nclass SkImageEncoder_WIC : public SkImageEncoder {\npublic:\n SkImageEncoder_WIC(Type t) : fType(t) {}\n\nprotected:\n virtual bool onEncode(SkWStream* stream, const SkBitmap& bm, int quality);\n\nprivate:\n Type fType;\n};\n\nbool SkImageEncoder_WIC::onEncode(SkWStream* stream\n , const SkBitmap& bitmapOrig\n , int quality)\n{\n GUID type;\n switch (fType) {\n case kJPEG_Type:\n type = GUID_ContainerFormatJpeg;\n break;\n case kPNG_Type:\n type = GUID_ContainerFormatPng;\n break;\n default:\n return false;\n }\n\n \/\/Convert to 8888 if needed.\n const SkBitmap* bitmap;\n SkBitmap bitmapCopy;\n if (SkBitmap::kARGB_8888_Config == bitmapOrig.config() && bitmapOrig.isOpaque()) {\n bitmap = &bitmapOrig;\n } else {\n if (!bitmapOrig.copyTo(&bitmapCopy, SkBitmap::kARGB_8888_Config)) {\n return false;\n }\n bitmap = &bitmapCopy;\n }\n\n \/\/ We cannot use PBGRA so we need to unpremultiply ourselves\n if (!bitmap->isOpaque()) {\n SkAutoLockPixels alp(*bitmap);\n\n uint8_t* pixels = reinterpret_cast<uint8_t*>(bitmap->getPixels());\n for (int y = 0; y < bitmap->height(); ++y) {\n for (int x = 0; x < bitmap->width(); ++x) {\n uint8_t* bytes = pixels + y * bitmap->rowBytes() + x * bitmap->bytesPerPixel();\n\n SkPMColor* src = reinterpret_cast<SkPMColor*>(bytes);\n SkColor* dst = reinterpret_cast<SkColor*>(bytes);\n\n *dst = SkUnPreMultiply::PMColorToColor(*src);\n }\n }\n }\n\n \/\/Initialize COM.\n SkAutoCoInitialize scopedCo;\n if (!scopedCo.succeeded()) {\n return false;\n }\n\n HRESULT hr = S_OK;\n\n \/\/Create Windows Imaging Component ImagingFactory.\n SkTScopedComPtr<IWICImagingFactory> piImagingFactory;\n if (SUCCEEDED(hr)) {\n hr = CoCreateInstance(\n CLSID_WICImagingFactory\n , NULL\n , CLSCTX_INPROC_SERVER\n , IID_PPV_ARGS(&piImagingFactory)\n );\n }\n\n \/\/Convert the SkWStream to an IStream.\n SkTScopedComPtr<IStream> piStream;\n if (SUCCEEDED(hr)) {\n hr = SkWIStream::CreateFromSkWStream(stream, &piStream);\n }\n\n \/\/Create an encode of the appropriate type.\n SkTScopedComPtr<IWICBitmapEncoder> piEncoder;\n if (SUCCEEDED(hr)) {\n hr = piImagingFactory->CreateEncoder(type, NULL, &piEncoder);\n }\n\n if (SUCCEEDED(hr)) {\n hr = piEncoder->Initialize(piStream.get(), WICBitmapEncoderNoCache);\n }\n\n \/\/Create a the frame.\n SkTScopedComPtr<IWICBitmapFrameEncode> piBitmapFrameEncode;\n SkTScopedComPtr<IPropertyBag2> piPropertybag;\n if (SUCCEEDED(hr)) {\n hr = piEncoder->CreateNewFrame(&piBitmapFrameEncode, &piPropertybag);\n }\n\n if (SUCCEEDED(hr)) {\n PROPBAG2 name = { 0 };\n name.dwType = PROPBAG2_TYPE_DATA;\n name.vt = VT_R4;\n name.pstrName = L\"ImageQuality\";\n\n VARIANT value;\n VariantInit(&value);\n value.vt = VT_R4;\n value.fltVal = (FLOAT)(quality \/ 100.0);\n\n \/\/Ignore result code.\n \/\/ This returns E_FAIL if the named property is not in the bag.\n \/\/TODO(bungeman) enumerate the properties,\n \/\/ write and set hr iff property exists.\n piPropertybag->Write(1, &name, &value);\n }\n if (SUCCEEDED(hr)) {\n hr = piBitmapFrameEncode->Initialize(piPropertybag.get());\n }\n\n \/\/Set the size of the frame.\n const UINT width = bitmap->width();\n const UINT height = bitmap->height();\n if (SUCCEEDED(hr)) {\n hr = piBitmapFrameEncode->SetSize(width, height);\n }\n\n \/\/Set the pixel format of the frame.\n const WICPixelFormatGUID formatDesired = GUID_WICPixelFormat32bppBGRA;\n WICPixelFormatGUID formatGUID = formatDesired;\n if (SUCCEEDED(hr)) {\n hr = piBitmapFrameEncode->SetPixelFormat(&formatGUID);\n }\n if (SUCCEEDED(hr)) {\n \/\/Be sure the image format is the one requested.\n hr = IsEqualGUID(formatGUID, formatDesired) ? S_OK : E_FAIL;\n }\n\n \/\/Write the pixels into the frame.\n if (SUCCEEDED(hr)) {\n SkAutoLockPixels alp(*bitmap);\n hr = piBitmapFrameEncode->WritePixels(\n height\n , bitmap->rowBytes()\n , bitmap->rowBytes()*height\n , reinterpret_cast<BYTE*>(bitmap->getPixels()));\n }\n\n if (SUCCEEDED(hr)) {\n hr = piBitmapFrameEncode->Commit();\n }\n\n if (SUCCEEDED(hr)) {\n hr = piEncoder->Commit();\n }\n\n return SUCCEEDED(hr);\n}\n\nSkImageEncoder* SkImageEncoder::Create(Type t) {\n switch (t) {\n case kJPEG_Type:\n case kPNG_Type:\n break;\n default:\n return NULL;\n }\n return SkNEW_ARGS(SkImageEncoder_WIC, (t));\n}\n\n<|endoftext|>"} {"text":"<commit_before>#include \"vision_cpu.h\"\n\ntemplate <typename scalar_t>\nat::Tensor nms_cpu_kernel(\n const at::Tensor& dets,\n const at::Tensor& scores,\n const float iou_threshold) {\n AT_ASSERTM(!dets.options().device().is_cuda(), \"dets must be a CPU tensor\");\n AT_ASSERTM(!scores.options().device().is_cuda(), \"scores must be a CPU tensor\");\n AT_ASSERTM(\n dets.scalar_type() == scores.scalar_type(), \"dets should have the same type as scores\");\n\n if (dets.numel() == 0)\n return at::empty({0}, dets.options().dtype(at::kLong));\n\n auto x1_t = dets.select(1, 0).contiguous();\n auto y1_t = dets.select(1, 1).contiguous();\n auto x2_t = dets.select(1, 2).contiguous();\n auto y2_t = dets.select(1, 3).contiguous();\n\n at::Tensor areas_t = (x2_t - x1_t) * (y2_t - y1_t);\n\n auto order_t = std::get<1>(scores.sort(0, \/* descending=*\/true));\n\n auto ndets = dets.size(0);\n at::Tensor suppressed_t = at::zeros({ndets}, dets.options().dtype(at::kByte));\n at::Tensor keep_t = at::zeros({ndets}, dets.options().dtype(at::kLong));\n\n auto suppressed = suppressed_t.data_ptr<uint8_t>();\n auto keep = keep_t.data_ptr<int64_t>();\n auto order = order_t.data_ptr<int64_t>();\n auto x1 = x1_t.data_ptr<scalar_t>();\n auto y1 = y1_t.data_ptr<scalar_t>();\n auto x2 = x2_t.data_ptr<scalar_t>();\n auto y2 = y2_t.data_ptr<scalar_t>();\n auto areas = areas_t.data_ptr<scalar_t>();\n\n int64_t num_to_keep = 0;\n\n for (int64_t _i = 0; _i < ndets; _i++) {\n auto i = order[_i];\n if (suppressed[i] == 1)\n continue;\n keep[num_to_keep++] = i;\n auto ix1 = x1[i];\n auto iy1 = y1[i];\n auto ix2 = x2[i];\n auto iy2 = y2[i];\n auto iarea = areas[i];\n\n for (int64_t _j = _i + 1; _j < ndets; _j++) {\n auto j = order[_j];\n if (suppressed[j] == 1)\n continue;\n auto xx1 = std::max(ix1, x1[j]);\n auto yy1 = std::max(iy1, y1[j]);\n auto xx2 = std::min(ix2, x2[j]);\n auto yy2 = std::min(iy2, y2[j]);\n\n auto w = std::max(static_cast<scalar_t>(0), xx2 - xx1);\n auto h = std::max(static_cast<scalar_t>(0), yy2 - yy1);\n auto inter = w * h;\n auto ovr = inter \/ (iarea + areas[j] - inter);\n if (ovr > iou_threshold)\n suppressed[j] = 1;\n }\n }\n return keep_t.narrow(\/*dim=*\/0, \/*start=*\/0, \/*length=*\/num_to_keep);\n}\n\nat::Tensor nms_cpu(\n const at::Tensor& dets,\n const at::Tensor& scores,\n const float iou_threshold) {\n auto result = at::empty({0}, dets.options());\n\n AT_DISPATCH_FLOATING_TYPES(dets.scalar_type(), \"nms\", [&] {\n result = nms_cpu_kernel<scalar_t>(dets, scores, iou_threshold);\n });\n return result;\n}\n<commit_msg>Fix C++ lint (#2059)<commit_after>#include \"vision_cpu.h\"\n\ntemplate <typename scalar_t>\nat::Tensor nms_cpu_kernel(\n const at::Tensor& dets,\n const at::Tensor& scores,\n const float iou_threshold) {\n AT_ASSERTM(!dets.options().device().is_cuda(), \"dets must be a CPU tensor\");\n AT_ASSERTM(\n !scores.options().device().is_cuda(), \"scores must be a CPU tensor\");\n AT_ASSERTM(\n dets.scalar_type() == scores.scalar_type(),\n \"dets should have the same type as scores\");\n\n if (dets.numel() == 0)\n return at::empty({0}, dets.options().dtype(at::kLong));\n\n auto x1_t = dets.select(1, 0).contiguous();\n auto y1_t = dets.select(1, 1).contiguous();\n auto x2_t = dets.select(1, 2).contiguous();\n auto y2_t = dets.select(1, 3).contiguous();\n\n at::Tensor areas_t = (x2_t - x1_t) * (y2_t - y1_t);\n\n auto order_t = std::get<1>(scores.sort(0, \/* descending=*\/true));\n\n auto ndets = dets.size(0);\n at::Tensor suppressed_t = at::zeros({ndets}, dets.options().dtype(at::kByte));\n at::Tensor keep_t = at::zeros({ndets}, dets.options().dtype(at::kLong));\n\n auto suppressed = suppressed_t.data_ptr<uint8_t>();\n auto keep = keep_t.data_ptr<int64_t>();\n auto order = order_t.data_ptr<int64_t>();\n auto x1 = x1_t.data_ptr<scalar_t>();\n auto y1 = y1_t.data_ptr<scalar_t>();\n auto x2 = x2_t.data_ptr<scalar_t>();\n auto y2 = y2_t.data_ptr<scalar_t>();\n auto areas = areas_t.data_ptr<scalar_t>();\n\n int64_t num_to_keep = 0;\n\n for (int64_t _i = 0; _i < ndets; _i++) {\n auto i = order[_i];\n if (suppressed[i] == 1)\n continue;\n keep[num_to_keep++] = i;\n auto ix1 = x1[i];\n auto iy1 = y1[i];\n auto ix2 = x2[i];\n auto iy2 = y2[i];\n auto iarea = areas[i];\n\n for (int64_t _j = _i + 1; _j < ndets; _j++) {\n auto j = order[_j];\n if (suppressed[j] == 1)\n continue;\n auto xx1 = std::max(ix1, x1[j]);\n auto yy1 = std::max(iy1, y1[j]);\n auto xx2 = std::min(ix2, x2[j]);\n auto yy2 = std::min(iy2, y2[j]);\n\n auto w = std::max(static_cast<scalar_t>(0), xx2 - xx1);\n auto h = std::max(static_cast<scalar_t>(0), yy2 - yy1);\n auto inter = w * h;\n auto ovr = inter \/ (iarea + areas[j] - inter);\n if (ovr > iou_threshold)\n suppressed[j] = 1;\n }\n }\n return keep_t.narrow(\/*dim=*\/0, \/*start=*\/0, \/*length=*\/num_to_keep);\n}\n\nat::Tensor nms_cpu(\n const at::Tensor& dets,\n const at::Tensor& scores,\n const float iou_threshold) {\n auto result = at::empty({0}, dets.options());\n\n AT_DISPATCH_FLOATING_TYPES(dets.scalar_type(), \"nms\", [&] {\n result = nms_cpu_kernel<scalar_t>(dets, scores, iou_threshold);\n });\n return result;\n}\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\tutils.c\n *\n * \\brief\tcommon tool\/function utilization\n *\n * \\date\t03\/10\/2009 Created\n *\n *************************************************************************************\n *\/\n#include \"utils.h\"\n#include \"crt_util_safe_x.h\"\t\/\/ Safe CRT routines like utils for cross platforms\n#include \"codec_app_def.h\"\nfloat WelsCalcPsnr (const void* kpTarPic,\n const int32_t kiTarStride,\n const void* kpRefPic,\n const int32_t kiRefStride,\n const int32_t kiWidth,\n const int32_t kiHeight);\n\n\nvoid WelsLog (SLogContext* logCtx, int32_t iLevel, const char* kpFmt, ...) {\n va_list vl;\n char pTraceTag[MAX_LOG_SIZE];\n switch (iLevel) {\n case WELS_LOG_ERROR:\n WelsSnprintf (pTraceTag, MAX_LOG_SIZE, \"[OpenH264] Error:\");\n break;\n case WELS_LOG_WARNING:\n WelsSnprintf (pTraceTag, MAX_LOG_SIZE, \"[OpenH264] Warning:\");\n break;\n case WELS_LOG_INFO:\n WelsSnprintf (pTraceTag, MAX_LOG_SIZE, \"[OpenH264] Info:\");\n break;\n case WELS_LOG_DEBUG:\n WelsSnprintf (pTraceTag, MAX_LOG_SIZE, \"[OpenH264] Debug:\");\n break;\n default:\n WelsSnprintf (pTraceTag, MAX_LOG_SIZE, \"[OpenH264] Detail:\");\n break;\n }\n va_start (vl, pTraceTag);\n logCtx->pfLog (logCtx->pLogCtx, iLevel, pTraceTag, vl);\n va_end (vl);\n\n va_start (vl, kpFmt);\n logCtx->pfLog (logCtx->pLogCtx, iLevel, kpFmt, vl);\n va_end (vl);\n}\n\n#ifndef CALC_PSNR\n#define CONST_FACTOR_PSNR\t(10.0 \/ log(10.0))\t\/\/ for good computation\n#define CALC_PSNR(w, h, s)\t((float)(CONST_FACTOR_PSNR * log( 65025.0 * w * h \/ iSqe )))\n#endif\/\/CALC_PSNR\n\n\/*\n *\tPSNR calculation routines\n *\/\n\/*!\n *************************************************************************************\n * \\brief\tPSNR calculation utilization in Wels\n *\n * \\param\tpTarPic\t\ttarget picture to be calculated in Picture pData format\n * \\param\tiTarStride\tstride of target picture pData pBuffer\n * \\param \tpRefPic\t\tbase referencing picture samples\n * \\param\tiRefStride\tstride of reference picture pData pBuffer\n * \\param\tiWidth\t\tpicture iWidth in pixel\n * \\param\tiHeight\t\tpicture iHeight in pixel\n *\n * \\return\tactual PSNR result;\n *\n * \\note\tN\/A\n *************************************************************************************\n *\/\nfloat WelsCalcPsnr (const void* kpTarPic,\n const int32_t kiTarStride,\n const void* kpRefPic,\n const int32_t kiRefStride,\n const int32_t kiWidth,\n const int32_t kiHeight) {\n int64_t\tiSqe = 0;\n int32_t x, y;\n uint8_t* pTar = (uint8_t*)kpTarPic;\n uint8_t* pRef = (uint8_t*)kpRefPic;\n\n if (NULL == pTar || NULL == pRef)\n return (-1.0f);\n\n for (y = 0; y < kiHeight; ++ y) {\t\/\/ OPTable !!\n for (x = 0; x < kiWidth; ++ x) {\n const int32_t kiT = pTar[y * kiTarStride + x] - pRef[y * kiRefStride + x];\n iSqe\t+= kiT * kiT;\n }\n }\n if (0 == iSqe) {\n return (99.99f);\n }\n return CALC_PSNR (kiWidth, kiHeight, iSqe);\n}\n\n<commit_msg>modify trace output<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\tutils.c\n *\n * \\brief\tcommon tool\/function utilization\n *\n * \\date\t03\/10\/2009 Created\n *\n *************************************************************************************\n *\/\n#include \"utils.h\"\n#include \"crt_util_safe_x.h\"\t\/\/ Safe CRT routines like utils for cross platforms\n#include \"codec_app_def.h\"\nfloat WelsCalcPsnr (const void* kpTarPic,\n const int32_t kiTarStride,\n const void* kpRefPic,\n const int32_t kiRefStride,\n const int32_t kiWidth,\n const int32_t kiHeight);\n\n\nvoid WelsLog (SLogContext* logCtx, int32_t iLevel, const char* kpFmt, ...) {\n va_list vl;\n char pTraceTag[MAX_LOG_SIZE];\n switch (iLevel) {\n case WELS_LOG_ERROR:\n WelsSnprintf (pTraceTag, MAX_LOG_SIZE, \"[OpenH264] Error:\");\n break;\n case WELS_LOG_WARNING:\n WelsSnprintf (pTraceTag, MAX_LOG_SIZE, \"[OpenH264] Warning:\");\n break;\n case WELS_LOG_INFO:\n WelsSnprintf (pTraceTag, MAX_LOG_SIZE, \"[OpenH264] Info:\");\n break;\n case WELS_LOG_DEBUG:\n WelsSnprintf (pTraceTag, MAX_LOG_SIZE, \"[OpenH264] Debug:\");\n break;\n default:\n WelsSnprintf (pTraceTag, MAX_LOG_SIZE, \"[OpenH264] Detail:\");\n break;\n }\n WelsStrcat(pTraceTag,MAX_LOG_SIZE,kpFmt);\n va_start (vl, kpFmt);\n logCtx->pfLog (logCtx->pLogCtx, iLevel, pTraceTag, vl);\n va_end (vl);\n}\n\n#ifndef CALC_PSNR\n#define CONST_FACTOR_PSNR\t(10.0 \/ log(10.0))\t\/\/ for good computation\n#define CALC_PSNR(w, h, s)\t((float)(CONST_FACTOR_PSNR * log( 65025.0 * w * h \/ iSqe )))\n#endif\/\/CALC_PSNR\n\n\/*\n *\tPSNR calculation routines\n *\/\n\/*!\n *************************************************************************************\n * \\brief\tPSNR calculation utilization in Wels\n *\n * \\param\tpTarPic\t\ttarget picture to be calculated in Picture pData format\n * \\param\tiTarStride\tstride of target picture pData pBuffer\n * \\param \tpRefPic\t\tbase referencing picture samples\n * \\param\tiRefStride\tstride of reference picture pData pBuffer\n * \\param\tiWidth\t\tpicture iWidth in pixel\n * \\param\tiHeight\t\tpicture iHeight in pixel\n *\n * \\return\tactual PSNR result;\n *\n * \\note\tN\/A\n *************************************************************************************\n *\/\nfloat WelsCalcPsnr (const void* kpTarPic,\n const int32_t kiTarStride,\n const void* kpRefPic,\n const int32_t kiRefStride,\n const int32_t kiWidth,\n const int32_t kiHeight) {\n int64_t\tiSqe = 0;\n int32_t x, y;\n uint8_t* pTar = (uint8_t*)kpTarPic;\n uint8_t* pRef = (uint8_t*)kpRefPic;\n\n if (NULL == pTar || NULL == pRef)\n return (-1.0f);\n\n for (y = 0; y < kiHeight; ++ y) {\t\/\/ OPTable !!\n for (x = 0; x < kiWidth; ++ x) {\n const int32_t kiT = pTar[y * kiTarStride + x] - pRef[y * kiRefStride + x];\n iSqe\t+= kiT * kiT;\n }\n }\n if (0 == iSqe) {\n return (99.99f);\n }\n return CALC_PSNR (kiWidth, kiHeight, iSqe);\n}\n\n<|endoftext|>"} {"text":"<commit_before>#include \"layouter.h\"\n\n#include \"utf-8.h\"\n\n#include <harfbuzz\/hb.h>\n#include <harfbuzz\/hb-ft.h>\n\n#include <fribidi\/fribidi.h>\n\n#include <linebreak.h>\n\n#include <vector>\n#include <string>\n#include <memory>\n#include <algorithm>\n\ntypedef struct\n{\n std::vector<textLayout_c::commandData> run;\n int dx, dy;\n FriBidiLevel embeddingLevel;\n char linebreak;\n std::shared_ptr<fontFace_c> font;\n} runInfo;\n\n\/\/ TODO create a sharing structure, where we only\n\/\/ define structures for each configuration once\n\/\/ and link to it\n\/\/ but for now it is good as it is\ntypedef struct\n{\n uint8_t r, g, b;\n std::shared_ptr<fontFace_c> font;\n std::string lang;\n} codepointAttributes;\n\nFriBidiLevel getBidiEmbeddingLevels(const std::u32string & txt32, std::vector<FriBidiLevel> & embedding_levels)\n{\n std::vector<FriBidiCharType> bidiTypes(txt32.length());\n fribidi_get_bidi_types((uint32_t*)txt32.c_str(), txt32.length(), bidiTypes.data());\n FriBidiParType base_dir = FRIBIDI_TYPE_LTR_VAL; \/\/ TODO depends on main script of text\n embedding_levels.resize(txt32.length());\n FriBidiLevel max_level = fribidi_get_par_embedding_levels(bidiTypes.data(), txt32.length(),\n &base_dir, embedding_levels.data());\n\n return max_level;\n}\n\ntextLayout_c layoutParagraph(const std::u32string & txt32, const std::vector<codepointAttributes> & attr,\n const shape_c & shape, const std::string & align)\n{\n \/\/ calculate embedding types for the text\n std::vector<FriBidiLevel> embedding_levels;\n FriBidiLevel max_level = getBidiEmbeddingLevels(txt32, embedding_levels);\n\n \/\/ calculate the possible linebreak positions\n std::vector<char> linebreaks(txt32.length());\n set_linebreaks_utf32((utf32_t*)txt32.c_str(), txt32.length(), \"\", linebreaks.data());\n\n \/\/ Get our harfbuzz font structs, TODO we need to do that for all the fonts\n std::map<const std::shared_ptr<fontFace_c>, hb_font_t *> hb_ft_fonts;\n\n for (const auto & a : attr)\n {\n if (hb_ft_fonts.find(a.font) == hb_ft_fonts.end())\n {\n hb_ft_fonts[a.font] = hb_ft_font_create(a.font->getFace(), NULL);\n }\n }\n\n \/\/ Create a buffer for harfbuzz to use\n hb_buffer_t *buf = hb_buffer_create();\n\n std::string lan = attr[0].lang.substr(0, 2);\n std::string s = attr[0].lang.substr(3, 4);\n\n hb_script_t scr = hb_script_from_iso15924_tag(HB_TAG(s[0], s[1], s[2], s[3]));\n hb_buffer_set_script(buf, scr);\n \/\/ TODO must come either from text or from rules\n hb_buffer_set_language(buf, hb_language_from_string(lan.c_str(), lan.length()));\n\n size_t runstart = 0;\n\n std::vector<runInfo> runs;\n\n while (runstart < txt32.length())\n {\n size_t spos = runstart+1;\n \/\/ find end of current run\n while ( (spos < txt32.length())\n && (embedding_levels[runstart] == embedding_levels[spos])\n && (attr[runstart].font == attr[spos].font)\n && ( (linebreaks[spos-1] == LINEBREAK_NOBREAK)\n || (linebreaks[spos-1] == LINEBREAK_INSIDEACHAR)\n )\n )\n {\n spos++;\n }\n\n hb_buffer_add_utf32(buf, ((uint32_t*)txt32.c_str())+runstart, spos-runstart, 0, spos-runstart);\n\n if (embedding_levels[runstart] % 2 == 0)\n {\n hb_buffer_set_direction(buf, HB_DIRECTION_LTR);\n }\n else\n {\n hb_buffer_set_direction(buf, HB_DIRECTION_RTL);\n }\n\n hb_shape(hb_ft_fonts[attr[runstart].font], buf, NULL, 0);\n\n unsigned int glyph_count;\n hb_glyph_info_t *glyph_info = hb_buffer_get_glyph_infos(buf, &glyph_count);\n hb_glyph_position_t *glyph_pos = hb_buffer_get_glyph_positions(buf, &glyph_count);\n\n runInfo run;\n\n run.dx = run.dy = 0;\n run.embeddingLevel = embedding_levels[runstart];\n run.linebreak = linebreaks[spos-1];\n run.font = attr[runstart].font;\n\n for (size_t j=0; j < glyph_count; ++j)\n {\n textLayout_c::commandData g;\n\n g.glyphIndex = glyph_info[j].codepoint;\n g.font = attr[runstart].font;\n \/\/ TODO the other parameters\n\n g.x = run.dx + (glyph_pos[j].x_offset\/64);\n g.y = run.dy - (glyph_pos[j].y_offset\/64);\n\n run.dx += glyph_pos[j].x_advance\/64;\n run.dy -= glyph_pos[j].y_advance\/64;\n\n g.r = attr[glyph_info[j].cluster + runstart].r;\n g.g = attr[glyph_info[j].cluster + runstart].g;\n g.b = attr[glyph_info[j].cluster + runstart].b;\n\n g.command = textLayout_c::commandData::CMD_GLYPH;\n\n run.run.push_back(g);\n }\n\n runs.push_back(run);\n runstart = spos;\n\n hb_buffer_reset(buf);\n }\n\n hb_buffer_destroy(buf);\n\n for (auto & a : hb_ft_fonts)\n hb_font_destroy(a.second);\n\n std::vector<size_t> runorder(runs.size());\n int n(0);\n std::generate(runorder.begin(), runorder.end(), [&]{ return n++; });\n\n \/\/ layout a run\n \/\/ TODO take care of different font sizes of the different runs\n runstart = 0;\n int32_t ypos = 0;\n textLayout_c l;\n\n while (runstart < runs.size())\n {\n int32_t curAscend = runs[runstart].font->getAscender()\/64;\n int32_t curDescend = runs[runstart].font->getDescender()\/64;\n uint32_t curWidth = runs[runstart].dx;\n size_t spos = runstart + 1;\n\n while (spos < runs.size())\n {\n \/\/ check, if we can add another span\n int32_t newAscend = std::max(curAscend, runs[spos].font->getAscender()\/64);\n int32_t newDescend = std::min(curDescend, runs[spos].font->getDescender()\/64);\n uint32_t newWidth = curWidth + runs[spos].dx;\n\n if (shape.getLeft(ypos, ypos+newAscend-newDescend)+newWidth >\n shape.getRight(ypos, ypos+newAscend-newDescend))\n {\n \/\/ next run would overrun\n break;\n }\n\n \/\/ additional run fits\n curAscend = newAscend;\n curDescend = newDescend;\n curWidth = newWidth;\n spos++;\n }\n\n \/\/ reorder runs for current line\n for (int i = max_level-1; i >= 0; i--)\n {\n \/\/ find starts of regions to reverse\n for (size_t j = runstart; j < spos; j++)\n {\n if (runs[runorder[j]].embeddingLevel > i)\n {\n \/\/ find the end of the current regions\n size_t k = j+1;\n while (k < spos && runs[runorder[k]].embeddingLevel > i)\n {\n k++;\n }\n\n std::reverse(runorder.begin()+j, runorder.begin()+k);\n j = k;\n }\n }\n }\n\n int32_t spaceLeft = shape.getRight(ypos, ypos+curAscend-curDescend) -\n shape.getLeft(ypos, ypos+curAscend-curDescend);\n spaceLeft -= curWidth;\n\n int32_t xpos;\n double spaceadder = 0;\n\n if (align == \"left\")\n {\n xpos = shape.getLeft(ypos, ypos+curAscend-curDescend);\n }\n else if (align == \"right\")\n {\n xpos = shape.getLeft(ypos, ypos+curAscend-curDescend) + spaceLeft;\n }\n else if (align == \"center\")\n {\n xpos = shape.getLeft(ypos, ypos+curAscend-curDescend) + spaceLeft\/2;\n }\n else if (align == \"justify\")\n {\n xpos = shape.getLeft(ypos, ypos+curAscend-curDescend);\n \/\/ don't justify last paragraph\n if (spos-runstart > 1 && spos < runs.size())\n spaceadder = 1.0 * spaceLeft \/ (spos-runstart - 1);\n }\n\n ypos += curAscend;\n\n for (size_t i = runstart; i < spos; i++)\n {\n l.addCommandVector(runs[runorder[i]].run, xpos+spaceadder*(i-runstart), ypos);\n xpos += runs[runorder[i]].dx;\n }\n\n ypos -= curDescend;\n runstart = spos;\n }\n\n \/\/ TODO proper font handling for multiple fonts in a line\n l.setHeight(ypos);\n\n return l;\n}\n\nvoid layoutXML_text(const pugi::xml_node & xml, const textStyleSheet_c & rules, std::u32string & txt,\n std::vector<codepointAttributes> & attr)\n{\n for (const auto & i : xml)\n {\n if (i.type() == pugi::node_pcdata)\n {\n txt += u8_convertToU32(i.value());\n\n codepointAttributes a;\n\n evalColor(rules.getValue(xml, \"color\"), a.r, a.g, a.b);\n std::string fontFamily = rules.getValue(xml, \"font-family\");\n std::string fontStyle = rules.getValue(xml, \"font-style\");\n std::string fontVariant = rules.getValue(xml, \"font-variant\");\n std::string fontWeight = rules.getValue(xml, \"font-weight\");\n double fontSize = evalSize(rules.getValue(xml, \"font-size\"));\n\n a.font = rules.findFamily(fontFamily)->getFont(64*fontSize, fontStyle, fontVariant, fontWeight);\n a.lang = \"en-eng\";\n\n while (attr.size() < txt.length())\n attr.push_back(a);\n }\n else if (i.type() == pugi::node_element && std::string(\"i\") == i.name())\n {\n layoutXML_text(i, rules, txt, attr);\n }\n else if (i.type() == pugi::node_element && std::string(\"div\") == i.name())\n {\n layoutXML_text(i, rules, txt, attr);\n }\n }\n}\n\n\/\/ this whole stuff is a recursive descending parser of the XHTML stuff\ntextLayout_c layoutXML_P(const pugi::xml_node & xml, const textStyleSheet_c & rules, const shape_c & shape)\n{\n std::u32string txt;\n std::vector<codepointAttributes> attr;\n\n layoutXML_text(xml, rules, txt, attr);\n\n return layoutParagraph(txt, attr, shape, rules.getValue(xml, \"text-align\"));\n}\n\ntextLayout_c layoutXML_BODY(const pugi::xml_node & txt, const textStyleSheet_c & rules, const shape_c & shape)\n{\n textLayout_c l;\n\n for (const auto & i : txt)\n {\n if ( (i.type() == pugi::node_element)\n && ( (std::string(\"p\") == i.name())\n || (std::string(\"h1\") == i.name())\n || (std::string(\"h2\") == i.name())\n || (std::string(\"h3\") == i.name())\n || (std::string(\"h4\") == i.name())\n || (std::string(\"h5\") == i.name())\n || (std::string(\"h6\") == i.name())\n )\n )\n {\n l.append(layoutXML_P(i, rules, shape), 0, l.getHeight());\n }\n else if (i.type() == pugi::node_element && std::string(\"table\") == i.name())\n {\n }\n else\n {\n \/\/ TODO exception nothing else supported\n }\n }\n\n return l;\n}\n\ntextLayout_c layoutXML_HTML(const pugi::xml_node & txt, const textStyleSheet_c & rules, const shape_c & shape)\n{\n textLayout_c l;\n\n bool headfound = false;\n bool bodyfound = false;\n\n for (const auto & i : txt)\n {\n if (std::string(\"head\") == i.name() && !headfound)\n {\n headfound = true;\n }\n else if (std::string(\"body\") == i.name() && !bodyfound)\n {\n bodyfound = true;\n l = layoutXML_BODY(i, rules, shape);\n }\n else\n {\n \/\/ nothing else permitted -> exception TODO\n }\n }\n\n return l;\n}\n\ntextLayout_c layoutXML(const pugi::xml_document & txt, const textStyleSheet_c & rules, const shape_c & shape)\n{\n textLayout_c l;\n\n \/\/ we must have a HTML root node\n for (const auto & i : txt)\n {\n if (std::string(\"html\") == i.name())\n {\n l = layoutXML_HTML(i, rules, shape);\n }\n else\n {\n \/\/ nothing else permitted -> exception TODO\n }\n }\n\n return l;\n}\n\ntextLayout_c layoutXHTML(const std::string & txt, const textStyleSheet_c & rules, const shape_c & shape)\n{\n pugi::xml_document doc;\n \/\/ TODO handle parser errors\n doc.load_buffer(txt.c_str(), txt.length());\n return layoutXML(doc, rules, shape);\n}\n\ntextLayout_c layoutRaw(const std::string & txt, const std::shared_ptr<fontFace_c> font, const shape_c & shape, const std::string & language)\n{\n \/\/ when we layout raw text we\n \/\/ only have to convert the text to utf-32\n \/\/ and assign the given font and language to all the codepoints of that text\n\n std::u32string txt32 = u8_convertToU32(txt);\n std::vector<codepointAttributes> attr(txt32.size());\n\n for (auto & i : attr)\n {\n i.r = i.g = i.b = 255;\n i.font = font;\n i.lang = language;\n }\n\n return layoutParagraph(txt32, attr, shape, \"left\");\n}\n<commit_msg>add some comments TODO<commit_after>#include \"layouter.h\"\n\n#include \"utf-8.h\"\n\n#include <harfbuzz\/hb.h>\n#include <harfbuzz\/hb-ft.h>\n\n#include <fribidi\/fribidi.h>\n\n#include <linebreak.h>\n\n#include <vector>\n#include <string>\n#include <memory>\n#include <algorithm>\n\ntypedef struct\n{\n std::vector<textLayout_c::commandData> run;\n int dx, dy;\n FriBidiLevel embeddingLevel;\n char linebreak;\n std::shared_ptr<fontFace_c> font;\n} runInfo;\n\n\/\/ TODO create a sharing structure, where we only\n\/\/ define structures for each configuration once\n\/\/ and link to it\n\/\/ but for now it is good as it is\ntypedef struct\n{\n uint8_t r, g, b;\n std::shared_ptr<fontFace_c> font;\n std::string lang;\n} codepointAttributes;\n\nFriBidiLevel getBidiEmbeddingLevels(const std::u32string & txt32, std::vector<FriBidiLevel> & embedding_levels)\n{\n std::vector<FriBidiCharType> bidiTypes(txt32.length());\n fribidi_get_bidi_types((uint32_t*)txt32.c_str(), txt32.length(), bidiTypes.data());\n FriBidiParType base_dir = FRIBIDI_TYPE_LTR_VAL; \/\/ TODO depends on main script of text\n embedding_levels.resize(txt32.length());\n FriBidiLevel max_level = fribidi_get_par_embedding_levels(bidiTypes.data(), txt32.length(),\n &base_dir, embedding_levels.data());\n\n return max_level;\n}\n\ntextLayout_c layoutParagraph(const std::u32string & txt32, const std::vector<codepointAttributes> & attr,\n const shape_c & shape, const std::string & align)\n{\n \/\/ calculate embedding types for the text\n std::vector<FriBidiLevel> embedding_levels;\n FriBidiLevel max_level = getBidiEmbeddingLevels(txt32, embedding_levels);\n\n \/\/ calculate the possible linebreak positions\n std::vector<char> linebreaks(txt32.length());\n set_linebreaks_utf32((utf32_t*)txt32.c_str(), txt32.length(), \"\", linebreaks.data());\n\n \/\/ Get our harfbuzz font structs, TODO we need to do that for all the fonts\n std::map<const std::shared_ptr<fontFace_c>, hb_font_t *> hb_ft_fonts;\n\n for (const auto & a : attr)\n {\n if (hb_ft_fonts.find(a.font) == hb_ft_fonts.end())\n {\n hb_ft_fonts[a.font] = hb_ft_font_create(a.font->getFace(), NULL);\n }\n }\n\n \/\/ Create a buffer for harfbuzz to use\n hb_buffer_t *buf = hb_buffer_create();\n\n std::string lan = attr[0].lang.substr(0, 2);\n std::string s = attr[0].lang.substr(3, 4);\n\n hb_script_t scr = hb_script_from_iso15924_tag(HB_TAG(s[0], s[1], s[2], s[3]));\n hb_buffer_set_script(buf, scr);\n \/\/ TODO must come either from text or from rules\n hb_buffer_set_language(buf, hb_language_from_string(lan.c_str(), lan.length()));\n\n size_t runstart = 0;\n\n std::vector<runInfo> runs;\n\n while (runstart < txt32.length())\n {\n size_t spos = runstart+1;\n \/\/ find end of current run\n while ( (spos < txt32.length())\n && (embedding_levels[runstart] == embedding_levels[spos])\n && (attr[runstart].font == attr[spos].font)\n && ( (linebreaks[spos-1] == LINEBREAK_NOBREAK)\n || (linebreaks[spos-1] == LINEBREAK_INSIDEACHAR)\n )\n )\n {\n spos++;\n }\n\n hb_buffer_add_utf32(buf, ((uint32_t*)txt32.c_str())+runstart, spos-runstart, 0, spos-runstart);\n\n if (embedding_levels[runstart] % 2 == 0)\n {\n hb_buffer_set_direction(buf, HB_DIRECTION_LTR);\n }\n else\n {\n hb_buffer_set_direction(buf, HB_DIRECTION_RTL);\n }\n\n hb_shape(hb_ft_fonts[attr[runstart].font], buf, NULL, 0);\n\n unsigned int glyph_count;\n hb_glyph_info_t *glyph_info = hb_buffer_get_glyph_infos(buf, &glyph_count);\n hb_glyph_position_t *glyph_pos = hb_buffer_get_glyph_positions(buf, &glyph_count);\n\n runInfo run;\n\n run.dx = run.dy = 0;\n run.embeddingLevel = embedding_levels[runstart];\n run.linebreak = linebreaks[spos-1];\n run.font = attr[runstart].font;\n\n for (size_t j=0; j < glyph_count; ++j)\n {\n textLayout_c::commandData g;\n\n g.glyphIndex = glyph_info[j].codepoint;\n g.font = attr[runstart].font;\n \/\/ TODO the other parameters\n\n g.x = run.dx + (glyph_pos[j].x_offset\/64);\n g.y = run.dy - (glyph_pos[j].y_offset\/64);\n\n run.dx += glyph_pos[j].x_advance\/64;\n run.dy -= glyph_pos[j].y_advance\/64;\n\n g.r = attr[glyph_info[j].cluster + runstart].r;\n g.g = attr[glyph_info[j].cluster + runstart].g;\n g.b = attr[glyph_info[j].cluster + runstart].b;\n\n g.command = textLayout_c::commandData::CMD_GLYPH;\n\n run.run.push_back(g);\n }\n\n runs.push_back(run);\n runstart = spos;\n\n hb_buffer_reset(buf);\n }\n\n hb_buffer_destroy(buf);\n\n for (auto & a : hb_ft_fonts)\n hb_font_destroy(a.second);\n\n std::vector<size_t> runorder(runs.size());\n int n(0);\n std::generate(runorder.begin(), runorder.end(), [&]{ return n++; });\n\n \/\/ layout a run\n \/\/ TODO take care of different font sizes of the different runs\n runstart = 0;\n int32_t ypos = 0;\n textLayout_c l;\n\n while (runstart < runs.size())\n {\n int32_t curAscend = runs[runstart].font->getAscender()\/64;\n int32_t curDescend = runs[runstart].font->getDescender()\/64;\n uint32_t curWidth = runs[runstart].dx;\n size_t spos = runstart + 1;\n\n while (spos < runs.size())\n {\n \/\/ check, if we can add another run\n \/\/ TODO keep non break runs in mind\n \/\/ TODO take properly care of spaces at the end of lines (they must be left out)\n int32_t newAscend = std::max(curAscend, runs[spos].font->getAscender()\/64);\n int32_t newDescend = std::min(curDescend, runs[spos].font->getDescender()\/64);\n uint32_t newWidth = curWidth + runs[spos].dx;\n\n if (shape.getLeft(ypos, ypos+newAscend-newDescend)+newWidth >\n shape.getRight(ypos, ypos+newAscend-newDescend))\n {\n \/\/ next run would overrun\n break;\n }\n\n \/\/ additional run fits\n curAscend = newAscend;\n curDescend = newDescend;\n curWidth = newWidth;\n spos++;\n }\n\n \/\/ reorder runs for current line\n for (int i = max_level-1; i >= 0; i--)\n {\n \/\/ find starts of regions to reverse\n for (size_t j = runstart; j < spos; j++)\n {\n if (runs[runorder[j]].embeddingLevel > i)\n {\n \/\/ find the end of the current regions\n size_t k = j+1;\n while (k < spos && runs[runorder[k]].embeddingLevel > i)\n {\n k++;\n }\n\n std::reverse(runorder.begin()+j, runorder.begin()+k);\n j = k;\n }\n }\n }\n\n int32_t spaceLeft = shape.getRight(ypos, ypos+curAscend-curDescend) -\n shape.getLeft(ypos, ypos+curAscend-curDescend);\n spaceLeft -= curWidth;\n\n int32_t xpos;\n double spaceadder = 0;\n\n if (align == \"left\")\n {\n xpos = shape.getLeft(ypos, ypos+curAscend-curDescend);\n }\n else if (align == \"right\")\n {\n xpos = shape.getLeft(ypos, ypos+curAscend-curDescend) + spaceLeft;\n }\n else if (align == \"center\")\n {\n xpos = shape.getLeft(ypos, ypos+curAscend-curDescend) + spaceLeft\/2;\n }\n else if (align == \"justify\")\n {\n xpos = shape.getLeft(ypos, ypos+curAscend-curDescend);\n \/\/ don't justify last paragraph\n if (spos-runstart > 1 && spos < runs.size())\n spaceadder = 1.0 * spaceLeft \/ (spos-runstart - 1);\n }\n\n ypos += curAscend;\n\n for (size_t i = runstart; i < spos; i++)\n {\n l.addCommandVector(runs[runorder[i]].run, xpos+spaceadder*(i-runstart), ypos);\n xpos += runs[runorder[i]].dx;\n }\n\n ypos -= curDescend;\n runstart = spos;\n }\n\n \/\/ TODO proper font handling for multiple fonts in a line\n l.setHeight(ypos);\n\n return l;\n}\n\nvoid layoutXML_text(const pugi::xml_node & xml, const textStyleSheet_c & rules, std::u32string & txt,\n std::vector<codepointAttributes> & attr)\n{\n for (const auto & i : xml)\n {\n if (i.type() == pugi::node_pcdata)\n {\n txt += u8_convertToU32(i.value());\n\n codepointAttributes a;\n\n evalColor(rules.getValue(xml, \"color\"), a.r, a.g, a.b);\n std::string fontFamily = rules.getValue(xml, \"font-family\");\n std::string fontStyle = rules.getValue(xml, \"font-style\");\n std::string fontVariant = rules.getValue(xml, \"font-variant\");\n std::string fontWeight = rules.getValue(xml, \"font-weight\");\n double fontSize = evalSize(rules.getValue(xml, \"font-size\"));\n\n a.font = rules.findFamily(fontFamily)->getFont(64*fontSize, fontStyle, fontVariant, fontWeight);\n a.lang = \"en-eng\";\n\n while (attr.size() < txt.length())\n attr.push_back(a);\n }\n else if (i.type() == pugi::node_element && std::string(\"i\") == i.name())\n {\n layoutXML_text(i, rules, txt, attr);\n }\n else if (i.type() == pugi::node_element && std::string(\"div\") == i.name())\n {\n layoutXML_text(i, rules, txt, attr);\n }\n }\n}\n\n\/\/ this whole stuff is a recursive descending parser of the XHTML stuff\ntextLayout_c layoutXML_P(const pugi::xml_node & xml, const textStyleSheet_c & rules, const shape_c & shape)\n{\n std::u32string txt;\n std::vector<codepointAttributes> attr;\n\n layoutXML_text(xml, rules, txt, attr);\n\n return layoutParagraph(txt, attr, shape, rules.getValue(xml, \"text-align\"));\n}\n\ntextLayout_c layoutXML_BODY(const pugi::xml_node & txt, const textStyleSheet_c & rules, const shape_c & shape)\n{\n textLayout_c l;\n\n for (const auto & i : txt)\n {\n if ( (i.type() == pugi::node_element)\n && ( (std::string(\"p\") == i.name())\n || (std::string(\"h1\") == i.name())\n || (std::string(\"h2\") == i.name())\n || (std::string(\"h3\") == i.name())\n || (std::string(\"h4\") == i.name())\n || (std::string(\"h5\") == i.name())\n || (std::string(\"h6\") == i.name())\n )\n )\n {\n \/\/ TODO rahmen und anderes beachten\n l.append(layoutXML_P(i, rules, shape), 0, l.getHeight());\n }\n else if (i.type() == pugi::node_element && std::string(\"table\") == i.name())\n {\n }\n else\n {\n \/\/ TODO exception nothing else supported\n }\n }\n\n return l;\n}\n\ntextLayout_c layoutXML_HTML(const pugi::xml_node & txt, const textStyleSheet_c & rules, const shape_c & shape)\n{\n textLayout_c l;\n\n bool headfound = false;\n bool bodyfound = false;\n\n for (const auto & i : txt)\n {\n if (std::string(\"head\") == i.name() && !headfound)\n {\n headfound = true;\n }\n else if (std::string(\"body\") == i.name() && !bodyfound)\n {\n bodyfound = true;\n l = layoutXML_BODY(i, rules, shape);\n }\n else\n {\n \/\/ nothing else permitted -> exception TODO\n }\n }\n\n return l;\n}\n\ntextLayout_c layoutXML(const pugi::xml_document & txt, const textStyleSheet_c & rules, const shape_c & shape)\n{\n textLayout_c l;\n\n \/\/ we must have a HTML root node\n for (const auto & i : txt)\n {\n if (std::string(\"html\") == i.name())\n {\n l = layoutXML_HTML(i, rules, shape);\n }\n else\n {\n \/\/ nothing else permitted -> exception TODO\n }\n }\n\n return l;\n}\n\ntextLayout_c layoutXHTML(const std::string & txt, const textStyleSheet_c & rules, const shape_c & shape)\n{\n pugi::xml_document doc;\n \/\/ TODO preprocess to get rid of linebreaks and multiple spaces\n\n\n \/\/ TODO handle parser errors\n doc.load_buffer(txt.c_str(), txt.length());\n return layoutXML(doc, rules, shape);\n}\n\ntextLayout_c layoutRaw(const std::string & txt, const std::shared_ptr<fontFace_c> font, const shape_c & shape, const std::string & language)\n{\n \/\/ when we layout raw text we\n \/\/ only have to convert the text to utf-32\n \/\/ and assign the given font and language to all the codepoints of that text\n\n std::u32string txt32 = u8_convertToU32(txt);\n std::vector<codepointAttributes> attr(txt32.size());\n\n for (auto & i : attr)\n {\n i.r = i.g = i.b = 255;\n i.font = font;\n i.lang = language;\n }\n\n return layoutParagraph(txt32, attr, shape, \"left\");\n}\n<|endoftext|>"} {"text":"<commit_before>\/*************************************************************************\n *\n * $RCSfile: ContextHelper.cxx,v $\n *\n * $Revision: 1.1.1.1 $\n *\n * last change: $Author: bm $ $Date: 2003-10-06 09:58:32 $\n *\n * The Contents of this file are made available subject to the terms of\n * either of the following licenses\n *\n * - GNU Lesser General Public License Version 2.1\n * - Sun Industry Standards Source License Version 1.1\n *\n * Sun Microsystems Inc., October, 2000\n *\n * GNU Lesser General Public License Version 2.1\n * =============================================\n * Copyright 2000 by Sun Microsystems, Inc.\n * 901 San Antonio Road, Palo Alto, CA 94303, USA\n *\n * This library is free software; you can redistribute it and\/or\n * modify it under the terms of the GNU Lesser General Public\n * License version 2.1, as published by the Free Software Foundation.\n *\n * This library is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU\n * Lesser General Public License for more details.\n *\n * You should have received a copy of the GNU Lesser General Public\n * License along with this library; if not, write to the Free Software\n * Foundation, Inc., 59 Temple Place, Suite 330, Boston,\n * MA 02111-1307 USA\n *\n *\n * Sun Industry Standards Source License Version 1.1\n * =================================================\n * The contents of this file are subject to the Sun Industry Standards\n * Source License Version 1.1 (the \"License\"); You may not use this file\n * except in compliance with the License. You may obtain a copy of the\n * License at http:\/\/www.openoffice.org\/license.html.\n *\n * Software provided under this License is provided on an \"AS IS\" basis,\n * WITHOUT WARRANTY OF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING,\n * WITHOUT LIMITATION, WARRANTIES THAT THE SOFTWARE IS FREE OF DEFECTS,\n * MERCHANTABLE, FIT FOR A PARTICULAR PURPOSE, OR NON-INFRINGING.\n * See the License for the specific provisions governing your rights and\n * obligations concerning the Software.\n *\n * The Initial Developer of the Original Code is: Sun Microsystems, Inc.\n *\n * Copyright: 2003 by Sun Microsystems, Inc.\n *\n * All Rights Reserved.\n *\n * Contributor(s): _______________________________________\n *\n *\n ************************************************************************\/\n#include \"ContextHelper.hxx\"\n#include <cppuhelper\/component_context.hxx>\n\n#include <vector>\n\nusing namespace ::com::sun::star;\n\nnamespace chart\n{\n\nnamespace ContextHelper\n{\n\nuno::Reference< uno::XComponentContext >\n createContext(\n const tContextEntryMapType & rMap,\n const uno::Reference< uno::XComponentContext > & rDelegateContext )\n{\n ::std::vector< ::cppu::ContextEntry_Init > aVec( rMap.size());\n for( tContextEntryMapType::const_iterator aIt = rMap.begin();\n aIt != rMap.end();\n ++aIt )\n {\n aVec.push_back( ::cppu::ContextEntry_Init( (*aIt).first, (*aIt).second) );\n }\n\n return ::cppu::createComponentContext( & aVec[0], aVec.size(), rDelegateContext );\n}\n\n} \/\/ namespace ContextHelper\n\n} \/\/ namespace chart\n<commit_msg>INTEGRATION: CWS ooo19126 (1.1.1.1.110); FILE MERGED 2005\/09\/05 18:43:29 rt 1.1.1.1.110.1: #i54170# Change license header: remove SISSL<commit_after>\/*************************************************************************\n *\n * OpenOffice.org - a multi-platform office productivity suite\n *\n * $RCSfile: ContextHelper.cxx,v $\n *\n * $Revision: 1.2 $\n *\n * last change: $Author: rt $ $Date: 2005-09-08 01:27: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#include \"ContextHelper.hxx\"\n#include <cppuhelper\/component_context.hxx>\n\n#include <vector>\n\nusing namespace ::com::sun::star;\n\nnamespace chart\n{\n\nnamespace ContextHelper\n{\n\nuno::Reference< uno::XComponentContext >\n createContext(\n const tContextEntryMapType & rMap,\n const uno::Reference< uno::XComponentContext > & rDelegateContext )\n{\n ::std::vector< ::cppu::ContextEntry_Init > aVec( rMap.size());\n for( tContextEntryMapType::const_iterator aIt = rMap.begin();\n aIt != rMap.end();\n ++aIt )\n {\n aVec.push_back( ::cppu::ContextEntry_Init( (*aIt).first, (*aIt).second) );\n }\n\n return ::cppu::createComponentContext( & aVec[0], aVec.size(), rDelegateContext );\n}\n\n} \/\/ namespace ContextHelper\n\n} \/\/ namespace chart\n<|endoftext|>"} {"text":"<commit_before>\/\/=======================================================================\n\/\/ Copyright Baptiste Wicht 2013.\n\/\/ Distributed under the Boost Software License, Version 1.0.\n\/\/ (See accompanying file LICENSE_1_0.txt or copy at\n\/\/ http:\/\/www.boost.org\/LICENSE_1_0.txt)\n\/\/=======================================================================\n\n#include <iostream>\n#include <fstream>\n#include <sstream>\n\n#include <boost\/filesystem.hpp>\n#include <boost\/algorithm\/string.hpp>\n\n#include \"expenses.hpp\"\n#include \"args.hpp\"\n#include \"accounts.hpp\"\n#include \"data.hpp\"\n#include \"guid.hpp\"\n#include \"config.hpp\"\n#include \"utils.hpp\"\n#include \"console.hpp\"\n#include \"budget_exception.hpp\"\n\nusing namespace budget;\n\nnamespace {\n\nstatic data_handler<expense> expenses;\n\nvoid show_expenses(boost::gregorian::greg_month month, boost::gregorian::greg_year year){\n std::vector<std::string> columns = {\"ID\", \"Date\", \"Account\", \"Name\", \"Amount\"};\n std::vector<std::vector<std::string>> contents;\n\n money total;\n std::size_t count = 0;\n\n for(auto& expense : expenses.data){\n if(expense.date.year() == year && expense.date.month() == month){\n contents.push_back({to_string(expense.id), to_string(expense.date), get_account(expense.account).name, expense.name, to_string(expense.amount)});\n\n total += expense.amount;\n ++count;\n }\n }\n\n if(count == 0){\n std::cout << \"No expenses for \" << month << \"-\" << year << std::endl;\n } else {\n contents.push_back({\"\", \"\", \"\", \"Total\", to_string(total)});\n\n display_table(columns, contents);\n }\n}\n\nvoid show_expenses(boost::gregorian::greg_month month){\n auto today = boost::gregorian::day_clock::local_day();\n\n show_expenses(month, today.year());\n}\n\nvoid show_expenses(){\n auto today = boost::gregorian::day_clock::local_day();\n\n show_expenses(today.month(), today.year());\n}\n\nvoid show_all_expenses(){\n std::vector<std::string> columns = {\"ID\", \"Date\", \"Account\", \"Name\", \"Amount\"};\n std::vector<std::vector<std::string>> contents;\n\n for(auto& expense : expenses.data){\n contents.push_back({to_string(expense.id), to_string(expense.date), get_account(expense.account).name, expense.name, to_string(expense.amount)});\n }\n\n display_table(columns, contents);\n}\n\n} \/\/end of anonymous namespace\n\nvoid budget::expenses_module::load(){\n load_expenses();\n load_accounts();\n}\n\nvoid budget::expenses_module::unload(){\n save_expenses();\n}\n\nvoid budget::expenses_module::handle(const std::vector<std::string>& args){\n if(args.size() == 1){\n show_expenses();\n } else {\n auto& subcommand = args[1];\n\n if(subcommand == \"show\"){\n if(args.size() == 2){\n show_expenses();\n } else if(args.size() == 3){\n show_expenses(boost::gregorian::greg_month(to_number<unsigned short>(args[2])));\n } else if(args.size() == 4){\n show_expenses(\n boost::gregorian::greg_month(to_number<unsigned short>(args[2])),\n boost::gregorian::greg_year(to_number<unsigned short>(args[3])));\n } else {\n throw budget_exception(\"Too many arguments to expense show\");\n }\n } else if(subcommand == \"all\"){\n show_all_expenses();\n } else if(subcommand == \"add\"){\n enough_args(args, 5);\n\n expense expense;\n expense.guid = generate_guid();\n expense.date = boost::gregorian::day_clock::local_day();\n\n auto account_name = args[2];\n validate_account(account_name);\n expense.account = get_account(account_name).id;\n\n expense.amount = parse_money(args[3]);\n not_negative(expense.amount);\n\n for(std::size_t i = 4; i < args.size(); ++i){\n expense.name += args[i] + \" \";\n }\n\n add_data(expenses, std::move(expense));\n } else if(subcommand == \"addd\"){\n enough_args(args, 6);\n\n expense expense;\n expense.guid = generate_guid();\n expense.date = boost::gregorian::from_string(args[2]);\n\n auto account_name = args[3];\n validate_account(account_name);\n expense.account = get_account(account_name).id;\n\n expense.amount = parse_money(args[4]);\n not_negative(expense.amount);\n\n for(std::size_t i = 5; i < args.size(); ++i){\n expense.name += args[i] + \" \";\n }\n\n add_data(expenses, std::move(expense));\n } else if(subcommand == \"delete\"){\n enough_args(args, 3);\n\n std::size_t id = to_number<std::size_t>(args[2]);\n\n if(!exists(expenses, id)){\n throw budget_exception(\"There are no expense with id \");\n }\n\n remove(expenses, id);\n\n std::cout << \"Expense \" << id << \" has been deleted\" << std::endl;\n } else if(subcommand == \"edit\"){\n enough_args(args, 3);\n\n std::size_t id = to_number<std::size_t>(args[2]);\n\n if(!exists(expenses, id)){\n throw budget_exception(\"There are no expense with id \" + args[2]);\n }\n\n auto& expense = get(expenses, id);\n\n edit_date(expense.date, \"Date\");\n\n auto account_name = get_account(expense.account).name;\n edit_string(account_name, \"Account\");\n validate_account(account_name);\n expense.account = get_account(account_name).id;\n\n edit_string(expense.name, \"Name\");\n edit_money(expense.amount, \"Amount\");\n\n std::cout << \"Expense \" << id << \" has been modified\" << std::endl;\n } else {\n throw budget_exception(\"Invalid subcommand \\\"\" + subcommand + \"\\\"\");\n }\n }\n}\n\nvoid budget::load_expenses(){\n load_data(expenses, \"expenses.data\");\n}\n\nvoid budget::save_expenses(){\n save_data(expenses, \"expenses.data\");\n}\n\nvoid budget::add_expense(budget::expense&& expense){\n add_data(expenses, std::forward<budget::expense>(expense));\n}\n\nstd::ostream& budget::operator<<(std::ostream& stream, const expense& expense){\n return stream << expense.id << ':' << expense.guid << ':' << expense.account << ':' << expense.name << ':' << expense.amount << ':' << to_string(expense.date);\n}\n\nvoid budget::operator>>(const std::vector<std::string>& parts, expense& expense){\n expense.id = to_number<std::size_t>(parts[0]);\n expense.guid = parts[1];\n expense.account = to_number<std::size_t>(parts[2]);\n expense.name = parts[3];\n expense.amount = parse_money(parts[4]);\n expense.date = boost::gregorian::from_string(parts[5]);\n}\n\nstd::vector<expense>& budget::all_expenses(){\n return expenses.data;\n}\n<commit_msg>Implement a better way to create expenses<commit_after>\/\/=======================================================================\n\/\/ Copyright Baptiste Wicht 2013.\n\/\/ Distributed under the Boost Software License, Version 1.0.\n\/\/ (See accompanying file LICENSE_1_0.txt or copy at\n\/\/ http:\/\/www.boost.org\/LICENSE_1_0.txt)\n\/\/=======================================================================\n\n#include <iostream>\n#include <fstream>\n#include <sstream>\n\n#include <boost\/filesystem.hpp>\n#include <boost\/algorithm\/string.hpp>\n\n#include \"expenses.hpp\"\n#include \"args.hpp\"\n#include \"accounts.hpp\"\n#include \"data.hpp\"\n#include \"guid.hpp\"\n#include \"config.hpp\"\n#include \"utils.hpp\"\n#include \"console.hpp\"\n#include \"budget_exception.hpp\"\n\nusing namespace budget;\n\nnamespace {\n\nstatic data_handler<expense> expenses;\n\nvoid show_expenses(boost::gregorian::greg_month month, boost::gregorian::greg_year year){\n std::vector<std::string> columns = {\"ID\", \"Date\", \"Account\", \"Name\", \"Amount\"};\n std::vector<std::vector<std::string>> contents;\n\n money total;\n std::size_t count = 0;\n\n for(auto& expense : expenses.data){\n if(expense.date.year() == year && expense.date.month() == month){\n contents.push_back({to_string(expense.id), to_string(expense.date), get_account(expense.account).name, expense.name, to_string(expense.amount)});\n\n total += expense.amount;\n ++count;\n }\n }\n\n if(count == 0){\n std::cout << \"No expenses for \" << month << \"-\" << year << std::endl;\n } else {\n contents.push_back({\"\", \"\", \"\", \"Total\", to_string(total)});\n\n display_table(columns, contents);\n }\n}\n\nvoid show_expenses(boost::gregorian::greg_month month){\n auto today = boost::gregorian::day_clock::local_day();\n\n show_expenses(month, today.year());\n}\n\nvoid show_expenses(){\n auto today = boost::gregorian::day_clock::local_day();\n\n show_expenses(today.month(), today.year());\n}\n\nvoid show_all_expenses(){\n std::vector<std::string> columns = {\"ID\", \"Date\", \"Account\", \"Name\", \"Amount\"};\n std::vector<std::vector<std::string>> contents;\n\n for(auto& expense : expenses.data){\n contents.push_back({to_string(expense.id), to_string(expense.date), get_account(expense.account).name, expense.name, to_string(expense.amount)});\n }\n\n display_table(columns, contents);\n}\n\nvoid validate_name(const std::string& name){\n if(name.empty()){\n throw budget_exception(\"The name of the expense cannot be empty\");\n }\n}\n\n} \/\/end of anonymous namespace\n\nvoid budget::expenses_module::load(){\n load_expenses();\n load_accounts();\n}\n\nvoid budget::expenses_module::unload(){\n save_expenses();\n}\n\nvoid budget::expenses_module::handle(const std::vector<std::string>& args){\n if(args.size() == 1){\n show_expenses();\n } else {\n auto& subcommand = args[1];\n\n if(subcommand == \"show\"){\n if(args.size() == 2){\n show_expenses();\n } else if(args.size() == 3){\n show_expenses(boost::gregorian::greg_month(to_number<unsigned short>(args[2])));\n } else if(args.size() == 4){\n show_expenses(\n boost::gregorian::greg_month(to_number<unsigned short>(args[2])),\n boost::gregorian::greg_year(to_number<unsigned short>(args[3])));\n } else {\n throw budget_exception(\"Too many arguments to expense show\");\n }\n } else if(subcommand == \"all\"){\n show_all_expenses();\n } else if(subcommand == \"add\"){\n if(args.size() == 2){\n expense expense;\n expense.guid = generate_guid();\n expense.date = boost::gregorian::day_clock::local_day();\n\n edit_date(expense.date, \"Date\");\n\n std::string account_name;\n edit_string(account_name, \"Account\");\n validate_account(account_name);\n expense.account = get_account(account_name).id;\n\n edit_string(expense.name, \"Name\");\n validate_name(expense.name);\n\n edit_money(expense.amount, \"Amount\");\n not_negative(expense.amount);\n\n add_data(expenses, std::move(expense));\n } else {\n enough_args(args, 5);\n\n expense expense;\n expense.guid = generate_guid();\n expense.date = boost::gregorian::day_clock::local_day();\n\n auto account_name = args[2];\n validate_account(account_name);\n expense.account = get_account(account_name).id;\n\n expense.amount = parse_money(args[3]);\n not_negative(expense.amount);\n\n for(std::size_t i = 4; i < args.size(); ++i){\n expense.name += args[i] + \" \";\n }\n\n validate_name(expense.name);\n\n add_data(expenses, std::move(expense));\n }\n } else if(subcommand == \"addd\"){\n enough_args(args, 6);\n\n expense expense;\n expense.guid = generate_guid();\n expense.date = boost::gregorian::from_string(args[2]);\n\n auto account_name = args[3];\n validate_account(account_name);\n expense.account = get_account(account_name).id;\n\n expense.amount = parse_money(args[4]);\n not_negative(expense.amount);\n\n for(std::size_t i = 5; i < args.size(); ++i){\n expense.name += args[i] + \" \";\n }\n\n validate_name(expense.name);\n\n add_data(expenses, std::move(expense));\n } else if(subcommand == \"delete\"){\n enough_args(args, 3);\n\n std::size_t id = to_number<std::size_t>(args[2]);\n\n if(!exists(expenses, id)){\n throw budget_exception(\"There are no expense with id \");\n }\n\n remove(expenses, id);\n\n std::cout << \"Expense \" << id << \" has been deleted\" << std::endl;\n } else if(subcommand == \"edit\"){\n enough_args(args, 3);\n\n std::size_t id = to_number<std::size_t>(args[2]);\n\n if(!exists(expenses, id)){\n throw budget_exception(\"There are no expense with id \" + args[2]);\n }\n\n auto& expense = get(expenses, id);\n\n edit_date(expense.date, \"Date\");\n\n auto account_name = get_account(expense.account).name;\n edit_string(account_name, \"Account\");\n validate_account(account_name);\n expense.account = get_account(account_name).id;\n\n edit_string(expense.name, \"Name\");\n validate_name(expense.name);\n\n edit_money(expense.amount, \"Amount\");\n not_negative(expense.amount);\n\n std::cout << \"Expense \" << id << \" has been modified\" << std::endl;\n } else {\n throw budget_exception(\"Invalid subcommand \\\"\" + subcommand + \"\\\"\");\n }\n }\n}\n\nvoid budget::load_expenses(){\n load_data(expenses, \"expenses.data\");\n}\n\nvoid budget::save_expenses(){\n save_data(expenses, \"expenses.data\");\n}\n\nvoid budget::add_expense(budget::expense&& expense){\n add_data(expenses, std::forward<budget::expense>(expense));\n}\n\nstd::ostream& budget::operator<<(std::ostream& stream, const expense& expense){\n return stream << expense.id << ':' << expense.guid << ':' << expense.account << ':' << expense.name << ':' << expense.amount << ':' << to_string(expense.date);\n}\n\nvoid budget::operator>>(const std::vector<std::string>& parts, expense& expense){\n expense.id = to_number<std::size_t>(parts[0]);\n expense.guid = parts[1];\n expense.account = to_number<std::size_t>(parts[2]);\n expense.name = parts[3];\n expense.amount = parse_money(parts[4]);\n expense.date = boost::gregorian::from_string(parts[5]);\n}\n\nstd::vector<expense>& budget::all_expenses(){\n return expenses.data;\n}\n<|endoftext|>"} {"text":"<commit_before>#ifndef __COMPHELPER_UNOINTERFACETOUNIQUEIDENTIFIERMAPPER__\n#define __COMPHELPER_UNOINTERFACETOUNIQUEIDENTIFIERMAPPER__\n\n#include <map>\n\n#ifndef _RTL_USTRING_HXX_\n#include <rtl\/ustring.hxx>\n#endif\n\n#ifndef _COM_SUN_STAR_UNO_XINTERFACE_HPP_\n#include <com\/sun\/star\/uno\/XInterface.hpp>\n#endif\n\nnamespace comphelper\n{\n\ntypedef ::std::map< rtl::OUString, const ::com::sun::star::uno::Reference< ::com::sun::star::uno::XInterface > > IdMap_t;\n\nclass UnoInterfaceToUniqueIdentifierMapper\n{\npublic:\n UnoInterfaceToUniqueIdentifierMapper();\n\n \/** returns a unique identifier for the given uno object. IF a uno object is\n registered more than once, the returned identifier is always the same.\n *\/\n const rtl::OUString& registerReference( const ::com::sun::star::uno::Reference< ::com::sun::star::uno::XInterface >& rInterface );\n\n \/** registers the given uno object with the given identifier.\n\n @returns\n false, if the given identifier already exists and is not associated with the given interface\n *\/\n bool registerReference( const rtl::OUString& rIdentifier, const ::com::sun::star::uno::Reference< ::com::sun::star::uno::XInterface >& rInterface );\n\n \/** @returns\n the identifier for the given uno object. If this uno object is not already\n registered, an empty string is returned\n *\/\n const rtl::OUString& getIdentifier( const ::com::sun::star::uno::Reference< ::com::sun::star::uno::XInterface >& rInterface ) const;\n\n \/** @returns\n the uno object that is registered with the given identifier. If no uno object\n is registered with the given identifier, an empty reference is returned.\n *\/\n const ::com::sun::star::uno::Reference< ::com::sun::star::uno::XInterface >& getReference( const rtl::OUString& rIdentifier ) const;\n\nprivate:\n bool findReference( const ::com::sun::star::uno::Reference< ::com::sun::star::uno::XInterface >& rInterface, IdMap_t::const_iterator& rIter ) const;\n bool findIdentifier( const rtl::OUString& rIdentifier, IdMap_t::const_iterator& rIter ) const;\n\n IdMap_t maEntries;\n sal_Int32 mnNextId;\n};\n\n};\n\n#endif\n<commit_msg>INTEGRATION: CWS warnings01 (1.2.224); FILE MERGED 2005\/11\/16 21:33:55 pl 1.2.224.1: #i55991# removed warnings<commit_after>#ifndef __COMPHELPER_UNOINTERFACETOUNIQUEIDENTIFIERMAPPER__\n#define __COMPHELPER_UNOINTERFACETOUNIQUEIDENTIFIERMAPPER__\n\n#include <map>\n\n#ifndef _RTL_USTRING_HXX_\n#include <rtl\/ustring.hxx>\n#endif\n\n#ifndef _COM_SUN_STAR_UNO_XINTERFACE_HPP_\n#include <com\/sun\/star\/uno\/XInterface.hpp>\n#endif\n\nnamespace comphelper\n{\n\ntypedef ::std::map< rtl::OUString, const ::com::sun::star::uno::Reference< ::com::sun::star::uno::XInterface > > IdMap_t;\n\nclass UnoInterfaceToUniqueIdentifierMapper\n{\npublic:\n UnoInterfaceToUniqueIdentifierMapper();\n\n \/** returns a unique identifier for the given uno object. IF a uno object is\n registered more than once, the returned identifier is always the same.\n *\/\n const rtl::OUString& registerReference( const ::com::sun::star::uno::Reference< ::com::sun::star::uno::XInterface >& rInterface );\n\n \/** registers the given uno object with the given identifier.\n\n @returns\n false, if the given identifier already exists and is not associated with the given interface\n *\/\n bool registerReference( const rtl::OUString& rIdentifier, const ::com::sun::star::uno::Reference< ::com::sun::star::uno::XInterface >& rInterface );\n\n \/** @returns\n the identifier for the given uno object. If this uno object is not already\n registered, an empty string is returned\n *\/\n const rtl::OUString& getIdentifier( const ::com::sun::star::uno::Reference< ::com::sun::star::uno::XInterface >& rInterface ) const;\n\n \/** @returns\n the uno object that is registered with the given identifier. If no uno object\n is registered with the given identifier, an empty reference is returned.\n *\/\n const ::com::sun::star::uno::Reference< ::com::sun::star::uno::XInterface >& getReference( const rtl::OUString& rIdentifier ) const;\n\nprivate:\n bool findReference( const ::com::sun::star::uno::Reference< ::com::sun::star::uno::XInterface >& rInterface, IdMap_t::const_iterator& rIter ) const;\n bool findIdentifier( const rtl::OUString& rIdentifier, IdMap_t::const_iterator& rIter ) const;\n\n IdMap_t maEntries;\n sal_Int32 mnNextId;\n};\n\n}\n\n#endif\n<|endoftext|>"} {"text":"<commit_before>#include<iostream>\n#include<fstream>\n#include<string>\n#include<vector>\n\/*to do:\n\tfigure out what other functions might be useful\n\tpopulate datastructures.txt more, change name to something better like programming.txt or w\/e\n*\/\nstruct rdnode {\n\tpublic:\n\tstd::string topic;\n\tstd::vector<rdnode*> parents;\n\tstd::vector<rdnode*> children;\n\tbool knows;\n};\n\nstruct database {\n\tstd::vector<rdnode*> nodes;\n};\n\nvoid learnable (database* points) {\n\trdnode* temp;\n\tstd::vector<rdnode*> learn;\n\tbool learnability = true;\n\tfor (int count = 0; count < points->nodes.size(); count++) {\n\t\tlearnability = true;\n\t\tstd::cout << \"aaaaaa\" << std::endl;\n\t\ttemp = points->nodes[count];\n\t\tif (temp->knows == false) {\n\t\t\trdnode* parent;\n\t\t\tstd::cout << \"aaabbbbaaa\" << std::endl;\n\t\t\tfor (int counter = temp->parents.size() - 1; counter >= 0 && learnability == true; counter--) {\n\t\t\t\tparent = temp->parents[counter];\n\t\t\t\tif (parent->knows == false) {\n\t\t\t\t\tlearnability = false;\n\t\t\t\t}\n\t\t\t}\n\t\t\tif (learnability == true) {\n\t\t\t\tstd::cout << \"accca\" << std::endl;\n\t\t\t\tlearn.push_back(temp);\n\t\t\t}\n\t\t}\n\t}\n\tstd::cout << \"You can learn: \" << learn.size() << \" topics.\" << std::endl;\n\tfor (int count = 0; count < learn.size(); count++) {\n\t\ttemp = learn[count];\n\t\tstd::cout << temp->topic << \" \" << std::endl;\n\t}\n}\n\nvoid depopulate(database* points) {\n\trdnode* delnode;\n\tfor (int count = 0; count < points->nodes.size(); count++) {\n\t\tdelnode = points->nodes[count];\n\t\tdelete delnode;\n\t}\n\tdelete points;\n}\n\nrdnode* makenode(std::string topicname, database* points) {\n\trdnode* tempnode;\n\tfor (int count = 0; count < points->nodes.size(); count++) {\n\t\ttempnode = points->nodes[count];\n\t\tif (tempnode->topic == topicname) {\n\t\t\treturn tempnode;\n\t\t}\n\t}\n\trdnode* newnode = new rdnode;\n\tnewnode->topic = topicname;\n\tnewnode->knows = false;\n\tpoints->nodes.push_back(newnode);\n\treturn newnode;\n}\n\nbool asker(rdnode* temp) {\n\tchar answer;\n\tstd::cout << \"Do you understand \" << temp->topic << \" (y\/n)?\" << std::endl;\n\tstd::cin >> answer;\n\tif (answer == 'y') {\n\t\treturn true;\n\t}\n\tif (answer == 'n') {\n\t\treturn false;\n\t}\n\tstd::cout << \"That's not y or n. Try again.\" << std::endl;\n\treturn asker(temp);\n}\n\nvoid parentsknown(rdnode* temp) {\n\ttemp->knows = true;\n\tfor (int count = 0; count < temp->parents.size(); count++) {\n\t\tparentsknown(temp->parents[count]);\n\t}\n}\n\nvoid knows(database* points, bool hasfile) {\n\trdnode* temp;\n\tbool yeah;\n\tstd::vector<std::string> person;\n\tif (hasfile == true) {\n\t\tstd::cout << \"Enter name of student file.\" << std::endl;\n\t\tchar filename[30];\n\t\tstd::cin >> filename;\n\t\tstd::ifstream inputconf(filename);\n\t\tstd::string line;\n\t\twhile (getline (inputconf, line)) {\n\t\t\tperson.push_back(line);\n\t\t}\n\t\tinputconf.close();\n\t}\n\tfor (int count = 0; count < points->nodes.size(); count++) {\n\t\tyeah = false;\n\t\ttemp = points->nodes[count];\n\t\tif (temp->knows == false) {\n\t\t\tif (!hasfile) {\n\t\t\t\ttemp->knows = asker(temp);\n\t\t\t\tif (temp->knows) {\n\t\t\t\t\tyeah = true;\n\t\t\t\t}\n\t\t\t}\n\t\t\telse {\n\t\t\t\tfor (int counter = 0; counter < person.size() && yeah == false; counter++) {\n\t\t\t\t\tif (person[counter] == temp->topic) {\n\t\t\t\t\t\tyeah = true;\n\t\t\t\t\t\ttemp->knows = true;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t\tif (yeah) {\n\t\t\t\tparentsknown(temp);\n\t\t\t}\n\t\t}\n\t}\n}\n\ndatabase* populate(database* points) {\n\tchar filename[30];\n\tstd::cout << \"Enter file name for database.\" << std::endl;\n\tstd::cin >> filename;\n\tstd::vector<std::string> conf;\n\tstd::ifstream inputconf(filename);\n\tstd::string line;\n\twhile (getline (inputconf, line)) {\n\t\tconf.push_back(line);\n\t}\n\tinputconf.close();\n\tfor (int counter = 0; counter < conf.size(); counter++) {\n\t\tline = conf[counter];\n\t\trdnode* tempnode;\n\t\tstd::string currstring;\n\t\tint count = 0;\n\t\tstd::vector<rdnode*> parenting;\n\t\tfor(; count < line.size(); count++) {\n\t\t\tif (line[count] != ',' && line[count] != '#') {\n\t\t\t\tcurrstring.push_back(line[count]);\n\t\t\t}\n\t\t\tif (line[count] == ',' || line[count] == '#') {\n\t\t\t\ttempnode = makenode(currstring, points);\n\t\t\t\tcurrstring.clear();\n\t\t\t\tparenting.push_back(tempnode);\n\t\t\t}\n\t\t\tif (line[count] == '#') {\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t\tcount++;\n\t\tfor (; count < line.size(); count++) {\n\t\t\tcurrstring.push_back(line[count]);\n\t\t}\n\t\ttempnode = makenode(currstring, points);\n\t\trdnode* currentparent;\n\t\tbool add = true;\n\t\tfor (count = 0; count < parenting.size(); count++) {\n\t\t\tcurrentparent = parenting[count];\n\t\t\tfor (int counter = 0; counter < tempnode->parents.size(); counter++) {\n\t\t\t\tif (tempnode->parents[counter] == currentparent) {\n\t\t\t\t\tadd = false;\n\t\t\t\t}\n\t\t\t}\n\t\t\tif (add == true) {\n\t\t\t\ttempnode->parents.push_back(parenting[count]);\n\t\t\t\tcurrentparent->children.push_back(tempnode);\n\t\t\t}\n\t\t}\n\t}\n\treturn points;\n}\n\nvoid printall(database* points) {\n\trdnode* temp;\n\tfor (int count = 0; count < points->nodes.size(); count++) {\n\t\ttemp = points->nodes[count];\n\t\tstd::cout << temp->topic << std::endl;\n\t}\n}\n\nvoid rmknows(database* points) {\n\trdnode* temp;\n\tfor (int count = 0; count < points->nodes.size(); count++) {\n\t\ttemp = points->nodes[count];\n\t\ttemp->knows = false;\n\t}\n}\n\nvoid student(database* points) {\n\tstd::cout << \"Enter name of student file.\" << std::endl;\n\tstd::vector<std::string> person;\n\tchar filename[30];\n\tstd::cin >> filename;\n\tstd::ifstream inputconf(filename);\n\tstd::string line;\n\twhile (getline (inputconf, line)) {\n\t\tperson.push_back(line);\n\t}\n\tinputconf.close();\n\trdnode* tempnode;\n\tbool finishloop = false;\n\tfor (int count = 0; count < person.size(); count++) {\n\t\tfor (int counter = 0; counter < points->nodes.size() && finishloop == false; counter++) {\n\t\t\ttempnode = points->nodes[counter];\n\t\t\tif (tempnode->topic == person[count]) {\n\t\t\t\ttempnode->knows = true;\n\t\t\t\tfinishloop = true;\n\t\t\t}\n\t\t}\n\t\tfinishloop = false;\n\t}\n}\n\nstd::vector<std::string> prerequisites(rdnode* node, database* points) {\n\tstd::vector<std::string> needtoknow;\n\trdnode* parent;\n\tfor (int count = 0; count < node->parents.size(); count++) {\n\t\tparent = node->parents[count];\n\t\tif (parent->knows == false) {\n\t\t\tneedtoknow.push_back(parent->topic);\n\t\t\tstd::vector<std::string> alsoneed = prerequisites(parent, points);\n\t\t\tfor (int counter = 0; counter < alsoneed.size(); counter++) {\n\t\t\t\tneedtoknow.push_back(alsoneed[counter]);\n\t\t\t}\n\t\t}\n\t}\n\treturn needtoknow;\n}\n\nint main() {\n\tdatabase* points = new database;\n\tpoints = populate(points);\n\tbool keeplooping = true;\n\tstd::cout << \"Do you have a student file? (y\/n)?\" << std::endl;\n\tchar answer;\n\tstd::cin >> answer;\n\tif (answer == 'y') {\n\t\tknows(points, true);\n\t}\n\telse {\n\t\tstd::cout << \"else is working\" << std::endl;\n\t\tknows(points, false);\n\t}\n\twhile (keeplooping) {\n\t\tstd::cout << \"Your options: Change student (a), List all learnable topics for current student (b), Find out what you need to learn before you can learn a specified topic (c), Print all topics in the database (d), Remove current database and build a new database (e), Add a database's nodes to the current database (f), Exit program (g)\" << std::endl;\n\t\tstd::cin >> answer;\n\t\tif (answer == 'a') {\n\t\t\trmknows(points);\n\t\t\tstd::cout << \"Do you have a student file? (y\/n)?\" << std::endl;\n\t\t\tchar answer;\n\t\t\tstd::cin >> answer;\n\t\t\tif (answer == 'y') {\n\t\t\t\tknows(points, true);\n\t\t\t}\n\t\t\telse {\n\t\t\t\tknows(points, false);\n\t\t\t}\n\t\t}\n\t\tif (answer == 'b') {\n\t\t\tlearnable(points);\n\t\t}\n\t\tif (answer == 'c') {\n\t\t\tstd::cout << \"Type in the name of the topic.\" << std::endl;\n\t\t\tstd::string topicname;\n\t\t\tstd::getline (std::cin, topicname);\n\t\t\trdnode* node;\n\t\t\tbool assigned = false;\n\t\t\tstd::vector<std::string> gottalearn;\n\t\t\tfor (int count = 0; count < points->nodes.size() && assigned == false; count++) {\n\t\t\t\tnode = points->nodes[count];\n\t\t\t\tif (node->topic == topicname) {\n\t\t\t\t\tstd::cout << \"That topic exists in the database.\" << std::endl;\n\t\t\t\t\tassigned = true;\n\t\t\t\t}\n\t\t\t}\n\t\t\tif (assigned == false) {\n\t\t\t\tstd::cout << \"That topic isn't in the database. You may have spelled or formatted it incorrectly; make sure all your letters are lowercase.\" << std::endl;\n\t\t\t}\n\t\t\telse {\n\t\t\t\tgottalearn = prerequisites(node, points);\n\t\t\t\tif (gottalearn.size() == 0) {\n\t\t\t\t\tstd::cout << \"You can learn that now!\" << std::endl;\n\t\t\t\t}\n\t\t\t\telse {\n\t\t\t\t\tstd::cout << \"You need to learn \";\n\t\t\t\t\tfor (int count = 0; count < gottalearn.size(); count++) {\n\t\t\t\t\t\tstd::cout << gottalearn[count];\n\t\t\t\t\t\tif (count + 1 < gottalearn.size()) {\n\t\t\t\t\t\t\tstd::cout << \" and\";\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t\tstd::cout << \" before you can learn \" << topicname << \".\" << std::endl;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tif (answer == 'd') {\n\t\t\tprintall(points);\n\t\t}\n\t\tif (answer == 'e') {\n\t\t\tdepopulate(points);\n\t\t\tdatabase* points = populate(points);\n\t\t}\n\t\tif (answer == 'f') {\n\t\t\tpoints = populate(points);\n\t\t}\n\t\tif (answer == 'g') {\n\t\t\tkeeplooping = false;\n\t\t}\n\t}\n\tdepopulate(points);\n\treturn 0;\n}\n<commit_msg>Update learning.cpp<commit_after>#include<iostream>\n#include<fstream>\n#include<string>\n#include<vector>\n\/*to do:\n\tfigure out what other functions might be useful\n\tpopulate datastructures.txt more, change name to something better like programming.txt or w\/e\n*\/\nstruct rdnode {\n\tpublic:\n\tstd::string topic;\n\tstd::vector<rdnode*> parents;\n\tstd::vector<rdnode*> children;\n\tbool knows;\n};\n\nstruct database {\n\tstd::vector<rdnode*> nodes;\n};\n\nvoid learnable (database* points) {\n\trdnode* temp;\n\tstd::vector<rdnode*> learn;\n\tbool learnability = true;\n\tfor (int count = 0; count < points->nodes.size(); count++) {\n\t\tlearnability = true;\n\t\tstd::cout << \"aaaaaa\" << std::endl;\n\t\ttemp = points->nodes[count];\n\t\tif (temp->knows == false) {\n\t\t\trdnode* parent;\n\t\t\tstd::cout << \"aaabbbbaaa\" << std::endl;\n\t\t\tfor (int counter = temp->parents.size() - 1; counter >= 0 && learnability == true; counter--) {\n\t\t\t\tparent = temp->parents[counter];\n\t\t\t\tif (parent->knows == false) {\n\t\t\t\t\tlearnability = false;\n\t\t\t\t}\n\t\t\t}\n\t\t\tif (learnability == true) {\n\t\t\t\tstd::cout << \"accca\" << std::endl;\n\t\t\t\tlearn.push_back(temp);\n\t\t\t}\n\t\t}\n\t}\n\tstd::cout << \"You can learn: \" << learn.size() << \" topics.\" << std::endl;\n\tfor (int count = 0; count < learn.size(); count++) {\n\t\ttemp = learn[count];\n\t\tstd::cout << temp->topic << \" \" << std::endl;\n\t}\n}\n\nvoid depopulate(database* points) {\n\trdnode* delnode;\n\tfor (int count = 0; count < points->nodes.size(); count++) {\n\t\tdelnode = points->nodes[count];\n\t\tdelete delnode;\n\t}\n\tdelete points;\n}\n\nrdnode* makenode(std::string topicname, database* points) {\n\trdnode* tempnode;\n\tfor (int count = 0; count < points->nodes.size(); count++) {\n\t\ttempnode = points->nodes[count];\n\t\tif (tempnode->topic == topicname) {\n\t\t\treturn tempnode;\n\t\t}\n\t}\n\trdnode* newnode = new rdnode;\n\tnewnode->topic = topicname;\n\tnewnode->knows = false;\n\tpoints->nodes.push_back(newnode);\n\treturn newnode;\n}\n\nbool asker(rdnode* temp) {\n\tchar answer;\n\tstd::cout << \"Do you understand \" << temp->topic << \" (y\/n)?\" << std::endl;\n\tstd::cin >> answer;\n\tif (answer == 'y') {\n\t\treturn true;\n\t}\n\tif (answer == 'n') {\n\t\treturn false;\n\t}\n\tstd::cout << \"That's not y or n. Try again.\" << std::endl;\n\treturn asker(temp);\n}\n\nvoid parentsknown(rdnode* temp) {\n\ttemp->knows = true;\n\tfor (int count = 0; count < temp->parents.size(); count++) {\n\t\tparentsknown(temp->parents[count]);\n\t}\n}\n\nvoid knows(database* points, bool hasfile) {\n\trdnode* temp;\n\tbool yeah;\n\tstd::vector<std::string> person;\n\tif (hasfile == true) {\n\t\tstd::cout << \"Enter name of student file.\" << std::endl;\n\t\tchar filename[30];\n\t\tstd::cin >> filename;\n\t\tstd::ifstream inputconf(filename);\n\t\tstd::string line;\n\t\twhile (getline (inputconf, line)) {\n\t\t\tperson.push_back(line);\n\t\t}\n\t\tinputconf.close();\n\t}\n\tfor (int count = 0; count < points->nodes.size(); count++) {\n\t\tyeah = false;\n\t\ttemp = points->nodes[count];\n\t\tif (temp->knows == false) {\n\t\t\tif (!hasfile) {\n\t\t\t\ttemp->knows = asker(temp);\n\t\t\t\tif (temp->knows) {\n\t\t\t\t\tyeah = true;\n\t\t\t\t}\n\t\t\t}\n\t\t\telse {\n\t\t\t\tfor (int counter = 0; counter < person.size() && yeah == false; counter++) {\n\t\t\t\t\tif (person[counter] == temp->topic) {\n\t\t\t\t\t\tyeah = true;\n\t\t\t\t\t\ttemp->knows = true;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t\tif (yeah) {\n\t\t\t\tparentsknown(temp);\n\t\t\t}\n\t\t}\n\t}\n}\n\ndatabase* populate(database* points) {\n\tchar filename[30];\n\tstd::cout << \"Enter file name for database.\" << std::endl;\n\tstd::cin >> filename;\n\tstd::vector<std::string> conf;\n\tstd::ifstream inputconf(filename);\n\tstd::string line;\n\twhile (getline (inputconf, line)) {\n\t\tconf.push_back(line);\n\t}\n\tinputconf.close();\n\tfor (int counter = 0; counter < conf.size(); counter++) {\n\t\tline = conf[counter];\n\t\trdnode* tempnode;\n\t\tstd::string currstring;\n\t\tint count = 0;\n\t\tstd::vector<rdnode*> parenting;\n\t\tfor(; count < line.size(); count++) {\n\t\t\tif (line[count] != ',' && line[count] != '#') {\n\t\t\t\tcurrstring.push_back(line[count]);\n\t\t\t}\n\t\t\tif (line[count] == ',' || line[count] == '#') {\n\t\t\t\ttempnode = makenode(currstring, points);\n\t\t\t\tcurrstring.clear();\n\t\t\t\tparenting.push_back(tempnode);\n\t\t\t}\n\t\t\tif (line[count] == '#') {\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t\tcount++;\n\t\tfor (; count < line.size(); count++) {\n\t\t\tcurrstring.push_back(line[count]);\n\t\t}\n\t\ttempnode = makenode(currstring, points);\n\t\trdnode* currentparent;\n\t\tbool add = true;\n\t\tfor (count = 0; count < parenting.size(); count++) {\n\t\t\tcurrentparent = parenting[count];\n\t\t\tfor (int counter = 0; counter < tempnode->parents.size(); counter++) {\n\t\t\t\tif (tempnode->parents[counter] == currentparent) {\n\t\t\t\t\tadd = false;\n\t\t\t\t}\n\t\t\t}\n\t\t\tif (add == true) {\n\t\t\t\ttempnode->parents.push_back(parenting[count]);\n\t\t\t\tcurrentparent->children.push_back(tempnode);\n\t\t\t}\n\t\t}\n\t}\n\treturn points;\n}\n\nvoid printall(database* points) {\n\trdnode* temp;\n\tfor (int count = 0; count < points->nodes.size(); count++) {\n\t\ttemp = points->nodes[count];\n\t\tstd::cout << temp->topic << std::endl;\n\t}\n}\n\nvoid rmknows(database* points) {\n\trdnode* temp;\n\tfor (int count = 0; count < points->nodes.size(); count++) {\n\t\ttemp = points->nodes[count];\n\t\ttemp->knows = false;\n\t}\n}\n\nvoid student(database* points) {\n\tstd::cout << \"Enter name of student file.\" << std::endl;\n\tstd::vector<std::string> person;\n\tchar filename[30];\n\tstd::cin >> filename;\n\tstd::ifstream inputconf(filename);\n\tstd::string line;\n\twhile (getline (inputconf, line)) {\n\t\tperson.push_back(line);\n\t}\n\tinputconf.close();\n\trdnode* tempnode;\n\tbool finishloop = false;\n\tfor (int count = 0; count < person.size(); count++) {\n\t\tfor (int counter = 0; counter < points->nodes.size() && finishloop == false; counter++) {\n\t\t\ttempnode = points->nodes[counter];\n\t\t\tif (tempnode->topic == person[count]) {\n\t\t\t\ttempnode->knows = true;\n\t\t\t\tfinishloop = true;\n\t\t\t}\n\t\t}\n\t\tfinishloop = false;\n\t}\n}\n\nstd::vector<std::string> prerequisites(rdnode* node, database* points) {\n\tstd::vector<std::string> needtoknow;\n\trdnode* parent;\n\tfor (int count = 0; count < node->parents.size(); count++) {\n\t\tparent = node->parents[count];\n\t\tif (parent->knows == false) {\n\t\t\tbool alreadythere = false;\n\t\t\tfor (int counter = 0; counter < needtoknow.size(); counter++) {\n\t\t\t\tif (parent->topic == needtoknow[counter]) {\n\t\t\t\t\talreadythere = true;\n\t\t\t\t}\n\t\t\t}\n\t\t\tif (alreadythere == false) {\n\t\t\t\tneedtoknow.push_back(parent->topic);\n\t\t\t}\n\t\t\tstd::vector<std::string> alsoneed = prerequisites(parent, points);\n\t\t\talreadythere = false;\n\t\t\tfor (int counter = 0; counter < alsoneed.size(); counter++) {\n\t\t\t\tfor (int counting = 0; counting < needtoknow.size(); counting++) {\n\t\t\t\t\tif (needtoknow[counting] == alsoneed[counter]) {\n\t\t\t\t\t\talreadythere = true;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\tif (alreadythere == false) {\n\t\t\t\t\tneedtoknow.push_back(alsoneed[counter]);\n\t\t\t\t}\n\t\t\t\talreadythere = false;\n\t\t\t}\n\t\t}\n\t}\n\treturn needtoknow;\n}\n\nint main() {\n\tdatabase* points = new database;\n\tpoints = populate(points);\n\tbool keeplooping = true;\n\tstd::cout << \"Do you have a student file? (y\/n)?\" << std::endl;\n\tchar answer;\n\tstd::cin >> answer;\n\tif (answer == 'y') {\n\t\tknows(points, true);\n\t}\n\telse {\n\t\tstd::cout << \"else is working\" << std::endl;\n\t\tknows(points, false);\n\t}\n\twhile (keeplooping) {\n\t\tstd::cout << \"Your options: Change student (a), List all learnable topics for current student (b), Find out what you need to learn before you can learn a specified topic (c), Print all topics in the database (d), Remove current database and build a new database (e), Add a database's nodes to the current database (f), Exit program (g)\" << std::endl;\n\t\tstd::cin >> answer;\n\t\tif (answer == 'a') {\n\t\t\trmknows(points);\n\t\t\tstd::cout << \"Do you have a student file? (y\/n)?\" << std::endl;\n\t\t\tchar answer;\n\t\t\tstd::cin >> answer;\n\t\t\tif (answer == 'y') {\n\t\t\t\tknows(points, true);\n\t\t\t}\n\t\t\telse {\n\t\t\t\tknows(points, false);\n\t\t\t}\n\t\t}\n\t\tif (answer == 'b') {\n\t\t\tlearnable(points);\n\t\t}\n\t\tif (answer == 'c') {\n\t\t\tstd::cout << \"Type in the name of the topic. \";\n\t\t\tstd::string topicname;\n\t\t\t\/\/std::cout << \"before\" << std::endl;\n\t\t\tstd::cin.ignore();\n\t\t\tstd::getline (std::cin, topicname);\n\t\t\t\/\/std::cout << \"after\" << std::endl;\n\t\t\trdnode* node;\n\t\t\tbool assigned = false;\n\t\t\tstd::vector<std::string> gottalearn;\n\t\t\tfor (int count = 0; count < points->nodes.size() && assigned == false; count++) {\n\t\t\t\tnode = points->nodes[count];\n\t\t\t\tif (node->topic == topicname) {\n\t\t\t\t\tstd::cout << \"That topic exists in the database.\" << std::endl;\n\t\t\t\t\tassigned = true;\n\t\t\t\t}\n\t\t\t}\n\t\t\tif (assigned == false) {\n\t\t\t\tstd::cout << \"That topic isn't in the database. You may have spelled or formatted it incorrectly; make sure all your letters are lowercase.\" << std::endl;\n\t\t\t}\n\t\t\telse {\n\t\t\t\tgottalearn = prerequisites(node, points);\n\t\t\t\tif (gottalearn.size() == 0) {\n\t\t\t\t\tstd::cout << \"You can learn that now!\" << std::endl;\n\t\t\t\t}\n\t\t\t\telse {\n\t\t\t\t\tstd::cout << \"You need to learn \";\n\t\t\t\t\tfor (int count = 0; count < gottalearn.size(); count++) {\n\t\t\t\t\t\tstd::cout << gottalearn[count];\n\t\t\t\t\t\tif (count + 1 < gottalearn.size()) {\n\t\t\t\t\t\t\tstd::cout << \" and \";\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t\tstd::cout << \" before you can learn \" << topicname << \".\" << std::endl;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tif (answer == 'd') {\n\t\t\tprintall(points);\n\t\t}\n\t\tif (answer == 'e') {\n\t\t\tdepopulate(points);\n\t\t\tdatabase* points = populate(points);\n\t\t}\n\t\tif (answer == 'f') {\n\t\t\tpoints = populate(points);\n\t\t}\n\t\tif (answer == 'g') {\n\t\t\tkeeplooping = false;\n\t\t}\n\t}\n\tdepopulate(points);\n\treturn 0;\n}\n<|endoftext|>"} {"text":"<commit_before>\/\/\/\n\/\/\/ A simple clang plugin which will translate the given C file into Zomp\n\/\/\/ definitions\n\/\/\/\n\n#include \"clang\/Frontend\/FrontendPluginRegistry.h\"\n#include \"clang\/AST\/ASTConsumer.h\"\n#include \"clang\/AST\/AST.h\"\n#include \"clang\/Frontend\/CompilerInstance.h\"\n#include \"clang\/Basic\/SourceManager.h\"\n#include \"clang\/Basic\/FileManager.h\"\n#include \"llvm\/Support\/raw_ostream.h\"\n\nusing namespace clang;\n\nnamespace {\n\nstatic std::string errorType(const char* msg)\n{\n return std::string(\"error_t(\\\"\") + msg + \"\\\")\"; \n}\n\nstatic std::string zompTypeName(const Type* t)\n{\n if( t == 0 )\n {\n return \"type_was_null\";\n }\n\n if( const BuiltinType* bt = dyn_cast<BuiltinType>(t) )\n {\n switch(bt->getKind())\n {\n case BuiltinType::Void: return \"void\";\n case BuiltinType::UShort: return \"c_ushort\";\n case BuiltinType::UInt: return \"c_uint\";\n case BuiltinType::ULong: return \"c_ulong\";\n case BuiltinType::ULongLong: return \"c_ulong_long\";\n case BuiltinType::UInt128: return \"u128\";\n case BuiltinType::Short: return \"c_short\";\n case BuiltinType::Int: return \"c_int\";\n case BuiltinType::Long: return \"c_long\";\n case BuiltinType::LongLong: return \"c_long_long\";\n case BuiltinType::Int128: return \"s128\";\n case BuiltinType::Float: return \"float\";\n case BuiltinType::Double: return \"double\";\n case BuiltinType::LongDouble: return \"c_long_double\";\n\n case BuiltinType::Char_U: return \"c_implicit_uchar\";\n case BuiltinType::Char_S: return \"c_implicit_schar\";\n case BuiltinType::UChar: return \"c_uchar\";\n case BuiltinType::SChar: return \"c_schar\";\n\n case BuiltinType::WChar_U:\n case BuiltinType::Char16:\n case BuiltinType::Char32:\n case BuiltinType::WChar_S:\n\n case BuiltinType::NullPtr:\n case BuiltinType::Dependent:\n case BuiltinType::Overload:\n\n case BuiltinType::ObjCId:\n case BuiltinType::ObjCClass:\n case BuiltinType::ObjCSel:\n \n default:\n return \"UnsupportedBuiltinType\";\n }\n }\n else if( const PointerType* pt = dyn_cast<PointerType>(t) )\n {\n QualType base_type = pt->getPointeeType();\n return zompTypeName(base_type.getTypePtrOrNull()) + \"*\";\n }\n else if( const ArrayType* at = dyn_cast<ArrayType>(t) )\n {\n assert( at );\n return errorType( \"bindgen does not support array types, yet\" );\n }\n else if( const FunctionType* ft = dyn_cast<FunctionType>(t) )\n {\n assert( ft );\n return errorType(\"bindgen does not support function types, yet\" );\n }\n else if( const TypedefType* tt = dyn_cast<TypedefType>(t) )\n {\n return tt->getDecl()->getName();\n \/\/ return zompTypeName(\n \/\/ tt->getDecl()->getCanonicalDecl()->getUnderlyingType().getTypePtrOrNull() );\n }\n else if( const EnumType* et = dyn_cast<EnumType>(t) )\n {\n return et->getDecl()->getNameAsString();\n }\n else if( const RecordType* rt = dyn_cast<RecordType>(t) )\n {\n return rt->getDecl()->getNameAsString();\n }\n else\n {\n return errorType(\"type not understood by bindgen\");\n }\n}\n\nstatic std::string zompTypeName( const QualType& qual_type )\n{\n std::string base_name = zompTypeName( qual_type.getTypePtrOrNull() );\n std::string name = base_name;\n\n if( qual_type.isConstQualified() )\n {\n name = \"\/* const *\/\" + name;\n }\n\n if( qual_type.isRestrictQualified() )\n {\n name = \"\/* restrict *\/\" + name;\n }\n\n if( qual_type.isVolatileQualified() )\n {\n name = \"\/* volatile *\/\" + name;\n }\n\n return name;\n}\n\n\/** Visitor which will handle every top level declaration *\/\nclass GenBindingsConsumer : public ASTConsumer\n{\n ASTContext* m_context;\n SourceManager* m_src_manager;\n FileID m_main_file_id;\n\npublic:\n GenBindingsConsumer() : m_context(0), m_src_manager(0)\n {\n }\n\n virtual void Initialize(ASTContext &context)\n {\n m_context = &context;\n m_src_manager = &context.getSourceManager();\n m_main_file_id = m_src_manager->getMainFileID();\n\n const char* main_file_name = m_src_manager->getFileEntryForID( m_main_file_id )->getName();\n llvm::outs() << \"\/\/\/\\n\";\n llvm::outs() << \"\/\/\/ Zomp bindings for \" << main_file_name << \"\\n\";\n llvm::outs() << \"\/\/\/\\n\";\n llvm::outs() << \"\\n\";\n }\n\n virtual void HandleTopLevelDecl(DeclGroupRef DG)\n {\n for (DeclGroupRef::iterator i = DG.begin(), e = DG.end(); i != e; ++i)\n {\n const Decl *D = *i;\n\n const TranslationUnitDecl* tu = D->getTranslationUnitDecl();\n if( !tu ) {\n continue;\n }\n\n const SourceLocation& loc = D->getLocation();\n if( m_src_manager->getFileID(loc) != m_main_file_id)\n {\n continue;\n }\n\n handleAs<VarDecl>(D) ||\n handleAs<FunctionDecl>(D) ||\n handleAs<TypedefDecl>(D) ||\n handleAs<RecordDecl>(D) ||\n handleAs<EnumDecl>(D) ||\n handleUnknown(D);\n }\n }\n\nprivate:\n\n enum HandlingResult { Handled, CouldNotHandle };\n\n template<typename T>\n bool handleAs(const Decl* D)\n {\n const T* typed_decl = dyn_cast<T>(D);\n if(typed_decl)\n {\n const bool result = handle(typed_decl) == Handled;\n \/\/ llvm::outs() << \"\\n\";\n return result;\n }\n else\n {\n return false;\n }\n }\n\n HandlingResult handle(const FunctionDecl* func_decl)\n {\n bool ignore = func_decl->isCXXClassMember()\n || func_decl->isCXXInstanceMember()\n || func_decl->isVariadic()\n || func_decl->isMain();\n\n if(ignore) {\n return CouldNotHandle;\n }\n\n llvm::outs() << \"nativeFn \";\n llvm::outs() << zompTypeName( func_decl->getResultType() ) << \" \";\n llvm::outs() << func_decl->getNameAsString() << \"(\";\n bool first_param = true;\n for( FunctionDecl::param_const_iterator param_i = func_decl->param_begin(),\n pend = func_decl->param_end( );\n param_i != pend;\n ++param_i, first_param = false )\n {\n ParmVarDecl* param = *param_i;\n\n if( !first_param ) {\n llvm::outs() << \", \";\n }\n\n QualType typesrc = param->getTypeSourceInfo()->getType();\n const Type* type = typesrc.getTypePtrOrNull();\n\n llvm::outs() << zompTypeName(type);\n\n if( param->getIdentifier() )\n {\n llvm::outs() << \" \"\n << param->getNameAsString();\n }\n\n if ( param->hasDefaultArg() )\n {\n llvm::outs() << \" \/* = ... *\/\";\n }\n }\n llvm::outs() << \")\\n\";\n\n return Handled;\n }\n\n HandlingResult handle(const VarDecl* var_decl)\n {\n llvm::outs() << \"nativeVar \"\n << zompTypeName( var_decl->getTypeSourceInfo()->getType() )\n << \" \"\n << var_decl->getNameAsString()\n << \"\\n\";\n\n return Handled;\n }\n\n bool handle(const TypedefDecl* type_decl)\n {\n QualType typesrc = type_decl->getUnderlyingType();\n const Type* type = typesrc.getTypePtrOrNull();\n std::string zomp_name = zompTypeName(type);\n\n bool handled = false;\n\n if( type )\n {\n if( zomp_name.empty() )\n {\n if( const RecordType* record_type = dyn_cast<RecordType>(type) )\n {\n handled = handle( record_type->getDecl(), type_decl->getName() );\n }\n }\n else\n {\n llvm::outs()\n << \"nativeTypedef \"\n << type_decl->getName()\n << \" \" << zomp_name << \"\\n\";\n handled = true;\n }\n }\n\n if( !handled )\n {\n llvm::outs()\n << \"\/\/ ignoring typedef \" << type_decl->getName() << \"\\n\";\n }\n\n return Handled;\n }\n\n bool handle(const RecordDecl* record_decl, llvm::StringRef name = \"\" )\n {\n if( record_decl->isAnonymousStructOrUnion() ||\n name.empty() )\n {\n llvm::outs() << \"\/\/ ignoring anonymous struct\\n\";\n return Handled;\n }\n\n if( record_decl->isDefinition() )\n {\n llvm::outs() << \"nativeStruct \" << name << \":\\n\";\n\n typedef RecordDecl::field_iterator FieldIter;\n for( FieldIter fi = record_decl->field_begin(), fi_end = record_decl->field_end();\n fi != fi_end;\n ++fi )\n {\n const FieldDecl& field = **fi;\n if( field.isBitField() )\n {\n llvm::outs() << \" \/\/ ignored bitfield, not supported\\n\";\n }\n else\n {\n llvm::outs()\n << \" \"\n << zompTypeName( field.getType() )\n << \" \"\n << field.getName()\n << \"\\n\";\n }\n }\n\n llvm::outs() << \"end\\n\";\n }\n else\n {\n llvm::outs() << \"nativeStruct \" << name << \"\\n\";\n }\n\n return Handled;\n }\n\n bool handle(const EnumDecl* enum_decl)\n {\n if( enum_decl->getName().empty() )\n {\n llvm::outs() << \"\/\/ ignoring name-less enum\\n\";\n }\n else if( enum_decl->isComplete() )\n {\n llvm::outs()\n << \"nativeEnum \"\n << enum_decl->getName() << \" \"\n << zompTypeName( enum_decl->getPromotionType() )\n << \":\\n\";\n\n typedef EnumDecl::enumerator_iterator EnumIter;\n for( EnumIter variant = enum_decl->enumerator_begin(), vend = enum_decl->enumerator_end();\n variant != vend;\n ++variant )\n {\n EnumConstantDecl* ecd = *variant;\n\n llvm::outs()\n << \" \"\n << ecd->getName() << \" \"\n << ecd->getInitVal()\n << \"\\n\";\n }\n \n llvm::outs() << \"end\\n\";\n }\n else\n {\n llvm::outs()\n << \"nativeEnum \"\n << enum_decl->getName()\n << \"\\n\";\n }\n\n return Handled;\n }\n\n bool handleUnknown(const Decl* D)\n {\n if(const NamedDecl* n = dyn_cast<NamedDecl>(D))\n {\n llvm::outs() << \"\/\/ ignored \" << n->getNameAsString() << \"\\n\";\n }\n else\n {\n llvm::outs() << \"\/\/ ignored nameless declaration\\n\";\n }\n\n return Handled;\n }\n};\n\n\/** The plugin class. Will instantiate GenBindingsConsumer and run it *\/\nclass GenBindingsAction : public PluginASTAction\n{\nprotected:\n ASTConsumer *CreateASTConsumer(CompilerInstance &CI, llvm::StringRef)\n {\n return new GenBindingsConsumer();\n }\n \n bool ParseArgs(\n const CompilerInstance &CI,\n const std::vector<std::string>& args )\n {\n for (unsigned i = 0, e = args.size(); i != e; ++i) {\n llvm::errs() << \"PrintFunctionNames arg = \" << args[i] << \"\\n\";\n \n \/\/ Example error handling.\n if (args[i] == \"-an-error\") {\n Diagnostic &D = CI.getDiagnostics();\n unsigned DiagID = D.getCustomDiagID(\n Diagnostic::Error, \"invalid argument '\" + args[i] + \"'\");\n D.Report(DiagID);\n return false;\n }\n }\n if (args.size() && args[0] == \"help\")\n PrintHelp(llvm::errs());\n \n return true;\n }\n\n void PrintHelp(llvm::raw_ostream& ros)\n {\n ros << \"Translates declarations of a C file into Zomp declarations.\\n\"\n \"This makes it easy to use C libaries from Zomp.\";\n }\n};\n \n} \/\/ anonymous namespace\n\nstatic FrontendPluginRegistry::Add<GenBindingsAction> X(\"gen-zomp-bindings\", \"Generate Zomp bindings\");\n\n<commit_msg>bindgen supports \"typedef { ... } FooEnum;\" constructs, fixed bug introduced by last commit<commit_after>\/\/\/\n\/\/\/ A simple clang plugin which will translate the given C file into Zomp\n\/\/\/ definitions\n\/\/\/\n\n#include \"clang\/Frontend\/FrontendPluginRegistry.h\"\n#include \"clang\/AST\/ASTConsumer.h\"\n#include \"clang\/AST\/AST.h\"\n#include \"clang\/Frontend\/CompilerInstance.h\"\n#include \"clang\/Basic\/SourceManager.h\"\n#include \"clang\/Basic\/FileManager.h\"\n#include \"llvm\/Support\/raw_ostream.h\"\n\nusing namespace clang;\n\nnamespace {\n\nstatic std::string errorType(const char* msg)\n{\n return std::string(\"error_t(\\\"\") + msg + \"\\\")\"; \n}\n\nstatic std::string zompTypeName(const Type* t)\n{\n if( t == 0 )\n {\n return \"type_was_null\";\n }\n\n if( const BuiltinType* bt = dyn_cast<BuiltinType>(t) )\n {\n switch(bt->getKind())\n {\n case BuiltinType::Void: return \"void\";\n case BuiltinType::UShort: return \"c_ushort\";\n case BuiltinType::UInt: return \"c_uint\";\n case BuiltinType::ULong: return \"c_ulong\";\n case BuiltinType::ULongLong: return \"c_ulong_long\";\n case BuiltinType::UInt128: return \"u128\";\n case BuiltinType::Short: return \"c_short\";\n case BuiltinType::Int: return \"c_int\";\n case BuiltinType::Long: return \"c_long\";\n case BuiltinType::LongLong: return \"c_long_long\";\n case BuiltinType::Int128: return \"s128\";\n case BuiltinType::Float: return \"float\";\n case BuiltinType::Double: return \"double\";\n case BuiltinType::LongDouble: return \"c_long_double\";\n\n case BuiltinType::Char_U: return \"c_implicit_uchar\";\n case BuiltinType::Char_S: return \"c_implicit_schar\";\n case BuiltinType::UChar: return \"c_uchar\";\n case BuiltinType::SChar: return \"c_schar\";\n\n case BuiltinType::WChar_U:\n case BuiltinType::Char16:\n case BuiltinType::Char32:\n case BuiltinType::WChar_S:\n\n case BuiltinType::NullPtr:\n case BuiltinType::Dependent:\n case BuiltinType::Overload:\n\n case BuiltinType::ObjCId:\n case BuiltinType::ObjCClass:\n case BuiltinType::ObjCSel:\n \n default:\n return \"UnsupportedBuiltinType\";\n }\n }\n else if( const PointerType* pt = dyn_cast<PointerType>(t) )\n {\n QualType base_type = pt->getPointeeType();\n return zompTypeName(base_type.getTypePtrOrNull()) + \"*\";\n }\n else if( const ArrayType* at = dyn_cast<ArrayType>(t) )\n {\n assert( at );\n return errorType( \"bindgen does not support array types, yet\" );\n }\n else if( const FunctionType* ft = dyn_cast<FunctionType>(t) )\n {\n assert( ft );\n return errorType(\"bindgen does not support function types, yet\" );\n }\n else if( const TypedefType* tt = dyn_cast<TypedefType>(t) )\n {\n return tt->getDecl()->getName();\n \/\/ return zompTypeName(\n \/\/ tt->getDecl()->getCanonicalDecl()->getUnderlyingType().getTypePtrOrNull() );\n }\n else if( const EnumType* et = dyn_cast<EnumType>(t) )\n {\n return et->getDecl()->getNameAsString();\n }\n else if( const RecordType* rt = dyn_cast<RecordType>(t) )\n {\n return rt->getDecl()->getNameAsString();\n }\n else\n {\n return errorType(\"type not understood by bindgen\");\n }\n}\n\nstatic std::string zompTypeName( const QualType& qual_type )\n{\n std::string base_name = zompTypeName( qual_type.getTypePtrOrNull() );\n std::string name = base_name;\n\n if( qual_type.isConstQualified() )\n {\n name = \"\/* const *\/\" + name;\n }\n\n if( qual_type.isRestrictQualified() )\n {\n name = \"\/* restrict *\/\" + name;\n }\n\n if( qual_type.isVolatileQualified() )\n {\n name = \"\/* volatile *\/\" + name;\n }\n\n return name;\n}\n\n\/** Visitor which will handle every top level declaration *\/\nclass GenBindingsConsumer : public ASTConsumer\n{\n ASTContext* m_context;\n SourceManager* m_src_manager;\n FileID m_main_file_id;\n\npublic:\n GenBindingsConsumer() : m_context(0), m_src_manager(0)\n {\n }\n\n virtual void Initialize(ASTContext &context)\n {\n m_context = &context;\n m_src_manager = &context.getSourceManager();\n m_main_file_id = m_src_manager->getMainFileID();\n\n const char* main_file_name = m_src_manager->getFileEntryForID( m_main_file_id )->getName();\n llvm::outs() << \"\/\/\/\\n\";\n llvm::outs() << \"\/\/\/ Zomp bindings for \" << main_file_name << \"\\n\";\n llvm::outs() << \"\/\/\/\\n\";\n llvm::outs() << \"\\n\";\n }\n\n virtual void HandleTopLevelDecl(DeclGroupRef DG)\n {\n for (DeclGroupRef::iterator i = DG.begin(), e = DG.end(); i != e; ++i)\n {\n const Decl *D = *i;\n\n const TranslationUnitDecl* tu = D->getTranslationUnitDecl();\n if( !tu ) {\n continue;\n }\n\n const SourceLocation& loc = D->getLocation();\n if( m_src_manager->getFileID(loc) != m_main_file_id)\n {\n continue;\n }\n\n handleAs<VarDecl>(D) ||\n handleAs<FunctionDecl>(D) ||\n handleAs<TypedefDecl>(D) ||\n handleAs<RecordDecl>(D) ||\n handleAs<EnumDecl>(D) ||\n handleUnknown(D);\n }\n }\n\nprivate:\n\n enum HandlingResult { Handled, CouldNotHandle };\n\n template<typename T>\n bool handleAs(const Decl* D)\n {\n const T* typed_decl = dyn_cast<T>(D);\n if(typed_decl)\n {\n const bool result = handle(typed_decl) == Handled;\n \/\/ llvm::outs() << \"\\n\";\n return result;\n }\n else\n {\n return false;\n }\n }\n\n HandlingResult handle(const FunctionDecl* func_decl)\n {\n bool ignore = func_decl->isCXXClassMember()\n || func_decl->isCXXInstanceMember()\n || func_decl->isVariadic()\n || func_decl->isMain();\n\n if(ignore) {\n return CouldNotHandle;\n }\n\n llvm::outs() << \"nativeFn \";\n llvm::outs() << zompTypeName( func_decl->getResultType() ) << \" \";\n llvm::outs() << func_decl->getNameAsString() << \"(\";\n bool first_param = true;\n for( FunctionDecl::param_const_iterator param_i = func_decl->param_begin(),\n pend = func_decl->param_end( );\n param_i != pend;\n ++param_i, first_param = false )\n {\n ParmVarDecl* param = *param_i;\n\n if( !first_param ) {\n llvm::outs() << \", \";\n }\n\n QualType typesrc = param->getTypeSourceInfo()->getType();\n const Type* type = typesrc.getTypePtrOrNull();\n\n llvm::outs() << zompTypeName(type);\n\n if( param->getIdentifier() )\n {\n llvm::outs() << \" \"\n << param->getNameAsString();\n }\n\n if ( param->hasDefaultArg() )\n {\n llvm::outs() << \" \/* = ... *\/\";\n }\n }\n llvm::outs() << \")\\n\";\n\n return Handled;\n }\n\n HandlingResult handle(const VarDecl* var_decl)\n {\n llvm::outs() << \"nativeVar \"\n << zompTypeName( var_decl->getTypeSourceInfo()->getType() )\n << \" \"\n << var_decl->getNameAsString()\n << \"\\n\";\n\n return Handled;\n }\n\n bool handle(const TypedefDecl* type_decl)\n {\n QualType typesrc = type_decl->getUnderlyingType();\n const Type* type = typesrc.getTypePtrOrNull();\n std::string zomp_name = zompTypeName(type);\n\n bool handled = false;\n\n if( type )\n {\n if( zomp_name.empty() )\n {\n if( const RecordType* record_type = dyn_cast<RecordType>(type) )\n {\n handled = handle( record_type->getDecl(), type_decl->getName() );\n }\n else if( const EnumType* enum_type = dyn_cast<EnumType>(type) )\n {\n handled = handle( enum_type->getDecl(), type_decl->getName() );\n }\n }\n else\n {\n llvm::outs()\n << \"nativeTypedef \"\n << type_decl->getName()\n << \" \" << zomp_name << \"\\n\";\n handled = true;\n }\n }\n\n if( !handled )\n {\n llvm::outs()\n << \"\/\/ ignoring typedef \" << type_decl->getName() << \"\\n\";\n }\n\n return Handled;\n }\n\n bool handle(const RecordDecl* record_decl, llvm::StringRef name = \"\" )\n {\n if( name == \"\" )\n {\n name = record_decl->getName();\n }\n\n if( record_decl->isAnonymousStructOrUnion() ||\n name.empty() )\n {\n llvm::outs() << \"\/\/ ignoring anonymous struct\\n\";\n return Handled;\n }\n\n if( record_decl->isDefinition() )\n {\n llvm::outs() << \"nativeStruct \" << name << \":\\n\";\n\n typedef RecordDecl::field_iterator FieldIter;\n for( FieldIter fi = record_decl->field_begin(), fi_end = record_decl->field_end();\n fi != fi_end;\n ++fi )\n {\n const FieldDecl& field = **fi;\n if( field.isBitField() )\n {\n llvm::outs() << \" \/\/ ignored bitfield, not supported\\n\";\n }\n else\n {\n llvm::outs()\n << \" \"\n << zompTypeName( field.getType() )\n << \" \"\n << field.getName()\n << \"\\n\";\n }\n }\n\n llvm::outs() << \"end\\n\";\n }\n else\n {\n llvm::outs() << \"nativeStruct \" << name << \"\\n\";\n }\n\n return Handled;\n }\n\n bool handle(const EnumDecl* enum_decl, llvm::StringRef name = \"\")\n {\n if( name == \"\" )\n {\n name = enum_decl->getName();\n }\n\n if( name.empty() )\n {\n llvm::outs() << \"\/\/ ignoring name-less enum\\n\";\n }\n else if( enum_decl->isComplete() )\n {\n llvm::outs()\n << \"nativeEnum \"\n << name << \" \"\n << zompTypeName( enum_decl->getPromotionType() )\n << \":\\n\";\n\n typedef EnumDecl::enumerator_iterator EnumIter;\n for( EnumIter variant = enum_decl->enumerator_begin(), vend = enum_decl->enumerator_end();\n variant != vend;\n ++variant )\n {\n EnumConstantDecl* ecd = *variant;\n\n llvm::outs()\n << \" \"\n << ecd->getName() << \" \"\n << ecd->getInitVal()\n << \"\\n\";\n }\n \n llvm::outs() << \"end\\n\";\n }\n else\n {\n llvm::outs()\n << \"nativeEnum \"\n << name\n << \"\\n\";\n }\n\n return Handled;\n }\n\n bool handleUnknown(const Decl* D)\n {\n if(const NamedDecl* n = dyn_cast<NamedDecl>(D))\n {\n llvm::outs() << \"\/\/ ignored \" << n->getNameAsString() << \"\\n\";\n }\n else\n {\n llvm::outs() << \"\/\/ ignored nameless declaration\\n\";\n }\n\n return Handled;\n }\n};\n\n\/** The plugin class. Will instantiate GenBindingsConsumer and run it *\/\nclass GenBindingsAction : public PluginASTAction\n{\nprotected:\n ASTConsumer *CreateASTConsumer(CompilerInstance &CI, llvm::StringRef)\n {\n return new GenBindingsConsumer();\n }\n \n bool ParseArgs(\n const CompilerInstance &CI,\n const std::vector<std::string>& args )\n {\n for (unsigned i = 0, e = args.size(); i != e; ++i) {\n llvm::errs() << \"PrintFunctionNames arg = \" << args[i] << \"\\n\";\n \n \/\/ Example error handling.\n if (args[i] == \"-an-error\") {\n Diagnostic &D = CI.getDiagnostics();\n unsigned DiagID = D.getCustomDiagID(\n Diagnostic::Error, \"invalid argument '\" + args[i] + \"'\");\n D.Report(DiagID);\n return false;\n }\n }\n if (args.size() && args[0] == \"help\")\n PrintHelp(llvm::errs());\n \n return true;\n }\n\n void PrintHelp(llvm::raw_ostream& ros)\n {\n ros << \"Translates declarations of a C file into Zomp declarations.\\n\"\n \"This makes it easy to use C libaries from Zomp.\";\n }\n};\n \n} \/\/ anonymous namespace\n\nstatic FrontendPluginRegistry::Add<GenBindingsAction> X(\"gen-zomp-bindings\", \"Generate Zomp bindings\");\n\n<|endoftext|>"} {"text":"<commit_before>#ifndef regex_impl_hh_INCLUDED\n#define regex_impl_hh_INCLUDED\n\n#include \"exception.hh\"\n#include \"flags.hh\"\n#include \"ref_ptr.hh\"\n#include \"unicode.hh\"\n#include \"utf8.hh\"\n#include \"utf8_iterator.hh\"\n#include \"vector.hh\"\n\n#include <string.h>\n\nnamespace Kakoune\n{\n\nenum class MatchDirection\n{\n Forward,\n Backward\n};\n\nstruct CompiledRegex : RefCountable\n{\n enum Op : char\n {\n Match,\n Literal,\n LiteralIgnoreCase,\n AnyChar,\n Matcher,\n Jump,\n Split_PrioritizeParent,\n Split_PrioritizeChild,\n Save,\n LineStart,\n LineEnd,\n WordBoundary,\n NotWordBoundary,\n SubjectBegin,\n SubjectEnd,\n LookAhead,\n NegativeLookAhead,\n LookBehind,\n NegativeLookBehind,\n };\n\n struct Instruction\n {\n Op op;\n mutable bool processed;\n mutable bool scheduled;\n uint32_t param;\n };\n static_assert(sizeof(Instruction) == 8, \"\");\n\n explicit operator bool() const { return not instructions.empty(); }\n\n Vector<Instruction> instructions;\n Vector<std::function<bool (Codepoint)>> matchers;\n Vector<Codepoint> lookarounds;\n MatchDirection direction;\n size_t save_count;\n\n struct StartChars { bool map[256]; };\n std::unique_ptr<StartChars> start_chars;\n};\n\nCompiledRegex compile_regex(StringView re, MatchDirection direction = MatchDirection::Forward);\n\nenum class RegexExecFlags\n{\n None = 0,\n Search = 1 << 0,\n NotBeginOfLine = 1 << 1,\n NotEndOfLine = 1 << 2,\n NotBeginOfWord = 1 << 3,\n NotEndOfWord = 1 << 4,\n NotBeginOfSubject = 1 << 5,\n NotInitialNull = 1 << 6,\n AnyMatch = 1 << 7,\n NoSaves = 1 << 8,\n PrevAvailable = 1 << 9,\n};\n\nconstexpr bool with_bit_ops(Meta::Type<RegexExecFlags>) { return true; }\n\ntemplate<typename Iterator, MatchDirection direction>\nstruct ChooseUtf8It\n{\n using Type = utf8::iterator<Iterator>;\n};\n\ntemplate<typename Iterator>\nstruct ChooseUtf8It<Iterator, MatchDirection::Backward>\n{\n using Type = std::reverse_iterator<utf8::iterator<Iterator>>;\n};\n\ntemplate<typename Iterator, MatchDirection direction>\nclass ThreadedRegexVM\n{\npublic:\n ThreadedRegexVM(const CompiledRegex& program)\n : m_program{program}\n {\n kak_assert(m_program);\n if (direction != program.direction)\n throw runtime_error{\"Regex and VM direction mismatch\"};\n }\n\n ThreadedRegexVM(const ThreadedRegexVM&) = delete;\n ThreadedRegexVM& operator=(const ThreadedRegexVM&) = delete;\n\n ~ThreadedRegexVM()\n {\n for (auto* saves : m_saves)\n {\n for (size_t i = m_program.save_count-1; i > 0; --i)\n saves->pos[i].~Iterator();\n saves->~Saves();\n ::operator delete(saves);\n }\n }\n\n bool exec(Iterator begin, Iterator end, RegexExecFlags flags)\n {\n const bool forward = direction == MatchDirection::Forward;\n const bool prev_avail = flags & RegexExecFlags::PrevAvailable;\n m_begin = Utf8It{utf8::iterator<Iterator>{forward ? begin : end,\n prev_avail ? begin-1 : begin, end}};\n m_end = Utf8It{utf8::iterator<Iterator>{forward ? end : begin,\n prev_avail ? begin-1 : begin, end}};\n m_flags = flags;\n\n if (flags & RegexExecFlags::NotInitialNull and m_begin == m_end)\n return false;\n\n Vector<Thread> current_threads, next_threads;\n\n const bool no_saves = (m_flags & RegexExecFlags::NoSaves);\n Utf8It start{m_begin};\n\n const bool* start_chars = m_program.start_chars ? m_program.start_chars->map : nullptr;\n\n if (flags & RegexExecFlags::Search)\n to_next_start(start, m_end, start_chars);\n\n if (exec_from(start, no_saves ? nullptr : new_saves<false>(nullptr),\n current_threads, next_threads))\n return true;\n\n if (not (flags & RegexExecFlags::Search))\n return false;\n\n do\n {\n to_next_start(++start, m_end, start_chars);\n if (exec_from(start, no_saves ? nullptr : new_saves<false>(nullptr),\n current_threads, next_threads))\n return true;\n }\n while (start != m_end);\n\n return false;\n }\n\n ArrayView<const Iterator> captures() const\n {\n if (m_captures)\n return { m_captures->pos, m_program.save_count };\n return {};\n }\n\nprivate:\n struct Saves\n {\n int refcount;\n Iterator pos[1];\n };\n\n template<bool copy>\n Saves* new_saves(Iterator* pos)\n {\n kak_assert(not copy or pos != nullptr);\n const auto count = m_program.save_count;\n if (not m_free_saves.empty())\n {\n Saves* res = m_free_saves.back();\n m_free_saves.pop_back();\n res->refcount = 1;\n if (copy)\n std::copy(pos, pos + count, res->pos);\n else\n std::fill(res->pos, res->pos + count, Iterator{});\n\n return res;\n }\n\n void* ptr = ::operator new (sizeof(Saves) + (count-1) * sizeof(Iterator));\n Saves* saves = new (ptr) Saves{1, copy ? pos[0] : Iterator{}};\n for (size_t i = 1; i < count; ++i)\n new (&saves->pos[i]) Iterator{copy ? pos[i] : Iterator{}};\n m_saves.push_back(saves);\n return saves;\n }\n\n void release_saves(Saves* saves)\n {\n if (saves and --saves->refcount == 0)\n m_free_saves.push_back(saves);\n };\n\n struct Thread\n {\n uint32_t inst;\n Saves* saves;\n };\n\n using Utf8It = typename ChooseUtf8It<Iterator, direction>::Type;\n\n enum class StepResult { Consumed, Matched, Failed };\n\n \/\/ Steps a thread until it consumes the current character, matches or fail\n StepResult step(const Utf8It& pos, Thread& thread, Vector<Thread>& threads)\n {\n while (true)\n {\n auto& inst = m_program.instructions[thread.inst++];\n if (inst.processed)\n return StepResult::Failed;\n inst.processed = true;\n\n switch (inst.op)\n {\n case CompiledRegex::Literal:\n if (pos != m_end and inst.param == *pos)\n return StepResult::Consumed;\n return StepResult::Failed;\n case CompiledRegex::LiteralIgnoreCase:\n if (pos != m_end and inst.param == to_lower(*pos))\n return StepResult::Consumed;\n return StepResult::Failed;\n case CompiledRegex::AnyChar:\n return StepResult::Consumed;\n case CompiledRegex::Jump:\n thread.inst = inst.param;\n break;\n case CompiledRegex::Split_PrioritizeParent:\n {\n if (thread.saves)\n ++thread.saves->refcount;\n threads.push_back({inst.param, thread.saves});\n break;\n }\n case CompiledRegex::Split_PrioritizeChild:\n {\n if (thread.saves)\n ++thread.saves->refcount;\n threads.push_back({thread.inst, thread.saves});\n thread.inst = inst.param;\n break;\n }\n case CompiledRegex::Save:\n {\n if (thread.saves == nullptr)\n break;\n if (thread.saves->refcount > 1)\n {\n --thread.saves->refcount;\n thread.saves = new_saves<true>(thread.saves->pos);\n }\n thread.saves->pos[inst.param] = get_base(pos);\n break;\n }\n case CompiledRegex::Matcher:\n if (pos == m_end)\n return StepResult::Failed;\n return m_program.matchers[inst.param](*pos) ?\n StepResult::Consumed : StepResult::Failed;\n case CompiledRegex::LineStart:\n if (not is_line_start(pos))\n return StepResult::Failed;\n break;\n case CompiledRegex::LineEnd:\n if (not is_line_end(pos))\n return StepResult::Failed;\n break;\n case CompiledRegex::WordBoundary:\n if (not is_word_boundary(pos))\n return StepResult::Failed;\n break;\n case CompiledRegex::NotWordBoundary:\n if (is_word_boundary(pos))\n return StepResult::Failed;\n break;\n case CompiledRegex::SubjectBegin:\n if (pos != m_begin or (m_flags & RegexExecFlags::NotBeginOfSubject))\n return StepResult::Failed;\n break;\n case CompiledRegex::SubjectEnd:\n if (pos != m_end)\n return StepResult::Failed;\n break;\n case CompiledRegex::LookAhead:\n case CompiledRegex::NegativeLookAhead:\n {\n auto ref = m_program.lookarounds.begin() + inst.param;\n for (auto it = pos; *ref != -1 and it != m_end; ++it, ++ref)\n if (*it != *ref)\n break;\n if ((inst.op == CompiledRegex::LookAhead and *ref != -1) or\n (inst.op == CompiledRegex::NegativeLookAhead and *ref == -1))\n return StepResult::Failed;\n break;\n }\n case CompiledRegex::LookBehind:\n case CompiledRegex::NegativeLookBehind:\n {\n auto ref = m_program.lookarounds.begin() + inst.param;\n for (auto it = pos; *ref != -1 and it > m_begin; --it, ++ref)\n if (*(it-1) != *ref)\n break;\n if ((inst.op == CompiledRegex::LookBehind and *ref != -1) or\n (inst.op == CompiledRegex::NegativeLookBehind and *ref == -1))\n return StepResult::Failed;\n break;\n }\n case CompiledRegex::Match:\n return StepResult::Matched;\n }\n }\n return StepResult::Failed;\n }\n\n bool exec_from(Utf8It pos, Saves* initial_saves, Vector<Thread>& current_threads, Vector<Thread>& next_threads)\n {\n current_threads.push_back({0, initial_saves});\n next_threads.clear();\n\n bool found_match = false;\n while (true) \/\/ Iterate on all codepoints and once at the end\n {\n for (auto& inst : m_program.instructions)\n {\n inst.processed = false;\n inst.scheduled = false;\n }\n\n while (not current_threads.empty())\n {\n auto thread = current_threads.back();\n current_threads.pop_back();\n switch (step(pos, thread, current_threads))\n {\n case StepResult::Matched:\n if ((pos != m_end and not (m_flags & RegexExecFlags::Search)) or\n (m_flags & RegexExecFlags::NotInitialNull and pos == m_begin))\n {\n release_saves(thread.saves);\n continue;\n }\n\n release_saves(m_captures);\n m_captures = thread.saves;\n if (pos == m_end or (m_flags & RegexExecFlags::AnyMatch))\n return true;\n\n found_match = true;\n current_threads.clear(); \/\/ remove this and lower priority threads\n break;\n case StepResult::Failed:\n release_saves(thread.saves);\n break;\n case StepResult::Consumed:\n if (m_program.instructions[thread.inst].scheduled)\n {\n release_saves(thread.saves);\n continue;\n }\n m_program.instructions[thread.inst].scheduled = true;\n next_threads.push_back(thread);\n break;\n }\n }\n if (pos == m_end or next_threads.empty())\n return found_match;\n\n std::swap(current_threads, next_threads);\n std::reverse(current_threads.begin(), current_threads.end());\n ++pos;\n }\n }\n\n void to_next_start(Utf8It& start, const Utf8It& end, const bool* start_chars)\n {\n if (not start_chars)\n return;\n\n while (start != end and *start >= 0 and *start < 256 and\n not start_chars[*start])\n ++start;\n }\n\n bool is_line_start(const Utf8It& pos) const\n {\n if (not (m_flags & RegexExecFlags::PrevAvailable) and pos == m_begin)\n return not (m_flags & RegexExecFlags::NotBeginOfLine);\n return *(pos-1) == '\\n';\n }\n\n bool is_line_end(const Utf8It& pos) const\n {\n if (pos == m_end)\n return not (m_flags & RegexExecFlags::NotEndOfLine);\n return *pos == '\\n';\n }\n\n bool is_word_boundary(const Utf8It& pos) const\n {\n if (not (m_flags & RegexExecFlags::PrevAvailable) and pos == m_begin)\n return not (m_flags & RegexExecFlags::NotBeginOfWord);\n if (pos == m_end)\n return not (m_flags & RegexExecFlags::NotEndOfWord);\n return is_word(*(pos-1)) != is_word(*pos);\n }\n\n static const Iterator& get_base(const utf8::iterator<Iterator>& it) { return it.base(); }\n static Iterator get_base(const std::reverse_iterator<utf8::iterator<Iterator>>& it) { return it.base().base(); }\n\n const CompiledRegex& m_program;\n\n Utf8It m_begin;\n Utf8It m_end;\n RegexExecFlags m_flags;\n\n Vector<Saves*> m_saves;\n Vector<Saves*> m_free_saves;\n\n Saves* m_captures = nullptr;\n};\n\ntemplate<typename It, MatchDirection direction = MatchDirection::Forward>\nbool regex_match(It begin, It end, const CompiledRegex& re, RegexExecFlags flags = RegexExecFlags::None)\n{\n ThreadedRegexVM<It, direction> vm{re};\n return vm.exec(begin, end, (RegexExecFlags)(flags & ~(RegexExecFlags::Search)) |\n RegexExecFlags::AnyMatch | RegexExecFlags::NoSaves);\n}\n\ntemplate<typename It, MatchDirection direction = MatchDirection::Forward>\nbool regex_match(It begin, It end, Vector<It>& captures, const CompiledRegex& re,\n RegexExecFlags flags = RegexExecFlags::None)\n{\n ThreadedRegexVM<It, direction> vm{re};\n if (vm.exec(begin, end, flags & ~(RegexExecFlags::Search)))\n {\n std::copy(vm.captures().begin(), vm.captures().end(), std::back_inserter(captures));\n return true;\n }\n return false;\n}\n\ntemplate<typename It, MatchDirection direction = MatchDirection::Forward>\nbool regex_search(It begin, It end, const CompiledRegex& re,\n RegexExecFlags flags = RegexExecFlags::None)\n{\n ThreadedRegexVM<It, direction> vm{re};\n return vm.exec(begin, end, flags | RegexExecFlags::Search | RegexExecFlags::AnyMatch | RegexExecFlags::NoSaves);\n}\n\ntemplate<typename It, MatchDirection direction = MatchDirection::Forward>\nbool regex_search(It begin, It end, Vector<It>& captures, const CompiledRegex& re,\n RegexExecFlags flags = RegexExecFlags::None)\n{\n ThreadedRegexVM<It, direction> vm{re};\n if (vm.exec(begin, end, flags | RegexExecFlags::Search))\n {\n std::copy(vm.captures().begin(), vm.captures().end(), std::back_inserter(captures));\n return true;\n }\n return false;\n}\n\n}\n\n#endif \/\/ regex_impl_hh_INCLUDED\n<commit_msg>Regex: add elided braces to fix compilation on older gcc<commit_after>#ifndef regex_impl_hh_INCLUDED\n#define regex_impl_hh_INCLUDED\n\n#include \"exception.hh\"\n#include \"flags.hh\"\n#include \"ref_ptr.hh\"\n#include \"unicode.hh\"\n#include \"utf8.hh\"\n#include \"utf8_iterator.hh\"\n#include \"vector.hh\"\n\n#include <string.h>\n\nnamespace Kakoune\n{\n\nenum class MatchDirection\n{\n Forward,\n Backward\n};\n\nstruct CompiledRegex : RefCountable\n{\n enum Op : char\n {\n Match,\n Literal,\n LiteralIgnoreCase,\n AnyChar,\n Matcher,\n Jump,\n Split_PrioritizeParent,\n Split_PrioritizeChild,\n Save,\n LineStart,\n LineEnd,\n WordBoundary,\n NotWordBoundary,\n SubjectBegin,\n SubjectEnd,\n LookAhead,\n NegativeLookAhead,\n LookBehind,\n NegativeLookBehind,\n };\n\n struct Instruction\n {\n Op op;\n mutable bool processed;\n mutable bool scheduled;\n uint32_t param;\n };\n static_assert(sizeof(Instruction) == 8, \"\");\n\n explicit operator bool() const { return not instructions.empty(); }\n\n Vector<Instruction> instructions;\n Vector<std::function<bool (Codepoint)>> matchers;\n Vector<Codepoint> lookarounds;\n MatchDirection direction;\n size_t save_count;\n\n struct StartChars { bool map[256]; };\n std::unique_ptr<StartChars> start_chars;\n};\n\nCompiledRegex compile_regex(StringView re, MatchDirection direction = MatchDirection::Forward);\n\nenum class RegexExecFlags\n{\n None = 0,\n Search = 1 << 0,\n NotBeginOfLine = 1 << 1,\n NotEndOfLine = 1 << 2,\n NotBeginOfWord = 1 << 3,\n NotEndOfWord = 1 << 4,\n NotBeginOfSubject = 1 << 5,\n NotInitialNull = 1 << 6,\n AnyMatch = 1 << 7,\n NoSaves = 1 << 8,\n PrevAvailable = 1 << 9,\n};\n\nconstexpr bool with_bit_ops(Meta::Type<RegexExecFlags>) { return true; }\n\ntemplate<typename Iterator, MatchDirection direction>\nstruct ChooseUtf8It\n{\n using Type = utf8::iterator<Iterator>;\n};\n\ntemplate<typename Iterator>\nstruct ChooseUtf8It<Iterator, MatchDirection::Backward>\n{\n using Type = std::reverse_iterator<utf8::iterator<Iterator>>;\n};\n\ntemplate<typename Iterator, MatchDirection direction>\nclass ThreadedRegexVM\n{\npublic:\n ThreadedRegexVM(const CompiledRegex& program)\n : m_program{program}\n {\n kak_assert(m_program);\n if (direction != program.direction)\n throw runtime_error{\"Regex and VM direction mismatch\"};\n }\n\n ThreadedRegexVM(const ThreadedRegexVM&) = delete;\n ThreadedRegexVM& operator=(const ThreadedRegexVM&) = delete;\n\n ~ThreadedRegexVM()\n {\n for (auto* saves : m_saves)\n {\n for (size_t i = m_program.save_count-1; i > 0; --i)\n saves->pos[i].~Iterator();\n saves->~Saves();\n ::operator delete(saves);\n }\n }\n\n bool exec(Iterator begin, Iterator end, RegexExecFlags flags)\n {\n const bool forward = direction == MatchDirection::Forward;\n const bool prev_avail = flags & RegexExecFlags::PrevAvailable;\n m_begin = Utf8It{utf8::iterator<Iterator>{forward ? begin : end,\n prev_avail ? begin-1 : begin, end}};\n m_end = Utf8It{utf8::iterator<Iterator>{forward ? end : begin,\n prev_avail ? begin-1 : begin, end}};\n m_flags = flags;\n\n if (flags & RegexExecFlags::NotInitialNull and m_begin == m_end)\n return false;\n\n Vector<Thread> current_threads, next_threads;\n\n const bool no_saves = (m_flags & RegexExecFlags::NoSaves);\n Utf8It start{m_begin};\n\n const bool* start_chars = m_program.start_chars ? m_program.start_chars->map : nullptr;\n\n if (flags & RegexExecFlags::Search)\n to_next_start(start, m_end, start_chars);\n\n if (exec_from(start, no_saves ? nullptr : new_saves<false>(nullptr),\n current_threads, next_threads))\n return true;\n\n if (not (flags & RegexExecFlags::Search))\n return false;\n\n do\n {\n to_next_start(++start, m_end, start_chars);\n if (exec_from(start, no_saves ? nullptr : new_saves<false>(nullptr),\n current_threads, next_threads))\n return true;\n }\n while (start != m_end);\n\n return false;\n }\n\n ArrayView<const Iterator> captures() const\n {\n if (m_captures)\n return { m_captures->pos, m_program.save_count };\n return {};\n }\n\nprivate:\n struct Saves\n {\n int refcount;\n Iterator pos[1];\n };\n\n template<bool copy>\n Saves* new_saves(Iterator* pos)\n {\n kak_assert(not copy or pos != nullptr);\n const auto count = m_program.save_count;\n if (not m_free_saves.empty())\n {\n Saves* res = m_free_saves.back();\n m_free_saves.pop_back();\n res->refcount = 1;\n if (copy)\n std::copy(pos, pos + count, res->pos);\n else\n std::fill(res->pos, res->pos + count, Iterator{});\n\n return res;\n }\n\n void* ptr = ::operator new (sizeof(Saves) + (count-1) * sizeof(Iterator));\n Saves* saves = new (ptr) Saves{1, {copy ? pos[0] : Iterator{}}};\n for (size_t i = 1; i < count; ++i)\n new (&saves->pos[i]) Iterator{copy ? pos[i] : Iterator{}};\n m_saves.push_back(saves);\n return saves;\n }\n\n void release_saves(Saves* saves)\n {\n if (saves and --saves->refcount == 0)\n m_free_saves.push_back(saves);\n };\n\n struct Thread\n {\n uint32_t inst;\n Saves* saves;\n };\n\n using Utf8It = typename ChooseUtf8It<Iterator, direction>::Type;\n\n enum class StepResult { Consumed, Matched, Failed };\n\n \/\/ Steps a thread until it consumes the current character, matches or fail\n StepResult step(const Utf8It& pos, Thread& thread, Vector<Thread>& threads)\n {\n while (true)\n {\n auto& inst = m_program.instructions[thread.inst++];\n if (inst.processed)\n return StepResult::Failed;\n inst.processed = true;\n\n switch (inst.op)\n {\n case CompiledRegex::Literal:\n if (pos != m_end and inst.param == *pos)\n return StepResult::Consumed;\n return StepResult::Failed;\n case CompiledRegex::LiteralIgnoreCase:\n if (pos != m_end and inst.param == to_lower(*pos))\n return StepResult::Consumed;\n return StepResult::Failed;\n case CompiledRegex::AnyChar:\n return StepResult::Consumed;\n case CompiledRegex::Jump:\n thread.inst = inst.param;\n break;\n case CompiledRegex::Split_PrioritizeParent:\n {\n if (thread.saves)\n ++thread.saves->refcount;\n threads.push_back({inst.param, thread.saves});\n break;\n }\n case CompiledRegex::Split_PrioritizeChild:\n {\n if (thread.saves)\n ++thread.saves->refcount;\n threads.push_back({thread.inst, thread.saves});\n thread.inst = inst.param;\n break;\n }\n case CompiledRegex::Save:\n {\n if (thread.saves == nullptr)\n break;\n if (thread.saves->refcount > 1)\n {\n --thread.saves->refcount;\n thread.saves = new_saves<true>(thread.saves->pos);\n }\n thread.saves->pos[inst.param] = get_base(pos);\n break;\n }\n case CompiledRegex::Matcher:\n if (pos == m_end)\n return StepResult::Failed;\n return m_program.matchers[inst.param](*pos) ?\n StepResult::Consumed : StepResult::Failed;\n case CompiledRegex::LineStart:\n if (not is_line_start(pos))\n return StepResult::Failed;\n break;\n case CompiledRegex::LineEnd:\n if (not is_line_end(pos))\n return StepResult::Failed;\n break;\n case CompiledRegex::WordBoundary:\n if (not is_word_boundary(pos))\n return StepResult::Failed;\n break;\n case CompiledRegex::NotWordBoundary:\n if (is_word_boundary(pos))\n return StepResult::Failed;\n break;\n case CompiledRegex::SubjectBegin:\n if (pos != m_begin or (m_flags & RegexExecFlags::NotBeginOfSubject))\n return StepResult::Failed;\n break;\n case CompiledRegex::SubjectEnd:\n if (pos != m_end)\n return StepResult::Failed;\n break;\n case CompiledRegex::LookAhead:\n case CompiledRegex::NegativeLookAhead:\n {\n auto ref = m_program.lookarounds.begin() + inst.param;\n for (auto it = pos; *ref != -1 and it != m_end; ++it, ++ref)\n if (*it != *ref)\n break;\n if ((inst.op == CompiledRegex::LookAhead and *ref != -1) or\n (inst.op == CompiledRegex::NegativeLookAhead and *ref == -1))\n return StepResult::Failed;\n break;\n }\n case CompiledRegex::LookBehind:\n case CompiledRegex::NegativeLookBehind:\n {\n auto ref = m_program.lookarounds.begin() + inst.param;\n for (auto it = pos; *ref != -1 and it > m_begin; --it, ++ref)\n if (*(it-1) != *ref)\n break;\n if ((inst.op == CompiledRegex::LookBehind and *ref != -1) or\n (inst.op == CompiledRegex::NegativeLookBehind and *ref == -1))\n return StepResult::Failed;\n break;\n }\n case CompiledRegex::Match:\n return StepResult::Matched;\n }\n }\n return StepResult::Failed;\n }\n\n bool exec_from(Utf8It pos, Saves* initial_saves, Vector<Thread>& current_threads, Vector<Thread>& next_threads)\n {\n current_threads.push_back({0, initial_saves});\n next_threads.clear();\n\n bool found_match = false;\n while (true) \/\/ Iterate on all codepoints and once at the end\n {\n for (auto& inst : m_program.instructions)\n {\n inst.processed = false;\n inst.scheduled = false;\n }\n\n while (not current_threads.empty())\n {\n auto thread = current_threads.back();\n current_threads.pop_back();\n switch (step(pos, thread, current_threads))\n {\n case StepResult::Matched:\n if ((pos != m_end and not (m_flags & RegexExecFlags::Search)) or\n (m_flags & RegexExecFlags::NotInitialNull and pos == m_begin))\n {\n release_saves(thread.saves);\n continue;\n }\n\n release_saves(m_captures);\n m_captures = thread.saves;\n if (pos == m_end or (m_flags & RegexExecFlags::AnyMatch))\n return true;\n\n found_match = true;\n current_threads.clear(); \/\/ remove this and lower priority threads\n break;\n case StepResult::Failed:\n release_saves(thread.saves);\n break;\n case StepResult::Consumed:\n if (m_program.instructions[thread.inst].scheduled)\n {\n release_saves(thread.saves);\n continue;\n }\n m_program.instructions[thread.inst].scheduled = true;\n next_threads.push_back(thread);\n break;\n }\n }\n if (pos == m_end or next_threads.empty())\n return found_match;\n\n std::swap(current_threads, next_threads);\n std::reverse(current_threads.begin(), current_threads.end());\n ++pos;\n }\n }\n\n void to_next_start(Utf8It& start, const Utf8It& end, const bool* start_chars)\n {\n if (not start_chars)\n return;\n\n while (start != end and *start >= 0 and *start < 256 and\n not start_chars[*start])\n ++start;\n }\n\n bool is_line_start(const Utf8It& pos) const\n {\n if (not (m_flags & RegexExecFlags::PrevAvailable) and pos == m_begin)\n return not (m_flags & RegexExecFlags::NotBeginOfLine);\n return *(pos-1) == '\\n';\n }\n\n bool is_line_end(const Utf8It& pos) const\n {\n if (pos == m_end)\n return not (m_flags & RegexExecFlags::NotEndOfLine);\n return *pos == '\\n';\n }\n\n bool is_word_boundary(const Utf8It& pos) const\n {\n if (not (m_flags & RegexExecFlags::PrevAvailable) and pos == m_begin)\n return not (m_flags & RegexExecFlags::NotBeginOfWord);\n if (pos == m_end)\n return not (m_flags & RegexExecFlags::NotEndOfWord);\n return is_word(*(pos-1)) != is_word(*pos);\n }\n\n static const Iterator& get_base(const utf8::iterator<Iterator>& it) { return it.base(); }\n static Iterator get_base(const std::reverse_iterator<utf8::iterator<Iterator>>& it) { return it.base().base(); }\n\n const CompiledRegex& m_program;\n\n Utf8It m_begin;\n Utf8It m_end;\n RegexExecFlags m_flags;\n\n Vector<Saves*> m_saves;\n Vector<Saves*> m_free_saves;\n\n Saves* m_captures = nullptr;\n};\n\ntemplate<typename It, MatchDirection direction = MatchDirection::Forward>\nbool regex_match(It begin, It end, const CompiledRegex& re, RegexExecFlags flags = RegexExecFlags::None)\n{\n ThreadedRegexVM<It, direction> vm{re};\n return vm.exec(begin, end, (RegexExecFlags)(flags & ~(RegexExecFlags::Search)) |\n RegexExecFlags::AnyMatch | RegexExecFlags::NoSaves);\n}\n\ntemplate<typename It, MatchDirection direction = MatchDirection::Forward>\nbool regex_match(It begin, It end, Vector<It>& captures, const CompiledRegex& re,\n RegexExecFlags flags = RegexExecFlags::None)\n{\n ThreadedRegexVM<It, direction> vm{re};\n if (vm.exec(begin, end, flags & ~(RegexExecFlags::Search)))\n {\n std::copy(vm.captures().begin(), vm.captures().end(), std::back_inserter(captures));\n return true;\n }\n return false;\n}\n\ntemplate<typename It, MatchDirection direction = MatchDirection::Forward>\nbool regex_search(It begin, It end, const CompiledRegex& re,\n RegexExecFlags flags = RegexExecFlags::None)\n{\n ThreadedRegexVM<It, direction> vm{re};\n return vm.exec(begin, end, flags | RegexExecFlags::Search | RegexExecFlags::AnyMatch | RegexExecFlags::NoSaves);\n}\n\ntemplate<typename It, MatchDirection direction = MatchDirection::Forward>\nbool regex_search(It begin, It end, Vector<It>& captures, const CompiledRegex& re,\n RegexExecFlags flags = RegexExecFlags::None)\n{\n ThreadedRegexVM<It, direction> vm{re};\n if (vm.exec(begin, end, flags | RegexExecFlags::Search))\n {\n std::copy(vm.captures().begin(), vm.captures().end(), std::back_inserter(captures));\n return true;\n }\n return false;\n}\n\n}\n\n#endif \/\/ regex_impl_hh_INCLUDED\n<|endoftext|>"} {"text":"<commit_before>\/\/ Copyright (c) 2009-2017 The Regents of the University of Michigan\n\/\/ This file is part of the HOOMD-blue project, released under the BSD 3-Clause License.\n\n\n\/\/ Maintainer: jglaser\n\n#include \"MolecularForceCompute.h\"\n\n#include \"hoomd\/CachedAllocator.h\"\n#include \"hoomd\/Autotuner.h\"\n\n#ifdef ENABLE_CUDA\n#include \"MolecularForceCompute.cuh\"\n#endif\n\n#include <string.h>\n#include <map>\n\nnamespace py = pybind11;\n\n\/*! \\file MolecularForceCompute.cc\n \\brief Contains code for the MolecularForceCompute class\n*\/\n\n\/*! \\param sysdef SystemDefinition containing the ParticleData to compute forces on\n*\/\nMolecularForceCompute::MolecularForceCompute(std::shared_ptr<SystemDefinition> sysdef)\n : ForceConstraint(sysdef), m_molecule_tag(m_exec_conf), m_n_molecules_global(0),\n m_molecule_list(m_exec_conf), m_molecule_length(m_exec_conf), m_molecule_order(m_exec_conf),\n m_dirty(true), m_molecule_idx(m_exec_conf)\n {\n \/\/ connect to the ParticleData to recieve notifications when particles change order in memory\n m_pdata->getParticleSortSignal().connect<MolecularForceCompute, &MolecularForceCompute::setDirty>(this);\n\n #ifdef ENABLE_CUDA\n if (m_exec_conf->isCUDAEnabled())\n {\n \/\/ initialize autotuner\n std::vector<unsigned int> valid_params;\n for (unsigned int block_size = 32; block_size <= 1024; block_size += 32)\n valid_params.push_back(block_size);\n\n m_tuner_fill.reset(new Autotuner(valid_params, 5, 100000, \"fill_molecule_table\", this->m_exec_conf));\n }\n #endif\n }\n\n\/\/! Destructor\nMolecularForceCompute::~MolecularForceCompute()\n {\n m_pdata->getParticleSortSignal().disconnect<MolecularForceCompute, &MolecularForceCompute::setDirty>(this);\n }\n\n#ifdef ENABLE_CUDA\nvoid MolecularForceCompute::initMoleculesGPU()\n {\n if (m_prof) m_prof->push(m_exec_conf,\"init molecules\");\n\n unsigned int nptl_local = m_pdata->getN() + m_pdata->getNGhosts();\n\n unsigned int n_local_molecules = 0;\n\n \/\/ maximum molecule length\n unsigned int nmax = 0;\n\n \/\/ number of local particles that are part of molecules\n unsigned int n_local_ptls_in_molecules = 0;\n\n \/\/ resize to maximum possible number of local molecules\n m_molecule_length.resize(nptl_local);\n m_molecule_idx.resize(nptl_local);\n\n ScopedAllocation<unsigned int> d_idx_sorted_by_tag(m_exec_conf->getCachedAllocator(), nptl_local);\n ScopedAllocation<unsigned int> d_local_molecule_tags(m_exec_conf->getCachedAllocator(), nptl_local);\n\n {\n ArrayHandle<unsigned int> d_molecule_tag(m_molecule_tag, access_location::device, access_mode::read);\n ArrayHandle<unsigned int> d_tag(m_pdata->getTags(), access_location::device, access_mode::read);\n ArrayHandle<unsigned int> d_molecule_length(m_molecule_length, access_location::device, access_mode::overwrite);\n ArrayHandle<unsigned int> d_molecule_idx(m_molecule_idx, access_location::device, access_mode::overwrite);\n\n \/\/ temporary buffers\n ScopedAllocation<unsigned int> d_local_unique_molecule_tags(m_exec_conf->getCachedAllocator(), m_n_molecules_global);\n ScopedAllocation<unsigned int> d_sorted_by_tag(m_exec_conf->getCachedAllocator(), nptl_local);\n\n gpu_sort_by_molecule(nptl_local,\n d_tag.data,\n d_molecule_tag.data,\n d_local_molecule_tags.data,\n d_local_unique_molecule_tags.data,\n d_molecule_idx.data,\n d_sorted_by_tag.data,\n d_idx_sorted_by_tag.data,\n d_molecule_length.data,\n n_local_molecules,\n nmax,\n n_local_ptls_in_molecules,\n m_exec_conf->getCachedAllocator());\n\n if (m_exec_conf->isCUDAErrorCheckingEnabled())\n CHECK_CUDA_ERROR();\n }\n\n \/\/ set up indexer\n m_molecule_indexer = Index2D(n_local_molecules, nmax);\n\n m_exec_conf->msg->notice(7) << \"MolecularForceCompute: \" << n_local_molecules << \" molecules, \"\n << n_local_ptls_in_molecules << \" particles in molceules \" << std::endl;\n\n \/\/ resize molecule list\n m_molecule_list.resize(m_molecule_indexer.getNumElements());\n\n \/\/ resize molecule lookup to size of local particle data\n m_molecule_order.resize(m_pdata->getMaxN());\n\n {\n \/\/ write out molecule list and order\n ArrayHandle<unsigned int> d_molecule_list(m_molecule_list, access_location::device, access_mode::overwrite);\n ArrayHandle<unsigned int> d_molecule_order(m_molecule_order, access_location::device, access_mode::overwrite);\n ArrayHandle<unsigned int> d_molecule_idx(m_molecule_idx, access_location::device, access_mode::read);\n\n m_tuner_fill->begin();\n unsigned int block_size = m_tuner_fill->getParam();\n\n gpu_fill_molecule_table(nptl_local,\n n_local_ptls_in_molecules,\n m_molecule_indexer,\n d_molecule_idx.data,\n d_local_molecule_tags.data,\n d_idx_sorted_by_tag.data,\n d_molecule_list.data,\n d_molecule_order.data,\n block_size,\n m_exec_conf->getCachedAllocator());\n\n if (m_exec_conf->isCUDAErrorCheckingEnabled())\n CHECK_CUDA_ERROR();\n\n m_tuner_fill->end();\n }\n\n if (m_prof) m_prof->pop(m_exec_conf);\n }\n#endif\n\nvoid MolecularForceCompute::initMolecules()\n {\n \/\/ return early if no molecules are defined\n if (!m_n_molecules_global) return;\n\n m_exec_conf->msg->notice(7) << \"MolecularForceCompute initializing molecule table\" << std::endl;\n\n #ifdef ENABLE_CUDA\n if (m_exec_conf->isCUDAEnabled())\n {\n initMoleculesGPU();\n return;\n }\n #endif\n\n if (m_prof) m_prof->push(\"init molecules\");\n\n \/\/ construct local molecule table\n unsigned int nptl_local = m_pdata->getN() + m_pdata->getNGhosts();\n\n ArrayHandle<unsigned int> h_molecule_tag(m_molecule_tag, access_location::host, access_mode::read);\n ArrayHandle<unsigned int> h_tag(m_pdata->getTags(), access_location::host, access_mode::read);\n\n std::set<unsigned int> local_molecule_tags;\n\n unsigned int n_local_molecules = 0;\n\n std::vector<unsigned int> local_molecule_idx(nptl_local, NO_MOLECULE);\n\n \/\/ resize molecule lookup to size of local particle data\n m_molecule_order.resize(m_pdata->getMaxN());\n\n \/\/ sort local molecules lexicographically by molecule and by ptl tag\n std::map<unsigned int, std::set<unsigned int> > local_molecules_sorted;\n\n for (unsigned int iptl = 0; iptl < nptl_local; ++iptl)\n {\n unsigned int tag = h_tag.data[iptl];\n assert(tag < m_molecule_tag.getNumElements());\n\n unsigned int mol_tag = h_molecule_tag.data[tag];\n if (mol_tag == NO_MOLECULE) continue;\n\n auto it = local_molecules_sorted.find(mol_tag);\n if (it == local_molecules_sorted.end())\n {\n auto res = local_molecules_sorted.insert(std::make_pair(mol_tag,std::set<unsigned int>()));\n assert(res.second);\n it = res.first;\n }\n\n it->second.insert(tag);\n }\n\n n_local_molecules = local_molecules_sorted.size();\n\n m_exec_conf->msg->notice(7) << \"MolecularForceCompute: \" << n_local_molecules << \" molecules\" << std::endl;\n\n m_molecule_length.resize(n_local_molecules);\n\n ArrayHandle<unsigned int> h_molecule_length(m_molecule_length, access_location::host, access_mode::overwrite);\n\n \/\/ reset lengths\n for (unsigned int imol = 0; imol < n_local_molecules; ++imol)\n {\n h_molecule_length.data[imol] = 0;\n }\n\n \/\/ count molecule lengths\n unsigned int i = 0;\n for (auto it = local_molecules_sorted.begin(); it != local_molecules_sorted.end(); ++it)\n {\n h_molecule_length.data[i++] = it->second.size();\n }\n\n \/\/ find maximum length\n unsigned nmax = 0;\n for (unsigned int imol = 0; imol < n_local_molecules; ++imol)\n {\n if (h_molecule_length.data[imol] > nmax)\n {\n nmax = h_molecule_length.data[imol];\n }\n }\n\n \/\/ set up indexer\n m_molecule_indexer = Index2D(n_local_molecules, nmax);\n\n \/\/ resize molecule list\n m_molecule_list.resize(m_molecule_indexer.getNumElements());\n\n \/\/ reset lengths again\n for (unsigned int imol = 0; imol < n_local_molecules; ++imol)\n {\n h_molecule_length.data[imol] = 0;\n }\n\n \/\/ reset molecule order\n ArrayHandle<unsigned int> h_molecule_order(m_molecule_order, access_location::host, access_mode::overwrite);\n memset(h_molecule_order.data, 0, sizeof(unsigned int)*(m_pdata->getN() + m_pdata->getNGhosts()));\n\n \/\/ resize reverse-lookup\n m_molecule_idx.resize(nptl_local);\n\n \/\/ fill molecule list\n ArrayHandle<unsigned int> h_molecule_list(m_molecule_list, access_location::host, access_mode::overwrite);\n ArrayHandle<unsigned int> h_molecule_idx(m_molecule_idx, access_location::host, access_mode::overwrite);\n ArrayHandle<unsigned int> h_rtag(m_pdata->getRTags(), access_location::host, access_mode::read);\n\n \/\/ reset reverse lookup\n memset(h_molecule_idx.data, 0, sizeof(unsigned int)*nptl_local);\n\n unsigned int i_mol = 0;\n for (auto it_mol = local_molecules_sorted.begin(); it_mol != local_molecules_sorted.end(); ++it_mol)\n {\n for (std::set<unsigned int>::iterator it_tag = it_mol->second.begin(); it_tag != it_mol->second.end(); ++it_tag)\n {\n unsigned int n = h_molecule_length.data[i_mol]++;\n unsigned int ptl_idx = h_rtag.data[*it_tag];\n assert(ptl_idx < m_pdata->getN() + m_pdata->getNGhosts());\n h_molecule_list.data[m_molecule_indexer(i_mol, n)] = ptl_idx;\n h_molecule_idx.data[ptl_idx] = i_mol;\n h_molecule_order.data[ptl_idx] = n;\n }\n i_mol ++;\n }\n\n if (m_prof) m_prof->pop(m_exec_conf);\n }\n\nvoid export_MolecularForceCompute(py::module& m)\n {\n py::class_< MolecularForceCompute, std::shared_ptr<MolecularForceCompute> >(m, \"MolecularForceCompute\", py::base<ForceConstraint>())\n .def(py::init< std::shared_ptr<SystemDefinition> >())\n ;\n }\n<commit_msg>try splitting molecule_idx across GPUs<commit_after>\/\/ Copyright (c) 2009-2017 The Regents of the University of Michigan\n\/\/ This file is part of the HOOMD-blue project, released under the BSD 3-Clause License.\n\n\n\/\/ Maintainer: jglaser\n\n#include \"MolecularForceCompute.h\"\n\n#include \"hoomd\/CachedAllocator.h\"\n#include \"hoomd\/Autotuner.h\"\n\n#ifdef ENABLE_CUDA\n#include \"MolecularForceCompute.cuh\"\n#endif\n\n#include <string.h>\n#include <map>\n\nnamespace py = pybind11;\n\n\/*! \\file MolecularForceCompute.cc\n \\brief Contains code for the MolecularForceCompute class\n*\/\n\n\/*! \\param sysdef SystemDefinition containing the ParticleData to compute forces on\n*\/\nMolecularForceCompute::MolecularForceCompute(std::shared_ptr<SystemDefinition> sysdef)\n : ForceConstraint(sysdef), m_molecule_tag(m_exec_conf), m_n_molecules_global(0), m_dirty(true),\n m_molecule_list(m_exec_conf), m_molecule_length(m_exec_conf), m_molecule_order(m_exec_conf),\n m_molecule_idx(m_exec_conf)\n {\n \/\/ connect to the ParticleData to recieve notifications when particles change order in memory\n m_pdata->getParticleSortSignal().connect<MolecularForceCompute, &MolecularForceCompute::setDirty>(this);\n\n #ifdef ENABLE_CUDA\n if (m_exec_conf->isCUDAEnabled())\n {\n \/\/ initialize autotuner\n std::vector<unsigned int> valid_params;\n for (unsigned int block_size = 32; block_size <= 1024; block_size += 32)\n valid_params.push_back(block_size);\n\n m_tuner_fill.reset(new Autotuner(valid_params, 5, 100000, \"fill_molecule_table\", this->m_exec_conf));\n }\n #endif\n }\n\n\/\/! Destructor\nMolecularForceCompute::~MolecularForceCompute()\n {\n m_pdata->getParticleSortSignal().disconnect<MolecularForceCompute, &MolecularForceCompute::setDirty>(this);\n }\n\n#ifdef ENABLE_CUDA\nvoid MolecularForceCompute::initMoleculesGPU()\n {\n if (m_prof) m_prof->push(m_exec_conf,\"init molecules\");\n\n unsigned int nptl_local = m_pdata->getN() + m_pdata->getNGhosts();\n\n unsigned int n_local_molecules = 0;\n\n \/\/ maximum molecule length\n unsigned int nmax = 0;\n\n \/\/ number of local particles that are part of molecules\n unsigned int n_local_ptls_in_molecules = 0;\n\n \/\/ resize to maximum possible number of local molecules\n m_molecule_length.resize(nptl_local);\n m_molecule_idx.resize(nptl_local);\n\n ScopedAllocation<unsigned int> d_idx_sorted_by_tag(m_exec_conf->getCachedAllocator(), nptl_local);\n ScopedAllocation<unsigned int> d_local_molecule_tags(m_exec_conf->getCachedAllocator(), nptl_local);\n\n {\n ArrayHandle<unsigned int> d_molecule_tag(m_molecule_tag, access_location::device, access_mode::read);\n ArrayHandle<unsigned int> d_tag(m_pdata->getTags(), access_location::device, access_mode::read);\n ArrayHandle<unsigned int> d_molecule_length(m_molecule_length, access_location::device, access_mode::overwrite);\n ArrayHandle<unsigned int> d_molecule_idx(m_molecule_idx, access_location::device, access_mode::overwrite);\n\n \/\/ temporary buffers\n ScopedAllocation<unsigned int> d_local_unique_molecule_tags(m_exec_conf->getCachedAllocator(), m_n_molecules_global);\n ScopedAllocation<unsigned int> d_sorted_by_tag(m_exec_conf->getCachedAllocator(), nptl_local);\n\n gpu_sort_by_molecule(nptl_local,\n d_tag.data,\n d_molecule_tag.data,\n d_local_molecule_tags.data,\n d_local_unique_molecule_tags.data,\n d_molecule_idx.data,\n d_sorted_by_tag.data,\n d_idx_sorted_by_tag.data,\n d_molecule_length.data,\n n_local_molecules,\n nmax,\n n_local_ptls_in_molecules,\n m_exec_conf->getCachedAllocator());\n\n if (m_exec_conf->isCUDAErrorCheckingEnabled())\n CHECK_CUDA_ERROR();\n }\n\n \/\/ set up indexer\n m_molecule_indexer = Index2D(n_local_molecules, nmax);\n\n m_exec_conf->msg->notice(7) << \"MolecularForceCompute: \" << n_local_molecules << \" molecules, \"\n << n_local_ptls_in_molecules << \" particles in molceules \" << std::endl;\n\n \/\/ resize molecule list\n m_molecule_list.resize(m_molecule_indexer.getNumElements());\n\n \/\/ resize molecule lookup to size of local particle data\n m_molecule_order.resize(m_pdata->getMaxN());\n\n {\n \/\/ write out molecule list and order\n ArrayHandle<unsigned int> d_molecule_list(m_molecule_list, access_location::device, access_mode::overwrite);\n ArrayHandle<unsigned int> d_molecule_order(m_molecule_order, access_location::device, access_mode::overwrite);\n ArrayHandle<unsigned int> d_molecule_idx(m_molecule_idx, access_location::device, access_mode::read);\n\n m_tuner_fill->begin();\n unsigned int block_size = m_tuner_fill->getParam();\n\n gpu_fill_molecule_table(nptl_local,\n n_local_ptls_in_molecules,\n m_molecule_indexer,\n d_molecule_idx.data,\n d_local_molecule_tags.data,\n d_idx_sorted_by_tag.data,\n d_molecule_list.data,\n d_molecule_order.data,\n block_size,\n m_exec_conf->getCachedAllocator());\n\n if (m_exec_conf->isCUDAErrorCheckingEnabled())\n CHECK_CUDA_ERROR();\n\n m_tuner_fill->end();\n }\n\n #ifdef ENABLE_CUDA\n if (m_exec_conf->isCUDAEnabled())\n {\n auto gpu_map = m_exec_conf->getGPUIds();\n\n if (m_exec_conf->getNumActiveGPUs() > 1)\n {\n \/\/ unset previous hints\n for (unsigned int idev = 0; idev < m_exec_conf->getNumActiveGPUs(); ++idev)\n {\n cudaDeviceProp dev_prop = m_exec_conf->getDeviceProperties(idev);\n\n if (!dev_prop.concurrentManagedAccess)\n continue;\n\n auto range = m_pdata->getGPUPartition().getRange(idev);\n unsigned int nelem = range.second - range.first;\n\n \/\/ skip if no hint set\n if (!nelem)\n continue;\n\n cudaMemAdvise(m_molecule_idx.get()+range.first, sizeof(unsigned int)*nelem, cudaMemAdviseSetPreferredLocation, gpu_map[idev]);\n cudaMemPrefetchAsync(m_molecule_idx.get()+range.first, sizeof(unsigned int)*nelem, gpu_map[idev]);\n }\n\n CHECK_CUDA_ERROR();\n }\n }\n #endif\n\n\n if (m_prof) m_prof->pop(m_exec_conf);\n }\n#endif\n\nvoid MolecularForceCompute::initMolecules()\n {\n \/\/ return early if no molecules are defined\n if (!m_n_molecules_global) return;\n\n m_exec_conf->msg->notice(7) << \"MolecularForceCompute initializing molecule table\" << std::endl;\n\n #ifdef ENABLE_CUDA\n if (m_exec_conf->isCUDAEnabled())\n {\n initMoleculesGPU();\n return;\n }\n #endif\n\n if (m_prof) m_prof->push(\"init molecules\");\n\n \/\/ construct local molecule table\n unsigned int nptl_local = m_pdata->getN() + m_pdata->getNGhosts();\n\n ArrayHandle<unsigned int> h_molecule_tag(m_molecule_tag, access_location::host, access_mode::read);\n ArrayHandle<unsigned int> h_tag(m_pdata->getTags(), access_location::host, access_mode::read);\n\n std::set<unsigned int> local_molecule_tags;\n\n unsigned int n_local_molecules = 0;\n\n std::vector<unsigned int> local_molecule_idx(nptl_local, NO_MOLECULE);\n\n \/\/ resize molecule lookup to size of local particle data\n m_molecule_order.resize(m_pdata->getMaxN());\n\n \/\/ sort local molecules lexicographically by molecule and by ptl tag\n std::map<unsigned int, std::set<unsigned int> > local_molecules_sorted;\n\n for (unsigned int iptl = 0; iptl < nptl_local; ++iptl)\n {\n unsigned int tag = h_tag.data[iptl];\n assert(tag < m_molecule_tag.getNumElements());\n\n unsigned int mol_tag = h_molecule_tag.data[tag];\n if (mol_tag == NO_MOLECULE) continue;\n\n auto it = local_molecules_sorted.find(mol_tag);\n if (it == local_molecules_sorted.end())\n {\n auto res = local_molecules_sorted.insert(std::make_pair(mol_tag,std::set<unsigned int>()));\n assert(res.second);\n it = res.first;\n }\n\n it->second.insert(tag);\n }\n\n n_local_molecules = local_molecules_sorted.size();\n\n m_exec_conf->msg->notice(7) << \"MolecularForceCompute: \" << n_local_molecules << \" molecules\" << std::endl;\n\n m_molecule_length.resize(n_local_molecules);\n\n ArrayHandle<unsigned int> h_molecule_length(m_molecule_length, access_location::host, access_mode::overwrite);\n\n \/\/ reset lengths\n for (unsigned int imol = 0; imol < n_local_molecules; ++imol)\n {\n h_molecule_length.data[imol] = 0;\n }\n\n \/\/ count molecule lengths\n unsigned int i = 0;\n for (auto it = local_molecules_sorted.begin(); it != local_molecules_sorted.end(); ++it)\n {\n h_molecule_length.data[i++] = it->second.size();\n }\n\n \/\/ find maximum length\n unsigned nmax = 0;\n for (unsigned int imol = 0; imol < n_local_molecules; ++imol)\n {\n if (h_molecule_length.data[imol] > nmax)\n {\n nmax = h_molecule_length.data[imol];\n }\n }\n\n \/\/ set up indexer\n m_molecule_indexer = Index2D(n_local_molecules, nmax);\n\n \/\/ resize molecule list\n m_molecule_list.resize(m_molecule_indexer.getNumElements());\n\n \/\/ reset lengths again\n for (unsigned int imol = 0; imol < n_local_molecules; ++imol)\n {\n h_molecule_length.data[imol] = 0;\n }\n\n \/\/ reset molecule order\n ArrayHandle<unsigned int> h_molecule_order(m_molecule_order, access_location::host, access_mode::overwrite);\n memset(h_molecule_order.data, 0, sizeof(unsigned int)*(m_pdata->getN() + m_pdata->getNGhosts()));\n\n \/\/ resize reverse-lookup\n m_molecule_idx.resize(nptl_local);\n\n \/\/ fill molecule list\n ArrayHandle<unsigned int> h_molecule_list(m_molecule_list, access_location::host, access_mode::overwrite);\n ArrayHandle<unsigned int> h_molecule_idx(m_molecule_idx, access_location::host, access_mode::overwrite);\n ArrayHandle<unsigned int> h_rtag(m_pdata->getRTags(), access_location::host, access_mode::read);\n\n \/\/ reset reverse lookup\n memset(h_molecule_idx.data, 0, sizeof(unsigned int)*nptl_local);\n\n unsigned int i_mol = 0;\n for (auto it_mol = local_molecules_sorted.begin(); it_mol != local_molecules_sorted.end(); ++it_mol)\n {\n for (std::set<unsigned int>::iterator it_tag = it_mol->second.begin(); it_tag != it_mol->second.end(); ++it_tag)\n {\n unsigned int n = h_molecule_length.data[i_mol]++;\n unsigned int ptl_idx = h_rtag.data[*it_tag];\n assert(ptl_idx < m_pdata->getN() + m_pdata->getNGhosts());\n h_molecule_list.data[m_molecule_indexer(i_mol, n)] = ptl_idx;\n h_molecule_idx.data[ptl_idx] = i_mol;\n h_molecule_order.data[ptl_idx] = n;\n }\n i_mol ++;\n }\n\n if (m_prof) m_prof->pop(m_exec_conf);\n }\n\nvoid export_MolecularForceCompute(py::module& m)\n {\n py::class_< MolecularForceCompute, std::shared_ptr<MolecularForceCompute> >(m, \"MolecularForceCompute\", py::base<ForceConstraint>())\n .def(py::init< std::shared_ptr<SystemDefinition> >())\n ;\n }\n<|endoftext|>"} {"text":"<commit_before>#include \"Register\/Apply.hpp\"\n#include \"Chip\/MKL27Z4.hpp\"\n\n#include \"Register\/Seam.hpp\"\n#include <iostream>\n#include <sstream>\n#include <iomanip>\n\nnamespace Kvasir {\n\tnamespace Register {\n\t\ttemplate<typename T>\n\t\tstruct ExecuteSeam<T, ::Kvasir::Tag::User> : RecordActions<T> {};\n\t}\n}\n\n\nint main() {\n\tusing namespace Kvasir::Register;\n\tconstexpr auto w = write(Kvasir::Adc0Cfg2::AdlstsValC::v00);\n\tusing Arg = typename std::remove_cv<decltype(w)>::type;\n\tstatic_assert(Detail::ArgsToApplyArePlausible<Arg>::value, \"one of the supplied arguments is not supported\");\n\tusing namespace Kvasir::MPL;\n\t\/\/unsigned a[] = { Detail::argToInt(args)... };\n\tusing IndexedActions = TransformT < brigand::list<Arg>, BuildIndicesT<1>, Kvasir::MPL::Template < Kvasir::Register::Detail::MakeIndexedAction >> ;\n\tusing FlattenedActions = brigand::flatten<IndexedActions>;\n\tusing Steps = SplitT<FlattenedActions, SequencePoint>;\n\tusing Merged = Kvasir::Register::Detail::MergeActionStepsT<Steps>;\n\tusing Actions = brigand::flatten<Merged>;\n\tint i = Steps{};\n\t\/\/static_assert(Kvasir::Register::Detail::ArgsToApplyArePlausible<typename std::remove_cv<decltype(w)>::type>::value, \"one of the supplied arguments is not supported\");\n\tapply(w);\n\tif (Kvasir::Register::actions_.front().address_ == 0x4003b00c)\n\t\treturn 0;\n\treturn 1;\n}\n<commit_msg>added tests<commit_after>#include \"Register\/Apply.hpp\"\n#include \"Chip\/MKL27Z4.hpp\"\n\n#include \"Register\/Seam.hpp\"\n#include <iostream>\n#include <sstream>\n#include <iomanip>\n\nnamespace Kvasir {\n\tnamespace Register {\n\t\ttemplate<typename T>\n\t\tstruct ExecuteSeam<T, ::Kvasir::Tag::User> : RecordActions<T> {};\n\t}\n}\n\n#define BRIGAND_NO_BOOST_SUPPORT 1\n#include \"brigand\\brigand.hpp\"\n#include <utility>\n\nusing namespace brigand;\n\ntemplate<typename I, typename T>\nstruct indexed_type {};\n\ntemplate<typename T, typename U, typename V>\nstruct divide_impl;\n\ntemplate<template<typename...> class L, typename... T, typename... U, template<typename...> class L2, typename... V>\nstruct divide_impl<L<T...>, L<U...>, L2<V...>>\n{\n\ttemplate<typename... A, typename... B>\n\tstatic list<list<A...>, list<B...>> f(indexed_type<T, A>*..., indexed_type<U, B>*...);\n\tusing type = decltype(f((V*)0 ...));\n};\n\ntemplate<typename L, typename I>\nusing divide = typename divide_impl<\n\t\/\/make_sequence<\n\t\/\/\tbrigand::size_t<0>, \n\t\/\/\tI::value>, \n\t\/\/make_sequence<\n\t\/\/\tbrigand::size_t<I::value>, \n\t\/\/\t(size<L>::value - I::value)>, \n\tlist<brigand::size_t<0>, brigand::size_t<2>>,\n\tlist<brigand::size_t<2>, brigand::size_t<3>, brigand::size_t<4>>,\n\ttransform<\n\t\/\/make_sequence<\n\t\/\/\tbrigand::size_t<0>, \n\t\/\/\tsize<L>::value>, \n\tlist<brigand::size_t<0>, brigand::size_t<2>, brigand::size_t<2>, brigand::size_t<3>, brigand::size_t<4>>,\n\tL,\n\tindexed_type<_1, _2 >> >::type;\n\ntemplate<typename T, typename...Ts> \/\/find T in Ts... in constant time\nstruct find_impl {\n\tusing is = make_sequence<brigand::size_t<0>, sizeof...(Ts)>;\n\tusing l = list<Ts...>;\n\tusing zipped = transform<is, l, indexed_type<_1, _2>>;\n\ttemplate<typename C>\n\tstruct convert_me;\n\ttemplate<template<typename...> class C, typename... Cs>\n\tstruct convert_me<C<Cs...>> : Cs...{};\n\ttemplate<typename I>\n\tstatic I convert(indexed_type<I, T>*) {};\n\tusing type = decltype(convert(&std::declval<convert_me<zipped>>()));\n};\n\nusing l = list<char, int, bool, int, char>;\n\nint main()\n{\n\tusing dl = divide<l, brigand::size_t<2>>;\n\tusing namespace Kvasir::Register;\n\tconstexpr auto w = write(Kvasir::Adc0Cfg2::AdlstsValC::v00);\n\tusing Arg = typename std::remove_cv<decltype(w)>::type;\n\tstatic_assert(Detail::ArgsToApplyArePlausible<Arg>::value, \"one of the supplied arguments is not supported\");\n\tusing namespace Kvasir::MPL;\n\t\/\/unsigned a[] = { Detail::argToInt(args)... };\n\t\/\/using IndexedActions = TransformT < brigand::list<Arg>, BuildIndicesT<1>, Kvasir::MPL::Template < Kvasir::Register::Detail::MakeIndexedAction >> ;\n\t\/\/using FlattenedActions = brigand::flatten<IndexedActions>;\n\t\/\/using Steps = SplitT<FlattenedActions, SequencePoint>;\n\t\/\/using Merged = Kvasir::Register::Detail::MergeActionStepsT<Steps>;\n\t\/\/using Actions = brigand::flatten<Merged>;\n\t\/\/int i = Steps{};\n\t\/\/static_assert(Kvasir::Register::Detail::ArgsToApplyArePlausible<typename std::remove_cv<decltype(w)>::type>::value, \"one of the supplied arguments is not supported\");\n\t\/\/apply(w);\n\tif (Kvasir::Register::actions_.front().address_ == 0x4003b00c)\n\t\treturn 0;\n\treturn 1;\n}\n<|endoftext|>"} {"text":"<commit_before>\/*\n * Copyright (C) 2015 deipi.com LLC and contributors. 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\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 \"replicator.h\"\n\n#ifdef XAPIAND_CLUSTERING\n\n#include \"servers\/discovery.h\"\n\n\nXapiandReplicator::XapiandReplicator(const std::shared_ptr<XapiandManager>& manager_, ev::loop_ref* ev_loop_, unsigned int ev_flags_)\n\t: Worker(std::move(manager_), ev_loop_, ev_flags_) {\n\n\tL_OBJ(this, \"CREATED XAPIAN REPLICATOR!\");\n}\n\nXapiandReplicator::~XapiandReplicator()\n{\n\tL_OBJ(this, \"DESTROYING XAPIAN REPLICATOR!\");\n\n\tdestroyer();\n\n\tL_OBJ(this, \"DESTROYED XAPIAN REPLICATOR!\");\n}\n\n\nvoid\nXapiandReplicator::destroy_impl()\n{\n\tdestroyer();\n}\n\n\nvoid\nXapiandReplicator::destroyer()\n{\n\tmanager()->database_pool.updated_databases.finish();\n}\n\n\nvoid\nXapiandReplicator::shutdown_impl(time_t asap, time_t now)\n{\n\tL_OBJ(this , \"SHUTDOWN XAPIAN REPLICATOR! (%d %d)\", asap, now);\n\n\tWorker::shutdown_impl(asap, now);\n\n\tdestroyer(); \/\/ Call implementation directly, as we don't use a loop\n}\n\n\nvoid\nXapiandReplicator::run()\n{\n\t\/\/ Function that retrieves a task from a queue, runs it and deletes it\n\tEndpoint endpoint;\n\twhile (manager()->database_pool.updated_databases.pop(endpoint)) {\n\t\tL_DEBUG(this, \"Replicator was informed database was updated: %s\", endpoint.as_string().c_str());\n\t\ton_commit(endpoint);\n\t}\n\n\t\/\/ Call implementation directly, as we don't use a loop. Object gets\n\t\/\/ detached when run() ends:\n\n\tcleanup();\n}\n\n\nvoid\nXapiandReplicator::on_commit(const Endpoint &endpoint)\n{\n\tif (auto discovery = manager()->weak_discovery.lock()) {\n\t\tdiscovery->send_message(\n \tDiscovery::Message::DB_UPDATED,\n\t\t\tserialise_length(endpoint.mastery_level) + \/\/ The mastery level of the database\n\t\t\tserialise_string(endpoint.path) + \/\/ The path of the index\n\t\t\tlocal_node->serialise() \/\/ The node where the index is at\n\t\t);\n\t}\n}\n\n#endif\n<commit_msg>XapiandReplicator: Using destroy() and detach() in shutdown_impl()<commit_after>\/*\n * Copyright (C) 2015 deipi.com LLC and contributors. 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\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 \"replicator.h\"\n\n#ifdef XAPIAND_CLUSTERING\n\n#include \"servers\/discovery.h\"\n\n\nXapiandReplicator::XapiandReplicator(const std::shared_ptr<XapiandManager>& manager_, ev::loop_ref* ev_loop_, unsigned int ev_flags_)\n\t: Worker(std::move(manager_), ev_loop_, ev_flags_) {\n\n\tL_OBJ(this, \"CREATED XAPIAN REPLICATOR!\");\n}\n\nXapiandReplicator::~XapiandReplicator()\n{\n\tL_OBJ(this, \"DESTROYING XAPIAN REPLICATOR!\");\n\n\tdestroyer();\n\n\tL_OBJ(this, \"DESTROYED XAPIAN REPLICATOR!\");\n}\n\n\nvoid\nXapiandReplicator::destroy_impl()\n{\n\tdestroyer();\n}\n\n\nvoid\nXapiandReplicator::destroyer()\n{\n\tmanager()->database_pool.updated_databases.finish();\n}\n\n\nvoid\nXapiandReplicator::shutdown_impl(time_t asap, time_t now)\n{\n\tL_OBJ(this , \"SHUTDOWN XAPIAN REPLICATOR! (%d %d)\", asap, now);\n\n\tWorker::shutdown_impl(asap, now);\n\n\tdestroy();\n\n\tif (now) {\n\t\tdetach();\n\t}\n}\n\n\nvoid\nXapiandReplicator::run()\n{\n\t\/\/ Function that retrieves a task from a queue, runs it and deletes it\n\tEndpoint endpoint;\n\twhile (manager()->database_pool.updated_databases.pop(endpoint)) {\n\t\tL_DEBUG(this, \"Replicator was informed database was updated: %s\", endpoint.as_string().c_str());\n\t\ton_commit(endpoint);\n\t}\n\n\tcleanup();\n}\n\n\nvoid\nXapiandReplicator::on_commit(const Endpoint &endpoint)\n{\n\tif (auto discovery = manager()->weak_discovery.lock()) {\n\t\tdiscovery->send_message(\n \tDiscovery::Message::DB_UPDATED,\n\t\t\tserialise_length(endpoint.mastery_level) + \/\/ The mastery level of the database\n\t\t\tserialise_string(endpoint.path) + \/\/ The path of the index\n\t\t\tlocal_node->serialise() \/\/ The node where the index is at\n\t\t);\n\t}\n}\n\n#endif\n<|endoftext|>"} {"text":"<commit_before>#include \"coincontroltreewidget.h\"\n#include \"coincontroldialog.h\"\n\nCoinControlTreeWidget::CoinControlTreeWidget(QWidget *parent) :\n QTreeWidget(parent)\n{\n\n}\n\nvoid CoinControlTreeWidget::keyPressEvent(QKeyEvent *event)\n{\n if (event->key() == Qt::Key_Space) \/\/ press spacebar -> select checkbox\n {\n event->ignore();\n int COLUMN_CHECKBOX = 0;\n this->currentItem()->setCheckState(COLUMN_CHECKBOX, ((this->currentItem()->checkState(COLUMN_CHECKBOX) == Qt::Checked) ? Qt::Unchecked : Qt::Checked));\n }\n else if (event->key() == Qt::Key_Escape) \/\/ press esc -> close dialog\n {\n event->ignore();\n CoinControlDialog *coinControlDialog = (CoinControlDialog*)this->parentWidget();\n coinControlDialog->done(QDialog::Accepted);\n }\n else\n {\n this->QTreeWidget::keyPressEvent(event);\n }\n}<commit_msg>CoinControl \"space\" bug<commit_after>#include \"coincontroltreewidget.h\"\n#include \"coincontroldialog.h\"\n\nCoinControlTreeWidget::CoinControlTreeWidget(QWidget *parent) :\n QTreeWidget(parent)\n{\n\n}\n\nvoid CoinControlTreeWidget::keyPressEvent(QKeyEvent *event)\n{\n if (event->key() == Qt::Key_Space) \/\/ press spacebar -> select checkbox\n {\n event->ignore();\n int COLUMN_CHECKBOX = 0;\n if(this->currentItem())\n this->currentItem()->setCheckState(COLUMN_CHECKBOX, ((this->currentItem()->checkState(COLUMN_CHECKBOX) == Qt::Checked) ? Qt::Unchecked : Qt::Checked));\n }\n else if (event->key() == Qt::Key_Escape) \/\/ press esc -> close dialog\n {\n event->ignore();\n CoinControlDialog *coinControlDialog = (CoinControlDialog*)this->parentWidget();\n coinControlDialog->done(QDialog::Accepted);\n }\n else\n {\n this->QTreeWidget::keyPressEvent(event);\n }\n}<|endoftext|>"} {"text":"<commit_before>\/*****************************************************************************\n * Project: RooFit *\n * Package: RooFitModels *\n * @(#)root\/roofit:$Id$\n * Authors: *\n * WV, Wouter Verkerke, UC Santa Barbara, verkerke@slac.stanford.edu *\n * DK, David Kirkby, UC Irvine, dkirkby@uci.edu *\n * *\n * Copyright (c) 2000-2005, Regents of the University of California *\n * and Stanford University. All rights reserved. *\n * *\n * Redistribution and use in source and binary forms, *\n * with or without modification, are permitted according to the terms *\n * listed in LICENSE (http:\/\/roofit.sourceforge.net\/license.txt) *\n *****************************************************************************\/\n\n\/** \\class RooCBShape\n \\ingroup Roofit\n\nPDF implementing the Crystal Ball line shape.\n**\/\n\n#include \"RooCBShape.h\"\n\n#include \"RooAbsReal.h\"\n#include \"RooRealVar.h\"\n#include \"RooMath.h\"\n#include \"BatchHelpers.h\"\n#include \"RooVDTHeaders.h\"\n\n#include \"TMath.h\"\n\n#include <cmath>\n\nusing namespace std;\n\nClassImp(RooCBShape);\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nDouble_t RooCBShape::ApproxErf(Double_t arg) const\n{\n static const double erflim = 5.0;\n if( arg > erflim )\n return 1.0;\n if( arg < -erflim )\n return -1.0;\n\n return RooMath::erf(arg);\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nRooCBShape::RooCBShape(const char *name, const char *title,\n RooAbsReal& _m, RooAbsReal& _m0, RooAbsReal& _sigma,\n RooAbsReal& _alpha, RooAbsReal& _n) :\n RooAbsPdf(name, title),\n m(\"m\", \"Dependent\", this, _m),\n m0(\"m0\", \"M0\", this, _m0),\n sigma(\"sigma\", \"Sigma\", this, _sigma),\n alpha(\"alpha\", \"Alpha\", this, _alpha),\n n(\"n\", \"Order\", this, _n)\n{\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nRooCBShape::RooCBShape(const RooCBShape& other, const char* name) :\n RooAbsPdf(other, name), m(\"m\", this, other.m), m0(\"m0\", this, other.m0),\n sigma(\"sigma\", this, other.sigma), alpha(\"alpha\", this, other.alpha),\n n(\"n\", this, other.n)\n{\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nDouble_t RooCBShape::evaluate() const {\n Double_t t = (m-m0)\/sigma;\n if (alpha < 0) t = -t;\n\n Double_t absAlpha = fabs((Double_t)alpha);\n\n if (t >= -absAlpha) {\n return exp(-0.5*t*t);\n }\n else {\n Double_t a = TMath::Power(n\/absAlpha,n)*exp(-0.5*absAlpha*absAlpha);\n Double_t b= n\/absAlpha - absAlpha;\n\n return a\/TMath::Power(b - t, n);\n }\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nnamespace {\n\/\/Author: Emmanouil Michalainas, CERN 21 August 2019\n\ntemplate<class Tm, class Tm0, class Tsigma, class Talpha, class Tn>\nvoid compute(\tsize_t batchSize,\n\tdouble * __restrict output,\n\tTm M, Tm0 M0, Tsigma S, Talpha A, Tn N)\n{\n for (size_t i=0; i<batchSize; i++) {\n const double t = (M[i]-M0[i]) \/ S[i];\n if ((A[i]>0 && t>=-A[i]) || (A[i]<0 && -t>=A[i])) {\n output[i] = -0.5*t*t;\n } else {\n output[i] = N[i] \/ (N[i] -A[i]*A[i] -A[i]*t);\n output[i] = _rf_fast_log(output[i]);\n output[i] *= N[i];\n output[i] -= 0.5*A[i]*A[i];\n }\n }\n \n for (size_t i=0; i<batchSize; i++) {\n output[i] = _rf_fast_exp(output[i]);\n }\n}\n};\n\nRooSpan<double> RooCBShape::evaluateBatch(std::size_t begin, std::size_t batchSize) const {\n using namespace BatchHelpers;\n\n EvaluateInfo info = getInfo( {&m, &m0, &sigma, &alpha, &n}, begin, batchSize );\n if (info.nBatches == 0) {\n return {};\n }\n auto output = _batchData.makeWritableBatchUnInit(begin, batchSize);\n auto mData = m.getValBatch(begin, info.size);\n\n if (info.nBatches==1 && !mData.empty()) {\n compute(info.size, output.data(), mData.data(),\n BracketAdapter<double> (m0),\n BracketAdapter<double> (sigma),\n BracketAdapter<double> (alpha),\n BracketAdapter<double> (n));\n }\n else {\n compute(info.size, output.data(),\n BracketAdapterWithMask (m,m.getValBatch(begin,info.size)),\n BracketAdapterWithMask (m0,m0.getValBatch(begin,info.size)),\n BracketAdapterWithMask (sigma,sigma.getValBatch(begin,info.size)),\n BracketAdapterWithMask (alpha,alpha.getValBatch(begin,info.size)),\n BracketAdapterWithMask (n,n.getValBatch(begin,info.size)));\n }\n return output;\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nInt_t RooCBShape::getAnalyticalIntegral(RooArgSet& allVars, RooArgSet& analVars, const char* \/*rangeName*\/) const\n{\n if( matchArgs(allVars,analVars,m) )\n return 1 ;\n\n return 0;\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nDouble_t RooCBShape::analyticalIntegral(Int_t code, const char* rangeName) const\n{\n static const double sqrtPiOver2 = 1.2533141373;\n static const double sqrt2 = 1.4142135624;\n\n R__ASSERT(code==1);\n double result = 0.0;\n bool useLog = false;\n\n if( fabs(n-1.0) < 1.0e-05 )\n useLog = true;\n\n double sig = fabs((Double_t)sigma);\n\n double tmin = (m.min(rangeName)-m0)\/sig;\n double tmax = (m.max(rangeName)-m0)\/sig;\n\n if(alpha < 0) {\n double tmp = tmin;\n tmin = -tmax;\n tmax = -tmp;\n }\n\n double absAlpha = fabs((Double_t)alpha);\n\n if( tmin >= -absAlpha ) {\n result += sig*sqrtPiOver2*( ApproxErf(tmax\/sqrt2)\n - ApproxErf(tmin\/sqrt2) );\n }\n else if( tmax <= -absAlpha ) {\n double a = TMath::Power(n\/absAlpha,n)*exp(-0.5*absAlpha*absAlpha);\n double b = n\/absAlpha - absAlpha;\n\n if(useLog) {\n result += a*sig*( log(b-tmin) - log(b-tmax) );\n }\n else {\n result += a*sig\/(1.0-n)*( 1.0\/(TMath::Power(b-tmin,n-1.0))\n - 1.0\/(TMath::Power(b-tmax,n-1.0)) );\n }\n }\n else {\n double a = TMath::Power(n\/absAlpha,n)*exp(-0.5*absAlpha*absAlpha);\n double b = n\/absAlpha - absAlpha;\n\n double term1 = 0.0;\n if(useLog) {\n term1 = a*sig*( log(b-tmin) - log(n\/absAlpha));\n }\n else {\n term1 = a*sig\/(1.0-n)*( 1.0\/(TMath::Power(b-tmin,n-1.0))\n - 1.0\/(TMath::Power(n\/absAlpha,n-1.0)) );\n }\n\n double term2 = sig*sqrtPiOver2*( ApproxErf(tmax\/sqrt2)\n - ApproxErf(-absAlpha\/sqrt2) );\n\n\n result += term1 + term2;\n }\n\n return result != 0. ? result : 1.E-300;\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\/ Advertise that we know the maximum of self for given (m0,alpha,n,sigma)\n\nInt_t RooCBShape::getMaxVal(const RooArgSet& vars) const\n{\n RooArgSet dummy ;\n\n if (matchArgs(vars,dummy,m)) {\n return 1 ;\n }\n return 0 ;\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nDouble_t RooCBShape::maxVal(Int_t code) const\n{\n R__ASSERT(code==1) ;\n\n \/\/ The maximum value for given (m0,alpha,n,sigma)\n return 1.0 ;\n}\n<commit_msg>Fix computing maximum value for RooCBShape The maximum value for RooCBSHape is use din generate() to speedup Accept\/reject The maximum is 1.\/ Integral of funciton in range and not 1 !<commit_after>\/*****************************************************************************\n * Project: RooFit *\n * Package: RooFitModels *\n * @(#)root\/roofit:$Id$\n * Authors: *\n * WV, Wouter Verkerke, UC Santa Barbara, verkerke@slac.stanford.edu *\n * DK, David Kirkby, UC Irvine, dkirkby@uci.edu *\n * *\n * Copyright (c) 2000-2005, Regents of the University of California *\n * and Stanford University. All rights reserved. *\n * *\n * Redistribution and use in source and binary forms, *\n * with or without modification, are permitted according to the terms *\n * listed in LICENSE (http:\/\/roofit.sourceforge.net\/license.txt) *\n *****************************************************************************\/\n\n\/** \\class RooCBShape\n \\ingroup Roofit\n\nPDF implementing the Crystal Ball line shape.\n**\/\n\n#include \"RooCBShape.h\"\n\n#include \"RooAbsReal.h\"\n#include \"RooRealVar.h\"\n#include \"RooMath.h\"\n#include \"BatchHelpers.h\"\n#include \"RooVDTHeaders.h\"\n\n#include \"TMath.h\"\n\n#include <cmath>\n\nusing namespace std;\n\nClassImp(RooCBShape);\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nDouble_t RooCBShape::ApproxErf(Double_t arg) const\n{\n static const double erflim = 5.0;\n if( arg > erflim )\n return 1.0;\n if( arg < -erflim )\n return -1.0;\n\n return RooMath::erf(arg);\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nRooCBShape::RooCBShape(const char *name, const char *title,\n RooAbsReal& _m, RooAbsReal& _m0, RooAbsReal& _sigma,\n RooAbsReal& _alpha, RooAbsReal& _n) :\n RooAbsPdf(name, title),\n m(\"m\", \"Dependent\", this, _m),\n m0(\"m0\", \"M0\", this, _m0),\n sigma(\"sigma\", \"Sigma\", this, _sigma),\n alpha(\"alpha\", \"Alpha\", this, _alpha),\n n(\"n\", \"Order\", this, _n)\n{\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nRooCBShape::RooCBShape(const RooCBShape& other, const char* name) :\n RooAbsPdf(other, name), m(\"m\", this, other.m), m0(\"m0\", this, other.m0),\n sigma(\"sigma\", this, other.sigma), alpha(\"alpha\", this, other.alpha),\n n(\"n\", this, other.n)\n{\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nDouble_t RooCBShape::evaluate() const {\n Double_t t = (m-m0)\/sigma;\n if (alpha < 0) t = -t;\n\n Double_t absAlpha = fabs((Double_t)alpha);\n\n if (t >= -absAlpha) {\n return exp(-0.5*t*t);\n }\n else {\n Double_t a = TMath::Power(n\/absAlpha,n)*exp(-0.5*absAlpha*absAlpha);\n Double_t b= n\/absAlpha - absAlpha;\n\n return a\/TMath::Power(b - t, n);\n }\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nnamespace {\n\/\/Author: Emmanouil Michalainas, CERN 21 August 2019\n\ntemplate<class Tm, class Tm0, class Tsigma, class Talpha, class Tn>\nvoid compute(\tsize_t batchSize,\n\tdouble * __restrict output,\n\tTm M, Tm0 M0, Tsigma S, Talpha A, Tn N)\n{\n for (size_t i=0; i<batchSize; i++) {\n const double t = (M[i]-M0[i]) \/ S[i];\n if ((A[i]>0 && t>=-A[i]) || (A[i]<0 && -t>=A[i])) {\n output[i] = -0.5*t*t;\n } else {\n output[i] = N[i] \/ (N[i] -A[i]*A[i] -A[i]*t);\n output[i] = _rf_fast_log(output[i]);\n output[i] *= N[i];\n output[i] -= 0.5*A[i]*A[i];\n }\n }\n\n for (size_t i=0; i<batchSize; i++) {\n output[i] = _rf_fast_exp(output[i]);\n }\n}\n};\n\nRooSpan<double> RooCBShape::evaluateBatch(std::size_t begin, std::size_t batchSize) const {\n using namespace BatchHelpers;\n\n EvaluateInfo info = getInfo( {&m, &m0, &sigma, &alpha, &n}, begin, batchSize );\n if (info.nBatches == 0) {\n return {};\n }\n auto output = _batchData.makeWritableBatchUnInit(begin, batchSize);\n auto mData = m.getValBatch(begin, info.size);\n\n if (info.nBatches==1 && !mData.empty()) {\n compute(info.size, output.data(), mData.data(),\n BracketAdapter<double> (m0),\n BracketAdapter<double> (sigma),\n BracketAdapter<double> (alpha),\n BracketAdapter<double> (n));\n }\n else {\n compute(info.size, output.data(),\n BracketAdapterWithMask (m,m.getValBatch(begin,info.size)),\n BracketAdapterWithMask (m0,m0.getValBatch(begin,info.size)),\n BracketAdapterWithMask (sigma,sigma.getValBatch(begin,info.size)),\n BracketAdapterWithMask (alpha,alpha.getValBatch(begin,info.size)),\n BracketAdapterWithMask (n,n.getValBatch(begin,info.size)));\n }\n return output;\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nInt_t RooCBShape::getAnalyticalIntegral(RooArgSet& allVars, RooArgSet& analVars, const char* \/*rangeName*\/) const\n{\n if( matchArgs(allVars,analVars,m) )\n return 1 ;\n\n return 0;\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nDouble_t RooCBShape::analyticalIntegral(Int_t code, const char* rangeName) const\n{\n static const double sqrtPiOver2 = 1.2533141373;\n static const double sqrt2 = 1.4142135624;\n\n R__ASSERT(code==1);\n double result = 0.0;\n bool useLog = false;\n\n if( fabs(n-1.0) < 1.0e-05 )\n useLog = true;\n\n double sig = fabs((Double_t)sigma);\n\n double tmin = (m.min(rangeName)-m0)\/sig;\n double tmax = (m.max(rangeName)-m0)\/sig;\n\n if(alpha < 0) {\n double tmp = tmin;\n tmin = -tmax;\n tmax = -tmp;\n }\n\n double absAlpha = fabs((Double_t)alpha);\n\n if( tmin >= -absAlpha ) {\n result += sig*sqrtPiOver2*( ApproxErf(tmax\/sqrt2)\n - ApproxErf(tmin\/sqrt2) );\n }\n else if( tmax <= -absAlpha ) {\n double a = TMath::Power(n\/absAlpha,n)*exp(-0.5*absAlpha*absAlpha);\n double b = n\/absAlpha - absAlpha;\n\n if(useLog) {\n result += a*sig*( log(b-tmin) - log(b-tmax) );\n }\n else {\n result += a*sig\/(1.0-n)*( 1.0\/(TMath::Power(b-tmin,n-1.0))\n - 1.0\/(TMath::Power(b-tmax,n-1.0)) );\n }\n }\n else {\n double a = TMath::Power(n\/absAlpha,n)*exp(-0.5*absAlpha*absAlpha);\n double b = n\/absAlpha - absAlpha;\n\n double term1 = 0.0;\n if(useLog) {\n term1 = a*sig*( log(b-tmin) - log(n\/absAlpha));\n }\n else {\n term1 = a*sig\/(1.0-n)*( 1.0\/(TMath::Power(b-tmin,n-1.0))\n - 1.0\/(TMath::Power(n\/absAlpha,n-1.0)) );\n }\n\n double term2 = sig*sqrtPiOver2*( ApproxErf(tmax\/sqrt2)\n - ApproxErf(-absAlpha\/sqrt2) );\n\n\n result += term1 + term2;\n }\n\n return result != 0. ? result : 1.E-300;\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\/ Advertise that we know the maximum of self for given (m0,alpha,n,sigma)\n\nInt_t RooCBShape::getMaxVal(const RooArgSet& vars) const\n{\n RooArgSet dummy ;\n\n if (matchArgs(vars,dummy,m)) {\n return 1 ;\n }\n return 0 ;\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nDouble_t RooCBShape::maxVal(Int_t code) const\n{\n R__ASSERT(code==1) ;\n\n \/\/ The maximum value for given (m0,alpha,n,sigma)\n \/\/ is 1.\/ Integral in the variable range\n return 1.0\/analyticalIntegral(1) ;\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\/signin_manager.h\"\n\n#include \"base\/command_line.h\"\n#include \"base\/string_util.h\"\n#include \"chrome\/browser\/net\/gaia\/token_service.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\/util\/oauth.h\"\n#include \"chrome\/common\/chrome_notification_types.h\"\n#include \"chrome\/common\/chrome_switches.h\"\n#include \"chrome\/common\/net\/gaia\/gaia_constants.h\"\n#include \"chrome\/common\/pref_names.h\"\n#include \"content\/common\/notification_service.h\"\n\nconst char kGetInfoEmailKey[] = \"email\";\n\nSigninManager::SigninManager()\n : profile_(NULL), had_two_factor_error_(false) {}\n\nSigninManager::~SigninManager() {}\n\n\/\/ static\nvoid SigninManager::RegisterUserPrefs(PrefService* user_prefs) {\n user_prefs->RegisterBooleanPref(prefs::kSyncUsingOAuth,\n \"\",\n PrefService::UNSYNCABLE_PREF);\n user_prefs->RegisterStringPref(prefs::kGoogleServicesUsername,\n \"\",\n PrefService::UNSYNCABLE_PREF);\n user_prefs->RegisterBooleanPref(prefs::kAutologinEnabled,\n true,\n PrefService::UNSYNCABLE_PREF);\n}\n\nvoid SigninManager::Initialize(Profile* profile) {\n profile_ = profile;\n SetUsername(profile_->GetPrefs()->GetString(prefs::kGoogleServicesUsername));\n profile_->GetTokenService()->Initialize(\n GaiaConstants::kChromeSource, profile_);\n if (!GetUsername().empty()) {\n profile_->GetTokenService()->LoadTokensFromDB();\n }\n}\n\nbool SigninManager::IsInitialized() const {\n return profile_ != NULL;\n}\n\nvoid SigninManager::CleanupNotificationRegistration() {\n#if !defined(OS_CHROMEOS)\n Source<TokenService> token_service(profile_->GetTokenService());\n if (registrar_.IsRegistered(this,\n chrome::NOTIFICATION_TOKEN_AVAILABLE,\n token_service)) {\n registrar_.Remove(this,\n chrome::NOTIFICATION_TOKEN_AVAILABLE,\n token_service);\n }\n#endif\n}\n\n\/\/ If a username already exists, the user is logged in.\nconst std::string& SigninManager::GetUsername() {\n return browser_sync::IsUsingOAuth() ? oauth_username_ : username_;\n}\n\nvoid SigninManager::SetUsername(const std::string& username) {\n if (browser_sync::IsUsingOAuth())\n oauth_username_ = username;\n else\n username_ = username;\n}\n\n\/\/ static\nvoid SigninManager::PrepareForSignin() {\n DCHECK(!browser_sync::IsUsingOAuth());\n DCHECK(username_.empty());\n#if !defined(OS_CHROMEOS)\n \/\/ The Sign out should clear the token service credentials.\n \/\/ Note: In CHROMEOS we might have valid credentials but still need to\n \/\/ set up 2-factor authentication.\n DCHECK(!profile_->GetTokenService()->AreCredentialsValid());\n#endif\n}\n\n\/\/ static\nvoid SigninManager::PrepareForOAuthSignin() {\n DCHECK(browser_sync::IsUsingOAuth());\n DCHECK(oauth_username_.empty());\n#if !defined(OS_CHROMEOS)\n \/\/ The Sign out should clear the token service credentials.\n \/\/ Note: In CHROMEOS we might have valid credentials but still need to\n \/\/ set up 2-factor authentication.\n DCHECK(!profile_->GetTokenService()->AreOAuthCredentialsValid());\n#endif\n}\n\n\/\/ Users must always sign out before they sign in again.\nvoid SigninManager::StartOAuthSignIn() {\n DCHECK(browser_sync::IsUsingOAuth());\n PrepareForOAuthSignin();\n oauth_login_.reset(new GaiaOAuthFetcher(this,\n profile_->GetRequestContext(),\n profile_,\n GaiaConstants::kSyncServiceOAuth));\n oauth_login_->StartGetOAuthToken();\n \/\/ TODO(rogerta?): Bug 92325: Expand Autologin to include OAuth signin\n}\n\n\/\/ Users must always sign out before they sign in again.\nvoid SigninManager::StartSignIn(const std::string& username,\n const std::string& password,\n const std::string& login_token,\n const std::string& login_captcha) {\n DCHECK(!browser_sync::IsUsingOAuth());\n PrepareForSignin();\n username_.assign(username);\n password_.assign(password);\n\n client_login_.reset(new GaiaAuthFetcher(this,\n GaiaConstants::kChromeSource,\n profile_->GetRequestContext()));\n client_login_->StartClientLogin(username,\n password,\n \"\",\n login_token,\n login_captcha,\n GaiaAuthFetcher::HostedAccountsNotAllowed);\n\n \/\/ Register for token availability. The signin manager will pre-login the\n \/\/ user when the GAIA service token is ready for use. Only do this if we\n \/\/ are not running in ChomiumOS, since it handles pre-login itself.\n#if !defined(OS_CHROMEOS)\n if (CommandLine::ForCurrentProcess()->HasSwitch(switches::kEnableAutologin) &&\n profile_->GetPrefs()->GetBoolean(prefs::kAutologinEnabled)) {\n registrar_.Add(this,\n chrome::NOTIFICATION_TOKEN_AVAILABLE,\n Source<TokenService>(profile_->GetTokenService()));\n }\n#endif\n}\n\nvoid SigninManager::ProvideSecondFactorAccessCode(\n const std::string& access_code) {\n DCHECK(!browser_sync::IsUsingOAuth());\n DCHECK(!username_.empty() && !password_.empty() &&\n last_result_.data.empty());\n\n client_login_.reset(new GaiaAuthFetcher(this,\n GaiaConstants::kChromeSource,\n profile_->GetRequestContext()));\n client_login_->StartClientLogin(username_,\n access_code,\n \"\",\n std::string(),\n std::string(),\n GaiaAuthFetcher::HostedAccountsNotAllowed);\n}\n\nvoid SigninManager::SignOut() {\n if (!profile_)\n return;\n\n CleanupNotificationRegistration();\n\n client_login_.reset();\n last_result_ = ClientLoginResult();\n username_.clear();\n oauth_username_.clear();\n password_.clear();\n had_two_factor_error_ = false;\n profile_->GetPrefs()->ClearPref(prefs::kGoogleServicesUsername);\n profile_->GetPrefs()->ClearPref(prefs::kSyncUsingOAuth);\n profile_->GetPrefs()->ScheduleSavePersistentPrefs();\n profile_->GetTokenService()->ResetCredentialsInMemory();\n profile_->GetTokenService()->EraseTokensFromDB();\n}\n\nvoid SigninManager::OnClientLoginSuccess(const ClientLoginResult& result) {\n DCHECK(!browser_sync::IsUsingOAuth());\n last_result_ = result;\n \/\/ Make a request for the canonical email address.\n client_login_->StartGetUserInfo(result.lsid, kGetInfoEmailKey);\n}\n\n\/\/ NOTE: GetUserInfo is a ClientLogin request similar to OAuth's userinfo\nvoid SigninManager::OnGetUserInfoSuccess(const std::string& key,\n const std::string& value) {\n DCHECK(!browser_sync::IsUsingOAuth());\n DCHECK(key == kGetInfoEmailKey);\n\n username_ = value;\n profile_->GetPrefs()->SetString(prefs::kGoogleServicesUsername, username_);\n profile_->GetPrefs()->SetBoolean(prefs::kSyncUsingOAuth, false);\n profile_->GetPrefs()->ScheduleSavePersistentPrefs();\n\n GoogleServiceSigninSuccessDetails details(username_, password_);\n NotificationService::current()->Notify(\n chrome::NOTIFICATION_GOOGLE_SIGNIN_SUCCESSFUL,\n Source<Profile>(profile_),\n Details<const GoogleServiceSigninSuccessDetails>(&details));\n\n password_.clear(); \/\/ Don't need it anymore.\n\n profile_->GetTokenService()->UpdateCredentials(last_result_);\n DCHECK(profile_->GetTokenService()->AreCredentialsValid());\n profile_->GetTokenService()->StartFetchingTokens();\n}\n\nvoid SigninManager::OnGetUserInfoKeyNotFound(const std::string& key) {\n DCHECK(!browser_sync::IsUsingOAuth());\n DCHECK(key == kGetInfoEmailKey);\n LOG(ERROR) << \"Account is not associated with a valid email address. \"\n << \"Login failed.\";\n OnClientLoginFailure(GoogleServiceAuthError(\n GoogleServiceAuthError::INVALID_GAIA_CREDENTIALS));\n}\n\nvoid SigninManager::OnGetUserInfoFailure(const GoogleServiceAuthError& error) {\n DCHECK(!browser_sync::IsUsingOAuth());\n LOG(ERROR) << \"Unable to retreive the canonical email address. Login failed.\";\n OnClientLoginFailure(error);\n}\n\nvoid SigninManager::OnTokenAuthFailure(const GoogleServiceAuthError& error) {\n DCHECK(!browser_sync::IsUsingOAuth());\n#if !defined(OS_CHROMEOS)\n VLOG(1) << \"Unable to retrieve the token auth.\";\n CleanupNotificationRegistration();\n#endif\n}\n\nvoid SigninManager::OnClientLoginFailure(const GoogleServiceAuthError& error) {\n DCHECK(!browser_sync::IsUsingOAuth());\n NotificationService::current()->Notify(\n chrome::NOTIFICATION_GOOGLE_SIGNIN_FAILED,\n Source<Profile>(profile_),\n Details<const GoogleServiceAuthError>(&error));\n\n \/\/ We don't sign-out if the password was valid and we're just dealing with\n \/\/ a second factor error, and we don't sign out if we're dealing with\n \/\/ an invalid access code (again, because the password was valid).\n bool invalid_gaia = error.state() ==\n GoogleServiceAuthError::INVALID_GAIA_CREDENTIALS;\n if (error.state() == GoogleServiceAuthError::TWO_FACTOR ||\n (had_two_factor_error_ && invalid_gaia)) {\n had_two_factor_error_ = true;\n return;\n }\n\n SignOut();\n}\n\nvoid SigninManager::OnGetOAuthTokenSuccess(const std::string& oauth_token) {\n DCHECK(browser_sync::IsUsingOAuth());\n VLOG(1) << \"SigninManager::SigninManager::OnGetOAuthTokenSuccess\";\n}\n\nvoid SigninManager::OnGetOAuthTokenFailure(\n const GoogleServiceAuthError& error) {\n DCHECK(browser_sync::IsUsingOAuth());\n LOG(WARNING) << \"SigninManager::OnGetOAuthTokenFailure\";\n NotificationService::current()->Notify(\n chrome::NOTIFICATION_GOOGLE_SIGNIN_FAILED,\n Source<Profile>(profile_),\n Details<const GoogleServiceAuthError>(&error));\n SignOut();\n}\n\nvoid SigninManager::OnOAuthGetAccessTokenSuccess(const std::string& token,\n const std::string& secret) {\n DCHECK(browser_sync::IsUsingOAuth());\n VLOG(1) << \"SigninManager::OnOAuthGetAccessTokenSuccess\";\n profile_->GetTokenService()->UpdateOAuthCredentials(token, secret);\n}\n\nvoid SigninManager::OnOAuthGetAccessTokenFailure(\n const GoogleServiceAuthError& error) {\n DCHECK(browser_sync::IsUsingOAuth());\n LOG(WARNING) << \"SigninManager::OnOAuthGetAccessTokenFailure\";\n}\n\nvoid SigninManager::OnOAuthWrapBridgeSuccess(const std::string& service_name,\n const std::string& token,\n const std::string& expires_in) {\n DCHECK(browser_sync::IsUsingOAuth());\n VLOG(1) << \"SigninManager::OnOAuthWrapBridgeSuccess\";\n}\n\nvoid SigninManager::OnOAuthWrapBridgeFailure(\n const std::string& service_scope,\n const GoogleServiceAuthError& error) {\n DCHECK(browser_sync::IsUsingOAuth());\n LOG(WARNING) << \"SigninManager::OnOAuthWrapBridgeFailure\";\n}\n\n\/\/ NOTE: userinfo is an OAuth request similar to ClientLogin's GetUserInfo\nvoid SigninManager::OnUserInfoSuccess(const std::string& email) {\n DCHECK(browser_sync::IsUsingOAuth());\n VLOG(1) << \"Sync signin for \" << email << \" is complete.\";\n oauth_username_ = email;\n profile_->GetPrefs()->SetString(\n prefs::kGoogleServicesUsername, oauth_username_);\n profile_->GetPrefs()->SetBoolean(prefs::kSyncUsingOAuth, true);\n profile_->GetPrefs()->ScheduleSavePersistentPrefs();\n\n DCHECK(password_.empty());\n GoogleServiceSigninSuccessDetails details(oauth_username_, \"\");\n NotificationService::current()->Notify(\n chrome::NOTIFICATION_GOOGLE_SIGNIN_SUCCESSFUL,\n Source<Profile>(profile_),\n Details<const GoogleServiceSigninSuccessDetails>(&details));\n\n DCHECK(profile_->GetTokenService()->AreOAuthCredentialsValid());\n profile_->GetTokenService()->StartFetchingOAuthTokens();\n}\n\nvoid SigninManager::OnUserInfoFailure(const GoogleServiceAuthError& error) {\n DCHECK(browser_sync::IsUsingOAuth());\n LOG(WARNING) << \"SigninManager::OnUserInfoFailure\";\n}\n\nvoid SigninManager::Observe(int type,\n const NotificationSource& source,\n const NotificationDetails& details) {\n#if !defined(OS_CHROMEOS)\n DCHECK(type == chrome::NOTIFICATION_TOKEN_AVAILABLE);\n TokenService::TokenAvailableDetails* tok_details =\n Details<TokenService::TokenAvailableDetails>(details).ptr();\n\n \/\/ If a GAIA service token has become available, use it to pre-login the\n \/\/ user to other services that depend on GAIA credentials.\n if (tok_details->service() == GaiaConstants::kGaiaService) {\n DCHECK(!browser_sync::IsUsingOAuth());\n if (client_login_.get() == NULL) {\n client_login_.reset(new GaiaAuthFetcher(this,\n GaiaConstants::kChromeSource,\n profile_->GetRequestContext()));\n }\n\n client_login_->StartMergeSession(tok_details->token());\n\n \/\/ We only want to do this once per sign-in.\n CleanupNotificationRegistration();\n }\n#endif\n}\n<commit_msg>Adding explicit CHECK to highlight crashes for profiles where the TokenService is NULL.<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\/signin_manager.h\"\n\n#include \"base\/command_line.h\"\n#include \"base\/string_util.h\"\n#include \"chrome\/browser\/net\/gaia\/token_service.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\/util\/oauth.h\"\n#include \"chrome\/common\/chrome_notification_types.h\"\n#include \"chrome\/common\/chrome_switches.h\"\n#include \"chrome\/common\/net\/gaia\/gaia_constants.h\"\n#include \"chrome\/common\/pref_names.h\"\n#include \"content\/common\/notification_service.h\"\n\nconst char kGetInfoEmailKey[] = \"email\";\n\nSigninManager::SigninManager()\n : profile_(NULL), had_two_factor_error_(false) {}\n\nSigninManager::~SigninManager() {}\n\n\/\/ static\nvoid SigninManager::RegisterUserPrefs(PrefService* user_prefs) {\n user_prefs->RegisterBooleanPref(prefs::kSyncUsingOAuth,\n \"\",\n PrefService::UNSYNCABLE_PREF);\n user_prefs->RegisterStringPref(prefs::kGoogleServicesUsername,\n \"\",\n PrefService::UNSYNCABLE_PREF);\n user_prefs->RegisterBooleanPref(prefs::kAutologinEnabled,\n true,\n PrefService::UNSYNCABLE_PREF);\n}\n\nvoid SigninManager::Initialize(Profile* profile) {\n profile_ = profile;\n SetUsername(profile_->GetPrefs()->GetString(prefs::kGoogleServicesUsername));\n profile_->GetTokenService()->Initialize(\n GaiaConstants::kChromeSource, profile_);\n if (!GetUsername().empty()) {\n profile_->GetTokenService()->LoadTokensFromDB();\n }\n}\n\nbool SigninManager::IsInitialized() const {\n return profile_ != NULL;\n}\n\nvoid SigninManager::CleanupNotificationRegistration() {\n#if !defined(OS_CHROMEOS)\n Source<TokenService> token_service(profile_->GetTokenService());\n if (registrar_.IsRegistered(this,\n chrome::NOTIFICATION_TOKEN_AVAILABLE,\n token_service)) {\n registrar_.Remove(this,\n chrome::NOTIFICATION_TOKEN_AVAILABLE,\n token_service);\n }\n#endif\n}\n\n\/\/ If a username already exists, the user is logged in.\nconst std::string& SigninManager::GetUsername() {\n return browser_sync::IsUsingOAuth() ? oauth_username_ : username_;\n}\n\nvoid SigninManager::SetUsername(const std::string& username) {\n if (browser_sync::IsUsingOAuth())\n oauth_username_ = username;\n else\n username_ = username;\n}\n\n\/\/ static\nvoid SigninManager::PrepareForSignin() {\n DCHECK(!browser_sync::IsUsingOAuth());\n DCHECK(username_.empty());\n#if !defined(OS_CHROMEOS)\n \/\/ The Sign out should clear the token service credentials.\n \/\/ Note: In CHROMEOS we might have valid credentials but still need to\n \/\/ set up 2-factor authentication.\n DCHECK(!profile_->GetTokenService()->AreCredentialsValid());\n#endif\n}\n\n\/\/ static\nvoid SigninManager::PrepareForOAuthSignin() {\n DCHECK(browser_sync::IsUsingOAuth());\n DCHECK(oauth_username_.empty());\n#if !defined(OS_CHROMEOS)\n \/\/ The Sign out should clear the token service credentials.\n \/\/ Note: In CHROMEOS we might have valid credentials but still need to\n \/\/ set up 2-factor authentication.\n DCHECK(!profile_->GetTokenService()->AreOAuthCredentialsValid());\n#endif\n}\n\n\/\/ Users must always sign out before they sign in again.\nvoid SigninManager::StartOAuthSignIn() {\n DCHECK(browser_sync::IsUsingOAuth());\n PrepareForOAuthSignin();\n oauth_login_.reset(new GaiaOAuthFetcher(this,\n profile_->GetRequestContext(),\n profile_,\n GaiaConstants::kSyncServiceOAuth));\n oauth_login_->StartGetOAuthToken();\n \/\/ TODO(rogerta?): Bug 92325: Expand Autologin to include OAuth signin\n}\n\n\/\/ Users must always sign out before they sign in again.\nvoid SigninManager::StartSignIn(const std::string& username,\n const std::string& password,\n const std::string& login_token,\n const std::string& login_captcha) {\n DCHECK(!browser_sync::IsUsingOAuth());\n PrepareForSignin();\n username_.assign(username);\n password_.assign(password);\n\n client_login_.reset(new GaiaAuthFetcher(this,\n GaiaConstants::kChromeSource,\n profile_->GetRequestContext()));\n client_login_->StartClientLogin(username,\n password,\n \"\",\n login_token,\n login_captcha,\n GaiaAuthFetcher::HostedAccountsNotAllowed);\n\n \/\/ Register for token availability. The signin manager will pre-login the\n \/\/ user when the GAIA service token is ready for use. Only do this if we\n \/\/ are not running in ChomiumOS, since it handles pre-login itself.\n#if !defined(OS_CHROMEOS)\n if (CommandLine::ForCurrentProcess()->HasSwitch(switches::kEnableAutologin) &&\n profile_->GetPrefs()->GetBoolean(prefs::kAutologinEnabled)) {\n registrar_.Add(this,\n chrome::NOTIFICATION_TOKEN_AVAILABLE,\n Source<TokenService>(profile_->GetTokenService()));\n }\n#endif\n}\n\nvoid SigninManager::ProvideSecondFactorAccessCode(\n const std::string& access_code) {\n DCHECK(!browser_sync::IsUsingOAuth());\n DCHECK(!username_.empty() && !password_.empty() &&\n last_result_.data.empty());\n\n client_login_.reset(new GaiaAuthFetcher(this,\n GaiaConstants::kChromeSource,\n profile_->GetRequestContext()));\n client_login_->StartClientLogin(username_,\n access_code,\n \"\",\n std::string(),\n std::string(),\n GaiaAuthFetcher::HostedAccountsNotAllowed);\n}\n\nvoid SigninManager::SignOut() {\n if (!profile_)\n return;\n\n CleanupNotificationRegistration();\n\n client_login_.reset();\n last_result_ = ClientLoginResult();\n username_.clear();\n oauth_username_.clear();\n password_.clear();\n had_two_factor_error_ = false;\n profile_->GetPrefs()->ClearPref(prefs::kGoogleServicesUsername);\n profile_->GetPrefs()->ClearPref(prefs::kSyncUsingOAuth);\n profile_->GetPrefs()->ScheduleSavePersistentPrefs();\n profile_->GetTokenService()->ResetCredentialsInMemory();\n profile_->GetTokenService()->EraseTokensFromDB();\n}\n\nvoid SigninManager::OnClientLoginSuccess(const ClientLoginResult& result) {\n DCHECK(!browser_sync::IsUsingOAuth());\n last_result_ = result;\n \/\/ Make a request for the canonical email address.\n client_login_->StartGetUserInfo(result.lsid, kGetInfoEmailKey);\n}\n\n\/\/ NOTE: GetUserInfo is a ClientLogin request similar to OAuth's userinfo\nvoid SigninManager::OnGetUserInfoSuccess(const std::string& key,\n const std::string& value) {\n DCHECK(!browser_sync::IsUsingOAuth());\n DCHECK(key == kGetInfoEmailKey);\n\n username_ = value;\n profile_->GetPrefs()->SetString(prefs::kGoogleServicesUsername, username_);\n profile_->GetPrefs()->SetBoolean(prefs::kSyncUsingOAuth, false);\n profile_->GetPrefs()->ScheduleSavePersistentPrefs();\n\n GoogleServiceSigninSuccessDetails details(username_, password_);\n NotificationService::current()->Notify(\n chrome::NOTIFICATION_GOOGLE_SIGNIN_SUCCESSFUL,\n Source<Profile>(profile_),\n Details<const GoogleServiceSigninSuccessDetails>(&details));\n\n password_.clear(); \/\/ Don't need it anymore.\n\n profile_->GetTokenService()->UpdateCredentials(last_result_);\n DCHECK(profile_->GetTokenService()->AreCredentialsValid());\n profile_->GetTokenService()->StartFetchingTokens();\n}\n\nvoid SigninManager::OnGetUserInfoKeyNotFound(const std::string& key) {\n DCHECK(!browser_sync::IsUsingOAuth());\n DCHECK(key == kGetInfoEmailKey);\n LOG(ERROR) << \"Account is not associated with a valid email address. \"\n << \"Login failed.\";\n OnClientLoginFailure(GoogleServiceAuthError(\n GoogleServiceAuthError::INVALID_GAIA_CREDENTIALS));\n}\n\nvoid SigninManager::OnGetUserInfoFailure(const GoogleServiceAuthError& error) {\n DCHECK(!browser_sync::IsUsingOAuth());\n LOG(ERROR) << \"Unable to retreive the canonical email address. Login failed.\";\n OnClientLoginFailure(error);\n}\n\nvoid SigninManager::OnTokenAuthFailure(const GoogleServiceAuthError& error) {\n DCHECK(!browser_sync::IsUsingOAuth());\n#if !defined(OS_CHROMEOS)\n VLOG(1) << \"Unable to retrieve the token auth.\";\n CleanupNotificationRegistration();\n#endif\n}\n\nvoid SigninManager::OnClientLoginFailure(const GoogleServiceAuthError& error) {\n DCHECK(!browser_sync::IsUsingOAuth());\n NotificationService::current()->Notify(\n chrome::NOTIFICATION_GOOGLE_SIGNIN_FAILED,\n Source<Profile>(profile_),\n Details<const GoogleServiceAuthError>(&error));\n\n \/\/ We don't sign-out if the password was valid and we're just dealing with\n \/\/ a second factor error, and we don't sign out if we're dealing with\n \/\/ an invalid access code (again, because the password was valid).\n bool invalid_gaia = error.state() ==\n GoogleServiceAuthError::INVALID_GAIA_CREDENTIALS;\n if (error.state() == GoogleServiceAuthError::TWO_FACTOR ||\n (had_two_factor_error_ && invalid_gaia)) {\n had_two_factor_error_ = true;\n return;\n }\n\n SignOut();\n}\n\nvoid SigninManager::OnGetOAuthTokenSuccess(const std::string& oauth_token) {\n DCHECK(browser_sync::IsUsingOAuth());\n VLOG(1) << \"SigninManager::SigninManager::OnGetOAuthTokenSuccess\";\n}\n\nvoid SigninManager::OnGetOAuthTokenFailure(\n const GoogleServiceAuthError& error) {\n DCHECK(browser_sync::IsUsingOAuth());\n LOG(WARNING) << \"SigninManager::OnGetOAuthTokenFailure\";\n NotificationService::current()->Notify(\n chrome::NOTIFICATION_GOOGLE_SIGNIN_FAILED,\n Source<Profile>(profile_),\n Details<const GoogleServiceAuthError>(&error));\n SignOut();\n}\n\nvoid SigninManager::OnOAuthGetAccessTokenSuccess(const std::string& token,\n const std::string& secret) {\n DCHECK(browser_sync::IsUsingOAuth());\n VLOG(1) << \"SigninManager::OnOAuthGetAccessTokenSuccess\";\n profile_->GetTokenService()->UpdateOAuthCredentials(token, secret);\n}\n\nvoid SigninManager::OnOAuthGetAccessTokenFailure(\n const GoogleServiceAuthError& error) {\n DCHECK(browser_sync::IsUsingOAuth());\n LOG(WARNING) << \"SigninManager::OnOAuthGetAccessTokenFailure\";\n}\n\nvoid SigninManager::OnOAuthWrapBridgeSuccess(const std::string& service_name,\n const std::string& token,\n const std::string& expires_in) {\n DCHECK(browser_sync::IsUsingOAuth());\n VLOG(1) << \"SigninManager::OnOAuthWrapBridgeSuccess\";\n}\n\nvoid SigninManager::OnOAuthWrapBridgeFailure(\n const std::string& service_scope,\n const GoogleServiceAuthError& error) {\n DCHECK(browser_sync::IsUsingOAuth());\n LOG(WARNING) << \"SigninManager::OnOAuthWrapBridgeFailure\";\n}\n\n\/\/ NOTE: userinfo is an OAuth request similar to ClientLogin's GetUserInfo\nvoid SigninManager::OnUserInfoSuccess(const std::string& email) {\n DCHECK(browser_sync::IsUsingOAuth());\n VLOG(1) << \"Sync signin for \" << email << \" is complete.\";\n oauth_username_ = email;\n profile_->GetPrefs()->SetString(\n prefs::kGoogleServicesUsername, oauth_username_);\n profile_->GetPrefs()->SetBoolean(prefs::kSyncUsingOAuth, true);\n profile_->GetPrefs()->ScheduleSavePersistentPrefs();\n\n DCHECK(password_.empty());\n GoogleServiceSigninSuccessDetails details(oauth_username_, \"\");\n NotificationService::current()->Notify(\n chrome::NOTIFICATION_GOOGLE_SIGNIN_SUCCESSFUL,\n Source<Profile>(profile_),\n Details<const GoogleServiceSigninSuccessDetails>(&details));\n\n TokenService* token_service = profile_->GetTokenService();\n CHECK(token_service);\n DCHECK(token_service->AreOAuthCredentialsValid());\n token_service->StartFetchingOAuthTokens();\n}\n\nvoid SigninManager::OnUserInfoFailure(const GoogleServiceAuthError& error) {\n DCHECK(browser_sync::IsUsingOAuth());\n LOG(WARNING) << \"SigninManager::OnUserInfoFailure\";\n}\n\nvoid SigninManager::Observe(int type,\n const NotificationSource& source,\n const NotificationDetails& details) {\n#if !defined(OS_CHROMEOS)\n DCHECK(type == chrome::NOTIFICATION_TOKEN_AVAILABLE);\n TokenService::TokenAvailableDetails* tok_details =\n Details<TokenService::TokenAvailableDetails>(details).ptr();\n\n \/\/ If a GAIA service token has become available, use it to pre-login the\n \/\/ user to other services that depend on GAIA credentials.\n if (tok_details->service() == GaiaConstants::kGaiaService) {\n DCHECK(!browser_sync::IsUsingOAuth());\n if (client_login_.get() == NULL) {\n client_login_.reset(new GaiaAuthFetcher(this,\n GaiaConstants::kChromeSource,\n profile_->GetRequestContext()));\n }\n\n client_login_->StartMergeSession(tok_details->token());\n\n \/\/ We only want to do this once per sign-in.\n CleanupNotificationRegistration();\n }\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 <algorithm>\n\n#include \"base\/command_line.h\"\n#include \"base\/file_util.h\"\n#include \"base\/logging.h\"\n#include \"base\/mac\/scoped_nsautorelease_pool.h\"\n#include \"base\/path_service.h\"\n#include \"base\/process_util.h\"\n#include \"base\/sha1.h\"\n#include \"base\/singleton.h\"\n#include \"base\/string16.h\"\n#include \"base\/string_number_conversions.h\"\n#include \"base\/string_util.h\"\n#include \"base\/utf_string_conversions.h\"\n#include \"base\/version.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\/common\/chrome_version_info.h\"\n#include \"chrome\/common\/service_process_util.h\"\n#include \"content\/common\/child_process_host.h\"\n\n#if !defined(OS_MACOSX)\n\nnamespace {\n\n\/\/ This should be more than enough to hold a version string assuming each part\n\/\/ of the version string is an int64.\nconst uint32 kMaxVersionStringLength = 256;\n\n\/\/ The structure that gets written to shared memory.\nstruct ServiceProcessSharedData {\n char service_process_version[kMaxVersionStringLength];\n base::ProcessId service_process_pid;\n};\n\n\/\/ Gets the name of the shared memory used by the service process to write its\n\/\/ version. The name is not versioned.\nstd::string GetServiceProcessSharedMemName() {\n return GetServiceProcessScopedName(\"_service_shmem\");\n}\n\nenum ServiceProcessRunningState {\n SERVICE_NOT_RUNNING,\n SERVICE_OLDER_VERSION_RUNNING,\n SERVICE_SAME_VERSION_RUNNING,\n SERVICE_NEWER_VERSION_RUNNING,\n};\n\nServiceProcessRunningState GetServiceProcessRunningState(\n std::string* service_version_out, base::ProcessId* pid_out) {\n std::string version;\n if (!GetServiceProcessData(&version, pid_out))\n return SERVICE_NOT_RUNNING;\n\n#if defined(OS_POSIX)\n \/\/ We only need to check for service running on POSIX because Windows cleans\n \/\/ up shared memory files when an app crashes, so there isn't a chance of\n \/\/ us reading bogus data from shared memory for an app that has died.\n if (!CheckServiceProcessReady()) {\n return SERVICE_NOT_RUNNING;\n }\n#endif \/\/ defined(OS_POSIX)\n\n \/\/ At this time we have a version string. Set the out param if it exists.\n if (service_version_out)\n *service_version_out = version;\n\n scoped_ptr<Version> service_version(Version::GetVersionFromString(version));\n \/\/ If the version string is invalid, treat it like an older version.\n if (!service_version.get())\n return SERVICE_OLDER_VERSION_RUNNING;\n\n \/\/ Get the version of the currently *running* instance of Chrome.\n chrome::VersionInfo version_info;\n if (!version_info.is_valid()) {\n NOTREACHED() << \"Failed to get current file version\";\n \/\/ Our own version is invalid. This is an error case. Pretend that we\n \/\/ are out of date.\n return SERVICE_NEWER_VERSION_RUNNING;\n }\n scoped_ptr<Version> running_version(Version::GetVersionFromString(\n version_info.Version()));\n if (!running_version.get()) {\n NOTREACHED() << \"Failed to parse version info\";\n \/\/ Our own version is invalid. This is an error case. Pretend that we\n \/\/ are out of date.\n return SERVICE_NEWER_VERSION_RUNNING;\n }\n\n if (running_version->CompareTo(*service_version) > 0) {\n return SERVICE_OLDER_VERSION_RUNNING;\n } else if (service_version->CompareTo(*running_version) > 0) {\n return SERVICE_NEWER_VERSION_RUNNING;\n }\n return SERVICE_SAME_VERSION_RUNNING;\n}\n\n} \/\/ namespace\n\n\/\/ Return a name that is scoped to this instance of the service process. We\n\/\/ use the hash of the user-data-dir as a scoping prefix. We can't use\n\/\/ the user-data-dir itself as we have limits on the size of the lock names.\nstd::string GetServiceProcessScopedName(const std::string& append_str) {\n FilePath user_data_dir;\n PathService::Get(chrome::DIR_USER_DATA, &user_data_dir);\n#if defined(OS_WIN)\n std::string user_data_dir_path = WideToUTF8(user_data_dir.value());\n#elif defined(OS_POSIX)\n std::string user_data_dir_path = user_data_dir.value();\n#endif \/\/ defined(OS_WIN)\n std::string hash = base::SHA1HashString(user_data_dir_path);\n std::string hex_hash = base::HexEncode(hash.c_str(), hash.length());\n return hex_hash + \".\" + append_str;\n}\n\n\/\/ Return a name that is scoped to this instance of the service process. We\n\/\/ use the user-data-dir and the version as a scoping prefix.\nstd::string GetServiceProcessScopedVersionedName(\n const std::string& append_str) {\n std::string versioned_str;\n chrome::VersionInfo version_info;\n DCHECK(version_info.is_valid());\n versioned_str.append(version_info.Version());\n versioned_str.append(append_str);\n return GetServiceProcessScopedName(versioned_str);\n}\n\n\/\/ Reads the named shared memory to get the shared data. Returns false if no\n\/\/ matching shared memory was found.\nbool GetServiceProcessData(std::string* version, base::ProcessId* pid) {\n scoped_ptr<base::SharedMemory> shared_mem_service_data;\n shared_mem_service_data.reset(new base::SharedMemory());\n ServiceProcessSharedData* service_data = NULL;\n if (shared_mem_service_data.get() &&\n shared_mem_service_data->Open(GetServiceProcessSharedMemName(), true) &&\n shared_mem_service_data->Map(sizeof(ServiceProcessSharedData))) {\n service_data = reinterpret_cast<ServiceProcessSharedData*>(\n shared_mem_service_data->memory());\n \/\/ Make sure the version in shared memory is null-terminated. If it is not,\n \/\/ treat it as invalid.\n if (version && memchr(service_data->service_process_version, '\\0',\n sizeof(service_data->service_process_version)))\n *version = service_data->service_process_version;\n if (pid)\n *pid = service_data->service_process_pid;\n return true;\n }\n return false;\n}\n\n\/\/ Gets the name of the service process IPC channel.\nIPC::ChannelHandle GetServiceProcessChannel() {\n return GetServiceProcessScopedVersionedName(\"_service_ipc\");\n}\n\n#endif \/\/ !OS_MACOSX\n\nServiceProcessState::ServiceProcessState() : state_(NULL) {\n CreateAutoRunCommandLine();\n}\n\nServiceProcessState::~ServiceProcessState() {\n#if !defined(OS_MACOSX)\n if (shared_mem_service_data_.get()) {\n shared_mem_service_data_->Delete(GetServiceProcessSharedMemName());\n }\n#endif \/\/ !OS_MACOSX\n TearDownState();\n}\n\n\/\/ static\nServiceProcessState* ServiceProcessState::GetInstance() {\n return Singleton<ServiceProcessState>::get();\n}\n\nvoid ServiceProcessState::SignalStopped() {\n TearDownState();\n shared_mem_service_data_.reset();\n}\n\n#if !defined(OS_MACOSX)\nbool ServiceProcessState::Initialize() {\n if (!CreateState()) {\n return false;\n }\n if (!TakeSingletonLock()) {\n return false;\n }\n \/\/ Now that we have the singleton, take care of killing an older version, if\n \/\/ it exists.\n if (!HandleOtherVersion())\n return false;\n\n \/\/ Write the version we are using to shared memory. This can be used by a\n \/\/ newer service to signal us to exit.\n return CreateSharedData();\n}\n\nbool ServiceProcessState::HandleOtherVersion() {\n std::string running_version;\n base::ProcessId process_id;\n ServiceProcessRunningState state =\n GetServiceProcessRunningState(&running_version, &process_id);\n switch (state) {\n case SERVICE_SAME_VERSION_RUNNING:\n case SERVICE_NEWER_VERSION_RUNNING:\n return false;\n case SERVICE_OLDER_VERSION_RUNNING:\n \/\/ If an older version is running, kill it.\n ForceServiceProcessShutdown(running_version, process_id);\n break;\n case SERVICE_NOT_RUNNING:\n break;\n }\n return true;\n}\n\nbool ServiceProcessState::CreateSharedData() {\n chrome::VersionInfo version_info;\n if (!version_info.is_valid()) {\n NOTREACHED() << \"Failed to get current file version\";\n return false;\n }\n if (version_info.Version().length() >= kMaxVersionStringLength) {\n NOTREACHED() << \"Version string length is << \" <<\n version_info.Version().length() << \"which is longer than\" <<\n kMaxVersionStringLength;\n return false;\n }\n\n scoped_ptr<base::SharedMemory> shared_mem_service_data(\n new base::SharedMemory());\n if (!shared_mem_service_data.get())\n return false;\n\n uint32 alloc_size = sizeof(ServiceProcessSharedData);\n if (!shared_mem_service_data->CreateNamed(GetServiceProcessSharedMemName(),\n true, alloc_size))\n return false;\n\n if (!shared_mem_service_data->Map(alloc_size))\n return false;\n\n memset(shared_mem_service_data->memory(), 0, alloc_size);\n ServiceProcessSharedData* shared_data =\n reinterpret_cast<ServiceProcessSharedData*>(\n shared_mem_service_data->memory());\n memcpy(shared_data->service_process_version, version_info.Version().c_str(),\n version_info.Version().length());\n shared_data->service_process_pid = base::GetCurrentProcId();\n shared_mem_service_data_.reset(shared_mem_service_data.release());\n return true;\n}\n\nIPC::ChannelHandle ServiceProcessState::GetServiceProcessChannel() {\n return ::GetServiceProcessChannel();\n}\n\n#endif \/\/ !OS_MACOSX\n\nvoid ServiceProcessState::CreateAutoRunCommandLine() {\n FilePath exe_path = ChildProcessHost::GetChildPath(false);\n if (exe_path.empty()) {\n NOTREACHED() << \"Unable to get service process binary name.\";\n }\n autorun_command_line_.reset(new CommandLine(exe_path));\n autorun_command_line_->AppendSwitchASCII(switches::kProcessType,\n switches::kServiceProcess);\n\n \/\/ The user data directory is the only other flag we currently want to\n \/\/ possibly store.\n const CommandLine& browser_command_line = *CommandLine::ForCurrentProcess();\n FilePath user_data_dir =\n browser_command_line.GetSwitchValuePath(switches::kUserDataDir);\n if (!user_data_dir.empty())\n autorun_command_line_->AppendSwitchPath(switches::kUserDataDir,\n user_data_dir);\n}\n<commit_msg>Committing on behalf of asharif1@chromium.org.<commit_after>\/\/ Copyright (c) 2010 The Chromium Authors. All rights reserved.\n\/\/ Use of this source code is governed by a BSD-style license that can be\n\/\/ found in the LICENSE file.\n\n#include <algorithm>\n\n#include \"base\/command_line.h\"\n#include \"base\/file_util.h\"\n#include \"base\/logging.h\"\n#include \"base\/mac\/scoped_nsautorelease_pool.h\"\n#include \"base\/path_service.h\"\n#include \"base\/process_util.h\"\n#include \"base\/sha1.h\"\n#include \"base\/singleton.h\"\n#include \"base\/string16.h\"\n#include \"base\/string_number_conversions.h\"\n#include \"base\/string_util.h\"\n#include \"base\/utf_string_conversions.h\"\n#include \"base\/version.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\/common\/chrome_version_info.h\"\n#include \"chrome\/common\/service_process_util.h\"\n#include \"content\/common\/child_process_host.h\"\n\n#if !defined(OS_MACOSX)\n\nnamespace {\n\n\/\/ This should be more than enough to hold a version string assuming each part\n\/\/ of the version string is an int64.\nconst uint32 kMaxVersionStringLength = 256;\n\n\/\/ The structure that gets written to shared memory.\nstruct ServiceProcessSharedData {\n char service_process_version[kMaxVersionStringLength];\n base::ProcessId service_process_pid;\n};\n\n\/\/ Gets the name of the shared memory used by the service process to write its\n\/\/ version. The name is not versioned.\nstd::string GetServiceProcessSharedMemName() {\n return GetServiceProcessScopedName(\"_service_shmem\");\n}\n\nenum ServiceProcessRunningState {\n SERVICE_NOT_RUNNING,\n SERVICE_OLDER_VERSION_RUNNING,\n SERVICE_SAME_VERSION_RUNNING,\n SERVICE_NEWER_VERSION_RUNNING,\n};\n\nServiceProcessRunningState GetServiceProcessRunningState(\n std::string* service_version_out, base::ProcessId* pid_out) {\n std::string version;\n if (!GetServiceProcessData(&version, pid_out))\n return SERVICE_NOT_RUNNING;\n\n#if defined(OS_POSIX)\n \/\/ We only need to check for service running on POSIX because Windows cleans\n \/\/ up shared memory files when an app crashes, so there isn't a chance of\n \/\/ us reading bogus data from shared memory for an app that has died.\n if (!CheckServiceProcessReady()) {\n return SERVICE_NOT_RUNNING;\n }\n#endif \/\/ defined(OS_POSIX)\n\n \/\/ At this time we have a version string. Set the out param if it exists.\n if (service_version_out)\n *service_version_out = version;\n\n scoped_ptr<Version> service_version(Version::GetVersionFromString(version));\n \/\/ If the version string is invalid, treat it like an older version.\n if (!service_version.get())\n return SERVICE_OLDER_VERSION_RUNNING;\n\n \/\/ Get the version of the currently *running* instance of Chrome.\n chrome::VersionInfo version_info;\n if (!version_info.is_valid()) {\n NOTREACHED() << \"Failed to get current file version\";\n \/\/ Our own version is invalid. This is an error case. Pretend that we\n \/\/ are out of date.\n return SERVICE_NEWER_VERSION_RUNNING;\n }\n scoped_ptr<Version> running_version(Version::GetVersionFromString(\n version_info.Version()));\n if (!running_version.get()) {\n NOTREACHED() << \"Failed to parse version info\";\n \/\/ Our own version is invalid. This is an error case. Pretend that we\n \/\/ are out of date.\n return SERVICE_NEWER_VERSION_RUNNING;\n }\n\n if (running_version->CompareTo(*service_version) > 0) {\n return SERVICE_OLDER_VERSION_RUNNING;\n } else if (service_version->CompareTo(*running_version) > 0) {\n return SERVICE_NEWER_VERSION_RUNNING;\n }\n return SERVICE_SAME_VERSION_RUNNING;\n}\n\n} \/\/ namespace\n\n\/\/ Return a name that is scoped to this instance of the service process. We\n\/\/ use the hash of the user-data-dir as a scoping prefix. We can't use\n\/\/ the user-data-dir itself as we have limits on the size of the lock names.\nstd::string GetServiceProcessScopedName(const std::string& append_str) {\n FilePath user_data_dir;\n PathService::Get(chrome::DIR_USER_DATA, &user_data_dir);\n#if defined(OS_WIN)\n std::string user_data_dir_path = WideToUTF8(user_data_dir.value());\n#elif defined(OS_POSIX)\n std::string user_data_dir_path = user_data_dir.value();\n#endif \/\/ defined(OS_WIN)\n std::string hash = base::SHA1HashString(user_data_dir_path);\n std::string hex_hash = base::HexEncode(hash.c_str(), hash.length());\n return hex_hash + \".\" + append_str;\n}\n\n\/\/ Return a name that is scoped to this instance of the service process. We\n\/\/ use the user-data-dir and the version as a scoping prefix.\nstd::string GetServiceProcessScopedVersionedName(\n const std::string& append_str) {\n std::string versioned_str;\n chrome::VersionInfo version_info;\n DCHECK(version_info.is_valid());\n versioned_str.append(version_info.Version());\n versioned_str.append(append_str);\n return GetServiceProcessScopedName(versioned_str);\n}\n\n\/\/ Reads the named shared memory to get the shared data. Returns false if no\n\/\/ matching shared memory was found.\nbool GetServiceProcessData(std::string* version, base::ProcessId* pid) {\n scoped_ptr<base::SharedMemory> shared_mem_service_data;\n shared_mem_service_data.reset(new base::SharedMemory());\n ServiceProcessSharedData* service_data = NULL;\n if (shared_mem_service_data.get() &&\n shared_mem_service_data->Open(GetServiceProcessSharedMemName(), true) &&\n shared_mem_service_data->Map(sizeof(ServiceProcessSharedData))) {\n service_data = reinterpret_cast<ServiceProcessSharedData*>(\n shared_mem_service_data->memory());\n \/\/ Make sure the version in shared memory is null-terminated. If it is not,\n \/\/ treat it as invalid.\n if (version && memchr(service_data->service_process_version, '\\0',\n sizeof(service_data->service_process_version)))\n *version = service_data->service_process_version;\n if (pid)\n *pid = service_data->service_process_pid;\n return true;\n }\n return false;\n}\n\n\/\/ Gets the name of the service process IPC channel.\nIPC::ChannelHandle GetServiceProcessChannel() {\n return GetServiceProcessScopedVersionedName(\"_service_ipc\");\n}\n\n#endif \/\/ !OS_MACOSX\n\nServiceProcessState::ServiceProcessState() : state_(NULL) {\n CreateAutoRunCommandLine();\n}\n\nServiceProcessState::~ServiceProcessState() {\n#if !defined(OS_MACOSX)\n if (shared_mem_service_data_.get()) {\n shared_mem_service_data_->Delete(GetServiceProcessSharedMemName());\n }\n#endif \/\/ !OS_MACOSX\n TearDownState();\n}\n\n\/\/ static\nServiceProcessState* ServiceProcessState::GetInstance() {\n return Singleton<ServiceProcessState>::get();\n}\n\nvoid ServiceProcessState::SignalStopped() {\n TearDownState();\n shared_mem_service_data_.reset();\n}\n\n#if !defined(OS_MACOSX)\nbool ServiceProcessState::Initialize() {\n if (!CreateState()) {\n return false;\n }\n if (!TakeSingletonLock()) {\n return false;\n }\n \/\/ Now that we have the singleton, take care of killing an older version, if\n \/\/ it exists.\n if (!HandleOtherVersion())\n return false;\n\n \/\/ Write the version we are using to shared memory. This can be used by a\n \/\/ newer service to signal us to exit.\n return CreateSharedData();\n}\n\nbool ServiceProcessState::HandleOtherVersion() {\n std::string running_version;\n base::ProcessId process_id = 0;\n ServiceProcessRunningState state =\n GetServiceProcessRunningState(&running_version, &process_id);\n switch (state) {\n case SERVICE_SAME_VERSION_RUNNING:\n case SERVICE_NEWER_VERSION_RUNNING:\n return false;\n case SERVICE_OLDER_VERSION_RUNNING:\n \/\/ If an older version is running, kill it.\n ForceServiceProcessShutdown(running_version, process_id);\n break;\n case SERVICE_NOT_RUNNING:\n break;\n }\n return true;\n}\n\nbool ServiceProcessState::CreateSharedData() {\n chrome::VersionInfo version_info;\n if (!version_info.is_valid()) {\n NOTREACHED() << \"Failed to get current file version\";\n return false;\n }\n if (version_info.Version().length() >= kMaxVersionStringLength) {\n NOTREACHED() << \"Version string length is << \" <<\n version_info.Version().length() << \"which is longer than\" <<\n kMaxVersionStringLength;\n return false;\n }\n\n scoped_ptr<base::SharedMemory> shared_mem_service_data(\n new base::SharedMemory());\n if (!shared_mem_service_data.get())\n return false;\n\n uint32 alloc_size = sizeof(ServiceProcessSharedData);\n if (!shared_mem_service_data->CreateNamed(GetServiceProcessSharedMemName(),\n true, alloc_size))\n return false;\n\n if (!shared_mem_service_data->Map(alloc_size))\n return false;\n\n memset(shared_mem_service_data->memory(), 0, alloc_size);\n ServiceProcessSharedData* shared_data =\n reinterpret_cast<ServiceProcessSharedData*>(\n shared_mem_service_data->memory());\n memcpy(shared_data->service_process_version, version_info.Version().c_str(),\n version_info.Version().length());\n shared_data->service_process_pid = base::GetCurrentProcId();\n shared_mem_service_data_.reset(shared_mem_service_data.release());\n return true;\n}\n\nIPC::ChannelHandle ServiceProcessState::GetServiceProcessChannel() {\n return ::GetServiceProcessChannel();\n}\n\n#endif \/\/ !OS_MACOSX\n\nvoid ServiceProcessState::CreateAutoRunCommandLine() {\n FilePath exe_path = ChildProcessHost::GetChildPath(false);\n if (exe_path.empty()) {\n NOTREACHED() << \"Unable to get service process binary name.\";\n }\n autorun_command_line_.reset(new CommandLine(exe_path));\n autorun_command_line_->AppendSwitchASCII(switches::kProcessType,\n switches::kServiceProcess);\n\n \/\/ The user data directory is the only other flag we currently want to\n \/\/ possibly store.\n const CommandLine& browser_command_line = *CommandLine::ForCurrentProcess();\n FilePath user_data_dir =\n browser_command_line.GetSwitchValuePath(switches::kUserDataDir);\n if (!user_data_dir.empty())\n autorun_command_line_->AppendSwitchPath(switches::kUserDataDir,\n user_data_dir);\n}\n<|endoftext|>"} {"text":"<commit_before>\/*\n * Copyright (C) 2013 Marcin Zdun\n *\n * Permission is hereby granted, free of charge, to any person\n * obtaining a copy of this software and associated documentation\n * files (the \"Software\"), to deal in the Software without\n * restriction, including without limitation the rights to use, copy,\n * modify, merge, publish, distribute, sublicense, and\/or sell copies\n * of the Software, and to permit persons to whom the Software is\n * furnished to do so, subject to the following conditions:\n *\n * The above copyright notice and this permission notice shall be\n * included in all copies or substantial portions of the Software.\n *\n * THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND,\n * EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF\n * MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND\n * NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS\n * BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN\n * ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN\n * CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE\n * SOFTWARE.\n *\/\n\n#include <stdio.h>\n#include <string.h>\n\n#include <memory>\n#include <iostream>\n#include <algorithm>\n#include <map>\n\n#include <scene.hpp>\n#include <camera.hpp>\n#include <block.hpp>\n\nstruct Command {\n\tconst char* name;\n\tint (*command)(int, char* []);\n\tCommand(const char* name, int (*command)(int, char* []))\n\t\t: name(name)\n\t\t, command(command)\n\t{}\n\tint run(int argc, char* argv[])\n\t{\n\t\treturn command(argc, argv);\n\t}\n};\n\ntemplate <size_t N>\nCommand* get_cmmd(Command (&commands)[N], int argc, char* argv[])\n{\n\tif (argc > 1)\n\t\tfor (size_t i = 0; i < N; ++i)\n\t\t{\n\t\t\tif (strcmp(argv[1], commands[i].name) == 0)\n\t\t\t\treturn commands + i;\n\t\t}\n\n\t\tif (argc > 1)\n\t\t\tfprintf(stderr, \"%s: unknown command: %s\\n\", argv[0], argv[1]);\n\t\telse\n\t\t\tfprintf(stderr, \"%s: command missing\\n\", argv[0]);\n\n\t\tfprintf(stderr, \"\\nKnown commands are:\\n\");\n\t\tfor (size_t i = 0; i < N; ++i)\n\t\t\tfprintf(stderr, \"\\t%s\\n\", commands[i].name);\n\n\t\treturn nullptr;\n}\n\nint test(int, char* []);\n\nCommand commands[] = {\n\tCommand(\"test\", test)\n};\n\nint main(int argc, char* argv[])\n{\n\tchar prog[] = \"studio\";\n\targv[0] = prog;\n\tCommand* command = get_cmmd(commands, argc, argv);\n\n\tif (command == nullptr)\n\t\treturn 1;\n\n\treturn command->run(argc - 1, argv + 1);\n}\n\nusing namespace studio;\n\nint test(int argc, char* argv [])\n{\n\tScene scene;\n\n\tauto cam = scene.add<Camera>(math::Vertex(0, 500, -1000), math::Vertex(0, 500, 0));\n\tauto block = scene.add<Block>(100, 100, 100);\n\n\tscene.renderTo(cam.get());\n\n\treturn 0;\n}<commit_msg>Example app<commit_after>\/*\n * Copyright (C) 2013 Marcin Zdun\n *\n * Permission is hereby granted, free of charge, to any person\n * obtaining a copy of this software and associated documentation\n * files (the \"Software\"), to deal in the Software without\n * restriction, including without limitation the rights to use, copy,\n * modify, merge, publish, distribute, sublicense, and\/or sell copies\n * of the Software, and to permit persons to whom the Software is\n * furnished to do so, subject to the following conditions:\n *\n * The above copyright notice and this permission notice shall be\n * included in all copies or substantial portions of the Software.\n *\n * THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND,\n * EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF\n * MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND\n * NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS\n * BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN\n * ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN\n * CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE\n * SOFTWARE.\n *\/\n\n#include <stdio.h>\n#include <string.h>\n\n#include <memory>\n#include <iostream>\n#include <algorithm>\n#include <map>\n\n#include <scene.hpp>\n#include <camera.hpp>\n#include <block.hpp>\n#include <platform_api.hpp>\n#include <canvas_types.hpp>\n\n#include <future>\n#include <iomanip>\n\n#define STEREO_CANVAS\n\n#if 1\ntypedef studio::CyanMagentaCanvas StereoCanvasType;\n#else\ntypedef studio::SideBySideCanvas StereoCanvasType;\n#endif\n\nstruct Command {\n\tconst char* name;\n\tint (*command)(int, char* []);\n\tCommand(const char* name, int (*command)(int, char* []))\n\t\t: name(name)\n\t\t, command(command)\n\t{}\n\tint run(int argc, char* argv[])\n\t{\n\t\treturn command(argc, argv);\n\t}\n};\n\ntemplate <size_t N>\nCommand* get_cmmd(Command (&commands)[N], int argc, char* argv[])\n{\n\tif (argc > 1)\n\t\tfor (size_t i = 0; i < N; ++i)\n\t\t{\n\t\t\tif (strcmp(argv[1], commands[i].name) == 0)\n\t\t\t\treturn commands + i;\n\t\t}\n\n\t\tif (argc > 1)\n\t\t\tfprintf(stderr, \"%s: unknown command: %s\\n\", argv[0], argv[1]);\n\t\telse\n\t\t\tfprintf(stderr, \"%s: command missing\\n\", argv[0]);\n\n\t\tfprintf(stderr, \"\\nKnown commands are:\\n\");\n\t\tfor (size_t i = 0; i < N; ++i)\n\t\t\tfprintf(stderr, \"\\t%s\\n\", commands[i].name);\n\n\t\treturn nullptr;\n}\n\nint test(int, char* []);\n\nCommand commands[] = {\n\tCommand(\"test\", test)\n};\n\nint main(int argc, char* argv[])\n{\n\tchar prog[] = \"studio\";\n\targv[0] = prog;\n\tCommand* command = get_cmmd(commands, argc, argv);\n\n\tif (command == nullptr)\n\t\treturn 1;\n\n\treturn command->run(argc - 1, argv + 1);\n}\n\nusing namespace studio;\n\nvoid setUp(std::shared_ptr<Scene>& scene)\n{\n\tscene->add<Block>(2015, 1235, 1);\n\tscene->add<Block>(2015, 1, 1060)->translate(0, 0, -1060);\n\tscene->add<Block>(2015, 1, 1060)->translate(0, 1235, -1060);\n\n\tscene->add<Block>(425, 300, 210)->translate(1365, 0, -210);\n\tscene->add<Block>(425, 300, 210)->translate(940, 0, -210);\n\tscene->add<Block>(425, 300, 210)->translate(515, 0, -210);\n\n\tscene->add<Block>(225, 590, 210)->translate(1790, 0, -210);\n\tscene->add<Block>(225, 590, 210)->translate(1790, 590, -210);\n\n\tscene->add<Block>(225, 780, 160)->translate(1565, 400, -160);\n\tscene->add<Block>(225, 590, 160)->translate(1340, 590, -160);\n\n\tscene->add<Block>(225, 590, 160)->translate(410, 590, -160);\n\tscene->add<Block>(225, 780, 160)->translate(185, 400, -160);\n\n\tscene->add<Block>(577, 352, 48)->translate(700, 545, -96);\n}\n\nstd::shared_ptr<StereoCanvasType> g_canvas;\n\nint test(int argc, char* argv [])\n{\n\tPlatformAPI init;\n\n\tauto scene = std::make_shared<Scene>();\n\tsetUp(scene);\n\n\tmath::Vertex camPos { 1007.5, 617.5, -1000 };\n\n#ifdef STEREO_CANVAS\n\tauto canvas = std::make_shared<StereoCanvasType>(1400, 800);\n\tg_canvas = canvas;\n\tauto cam = scene->add<StereoCamera>(1000, 50, camPos, camPos + math::Vertex(0, 0, 100));\n\tcam->setCanvas(canvas.get());\n#else\n\tauto cam = scene->add<Camera>(1000, camPos, camPos + math::Vertex(0, 0, 100));\n\tauto canvas = cam->create_canvas<SimpleCanvas>(1400, 800);\n#endif\n\n\tscene->renderAllCameras();\n\tcanvas->save(\"test.png\");\n\n#if 0\n\tstd::vector<std::future<void>> tasks;\n\n\tfor (size_t id = 0; id < 25; ++id)\n\t{\n\t\ttasks.push_back(std::move(std::async([=](const math::Vertex& camPos){\n\t\t\tstd::cout << \"<\" << std::flush;\n\t\t\tauto cam = scene->add<Camera>(1000, camPos + math::Vertex(50 * id, 0, 0), camPos + math::Vertex(50 * id, 0, 100));\n\t\t\tauto canvas = cam->create_canvas<BmpCanvas>(1400, 800);\n\t\t\tscene->renderTo(cam.get());\n\n\t\t\twchar_t fname[100];\n\t\t\tswprintf_s(fname, L\"test_%04d.png\", id);\n\t\t\tcanvas->save(fname, L\"image\/png\");\n\t\t\tstd::cout << \">\" << std::flush;\n\t\t}, math::Vertex{ 507.5, 800, -1000 })));\n\t}\n\n\tfor (auto && f : tasks)\n\t\tf.get();\n\n\ttasks.clear();\n#endif\n\n\tg_canvas.reset();\n\tscene.reset();\n\n\treturn 0;\n}<|endoftext|>"} {"text":"<commit_before>\/*************************************************************************\n *\n * OpenOffice.org - a multi-platform office productivity suite\n *\n * $RCSfile: file_path_helper.hxx,v $\n *\n * $Revision: 1.4 $\n *\n * last change: $Author: rt $ $Date: 2005-09-08 14:55: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 _OSL_FILE_PATH_HELPER_HXX_\n#define _OSL_FILE_PATH_HELPER_HXX_\n\n\n#ifndef _OSL_FILE_PATH_HELPER_H_\n#include \"file_path_helper.h\"\n#endif\n\n#ifndef _RTL_USTRING_HXX_\n#include <rtl\/ustring.hxx>\n#endif\n\n\nnamespace osl\n{\n\n \/*******************************************\n systemPathRemoveSeparator\n Removes the last separator from the\n given system path if any and if the path\n is not the root path '\/'\n\n @param ppustrPath [inout] a system path\n if the path is not the root path\n and the last character is a\n path separator it will be cut off\n ppustrPath must not be NULL and\n must point to a valid rtl_uString\n\n @returns nothing\n\n ******************************************\/\n\n inline void systemPathRemoveSeparator(\/*inout*\/ rtl::OUString& Path)\n {\n osl_systemPathRemoveSeparator(Path.pData);\n }\n\n \/*******************************************\n systemPathEnsureSeparator\n Adds a trailing path separator to the\n given system path if not already there\n and if the path is not the root path '\/'\n\n @param pustrPath [inout] a system path\n if the path is not the root path\n '\/' and has no trailing separator\n a separator will be added\n ppustrPath must not be NULL and\n must point to a valid rtl_uString\n\n @returns nothing\n\n ******************************************\/\n\n inline void systemPathEnsureSeparator(\/*inout*\/ rtl::OUString& Path)\n {\n osl_systemPathEnsureSeparator(&Path.pData);\n }\n\n \/*******************************************\n systemPathIsRelativePath\n Returns true if the given path is a\n relative path and so starts not with '\/'\n\n @param pustrPath [in] a system path\n pustrPath must not be NULL\n\n @returns sal_True if the given path\n doesn't start with a separator\n else sal_False will be returned\n\n ******************************************\/\n\n inline bool systemPathIsRelativePath(const rtl::OUString& Path)\n {\n return osl_systemPathIsRelativePath(Path.pData);\n }\n\n \/******************************************\n systemPathIsAbsolutePath\n Returns true if the given path is an\n absolute path and so starts with a '\/'\n\n @param pustrPath [in] a system path\n pustrPath must not be NULL\n\n @returns sal_True if the given path\n start's with a separator else\n sal_False will be returned\n\n *****************************************\/\n\n inline bool systemPathIsAbsolutePath(const rtl::OUString& Path)\n {\n return osl_systemPathIsAbsolutePath(Path.pData);\n }\n\n \/******************************************\n systemPathMakeAbsolutePath\n Append a relative path to a base path\n\n @param pustrBasePath [in] a system\n path that will be considered as\n base path\n pustrBasePath must not be NULL\n\n @param pustrRelPath [in] a system path\n that will be considered as\n relative path\n pustrBasePath must not be NULL\n\n @param ppustrAbsolutePath [out] the\n resulting path which is a\n concatination of the base and\n the relative path\n if base path is empty the\n resulting absolute path is the\n relative path\n if relative path is empty the\n resulting absolute path is the\n base path\n if base and relative path are\n empty the resulting absolute\n path is also empty\n ppustrAbsolutePath must not be\n NULL and *ppustrAbsolutePath\n must be 0 or point to a valid\n rtl_uString\n\n *****************************************\/\n\n inline void systemPathMakeAbsolutePath(\n const rtl::OUString& BasePath,\n const rtl::OUString& RelPath,\n rtl::OUString& AbsolutePath)\n {\n osl_systemPathMakeAbsolutePath(\n BasePath.pData, RelPath.pData, &AbsolutePath.pData);\n }\n\n \/*****************************************\n systemPathGetParent\n Replaces the last occurrance of a path\n separator with '\\0' and returns the\n position where the '\/' was replaced\n\n @param pustrPath [inout] a system\n path, the last separator of\n this path will be replaced by\n a '\\0'\n if the path is the root path\n '\/' or the path is considered\n as to have no parent, e.g.\n '\/NoParent' or 'NoParent' or\n the path is empty no\n replacement will be made\n pustrPath must not be NULL\n\n @returns the position of the last path\n separator that was replaced\n or 0 if no replacement took\n place\n\n ****************************************\/\n\n inline sal_Int32 systemPathGetParent(\/*inout*\/ rtl::OUString& Path)\n {\n return osl_systemPathGetParent(Path.pData);\n }\n\n \/*****************************************\n systemPathGetFileOrLastDirectoryPart\n Returns the file or the directory part\n of the given path\n\n @param pustrPath [in] a system path,\n must not be NULL\n\n @param ppustrFileOrDirPart [out] on\n return receives the last part\n of the given directory or the\n file name\n if pustrPath is the root path\n '\/' an empty string will be\n returned\n if pustrPath has a trailing\n '\/' the last part before the\n '\/' will be returned else\n the part after the last '\/'\n will be returned\n\n @returns nothing\n\n ****************************************\/\n\n inline void systemPathGetFileNameOrLastDirectoryPart(\n const rtl::OUString& Path,\n rtl::OUString& FileNameOrLastDirPart)\n {\n osl_systemPathGetFileNameOrLastDirectoryPart(\n Path.pData, &FileNameOrLastDirPart.pData);\n }\n\n\n \/********************************************\n systemPathIsHiddenFileOrDirectoryEntry\n Returns sal_True if the last part of\n given system path is not '.' or '..'\n alone and starts with a '.'\n\n @param pustrPath [in] a system path,\n must not be NULL\n\n @returns sal_True if the last part of\n the given system path starts\n with '.' or sal_False the last\n part is '.' or '..' alone or\n doesn't start with a dot\n\n *********************************************\/\n\n inline bool systemPathIsHiddenFileOrDirectoryEntry(\n const rtl::OUString& Path)\n {\n return osl_systemPathIsHiddenFileOrDirectoryEntry(Path.pData);\n }\n\n\n \/************************************************\n systemPathIsLocalOrParentDirectoryEntry\n Returns sal_True if the last part of the given\n system path is the local directory entry '.'\n or the parent directory entry '..'\n\n @param pustrPath [in] a system path,\n must not be NULL\n\n @returns sal_True if the last part of the\n given system path is '.' or '..'\n else sal_False\n\n ************************************************\/\n\n inline bool systemPathIsLocalOrParentDirectoryEntry(\n const rtl::OUString& Path)\n {\n return osl_systemPathIsLocalOrParentDirectoryEntry(Path.pData);\n }\n\n \/************************************************\n searchPath\n ***********************************************\/\n\n inline bool searchPath(\n const rtl::OUString& ustrFilePath,\n const rtl::OUString& ustrSearchPathList,\n rtl::OUString& ustrPathFound)\n {\n return osl_searchPath(\n ustrFilePath.pData,\n ustrSearchPathList.pData,\n &ustrPathFound.pData);\n }\n\n\n } \/\/ namespace osl\n\n\n #endif \/* #ifndef _OSL_PATH_HELPER_HXX_ *\/\n\n<commit_msg>INTEGRATION: CWS warnings01 (1.3.346); FILE MERGED 2005\/09\/23 00:51:55 sb 1.3.346.2: RESYNC: (1.3-1.4); FILE MERGED 2005\/08\/30 17:03:15 sb 1.3.346.1: #i53898# Made code warning-free.<commit_after>\/*************************************************************************\n *\n * OpenOffice.org - a multi-platform office productivity suite\n *\n * $RCSfile: file_path_helper.hxx,v $\n *\n * $Revision: 1.5 $\n *\n * last change: $Author: hr $ $Date: 2006-06-20 04:17:48 $\n *\n * The Contents of this file are made available subject to\n * the terms of GNU Lesser General Public License Version 2.1.\n *\n *\n * GNU Lesser General Public License Version 2.1\n * =============================================\n * Copyright 2005 by Sun Microsystems, Inc.\n * 901 San Antonio Road, Palo Alto, CA 94303, USA\n *\n * This library is free software; you can redistribute it and\/or\n * modify it under the terms of the GNU Lesser General Public\n * License version 2.1, as published by the Free Software Foundation.\n *\n * This library is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU\n * Lesser General Public License for more details.\n *\n * You should have received a copy of the GNU Lesser General Public\n * License along with this library; if not, write to the Free Software\n * Foundation, Inc., 59 Temple Place, Suite 330, Boston,\n * MA 02111-1307 USA\n *\n ************************************************************************\/\n\n#ifndef _OSL_FILE_PATH_HELPER_HXX_\n#define _OSL_FILE_PATH_HELPER_HXX_\n\n\n#ifndef _OSL_FILE_PATH_HELPER_H_\n#include \"file_path_helper.h\"\n#endif\n\n#ifndef _RTL_USTRING_HXX_\n#include <rtl\/ustring.hxx>\n#endif\n\n\nnamespace osl\n{\n\n \/*******************************************\n systemPathRemoveSeparator\n Removes the last separator from the\n given system path if any and if the path\n is not the root path '\/'\n\n @param ppustrPath [inout] a system path\n if the path is not the root path\n and the last character is a\n path separator it will be cut off\n ppustrPath must not be NULL and\n must point to a valid rtl_uString\n\n @returns nothing\n\n ******************************************\/\n\n inline void systemPathRemoveSeparator(\/*inout*\/ rtl::OUString& Path)\n {\n osl_systemPathRemoveSeparator(Path.pData);\n }\n\n \/*******************************************\n systemPathEnsureSeparator\n Adds a trailing path separator to the\n given system path if not already there\n and if the path is not the root path '\/'\n\n @param pustrPath [inout] a system path\n if the path is not the root path\n '\/' and has no trailing separator\n a separator will be added\n ppustrPath must not be NULL and\n must point to a valid rtl_uString\n\n @returns nothing\n\n ******************************************\/\n\n inline void systemPathEnsureSeparator(\/*inout*\/ rtl::OUString& Path)\n {\n osl_systemPathEnsureSeparator(&Path.pData);\n }\n\n \/*******************************************\n systemPathIsRelativePath\n Returns true if the given path is a\n relative path and so starts not with '\/'\n\n @param pustrPath [in] a system path\n pustrPath must not be NULL\n\n @returns sal_True if the given path\n doesn't start with a separator\n else sal_False will be returned\n\n ******************************************\/\n\n inline bool systemPathIsRelativePath(const rtl::OUString& Path)\n {\n return osl_systemPathIsRelativePath(Path.pData);\n }\n\n \/******************************************\n systemPathIsAbsolutePath\n Returns true if the given path is an\n absolute path and so starts with a '\/'\n\n @param pustrPath [in] a system path\n pustrPath must not be NULL\n\n @returns sal_True if the given path\n start's with a separator else\n sal_False will be returned\n\n *****************************************\/\n\n inline bool systemPathIsAbsolutePath(const rtl::OUString& Path)\n {\n return osl_systemPathIsAbsolutePath(Path.pData);\n }\n\n \/******************************************\n systemPathMakeAbsolutePath\n Append a relative path to a base path\n\n @param pustrBasePath [in] a system\n path that will be considered as\n base path\n pustrBasePath must not be NULL\n\n @param pustrRelPath [in] a system path\n that will be considered as\n relative path\n pustrBasePath must not be NULL\n\n @param ppustrAbsolutePath [out] the\n resulting path which is a\n concatination of the base and\n the relative path\n if base path is empty the\n resulting absolute path is the\n relative path\n if relative path is empty the\n resulting absolute path is the\n base path\n if base and relative path are\n empty the resulting absolute\n path is also empty\n ppustrAbsolutePath must not be\n NULL and *ppustrAbsolutePath\n must be 0 or point to a valid\n rtl_uString\n\n *****************************************\/\n\n inline void systemPathMakeAbsolutePath(\n const rtl::OUString& BasePath,\n const rtl::OUString& RelPath,\n rtl::OUString& AbsolutePath)\n {\n osl_systemPathMakeAbsolutePath(\n BasePath.pData, RelPath.pData, &AbsolutePath.pData);\n }\n\n \/*****************************************\n systemPathGetFileOrLastDirectoryPart\n Returns the file or the directory part\n of the given path\n\n @param pustrPath [in] a system path,\n must not be NULL\n\n @param ppustrFileOrDirPart [out] on\n return receives the last part\n of the given directory or the\n file name\n if pustrPath is the root path\n '\/' an empty string will be\n returned\n if pustrPath has a trailing\n '\/' the last part before the\n '\/' will be returned else\n the part after the last '\/'\n will be returned\n\n @returns nothing\n\n ****************************************\/\n\n inline void systemPathGetFileNameOrLastDirectoryPart(\n const rtl::OUString& Path,\n rtl::OUString& FileNameOrLastDirPart)\n {\n osl_systemPathGetFileNameOrLastDirectoryPart(\n Path.pData, &FileNameOrLastDirPart.pData);\n }\n\n\n \/********************************************\n systemPathIsHiddenFileOrDirectoryEntry\n Returns sal_True if the last part of\n given system path is not '.' or '..'\n alone and starts with a '.'\n\n @param pustrPath [in] a system path,\n must not be NULL\n\n @returns sal_True if the last part of\n the given system path starts\n with '.' or sal_False the last\n part is '.' or '..' alone or\n doesn't start with a dot\n\n *********************************************\/\n\n inline bool systemPathIsHiddenFileOrDirectoryEntry(\n const rtl::OUString& Path)\n {\n return osl_systemPathIsHiddenFileOrDirectoryEntry(Path.pData);\n }\n\n\n \/************************************************\n systemPathIsLocalOrParentDirectoryEntry\n Returns sal_True if the last part of the given\n system path is the local directory entry '.'\n or the parent directory entry '..'\n\n @param pustrPath [in] a system path,\n must not be NULL\n\n @returns sal_True if the last part of the\n given system path is '.' or '..'\n else sal_False\n\n ************************************************\/\n\n inline bool systemPathIsLocalOrParentDirectoryEntry(\n const rtl::OUString& Path)\n {\n return osl_systemPathIsLocalOrParentDirectoryEntry(Path.pData);\n }\n\n \/************************************************\n searchPath\n ***********************************************\/\n\n inline bool searchPath(\n const rtl::OUString& ustrFilePath,\n const rtl::OUString& ustrSearchPathList,\n rtl::OUString& ustrPathFound)\n {\n return osl_searchPath(\n ustrFilePath.pData,\n ustrSearchPathList.pData,\n &ustrPathFound.pData);\n }\n\n\n } \/\/ namespace osl\n\n\n #endif \/* #ifndef _OSL_PATH_HELPER_HXX_ *\/\n\n<|endoftext|>"} {"text":"<commit_before>#include \"mfem.hpp\"\n#include <memory>\n#include <iostream>\n#include <fstream>\n\nusing namespace std;\nusing namespace mfem;\n\n\/** After spatial discretization, the rubber model can be written as:\n * 0=H(x)\n * where x is the block vector representing the deformation and pressure\n * and H(x) is the nonlinear incompressible neo-Hookean operator. *\/\nclass RubberOperator : public Operator\n{\nprotected:\n Array<ParFiniteElementSpace *> spaces;\n\n ParBlockNonlinearForm *Hform;\n mutable Operator *Jacobian;\n const BlockVector *x;\n\n \/\/\/ Newton solver for the hyperelastic operator\n NewtonSolver newton_solver;\n \/\/\/ Solver for the Jacobian solve in the Newton method\n mutable Solver *J_solver;\n \/\/\/ Preconditioner for the Jacobian\n mutable Solver *J_prec;\n\n Coefficient μ\n\npublic:\n RubberOperator(Array<ParFiniteElementSpace *> &fes, Array<Array<int> *>&ess_bdr,\n Array<int> &block_trueOffsets, double rel_tol, double abs_tol, int iter,\n Coefficient &mu);\n\n \/\/\/ Required to use the native newton solver\n virtual Operator &GetGradientSolver(const Vector &xp) const;\n virtual void Mult(const Vector &k, Vector &y) const;\n\n \/\/\/ Driver for the newton solver\n void Solve(Vector &xp) const;\n\n virtual ~RubberOperator();\n};\n\nvoid visualize(ostream &out, ParMesh *mesh, ParGridFunction *deformed_nodes,\n ParGridFunction *field, const char *field_name = NULL,\n bool init_vis = false);\n\nvoid ReferenceConfiguration(const Vector &x, Vector &y);\nvoid InitialDeformation(const Vector &x, Vector &y);\n\n\nint main(int argc, char *argv[])\n{\n \/\/ Initialize MPI.\n int num_procs, myid;\n MPI_Init(&argc, &argv);\n MPI_Comm_size(MPI_COMM_WORLD, &num_procs);\n MPI_Comm_rank(MPI_COMM_WORLD, &myid);\n\n \/\/ Parse command-line options.\n const char *mesh_file = \"..\/data\/beam-hex.mesh\";\n int ser_ref_levels = 0;\n int par_ref_levels = 0;\n int order = 2;\n bool visualization = true;\n double newton_rel_tol = 1.0e-6;\n double newton_abs_tol = 1.0e-8;\n int newton_iter = 500;\n double mu = 1.0;\n\n OptionsParser args(argc, argv);\n args.AddOption(&mesh_file, \"-m\", \"--mesh\",\n \"Mesh file to use.\");\n args.AddOption(&ser_ref_levels, \"-rs\", \"--refine-serial\",\n \"Number of times to refine the mesh uniformly in serial.\");\n args.AddOption(&par_ref_levels, \"-rp\", \"--refine-parallel\",\n \"Number of times to refine the mesh uniformly in parallel.\");\n args.AddOption(&order, \"-o\", \"--order\",\n \"Order (degree) of the finite elements.\");\n args.AddOption(&visualization, \"-vis\", \"--visualization\", \"-no-vis\",\n \"--no-visualization\",\n \"Enable or disable GLVis visualization.\");\n args.AddOption(&newton_rel_tol, \"-rel\", \"--relative-tolerance\",\n \"Relative tolerance for the Newton solve.\");\n args.AddOption(&newton_abs_tol, \"-abs\", \"--absolute-tolerance\",\n \"Absolute tolerance for the Newton solve.\");\n args.AddOption(&newton_iter, \"-it\", \"--newton-iterations\",\n \"Maximum iterations for the Newton solve.\");\n args.AddOption(&mu, \"-mu\", \"--shear-modulus\",\n \"Shear modulus for the neo-Hookean material.\");\n\n args.Parse();\n if (!args.Good())\n {\n if (myid == 0)\n {\n args.PrintUsage(cout);\n }\n MPI_Finalize();\n return 1;\n }\n if (myid == 0)\n {\n args.PrintOptions(cout);\n }\n\n \/\/ Open the mesh\n Mesh *mesh;\n ifstream imesh(mesh_file);\n if (!imesh)\n {\n if (myid == 0)\n {\n cerr << \"\\nCan not open mesh file: \" << mesh_file << '\\n' << endl;\n }\n MPI_Finalize();\n return 2;\n }\n mesh = new Mesh(imesh, 1, 1);\n imesh.close();\n ParMesh *pmesh = NULL;\n\n for (int lev = 0; lev < ser_ref_levels; lev++)\n {\n mesh->UniformRefinement();\n }\n pmesh = new ParMesh(MPI_COMM_WORLD, *mesh);\n for (int lev = 0; lev < par_ref_levels; lev++)\n {\n pmesh->UniformRefinement();\n }\n\n delete mesh;\n int dim = pmesh->Dimension();\n\n ConstantCoefficient c_mu(mu);\n\n \/\/ Definie the finite element spaces for displacement and pressure (Stokes elements)\n H1_FECollection quad_coll(order, dim);\n H1_FECollection lin_coll(order-1, dim);\n\n ParFiniteElementSpace R_space(pmesh, &quad_coll, dim);\n ParFiniteElementSpace W_space(pmesh, &lin_coll);\n\n Array<ParFiniteElementSpace *> spaces(2);\n spaces[0] = &R_space;\n spaces[1] = &W_space;\n\n HYPRE_Int glob_R_size = R_space.GlobalTrueVSize();\n HYPRE_Int glob_W_size = W_space.GlobalTrueVSize();\n\n \/\/ Define the Dirichlet conditions (set to boundary attribute 1)\n Array<Array<int> *> ess_bdr(2);\n\n Array<int> ess_bdr_u(R_space.GetMesh()->bdr_attributes.Max());\n Array<int> ess_bdr_p(W_space.GetMesh()->bdr_attributes.Max());\n\n ess_bdr_p = 0;\n ess_bdr_u = 0;\n ess_bdr_u[0] = 1;\n ess_bdr_u[1] = 1;\n\n ess_bdr[0] = &ess_bdr_u;\n ess_bdr[1] = &ess_bdr_p;\n\n \/\/ Print the mesh statistics\n if (myid == 0)\n {\n std::cout << \"***********************************************************\\n\";\n std::cout << \"dim(u) = \" << glob_R_size << \"\\n\";\n std::cout << \"dim(p) = \" << glob_W_size << \"\\n\";\n std::cout << \"dim(u+p) = \" << glob_R_size + glob_W_size << \"\\n\";\n std::cout << \"***********************************************************\\n\";\n }\n\n \/\/ Define the block structure of the solution vector (u then p)\n Array<int> block_offsets(3);\n block_offsets[0] = 0;\n block_offsets[1] = R_space.GetVSize();\n block_offsets[2] = W_space.GetVSize();\n block_offsets.PartialSum();\n\n Array<int> block_trueOffsets(3);\n block_trueOffsets[0] = 0;\n block_trueOffsets[1] = R_space.TrueVSize();\n block_trueOffsets[2] = W_space.TrueVSize();\n block_trueOffsets.PartialSum();\n\n BlockVector xp(block_trueOffsets);\n\n \/\/ Define grid functions for the current configuration, reference configuration,\n \/\/ final deformation, and pressure\n ParGridFunction x_gf(&R_space);\n ParGridFunction x_ref(&R_space);\n ParGridFunction x_def(&R_space);\n ParGridFunction p_gf(&W_space);\n\n \/\/ Project the initial and reference configuration functions onto the appropriate grid functions\n VectorFunctionCoefficient deform(dim, InitialDeformation);\n VectorFunctionCoefficient refconfig(dim, ReferenceConfiguration);\n\n x_gf.ProjectCoefficient(deform);\n x_ref.ProjectCoefficient(refconfig);\n\n \/\/ Set up the block solution vectors\n x_gf.GetTrueDofs(xp.GetBlock(0));\n p_gf.GetTrueDofs(xp.GetBlock(1));\n\n \/\/ Initialize the incompressible neo-Hookean operator\n RubberOperator oper(spaces, ess_bdr, block_trueOffsets,\n newton_rel_tol, newton_abs_tol, newton_iter, c_mu);\n\n \/\/ Solve the Newton system\n oper.Solve(xp);\n\n \/\/ Distribute the ghost dofs\n x_gf.Distribute(xp.GetBlock(0));\n p_gf.Distribute(xp.GetBlock(1));\n\n \/\/ Set the final deformation\n subtract(x_gf, x_ref, x_def);\n\n \/\/ Visualize the results if requested\n socketstream vis_u, vis_p;\n if (visualization)\n {\n char vishost[] = \"localhost\";\n int visport = 19916;\n vis_u.open(vishost, visport);\n vis_u.precision(8);\n visualize(vis_u, pmesh, &x_gf, &x_def, \"Deformation\", true);\n \/\/ Make sure all ranks have sent their 'u' solution before initiating\n \/\/ another set of GLVis connections (one from each rank):\n MPI_Barrier(pmesh->GetComm());\n vis_p.open(vishost, visport);\n vis_p.precision(8);\n visualize(vis_p, pmesh, &x_gf, &p_gf, \"Pressure\", true);\n }\n\n \/\/ Save the displaced mesh, the final deformation, and the pressure\n {\n GridFunction *nodes = &x_gf;\n int owns_nodes = 0;\n pmesh->SwapNodes(nodes, owns_nodes);\n\n ostringstream mesh_name, pressure_name, deformation_name;\n mesh_name << \"mesh.\" << setfill('0') << setw(6) << myid;\n pressure_name << \"pressure.\" << setfill('0') << setw(6) << myid;\n deformation_name << \"deformation.\" << setfill('0') << setw(6) << myid;\n\n ofstream mesh_ofs(mesh_name.str().c_str());\n mesh_ofs.precision(8);\n pmesh->Print(mesh_ofs);\n\n ofstream pressure_ofs(pressure_name.str().c_str());\n pressure_ofs.precision(8);\n p_gf.Save(pressure_ofs);\n\n ofstream deformation_ofs(deformation_name.str().c_str());\n deformation_ofs.precision(8);\n x_def.Save(deformation_ofs);\n }\n\n\n \/\/ Free the used memory.\n delete pmesh;\n\n MPI_Finalize();\n\n return 0;\n}\n\nRubberOperator::RubberOperator(Array<ParFiniteElementSpace *> &fes,\n Array<Array<int> *> &ess_bdr,\n Array<int> &block_trueOffsets,\n double rel_tol,\n double abs_tol,\n int iter,\n Coefficient &c_mu)\n : Operator(fes[0]->TrueVSize() + fes[1]->TrueVSize()),\n newton_solver(fes[0]->GetComm(), true), mu(c_mu)\n{\n Array<Vector *> rhs(2);\n\n rhs[0] = NULL;\n rhs[1] = NULL;\n\n fes.Copy(spaces);\n\n \/\/ Define the mixed nonlinear form\n Hform = new ParBlockNonlinearForm(spaces);\n\n \/\/ Add the passive stress integrator\n Hform->AddDomainIntegrator(new IncompressibleNeoHookeanIntegrator(mu));\n\n \/\/ Set the essential boundary conditions\n Hform->SetEssentialBC(ess_bdr, rhs);\n \/\/ Set the newton solve parameters\n newton_solver.iterative_mode = true;\n\n newton_solver.SetOperator(*this);\n newton_solver.SetPrintLevel(1);\n newton_solver.SetRelTol(rel_tol);\n newton_solver.SetAbsTol(abs_tol);\n newton_solver.SetMaxIter(iter);\n}\n\n\/\/ Solve the Newton system\nvoid RubberOperator::Solve(Vector &xp) const\n{\n Vector zero;\n newton_solver.Mult(zero, xp);\n MFEM_VERIFY(newton_solver.GetConverged(), \"Newton Solver did not converge.\");\n}\n\n\/\/ compute: y = H(x,p)\nvoid RubberOperator::Mult(const Vector &k, Vector &y) const\n{\n Hform->Mult(k, y);\n\n}\n\n\/\/ Compute the Jacobian from the nonlinear form\nOperator &RubberOperator::GetGradientSolver(const Vector &xp) const\n{\n Jacobian = &Hform->GetGradient(xp);\n\n SuperLUSolver *superlu = NULL;\n superlu = new SuperLUSolver(MPI_COMM_WORLD);\n superlu->SetPrintStatistics(false);\n superlu->SetSymmetricPattern(false);\n superlu->SetColumnPermutation(superlu::PARMETIS);\n\n J_solver = superlu;\n J_prec = NULL;\n\n J_solver->SetOperator(*Jacobian);\n\n return *J_solver;\n}\n\nRubberOperator::~RubberOperator()\n{\n delete J_solver;\n if (J_prec != NULL)\n {\n delete J_prec;\n }\n}\n\n\/\/ In line visualization\nvoid visualize(ostream &out, ParMesh *mesh, ParGridFunction *deformed_nodes,\n ParGridFunction *field, const char *field_name, bool init_vis)\n{\n if (!out)\n {\n return;\n }\n\n GridFunction *nodes = deformed_nodes;\n int owns_nodes = 0;\n\n mesh->SwapNodes(nodes, owns_nodes);\n\n out << \"parallel \" << mesh->GetNRanks() << \" \" << mesh->GetMyRank() << \"\\n\";\n out << \"solution\\n\" << *mesh << *field;\n\n mesh->SwapNodes(nodes, owns_nodes);\n\n if (init_vis)\n {\n out << \"window_size 800 800\\n\";\n out << \"window_title '\" << field_name << \"'\\n\";\n if (mesh->SpaceDimension() == 2)\n {\n out << \"view 0 0\\n\"; \/\/ view from top\n out << \"keys jl\\n\"; \/\/ turn off perspective and light\n }\n out << \"keys cm\\n\"; \/\/ show colorbar and mesh\n out << \"autoscale value\\n\"; \/\/ update value-range; keep mesh-extents fixed\n out << \"pause\\n\";\n }\n out << flush;\n}\n\nvoid ReferenceConfiguration(const Vector &x, Vector &y)\n{\n \/\/ set the reference, stress\n \/\/ free, configuration\n y = x;\n}\n\n\nvoid InitialDeformation(const Vector &x, Vector &y)\n{\n \/\/ set the initial configuration. Having this different from the\n \/\/ reference configuration can help convergence\n y = x;\n y[1] = x[1] + 0.25*x[0];\n}\n<commit_msg>Fixed memory leak<commit_after>#include \"mfem.hpp\"\n#include <memory>\n#include <iostream>\n#include <fstream>\n\nusing namespace std;\nusing namespace mfem;\n\n\/** After spatial discretization, the rubber model can be written as:\n * 0=H(x)\n * where x is the block vector representing the deformation and pressure\n * and H(x) is the nonlinear incompressible neo-Hookean operator. *\/\nclass RubberOperator : public Operator\n{\nprotected:\n Array<ParFiniteElementSpace *> spaces;\n\n ParBlockNonlinearForm *Hform;\n mutable Operator *Jacobian;\n const BlockVector *x;\n\n \/\/\/ Newton solver for the hyperelastic operator\n NewtonSolver newton_solver;\n \/\/\/ Solver for the Jacobian solve in the Newton method\n mutable Solver *J_solver;\n \/\/\/ Preconditioner for the Jacobian\n mutable Solver *J_prec;\n\n Coefficient μ\n\npublic:\n RubberOperator(Array<ParFiniteElementSpace *> &fes, Array<Array<int> *>&ess_bdr,\n Array<int> &block_trueOffsets, double rel_tol, double abs_tol, int iter,\n Coefficient &mu);\n\n \/\/\/ Required to use the native newton solver\n virtual Operator &GetGradientSolver(const Vector &xp) const;\n virtual void Mult(const Vector &k, Vector &y) const;\n\n \/\/\/ Driver for the newton solver\n void Solve(Vector &xp) const;\n\n virtual ~RubberOperator();\n};\n\nvoid visualize(ostream &out, ParMesh *mesh, ParGridFunction *deformed_nodes,\n ParGridFunction *field, const char *field_name = NULL,\n bool init_vis = false);\n\nvoid ReferenceConfiguration(const Vector &x, Vector &y);\nvoid InitialDeformation(const Vector &x, Vector &y);\n\n\nint main(int argc, char *argv[])\n{\n \/\/ Initialize MPI.\n int num_procs, myid;\n MPI_Init(&argc, &argv);\n MPI_Comm_size(MPI_COMM_WORLD, &num_procs);\n MPI_Comm_rank(MPI_COMM_WORLD, &myid);\n\n \/\/ Parse command-line options.\n const char *mesh_file = \"..\/data\/beam-hex.mesh\";\n int ser_ref_levels = 0;\n int par_ref_levels = 0;\n int order = 2;\n bool visualization = true;\n double newton_rel_tol = 1.0e-6;\n double newton_abs_tol = 1.0e-8;\n int newton_iter = 500;\n double mu = 1.0;\n\n OptionsParser args(argc, argv);\n args.AddOption(&mesh_file, \"-m\", \"--mesh\",\n \"Mesh file to use.\");\n args.AddOption(&ser_ref_levels, \"-rs\", \"--refine-serial\",\n \"Number of times to refine the mesh uniformly in serial.\");\n args.AddOption(&par_ref_levels, \"-rp\", \"--refine-parallel\",\n \"Number of times to refine the mesh uniformly in parallel.\");\n args.AddOption(&order, \"-o\", \"--order\",\n \"Order (degree) of the finite elements.\");\n args.AddOption(&visualization, \"-vis\", \"--visualization\", \"-no-vis\",\n \"--no-visualization\",\n \"Enable or disable GLVis visualization.\");\n args.AddOption(&newton_rel_tol, \"-rel\", \"--relative-tolerance\",\n \"Relative tolerance for the Newton solve.\");\n args.AddOption(&newton_abs_tol, \"-abs\", \"--absolute-tolerance\",\n \"Absolute tolerance for the Newton solve.\");\n args.AddOption(&newton_iter, \"-it\", \"--newton-iterations\",\n \"Maximum iterations for the Newton solve.\");\n args.AddOption(&mu, \"-mu\", \"--shear-modulus\",\n \"Shear modulus for the neo-Hookean material.\");\n\n args.Parse();\n if (!args.Good())\n {\n if (myid == 0)\n {\n args.PrintUsage(cout);\n }\n MPI_Finalize();\n return 1;\n }\n if (myid == 0)\n {\n args.PrintOptions(cout);\n }\n\n \/\/ Open the mesh\n Mesh *mesh;\n ifstream imesh(mesh_file);\n if (!imesh)\n {\n if (myid == 0)\n {\n cerr << \"\\nCan not open mesh file: \" << mesh_file << '\\n' << endl;\n }\n MPI_Finalize();\n return 2;\n }\n mesh = new Mesh(imesh, 1, 1);\n imesh.close();\n ParMesh *pmesh = NULL;\n\n for (int lev = 0; lev < ser_ref_levels; lev++)\n {\n mesh->UniformRefinement();\n }\n pmesh = new ParMesh(MPI_COMM_WORLD, *mesh);\n for (int lev = 0; lev < par_ref_levels; lev++)\n {\n pmesh->UniformRefinement();\n }\n\n delete mesh;\n int dim = pmesh->Dimension();\n\n ConstantCoefficient c_mu(mu);\n\n \/\/ Definie the finite element spaces for displacement and pressure (Stokes elements)\n H1_FECollection quad_coll(order, dim);\n H1_FECollection lin_coll(order-1, dim);\n\n ParFiniteElementSpace R_space(pmesh, &quad_coll, dim);\n ParFiniteElementSpace W_space(pmesh, &lin_coll);\n\n Array<ParFiniteElementSpace *> spaces(2);\n spaces[0] = &R_space;\n spaces[1] = &W_space;\n\n HYPRE_Int glob_R_size = R_space.GlobalTrueVSize();\n HYPRE_Int glob_W_size = W_space.GlobalTrueVSize();\n\n \/\/ Define the Dirichlet conditions (set to boundary attribute 1)\n Array<Array<int> *> ess_bdr(2);\n\n Array<int> ess_bdr_u(R_space.GetMesh()->bdr_attributes.Max());\n Array<int> ess_bdr_p(W_space.GetMesh()->bdr_attributes.Max());\n\n ess_bdr_p = 0;\n ess_bdr_u = 0;\n ess_bdr_u[0] = 1;\n ess_bdr_u[1] = 1;\n\n ess_bdr[0] = &ess_bdr_u;\n ess_bdr[1] = &ess_bdr_p;\n\n \/\/ Print the mesh statistics\n if (myid == 0)\n {\n std::cout << \"***********************************************************\\n\";\n std::cout << \"dim(u) = \" << glob_R_size << \"\\n\";\n std::cout << \"dim(p) = \" << glob_W_size << \"\\n\";\n std::cout << \"dim(u+p) = \" << glob_R_size + glob_W_size << \"\\n\";\n std::cout << \"***********************************************************\\n\";\n }\n\n \/\/ Define the block structure of the solution vector (u then p)\n Array<int> block_offsets(3);\n block_offsets[0] = 0;\n block_offsets[1] = R_space.GetVSize();\n block_offsets[2] = W_space.GetVSize();\n block_offsets.PartialSum();\n\n Array<int> block_trueOffsets(3);\n block_trueOffsets[0] = 0;\n block_trueOffsets[1] = R_space.TrueVSize();\n block_trueOffsets[2] = W_space.TrueVSize();\n block_trueOffsets.PartialSum();\n\n BlockVector xp(block_trueOffsets);\n\n \/\/ Define grid functions for the current configuration, reference configuration,\n \/\/ final deformation, and pressure\n ParGridFunction x_gf(&R_space);\n ParGridFunction x_ref(&R_space);\n ParGridFunction x_def(&R_space);\n ParGridFunction p_gf(&W_space);\n\n \/\/ Project the initial and reference configuration functions onto the appropriate grid functions\n VectorFunctionCoefficient deform(dim, InitialDeformation);\n VectorFunctionCoefficient refconfig(dim, ReferenceConfiguration);\n\n x_gf.ProjectCoefficient(deform);\n x_ref.ProjectCoefficient(refconfig);\n\n \/\/ Set up the block solution vectors\n x_gf.GetTrueDofs(xp.GetBlock(0));\n p_gf.GetTrueDofs(xp.GetBlock(1));\n\n \/\/ Initialize the incompressible neo-Hookean operator\n RubberOperator oper(spaces, ess_bdr, block_trueOffsets,\n newton_rel_tol, newton_abs_tol, newton_iter, c_mu);\n\n \/\/ Solve the Newton system\n oper.Solve(xp);\n\n \/\/ Distribute the ghost dofs\n x_gf.Distribute(xp.GetBlock(0));\n p_gf.Distribute(xp.GetBlock(1));\n\n \/\/ Set the final deformation\n subtract(x_gf, x_ref, x_def);\n\n \/\/ Visualize the results if requested\n socketstream vis_u, vis_p;\n if (visualization)\n {\n char vishost[] = \"localhost\";\n int visport = 19916;\n vis_u.open(vishost, visport);\n vis_u.precision(8);\n visualize(vis_u, pmesh, &x_gf, &x_def, \"Deformation\", true);\n \/\/ Make sure all ranks have sent their 'u' solution before initiating\n \/\/ another set of GLVis connections (one from each rank):\n MPI_Barrier(pmesh->GetComm());\n vis_p.open(vishost, visport);\n vis_p.precision(8);\n visualize(vis_p, pmesh, &x_gf, &p_gf, \"Pressure\", true);\n }\n\n \/\/ Save the displaced mesh, the final deformation, and the pressure\n {\n GridFunction *nodes = &x_gf;\n int owns_nodes = 0;\n pmesh->SwapNodes(nodes, owns_nodes);\n\n ostringstream mesh_name, pressure_name, deformation_name;\n mesh_name << \"mesh.\" << setfill('0') << setw(6) << myid;\n pressure_name << \"pressure.\" << setfill('0') << setw(6) << myid;\n deformation_name << \"deformation.\" << setfill('0') << setw(6) << myid;\n\n ofstream mesh_ofs(mesh_name.str().c_str());\n mesh_ofs.precision(8);\n pmesh->Print(mesh_ofs);\n\n ofstream pressure_ofs(pressure_name.str().c_str());\n pressure_ofs.precision(8);\n p_gf.Save(pressure_ofs);\n\n ofstream deformation_ofs(deformation_name.str().c_str());\n deformation_ofs.precision(8);\n x_def.Save(deformation_ofs);\n }\n\n\n \/\/ Free the used memory.\n delete pmesh;\n\n MPI_Finalize();\n\n return 0;\n}\n\nRubberOperator::RubberOperator(Array<ParFiniteElementSpace *> &fes,\n Array<Array<int> *> &ess_bdr,\n Array<int> &block_trueOffsets,\n double rel_tol,\n double abs_tol,\n int iter,\n Coefficient &c_mu)\n : Operator(fes[0]->TrueVSize() + fes[1]->TrueVSize()),\n newton_solver(fes[0]->GetComm(), true), mu(c_mu)\n{\n Array<Vector *> rhs(2);\n\n rhs[0] = NULL;\n rhs[1] = NULL;\n\n fes.Copy(spaces);\n\n \/\/ Define the mixed nonlinear form\n Hform = new ParBlockNonlinearForm(spaces);\n\n \/\/ Add the passive stress integrator\n Hform->AddDomainIntegrator(new IncompressibleNeoHookeanIntegrator(mu));\n\n \/\/ Set the essential boundary conditions\n Hform->SetEssentialBC(ess_bdr, rhs);\n \/\/ Set the newton solve parameters\n newton_solver.iterative_mode = true;\n\n newton_solver.SetOperator(*this);\n newton_solver.SetPrintLevel(1);\n newton_solver.SetRelTol(rel_tol);\n newton_solver.SetAbsTol(abs_tol);\n newton_solver.SetMaxIter(iter);\n\n J_solver = NULL;\n J_prec = NULL;\n\n}\n\n\/\/ Solve the Newton system\nvoid RubberOperator::Solve(Vector &xp) const\n{\n Vector zero;\n newton_solver.Mult(zero, xp);\n MFEM_VERIFY(newton_solver.GetConverged(), \"Newton Solver did not converge.\");\n}\n\n\/\/ compute: y = H(x,p)\nvoid RubberOperator::Mult(const Vector &k, Vector &y) const\n{\n Hform->Mult(k, y);\n\n}\n\n\/\/ Compute the Jacobian from the nonlinear form\nOperator &RubberOperator::GetGradientSolver(const Vector &xp) const\n{\n Jacobian = &Hform->GetGradient(xp);\n\n if (J_solver != NULL) {\n delete J_solver;\n }\n\n SuperLUSolver *superlu = NULL;\n superlu = new SuperLUSolver(MPI_COMM_WORLD);\n superlu->SetPrintStatistics(false);\n superlu->SetSymmetricPattern(false);\n superlu->SetColumnPermutation(superlu::PARMETIS);\n\n J_solver = superlu;\n J_prec = NULL;\n\n J_solver->SetOperator(*Jacobian);\n\n return *J_solver;\n}\n\nRubberOperator::~RubberOperator()\n{\n delete J_solver;\n if (J_prec != NULL)\n {\n delete J_prec;\n }\n}\n\n\/\/ In line visualization\nvoid visualize(ostream &out, ParMesh *mesh, ParGridFunction *deformed_nodes,\n ParGridFunction *field, const char *field_name, bool init_vis)\n{\n if (!out)\n {\n return;\n }\n\n GridFunction *nodes = deformed_nodes;\n int owns_nodes = 0;\n\n mesh->SwapNodes(nodes, owns_nodes);\n\n out << \"parallel \" << mesh->GetNRanks() << \" \" << mesh->GetMyRank() << \"\\n\";\n out << \"solution\\n\" << *mesh << *field;\n\n mesh->SwapNodes(nodes, owns_nodes);\n\n if (init_vis)\n {\n out << \"window_size 800 800\\n\";\n out << \"window_title '\" << field_name << \"'\\n\";\n if (mesh->SpaceDimension() == 2)\n {\n out << \"view 0 0\\n\"; \/\/ view from top\n out << \"keys jl\\n\"; \/\/ turn off perspective and light\n }\n out << \"keys cm\\n\"; \/\/ show colorbar and mesh\n out << \"autoscale value\\n\"; \/\/ update value-range; keep mesh-extents fixed\n out << \"pause\\n\";\n }\n out << flush;\n}\n\nvoid ReferenceConfiguration(const Vector &x, Vector &y)\n{\n \/\/ set the reference, stress\n \/\/ free, configuration\n y = x;\n}\n\n\nvoid InitialDeformation(const Vector &x, Vector &y)\n{\n \/\/ set the initial configuration. Having this different from the\n \/\/ reference configuration can help convergence\n y = x;\n y[1] = x[1] + 0.25*x[0];\n}\n<|endoftext|>"} {"text":"<commit_before>\/\/ Copyright (c) 2015 The Bitcoin Core developers\n\/\/ Distributed under the MIT software license, see the accompanying\n\/\/ file COPYING or http:\/\/www.opensource.org\/licenses\/mit-license.php.\n\n#include \"scheduler.h\"\n\n#include <assert.h>\n#include <boost\/bind.hpp>\n#include <utility>\n\nCScheduler::CScheduler() : nThreadsServicingQueue(0), stopRequested(false), stopWhenEmpty(false)\n{\n}\n\nCScheduler::~CScheduler()\n{\n assert(nThreadsServicingQueue == 0);\n}\n\n\n#if BOOST_VERSION < 105000\nstatic boost::system_time toPosixTime(const boost::chrono::system_clock::time_point& t)\n{\n return boost::posix_time::from_time_t(boost::chrono::system_clock::to_time_t(t));\n}\n#endif\n\nvoid CScheduler::serviceQueue()\n{\n boost::unique_lock<boost::mutex> lock(newTaskMutex);\n ++nThreadsServicingQueue;\n\n \/\/ newTaskMutex is locked throughout this loop EXCEPT\n \/\/ when the thread is waiting or when the user's function\n \/\/ is called.\n while (!shouldStop()) {\n try {\n while (!shouldStop() && taskQueue.empty()) {\n \/\/ Wait until there is something to do.\n newTaskScheduled.wait(lock);\n }\n\n \/\/ Wait until either there is a new task, or until\n \/\/ the time of the first item on the queue:\n\n\/\/ wait_until needs boost 1.50 or later; older versions have timed_wait:\n#if BOOST_VERSION < 105000\n while (!shouldStop() && !taskQueue.empty() &&\n newTaskScheduled.timed_wait(lock, toPosixTime(taskQueue.begin()->first))) {\n \/\/ Keep waiting until timeout\n }\n#else\n while (!shouldStop() && !taskQueue.empty() &&\n newTaskScheduled.wait_until(lock, taskQueue.begin()->first) != boost::cv_status::timeout) {\n \/\/ Keep waiting until timeout\n }\n#endif\n \/\/ If there are multiple threads, the queue can empty while we're waiting (another\n \/\/ thread may service the task we were waiting on).\n if (shouldStop() || taskQueue.empty())\n continue;\n\n Function f = taskQueue.begin()->second;\n taskQueue.erase(taskQueue.begin());\n\n \/\/ Unlock before calling f, so it can reschedule itself or another task\n \/\/ without deadlocking:\n lock.unlock();\n f();\n lock.lock();\n } catch (...) {\n --nThreadsServicingQueue;\n throw;\n }\n }\n --nThreadsServicingQueue;\n}\n\nvoid CScheduler::stop(bool drain)\n{\n {\n boost::unique_lock<boost::mutex> lock(newTaskMutex);\n if (drain)\n stopWhenEmpty = true;\n else\n stopRequested = true;\n }\n newTaskScheduled.notify_all();\n}\n\nvoid CScheduler::schedule(CScheduler::Function f, boost::chrono::system_clock::time_point t)\n{\n {\n boost::unique_lock<boost::mutex> lock(newTaskMutex);\n taskQueue.insert(std::make_pair(t, f));\n }\n newTaskScheduled.notify_one();\n}\n\nvoid CScheduler::scheduleFromNow(CScheduler::Function f, int64_t deltaSeconds)\n{\n schedule(f, boost::chrono::system_clock::now() + boost::chrono::seconds(deltaSeconds));\n}\n\nstatic void Repeat(CScheduler* s, CScheduler::Function f, int64_t deltaSeconds)\n{\n f();\n s->scheduleFromNow(boost::bind(&Repeat, s, f, deltaSeconds), deltaSeconds);\n}\n\nvoid CScheduler::scheduleEvery(CScheduler::Function f, int64_t deltaSeconds)\n{\n scheduleFromNow(boost::bind(&Repeat, this, f, deltaSeconds), deltaSeconds);\n}\n\nsize_t CScheduler::getQueueInfo(boost::chrono::system_clock::time_point &first,\n boost::chrono::system_clock::time_point &last) const\n{\n boost::unique_lock<boost::mutex> lock(newTaskMutex);\n size_t result = taskQueue.size();\n if (!taskQueue.empty()) {\n first = taskQueue.begin()->first;\n last = taskQueue.rbegin()->first;\n }\n return result;\n}\n<commit_msg>Fix scheduler build with some boost versions.<commit_after>\/\/ Copyright (c) 2015 The Bitcoin Core developers\n\/\/ Distributed under the MIT software license, see the accompanying\n\/\/ file COPYING or http:\/\/www.opensource.org\/licenses\/mit-license.php.\n\n#include \"scheduler.h\"\n\n#include <assert.h>\n#include <boost\/bind.hpp>\n#include <utility>\n\nCScheduler::CScheduler() : nThreadsServicingQueue(0), stopRequested(false), stopWhenEmpty(false)\n{\n}\n\nCScheduler::~CScheduler()\n{\n assert(nThreadsServicingQueue == 0);\n}\n\n\n#if BOOST_VERSION < 105000\nstatic boost::system_time toPosixTime(const boost::chrono::system_clock::time_point& t)\n{\n return boost::posix_time::from_time_t(boost::chrono::system_clock::to_time_t(t));\n}\n#endif\n\nvoid CScheduler::serviceQueue()\n{\n boost::unique_lock<boost::mutex> lock(newTaskMutex);\n ++nThreadsServicingQueue;\n\n \/\/ newTaskMutex is locked throughout this loop EXCEPT\n \/\/ when the thread is waiting or when the user's function\n \/\/ is called.\n while (!shouldStop()) {\n try {\n while (!shouldStop() && taskQueue.empty()) {\n \/\/ Wait until there is something to do.\n newTaskScheduled.wait(lock);\n }\n\n \/\/ Wait until either there is a new task, or until\n \/\/ the time of the first item on the queue:\n\n\/\/ wait_until needs boost 1.50 or later; older versions have timed_wait:\n#if BOOST_VERSION < 105000\n while (!shouldStop() && !taskQueue.empty() &&\n newTaskScheduled.timed_wait(lock, toPosixTime(taskQueue.begin()->first))) {\n \/\/ Keep waiting until timeout\n }\n#else\n \/\/ Some boost versions have a conflicting overload of wait_until that returns void.\n \/\/ Explicitly use a template here to avoid hitting that overload.\n while (!shouldStop() && !taskQueue.empty() &&\n newTaskScheduled.wait_until<>(lock, taskQueue.begin()->first) != boost::cv_status::timeout) {\n \/\/ Keep waiting until timeout\n }\n#endif\n \/\/ If there are multiple threads, the queue can empty while we're waiting (another\n \/\/ thread may service the task we were waiting on).\n if (shouldStop() || taskQueue.empty())\n continue;\n\n Function f = taskQueue.begin()->second;\n taskQueue.erase(taskQueue.begin());\n\n \/\/ Unlock before calling f, so it can reschedule itself or another task\n \/\/ without deadlocking:\n lock.unlock();\n f();\n lock.lock();\n } catch (...) {\n --nThreadsServicingQueue;\n throw;\n }\n }\n --nThreadsServicingQueue;\n}\n\nvoid CScheduler::stop(bool drain)\n{\n {\n boost::unique_lock<boost::mutex> lock(newTaskMutex);\n if (drain)\n stopWhenEmpty = true;\n else\n stopRequested = true;\n }\n newTaskScheduled.notify_all();\n}\n\nvoid CScheduler::schedule(CScheduler::Function f, boost::chrono::system_clock::time_point t)\n{\n {\n boost::unique_lock<boost::mutex> lock(newTaskMutex);\n taskQueue.insert(std::make_pair(t, f));\n }\n newTaskScheduled.notify_one();\n}\n\nvoid CScheduler::scheduleFromNow(CScheduler::Function f, int64_t deltaSeconds)\n{\n schedule(f, boost::chrono::system_clock::now() + boost::chrono::seconds(deltaSeconds));\n}\n\nstatic void Repeat(CScheduler* s, CScheduler::Function f, int64_t deltaSeconds)\n{\n f();\n s->scheduleFromNow(boost::bind(&Repeat, s, f, deltaSeconds), deltaSeconds);\n}\n\nvoid CScheduler::scheduleEvery(CScheduler::Function f, int64_t deltaSeconds)\n{\n scheduleFromNow(boost::bind(&Repeat, this, f, deltaSeconds), deltaSeconds);\n}\n\nsize_t CScheduler::getQueueInfo(boost::chrono::system_clock::time_point &first,\n boost::chrono::system_clock::time_point &last) const\n{\n boost::unique_lock<boost::mutex> lock(newTaskMutex);\n size_t result = taskQueue.size();\n if (!taskQueue.empty()) {\n first = taskQueue.begin()->first;\n last = taskQueue.rbegin()->first;\n }\n return result;\n}\n<|endoftext|>"} {"text":"<commit_before>#include <iostream>\r\n#include <iomanip>\r\n#include <array>\r\n#include <bitset>\r\n\r\nstruct sudoku_cell{\r\n using numset = std::bitset<9>;\r\n sudoku_cell():cells{}{}\r\n std::array<unsigned,81> cells;\r\n std::array<numset,81> cands;\r\n std::array<numset,9> reduced_row;\r\n std::array<numset,9> reduced_col;\r\n\r\n inline unsigned rc_to_idx(const unsigned row, const unsigned col){\r\n return 9*row+col;\r\n }\r\n\r\n inline unsigned idx_to_row(const unsigned idx){\r\n return idx\/9;\r\n }\r\n\r\n inline unsigned idx_to_col(const unsigned idx){\r\n return idx%9;\r\n }\r\n\r\n numset cand_in_row(const unsigned idx){\r\n numset ret;\r\n ret.set();\r\n const unsigned row = idx_to_row(idx);\r\n for(unsigned i=0;i<9;++i) if(cells[rc_to_idx(row,i)] != 0) ret.reset(cells[rc_to_idx(row,i)]-1);\r\n return ret;\r\n }\r\n\r\n numset cand_in_col(const unsigned idx){\r\n numset ret;\r\n ret.set();\r\n const unsigned col = idx_to_col(idx);\r\n for(unsigned i=0;i<9;++i) if(cells[rc_to_idx(i,col)] != 0) ret.reset(cells[rc_to_idx(i,col)]-1);\r\n return ret;\r\n }\r\n\r\n numset cand_in_3x3(const unsigned idx){\r\n numset ret;\r\n ret.set();\r\n const unsigned row_begin = idx_to_row(idx)\/3*3;\r\n const unsigned col_begin = idx_to_col(idx)\/3*3;\r\n for(unsigned i=row_begin;i<row_begin+3;++i){\r\n for(unsigned j=col_begin;j<col_begin+3;++j){\r\n if(cells[rc_to_idx(i,j)] != 0) ret.reset(cells[rc_to_idx(i,j)]-1);\r\n }\r\n }\r\n\r\n return ret;\r\n }\r\n\r\n inline unsigned num_of_onbit(const numset& e){ \/\/ return least canding number indicated in e\r\n for(unsigned i=0;i<9;++i) if(e[i]) return i+1;\r\n return 0; \/\/ unreachable\r\n }\r\n\r\n void solve(){\r\n gen_cands();\r\n BEGIN:\r\n if(reduce_nearby_pair()) goto BEGIN;\r\n if(solve_3x3()) goto BEGIN;\r\n if(solve_one_cand()) goto BEGIN;\r\n }\r\n\r\n bool solve_one_cand(){\r\n \t\/\/ solve cells which have only one candidate\r\n bool changed = false;\r\n for(unsigned i=0;i<81;++i){\r\n if(cells[i] == 0){\r\n if(cands[i].count() == 1){\r\n cells[i] = num_of_onbit(cands[i]);\r\n rebuild_cand(i);\r\n changed = true;\r\n }\r\n }\r\n }\r\n return changed;\r\n }\r\n\r\n bool solve_3x3(){\r\n \t\/\/ solve cells in 3x3 block\r\n bool changed = false;\r\n for(unsigned i=0;i<3;++i){\r\n for(unsigned j=0;j<3;++j){\r\n if(solve_each_3x3(i,j)) changed = true;\r\n }\r\n }\r\n return changed;\r\n }\r\n\r\n bool solve_each_3x3(const unsigned row_3x3, const unsigned col_3x3){\r\n bool changed = false;\r\n for(unsigned i=0;i<9;++i){\r\n bool found = false;\r\n unsigned idx = 0;\r\n for(unsigned j=3*row_3x3;j<3*row_3x3+3;++j){\r\n for(unsigned k=3*col_3x3;k<3*col_3x3+3;++k){\r\n auto idx_ = rc_to_idx(j,k);\r\n if(cands[idx_][i]){\r\n if(found) goto LEND;\r\n found = true;\r\n idx = idx_;\r\n }\r\n }\r\n }\r\n if(cells[idx] == 0 && found){\r\n cells[idx] = i+1;\r\n rebuild_cand(idx);\r\n changed = true;\r\n }\r\n LEND: ;\r\n }\r\n return changed;\r\n }\r\n\r\n bool reduce_nearby_pair(){\r\n bool changed = false;\r\n for(unsigned i=0;i<3;++i){\r\n for(unsigned j=0;j<3;++j){\r\n if(reduce_nearby_pair_3x3(i,j)) changed = true;\r\n }\r\n }\r\n return changed;\r\n }\r\n\r\n bool reduce_nearby_pair_3x3(const unsigned row_3x3, const unsigned col_3x3){\r\n bool changed = false;\r\n for(unsigned i=0;i<9;++i){\r\n for(unsigned j=3*row_3x3;j<3*row_3x3+3;++j){\r\n if(\r\n !reduced_row[j][i] &&\r\n (\r\n (cands[rc_to_idx(j,3*col_3x3)][i] && (cands[rc_to_idx(j,3*col_3x3+1)][i] || cands[rc_to_idx(j,3*col_3x3+2)][i])) \r\n ||\r\n (cands[rc_to_idx(j,3*col_3x3+1)][i] && cands[rc_to_idx(j,3*col_3x3+2)][i])\r\n )\r\n ){\r\n for(unsigned k=3*row_3x3;k<3*row_3x3+3;++k){\r\n if(j != k){\r\n for(unsigned l=3*col_3x3;l<3*col_3x3+3;++l){\r\n if(cands[rc_to_idx(k,l)][i]) goto LEND;\r\n }\r\n }\r\n }\r\n for(unsigned k=0;k<9;++k){\r\n if(k\/3*3 != 3*col_3x3) cands[rc_to_idx(j,k)].reset(i);\r\n }\r\n reduced_row[j].set(i);\r\n changed = true;\r\n goto LEND;\r\n }\r\n }\r\n\r\n for(unsigned j=3*col_3x3;j<3*col_3x3+3;++j){\r\n if(\r\n !reduced_col[j][i] &&\r\n (\r\n (cands[rc_to_idx(3*row_3x3,j)][i] && (cands[rc_to_idx(3*row_3x3+1,j)][i] || cands[rc_to_idx(3*row_3x3+2,j)][i])) \r\n ||\r\n (cands[rc_to_idx(3*row_3x3+1,j)][i] && cands[rc_to_idx(3*row_3x3+2,j)][i]) )\r\n ){\r\n for(unsigned k=3*row_3x3;k<3*row_3x3+3;++k){\r\n for(unsigned l=col_3x3*3;l<col_3x3*3+3;++l){\r\n if(j == l) continue;\r\n if(cands[rc_to_idx(k,l)][i]) goto LEND;\r\n }\r\n }\r\n for(unsigned k=0;k<9;++k){\r\n if(k\/3*3 != 3*row_3x3) cands[rc_to_idx(k,j)].reset(i);\r\n }\r\n reduced_col[j].set(i);\r\n changed = true;\r\n goto LEND;\r\n }\r\n }\r\n\r\n LEND: ;\r\n }\r\n return changed;\r\n }\r\n\r\n void gen_cands(){\r\n \t\/\/ generate candidates for each cells\r\n for(unsigned i=0; i<81;++i) if(cells[i] == 0) cands[i] = (cand_in_row(i) & cand_in_col(i) & cand_in_3x3(i));\r\n }\r\n\r\n void rebuild_cand(unsigned idx){\r\n \t\/\/ modify candidates when value of any cells has changed\r\n const unsigned val = cells[idx];\r\n const unsigned row = idx_to_row(idx);\r\n const unsigned col = idx_to_col(idx);\r\n const unsigned row_begin = row\/3*3;\r\n const unsigned col_begin = col\/3*3;\r\n cands[idx].reset();\r\n for(unsigned i=0;i<9;++i){\r\n cands[rc_to_idx(row,i)].reset(val-1);\r\n cands[rc_to_idx(i,col)].reset(val-1);\r\n }\r\n for(unsigned i=row_begin;i<row_begin+3;++i){\r\n for(unsigned j=col_begin;j<col_begin+3;++j){\r\n cands[rc_to_idx(i,j)].reset(val-1);\r\n }\r\n }\r\n }\r\n\r\n friend std::ostream& operator<<(std::ostream& os, sudoku_cell& s){\r\n for (unsigned i=0;i<9;++i){\r\n os << ' ';\r\n for(unsigned j=0;j<9;++j){\r\n os << s.cells[9*i+j] << ((j+1)%3 == 0 && j != 8 ? \" | \" : \" \");\r\n }\r\n std::cout << (((i+1)%3 == 0 && i != 8) ? \"\\n-------+-------+-------\\n\" : \"\\n\");\r\n }\r\n return os;\r\n }\r\n};\r\n\r\nint main(){\r\n sudoku_cell s;\r\n s.cells = {{\r\n #include \"problem.txt\"\r\n }};\r\n\r\n std::cout << s << std::endl;\r\n s.solve();\r\n std::cout << s << std::endl;\r\n}\r\n<commit_msg>Added new algorithms<commit_after>#include <iostream>\r\n#include <iomanip>\r\n#include <array>\r\n#include <bitset>\r\n\r\nstruct sudoku_cell{\r\n using numset = std::bitset<9>;\r\n sudoku_cell():cells{}{}\r\n std::array<unsigned,81> cells;\r\n std::array<numset,81> cands;\r\n std::array<numset,9> reduced_row;\r\n std::array<numset,9> reduced_col;\r\n\r\n inline unsigned rc_to_idx(const unsigned row, const unsigned col){\r\n return 9*row+col;\r\n }\r\n\r\n inline unsigned idx_to_row(const unsigned idx){\r\n return idx\/9;\r\n }\r\n\r\n inline unsigned idx_to_col(const unsigned idx){\r\n return idx%9;\r\n }\r\n\r\n numset cand_in_row(const unsigned idx){\r\n numset ret;\r\n ret.set();\r\n const unsigned row = idx_to_row(idx);\r\n for(unsigned i=0;i<9;++i) if(cells[rc_to_idx(row,i)] != 0) ret.reset(cells[rc_to_idx(row,i)]-1);\r\n return ret;\r\n }\r\n\r\n numset cand_in_col(const unsigned idx){\r\n numset ret;\r\n ret.set();\r\n const unsigned col = idx_to_col(idx);\r\n for(unsigned i=0;i<9;++i) if(cells[rc_to_idx(i,col)] != 0) ret.reset(cells[rc_to_idx(i,col)]-1);\r\n return ret;\r\n }\r\n\r\n numset cand_in_3x3(const unsigned idx){\r\n numset ret;\r\n ret.set();\r\n const unsigned row_begin = idx_to_row(idx)\/3*3;\r\n const unsigned col_begin = idx_to_col(idx)\/3*3;\r\n for(unsigned i=row_begin;i<row_begin+3;++i){\r\n for(unsigned j=col_begin;j<col_begin+3;++j){\r\n if(cells[rc_to_idx(i,j)] != 0) ret.reset(cells[rc_to_idx(i,j)]-1);\r\n }\r\n }\r\n\r\n return ret;\r\n }\r\n\r\n inline unsigned num_of_onbit(const numset& e){ \/\/ return least canding number indicated in e\r\n for(unsigned i=0;i<9;++i) if(e[i]) return i+1;\r\n return 0; \/\/ unreachable\r\n }\r\n\r\n void solve(){\r\n gen_cands();\r\n BEGIN:\r\n if(reduce_nearby_pair()) goto BEGIN;\r\n if(solve_3x3()) goto BEGIN;\r\n\t if(solve_row())\t\tgoto BEGIN;\r\n\t if(solve_col())\t\tgoto BEGIN;\r\n if(solve_one_cand()) goto BEGIN;\r\n }\r\n\r\n bool solve_one_cand(){\r\n \t\/\/ solve cells which have only one candidate\r\n bool changed = false;\r\n for(unsigned i=0;i<81;++i){\r\n if(cells[i] == 0){\r\n if(cands[i].count() == 1){\r\n cells[i] = num_of_onbit(cands[i]);\r\n rebuild_cand(i);\r\n changed = true;\r\n }\r\n }\r\n }\r\n return changed;\r\n }\r\n\r\n bool solve_3x3(){\r\n \t\/\/ solve cells in 3x3 block\r\n bool changed = false;\r\n for(unsigned i=0;i<3;++i){\r\n for(unsigned j=0;j<3;++j){\r\n if(solve_each_3x3(i,j)) changed = true;\r\n }\r\n }\r\n return changed;\r\n }\r\n\r\n bool solve_each_3x3(const unsigned row_3x3, const unsigned col_3x3){\r\n bool changed = false;\r\n for(unsigned i=0;i<9;++i){\r\n bool found = false;\r\n unsigned idx = 0;\r\n for(unsigned j=3*row_3x3;j<3*row_3x3+3;++j){\r\n for(unsigned k=3*col_3x3;k<3*col_3x3+3;++k){\r\n auto idx_ = rc_to_idx(j,k);\r\n if(cands[idx_][i]){\r\n if(found) goto LEND;\r\n found = true;\r\n idx = idx_;\r\n }\r\n }\r\n }\r\n if(cells[idx] == 0 && found){\r\n cells[idx] = i+1;\r\n\t\trebuild_cand(idx);\r\n changed = true;\r\n }\r\n LEND: ;\r\n }\r\n return changed;\r\n }\r\n\r\n bool solve_row(){\r\n\t\/\/solve cells in 3x3 block\r\n\tbool changed = false;\r\n\tfor(unsigned i=0;i<9;++i){\r\n\t if(solve_each_row(i)) changed = true;\r\n\t}\r\n\treturn changed;\r\n }\r\n\r\n bool solve_each_row(const unsigned row){\r\n bool changed = false;\r\n for(unsigned i=0;i<9;++i){\r\n bool found = false;\r\n unsigned idx = 0;\r\n for(unsigned j=0;j<27;++j){\r\n\t\tif(cands[rc_to_idx(row,j)][i]){\r\n\t\t if(found){\r\n\t\t\tfound = false;\r\n\t\t\tbreak;\r\n\t\t }\r\n\t\t else{\r\n\t\t\tfound = true;\r\n\t\t\tidx = rc_to_idx(row,j);\r\n\t\t }\r\n\t\t}\r\n }\r\n if(cells[idx] == 0 && found){\r\n cells[idx] = i+1;\r\n rebuild_cand(idx);\r\n changed = true;\r\n }\r\n }\r\n return changed;\r\n }\r\n\r\n\r\n bool reduce_nearby_pair(){\r\n bool changed = false;\r\n for(unsigned i=0;i<3;++i){\r\n for(unsigned j=0;j<3;++j){\r\n if(reduce_nearby_pair_3x3(i,j)) changed = true;\r\n }\r\n }\r\n return changed;\r\n } \r\n \r\n bool solve_col(){\r\n\t\/\/solve cells in 3x3 block\r\n\tbool changed = false;\r\n\tfor(unsigned i=0;i<9;++i){\r\n\t if(solve_each_col(i)) changed = true;\r\n\t}\r\n\treturn changed;\r\n }\r\n\r\n bool solve_each_col(const unsigned col){\r\n bool changed = false;\r\n for(unsigned i=0;i<9;++i){\r\n bool found = false;\r\n unsigned idx = 0;\r\n for(unsigned j=0;j<27;++j){\r\n\t\tif(cands[rc_to_idx(j,col)][i]){\r\n\t\t if(found){\r\n\t\t\tfound = false;\r\n\t\t\tbreak;\r\n\t\t }\r\n\t\t else{\r\n\t\t\tfound = true;\r\n\t\t\tidx = rc_to_idx(j,col);\r\n\t\t }\r\n\t\t}\r\n }\r\n if(cells[idx] == 0 && found){\r\n cells[idx] = i+1;\r\n rebuild_cand(idx);\r\n changed = true;\r\n }\r\n }\r\n return changed;\r\n }\r\n\r\n\r\n bool reduce_nearby_pair_3x3(const unsigned row_3x3, const unsigned col_3x3){\r\n bool changed = false;\r\n for(unsigned i=0;i<9;++i){\r\n for(unsigned j=3*row_3x3;j<3*row_3x3+3;++j){\r\n if(\r\n !reduced_row[j][i] &&\r\n (\r\n (cands[rc_to_idx(j,3*col_3x3)][i] && (cands[rc_to_idx(j,3*col_3x3+1)][i] || cands[rc_to_idx(j,3*col_3x3+2)][i])) \r\n ||\r\n (cands[rc_to_idx(j,3*col_3x3+1)][i] && cands[rc_to_idx(j,3*col_3x3+2)][i])\r\n )\r\n ){\r\n for(unsigned k=3*row_3x3;k<3*row_3x3+3;++k){\r\n if(j != k){\r\n for(unsigned l=3*col_3x3;l<3*col_3x3+3;++l){\r\n if(cands[rc_to_idx(k,l)][i]) goto LEND;\r\n }\r\n }\r\n }\r\n for(unsigned k=0;k<9;++k){\r\n if(k\/3*3 != 3*col_3x3) cands[rc_to_idx(j,k)].reset(i);\r\n }\r\n reduced_row[j].set(i);\r\n changed = true;\r\n goto LEND;\r\n }\r\n }\r\n\r\n for(unsigned j=3*col_3x3;j<3*col_3x3+3;++j){\r\n if(\r\n !reduced_col[j][i] &&\r\n (\r\n (cands[rc_to_idx(3*row_3x3,j)][i] && (cands[rc_to_idx(3*row_3x3+1,j)][i] || cands[rc_to_idx(3*row_3x3+2,j)][i])) \r\n ||\r\n (cands[rc_to_idx(3*row_3x3+1,j)][i] && cands[rc_to_idx(3*row_3x3+2,j)][i]) )\r\n ){\r\n for(unsigned k=3*row_3x3;k<3*row_3x3+3;++k){\r\n for(unsigned l=col_3x3*3;l<col_3x3*3+3;++l){\r\n if(j == l) continue;\r\n if(cands[rc_to_idx(k,l)][i]) goto LEND;\r\n }\r\n }\r\n for(unsigned k=0;k<9;++k){\r\n if(k\/3*3 != 3*row_3x3) cands[rc_to_idx(k,j)].reset(i);\r\n }\r\n reduced_col[j].set(i);\r\n changed = true;\r\n goto LEND;\r\n }\r\n }\r\n\r\n LEND: ;\r\n }\r\n return changed;\r\n }\r\n\r\n void gen_cands(){\r\n \t\/\/ generate candidates for each cells\r\n for(unsigned i=0; i<81;++i) if(cells[i] == 0) cands[i] = (cand_in_row(i) & cand_in_col(i) & cand_in_3x3(i));\r\n }\r\n\r\n void rebuild_cand(unsigned idx){\r\n \t\/\/ modify candidates when value of any cells has changed\r\n const unsigned val = cells[idx];\r\n const unsigned row = idx_to_row(idx);\r\n const unsigned col = idx_to_col(idx);\r\n const unsigned row_begin = row\/3*3;\r\n const unsigned col_begin = col\/3*3;\r\n cands[idx].reset();\r\n for(unsigned i=0;i<9;++i){\r\n cands[rc_to_idx(row,i)].reset(val-1);\r\n cands[rc_to_idx(i,col)].reset(val-1);\r\n }\r\n for(unsigned i=row_begin;i<row_begin+3;++i){\r\n for(unsigned j=col_begin;j<col_begin+3;++j){\r\n cands[rc_to_idx(i,j)].reset(val-1);\r\n }\r\n }\r\n }\r\n\r\n friend std::ostream& operator<<(std::ostream& os, sudoku_cell& s){\r\n for (unsigned i=0;i<9;++i){\r\n os << ' ';\r\n for(unsigned j=0;j<9;++j){\r\n os << s.cells[9*i+j] << ((j+1)%3 == 0 && j != 8 ? \" | \" : \" \");\r\n }\r\n std::cout << (((i+1)%3 == 0 && i != 8) ? \"\\n-------+-------+-------\\n\" : \"\\n\");\r\n }\r\n return os;\r\n }\r\n};\r\n\r\nint main(){\r\n sudoku_cell s;\r\n s.cells = {{\r\n #include \"problem.txt\"\r\n }};\r\n\r\n std::cout << s << std::endl;\r\n s.solve();\r\n std::cout << s << std::endl;\r\n}\r\n<|endoftext|>"} {"text":"<commit_before>\/* $Id$ *\/\n\n\/*\n * Copyright (c) 2010 .SE (The Internet Infrastructure 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\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 ``AS IS'' AND ANY EXPRESS OR\n * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED\n * WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE\n * ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY\n * DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL\n * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE\n * GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS\n * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER\n * IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR\n * OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN\n * IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.\n *\/\n\n\/*****************************************************************************\n UserTests.cpp\n\n Contains test cases to C_InitPIN, C_SetPIN, C_Login, and C_Logout\n *****************************************************************************\/\n\n#include <stdlib.h>\n#include <string.h>\n#include <cppunit\/extensions\/HelperMacros.h>\n#include \"UserTests.h\"\n#include \"testconfig.h\"\n\nCPPUNIT_TEST_SUITE_REGISTRATION(UserTests);\n\nvoid UserTests::setUp()\n{\n\tsetenv(\"SOFTHSM2_CONF\", \".\/softhsm2.conf\", 1);\n\n\tCK_UTF8CHAR pin[] = SLOT_0_SO1_PIN;\n\tCK_ULONG pinLength = sizeof(pin) - 1;\n\tCK_UTF8CHAR label[32];\n\tmemset(label, ' ', 32);\n\tmemcpy(label, \"token1\", strlen(\"token1\"));\n\n\t\/\/ (Re)initialize the token\n\tCK_RV rv = C_Initialize(NULL_PTR);\n\tCPPUNIT_ASSERT(rv == CKR_OK);\n\trv = C_InitToken(SLOT_INIT_TOKEN, pin, pinLength, label);\n\tCPPUNIT_ASSERT(rv == CKR_OK);\n\tC_Finalize(NULL_PTR);\n}\n\nvoid UserTests::tearDown()\n{\n\t\/\/ Just make sure that we finalize any previous tests\n\tC_Finalize(NULL_PTR);\n}\n\nvoid UserTests::testInitPIN()\n{\n\tCK_RV rv;\n\tCK_UTF8CHAR pin[] = SLOT_0_USER1_PIN;\n\tCK_ULONG pinLength = sizeof(pin) - 1;\n\tCK_UTF8CHAR sopin[] = SLOT_0_SO1_PIN;\n\tCK_ULONG sopinLength = sizeof(sopin) - 1;\n\tCK_SESSION_HANDLE hSession;\n\n\t\/\/ Just make sure that we finalize any previous tests\n\tC_Finalize(NULL_PTR);\n\n\trv = C_InitPIN(hSession, pin, pinLength);\n\tCPPUNIT_ASSERT(rv == CKR_CRYPTOKI_NOT_INITIALIZED);\n\n\trv = C_Initialize(NULL_PTR);\n\tCPPUNIT_ASSERT(rv == CKR_OK);\n\n\trv = C_OpenSession(SLOT_INIT_TOKEN, CKF_SERIAL_SESSION | CKF_RW_SESSION, NULL_PTR, NULL_PTR, &hSession);\n\tCPPUNIT_ASSERT(rv == CKR_OK);\n\n\trv = C_InitPIN(hSession, pin, pinLength);\n\tCPPUNIT_ASSERT(rv == CKR_USER_NOT_LOGGED_IN);\n\n\trv = C_Login(hSession, CKU_SO, sopin, sopinLength);\n\tCPPUNIT_ASSERT(rv == CKR_OK);\n\n\trv = C_InitPIN(CK_INVALID_HANDLE, pin, pinLength);\n\tCPPUNIT_ASSERT(rv == CKR_SESSION_HANDLE_INVALID);\n\n\trv = C_InitPIN(hSession, pin, 0);\n\tCPPUNIT_ASSERT(rv == CKR_PIN_LEN_RANGE);\n\n\trv = C_InitPIN(hSession, pin, pinLength);\n\tCPPUNIT_ASSERT(rv == CKR_OK);\n}\n\nvoid UserTests::testLogin()\n{\n\tCK_RV rv;\n\tCK_UTF8CHAR pin[] = SLOT_0_USER1_PIN;\n\tCK_ULONG pinLength = sizeof(pin) - 1;\n\tCK_UTF8CHAR sopin[] = SLOT_0_SO1_PIN;\n\tCK_ULONG sopinLength = sizeof(sopin) - 1;\n\tCK_SESSION_HANDLE hSession[2];\n\n\t\/\/ Just make sure that we finalize any previous tests\n\tC_Finalize(NULL_PTR);\n\n\t\/\/ Set up user PIN\n\trv = C_Initialize(NULL_PTR);\n\tCPPUNIT_ASSERT(rv == CKR_OK);\n\trv = C_OpenSession(SLOT_INIT_TOKEN, CKF_SERIAL_SESSION | CKF_RW_SESSION, NULL_PTR, NULL_PTR, &hSession[0]);\n\tCPPUNIT_ASSERT(rv == CKR_OK);\n\trv = C_Login(hSession[0], CKU_SO, sopin, sopinLength);\n\tCPPUNIT_ASSERT(rv == CKR_OK);\n\trv = C_InitPIN(hSession[0], pin, pinLength);\n\tCPPUNIT_ASSERT(rv == CKR_OK);\n\tC_Finalize(NULL_PTR);\n\n\trv = C_Login(hSession[0], CKU_SO, sopin, sopinLength);\n\tCPPUNIT_ASSERT(rv == CKR_CRYPTOKI_NOT_INITIALIZED);\n\n\trv = C_Initialize(NULL_PTR);\n\tCPPUNIT_ASSERT(rv == CKR_OK);\n\n\trv = C_OpenSession(SLOT_INIT_TOKEN, CKF_SERIAL_SESSION | CKF_RW_SESSION, NULL_PTR, NULL_PTR, &hSession[0]);\n\tCPPUNIT_ASSERT(rv == CKR_OK);\n\n\trv = C_Login(CK_INVALID_HANDLE, CKU_SO, sopin, sopinLength);\n\tCPPUNIT_ASSERT(rv == CKR_SESSION_HANDLE_INVALID);\n\n\trv = C_Login(hSession[0], CKU_SO, NULL_PTR, sopinLength);\n\tCPPUNIT_ASSERT(rv == CKR_ARGUMENTS_BAD);\n\n\trv = C_Login(hSession[0], CKU_SO, sopin, 0);\n\tCPPUNIT_ASSERT(rv == CKR_PIN_INCORRECT);\n\n\trv = C_OpenSession(SLOT_INIT_TOKEN, CKF_SERIAL_SESSION, NULL_PTR, NULL_PTR, &hSession[1]);\n\tCPPUNIT_ASSERT(rv == CKR_OK);\n\n\trv = C_Login(hSession[0], CKU_SO, sopin, sopinLength);\n\tCPPUNIT_ASSERT(rv == CKR_SESSION_READ_ONLY_EXISTS);\n\n\trv = C_CloseSession(hSession[1]);\n\tCPPUNIT_ASSERT(rv == CKR_OK);\n\n\trv = C_Login(hSession[0], CKU_USER, pin, pinLength);\n\tCPPUNIT_ASSERT(rv == CKR_OK);\n\n\trv = C_Login(hSession[0], CKU_SO, sopin, sopinLength);\n\tCPPUNIT_ASSERT(rv == CKR_USER_ANOTHER_ALREADY_LOGGED_IN);\n\n\trv = C_Logout(hSession[0]);\n\tCPPUNIT_ASSERT(rv == CKR_OK);\n\n\trv = C_Login(hSession[0], CKU_SO, sopin, sopinLength);\n\tCPPUNIT_ASSERT(rv == CKR_OK);\n\n\trv = C_Login(hSession[0], CKU_SO, sopin, sopinLength);\n\tCPPUNIT_ASSERT(rv == CKR_USER_ALREADY_LOGGED_IN);\n\n\trv = C_Login(hSession[0], CKU_USER, pin, pinLength);\n\tCPPUNIT_ASSERT(rv == CKR_USER_ANOTHER_ALREADY_LOGGED_IN);\n\n\trv = C_Logout(hSession[0]);\n\tCPPUNIT_ASSERT(rv == CKR_OK);\n\n\trv = C_Login(hSession[0], CKU_USER, pin, pinLength - 1);\n\tCPPUNIT_ASSERT(rv == CKR_PIN_INCORRECT);\n\n\trv = C_Login(hSession[0], CKU_USER, pin, pinLength);\n\tCPPUNIT_ASSERT(rv == CKR_OK);\n\n\trv = C_Login(hSession[0], CKU_USER, pin, pinLength);\n\tCPPUNIT_ASSERT(rv == CKR_USER_ALREADY_LOGGED_IN);\n}\n\nvoid UserTests::testLogout()\n{\n\tCK_RV rv;\n\tCK_UTF8CHAR pin[] = SLOT_0_SO1_PIN;\n\tCK_ULONG pinLength = sizeof(pin) - 1;\n\tCK_SESSION_HANDLE hSession;\n\n\t\/\/ Just make sure that we finalize any previous tests\n\tC_Finalize(NULL_PTR);\n\n\trv = C_Logout(hSession);\n\tCPPUNIT_ASSERT(rv == CKR_CRYPTOKI_NOT_INITIALIZED);\n\n\trv = C_Initialize(NULL_PTR);\n\tCPPUNIT_ASSERT(rv == CKR_OK);\n\n\trv = C_OpenSession(SLOT_INIT_TOKEN, CKF_SERIAL_SESSION | CKF_RW_SESSION, NULL_PTR, NULL_PTR, &hSession);\n\tCPPUNIT_ASSERT(rv == CKR_OK);\n\n\trv = C_Login(hSession, CKU_SO, pin, pinLength);\n\tCPPUNIT_ASSERT(rv == CKR_OK);\n\n\trv = C_Logout(CK_INVALID_HANDLE);\n\tCPPUNIT_ASSERT(rv == CKR_SESSION_HANDLE_INVALID);\n\n\trv = C_Logout(hSession);\n\tCPPUNIT_ASSERT(rv == CKR_OK);\n\n\trv = C_Logout(hSession);\n\tCPPUNIT_ASSERT(rv == CKR_OK);\n}\n\nvoid UserTests::testSetPIN()\n{\n\tCK_RV rv;\n\tCK_UTF8CHAR pin1[] = SLOT_0_USER1_PIN;\n\tCK_ULONG pin1Length = sizeof(pin1) - 1;\n\tCK_UTF8CHAR pin2[] = SLOT_0_USER2_PIN;\n\tCK_ULONG pin2Length = sizeof(pin2) - 1;\n\tCK_UTF8CHAR so1pin[] = SLOT_0_SO1_PIN;\n\tCK_ULONG so1pinLength = sizeof(so1pin) - 1;\n\tCK_UTF8CHAR so2pin[] = SLOT_0_SO2_PIN;\n\tCK_ULONG so2pinLength = sizeof(so2pin) - 1;\n\tCK_SESSION_HANDLE hSession;\n\n\t\/\/ Just make sure that we finalize any previous tests\n\tC_Finalize(NULL_PTR);\n\n\t\/\/ Set up user PIN\n\trv = C_Initialize(NULL_PTR);\n\tCPPUNIT_ASSERT(rv == CKR_OK);\n\trv = C_OpenSession(SLOT_INIT_TOKEN, CKF_SERIAL_SESSION | CKF_RW_SESSION, NULL_PTR, NULL_PTR, &hSession);\n\tCPPUNIT_ASSERT(rv == CKR_OK);\n\trv = C_Login(hSession, CKU_SO, so1pin, so1pinLength);\n\tCPPUNIT_ASSERT(rv == CKR_OK);\n\trv = C_InitPIN(hSession, pin1, pin1Length);\n\tCPPUNIT_ASSERT(rv == CKR_OK);\n\tC_Finalize(NULL_PTR);\n\n\trv = C_SetPIN(hSession, pin1, pin1Length, pin2, pin2Length);\n\tCPPUNIT_ASSERT(rv == CKR_CRYPTOKI_NOT_INITIALIZED);\n\n\trv = C_Initialize(NULL_PTR);\n\tCPPUNIT_ASSERT(rv == CKR_OK);\n\n\trv = C_OpenSession(SLOT_INIT_TOKEN, CKF_SERIAL_SESSION, NULL_PTR, NULL_PTR, &hSession);\n\tCPPUNIT_ASSERT(rv == CKR_OK);\n\n\trv = C_SetPIN(CK_INVALID_HANDLE, pin1, pin1Length, pin2, pin2Length);\n\tCPPUNIT_ASSERT(rv == CKR_SESSION_HANDLE_INVALID);\n\n\trv = C_SetPIN(hSession, pin1, pin1Length, pin2, pin2Length);\n\tCPPUNIT_ASSERT(rv == CKR_SESSION_READ_ONLY);\n\n\trv = C_CloseSession(hSession);\n\tCPPUNIT_ASSERT(rv == CKR_OK);\n\n\trv = C_OpenSession(SLOT_INIT_TOKEN, CKF_SERIAL_SESSION | CKF_RW_SESSION, NULL_PTR, NULL_PTR, &hSession);\n\tCPPUNIT_ASSERT(rv == CKR_OK);\n\n\trv = C_SetPIN(hSession, NULL_PTR, pin1Length, pin2, pin2Length);\n\tCPPUNIT_ASSERT(rv == CKR_ARGUMENTS_BAD);\n\n\trv = C_SetPIN(hSession, pin1, pin1Length, NULL_PTR, pin2Length);\n\tCPPUNIT_ASSERT(rv == CKR_ARGUMENTS_BAD);\n\n\trv = C_SetPIN(hSession, pin1, pin1Length, pin2, 0);\n\tCPPUNIT_ASSERT(rv == CKR_PIN_LEN_RANGE);\n\n\trv = C_SetPIN(hSession, pin2, pin2Length, pin2, pin2Length);\n\tCPPUNIT_ASSERT(rv == CKR_PIN_INCORRECT);\n\n\trv = C_SetPIN(hSession, pin1, pin1Length, pin2, pin2Length);\n\tCPPUNIT_ASSERT(rv == CKR_OK);\n\n\trv = C_Login(hSession, CKU_USER, pin2, pin2Length);\n\tCPPUNIT_ASSERT(rv == CKR_OK);\n\n\trv = C_SetPIN(hSession, pin1, pin1Length, pin2, pin2Length);\n\tCPPUNIT_ASSERT(rv == CKR_PIN_INCORRECT);\n\n\trv = C_SetPIN(hSession, pin2, pin2Length, pin1, pin1Length);\n\tCPPUNIT_ASSERT(rv == CKR_OK);\n\n\trv = C_Login(hSession, CKU_SO, so1pin, so1pinLength);\n\tCPPUNIT_ASSERT(rv == CKR_USER_ANOTHER_ALREADY_LOGGED_IN);\n\n\trv = C_Logout(hSession);\n\tCPPUNIT_ASSERT(rv == CKR_OK);\n\n\trv = C_Login(hSession, CKU_SO, so1pin, so1pinLength);\n\tCPPUNIT_ASSERT(rv == CKR_OK);\n\n\trv = C_SetPIN(hSession, so2pin, so2pinLength, so2pin, so2pinLength);\n\tCPPUNIT_ASSERT(rv == CKR_PIN_INCORRECT);\n\n\trv = C_SetPIN(hSession, so1pin, so1pinLength, so2pin, so2pinLength);\n\tCPPUNIT_ASSERT(rv == CKR_OK);\n\n\trv = C_SetPIN(hSession, so1pin, so1pinLength, so1pin, so1pinLength);\n\tCPPUNIT_ASSERT(rv == CKR_PIN_INCORRECT);\n\n\trv = C_SetPIN(hSession, so2pin, so2pinLength, so1pin, so1pinLength);\n\tCPPUNIT_ASSERT(rv == CKR_OK);\n}\n<commit_msg>Also check for CKR_USER_PIN_NOT_INITIALIZED<commit_after>\/* $Id$ *\/\n\n\/*\n * Copyright (c) 2010 .SE (The Internet Infrastructure 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\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 ``AS IS'' AND ANY EXPRESS OR\n * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED\n * WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE\n * ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY\n * DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL\n * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE\n * GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS\n * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER\n * IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR\n * OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN\n * IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.\n *\/\n\n\/*****************************************************************************\n UserTests.cpp\n\n Contains test cases to C_InitPIN, C_SetPIN, C_Login, and C_Logout\n *****************************************************************************\/\n\n#include <stdlib.h>\n#include <string.h>\n#include <cppunit\/extensions\/HelperMacros.h>\n#include \"UserTests.h\"\n#include \"testconfig.h\"\n\nCPPUNIT_TEST_SUITE_REGISTRATION(UserTests);\n\nvoid UserTests::setUp()\n{\n\tsetenv(\"SOFTHSM2_CONF\", \".\/softhsm2.conf\", 1);\n\n\tCK_UTF8CHAR pin[] = SLOT_0_SO1_PIN;\n\tCK_ULONG pinLength = sizeof(pin) - 1;\n\tCK_UTF8CHAR label[32];\n\tmemset(label, ' ', 32);\n\tmemcpy(label, \"token1\", strlen(\"token1\"));\n\n\t\/\/ (Re)initialize the token\n\tCK_RV rv = C_Initialize(NULL_PTR);\n\tCPPUNIT_ASSERT(rv == CKR_OK);\n\trv = C_InitToken(SLOT_INIT_TOKEN, pin, pinLength, label);\n\tCPPUNIT_ASSERT(rv == CKR_OK);\n\tC_Finalize(NULL_PTR);\n}\n\nvoid UserTests::tearDown()\n{\n\t\/\/ Just make sure that we finalize any previous tests\n\tC_Finalize(NULL_PTR);\n}\n\nvoid UserTests::testInitPIN()\n{\n\tCK_RV rv;\n\tCK_UTF8CHAR pin[] = SLOT_0_USER1_PIN;\n\tCK_ULONG pinLength = sizeof(pin) - 1;\n\tCK_UTF8CHAR sopin[] = SLOT_0_SO1_PIN;\n\tCK_ULONG sopinLength = sizeof(sopin) - 1;\n\tCK_SESSION_HANDLE hSession;\n\n\t\/\/ Just make sure that we finalize any previous tests\n\tC_Finalize(NULL_PTR);\n\n\trv = C_InitPIN(hSession, pin, pinLength);\n\tCPPUNIT_ASSERT(rv == CKR_CRYPTOKI_NOT_INITIALIZED);\n\n\trv = C_Initialize(NULL_PTR);\n\tCPPUNIT_ASSERT(rv == CKR_OK);\n\n\trv = C_OpenSession(SLOT_INIT_TOKEN, CKF_SERIAL_SESSION | CKF_RW_SESSION, NULL_PTR, NULL_PTR, &hSession);\n\tCPPUNIT_ASSERT(rv == CKR_OK);\n\n\trv = C_InitPIN(hSession, pin, pinLength);\n\tCPPUNIT_ASSERT(rv == CKR_USER_NOT_LOGGED_IN);\n\n\trv = C_Login(hSession, CKU_SO, sopin, sopinLength);\n\tCPPUNIT_ASSERT(rv == CKR_OK);\n\n\trv = C_InitPIN(CK_INVALID_HANDLE, pin, pinLength);\n\tCPPUNIT_ASSERT(rv == CKR_SESSION_HANDLE_INVALID);\n\n\trv = C_InitPIN(hSession, pin, 0);\n\tCPPUNIT_ASSERT(rv == CKR_PIN_LEN_RANGE);\n\n\trv = C_InitPIN(hSession, pin, pinLength);\n\tCPPUNIT_ASSERT(rv == CKR_OK);\n}\n\nvoid UserTests::testLogin()\n{\n\tCK_RV rv;\n\tCK_UTF8CHAR pin[] = SLOT_0_USER1_PIN;\n\tCK_ULONG pinLength = sizeof(pin) - 1;\n\tCK_UTF8CHAR sopin[] = SLOT_0_SO1_PIN;\n\tCK_ULONG sopinLength = sizeof(sopin) - 1;\n\tCK_SESSION_HANDLE hSession[2];\n\n\t\/\/ Just make sure that we finalize any previous tests\n\tC_Finalize(NULL_PTR);\n\n\t\/\/ Set up user PIN\n\trv = C_Initialize(NULL_PTR);\n\tCPPUNIT_ASSERT(rv == CKR_OK);\n\trv = C_OpenSession(SLOT_INIT_TOKEN, CKF_SERIAL_SESSION | CKF_RW_SESSION, NULL_PTR, NULL_PTR, &hSession[0]);\n\tCPPUNIT_ASSERT(rv == CKR_OK);\n\trv = C_Login(hSession[0], CKU_USER, pin, pinLength);\n\tCPPUNIT_ASSERT(rv == CKR_USER_PIN_NOT_INITIALIZED);\n\trv = C_Login(hSession[0], CKU_SO, sopin, sopinLength);\n\tCPPUNIT_ASSERT(rv == CKR_OK);\n\trv = C_InitPIN(hSession[0], pin, pinLength);\n\tCPPUNIT_ASSERT(rv == CKR_OK);\n\tC_Finalize(NULL_PTR);\n\n\trv = C_Login(hSession[0], CKU_SO, sopin, sopinLength);\n\tCPPUNIT_ASSERT(rv == CKR_CRYPTOKI_NOT_INITIALIZED);\n\n\trv = C_Initialize(NULL_PTR);\n\tCPPUNIT_ASSERT(rv == CKR_OK);\n\n\trv = C_OpenSession(SLOT_INIT_TOKEN, CKF_SERIAL_SESSION | CKF_RW_SESSION, NULL_PTR, NULL_PTR, &hSession[0]);\n\tCPPUNIT_ASSERT(rv == CKR_OK);\n\n\trv = C_Login(CK_INVALID_HANDLE, CKU_SO, sopin, sopinLength);\n\tCPPUNIT_ASSERT(rv == CKR_SESSION_HANDLE_INVALID);\n\n\trv = C_Login(hSession[0], CKU_SO, NULL_PTR, sopinLength);\n\tCPPUNIT_ASSERT(rv == CKR_ARGUMENTS_BAD);\n\n\trv = C_Login(hSession[0], CKU_SO, sopin, 0);\n\tCPPUNIT_ASSERT(rv == CKR_PIN_INCORRECT);\n\n\trv = C_OpenSession(SLOT_INIT_TOKEN, CKF_SERIAL_SESSION, NULL_PTR, NULL_PTR, &hSession[1]);\n\tCPPUNIT_ASSERT(rv == CKR_OK);\n\n\trv = C_Login(hSession[0], CKU_SO, sopin, sopinLength);\n\tCPPUNIT_ASSERT(rv == CKR_SESSION_READ_ONLY_EXISTS);\n\n\trv = C_CloseSession(hSession[1]);\n\tCPPUNIT_ASSERT(rv == CKR_OK);\n\n\trv = C_Login(hSession[0], CKU_USER, pin, pinLength);\n\tCPPUNIT_ASSERT(rv == CKR_OK);\n\n\trv = C_Login(hSession[0], CKU_SO, sopin, sopinLength);\n\tCPPUNIT_ASSERT(rv == CKR_USER_ANOTHER_ALREADY_LOGGED_IN);\n\n\trv = C_Logout(hSession[0]);\n\tCPPUNIT_ASSERT(rv == CKR_OK);\n\n\trv = C_Login(hSession[0], CKU_SO, sopin, sopinLength);\n\tCPPUNIT_ASSERT(rv == CKR_OK);\n\n\trv = C_Login(hSession[0], CKU_SO, sopin, sopinLength);\n\tCPPUNIT_ASSERT(rv == CKR_USER_ALREADY_LOGGED_IN);\n\n\trv = C_Login(hSession[0], CKU_USER, pin, pinLength);\n\tCPPUNIT_ASSERT(rv == CKR_USER_ANOTHER_ALREADY_LOGGED_IN);\n\n\trv = C_Logout(hSession[0]);\n\tCPPUNIT_ASSERT(rv == CKR_OK);\n\n\trv = C_Login(hSession[0], CKU_USER, pin, pinLength - 1);\n\tCPPUNIT_ASSERT(rv == CKR_PIN_INCORRECT);\n\n\trv = C_Login(hSession[0], CKU_USER, pin, pinLength);\n\tCPPUNIT_ASSERT(rv == CKR_OK);\n\n\trv = C_Login(hSession[0], CKU_USER, pin, pinLength);\n\tCPPUNIT_ASSERT(rv == CKR_USER_ALREADY_LOGGED_IN);\n}\n\nvoid UserTests::testLogout()\n{\n\tCK_RV rv;\n\tCK_UTF8CHAR pin[] = SLOT_0_SO1_PIN;\n\tCK_ULONG pinLength = sizeof(pin) - 1;\n\tCK_SESSION_HANDLE hSession;\n\n\t\/\/ Just make sure that we finalize any previous tests\n\tC_Finalize(NULL_PTR);\n\n\trv = C_Logout(hSession);\n\tCPPUNIT_ASSERT(rv == CKR_CRYPTOKI_NOT_INITIALIZED);\n\n\trv = C_Initialize(NULL_PTR);\n\tCPPUNIT_ASSERT(rv == CKR_OK);\n\n\trv = C_OpenSession(SLOT_INIT_TOKEN, CKF_SERIAL_SESSION | CKF_RW_SESSION, NULL_PTR, NULL_PTR, &hSession);\n\tCPPUNIT_ASSERT(rv == CKR_OK);\n\n\trv = C_Login(hSession, CKU_SO, pin, pinLength);\n\tCPPUNIT_ASSERT(rv == CKR_OK);\n\n\trv = C_Logout(CK_INVALID_HANDLE);\n\tCPPUNIT_ASSERT(rv == CKR_SESSION_HANDLE_INVALID);\n\n\trv = C_Logout(hSession);\n\tCPPUNIT_ASSERT(rv == CKR_OK);\n\n\trv = C_Logout(hSession);\n\tCPPUNIT_ASSERT(rv == CKR_OK);\n}\n\nvoid UserTests::testSetPIN()\n{\n\tCK_RV rv;\n\tCK_UTF8CHAR pin1[] = SLOT_0_USER1_PIN;\n\tCK_ULONG pin1Length = sizeof(pin1) - 1;\n\tCK_UTF8CHAR pin2[] = SLOT_0_USER2_PIN;\n\tCK_ULONG pin2Length = sizeof(pin2) - 1;\n\tCK_UTF8CHAR so1pin[] = SLOT_0_SO1_PIN;\n\tCK_ULONG so1pinLength = sizeof(so1pin) - 1;\n\tCK_UTF8CHAR so2pin[] = SLOT_0_SO2_PIN;\n\tCK_ULONG so2pinLength = sizeof(so2pin) - 1;\n\tCK_SESSION_HANDLE hSession;\n\n\t\/\/ Just make sure that we finalize any previous tests\n\tC_Finalize(NULL_PTR);\n\n\t\/\/ Set up user PIN\n\trv = C_Initialize(NULL_PTR);\n\tCPPUNIT_ASSERT(rv == CKR_OK);\n\trv = C_OpenSession(SLOT_INIT_TOKEN, CKF_SERIAL_SESSION | CKF_RW_SESSION, NULL_PTR, NULL_PTR, &hSession);\n\tCPPUNIT_ASSERT(rv == CKR_OK);\n\trv = C_Login(hSession, CKU_SO, so1pin, so1pinLength);\n\tCPPUNIT_ASSERT(rv == CKR_OK);\n\trv = C_InitPIN(hSession, pin1, pin1Length);\n\tCPPUNIT_ASSERT(rv == CKR_OK);\n\tC_Finalize(NULL_PTR);\n\n\trv = C_SetPIN(hSession, pin1, pin1Length, pin2, pin2Length);\n\tCPPUNIT_ASSERT(rv == CKR_CRYPTOKI_NOT_INITIALIZED);\n\n\trv = C_Initialize(NULL_PTR);\n\tCPPUNIT_ASSERT(rv == CKR_OK);\n\n\trv = C_OpenSession(SLOT_INIT_TOKEN, CKF_SERIAL_SESSION, NULL_PTR, NULL_PTR, &hSession);\n\tCPPUNIT_ASSERT(rv == CKR_OK);\n\n\trv = C_SetPIN(CK_INVALID_HANDLE, pin1, pin1Length, pin2, pin2Length);\n\tCPPUNIT_ASSERT(rv == CKR_SESSION_HANDLE_INVALID);\n\n\trv = C_SetPIN(hSession, pin1, pin1Length, pin2, pin2Length);\n\tCPPUNIT_ASSERT(rv == CKR_SESSION_READ_ONLY);\n\n\trv = C_CloseSession(hSession);\n\tCPPUNIT_ASSERT(rv == CKR_OK);\n\n\trv = C_OpenSession(SLOT_INIT_TOKEN, CKF_SERIAL_SESSION | CKF_RW_SESSION, NULL_PTR, NULL_PTR, &hSession);\n\tCPPUNIT_ASSERT(rv == CKR_OK);\n\n\trv = C_SetPIN(hSession, NULL_PTR, pin1Length, pin2, pin2Length);\n\tCPPUNIT_ASSERT(rv == CKR_ARGUMENTS_BAD);\n\n\trv = C_SetPIN(hSession, pin1, pin1Length, NULL_PTR, pin2Length);\n\tCPPUNIT_ASSERT(rv == CKR_ARGUMENTS_BAD);\n\n\trv = C_SetPIN(hSession, pin1, pin1Length, pin2, 0);\n\tCPPUNIT_ASSERT(rv == CKR_PIN_LEN_RANGE);\n\n\trv = C_SetPIN(hSession, pin2, pin2Length, pin2, pin2Length);\n\tCPPUNIT_ASSERT(rv == CKR_PIN_INCORRECT);\n\n\trv = C_SetPIN(hSession, pin1, pin1Length, pin2, pin2Length);\n\tCPPUNIT_ASSERT(rv == CKR_OK);\n\n\trv = C_Login(hSession, CKU_USER, pin2, pin2Length);\n\tCPPUNIT_ASSERT(rv == CKR_OK);\n\n\trv = C_SetPIN(hSession, pin1, pin1Length, pin2, pin2Length);\n\tCPPUNIT_ASSERT(rv == CKR_PIN_INCORRECT);\n\n\trv = C_SetPIN(hSession, pin2, pin2Length, pin1, pin1Length);\n\tCPPUNIT_ASSERT(rv == CKR_OK);\n\n\trv = C_Login(hSession, CKU_SO, so1pin, so1pinLength);\n\tCPPUNIT_ASSERT(rv == CKR_USER_ANOTHER_ALREADY_LOGGED_IN);\n\n\trv = C_Logout(hSession);\n\tCPPUNIT_ASSERT(rv == CKR_OK);\n\n\trv = C_Login(hSession, CKU_SO, so1pin, so1pinLength);\n\tCPPUNIT_ASSERT(rv == CKR_OK);\n\n\trv = C_SetPIN(hSession, so2pin, so2pinLength, so2pin, so2pinLength);\n\tCPPUNIT_ASSERT(rv == CKR_PIN_INCORRECT);\n\n\trv = C_SetPIN(hSession, so1pin, so1pinLength, so2pin, so2pinLength);\n\tCPPUNIT_ASSERT(rv == CKR_OK);\n\n\trv = C_SetPIN(hSession, so1pin, so1pinLength, so1pin, so1pinLength);\n\tCPPUNIT_ASSERT(rv == CKR_PIN_INCORRECT);\n\n\trv = C_SetPIN(hSession, so2pin, so2pinLength, so1pin, so1pinLength);\n\tCPPUNIT_ASSERT(rv == CKR_OK);\n}\n<|endoftext|>"} {"text":"<commit_before>\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\n\/\/ Copyright (c) 2007-2009, Image Engine Design Inc. All rights reserved.\n\/\/\n\/\/ Redistribution and use in source and binary forms, with or without\n\/\/ modification, are permitted provided that the following conditions are\n\/\/ met:\n\/\/\n\/\/ * Redistributions of source code must retain the above copyright\n\/\/ notice, this list of conditions and the following disclaimer.\n\/\/\n\/\/ * Redistributions in binary form must reproduce the above copyright\n\/\/ notice, this list of conditions and the following disclaimer in the\n\/\/ documentation and\/or other materials provided with the distribution.\n\/\/\n\/\/ * Neither the name of Image Engine Design nor the names of any\n\/\/ other contributors to this software may be used to endorse or\n\/\/ promote products derived from this software without specific prior\n\/\/ written permission.\n\/\/\n\/\/ THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS \"AS\n\/\/ IS\" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO,\n\/\/ THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR\n\/\/ PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR\n\/\/ CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,\n\/\/ EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,\n\/\/ PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR\n\/\/ PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF\n\/\/ LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING\n\/\/ NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS\n\/\/ SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.\n\/\/\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n#ifndef IE_CORE_TYPEDPARAMETER_INL\n#define IE_CORE_TYPEDPARAMETER_INL\n\n#include \"boost\/static_assert.hpp\"\n\n#include \"IECore\/TypedParameter.h\"\n#include \"IECore\/CompoundObject.h\"\n\nnamespace IECore\n{\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ constructor stuff\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\ntemplate<typename T>\nstatic Parameter::PresetsContainer convertPresets( const typename TypedParameter<T>::PresetsContainer &p )\n{\n\tParameter::PresetsContainer result;\n\tfor( typename TypedParameter<T>::PresetsContainer::const_iterator it=p.begin(); it!=p.end(); it++ )\n\t{\n\t\tresult.push_back( typename Parameter::PresetsContainer::value_type( it->first, new ObjectType( it->second ) ) );\n\t}\n\treturn result;\n}\n\ntemplate<typename T>\nstatic Parameter::PresetsContainer convertPresets( const typename TypedParameter<T>::ObjectPresetsContainer &p )\n{\n\tParameter::PresetsContainer result;\n\tfor( typename TypedParameter<T>::ObjectPresetsContainer::const_iterator it=p.begin(); it!=p.end(); it++ )\n\t{\n\t\tresult.push_back( typename Parameter::PresetsContainer::value_type( it->first, it->second ) );\n\t}\n\treturn result;\n}\n\ntemplate<typename T>\nTypedParameter<T>::TypedParameter( const std::string &name, const std::string &description, const T &defaultValue,\n\tconst PresetsContainer &presets, bool presetsOnly, ConstCompoundObjectPtr userData )\n\t:\tParameter( name, description, new ObjectType( defaultValue ), convertPresets<T>( presets ), presetsOnly, userData )\t\n{\n}\n\ntemplate<typename T>\nTypedParameter<T>::TypedParameter( const std::string &name, const std::string &description, ObjectTypePtr defaultValue,\n\tconst ObjectPresetsContainer &presets, bool presetsOnly, ConstCompoundObjectPtr userData )\n\t:\tParameter( name, description, defaultValue, convertPresets<T>( presets ), presetsOnly, userData )\n{\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ runtimetyped stuff\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\ntemplate <class T> \nTypeId TypedParameter<T>::typeId() const\n{\n\treturn staticTypeId();\n}\n\ntemplate <class T> \nTypeId TypedParameter<T>::staticTypeId()\n{\n\tBOOST_STATIC_ASSERT( sizeof(T) == 0 ); \/\/ this function must be specialised for each type!\n\treturn InvalidTypeId;\n}\n\ntemplate <class T> \nstd::string TypedParameter<T>::typeName() const\n{\n\treturn staticTypeName();\n}\n\ntemplate <class T> \nstd::string TypedParameter<T>::staticTypeName()\n{\n\tBOOST_STATIC_ASSERT( sizeof(T) == 0 ); \/\/ this function must be specialised for each type!\n\treturn \"\";\n}\n\ntemplate<class T>\nbool TypedParameter<T>::isInstanceOf( TypeId typeId ) const\n{\n\tif( typeId==staticTypeId() )\n\t{\n\t\treturn true;\n\t}\n\treturn Parameter::isInstanceOf( typeId );\n}\n\ntemplate<class T>\nbool TypedParameter<T>::isInstanceOf( const std::string &typeName ) const\n{\n\tif( typeName==staticTypeName() )\n\t{\n\t\treturn true;\n\t}\n\treturn Parameter::isInstanceOf( typeName );\n}\n\ntemplate<class T>\nbool TypedParameter<T>::inheritsFrom( TypeId typeId )\n{\n\treturn Parameter::staticTypeId()==typeId ? true : Parameter::inheritsFrom( typeId );\n}\n\ntemplate<class T>\nbool TypedParameter<T>::inheritsFrom( const std::string &typeName )\n{\n\treturn Parameter::staticTypeName()==typeName ? true : Parameter::inheritsFrom( typeName );\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ other stuff\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\t\t\t\t\t\n\ntemplate<typename T>\nbool TypedParameter<T>::valueValid( ConstObjectPtr value, std::string *reason ) const\n{\n\tif( !Parameter::valueValid( value, reason ) )\n\t{\n\t\treturn false;\n\t}\n\tConstObjectTypePtr tValue = runTimeCast<const ObjectType>( value );\n\tif( !tValue )\n\t{\n\t\tif( reason )\n\t\t{\n\t\t\t*reason = std::string( \"Value is not an instance of \\\"\" ) + ObjectType::staticTypeName() + \"\\\"\";\n\t\t}\n\t\treturn false;\n\t}\n\treturn true;\n}\n\ntemplate<typename T>\nconst typename TypedParameter<T>::ValueType &TypedParameter<T>::typedDefaultValue() const\n{\n\treturn boost::static_pointer_cast<const ObjectType>( defaultValue() )->readable();\n}\n\ntemplate<typename T>\ntypename TypedParameter<T>::ValueType &TypedParameter<T>::getTypedValue()\n{\n\tConstObjectTypePtr tValue = runTimeCast<const ObjectType>( getValue() );\n\tif( !tValue )\n\t{\n\t\tthrow Exception( std::string( \"Value is not an instance of \\\"\" ) + ObjectType::staticTypeName() + \"\\\"\");\n\t}\n\treturn boost::static_pointer_cast<ObjectType>( getValue() )->writable();\n}\n\ntemplate<typename T>\nconst typename TypedParameter<T>::ValueType &TypedParameter<T>::getTypedValue() const\n{\n\tConstObjectTypePtr tValue = runTimeCast<const ObjectType>( getValue() );\n\tif( !tValue )\n\t{\n\t\tthrow Exception( std::string( \"Value is not an instance of \\\"\" ) + ObjectType::staticTypeName() + \"\\\"\");\n\t}\n\treturn boost::static_pointer_cast<const ObjectType>( getValue() )->readable();\n}\n\t\t\ntemplate<typename T>\nvoid TypedParameter<T>::setTypedValue( const T &value )\n{\n\tsetValue( new ObjectType( value ) );\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ specialisation and template instantiation\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\t\n\n\n#define IE_CORE_DEFINETYPEDPARAMETERSPECIALISATION( T, TNAME )\t\t\t\t\t\t\\\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\\\n\ttemplate<>\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\\\n\tTypeId TypedParameter<T>::staticTypeId()\t\t\t\t\t\t\t\t\t\t\\\n\t{\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\\\n\t\treturn TNAME ## TypeId;\t\t\t\t\t\t\t\t\t\t\t\t\t\t\\\n\t}\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\\\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\\\n\ttemplate<>\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\\\n\tstd::string TypedParameter<T>::staticTypeName()\t\t\t\t\t\t\t\t\t\\\n\t{\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\\\n\t\treturn # TNAME;\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\\\n\t}\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\\\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\\\n\ttemplate class TypedParameter<T>;\n\n}\n\t\n#endif \/\/ IE_CORE_TYPEDPARAMETER_INL\n<commit_msg>gcc 4.1.2 fix<commit_after>\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\n\/\/ Copyright (c) 2007-2009, Image Engine Design Inc. All rights reserved.\n\/\/\n\/\/ Redistribution and use in source and binary forms, with or without\n\/\/ modification, are permitted provided that the following conditions are\n\/\/ met:\n\/\/\n\/\/ * Redistributions of source code must retain the above copyright\n\/\/ notice, this list of conditions and the following disclaimer.\n\/\/\n\/\/ * Redistributions in binary form must reproduce the above copyright\n\/\/ notice, this list of conditions and the following disclaimer in the\n\/\/ documentation and\/or other materials provided with the distribution.\n\/\/\n\/\/ * Neither the name of Image Engine Design nor the names of any\n\/\/ other contributors to this software may be used to endorse or\n\/\/ promote products derived from this software without specific prior\n\/\/ written permission.\n\/\/\n\/\/ THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS \"AS\n\/\/ IS\" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO,\n\/\/ THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR\n\/\/ PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR\n\/\/ CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,\n\/\/ EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,\n\/\/ PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR\n\/\/ PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF\n\/\/ LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING\n\/\/ NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS\n\/\/ SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.\n\/\/\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n#ifndef IE_CORE_TYPEDPARAMETER_INL\n#define IE_CORE_TYPEDPARAMETER_INL\n\n#include \"boost\/static_assert.hpp\"\n\n#include \"IECore\/TypedParameter.h\"\n#include \"IECore\/CompoundObject.h\"\n\nnamespace IECore\n{\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ constructor stuff\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\ntemplate<typename T>\nstatic Parameter::PresetsContainer convertPresets( const typename TypedParameter<T>::PresetsContainer &p )\n{\n\tParameter::PresetsContainer result;\n\tfor( typename TypedParameter<T>::PresetsContainer::const_iterator it=p.begin(); it!=p.end(); it++ )\n\t{\n\t\tresult.push_back( typename Parameter::PresetsContainer::value_type( it->first, new (typename TypedParameter<T>::ObjectType)( it->second ) ) );\n\t}\n\treturn result;\n}\n\ntemplate<typename T>\nstatic Parameter::PresetsContainer convertPresets( const typename TypedParameter<T>::ObjectPresetsContainer &p )\n{\n\tParameter::PresetsContainer result;\n\tfor( typename TypedParameter<T>::ObjectPresetsContainer::const_iterator it=p.begin(); it!=p.end(); it++ )\n\t{\n\t\tresult.push_back( typename Parameter::PresetsContainer::value_type( it->first, it->second ) );\n\t}\n\treturn result;\n}\n\ntemplate<typename T>\nTypedParameter<T>::TypedParameter( const std::string &name, const std::string &description, const T &defaultValue,\n\tconst PresetsContainer &presets, bool presetsOnly, ConstCompoundObjectPtr userData )\n\t:\tParameter( name, description, new ObjectType( defaultValue ), convertPresets<T>( presets ), presetsOnly, userData )\t\n{\n}\n\ntemplate<typename T>\nTypedParameter<T>::TypedParameter( const std::string &name, const std::string &description, ObjectTypePtr defaultValue,\n\tconst ObjectPresetsContainer &presets, bool presetsOnly, ConstCompoundObjectPtr userData )\n\t:\tParameter( name, description, defaultValue, convertPresets<T>( presets ), presetsOnly, userData )\n{\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ runtimetyped stuff\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\ntemplate <class T> \nTypeId TypedParameter<T>::typeId() const\n{\n\treturn staticTypeId();\n}\n\ntemplate <class T> \nTypeId TypedParameter<T>::staticTypeId()\n{\n\tBOOST_STATIC_ASSERT( sizeof(T) == 0 ); \/\/ this function must be specialised for each type!\n\treturn InvalidTypeId;\n}\n\ntemplate <class T> \nstd::string TypedParameter<T>::typeName() const\n{\n\treturn staticTypeName();\n}\n\ntemplate <class T> \nstd::string TypedParameter<T>::staticTypeName()\n{\n\tBOOST_STATIC_ASSERT( sizeof(T) == 0 ); \/\/ this function must be specialised for each type!\n\treturn \"\";\n}\n\ntemplate<class T>\nbool TypedParameter<T>::isInstanceOf( TypeId typeId ) const\n{\n\tif( typeId==staticTypeId() )\n\t{\n\t\treturn true;\n\t}\n\treturn Parameter::isInstanceOf( typeId );\n}\n\ntemplate<class T>\nbool TypedParameter<T>::isInstanceOf( const std::string &typeName ) const\n{\n\tif( typeName==staticTypeName() )\n\t{\n\t\treturn true;\n\t}\n\treturn Parameter::isInstanceOf( typeName );\n}\n\ntemplate<class T>\nbool TypedParameter<T>::inheritsFrom( TypeId typeId )\n{\n\treturn Parameter::staticTypeId()==typeId ? true : Parameter::inheritsFrom( typeId );\n}\n\ntemplate<class T>\nbool TypedParameter<T>::inheritsFrom( const std::string &typeName )\n{\n\treturn Parameter::staticTypeName()==typeName ? true : Parameter::inheritsFrom( typeName );\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ other stuff\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\t\t\t\t\t\n\ntemplate<typename T>\nbool TypedParameter<T>::valueValid( ConstObjectPtr value, std::string *reason ) const\n{\n\tif( !Parameter::valueValid( value, reason ) )\n\t{\n\t\treturn false;\n\t}\n\tConstObjectTypePtr tValue = runTimeCast<const ObjectType>( value );\n\tif( !tValue )\n\t{\n\t\tif( reason )\n\t\t{\n\t\t\t*reason = std::string( \"Value is not an instance of \\\"\" ) + ObjectType::staticTypeName() + \"\\\"\";\n\t\t}\n\t\treturn false;\n\t}\n\treturn true;\n}\n\ntemplate<typename T>\nconst typename TypedParameter<T>::ValueType &TypedParameter<T>::typedDefaultValue() const\n{\n\treturn boost::static_pointer_cast<const ObjectType>( defaultValue() )->readable();\n}\n\ntemplate<typename T>\ntypename TypedParameter<T>::ValueType &TypedParameter<T>::getTypedValue()\n{\n\tConstObjectTypePtr tValue = runTimeCast<const ObjectType>( getValue() );\n\tif( !tValue )\n\t{\n\t\tthrow Exception( std::string( \"Value is not an instance of \\\"\" ) + ObjectType::staticTypeName() + \"\\\"\");\n\t}\n\treturn boost::static_pointer_cast<ObjectType>( getValue() )->writable();\n}\n\ntemplate<typename T>\nconst typename TypedParameter<T>::ValueType &TypedParameter<T>::getTypedValue() const\n{\n\tConstObjectTypePtr tValue = runTimeCast<const ObjectType>( getValue() );\n\tif( !tValue )\n\t{\n\t\tthrow Exception( std::string( \"Value is not an instance of \\\"\" ) + ObjectType::staticTypeName() + \"\\\"\");\n\t}\n\treturn boost::static_pointer_cast<const ObjectType>( getValue() )->readable();\n}\n\t\t\ntemplate<typename T>\nvoid TypedParameter<T>::setTypedValue( const T &value )\n{\n\tsetValue( new ObjectType( value ) );\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ specialisation and template instantiation\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\t\n\n\n#define IE_CORE_DEFINETYPEDPARAMETERSPECIALISATION( T, TNAME )\t\t\t\t\t\t\\\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\\\n\ttemplate<>\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\\\n\tTypeId TypedParameter<T>::staticTypeId()\t\t\t\t\t\t\t\t\t\t\\\n\t{\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\\\n\t\treturn TNAME ## TypeId;\t\t\t\t\t\t\t\t\t\t\t\t\t\t\\\n\t}\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\\\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\\\n\ttemplate<>\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\\\n\tstd::string TypedParameter<T>::staticTypeName()\t\t\t\t\t\t\t\t\t\\\n\t{\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\\\n\t\treturn # TNAME;\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\\\n\t}\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\\\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\\\n\ttemplate class TypedParameter<T>;\n\n}\n\t\n#endif \/\/ IE_CORE_TYPEDPARAMETER_INL\n<|endoftext|>"} {"text":"<commit_before>#include \"EventSystem.hpp\"\n\n#include <algorithm>\n#include <type_traits>\n\nnamespace Kunlaboro\n{\n\n\tnamespace detail\n\t{\n\n\t\ttemplate<typename Event>\n\t\tstruct EventType\n\t\t{\n\t\t\tstd::function<void(const Event&)> Func;\n\t\t};\n\n\t\tstruct BaseComponentEvent : public EventSystem::BaseEvent\n\t\t{\n\t\t\tComponentId Component;\n\t\t};\n\t\ttemplate<typename Event>\n\t\tstruct ComponentEvent : public BaseComponentEvent, public EventType<Event>\n\t\t{ };\n\n\t\tstruct BaseLooseEvent : public EventSystem::BaseEvent\n\t\t{\n\t\t\tstd::size_t ID;\n\t\t};\n\t\ttemplate<typename Event>\n\t\tstruct LooseEvent : public BaseLooseEvent, public EventType<Event>\n\t\t{ };\n\n\t}\n\n\ttemplate<typename Event, typename Functor>\n\tvoid EventSystem::eventRegister(ComponentId cId, Functor&& func)\n\t{\n\t\tauto& list = mEvents[typeid(Event)];\n\n\t\tauto* ev = new detail::ComponentEvent<Event>();\n\t\tev->Component = cId;\n\t\tev->Func = std::move(func);\n\t\tev->Type = sComponentEvent;\n\n\t\tlist.push_back(ev);\n\t}\n\ttemplate<typename Event, typename Functor>\n\tstd::size_t EventSystem::eventRegister(Functor&& func)\n\t{\n\t\tauto& list = mEvents[typeid(Event)];\n\n\t\tauto* ev = new detail::LooseEvent<Event>();\n\t\tev->Func = std::move(func);\n\t\tev->ID = list.size();\n\t\tev->Type = sLooseEvent;\n\n\t\tlist.push_back(ev);\n\t\treturn ev->ID;\n\t}\n\ttemplate<typename Event>\n\tvoid EventSystem::eventUnregister(ComponentId cId)\n\t{\n\t\tauto& list = mEvents[typeid(Event)];\n\n\t\tauto it = std::find_if(list.cbegin(), list.cend(), [cId](const BaseEvent* ev) {\n\t\t\treturn ev->Type == sComponentEvent && static_cast<const detail::BaseComponentEvent*>(ev)->Component == cId;\n\t\t});\n\n\t\tif (it != list.cend())\n\t\t\tlist.erase(it);\n\t}\n\ttemplate<typename Event>\n\tvoid EventSystem::eventUnregister(std::size_t id)\n\t{\n\t\tauto& list = mEvents[typeid(Event)];\n\n\t\tauto it = std::find_if(list.cbegin(), list.cend(), [cId](const BaseEvent* ev) {\n\t\t\treturn ev->Type == sLooseEvent && static_cast<const detail::BaseLooseEvent*>(ev)->Component == cId;\n\t\t});\n\n\t\tif (it != list.cend())\n\t\t\tlist.erase(it);\n\t}\n\ttemplate<typename Event>\n\tvoid EventSystem::eventEmit(const Event& toSend) const\n\t{\n\t\tif (mEvents.count(typeid(Event)) == 0)\n\t\t\treturn;\n\n\t\tconst auto& list = mEvents.at(typeid(Event));\n\n\t\tfor (auto& ev : list)\n\t\t{\n\t\t\tif (ev->Type == sLooseEvent)\n\t\t\t\tstatic_cast<const detail::LooseEvent<Event>*>(ev)->Func(toSend);\n\t\t\telse\n\t\t\t\tstatic_cast<const detail::ComponentEvent<Event>*>(ev)->Func(toSend);\n\t\t}\n\t}\n\ttemplate<typename Event, typename... Args>\n\tvoid EventSystem::eventEmit(Args... args) const\n\t{\n\t\t\/\/ static_assert(std::is_trivial<Event>::value, \"Must be a POD type.\");\n\n\t\tEvent toSend{ std::forward<Args>(args)... };\n\t\teventEmit(toSend);\n\t}\n\n}<commit_msg>Pass along the correct ID to the lambda<commit_after>#include \"EventSystem.hpp\"\n\n#include <algorithm>\n#include <type_traits>\n\nnamespace Kunlaboro\n{\n\n\tnamespace detail\n\t{\n\n\t\ttemplate<typename Event>\n\t\tstruct EventType\n\t\t{\n\t\t\tstd::function<void(const Event&)> Func;\n\t\t};\n\n\t\tstruct BaseComponentEvent : public EventSystem::BaseEvent\n\t\t{\n\t\t\tComponentId Component;\n\t\t};\n\t\ttemplate<typename Event>\n\t\tstruct ComponentEvent : public BaseComponentEvent, public EventType<Event>\n\t\t{ };\n\n\t\tstruct BaseLooseEvent : public EventSystem::BaseEvent\n\t\t{\n\t\t\tstd::size_t ID;\n\t\t};\n\t\ttemplate<typename Event>\n\t\tstruct LooseEvent : public BaseLooseEvent, public EventType<Event>\n\t\t{ };\n\n\t}\n\n\ttemplate<typename Event, typename Functor>\n\tvoid EventSystem::eventRegister(ComponentId cId, Functor&& func)\n\t{\n\t\tauto& list = mEvents[typeid(Event)];\n\n\t\tauto* ev = new detail::ComponentEvent<Event>();\n\t\tev->Component = cId;\n\t\tev->Func = std::move(func);\n\t\tev->Type = sComponentEvent;\n\n\t\tlist.push_back(ev);\n\t}\n\ttemplate<typename Event, typename Functor>\n\tstd::size_t EventSystem::eventRegister(Functor&& func)\n\t{\n\t\tauto& list = mEvents[typeid(Event)];\n\n\t\tauto* ev = new detail::LooseEvent<Event>();\n\t\tev->Func = std::move(func);\n\t\tev->ID = list.size();\n\t\tev->Type = sLooseEvent;\n\n\t\tlist.push_back(ev);\n\t\treturn ev->ID;\n\t}\n\ttemplate<typename Event>\n\tvoid EventSystem::eventUnregister(ComponentId cId)\n\t{\n\t\tauto& list = mEvents[typeid(Event)];\n\n\t\tauto it = std::find_if(list.cbegin(), list.cend(), [cId](const BaseEvent* ev) {\n\t\t\treturn ev->Type == sComponentEvent && static_cast<const detail::BaseComponentEvent*>(ev)->Component == cId;\n\t\t});\n\n\t\tif (it != list.cend())\n\t\t\tlist.erase(it);\n\t}\n\ttemplate<typename Event>\n\tvoid EventSystem::eventUnregister(std::size_t id)\n\t{\n\t\tauto& list = mEvents[typeid(Event)];\n\n\t\tauto it = std::find_if(list.cbegin(), list.cend(), [id](const BaseEvent* ev) {\n\t\t\treturn ev->Type == sLooseEvent && static_cast<const detail::BaseLooseEvent*>(ev)->ID == id;\n\t\t});\n\n\t\tif (it != list.cend())\n\t\t\tlist.erase(it);\n\t}\n\ttemplate<typename Event>\n\tvoid EventSystem::eventEmit(const Event& toSend) const\n\t{\n\t\tif (mEvents.count(typeid(Event)) == 0)\n\t\t\treturn;\n\n\t\tconst auto& list = mEvents.at(typeid(Event));\n\n\t\tfor (auto& ev : list)\n\t\t{\n\t\t\tif (ev->Type == sLooseEvent)\n\t\t\t\tstatic_cast<const detail::LooseEvent<Event>*>(ev)->Func(toSend);\n\t\t\telse\n\t\t\t\tstatic_cast<const detail::ComponentEvent<Event>*>(ev)->Func(toSend);\n\t\t}\n\t}\n\ttemplate<typename Event, typename... Args>\n\tvoid EventSystem::eventEmit(Args... args) const\n\t{\n\t\t\/\/ static_assert(std::is_trivial<Event>::value, \"Must be a POD type.\");\n\n\t\tEvent toSend{ std::forward<Args>(args)... };\n\t\teventEmit(toSend);\n\t}\n\n}<|endoftext|>"} {"text":"<commit_before>\/\/ Copyright (C) 2015 Jérôme Leclercq\n\/\/ This file is part of the \"Nazara Engine - Graphics module\"\n\/\/ For conditions of distribution and use, see copyright notice in Config.hpp\n\n#include <memory>\n#include <Nazara\/Renderer\/Debug.hpp>\n\ntemplate<typename... Args>\nNzModelRef NzModel::New(Args&&... args)\n{\n\tstd::unique_ptr<NzModel> object(new NzModel(std::forward<Args>(args)...));\n\tobject->SetPersistent(false);\n\n\treturn object.release();\n}\n\n#include <Nazara\/Renderer\/DebugOff.hpp>\n<commit_msg>Graphics\/Model: Fix includes<commit_after>\/\/ Copyright (C) 2015 Jérôme Leclercq\n\/\/ This file is part of the \"Nazara Engine - Graphics module\"\n\/\/ For conditions of distribution and use, see copyright notice in Config.hpp\n\n#include <memory>\n#include <Nazara\/Graphics\/Debug.hpp>\n\ntemplate<typename... Args>\nNzModelRef NzModel::New(Args&&... args)\n{\n\tstd::unique_ptr<NzModel> object(new NzModel(std::forward<Args>(args)...));\n\tobject->SetPersistent(false);\n\n\treturn object.release();\n}\n\n#include <Nazara\/Graphics\/DebugOff.hpp>\n<|endoftext|>"} {"text":"<commit_before>#ifndef ALEPH_UTILITIES_STRING_HH__\n#define ALEPH_UTILITIES_STRING_HH__\n\n#include <algorithm>\n#include <limits>\n#include <regex>\n#include <sstream>\n#include <string>\n#include <vector>\n\n#include <cctype>\n\nnamespace aleph\n{\n\nnamespace utilities\n{\n\ntemplate <class T> T ltrim( T sequence )\n{\n sequence.erase( sequence.begin(),\n std::find_if_not( sequence.begin(), sequence.end(),\n [] ( const typename T::value_type& c )\n {\n return std::isspace( c );\n } ) );\n\n return sequence;\n}\n\ntemplate <class T> T rtrim( T sequence )\n{\n sequence.erase( std::find_if_not( sequence.rbegin(), sequence.rend(),\n [] ( const typename T::value_type& c )\n {\n return std::isspace( c );\n } ).base(),\n sequence.end() );\n\n return sequence;\n}\n\ntemplate <class T> T trim( T sequence )\n{\n return ltrim( rtrim( sequence ) );\n}\n\ntemplate <class T> std::vector<T> split( const T& sequence,\n const T& regex = \"[[:space:]]+\" )\n{\n std::regex re( regex );\n std::sregex_token_iterator begin( sequence.begin(), sequence.end(), re, -1 );\n std::sregex_token_iterator end;\n\n return { begin, end };\n}\n\n\/**\n Attempts to convert a sequence type `S` to a non-sequence type `T` by\n using `std::stringstream`. This makes converting strings to different\n types such as numbers easier.\n\n @tparam S Sequence type (e.g. `std::string`)\n @tparam T Non-sequence type (e.g. `ìnt`)\n\n @param sequence Sequence to convert\n @param success Flag indicating the success of the conversion\n\n @returns Result of the conversion. Errors do *not* result in an error\n being thrown. Use the \\p success parameter to check for errors.\n*\/\n\ntemplate <class T, class S> T convert( const S& sequence, bool& success )\n{\n T result = T();\n success = false;\n\n std::istringstream converter( sequence );\n converter >> result;\n\n \/\/ Try some special handling for some special tokens. Other errors are\n \/\/ silently ignored. I am not sure whether this is the right behaviour\n \/\/ but I see no pressing reason to change it now.\n if( converter.fail() )\n {\n std::string string = sequence;\n\n std::transform( string.begin(), string.end(),\n string.begin(), ::tolower );\n\n if( string == \"+inf\" || string == \"inf\" || string == \"+infinity\" || string == \"infinity\" )\n result = std::numeric_limits<T>::infinity();\n else if ( string == \"-inf\" || string == \"-infinity\" )\n result = -std::numeric_limits<T>::infinity();\n else if( string == \"nan\" )\n result = std::numeric_limits<T>::quiet_NaN();\n\n success = result != T();\n }\n else\n success = true;\n\n return result;\n\n}\n\n\/** @overload convert() *\/\ntemplate <class T, class S> T convert( const S& sequence )\n{\n bool success = false;\n return convert<T>( sequence, success );\n}\n\n} \/\/ namespace utilities\n\n} \/\/ namespace aleph\n\n#endif\n<commit_msg>Improved function for tokenizing a string<commit_after>#ifndef ALEPH_UTILITIES_STRING_HH__\n#define ALEPH_UTILITIES_STRING_HH__\n\n#include <algorithm>\n#include <limits>\n#include <regex>\n#include <sstream>\n#include <string>\n#include <vector>\n\n#include <cctype>\n\nnamespace aleph\n{\n\nnamespace utilities\n{\n\ntemplate <class T> T ltrim( T sequence )\n{\n sequence.erase( sequence.begin(),\n std::find_if_not( sequence.begin(), sequence.end(),\n [] ( const typename T::value_type& c )\n {\n return std::isspace( c );\n } ) );\n\n return sequence;\n}\n\ntemplate <class T> T rtrim( T sequence )\n{\n sequence.erase( std::find_if_not( sequence.rbegin(), sequence.rend(),\n [] ( const typename T::value_type& c )\n {\n return std::isspace( c );\n } ).base(),\n sequence.end() );\n\n return sequence;\n}\n\ntemplate <class T> T trim( T sequence )\n{\n return ltrim( rtrim( sequence ) );\n}\n\ntemplate <class T> std::vector<T> split( const T& sequence,\n const T& regex = \"[[:space:]]+\" )\n{\n std::regex re( regex );\n std::sregex_token_iterator begin( sequence.begin(), sequence.end(), re, -1 );\n std::sregex_token_iterator end;\n\n return { begin, end };\n}\n\n\/**\n This is a variant for tokenizing a string according to whitespace\n characters. It is more efficient but less generic than `split()`,\n which permits the use of arbitrary regular expressions.\n*\/\n\ntemplate <class T> std::vector<T> splitByWhitespace( const T& sequence )\n{\n std::vector<T> tokens;\n\n std::istringstream iss( sequence );\n\n std::copy( std::istream_iterator<T>( iss ),\n std::istream_iterator<T>(),\n std::back_inserter( tokens ) );\n\n return tokens;\n}\n\n\/**\n Attempts to convert a sequence type `S` to a non-sequence type `T` by\n using `std::stringstream`. This makes converting strings to different\n types such as numbers easier.\n\n @tparam S Sequence type (e.g. `std::string`)\n @tparam T Non-sequence type (e.g. `ìnt`)\n\n @param sequence Sequence to convert\n @param success Flag indicating the success of the conversion\n\n @returns Result of the conversion. Errors do *not* result in an error\n being thrown. Use the \\p success parameter to check for errors.\n*\/\n\ntemplate <class T, class S> T convert( const S& sequence, bool& success )\n{\n T result = T();\n success = false;\n\n std::istringstream converter( sequence );\n converter >> result;\n\n \/\/ Try some special handling for some special tokens. Other errors are\n \/\/ silently ignored. I am not sure whether this is the right behaviour\n \/\/ but I see no pressing reason to change it now.\n if( converter.fail() )\n {\n std::string string = sequence;\n\n std::transform( string.begin(), string.end(),\n string.begin(), ::tolower );\n\n if( string == \"+inf\" || string == \"inf\" || string == \"+infinity\" || string == \"infinity\" )\n result = std::numeric_limits<T>::infinity();\n else if ( string == \"-inf\" || string == \"-infinity\" )\n result = -std::numeric_limits<T>::infinity();\n else if( string == \"nan\" )\n result = std::numeric_limits<T>::quiet_NaN();\n\n success = result != T();\n }\n else\n success = true;\n\n return result;\n\n}\n\n\/** @overload convert() *\/\ntemplate <class T, class S> T convert( const S& sequence )\n{\n bool success = false;\n return convert<T>( sequence, success );\n}\n\n} \/\/ namespace utilities\n\n} \/\/ namespace aleph\n\n#endif\n<|endoftext|>"} {"text":"<commit_before>#ifndef _IZENELIB_AM_SUCCINCT_CONSTANTS_HPP\n#define _IZENELIB_AM_SUCCINCT_CONSTANTS_HPP\n\n#include <types.h>\n\nNS_IZENELIB_AM_BEGIN\n\nnamespace succinct\n{\n\n#ifndef UINT8_MAX\n#define UINT8_MAX (255U)\n#endif\n\n\/* Defined by BSIZE *\/\ntypedef uint64_t block_t;\n\n\/* Block size (64-bit environment) *\/\nstatic const size_t BSIZE = 64;\nstatic const size_t PRESUM_SZ = 128;\nstatic const size_t CACHELINE_SZ = 256;\nstatic const size_t LEVEL1_NUM = 256;\nstatic const size_t LEVEL2_NUM = BSIZE;\n\nstatic const size_t kLargeBlockSize = 1024;\nstatic const size_t kSuperBlockSize = 256;\nstatic const size_t kBlockSize = 64;\nstatic const size_t kSelectBlockSize = 2048;\nstatic const size_t kBlockPerLargeBlock = kLargeBlockSize \/ kBlockSize;\nstatic const size_t kBlockPerSuperBlock = kSuperBlockSize \/ kBlockSize;\n\n}\n\nNS_IZENELIB_AM_END\n\n#endif\n<commit_msg>decrease rank\/select sample rate of RSDic<commit_after>#ifndef _IZENELIB_AM_SUCCINCT_CONSTANTS_HPP\n#define _IZENELIB_AM_SUCCINCT_CONSTANTS_HPP\n\n#include <types.h>\n\nNS_IZENELIB_AM_BEGIN\n\nnamespace succinct\n{\n\n#ifndef UINT8_MAX\n#define UINT8_MAX (255U)\n#endif\n\n\/* Defined by BSIZE *\/\ntypedef uint64_t block_t;\n\n\/* Block size (64-bit environment) *\/\nstatic const size_t BSIZE = 64;\nstatic const size_t PRESUM_SZ = 128;\nstatic const size_t CACHELINE_SZ = 256;\nstatic const size_t LEVEL1_NUM = 256;\nstatic const size_t LEVEL2_NUM = BSIZE;\n\nstatic const size_t kLargeBlockSize = 2048;\nstatic const size_t kSuperBlockSize = 256;\nstatic const size_t kBlockSize = 64;\nstatic const size_t kSelectBlockSize = 4096;\nstatic const size_t kBlockPerLargeBlock = kLargeBlockSize \/ kBlockSize;\nstatic const size_t kBlockPerSuperBlock = kSuperBlockSize \/ kBlockSize;\n\n}\n\nNS_IZENELIB_AM_END\n\n#endif\n<|endoftext|>"} {"text":"<commit_before>\/\/=======================================================================\n\/\/ Copyright Baptiste Wicht 2013-2014.\n\/\/ Distributed under the Boost Software License, Version 1.0.\n\/\/ (See accompanying file LICENSE_1_0.txt or copy at\n\/\/ http:\/\/www.boost.org\/LICENSE_1_0.txt)\n\/\/=======================================================================\n\n#ifndef CIRCULAR_BUFFER_H\n#define CIRCULAR_BUFFER_H\n\ntemplate<typename T, size_t S>\nstruct circular_buffer {\nprivate:\n static constexpr const size_t Size = S + 1;\n\n T buffer[Size];\n\n volatile size_t start;\n volatile size_t end;\n\npublic:\n circular_buffer() : start(0), end(0) {\n \/\/Nothing to init\n }\n\n bool full() const {\n return (end + 1) % Size == start;\n }\n\n bool empty() const {\n return end == start;\n }\n\n bool push(T value){\n if(full()){\n return false;\n } else {\n buffer[end] = value;\n end = (end + 1) % Size;\n\n return true;\n }\n }\n\n T pop(){\n auto value = buffer[start];\n start = (start + 1) % Size;\n return value;\n }\n};\n\n#endif\n<commit_msg>Add top() function<commit_after>\/\/=======================================================================\n\/\/ Copyright Baptiste Wicht 2013-2014.\n\/\/ Distributed under the Boost Software License, Version 1.0.\n\/\/ (See accompanying file LICENSE_1_0.txt or copy at\n\/\/ http:\/\/www.boost.org\/LICENSE_1_0.txt)\n\/\/=======================================================================\n\n#ifndef CIRCULAR_BUFFER_H\n#define CIRCULAR_BUFFER_H\n\ntemplate<typename T, size_t S>\nstruct circular_buffer {\nprivate:\n static constexpr const size_t Size = S + 1;\n\n T buffer[Size];\n\n volatile size_t start;\n volatile size_t end;\n\npublic:\n circular_buffer() : start(0), end(0) {\n \/\/Nothing to init\n }\n\n bool full() const {\n return (end + 1) % Size == start;\n }\n\n bool empty() const {\n return end == start;\n }\n\n bool push(T value){\n if(full()){\n return false;\n } else {\n buffer[end] = value;\n end = (end + 1) % Size;\n\n return true;\n }\n }\n\n T top() const {\n return buffer[start];\n }\n\n T pop(){\n auto value = buffer[start];\n start = (start + 1) % Size;\n return value;\n }\n};\n\n#endif\n<|endoftext|>"} {"text":"<commit_before>#ifndef KGR_INCLUDE_KANGARU_DETAIL_TRAITS_HPP\n#define KGR_INCLUDE_KANGARU_DETAIL_TRAITS_HPP\n\n#include \"function_traits.hpp\"\n#include \"utils.hpp\"\n\n#include <type_traits>\n#include <tuple>\n\nnamespace kgr {\nnamespace detail {\n\n\/\/ void_t implementation\ntemplate<typename...>\nstruct voider { using type = void; };\n\ntemplate<typename... Ts> using void_t = typename voider<Ts...>::type;\n\n\/\/ things missing from c++11 (to be removed when switching to c++14)\ntemplate <bool b, typename T = void>\nusing enable_if_t = typename std::enable_if<b, T>::type;\n\ntemplate<typename T>\nusing decay_t = typename std::decay<T>::type;\n\ntemplate<std::size_t S, typename T>\nusing tuple_element_t = typename std::tuple_element<S, T>::type;\n\ntemplate<std::size_t ...>\nstruct seq {};\n\ntemplate<std::size_t n, std::size_t ...S>\nstruct seq_gen : seq_gen<n-1, n-1, S...> {};\n\ntemplate<std::size_t ...S>\nstruct seq_gen<0, S...> {\n\tusing type = seq<S...>;\n};\n\ntemplate<typename Tuple>\nstruct TupleSeqGen : seq_gen<std::tuple_size<Tuple>::value> {};\n\ntemplate<>\nstruct TupleSeqGen<std::tuple<>> : seq_gen<0> {};\n\ntemplate<typename Tuple>\nusing tuple_seq = typename TupleSeqGen<Tuple>::type;\n\ntemplate<typename Tuple, int n>\nusing tuple_seq_minus = typename detail::seq_gen<std::tuple_size<Tuple>::value - (n > std::tuple_size<Tuple>::value ? std::tuple_size<Tuple>::value : n)>::type;\n\n\/\/ SFINAE utilities\ntemplate<typename T, typename = void>\nstruct has_invoke : std::false_type {};\n\ntemplate<typename T>\nstruct has_invoke<T, void_t<typename T::invoke>> : std::true_type {};\n\ntemplate<typename T, typename = void>\nstruct has_next : std::false_type {};\n\ntemplate<typename T>\nstruct has_next<T, void_t<typename T::Next>> : std::true_type {};\n\ntemplate<typename T, typename = void>\nstruct has_forward : std::false_type {};\n\ntemplate<typename T>\nstruct has_forward<T, void_t<decltype(std::declval<T>().forward())>> : std::true_type {};\n\ntemplate<typename T, typename = void>\nstruct is_service : std::false_type {};\n\ntemplate<typename T>\nstruct is_service<T, enable_if_t<(!std::is_polymorphic<T>::value || std::is_abstract<T>::value) && has_forward<T>::value>> : std::true_type {};\n\ntemplate<typename T, typename = void>\nstruct has_construct : std::false_type {};\n\ntemplate<typename T>\nstruct has_construct<T, void_t<decltype(&T::construct)>> : std::true_type {};\n\ntemplate<typename T, typename = void>\nstruct is_invoke_call : std::false_type {};\n\ntemplate<typename T>\nstruct is_invoke_call<T, void_t<typename T::Params>> : std::true_type {};\n\ntemplate<template<typename> class Map, typename T, typename = void>\nstruct is_complete_map : std::false_type {};\n\ntemplate<template<typename> class Map, typename T>\nstruct is_complete_map<Map, T, void_t<typename Map<T>::Service>> : std::true_type {};\n\ntemplate<typename T, typename... Args>\nstruct is_brace_constructible_helper {\nprivate:\n\ttemplate<typename U, typename... As>\n\tstatic decltype(static_cast<void>(U{std::declval<As>()...}), std::true_type{}) test(int);\n\n\ttemplate<typename...>\n\tstatic std::false_type test(...);\n\t\npublic:\n\tusing type = decltype(test<T, Args...>(0));\n};\n\ntemplate<typename T, typename... Args>\nstruct has_template_construct_helper {\nprivate:\n\ttemplate<typename U, typename... As>\n\tstatic std::true_type test(decltype(&U::template construct<As...>)* = nullptr);\n\n\ttemplate<typename...>\n\tstatic std::false_type test(...);\n\t\npublic:\n\tusing type = decltype(test<T, Args...>(nullptr));\n};\n\ntemplate<typename T, typename... Args>\nstruct has_emplace_helper {\nprivate:\n\ttemplate<typename U, typename... As>\n\tstatic decltype(static_cast<void>(std::declval<U>().emplace(std::declval<As>()...)), std::true_type{}) test(int);\n\t\n\ttemplate<typename U, typename... As>\n\tstatic std::false_type test(...);\n\t\npublic:\n\tusing type = decltype(test<T, Args...>(0));\n};\n\ntemplate<template<typename> class, typename, typename, typename...>\nstruct is_invokable_helper;\n\ntemplate<template<typename> class Map, typename T, typename... Args, std::size_t... S>\nstruct is_invokable_helper<Map, T, seq<S...>, Args...> {\nprivate:\n\ttemplate<typename U, typename... As>\n\tstatic decltype(\n\t\tstatic_cast<void>(std::declval<U>()(std::declval<ServiceType<service_map_t<Map, function_argument_t<S, decay_t<U>>>>>()..., std::declval<As>()...)),\n\t\tstd::true_type{}\n\t) test(int);\n\t\n\ttemplate<typename U, typename... As>\n\tstatic std::false_type test(...);\n\t\npublic:\n\tusing type = decltype(test<T, Args...>(0));\n};\n\ntemplate<typename T, typename... Args>\nstruct has_emplace : has_emplace_helper<T, Args...>::type {};\n\ntemplate<typename T, typename... Args>\nstruct is_brace_constructible : is_brace_constructible_helper<T, Args...>::type {};\n\ntemplate<typename T> struct remove_rvalue_reference { using type = T; };\ntemplate<typename T> struct remove_rvalue_reference<T&> { using type = T&; };\ntemplate<typename T> struct remove_rvalue_reference<T&&> { using type = T; };\n\ntemplate<typename T> using remove_rvalue_reference_t = typename remove_rvalue_reference<T>::type;\n\ntemplate<typename... Ts>\nstruct has_template_construct : has_template_construct_helper<Ts...>::type {};\n\ntemplate<typename... Ts>\nusing is_someway_constructible = std::integral_constant<bool, is_brace_constructible<Ts...>::value || std::is_constructible<Ts...>::value>;\n\ntemplate<typename T, typename... Args>\nusing is_emplaceable = typename std::conditional<std::is_default_constructible<T>::value && has_emplace<T, Args...>::value, std::true_type, std::false_type>::type;\n\ntemplate<template<typename> class Map, typename U, typename... Args>\nstruct is_invokable : is_invokable_helper<Map, U, tuple_seq_minus<function_arguments_t<U>, sizeof...(Args)>, Args...>::type {};\n\n} \/\/ namespace detail\n} \/\/ namespace kgr\n\n#endif \/\/ KGR_INCLUDE_KANGARU_DETAIL_TRAITS_HPP\n<commit_msg>removed useless decay<commit_after>#ifndef KGR_INCLUDE_KANGARU_DETAIL_TRAITS_HPP\n#define KGR_INCLUDE_KANGARU_DETAIL_TRAITS_HPP\n\n#include \"function_traits.hpp\"\n#include \"utils.hpp\"\n\n#include <type_traits>\n#include <tuple>\n\nnamespace kgr {\nnamespace detail {\n\n\/\/ void_t implementation\ntemplate<typename...>\nstruct voider { using type = void; };\n\ntemplate<typename... Ts> using void_t = typename voider<Ts...>::type;\n\n\/\/ things missing from c++11 (to be removed when switching to c++14)\ntemplate <bool b, typename T = void>\nusing enable_if_t = typename std::enable_if<b, T>::type;\n\ntemplate<typename T>\nusing decay_t = typename std::decay<T>::type;\n\ntemplate<std::size_t S, typename T>\nusing tuple_element_t = typename std::tuple_element<S, T>::type;\n\ntemplate<std::size_t ...>\nstruct seq {};\n\ntemplate<std::size_t n, std::size_t ...S>\nstruct seq_gen : seq_gen<n-1, n-1, S...> {};\n\ntemplate<std::size_t ...S>\nstruct seq_gen<0, S...> {\n\tusing type = seq<S...>;\n};\n\ntemplate<typename Tuple>\nstruct TupleSeqGen : seq_gen<std::tuple_size<Tuple>::value> {};\n\ntemplate<>\nstruct TupleSeqGen<std::tuple<>> : seq_gen<0> {};\n\ntemplate<typename Tuple>\nusing tuple_seq = typename TupleSeqGen<Tuple>::type;\n\ntemplate<typename Tuple, int n>\nusing tuple_seq_minus = typename detail::seq_gen<std::tuple_size<Tuple>::value - (n > std::tuple_size<Tuple>::value ? std::tuple_size<Tuple>::value : n)>::type;\n\n\/\/ SFINAE utilities\ntemplate<typename T, typename = void>\nstruct has_invoke : std::false_type {};\n\ntemplate<typename T>\nstruct has_invoke<T, void_t<typename T::invoke>> : std::true_type {};\n\ntemplate<typename T, typename = void>\nstruct has_next : std::false_type {};\n\ntemplate<typename T>\nstruct has_next<T, void_t<typename T::Next>> : std::true_type {};\n\ntemplate<typename T, typename = void>\nstruct has_forward : std::false_type {};\n\ntemplate<typename T>\nstruct has_forward<T, void_t<decltype(std::declval<T>().forward())>> : std::true_type {};\n\ntemplate<typename T, typename = void>\nstruct is_service : std::false_type {};\n\ntemplate<typename T>\nstruct is_service<T, enable_if_t<(!std::is_polymorphic<T>::value || std::is_abstract<T>::value) && has_forward<T>::value>> : std::true_type {};\n\ntemplate<typename T, typename = void>\nstruct has_construct : std::false_type {};\n\ntemplate<typename T>\nstruct has_construct<T, void_t<decltype(&T::construct)>> : std::true_type {};\n\ntemplate<typename T, typename = void>\nstruct is_invoke_call : std::false_type {};\n\ntemplate<typename T>\nstruct is_invoke_call<T, void_t<typename T::Params>> : std::true_type {};\n\ntemplate<template<typename> class Map, typename T, typename = void>\nstruct is_complete_map : std::false_type {};\n\ntemplate<template<typename> class Map, typename T>\nstruct is_complete_map<Map, T, void_t<typename Map<T>::Service>> : std::true_type {};\n\ntemplate<typename T, typename... Args>\nstruct is_brace_constructible_helper {\nprivate:\n\ttemplate<typename U, typename... As>\n\tstatic decltype(static_cast<void>(U{std::declval<As>()...}), std::true_type{}) test(int);\n\n\ttemplate<typename...>\n\tstatic std::false_type test(...);\n\t\npublic:\n\tusing type = decltype(test<T, Args...>(0));\n};\n\ntemplate<typename T, typename... Args>\nstruct has_template_construct_helper {\nprivate:\n\ttemplate<typename U, typename... As>\n\tstatic std::true_type test(decltype(&U::template construct<As...>)* = nullptr);\n\n\ttemplate<typename...>\n\tstatic std::false_type test(...);\n\t\npublic:\n\tusing type = decltype(test<T, Args...>(nullptr));\n};\n\ntemplate<typename T, typename... Args>\nstruct has_emplace_helper {\nprivate:\n\ttemplate<typename U, typename... As>\n\tstatic decltype(static_cast<void>(std::declval<U>().emplace(std::declval<As>()...)), std::true_type{}) test(int);\n\t\n\ttemplate<typename U, typename... As>\n\tstatic std::false_type test(...);\n\t\npublic:\n\tusing type = decltype(test<T, Args...>(0));\n};\n\ntemplate<template<typename> class, typename, typename, typename...>\nstruct is_invokable_helper;\n\ntemplate<template<typename> class Map, typename T, typename... Args, std::size_t... S>\nstruct is_invokable_helper<Map, T, seq<S...>, Args...> {\nprivate:\n\ttemplate<typename U, typename... As>\n\tstatic decltype(\n\t\tstatic_cast<void>(std::declval<U>()(std::declval<ServiceType<service_map_t<Map, function_argument_t<S, U>>>>()..., std::declval<As>()...)),\n\t\tstd::true_type{}\n\t) test(int);\n\t\n\ttemplate<typename U, typename... As>\n\tstatic std::false_type test(...);\n\t\npublic:\n\tusing type = decltype(test<T, Args...>(0));\n};\n\ntemplate<typename T, typename... Args>\nstruct has_emplace : has_emplace_helper<T, Args...>::type {};\n\ntemplate<typename T, typename... Args>\nstruct is_brace_constructible : is_brace_constructible_helper<T, Args...>::type {};\n\ntemplate<typename T> struct remove_rvalue_reference { using type = T; };\ntemplate<typename T> struct remove_rvalue_reference<T&> { using type = T&; };\ntemplate<typename T> struct remove_rvalue_reference<T&&> { using type = T; };\n\ntemplate<typename T> using remove_rvalue_reference_t = typename remove_rvalue_reference<T>::type;\n\ntemplate<typename... Ts>\nstruct has_template_construct : has_template_construct_helper<Ts...>::type {};\n\ntemplate<typename... Ts>\nusing is_someway_constructible = std::integral_constant<bool, is_brace_constructible<Ts...>::value || std::is_constructible<Ts...>::value>;\n\ntemplate<typename T, typename... Args>\nusing is_emplaceable = typename std::conditional<std::is_default_constructible<T>::value && has_emplace<T, Args...>::value, std::true_type, std::false_type>::type;\n\ntemplate<template<typename> class Map, typename U, typename... Args>\nstruct is_invokable : is_invokable_helper<Map, U, tuple_seq_minus<function_arguments_t<U>, sizeof...(Args)>, Args...>::type {};\n\n} \/\/ namespace detail\n} \/\/ namespace kgr\n\n#endif \/\/ KGR_INCLUDE_KANGARU_DETAIL_TRAITS_HPP\n<|endoftext|>"} {"text":"<commit_before>\/*****************************************************************************\n *\n * This file is part of Mapnik (c++ mapping toolkit)\n *\n * Copyright (C) 2014 Artem Pavlenko\n *\n * This library is free software; you can redistribute it and\/or\n * modify it under the terms of the GNU Lesser General Public\n * License as published by the Free Software Foundation; either\n * version 2.1 of the License, or (at your option) any later version.\n *\n * This library is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU\n * Lesser General Public License for more details.\n *\n * You should have received a copy of the GNU Lesser General Public\n * License along with this library; if not, write to the Free Software\n * Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA\n *\n *****************************************************************************\/\n\n#ifndef MAPNIK_MARKER_HELPERS_HPP\n#define MAPNIK_MARKER_HELPERS_HPP\n\n#include <mapnik\/color.hpp>\n#include <mapnik\/feature.hpp>\n#include <mapnik\/geometry.hpp>\n#include <mapnik\/geometry_type.hpp>\n#include <mapnik\/geometry_centroid.hpp>\n#include <mapnik\/symbolizer.hpp>\n#include <mapnik\/expression_node.hpp>\n#include <mapnik\/expression_evaluator.hpp>\n#include <mapnik\/svg\/svg_path_attributes.hpp>\n#include <mapnik\/svg\/svg_converter.hpp>\n#include <mapnik\/marker.hpp> \/\/ for svg_storage_type\n#include <mapnik\/markers_placement.hpp>\n#include <mapnik\/attribute.hpp>\n#include <mapnik\/box2d.hpp>\n#include <mapnik\/vertex_converters.hpp>\n#include <mapnik\/vertex_processor.hpp>\n#include <mapnik\/label_collision_detector.hpp>\n#include <mapnik\/renderer_common\/apply_vertex_converter.hpp>\n\n\/\/ agg\n#include \"agg_trans_affine.h\"\n\n\/\/ boost\n#include <boost\/optional.hpp>\n\/\/ stl\n#include <memory>\n#include <type_traits> \/\/ remove_reference\n#include <cmath>\n\nnamespace mapnik {\n\nstruct clip_poly_tag;\n\nusing svg_attribute_type = agg::pod_bvector<svg::path_attributes>;\n\ntemplate <typename Detector>\nstruct vector_markers_dispatch : util::noncopyable\n{\n vector_markers_dispatch(svg_path_ptr const& src,\n agg::trans_affine const& marker_trans,\n symbolizer_base const& sym,\n Detector & detector,\n double scale_factor,\n feature_impl & feature,\n attributes const& vars)\n : src_(src),\n marker_trans_(marker_trans),\n sym_(sym),\n detector_(detector),\n feature_(feature),\n vars_(vars),\n scale_factor_(scale_factor)\n {}\n\n virtual ~vector_markers_dispatch() {}\n\n template <typename T>\n void add_path(T & path)\n {\n marker_placement_enum placement_method = get<marker_placement_enum, keys::markers_placement_type>(sym_, feature_, vars_);\n value_bool ignore_placement = get<value_bool, keys::ignore_placement>(sym_, feature_, vars_);\n value_bool allow_overlap = get<value_bool, keys::allow_overlap>(sym_, feature_, vars_);\n value_bool avoid_edges = get<value_bool, keys::avoid_edges>(sym_, feature_, vars_);\n value_double opacity = get<value_double,keys::opacity>(sym_, feature_, vars_);\n value_double spacing = get<value_double, keys::spacing>(sym_, feature_, vars_);\n value_double max_error = get<value_double, keys::max_error>(sym_, feature_, vars_);\n coord2d center = src_->bounding_box().center();\n agg::trans_affine_translation recenter(-center.x, -center.y);\n agg::trans_affine tr = recenter * marker_trans_;\n direction_enum direction = get<direction_enum, keys::direction>(sym_, feature_, vars_);\n markers_placement_params params { src_->bounding_box(), tr, spacing * scale_factor_, max_error, allow_overlap, avoid_edges, direction };\n markers_placement_finder<T, Detector> placement_finder(\n placement_method, path, detector_, params);\n double x, y, angle = .0;\n while (placement_finder.get_point(x, y, angle, ignore_placement))\n {\n agg::trans_affine matrix = tr;\n matrix.rotate(angle);\n matrix.translate(x, y);\n render_marker(matrix, opacity);\n }\n }\n\n virtual void render_marker(agg::trans_affine const& marker_tr, double opacity) = 0;\n\nprotected:\n svg_path_ptr const& src_;\n agg::trans_affine const& marker_trans_;\n symbolizer_base const& sym_;\n Detector & detector_;\n feature_impl & feature_;\n attributes const& vars_;\n double scale_factor_;\n};\n\ntemplate <typename Detector>\nstruct raster_markers_dispatch : util::noncopyable\n{\n raster_markers_dispatch(image_rgba8 const& src,\n agg::trans_affine const& marker_trans,\n symbolizer_base const& sym,\n Detector & detector,\n double scale_factor,\n feature_impl & feature,\n attributes const& vars)\n : src_(src),\n marker_trans_(marker_trans),\n sym_(sym),\n detector_(detector),\n feature_(feature),\n vars_(vars),\n scale_factor_(scale_factor)\n {}\n\n virtual ~raster_markers_dispatch() {}\n\n template <typename T>\n void add_path(T & path)\n {\n marker_placement_enum placement_method = get<marker_placement_enum, keys::markers_placement_type>(sym_, feature_, vars_);\n value_bool allow_overlap = get<value_bool, keys::allow_overlap>(sym_, feature_, vars_);\n value_bool avoid_edges = get<value_bool, keys::avoid_edges>(sym_, feature_, vars_);\n value_double opacity = get<value_double, keys::opacity>(sym_, feature_, vars_);\n value_bool ignore_placement = get<value_bool, keys::ignore_placement>(sym_, feature_, vars_);\n value_double spacing = get<value_double, keys::spacing>(sym_, feature_, vars_);\n value_double max_error = get<value_double, keys::max_error>(sym_, feature_, vars_);\n box2d<double> bbox(0,0, src_.width(),src_.height());\n direction_enum direction = get<direction_enum, keys::direction>(sym_, feature_, vars_);\n markers_placement_params params { bbox, marker_trans_, spacing * scale_factor_, max_error, allow_overlap, avoid_edges, direction };\n markers_placement_finder<T, label_collision_detector4> placement_finder(\n placement_method, path, detector_, params);\n double x, y, angle = .0;\n while (placement_finder.get_point(x, y, angle, ignore_placement))\n {\n agg::trans_affine matrix = marker_trans_;\n matrix.rotate(angle);\n matrix.translate(x, y);\n render_marker(matrix, opacity);\n }\n }\n\n virtual void render_marker(agg::trans_affine const& marker_tr, double opacity) = 0;\n\nprotected:\n image_rgba8 const& src_;\n agg::trans_affine const& marker_trans_;\n symbolizer_base const& sym_;\n Detector & detector_;\n feature_impl & feature_;\n attributes const& vars_;\n double scale_factor_;\n};\n\nvoid build_ellipse(symbolizer_base const& sym, mapnik::feature_impl & feature, attributes const& vars,\n svg_storage_type & marker_ellipse, svg::svg_path_adapter & svg_path);\n\nbool push_explicit_style(svg_attribute_type const& src,\n svg_attribute_type & dst,\n symbolizer_base const& sym,\n feature_impl & feature,\n attributes const& vars);\n\nvoid setup_transform_scaling(agg::trans_affine & tr,\n double svg_width,\n double svg_height,\n mapnik::feature_impl & feature,\n attributes const& vars,\n symbolizer_base const& sym);\n\n\/\/ Apply markers to a feature with multiple geometries\ntemplate <typename Converter>\nvoid apply_markers_multi(feature_impl const& feature, attributes const& vars, Converter & converter, symbolizer_base const& sym)\n{\n using vertex_converter_type = Converter;\n using apply_vertex_converter_type = detail::apply_vertex_converter<vertex_converter_type>;\n using vertex_processor_type = geometry::vertex_processor<apply_vertex_converter_type>;\n\n auto const& geom = feature.get_geometry();\n geometry::geometry_types type = geometry::geometry_type(geom);\n\n if (type == geometry::geometry_types::Point\n || type == geometry::geometry_types::LineString\n || type == geometry::geometry_types::Polygon)\n {\n apply_vertex_converter_type apply(converter);\n mapnik::util::apply_visitor(vertex_processor_type(apply), geom);\n }\n else\n {\n\n marker_multi_policy_enum multi_policy = get<marker_multi_policy_enum, keys::markers_multipolicy>(sym, feature, vars);\n marker_placement_enum placement = get<marker_placement_enum, keys::markers_placement_type>(sym, feature, vars);\n\n if (placement == MARKER_POINT_PLACEMENT &&\n multi_policy == MARKER_WHOLE_MULTI)\n {\n geometry::point pt;\n if (geometry::centroid(geom, pt) && converter.disp_.args_.bbox.contains(pt.x, pt.y))\n {\n \/\/ unset any clipping since we're now dealing with a point\n converter.template unset<clip_poly_tag>();\n geometry::point_vertex_adapter va(pt);\n converter.apply(va);\n }\n }\n else if ((placement == MARKER_POINT_PLACEMENT || placement == MARKER_INTERIOR_PLACEMENT) &&\n multi_policy == MARKER_LARGEST_MULTI)\n {\n \/\/ Only apply to path with largest envelope area\n \/\/ TODO: consider using true area for polygon types\n if (type == geometry::geometry_types::MultiPolygon)\n {\n geometry::multi_polygon const& multi_poly = mapnik::util::get<geometry::multi_polygon>(geom);\n double maxarea = 0;\n geometry::polygon const* largest = 0;\n for (geometry::polygon const& poly : multi_poly)\n {\n box2d<double> bbox = geometry::envelope(poly);\n geometry::polygon_vertex_adapter va(poly);\n double area = bbox.width() * bbox.height();\n if (area > maxarea)\n {\n maxarea = area;\n largest = &poly;\n }\n }\n if (largest)\n {\n geometry::polygon_vertex_adapter va(*largest);\n converter.apply(va);\n }\n }\n else\n {\n MAPNIK_LOG_WARN(marker_symbolizer) << \"TODO: if you get here -> open an issue\";\n }\n }\n else\n {\n if (multi_policy != MARKER_EACH_MULTI && placement != MARKER_POINT_PLACEMENT)\n {\n MAPNIK_LOG_WARN(marker_symbolizer) << \"marker_multi_policy != 'each' has no effect with marker_placement != 'point'\";\n }\n apply_vertex_converter_type apply(converter);\n mapnik::util::apply_visitor(vertex_processor_type(apply), geom);\n }\n }\n}\n\n}\n\n#endif \/\/MAPNIK_MARKER_HELPERS_HPP\n<commit_msg>ref #2755 test if centroid is within bounding box<commit_after>\/*****************************************************************************\n *\n * This file is part of Mapnik (c++ mapping toolkit)\n *\n * Copyright (C) 2014 Artem Pavlenko\n *\n * This library is free software; you can redistribute it and\/or\n * modify it under the terms of the GNU Lesser General Public\n * License as published by the Free Software Foundation; either\n * version 2.1 of the License, or (at your option) any later version.\n *\n * This library is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU\n * Lesser General Public License for more details.\n *\n * You should have received a copy of the GNU Lesser General Public\n * License along with this library; if not, write to the Free Software\n * Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA\n *\n *****************************************************************************\/\n\n#ifndef MAPNIK_MARKER_HELPERS_HPP\n#define MAPNIK_MARKER_HELPERS_HPP\n\n#include <mapnik\/color.hpp>\n#include <mapnik\/feature.hpp>\n#include <mapnik\/geometry.hpp>\n#include <mapnik\/geometry_type.hpp>\n#include <mapnik\/geometry_centroid.hpp>\n#include <mapnik\/symbolizer.hpp>\n#include <mapnik\/expression_node.hpp>\n#include <mapnik\/expression_evaluator.hpp>\n#include <mapnik\/svg\/svg_path_attributes.hpp>\n#include <mapnik\/svg\/svg_converter.hpp>\n#include <mapnik\/marker.hpp> \/\/ for svg_storage_type\n#include <mapnik\/markers_placement.hpp>\n#include <mapnik\/attribute.hpp>\n#include <mapnik\/box2d.hpp>\n#include <mapnik\/vertex_converters.hpp>\n#include <mapnik\/vertex_processor.hpp>\n#include <mapnik\/label_collision_detector.hpp>\n#include <mapnik\/renderer_common\/apply_vertex_converter.hpp>\n\n\/\/ agg\n#include \"agg_trans_affine.h\"\n\n\/\/ boost\n#include <boost\/optional.hpp>\n\/\/ stl\n#include <memory>\n#include <type_traits> \/\/ remove_reference\n#include <cmath>\n\nnamespace mapnik {\n\nstruct clip_poly_tag;\n\nusing svg_attribute_type = agg::pod_bvector<svg::path_attributes>;\n\ntemplate <typename Detector>\nstruct vector_markers_dispatch : util::noncopyable\n{\n vector_markers_dispatch(svg_path_ptr const& src,\n agg::trans_affine const& marker_trans,\n symbolizer_base const& sym,\n Detector & detector,\n double scale_factor,\n feature_impl & feature,\n attributes const& vars)\n : src_(src),\n marker_trans_(marker_trans),\n sym_(sym),\n detector_(detector),\n feature_(feature),\n vars_(vars),\n scale_factor_(scale_factor)\n {}\n\n virtual ~vector_markers_dispatch() {}\n\n template <typename T>\n void add_path(T & path)\n {\n marker_placement_enum placement_method = get<marker_placement_enum, keys::markers_placement_type>(sym_, feature_, vars_);\n value_bool ignore_placement = get<value_bool, keys::ignore_placement>(sym_, feature_, vars_);\n value_bool allow_overlap = get<value_bool, keys::allow_overlap>(sym_, feature_, vars_);\n value_bool avoid_edges = get<value_bool, keys::avoid_edges>(sym_, feature_, vars_);\n value_double opacity = get<value_double,keys::opacity>(sym_, feature_, vars_);\n value_double spacing = get<value_double, keys::spacing>(sym_, feature_, vars_);\n value_double max_error = get<value_double, keys::max_error>(sym_, feature_, vars_);\n coord2d center = src_->bounding_box().center();\n agg::trans_affine_translation recenter(-center.x, -center.y);\n agg::trans_affine tr = recenter * marker_trans_;\n direction_enum direction = get<direction_enum, keys::direction>(sym_, feature_, vars_);\n markers_placement_params params { src_->bounding_box(), tr, spacing * scale_factor_, max_error, allow_overlap, avoid_edges, direction };\n markers_placement_finder<T, Detector> placement_finder(\n placement_method, path, detector_, params);\n double x, y, angle = .0;\n while (placement_finder.get_point(x, y, angle, ignore_placement))\n {\n agg::trans_affine matrix = tr;\n matrix.rotate(angle);\n matrix.translate(x, y);\n render_marker(matrix, opacity);\n }\n }\n\n virtual void render_marker(agg::trans_affine const& marker_tr, double opacity) = 0;\n\nprotected:\n svg_path_ptr const& src_;\n agg::trans_affine const& marker_trans_;\n symbolizer_base const& sym_;\n Detector & detector_;\n feature_impl & feature_;\n attributes const& vars_;\n double scale_factor_;\n};\n\ntemplate <typename Detector>\nstruct raster_markers_dispatch : util::noncopyable\n{\n raster_markers_dispatch(image_rgba8 const& src,\n agg::trans_affine const& marker_trans,\n symbolizer_base const& sym,\n Detector & detector,\n double scale_factor,\n feature_impl & feature,\n attributes const& vars)\n : src_(src),\n marker_trans_(marker_trans),\n sym_(sym),\n detector_(detector),\n feature_(feature),\n vars_(vars),\n scale_factor_(scale_factor)\n {}\n\n virtual ~raster_markers_dispatch() {}\n\n template <typename T>\n void add_path(T & path)\n {\n marker_placement_enum placement_method = get<marker_placement_enum, keys::markers_placement_type>(sym_, feature_, vars_);\n value_bool allow_overlap = get<value_bool, keys::allow_overlap>(sym_, feature_, vars_);\n value_bool avoid_edges = get<value_bool, keys::avoid_edges>(sym_, feature_, vars_);\n value_double opacity = get<value_double, keys::opacity>(sym_, feature_, vars_);\n value_bool ignore_placement = get<value_bool, keys::ignore_placement>(sym_, feature_, vars_);\n value_double spacing = get<value_double, keys::spacing>(sym_, feature_, vars_);\n value_double max_error = get<value_double, keys::max_error>(sym_, feature_, vars_);\n box2d<double> bbox(0,0, src_.width(),src_.height());\n direction_enum direction = get<direction_enum, keys::direction>(sym_, feature_, vars_);\n markers_placement_params params { bbox, marker_trans_, spacing * scale_factor_, max_error, allow_overlap, avoid_edges, direction };\n markers_placement_finder<T, label_collision_detector4> placement_finder(\n placement_method, path, detector_, params);\n double x, y, angle = .0;\n while (placement_finder.get_point(x, y, angle, ignore_placement))\n {\n agg::trans_affine matrix = marker_trans_;\n matrix.rotate(angle);\n matrix.translate(x, y);\n render_marker(matrix, opacity);\n }\n }\n\n virtual void render_marker(agg::trans_affine const& marker_tr, double opacity) = 0;\n\nprotected:\n image_rgba8 const& src_;\n agg::trans_affine const& marker_trans_;\n symbolizer_base const& sym_;\n Detector & detector_;\n feature_impl & feature_;\n attributes const& vars_;\n double scale_factor_;\n};\n\nvoid build_ellipse(symbolizer_base const& sym, mapnik::feature_impl & feature, attributes const& vars,\n svg_storage_type & marker_ellipse, svg::svg_path_adapter & svg_path);\n\nbool push_explicit_style(svg_attribute_type const& src,\n svg_attribute_type & dst,\n symbolizer_base const& sym,\n feature_impl & feature,\n attributes const& vars);\n\nvoid setup_transform_scaling(agg::trans_affine & tr,\n double svg_width,\n double svg_height,\n mapnik::feature_impl & feature,\n attributes const& vars,\n symbolizer_base const& sym);\n\n\/\/ Apply markers to a feature with multiple geometries\ntemplate <typename Converter>\nvoid apply_markers_multi(feature_impl const& feature, attributes const& vars, Converter & converter, symbolizer_base const& sym)\n{\n using vertex_converter_type = Converter;\n using apply_vertex_converter_type = detail::apply_vertex_converter<vertex_converter_type>;\n using vertex_processor_type = geometry::vertex_processor<apply_vertex_converter_type>;\n\n auto const& geom = feature.get_geometry();\n geometry::geometry_types type = geometry::geometry_type(geom);\n\n if (type == geometry::geometry_types::Point\n || type == geometry::geometry_types::LineString\n || type == geometry::geometry_types::Polygon)\n {\n apply_vertex_converter_type apply(converter);\n mapnik::util::apply_visitor(vertex_processor_type(apply), geom);\n }\n else\n {\n\n marker_multi_policy_enum multi_policy = get<marker_multi_policy_enum, keys::markers_multipolicy>(sym, feature, vars);\n marker_placement_enum placement = get<marker_placement_enum, keys::markers_placement_type>(sym, feature, vars);\n\n if (placement == MARKER_POINT_PLACEMENT &&\n multi_policy == MARKER_WHOLE_MULTI)\n {\n geometry::point pt;\n \/\/ test if centroid is contained by bounding box\n if (geometry::centroid(geom, pt) && converter.disp_.args_.bbox.contains(pt.x, pt.y))\n {\n \/\/ unset any clipping since we're now dealing with a point\n converter.template unset<clip_poly_tag>();\n geometry::point_vertex_adapter va(pt);\n converter.apply(va);\n }\n }\n else if ((placement == MARKER_POINT_PLACEMENT || placement == MARKER_INTERIOR_PLACEMENT) &&\n multi_policy == MARKER_LARGEST_MULTI)\n {\n \/\/ Only apply to path with largest envelope area\n \/\/ TODO: consider using true area for polygon types\n if (type == geometry::geometry_types::MultiPolygon)\n {\n geometry::multi_polygon const& multi_poly = mapnik::util::get<geometry::multi_polygon>(geom);\n double maxarea = 0;\n geometry::polygon const* largest = 0;\n for (geometry::polygon const& poly : multi_poly)\n {\n box2d<double> bbox = geometry::envelope(poly);\n geometry::polygon_vertex_adapter va(poly);\n double area = bbox.width() * bbox.height();\n if (area > maxarea)\n {\n maxarea = area;\n largest = &poly;\n }\n }\n if (largest)\n {\n geometry::polygon_vertex_adapter va(*largest);\n converter.apply(va);\n }\n }\n else\n {\n MAPNIK_LOG_WARN(marker_symbolizer) << \"TODO: if you get here -> open an issue\";\n }\n }\n else\n {\n if (multi_policy != MARKER_EACH_MULTI && placement != MARKER_POINT_PLACEMENT)\n {\n MAPNIK_LOG_WARN(marker_symbolizer) << \"marker_multi_policy != 'each' has no effect with marker_placement != 'point'\";\n }\n apply_vertex_converter_type apply(converter);\n mapnik::util::apply_visitor(vertex_processor_type(apply), geom);\n }\n }\n}\n\n}\n\n#endif \/\/MAPNIK_MARKER_HELPERS_HPP\n<|endoftext|>"} {"text":"<commit_before>\/* -*- Mode: C++; tab-width: 4; indent-tabs-mode: nil; c-basic-offset: 4 -*- *\/\n\/*\n * This file is part of the LibreOffice project.\n *\n * This Source Code Form is subject to the terms of the Mozilla Public\n * License, v. 2.0. If a copy of the MPL was not distributed with this\n * file, You can obtain one at http:\/\/mozilla.org\/MPL\/2.0\/.\n *\n * This file incorporates work covered by the following license notice:\n *\n * Licensed to the Apache Software Foundation (ASF) under one or more\n * contributor license agreements. See the NOTICE file distributed\n * with this work for additional information regarding copyright\n * ownership. The ASF licenses this file to you under the Apache\n * License, Version 2.0 (the \"License\"); you may not use this file\n * except in compliance with the License. You may obtain a copy of\n * the License at http:\/\/www.apache.org\/licenses\/LICENSE-2.0 .\n *\/\n\n#ifndef CRYPT_TOOLS_HXX\n#define CRYPT_TOOLS_HXX\n\n#include <config_oox.h>\n\n#include <rtl\/ustring.hxx>\n\n#if USE_TLS_OPENSSL\n#include <openssl\/evp.h>\n#include <openssl\/sha.h>\n#endif \/\/ USE_TLS_OPENSSL\n#if USE_TLS_NSS\n#include <nss.h>\n#include <pk11pub.h>\n#endif \/\/ USE_TLS_NSS\n\n#include <rtl\/digest.h>\n#include <vector>\n\nnamespace oox {\nnamespace core {\n\nclass Crypto\n{\npublic:\n enum CryptoType\n {\n UNKNOWN,\n AES_128_ECB,\n AES_128_CBC,\n AES_256_CBC,\n };\n\nprotected:\n#if USE_TLS_OPENSSL\n EVP_CIPHER_CTX mContext;\n#endif\n#if USE_TLS_NSS\n PK11Context* mContext;\n SECItem* mSecParam;\n PK11SymKey* mSymKey;\n#endif\n CryptoType mType;\n\n#if USE_TLS_OPENSSL\n const EVP_CIPHER* getCipher(CryptoType type);\n#endif\n#if USE_TLS_NSS\n void setupContext(\n std::vector<sal_uInt8>& key,\n std::vector<sal_uInt8>& iv,\n CryptoType type,\n CK_ATTRIBUTE_TYPE operation);\n#endif\n\npublic:\n Crypto(CryptoType type);\n\n virtual ~Crypto();\n\n virtual sal_uInt32 update(\n std::vector<sal_uInt8>& output,\n std::vector<sal_uInt8>& input,\n sal_uInt32 inputLength = 0) = 0;\n};\n\nclass Decrypt : public Crypto\n{\npublic:\n Decrypt(std::vector<sal_uInt8>& key, CryptoType type);\n Decrypt(std::vector<sal_uInt8>& key, std::vector<sal_uInt8>& iv, CryptoType type);\n\n virtual sal_uInt32 update(\n std::vector<sal_uInt8>& output,\n std::vector<sal_uInt8>& input,\n sal_uInt32 inputLength = 0);\n\n\n static sal_uInt32 aes128ecb(\n std::vector<sal_uInt8>& output,\n std::vector<sal_uInt8>& input,\n std::vector<sal_uInt8>& key );\n\n static sal_uInt32 aes128cbc(\n std::vector<sal_uInt8>& output,\n std::vector<sal_uInt8>& input,\n std::vector<sal_uInt8>& key,\n std::vector<sal_uInt8>& iv );\n};\n\nclass Encrypt : public Crypto\n{\npublic:\n Encrypt(std::vector<sal_uInt8>& key, CryptoType type);\n Encrypt(std::vector<sal_uInt8>& key, std::vector<sal_uInt8>& iv, CryptoType type);\n\n virtual sal_uInt32 update(\n std::vector<sal_uInt8>& output,\n std::vector<sal_uInt8>& input,\n sal_uInt32 inputLength = 0);\n};\n\nconst sal_uInt32 SHA1_LENGTH = 20;\nconst sal_uInt32 SHA512_LENGTH = 64;\n\nbool sha1( std::vector<sal_uInt8>& output, std::vector<sal_uInt8>& input );\n\nbool sha512( std::vector<sal_uInt8>& output, std::vector<sal_uInt8>& input );\n\n} \/\/ namespace core\n} \/\/ namespace oox\n\n#endif\n\n\/* vim:set shiftwidth=4 softtabstop=4 expandtab: *\/\n<commit_msg>CID#1079343 mContext.cipher is not initialized...<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 CRYPT_TOOLS_HXX\n#define CRYPT_TOOLS_HXX\n\n#include <config_oox.h>\n\n#include <rtl\/ustring.hxx>\n\n#if USE_TLS_OPENSSL\n#include <openssl\/evp.h>\n#include <openssl\/sha.h>\n#endif \/\/ USE_TLS_OPENSSL\n#if USE_TLS_NSS\n#include <nss.h>\n#include <pk11pub.h>\n#endif \/\/ USE_TLS_NSS\n\n#include <rtl\/digest.h>\n#include <vector>\n\nnamespace oox {\nnamespace core {\n\nclass Crypto\n{\npublic:\n enum CryptoType\n {\n UNKNOWN,\n AES_128_ECB,\n AES_128_CBC,\n AES_256_CBC,\n };\n\nprotected:\n#if USE_TLS_OPENSSL\n EVP_CIPHER_CTX mContext;\n#endif\n#if USE_TLS_NSS\n PK11Context* mContext;\n SECItem* mSecParam;\n PK11SymKey* mSymKey;\n#endif\n CryptoType mType;\n\n#if USE_TLS_OPENSSL\n const EVP_CIPHER* getCipher(CryptoType type);\n#endif\n#if USE_TLS_NSS\n void setupContext(\n std::vector<sal_uInt8>& key,\n std::vector<sal_uInt8>& iv,\n CryptoType type,\n CK_ATTRIBUTE_TYPE operation);\n#endif\n\nprotected:\n Crypto(CryptoType type);\n\npublic:\n virtual ~Crypto();\n\n virtual sal_uInt32 update(\n std::vector<sal_uInt8>& output,\n std::vector<sal_uInt8>& input,\n sal_uInt32 inputLength = 0) = 0;\n};\n\nclass Decrypt : public Crypto\n{\npublic:\n Decrypt(std::vector<sal_uInt8>& key, CryptoType type);\n Decrypt(std::vector<sal_uInt8>& key, std::vector<sal_uInt8>& iv, CryptoType type);\n\n virtual sal_uInt32 update(\n std::vector<sal_uInt8>& output,\n std::vector<sal_uInt8>& input,\n sal_uInt32 inputLength = 0);\n\n\n static sal_uInt32 aes128ecb(\n std::vector<sal_uInt8>& output,\n std::vector<sal_uInt8>& input,\n std::vector<sal_uInt8>& key );\n\n static sal_uInt32 aes128cbc(\n std::vector<sal_uInt8>& output,\n std::vector<sal_uInt8>& input,\n std::vector<sal_uInt8>& key,\n std::vector<sal_uInt8>& iv );\n};\n\nclass Encrypt : public Crypto\n{\npublic:\n Encrypt(std::vector<sal_uInt8>& key, CryptoType type);\n Encrypt(std::vector<sal_uInt8>& key, std::vector<sal_uInt8>& iv, CryptoType type);\n\n virtual sal_uInt32 update(\n std::vector<sal_uInt8>& output,\n std::vector<sal_uInt8>& input,\n sal_uInt32 inputLength = 0);\n};\n\nconst sal_uInt32 SHA1_LENGTH = 20;\nconst sal_uInt32 SHA512_LENGTH = 64;\n\nbool sha1( std::vector<sal_uInt8>& output, std::vector<sal_uInt8>& input );\n\nbool sha512( std::vector<sal_uInt8>& output, std::vector<sal_uInt8>& input );\n\n} \/\/ namespace core\n} \/\/ namespace oox\n\n#endif\n\n\/* vim:set shiftwidth=4 softtabstop=4 expandtab: *\/\n<|endoftext|>"} {"text":"<commit_before>#ifndef SERENITY_HTTP_REQUEST_HPP_\n#define SERENITY_HTTP_REQUEST_HPP_\n#include <string>\n#include <map>\n#include <iostream>\n\n#include \"response.hpp\"\n\nnamespace serenity { namespace http {\n\n const unsigned int nothing = 0;\n const unsigned int crlf_01_start = 1;\n const unsigned int crlf_01_end = 2;\n const unsigned int crlf_02_start = 3;\n const unsigned int crlf_02_end = 4;\n const unsigned int post_end = 5;\n const uint32_t initial_data_sz = 128000;\n\n template <typename Enumeration>\n auto as_integer(Enumeration const value) -> typename std::underlying_type<Enumeration>::type\n {\n return static_cast<typename std::underlying_type<Enumeration>::type>(value);\n }\n\n class request {\n public:\n request() { data_ = (char *)malloc(initial_data_sz); }\n ~request() { if (data_) free(data_); }\n \/** \\brief Method used for request: GET, PUT, DELETE, etc. *\/\n std::string method = \"\";\n\n \/** \\brief The requested URI, including parameters *\/\n std::string uri = \"\"; \/\/ Convert to uri class from cpp-net\n\n \/** \\brief The requested function name *\/\n std::string function = \"\"; \/\/ First token after the service resolution info.\n\n \/** \\brief Extra URI arguments, path elements after the first token. *\/\n std::string extra_path = \"\";\n\n \/** \\brief All of the HTTP headers provided by the client. *\/\n std::map<std::string, std::string> headers;\n\n \/** \\brief All of the parameters supplied for the request. *\/\n std::map<std::string, std::string> parameters;\n\n \/** \\brief Major HTTP version (ie 1) *\/\n uint8_t version_major = 0;\n\n \/** \\brief Minor HTTP version (ie 0) *\/\n uint8_t version_minor = 0;\n\n \/** \\brief Raw bytes of the extra data provided by the client in the request *\/\n std::string post_data = \"\";\n\n \/** \\brief Add data to the request for parsing. *\/\n void add_data(const char *request_data, std::size_t bytes) {\n \/\/std::cerr << \"Data (\" << bytes << \"):\" << std::endl\n \/\/ << request_data << std::endl;\n if ((data_end_ + bytes) > data_sz_) {\n data_ = (char *)realloc(data_, data_end_ + bytes + 1);\n }\n memcpy(data_ + data_end_, request_data, bytes);\n data_end_ += bytes;\n data_ptr_ = (data_ + data_end_) - bytes;\n\n if (headers_complete_) {\n \/\/ If we're done with the headers, go straight to parse()\n parse();\n return;\n }\n\n int i = 0;\n for (; (i < bytes) && (parse_state_ < post_end); ++i) {\n switch (parse_state_) {\n case nothing:\n case crlf_01_end:\n if (request_data[i] == '\\r') ++parse_state_;\n else parse_state_ = nothing;\n break;\n case crlf_01_start:\n case crlf_02_start:\n if (request_data[i] == '\\n') ++parse_state_;\n else parse_state_ = nothing;\n break;\n case crlf_02_end:\n ++parse_state_;\n break;\n }\n }\n headers_complete_ = (parse_state_ >= crlf_02_end);\n if (headers_complete_) {\n parse();\n }\n }\n\n bool is_complete() {\n return is_complete_;\n }\n\n bool is_error() {\n return is_error_;\n }\n\n \/** \\brief Parses the provided data as an HTTP request, and populates the current object. *\/\n bool parse() {\n parser_state next_state = parser_state::start;\n char const *token_start = nullptr;\n std::string variable;\n std::string value;\n for (const char *p = data_ptr_; (p - data_) < data_end_; ++p) {\n switch (parser_state_) {\n case parser_state::start:\n if (!set_error( (*p < 'A' || *p > 'Z') )) {\n parser_state_ = parser_state::method;\n token_start = p;\n }\n break;\n case parser_state::method:\n if (!set_error( (*p < 'A' || *p > 'Z') && *p != ' ' )) {\n if (*p == ' ') {\n method = std::string(token_start, p - token_start);\n parser_state_ = parser_state::uri;\n token_start = p + 1; \/\/ +1 to move past ' '.\n \/\/std::cerr << \"[parse] Method: \" << method << std::endl;\n }\n }\n break;\n case parser_state::uri:\n if (!set_error( (*p < 32 || *p > 126) )) { \/\/ Accept all printables.\n if (*p == '?') { \/\/ End of URI, start of params\n uri = decode_url(std::string(token_start, p - token_start));\n parser_state_ = parser_state::uri_parameters;\n token_start = p + 1; \/\/ Move past '?'\n \/\/std::cerr << \"[parse] URI: \" << uri << std::endl;\n }\n else if (*p == ' ') { \/\/ End of URI, start of version\n uri = decode_url(std::string(token_start, p - token_start));\n parser_state_ = parser_state::http_version_HTTP;\n \/\/std::cerr << \"[parse] URI: \" << uri << std::endl;\n }\n }\n break;\n case parser_state::uri_parameters:\n if (*p == '=') {\n variable = decode_url(std::string(token_start, p - token_start));\n token_start = p + 1; \/\/ Move beyond '='\n }\n else if (*p == '&' || *p == ' ') {\n value = decode_url(std::string(token_start, p - token_start));\n if (variable.size() > 0)\n parameters[variable] = value;\n else if (value.size() > 0)\n parameters[value] = \"\";\n \/\/std::cerr << \"[parse] param: \" << variable << \" = \" << value << std::endl;\n\n if (*p == ' ')\n parser_state_ = parser_state::http_version_HTTP;\n\n token_start = p + 1; \/\/ Move beyond '&'\n }\n else if (*p == '\\r' || *p == '\\n')\n parser_state_ = parser_state::error;\n break;\n case parser_state::http_version_HTTP:\n \/\/std::cerr << \"[parse] parsing HTTP: \" << *p << std::endl;\n \/\/ TODO: Proper HTTP sequence should be determined.\n if (!set_error( (*p != 'H' && *p != 'T' && *p != 'P') && *p != '\/')) {\n if (*p == '\/') {\n parser_state_ = parser_state::http_version_major;\n token_start = p + 1; \/\/ +1 to move past '\/'\n }\n }\n break;\n case parser_state::http_version_major:\n \/\/std::cerr << \"[parse] parsing HTTP major: \" << *p << std::endl;\n if (!set_error( (*p < '0' || *p > '9') && (*p != '.') )) {\n if ('.' == *p) {\n version_major = std::stol(std::string(token_start, p - token_start));\n parser_state_ = parser_state::http_version_minor;\n token_start = p + 1; \/\/ +1 to move past '.'\n }\n }\n break;\n case parser_state::http_version_minor:\n \/\/std::cerr << \"[parse] parsing HTTP minor: \" << *p << std::endl;\n if (!set_error( (*p < '0' || *p > '9') && (*p != '\\r') )) {\n if ('\\r' == *p) {\n version_minor = std::stol(std::string(token_start, p - token_start));\n token_start = p + 2; \/\/ Move past \"\\r\\n\"\n\n next_state = parser_state::header_name;\n parser_state_ = parser_state::end_of_line;\n }\n }\n break;\n case parser_state::header_name:\n if (*p == '\\r') {\n parser_state_ = parser_state::end_of_line;\n next_state = parser_state::post_data;\n \/\/post_data_start_ptr_ = p + 2; \/\/ move past \\r\\n\n post_data_start_offset_ = (p - data_) + 2;\n post_data.clear();\n header_length_ = &data_[post_data_start_offset_] - data_ptr_;\n }\n else if (!set_error(!identifier_char(*p))) {\n if (*p == ':') {\n variable = std::string(token_start, p - token_start);\n token_start = p + 2; \/\/ Move past \": \"\n parser_state_ = parser_state::header_value;\n }\n }\n break;\n case parser_state::header_value:\n if (*p == '\\r') {\n value = std::string(token_start, p - token_start);\n next_state = parser_state::header_name;\n parser_state_ = parser_state::end_of_line;\n\n token_start = p + 2; \/\/ Move past \"\\r\\n\"\n headers[variable] = value;\n \/\/std::cerr << \"[parse] \" << variable << \" = \" << value << std::endl;\n }\n break;\n case parser_state::end_of_line:\n \/\/std::cerr << \"[parser] parsing end of line: \" << *p << std::endl;\n if (!set_error( *p != '\\n' )) {\n \/\/std::cerr << \"[parser] EOL parsed\" << std::endl;\n parser_state_ = next_state;\n token_start = p + 1; \/\/ Move past '\\n'\n }\n break;\n default:\n break;\n }\n if (is_error_) {\n \/\/std::cerr << \"[parse] ERROR - previous state: \" << as_integer(state) << std::endl;\n parser_state_ = parser_state::error;\n break;\n }\n }\n if (!is_complete_ && parser_state_ == parser_state::post_data && \n headers.find(\"Content-Length\") != headers.end()) {\n \/\/ This variable is for debugging puposes.\n uint32_t content_length = \n strtoul(headers[\"Content-Length\"].c_str(), NULL, 0);\n if (data_end_ - header_length_ >= content_length) {\n post_data = std::string(&data_[post_data_start_offset_], content_length);\n is_complete_ = true;\n }\n }\n else {\n is_complete_ = true;\n data_end_ = 0;\n }\n\n return !is_error_;\n }\n\n private:\n enum class parser_state {\n start,\n method,\n uri,\n uri_parameters,\n http_version_HTTP,\n http_version_major,\n http_version_minor,\n header_name,\n header_value,\n end_of_request_maybe,\n post_data,\n error,\n end_of_line\n };\n\n \/\/ TODO: Make this dynamic without the potential for uploading\n \/\/ huge files.\n \/\/std::array<char, 2000000> data_;\n char *data_ = nullptr;\n char *data_ptr_ = data_;\n \/\/const char *post_data_start_ptr_ = nullptr;\n std::size_t post_data_start_offset_ = 0;\n std::size_t data_end_ = 0;\n std::size_t header_length_ = 0;\n std::size_t data_sz_ = initial_data_sz;\n unsigned int parse_state_ = 0;\n bool is_complete_ = false;\n bool headers_complete_ = false;\n bool is_error_ = false;\n parser_state parser_state_ = parser_state::start;\n\n inline bool set_error(bool is_error) { return (is_error_ = is_error); }\n bool identifier_char(char c) {\n std::string valid_chars = \"abcdefghijklmnopqrstuvwxyz0123456789-:\";\n auto p = valid_chars.find_first_of(::tolower(c));\n return (p != std::string::npos);\n }\n\n std::string decode_url(const std::string &str) {\n char hex[3] = { 0, 0, 0 };\n bool in_hex = false;\n std::string decoded = \"\";\n for (int i=0; i < str.size(); ++i) {\n if (in_hex) {\n if (hex[0] == '\\0')\n hex[0] = str[i];\n else {\n hex[1] = str[i];\n in_hex = false;\n char c = std::strtol(hex, nullptr, 16);\n decoded += c;\n }\n }\n else if (str[i] != '%')\n decoded += str[i];\n else\n in_hex = true;\n }\n return decoded;\n }\n };\n \n} \/* http *\/ } \/* serenity *\/\n\n#endif \/* end of include guard: SERENITY_HTTP_REQUEST_HPP_ *\/\n<commit_msg>Added a proper copy constructor for the request class, since the default was doing the wrong thing with the new data_ char * and causing a sefgault.<commit_after>#ifndef SERENITY_HTTP_REQUEST_HPP_\n#define SERENITY_HTTP_REQUEST_HPP_\n#include <string>\n#include <map>\n#include <iostream>\n\n#include \"response.hpp\"\n\nnamespace serenity { namespace http {\n\n const unsigned int nothing = 0;\n const unsigned int crlf_01_start = 1;\n const unsigned int crlf_01_end = 2;\n const unsigned int crlf_02_start = 3;\n const unsigned int crlf_02_end = 4;\n const unsigned int post_end = 5;\n const uint32_t initial_data_sz = 128000;\n\n template <typename Enumeration>\n auto as_integer(Enumeration const value) -> typename std::underlying_type<Enumeration>::type\n {\n return static_cast<typename std::underlying_type<Enumeration>::type>(value);\n }\n\n class request {\n public:\n request() { data_ = (char *)malloc(initial_data_sz); }\n ~request() { if (data_) { free(data_); data_ = nullptr; } }\n\n request(const request &r) {\n data_ = nullptr;\n data_ptr_ = data_;\n post_data_start_offset_ = 0;\n data_end_ = 0;\n header_length_ = 0;\n data_sz_ = initial_data_sz;\n parse_state_ = 0;\n is_complete_ = false;\n headers_complete_ = false;\n is_error_ = false;\n parser_state_ = parser_state::start;\n\n method = r.method;\n uri = r.uri;\n function = r.function;\n extra_path = r.extra_path;\n headers = r.headers;\n parameters = r.parameters;\n version_major = r.version_major;\n version_minor = r.version_minor;\n post_data = r.post_data;\n }\n\n \/** \\brief Method used for request: GET, PUT, DELETE, etc. *\/\n std::string method = \"\";\n\n \/** \\brief The requested URI, including parameters *\/\n std::string uri = \"\"; \/\/ Convert to uri class from cpp-net\n\n \/** \\brief The requested function name *\/\n std::string function = \"\"; \/\/ First token after the service resolution info.\n\n \/** \\brief Extra URI arguments, path elements after the first token. *\/\n std::string extra_path = \"\";\n\n \/** \\brief All of the HTTP headers provided by the client. *\/\n std::map<std::string, std::string> headers;\n\n \/** \\brief All of the parameters supplied for the request. *\/\n std::map<std::string, std::string> parameters;\n\n \/** \\brief Major HTTP version (ie 1) *\/\n uint8_t version_major = 0;\n\n \/** \\brief Minor HTTP version (ie 0) *\/\n uint8_t version_minor = 0;\n\n \/** \\brief Raw bytes of the extra data provided by the client in the request *\/\n std::string post_data = \"\";\n\n \/** \\brief Add data to the request for parsing. *\/\n void add_data(const char *request_data, std::size_t bytes) {\n \/\/std::cerr << \"Data (\" << bytes << \"):\" << std::endl\n \/\/ << request_data << std::endl;\n if ((data_end_ + bytes) > data_sz_) {\n data_ = (char *)realloc(data_, data_end_ + bytes + 1);\n }\n memcpy(data_ + data_end_, request_data, bytes);\n data_end_ += bytes;\n data_ptr_ = (data_ + data_end_) - bytes;\n\n if (headers_complete_) {\n \/\/ If we're done with the headers, go straight to parse()\n parse();\n return;\n }\n\n int i = 0;\n for (; (i < bytes) && (parse_state_ < post_end); ++i) {\n switch (parse_state_) {\n case nothing:\n case crlf_01_end:\n if (request_data[i] == '\\r') ++parse_state_;\n else parse_state_ = nothing;\n break;\n case crlf_01_start:\n case crlf_02_start:\n if (request_data[i] == '\\n') ++parse_state_;\n else parse_state_ = nothing;\n break;\n case crlf_02_end:\n ++parse_state_;\n break;\n }\n }\n headers_complete_ = (parse_state_ >= crlf_02_end);\n if (headers_complete_) {\n parse();\n }\n }\n\n bool is_complete() {\n return is_complete_;\n }\n\n bool is_error() {\n return is_error_;\n }\n\n \/** \\brief Parses the provided data as an HTTP request, and populates the current object. *\/\n bool parse() {\n parser_state next_state = parser_state::start;\n char const *token_start = nullptr;\n std::string variable;\n std::string value;\n for (const char *p = data_ptr_; (p - data_) < data_end_; ++p) {\n switch (parser_state_) {\n case parser_state::start:\n if (!set_error( (*p < 'A' || *p > 'Z') )) {\n parser_state_ = parser_state::method;\n token_start = p;\n }\n break;\n case parser_state::method:\n if (!set_error( (*p < 'A' || *p > 'Z') && *p != ' ' )) {\n if (*p == ' ') {\n method = std::string(token_start, p - token_start);\n parser_state_ = parser_state::uri;\n token_start = p + 1; \/\/ +1 to move past ' '.\n \/\/std::cerr << \"[parse] Method: \" << method << std::endl;\n }\n }\n break;\n case parser_state::uri:\n if (!set_error( (*p < 32 || *p > 126) )) { \/\/ Accept all printables.\n if (*p == '?') { \/\/ End of URI, start of params\n uri = decode_url(std::string(token_start, p - token_start));\n parser_state_ = parser_state::uri_parameters;\n token_start = p + 1; \/\/ Move past '?'\n \/\/std::cerr << \"[parse] URI: \" << uri << std::endl;\n }\n else if (*p == ' ') { \/\/ End of URI, start of version\n uri = decode_url(std::string(token_start, p - token_start));\n parser_state_ = parser_state::http_version_HTTP;\n \/\/std::cerr << \"[parse] URI: \" << uri << std::endl;\n }\n }\n break;\n case parser_state::uri_parameters:\n if (*p == '=') {\n variable = decode_url(std::string(token_start, p - token_start));\n token_start = p + 1; \/\/ Move beyond '='\n }\n else if (*p == '&' || *p == ' ') {\n value = decode_url(std::string(token_start, p - token_start));\n if (variable.size() > 0)\n parameters[variable] = value;\n else if (value.size() > 0)\n parameters[value] = \"\";\n \/\/std::cerr << \"[parse] param: \" << variable << \" = \" << value << std::endl;\n\n if (*p == ' ')\n parser_state_ = parser_state::http_version_HTTP;\n\n token_start = p + 1; \/\/ Move beyond '&'\n }\n else if (*p == '\\r' || *p == '\\n')\n parser_state_ = parser_state::error;\n break;\n case parser_state::http_version_HTTP:\n \/\/std::cerr << \"[parse] parsing HTTP: \" << *p << std::endl;\n \/\/ TODO: Proper HTTP sequence should be determined.\n if (!set_error( (*p != 'H' && *p != 'T' && *p != 'P') && *p != '\/')) {\n if (*p == '\/') {\n parser_state_ = parser_state::http_version_major;\n token_start = p + 1; \/\/ +1 to move past '\/'\n }\n }\n break;\n case parser_state::http_version_major:\n \/\/std::cerr << \"[parse] parsing HTTP major: \" << *p << std::endl;\n if (!set_error( (*p < '0' || *p > '9') && (*p != '.') )) {\n if ('.' == *p) {\n version_major = std::stol(std::string(token_start, p - token_start));\n parser_state_ = parser_state::http_version_minor;\n token_start = p + 1; \/\/ +1 to move past '.'\n }\n }\n break;\n case parser_state::http_version_minor:\n \/\/std::cerr << \"[parse] parsing HTTP minor: \" << *p << std::endl;\n if (!set_error( (*p < '0' || *p > '9') && (*p != '\\r') )) {\n if ('\\r' == *p) {\n version_minor = std::stol(std::string(token_start, p - token_start));\n token_start = p + 2; \/\/ Move past \"\\r\\n\"\n\n next_state = parser_state::header_name;\n parser_state_ = parser_state::end_of_line;\n }\n }\n break;\n case parser_state::header_name:\n if (*p == '\\r') {\n parser_state_ = parser_state::end_of_line;\n next_state = parser_state::post_data;\n \/\/post_data_start_ptr_ = p + 2; \/\/ move past \\r\\n\n post_data_start_offset_ = (p - data_) + 2;\n post_data.clear();\n header_length_ = &data_[post_data_start_offset_] - data_ptr_;\n }\n else if (!set_error(!identifier_char(*p))) {\n if (*p == ':') {\n variable = std::string(token_start, p - token_start);\n token_start = p + 2; \/\/ Move past \": \"\n parser_state_ = parser_state::header_value;\n }\n }\n break;\n case parser_state::header_value:\n if (*p == '\\r') {\n value = std::string(token_start, p - token_start);\n next_state = parser_state::header_name;\n parser_state_ = parser_state::end_of_line;\n\n token_start = p + 2; \/\/ Move past \"\\r\\n\"\n headers[variable] = value;\n \/\/std::cerr << \"[parse] \" << variable << \" = \" << value << std::endl;\n }\n break;\n case parser_state::end_of_line:\n \/\/std::cerr << \"[parser] parsing end of line: \" << *p << std::endl;\n if (!set_error( *p != '\\n' )) {\n \/\/std::cerr << \"[parser] EOL parsed\" << std::endl;\n parser_state_ = next_state;\n token_start = p + 1; \/\/ Move past '\\n'\n }\n break;\n default:\n break;\n }\n if (is_error_) {\n \/\/std::cerr << \"[parse] ERROR - previous state: \" << as_integer(state) << std::endl;\n parser_state_ = parser_state::error;\n break;\n }\n }\n if (!is_complete_ && parser_state_ == parser_state::post_data && \n headers.find(\"Content-Length\") != headers.end()) {\n \/\/ This variable is for debugging puposes.\n uint32_t content_length = \n strtoul(headers[\"Content-Length\"].c_str(), NULL, 0);\n if (data_end_ - header_length_ >= content_length) {\n post_data = std::string(&data_[post_data_start_offset_], content_length);\n is_complete_ = true;\n }\n }\n else {\n is_complete_ = true;\n data_end_ = 0;\n }\n\n return !is_error_;\n }\n\n private:\n enum class parser_state {\n start,\n method,\n uri,\n uri_parameters,\n http_version_HTTP,\n http_version_major,\n http_version_minor,\n header_name,\n header_value,\n end_of_request_maybe,\n post_data,\n error,\n end_of_line\n };\n\n \/\/ TODO: Make this dynamic without the potential for uploading\n \/\/ huge files.\n \/\/std::array<char, 2000000> data_;\n char *data_ = nullptr;\n char *data_ptr_ = data_;\n \/\/const char *post_data_start_ptr_ = nullptr;\n std::size_t post_data_start_offset_ = 0;\n std::size_t data_end_ = 0;\n std::size_t header_length_ = 0;\n std::size_t data_sz_ = initial_data_sz;\n unsigned int parse_state_ = 0;\n bool is_complete_ = false;\n bool headers_complete_ = false;\n bool is_error_ = false;\n parser_state parser_state_ = parser_state::start;\n\n inline bool set_error(bool is_error) { return (is_error_ = is_error); }\n bool identifier_char(char c) {\n std::string valid_chars = \"abcdefghijklmnopqrstuvwxyz0123456789-:\";\n auto p = valid_chars.find_first_of(::tolower(c));\n return (p != std::string::npos);\n }\n\n std::string decode_url(const std::string &str) {\n char hex[3] = { 0, 0, 0 };\n bool in_hex = false;\n std::string decoded = \"\";\n for (int i=0; i < str.size(); ++i) {\n if (in_hex) {\n if (hex[0] == '\\0')\n hex[0] = str[i];\n else {\n hex[1] = str[i];\n in_hex = false;\n char c = std::strtol(hex, nullptr, 16);\n decoded += c;\n }\n }\n else if (str[i] != '%')\n decoded += str[i];\n else\n in_hex = true;\n }\n return decoded;\n }\n\n void operator =(const request &o) = delete;\n };\n \n} \/* http *\/ } \/* serenity *\/\n\n#endif \/* end of include guard: SERENITY_HTTP_REQUEST_HPP_ *\/\n<|endoftext|>"} {"text":"<commit_before>\/**\n \\file undistort.cc\n\n Apply Lensfun corrections to a PNM file in place. This means, the original\n file is overwritten. The command line parameters are:\n - path to the PNM file\n - x coordinate of top left corner\n - y coordinate of top left corner\n - x coordinate of top right corner\n - y coordinate of top right corner\n - x coordinate of bottom left corner\n - y coordinate of bottom left corner\n - x coordinate of bottom right corner\n - y coordinate of bottom right corner\n - Lensfun name of camera make\n - Lensfun name of camera model\n - Lensfun name of lens make\n - Lensfun name of lens model\n\n All coordinates are pixel coordinates, with the top left of the image the\n origin. The corners must be the corners of a perfect rectangle which was\n taken a picture of, e.g. a sheet of paper. These are used for the\n perspective correction as well as the rotation, so that the edges of the\n rectangle are parellel to the image borders.\n\n The program returns the position and the dimensions of the rectangle <b>in\n the output image<\/b> to stdout in JSON format:\n\n \\code{.json}\n [x₀, y₀, width, height]\n \\endcode\n\n Here, x₀ and y₀ are the coordinates of the top left corner, and width and\n height are the dimensions of the rectangle.\n\n This program does not apply colour corrections such as vignetting\n correction, as those are handled by kamscan.py using flat field images.\n*\/\n#include <Python.h>\n#include <fstream>\n#include <vector>\n#include <iterator>\n#include <iostream>\n#include <string>\n#include <algorithm>\n#include <cmath>\n#include \"lensfun\/lensfun.h\"\n\n\/** Class for bitmap data.\n\n In case of 2 bytes per channel, network byte order is assumed. *\/\nclass Image {\npublic:\n Image(int width, int height, int channel_size, int channels);\n Image() {};\n Image(const Image &image);\n \/** Get the channel intensity at a certian coordinate.\n \\param x x coordinate\n \\param y y coordinate\n \\param channel index of the channel (for greyscale, it is always zero;\n for RGB, it is 0, 1, or 2)\n \\return raw integer value of the intensity of this channel at this\n position\n *\/\n int get(int x, int y, int channel);\n \/** Get the channel intensity at a certian coordinate. The coordinates are\n floats and may contain fractions. In this case, the intensity is\n calculated using bilinear interpolation between the four pixels around\n this coordinate.\n \\param x x coordinate\n \\param y y coordinate\n \\param channel index of the channel (for greyscale, it is always zero;\n for RGB, it is 0, 1, or 2)\n \\return raw integer value of the intensity of this channel at this\n position\n *\/\n int get(float x, float y, int channel);\n \/** Set the channel intensity at a certian coordinate.\n \\param x x coordinate\n \\param y y coordinate\n \\param channel index of the channel (for greyscale, it is always zero;\n for RGB, it is 0, 1, or 2)\n \\param value raw integer value of the intensity of this channel at this\n position\n *\/\n void set(int x, int y, int channel, int value);\n \/** Determine the channel descriptions. This is used by Lensfun internally\n and necessary if you want to apply colour corrections, e.g. vignetting\n correction.\n \\return the components of each pixel\n *\/\n int components();\n \/** Determine the pixel format à la Lensfun. It is derived from\n channel_size.\n \\return the pixel format as it is needed by Lensfun\n *\/\n lfPixelFormat pixel_format();\n int width, height; \/\/\/< width and height of the image in pixels\n int channels; \/\/\/< number of channels; may be 1 (greyscale) or 3 (RGB)\n \/** the raw data (1:1 dump of the PNM content, without header)\n *\/\n std::vector<unsigned char> data;\n\nprivate:\n friend std::istream& operator>>(std::istream &inputStream, Image &other);\n friend std::ostream& operator<<(std::ostream &outputStream, const Image &other);\n int channel_size; \/\/\/< width of one channel in bytes; may be 1 or 2\n};\n\nImage::Image(int width, int height, int channel_size, int channels) :\n width(width), height(height), channel_size(channel_size), channels(channels)\n{\n data.resize(width * height * channel_size * channels);\n}\n\nImage::Image(const Image &image) :\n width(image.width), height(image.height), channel_size(image.channel_size), channels(image.channels) {\n data.resize(width * height * channel_size * channels);\n}\n\nint Image::get(int x, int y, int channel) {\n if (x < 0 || x >= width || y < 0 || y >= height)\n return 0;\n int position = channel_size * (channels * (y * width + x) + channel);\n int result = static_cast<int>(data[position]);\n if (channel_size == 2)\n result = (result << 8) + static_cast<int>(data[position + 1]);\n return result;\n}\n\nint Image::get(float x, float y, int channel) {\n float dummy;\n int x0 = static_cast<int>(x);\n int y0 = static_cast<int>(y);\n float i0 = static_cast<float>(get(x0, y0, channel));\n float i1 = static_cast<float>(get(x0 + 1, y0, channel));\n float i2 = static_cast<float>(get(x0, y0 + 1, channel));\n float i3 = static_cast<float>(get(x0 + 1, y0 + 1, channel));\n float fraction_x = std::modf(x, &dummy);\n float i01 = (1 - fraction_x) * i0 + fraction_x * i1;\n float i23 = (1 - fraction_x) * i2 + fraction_x * i3;\n float fraction_y = std::modf(y, &dummy);\n return static_cast<int>(std::round((1 - fraction_y) * i01 + fraction_y * i23));\n}\n\nvoid Image::set(int x, int y, int channel, int value) {\n if (x >= 0 && x < width && y >= 0 && y < height) {\n int position = channel_size * (channels * (y * width + x) + channel);\n if (channel_size == 1)\n data[position] = static_cast<unsigned char>(value);\n else if (channel_size == 2) {\n data[position] = static_cast<unsigned char>(value >> 8);\n data[position + 1] = static_cast<unsigned char>(value & 256);\n }\n }\n}\n\nint Image::components() {\n switch (channels) {\n case 1:\n return LF_CR_1(INTENSITY);\n case 3:\n return LF_CR_3(RED, GREEN, BLUE);\n default:\n throw std::runtime_error(\"Invalid value of 'channels'.\");\n }\n}\n\nlfPixelFormat Image::pixel_format() {\n switch (channel_size) {\n case 1:\n return LF_PF_U8;\n case 2:\n return LF_PF_U16;\n default:\n throw std::runtime_error(\"Invalid value of 'channel_size'.\");\n }\n}\n\nstd::istream& operator>>(std::istream &inputStream, Image &other)\n{\n std::string magic_number;\n int maximum_color_value;\n inputStream >> magic_number;\n if (magic_number == \"P5\")\n other.channels = 1;\n else if (magic_number == \"P6\")\n other.channels = 3;\n else\n throw std::runtime_error(\"Invalid input file. Must start with 'P5' or 'P6'.\");\n inputStream >> other.width >> other.height >> maximum_color_value;\n inputStream.get(); \/\/ skip the trailing white space\n switch (maximum_color_value) {\n case 255:\n other.channel_size = 1;\n break;\n case 65535:\n other.channel_size = 2;\n break;\n default:\n throw std::runtime_error(\"Invalid PPM file: Maximum color value must be 255 or 65535.\");\n }\n size_t size = other.width * other.height * other.channel_size * other.channels;\n other.data.resize(size);\n inputStream.read(reinterpret_cast<char*>(other.data.data()), size);\n return inputStream;\n}\n\nstd::ostream& operator<<(std::ostream &outputStream, const Image &other)\n{\n outputStream << (other.channels == 3 ? \"P6\" : \"P5\") << \"\\n\"\n << other.width << \" \"\n << other.height << \"\\n\"\n << (other.channel_size == 1 ? \"255\" : \"65535\") << \"\\n\";\n outputStream.write(reinterpret_cast<const char*>(other.data.data()), other.data.size());\n return outputStream;\n}\n\nstatic PyObject *undistort(PyObject *self, PyObject *args) {\n const char *filename, *camera_make, *camera_model, *lens_make, *lens_model;\n float x0, y0, x1, y1, x2, y2, x3, y3;\n PyArg_ParseTuple(args, \"sffffffffssss\", &filename, &x0, &y0, &x1, &y1, &x2, &y2, &x3, &y3,\n &camera_make, &camera_model, &lens_make, &lens_model);\n\n lfDatabase ldb;\n\n if (ldb.Load() != LF_NO_ERROR) {\n PyErr_SetString(PyExc_RuntimeError, \"Database could not be loaded\");\n return NULL;\n }\n\n const lfCamera *camera;\n const lfCamera **cameras = ldb.FindCamerasExt(camera_make, camera_model);\n if (cameras && !cameras[1])\n camera = cameras[0];\n else {\n std::vector<char> buffer(std::snprintf(nullptr, 0, \"Cannot find unique camera in database. %i cameras found.\",\n (int)sizeof(cameras)));\n std::snprintf(&buffer[0], buffer.size(), \"Cannot find unique camera in database. %i cameras found.\",\n (int)sizeof(cameras));\n PyErr_SetString(PyExc_RuntimeError, buffer.data());\n lf_free(cameras);\n return NULL;\n }\n lf_free(cameras);\n\n const lfLens *lens;\n const lfLens **lenses = ldb.FindLenses(camera, lens_make, lens_model);\n if (lenses && !lenses[1]) {\n lens = lenses[0];\n } else if (!lenses) {\n PyErr_SetString(PyExc_RuntimeError, \"Cannot find lens in database\");\n lf_free(lenses);\n return NULL;\n } else {\n PyErr_SetString(PyExc_RuntimeError, \"Lens name ambiguous\");\n lf_free(lenses);\n return NULL;\n }\n lf_free(lenses);\n\n Image image;\n {\n std::ifstream file(filename, std::ios::binary);\n file >> image;\n }\n\n lfModifier modifier(camera->CropFactor, image.width, image.height, image.pixel_format());\n lfModifier pc_coord_modifier(camera->CropFactor, image.width, image.height, image.pixel_format(), true);\n lfModifier back_modifier(camera->CropFactor, image.width, image.height, image.pixel_format(), true);\n if (!modifier.EnableDistortionCorrection(lens, 50) || !back_modifier.EnableDistortionCorrection(lens, 50) ||\n !pc_coord_modifier.EnableDistortionCorrection(lens, 50)) {\n PyErr_SetString(PyExc_RuntimeError, \"Failed to activate undistortion\");\n return NULL;\n }\n if (image.channels == 3)\n if (!modifier.EnableTCACorrection(lens, 50)) {\n PyErr_SetString(PyExc_RuntimeError, \"Failed to activate un-TCA\");\n return NULL;\n }\n std::vector<float> x, y;\n x.push_back(x0);\n y.push_back(y0);\n\n x.push_back(x2);\n y.push_back(y2);\n\n x.push_back(x1);\n y.push_back(y1);\n\n x.push_back(x3);\n y.push_back(y3);\n\n x.push_back(x0);\n y.push_back(y0);\n\n x.push_back(x1);\n y.push_back(y1);\n std::vector<float> x_undist, y_undist;\n for (int i = 0; i < x.size(); i++) {\n float result[2];\n pc_coord_modifier.ApplyGeometryDistortion(x[i], y[i], 1, 1, result);\n x_undist.push_back(result[0]);\n y_undist.push_back(result[1]);\n }\n if (!modifier.EnablePerspectiveCorrection(lens, 50, x_undist.data(), y_undist.data(), 6, 0) ||\n !back_modifier.EnablePerspectiveCorrection(lens, 50, x_undist.data(), y_undist.data(), 6, 0)) {\n PyErr_SetString(PyExc_RuntimeError, \"Failed to activate perspective correction\");\n return NULL;\n }\n\n std::vector<float> res(image.width * image.height * 2 * image.channels);\n if (image.channels == 3)\n modifier.ApplySubpixelGeometryDistortion(0, 0, image.width, image.height, res.data());\n else\n modifier.ApplyGeometryDistortion(0, 0, image.width, image.height, res.data());\n Image new_image = image;\n for (int x = 0; x < image.width; x++)\n for (int y = 0; y < image.height; y++) {\n int position = 2 * image.channels * (y * image.width + x);\n float source_x_R = res[position];\n float source_y_R = res[position + 1];\n new_image.set(x, y, 0, image.get(source_x_R, source_y_R, 0));\n if (image.channels == 3) {\n float source_x_G = res[position + 2];\n float source_y_G = res[position + 3];\n float source_x_B = res[position + 4];\n float source_y_B = res[position + 5];\n new_image.set(x, y, 1, image.get(source_x_G, source_y_G, 1));\n new_image.set(x, y, 2, image.get(source_x_B, source_y_B, 2));\n }\n }\n std::ofstream file(filename, std::ios::binary);\n file << new_image;\n\n for (int i = 0; i < 4; i++) {\n float result[2];\n back_modifier.ApplyGeometryDistortion(x[i], y[i], 1, 1, result);\n x[i] = result[0];\n y[i] = result[1];\n }\n \n return Py_BuildValue(\"ffff\", std::min(x[0], x[2]), std::min(y[0], y[1]),\n std::max(x[1], x[3]) - std::min(x[0], x[2]), std::max(y[2], y[3]) - std::min(y[0], y[1]));\n}\n\nstatic PyMethodDef UndistortMethods[] = {\n {\"undistort\", undistort, METH_VARARGS, \"Undistort PNM image data.\"},\n {NULL, NULL, 0, NULL}\n};\n\nstatic struct PyModuleDef undistortmodule = {\n PyModuleDef_HEAD_INIT, \"undistort\", NULL, -1, UndistortMethods\n};\n\nPyMODINIT_FUNC\nPyInit_undistort(void)\n{\n return PyModule_Create(&undistortmodule);\n}\n<commit_msg>Added FixMe.<commit_after>\/**\n \\file undistort.cc\n\n Apply Lensfun corrections to a PNM file in place. This means, the original\n file is overwritten. The command line parameters are:\n - path to the PNM file\n - x coordinate of top left corner\n - y coordinate of top left corner\n - x coordinate of top right corner\n - y coordinate of top right corner\n - x coordinate of bottom left corner\n - y coordinate of bottom left corner\n - x coordinate of bottom right corner\n - y coordinate of bottom right corner\n - Lensfun name of camera make\n - Lensfun name of camera model\n - Lensfun name of lens make\n - Lensfun name of lens model\n\n All coordinates are pixel coordinates, with the top left of the image the\n origin. The corners must be the corners of a perfect rectangle which was\n taken a picture of, e.g. a sheet of paper. These are used for the\n perspective correction as well as the rotation, so that the edges of the\n rectangle are parellel to the image borders.\n\n The program returns the position and the dimensions of the rectangle <b>in\n the output image<\/b> to stdout in JSON format:\n\n \\code{.json}\n [x₀, y₀, width, height]\n \\endcode\n\n Here, x₀ and y₀ are the coordinates of the top left corner, and width and\n height are the dimensions of the rectangle.\n\n This program does not apply colour corrections such as vignetting\n correction, as those are handled by kamscan.py using flat field images.\n*\/\n#include <Python.h>\n#include <fstream>\n#include <vector>\n#include <iterator>\n#include <iostream>\n#include <string>\n#include <algorithm>\n#include <cmath>\n#include \"lensfun\/lensfun.h\"\n\n\/** Class for bitmap data.\n\n In case of 2 bytes per channel, network byte order is assumed. *\/\nclass Image {\npublic:\n Image(int width, int height, int channel_size, int channels);\n Image() {};\n Image(const Image &image);\n \/** Get the channel intensity at a certian coordinate.\n \\param x x coordinate\n \\param y y coordinate\n \\param channel index of the channel (for greyscale, it is always zero;\n for RGB, it is 0, 1, or 2)\n \\return raw integer value of the intensity of this channel at this\n position\n *\/\n int get(int x, int y, int channel);\n \/** Get the channel intensity at a certian coordinate. The coordinates are\n floats and may contain fractions. In this case, the intensity is\n calculated using bilinear interpolation between the four pixels around\n this coordinate.\n \\param x x coordinate\n \\param y y coordinate\n \\param channel index of the channel (for greyscale, it is always zero;\n for RGB, it is 0, 1, or 2)\n \\return raw integer value of the intensity of this channel at this\n position\n *\/\n int get(float x, float y, int channel);\n \/** Set the channel intensity at a certian coordinate.\n \\param x x coordinate\n \\param y y coordinate\n \\param channel index of the channel (for greyscale, it is always zero;\n for RGB, it is 0, 1, or 2)\n \\param value raw integer value of the intensity of this channel at this\n position\n *\/\n void set(int x, int y, int channel, int value);\n \/** Determine the channel descriptions. This is used by Lensfun internally\n and necessary if you want to apply colour corrections, e.g. vignetting\n correction.\n \\return the components of each pixel\n *\/\n int components();\n \/** Determine the pixel format à la Lensfun. It is derived from\n channel_size.\n \\return the pixel format as it is needed by Lensfun\n *\/\n lfPixelFormat pixel_format();\n int width, height; \/\/\/< width and height of the image in pixels\n int channels; \/\/\/< number of channels; may be 1 (greyscale) or 3 (RGB)\n \/** the raw data (1:1 dump of the PNM content, without header)\n *\/\n std::vector<unsigned char> data;\n\nprivate:\n friend std::istream& operator>>(std::istream &inputStream, Image &other);\n friend std::ostream& operator<<(std::ostream &outputStream, const Image &other);\n int channel_size; \/\/\/< width of one channel in bytes; may be 1 or 2\n};\n\nImage::Image(int width, int height, int channel_size, int channels) :\n width(width), height(height), channel_size(channel_size), channels(channels)\n{\n data.resize(width * height * channel_size * channels);\n}\n\nImage::Image(const Image &image) :\n width(image.width), height(image.height), channel_size(image.channel_size), channels(image.channels) {\n data.resize(width * height * channel_size * channels);\n}\n\nint Image::get(int x, int y, int channel) {\n if (x < 0 || x >= width || y < 0 || y >= height)\n return 0;\n int position = channel_size * (channels * (y * width + x) + channel);\n int result = static_cast<int>(data[position]);\n if (channel_size == 2)\n result = (result << 8) + static_cast<int>(data[position + 1]);\n return result;\n}\n\nint Image::get(float x, float y, int channel) {\n float dummy;\n int x0 = static_cast<int>(x);\n int y0 = static_cast<int>(y);\n float i0 = static_cast<float>(get(x0, y0, channel));\n float i1 = static_cast<float>(get(x0 + 1, y0, channel));\n float i2 = static_cast<float>(get(x0, y0 + 1, channel));\n float i3 = static_cast<float>(get(x0 + 1, y0 + 1, channel));\n float fraction_x = std::modf(x, &dummy);\n float i01 = (1 - fraction_x) * i0 + fraction_x * i1;\n float i23 = (1 - fraction_x) * i2 + fraction_x * i3;\n float fraction_y = std::modf(y, &dummy);\n return static_cast<int>(std::round((1 - fraction_y) * i01 + fraction_y * i23));\n}\n\nvoid Image::set(int x, int y, int channel, int value) {\n if (x >= 0 && x < width && y >= 0 && y < height) {\n int position = channel_size * (channels * (y * width + x) + channel);\n if (channel_size == 1)\n data[position] = static_cast<unsigned char>(value);\n else if (channel_size == 2) {\n data[position] = static_cast<unsigned char>(value >> 8);\n data[position + 1] = static_cast<unsigned char>(value & 256);\n }\n }\n}\n\nint Image::components() {\n switch (channels) {\n case 1:\n return LF_CR_1(INTENSITY);\n case 3:\n return LF_CR_3(RED, GREEN, BLUE);\n default:\n throw std::runtime_error(\"Invalid value of 'channels'.\");\n }\n}\n\nlfPixelFormat Image::pixel_format() {\n switch (channel_size) {\n case 1:\n return LF_PF_U8;\n case 2:\n return LF_PF_U16;\n default:\n throw std::runtime_error(\"Invalid value of 'channel_size'.\");\n }\n}\n\nstd::istream& operator>>(std::istream &inputStream, Image &other)\n{\n std::string magic_number;\n int maximum_color_value;\n inputStream >> magic_number;\n if (magic_number == \"P5\")\n other.channels = 1;\n else if (magic_number == \"P6\")\n other.channels = 3;\n else\n throw std::runtime_error(\"Invalid input file. Must start with 'P5' or 'P6'.\");\n inputStream >> other.width >> other.height >> maximum_color_value;\n inputStream.get(); \/\/ skip the trailing white space\n switch (maximum_color_value) {\n case 255:\n other.channel_size = 1;\n break;\n case 65535:\n other.channel_size = 2;\n break;\n default:\n throw std::runtime_error(\"Invalid PPM file: Maximum color value must be 255 or 65535.\");\n }\n size_t size = other.width * other.height * other.channel_size * other.channels;\n other.data.resize(size);\n inputStream.read(reinterpret_cast<char*>(other.data.data()), size);\n return inputStream;\n}\n\nstd::ostream& operator<<(std::ostream &outputStream, const Image &other)\n{\n outputStream << (other.channels == 3 ? \"P6\" : \"P5\") << \"\\n\"\n << other.width << \" \"\n << other.height << \"\\n\"\n << (other.channel_size == 1 ? \"255\" : \"65535\") << \"\\n\";\n outputStream.write(reinterpret_cast<const char*>(other.data.data()), other.data.size());\n return outputStream;\n}\n\nstatic PyObject *undistort(PyObject *self, PyObject *args) {\n const char *filename, *camera_make, *camera_model, *lens_make, *lens_model;\n float x0, y0, x1, y1, x2, y2, x3, y3;\n PyArg_ParseTuple(args, \"sffffffffssss\", &filename, &x0, &y0, &x1, &y1, &x2, &y2, &x3, &y3,\n &camera_make, &camera_model, &lens_make, &lens_model);\n\n lfDatabase ldb;\n\n if (ldb.Load() != LF_NO_ERROR) {\n PyErr_SetString(PyExc_RuntimeError, \"Database could not be loaded\");\n return NULL;\n }\n\n const lfCamera *camera;\n const lfCamera **cameras = ldb.FindCamerasExt(camera_make, camera_model);\n if (cameras && !cameras[1])\n camera = cameras[0];\n else {\n std::vector<char> buffer(std::snprintf(nullptr, 0, \"Cannot find unique camera in database. %i cameras found.\",\n (int)sizeof(cameras)));\n std::snprintf(&buffer[0], buffer.size(), \"Cannot find unique camera in database. %i cameras found.\",\n (int)sizeof(cameras));\n \/\/ FixMe: Is the second argument really copied on the other side?\n \/\/ Because buffer.data() will be free'ed after the return.\n PyErr_SetString(PyExc_RuntimeError, buffer.data());\n lf_free(cameras);\n return NULL;\n }\n lf_free(cameras);\n\n const lfLens *lens;\n const lfLens **lenses = ldb.FindLenses(camera, lens_make, lens_model);\n if (lenses && !lenses[1]) {\n lens = lenses[0];\n } else if (!lenses) {\n PyErr_SetString(PyExc_RuntimeError, \"Cannot find lens in database\");\n lf_free(lenses);\n return NULL;\n } else {\n PyErr_SetString(PyExc_RuntimeError, \"Lens name ambiguous\");\n lf_free(lenses);\n return NULL;\n }\n lf_free(lenses);\n\n Image image;\n {\n std::ifstream file(filename, std::ios::binary);\n file >> image;\n }\n\n lfModifier modifier(camera->CropFactor, image.width, image.height, image.pixel_format());\n lfModifier pc_coord_modifier(camera->CropFactor, image.width, image.height, image.pixel_format(), true);\n lfModifier back_modifier(camera->CropFactor, image.width, image.height, image.pixel_format(), true);\n if (!modifier.EnableDistortionCorrection(lens, 50) || !back_modifier.EnableDistortionCorrection(lens, 50) ||\n !pc_coord_modifier.EnableDistortionCorrection(lens, 50)) {\n PyErr_SetString(PyExc_RuntimeError, \"Failed to activate undistortion\");\n return NULL;\n }\n if (image.channels == 3)\n if (!modifier.EnableTCACorrection(lens, 50)) {\n PyErr_SetString(PyExc_RuntimeError, \"Failed to activate un-TCA\");\n return NULL;\n }\n std::vector<float> x, y;\n x.push_back(x0);\n y.push_back(y0);\n\n x.push_back(x2);\n y.push_back(y2);\n\n x.push_back(x1);\n y.push_back(y1);\n\n x.push_back(x3);\n y.push_back(y3);\n\n x.push_back(x0);\n y.push_back(y0);\n\n x.push_back(x1);\n y.push_back(y1);\n std::vector<float> x_undist, y_undist;\n for (int i = 0; i < x.size(); i++) {\n float result[2];\n pc_coord_modifier.ApplyGeometryDistortion(x[i], y[i], 1, 1, result);\n x_undist.push_back(result[0]);\n y_undist.push_back(result[1]);\n }\n if (!modifier.EnablePerspectiveCorrection(lens, 50, x_undist.data(), y_undist.data(), 6, 0) ||\n !back_modifier.EnablePerspectiveCorrection(lens, 50, x_undist.data(), y_undist.data(), 6, 0)) {\n PyErr_SetString(PyExc_RuntimeError, \"Failed to activate perspective correction\");\n return NULL;\n }\n\n std::vector<float> res(image.width * image.height * 2 * image.channels);\n if (image.channels == 3)\n modifier.ApplySubpixelGeometryDistortion(0, 0, image.width, image.height, res.data());\n else\n modifier.ApplyGeometryDistortion(0, 0, image.width, image.height, res.data());\n Image new_image = image;\n for (int x = 0; x < image.width; x++)\n for (int y = 0; y < image.height; y++) {\n int position = 2 * image.channels * (y * image.width + x);\n float source_x_R = res[position];\n float source_y_R = res[position + 1];\n new_image.set(x, y, 0, image.get(source_x_R, source_y_R, 0));\n if (image.channels == 3) {\n float source_x_G = res[position + 2];\n float source_y_G = res[position + 3];\n float source_x_B = res[position + 4];\n float source_y_B = res[position + 5];\n new_image.set(x, y, 1, image.get(source_x_G, source_y_G, 1));\n new_image.set(x, y, 2, image.get(source_x_B, source_y_B, 2));\n }\n }\n std::ofstream file(filename, std::ios::binary);\n file << new_image;\n\n for (int i = 0; i < 4; i++) {\n float result[2];\n back_modifier.ApplyGeometryDistortion(x[i], y[i], 1, 1, result);\n x[i] = result[0];\n y[i] = result[1];\n }\n \n return Py_BuildValue(\"ffff\", std::min(x[0], x[2]), std::min(y[0], y[1]),\n std::max(x[1], x[3]) - std::min(x[0], x[2]), std::max(y[2], y[3]) - std::min(y[0], y[1]));\n}\n\nstatic PyMethodDef UndistortMethods[] = {\n {\"undistort\", undistort, METH_VARARGS, \"Undistort PNM image data.\"},\n {NULL, NULL, 0, NULL}\n};\n\nstatic struct PyModuleDef undistortmodule = {\n PyModuleDef_HEAD_INIT, \"undistort\", NULL, -1, UndistortMethods\n};\n\nPyMODINIT_FUNC\nPyInit_undistort(void)\n{\n return PyModule_Create(&undistortmodule);\n}\n<|endoftext|>"} {"text":"<commit_before>#ifndef VSMC_CXX11_FUNCTIONAL_HPP\n#define VSMC_CXX11_FUNCTIONAL_HPP\n\n#include <vsmc\/internal\/config.hpp>\n#include <vsmc\/internal\/defines.hpp>\n\n#if VSMC_HAS_CXX11LIB_FUNCTIONAL\n\n#include <functional>\nnamespace vsmc { namespace cxx11 {\nusing std::function;\n} }\n#else \/\/ VSMC_HAS_CXX11LIB_FUNCTIONAL\n#include <boost\/function.hpp>\nnamespace vsmc { namespace cxx11 {\nusing boost::function;\n} }\n#endif \/\/ VSMC_HAS_CXX11LIB_FUNCTIONAL\n\n#endif \/\/ VSMC_CXX11_FUNCTIONAL_HPP\n<commit_msg>revert last commit<commit_after>#ifndef VSMC_CXX11_FUNCTIONAL_HPP\n#define VSMC_CXX11_FUNCTIONAL_HPP\n\n#include <vsmc\/internal\/config.hpp>\n\n#if VSMC_HAS_CXX11LIB_FUNCTIONAL\n\n#include <functional>\nnamespace vsmc { namespace cxx11 {\nusing std::function;\n} }\n#else \/\/ VSMC_HAS_CXX11LIB_FUNCTIONAL\n#include <boost\/function.hpp>\nnamespace vsmc { namespace cxx11 {\nusing boost::function;\n} }\n#endif \/\/ VSMC_HAS_CXX11LIB_FUNCTIONAL\n\n#endif \/\/ VSMC_CXX11_FUNCTIONAL_HPP\n<|endoftext|>"} {"text":"<commit_before>#ifndef VSMC_SMP_PARALLEL_GCD_HPP\n#define VSMC_SMP_PARALLEL_GCD_HPP\n\n#include <vsmc\/internal\/common.hpp>\n#include <vsmc\/smp\/base.hpp>\n#include <vsmc\/utility\/dispatch.hh>\n\nnamespace vsmc {\n\n\/\/\/ \\brief Particle::value_type subtype\n\/\/\/ \\ingroup GCD\ntemplate <unsigned Dim, typename T>\nclass StateGCD : public StateBase<Dim, T>\n{\n public :\n\n typedef StateBase<Dim, T> state_base_type;\n typedef typename state_base_type::size_type size_type;\n typedef typename state_base_type::state_type state_type;\n\n explicit StateGCD (size_type N) : StateBase<Dim, T>(N) {}\n}; \/\/ class StateGCD\n\n\/\/\/ \\brief Sampler<T>::init_type subtype\n\/\/\/ \\ingroup GCD\ntemplate <typename T, typename Derived>\nclass InitializeGCD : public InitializeBase<T, Derived>\n{\n public :\n\n typedef InitializeBase<T, Derived> initialize_base_type;\n typedef typename Particle<T>::size_type size_type;\n typedef T value_type;\n\n unsigned operator() (Particle<T> &particle, void *param)\n {\n this->initialize_param(particle, param);\n this->pre_processor(particle);\n accept_.resize(particle.size());\n work_param_ wp = {this, &particle, &accept_[0]};\n dispatch_apply_f(particle.size(),\n gcd::DispatchQueue::instance().queue(),\n (void *) &wp, work_);\n this->post_processor(particle);\n\n return std::accumulate(accept_.begin(), accept_.end(),\n static_cast<unsigned>(0));\n }\n\n protected :\n\n InitializeGCD () {}\n InitializeGCD (const InitializeGCD<T, Derived> &) {}\n InitializeGCD<T, Derived> &operator=\n (const InitializeGCD<T, Derived> &) {return *this;}\n ~InitializeGCD () {}\n\n private :\n\n std::vector<unsigned> accept_;\n\n struct work_param_\n {\n InitializeGCD<T, Derived> *const dispatcher;\n Particle<T> *const particle;\n unsigned *const accept;\n };\n\n static void work_ (void *wp, std::size_t i)\n {\n const work_param_ *const wptr =\n reinterpret_cast<const work_param_ *>(wp);\n wptr->accept[i] = wptr->dispatcher->initialize_state(\n SingleParticle<T>(static_cast<size_type>(i), wptr->particle));\n }\n}; \/\/ class InitializeGCD\n\n\/\/\/ \\brief Sampler<T>::move_type subtype\n\/\/\/ \\ingroup GCD\ntemplate <typename T, typename Derived>\nclass MoveGCD : public MoveBase<T, Derived>\n{\n public :\n\n typedef MoveBase<T, Derived> move_base_type;\n typedef typename Particle<T>::size_type size_type;\n typedef T value_type;\n\n unsigned operator() (unsigned iter, Particle<T> &particle)\n {\n this->pre_processor(iter, particle);\n accept_.resize(particle.size());\n work_param_ wp = {this, &particle, &accept_[0], iter};\n dispatch_apply_f(particle.size(),\n gcd::DispatchQueue::instance().queue(),\n (void *) &wp, work_);\n this->post_processor(iter, particle);\n\n return std::accumulate(accept_.begin(), accept_.end(),\n static_cast<unsigned>(0));\n }\n\n protected :\n\n MoveGCD () {}\n MoveGCD (const MoveGCD<T, Derived> &) {}\n MoveGCD<T, Derived> &operator=\n (const MoveGCD<T, Derived> &) {return *this;}\n ~MoveGCD () {}\n\n private :\n\n std::vector<unsigned> accept_;\n\n struct work_param_\n {\n MoveGCD<T, Derived> *const dispatcher;\n Particle<T> *const particle;\n unsigned *const accept;\n unsigned iter;\n };\n\n static void work_ (void *wp, std::size_t i)\n {\n const work_param_ *const wptr =\n reinterpret_cast<const work_param_ *>(wp);\n wptr->accept[i] = wptr->dispatcher->move_state(wptr->iter,\n SingleParticle<T>(static_cast<size_type>(i), wptr->particle));\n }\n}; \/\/ class MoveGCD\n\n\/\/\/ \\brief Monitor<T>::eval_type subtype\n\/\/\/ \\ingroup GCD\ntemplate <typename T, typename Derived>\nclass MonitorEvalGCD : public MonitorEvalBase<T, Derived>\n{\n public :\n\n typedef MonitorEvalBase<T, Derived> monitor_eval_base_type;\n typedef typename Particle<T>::size_type size_type;\n typedef T value_type;\n\n void operator() (unsigned iter, unsigned dim, const Particle<T> &particle,\n double *res)\n {\n this->pre_processor(iter, particle);\n work_param_ wp = {this, &particle, res, iter, dim};\n dispatch_apply_f(particle.size(),\n gcd::DispatchQueue::instance().queue(),\n (void *) &wp, work_);\n this->post_processor(iter, particle);\n }\n\n protected :\n\n MonitorEvalGCD () {}\n MonitorEvalGCD (const MonitorEvalGCD<T, Derived> &) {}\n MonitorEvalGCD<T, Derived> &operator=\n (const MonitorEvalGCD<T, Derived> &) {return *this;}\n ~MonitorEvalGCD () {}\n\n private :\n\n struct work_param_\n {\n MonitorEvalGCD<T, Derived> *const dispatcher;\n const Particle<T> *const particle;\n double *const res;\n unsigned iter;\n unsigned dim;\n };\n\n static void work_ (void *wp, std::size_t i)\n {\n const work_param_ *const wptr =\n reinterpret_cast<const work_param_ *>(wp);\n wptr->dispatcher->monitor_state(wptr->iter, wptr->dim,\n ConstSingleParticle<T>(\n static_cast<size_type>(i), wptr->particle),\n wptr->res + i * wptr->dim);\n }\n}; \/\/ class MonitorEvalGCD\n\n\/\/\/ \\brief Path<T>::eval_type subtype\n\/\/\/ \\ingroup GCD\ntemplate <typename T, typename Derived>\nclass PathEvalGCD : public PathEvalBase<T, Derived>\n{\n public :\n\n typedef PathEvalBase<T, Derived> path_eval_base_type;\n typedef typename Particle<T>::size_type size_type;\n typedef T value_type;\n\n double operator() (unsigned iter, const Particle<T> &particle, double *res)\n {\n this->pre_processor(iter, particle);\n work_param_ wp = {this, &particle, res, iter};\n dispatch_apply_f(particle.size(),\n gcd::DispatchQueue::instance().queue(),\n (void *) &wp, work_);\n this->post_processor(iter, particle);\n\n return this->path_width(iter, particle);\n }\n\n protected :\n\n PathEvalGCD () {}\n PathEvalGCD (const PathEvalGCD<T, Derived> &) {}\n PathEvalGCD<T, Derived> &operator=\n (const PathEvalGCD<T, Derived> &) {return *this;}\n ~PathEvalGCD () {}\n\n private :\n\n struct work_param_\n {\n PathEvalGCD<T, Derived> *const dispatcher;\n const Particle<T> *const particle;\n double *const res;\n unsigned iter;\n };\n\n static void work_ (void *wp, std::size_t i)\n {\n const work_param_ *const wptr =\n reinterpret_cast<const work_param_ *>(wp);\n wptr->res[i] = wptr->dispatcher->path_state(wptr->iter,\n ConstSingleParticle<T>(\n static_cast<size_type>(i), wptr->particle));\n }\n}; \/\/ class PathEvalGCD\n\n}\n\n#endif \/\/ VSMC_SMP_PARALLEL_GCD_HPP\n<commit_msg>fix typo<commit_after>#ifndef VSMC_SMP_PARALLEL_GCD_HPP\n#define VSMC_SMP_PARALLEL_GCD_HPP\n\n#include <vsmc\/internal\/common.hpp>\n#include <vsmc\/smp\/base.hpp>\n#include <vsmc\/utility\/dispatch.hpp>\n\nnamespace vsmc {\n\n\/\/\/ \\brief Particle::value_type subtype\n\/\/\/ \\ingroup GCD\ntemplate <unsigned Dim, typename T>\nclass StateGCD : public StateBase<Dim, T>\n{\n public :\n\n typedef StateBase<Dim, T> state_base_type;\n typedef typename state_base_type::size_type size_type;\n typedef typename state_base_type::state_type state_type;\n\n explicit StateGCD (size_type N) : StateBase<Dim, T>(N) {}\n}; \/\/ class StateGCD\n\n\/\/\/ \\brief Sampler<T>::init_type subtype\n\/\/\/ \\ingroup GCD\ntemplate <typename T, typename Derived>\nclass InitializeGCD : public InitializeBase<T, Derived>\n{\n public :\n\n typedef InitializeBase<T, Derived> initialize_base_type;\n typedef typename Particle<T>::size_type size_type;\n typedef T value_type;\n\n unsigned operator() (Particle<T> &particle, void *param)\n {\n this->initialize_param(particle, param);\n this->pre_processor(particle);\n accept_.resize(particle.size());\n work_param_ wp = {this, &particle, &accept_[0]};\n dispatch_apply_f(particle.size(),\n gcd::DispatchQueue::instance().queue(),\n (void *) &wp, work_);\n this->post_processor(particle);\n\n return std::accumulate(accept_.begin(), accept_.end(),\n static_cast<unsigned>(0));\n }\n\n protected :\n\n InitializeGCD () {}\n InitializeGCD (const InitializeGCD<T, Derived> &) {}\n InitializeGCD<T, Derived> &operator=\n (const InitializeGCD<T, Derived> &) {return *this;}\n ~InitializeGCD () {}\n\n private :\n\n std::vector<unsigned> accept_;\n\n struct work_param_\n {\n InitializeGCD<T, Derived> *const dispatcher;\n Particle<T> *const particle;\n unsigned *const accept;\n };\n\n static void work_ (void *wp, std::size_t i)\n {\n const work_param_ *const wptr =\n reinterpret_cast<const work_param_ *>(wp);\n wptr->accept[i] = wptr->dispatcher->initialize_state(\n SingleParticle<T>(static_cast<size_type>(i), wptr->particle));\n }\n}; \/\/ class InitializeGCD\n\n\/\/\/ \\brief Sampler<T>::move_type subtype\n\/\/\/ \\ingroup GCD\ntemplate <typename T, typename Derived>\nclass MoveGCD : public MoveBase<T, Derived>\n{\n public :\n\n typedef MoveBase<T, Derived> move_base_type;\n typedef typename Particle<T>::size_type size_type;\n typedef T value_type;\n\n unsigned operator() (unsigned iter, Particle<T> &particle)\n {\n this->pre_processor(iter, particle);\n accept_.resize(particle.size());\n work_param_ wp = {this, &particle, &accept_[0], iter};\n dispatch_apply_f(particle.size(),\n gcd::DispatchQueue::instance().queue(),\n (void *) &wp, work_);\n this->post_processor(iter, particle);\n\n return std::accumulate(accept_.begin(), accept_.end(),\n static_cast<unsigned>(0));\n }\n\n protected :\n\n MoveGCD () {}\n MoveGCD (const MoveGCD<T, Derived> &) {}\n MoveGCD<T, Derived> &operator=\n (const MoveGCD<T, Derived> &) {return *this;}\n ~MoveGCD () {}\n\n private :\n\n std::vector<unsigned> accept_;\n\n struct work_param_\n {\n MoveGCD<T, Derived> *const dispatcher;\n Particle<T> *const particle;\n unsigned *const accept;\n unsigned iter;\n };\n\n static void work_ (void *wp, std::size_t i)\n {\n const work_param_ *const wptr =\n reinterpret_cast<const work_param_ *>(wp);\n wptr->accept[i] = wptr->dispatcher->move_state(wptr->iter,\n SingleParticle<T>(static_cast<size_type>(i), wptr->particle));\n }\n}; \/\/ class MoveGCD\n\n\/\/\/ \\brief Monitor<T>::eval_type subtype\n\/\/\/ \\ingroup GCD\ntemplate <typename T, typename Derived>\nclass MonitorEvalGCD : public MonitorEvalBase<T, Derived>\n{\n public :\n\n typedef MonitorEvalBase<T, Derived> monitor_eval_base_type;\n typedef typename Particle<T>::size_type size_type;\n typedef T value_type;\n\n void operator() (unsigned iter, unsigned dim, const Particle<T> &particle,\n double *res)\n {\n this->pre_processor(iter, particle);\n work_param_ wp = {this, &particle, res, iter, dim};\n dispatch_apply_f(particle.size(),\n gcd::DispatchQueue::instance().queue(),\n (void *) &wp, work_);\n this->post_processor(iter, particle);\n }\n\n protected :\n\n MonitorEvalGCD () {}\n MonitorEvalGCD (const MonitorEvalGCD<T, Derived> &) {}\n MonitorEvalGCD<T, Derived> &operator=\n (const MonitorEvalGCD<T, Derived> &) {return *this;}\n ~MonitorEvalGCD () {}\n\n private :\n\n struct work_param_\n {\n MonitorEvalGCD<T, Derived> *const dispatcher;\n const Particle<T> *const particle;\n double *const res;\n unsigned iter;\n unsigned dim;\n };\n\n static void work_ (void *wp, std::size_t i)\n {\n const work_param_ *const wptr =\n reinterpret_cast<const work_param_ *>(wp);\n wptr->dispatcher->monitor_state(wptr->iter, wptr->dim,\n ConstSingleParticle<T>(\n static_cast<size_type>(i), wptr->particle),\n wptr->res + i * wptr->dim);\n }\n}; \/\/ class MonitorEvalGCD\n\n\/\/\/ \\brief Path<T>::eval_type subtype\n\/\/\/ \\ingroup GCD\ntemplate <typename T, typename Derived>\nclass PathEvalGCD : public PathEvalBase<T, Derived>\n{\n public :\n\n typedef PathEvalBase<T, Derived> path_eval_base_type;\n typedef typename Particle<T>::size_type size_type;\n typedef T value_type;\n\n double operator() (unsigned iter, const Particle<T> &particle, double *res)\n {\n this->pre_processor(iter, particle);\n work_param_ wp = {this, &particle, res, iter};\n dispatch_apply_f(particle.size(),\n gcd::DispatchQueue::instance().queue(),\n (void *) &wp, work_);\n this->post_processor(iter, particle);\n\n return this->path_width(iter, particle);\n }\n\n protected :\n\n PathEvalGCD () {}\n PathEvalGCD (const PathEvalGCD<T, Derived> &) {}\n PathEvalGCD<T, Derived> &operator=\n (const PathEvalGCD<T, Derived> &) {return *this;}\n ~PathEvalGCD () {}\n\n private :\n\n struct work_param_\n {\n PathEvalGCD<T, Derived> *const dispatcher;\n const Particle<T> *const particle;\n double *const res;\n unsigned iter;\n };\n\n static void work_ (void *wp, std::size_t i)\n {\n const work_param_ *const wptr =\n reinterpret_cast<const work_param_ *>(wp);\n wptr->res[i] = wptr->dispatcher->path_state(wptr->iter,\n ConstSingleParticle<T>(\n static_cast<size_type>(i), wptr->particle));\n }\n}; \/\/ class PathEvalGCD\n\n}\n\n#endif \/\/ VSMC_SMP_PARALLEL_GCD_HPP\n<|endoftext|>"} {"text":"<commit_before>#ifndef VSMC_SMP_PARALLEL_TBB_HPP\n#define VSMC_SMP_PARALLEL_TBB_HPP\n\n#if defined(__clang__) && !defined(_LIBCPP_VERSION) && (__GLIBCXX__ < 20100429)\n#ifndef TBB_USE_CAPTURED_EXCEPTION\n#define TBB_USE_CAPTURED_EXCEPTION 1\n#endif\n#endif \/\/ __clang__\n\n#include <vsmc\/smp\/base.hpp>\n#include <tbb\/tbb.h>\n\nnamespace vsmc {\n\n\/\/\/ \\brief Particle::value_type subtype\n\/\/\/ \\ingroup TBB\ntemplate <std::size_t Dim, typename T>\nclass StateTBB : public StateBase<Dim, T>\n{\n public :\n\n typedef StateBase<Dim, T> state_base_type;\n typedef typename state_base_type::size_type size_type;\n typedef typename state_base_type::state_type state_type;\n\n explicit StateTBB (size_type N) : StateBase<Dim, T>(N) {}\n\n template <typename IntType>\n void copy (size_type N, const IntType *copy_from)\n {\n VSMC_RUNTIME_ASSERT_STATE_COPY_SIZE_MISMATCH(TBB);\n\n tbb::parallel_for(tbb::blocked_range<size_type>(0, this->size()),\n copy_work_<IntType>(this, copy_from));\n }\n\n private :\n\n template <typename IntType>\n class copy_work_\n {\n public :\n\n copy_work_ (StateTBB<Dim, T> *state, const IntType *copy_from) :\n state_(state), copy_from_(copy_from) {}\n\n void operator() (const tbb::blocked_range<size_type> &range) const\n {\n for (size_type to = range.begin(); to != range.end(); ++to)\n state_->copy_particle(copy_from_[to], to);\n }\n\n private :\n\n StateTBB<Dim, T> *const state_;\n const IntType *const copy_from_;\n }; \/\/ class copy_work_\n}; \/\/ class StateTBB\n\n\/\/\/ \\brief Sampler<T>::init_type subtype\n\/\/\/ \\ingroup TBB\ntemplate <typename T, typename Derived>\nclass InitializeTBB : public InitializeBase<T, Derived>\n{\n public :\n\n typedef InitializeBase<T, Derived> initialize_base_type;\n typedef typename Particle<T>::size_type size_type;\n typedef T value_type;\n\n std::size_t operator() (Particle<T> &particle, void *param)\n {\n this->initialize_param(particle, param);\n this->pre_processor(particle);\n work_ work(this, &particle);\n tbb::parallel_reduce(tbb::blocked_range<size_type>(\n 0, particle.size()), work);\n this->post_processor(particle);\n\n return work.accept();\n }\n\n protected :\n\n InitializeTBB () {}\n InitializeTBB (const InitializeTBB<T, Derived> &) {}\n InitializeTBB<T, Derived> &operator=\n (const InitializeTBB<T, Derived> &) {return *this;}\n ~InitializeTBB () {}\n\n private :\n\n class work_\n {\n public :\n\n work_ (InitializeTBB<T, Derived> *init,\n Particle<T> *particle) :\n init_(init), particle_(particle), accept_(0) {}\n\n work_ (const work_ &other, tbb::split) :\n init_(other.init_), particle_(other.particle_), accept_(0) {}\n\n void operator() (const tbb::blocked_range<size_type> &range)\n {\n std::size_t acc = accept_;\n for (size_type i = range.begin(); i != range.end(); ++i) {\n acc += init_->initialize_state(\n SingleParticle<T>(i, particle_));\n }\n accept_ = acc;\n }\n\n void join (const work_ &other)\n {\n accept_ += other.accept_;\n }\n\n std::size_t accept () const\n {\n return accept_;\n }\n\n private :\n\n InitializeTBB<T, Derived> *const init_;\n Particle<T> *const particle_;\n std::size_t accept_;\n }; \/\/ class work_\n}; \/\/ class InitializeTBB\n\n\/\/\/ \\brief Sampler<T>::move_type subtype\n\/\/\/ \\ingroup TBB\ntemplate <typename T, typename Derived>\nclass MoveTBB : public MoveBase<T, Derived>\n{\n public :\n\n typedef MoveBase<T, Derived> move_base_type;\n typedef typename Particle<T>::size_type size_type;\n typedef T value_type;\n\n std::size_t operator() (std::size_t iter, Particle<T> &particle)\n {\n this->pre_processor(iter, particle);\n work_ work(this, iter, &particle);\n tbb::parallel_reduce(tbb::blocked_range<size_type>(\n 0, particle.size()), work);\n this->post_processor(iter, particle);\n\n return work.accept();\n }\n\n protected :\n\n MoveTBB () {}\n MoveTBB (const MoveTBB<T, Derived> &) {}\n MoveTBB<T, Derived> &operator=\n (const MoveTBB<T, Derived> &) {return *this;}\n ~MoveTBB () {}\n\n private :\n\n class work_\n {\n public :\n\n work_ (MoveTBB<T, Derived> *move, std::size_t iter,\n Particle<T> *particle):\n move_(move), iter_(iter), particle_(particle), accept_(0) {}\n\n work_ (const work_ &other, tbb::split) :\n move_(other.move_), iter_(other.iter_),\n particle_(other.particle_), accept_(0) {}\n\n void operator() (const tbb::blocked_range<size_type> &range)\n {\n std::size_t acc = accept_;\n for (size_type i = range.begin(); i != range.end(); ++i) {\n acc += move_->move_state(iter_,\n SingleParticle<T>(i, particle_));\n }\n accept_ = acc;\n }\n\n void join (const work_ &other)\n {\n accept_ += other.accept_;\n }\n\n std::size_t accept () const\n {\n return accept_;\n }\n\n private :\n\n MoveTBB<T, Derived> *const move_;\n const std::size_t iter_;\n Particle<T> *const particle_;\n std::size_t accept_;\n }; \/\/ class work_\n}; \/\/ class MoveTBB\n\n\/\/\/ \\brief Monitor<T>::eval_type subtype\n\/\/\/ \\ingroup TBB\ntemplate <typename T, typename Derived>\nclass MonitorEvalTBB : public MonitorEvalBase<T, Derived>\n{\n public :\n\n typedef MonitorEvalBase<T, Derived> monitor_eval_base_type;\n typedef typename Particle<T>::size_type size_type;\n typedef T value_type;\n\n void operator() (std::size_t iter, std::size_t dim,\n const Particle<T> &particle, double *res)\n {\n this->pre_processor(iter, particle);\n tbb::parallel_for(tbb::blocked_range<size_type>(0, particle.size()),\n work_(this, iter, dim, &particle, res));\n this->post_processor(iter, particle);\n }\n\n protected :\n\n MonitorEvalTBB () {}\n MonitorEvalTBB (const MonitorEvalTBB<T, Derived> &) {}\n MonitorEvalTBB<T, Derived> &operator=\n (const MonitorEvalTBB<T, Derived> &) {return *this;}\n ~MonitorEvalTBB () {}\n\n private :\n\n class work_\n {\n public :\n\n work_ (MonitorEvalTBB<T, Derived> *monitor,\n std::size_t iter, std::size_t dim,\n const Particle<T> *particle, double *res) :\n monitor_(monitor), particle_(particle), res_(res),\n iter_(iter), dim_(dim) {}\n\n void operator() (const tbb::blocked_range<size_type> &range) const\n {\n for (size_type i = range.begin(); i != range.end(); ++i) {\n monitor_->monitor_state(iter_, dim_,\n ConstSingleParticle<T>(i, particle_), res_ + i * dim_);\n }\n }\n\n private :\n\n MonitorEvalTBB<T, Derived> *const monitor_;\n const Particle<T> *const particle_;\n double *const res_;\n const std::size_t iter_;\n const std::size_t dim_;\n }; \/\/ class work_\n}; \/\/ class MonitorEvalTBB\n\n\/\/\/ \\brief Path<T>::eval_type subtype\n\/\/\/ \\ingroup TBB\ntemplate <typename T, typename Derived>\nclass PathEvalTBB : public PathEvalBase<T, Derived>\n{\n public :\n\n typedef PathEvalBase<T, Derived> path_eval_base_type;\n typedef typename Particle<T>::size_type size_type;\n typedef T value_type;\n\n double operator() (std::size_t iter, const Particle<T> &particle,\n double *res)\n {\n this->pre_processor(iter, particle);\n tbb::parallel_for(tbb::blocked_range<size_type>(0, particle.size()),\n work_(this, iter, &particle, res));\n this->post_processor(iter, particle);\n\n return this->path_grid(iter, particle);\n }\n\n protected :\n\n PathEvalTBB () {}\n PathEvalTBB (const PathEvalTBB<T, Derived> &) {}\n PathEvalTBB<T, Derived> &operator=\n (const PathEvalTBB<T, Derived> &) {return *this;}\n ~PathEvalTBB () {}\n\n private :\n\n class work_\n {\n public :\n\n work_ (PathEvalTBB<T, Derived> *path, std::size_t iter,\n const Particle<T> *particle, double *res) :\n path_(path), particle_(particle), res_(res), iter_(iter) {}\n\n void operator() (const tbb::blocked_range<size_type> &range) const\n {\n for (size_type i = range.begin(); i != range.end(); ++i) {\n res_[i] = path_->path_state(iter_,\n ConstSingleParticle<T>(i, particle_));\n }\n }\n\n private :\n\n PathEvalTBB<T, Derived> *const path_;\n const Particle<T> *const particle_;\n double *const res_;\n const std::size_t iter_;\n }; \/\/ class work_\n}; \/\/ PathEvalTBB\n\n} \/\/ namespace vsmc\n\n#endif \/\/ VSMC_SMP_PARALLEL_TBB_HPP\n<commit_msg>reorder tbb work item layout<commit_after>#ifndef VSMC_SMP_PARALLEL_TBB_HPP\n#define VSMC_SMP_PARALLEL_TBB_HPP\n\n#if defined(__clang__) && !defined(_LIBCPP_VERSION) && (__GLIBCXX__ < 20100429)\n#ifndef TBB_USE_CAPTURED_EXCEPTION\n#define TBB_USE_CAPTURED_EXCEPTION 1\n#endif\n#endif \/\/ __clang__\n\n#include <vsmc\/smp\/base.hpp>\n#include <tbb\/tbb.h>\n\nnamespace vsmc {\n\n\/\/\/ \\brief Particle::value_type subtype\n\/\/\/ \\ingroup TBB\ntemplate <std::size_t Dim, typename T>\nclass StateTBB : public StateBase<Dim, T>\n{\n public :\n\n typedef StateBase<Dim, T> state_base_type;\n typedef typename state_base_type::size_type size_type;\n typedef typename state_base_type::state_type state_type;\n\n explicit StateTBB (size_type N) : StateBase<Dim, T>(N) {}\n\n template <typename IntType>\n void copy (size_type N, const IntType *copy_from)\n {\n VSMC_RUNTIME_ASSERT_STATE_COPY_SIZE_MISMATCH(TBB);\n\n tbb::parallel_for(tbb::blocked_range<size_type>(0, this->size()),\n copy_work_<IntType>(this, copy_from));\n }\n\n private :\n\n template <typename IntType>\n class copy_work_\n {\n public :\n\n copy_work_ (StateTBB<Dim, T> *state, const IntType *copy_from) :\n state_(state), copy_from_(copy_from) {}\n\n void operator() (const tbb::blocked_range<size_type> &range) const\n {\n for (size_type to = range.begin(); to != range.end(); ++to)\n state_->copy_particle(copy_from_[to], to);\n }\n\n private :\n\n StateTBB<Dim, T> *const state_;\n const IntType *const copy_from_;\n }; \/\/ class copy_work_\n}; \/\/ class StateTBB\n\n\/\/\/ \\brief Sampler<T>::init_type subtype\n\/\/\/ \\ingroup TBB\ntemplate <typename T, typename Derived>\nclass InitializeTBB : public InitializeBase<T, Derived>\n{\n public :\n\n typedef InitializeBase<T, Derived> initialize_base_type;\n typedef typename Particle<T>::size_type size_type;\n typedef T value_type;\n\n std::size_t operator() (Particle<T> &particle, void *param)\n {\n this->initialize_param(particle, param);\n this->pre_processor(particle);\n work_ work(this, &particle);\n tbb::parallel_reduce(tbb::blocked_range<size_type>(\n 0, particle.size()), work);\n this->post_processor(particle);\n\n return work.accept();\n }\n\n protected :\n\n InitializeTBB () {}\n InitializeTBB (const InitializeTBB<T, Derived> &) {}\n InitializeTBB<T, Derived> &operator=\n (const InitializeTBB<T, Derived> &) {return *this;}\n ~InitializeTBB () {}\n\n private :\n\n class work_\n {\n public :\n\n work_ (InitializeTBB<T, Derived> *init,\n Particle<T> *particle) :\n init_(init), particle_(particle), accept_(0) {}\n\n work_ (const work_ &other, tbb::split) :\n init_(other.init_), particle_(other.particle_), accept_(0) {}\n\n void operator() (const tbb::blocked_range<size_type> &range)\n {\n std::size_t acc = accept_;\n for (size_type i = range.begin(); i != range.end(); ++i) {\n acc += init_->initialize_state(\n SingleParticle<T>(i, particle_));\n }\n accept_ = acc;\n }\n\n void join (const work_ &other)\n {\n accept_ += other.accept_;\n }\n\n std::size_t accept () const\n {\n return accept_;\n }\n\n private :\n\n InitializeTBB<T, Derived> *const init_;\n Particle<T> *const particle_;\n std::size_t accept_;\n }; \/\/ class work_\n}; \/\/ class InitializeTBB\n\n\/\/\/ \\brief Sampler<T>::move_type subtype\n\/\/\/ \\ingroup TBB\ntemplate <typename T, typename Derived>\nclass MoveTBB : public MoveBase<T, Derived>\n{\n public :\n\n typedef MoveBase<T, Derived> move_base_type;\n typedef typename Particle<T>::size_type size_type;\n typedef T value_type;\n\n std::size_t operator() (std::size_t iter, Particle<T> &particle)\n {\n this->pre_processor(iter, particle);\n work_ work(this, iter, &particle);\n tbb::parallel_reduce(tbb::blocked_range<size_type>(\n 0, particle.size()), work);\n this->post_processor(iter, particle);\n\n return work.accept();\n }\n\n protected :\n\n MoveTBB () {}\n MoveTBB (const MoveTBB<T, Derived> &) {}\n MoveTBB<T, Derived> &operator=\n (const MoveTBB<T, Derived> &) {return *this;}\n ~MoveTBB () {}\n\n private :\n\n class work_\n {\n public :\n\n work_ (MoveTBB<T, Derived> *move, std::size_t iter,\n Particle<T> *particle):\n move_(move), iter_(iter), particle_(particle), accept_(0) {}\n\n work_ (const work_ &other, tbb::split) :\n move_(other.move_), iter_(other.iter_),\n particle_(other.particle_), accept_(0) {}\n\n void operator() (const tbb::blocked_range<size_type> &range)\n {\n std::size_t acc = accept_;\n for (size_type i = range.begin(); i != range.end(); ++i) {\n acc += move_->move_state(iter_,\n SingleParticle<T>(i, particle_));\n }\n accept_ = acc;\n }\n\n void join (const work_ &other)\n {\n accept_ += other.accept_;\n }\n\n std::size_t accept () const\n {\n return accept_;\n }\n\n private :\n\n MoveTBB<T, Derived> *const move_;\n const std::size_t iter_;\n Particle<T> *const particle_;\n std::size_t accept_;\n }; \/\/ class work_\n}; \/\/ class MoveTBB\n\n\/\/\/ \\brief Monitor<T>::eval_type subtype\n\/\/\/ \\ingroup TBB\ntemplate <typename T, typename Derived>\nclass MonitorEvalTBB : public MonitorEvalBase<T, Derived>\n{\n public :\n\n typedef MonitorEvalBase<T, Derived> monitor_eval_base_type;\n typedef typename Particle<T>::size_type size_type;\n typedef T value_type;\n\n void operator() (std::size_t iter, std::size_t dim,\n const Particle<T> &particle, double *res)\n {\n this->pre_processor(iter, particle);\n tbb::parallel_for(tbb::blocked_range<size_type>(0, particle.size()),\n work_(this, iter, dim, &particle, res));\n this->post_processor(iter, particle);\n }\n\n protected :\n\n MonitorEvalTBB () {}\n MonitorEvalTBB (const MonitorEvalTBB<T, Derived> &) {}\n MonitorEvalTBB<T, Derived> &operator=\n (const MonitorEvalTBB<T, Derived> &) {return *this;}\n ~MonitorEvalTBB () {}\n\n private :\n\n class work_\n {\n public :\n\n work_ (MonitorEvalTBB<T, Derived> *monitor,\n std::size_t iter, std::size_t dim,\n const Particle<T> *particle, double *res) :\n monitor_(monitor), iter_(iter), dim_(dim),\n particle_(particle), res_(res) {}\n\n void operator() (const tbb::blocked_range<size_type> &range) const\n {\n for (size_type i = range.begin(); i != range.end(); ++i) {\n monitor_->monitor_state(iter_, dim_,\n ConstSingleParticle<T>(i, particle_), res_ + i * dim_);\n }\n }\n\n private :\n\n MonitorEvalTBB<T, Derived> *const monitor_;\n const std::size_t iter_;\n const std::size_t dim_;\n const Particle<T> *const particle_;\n double *const res_;\n }; \/\/ class work_\n}; \/\/ class MonitorEvalTBB\n\n\/\/\/ \\brief Path<T>::eval_type subtype\n\/\/\/ \\ingroup TBB\ntemplate <typename T, typename Derived>\nclass PathEvalTBB : public PathEvalBase<T, Derived>\n{\n public :\n\n typedef PathEvalBase<T, Derived> path_eval_base_type;\n typedef typename Particle<T>::size_type size_type;\n typedef T value_type;\n\n double operator() (std::size_t iter, const Particle<T> &particle,\n double *res)\n {\n this->pre_processor(iter, particle);\n tbb::parallel_for(tbb::blocked_range<size_type>(0, particle.size()),\n work_(this, iter, &particle, res));\n this->post_processor(iter, particle);\n\n return this->path_grid(iter, particle);\n }\n\n protected :\n\n PathEvalTBB () {}\n PathEvalTBB (const PathEvalTBB<T, Derived> &) {}\n PathEvalTBB<T, Derived> &operator=\n (const PathEvalTBB<T, Derived> &) {return *this;}\n ~PathEvalTBB () {}\n\n private :\n\n class work_\n {\n public :\n\n work_ (PathEvalTBB<T, Derived> *path, std::size_t iter,\n const Particle<T> *particle, double *res) :\n path_(path), iter_(iter), particle_(particle), res_(res) {}\n\n void operator() (const tbb::blocked_range<size_type> &range) const\n {\n for (size_type i = range.begin(); i != range.end(); ++i) {\n res_[i] = path_->path_state(iter_,\n ConstSingleParticle<T>(i, particle_));\n }\n }\n\n private :\n\n PathEvalTBB<T, Derived> *const path_;\n const std::size_t iter_;\n const Particle<T> *const particle_;\n double *const res_;\n }; \/\/ class work_\n}; \/\/ PathEvalTBB\n\n} \/\/ namespace vsmc\n\n#endif \/\/ VSMC_SMP_PARALLEL_TBB_HPP\n<|endoftext|>"} {"text":"<commit_before>\/***************************************************************************\n* Copyright (c) 2017, Sylvain Corlay and Johan Mabille *\n* *\n* Distributed under the terms of the BSD 3-Clause License. *\n* *\n* The full license is in the file LICENSE, distributed with this software. *\n****************************************************************************\/\n\n#ifndef XWIDGETS_MATERIALIZE_HPP\n#define XWIDGETS_MATERIALIZE_HPP\n\n#include <utility>\n\nnamespace xw\n{\n \/****************************\n * xmaterialize declaration *\n ****************************\/\n\n template <template <class> class B, class... P>\n class xmaterialize final : public B<xmaterialize<B, P...>>\n {\n public:\n\n using self_type = xmaterialize<B, P...>;\n using base_type = B<self_type>;\n\n template <class... A>\n xmaterialize(A&&...);\n ~xmaterialize();\n\n xmaterialize(const xmaterialize&);\n xmaterialize& operator=(const xmaterialize&);\n\n xmaterialize(xmaterialize&&);\n xmaterialize& operator=(xmaterialize&&);\n };\n\n \/**************************\n * xgenerator declaration *\n **************************\/\n\n template <template <class> class B, class... P>\n class xgenerator final : public B<xgenerator<B, P...>>\n {\n public:\n\n using self_type = xgenerator<B, P...>;\n using base_type = B<self_type>;\n\n template <class... A>\n xgenerator(A&&...);\n\n xgenerator(const xgenerator&);\n xgenerator& operator=(const xgenerator&);\n\n xgenerator(xgenerator&&);\n xgenerator& operator=(xgenerator&&);\n\n xmaterialize<B, P...> finalize() &&;\n };\n\n \/******************\n * xconcrete_type *\n ******************\/\n\n template <class D>\n struct xconcrete_type\n {\n using type = D;\n };\n\n template <template <class> class B, class... P>\n struct xconcrete_type<xgenerator<B, P...>>\n {\n using type = xmaterialize<B, P...>;\n };\n\n template <class D>\n using xconcrete_type_t = typename xconcrete_type<D>::type;\n\n \/*******************************\n * xmaterialize implementation *\n *******************************\/\n\n template <template <class> class B, class... P>\n template <class... A>\n inline xmaterialize<B, P...>::xmaterialize(A&&... args)\n : base_type(std::forward<A>(args)...)\n {\n this->open();\n }\n\n template <template <class> class B, class... P>\n inline xmaterialize<B, P...>::~xmaterialize()\n {\n if (!this->moved_from())\n {\n this->close();\n }\n }\n\n template <template <class> class B, class... P>\n inline xmaterialize<B, P...>::xmaterialize(const xmaterialize& rhs)\n : base_type(rhs)\n {\n this->open();\n }\n\n template <template <class> class B, class... P>\n inline xmaterialize<B, P...>& xmaterialize<B, P...>::operator=(const xmaterialize& rhs)\n {\n this->close();\n base_type::operator=(rhs);\n this->open();\n return *this;\n }\n\n template <template <class> class B, class... P>\n inline xmaterialize<B, P...>::xmaterialize(xmaterialize&&) = default;\n\n template <template <class> class B, class... P>\n inline xmaterialize<B, P...>& xmaterialize<B, P...>::operator=(xmaterialize&& rhs) = default;\n\n \/*****************************\n * xgenerator implementation *\n *****************************\/\n\n template <template <class> class B, class... P>\n template <class... A>\n inline xgenerator<B, P...>::xgenerator(A&&... args)\n : base_type(std::forward<A>(args)...)\n {\n }\n\n template <template <class> class B, class... P>\n inline xmaterialize<B, P...> xgenerator<B, P...>::finalize() &&\n {\n return reinterpret_cast<typename xmaterialize<B, P...>::base_type&&>(*this);\n }\n\n template <template <class> class B, class... P>\n inline xgenerator<B, P...>::xgenerator(const xgenerator&) = default;\n\n template <template <class> class B, class... P>\n inline xgenerator<B, P...>& xgenerator<B, P...>::operator=(const xgenerator&) = default;\n\n template <template <class> class B, class... P>\n inline xgenerator<B, P...>::xgenerator(xgenerator&&) = default;\n\n template <template <class> class B, class... P>\n inline xgenerator<B, P...>& xgenerator<B, P...>::operator=(xgenerator&&) = default;\n}\n\n#include \"xeus\/xjson.hpp\"\n#include \"xwidgets_config.hpp\"\n\nnamespace xw\n{\n \/***********************************************************\n * Specialization of cling::printValue for Jupyter Widgets *\n ***********************************************************\/\n\n template <template <class> class B, class... P>\n xeus::xjson mime_bundle_repr(const xmaterialize<B, P...>* val)\n {\n xeus::xjson mime_bundle;\n\n \/\/ application\/vnd.jupyter.widget-view+json\n xeus::xjson widgets_json;\n widgets_json[\"version_major\"] = XWIDGETS_PROTOCOL_VERSION_MAJOR;\n widgets_json[\"version_minor\"] = XWIDGETS_PROTOCOL_VERSION_MINOR;\n widgets_json[\"model_id\"] = val->id();\n mime_bundle[\"application\/vnd.jupyter.widget-view+json\"] = std::move(widgets_json);\n\n \/\/ text\/plain\n mime_bundle[\"text\/plain\"] = \"A Jupyter widget\";\n return mime_bundle;\n }\n}\n\n#endif\n<commit_msg>Update to xeus-cling 0.2.1<commit_after>\/***************************************************************************\n* Copyright (c) 2017, Sylvain Corlay and Johan Mabille *\n* *\n* Distributed under the terms of the BSD 3-Clause License. *\n* *\n* The full license is in the file LICENSE, distributed with this software. *\n****************************************************************************\/\n\n#ifndef XWIDGETS_MATERIALIZE_HPP\n#define XWIDGETS_MATERIALIZE_HPP\n\n#include <utility>\n\nnamespace xw\n{\n \/****************************\n * xmaterialize declaration *\n ****************************\/\n\n template <template <class> class B, class... P>\n class xmaterialize final : public B<xmaterialize<B, P...>>\n {\n public:\n\n using self_type = xmaterialize<B, P...>;\n using base_type = B<self_type>;\n\n template <class... A>\n xmaterialize(A&&...);\n ~xmaterialize();\n\n xmaterialize(const xmaterialize&);\n xmaterialize& operator=(const xmaterialize&);\n\n xmaterialize(xmaterialize&&);\n xmaterialize& operator=(xmaterialize&&);\n };\n\n \/**************************\n * xgenerator declaration *\n **************************\/\n\n template <template <class> class B, class... P>\n class xgenerator final : public B<xgenerator<B, P...>>\n {\n public:\n\n using self_type = xgenerator<B, P...>;\n using base_type = B<self_type>;\n\n template <class... A>\n xgenerator(A&&...);\n\n xgenerator(const xgenerator&);\n xgenerator& operator=(const xgenerator&);\n\n xgenerator(xgenerator&&);\n xgenerator& operator=(xgenerator&&);\n\n xmaterialize<B, P...> finalize() &&;\n };\n\n \/******************\n * xconcrete_type *\n ******************\/\n\n template <class D>\n struct xconcrete_type\n {\n using type = D;\n };\n\n template <template <class> class B, class... P>\n struct xconcrete_type<xgenerator<B, P...>>\n {\n using type = xmaterialize<B, P...>;\n };\n\n template <class D>\n using xconcrete_type_t = typename xconcrete_type<D>::type;\n\n \/*******************************\n * xmaterialize implementation *\n *******************************\/\n\n template <template <class> class B, class... P>\n template <class... A>\n inline xmaterialize<B, P...>::xmaterialize(A&&... args)\n : base_type(std::forward<A>(args)...)\n {\n this->open();\n }\n\n template <template <class> class B, class... P>\n inline xmaterialize<B, P...>::~xmaterialize()\n {\n if (!this->moved_from())\n {\n this->close();\n }\n }\n\n template <template <class> class B, class... P>\n inline xmaterialize<B, P...>::xmaterialize(const xmaterialize& rhs)\n : base_type(rhs)\n {\n this->open();\n }\n\n template <template <class> class B, class... P>\n inline xmaterialize<B, P...>& xmaterialize<B, P...>::operator=(const xmaterialize& rhs)\n {\n this->close();\n base_type::operator=(rhs);\n this->open();\n return *this;\n }\n\n template <template <class> class B, class... P>\n inline xmaterialize<B, P...>::xmaterialize(xmaterialize&&) = default;\n\n template <template <class> class B, class... P>\n inline xmaterialize<B, P...>& xmaterialize<B, P...>::operator=(xmaterialize&& rhs) = default;\n\n \/*****************************\n * xgenerator implementation *\n *****************************\/\n\n template <template <class> class B, class... P>\n template <class... A>\n inline xgenerator<B, P...>::xgenerator(A&&... args)\n : base_type(std::forward<A>(args)...)\n {\n }\n\n template <template <class> class B, class... P>\n inline xmaterialize<B, P...> xgenerator<B, P...>::finalize() &&\n {\n return reinterpret_cast<typename xmaterialize<B, P...>::base_type&&>(*this);\n }\n\n template <template <class> class B, class... P>\n inline xgenerator<B, P...>::xgenerator(const xgenerator&) = default;\n\n template <template <class> class B, class... P>\n inline xgenerator<B, P...>& xgenerator<B, P...>::operator=(const xgenerator&) = default;\n\n template <template <class> class B, class... P>\n inline xgenerator<B, P...>::xgenerator(xgenerator&&) = default;\n\n template <template <class> class B, class... P>\n inline xgenerator<B, P...>& xgenerator<B, P...>::operator=(xgenerator&&) = default;\n}\n\n#include \"xeus\/xjson.hpp\"\n#include \"xwidgets_config.hpp\"\n\nnamespace xw\n{\n \/***********************************************************\n * Specialization of cling::printValue for Jupyter Widgets *\n ***********************************************************\/\n\n template <template <class> class B, class... P>\n xeus::xjson mime_bundle_repr(const xmaterialize<B, P...>& val)\n {\n xeus::xjson mime_bundle;\n\n \/\/ application\/vnd.jupyter.widget-view+json\n xeus::xjson widgets_json;\n widgets_json[\"version_major\"] = XWIDGETS_PROTOCOL_VERSION_MAJOR;\n widgets_json[\"version_minor\"] = XWIDGETS_PROTOCOL_VERSION_MINOR;\n widgets_json[\"model_id\"] = val.id();\n mime_bundle[\"application\/vnd.jupyter.widget-view+json\"] = std::move(widgets_json);\n\n \/\/ text\/plain\n mime_bundle[\"text\/plain\"] = \"A Jupyter widget\";\n return mime_bundle;\n }\n}\n\n#endif\n<|endoftext|>"} {"text":"<commit_before>#include \"stdafx.h\"\n#include \"texture_bank.h\"\n\n#include \"asdf_multiplat\/data\/gl_resources.h\"\n#include \"asdf_multiplat\/utilities\/utilities.h\"\n#include \"asdf_multiplat\/utilities\/cjson_utils.hpp\"\n\nusing namespace std;\n\nnamespace asdf\n{\n using namespace util;\n\nnamespace hexmap {\nnamespace data\n{\n\n texture_bank_t::texture_bank_t()\n : atlas_texture(\"hex texture atlas\", nullptr, hex_atlas_dim, hex_atlas_dim)\n {\n ASSERT(!CheckGLError(), \"GL Error Before Initializing texture_bank_t\");\n\n {\n GL_State->bind(atlas_fbo);\n glFramebufferTexture(GL_FRAMEBUFFER, GL_COLOR_ATTACHMENT0, atlas_texture.texture_id, 0);\n GLenum draw_buffers = GL_COLOR_ATTACHMENT0;\n glDrawBuffers(1, &draw_buffers);\n\n ASSERT(glCheckFramebufferStatus(GL_FRAMEBUFFER) == GL_FRAMEBUFFER_COMPLETE, \"GL Error creating texture bank framebuffer\");\n GL_State->unbind_fbo();\n }\n\n auto dir = find_folder(\"data\");\n ASSERT(dir.length() > 0, \"Could not find data folder\");\n\n auto imported_textures_json_filepath = dir + \"\/\" + string(imported_textures_json_filename);\n\n std::string json_str = read_text_file(imported_textures_json_filepath);\n cJSON* root = cJSON_Parse(json_str.c_str());\n ASSERT(root, \"Error loading imported textures json file\");\n\n vector<char*> textures;\n CJSON_GET_STR_VECTOR(textures);\n\n for(auto const& filepath : textures)\n {\n if(is_file(filepath))\n {\n add_texture(filepath);\n }\n else\n {\n LOG(\"Texture not found at %s\", filepath);\n }\n }\n \n cJSON_Delete(root);\n\n ASSERT(!CheckGLError(), \"GL Error Initializing texture_bank_t\");\n }\n\n void texture_bank_t::add_texture(std::string const& filepath)\n {\n ASSERT(is_file(filepath), \"File not found %s\", filepath.c_str());\n texture_t new_texture(filepath, SOIL_LOAD_RGBA); \/\/force RGBA, since that's what the atlas uses. Might not be neccesary now that I'm rendering to a framebuffer\n\n \/\/texture_t new_texture(\"test\", nullptr, 128, 128);\n\n \/\/ASSERT(new_texture.format == atlas_texture.format, \"Color format of texture must match the atlas (GL_RGBA) %s\", filepath.c_str());\n \/\/ASSERT(new_texture.types[0] == atlas_texture.types[0], \"\");\n\n int dest_loc_x = (saved_textures.size() % max_saved_textures_1d) * saved_texture_dim;\n int dest_loc_y = (saved_textures.size() \/ max_saved_textures_1d) * saved_texture_dim;\n\n \/\/glBindTexture(GL_TEXTURE_2D, 0);\n\n GL_State->bind(atlas_fbo);\n \/\/glViewport(0,0,atlas_texture.width, atlas_tetxure.height);\n\n saved_textures.push_back(saved_texture_t{filepath});\n\n ASSERT(!CheckGLError(), \"GL Error in texture_bank_t::add_texture() for \\'%s\\'\", filepath.c_str());\n }\n}\n}\n}<commit_msg>more WIP texture bank stuff attempting to render an added texture onto the atlas using a framebuffer object<commit_after>#include \"stdafx.h\"\n#include \"texture_bank.h\"\n\n#include <glm\/gtc\/matrix_transform.hpp>\n\n#include \"asdf_multiplat\/data\/gl_resources.h\"\n#include \"asdf_multiplat\/utilities\/utilities.h\"\n#include \"asdf_multiplat\/utilities\/cjson_utils.hpp\"\n\nusing namespace std;\n\nnamespace asdf\n{\n using namespace util;\n\nnamespace hexmap {\nnamespace data\n{\n\n texture_bank_t::texture_bank_t()\n : atlas_texture(\"hex texture atlas\", nullptr, hex_atlas_dim, hex_atlas_dim)\n {\n ASSERT(!CheckGLError(), \"GL Error Before Initializing texture_bank_t\");\n\n {\n GL_State->bind(atlas_fbo);\n glFramebufferTexture(GL_FRAMEBUFFER, GL_COLOR_ATTACHMENT0, atlas_texture.texture_id, 0);\n\n GLenum draw_buffers = GL_COLOR_ATTACHMENT1;\n glDrawBuffers(1, &draw_buffers);\n ASSERT(glCheckFramebufferStatus(GL_FRAMEBUFFER) == GL_FRAMEBUFFER_COMPLETE, \"GL Error creating texture bank framebuffer\");\n\n glViewport(0,0,atlas_texture.width, atlas_texture.height);\n\n glClearColor(0.0f, 1.0f, 1.0f, 1.0f);\n glClear(GL_COLOR_BUFFER_BIT | GL_DEPTH_BUFFER_BIT);\n\n GL_State->unbind_fbo();\n }\n\n auto dir = find_folder(\"data\");\n ASSERT(dir.length() > 0, \"Could not find data folder\");\n\n auto imported_textures_json_filepath = dir + \"\/\" + string(imported_textures_json_filename);\n\n std::string json_str = read_text_file(imported_textures_json_filepath);\n cJSON* root = cJSON_Parse(json_str.c_str());\n ASSERT(root, \"Error loading imported textures json file\");\n\n vector<char*> textures;\n CJSON_GET_STR_VECTOR(textures);\n\n for(auto const& filepath : textures)\n {\n if(is_file(filepath))\n {\n add_texture(filepath);\n }\n else\n {\n LOG(\"Texture not found at %s\", filepath);\n }\n }\n \n cJSON_Delete(root);\n\n ASSERT(!CheckGLError(), \"GL Error Initializing texture_bank_t\");\n }\n\n void texture_bank_t::add_texture(std::string const& filepath)\n {\n auto prev_fbo = GL_State->current_framebuffer;\n\n ASSERT(is_file(filepath), \"File not found %s\", filepath.c_str());\n texture_t new_texture(filepath, SOIL_LOAD_RGBA); \/\/force RGBA, since that's what the atlas uses. Might not be neccesary now that I'm rendering to a framebuffer\n\n \/\/ASSERT(new_texture.format == atlas_texture.format, \"Color format of texture must match the atlas (GL_RGBA) %s\", filepath.c_str());\n \/\/ASSERT(new_texture.types[0] == atlas_texture.types[0], \"\");\n\n int dest_loc_x = (saved_textures.size() % max_saved_textures_1d) * saved_texture_dim;\n int dest_loc_y = (saved_textures.size() \/ max_saved_textures_1d) * saved_texture_dim;\n\n\n GL_State->bind(atlas_fbo);\n glViewport(0,0,atlas_texture.width, atlas_texture.height);\n\n ASSERT(!CheckGLError(), \"\");\n auto& screen_shader = app.renderer->screen_shader;\n GL_State->bind(screen_shader);\n\n screen_shader->world_matrix[3][0] = dest_loc_x;\n screen_shader->world_matrix[3][1] = dest_loc_y;\n screen_shader->world_matrix = glm::scale(screen_shader->world_matrix, glm::vec3(1000.0f, 1000.0f, 1.0f));\n screen_shader->projection_matrix = glm::ortho<float>(0, atlas_texture.width, 0, atlas_texture.height\/*, -1.0f, 1.0f*\/);\n screen_shader->update_wvp_uniform();\n\n glUniform4f(screen_shader->uniform(\"Color\"), 1.5f, 1.0f, 1.0f, 1.0f);\n glBindTexture(GL_TEXTURE_2D, new_texture.texture_id);\n\n app.renderer->quad.render();\n \n \/\/re-bind prev fbo\n glBindFramebuffer(GL_FRAMEBUFFER, prev_fbo);\n GL_State->current_framebuffer = prev_fbo;\n\n\n saved_textures.push_back(saved_texture_t{filepath});\n\n ASSERT(!CheckGLError(), \"GL Error in texture_bank_t::add_texture() for \\'%s\\'\", filepath.c_str());\n }\n}\n}\n}<|endoftext|>"} {"text":"<commit_before>\/*\n * Copyright 2007-2018 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 \"Lease.hxx\"\n#include \"fb_pool.hxx\"\n#include \"net\/SocketProtocolError.hxx\"\n\nFilteredSocketLease::FilteredSocketLease(FilteredSocket &_socket, Lease &lease,\n const struct timeval *read_timeout,\n const struct timeval *write_timeout,\n BufferedSocketHandler &_handler) noexcept\n :socket(&_socket), handler(_handler)\n{\n socket->Reinit(read_timeout, write_timeout, *this);\n lease_ref.Set(lease);\n}\n\nFilteredSocketLease::~FilteredSocketLease() noexcept\n{\n assert(IsReleased());\n\n for (auto &i : input)\n i.FreeIfDefined(fb_pool_get());\n}\n\nvoid\nFilteredSocketLease::Release(bool reuse) noexcept\n{\n \/\/ TODO: move buffers instead of copying the data\n size_t i = 0;\n while (true) {\n auto r = WritableBuffer<uint8_t>::FromVoid(socket->ReadBuffer());\n if (r.empty())\n break;\n\n auto &dest = input[i];\n if (!dest.IsDefined())\n dest.Allocate(fb_pool_get());\n else if (dest.IsFull()) {\n ++i;\n assert(i < input.size());\n continue;\n }\n\n auto w = dest.Write();\n size_t n = std::min(r.size, w.size);\n assert(n > 0);\n std::move(r.data, r.data + n, w.data);\n socket->Consumed(n);\n dest.Append(n);\n }\n\n lease_ref.Release(reuse);\n socket = nullptr;\n}\n\nbool\nFilteredSocketLease::IsEmpty() const noexcept\n{\n if (IsReleased())\n return input.front().IsEmpty();\n else\n return socket->IsEmpty();\n}\n\nsize_t\nFilteredSocketLease::GetAvailable() const noexcept\n{\n if (IsReleased()) {\n size_t result = 0;\n for (const auto &i : input)\n result += i.GetAvailable();\n return result;\n } else\n return socket->GetAvailable();\n}\n\nWritableBuffer<void>\nFilteredSocketLease::ReadBuffer() const noexcept\n{\n return IsReleased()\n ? input.front().Read().ToVoid()\n : socket->ReadBuffer();\n}\n\nvoid\nFilteredSocketLease::Consumed(size_t nbytes) noexcept\n{\n if (IsReleased()) {\n input.front().Consume(nbytes);\n MoveInput();\n } else\n socket->Consumed(nbytes);\n}\n\nbool\nFilteredSocketLease::Read(bool expect_more) noexcept\n{\n if (IsReleased()) {\n while (true) {\n auto r = input.front().Read();\n if (r.empty())\n return true;\n\n switch (handler.OnBufferedData()) {\n case BufferedResult::OK:\n if (IsEmpty() && !handler.OnBufferedEnd())\n return false;\n break;\n\n case BufferedResult::BLOCKING:\n assert(!input.front().IsEmpty());\n return true;\n\n case BufferedResult::MORE:\n case BufferedResult::AGAIN_OPTIONAL:\n case BufferedResult::AGAIN_EXPECT:\n break;\n\n case BufferedResult::CLOSED:\n return false;\n }\n }\n } else\n return socket->Read(expect_more);\n}\n\nvoid\nFilteredSocketLease::MoveInput() noexcept\n{\n auto &dest = input.front();\n for (size_t i = 1; !dest.IsFull() && i < input.size(); ++i) {\n auto &src = input[i];\n dest.MoveFromAllowBothNull(src);\n src.FreeIfEmpty(fb_pool_get());\n }\n}\n\nBufferedResult\nFilteredSocketLease::OnBufferedData()\n{\n while (true) {\n const auto result = handler.OnBufferedData();\n if (result == BufferedResult::CLOSED)\n break;\n\n if (!IsReleased())\n return result;\n\n \/* since the BufferedSocket is gone already, we must handle\n the AGAIN result codes here *\/\n\n if (result == BufferedResult::AGAIN_OPTIONAL && !IsEmpty())\n continue;\n else if (result == BufferedResult::AGAIN_EXPECT) {\n if (IsEmpty()) {\n handler.OnBufferedError(std::make_exception_ptr(SocketClosedPrematurelyError()));\n break;\n }\n\n continue;\n } else\n break;\n }\n\n \/* if the socket has been released, we must always report CLOSED\n to the released BufferedSocket instance, even if our handler\n still wants to consume the remaining buffer *\/\n return BufferedResult::CLOSED;\n}\n\nDirectResult\nFilteredSocketLease::OnBufferedDirect(SocketDescriptor fd, FdType fd_type)\n{\n return handler.OnBufferedDirect(fd, fd_type);\n}\n\nbool\nFilteredSocketLease::OnBufferedClosed() noexcept\n{\n auto result = handler.OnBufferedClosed();\n if (result && IsReleased()) {\n result = false;\n\n if (handler.OnBufferedRemaining(GetAvailable()) &&\n IsEmpty())\n handler.OnBufferedEnd();\n }\n\n return result;\n}\n\nbool\nFilteredSocketLease::OnBufferedRemaining(size_t remaining) noexcept\n{\n auto result = handler.OnBufferedRemaining(remaining);\n if (result && IsReleased())\n result = false;\n return result;\n}\n\nbool\nFilteredSocketLease::OnBufferedEnd() noexcept\n{\n return handler.OnBufferedEnd();\n}\n\nbool\nFilteredSocketLease::OnBufferedWrite()\n{\n return handler.OnBufferedWrite();\n}\n\nbool\nFilteredSocketLease::OnBufferedDrained() noexcept\n{\n return handler.OnBufferedDrained();\n}\n\nbool\nFilteredSocketLease::OnBufferedTimeout() noexcept\n{\n return handler.OnBufferedTimeout();\n}\n\nenum write_result\nFilteredSocketLease::OnBufferedBroken() noexcept\n{\n return handler.OnBufferedBroken();\n}\n\nvoid\nFilteredSocketLease::OnBufferedError(std::exception_ptr e) noexcept\n{\n return handler.OnBufferedError(e);\n}\n<commit_msg>fs\/Lease: add assertions<commit_after>\/*\n * Copyright 2007-2018 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 \"Lease.hxx\"\n#include \"fb_pool.hxx\"\n#include \"net\/SocketProtocolError.hxx\"\n\nFilteredSocketLease::FilteredSocketLease(FilteredSocket &_socket, Lease &lease,\n const struct timeval *read_timeout,\n const struct timeval *write_timeout,\n BufferedSocketHandler &_handler) noexcept\n :socket(&_socket), handler(_handler)\n{\n socket->Reinit(read_timeout, write_timeout, *this);\n lease_ref.Set(lease);\n}\n\nFilteredSocketLease::~FilteredSocketLease() noexcept\n{\n assert(IsReleased());\n\n for (auto &i : input)\n i.FreeIfDefined(fb_pool_get());\n}\n\nvoid\nFilteredSocketLease::Release(bool reuse) noexcept\n{\n assert(!IsReleased());\n assert(!lease_ref.released);\n\n \/\/ TODO: move buffers instead of copying the data\n size_t i = 0;\n while (true) {\n auto r = WritableBuffer<uint8_t>::FromVoid(socket->ReadBuffer());\n if (r.empty())\n break;\n\n auto &dest = input[i];\n if (!dest.IsDefined())\n dest.Allocate(fb_pool_get());\n else if (dest.IsFull()) {\n ++i;\n assert(i < input.size());\n continue;\n }\n\n auto w = dest.Write();\n size_t n = std::min(r.size, w.size);\n assert(n > 0);\n std::move(r.data, r.data + n, w.data);\n socket->Consumed(n);\n dest.Append(n);\n }\n\n lease_ref.Release(reuse);\n socket = nullptr;\n}\n\nbool\nFilteredSocketLease::IsEmpty() const noexcept\n{\n if (IsReleased())\n return input.front().IsEmpty();\n else\n return socket->IsEmpty();\n}\n\nsize_t\nFilteredSocketLease::GetAvailable() const noexcept\n{\n if (IsReleased()) {\n size_t result = 0;\n for (const auto &i : input)\n result += i.GetAvailable();\n return result;\n } else\n return socket->GetAvailable();\n}\n\nWritableBuffer<void>\nFilteredSocketLease::ReadBuffer() const noexcept\n{\n return IsReleased()\n ? input.front().Read().ToVoid()\n : socket->ReadBuffer();\n}\n\nvoid\nFilteredSocketLease::Consumed(size_t nbytes) noexcept\n{\n if (IsReleased()) {\n input.front().Consume(nbytes);\n MoveInput();\n } else\n socket->Consumed(nbytes);\n}\n\nbool\nFilteredSocketLease::Read(bool expect_more) noexcept\n{\n if (IsReleased()) {\n while (true) {\n auto r = input.front().Read();\n if (r.empty())\n return true;\n\n switch (handler.OnBufferedData()) {\n case BufferedResult::OK:\n if (IsEmpty() && !handler.OnBufferedEnd())\n return false;\n break;\n\n case BufferedResult::BLOCKING:\n assert(!input.front().IsEmpty());\n return true;\n\n case BufferedResult::MORE:\n case BufferedResult::AGAIN_OPTIONAL:\n case BufferedResult::AGAIN_EXPECT:\n break;\n\n case BufferedResult::CLOSED:\n return false;\n }\n }\n } else\n return socket->Read(expect_more);\n}\n\nvoid\nFilteredSocketLease::MoveInput() noexcept\n{\n auto &dest = input.front();\n for (size_t i = 1; !dest.IsFull() && i < input.size(); ++i) {\n auto &src = input[i];\n dest.MoveFromAllowBothNull(src);\n src.FreeIfEmpty(fb_pool_get());\n }\n}\n\nBufferedResult\nFilteredSocketLease::OnBufferedData()\n{\n while (true) {\n const auto result = handler.OnBufferedData();\n if (result == BufferedResult::CLOSED)\n break;\n\n if (!IsReleased())\n return result;\n\n \/* since the BufferedSocket is gone already, we must handle\n the AGAIN result codes here *\/\n\n if (result == BufferedResult::AGAIN_OPTIONAL && !IsEmpty())\n continue;\n else if (result == BufferedResult::AGAIN_EXPECT) {\n if (IsEmpty()) {\n handler.OnBufferedError(std::make_exception_ptr(SocketClosedPrematurelyError()));\n break;\n }\n\n continue;\n } else\n break;\n }\n\n \/* if the socket has been released, we must always report CLOSED\n to the released BufferedSocket instance, even if our handler\n still wants to consume the remaining buffer *\/\n return BufferedResult::CLOSED;\n}\n\nDirectResult\nFilteredSocketLease::OnBufferedDirect(SocketDescriptor fd, FdType fd_type)\n{\n return handler.OnBufferedDirect(fd, fd_type);\n}\n\nbool\nFilteredSocketLease::OnBufferedClosed() noexcept\n{\n auto result = handler.OnBufferedClosed();\n if (result && IsReleased()) {\n result = false;\n\n if (handler.OnBufferedRemaining(GetAvailable()) &&\n IsEmpty())\n handler.OnBufferedEnd();\n }\n\n return result;\n}\n\nbool\nFilteredSocketLease::OnBufferedRemaining(size_t remaining) noexcept\n{\n auto result = handler.OnBufferedRemaining(remaining);\n if (result && IsReleased())\n result = false;\n return result;\n}\n\nbool\nFilteredSocketLease::OnBufferedEnd() noexcept\n{\n return handler.OnBufferedEnd();\n}\n\nbool\nFilteredSocketLease::OnBufferedWrite()\n{\n return handler.OnBufferedWrite();\n}\n\nbool\nFilteredSocketLease::OnBufferedDrained() noexcept\n{\n return handler.OnBufferedDrained();\n}\n\nbool\nFilteredSocketLease::OnBufferedTimeout() noexcept\n{\n return handler.OnBufferedTimeout();\n}\n\nenum write_result\nFilteredSocketLease::OnBufferedBroken() noexcept\n{\n return handler.OnBufferedBroken();\n}\n\nvoid\nFilteredSocketLease::OnBufferedError(std::exception_ptr e) noexcept\n{\n return handler.OnBufferedError(e);\n}\n<|endoftext|>"} {"text":"<commit_before>#include \"board.hpp\"\n#include \"config.hpp\"\n\nnamespace roadagain\n{\n\nConfig::Config() : use_color_(true), automatic_(false), player_(BLACK)\n{\n}\n\nConfig::Config(const Config& config)\n{\n}\n\nConfig& Config::instance()\n{\n return (Config::instance_);\n}\n\nConfig& Config::operator=(const Config& config)\n{\n}\n\n}\n\n#endif\n<commit_msg>Kicked out needless endif<commit_after>#include \"board.hpp\"\n#include \"config.hpp\"\n\nnamespace roadagain\n{\n\nConfig::Config() : use_color_(true), automatic_(false), player_(BLACK)\n{\n}\n\nConfig::Config(const Config& config)\n{\n}\n\nConfig& Config::instance()\n{\n return (Config::instance_);\n}\n\nConfig& Config::operator=(const Config& config)\n{\n}\n\n}\n<|endoftext|>"} {"text":"<commit_before>#ifndef CONFIG_HPP\n#define CONFIG_HPP\n\nconst int SCREEN_WIDTH = 256;\nconst int SCREEN_HEIGHT = 144;\nconst int INITIAL_WINDOW_WIDTH = SCREEN_WIDTH;\nconst int INITIAL_WINDOW_HEIGHT = SCREEN_HEIGHT;\n\n#endif<commit_msg>changed resolution (hopefully for last time)<commit_after>#ifndef CONFIG_HPP\n#define CONFIG_HPP\n\nconst int SCREEN_WIDTH = 320;\nconst int SCREEN_HEIGHT = 180;\nconst int INITIAL_WINDOW_WIDTH = SCREEN_WIDTH;\nconst int INITIAL_WINDOW_HEIGHT = SCREEN_HEIGHT;\n\n#endif<|endoftext|>"} {"text":"<commit_before>#include <nan.h>\n#include <iostream>\n#include <sys\/msg.h>\n\nusing v8::Function;\nusing v8::Local;\nusing v8::Number;\nusing v8::Value;\nusing Nan::AsyncQueueWorker;\nusing Nan::AsyncWorker;\nusing Nan::Callback;\nusing Nan::New;\nusing Nan::Null;\n\n#ifndef MSGMAX\n#define MSGMAX 4056\n#endif\n\n#ifndef linux\nstruct msgbuf {\n long mtype;\n char mtext[MSGMAX - 4];\n};\n#endif\n\nconst char *ConcatString(std::string one, const char *two) {\n return one.append(two).c_str();\n}\n\nLocal<Value> CreateError(std::string message, int errcode) {\n message.append(\": \");\n\n Nan::MaybeLocal<Value> val = Nan::Error(ConcatString(message, strerror(errcode)));\n\n return val.ToLocalChecked();\n}\n\nclass SendMessageWorker : public AsyncWorker {\n\n public:\n SendMessageWorker(Callback *callback, int id, char *data, size_t dataLength, long type, int flags)\n : AsyncWorker(callback), id(id), data(data), dataLength(dataLength), type(type), flags(flags) { }\n ~SendMessageWorker() { }\n\n void Execute() {\n msgbuf *message = new msgbuf;\n message->mtype = type;\n\n memcpy(message->mtext, data, dataLength);\n\n ret = msgsnd(id, message, dataLength, flags);\n error = errno;\n }\n\n void HandleOKCallback () {\n Local<Value> argv[] = { Null() };\n\n if (ret == -1) {\n argv[0] = CreateError(\"Failed to send message\", error);\n }\n\n callback->Call(1, argv);\n }\n\n private:\n int id;\n char *data;\n int dataLength;\n long type;\n int flags;\n int ret;\n int error;\n\n};\n\nclass ReceiveMessageWorker : public AsyncWorker {\n\n public:\n ReceiveMessageWorker(Callback *callback, int id, size_t bufferLength, long type, int flags)\n : AsyncWorker(callback), id(id), bufferLength(bufferLength), type(type), flags(flags) { }\n ~ReceiveMessageWorker() { }\n\n void Execute() {\n message = new msgbuf;\n\n bufferLength = msgrcv(id, message, bufferLength, type, flags);\n error = errno;\n }\n\n void HandleOKCallback () {\n Local<Value> argv[] = {\n Null(),\n Null()\n };\n\n if (bufferLength == (size_t) -1) {\n argv[0] = CreateError(\"Failed to receive message\", error);\n } else {\n argv[1] = Nan::CopyBuffer(message->mtext, bufferLength).ToLocalChecked();\n }\n\n callback->Call(2, argv);\n }\n\n private:\n int id;\n msgbuf *message;\n size_t bufferLength;\n long type;\n int flags;\n int error;\n};\n\nNAN_METHOD(GetMessageQueue) {\n key_t key = (key_t) info[0]->Int32Value();\n int flags = info[1]->Int32Value();\n\n int queue = msgget(key, flags);\n\n if (queue == -1) {\n Nan::ThrowError(CreateError(\"Failed to get queue\", errno));\n }\n\n info.GetReturnValue().Set(New(queue));\n}\n\nNAN_METHOD(ControlMessageQueue) {\n int id = info[0]->Int32Value();\n int cmd = info[1]->Int32Value();\n\n msqid_ds *buf;\n\n if (cmd != IPC_STAT && cmd != IPC_SET) {\n buf = nullptr;\n }\n#ifdef linux\n else if (cmd != MSG_STAT) {\n buf = nullptr;\n }\n#endif\n else {\n buf = new msqid_ds;\n }\n\n int ret = msgctl(id, cmd, buf);\n\n size_t bufSize = sizeof(msqid_ds);\n char rawBuf[bufSize];\n memcpy(rawBuf, buf, bufSize);\n\n if (ret == 0) {\n info.GetReturnValue().Set(Nan::NewBuffer(rawBuf, bufSize).ToLocalChecked());\n } else {\n info.GetReturnValue().Set(New(ret));\n }\n}\n\nNAN_METHOD(CloseMessageQueue) {\n int id = info[0]->Int32Value();\n\n int ret = msgctl(id, IPC_RMID, nullptr);\n\n if (ret != 0) {\n Nan::ThrowError(CreateError(\"Failed to close queue\", errno));\n }\n\n info.GetReturnValue().Set(Nan::True());\n}\n\nNAN_METHOD(SendMessage) {\n int id = info[0]->Int32Value();\n char* bufferData = node::Buffer::Data(info[1]);\n size_t bufferLength = (size_t) node::Buffer::Length(info[1]);\n long type = info[2]->Int32Value();\n int flags = info[3]->Int32Value();\n Callback *callback = new Callback(info[4].As<Function>());\n\n AsyncQueueWorker(new SendMessageWorker(callback, id, bufferData, bufferLength, type, flags));\n}\n\nNAN_METHOD(ReceiveMessage) {\n int id = info[0]->Int32Value();\n size_t bufferLength = (size_t) info[1]->Int32Value();\n long type = info[2]->Int32Value();\n int flags = info[3]->Int32Value();\n Callback *callback = new Callback(info[4].As<Function>());\n\n AsyncQueueWorker(new ReceiveMessageWorker(callback, id, bufferLength, type, flags));\n}\n<commit_msg>Memory fixes for #1<commit_after>#include <nan.h>\n#include <iostream>\n#include <sys\/msg.h>\n\nusing v8::Function;\nusing v8::Local;\nusing v8::Number;\nusing v8::Value;\nusing Nan::AsyncQueueWorker;\nusing Nan::AsyncWorker;\nusing Nan::Callback;\nusing Nan::New;\nusing Nan::Null;\n\n#ifndef MSGMAX\n#define MSGMAX 4056\n#endif\n\n#ifndef linux\nstruct msgbuf {\n long mtype;\n char mtext[1];\n};\n#endif\n\nconst char *ConcatString(std::string one, const char *two) {\n return one.append(two).c_str();\n}\n\nLocal<Value> CreateError(std::string message, int errcode) {\n message.append(\": \");\n\n Nan::MaybeLocal<Value> val = Nan::Error(ConcatString(message, strerror(errcode)));\n\n return val.ToLocalChecked();\n}\n\nclass SendMessageWorker : public AsyncWorker {\n\n public:\n SendMessageWorker(Callback *callback, int id, char *data, size_t dataLength, long type, int flags)\n : AsyncWorker(callback), id(id), data(data), dataLength(dataLength), type(type), flags(flags) { }\n ~SendMessageWorker() { }\n\n void Execute() {\n struct msgbuf* message =\n (struct msgbuf*)malloc(sizeof(struct msgbuf) + dataLength);\n\n message->mtype = type;\n memcpy(message->mtext, data, dataLength);\n\n ret = msgsnd(id, message, dataLength, flags);\n error = errno;\n\n free(message);\n }\n\n void HandleOKCallback () {\n Local<Value> argv[] = { Null() };\n\n if (ret == -1) {\n argv[0] = CreateError(\"Failed to send message\", error);\n }\n\n callback->Call(1, argv);\n }\n\n private:\n int id;\n char *data;\n int dataLength;\n long type;\n int flags;\n int ret;\n int error;\n\n};\n\nclass ReceiveMessageWorker : public AsyncWorker {\n\n public:\n ReceiveMessageWorker(Callback *callback, int id, size_t bufferLength, long type, int flags)\n : AsyncWorker(callback), id(id), bufferLength(bufferLength), type(type), flags(flags) { }\n ~ReceiveMessageWorker() { }\n\n void Execute() {\n message = new msgbuf;\n\n bufferLength = msgrcv(id, message, bufferLength, type, flags);\n error = errno;\n }\n\n void HandleOKCallback () {\n Local<Value> argv[] = {\n Null(),\n Null()\n };\n\n if (bufferLength == (size_t) -1) {\n argv[0] = CreateError(\"Failed to receive message\", error);\n } else {\n argv[1] = Nan::CopyBuffer(message->mtext, bufferLength).ToLocalChecked();\n }\n\n callback->Call(2, argv);\n }\n\n private:\n int id;\n msgbuf *message;\n size_t bufferLength;\n long type;\n int flags;\n int error;\n};\n\nNAN_METHOD(GetMessageQueue) {\n key_t key = (key_t) info[0]->Int32Value();\n int flags = info[1]->Int32Value();\n\n int queue = msgget(key, flags);\n\n if (queue == -1) {\n Nan::ThrowError(CreateError(\"Failed to get queue\", errno));\n }\n\n info.GetReturnValue().Set(New(queue));\n}\n\nNAN_METHOD(ControlMessageQueue) {\n int id = info[0]->Int32Value();\n int cmd = info[1]->Int32Value();\n\n msqid_ds *buf;\n\n if (cmd != IPC_STAT && cmd != IPC_SET) {\n buf = nullptr;\n }\n#ifdef linux\n else if (cmd != MSG_STAT) {\n buf = nullptr;\n }\n#endif\n else {\n buf = new msqid_ds;\n }\n\n int ret = msgctl(id, cmd, buf);\n\n size_t bufSize = sizeof(msqid_ds);\n char rawBuf[bufSize];\n memcpy(rawBuf, buf, bufSize);\n\n if (ret == 0) {\n info.GetReturnValue().Set(Nan::NewBuffer(rawBuf, bufSize).ToLocalChecked());\n } else {\n info.GetReturnValue().Set(New(ret));\n }\n}\n\nNAN_METHOD(CloseMessageQueue) {\n int id = info[0]->Int32Value();\n\n int ret = msgctl(id, IPC_RMID, nullptr);\n\n if (ret != 0) {\n Nan::ThrowError(CreateError(\"Failed to close queue\", errno));\n }\n\n info.GetReturnValue().Set(Nan::True());\n}\n\nNAN_METHOD(SendMessage) {\n int id = info[0]->Int32Value();\n char* bufferData = node::Buffer::Data(info[1]);\n size_t bufferLength = (size_t) node::Buffer::Length(info[1]);\n long type = info[2]->Int32Value();\n int flags = info[3]->Int32Value();\n Callback *callback = new Callback(info[4].As<Function>());\n\n AsyncQueueWorker(new SendMessageWorker(callback, id, bufferData, bufferLength, type, flags));\n}\n\nNAN_METHOD(ReceiveMessage) {\n int id = info[0]->Int32Value();\n size_t bufferLength = (size_t) info[1]->Int32Value();\n long type = info[2]->Int32Value();\n int flags = info[3]->Int32Value();\n Callback *callback = new Callback(info[4].As<Function>());\n\n AsyncQueueWorker(new ReceiveMessageWorker(callback, id, bufferLength, type, flags));\n}\n<|endoftext|>"} {"text":"<commit_before>#include <SDL2\/SDL.h>\n\nSDL_Window *g_pWindow = 0;\nSDL_Renderer *g_pRenderer = 0;\n\nint main(int argc, char *argv[])\n{\n \/\/ init SDL\n if (SDL_Init(SDL_INIT_EVERYTHING) >= 0) {\n g_pWindow = SDL_CreateWindow(\"Hello\", SDL_WINDOWPOS_CENTERED, SDL_WINDOWPOS_CENTERED, 960, 640, SDL_WINDOW_SHOWN);\n\n if (g_pWindow != 0) {\n g_pRenderer = SDL_CreateRenderer(g_pWindow, -1, 0);\n }\n }\n else {\n return -1;\n }\n\n SDL_SetRenderDrawColor(g_pRenderer, 0, 0, 0, 255);\n\n SDL_RenderClear(g_pRenderer);\n\n SDL_RenderPresent(g_pRenderer);\n\n SDL_Delay(5000);\n\n SDL_Quit();\n\n return 0;\n}\n<commit_msg>Make code cleaner by move init and render out of main<commit_after>#include <SDL2\/SDL.h>\n\nSDL_Window *g_pWindow = nullptr;\nSDL_Renderer *g_pRenderer = nullptr;\n\nbool g_bRunning = false;\n\nbool init(const char *title, int width, int height)\n{\n if (SDL_Init(SDL_INIT_EVERYTHING) >= 0) {\n g_pWindow = SDL_CreateWindow(title, SDL_WINDOWPOS_CENTERED, SDL_WINDOWPOS_CENTERED, width, height, SDL_WINDOW_SHOWN);\n\n if (g_pWindow != nullptr) {\n g_pRenderer = SDL_CreateRenderer(g_pWindow, -1, SDL_RENDERER_ACCELERATED | SDL_RENDERER_PRESENTVSYNC);\n }\n }\n else {\n return false;\n }\n\n return true;\n}\n\nvoid render()\n{\n \/\/ Set to black\n SDL_SetRenderDrawColor(g_pRenderer, 0, 0, 0, 255);\n\n \/\/ Clear window\n SDL_RenderClear(g_pRenderer);\n\n \/\/ Render to window\n SDL_RenderPresent(g_pRenderer);\n}\n\nint main(int argc, char *argv[])\n{\n if (init(\"Awesome Game\", 640, 480)) {\n g_bRunning = true;\n }\n else {\n return -1;\n }\n\n while (g_bRunning) {\n render();\n }\n\n SDL_Quit();\n\n return 0;\n}\n<|endoftext|>"} {"text":"<commit_before>#include \"gameitem.h\"\n#include \"gamescene.h\"\n\n#include <QDeclarativeExpression>\n\nGameItem::GameItem(GameScene *parent)\n : QQuickItem((QQuickItem *)parent)\n , m_expression(0)\n , m_updateInterval(0)\n , m_collided(false)\n , m_scene(0)\n{\n}\n\nvoid GameItem::update(long delta)\n{\n if ((m_updateInterval && m_updateTime.elapsed() >= m_updateInterval)\n || !m_updateInterval) {\n m_updateTime.restart();\n if (m_expression)\n m_expression->evaluate();\n }\n}\n\nQDeclarativeScriptString GameItem::updateScript() const\n{\n return m_updateScript;\n}\n\nvoid GameItem::setUpdateScript(QDeclarativeScriptString updateScript)\n{\n if (m_updateScript.script() != updateScript.script()) {\n m_updateScript = updateScript;\n\n if (m_expression)\n delete m_expression;\n\n m_expression = new QDeclarativeExpression(m_updateScript.context(), m_updateScript.scopeObject(), m_updateScript.script());\n\n emit updateScriptChanged();\n }\n}\n\nint GameItem::updateInterval() const\n{\n return m_updateInterval;\n}\n\nvoid GameItem::setUpdateInterval(int updateInterval)\n{\n if (m_updateInterval != updateInterval) {\n m_updateInterval = updateInterval;\n\n emit updateScriptChanged();\n }\n}\n\nbool GameItem::collided()\n{\n return m_collided;\n}\n\nvoid GameItem::setCollided(bool collided)\n{\n if (m_collided != collided) {\n m_collided = collided;\n\n emit collidedChanged();\n }\n}\n\nQList<QObject *> GameItem::collidedItems()\n{\n GameScene *scene = qobject_cast<GameScene *>(parent());\n\n return scene->collidedItems(this);\n}\n\nGameScene *GameItem::scene()\n{\n return m_scene;\n}\n\nvoid GameItem::setScene(GameScene *scene)\n{\n m_scene = scene;\n}\n<commit_msg>Make game items to update their chiltren<commit_after>#include \"gameitem.h\"\n#include \"gamescene.h\"\n\n#include <QDeclarativeExpression>\n\nGameItem::GameItem(GameScene *parent)\n : QQuickItem((QQuickItem *)parent)\n , m_expression(0)\n , m_updateInterval(0)\n , m_collided(false)\n , m_scene(0)\n{\n}\n\nvoid GameItem::update(long delta)\n{\n if ((m_updateInterval && m_updateTime.elapsed() >= m_updateInterval)\n || !m_updateInterval) {\n m_updateTime.restart();\n if (m_expression)\n m_expression->evaluate();\n }\n\n foreach (QQuickItem *child, childItems())\n if (GameItem *item = dynamic_cast<GameItem *>(child)) {\n item->update(delta);\n }\n}\n\nQDeclarativeScriptString GameItem::updateScript() const\n{\n return m_updateScript;\n}\n\nvoid GameItem::setUpdateScript(QDeclarativeScriptString updateScript)\n{\n if (m_updateScript.script() != updateScript.script()) {\n m_updateScript = updateScript;\n\n if (m_expression)\n delete m_expression;\n\n m_expression = new QDeclarativeExpression(m_updateScript.context(), m_updateScript.scopeObject(), m_updateScript.script());\n\n emit updateScriptChanged();\n }\n}\n\nint GameItem::updateInterval() const\n{\n return m_updateInterval;\n}\n\nvoid GameItem::setUpdateInterval(int updateInterval)\n{\n if (m_updateInterval != updateInterval) {\n m_updateInterval = updateInterval;\n\n emit updateScriptChanged();\n }\n}\n\nbool GameItem::collided()\n{\n return m_collided;\n}\n\nvoid GameItem::setCollided(bool collided)\n{\n if (m_collided != collided) {\n m_collided = collided;\n\n emit collidedChanged();\n }\n}\n\nQList<QObject *> GameItem::collidedItems()\n{\n GameScene *scene = qobject_cast<GameScene *>(parent());\n\n return scene->collidedItems(this);\n}\n\nGameScene *GameItem::scene()\n{\n return m_scene;\n}\n\nvoid GameItem::setScene(GameScene *scene)\n{\n m_scene = scene;\n}\n<|endoftext|>"} {"text":"<commit_before>#include \"ocisession.h\"\n#include <algorithm>\n\n#include \"oci_lib_intf.h\"\n\n#include <oci.h>\n\nvoid * ocisession::envhp = NULL;\nlist<ocisession*> ocisession::_sessions;\n\nocisession::ocisession(const char * connect_str, const int connect_str_len,\n\t\t\t\t\t const char * user_name, const int user_name_len,\n\t\t\t\t\t const char * password, const int password_len)\n{\n\tintf_ret r;\n\tOCIAuthInfo *authp = NULL;\n\n\tinit();\n\n\tr.handle = envhp;\n\n\t\/\/ allocate error handle\n\tcheckenv(&r, OCIHandleAlloc((OCIEnv*)envhp,\t\/* environment handle *\/\n (void **) &_errhp,\t\/* returned err handle *\/\n OCI_HTYPE_ERROR,\t\/* typ of handle to allocate *\/\n (size_t) 0,\t\t\t\/* optional extra memory size *\/\n (void **) NULL));\t\/* returned extra memeory *\/\n\n\tif(r.fn_ret != SUCCESS) {\n \t\tREMOTE_LOG(\"failed OCISessionGet %s\\n\", r.gerrbuf);\n throw r;\n\t}\n\n\t\/\/ allocate auth handle\n\tcheckenv(&r, OCIHandleAlloc((OCIEnv*)envhp,\n\t\t\t\t\t\t\t(void**)&authp, OCI_HTYPE_AUTHINFO,\n\t\t\t\t\t\t\t(size_t)0, (void **) NULL));\n\n\tr.handle = _errhp;\n\n\t\/\/ usrname and password\n\tcheckerr(&r, OCIAttrSet(authp, OCI_HTYPE_AUTHINFO,\n\t\t\t\t\t\t\t\t(void*) user_name, user_name_len,\n\t\t\t\t\t\t\t\tOCI_ATTR_USERNAME, (OCIError *)_errhp));\n\tcheckerr(&r, OCIAttrSet(authp, OCI_HTYPE_AUTHINFO,\n\t\t\t\t\t\t\t\t(void*) password, password_len,\n\t\t\t\t\t\t\t\tOCI_ATTR_PASSWORD, (OCIError *)_errhp));\n\n\n \/* get the database connection *\/\n checkerr(&r, OCISessionGet((OCIEnv*)envhp, (OCIError *)_errhp,\n (OCISvcCtx**)&_svchp,\t\t\t\t\t\/* returned database connection *\/\n authp,\t\t\t\t\t\t\t\t\t\/* initialized authentication handle *\/ \n (OraText *) connect_str, connect_str_len,\/* connect string *\/\n NULL, 0, NULL, NULL, NULL,\t\t\t\t\/* session tagging parameters: optional *\/\n OCI_DEFAULT));\t\t\t\t\t\/* modes *\/\n\tif(r.fn_ret != SUCCESS) {\n\t\tREMOTE_LOG(\"failed OCISessionGet %s\\n\", r.gerrbuf);\n throw r;\n\t}\n\n\t(void) OCIHandleFree(authp, OCI_HTYPE_AUTHINFO);\n\n\tREMOTE_LOG(\"got session %p %.*s user %.*s\\n\", _svchp, connect_str_len, connect_str, user_name_len, user_name);\n\n\t_sessions.push_back(this);\n}\n\nocistmt* ocisession::prepare_stmt(OraText *stmt, ub4 stmt_len)\n{\n\tocistmt * statement = new ocistmt(this, stmt, stmt_len);\n\t_statements.push_back(statement);\n\treturn statement;\n}\n\nvoid ocisession::release_stmt(ocistmt *stmt)\n{\n\tlist<ocistmt*>::iterator it = std::find(_statements.begin(), _statements.end(), stmt);\n\tif (it != _statements.end()) {\n\t\t_statements.remove(*it);\n\t}\n}\n\nocisession::~ocisession(void)\n{\n\tintf_ret r;\n\n\t\/\/ delete all the statements\n\tfor (list<ocistmt*>::const_iterator it = _statements.begin(); it != _statements.end(); it++)\n\t\t(*it)->close();\n\t_statements.clear();\n\n\tcheckerr(&r, OCISessionRelease((OCISvcCtx*)_svchp, (OCIError*)_errhp, NULL, 0, OCI_DEFAULT));\n\tif(r.fn_ret != SUCCESS) {\n\t\tREMOTE_LOG(\"failed OCISessionRelease %s\\n\", r.gerrbuf);\n throw r;\n\t}\n\n\t(void) OCIHandleFree(_errhp, OCI_HTYPE_ERROR);\n\n\t\/\/ cleanup the environment if this is the last oci session from this environment\n\t_sessions.remove(this);\n\n\t\/\/REMOTE_LOG(\"release session %p\\n\", _svchp);\n}\n\nvoid ocisession::init(void)\n{\n\tintf_ret r;\n \tr.fn_ret = SUCCESS;\n\n\tif(envhp == NULL) {\n\t\tsword ret = 0;\n\t\tret = OCIEnvCreate((OCIEnv**)&envhp,\t\t\/* returned env handle *\/\n\t\t\t\t\t\t OCI_THREADED,\t\t\t\/* initilization modes *\/\n\t\t\t\t\t\t NULL, NULL, NULL, NULL,\t\/* callbacks, context *\/\n\t\t\t\t\t\t (size_t) 0,\t\t\t\t\/* optional extra memory size: optional *\/\n\t\t\t\t\t\t (void**) NULL);\t\t\t\/* returned extra memeory *\/\n\n\t\tr.handle = envhp;\n\t\tcheckenv(&r, ret);\n\t\tif(r.fn_ret != SUCCESS)\n throw r;\n\t}\n}\n<commit_msg>conficts fixed<commit_after>#include \"ocisession.h\"\n#include <algorithm>\n\n#include \"oci_lib_intf.h\"\n\n#include <oci.h>\n\nvoid * ocisession::envhp = NULL;\nlist<ocisession*> ocisession::_sessions;\n\nocisession::ocisession(const char * connect_str, const int connect_str_len,\n\t\t\t\t\t const char * user_name, const int user_name_len,\n\t\t\t\t\t const char * password, const int password_len)\n{\n\tintf_ret r;\n\tOCIAuthInfo *authp = NULL;\n\n\tinit();\n\n\tr.handle = envhp;\n\n\t\/\/ allocate error handle\n\tcheckenv(&r, OCIHandleAlloc((OCIEnv*)envhp,\t\/* environment handle *\/\n (void **) &_errhp,\t\/* returned err handle *\/\n OCI_HTYPE_ERROR,\t\/* typ of handle to allocate *\/\n (size_t) 0,\t\t\t\/* optional extra memory size *\/\n (void **) NULL));\t\/* returned extra memeory *\/\n\n\tif(r.fn_ret != SUCCESS) {\n \t\tREMOTE_LOG(\"failed OCISessionGet %s\\n\", r.gerrbuf);\n throw r;\n\t}\n\n\t\/\/ allocate auth handle\n\tcheckenv(&r, OCIHandleAlloc((OCIEnv*)envhp,\n\t\t\t\t\t\t\t(void**)&authp, OCI_HTYPE_AUTHINFO,\n\t\t\t\t\t\t\t(size_t)0, (void **) NULL));\n\n\tr.handle = _errhp;\n\n\t\/\/ usrname and password\n\tcheckerr(&r, OCIAttrSet(authp, OCI_HTYPE_AUTHINFO,\n\t\t\t\t\t\t\t\t(void*) user_name, user_name_len,\n\t\t\t\t\t\t\t\tOCI_ATTR_USERNAME, (OCIError *)_errhp));\n\tcheckerr(&r, OCIAttrSet(authp, OCI_HTYPE_AUTHINFO,\n\t\t\t\t\t\t\t\t(void*) password, password_len,\n\t\t\t\t\t\t\t\tOCI_ATTR_PASSWORD, (OCIError *)_errhp));\n\n\n \/* get the database connection *\/\n checkerr(&r, OCISessionGet((OCIEnv*)envhp, (OCIError *)_errhp,\n (OCISvcCtx**)&_svchp,\t\t\t\t\t\/* returned database connection *\/\n authp,\t\t\t\t\t\t\t\t\t\/* initialized authentication handle *\/ \n (OraText *) connect_str, connect_str_len,\/* connect string *\/\n NULL, 0, NULL, NULL, NULL,\t\t\t\t\/* session tagging parameters: optional *\/\n OCI_DEFAULT));\t\t\t\t\t \/* modes *\/\n\tif(r.fn_ret != SUCCESS) {\n\t\tREMOTE_LOG(\"failed OCISessionGet %s\\n\", r.gerrbuf);\n throw r;\n\t}\n\n\t(void) OCIHandleFree(authp, OCI_HTYPE_AUTHINFO);\n\n\tREMOTE_LOG(\"got session %p %.*s user %.*s\\n\", _svchp, connect_str_len, connect_str, user_name_len, user_name);\n\n\t_sessions.push_back(this);\n}\n\nocistmt* ocisession::prepare_stmt(OraText *stmt, ub4 stmt_len)\n{\n\tocistmt * statement = new ocistmt(this, stmt, stmt_len);\n\t_statements.push_back(statement);\n\treturn statement;\n}\n\nvoid ocisession::release_stmt(ocistmt *stmt)\n{\n\tlist<ocistmt*>::iterator it = std::find(_statements.begin(), _statements.end(), stmt);\n\tif (it != _statements.end()) {\n\t\t_statements.remove(*it);\n\t}\n}\n\nocisession::~ocisession(void)\n{\n\tintf_ret r;\n\n\t\/\/ delete all the statements\n\tfor (list<ocistmt*>::const_iterator it = _statements.begin(); it != _statements.end(); it++)\n\t\t(*it)->close();\n\t_statements.clear();\n\n\tcheckerr(&r, OCISessionRelease((OCISvcCtx*)_svchp, (OCIError*)_errhp, NULL, 0, OCI_DEFAULT));\n\tif(r.fn_ret != SUCCESS) {\n\t\tREMOTE_LOG(\"failed OCISessionRelease %s\\n\", r.gerrbuf);\n throw r;\n\t}\n\n\t(void) OCIHandleFree(_errhp, OCI_HTYPE_ERROR);\n\n\t\/\/ cleanup the environment if this is the last oci session from this environment\n\t_sessions.remove(this);\n\n\t\/\/REMOTE_LOG(\"release session %p\\n\", _svchp);\n}\n\nvoid ocisession::init(void)\n{\n\tintf_ret r;\n \tr.fn_ret = SUCCESS;\n\n\tif(envhp == NULL) {\n\t\tsword ret = 0;\n\t\tret = OCIEnvCreate((OCIEnv**)&envhp,\t\t\/* returned env handle *\/\n\t\t\t\t\t\t OCI_THREADED,\t\t\t\/* initilization modes *\/\n\t\t\t\t\t\t NULL, NULL, NULL, NULL,\t\/* callbacks, context *\/\n\t\t\t\t\t\t (size_t) 0,\t\t\t\t\/* optional extra memory size: optional *\/\n\t\t\t\t\t\t (void**) NULL);\t\t\t\/* returned extra memeory *\/\n\n\t\tr.handle = envhp;\n\t\tcheckenv(&r, ret);\n\t\tif(r.fn_ret != SUCCESS)\n throw r;\n\t}\n}\n<|endoftext|>"} {"text":"<commit_before>\/*\n * Copyright (c) 2000-2005 The Regents of The University of Michigan\n * Copyright (c) 2008 The Hewlett-Packard Development Company\n * All rights reserved.\n *\n * Redistribution and use in source and binary forms, with or without\n * modification, are permitted provided that the following conditions are\n * met: redistributions of source code must retain the above copyright\n * notice, this list of conditions and the following disclaimer;\n * redistributions in binary form must reproduce the above copyright\n * notice, this list of conditions and the following disclaimer in the\n * documentation and\/or other materials provided with the distribution;\n * neither the name of the copyright holders nor the names of its\n * contributors may be used to endorse or promote products derived from\n * this software without specific prior written permission.\n *\n * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS\n * \"AS IS\" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT\n * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR\n * A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT\n * OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,\n * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT\n * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,\n * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY\n * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT\n * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE\n * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.\n *\n * Authors: Steve Reinhardt\n * Nathan Binkert\n * Steve Raasch\n *\/\n\n#include <cassert>\n#include <iostream>\n#include <string>\n#include <vector>\n\n#include \"base\/hashmap.hh\"\n#include \"base\/misc.hh\"\n#include \"base\/trace.hh\"\n#include \"cpu\/smt.hh\"\n#include \"sim\/core.hh\"\n#include \"sim\/eventq.hh\"\n\nusing namespace std;\n\n\/\/\n\/\/ Main Event Queue\n\/\/\n\/\/ Events on this queue are processed at the *beginning* of each\n\/\/ cycle, before the pipeline simulation is performed.\n\/\/\nEventQueue mainEventQueue(\"Main Event Queue\");\n\n#ifndef NDEBUG\nCounter Event::instanceCounter = 0;\n#endif\n\nEvent::~Event()\n{\n assert(!scheduled());\n flags = 0;\n}\n\nconst std::string\nEvent::name() const\n{\n#ifndef NDEBUG\n return csprintf(\"Event_%d\", instance);\n#else\n return csprintf(\"Event_%x\", (uintptr_t)this);\n#endif\n}\n\n\nEvent *\nEvent::insertBefore(Event *event, Event *curr)\n{\n \/\/ Either way, event will be the top element in the 'in bin' list\n \/\/ which is the pointer we need in order to look into the list, so\n \/\/ we need to insert that into the bin list.\n if (!curr || *event < *curr) {\n \/\/ Insert the event before the current list since it is in the future.\n event->nextBin = curr;\n event->nextInBin = NULL;\n } else {\n \/\/ Since we're on the correct list, we need to point to the next list\n event->nextBin = curr->nextBin; \/\/ curr->nextBin can now become stale\n\n \/\/ Insert event at the top of the stack\n event->nextInBin = curr;\n }\n\n return event;\n}\n\nvoid\nEventQueue::insert(Event *event)\n{\n \/\/ Deal with the head case\n if (!head || *event <= *head) {\n head = Event::insertBefore(event, head);\n return;\n }\n\n \/\/ Figure out either which 'in bin' list we are on, or where a new list\n \/\/ needs to be inserted\n Event *prev = head;\n Event *curr = head->nextBin;\n while (curr && *curr < *event) {\n prev = curr;\n curr = curr->nextBin;\n }\n\n \/\/ Note: this operation may render all nextBin pointers on the\n \/\/ prev 'in bin' list stale (except for the top one)\n prev->nextBin = Event::insertBefore(event, curr);\n}\n\nEvent *\nEvent::removeItem(Event *event, Event *top)\n{\n Event *curr = top;\n Event *next = top->nextInBin;\n\n \/\/ if we removed the top item, we need to handle things specially\n \/\/ and just remove the top item, fixing up the next bin pointer of\n \/\/ the new top item\n if (event == top) {\n if (!next)\n return top->nextBin;\n next->nextBin = top->nextBin;\n return next;\n }\n\n \/\/ Since we already checked the current element, we're going to\n \/\/ keep checking event against the next element.\n while (event != next) {\n if (!next)\n panic(\"event not found!\");\n\n curr = next;\n next = next->nextInBin;\n }\n\n \/\/ remove next from the 'in bin' list since it's what we're looking for\n curr->nextInBin = next->nextInBin;\n return top;\n}\n\nvoid\nEventQueue::remove(Event *event)\n{\n if (head == NULL)\n panic(\"event not found!\");\n\n \/\/ deal with an event on the head's 'in bin' list (event has the same\n \/\/ time as the head)\n if (*head == *event) {\n head = Event::removeItem(event, head);\n return;\n }\n\n \/\/ Find the 'in bin' list that this event belongs on\n Event *prev = head;\n Event *curr = head->nextBin;\n while (curr && *curr < *event) {\n prev = curr;\n curr = curr->nextBin;\n }\n\n if (!curr || *curr != *event)\n panic(\"event not found!\");\n\n \/\/ curr points to the top item of the the correct 'in bin' list, when\n \/\/ we remove an item, it returns the new top item (which may be\n \/\/ unchanged)\n prev->nextBin = Event::removeItem(event, curr);\n}\n\nEvent *\nEventQueue::serviceOne()\n{\n Event *event = head;\n Event *next = head->nextInBin;\n event->flags.clear(Event::Scheduled);\n\n if (next) {\n \/\/ update the next bin pointer since it could be stale\n next->nextBin = head->nextBin;\n\n \/\/ pop the stack\n head = next;\n } else {\n \/\/ this was the only element on the 'in bin' list, so get rid of\n \/\/ the 'in bin' list and point to the next bin list\n head = head->nextBin;\n }\n\n \/\/ handle action\n if (!event->squashed()) {\n event->process();\n if (event->isExitEvent()) {\n assert(!event->flags.isSet(Event::AutoDelete)); \/\/ would be silly\n return event;\n }\n } else {\n event->flags.clear(Event::Squashed);\n }\n\n if (event->flags.isSet(Event::AutoDelete) && !event->scheduled())\n delete event;\n\n return NULL;\n}\n\nvoid\nEvent::serialize(std::ostream &os)\n{\n SERIALIZE_SCALAR(_when);\n SERIALIZE_SCALAR(_priority);\n short _flags = flags;\n SERIALIZE_SCALAR(_flags);\n}\n\nvoid\nEvent::unserialize(Checkpoint *cp, const string §ion)\n{\n if (scheduled())\n mainEventQueue.deschedule(this);\n\n UNSERIALIZE_SCALAR(_when);\n UNSERIALIZE_SCALAR(_priority);\n\n \/\/ need to see if original event was in a scheduled, unsquashed\n \/\/ state, but don't want to restore those flags in the current\n \/\/ object itself (since they aren't immediately true)\n short _flags;\n UNSERIALIZE_SCALAR(_flags);\n assert(initialized());\n flags = _flags;\n flags.set(Initialized);\n\n bool wasScheduled = flags.isSet(Scheduled) && !flags.isSet(Squashed);\n flags.clear(Squashed | Scheduled);\n\n if (wasScheduled) {\n DPRINTF(Config, \"rescheduling at %d\\n\", _when);\n mainEventQueue.schedule(this, _when);\n }\n}\n\nvoid\nEventQueue::serialize(ostream &os)\n{\n std::list<Event *> eventPtrs;\n\n int numEvents = 0;\n Event *nextBin = head;\n while (nextBin) {\n Event *nextInBin = nextBin;\n\n while (nextInBin) {\n if (nextInBin->flags.isSet(Event::AutoSerialize)) {\n eventPtrs.push_back(nextInBin);\n paramOut(os, csprintf(\"event%d\", numEvents++),\n nextInBin->name());\n }\n nextInBin = nextInBin->nextInBin;\n }\n\n nextBin = nextBin->nextBin;\n }\n\n SERIALIZE_SCALAR(numEvents);\n\n for (std::list<Event *>::iterator it = eventPtrs.begin();\n it != eventPtrs.end(); ++it) {\n (*it)->nameOut(os);\n (*it)->serialize(os);\n }\n}\n\nvoid\nEventQueue::unserialize(Checkpoint *cp, const std::string §ion)\n{\n int numEvents;\n UNSERIALIZE_SCALAR(numEvents);\n\n std::string eventName;\n for (int i = 0; i < numEvents; i++) {\n \/\/ get the pointer value associated with the event\n paramIn(cp, section, csprintf(\"event%d\", i), eventName);\n\n \/\/ create the event based on its pointer value\n Serializable::create(cp, eventName);\n }\n}\n\nvoid\nEventQueue::dump() const\n{\n cprintf(\"============================================================\\n\");\n cprintf(\"EventQueue Dump (cycle %d)\\n\", curTick);\n cprintf(\"------------------------------------------------------------\\n\");\n\n if (empty())\n cprintf(\"<No Events>\\n\");\n else {\n Event *nextBin = head;\n while (nextBin) {\n Event *nextInBin = nextBin;\n while (nextInBin) {\n nextInBin->dump();\n nextInBin = nextInBin->nextInBin;\n }\n\n nextBin = nextBin->nextBin;\n }\n }\n\n cprintf(\"============================================================\\n\");\n}\n\nbool\nEventQueue::debugVerify() const\n{\n m5::hash_map<long, bool> map;\n\n Tick time = 0;\n short priority = 0;\n\n Event *nextBin = head;\n while (nextBin) {\n Event *nextInBin = nextBin;\n while (nextInBin) {\n if (nextInBin->when() < time) {\n cprintf(\"time goes backwards!\");\n nextInBin->dump();\n return false;\n } else if (nextInBin->when() == time &&\n nextInBin->priority() < priority) {\n cprintf(\"priority inverted!\");\n nextInBin->dump();\n return false;\n }\n\n if (map[reinterpret_cast<long>(nextInBin)]) {\n cprintf(\"Node already seen\");\n nextInBin->dump();\n return false;\n }\n map[reinterpret_cast<long>(nextInBin)] = true;\n\n time = nextInBin->when();\n priority = nextInBin->priority();\n\n nextInBin = nextInBin->nextInBin;\n }\n\n nextBin = nextBin->nextBin;\n }\n\n return true;\n}\n\nvoid\ndumpMainQueue()\n{\n mainEventQueue.dump();\n}\n\n\nconst char *\nEvent::description() const\n{\n return \"generic\";\n}\n\nvoid\nEvent::trace(const char *action)\n{\n \/\/ This DPRINTF is unconditional because calls to this function\n \/\/ are protected by an 'if (DTRACE(Event))' in the inlined Event\n \/\/ methods.\n \/\/\n \/\/ This is just a default implementation for derived classes where\n \/\/ it's not worth doing anything special. If you want to put a\n \/\/ more informative message in the trace, override this method on\n \/\/ the particular subclass where you have the information that\n \/\/ needs to be printed.\n DPRINTFN(\"%s event %s @ %d\\n\", description(), action, when());\n}\n\nvoid\nEvent::dump() const\n{\n cprintf(\"Event %s (%s)\\n\", name(), description());\n cprintf(\"Flags: %#x\\n\", flags);\n#ifdef EVENTQ_DEBUG\n cprintf(\"Created: %d\\n\", whenCreated);\n#endif\n if (scheduled()) {\n#ifdef EVENTQ_DEBUG\n cprintf(\"Scheduled at %d\\n\", whenScheduled);\n#endif\n cprintf(\"Scheduled for %d, priority %d\\n\", when(), _priority);\n } else {\n cprintf(\"Not Scheduled\\n\");\n }\n}\n\nEventQueue::EventQueue(const string &n)\n : objName(n), head(NULL)\n{}\n<commit_msg>flags: add comment to avoid future deletions since code appears redundant.<commit_after>\/*\n * Copyright (c) 2000-2005 The Regents of The University of Michigan\n * Copyright (c) 2008 The Hewlett-Packard Development Company\n * All rights reserved.\n *\n * Redistribution and use in source and binary forms, with or without\n * modification, are permitted provided that the following conditions are\n * met: redistributions of source code must retain the above copyright\n * notice, this list of conditions and the following disclaimer;\n * redistributions in binary form must reproduce the above copyright\n * notice, this list of conditions and the following disclaimer in the\n * documentation and\/or other materials provided with the distribution;\n * neither the name of the copyright holders nor the names of its\n * contributors may be used to endorse or promote products derived from\n * this software without specific prior written permission.\n *\n * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS\n * \"AS IS\" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT\n * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR\n * A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT\n * OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,\n * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT\n * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,\n * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY\n * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT\n * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE\n * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.\n *\n * Authors: Steve Reinhardt\n * Nathan Binkert\n * Steve Raasch\n *\/\n\n#include <cassert>\n#include <iostream>\n#include <string>\n#include <vector>\n\n#include \"base\/hashmap.hh\"\n#include \"base\/misc.hh\"\n#include \"base\/trace.hh\"\n#include \"cpu\/smt.hh\"\n#include \"sim\/core.hh\"\n#include \"sim\/eventq.hh\"\n\nusing namespace std;\n\n\/\/\n\/\/ Main Event Queue\n\/\/\n\/\/ Events on this queue are processed at the *beginning* of each\n\/\/ cycle, before the pipeline simulation is performed.\n\/\/\nEventQueue mainEventQueue(\"Main Event Queue\");\n\n#ifndef NDEBUG\nCounter Event::instanceCounter = 0;\n#endif\n\nEvent::~Event()\n{\n assert(!scheduled());\n flags = 0;\n}\n\nconst std::string\nEvent::name() const\n{\n#ifndef NDEBUG\n return csprintf(\"Event_%d\", instance);\n#else\n return csprintf(\"Event_%x\", (uintptr_t)this);\n#endif\n}\n\n\nEvent *\nEvent::insertBefore(Event *event, Event *curr)\n{\n \/\/ Either way, event will be the top element in the 'in bin' list\n \/\/ which is the pointer we need in order to look into the list, so\n \/\/ we need to insert that into the bin list.\n if (!curr || *event < *curr) {\n \/\/ Insert the event before the current list since it is in the future.\n event->nextBin = curr;\n event->nextInBin = NULL;\n } else {\n \/\/ Since we're on the correct list, we need to point to the next list\n event->nextBin = curr->nextBin; \/\/ curr->nextBin can now become stale\n\n \/\/ Insert event at the top of the stack\n event->nextInBin = curr;\n }\n\n return event;\n}\n\nvoid\nEventQueue::insert(Event *event)\n{\n \/\/ Deal with the head case\n if (!head || *event <= *head) {\n head = Event::insertBefore(event, head);\n return;\n }\n\n \/\/ Figure out either which 'in bin' list we are on, or where a new list\n \/\/ needs to be inserted\n Event *prev = head;\n Event *curr = head->nextBin;\n while (curr && *curr < *event) {\n prev = curr;\n curr = curr->nextBin;\n }\n\n \/\/ Note: this operation may render all nextBin pointers on the\n \/\/ prev 'in bin' list stale (except for the top one)\n prev->nextBin = Event::insertBefore(event, curr);\n}\n\nEvent *\nEvent::removeItem(Event *event, Event *top)\n{\n Event *curr = top;\n Event *next = top->nextInBin;\n\n \/\/ if we removed the top item, we need to handle things specially\n \/\/ and just remove the top item, fixing up the next bin pointer of\n \/\/ the new top item\n if (event == top) {\n if (!next)\n return top->nextBin;\n next->nextBin = top->nextBin;\n return next;\n }\n\n \/\/ Since we already checked the current element, we're going to\n \/\/ keep checking event against the next element.\n while (event != next) {\n if (!next)\n panic(\"event not found!\");\n\n curr = next;\n next = next->nextInBin;\n }\n\n \/\/ remove next from the 'in bin' list since it's what we're looking for\n curr->nextInBin = next->nextInBin;\n return top;\n}\n\nvoid\nEventQueue::remove(Event *event)\n{\n if (head == NULL)\n panic(\"event not found!\");\n\n \/\/ deal with an event on the head's 'in bin' list (event has the same\n \/\/ time as the head)\n if (*head == *event) {\n head = Event::removeItem(event, head);\n return;\n }\n\n \/\/ Find the 'in bin' list that this event belongs on\n Event *prev = head;\n Event *curr = head->nextBin;\n while (curr && *curr < *event) {\n prev = curr;\n curr = curr->nextBin;\n }\n\n if (!curr || *curr != *event)\n panic(\"event not found!\");\n\n \/\/ curr points to the top item of the the correct 'in bin' list, when\n \/\/ we remove an item, it returns the new top item (which may be\n \/\/ unchanged)\n prev->nextBin = Event::removeItem(event, curr);\n}\n\nEvent *\nEventQueue::serviceOne()\n{\n Event *event = head;\n Event *next = head->nextInBin;\n event->flags.clear(Event::Scheduled);\n\n if (next) {\n \/\/ update the next bin pointer since it could be stale\n next->nextBin = head->nextBin;\n\n \/\/ pop the stack\n head = next;\n } else {\n \/\/ this was the only element on the 'in bin' list, so get rid of\n \/\/ the 'in bin' list and point to the next bin list\n head = head->nextBin;\n }\n\n \/\/ handle action\n if (!event->squashed()) {\n event->process();\n if (event->isExitEvent()) {\n assert(!event->flags.isSet(Event::AutoDelete)); \/\/ would be silly\n return event;\n }\n } else {\n event->flags.clear(Event::Squashed);\n }\n\n if (event->flags.isSet(Event::AutoDelete) && !event->scheduled())\n delete event;\n\n return NULL;\n}\n\nvoid\nEvent::serialize(std::ostream &os)\n{\n SERIALIZE_SCALAR(_when);\n SERIALIZE_SCALAR(_priority);\n short _flags = flags;\n SERIALIZE_SCALAR(_flags);\n}\n\nvoid\nEvent::unserialize(Checkpoint *cp, const string §ion)\n{\n if (scheduled())\n mainEventQueue.deschedule(this);\n\n UNSERIALIZE_SCALAR(_when);\n UNSERIALIZE_SCALAR(_priority);\n\n short _flags;\n UNSERIALIZE_SCALAR(_flags);\n\n \/\/ Old checkpoints had no concept of the Initialized flag\n \/\/ so restoring from old checkpoints always fail.\n \/\/ Events are initialized on construction but original code \n \/\/ \"flags = _flags\" would just overwrite the initialization. \n \/\/ So, read in the checkpoint flags, but then set the Initialized \n \/\/ flag on top of it in order to avoid failures.\n assert(initialized());\n flags = _flags;\n flags.set(Initialized);\n\n \/\/ need to see if original event was in a scheduled, unsquashed\n \/\/ state, but don't want to restore those flags in the current\n \/\/ object itself (since they aren't immediately true)\n bool wasScheduled = flags.isSet(Scheduled) && !flags.isSet(Squashed);\n flags.clear(Squashed | Scheduled);\n\n if (wasScheduled) {\n DPRINTF(Config, \"rescheduling at %d\\n\", _when);\n mainEventQueue.schedule(this, _when);\n }\n}\n\nvoid\nEventQueue::serialize(ostream &os)\n{\n std::list<Event *> eventPtrs;\n\n int numEvents = 0;\n Event *nextBin = head;\n while (nextBin) {\n Event *nextInBin = nextBin;\n\n while (nextInBin) {\n if (nextInBin->flags.isSet(Event::AutoSerialize)) {\n eventPtrs.push_back(nextInBin);\n paramOut(os, csprintf(\"event%d\", numEvents++),\n nextInBin->name());\n }\n nextInBin = nextInBin->nextInBin;\n }\n\n nextBin = nextBin->nextBin;\n }\n\n SERIALIZE_SCALAR(numEvents);\n\n for (std::list<Event *>::iterator it = eventPtrs.begin();\n it != eventPtrs.end(); ++it) {\n (*it)->nameOut(os);\n (*it)->serialize(os);\n }\n}\n\nvoid\nEventQueue::unserialize(Checkpoint *cp, const std::string §ion)\n{\n int numEvents;\n UNSERIALIZE_SCALAR(numEvents);\n\n std::string eventName;\n for (int i = 0; i < numEvents; i++) {\n \/\/ get the pointer value associated with the event\n paramIn(cp, section, csprintf(\"event%d\", i), eventName);\n\n \/\/ create the event based on its pointer value\n Serializable::create(cp, eventName);\n }\n}\n\nvoid\nEventQueue::dump() const\n{\n cprintf(\"============================================================\\n\");\n cprintf(\"EventQueue Dump (cycle %d)\\n\", curTick);\n cprintf(\"------------------------------------------------------------\\n\");\n\n if (empty())\n cprintf(\"<No Events>\\n\");\n else {\n Event *nextBin = head;\n while (nextBin) {\n Event *nextInBin = nextBin;\n while (nextInBin) {\n nextInBin->dump();\n nextInBin = nextInBin->nextInBin;\n }\n\n nextBin = nextBin->nextBin;\n }\n }\n\n cprintf(\"============================================================\\n\");\n}\n\nbool\nEventQueue::debugVerify() const\n{\n m5::hash_map<long, bool> map;\n\n Tick time = 0;\n short priority = 0;\n\n Event *nextBin = head;\n while (nextBin) {\n Event *nextInBin = nextBin;\n while (nextInBin) {\n if (nextInBin->when() < time) {\n cprintf(\"time goes backwards!\");\n nextInBin->dump();\n return false;\n } else if (nextInBin->when() == time &&\n nextInBin->priority() < priority) {\n cprintf(\"priority inverted!\");\n nextInBin->dump();\n return false;\n }\n\n if (map[reinterpret_cast<long>(nextInBin)]) {\n cprintf(\"Node already seen\");\n nextInBin->dump();\n return false;\n }\n map[reinterpret_cast<long>(nextInBin)] = true;\n\n time = nextInBin->when();\n priority = nextInBin->priority();\n\n nextInBin = nextInBin->nextInBin;\n }\n\n nextBin = nextBin->nextBin;\n }\n\n return true;\n}\n\nvoid\ndumpMainQueue()\n{\n mainEventQueue.dump();\n}\n\n\nconst char *\nEvent::description() const\n{\n return \"generic\";\n}\n\nvoid\nEvent::trace(const char *action)\n{\n \/\/ This DPRINTF is unconditional because calls to this function\n \/\/ are protected by an 'if (DTRACE(Event))' in the inlined Event\n \/\/ methods.\n \/\/\n \/\/ This is just a default implementation for derived classes where\n \/\/ it's not worth doing anything special. If you want to put a\n \/\/ more informative message in the trace, override this method on\n \/\/ the particular subclass where you have the information that\n \/\/ needs to be printed.\n DPRINTFN(\"%s event %s @ %d\\n\", description(), action, when());\n}\n\nvoid\nEvent::dump() const\n{\n cprintf(\"Event %s (%s)\\n\", name(), description());\n cprintf(\"Flags: %#x\\n\", flags);\n#ifdef EVENTQ_DEBUG\n cprintf(\"Created: %d\\n\", whenCreated);\n#endif\n if (scheduled()) {\n#ifdef EVENTQ_DEBUG\n cprintf(\"Scheduled at %d\\n\", whenScheduled);\n#endif\n cprintf(\"Scheduled for %d, priority %d\\n\", when(), _priority);\n } else {\n cprintf(\"Not Scheduled\\n\");\n }\n}\n\nEventQueue::EventQueue(const string &n)\n : objName(n), head(NULL)\n{}\n<|endoftext|>"} {"text":"<commit_before>\/*\n * Copyright (c) 2003-2005 The Regents of The University of Michigan\n * All rights reserved.\n *\n * Redistribution and use in source and binary forms, with or without\n * modification, are permitted provided that the following conditions are\n * met: redistributions of source code must retain the above copyright\n * notice, this list of conditions and the following disclaimer;\n * redistributions in binary form must reproduce the above copyright\n * notice, this list of conditions and the following disclaimer in the\n * documentation and\/or other materials provided with the distribution;\n * neither the name of the copyright holders nor the names of its\n * contributors may be used to endorse or promote products derived from\n * this software without specific prior written permission.\n *\n * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS\n * \"AS IS\" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT\n * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR\n * A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT\n * OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,\n * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT\n * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,\n * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY\n * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT\n * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE\n * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.\n *\n * Authors: Nathan Binkert\n * Gabe Black\n *\/\n\n#ifndef __FAULTS_HH__\n#define __FAULTS_HH__\n\n#include \"base\/refcnt.hh\"\n#include \"sim\/stats.hh\"\n#include \"config\/full_system.hh\"\n\nclass ThreadContext;\nclass FaultBase;\ntypedef RefCountingPtr<FaultBase> Fault;\n\ntypedef const char * FaultName;\ntypedef Stats::Scalar FaultStat;\n\n\/\/ Each class has it's name statically define in _name,\n\/\/ and has a virtual function to access it's name.\n\/\/ The function is necessary because otherwise, all objects\n\/\/ which are being accessed cast as a FaultBase * (namely\n\/\/ all faults returned using the Fault type) will use the\n\/\/ generic FaultBase name.\n\nclass FaultBase : public RefCounted\n{\n public:\n virtual FaultName name() const = 0;\n virtual void invoke(ThreadContext * tc);\n\/\/ template<typename T>\n\/\/ bool isA() {return dynamic_cast<T *>(this);}\n virtual bool isMachineCheckFault() const {return false;}\n virtual bool isAlignmentFault() const {return false;}\n};\n\nFaultBase * const NoFault = 0;\n\nclass UnimpFault : public FaultBase\n{\n private:\n std::string panicStr;\n public:\n UnimpFault(std::string _str)\n : panicStr(_str)\n { }\n\n FaultName name() const {return \"Unimplemented simulator feature\";}\n void invoke(ThreadContext * tc);\n};\n\n#if !FULL_SYSTEM\nclass GenericPageTableFault : public FaultBase\n{\n private:\n Addr vaddr;\n public:\n FaultName name() const {return \"Generic page table fault\";}\n GenericPageTableFault(Addr va) : vaddr(va) {}\n void invoke(ThreadContext * tc);\n};\n\nclass GenericAlignmentFault : public FaultBase\n{\n private:\n Addr vaddr;\n public:\n FaultName name() const {return \"Generic alignment fault\";}\n GenericAlignmentFault(Addr va) : vaddr(va) {}\n void invoke(ThreadContext * tc);\n};\n#endif\n\n#endif \/\/ __FAULTS_HH__\n<commit_msg>Faults: Get rid of some commented out code in sim\/faults.hh.<commit_after>\/*\n * Copyright (c) 2003-2005 The Regents of The University of Michigan\n * All rights reserved.\n *\n * Redistribution and use in source and binary forms, with or without\n * modification, are permitted provided that the following conditions are\n * met: redistributions of source code must retain the above copyright\n * notice, this list of conditions and the following disclaimer;\n * redistributions in binary form must reproduce the above copyright\n * notice, this list of conditions and the following disclaimer in the\n * documentation and\/or other materials provided with the distribution;\n * neither the name of the copyright holders nor the names of its\n * contributors may be used to endorse or promote products derived from\n * this software without specific prior written permission.\n *\n * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS\n * \"AS IS\" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT\n * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR\n * A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT\n * OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,\n * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT\n * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,\n * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY\n * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT\n * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE\n * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.\n *\n * Authors: Nathan Binkert\n * Gabe Black\n *\/\n\n#ifndef __FAULTS_HH__\n#define __FAULTS_HH__\n\n#include \"base\/refcnt.hh\"\n#include \"sim\/stats.hh\"\n#include \"config\/full_system.hh\"\n\nclass ThreadContext;\nclass FaultBase;\ntypedef RefCountingPtr<FaultBase> Fault;\n\ntypedef const char * FaultName;\ntypedef Stats::Scalar FaultStat;\n\n\/\/ Each class has it's name statically define in _name,\n\/\/ and has a virtual function to access it's name.\n\/\/ The function is necessary because otherwise, all objects\n\/\/ which are being accessed cast as a FaultBase * (namely\n\/\/ all faults returned using the Fault type) will use the\n\/\/ generic FaultBase name.\n\nclass FaultBase : public RefCounted\n{\n public:\n virtual FaultName name() const = 0;\n virtual void invoke(ThreadContext * tc);\n virtual bool isMachineCheckFault() const {return false;}\n virtual bool isAlignmentFault() const {return false;}\n};\n\nFaultBase * const NoFault = 0;\n\nclass UnimpFault : public FaultBase\n{\n private:\n std::string panicStr;\n public:\n UnimpFault(std::string _str)\n : panicStr(_str)\n { }\n\n FaultName name() const {return \"Unimplemented simulator feature\";}\n void invoke(ThreadContext * tc);\n};\n\n#if !FULL_SYSTEM\nclass GenericPageTableFault : public FaultBase\n{\n private:\n Addr vaddr;\n public:\n FaultName name() const {return \"Generic page table fault\";}\n GenericPageTableFault(Addr va) : vaddr(va) {}\n void invoke(ThreadContext * tc);\n};\n\nclass GenericAlignmentFault : public FaultBase\n{\n private:\n Addr vaddr;\n public:\n FaultName name() const {return \"Generic alignment fault\";}\n GenericAlignmentFault(Addr va) : vaddr(va) {}\n void invoke(ThreadContext * tc);\n};\n#endif\n\n#endif \/\/ __FAULTS_HH__\n<|endoftext|>"} {"text":"<commit_before>#include \"geometry.hpp\"\n\nSegment::Segment()\n{\n p1=sf::Vector2f(0.f,0.f);\n p2=sf::Vector2f(0.f,0.f);\n}\n\nSegment::Segment(sf::Vector2f pointA, sf::Vector2f pointB)\n{\n p1=pointA;\n p2=pointB;\n}\n\nconst sf::Vector2f Segment::intersection_time(const Segment &other) const\n{\n auto dir1 = p2 - p1;\n auto dir2 = other.p2 - other.p1;\n \/*\n Now we try to solve p1 + t1 * dir1 = other.p1 + t2 * dir2\n This is a system of two linear equations\n *\/\n float a = dir1.x;\n float b = -dir2.x;\n float c = dir1.y;\n float d = -dir2.y;\n float det = (a * d - b * c);\n if (-epsilon <= det && det <= epsilon) {\n return sf::Vector2f(-42, -42); \/\/ Segments are parallel\n }\n float e = other.p1.x - p1.x;\n float f = other.p1.y - p1.y;\n float t1 = (d * e - b * f) \/ det;\n float t2 = (-c * e + a * f) \/ det;\n return sf::Vector2f(t1, t2);\n}\n\nconst sf::Vector2f Segment::intersection(const Segment &other) const {\n sf::Vector2f it = intersection_time(other);\n if (check(it.x) && check(it.y)) {\n \/\/ Intersection\n return interp(p1, p2, it.x);\n }\n return sf::Vector2f(-42, -42);\n};\n\nconst sf::Vector2f Segment::intersection_droites(const Segment &other) const\n{\n sf::Vector2f it = intersection_time(other);\n return interp(p1, p2, it.x);\n};\n\nvoid Segment::intersection_triangle(const sf::Vector2f lumiere,\n const Segment &tri, std::vector<Segment> &result) {\n Segment tri1 = Segment(lumiere, tri.p1);\n Segment tri2 = Segment(lumiere, tri.p2);\n sf::Vector2f it1 = intersection_time(tri1);\n sf::Vector2f it2 = intersection_time(tri2);\n sf::Vector2f it3 = intersection_time(tri);\n sf::Vector2f si1 = interp(lumiere, tri.p1, it1.y);\n sf::Vector2f si2 = interp(lumiere, tri.p2, it2.y);\n sf::Vector2f si3 = interp(tri.p1, tri.p2, it3.y);\n\n if (!(check(it1.y) || check(it2.y) || check(it3.y))) {\n \/\/ La droite du segment ne passe pas dans le triangle\n result.push_back(tri);\n return;\n }\n\n if (!check_strict(it3.y)) {\n \/\/ La droite coupe les deux cotes principaux\n float u, v;\n sf::Vector2f pp1, pp2;\n if (it1.x < it2.x) {\n pp1 = p1; pp2 = p2; u = it1.x; v = it2.x;\n } else {\n pp1 = p2; pp2 = p1; u = it2.x; v = it1.x;\n }\n if (v < epsilon || u > 1.f - epsilon) {\n \/\/ Segment à l'extérieur du triangle\n result.push_back(tri);\n return;\n }\n sf::Vector2f inter1 = tri.intersection_droites(Segment(lumiere, pp1));\n sf::Vector2f inter2 = tri.intersection_droites(Segment(lumiere, pp2));\n if (-epsilon <= u && v < 1.f + epsilon) {\n \/\/ Completement a l'interieur\n result.push_back(Segment(tri.p1, inter1));\n result.push_back(Segment(pp1, pp2));\n result.push_back(Segment(inter2, tri.p2));\n return;\n }\n \/\/ On intersecte un seul cote\n if (check(it1.x)) {\n \/\/ On intersecte cote 1\n result.push_back(Segment(si1, pp2));\n result.push_back(Segment(inter2, tri.p2));\n return;\n } else {\n \/\/ On intersecte cote 2\n result.push_back(Segment(tri.p1, inter1));\n result.push_back(Segment(pp1, si2));\n return;\n }\n }\n\n if (!check_strict(it1.y)) {\n \/\/ On coupe cote 2 et le bout\n float u, v;\n sf::Vector2f pp1, pp2;\n if (it3.x < it2.x) {\n pp1 = p1; pp2 = p2; u = it3.x; v = it2.x;\n } else {\n pp1 = p2; pp2 = p1; u = it2.x; v = it3.x;\n }\n if (v < epsilon || u > 1.f - epsilon) {\n \/\/ Segment à l'extérieur du triangle\n result.push_back(tri);\n return;\n }\n sf::Vector2f inter1 = tri.intersection_droites(Segment(lumiere, pp1));\n sf::Vector2f inter2 = tri.intersection_droites(Segment(lumiere, pp2));\n if (-epsilon <= u && v < 1.f + epsilon) {\n \/\/ Completement a l'interieur\n result.push_back(Segment(tri.p1, inter1));\n result.push_back(Segment(pp1, pp2));\n result.push_back(Segment(inter2, tri.p2));\n return;\n }\n \/\/ On intersecte un seul cote\n if (check(it3.x)) {\n \/\/ On intersecte le bout\n result.push_back(Segment(tri.p1, si3));\n result.push_back(Segment(si3, pp2));\n result.push_back(Segment(inter2, tri.p2));\n return;\n } else {\n \/\/ On intersecte cote 2\n result.push_back(Segment(tri.p1, inter1));\n result.push_back(Segment(pp1, si2));\n return;\n }\n } else {\n \/\/ On coupe cote 1 et le bout\n float u, v;\n sf::Vector2f pp1, pp2;\n if (it1.x < it3.x) {\n pp1 = p1; pp2 = p2; u = it1.x; v = it3.x;\n } else {\n pp1 = p2; pp2 = p1; u = it3.x; v = it1.x;\n }\n if (v < epsilon || u > 1.f - epsilon) {\n \/\/ Segment à l'extérieur du triangle\n result.push_back(tri);\n return;\n }\n sf::Vector2f inter1 = tri.intersection_droites(Segment(lumiere, pp1));\n sf::Vector2f inter2 = tri.intersection_droites(Segment(lumiere, pp2));\n if (-epsilon <= u && v < 1.f + epsilon) {\n \/\/ Completement a l'interieur\n result.push_back(Segment(tri.p1, inter1));\n result.push_back(Segment(pp1, pp2));\n result.push_back(Segment(inter2, tri.p2));\n return;\n }\n \/\/ On intersecte un seul cote\n if (check(it3.x)) {\n \/\/ On intersecte le bout\n result.push_back(Segment(tri.p1, inter1));\n result.push_back(Segment(pp1, si3));\n result.push_back(Segment(si3, tri.p2));\n return;\n } else {\n \/\/ On intersecte cote 1\n result.push_back(Segment(si1, pp2));\n result.push_back(Segment(inter2, tri.p2));\n return;\n }\n }\n};\n<commit_msg>Fix la lumière passe à travers les murs<commit_after>#include \"geometry.hpp\"\n\nSegment::Segment()\n{\n p1=sf::Vector2f(0.f,0.f);\n p2=sf::Vector2f(0.f,0.f);\n}\n\nSegment::Segment(sf::Vector2f pointA, sf::Vector2f pointB)\n{\n p1=pointA;\n p2=pointB;\n}\n\nconst sf::Vector2f Segment::intersection_time(const Segment &other) const\n{\n auto dir1 = p2 - p1;\n auto dir2 = other.p2 - other.p1;\n \/*\n Now we try to solve p1 + t1 * dir1 = other.p1 + t2 * dir2\n This is a system of two linear equations\n *\/\n float a = dir1.x;\n float b = -dir2.x;\n float c = dir1.y;\n float d = -dir2.y;\n float det = (a * d - b * c);\n if (-epsilon <= det && det <= epsilon) {\n return sf::Vector2f(-42, -42); \/\/ Segments are parallel\n }\n float e = other.p1.x - p1.x;\n float f = other.p1.y - p1.y;\n float t1 = (d * e - b * f) \/ det;\n float t2 = (-c * e + a * f) \/ det;\n return sf::Vector2f(t1, t2);\n}\n\nconst sf::Vector2f Segment::intersection(const Segment &other) const {\n sf::Vector2f it = intersection_time(other);\n if (check(it.x) && check(it.y)) {\n \/\/ Intersection\n return interp(p1, p2, it.x);\n }\n return sf::Vector2f(-42, -42);\n};\n\nconst sf::Vector2f Segment::intersection_droites(const Segment &other) const\n{\n sf::Vector2f it = intersection_time(other);\n return interp(p1, p2, it.x);\n};\n\nvoid Segment::intersection_triangle(const sf::Vector2f lumiere,\n const Segment &tri, std::vector<Segment> &result) {\n Segment tri1 = Segment(lumiere, tri.p1);\n Segment tri2 = Segment(lumiere, tri.p2);\n sf::Vector2f it1 = intersection_time(tri1);\n sf::Vector2f it2 = intersection_time(tri2);\n sf::Vector2f it3 = intersection_time(tri);\n sf::Vector2f si1 = interp(lumiere, tri.p1, it1.y);\n sf::Vector2f si2 = interp(lumiere, tri.p2, it2.y);\n sf::Vector2f si3 = interp(tri.p1, tri.p2, it3.y);\n\n if (!(check(it1.y) || check(it2.y) || check(it3.y))) {\n \/\/ La droite du segment ne passe pas dans le triangle\n result.push_back(tri);\n return;\n }\n\n if (!check_strict(it3.y)) {\n \/\/ La droite coupe les deux cotes principaux\n float u, v;\n sf::Vector2f pp1, pp2;\n if (it1.x < it2.x) {\n pp1 = p1; pp2 = p2; u = it1.x; v = it2.x;\n } else {\n pp1 = p2; pp2 = p1; u = it2.x; v = it1.x;\n }\n if (v < epsilon || u > 1.f - epsilon) {\n \/\/ Segment à l'extérieur du triangle\n result.push_back(tri);\n return;\n }\n sf::Vector2f inter1 = tri.intersection_droites(Segment(lumiere, pp1));\n sf::Vector2f inter2 = tri.intersection_droites(Segment(lumiere, pp2));\n if (-epsilon > u && v > 1.f + epsilon) {\n \/\/ Completement a l'interieur\n result.push_back(Segment(tri.p1, inter1));\n result.push_back(Segment(pp1, pp2));\n result.push_back(Segment(inter2, tri.p2));\n return;\n }\n\t\tif (check(it1.x) && check(it2.x)) {\n\t\t\t\/\/ On intersecte les deux cotes\n\t\t\tresult.push_back(Segment(si1, si2));\n\t\t\treturn;\n \/\/ On intersecte un seul cote\n } else if (check(it1.x)) {\n \/\/ On intersecte cote 1\n result.push_back(Segment(si1, pp2));\n result.push_back(Segment(inter2, tri.p2));\n return;\n } else {\n \/\/ On intersecte cote 2\n result.push_back(Segment(tri.p1, inter1));\n result.push_back(Segment(pp1, si2));\n return;\n }\n }\n\n if (!check_strict(it1.y)) {\n \/\/ On coupe cote 2 et le bout\n float u, v;\n sf::Vector2f pp1, pp2;\n if (it3.x < it2.x) {\n pp1 = p1; pp2 = p2; u = it3.x; v = it2.x;\n } else {\n pp1 = p2; pp2 = p1; u = it2.x; v = it3.x;\n }\n if (v < epsilon || u > 1.f - epsilon) {\n \/\/ Segment à l'extérieur du triangle\n result.push_back(tri);\n return;\n }\n sf::Vector2f inter1 = tri.intersection_droites(Segment(lumiere, pp1));\n sf::Vector2f inter2 = tri.intersection_droites(Segment(lumiere, pp2));\n if (-epsilon > u && v > 1.f + epsilon) {\n \/\/ Completement a l'interieur\n result.push_back(Segment(tri.p1, inter1));\n result.push_back(Segment(pp1, pp2));\n result.push_back(Segment(inter2, tri.p2));\n return;\n }\n\t\tif (check(it2.x) && check(it3.x)) {\n\t\t\t\/\/ On intersecte les deux cotes\n\t\t\tresult.push_back(Segment(tri.p1, si3));\n\t\t\tresult.push_back(Segment(si3, si2));\n\t\t\treturn;\n \/\/ On intersecte un seul cote\n } else if (check(it3.x)) {\n \/\/ On intersecte le bout\n result.push_back(Segment(tri.p1, si3));\n result.push_back(Segment(si3, pp2));\n result.push_back(Segment(inter2, tri.p2));\n return;\n } else {\n \/\/ On intersecte cote 2\n result.push_back(Segment(tri.p1, inter1));\n result.push_back(Segment(pp1, si2));\n return;\n }\n } else {\n \/\/ On coupe cote 1 et le bout\n float u, v;\n sf::Vector2f pp1, pp2;\n if (it1.x < it3.x) {\n pp1 = p1; pp2 = p2; u = it1.x; v = it3.x;\n } else {\n pp1 = p2; pp2 = p1; u = it3.x; v = it1.x;\n }\n if (v < epsilon || u > 1.f - epsilon) {\n \/\/ Segment à l'extérieur du triangle\n result.push_back(tri);\n return;\n }\n sf::Vector2f inter1 = tri.intersection_droites(Segment(lumiere, pp1));\n sf::Vector2f inter2 = tri.intersection_droites(Segment(lumiere, pp2));\n if (-epsilon > u && v > 1.f + epsilon) {\n \/\/ Completement a l'interieur\n result.push_back(Segment(tri.p1, inter1));\n result.push_back(Segment(pp1, pp2));\n result.push_back(Segment(inter2, tri.p2));\n return;\n }\n\t\tif (check(it3.x) && check(it1.x)) {\n\t\t\t\/\/ On intersecte les deux cotes\n\t\t\tresult.push_back(Segment(si1, si3));\n\t\t\tresult.push_back(Segment(si3, tri.p2));\n\t\t\treturn;\n \/\/ On intersecte un seul cote\n } else if (check(it3.x)) {\n \/\/ On intersecte le bout\n result.push_back(Segment(tri.p1, inter1));\n result.push_back(Segment(pp1, si3));\n result.push_back(Segment(si3, tri.p2));\n return;\n } else {\n \/\/ On intersecte cote 1\n result.push_back(Segment(si1, pp2));\n result.push_back(Segment(inter2, tri.p2));\n return;\n }\n }\n};\n<|endoftext|>"} {"text":"<commit_before>#include <QApplication>\n#include <QFontDatabase>\n#include <QtGlobal>\n#include <QFile>\n#include <QCommandLineParser>\n#include \"neovimconnector.h\"\n#include \"mainwindow.h\"\n\n\/**\n * A log handler for Qt messages, all messages are dumped into the file\n * passed via the NVIM_QT_LOG variable. Some information is only available\n * in debug builds (e.g. qDebug is only called in debug builds).\n *\n * In UNIX Qt prints messages to the console output, but in Windows this is\n * the only way to get Qt's debug\/warning messages.\n *\/\nvoid logger(QtMsgType type, const QMessageLogContext& ctx, const QString& msg)\n{\n\tQFile logFile(qgetenv(\"NVIM_QT_LOG\"));\n\tif (logFile.open(QIODevice::Append | QIODevice::Text)) {\n\t\tQTextStream stream(&logFile);\n\t\tstream << msg << \"\\n\";\n\t}\n}\n\n\/**\n * Neovim Qt GUI\n *\n * Usage:\n * nvim-qt --server <SOCKET>\n * nvim-qt [...]\n *\n * When --server is not provided, a Neovim instance will be spawned. All arguments\n * are passed to the Neovim process.\n *\/\nint main(int argc, char **argv)\n{\n\tQApplication app(argc, argv);\n\tapp.setApplicationDisplayName(\"Neovim\");\n\tapp.setWindowIcon(QIcon(\":\/neovim.png\"));\n\n\tif (!qgetenv(\"NVIM_QT_LOG\").isEmpty()) {\n\t\tqInstallMessageHandler(logger);\n\t}\n\n\tQCommandLineParser parser;\n\tparser.addOption(QCommandLineOption(\"embed\",\n\t\tQCoreApplication::translate(\"main\", \"Communicate with Neovim over stdin\/out\")));\n\tparser.addOption(QCommandLineOption(\"server\",\n\t\tQCoreApplication::translate(\"main\", \"Connect to existing Neovim instance\"),\n\t\tQCoreApplication::translate(\"main\", \"addr\")));\n\tparser.addOption(QCommandLineOption(\"geometry\",\n\t\tQCoreApplication::translate(\"main\", \"Initial window geometry\"),\n\t\tQCoreApplication::translate(\"main\", \"geometry\")));\n\tparser.addOption(QCommandLineOption(\"maximized\",\n\t\tQCoreApplication::translate(\"main\", \"Maximize the window on startup\")));\n\tparser.addPositionalArgument(\"...\", \"Additional arguments are fowarded to Neovim\", \"[-- ...]\");\n\tparser.addHelpOption();\n\n\tint sep = app.arguments().indexOf(\"--\");\n\tQStringList neovimArgs;\n\tif (sep != -1) {\n\t\tQStringList args = app.arguments().mid(0, sep);\n\t\tneovimArgs += app.arguments().mid(sep+1);\n\t\tparser.process(app.arguments());\n\t} else {\n\t\tparser.process(app.arguments());\n\t}\n\n\tif (parser.isSet(\"help\")) {\n\t\tparser.showHelp();\n\t}\n\n\tNeovimQt::NeovimConnector *c;\n\tif (parser.isSet(\"embed\")) {\n\t\tc = NeovimQt::NeovimConnector::fromStdinOut();\n\t} else {\n\t\tif (parser.isSet(\"server\")) {\n\t\t\tQString server = parser.value(\"server\");\n\t\t\tc = NeovimQt::NeovimConnector::connectToNeovim(server);\n\t\t} else {\n\t\t\tc = NeovimQt::NeovimConnector::spawn(neovimArgs);\n\t\t}\n\t}\n\n#ifdef NEOVIMQT_GUI_WIDGET\n\tNeovimQt::Shell *win = new NeovimQt::Shell(c);\n\twin->show();\n\tif (parser.isSet(\"maximized\")) {\n\t\twin->showMaximized();\n\t} else {\n\t\twin->show();\n\t}\n#else\n\tNeovimQt::MainWindow *win = new NeovimQt::MainWindow(c);\n\tif (parser.isSet(\"maximized\")) {\n\t\twin->delayedShow(NeovimQt::MainWindow::DelayedShow::Maximized);\n\t} else {\n\t\twin->delayedShow();\n\t}\n#endif\n\treturn app.exec();\n}\n\n<commit_msg>GUI: Implement --fullscreen CLI option<commit_after>#include <QApplication>\n#include <QFontDatabase>\n#include <QtGlobal>\n#include <QFile>\n#include <QCommandLineParser>\n#include \"neovimconnector.h\"\n#include \"mainwindow.h\"\n\n\/**\n * A log handler for Qt messages, all messages are dumped into the file\n * passed via the NVIM_QT_LOG variable. Some information is only available\n * in debug builds (e.g. qDebug is only called in debug builds).\n *\n * In UNIX Qt prints messages to the console output, but in Windows this is\n * the only way to get Qt's debug\/warning messages.\n *\/\nvoid logger(QtMsgType type, const QMessageLogContext& ctx, const QString& msg)\n{\n\tQFile logFile(qgetenv(\"NVIM_QT_LOG\"));\n\tif (logFile.open(QIODevice::Append | QIODevice::Text)) {\n\t\tQTextStream stream(&logFile);\n\t\tstream << msg << \"\\n\";\n\t}\n}\n\n\/**\n * Neovim Qt GUI\n *\n * Usage:\n * nvim-qt --server <SOCKET>\n * nvim-qt [...]\n *\n * When --server is not provided, a Neovim instance will be spawned. All arguments\n * are passed to the Neovim process.\n *\/\nint main(int argc, char **argv)\n{\n\tQApplication app(argc, argv);\n\tapp.setApplicationDisplayName(\"Neovim\");\n\tapp.setWindowIcon(QIcon(\":\/neovim.png\"));\n\n\tif (!qgetenv(\"NVIM_QT_LOG\").isEmpty()) {\n\t\tqInstallMessageHandler(logger);\n\t}\n\n\tQCommandLineParser parser;\n\tparser.addOption(QCommandLineOption(\"embed\",\n\t\tQCoreApplication::translate(\"main\", \"Communicate with Neovim over stdin\/out\")));\n\tparser.addOption(QCommandLineOption(\"server\",\n\t\tQCoreApplication::translate(\"main\", \"Connect to existing Neovim instance\"),\n\t\tQCoreApplication::translate(\"main\", \"addr\")));\n\tparser.addOption(QCommandLineOption(\"geometry\",\n\t\tQCoreApplication::translate(\"main\", \"Initial window geometry\"),\n\t\tQCoreApplication::translate(\"main\", \"geometry\")));\n\tparser.addOption(QCommandLineOption(\"maximized\",\n\t\tQCoreApplication::translate(\"main\", \"Maximize the window on startup\")));\n\tparser.addOption(QCommandLineOption(\"fullscreen\",\n\t\tQCoreApplication::translate(\"main\", \"Open the window in fullscreen on startup\")));\n\tparser.addPositionalArgument(\"...\", \"Additional arguments are fowarded to Neovim\", \"[-- ...]\");\n\tparser.addHelpOption();\n\n\tint sep = app.arguments().indexOf(\"--\");\n\tQStringList neovimArgs;\n\tif (sep != -1) {\n\t\tQStringList args = app.arguments().mid(0, sep);\n\t\tneovimArgs += app.arguments().mid(sep+1);\n\t\tparser.process(app.arguments());\n\t} else {\n\t\tparser.process(app.arguments());\n\t}\n\n\tif (parser.isSet(\"help\")) {\n\t\tparser.showHelp();\n\t}\n\n\tNeovimQt::NeovimConnector *c;\n\tif (parser.isSet(\"embed\")) {\n\t\tc = NeovimQt::NeovimConnector::fromStdinOut();\n\t} else {\n\t\tif (parser.isSet(\"server\")) {\n\t\t\tQString server = parser.value(\"server\");\n\t\t\tc = NeovimQt::NeovimConnector::connectToNeovim(server);\n\t\t} else {\n\t\t\tc = NeovimQt::NeovimConnector::spawn(neovimArgs);\n\t\t}\n\t}\n\n#ifdef NEOVIMQT_GUI_WIDGET\n\tNeovimQt::Shell *win = new NeovimQt::Shell(c);\n\twin->show();\n\tif (parser.isSet(\"fullscreen\")) {\n\t\twin->showFullScreen();\n\t} else if (parser.isSet(\"maximized\")) {\n\t\twin->showMaximized();\n\t} else {\n\t\twin->show();\n\t}\n#else\n\tNeovimQt::MainWindow *win = new NeovimQt::MainWindow(c);\n\tif (parser.isSet(\"fullscreen\")) {\n\t\twin->delayedShow(NeovimQt::MainWindow::DelayedShow::FullScreen);\n\t} else if (parser.isSet(\"maximized\")) {\n\t\twin->delayedShow(NeovimQt::MainWindow::DelayedShow::Maximized);\n\t} else {\n\t\twin->delayedShow();\n\t}\n#endif\n\treturn app.exec();\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#ifndef TORRENT_DISABLE_EXTENSIONS\n\n#ifdef _MSC_VER\n#pragma warning(push, 1)\n#endif\n\n#include <boost\/shared_ptr.hpp>\n#include <boost\/enable_shared_from_this.hpp>\n\n#ifdef _MSC_VER\n#pragma warning(pop)\n#endif\n\n#include <vector>\n#include <map>\n#include <utility>\n#include <numeric>\n#include <cstdio>\n\n#include \"libtorrent\/hasher.hpp\"\n#include \"libtorrent\/torrent.hpp\"\n#include \"libtorrent\/extensions.hpp\"\n#include \"libtorrent\/extensions\/smart_ban.hpp\"\n#include \"libtorrent\/disk_io_thread.hpp\"\n#include \"libtorrent\/aux_\/session_impl.hpp\"\n#include \"libtorrent\/peer_connection.hpp\"\n#include \"libtorrent\/peer_info.hpp\"\n#include \"libtorrent\/random.hpp\"\n\n\/\/#define TORRENT_LOG_HASH_FAILURES\n\n#ifdef TORRENT_LOG_HASH_FAILURES\n\n#include \"libtorrent\/peer_id.hpp\" \/\/ sha1_hash\n#include \"libtorrent\/escape_string.hpp\" \/\/ to_hex\n\nvoid log_hash_block(FILE** f, libtorrent::torrent const& t, int piece, int block\n\t, libtorrent::address a, char const* bytes, int len, bool corrupt)\n{\n\tusing namespace libtorrent;\n\n\tmkdir(\"hash_failures\", 0755);\n\n\tif (*f == NULL)\n\t{\n\t\tchar filename[1024];\n\t\tsnprintf(filename, sizeof(filename), \"hash_failures\/%s.log\"\n\t\t\t, to_hex(t.info_hash().to_string()).c_str());\n\t\t*f = fopen(filename, \"w\");\n\t}\n\n\tfile_storage const& fs = t.torrent_file().files();\n\tstd::vector<file_slice> files = fs.map_block(piece, block * 0x4000, len);\n\t\n\tstd::string fn = fs.file_path(fs.internal_at(files[0].file_index));\n\n\tchar filename[4094];\n\tint offset = 0;\n\tfor (int i = 0; i < files.size(); ++i)\n\t{\n\t\toffset += snprintf(filename+offset, sizeof(filename)-offset\n\t\t\t, \"%s[%\"PRId64\",%d]\", libtorrent::filename(fn).c_str(), files[i].offset, int(files[i].size));\n\t\tif (offset >= sizeof(filename)) break;\n\t}\n\n\tfprintf(*f, \"%s\\t%04d\\t%04d\\t%s\\t%s\\t%s\\n\", to_hex(t.info_hash().to_string()).c_str(), piece\n\t\t, block, corrupt ? \" bad\" : \"good\", print_address(a).c_str(), filename);\n\n\tsnprintf(filename, sizeof(filename), \"hash_failures\/%s_%d_%d_%s.block\"\n\t\t, to_hex(t.info_hash().to_string()).c_str(), piece, block, corrupt ? \"bad\" : \"good\");\n\tFILE* data = fopen(filename, \"w+\");\n\tfwrite(bytes, 1, len, data);\n\tfclose(data);\n}\n\n#endif\n\n\nnamespace libtorrent {\n\n\tclass torrent;\n\nnamespace\n{\n\n\tstruct smart_ban_plugin : torrent_plugin, boost::enable_shared_from_this<smart_ban_plugin>\n\t{\n\t\tsmart_ban_plugin(torrent& t)\n\t\t\t: m_torrent(t)\n\t\t\t, m_salt(random())\n\t\t{\n#ifdef TORRENT_LOG_HASH_FAILURES\n\t\t\tm_log_file = NULL;\n#endif\n\t\t}\n\n#ifdef TORRENT_LOG_HASH_FAILURES\n\t\t~smart_ban_plugin()\n\t\t{ fclose(m_log_file); }\n#endif\n\n\t\tvoid on_piece_pass(int p)\n\t\t{\n#ifdef TORRENT_LOGGING\n\t\t\t(*m_torrent.session().m_logger) << time_now_string() << \" PIECE PASS [ p: \" << p\n\t\t\t\t<< \" | block_hash_size: \" << m_block_hashes.size() << \" ]\\n\";\n#endif\n\t\t\t\/\/ has this piece failed earlier? If it has, go through the\n\t\t\t\/\/ CRCs from the time it failed and ban the peers that\n\t\t\t\/\/ sent bad blocks\n\t\t\tstd::map<piece_block, block_entry>::iterator i = m_block_hashes.lower_bound(piece_block(p, 0));\n\t\t\tif (i == m_block_hashes.end() || int(i->first.piece_index) != p) return;\n\n\t\t\tint size = m_torrent.torrent_file().piece_size(p);\n\t\t\tpeer_request r = {p, 0, (std::min)(16*1024, size)};\n\t\t\tpiece_block pb(p, 0);\n\t\t\twhile (size > 0)\n\t\t\t{\n\t\t\t\tif (i->first.block_index == pb.block_index)\n\t\t\t\t{\n\t\t\t\t\tm_torrent.filesystem().async_read(r, boost::bind(&smart_ban_plugin::on_read_ok_block\n\t\t\t\t\t\t, shared_from_this(), *i, _1, _2));\n\t\t\t\t\tm_block_hashes.erase(i++);\n\t\t\t\t}\n\t\t\t\telse\n\t\t\t\t{\n\t\t\t\t\tTORRENT_ASSERT(i->first.block_index > pb.block_index);\n\t\t\t\t}\n\n\t\t\t\tif (i == m_block_hashes.end() || int(i->first.piece_index) != p)\n\t\t\t\t\tbreak;\n\n\t\t\t\tr.start += 16*1024;\n\t\t\t\tsize -= 16*1024;\n\t\t\t\tr.length = (std::min)(16*1024, size);\n\t\t\t\t++pb.block_index;\n\t\t\t}\n\n#ifndef NDEBUG\n\t\t\t\/\/ make sure we actually removed all the entries for piece 'p'\n\t\t\ti = m_block_hashes.lower_bound(piece_block(p, 0));\n\t\t\tTORRENT_ASSERT(i == m_block_hashes.end() || int(i->first.piece_index) != p);\n#endif\n\n\t\t\tif (m_torrent.is_seed())\n\t\t\t{\n\t\t\t\tstd::map<piece_block, block_entry>().swap(m_block_hashes);\n\t\t\t\treturn;\n\t\t\t}\n\t\t}\n\n\t\tvoid on_piece_failed(int p)\n\t\t{\n\t\t\t\/\/ The piece failed the hash check. Record\n\t\t\t\/\/ the CRC and origin peer of every block\n\n\t\t\t\/\/ if the torrent is aborted, no point in starting\n\t\t\t\/\/ a bunch of read operations on it\n\t\t\tif (m_torrent.is_aborted()) return;\n\n\t\t\tstd::vector<void*> downloaders;\n\t\t\tm_torrent.picker().get_downloaders(downloaders, p);\n\n\t\t\tint size = m_torrent.torrent_file().piece_size(p);\n\t\t\tpeer_request r = {p, 0, (std::min)(16*1024, size)};\n\t\t\tpiece_block pb(p, 0);\n\t\t\tfor (std::vector<void*>::iterator i = downloaders.begin()\n\t\t\t\t, end(downloaders.end()); i != end; ++i)\n\t\t\t{\n\t\t\t\tif (*i != 0)\n\t\t\t\t{\n\t\t\t\t\tm_torrent.filesystem().async_read(r, boost::bind(&smart_ban_plugin::on_read_failed_block\n\t\t\t\t\t\t, shared_from_this(), pb, ((policy::peer*)*i)->address(), _1, _2));\n\t\t\t\t}\n\n\t\t\t\tr.start += 16*1024;\n\t\t\t\tsize -= 16*1024;\n\t\t\t\tr.length = (std::min)(16*1024, size);\n\t\t\t\t++pb.block_index;\n\t\t\t}\n\t\t\tTORRENT_ASSERT(size <= 0);\n\t\t}\n\n\tprivate:\n\n\t\t\/\/ this entry ties a specific block CRC to\n\t\t\/\/ a peer.\n\t\tstruct block_entry\n\t\t{\n\t\t\tpolicy::peer* peer;\n\t\t\tsha1_hash digest;\n\t\t};\n\n\t\tvoid on_read_failed_block(piece_block b, address a, int ret, disk_io_job const& j)\n\t\t{\n\t\t\tTORRENT_ASSERT(m_torrent.session().is_network_thread());\n\t\t\t\n\t\t\tdisk_buffer_holder buffer(m_torrent.session(), j.buffer);\n\n\t\t\t\/\/ ignore read errors\n\t\t\tif (ret != j.buffer_size) return;\n\n\t\t\thasher h;\n\t\t\th.update(j.buffer, j.buffer_size);\n\t\t\th.update((char const*)&m_salt, sizeof(m_salt));\n\n\t\t\tstd::pair<policy::iterator, policy::iterator> range\n\t\t\t\t= m_torrent.get_policy().find_peers(a);\n\n\t\t\t\/\/ there is no peer with this address anymore\n\t\t\tif (range.first == range.second) return;\n\n\t\t\tpolicy::peer* p = (*range.first);\n\t\t\tblock_entry e = {p, h.final()};\n\n#ifdef TORRENT_LOG_HASH_FAILURES\n\t\t\tlog_hash_block(&m_log_file, m_torrent, b.piece_index\n\t\t\t\t, b.block_index, p->address(), j.buffer, j.buffer_size, true);\n#endif\n\n\t\t\tstd::map<piece_block, block_entry>::iterator i = m_block_hashes.lower_bound(b);\n\n\t\t\tif (i != m_block_hashes.end() && i->first == b && i->second.peer == p)\n\t\t\t{\n\t\t\t\t\/\/ this peer has sent us this block before\n\t\t\t\tif (i->second.digest != e.digest)\n\t\t\t\t{\n\t\t\t\t\t\/\/ this time the digest of the block is different\n\t\t\t\t\t\/\/ from the first time it sent it\n\t\t\t\t\t\/\/ at least one of them must be bad\n\n\t\t\t\t\t\/\/ verify that this is not a dangling pointer\n\t\t\t\t\t\/\/ if the pointer is in the policy's list, it\n\t\t\t\t\t\/\/ still live, if it's not, it has been removed\n\t\t\t\t\t\/\/ and we can't use this pointer\n\t\t\t\t\tif (!m_torrent.get_policy().has_peer(p)) return;\n\n#if defined TORRENT_LOGGING || defined TORRENT_VERBOSE_LOGGING || defined TORRENT_ERROR_LOGGING\n\t\t\t\t\tchar const* client = \"-\";\n\t\t\t\t\tpeer_info info;\n\t\t\t\t\tif (p->connection)\n\t\t\t\t\t{\n\t\t\t\t\t\tp->connection->get_peer_info(info);\n\t\t\t\t\t\tclient = info.client.c_str();\n\t\t\t\t\t}\n\t\t\t\t\t(*m_torrent.session().m_logger) << time_now_string() << \" BANNING PEER [ p: \" << b.piece_index\n\t\t\t\t\t\t<< \" | b: \" << b.block_index\n\t\t\t\t\t\t<< \" | c: \" << client\n\t\t\t\t\t\t<< \" | hash1: \" << i->second.digest\n\t\t\t\t\t\t<< \" | hash2: \" << e.digest\n\t\t\t\t\t\t<< \" | ip: \" << p->ip() << \" ]\\n\";\n#endif\n\t\t\t\t\tm_torrent.get_policy().ban_peer(p);\n\t\t\t\t\tif (p->connection) p->connection->disconnect(\n\t\t\t\t\t\terrors::peer_banned);\n\t\t\t\t}\n\t\t\t\t\/\/ we already have this exact entry in the map\n\t\t\t\t\/\/ we don't have to insert it\n\t\t\t\treturn;\n\t\t\t}\n\t\t\t\n\t\t\tm_block_hashes.insert(i, std::pair<const piece_block, block_entry>(b, e));\n\n#ifdef TORRENT_LOGGING\n\t\t\tchar const* client = \"-\";\n\t\t\tpeer_info info;\n\t\t\tif (p->connection)\n\t\t\t{\n\t\t\t\tp->connection->get_peer_info(info);\n\t\t\t\tclient = info.client.c_str();\n\t\t\t}\n\t\t\t(*m_torrent.session().m_logger) << time_now_string() << \" STORE BLOCK CRC [ p: \" << b.piece_index\n\t\t\t\t<< \" | b: \" << b.block_index\n\t\t\t\t<< \" | c: \" << client\n\t\t\t\t<< \" | digest: \" << e.digest\n\t\t\t\t<< \" | ip: \" << p->ip() << \" ]\\n\";\n#endif\n\t\t}\n\t\t\n\t\tvoid on_read_ok_block(std::pair<piece_block, block_entry> b, int ret, disk_io_job const& j)\n\t\t{\n\t\t\tTORRENT_ASSERT(m_torrent.session().is_network_thread());\n\n\t\t\tdisk_buffer_holder buffer(m_torrent.session(), j.buffer);\n\n\t\t\t\/\/ ignore read errors\n\t\t\tif (ret != j.buffer_size) return;\n\n\t\t\thasher h;\n\t\t\th.update(j.buffer, j.buffer_size);\n\t\t\th.update((char const*)&m_salt, sizeof(m_salt));\n\t\t\tsha1_hash ok_digest = h.final();\n\n\t\t\tpolicy::peer* p = b.second.peer;\n\n\t\t\tif (b.second.digest == ok_digest) return;\n\n#ifdef TORRENT_LOG_HASH_FAILURES\n\t\t\tlog_hash_block(&m_log_file, m_torrent, b.first.piece_index\n\t\t\t\t, b.first.block_index, p->address(), j.buffer, j.buffer_size, false);\n#endif\n\n\t\t\tif (p == 0) return;\n\t\t\tif (!m_torrent.get_policy().has_peer(p)) return;\n\n#ifdef TORRENT_LOGGING\n\t\t\tchar const* client = \"-\";\n\t\t\tpeer_info info;\n\t\t\tif (p->connection)\n\t\t\t{\n\t\t\t\tp->connection->get_peer_info(info);\n\t\t\t\tclient = info.client.c_str();\n\t\t\t}\n\t\t\t(*m_torrent.session().m_logger) << time_now_string() << \" BANNING PEER [ p: \" << b.first.piece_index\n\t\t\t\t<< \" | b: \" << b.first.block_index\n\t\t\t\t<< \" | c: \" << client\n\t\t\t\t<< \" | ok_digest: \" << ok_digest\n\t\t\t\t<< \" | bad_digest: \" << b.second.digest\n\t\t\t\t<< \" | ip: \" << p->ip() << \" ]\\n\";\n#endif\n\t\t\tm_torrent.get_policy().ban_peer(p);\n\t\t\tif (p->connection) p->connection->disconnect(\n\t\t\t\terrors::peer_banned);\n\t\t}\n\t\t\n\t\ttorrent& m_torrent;\n\n\t\t\/\/ This table maps a piece_block (piece and block index\n\t\t\/\/ pair) to a peer and the block CRC. The CRC is calculated\n\t\t\/\/ from the data in the block + the salt\n\t\tstd::map<piece_block, block_entry> m_block_hashes;\n\n\t\t\/\/ This salt is a random value used to calculate the block CRCs\n\t\t\/\/ Since the CRC function that is used is not a one way function\n\t\t\/\/ the salt is required to avoid attacks where bad data is sent\n\t\t\/\/ that is forged to match the CRC of the good data.\n\t\tint m_salt;\n\n#ifdef TORRENT_LOG_HASH_FAILURES\n\t\tFILE* m_log_file;\n#endif\n\t};\n\n} }\n\nnamespace libtorrent\n{\n\n\tboost::shared_ptr<torrent_plugin> create_smart_ban_plugin(torrent* t, void*)\n\t{\n\t\treturn boost::shared_ptr<torrent_plugin>(new smart_ban_plugin(*t));\n\t}\n\n}\n\n#endif\n\n<commit_msg>minor fix<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#ifndef TORRENT_DISABLE_EXTENSIONS\n\n#ifdef _MSC_VER\n#pragma warning(push, 1)\n#endif\n\n#include <boost\/shared_ptr.hpp>\n#include <boost\/enable_shared_from_this.hpp>\n\n#ifdef _MSC_VER\n#pragma warning(pop)\n#endif\n\n#include <vector>\n#include <map>\n#include <utility>\n#include <numeric>\n#include <cstdio>\n\n#include \"libtorrent\/hasher.hpp\"\n#include \"libtorrent\/torrent.hpp\"\n#include \"libtorrent\/extensions.hpp\"\n#include \"libtorrent\/extensions\/smart_ban.hpp\"\n#include \"libtorrent\/disk_io_thread.hpp\"\n#include \"libtorrent\/aux_\/session_impl.hpp\"\n#include \"libtorrent\/peer_connection.hpp\"\n#include \"libtorrent\/peer_info.hpp\"\n#include \"libtorrent\/random.hpp\"\n\n\/\/#define TORRENT_LOG_HASH_FAILURES\n\n#ifdef TORRENT_LOG_HASH_FAILURES\n\n#include \"libtorrent\/peer_id.hpp\" \/\/ sha1_hash\n#include \"libtorrent\/escape_string.hpp\" \/\/ to_hex\n\nvoid log_hash_block(FILE** f, libtorrent::torrent const& t, int piece, int block\n\t, libtorrent::address a, char const* bytes, int len, bool corrupt)\n{\n\tusing namespace libtorrent;\n\n\tmkdir(\"hash_failures\", 0755);\n\n\tif (*f == NULL)\n\t{\n\t\tchar filename[1024];\n\t\tsnprintf(filename, sizeof(filename), \"hash_failures\/%s.log\"\n\t\t\t, to_hex(t.info_hash().to_string()).c_str());\n\t\t*f = fopen(filename, \"w\");\n\t}\n\n\tfile_storage const& fs = t.torrent_file().files();\n\tstd::vector<file_slice> files = fs.map_block(piece, block * 0x4000, len);\n\t\n\tstd::string fn = fs.file_path(fs.internal_at(files[0].file_index));\n\n\tchar filename[4094];\n\tint offset = 0;\n\tfor (int i = 0; i < files.size(); ++i)\n\t{\n\t\toffset += snprintf(filename+offset, sizeof(filename)-offset\n\t\t\t, \"%s[%\"PRId64\",%d]\", libtorrent::filename(fn).c_str(), files[i].offset, int(files[i].size));\n\t\tif (offset >= sizeof(filename)) break;\n\t}\n\n\tfprintf(*f, \"%s\\t%04d\\t%04d\\t%s\\t%s\\t%s\\n\", to_hex(t.info_hash().to_string()).c_str(), piece\n\t\t, block, corrupt ? \" bad\" : \"good\", print_address(a).c_str(), filename);\n\n\tsnprintf(filename, sizeof(filename), \"hash_failures\/%s_%d_%d_%s.block\"\n\t\t, to_hex(t.info_hash().to_string()).c_str(), piece, block, corrupt ? \"bad\" : \"good\");\n\tFILE* data = fopen(filename, \"w+\");\n\tfwrite(bytes, 1, len, data);\n\tfclose(data);\n}\n\n#endif\n\n\nnamespace libtorrent {\n\n\tclass torrent;\n\nnamespace\n{\n\n\tstruct smart_ban_plugin : torrent_plugin, boost::enable_shared_from_this<smart_ban_plugin>\n\t{\n\t\tsmart_ban_plugin(torrent& t)\n\t\t\t: m_torrent(t)\n\t\t\t, m_salt(random())\n\t\t{\n#ifdef TORRENT_LOG_HASH_FAILURES\n\t\t\tm_log_file = NULL;\n#endif\n\t\t}\n\n#ifdef TORRENT_LOG_HASH_FAILURES\n\t\t~smart_ban_plugin()\n\t\t{ fclose(m_log_file); }\n#endif\n\n\t\tvoid on_piece_pass(int p)\n\t\t{\n#ifdef TORRENT_LOGGING\n\t\t\t(*m_torrent.session().m_logger) << time_now_string() << \" PIECE PASS [ p: \" << p\n\t\t\t\t<< \" | block_hash_size: \" << m_block_hashes.size() << \" ]\\n\";\n#endif\n\t\t\t\/\/ has this piece failed earlier? If it has, go through the\n\t\t\t\/\/ CRCs from the time it failed and ban the peers that\n\t\t\t\/\/ sent bad blocks\n\t\t\tstd::map<piece_block, block_entry>::iterator i = m_block_hashes.lower_bound(piece_block(p, 0));\n\t\t\tif (i == m_block_hashes.end() || int(i->first.piece_index) != p) return;\n\n\t\t\tint size = m_torrent.torrent_file().piece_size(p);\n\t\t\tpeer_request r = {p, 0, (std::min)(16*1024, size)};\n\t\t\tpiece_block pb(p, 0);\n\t\t\twhile (size > 0)\n\t\t\t{\n\t\t\t\tif (i->first.block_index == pb.block_index)\n\t\t\t\t{\n\t\t\t\t\tm_torrent.filesystem().async_read(r, boost::bind(&smart_ban_plugin::on_read_ok_block\n\t\t\t\t\t\t, shared_from_this(), *i, _1, _2));\n\t\t\t\t\tm_block_hashes.erase(i++);\n\t\t\t\t}\n\t\t\t\telse\n\t\t\t\t{\n\t\t\t\t\tTORRENT_ASSERT(i->first.block_index > pb.block_index);\n\t\t\t\t}\n\n\t\t\t\tif (i == m_block_hashes.end() || int(i->first.piece_index) != p)\n\t\t\t\t\tbreak;\n\n\t\t\t\tr.start += 16*1024;\n\t\t\t\tsize -= 16*1024;\n\t\t\t\tr.length = (std::min)(16*1024, size);\n\t\t\t\t++pb.block_index;\n\t\t\t}\n\n#ifndef NDEBUG\n\t\t\t\/\/ make sure we actually removed all the entries for piece 'p'\n\t\t\ti = m_block_hashes.lower_bound(piece_block(p, 0));\n\t\t\tTORRENT_ASSERT(i == m_block_hashes.end() || int(i->first.piece_index) != p);\n#endif\n\n\t\t\tif (m_torrent.is_seed())\n\t\t\t{\n\t\t\t\tstd::map<piece_block, block_entry>().swap(m_block_hashes);\n\t\t\t\treturn;\n\t\t\t}\n\t\t}\n\n\t\tvoid on_piece_failed(int p)\n\t\t{\n\t\t\t\/\/ The piece failed the hash check. Record\n\t\t\t\/\/ the CRC and origin peer of every block\n\n\t\t\t\/\/ if the torrent is aborted, no point in starting\n\t\t\t\/\/ a bunch of read operations on it\n\t\t\tif (m_torrent.is_aborted()) return;\n\n\t\t\tstd::vector<void*> downloaders;\n\t\t\tm_torrent.picker().get_downloaders(downloaders, p);\n\n\t\t\tint size = m_torrent.torrent_file().piece_size(p);\n\t\t\tpeer_request r = {p, 0, (std::min)(16*1024, size)};\n\t\t\tpiece_block pb(p, 0);\n\t\t\tfor (std::vector<void*>::iterator i = downloaders.begin()\n\t\t\t\t, end(downloaders.end()); i != end; ++i)\n\t\t\t{\n\t\t\t\tif (*i != 0)\n\t\t\t\t{\n\t\t\t\t\tm_torrent.filesystem().async_read(r, boost::bind(&smart_ban_plugin::on_read_failed_block\n\t\t\t\t\t\t, shared_from_this(), pb, ((policy::peer*)*i)->address(), _1, _2));\n\t\t\t\t}\n\n\t\t\t\tr.start += 16*1024;\n\t\t\t\tsize -= 16*1024;\n\t\t\t\tr.length = (std::min)(16*1024, size);\n\t\t\t\t++pb.block_index;\n\t\t\t}\n\t\t\tTORRENT_ASSERT(size <= 0);\n\t\t}\n\n\tprivate:\n\n\t\t\/\/ this entry ties a specific block CRC to\n\t\t\/\/ a peer.\n\t\tstruct block_entry\n\t\t{\n\t\t\tpolicy::peer* peer;\n\t\t\tsha1_hash digest;\n\t\t};\n\n\t\tvoid on_read_failed_block(piece_block b, address a, int ret, disk_io_job const& j)\n\t\t{\n\t\t\tTORRENT_ASSERT(m_torrent.session().is_network_thread());\n\t\t\t\n\t\t\tdisk_buffer_holder buffer(m_torrent.session(), j.buffer);\n\n\t\t\t\/\/ ignore read errors\n\t\t\tif (ret != j.buffer_size) return;\n\n\t\t\thasher h;\n\t\t\th.update(j.buffer, j.buffer_size);\n\t\t\th.update((char const*)&m_salt, sizeof(m_salt));\n\n\t\t\tstd::pair<policy::iterator, policy::iterator> range\n\t\t\t\t= m_torrent.get_policy().find_peers(a);\n\n\t\t\t\/\/ there is no peer with this address anymore\n\t\t\tif (range.first == range.second) return;\n\n\t\t\tpolicy::peer* p = (*range.first);\n\t\t\tblock_entry e = {p, h.final()};\n\n#ifdef TORRENT_LOG_HASH_FAILURES\n\t\t\tlog_hash_block(&m_log_file, m_torrent, b.piece_index\n\t\t\t\t, b.block_index, p->address(), j.buffer, j.buffer_size, true);\n#endif\n\n\t\t\tstd::map<piece_block, block_entry>::iterator i = m_block_hashes.lower_bound(b);\n\n\t\t\tif (i != m_block_hashes.end() && i->first == b && i->second.peer == p)\n\t\t\t{\n\t\t\t\t\/\/ this peer has sent us this block before\n\t\t\t\tif (i->second.digest != e.digest)\n\t\t\t\t{\n\t\t\t\t\t\/\/ this time the digest of the block is different\n\t\t\t\t\t\/\/ from the first time it sent it\n\t\t\t\t\t\/\/ at least one of them must be bad\n\n\t\t\t\t\t\/\/ verify that this is not a dangling pointer\n\t\t\t\t\t\/\/ if the pointer is in the policy's list, it\n\t\t\t\t\t\/\/ still live, if it's not, it has been removed\n\t\t\t\t\t\/\/ and we can't use this pointer\n\t\t\t\t\tif (!m_torrent.get_policy().has_peer(p)) return;\n\n#if defined TORRENT_LOGGING || defined TORRENT_VERBOSE_LOGGING || defined TORRENT_ERROR_LOGGING\n\t\t\t\t\tchar const* client = \"-\";\n\t\t\t\t\tpeer_info info;\n\t\t\t\t\tif (p->connection)\n\t\t\t\t\t{\n\t\t\t\t\t\tp->connection->get_peer_info(info);\n\t\t\t\t\t\tclient = info.client.c_str();\n\t\t\t\t\t}\n\t\t\t\t\t(*m_torrent.session().m_logger) << time_now_string() << \" BANNING PEER [ p: \" << b.piece_index\n\t\t\t\t\t\t<< \" | b: \" << b.block_index\n\t\t\t\t\t\t<< \" | c: \" << client\n\t\t\t\t\t\t<< \" | hash1: \" << i->second.digest\n\t\t\t\t\t\t<< \" | hash2: \" << e.digest\n\t\t\t\t\t\t<< \" | ip: \" << p->ip() << \" ]\\n\";\n#endif\n\t\t\t\t\tm_torrent.get_policy().ban_peer(p);\n\t\t\t\t\tif (p->connection) p->connection->disconnect(\n\t\t\t\t\t\terrors::peer_banned);\n\t\t\t\t}\n\t\t\t\t\/\/ we already have this exact entry in the map\n\t\t\t\t\/\/ we don't have to insert it\n\t\t\t\treturn;\n\t\t\t}\n\t\t\t\n\t\t\tm_block_hashes.insert(i, std::pair<const piece_block, block_entry>(b, e));\n\n#ifdef TORRENT_LOGGING\n\t\t\tchar const* client = \"-\";\n\t\t\tpeer_info info;\n\t\t\tif (p->connection)\n\t\t\t{\n\t\t\t\tp->connection->get_peer_info(info);\n\t\t\t\tclient = info.client.c_str();\n\t\t\t}\n\t\t\t(*m_torrent.session().m_logger) << time_now_string() << \" STORE BLOCK CRC [ p: \" << b.piece_index\n\t\t\t\t<< \" | b: \" << b.block_index\n\t\t\t\t<< \" | c: \" << client\n\t\t\t\t<< \" | digest: \" << e.digest\n\t\t\t\t<< \" | ip: \" << p->ip() << \" ]\\n\";\n#endif\n\t\t}\n\t\t\n\t\tvoid on_read_ok_block(std::pair<piece_block, block_entry> b, int ret, disk_io_job const& j)\n\t\t{\n\t\t\tTORRENT_ASSERT(m_torrent.session().is_network_thread());\n\n\t\t\tdisk_buffer_holder buffer(m_torrent.session(), j.buffer);\n\n\t\t\t\/\/ ignore read errors\n\t\t\tif (ret != j.buffer_size) return;\n\n\t\t\thasher h;\n\t\t\th.update(j.buffer, j.buffer_size);\n\t\t\th.update((char const*)&m_salt, sizeof(m_salt));\n\t\t\tsha1_hash ok_digest = h.final();\n\n\t\t\tpolicy::peer* p = b.second.peer;\n\n\t\t\tif (b.second.digest == ok_digest) return;\n\t\t\tif (p == 0) return;\n\n#ifdef TORRENT_LOG_HASH_FAILURES\n\t\t\tlog_hash_block(&m_log_file, m_torrent, b.first.piece_index\n\t\t\t\t, b.first.block_index, p->address(), j.buffer, j.buffer_size, false);\n#endif\n\n\t\t\tif (!m_torrent.get_policy().has_peer(p)) return;\n\n#ifdef TORRENT_LOGGING\n\t\t\tchar const* client = \"-\";\n\t\t\tpeer_info info;\n\t\t\tif (p->connection)\n\t\t\t{\n\t\t\t\tp->connection->get_peer_info(info);\n\t\t\t\tclient = info.client.c_str();\n\t\t\t}\n\t\t\t(*m_torrent.session().m_logger) << time_now_string() << \" BANNING PEER [ p: \" << b.first.piece_index\n\t\t\t\t<< \" | b: \" << b.first.block_index\n\t\t\t\t<< \" | c: \" << client\n\t\t\t\t<< \" | ok_digest: \" << ok_digest\n\t\t\t\t<< \" | bad_digest: \" << b.second.digest\n\t\t\t\t<< \" | ip: \" << p->ip() << \" ]\\n\";\n#endif\n\t\t\tm_torrent.get_policy().ban_peer(p);\n\t\t\tif (p->connection) p->connection->disconnect(\n\t\t\t\terrors::peer_banned);\n\t\t}\n\t\t\n\t\ttorrent& m_torrent;\n\n\t\t\/\/ This table maps a piece_block (piece and block index\n\t\t\/\/ pair) to a peer and the block CRC. The CRC is calculated\n\t\t\/\/ from the data in the block + the salt\n\t\tstd::map<piece_block, block_entry> m_block_hashes;\n\n\t\t\/\/ This salt is a random value used to calculate the block CRCs\n\t\t\/\/ Since the CRC function that is used is not a one way function\n\t\t\/\/ the salt is required to avoid attacks where bad data is sent\n\t\t\/\/ that is forged to match the CRC of the good data.\n\t\tint m_salt;\n\n#ifdef TORRENT_LOG_HASH_FAILURES\n\t\tFILE* m_log_file;\n#endif\n\t};\n\n} }\n\nnamespace libtorrent\n{\n\n\tboost::shared_ptr<torrent_plugin> create_smart_ban_plugin(torrent* t, void*)\n\t{\n\t\treturn boost::shared_ptr<torrent_plugin>(new smart_ban_plugin(*t));\n\t}\n\n}\n\n#endif\n\n<|endoftext|>"} {"text":"<commit_before>\/* Copyright (c) 2008, Avian Contributors\n\n Permission to use, copy, modify, and\/or distribute this software\n for any purpose with or without fee is hereby granted, provided\n that the above copyright notice and this permission notice appear\n in all copies.\n\n There is NO WARRANTY for this software. See license.txt for\n details. *\/\n\n#include \"machine.h\"\n\nusing namespace vm;\n\nnamespace {\n\nconst uintptr_t PointerShift = log(BytesPerWord);\n\nclass Set {\n public:\n class Entry {\n public:\n object value;\n uint32_t number;\n int next;\n };\n\n static unsigned footprint(unsigned capacity) {\n return sizeof(Set)\n + pad(sizeof(int) * capacity)\n + pad(sizeof(Set::Entry) * capacity);\n }\n\n Set(unsigned capacity):\n size(0),\n capacity(capacity),\n index(reinterpret_cast<int*>\n (reinterpret_cast<uint8_t*>(this)\n + sizeof(Set))),\n entries(reinterpret_cast<Entry*>\n (reinterpret_cast<uint8_t*>(index) \n + pad(sizeof(int) * capacity)))\n { }\n\n unsigned size;\n unsigned capacity;\n int* index;\n Entry* entries;\n};\n\nclass Stack {\n public:\n class Entry {\n public:\n object value;\n int offset;\n };\n\n static const unsigned Capacity = 4096;\n\n Stack(Stack* next): next(next), entryCount(0) { }\n\n Stack* next;\n unsigned entryCount;\n Entry entries[Capacity];\n};\n\nclass Context {\n public:\n Context(Thread* thread, FILE* out):\n thread(thread), out(out), objects(0), stack(0), nextNumber(1)\n { }\n\n ~Context() {\n if (objects) {\n thread->m->heap->free(objects, Set::footprint(objects->capacity));\n }\n while (stack) {\n Stack* dead = stack;\n stack = dead->next;\n thread->m->heap->free(stack, sizeof(Stack));\n }\n }\n\n Thread* thread;\n FILE* out;\n Set* objects;\n Stack* stack;\n uint32_t nextNumber;\n};\n\nvoid\npush(Context* c, object p, int offset)\n{\n if (c->stack == 0 or c->stack->entryCount == Stack::Capacity) {\n c->stack = new (c->thread->m->heap->allocate(sizeof(Stack)))\n Stack(c->stack);\n }\n Stack::Entry* e = c->stack->entries + (c->stack->entryCount++);\n e->value = p;\n e->offset = offset;\n}\n\nbool\npop(Context* c, object* p, int* offset)\n{\n if (c->stack) {\n if (c->stack->entryCount == 0) {\n if (c->stack->next) {\n Stack* dead = c->stack;\n c->stack = dead->next;\n c->thread->m->heap->free(dead, sizeof(Stack));\n } else {\n return false;\n }\n }\n Stack::Entry* e = c->stack->entries + (--c->stack->entryCount);\n *p = e->value;\n *offset = e->offset;\n return true;\n } else {\n return false;\n }\n}\n\nunsigned\nhash(object p, unsigned capacity)\n{\n return (reinterpret_cast<uintptr_t>(p) >> PointerShift)\n & (capacity - 1);\n}\n\nSet::Entry*\nfind(Context* c, object p)\n{\n if (c->objects == 0) return 0;\n\n for (int i = c->objects->index[hash(p, c->objects->capacity)]; i >= 0;) {\n Set::Entry* e = c->objects->entries + i;\n if (e->value == p) {\n return e;\n }\n i = e->next;\n }\n\n return 0;\n}\n\nSet::Entry*\nadd(Context* c UNUSED, Set* set, object p, uint32_t number)\n{\n assert(c->thread, set->size < set->capacity);\n\n unsigned index = hash(p, set->capacity);\n\n int offset = set->size++;\n Set::Entry* e = set->entries + offset;\n e->value = p;\n e->number = number;\n e->next = set->index[index];\n set->index[index] = offset;\n return e;\n}\n\nSet::Entry*\nadd(Context* c, object p)\n{\n if (c->objects == 0 or c->objects->size == c->objects->capacity) {\n unsigned capacity;\n if (c->objects) {\n capacity = c->objects->capacity * 2;\n } else {\n capacity = 4096; \/\/ must be power of two\n }\n\n Set* set = new (c->thread->m->heap->allocate(Set::footprint(capacity)))\n Set(capacity);\n\n memset(set->index, 0xFF, sizeof(int) * capacity);\n\n if (c->objects) {\n for (unsigned i = 0; i < c->objects->capacity; ++i) {\n for (int j = c->objects->index[i]; j >= 0;) {\n Set::Entry* e = c->objects->entries + j;\n add(c, set, e->value, e->number);\n j = e->next;\n }\n }\n\n c->thread->m->heap->free\n (c->objects, Set::footprint(c->objects->capacity));\n }\n\n c->objects = set;\n }\n\n return add(c, c->objects, p, 0);\n}\n\nenum {\n Root,\n Size,\n ClassName,\n Push,\n Pop\n};\n\ninline object\nget(object o, unsigned offsetInWords)\n{\n return static_cast<object>\n (mask(cast<void*>(o, offsetInWords * BytesPerWord)));\n}\n\nvoid\nwrite1(Context* c, uint8_t v)\n{\n fwrite(&v, 1, 1, c->out);\n}\n\nvoid\nwrite4(Context* c, uint32_t v)\n{\n uint8_t b[] = { v >> 24, (v >> 16) & 0xFF, (v >> 8) & 0xFF, v & 0xFF };\n fwrite(b, 4, 1, c->out);\n}\n\nvoid\nwriteString(Context* c, int8_t* p, unsigned size)\n{\n write4(c, size);\n fwrite(p, size, 1, c->out);\n}\n\nunsigned\nobjectSize(Thread* t, object o)\n{\n unsigned n = baseSize(t, o, objectClass(t, o));\n if (objectExtended(t, o)) {\n ++ n;\n }\n return n;\n}\n\nvoid\nvisit(Context* c, object p)\n{\n Thread* t = c->thread;\n int nextChildOffset;\n\n write1(c, Root);\n\n visit: {\n Set::Entry* e = find(c, p);\n if (e) {\n write4(c, e->number);\n } else {\n e = add(c, p);\n e->number = c->nextNumber++;\n\n write4(c, e->number);\n\n write1(c, Size);\n write4(c, objectSize(t, p));\n\n if (objectClass(t, p) == arrayBody(t, t->m->types, Machine::ClassType)) {\n object name = className(t, p);\n if (name) {\n write1(c, ClassName);\n writeString(c, &byteArrayBody(t, name, 0),\n byteArrayLength(t, name) - 1);\n }\n }\n\n nextChildOffset = walkNext(t, p, -1);\n if (nextChildOffset != -1) {\n goto children;\n }\n }\n }\n\n goto pop;\n\n children: {\n write1(c, Push);\n push(c, p, nextChildOffset);\n p = get(p, nextChildOffset);\n goto visit;\n }\n\n pop: {\n if (pop(c, &p, &nextChildOffset)) {\n write1(c, Pop);\n nextChildOffset = walkNext(t, p, nextChildOffset);\n if (nextChildOffset >= 0) {\n goto children;\n } else {\n goto pop;\n }\n }\n }\n}\n\n} \/\/ namespace\n\nnamespace vm {\n\nvoid\ndumpHeap(Thread* t, FILE* out)\n{\n Context context(t, out);\n\n class Visitor : public Heap::Visitor {\n public:\n Visitor(Context* c): c(c) { }\n\n virtual void visit(void* p) {\n ::visit(c, static_cast<object>(mask(*static_cast<void**>(p))));\n }\n\n Context* c;\n } v(&context);\n\n add(&context, 0)->number = 0;\n\n visitRoots(t->m, &v);\n}\n\n} \/\/ namespace vm\n<commit_msg>Check return value of fwrite() calls.<commit_after>\/* Copyright (c) 2008, Avian Contributors\n\n Permission to use, copy, modify, and\/or distribute this software\n for any purpose with or without fee is hereby granted, provided\n that the above copyright notice and this permission notice appear\n in all copies.\n\n There is NO WARRANTY for this software. See license.txt for\n details. *\/\n\n#include \"machine.h\"\n\nusing namespace vm;\n\nnamespace {\n\nconst uintptr_t PointerShift = log(BytesPerWord);\n\nclass Set {\n public:\n class Entry {\n public:\n object value;\n uint32_t number;\n int next;\n };\n\n static unsigned footprint(unsigned capacity) {\n return sizeof(Set)\n + pad(sizeof(int) * capacity)\n + pad(sizeof(Set::Entry) * capacity);\n }\n\n Set(unsigned capacity):\n size(0),\n capacity(capacity),\n index(reinterpret_cast<int*>\n (reinterpret_cast<uint8_t*>(this)\n + sizeof(Set))),\n entries(reinterpret_cast<Entry*>\n (reinterpret_cast<uint8_t*>(index) \n + pad(sizeof(int) * capacity)))\n { }\n\n unsigned size;\n unsigned capacity;\n int* index;\n Entry* entries;\n};\n\nclass Stack {\n public:\n class Entry {\n public:\n object value;\n int offset;\n };\n\n static const unsigned Capacity = 4096;\n\n Stack(Stack* next): next(next), entryCount(0) { }\n\n Stack* next;\n unsigned entryCount;\n Entry entries[Capacity];\n};\n\nclass Context {\n public:\n Context(Thread* thread, FILE* out):\n thread(thread), out(out), objects(0), stack(0), nextNumber(1)\n { }\n\n ~Context() {\n if (objects) {\n thread->m->heap->free(objects, Set::footprint(objects->capacity));\n }\n while (stack) {\n Stack* dead = stack;\n stack = dead->next;\n thread->m->heap->free(stack, sizeof(Stack));\n }\n }\n\n Thread* thread;\n FILE* out;\n Set* objects;\n Stack* stack;\n uint32_t nextNumber;\n};\n\nvoid\npush(Context* c, object p, int offset)\n{\n if (c->stack == 0 or c->stack->entryCount == Stack::Capacity) {\n c->stack = new (c->thread->m->heap->allocate(sizeof(Stack)))\n Stack(c->stack);\n }\n Stack::Entry* e = c->stack->entries + (c->stack->entryCount++);\n e->value = p;\n e->offset = offset;\n}\n\nbool\npop(Context* c, object* p, int* offset)\n{\n if (c->stack) {\n if (c->stack->entryCount == 0) {\n if (c->stack->next) {\n Stack* dead = c->stack;\n c->stack = dead->next;\n c->thread->m->heap->free(dead, sizeof(Stack));\n } else {\n return false;\n }\n }\n Stack::Entry* e = c->stack->entries + (--c->stack->entryCount);\n *p = e->value;\n *offset = e->offset;\n return true;\n } else {\n return false;\n }\n}\n\nunsigned\nhash(object p, unsigned capacity)\n{\n return (reinterpret_cast<uintptr_t>(p) >> PointerShift)\n & (capacity - 1);\n}\n\nSet::Entry*\nfind(Context* c, object p)\n{\n if (c->objects == 0) return 0;\n\n for (int i = c->objects->index[hash(p, c->objects->capacity)]; i >= 0;) {\n Set::Entry* e = c->objects->entries + i;\n if (e->value == p) {\n return e;\n }\n i = e->next;\n }\n\n return 0;\n}\n\nSet::Entry*\nadd(Context* c UNUSED, Set* set, object p, uint32_t number)\n{\n assert(c->thread, set->size < set->capacity);\n\n unsigned index = hash(p, set->capacity);\n\n int offset = set->size++;\n Set::Entry* e = set->entries + offset;\n e->value = p;\n e->number = number;\n e->next = set->index[index];\n set->index[index] = offset;\n return e;\n}\n\nSet::Entry*\nadd(Context* c, object p)\n{\n if (c->objects == 0 or c->objects->size == c->objects->capacity) {\n unsigned capacity;\n if (c->objects) {\n capacity = c->objects->capacity * 2;\n } else {\n capacity = 4096; \/\/ must be power of two\n }\n\n Set* set = new (c->thread->m->heap->allocate(Set::footprint(capacity)))\n Set(capacity);\n\n memset(set->index, 0xFF, sizeof(int) * capacity);\n\n if (c->objects) {\n for (unsigned i = 0; i < c->objects->capacity; ++i) {\n for (int j = c->objects->index[i]; j >= 0;) {\n Set::Entry* e = c->objects->entries + j;\n add(c, set, e->value, e->number);\n j = e->next;\n }\n }\n\n c->thread->m->heap->free\n (c->objects, Set::footprint(c->objects->capacity));\n }\n\n c->objects = set;\n }\n\n return add(c, c->objects, p, 0);\n}\n\nenum {\n Root,\n Size,\n ClassName,\n Push,\n Pop\n};\n\ninline object\nget(object o, unsigned offsetInWords)\n{\n return static_cast<object>\n (mask(cast<void*>(o, offsetInWords * BytesPerWord)));\n}\n\nvoid\nwrite1(Context* c, uint8_t v)\n{\n size_t n UNUSED = fwrite(&v, 1, 1, c->out);\n}\n\nvoid\nwrite4(Context* c, uint32_t v)\n{\n uint8_t b[] = { v >> 24, (v >> 16) & 0xFF, (v >> 8) & 0xFF, v & 0xFF };\n size_t n UNUSED = fwrite(b, 4, 1, c->out);\n}\n\nvoid\nwriteString(Context* c, int8_t* p, unsigned size)\n{\n write4(c, size);\n size_t n UNUSED = fwrite(p, size, 1, c->out);\n}\n\nunsigned\nobjectSize(Thread* t, object o)\n{\n unsigned n = baseSize(t, o, objectClass(t, o));\n if (objectExtended(t, o)) {\n ++ n;\n }\n return n;\n}\n\nvoid\nvisit(Context* c, object p)\n{\n Thread* t = c->thread;\n int nextChildOffset;\n\n write1(c, Root);\n\n visit: {\n Set::Entry* e = find(c, p);\n if (e) {\n write4(c, e->number);\n } else {\n e = add(c, p);\n e->number = c->nextNumber++;\n\n write4(c, e->number);\n\n write1(c, Size);\n write4(c, objectSize(t, p));\n\n if (objectClass(t, p) == arrayBody(t, t->m->types, Machine::ClassType)) {\n object name = className(t, p);\n if (name) {\n write1(c, ClassName);\n writeString(c, &byteArrayBody(t, name, 0),\n byteArrayLength(t, name) - 1);\n }\n }\n\n nextChildOffset = walkNext(t, p, -1);\n if (nextChildOffset != -1) {\n goto children;\n }\n }\n }\n\n goto pop;\n\n children: {\n write1(c, Push);\n push(c, p, nextChildOffset);\n p = get(p, nextChildOffset);\n goto visit;\n }\n\n pop: {\n if (pop(c, &p, &nextChildOffset)) {\n write1(c, Pop);\n nextChildOffset = walkNext(t, p, nextChildOffset);\n if (nextChildOffset >= 0) {\n goto children;\n } else {\n goto pop;\n }\n }\n }\n}\n\n} \/\/ namespace\n\nnamespace vm {\n\nvoid\ndumpHeap(Thread* t, FILE* out)\n{\n Context context(t, out);\n\n class Visitor : public Heap::Visitor {\n public:\n Visitor(Context* c): c(c) { }\n\n virtual void visit(void* p) {\n ::visit(c, static_cast<object>(mask(*static_cast<void**>(p))));\n }\n\n Context* c;\n } v(&context);\n\n add(&context, 0)->number = 0;\n\n visitRoots(t->m, &v);\n}\n\n} \/\/ namespace vm\n<|endoftext|>"} {"text":"<commit_before>\n#include\t<cmath>\n#include <cfloat>\n\n#include \"string.h\"\n#include \"turing_calculator.h\"\n\nturing_calculator::turing_calculator():machine_(0), instructions_(0), instructions_sum_(0), yield_execution_(false) {\n}\n\nturing_calculator::~turing_calculator() {\n delete[] instructions_;\n}\n\nsize_t turing_calculator::set_str_variable(const std::string& key, const std::string& value) {\n variable str_index;\n if(fetch_variable(key, str_index)) {\n str_variables_[size_t(str_index)] = value;\n return size_t(str_index);\n }\n\n size_t index = str_variables_.size();\n str_variables_.push_back(value);\n this->set_variable(key, variable(index));\n return index;\n}\n\nconst char* turing_calculator::get_str_variable(const std::string& key) {\n variable index;\n if(!fetch_variable(key, index)) {\n return 0;\n }\n size_t str_index = size_t(index);\n return get_str_variable(str_index);\n}\n\nconst char* turing_calculator::get_str_variable(size_t str_var_index) {\n if(str_var_index >= str_variables_.size()) {\n return 0;\n }\n return str_variables_[str_var_index].c_str();\n}\n\nint turing_calculator::set_label_variable(const std::string& key, int value) {\n int var;\n if(fetch_label_variable(key, var)) {\n return var;\n }\n\n set_variable(key, variable(value));\n return value;\n}\n\nbool turing_calculator::fetch_label_variable(const std::string& key, int& value) {\n variable var;\n if(!fetch_variable(key, var)) {\n return false;\n }\n value = int(var);\n return true;\n}\n\nbool turing_calculator::execute_instruction(turing_machine* machine, int instruction_address) {\n if(instruction_address < 0 || instruction_address >= int(instructions_sum_)) {\n this->set_error_message(\"invalid instruction address\");\n return false;\n }\n\n this->set_error_message(\"\");\n const char* pstr = instructions_[instruction_address];\n switch(*pstr) {\n case 0:\n case '#':\n case ':':\n case '@': {\n return true;\n }\n }\n\n machine_ = machine;\n yield_execution_ = false;\n\n variable result;\n bool succeed = execute(pstr, result);\n\n machine_ = 0;\n return succeed && !yield_execution_;\n}\n\nvoid turing_calculator::do_reset() {\n delete[] instructions_;\n instructions_ = 0;\n instructions_sum_ = 0;\n str_variables_.clear();\n\n calculator::do_reset();\n}\n\n#define FX(FUNK,LEN,BIN,DO) if(!strncmp(buf,FUNK,LEN)) { move = LEN + fetch_func_params(buf+LEN,BIN,x,y); { DO; } }\ncalculator::variable\tturing_calculator::do_find_function(const char* buf, int& move) {\n calculator::variable x,y;\n switch (*buf) {\n case 'A':\n FX(\"AND(\", 4,2, return ((std::abs(x) <= DBL_EPSILON) && (std::abs(y) <= DBL_EPSILON))?1.0:0.0;);\n break;\n case 'E':\n FX(\"EQ(\", 3,2, return (std::abs(x-y) <= DBL_EPSILON)?1.0:0.0;);\n break;\n case 'G':\n FX(\"GOTO(\" , 5,1, if(machine_)machine_->set_instruction_address(int(x)); return variable(1););\n FX(\"GOTO_IF(\", 8,2, if(machine_ && y > 0.0)machine_->set_instruction_address(int(x)); return variable(y>0?1:0););\n FX(\"GT(\", 3,2, return x>y?1.0:0.0;);\n break;\n case 'L':\n FX(\"LT(\", 3,2, return x<y?1.0:0.0;);\n break;\n case 'N':\n FX(\"NOT(\", 4,1, return x<=0.0?1.0:0.0;);\n break;\n case 'O':\n FX(\"OR(\", 3,2, return ((std::abs(x) <= DBL_EPSILON) || (std::abs(y) <= DBL_EPSILON))?1.0:0.0;);\n break;\n case 'S':\n FX(\"STOP(\", 5,0, if(machine_)machine_->stop(); return variable(1););\n break;\n case 'Y':\n FX(\"YIELD(\", 6,0, this->yield_execution_ = true; return variable(1););\n break;\n }\n return\tcalculator::do_find_function(buf, move);\n}\n#undef\tFX\n\nbool turing_calculator::do_preprocess_instructions() {\n for(size_t i = 0; i < instructions_sum_; ++i) {\n const char* pstr = instructions_[i];\n if(NULL != pstr) {\n while(*pstr && isspace(*pstr)) {\n pstr++;\n }\n\n instructions_[i] = pstr;\/\/ ignore white spaces\n switch(*pstr) {\n case '@': {\/\/str variable define\n std::string name;\n name.reserve(32);\n do {\n name.push_back(*pstr);\n pstr++;\n } while(isalnum(*pstr) || *pstr == '_');\n const char* pValue = strchr(pstr,'=');\n if(NULL == pValue) {\n this->set_str_variable(name, \"\");\n } else {\n this->set_str_variable(name, ++pValue);\n }\n }\n break;\n case ':': {\/\/label define\n std::string name;\n name.reserve(32);\n do {\n name.push_back(*pstr);\n pstr++;\n } while(isalnum(*pstr) || *pstr == '_');\n this->set_label_variable(name, int(i));\n }\n break;\n }\n }\n }\n return true;\n}\n<commit_msg>turing_calculator would stop the machine if instruction address is invalid<commit_after>\n#include\t<cmath>\n#include <cfloat>\n\n#include \"string.h\"\n#include \"turing_calculator.h\"\n\nturing_calculator::turing_calculator():machine_(0), instructions_(0), instructions_sum_(0), yield_execution_(false) {\n}\n\nturing_calculator::~turing_calculator() {\n delete[] instructions_;\n}\n\nsize_t turing_calculator::set_str_variable(const std::string& key, const std::string& value) {\n variable str_index;\n if(fetch_variable(key, str_index)) {\n str_variables_[size_t(str_index)] = value;\n return size_t(str_index);\n }\n\n size_t index = str_variables_.size();\n str_variables_.push_back(value);\n this->set_variable(key, variable(index));\n return index;\n}\n\nconst char* turing_calculator::get_str_variable(const std::string& key) {\n variable index;\n if(!fetch_variable(key, index)) {\n return 0;\n }\n size_t str_index = size_t(index);\n return get_str_variable(str_index);\n}\n\nconst char* turing_calculator::get_str_variable(size_t str_var_index) {\n if(str_var_index >= str_variables_.size()) {\n return 0;\n }\n return str_variables_[str_var_index].c_str();\n}\n\nint turing_calculator::set_label_variable(const std::string& key, int value) {\n int var;\n if(fetch_label_variable(key, var)) {\n return var;\n }\n\n set_variable(key, variable(value));\n return value;\n}\n\nbool turing_calculator::fetch_label_variable(const std::string& key, int& value) {\n variable var;\n if(!fetch_variable(key, var)) {\n return false;\n }\n value = int(var);\n return true;\n}\n\nbool turing_calculator::execute_instruction(turing_machine* machine, int instruction_address) {\n if(instruction_address < 0 || instruction_address >= int(instructions_sum_)) {\n this->set_error_message(\"invalid instruction address\");\n machine->stop();\n return false;\n }\n\n this->set_error_message(\"\");\n const char* pstr = instructions_[instruction_address];\n switch(*pstr) {\n case 0:\n case '#':\n case ':':\n case '@': {\n return true;\n }\n }\n\n machine_ = machine;\n yield_execution_ = false;\n\n variable result;\n bool succeed = execute(pstr, result);\n\n machine_ = 0;\n return succeed && !yield_execution_;\n}\n\nvoid turing_calculator::do_reset() {\n delete[] instructions_;\n instructions_ = 0;\n instructions_sum_ = 0;\n str_variables_.clear();\n\n calculator::do_reset();\n}\n\n#define FX(FUNK,LEN,BIN,DO) if(!strncmp(buf,FUNK,LEN)) { move = LEN + fetch_func_params(buf+LEN,BIN,x,y); { DO; } }\ncalculator::variable\tturing_calculator::do_find_function(const char* buf, int& move) {\n calculator::variable x,y;\n switch (*buf) {\n case 'A':\n FX(\"AND(\", 4,2, return ((std::abs(x) <= DBL_EPSILON) && (std::abs(y) <= DBL_EPSILON))?1.0:0.0;);\n break;\n case 'E':\n FX(\"EQ(\", 3,2, return (std::abs(x-y) <= DBL_EPSILON)?1.0:0.0;);\n break;\n case 'G':\n FX(\"GOTO(\" , 5,1, if(machine_)machine_->set_instruction_address(int(x)); return variable(1););\n FX(\"GOTO_IF(\", 8,2, if(machine_ && y > 0.0)machine_->set_instruction_address(int(x)); return variable(y>0?1:0););\n FX(\"GT(\", 3,2, return x>y?1.0:0.0;);\n break;\n case 'L':\n FX(\"LT(\", 3,2, return x<y?1.0:0.0;);\n break;\n case 'N':\n FX(\"NOT(\", 4,1, return x<=0.0?1.0:0.0;);\n break;\n case 'O':\n FX(\"OR(\", 3,2, return ((std::abs(x) <= DBL_EPSILON) || (std::abs(y) <= DBL_EPSILON))?1.0:0.0;);\n break;\n case 'S':\n FX(\"STOP(\", 5,0, if(machine_)machine_->stop(); return variable(1););\n break;\n case 'Y':\n FX(\"YIELD(\", 6,0, this->yield_execution_ = true; return variable(1););\n break;\n }\n return\tcalculator::do_find_function(buf, move);\n}\n#undef\tFX\n\nbool turing_calculator::do_preprocess_instructions() {\n for(size_t i = 0; i < instructions_sum_; ++i) {\n const char* pstr = instructions_[i];\n if(NULL != pstr) {\n while(*pstr && isspace(*pstr)) {\n pstr++;\n }\n\n instructions_[i] = pstr;\/\/ ignore white spaces\n switch(*pstr) {\n case '@': {\/\/str variable define\n std::string name;\n name.reserve(32);\n do {\n name.push_back(*pstr);\n pstr++;\n } while(isalnum(*pstr) || *pstr == '_');\n const char* pValue = strchr(pstr,'=');\n if(NULL == pValue) {\n this->set_str_variable(name, \"\");\n } else {\n this->set_str_variable(name, ++pValue);\n }\n }\n break;\n case ':': {\/\/label define\n std::string name;\n name.reserve(32);\n do {\n name.push_back(*pstr);\n pstr++;\n } while(isalnum(*pstr) || *pstr == '_');\n this->set_label_variable(name, int(i));\n }\n break;\n }\n }\n }\n return true;\n}\n<|endoftext|>"} {"text":"<commit_before><commit_msg>Disable two ui_tests on linux after a WebKit merge.<commit_after><|endoftext|>"} {"text":"<commit_before>\/**\n * @file shared_ptr.hpp\n * @brief shared_ptr is a minimal implementation of smart pointer, a subset of the C++11 std::shared_ptr or boost::shared_ptr.\n *\n * This file includes \"boost\/shared_ptr.hpp\" if LOGGER_USE_BOOST_SHARED_PTR is defined,\n * or <memory> (or <tr1\/memory>) when C++11 (or experimental C++0x) is available,\n * and imports the symbol \"shared_ptr\" inside the current namespace (ie. Log::shared_ptr).\n * If no std::shared_ptr is available, it defines a minimal shared_ptr implementation.\n *\n * Copyright (c) 2013 Sebastien Rombauts (sebastien.rombauts@gmail.com)\n *\n * Distributed under the MIT License (MIT) (See accompanying file LICENSE.txt\n * or copy at http:\/\/opensource.org\/licenses\/MIT)\n *\/\n#pragma once\n\n\n\/\/\/ Compatibility with non-clang compilers.\n#ifndef __has_feature\n #define __has_feature(x) 0\n#endif\n\n\/\/\n\/\/ Try to detect the better shared_ptr to use, and then imports the symbol in the current namespace\n\/\/ => if you include this \"shared_ptr.hpp\" file inside your own namespace you will\n\/\/ get a kind of universal easy to use \"shared_ptr\" type\n\/\/\n#ifdef LOGGER_USE_BOOST_SHARED_PTR\n \/\/ Use Boost only if explicitly told\n #include <boost\/shared_ptr.hpp>\n namespace Log {\n using boost::shared_ptr;\n } \/\/ namespace Log\n\/\/ Detect whether the compiler supports C++11 shared_ptr or its TR1 pre-version.\n#elif (defined(__GNUC__) && \\\n (__GNUC__ > 4 || (__GNUC__ == 4 && __GNUC_MINOR__ > 2)) && \\\n defined(__GXX_EXPERIMENTAL_CXX0X__))\n \/\/ GCC 4.3 and following have std::shared_ptr support when called with -std=c++0x (or -std=c++11 starting with GCC 4.7)\n #include <memory>\n namespace Log {\n using std::shared_ptr;\n } \/\/ namespace Log\n#elif (defined(__GNUC__) && (__GNUC__ == 4) && defined(__GXX_EXPERIMENTAL_CXX0X__))\n \/\/ GCC 4.0\/4.1\/4.2 have std::shared_ptr support when when called with -std=c++0x\n #include <tr1\/memory>\n namespace Log {\n using std::tr1::shared_ptr;\n } \/\/ namespace Log\n#elif defined(__clang__) && __has_feature(cxx_nullptr)\n \/\/ Clang 2.9 and above ?\n #include <memory>\n namespace Log {\n using std::shared_ptr;\n } \/\/ namespace Log\n#elif defined(_MSC_VER) && (_MSC_VER >= 1600)\n \/\/ Visual Studio 2010 compile by default in C++11 mode\n #include <memory>\n namespace Log {\n using std::shared_ptr;\n } \/\/ namespace Log\n#elif defined(_MSC_VER) && (_MSC_VER >= 1500)\n \/\/ Visual Studio 2008 : beware, TR1 is provided with the Service Pack 1 only !\n #include <memory>\n namespace Log {\n using std::tr1:shared_ptr;\n } \/\/ namespace Log\n#else\n\n\n#include <cstddef> \/\/ NULL\n#include <algorithm> \/\/ std::swap\n#include <cassert>\n\n\/\/ can be replaced by other error mechanism\n#define SHARED_ASSERT(x) assert(x)\n\nnamespace Log {\n\n\/**\n * @brief minimal implementation of smart pointer, a subset of the C++11 std::shared_ptr or boost::shared_ptr.\n *\n * shared_ptr is a smart pointer retaining ownership of an object through a provided pointer,\n * and sharing this ownership with a reference counter.\n * It destroys the object when the last shared pointer pointing to it is destroyed or reset.\n *\/\ntemplate<class T>\nclass shared_ptr\n{\npublic:\n \/\/\/ The type of the managed object, aliased as member type\n typedef T element_type;\n\n \/\/\/ @brief Default constructor\n shared_ptr(void) throw() : \/\/ never throws\n px(NULL),\n pn(NULL)\n {\n }\n \/\/\/ @brief Constructor with the provided pointer to manage\n explicit shared_ptr(T* p) : \/\/ may throw std::bad_alloc\n \/\/px(p), would be unsafe as acquire() may throw, which would call release() in destructor\n pn(NULL)\n {\n acquire(p); \/\/ may throw std::bad_alloc\n }\n \/\/\/ @brief Constructor to share ownership. Warning : to be used for pointer_cast only ! (does not manage two separate <T> and <U> pointers)\n template <class U>\n shared_ptr(const shared_ptr<U>& ptr, T* p) :\n \/\/px(p), would be unsafe as acquire() may throw, which would call release() in destructor\n pn(ptr.pn)\n {\n acquire(p); \/\/ may throw std::bad_alloc\n }\n \/\/\/ @brief Copy constructor to convert from another pointer type\n template <class U>\n shared_ptr(const shared_ptr<U>& ptr) throw() : \/\/ never throws (see comment below)\n \/\/px(ptr.px),\n pn(ptr.pn)\n {\n SHARED_ASSERT((NULL == ptr.px) || (NULL != ptr.pn)); \/\/ must be cohérent : no allocation allowed in this path\n acquire(static_cast<typename shared_ptr<T>::element_type*>(ptr.px)); \/\/ will never throw std::bad_alloc\n }\n \/\/\/ @brief Copy constructor (used by the copy-and-swap idiom)\n shared_ptr(const shared_ptr& ptr) throw() : \/\/ never throws (see comment below)\n \/\/px(ptr.px),\n pn(ptr.pn)\n {\n SHARED_ASSERT((NULL == ptr.px) || (NULL != ptr.pn)); \/\/ must be cohérent : no allocation allowed in this path\n acquire(ptr.px); \/\/ will never throw std::bad_alloc\n }\n \/\/\/ @brief Assignment operator using the copy-and-swap idiom (copy constructor and swap method)\n shared_ptr& operator=(shared_ptr ptr) throw() \/\/ never throws\n {\n swap(ptr);\n return *this;\n }\n \/\/\/ @brief the destructor releases its ownership\n inline ~shared_ptr(void) throw() \/\/ never throws\n {\n release();\n }\n \/\/\/ @brief this reset releases its ownership\n inline void reset(void) throw() \/\/ never throws\n {\n release();\n }\n \/\/\/ @brief this reset release its ownership and re-acquire another one\n void reset(T* p) throw() \/\/ may throw std::bad_alloc\n {\n SHARED_ASSERT((NULL == p) || (px != p)); \/\/ auto-reset not allowed\n release();\n acquire(p); \/\/ may throw std::bad_alloc\n }\n\n \/\/\/ @brief Swap method for the copy-and-swap idiom (copy constructor and swap method)\n void swap(shared_ptr& lhs) throw() \/\/ never throws\n {\n \/\/ Would be nice to enable use of ustl::swap by define\n std::swap(px, lhs.px);\n std::swap(pn, lhs.pn);\n }\n\n \/\/ reference counter operations :\n inline operator bool() const throw() \/\/ never throws\n {\n return (0 < use_count());\n }\n inline bool unique(void) const throw() \/\/ never throws\n {\n return (1 == use_count());\n }\n long use_count(void) const throw() \/\/ never throws\n {\n long count = 0;\n if (NULL != pn)\n {\n count = *pn;\n }\n return count;\n }\n\n \/\/ underlying pointer operations :\n inline T& operator*() const throw() \/\/ never throws\n {\n SHARED_ASSERT(NULL != px);\n return *px;\n }\n inline T* operator->() const throw() \/\/ never throws\n {\n SHARED_ASSERT(NULL != px);\n return px;\n }\n inline T* get(void) const throw() \/\/ never throws\n {\n \/\/ no assert, car return NULL\n return px;\n }\n\nprivate:\n \/\/\/ @brief acquire\/share the ownership of the px pointer, initializing the reference counter\n void acquire(T* p) \/\/ may throw std::bad_alloc\n {\n if (NULL != p)\n {\n if (NULL == pn)\n {\n try\n {\n pn = new long(1); \/\/ may throw std::bad_alloc\n }\n catch (std::bad_alloc&)\n {\n delete p;\n throw; \/\/ rethrow the std::bad_alloc\n }\n }\n else\n {\n ++(*pn);\n }\n }\n \/\/ here it is safe to acquire the ownership of the provided raw pointer, where exception cannot be thrown any more\n px = p;\n }\n\n \/\/\/ @brief release the ownership of the px pointer, destroying the object when appropriate\n void release(void) throw() \/\/ never throws\n {\n if (NULL != pn)\n {\n --(*pn);\n if (0 == *pn)\n {\n delete px;\n delete pn;\n }\n px = NULL;\n pn = NULL;\n }\n }\n\nprivate:\n \/\/ This allow pointer_cast functions to share the reference counter between different shared_ptr types\n template<class U>\n friend class shared_ptr;\n\nprivate:\n T* px; \/\/!< Native pointer\n long* pn; \/\/!< Reference counter\n};\n\n\n\/\/ comparaison operators\ntemplate<class T, class U> inline bool operator==(const shared_ptr<T>& l, const shared_ptr<U>& r) throw() \/\/ never throws\n{\n return (l.get() == r.get());\n}\ntemplate<class T, class U> inline bool operator!=(const shared_ptr<T>& l, const shared_ptr<U>& r) throw() \/\/ never throws\n{\n return (l.get() != r.get());\n}\ntemplate<class T, class U> inline bool operator<=(const shared_ptr<T>& l, const shared_ptr<U>& r) throw() \/\/ never throws\n{\n return (l.get() <= r.get());\n}\ntemplate<class T, class U> inline bool operator<(const shared_ptr<T>& l, const shared_ptr<U>& r) throw() \/\/ never throws\n{\n return (l.get() < r.get());\n}\ntemplate<class T, class U> inline bool operator>=(const shared_ptr<T>& l, const shared_ptr<U>& r) throw() \/\/ never throws\n{\n return (l.get() >= r.get());\n}\ntemplate<class T, class U> inline bool operator>(const shared_ptr<T>& l, const shared_ptr<U>& r) throw() \/\/ never throws\n{\n return (l.get() > r.get());\n}\n\n\n\n\/\/ static cast of shared_ptr\ntemplate<class T, class U>\nshared_ptr<T> static_pointer_cast(const shared_ptr<U>& ptr) \/\/ never throws\n{\n return shared_ptr<T>(ptr, static_cast<typename shared_ptr<T>::element_type*>(ptr.get()));\n}\n\n\/\/ dynamic cast of shared_ptr\ntemplate<class T, class U>\nshared_ptr<T> dynamic_pointer_cast(const shared_ptr<U>& ptr) \/\/ never throws\n{\n T* p = dynamic_cast<typename shared_ptr<T>::element_type*>(ptr.get());\n if (NULL != p)\n {\n return shared_ptr<T>(ptr, p);\n }\n else\n {\n return shared_ptr<T>();\n }\n}\n\n} \/\/ namespace Log\n\n#endif\n<commit_msg>Fix a syntax issue for VS2008<commit_after>\/**\n * @file shared_ptr.hpp\n * @brief shared_ptr is a minimal implementation of smart pointer, a subset of the C++11 std::shared_ptr or boost::shared_ptr.\n *\n * This file includes \"boost\/shared_ptr.hpp\" if LOGGER_USE_BOOST_SHARED_PTR is defined,\n * or <memory> (or <tr1\/memory>) when C++11 (or experimental C++0x) is available,\n * and imports the symbol \"shared_ptr\" inside the current namespace (ie. Log::shared_ptr).\n * If no std::shared_ptr is available, it defines a minimal shared_ptr implementation.\n *\n * Copyright (c) 2013 Sebastien Rombauts (sebastien.rombauts@gmail.com)\n *\n * Distributed under the MIT License (MIT) (See accompanying file LICENSE.txt\n * or copy at http:\/\/opensource.org\/licenses\/MIT)\n *\/\n#pragma once\n\n\n\/\/\/ Compatibility with non-clang compilers.\n#ifndef __has_feature\n #define __has_feature(x) 0\n#endif\n\n\/\/\n\/\/ Try to detect the better shared_ptr to use, and then imports the symbol in the current namespace\n\/\/ => if you include this \"shared_ptr.hpp\" file inside your own namespace you will\n\/\/ get a kind of universal easy to use \"shared_ptr\" type\n\/\/\n#ifdef LOGGER_USE_BOOST_SHARED_PTR\n \/\/ Use Boost only if explicitly told\n #include <boost\/shared_ptr.hpp>\n namespace Log {\n using boost::shared_ptr;\n } \/\/ namespace Log\n\/\/ Detect whether the compiler supports C++11 shared_ptr or its TR1 pre-version.\n#elif (defined(__GNUC__) && \\\n (__GNUC__ > 4 || (__GNUC__ == 4 && __GNUC_MINOR__ > 2)) && \\\n defined(__GXX_EXPERIMENTAL_CXX0X__))\n \/\/ GCC 4.3 and following have std::shared_ptr support when called with -std=c++0x (or -std=c++11 starting with GCC 4.7)\n #include <memory>\n namespace Log {\n using std::shared_ptr;\n } \/\/ namespace Log\n#elif (defined(__GNUC__) && (__GNUC__ == 4) && defined(__GXX_EXPERIMENTAL_CXX0X__))\n \/\/ GCC 4.0\/4.1\/4.2 have std::shared_ptr support when when called with -std=c++0x\n #include <tr1\/memory>\n namespace Log {\n using std::tr1::shared_ptr;\n } \/\/ namespace Log\n#elif defined(__clang__) && __has_feature(cxx_nullptr)\n \/\/ Clang 2.9 and above ?\n #include <memory>\n namespace Log {\n using std::shared_ptr;\n } \/\/ namespace Log\n#elif defined(_MSC_VER) && (_MSC_VER >= 1600)\n \/\/ Visual Studio 2010 compile by default in C++11 mode\n #include <memory>\n namespace Log {\n using std::shared_ptr;\n } \/\/ namespace Log\n#elif defined(_MSC_VER) && (_MSC_VER >= 1500)\n \/\/ Visual Studio 2008 : beware, TR1 is provided with the Service Pack 1 only !\n #include <memory>\n namespace Log {\n using std::tr1::shared_ptr;\n } \/\/ namespace Log\n#else\n\n\n#include <cstddef> \/\/ NULL\n#include <algorithm> \/\/ std::swap\n#include <cassert>\n\n\/\/ can be replaced by other error mechanism\n#define SHARED_ASSERT(x) assert(x)\n\nnamespace Log {\n\n\/**\n * @brief minimal implementation of smart pointer, a subset of the C++11 std::shared_ptr or boost::shared_ptr.\n *\n * shared_ptr is a smart pointer retaining ownership of an object through a provided pointer,\n * and sharing this ownership with a reference counter.\n * It destroys the object when the last shared pointer pointing to it is destroyed or reset.\n *\/\ntemplate<class T>\nclass shared_ptr\n{\npublic:\n \/\/\/ The type of the managed object, aliased as member type\n typedef T element_type;\n\n \/\/\/ @brief Default constructor\n shared_ptr(void) throw() : \/\/ never throws\n px(NULL),\n pn(NULL)\n {\n }\n \/\/\/ @brief Constructor with the provided pointer to manage\n explicit shared_ptr(T* p) : \/\/ may throw std::bad_alloc\n \/\/px(p), would be unsafe as acquire() may throw, which would call release() in destructor\n pn(NULL)\n {\n acquire(p); \/\/ may throw std::bad_alloc\n }\n \/\/\/ @brief Constructor to share ownership. Warning : to be used for pointer_cast only ! (does not manage two separate <T> and <U> pointers)\n template <class U>\n shared_ptr(const shared_ptr<U>& ptr, T* p) :\n \/\/px(p), would be unsafe as acquire() may throw, which would call release() in destructor\n pn(ptr.pn)\n {\n acquire(p); \/\/ may throw std::bad_alloc\n }\n \/\/\/ @brief Copy constructor to convert from another pointer type\n template <class U>\n shared_ptr(const shared_ptr<U>& ptr) throw() : \/\/ never throws (see comment below)\n \/\/px(ptr.px),\n pn(ptr.pn)\n {\n SHARED_ASSERT((NULL == ptr.px) || (NULL != ptr.pn)); \/\/ must be cohérent : no allocation allowed in this path\n acquire(static_cast<typename shared_ptr<T>::element_type*>(ptr.px)); \/\/ will never throw std::bad_alloc\n }\n \/\/\/ @brief Copy constructor (used by the copy-and-swap idiom)\n shared_ptr(const shared_ptr& ptr) throw() : \/\/ never throws (see comment below)\n \/\/px(ptr.px),\n pn(ptr.pn)\n {\n SHARED_ASSERT((NULL == ptr.px) || (NULL != ptr.pn)); \/\/ must be cohérent : no allocation allowed in this path\n acquire(ptr.px); \/\/ will never throw std::bad_alloc\n }\n \/\/\/ @brief Assignment operator using the copy-and-swap idiom (copy constructor and swap method)\n shared_ptr& operator=(shared_ptr ptr) throw() \/\/ never throws\n {\n swap(ptr);\n return *this;\n }\n \/\/\/ @brief the destructor releases its ownership\n inline ~shared_ptr(void) throw() \/\/ never throws\n {\n release();\n }\n \/\/\/ @brief this reset releases its ownership\n inline void reset(void) throw() \/\/ never throws\n {\n release();\n }\n \/\/\/ @brief this reset release its ownership and re-acquire another one\n void reset(T* p) throw() \/\/ may throw std::bad_alloc\n {\n SHARED_ASSERT((NULL == p) || (px != p)); \/\/ auto-reset not allowed\n release();\n acquire(p); \/\/ may throw std::bad_alloc\n }\n\n \/\/\/ @brief Swap method for the copy-and-swap idiom (copy constructor and swap method)\n void swap(shared_ptr& lhs) throw() \/\/ never throws\n {\n \/\/ Would be nice to enable use of ustl::swap by define\n std::swap(px, lhs.px);\n std::swap(pn, lhs.pn);\n }\n\n \/\/ reference counter operations :\n inline operator bool() const throw() \/\/ never throws\n {\n return (0 < use_count());\n }\n inline bool unique(void) const throw() \/\/ never throws\n {\n return (1 == use_count());\n }\n long use_count(void) const throw() \/\/ never throws\n {\n long count = 0;\n if (NULL != pn)\n {\n count = *pn;\n }\n return count;\n }\n\n \/\/ underlying pointer operations :\n inline T& operator*() const throw() \/\/ never throws\n {\n SHARED_ASSERT(NULL != px);\n return *px;\n }\n inline T* operator->() const throw() \/\/ never throws\n {\n SHARED_ASSERT(NULL != px);\n return px;\n }\n inline T* get(void) const throw() \/\/ never throws\n {\n \/\/ no assert, car return NULL\n return px;\n }\n\nprivate:\n \/\/\/ @brief acquire\/share the ownership of the px pointer, initializing the reference counter\n void acquire(T* p) \/\/ may throw std::bad_alloc\n {\n if (NULL != p)\n {\n if (NULL == pn)\n {\n try\n {\n pn = new long(1); \/\/ may throw std::bad_alloc\n }\n catch (std::bad_alloc&)\n {\n delete p;\n throw; \/\/ rethrow the std::bad_alloc\n }\n }\n else\n {\n ++(*pn);\n }\n }\n \/\/ here it is safe to acquire the ownership of the provided raw pointer, where exception cannot be thrown any more\n px = p;\n }\n\n \/\/\/ @brief release the ownership of the px pointer, destroying the object when appropriate\n void release(void) throw() \/\/ never throws\n {\n if (NULL != pn)\n {\n --(*pn);\n if (0 == *pn)\n {\n delete px;\n delete pn;\n }\n px = NULL;\n pn = NULL;\n }\n }\n\nprivate:\n \/\/ This allow pointer_cast functions to share the reference counter between different shared_ptr types\n template<class U>\n friend class shared_ptr;\n\nprivate:\n T* px; \/\/!< Native pointer\n long* pn; \/\/!< Reference counter\n};\n\n\n\/\/ comparaison operators\ntemplate<class T, class U> inline bool operator==(const shared_ptr<T>& l, const shared_ptr<U>& r) throw() \/\/ never throws\n{\n return (l.get() == r.get());\n}\ntemplate<class T, class U> inline bool operator!=(const shared_ptr<T>& l, const shared_ptr<U>& r) throw() \/\/ never throws\n{\n return (l.get() != r.get());\n}\ntemplate<class T, class U> inline bool operator<=(const shared_ptr<T>& l, const shared_ptr<U>& r) throw() \/\/ never throws\n{\n return (l.get() <= r.get());\n}\ntemplate<class T, class U> inline bool operator<(const shared_ptr<T>& l, const shared_ptr<U>& r) throw() \/\/ never throws\n{\n return (l.get() < r.get());\n}\ntemplate<class T, class U> inline bool operator>=(const shared_ptr<T>& l, const shared_ptr<U>& r) throw() \/\/ never throws\n{\n return (l.get() >= r.get());\n}\ntemplate<class T, class U> inline bool operator>(const shared_ptr<T>& l, const shared_ptr<U>& r) throw() \/\/ never throws\n{\n return (l.get() > r.get());\n}\n\n\n\n\/\/ static cast of shared_ptr\ntemplate<class T, class U>\nshared_ptr<T> static_pointer_cast(const shared_ptr<U>& ptr) \/\/ never throws\n{\n return shared_ptr<T>(ptr, static_cast<typename shared_ptr<T>::element_type*>(ptr.get()));\n}\n\n\/\/ dynamic cast of shared_ptr\ntemplate<class T, class U>\nshared_ptr<T> dynamic_pointer_cast(const shared_ptr<U>& ptr) \/\/ never throws\n{\n T* p = dynamic_cast<typename shared_ptr<T>::element_type*>(ptr.get());\n if (NULL != p)\n {\n return shared_ptr<T>(ptr, p);\n }\n else\n {\n return shared_ptr<T>();\n }\n}\n\n} \/\/ namespace Log\n\n#endif\n<|endoftext|>"} {"text":"<commit_before>\/**\n * @file\n * Zenderer\/Math\/Vector.hpp - A vector class representing a position\n * in 3D (or 2D) space, fully supporting the mathematical operations\n * typical of such a structure.\n *\n * @author George Kudrayvtsev (halcyon)\n * @version 1.1.3\n * @copyright Apache License v2.0\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\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\n * distributed under the License is distributed on an \"AS IS\" BASIS, \\n\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\\n\n * See the License for the specific language governing permissions and \\n\n * limitations under the License.\n *\n * @addtogroup Math\n * @{\n **\/\n\n#ifndef IRON_CLAD__MATH__VECTOR_2_HPP\n#define IRON_CLAD__MATH__VECTOR_2_HPP\n\n#include <cmath>\n#include <ostream>\n\n#include \"Zenderer\/Core\/Types.hpp\"\n#include \"MathCore.hpp\"\n\nnamespace zen\n{\nnamespace math\n{\n \/**\n * Forward declaration of a 4x4 matrix for use in\n * 2D vector translation.\n **\/\n class ZEN_API matrix4x4_t;\n\n \/**\n * Represents a point in 3D rectangular-coordinate space.\n * Supports all vector operations such as cross products,\n * dot products, movement, scaling, and rotation.\n *\n * The class is templated to store any sort of POD values that\n * you'd like, such as `float`, `int`, `uint32_t`, etc.\n * Beware that any operations between mixed vector types will\n * return the type of the vector on the left-hand side of the\n * operation. e.g.:\n *\n * @code\n * Vector<int> A(1, 2, 3);\n * Vector<float> B(1.1, 2.2, 3.3);\n *\n * Vector<float> C = A + B; \/\/ INVALID!\n * Vector<int> C = A + B; \/\/ VALID\n * @endcode\n *\n * Thus if you need a higher level of precision, keep that vector\n * instance on the right-hand side.\n *\n * There is a built-in shortcut to `vector_t` that is a floating-point\n * vector representation that is used throughout the engine.\n *\n * @todo Add support for translation via matrices.\n * @note There is support for creating translation matrices via\n * vectors but not vice-versa.\n *\n * @see USE_DOUBLE_PRECISION\n **\/\n template<typename T>\n struct ZEN_API Vector\n {\n \/\/\/ The publicly-accessible vector components.\n T x, y, z;\n\n \/\/\/ Default constructor that moves the vector to the origin.\n Vector() : x(0), y(0), z(0) {}\n\n \/\/\/ Constructor for any coordinate space (defaults to 2D).\n Vector(real_t x, real_t y, real_t z = 0) : x(x), y(y), z(z) {}\n\n \/\/\/ Copies vector components from one to another.\n template<typename U>\n Vector(const Vector<U>& C) : x(C.x), y(C.y), z(C.z) {}\n\n \/\/\/ Assigns one vector to another.\n template<typename U> inline\n Vector<T>& operator=(const Vector<U>& Copy);\n\n \/\/\/ Compares two vectors for equivalence.\n template<typename U> inline\n bool operator==(const Vector<U>& Other) const;\n\n \/\/\/ Opposite of Vector::operator==()\n template<typename U> inline\n bool operator!=(const Vector<U>& Other) const;\n\n \/\/ Begin mathematical vector operations.\n\n \/**\n * Calculates the cross product of two vectors.\n * The cross product of two vectors is a vector that is\n * perpendicular to both operators. e.g. i = j ^ k.\n *\n * @param Other The vector to cross with\n *\n * @return A 3D vector normal to both vectors.\n **\/\n template<typename U> inline\n Vector<T> operator^(const Vector<U>& Other) const;\n\n \/**\n * Calculates the dot product of two vectors.\n * The dot product is useful in finding the angle between two\n * vectors. The formula for that is as follows:\n *\n * cos(T) = (A . B) \/ (|| A || * || B ||)\n *\n * The actual operation is defined as such:\n *\n * A = (x1, y1, z1)\n * B = (x2, y2, z2)\n * A . B = x1*x2 + y1*y2 + z1*z2\n *\n * @param Other The vector to dot with.\n *\n * @return The dot product as a scalar.\n **\/\n template<typename U> inline\n real_t operator*(const Vector<U>& Other) const;\n\n \/**\n * Multiplies each component by a scalar factor.\n * @param scalar The component scaling factor\n * @return A 2D resultant vector.\n **\/\n inline Vector<T> operator*(const real_t scalar) const;\n\n \/**\n * Divides each component by a scalar factor.\n * @param scalar The component scaling factor\n * @return A 2D resultant vector.\n **\/\n inline Vector<T> operator\/(const real_t scalar) const;\n\n \/**\n * Adds a given vector to the current vector, returning the result.\n * @param Other The vector to add (component-wise)\n * @return A 2D resultant vector.\n **\/\n template<typename U> inline\n Vector<T> operator+(const Vector<U>& Other) const;\n\n \/**\n * Adds a value to both components of the current vector.\n * @param value The value to add\n * @return A 2D resultant vector.\n **\/\n inline Vector<T> operator+(const real_t value) const;\n\n \/**\n * Subtracts a given vector from the current vector, returning the result.\n * @param Other The vector to subtract from the current vector\n * @return A 2D resultant vector.\n **\/\n template<typename U> inline\n Vector<T> operator-(const Vector<U>& Other) const;\n\n \/**\n * Normalizes the current vector.\n * This *DOES* modify the current vector, and makes it into\n * a unit vector version of itself.\n **\/\n inline void Normalize();\n\n \/\/\/ Returns the current vectors magnitude, or 'norm'.\n inline real_t Magnitude() const;\n\n \/**\n * Rotates the current vector using the rotation matrix.\n * The rotation matrix (in right-hand Cartesian plane)\n * is defined as being\n * | x | | cos(d), -sin(d) |\n * | y | | sin(d), cos(d) |\n *\n * But in the OpenGL coordinate system, the origin is in\n * the top-left, as opposed to bottom-left, as shown above.\n * So rotations are actually inverted and the matrix is\n * | x | | cos(d), sin(d) |\n * | y | | -sin(d), cos(d) |\n *\n * So the final rotation in OpenGL would be:\n * x = x * cos(d) + y * sin(d)\n * y = -x * sin(d) + y * cos(d)\n *\n * @param radians The rotation angle in radians.\n *\n * @info The coordinate system adjustment was removed.\n **\/\n inline void Rotate(const real_t radians);\n\n \/**\n * Translates the current vector by a matrix.\n * @param TransMat Translation matrix\n **\/\n void Translate(const matrix4x4_t& TransMat);\n\n \/**\n * Returns a scalar cross product value between two 2D vectors.\n * Given a vector v = <x1, y1> and a vector w = <x2, y2>, their\n * cross-product is determined as <0, 0, x1*y2 - y1*x2>.\n * So, this method returns the third component.\n *\n * This value can be used to determine which side of a vector\n * another vector is on. If the return value is negative, the\n * \"Other\" vector is on the left (going ccw). If positive,\n * it's on the right (going c\/w). This can also be done by\n * examining the dot product.\n *\n * @param Other Vector to test cross product on\n *\n * @return 2D cross product (z-component of 3D cross).\n *\n * @see operator*(const Vector&)\n **\/\n template<typename U> inline\n real_t Cross2D(const Vector<U>& Other) const;\n\n \/**\n * Returns a normalized version of the current vector.\n * @see Vector::Normalize()\n **\/\n inline Vector<T> GetNormalized() const;\n\n \/\/\/ Outputs the vector in the form `<x, y, z>`\n template<typename U> friend\n std::ostream& operator<<(std::ostream& out,\n const Vector<U>& Other);\n };\n\n #include \"Vector.inl\"\n\n \/\/\/ A shortcut for the default vector implementation in the engine.\n typedef Vector<real_t> vector_t;\n\n} \/\/ namespace math\n} \/\/ namespace ic\n\n#endif \/\/ IRON_CLAD__MATH__VECTOR_2_HPP\n\n\/** @} **\/\n<commit_msg>Vector constructor uses template<commit_after>\/**\n * @file\n * Zenderer\/Math\/Vector.hpp - A vector class representing a position\n * in 3D (or 2D) space, fully supporting the mathematical operations\n * typical of such a structure.\n *\n * @author George Kudrayvtsev (halcyon)\n * @version 1.1.3\n * @copyright Apache License v2.0\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\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\n * distributed under the License is distributed on an \"AS IS\" BASIS, \\n\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\\n\n * See the License for the specific language governing permissions and \\n\n * limitations under the License.\n *\n * @addtogroup Math\n * @{\n **\/\n\n#ifndef IRON_CLAD__MATH__VECTOR_2_HPP\n#define IRON_CLAD__MATH__VECTOR_2_HPP\n\n#include <cmath>\n#include <ostream>\n\n#include \"Zenderer\/Core\/Types.hpp\"\n#include \"MathCore.hpp\"\n\nnamespace zen\n{\nnamespace math\n{\n \/**\n * Forward declaration of a 4x4 matrix for use in\n * 2D vector translation.\n **\/\n class ZEN_API matrix4x4_t;\n\n \/**\n * Represents a point in 3D rectangular-coordinate space.\n * Supports all vector operations such as cross products,\n * dot products, movement, scaling, and rotation.\n *\n * The class is templated to store any sort of POD values that\n * you'd like, such as `float`, `int`, `uint32_t`, etc.\n * Beware that any operations between mixed vector types will\n * return the type of the vector on the left-hand side of the\n * operation. e.g.:\n *\n * @code\n * Vector<int> A(1, 2, 3);\n * Vector<float> B(1.1, 2.2, 3.3);\n *\n * Vector<float> C = A + B; \/\/ INVALID!\n * Vector<int> C = A + B; \/\/ VALID\n * @endcode\n *\n * Thus if you need a higher level of precision, keep that vector\n * instance on the right-hand side.\n *\n * There is a built-in shortcut to `vector_t` that is a floating-point\n * vector representation that is used throughout the engine.\n *\n * @todo Add support for translation via matrices.\n * @note There is support for creating translation matrices via\n * vectors but not vice-versa.\n *\n * @see USE_DOUBLE_PRECISION\n **\/\n template<typename T>\n struct ZEN_API Vector\n {\n \/\/\/ The publicly-accessible vector components.\n T x, y, z;\n\n \/\/\/ Default constructor that moves the vector to the origin.\n Vector() : x(0), y(0), z(0) {}\n\n \/\/\/ Constructor for any coordinate space (defaults to 2D).\n Vector(T x, T y, T z = 0) : x(x), y(y), z(z) {}\n\n \/\/\/ Copies vector components from one to another.\n template<typename U>\n Vector(const Vector<U>& C) : x(C.x), y(C.y), z(C.z) {}\n\n \/\/\/ Assigns one vector to another.\n template<typename U> inline\n Vector<T>& operator=(const Vector<U>& Copy);\n\n \/\/\/ Compares two vectors for equivalence.\n template<typename U> inline\n bool operator==(const Vector<U>& Other) const;\n\n \/\/\/ Opposite of Vector::operator==()\n template<typename U> inline\n bool operator!=(const Vector<U>& Other) const;\n\n \/\/ Begin mathematical vector operations.\n\n \/**\n * Calculates the cross product of two vectors.\n * The cross product of two vectors is a vector that is\n * perpendicular to both operators. e.g. i = j ^ k.\n *\n * @param Other The vector to cross with\n *\n * @return A 3D vector normal to both vectors.\n **\/\n template<typename U> inline\n Vector<T> operator^(const Vector<U>& Other) const;\n\n \/**\n * Calculates the dot product of two vectors.\n * The dot product is useful in finding the angle between two\n * vectors. The formula for that is as follows:\n *\n * cos(T) = (A . B) \/ (|| A || * || B ||)\n *\n * The actual operation is defined as such:\n *\n * A = (x1, y1, z1)\n * B = (x2, y2, z2)\n * A . B = x1*x2 + y1*y2 + z1*z2\n *\n * @param Other The vector to dot with.\n *\n * @return The dot product as a scalar.\n **\/\n template<typename U> inline\n real_t operator*(const Vector<U>& Other) const;\n\n \/**\n * Multiplies each component by a scalar factor.\n * @param scalar The component scaling factor\n * @return A 2D resultant vector.\n **\/\n inline Vector<T> operator*(const real_t scalar) const;\n\n \/**\n * Divides each component by a scalar factor.\n * @param scalar The component scaling factor\n * @return A 2D resultant vector.\n **\/\n inline Vector<T> operator\/(const real_t scalar) const;\n\n \/**\n * Adds a given vector to the current vector, returning the result.\n * @param Other The vector to add (component-wise)\n * @return A 2D resultant vector.\n **\/\n template<typename U> inline\n Vector<T> operator+(const Vector<U>& Other) const;\n\n \/**\n * Adds a value to both components of the current vector.\n * @param value The value to add\n * @return A 2D resultant vector.\n **\/\n inline Vector<T> operator+(const real_t value) const;\n\n \/**\n * Subtracts a given vector from the current vector, returning the result.\n * @param Other The vector to subtract from the current vector\n * @return A 2D resultant vector.\n **\/\n template<typename U> inline\n Vector<T> operator-(const Vector<U>& Other) const;\n\n \/**\n * Normalizes the current vector.\n * This *DOES* modify the current vector, and makes it into\n * a unit vector version of itself.\n **\/\n inline void Normalize();\n\n \/\/\/ Returns the current vectors magnitude, or 'norm'.\n inline real_t Magnitude() const;\n\n \/**\n * Rotates the current vector using the rotation matrix.\n * The rotation matrix (in right-hand Cartesian plane)\n * is defined as being\n * | x | | cos(d), -sin(d) |\n * | y | | sin(d), cos(d) |\n *\n * But in the OpenGL coordinate system, the origin is in\n * the top-left, as opposed to bottom-left, as shown above.\n * So rotations are actually inverted and the matrix is\n * | x | | cos(d), sin(d) |\n * | y | | -sin(d), cos(d) |\n *\n * So the final rotation in OpenGL would be:\n * x = x * cos(d) + y * sin(d)\n * y = -x * sin(d) + y * cos(d)\n *\n * @param radians The rotation angle in radians.\n *\n * @info The coordinate system adjustment was removed.\n **\/\n inline void Rotate(const real_t radians);\n\n \/**\n * Translates the current vector by a matrix.\n * @param TransMat Translation matrix\n **\/\n void Translate(const matrix4x4_t& TransMat);\n\n \/**\n * Returns a scalar cross product value between two 2D vectors.\n * Given a vector v = <x1, y1> and a vector w = <x2, y2>, their\n * cross-product is determined as <0, 0, x1*y2 - y1*x2>.\n * So, this method returns the third component.\n *\n * This value can be used to determine which side of a vector\n * another vector is on. If the return value is negative, the\n * \"Other\" vector is on the left (going ccw). If positive,\n * it's on the right (going c\/w). This can also be done by\n * examining the dot product.\n *\n * @param Other Vector to test cross product on\n *\n * @return 2D cross product (z-component of 3D cross).\n *\n * @see operator*(const Vector&)\n **\/\n template<typename U> inline\n real_t Cross2D(const Vector<U>& Other) const;\n\n \/**\n * Returns a normalized version of the current vector.\n * @see Vector::Normalize()\n **\/\n inline Vector<T> GetNormalized() const;\n\n \/\/\/ Outputs the vector in the form `<x, y, z>`\n template<typename U> friend\n std::ostream& operator<<(std::ostream& out,\n const Vector<U>& Other);\n };\n\n #include \"Vector.inl\"\n\n \/\/\/ A shortcut for the default vector implementation in the engine.\n typedef Vector<real_t> vector_t;\n\n} \/\/ namespace math\n} \/\/ namespace ic\n\n#endif \/\/ IRON_CLAD__MATH__VECTOR_2_HPP\n\n\/** @} **\/\n<|endoftext|>"} {"text":"<commit_before>\/\/\n\/\/\n\/\/ Copyright (c) 2017, 2019 Ivan Baidakou (basiliscos) (the dot dmol at gmail\n\/\/ dot com)\n\/\/\n\/\/ Distributed under the MIT Software License\n\/\/\n#pragma once\n\n#include \"..\/Protocol.hpp\"\n#include \"..\/Result.hpp\"\n#include <memory>\n#include <utility>\n\n#include <boost\/asio.hpp>\n#include <boost\/variant.hpp>\n\nnamespace bredis {\n\ntemplate <typename Iterator, typename Policy> struct result_handler_t;\n\ntemplate <typename Iterator>\nstruct result_handler_t<Iterator, parsing_policy::drop_result> {\n using policy_t = parsing_policy::drop_result;\n using positive_result_t = parse_result_mapper_t<Iterator, policy_t>;\n\n std::size_t replies_count;\n size_t cumulative_consumption;\n size_t count;\n positive_result_t result;\n\n result_handler_t(std::size_t replies_count_)\n : replies_count{replies_count_},\n cumulative_consumption{0}, count{0}, result{0} {}\n\n void init() {\n \/\/ NO-OP;\n }\n\n bool on_result(positive_result_t &&parse_result) {\n ++count;\n cumulative_consumption += parse_result.consumed;\n return count < replies_count;\n }\n\n void complete_result() {\n result = positive_result_t{cumulative_consumption};\n }\n};\n\ntemplate <typename Iterator>\nstruct result_handler_t<Iterator, parsing_policy::keep_result> {\n using policy_t = parsing_policy::keep_result;\n using positive_result_t = parse_result_mapper_t<Iterator, policy_t>;\n\n std::size_t replies_count;\n size_t cumulative_consumption;\n size_t count;\n positive_result_t result;\n markers::array_holder_t<Iterator> tmp_results;\n\n result_handler_t(std::size_t replies_count_)\n : replies_count{replies_count_}, cumulative_consumption{0}, count{0} {}\n\n void init() { tmp_results.elements.reserve(replies_count); }\n\n bool on_result(positive_result_t &&parse_result) {\n tmp_results.elements.emplace_back(std::move(parse_result.result));\n ++count;\n cumulative_consumption += parse_result.consumed;\n return count < replies_count;\n }\n\n void complete_result() {\n if (replies_count == 1) {\n result = positive_result_t{std::move(tmp_results.elements[0]),\n cumulative_consumption};\n } else {\n result = positive_result_t{std::move(tmp_results),\n cumulative_consumption};\n }\n }\n};\n\ntemplate <typename DynamicBuffer, typename Policy> struct async_read_op_impl {\n DynamicBuffer &rx_buff_;\n std::size_t replies_count_;\n\n async_read_op_impl(DynamicBuffer &rx_buff, std::size_t replies_count)\n : rx_buff_{rx_buff}, replies_count_{replies_count} {}\n using Iterator = typename to_iterator<DynamicBuffer>::iterator_t;\n using ResultHandler = result_handler_t<Iterator, Policy>;\n using positive_result_t = parse_result_mapper_t<Iterator, Policy>;\n\n positive_result_t op(boost::system::error_code &error_code,\n std::size_t \/*bytes_transferred*\/) {\n\n ResultHandler result_handler(replies_count_);\n\n if (!error_code) {\n auto const_buff = rx_buff_.data();\n auto begin = Iterator::begin(const_buff);\n auto end = Iterator::end(const_buff);\n\n result_handler.init();\n\n bool continue_parsing;\n do {\n using boost::get;\n auto parse_result =\n Protocol::parse<Iterator, Policy>(begin, end);\n auto *parse_error = boost::get<protocol_error_t>(&parse_result);\n if (parse_error) {\n error_code = parse_error->code;\n continue_parsing = false;\n } else {\n auto &positive_result =\n get<positive_result_t>(parse_result);\n begin += positive_result.consumed;\n continue_parsing =\n result_handler.on_result(std::move(positive_result));\n }\n } while (continue_parsing);\n\n \/* check again, as protocol error might be met *\/\n if (!error_code) {\n result_handler.complete_result();\n }\n }\n return result_handler.result;\n }\n};\n\ntemplate <typename NextLayer, typename DynamicBuffer, typename ReadCallback,\n typename Policy>\nclass async_read_op {\n NextLayer &stream_;\n DynamicBuffer &rx_buff_;\n std::size_t replies_count_;\n ReadCallback callback_;\n\n public:\n async_read_op(async_read_op &&) = default;\n async_read_op(const async_read_op &) = default;\n\n template <class DeducedHandler>\n async_read_op(DeducedHandler &&deduced_handler, NextLayer &stream,\n DynamicBuffer &rx_buff, std::size_t replies_count)\n : stream_(stream), rx_buff_(rx_buff), replies_count_(replies_count),\n callback_(std::forward<ReadCallback>(deduced_handler)) {}\n\n void operator()(boost::system::error_code, std::size_t bytes_transferred);\n\n friend bool asio_handler_is_continuation(async_read_op *op) {\n using boost::asio::asio_handler_is_continuation;\n return asio_handler_is_continuation(std::addressof(op->callback_));\n }\n\n friend void *asio_handler_allocate(std::size_t size, async_read_op *op) {\n using boost::asio::asio_handler_allocate;\n return asio_handler_allocate(size, std::addressof(op->callback_));\n }\n\n friend void asio_handler_deallocate(void *p, std::size_t size,\n async_read_op *op) {\n using boost::asio::asio_handler_deallocate;\n return asio_handler_deallocate(p, size, std::addressof(op->callback_));\n }\n\n template <class Function>\n friend void asio_handler_invoke(Function &&f, async_read_op *op) {\n using boost::asio::asio_handler_invoke;\n return asio_handler_invoke(f, std::addressof(op->callback_));\n }\n};\n\ntemplate <typename NextLayer, typename DynamicBuffer, typename ReadCallback,\n typename Policy>\nvoid async_read_op<NextLayer, DynamicBuffer, ReadCallback, Policy>::\noperator()(boost::system::error_code error_code,\n std::size_t bytes_transferred) {\n using op_impl = async_read_op_impl<DynamicBuffer, Policy>;\n callback_(\n error_code,\n op_impl(rx_buff_, replies_count_).op(error_code, bytes_transferred));\n}\n\n} \/\/ namespace bredis\n<commit_msg>It should be better<commit_after>\/\/\n\/\/\n\/\/ Copyright (c) 2017, 2019 Ivan Baidakou (basiliscos) (the dot dmol at gmail\n\/\/ dot com)\n\/\/\n\/\/ Distributed under the MIT Software License\n\/\/\n#pragma once\n\n#include \"..\/Protocol.hpp\"\n#include \"..\/Result.hpp\"\n#include <memory>\n#include <utility>\n\n#include <boost\/asio.hpp>\n#include <boost\/variant.hpp>\n\nnamespace bredis {\n\nstruct base_result_visitor_t : public boost::static_visitor<std::size_t> {\n boost::system::error_code &error_code_;\n\n base_result_visitor_t(boost::system::error_code &error_code)\n : error_code_{error_code} {}\n\n std::size_t operator()(const not_enough_data_t &) const { std::abort(); }\n\n std::size_t operator()(const protocol_error_t &value) const {\n error_code_ = value.code;\n return 0;\n }\n};\n\ntemplate <typename Iterator, typename Policy> struct result_visitor_t;\n\ntemplate <typename Iterator>\nstruct result_visitor_t<Iterator, parsing_policy::drop_result>\n : public base_result_visitor_t {\n using base_t = base_result_visitor_t;\n using policy_t = parsing_policy::drop_result;\n using positive_result_t = parse_result_mapper_t<Iterator, policy_t>;\n\n std::size_t replies_count;\n positive_result_t &result;\n size_t cumulative_consumption;\n size_t count;\n\n static positive_result_t construct() { return positive_result_t{0}; }\n\n result_visitor_t(boost::system::error_code &error_code,\n std::size_t replies_count_, positive_result_t &result_)\n : base_t{error_code}, replies_count{replies_count_}, result{result_},\n cumulative_consumption{0}, count{0} {}\n\n void init() {\n \/\/ NO-OP;\n }\n\n using base_t::operator();\n\n size_t operator()(const positive_result_t &parse_result) {\n ++count;\n cumulative_consumption += parse_result.consumed;\n \/\/ return parse_result.consumed;\n return count < replies_count ? parse_result.consumed : 0;\n }\n\n void complete_result() {\n result = positive_result_t{cumulative_consumption};\n }\n};\n\ntemplate <typename Iterator>\nstruct result_visitor_t<Iterator, parsing_policy::keep_result>\n : public base_result_visitor_t {\n using base_t = base_result_visitor_t;\n using policy_t = parsing_policy::keep_result;\n using positive_result_t = parse_result_mapper_t<Iterator, policy_t>;\n\n std::size_t replies_count;\n positive_result_t &result;\n size_t cumulative_consumption;\n size_t count;\n markers::array_holder_t<Iterator> tmp_results;\n\n static positive_result_t construct() { return positive_result_t{}; }\n\n result_visitor_t(boost::system::error_code &error_code,\n std::size_t replies_count_, positive_result_t &result_)\n : base_t{error_code}, replies_count{replies_count_}, result{result_},\n cumulative_consumption{0}, count{0} {}\n\n void init() { tmp_results.elements.reserve(replies_count); }\n\n using base_t::operator();\n\n size_t operator()(const positive_result_t &parse_result) {\n tmp_results.elements.emplace_back(std::move(parse_result.result));\n ++count;\n cumulative_consumption += parse_result.consumed;\n return count < replies_count ? parse_result.consumed : 0;\n }\n\n void complete_result() {\n if (replies_count == 1) {\n result = positive_result_t{std::move(tmp_results.elements[0]),\n cumulative_consumption};\n } else {\n result = positive_result_t{std::move(tmp_results),\n cumulative_consumption};\n }\n }\n};\n\ntemplate <typename DynamicBuffer, typename Policy> struct async_read_op_impl {\n DynamicBuffer &rx_buff_;\n std::size_t replies_count_;\n\n async_read_op_impl(DynamicBuffer &rx_buff, std::size_t replies_count)\n : rx_buff_{rx_buff}, replies_count_{replies_count} {}\n using Iterator = typename to_iterator<DynamicBuffer>::iterator_t;\n using ResultVisitor = result_visitor_t<Iterator, Policy>;\n using positive_result_t = parse_result_mapper_t<Iterator, Policy>;\n\n positive_result_t op(boost::system::error_code &error_code,\n std::size_t \/*bytes_transferred*\/) {\n\n auto result = ResultVisitor::construct();\n\n if (!error_code) {\n auto const_buff = rx_buff_.data();\n auto begin = Iterator::begin(const_buff);\n auto end = Iterator::end(const_buff);\n\n ResultVisitor visitor(error_code, replies_count_, result);\n visitor.init();\n\n std::size_t consumed{0};\n do {\n begin += consumed;\n auto parse_result =\n Protocol::parse<Iterator, Policy>(begin, end);\n consumed = boost::apply_visitor(visitor, parse_result);\n } while (consumed);\n\n \/* check again, as protocol error might be met *\/\n if (!error_code) {\n visitor.complete_result();\n }\n }\n return result;\n }\n};\n\ntemplate <typename NextLayer, typename DynamicBuffer, typename ReadCallback,\n typename Policy>\nclass async_read_op {\n NextLayer &stream_;\n DynamicBuffer &rx_buff_;\n std::size_t replies_count_;\n ReadCallback callback_;\n\n public:\n async_read_op(async_read_op &&) = default;\n async_read_op(const async_read_op &) = default;\n\n template <class DeducedHandler>\n async_read_op(DeducedHandler &&deduced_handler, NextLayer &stream,\n DynamicBuffer &rx_buff, std::size_t replies_count)\n : stream_(stream), rx_buff_(rx_buff), replies_count_(replies_count),\n callback_(std::forward<ReadCallback>(deduced_handler)) {}\n\n void operator()(boost::system::error_code, std::size_t bytes_transferred);\n\n friend bool asio_handler_is_continuation(async_read_op *op) {\n using boost::asio::asio_handler_is_continuation;\n return asio_handler_is_continuation(std::addressof(op->callback_));\n }\n\n friend void *asio_handler_allocate(std::size_t size, async_read_op *op) {\n using boost::asio::asio_handler_allocate;\n return asio_handler_allocate(size, std::addressof(op->callback_));\n }\n\n friend void asio_handler_deallocate(void *p, std::size_t size,\n async_read_op *op) {\n using boost::asio::asio_handler_deallocate;\n return asio_handler_deallocate(p, size, std::addressof(op->callback_));\n }\n\n template <class Function>\n friend void asio_handler_invoke(Function &&f, async_read_op *op) {\n using boost::asio::asio_handler_invoke;\n return asio_handler_invoke(f, std::addressof(op->callback_));\n }\n};\n\ntemplate <typename NextLayer, typename DynamicBuffer, typename ReadCallback,\n typename Policy>\nvoid async_read_op<NextLayer, DynamicBuffer, ReadCallback, Policy>::\noperator()(boost::system::error_code error_code,\n std::size_t bytes_transferred) {\n using op_impl = async_read_op_impl<DynamicBuffer, Policy>;\n callback_(\n error_code,\n op_impl(rx_buff_, replies_count_).op(error_code, bytes_transferred));\n}\n\n} \/\/ namespace bredis\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_ACCESSOR_BUNDLE_HPP__\n#define CMOH_ACCESSOR_BUNDLE_HPP__\n\n\n\/\/ std includes\n#include <type_traits>\n#include <utility>\n\n\/\/ local includes\n#include <cmoh\/selectable_items.hpp>\n#include <cmoh\/utils.hpp>\n\n\nnamespace cmoh {\n\n\n\/**\n * Check whether a type can construct an object from some attributes\n *\n * This checks whether the `SupposedConstructor` features a template with the\n * name `is_initializable_from`. If it does, it evaluates that template with\n * the `PassedAttributes` and presents that result via the static member\n * `value`. Otherwise, `value` is `false`.\n *\/\ntemplate <\n typename SupposedConstructor, \/\/\/< type which _may_ be a constructor type\n typename ...PassedAttributes \/\/\/< attributes available for construction\n>\nstruct is_initializable_from {\nprivate:\n \/**\n * Check whether a type can be used to initialize anything\n *\n * This metafunction effectively checks whether a type features a template with\n * the name `is_initializable_from` for which an instantiation with zero\n * parameters exist.\n *\/\n template <\n typename T, \/\/\/< type which may feature the template\n typename = void\n >\n struct has_is_initializable_from : std::false_type {};\n\n \/\/ specialization for types featuring the name\n template <\n typename T\n >\n struct has_is_initializable_from<\n T,\n util::void_t<typename T::template is_initializable_from<>>\n > : std::true_type {};\n\n\n \/**\n * Internal helper for selective evaluation of is_initializable_from\n *\n * Evaluates `T::is_initializable_from<Attributes...>` only if `flag` is\n * `true`.\n *\/\n template <\n typename T, \/\/\/< type featuring `is_initializable_from`\n bool flag, \/\/\/< flag controlling the evaluation\n typename ...Attributes \/\/\/< attributes to pass as template parameters\n >\n struct helper : std::false_type {};\n\n \/\/ specialization for evaluating the template\n template <\n typename T,\n typename ...Attributes\n >\n struct helper<T, true, Attributes...> :\n T::template is_initializable_from<Attributes...> {};\n\npublic:\n static constexpr bool value = helper<\n SupposedConstructor,\n has_is_initializable_from<SupposedConstructor>::value,\n PassedAttributes...\n >::value;\n};\n\n\n\/**\n * Check whether an accessor accesses a specific attribute\n *\n * This checks whether the accessor provided features a type `attribute`\n * identical to the attribute provided.\n *\/\ntemplate <\n typename Accessor, \/\/\/< accessor to test for the attribute\n typename Attribute, \/\/\/< attribute to be accessed\n typename = void\n>\nstruct accesses_attribute : std::false_type {};\n\n\/\/ Specialization for accessors featuring a type `attr`\ntemplate <\n typename Accessor,\n typename Attribute\n>\nstruct accesses_attribute<\n Accessor,\n Attribute,\n util::void_t<typename Accessor::attribute>\n> : std::is_same<Attribute, typename Accessor::attribute> {};\n\n\n\/**\n * Accessor bundle\n *\n * Instantiations of this template bundle accessors and make them conveniently\n * accessible as a group, posing as an abstraction layer.\n *\n * TODO: further explanation\n *\n * Users are discouraged from constructing accessor bundles directly. Use\n * `bundle()` instread as a factory.\n *\/\ntemplate <\n typename ...Accessors\n>\nstruct accessor_bundle {\n typedef\n typename util::common_type<typename Accessors::object_type...>::type\n object_type;\n\n\n accessor_bundle(Accessors... accessors) :\n _accessors(std::forward<Accessors>(accessors)...) {}\n accessor_bundle(accessor_bundle const&) = default;\n accessor_bundle(accessor_bundle&&) = default;\n accessor_bundle() = delete;\n\n\n \/**\n * Set the value of a specific attribute on an object\n *\/\n template <\n typename ...Attributes \/\/\/< attributes from which to construct an object\n >\n object_type\n create(\n typename Attributes::type&&... values \/\/\/< value to set\n ) const {\n auto factory = _accessors.\n template get<is_initializable_from<Accessors, Attributes...>...>();\n\n \/\/ construct the object itself\n auto retval{factory.template create<Attributes...>(\n std::forward<typename Attributes::type>(values)...\n )};\n\n initialize_if_unused<decltype(factory), Attributes...>(\n retval,\n std::forward<typename Attributes::type>(values)...\n );\n\n return retval;\n }\n\n\n \/**\n * Get the value of a specific attribute from an object\n *\n * \\returns the value of the attribute\n *\/\n template <\n typename Attribute \/\/\/< attribute to get\n >\n typename Attribute::type\n get(\n object_type const& obj \/\/\/< object from which to get the value\n ) const {\n return _accessors.\n template get<accesses_attribute<Accessors, Attribute>...>().\n get(obj);\n }\n\n \/**\n * Set the value of a specific attribute on an object\n *\/\n template <\n typename Attribute \/\/\/< attribute to set\n >\n void\n set(\n object_type& obj, \/\/\/< object on which to set the attribute\n typename Attribute::type&& value \/\/\/< value to set\n ) const {\n _accessors.\n template get<accesses_attribute<Accessors, Attribute>...>().\n set(obj, std::forward<typename Attribute::type>(value));\n }\n\n\nprivate:\n \/**\n * Initialize attributes which are not used by a specific constructor\n *\/\n template <\n typename Constructor, \/\/\/< constructor to consider\n typename Attribute0, \/\/\/< first of the attributes\n typename ...Attributes \/\/\/< rest of the attributes\n >\n void\n initialize_if_unused(\n object_type& obj, \/\/\/< object on which to set the attributes' values\n typename Attribute0::type&& value0, \/\/\/< first of the values\n typename Attributes::type&&... values \/\/\/< rest of the values\n ) const {\n initialize_single_if_unused<Constructor, Attribute0>(\n obj,\n std::forward<typename Attribute0::type>(value0)\n );\n\n \/\/ recurse\n initialize_if_unused<Constructor, Attributes...>(\n obj,\n std::forward<typename Attributes::type>(values)...\n );\n }\n\n \/\/ overload for an empty list of attributes\n template <\n typename Constructor\n >\n void\n initialize_if_unused(\n object_type& obj\n ) const {}\n\n\n \/**\n * Initialize a single attribute if it is not used by a specific constructor\n *\/\n template <\n typename Constructor, \/\/\/< constructor to consider\n typename Attribute \/\/\/< attribute to set\n >\n typename std::enable_if<!Constructor::template uses<Attribute>::value>::type\n initialize_single_if_unused(\n object_type& obj, \/\/\/< object on which to set the attribute's value\n typename Attribute::type&& value \/\/\/< value to set\n ) const {\n \/\/ TODO: static assertion for unsettable attributes\n set<Attribute>(obj, std::forward<typename Attribute::type>(value));\n }\n\n \/\/ overload for attributes which are used by the constructor specified\n template <\n typename Constructor,\n typename Attribute\n >\n typename std::enable_if<Constructor::template uses<Attribute>::value>::type\n initialize_single_if_unused(\n object_type& obj,\n typename Attribute::type&& value\n ) const {}\n\n\n selectable_items<Accessors...> _accessors;\n};\n\n\n\/**\n * Construct an accessor bundle from a bunch of accessors\n *\n * \\returns an accessor bundle holding all the accessors supplied\n *\/\ntemplate <\n typename ...Accessors\n>\nconstexpr\nconst\naccessor_bundle<Accessors...>\nbundle(\n Accessors&&... accessors \/\/\/< accessors to bundle\n) {\n return accessor_bundle<Accessors...>(std::forward<Accessors>(accessors)...);\n}\n\n\n}\n\n\n#endif\n<commit_msg>Seperate declaration of _accessors from the diefinition of its 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_ACCESSOR_BUNDLE_HPP__\n#define CMOH_ACCESSOR_BUNDLE_HPP__\n\n\n\/\/ std includes\n#include <type_traits>\n#include <utility>\n\n\/\/ local includes\n#include <cmoh\/selectable_items.hpp>\n#include <cmoh\/utils.hpp>\n\n\nnamespace cmoh {\n\n\n\/**\n * Check whether a type can construct an object from some attributes\n *\n * This checks whether the `SupposedConstructor` features a template with the\n * name `is_initializable_from`. If it does, it evaluates that template with\n * the `PassedAttributes` and presents that result via the static member\n * `value`. Otherwise, `value` is `false`.\n *\/\ntemplate <\n typename SupposedConstructor, \/\/\/< type which _may_ be a constructor type\n typename ...PassedAttributes \/\/\/< attributes available for construction\n>\nstruct is_initializable_from {\nprivate:\n \/**\n * Check whether a type can be used to initialize anything\n *\n * This metafunction effectively checks whether a type features a template with\n * the name `is_initializable_from` for which an instantiation with zero\n * parameters exist.\n *\/\n template <\n typename T, \/\/\/< type which may feature the template\n typename = void\n >\n struct has_is_initializable_from : std::false_type {};\n\n \/\/ specialization for types featuring the name\n template <\n typename T\n >\n struct has_is_initializable_from<\n T,\n util::void_t<typename T::template is_initializable_from<>>\n > : std::true_type {};\n\n\n \/**\n * Internal helper for selective evaluation of is_initializable_from\n *\n * Evaluates `T::is_initializable_from<Attributes...>` only if `flag` is\n * `true`.\n *\/\n template <\n typename T, \/\/\/< type featuring `is_initializable_from`\n bool flag, \/\/\/< flag controlling the evaluation\n typename ...Attributes \/\/\/< attributes to pass as template parameters\n >\n struct helper : std::false_type {};\n\n \/\/ specialization for evaluating the template\n template <\n typename T,\n typename ...Attributes\n >\n struct helper<T, true, Attributes...> :\n T::template is_initializable_from<Attributes...> {};\n\npublic:\n static constexpr bool value = helper<\n SupposedConstructor,\n has_is_initializable_from<SupposedConstructor>::value,\n PassedAttributes...\n >::value;\n};\n\n\n\/**\n * Check whether an accessor accesses a specific attribute\n *\n * This checks whether the accessor provided features a type `attribute`\n * identical to the attribute provided.\n *\/\ntemplate <\n typename Accessor, \/\/\/< accessor to test for the attribute\n typename Attribute, \/\/\/< attribute to be accessed\n typename = void\n>\nstruct accesses_attribute : std::false_type {};\n\n\/\/ Specialization for accessors featuring a type `attr`\ntemplate <\n typename Accessor,\n typename Attribute\n>\nstruct accesses_attribute<\n Accessor,\n Attribute,\n util::void_t<typename Accessor::attribute>\n> : std::is_same<Attribute, typename Accessor::attribute> {};\n\n\n\/**\n * Accessor bundle\n *\n * Instantiations of this template bundle accessors and make them conveniently\n * accessible as a group, posing as an abstraction layer.\n *\n * TODO: further explanation\n *\n * Users are discouraged from constructing accessor bundles directly. Use\n * `bundle()` instread as a factory.\n *\/\ntemplate <\n typename ...Accessors\n>\nstruct accessor_bundle {\nprivate:\n typedef selectable_items<Accessors...> accessors;\n\npublic:\n typedef\n typename util::common_type<typename Accessors::object_type...>::type\n object_type;\n\n\n accessor_bundle(Accessors... accessors) :\n _accessors(std::forward<Accessors>(accessors)...) {}\n accessor_bundle(accessor_bundle const&) = default;\n accessor_bundle(accessor_bundle&&) = default;\n accessor_bundle() = delete;\n\n\n \/**\n * Set the value of a specific attribute on an object\n *\/\n template <\n typename ...Attributes \/\/\/< attributes from which to construct an object\n >\n object_type\n create(\n typename Attributes::type&&... values \/\/\/< value to set\n ) const {\n auto factory = _accessors.\n template get<is_initializable_from<Accessors, Attributes...>...>();\n\n \/\/ construct the object itself\n auto retval{factory.template create<Attributes...>(\n std::forward<typename Attributes::type>(values)...\n )};\n\n initialize_if_unused<decltype(factory), Attributes...>(\n retval,\n std::forward<typename Attributes::type>(values)...\n );\n\n return retval;\n }\n\n\n \/**\n * Get the value of a specific attribute from an object\n *\n * \\returns the value of the attribute\n *\/\n template <\n typename Attribute \/\/\/< attribute to get\n >\n typename Attribute::type\n get(\n object_type const& obj \/\/\/< object from which to get the value\n ) const {\n return _accessors.\n template get<accesses_attribute<Accessors, Attribute>...>().\n get(obj);\n }\n\n \/**\n * Set the value of a specific attribute on an object\n *\/\n template <\n typename Attribute \/\/\/< attribute to set\n >\n void\n set(\n object_type& obj, \/\/\/< object on which to set the attribute\n typename Attribute::type&& value \/\/\/< value to set\n ) const {\n _accessors.\n template get<accesses_attribute<Accessors, Attribute>...>().\n set(obj, std::forward<typename Attribute::type>(value));\n }\n\n\nprivate:\n \/**\n * Initialize attributes which are not used by a specific constructor\n *\/\n template <\n typename Constructor, \/\/\/< constructor to consider\n typename Attribute0, \/\/\/< first of the attributes\n typename ...Attributes \/\/\/< rest of the attributes\n >\n void\n initialize_if_unused(\n object_type& obj, \/\/\/< object on which to set the attributes' values\n typename Attribute0::type&& value0, \/\/\/< first of the values\n typename Attributes::type&&... values \/\/\/< rest of the values\n ) const {\n initialize_single_if_unused<Constructor, Attribute0>(\n obj,\n std::forward<typename Attribute0::type>(value0)\n );\n\n \/\/ recurse\n initialize_if_unused<Constructor, Attributes...>(\n obj,\n std::forward<typename Attributes::type>(values)...\n );\n }\n\n \/\/ overload for an empty list of attributes\n template <\n typename Constructor\n >\n void\n initialize_if_unused(\n object_type& obj\n ) const {}\n\n\n \/**\n * Initialize a single attribute if it is not used by a specific constructor\n *\/\n template <\n typename Constructor, \/\/\/< constructor to consider\n typename Attribute \/\/\/< attribute to set\n >\n typename std::enable_if<!Constructor::template uses<Attribute>::value>::type\n initialize_single_if_unused(\n object_type& obj, \/\/\/< object on which to set the attribute's value\n typename Attribute::type&& value \/\/\/< value to set\n ) const {\n \/\/ TODO: static assertion for unsettable attributes\n set<Attribute>(obj, std::forward<typename Attribute::type>(value));\n }\n\n \/\/ overload for attributes which are used by the constructor specified\n template <\n typename Constructor,\n typename Attribute\n >\n typename std::enable_if<Constructor::template uses<Attribute>::value>::type\n initialize_single_if_unused(\n object_type& obj,\n typename Attribute::type&& value\n ) const {}\n\n\n accessors _accessors;\n};\n\n\n\/**\n * Construct an accessor bundle from a bunch of accessors\n *\n * \\returns an accessor bundle holding all the accessors supplied\n *\/\ntemplate <\n typename ...Accessors\n>\nconstexpr\nconst\naccessor_bundle<Accessors...>\nbundle(\n Accessors&&... accessors \/\/\/< accessors to bundle\n) {\n return accessor_bundle<Accessors...>(std::forward<Accessors>(accessors)...);\n}\n\n\n}\n\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 \"chrome\/gpu\/gpu_video_decoder.h\"\n\n#include \"base\/command_line.h\"\n#include \"chrome\/common\/child_thread.h\"\n#include \"chrome\/common\/gpu_messages.h\"\n#include \"chrome\/gpu\/gpu_channel.h\"\n#include \"chrome\/gpu\/media\/fake_gl_video_decode_engine.h\"\n#include \"chrome\/gpu\/media\/fake_gl_video_device.h\"\n#include \"media\/base\/data_buffer.h\"\n#include \"media\/base\/media_switches.h\"\n#include \"media\/base\/video_frame.h\"\n\n#if defined(OS_WIN)\n#include \"chrome\/gpu\/media\/mft_angle_video_device.h\"\n#include \"media\/video\/mft_h264_decode_engine.h\"\n#include <d3d9.h>\n#endif\n\nvoid GpuVideoDecoder::OnChannelConnected(int32 peer_pid) {\n}\n\nvoid GpuVideoDecoder::OnChannelError() {\n}\n\nvoid GpuVideoDecoder::OnMessageReceived(const IPC::Message& msg) {\n IPC_BEGIN_MESSAGE_MAP(GpuVideoDecoder, msg)\n IPC_MESSAGE_HANDLER(GpuVideoDecoderMsg_Initialize,\n OnInitialize)\n IPC_MESSAGE_HANDLER(GpuVideoDecoderMsg_Destroy,\n OnUninitialize)\n IPC_MESSAGE_HANDLER(GpuVideoDecoderMsg_Flush,\n OnFlush)\n IPC_MESSAGE_HANDLER(GpuVideoDecoderMsg_Preroll,\n OnPreroll)\n IPC_MESSAGE_HANDLER(GpuVideoDecoderMsg_EmptyThisBuffer,\n OnEmptyThisBuffer)\n IPC_MESSAGE_HANDLER(GpuVideoDecoderMsg_ProduceVideoFrame,\n OnProduceVideoFrame)\n IPC_MESSAGE_HANDLER(GpuVideoDecoderMsg_VideoFrameAllocated,\n OnVideoFrameAllocated)\n IPC_MESSAGE_UNHANDLED_ERROR()\n IPC_END_MESSAGE_MAP()\n}\n\nbool GpuVideoDecoder::CreateInputTransferBuffer(\n uint32 size,\n base::SharedMemoryHandle* handle) {\n input_transfer_buffer_.reset(new base::SharedMemory);\n if (!input_transfer_buffer_.get())\n return false;\n\n if (!input_transfer_buffer_->Create(std::string(), false, false, size))\n return false;\n\n if (!input_transfer_buffer_->Map(size))\n return false;\n\n if (!input_transfer_buffer_->ShareToProcess(renderer_handle_, handle))\n return false;\n\n return true;\n}\n\nvoid GpuVideoDecoder::OnInitializeComplete(const VideoCodecInfo& info) {\n info_ = info;\n GpuVideoDecoderInitDoneParam param;\n param.success = false;\n param.input_buffer_handle = base::SharedMemory::NULLHandle();\n\n if (!info.success) {\n SendInitializeDone(param);\n return;\n }\n\n \/\/ TODO(jiesun): Check the assumption of input size < original size.\n param.input_buffer_size = config_.width * config_.height * 3 \/ 2;\n if (!CreateInputTransferBuffer(param.input_buffer_size,\n ¶m.input_buffer_handle)) {\n SendInitializeDone(param);\n return;\n }\n\n param.success = true;\n SendInitializeDone(param);\n}\n\nvoid GpuVideoDecoder::OnUninitializeComplete() {\n SendUninitializeDone();\n}\n\nvoid GpuVideoDecoder::OnFlushComplete() {\n SendFlushDone();\n}\n\nvoid GpuVideoDecoder::OnSeekComplete() {\n SendPrerollDone();\n}\n\nvoid GpuVideoDecoder::OnError() {\n NOTIMPLEMENTED();\n}\n\nvoid GpuVideoDecoder::OnFormatChange(VideoStreamInfo stream_info) {\n NOTIMPLEMENTED();\n}\n\nvoid GpuVideoDecoder::ProduceVideoSample(scoped_refptr<Buffer> buffer) {\n SendEmptyBufferDone();\n}\n\nvoid GpuVideoDecoder::ConsumeVideoFrame(scoped_refptr<VideoFrame> frame) {\n if (frame->IsEndOfStream()) {\n SendConsumeVideoFrame(kGpuVideoInvalidFrameId, 0, 0, kGpuVideoEndOfStream);\n return;\n }\n\n int32 frame_id = kGpuVideoInvalidFrameId;\n for (VideoFrameMap::iterator i = video_frame_map_.begin();\n i != video_frame_map_.end(); ++i) {\n if (i->second == frame) {\n frame_id = i->first;\n break;\n }\n }\n DCHECK_NE(-1, frame_id) << \"VideoFrame not recognized\";\n\n SendConsumeVideoFrame(frame_id, frame->GetTimestamp().InMicroseconds(),\n frame->GetDuration().InMicroseconds(), 0);\n}\n\nvoid* GpuVideoDecoder::GetDevice() {\n bool ret = gles2_decoder_->MakeCurrent();\n DCHECK(ret) << \"Failed to switch context\";\n\n \/\/ Simply delegate the method call to GpuVideoDevice.\n return video_device_->GetDevice();\n}\n\nvoid GpuVideoDecoder::AllocateVideoFrames(\n int n, size_t width, size_t height, media::VideoFrame::Format format,\n std::vector<scoped_refptr<media::VideoFrame> >* frames, Task* task) {\n \/\/ Since the communication between Renderer and GPU process is by GL textures.\n \/\/ We need to obtain a set of GL textures by sending IPC commands to the\n \/\/ Renderer process. The recipient of these commands will be IpcVideoDecoder.\n \/\/\n \/\/ After IpcVideoDecoder replied with a set of textures. We'll assign these\n \/\/ textures to GpuVideoDevice. They will be used to generate platform\n \/\/ specific VideoFrames objects that are used by VideoDecodeEngine.\n \/\/\n \/\/ After GL textures are assigned we'll proceed with allocation the\n \/\/ VideoFrames. GpuVideoDevice::CreateVideoFramesFromGlTextures() will be\n \/\/ called.\n \/\/\n \/\/ When GpuVideoDevice replied with a set of VideoFrames we'll give\n \/\/ that to VideoDecodeEngine and the cycle of video frame allocation is done.\n \/\/\n \/\/ Note that this method is called when there's no video frames allocated or\n \/\/ they were all released.\n DCHECK(video_frame_map_.empty());\n\n \/\/ Save the parameters for allocation.\n pending_allocation_.reset(new PendingAllocation());\n pending_allocation_->n = n;\n pending_allocation_->width = width;\n pending_allocation_->height = height;\n pending_allocation_->format = format;\n pending_allocation_->frames = frames;\n pending_allocation_->task = task;\n SendAllocateVideoFrames(n, width, height, format);\n}\n\nvoid GpuVideoDecoder::ReleaseAllVideoFrames() {\n \/\/ This method will first call to GpuVideoDevice to release all the resource\n \/\/ associated with a VideoFrame.\n \/\/\n \/\/ And then we'll call GpuVideoDevice::ReleaseVideoFrame() to remove the set\n \/\/ of Gl textures associated with the context.\n \/\/\n \/\/ And finally we'll send IPC commands to IpcVideoDecoder to destroy all\n \/\/ GL textures generated.\n bool ret = gles2_decoder_->MakeCurrent();\n DCHECK(ret) << \"Failed to switch context\";\n\n for (VideoFrameMap::iterator i = video_frame_map_.begin();\n i != video_frame_map_.end(); ++i) {\n video_device_->ReleaseVideoFrame(i->second);\n }\n video_frame_map_.clear();\n SendReleaseAllVideoFrames();\n}\n\nvoid GpuVideoDecoder::UploadToVideoFrame(void* buffer,\n scoped_refptr<media::VideoFrame> frame,\n Task* task) {\n \/\/ This method is called by VideoDecodeEngine to upload a buffer to a\n \/\/ VideoFrame. We should just delegate this to GpuVideoDevice which contains\n \/\/ the actual implementation.\n bool ret = gles2_decoder_->MakeCurrent();\n DCHECK(ret) << \"Failed to switch context\";\n\n \/\/ Actually doing the upload on the main thread.\n ret = video_device_->UploadToVideoFrame(buffer, frame);\n DCHECK(ret) << \"Failed to upload video content to a VideoFrame.\";\n task->Run();\n delete task;\n}\n\nvoid GpuVideoDecoder::Destroy(Task* task) {\n \/\/ TODO(hclam): I still need to think what I should do here.\n}\n\nvoid GpuVideoDecoder::SetVideoDecodeEngine(media::VideoDecodeEngine* engine) {\n decode_engine_.reset(engine);\n}\n\nvoid GpuVideoDecoder::SetGpuVideoDevice(GpuVideoDevice* device) {\n video_device_.reset(device);\n}\n\nGpuVideoDecoder::GpuVideoDecoder(\n MessageLoop* message_loop,\n int32 decoder_host_id,\n IPC::Message::Sender* sender,\n base::ProcessHandle handle,\n gpu::gles2::GLES2Decoder* decoder)\n : message_loop_(message_loop),\n decoder_host_id_(decoder_host_id),\n sender_(sender),\n renderer_handle_(handle),\n gles2_decoder_(decoder) {\n memset(&config_, 0, sizeof(config_));\n memset(&info_, 0, sizeof(info_));\n\n \/\/ TODO(jiesun): find a better way to determine which VideoDecodeEngine\n \/\/ to return on current platform.\n#if defined(OS_WIN)\n const CommandLine& command_line = *CommandLine::ForCurrentProcess();\n if (command_line.HasSwitch(switches::kEnableAcceleratedDecoding)) {\n decode_engine_.reset(new media::MftH264DecodeEngine(true));\n video_device_.reset(new MftAngleVideoDevice());\n }\n#else\n decode_engine_.reset(new FakeGlVideoDecodeEngine());\n video_device_.reset(new FakeGlVideoDevice());\n#endif\n}\n\nvoid GpuVideoDecoder::OnInitialize(const GpuVideoDecoderInitParam& param) {\n \/\/ TODO(jiesun): codec id should come from |param|.\n config_.codec = media::kCodecH264;\n config_.width = param.width;\n config_.height = param.height;\n config_.opaque_context = NULL;\n decode_engine_->Initialize(message_loop_, this, this, config_);\n}\n\nvoid GpuVideoDecoder::OnUninitialize() {\n decode_engine_->Uninitialize();\n}\n\nvoid GpuVideoDecoder::OnFlush() {\n decode_engine_->Flush();\n}\n\nvoid GpuVideoDecoder::OnPreroll() {\n decode_engine_->Seek();\n}\n\nvoid GpuVideoDecoder::OnEmptyThisBuffer(\n const GpuVideoDecoderInputBufferParam& buffer) {\n DCHECK(input_transfer_buffer_->memory());\n\n uint8* src = static_cast<uint8*>(input_transfer_buffer_->memory());\n\n scoped_refptr<Buffer> input_buffer;\n uint8* dst = buffer.size ? new uint8[buffer.size] : NULL;\n input_buffer = new media::DataBuffer(dst, buffer.size);\n memcpy(dst, src, buffer.size);\n SendEmptyBufferACK();\n\n \/\/ Delegate the method call to VideoDecodeEngine.\n decode_engine_->ConsumeVideoSample(input_buffer);\n}\n\nvoid GpuVideoDecoder::OnProduceVideoFrame(int32 frame_id) {\n VideoFrameMap::iterator i = video_frame_map_.find(frame_id);\n if (i == video_frame_map_.end()) {\n NOTREACHED() << \"Received a request of unknown frame ID.\";\n }\n\n \/\/ Delegate the method call to VideoDecodeEngine.\n decode_engine_->ProduceVideoFrame(i->second);\n}\n\nvoid GpuVideoDecoder::OnVideoFrameAllocated(int32 frame_id,\n std::vector<uint32> textures) {\n bool ret = gles2_decoder_->MakeCurrent();\n DCHECK(ret) << \"Failed to switch context\";\n\n \/\/ This method is called in response to a video frame allocation request sent\n \/\/ to the Renderer process.\n \/\/ We should use the textures to generate a VideoFrame by using\n \/\/ GpuVideoDevice. The VideoFrame created is added to the internal map.\n \/\/ If we have generated enough VideoFrame, we call |allocation_callack_| to\n \/\/ complete the allocation process.\n for (size_t i = 0; i < textures.size(); ++i) {\n media::VideoFrame::GlTexture gl_texture;\n \/\/ Translate the client texture id to service texture id.\n ret = gles2_decoder_->GetServiceTextureId(textures[i], &gl_texture);\n DCHECK(ret) << \"Cannot translate client texture ID to service ID\";\n textures[i] = gl_texture;\n }\n\n \/\/ Use GpuVideoDevice to allocate VideoFrame objects.\n scoped_refptr<media::VideoFrame> frame;\n\n ret = video_device_->CreateVideoFrameFromGlTextures(\n pending_allocation_->width, pending_allocation_->height,\n pending_allocation_->format, textures, &frame);\n\n DCHECK(ret) << \"Failed to allocation VideoFrame from GL textures)\";\n pending_allocation_->frames->push_back(frame);\n video_frame_map_.insert(std::make_pair(frame_id, frame));\n\n if (video_frame_map_.size() == pending_allocation_->n) {\n pending_allocation_->task->Run();\n delete pending_allocation_->task;\n pending_allocation_.reset();\n }\n}\n\nvoid GpuVideoDecoder::SendInitializeDone(\n const GpuVideoDecoderInitDoneParam& param) {\n if (!sender_->Send(\n new GpuVideoDecoderHostMsg_InitializeACK(decoder_host_id(), param))) {\n LOG(ERROR) << \"GpuVideoDecoderMsg_InitializeACK failed\";\n }\n}\n\nvoid GpuVideoDecoder::SendUninitializeDone() {\n if (!sender_->Send(\n new GpuVideoDecoderHostMsg_DestroyACK(decoder_host_id()))) {\n LOG(ERROR) << \"GpuVideoDecoderMsg_DestroyACK failed\";\n }\n}\n\nvoid GpuVideoDecoder::SendFlushDone() {\n if (!sender_->Send(new GpuVideoDecoderHostMsg_FlushACK(decoder_host_id()))) {\n LOG(ERROR) << \"GpuVideoDecoderMsg_FlushACK failed\";\n }\n}\n\nvoid GpuVideoDecoder::SendPrerollDone() {\n if (!sender_->Send(new GpuVideoDecoderHostMsg_PrerollDone(\n decoder_host_id()))) {\n LOG(ERROR) << \"GpuVideoDecoderMsg_PrerollDone failed\";\n }\n}\n\nvoid GpuVideoDecoder::SendEmptyBufferDone() {\n if (!sender_->Send(\n new GpuVideoDecoderHostMsg_EmptyThisBufferDone(decoder_host_id()))) {\n LOG(ERROR) << \"GpuVideoDecoderMsg_EmptyThisBufferDone failed\";\n }\n}\n\nvoid GpuVideoDecoder::SendEmptyBufferACK() {\n if (!sender_->Send(\n new GpuVideoDecoderHostMsg_EmptyThisBufferACK(decoder_host_id()))) {\n LOG(ERROR) << \"GpuVideoDecoderMsg_EmptyThisBufferACK failed\";\n }\n}\n\nvoid GpuVideoDecoder::SendConsumeVideoFrame(\n int32 frame_id, int64 timestamp, int64 duration, int32 flags) {\n if (!sender_->Send(\n new GpuVideoDecoderHostMsg_ConsumeVideoFrame(\n decoder_host_id(), frame_id, timestamp, duration, flags))) {\n LOG(ERROR) << \"GpuVideoDecodeHostMsg_ConsumeVideoFrame failed.\";\n }\n}\n\nvoid GpuVideoDecoder::SendAllocateVideoFrames(\n int n, size_t width, size_t height, media::VideoFrame::Format format) {\n if (!sender_->Send(\n new GpuVideoDecoderHostMsg_AllocateVideoFrames(\n decoder_host_id(), n, width, height,\n static_cast<int32>(format)))) {\n LOG(ERROR) << \"GpuVideoDecoderMsg_AllocateVideoFrames failed\";\n }\n}\n\nvoid GpuVideoDecoder::SendReleaseAllVideoFrames() {\n if (!sender_->Send(\n new GpuVideoDecoderHostMsg_ReleaseAllVideoFrames(\n decoder_host_id()))) {\n LOG(ERROR) << \"GpuVideoDecoderMsg_ReleaseAllVideoFrames failed\";\n }\n}\n<commit_msg>Remove the usage of MFT related objects so they don't get linked.<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\/gpu\/gpu_video_decoder.h\"\n\n#include \"base\/command_line.h\"\n#include \"chrome\/common\/child_thread.h\"\n#include \"chrome\/common\/gpu_messages.h\"\n#include \"chrome\/gpu\/gpu_channel.h\"\n#include \"chrome\/gpu\/media\/fake_gl_video_decode_engine.h\"\n#include \"chrome\/gpu\/media\/fake_gl_video_device.h\"\n#include \"media\/base\/data_buffer.h\"\n#include \"media\/base\/media_switches.h\"\n#include \"media\/base\/video_frame.h\"\n\n#if defined(OS_WIN)\n#include \"chrome\/gpu\/media\/mft_angle_video_device.h\"\n#include \"media\/video\/mft_h264_decode_engine.h\"\n#include <d3d9.h>\n#endif\n\nvoid GpuVideoDecoder::OnChannelConnected(int32 peer_pid) {\n}\n\nvoid GpuVideoDecoder::OnChannelError() {\n}\n\nvoid GpuVideoDecoder::OnMessageReceived(const IPC::Message& msg) {\n IPC_BEGIN_MESSAGE_MAP(GpuVideoDecoder, msg)\n IPC_MESSAGE_HANDLER(GpuVideoDecoderMsg_Initialize,\n OnInitialize)\n IPC_MESSAGE_HANDLER(GpuVideoDecoderMsg_Destroy,\n OnUninitialize)\n IPC_MESSAGE_HANDLER(GpuVideoDecoderMsg_Flush,\n OnFlush)\n IPC_MESSAGE_HANDLER(GpuVideoDecoderMsg_Preroll,\n OnPreroll)\n IPC_MESSAGE_HANDLER(GpuVideoDecoderMsg_EmptyThisBuffer,\n OnEmptyThisBuffer)\n IPC_MESSAGE_HANDLER(GpuVideoDecoderMsg_ProduceVideoFrame,\n OnProduceVideoFrame)\n IPC_MESSAGE_HANDLER(GpuVideoDecoderMsg_VideoFrameAllocated,\n OnVideoFrameAllocated)\n IPC_MESSAGE_UNHANDLED_ERROR()\n IPC_END_MESSAGE_MAP()\n}\n\nbool GpuVideoDecoder::CreateInputTransferBuffer(\n uint32 size,\n base::SharedMemoryHandle* handle) {\n input_transfer_buffer_.reset(new base::SharedMemory);\n if (!input_transfer_buffer_.get())\n return false;\n\n if (!input_transfer_buffer_->Create(std::string(), false, false, size))\n return false;\n\n if (!input_transfer_buffer_->Map(size))\n return false;\n\n if (!input_transfer_buffer_->ShareToProcess(renderer_handle_, handle))\n return false;\n\n return true;\n}\n\nvoid GpuVideoDecoder::OnInitializeComplete(const VideoCodecInfo& info) {\n info_ = info;\n GpuVideoDecoderInitDoneParam param;\n param.success = false;\n param.input_buffer_handle = base::SharedMemory::NULLHandle();\n\n if (!info.success) {\n SendInitializeDone(param);\n return;\n }\n\n \/\/ TODO(jiesun): Check the assumption of input size < original size.\n param.input_buffer_size = config_.width * config_.height * 3 \/ 2;\n if (!CreateInputTransferBuffer(param.input_buffer_size,\n ¶m.input_buffer_handle)) {\n SendInitializeDone(param);\n return;\n }\n\n param.success = true;\n SendInitializeDone(param);\n}\n\nvoid GpuVideoDecoder::OnUninitializeComplete() {\n SendUninitializeDone();\n}\n\nvoid GpuVideoDecoder::OnFlushComplete() {\n SendFlushDone();\n}\n\nvoid GpuVideoDecoder::OnSeekComplete() {\n SendPrerollDone();\n}\n\nvoid GpuVideoDecoder::OnError() {\n NOTIMPLEMENTED();\n}\n\nvoid GpuVideoDecoder::OnFormatChange(VideoStreamInfo stream_info) {\n NOTIMPLEMENTED();\n}\n\nvoid GpuVideoDecoder::ProduceVideoSample(scoped_refptr<Buffer> buffer) {\n SendEmptyBufferDone();\n}\n\nvoid GpuVideoDecoder::ConsumeVideoFrame(scoped_refptr<VideoFrame> frame) {\n if (frame->IsEndOfStream()) {\n SendConsumeVideoFrame(kGpuVideoInvalidFrameId, 0, 0, kGpuVideoEndOfStream);\n return;\n }\n\n int32 frame_id = kGpuVideoInvalidFrameId;\n for (VideoFrameMap::iterator i = video_frame_map_.begin();\n i != video_frame_map_.end(); ++i) {\n if (i->second == frame) {\n frame_id = i->first;\n break;\n }\n }\n DCHECK_NE(-1, frame_id) << \"VideoFrame not recognized\";\n\n SendConsumeVideoFrame(frame_id, frame->GetTimestamp().InMicroseconds(),\n frame->GetDuration().InMicroseconds(), 0);\n}\n\nvoid* GpuVideoDecoder::GetDevice() {\n bool ret = gles2_decoder_->MakeCurrent();\n DCHECK(ret) << \"Failed to switch context\";\n\n \/\/ Simply delegate the method call to GpuVideoDevice.\n return video_device_->GetDevice();\n}\n\nvoid GpuVideoDecoder::AllocateVideoFrames(\n int n, size_t width, size_t height, media::VideoFrame::Format format,\n std::vector<scoped_refptr<media::VideoFrame> >* frames, Task* task) {\n \/\/ Since the communication between Renderer and GPU process is by GL textures.\n \/\/ We need to obtain a set of GL textures by sending IPC commands to the\n \/\/ Renderer process. The recipient of these commands will be IpcVideoDecoder.\n \/\/\n \/\/ After IpcVideoDecoder replied with a set of textures. We'll assign these\n \/\/ textures to GpuVideoDevice. They will be used to generate platform\n \/\/ specific VideoFrames objects that are used by VideoDecodeEngine.\n \/\/\n \/\/ After GL textures are assigned we'll proceed with allocation the\n \/\/ VideoFrames. GpuVideoDevice::CreateVideoFramesFromGlTextures() will be\n \/\/ called.\n \/\/\n \/\/ When GpuVideoDevice replied with a set of VideoFrames we'll give\n \/\/ that to VideoDecodeEngine and the cycle of video frame allocation is done.\n \/\/\n \/\/ Note that this method is called when there's no video frames allocated or\n \/\/ they were all released.\n DCHECK(video_frame_map_.empty());\n\n \/\/ Save the parameters for allocation.\n pending_allocation_.reset(new PendingAllocation());\n pending_allocation_->n = n;\n pending_allocation_->width = width;\n pending_allocation_->height = height;\n pending_allocation_->format = format;\n pending_allocation_->frames = frames;\n pending_allocation_->task = task;\n SendAllocateVideoFrames(n, width, height, format);\n}\n\nvoid GpuVideoDecoder::ReleaseAllVideoFrames() {\n \/\/ This method will first call to GpuVideoDevice to release all the resource\n \/\/ associated with a VideoFrame.\n \/\/\n \/\/ And then we'll call GpuVideoDevice::ReleaseVideoFrame() to remove the set\n \/\/ of Gl textures associated with the context.\n \/\/\n \/\/ And finally we'll send IPC commands to IpcVideoDecoder to destroy all\n \/\/ GL textures generated.\n bool ret = gles2_decoder_->MakeCurrent();\n DCHECK(ret) << \"Failed to switch context\";\n\n for (VideoFrameMap::iterator i = video_frame_map_.begin();\n i != video_frame_map_.end(); ++i) {\n video_device_->ReleaseVideoFrame(i->second);\n }\n video_frame_map_.clear();\n SendReleaseAllVideoFrames();\n}\n\nvoid GpuVideoDecoder::UploadToVideoFrame(void* buffer,\n scoped_refptr<media::VideoFrame> frame,\n Task* task) {\n \/\/ This method is called by VideoDecodeEngine to upload a buffer to a\n \/\/ VideoFrame. We should just delegate this to GpuVideoDevice which contains\n \/\/ the actual implementation.\n bool ret = gles2_decoder_->MakeCurrent();\n DCHECK(ret) << \"Failed to switch context\";\n\n \/\/ Actually doing the upload on the main thread.\n ret = video_device_->UploadToVideoFrame(buffer, frame);\n DCHECK(ret) << \"Failed to upload video content to a VideoFrame.\";\n task->Run();\n delete task;\n}\n\nvoid GpuVideoDecoder::Destroy(Task* task) {\n \/\/ TODO(hclam): I still need to think what I should do here.\n}\n\nvoid GpuVideoDecoder::SetVideoDecodeEngine(media::VideoDecodeEngine* engine) {\n decode_engine_.reset(engine);\n}\n\nvoid GpuVideoDecoder::SetGpuVideoDevice(GpuVideoDevice* device) {\n video_device_.reset(device);\n}\n\nGpuVideoDecoder::GpuVideoDecoder(\n MessageLoop* message_loop,\n int32 decoder_host_id,\n IPC::Message::Sender* sender,\n base::ProcessHandle handle,\n gpu::gles2::GLES2Decoder* decoder)\n : message_loop_(message_loop),\n decoder_host_id_(decoder_host_id),\n sender_(sender),\n renderer_handle_(handle),\n gles2_decoder_(decoder) {\n memset(&config_, 0, sizeof(config_));\n memset(&info_, 0, sizeof(info_));\n\n \/\/ TODO(jiesun): find a better way to determine which VideoDecodeEngine\n \/\/ to return on current platform.\n#if defined(OS_WIN)\n const CommandLine& command_line = *CommandLine::ForCurrentProcess();\n if (command_line.HasSwitch(switches::kEnableAcceleratedDecoding)) {\n \/\/ The following code are removed so that we don't link them.\n \/\/ TODO(hclam): Enable the code once the crash is solved on XP.\n \/\/ decode_engine_.reset(new media::MftH264DecodeEngine(true));\n \/\/ video_device_.reset(new MftAngleVideoDevice());\n }\n#else\n decode_engine_.reset(new FakeGlVideoDecodeEngine());\n video_device_.reset(new FakeGlVideoDevice());\n#endif\n}\n\nvoid GpuVideoDecoder::OnInitialize(const GpuVideoDecoderInitParam& param) {\n \/\/ TODO(jiesun): codec id should come from |param|.\n config_.codec = media::kCodecH264;\n config_.width = param.width;\n config_.height = param.height;\n config_.opaque_context = NULL;\n decode_engine_->Initialize(message_loop_, this, this, config_);\n}\n\nvoid GpuVideoDecoder::OnUninitialize() {\n decode_engine_->Uninitialize();\n}\n\nvoid GpuVideoDecoder::OnFlush() {\n decode_engine_->Flush();\n}\n\nvoid GpuVideoDecoder::OnPreroll() {\n decode_engine_->Seek();\n}\n\nvoid GpuVideoDecoder::OnEmptyThisBuffer(\n const GpuVideoDecoderInputBufferParam& buffer) {\n DCHECK(input_transfer_buffer_->memory());\n\n uint8* src = static_cast<uint8*>(input_transfer_buffer_->memory());\n\n scoped_refptr<Buffer> input_buffer;\n uint8* dst = buffer.size ? new uint8[buffer.size] : NULL;\n input_buffer = new media::DataBuffer(dst, buffer.size);\n memcpy(dst, src, buffer.size);\n SendEmptyBufferACK();\n\n \/\/ Delegate the method call to VideoDecodeEngine.\n decode_engine_->ConsumeVideoSample(input_buffer);\n}\n\nvoid GpuVideoDecoder::OnProduceVideoFrame(int32 frame_id) {\n VideoFrameMap::iterator i = video_frame_map_.find(frame_id);\n if (i == video_frame_map_.end()) {\n NOTREACHED() << \"Received a request of unknown frame ID.\";\n }\n\n \/\/ Delegate the method call to VideoDecodeEngine.\n decode_engine_->ProduceVideoFrame(i->second);\n}\n\nvoid GpuVideoDecoder::OnVideoFrameAllocated(int32 frame_id,\n std::vector<uint32> textures) {\n bool ret = gles2_decoder_->MakeCurrent();\n DCHECK(ret) << \"Failed to switch context\";\n\n \/\/ This method is called in response to a video frame allocation request sent\n \/\/ to the Renderer process.\n \/\/ We should use the textures to generate a VideoFrame by using\n \/\/ GpuVideoDevice. The VideoFrame created is added to the internal map.\n \/\/ If we have generated enough VideoFrame, we call |allocation_callack_| to\n \/\/ complete the allocation process.\n for (size_t i = 0; i < textures.size(); ++i) {\n media::VideoFrame::GlTexture gl_texture;\n \/\/ Translate the client texture id to service texture id.\n ret = gles2_decoder_->GetServiceTextureId(textures[i], &gl_texture);\n DCHECK(ret) << \"Cannot translate client texture ID to service ID\";\n textures[i] = gl_texture;\n }\n\n \/\/ Use GpuVideoDevice to allocate VideoFrame objects.\n scoped_refptr<media::VideoFrame> frame;\n\n ret = video_device_->CreateVideoFrameFromGlTextures(\n pending_allocation_->width, pending_allocation_->height,\n pending_allocation_->format, textures, &frame);\n\n DCHECK(ret) << \"Failed to allocation VideoFrame from GL textures)\";\n pending_allocation_->frames->push_back(frame);\n video_frame_map_.insert(std::make_pair(frame_id, frame));\n\n if (video_frame_map_.size() == pending_allocation_->n) {\n pending_allocation_->task->Run();\n delete pending_allocation_->task;\n pending_allocation_.reset();\n }\n}\n\nvoid GpuVideoDecoder::SendInitializeDone(\n const GpuVideoDecoderInitDoneParam& param) {\n if (!sender_->Send(\n new GpuVideoDecoderHostMsg_InitializeACK(decoder_host_id(), param))) {\n LOG(ERROR) << \"GpuVideoDecoderMsg_InitializeACK failed\";\n }\n}\n\nvoid GpuVideoDecoder::SendUninitializeDone() {\n if (!sender_->Send(\n new GpuVideoDecoderHostMsg_DestroyACK(decoder_host_id()))) {\n LOG(ERROR) << \"GpuVideoDecoderMsg_DestroyACK failed\";\n }\n}\n\nvoid GpuVideoDecoder::SendFlushDone() {\n if (!sender_->Send(new GpuVideoDecoderHostMsg_FlushACK(decoder_host_id()))) {\n LOG(ERROR) << \"GpuVideoDecoderMsg_FlushACK failed\";\n }\n}\n\nvoid GpuVideoDecoder::SendPrerollDone() {\n if (!sender_->Send(new GpuVideoDecoderHostMsg_PrerollDone(\n decoder_host_id()))) {\n LOG(ERROR) << \"GpuVideoDecoderMsg_PrerollDone failed\";\n }\n}\n\nvoid GpuVideoDecoder::SendEmptyBufferDone() {\n if (!sender_->Send(\n new GpuVideoDecoderHostMsg_EmptyThisBufferDone(decoder_host_id()))) {\n LOG(ERROR) << \"GpuVideoDecoderMsg_EmptyThisBufferDone failed\";\n }\n}\n\nvoid GpuVideoDecoder::SendEmptyBufferACK() {\n if (!sender_->Send(\n new GpuVideoDecoderHostMsg_EmptyThisBufferACK(decoder_host_id()))) {\n LOG(ERROR) << \"GpuVideoDecoderMsg_EmptyThisBufferACK failed\";\n }\n}\n\nvoid GpuVideoDecoder::SendConsumeVideoFrame(\n int32 frame_id, int64 timestamp, int64 duration, int32 flags) {\n if (!sender_->Send(\n new GpuVideoDecoderHostMsg_ConsumeVideoFrame(\n decoder_host_id(), frame_id, timestamp, duration, flags))) {\n LOG(ERROR) << \"GpuVideoDecodeHostMsg_ConsumeVideoFrame failed.\";\n }\n}\n\nvoid GpuVideoDecoder::SendAllocateVideoFrames(\n int n, size_t width, size_t height, media::VideoFrame::Format format) {\n if (!sender_->Send(\n new GpuVideoDecoderHostMsg_AllocateVideoFrames(\n decoder_host_id(), n, width, height,\n static_cast<int32>(format)))) {\n LOG(ERROR) << \"GpuVideoDecoderMsg_AllocateVideoFrames failed\";\n }\n}\n\nvoid GpuVideoDecoder::SendReleaseAllVideoFrames() {\n if (!sender_->Send(\n new GpuVideoDecoderHostMsg_ReleaseAllVideoFrames(\n decoder_host_id()))) {\n LOG(ERROR) << \"GpuVideoDecoderMsg_ReleaseAllVideoFrames failed\";\n }\n}\n<|endoftext|>"} {"text":"<commit_before><commit_msg>Implement operator<<(std::ostream&, const uno::Any&)<commit_after><|endoftext|>"} {"text":"<commit_before>\/* _______ __ __ __ ______ __ __ _______ __ __ \n * \/ _____\/\\ \/ \/\\ \/ \/\\ \/ \/\\ \/ ____\/\\ \/ \/\\ \/ \/\\ \/ ___ \/\\ \/ |\\\/ \/\\ \n * \/ \/\\____\\\/\/ \/ \/\/ \/ \/\/ \/ \/\/ \/\\___\\\/\/ \/_\/\/ \/ \/\/ \/\\_\/ \/ \/\/ , |\/ \/ \/ \n * \/ \/ \/__ \/ \/ \/\/ \/ \/\/ \/ \/\/ \/ \/ \/ ___ \/ \/\/ ___ \/ \/\/ \/| ' \/ \/ \n * \/ \/_\/\/ \/\\ \/ \/_\/\/ \/ \/\/ \/ \/\/ \/_\/_ \/ \/ \/\/ \/ \/\/ \/\\_\/ \/ \/\/ \/ | \/ \/ \n * \/______\/ \/\/______\/ \/\/_\/ \/\/_____\/\\ \/_\/ \/\/_\/ \/\/_\/ \/\/_\/ \/\/_\/ \/|_\/ \/ \n * \\______\\\/ \\______\\\/ \\_\\\/ \\_____\\\/ \\_\\\/ \\_\\\/ \\_\\\/ \\_\\\/ \\_\\\/ \\_\\\/ \n *\n * Copyright (c) 2004, 2005 darkbits Js_.\/\n * Per Larsson a.k.a finalman _RqZ{a<^_aa\n * Olof Naessn a.k.a jansem\/yakslem _asww7!uY`> )\\a\/\/\n * _Qhm`] _f \"'c 1!5m\n * Visit: http:\/\/guichan.darkbits.org )Qk<P ` _: :+' .' \"{[\n * .)j(] .d_\/ '-( P . S\n * License: (BSD) <Td\/Z <fP\"5(\\\"??\"\\a. .L\n * Redistribution and use in source and _dV>ws?a-?' ._\/L #'\n * binary forms, with or without )4d[#7r, . ' )d`)[\n * modification, are permitted provided _Q-5'5W..j\/?' -?!\\)cam'\n * that the following conditions are met: j<<WP+k\/);. _W=j f\n * 1. Redistributions of source code must .$%w\\\/]Q . .\"' . mj$\n * retain the above copyright notice, ]E.pYY(Q]>. a J@\\\n * this list of conditions and the j(]1u<sE\"L,. . .\/^ ]{a\n * following disclaimer. 4'_uomm\\. )L);-4 (3=\n * 2. Redistributions in binary form must )_]X{Z('a_\"a7'<a\"a, ]\"[\n * reproduce the above copyright notice, #}<]m7`Za??4,P-\"'7. ).m\n * this list of conditions and the ]d2e)Q(<Q( ?94 b- LQ\/\n * following disclaimer in the <B!<\/]C)d_, '(<' .f. =C+m\n * documentation and\/or other materials .Z!=J ]e []('-4f _ ) -.)m]'\n * provided with the distribution. .w[5]' _[ \/.)_-\"+? _\/ <W\"\n * 3. Neither the name of Guichan nor the :$we` _! + _\/ . j?\n * names of its contributors may be used =3)= _f (_yQmWW$#( \"\n * to endorse or promote products derived - W, sQQQQmZQ#Wwa]..\n * from this software without specific (js, \\[QQW$QWW#?!V\"\".\n * prior written permission. ]y:.<\\.. .\n * -]n w\/ ' [.\n * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT )\/ )\/ !\n * HOLDERS AND CONTRIBUTORS \"AS IS\" AND ANY < (; sac , '\n * EXPRESS OR IMPLIED WARRANTIES, INCLUDING, ]^ .- %\n * BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF c < r\n * MERCHANTABILITY AND FITNESS FOR A PARTICULAR aga< <La\n * PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE 5% )P'-3L\n * COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE FOR _bQf` y`..)a\n * ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, ,J?4P'.P\"_(\\?d'.,\n * EXEMPLARY, OR CONSEQUENTIAL DAMAGES _Pa,)!f\/<[]\/ ?\"\n * (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT _2-..:. .r+_,.. .\n * OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, ?a.<%\"' \" -'.a_ _,\n * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) ^\n * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY,\n * WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT\n * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN\n * ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN\n * IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.\n *\/\n\n#ifndef GCN_ICON_HPP\n#define GCN_ICON_HPP\n\n#include \"guichan\/image.hpp\"\n#include \"guichan\/platform.hpp\"\n#include \"guichan\/widget.hpp\"\n\nnamespace gcn\n{\n \/**\n * An Icon for displaying images.\n *\/ \n class GCN_CORE_DECLSPEC Icon: public Widget\n {\n public:\n \/**\n * Constructor.\n *\n * @param image an Image to display.\n *\/\n Icon(Image* image);\n \n \n \/\/ Inherited from Widget\n \n virtual void draw(Graphics* graphics);\n\n virtual void drawBorder(Graphics* graphics);\n \n private:\n Image* mImage; \n }; \n}\n\n#endif \/\/ end GCN_ICON_HPP\n<commit_msg>Image is now proteced.<commit_after>\/* _______ __ __ __ ______ __ __ _______ __ __ \n * \/ _____\/\\ \/ \/\\ \/ \/\\ \/ \/\\ \/ ____\/\\ \/ \/\\ \/ \/\\ \/ ___ \/\\ \/ |\\\/ \/\\ \n * \/ \/\\____\\\/\/ \/ \/\/ \/ \/\/ \/ \/\/ \/\\___\\\/\/ \/_\/\/ \/ \/\/ \/\\_\/ \/ \/\/ , |\/ \/ \/ \n * \/ \/ \/__ \/ \/ \/\/ \/ \/\/ \/ \/\/ \/ \/ \/ ___ \/ \/\/ ___ \/ \/\/ \/| ' \/ \/ \n * \/ \/_\/\/ \/\\ \/ \/_\/\/ \/ \/\/ \/ \/\/ \/_\/_ \/ \/ \/\/ \/ \/\/ \/\\_\/ \/ \/\/ \/ | \/ \/ \n * \/______\/ \/\/______\/ \/\/_\/ \/\/_____\/\\ \/_\/ \/\/_\/ \/\/_\/ \/\/_\/ \/\/_\/ \/|_\/ \/ \n * \\______\\\/ \\______\\\/ \\_\\\/ \\_____\\\/ \\_\\\/ \\_\\\/ \\_\\\/ \\_\\\/ \\_\\\/ \\_\\\/ \n *\n * Copyright (c) 2004, 2005 darkbits Js_.\/\n * Per Larsson a.k.a finalman _RqZ{a<^_aa\n * Olof Naessn a.k.a jansem\/yakslem _asww7!uY`> )\\a\/\/\n * _Qhm`] _f \"'c 1!5m\n * Visit: http:\/\/guichan.darkbits.org )Qk<P ` _: :+' .' \"{[\n * .)j(] .d_\/ '-( P . S\n * License: (BSD) <Td\/Z <fP\"5(\\\"??\"\\a. .L\n * Redistribution and use in source and _dV>ws?a-?' ._\/L #'\n * binary forms, with or without )4d[#7r, . ' )d`)[\n * modification, are permitted provided _Q-5'5W..j\/?' -?!\\)cam'\n * that the following conditions are met: j<<WP+k\/);. _W=j f\n * 1. Redistributions of source code must .$%w\\\/]Q . .\"' . mj$\n * retain the above copyright notice, ]E.pYY(Q]>. a J@\\\n * this list of conditions and the j(]1u<sE\"L,. . .\/^ ]{a\n * following disclaimer. 4'_uomm\\. )L);-4 (3=\n * 2. Redistributions in binary form must )_]X{Z('a_\"a7'<a\"a, ]\"[\n * reproduce the above copyright notice, #}<]m7`Za??4,P-\"'7. ).m\n * this list of conditions and the ]d2e)Q(<Q( ?94 b- LQ\/\n * following disclaimer in the <B!<\/]C)d_, '(<' .f. =C+m\n * documentation and\/or other materials .Z!=J ]e []('-4f _ ) -.)m]'\n * provided with the distribution. .w[5]' _[ \/.)_-\"+? _\/ <W\"\n * 3. Neither the name of Guichan nor the :$we` _! + _\/ . j?\n * names of its contributors may be used =3)= _f (_yQmWW$#( \"\n * to endorse or promote products derived - W, sQQQQmZQ#Wwa]..\n * from this software without specific (js, \\[QQW$QWW#?!V\"\".\n * prior written permission. ]y:.<\\.. .\n * -]n w\/ ' [.\n * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT )\/ )\/ !\n * HOLDERS AND CONTRIBUTORS \"AS IS\" AND ANY < (; sac , '\n * EXPRESS OR IMPLIED WARRANTIES, INCLUDING, ]^ .- %\n * BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF c < r\n * MERCHANTABILITY AND FITNESS FOR A PARTICULAR aga< <La\n * PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE 5% )P'-3L\n * COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE FOR _bQf` y`..)a\n * ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, ,J?4P'.P\"_(\\?d'.,\n * EXEMPLARY, OR CONSEQUENTIAL DAMAGES _Pa,)!f\/<[]\/ ?\"\n * (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT _2-..:. .r+_,.. .\n * OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, ?a.<%\"' \" -'.a_ _,\n * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) ^\n * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY,\n * WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT\n * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN\n * ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN\n * IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.\n *\/\n\n#ifndef GCN_ICON_HPP\n#define GCN_ICON_HPP\n\n#include \"guichan\/image.hpp\"\n#include \"guichan\/platform.hpp\"\n#include \"guichan\/widget.hpp\"\n\nnamespace gcn\n{\n \/**\n * An Icon for displaying images.\n *\/ \n class GCN_CORE_DECLSPEC Icon: public Widget\n {\n public:\n \/**\n * Constructor.\n *\n * @param image an Image to display.\n *\/\n Icon(Image* image);\n \n \n \/\/ Inherited from Widget\n \n virtual void draw(Graphics* graphics);\n\n virtual void drawBorder(Graphics* graphics);\n \n protected:\n Image* mImage; \n }; \n}\n\n#endif \/\/ end GCN_ICON_HPP\n<|endoftext|>"} {"text":"<commit_before><commit_msg>Fix explicit<commit_after><|endoftext|>"} {"text":"<commit_before>#pragma once\n#include <Eigen\/Core>\n#include <vector>\n#include <memory>\n#include <array>\n#include \"mtao\/types.h\"\n#include <sstream>\n#include <numeric>\n\n\n\nnamespace mtao { namespace geometry {\n template <typename T, int D>\n class KDTree;\n template <typename T, int D, int Axis>\n \/\/class KDNode: public KDNodeBase<KDNode<T,D,Axis>> {\n class KDNode {\n public:\n using Vec = mtao::Vector<T,D>;\n using NodeType = KDNode<T,D,Axis>;\n constexpr static int ChildAxis = (Axis+1)%D;\n constexpr static int ParentAxis = (Axis-1+D)%D;\n using ChildNodeType = KDNode<T,D,ChildAxis>;\n using ParentNodeType = KDNode<T,D,ParentAxis>;\n \/\/balanced construciton iterator, used for one constructor\n using BCIt = mtao::vector<size_t>::iterator;\n\n ~KDNode() = default;\n KDNode() = delete;\n KDNode(const KDNode&) = delete;\n KDNode(KDNode&&) = delete;\n KDNode& operator=(const KDNode&) = delete;\n KDNode& operator=(KDNode&&) = delete;\n KDNode(const KDTree<T,D>& tree, KDNode&& o): m_tree(tree), m_index(o.m_index) {\n if(o.left()) {\n left() = std::make_unique<ChildNodeType>(tree,std::move(*o.left()));\n }\n if(o.right()) {\n right() = std::make_unique<ChildNodeType>(tree,std::move(*o.right()));\n }\n }\n\n KDNode(const KDTree<T,D>& tree, int index): m_tree(tree), m_index(index) {}\n KDNode(const KDTree<T,D>& tree, const BCIt& begin, const BCIt& end): m_tree(tree) {\n assert(std::distance(begin,end) > 0);\n\n std::sort(begin,end,[&](size_t a, size_t b) {\n return point(a)(Axis) < point(b)(Axis);\n });\n BCIt mid = begin + std::distance(begin,end)\/2;\n BCIt right_start = mid+1;\n m_index = *mid;\n if(std::distance(begin,mid) > 0) {\n left() = std::make_unique<ChildNodeType>(m_tree,begin,mid);\n }\n if(std::distance(right_start,end) > 0) {\n right() = std::make_unique<ChildNodeType>(m_tree,right_start,end);\n }\n\n\n }\n auto&& point() const {\n return point(m_index);\n }\n auto&& point(size_t idx) const {return m_tree.point(idx);}\n size_t index()const {return m_index;}\n\n template <typename Derived>\n bool operator<(const Eigen::MatrixBase<Derived>& p) const { \n \/\/positive -> right\n \/\/negative -> left\n return axis_dist(p) < 0;\n }\n template <typename Derived>\n T axis_dist(const Eigen::MatrixBase<Derived>& p) const { \n return p(Axis) - point()(Axis);\n }\n template <typename Derived>\n size_t axis_choice(const Eigen::MatrixBase<Derived>& p) const { \n return (*this < p)?0:1;\n }\n\n template <typename Derived>\n auto&& pick_child(const Eigen::MatrixBase<Derived>& p) { \n return m_children[axis_choice(p)];\n }\n template <typename Derived>\n auto&& pick_child(const Eigen::MatrixBase<Derived>& p) const { \n return m_children[axis_choice(p)];\n }\n\n void insert(size_t idx) {\n auto&& c = pick_child(point(idx));\n if(c) {\n c->insert(idx);\n } else {\n c = std::make_unique<ChildNodeType>(m_tree,idx);\n }\n }\n\n template <typename Derived>\n void nearest(const Eigen::MatrixBase<Derived>& p, size_t& nearest_index, T& nearest_dist) const { \n\n T dist = (point() - p).norm();\n if(dist < nearest_dist) {\n nearest_index = index();\n nearest_dist = dist;\n }\n\n auto comp_child = [&](const std::unique_ptr<ChildNodeType>& c) {\n if(c) {\n c->nearest(p,nearest_index,nearest_dist);\n }\n };\n T ad = axis_dist(p);\n bool in_nearband = nearest_dist >= std::abs(ad);\n\n \/\/[ node point child]\n \/\/[ node child point]\n \/\/[ point node child]\n \/\/axis nearest_dist is negative and considering going down right child\n if(ad >= 0 || in_nearband) {\n comp_child(right());\n }\n \/\/[ point child node]\n \/\/[ child point node]\n \/\/[ child node point]\n \/\/axis nearest_dist is positive and considering going down left child\n if(ad < 0 || in_nearband) {\n comp_child(left());\n }\n\n }\n\n std::unique_ptr<ChildNodeType>& left() { return m_children[0]; }\n const std::unique_ptr<ChildNodeType>& left() const { return m_children[0]; }\n\n std::unique_ptr<ChildNodeType>& right() { return m_children[1]; }\n const std::unique_ptr<ChildNodeType>& right() const { return m_children[1]; }\n\n\n int max_depth() const {\n int depth = 0;\n if(left()) {\n depth = std::max(left()->max_depth()+1,depth);\n }\n if(right()) {\n depth = std::max(right()->max_depth()+1,depth);\n }\n return depth;\n }\n\n\n operator std::string() const {\n std::stringstream ss;\n ss << m_index << \"[\";\n if(left()) {\n ss << std::string(*left());\n } else {\n ss << \".\";\n }\n ss << \" | \";\n if(right()) {\n ss << std::string(*right());\n } else {\n ss << \".\";\n }\n ss << \"]\";\n\n return ss.str();\n }\n private:\n const KDTree<T,D>& m_tree;\n size_t m_index;\n std::array<std::unique_ptr<ChildNodeType>,2> m_children;\n };\n\n template <typename T, int D>\n class KDTree {\n public:\n using Vec = mtao::Vector<T,D>;\n constexpr static int Axis = 0;\n using NodeType = KDNode<T,D,0>;\n const mtao::vector<Vec>& points()const {return m_points;}\n auto&& point(size_t idx) const {return m_points[idx];}\n size_t size() const { return points().size(); }\n\n void rebalance() {\n std::vector<size_t> P(m_points.size());\n std::iota(P.begin(),P.end(),0);\n m_node = std::make_unique<NodeType>(*this,P.begin(),P.end());\n }\n KDTree() = default;\n KDTree(const KDTree&) = delete;\n KDTree(KDTree&&) = delete;\n ~KDTree() = default;\n KDTree& operator=(const KDTree&) = delete;\n KDTree& operator=(KDTree&& o) {\n m_points = std::move(o.m_points);\n if(o.m_node) {\n m_node = std::make_unique<NodeType>(*this,std::move(*o.m_node));\n }\n return *this;\n }\n KDTree(const mtao::vector<Vec>& points): m_points(points) {\n rebalance();\n }\n size_t insert(const Vec& p) { \n size_t newidx = m_points.size();\n m_points.push_back(p);\n if(!m_node) {\n m_node = std::make_unique<NodeType>(*this, newidx);\n } else {\n m_node->insert(newidx); \n }\n return newidx;\n }\n size_t pruning_insertion(const Vec& p, T eps = T(1e-5)) {\n\n if(m_node) {\n size_t ni = nearest_index(p);\n if((point(ni)-p).norm() < eps) {\n return ni;\n }\n }\n return insert(p);\n }\n template <typename Derived>\n std::tuple<size_t,T> nearest(const typename Eigen::MatrixBase<Derived>& p) const { \n size_t idx = 0;\n T d = std::numeric_limits<T>::max();\n assert(m_node);\n\n m_node->nearest(p,idx,d); \n return {idx,d};\n }\n template <typename Derived>\n size_t nearest_index(const typename Eigen::MatrixBase<Derived>& p) const { \n return std::get<0>(nearest(p));\n }\n template <typename Derived>\n size_t nearest_distance(const typename Eigen::MatrixBase<Derived>& p) const { \n return std::get<1>(nearest(p));\n }\n template <typename Derived>\n const Vec& nearest_point(const typename Eigen::MatrixBase<Derived>& p) const { return point(nearest_index(p)); }\n\n operator std::string() const { return *m_node; }\n\n int max_depth() const {\n if(m_node) {\n return m_node->max_depth() + 1;\n }\n return 0;\n }\n\n\n\n private:\n std::unique_ptr<NodeType> m_node;\n mtao::vector<Vec> m_points;\n\n };\n\n\n}}\n\n<commit_msg>minor optimzation to pruend insertion on kdtree<commit_after>#pragma once\n#include <Eigen\/Core>\n#include <vector>\n#include <memory>\n#include <array>\n#include \"mtao\/types.h\"\n#include <sstream>\n#include <numeric>\n\n\n\nnamespace mtao { namespace geometry {\n template <typename T, int D>\n class KDTree;\n template <typename T, int D, int Axis>\n \/\/class KDNode: public KDNodeBase<KDNode<T,D,Axis>> {\n class KDNode {\n public:\n using Vec = mtao::Vector<T,D>;\n using NodeType = KDNode<T,D,Axis>;\n constexpr static int ChildAxis = (Axis+1)%D;\n constexpr static int ParentAxis = (Axis-1+D)%D;\n using ChildNodeType = KDNode<T,D,ChildAxis>;\n using ParentNodeType = KDNode<T,D,ParentAxis>;\n \/\/balanced construciton iterator, used for one constructor\n using BCIt = mtao::vector<size_t>::iterator;\n\n ~KDNode() = default;\n KDNode() = delete;\n KDNode(const KDNode&) = delete;\n KDNode(KDNode&&) = delete;\n KDNode& operator=(const KDNode&) = delete;\n KDNode& operator=(KDNode&&) = delete;\n KDNode(const KDTree<T,D>& tree, KDNode&& o): m_tree(tree), m_index(o.m_index) {\n if(o.left()) {\n left() = std::make_unique<ChildNodeType>(tree,std::move(*o.left()));\n }\n if(o.right()) {\n right() = std::make_unique<ChildNodeType>(tree,std::move(*o.right()));\n }\n }\n\n KDNode(const KDTree<T,D>& tree, int index): m_tree(tree), m_index(index) {}\n KDNode(const KDTree<T,D>& tree, const BCIt& begin, const BCIt& end): m_tree(tree) {\n assert(std::distance(begin,end) > 0);\n\n std::sort(begin,end,[&](size_t a, size_t b) {\n return point(a)(Axis) < point(b)(Axis);\n });\n BCIt mid = begin + std::distance(begin,end)\/2;\n BCIt right_start = mid+1;\n m_index = *mid;\n if(std::distance(begin,mid) > 0) {\n left() = std::make_unique<ChildNodeType>(m_tree,begin,mid);\n }\n if(std::distance(right_start,end) > 0) {\n right() = std::make_unique<ChildNodeType>(m_tree,right_start,end);\n }\n\n\n }\n auto&& point() const {\n return point(m_index);\n }\n auto&& point(size_t idx) const {return m_tree.point(idx);}\n size_t index()const {return m_index;}\n\n template <typename Derived>\n bool operator<(const Eigen::MatrixBase<Derived>& p) const { \n \/\/positive -> right\n \/\/negative -> left\n return axis_dist(p) < 0;\n }\n template <typename Derived>\n T axis_dist(const Eigen::MatrixBase<Derived>& p) const { \n return p(Axis) - point()(Axis);\n }\n template <typename Derived>\n size_t axis_choice(const Eigen::MatrixBase<Derived>& p) const { \n return (*this < p)?0:1;\n }\n\n template <typename Derived>\n auto&& pick_child(const Eigen::MatrixBase<Derived>& p) { \n return m_children[axis_choice(p)];\n }\n template <typename Derived>\n auto&& pick_child(const Eigen::MatrixBase<Derived>& p) const { \n return m_children[axis_choice(p)];\n }\n\n void insert(size_t idx) {\n auto&& c = pick_child(point(idx));\n if(c) {\n c->insert(idx);\n } else {\n c = std::make_unique<ChildNodeType>(m_tree,idx);\n }\n }\n\n template <typename Derived>\n void nearest(const Eigen::MatrixBase<Derived>& p, size_t& nearest_index, T& nearest_dist) const { \n\n T dist = (point() - p).norm();\n if(dist < nearest_dist) {\n nearest_index = index();\n nearest_dist = dist;\n }\n\n auto comp_child = [&](const std::unique_ptr<ChildNodeType>& c) {\n if(c) {\n c->nearest(p,nearest_index,nearest_dist);\n }\n };\n T ad = axis_dist(p);\n bool in_nearband = nearest_dist >= std::abs(ad);\n\n \/\/[ node point child]\n \/\/[ node child point]\n \/\/[ point node child]\n \/\/axis nearest_dist is negative and considering going down right child\n if(ad >= 0 || in_nearband) {\n comp_child(right());\n }\n \/\/[ point child node]\n \/\/[ child point node]\n \/\/[ child node point]\n \/\/axis nearest_dist is positive and considering going down left child\n if(ad < 0 || in_nearband) {\n comp_child(left());\n }\n\n }\n\n std::unique_ptr<ChildNodeType>& left() { return m_children[0]; }\n const std::unique_ptr<ChildNodeType>& left() const { return m_children[0]; }\n\n std::unique_ptr<ChildNodeType>& right() { return m_children[1]; }\n const std::unique_ptr<ChildNodeType>& right() const { return m_children[1]; }\n\n\n int max_depth() const {\n int depth = 0;\n if(left()) {\n depth = std::max(left()->max_depth()+1,depth);\n }\n if(right()) {\n depth = std::max(right()->max_depth()+1,depth);\n }\n return depth;\n }\n\n\n operator std::string() const {\n std::stringstream ss;\n ss << m_index << \"[\";\n if(left()) {\n ss << std::string(*left());\n } else {\n ss << \".\";\n }\n ss << \" | \";\n if(right()) {\n ss << std::string(*right());\n } else {\n ss << \".\";\n }\n ss << \"]\";\n\n return ss.str();\n }\n private:\n const KDTree<T,D>& m_tree;\n size_t m_index;\n std::array<std::unique_ptr<ChildNodeType>,2> m_children;\n };\n\n template <typename T, int D>\n class KDTree {\n public:\n using Vec = mtao::Vector<T,D>;\n constexpr static int Axis = 0;\n using NodeType = KDNode<T,D,0>;\n const mtao::vector<Vec>& points()const {return m_points;}\n auto&& point(size_t idx) const {return m_points[idx];}\n size_t size() const { return points().size(); }\n\n void rebalance() {\n std::vector<size_t> P(m_points.size());\n std::iota(P.begin(),P.end(),0);\n m_node = std::make_unique<NodeType>(*this,P.begin(),P.end());\n }\n KDTree() = default;\n KDTree(const KDTree&) = delete;\n KDTree(KDTree&&) = delete;\n ~KDTree() = default;\n KDTree& operator=(const KDTree&) = delete;\n KDTree& operator=(KDTree&& o) {\n m_points = std::move(o.m_points);\n if(o.m_node) {\n m_node = std::make_unique<NodeType>(*this,std::move(*o.m_node));\n }\n return *this;\n }\n KDTree(const mtao::vector<Vec>& points): m_points(points) {\n rebalance();\n }\n size_t insert(const Vec& p) { \n size_t newidx = m_points.size();\n m_points.push_back(p);\n if(!m_node) {\n m_node = std::make_unique<NodeType>(*this, newidx);\n } else {\n m_node->insert(newidx); \n }\n return newidx;\n }\n size_t pruning_insertion(const Vec& p, T eps = T(1e-5)) {\n\n if(m_node) {\n size_t [ni,d] = nearest(p);\n if(d < eps) {\n return ni;\n }\n }\n return insert(p);\n }\n template <typename Derived>\n std::tuple<size_t,T> nearest(const typename Eigen::MatrixBase<Derived>& p) const { \n size_t idx = 0;\n T d = std::numeric_limits<T>::max();\n assert(m_node);\n\n m_node->nearest(p,idx,d); \n return {idx,d};\n }\n template <typename Derived>\n size_t nearest_index(const typename Eigen::MatrixBase<Derived>& p) const { \n return std::get<0>(nearest(p));\n }\n template <typename Derived>\n size_t nearest_distance(const typename Eigen::MatrixBase<Derived>& p) const { \n return std::get<1>(nearest(p));\n }\n template <typename Derived>\n const Vec& nearest_point(const typename Eigen::MatrixBase<Derived>& p) const { return point(nearest_index(p)); }\n\n operator std::string() const { return *m_node; }\n\n int max_depth() const {\n if(m_node) {\n return m_node->max_depth() + 1;\n }\n return 0;\n }\n\n\n\n private:\n std::unique_ptr<NodeType> m_node;\n mtao::vector<Vec> m_points;\n\n };\n\n\n}}\n\n<|endoftext|>"} {"text":"<commit_before>#ifndef VSMC_INTERNAL_ASSERT_HPP\n#define VSMC_INTERNAL_ASSERT_HPP\n\n#include <cassert>\n#include <cstdio>\n#include <stdexcept>\n\n#include <vsmc\/internal\/config.hpp>\n#include <vsmc\/internal\/forward.hpp>\n\n\/\/ Runtime assertion\n#if VSMC_RUNTIME_ASSERT_AS_EXCEPTION\n#define VSMC_RUNTIME_ASSERT(cond, msg) \\\n{ \\\n if (!(cond)) { \\\n throw vsmc::RuntimeAssert(msg); \\\n }; \\\n}\n#elif defined(NDEBUG) \/\/ VSMC_RUNTIME_ASSERT_AS_EXCEPTION\n#define VSMC_RUNTIME_ASSERT(cond, msg)\n#else\n#define VSMC_RUNTIME_ASSERT(cond, msg) \\\n{ \\\n if (!(cond)) { \\\n std::fprintf(stderr, \\\n \"vSMC runtime assertion failed; File: %s; Line: %d\\n%s\\n\", \\\n __FILE__, __LINE__, msg); \\\n }; \\\n assert(cond); \\\n}\n#endif \/\/ VSMC_RUNTIME_ASSERT_AS_EXCEPTION\n\n\/\/ Static assertion\n#if VSMC_HAS_CXX11_STATIC_ASSERT\n#define VSMC_STATIC_ASSERT(cond, msg) static_assert(cond, #msg)\n#else \/\/ VSMC_HAS_CXX11_STATIC_ASSERT\n#ifdef _MSC_VER\n#define VSMC_STATIC_ASSERT(cond, msg) \\\n {vsmc::StaticAssert<bool(cond)>::msg;}\n#else \/\/ _MSC_VER\n#define VSMC_STATIC_ASSERT(cond, msg) \\\n if (vsmc::StaticAssert<bool(cond)>::msg) {};\n#endif \/\/ _MSC_VER\n#endif \/\/ VSMC_HAS_CXX11_STATIC_ASSERT\n\nnamespace vsmc {\n\nclass RuntimeAssert : public std::runtime_error\n{\n public :\n\n RuntimeAssert (const std::string &msg) : std::runtime_error(msg) {}\n\n RuntimeAssert (const char *msg) : std::runtime_error(msg) {}\n}; \/\/ class RuntimeAssert\n\ntemplate <bool> class StaticAssert {};\n\ntemplate <>\nclass StaticAssert<true>\n{\n public :\n\n enum {\n USE_METHOD_resize_dim_WITH_A_FIXED_SIZE_StateBase_OBJECT,\n\n USE_StateCL_WITH_A_STATE_TYPE_OTHER_THAN_cl_float_AND_cl_double,\n USE_METHOD_resize_dim_WITH_A_FIXED_SIZE_StateCL_OBJECT,\n USE_InitializeCL_WITH_A_STATE_TYPE_NOT_DERIVED_FROM_StateCL,\n USE_MoveCL_WITH_A_STATE_TYPE_NOT_DERIVED_FROM_StateCL,\n USE_MonitorEvalCL_WITH_A_STATE_TYPE_NOT_DERIVED_FROM_StateCL,\n USE_PathEvalCL_WITH_A_STATE_TYPE_NOT_DERIVED_FROM_StateCL,\n\n USE_InitializeAdapter_WITHOUT_AN_INITIAILIZE_IMPLEMENTATION,\n USE_MoveAdapter_WITHOUT_A_MOVE_IMPLEMENTATION,\n USE_MonitorEvalAdapter_WITHOUT_A_MONITOR_EVAL_IMPLEMENTATION,\n USE_PathEvalAdapter_WITHOUT_A_PATH_EVAL_IMPLEMENTATION\n };\n}; \/\/ class StaticAssert\n\n} \/\/ namespace vsmc\n\n#define VSMC_STATIC_ASSERT_STATE_TYPE(base, derived, user) \\\n VSMC_STATIC_ASSERT((vsmc::traits::IsBaseOfState<base, derived>::value), \\\n USE_##user##_WITH_A_STATE_TYPE_NOT_DERIVED_FROM_##base)\n\n#define VSMC_STATIC_ASSERT_STATE_CL_VALUE_TYPE(type) \\\n VSMC_STATIC_ASSERT((cxx11::is_same<type, cl_float>::value \\\n || cxx11::is_same<type, cl_double>::value), \\\n USE_StateCL_WITH_A_STATE_TYPE_OTHER_THAN_cl_float_AND_cl_double)\n\n#define VSMC_STATIC_ASSERT_STATE_CL_TYPE(derived, user) \\\n VSMC_STATIC_ASSERT((vsmc::traits::IsBaseOfStateCL<derived>::value), \\\n USE_##user##_WITH_A_STATE_TYPE_NOT_DERIVED_FROM_StateCL)\n\n#define VSMC_STATIC_ASSERT_NO_IMPL(member) \\\n VSMC_STATIC_ASSERT((cxx11::is_same<T, NullType>::value), \\\n NO_IMPLEMENTATION_OF_##member##_FOUND)\n\n#define VSMC_RUNTIME_ASSERT_STATE_CL_BUILD(func) \\\n VSMC_RUNTIME_ASSERT((build()), \\\n (\"**StateCL::\"#func\"** can only be called after true \" \\\n \"**StateCL::build**\"));\n\n#define VSMC_RUNTIME_ASSERT_CONST_SINGLE_PARTICLE_VALID \\\n VSMC_RUNTIME_ASSERT(particle_ptr_, \\\n (\"A **ConstSingleParticle** object \" \\\n \"is contructed with 0 **Particle** pointer\")); \\\n VSMC_RUNTIME_ASSERT((id_ >= 0 && id_ <= particle_ptr_->size()), \\\n (\"A **ConstSignleParticle** object \" \\\n \"is contructed with an out of range id\"));\n\n#define VSMC_RUNTIME_ASSERT_SINGLE_PARTICLE_VALID \\\n VSMC_RUNTIME_ASSERT(particle_ptr_, \\\n (\"A **SingleParticle** object \" \\\n \"is contructed with 0 **Particle** pointer\")); \\\n VSMC_RUNTIME_ASSERT((id_ >= 0 && id_ <= particle_ptr_->size()), \\\n (\"A **SignleParticle** object \" \\\n \"is contructed with an out of range id\"));\n\n#define VSMC_RUNTIME_ASSERT_DERIVED_BASE(basename) \\\n VSMC_RUNTIME_ASSERT((dynamic_cast<Derived *>(this)), \\\n (\"DERIVED FROM \" #basename \\\n \" WITH INCORRECT **Derived** TEMPLATE PARAMTER\"));\n\n#define VSMC_RUNTIME_ASSERT_CL_MANAGER_SETUP(func) \\\n VSMC_RUNTIME_ASSERT((setup()), \\\n (\"**vsmc::Manager::\"#func\"** can only be called after true \" \\\n \"**vsmc::Manager::setup**\"));\n\n#define VSMC_RUNTIME_ASSERT_MKL_STAT_EVAL_EDIT_TASK(status) \\\n VSMC_RUNTIME_ASSERT((status == VSL_STATUS_OK), \\\n (\"CALLING **vsldSSEditTask** failed\"));\n\n#endif \/\/ VSMC_INTERNAL_ASSERT_HPP\n<commit_msg>add missing header<commit_after>#ifndef VSMC_INTERNAL_ASSERT_HPP\n#define VSMC_INTERNAL_ASSERT_HPP\n\n#include <cassert>\n#include <cstdio>\n#include <stdexcept>\n\n#include <vsmc\/internal\/config.hpp>\n#include <vsmc\/internal\/forward.hpp>\n#include <vsmc\/cxx11\/type_traits.hpp>\n\n\/\/ Runtime assertion\n#if VSMC_RUNTIME_ASSERT_AS_EXCEPTION\n#define VSMC_RUNTIME_ASSERT(cond, msg) \\\n{ \\\n if (!(cond)) { \\\n throw vsmc::RuntimeAssert(msg); \\\n }; \\\n}\n#elif defined(NDEBUG) \/\/ VSMC_RUNTIME_ASSERT_AS_EXCEPTION\n#define VSMC_RUNTIME_ASSERT(cond, msg)\n#else\n#define VSMC_RUNTIME_ASSERT(cond, msg) \\\n{ \\\n if (!(cond)) { \\\n std::fprintf(stderr, \\\n \"vSMC runtime assertion failed; File: %s; Line: %d\\n%s\\n\", \\\n __FILE__, __LINE__, msg); \\\n }; \\\n assert(cond); \\\n}\n#endif \/\/ VSMC_RUNTIME_ASSERT_AS_EXCEPTION\n\n\/\/ Static assertion\n#if VSMC_HAS_CXX11_STATIC_ASSERT\n#define VSMC_STATIC_ASSERT(cond, msg) static_assert(cond, #msg)\n#else \/\/ VSMC_HAS_CXX11_STATIC_ASSERT\n#ifdef _MSC_VER\n#define VSMC_STATIC_ASSERT(cond, msg) \\\n {vsmc::StaticAssert<bool(cond)>::msg;}\n#else \/\/ _MSC_VER\n#define VSMC_STATIC_ASSERT(cond, msg) \\\n if (vsmc::StaticAssert<bool(cond)>::msg) {};\n#endif \/\/ _MSC_VER\n#endif \/\/ VSMC_HAS_CXX11_STATIC_ASSERT\n\nnamespace vsmc {\n\nclass RuntimeAssert : public std::runtime_error\n{\n public :\n\n RuntimeAssert (const std::string &msg) : std::runtime_error(msg) {}\n\n RuntimeAssert (const char *msg) : std::runtime_error(msg) {}\n}; \/\/ class RuntimeAssert\n\ntemplate <bool> class StaticAssert {};\n\ntemplate <>\nclass StaticAssert<true>\n{\n public :\n\n enum {\n USE_METHOD_resize_dim_WITH_A_FIXED_SIZE_StateBase_OBJECT,\n\n USE_StateCL_WITH_A_STATE_TYPE_OTHER_THAN_cl_float_AND_cl_double,\n USE_METHOD_resize_dim_WITH_A_FIXED_SIZE_StateCL_OBJECT,\n USE_InitializeCL_WITH_A_STATE_TYPE_NOT_DERIVED_FROM_StateCL,\n USE_MoveCL_WITH_A_STATE_TYPE_NOT_DERIVED_FROM_StateCL,\n USE_MonitorEvalCL_WITH_A_STATE_TYPE_NOT_DERIVED_FROM_StateCL,\n USE_PathEvalCL_WITH_A_STATE_TYPE_NOT_DERIVED_FROM_StateCL,\n\n USE_InitializeAdapter_WITHOUT_AN_INITIAILIZE_IMPLEMENTATION,\n USE_MoveAdapter_WITHOUT_A_MOVE_IMPLEMENTATION,\n USE_MonitorEvalAdapter_WITHOUT_A_MONITOR_EVAL_IMPLEMENTATION,\n USE_PathEvalAdapter_WITHOUT_A_PATH_EVAL_IMPLEMENTATION\n };\n}; \/\/ class StaticAssert\n\n} \/\/ namespace vsmc\n\n#define VSMC_STATIC_ASSERT_STATE_TYPE(base, derived, user) \\\n VSMC_STATIC_ASSERT((vsmc::traits::IsBaseOfState<base, derived>::value), \\\n USE_##user##_WITH_A_STATE_TYPE_NOT_DERIVED_FROM_##base)\n\n#define VSMC_STATIC_ASSERT_STATE_CL_VALUE_TYPE(type) \\\n VSMC_STATIC_ASSERT((cxx11::is_same<type, cl_float>::value \\\n || cxx11::is_same<type, cl_double>::value), \\\n USE_StateCL_WITH_A_STATE_TYPE_OTHER_THAN_cl_float_AND_cl_double)\n\n#define VSMC_STATIC_ASSERT_STATE_CL_TYPE(derived, user) \\\n VSMC_STATIC_ASSERT((vsmc::traits::IsBaseOfStateCL<derived>::value), \\\n USE_##user##_WITH_A_STATE_TYPE_NOT_DERIVED_FROM_StateCL)\n\n#define VSMC_STATIC_ASSERT_NO_IMPL(member) \\\n VSMC_STATIC_ASSERT((cxx11::is_same<T, NullType>::value), \\\n NO_IMPLEMENTATION_OF_##member##_FOUND)\n\n#define VSMC_RUNTIME_ASSERT_STATE_CL_BUILD(func) \\\n VSMC_RUNTIME_ASSERT((build()), \\\n (\"**StateCL::\"#func\"** can only be called after true \" \\\n \"**StateCL::build**\"));\n\n#define VSMC_RUNTIME_ASSERT_CONST_SINGLE_PARTICLE_VALID \\\n VSMC_RUNTIME_ASSERT(particle_ptr_, \\\n (\"A **ConstSingleParticle** object \" \\\n \"is contructed with 0 **Particle** pointer\")); \\\n VSMC_RUNTIME_ASSERT((id_ >= 0 && id_ <= particle_ptr_->size()), \\\n (\"A **ConstSignleParticle** object \" \\\n \"is contructed with an out of range id\"));\n\n#define VSMC_RUNTIME_ASSERT_SINGLE_PARTICLE_VALID \\\n VSMC_RUNTIME_ASSERT(particle_ptr_, \\\n (\"A **SingleParticle** object \" \\\n \"is contructed with 0 **Particle** pointer\")); \\\n VSMC_RUNTIME_ASSERT((id_ >= 0 && id_ <= particle_ptr_->size()), \\\n (\"A **SignleParticle** object \" \\\n \"is contructed with an out of range id\"));\n\n#define VSMC_RUNTIME_ASSERT_DERIVED_BASE(basename) \\\n VSMC_RUNTIME_ASSERT((dynamic_cast<Derived *>(this)), \\\n (\"DERIVED FROM \" #basename \\\n \" WITH INCORRECT **Derived** TEMPLATE PARAMTER\"));\n\n#define VSMC_RUNTIME_ASSERT_CL_MANAGER_SETUP(func) \\\n VSMC_RUNTIME_ASSERT((setup()), \\\n (\"**vsmc::Manager::\"#func\"** can only be called after true \" \\\n \"**vsmc::Manager::setup**\"));\n\n#define VSMC_RUNTIME_ASSERT_MKL_STAT_EVAL_EDIT_TASK(status) \\\n VSMC_RUNTIME_ASSERT((status == VSL_STATUS_OK), \\\n (\"CALLING **vsldSSEditTask** failed\"));\n\n#endif \/\/ VSMC_INTERNAL_ASSERT_HPP\n<|endoftext|>"} {"text":"<commit_before>#pragma once\n\n#include \"zmsg_types.hpp\"\n\nnamespace zmsg {\n\ntemplate<>\nstruct zmsg<mid_t::dust_check_start> {\npublic:\n\tZMSG_PU()\n};\n\nstruct bool_img {\n\tuint16_t width;\n\tuint16_t height;\n\tstd::vector<bool> data;\npublic:\n\tZMSG_PU(width, height, data);\n};\n\ntemplate<>\nstruct zmsg<mid_t::dust_check_result> {\n\tbool_img xz;\n\tbool_img yz;\npublic:\n\tZMSG_PU(xz, yz)\n};\n\n} \/* msg *\/\n<commit_msg>zmsg: dust_check_result : add member xz_ok\/yz_ok<commit_after>#pragma once\n\n#include \"zmsg_types.hpp\"\n\nnamespace zmsg {\n\ntemplate<>\nstruct zmsg<mid_t::dust_check_start> {\npublic:\n\tZMSG_PU()\n};\n\nstruct bool_img {\n\tuint16_t width;\n\tuint16_t height;\n\tstd::vector<bool> data;\npublic:\n\tZMSG_PU(width, height, data);\n};\n\ntemplate<>\nstruct zmsg<mid_t::dust_check_result> {\n\tbool xz_ok;\n\tbool_img xz;\n\tbool yz_ok;\n\tbool_img yz;\npublic:\n\tZMSG_PU(xz_ok, xz, yz_ok, yz)\n};\n\n} \/* msg *\/\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 <limits>\n#include <stdexcept>\n\n#include <boost\/make_shared.hpp>\n\n#include <cppunit\/TestFixture.h>\n#include <cppunit\/extensions\/HelperMacros.h>\n\n#include \"IWORKMemoryStream.h\"\n#include \"libetonyek_utils.h\"\n\nusing libetonyek::EndOfStreamException;\nusing libetonyek::IWORKMemoryStream;\nusing libetonyek::RVNGInputStreamPtr_t;\nusing libetonyek::readSVar;\nusing libetonyek::readUVar;\n\nusing std::numeric_limits;\n\nnamespace test\n{\n\nnamespace\n{\n\nRVNGInputStreamPtr_t makeStream(const char *const bytes, const size_t len)\n{\n return boost::make_shared<IWORKMemoryStream>(reinterpret_cast<const unsigned char *>(bytes), len);\n}\n\nRVNGInputStreamPtr_t makeEmptyStream()\n{\n const RVNGInputStreamPtr_t stream = makeStream(\"\\0\", 1);\n stream->seek(1, librevenge::RVNG_SEEK_SET);\n return stream;\n}\n\n}\n\nclass LibetonyekUtilsTest : public CPPUNIT_NS::TestFixture\n{\npublic:\n virtual void setUp();\n virtual void tearDown();\n\nprivate:\n CPPUNIT_TEST_SUITE(LibetonyekUtilsTest);\n CPPUNIT_TEST(testReadSVar);\n CPPUNIT_TEST(testReadUVar);\n CPPUNIT_TEST_SUITE_END();\n\nprivate:\n void testReadSVar();\n void testReadUVar();\n};\n\nvoid LibetonyekUtilsTest::setUp()\n{\n}\n\nvoid LibetonyekUtilsTest::tearDown()\n{\n}\n\nvoid LibetonyekUtilsTest::testReadSVar()\n{\n CPPUNIT_ASSERT_EQUAL(0L, readSVar(makeStream(\"\\x0\", 1)));\n CPPUNIT_ASSERT_EQUAL(-1L, readSVar(makeStream(\"\\x1\", 1)));\n CPPUNIT_ASSERT_EQUAL(1L, readSVar(makeStream(\"\\x2\", 1)));\n CPPUNIT_ASSERT_EQUAL(-2L, readSVar(makeStream(\"\\x3\", 1)));\n CPPUNIT_ASSERT_EQUAL(0x7fffffffL, readSVar(makeStream(\"\\xfe\\xff\\xff\\xff\\xf\", 5)));\n CPPUNIT_ASSERT_EQUAL(-0x80000000L, readSVar(makeStream(\"\\xff\\xff\\xff\\xff\\xf\", 5)));\n CPPUNIT_ASSERT_EQUAL(numeric_limits<int64_t>::max(), readSVar(makeStream(\"\\xfe\\xff\\xff\\xff\\xff\\xff\\xff\\xff\\xff\\x1\", 10)));\n CPPUNIT_ASSERT_EQUAL(numeric_limits<int64_t>::min(), readSVar(makeStream(\"\\xff\\xff\\xff\\xff\\xff\\xff\\xff\\xff\\xff\\x1\", 10)));\n CPPUNIT_ASSERT_THROW(readSVar(makeStream(\"\\x80\\x80\\x80\\x80\\x80\\x80\\x80\\x80\\x80\\x2\", 10)), std::range_error);\n CPPUNIT_ASSERT_THROW(readSVar(makeStream(\"\\x81\\x80\\x80\\x80\\x80\\x80\\x80\\x80\\x80\\x2\", 10)), std::range_error);\n CPPUNIT_ASSERT_THROW(readSVar(makeEmptyStream()), EndOfStreamException);\n CPPUNIT_ASSERT_THROW(readSVar(makeStream(\"\\x80\", 1)), EndOfStreamException);\n CPPUNIT_ASSERT_THROW(readSVar(makeStream(\"\\xff\\xff\", 2)), EndOfStreamException);\n}\n\nvoid LibetonyekUtilsTest::testReadUVar()\n{\n CPPUNIT_ASSERT_EQUAL(0UL, readUVar(makeStream(\"\\x0\", 1)));\n CPPUNIT_ASSERT_EQUAL(1UL, readUVar(makeStream(\"\\x1\", 1)));\n CPPUNIT_ASSERT_EQUAL(0x7fUL, readUVar(makeStream(\"\\x7f\", 1)));\n CPPUNIT_ASSERT_EQUAL(0x80UL, readUVar(makeStream(\"\\x80\\x1\", 2)));\n CPPUNIT_ASSERT_EQUAL(0x81UL, readUVar(makeStream(\"\\x81\\x1\", 2)));\n CPPUNIT_ASSERT_EQUAL(0x12345678UL, readUVar(makeStream(\"\\xf8\\xac\\xd1\\x91\\x01\", 5)));\n CPPUNIT_ASSERT_EQUAL(numeric_limits<uint64_t>::max(), readUVar(makeStream(\"\\xff\\xff\\xff\\xff\\xff\\xff\\xff\\xff\\xff\\x1\", 10)));\n CPPUNIT_ASSERT_THROW(readUVar(makeStream(\"\\x80\\x80\\x80\\x80\\x80\\x80\\x80\\x80\\x80\\x2\", 10)), std::range_error);\n CPPUNIT_ASSERT_THROW(readUVar(makeEmptyStream()), EndOfStreamException);\n CPPUNIT_ASSERT_THROW(readUVar(makeStream(\"\\x80\", 1)), EndOfStreamException);\n CPPUNIT_ASSERT_THROW(readUVar(makeStream(\"\\xff\\xff\", 2)), EndOfStreamException);\n}\n\nCPPUNIT_TEST_SUITE_REGISTRATION(LibetonyekUtilsTest);\n\n}\n\n\/* vim:set shiftwidth=2 softtabstop=2 expandtab: *\/\n<commit_msg>fix build on OS X<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 <limits>\n#include <stdexcept>\n\n#include <boost\/make_shared.hpp>\n\n#include <cppunit\/TestFixture.h>\n#include <cppunit\/extensions\/HelperMacros.h>\n\n#include \"IWORKMemoryStream.h\"\n#include \"libetonyek_utils.h\"\n\nusing libetonyek::EndOfStreamException;\nusing libetonyek::IWORKMemoryStream;\nusing libetonyek::RVNGInputStreamPtr_t;\nusing libetonyek::readSVar;\nusing libetonyek::readUVar;\n\nusing std::numeric_limits;\n\nnamespace test\n{\n\nnamespace\n{\n\nRVNGInputStreamPtr_t makeStream(const char *const bytes, const size_t len)\n{\n return boost::make_shared<IWORKMemoryStream>(reinterpret_cast<const unsigned char *>(bytes), len);\n}\n\nRVNGInputStreamPtr_t makeEmptyStream()\n{\n const RVNGInputStreamPtr_t stream = makeStream(\"\\0\", 1);\n stream->seek(1, librevenge::RVNG_SEEK_SET);\n return stream;\n}\n\n}\n\nclass LibetonyekUtilsTest : public CPPUNIT_NS::TestFixture\n{\npublic:\n virtual void setUp();\n virtual void tearDown();\n\nprivate:\n CPPUNIT_TEST_SUITE(LibetonyekUtilsTest);\n CPPUNIT_TEST(testReadSVar);\n CPPUNIT_TEST(testReadUVar);\n CPPUNIT_TEST_SUITE_END();\n\nprivate:\n void testReadSVar();\n void testReadUVar();\n};\n\nvoid LibetonyekUtilsTest::setUp()\n{\n}\n\nvoid LibetonyekUtilsTest::tearDown()\n{\n}\n\nvoid LibetonyekUtilsTest::testReadSVar()\n{\n CPPUNIT_ASSERT_EQUAL(int64_t(0), readSVar(makeStream(\"\\x0\", 1)));\n CPPUNIT_ASSERT_EQUAL(int64_t(-1), readSVar(makeStream(\"\\x1\", 1)));\n CPPUNIT_ASSERT_EQUAL(int64_t(1), readSVar(makeStream(\"\\x2\", 1)));\n CPPUNIT_ASSERT_EQUAL(int64_t(-2), readSVar(makeStream(\"\\x3\", 1)));\n CPPUNIT_ASSERT_EQUAL(int64_t(0x7fffffffL), readSVar(makeStream(\"\\xfe\\xff\\xff\\xff\\xf\", 5)));\n CPPUNIT_ASSERT_EQUAL(int64_t(-0x80000000L), readSVar(makeStream(\"\\xff\\xff\\xff\\xff\\xf\", 5)));\n CPPUNIT_ASSERT_EQUAL(numeric_limits<int64_t>::max(), readSVar(makeStream(\"\\xfe\\xff\\xff\\xff\\xff\\xff\\xff\\xff\\xff\\x1\", 10)));\n CPPUNIT_ASSERT_EQUAL(numeric_limits<int64_t>::min(), readSVar(makeStream(\"\\xff\\xff\\xff\\xff\\xff\\xff\\xff\\xff\\xff\\x1\", 10)));\n CPPUNIT_ASSERT_THROW(readSVar(makeStream(\"\\x80\\x80\\x80\\x80\\x80\\x80\\x80\\x80\\x80\\x2\", 10)), std::range_error);\n CPPUNIT_ASSERT_THROW(readSVar(makeStream(\"\\x81\\x80\\x80\\x80\\x80\\x80\\x80\\x80\\x80\\x2\", 10)), std::range_error);\n CPPUNIT_ASSERT_THROW(readSVar(makeEmptyStream()), EndOfStreamException);\n CPPUNIT_ASSERT_THROW(readSVar(makeStream(\"\\x80\", 1)), EndOfStreamException);\n CPPUNIT_ASSERT_THROW(readSVar(makeStream(\"\\xff\\xff\", 2)), EndOfStreamException);\n}\n\nvoid LibetonyekUtilsTest::testReadUVar()\n{\n CPPUNIT_ASSERT_EQUAL(uint64_t(0), readUVar(makeStream(\"\\x0\", 1)));\n CPPUNIT_ASSERT_EQUAL(uint64_t(1), readUVar(makeStream(\"\\x1\", 1)));\n CPPUNIT_ASSERT_EQUAL(uint64_t(0x7f), readUVar(makeStream(\"\\x7f\", 1)));\n CPPUNIT_ASSERT_EQUAL(uint64_t(0x80), readUVar(makeStream(\"\\x80\\x1\", 2)));\n CPPUNIT_ASSERT_EQUAL(uint64_t(0x81), readUVar(makeStream(\"\\x81\\x1\", 2)));\n CPPUNIT_ASSERT_EQUAL(uint64_t(0x12345678UL), readUVar(makeStream(\"\\xf8\\xac\\xd1\\x91\\x01\", 5)));\n CPPUNIT_ASSERT_EQUAL(numeric_limits<uint64_t>::max(), readUVar(makeStream(\"\\xff\\xff\\xff\\xff\\xff\\xff\\xff\\xff\\xff\\x1\", 10)));\n CPPUNIT_ASSERT_THROW(readUVar(makeStream(\"\\x80\\x80\\x80\\x80\\x80\\x80\\x80\\x80\\x80\\x2\", 10)), std::range_error);\n CPPUNIT_ASSERT_THROW(readUVar(makeEmptyStream()), EndOfStreamException);\n CPPUNIT_ASSERT_THROW(readUVar(makeStream(\"\\x80\", 1)), EndOfStreamException);\n CPPUNIT_ASSERT_THROW(readUVar(makeStream(\"\\xff\\xff\", 2)), EndOfStreamException);\n}\n\nCPPUNIT_TEST_SUITE_REGISTRATION(LibetonyekUtilsTest);\n\n}\n\n\/* vim:set shiftwidth=2 softtabstop=2 expandtab: *\/\n<|endoftext|>"} {"text":"<commit_before>#include \"unlimited.h\"\n\n#include \"test\/test_bitcoin.h\"\n#include \"..\/consensus\/consensus.h\"\n\n#include <boost\/algorithm\/string.hpp>\n#include <boost\/test\/unit_test.hpp>\n#include <boost\/lexical_cast.hpp>\n\nusing namespace std;\n\n\/\/ Defined in rpc_tests.cpp not bitcoin-cli.cpp\nextern UniValue CallRPC(string strMethod);\n\nBOOST_FIXTURE_TEST_SUITE(excessiveblock_test, TestingSetup)\n\nBOOST_AUTO_TEST_CASE(rpc_excessive)\n{\n BOOST_CHECK_NO_THROW(CallRPC(\"getexcessiveblock\"));\n\n BOOST_CHECK_NO_THROW(CallRPC(\"getminingmaxblock\"));\n\n BOOST_CHECK_THROW(CallRPC(\"setexcessiveblock not_uint\"), runtime_error);\n BOOST_CHECK_THROW(CallRPC(\"setexcessiveblock 1000000 not_uint\"), boost::bad_lexical_cast);\n BOOST_CHECK_THROW(CallRPC(\"setexcessiveblock 1000000 -1\"), boost::bad_lexical_cast);\n BOOST_CHECK_THROW(CallRPC(\"setexcessiveblock -1 0\"), boost::bad_lexical_cast);\n\n BOOST_CHECK_THROW(CallRPC(\"setexcessiveblock 1000 1\"), runtime_error);\n BOOST_CHECK_NO_THROW(CallRPC(\"setminingmaxblock 1000\"));\n BOOST_CHECK_NO_THROW(CallRPC(\"setexcessiveblock 1000 1\"));\n\n BOOST_CHECK_THROW(CallRPC(\"setexcessiveblock 1000 0 0\"), runtime_error);\n\n BOOST_CHECK_THROW(CallRPC(\"setminingmaxblock\"), runtime_error);\n BOOST_CHECK_THROW(CallRPC(\"setminingmaxblock 100000\"), runtime_error);\n BOOST_CHECK_THROW(CallRPC(\"setminingmaxblock not_uint\"), boost::bad_lexical_cast);\n BOOST_CHECK_THROW(CallRPC(\"setminingmaxblock -1\"), boost::bad_lexical_cast);\n BOOST_CHECK_THROW(CallRPC(\"setminingmaxblock 0\"), runtime_error);\n BOOST_CHECK_THROW(CallRPC(\"setminingmaxblock 0 0\"), runtime_error);\n BOOST_CHECK_NO_THROW(CallRPC(\"setminingmaxblock 1000\"));\n BOOST_CHECK_NO_THROW(CallRPC(\"setminingmaxblock 101\"));\n \n}\n\nBOOST_AUTO_TEST_CASE(buip005)\n{\n string exceptedEB;\n string exceptedAD;\n excessiveBlockSize = 1000000;\n excessiveAcceptDepth = 9999999;\n exceptedEB = \"EB1\";\n exceptedAD = \"AD9999999\";\n settingsToUserAgentString();\n BOOST_CHECK_MESSAGE(BUComments.front() == exceptedEB,\n \"EB ought to have been \" << exceptedEB << \" when excessiveBlockSize = \"\n << excessiveBlockSize << \" but was \" << BUComments.front());\n BOOST_CHECK_MESSAGE(BUComments.back() == exceptedAD,\n \"AD ought to have been \" << exceptedAD << \" when excessiveBlockSize = \" << excessiveAcceptDepth);\n excessiveBlockSize = 100000;\n excessiveAcceptDepth = 9999999 + 1;\n exceptedEB = \"EB0.1\";\n exceptedAD = \"AD9999999\";\n settingsToUserAgentString();\n BOOST_CHECK_MESSAGE(BUComments.front() == exceptedEB,\n \"EB ought to have been \" << exceptedEB << \" when excessiveBlockSize = \"\n << excessiveBlockSize << \" but was \" << BUComments.front());\n BOOST_CHECK_MESSAGE(BUComments.back() == exceptedAD,\n \"AD ought to have been \" << exceptedAD << \" when excessiveBlockSize = \" << excessiveAcceptDepth);\n excessiveBlockSize = 10000;\n exceptedEB = \"EB0\";\n settingsToUserAgentString();\n BOOST_CHECK_MESSAGE(BUComments.front() == exceptedEB,\n \"EB ought to have been \" << exceptedEB << \" when excessiveBlockSize = \"\n << excessiveBlockSize << \" but was \" << BUComments.front());\n excessiveBlockSize = 150000;\n exceptedEB = \"EB0.1\";\n settingsToUserAgentString();\n BOOST_CHECK_MESSAGE(BUComments.front() == exceptedEB,\n \"EB ought to have been rounded to \" << exceptedEB << \" when excessiveBlockSize = \"\n << excessiveBlockSize << \" but was \" << BUComments.front());\n excessiveBlockSize = 150000;\n exceptedEB = \"EB0.1\";\n settingsToUserAgentString();\n BOOST_CHECK_MESSAGE(BUComments.front() == exceptedEB,\n \"EB ought to have been rounded to \" << exceptedEB << \" when excessiveBlockSize = \"\n << excessiveBlockSize << \" but was \" << BUComments.front());\n\n \/\/ set back to defaults\n excessiveBlockSize = 1000000;\n excessiveAcceptDepth = 4;\n}\n\n\nBOOST_AUTO_TEST_CASE(excessiveChecks)\n{\n CBlock block;\n\n excessiveBlockSize = 16000000; \/\/ Ignore excessive block size when checking sigops and block effort\n\n \/\/ Check sigops values\n\n \/\/ Maintain compatibility with the old sigops calculator for blocks <= 1MB\n BOOST_CHECK_MESSAGE(false == CheckExcessive(block,BLOCKSTREAM_CORE_MAX_BLOCK_SIZE-1,BLOCKSTREAM_CORE_MAX_BLOCK_SIGOPS,100,100), \"improper sigops\");\n BOOST_CHECK_MESSAGE(false == CheckExcessive(block,BLOCKSTREAM_CORE_MAX_BLOCK_SIZE-1,BLOCKSTREAM_CORE_MAX_BLOCK_SIGOPS,100,100), \"improper sigops\");\n BOOST_CHECK_MESSAGE(false == CheckExcessive(block,BLOCKSTREAM_CORE_MAX_BLOCK_SIZE,BLOCKSTREAM_CORE_MAX_BLOCK_SIGOPS,100,100), \"improper sigops\");\n\n BOOST_CHECK_MESSAGE(true == CheckExcessive(block,BLOCKSTREAM_CORE_MAX_BLOCK_SIZE-1,BLOCKSTREAM_CORE_MAX_BLOCK_SIGOPS+1,100,100), \"improper sigops\");\n BOOST_CHECK_MESSAGE(true == CheckExcessive(block,BLOCKSTREAM_CORE_MAX_BLOCK_SIZE,BLOCKSTREAM_CORE_MAX_BLOCK_SIGOPS+1,100,100), \"improper sigops\");\n\n\n \/\/ Check sigops > 1MB.\n BOOST_CHECK_MESSAGE(false == CheckExcessive(block,1000000+1,(blockSigopsPerMb.value*2),100,100), \"improper sigops\");\n BOOST_CHECK_MESSAGE(true == CheckExcessive(block,1000000+1,(blockSigopsPerMb.value*2)+1,100,100), \"improper sigops\");\n BOOST_CHECK_MESSAGE(true == CheckExcessive(block,(2*1000000),(blockSigopsPerMb.value*2)+1,100,100), \"improper sigops\");\n BOOST_CHECK_MESSAGE(false == CheckExcessive(block,(2*1000000)+1,(blockSigopsPerMb.value*2)+1,100,100), \"improper sigops\");\n\n \n \/\/ Check tx size values\n maxTxSize.value = DEFAULT_LARGEST_TRANSACTION;\n\n \/\/ Within a 1 MB block, a 1MB transaction is not excessive\n BOOST_CHECK_MESSAGE(false == CheckExcessive(block,BLOCKSTREAM_CORE_MAX_BLOCK_SIZE,1,1,BLOCKSTREAM_CORE_MAX_BLOCK_SIZE), \"improper max tx\");\n\n \/\/ With a > 1 MB block, use the maxTxSize to determine\n BOOST_CHECK_MESSAGE(false == CheckExcessive(block,BLOCKSTREAM_CORE_MAX_BLOCK_SIZE+1,1,1,maxTxSize.value), \"improper max tx\");\n BOOST_CHECK_MESSAGE(true == CheckExcessive(block,BLOCKSTREAM_CORE_MAX_BLOCK_SIZE+1,1,1,maxTxSize.value+1), \"improper max tx\");\n\n\n}\n\n\nBOOST_AUTO_TEST_SUITE_END()\n<commit_msg>Added unit tests for emergent consesus validation functions.<commit_after>#include \"unlimited.h\"\n\n#include \"test\/test_bitcoin.h\"\n#include \"..\/consensus\/consensus.h\"\n\n#include <boost\/algorithm\/string.hpp>\n#include <boost\/test\/unit_test.hpp>\n#include <boost\/lexical_cast.hpp>\n\nusing namespace std;\n\n\/\/ Defined in rpc_tests.cpp not bitcoin-cli.cpp\nextern UniValue CallRPC(string strMethod);\n\nBOOST_FIXTURE_TEST_SUITE(excessiveblock_test, TestingSetup)\n\nBOOST_AUTO_TEST_CASE(rpc_excessive)\n{\n BOOST_CHECK_NO_THROW(CallRPC(\"getexcessiveblock\"));\n\n BOOST_CHECK_NO_THROW(CallRPC(\"getminingmaxblock\"));\n\n BOOST_CHECK_THROW(CallRPC(\"setexcessiveblock not_uint\"), runtime_error);\n BOOST_CHECK_THROW(CallRPC(\"setexcessiveblock 1000000 not_uint\"), boost::bad_lexical_cast);\n BOOST_CHECK_THROW(CallRPC(\"setexcessiveblock 1000000 -1\"), boost::bad_lexical_cast);\n BOOST_CHECK_THROW(CallRPC(\"setexcessiveblock -1 0\"), boost::bad_lexical_cast);\n\n BOOST_CHECK_THROW(CallRPC(\"setexcessiveblock 1000 1\"), runtime_error);\n BOOST_CHECK_NO_THROW(CallRPC(\"setminingmaxblock 1000\"));\n BOOST_CHECK_NO_THROW(CallRPC(\"setexcessiveblock 1000 1\"));\n\n BOOST_CHECK_THROW(CallRPC(\"setexcessiveblock 1000 0 0\"), runtime_error);\n\n BOOST_CHECK_THROW(CallRPC(\"setminingmaxblock\"), runtime_error);\n BOOST_CHECK_THROW(CallRPC(\"setminingmaxblock 100000\"), runtime_error);\n BOOST_CHECK_THROW(CallRPC(\"setminingmaxblock not_uint\"), boost::bad_lexical_cast);\n BOOST_CHECK_THROW(CallRPC(\"setminingmaxblock -1\"), boost::bad_lexical_cast);\n BOOST_CHECK_THROW(CallRPC(\"setminingmaxblock 0\"), runtime_error);\n BOOST_CHECK_THROW(CallRPC(\"setminingmaxblock 0 0\"), runtime_error);\n BOOST_CHECK_NO_THROW(CallRPC(\"setminingmaxblock 1000\"));\n BOOST_CHECK_NO_THROW(CallRPC(\"setminingmaxblock 101\"));\n \n}\n\nBOOST_AUTO_TEST_CASE(buip005)\n{\n string exceptedEB;\n string exceptedAD;\n excessiveBlockSize = 1000000;\n excessiveAcceptDepth = 9999999;\n exceptedEB = \"EB1\";\n exceptedAD = \"AD9999999\";\n settingsToUserAgentString();\n BOOST_CHECK_MESSAGE(BUComments.front() == exceptedEB,\n \"EB ought to have been \" << exceptedEB << \" when excessiveBlockSize = \"\n << excessiveBlockSize << \" but was \" << BUComments.front());\n BOOST_CHECK_MESSAGE(BUComments.back() == exceptedAD,\n \"AD ought to have been \" << exceptedAD << \" when excessiveBlockSize = \" << excessiveAcceptDepth);\n excessiveBlockSize = 100000;\n excessiveAcceptDepth = 9999999 + 1;\n exceptedEB = \"EB0.1\";\n exceptedAD = \"AD9999999\";\n settingsToUserAgentString();\n BOOST_CHECK_MESSAGE(BUComments.front() == exceptedEB,\n \"EB ought to have been \" << exceptedEB << \" when excessiveBlockSize = \"\n << excessiveBlockSize << \" but was \" << BUComments.front());\n BOOST_CHECK_MESSAGE(BUComments.back() == exceptedAD,\n \"AD ought to have been \" << exceptedAD << \" when excessiveBlockSize = \" << excessiveAcceptDepth);\n excessiveBlockSize = 10000;\n exceptedEB = \"EB0\";\n settingsToUserAgentString();\n BOOST_CHECK_MESSAGE(BUComments.front() == exceptedEB,\n \"EB ought to have been \" << exceptedEB << \" when excessiveBlockSize = \"\n << excessiveBlockSize << \" but was \" << BUComments.front());\n excessiveBlockSize = 150000;\n exceptedEB = \"EB0.1\";\n settingsToUserAgentString();\n BOOST_CHECK_MESSAGE(BUComments.front() == exceptedEB,\n \"EB ought to have been rounded to \" << exceptedEB << \" when excessiveBlockSize = \"\n << excessiveBlockSize << \" but was \" << BUComments.front());\n excessiveBlockSize = 150000;\n exceptedEB = \"EB0.1\";\n settingsToUserAgentString();\n BOOST_CHECK_MESSAGE(BUComments.front() == exceptedEB,\n \"EB ought to have been rounded to \" << exceptedEB << \" when excessiveBlockSize = \"\n << excessiveBlockSize << \" but was \" << BUComments.front());\n\n \/\/ set back to defaults\n excessiveBlockSize = 1000000;\n excessiveAcceptDepth = 4;\n}\n\n\nBOOST_AUTO_TEST_CASE(excessiveChecks)\n{\n CBlock block;\n\n excessiveBlockSize = 16000000; \/\/ Ignore excessive block size when checking sigops and block effort\n\n \/\/ Check sigops values\n\n \/\/ Maintain compatibility with the old sigops calculator for blocks <= 1MB\n BOOST_CHECK_MESSAGE(false == CheckExcessive(block,BLOCKSTREAM_CORE_MAX_BLOCK_SIZE-1,BLOCKSTREAM_CORE_MAX_BLOCK_SIGOPS,100,100), \"improper sigops\");\n BOOST_CHECK_MESSAGE(false == CheckExcessive(block,BLOCKSTREAM_CORE_MAX_BLOCK_SIZE-1,BLOCKSTREAM_CORE_MAX_BLOCK_SIGOPS,100,100), \"improper sigops\");\n BOOST_CHECK_MESSAGE(false == CheckExcessive(block,BLOCKSTREAM_CORE_MAX_BLOCK_SIZE,BLOCKSTREAM_CORE_MAX_BLOCK_SIGOPS,100,100), \"improper sigops\");\n\n BOOST_CHECK_MESSAGE(true == CheckExcessive(block,BLOCKSTREAM_CORE_MAX_BLOCK_SIZE-1,BLOCKSTREAM_CORE_MAX_BLOCK_SIGOPS+1,100,100), \"improper sigops\");\n BOOST_CHECK_MESSAGE(true == CheckExcessive(block,BLOCKSTREAM_CORE_MAX_BLOCK_SIZE,BLOCKSTREAM_CORE_MAX_BLOCK_SIGOPS+1,100,100), \"improper sigops\");\n\n\n \/\/ Check sigops > 1MB.\n BOOST_CHECK_MESSAGE(false == CheckExcessive(block,1000000+1,(blockSigopsPerMb.value*2),100,100), \"improper sigops\");\n BOOST_CHECK_MESSAGE(true == CheckExcessive(block,1000000+1,(blockSigopsPerMb.value*2)+1,100,100), \"improper sigops\");\n BOOST_CHECK_MESSAGE(true == CheckExcessive(block,(2*1000000),(blockSigopsPerMb.value*2)+1,100,100), \"improper sigops\");\n BOOST_CHECK_MESSAGE(false == CheckExcessive(block,(2*1000000)+1,(blockSigopsPerMb.value*2)+1,100,100), \"improper sigops\");\n\n \n \/\/ Check tx size values\n maxTxSize.value = DEFAULT_LARGEST_TRANSACTION;\n\n \/\/ Within a 1 MB block, a 1MB transaction is not excessive\n BOOST_CHECK_MESSAGE(false == CheckExcessive(block,BLOCKSTREAM_CORE_MAX_BLOCK_SIZE,1,1,BLOCKSTREAM_CORE_MAX_BLOCK_SIZE), \"improper max tx\");\n\n \/\/ With a > 1 MB block, use the maxTxSize to determine\n BOOST_CHECK_MESSAGE(false == CheckExcessive(block,BLOCKSTREAM_CORE_MAX_BLOCK_SIZE+1,1,1,maxTxSize.value), \"improper max tx\");\n BOOST_CHECK_MESSAGE(true == CheckExcessive(block,BLOCKSTREAM_CORE_MAX_BLOCK_SIZE+1,1,1,maxTxSize.value+1), \"improper max tx\");\n\n\n}\n\nBOOST_AUTO_TEST_CASE(check_validator_rule)\n{\n BOOST_CHECK( MiningAndExcessiveBlockValidatorRule(1000000, 1000000));\n BOOST_CHECK( MiningAndExcessiveBlockValidatorRule(16000000, 1000000));\n BOOST_CHECK( MiningAndExcessiveBlockValidatorRule(1000001, 1000000));\n\n BOOST_CHECK( ! MiningAndExcessiveBlockValidatorRule(1000000, 1000001));\n BOOST_CHECK( ! MiningAndExcessiveBlockValidatorRule(1000000, 16000000));\n\n BOOST_CHECK( MiningAndExcessiveBlockValidatorRule(1357, 1357));\n BOOST_CHECK( MiningAndExcessiveBlockValidatorRule(161616, 2222));\n BOOST_CHECK( MiningAndExcessiveBlockValidatorRule(88889, 88888));\n\n BOOST_CHECK( ! MiningAndExcessiveBlockValidatorRule(929292, 929293));\n BOOST_CHECK( ! MiningAndExcessiveBlockValidatorRule(4, 234245));\n}\n\nBOOST_AUTO_TEST_CASE(check_excessive_validator)\n{\n \/\/ fudge global variables....\n maxGeneratedBlock = 1000000;\n excessiveBlockSize = 888;\n\n unsigned int tmpExcessive = 1000000;\n std::string str;\n\n str = ExcessiveBlockValidator(tmpExcessive, NULL, true);\n BOOST_CHECK(str.empty());\n\n excessiveBlockSize = 888;\n str = ExcessiveBlockValidator(tmpExcessive, NULL, false);\n BOOST_CHECK(str.empty());\n\n str = ExcessiveBlockValidator(tmpExcessive, (unsigned int *) 42, true);\n BOOST_CHECK(str.empty());\n\n tmpExcessive = maxGeneratedBlock + 1;\n\n str = ExcessiveBlockValidator(tmpExcessive, NULL, true);\n BOOST_CHECK(str.empty());\n\n excessiveBlockSize = 888;\n str = ExcessiveBlockValidator(tmpExcessive, NULL, false);\n BOOST_CHECK(str.empty());\n\n str = ExcessiveBlockValidator(tmpExcessive, (unsigned int *) 42, true);\n BOOST_CHECK(str.empty());\n\n tmpExcessive = maxGeneratedBlock - 1;\n\n str = ExcessiveBlockValidator(tmpExcessive, NULL, true);\n BOOST_CHECK(! str.empty());\n\n str = ExcessiveBlockValidator(tmpExcessive, NULL, false);\n BOOST_CHECK(str.empty());\n\n str = ExcessiveBlockValidator(tmpExcessive, (unsigned int *) 42, true);\n BOOST_CHECK(! str.empty());\n}\n\nBOOST_AUTO_TEST_CASE(check_generated_block_validator)\n{\n \/\/ fudge global variables....\n maxGeneratedBlock = 888;\n excessiveBlockSize = 1000000;\n\n uint64_t tmpMGB = 1000000;\n std::string str;\n\n str = MiningBlockSizeValidator(tmpMGB, NULL, true);\n BOOST_CHECK(str.empty());\n\n maxGeneratedBlock = 8888881;\n str = MiningBlockSizeValidator(tmpMGB, NULL, false);\n BOOST_CHECK(str.empty());\n\n str = MiningBlockSizeValidator(tmpMGB, (uint64_t *) 42, true);\n BOOST_CHECK(str.empty());\n\n tmpMGB = excessiveBlockSize - 1;\n\n str = MiningBlockSizeValidator(tmpMGB, NULL, true);\n BOOST_CHECK(str.empty());\n\n maxGeneratedBlock = 8888881;\n str = MiningBlockSizeValidator(tmpMGB, NULL, false);\n BOOST_CHECK(str.empty());\n\n str = MiningBlockSizeValidator(tmpMGB, (uint64_t *) 42, true);\n BOOST_CHECK(str.empty());\n\n tmpMGB = excessiveBlockSize + 1;\n\n str = MiningBlockSizeValidator(tmpMGB, NULL, true);\n BOOST_CHECK(! str.empty());\n\n str = MiningBlockSizeValidator(tmpMGB, NULL, false);\n BOOST_CHECK(str.empty());\n\n str = MiningBlockSizeValidator(tmpMGB, (uint64_t *) 42, true);\n BOOST_CHECK(! str.empty());\n}\n\n\nBOOST_AUTO_TEST_SUITE_END()\n<|endoftext|>"} {"text":"<commit_before>#include \"Mocks.hpp\"\n\nusing namespace blackhole;\n\nTEST(verbose_logger_t, Class) {\n enum level : std::uint64_t { debug, info, warn, error };\n verbose_logger_t<level> log;\n UNUSED(log);\n}\n\nTEST(verbose_logger_t, OpenRecordByDefault) {\n enum level : std::uint64_t { debug, info, warn, error };\n std::unique_ptr<mock::frontend_t> frontend;\n\n verbose_logger_t<level> log;\n log.add_frontend(std::move(frontend));\n log::record_t record = log.open_record(level::debug);\n EXPECT_TRUE(record.valid());\n}\n\nTEST(verbose_logger_t, OpenRecordForValidVerbosityLevel) {\n enum class level : std::uint64_t { debug, info, warn, error };\n std::unique_ptr<mock::frontend_t> frontend;\n\n verbose_logger_t<level> log;\n log.add_frontend(std::move(frontend));\n log.set_filter(keyword::severity<level>() >= level::info);\n EXPECT_FALSE(log.open_record(level::debug).valid());\n EXPECT_TRUE(log.open_record(level::info).valid());\n EXPECT_TRUE(log.open_record(level::warn).valid());\n EXPECT_TRUE(log.open_record(level::error).valid());\n}\n\nTEST(verbose_logger_t, Manual) {\n enum level : std::uint64_t { debug, info, warn, error };\n verbose_logger_t<level> log;\n\n \/\/!@note: Factory starts here...\n auto formatter = std::make_unique<formatter::string_t>(\"[]: %(message)s [%(...L)s]\");\n auto sink = std::make_unique<sink::file_t<>>(\"\/dev\/stdout\");\n auto frontend = std::make_unique<frontend_t<formatter::string_t, sink::file_t<>>>(std::move(formatter), std::move(sink));\n \/\/!@note ... till here.\n log.add_frontend(std::move(frontend));\n\n \/\/!@note: Next lines can be hided via macro: LOG(log, debug, \"Message %s\", \"Hell\", { keyword::answer = 42, keyword::blah = \"WAT?\", keyword::make(\"urgent\", 1) });\n log::record_t record = log.open_record(level::error);\n if (record.valid()) {\n record.attributes[\"message\"] = { utils::format(\"Some message from: '%s'!\", \"Hell\") };\n \/\/ Add another attributes.\n log.push(std::move(record));\n }\n}\n\n\/\/!@todo: Make severity string mapper.\n\/\/!@todo: Specialization for `syslog_t` frontend. It's needed for providing loglevel to the `syslog_t`.\n<commit_msg>One todo less.<commit_after>#include \"Mocks.hpp\"\n\nusing namespace blackhole;\n\nTEST(verbose_logger_t, Class) {\n enum level : std::uint64_t { debug, info, warn, error };\n verbose_logger_t<level> log;\n UNUSED(log);\n}\n\nTEST(verbose_logger_t, OpenRecordByDefault) {\n enum level : std::uint64_t { debug, info, warn, error };\n std::unique_ptr<mock::frontend_t> frontend;\n\n verbose_logger_t<level> log;\n log.add_frontend(std::move(frontend));\n log::record_t record = log.open_record(level::debug);\n EXPECT_TRUE(record.valid());\n}\n\nTEST(verbose_logger_t, OpenRecordForValidVerbosityLevel) {\n enum class level : std::uint64_t { debug, info, warn, error };\n std::unique_ptr<mock::frontend_t> frontend;\n\n verbose_logger_t<level> log;\n log.add_frontend(std::move(frontend));\n log.set_filter(keyword::severity<level>() >= level::info);\n EXPECT_FALSE(log.open_record(level::debug).valid());\n EXPECT_TRUE(log.open_record(level::info).valid());\n EXPECT_TRUE(log.open_record(level::warn).valid());\n EXPECT_TRUE(log.open_record(level::error).valid());\n}\n\nTEST(verbose_logger_t, Manual) {\n enum level : std::uint64_t { debug, info, warn, error };\n verbose_logger_t<level> log;\n\n \/\/!@note: Factory starts here...\n auto formatter = std::make_unique<formatter::string_t>(\"[]: %(message)s [%(...L)s]\");\n auto sink = std::make_unique<sink::file_t<>>(\"\/dev\/stdout\");\n auto frontend = std::make_unique<frontend_t<formatter::string_t, sink::file_t<>>>(std::move(formatter), std::move(sink));\n \/\/!@note ... till here.\n log.add_frontend(std::move(frontend));\n\n \/\/!@note: Next lines can be hided via macro: LOG(log, debug, \"Message %s\", \"Hell\", { keyword::answer = 42, keyword::blah = \"WAT?\", keyword::make(\"urgent\", 1) });\n log::record_t record = log.open_record(level::error);\n if (record.valid()) {\n record.attributes[\"message\"] = { utils::format(\"Some message from: '%s'!\", \"Hell\") };\n \/\/ Add another attributes.\n log.push(std::move(record));\n }\n}\n\n\/\/!@todo: Make severity string mapper.\n<|endoftext|>"} {"text":"<commit_before>\/*\n * Copyright 2009-2018 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#define BOOST_TEST_MAIN\n\n#define BOOST_TEST_MODULE graphalgorithm_test\n#include <boost\/test\/unit_test.hpp>\n#include <unordered_map>\n#include <vector>\n#include <votca\/tools\/graph.h>\n#include <votca\/tools\/graph_bf_visitor.h>\n#include <votca\/tools\/graphalgorithm.h>\n#include <votca\/tools\/graphdistvisitor.h>\n#include <votca\/tools\/graphnode.h>\n\nusing namespace std;\nusing namespace votca::tools;\n\nusing namespace boost;\nusing namespace boost::unit_test;\n\nBOOST_AUTO_TEST_SUITE(graphalgorithm_test)\n\n\nBOOST_AUTO_TEST_CASE(single_network_algorithm_test) {\n {\n \/\/ In this test we add two nodes and an edge describing\n \/\/ their connection thus the singleNetwork function will\n \/\/ return true.\n\n \/\/ Create edge\n Edge ed(0, 1);\n vector<Edge> edges;\n edges.push_back(ed);\n\n \/\/ Create Graph nodes\n GraphNode gn1;\n GraphNode gn2;\n\n unordered_map<int, GraphNode> nodes;\n nodes[0] = gn1;\n nodes[1] = gn2;\n\n Graph g(edges, nodes);\n\n Graph_BF_Visitor gb_v;\n\n BOOST_CHECK(gb_v.queEmpty());\n BOOST_CHECK_THROW(gb_v.exec(g, ed), runtime_error);\n\n bool single_n = singleNetwork(g, gb_v);\n BOOST_CHECK(single_n);\n BOOST_CHECK(gb_v.queEmpty());\n\n Graph_BF_Visitor gb_v2;\n gb_v2.setStartingVertex(2);\n BOOST_CHECK_THROW(singleNetwork(g, gb_v2), invalid_argument);\n }\n\n {\n\n \/\/ In this test we add 3 nodes but only one edge\n \/\/ this means that one of the nodes will not be\n \/\/ attached to the other two. Thus the singleNetwork\n \/\/ function should return false.\n\n \/\/ Create edge\n Edge ed(0, 1);\n vector<Edge> edges;\n edges.push_back(ed);\n\n \/\/ Create Graph nodes\n GraphNode gn1;\n GraphNode gn2;\n GraphNode gn3;\n\n unordered_map<int, GraphNode> nodes;\n nodes[0] = gn1;\n nodes[1] = gn2;\n nodes[2] = gn3;\n\n Graph g(edges, nodes);\n\n Graph_BF_Visitor gb_v;\n\n BOOST_CHECK(gb_v.queEmpty());\n BOOST_CHECK_THROW(gb_v.exec(g, ed), runtime_error);\n\n bool single_n = singleNetwork(g, gb_v);\n BOOST_CHECK(!single_n);\n BOOST_CHECK(gb_v.queEmpty());\n }\n}\n\nBOOST_AUTO_TEST_CASE(decoupleIsolatedSubGraphs_algorithm_test) {\n {\n \/\/ In this test we add two nodes and an edge describing\n \/\/ their connection\n\n \/\/ Create edge\n Edge ed(0, 1);\n vector<Edge> edges;\n edges.push_back(ed);\n\n \/\/ Create Graph nodes\n GraphNode gn1;\n GraphNode gn2;\n\n unordered_map<int, GraphNode> nodes;\n nodes[0] = gn1;\n nodes[1] = gn2;\n\n Graph g(edges, nodes);\n\n auto subGraphs = decoupleIsolatedSubGraphs(g);\n\n BOOST_CHECK_EQUAL(subGraphs.size(), 1);\n BOOST_CHECK_EQUAL(*(subGraphs.at(0)), g);\n }\n\n {\n\n \/\/ Create edge\n \/\/ 2\n \/\/ |\n \/\/ 0 - 1 - 3\n \/\/ |\n \/\/ 4\n\n Edge ed1(0, 1);\n Edge ed2(1, 2);\n Edge ed3(1, 3);\n Edge ed4(1, 4);\n\n \/\/\n \/\/ 5 - 6\n \/\/\n Edge ed5(5, 6);\n\n vector<Edge> edges;\n edges.push_back(ed1);\n edges.push_back(ed2);\n edges.push_back(ed3);\n edges.push_back(ed4);\n edges.push_back(ed5);\n\n \/\/ Create Graph nodes\n GraphNode gn1;\n GraphNode gn2;\n GraphNode gn3;\n GraphNode gn4;\n GraphNode gn5;\n GraphNode gn6;\n GraphNode gn7;\n\n unordered_map<int, GraphNode> nodes;\n nodes[0] = gn1;\n nodes[1] = gn2;\n nodes[2] = gn3;\n nodes[3] = gn4;\n nodes[4] = gn5;\n nodes[5] = gn6;\n nodes[6] = gn7;\n\n Graph g(edges, nodes);\n vector<std::shared_ptr<Graph>> sub_graphs = decoupleIsolatedSubGraphs(g);\n BOOST_CHECK_EQUAL(sub_graphs.size(), 2);\n\n \/\/ Create sub graphs to compare with the graphs stored in 'sub_graphs'\n\n vector<Edge> sub_graph1_edges;\n sub_graph1_edges.push_back(ed1);\n sub_graph1_edges.push_back(ed2);\n sub_graph1_edges.push_back(ed3);\n sub_graph1_edges.push_back(ed4);\n\n vector<Edge> sub_graph2_edges;\n sub_graph2_edges.push_back(ed5);\n\n unordered_map<int, GraphNode> sub_graph1_nodes;\n sub_graph1_nodes[0] = gn1;\n sub_graph1_nodes[1] = gn2;\n sub_graph1_nodes[2] = gn3;\n sub_graph1_nodes[3] = gn4;\n sub_graph1_nodes[4] = gn5;\n\n unordered_map<int, GraphNode> sub_graph2_nodes;\n sub_graph2_nodes[0] = gn6;\n sub_graph2_nodes[1] = gn7;\n\n Graph sub_graph1(sub_graph1_edges, sub_graph1_nodes);\n Graph sub_graph2(sub_graph2_edges, sub_graph2_nodes);\n\n \/\/ Cycle sub_graphs\n bool sub_graph1_found = false;\n bool sub_graph2_found = false;\n\n for (auto graph_sub_it = sub_graphs.begin();\n graph_sub_it != sub_graphs.end(); ++graph_sub_it) {\n if (**graph_sub_it == sub_graph1) sub_graph1_found = true;\n if (**graph_sub_it == sub_graph2) sub_graph2_found = true;\n }\n BOOST_CHECK(sub_graph1_found);\n BOOST_CHECK(sub_graph2_found);\n }\n}\n\nBOOST_AUTO_TEST_CASE(structureid_test) {\n {\n\n \/\/ Create edge\n Edge ed(0, 1);\n Edge ed1(1, 2);\n Edge ed2(2, 3);\n Edge ed3(3, 4);\n Edge ed4(4, 5);\n Edge ed5(5, 0);\n Edge ed6(3, 6);\n\n vector<Edge> edges;\n edges.push_back(ed);\n edges.push_back(ed1);\n edges.push_back(ed2);\n edges.push_back(ed3);\n edges.push_back(ed4);\n edges.push_back(ed5);\n edges.push_back(ed6);\n\n \/\/ Create Graph nodes\n GraphNode gn1;\n GraphNode gn2;\n GraphNode gn3;\n GraphNode gn4;\n GraphNode gn5;\n GraphNode gn6;\n GraphNode gn7;\n\n unordered_map<int, GraphNode> nodes;\n nodes[0] = gn1;\n nodes[1] = gn2;\n nodes[2] = gn3;\n nodes[3] = gn4;\n nodes[4] = gn5;\n nodes[5] = gn6;\n nodes[6] = gn7;\n\n Graph g(edges, nodes);\n\n auto structId = findStructureId<GraphDistVisitor>(g);\n\n string answer = \"Dist0Dist1Dist1Dist1Dist2Dist2Dist3\";\n BOOST_CHECK_EQUAL(structId, answer);\n }\n}\n\nBOOST_AUTO_TEST_SUITE_END()\n<commit_msg>Added reduced graph test<commit_after>\/*\n * Copyright 2009-2018 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#define BOOST_TEST_MAIN\n\n#define BOOST_TEST_MODULE graphalgorithm_test\n#include <boost\/test\/unit_test.hpp>\n#include <memory>\n#include <unordered_map>\n#include <vector>\n#include <votca\/tools\/graph.h>\n#include <votca\/tools\/reducedgraph.h>\n#include <votca\/tools\/graph_bf_visitor.h>\n#include <votca\/tools\/graphalgorithm.h>\n#include <votca\/tools\/graphdistvisitor.h>\n#include <votca\/tools\/graphnode.h>\n\nusing namespace std;\nusing namespace votca::tools;\n\nusing namespace boost;\nusing namespace boost::unit_test;\n\nBOOST_AUTO_TEST_SUITE(graphalgorithm_test)\n\n\nBOOST_AUTO_TEST_CASE(single_network_algorithm_test) {\n {\n \/\/ In this test we add two nodes and an edge describing\n \/\/ their connection thus the singleNetwork function will\n \/\/ return true.\n\n \/\/ Create edge\n Edge ed(0, 1);\n vector<Edge> edges;\n edges.push_back(ed);\n\n \/\/ Create Graph nodes\n GraphNode gn1;\n GraphNode gn2;\n\n unordered_map<int, GraphNode> nodes;\n nodes[0] = gn1;\n nodes[1] = gn2;\n\n Graph g(edges, nodes);\n\n Graph_BF_Visitor gb_v;\n\n BOOST_CHECK(gb_v.queEmpty());\n \/\/gb_v.exec(g,ed);\n BOOST_CHECK_THROW(gb_v.exec(g, ed), runtime_error);\n\n bool single_n = singleNetwork(g, gb_v);\n cerr << \"is single network \" << single_n << endl;\n BOOST_CHECK(single_n);\n BOOST_CHECK(gb_v.queEmpty());\n\n Graph_BF_Visitor gb_v2;\n gb_v2.setStartingVertex(2);\n BOOST_CHECK_THROW(singleNetwork(g, gb_v2), invalid_argument);\n }\n\n {\n\n \/\/ In this test we add 3 nodes but only one edge\n \/\/ this means that one of the nodes will not be\n \/\/ attached to the other two. Thus the singleNetwork\n \/\/ function should return false.\n\n \/\/ Create edge\n Edge ed(0, 1);\n vector<Edge> edges;\n edges.push_back(ed);\n\n \/\/ Create Graph nodes\n GraphNode gn1;\n GraphNode gn2;\n GraphNode gn3;\n\n unordered_map<int, GraphNode> nodes;\n nodes[0] = gn1;\n nodes[1] = gn2;\n nodes[2] = gn3;\n\n Graph g(edges, nodes);\n\n Graph_BF_Visitor gb_v;\n\n BOOST_CHECK(gb_v.queEmpty());\n BOOST_CHECK_THROW(gb_v.exec(g, ed), runtime_error);\n\n bool single_n = singleNetwork(g, gb_v);\n BOOST_CHECK(!single_n);\n BOOST_CHECK(gb_v.queEmpty());\n }\n}\n\nBOOST_AUTO_TEST_CASE(reduceGraph_algorithm_test) {\n {\n \/\/ Create edge\n \/\/ 2\n \/\/ |\n \/\/ 0 - 1 - 3\n \/\/ |\n \/\/ 4\n\n Edge ed1(0, 1);\n Edge ed2(1, 2);\n Edge ed3(1, 3);\n Edge ed4(1, 4);\n\n \/\/\n \/\/ 5 - 6\n \/\/\n Edge ed5(5, 6);\n\n vector<Edge> edges;\n edges.push_back(ed1);\n edges.push_back(ed2);\n edges.push_back(ed3);\n edges.push_back(ed4);\n edges.push_back(ed5);\n\n \/\/ Create Graph nodes\n GraphNode gn1;\n GraphNode gn2;\n GraphNode gn3;\n GraphNode gn4;\n GraphNode gn5;\n GraphNode gn6;\n GraphNode gn7;\n\n\n \/\/\n \/\/ 5 - 6\n \/\/\n Edge ed5(5, 6);\n\n vector<Edge> edges;\n edges.push_back(ed1);\n edges.push_back(ed2);\n edges.push_back(ed3);\n edges.push_back(ed4);\n edges.push_back(ed5);\n\n \/\/ Create Graph nodes\n GraphNode gn1;\n GraphNode gn2;\n GraphNode gn3;\n GraphNode gn4;\n GraphNode gn5;\n GraphNode gn6;\n GraphNode gn7;\n\n unordered_map<int, GraphNode> nodes;\n nodes[0] = gn1;\n nodes[1] = gn2;\n nodes[2] = gn3;\n nodes[3] = gn4;\n nodes[4] = gn5;\n nodes[5] = gn6;\n nodes[6] = gn7;\n\n Graph g(edges, nodes);\n vector<std::shared_ptr<Graph>> sub_graphs = decoupleIsolatedSubGraphs(g);\n BOOST_CHECK_EQUAL(sub_graphs.size(), 2);\n\n \/\/ Create sub graphs to compare with the graphs stored in 'sub_graphs'\n\n vector<Edge> sub_graph1_edges;\n sub_graph1_edges.push_back(ed1);\n sub_graph1_edges.push_back(ed2);\n sub_graph1_edges.push_back(ed3);\n sub_graph1_edges.push_back(ed4);\n\n vector<Edge> sub_graph2_edges;\n sub_graph2_edges.push_back(ed5);\n\n unordered_map<int, GraphNode> sub_graph1_nodes;\n sub_graph1_nodes[0] = gn1;\n sub_graph1_nodes[1] = gn2;\n sub_graph1_nodes[2] = gn3;\n sub_graph1_nodes[3] = gn4;\n sub_graph1_nodes[4] = gn5;\n\n unordered_map<int, GraphNode> sub_graph2_nodes;\n sub_graph2_nodes[0] = gn6;\n sub_graph2_nodes[1] = gn7;\n\n Graph sub_graph1(sub_graph1_edges, sub_graph1_nodes);\n Graph sub_graph2(sub_graph2_edges, sub_graph2_nodes);\n\n \/\/ Cycle sub_graphs\n bool sub_graph1_found = false;\n bool sub_graph2_found = false;\n\n for (auto graph_sub_it = sub_graphs.begin();\n graph_sub_it != sub_graphs.end(); ++graph_sub_it) {\n if (**graph_sub_it == sub_graph1) sub_graph1_found = true;\n if (**graph_sub_it == sub_graph2) sub_graph2_found = true;\n }\n BOOST_CHECK(sub_graph1_found);\n BOOST_CHECK(sub_graph2_found);\n }\n}\n\nBOOST_AUTO_TEST_CASE(structureid_test) {\n {\n\n \/\/ Create edge\n Edge ed(0, 1);\n Edge ed1(1, 2);\n Edge ed2(2, 3);\n Edge ed3(3, 4);\n Edge ed4(4, 5);\n Edge ed5(5, 0);\n Edge ed6(3, 6);\n\n vector<Edge> edges;\n edges.push_back(ed);\n edges.push_back(ed1);\n edges.push_back(ed2);\n edges.push_back(ed3);\n edges.push_back(ed4);\n edges.push_back(ed5);\n edges.push_back(ed6);\n\n \/\/ Create Graph nodes\n GraphNode gn1;\n GraphNode gn2;\n GraphNode gn3;\n GraphNode gn4;\n GraphNode gn5;\n GraphNode gn6;\n GraphNode gn7;\n\n unordered_map<int, GraphNode> nodes;\n nodes[0] = gn1;\n nodes[1] = gn2;\n nodes[2] = gn3;\n nodes[3] = gn4;\n nodes[4] = gn5;\n nodes[5] = gn6;\n nodes[6] = gn7;\n\n Graph g(edges, nodes);\n\n auto structId = findStructureId<GraphDistVisitor>(g);\n\n string answer = \"Dist0Dist1Dist1Dist1Dist2Dist2Dist3\";\n BOOST_CHECK_EQUAL(structId, answer);\n }\n}\n\nBOOST_AUTO_TEST_SUITE_END()\n\/*\n * Copyright 2009-2018 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#define BOOST_TEST_MAIN\n\n#define BOOST_TEST_MODULE graphalgorithm_test\n#include <boost\/test\/unit_test.hpp>\n#include <unordered_map>\n#include <vector>\n#include <votca\/tools\/graph.h>\n#include <votca\/tools\/graph_bf_visitor.h>\n#include <votca\/tools\/graphalgorithm.h>\n#include <votca\/tools\/graphdistvisitor.h>\n#include <votca\/tools\/graphnode.h>\n\nusing namespace std;\nusing namespace votca::tools;\n\nusing namespace boost;\nusing namespace boost::unit_test;\n\nBOOST_AUTO_TEST_SUITE(graphalgorithm_test)\n\n\nBOOST_AUTO_TEST_CASE(single_network_algorithm_test) {\n {\n \/\/ In this test we add two nodes and an edge describing\n unordered_map<int, GraphNode> nodes;\n nodes[0] = gn1;\n nodes[1] = gn2;\n nodes[2] = gn3;\n nodes[3] = gn4;\n nodes[4] = gn5;\n nodes[5] = gn6;\n nodes[6] = gn7;\n\n Graph g(edges, nodes);\n vector<std::shared_ptr<Graph>> sub_graphs = decoupleIsolatedSubGraphs(g);\n BOOST_CHECK_EQUAL(sub_graphs.size(), 2);\n\n \/\/ Create sub graphs to compare with the graphs stored in 'sub_graphs'\n\n vector<Edge> sub_graph1_edges;\n sub_graph1_edges.push_back(ed1);\n sub_graph1_edges.push_back(ed2);\n sub_graph1_edges.push_back(ed3);\n sub_graph1_edges.push_back(ed4);\n\n vector<Edge> sub_graph2_edges;\n sub_graph2_edges.push_back(ed5);\n\n unordered_map<int, GraphNode> sub_graph1_nodes;\n sub_graph1_nodes[0] = gn1;\n sub_graph1_nodes[1] = gn2;\n sub_graph1_nodes[2] = gn3;\n sub_graph1_nodes[3] = gn4;\n sub_graph1_nodes[4] = gn5;\n\n unordered_map<int, GraphNode> sub_graph2_nodes;\n sub_graph2_nodes[0] = gn6;\n sub_graph2_nodes[1] = gn7;\n\n Graph sub_graph1(sub_graph1_edges, sub_graph1_nodes);\n Graph sub_graph2(sub_graph2_edges, sub_graph2_nodes);\n\n \/\/ Cycle sub_graphs\n bool sub_graph1_found = false;\n bool sub_graph2_found = false;\n\n for (auto graph_sub_it = sub_graphs.begin();\n graph_sub_it != sub_graphs.end(); ++graph_sub_it) {\n if (**graph_sub_it == sub_graph1) sub_graph1_found = true;\n if (**graph_sub_it == sub_graph2) sub_graph2_found = true;\n }\n BOOST_CHECK(sub_graph1_found);\n BOOST_CHECK(sub_graph2_found);\n }\n}\n\nBOOST_AUTO_TEST_CASE(structureid_test) {\n {\n\n \/\/ Create edge\n Edge ed(0, 1);\n Edge ed1(1, 2);\n Edge ed2(2, 3);\n Edge ed3(3, 4);\n Edge ed4(4, 5);\n Edge ed5(5, 0);\n Edge ed6(3, 6);\n\n vector<Edge> edges;\n edges.push_back(ed);\n edges.push_back(ed1);\n edges.push_back(ed2);\n edges.push_back(ed3);\n edges.push_back(ed4);\n edges.push_back(ed5);\n edges.push_back(ed6);\n\n \/\/ Create Graph nodes\n GraphNode gn1;\n GraphNode gn2;\n GraphNode gn3;\n GraphNode gn4;\n GraphNode gn5;\n GraphNode gn6;\n GraphNode gn7;\n\n unordered_map<int, GraphNode> nodes;\n nodes[0] = gn1;\n nodes[1] = gn2;\n nodes[2] = gn3;\n nodes[3] = gn4;\n nodes[4] = gn5;\n nodes[5] = gn6;\n nodes[6] = gn7;\n\n Graph g(edges, nodes);\n\n auto structId = findStructureId<GraphDistVisitor>(g);\n\n string answer = \"Dist0Dist1Dist1Dist1Dist2Dist2Dist3\";\n BOOST_CHECK_EQUAL(structId, answer);\n }\n}\n\nBOOST_AUTO_TEST_SUITE_END()\n<|endoftext|>"} {"text":"<commit_before>#include <map>\n#include <stack>\n\n#include \"splice-pool.hpp\"\n#include \"gtest\/gtest.h\"\n\nnamespace\n{\n const std::vector<int> values{3, 1, 4, 1, 5, 9};\n\n std::vector<splicer::Node<int>> makeNodes()\n {\n std::vector<splicer::Node<int>> nodes(values.size());\n\n for (std::size_t i(0); i < values.size(); ++i)\n {\n nodes[i].val() = values[i];\n }\n\n return nodes;\n }\n\n splicer::Stack<int> makeStack(std::vector<splicer::Node<int>>& nodes)\n {\n splicer::Stack<int> stack;\n\n for (std::size_t i(0); i < nodes.size(); ++i)\n {\n stack.push(&nodes[i]);\n }\n\n return stack;\n }\n\n \/\/ If we're checking stack contents we don't care about the order. This\n \/\/ utility tracks that all values are present.\n template<typename T>\n class Counter\n {\n public:\n void add(T val) { ++m_counts[val]; }\n\n bool sub(T val)\n {\n if (!m_counts.count(val)) return false;\n if (!--m_counts[val]) m_counts.erase(val);\n\n return true;\n }\n\n bool empty() const { return m_counts.empty(); }\n\n private:\n std::map<T, int> m_counts;\n };\n}\n\nTEST(Stack, PopEmpty)\n{\n splicer::Stack<int> stack;\n splicer::Node<int>* node(nullptr);\n\n EXPECT_TRUE(stack.empty());\n EXPECT_EQ(stack.size(), 0);\n EXPECT_NO_THROW(node = stack.pop());\n\n EXPECT_EQ(node, nullptr);\n EXPECT_TRUE(stack.empty());\n EXPECT_EQ(stack.size(), 0);\n}\n\nTEST(Stack, PushNode)\n{\n splicer::Stack<int> stack;\n\n const int value(4);\n\n splicer::Node<int> node;\n node.val() = value;\n\n EXPECT_TRUE(stack.empty());\n\n stack.push(&node);\n EXPECT_FALSE(stack.empty());\n EXPECT_EQ(stack.size(), 1);\n\n EXPECT_EQ(stack.pop()->val(), value);\n EXPECT_TRUE(stack.empty());\n}\n\nTEST(Stack, PushStack)\n{\n splicer::Stack<int> stack;\n splicer::Stack<int> other;\n\n const int value(4);\n\n splicer::Node<int> node;\n node.val() = value;\n\n other.push(&node);\n EXPECT_FALSE(other.empty());\n EXPECT_EQ(other.size(), 1);\n\n EXPECT_TRUE(stack.empty());\n EXPECT_EQ(stack.size(), 0);\n\n stack.push(other);\n EXPECT_FALSE(stack.empty());\n EXPECT_EQ(stack.size(), 1);\n EXPECT_TRUE(other.empty());\n EXPECT_EQ(other.size(), 0);\n\n ASSERT_EQ(stack.pop()->val(), value);\n EXPECT_TRUE(stack.empty());\n EXPECT_TRUE(other.empty());\n EXPECT_EQ(stack.size(), 0);\n EXPECT_EQ(other.size(), 0);\n}\n\nTEST(Stack, PopStackEmpty)\n{\n splicer::Stack<int> stack;\n splicer::Stack<int> other;\n\n EXPECT_NO_THROW(other = stack.popStack(1));\n EXPECT_TRUE(stack.empty());\n EXPECT_TRUE(other.empty());\n\n EXPECT_NO_THROW(other = stack.popStack(0));\n EXPECT_TRUE(stack.empty());\n EXPECT_TRUE(other.empty());\n}\n\nTEST(Stack, PopStackZero)\n{\n std::vector<splicer::Node<int>> nodes(makeNodes());\n splicer::Stack<int> stack(makeStack(nodes));\n\n const std::size_t total(values.size());\n\n splicer::Stack<int> other(stack.popStack(0));\n\n ASSERT_EQ(stack.size(), total);\n ASSERT_FALSE(stack.empty());\n\n ASSERT_EQ(other.size(), 0);\n ASSERT_TRUE(other.empty());\n}\n\nTEST(Stack, PopStackPartial)\n{\n std::vector<splicer::Node<int>> nodes(makeNodes());\n splicer::Stack<int> stack(makeStack(nodes));\n\n const std::size_t total(values.size());\n\n splicer::Stack<int> other(stack.popStack(2));\n\n EXPECT_EQ(stack.size(), total - 2);\n EXPECT_EQ(other.size(), 2);\n\n Counter<int> stackCounter;\n Counter<int> otherCounter;\n\n for (std::size_t i(0); i < values.size(); ++i)\n {\n if (i < total - 2) stackCounter.add(values[i]);\n else otherCounter.add(values[i]);\n }\n\n while (!other.empty())\n {\n ASSERT_TRUE(otherCounter.sub(other.pop()->val()));\n }\n\n while (!stack.empty())\n {\n ASSERT_TRUE(stackCounter.sub(stack.pop()->val()));\n }\n\n ASSERT_TRUE(stack.empty());\n ASSERT_TRUE(other.empty());\n\n ASSERT_TRUE(stackCounter.empty());\n ASSERT_TRUE(otherCounter.empty());\n}\n\nTEST(Stack, PopStackFull)\n{\n \/\/ TODO\n}\n\nTEST(Stack, PopStackTooMany)\n{\n \/\/ TODO\n}\n\nTEST(Stack, PushPopSingle)\n{\n std::stack<int> validator;\n splicer::Stack<int> stack;\n std::vector<splicer::Node<int>> nodes(makeNodes());\n\n auto doPush([&](std::size_t i)->void\n {\n const int value(values.at(i));\n splicer::Node<int>& node(nodes.at(i));\n\n ASSERT_EQ(value, node.val());\n\n validator.push(value);\n stack.push(&node);\n\n ASSERT_FALSE(validator.empty());\n ASSERT_FALSE(stack.empty());\n ASSERT_EQ(stack.size(), i + 1);\n ASSERT_EQ(stack.size(), validator.size());\n });\n\n auto doPop([&](std::size_t i)->void\n {\n const int value(values.at(i));\n\n ASSERT_EQ(value, validator.top());\n validator.pop();\n\n ASSERT_EQ(value, stack.pop()->val());\n ASSERT_EQ(validator.empty(), stack.empty());\n });\n\n ASSERT_TRUE(validator.empty());\n ASSERT_TRUE(stack.empty());\n\n for (std::size_t i(0); i < values.size(); ++i) doPush(i);\n\n ASSERT_FALSE(validator.empty());\n ASSERT_FALSE(stack.empty());\n\n for (std::size_t i(values.size() - 1); i < values.size(); --i) doPop(i);\n\n ASSERT_TRUE(validator.empty());\n ASSERT_TRUE(stack.empty());\n}\n\nTEST(Stack, PushPopOtherStack)\n{\n std::stack<int> validator;\n splicer::Stack<int> stack;\n std::vector<splicer::Node<int>> nodes(makeNodes());\n\n auto doPush([&]()->void\n {\n splicer::Stack<int> other;\n\n for (auto& node : nodes)\n {\n other.push(&node);\n validator.push(node.val());\n }\n\n ASSERT_FALSE(other.empty());\n ASSERT_TRUE(stack.empty());\n\n stack.push(other);\n\n ASSERT_TRUE(other.empty());\n ASSERT_FALSE(stack.empty());\n\n ASSERT_FALSE(validator.empty());\n });\n\n auto doPop([&](std::size_t i)->void\n {\n const int value(values.at(i));\n\n ASSERT_EQ(value, validator.top());\n validator.pop();\n\n ASSERT_EQ(value, stack.pop()->val());\n ASSERT_EQ(validator.empty(), stack.empty());\n });\n\n ASSERT_TRUE(validator.empty());\n ASSERT_TRUE(stack.empty());\n\n doPush();\n\n ASSERT_FALSE(validator.empty());\n ASSERT_FALSE(stack.empty());\n\n for (std::size_t i(values.size() - 1); i < values.size(); --i) doPop(i);\n\n ASSERT_TRUE(validator.empty());\n ASSERT_TRUE(stack.empty());\n}\n\n<commit_msg>Add the rest of the popStack test cases.<commit_after>#include <map>\n#include <stack>\n\n#include \"splice-pool.hpp\"\n#include \"gtest\/gtest.h\"\n\nnamespace\n{\n const std::vector<int> values{3, 1, 4, 1, 5, 9};\n\n std::vector<splicer::Node<int>> makeNodes()\n {\n std::vector<splicer::Node<int>> nodes(values.size());\n\n for (std::size_t i(0); i < values.size(); ++i)\n {\n nodes[i].val() = values[i];\n }\n\n return nodes;\n }\n\n splicer::Stack<int> makeStack(std::vector<splicer::Node<int>>& nodes)\n {\n splicer::Stack<int> stack;\n\n for (std::size_t i(0); i < nodes.size(); ++i)\n {\n stack.push(&nodes[i]);\n }\n\n return stack;\n }\n\n \/\/ If we're checking stack contents we don't care about the order. This\n \/\/ utility tracks that all values are present.\n template<typename T>\n class Counter\n {\n public:\n void add(T val) { ++m_counts[val]; }\n\n bool sub(T val)\n {\n if (!m_counts.count(val)) return false;\n if (!--m_counts[val]) m_counts.erase(val);\n\n return true;\n }\n\n bool empty() const { return m_counts.empty(); }\n\n private:\n std::map<T, int> m_counts;\n };\n}\n\nTEST(Stack, PopEmpty)\n{\n splicer::Stack<int> stack;\n splicer::Node<int>* node(nullptr);\n\n EXPECT_TRUE(stack.empty());\n EXPECT_EQ(stack.size(), 0);\n EXPECT_NO_THROW(node = stack.pop());\n\n EXPECT_EQ(node, nullptr);\n EXPECT_TRUE(stack.empty());\n EXPECT_EQ(stack.size(), 0);\n}\n\nTEST(Stack, PushNode)\n{\n splicer::Stack<int> stack;\n\n const int value(4);\n\n splicer::Node<int> node;\n node.val() = value;\n\n EXPECT_TRUE(stack.empty());\n\n stack.push(&node);\n EXPECT_FALSE(stack.empty());\n EXPECT_EQ(stack.size(), 1);\n\n EXPECT_EQ(stack.pop()->val(), value);\n EXPECT_TRUE(stack.empty());\n}\n\nTEST(Stack, PushStack)\n{\n splicer::Stack<int> stack;\n splicer::Stack<int> other;\n\n const int value(4);\n\n splicer::Node<int> node;\n node.val() = value;\n\n other.push(&node);\n EXPECT_FALSE(other.empty());\n EXPECT_EQ(other.size(), 1);\n\n EXPECT_TRUE(stack.empty());\n EXPECT_EQ(stack.size(), 0);\n\n stack.push(other);\n EXPECT_FALSE(stack.empty());\n EXPECT_EQ(stack.size(), 1);\n EXPECT_TRUE(other.empty());\n EXPECT_EQ(other.size(), 0);\n\n ASSERT_EQ(stack.pop()->val(), value);\n EXPECT_TRUE(stack.empty());\n EXPECT_TRUE(other.empty());\n EXPECT_EQ(stack.size(), 0);\n EXPECT_EQ(other.size(), 0);\n}\n\nTEST(Stack, PopStackEmpty)\n{\n splicer::Stack<int> stack;\n splicer::Stack<int> other;\n\n EXPECT_NO_THROW(other = stack.popStack(1));\n EXPECT_TRUE(stack.empty());\n EXPECT_TRUE(other.empty());\n\n EXPECT_NO_THROW(other = stack.popStack(0));\n EXPECT_TRUE(stack.empty());\n EXPECT_TRUE(other.empty());\n}\n\nTEST(Stack, PopStackZero)\n{\n std::vector<splicer::Node<int>> nodes(makeNodes());\n splicer::Stack<int> stack(makeStack(nodes));\n\n const std::size_t total(values.size());\n\n splicer::Stack<int> other(stack.popStack(0));\n\n ASSERT_EQ(stack.size(), total);\n ASSERT_FALSE(stack.empty());\n\n ASSERT_EQ(other.size(), 0);\n ASSERT_TRUE(other.empty());\n}\n\nTEST(Stack, PopStackPartial)\n{\n std::vector<splicer::Node<int>> nodes(makeNodes());\n splicer::Stack<int> stack(makeStack(nodes));\n\n const std::size_t total(values.size());\n\n splicer::Stack<int> other(stack.popStack(2));\n\n EXPECT_EQ(stack.size(), total - 2);\n EXPECT_EQ(other.size(), 2);\n\n Counter<int> stackCounter;\n Counter<int> otherCounter;\n\n for (std::size_t i(0); i < values.size(); ++i)\n {\n if (i < total - 2) stackCounter.add(values[i]);\n else otherCounter.add(values[i]);\n }\n\n while (!other.empty())\n {\n ASSERT_TRUE(otherCounter.sub(other.pop()->val()));\n }\n\n while (!stack.empty())\n {\n ASSERT_TRUE(stackCounter.sub(stack.pop()->val()));\n }\n\n ASSERT_TRUE(stack.empty());\n ASSERT_TRUE(other.empty());\n\n ASSERT_TRUE(stackCounter.empty());\n ASSERT_TRUE(otherCounter.empty());\n}\n\nTEST(Stack, PopStackFull)\n{\n std::vector<splicer::Node<int>> nodes(makeNodes());\n splicer::Stack<int> stack(makeStack(nodes));\n\n const std::size_t total(values.size());\n\n Counter<int> counter;\n for (const auto v : values) counter.add(v);\n\n ASSERT_EQ(stack.size(), total);\n\n splicer::Stack<int> other(stack.popStack(total));\n\n EXPECT_EQ(stack.size(), 0);\n EXPECT_TRUE(stack.empty());\n EXPECT_EQ(other.size(), total);\n EXPECT_FALSE(other.empty());\n\n while (!other.empty())\n {\n ASSERT_TRUE(counter.sub(other.pop()->val()));\n }\n\n EXPECT_TRUE(counter.empty());\n EXPECT_TRUE(other.empty());\n}\n\nTEST(Stack, PopStackTooMany)\n{\n std::vector<splicer::Node<int>> nodes(makeNodes());\n splicer::Stack<int> stack(makeStack(nodes));\n\n const std::size_t total(values.size());\n\n Counter<int> counter;\n for (const auto v : values) counter.add(v);\n\n ASSERT_EQ(stack.size(), total);\n\n splicer::Stack<int> other(stack.popStack(total + 1));\n\n EXPECT_EQ(stack.size(), 0);\n EXPECT_TRUE(stack.empty());\n EXPECT_EQ(other.size(), total);\n EXPECT_FALSE(other.empty());\n\n while (!other.empty())\n {\n ASSERT_TRUE(counter.sub(other.pop()->val()));\n }\n\n EXPECT_TRUE(counter.empty());\n EXPECT_TRUE(other.empty());\n}\n\nTEST(Stack, PushPopSingle)\n{\n std::stack<int> validator;\n splicer::Stack<int> stack;\n std::vector<splicer::Node<int>> nodes(makeNodes());\n\n auto doPush([&](std::size_t i)->void\n {\n const int value(values.at(i));\n splicer::Node<int>& node(nodes.at(i));\n\n ASSERT_EQ(value, node.val());\n\n validator.push(value);\n stack.push(&node);\n\n ASSERT_FALSE(validator.empty());\n ASSERT_FALSE(stack.empty());\n ASSERT_EQ(stack.size(), i + 1);\n ASSERT_EQ(stack.size(), validator.size());\n });\n\n auto doPop([&](std::size_t i)->void\n {\n const int value(values.at(i));\n\n ASSERT_EQ(value, validator.top());\n validator.pop();\n\n ASSERT_EQ(value, stack.pop()->val());\n ASSERT_EQ(validator.empty(), stack.empty());\n });\n\n ASSERT_TRUE(validator.empty());\n ASSERT_TRUE(stack.empty());\n\n for (std::size_t i(0); i < values.size(); ++i) doPush(i);\n\n ASSERT_FALSE(validator.empty());\n ASSERT_FALSE(stack.empty());\n\n for (std::size_t i(values.size() - 1); i < values.size(); --i) doPop(i);\n\n ASSERT_TRUE(validator.empty());\n ASSERT_TRUE(stack.empty());\n}\n\nTEST(Stack, PushPopOtherStack)\n{\n std::stack<int> validator;\n splicer::Stack<int> stack;\n std::vector<splicer::Node<int>> nodes(makeNodes());\n\n auto doPush([&]()->void\n {\n splicer::Stack<int> other;\n\n for (auto& node : nodes)\n {\n other.push(&node);\n validator.push(node.val());\n }\n\n ASSERT_FALSE(other.empty());\n ASSERT_TRUE(stack.empty());\n\n stack.push(other);\n\n ASSERT_TRUE(other.empty());\n ASSERT_FALSE(stack.empty());\n\n ASSERT_FALSE(validator.empty());\n });\n\n auto doPop([&](std::size_t i)->void\n {\n const int value(values.at(i));\n\n ASSERT_EQ(value, validator.top());\n validator.pop();\n\n ASSERT_EQ(value, stack.pop()->val());\n ASSERT_EQ(validator.empty(), stack.empty());\n });\n\n ASSERT_TRUE(validator.empty());\n ASSERT_TRUE(stack.empty());\n\n doPush();\n\n ASSERT_FALSE(validator.empty());\n ASSERT_FALSE(stack.empty());\n\n for (std::size_t i(values.size() - 1); i < values.size(); --i) doPop(i);\n\n ASSERT_TRUE(validator.empty());\n ASSERT_TRUE(stack.empty());\n}\n\n<|endoftext|>"} {"text":"<commit_before>#include <map>\n#include <stack>\n\n#include \"splice-pool.hpp\"\n#include \"gtest\/gtest.h\"\n\nnamespace\n{\n const std::vector<int> values{3, 1, 4, 1, 5, 9};\n\n std::vector<splicer::Node<int>> makeNodes()\n {\n std::vector<splicer::Node<int>> nodes(values.size());\n\n for (std::size_t i(0); i < values.size(); ++i)\n {\n nodes[i].val() = values[i];\n }\n\n return nodes;\n }\n\n splicer::Stack<int> makeStack(std::vector<splicer::Node<int>>& nodes)\n {\n splicer::Stack<int> stack;\n\n for (std::size_t i(0); i < nodes.size(); ++i)\n {\n stack.push(&nodes[i]);\n }\n\n return stack;\n }\n\n \/\/ If we're checking stack contents we don't care about the order. This\n \/\/ utility tracks that all values are present.\n template<typename T>\n class Counter\n {\n public:\n void add(T val) { ++m_counts[val]; }\n\n bool sub(T val)\n {\n if (!m_counts.count(val)) return false;\n if (!--m_counts[val]) m_counts.erase(val);\n\n return true;\n }\n\n bool empty() const { return m_counts.empty(); }\n\n private:\n std::map<T, int> m_counts;\n };\n}\n\nTEST(Stack, PopEmpty)\n{\n splicer::Stack<int> stack;\n splicer::Node<int>* node(nullptr);\n\n EXPECT_TRUE(stack.empty());\n EXPECT_EQ(stack.size(), 0);\n EXPECT_NO_THROW(node = stack.pop());\n\n EXPECT_EQ(node, nullptr);\n EXPECT_TRUE(stack.empty());\n EXPECT_EQ(stack.size(), 0);\n}\n\nTEST(Stack, PushNode)\n{\n splicer::Stack<int> stack;\n\n const int value(4);\n\n splicer::Node<int> node;\n node.val() = value;\n\n EXPECT_TRUE(stack.empty());\n\n stack.push(&node);\n EXPECT_FALSE(stack.empty());\n EXPECT_EQ(stack.size(), 1);\n\n EXPECT_EQ(stack.pop()->val(), value);\n EXPECT_TRUE(stack.empty());\n}\n\nTEST(Stack, Swap)\n{\n std::vector<splicer::Node<int>> nodes(makeNodes());\n splicer::Stack<int> stack(makeStack(nodes));\n\n splicer::Stack<int> other;\n\n EXPECT_EQ(stack.size(), values.size());\n EXPECT_FALSE(stack.empty());\n EXPECT_EQ(other.size(), 0);\n EXPECT_TRUE(other.empty());\n\n stack.swap(other);\n\n EXPECT_EQ(stack.size(), 0);\n EXPECT_TRUE(stack.empty());\n EXPECT_EQ(other.size(), values.size());\n EXPECT_FALSE(other.empty());\n\n for (std::size_t i(0); i < values.size(); ++i)\n {\n ASSERT_EQ(other.pop()->val(), values[values.size() - i - 1]);\n }\n\n ASSERT_EQ(other.size(), 0);\n ASSERT_TRUE(other.empty());\n}\n\nTEST(Stack, PushStack)\n{\n splicer::Stack<int> stack;\n splicer::Stack<int> other;\n\n const int value(4);\n\n splicer::Node<int> node;\n node.val() = value;\n\n other.push(&node);\n EXPECT_FALSE(other.empty());\n EXPECT_EQ(other.size(), 1);\n\n EXPECT_TRUE(stack.empty());\n EXPECT_EQ(stack.size(), 0);\n\n stack.push(other);\n EXPECT_FALSE(stack.empty());\n EXPECT_EQ(stack.size(), 1);\n EXPECT_TRUE(other.empty());\n EXPECT_EQ(other.size(), 0);\n\n ASSERT_EQ(stack.pop()->val(), value);\n EXPECT_TRUE(stack.empty());\n EXPECT_TRUE(other.empty());\n EXPECT_EQ(stack.size(), 0);\n EXPECT_EQ(other.size(), 0);\n}\n\nTEST(Stack, PopStackEmpty)\n{\n splicer::Stack<int> stack;\n splicer::Stack<int> other;\n\n EXPECT_NO_THROW(other = stack.popStack(1));\n EXPECT_TRUE(stack.empty());\n EXPECT_TRUE(other.empty());\n\n EXPECT_NO_THROW(other = stack.popStack(0));\n EXPECT_TRUE(stack.empty());\n EXPECT_TRUE(other.empty());\n}\n\nTEST(Stack, PopStackZero)\n{\n std::vector<splicer::Node<int>> nodes(makeNodes());\n splicer::Stack<int> stack(makeStack(nodes));\n\n const std::size_t total(values.size());\n\n splicer::Stack<int> other(stack.popStack(0));\n\n ASSERT_EQ(stack.size(), total);\n ASSERT_FALSE(stack.empty());\n\n ASSERT_EQ(other.size(), 0);\n ASSERT_TRUE(other.empty());\n}\n\nTEST(Stack, PopStackPartial)\n{\n std::vector<splicer::Node<int>> nodes(makeNodes());\n splicer::Stack<int> stack(makeStack(nodes));\n\n const std::size_t total(values.size());\n\n splicer::Stack<int> other(stack.popStack(2));\n\n EXPECT_EQ(stack.size(), total - 2);\n EXPECT_EQ(other.size(), 2);\n\n std::size_t i(total);\n\n while (--i < total)\n {\n const auto check(values[i]);\n\n if (i >= 4) ASSERT_EQ(other.pop()->val(), check);\n else ASSERT_EQ(stack.pop()->val(), check);\n }\n\n ASSERT_TRUE(stack.empty());\n ASSERT_TRUE(other.empty());\n}\n\nTEST(Stack, PopStackFull)\n{\n std::vector<splicer::Node<int>> nodes(makeNodes());\n splicer::Stack<int> stack(makeStack(nodes));\n\n const std::size_t total(values.size());\n\n ASSERT_EQ(stack.size(), total);\n\n splicer::Stack<int> other(stack.popStack(total));\n\n EXPECT_EQ(stack.size(), 0);\n EXPECT_TRUE(stack.empty());\n EXPECT_EQ(other.size(), total);\n EXPECT_FALSE(other.empty());\n\n for (std::size_t i(total - 1); i < total; --i)\n {\n ASSERT_EQ(other.pop()->val(), values[i]);\n }\n\n EXPECT_TRUE(other.empty());\n}\n\nTEST(Stack, PopStackTooMany)\n{\n std::vector<splicer::Node<int>> nodes(makeNodes());\n splicer::Stack<int> stack(makeStack(nodes));\n\n const std::size_t total(values.size());\n\n ASSERT_EQ(stack.size(), total);\n\n splicer::Stack<int> other(stack.popStack(total * 2));\n\n EXPECT_EQ(stack.size(), 0);\n EXPECT_TRUE(stack.empty());\n EXPECT_EQ(other.size(), total);\n EXPECT_FALSE(other.empty());\n\n for (std::size_t i(total - 1); i < total; --i)\n {\n ASSERT_EQ(other.pop()->val(), values[i]);\n }\n\n EXPECT_TRUE(other.empty());\n}\n\nTEST(Stack, PushPopSingle)\n{\n std::stack<int> validator;\n splicer::Stack<int> stack;\n std::vector<splicer::Node<int>> nodes(makeNodes());\n\n auto doPush([&](std::size_t i)->void\n {\n const int value(values.at(i));\n splicer::Node<int>& node(nodes.at(i));\n\n ASSERT_EQ(value, node.val());\n\n validator.push(value);\n stack.push(&node);\n\n ASSERT_FALSE(validator.empty());\n ASSERT_FALSE(stack.empty());\n ASSERT_EQ(stack.size(), i + 1);\n ASSERT_EQ(stack.size(), validator.size());\n });\n\n auto doPop([&](std::size_t i)->void\n {\n const int value(values.at(i));\n\n ASSERT_EQ(value, validator.top());\n validator.pop();\n\n ASSERT_EQ(value, stack.pop()->val());\n ASSERT_EQ(validator.empty(), stack.empty());\n });\n\n ASSERT_TRUE(validator.empty());\n ASSERT_TRUE(stack.empty());\n\n for (std::size_t i(0); i < values.size(); ++i) doPush(i);\n\n ASSERT_FALSE(validator.empty());\n ASSERT_FALSE(stack.empty());\n\n for (std::size_t i(values.size() - 1); i < values.size(); --i) doPop(i);\n\n ASSERT_TRUE(validator.empty());\n ASSERT_TRUE(stack.empty());\n}\n\nTEST(Stack, PushPopOtherStack)\n{\n std::stack<int> validator;\n splicer::Stack<int> stack;\n std::vector<splicer::Node<int>> nodes(makeNodes());\n\n auto doPush([&]()->void\n {\n splicer::Stack<int> other;\n\n for (auto& node : nodes)\n {\n other.push(&node);\n validator.push(node.val());\n }\n\n ASSERT_FALSE(other.empty());\n ASSERT_TRUE(stack.empty());\n\n stack.push(other);\n\n ASSERT_TRUE(other.empty());\n ASSERT_FALSE(stack.empty());\n\n ASSERT_FALSE(validator.empty());\n });\n\n auto doPop([&](std::size_t i)->void\n {\n const int value(values.at(i));\n\n ASSERT_EQ(value, validator.top());\n validator.pop();\n\n ASSERT_EQ(value, stack.pop()->val());\n ASSERT_EQ(validator.empty(), stack.empty());\n });\n\n ASSERT_TRUE(validator.empty());\n ASSERT_TRUE(stack.empty());\n\n doPush();\n\n ASSERT_FALSE(validator.empty());\n ASSERT_FALSE(stack.empty());\n\n for (std::size_t i(values.size() - 1); i < values.size(); --i) doPop(i);\n\n ASSERT_TRUE(validator.empty());\n ASSERT_TRUE(stack.empty());\n}\n\n<commit_msg>Remove an unused testing class.<commit_after>#include <map>\n#include <stack>\n\n#include \"splice-pool.hpp\"\n#include \"gtest\/gtest.h\"\n\nnamespace\n{\n const std::vector<int> values{3, 1, 4, 1, 5, 9};\n\n std::vector<splicer::Node<int>> makeNodes()\n {\n std::vector<splicer::Node<int>> nodes(values.size());\n\n for (std::size_t i(0); i < values.size(); ++i)\n {\n nodes[i].val() = values[i];\n }\n\n return nodes;\n }\n\n splicer::Stack<int> makeStack(std::vector<splicer::Node<int>>& nodes)\n {\n splicer::Stack<int> stack;\n\n for (std::size_t i(0); i < nodes.size(); ++i)\n {\n stack.push(&nodes[i]);\n }\n\n return stack;\n }\n}\n\nTEST(Stack, PopEmpty)\n{\n splicer::Stack<int> stack;\n splicer::Node<int>* node(nullptr);\n\n EXPECT_TRUE(stack.empty());\n EXPECT_EQ(stack.size(), 0);\n EXPECT_NO_THROW(node = stack.pop());\n\n EXPECT_EQ(node, nullptr);\n EXPECT_TRUE(stack.empty());\n EXPECT_EQ(stack.size(), 0);\n}\n\nTEST(Stack, PushNode)\n{\n splicer::Stack<int> stack;\n\n const int value(4);\n\n splicer::Node<int> node;\n node.val() = value;\n\n EXPECT_TRUE(stack.empty());\n\n stack.push(&node);\n EXPECT_FALSE(stack.empty());\n EXPECT_EQ(stack.size(), 1);\n\n EXPECT_EQ(stack.pop()->val(), value);\n EXPECT_TRUE(stack.empty());\n}\n\nTEST(Stack, Swap)\n{\n std::vector<splicer::Node<int>> nodes(makeNodes());\n splicer::Stack<int> stack(makeStack(nodes));\n\n splicer::Stack<int> other;\n\n EXPECT_EQ(stack.size(), values.size());\n EXPECT_FALSE(stack.empty());\n EXPECT_EQ(other.size(), 0);\n EXPECT_TRUE(other.empty());\n\n stack.swap(other);\n\n EXPECT_EQ(stack.size(), 0);\n EXPECT_TRUE(stack.empty());\n EXPECT_EQ(other.size(), values.size());\n EXPECT_FALSE(other.empty());\n\n for (std::size_t i(0); i < values.size(); ++i)\n {\n ASSERT_EQ(other.pop()->val(), values[values.size() - i - 1]);\n }\n\n ASSERT_EQ(other.size(), 0);\n ASSERT_TRUE(other.empty());\n}\n\nTEST(Stack, PushStack)\n{\n splicer::Stack<int> stack;\n splicer::Stack<int> other;\n\n const int value(4);\n\n splicer::Node<int> node;\n node.val() = value;\n\n other.push(&node);\n EXPECT_FALSE(other.empty());\n EXPECT_EQ(other.size(), 1);\n\n EXPECT_TRUE(stack.empty());\n EXPECT_EQ(stack.size(), 0);\n\n stack.push(other);\n EXPECT_FALSE(stack.empty());\n EXPECT_EQ(stack.size(), 1);\n EXPECT_TRUE(other.empty());\n EXPECT_EQ(other.size(), 0);\n\n ASSERT_EQ(stack.pop()->val(), value);\n EXPECT_TRUE(stack.empty());\n EXPECT_TRUE(other.empty());\n EXPECT_EQ(stack.size(), 0);\n EXPECT_EQ(other.size(), 0);\n}\n\nTEST(Stack, PopStackEmpty)\n{\n splicer::Stack<int> stack;\n splicer::Stack<int> other;\n\n EXPECT_NO_THROW(other = stack.popStack(1));\n EXPECT_TRUE(stack.empty());\n EXPECT_TRUE(other.empty());\n\n EXPECT_NO_THROW(other = stack.popStack(0));\n EXPECT_TRUE(stack.empty());\n EXPECT_TRUE(other.empty());\n}\n\nTEST(Stack, PopStackZero)\n{\n std::vector<splicer::Node<int>> nodes(makeNodes());\n splicer::Stack<int> stack(makeStack(nodes));\n\n const std::size_t total(values.size());\n\n splicer::Stack<int> other(stack.popStack(0));\n\n ASSERT_EQ(stack.size(), total);\n ASSERT_FALSE(stack.empty());\n\n ASSERT_EQ(other.size(), 0);\n ASSERT_TRUE(other.empty());\n}\n\nTEST(Stack, PopStackPartial)\n{\n std::vector<splicer::Node<int>> nodes(makeNodes());\n splicer::Stack<int> stack(makeStack(nodes));\n\n const std::size_t total(values.size());\n\n splicer::Stack<int> other(stack.popStack(2));\n\n EXPECT_EQ(stack.size(), total - 2);\n EXPECT_EQ(other.size(), 2);\n\n std::size_t i(total);\n\n while (--i < total)\n {\n const auto check(values[i]);\n\n if (i >= 4) ASSERT_EQ(other.pop()->val(), check);\n else ASSERT_EQ(stack.pop()->val(), check);\n }\n\n ASSERT_TRUE(stack.empty());\n ASSERT_TRUE(other.empty());\n}\n\nTEST(Stack, PopStackFull)\n{\n std::vector<splicer::Node<int>> nodes(makeNodes());\n splicer::Stack<int> stack(makeStack(nodes));\n\n const std::size_t total(values.size());\n\n ASSERT_EQ(stack.size(), total);\n\n splicer::Stack<int> other(stack.popStack(total));\n\n EXPECT_EQ(stack.size(), 0);\n EXPECT_TRUE(stack.empty());\n EXPECT_EQ(other.size(), total);\n EXPECT_FALSE(other.empty());\n\n for (std::size_t i(total - 1); i < total; --i)\n {\n ASSERT_EQ(other.pop()->val(), values[i]);\n }\n\n EXPECT_TRUE(other.empty());\n}\n\nTEST(Stack, PopStackTooMany)\n{\n std::vector<splicer::Node<int>> nodes(makeNodes());\n splicer::Stack<int> stack(makeStack(nodes));\n\n const std::size_t total(values.size());\n\n ASSERT_EQ(stack.size(), total);\n\n splicer::Stack<int> other(stack.popStack(total * 2));\n\n EXPECT_EQ(stack.size(), 0);\n EXPECT_TRUE(stack.empty());\n EXPECT_EQ(other.size(), total);\n EXPECT_FALSE(other.empty());\n\n for (std::size_t i(total - 1); i < total; --i)\n {\n ASSERT_EQ(other.pop()->val(), values[i]);\n }\n\n EXPECT_TRUE(other.empty());\n}\n\nTEST(Stack, PushPopSingle)\n{\n std::stack<int> validator;\n splicer::Stack<int> stack;\n std::vector<splicer::Node<int>> nodes(makeNodes());\n\n auto doPush([&](std::size_t i)->void\n {\n const int value(values.at(i));\n splicer::Node<int>& node(nodes.at(i));\n\n ASSERT_EQ(value, node.val());\n\n validator.push(value);\n stack.push(&node);\n\n ASSERT_FALSE(validator.empty());\n ASSERT_FALSE(stack.empty());\n ASSERT_EQ(stack.size(), i + 1);\n ASSERT_EQ(stack.size(), validator.size());\n });\n\n auto doPop([&](std::size_t i)->void\n {\n const int value(values.at(i));\n\n ASSERT_EQ(value, validator.top());\n validator.pop();\n\n ASSERT_EQ(value, stack.pop()->val());\n ASSERT_EQ(validator.empty(), stack.empty());\n });\n\n ASSERT_TRUE(validator.empty());\n ASSERT_TRUE(stack.empty());\n\n for (std::size_t i(0); i < values.size(); ++i) doPush(i);\n\n ASSERT_FALSE(validator.empty());\n ASSERT_FALSE(stack.empty());\n\n for (std::size_t i(values.size() - 1); i < values.size(); --i) doPop(i);\n\n ASSERT_TRUE(validator.empty());\n ASSERT_TRUE(stack.empty());\n}\n\nTEST(Stack, PushPopOtherStack)\n{\n std::stack<int> validator;\n splicer::Stack<int> stack;\n std::vector<splicer::Node<int>> nodes(makeNodes());\n\n auto doPush([&]()->void\n {\n splicer::Stack<int> other;\n\n for (auto& node : nodes)\n {\n other.push(&node);\n validator.push(node.val());\n }\n\n ASSERT_FALSE(other.empty());\n ASSERT_TRUE(stack.empty());\n\n stack.push(other);\n\n ASSERT_TRUE(other.empty());\n ASSERT_FALSE(stack.empty());\n\n ASSERT_FALSE(validator.empty());\n });\n\n auto doPop([&](std::size_t i)->void\n {\n const int value(values.at(i));\n\n ASSERT_EQ(value, validator.top());\n validator.pop();\n\n ASSERT_EQ(value, stack.pop()->val());\n ASSERT_EQ(validator.empty(), stack.empty());\n });\n\n ASSERT_TRUE(validator.empty());\n ASSERT_TRUE(stack.empty());\n\n doPush();\n\n ASSERT_FALSE(validator.empty());\n ASSERT_FALSE(stack.empty());\n\n for (std::size_t i(values.size() - 1); i < values.size(); --i) doPop(i);\n\n ASSERT_TRUE(validator.empty());\n ASSERT_TRUE(stack.empty());\n}\n\n<|endoftext|>"} {"text":"<commit_before>\/****************************************************************************\n* themefile.cpp - Theme file handling\n*\n* Copyright (C) 2003 Hans Karlsson <karlsson.h@home.se>\n* Copyright (C) 2003-2004 Adam Geitgey <adam@rootnode.org>\n* Copyright (c) 2004 Petri Damstn <damu@iki.fi>\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., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA\n****************************************************************************\/\n#include \"themefile.h\"\n#include \"lineparser.h\"\n#include \"themelocale.h\"\n#include <kdebug.h>\n#include <kurl.h>\n#include <kzip.h>\n#include <kapplication.h>\n#include <kmessagebox.h>\n#include <kstandarddirs.h>\n#include <klocale.h>\n#include <kio\/netaccess.h>\n#include <qtextstream.h>\n#include <qfileinfo.h>\n#include <qdom.h>\n#include <qdir.h>\n\nclass ZipFile\n{\n public:\n ZipFile(const QString& zipfile, const QString& filename) :\n m_zip(0), m_file(0), m_filename(filename)\n {\n if(filename.isEmpty())\n return;\n\n const KArchiveDirectory* dir;\n const KArchiveEntry* entry;\n\n m_zip = new KZip(zipfile);\n\n if(!m_zip->open(IO_ReadOnly))\n {\n qDebug(\"Unable to open '%s' for reading.\", zipfile.ascii());\n return;\n }\n dir = m_zip->directory();\n if(dir == 0)\n {\n qDebug(\"Error reading directory contents of file %s\", zipfile.ascii());\n return;\n }\n\n entry = dir->entry(filename);\n if(entry == 0 || !entry->isFile())\n return;\n\n m_file = static_cast<const KArchiveFile*>(entry);\n }\n\n virtual ~ZipFile()\n {\n if(m_zip)\n {\n m_zip->close();\n delete m_zip;\n }\n }\n\n QByteArray data()\n {\n if(m_file)\n return m_file->data();\n else\n {\n if(!m_filename.isEmpty())\n qDebug(\"Error reading file %s from zip\", m_filename.ascii());\n return QByteArray();\n }\n }\n\n bool exists()\n {\n return (m_file != 0);\n }\n\n private:\n KZip* m_zip;\n const KArchiveFile* m_file;\n QString m_filename;\n};\n\nThemeFile::ThemeFile(const KURL& url)\n : m_stream(0), m_locale(0)\n{\n if(url.isValid())\n set(url);\n}\n\nThemeFile::~ThemeFile()\n{\n delete m_stream;\n delete m_locale;\n}\n\nbool ThemeFile::open()\n{\n bool result = false;\n\n close();\n\n if(m_zipTheme)\n {\n ZipFile zf(m_file, m_theme);\n m_ba = zf.data();\n if(m_ba.size() > 0)\n {\n m_stream = new QTextStream(m_ba, IO_ReadOnly);\n result = true;\n }\n }\n else\n {\n m_fl.setName(m_file);\n\n if(m_fl.open(IO_ReadOnly|IO_Translate))\n {\n m_stream = new QTextStream(&m_fl); \/\/ use a text stream\n result = true;\n }\n }\n return result;\n}\n\nbool ThemeFile::nextLine(LineParser& parser)\n{\n parser.set(\"\");\n\n if(m_stream)\n {\n QString result = m_stream->readLine();\n\n if(result.isNull())\n return false;\n parser.set(result);\n return true;\n }\n return false;\n}\n\nbool ThemeFile::close()\n{\n if(m_stream)\n {\n delete m_stream;\n m_stream = 0;\n m_fl.close();\n m_ba.resize(0);\n return true;\n }\n return false;\n}\n\nbool ThemeFile::isValid() const\n{\n return (exists() && !m_name.isEmpty() && !m_theme.isEmpty());\n}\n\nbool ThemeFile::exists() const\n{\n QFileInfo file(m_file);\n return file.exists();\n}\n\nQPixmap ThemeFile::icon() const\n{\n return QPixmap(readThemeFile(m_icon));\n}\n\nbool ThemeFile::set(const KURL &url)\n{\n if(!url.isLocalFile() && !url.protocol().isEmpty())\n {\n if(KMessageBox::questionYesNo(kapp->activeWindow(),\n i18n(\"You are about to install and run %1 SuperKaramba theme. Since \"\n \"themes can contain executable code you should only install themes \"\n \"from sources that you trust. Continue?\")\n .arg(url.prettyURL()))\n == KMessageBox::No)\n {\n return false;\n }\n\n QDir themeDir(locateLocal(\"appdata\", \"themes\/\", true));\n QFileInfo localFile = themeDir.filePath(url.fileName());\n\n if(localFile.exists())\n {\n if(KMessageBox::questionYesNo(kapp->activeWindow(),\n i18n(\"%1 already exists. Do you want to overwrite it?\")\n .arg(localFile.filePath()))\n == KMessageBox::No)\n {\n return false;\n }\n }\n if(!KIO::NetAccess::file_copy(url, localFile.filePath(), -1, true,\n false, kapp->mainWidget()))\n {\n return false;\n }\n m_file = localFile.filePath();\n }\n else\n {\n if(url.directory().isEmpty() or url.directory() == \"\/\")\n m_file = canonicalFile(QDir::current().filePath(url.fileName()));\n else\n m_file = canonicalFile(url.path());\n if(!exists())\n return false;\n }\n\n QFileInfo fi(m_file);\n\n m_name = fi.baseName();\n m_theme = m_name + \".theme\";\n m_python = m_name;\n m_id = m_name;\n\n if(isZipFile(m_file))\n {\n m_path = m_file;\n m_zipTheme = true;\n }\n else\n {\n m_path = fi.dirPath(true) + \"\/\";\n m_zipTheme = false;\n }\n parseXml();\n\n QFileInfo fimo(m_python);\n if(m_python.isEmpty())\n fimo.setFile(m_theme);\n else\n fimo.setFile(m_python);\n m_mo = fimo.baseName();\n\n m_locale = new ThemeLocale(this);\n return isValid();\n}\n\nvoid ThemeFile::parseXml()\n{\n if(!fileExists(\"maindata.xml\"))\n return;\n QByteArray ba = readThemeFile(\"maindata.xml\");\n QDomDocument doc(\"superkaramba_theme\");\n doc.setContent(ba);\n QDomElement element = doc.documentElement();\n\n QDomNode n = element.firstChild();\n while(!n.isNull())\n {\n QDomElement e = n.toElement();\n if(!e.isNull())\n {\n if(e.tagName() == \"name\")\n m_name = e.text();\n else if(e.tagName() == \"themefile\")\n m_theme = e.text();\n else if(e.tagName() == \"python_module\")\n {\n m_python = e.text();\n if(m_python.right(3).lower() == \".py\")\n m_python.remove(m_python.length() - 3, 3);\n }\n else if(e.tagName() == \"description\")\n m_description = e.text();\n else if(e.tagName() == \"author\")\n m_author = e.text();\n else if(e.tagName() == \"author_email\")\n m_authorEmail = e.text();\n else if(e.tagName() == \"homepage\")\n m_homepage = e.text();\n else if(e.tagName() == \"icon\")\n m_icon = e.text();\n else if(e.tagName() == \"version\")\n m_version = e.text();\n else if(e.tagName() == \"license\")\n m_license = e.text();\n }\n n = n.nextSibling();\n }\n}\n\nbool ThemeFile::isThemeFile(const QString& filename) const\n{\n QFileInfo fileInfo(filename);\n\n return fileInfo.isRelative();\n}\n\nbool ThemeFile::fileExists(const QString& filename) const\n{\n if(isThemeFile(filename))\n {\n if(isZipTheme())\n {\n ZipFile zf(m_file, filename);\n return zf.exists();\n }\n else\n return QFileInfo(path() + \"\/\" + filename).exists();\n }\n else\n return QFileInfo(filename).exists();\n}\n\nQByteArray ThemeFile::readThemeFile(const QString& filename) const\n{\n QByteArray ba;\n\n if(isZipTheme())\n {\n ZipFile zf(m_file, filename);\n ba = zf.data();\n }\n else\n {\n QFile file(path() + \"\/\" + filename);\n\n if(file.open(IO_ReadOnly))\n {\n ba = file.readAll();\n file.close();\n }\n }\n return ba;\n}\n\nbool ThemeFile::isZipFile(const QString& filename)\n{\n QFile file(filename);\n\n if(file.open(IO_ReadOnly))\n {\n unsigned char buf[5];\n\n if(file.readBlock((char*)buf, 4) == 4)\n {\n if(buf[0] == 'P' && buf[1] == 'K' && buf[2] == 3 && buf[3] == 4)\n return true;\n }\n }\n return false;\n}\n\nbool ThemeFile::pythonModuleExists() const\n{\n return (!m_python.isEmpty() && fileExists(m_python + \".py\"));\n}\n\nQString ThemeFile::canonicalFile(const QString& file)\n{\n \/\/ Get absolute path with NO symlinks\n QFileInfo fi(file);\n return QDir(fi.dir().canonicalPath()).filePath(fi.fileName());\n}\n<commit_msg>kdereview reviewed for Yes\/No buttons<commit_after>\/****************************************************************************\n* themefile.cpp - Theme file handling\n*\n* Copyright (C) 2003 Hans Karlsson <karlsson.h@home.se>\n* Copyright (C) 2003-2004 Adam Geitgey <adam@rootnode.org>\n* Copyright (c) 2004 Petri Damst� <damu@iki.fi>\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., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA\n****************************************************************************\/\n#include \"themefile.h\"\n#include \"lineparser.h\"\n#include \"themelocale.h\"\n#include <kdebug.h>\n#include <kurl.h>\n#include <kzip.h>\n#include <kapplication.h>\n#include <kmessagebox.h>\n#include <kstandarddirs.h>\n#include <klocale.h>\n#include <kio\/netaccess.h>\n#include <qtextstream.h>\n#include <qfileinfo.h>\n#include <qdom.h>\n#include <qdir.h>\n\nclass ZipFile\n{\n public:\n ZipFile(const QString& zipfile, const QString& filename) :\n m_zip(0), m_file(0), m_filename(filename)\n {\n if(filename.isEmpty())\n return;\n\n const KArchiveDirectory* dir;\n const KArchiveEntry* entry;\n\n m_zip = new KZip(zipfile);\n\n if(!m_zip->open(IO_ReadOnly))\n {\n qDebug(\"Unable to open '%s' for reading.\", zipfile.ascii());\n return;\n }\n dir = m_zip->directory();\n if(dir == 0)\n {\n qDebug(\"Error reading directory contents of file %s\", zipfile.ascii());\n return;\n }\n\n entry = dir->entry(filename);\n if(entry == 0 || !entry->isFile())\n return;\n\n m_file = static_cast<const KArchiveFile*>(entry);\n }\n\n virtual ~ZipFile()\n {\n if(m_zip)\n {\n m_zip->close();\n delete m_zip;\n }\n }\n\n QByteArray data()\n {\n if(m_file)\n return m_file->data();\n else\n {\n if(!m_filename.isEmpty())\n qDebug(\"Error reading file %s from zip\", m_filename.ascii());\n return QByteArray();\n }\n }\n\n bool exists()\n {\n return (m_file != 0);\n }\n\n private:\n KZip* m_zip;\n const KArchiveFile* m_file;\n QString m_filename;\n};\n\nThemeFile::ThemeFile(const KURL& url)\n : m_stream(0), m_locale(0)\n{\n if(url.isValid())\n set(url);\n}\n\nThemeFile::~ThemeFile()\n{\n delete m_stream;\n delete m_locale;\n}\n\nbool ThemeFile::open()\n{\n bool result = false;\n\n close();\n\n if(m_zipTheme)\n {\n ZipFile zf(m_file, m_theme);\n m_ba = zf.data();\n if(m_ba.size() > 0)\n {\n m_stream = new QTextStream(m_ba, IO_ReadOnly);\n result = true;\n }\n }\n else\n {\n m_fl.setName(m_file);\n\n if(m_fl.open(IO_ReadOnly|IO_Translate))\n {\n m_stream = new QTextStream(&m_fl); \/\/ use a text stream\n result = true;\n }\n }\n return result;\n}\n\nbool ThemeFile::nextLine(LineParser& parser)\n{\n parser.set(\"\");\n\n if(m_stream)\n {\n QString result = m_stream->readLine();\n\n if(result.isNull())\n return false;\n parser.set(result);\n return true;\n }\n return false;\n}\n\nbool ThemeFile::close()\n{\n if(m_stream)\n {\n delete m_stream;\n m_stream = 0;\n m_fl.close();\n m_ba.resize(0);\n return true;\n }\n return false;\n}\n\nbool ThemeFile::isValid() const\n{\n return (exists() && !m_name.isEmpty() && !m_theme.isEmpty());\n}\n\nbool ThemeFile::exists() const\n{\n QFileInfo file(m_file);\n return file.exists();\n}\n\nQPixmap ThemeFile::icon() const\n{\n return QPixmap(readThemeFile(m_icon));\n}\n\nbool ThemeFile::set(const KURL &url)\n{\n if(!url.isLocalFile() && !url.protocol().isEmpty())\n {\n if(KMessageBox::warningContinueCancel(kapp->activeWindow(),\n i18n(\"You are about to install and run %1 SuperKaramba theme. Since \"\n \"themes can contain executable code you should only install themes \"\n \"from sources that you trust. Continue?\"), i18n(\"Executable Code Warning\"), i18n(\"Install\")\n .arg(url.prettyURL()))\n == KMessageBox::Cancel)\n {\n return false;\n }\n\n QDir themeDir(locateLocal(\"appdata\", \"themes\/\", true));\n QFileInfo localFile = themeDir.filePath(url.fileName());\n\n if(localFile.exists())\n {\n if(KMessageBox::warningContinueCancel(kapp->activeWindow(),\n i18n(\"%1 already exists. Do you want to overwrite it?\")\n .arg(localFile.filePath()),i18n(\"File Exists\"),i18n(\"Overwrite\"))\n == KMessageBox::Cancel)\n {\n return false;\n }\n }\n if(!KIO::NetAccess::file_copy(url, localFile.filePath(), -1, true,\n false, kapp->mainWidget()))\n {\n return false;\n }\n m_file = localFile.filePath();\n }\n else\n {\n if(url.directory().isEmpty() or url.directory() == \"\/\")\n m_file = canonicalFile(QDir::current().filePath(url.fileName()));\n else\n m_file = canonicalFile(url.path());\n if(!exists())\n return false;\n }\n\n QFileInfo fi(m_file);\n\n m_name = fi.baseName();\n m_theme = m_name + \".theme\";\n m_python = m_name;\n m_id = m_name;\n\n if(isZipFile(m_file))\n {\n m_path = m_file;\n m_zipTheme = true;\n }\n else\n {\n m_path = fi.dirPath(true) + \"\/\";\n m_zipTheme = false;\n }\n parseXml();\n\n QFileInfo fimo(m_python);\n if(m_python.isEmpty())\n fimo.setFile(m_theme);\n else\n fimo.setFile(m_python);\n m_mo = fimo.baseName();\n\n m_locale = new ThemeLocale(this);\n return isValid();\n}\n\nvoid ThemeFile::parseXml()\n{\n if(!fileExists(\"maindata.xml\"))\n return;\n QByteArray ba = readThemeFile(\"maindata.xml\");\n QDomDocument doc(\"superkaramba_theme\");\n doc.setContent(ba);\n QDomElement element = doc.documentElement();\n\n QDomNode n = element.firstChild();\n while(!n.isNull())\n {\n QDomElement e = n.toElement();\n if(!e.isNull())\n {\n if(e.tagName() == \"name\")\n m_name = e.text();\n else if(e.tagName() == \"themefile\")\n m_theme = e.text();\n else if(e.tagName() == \"python_module\")\n {\n m_python = e.text();\n if(m_python.right(3).lower() == \".py\")\n m_python.remove(m_python.length() - 3, 3);\n }\n else if(e.tagName() == \"description\")\n m_description = e.text();\n else if(e.tagName() == \"author\")\n m_author = e.text();\n else if(e.tagName() == \"author_email\")\n m_authorEmail = e.text();\n else if(e.tagName() == \"homepage\")\n m_homepage = e.text();\n else if(e.tagName() == \"icon\")\n m_icon = e.text();\n else if(e.tagName() == \"version\")\n m_version = e.text();\n else if(e.tagName() == \"license\")\n m_license = e.text();\n }\n n = n.nextSibling();\n }\n}\n\nbool ThemeFile::isThemeFile(const QString& filename) const\n{\n QFileInfo fileInfo(filename);\n\n return fileInfo.isRelative();\n}\n\nbool ThemeFile::fileExists(const QString& filename) const\n{\n if(isThemeFile(filename))\n {\n if(isZipTheme())\n {\n ZipFile zf(m_file, filename);\n return zf.exists();\n }\n else\n return QFileInfo(path() + \"\/\" + filename).exists();\n }\n else\n return QFileInfo(filename).exists();\n}\n\nQByteArray ThemeFile::readThemeFile(const QString& filename) const\n{\n QByteArray ba;\n\n if(isZipTheme())\n {\n ZipFile zf(m_file, filename);\n ba = zf.data();\n }\n else\n {\n QFile file(path() + \"\/\" + filename);\n\n if(file.open(IO_ReadOnly))\n {\n ba = file.readAll();\n file.close();\n }\n }\n return ba;\n}\n\nbool ThemeFile::isZipFile(const QString& filename)\n{\n QFile file(filename);\n\n if(file.open(IO_ReadOnly))\n {\n unsigned char buf[5];\n\n if(file.readBlock((char*)buf, 4) == 4)\n {\n if(buf[0] == 'P' && buf[1] == 'K' && buf[2] == 3 && buf[3] == 4)\n return true;\n }\n }\n return false;\n}\n\nbool ThemeFile::pythonModuleExists() const\n{\n return (!m_python.isEmpty() && fileExists(m_python + \".py\"));\n}\n\nQString ThemeFile::canonicalFile(const QString& file)\n{\n \/\/ Get absolute path with NO symlinks\n QFileInfo fi(file);\n return QDir(fi.dir().canonicalPath()).filePath(fi.fileName());\n}\n<|endoftext|>"} {"text":"<commit_before>#include <time.h>\n#include <random>\n\n#include <gtest\/gtest.h>\n\n#include <u\/vector.h>\n#include <u\/math.h>\n\n#define VECTOR_DUMP(n) \"vector[size='\" << ds_size(v ## n) << \"', capacity='\" << ds_cap(v ## n) << \"']\"\n#define ASSERT_CAPACITY(_q0, _q1, _q2, _q3, _q4) \\\n ASSERT_EQ(_q0, ds_cap(v0)) << _q0 << \" => \" << VECTOR_DUMP(0); \\\n ASSERT_EQ(_q1, ds_cap(v1)) << _q1 << \" => \" << VECTOR_DUMP(1); \\\n ASSERT_EQ(_q2, ds_cap(v2)) << _q2 << \" => \" << VECTOR_DUMP(2); \\\n ASSERT_EQ(_q3, ds_cap(v3)) << _q3 << \" => \" << VECTOR_DUMP(3); \\\n ASSERT_EQ(_q4, ds_cap(v4)) << _q4 << \" => \" << VECTOR_DUMP(4)\n#define ASSERT_SIZE(_s0, _s1, _s2, _s3, _s4) \\\n ASSERT_EQ(_s0, ds_size(v0)) << _s0 << \" => \" << VECTOR_DUMP(0); \\\n ASSERT_EQ(_s1, ds_size(v1)) << _s1 << \" => \" << VECTOR_DUMP(1); \\\n ASSERT_EQ(_s2, ds_size(v2)) << _s2 << \" => \" << VECTOR_DUMP(2); \\\n ASSERT_EQ(_s3, ds_size(v3)) << _s3 << \" => \" << VECTOR_DUMP(3); \\\n ASSERT_EQ(_s4, ds_size(v4)) << _s4 << \" => \" << VECTOR_DUMP(4)\n\n\nstruct VectorTest : public ::testing::Test {\n virtual void SetUp() {\n std::random_device rd;\n std::mt19937 eng(rd());\n\n std::uniform_int_distribution<> dist0(0, 10);\n std::uniform_int_distribution<> dist1(10, 100);\n std::uniform_int_distribution<> dist2(100, 1000);\n std::uniform_int_distribution<> dist3(1000, 10000);\n std::uniform_int_distribution<> dist4(10000, 100000);\n\n s0 = (size_t) dist0(eng);\n s1 = (size_t) dist1(eng);\n s2 = (size_t) dist2(eng);\n s3 = (size_t) dist3(eng);\n s4 = (size_t) dist4(eng);\n\n qRoundUp32();\n }\n\n virtual void TearDown() {\n vec_dtor(v0);\n vec_dtor(v1);\n vec_dtor(v2);\n vec_dtor(v3);\n vec_dtor(v4);\n }\n\n void qRoundUp32() {\n q0 = roundup32(s0);\n q1 = roundup32(s1);\n q2 = roundup32(s2);\n q3 = roundup32(s3);\n q4 = roundup32(s4);\n\n if (q0 && q0 < UVEC_MIN_CAPACITY) q0 = UVEC_MIN_CAPACITY;\n }\n\n struct Point {\n long long x, y;\n };\n\n size_t s0, q0;\n size_t s1, q1;\n size_t s2, q2;\n size_t s3, q3;\n size_t s4, q4;\n\n vec_of(int) v0 = {0};\n vec_of(size_t) v1 = {0};\n vec_of(struct { int x; int y; }) v2 = {0};\n vec_of(Point) v3 = {0};\n vec_of(void *) v4 = {0};\n};\n\nTEST_F(VectorTest, grow) {\n ASSERT_CAPACITY(0, 0, 0, 0, 0);\n ASSERT_SIZE(0, 0, 0, 0, 0);\n\n vec_grow(v0, s0);\n vec_grow(v1, s1);\n vec_grow(v2, s2);\n vec_grow(v3, s3);\n vec_grow(v4, s4);\n\n ASSERT_CAPACITY(q0, q1, q2, q3, q4);\n ASSERT_SIZE(0, 0, 0, 0, 0);\n\n s0 *= 2;\n s1 *= 2;\n s2 *= 2;\n s3 *= 2;\n s4 *= 2;\n\n vec_grow(v0, s0);\n vec_grow(v1, s1);\n vec_grow(v2, s2);\n vec_grow(v3, s3);\n vec_grow(v4, s4);\n\n qRoundUp32();\n\n ASSERT_CAPACITY(q0, q1, q2, q3, q4);\n ASSERT_SIZE(0, 0, 0, 0, 0);\n\n vec_grow(v0, -(s0\/2));\n vec_grow(v1, -(s1\/2));\n vec_grow(v2, -(s2\/2));\n vec_grow(v3, -(s3\/2));\n vec_grow(v4, -(s4\/2));\n\n ASSERT_CAPACITY(q0, q1, q2, q3, q4);\n ASSERT_SIZE(0, 0, 0, 0, 0);\n\n vec_grow(v0, -s0);\n vec_grow(v1, -s1);\n vec_grow(v2, -s2);\n vec_grow(v3, -s3);\n vec_grow(v4, -s4);\n\n ASSERT_CAPACITY(q0, q1, q2, q3, q4);\n ASSERT_SIZE(0, 0, 0, 0, 0);\n\n vec_grow(v0, 1);\n vec_grow(v1, 1);\n vec_grow(v2, 1);\n vec_grow(v3, 1);\n vec_grow(v4, 1);\n\n ASSERT_CAPACITY((q0 ? q0 : UVEC_MIN_CAPACITY), q1, q2, q3, q4);\n ASSERT_SIZE(0, 0, 0, 0, 0);\n}\n\nTEST_F(VectorTest, reserve) {\n ASSERT_CAPACITY(0, 0, 0, 0, 0);\n ASSERT_SIZE(0, 0, 0, 0, 0);\n\n vec_reserve(v0, s0);\n vec_reserve(v1, s1);\n vec_reserve(v2, s2);\n vec_reserve(v3, s3);\n vec_reserve(v4, s4);\n\n ASSERT_CAPACITY(q0, q1, q2, q3, q4);\n ASSERT_SIZE(0, 0, 0, 0, 0);\n\n s0 *= 6;\n s1 *= 5;\n s2 *= 4;\n s3 *= 3;\n s4 *= 2;\n\n qRoundUp32();\n\n vec_reserve(v0, s0);\n vec_reserve(v1, s1);\n vec_reserve(v2, s2);\n vec_reserve(v3, s3);\n vec_reserve(v4, s4);\n\n ASSERT_CAPACITY(q0, q1, q2, q3, q4);\n ASSERT_SIZE(0, 0, 0, 0, 0);\n\n vec_reserve(v0, -s0);\n vec_reserve(v1, -s1);\n vec_reserve(v2, -s2);\n vec_reserve(v3, -s3);\n vec_reserve(v4, -s4);\n\n ASSERT_CAPACITY(q0, q1, q2, q3, q4);\n ASSERT_SIZE(0, 0, 0, 0, 0);\n}\n\nTEST_F(VectorTest, resize) {\n ASSERT_CAPACITY(0, 0, 0, 0, 0);\n ASSERT_SIZE(0, 0, 0, 0, 0);\n\n vec_resize(v0, s0);\n vec_resize(v1, s1);\n vec_resize(v2, s2);\n vec_resize(v3, s3);\n vec_resize(v4, s4);\n\n ASSERT_CAPACITY(q0, q1, q2, q3, q4);\n ASSERT_SIZE(s0, s1, s2, s3, s4);\n\n vec_resize(v0, -s0);\n vec_resize(v1, -s1);\n vec_resize(v2, -s2);\n vec_resize(v3, -s3);\n vec_resize(v4, -s4);\n\n ASSERT_CAPACITY(q0, q1, q2, q3, q4);\n ASSERT_SIZE(0, 0, 0, 0, 0);\n\n vec_resize(v0, -s0);\n vec_resize(v1, -s1);\n vec_resize(v2, -s2);\n vec_resize(v3, -s3);\n vec_resize(v4, -s4);\n\n ASSERT_CAPACITY(q0, q1, q2, q3, q4);\n ASSERT_SIZE(0, 0, 0, 0, 0);\n\n vec_resize(v0, 1);\n vec_resize(v1, 1);\n vec_resize(v2, 1);\n vec_resize(v3, 1);\n vec_resize(v4, 1);\n\n ASSERT_CAPACITY((q0 ? q0 : UVEC_MIN_CAPACITY), q1, q2, q3, q4);\n ASSERT_SIZE(1, 1, 1, 1, 1);\n\n vec_resize(v0, 0);\n vec_resize(v1, 0);\n vec_resize(v2, 0);\n vec_resize(v3, 0);\n vec_resize(v4, 0);\n\n ASSERT_CAPACITY((q0 ? q0 : UVEC_MIN_CAPACITY), q1, q2, q3, q4);\n ASSERT_SIZE(0, 0, 0, 0, 0);\n}\n\nTEST_F(VectorTest, push) {\n\n}\n<commit_msg>msvc: list initialization inside member initializer<commit_after>#include <time.h>\n#include <random>\n\n#include <gtest\/gtest.h>\n\n#include <u\/vector.h>\n#include <u\/math.h>\n\n#define VECTOR_DUMP(n) \"vector[size='\" << ds_size(v ## n) << \"', capacity='\" << ds_cap(v ## n) << \"']\"\n#define ASSERT_CAPACITY(_q0, _q1, _q2, _q3, _q4) \\\n ASSERT_EQ(_q0, ds_cap(v0)) << _q0 << \" => \" << VECTOR_DUMP(0); \\\n ASSERT_EQ(_q1, ds_cap(v1)) << _q1 << \" => \" << VECTOR_DUMP(1); \\\n ASSERT_EQ(_q2, ds_cap(v2)) << _q2 << \" => \" << VECTOR_DUMP(2); \\\n ASSERT_EQ(_q3, ds_cap(v3)) << _q3 << \" => \" << VECTOR_DUMP(3); \\\n ASSERT_EQ(_q4, ds_cap(v4)) << _q4 << \" => \" << VECTOR_DUMP(4)\n#define ASSERT_SIZE(_s0, _s1, _s2, _s3, _s4) \\\n ASSERT_EQ(_s0, ds_size(v0)) << _s0 << \" => \" << VECTOR_DUMP(0); \\\n ASSERT_EQ(_s1, ds_size(v1)) << _s1 << \" => \" << VECTOR_DUMP(1); \\\n ASSERT_EQ(_s2, ds_size(v2)) << _s2 << \" => \" << VECTOR_DUMP(2); \\\n ASSERT_EQ(_s3, ds_size(v3)) << _s3 << \" => \" << VECTOR_DUMP(3); \\\n ASSERT_EQ(_s4, ds_size(v4)) << _s4 << \" => \" << VECTOR_DUMP(4)\n\n\nstruct VectorTest : public ::testing::Test {\n virtual void SetUp() {\n std::random_device rd;\n std::mt19937 eng(rd());\n\n std::uniform_int_distribution<> dist0(0, 10);\n std::uniform_int_distribution<> dist1(10, 100);\n std::uniform_int_distribution<> dist2(100, 1000);\n std::uniform_int_distribution<> dist3(1000, 10000);\n std::uniform_int_distribution<> dist4(10000, 100000);\n\n s0 = (size_t) dist0(eng);\n s1 = (size_t) dist1(eng);\n s2 = (size_t) dist2(eng);\n s3 = (size_t) dist3(eng);\n s4 = (size_t) dist4(eng);\n\n qRoundUp32();\n\n v0 = {0};\n v1 = {0};\n v2 = {0};\n v3 = {0};\n v4 = {0};\n }\n\n virtual void TearDown() {\n vec_dtor(v0);\n vec_dtor(v1);\n vec_dtor(v2);\n vec_dtor(v3);\n vec_dtor(v4);\n }\n\n void qRoundUp32() {\n q0 = roundup32(s0);\n q1 = roundup32(s1);\n q2 = roundup32(s2);\n q3 = roundup32(s3);\n q4 = roundup32(s4);\n\n if (q0 && q0 < UVEC_MIN_CAPACITY) q0 = UVEC_MIN_CAPACITY;\n }\n\n struct Point {\n long long x, y;\n };\n\n size_t s0, q0;\n size_t s1, q1;\n size_t s2, q2;\n size_t s3, q3;\n size_t s4, q4;\n\n vec_of(int) v0;\n vec_of(size_t) v1;\n vec_of(struct { int x; int y; }) v2;\n vec_of(Point) v3;\n vec_of(void *) v4;\n};\n\nTEST_F(VectorTest, grow) {\n ASSERT_CAPACITY(0, 0, 0, 0, 0);\n ASSERT_SIZE(0, 0, 0, 0, 0);\n\n vec_grow(v0, s0);\n vec_grow(v1, s1);\n vec_grow(v2, s2);\n vec_grow(v3, s3);\n vec_grow(v4, s4);\n\n ASSERT_CAPACITY(q0, q1, q2, q3, q4);\n ASSERT_SIZE(0, 0, 0, 0, 0);\n\n s0 *= 2;\n s1 *= 2;\n s2 *= 2;\n s3 *= 2;\n s4 *= 2;\n\n vec_grow(v0, s0);\n vec_grow(v1, s1);\n vec_grow(v2, s2);\n vec_grow(v3, s3);\n vec_grow(v4, s4);\n\n qRoundUp32();\n\n ASSERT_CAPACITY(q0, q1, q2, q3, q4);\n ASSERT_SIZE(0, 0, 0, 0, 0);\n\n vec_grow(v0, -(s0\/2));\n vec_grow(v1, -(s1\/2));\n vec_grow(v2, -(s2\/2));\n vec_grow(v3, -(s3\/2));\n vec_grow(v4, -(s4\/2));\n\n ASSERT_CAPACITY(q0, q1, q2, q3, q4);\n ASSERT_SIZE(0, 0, 0, 0, 0);\n\n vec_grow(v0, -s0);\n vec_grow(v1, -s1);\n vec_grow(v2, -s2);\n vec_grow(v3, -s3);\n vec_grow(v4, -s4);\n\n ASSERT_CAPACITY(q0, q1, q2, q3, q4);\n ASSERT_SIZE(0, 0, 0, 0, 0);\n\n vec_grow(v0, 1);\n vec_grow(v1, 1);\n vec_grow(v2, 1);\n vec_grow(v3, 1);\n vec_grow(v4, 1);\n\n ASSERT_CAPACITY((q0 ? q0 : UVEC_MIN_CAPACITY), q1, q2, q3, q4);\n ASSERT_SIZE(0, 0, 0, 0, 0);\n}\n\nTEST_F(VectorTest, reserve) {\n ASSERT_CAPACITY(0, 0, 0, 0, 0);\n ASSERT_SIZE(0, 0, 0, 0, 0);\n\n vec_reserve(v0, s0);\n vec_reserve(v1, s1);\n vec_reserve(v2, s2);\n vec_reserve(v3, s3);\n vec_reserve(v4, s4);\n\n ASSERT_CAPACITY(q0, q1, q2, q3, q4);\n ASSERT_SIZE(0, 0, 0, 0, 0);\n\n s0 *= 6;\n s1 *= 5;\n s2 *= 4;\n s3 *= 3;\n s4 *= 2;\n\n qRoundUp32();\n\n vec_reserve(v0, s0);\n vec_reserve(v1, s1);\n vec_reserve(v2, s2);\n vec_reserve(v3, s3);\n vec_reserve(v4, s4);\n\n ASSERT_CAPACITY(q0, q1, q2, q3, q4);\n ASSERT_SIZE(0, 0, 0, 0, 0);\n\n vec_reserve(v0, -s0);\n vec_reserve(v1, -s1);\n vec_reserve(v2, -s2);\n vec_reserve(v3, -s3);\n vec_reserve(v4, -s4);\n\n ASSERT_CAPACITY(q0, q1, q2, q3, q4);\n ASSERT_SIZE(0, 0, 0, 0, 0);\n}\n\nTEST_F(VectorTest, resize) {\n ASSERT_CAPACITY(0, 0, 0, 0, 0);\n ASSERT_SIZE(0, 0, 0, 0, 0);\n\n vec_resize(v0, s0);\n vec_resize(v1, s1);\n vec_resize(v2, s2);\n vec_resize(v3, s3);\n vec_resize(v4, s4);\n\n ASSERT_CAPACITY(q0, q1, q2, q3, q4);\n ASSERT_SIZE(s0, s1, s2, s3, s4);\n\n vec_resize(v0, -s0);\n vec_resize(v1, -s1);\n vec_resize(v2, -s2);\n vec_resize(v3, -s3);\n vec_resize(v4, -s4);\n\n ASSERT_CAPACITY(q0, q1, q2, q3, q4);\n ASSERT_SIZE(0, 0, 0, 0, 0);\n\n vec_resize(v0, -s0);\n vec_resize(v1, -s1);\n vec_resize(v2, -s2);\n vec_resize(v3, -s3);\n vec_resize(v4, -s4);\n\n ASSERT_CAPACITY(q0, q1, q2, q3, q4);\n ASSERT_SIZE(0, 0, 0, 0, 0);\n\n vec_resize(v0, 1);\n vec_resize(v1, 1);\n vec_resize(v2, 1);\n vec_resize(v3, 1);\n vec_resize(v4, 1);\n\n ASSERT_CAPACITY((q0 ? q0 : UVEC_MIN_CAPACITY), q1, q2, q3, q4);\n ASSERT_SIZE(1, 1, 1, 1, 1);\n\n vec_resize(v0, 0);\n vec_resize(v1, 0);\n vec_resize(v2, 0);\n vec_resize(v3, 0);\n vec_resize(v4, 0);\n\n ASSERT_CAPACITY((q0 ? q0 : UVEC_MIN_CAPACITY), q1, q2, q3, q4);\n ASSERT_SIZE(0, 0, 0, 0, 0);\n}\n\nTEST_F(VectorTest, push) {\n\n}\n<|endoftext|>"} {"text":"<commit_before>#include \"core\/os.h\"\n#include \"core\/stringutils.h\"\n\n#include <dirent.h>\n#include <iostream>\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ copied from https:\/\/stackoverflow.com\/a\/145309\/180307\n\n#include <cstdio> \/* defines FILENAME_MAX *\/\n#include <utility>\n#ifdef _MSC_VER\n#include <direct.h>\n#define GET_CURRENT_DIR _getcwd\n#else\n#include <unistd.h>\n#include <vector>\n\n#define GET_CURRENT_DIR getcwd\n#endif\n\nstd::string\nGetCurrentDirectory()\n{\n char current_directory[FILENAME_MAX];\n\n if(!GET_CURRENT_DIR(\n static_cast<char*>(current_directory), sizeof(current_directory)))\n {\n return \"\";\n }\n\n current_directory[sizeof(current_directory) - 1] = 0;\n\n const std::string ret = static_cast<char*>(current_directory);\n return ret;\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nDirectoryList\nListDirectory(const std::string& path)\n{\n DIR* dir;\n struct dirent* ent;\n dir = opendir(path.c_str());\n if(dir != nullptr)\n {\n DirectoryList ret;\n ret.valid = true;\n\n \/* print all the files and directories within directory *\/\n while((ent = readdir(dir)) != nullptr)\n {\n const std::string name = ent->d_name;\n if(ent->d_type == DT_REG)\n {\n ret.files.emplace_back(name);\n }\n else if(ent->d_type == DT_DIR)\n {\n if(name == \".\" || name == \"..\")\n {\n }\n else\n {\n ret.directories.emplace_back(name);\n }\n }\n }\n\n closedir(dir);\n return ret;\n }\n else\n {\n DirectoryList ret;\n ret.valid = false;\n return ret;\n }\n}\n\nbool\nEndsWith(const std::string& str, char c)\n{\n const auto l = str.length();\n\n if(l == 0)\n {\n return false;\n }\n\n return str[l - 1] == c;\n}\n\nstd::string\nJoinPath(const std::string& left, const std::string& right)\n{\n if(EndsWith(left, PATH_SEPARATOR))\n {\n return left + right;\n }\n else\n {\n return left + PATH_SEPARATOR + right;\n }\n}\n\nstd::string\nGetExtension(const std::string& path)\n{\n return LastStrings(path, '.').second;\n}\n\nstd::string\nGetFileNameIncludingExtension(const std::string& path)\n{\n const auto r = LastStrings(path, PATH_SEPARATOR).second;\n if(r.empty())\n {\n return r;\n }\n else\n {\n \/\/ skip leading path_separator\n return r.substr(1);\n }\n}\n\nstd::string\nGetFileNameWithoutExtension(const std::string& path)\n{\n return LastStrings(GetFileNameIncludingExtension(path), '.').first;\n}\n<commit_msg>added stackoverflow link<commit_after>#include \"core\/os.h\"\n#include \"core\/stringutils.h\"\n\n\/\/ https:\/\/stackoverflow.com\/questions\/612097\/how-can-i-get-the-list-of-files-in-a-directory-using-c-or-c\n#include <dirent.h>\n#include <iostream>\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ copied from https:\/\/stackoverflow.com\/a\/145309\/180307\n\n#include <cstdio> \/* defines FILENAME_MAX *\/\n#include <utility>\n#ifdef _MSC_VER\n#include <direct.h>\n#define GET_CURRENT_DIR _getcwd\n#else\n#include <unistd.h>\n#include <vector>\n\n#define GET_CURRENT_DIR getcwd\n#endif\n\nstd::string\nGetCurrentDirectory()\n{\n char current_directory[FILENAME_MAX];\n\n if(!GET_CURRENT_DIR(\n static_cast<char*>(current_directory), sizeof(current_directory)))\n {\n return \"\";\n }\n\n current_directory[sizeof(current_directory) - 1] = 0;\n\n const std::string ret = static_cast<char*>(current_directory);\n return ret;\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nDirectoryList\nListDirectory(const std::string& path)\n{\n DIR* dir;\n struct dirent* ent;\n dir = opendir(path.c_str());\n if(dir != nullptr)\n {\n DirectoryList ret;\n ret.valid = true;\n\n \/* print all the files and directories within directory *\/\n while((ent = readdir(dir)) != nullptr)\n {\n const std::string name = ent->d_name;\n if(ent->d_type == DT_REG)\n {\n ret.files.emplace_back(name);\n }\n else if(ent->d_type == DT_DIR)\n {\n if(name == \".\" || name == \"..\")\n {\n }\n else\n {\n ret.directories.emplace_back(name);\n }\n }\n }\n\n closedir(dir);\n return ret;\n }\n else\n {\n DirectoryList ret;\n ret.valid = false;\n return ret;\n }\n}\n\nbool\nEndsWith(const std::string& str, char c)\n{\n const auto l = str.length();\n\n if(l == 0)\n {\n return false;\n }\n\n return str[l - 1] == c;\n}\n\nstd::string\nJoinPath(const std::string& left, const std::string& right)\n{\n if(EndsWith(left, PATH_SEPARATOR))\n {\n return left + right;\n }\n else\n {\n return left + PATH_SEPARATOR + right;\n }\n}\n\nstd::string\nGetExtension(const std::string& path)\n{\n return LastStrings(path, '.').second;\n}\n\nstd::string\nGetFileNameIncludingExtension(const std::string& path)\n{\n const auto r = LastStrings(path, PATH_SEPARATOR).second;\n if(r.empty())\n {\n return r;\n }\n else\n {\n \/\/ skip leading path_separator\n return r.substr(1);\n }\n}\n\nstd::string\nGetFileNameWithoutExtension(const std::string& path)\n{\n return LastStrings(GetFileNameIncludingExtension(path), '.').first;\n}\n<|endoftext|>"} {"text":"<commit_before>\/*\n * Clever language\n * Copyright (c) 2010 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 * $Id: parser.y 67 2010-12-22 18:55:54Z felipensp $\n *\/\n\n#include <cstdlib>\n#include <iostream>\n#include \"opcodes.h\"\n#include \"vm.h\"\n\nnamespace clever {\n\n\/*\n * Destroy the opcodes data\n *\/\nVM::~VM(void) {\n\tOpcodeList::iterator it = m_opcodes->begin();\n\n\twhile (it < m_opcodes->end()) {\n\t\tif ((*it)->get_op1()) {\n\t\t\t(*it)->get_op1()->delRef();\n\t\t}\n\t\tif ((*it)->get_op2()) {\n\t\t\t(*it)->get_op2()->delRef();\n\t\t}\n\t\tif ((*it)->get_result()) {\n\t\t\t(*it)->get_result()->delRef();\n\t\t}\n\t\tdelete *it;\n\t\t++it;\n\t}\n}\n\n\/*\n * Displays an error message\n *\/\nvoid VM::error(const char* message) const {\n\tstd::cout << \"Runtime error: \" << message << std::endl;\n\texit(1);\n}\n\n\/*\n * Execute the collected opcodes\n *\/\nvoid VM::run(void) {\n\tunsigned int next_op, last_op = m_opcodes->size();\n\n\tm_symbols.pushVarMap(SymbolTable::var_map());\n\n\t\/\/ std::cout << \"Opcodes: \" << last_op << std::endl;\n\n\tfor (next_op = 0; next_op < last_op; ++next_op) {\n\t\tOpcode* opcode = (*m_opcodes)[next_op];\n\n\t\t(this->*(opcode->get_handler()))(&next_op, opcode);\n\t\t\/\/ std::cout << \"next: \" << next_op+1 << std::endl;\n\t}\n\n\tm_symbols.popVarMap();\n}\n\n\/*\n * echo statemenet\n *\/\nvoid VM::echo_handler(CLEVER_VM_HANDLER_ARGS) {\n\tValue* op1 = getValue(opcode->get_op1());\n\n\tstd::cout << op1->toString() << std::endl;\n}\n\n\/*\n * x + y\n *\/\nvoid VM::plus_handler(CLEVER_VM_HANDLER_ARGS) {\n\tValue* op1 = getValue(opcode->get_op1());\n\tValue* op2 = getValue(opcode->get_op2());\n\n\tif (op1->isConst() && op1->hasSameKind(op2)) {\n\t\tif (!op1->hasSameType(op2)) {\n\t\t\terror(\"Type mismatch!\");\n\t\t}\n\t\tswitch (op1->get_type()) {\n\t\t\tcase Value::STRING:\n\t\t\t\topcode->set_result(new ConstantValue(CSTRING(op1->getString() + op2->getString())));\n\t\t\t\tbreak;\n\t\t\tcase Value::INTEGER:\n\t\t\t\topcode->set_result(new ConstantValue(op1->getInteger() + op2->getInteger()));\n\t\t\t\tbreak;\n\t\t\tcase Value::DOUBLE:\n\t\t\t\topcode->set_result(new ConstantValue(op1->getDouble() + op2->getDouble()));\n\t\t\t\tbreak;\n\t\t}\n\t}\n}\n\n\/*\n * x \/ y\n *\/\nvoid VM::div_handler(CLEVER_VM_HANDLER_ARGS) {\n\tValue* op1 = getValue(opcode->get_op1());\n\tValue* op2 = getValue(opcode->get_op2());\n\n\tif (op1->isConst() && op1->hasSameKind(op2)) {\n\t\tif (!op1->hasSameType(op2)) {\n\t\t\terror(\"Type mismatch!\");\n\t\t}\n\t\tswitch (op1->get_type()) {\n\t\t\tcase Value::STRING:\n\t\t\t\terror(\"Operation not allow in strings!\");\n\t\t\t\tbreak;\n\t\t\tcase Value::INTEGER:\n\t\t\t\topcode->set_result(new ConstantValue(op1->getInteger() \/ op2->getInteger()));\n\t\t\t\tbreak;\n\t\t\tcase Value::DOUBLE:\n\t\t\t\topcode->set_result(new ConstantValue(op1->getDouble() \/ op2->getDouble()));\n\t\t\t\tbreak;\n\t\t}\n\t}\n}\n\n\/*\n * x - y\n *\/\nvoid VM::minus_handler(CLEVER_VM_HANDLER_ARGS) {\n\tValue* op1 = getValue(opcode->get_op1());\n\tValue* op2 = getValue(opcode->get_op2());\n\n\tif (op1->isConst() && op1->hasSameKind(op2)) {\n\t\tif (!op1->hasSameType(op2)) {\n\t\t\terror(\"Type mismatch!\");\n\t\t}\n\t\tswitch (op1->get_type()) {\n\t\t\tcase Value::STRING:\n\t\t\t\terror(\"Operation not allow in strings!\");\n\t\t\t\tbreak;\n\t\t\tcase Value::INTEGER:\n\t\t\t\topcode->set_result(new ConstantValue(op1->getInteger() - op2->getInteger()));\n\t\t\t\tbreak;\n\t\t\tcase Value::DOUBLE:\n\t\t\t\topcode->set_result(new ConstantValue(op1->getDouble() - op2->getDouble()));\n\t\t\t\tbreak;\n\t\t}\n\t}\n}\n\n\/*\n * x * y\n *\/\nvoid VM::mult_handler(CLEVER_VM_HANDLER_ARGS) {\n\tValue* op1 = getValue(opcode->get_op1());\n\tValue* op2 = getValue(opcode->get_op2());\n\n\tif (op1->isConst() && op1->hasSameKind(op2)) {\n\t\tif (!op1->hasSameType(op2)) {\n\t\t\terror(\"Type mismatch!\");\n\t\t}\n\t\tswitch (op1->get_type()) {\n\t\t\tcase Value::STRING:\n\t\t\t\terror(\"Operation not allow in strings!\");\n\t\t\t\tbreak;\n\t\t\tcase Value::INTEGER:\n\t\t\t\topcode->set_result(new ConstantValue(op1->getInteger() * op2->getInteger()));\n\t\t\t\tbreak;\n\t\t\tcase Value::DOUBLE:\n\t\t\t\topcode->set_result(new ConstantValue(op1->getDouble() * op2->getDouble()));\n\t\t\t\tbreak;\n\t\t}\n\t}\n}\n\n\/*\n * x & y\n *\/\nvoid VM::bw_and_handler(CLEVER_VM_HANDLER_ARGS) {\n\tValue* op1 = getValue(opcode->get_op1());\n\tValue* op2 = getValue(opcode->get_op2());\n\n\tif (op1->isConst() && op1->hasSameKind(op2)) {\n\t\tif (!op1->hasSameType(op2)) {\n\t\t\terror(\"Type mismatch!\");\n\t\t}\n\t\tswitch (op1->get_type()) {\n\t\t\tcase Value::STRING:\n\t\t\tcase Value::DOUBLE:\n\t\t\t\terror(\"Operation not allow for such type!\");\n\t\t\t\tbreak;\n\t\t\tcase Value::INTEGER:\n\t\t\t\topcode->set_result(new ConstantValue(op1->getInteger() & op2->getInteger()));\n\t\t\t\tbreak;\n\t\t}\n\t}\n}\n\n\/*\n * x ^ y\n *\/\nvoid VM::bw_xor_handler(CLEVER_VM_HANDLER_ARGS) {\n\tValue* op1 = getValue(opcode->get_op1());\n\tValue* op2 = getValue(opcode->get_op2());\n\n\tif (op1->isConst() && op1->hasSameKind(op2)) {\n\t\tif (!op1->hasSameType(op2)) {\n\t\t\terror(\"Type mismatch!\");\n\t\t}\n\t\tswitch (op1->get_type()) {\n\t\t\tcase Value::STRING:\n\t\t\tcase Value::DOUBLE:\n\t\t\t\terror(\"Operation not allow for such type!\");\n\t\t\t\tbreak;\n\t\t\tcase Value::INTEGER:\n\t\t\t\topcode->set_result(new ConstantValue(op1->getInteger() ^ op2->getInteger()));\n\t\t\t\tbreak;\n\t\t}\n\t}\n}\n\n\/*\n * x | y\n *\/\nvoid VM::bw_or_handler(CLEVER_VM_HANDLER_ARGS) {\n\tValue* op1 = getValue(opcode->get_op1());\n\tValue* op2 = getValue(opcode->get_op2());\n\n\tif (op1->isConst() && op1->hasSameKind(op2)) {\n\t\tif (!op1->hasSameType(op2)) {\n\t\t\terror(\"Type mismatch!\");\n\t\t}\n\t\tswitch (op1->get_type()) {\n\t\t\tcase Value::STRING:\n\t\t\tcase Value::DOUBLE:\n\t\t\t\terror(\"Operation not allow for such type!\");\n\t\t\t\tbreak;\n\t\t\tcase Value::INTEGER:\n\t\t\t\topcode->set_result(new ConstantValue(op1->getInteger() | op2->getInteger()));\n\t\t\t\tbreak;\n\t\t}\n\t}\n}\n\n\/*\n * {\n *\/\nvoid VM::new_scope_handler(CLEVER_VM_HANDLER_ARGS) {\n\tm_symbols.pushVarMap(SymbolTable::var_map());\n}\n\n\/*\n * }\n *\/\nvoid VM::end_scope_handler(CLEVER_VM_HANDLER_ARGS) {\n\tm_symbols.popVarMap();\n}\n\n\/*\n * Type var\n *\/\nvoid VM::var_decl_handler(CLEVER_VM_HANDLER_ARGS) {\n\tValue* value = getValue(opcode->get_op2());\n\n\t\/* TODO: Make the type initialization here *\/\n\tif (!value) {\n\t\terror(\"Uninitialized variable!\");\n\t}\n\tvalue->addRef();\n\n\tm_symbols.register_var(opcode->get_op1()->toString(), value);\n}\n\n\/*\n * ++x\n *\/\nvoid VM::pre_inc_handler(CLEVER_VM_HANDLER_ARGS) {\n\tValue* value = getValue(opcode->get_op1());\n\n\tif (value->isConst()) {\n\t\tswitch (value->get_type()) {\n\t\t\tcase Value::INTEGER:\n\t\t\t\tvalue->setInteger(value->getInteger()+1);\n\t\t\t\topcode->set_result(new ConstantValue(value->getInteger()));\n\t\t\t\tbreak;\n\t\t\tcase Value::DOUBLE:\n\t\t\t\tvalue->setDouble(value->getDouble()+1);\n\t\t\t\topcode->set_result(new ConstantValue(value->getDouble()));\n\t\t\t\tbreak;\n\t\t\tdefault:\n\t\t\t\terror(\"Operation unsupported for such type\");\n\t\t\t\tbreak;\n\t\t}\n\t}\n}\n\n\/*\n * x++\n *\/\nvoid VM::pos_inc_handler(CLEVER_VM_HANDLER_ARGS) {\n\tValue* value = getValue(opcode->get_op1());\n\n\tif (value->isConst()) {\n\t\tswitch (value->get_type()) {\n\t\t\tcase Value::INTEGER:\n\t\t\t\topcode->set_result(new ConstantValue(value->getInteger()));\n\t\t\t\tvalue->setInteger(value->getInteger()+1);\n\t\t\t\tbreak;\n\t\t\tcase Value::DOUBLE:\n\t\t\t\topcode->set_result(new ConstantValue(value->getDouble()));\n\t\t\t\tvalue->setDouble(value->getDouble()+1);\n\t\t\t\tbreak;\n\t\t\tdefault:\n\t\t\t\terror(\"Operation unsupported for such type\");\n\t\t\t\tbreak;\n\t\t}\n\t}\n}\n\n\/*\n * --x\n *\/\nvoid VM::pre_dec_handler(CLEVER_VM_HANDLER_ARGS) {\n\tValue* value = getValue(opcode->get_op1());\n\n\tif (value->isConst()) {\n\t\tswitch (value->get_type()) {\n\t\t\tcase Value::INTEGER:\n\t\t\t\tvalue->setInteger(value->getInteger()-1);\n\t\t\t\topcode->set_result(new ConstantValue(value->getInteger()));\n\t\t\t\tbreak;\n\t\t\tcase Value::DOUBLE:\n\t\t\t\tvalue->setDouble(value->getDouble()-1);\n\t\t\t\topcode->set_result(new ConstantValue(value->getDouble()));\n\t\t\t\tbreak;\n\t\t\tdefault:\n\t\t\t\terror(\"Operation unsupported for such type\");\n\t\t\t\tbreak;\n\t\t}\n\t}\n}\n\n\/*\n * x--\n *\/\nvoid VM::pos_dec_handler(CLEVER_VM_HANDLER_ARGS) {\n\tValue* value = getValue(opcode->get_op1());\n\n\tif (value->isConst()) {\n\t\tswitch (value->get_type()) {\n\t\t\tcase Value::INTEGER:\n\t\t\t\topcode->set_result(new ConstantValue(value->getInteger()));\n\t\t\t\tvalue->setInteger(value->getInteger()-1);\n\t\t\t\tbreak;\n\t\t\tcase Value::DOUBLE:\n\t\t\t\topcode->set_result(new ConstantValue(value->getDouble()));\n\t\t\t\tvalue->setDouble(value->getDouble()-1);\n\t\t\t\tbreak;\n\t\t\tdefault:\n\t\t\t\terror(\"Operation unsupported for such type\");\n\t\t\t\tbreak;\n\t\t}\n\t}\n}\n\n\/*\n * JMPZ\n *\/\nvoid VM::jmpz_handler(CLEVER_VM_HANDLER_ARGS) {\n\tValue* value = getValue(opcode->get_op1());\n\n\tif (value->isConst()) {\n\t\tswitch (value->get_type()) {\n\t\t\tcase Value::INTEGER:\n\t\t\t\tif (value->getInteger() == 0) {\n\t\t\t\t\t\/\/ std::cout << \"jmp to \" << opcode->get_jmp_addr1() << std::endl;\n\t\t\t\t\tVM_GOTO(opcode->get_jmp_addr1());\n\t\t\t\t}\n\t\t\t\tbreak;\n\t\t}\n\t}\n}\n\n\/*\n * JMP\n *\/\nvoid VM::jmp_handler(CLEVER_VM_HANDLER_ARGS) {\n\t\/\/ std::cout << \"> jmp to \" << opcode->get_jmp_addr2()-1 << std::endl;\n\tVM_GOTO(opcode->get_jmp_addr2());\n}\n\n} \/\/ clever\n<commit_msg>- Removed unnecessary \"new ConstatValue\"<commit_after>\/*\n * Clever language\n * Copyright (c) 2010 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 * $Id: parser.y 67 2010-12-22 18:55:54Z felipensp $\n *\/\n\n#include <cstdlib>\n#include <iostream>\n#include \"opcodes.h\"\n#include \"vm.h\"\n\nnamespace clever {\n\n\/*\n * Destroy the opcodes data\n *\/\nVM::~VM(void) {\n\tOpcodeList::iterator it = m_opcodes->begin();\n\n\twhile (it < m_opcodes->end()) {\n\t\tif ((*it)->get_op1()) {\n\t\t\t(*it)->get_op1()->delRef();\n\t\t}\n\t\tif ((*it)->get_op2()) {\n\t\t\t(*it)->get_op2()->delRef();\n\t\t}\n\t\tif ((*it)->get_result()) {\n\t\t\t(*it)->get_result()->delRef();\n\t\t}\n\t\tdelete *it;\n\t\t++it;\n\t}\n}\n\n\/*\n * Displays an error message\n *\/\nvoid VM::error(const char* message) const {\n\tstd::cout << \"Runtime error: \" << message << std::endl;\n\texit(1);\n}\n\n\/*\n * Execute the collected opcodes\n *\/\nvoid VM::run(void) {\n\tunsigned int next_op, last_op = m_opcodes->size();\n\n\tm_symbols.pushVarMap(SymbolTable::var_map());\n\n\t\/\/ std::cout << \"Opcodes: \" << last_op << std::endl;\n\n\tfor (next_op = 0; next_op < last_op; ++next_op) {\n\t\tOpcode* opcode = (*m_opcodes)[next_op];\n\n\t\t(this->*(opcode->get_handler()))(&next_op, opcode);\n\t\t\/\/ std::cout << \"next: \" << next_op+1 << std::endl;\n\t}\n\n\tm_symbols.popVarMap();\n}\n\n\/*\n * echo statemenet\n *\/\nvoid VM::echo_handler(CLEVER_VM_HANDLER_ARGS) {\n\tValue* op1 = getValue(opcode->get_op1());\n\n\tstd::cout << op1->toString() << std::endl;\n}\n\n\/*\n * x + y\n *\/\nvoid VM::plus_handler(CLEVER_VM_HANDLER_ARGS) {\n\tValue* op1 = getValue(opcode->get_op1());\n\tValue* op2 = getValue(opcode->get_op2());\n\n\tif (op1->isConst() && op1->hasSameKind(op2)) {\n\t\tif (!op1->hasSameType(op2)) {\n\t\t\terror(\"Type mismatch!\");\n\t\t}\n\t\tswitch (op1->get_type()) {\n\t\t\tcase Value::STRING:\n\t\t\t\topcode->set_result(new ConstantValue(CSTRING(op1->getString() + op2->getString())));\n\t\t\t\tbreak;\n\t\t\tcase Value::INTEGER:\n\t\t\t\topcode->set_result(new ConstantValue(op1->getInteger() + op2->getInteger()));\n\t\t\t\tbreak;\n\t\t\tcase Value::DOUBLE:\n\t\t\t\topcode->set_result(new ConstantValue(op1->getDouble() + op2->getDouble()));\n\t\t\t\tbreak;\n\t\t}\n\t}\n}\n\n\/*\n * x \/ y\n *\/\nvoid VM::div_handler(CLEVER_VM_HANDLER_ARGS) {\n\tValue* op1 = getValue(opcode->get_op1());\n\tValue* op2 = getValue(opcode->get_op2());\n\n\tif (op1->isConst() && op1->hasSameKind(op2)) {\n\t\tif (!op1->hasSameType(op2)) {\n\t\t\terror(\"Type mismatch!\");\n\t\t}\n\t\tswitch (op1->get_type()) {\n\t\t\tcase Value::STRING:\n\t\t\t\terror(\"Operation not allow in strings!\");\n\t\t\t\tbreak;\n\t\t\tcase Value::INTEGER:\n\t\t\t\topcode->set_result(new ConstantValue(op1->getInteger() \/ op2->getInteger()));\n\t\t\t\tbreak;\n\t\t\tcase Value::DOUBLE:\n\t\t\t\topcode->set_result(new ConstantValue(op1->getDouble() \/ op2->getDouble()));\n\t\t\t\tbreak;\n\t\t}\n\t}\n}\n\n\/*\n * x - y\n *\/\nvoid VM::minus_handler(CLEVER_VM_HANDLER_ARGS) {\n\tValue* op1 = getValue(opcode->get_op1());\n\tValue* op2 = getValue(opcode->get_op2());\n\n\tif (op1->isConst() && op1->hasSameKind(op2)) {\n\t\tif (!op1->hasSameType(op2)) {\n\t\t\terror(\"Type mismatch!\");\n\t\t}\n\t\tswitch (op1->get_type()) {\n\t\t\tcase Value::STRING:\n\t\t\t\terror(\"Operation not allow in strings!\");\n\t\t\t\tbreak;\n\t\t\tcase Value::INTEGER:\n\t\t\t\topcode->set_result(new ConstantValue(op1->getInteger() - op2->getInteger()));\n\t\t\t\tbreak;\n\t\t\tcase Value::DOUBLE:\n\t\t\t\topcode->set_result(new ConstantValue(op1->getDouble() - op2->getDouble()));\n\t\t\t\tbreak;\n\t\t}\n\t}\n}\n\n\/*\n * x * y\n *\/\nvoid VM::mult_handler(CLEVER_VM_HANDLER_ARGS) {\n\tValue* op1 = getValue(opcode->get_op1());\n\tValue* op2 = getValue(opcode->get_op2());\n\n\tif (op1->isConst() && op1->hasSameKind(op2)) {\n\t\tif (!op1->hasSameType(op2)) {\n\t\t\terror(\"Type mismatch!\");\n\t\t}\n\t\tswitch (op1->get_type()) {\n\t\t\tcase Value::STRING:\n\t\t\t\terror(\"Operation not allow in strings!\");\n\t\t\t\tbreak;\n\t\t\tcase Value::INTEGER:\n\t\t\t\topcode->set_result(new ConstantValue(op1->getInteger() * op2->getInteger()));\n\t\t\t\tbreak;\n\t\t\tcase Value::DOUBLE:\n\t\t\t\topcode->set_result(new ConstantValue(op1->getDouble() * op2->getDouble()));\n\t\t\t\tbreak;\n\t\t}\n\t}\n}\n\n\/*\n * x & y\n *\/\nvoid VM::bw_and_handler(CLEVER_VM_HANDLER_ARGS) {\n\tValue* op1 = getValue(opcode->get_op1());\n\tValue* op2 = getValue(opcode->get_op2());\n\n\tif (op1->isConst() && op1->hasSameKind(op2)) {\n\t\tif (!op1->hasSameType(op2)) {\n\t\t\terror(\"Type mismatch!\");\n\t\t}\n\t\tswitch (op1->get_type()) {\n\t\t\tcase Value::STRING:\n\t\t\tcase Value::DOUBLE:\n\t\t\t\terror(\"Operation not allow for such type!\");\n\t\t\t\tbreak;\n\t\t\tcase Value::INTEGER:\n\t\t\t\topcode->set_result(new ConstantValue(op1->getInteger() & op2->getInteger()));\n\t\t\t\tbreak;\n\t\t}\n\t}\n}\n\n\/*\n * x ^ y\n *\/\nvoid VM::bw_xor_handler(CLEVER_VM_HANDLER_ARGS) {\n\tValue* op1 = getValue(opcode->get_op1());\n\tValue* op2 = getValue(opcode->get_op2());\n\n\tif (op1->isConst() && op1->hasSameKind(op2)) {\n\t\tif (!op1->hasSameType(op2)) {\n\t\t\terror(\"Type mismatch!\");\n\t\t}\n\t\tswitch (op1->get_type()) {\n\t\t\tcase Value::STRING:\n\t\t\tcase Value::DOUBLE:\n\t\t\t\terror(\"Operation not allow for such type!\");\n\t\t\t\tbreak;\n\t\t\tcase Value::INTEGER:\n\t\t\t\topcode->set_result(new ConstantValue(op1->getInteger() ^ op2->getInteger()));\n\t\t\t\tbreak;\n\t\t}\n\t}\n}\n\n\/*\n * x | y\n *\/\nvoid VM::bw_or_handler(CLEVER_VM_HANDLER_ARGS) {\n\tValue* op1 = getValue(opcode->get_op1());\n\tValue* op2 = getValue(opcode->get_op2());\n\n\tif (op1->isConst() && op1->hasSameKind(op2)) {\n\t\tif (!op1->hasSameType(op2)) {\n\t\t\terror(\"Type mismatch!\");\n\t\t}\n\t\tswitch (op1->get_type()) {\n\t\t\tcase Value::STRING:\n\t\t\tcase Value::DOUBLE:\n\t\t\t\terror(\"Operation not allow for such type!\");\n\t\t\t\tbreak;\n\t\t\tcase Value::INTEGER:\n\t\t\t\topcode->set_result(new ConstantValue(op1->getInteger() | op2->getInteger()));\n\t\t\t\tbreak;\n\t\t}\n\t}\n}\n\n\/*\n * {\n *\/\nvoid VM::new_scope_handler(CLEVER_VM_HANDLER_ARGS) {\n\tm_symbols.pushVarMap(SymbolTable::var_map());\n}\n\n\/*\n * }\n *\/\nvoid VM::end_scope_handler(CLEVER_VM_HANDLER_ARGS) {\n\tm_symbols.popVarMap();\n}\n\n\/*\n * Type var\n *\/\nvoid VM::var_decl_handler(CLEVER_VM_HANDLER_ARGS) {\n\tValue* value = getValue(opcode->get_op2());\n\n\t\/* TODO: Make the type initialization here *\/\n\tif (!value) {\n\t\terror(\"Uninitialized variable!\");\n\t}\n\tvalue->addRef();\n\n\tm_symbols.register_var(opcode->get_op1()->toString(), value);\n}\n\n\/*\n * ++x\n *\/\nvoid VM::pre_inc_handler(CLEVER_VM_HANDLER_ARGS) {\n\tValue* value = getValue(opcode->get_op1());\n\n\tif (value->isConst()) {\n\t\tswitch (value->get_type()) {\n\t\t\tcase Value::INTEGER:\n\t\t\t\tvalue->setInteger(value->getInteger()+1);\n\t\t\t\topcode->set_result(value);\n\t\t\t\tvalue->addRef();\n\t\t\t\tbreak;\n\t\t\tcase Value::DOUBLE:\n\t\t\t\tvalue->setDouble(value->getDouble()+1);\n\t\t\t\topcode->set_result(value);\n\t\t\t\tvalue->addRef();\n\t\t\t\tbreak;\n\t\t\tdefault:\n\t\t\t\terror(\"Operation unsupported for such type\");\n\t\t\t\tbreak;\n\t\t}\n\t}\n}\n\n\/*\n * x++\n *\/\nvoid VM::pos_inc_handler(CLEVER_VM_HANDLER_ARGS) {\n\tValue* value = getValue(opcode->get_op1());\n\n\tif (value->isConst()) {\n\t\tswitch (value->get_type()) {\n\t\t\tcase Value::INTEGER:\n\t\t\t\topcode->set_result(new ConstantValue(value->getInteger()));\n\t\t\t\tvalue->setInteger(value->getInteger()+1);\n\t\t\t\tbreak;\n\t\t\tcase Value::DOUBLE:\n\t\t\t\topcode->set_result(new ConstantValue(value->getDouble()));\n\t\t\t\tvalue->setDouble(value->getDouble()+1);\n\t\t\t\tbreak;\n\t\t\tdefault:\n\t\t\t\terror(\"Operation unsupported for such type\");\n\t\t\t\tbreak;\n\t\t}\n\t}\n}\n\n\/*\n * --x\n *\/\nvoid VM::pre_dec_handler(CLEVER_VM_HANDLER_ARGS) {\n\tValue* value = getValue(opcode->get_op1());\n\n\tif (value->isConst()) {\n\t\tswitch (value->get_type()) {\n\t\t\tcase Value::INTEGER:\n\t\t\t\tvalue->setInteger(value->getInteger()-1);\n\t\t\t\topcode->set_result(value);\n\t\t\t\tvalue->addRef();\n\t\t\t\tbreak;\n\t\t\tcase Value::DOUBLE:\n\t\t\t\tvalue->setDouble(value->getDouble()-1);\n\t\t\t\topcode->set_result(value);\n\t\t\t\tvalue->addRef();\n\t\t\t\tbreak;\n\t\t\tdefault:\n\t\t\t\terror(\"Operation unsupported for such type\");\n\t\t\t\tbreak;\n\t\t}\n\t}\n}\n\n\/*\n * x--\n *\/\nvoid VM::pos_dec_handler(CLEVER_VM_HANDLER_ARGS) {\n\tValue* value = getValue(opcode->get_op1());\n\n\tif (value->isConst()) {\n\t\tswitch (value->get_type()) {\n\t\t\tcase Value::INTEGER:\n\t\t\t\topcode->set_result(new ConstantValue(value->getInteger()));\n\t\t\t\tvalue->setInteger(value->getInteger()-1);\n\t\t\t\tbreak;\n\t\t\tcase Value::DOUBLE:\n\t\t\t\topcode->set_result(new ConstantValue(value->getDouble()));\n\t\t\t\tvalue->setDouble(value->getDouble()-1);\n\t\t\t\tbreak;\n\t\t\tdefault:\n\t\t\t\terror(\"Operation unsupported for such type\");\n\t\t\t\tbreak;\n\t\t}\n\t}\n}\n\n\/*\n * JMPZ\n *\/\nvoid VM::jmpz_handler(CLEVER_VM_HANDLER_ARGS) {\n\tValue* value = getValue(opcode->get_op1());\n\n\tif (value->isConst()) {\n\t\tswitch (value->get_type()) {\n\t\t\tcase Value::INTEGER:\n\t\t\t\tif (value->getInteger() == 0) {\n\t\t\t\t\t\/\/ std::cout << \"jmp to \" << opcode->get_jmp_addr1() << std::endl;\n\t\t\t\t\tVM_GOTO(opcode->get_jmp_addr1());\n\t\t\t\t}\n\t\t\t\tbreak;\n\t\t}\n\t}\n}\n\n\/*\n * JMP\n *\/\nvoid VM::jmp_handler(CLEVER_VM_HANDLER_ARGS) {\n\t\/\/ std::cout << \"> jmp to \" << opcode->get_jmp_addr2()-1 << std::endl;\n\tVM_GOTO(opcode->get_jmp_addr2());\n}\n\n} \/\/ clever\n<|endoftext|>"} {"text":"<commit_before>\/\/ Jubatus: Online machine learning framework for distributed environment\n\/\/ Copyright (C) 2011,2012 Preferred Infrastructure and Nippon Telegraph and Telephone Corporation.\n\/\/\n\/\/ This library is free software; you can redistribute it and\/or\n\/\/ modify it under the terms of the GNU Lesser General Public\n\/\/ License version 2.1 as published by the Free Software Foundation.\n\/\/\n\/\/ This library is distributed in the hope that it will be useful,\n\/\/ but WITHOUT ANY WARRANTY; without even the implied warranty of\n\/\/ MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU\n\/\/ Lesser General Public License for more details.\n\/\/\n\/\/ You should have received a copy of the GNU Lesser General Public\n\/\/ License along with this library; if not, write to the Free Software\n\/\/ Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA\n\n#ifndef JUBATUS_CORE_GRAPH_GRAPH_BASE_HPP_\n#define JUBATUS_CORE_GRAPH_GRAPH_BASE_HPP_\n\n#include <stdint.h>\n\n#include <map>\n#include <string>\n#include <vector>\n\n#include \"graph_type.hpp\"\n\nnamespace jubatus {\nnamespace core {\nnamespace graph {\n\nclass graph_base {\n public:\n graph_base();\n virtual ~graph_base();\n\n virtual void clear() = 0;\n virtual void create_node(node_id_t id) = 0;\n virtual void create_global_node(node_id_t id) = 0;\n virtual void remove_global_node(node_id_t id) = 0;\n virtual void update_node(node_id_t id, const property& p) = 0;\n virtual void remove_node(node_id_t id) = 0;\n virtual void create_edge(edge_id_t eid, node_id_t src, node_id_t tgt) = 0;\n virtual void update_edge(edge_id_t eid, const property& p) = 0;\n virtual void remove_edge(edge_id_t eid) = 0;\n\n virtual void add_centrality_query(const preset_query&) = 0;\n virtual void add_shortest_path_query(const preset_query&) = 0;\n virtual void remove_centrality_query(const preset_query&) = 0;\n virtual void remove_shortest_path_query(const preset_query&) = 0;\n\n virtual double centrality(\n node_id_t id,\n centrality_type ct,\n const preset_query&) const = 0;\n\n virtual void shortest_path(\n node_id_t src,\n node_id_t tgt,\n uint64_t max_hop,\n std::vector<node_id_t>& ret,\n const preset_query&) const = 0;\n\n virtual void get_node(node_id_t id, node_info& ret) const = 0;\n virtual void get_edge(edge_id_t id, edge_info& ret) const = 0;\n\n virtual std::string type() const = 0;\n\n virtual void get_status(std::map<std::string, std::string>& status) const = 0;\n virtual void update_index() = 0;\n\n virtual void get_diff(std::string& diff) const = 0;\n virtual void set_mixed_and_clear_diff(const std::string& mixed) = 0;\n\n void save(std::ostream&);\n void load(std::istream&);\n\n protected:\n virtual bool save_imp(std::ostream& os) = 0;\n virtual bool load_imp(std::istream& is) = 0;\n};\n\n} \/\/ namespace graph\n} \/\/ namespace core\n} \/\/ namespace jubatus\n\n#endif \/\/ JUBATUS_CORE_GRAPH_GRAPH_BASE_HPP_\n<commit_msg>Replaced protected with private in jubatus\/core\/graph\/graph_base.hpp (#347).<commit_after>\/\/ Jubatus: Online machine learning framework for distributed environment\n\/\/ Copyright (C) 2011,2012 Preferred Infrastructure and Nippon Telegraph and Telephone Corporation.\n\/\/\n\/\/ This library is free software; you can redistribute it and\/or\n\/\/ modify it under the terms of the GNU Lesser General Public\n\/\/ License version 2.1 as published by the Free Software Foundation.\n\/\/\n\/\/ This library is distributed in the hope that it will be useful,\n\/\/ but WITHOUT ANY WARRANTY; without even the implied warranty of\n\/\/ MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU\n\/\/ Lesser General Public License for more details.\n\/\/\n\/\/ You should have received a copy of the GNU Lesser General Public\n\/\/ License along with this library; if not, write to the Free Software\n\/\/ Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA\n\n#ifndef JUBATUS_CORE_GRAPH_GRAPH_BASE_HPP_\n#define JUBATUS_CORE_GRAPH_GRAPH_BASE_HPP_\n\n#include <stdint.h>\n\n#include <map>\n#include <string>\n#include <vector>\n\n#include \"graph_type.hpp\"\n\nnamespace jubatus {\nnamespace core {\nnamespace graph {\n\nclass graph_base {\n public:\n graph_base();\n virtual ~graph_base();\n\n virtual void clear() = 0;\n virtual void create_node(node_id_t id) = 0;\n virtual void create_global_node(node_id_t id) = 0;\n virtual void remove_global_node(node_id_t id) = 0;\n virtual void update_node(node_id_t id, const property& p) = 0;\n virtual void remove_node(node_id_t id) = 0;\n virtual void create_edge(edge_id_t eid, node_id_t src, node_id_t tgt) = 0;\n virtual void update_edge(edge_id_t eid, const property& p) = 0;\n virtual void remove_edge(edge_id_t eid) = 0;\n\n virtual void add_centrality_query(const preset_query&) = 0;\n virtual void add_shortest_path_query(const preset_query&) = 0;\n virtual void remove_centrality_query(const preset_query&) = 0;\n virtual void remove_shortest_path_query(const preset_query&) = 0;\n\n virtual double centrality(\n node_id_t id,\n centrality_type ct,\n const preset_query&) const = 0;\n\n virtual void shortest_path(\n node_id_t src,\n node_id_t tgt,\n uint64_t max_hop,\n std::vector<node_id_t>& ret,\n const preset_query&) const = 0;\n\n virtual void get_node(node_id_t id, node_info& ret) const = 0;\n virtual void get_edge(edge_id_t id, edge_info& ret) const = 0;\n\n virtual std::string type() const = 0;\n\n virtual void get_status(std::map<std::string, std::string>& status) const = 0;\n virtual void update_index() = 0;\n\n virtual void get_diff(std::string& diff) const = 0;\n virtual void set_mixed_and_clear_diff(const std::string& mixed) = 0;\n\n void save(std::ostream&);\n void load(std::istream&);\n\n private:\n virtual bool save_imp(std::ostream& os) = 0;\n virtual bool load_imp(std::istream& is) = 0;\n};\n\n} \/\/ namespace graph\n} \/\/ namespace core\n} \/\/ namespace jubatus\n\n#endif \/\/ JUBATUS_CORE_GRAPH_GRAPH_BASE_HPP_\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 \"scene_instance.h\"\n#include \"scene.h\"\n\nnamespace embree\n{\n#if defined(EMBREE_LOWEST_ISA)\n\n Instance::Instance (Device* device, Accel* object, unsigned int numTimeSteps) \n : Geometry(device,Geometry::GTY_INSTANCE_CHEAP,1,numTimeSteps), object(object), local2world(nullptr)\n {\n if (object) object->refInc();\n world2local0 = one;\n local2world = (AffineSpace3fa*) alignedMalloc(numTimeSteps*sizeof(AffineSpace3fa),16);\n for (size_t i = 0; i < numTimeSteps; i++)\n local2world[i] = one;\n }\n\n Instance::~Instance()\n {\n alignedFree(local2world);\n if (object) object->refDec();\n }\n\n void Instance::enabling () {\n if (numTimeSteps == 1) {\n if (this->gtype == Geometry::GTY_INSTANCE_CHEAP) {\n scene->world.numInstancesCheap += numPrimitives;\n } else {\n scene->world.numInstancesExpensive += numPrimitives;\n }\n } else {\n if (this->gtype == Geometry::GTY_INSTANCE_EXPENSIVE) {\n scene->worldMB.numInstancesCheap += numPrimitives;\n } else {\n scene->worldMB.numInstancesExpensive += numPrimitives;\n }\n }\n }\n \n void Instance::disabling() { \n if (numTimeSteps == 1) {\n if (this->gtype == Geometry::GTY_INSTANCE_CHEAP) {\n scene->world.numInstancesCheap -= numPrimitives;\n } else {\n scene->world.numInstancesExpensive -= numPrimitives;\n }\n } else {\n if (this->gtype == Geometry::GTY_INSTANCE_EXPENSIVE) {\n scene->worldMB.numInstancesCheap -= numPrimitives;\n } else {\n scene->worldMB.numInstancesExpensive -= numPrimitives;\n }\n }\n }\n \n void Instance::setNumTimeSteps (unsigned int numTimeSteps_in)\n {\n if (numTimeSteps_in == numTimeSteps)\n return;\n \n AffineSpace3fa* local2world2 = (AffineSpace3fa*) alignedMalloc(numTimeSteps_in*sizeof(AffineSpace3fa),16);\n \n for (size_t i = 0; i < min(numTimeSteps, numTimeSteps_in); i++)\n local2world2[i] = local2world[i];\n\n for (size_t i = numTimeSteps; i < numTimeSteps_in; i++)\n local2world2[i] = one;\n \n alignedFree(local2world);\n local2world = local2world2;\n \n Geometry::setNumTimeSteps(numTimeSteps_in);\n }\n\n void Instance::setInstancedScene(const Ref<Scene>& scene)\n {\n if (object) object->refDec();\n object = scene.ptr;\n if (object) object->refInc();\n auto numExpensiveGeo = scene->getNumPrimitives<CurveGeometry, false>()\n + scene->getNumPrimitives<CurveGeometry, true>()\n + scene->getNumPrimitives<UserGeometry, false>()\n + scene->getNumPrimitives<UserGeometry, true>();\n if (numExpensiveGeo > 0) {\n this->gtype = GTY_INSTANCE_EXPENSIVE;\n }\n Geometry::update();\n }\n \n void Instance::setTransform(const AffineSpace3fa& xfm, unsigned int timeStep)\n {\n if (timeStep >= numTimeSteps)\n throw_RTCError(RTC_ERROR_INVALID_OPERATION,\"invalid timestep\");\n\n local2world[timeStep] = xfm;\n if (timeStep == 0)\n world2local0 = rcp(xfm);\n }\n\n AffineSpace3fa Instance::getTransform(float time)\n {\n if (likely(numTimeSteps <= 1))\n return getLocal2World();\n else\n return getLocal2World(time);\n }\n \n void Instance::setMask (unsigned mask) \n {\n this->mask = mask; \n Geometry::update();\n }\n \n#endif\n\n namespace isa\n {\n Instance* createInstance(Device* device) {\n return new InstanceISA(device);\n }\n }\n}\n<commit_msg>fix motion blur bug with new instance split<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 \"scene_instance.h\"\n#include \"scene.h\"\n\nnamespace embree\n{\n#if defined(EMBREE_LOWEST_ISA)\n\n Instance::Instance (Device* device, Accel* object, unsigned int numTimeSteps) \n : Geometry(device,Geometry::GTY_INSTANCE_CHEAP,1,numTimeSteps), object(object), local2world(nullptr)\n {\n if (object) object->refInc();\n world2local0 = one;\n local2world = (AffineSpace3fa*) alignedMalloc(numTimeSteps*sizeof(AffineSpace3fa),16);\n for (size_t i = 0; i < numTimeSteps; i++)\n local2world[i] = one;\n }\n\n Instance::~Instance()\n {\n alignedFree(local2world);\n if (object) object->refDec();\n }\n\n void Instance::enabling () {\n if (numTimeSteps == 1) {\n if (this->gtype == Geometry::GTY_INSTANCE_CHEAP) {\n scene->world.numInstancesCheap += numPrimitives;\n } else {\n scene->world.numInstancesExpensive += numPrimitives;\n }\n } else {\n if (this->gtype == Geometry::GTY_INSTANCE_CHEAP) {\n scene->worldMB.numInstancesCheap += numPrimitives;\n } else {\n scene->worldMB.numInstancesExpensive += numPrimitives;\n }\n }\n }\n \n void Instance::disabling() { \n if (numTimeSteps == 1) {\n if (this->gtype == Geometry::GTY_INSTANCE_CHEAP) {\n scene->world.numInstancesCheap -= numPrimitives;\n } else {\n scene->world.numInstancesExpensive -= numPrimitives;\n }\n } else {\n if (this->gtype == Geometry::GTY_INSTANCE_CHEAP) {\n scene->worldMB.numInstancesCheap -= numPrimitives;\n } else {\n scene->worldMB.numInstancesExpensive -= numPrimitives;\n }\n }\n }\n \n void Instance::setNumTimeSteps (unsigned int numTimeSteps_in)\n {\n if (numTimeSteps_in == numTimeSteps)\n return;\n \n AffineSpace3fa* local2world2 = (AffineSpace3fa*) alignedMalloc(numTimeSteps_in*sizeof(AffineSpace3fa),16);\n \n for (size_t i = 0; i < min(numTimeSteps, numTimeSteps_in); i++)\n local2world2[i] = local2world[i];\n\n for (size_t i = numTimeSteps; i < numTimeSteps_in; i++)\n local2world2[i] = one;\n \n alignedFree(local2world);\n local2world = local2world2;\n \n Geometry::setNumTimeSteps(numTimeSteps_in);\n }\n\n void Instance::setInstancedScene(const Ref<Scene>& scene)\n {\n if (object) object->refDec();\n object = scene.ptr;\n if (object) object->refInc();\n auto numExpensiveGeo = scene->getNumPrimitives<CurveGeometry, false>()\n + scene->getNumPrimitives<CurveGeometry, true>()\n + scene->getNumPrimitives<UserGeometry, false>()\n + scene->getNumPrimitives<UserGeometry, true>();\n if (numExpensiveGeo > 0) {\n this->gtype = GTY_INSTANCE_EXPENSIVE;\n }\n Geometry::update();\n }\n \n void Instance::setTransform(const AffineSpace3fa& xfm, unsigned int timeStep)\n {\n if (timeStep >= numTimeSteps)\n throw_RTCError(RTC_ERROR_INVALID_OPERATION,\"invalid timestep\");\n\n local2world[timeStep] = xfm;\n if (timeStep == 0)\n world2local0 = rcp(xfm);\n }\n\n AffineSpace3fa Instance::getTransform(float time)\n {\n if (likely(numTimeSteps <= 1))\n return getLocal2World();\n else\n return getLocal2World(time);\n }\n \n void Instance::setMask (unsigned mask) \n {\n this->mask = mask; \n Geometry::update();\n }\n \n#endif\n\n namespace isa\n {\n Instance* createInstance(Device* device) {\n return new InstanceISA(device);\n }\n }\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 dagger.cpp\n * @author Gav Wood <i@gavwood.com>\n * @date 2014\n * Dashimoto test functions.\n *\/\n\n#include <fstream>\n#include <random>\n#include \"JsonSpiritHeaders.h\"\n#include <libdevcore\/CommonIO.h>\n#include <libethcore\/ProofOfWork.h>\n#include <libethcore\/Ethasher.h>\n#include <boost\/test\/unit_test.hpp>\n#include \"TestHelper.h\"\n\nusing namespace std;\nusing namespace dev;\nusing namespace dev::eth;\n\nnamespace js = json_spirit;\n\nusing dev::operator <<;\n\nBOOST_AUTO_TEST_SUITE(DashimotoTests)\n\nBOOST_AUTO_TEST_CASE(basic_test)\n{\n\tstring testPath = test::getTestPath();\n\n\ttestPath += \"\/PoWTests\";\n\n\tcnote << \"Testing Proof of Work...\";\n\tjs::mValue v;\n\tstring s = asString(contents(testPath + \"\/ethash_tests.json\"));\n\tBOOST_REQUIRE_MESSAGE(s.length() > 0, \"Contents of 'ethash_tests.json' is empty. Have you cloned the 'tests' repo branch develop?\");\n\tjs::read_string(s, v);\n\tfor (auto& i: v.get_obj())\n\t{\n\t\tcnote << i.first;\n\t\tjs::mObject& o = i.second.get_obj();\n\t\tvector<pair<string, string>> ss;\n\t\tBlockInfo header = BlockInfo::fromHeader(fromHex(o[\"header\"].get_str()), CheckNothing);\n\t\th256 headerHash(o[\"header_hash\"].get_str());\n\t\tNonce nonce(o[\"nonce\"].get_str());\n\t\tBOOST_REQUIRE_EQUAL(headerHash, header.headerHash(WithoutNonce));\n\t\tBOOST_REQUIRE_EQUAL(nonce, header.nonce);\n\n\t\tunsigned cacheSize(o[\"cache_size\"].get_int());\n\t\th256 cacheHash(o[\"cache_hash\"].get_str());\n\t\tBOOST_REQUIRE_EQUAL(Ethasher::get()->cache(header).size(), cacheSize);\n\t\tBOOST_REQUIRE_EQUAL(sha3(Ethasher::get()->cache(header)), cacheHash);\n\n#if TEST_FULL\n\t\tunsigned fullSize(o[\"full_size\"].get_int());\n\t\th256 fullHash(o[\"full_hash\"].get_str());\n\t\tBOOST_REQUIRE_EQUAL(Ethasher::get()->full(header).size(), fullSize);\n\t\tBOOST_REQUIRE_EQUAL(sha3(Ethasher::get()->full(header)), fullHash);\n#endif\n\n\t\th256 result(o[\"result\"].get_str());\n\t\tEthasher::Result r = Ethasher::eval(header);\n\t\tBOOST_REQUIRE_EQUAL(r.value, result);\n\t\tBOOST_REQUIRE_EQUAL(r.mixHash, header.mixHash);\n\t}\n}\n\nBOOST_AUTO_TEST_SUITE_END()\n\n\n<commit_msg>Upgrade to latest ethhash API.<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 dagger.cpp\n * @author Gav Wood <i@gavwood.com>\n * @date 2014\n * Dashimoto test functions.\n *\/\n\n#include <fstream>\n#include <random>\n#include \"JsonSpiritHeaders.h\"\n#include <libdevcore\/CommonIO.h>\n#include <libethcore\/ProofOfWork.h>\n#include <libethcore\/Ethasher.h>\n#include <boost\/test\/unit_test.hpp>\n#include \"TestHelper.h\"\n\nusing namespace std;\nusing namespace dev;\nusing namespace dev::eth;\n\nnamespace js = json_spirit;\n\nusing dev::operator <<;\n\nBOOST_AUTO_TEST_SUITE(DashimotoTests)\n\nBOOST_AUTO_TEST_CASE(basic_test)\n{\n\tstring testPath = test::getTestPath();\n\n\ttestPath += \"\/PoWTests\";\n\n\tcnote << \"Testing Proof of Work...\";\n\tjs::mValue v;\n\tstring s = asString(contents(testPath + \"\/ethash_tests.json\"));\n\tBOOST_REQUIRE_MESSAGE(s.length() > 0, \"Contents of 'ethash_tests.json' is empty. Have you cloned the 'tests' repo branch develop?\");\n\tjs::read_string(s, v);\n\tfor (auto& i: v.get_obj())\n\t{\n\t\tcnote << i.first;\n\t\tjs::mObject& o = i.second.get_obj();\n\t\tvector<pair<string, string>> ss;\n\t\tBlockInfo header = BlockInfo::fromHeader(fromHex(o[\"header\"].get_str()), CheckNothing);\n\t\th256 headerHash(o[\"header_hash\"].get_str());\n\t\tNonce nonce(o[\"nonce\"].get_str());\n\t\tBOOST_REQUIRE_EQUAL(headerHash, header.headerHash(WithoutNonce));\n\t\tBOOST_REQUIRE_EQUAL(nonce, header.nonce);\n\n\t\tunsigned cacheSize(o[\"cache_size\"].get_int());\n\t\th256 cacheHash(o[\"cache_hash\"].get_str());\n\t\tBOOST_REQUIRE_EQUAL(Ethasher::get()->params(header).cache_size, cacheSize);\n\t\tBOOST_REQUIRE_EQUAL(sha3(bytesConstRef((byte const*)Ethasher::get()->cache(header), cacheSize)), cacheHash);\n\n#if TEST_FULL\n\t\tunsigned fullSize(o[\"full_size\"].get_int());\n\t\th256 fullHash(o[\"full_hash\"].get_str());\n\t\tBOOST_REQUIRE_EQUAL(Ethasher::get()->full(header).size(), fullSize);\n\t\tBOOST_REQUIRE_EQUAL(sha3(Ethasher::get()->full(header)), fullHash);\n#endif\n\n\t\th256 result(o[\"result\"].get_str());\n\t\tEthasher::Result r = Ethasher::eval(header);\n\t\tBOOST_REQUIRE_EQUAL(r.value, result);\n\t\tBOOST_REQUIRE_EQUAL(r.mixHash, header.mixHash);\n\t}\n}\n\nBOOST_AUTO_TEST_SUITE_END()\n\n\n<|endoftext|>"} {"text":"<commit_before>\/\/ Copyright (c) 2018 The OTS Authors. All rights reserved.\n\/\/ Use of this source code is governed by a BSD-style license that can be\n\/\/ found in the LICENSE file.\n\n#include \"layout.h\"\n\n#include \"fvar.h\"\n\n\/\/ OpenType Variations Common Table Formats\n\n#define TABLE_NAME \"Variations\" \/\/ XXX: use individual table names\n\nnamespace {\n\nbool ParseVariationRegionList(const ots::Font* font, const uint8_t* data, const size_t length,\n uint16_t* regionCount) {\n ots::Buffer subtable(data, length);\n\n uint16_t axisCount;\n\n if (!subtable.ReadU16(&axisCount) ||\n !subtable.ReadU16(regionCount)) {\n return OTS_FAILURE_MSG(\"Failed to read variation region list header\");\n }\n\n if (*regionCount == 0) {\n return true;\n }\n\n const ots::OpenTypeFVAR* fvar =\n static_cast<ots::OpenTypeFVAR*>(font->GetTypedTable(OTS_TAG_FVAR));\n if (!fvar) {\n return OTS_FAILURE_MSG(\"Required fvar table is missing\");\n }\n if (axisCount != fvar->AxisCount()) {\n return OTS_FAILURE_MSG(\"Axis count mismatch\");\n }\n\n for (unsigned i = 0; i < *regionCount; i++) {\n for (unsigned j = 0; j < axisCount; j++) {\n int16_t startCoord, peakCoord, endCoord;\n if (!subtable.ReadS16(&startCoord) ||\n !subtable.ReadS16(&peakCoord) ||\n !subtable.ReadS16(&endCoord)) {\n return OTS_FAILURE_MSG(\"Failed to read region axis coordinates\");\n }\n if (startCoord > peakCoord || peakCoord > endCoord) {\n return OTS_FAILURE_MSG(\"Region axis coordinates out of order\");\n }\n if (startCoord < -0x4000 || endCoord > 0x4000) {\n return OTS_FAILURE_MSG(\"Region axis coordinate out of range\");\n }\n if ((peakCoord < 0 && endCoord > 0) ||\n (peakCoord > 0 && startCoord < 0)) {\n return OTS_FAILURE_MSG(\"Invalid region axis coordinates\");\n }\n }\n }\n\n return true;\n}\n\nbool\nParseVariationDataSubtable(const ots::Font* font, const uint8_t* data, const size_t length,\n const uint16_t regionCount,\n uint16_t* regionIndexCount) {\n ots::Buffer subtable(data, length);\n\n uint16_t itemCount;\n uint16_t shortDeltaCount;\n\n if (!subtable.ReadU16(&itemCount) ||\n !subtable.ReadU16(&shortDeltaCount) ||\n !subtable.ReadU16(regionIndexCount)) {\n return OTS_FAILURE_MSG(\"Failed to read variation data subtable header\");\n }\n\n for (unsigned i = 0; i < *regionIndexCount; i++) {\n uint16_t regionIndex;\n if (!subtable.ReadU16(®ionIndex) || regionIndex >= regionCount) {\n return OTS_FAILURE_MSG(\"Bad region index\");\n }\n }\n\n if (!subtable.Skip(size_t(itemCount) * (size_t(shortDeltaCount) + size_t(*regionIndexCount)))) {\n return OTS_FAILURE_MSG(\"Failed to read delta data\");\n }\n\n return true;\n}\n\n} \/\/ namespace\n\nnamespace ots {\n\nbool\nParseItemVariationStore(const Font* font,\n const uint8_t* data, const size_t length,\n std::vector<uint16_t>* regionIndexCounts) {\n Buffer subtable(data, length);\n\n uint16_t format;\n uint32_t variationRegionListOffset;\n uint16_t itemVariationDataCount;\n\n if (!subtable.ReadU16(&format) ||\n !subtable.ReadU32(&variationRegionListOffset) ||\n !subtable.ReadU16(&itemVariationDataCount)) {\n return OTS_FAILURE_MSG(\"Failed to read item variation store header\");\n }\n\n if (format != 1) {\n return OTS_FAILURE_MSG(\"Unknown item variation store format\");\n }\n\n if (variationRegionListOffset < subtable.offset() + 4 * itemVariationDataCount ||\n variationRegionListOffset > length) {\n return OTS_FAILURE_MSG(\"Invalid variation region list offset\");\n }\n\n uint16_t regionCount;\n if (!ParseVariationRegionList(font,\n data + variationRegionListOffset,\n length - variationRegionListOffset,\n ®ionCount)) {\n return OTS_FAILURE_MSG(\"Failed to parse variation region list\");\n }\n\n for (unsigned i = 0; i < itemVariationDataCount; i++) {\n uint32_t offset;\n if (!subtable.ReadU32(&offset)) {\n return OTS_FAILURE_MSG(\"Failed to read variation data subtable offset\");\n }\n if (offset >= length) {\n return OTS_FAILURE_MSG(\"Bad offset to variation data subtable\");\n }\n uint16_t regionIndexCount = 0;\n if (!ParseVariationDataSubtable(font, data + offset, length - offset,\n regionCount,\n ®ionIndexCount)) {\n return OTS_FAILURE_MSG(\"Failed to parse variation data subtable\");\n }\n if (regionIndexCounts) {\n regionIndexCounts->push_back(regionIndexCount);\n }\n }\n\n return true;\n}\n\nbool ParseDeltaSetIndexMap(const Font* font, const uint8_t* data, const size_t length) {\n Buffer subtable(data, length);\n\n uint16_t entryFormat;\n uint16_t mapCount;\n\n if (!subtable.ReadU16(&entryFormat) ||\n !subtable.ReadU16(&mapCount)) {\n return OTS_FAILURE_MSG(\"Failed to read delta set index map header\");\n }\n\n const uint16_t MAP_ENTRY_SIZE_MASK = 0x0030;\n\n const uint16_t entrySize = (((entryFormat & MAP_ENTRY_SIZE_MASK) >> 4) + 1);\n if (!subtable.Skip(entrySize * mapCount)) {\n return OTS_FAILURE_MSG(\"Failed to read delta set index map data\");\n }\n\n return true;\n}\n\nbool ParseVariationData(const Font* font, const uint8_t* data, size_t length,\n size_t axisCount, size_t sharedTupleCount) {\n Buffer subtable(data, length);\n\n uint16_t tupleVariationCount;\n uint16_t dataOffset;\n if (!subtable.ReadU16(&tupleVariationCount) ||\n !subtable.ReadU16(&dataOffset)) {\n return OTS_FAILURE_MSG(\"Failed to read variation data header\");\n }\n\n if (dataOffset > length) {\n return OTS_FAILURE_MSG(\"Invalid serialized data offset\");\n }\n\n tupleVariationCount &= 0x0FFF; \/\/ mask off flags\n\n const uint16_t EMBEDDED_PEAK_TUPLE = 0x8000;\n const uint16_t INTERMEDIATE_REGION = 0x4000;\n const uint16_t TUPLE_INDEX_MASK = 0x0FFF;\n\n for (unsigned i = 0; i < tupleVariationCount; i++) {\n uint16_t variationDataSize;\n uint16_t tupleIndex;\n\n if (!subtable.ReadU16(&variationDataSize) ||\n !subtable.ReadU16(&tupleIndex)) {\n return OTS_FAILURE_MSG(\"Failed to read tuple variation header\");\n }\n\n if (tupleIndex & EMBEDDED_PEAK_TUPLE) {\n for (unsigned axis = 0; axis < axisCount; axis++) {\n int16_t coordinate;\n if (!subtable.ReadS16(&coordinate)) {\n return OTS_FAILURE_MSG(\"Failed to read tuple coordinate\");\n }\n if (coordinate < -0x4000 || coordinate > 0x4000) {\n return OTS_FAILURE_MSG(\"Tuple coordinate not in the range [-1.0, 1.0]: %g\", coordinate \/ 16384.);\n }\n }\n }\n\n if (tupleIndex & INTERMEDIATE_REGION) {\n std::vector<int16_t> startTuple(axisCount);\n for (unsigned axis = 0; axis < axisCount; axis++) {\n int16_t coordinate;\n if (!subtable.ReadS16(&coordinate)) {\n return OTS_FAILURE_MSG(\"Failed to read tuple coordinate\");\n }\n if (coordinate < -0x4000 || coordinate > 0x4000) {\n return OTS_FAILURE_MSG(\"Tuple coordinate not in the range [-1.0, 1.0]: %g\", coordinate \/ 16384.);\n }\n startTuple.push_back(coordinate);\n }\n\n std::vector<int16_t> endTuple(axisCount);\n for (unsigned axis = 0; axis < axisCount; axis++) {\n int16_t coordinate;\n if (!subtable.ReadS16(&coordinate)) {\n return OTS_FAILURE_MSG(\"Failed to read tuple coordinate\");\n }\n if (coordinate < -0x4000 || coordinate > 0x4000) {\n return OTS_FAILURE_MSG(\"Tuple coordinate not in the range [-1.0, 1.0]: %g\", coordinate \/ 16384.);\n }\n endTuple.push_back(coordinate);\n }\n\n for (unsigned axis = 0; axis < axisCount; axis++) {\n if (startTuple[axis] > endTuple[axis]) {\n return OTS_FAILURE_MSG(\"Invalid intermediate range\");\n }\n }\n }\n\n if (!(tupleIndex & EMBEDDED_PEAK_TUPLE)) {\n tupleIndex &= TUPLE_INDEX_MASK;\n if (tupleIndex >= sharedTupleCount) {\n return OTS_FAILURE_MSG(\"Tuple index out of range\");\n }\n }\n }\n\n \/\/ TODO: we don't attempt to interpret the serialized data block\n\n return true;\n}\n\n} \/\/ namespace ots\n\n#undef TABLE_NAME\n<commit_msg>[variations] Support the LONG_WORDS flag in item variation data (32-bit variable values).<commit_after>\/\/ Copyright (c) 2018 The OTS Authors. All rights reserved.\n\/\/ Use of this source code is governed by a BSD-style license that can be\n\/\/ found in the LICENSE file.\n\n#include \"layout.h\"\n\n#include \"fvar.h\"\n\n\/\/ OpenType Variations Common Table Formats\n\n#define TABLE_NAME \"Variations\" \/\/ XXX: use individual table names\n\nnamespace {\n\nbool ParseVariationRegionList(const ots::Font* font, const uint8_t* data, const size_t length,\n uint16_t* regionCount) {\n ots::Buffer subtable(data, length);\n\n uint16_t axisCount;\n\n if (!subtable.ReadU16(&axisCount) ||\n !subtable.ReadU16(regionCount)) {\n return OTS_FAILURE_MSG(\"Failed to read variation region list header\");\n }\n\n if (*regionCount == 0) {\n return true;\n }\n\n const ots::OpenTypeFVAR* fvar =\n static_cast<ots::OpenTypeFVAR*>(font->GetTypedTable(OTS_TAG_FVAR));\n if (!fvar) {\n return OTS_FAILURE_MSG(\"Required fvar table is missing\");\n }\n if (axisCount != fvar->AxisCount()) {\n return OTS_FAILURE_MSG(\"Axis count mismatch\");\n }\n\n for (unsigned i = 0; i < *regionCount; i++) {\n for (unsigned j = 0; j < axisCount; j++) {\n int16_t startCoord, peakCoord, endCoord;\n if (!subtable.ReadS16(&startCoord) ||\n !subtable.ReadS16(&peakCoord) ||\n !subtable.ReadS16(&endCoord)) {\n return OTS_FAILURE_MSG(\"Failed to read region axis coordinates\");\n }\n if (startCoord > peakCoord || peakCoord > endCoord) {\n return OTS_FAILURE_MSG(\"Region axis coordinates out of order\");\n }\n if (startCoord < -0x4000 || endCoord > 0x4000) {\n return OTS_FAILURE_MSG(\"Region axis coordinate out of range\");\n }\n if ((peakCoord < 0 && endCoord > 0) ||\n (peakCoord > 0 && startCoord < 0)) {\n return OTS_FAILURE_MSG(\"Invalid region axis coordinates\");\n }\n }\n }\n\n return true;\n}\n\nbool\nParseVariationDataSubtable(const ots::Font* font, const uint8_t* data, const size_t length,\n const uint16_t regionCount,\n uint16_t* regionIndexCount) {\n ots::Buffer subtable(data, length);\n\n uint16_t itemCount;\n uint16_t wordDeltaCount;\n\n const uint16_t LONG_WORDS\t= 0x8000u;\n const uint16_t WORD_DELTA_COUNT_MASK = 0x7FFF;\n\n if (!subtable.ReadU16(&itemCount) ||\n !subtable.ReadU16(&wordDeltaCount) ||\n !subtable.ReadU16(regionIndexCount)) {\n return OTS_FAILURE_MSG(\"Failed to read variation data subtable header\");\n }\n\n size_t valueSize = (wordDeltaCount & LONG_WORDS) ? 2 : 1;\n wordDeltaCount &= WORD_DELTA_COUNT_MASK;\n\n if (wordDeltaCount > *regionIndexCount) {\n return OTS_FAILURE_MSG(\"Bad word delta count\");\n }\n\n for (unsigned i = 0; i < *regionIndexCount; i++) {\n uint16_t regionIndex;\n if (!subtable.ReadU16(®ionIndex) || regionIndex >= regionCount) {\n return OTS_FAILURE_MSG(\"Bad region index\");\n }\n }\n\n if (!subtable.Skip(valueSize * size_t(itemCount) * (size_t(wordDeltaCount) + size_t(*regionIndexCount)))) {\n return OTS_FAILURE_MSG(\"Failed to read delta data\");\n }\n\n return true;\n}\n\n} \/\/ namespace\n\nnamespace ots {\n\nbool\nParseItemVariationStore(const Font* font,\n const uint8_t* data, const size_t length,\n std::vector<uint16_t>* regionIndexCounts) {\n Buffer subtable(data, length);\n\n uint16_t format;\n uint32_t variationRegionListOffset;\n uint16_t itemVariationDataCount;\n\n if (!subtable.ReadU16(&format) ||\n !subtable.ReadU32(&variationRegionListOffset) ||\n !subtable.ReadU16(&itemVariationDataCount)) {\n return OTS_FAILURE_MSG(\"Failed to read item variation store header\");\n }\n\n if (format != 1) {\n return OTS_FAILURE_MSG(\"Unknown item variation store format\");\n }\n\n if (variationRegionListOffset < subtable.offset() + 4 * itemVariationDataCount ||\n variationRegionListOffset > length) {\n return OTS_FAILURE_MSG(\"Invalid variation region list offset\");\n }\n\n uint16_t regionCount;\n if (!ParseVariationRegionList(font,\n data + variationRegionListOffset,\n length - variationRegionListOffset,\n ®ionCount)) {\n return OTS_FAILURE_MSG(\"Failed to parse variation region list\");\n }\n\n for (unsigned i = 0; i < itemVariationDataCount; i++) {\n uint32_t offset;\n if (!subtable.ReadU32(&offset)) {\n return OTS_FAILURE_MSG(\"Failed to read variation data subtable offset\");\n }\n if (offset >= length) {\n return OTS_FAILURE_MSG(\"Bad offset to variation data subtable\");\n }\n uint16_t regionIndexCount = 0;\n if (!ParseVariationDataSubtable(font, data + offset, length - offset,\n regionCount,\n ®ionIndexCount)) {\n return OTS_FAILURE_MSG(\"Failed to parse variation data subtable\");\n }\n if (regionIndexCounts) {\n regionIndexCounts->push_back(regionIndexCount);\n }\n }\n\n return true;\n}\n\nbool ParseDeltaSetIndexMap(const Font* font, const uint8_t* data, const size_t length) {\n Buffer subtable(data, length);\n\n uint16_t entryFormat;\n uint16_t mapCount;\n\n if (!subtable.ReadU16(&entryFormat) ||\n !subtable.ReadU16(&mapCount)) {\n return OTS_FAILURE_MSG(\"Failed to read delta set index map header\");\n }\n\n const uint16_t MAP_ENTRY_SIZE_MASK = 0x0030;\n\n const uint16_t entrySize = (((entryFormat & MAP_ENTRY_SIZE_MASK) >> 4) + 1);\n if (!subtable.Skip(entrySize * mapCount)) {\n return OTS_FAILURE_MSG(\"Failed to read delta set index map data\");\n }\n\n return true;\n}\n\nbool ParseVariationData(const Font* font, const uint8_t* data, size_t length,\n size_t axisCount, size_t sharedTupleCount) {\n Buffer subtable(data, length);\n\n uint16_t tupleVariationCount;\n uint16_t dataOffset;\n if (!subtable.ReadU16(&tupleVariationCount) ||\n !subtable.ReadU16(&dataOffset)) {\n return OTS_FAILURE_MSG(\"Failed to read variation data header\");\n }\n\n if (dataOffset > length) {\n return OTS_FAILURE_MSG(\"Invalid serialized data offset\");\n }\n\n tupleVariationCount &= 0x0FFF; \/\/ mask off flags\n\n const uint16_t EMBEDDED_PEAK_TUPLE = 0x8000;\n const uint16_t INTERMEDIATE_REGION = 0x4000;\n const uint16_t TUPLE_INDEX_MASK = 0x0FFF;\n\n for (unsigned i = 0; i < tupleVariationCount; i++) {\n uint16_t variationDataSize;\n uint16_t tupleIndex;\n\n if (!subtable.ReadU16(&variationDataSize) ||\n !subtable.ReadU16(&tupleIndex)) {\n return OTS_FAILURE_MSG(\"Failed to read tuple variation header\");\n }\n\n if (tupleIndex & EMBEDDED_PEAK_TUPLE) {\n for (unsigned axis = 0; axis < axisCount; axis++) {\n int16_t coordinate;\n if (!subtable.ReadS16(&coordinate)) {\n return OTS_FAILURE_MSG(\"Failed to read tuple coordinate\");\n }\n if (coordinate < -0x4000 || coordinate > 0x4000) {\n return OTS_FAILURE_MSG(\"Tuple coordinate not in the range [-1.0, 1.0]: %g\", coordinate \/ 16384.);\n }\n }\n }\n\n if (tupleIndex & INTERMEDIATE_REGION) {\n std::vector<int16_t> startTuple(axisCount);\n for (unsigned axis = 0; axis < axisCount; axis++) {\n int16_t coordinate;\n if (!subtable.ReadS16(&coordinate)) {\n return OTS_FAILURE_MSG(\"Failed to read tuple coordinate\");\n }\n if (coordinate < -0x4000 || coordinate > 0x4000) {\n return OTS_FAILURE_MSG(\"Tuple coordinate not in the range [-1.0, 1.0]: %g\", coordinate \/ 16384.);\n }\n startTuple.push_back(coordinate);\n }\n\n std::vector<int16_t> endTuple(axisCount);\n for (unsigned axis = 0; axis < axisCount; axis++) {\n int16_t coordinate;\n if (!subtable.ReadS16(&coordinate)) {\n return OTS_FAILURE_MSG(\"Failed to read tuple coordinate\");\n }\n if (coordinate < -0x4000 || coordinate > 0x4000) {\n return OTS_FAILURE_MSG(\"Tuple coordinate not in the range [-1.0, 1.0]: %g\", coordinate \/ 16384.);\n }\n endTuple.push_back(coordinate);\n }\n\n for (unsigned axis = 0; axis < axisCount; axis++) {\n if (startTuple[axis] > endTuple[axis]) {\n return OTS_FAILURE_MSG(\"Invalid intermediate range\");\n }\n }\n }\n\n if (!(tupleIndex & EMBEDDED_PEAK_TUPLE)) {\n tupleIndex &= TUPLE_INDEX_MASK;\n if (tupleIndex >= sharedTupleCount) {\n return OTS_FAILURE_MSG(\"Tuple index out of range\");\n }\n }\n }\n\n \/\/ TODO: we don't attempt to interpret the serialized data block\n\n return true;\n}\n\n} \/\/ namespace ots\n\n#undef TABLE_NAME\n<|endoftext|>"} {"text":"<commit_before>\/*\n ***********************************************************************************************************************\n *\n * Copyright (c) 2017-2020 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 all\n * copies or substantial portions of the Software.\n *\n * THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\n * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\n * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE\n * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\n * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,\n * OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE\n * SOFTWARE.\n *\n **********************************************************************************************************************\/\n\/**\n ***********************************************************************************************************************\n * @file PatchLoadScalarizer.cpp\n * @brief LLPC source file: contains implementation of class lgc::PatchLoadScalarizer.\n ***********************************************************************************************************************\n *\/\n#include \"PatchLoadScalarizer.h\"\n#include \"lgc\/state\/PipelineShaders.h\"\n#include \"lgc\/state\/PipelineState.h\"\n#include \"llvm\/IR\/Constants.h\"\n#include \"llvm\/IR\/Instructions.h\"\n#include \"llvm\/Support\/Debug.h\"\n#include \"llvm\/Support\/raw_ostream.h\"\n\n#define DEBUG_TYPE \"lgc-patch-load-scalarizer\"\n\nusing namespace lgc;\nusing namespace llvm;\n\nnamespace lgc {\n\n\/\/ =====================================================================================================================\n\/\/ Define static members (no initializer needed as LLVM only cares about the address of ID, never its value).\nchar PatchLoadScalarizer::ID;\n\n\/\/ =====================================================================================================================\n\/\/ Pass creator, creates the pass of LLVM patching operations for load scalarizer optimizations.\nFunctionPass *createPatchLoadScalarizer() {\n return new PatchLoadScalarizer();\n}\n\n\/\/ =====================================================================================================================\nPatchLoadScalarizer::PatchLoadScalarizer() : FunctionPass(ID) {\n m_scalarThreshold = 0;\n}\n\n\/\/ =====================================================================================================================\n\/\/ Get the analysis usage of this pass.\n\/\/\n\/\/ @param [out] analysisUsage : The analysis usage.\nvoid PatchLoadScalarizer::getAnalysisUsage(AnalysisUsage &analysisUsage) const {\n analysisUsage.addRequired<PipelineStateWrapper>();\n analysisUsage.addRequired<PipelineShaders>();\n analysisUsage.addPreserved<PipelineShaders>();\n}\n\n\/\/ =====================================================================================================================\n\/\/ Executes this LLVM pass on the specified LLVM function.\n\/\/\n\/\/ @param [in,out] function : Function that will run this optimization.\nbool PatchLoadScalarizer::runOnFunction(Function &function) {\n LLVM_DEBUG(dbgs() << \"Run the pass Patch-Load-Scalarizer-Opt\\n\");\n\n auto pipelineState = getAnalysis<PipelineStateWrapper>().getPipelineState(function.getParent());\n auto pipelineShaders = &getAnalysis<PipelineShaders>();\n auto shaderStage = pipelineShaders->getShaderStage(&function);\n\n \/\/ If the function is not a valid shader stage, or the optimization is disabled, bail.\n m_scalarThreshold = 0;\n if (shaderStage != ShaderStageInvalid)\n m_scalarThreshold = pipelineState->getShaderOptions(shaderStage).loadScalarizerThreshold;\n if (m_scalarThreshold == 0)\n return false;\n\n m_builder.reset(new IRBuilder<>(function.getContext()));\n\n visit(function);\n\n const bool changed = (!m_instsToErase.empty());\n\n for (Instruction *const inst : m_instsToErase) {\n \/\/ Lastly delete any instructions we replaced.\n inst->eraseFromParent();\n }\n m_instsToErase.clear();\n\n return changed;\n}\n\n\/\/ =====================================================================================================================\n\/\/ Visits \"load\" instruction.\n\/\/\n\/\/ @param loadInst : The instruction\nvoid PatchLoadScalarizer::visitLoadInst(LoadInst &loadInst) {\n const unsigned addrSpace = loadInst.getPointerAddressSpace();\n auto loadTy = dyn_cast<VectorType>(loadInst.getType());\n\n if (loadTy) {\n \/\/ This optimization will try to scalarize the load inst. The pattern is like:\n \/\/ %loadValue = load <4 x float>, <4 x float> addrspace(7)* %loadPtr, align 16\n \/\/ will be converted to:\n \/\/ %newloadPtr = bitcast <4 x float> addrspace(7)* %loadPtr to float addrspace(7)*\n \/\/ %loadCompPtr.i0 = getelementptr float, float addrspace(7)* %newloadPtr, i32 0\n \/\/ %loadComp.i0 = load float, float addrspace(7)* %loadCompPtr.i0, align 16\n \/\/ %loadCompPtr.i1 = getelementptr float, float addrspace(7)* %newloadPtr, i32 1\n \/\/ %loadComp.i1 = load float, float addrspace(7)* %loadCompPtr.i1, align 4\n \/\/ %loadCompPtr.i2 = getelementptr float, float addrspace(7)* %newloadPtr, i32 2\n \/\/ %loadComp.i2 = load float, float addrspace(7)* %loadCompPtr.i2, align 8\n \/\/ %loadCompPtr.i3 = getelementptr float, float addrspace(7)* %newloadPtr, i32 3\n \/\/ %loadComp.i3 = load float, float addrspace(7)* %loadCompPtr.i3, align 4\n \/\/ %loadValue.i0 = insertelement <4 x float> undef, float %loadComp.i0, i32 0\n \/\/ %loadValue.i01 = insertelement <4 x float> %loadValue.i0, float %loadComp.i1, i32 1\n \/\/ %loadValue.i012 = insertelement <4 x float> %loadValue.i01, float %loadComp.i2, i32 2\n \/\/ %loadValue = insertelement <4 x float> %loadValue.i012, float %loadComp.i3, i32 3\n\n unsigned compCount = loadTy->getNumElements();\n\n if (compCount > m_scalarThreshold)\n return;\n\n Type *compTy = cast<VectorType>(loadTy)->getElementType();\n uint64_t compSize = loadInst.getModule()->getDataLayout().getTypeStoreSize(compTy);\n\n Value *loadValue = UndefValue::get(loadTy);\n Type *newLoadPtrTy = PointerType::get(compTy, addrSpace);\n SmallVector<Value *, 4> loadComps;\n\n loadComps.resize(compCount);\n\n \/\/ Get all the metadata\n SmallVector<std::pair<unsigned, MDNode *>, 8> allMetaNodes;\n loadInst.getAllMetadata(allMetaNodes);\n\n m_builder->SetInsertPoint(&loadInst);\n Value *newLoadPtr = m_builder->CreateBitCast(loadInst.getPointerOperand(), newLoadPtrTy,\n loadInst.getPointerOperand()->getName() + \".i0\");\n\n for (unsigned i = 0; i < compCount; i++) {\n Value *loadCompPtr = m_builder->CreateConstGEP1_32(compTy, newLoadPtr, i,\n loadInst.getPointerOperand()->getName() + \".i\" + Twine(i));\n \/\/ Calculate the alignment of component i\n uint64_t compAlignment = MinAlign(loadInst.getAlignment(), i * compSize);\n\n loadComps[i] = m_builder->CreateAlignedLoad(compTy, loadCompPtr, Align(compAlignment),\n loadInst.getName() + \".ii\" + Twine(i));\n\n for (auto metaNode : allMetaNodes)\n dyn_cast<Instruction>(loadComps[i])->setMetadata(metaNode.first, metaNode.second);\n }\n\n for (unsigned i = 0; i < compCount; i++) {\n loadValue = m_builder->CreateInsertElement(loadValue, loadComps[i], m_builder->getInt32(i),\n loadInst.getName() + \".u\" + Twine(i));\n }\n\n loadValue->takeName(&loadInst);\n loadInst.replaceAllUsesWith(loadValue);\n m_instsToErase.push_back(&loadInst);\n }\n}\n\n} \/\/ namespace lgc\n\n\/\/ =====================================================================================================================\n\/\/ Initializes the pass of LLVM patching operations for load scarlarizer optimization.\nINITIALIZE_PASS(PatchLoadScalarizer, DEBUG_TYPE, \"Patch LLVM for load scarlarizer optimization\", false, false)\n<commit_msg>Fix typo in pass description<commit_after>\/*\n ***********************************************************************************************************************\n *\n * Copyright (c) 2017-2020 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 all\n * copies or substantial portions of the Software.\n *\n * THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\n * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\n * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE\n * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\n * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,\n * OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE\n * SOFTWARE.\n *\n **********************************************************************************************************************\/\n\/**\n ***********************************************************************************************************************\n * @file PatchLoadScalarizer.cpp\n * @brief LLPC source file: contains implementation of class lgc::PatchLoadScalarizer.\n ***********************************************************************************************************************\n *\/\n#include \"PatchLoadScalarizer.h\"\n#include \"lgc\/state\/PipelineShaders.h\"\n#include \"lgc\/state\/PipelineState.h\"\n#include \"llvm\/IR\/Constants.h\"\n#include \"llvm\/IR\/Instructions.h\"\n#include \"llvm\/Support\/Debug.h\"\n#include \"llvm\/Support\/raw_ostream.h\"\n\n#define DEBUG_TYPE \"lgc-patch-load-scalarizer\"\n\nusing namespace lgc;\nusing namespace llvm;\n\nnamespace lgc {\n\n\/\/ =====================================================================================================================\n\/\/ Define static members (no initializer needed as LLVM only cares about the address of ID, never its value).\nchar PatchLoadScalarizer::ID;\n\n\/\/ =====================================================================================================================\n\/\/ Pass creator, creates the pass of LLVM patching operations for load scalarizer optimizations.\nFunctionPass *createPatchLoadScalarizer() {\n return new PatchLoadScalarizer();\n}\n\n\/\/ =====================================================================================================================\nPatchLoadScalarizer::PatchLoadScalarizer() : FunctionPass(ID) {\n m_scalarThreshold = 0;\n}\n\n\/\/ =====================================================================================================================\n\/\/ Get the analysis usage of this pass.\n\/\/\n\/\/ @param [out] analysisUsage : The analysis usage.\nvoid PatchLoadScalarizer::getAnalysisUsage(AnalysisUsage &analysisUsage) const {\n analysisUsage.addRequired<PipelineStateWrapper>();\n analysisUsage.addRequired<PipelineShaders>();\n analysisUsage.addPreserved<PipelineShaders>();\n}\n\n\/\/ =====================================================================================================================\n\/\/ Executes this LLVM pass on the specified LLVM function.\n\/\/\n\/\/ @param [in,out] function : Function that will run this optimization.\nbool PatchLoadScalarizer::runOnFunction(Function &function) {\n LLVM_DEBUG(dbgs() << \"Run the pass Patch-Load-Scalarizer-Opt\\n\");\n\n auto pipelineState = getAnalysis<PipelineStateWrapper>().getPipelineState(function.getParent());\n auto pipelineShaders = &getAnalysis<PipelineShaders>();\n auto shaderStage = pipelineShaders->getShaderStage(&function);\n\n \/\/ If the function is not a valid shader stage, or the optimization is disabled, bail.\n m_scalarThreshold = 0;\n if (shaderStage != ShaderStageInvalid)\n m_scalarThreshold = pipelineState->getShaderOptions(shaderStage).loadScalarizerThreshold;\n if (m_scalarThreshold == 0)\n return false;\n\n m_builder.reset(new IRBuilder<>(function.getContext()));\n\n visit(function);\n\n const bool changed = (!m_instsToErase.empty());\n\n for (Instruction *const inst : m_instsToErase) {\n \/\/ Lastly delete any instructions we replaced.\n inst->eraseFromParent();\n }\n m_instsToErase.clear();\n\n return changed;\n}\n\n\/\/ =====================================================================================================================\n\/\/ Visits \"load\" instruction.\n\/\/\n\/\/ @param loadInst : The instruction\nvoid PatchLoadScalarizer::visitLoadInst(LoadInst &loadInst) {\n const unsigned addrSpace = loadInst.getPointerAddressSpace();\n auto loadTy = dyn_cast<VectorType>(loadInst.getType());\n\n if (loadTy) {\n \/\/ This optimization will try to scalarize the load inst. The pattern is like:\n \/\/ %loadValue = load <4 x float>, <4 x float> addrspace(7)* %loadPtr, align 16\n \/\/ will be converted to:\n \/\/ %newloadPtr = bitcast <4 x float> addrspace(7)* %loadPtr to float addrspace(7)*\n \/\/ %loadCompPtr.i0 = getelementptr float, float addrspace(7)* %newloadPtr, i32 0\n \/\/ %loadComp.i0 = load float, float addrspace(7)* %loadCompPtr.i0, align 16\n \/\/ %loadCompPtr.i1 = getelementptr float, float addrspace(7)* %newloadPtr, i32 1\n \/\/ %loadComp.i1 = load float, float addrspace(7)* %loadCompPtr.i1, align 4\n \/\/ %loadCompPtr.i2 = getelementptr float, float addrspace(7)* %newloadPtr, i32 2\n \/\/ %loadComp.i2 = load float, float addrspace(7)* %loadCompPtr.i2, align 8\n \/\/ %loadCompPtr.i3 = getelementptr float, float addrspace(7)* %newloadPtr, i32 3\n \/\/ %loadComp.i3 = load float, float addrspace(7)* %loadCompPtr.i3, align 4\n \/\/ %loadValue.i0 = insertelement <4 x float> undef, float %loadComp.i0, i32 0\n \/\/ %loadValue.i01 = insertelement <4 x float> %loadValue.i0, float %loadComp.i1, i32 1\n \/\/ %loadValue.i012 = insertelement <4 x float> %loadValue.i01, float %loadComp.i2, i32 2\n \/\/ %loadValue = insertelement <4 x float> %loadValue.i012, float %loadComp.i3, i32 3\n\n unsigned compCount = loadTy->getNumElements();\n\n if (compCount > m_scalarThreshold)\n return;\n\n Type *compTy = cast<VectorType>(loadTy)->getElementType();\n uint64_t compSize = loadInst.getModule()->getDataLayout().getTypeStoreSize(compTy);\n\n Value *loadValue = UndefValue::get(loadTy);\n Type *newLoadPtrTy = PointerType::get(compTy, addrSpace);\n SmallVector<Value *, 4> loadComps;\n\n loadComps.resize(compCount);\n\n \/\/ Get all the metadata\n SmallVector<std::pair<unsigned, MDNode *>, 8> allMetaNodes;\n loadInst.getAllMetadata(allMetaNodes);\n\n m_builder->SetInsertPoint(&loadInst);\n Value *newLoadPtr = m_builder->CreateBitCast(loadInst.getPointerOperand(), newLoadPtrTy,\n loadInst.getPointerOperand()->getName() + \".i0\");\n\n for (unsigned i = 0; i < compCount; i++) {\n Value *loadCompPtr = m_builder->CreateConstGEP1_32(compTy, newLoadPtr, i,\n loadInst.getPointerOperand()->getName() + \".i\" + Twine(i));\n \/\/ Calculate the alignment of component i\n uint64_t compAlignment = MinAlign(loadInst.getAlignment(), i * compSize);\n\n loadComps[i] = m_builder->CreateAlignedLoad(compTy, loadCompPtr, Align(compAlignment),\n loadInst.getName() + \".ii\" + Twine(i));\n\n for (auto metaNode : allMetaNodes)\n dyn_cast<Instruction>(loadComps[i])->setMetadata(metaNode.first, metaNode.second);\n }\n\n for (unsigned i = 0; i < compCount; i++) {\n loadValue = m_builder->CreateInsertElement(loadValue, loadComps[i], m_builder->getInt32(i),\n loadInst.getName() + \".u\" + Twine(i));\n }\n\n loadValue->takeName(&loadInst);\n loadInst.replaceAllUsesWith(loadValue);\n m_instsToErase.push_back(&loadInst);\n }\n}\n\n} \/\/ namespace lgc\n\n\/\/ =====================================================================================================================\n\/\/ Initializes the pass of LLVM patching operations for load scalarizer optimization.\nINITIALIZE_PASS(PatchLoadScalarizer, DEBUG_TYPE, \"Patch LLVM for load scalarizer optimization\", false, false)\n<|endoftext|>"} {"text":"<commit_before>\/\/===- CocoaConventions.h - Special handling of Cocoa conventions -*- C++ -*--\/\/\n\/\/\n\/\/ The LLVM Compiler Infrastructure\n\/\/\n\/\/ This file is distributed under the University of Illinois Open Source\n\/\/ License. See LICENSE.TXT for details.\n\/\/\n\/\/===----------------------------------------------------------------------===\/\/\n\/\/\n\/\/ This file implements cocoa naming convention analysis. \n\/\/\n\/\/===----------------------------------------------------------------------===\/\/\n\n#include \"clang\/Analysis\/DomainSpecific\/CocoaConventions.h\"\n#include \"clang\/AST\/Type.h\"\n#include \"clang\/AST\/Decl.h\"\n#include \"clang\/AST\/DeclObjC.h\"\n#include \"llvm\/ADT\/StringExtras.h\"\n#include \"llvm\/Support\/ErrorHandling.h\"\n\nusing namespace clang;\nusing namespace ento;\n\nusing llvm::StringRef;\n\n\/\/ The \"fundamental rule\" for naming conventions of methods:\n\/\/ (url broken into two lines)\n\/\/ http:\/\/developer.apple.com\/documentation\/Cocoa\/Conceptual\/\n\/\/ MemoryMgmt\/Tasks\/MemoryManagementRules.html\n\/\/\n\/\/ \"You take ownership of an object if you create it using a method whose name\n\/\/ begins with \"alloc\" or \"new\" or contains \"copy\" (for example, alloc,\n\/\/ newObject, or mutableCopy), or if you send it a retain message. You are\n\/\/ responsible for relinquishing ownership of objects you own using release\n\/\/ or autorelease. Any other time you receive an object, you must\n\/\/ not release it.\"\n\/\/\n\ncocoa::NamingConvention cocoa::deriveNamingConvention(Selector S) {\n switch (S.getMethodFamily()) {\n case OMF_None:\n case OMF_autorelease:\n case OMF_dealloc:\n case OMF_release:\n case OMF_retain:\n case OMF_retainCount:\n case OMF_self:\n return NoConvention;\n\n case OMF_init:\n return InitRule;\n\n case OMF_alloc:\n case OMF_copy:\n case OMF_mutableCopy:\n case OMF_new:\n return CreateRule;\n }\n llvm_unreachable(\"unexpected naming convention\");\n return NoConvention;\n}\n\nbool cocoa::isRefType(QualType RetTy, llvm::StringRef Prefix,\n llvm::StringRef Name) {\n \/\/ Recursively walk the typedef stack, allowing typedefs of reference types.\n while (const TypedefType *TD = dyn_cast<TypedefType>(RetTy.getTypePtr())) {\n llvm::StringRef TDName = TD->getDecl()->getIdentifier()->getName();\n if (TDName.startswith(Prefix) && TDName.endswith(\"Ref\"))\n return true;\n \n RetTy = TD->getDecl()->getUnderlyingType();\n }\n \n if (Name.empty())\n return false;\n \n \/\/ Is the type void*?\n const PointerType* PT = RetTy->getAs<PointerType>();\n if (!(PT->getPointeeType().getUnqualifiedType()->isVoidType()))\n return false;\n \n \/\/ Does the name start with the prefix?\n return Name.startswith(Prefix);\n}\n\nbool cocoa::isCFObjectRef(QualType T) {\n return isRefType(T, \"CF\") || \/\/ Core Foundation.\n isRefType(T, \"CG\") || \/\/ Core Graphics.\n isRefType(T, \"DADisk\") || \/\/ Disk Arbitration API.\n isRefType(T, \"DADissenter\") ||\n isRefType(T, \"DASessionRef\");\n}\n\n\nbool cocoa::isCocoaObjectRef(QualType Ty) {\n if (!Ty->isObjCObjectPointerType())\n return false;\n \n const ObjCObjectPointerType *PT = Ty->getAs<ObjCObjectPointerType>();\n \n \/\/ Can be true for objects with the 'NSObject' attribute.\n if (!PT)\n return true;\n \n \/\/ We assume that id<..>, id, Class, and Class<..> all represent tracked\n \/\/ objects.\n if (PT->isObjCIdType() || PT->isObjCQualifiedIdType() ||\n PT->isObjCClassType() || PT->isObjCQualifiedClassType())\n return true;\n \n \/\/ Does the interface subclass NSObject?\n \/\/ FIXME: We can memoize here if this gets too expensive.\n const ObjCInterfaceDecl *ID = PT->getInterfaceDecl();\n \n \/\/ Assume that anything declared with a forward declaration and no\n \/\/ @interface subclasses NSObject.\n if (ID->isForwardDecl())\n return true;\n \n for ( ; ID ; ID = ID->getSuperClass())\n if (ID->getIdentifier()->getName() == \"NSObject\")\n return true;\n \n return false;\n}\n<commit_msg>Added a missing case label.<commit_after>\/\/===- CocoaConventions.h - Special handling of Cocoa conventions -*- C++ -*--\/\/\n\/\/\n\/\/ The LLVM Compiler Infrastructure\n\/\/\n\/\/ This file is distributed under the University of Illinois Open Source\n\/\/ License. See LICENSE.TXT for details.\n\/\/\n\/\/===----------------------------------------------------------------------===\/\/\n\/\/\n\/\/ This file implements cocoa naming convention analysis. \n\/\/\n\/\/===----------------------------------------------------------------------===\/\/\n\n#include \"clang\/Analysis\/DomainSpecific\/CocoaConventions.h\"\n#include \"clang\/AST\/Type.h\"\n#include \"clang\/AST\/Decl.h\"\n#include \"clang\/AST\/DeclObjC.h\"\n#include \"llvm\/ADT\/StringExtras.h\"\n#include \"llvm\/Support\/ErrorHandling.h\"\n\nusing namespace clang;\nusing namespace ento;\n\nusing llvm::StringRef;\n\n\/\/ The \"fundamental rule\" for naming conventions of methods:\n\/\/ (url broken into two lines)\n\/\/ http:\/\/developer.apple.com\/documentation\/Cocoa\/Conceptual\/\n\/\/ MemoryMgmt\/Tasks\/MemoryManagementRules.html\n\/\/\n\/\/ \"You take ownership of an object if you create it using a method whose name\n\/\/ begins with \"alloc\" or \"new\" or contains \"copy\" (for example, alloc,\n\/\/ newObject, or mutableCopy), or if you send it a retain message. You are\n\/\/ responsible for relinquishing ownership of objects you own using release\n\/\/ or autorelease. Any other time you receive an object, you must\n\/\/ not release it.\"\n\/\/\n\ncocoa::NamingConvention cocoa::deriveNamingConvention(Selector S) {\n switch (S.getMethodFamily()) {\n case OMF_None:\n case OMF_autorelease:\n case OMF_dealloc:\n case OMF_release:\n case OMF_retain:\n case OMF_retainCount:\n case OMF_self:\n case OMF_performSelector:\n return NoConvention;\n\n case OMF_init:\n return InitRule;\n\n case OMF_alloc:\n case OMF_copy:\n case OMF_mutableCopy:\n case OMF_new:\n return CreateRule;\n }\n llvm_unreachable(\"unexpected naming convention\");\n return NoConvention;\n}\n\nbool cocoa::isRefType(QualType RetTy, llvm::StringRef Prefix,\n llvm::StringRef Name) {\n \/\/ Recursively walk the typedef stack, allowing typedefs of reference types.\n while (const TypedefType *TD = dyn_cast<TypedefType>(RetTy.getTypePtr())) {\n llvm::StringRef TDName = TD->getDecl()->getIdentifier()->getName();\n if (TDName.startswith(Prefix) && TDName.endswith(\"Ref\"))\n return true;\n \n RetTy = TD->getDecl()->getUnderlyingType();\n }\n \n if (Name.empty())\n return false;\n \n \/\/ Is the type void*?\n const PointerType* PT = RetTy->getAs<PointerType>();\n if (!(PT->getPointeeType().getUnqualifiedType()->isVoidType()))\n return false;\n \n \/\/ Does the name start with the prefix?\n return Name.startswith(Prefix);\n}\n\nbool cocoa::isCFObjectRef(QualType T) {\n return isRefType(T, \"CF\") || \/\/ Core Foundation.\n isRefType(T, \"CG\") || \/\/ Core Graphics.\n isRefType(T, \"DADisk\") || \/\/ Disk Arbitration API.\n isRefType(T, \"DADissenter\") ||\n isRefType(T, \"DASessionRef\");\n}\n\n\nbool cocoa::isCocoaObjectRef(QualType Ty) {\n if (!Ty->isObjCObjectPointerType())\n return false;\n \n const ObjCObjectPointerType *PT = Ty->getAs<ObjCObjectPointerType>();\n \n \/\/ Can be true for objects with the 'NSObject' attribute.\n if (!PT)\n return true;\n \n \/\/ We assume that id<..>, id, Class, and Class<..> all represent tracked\n \/\/ objects.\n if (PT->isObjCIdType() || PT->isObjCQualifiedIdType() ||\n PT->isObjCClassType() || PT->isObjCQualifiedClassType())\n return true;\n \n \/\/ Does the interface subclass NSObject?\n \/\/ FIXME: We can memoize here if this gets too expensive.\n const ObjCInterfaceDecl *ID = PT->getInterfaceDecl();\n \n \/\/ Assume that anything declared with a forward declaration and no\n \/\/ @interface subclasses NSObject.\n if (ID->isForwardDecl())\n return true;\n \n for ( ; ID ; ID = ID->getSuperClass())\n if (ID->getIdentifier()->getName() == \"NSObject\")\n return true;\n \n return false;\n}\n<|endoftext|>"} {"text":"<commit_before>#include \"qquickgridstar.h\"\n\nQQuickRowDefinition::QQuickRowDefinition(QQuickItem *parent) :\n QQuickItem(parent),\n m_weight(1.0f)\n{\n}\n\nQQuickColumnDefinition::QQuickColumnDefinition(QQuickItem *parent) :\n QQuickItem(parent),\n m_weight(1.0f)\n{\n}\n\nQQuickGridStarAttached::QQuickGridStarAttached(QObject *object) :\n QObject(object),\n m_ignore(false),\n m_dirty(true),\n m_row(0),\n m_column(0),\n m_rowSpan(1),\n m_columnSpan(1),\n m_rowSpanActual(1),\n m_columnSpanActual(1)\n{\n}\n\nbool QQuickGridStarAttached::getIgnore()\n{\n return m_ignore;\n}\n\nqint32 QQuickGridStarAttached::getRow()\n{\n return m_row;\n}\n\nqint32 QQuickGridStarAttached::getColumn()\n{\n return m_column;\n}\n\nqint32 QQuickGridStarAttached::getRowSpan()\n{\n return m_rowSpan;\n}\n\nqint32 QQuickGridStarAttached::getColumnSpan()\n{\n return m_columnSpan;\n}\n\nvoid QQuickGridStarAttached::setIgnore(bool ignore)\n{\n m_ignore = ignore;\n\n m_dirty = true;\n}\n\nvoid QQuickGridStarAttached::setRow(qint32 row)\n{\n m_row = row;\n\n m_dirty = true;\n}\n\nvoid QQuickGridStarAttached::setColumn(qint32 column)\n{\n m_column = column;\n\n m_dirty = true;\n}\n\nvoid QQuickGridStarAttached::setRowSpan(qint32 rowSpan)\n{\n m_rowSpan = rowSpan;\n\n m_dirty = true;\n}\n\nvoid QQuickGridStarAttached::setColumnSpan(qint32 columnSpan)\n{\n m_columnSpan = columnSpan;\n\n m_dirty = true;\n}\n\nQQuickGridStar::QQuickGridStar(QQuickItem *parent) :\n QQuickItem(parent)\n{\n}\n\nQQuickGridStar::~QQuickGridStar()\n{\n}\n\nqint32 QQuickGridStar::rowCount()\n{\n return m_gridDefinition.rowCount();\n}\n\nqint32 QQuickGridStar::columnCount()\n{\n return m_gridDefinition.columnCount();\n}\n\nQVariant QQuickGridStar::itemsAt(qint32 row, qint32 column)\n{\n QVariantList\n quickItems;\n\n for(QQuickItem *item : m_items)\n {\n QQuickGridStarAttached\n *attached = qobject_cast<QQuickGridStarAttached *>(qmlAttachedPropertiesObject<QQuickGridStar>(item));\n\n if(attached->m_row == row && attached->m_column == column)\n {\n quickItems << QVariant::fromValue(item);\n }\n }\n\n return quickItems;\n}\n\nvoid QQuickGridStar::addRowDefinition(qreal weight, qint32 row)\n{\n for(QQuickItem *item : m_items)\n {\n QQuickGridStarAttached\n *attached = qobject_cast<QQuickGridStarAttached *>(qmlAttachedPropertiesObject<QQuickGridStar>(item));\n\n if(attached->m_row >= row)\n {\n attached->m_row++;\n }\n\n attached->m_dirty = true;\n }\n\n m_gridDefinition.addRowDefinition(weight, row);\n\n polish();\n}\n\nvoid QQuickGridStar::addColumnDefinition(qreal weight, qint32 column)\n{\n for(QQuickItem *item : m_items)\n {\n QQuickGridStarAttached\n *attached = qobject_cast<QQuickGridStarAttached *>(qmlAttachedPropertiesObject<QQuickGridStar>(item));\n\n if(attached->m_column >= column)\n {\n attached->m_column++;\n }\n\n attached->m_dirty = true;\n }\n\n m_gridDefinition.addColumnDefinition(weight, column);\n\n polish();\n}\n\nvoid QQuickGridStar::removeRowDefinition(qint32 row)\n{\n for(QQuickItem *item : m_items)\n {\n QQuickGridStarAttached\n *attached = qobject_cast<QQuickGridStarAttached *>(qmlAttachedPropertiesObject<QQuickGridStar>(item));\n\n if(attached->m_row >= row)\n {\n attached->m_row--;\n }\n\n attached->m_dirty = true;\n }\n\n m_gridDefinition.removeRowDefinition(row);\n\n polish();\n}\n\nvoid QQuickGridStar::removeColumnDefinition(qint32 column)\n{\n for(QQuickItem *item : m_items)\n {\n QQuickGridStarAttached\n *attached = qobject_cast<QQuickGridStarAttached *>(qmlAttachedPropertiesObject<QQuickGridStar>(item));\n\n if(attached->m_column >= column)\n {\n attached->m_column--;\n }\n\n attached->m_dirty = true;\n }\n\n m_gridDefinition.removeColumnDefinition(column);\n\n polish();\n}\n\nvoid QQuickGridStar::componentComplete()\n{\n QSizeF\n size = QSizeF(width(), height());\n\n if(size.isEmpty())\n {\n QObject\n *parentObject = parent();\n\n if(parentObject->isWindowType())\n {\n QQuickWindow\n *quickWindow = qobject_cast<QQuickWindow *>(parentObject);\n\n size = QSizeF(quickWindow->width(), quickWindow->height());\n }\n else\n {\n QQuickItem\n *quickItem = qobject_cast<QQuickItem *>(parentObject);\n\n size = QSizeF(quickItem->width(), quickItem->height());\n }\n\n setSize(size);\n }\n\n QQuickItem::componentComplete();\n}\n\nvoid QQuickGridStar::itemChange(ItemChange change, const ItemChangeData &value)\n{\n if(change == ItemChildAddedChange)\n {\n QQuickItem\n *item = value.item;\n\n QString\n className(item->metaObject()->className());\n\n if(!className.compare(\"QQuickRowDefinition\"))\n {\n QQuickRowDefinition\n *definition = qobject_cast<QQuickRowDefinition *>(item);\n\n m_gridDefinition.addRowDefinition(definition->m_weight);\n }\n else if(!className.compare(\"QQuickColumnDefinition\"))\n {\n QQuickColumnDefinition\n *definition = qobject_cast<QQuickColumnDefinition *>(item);\n\n m_gridDefinition.addColumnDefinition(definition->m_weight);\n }\n else\n {\n m_items << item;\n }\n }\n else if(change == ItemChildRemovedChange)\n {\n QQuickItem\n *item = value.item;\n\n m_items.removeOne(item);\n }\n\n polish();\n\n QQuickItem::itemChange(change, value);\n}\n\nvoid QQuickGridStar::geometryChanged(const QRectF &newGeometry, const QRectF &oldGeometry)\n{\n polish();\n\n QQuickItem::geometryChanged(newGeometry, oldGeometry);\n}\n\nvoid QQuickGridStar::updatePolish()\n{\n QSizeF\n size(width(), height());\n\n QRectF\n rect(QPointF(0.0f, 0.0f), size);\n\n for(QQuickItem *item : m_items)\n {\n QQuickGridStarAttached\n *attached = qobject_cast<QQuickGridStarAttached *>(qmlAttachedPropertiesObject<QQuickGridStar>(item));\n\n if(!attached->m_ignore)\n {\n if(attached->m_dirty)\n {\n attached->m_rowSpanActual = attached->m_rowSpan;\n attached->m_columnSpanActual = attached->m_columnSpan;\n\n m_gridDefinition.calculateBounds(attached->m_row, attached->m_column, attached->m_rowSpanActual, attached->m_columnSpanActual);\n\n attached->m_dirty = false;\n }\n\n QRectF\n cellRect(m_gridDefinition.cellRect(rect, attached->m_row, attached->m_column, attached->m_rowSpanActual, attached->m_columnSpanActual));\n\n item->setPosition(cellRect.topLeft());\n item->setSize(cellRect.size());\n }\n }\n}\n\nQQuickGridStarAttached *QQuickGridStar::qmlAttachedProperties(QObject *object)\n{\n return new QQuickGridStarAttached(object);\n}\n\nvoid registerQuickGridStarTypes()\n{\n qmlRegisterType<QQuickGridStar>(\"QuickGridStar\", 1, 0, \"GridStar\");\n qmlRegisterType<QQuickRowDefinition>(\"QuickGridStar\", 1, 0, \"RowDefinition\");\n qmlRegisterType<QQuickColumnDefinition>(\"QuickGridStar\", 1, 0, \"ColumnDefinition\");\n}\n\nQ_COREAPP_STARTUP_FUNCTION(registerQuickGridStarTypes)\n<commit_msg>Update qquickgridstar.cpp<commit_after>#include \"qquickgridstar.h\"\n\nQQuickRowDefinition::QQuickRowDefinition(QQuickItem *parent) :\n QQuickItem(parent),\n m_weight(1.0)\n{\n}\n\nQQuickColumnDefinition::QQuickColumnDefinition(QQuickItem *parent) :\n QQuickItem(parent),\n m_weight(1.0)\n{\n}\n\nQQuickGridStarAttached::QQuickGridStarAttached(QObject *object) :\n QObject(object),\n m_ignore(false),\n m_dirty(true),\n m_row(0),\n m_column(0),\n m_rowSpan(1),\n m_columnSpan(1),\n m_rowSpanActual(1),\n m_columnSpanActual(1)\n{\n}\n\nbool QQuickGridStarAttached::getIgnore()\n{\n return m_ignore;\n}\n\nqint32 QQuickGridStarAttached::getRow()\n{\n return m_row;\n}\n\nqint32 QQuickGridStarAttached::getColumn()\n{\n return m_column;\n}\n\nqint32 QQuickGridStarAttached::getRowSpan()\n{\n return m_rowSpan;\n}\n\nqint32 QQuickGridStarAttached::getColumnSpan()\n{\n return m_columnSpan;\n}\n\nvoid QQuickGridStarAttached::setIgnore(bool ignore)\n{\n m_ignore = ignore;\n\n m_dirty = true;\n}\n\nvoid QQuickGridStarAttached::setRow(qint32 row)\n{\n m_row = row;\n\n m_dirty = true;\n}\n\nvoid QQuickGridStarAttached::setColumn(qint32 column)\n{\n m_column = column;\n\n m_dirty = true;\n}\n\nvoid QQuickGridStarAttached::setRowSpan(qint32 rowSpan)\n{\n m_rowSpan = rowSpan;\n\n m_dirty = true;\n}\n\nvoid QQuickGridStarAttached::setColumnSpan(qint32 columnSpan)\n{\n m_columnSpan = columnSpan;\n\n m_dirty = true;\n}\n\nQQuickGridStar::QQuickGridStar(QQuickItem *parent) :\n QQuickItem(parent)\n{\n}\n\nQQuickGridStar::~QQuickGridStar()\n{\n}\n\nqint32 QQuickGridStar::rowCount()\n{\n return m_gridDefinition.rowCount();\n}\n\nqint32 QQuickGridStar::columnCount()\n{\n return m_gridDefinition.columnCount();\n}\n\nQVariant QQuickGridStar::itemsAt(qint32 row, qint32 column)\n{\n QVariantList\n quickItems;\n\n for(QQuickItem *item : m_items)\n {\n QQuickGridStarAttached\n *attached = qobject_cast<QQuickGridStarAttached *>(qmlAttachedPropertiesObject<QQuickGridStar>(item));\n\n if(attached->m_row == row && attached->m_column == column)\n {\n quickItems << QVariant::fromValue(item);\n }\n }\n\n return quickItems;\n}\n\nvoid QQuickGridStar::addRowDefinition(qreal weight, qint32 row)\n{\n for(QQuickItem *item : m_items)\n {\n QQuickGridStarAttached\n *attached = qobject_cast<QQuickGridStarAttached *>(qmlAttachedPropertiesObject<QQuickGridStar>(item));\n\n if(attached->m_row >= row)\n {\n attached->m_row++;\n }\n\n attached->m_dirty = true;\n }\n\n m_gridDefinition.addRowDefinition(weight, row);\n\n polish();\n}\n\nvoid QQuickGridStar::addColumnDefinition(qreal weight, qint32 column)\n{\n for(QQuickItem *item : m_items)\n {\n QQuickGridStarAttached\n *attached = qobject_cast<QQuickGridStarAttached *>(qmlAttachedPropertiesObject<QQuickGridStar>(item));\n\n if(attached->m_column >= column)\n {\n attached->m_column++;\n }\n\n attached->m_dirty = true;\n }\n\n m_gridDefinition.addColumnDefinition(weight, column);\n\n polish();\n}\n\nvoid QQuickGridStar::removeRowDefinition(qint32 row)\n{\n for(QQuickItem *item : m_items)\n {\n QQuickGridStarAttached\n *attached = qobject_cast<QQuickGridStarAttached *>(qmlAttachedPropertiesObject<QQuickGridStar>(item));\n\n if(attached->m_row >= row)\n {\n attached->m_row--;\n }\n\n attached->m_dirty = true;\n }\n\n m_gridDefinition.removeRowDefinition(row);\n\n polish();\n}\n\nvoid QQuickGridStar::removeColumnDefinition(qint32 column)\n{\n for(QQuickItem *item : m_items)\n {\n QQuickGridStarAttached\n *attached = qobject_cast<QQuickGridStarAttached *>(qmlAttachedPropertiesObject<QQuickGridStar>(item));\n\n if(attached->m_column >= column)\n {\n attached->m_column--;\n }\n\n attached->m_dirty = true;\n }\n\n m_gridDefinition.removeColumnDefinition(column);\n\n polish();\n}\n\nqreal QQuickGridStar::getRowSpacing()\n{\n return m_rowSpacing;\n}\n\nqreal QQuickGridStar::getColumnSpacing()\n{\n return m_columnSpacing;\n}\n\nvoid QQuickGridStar::setRowSpacing(qreal rowSpacing)\n{\n m_rowSpacing = rowSpacing;\n}\n\nvoid QQuickGridStar::setColumnSpacing(qreal columnSpacing)\n{\n m_columnSpacing = columnSpacing;\n}\n\nvoid QQuickGridStar::componentComplete()\n{\n QSizeF\n size = QSizeF(width(), height());\n\n if(size.isEmpty())\n {\n QObject\n *parentObject = parent();\n\n if(parentObject->isWindowType())\n {\n QQuickWindow\n *quickWindow = qobject_cast<QQuickWindow *>(parentObject);\n\n size = QSizeF(quickWindow->width(), quickWindow->height());\n }\n else\n {\n QQuickItem\n *quickItem = qobject_cast<QQuickItem *>(parentObject);\n\n size = QSizeF(quickItem->width(), quickItem->height());\n }\n\n setSize(size);\n }\n\n if(m_rowSpacing > 0.0)\n {\n qreal\n weight = m_rowSpacing \/ size.height();\n\n for(qint32 i = 0, rows = rowCount() - 1; i < rows; i++)\n {\n addRowDefinition(weight, i * 2 + 1);\n }\n }\n\n if(m_columnSpacing > 0.0)\n {\n qreal\n weight = m_columnSpacing \/ size.height();\n\n for(qint32 i = 0, columns = columnCount() - 1; i < columns; i++)\n {\n addColumnDefinition(weight, i * 2 + 1);\n }\n }\n\n QQuickItem::componentComplete();\n}\n\nvoid QQuickGridStar::itemChange(ItemChange change, const ItemChangeData &value)\n{\n if(change == ItemChildAddedChange)\n {\n QQuickItem\n *item = value.item;\n\n QString\n className(item->metaObject()->className());\n\n if(!className.compare(\"QQuickRowDefinition\"))\n {\n QQuickRowDefinition\n *definition = qobject_cast<QQuickRowDefinition *>(item);\n\n m_gridDefinition.addRowDefinition(definition->m_weight);\n }\n else if(!className.compare(\"QQuickColumnDefinition\"))\n {\n QQuickColumnDefinition\n *definition = qobject_cast<QQuickColumnDefinition *>(item);\n\n m_gridDefinition.addColumnDefinition(definition->m_weight);\n }\n else\n {\n m_items << item;\n }\n }\n else if(change == ItemChildRemovedChange)\n {\n QQuickItem\n *item = value.item;\n\n m_items.removeOne(item);\n }\n\n polish();\n\n QQuickItem::itemChange(change, value);\n}\n\nvoid QQuickGridStar::geometryChanged(const QRectF &newGeometry, const QRectF &oldGeometry)\n{\n polish();\n\n QQuickItem::geometryChanged(newGeometry, oldGeometry);\n}\n\nvoid QQuickGridStar::updatePolish()\n{\n QSizeF\n size(width(), height());\n\n QRectF\n rect(QPointF(0.0, 0.0), size);\n\n for(QQuickItem *item : m_items)\n {\n QQuickGridStarAttached\n *attached = qobject_cast<QQuickGridStarAttached *>(qmlAttachedPropertiesObject<QQuickGridStar>(item));\n\n if(!attached->m_ignore)\n {\n if(attached->m_dirty)\n {\n attached->m_rowSpanActual = attached->m_rowSpan;\n attached->m_columnSpanActual = attached->m_columnSpan;\n\n m_gridDefinition.calculateBounds(attached->m_row, attached->m_column, attached->m_rowSpanActual, attached->m_columnSpanActual);\n\n attached->m_dirty = false;\n }\n\n QRectF\n cellRect(m_gridDefinition.cellRect(rect, attached->m_row, attached->m_column, attached->m_rowSpanActual, attached->m_columnSpanActual));\n\n item->setPosition(cellRect.topLeft());\n item->setSize(cellRect.size());\n\n emit attached->layout();\n }\n }\n}\n\nQQuickGridStarAttached *QQuickGridStar::qmlAttachedProperties(QObject *object)\n{\n return new QQuickGridStarAttached(object);\n}\n\nvoid registerQuickGridStarTypes()\n{\n qmlRegisterType<QQuickGridStar>(\"QuickGridStar\", 1, 0, \"GridStar\");\n qmlRegisterType<QQuickRowDefinition>(\"QuickGridStar\", 1, 0, \"RowDefinition\");\n qmlRegisterType<QQuickColumnDefinition>(\"QuickGridStar\", 1, 0, \"ColumnDefinition\");\n}\n\nQ_COREAPP_STARTUP_FUNCTION(registerQuickGridStarTypes)\n<|endoftext|>"} {"text":"<commit_before>#include \"QFileEdit.h\"\n\n#include <QBoxLayout>\n#include <QFileDialog>\n#include <QToolButton>\n\nQFileEdit::QFileEdit( QWidget* parent, Mode m, const QString& f ) :\n\tQWidget( parent ),\n\tmode( m ),\n\tfilter( f )\n{\n\tauto* l = new QHBoxLayout( this );\n\tl->setSpacing( 2 );\n\tl->setMargin( 0 );\n\tsetLayout( l );\n\n\tlineEdit = new QLineEdit( this );\n\tl->addWidget( lineEdit );\n\n\tbrowseButton = new QToolButton( this );\n\tbrowseButton->setText( \"...\" );\n\tbrowseButton->setContentsMargins( 0, 0, 0, 0 );\n\tl->addWidget( browseButton );\n\n\tconnect( browseButton, &QPushButton::released, this, &QFileEdit::browse );\n}\n\nvoid QFileEdit::browse()\n{\n\tQFileInfo fi = lineEdit->text();\n\n\tQString result;\n\n\tswitch ( mode )\n\t{\n\tcase QFileEdit::OpenFile:\n\t\tresult = QFileDialog::getOpenFileName( this, \"Open File\", fi.path(), filter, nullptr );\n\t\tbreak;\n\tcase QFileEdit::SaveFile:\n\t\tresult = QFileDialog::getSaveFileName( this, \"Save File\", fi.path(), filter, nullptr );\n\t\tbreak;\n\tcase QFileEdit::Directory:\n\t\tresult = QFileDialog::getExistingDirectory( this, \"Select Directory\", fi.path(), nullptr );\n\t\tbreak;\n\tdefault:\n\t\tbreak;\n\t}\n\n\tif ( !result.isEmpty() )\n\t\tlineEdit->setText( result );\n}\n\nvoid QFileEdit::setText( const QString& s )\n{\n\tlineEdit->setText( s );\n}\n\nvoid QFileEdit::setText( const QString& s, Mode m, const QString& f )\n{\n\tsetText( s );\n\tsetMode( m );\n\tsetFilter( f );\n}\n\nQString QFileEdit::text() const\n{\n\treturn lineEdit->text();\n}\n\nvoid QFileEdit::setFilter( const QString& f )\n{\n\tfilter = f;\n}\n\nvoid QFileEdit::setMode( Mode m )\n{\n\tmode = m;\n}\n<commit_msg>F: QFileEdit connect<commit_after>#include \"QFileEdit.h\"\n\n#include <QBoxLayout>\n#include <QFileDialog>\n#include <QToolButton>\n\nQFileEdit::QFileEdit( QWidget* parent, Mode m, const QString& f ) :\n\tQWidget( parent ),\n\tmode( m ),\n\tfilter( f )\n{\n\tauto* l = new QHBoxLayout( this );\n\tl->setSpacing( 2 );\n\tl->setMargin( 0 );\n\tsetLayout( l );\n\n\tlineEdit = new QLineEdit( this );\n\tl->addWidget( lineEdit );\n\n\tbrowseButton = new QToolButton( this );\n\tbrowseButton->setText( \"...\" );\n\tbrowseButton->setContentsMargins( 0, 0, 0, 0 );\n\tl->addWidget( browseButton );\n\n\tconnect( browseButton, &QAbstractButton::released, this, &QFileEdit::browse );\n}\n\nvoid QFileEdit::browse()\n{\n\tQFileInfo fi = lineEdit->text();\n\tQString result;\n\n\tswitch ( mode )\n\t{\n\tcase QFileEdit::OpenFile:\n\t\tresult = QFileDialog::getOpenFileName( this, \"Open File\", fi.path(), filter, nullptr );\n\t\tbreak;\n\tcase QFileEdit::SaveFile:\n\t\tresult = QFileDialog::getSaveFileName( this, \"Save File\", fi.path(), filter, nullptr );\n\t\tbreak;\n\tcase QFileEdit::Directory:\n\t\tresult = QFileDialog::getExistingDirectory( this, \"Select Directory\", fi.path(), nullptr );\n\t\tbreak;\n\tdefault:\n\t\tbreak;\n\t}\n\n\tif ( !result.isEmpty() )\n\t\tlineEdit->setText( result );\n}\n\nvoid QFileEdit::setText( const QString& s )\n{\n\tlineEdit->setText( s );\n}\n\nvoid QFileEdit::setText( const QString& s, Mode m, const QString& f )\n{\n\tsetText( s );\n\tsetMode( m );\n\tsetFilter( f );\n}\n\nQString QFileEdit::text() const\n{\n\treturn lineEdit->text();\n}\n\nvoid QFileEdit::setFilter( const QString& f )\n{\n\tfilter = f;\n}\n\nvoid QFileEdit::setMode( Mode m )\n{\n\tmode = m;\n}\n<|endoftext|>"} {"text":"<commit_before>\/\/ Copyright (c) 2009-2010 Satoshi Nakamoto\n\/\/ Copyright (c) 2009-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 <chainparams.h>\n#include <fs.h>\n#include <logging.h>\n#include <wallet\/db.h>\n\n#include <string>\n\nstd::vector<fs::path> ListDatabases(const fs::path& wallet_dir)\n{\n const size_t offset = wallet_dir.native().size() + (wallet_dir == wallet_dir.root_name() ? 0 : 1);\n std::vector<fs::path> paths;\n boost::system::error_code ec;\n\n for (auto it = fs::recursive_directory_iterator(wallet_dir, ec); it != fs::recursive_directory_iterator(); it.increment(ec)) {\n if (ec) {\n if (fs::is_directory(*it)) {\n it.no_push();\n LogPrintf(\"%s: %s %s -- skipping.\\n\", __func__, ec.message(), fs::PathToString(it->path()));\n } else {\n LogPrintf(\"%s: %s %s\\n\", __func__, ec.message(), fs::PathToString(it->path()));\n }\n continue;\n }\n\n try {\n \/\/ Get wallet path relative to walletdir by removing walletdir from the wallet path.\n \/\/ This can be replaced by boost::filesystem::lexically_relative once boost is bumped to 1.60.\n const auto path_str = it->path().native().substr(offset);\n const fs::path path{path_str.begin(), path_str.end()};\n\n if (it->status().type() == fs::directory_file &&\n (IsBDBFile(BDBDataFile(it->path())) || IsSQLiteFile(SQLiteDataFile(it->path())))) {\n \/\/ Found a directory which contains wallet.dat btree file, add it as a wallet.\n paths.emplace_back(path);\n } else if (it.level() == 0 && it->symlink_status().type() == fs::regular_file && IsBDBFile(it->path())) {\n if (it->path().filename() == \"wallet.dat\") {\n \/\/ Found top-level wallet.dat btree file, add top level directory \"\"\n \/\/ as a wallet.\n paths.emplace_back();\n } else {\n \/\/ Found top-level btree file not called wallet.dat. Current bitcoin\n \/\/ software will never create these files but will allow them to be\n \/\/ opened in a shared database environment for backwards compatibility.\n \/\/ Add it to the list of available wallets.\n paths.emplace_back(path);\n }\n }\n } catch (const std::exception& e) {\n LogPrintf(\"%s: Error scanning %s: %s\\n\", __func__, fs::PathToString(it->path()), e.what());\n it.no_push();\n }\n }\n\n return paths;\n}\n\nfs::path BDBDataFile(const fs::path& wallet_path)\n{\n if (fs::is_regular_file(wallet_path)) {\n \/\/ Special case for backwards compatibility: if wallet path points to an\n \/\/ existing file, treat it as the path to a BDB data file in a parent\n \/\/ directory that also contains BDB log files.\n return wallet_path;\n } else {\n \/\/ Normal case: Interpret wallet path as a directory path containing\n \/\/ data and log files.\n return wallet_path \/ \"wallet.dat\";\n }\n}\n\nfs::path SQLiteDataFile(const fs::path& path)\n{\n return path \/ \"wallet.dat\";\n}\n\nbool IsBDBFile(const fs::path& path)\n{\n if (!fs::exists(path)) return false;\n\n \/\/ A Berkeley DB Btree file has at least 4K.\n \/\/ This check also prevents opening lock files.\n boost::system::error_code ec;\n auto size = fs::file_size(path, ec);\n if (ec) LogPrintf(\"%s: %s %s\\n\", __func__, ec.message(), fs::PathToString(path));\n if (size < 4096) return false;\n\n fsbridge::ifstream file(path, std::ios::binary);\n if (!file.is_open()) return false;\n\n file.seekg(12, std::ios::beg); \/\/ Magic bytes start at offset 12\n uint32_t data = 0;\n file.read((char*) &data, sizeof(data)); \/\/ Read 4 bytes of file to compare against magic\n\n \/\/ Berkeley DB Btree magic bytes, from:\n \/\/ https:\/\/github.com\/file\/file\/blob\/5824af38469ec1ca9ac3ffd251e7afe9dc11e227\/magic\/Magdir\/database#L74-L75\n \/\/ - big endian systems - 00 05 31 62\n \/\/ - little endian systems - 62 31 05 00\n return data == 0x00053162 || data == 0x62310500;\n}\n\nbool IsSQLiteFile(const fs::path& path)\n{\n if (!fs::exists(path)) return false;\n\n \/\/ A SQLite Database file is at least 512 bytes.\n boost::system::error_code ec;\n auto size = fs::file_size(path, ec);\n if (ec) LogPrintf(\"%s: %s %s\\n\", __func__, ec.message(), fs::PathToString(path));\n if (size < 512) return false;\n\n fsbridge::ifstream file(path, std::ios::binary);\n if (!file.is_open()) return false;\n\n \/\/ Magic is at beginning and is 16 bytes long\n char magic[16];\n file.read(magic, 16);\n\n \/\/ Application id is at offset 68 and 4 bytes long\n file.seekg(68, std::ios::beg);\n char app_id[4];\n file.read(app_id, 4);\n\n file.close();\n\n \/\/ Check the magic, see https:\/\/sqlite.org\/fileformat2.html\n std::string magic_str(magic, 16);\n if (magic_str != std::string(\"SQLite format 3\", 16)) {\n return false;\n }\n\n \/\/ Check the application id matches our network magic\n return memcmp(Params().MessageStart(), app_id, 4) == 0;\n}\n<commit_msg>refactor: get wallet path relative to wallet_dir<commit_after>\/\/ Copyright (c) 2009-2010 Satoshi Nakamoto\n\/\/ Copyright (c) 2009-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 <chainparams.h>\n#include <fs.h>\n#include <logging.h>\n#include <wallet\/db.h>\n\n#include <string>\n\nstd::vector<fs::path> ListDatabases(const fs::path& wallet_dir)\n{\n std::vector<fs::path> paths;\n boost::system::error_code ec;\n\n for (auto it = fs::recursive_directory_iterator(wallet_dir, ec); it != fs::recursive_directory_iterator(); it.increment(ec)) {\n if (ec) {\n if (fs::is_directory(*it)) {\n it.no_push();\n LogPrintf(\"%s: %s %s -- skipping.\\n\", __func__, ec.message(), fs::PathToString(it->path()));\n } else {\n LogPrintf(\"%s: %s %s\\n\", __func__, ec.message(), fs::PathToString(it->path()));\n }\n continue;\n }\n\n try {\n const fs::path path{it->path().lexically_relative(wallet_dir)};\n\n if (it->status().type() == fs::directory_file &&\n (IsBDBFile(BDBDataFile(it->path())) || IsSQLiteFile(SQLiteDataFile(it->path())))) {\n \/\/ Found a directory which contains wallet.dat btree file, add it as a wallet.\n paths.emplace_back(path);\n } else if (it.level() == 0 && it->symlink_status().type() == fs::regular_file && IsBDBFile(it->path())) {\n if (it->path().filename() == \"wallet.dat\") {\n \/\/ Found top-level wallet.dat btree file, add top level directory \"\"\n \/\/ as a wallet.\n paths.emplace_back();\n } else {\n \/\/ Found top-level btree file not called wallet.dat. Current bitcoin\n \/\/ software will never create these files but will allow them to be\n \/\/ opened in a shared database environment for backwards compatibility.\n \/\/ Add it to the list of available wallets.\n paths.emplace_back(path);\n }\n }\n } catch (const std::exception& e) {\n LogPrintf(\"%s: Error scanning %s: %s\\n\", __func__, fs::PathToString(it->path()), e.what());\n it.no_push();\n }\n }\n\n return paths;\n}\n\nfs::path BDBDataFile(const fs::path& wallet_path)\n{\n if (fs::is_regular_file(wallet_path)) {\n \/\/ Special case for backwards compatibility: if wallet path points to an\n \/\/ existing file, treat it as the path to a BDB data file in a parent\n \/\/ directory that also contains BDB log files.\n return wallet_path;\n } else {\n \/\/ Normal case: Interpret wallet path as a directory path containing\n \/\/ data and log files.\n return wallet_path \/ \"wallet.dat\";\n }\n}\n\nfs::path SQLiteDataFile(const fs::path& path)\n{\n return path \/ \"wallet.dat\";\n}\n\nbool IsBDBFile(const fs::path& path)\n{\n if (!fs::exists(path)) return false;\n\n \/\/ A Berkeley DB Btree file has at least 4K.\n \/\/ This check also prevents opening lock files.\n boost::system::error_code ec;\n auto size = fs::file_size(path, ec);\n if (ec) LogPrintf(\"%s: %s %s\\n\", __func__, ec.message(), fs::PathToString(path));\n if (size < 4096) return false;\n\n fsbridge::ifstream file(path, std::ios::binary);\n if (!file.is_open()) return false;\n\n file.seekg(12, std::ios::beg); \/\/ Magic bytes start at offset 12\n uint32_t data = 0;\n file.read((char*) &data, sizeof(data)); \/\/ Read 4 bytes of file to compare against magic\n\n \/\/ Berkeley DB Btree magic bytes, from:\n \/\/ https:\/\/github.com\/file\/file\/blob\/5824af38469ec1ca9ac3ffd251e7afe9dc11e227\/magic\/Magdir\/database#L74-L75\n \/\/ - big endian systems - 00 05 31 62\n \/\/ - little endian systems - 62 31 05 00\n return data == 0x00053162 || data == 0x62310500;\n}\n\nbool IsSQLiteFile(const fs::path& path)\n{\n if (!fs::exists(path)) return false;\n\n \/\/ A SQLite Database file is at least 512 bytes.\n boost::system::error_code ec;\n auto size = fs::file_size(path, ec);\n if (ec) LogPrintf(\"%s: %s %s\\n\", __func__, ec.message(), fs::PathToString(path));\n if (size < 512) return false;\n\n fsbridge::ifstream file(path, std::ios::binary);\n if (!file.is_open()) return false;\n\n \/\/ Magic is at beginning and is 16 bytes long\n char magic[16];\n file.read(magic, 16);\n\n \/\/ Application id is at offset 68 and 4 bytes long\n file.seekg(68, std::ios::beg);\n char app_id[4];\n file.read(app_id, 4);\n\n file.close();\n\n \/\/ Check the magic, see https:\/\/sqlite.org\/fileformat2.html\n std::string magic_str(magic, 16);\n if (magic_str != std::string(\"SQLite format 3\", 16)) {\n return false;\n }\n\n \/\/ Check the application id matches our network magic\n return memcmp(Params().MessageStart(), app_id, 4) == 0;\n}\n<|endoftext|>"} {"text":"<commit_before>\/**\n * @file win32\/net.cpp\n * @brief Win32 network access layer (using WinHTTP)\n *\n * (c) 2013-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 \"meganet.h\"\n\nnamespace mega {\nWinHttpIO::WinHttpIO()\n{\n InitializeCriticalSection(&csHTTP);\n EnterCriticalSection(&csHTTP);\n\n hWakeupEvent = CreateEvent(NULL, FALSE, FALSE, NULL);\n\n waiter = NULL;\n}\n\nWinHttpIO::~WinHttpIO()\n{\n WinHttpCloseHandle(hSession);\n LeaveCriticalSection(&csHTTP);\n}\n\nvoid WinHttpIO::setuseragent(string* useragent)\n{\n string wuseragent;\n\n wuseragent.resize((useragent->size() + 1) * sizeof(wchar_t));\n wuseragent.resize(sizeof(wchar_t)\n * (MultiByteToWideChar(CP_UTF8, 0, useragent->c_str(),\n -1, (wchar_t*)wuseragent.data(),\n wuseragent.size() \/ sizeof(wchar_t) + 1)\n - 1));\n\n \/\/ create the session handle using the default settings.\n hSession = WinHttpOpen((LPCWSTR)wuseragent.data(),\n WINHTTP_ACCESS_TYPE_DEFAULT_PROXY,\n WINHTTP_NO_PROXY_NAME,\n WINHTTP_NO_PROXY_BYPASS,\n WINHTTP_FLAG_ASYNC);\n}\n\n\/\/ trigger wakeup\nvoid WinHttpIO::httpevent()\n{\n SetEvent(hWakeupEvent);\n}\n\n\/\/ (WinHTTP unfortunately uses threads, hence the need for a mutex)\nvoid WinHttpIO::entercs()\n{\n EnterCriticalSection(&csHTTP);\n}\n\nvoid WinHttpIO::leavecs()\n{\n LeaveCriticalSection(&csHTTP);\n}\n\n\/\/ ensure wakeup from WinHttpIO events\nvoid WinHttpIO::addevents(Waiter* cwaiter, int flags)\n{\n waiter = (WinWaiter*)cwaiter;\n\n waiter->addhandle(hWakeupEvent, flags);\n waiter->pcsHTTP = &csHTTP;\n}\n\n\/\/ handle WinHTTP callbacks (which can be in a worker thread context)\nVOID CALLBACK WinHttpIO::asynccallback(HINTERNET hInternet, DWORD_PTR dwContext,\n DWORD dwInternetStatus,\n LPVOID lpvStatusInformation,\n DWORD dwStatusInformationLength)\n{\n WinHttpContext* httpctx = (WinHttpContext*)dwContext;\n WinHttpIO* httpio = (WinHttpIO*)httpctx->httpio;\n\n if (dwInternetStatus == WINHTTP_CALLBACK_STATUS_HANDLE_CLOSING)\n {\n assert(!httpctx->req);\n\n if (httpctx->gzip)\n {\n inflateEnd(&httpctx->z);\n }\n \n delete httpctx;\n return;\n }\n\n httpio->entercs();\n\n HttpReq* req = httpctx->req;\n\n \/\/ request cancellations that occured after asynccallback() was entered are caught here\n if (!req)\n {\n httpio->leavecs();\n return;\n }\n\n switch (dwInternetStatus)\n {\n case WINHTTP_CALLBACK_STATUS_DATA_AVAILABLE:\n {\n DWORD size = *(DWORD*)lpvStatusInformation;\n\n if (!size)\n {\n if (debug)\n {\n if (req->binary)\n {\n cout << \"[received \" << req->bufpos << \" bytes of raw data]\" << endl;\n }\n else\n {\n cout << \"Received: \" << req->in.c_str() << endl;\n }\n }\n\n req->status = req->httpstatus == 200 ? REQ_SUCCESS : REQ_FAILURE;\n httpio->success = true;\n httpio->httpevent();\n }\n else\n {\n char* ptr;\n\n if (httpctx->gzip)\n {\n m_off_t zprevsize = httpctx->zin.size();\n httpctx->zin.resize(zprevsize + size);\n ptr = (char*) httpctx->zin.data() + zprevsize;\n }\n else\n {\n ptr = (char*)req->reserveput((unsigned*)&size);\n req->bufpos += size;\n }\n\n if (!WinHttpReadData(hInternet, ptr, size, NULL))\n {\n httpio->cancel(req);\n }\n }\n\n httpio->httpevent();\n break;\n }\n\n case WINHTTP_CALLBACK_STATUS_READ_COMPLETE:\n if (dwStatusInformationLength)\n {\n if (httpctx->gzip)\n {\n httpctx->z.next_in = (Bytef*)lpvStatusInformation;\n httpctx->z.avail_in = dwStatusInformationLength;\n\n req->bufpos += httpctx->z.avail_out;\n int t = inflate(&httpctx->z, Z_SYNC_FLUSH);\n req->bufpos -= httpctx->z.avail_out;\n\n if (((char *)lpvStatusInformation + dwStatusInformationLength) ==\n (httpctx->zin.data() + httpctx->zin.size()))\n {\n httpctx->zin.clear();\n }\n\n if (t != Z_OK && (t != Z_STREAM_END || httpctx->z.avail_out))\n {\n httpio->cancel(req);\n }\n }\n\n if (!WinHttpQueryDataAvailable(httpctx->hRequest, NULL))\n {\n httpio->cancel(req);\n httpio->httpevent();\n }\n }\n break;\n\n case WINHTTP_CALLBACK_STATUS_HEADERS_AVAILABLE:\n {\n DWORD statusCode;\n DWORD statusCodeSize = sizeof(statusCode);\n\n if (!WinHttpQueryHeaders(httpctx->hRequest,\n WINHTTP_QUERY_STATUS_CODE | WINHTTP_QUERY_FLAG_NUMBER,\n WINHTTP_HEADER_NAME_BY_INDEX,\n &statusCode,\n &statusCodeSize,\n WINHTTP_NO_HEADER_INDEX))\n {\n httpio->cancel(req);\n httpio->httpevent();\n }\n else\n {\n req->httpstatus = statusCode;\n\n if (!req->buf)\n {\n \/\/ obtain original content length - always present if gzip is in use\n DWORD contentLength;\n DWORD contentLengthSize = sizeof(contentLength);\n\n if (WinHttpQueryHeaders(httpctx->hRequest,\n WINHTTP_QUERY_CUSTOM | WINHTTP_QUERY_FLAG_NUMBER,\n L\"Original-Content-Length\",\n &contentLength,\n &contentLengthSize,\n WINHTTP_NO_HEADER_INDEX))\n {\n req->setcontentlength(contentLength);\n\n \/\/ check for gzip content encoding\n WCHAR contentEncoding[16];\n DWORD contentEncodingSize = sizeof(contentEncoding);\n\n httpctx->gzip = WinHttpQueryHeaders(httpctx->hRequest,\n WINHTTP_QUERY_CONTENT_ENCODING,\n WINHTTP_HEADER_NAME_BY_INDEX,\n &contentEncoding,\n &contentEncodingSize,\n WINHTTP_NO_HEADER_INDEX)\n && !wcscmp(contentEncoding,L\"gzip\");\n\n if (httpctx->gzip)\n {\n httpctx->z.zalloc = Z_NULL;\n httpctx->z.zfree = Z_NULL;\n httpctx->z.opaque = Z_NULL;\n httpctx->z.avail_in = 0;\n httpctx->z.next_in = Z_NULL;\n\n inflateInit2(&httpctx->z, MAX_WBITS+16);\n\n req->in.resize(contentLength);\n httpctx->z.avail_out = contentLength;\n httpctx->z.next_out = (unsigned char*)req->in.data();\n }\n }\n }\n\n if (!WinHttpQueryDataAvailable(httpctx->hRequest, NULL))\n {\n httpio->cancel(req);\n httpio->httpevent();\n }\n else if (httpio->waiter && httpio->noinetds)\n {\n httpio->inetstatus(true);\n }\n }\n }\n break;\n\n case WINHTTP_CALLBACK_STATUS_REQUEST_ERROR:\n if (httpio->waiter && GetLastError() != ERROR_WINHTTP_TIMEOUT)\n {\n httpio->inetstatus(false);\n }\n\n \/\/ fall through\n case WINHTTP_CALLBACK_STATUS_SECURE_FAILURE:\n httpio->cancel(req);\n httpio->httpevent();\n break;\n\n case WINHTTP_CALLBACK_STATUS_SENDREQUEST_COMPLETE:\n case WINHTTP_CALLBACK_STATUS_WRITE_COMPLETE:\n if (httpctx->postpos < httpctx->postlen)\n {\n unsigned pos = httpctx->postpos;\n unsigned t = httpctx->postlen - pos;\n\n if (t > HTTP_POST_CHUNK_SIZE)\n {\n t = HTTP_POST_CHUNK_SIZE;\n }\n\n httpctx->postpos += t;\n\n if (!WinHttpWriteData(httpctx->hRequest, (LPVOID)(httpctx->postdata + pos), t, NULL))\n {\n req->httpio->cancel(req);\n }\n\n httpio->httpevent();\n }\n else\n {\n if (!WinHttpReceiveResponse(httpctx->hRequest, NULL))\n {\n httpio->cancel(req);\n httpio->httpevent();\n }\n }\n }\n\n httpio->leavecs();\n}\n\n\/\/ POST request to URL\nvoid WinHttpIO::post(HttpReq* req, const char* data, unsigned len)\n{\n if (debug)\n {\n cout << \"POST target URL: \" << req->posturl << endl;\n\n if (req->binary)\n {\n cout << \"[sending \" << req->out->size() << \" bytes of raw data]\" << endl;\n }\n else\n {\n cout << \"Sending: \" << *req->out << endl;\n }\n }\n\n WinHttpContext* httpctx;\n\n WCHAR szURL[8192];\n WCHAR szHost[256];\n URL_COMPONENTS urlComp = { sizeof urlComp };\n\n urlComp.lpszHostName = szHost;\n urlComp.dwHostNameLength = sizeof szHost \/ sizeof *szHost;\n urlComp.dwUrlPathLength = (DWORD)-1;\n urlComp.dwSchemeLength = (DWORD)-1;\n\n httpctx = new WinHttpContext;\n\n httpctx->httpio = this;\n httpctx->req = req;\n httpctx->gzip = false;\n\n req->httpiohandle = (void*)httpctx;\n\n if (MultiByteToWideChar(CP_UTF8, 0, req->posturl.c_str(), -1, szURL,\n sizeof szURL \/ sizeof *szURL)\n && WinHttpCrackUrl(szURL, 0, 0, &urlComp))\n {\n if ((httpctx->hConnect = WinHttpConnect(hSession, szHost, urlComp.nPort, 0)))\n {\n httpctx->hRequest = WinHttpOpenRequest(httpctx->hConnect, L\"POST\",\n urlComp.lpszUrlPath, NULL,\n WINHTTP_NO_REFERER,\n WINHTTP_DEFAULT_ACCEPT_TYPES,\n (urlComp.nScheme == INTERNET_SCHEME_HTTPS)\n ? WINHTTP_FLAG_SECURE\n : 0);\n\n if (httpctx->hRequest)\n {\n WinHttpSetTimeouts(httpctx->hRequest, 0, 20000, 20000, 1800000);\n\n WinHttpSetStatusCallback(httpctx->hRequest, asynccallback,\n WINHTTP_CALLBACK_FLAG_DATA_AVAILABLE\n | WINHTTP_CALLBACK_FLAG_READ_COMPLETE\n | WINHTTP_CALLBACK_FLAG_HEADERS_AVAILABLE\n | WINHTTP_CALLBACK_FLAG_REQUEST_ERROR\n | WINHTTP_CALLBACK_FLAG_SECURE_FAILURE\n | WINHTTP_CALLBACK_FLAG_SENDREQUEST_COMPLETE\n | WINHTTP_CALLBACK_FLAG_WRITE_COMPLETE\n | WINHTTP_CALLBACK_FLAG_HANDLES,\n 0);\n\n LPCWSTR pwszHeaders = (req->type == REQ_JSON || !req->buf)\n ? L\"Content-Type: application\/json\\r\\nAccept-Encoding: gzip\"\n : L\"Content-Type: application\/octet-stream\";\n\n \/\/ data is sent in HTTP_POST_CHUNK_SIZE instalments to ensure\n \/\/ semi-smooth UI progress info\n httpctx->postlen = data ? len : req->out->size();\n httpctx->postdata = data ? data : req->out->data();\n httpctx->postpos = (httpctx->postlen < HTTP_POST_CHUNK_SIZE)\n ? httpctx->postlen\n : HTTP_POST_CHUNK_SIZE;\n\n if (WinHttpSendRequest(httpctx->hRequest, pwszHeaders,\n wcslen(pwszHeaders),\n (LPVOID)httpctx->postdata,\n httpctx->postpos,\n httpctx->postlen,\n (DWORD_PTR)httpctx))\n {\n req->status = REQ_INFLIGHT;\n return;\n }\n }\n }\n else\n {\n httpctx->hRequest = NULL;\n }\n }\n else\n {\n httpctx->hRequest = NULL;\n httpctx->hConnect = NULL;\n }\n\n req->status = REQ_FAILURE;\n}\n\n\/\/ cancel pending HTTP request\nvoid WinHttpIO::cancel(HttpReq* req)\n{\n WinHttpContext* httpctx;\n\n if ((httpctx = (WinHttpContext*)req->httpiohandle))\n {\n httpctx->req = NULL;\n\n req->httpstatus = 0;\n req->status = REQ_FAILURE;\n req->httpiohandle = NULL;\n\n if (httpctx->hConnect)\n {\n WinHttpCloseHandle(httpctx->hConnect);\n }\n\n if (httpctx->hRequest)\n {\n WinHttpCloseHandle(httpctx->hRequest);\n }\n }\n}\n\n\/\/ supply progress information on POST data\nm_off_t WinHttpIO::postpos(void* handle)\n{\n return ((WinHttpContext*)handle)->postpos;\n}\n\n\/\/ process events\nbool WinHttpIO::doio()\n{\n return false;\n}\n} \/\/ namespace\n<commit_msg>Win32\/Net: SSL public key pinning<commit_after>\/**\n * @file win32\/net.cpp\n * @brief Win32 network access layer (using WinHTTP)\n *\n * (c) 2013-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 \"meganet.h\"\n\nnamespace mega {\nWinHttpIO::WinHttpIO()\n{\n InitializeCriticalSection(&csHTTP);\n EnterCriticalSection(&csHTTP);\n\n hWakeupEvent = CreateEvent(NULL, FALSE, FALSE, NULL);\n\n waiter = NULL;\n}\n\nWinHttpIO::~WinHttpIO()\n{\n WinHttpCloseHandle(hSession);\n LeaveCriticalSection(&csHTTP);\n}\n\nvoid WinHttpIO::setuseragent(string* useragent)\n{\n string wuseragent;\n\n wuseragent.resize((useragent->size() + 1) * sizeof(wchar_t));\n wuseragent.resize(sizeof(wchar_t)\n * (MultiByteToWideChar(CP_UTF8, 0, useragent->c_str(),\n -1, (wchar_t*)wuseragent.data(),\n wuseragent.size() \/ sizeof(wchar_t) + 1)\n - 1));\n\n \/\/ create the session handle using the default settings.\n hSession = WinHttpOpen((LPCWSTR)wuseragent.data(),\n WINHTTP_ACCESS_TYPE_DEFAULT_PROXY,\n WINHTTP_NO_PROXY_NAME,\n WINHTTP_NO_PROXY_BYPASS,\n WINHTTP_FLAG_ASYNC);\n}\n\n\/\/ trigger wakeup\nvoid WinHttpIO::httpevent()\n{\n SetEvent(hWakeupEvent);\n}\n\n\/\/ (WinHTTP unfortunately uses threads, hence the need for a mutex)\nvoid WinHttpIO::entercs()\n{\n EnterCriticalSection(&csHTTP);\n}\n\nvoid WinHttpIO::leavecs()\n{\n LeaveCriticalSection(&csHTTP);\n}\n\n\/\/ ensure wakeup from WinHttpIO events\nvoid WinHttpIO::addevents(Waiter* cwaiter, int flags)\n{\n waiter = (WinWaiter*)cwaiter;\n\n waiter->addhandle(hWakeupEvent, flags);\n waiter->pcsHTTP = &csHTTP;\n}\n\n\/\/ handle WinHTTP callbacks (which can be in a worker thread context)\nVOID CALLBACK WinHttpIO::asynccallback(HINTERNET hInternet, DWORD_PTR dwContext,\n DWORD dwInternetStatus,\n LPVOID lpvStatusInformation,\n DWORD dwStatusInformationLength)\n{\n WinHttpContext* httpctx = (WinHttpContext*)dwContext;\n WinHttpIO* httpio = (WinHttpIO*)httpctx->httpio;\n\n if (dwInternetStatus == WINHTTP_CALLBACK_STATUS_HANDLE_CLOSING)\n {\n assert(!httpctx->req);\n\n if (httpctx->gzip)\n {\n inflateEnd(&httpctx->z);\n }\n \n delete httpctx;\n return;\n }\n\n httpio->entercs();\n\n HttpReq* req = httpctx->req;\n\n \/\/ request cancellations that occured after asynccallback() was entered are caught here\n if (!req)\n {\n httpio->leavecs();\n return;\n }\n\n switch (dwInternetStatus)\n {\n case WINHTTP_CALLBACK_STATUS_DATA_AVAILABLE:\n {\n DWORD size = *(DWORD*)lpvStatusInformation;\n\n if (!size)\n {\n if (debug)\n {\n if (req->binary)\n {\n cout << \"[received \" << req->bufpos << \" bytes of raw data]\" << endl;\n }\n else\n {\n cout << \"Received: \" << req->in.c_str() << endl;\n }\n }\n\n req->status = req->httpstatus == 200 ? REQ_SUCCESS : REQ_FAILURE;\n httpio->success = true;\n }\n else\n {\n char* ptr;\n\n if (httpctx->gzip)\n {\n m_off_t zprevsize = httpctx->zin.size();\n httpctx->zin.resize(zprevsize + size);\n ptr = (char*) httpctx->zin.data() + zprevsize;\n }\n else\n {\n ptr = (char*)req->reserveput((unsigned*)&size);\n req->bufpos += size;\n }\n\n if (!WinHttpReadData(hInternet, ptr, size, NULL))\n {\n httpio->cancel(req);\n }\n }\n\n httpio->httpevent();\n break;\n }\n\n case WINHTTP_CALLBACK_STATUS_READ_COMPLETE:\n if (dwStatusInformationLength)\n {\n if (httpctx->gzip)\n {\n httpctx->z.next_in = (Bytef*)lpvStatusInformation;\n httpctx->z.avail_in = dwStatusInformationLength;\n\n req->bufpos += httpctx->z.avail_out;\n int t = inflate(&httpctx->z, Z_SYNC_FLUSH);\n req->bufpos -= httpctx->z.avail_out;\n\n if (((char *)lpvStatusInformation + dwStatusInformationLength) ==\n (httpctx->zin.data() + httpctx->zin.size()))\n {\n httpctx->zin.clear();\n }\n\n if (t != Z_OK && (t != Z_STREAM_END || httpctx->z.avail_out))\n {\n httpio->cancel(req);\n }\n }\n\n if (!WinHttpQueryDataAvailable(httpctx->hRequest, NULL))\n {\n httpio->cancel(req);\n httpio->httpevent();\n }\n }\n break;\n\n case WINHTTP_CALLBACK_STATUS_HEADERS_AVAILABLE:\n {\n DWORD statusCode;\n DWORD statusCodeSize = sizeof(statusCode);\n\n if (!WinHttpQueryHeaders(httpctx->hRequest,\n WINHTTP_QUERY_STATUS_CODE | WINHTTP_QUERY_FLAG_NUMBER,\n WINHTTP_HEADER_NAME_BY_INDEX,\n &statusCode,\n &statusCodeSize,\n WINHTTP_NO_HEADER_INDEX))\n {\n httpio->cancel(req);\n httpio->httpevent();\n }\n else\n {\n req->httpstatus = statusCode;\n\n if (!req->buf)\n {\n \/\/ obtain original content length - always present if gzip is in use\n DWORD contentLength;\n DWORD contentLengthSize = sizeof(contentLength);\n\n if (WinHttpQueryHeaders(httpctx->hRequest,\n WINHTTP_QUERY_CUSTOM | WINHTTP_QUERY_FLAG_NUMBER,\n L\"Original-Content-Length\",\n &contentLength,\n &contentLengthSize,\n WINHTTP_NO_HEADER_INDEX))\n {\n req->setcontentlength(contentLength);\n\n \/\/ check for gzip content encoding\n WCHAR contentEncoding[16];\n DWORD contentEncodingSize = sizeof(contentEncoding);\n\n httpctx->gzip = WinHttpQueryHeaders(httpctx->hRequest,\n WINHTTP_QUERY_CONTENT_ENCODING,\n WINHTTP_HEADER_NAME_BY_INDEX,\n &contentEncoding,\n &contentEncodingSize,\n WINHTTP_NO_HEADER_INDEX)\n && !wcscmp(contentEncoding, L\"gzip\");\n\n if (httpctx->gzip)\n {\n httpctx->z.zalloc = Z_NULL;\n httpctx->z.zfree = Z_NULL;\n httpctx->z.opaque = Z_NULL;\n httpctx->z.avail_in = 0;\n httpctx->z.next_in = Z_NULL;\n\n inflateInit2(&httpctx->z, MAX_WBITS+16);\n\n req->in.resize(contentLength);\n httpctx->z.avail_out = contentLength;\n httpctx->z.next_out = (unsigned char*)req->in.data();\n }\n }\n }\n\n if (!WinHttpQueryDataAvailable(httpctx->hRequest, NULL))\n {\n httpio->cancel(req);\n httpio->httpevent();\n }\n else if (httpio->waiter && httpio->noinetds)\n {\n httpio->inetstatus(true);\n }\n }\n\n break;\n }\n\n case WINHTTP_CALLBACK_STATUS_REQUEST_ERROR:\n if (httpio->waiter && GetLastError() != ERROR_WINHTTP_TIMEOUT)\n {\n httpio->inetstatus(false);\n }\n \/\/ fall through\n case WINHTTP_CALLBACK_STATUS_SECURE_FAILURE:\n httpio->cancel(req);\n httpio->httpevent();\n break;\n\n case WINHTTP_CALLBACK_STATUS_SENDREQUEST_COMPLETE:\n {\n PCCERT_CONTEXT cert;\n DWORD len = sizeof cert;\n\n if (WinHttpQueryOption(httpctx->hRequest, WINHTTP_OPTION_SERVER_CERT_CONTEXT, &cert, &len))\n {\n CRYPT_BIT_BLOB* pkey = &cert->pCertInfo->SubjectPublicKeyInfo.PublicKey;\n\n \/\/ this is an SSL connection: prevent MITM\n if (pkey->cbData != 270 || memcmp(pkey->pbData, \"\\x30\\x82\\x01\\x0a\\x02\\x82\\x01\\x01\"\n \"\\x00\\xb6\\x61\\xe7\\xcf\\x69\\x2a\\x84\"\n \"\\x35\\x05\\xc3\\x14\\xbc\\x95\\xcf\\x94\"\n \"\\x33\\x1c\\x82\\x67\\x3b\\x04\\x35\\x11\"\n \"\\xa0\\x8d\\xc8\\x9d\\xbb\\x9c\\x79\\x65\"\n \"\\xe7\\x10\\xd9\\x91\\x80\\xc7\\x81\\x0c\"\n \"\\xf4\\x95\\xbb\\xb3\\x26\\x9b\\x97\\xd2\"\n \"\\x14\\x0f\\x0b\\xca\\xf0\\x5e\\x45\\x7b\"\n \"\\x32\\xc6\\xa4\\x7d\\x7a\\xfe\\x11\\xe7\"\n \"\\xb2\\x5e\\x21\\x55\\x23\\x22\\x1a\\xca\"\n \"\\x1a\\xf9\\x21\\xe1\\x4e\\xb7\\x82\\x0d\"\n \"\\xeb\\x9d\\xcb\\x4e\\x3d\\x0b\\xe4\\xed\"\n \"\\x4a\\xef\\xe4\\xab\\x0c\\xec\\x09\\x69\"\n \"\\xfe\\xae\\x43\\xec\\x19\\x04\\x3d\\x5b\"\n \"\\x68\\x0f\\x67\\xe8\\x80\\xff\\x9b\\x03\"\n \"\\xea\\x50\\xab\\x16\\xd7\\xe0\\x4c\\xb4\"\n \"\\x42\\xef\\x31\\xe2\\x32\\x9f\\xe4\\xd5\"\n \"\\xf4\\xd8\\xfd\\x82\\xcc\\xc4\\x50\\xd9\"\n \"\\x4d\\xb5\\xfb\\x6d\\xa2\\xf3\\xaf\\x37\"\n \"\\x67\\x7f\\x96\\x4c\\x54\\x3d\\x9b\\x1c\"\n \"\\xbd\\x5c\\x31\\x6d\\x10\\x43\\xd8\\x22\"\n \"\\x21\\x01\\x87\\x63\\x22\\x89\\x17\\xca\"\n \"\\x92\\xcb\\xcb\\xec\\xe8\\xc7\\xff\\x58\"\n \"\\xe8\\x18\\xc4\\xce\\x1b\\xe5\\x4f\\x20\"\n \"\\xa8\\xcf\\xd3\\xb9\\x9d\\x5a\\x7a\\x69\"\n \"\\xf2\\xca\\x48\\xf8\\x87\\x95\\x3a\\x32\"\n \"\\x70\\xb3\\x1a\\xf0\\xc4\\x45\\x70\\x43\"\n \"\\x58\\x18\\xda\\x85\\x29\\x1d\\xaf\\x83\"\n \"\\xc2\\x35\\xa9\\xc1\\x73\\x76\\xb4\\x47\"\n \"\\x22\\x2b\\x42\\x9f\\x93\\x72\\x3f\\x9d\"\n \"\\x3d\\xa1\\x47\\x3d\\xb0\\x46\\x37\\x1b\"\n \"\\xfd\\x0e\\x28\\x68\\xa0\\xf6\\x1d\\x62\"\n \"\\xb2\\xdc\\x69\\xc7\\x9b\\x09\\x1e\\xb5\"\n \"\\x47\\x02\\x03\\x01\\x00\\x01\",270))\n {\n httpio->cancel(req);\n httpio->httpevent();\n break;\n }\n }\n }\n case WINHTTP_CALLBACK_STATUS_WRITE_COMPLETE:\n if (httpctx->postpos < httpctx->postlen)\n {\n unsigned pos = httpctx->postpos;\n unsigned t = httpctx->postlen - pos;\n\n if (t > HTTP_POST_CHUNK_SIZE)\n {\n t = HTTP_POST_CHUNK_SIZE;\n }\n\n httpctx->postpos += t;\n\n if (!WinHttpWriteData(httpctx->hRequest, (LPVOID)(httpctx->postdata + pos), t, NULL))\n {\n req->httpio->cancel(req);\n }\n\n httpio->httpevent();\n }\n else\n {\n if (!WinHttpReceiveResponse(httpctx->hRequest, NULL))\n {\n httpio->cancel(req);\n httpio->httpevent();\n }\n }\n }\n\n httpio->leavecs();\n}\n\n\/\/ POST request to URL\nvoid WinHttpIO::post(HttpReq* req, const char* data, unsigned len)\n{\n if (debug)\n {\n cout << \"POST target URL: \" << req->posturl << endl;\n\n if (req->binary)\n {\n cout << \"[sending \" << req->out->size() << \" bytes of raw data]\" << endl;\n }\n else\n {\n cout << \"Sending: \" << *req->out << endl;\n }\n }\n\n WinHttpContext* httpctx;\n\n WCHAR szURL[8192];\n WCHAR szHost[256];\n URL_COMPONENTS urlComp = { sizeof urlComp };\n\n urlComp.lpszHostName = szHost;\n urlComp.dwHostNameLength = sizeof szHost \/ sizeof *szHost;\n urlComp.dwUrlPathLength = (DWORD)-1;\n urlComp.dwSchemeLength = (DWORD)-1;\n\n httpctx = new WinHttpContext;\n\n httpctx->httpio = this;\n httpctx->req = req;\n httpctx->gzip = false;\n\n req->httpiohandle = (void*)httpctx;\n\n if (MultiByteToWideChar(CP_UTF8, 0, req->posturl.c_str(), -1, szURL,\n sizeof szURL \/ sizeof *szURL)\n && WinHttpCrackUrl(szURL, 0, 0, &urlComp))\n {\n if ((httpctx->hConnect = WinHttpConnect(hSession, szHost, urlComp.nPort, 0)))\n {\n httpctx->hRequest = WinHttpOpenRequest(httpctx->hConnect, L\"POST\",\n urlComp.lpszUrlPath, NULL,\n WINHTTP_NO_REFERER,\n WINHTTP_DEFAULT_ACCEPT_TYPES,\n (urlComp.nScheme == INTERNET_SCHEME_HTTPS)\n ? WINHTTP_FLAG_SECURE\n : 0);\n\n if (httpctx->hRequest)\n {\n WinHttpSetTimeouts(httpctx->hRequest, 0, 20000, 20000, 1800000);\n\n WinHttpSetStatusCallback(httpctx->hRequest, asynccallback,\n WINHTTP_CALLBACK_FLAG_DATA_AVAILABLE\n | WINHTTP_CALLBACK_FLAG_READ_COMPLETE\n | WINHTTP_CALLBACK_FLAG_HEADERS_AVAILABLE\n | WINHTTP_CALLBACK_FLAG_REQUEST_ERROR\n | WINHTTP_CALLBACK_FLAG_SECURE_FAILURE\n | WINHTTP_CALLBACK_FLAG_SENDREQUEST_COMPLETE\n | WINHTTP_CALLBACK_FLAG_WRITE_COMPLETE\n | WINHTTP_CALLBACK_FLAG_HANDLES,\n 0);\n\n LPCWSTR pwszHeaders = (req->type == REQ_JSON || !req->buf)\n ? L\"Content-Type: application\/json\\r\\nAccept-Encoding: gzip\"\n : L\"Content-Type: application\/octet-stream\";\n\n \/\/ data is sent in HTTP_POST_CHUNK_SIZE instalments to ensure\n \/\/ semi-smooth UI progress info\n httpctx->postlen = data ? len : req->out->size();\n httpctx->postdata = data ? data : req->out->data();\n httpctx->postpos = (urlComp.nPort == 80)\n ? ((httpctx->postlen < HTTP_POST_CHUNK_SIZE)\n ? httpctx->postlen\n : HTTP_POST_CHUNK_SIZE)\n : 0;\n\n if (WinHttpSendRequest(httpctx->hRequest, pwszHeaders,\n wcslen(pwszHeaders),\n (LPVOID)httpctx->postdata,\n httpctx->postpos,\n httpctx->postlen,\n (DWORD_PTR)httpctx))\n {\n req->status = REQ_INFLIGHT;\n return;\n }\n }\n }\n else\n {\n httpctx->hRequest = NULL;\n }\n }\n else\n {\n httpctx->hRequest = NULL;\n httpctx->hConnect = NULL;\n }\n\n req->status = REQ_FAILURE;\n}\n\n\/\/ cancel pending HTTP request\nvoid WinHttpIO::cancel(HttpReq* req)\n{\n WinHttpContext* httpctx;\n\n if ((httpctx = (WinHttpContext*)req->httpiohandle))\n {\n httpctx->req = NULL;\n\n req->httpstatus = 0;\n req->status = REQ_FAILURE;\n req->httpiohandle = NULL;\n\n if (httpctx->hConnect)\n {\n WinHttpCloseHandle(httpctx->hConnect);\n }\n\n if (httpctx->hRequest)\n {\n WinHttpCloseHandle(httpctx->hRequest);\n }\n }\n}\n\n\/\/ supply progress information on POST data\nm_off_t WinHttpIO::postpos(void* handle)\n{\n return ((WinHttpContext*)handle)->postpos;\n}\n\n\/\/ process events\nbool WinHttpIO::doio()\n{\n return false;\n}\n} \/\/ namespace\n<|endoftext|>"} {"text":"<commit_before>\/* <x0\/server.hpp>\n *\n * This file is part of the x0 web server project and is released under LGPL-3.\n *\n * (c) 2009 Chrisitan Parpart <trapni@gentoo.org>\n *\/\n\n#ifndef sw_x0_server_hpp\n#define sw_x0_server_hpp (1)\n\n#include <x0\/datetime.hpp>\n#include <x0\/settings.hpp>\n#include <x0\/logger.hpp>\n#include <x0\/listener.hpp>\n#include <x0\/handler.hpp>\n#include <x0\/context.hpp>\n#include <x0\/plugin.hpp>\n#include <x0\/types.hpp>\n#include <x0\/property.hpp>\n#include <x0\/fileinfo_service.hpp>\n#include <x0\/api.hpp>\n#include <boost\/signals.hpp>\n#include <boost\/asio\/io_service.hpp>\n#include <cstring>\n#include <string>\n#include <list>\n#include <map>\n\nnamespace x0 {\n\nclass host_not_found\n\t: public std::runtime_error\n{\npublic:\n\thost_not_found(const std::string& hostname)\n\t\t: std::runtime_error(hostname)\n\t{\n\t}\n};\n\n\/**\n * \\ingroup core\n * \\brief implements the x0 web server.\n *\n * \\see connection, request, response, plugin\n * \\see server::run(), server::stop()\n *\/\nclass server :\n\tpublic boost::noncopyable\n{\nprivate:\n\ttypedef std::pair<plugin_ptr, void *> plugin_value_t;\n\ttypedef std::map<std::string, plugin_value_t> plugin_map_t;\n\npublic:\n\tserver();\n\t~server();\n\n\t\/\/ {{{ service control\n\t\/** configures this server as defined in the configuration section(s). *\/\n\tvoid configure(const std::string& configfile);\n\t\/** starts this server object by listening on new connections and processing them. *\/\n\tvoid run();\n\t\/** pauses an already active server by not accepting further new connections until resumed. *\/\n\tvoid pause();\n\t\/** resumes a currently paused server by continueing processing new connections. *\/\n\tvoid resume();\n\t\/** reloads server configuration *\/\n\tvoid reload();\n\t\/** gracefully stops a running server *\/\n\tvoid stop();\n\t\/\/ }}}\n\n\t\/\/ {{{ signals raised on request in order\n\t\/** is invoked once a new client connection is established *\/\n\tboost::signal<void(connection_ptr)> connection_open;\n\n\t\/** is called at the very beginning of a request. *\/\n\tboost::signal<void(request&)> pre_process;\n\n\t\/** resolves document_root to use for this request. *\/\n\tboost::signal<void(request&)> resolve_document_root;\n\n\t\/** resolves request's physical filename (maps URI to physical path). *\/\n\tboost::signal<void(request&)> resolve_entity;\n\n\t\/** generates response content for this request being processed. *\/\n\thandler generate_content;\n\n\t\/** hook for generating accesslog logs and other things to be done after the request has been served. *\/\n\tboost::signal<void(request&, response&)> request_done;\n\n\t\/** is called at the very end of a request. *\/\n\tboost::signal<void(request&, response&)> post_process;\n\n\t\/** is called before a connection gets closed \/ or has been closed by remote point. *\/\n\tboost::signal<void(connection *)> connection_close;\n\t\/\/ }}}\n\n\t\/\/ {{{ context management\n\t\/** create server context data for given plugin. *\/\n\ttemplate<typename T>\n\tT& create_context(plugin *plug)\n\t{\n\t\tcontext_.set(plug, new T);\n\t\treturn context_.get<T>(plug);\n\t}\n\n\t\/** creates a virtual-host context for given plugin. *\/\n\ttemplate<typename T>\n\tT& create_context(plugin *plug, const std::string& vhost)\n\t{\n\t\tvhosts_[vhost].set(plug, new T);\n\t\treturn vhosts_[vhost].get<T>(plug);\n\t}\n\n\t\/** retrieve the server configuration context. *\/\n\tx0::context& context()\n\t{\n\t\treturn context_;\n\t}\n\n\t\/** retrieve server context data for given plugin\n\t * \\param plug plugin data for which we want to retrieve the data for.\n\t *\/\n\ttemplate<typename T>\n\tT& context(plugin *plug)\n\t{\n\t\treturn context_.get<T>(plug);\n\t}\n\n\t\/** retrieve virtual-host context data for given plugin\n\t * \\param plug plugin data for which we want to retrieve the data for.\n\t *\/\n\ttemplate<typename T>\n\tT& context(plugin *plug, const std::string& vhostname)\n\t{\n\t\tauto vhost = vhosts_.find(vhostname);\n\n\t\tif (vhost == vhosts_.end())\n\t\t\tthrow host_not_found(vhostname);\n\n\t\tauto data = vhost->second.find(plug);\n\t\tif (data != vhost->second.end())\n\t\t\treturn *static_cast<T *>(data->second);\n\n\t\tvhost->second.set<T>(plug, new T);\n\t\treturn vhost->second.get<T>(plug);\n\t}\n\n\ttemplate<typename T>\n\tT *free_context(plugin *plug)\n\t{\n\t\t\/\/\/ \\todo free all contexts owned by given plugin\n\t\treturn context_.free<T>(plug);\n\t}\n\t\/\/ }}}\n\n\t\/** \n\t * retrieves reference to server currently loaded configuration.\n\t *\/\n\tx0::settings& config();\n\n\t\/**\n\t * writes a log entry into the server's error log.\n\t *\/\n\tvoid log(severity s, const char *msg, ...);\n\n\t\/**\n\t * sets up a TCP\/IP listener on given bind_address and port.\n\t *\n\t * If there is already a listener on this bind_address:port pair\n\t * then no error will be raised.\n\t *\/\n\tvoid setup_listener(int port, const std::string& bind_address = \"0::0\");\n\n\t\/**\n\t * loads a plugin into the server.\n\t *\n\t * \\see plugin, unload_plugin(), loaded_plugins()\n\t *\/\n\tvoid load_plugin(const std::string& name);\n\n\t\/** safely unloads a plugin. *\/\n\tvoid unload_plugin(const std::string& name);\n\n\t\/** retrieves a list of currently loaded plugins *\/\n\tstd::vector<std::string> loaded_plugins() const;\n\n\tvoid handle_request(request& in, response& out);\n\n\tboost::asio::io_service& io_service();\n\n\t\/** retrieves the current server time. *\/\n\tconst datetime& now() const;\n\nprivate:\n\tlong long getrlimit(int resource);\n\tlong long setrlimit(int resource, long long max);\n\n\tvoid drop_privileges(const std::string& user, const std::string& group);\n\n\tlistener_ptr listener_by_port(int port);\n\nprivate:\n\tx0::context context_;\t\t\t\t\t\t\t\/\/!< server context\n\tstd::map<std::string, x0::context>\tvhosts_;\t\/\/!< vhost contexts\n\tstd::list<listener_ptr> listeners_;\n\tboost::asio::io_service io_service_;\n\tbool paused_;\n\tx0::settings settings_;\n\tstd::string configfile_;\n\tlogger_ptr logger_;\n\tplugin_map_t plugins_;\n\tdatetime now_;\n\npublic:\n\tvalue_property<int> max_connections;\n\tvalue_property<int> max_keep_alive_requests;\n\tvalue_property<int> max_keep_alive_idle;\n\tvalue_property<int> max_read_idle;\n\tvalue_property<int> max_write_idle;\n\tvalue_property<std::string> tag;\n\tfileinfo_service fileinfo;\n\n\tproperty<unsigned long long> max_fds;\n};\n\n\/\/ {{{ inlines\ninline boost::asio::io_service& server::io_service()\n{\n\treturn io_service_;\n}\n\ninline const x0::datetime& server::now() const\n{\n\treturn now_;\n}\n\/\/ }}}\n\n} \/\/ namespace x0\n\n#endif\n\/\/ vim:syntax=cpp\n<commit_msg>core: vhost contexts are shared_ptr managed now.<commit_after>\/* <x0\/server.hpp>\n *\n * This file is part of the x0 web server project and is released under LGPL-3.\n *\n * (c) 2009 Chrisitan Parpart <trapni@gentoo.org>\n *\/\n\n#ifndef sw_x0_server_hpp\n#define sw_x0_server_hpp (1)\n\n#include <x0\/datetime.hpp>\n#include <x0\/settings.hpp>\n#include <x0\/logger.hpp>\n#include <x0\/listener.hpp>\n#include <x0\/handler.hpp>\n#include <x0\/context.hpp>\n#include <x0\/plugin.hpp>\n#include <x0\/types.hpp>\n#include <x0\/property.hpp>\n#include <x0\/fileinfo_service.hpp>\n#include <x0\/api.hpp>\n#include <boost\/signals.hpp>\n#include <boost\/asio\/io_service.hpp>\n#include <cstring>\n#include <string>\n#include <list>\n#include <map>\n\nnamespace x0 {\n\nclass host_not_found\n\t: public std::runtime_error\n{\npublic:\n\thost_not_found(const std::string& hostname)\n\t\t: std::runtime_error(hostname)\n\t{\n\t}\n};\n\n\/**\n * \\ingroup core\n * \\brief implements the x0 web server.\n *\n * \\see connection, request, response, plugin\n * \\see server::run(), server::stop()\n *\/\nclass server :\n\tpublic boost::noncopyable\n{\nprivate:\n\ttypedef std::pair<plugin_ptr, void *> plugin_value_t;\n\ttypedef std::map<std::string, plugin_value_t> plugin_map_t;\n\npublic:\n\tserver();\n\t~server();\n\n\t\/\/ {{{ service control\n\t\/** configures this server as defined in the configuration section(s). *\/\n\tvoid configure(const std::string& configfile);\n\t\/** starts this server object by listening on new connections and processing them. *\/\n\tvoid run();\n\t\/** pauses an already active server by not accepting further new connections until resumed. *\/\n\tvoid pause();\n\t\/** resumes a currently paused server by continueing processing new connections. *\/\n\tvoid resume();\n\t\/** reloads server configuration *\/\n\tvoid reload();\n\t\/** gracefully stops a running server *\/\n\tvoid stop();\n\t\/\/ }}}\n\n\t\/\/ {{{ signals raised on request in order\n\t\/** is invoked once a new client connection is established *\/\n\tboost::signal<void(connection_ptr)> connection_open;\n\n\t\/** is called at the very beginning of a request. *\/\n\tboost::signal<void(request&)> pre_process;\n\n\t\/** resolves document_root to use for this request. *\/\n\tboost::signal<void(request&)> resolve_document_root;\n\n\t\/** resolves request's physical filename (maps URI to physical path). *\/\n\tboost::signal<void(request&)> resolve_entity;\n\n\t\/** generates response content for this request being processed. *\/\n\thandler generate_content;\n\n\t\/** hook for generating accesslog logs and other things to be done after the request has been served. *\/\n\tboost::signal<void(request&, response&)> request_done;\n\n\t\/** is called at the very end of a request. *\/\n\tboost::signal<void(request&, response&)> post_process;\n\n\t\/** is called before a connection gets closed \/ or has been closed by remote point. *\/\n\tboost::signal<void(connection *)> connection_close;\n\t\/\/ }}}\n\n\t\/\/ {{{ context management\n\t\/** create server context data for given plugin. *\/\n\ttemplate<typename T>\n\tT& create_context(plugin *plug)\n\t{\n\t\tcontext_.set(plug, new T);\n\t\treturn context_.get<T>(plug);\n\t}\n\n\t\/** creates a virtual-host context for given plugin. *\/\n\ttemplate<typename T>\n\tT& create_context(plugin *plug, const std::string& vhost)\n\t{\n\t\tauto i = vhosts_.find(vhost);\n\t\tif (i == vhosts_.end())\n\t\t\tvhosts_[vhost] = std::shared_ptr<x0::context>(new x0::context);\n\n\t\tvhosts_[vhost]->set(plug, new T);\n\n\t\treturn vhosts_[vhost]->get<T>(plug);\n\t}\n\n\tvoid link_context(const std::string& master, const std::string& alias)\n\t{\n\t\tvhosts_[alias] = vhosts_[master];\n\t}\n\n\t\/** retrieve the server configuration context. *\/\n\tx0::context& context()\n\t{\n\t\treturn context_;\n\t}\n\n\t\/** retrieve server context data for given plugin\n\t * \\param plug plugin data for which we want to retrieve the data for.\n\t *\/\n\ttemplate<typename T>\n\tT& context(plugin *plug)\n\t{\n\t\treturn context_.get<T>(plug);\n\t}\n\n\t\/** retrieve virtual-host context data for given plugin\n\t * \\param plug plugin data for which we want to retrieve the data for.\n\t *\/\n\ttemplate<typename T>\n\tT& context(plugin *plug, const std::string& vhostname)\n\t{\n\t\tauto vhost = vhosts_.find(vhostname);\n\n\t\tif (vhost == vhosts_.end())\n\t\t\tthrow host_not_found(vhostname);\n\n\t\tauto ctx = *vhost->second;\n\t\tauto data = ctx.find(plug);\n\t\tif (data != ctx.end())\n\t\t\treturn *static_cast<T *>(data->second);\n\n\t\tctx.set<T>(plug, new T);\n\t\treturn ctx.get<T>(plug);\n\t}\n\n\ttemplate<typename T>\n\tT *free_context(plugin *plug)\n\t{\n\t\t\/\/\/ \\todo free all contexts owned by given plugin\n\t\treturn context_.free<T>(plug);\n\t}\n\t\/\/ }}}\n\n\t\/** \n\t * retrieves reference to server currently loaded configuration.\n\t *\/\n\tx0::settings& config();\n\n\t\/**\n\t * writes a log entry into the server's error log.\n\t *\/\n\tvoid log(severity s, const char *msg, ...);\n\n\t\/**\n\t * sets up a TCP\/IP listener on given bind_address and port.\n\t *\n\t * If there is already a listener on this bind_address:port pair\n\t * then no error will be raised.\n\t *\/\n\tvoid setup_listener(int port, const std::string& bind_address = \"0::0\");\n\n\t\/**\n\t * loads a plugin into the server.\n\t *\n\t * \\see plugin, unload_plugin(), loaded_plugins()\n\t *\/\n\tvoid load_plugin(const std::string& name);\n\n\t\/** safely unloads a plugin. *\/\n\tvoid unload_plugin(const std::string& name);\n\n\t\/** retrieves a list of currently loaded plugins *\/\n\tstd::vector<std::string> loaded_plugins() const;\n\n\tvoid handle_request(request& in, response& out);\n\n\tboost::asio::io_service& io_service();\n\n\t\/** retrieves the current server time. *\/\n\tconst datetime& now() const;\n\nprivate:\n\tlong long getrlimit(int resource);\n\tlong long setrlimit(int resource, long long max);\n\n\tvoid drop_privileges(const std::string& user, const std::string& group);\n\n\tlistener_ptr listener_by_port(int port);\n\nprivate:\n\tx0::context context_;\t\t\t\t\t\t\t\t\t\t\t\/\/!< server context\n\tstd::map<std::string, std::shared_ptr<x0::context>> vhosts_;\t\/\/!< vhost contexts\n\tstd::list<listener_ptr> listeners_;\n\tboost::asio::io_service io_service_;\n\tbool paused_;\n\tx0::settings settings_;\n\tstd::string configfile_;\n\tlogger_ptr logger_;\n\tplugin_map_t plugins_;\n\tdatetime now_;\n\npublic:\n\tvalue_property<int> max_connections;\n\tvalue_property<int> max_keep_alive_requests;\n\tvalue_property<int> max_keep_alive_idle;\n\tvalue_property<int> max_read_idle;\n\tvalue_property<int> max_write_idle;\n\tvalue_property<std::string> tag;\n\tfileinfo_service fileinfo;\n\n\tproperty<unsigned long long> max_fds;\n};\n\n\/\/ {{{ inlines\ninline boost::asio::io_service& server::io_service()\n{\n\treturn io_service_;\n}\n\ninline const x0::datetime& server::now() const\n{\n\treturn now_;\n}\n\/\/ }}}\n\n} \/\/ namespace x0\n\n#endif\n\/\/ vim:syntax=cpp\n<|endoftext|>"} {"text":"<commit_before>\/**\n * @file\n *\/\n#include \"libbirch\/Label.hpp\"\n\nlibbirch::Label::Label() : Any(0) {\n \/\/\n}\n\nlibbirch::Label::Label(const Label& o) :\n Any(o) {\n auto& o1 = const_cast<Label&>(o);\n o1.lock.write();\n o1.memo.rehash();\n o1.lock.downgrade();\n memo.copy(o1.memo);\n o1.lock.unread();\n}\n\nlibbirch::Any* libbirch::Label::mapGet(Any* o) {\n Any* prev = nullptr;\n Any* next = o;\n bool frozen = o->isFrozen();\n while (frozen && next) {\n prev = next;\n next = memo.get(prev);\n if (next) {\n frozen = next->isFrozen();\n }\n }\n if (!next) {\n\t next = prev;\n\t}\n if (frozen) {\n assert(!next->isDestroyed());\n Any* cloned;\n if (false && next->isUnique()) {\n \/* final-reference optimization: the pointer being updated is the final\n * remaining pointer to the object, rather than copying the object and\n * then destroying it, recycle the object to be the copy *\/\n cloned = next->recycle(this);\n } else {\n \/* copy the object *\/\n cloned = next->copy(this);\n\n \/* single-reference optimization: at the time of freezing, if there was\n * only one reference to the object, it need not be memoized, as there\n * are no other pointers to update to the copy *\/\n if (true || !next->isFrozenUnique()) {\n memo.put(next, cloned);\n thaw();\n }\n }\n next = cloned;\n }\n return next;\n}\n\nlibbirch::Any* libbirch::Label::mapPull(Any* o) {\n Any* prev = nullptr;\n Any* next = o;\n bool frozen = o->isFrozen();\n while (frozen && next) {\n prev = next;\n next = memo.get(prev);\n if (next) {\n frozen = next->isFrozen();\n }\n }\n if (!next) {\n\t next = prev;\n\t}\n return next;\n}\n<commit_msg>Restored final-reference and single-reference optimizations (previously removed for debugging).<commit_after>\/**\n * @file\n *\/\n#include \"libbirch\/Label.hpp\"\n\nlibbirch::Label::Label() : Any(0) {\n \/\/\n}\n\nlibbirch::Label::Label(const Label& o) :\n Any(o) {\n auto& o1 = const_cast<Label&>(o);\n o1.lock.write();\n o1.memo.rehash();\n o1.lock.downgrade();\n memo.copy(o1.memo);\n o1.lock.unread();\n}\n\nlibbirch::Any* libbirch::Label::mapGet(Any* o) {\n Any* prev = nullptr;\n Any* next = o;\n bool frozen = o->isFrozen();\n while (frozen && next) {\n prev = next;\n next = memo.get(prev);\n if (next) {\n frozen = next->isFrozen();\n }\n }\n if (!next) {\n\t next = prev;\n\t}\n if (frozen) {\n assert(!next->isDestroyed());\n Any* cloned;\n if (next->isUnique()) {\n \/* final-reference optimization: the pointer being updated is the final\n * remaining pointer to the object, rather than copying the object and\n * then destroying it, recycle the object to be the copy *\/\n cloned = next->recycle(this);\n } else {\n \/* copy the object *\/\n cloned = next->copy(this);\n\n \/* single-reference optimization: at the time of freezing, if there was\n * only one reference to the object, it need not be memoized, as there\n * are no other pointers to update to the copy *\/\n if (!next->isFrozenUnique()) {\n memo.put(next, cloned);\n thaw();\n }\n }\n next = cloned;\n }\n return next;\n}\n\nlibbirch::Any* libbirch::Label::mapPull(Any* o) {\n Any* prev = nullptr;\n Any* next = o;\n bool frozen = o->isFrozen();\n while (frozen && next) {\n prev = next;\n next = memo.get(prev);\n if (next) {\n frozen = next->isFrozen();\n }\n }\n if (!next) {\n\t next = prev;\n\t}\n return next;\n}\n<|endoftext|>"} {"text":"<commit_before>#include \"ymlparser.h\"\n#include <QDebug>\n\nYMLParser::YMLParser()\n{\n}\n\n\nvoid YMLParser::writeItem(cv::FileStorage &fs, ObjectRect* obj)\n{\n \/\/ Write class name\n switch(obj->getType())\n {\n case ObjectType::Face:\n fs << \"className\" << \"Face\";\n break;\n case ObjectType::NumberPlate:\n fs << \"className\" << \"NumberPlate\";\n break;\n case ObjectType::ToBlur:\n fs << \"className\" << \"ToBlur\";\n break;\n case ObjectType::None:\n fs << \"className\" << \"None\";\n break;\n }\n\n \/\/ Write class name\n switch(obj->getSubType())\n {\n case ObjectSubType::None:\n fs << \"subClassName\" << \"None\";\n break;\n case ObjectSubType::Front:\n fs << \"subClassName\" << \"Front\";\n break;\n case ObjectSubType::Profile:\n fs << \"subClassName\" << \"Profile\";\n break;\n }\n\n \/\/ Write square area coodinates\n fs << \"area\" << \"{\";\n fs << \"p1\" << cv::Point2d(obj->proj_point_1().x(), obj->proj_point_1().y());\n fs << \"p2\" << cv::Point2d(obj->proj_point_2().x(), obj->proj_point_2().y());\n fs << \"p3\" << cv::Point2d(obj->proj_point_3().x(), obj->proj_point_3().y());\n fs << \"p4\" << cv::Point2d(obj->proj_point_4().x(), obj->proj_point_4().y());\n fs << \"}\";\n\n \/\/ Write params\n fs << \"params\" << \"{\";\n fs << \"azimuth\" << obj->proj_azimuth();\n fs << \"elevation\" << obj->proj_elevation();\n fs << \"aperture\" << obj->proj_aperture();\n fs << \"width\" << obj->proj_width();\n fs << \"height\" << obj->proj_height();\n fs << \"}\";\n\n \/\/ Write status tags\n fs << \"autoStatus\" << obj->getAutomaticStatus().toStdString();\n fs << \"manualStatus\" << obj->getManualStatus().toStdString();\n}\n\nObjectRect* YMLParser::readItem(cv::FileNodeIterator iterator, int ymltype)\n{\n \/\/ Initialize detected object\n ObjectRect* object = new ObjectRect;\n\n \/\/ Parse falsePositive tag\n std::string falsePositive;\n (*iterator)[\"falsePositive\"] >> falsePositive;\n QString lowerFalsePositive = QString( falsePositive.c_str() ).toLower();\n\n \/\/ Parse class name\n std::string className;\n (*iterator)[\"className\"] >> className;\n\n \/\/ Parse sub class name\n std::string subClassName;\n (*iterator)[\"subClassName\"] >> subClassName;\n\n QString lowerClassName = QString( className.c_str() ).toLower();\n QString lowerSubClassName = QString( subClassName.c_str() ).toLower();\n\n if(lowerClassName == \"face\")\n {\n object->setType( ObjectType::Face );\n } else if (lowerClassName == \"front\" || lowerClassName == \"front:profile\"){\n object->setType( ObjectType::Face );\n object->setSubType( ObjectSubType::Front );\n } else if (lowerClassName == \"profile\"){\n object->setType( ObjectType::Face );\n object->setSubType( ObjectSubType::Profile );\n } else if(lowerClassName == \"numberplate\") {\n object->setType( ObjectType::NumberPlate );\n } else if(lowerClassName == \"toblur\") {\n object->setType( ObjectType::ToBlur );\n } else if(lowerClassName == \"none\") {\n object->setType( ObjectType::None );\n }\n\n if(lowerSubClassName == \"none\")\n {\n object->setSubType( ObjectSubType::None );\n } else if(lowerSubClassName == \"front\") {\n object->setSubType( ObjectSubType::Front );\n } else if(lowerSubClassName == \"profile\") {\n object->setSubType( ObjectSubType::Profile );\n }\n\n \/\/ Parse area points\n cv::FileNode areaNode = (*iterator)[\"area\"];\n cv::Point2d pt_1;\n cv::Point2d pt_2;\n cv::Point2d pt_3;\n cv::Point2d pt_4;\n\n switch(ymltype)\n {\n case YMLType::Detector:\n areaNode[\"p1\"] >> pt_1;\n areaNode[\"p2\"] >> pt_3;\n break;\n case YMLType::Validator:\n areaNode[\"p1\"] >> pt_1;\n areaNode[\"p2\"] >> pt_2;\n areaNode[\"p3\"] >> pt_3;\n areaNode[\"p4\"] >> pt_4;\n break;\n }\n\n object->setPoints(QPointF(pt_1.x, pt_1.y),\n QPointF(pt_2.x, pt_2.y),\n QPointF(pt_3.x, pt_3.y),\n QPointF(pt_4.x, pt_4.y));\n\n \/\/ Parse gnomonic params\n cv::FileNode paramsNode = (*iterator)[\"params\"];\n float azimuth = 0.0;\n float elevation = 0.0;\n float aperture = 0.0;\n float width = 0.0;\n float height = 0.0;\n\n paramsNode[\"azimuth\"] >> azimuth;\n paramsNode[\"elevation\"] >> elevation;\n paramsNode[\"aperture\"] >> aperture;\n paramsNode[\"width\"] >> width;\n paramsNode[\"height\"] >> height;\n\n object->setProjectionParametters(azimuth,\n elevation,\n aperture,\n width,\n height);\n\n object->setProjectionParametters(azimuth, elevation, aperture, width, height);\n object->setProjectionPoints();\n\n \/\/ Parse auto status\n std::string autoStatus;\n (*iterator)[\"autoStatus\"] >> autoStatus;\n\n QString lowerAutoStatus = QString( autoStatus.c_str() ).toLower();\n lowerAutoStatus = lowerAutoStatus.length() > 0 ? lowerAutoStatus : \"none\";\n\n if(lowerAutoStatus != \"none\")\n {\n if(lowerAutoStatus == \"valid\")\n {\n object->setObjectRectType( ObjectRectType::Valid );\n object->setAutomaticStatus( \"Valid\" );\n } else {\n object->setObjectRectType( ObjectRectType::Invalid );\n\n switch(ymltype)\n {\n case YMLType::Detector:\n if( lowerAutoStatus == \"filtered-ratio\" )\n {\n object->setAutomaticStatus( \"Ratio\" );\n } else if( lowerAutoStatus == \"filtered-size\" ){\n object->setAutomaticStatus( \"Size\" );\n } else if( lowerAutoStatus == \"filtered-ratio-size\" ){\n object->setAutomaticStatus( \"Ratio-Size\" );\n }\n break;\n case YMLType::Validator:\n if( lowerAutoStatus == \"ratio\" )\n {\n object->setAutomaticStatus( \"Ratio\" );\n } else if( lowerAutoStatus == \"size\" ){\n object->setAutomaticStatus( \"Size\" );\n } else if( lowerAutoStatus == \"ratio-size\" ){\n object->setAutomaticStatus( \"Ratio-Size\" );\n } else if( lowerAutoStatus == \"missingoption\" ){\n object->setAutomaticStatus( \"MissingOption\" );\n }\n break;\n }\n }\n } else {\n object->setObjectRectType( ObjectRectType::Manual );\n }\n\n object->setAutomaticStatus( (object->getAutomaticStatus().length() > 0 ? object->getAutomaticStatus() : \"None\") );\n\n \/\/ Parse manual status\n std::string manualStatus;\n (*iterator)[\"manualStatus\"] >> manualStatus;\n object->setManualStatus( QString(manualStatus.c_str()) );\n object->setManualStatus( (object->getManualStatus().length() > 0 ? object->getManualStatus() : \"None\") );\n\n if(lowerFalsePositive == \"no\")\n {\n if(lowerAutoStatus == \"none\")\n {\n object->setManualStatus(\"Valid\");\n }\n } else if( lowerFalsePositive == \"yes\" )\n {\n object->setManualStatus(\"Invalid\");\n }\n\n if(object->getType() == ObjectType::ToBlur)\n {\n object->setObjectRectState( ObjectRectState::ToBlur );\n } else {\n\n if(object->getManualStatus() != \"None\")\n {\n if(object->getManualStatus() == \"Valid\")\n {\n object->setObjectRectState( ObjectRectState::Valid );\n } else {\n object->setObjectRectState( ObjectRectState::Invalid );\n }\n } else {\n object->setObjectRectState( ObjectRectState::None );\n }\n\n }\n\n cv::FileNode childNode = (*iterator)[\"childrens\"];\n for (cv::FileNodeIterator child = childNode.begin(); child != childNode.end(); ++child) {\n object->childrens.append( this->readItem( child ) );\n }\n\n object->setResizeEnabled( false );\n\n \/\/ Return object\n return object;\n}\n\nvoid YMLParser::writeYML(QList<ObjectRect*> objects, QString path)\n{\n \/\/ Open storage for writing\n cv::FileStorage fs(path.toStdString(), cv::FileStorage::WRITE);\n\n \/\/ Write source file path\n fs << \"source_image\" << objects.first()->getSourceImagePath().toStdString();\n\n \/\/ Write objects\n fs << \"objects\" << \"[\";\n\n \/\/ Iterate over objects\n foreach (ObjectRect* obj, objects) {\n\n \/\/ Open array element\n fs << \"{\";\n\n \/\/ Object writer method\n this->writeItem(fs, obj);\n\n \/\/ Write childrens if present\n if(obj->childrens.length() > 0)\n {\n fs << \"childrens\" << \"[\";\n foreach (ObjectRect* child, obj->childrens) {\n fs << \"{\";\n this->writeItem(fs, child);\n fs << \"}\";\n }\n fs << \"]\";\n }\n\n \/\/ Close array element\n fs << \"}\";\n }\n\n \/\/ Close array\n fs << \"]\";\n}\n\nQList<ObjectRect*> YMLParser::loadYML(QString path, int ymltype)\n{\n \/\/ Init output list\n QList<ObjectRect*> out_list;\n\n \/\/ Read YML file\n cv::FileStorage fs(path.toStdString(), cv::FileStorage::READ);\n\n \/\/ Retrieve objects node\n cv::FileNode objectsNode = fs[\"objects\"];\n\n \/\/ Retrieve invalid objects node\n cv::FileNode invalidObjectsNode = fs[\"invalidObjects\"];\n\n \/\/ Iterate over objects\n for (cv::FileNodeIterator it = objectsNode.begin(); it != objectsNode.end(); ++it) {\n\n \/\/ Initialize detected object\n ObjectRect* object = this->readItem(it, ymltype);\n\n std::string source_image;\n fs[\"source_image\"] >> source_image;\n\n object->setSourceImagePath( QString(source_image.c_str()) );\n\n \/\/ Append to list\n out_list.append(object);\n }\n\n \/\/ Iterate over objects\n for (cv::FileNodeIterator it = invalidObjectsNode.begin(); it != invalidObjectsNode.end(); ++it) {\n\n \/\/ Initialize detected object\n ObjectRect* object = this->readItem(it, ymltype);\n\n object->setObjectRectType( ObjectRectType::Invalid );\n object->setAutomaticStatus( (object->getAutomaticStatus().length() <= 0 || object->getAutomaticStatus() == \"None\") ? \"MissingOption\" : object->getAutomaticStatus() );\n\n std::string source_image;\n fs[\"source_image\"] >> source_image;\n\n object->setSourceImagePath( QString(source_image.c_str()) );\n\n \/\/ Append to list\n out_list.append(object);\n }\n\n \/\/ Return results\n return out_list;\n}\n\n<commit_msg>Added blurObject tag save\/load<commit_after>#include \"ymlparser.h\"\n#include <QDebug>\n\nYMLParser::YMLParser()\n{\n}\n\n\nvoid YMLParser::writeItem(cv::FileStorage &fs, ObjectRect* obj)\n{\n \/\/ Write class name\n switch(obj->getType())\n {\n case ObjectType::Face:\n fs << \"className\" << \"Face\";\n break;\n case ObjectType::NumberPlate:\n fs << \"className\" << \"NumberPlate\";\n break;\n case ObjectType::ToBlur:\n fs << \"className\" << \"ToBlur\";\n break;\n case ObjectType::None:\n fs << \"className\" << \"None\";\n break;\n }\n\n \/\/ Write class name\n switch(obj->getSubType())\n {\n case ObjectSubType::None:\n fs << \"subClassName\" << \"None\";\n break;\n case ObjectSubType::Front:\n fs << \"subClassName\" << \"Front\";\n break;\n case ObjectSubType::Profile:\n fs << \"subClassName\" << \"Profile\";\n break;\n }\n\n \/\/ Write square area coodinates\n fs << \"area\" << \"{\";\n fs << \"p1\" << cv::Point2d(obj->proj_point_1().x(), obj->proj_point_1().y());\n fs << \"p2\" << cv::Point2d(obj->proj_point_2().x(), obj->proj_point_2().y());\n fs << \"p3\" << cv::Point2d(obj->proj_point_3().x(), obj->proj_point_3().y());\n fs << \"p4\" << cv::Point2d(obj->proj_point_4().x(), obj->proj_point_4().y());\n fs << \"}\";\n\n \/\/ Write params\n fs << \"params\" << \"{\";\n fs << \"azimuth\" << obj->proj_azimuth();\n fs << \"elevation\" << obj->proj_elevation();\n fs << \"aperture\" << obj->proj_aperture();\n fs << \"width\" << obj->proj_width();\n fs << \"height\" << obj->proj_height();\n fs << \"}\";\n\n \/\/ Write status tags\n fs << \"autoStatus\" << obj->getAutomaticStatus().toStdString();\n fs << \"manualStatus\" << obj->getManualStatus().toStdString();\n fs << \"blurObject\" << (obj->isBlurred() ? \"Yes\" : \"No\");\n}\n\nObjectRect* YMLParser::readItem(cv::FileNodeIterator iterator, int ymltype)\n{\n \/\/ Initialize detected object\n ObjectRect* object = new ObjectRect;\n\n \/\/ Parse falsePositive tag\n std::string falsePositive;\n (*iterator)[\"falsePositive\"] >> falsePositive;\n QString lowerFalsePositive = QString( falsePositive.c_str() ).toLower();\n\n \/\/ Parse class name\n std::string className;\n (*iterator)[\"className\"] >> className;\n\n \/\/ Parse sub class name\n std::string subClassName;\n (*iterator)[\"subClassName\"] >> subClassName;\n\n QString lowerClassName = QString( className.c_str() ).toLower();\n QString lowerSubClassName = QString( subClassName.c_str() ).toLower();\n\n if(lowerClassName == \"face\")\n {\n object->setType( ObjectType::Face );\n } else if (lowerClassName == \"front\" || lowerClassName == \"front:profile\"){\n object->setType( ObjectType::Face );\n object->setSubType( ObjectSubType::Front );\n } else if (lowerClassName == \"profile\"){\n object->setType( ObjectType::Face );\n object->setSubType( ObjectSubType::Profile );\n } else if(lowerClassName == \"numberplate\") {\n object->setType( ObjectType::NumberPlate );\n } else if(lowerClassName == \"toblur\") {\n object->setType( ObjectType::ToBlur );\n } else if(lowerClassName == \"none\") {\n object->setType( ObjectType::None );\n }\n\n if(lowerSubClassName == \"none\")\n {\n object->setSubType( ObjectSubType::None );\n } else if(lowerSubClassName == \"front\") {\n object->setSubType( ObjectSubType::Front );\n } else if(lowerSubClassName == \"profile\") {\n object->setSubType( ObjectSubType::Profile );\n }\n\n \/\/ Parse area points\n cv::FileNode areaNode = (*iterator)[\"area\"];\n cv::Point2d pt_1;\n cv::Point2d pt_2;\n cv::Point2d pt_3;\n cv::Point2d pt_4;\n\n switch(ymltype)\n {\n case YMLType::Detector:\n areaNode[\"p1\"] >> pt_1;\n areaNode[\"p2\"] >> pt_3;\n break;\n case YMLType::Validator:\n areaNode[\"p1\"] >> pt_1;\n areaNode[\"p2\"] >> pt_2;\n areaNode[\"p3\"] >> pt_3;\n areaNode[\"p4\"] >> pt_4;\n break;\n }\n\n object->setPoints(QPointF(pt_1.x, pt_1.y),\n QPointF(pt_2.x, pt_2.y),\n QPointF(pt_3.x, pt_3.y),\n QPointF(pt_4.x, pt_4.y));\n\n \/\/ Parse gnomonic params\n cv::FileNode paramsNode = (*iterator)[\"params\"];\n float azimuth = 0.0;\n float elevation = 0.0;\n float aperture = 0.0;\n float width = 0.0;\n float height = 0.0;\n\n paramsNode[\"azimuth\"] >> azimuth;\n paramsNode[\"elevation\"] >> elevation;\n paramsNode[\"aperture\"] >> aperture;\n paramsNode[\"width\"] >> width;\n paramsNode[\"height\"] >> height;\n\n object->setProjectionParametters(azimuth,\n elevation,\n aperture,\n width,\n height);\n\n object->setProjectionParametters(azimuth, elevation, aperture, width, height);\n object->setProjectionPoints();\n\n \/\/ Parse auto status\n std::string autoStatus;\n (*iterator)[\"autoStatus\"] >> autoStatus;\n\n QString lowerAutoStatus = QString( autoStatus.c_str() ).toLower();\n lowerAutoStatus = lowerAutoStatus.length() > 0 ? lowerAutoStatus : \"none\";\n\n if(lowerAutoStatus != \"none\")\n {\n if(lowerAutoStatus == \"valid\")\n {\n object->setObjectRectType( ObjectRectType::Valid );\n object->setAutomaticStatus( \"Valid\" );\n } else {\n object->setObjectRectType( ObjectRectType::Invalid );\n\n switch(ymltype)\n {\n case YMLType::Detector:\n if( lowerAutoStatus == \"filtered-ratio\" )\n {\n object->setAutomaticStatus( \"Ratio\" );\n } else if( lowerAutoStatus == \"filtered-size\" ){\n object->setAutomaticStatus( \"Size\" );\n } else if( lowerAutoStatus == \"filtered-ratio-size\" ){\n object->setAutomaticStatus( \"Ratio-Size\" );\n }\n break;\n case YMLType::Validator:\n if( lowerAutoStatus == \"ratio\" )\n {\n object->setAutomaticStatus( \"Ratio\" );\n } else if( lowerAutoStatus == \"size\" ){\n object->setAutomaticStatus( \"Size\" );\n } else if( lowerAutoStatus == \"ratio-size\" ){\n object->setAutomaticStatus( \"Ratio-Size\" );\n } else if( lowerAutoStatus == \"missingoption\" ){\n object->setAutomaticStatus( \"MissingOption\" );\n }\n break;\n }\n }\n } else {\n object->setObjectRectType( ObjectRectType::Manual );\n }\n\n object->setAutomaticStatus( (object->getAutomaticStatus().length() > 0 ? object->getAutomaticStatus() : \"None\") );\n\n \/\/ Parse manual status\n std::string manualStatus;\n (*iterator)[\"manualStatus\"] >> manualStatus;\n object->setManualStatus( QString(manualStatus.c_str()) );\n object->setManualStatus( (object->getManualStatus().length() > 0 ? object->getManualStatus() : \"None\") );\n\n if(lowerFalsePositive == \"no\")\n {\n if(lowerAutoStatus == \"none\")\n {\n object->setManualStatus(\"Valid\");\n }\n } else if( lowerFalsePositive == \"yes\" )\n {\n object->setManualStatus(\"Invalid\");\n }\n\n if(object->getType() == ObjectType::ToBlur)\n {\n object->setObjectRectState( ObjectRectState::ToBlur );\n } else {\n\n if(object->getManualStatus() != \"None\")\n {\n if(object->getManualStatus() == \"Valid\")\n {\n object->setObjectRectState( ObjectRectState::Valid );\n } else {\n object->setObjectRectState( ObjectRectState::Invalid );\n }\n } else {\n object->setObjectRectState( ObjectRectState::None );\n }\n\n }\n\n std::string blurObject;\n (*iterator)[\"blurObject\"] >> blurObject;\n\n QString blurObject_lower = QString( blurObject.c_str() ).toLower();\n\n object->setBlurred( blurObject_lower == \"yes\" ? true : false );\n\n cv::FileNode childNode = (*iterator)[\"childrens\"];\n for (cv::FileNodeIterator child = childNode.begin(); child != childNode.end(); ++child) {\n object->childrens.append( this->readItem( child ) );\n }\n\n object->setResizeEnabled( false );\n\n \/\/ Return object\n return object;\n}\n\nvoid YMLParser::writeYML(QList<ObjectRect*> objects, QString path)\n{\n \/\/ Open storage for writing\n cv::FileStorage fs(path.toStdString(), cv::FileStorage::WRITE);\n\n \/\/ Write source file path\n fs << \"source_image\" << objects.first()->getSourceImagePath().toStdString();\n\n \/\/ Write objects\n fs << \"objects\" << \"[\";\n\n \/\/ Iterate over objects\n foreach (ObjectRect* obj, objects) {\n\n \/\/ Open array element\n fs << \"{\";\n\n \/\/ Object writer method\n this->writeItem(fs, obj);\n\n \/\/ Write childrens if present\n if(obj->childrens.length() > 0)\n {\n fs << \"childrens\" << \"[\";\n foreach (ObjectRect* child, obj->childrens) {\n fs << \"{\";\n this->writeItem(fs, child);\n fs << \"}\";\n }\n fs << \"]\";\n }\n\n \/\/ Close array element\n fs << \"}\";\n }\n\n \/\/ Close array\n fs << \"]\";\n}\n\nQList<ObjectRect*> YMLParser::loadYML(QString path, int ymltype)\n{\n \/\/ Init output list\n QList<ObjectRect*> out_list;\n\n \/\/ Read YML file\n cv::FileStorage fs(path.toStdString(), cv::FileStorage::READ);\n\n \/\/ Retrieve objects node\n cv::FileNode objectsNode = fs[\"objects\"];\n\n \/\/ Retrieve invalid objects node\n cv::FileNode invalidObjectsNode = fs[\"invalidObjects\"];\n\n \/\/ Iterate over objects\n for (cv::FileNodeIterator it = objectsNode.begin(); it != objectsNode.end(); ++it) {\n\n \/\/ Initialize detected object\n ObjectRect* object = this->readItem(it, ymltype);\n\n std::string source_image;\n fs[\"source_image\"] >> source_image;\n\n object->setSourceImagePath( QString(source_image.c_str()) );\n\n \/\/ Append to list\n out_list.append(object);\n }\n\n \/\/ Iterate over objects\n for (cv::FileNodeIterator it = invalidObjectsNode.begin(); it != invalidObjectsNode.end(); ++it) {\n\n \/\/ Initialize detected object\n ObjectRect* object = this->readItem(it, ymltype);\n\n object->setObjectRectType( ObjectRectType::Invalid );\n object->setAutomaticStatus( (object->getAutomaticStatus().length() <= 0 || object->getAutomaticStatus() == \"None\") ? \"MissingOption\" : object->getAutomaticStatus() );\n\n std::string source_image;\n fs[\"source_image\"] >> source_image;\n\n object->setSourceImagePath( QString(source_image.c_str()) );\n\n \/\/ Append to list\n out_list.append(object);\n }\n\n \/\/ Return results\n return out_list;\n}\n\n<|endoftext|>"} {"text":"<commit_before>#include <rai\/cli\/daemon.hpp>\n\n#include <rai\/working.hpp>\n#include <boost\/property_tree\/json_parser.hpp>\n#include <iostream>\n#include <fstream>\n#include <thread>\n\nrai_daemon::daemon_config::daemon_config () :\nrpc_enable (false)\n{\n}\n\nvoid rai_daemon::daemon_config::serialize (std::ostream & output_a)\n{\n boost::property_tree::ptree tree;\n\ttree.put (\"rpc_enable\", rpc_enable);\n\tboost::property_tree::ptree rpc_l;\n\trpc.serialize_json (rpc_l);\n\ttree.add_child (\"rpc\", rpc_l);\n\tboost::property_tree::ptree node_l;\n\tnode.serialize_json (node_l);\n\ttree.add_child (\"node\", node_l);\n boost::property_tree::write_json (output_a, tree);\n}\n\nrai_daemon::daemon_config::daemon_config (bool & error_a, std::istream & input_a)\n{\n error_a = false;\n boost::property_tree::ptree tree;\n\ttry\n\t{\n\t\trpc_enable = tree.get <bool> (\"rpc_enable\");\n\t\tboost::property_tree::read_json (input_a, tree);\n\t\tauto node_l (tree.get_child (\"node\"));\n\t\terror_a = error_a || node.deserialize_json (node_l);\n\t\tauto rpc_l (tree.get_child (\"rpc\"));\n\t\terror_a = error_a || node.deserialize_json (rpc_l);\n\t}\n\tcatch (std::runtime_error const &)\n\t{\n\t\terror_a = true;\n\t}\n}\n\nvoid rai_daemon::daemon::run ()\n{\n auto working (rai::working_path ());\n\tboost::filesystem::create_directories (working);\n auto config_error (false);\n rai_daemon::daemon_config config;\n auto config_path ((working \/ \"config.json\").string ());\n std::ifstream config_file;\n config_file.open (config_path);\n if (!config_file.fail ())\n {\n config = rai_daemon::daemon_config (config_error, config_file);\n }\n else\n {\n std::ofstream config_file;\n config_file.open (config_path);\n if (!config_file.fail ())\n {\n config.serialize (config_file);\n }\n }\n if (!config_error)\n {\n auto service (boost::make_shared <boost::asio::io_service> ());\n auto pool (boost::make_shared <boost::network::utils::thread_pool> ());\n rai::processor_service processor;\n rai::node_init init;\n auto node (std::make_shared <rai::node> (init, service, working, processor, config.node));\n if (!init.error ())\n {\n node->start ();\n rai::rpc rpc (service, pool, *node, config.rpc);\n if (config.rpc_enable)\n {\n rpc.start ();\n }\n std::thread network_thread ([&service] ()\n {\n try\n {\n service->run ();\n }\n catch (...)\n {\n assert (false);\n }\n });\n std::thread processor_thread ([&processor] ()\n {\n try\n {\n processor.run ();\n }\n catch (...)\n {\n assert (false);\n }\n });\n network_thread.join ();\n processor_thread.join ();\n }\n else\n {\n std::cerr << \"Error initializing node\\n\";\n }\n }\n else\n {\n std::cerr << \"Error loading configuration\\n\";\n }\n}\n<commit_msg>Deserializing config correctly.<commit_after>#include <rai\/cli\/daemon.hpp>\n\n#include <rai\/working.hpp>\n#include <boost\/property_tree\/json_parser.hpp>\n#include <iostream>\n#include <fstream>\n#include <thread>\n\nrai_daemon::daemon_config::daemon_config () :\nrpc_enable (false)\n{\n}\n\nvoid rai_daemon::daemon_config::serialize (std::ostream & output_a)\n{\n boost::property_tree::ptree tree;\n\ttree.put (\"rpc_enable\", rpc_enable);\n\tboost::property_tree::ptree rpc_l;\n\trpc.serialize_json (rpc_l);\n\ttree.add_child (\"rpc\", rpc_l);\n\tboost::property_tree::ptree node_l;\n\tnode.serialize_json (node_l);\n\ttree.add_child (\"node\", node_l);\n boost::property_tree::write_json (output_a, tree);\n}\n\nrai_daemon::daemon_config::daemon_config (bool & error_a, std::istream & input_a)\n{\n error_a = false;\n boost::property_tree::ptree tree;\n\ttry\n\t{\n boost::property_tree::read_json (input_a, tree);\n\t\trpc_enable = tree.get <bool> (\"rpc_enable\");\n\t\tauto node_l (tree.get_child (\"node\"));\n\t\terror_a = error_a || node.deserialize_json (node_l);\n\t\tauto rpc_l (tree.get_child (\"rpc\"));\n\t\terror_a = error_a || rpc.deserialize_json (rpc_l);\n\t}\n\tcatch (std::runtime_error const &)\n\t{\n\t\terror_a = true;\n\t}\n}\n\nvoid rai_daemon::daemon::run ()\n{\n auto working (rai::working_path ());\n\tboost::filesystem::create_directories (working);\n auto config_error (false);\n rai_daemon::daemon_config config;\n auto config_path ((working \/ \"config.json\").string ());\n std::ifstream config_file;\n config_file.open (config_path);\n if (!config_file.fail ())\n {\n config = rai_daemon::daemon_config (config_error, config_file);\n }\n else\n {\n std::ofstream config_file;\n config_file.open (config_path);\n if (!config_file.fail ())\n {\n config.serialize (config_file);\n }\n }\n if (!config_error)\n {\n auto service (boost::make_shared <boost::asio::io_service> ());\n auto pool (boost::make_shared <boost::network::utils::thread_pool> ());\n rai::processor_service processor;\n rai::node_init init;\n auto node (std::make_shared <rai::node> (init, service, working, processor, config.node));\n if (!init.error ())\n {\n node->start ();\n rai::rpc rpc (service, pool, *node, config.rpc);\n if (config.rpc_enable)\n {\n rpc.start ();\n }\n std::thread network_thread ([&service] ()\n {\n try\n {\n service->run ();\n }\n catch (...)\n {\n assert (false);\n }\n });\n std::thread processor_thread ([&processor] ()\n {\n try\n {\n processor.run ();\n }\n catch (...)\n {\n assert (false);\n }\n });\n network_thread.join ();\n processor_thread.join ();\n }\n else\n {\n std::cerr << \"Error initializing node\\n\";\n }\n }\n else\n {\n std::cerr << \"Error loading configuration\\n\";\n }\n}\n<|endoftext|>"} {"text":"<commit_before>\/\/ Random access pseudorandom permutations\n\n#include <other\/core\/random\/permute.h>\n#include <other\/core\/random\/counter.h>\n#include <other\/core\/math\/integer_log.h>\n#include <other\/core\/python\/module.h>\nnamespace other {\n\n\/\/ For details, see\n\/\/ John Black and Phillip Rogaway, Ciphers with Arbitrary Finite Domains.\n\/\/ Mihir Bellare, Thomas Ristenpart, Phillip Rogaway, and Till Stegers, Format-Preserving Encryption.\n\/\/ http:\/\/blog.notdot.net\/2007\/9\/Damn-Cool-Algorithms-Part-2-Secure-permutations-with-block-ciphers\n\/\/ Specifically, we use the FE2 construction with a = 2^k, b = 2^k or 2^(k+1), three rounds, and threefry\n\/\/ as the round function. Then we use cycle walking to turn this into a permutation on [0,n-1].\n\n\/\/ An earlier version used TEA, but the quality of this was questionable and it didn't work for small n.\n\nstatic inline uint64_t fe2_encrypt(const int bits, const uint128_t key, const uint64_t x) {\n assert(bits==64 || x<(uint64_t(1)<<bits));\n \/\/ Prepare for FE2\n const int a = bits>>1, b = bits-a; \/\/ logs of a,b in the paper\n const uint32_t ma = (uint64_t(1)<<a)-1, \/\/ bit masks\n mb = (uint64_t(1)<<b)-1;\n uint32_t L = x>>b, R = x&mb;\n \/\/ Three rounds of FE2\n L = ma&(L+threefry(key,uint64_t(1)<<32|R)); \/\/ round 1: s = a\n R = mb&(R+threefry(key,uint64_t(2)<<32|L)); \/\/ round 2: s = b\n L = ma&(L+threefry(key,uint64_t(3)<<32|R)); \/\/ round 3: s = a\n return uint64_t(L)<<b|R;\n}\n\n\/\/ The inverse of fe2_encrypt\nstatic inline uint64_t fe2_decrypt(const int bits, const uint128_t key, const uint64_t x) {\n assert(bits==64 || x<(uint64_t(1)<<bits));\n \/\/ Prepare for FE2\n const int a = bits>>1, b = bits-a; \/\/ logs of a,b in the paper\n const uint32_t ma = (uint64_t(1)<<a)-1, \/\/ bit masks\n mb = (uint64_t(1)<<b)-1;\n uint32_t L = x>>b, R = x&mb;\n \/\/ Three rounds of FE2\n L = ma&(L-threefry(key,uint64_t(3)<<32|R)); \/\/ round 3: s = a\n R = mb&(R-threefry(key,uint64_t(2)<<32|L)); \/\/ round 2: s = b\n L = ma&(L-threefry(key,uint64_t(1)<<32|R)); \/\/ round 1: s = a\n return uint64_t(L)<<b|R;\n}\n\n\/\/ Find a power of two strictly larger than n. By insisting on strictly larger, we avoid the weakness\n\/\/ that Feistel permutations are always even (apparently). This would be detectable for small n.\nstatic inline int next_log(const uint64_t n) {\n return integer_log(n)+1;\n}\n\n\/\/ Since we use the next power of two for the FE2 block cipher, the cycle walking construction\n\/\/ needs an average of at most 2 iterations. This amounts to 6 calls to threefry, or a couple\n\/\/ hundred cycles.\n\nuint64_t random_permute(const uint64_t n, const uint128_t key, uint64_t x) {\n assert(x<n);\n const int bits = next_log(n);\n do { \/\/ Repeatedly encrypt until we're back in the right range\n x = fe2_encrypt(bits,key,x);\n } while (x>=n);\n return x;\n}\n\nuint64_t random_unpermute(const uint64_t n, const uint128_t key, uint64_t x) {\n assert(x<n);\n const int bits = next_log(n);\n do { \/\/ Repeatedly decrypt until we're back in the right range\n x = fe2_decrypt(bits,key,x);\n } while (x>=n);\n return x;\n}\n\n}\nusing namespace other;\n\nvoid wrap_permute() {\n OTHER_FUNCTION(random_permute)\n OTHER_FUNCTION(random_unpermute)\n}\n<commit_msg>added casts to permutations to make windows happy<commit_after>\/\/ Random access pseudorandom permutations\n\n#include <other\/core\/random\/permute.h>\n#include <other\/core\/random\/counter.h>\n#include <other\/core\/math\/integer_log.h>\n#include <other\/core\/python\/module.h>\nnamespace other {\n\n\/\/ For details, see\n\/\/ John Black and Phillip Rogaway, Ciphers with Arbitrary Finite Domains.\n\/\/ Mihir Bellare, Thomas Ristenpart, Phillip Rogaway, and Till Stegers, Format-Preserving Encryption.\n\/\/ http:\/\/blog.notdot.net\/2007\/9\/Damn-Cool-Algorithms-Part-2-Secure-permutations-with-block-ciphers\n\/\/ Specifically, we use the FE2 construction with a = 2^k, b = 2^k or 2^(k+1), three rounds, and threefry\n\/\/ as the round function. Then we use cycle walking to turn this into a permutation on [0,n-1].\n\n\/\/ An earlier version used TEA, but the quality of this was questionable and it didn't work for small n.\n\nstatic inline uint64_t fe2_encrypt(const int bits, const uint128_t key, const uint64_t x) {\n assert(bits==64 || x<(uint64_t(1)<<bits));\n \/\/ Prepare for FE2\n const int a = bits>>1, b = bits-a; \/\/ logs of a,b in the paper\n const uint32_t ma = (uint64_t(1)<<a)-1, \/\/ bit masks\n mb = (uint64_t(1)<<b)-1;\n uint32_t L = (uint32_t)(x>>b), R = x&mb;\n \/\/ Three rounds of FE2\n L = ma&(L+cast_uint128<uint32_t>(threefry(key,uint64_t(1)<<32|R))); \/\/ round 1: s = a\n R = mb&(R+cast_uint128<uint32_t>(threefry(key,uint64_t(2)<<32|L))); \/\/ round 2: s = b\n L = ma&(L+cast_uint128<uint32_t>(threefry(key,uint64_t(3)<<32|R))); \/\/ round 3: s = a\n return uint64_t(L)<<b|R;\n}\n\n\/\/ The inverse of fe2_encrypt\nstatic inline uint64_t fe2_decrypt(const int bits, const uint128_t key, const uint64_t x) {\n assert(bits==64 || x<(uint64_t(1)<<bits));\n \/\/ Prepare for FE2\n const int a = bits>>1, b = bits-a; \/\/ logs of a,b in the paper\n const uint32_t ma = (uint64_t(1)<<a)-1, \/\/ bit masks\n mb = (uint64_t(1)<<b)-1;\n uint32_t L = (uint32_t)(x>>b), R = x&mb;\n \/\/ Three rounds of FE2\n L = ma&(L-cast_uint128<uint32_t>(threefry(key,uint64_t(3)<<32|R))); \/\/ round 3: s = a\n R = mb&(R-cast_uint128<uint32_t>(threefry(key,uint64_t(2)<<32|L))); \/\/ round 2: s = b\n L = ma&(L-cast_uint128<uint32_t>(threefry(key,uint64_t(1)<<32|R))); \/\/ round 1: s = a\n return uint64_t(L)<<b|R;\n}\n\n\/\/ Find a power of two strictly larger than n. By insisting on strictly larger, we avoid the weakness\n\/\/ that Feistel permutations are always even (apparently). This would be detectable for small n.\nstatic inline int next_log(const uint64_t n) {\n return integer_log(n)+1;\n}\n\n\/\/ Since we use the next power of two for the FE2 block cipher, the cycle walking construction\n\/\/ needs an average of at most 2 iterations. This amounts to 6 calls to threefry, or a couple\n\/\/ hundred cycles.\n\nuint64_t random_permute(const uint64_t n, const uint128_t key, uint64_t x) {\n assert(x<n);\n const int bits = next_log(n);\n do { \/\/ Repeatedly encrypt until we're back in the right range\n x = fe2_encrypt(bits,key,x);\n } while (x>=n);\n return x;\n}\n\nuint64_t random_unpermute(const uint64_t n, const uint128_t key, uint64_t x) {\n assert(x<n);\n const int bits = next_log(n);\n do { \/\/ Repeatedly decrypt until we're back in the right range\n x = fe2_decrypt(bits,key,x);\n } while (x>=n);\n return x;\n}\n\n}\nusing namespace other;\n\nvoid wrap_permute() {\n OTHER_FUNCTION(random_permute)\n OTHER_FUNCTION(random_unpermute)\n}\n<|endoftext|>"} {"text":"<commit_before>#include \"Protocol.h\"\n\nusing namespace IM;\n\nProtocol::Protocol( uint32 capabilities ) \n:\tm_capabilities( capabilities )\n{\n}\n\nProtocol::~Protocol() {\n}\n\nbool\nProtocol::HasCapability( capability_bitmask cap )\n{\n\treturn (m_capabilities & cap) != 0;\n}\n\nuint32\nProtocol::Capabilities(void) {\n\treturn m_capabilities;\n};<commit_msg>Fixed a warning when building libim<commit_after>#include \"Protocol.h\"\n\nusing namespace IM;\n\nProtocol::Protocol( uint32 capabilities ) \n:\tm_capabilities( capabilities )\n{\n}\n\nProtocol::~Protocol() {\n}\n\nbool\nProtocol::HasCapability( capability_bitmask cap )\n{\n\treturn (m_capabilities & cap) != 0;\n}\n\nuint32\nProtocol::Capabilities(void) {\n\treturn m_capabilities;\n};\n<|endoftext|>"} {"text":"<commit_before>#include \"vga\/rast\/text_10x16.h\"\n\n#include \"vga\/timing.h\"\n#include \"vga\/font_10x16.h\"\n#include \"vga\/unpack_text_10p_attributed.h\"\n\nnamespace vga {\nnamespace rast {\n\nstatic constexpr unsigned glyph_cols = 10, glyph_rows = 16;\nstatic constexpr unsigned chars_in_font = 256;\n\nText_10x16::Text_10x16(unsigned width, unsigned height, unsigned top_line)\n : _cols((width + (glyph_cols - 1)) \/ glyph_cols),\n _rows((height + (glyph_rows - 1)) \/ glyph_rows),\n _fb(nullptr),\n _font(nullptr),\n _top_line(top_line) {}\n\nvoid Text_10x16::activate(Timing const &timing) {\n _font = new unsigned char[chars_in_font * glyph_rows];\n _fb = new unsigned[_cols * _rows];\n\n for (unsigned i = 0; i < chars_in_font * glyph_rows; ++i) {\n _font[i] = font_10x16[i];\n }\n}\n\n__attribute__((section(\".ramcode\")))\nRasterizer::LineShape Text_10x16::rasterize(unsigned line_number,\n Pixel *raster_target) {\n line_number -= _top_line;\n if (line_number >= _rows * glyph_rows) return { 0, 0 };\n\n unsigned text_row = line_number \/ glyph_rows;\n unsigned row_in_glyph = line_number % glyph_rows;\n\n unsigned const *src = _fb + _cols * text_row;\n unsigned char const *font = _font + row_in_glyph * chars_in_font;\n\n unpack_text_10p_attributed_impl(src, font, raster_target, _cols);\n\n return { 0, _cols * glyph_cols };\n}\n\nvoid Text_10x16::deactivate() {\n _font = nullptr;\n _fb = nullptr;\n _cols = 0;\n}\n\nvoid Text_10x16::clear_framebuffer(Pixel bg) {\n unsigned word = bg << 8 | ' ';\n for (unsigned i = 0; i < _cols * _rows; ++i) {\n _fb[i] = word;\n }\n}\n\nvoid Text_10x16::put_char(unsigned col, unsigned row,\n Pixel fore, Pixel back,\n char c) {\n _fb[row * _cols + col] = (fore << 16) | (back << 8) | c;\n}\n\n} \/\/ namespace rast\n} \/\/ namespace vga\n<commit_msg>vga\/rast\/text_10x16: blank after text.<commit_after>#include \"vga\/rast\/text_10x16.h\"\n\n#include \"vga\/timing.h\"\n#include \"vga\/font_10x16.h\"\n#include \"vga\/unpack_text_10p_attributed.h\"\n\nnamespace vga {\nnamespace rast {\n\nstatic constexpr unsigned glyph_cols = 10, glyph_rows = 16;\nstatic constexpr unsigned chars_in_font = 256;\n\nText_10x16::Text_10x16(unsigned width, unsigned height, unsigned top_line)\n : _cols((width + (glyph_cols - 1)) \/ glyph_cols),\n _rows((height + (glyph_rows - 1)) \/ glyph_rows),\n _fb(nullptr),\n _font(nullptr),\n _top_line(top_line) {}\n\nvoid Text_10x16::activate(Timing const &timing) {\n _font = new unsigned char[chars_in_font * glyph_rows];\n _fb = new unsigned[_cols * _rows];\n\n for (unsigned i = 0; i < chars_in_font * glyph_rows; ++i) {\n _font[i] = font_10x16[i];\n }\n}\n\n__attribute__((section(\".ramcode\")))\nRasterizer::LineShape Text_10x16::rasterize(unsigned line_number,\n Pixel *raster_target) {\n line_number -= _top_line;\n\n unsigned text_row = line_number \/ glyph_rows;\n unsigned row_in_glyph = line_number % glyph_rows;\n\n if (text_row >= _rows) return { 0, 0 };\n\n unsigned const *src = _fb + _cols * text_row;\n unsigned char const *font = _font + row_in_glyph * chars_in_font;\n\n unpack_text_10p_attributed_impl(src, font, raster_target, _cols);\n\n return { 0, _cols * glyph_cols };\n}\n\nvoid Text_10x16::deactivate() {\n _font = nullptr;\n _fb = nullptr;\n _cols = 0;\n}\n\nvoid Text_10x16::clear_framebuffer(Pixel bg) {\n unsigned word = bg << 8 | ' ';\n for (unsigned i = 0; i < _cols * _rows; ++i) {\n _fb[i] = word;\n }\n}\n\nvoid Text_10x16::put_char(unsigned col, unsigned row,\n Pixel fore, Pixel back,\n char c) {\n _fb[row * _cols + col] = (fore << 16) | (back << 8) | c;\n}\n\n} \/\/ namespace rast\n} \/\/ namespace vga\n<|endoftext|>"} {"text":"<commit_before>\/\/===-------------- AliasAnalysis.cpp - SIL Alias Analysis ----------------===\/\/\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#define DEBUG_TYPE \"sil-aa\"\n#include \"swift\/SILAnalysis\/AliasAnalysis.h\"\n#include \"swift\/SILPasses\/Utils\/Local.h\"\n#include \"swift\/SIL\/SILValue.h\"\n#include \"swift\/SIL\/SILInstruction.h\"\n#include \"swift\/SIL\/SILArgument.h\"\n#include \"swift\/SIL\/SILFunction.h\"\n#include \"llvm\/Support\/CommandLine.h\"\n#include \"llvm\/Support\/Debug.h\"\n#include \"llvm\/Support\/raw_ostream.h\"\n\nusing namespace swift;\n\nstatic llvm::cl::opt<bool>\nDisableAliasAnalysis(\"disable-aa\", llvm::cl::init(false),\n llvm::cl::Hidden,\n llvm::cl::desc(\"Always return most conservative AA \"\n \"result.\"));\n\n\/\/===----------------------------------------------------------------------===\/\/\n\/\/ Utility Functions\n\/\/===----------------------------------------------------------------------===\/\/\n\n\/\/\/ Strip off casts\/indexing insts\/address projections from V until there is\n\/\/\/ nothing left to strip.\nstatic SILValue getUnderlyingObject(SILValue V) {\n while (true) {\n SILValue V2 = V.stripCasts().stripAddressProjections().stripIndexingInsts();\n if (V2 == V)\n return V2;\n V = V2;\n }\n}\n\n\/\/\/ Return true if the given SILArgument is an argument to the first BB of a\n\/\/\/ function.\nstatic bool isFunctionArgument(SILValue V) {\n auto *Arg = dyn_cast<SILArgument>(V.getDef());\n if (!Arg)\n return false;\n return Arg->getParent() == &*Arg->getFunction()->begin();\n}\n\n\/\/\/ A no alias argument is an argument that is an address type of the entry\n\/\/\/ basic block of a function.\nstatic bool isNoAliasArgument(SILValue V) {\n return isFunctionArgument(V) && V.getType().isAddress();\n}\n\n\/\/\/ Return true if V is an object that at compile time can be uniquely\n\/\/\/ identified.\nstatic bool isIdentifiableObject(SILValue V) {\n return isa<AllocationInst>(*V) || isNoAliasArgument(V) ||\n isa<LiteralInst>(*V);\n}\n\nstatic bool isLocalLiteral(SILValue V) {\n switch (V->getKind()) {\n case ValueKind::IntegerLiteralInst:\n case ValueKind::FloatLiteralInst:\n case ValueKind::StringLiteralInst:\n return true;\n default:\n return false;\n }\n}\n\nstatic bool isIdentifiedFunctionLocal(SILValue V) {\n return isa<AllocationInst>(*V) || isNoAliasArgument(V) || isLocalLiteral(V);\n}\n\n\/\/\/ Returns true if we can prove that the two input SILValues which do not equal\n\/\/\/ can not alias.\nstatic bool aliasUnequalObjects(SILValue O1, SILValue O2) {\n assert(O1 != O2 && \"This function should only be called on unequal values.\");\n\n \/\/ If O1 and O2 do not equal and they are both values that can be statically\n \/\/ and uniquely identified, they can not alias.\n if (isIdentifiableObject(O1) && isIdentifiableObject(O2))\n return true;\n\n \/\/ Function arguments can't alias with things that are known to be\n \/\/ unambigously identified at the function level.\n if ((isFunctionArgument(O1.getDef()) && isIdentifiedFunctionLocal(O2)) ||\n (isFunctionArgument(O2.getDef()) && isIdentifiedFunctionLocal(O1)))\n return true;\n\n \/\/ We failed to prove that the two objects are different.\n return false;\n}\n\n\/\/===----------------------------------------------------------------------===\/\/\n\/\/ Entry Points\n\/\/===----------------------------------------------------------------------===\/\/\n\nAliasAnalysis::AliasResult AliasAnalysis::alias(SILValue V1, SILValue V2) {\n \/\/ If alias analysis is disabled, always return may alias.\n if (DisableAliasAnalysis)\n return AliasResult::MayAlias;\n\n \/\/ If the two values equal, quickly return must alias.\n if (V1 == V2)\n return AliasResult::MustAlias;\n\n DEBUG(llvm::dbgs() << \"ALIAS ANALYSIS:\\n V1: \" << *V1.getDef()\n << \" V2: \" << *V2.getDef());\n \/\/ Strip off any casts on V1, V2.\n V1 = V1.stripCasts();\n V2 = V2.stripCasts();\n DEBUG(llvm::dbgs() << \" After Cast Stripping V1:\" << *V1.getDef());\n DEBUG(llvm::dbgs() << \" After Cast Stripping V2:\" << *V2.getDef());\n\n \/\/ Create a key to lookup if we have already computed an alias result for V1,\n \/\/ V2. Canonicalize our cache keys so that the pointer with the lower address\n \/\/ is always the first element of the pair. This ensures we do not pollute our\n \/\/ cache with two entries with the same key, albeit with the key's fields\n \/\/ swapped.\n auto Key = V1 < V2? std::make_pair(V1, V2) : std::make_pair(V2, V1);\n\n \/\/ If we find our key in the cache, just return the alias result.\n auto Pair = AliasCache.find(Key);\n if (Pair != AliasCache.end()) {\n DEBUG(llvm::dbgs() << \" Found value in the cache: \"\n << unsigned(Pair->second));\n\n return Pair->second;\n }\n\n \/\/ Ok, we need to actually compute an Alias Analysis result for V1, V2. Begin\n \/\/ by finding the \"base\" of V1, V2 by stripping off all casts and GEPs.\n SILValue O1 = getUnderlyingObject(V1);\n SILValue O2 = getUnderlyingObject(V2);\n DEBUG(llvm::dbgs() << \" Underlying V1:\" << *O1.getDef());\n DEBUG(llvm::dbgs() << \" Underlying V2:\" << *O2.getDef());\n\n\n \/\/ If O1 and O2 do not equal, see if we can prove that they can not be the\n \/\/ same object. If we can, return No Alias.\n if (O1 != O2 && aliasUnequalObjects(O1, O2))\n return AliasCache[Key] = AliasResult::NoAlias;\n\n \/\/ We could not prove anything. Be conservative and return that V1, V2 may\n \/\/ alias.\n return AliasResult::MayAlias;\n}\n\nSILInstruction::MemoryBehavior\nAliasAnalysis::getMemoryBehavior(SILInstruction *Inst, SILValue V) {\n DEBUG(llvm::dbgs() << \"GET MEMORY BEHAVIOR FOR:\\n \" << *Inst << \" \"\n << *V.getDef());\n\n \/\/ If we already know that we do not read or write memory, just return None.\n if (!Inst->mayReadOrWriteMemory()) {\n DEBUG(llvm::dbgs() << \" Inst does not write memory. Returning None.\\n\");\n return MemoryBehavior::None;\n }\n\n switch (Inst->getKind()) {\n case ValueKind::LoadInst:\n \/\/ If the load address doesn't alias the given address, it doesn't read or\n \/\/ write the specified memory.\n if (alias(Inst->getOperand(0), V) == AliasResult::NoAlias) {\n DEBUG(llvm::dbgs() << \" Load does not alias inst. Returning None.\\n\");\n return MemoryBehavior::None;\n }\n\n \/\/ Otherwise be conservative and just return reads since loads can only\n \/\/ read.\n DEBUG(llvm::dbgs() << \" Could not prove load does not alias inst. \"\n \"Returning MayRead.\\n\");\n return MemoryBehavior::MayRead;\n case ValueKind::StoreInst:\n \/\/ If the store dest cannot alias the pointer in question, then the\n \/\/ specified value can not be modified by the store.\n if (alias(cast<StoreInst>(Inst)->getDest(), V) == AliasResult::NoAlias) {\n DEBUG(llvm::dbgs() << \" Store Dst does not alias inst. Returning \"\n \"None.\\n\");\n return MemoryBehavior::None;\n }\n\n \/\/ Otherwise, a store just writes.\n DEBUG(llvm::dbgs() << \" Could not prove store does not alias inst. \"\n \"Returning MayWrite.\\n\");\n return MemoryBehavior::MayWrite;\n case ValueKind::ApplyInst: {\n \/\/ If the ApplyInst is from a no-read builtin it can not read or write and\n \/\/ if it comes from a no-side effect builtin, it can only read.\n auto *AI = cast<ApplyInst>(Inst);\n auto *BFR = dyn_cast<BuiltinFunctionRefInst>(AI->getCallee().getDef());\n\n \/\/ If our callee is not a builtin, be conservative and return may have side\n \/\/ effects.\n if (!BFR) {\n DEBUG(llvm::dbgs() << \" Found apply we don't understand returning \"\n \"MHSF.\\n\");\n return MemoryBehavior::MayHaveSideEffects;\n }\n\n \/\/ If the builtin is read none, it does not read or write memory.\n if (isReadNone(BFR)) {\n DEBUG(llvm::dbgs() << \" Found apply of read none builtin. Returning\"\n \" None.\\n\");\n return MemoryBehavior::None;\n }\n \/\/ If the builtin is side effect free, then it can only read memory.\n if (isSideEffectFree(BFR)) {\n DEBUG(llvm::dbgs() << \" Found apply of side effect free builtin. \"\n \"Returning MayRead.\\n\");\n return MemoryBehavior::MayRead;\n }\n\n \/\/ Otherwise be conservative and return that we may have side effects.\n DEBUG(llvm::dbgs() << \" Found apply of side effect builtin. \"\n \"Returning MayHaveSideEffects.\\n\");\n return MemoryBehavior::MayHaveSideEffects;\n }\n default:\n \/\/ If we do not have a special case, just return the generic memory\n \/\/ behavior of Inst.\n return Inst->getMemoryBehavior();\n }\n}\n\nSILAnalysis *swift::createAliasAnalysis(SILModule *M) {\n return new AliasAnalysis(M);\n}\n\nllvm::raw_ostream &swift::operator<<(llvm::raw_ostream &OS,\n AliasAnalysis::AliasResult R) {\n switch (R) {\n case AliasAnalysis::AliasResult::NoAlias:\n return OS << \"NoAlias\";\n case AliasAnalysis::AliasResult::MayAlias:\n return OS << \"MayAlias\";\n case AliasAnalysis::AliasResult::MustAlias:\n return OS << \"MustAlias\";\n }\n}\n<commit_msg>[sil-aa] Compile out DisableAliasAnalysis flag when not building Debug. Put in a comment making it clear that it should be removed once AA bringup is complete.<commit_after>\/\/===-------------- AliasAnalysis.cpp - SIL Alias Analysis ----------------===\/\/\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#define DEBUG_TYPE \"sil-aa\"\n#include \"swift\/SILAnalysis\/AliasAnalysis.h\"\n#include \"swift\/SILPasses\/Utils\/Local.h\"\n#include \"swift\/SIL\/SILValue.h\"\n#include \"swift\/SIL\/SILInstruction.h\"\n#include \"swift\/SIL\/SILArgument.h\"\n#include \"swift\/SIL\/SILFunction.h\"\n#include \"llvm\/Support\/CommandLine.h\"\n#include \"llvm\/Support\/Debug.h\"\n#include \"llvm\/Support\/raw_ostream.h\"\n\nusing namespace swift;\n\n#ifndef NDEBUG\n\/\/\/ This is meant to be used during AA bring up. If AA has been brought up, feel\n\/\/\/ free to remove this.\nstatic llvm::cl::opt<bool>\nDisableAliasAnalysis(\"disable-aa\", llvm::cl::init(false),\n llvm::cl::Hidden,\n llvm::cl::desc(\"Always return most conservative AA \"\n \"result.\"));\n#endif\n\n\/\/===----------------------------------------------------------------------===\/\/\n\/\/ Utility Functions\n\/\/===----------------------------------------------------------------------===\/\/\n\n\/\/\/ Strip off casts\/indexing insts\/address projections from V until there is\n\/\/\/ nothing left to strip.\nstatic SILValue getUnderlyingObject(SILValue V) {\n while (true) {\n SILValue V2 = V.stripCasts().stripAddressProjections().stripIndexingInsts();\n if (V2 == V)\n return V2;\n V = V2;\n }\n}\n\n\/\/\/ Return true if the given SILArgument is an argument to the first BB of a\n\/\/\/ function.\nstatic bool isFunctionArgument(SILValue V) {\n auto *Arg = dyn_cast<SILArgument>(V.getDef());\n if (!Arg)\n return false;\n return Arg->getParent() == &*Arg->getFunction()->begin();\n}\n\n\/\/\/ A no alias argument is an argument that is an address type of the entry\n\/\/\/ basic block of a function.\nstatic bool isNoAliasArgument(SILValue V) {\n return isFunctionArgument(V) && V.getType().isAddress();\n}\n\n\/\/\/ Return true if V is an object that at compile time can be uniquely\n\/\/\/ identified.\nstatic bool isIdentifiableObject(SILValue V) {\n return isa<AllocationInst>(*V) || isNoAliasArgument(V) ||\n isa<LiteralInst>(*V);\n}\n\nstatic bool isLocalLiteral(SILValue V) {\n switch (V->getKind()) {\n case ValueKind::IntegerLiteralInst:\n case ValueKind::FloatLiteralInst:\n case ValueKind::StringLiteralInst:\n return true;\n default:\n return false;\n }\n}\n\nstatic bool isIdentifiedFunctionLocal(SILValue V) {\n return isa<AllocationInst>(*V) || isNoAliasArgument(V) || isLocalLiteral(V);\n}\n\n\/\/\/ Returns true if we can prove that the two input SILValues which do not equal\n\/\/\/ can not alias.\nstatic bool aliasUnequalObjects(SILValue O1, SILValue O2) {\n assert(O1 != O2 && \"This function should only be called on unequal values.\");\n\n \/\/ If O1 and O2 do not equal and they are both values that can be statically\n \/\/ and uniquely identified, they can not alias.\n if (isIdentifiableObject(O1) && isIdentifiableObject(O2))\n return true;\n\n \/\/ Function arguments can't alias with things that are known to be\n \/\/ unambigously identified at the function level.\n if ((isFunctionArgument(O1.getDef()) && isIdentifiedFunctionLocal(O2)) ||\n (isFunctionArgument(O2.getDef()) && isIdentifiedFunctionLocal(O1)))\n return true;\n\n \/\/ We failed to prove that the two objects are different.\n return false;\n}\n\n\/\/===----------------------------------------------------------------------===\/\/\n\/\/ Entry Points\n\/\/===----------------------------------------------------------------------===\/\/\n\nAliasAnalysis::AliasResult AliasAnalysis::alias(SILValue V1, SILValue V2) {\n \/\/ If alias analysis is disabled, always return may alias.\n if (DisableAliasAnalysis)\n return AliasResult::MayAlias;\n\n \/\/ If the two values equal, quickly return must alias.\n if (V1 == V2)\n return AliasResult::MustAlias;\n\n DEBUG(llvm::dbgs() << \"ALIAS ANALYSIS:\\n V1: \" << *V1.getDef()\n << \" V2: \" << *V2.getDef());\n \/\/ Strip off any casts on V1, V2.\n V1 = V1.stripCasts();\n V2 = V2.stripCasts();\n DEBUG(llvm::dbgs() << \" After Cast Stripping V1:\" << *V1.getDef());\n DEBUG(llvm::dbgs() << \" After Cast Stripping V2:\" << *V2.getDef());\n\n \/\/ Create a key to lookup if we have already computed an alias result for V1,\n \/\/ V2. Canonicalize our cache keys so that the pointer with the lower address\n \/\/ is always the first element of the pair. This ensures we do not pollute our\n \/\/ cache with two entries with the same key, albeit with the key's fields\n \/\/ swapped.\n auto Key = V1 < V2? std::make_pair(V1, V2) : std::make_pair(V2, V1);\n\n \/\/ If we find our key in the cache, just return the alias result.\n auto Pair = AliasCache.find(Key);\n if (Pair != AliasCache.end()) {\n DEBUG(llvm::dbgs() << \" Found value in the cache: \"\n << unsigned(Pair->second));\n\n return Pair->second;\n }\n\n \/\/ Ok, we need to actually compute an Alias Analysis result for V1, V2. Begin\n \/\/ by finding the \"base\" of V1, V2 by stripping off all casts and GEPs.\n SILValue O1 = getUnderlyingObject(V1);\n SILValue O2 = getUnderlyingObject(V2);\n DEBUG(llvm::dbgs() << \" Underlying V1:\" << *O1.getDef());\n DEBUG(llvm::dbgs() << \" Underlying V2:\" << *O2.getDef());\n\n\n \/\/ If O1 and O2 do not equal, see if we can prove that they can not be the\n \/\/ same object. If we can, return No Alias.\n if (O1 != O2 && aliasUnequalObjects(O1, O2))\n return AliasCache[Key] = AliasResult::NoAlias;\n\n \/\/ We could not prove anything. Be conservative and return that V1, V2 may\n \/\/ alias.\n return AliasResult::MayAlias;\n}\n\nSILInstruction::MemoryBehavior\nAliasAnalysis::getMemoryBehavior(SILInstruction *Inst, SILValue V) {\n DEBUG(llvm::dbgs() << \"GET MEMORY BEHAVIOR FOR:\\n \" << *Inst << \" \"\n << *V.getDef());\n\n \/\/ If we already know that we do not read or write memory, just return None.\n if (!Inst->mayReadOrWriteMemory()) {\n DEBUG(llvm::dbgs() << \" Inst does not write memory. Returning None.\\n\");\n return MemoryBehavior::None;\n }\n\n switch (Inst->getKind()) {\n case ValueKind::LoadInst:\n \/\/ If the load address doesn't alias the given address, it doesn't read or\n \/\/ write the specified memory.\n if (alias(Inst->getOperand(0), V) == AliasResult::NoAlias) {\n DEBUG(llvm::dbgs() << \" Load does not alias inst. Returning None.\\n\");\n return MemoryBehavior::None;\n }\n\n \/\/ Otherwise be conservative and just return reads since loads can only\n \/\/ read.\n DEBUG(llvm::dbgs() << \" Could not prove load does not alias inst. \"\n \"Returning MayRead.\\n\");\n return MemoryBehavior::MayRead;\n case ValueKind::StoreInst:\n \/\/ If the store dest cannot alias the pointer in question, then the\n \/\/ specified value can not be modified by the store.\n if (alias(cast<StoreInst>(Inst)->getDest(), V) == AliasResult::NoAlias) {\n DEBUG(llvm::dbgs() << \" Store Dst does not alias inst. Returning \"\n \"None.\\n\");\n return MemoryBehavior::None;\n }\n\n \/\/ Otherwise, a store just writes.\n DEBUG(llvm::dbgs() << \" Could not prove store does not alias inst. \"\n \"Returning MayWrite.\\n\");\n return MemoryBehavior::MayWrite;\n case ValueKind::ApplyInst: {\n \/\/ If the ApplyInst is from a no-read builtin it can not read or write and\n \/\/ if it comes from a no-side effect builtin, it can only read.\n auto *AI = cast<ApplyInst>(Inst);\n auto *BFR = dyn_cast<BuiltinFunctionRefInst>(AI->getCallee().getDef());\n\n \/\/ If our callee is not a builtin, be conservative and return may have side\n \/\/ effects.\n if (!BFR) {\n DEBUG(llvm::dbgs() << \" Found apply we don't understand returning \"\n \"MHSF.\\n\");\n return MemoryBehavior::MayHaveSideEffects;\n }\n\n \/\/ If the builtin is read none, it does not read or write memory.\n if (isReadNone(BFR)) {\n DEBUG(llvm::dbgs() << \" Found apply of read none builtin. Returning\"\n \" None.\\n\");\n return MemoryBehavior::None;\n }\n \/\/ If the builtin is side effect free, then it can only read memory.\n if (isSideEffectFree(BFR)) {\n DEBUG(llvm::dbgs() << \" Found apply of side effect free builtin. \"\n \"Returning MayRead.\\n\");\n return MemoryBehavior::MayRead;\n }\n\n \/\/ Otherwise be conservative and return that we may have side effects.\n DEBUG(llvm::dbgs() << \" Found apply of side effect builtin. \"\n \"Returning MayHaveSideEffects.\\n\");\n return MemoryBehavior::MayHaveSideEffects;\n }\n default:\n \/\/ If we do not have a special case, just return the generic memory\n \/\/ behavior of Inst.\n return Inst->getMemoryBehavior();\n }\n}\n\nSILAnalysis *swift::createAliasAnalysis(SILModule *M) {\n return new AliasAnalysis(M);\n}\n\nllvm::raw_ostream &swift::operator<<(llvm::raw_ostream &OS,\n AliasAnalysis::AliasResult R) {\n switch (R) {\n case AliasAnalysis::AliasResult::NoAlias:\n return OS << \"NoAlias\";\n case AliasAnalysis::AliasResult::MayAlias:\n return OS << \"MayAlias\";\n case AliasAnalysis::AliasResult::MustAlias:\n return OS << \"MustAlias\";\n }\n}\n<|endoftext|>"} {"text":"<commit_before>#ifndef __JSON_HPP__\n#define __JSON_HPP__\n\n#include <cctype>\n#include <string>\n#include <iostream>\n#include <iterator>\n#include <sstream>\n#include <vector>\n#include <array>\n#include <regex>\n\nnamespace JSON {\n\tusing namespace std;\n\n\tstruct Error {};\n\tstruct SyntaxError : public Error {};\n\tstruct LoadError : public Error {};\n\tstruct AccessError : public Error {};\n\n\ttemplate<typename _Value, char const ..._szName>\n\tstruct Field {\n\t\tstatic char const s_szName[];\n\t\ttypedef _Value Type;\n\t};\n\n\ttemplate<typename _Value, char const ..._szName>\n\tchar const Field<_Value, _szName...>::s_szName[] = { _szName... };\n\n\ttemplate<typename _Value, char const ..._szName>\n\tstruct OptionalField {\n\t\tstatic char const s_szName[];\n\t\ttypedef _Value Type;\n\t};\n\n\ttemplate<typename _Value, char const ..._szName>\n\tchar const OptionalField<_Value, _szName...>::s_szName[] = { _szName... };\n\n\ttemplate<char const ..._sz>\n\tstruct FieldName {\n\t\tstatic char const s_szName[];\n\t};\n\n\ttemplate<char const ..._sz>\n\tchar const FieldName<_sz...>::s_szName[] = { _sz... };\n\n\ttemplate<typename _Name, typename ..._Fields>\n\tstruct FieldType {};\n\n\ttemplate<typename _Value, char const ..._szName, typename ..._OtherFields>\n\tstruct FieldType<FieldName<_szName...>, Field<_Value, _szName...>, _OtherFields...> {\n\t\ttypedef _Value Type;\n\t};\n\n\ttemplate<char const ..._szFieldName, typename _FirstField, typename ..._OtherFields>\n\tstruct FieldType<FieldName<_szFieldName...>, _FirstField, _OtherFields...> {\n\t\ttypedef typename FieldType<FieldName<_szFieldName...>, _OtherFields...>::Type Type;\n\t};\n\n\ttemplate<typename ..._Fields>\n\tstruct Object {};\n\n\ttemplate<typename _Field, typename ..._Fields>\n\tstruct Getter {};\n\n\ttemplate<typename _Value, char const ..._szName, typename ..._OtherFields>\n\tstruct Getter<Field<_Value, _szName...>, Field<_Value, _szName...>, _OtherFields...> {\n\t\tinline static _Value &Get(Object<Field<_Value, _szName...>, _OtherFields...> &rObject) {\n\t\t\treturn rObject.m_Value;\n\t\t}\n\n\t\tinline static _Value const &Get(Object<Field<_Value, _szName...>, _OtherFields...> const &rObject) {\n\t\t\treturn rObject.m_Value;\n\t\t}\n\t};\n\n\ttemplate<typename _Value, char const ..._szName, typename _FirstField, typename ..._OtherFields>\n\tstruct Getter<Field<_Value, _szName...>, _FirstField, _OtherFields...> {\n\t\tinline static _Value &Get(Object<_FirstField, _OtherFields...> &rObject) {\n\t\t\treturn Getter<Field<_Value, _szName...>, _OtherFields...>::Get(rObject);\n\t\t}\n\n\t\tinline static _Value const &Get(Object<_FirstField, _OtherFields...> const &rObject) {\n\t\t\treturn Getter<Field<_Value, _szName...>, _FirstField, _OtherFields...>::Get(rObject);\n\t\t}\n\t};\n\n\ttemplate<>\n\tstruct Object<> {\n\t\tObject() {}\n\t\tvirtual ~Object() {}\n\t};\n\n\ttemplate<typename _Value, char const ..._szName, typename ..._OtherFields>\n\tstruct Object<Field<_Value, _szName...>, _OtherFields...> :\n\t\tpublic Object<_OtherFields...>\n\t{\n\t\tstatic char const s_szName[];\n\t\t_Value m_Value;\n\n\t\tObject() {}\n\n\t\tvirtual ~Object() {}\n\n\t\ttemplate<char const ..._szFieldName>\n\t\tinline typename FieldType<FieldName<_szFieldName...>, Field<_Value, _szName...>, _OtherFields...>::Type &Get() {\n\t\t\treturn Getter<\n\t\t\t\tField<typename FieldType<\n\t\t\t\t\tFieldName<_szFieldName...>,\n\t\t\t\t\tField<_Value, _szName...>,\n\t\t\t\t\t_OtherFields...\n\t\t\t\t>::Type, _szFieldName...>,\n\t\t\t\tField<_Value, _szName...>,\n\t\t\t\t_OtherFields...\n\t\t\t>::Get(*this);\n\t\t}\n\n\t\ttemplate<char const ..._szFieldName>\n\t\tinline typename FieldType<FieldName<_szFieldName...>, Field<_Value, _szName...>, _OtherFields...>::Type const &Get() const {\n\t\t\treturn Getter<\n\t\t\t\tField<typename FieldType<\n\t\t\t\t\tFieldName<_szFieldName...>,\n\t\t\t\t\tField<_Value, _szName...>,\n\t\t\t\t\t_OtherFields...\n\t\t\t\t>::Type, _szFieldName...>,\n\t\t\t\tField<_Value, _szName...>,\n\t\t\t\t_OtherFields...\n\t\t\t>::Get(*this);\n\t\t}\n\t};\n\n\ttemplate<typename _Value, char const ..._szName, typename ..._OtherFields>\n\tchar const Object<Field<_Value, _szName...>, _OtherFields...>::s_szName[] = { _szName... };\n\n\ttemplate<typename _Value, char const ..._szName, typename ..._OtherFields>\n\tstruct Object<OptionalField<_Value, _szName...>, _OtherFields...> :\n\t\tpublic Object<_OtherFields...>\n\t{\n\t\tstatic char const s_szName[];\n\t\t_Value m_Value;\n\t\tbool m_fPresent;\n\n\t\tObject()\n\t\t\t:\n\t\tm_fPresent(false) {}\n\n\t\tvirtual ~Object() {}\n\n\t\t\/\/ TODO getters\n\t};\n\n\ttemplate<typename _Value, char const ..._szName, typename ..._OtherFields>\n\tchar const Object<OptionalField<_Value, _szName...>, _OtherFields...>::s_szName[] = { _szName... };\n\n\ttemplate<typename _Type>\n\tstruct Serializer {\n\t\ttemplate<typename _Iterator>\n\t\tstatic _Type Load(_Iterator &ri, _Iterator j);\n\n\t\tstatic string Store(_Type const &r);\n\t};\n\n\ttemplate<>\n\tstruct Serializer<nullptr_t> {\n\t\ttemplate<typename _Iterator>\n\t\tstatic nullptr_t Load(_Iterator &ri, _Iterator j) {\n\t\t\tif (regex_search(ri, j, regex(\"^\\\\s*null\"))) {\n\t\t\t\treturn nullptr;\n\t\t\t} else {\n\t\t\t\tthrow SyntaxError();\n\t\t\t}\n\t\t}\n\n\t\tstatic string Store(nullptr_t const &r) {\n\t\t\treturn \"null\";\n\t\t}\n\t};\n\n\ttemplate<>\n\tstruct Serializer<bool> {\n\t\ttemplate<typename _Iterator>\n\t\tstatic bool Load(_Iterator &ri, _Iterator j) {\n\t\t\t\/\/ TODO\n\t\t\tthrow Error();\n\t\t}\n\n\t\tstatic string Store(bool const &r) {\n\t\t\tif (r) {\n\t\t\t\treturn \"true\";\n\t\t\t} else {\n\t\t\t\treturn \"false\";\n\t\t\t}\n\t\t}\n\t};\n\n\ttemplate<>\n\tstruct Serializer<int> {\n\t\ttemplate<typename _Iterator>\n\t\tstatic int Load(_Iterator &ri, _Iterator j) {\n\t\t\t\/\/ TODO\n\t\t\tthrow Error();\n\t\t}\n\n\t\tstatic string Store(int const &r) {\n\t\t\tostringstream oss;\n\t\t\toss << r;\n\t\t\treturn oss.str();\n\t\t}\n\t};\n\n\ttemplate<>\n\tstruct Serializer<unsigned int> {\n\t\ttemplate<typename _Iterator>\n\t\tstatic unsigned int Load(_Iterator &ri, _Iterator j) {\n\t\t\t\/\/ TODO\n\t\t\tthrow Error();\n\t\t}\n\n\t\tstatic string Store(unsigned int const &r) {\n\t\t\tostringstream oss;\n\t\t\toss << r;\n\t\t\treturn oss.str();\n\t\t}\n\t};\n\n\ttemplate<>\n\tstruct Serializer<double> {\n\t\ttemplate<typename _Iterator>\n\t\tstatic double Load(_Iterator &ri, _Iterator j) {\n\t\t\t\/\/ TODO\n\t\t\tthrow Error();\n\t\t}\n\n\t\tstatic string Store(double const &r) {\n\t\t\tostringstream oss;\n\t\t\toss << r;\n\t\t\treturn oss.str();\n\t\t}\n\t};\n\n\ttemplate<>\n\tstruct Serializer<string> {\n\t\ttemplate<typename _Iterator>\n\t\tstatic string Load(_Iterator &ri, _Iterator j) {\n\t\t\t\/\/ TODO\n\t\t\tthrow Error();\n\t\t}\n\n\t\tstatic string Store(ostream &ros, string const &r) {\n\t\t\treturn \"\\\"\" + r + \"\\\"\"; \/\/ FIXME escape special characters\n\t\t}\n\t};\n\n\ttemplate<typename ..._Fields>\n\tstruct Serializer<Object<_Fields...>> {\n\t\ttemplate<typename _Iterator>\n\t\tstatic Object<_Fields...> Load(_Iterator &ri, _Iterator j) {\n\t\t\t\/\/ TODO\n\t\t\tthrow Error();\n\t\t}\n\t};\n\n\ttemplate<typename _Element>\n\tstruct Serializer<vector<_Element>> {\n\t\ttemplate<typename _Iterator>\n\t\tstatic vector<_Element> Load(_Iterator &ri, _Iterator j) {\n\t\t\t\/\/ TODO\n\t\t\tthrow Error();\n\t\t}\n\t};\n\n\ttemplate<typename _Element, unsigned int _c>\n\tstruct Serializer<array<_Element, _c>> {\n\t\ttemplate<typename _Iterator>\n\t\tstatic array<_Element, _c> Load(_Iterator &ri, _Iterator j) {\n\t\t\t\/\/ TODO\n\t\t\tthrow Error();\n\t\t}\n\t};\n\n\ttemplate<typename _Type>\n\tinline _Type Load(string const &rstr) {\n\t\treturn Serializer<_Type>::Load(rstr.begin(), rstr.end());\n\t}\n\n\ttemplate<typename _Type>\n\tinline _Type Load(istream &ris) {\n\t\tstring const str = string(istreambuf_iterator<char>(ris), istreambuf_iterator<char>());\n\t\tauto it = str.begin();\n\t\treturn Serializer<_Type>::Load(it, str.end());\n\t}\n\n\ttemplate<typename _Type>\n\tinline string Store(_Type const &r) {\n\t\treturn Serializer<_Type>::Store(r);\n\t}\n\n\ttemplate<typename _Type>\n\tinline ostream &Store(ostream &ros, _Type const &r) {\n\t\treturn ros << Serializer<_Type>::Store(r);\n\t}\n}\n\ntemplate<typename ..._Fields>\ninline std::istream &operator >> (std::istream &ris, JSON::Object<_Fields...> &rObject) {\n\trObject = JSON::Load<JSON::Object<_Fields...>>(ris);\n\treturn ris;\n}\n\ntemplate<typename ..._Fields>\ninline std::ostream &operator << (std::ostream &ros, JSON::Object<_Fields...> &rObject) {\n\treturn JSON::Store<JSON::Object<_Fields...>>(ros, rObject);\n}\n\nstatic constexpr char JSON_UNPACK(char const sz[], unsigned int i) {\n\treturn (void)sz, (void)i, 0;\n}\n\nstatic constexpr char (*JSON_ALMOST_UNPACK())(char const[], unsigned int) {\n\treturn JSON_UNPACK;\n}\n\n#define JSON_EMPTY(...)\n#define JSON_DEFER(...) __VA_ARGS__ JSON_EMPTY()\n#define JSON_EXPAND(...) __VA_ARGS__\n\n#define JSON_EXPAND0 JSON_EXPAND\n#define JSON_EXPAND1(...) JSON_EXPAND0(JSON_EXPAND0(__VA_ARGS__))\n#define JSON_EXPAND2(...) JSON_EXPAND1(JSON_EXPAND1(__VA_ARGS__))\n#define JSON_EXPAND3(...) JSON_EXPAND2(JSON_EXPAND2(__VA_ARGS__))\n#define JSON_EXPAND4(...) JSON_EXPAND3(JSON_EXPAND3(__VA_ARGS__))\n#define JSON_EXPAND5(...) JSON_EXPAND4(JSON_EXPAND4(__VA_ARGS__))\n#define JSON_EXPAND6(...) JSON_EXPAND5(JSON_EXPAND5(__VA_ARGS__))\n#define JSON_EXPAND_ALL JSON_EXPAND6\n\n#define JSON_ALMOST_UNPACK() JSON_UNPACK\n#define JSON_UNPACK(sz, i) ((i) < sizeof(sz)) ? (sz)[i] : 0, JSON_DEFER(JSON_ALMOST_UNPACK)()(sz, i + 1)\n\n#define UNPACK(sz) JSON_EXPAND_ALL(JSON_UNPACK(sz, 0))\n\n#endif\n<commit_msg>Faster UNPACK implementation - *sigh*<commit_after>#ifndef __JSON_HPP__\n#define __JSON_HPP__\n\n#include <cctype>\n#include <string>\n#include <iostream>\n#include <iterator>\n#include <sstream>\n#include <vector>\n#include <array>\n#include <regex>\n\nnamespace JSON {\n\tusing namespace std;\n\n\tstruct Error {};\n\tstruct SyntaxError : public Error {};\n\tstruct LoadError : public Error {};\n\tstruct AccessError : public Error {};\n\n\ttemplate<typename _Value, char const ..._szName>\n\tstruct Field {\n\t\tstatic char const s_szName[];\n\t\ttypedef _Value Type;\n\t};\n\n\ttemplate<typename _Value, char const ..._szName>\n\tchar const Field<_Value, _szName...>::s_szName[] = { _szName... };\n\n\ttemplate<typename _Value, char const ..._szName>\n\tstruct OptionalField {\n\t\tstatic char const s_szName[];\n\t\ttypedef _Value Type;\n\t};\n\n\ttemplate<typename _Value, char const ..._szName>\n\tchar const OptionalField<_Value, _szName...>::s_szName[] = { _szName... };\n\n\ttemplate<char const ..._sz>\n\tstruct FieldName {\n\t\tstatic char const s_szName[];\n\t};\n\n\ttemplate<char const ..._sz>\n\tchar const FieldName<_sz...>::s_szName[] = { _sz... };\n\n\ttemplate<typename _Name, typename ..._Fields>\n\tstruct FieldType {};\n\n\ttemplate<typename _Value, char const ..._szName, typename ..._OtherFields>\n\tstruct FieldType<FieldName<_szName...>, Field<_Value, _szName...>, _OtherFields...> {\n\t\ttypedef _Value Type;\n\t};\n\n\ttemplate<char const ..._szFieldName, typename _FirstField, typename ..._OtherFields>\n\tstruct FieldType<FieldName<_szFieldName...>, _FirstField, _OtherFields...> {\n\t\ttypedef typename FieldType<FieldName<_szFieldName...>, _OtherFields...>::Type Type;\n\t};\n\n\ttemplate<typename ..._Fields>\n\tstruct Object {};\n\n\ttemplate<typename _Field, typename ..._Fields>\n\tstruct Getter {};\n\n\ttemplate<typename _Value, char const ..._szName, typename ..._OtherFields>\n\tstruct Getter<Field<_Value, _szName...>, Field<_Value, _szName...>, _OtherFields...> {\n\t\tinline static _Value &Get(Object<Field<_Value, _szName...>, _OtherFields...> &rObject) {\n\t\t\treturn rObject.m_Value;\n\t\t}\n\n\t\tinline static _Value const &Get(Object<Field<_Value, _szName...>, _OtherFields...> const &rObject) {\n\t\t\treturn rObject.m_Value;\n\t\t}\n\t};\n\n\ttemplate<typename _Value, char const ..._szName, typename _FirstField, typename ..._OtherFields>\n\tstruct Getter<Field<_Value, _szName...>, _FirstField, _OtherFields...> {\n\t\tinline static _Value &Get(Object<_FirstField, _OtherFields...> &rObject) {\n\t\t\treturn Getter<Field<_Value, _szName...>, _OtherFields...>::Get(rObject);\n\t\t}\n\n\t\tinline static _Value const &Get(Object<_FirstField, _OtherFields...> const &rObject) {\n\t\t\treturn Getter<Field<_Value, _szName...>, _FirstField, _OtherFields...>::Get(rObject);\n\t\t}\n\t};\n\n\ttemplate<>\n\tstruct Object<> {\n\t\tObject() {}\n\t\tvirtual ~Object() {}\n\t};\n\n\ttemplate<typename _Value, char const ..._szName, typename ..._OtherFields>\n\tstruct Object<Field<_Value, _szName...>, _OtherFields...> :\n\t\tpublic Object<_OtherFields...>\n\t{\n\t\tstatic char const s_szName[];\n\t\t_Value m_Value;\n\n\t\tObject() {}\n\n\t\tvirtual ~Object() {}\n\n\t\ttemplate<char const ..._szFieldName>\n\t\tinline typename FieldType<FieldName<_szFieldName...>, Field<_Value, _szName...>, _OtherFields...>::Type &Get() {\n\t\t\treturn Getter<\n\t\t\t\tField<typename FieldType<\n\t\t\t\t\tFieldName<_szFieldName...>,\n\t\t\t\t\tField<_Value, _szName...>,\n\t\t\t\t\t_OtherFields...\n\t\t\t\t>::Type, _szFieldName...>,\n\t\t\t\tField<_Value, _szName...>,\n\t\t\t\t_OtherFields...\n\t\t\t>::Get(*this);\n\t\t}\n\n\t\ttemplate<char const ..._szFieldName>\n\t\tinline typename FieldType<FieldName<_szFieldName...>, Field<_Value, _szName...>, _OtherFields...>::Type const &Get() const {\n\t\t\treturn Getter<\n\t\t\t\tField<typename FieldType<\n\t\t\t\t\tFieldName<_szFieldName...>,\n\t\t\t\t\tField<_Value, _szName...>,\n\t\t\t\t\t_OtherFields...\n\t\t\t\t>::Type, _szFieldName...>,\n\t\t\t\tField<_Value, _szName...>,\n\t\t\t\t_OtherFields...\n\t\t\t>::Get(*this);\n\t\t}\n\t};\n\n\ttemplate<typename _Value, char const ..._szName, typename ..._OtherFields>\n\tchar const Object<Field<_Value, _szName...>, _OtherFields...>::s_szName[] = { _szName... };\n\n\ttemplate<typename _Value, char const ..._szName, typename ..._OtherFields>\n\tstruct Object<OptionalField<_Value, _szName...>, _OtherFields...> :\n\t\tpublic Object<_OtherFields...>\n\t{\n\t\tstatic char const s_szName[];\n\t\t_Value m_Value;\n\t\tbool m_fPresent;\n\n\t\tObject()\n\t\t\t:\n\t\tm_fPresent(false) {}\n\n\t\tvirtual ~Object() {}\n\n\t\t\/\/ TODO getters\n\t};\n\n\ttemplate<typename _Value, char const ..._szName, typename ..._OtherFields>\n\tchar const Object<OptionalField<_Value, _szName...>, _OtherFields...>::s_szName[] = { _szName... };\n\n\ttemplate<typename _Type>\n\tstruct Serializer {\n\t\ttemplate<typename _Iterator>\n\t\tstatic _Type Load(_Iterator &ri, _Iterator j);\n\n\t\tstatic string Store(_Type const &r);\n\t};\n\n\ttemplate<>\n\tstruct Serializer<nullptr_t> {\n\t\ttemplate<typename _Iterator>\n\t\tstatic nullptr_t Load(_Iterator &ri, _Iterator j) {\n\t\t\tif (regex_search(ri, j, regex(\"^\\\\s*null\"))) {\n\t\t\t\treturn nullptr;\n\t\t\t} else {\n\t\t\t\tthrow SyntaxError();\n\t\t\t}\n\t\t}\n\n\t\tstatic string Store(nullptr_t const &r) {\n\t\t\treturn \"null\";\n\t\t}\n\t};\n\n\ttemplate<>\n\tstruct Serializer<bool> {\n\t\ttemplate<typename _Iterator>\n\t\tstatic bool Load(_Iterator &ri, _Iterator j) {\n\t\t\t\/\/ TODO\n\t\t\tthrow Error();\n\t\t}\n\n\t\tstatic string Store(bool const &r) {\n\t\t\tif (r) {\n\t\t\t\treturn \"true\";\n\t\t\t} else {\n\t\t\t\treturn \"false\";\n\t\t\t}\n\t\t}\n\t};\n\n\ttemplate<>\n\tstruct Serializer<int> {\n\t\ttemplate<typename _Iterator>\n\t\tstatic int Load(_Iterator &ri, _Iterator j) {\n\t\t\t\/\/ TODO\n\t\t\tthrow Error();\n\t\t}\n\n\t\tstatic string Store(int const &r) {\n\t\t\tostringstream oss;\n\t\t\toss << r;\n\t\t\treturn oss.str();\n\t\t}\n\t};\n\n\ttemplate<>\n\tstruct Serializer<unsigned int> {\n\t\ttemplate<typename _Iterator>\n\t\tstatic unsigned int Load(_Iterator &ri, _Iterator j) {\n\t\t\t\/\/ TODO\n\t\t\tthrow Error();\n\t\t}\n\n\t\tstatic string Store(unsigned int const &r) {\n\t\t\tostringstream oss;\n\t\t\toss << r;\n\t\t\treturn oss.str();\n\t\t}\n\t};\n\n\ttemplate<>\n\tstruct Serializer<double> {\n\t\ttemplate<typename _Iterator>\n\t\tstatic double Load(_Iterator &ri, _Iterator j) {\n\t\t\t\/\/ TODO\n\t\t\tthrow Error();\n\t\t}\n\n\t\tstatic string Store(double const &r) {\n\t\t\tostringstream oss;\n\t\t\toss << r;\n\t\t\treturn oss.str();\n\t\t}\n\t};\n\n\ttemplate<>\n\tstruct Serializer<string> {\n\t\ttemplate<typename _Iterator>\n\t\tstatic string Load(_Iterator &ri, _Iterator j) {\n\t\t\t\/\/ TODO\n\t\t\tthrow Error();\n\t\t}\n\n\t\tstatic string Store(ostream &ros, string const &r) {\n\t\t\treturn \"\\\"\" + r + \"\\\"\"; \/\/ FIXME escape special characters\n\t\t}\n\t};\n\n\ttemplate<typename ..._Fields>\n\tstruct Serializer<Object<_Fields...>> {\n\t\ttemplate<typename _Iterator>\n\t\tstatic Object<_Fields...> Load(_Iterator &ri, _Iterator j) {\n\t\t\t\/\/ TODO\n\t\t\tthrow Error();\n\t\t}\n\t};\n\n\ttemplate<typename _Element>\n\tstruct Serializer<vector<_Element>> {\n\t\ttemplate<typename _Iterator>\n\t\tstatic vector<_Element> Load(_Iterator &ri, _Iterator j) {\n\t\t\t\/\/ TODO\n\t\t\tthrow Error();\n\t\t}\n\t};\n\n\ttemplate<typename _Element, unsigned int _c>\n\tstruct Serializer<array<_Element, _c>> {\n\t\ttemplate<typename _Iterator>\n\t\tstatic array<_Element, _c> Load(_Iterator &ri, _Iterator j) {\n\t\t\t\/\/ TODO\n\t\t\tthrow Error();\n\t\t}\n\t};\n\n\ttemplate<typename _Type>\n\tinline _Type Load(string const &rstr) {\n\t\treturn Serializer<_Type>::Load(rstr.begin(), rstr.end());\n\t}\n\n\ttemplate<typename _Type>\n\tinline _Type Load(istream &ris) {\n\t\tstring const str = string(istreambuf_iterator<char>(ris), istreambuf_iterator<char>());\n\t\tauto it = str.begin();\n\t\treturn Serializer<_Type>::Load(it, str.end());\n\t}\n\n\ttemplate<typename _Type>\n\tinline string Store(_Type const &r) {\n\t\treturn Serializer<_Type>::Store(r);\n\t}\n\n\ttemplate<typename _Type>\n\tinline ostream &Store(ostream &ros, _Type const &r) {\n\t\treturn ros << Serializer<_Type>::Store(r);\n\t}\n}\n\ntemplate<typename ..._Fields>\ninline std::istream &operator >> (std::istream &ris, JSON::Object<_Fields...> &rObject) {\n\trObject = JSON::Load<JSON::Object<_Fields...>>(ris);\n\treturn ris;\n}\n\ntemplate<typename ..._Fields>\ninline std::ostream &operator << (std::ostream &ros, JSON::Object<_Fields...> &rObject) {\n\treturn JSON::Store<JSON::Object<_Fields...>>(ros, rObject);\n}\n\n#define JSON_CHAR(sz, i) ((i) < sizeof(sz)) ? (sz)[i] : 0\n#define JSON_UNPACK(sz) \\\n\tJSON_CHAR((sz), 0), \\\n\tJSON_CHAR((sz), 1), \\\n\tJSON_CHAR((sz), 2), \\\n\tJSON_CHAR((sz), 3), \\\n\tJSON_CHAR((sz), 4), \\\n\tJSON_CHAR((sz), 5), \\\n\tJSON_CHAR((sz), 6), \\\n\tJSON_CHAR((sz), 7), \\\n\tJSON_CHAR((sz), 8), \\\n\tJSON_CHAR((sz), 9), \\\n\tJSON_CHAR((sz), 10), \\\n\tJSON_CHAR((sz), 11), \\\n\tJSON_CHAR((sz), 12), \\\n\tJSON_CHAR((sz), 13), \\\n\tJSON_CHAR((sz), 14), \\\n\tJSON_CHAR((sz), 15), \\\n\tJSON_CHAR((sz), 16), \\\n\tJSON_CHAR((sz), 17), \\\n\tJSON_CHAR((sz), 18), \\\n\tJSON_CHAR((sz), 19), \\\n\tJSON_CHAR((sz), 20), \\\n\tJSON_CHAR((sz), 21), \\\n\tJSON_CHAR((sz), 22), \\\n\tJSON_CHAR((sz), 23), \\\n\tJSON_CHAR((sz), 24), \\\n\tJSON_CHAR((sz), 25), \\\n\tJSON_CHAR((sz), 26), \\\n\tJSON_CHAR((sz), 27), \\\n\tJSON_CHAR((sz), 28), \\\n\tJSON_CHAR((sz), 29), \\\n\tJSON_CHAR((sz), 30), \\\n\tJSON_CHAR((sz), 31), \\\n\tJSON_CHAR((sz), 32), \\\n\tJSON_CHAR((sz), 33), \\\n\tJSON_CHAR((sz), 34), \\\n\tJSON_CHAR((sz), 35), \\\n\tJSON_CHAR((sz), 36), \\\n\tJSON_CHAR((sz), 37), \\\n\tJSON_CHAR((sz), 38), \\\n\tJSON_CHAR((sz), 39), \\\n\tJSON_CHAR((sz), 40), \\\n\tJSON_CHAR((sz), 41), \\\n\tJSON_CHAR((sz), 42), \\\n\tJSON_CHAR((sz), 43), \\\n\tJSON_CHAR((sz), 44), \\\n\tJSON_CHAR((sz), 45), \\\n\tJSON_CHAR((sz), 46), \\\n\tJSON_CHAR((sz), 47), \\\n\tJSON_CHAR((sz), 48), \\\n\tJSON_CHAR((sz), 49), \\\n\tJSON_CHAR((sz), 50), \\\n\tJSON_CHAR((sz), 51), \\\n\tJSON_CHAR((sz), 52), \\\n\tJSON_CHAR((sz), 53), \\\n\tJSON_CHAR((sz), 54), \\\n\tJSON_CHAR((sz), 55), \\\n\tJSON_CHAR((sz), 56), \\\n\tJSON_CHAR((sz), 57), \\\n\tJSON_CHAR((sz), 58), \\\n\tJSON_CHAR((sz), 59), \\\n\tJSON_CHAR((sz), 60), \\\n\tJSON_CHAR((sz), 61), \\\n\tJSON_CHAR((sz), 62), \\\n\tJSON_CHAR((sz), 63), \\\n\tJSON_CHAR((sz), 64), \\\n\tJSON_CHAR((sz), 65), \\\n\tJSON_CHAR((sz), 66), \\\n\tJSON_CHAR((sz), 67), \\\n\tJSON_CHAR((sz), 68), \\\n\tJSON_CHAR((sz), 69), \\\n\tJSON_CHAR((sz), 70), \\\n\tJSON_CHAR((sz), 71), \\\n\tJSON_CHAR((sz), 72), \\\n\tJSON_CHAR((sz), 73), \\\n\tJSON_CHAR((sz), 74), \\\n\tJSON_CHAR((sz), 75), \\\n\tJSON_CHAR((sz), 76), \\\n\tJSON_CHAR((sz), 77), \\\n\tJSON_CHAR((sz), 78), \\\n\tJSON_CHAR((sz), 79), \\\n\tJSON_CHAR((sz), 80), \\\n\tJSON_CHAR((sz), 81), \\\n\tJSON_CHAR((sz), 82), \\\n\tJSON_CHAR((sz), 83), \\\n\tJSON_CHAR((sz), 84), \\\n\tJSON_CHAR((sz), 85), \\\n\tJSON_CHAR((sz), 86), \\\n\tJSON_CHAR((sz), 87), \\\n\tJSON_CHAR((sz), 88), \\\n\tJSON_CHAR((sz), 89), \\\n\tJSON_CHAR((sz), 90), \\\n\tJSON_CHAR((sz), 91), \\\n\tJSON_CHAR((sz), 92), \\\n\tJSON_CHAR((sz), 93), \\\n\tJSON_CHAR((sz), 94), \\\n\tJSON_CHAR((sz), 95), \\\n\tJSON_CHAR((sz), 96), \\\n\tJSON_CHAR((sz), 97), \\\n\tJSON_CHAR((sz), 98), \\\n\tJSON_CHAR((sz), 99)\n\n#define UNPACK JSON_UNPACK\n\n#endif\n<|endoftext|>"} {"text":"<commit_before>1fb54736-2e4d-11e5-9284-b827eb9e62be<commit_msg>1fba49ca-2e4d-11e5-9284-b827eb9e62be<commit_after>1fba49ca-2e4d-11e5-9284-b827eb9e62be<|endoftext|>"} {"text":"<commit_before>75f186ea-2e4e-11e5-9284-b827eb9e62be<commit_msg>75f68e92-2e4e-11e5-9284-b827eb9e62be<commit_after>75f68e92-2e4e-11e5-9284-b827eb9e62be<|endoftext|>"} {"text":"<commit_before>0670ce8a-2e4d-11e5-9284-b827eb9e62be<commit_msg>0675e7f8-2e4d-11e5-9284-b827eb9e62be<commit_after>0675e7f8-2e4d-11e5-9284-b827eb9e62be<|endoftext|>"} {"text":"<commit_before>0bbd6308-2e4d-11e5-9284-b827eb9e62be<commit_msg>0be2b04a-2e4d-11e5-9284-b827eb9e62be<commit_after>0be2b04a-2e4d-11e5-9284-b827eb9e62be<|endoftext|>"} {"text":"<commit_before>efda0e6a-2e4d-11e5-9284-b827eb9e62be<commit_msg>efdf0488-2e4d-11e5-9284-b827eb9e62be<commit_after>efdf0488-2e4d-11e5-9284-b827eb9e62be<|endoftext|>"} {"text":"<commit_before>8aa1876c-2e4d-11e5-9284-b827eb9e62be<commit_msg>8aa6a5da-2e4d-11e5-9284-b827eb9e62be<commit_after>8aa6a5da-2e4d-11e5-9284-b827eb9e62be<|endoftext|>"} {"text":"<commit_before>f24714aa-2e4c-11e5-9284-b827eb9e62be<commit_msg>f24c1e14-2e4c-11e5-9284-b827eb9e62be<commit_after>f24c1e14-2e4c-11e5-9284-b827eb9e62be<|endoftext|>"} {"text":"<commit_before>d9924414-2e4e-11e5-9284-b827eb9e62be<commit_msg>d9973da2-2e4e-11e5-9284-b827eb9e62be<commit_after>d9973da2-2e4e-11e5-9284-b827eb9e62be<|endoftext|>"} {"text":"<commit_before>d7ed3308-2e4e-11e5-9284-b827eb9e62be<commit_msg>d7f22e4e-2e4e-11e5-9284-b827eb9e62be<commit_after>d7f22e4e-2e4e-11e5-9284-b827eb9e62be<|endoftext|>"} {"text":"<commit_before>251e211e-2e4f-11e5-9284-b827eb9e62be<commit_msg>25231c32-2e4f-11e5-9284-b827eb9e62be<commit_after>25231c32-2e4f-11e5-9284-b827eb9e62be<|endoftext|>"} {"text":"<commit_before>55c27a56-2e4d-11e5-9284-b827eb9e62be<commit_msg>55c790a4-2e4d-11e5-9284-b827eb9e62be<commit_after>55c790a4-2e4d-11e5-9284-b827eb9e62be<|endoftext|>"} {"text":"<commit_before>451a5084-2e4d-11e5-9284-b827eb9e62be<commit_msg>451f477e-2e4d-11e5-9284-b827eb9e62be<commit_after>451f477e-2e4d-11e5-9284-b827eb9e62be<|endoftext|>"} {"text":"<commit_before>b7170772-2e4d-11e5-9284-b827eb9e62be<commit_msg>b71c043e-2e4d-11e5-9284-b827eb9e62be<commit_after>b71c043e-2e4d-11e5-9284-b827eb9e62be<|endoftext|>"} {"text":"<commit_before>a3973fd2-2e4d-11e5-9284-b827eb9e62be<commit_msg>a39c3d5c-2e4d-11e5-9284-b827eb9e62be<commit_after>a39c3d5c-2e4d-11e5-9284-b827eb9e62be<|endoftext|>"} {"text":"<commit_before>49447e2c-2e4e-11e5-9284-b827eb9e62be<commit_msg>49497274-2e4e-11e5-9284-b827eb9e62be<commit_after>49497274-2e4e-11e5-9284-b827eb9e62be<|endoftext|>"} {"text":"<commit_before>2d30a9b2-2e4f-11e5-9284-b827eb9e62be<commit_msg>2d35f872-2e4f-11e5-9284-b827eb9e62be<commit_after>2d35f872-2e4f-11e5-9284-b827eb9e62be<|endoftext|>"} {"text":"<commit_before>eaa077da-2e4e-11e5-9284-b827eb9e62be<commit_msg>eaa5a5b6-2e4e-11e5-9284-b827eb9e62be<commit_after>eaa5a5b6-2e4e-11e5-9284-b827eb9e62be<|endoftext|>"} {"text":"<commit_before>95ce80fe-2e4d-11e5-9284-b827eb9e62be<commit_msg>95d383ec-2e4d-11e5-9284-b827eb9e62be<commit_after>95d383ec-2e4d-11e5-9284-b827eb9e62be<|endoftext|>"} {"text":"<commit_before>c0b60462-2e4e-11e5-9284-b827eb9e62be<commit_msg>c0bafea4-2e4e-11e5-9284-b827eb9e62be<commit_after>c0bafea4-2e4e-11e5-9284-b827eb9e62be<|endoftext|>"} {"text":"<commit_before>5e00b782-2e4d-11e5-9284-b827eb9e62be<commit_msg>5e05bbba-2e4d-11e5-9284-b827eb9e62be<commit_after>5e05bbba-2e4d-11e5-9284-b827eb9e62be<|endoftext|>"} {"text":"<commit_before>574d0bec-2e4e-11e5-9284-b827eb9e62be<commit_msg>5752279e-2e4e-11e5-9284-b827eb9e62be<commit_after>5752279e-2e4e-11e5-9284-b827eb9e62be<|endoftext|>"} {"text":"<commit_before>763b2940-2e4d-11e5-9284-b827eb9e62be<commit_msg>764016c6-2e4d-11e5-9284-b827eb9e62be<commit_after>764016c6-2e4d-11e5-9284-b827eb9e62be<|endoftext|>"} {"text":"<commit_before>b0562626-2e4c-11e5-9284-b827eb9e62be<commit_msg>b05b17ee-2e4c-11e5-9284-b827eb9e62be<commit_after>b05b17ee-2e4c-11e5-9284-b827eb9e62be<|endoftext|>"} {"text":"<commit_before>f0ae80f4-2e4e-11e5-9284-b827eb9e62be<commit_msg>f0b38036-2e4e-11e5-9284-b827eb9e62be<commit_after>f0b38036-2e4e-11e5-9284-b827eb9e62be<|endoftext|>"} {"text":"<commit_before>7862d898-2e4e-11e5-9284-b827eb9e62be<commit_msg>7867ea22-2e4e-11e5-9284-b827eb9e62be<commit_after>7867ea22-2e4e-11e5-9284-b827eb9e62be<|endoftext|>"} {"text":"<commit_before>331db70c-2e4f-11e5-9284-b827eb9e62be<commit_msg>332f0a0c-2e4f-11e5-9284-b827eb9e62be<commit_after>332f0a0c-2e4f-11e5-9284-b827eb9e62be<|endoftext|>"} {"text":"<commit_before>9bda9176-2e4e-11e5-9284-b827eb9e62be<commit_msg>9bdf8c62-2e4e-11e5-9284-b827eb9e62be<commit_after>9bdf8c62-2e4e-11e5-9284-b827eb9e62be<|endoftext|>"} {"text":"<commit_before>63a411fc-2e4d-11e5-9284-b827eb9e62be<commit_msg>63a918e6-2e4d-11e5-9284-b827eb9e62be<commit_after>63a918e6-2e4d-11e5-9284-b827eb9e62be<|endoftext|>"} {"text":"<commit_before>b19c1494-2e4e-11e5-9284-b827eb9e62be<commit_msg>b1a13708-2e4e-11e5-9284-b827eb9e62be<commit_after>b1a13708-2e4e-11e5-9284-b827eb9e62be<|endoftext|>"} {"text":"<commit_before>3c7e9f8c-2e4f-11e5-9284-b827eb9e62be<commit_msg>3c83991a-2e4f-11e5-9284-b827eb9e62be<commit_after>3c83991a-2e4f-11e5-9284-b827eb9e62be<|endoftext|>"} {"text":"<commit_before>dd0a2918-2e4e-11e5-9284-b827eb9e62be<commit_msg>dd0f203a-2e4e-11e5-9284-b827eb9e62be<commit_after>dd0f203a-2e4e-11e5-9284-b827eb9e62be<|endoftext|>"} {"text":"<commit_before>0a4ffef4-2e4d-11e5-9284-b827eb9e62be<commit_msg>0a550c50-2e4d-11e5-9284-b827eb9e62be<commit_after>0a550c50-2e4d-11e5-9284-b827eb9e62be<|endoftext|>"} {"text":"<commit_before>be0d81cc-2e4e-11e5-9284-b827eb9e62be<commit_msg>be129284-2e4e-11e5-9284-b827eb9e62be<commit_after>be129284-2e4e-11e5-9284-b827eb9e62be<|endoftext|>"} {"text":"<commit_before>4abb3b74-2e4e-11e5-9284-b827eb9e62be<commit_msg>4ac03232-2e4e-11e5-9284-b827eb9e62be<commit_after>4ac03232-2e4e-11e5-9284-b827eb9e62be<|endoftext|>"} {"text":"<commit_before>3feafc3a-2e4d-11e5-9284-b827eb9e62be<commit_msg>3ff0066c-2e4d-11e5-9284-b827eb9e62be<commit_after>3ff0066c-2e4d-11e5-9284-b827eb9e62be<|endoftext|>"} {"text":"<commit_before>f1e6b0a6-2e4c-11e5-9284-b827eb9e62be<commit_msg>f1ebbd26-2e4c-11e5-9284-b827eb9e62be<commit_after>f1ebbd26-2e4c-11e5-9284-b827eb9e62be<|endoftext|>"} {"text":"<commit_before>087050d8-2e4e-11e5-9284-b827eb9e62be<commit_msg>087ba834-2e4e-11e5-9284-b827eb9e62be<commit_after>087ba834-2e4e-11e5-9284-b827eb9e62be<|endoftext|>"} {"text":"<commit_before>70759b2a-2e4e-11e5-9284-b827eb9e62be<commit_msg>707a9774-2e4e-11e5-9284-b827eb9e62be<commit_after>707a9774-2e4e-11e5-9284-b827eb9e62be<|endoftext|>"} {"text":"<commit_before>edbf8ba0-2e4d-11e5-9284-b827eb9e62be<commit_msg>edc483da-2e4d-11e5-9284-b827eb9e62be<commit_after>edc483da-2e4d-11e5-9284-b827eb9e62be<|endoftext|>"} {"text":"<commit_before>febd89a8-2e4c-11e5-9284-b827eb9e62be<commit_msg>fec280de-2e4c-11e5-9284-b827eb9e62be<commit_after>fec280de-2e4c-11e5-9284-b827eb9e62be<|endoftext|>"} {"text":"<commit_before>c75df42e-2e4d-11e5-9284-b827eb9e62be<commit_msg>c762ef74-2e4d-11e5-9284-b827eb9e62be<commit_after>c762ef74-2e4d-11e5-9284-b827eb9e62be<|endoftext|>"} {"text":"<commit_before>3a85259a-2e4d-11e5-9284-b827eb9e62be<commit_msg>3a8a3bb6-2e4d-11e5-9284-b827eb9e62be<commit_after>3a8a3bb6-2e4d-11e5-9284-b827eb9e62be<|endoftext|>"} {"text":"<commit_before>4b5a0246-2e4d-11e5-9284-b827eb9e62be<commit_msg>4b5f2370-2e4d-11e5-9284-b827eb9e62be<commit_after>4b5f2370-2e4d-11e5-9284-b827eb9e62be<|endoftext|>"} {"text":"<commit_before>e1060c4a-2e4d-11e5-9284-b827eb9e62be<commit_msg>e10b15aa-2e4d-11e5-9284-b827eb9e62be<commit_after>e10b15aa-2e4d-11e5-9284-b827eb9e62be<|endoftext|>"} {"text":"<commit_before>b1c9a180-2e4d-11e5-9284-b827eb9e62be<commit_msg>b1ce9578-2e4d-11e5-9284-b827eb9e62be<commit_after>b1ce9578-2e4d-11e5-9284-b827eb9e62be<|endoftext|>"} {"text":"<commit_before>d2d8ede0-2e4d-11e5-9284-b827eb9e62be<commit_msg>d2de000a-2e4d-11e5-9284-b827eb9e62be<commit_after>d2de000a-2e4d-11e5-9284-b827eb9e62be<|endoftext|>"} {"text":"<commit_before>8a9753aa-2e4d-11e5-9284-b827eb9e62be<commit_msg>8a9c6c82-2e4d-11e5-9284-b827eb9e62be<commit_after>8a9c6c82-2e4d-11e5-9284-b827eb9e62be<|endoftext|>"} {"text":"<commit_before>e74805da-2e4e-11e5-9284-b827eb9e62be<commit_msg>e74d30aa-2e4e-11e5-9284-b827eb9e62be<commit_after>e74d30aa-2e4e-11e5-9284-b827eb9e62be<|endoftext|>"} {"text":"<commit_before>d0d5e04c-2e4e-11e5-9284-b827eb9e62be<commit_msg>d0dadbe2-2e4e-11e5-9284-b827eb9e62be<commit_after>d0dadbe2-2e4e-11e5-9284-b827eb9e62be<|endoftext|>"} {"text":"<commit_before>35b040fc-2e4f-11e5-9284-b827eb9e62be<commit_msg>35b53cc4-2e4f-11e5-9284-b827eb9e62be<commit_after>35b53cc4-2e4f-11e5-9284-b827eb9e62be<|endoftext|>"} {"text":"<commit_before>aaa24dac-2e4e-11e5-9284-b827eb9e62be<commit_msg>aaa74762-2e4e-11e5-9284-b827eb9e62be<commit_after>aaa74762-2e4e-11e5-9284-b827eb9e62be<|endoftext|>"} {"text":"<commit_before>53fd5b46-2e4d-11e5-9284-b827eb9e62be<commit_msg>540255b0-2e4d-11e5-9284-b827eb9e62be<commit_after>540255b0-2e4d-11e5-9284-b827eb9e62be<|endoftext|>"} {"text":"<commit_before>4da2952c-2e4d-11e5-9284-b827eb9e62be<commit_msg>4da7c2b8-2e4d-11e5-9284-b827eb9e62be<commit_after>4da7c2b8-2e4d-11e5-9284-b827eb9e62be<|endoftext|>"} {"text":"<commit_before>1cfb37ec-2e4f-11e5-9284-b827eb9e62be<commit_msg>1d004818-2e4f-11e5-9284-b827eb9e62be<commit_after>1d004818-2e4f-11e5-9284-b827eb9e62be<|endoftext|>"} {"text":"<commit_before>7568c54e-2e4e-11e5-9284-b827eb9e62be<commit_msg>756dd2be-2e4e-11e5-9284-b827eb9e62be<commit_after>756dd2be-2e4e-11e5-9284-b827eb9e62be<|endoftext|>"} {"text":"<commit_before>d0a8a244-2e4e-11e5-9284-b827eb9e62be<commit_msg>d0aded12-2e4e-11e5-9284-b827eb9e62be<commit_after>d0aded12-2e4e-11e5-9284-b827eb9e62be<|endoftext|>"} {"text":"<commit_before>3c79540c-2e4d-11e5-9284-b827eb9e62be<commit_msg>3c7e50e2-2e4d-11e5-9284-b827eb9e62be<commit_after>3c7e50e2-2e4d-11e5-9284-b827eb9e62be<|endoftext|>"} {"text":"<commit_before>7c32f12a-2e4d-11e5-9284-b827eb9e62be<commit_msg>7c37e46e-2e4d-11e5-9284-b827eb9e62be<commit_after>7c37e46e-2e4d-11e5-9284-b827eb9e62be<|endoftext|>"} {"text":"<commit_before>d594afaa-2e4e-11e5-9284-b827eb9e62be<commit_msg>d599be32-2e4e-11e5-9284-b827eb9e62be<commit_after>d599be32-2e4e-11e5-9284-b827eb9e62be<|endoftext|>"} {"text":"<commit_before>108cae42-2e4e-11e5-9284-b827eb9e62be<commit_msg>1091a528-2e4e-11e5-9284-b827eb9e62be<commit_after>1091a528-2e4e-11e5-9284-b827eb9e62be<|endoftext|>"} {"text":"<commit_before>c8214136-2e4d-11e5-9284-b827eb9e62be<commit_msg>c82635e2-2e4d-11e5-9284-b827eb9e62be<commit_after>c82635e2-2e4d-11e5-9284-b827eb9e62be<|endoftext|>"} {"text":"<commit_before>0747ca6e-2e4f-11e5-9284-b827eb9e62be<commit_msg>074cbdbc-2e4f-11e5-9284-b827eb9e62be<commit_after>074cbdbc-2e4f-11e5-9284-b827eb9e62be<|endoftext|>"} {"text":"<commit_before>98b7d3d2-2e4e-11e5-9284-b827eb9e62be<commit_msg>98c7d3b8-2e4e-11e5-9284-b827eb9e62be<commit_after>98c7d3b8-2e4e-11e5-9284-b827eb9e62be<|endoftext|>"} {"text":"<commit_before>ee4ae3d4-2e4e-11e5-9284-b827eb9e62be<commit_msg>ee4fe122-2e4e-11e5-9284-b827eb9e62be<commit_after>ee4fe122-2e4e-11e5-9284-b827eb9e62be<|endoftext|>"} {"text":"<commit_before>dd28d5cc-2e4c-11e5-9284-b827eb9e62be<commit_msg>dd2dc992-2e4c-11e5-9284-b827eb9e62be<commit_after>dd2dc992-2e4c-11e5-9284-b827eb9e62be<|endoftext|>"} {"text":"<commit_before>e6ccfde2-2e4c-11e5-9284-b827eb9e62be<commit_msg>e6d1f28e-2e4c-11e5-9284-b827eb9e62be<commit_after>e6d1f28e-2e4c-11e5-9284-b827eb9e62be<|endoftext|>"} {"text":"<commit_before>b4c6d25a-2e4c-11e5-9284-b827eb9e62be<commit_msg>b4cbdf84-2e4c-11e5-9284-b827eb9e62be<commit_after>b4cbdf84-2e4c-11e5-9284-b827eb9e62be<|endoftext|>"} {"text":"<commit_before>ffac6f0a-2e4c-11e5-9284-b827eb9e62be<commit_msg>ffb1673a-2e4c-11e5-9284-b827eb9e62be<commit_after>ffb1673a-2e4c-11e5-9284-b827eb9e62be<|endoftext|>"} {"text":"<commit_before>3583603c-2e4f-11e5-9284-b827eb9e62be<commit_msg>358854a2-2e4f-11e5-9284-b827eb9e62be<commit_after>358854a2-2e4f-11e5-9284-b827eb9e62be<|endoftext|>"} {"text":"<commit_before>549329fa-2e4d-11e5-9284-b827eb9e62be<commit_msg>54982b58-2e4d-11e5-9284-b827eb9e62be<commit_after>54982b58-2e4d-11e5-9284-b827eb9e62be<|endoftext|>"} {"text":"<commit_before>444daa92-2e4e-11e5-9284-b827eb9e62be<commit_msg>445301e0-2e4e-11e5-9284-b827eb9e62be<commit_after>445301e0-2e4e-11e5-9284-b827eb9e62be<|endoftext|>"} {"text":"<commit_before>e7e8ebe6-2e4c-11e5-9284-b827eb9e62be<commit_msg>e7eddbec-2e4c-11e5-9284-b827eb9e62be<commit_after>e7eddbec-2e4c-11e5-9284-b827eb9e62be<|endoftext|>"} {"text":"<commit_before>e9fe4268-2e4d-11e5-9284-b827eb9e62be<commit_msg>ea033fa2-2e4d-11e5-9284-b827eb9e62be<commit_after>ea033fa2-2e4d-11e5-9284-b827eb9e62be<|endoftext|>"} {"text":"<commit_before>2f942adc-2e4d-11e5-9284-b827eb9e62be<commit_msg>2f992690-2e4d-11e5-9284-b827eb9e62be<commit_after>2f992690-2e4d-11e5-9284-b827eb9e62be<|endoftext|>"} {"text":"<commit_before>6012ed0a-2e4e-11e5-9284-b827eb9e62be<commit_msg>6018045c-2e4e-11e5-9284-b827eb9e62be<commit_after>6018045c-2e4e-11e5-9284-b827eb9e62be<|endoftext|>"} {"text":"<commit_before>cf66f41c-2e4e-11e5-9284-b827eb9e62be<commit_msg>cf6c0268-2e4e-11e5-9284-b827eb9e62be<commit_after>cf6c0268-2e4e-11e5-9284-b827eb9e62be<|endoftext|>"} {"text":"<commit_before>64224e46-2e4d-11e5-9284-b827eb9e62be<commit_msg>64277d8a-2e4d-11e5-9284-b827eb9e62be<commit_after>64277d8a-2e4d-11e5-9284-b827eb9e62be<|endoftext|>"} {"text":"<commit_before>ee1973fe-2e4d-11e5-9284-b827eb9e62be<commit_msg>ee1e6e0e-2e4d-11e5-9284-b827eb9e62be<commit_after>ee1e6e0e-2e4d-11e5-9284-b827eb9e62be<|endoftext|>"} {"text":"<commit_before>ccd400c4-2e4d-11e5-9284-b827eb9e62be<commit_msg>ccd8ff5c-2e4d-11e5-9284-b827eb9e62be<commit_after>ccd8ff5c-2e4d-11e5-9284-b827eb9e62be<|endoftext|>"} {"text":"<commit_before>156324aa-2e4e-11e5-9284-b827eb9e62be<commit_msg>15681438-2e4e-11e5-9284-b827eb9e62be<commit_after>15681438-2e4e-11e5-9284-b827eb9e62be<|endoftext|>"} {"text":"<commit_before>20050b4a-2e4d-11e5-9284-b827eb9e62be<commit_msg>200a4308-2e4d-11e5-9284-b827eb9e62be<commit_after>200a4308-2e4d-11e5-9284-b827eb9e62be<|endoftext|>"} {"text":"<commit_before>680ef644-2e4d-11e5-9284-b827eb9e62be<commit_msg>6814099a-2e4d-11e5-9284-b827eb9e62be<commit_after>6814099a-2e4d-11e5-9284-b827eb9e62be<|endoftext|>"} {"text":"<commit_before>733c90f8-2e4d-11e5-9284-b827eb9e62be<commit_msg>7341811c-2e4d-11e5-9284-b827eb9e62be<commit_after>7341811c-2e4d-11e5-9284-b827eb9e62be<|endoftext|>"} {"text":"<commit_before>beab0e30-2e4c-11e5-9284-b827eb9e62be<commit_msg>beb008e0-2e4c-11e5-9284-b827eb9e62be<commit_after>beb008e0-2e4c-11e5-9284-b827eb9e62be<|endoftext|>"} {"text":"<commit_before>2c37c2d4-2e4f-11e5-9284-b827eb9e62be<commit_msg>2c3cbbf4-2e4f-11e5-9284-b827eb9e62be<commit_after>2c3cbbf4-2e4f-11e5-9284-b827eb9e62be<|endoftext|>"} {"text":"<commit_before>462c5e7c-2e4d-11e5-9284-b827eb9e62be<commit_msg>46315c06-2e4d-11e5-9284-b827eb9e62be<commit_after>46315c06-2e4d-11e5-9284-b827eb9e62be<|endoftext|>"} {"text":"<commit_before>ce548cd8-2e4e-11e5-9284-b827eb9e62be<commit_msg>ce599336-2e4e-11e5-9284-b827eb9e62be<commit_after>ce599336-2e4e-11e5-9284-b827eb9e62be<|endoftext|>"} {"text":"<commit_before>021bcb12-2e4f-11e5-9284-b827eb9e62be<commit_msg>0220cf22-2e4f-11e5-9284-b827eb9e62be<commit_after>0220cf22-2e4f-11e5-9284-b827eb9e62be<|endoftext|>"} {"text":"<commit_before>1750fb08-2e4d-11e5-9284-b827eb9e62be<commit_msg>17560814-2e4d-11e5-9284-b827eb9e62be<commit_after>17560814-2e4d-11e5-9284-b827eb9e62be<|endoftext|>"} {"text":"<commit_before>63bde6f8-2e4e-11e5-9284-b827eb9e62be<commit_msg>63c34c1a-2e4e-11e5-9284-b827eb9e62be<commit_after>63c34c1a-2e4e-11e5-9284-b827eb9e62be<|endoftext|>"} {"text":"<commit_before>8bd23fea-2e4e-11e5-9284-b827eb9e62be<commit_msg>8bd74dc8-2e4e-11e5-9284-b827eb9e62be<commit_after>8bd74dc8-2e4e-11e5-9284-b827eb9e62be<|endoftext|>"} {"text":"<commit_before>0a643266-2e4d-11e5-9284-b827eb9e62be<commit_msg>0a69417a-2e4d-11e5-9284-b827eb9e62be<commit_after>0a69417a-2e4d-11e5-9284-b827eb9e62be<|endoftext|>"} {"text":"<commit_before>95f6e9c2-2e4d-11e5-9284-b827eb9e62be<commit_msg>95fbf4a8-2e4d-11e5-9284-b827eb9e62be<commit_after>95fbf4a8-2e4d-11e5-9284-b827eb9e62be<|endoftext|>"} {"text":"<commit_before>bc96c5bc-2e4c-11e5-9284-b827eb9e62be<commit_msg>bc9baf3c-2e4c-11e5-9284-b827eb9e62be<commit_after>bc9baf3c-2e4c-11e5-9284-b827eb9e62be<|endoftext|>"} {"text":"<commit_before>4b5f2370-2e4d-11e5-9284-b827eb9e62be<commit_msg>4b6445b2-2e4d-11e5-9284-b827eb9e62be<commit_after>4b6445b2-2e4d-11e5-9284-b827eb9e62be<|endoftext|>"} {"text":"<commit_before>ba94b7d6-2e4e-11e5-9284-b827eb9e62be<commit_msg>ba99c5aa-2e4e-11e5-9284-b827eb9e62be<commit_after>ba99c5aa-2e4e-11e5-9284-b827eb9e62be<|endoftext|>"} {"text":"<commit_before>624e7e3c-2e4d-11e5-9284-b827eb9e62be<commit_msg>625382ba-2e4d-11e5-9284-b827eb9e62be<commit_after>625382ba-2e4d-11e5-9284-b827eb9e62be<|endoftext|>"} {"text":"<commit_before>ac380eec-2e4c-11e5-9284-b827eb9e62be<commit_msg>ac3d0032-2e4c-11e5-9284-b827eb9e62be<commit_after>ac3d0032-2e4c-11e5-9284-b827eb9e62be<|endoftext|>"} {"text":"<commit_before>970f40ec-2e4e-11e5-9284-b827eb9e62be<commit_msg>9714553c-2e4e-11e5-9284-b827eb9e62be<commit_after>9714553c-2e4e-11e5-9284-b827eb9e62be<|endoftext|>"} {"text":"<commit_before>71af4680-2e4e-11e5-9284-b827eb9e62be<commit_msg>71b43c12-2e4e-11e5-9284-b827eb9e62be<commit_after>71b43c12-2e4e-11e5-9284-b827eb9e62be<|endoftext|>"} {"text":"<commit_before>43f03b4c-2e4d-11e5-9284-b827eb9e62be<commit_msg>43f53b7e-2e4d-11e5-9284-b827eb9e62be<commit_after>43f53b7e-2e4d-11e5-9284-b827eb9e62be<|endoftext|>"} {"text":"<commit_before>d53a065a-2e4d-11e5-9284-b827eb9e62be<commit_msg>d53f09a2-2e4d-11e5-9284-b827eb9e62be<commit_after>d53f09a2-2e4d-11e5-9284-b827eb9e62be<|endoftext|>"} {"text":"<commit_before>9b6bb572-2e4d-11e5-9284-b827eb9e62be<commit_msg>9b70a686-2e4d-11e5-9284-b827eb9e62be<commit_after>9b70a686-2e4d-11e5-9284-b827eb9e62be<|endoftext|>"} {"text":"<commit_before>bbf02fa2-2e4e-11e5-9284-b827eb9e62be<commit_msg>bbf547d0-2e4e-11e5-9284-b827eb9e62be<commit_after>bbf547d0-2e4e-11e5-9284-b827eb9e62be<|endoftext|>"} {"text":"<commit_before>43dc3a2a-2e4d-11e5-9284-b827eb9e62be<commit_msg>43e13e76-2e4d-11e5-9284-b827eb9e62be<commit_after>43e13e76-2e4d-11e5-9284-b827eb9e62be<|endoftext|>"} {"text":"<commit_before>fda197bc-2e4c-11e5-9284-b827eb9e62be<commit_msg>fda693a2-2e4c-11e5-9284-b827eb9e62be<commit_after>fda693a2-2e4c-11e5-9284-b827eb9e62be<|endoftext|>"} {"text":"<commit_before>84e583f0-2e4d-11e5-9284-b827eb9e62be<commit_msg>84ea78ce-2e4d-11e5-9284-b827eb9e62be<commit_after>84ea78ce-2e4d-11e5-9284-b827eb9e62be<|endoftext|>"} {"text":"<commit_before>3f15076a-2e4d-11e5-9284-b827eb9e62be<commit_msg>3f1a1818-2e4d-11e5-9284-b827eb9e62be<commit_after>3f1a1818-2e4d-11e5-9284-b827eb9e62be<|endoftext|>"} {"text":"<commit_before>2f67ed0e-2e4e-11e5-9284-b827eb9e62be<commit_msg>2f6d001e-2e4e-11e5-9284-b827eb9e62be<commit_after>2f6d001e-2e4e-11e5-9284-b827eb9e62be<|endoftext|>"} {"text":"<commit_before>507e79d2-2e4d-11e5-9284-b827eb9e62be<commit_msg>50838cba-2e4d-11e5-9284-b827eb9e62be<commit_after>50838cba-2e4d-11e5-9284-b827eb9e62be<|endoftext|>"} {"text":"<commit_before>20f7ddf6-2e4e-11e5-9284-b827eb9e62be<commit_msg>20fceb70-2e4e-11e5-9284-b827eb9e62be<commit_after>20fceb70-2e4e-11e5-9284-b827eb9e62be<|endoftext|>"} {"text":"<commit_before>d42d70e4-2e4d-11e5-9284-b827eb9e62be<commit_msg>d4326e64-2e4d-11e5-9284-b827eb9e62be<commit_after>d4326e64-2e4d-11e5-9284-b827eb9e62be<|endoftext|>"} {"text":"<commit_before>0b16e66c-2e4e-11e5-9284-b827eb9e62be<commit_msg>0b1be130-2e4e-11e5-9284-b827eb9e62be<commit_after>0b1be130-2e4e-11e5-9284-b827eb9e62be<|endoftext|>"} {"text":"<commit_before>adaad994-2e4c-11e5-9284-b827eb9e62be<commit_msg>adafc828-2e4c-11e5-9284-b827eb9e62be<commit_after>adafc828-2e4c-11e5-9284-b827eb9e62be<|endoftext|>"} {"text":"<commit_before>cb6f26dc-2e4d-11e5-9284-b827eb9e62be<commit_msg>cb74206a-2e4d-11e5-9284-b827eb9e62be<commit_after>cb74206a-2e4d-11e5-9284-b827eb9e62be<|endoftext|>"} {"text":"<commit_before>e03d2360-2e4e-11e5-9284-b827eb9e62be<commit_msg>e1151586-2e4e-11e5-9284-b827eb9e62be<commit_after>e1151586-2e4e-11e5-9284-b827eb9e62be<|endoftext|>"} {"text":"<commit_before>60275600-2e4e-11e5-9284-b827eb9e62be<commit_msg>602c7572-2e4e-11e5-9284-b827eb9e62be<commit_after>602c7572-2e4e-11e5-9284-b827eb9e62be<|endoftext|>"} {"text":"<commit_before>50a20082-2e4d-11e5-9284-b827eb9e62be<commit_msg>50a70a14-2e4d-11e5-9284-b827eb9e62be<commit_after>50a70a14-2e4d-11e5-9284-b827eb9e62be<|endoftext|>"} {"text":"<commit_before>3d3e1b34-2e4d-11e5-9284-b827eb9e62be<commit_msg>3d432110-2e4d-11e5-9284-b827eb9e62be<commit_after>3d432110-2e4d-11e5-9284-b827eb9e62be<|endoftext|>"} {"text":"<commit_before>3ba86fac-2e4f-11e5-9284-b827eb9e62be<commit_msg>3bad60b6-2e4f-11e5-9284-b827eb9e62be<commit_after>3bad60b6-2e4f-11e5-9284-b827eb9e62be<|endoftext|>"} {"text":"<commit_before>b8774b00-2e4c-11e5-9284-b827eb9e62be<commit_msg>b87c5f32-2e4c-11e5-9284-b827eb9e62be<commit_after>b87c5f32-2e4c-11e5-9284-b827eb9e62be<|endoftext|>"} {"text":"<commit_before>ae8b0ae0-2e4d-11e5-9284-b827eb9e62be<commit_msg>ae900a68-2e4d-11e5-9284-b827eb9e62be<commit_after>ae900a68-2e4d-11e5-9284-b827eb9e62be<|endoftext|>"} {"text":"<commit_before>19b07d82-2e4e-11e5-9284-b827eb9e62be<commit_msg>19b59100-2e4e-11e5-9284-b827eb9e62be<commit_after>19b59100-2e4e-11e5-9284-b827eb9e62be<|endoftext|>"} {"text":"<commit_before>ef8466a4-2e4d-11e5-9284-b827eb9e62be<commit_msg>ef89676c-2e4d-11e5-9284-b827eb9e62be<commit_after>ef89676c-2e4d-11e5-9284-b827eb9e62be<|endoftext|>"} {"text":"<commit_before>cde1975c-2e4c-11e5-9284-b827eb9e62be<commit_msg>cde68ee2-2e4c-11e5-9284-b827eb9e62be<commit_after>cde68ee2-2e4c-11e5-9284-b827eb9e62be<|endoftext|>"} {"text":"<commit_before>827ca0bc-2e4d-11e5-9284-b827eb9e62be<commit_msg>82819658-2e4d-11e5-9284-b827eb9e62be<commit_after>82819658-2e4d-11e5-9284-b827eb9e62be<|endoftext|>"} {"text":"<commit_before>5447dae0-2e4d-11e5-9284-b827eb9e62be<commit_msg>548411ea-2e4d-11e5-9284-b827eb9e62be<commit_after>548411ea-2e4d-11e5-9284-b827eb9e62be<|endoftext|>"} {"text":"<commit_before>379b2392-2e4e-11e5-9284-b827eb9e62be<commit_msg>37a07428-2e4e-11e5-9284-b827eb9e62be<commit_after>37a07428-2e4e-11e5-9284-b827eb9e62be<|endoftext|>"} {"text":"<commit_before>0937effe-2e4d-11e5-9284-b827eb9e62be<commit_msg>093d12fe-2e4d-11e5-9284-b827eb9e62be<commit_after>093d12fe-2e4d-11e5-9284-b827eb9e62be<|endoftext|>"} {"text":"<commit_before>b178845e-2e4c-11e5-9284-b827eb9e62be<commit_msg>b17d78c4-2e4c-11e5-9284-b827eb9e62be<commit_after>b17d78c4-2e4c-11e5-9284-b827eb9e62be<|endoftext|>"} {"text":"<commit_before>f83310da-2e4c-11e5-9284-b827eb9e62be<commit_msg>f8387c0a-2e4c-11e5-9284-b827eb9e62be<commit_after>f8387c0a-2e4c-11e5-9284-b827eb9e62be<|endoftext|>"} {"text":"<commit_before>ffc3321a-2e4e-11e5-9284-b827eb9e62be<commit_msg>ffc83472-2e4e-11e5-9284-b827eb9e62be<commit_after>ffc83472-2e4e-11e5-9284-b827eb9e62be<|endoftext|>"} {"text":"<commit_before>c878fb6e-2e4e-11e5-9284-b827eb9e62be<commit_msg>c87e0276-2e4e-11e5-9284-b827eb9e62be<commit_after>c87e0276-2e4e-11e5-9284-b827eb9e62be<|endoftext|>"} {"text":"<commit_before>0e1224ee-2e4e-11e5-9284-b827eb9e62be<commit_msg>0e1717e2-2e4e-11e5-9284-b827eb9e62be<commit_after>0e1717e2-2e4e-11e5-9284-b827eb9e62be<|endoftext|>"} {"text":"<commit_before>f95b5a08-2e4c-11e5-9284-b827eb9e62be<commit_msg>f96051c0-2e4c-11e5-9284-b827eb9e62be<commit_after>f96051c0-2e4c-11e5-9284-b827eb9e62be<|endoftext|>"} {"text":"<commit_before>eec874fe-2e4c-11e5-9284-b827eb9e62be<commit_msg>eecd6b30-2e4c-11e5-9284-b827eb9e62be<commit_after>eecd6b30-2e4c-11e5-9284-b827eb9e62be<|endoftext|>"} {"text":"<commit_before>d2843cd8-2e4c-11e5-9284-b827eb9e62be<commit_msg>d2895704-2e4c-11e5-9284-b827eb9e62be<commit_after>d2895704-2e4c-11e5-9284-b827eb9e62be<|endoftext|>"} {"text":"<commit_before>1c248c34-2e4e-11e5-9284-b827eb9e62be<commit_msg>1c298e96-2e4e-11e5-9284-b827eb9e62be<commit_after>1c298e96-2e4e-11e5-9284-b827eb9e62be<|endoftext|>"} {"text":"<commit_before>b95c039e-2e4c-11e5-9284-b827eb9e62be<commit_msg>b96131a2-2e4c-11e5-9284-b827eb9e62be<commit_after>b96131a2-2e4c-11e5-9284-b827eb9e62be<|endoftext|>"} {"text":"<commit_before>004776f8-2e4d-11e5-9284-b827eb9e62be<commit_msg>004c720c-2e4d-11e5-9284-b827eb9e62be<commit_after>004c720c-2e4d-11e5-9284-b827eb9e62be<|endoftext|>"} {"text":"<commit_before>e7b6b0c0-2e4e-11e5-9284-b827eb9e62be<commit_msg>e7bbd74e-2e4e-11e5-9284-b827eb9e62be<commit_after>e7bbd74e-2e4e-11e5-9284-b827eb9e62be<|endoftext|>"} {"text":"<commit_before>eb912c36-2e4c-11e5-9284-b827eb9e62be<commit_msg>eb96234e-2e4c-11e5-9284-b827eb9e62be<commit_after>eb96234e-2e4c-11e5-9284-b827eb9e62be<|endoftext|>"} {"text":"<commit_before>1bafbd2c-2e4f-11e5-9284-b827eb9e62be<commit_msg>1bb4cdbc-2e4f-11e5-9284-b827eb9e62be<commit_after>1bb4cdbc-2e4f-11e5-9284-b827eb9e62be<|endoftext|>"} {"text":"<commit_before>d4f43198-2e4d-11e5-9284-b827eb9e62be<commit_msg>d4f93382-2e4d-11e5-9284-b827eb9e62be<commit_after>d4f93382-2e4d-11e5-9284-b827eb9e62be<|endoftext|>"} {"text":"<commit_before>db3dfe16-2e4e-11e5-9284-b827eb9e62be<commit_msg>db42f182-2e4e-11e5-9284-b827eb9e62be<commit_after>db42f182-2e4e-11e5-9284-b827eb9e62be<|endoftext|>"} {"text":"<commit_before>fccdf162-2e4e-11e5-9284-b827eb9e62be<commit_msg>fcd2e654-2e4e-11e5-9284-b827eb9e62be<commit_after>fcd2e654-2e4e-11e5-9284-b827eb9e62be<|endoftext|>"} {"text":"<commit_before>cd9b8e14-2e4d-11e5-9284-b827eb9e62be<commit_msg>cda07e9c-2e4d-11e5-9284-b827eb9e62be<commit_after>cda07e9c-2e4d-11e5-9284-b827eb9e62be<|endoftext|>"} {"text":"<commit_before>72706356-2e4e-11e5-9284-b827eb9e62be<commit_msg>7275a6d6-2e4e-11e5-9284-b827eb9e62be<commit_after>7275a6d6-2e4e-11e5-9284-b827eb9e62be<|endoftext|>"} {"text":"<commit_before>b463bc7c-2e4e-11e5-9284-b827eb9e62be<commit_msg>b468cb2c-2e4e-11e5-9284-b827eb9e62be<commit_after>b468cb2c-2e4e-11e5-9284-b827eb9e62be<|endoftext|>"} {"text":"<commit_before>5bb2eaa4-2e4d-11e5-9284-b827eb9e62be<commit_msg>5bb804b2-2e4d-11e5-9284-b827eb9e62be<commit_after>5bb804b2-2e4d-11e5-9284-b827eb9e62be<|endoftext|>"} {"text":"<commit_before>1c009ac8-2e4d-11e5-9284-b827eb9e62be<commit_msg>1c05bed6-2e4d-11e5-9284-b827eb9e62be<commit_after>1c05bed6-2e4d-11e5-9284-b827eb9e62be<|endoftext|>"} {"text":"<commit_before>b9d1fef4-2e4d-11e5-9284-b827eb9e62be<commit_msg>b9d6fbca-2e4d-11e5-9284-b827eb9e62be<commit_after>b9d6fbca-2e4d-11e5-9284-b827eb9e62be<|endoftext|>"} {"text":"<commit_before>4b16cb7e-2e4e-11e5-9284-b827eb9e62be<commit_msg>4b1bee06-2e4e-11e5-9284-b827eb9e62be<commit_after>4b1bee06-2e4e-11e5-9284-b827eb9e62be<|endoftext|>"} {"text":"<commit_before>8489cb40-2e4e-11e5-9284-b827eb9e62be<commit_msg>848eda9a-2e4e-11e5-9284-b827eb9e62be<commit_after>848eda9a-2e4e-11e5-9284-b827eb9e62be<|endoftext|>"} {"text":"<commit_before>eececfdc-2e4e-11e5-9284-b827eb9e62be<commit_msg>eed3ed32-2e4e-11e5-9284-b827eb9e62be<commit_after>eed3ed32-2e4e-11e5-9284-b827eb9e62be<|endoftext|>"} {"text":"<commit_before>3d63e1e2-2e4e-11e5-9284-b827eb9e62be<commit_msg>3d68e3c2-2e4e-11e5-9284-b827eb9e62be<commit_after>3d68e3c2-2e4e-11e5-9284-b827eb9e62be<|endoftext|>"} {"text":"<commit_before>d1993592-2e4e-11e5-9284-b827eb9e62be<commit_msg>d19e36be-2e4e-11e5-9284-b827eb9e62be<commit_after>d19e36be-2e4e-11e5-9284-b827eb9e62be<|endoftext|>"} {"text":"<commit_before>3ddfe96e-2e4d-11e5-9284-b827eb9e62be<commit_msg>3de4f0a8-2e4d-11e5-9284-b827eb9e62be<commit_after>3de4f0a8-2e4d-11e5-9284-b827eb9e62be<|endoftext|>"} {"text":"<commit_before>3494578c-2e4d-11e5-9284-b827eb9e62be<commit_msg>34996c68-2e4d-11e5-9284-b827eb9e62be<commit_after>34996c68-2e4d-11e5-9284-b827eb9e62be<|endoftext|>"} {"text":"<commit_before>d8e7132e-2e4d-11e5-9284-b827eb9e62be<commit_msg>d8ec0f50-2e4d-11e5-9284-b827eb9e62be<commit_after>d8ec0f50-2e4d-11e5-9284-b827eb9e62be<|endoftext|>"} {"text":"<commit_before>59fa073c-2e4e-11e5-9284-b827eb9e62be<commit_msg>59ff77c6-2e4e-11e5-9284-b827eb9e62be<commit_after>59ff77c6-2e4e-11e5-9284-b827eb9e62be<|endoftext|>"} {"text":"<commit_before>8eda5796-2e4d-11e5-9284-b827eb9e62be<commit_msg>8edf601a-2e4d-11e5-9284-b827eb9e62be<commit_after>8edf601a-2e4d-11e5-9284-b827eb9e62be<|endoftext|>"} {"text":"<commit_before>006cf750-2e4f-11e5-9284-b827eb9e62be<commit_msg>0071f17e-2e4f-11e5-9284-b827eb9e62be<commit_after>0071f17e-2e4f-11e5-9284-b827eb9e62be<|endoftext|>"} {"text":"<commit_before>4903afbe-2e4e-11e5-9284-b827eb9e62be<commit_msg>4908ae56-2e4e-11e5-9284-b827eb9e62be<commit_after>4908ae56-2e4e-11e5-9284-b827eb9e62be<|endoftext|>"} {"text":"<commit_before>fc706ad0-2e4c-11e5-9284-b827eb9e62be<commit_msg>fc75668e-2e4c-11e5-9284-b827eb9e62be<commit_after>fc75668e-2e4c-11e5-9284-b827eb9e62be<|endoftext|>"} {"text":"<commit_before>bf4303ba-2e4d-11e5-9284-b827eb9e62be<commit_msg>bf485158-2e4d-11e5-9284-b827eb9e62be<commit_after>bf485158-2e4d-11e5-9284-b827eb9e62be<|endoftext|>"} {"text":"<commit_before>4bcfc6ce-2e4e-11e5-9284-b827eb9e62be<commit_msg>4bd4d24a-2e4e-11e5-9284-b827eb9e62be<commit_after>4bd4d24a-2e4e-11e5-9284-b827eb9e62be<|endoftext|>"} {"text":"<commit_before>20742686-2e4f-11e5-9284-b827eb9e62be<commit_msg>207929d8-2e4f-11e5-9284-b827eb9e62be<commit_after>207929d8-2e4f-11e5-9284-b827eb9e62be<|endoftext|>"} {"text":"<commit_before>018fdb0e-2e4d-11e5-9284-b827eb9e62be<commit_msg>0194d636-2e4d-11e5-9284-b827eb9e62be<commit_after>0194d636-2e4d-11e5-9284-b827eb9e62be<|endoftext|>"} {"text":"<commit_before>d2fe6a42-2e4e-11e5-9284-b827eb9e62be<commit_msg>d30366b4-2e4e-11e5-9284-b827eb9e62be<commit_after>d30366b4-2e4e-11e5-9284-b827eb9e62be<|endoftext|>"} {"text":"<commit_before>4632e1ba-2e4e-11e5-9284-b827eb9e62be<commit_msg>4637f24a-2e4e-11e5-9284-b827eb9e62be<commit_after>4637f24a-2e4e-11e5-9284-b827eb9e62be<|endoftext|>"} {"text":"<commit_before>f10550a6-2e4d-11e5-9284-b827eb9e62be<commit_msg>f10b8a98-2e4d-11e5-9284-b827eb9e62be<commit_after>f10b8a98-2e4d-11e5-9284-b827eb9e62be<|endoftext|>"} {"text":"<commit_before>197808b6-2e4f-11e5-9284-b827eb9e62be<commit_msg>197d10ea-2e4f-11e5-9284-b827eb9e62be<commit_after>197d10ea-2e4f-11e5-9284-b827eb9e62be<|endoftext|>"} {"text":"<commit_before>33c0a336-2e4f-11e5-9284-b827eb9e62be<commit_msg>33c5a070-2e4f-11e5-9284-b827eb9e62be<commit_after>33c5a070-2e4f-11e5-9284-b827eb9e62be<|endoftext|>"} {"text":"<commit_before>1a9b8e44-2e4e-11e5-9284-b827eb9e62be<commit_msg>1ab25188-2e4e-11e5-9284-b827eb9e62be<commit_after>1ab25188-2e4e-11e5-9284-b827eb9e62be<|endoftext|>"} {"text":"<commit_before>6715a868-2e4e-11e5-9284-b827eb9e62be<commit_msg>671b10a0-2e4e-11e5-9284-b827eb9e62be<commit_after>671b10a0-2e4e-11e5-9284-b827eb9e62be<|endoftext|>"} {"text":"<commit_before>dd5a6754-2e4c-11e5-9284-b827eb9e62be<commit_msg>dd5f5a70-2e4c-11e5-9284-b827eb9e62be<commit_after>dd5f5a70-2e4c-11e5-9284-b827eb9e62be<|endoftext|>"} {"text":"<commit_before>515dc6dc-2e4d-11e5-9284-b827eb9e62be<commit_msg>516ac576-2e4d-11e5-9284-b827eb9e62be<commit_after>516ac576-2e4d-11e5-9284-b827eb9e62be<|endoftext|>"} {"text":"<commit_before>1e260e32-2e4d-11e5-9284-b827eb9e62be<commit_msg>1e2b0888-2e4d-11e5-9284-b827eb9e62be<commit_after>1e2b0888-2e4d-11e5-9284-b827eb9e62be<|endoftext|>"} {"text":"<commit_before>bb41b00e-2e4d-11e5-9284-b827eb9e62be<commit_msg>bb46a5be-2e4d-11e5-9284-b827eb9e62be<commit_after>bb46a5be-2e4d-11e5-9284-b827eb9e62be<|endoftext|>"} {"text":"<commit_before>f90baf08-2e4c-11e5-9284-b827eb9e62be<commit_msg>f910a864-2e4c-11e5-9284-b827eb9e62be<commit_after>f910a864-2e4c-11e5-9284-b827eb9e62be<|endoftext|>"} {"text":"<commit_before>815e9582-2e4d-11e5-9284-b827eb9e62be<commit_msg>81639096-2e4d-11e5-9284-b827eb9e62be<commit_after>81639096-2e4d-11e5-9284-b827eb9e62be<|endoftext|>"} {"text":"<commit_before>cca636fc-2e4e-11e5-9284-b827eb9e62be<commit_msg>ccab359e-2e4e-11e5-9284-b827eb9e62be<commit_after>ccab359e-2e4e-11e5-9284-b827eb9e62be<|endoftext|>"} {"text":"<commit_before>9215f298-2e4e-11e5-9284-b827eb9e62be<commit_msg>921ae5a0-2e4e-11e5-9284-b827eb9e62be<commit_after>921ae5a0-2e4e-11e5-9284-b827eb9e62be<|endoftext|>"} {"text":"<commit_before>3304e75e-2e4f-11e5-9284-b827eb9e62be<commit_msg>3309da16-2e4f-11e5-9284-b827eb9e62be<commit_after>3309da16-2e4f-11e5-9284-b827eb9e62be<|endoftext|>"} {"text":"<commit_before>f604224e-2e4d-11e5-9284-b827eb9e62be<commit_msg>f6091772-2e4d-11e5-9284-b827eb9e62be<commit_after>f6091772-2e4d-11e5-9284-b827eb9e62be<|endoftext|>"} {"text":"<commit_before>0fb99a30-2e4d-11e5-9284-b827eb9e62be<commit_msg>0fbea89a-2e4d-11e5-9284-b827eb9e62be<commit_after>0fbea89a-2e4d-11e5-9284-b827eb9e62be<|endoftext|>"} {"text":"<commit_before>40b4fc60-2e4d-11e5-9284-b827eb9e62be<commit_msg>40ba021e-2e4d-11e5-9284-b827eb9e62be<commit_after>40ba021e-2e4d-11e5-9284-b827eb9e62be<|endoftext|>"} {"text":"<commit_before>d2e088e2-2e4e-11e5-9284-b827eb9e62be<commit_msg>d2e5832e-2e4e-11e5-9284-b827eb9e62be<commit_after>d2e5832e-2e4e-11e5-9284-b827eb9e62be<|endoftext|>"} {"text":"<commit_before>63ef8a7e-2e4d-11e5-9284-b827eb9e62be<commit_msg>63f495d2-2e4d-11e5-9284-b827eb9e62be<commit_after>63f495d2-2e4d-11e5-9284-b827eb9e62be<|endoftext|>"} {"text":"<commit_before>1d446c9c-2e4e-11e5-9284-b827eb9e62be<commit_msg>1d497818-2e4e-11e5-9284-b827eb9e62be<commit_after>1d497818-2e4e-11e5-9284-b827eb9e62be<|endoftext|>"} {"text":"<commit_before>cdff30cc-2e4d-11e5-9284-b827eb9e62be<commit_msg>ce0427e4-2e4d-11e5-9284-b827eb9e62be<commit_after>ce0427e4-2e4d-11e5-9284-b827eb9e62be<|endoftext|>"} {"text":"<commit_before>c2ddda0e-2e4d-11e5-9284-b827eb9e62be<commit_msg>c2e2de8c-2e4d-11e5-9284-b827eb9e62be<commit_after>c2e2de8c-2e4d-11e5-9284-b827eb9e62be<|endoftext|>"} {"text":"<commit_before>35b5d0c2-2e4e-11e5-9284-b827eb9e62be<commit_msg>35bacca8-2e4e-11e5-9284-b827eb9e62be<commit_after>35bacca8-2e4e-11e5-9284-b827eb9e62be<|endoftext|>"} {"text":"<commit_before>755eb25c-2e4e-11e5-9284-b827eb9e62be<commit_msg>7563bef0-2e4e-11e5-9284-b827eb9e62be<commit_after>7563bef0-2e4e-11e5-9284-b827eb9e62be<|endoftext|>"} {"text":"<commit_before>184c5e74-2e4f-11e5-9284-b827eb9e62be<commit_msg>18516a0e-2e4f-11e5-9284-b827eb9e62be<commit_after>18516a0e-2e4f-11e5-9284-b827eb9e62be<|endoftext|>"} {"text":"<commit_before>f3e40cee-2e4e-11e5-9284-b827eb9e62be<commit_msg>f3e9091a-2e4e-11e5-9284-b827eb9e62be<commit_after>f3e9091a-2e4e-11e5-9284-b827eb9e62be<|endoftext|>"} {"text":"<commit_before>85a89994-2e4d-11e5-9284-b827eb9e62be<commit_msg>85ad999e-2e4d-11e5-9284-b827eb9e62be<commit_after>85ad999e-2e4d-11e5-9284-b827eb9e62be<|endoftext|>"} {"text":"<commit_before>6370a366-2e4e-11e5-9284-b827eb9e62be<commit_msg>6375ac44-2e4e-11e5-9284-b827eb9e62be<commit_after>6375ac44-2e4e-11e5-9284-b827eb9e62be<|endoftext|>"} {"text":"<commit_before>e96188b0-2e4d-11e5-9284-b827eb9e62be<commit_msg>e9817918-2e4d-11e5-9284-b827eb9e62be<commit_after>e9817918-2e4d-11e5-9284-b827eb9e62be<|endoftext|>"} {"text":"<commit_before>570b5a2c-2e4d-11e5-9284-b827eb9e62be<commit_msg>5710649a-2e4d-11e5-9284-b827eb9e62be<commit_after>5710649a-2e4d-11e5-9284-b827eb9e62be<|endoftext|>"} {"text":"<commit_before>548e2338-2e4d-11e5-9284-b827eb9e62be<commit_msg>549329fa-2e4d-11e5-9284-b827eb9e62be<commit_after>549329fa-2e4d-11e5-9284-b827eb9e62be<|endoftext|>"} {"text":"<commit_before>03c60ca4-2e4d-11e5-9284-b827eb9e62be<commit_msg>03cb1834-2e4d-11e5-9284-b827eb9e62be<commit_after>03cb1834-2e4d-11e5-9284-b827eb9e62be<|endoftext|>"} {"text":"<commit_before>bf3c5b38-2e4c-11e5-9284-b827eb9e62be<commit_msg>bf415ade-2e4c-11e5-9284-b827eb9e62be<commit_after>bf415ade-2e4c-11e5-9284-b827eb9e62be<|endoftext|>"} {"text":"<commit_before>deb3fd0c-2e4e-11e5-9284-b827eb9e62be<commit_msg>deb8fdca-2e4e-11e5-9284-b827eb9e62be<commit_after>deb8fdca-2e4e-11e5-9284-b827eb9e62be<|endoftext|>"} {"text":"<commit_before>df2d965e-2e4d-11e5-9284-b827eb9e62be<commit_msg>df32a356-2e4d-11e5-9284-b827eb9e62be<commit_after>df32a356-2e4d-11e5-9284-b827eb9e62be<|endoftext|>"} {"text":"<commit_before>fffab250-2e4c-11e5-9284-b827eb9e62be<commit_msg>ffffb11a-2e4c-11e5-9284-b827eb9e62be<commit_after>ffffb11a-2e4c-11e5-9284-b827eb9e62be<|endoftext|>"} {"text":"<commit_before>b4852a58-2e4c-11e5-9284-b827eb9e62be<commit_msg>b48a3386-2e4c-11e5-9284-b827eb9e62be<commit_after>b48a3386-2e4c-11e5-9284-b827eb9e62be<|endoftext|>"} {"text":"<commit_before>32882fae-2e4d-11e5-9284-b827eb9e62be<commit_msg>328d3ef4-2e4d-11e5-9284-b827eb9e62be<commit_after>328d3ef4-2e4d-11e5-9284-b827eb9e62be<|endoftext|>"} {"text":"<commit_before>b5ff65dc-2e4d-11e5-9284-b827eb9e62be<commit_msg>b6045f92-2e4d-11e5-9284-b827eb9e62be<commit_after>b6045f92-2e4d-11e5-9284-b827eb9e62be<|endoftext|>"} {"text":"<commit_before>b47b2336-2e4d-11e5-9284-b827eb9e62be<commit_msg>b480248a-2e4d-11e5-9284-b827eb9e62be<commit_after>b480248a-2e4d-11e5-9284-b827eb9e62be<|endoftext|>"} {"text":"<commit_before>fa9979ca-2e4e-11e5-9284-b827eb9e62be<commit_msg>fa9e6d72-2e4e-11e5-9284-b827eb9e62be<commit_after>fa9e6d72-2e4e-11e5-9284-b827eb9e62be<|endoftext|>"} {"text":"<commit_before>85135f2c-2e4e-11e5-9284-b827eb9e62be<commit_msg>8518712e-2e4e-11e5-9284-b827eb9e62be<commit_after>8518712e-2e4e-11e5-9284-b827eb9e62be<|endoftext|>"} {"text":"<commit_before>7275a6d6-2e4e-11e5-9284-b827eb9e62be<commit_msg>727acd96-2e4e-11e5-9284-b827eb9e62be<commit_after>727acd96-2e4e-11e5-9284-b827eb9e62be<|endoftext|>"} {"text":"<commit_before>4fb71b84-2e4e-11e5-9284-b827eb9e62be<commit_msg>4fbc4988-2e4e-11e5-9284-b827eb9e62be<commit_after>4fbc4988-2e4e-11e5-9284-b827eb9e62be<|endoftext|>"} {"text":"<commit_before>b022f5c4-2e4e-11e5-9284-b827eb9e62be<commit_msg>b02802da-2e4e-11e5-9284-b827eb9e62be<commit_after>b02802da-2e4e-11e5-9284-b827eb9e62be<|endoftext|>"} {"text":"<commit_before>37d3194a-2e4f-11e5-9284-b827eb9e62be<commit_msg>37d80ce8-2e4f-11e5-9284-b827eb9e62be<commit_after>37d80ce8-2e4f-11e5-9284-b827eb9e62be<|endoftext|>"} {"text":"<commit_before>6e787d2a-2e4d-11e5-9284-b827eb9e62be<commit_msg>6e7d9918-2e4d-11e5-9284-b827eb9e62be<commit_after>6e7d9918-2e4d-11e5-9284-b827eb9e62be<|endoftext|>"} {"text":"<commit_before>bb6b26d6-2e4e-11e5-9284-b827eb9e62be<commit_msg>bb703eaa-2e4e-11e5-9284-b827eb9e62be<commit_after>bb703eaa-2e4e-11e5-9284-b827eb9e62be<|endoftext|>"} {"text":"<commit_before>ebf977a8-2e4e-11e5-9284-b827eb9e62be<commit_msg>ebfe7e4c-2e4e-11e5-9284-b827eb9e62be<commit_after>ebfe7e4c-2e4e-11e5-9284-b827eb9e62be<|endoftext|>"} {"text":"<commit_before>5733912c-2e4d-11e5-9284-b827eb9e62be<commit_msg>5738df60-2e4d-11e5-9284-b827eb9e62be<commit_after>5738df60-2e4d-11e5-9284-b827eb9e62be<|endoftext|>"} {"text":"<commit_before>af419cd2-2e4e-11e5-9284-b827eb9e62be<commit_msg>af469264-2e4e-11e5-9284-b827eb9e62be<commit_after>af469264-2e4e-11e5-9284-b827eb9e62be<|endoftext|>"} {"text":"<commit_before>d936aed0-2e4c-11e5-9284-b827eb9e62be<commit_msg>d93bc0dc-2e4c-11e5-9284-b827eb9e62be<commit_after>d93bc0dc-2e4c-11e5-9284-b827eb9e62be<|endoftext|>"} {"text":"<commit_before>58391b28-2e4d-11e5-9284-b827eb9e62be<commit_msg>583e24b0-2e4d-11e5-9284-b827eb9e62be<commit_after>583e24b0-2e4d-11e5-9284-b827eb9e62be<|endoftext|>"} {"text":"<commit_before>08433d92-2e4d-11e5-9284-b827eb9e62be<commit_msg>0852a084-2e4d-11e5-9284-b827eb9e62be<commit_after>0852a084-2e4d-11e5-9284-b827eb9e62be<|endoftext|>"} {"text":"<commit_before>5632b708-2e4d-11e5-9284-b827eb9e62be<commit_msg>56380c8a-2e4d-11e5-9284-b827eb9e62be<commit_after>56380c8a-2e4d-11e5-9284-b827eb9e62be<|endoftext|>"} {"text":"<commit_before>04660636-2e4e-11e5-9284-b827eb9e62be<commit_msg>046aff1a-2e4e-11e5-9284-b827eb9e62be<commit_after>046aff1a-2e4e-11e5-9284-b827eb9e62be<|endoftext|>"} {"text":"<commit_before>3b17738a-2e4f-11e5-9284-b827eb9e62be<commit_msg>3b1c6ba6-2e4f-11e5-9284-b827eb9e62be<commit_after>3b1c6ba6-2e4f-11e5-9284-b827eb9e62be<|endoftext|>"} {"text":"<commit_before>e8192d68-2e4e-11e5-9284-b827eb9e62be<commit_msg>e81e59a0-2e4e-11e5-9284-b827eb9e62be<commit_after>e81e59a0-2e4e-11e5-9284-b827eb9e62be<|endoftext|>"} {"text":"<commit_before>d49b2fbc-2e4d-11e5-9284-b827eb9e62be<commit_msg>d4a024cc-2e4d-11e5-9284-b827eb9e62be<commit_after>d4a024cc-2e4d-11e5-9284-b827eb9e62be<|endoftext|>"} {"text":"<commit_before>fbea16be-2e4d-11e5-9284-b827eb9e62be<commit_msg>fbef0d72-2e4d-11e5-9284-b827eb9e62be<commit_after>fbef0d72-2e4d-11e5-9284-b827eb9e62be<|endoftext|>"} {"text":"<commit_before>b132c53e-2e4e-11e5-9284-b827eb9e62be<commit_msg>b137bd8c-2e4e-11e5-9284-b827eb9e62be<commit_after>b137bd8c-2e4e-11e5-9284-b827eb9e62be<|endoftext|>"} {"text":"<commit_before>070bfe36-2e4e-11e5-9284-b827eb9e62be<commit_msg>0710ef68-2e4e-11e5-9284-b827eb9e62be<commit_after>0710ef68-2e4e-11e5-9284-b827eb9e62be<|endoftext|>"} {"text":"<commit_before>b3c84e96-2e4d-11e5-9284-b827eb9e62be<commit_msg>b3cd5620-2e4d-11e5-9284-b827eb9e62be<commit_after>b3cd5620-2e4d-11e5-9284-b827eb9e62be<|endoftext|>"} {"text":"<commit_before>857b6d0c-2e4d-11e5-9284-b827eb9e62be<commit_msg>85806410-2e4d-11e5-9284-b827eb9e62be<commit_after>85806410-2e4d-11e5-9284-b827eb9e62be<|endoftext|>"} {"text":"<commit_before>28f5ab82-2e4e-11e5-9284-b827eb9e62be<commit_msg>28fb8fb6-2e4e-11e5-9284-b827eb9e62be<commit_after>28fb8fb6-2e4e-11e5-9284-b827eb9e62be<|endoftext|>"} {"text":"<commit_before>a0e1883c-2e4e-11e5-9284-b827eb9e62be<commit_msg>a0e67e96-2e4e-11e5-9284-b827eb9e62be<commit_after>a0e67e96-2e4e-11e5-9284-b827eb9e62be<|endoftext|>"} {"text":"<commit_before>069e0c00-2e4e-11e5-9284-b827eb9e62be<commit_msg>06a2fed6-2e4e-11e5-9284-b827eb9e62be<commit_after>06a2fed6-2e4e-11e5-9284-b827eb9e62be<|endoftext|>"} {"text":"<commit_before>6a10ab3a-2e4e-11e5-9284-b827eb9e62be<commit_msg>6a15a9a0-2e4e-11e5-9284-b827eb9e62be<commit_after>6a15a9a0-2e4e-11e5-9284-b827eb9e62be<|endoftext|>"} {"text":"<commit_before>c3670528-2e4c-11e5-9284-b827eb9e62be<commit_msg>c36bfa38-2e4c-11e5-9284-b827eb9e62be<commit_after>c36bfa38-2e4c-11e5-9284-b827eb9e62be<|endoftext|>"} {"text":"<commit_before>185f8946-2e4e-11e5-9284-b827eb9e62be<commit_msg>18647d98-2e4e-11e5-9284-b827eb9e62be<commit_after>18647d98-2e4e-11e5-9284-b827eb9e62be<|endoftext|>"} {"text":"<commit_before>a4f01b4c-2e4d-11e5-9284-b827eb9e62be<commit_msg>a4f51232-2e4d-11e5-9284-b827eb9e62be<commit_after>a4f51232-2e4d-11e5-9284-b827eb9e62be<|endoftext|>"} {"text":"<commit_before>a37e7370-2e4e-11e5-9284-b827eb9e62be<commit_msg>a3838450-2e4e-11e5-9284-b827eb9e62be<commit_after>a3838450-2e4e-11e5-9284-b827eb9e62be<|endoftext|>"} {"text":"<commit_before>2979fb52-2e4f-11e5-9284-b827eb9e62be<commit_msg>297ef238-2e4f-11e5-9284-b827eb9e62be<commit_after>297ef238-2e4f-11e5-9284-b827eb9e62be<|endoftext|>"} {"text":"<commit_before>1eefa070-2e4e-11e5-9284-b827eb9e62be<commit_msg>1ef4b15a-2e4e-11e5-9284-b827eb9e62be<commit_after>1ef4b15a-2e4e-11e5-9284-b827eb9e62be<|endoftext|>"} {"text":"<commit_before>cfee9d74-2e4c-11e5-9284-b827eb9e62be<commit_msg>cff393d8-2e4c-11e5-9284-b827eb9e62be<commit_after>cff393d8-2e4c-11e5-9284-b827eb9e62be<|endoftext|>"} {"text":"<commit_before>1b888e5c-2e4d-11e5-9284-b827eb9e62be<commit_msg>1b8db5e4-2e4d-11e5-9284-b827eb9e62be<commit_after>1b8db5e4-2e4d-11e5-9284-b827eb9e62be<|endoftext|>"} {"text":"<commit_before>e4047ecc-2e4d-11e5-9284-b827eb9e62be<commit_msg>e4098836-2e4d-11e5-9284-b827eb9e62be<commit_after>e4098836-2e4d-11e5-9284-b827eb9e62be<|endoftext|>"} {"text":"<commit_before>6e7bb674-2e4e-11e5-9284-b827eb9e62be<commit_msg>6e80b7dc-2e4e-11e5-9284-b827eb9e62be<commit_after>6e80b7dc-2e4e-11e5-9284-b827eb9e62be<|endoftext|>"} {"text":"<commit_before>3d849140-2e4d-11e5-9284-b827eb9e62be<commit_msg>3d89bec2-2e4d-11e5-9284-b827eb9e62be<commit_after>3d89bec2-2e4d-11e5-9284-b827eb9e62be<|endoftext|>"} {"text":"<commit_before>33d9f15c-2e4e-11e5-9284-b827eb9e62be<commit_msg>33deebc6-2e4e-11e5-9284-b827eb9e62be<commit_after>33deebc6-2e4e-11e5-9284-b827eb9e62be<|endoftext|>"} {"text":"<commit_before>82fe0034-2e4e-11e5-9284-b827eb9e62be<commit_msg>83030c32-2e4e-11e5-9284-b827eb9e62be<commit_after>83030c32-2e4e-11e5-9284-b827eb9e62be<|endoftext|>"} {"text":"<commit_before>963e0f78-2e4d-11e5-9284-b827eb9e62be<commit_msg>96431fea-2e4d-11e5-9284-b827eb9e62be<commit_after>96431fea-2e4d-11e5-9284-b827eb9e62be<|endoftext|>"} {"text":"<commit_before>28b87f32-2e4e-11e5-9284-b827eb9e62be<commit_msg>28bd9292-2e4e-11e5-9284-b827eb9e62be<commit_after>28bd9292-2e4e-11e5-9284-b827eb9e62be<|endoftext|>"} {"text":"<commit_before>f8d91696-2e4d-11e5-9284-b827eb9e62be<commit_msg>f8de1f4c-2e4d-11e5-9284-b827eb9e62be<commit_after>f8de1f4c-2e4d-11e5-9284-b827eb9e62be<|endoftext|>"} {"text":"<commit_before>052ec1ba-2e4f-11e5-9284-b827eb9e62be<commit_msg>0533cc14-2e4f-11e5-9284-b827eb9e62be<commit_after>0533cc14-2e4f-11e5-9284-b827eb9e62be<|endoftext|>"} {"text":"<commit_before>b44a7686-2e4e-11e5-9284-b827eb9e62be<commit_msg>b44f85b8-2e4e-11e5-9284-b827eb9e62be<commit_after>b44f85b8-2e4e-11e5-9284-b827eb9e62be<|endoftext|>"} {"text":"<commit_before>2036dc06-2e4d-11e5-9284-b827eb9e62be<commit_msg>203bd26a-2e4d-11e5-9284-b827eb9e62be<commit_after>203bd26a-2e4d-11e5-9284-b827eb9e62be<|endoftext|>"} {"text":"<commit_before>2aea00cc-2e4f-11e5-9284-b827eb9e62be<commit_msg>2aef00e0-2e4f-11e5-9284-b827eb9e62be<commit_after>2aef00e0-2e4f-11e5-9284-b827eb9e62be<|endoftext|>"} {"text":"<commit_before>ef561b36-2e4e-11e5-9284-b827eb9e62be<commit_msg>ef5b68e8-2e4e-11e5-9284-b827eb9e62be<commit_after>ef5b68e8-2e4e-11e5-9284-b827eb9e62be<|endoftext|>"} {"text":"<commit_before>6f359378-2e4e-11e5-9284-b827eb9e62be<commit_msg>6f3a92e2-2e4e-11e5-9284-b827eb9e62be<commit_after>6f3a92e2-2e4e-11e5-9284-b827eb9e62be<|endoftext|>"} {"text":"<commit_before>edd372c8-2e4d-11e5-9284-b827eb9e62be<commit_msg>edd87b6a-2e4d-11e5-9284-b827eb9e62be<commit_after>edd87b6a-2e4d-11e5-9284-b827eb9e62be<|endoftext|>"} {"text":"<commit_before>01798ce0-2e4e-11e5-9284-b827eb9e62be<commit_msg>017e8272-2e4e-11e5-9284-b827eb9e62be<commit_after>017e8272-2e4e-11e5-9284-b827eb9e62be<|endoftext|>"} {"text":"<commit_before>b18c4e26-2e4c-11e5-9284-b827eb9e62be<commit_msg>b191847c-2e4c-11e5-9284-b827eb9e62be<commit_after>b191847c-2e4c-11e5-9284-b827eb9e62be<|endoftext|>"} {"text":"<commit_before>25d8cd30-2e4e-11e5-9284-b827eb9e62be<commit_msg>25dddd02-2e4e-11e5-9284-b827eb9e62be<commit_after>25dddd02-2e4e-11e5-9284-b827eb9e62be<|endoftext|>"} {"text":"<commit_before>2de0a588-2e4f-11e5-9284-b827eb9e62be<commit_msg>2de59e12-2e4f-11e5-9284-b827eb9e62be<commit_after>2de59e12-2e4f-11e5-9284-b827eb9e62be<|endoftext|>"} {"text":"<commit_before>b3166fcc-2e4e-11e5-9284-b827eb9e62be<commit_msg>b31b6ebe-2e4e-11e5-9284-b827eb9e62be<commit_after>b31b6ebe-2e4e-11e5-9284-b827eb9e62be<|endoftext|>"} {"text":"<commit_before>cba610d4-2e4d-11e5-9284-b827eb9e62be<commit_msg>cbab0b16-2e4d-11e5-9284-b827eb9e62be<commit_after>cbab0b16-2e4d-11e5-9284-b827eb9e62be<|endoftext|>"} {"text":"<commit_before>4812e14c-2e4e-11e5-9284-b827eb9e62be<commit_msg>4817e386-2e4e-11e5-9284-b827eb9e62be<commit_after>4817e386-2e4e-11e5-9284-b827eb9e62be<|endoftext|>"} {"text":"<commit_before>dc1de888-2e4d-11e5-9284-b827eb9e62be<commit_msg>dc22f1a2-2e4d-11e5-9284-b827eb9e62be<commit_after>dc22f1a2-2e4d-11e5-9284-b827eb9e62be<|endoftext|>"} {"text":"<commit_before>7bf213da-2e4d-11e5-9284-b827eb9e62be<commit_msg>7bf7183a-2e4d-11e5-9284-b827eb9e62be<commit_after>7bf7183a-2e4d-11e5-9284-b827eb9e62be<|endoftext|>"} {"text":"<commit_before>#include <stdio.h>\n#include <stdlib.h>\n#include <string.h>\n#include <ctype.h>\n#include <errno.h>\n#include <iostream>\n#include \"svm_interface.h\"\n\nstruct svm_parameter param; \/\/ set by parse_command_line\nstruct svm_problem prob; \/\/ set by read_problem\nstruct svm_model *model;\nstruct svm_node *x_space;\n\nvoid train(const int problemSize, const int dimensions, double dataset[], double labels[]) {\n\t\/*\n\t==================\n\tSet all parameters\n\t==================\n\t*\/\n\tparam.svm_type = C_SVC;\n\tparam.kernel_type = RBF;\n\tparam.degree = 3;\n\tparam.gamma = 0.5;\n\tparam.coef0 = 0;\n\tparam.nu = 0.5;\n\tparam.cache_size = 100;\n\tparam.C = 1;\n\tparam.eps = 1e-3;\n\tparam.p = 0.1;\n\tparam.shrinking = 1;\n\tparam.probability = 0;\n\tparam.nr_weight = 0;\n\tparam.weight_label = NULL;\n\tparam.weight = NULL;\n\n\n\t\/*\n\t==================\n\tProblem definition\n\t==================\n\t*\/\n\t\/\/Set the number of training data\n\tprob.l = problemSize;\n\n\t\/\/Set the array containing the labels of all training data\n\tprob.y = labels;\n\n\t\/*\n\tfor (int i = 0; i < prob.l; i++) {\n\t\tdouble subset[dimensions];\n\t\tfor (int j = 0; j < dimensions; j++) {\n\t\t\tsubset[j] = dataset[i*dimensions+j];\n\t\t}\n\t\tdouble maximum = findMaximum();\n\t}*\/\n\n\n\tsvm_node** x = new svm_node*[prob.l];\n\n\tfor (int row = 0; row < prob.l; row++) {\n\t\tsvm_node* x_space = new svm_node[dimensions + 1];\n\t\tfor (int col = 0; col < dimensions; col++) {\n\t\t\tx_space[col].index = col;\n\t\t\tx_space[col].value = dataset[row*dimensions + col];\n\t\t}\n\t\tx_space[dimensions].index = -1; \/\/Each row of properties should be terminated with a -1 according to the readme\n\t\tx_space[dimensions].value = 0;\t \/\/Value not important\n\t\tx[row] = x_space;\n\t}\n\n\tprob.x = x;\n\n\t\/\/Train model\n\tmodel = svm_train(&prob, ¶m);\n}\n\ndouble test(const int dimensions, double testData[]) {\n\tsvm_node* testnode = new svm_node[dimensions+1];\n\n\tfor (int i = 0; i < dimensions; i++) {\n\t\ttestnode[i].index = i;\n\t\ttestnode[i].value = testData[i];\n\t}\n\ttestnode[dimensions].index = -1;\n\ttestnode[dimensions].value = 0;\n\n\tdouble retval = svm_predict(model, testnode);\n\t\n\tsvm_destroy_param(¶m);\n\tdelete[] prob.y;\n\tdelete[] prob.x;\n\tdelete[] x_space;\n\tdelete[] testnode;\n\n\treturn retval;\n}<commit_msg>Put some preliminary code in comments.<commit_after>#include <stdio.h>\n#include <stdlib.h>\n#include <string.h>\n#include <ctype.h>\n#include <errno.h>\n#include <iostream>\n#include \"svm_interface.h\"\n\nstruct svm_parameter param; \/\/ set by parse_command_line\nstruct svm_problem prob; \/\/ set by read_problem\nstruct svm_model *model;\nstruct svm_node *x_space;\n\nvoid train(const int problemSize, const int dimensions, double dataset[], double labels[]) {\n\t\/*\n\t==================\n\tSet all parameters\n\t==================\n\t*\/\n\tparam.svm_type = C_SVC;\n\tparam.kernel_type = RBF;\n\tparam.degree = 3;\n\tparam.gamma = 0.5;\n\tparam.coef0 = 0;\n\tparam.nu = 0.5;\n\tparam.cache_size = 100;\n\tparam.C = 1;\n\tparam.eps = 1e-3;\n\tparam.p = 0.1;\n\tparam.shrinking = 1;\n\tparam.probability = 0;\n\tparam.nr_weight = 0;\n\tparam.weight_label = NULL;\n\tparam.weight = NULL;\n\n\n\t\/*\n\t==================\n\tProblem definition\n\t==================\n\t*\/\n\t\/\/Set the number of training data\n\tprob.l = problemSize;\n\n\t\/\/Set the array containing the labels of all training data\n\tprob.y = labels;\n\n\t\/*\n\t\/\/Rescale the dataset\n\tfor (int i = 0; i < prob.l; i++) {\n\t\tdouble* subset = new double[dimensions];\n\t\tfor (int j = 0; j < dimensions; j++) {\n\t\t\tsubset[j] = dataset[i*dimensions+j];\n\t\t}\n\t\tdouble maximum = rescale();\n\t}*\/\n\n\tsvm_node** x = new svm_node*[prob.l];\n\n\tfor (int row = 0; row < prob.l; row++) {\n\t\tsvm_node* xRow = new svm_node[dimensions + 1];\n\t\tfor (int col = 0; col < dimensions; col++) {\n\t\t\txRow[col].index = col;\n\t\t\txRow[col].value = dataset[row*dimensions + col];\n\t\t}\n\t\txRow[dimensions].index = -1; \/\/Each row of properties should be terminated with a -1 according to the readme\n\t\txRow[dimensions].value = 0;\t \/\/Value not important\n\t\tx[row] = xRow;\n\t}\n\n\tprob.x = x;\n\n\t\/\/Train model\n\tmodel = svm_train(&prob, ¶m);\n}\n\ndouble test(const int dimensions, double testData[]) {\n\tsvm_node* testnode = new svm_node[dimensions+1];\n\n\tfor (int i = 0; i < dimensions; i++) {\n\t\ttestnode[i].index = i;\n\t\ttestnode[i].value = testData[i];\n\t}\n\ttestnode[dimensions].index = -1;\n\ttestnode[dimensions].value = 0;\n\n\tdouble retval = svm_predict(model, testnode);\n\t\n\tsvm_destroy_param(¶m);\n\tdelete[] prob.y;\n\tdelete[] prob.x;\n\tdelete[] x_space;\n\tdelete[] testnode;\n\n\treturn retval;\n}<|endoftext|>"} {"text":"<commit_before>#include <string>\n#include <climits>\n#include <iostream>\n#include <vector>\n\nusing namespace std;\n\nclass Solution {\npublic:\n bool isMatch(string s, string p) {\n if (s.empty()) {\n for (int i = 0; i < p.size(); i++)\n if (p[i] != '*')\n return false;\n return true;\n }\n if (p.empty())\n return false;\n\n char c = p[0];\n p = p.substr(1, p.size() - 1);\n if (c == '?' || c == s[0])\n return isMatch(s.substr(1, s.size() - 1), p);\n\n if (c == '*') {\n if (p.empty())\n return true;\n for (int i = 0; i < s.size(); i++)\n if (isMatch(s.substr(i, s.size() - i), p))\n return true;\n }\n\n\t\treturn false; \n }\n};\n\nvoid showAns(string s, string p, bool ans) {\n cout << \"[\" << s << \"], [\" << p << \"] \";\n cout << ((ans) ? \"is\" : \"is not\") << \" matched (\" << ((ans) ? \"True\" : \"False\") << \")\" << endl;\n}\n\nint main() {\n Solution sol;\n\tstring s;\n\tstring p;\n\tbool ans;\n\n\ts = \"aa\";\n\tp = \"a\";\n\tans = sol.isMatch(s, p);\n\tshowAns(s, p, ans);\n\n\ts = \"aa\";\n\tp = \"aa\";\n\tans = sol.isMatch(s, p);\n\tshowAns(s, p, ans);\n\n\ts = \"aaa\";\n\tp = \"aa\";\n\tans = sol.isMatch(s, p);\n\tshowAns(s, p, ans);\n\n\ts = \"aa\";\n\tp = \"*\";\n\tans = sol.isMatch(s, p);\n\tshowAns(s, p, ans);\n\n\ts = \"aa\";\n\tp = \"a*\";\n\tans = sol.isMatch(s, p);\n\tshowAns(s, p, ans);\n\n\ts = \"ab\";\n\tp = \"?*\";\n\tans = sol.isMatch(s, p);\n\tshowAns(s, p, ans);\n\n\ts = \"aab\";\n\tp = \"c*a*b\";\n\tans = sol.isMatch(s, p);\n\tshowAns(s, p, ans);\n\n\ts = \"\";\n\tp = \"\";\n\tans = sol.isMatch(s, p);\n\tshowAns(s, p, ans);\n\n\ts = \"a\";\n\tp = \"\";\n\tans = sol.isMatch(s, p);\n\tshowAns(s, p, ans);\n\n\ts = \"\";\n\tp = \"a\";\n\tans = sol.isMatch(s, p);\n\tshowAns(s, p, ans);\n\n\ts = \"a\";\n\tp = \"*a\";\n\tans = sol.isMatch(s, p);\n\tshowAns(s, p, ans);\n\n\ts = \"ba\";\n\tp = \"*a\";\n\tans = sol.isMatch(s, p);\n\tshowAns(s, p, ans);\n\n\ts = \"cba\";\n\tp = \"*a\";\n\tans = sol.isMatch(s, p);\n\tshowAns(s, p, ans);\n\n\ts = \"ba\";\n\tp = \"?a\";\n\tans = sol.isMatch(s, p);\n\tshowAns(s, p, ans);\n\n\ts = \"cba\";\n\tp = \"?a\";\n\tans = sol.isMatch(s, p);\n\tshowAns(s, p, ans);\n\n\ts = \"\";\n\tp = \"*\";\n\tans = sol.isMatch(s, p);\n\tshowAns(s, p, ans);\n\n\ts = \"\";\n\tp = \"?\";\n\tans = sol.isMatch(s, p);\n\tshowAns(s, p, ans);\n\n\ts = \"\";\n\tp = \"**\";\n\tans = sol.isMatch(s, p);\n\tshowAns(s, p, ans);\n\n return 0;\n}\n<commit_msg>leet: 44 still exceed time limit<commit_after>#include <string>\n#include <climits>\n#include <iostream>\n#include <vector>\n\nusing namespace std;\n\nclass Solution {\npublic:\n bool isMatch(string s, string p) {\n if (s.empty()) {\n for (int i = 0; i < p.size(); i++)\n if (p[i] != '*')\n return false;\n return true;\n }\n if (p.empty())\n return false;\n\n char c = p[0];\n p = p.substr(1, p.size() - 1);\n if (c == '?' || c == s[0])\n return isMatch(s.substr(1, s.size() - 1), p);\n\n if (c == '*') {\n while (p.size() > 1 && p[0] == c)\n p = p.substr(1, p.size() - 1);\n if (p.empty())\n return true;\n for (int i = 0; i < s.size(); i++)\n if (isMatch(s.substr(i, s.size() - i), p))\n return true;\n }\n\n\t\treturn false; \n }\n};\n\nvoid showAns(string s, string p, bool ans) {\n cout << \"[\" << s << \"], [\" << p << \"] \";\n cout << ((ans) ? \"is\" : \"is not\") << \" matched (\" << ((ans) ? \"True\" : \"False\") << \")\" << endl;\n}\n\nint main() {\n Solution sol;\n\tstring s;\n\tstring p;\n\tbool ans;\n\n\ts = \"aa\";\n\tp = \"a\";\n\tans = sol.isMatch(s, p);\n\tshowAns(s, p, ans);\n\n\ts = \"aa\";\n\tp = \"aa\";\n\tans = sol.isMatch(s, p);\n\tshowAns(s, p, ans);\n\n\ts = \"aaa\";\n\tp = \"aa\";\n\tans = sol.isMatch(s, p);\n\tshowAns(s, p, ans);\n\n\ts = \"aa\";\n\tp = \"*\";\n\tans = sol.isMatch(s, p);\n\tshowAns(s, p, ans);\n\n\ts = \"aa\";\n\tp = \"a*\";\n\tans = sol.isMatch(s, p);\n\tshowAns(s, p, ans);\n\n\ts = \"ab\";\n\tp = \"?*\";\n\tans = sol.isMatch(s, p);\n\tshowAns(s, p, ans);\n\n\ts = \"aab\";\n\tp = \"c*a*b\";\n\tans = sol.isMatch(s, p);\n\tshowAns(s, p, ans);\n\n\ts = \"\";\n\tp = \"\";\n\tans = sol.isMatch(s, p);\n\tshowAns(s, p, ans);\n\n\ts = \"a\";\n\tp = \"\";\n\tans = sol.isMatch(s, p);\n\tshowAns(s, p, ans);\n\n\ts = \"\";\n\tp = \"a\";\n\tans = sol.isMatch(s, p);\n\tshowAns(s, p, ans);\n\n\ts = \"a\";\n\tp = \"*a\";\n\tans = sol.isMatch(s, p);\n\tshowAns(s, p, ans);\n\n\ts = \"ba\";\n\tp = \"*a\";\n\tans = sol.isMatch(s, p);\n\tshowAns(s, p, ans);\n\n\ts = \"cba\";\n\tp = \"*a\";\n\tans = sol.isMatch(s, p);\n\tshowAns(s, p, ans);\n\n\ts = \"ba\";\n\tp = \"?a\";\n\tans = sol.isMatch(s, p);\n\tshowAns(s, p, ans);\n\n\ts = \"cba\";\n\tp = \"?a\";\n\tans = sol.isMatch(s, p);\n\tshowAns(s, p, ans);\n\n\ts = \"\";\n\tp = \"*\";\n\tans = sol.isMatch(s, p);\n\tshowAns(s, p, ans);\n\n\ts = \"\";\n\tp = \"?\";\n\tans = sol.isMatch(s, p);\n\tshowAns(s, p, ans);\n\n\ts = \"\";\n\tp = \"**\";\n\tans = sol.isMatch(s, p);\n\tshowAns(s, p, ans);\n\n s = \"aaabbbaabaaaaababaabaaabbabbbbbbbbaabababbabbbaaaaba\";\n p = \"a*******b\";\n\tans = sol.isMatch(s, p);\n\tshowAns(s, p, ans);\n\n return 0;\n}\n<|endoftext|>"} {"text":"<commit_before>\/*************************************************************************\n *\n * $RCSfile: accmap.hxx,v $\n *\n * $Revision: 1.23 $\n *\n * last change: $Author: vg $ $Date: 2003-04-24 16:09:27 $\n *\n * The Contents of this file are made available subject to the terms of\n * either of the following licenses\n *\n * - GNU Lesser General Public License Version 2.1\n * - Sun Industry Standards Source License Version 1.1\n *\n * Sun Microsystems Inc., October, 2000\n *\n * GNU Lesser General Public License Version 2.1\n * =============================================\n * Copyright 2000 by Sun Microsystems, Inc.\n * 901 San Antonio Road, Palo Alto, CA 94303, USA\n *\n * This library is free software; you can redistribute it and\/or\n * modify it under the terms of the GNU Lesser General Public\n * License version 2.1, as published by the Free Software Foundation.\n *\n * This library is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU\n * Lesser General Public License for more details.\n *\n * You should have received a copy of the GNU Lesser General Public\n * License along with this library; if not, write to the Free Software\n * Foundation, Inc., 59 Temple Place, Suite 330, Boston,\n * MA 02111-1307 USA\n *\n *\n * Sun Industry Standards Source License Version 1.1\n * =================================================\n * The contents of this file are subject to the Sun Industry Standards\n * Source License Version 1.1 (the \"License\"); You may not use this file\n * except in compliance with the License. You may obtain a copy of the\n * License at http:\/\/www.openoffice.org\/license.html.\n *\n * Software provided under this License is provided on an \"AS IS\" basis,\n * WITHOUT WARRANTY OF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING,\n * WITHOUT LIMITATION, WARRANTIES THAT THE SOFTWARE IS FREE OF DEFECTS,\n * MERCHANTABLE, FIT FOR A PARTICULAR PURPOSE, OR NON-INFRINGING.\n * See the License for the specific provisions governing your rights and\n * obligations concerning the Software.\n *\n * The Initial Developer of the Original Code is: Sun Microsystems, Inc.\n *\n * Copyright: 2000 by Sun Microsystems, Inc.\n *\n * All Rights Reserved.\n *\n * Contributor(s): _______________________________________\n *\n *\n ************************************************************************\/\n#ifndef _ACCMAP_HXX\n#define _ACCMAP_HXX\n\n#ifndef _COM_SUN_STAR_ACCESSIBILITY_XACCESSIBLE_HPP_\n#include <com\/sun\/star\/accessibility\/XAccessible.hpp>\n#endif\n\n#ifndef _SAL_TYPES_H_\n#include <sal\/types.h>\n#endif\n#ifndef _CPPUHELPER_WEAKREF_HXX_\n#include <cppuhelper\/weakref.hxx>\n#endif\n#ifndef _VOS_REF_HXX_\n#include <vos\/ref.hxx>\n#endif\n#ifndef _VOS_MUTEX_HXX_ \/\/autogen\n#include <vos\/mutex.hxx>\n#endif\n#ifndef _SVX_ACCESSIBILITY_IACCESSIBLE_VIEW_FORWARDER_HXX\n#include <svx\/IAccessibleViewForwarder.hxx>\n#endif\n#ifndef _SVX_ACCESSIBILITY_IACCESSIBLE_PARENT_HXX\n#include <svx\/IAccessibleParent.hxx>\n#endif\n#ifndef _VIEWSH_HXX\n#include \"viewsh.hxx\"\n#endif\n\n#ifndef _TOOLS_DEBUG_HXX\n#include <tools\/debug.hxx>\n#endif\n#ifndef _FRACT_HXX\n#include <tools\/fract.hxx>\n#endif\n\n#include <vector>\n\nclass Rectangle;\nclass SwFrm;\nclass SwRootFrm;\nclass SwPageFrm;\nclass SwAccessibleContext;\nclass SwAccessibleContextMap_Impl;\nclass SwAccessibleEventList_Impl;\nclass SwAccessibleEventMap_Impl;\nclass SwShapeList_Impl;\nclass SdrObject;\nnamespace accessibility { class AccessibleShape; }\nclass SwAccessibleShapeMap_Impl;\nstruct SwAccessibleEvent_Impl;\nclass SwRect;\nclass ViewShell;\nclass SwFrmOrObj;\nclass SwAccPreviewData;\n\/\/ OD 14.01.2003 #103492#\n#ifndef _PREVWPAGE_HXX\n#include <prevwpage.hxx>\n#endif\n\n\/\/ real states for events\n#define ACC_STATE_EDITABLE 0x01\n#define ACC_STATE_OPAQUE 0x02\n\n\/\/ pseudo states for events\n#define ACC_STATE_CARET 0x80\n#define ACC_STATE_RELATION_FROM 0x40\n#define ACC_STATE_RELATION_TO 0x20\n\n#define ACC_STATE_RELATION_MASK 0x60\n\n#define ACC_STATE_MASK 0x1F\n\nclass SwAccessibleMap : public accessibility::IAccessibleViewForwarder,\n public accessibility::IAccessibleParent\n{\n ::vos::OMutex maMutex;\n ::vos::OMutex maEventMutex;\n SwAccessibleContextMap_Impl *mpFrmMap;\n SwAccessibleShapeMap_Impl *mpShapeMap;\n SwShapeList_Impl *mpShapes;\n SwAccessibleEventList_Impl *mpEvents;\n SwAccessibleEventMap_Impl *mpEventMap;\n ViewShell *mpVSh;\n \/\/\/ for page preview: store preview data, VisArea, and mapping of\n \/\/\/ preview-to-display coordinates\n SwAccPreviewData* mpPreview;\n\n ::com::sun::star::uno::WeakReference < ::com::sun::star::accessibility::XAccessible > mxCursorContext;\n\n sal_Int32 mnPara;\n sal_Int32 mnFootnote;\n sal_Int32 mnEndnote;\n\n\n sal_Bool mbShapeSelected;\n\n void FireEvent( const SwAccessibleEvent_Impl& rEvent );\n\n void AppendEvent( const SwAccessibleEvent_Impl& rEvent );\n\n void InvalidateCursorPosition(\n const ::com::sun::star::uno::Reference<\n ::com::sun::star::accessibility::XAccessible>& rAcc );\n void DoInvalidateShapeSelection();\n void DoInvalidateShapeFocus();\n void InvalidateShapeSelection();\n\n void _InvalidateRelationSet( const SwFrm* pFrm, sal_Bool bFrom );\n\n ::com::sun::star::uno::Reference<\n ::com::sun::star::accessibility::XAccessible>\n _GetDocumentView( sal_Bool bPagePreview );\n\npublic:\n\n SwAccessibleMap( ViewShell *pSh );\n ~SwAccessibleMap();\n\n ::com::sun::star::uno::Reference<\n ::com::sun::star::accessibility::XAccessible> GetDocumentView();\n\n \/\/ OD 15.01.2003 #103492# - complete re-factoring of method due to new\n \/\/ page\/print preview functionality.\n ::com::sun::star::uno::Reference<\n ::com::sun::star::accessibility::XAccessible> GetDocumentPreview(\n const std::vector<PrevwPage*>& _rPrevwPages,\n const Fraction& _rScale,\n const SwPageFrm* _pSelectedPageFrm,\n const Size& _rPrevwWinSize );\n\n ::vos::ORef < SwAccessibleContext > GetContextImpl(\n const SwFrm *pFrm,\n sal_Bool bCreate = sal_True );\n ::com::sun::star::uno::Reference<\n ::com::sun::star::accessibility::XAccessible> GetContext(\n const SwFrm *pFrm,\n sal_Bool bCreate = sal_True );\n\n ::vos::ORef < ::accessibility::AccessibleShape > GetContextImpl(\n const SdrObject *pObj,\n SwAccessibleContext *pParentImpl,\n sal_Bool bCreate = sal_True );\n ::com::sun::star::uno::Reference<\n ::com::sun::star::accessibility::XAccessible> GetContext(\n const SdrObject *pObj,\n SwAccessibleContext *pParentImpl,\n sal_Bool bCreate = sal_True );\n\n ViewShell *GetShell() const { return mpVSh; }\n inline const SwRect& GetVisArea() const;\n\n \/** get size of a dedicated preview page\n\n OD 15.01.2003 #103492#\n complete re-factoring of previous method due to new page\/print preview\n functionality.\n\n @author OD\n\n @param _nPrevwPageNum\n input parameter - physical page number of page visible in the page preview\n\n @return an object of class <Size>\n *\/\n Size GetPreViewPageSize( sal_uInt16 _nPrevwPageNum ) const;\n\n void RemoveContext( const SwFrm *pFrm );\n void RemoveContext( const SdrObject *pObj );\n\n \/\/ Dispose frame and its children if bRecursive is set\n void Dispose( const SwFrm *pFrm, const SdrObject *pObj,\n sal_Bool bRecursive=sal_False );\n\n void InvalidatePosOrSize( const SwFrm *pFrm, const SdrObject *pObj,\n const SwRect& rOldFrm );\n\n void InvalidateContent( const SwFrm *pFrm );\n\n void InvalidateCursorPosition( const SwFrm *pFrm );\n void InvalidateFocus();\n\n void SetCursorContext(\n const ::vos::ORef < SwAccessibleContext >& rCursorContext );\n\n \/\/ Invalidate state of whole tree. If an action is open, this call\n \/\/ is processed when the last action ends.\n void InvalidateStates( sal_uInt8 nStates, const SwFrm *pFrm=0 );\n\n void InvalidateRelationSet( const SwFrm* pMaster, const SwFrm* pFollow );\n\n \/\/ update preview data (and fire events if necessary)\n \/\/ OD 15.01.2003 #103492# - complete re-factoring of method due to new\n \/\/ page\/print preview functionality.\n void UpdatePreview( const std::vector<PrevwPage*>& _rPrevwPages,\n const Fraction& _rScale,\n const SwPageFrm* _pSelectedPageFrm,\n const Size& _rPrevwWinSize );\n\n void InvalidatePreViewSelection( sal_uInt16 nSelPage );\n sal_Bool IsPageSelected( const SwPageFrm *pPageFrm ) const;\n\n void FireEvents();\n\n\n \/\/ IAccessibleViewForwarder\n\n virtual sal_Bool IsValid() const;\n virtual Rectangle GetVisibleArea() const;\n virtual Point LogicToPixel (const Point& rPoint) const;\n virtual Size LogicToPixel (const Size& rSize) const;\n virtual Point PixelToLogic (const Point& rPoint) const;\n virtual Size PixelToLogic (const Size& rSize) const;\n\n \/\/ IAccessibleParent\n virtual sal_Bool ReplaceChild (\n ::accessibility::AccessibleShape* pCurrentChild,\n const ::com::sun::star::uno::Reference< ::com::sun::star::drawing::XShape >& _rxShape,\n const long _nIndex,\n const ::accessibility::AccessibleShapeTreeInfo& _rShapeTreeInfo\n ) throw (::com::sun::star::uno::RuntimeException);\n\n \/\/ additional Core\/Pixel conversions for internal use; also works\n \/\/ for preview\n Point PixelToCore (const Point& rPoint) const;\n Rectangle CoreToPixel (const Rectangle& rRect) const;\n Rectangle PixelToCore (const Rectangle& rRect) const;\n\nprivate:\n \/** get mapping mode for LogicToPixel and PixelToLogic conversions\n\n OD 15.01.2003 #103492#\n Replacement method <PreviewAdjust(..)> by new method <GetMapMode>.\n Method returns mapping mode of current output device and adjusts it,\n if the shell is in page\/print preview.\n Necessary, because <PreviewAdjust(..)> changes mapping mode at current\n output device for mapping logic document positions to page preview window\n positions and vice versa and doesn't take care to recover its changes.\n\n @author OD\n\n @param _rPoint\n input parameter - constant reference to point to determine the mapping\n mode adjustments for page\/print preview.\n\n @param _orMapMode\n output parameter - reference to the mapping mode, which is determined\n by the method\n *\/\n void GetMapMode( const Point& _rPoint,\n MapMode& _orMapMode ) const;\n};\n\n\n\n\/\/ helper class that stores preview data\nclass SwAccPreviewData\n{\n typedef std::vector<Rectangle> Rectangles;\n Rectangles maPreviewRects;\n Rectangles maLogicRects;\n\n SwRect maVisArea;\n Fraction maScale;\n\n const SwPageFrm *mpSelPage;\n\n \/** adjust logic page retangle to its visible part\n\n OD 17.01.2003 #103492#\n\n @author OD\n\n @param _iorLogicPgSwRect\n input\/output parameter - reference to the logic page rectangle, which\n has to be adjusted.\n\n @param _rPrevwPgSwRect\n input parameter - constant reference to the corresponding preview page\n rectangle; needed to determine the visible part of the logic page rectangle.\n\n @param _rPrevwWinSize\n input paramter - constant reference to the preview window size in TWIP;\n needed to determine the visible part of the logic page rectangle\n *\/\n void AdjustLogicPgRectToVisibleArea( SwRect& _iorLogicPgSwRect,\n const SwRect& _rPrevwPgSwRect,\n const Size& _rPrevwWinSize );\n\npublic:\n SwAccPreviewData();\n ~SwAccPreviewData();\n\n \/\/ OD 14.01.2003 #103492# - complete re-factoring of method due to new\n \/\/ page\/print preview functionality.\n void Update( const std::vector<PrevwPage*>& _rPrevwPages,\n const Fraction& _rScale,\n const SwPageFrm* _pSelectedPageFrm,\n const Size& _rPrevwWinSize );\n\n \/\/ OD 14.01.2003 #103492# - complete re-factoring of method due to new\n \/\/ page\/print preview functionality.\n void InvalidateSelection( const SwPageFrm* _pSelectedPageFrm );\n\n const SwRect& GetVisArea() const;\n\n MapMode GetMapModeForPreview( ) const;\n\n \/** Adjust the MapMode so that the preview page appears at the\n * proper position. rPoint identifies the page for which the\n * MapMode should be adjusted. If bFromPreview is true, rPoint is\n * a preview coordinate; else it's a document coordinate. *\/\n \/\/ OD 17.01.2003 #103492# - delete unused 3rd parameter.\n void AdjustMapMode( MapMode& rMapMode,\n const Point& rPoint ) const;\n\n inline const SwPageFrm *GetSelPage() const { return mpSelPage; }\n\n void DisposePage(const SwPageFrm *pPageFrm );\n};\n\n\n\ninline const SwRect& SwAccessibleMap::GetVisArea() const\n{\n DBG_ASSERT( !mpVSh->IsPreView() || (mpPreview != NULL),\n \"preview without preview data?\" );\n return mpVSh->IsPreView() ? mpPreview->GetVisArea() : mpVSh->VisArea();\n}\n#endif\n<commit_msg>INTEGRATION: CWS tune05 (1.23.564); FILE MERGED 2004\/07\/22 10:55:11 cmc 1.23.564.1: #i30554# unused SwAccessibleMap::PixelToCore varient<commit_after>\/*************************************************************************\n *\n * $RCSfile: accmap.hxx,v $\n *\n * $Revision: 1.24 $\n *\n * last change: $Author: obo $ $Date: 2004-08-12 11:59:25 $\n *\n * The Contents of this file are made available subject to the terms of\n * either of the following licenses\n *\n * - GNU Lesser General Public License Version 2.1\n * - Sun Industry Standards Source License Version 1.1\n *\n * Sun Microsystems Inc., October, 2000\n *\n * GNU Lesser General Public License Version 2.1\n * =============================================\n * Copyright 2000 by Sun Microsystems, Inc.\n * 901 San Antonio Road, Palo Alto, CA 94303, USA\n *\n * This library is free software; you can redistribute it and\/or\n * modify it under the terms of the GNU Lesser General Public\n * License version 2.1, as published by the Free Software Foundation.\n *\n * This library is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU\n * Lesser General Public License for more details.\n *\n * You should have received a copy of the GNU Lesser General Public\n * License along with this library; if not, write to the Free Software\n * Foundation, Inc., 59 Temple Place, Suite 330, Boston,\n * MA 02111-1307 USA\n *\n *\n * Sun Industry Standards Source License Version 1.1\n * =================================================\n * The contents of this file are subject to the Sun Industry Standards\n * Source License Version 1.1 (the \"License\"); You may not use this file\n * except in compliance with the License. You may obtain a copy of the\n * License at http:\/\/www.openoffice.org\/license.html.\n *\n * Software provided under this License is provided on an \"AS IS\" basis,\n * WITHOUT WARRANTY OF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING,\n * WITHOUT LIMITATION, WARRANTIES THAT THE SOFTWARE IS FREE OF DEFECTS,\n * MERCHANTABLE, FIT FOR A PARTICULAR PURPOSE, OR NON-INFRINGING.\n * See the License for the specific provisions governing your rights and\n * obligations concerning the Software.\n *\n * The Initial Developer of the Original Code is: Sun Microsystems, Inc.\n *\n * Copyright: 2000 by Sun Microsystems, Inc.\n *\n * All Rights Reserved.\n *\n * Contributor(s): _______________________________________\n *\n *\n ************************************************************************\/\n#ifndef _ACCMAP_HXX\n#define _ACCMAP_HXX\n\n#ifndef _COM_SUN_STAR_ACCESSIBILITY_XACCESSIBLE_HPP_\n#include <com\/sun\/star\/accessibility\/XAccessible.hpp>\n#endif\n\n#ifndef _SAL_TYPES_H_\n#include <sal\/types.h>\n#endif\n#ifndef _CPPUHELPER_WEAKREF_HXX_\n#include <cppuhelper\/weakref.hxx>\n#endif\n#ifndef _VOS_REF_HXX_\n#include <vos\/ref.hxx>\n#endif\n#ifndef _VOS_MUTEX_HXX_ \/\/autogen\n#include <vos\/mutex.hxx>\n#endif\n#ifndef _SVX_ACCESSIBILITY_IACCESSIBLE_VIEW_FORWARDER_HXX\n#include <svx\/IAccessibleViewForwarder.hxx>\n#endif\n#ifndef _SVX_ACCESSIBILITY_IACCESSIBLE_PARENT_HXX\n#include <svx\/IAccessibleParent.hxx>\n#endif\n#ifndef _VIEWSH_HXX\n#include \"viewsh.hxx\"\n#endif\n\n#ifndef _TOOLS_DEBUG_HXX\n#include <tools\/debug.hxx>\n#endif\n#ifndef _FRACT_HXX\n#include <tools\/fract.hxx>\n#endif\n\n#include <vector>\n\nclass Rectangle;\nclass SwFrm;\nclass SwRootFrm;\nclass SwPageFrm;\nclass SwAccessibleContext;\nclass SwAccessibleContextMap_Impl;\nclass SwAccessibleEventList_Impl;\nclass SwAccessibleEventMap_Impl;\nclass SwShapeList_Impl;\nclass SdrObject;\nnamespace accessibility { class AccessibleShape; }\nclass SwAccessibleShapeMap_Impl;\nstruct SwAccessibleEvent_Impl;\nclass SwRect;\nclass ViewShell;\nclass SwFrmOrObj;\nclass SwAccPreviewData;\n\/\/ OD 14.01.2003 #103492#\n#ifndef _PREVWPAGE_HXX\n#include <prevwpage.hxx>\n#endif\n\n\/\/ real states for events\n#define ACC_STATE_EDITABLE 0x01\n#define ACC_STATE_OPAQUE 0x02\n\n\/\/ pseudo states for events\n#define ACC_STATE_CARET 0x80\n#define ACC_STATE_RELATION_FROM 0x40\n#define ACC_STATE_RELATION_TO 0x20\n\n#define ACC_STATE_RELATION_MASK 0x60\n\n#define ACC_STATE_MASK 0x1F\n\nclass SwAccessibleMap : public accessibility::IAccessibleViewForwarder,\n public accessibility::IAccessibleParent\n{\n ::vos::OMutex maMutex;\n ::vos::OMutex maEventMutex;\n SwAccessibleContextMap_Impl *mpFrmMap;\n SwAccessibleShapeMap_Impl *mpShapeMap;\n SwShapeList_Impl *mpShapes;\n SwAccessibleEventList_Impl *mpEvents;\n SwAccessibleEventMap_Impl *mpEventMap;\n ViewShell *mpVSh;\n \/\/\/ for page preview: store preview data, VisArea, and mapping of\n \/\/\/ preview-to-display coordinates\n SwAccPreviewData* mpPreview;\n\n ::com::sun::star::uno::WeakReference < ::com::sun::star::accessibility::XAccessible > mxCursorContext;\n\n sal_Int32 mnPara;\n sal_Int32 mnFootnote;\n sal_Int32 mnEndnote;\n\n\n sal_Bool mbShapeSelected;\n\n void FireEvent( const SwAccessibleEvent_Impl& rEvent );\n\n void AppendEvent( const SwAccessibleEvent_Impl& rEvent );\n\n void InvalidateCursorPosition(\n const ::com::sun::star::uno::Reference<\n ::com::sun::star::accessibility::XAccessible>& rAcc );\n void DoInvalidateShapeSelection();\n void DoInvalidateShapeFocus();\n void InvalidateShapeSelection();\n\n void _InvalidateRelationSet( const SwFrm* pFrm, sal_Bool bFrom );\n\n ::com::sun::star::uno::Reference<\n ::com::sun::star::accessibility::XAccessible>\n _GetDocumentView( sal_Bool bPagePreview );\n\npublic:\n\n SwAccessibleMap( ViewShell *pSh );\n ~SwAccessibleMap();\n\n ::com::sun::star::uno::Reference<\n ::com::sun::star::accessibility::XAccessible> GetDocumentView();\n\n \/\/ OD 15.01.2003 #103492# - complete re-factoring of method due to new\n \/\/ page\/print preview functionality.\n ::com::sun::star::uno::Reference<\n ::com::sun::star::accessibility::XAccessible> GetDocumentPreview(\n const std::vector<PrevwPage*>& _rPrevwPages,\n const Fraction& _rScale,\n const SwPageFrm* _pSelectedPageFrm,\n const Size& _rPrevwWinSize );\n\n ::vos::ORef < SwAccessibleContext > GetContextImpl(\n const SwFrm *pFrm,\n sal_Bool bCreate = sal_True );\n ::com::sun::star::uno::Reference<\n ::com::sun::star::accessibility::XAccessible> GetContext(\n const SwFrm *pFrm,\n sal_Bool bCreate = sal_True );\n\n ::vos::ORef < ::accessibility::AccessibleShape > GetContextImpl(\n const SdrObject *pObj,\n SwAccessibleContext *pParentImpl,\n sal_Bool bCreate = sal_True );\n ::com::sun::star::uno::Reference<\n ::com::sun::star::accessibility::XAccessible> GetContext(\n const SdrObject *pObj,\n SwAccessibleContext *pParentImpl,\n sal_Bool bCreate = sal_True );\n\n ViewShell *GetShell() const { return mpVSh; }\n inline const SwRect& GetVisArea() const;\n\n \/** get size of a dedicated preview page\n\n OD 15.01.2003 #103492#\n complete re-factoring of previous method due to new page\/print preview\n functionality.\n\n @author OD\n\n @param _nPrevwPageNum\n input parameter - physical page number of page visible in the page preview\n\n @return an object of class <Size>\n *\/\n Size GetPreViewPageSize( sal_uInt16 _nPrevwPageNum ) const;\n\n void RemoveContext( const SwFrm *pFrm );\n void RemoveContext( const SdrObject *pObj );\n\n \/\/ Dispose frame and its children if bRecursive is set\n void Dispose( const SwFrm *pFrm, const SdrObject *pObj,\n sal_Bool bRecursive=sal_False );\n\n void InvalidatePosOrSize( const SwFrm *pFrm, const SdrObject *pObj,\n const SwRect& rOldFrm );\n\n void InvalidateContent( const SwFrm *pFrm );\n\n void InvalidateCursorPosition( const SwFrm *pFrm );\n void InvalidateFocus();\n\n void SetCursorContext(\n const ::vos::ORef < SwAccessibleContext >& rCursorContext );\n\n \/\/ Invalidate state of whole tree. If an action is open, this call\n \/\/ is processed when the last action ends.\n void InvalidateStates( sal_uInt8 nStates, const SwFrm *pFrm=0 );\n\n void InvalidateRelationSet( const SwFrm* pMaster, const SwFrm* pFollow );\n\n \/\/ update preview data (and fire events if necessary)\n \/\/ OD 15.01.2003 #103492# - complete re-factoring of method due to new\n \/\/ page\/print preview functionality.\n void UpdatePreview( const std::vector<PrevwPage*>& _rPrevwPages,\n const Fraction& _rScale,\n const SwPageFrm* _pSelectedPageFrm,\n const Size& _rPrevwWinSize );\n\n void InvalidatePreViewSelection( sal_uInt16 nSelPage );\n sal_Bool IsPageSelected( const SwPageFrm *pPageFrm ) const;\n\n void FireEvents();\n\n\n \/\/ IAccessibleViewForwarder\n\n virtual sal_Bool IsValid() const;\n virtual Rectangle GetVisibleArea() const;\n virtual Point LogicToPixel (const Point& rPoint) const;\n virtual Size LogicToPixel (const Size& rSize) const;\n virtual Point PixelToLogic (const Point& rPoint) const;\n virtual Size PixelToLogic (const Size& rSize) const;\n\n \/\/ IAccessibleParent\n virtual sal_Bool ReplaceChild (\n ::accessibility::AccessibleShape* pCurrentChild,\n const ::com::sun::star::uno::Reference< ::com::sun::star::drawing::XShape >& _rxShape,\n const long _nIndex,\n const ::accessibility::AccessibleShapeTreeInfo& _rShapeTreeInfo\n ) throw (::com::sun::star::uno::RuntimeException);\n\n \/\/ additional Core\/Pixel conversions for internal use; also works\n \/\/ for preview\n Point PixelToCore (const Point& rPoint) const;\n Rectangle CoreToPixel (const Rectangle& rRect) const;\n\nprivate:\n \/** get mapping mode for LogicToPixel and PixelToLogic conversions\n\n OD 15.01.2003 #103492#\n Replacement method <PreviewAdjust(..)> by new method <GetMapMode>.\n Method returns mapping mode of current output device and adjusts it,\n if the shell is in page\/print preview.\n Necessary, because <PreviewAdjust(..)> changes mapping mode at current\n output device for mapping logic document positions to page preview window\n positions and vice versa and doesn't take care to recover its changes.\n\n @author OD\n\n @param _rPoint\n input parameter - constant reference to point to determine the mapping\n mode adjustments for page\/print preview.\n\n @param _orMapMode\n output parameter - reference to the mapping mode, which is determined\n by the method\n *\/\n void GetMapMode( const Point& _rPoint,\n MapMode& _orMapMode ) const;\n};\n\n\n\n\/\/ helper class that stores preview data\nclass SwAccPreviewData\n{\n typedef std::vector<Rectangle> Rectangles;\n Rectangles maPreviewRects;\n Rectangles maLogicRects;\n\n SwRect maVisArea;\n Fraction maScale;\n\n const SwPageFrm *mpSelPage;\n\n \/** adjust logic page retangle to its visible part\n\n OD 17.01.2003 #103492#\n\n @author OD\n\n @param _iorLogicPgSwRect\n input\/output parameter - reference to the logic page rectangle, which\n has to be adjusted.\n\n @param _rPrevwPgSwRect\n input parameter - constant reference to the corresponding preview page\n rectangle; needed to determine the visible part of the logic page rectangle.\n\n @param _rPrevwWinSize\n input paramter - constant reference to the preview window size in TWIP;\n needed to determine the visible part of the logic page rectangle\n *\/\n void AdjustLogicPgRectToVisibleArea( SwRect& _iorLogicPgSwRect,\n const SwRect& _rPrevwPgSwRect,\n const Size& _rPrevwWinSize );\n\npublic:\n SwAccPreviewData();\n ~SwAccPreviewData();\n\n \/\/ OD 14.01.2003 #103492# - complete re-factoring of method due to new\n \/\/ page\/print preview functionality.\n void Update( const std::vector<PrevwPage*>& _rPrevwPages,\n const Fraction& _rScale,\n const SwPageFrm* _pSelectedPageFrm,\n const Size& _rPrevwWinSize );\n\n \/\/ OD 14.01.2003 #103492# - complete re-factoring of method due to new\n \/\/ page\/print preview functionality.\n void InvalidateSelection( const SwPageFrm* _pSelectedPageFrm );\n\n const SwRect& GetVisArea() const;\n\n MapMode GetMapModeForPreview( ) const;\n\n \/** Adjust the MapMode so that the preview page appears at the\n * proper position. rPoint identifies the page for which the\n * MapMode should be adjusted. If bFromPreview is true, rPoint is\n * a preview coordinate; else it's a document coordinate. *\/\n \/\/ OD 17.01.2003 #103492# - delete unused 3rd parameter.\n void AdjustMapMode( MapMode& rMapMode,\n const Point& rPoint ) const;\n\n inline const SwPageFrm *GetSelPage() const { return mpSelPage; }\n\n void DisposePage(const SwPageFrm *pPageFrm );\n};\n\n\n\ninline const SwRect& SwAccessibleMap::GetVisArea() const\n{\n DBG_ASSERT( !mpVSh->IsPreView() || (mpPreview != NULL),\n \"preview without preview data?\" );\n return mpVSh->IsPreView() ? mpPreview->GetVisArea() : mpVSh->VisArea();\n}\n#endif\n<|endoftext|>"} {"text":"<commit_before>\/*************************************************************************\n *\n * $RCSfile: flypos.hxx,v $\n *\n * $Revision: 1.1.1.1 $\n *\n * last change: $Author: hr $ $Date: 2000-09-18 17:14:25 $\n *\n * The Contents of this file are made available subject to the terms of\n * either of the following licenses\n *\n * - GNU Lesser General Public License Version 2.1\n * - Sun Industry Standards Source License Version 1.1\n *\n * Sun Microsystems Inc., October, 2000\n *\n * GNU Lesser General Public License Version 2.1\n * =============================================\n * Copyright 2000 by Sun Microsystems, Inc.\n * 901 San Antonio Road, Palo Alto, CA 94303, USA\n *\n * This library is free software; you can redistribute it and\/or\n * modify it under the terms of the GNU Lesser General Public\n * License version 2.1, as published by the Free Software Foundation.\n *\n * This library is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU\n * Lesser General Public License for more details.\n *\n * You should have received a copy of the GNU Lesser General Public\n * License along with this library; if not, write to the Free Software\n * Foundation, Inc., 59 Temple Place, Suite 330, Boston,\n * MA 02111-1307 USA\n *\n *\n * Sun Industry Standards Source License Version 1.1\n * =================================================\n * The contents of this file are subject to the Sun Industry Standards\n * Source License Version 1.1 (the \"License\"); You may not use this file\n * except in compliance with the License. You may obtain a copy of the\n * License at http:\/\/www.openoffice.org\/license.html.\n *\n * Software provided under this License is provided on an \"AS IS\" basis,\n * WITHOUT WARRANTY OF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING,\n * WITHOUT LIMITATION, WARRANTIES THAT THE SOFTWARE IS FREE OF DEFECTS,\n * MERCHANTABLE, FIT FOR A PARTICULAR PURPOSE, OR NON-INFRINGING.\n * See the License for the specific provisions governing your rights and\n * obligations concerning the Software.\n *\n * The Initial Developer of the Original Code is: Sun Microsystems, Inc.\n *\n * Copyright: 2000 by Sun Microsystems, Inc.\n *\n * All Rights Reserved.\n *\n * Contributor(s): _______________________________________\n *\n *\n ************************************************************************\/\n#ifndef _FLYPOS_HXX\n#define _FLYPOS_HXX\n\n\n#ifndef _SVARRAY_HXX \/\/autogen\n#include <svtools\/svarray.hxx>\n#endif\n\nclass SwCntntNode;\nclass ViewShell;\nclass SwFrmFmt;\nclass SwNodeIndex;\n\n\/\/ Struktur zum Erfragen der akt. freifliegenden Rahmen am Dokument.\nclass SwPosFlyFrm\n{\n const SwFrmFmt* pFrmFmt; \/\/ das FlyFrmFmt\n\/\/ SwPosition* pPos; \/\/ Position in den ContentNode\n SwNodeIndex* pNdIdx; \/\/ es reicht ein Index auf den Node\n UINT32 nOrdNum;\npublic:\n SwPosFlyFrm( const SwNodeIndex& , const SwFrmFmt*, USHORT nArrPos );\n virtual ~SwPosFlyFrm(); \/\/ virtual fuer die Writer (DLL !!)\n\n \/\/ operatoren fuer das Sort-Array\n BOOL operator==( const SwPosFlyFrm& );\n BOOL operator<( const SwPosFlyFrm& );\n\n const SwFrmFmt& GetFmt() const { return *pFrmFmt; }\n const SwNodeIndex& GetNdIndex() const { return *pNdIdx; }\n UINT32 GetOrdNum() const { return nOrdNum; }\n};\n\ntypedef SwPosFlyFrm* SwPosFlyFrmPtr;\nSV_DECL_PTRARR_SORT( SwPosFlyFrms, SwPosFlyFrmPtr, 0, 40 )\n\n#endif _FLYPOS_HXX\n<commit_msg>INTEGRATION: CWS rt02 (1.1.1.1.438); FILE MERGED 2003\/09\/30 15:44:03 rt 1.1.1.1.438.1: #i19697# Fixed comment after preprocessor directive<commit_after>\/*************************************************************************\n *\n * $RCSfile: flypos.hxx,v $\n *\n * $Revision: 1.2 $\n *\n * last change: $Author: rt $ $Date: 2003-10-06 14:31: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 _FLYPOS_HXX\n#define _FLYPOS_HXX\n\n\n#ifndef _SVARRAY_HXX \/\/autogen\n#include <svtools\/svarray.hxx>\n#endif\n\nclass SwCntntNode;\nclass ViewShell;\nclass SwFrmFmt;\nclass SwNodeIndex;\n\n\/\/ Struktur zum Erfragen der akt. freifliegenden Rahmen am Dokument.\nclass SwPosFlyFrm\n{\n const SwFrmFmt* pFrmFmt; \/\/ das FlyFrmFmt\n\/\/ SwPosition* pPos; \/\/ Position in den ContentNode\n SwNodeIndex* pNdIdx; \/\/ es reicht ein Index auf den Node\n UINT32 nOrdNum;\npublic:\n SwPosFlyFrm( const SwNodeIndex& , const SwFrmFmt*, USHORT nArrPos );\n virtual ~SwPosFlyFrm(); \/\/ virtual fuer die Writer (DLL !!)\n\n \/\/ operatoren fuer das Sort-Array\n BOOL operator==( const SwPosFlyFrm& );\n BOOL operator<( const SwPosFlyFrm& );\n\n const SwFrmFmt& GetFmt() const { return *pFrmFmt; }\n const SwNodeIndex& GetNdIndex() const { return *pNdIdx; }\n UINT32 GetOrdNum() const { return nOrdNum; }\n};\n\ntypedef SwPosFlyFrm* SwPosFlyFrmPtr;\nSV_DECL_PTRARR_SORT( SwPosFlyFrms, SwPosFlyFrmPtr, 0, 40 )\n\n#endif \/\/ _FLYPOS_HXX\n<|endoftext|>"} {"text":"<commit_before>\/\/ $Id$\n\/\/\n\/\/ Copyright (c) 2007, Novartis Institutes for BioMedical Research Inc.\n\/\/ All rights reserved.\n\/\/ \n\/\/ Redistribution and use in source and binary forms, with or without\n\/\/ modification, are permitted provided that the following conditions are\n\/\/ met: \n\/\/\n\/\/ * Redistributions of source code must retain the above copyright \n\/\/ notice, this list of conditions and the following disclaimer.\n\/\/ * Redistributions in binary form must reproduce the above\n\/\/ copyright notice, this list of conditions and the following \n\/\/ disclaimer in the documentation and\/or other materials provided \n\/\/ with the distribution.\n\/\/ * Neither the name of Novartis Institutues for BioMedical Research Inc. \n\/\/ nor the names of its contributors may be used to endorse or promote \n\/\/ products derived from this software without specific prior written permission.\n\/\/\n\/\/ THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS\n\/\/ \"AS IS\" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT\n\/\/ LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR\n\/\/ A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT\n\/\/ OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,\n\/\/ SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT\n\/\/ LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,\n\/\/ DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY\n\/\/ THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT\n\/\/ (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE\n\/\/ OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.\n\/\/\n#include <boost\/python.hpp>\n#include <GraphMol\/ChemReactions\/Reaction.h>\n#include <GraphMol\/ChemReactions\/ReactionPickler.h>\n#include <GraphMol\/ChemReactions\/ReactionParser.h>\n\n#include <RDBoost\/Wrap.h>\n#include <RDBoost\/Exceptions.h>\n#include <GraphMol\/SanitException.h>\n#include <RDGeneral\/FileParseException.h>\n\nnamespace python = boost::python;\n\n\nvoid rdChemicalReactionParserExceptionTranslator(RDKit::ChemicalReactionParserException const& x){\n std::ostringstream ss;\n ss << \"ChemicalReactionParserException: \" << x.message();\n PyErr_SetString(PyExc_ValueError,ss.str().c_str());\n}\nvoid rdChemicalReactionExceptionTranslator(RDKit::ChemicalReactionException const& x){\n std::ostringstream ss;\n ss << \"ChemicalParserException: \" << x.message();\n PyErr_SetString(PyExc_ValueError,ss.str().c_str());\n}\n\nnamespace RDKit {\n std::string ReactionToBinary(const ChemicalReaction &self){\n std::string res;\n ReactionPickler::pickleReaction(self,res);\n return res;\n }\n \/\/\n \/\/ allows reactions to be pickled.\n \/\/\n struct reaction_pickle_suite : python::pickle_suite\n {\n static python::tuple\n getinitargs(const ChemicalReaction & self)\n {\n return python::make_tuple(ReactionToBinary(self));\n };\n };\n\n\n template <typename T>\n PyObject* RunReactants(ChemicalReaction *self,T reactants){\n if(!self->isInitialized()){\n self->initReactantMatchers();\n }\n MOL_SPTR_VECT reacts;\n unsigned int len1 = python::extract<unsigned int>(reactants.attr(\"__len__\")());\n reacts.resize(len1);\n for(unsigned int i=0;i<len1;++i){\n reacts[i] = python::extract<ROMOL_SPTR>(reactants[i]);\n }\n std::vector<MOL_SPTR_VECT> mols;\n mols = self->runReactants(reacts);\n PyObject *res=PyTuple_New(mols.size());\n \n for(unsigned int i=0;i<mols.size();++i){\n PyObject *lTpl =PyTuple_New(mols[i].size());\n for(unsigned int j=0;j<mols[i].size();++j){\n PyTuple_SetItem(lTpl,j,\n python::converter::shared_ptr_to_python(mols[i][j]));\n }\n PyTuple_SetItem(res,i,lTpl);\n }\n return res;\n }\n\n python::tuple ValidateReaction(const ChemicalReaction *self,bool silent=false){\n unsigned int numWarn,numError;\n self->validate(numWarn,numError,silent);\n return python::make_tuple(numWarn,numError);\n }\n\n ROMol * GetProductTemplate(const ChemicalReaction *self,unsigned int which){\n if(which>=self->getNumProductTemplates()){\n throw_value_error(\"requested template index too high\");\n }\n MOL_SPTR_VECT::const_iterator iter=self->beginProductTemplates();\n iter += which;\n ROMol *res = const_cast<ROMol *>(iter->get());\n return res;\n }\n ROMol * GetReactantTemplate(const ChemicalReaction *self,unsigned int which){\n if(which>=self->getNumReactantTemplates()){\n throw_value_error(\"requested template index too high\");\n }\n MOL_SPTR_VECT::const_iterator iter=self->beginReactantTemplates();\n iter += which;\n ROMol *res = const_cast<ROMol *>(iter->get());\n return res;\n }\n\n}\n\nBOOST_PYTHON_MODULE(rdChemReactions) {\n python::scope().attr(\"__doc__\") =\n \"Module containing classes and functions for working with chemical reactions.\"\n ;\n\n python::register_exception_translator<RDKit::ChemicalReactionParserException>(&rdChemicalReactionParserExceptionTranslator);\n python::register_exception_translator<RDKit::ChemicalReactionException>(&rdChemicalReactionExceptionTranslator);\n \n std::string docString = \"A class for storing and applying chemical reactions.\\n\\\n\\n\\\nSample Usage:\\n\\\n>>> rxn = rdChemReactions.ReactionFromSmarts('[C:1](=[O:2])O.[N:3]>>[C:1](=[O:2])[N:3]')\\n\\\n>>> reacts = (Chem.MolFromSmiles('C(=O)O'),Chem.MolFromSmiles('CNC'))\\n\\\n>>> products = rxn.RunReactants(reacts)\\n\\\n>>> len(products)\\n\\\n1\\n\\\n>>> len(products[0])\\n\\\n1\\n\\\n>>> Chem.MolToSmiles(products[0])\\n\\\n'CN(C)C=O'\\n\\\n\\n\\\n\";\n python::class_<RDKit::ChemicalReaction>(\"ChemicalReaction\",docString.c_str(),\n python::init<>(\"Constructor, takes no arguments\"))\n .def(python::init<const std::string &>())\n .def(\"GetNumReactantTemplates\",&RDKit::ChemicalReaction::getNumReactantTemplates,\n \"returns the number of reactants this reaction expects\")\n .def(\"GetNumProductTemplates\",&RDKit::ChemicalReaction::getNumProductTemplates,\n \"returns the number of products this reaction generates\")\n .def(\"AddReactantTemplate\",&RDKit::ChemicalReaction::addReactantTemplate,\n \"adds a reactant (a Molecule) to the reaction\")\n .def(\"AddProductTemplate\",&RDKit::ChemicalReaction::addProductTemplate,\n \"adds a product (a Molecule)\")\n .def(\"RunReactants\",(PyObject *(*)(RDKit::ChemicalReaction *,python::tuple))RDKit::RunReactants,\n \"apply the reaction to a sequence of reactant molecules and return the products as a tuple of tuples\")\n .def(\"RunReactants\",(PyObject *(*)(RDKit::ChemicalReaction *,python::list))RDKit::RunReactants,\n \"apply the reaction to a sequence of reactant molecules and return the products as a tuple of tuples\")\n .def(\"Initialize\",&RDKit::ChemicalReaction::initReactantMatchers,\n \"initializes the reaction so that it can be used\")\n .def(\"IsInitialized\",&RDKit::ChemicalReaction::isInitialized,\n \"checks if the reaction is ready for use\")\n .def(\"Validate\",&RDKit::ValidateReaction,\n (python::arg(\"self\"),python::arg(\"silent\")=false),\n \"checks the reaction for potential problems, returns (numWarnings,numErrors)\")\n .def(\"GetProductTemplate\",&RDKit::GetProductTemplate,\n (python::arg(\"self\"),python::arg(\"which\")),\n python::return_value_policy<python::reference_existing_object>(),\n \"returns one of our product templates\")\n .def(\"GetReactantTemplate\",&RDKit::GetReactantTemplate,\n (python::arg(\"self\"),python::arg(\"which\")),\n python::return_value_policy<python::reference_existing_object>(),\n \"returns one of our reactant templates\")\n .def(\"_setImplicitPropertiesFlag\",&RDKit::ChemicalReaction::setImplicitPropertiesFlag,\n (python::arg(\"self\"),python::arg(\"val\")),\n \"EXPERT USER: indicates that the reaction can have implicit properties\")\n .def(\"_getImplicitPropertiesFlag\",&RDKit::ChemicalReaction::getImplicitPropertiesFlag,\n (python::arg(\"self\")),\n \"EXPERT USER: returns whether or not the reaction can have implicit properties\")\n .def(\"ToBinary\",RDKit::ReactionToBinary,\n \"Returns a binary string representation of the reaction.\\n\")\n \/\/ enable pickle support\n .def_pickle(RDKit::reaction_pickle_suite())\n\n ;\n\n def(\"ReactionFromSmarts\",RDKit::RxnSmartsToChemicalReaction,\n \"construct a ChemicalReaction from a reaction SMARTS string\",\n python::return_value_policy<python::manage_new_object>());\n def(\"ReactionFromRxnFile\",RDKit::RxnFileToChemicalReaction,\n \"construct a ChemicalReaction from an MDL rxn file\",\n python::return_value_policy<python::manage_new_object>());\n def(\"ReactionFromRxnBlock\",RDKit::RxnBlockToChemicalReaction,\n \"construct a ChemicalReaction from an string in MDL rxn format\",\n python::return_value_policy<python::manage_new_object>());\n def(\"ReactionToSmarts\",RDKit::ChemicalReactionToRxnSmarts,\n (python::arg(\"reaction\")),\n \"construct a reaction SMARTS string for a ChemicalReaction\");\n}\n \n<commit_msg>checked that in too early<commit_after>\/\/ $Id$\n\/\/\n\/\/ Copyright (c) 2007, Novartis Institutes for BioMedical Research Inc.\n\/\/ All rights reserved.\n\/\/ \n\/\/ Redistribution and use in source and binary forms, with or without\n\/\/ modification, are permitted provided that the following conditions are\n\/\/ met: \n\/\/\n\/\/ * Redistributions of source code must retain the above copyright \n\/\/ notice, this list of conditions and the following disclaimer.\n\/\/ * Redistributions in binary form must reproduce the above\n\/\/ copyright notice, this list of conditions and the following \n\/\/ disclaimer in the documentation and\/or other materials provided \n\/\/ with the distribution.\n\/\/ * Neither the name of Novartis Institutues for BioMedical Research Inc. \n\/\/ nor the names of its contributors may be used to endorse or promote \n\/\/ products derived from this software without specific prior written permission.\n\/\/\n\/\/ THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS\n\/\/ \"AS IS\" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT\n\/\/ LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR\n\/\/ A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT\n\/\/ OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,\n\/\/ SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT\n\/\/ LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,\n\/\/ DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY\n\/\/ THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT\n\/\/ (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE\n\/\/ OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.\n\/\/\n#include <boost\/python.hpp>\n#include <GraphMol\/ChemReactions\/Reaction.h>\n#include <GraphMol\/ChemReactions\/ReactionPickler.h>\n#include <GraphMol\/ChemReactions\/ReactionParser.h>\n\n#include <RDBoost\/Wrap.h>\n#include <RDBoost\/Exceptions.h>\n#include <GraphMol\/SanitException.h>\n#include <RDGeneral\/FileParseException.h>\n\nnamespace python = boost::python;\n\n\nvoid rdChemicalReactionParserExceptionTranslator(RDKit::ChemicalReactionParserException const& x){\n std::ostringstream ss;\n ss << \"ChemicalReactionParserException: \" << x.message();\n PyErr_SetString(PyExc_ValueError,ss.str().c_str());\n}\nvoid rdChemicalReactionExceptionTranslator(RDKit::ChemicalReactionException const& x){\n std::ostringstream ss;\n ss << \"ChemicalParserException: \" << x.message();\n PyErr_SetString(PyExc_ValueError,ss.str().c_str());\n}\n\nnamespace RDKit {\n std::string ReactionToBinary(const ChemicalReaction &self){\n std::string res;\n ReactionPickler::pickleReaction(self,res);\n return res;\n }\n \/\/\n \/\/ allows reactions to be pickled.\n \/\/\n struct reaction_pickle_suite : python::pickle_suite\n {\n static python::tuple\n getinitargs(const ChemicalReaction & self)\n {\n return python::make_tuple(ReactionToBinary(self));\n };\n };\n\n\n template <typename T>\n PyObject* RunReactants(ChemicalReaction *self,T reactants){\n if(!self->isInitialized()){\n self->initReactantMatchers();\n }\n MOL_SPTR_VECT reacts;\n unsigned int len1 = python::extract<unsigned int>(reactants.attr(\"__len__\")());\n reacts.resize(len1);\n for(unsigned int i=0;i<len1;++i){\n reacts[i] = python::extract<ROMOL_SPTR>(reactants[i]);\n }\n std::vector<MOL_SPTR_VECT> mols;\n mols = self->runReactants(reacts);\n PyObject *res=PyTuple_New(mols.size());\n \n for(unsigned int i=0;i<mols.size();++i){\n PyObject *lTpl =PyTuple_New(mols[i].size());\n for(unsigned int j=0;j<mols[i].size();++j){\n PyTuple_SetItem(lTpl,j,\n python::converter::shared_ptr_to_python(mols[i][j]));\n }\n PyTuple_SetItem(res,i,lTpl);\n }\n return res;\n }\n\n python::tuple ValidateReaction(const ChemicalReaction *self,bool silent=false){\n unsigned int numWarn,numError;\n self->validate(numWarn,numError,silent);\n return python::make_tuple(numWarn,numError);\n }\n\n ROMol * GetProductTemplate(const ChemicalReaction *self,unsigned int which){\n if(which>=self->getNumProductTemplates()){\n throw_value_error(\"requested template index too high\");\n }\n MOL_SPTR_VECT::const_iterator iter=self->beginProductTemplates();\n iter += which;\n ROMol *res = const_cast<ROMol *>(iter->get());\n return res;\n }\n ROMol * GetReactantTemplate(const ChemicalReaction *self,unsigned int which){\n if(which>=self->getNumReactantTemplates()){\n throw_value_error(\"requested template index too high\");\n }\n MOL_SPTR_VECT::const_iterator iter=self->beginReactantTemplates();\n iter += which;\n ROMol *res = const_cast<ROMol *>(iter->get());\n return res;\n }\n\n}\n\nBOOST_PYTHON_MODULE(rdChemReactions) {\n python::scope().attr(\"__doc__\") =\n \"Module containing classes and functions for working with chemical reactions.\"\n ;\n\n python::register_exception_translator<RDKit::ChemicalReactionParserException>(&rdChemicalReactionParserExceptionTranslator);\n python::register_exception_translator<RDKit::ChemicalReactionException>(&rdChemicalReactionExceptionTranslator);\n \n std::string docString = \"A class for storing and applying chemical reactions.\\n\\\n\\n\\\nSample Usage:\\n\\\n>>> rxn = rdChemReactions.ReactionFromSmarts('[C:1](=[O:2])O.[N:3]>>[C:1](=[O:2])[N:3]')\\n\\\n>>> reacts = (Chem.MolFromSmiles('C(=O)O'),Chem.MolFromSmiles('CNC'))\\n\\\n>>> products = rxn.RunReactants(reacts)\\n\\\n>>> len(products)\\n\\\n1\\n\\\n>>> len(products[0])\\n\\\n1\\n\\\n>>> Chem.MolToSmiles(products[0])\\n\\\n'CN(C)C=O'\\n\\\n\\n\\\n\";\n python::class_<RDKit::ChemicalReaction>(\"ChemicalReaction\",docString.c_str(),\n python::init<>(\"Constructor, takes no arguments\"))\n .def(python::init<const std::string &>())\n .def(\"GetNumReactantTemplates\",&RDKit::ChemicalReaction::getNumReactantTemplates,\n \"returns the number of reactants this reaction expects\")\n .def(\"GetNumProductTemplates\",&RDKit::ChemicalReaction::getNumProductTemplates,\n \"returns the number of products this reaction generates\")\n .def(\"AddReactantTemplate\",&RDKit::ChemicalReaction::addReactantTemplate,\n \"adds a reactant (a Molecule) to the reaction\")\n .def(\"AddProductTemplate\",&RDKit::ChemicalReaction::addProductTemplate,\n \"adds a product (a Molecule)\")\n .def(\"RunReactants\",(PyObject *(*)(RDKit::ChemicalReaction *,python::tuple))RDKit::RunReactants,\n \"apply the reaction to a sequence of reactant molecules and return the products as a tuple of tuples\")\n .def(\"RunReactants\",(PyObject *(*)(RDKit::ChemicalReaction *,python::list))RDKit::RunReactants,\n \"apply the reaction to a sequence of reactant molecules and return the products as a tuple of tuples\")\n .def(\"Initialize\",&RDKit::ChemicalReaction::initReactantMatchers,\n \"initializes the reaction so that it can be used\")\n .def(\"IsInitialized\",&RDKit::ChemicalReaction::isInitialized,\n \"checks if the reaction is ready for use\")\n .def(\"Validate\",&RDKit::ValidateReaction,\n (python::arg(\"self\"),python::arg(\"silent\")=false),\n \"checks the reaction for potential problems, returns (numWarnings,numErrors)\")\n .def(\"GetProductTemplate\",&RDKit::GetProductTemplate,\n (python::arg(\"self\"),python::arg(\"which\")),\n python::return_value_policy<python::reference_existing_object>(),\n \"returns one of our product templates\")\n .def(\"GetReactantTemplate\",&RDKit::GetReactantTemplate,\n (python::arg(\"self\"),python::arg(\"which\")),\n python::return_value_policy<python::reference_existing_object>(),\n \"returns one of our reactant templates\")\n .def(\"_setImplicitPropertiesFlag\",&RDKit::ChemicalReaction::setImplicitPropertiesFlag,\n (python::arg(\"self\"),python::arg(\"val\")),\n \"EXPERT USER: indicates that the reaction can have implicit properties\")\n .def(\"_getImplicitPropertiesFlag\",&RDKit::ChemicalReaction::getImplicitPropertiesFlag,\n (python::arg(\"self\")),\n \"EXPERT USER: returns whether or not the reaction can have implicit properties\")\n .def(\"ToBinary\",RDKit::ReactionToBinary,\n \"Returns a binary string representation of the reaction.\\n\")\n \/\/ enable pickle support\n .def_pickle(RDKit::reaction_pickle_suite())\n\n ;\n\n def(\"ReactionFromSmarts\",RDKit::RxnSmartsToChemicalReaction,\n \"construct a ChemicalReaction from a reaction SMARTS string\",\n python::return_value_policy<python::manage_new_object>());\n def(\"ReactionFromRxnFile\",RDKit::RxnFileToChemicalReaction,\n \"construct a ChemicalReaction from an MDL rxn file\",\n python::return_value_policy<python::manage_new_object>());\n def(\"ReactionFromRxnBlock\",RDKit::RxnBlockToChemicalReaction,\n \"construct a ChemicalReaction from an string in MDL rxn format\",\n python::return_value_policy<python::manage_new_object>());\n \/\/def(\"ReactionToSmarts\",RDKit::ChemicalReactionToRxnSmarts,\n \/\/ (python::arg(\"reaction\")),\n \/\/ \"construct a reaction SMARTS string for a ChemicalReaction\");\n}\n \n<|endoftext|>"} {"text":"<commit_before>\/*************************************************************************\r\n* UrBackup - Client\/Server backup system\r\n* Copyright (C) 2011-2016 Martin Raiber\r\n*\r\n* This program is free software: you can redistribute it and\/or modify\r\n* it under the terms of the GNU Affero General Public License as published by\r\n* the Free Software Foundation, either version 3 of the License, or\r\n* (at your option) any later version.\r\n*\r\n* This program is distributed in the hope that it will be useful,\r\n* but WITHOUT ANY WARRANTY; without even the implied warranty of\r\n* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the\r\n* GNU Affero General Public License for more details.\r\n*\r\n* You should have received a copy of the GNU Affero General Public License\r\n* along with this program. If not, see <http:\/\/www.gnu.org\/licenses\/>.\r\n**************************************************************************\/\r\n#include \"server_update.h\"\r\n#include \"..\/urlplugin\/IUrlFactory.h\"\r\n#include \"..\/Interface\/Server.h\"\r\n#include \"..\/Interface\/File.h\"\r\n#include \"..\/stringtools.h\"\r\n#include \"..\/urbackupcommon\/os_functions.h\"\r\n#include \"DataplanDb.h\"\r\n#include <stdlib.h>\r\n#include <memory>\r\n\r\nextern IUrlFactory *url_fak;\r\n\r\nnamespace\r\n{\r\n\tstd::string urbackup_update_url = \"http:\/\/update5.urbackup.org\/\";\r\n\tstd::string urbackup_update_url_alt;\r\n\r\n\tstruct SUpdatePlatform\r\n\t{\r\n\t\tSUpdatePlatform(std::string extension,\r\n\t\t\tstd::string basename, std::string versionname)\r\n\t\t\t: extension(extension), basename(basename),\r\n\t\t\tversionname(versionname)\r\n\t\t{}\r\n\t\tstd::string extension;\r\n\t\tstd::string basename;\r\n\t\tstd::string versionname;\r\n\t};\r\n}\r\n\r\nServerUpdate::ServerUpdate(void)\r\n{\r\n}\r\n\r\nvoid ServerUpdate::update_client()\r\n{\r\n\tif(url_fak==NULL)\r\n\t{\r\n\t\tServer->Log(\"Urlplugin not found. Cannot download client for autoupdate.\", LL_ERROR);\r\n\t\treturn;\r\n\t}\r\n\r\n\tread_update_location();\r\n\r\n\tstd::string http_proxy = Server->getServerParameter(\"http_proxy\");\r\n\r\n\tstd::vector<SUpdatePlatform> update_files;\r\n\r\n\tupdate_files.push_back(SUpdatePlatform(\"exe\", \"UrBackupUpdate\", \"version.txt\"));\r\n\tupdate_files.push_back(SUpdatePlatform(\"sh\", \"UrBackupUpdateMac\", \"version_osx.txt\"));\r\n\tupdate_files.push_back(SUpdatePlatform(\"sh\", \"UrBackupUpdateLinux\", \"version_linux.txt\"));\r\n\r\n\tstd::string curr_update_url = urbackup_update_url;\r\n\r\n\tfor (size_t i = 0; i < update_files.size(); ++i)\r\n\t{\r\n\t\tSUpdatePlatform& curr = update_files[i];\r\n\r\n\t\tstd::string errmsg;\r\n\t\tServer->Log(\"Downloading version file...\", LL_INFO);\r\n\t\tstd::string version = url_fak->downloadString(curr_update_url + curr.versionname, http_proxy, &errmsg);\r\n\t\tif (version.empty())\r\n\t\t{\r\n\t\t\tif (curr_update_url == urbackup_update_url\r\n\t\t\t\t&& !urbackup_update_url_alt.empty())\r\n\t\t\t{\r\n\t\t\t\tcurr_update_url = urbackup_update_url_alt;\r\n\t\t\t\tversion = url_fak->downloadString(curr_update_url + curr.versionname, http_proxy, &errmsg);\r\n\t\t\t}\r\n\r\n\t\t\tif (version.empty())\r\n\t\t\t{\r\n\t\t\t\tServer->Log(\"Error while downloading version info from \" + curr_update_url + curr.versionname + \": \" + errmsg, LL_ERROR);\r\n\t\t\t\tcontinue;\r\n\t\t\t}\r\n\t\t}\r\n\r\n\t\tstd::string curr_version = getFile(\"urbackup\/\"+curr.versionname);\r\n\t\tif (curr_version.empty()) curr_version = \"0\";\r\n\r\n\t\tif (version!=curr_version)\r\n\t\t{\r\n\t\t\tServer->Log(\"Downloading signature...\", LL_INFO);\r\n\r\n\t\t\tbool dl_ok = true;\r\n\r\n\t\t\tstd::auto_ptr<IFile> sig_file(Server->openFile(\"urbackup\/\" + curr.basename + \".sig2.new\", MODE_WRITE));\r\n\t\t\tif (sig_file.get() == NULL)\r\n\t\t\t{\r\n\t\t\t\tServer->Log(\"Error opening signature output file urbackup\/\" + curr.basename + \".sig2.new\", LL_ERROR);\r\n\t\t\t\treturn;\r\n\t\t\t}\r\n\r\n\t\t\tbool b = url_fak->downloadFile(curr_update_url + curr.basename + \".sig2\", sig_file.get(), http_proxy, &errmsg);\r\n\r\n\t\t\tif (!b)\r\n\t\t\t{\r\n\t\t\t\tServer->Log(\"Error while downloading update signature from \" + curr_update_url + curr.basename + \".sig2: \" + errmsg, LL_ERROR);\r\n\t\t\t\tdl_ok = false;\r\n\t\t\t}\r\n\r\n\t\t\tif (curr.extension == \"exe\")\r\n\t\t\t{\r\n\t\t\t\tServer->Log(\"Downloading old signature...\", LL_INFO);\r\n\r\n\t\t\t\tstd::auto_ptr<IFile> old_sig_file(Server->openFile(\"urbackup\/\" + curr.basename + \".sig.new\", MODE_WRITE));\r\n\t\t\t\tif (old_sig_file.get() == NULL)\r\n\t\t\t\t{\r\n\t\t\t\t\tServer->Log(\"Error opening signature output file urbackup\/\" + curr.basename + \".sig.new\", LL_ERROR);\r\n\t\t\t\t\treturn;\r\n\t\t\t\t}\r\n\r\n\t\t\t\tbool b = url_fak->downloadFile(curr_update_url + curr.basename + \".sig\", old_sig_file.get(), http_proxy, &errmsg);\r\n\r\n\t\t\t\tif (!b)\r\n\t\t\t\t{\r\n\t\t\t\t\tServer->Log(\"Error while downloading old update signature from \" + curr_update_url + curr.basename + \".sig: \" + errmsg, LL_ERROR);\r\n\t\t\t\t\tdl_ok = false;\r\n\t\t\t\t}\r\n\t\t\t\telse\r\n\t\t\t\t{\r\n\t\t\t\t\told_sig_file->Sync();\r\n\t\t\t\t}\r\n\t\t\t}\r\n\r\n\t\t\tServer->Log(\"Getting update file URL...\", LL_INFO);\r\n\t\t\tstd::string update_url = url_fak->downloadString(curr_update_url + curr.basename + \".url\", http_proxy, &errmsg);\r\n\t\t\tstd::auto_ptr<IFile> update_file;\r\n\r\n\t\t\tif (update_url.empty())\r\n\t\t\t{\r\n\t\t\t\tServer->Log(\"Error while downloading update url from \" + curr_update_url + curr.basename + \".url: \" + errmsg, LL_ERROR);\r\n\t\t\t\tdl_ok = false;\r\n\t\t\t}\r\n\t\t\telse\r\n\t\t\t{\r\n\t\t\t\tupdate_file.reset(Server->openFile(\"urbackup\/\" + curr.basename + \".\" + curr.extension + \".new\", MODE_WRITE));\r\n\t\t\t\tif (update_file.get() == NULL)\r\n\t\t\t\t{\r\n\t\t\t\t\tServer->Log(\"Error opening update output file urbackup\/\" + curr.basename + \".\" + curr.extension, LL_ERROR);\r\n\t\t\t\t\treturn;\r\n\t\t\t\t}\r\n\r\n\t\t\t\tServer->Log(\"Downloading update file...\", LL_INFO);\r\n\t\t\t\tb = url_fak->downloadFile(update_url, update_file.get(), http_proxy, &errmsg);\r\n\r\n\t\t\t\tif (!b)\r\n\t\t\t\t{\r\n\t\t\t\t\tServer->Log(\"Error while downloading update file from \" + update_url + \": \" + errmsg, LL_ERROR);\r\n\t\t\t\t\tdl_ok = false;\r\n\t\t\t\t}\r\n\t\t\t}\r\n\r\n\t\t\tif (dl_ok)\r\n\t\t\t{\r\n\t\t\t\tsig_file->Sync();\r\n\t\t\t\tupdate_file->Sync();\r\n\r\n\t\t\t\tsig_file.reset();\r\n\t\t\t\tupdate_file.reset();\r\n\r\n\t\t\t\tvoid* trans = os_start_transaction();\r\n\r\n\t\t\t\tif (os_rename_file(\"urbackup\/\" + curr.basename + \".sig2.new\", \"urbackup\/\" + curr.basename + \".sig2\", trans)\r\n\t\t\t\t\t&& os_rename_file(\"urbackup\/\" + curr.basename + \".\" + curr.extension + \".new\", \"urbackup\/\" + curr.basename + \".\" + curr.extension, trans)\r\n\t\t\t\t\t&& (curr.extension != \"exe\" || os_rename_file(\"urbackup\/\" + curr.basename + \".sig.new\", \"urbackup\/\" + curr.basename + \".sig\", trans))\r\n\t\t\t\t\t&& (trans==NULL || os_finish_transaction(trans)) )\r\n\t\t\t\t{\r\n\t\t\t\t\tServer->Log(\"Successfully downloaded update file.\", LL_INFO);\r\n\t\t\t\t\twritestring(version, \"urbackup\/\" + curr.versionname);\r\n\t\t\t\t}\r\n\t\t\t\telse\r\n\t\t\t\t{\r\n\t\t\t\t\tServer->Log(\"Renaming update files to final location failed. \" + os_last_error_str(), LL_ERROR);\r\n\t\t\t\t}\r\n\t\t\t}\r\n\t\t\telse\r\n\t\t\t{\r\n\t\t\t\tstd::string del_fn = sig_file->getFilename();\r\n\t\t\t\tsig_file.reset();\r\n\t\t\t\tServer->deleteFile(del_fn);\r\n\r\n\t\t\t\tdel_fn = update_file->getFilename();\r\n\t\t\t\tupdate_file.reset();\r\n\t\t\t\tServer->deleteFile(del_fn);\r\n\t\t\t}\r\n\t\t}\r\n\t}\r\n}\r\n\r\nvoid ServerUpdate::update_server_version_info()\r\n{\r\n\tif(url_fak==NULL)\r\n\t{\r\n\t\tServer->Log(\"Urlplugin not found. Cannot download server version info.\", LL_ERROR);\r\n\t\treturn;\r\n\t}\r\n\r\n\tread_update_location();\r\n\r\n\tstd::string http_proxy = Server->getServerParameter(\"http_proxy\");\r\n\r\n\tstd::string errmsg;\r\n\tServer->Log(\"Downloading server version info...\", LL_INFO);\r\n\r\n\tstd::auto_ptr<IFile> server_version_info(Server->openFile(\"urbackup\/server_version_info.properties.new\", MODE_WRITE));\r\n\r\n\tif(!server_version_info.get())\r\n\t{\r\n\t\tServer->Log(\"Error opening urbackup\/server_version_info.properties.new for writing\", LL_ERROR);\r\n\t}\r\n\telse\r\n\t{\r\n\t\tif(!url_fak->downloadFile(urbackup_update_url+\"server_version_info.properties\", \r\n\t\t\tserver_version_info.get(), http_proxy, &errmsg) )\r\n\t\t{\r\n\t\t\tServer->Log(\"Error downloading server version information: \" + errmsg, LL_ERROR);\r\n\t\t}\r\n\t\telse\r\n\t\t{\r\n\t\t\tserver_version_info.reset();\r\n\t\t\tif (!os_rename_file(\"urbackup\/server_version_info.properties.new\",\r\n\t\t\t\t\t\t\t\t\"urbackup\/server_version_info.properties\"))\r\n\t\t\t{\r\n\t\t\t\tServer->Log(\"Error renaming server_version_info.properties . \" + os_last_error_str(), LL_ERROR);\r\n\t\t\t}\r\n\t\t}\r\n\t}\t\r\n}\r\n\r\nvoid ServerUpdate::update_dataplan_db()\r\n{\r\n\tif (url_fak == NULL)\r\n\t{\r\n\t\tServer->Log(\"Urlplugin not found. Cannot download dataplan database.\", LL_ERROR);\r\n\t\treturn;\r\n\t}\r\n\r\n\tread_update_location();\r\n\r\n\tstd::string http_proxy = Server->getServerParameter(\"http_proxy\");\r\n\r\n\tstd::string errmsg;\r\n\tServer->Log(\"Downloading dataplan database...\", LL_INFO);\r\n\r\n\tstd::auto_ptr<IFile> dataplan_db(Server->openFile(\"urbackup\/dataplan_db.txt.new\", MODE_WRITE));\r\n\tif (!dataplan_db.get())\r\n\t{\r\n\t\tServer->Log(\"Error opening urbackup\/dataplan_db.txt.new for writing\", LL_ERROR);\r\n\t}\r\n\telse\r\n\t{\r\n\t\tif (!url_fak->downloadFile(urbackup_update_url + \"dataplan_db.txt\",\r\n\t\t\tdataplan_db.get(), http_proxy, &errmsg))\r\n\t\t{\r\n\t\t\tServer->Log(\"Error downloading dataplan database: \" + errmsg, LL_ERROR);\r\n\t\t}\r\n\t\telse\r\n\t\t{\r\n\t\t\tdataplan_db.reset();\r\n\t\t\tif (!os_rename_file(\"urbackup\/dataplan_db.txt.new\",\r\n\t\t\t\t\"urbackup\/dataplan_db.txt\"))\r\n\t\t\t{\r\n\t\t\t\tServer->Log(\"Error renaming urbackup\/dataplan_db.txt. \" + os_last_error_str(), LL_ERROR);\r\n\t\t\t}\r\n\r\n\t\t\tDataplanDb::getInstance()->read(\"urbackup\/dataplan_db.txt\");\r\n\t\t}\r\n\r\n\t}\r\n}\r\n\r\nvoid ServerUpdate::read_update_location()\r\n{\r\n\tstd::string read_update_location = trim(getFile(\"urbackup\/server_update_location.url\"));\r\n\r\n\tif (!read_update_location.empty())\r\n\t{\r\n\t\turbackup_update_url_alt = read_update_location;\r\n\t\turbackup_update_url = urbackup_update_url_alt;\r\n\r\n\t\tif (!urbackup_update_url.empty()\r\n\t\t\t&& urbackup_update_url[urbackup_update_url.size() - 1] != '\/')\r\n\t\t\turbackup_update_url += \"\/\";\r\n\r\n\t\turbackup_update_url += \"2.2.x\/\";\r\n\t}\r\n}\r\n<commit_msg>Change update location<commit_after>\/*************************************************************************\r\n* UrBackup - Client\/Server backup system\r\n* Copyright (C) 2011-2016 Martin Raiber\r\n*\r\n* This program is free software: you can redistribute it and\/or modify\r\n* it under the terms of the GNU Affero General Public License as published by\r\n* the Free Software Foundation, either version 3 of the License, or\r\n* (at your option) any later version.\r\n*\r\n* This program is distributed in the hope that it will be useful,\r\n* but WITHOUT ANY WARRANTY; without even the implied warranty of\r\n* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the\r\n* GNU Affero General Public License for more details.\r\n*\r\n* You should have received a copy of the GNU Affero General Public License\r\n* along with this program. If not, see <http:\/\/www.gnu.org\/licenses\/>.\r\n**************************************************************************\/\r\n#include \"server_update.h\"\r\n#include \"..\/urlplugin\/IUrlFactory.h\"\r\n#include \"..\/Interface\/Server.h\"\r\n#include \"..\/Interface\/File.h\"\r\n#include \"..\/stringtools.h\"\r\n#include \"..\/urbackupcommon\/os_functions.h\"\r\n#include \"DataplanDb.h\"\r\n#include <stdlib.h>\r\n#include <memory>\r\n\r\nextern IUrlFactory *url_fak;\r\n\r\nnamespace\r\n{\r\n\tstd::string urbackup_update_url = \"http:\/\/update6.urbackup.org\/\";\r\n\tstd::string urbackup_update_url_alt;\r\n\r\n\tstruct SUpdatePlatform\r\n\t{\r\n\t\tSUpdatePlatform(std::string extension,\r\n\t\t\tstd::string basename, std::string versionname)\r\n\t\t\t: extension(extension), basename(basename),\r\n\t\t\tversionname(versionname)\r\n\t\t{}\r\n\t\tstd::string extension;\r\n\t\tstd::string basename;\r\n\t\tstd::string versionname;\r\n\t};\r\n}\r\n\r\nServerUpdate::ServerUpdate(void)\r\n{\r\n}\r\n\r\nvoid ServerUpdate::update_client()\r\n{\r\n\tif(url_fak==NULL)\r\n\t{\r\n\t\tServer->Log(\"Urlplugin not found. Cannot download client for autoupdate.\", LL_ERROR);\r\n\t\treturn;\r\n\t}\r\n\r\n\tread_update_location();\r\n\r\n\tstd::string http_proxy = Server->getServerParameter(\"http_proxy\");\r\n\r\n\tstd::vector<SUpdatePlatform> update_files;\r\n\r\n\tupdate_files.push_back(SUpdatePlatform(\"exe\", \"UrBackupUpdate\", \"version.txt\"));\r\n\tupdate_files.push_back(SUpdatePlatform(\"sh\", \"UrBackupUpdateMac\", \"version_osx.txt\"));\r\n\tupdate_files.push_back(SUpdatePlatform(\"sh\", \"UrBackupUpdateLinux\", \"version_linux.txt\"));\r\n\r\n\tstd::string curr_update_url = urbackup_update_url;\r\n\r\n\tfor (size_t i = 0; i < update_files.size(); ++i)\r\n\t{\r\n\t\tSUpdatePlatform& curr = update_files[i];\r\n\r\n\t\tstd::string errmsg;\r\n\t\tServer->Log(\"Downloading version file...\", LL_INFO);\r\n\t\tstd::string version = url_fak->downloadString(curr_update_url + curr.versionname, http_proxy, &errmsg);\r\n\t\tif (version.empty())\r\n\t\t{\r\n\t\t\tif (curr_update_url == urbackup_update_url\r\n\t\t\t\t&& !urbackup_update_url_alt.empty())\r\n\t\t\t{\r\n\t\t\t\tcurr_update_url = urbackup_update_url_alt;\r\n\t\t\t\tversion = url_fak->downloadString(curr_update_url + curr.versionname, http_proxy, &errmsg);\r\n\t\t\t}\r\n\r\n\t\t\tif (version.empty())\r\n\t\t\t{\r\n\t\t\t\tServer->Log(\"Error while downloading version info from \" + curr_update_url + curr.versionname + \": \" + errmsg, LL_ERROR);\r\n\t\t\t\tcontinue;\r\n\t\t\t}\r\n\t\t}\r\n\r\n\t\tstd::string curr_version = getFile(\"urbackup\/\"+curr.versionname);\r\n\t\tif (curr_version.empty()) curr_version = \"0\";\r\n\r\n\t\tif (version!=curr_version)\r\n\t\t{\r\n\t\t\tServer->Log(\"Downloading signature...\", LL_INFO);\r\n\r\n\t\t\tbool dl_ok = true;\r\n\r\n\t\t\tstd::auto_ptr<IFile> sig_file(Server->openFile(\"urbackup\/\" + curr.basename + \".sig2.new\", MODE_WRITE));\r\n\t\t\tif (sig_file.get() == NULL)\r\n\t\t\t{\r\n\t\t\t\tServer->Log(\"Error opening signature output file urbackup\/\" + curr.basename + \".sig2.new\", LL_ERROR);\r\n\t\t\t\treturn;\r\n\t\t\t}\r\n\r\n\t\t\tbool b = url_fak->downloadFile(curr_update_url + curr.basename + \".sig2\", sig_file.get(), http_proxy, &errmsg);\r\n\r\n\t\t\tif (!b)\r\n\t\t\t{\r\n\t\t\t\tServer->Log(\"Error while downloading update signature from \" + curr_update_url + curr.basename + \".sig2: \" + errmsg, LL_ERROR);\r\n\t\t\t\tdl_ok = false;\r\n\t\t\t}\r\n\r\n\t\t\tif (curr.extension == \"exe\")\r\n\t\t\t{\r\n\t\t\t\tServer->Log(\"Downloading old signature...\", LL_INFO);\r\n\r\n\t\t\t\tstd::auto_ptr<IFile> old_sig_file(Server->openFile(\"urbackup\/\" + curr.basename + \".sig.new\", MODE_WRITE));\r\n\t\t\t\tif (old_sig_file.get() == NULL)\r\n\t\t\t\t{\r\n\t\t\t\t\tServer->Log(\"Error opening signature output file urbackup\/\" + curr.basename + \".sig.new\", LL_ERROR);\r\n\t\t\t\t\treturn;\r\n\t\t\t\t}\r\n\r\n\t\t\t\tbool b = url_fak->downloadFile(curr_update_url + curr.basename + \".sig\", old_sig_file.get(), http_proxy, &errmsg);\r\n\r\n\t\t\t\tif (!b)\r\n\t\t\t\t{\r\n\t\t\t\t\tServer->Log(\"Error while downloading old update signature from \" + curr_update_url + curr.basename + \".sig: \" + errmsg, LL_ERROR);\r\n\t\t\t\t\tdl_ok = false;\r\n\t\t\t\t}\r\n\t\t\t\telse\r\n\t\t\t\t{\r\n\t\t\t\t\told_sig_file->Sync();\r\n\t\t\t\t}\r\n\t\t\t}\r\n\r\n\t\t\tServer->Log(\"Getting update file URL...\", LL_INFO);\r\n\t\t\tstd::string update_url = url_fak->downloadString(curr_update_url + curr.basename + \".url\", http_proxy, &errmsg);\r\n\t\t\tstd::auto_ptr<IFile> update_file;\r\n\r\n\t\t\tif (update_url.empty())\r\n\t\t\t{\r\n\t\t\t\tServer->Log(\"Error while downloading update url from \" + curr_update_url + curr.basename + \".url: \" + errmsg, LL_ERROR);\r\n\t\t\t\tdl_ok = false;\r\n\t\t\t}\r\n\t\t\telse\r\n\t\t\t{\r\n\t\t\t\tupdate_file.reset(Server->openFile(\"urbackup\/\" + curr.basename + \".\" + curr.extension + \".new\", MODE_WRITE));\r\n\t\t\t\tif (update_file.get() == NULL)\r\n\t\t\t\t{\r\n\t\t\t\t\tServer->Log(\"Error opening update output file urbackup\/\" + curr.basename + \".\" + curr.extension, LL_ERROR);\r\n\t\t\t\t\treturn;\r\n\t\t\t\t}\r\n\r\n\t\t\t\tServer->Log(\"Downloading update file...\", LL_INFO);\r\n\t\t\t\tb = url_fak->downloadFile(update_url, update_file.get(), http_proxy, &errmsg);\r\n\r\n\t\t\t\tif (!b)\r\n\t\t\t\t{\r\n\t\t\t\t\tServer->Log(\"Error while downloading update file from \" + update_url + \": \" + errmsg, LL_ERROR);\r\n\t\t\t\t\tdl_ok = false;\r\n\t\t\t\t}\r\n\t\t\t}\r\n\r\n\t\t\tif (dl_ok)\r\n\t\t\t{\r\n\t\t\t\tsig_file->Sync();\r\n\t\t\t\tupdate_file->Sync();\r\n\r\n\t\t\t\tsig_file.reset();\r\n\t\t\t\tupdate_file.reset();\r\n\r\n\t\t\t\tvoid* trans = os_start_transaction();\r\n\r\n\t\t\t\tif (os_rename_file(\"urbackup\/\" + curr.basename + \".sig2.new\", \"urbackup\/\" + curr.basename + \".sig2\", trans)\r\n\t\t\t\t\t&& os_rename_file(\"urbackup\/\" + curr.basename + \".\" + curr.extension + \".new\", \"urbackup\/\" + curr.basename + \".\" + curr.extension, trans)\r\n\t\t\t\t\t&& (curr.extension != \"exe\" || os_rename_file(\"urbackup\/\" + curr.basename + \".sig.new\", \"urbackup\/\" + curr.basename + \".sig\", trans))\r\n\t\t\t\t\t&& (trans==NULL || os_finish_transaction(trans)) )\r\n\t\t\t\t{\r\n\t\t\t\t\tServer->Log(\"Successfully downloaded update file.\", LL_INFO);\r\n\t\t\t\t\twritestring(version, \"urbackup\/\" + curr.versionname);\r\n\t\t\t\t}\r\n\t\t\t\telse\r\n\t\t\t\t{\r\n\t\t\t\t\tServer->Log(\"Renaming update files to final location failed. \" + os_last_error_str(), LL_ERROR);\r\n\t\t\t\t}\r\n\t\t\t}\r\n\t\t\telse\r\n\t\t\t{\r\n\t\t\t\tstd::string del_fn = sig_file->getFilename();\r\n\t\t\t\tsig_file.reset();\r\n\t\t\t\tServer->deleteFile(del_fn);\r\n\r\n\t\t\t\tdel_fn = update_file->getFilename();\r\n\t\t\t\tupdate_file.reset();\r\n\t\t\t\tServer->deleteFile(del_fn);\r\n\t\t\t}\r\n\t\t}\r\n\t}\r\n}\r\n\r\nvoid ServerUpdate::update_server_version_info()\r\n{\r\n\tif(url_fak==NULL)\r\n\t{\r\n\t\tServer->Log(\"Urlplugin not found. Cannot download server version info.\", LL_ERROR);\r\n\t\treturn;\r\n\t}\r\n\r\n\tread_update_location();\r\n\r\n\tstd::string http_proxy = Server->getServerParameter(\"http_proxy\");\r\n\r\n\tstd::string errmsg;\r\n\tServer->Log(\"Downloading server version info...\", LL_INFO);\r\n\r\n\tstd::auto_ptr<IFile> server_version_info(Server->openFile(\"urbackup\/server_version_info.properties.new\", MODE_WRITE));\r\n\r\n\tif(!server_version_info.get())\r\n\t{\r\n\t\tServer->Log(\"Error opening urbackup\/server_version_info.properties.new for writing\", LL_ERROR);\r\n\t}\r\n\telse\r\n\t{\r\n\t\tif(!url_fak->downloadFile(urbackup_update_url+\"server_version_info.properties\", \r\n\t\t\tserver_version_info.get(), http_proxy, &errmsg) )\r\n\t\t{\r\n\t\t\tServer->Log(\"Error downloading server version information: \" + errmsg, LL_ERROR);\r\n\t\t}\r\n\t\telse\r\n\t\t{\r\n\t\t\tserver_version_info.reset();\r\n\t\t\tif (!os_rename_file(\"urbackup\/server_version_info.properties.new\",\r\n\t\t\t\t\t\t\t\t\"urbackup\/server_version_info.properties\"))\r\n\t\t\t{\r\n\t\t\t\tServer->Log(\"Error renaming server_version_info.properties . \" + os_last_error_str(), LL_ERROR);\r\n\t\t\t}\r\n\t\t}\r\n\t}\t\r\n}\r\n\r\nvoid ServerUpdate::update_dataplan_db()\r\n{\r\n\tif (url_fak == NULL)\r\n\t{\r\n\t\tServer->Log(\"Urlplugin not found. Cannot download dataplan database.\", LL_ERROR);\r\n\t\treturn;\r\n\t}\r\n\r\n\tread_update_location();\r\n\r\n\tstd::string http_proxy = Server->getServerParameter(\"http_proxy\");\r\n\r\n\tstd::string errmsg;\r\n\tServer->Log(\"Downloading dataplan database...\", LL_INFO);\r\n\r\n\tstd::auto_ptr<IFile> dataplan_db(Server->openFile(\"urbackup\/dataplan_db.txt.new\", MODE_WRITE));\r\n\tif (!dataplan_db.get())\r\n\t{\r\n\t\tServer->Log(\"Error opening urbackup\/dataplan_db.txt.new for writing\", LL_ERROR);\r\n\t}\r\n\telse\r\n\t{\r\n\t\tif (!url_fak->downloadFile(urbackup_update_url + \"dataplan_db.txt\",\r\n\t\t\tdataplan_db.get(), http_proxy, &errmsg))\r\n\t\t{\r\n\t\t\tServer->Log(\"Error downloading dataplan database: \" + errmsg, LL_ERROR);\r\n\t\t}\r\n\t\telse\r\n\t\t{\r\n\t\t\tdataplan_db.reset();\r\n\t\t\tif (!os_rename_file(\"urbackup\/dataplan_db.txt.new\",\r\n\t\t\t\t\"urbackup\/dataplan_db.txt\"))\r\n\t\t\t{\r\n\t\t\t\tServer->Log(\"Error renaming urbackup\/dataplan_db.txt. \" + os_last_error_str(), LL_ERROR);\r\n\t\t\t}\r\n\r\n\t\t\tDataplanDb::getInstance()->read(\"urbackup\/dataplan_db.txt\");\r\n\t\t}\r\n\r\n\t}\r\n}\r\n\r\nvoid ServerUpdate::read_update_location()\r\n{\r\n\tstd::string read_update_location = trim(getFile(\"urbackup\/server_update_location.url\"));\r\n\r\n\tif (!read_update_location.empty())\r\n\t{\r\n\t\turbackup_update_url_alt = read_update_location;\r\n\t\turbackup_update_url = urbackup_update_url_alt;\r\n\r\n\t\tif (!urbackup_update_url.empty()\r\n\t\t\t&& urbackup_update_url[urbackup_update_url.size() - 1] != '\/')\r\n\t\t\turbackup_update_url += \"\/\";\r\n\r\n\t\turbackup_update_url += \"2.2.x\/\";\r\n\t}\r\n}\r\n<|endoftext|>"} {"text":"<commit_before>\/\/\n\/\/ EnvelopeGenerator.hpp\n\/\/ Clock Signal\n\/\/\n\/\/ Created by Thomas Harte on 01\/05\/2020.\n\/\/ Copyright © 2020 Thomas Harte. All rights reserved.\n\/\/\n\n#ifndef EnvelopeGenerator_h\n#define EnvelopeGenerator_h\n\n#include <optional>\n#include <functional>\n#include \"LowFrequencyOscillator.hpp\"\n\nnamespace Yamaha {\nnamespace OPL {\n\n\/*!\n\tModels an OPL-style envelope generator.\n\n\tDamping is optional; if damping is enabled then if there is a transition to key-on while\n\tattenuation is less than maximum then attenuation will be quickly transitioned to maximum\n\tbefore the attack phase can begin.\n\n\tin real hardware damping is used by the envelope generators associated with\n\tcarriers, with phases being reset upon the transition from damping to attack.\n\n\tThis code considers application of tremolo to be a function of the envelope generator;\n\tthis is largely for logical conformity with the phase generator that necessarily has to\n\tapply vibrato.\n\n\tTODO: use envelope_precision.\n*\/\ntemplate <int envelope_precision, int period_precision> class EnvelopeGenerator {\n\tpublic:\n\t\t\/*!\n\t\t\tAdvances the envelope generator a single step, given the current state of the low-frequency oscillator, @c oscillator.\n\t\t*\/\n\t\tvoid update(const LowFrequencyOscillator &oscillator) {\n\t\t\t\/\/ Apply tremolo, which is fairly easy.\n\t\t\ttremolo_ = tremolo_enable_ * oscillator.tremolo << 4;\n\n\t\t\t\/\/ Something something something...\n\t\t\tconst int key_scaling_rate = key_scale_rate_ >> key_scale_rate_shift_;\n\t\t\tswitch(phase_) {\n\t\t\t\tcase Phase::Damp:\n\t\t\t\t\tupdate_decay(oscillator, 12 << 2);\n\t\t\t\t\tif(attenuation_ == 511) {\n\t\t\t\t\t\t(*will_attack_)();\n\t\t\t\t\t\tphase_ = Phase::Attack;\n\t\t\t\t\t}\n\t\t\t\tbreak;\n\n\t\t\t\tcase Phase::Attack:\n\t\t\t\t\tupdate_attack(oscillator, attack_rate_ + key_scaling_rate);\n\n\t\t\t\t\t\/\/ Two possible terminating conditions: (i) the attack rate is 15; (ii) full volume has been reached.\n\t\t\t\t\tif((attack_rate_ + key_scaling_rate) > 60 || attenuation_ <= 0) {\n\t\t\t\t\t\tattenuation_ = 0;\n\t\t\t\t\t\tphase_ = Phase::Decay;\n\t\t\t\t\t}\n\t\t\t\tbreak;\n\n\t\t\t\tcase Phase::Decay:\n\t\t\t\t\tupdate_decay(oscillator, decay_rate_ + key_scaling_rate);\n\t\t\t\t\tif(attenuation_ >= sustain_level_) {\n\t\t\t\t\t\tattenuation_ = sustain_level_;\n\t\t\t\t\t\tphase_ = use_sustain_level_ ? Phase::Sustain : Phase::Release;\n\t\t\t\t\t}\n\t\t\t\tbreak;\n\n\t\t\t\tcase Phase::Sustain:\n\t\t\t\t\t\/\/ Nothing to do.\n\t\t\t\tbreak;\n\n\t\t\t\tcase Phase::Release:\n\t\t\t\t\tupdate_decay(oscillator, release_rate_ + key_scaling_rate);\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\n\t\t\/*!\n\t\t\t@returns The current attenuation from this envelope generator. This is independent of the envelope precision.\n\t\t*\/\n\t\tint attenuation() const {\n\t\t\treturn (attenuation_ + tremolo_) << 3;\n\t\t}\n\n\t\t\/*!\n\t\t\tEnables or disables damping on this envelope generator. If damping is enabled then this envelope generator will\n\t\t\tuse the damping phase when necessary (i.e. when transitioning to key on if attenuation is not already at maximum)\n\t\t\tand in any case will call @c will_attack before transitioning from any other state to attack.\n\n\t\t\t@param will_attack Supply a will_attack callback to enable damping mode; supply nullopt to disable damping mode.\n\t\t*\/\n\t\tvoid set_should_damp(const std::optional<std::function<void(void)>> &will_attack) {\n\t\t\twill_attack_ = will_attack;\n\t\t}\n\n\t\t\/*!\n\t\t\tSets the current state of the key-on input.\n\t\t*\/\n\t\tvoid set_key_on(bool key_on) {\n\t\t\t\/\/ Do nothing if this is not a leading or trailing edge.\n\t\t\tif(key_on == key_on_) return;\n\t\t\tkey_on_ = key_on;\n\n\t\t\t\/\/ Always transition to release upon a key off.\n\t\t\tif(!key_on_) {\n\t\t\t\tphase_ = Phase::Release;\n\t\t\t\treturn;\n\t\t\t}\n\n\t\t\t\/\/ On key on: if this is an envelope generator with damping, and damping is required,\n\t\t\t\/\/ schedule that. If damping is not required, announce a pending attack now and\n\t\t\t\/\/ transition to attack.\n\t\t\tif(will_attack_) {\n\t\t\t\tif(attenuation_ != 511) {\n\t\t\t\t\tphase_ = Phase::Damp;\n\t\t\t\t\treturn;\n\t\t\t\t}\n\n\t\t\t\t(*will_attack_)();\n\t\t\t}\n\t\t\tphase_ = Phase::Attack;\n\t\t}\n\n\t\t\/*!\n\t\t\tSets the attack rate, which should be in the range 0–15.\n\t\t*\/\n\t\tvoid set_attack_rate(int rate) {\n\t\t\tattack_rate_ = rate << 2;\n\t\t}\n\n\t\t\/*!\n\t\t\tSets the decay rate, which should be in the range 0–15.\n\t\t*\/\n\t\tvoid set_decay_rate(int rate) {\n\t\t\tdecay_rate_ = rate << 2;\n\t\t}\n\n\t\t\/*!\n\t\t\tSets the release rate, which should be in the range 0–15.\n\t\t*\/\n\t\tvoid set_release_rate(int rate) {\n\t\t\trelease_rate_ = rate << 2;\n\t\t}\n\n\t\t\/*!\n\t\t\tSets the sustain level, which should be in the range 0–15.\n\t\t*\/\n\t\tvoid set_sustain_level(int level) {\n\t\t\tsustain_level_ = level << 3;\n\t\t\t\/\/ TODO: verify the shift level here. Especially re: precision.\n\t\t}\n\n\t\t\/*!\n\t\t\tEnables or disables use of the sustain level. If this is disabled, the envelope proceeds\n\t\t\tdirectly from decay to release.\n\t\t*\/\n\t\tvoid set_use_sustain_level(bool use) {\n\t\t\tuse_sustain_level_ = use;\n\t\t}\n\n\t\t\/*!\n\t\t\tEnables or disables key-rate scaling.\n\t\t*\/\n\t\tvoid set_key_scaling_rate_enabled(bool enabled) {\n\t\t\tkey_scale_rate_shift_ = int(enabled) * 2;\n\t\t}\n\n\t\t\/*!\n\t\t\tEnables or disables application of the low-frequency oscillator's tremolo.\n\t\t*\/\n\t\tvoid set_tremolo_enabled(bool enabled) {\n\t\t\ttremolo_enable_ = int(enabled);\n\t\t}\n\n\t\t\/*!\n\t\t\tSets the current period associated with the channel that owns this envelope generator;\n\t\t\tthis is used to select a key scaling rate if key-rate scaling is enabled.\n\t\t*\/\n\t\tvoid set_period(int period, int octave) {\n\t\t\tkey_scale_rate_ = (octave << 1) | (period >> (period_precision - 1));\n\t\t}\n\n\tprivate:\n\t\tenum class Phase {\n\t\t\tAttack, Decay, Sustain, Release, Damp\n\t\t} phase_ = Phase::Release;\n\t\tint attenuation_ = 511, tremolo_ = 0;\n\n\t\tbool key_on_ = false;\n\t\tstd::optional<std::function<void(void)>> will_attack_;\n\n\t\tint key_scale_rate_ = 0;\n\t\tint key_scale_rate_shift_ = 0;\n\n\t\tint tremolo_enable_ = 0;\n\n\t\tint attack_rate_ = 0;\n\t\tint decay_rate_ = 0;\n\t\tint release_rate_ = 0;\n\t\tint sustain_level_ = 0;\n\t\tbool use_sustain_level_ = false;\n\n\t\tstatic constexpr int dithering_patterns[4][8] = {\n\t\t\t{0, 1, 0, 1, 0, 1, 0, 1},\n\t\t\t{0, 1, 0, 1, 1, 1, 0, 1},\n\t\t\t{0, 1, 1, 1, 0, 1, 1, 1},\n\t\t\t{0, 1, 1, 1, 1, 1, 1, 1},\n\t\t};\n\n\t\tvoid update_attack(const LowFrequencyOscillator &oscillator, int rate) {\n\t\t\t\/\/ Rules:\n\t\t\t\/\/\n\t\t\t\/\/ An attack rate of '13' has 32 samples in the attack phase; a rate of '12' has the same 32 steps, but spread out over 64 samples, etc.\n\t\t\t\/\/ An attack rate of '14' uses a divide by four instead of two.\n\t\t\t\/\/ 15 is instantaneous.\n\n\t\t\tif(rate >= 56) {\n\t\t\t\tattenuation_ -= (attenuation_ >> 2) - 1;\n\t\t\t} else {\n\t\t\t\tconst int sample_length = 1 << (14 - (rate >> 2));\t\/\/ TODO: don't throw away KSR bits.\n\t\t\t\tif(!(oscillator.counter & (sample_length - 1))) {\n\t\t\t\t\tattenuation_ -= (attenuation_ >> 3) - 1;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\tvoid update_decay(const LowFrequencyOscillator &oscillator, int rate) {\n\t\t\t\/\/ Special case: no decay.\n\t\t\tif(rate < 4) {\n\t\t\t\treturn;\n\t\t\t}\n\n\t\t\t\/\/ Work out the number of cycles between each adjustment tick, and stop now\n\t\t\t\/\/ if not at the next adjustment boundary.\n\t\t\tconst int shift_size = 13 - (std::min(rate, 52) >> 2);\n\t\t\tif(oscillator.counter & ((1 << shift_size) - 1)) {\n\t\t\t\treturn;\n\t\t\t}\n\n\t\t\t\/\/ Apply dithered adjustment and clamp.\n\t\t\tconst int rate_shift = 1 + (rate > 59) + (rate > 55);\n\t\t\tattenuation_ += dithering_patterns[rate & 3][(oscillator.counter >> shift_size) & 7] * (4 << rate_shift);\n\t\t\tattenuation_ = std::min(attenuation_, 511);\n\t\t}\n};\n\n}\n}\n\n#endif \/* EnvelopeGenerator_h *\/\n<commit_msg>Attempts to implement the proper attack phase.<commit_after>\/\/\n\/\/ EnvelopeGenerator.hpp\n\/\/ Clock Signal\n\/\/\n\/\/ Created by Thomas Harte on 01\/05\/2020.\n\/\/ Copyright © 2020 Thomas Harte. All rights reserved.\n\/\/\n\n#ifndef EnvelopeGenerator_h\n#define EnvelopeGenerator_h\n\n#include <optional>\n#include <functional>\n#include \"LowFrequencyOscillator.hpp\"\n\nnamespace Yamaha {\nnamespace OPL {\n\n\/*!\n\tModels an OPL-style envelope generator.\n\n\tDamping is optional; if damping is enabled then if there is a transition to key-on while\n\tattenuation is less than maximum then attenuation will be quickly transitioned to maximum\n\tbefore the attack phase can begin.\n\n\tin real hardware damping is used by the envelope generators associated with\n\tcarriers, with phases being reset upon the transition from damping to attack.\n\n\tThis code considers application of tremolo to be a function of the envelope generator;\n\tthis is largely for logical conformity with the phase generator that necessarily has to\n\tapply vibrato.\n\n\tTODO: use envelope_precision.\n*\/\ntemplate <int envelope_precision, int period_precision> class EnvelopeGenerator {\n\tpublic:\n\t\t\/*!\n\t\t\tAdvances the envelope generator a single step, given the current state of the low-frequency oscillator, @c oscillator.\n\t\t*\/\n\t\tvoid update(const LowFrequencyOscillator &oscillator) {\n\t\t\t\/\/ Apply tremolo, which is fairly easy.\n\t\t\ttremolo_ = tremolo_enable_ * oscillator.tremolo << 4;\n\n\t\t\t\/\/ Something something something...\n\t\t\tconst int key_scaling_rate = key_scale_rate_ >> key_scale_rate_shift_;\n\t\t\tswitch(phase_) {\n\t\t\t\tcase Phase::Damp:\n\t\t\t\t\tupdate_decay(oscillator, 12 << 2);\n\t\t\t\t\tif(attenuation_ == 511) {\n\t\t\t\t\t\t(*will_attack_)();\n\t\t\t\t\t\tphase_ = Phase::Attack;\n\t\t\t\t\t}\n\t\t\t\tbreak;\n\n\t\t\t\tcase Phase::Attack:\n\t\t\t\t\tupdate_attack(oscillator, attack_rate_ + key_scaling_rate);\n\n\t\t\t\t\t\/\/ Two possible terminating conditions: (i) the attack rate is 15; (ii) full volume has been reached.\n\t\t\t\t\tif(attenuation_ <= 0) {\n\t\t\t\t\t\tattenuation_ = 0;\n\t\t\t\t\t\tphase_ = Phase::Decay;\n\t\t\t\t\t}\n\t\t\t\tbreak;\n\n\t\t\t\tcase Phase::Decay:\n\t\t\t\t\tupdate_decay(oscillator, decay_rate_ + key_scaling_rate);\n\t\t\t\t\tif(attenuation_ >= sustain_level_) {\n\t\t\t\t\t\tattenuation_ = sustain_level_;\n\t\t\t\t\t\tphase_ = use_sustain_level_ ? Phase::Sustain : Phase::Release;\n\t\t\t\t\t}\n\t\t\t\tbreak;\n\n\t\t\t\tcase Phase::Sustain:\n\t\t\t\t\t\/\/ Nothing to do.\n\t\t\t\tbreak;\n\n\t\t\t\tcase Phase::Release:\n\t\t\t\t\tupdate_decay(oscillator, release_rate_ + key_scaling_rate);\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\n\t\t\/*!\n\t\t\t@returns The current attenuation from this envelope generator. This is independent of the envelope precision.\n\t\t*\/\n\t\tint attenuation() const {\n\t\t\treturn (attenuation_ + tremolo_) << 3;\n\t\t}\n\n\t\t\/*!\n\t\t\tEnables or disables damping on this envelope generator. If damping is enabled then this envelope generator will\n\t\t\tuse the damping phase when necessary (i.e. when transitioning to key on if attenuation is not already at maximum)\n\t\t\tand in any case will call @c will_attack before transitioning from any other state to attack.\n\n\t\t\t@param will_attack Supply a will_attack callback to enable damping mode; supply nullopt to disable damping mode.\n\t\t*\/\n\t\tvoid set_should_damp(const std::optional<std::function<void(void)>> &will_attack) {\n\t\t\twill_attack_ = will_attack;\n\t\t}\n\n\t\t\/*!\n\t\t\tSets the current state of the key-on input.\n\t\t*\/\n\t\tvoid set_key_on(bool key_on) {\n\t\t\t\/\/ Do nothing if this is not a leading or trailing edge.\n\t\t\tif(key_on == key_on_) return;\n\t\t\tkey_on_ = key_on;\n\n\t\t\t\/\/ Always transition to release upon a key off.\n\t\t\tif(!key_on_) {\n\t\t\t\tphase_ = Phase::Release;\n\t\t\t\treturn;\n\t\t\t}\n\n\t\t\t\/\/ On key on: if this is an envelope generator with damping, and damping is required,\n\t\t\t\/\/ schedule that. If damping is not required, announce a pending attack now and\n\t\t\t\/\/ transition to attack.\n\t\t\tif(will_attack_) {\n\t\t\t\tif(attenuation_ != 511) {\n\t\t\t\t\tphase_ = Phase::Damp;\n\t\t\t\t\treturn;\n\t\t\t\t}\n\n\t\t\t\t(*will_attack_)();\n\t\t\t}\n\t\t\tphase_ = Phase::Attack;\n\t\t}\n\n\t\t\/*!\n\t\t\tSets the attack rate, which should be in the range 0–15.\n\t\t*\/\n\t\tvoid set_attack_rate(int rate) {\n\t\t\tattack_rate_ = rate << 2;\n\t\t}\n\n\t\t\/*!\n\t\t\tSets the decay rate, which should be in the range 0–15.\n\t\t*\/\n\t\tvoid set_decay_rate(int rate) {\n\t\t\tdecay_rate_ = rate << 2;\n\t\t}\n\n\t\t\/*!\n\t\t\tSets the release rate, which should be in the range 0–15.\n\t\t*\/\n\t\tvoid set_release_rate(int rate) {\n\t\t\trelease_rate_ = rate << 2;\n\t\t}\n\n\t\t\/*!\n\t\t\tSets the sustain level, which should be in the range 0–15.\n\t\t*\/\n\t\tvoid set_sustain_level(int level) {\n\t\t\tsustain_level_ = level << 3;\n\t\t\t\/\/ TODO: verify the shift level here. Especially re: precision.\n\t\t}\n\n\t\t\/*!\n\t\t\tEnables or disables use of the sustain level. If this is disabled, the envelope proceeds\n\t\t\tdirectly from decay to release.\n\t\t*\/\n\t\tvoid set_use_sustain_level(bool use) {\n\t\t\tuse_sustain_level_ = use;\n\t\t}\n\n\t\t\/*!\n\t\t\tEnables or disables key-rate scaling.\n\t\t*\/\n\t\tvoid set_key_scaling_rate_enabled(bool enabled) {\n\t\t\tkey_scale_rate_shift_ = int(enabled) * 2;\n\t\t}\n\n\t\t\/*!\n\t\t\tEnables or disables application of the low-frequency oscillator's tremolo.\n\t\t*\/\n\t\tvoid set_tremolo_enabled(bool enabled) {\n\t\t\ttremolo_enable_ = int(enabled);\n\t\t}\n\n\t\t\/*!\n\t\t\tSets the current period associated with the channel that owns this envelope generator;\n\t\t\tthis is used to select a key scaling rate if key-rate scaling is enabled.\n\t\t*\/\n\t\tvoid set_period(int period, int octave) {\n\t\t\tkey_scale_rate_ = (octave << 1) | (period >> (period_precision - 1));\n\t\t}\n\n\tprivate:\n\t\tenum class Phase {\n\t\t\tAttack, Decay, Sustain, Release, Damp\n\t\t} phase_ = Phase::Release;\n\t\tint attenuation_ = 511, tremolo_ = 0;\n\n\t\tbool key_on_ = false;\n\t\tstd::optional<std::function<void(void)>> will_attack_;\n\n\t\tint key_scale_rate_ = 0;\n\t\tint key_scale_rate_shift_ = 0;\n\n\t\tint tremolo_enable_ = 0;\n\n\t\tint attack_rate_ = 0;\n\t\tint decay_rate_ = 0;\n\t\tint release_rate_ = 0;\n\t\tint sustain_level_ = 0;\n\t\tbool use_sustain_level_ = false;\n\n\t\tstatic constexpr int dithering_patterns[4][8] = {\n\t\t\t{0, 1, 0, 1, 0, 1, 0, 1},\n\t\t\t{0, 1, 0, 1, 1, 1, 0, 1},\n\t\t\t{0, 1, 1, 1, 0, 1, 1, 1},\n\t\t\t{0, 1, 1, 1, 1, 1, 1, 1},\n\t\t};\n\n\t\tvoid update_attack(const LowFrequencyOscillator &oscillator, int rate) {\n\t\t\t\/\/ Special case: no attack.\n\t\t\tif(rate < 4) {\n\t\t\t\treturn;\n\t\t\t}\n\n\t\t\t\/\/ Special case: instant attack.\n\t\t\tif(rate >= 60) {\n\t\t\t\tattenuation_ = 0;\n\t\t\t\treturn;\n\t\t\t}\n\n\t\t\t\/\/ Work out the number of cycles between each adjustment tick, and stop now\n\t\t\t\/\/ if not at the next adjustment boundary.\n\t\t\tconst int shift_size = 13 - (std::min(rate, 52) >> 2);\n\t\t\tif(oscillator.counter & ((1 << shift_size) - 1)) {\n\t\t\t\treturn;\n\t\t\t}\n\n\t\t\t\/\/ Apply dithered adjustment.\n\t\t\tconst int rate_shift = (rate > 55);\n\t\t\tconst int step = dithering_patterns[rate & 3][(oscillator.counter >> shift_size) & 7];\n\t\t\tattenuation_ -= ((attenuation_ >> (3 - rate_shift)) + 1) * step;\n\t\t}\n\n\t\tvoid update_decay(const LowFrequencyOscillator &oscillator, int rate) {\n\t\t\t\/\/ Special case: no decay.\n\t\t\tif(rate < 4) {\n\t\t\t\treturn;\n\t\t\t}\n\n\t\t\t\/\/ Work out the number of cycles between each adjustment tick, and stop now\n\t\t\t\/\/ if not at the next adjustment boundary.\n\t\t\tconst int shift_size = 13 - (std::min(rate, 52) >> 2);\n\t\t\tif(oscillator.counter & ((1 << shift_size) - 1)) {\n\t\t\t\treturn;\n\t\t\t}\n\n\t\t\t\/\/ Apply dithered adjustment and clamp.\n\t\t\tconst int rate_shift = 1 + (rate > 59) + (rate > 55);\n\t\t\tattenuation_ += dithering_patterns[rate & 3][(oscillator.counter >> shift_size) & 7] * (4 << rate_shift);\n\t\t\tattenuation_ = std::min(attenuation_, 511);\n\t\t}\n};\n\n}\n}\n\n#endif \/* EnvelopeGenerator_h *\/\n<|endoftext|>"} {"text":"<commit_before>#include <iostream>\n#include <iomanip>\n#include <string>\n#include <ctype.h>\n\n#include \"opencv2\/core.hpp\"\n#include \"opencv2\/core\/utility.hpp\"\n#include \"opencv2\/highgui.hpp\"\n#include \"opencv2\/imgproc.hpp\"\n#include \"opencv2\/superres.hpp\"\n#include \"opencv2\/superres\/optical_flow.hpp\"\n#include \"opencv2\/opencv_modules.hpp\"\n\nusing namespace std;\nusing namespace cv;\nusing namespace cv::superres;\n\n#define MEASURE_TIME(op) \\\n { \\\n TickMeter tm; \\\n tm.start(); \\\n op; \\\n tm.stop(); \\\n cout << tm.getTimeSec() << \" sec\" << endl; \\\n }\n\nstatic Ptr<cv::superres::DenseOpticalFlowExt> createOptFlow(const string& name, bool useGpu)\n{\n if (name == \"farneback\")\n {\n if (useGpu)\n return cv::superres::createOptFlow_Farneback_CUDA();\n else\n return cv::superres::createOptFlow_Farneback();\n }\n \/*else if (name == \"simple\")\n return createOptFlow_Simple();*\/\n else if (name == \"tvl1\")\n {\n if (useGpu)\n return cv::superres::createOptFlow_DualTVL1_CUDA();\n else\n return cv::superres::createOptFlow_DualTVL1();\n }\n else if (name == \"brox\")\n return cv::superres::createOptFlow_Brox_CUDA();\n else if (name == \"pyrlk\")\n return cv::superres::createOptFlow_PyrLK_CUDA();\n else\n cerr << \"Incorrect Optical Flow algorithm - \" << name << endl;\n\n return Ptr<cv::superres::DenseOpticalFlowExt>();\n}\n\nint main(int argc, const char* argv[])\n{\n CommandLineParser cmd(argc, argv,\n \"{ v video | | Input video }\"\n \"{ o output | | Output video }\"\n \"{ s scale | 4 | Scale factor }\"\n \"{ i iterations | 180 | Iteration count }\"\n \"{ t temporal | 4 | Radius of the temporal search area }\"\n \"{ f flow | farneback | Optical flow algorithm (farneback, simple, tvl1, brox, pyrlk) }\"\n \"{ g gpu | false | CPU as default device, cuda for CUDA }\"\n \"{ h help | false | Print help message }\"\n );\n\n if (cmd.get<bool>(\"help\"))\n {\n cout << \"This sample demonstrates Super Resolution algorithms for video sequence\" << endl;\n cmd.printMessage();\n return EXIT_SUCCESS;\n }\n\n const string inputVideoName = cmd.get<string>(\"video\");\n const string outputVideoName = cmd.get<string>(\"output\");\n const int scale = cmd.get<int>(\"scale\");\n const int iterations = cmd.get<int>(\"iterations\");\n const int temporalAreaRadius = cmd.get<int>(\"temporal\");\n const string optFlow = cmd.get<string>(\"flow\");\n string gpuOption = cmd.get<string>(\"gpu\");\n\n std::transform(gpuOption.begin(), gpuOption.end(), gpuOption.begin(), ::tolower);\n\n bool useCuda = gpuOption.compare(\"cuda\") == 0;\n Ptr<SuperResolution> superRes;\n\n if (useCuda)\n superRes = createSuperResolution_BTVL1_CUDA();\n else\n superRes = createSuperResolution_BTVL1();\n\n Ptr<cv::superres::DenseOpticalFlowExt> of = createOptFlow(optFlow, useCuda);\n\n if (of.empty())\n return EXIT_FAILURE;\n superRes->setOpticalFlow(of);\n\n superRes->setScale(scale);\n superRes->setIterations(iterations);\n superRes->setTemporalAreaRadius(temporalAreaRadius);\n\n Ptr<FrameSource> frameSource;\n if (useCuda)\n {\n \/\/ Try to use gpu Video Decoding\n try\n {\n frameSource = createFrameSource_Video_CUDA(inputVideoName);\n Mat frame;\n frameSource->nextFrame(frame);\n }\n catch (const cv::Exception&)\n {\n frameSource.release();\n }\n }\n if (!frameSource)\n frameSource = createFrameSource_Video(inputVideoName);\n\n \/\/ skip first frame, it is usually corrupted\n {\n Mat frame;\n frameSource->nextFrame(frame);\n cout << \"Input : \" << inputVideoName << \" \" << frame.size() << endl;\n cout << \"Scale factor : \" << scale << endl;\n cout << \"Iterations : \" << iterations << endl;\n cout << \"Temporal radius : \" << temporalAreaRadius << endl;\n cout << \"Optical Flow : \" << optFlow << endl;\n cout << \"Mode : \" << (useCuda ? \"CUDA\" : \"CPU\") << endl;\n }\n\n superRes->setInput(frameSource);\n\n VideoWriter writer;\n\n for (int i = 0;; ++i)\n {\n cout << '[' << setw(3) << i << \"] : \";\n Mat result;\n\n MEASURE_TIME(superRes->nextFrame(result));\n\n if (result.empty())\n break;\n\n imshow(\"Super Resolution\", result);\n\n if (waitKey(1000) > 0)\n break;\n\n if (!outputVideoName.empty())\n {\n if (!writer.isOpened())\n writer.open(outputVideoName, VideoWriter::fourcc('X', 'V', 'I', 'D'), 25.0, result.size());\n writer << result;\n }\n }\n\n return 0;\n}\n<commit_msg>Minor update for example-gpu-super_resolution<commit_after>#include <iostream>\n#include <iomanip>\n#include <string>\n#include <ctype.h>\n\n#include \"opencv2\/core.hpp\"\n#include \"opencv2\/core\/utility.hpp\"\n#include \"opencv2\/highgui.hpp\"\n#include \"opencv2\/imgproc.hpp\"\n#include \"opencv2\/superres.hpp\"\n#include \"opencv2\/superres\/optical_flow.hpp\"\n#include \"opencv2\/opencv_modules.hpp\"\n\nusing namespace std;\nusing namespace cv;\nusing namespace cv::superres;\n\n#define MEASURE_TIME(op) \\\n { \\\n TickMeter tm; \\\n tm.start(); \\\n op; \\\n tm.stop(); \\\n cout << tm.getTimeSec() << \" sec\" << endl; \\\n }\n\nstatic Ptr<cv::superres::DenseOpticalFlowExt> createOptFlow(const string& name, bool useGpu)\n{\n if (name == \"farneback\")\n {\n if (useGpu)\n return cv::superres::createOptFlow_Farneback_CUDA();\n else\n return cv::superres::createOptFlow_Farneback();\n }\n \/*else if (name == \"simple\")\n return createOptFlow_Simple();*\/\n else if (name == \"tvl1\")\n {\n if (useGpu)\n return cv::superres::createOptFlow_DualTVL1_CUDA();\n else\n return cv::superres::createOptFlow_DualTVL1();\n }\n else if (name == \"brox\")\n return cv::superres::createOptFlow_Brox_CUDA();\n else if (name == \"pyrlk\")\n return cv::superres::createOptFlow_PyrLK_CUDA();\n else\n cerr << \"Incorrect Optical Flow algorithm - \" << name << endl;\n\n return Ptr<cv::superres::DenseOpticalFlowExt>();\n}\n\nint main(int argc, const char* argv[])\n{\n CommandLineParser cmd(argc, argv,\n \"{ v video | | Input video }\"\n \"{ o output | | Output video }\"\n \"{ s scale | 4 | Scale factor }\"\n \"{ i iterations | 180 | Iteration count }\"\n \"{ t temporal | 4 | Radius of the temporal search area }\"\n \"{ f flow | farneback | Optical flow algorithm (farneback, tvl1, brox, pyrlk) }\"\n \"{ g gpu | false | CPU as default device, cuda for CUDA }\"\n \"{ h help | false | Print help message }\"\n );\n\n if (cmd.get<bool>(\"help\"))\n {\n cout << \"This sample demonstrates Super Resolution algorithms for video sequence\" << endl;\n cmd.printMessage();\n return EXIT_SUCCESS;\n }\n\n const string inputVideoName = cmd.get<string>(\"video\");\n const string outputVideoName = cmd.get<string>(\"output\");\n const int scale = cmd.get<int>(\"scale\");\n const int iterations = cmd.get<int>(\"iterations\");\n const int temporalAreaRadius = cmd.get<int>(\"temporal\");\n const string optFlow = cmd.get<string>(\"flow\");\n string gpuOption = cmd.get<string>(\"gpu\");\n\n std::transform(gpuOption.begin(), gpuOption.end(), gpuOption.begin(), ::tolower);\n\n bool useCuda = gpuOption.compare(\"cuda\") == 0;\n Ptr<SuperResolution> superRes;\n\n if (useCuda)\n superRes = createSuperResolution_BTVL1_CUDA();\n else\n superRes = createSuperResolution_BTVL1();\n\n Ptr<cv::superres::DenseOpticalFlowExt> of = createOptFlow(optFlow, useCuda);\n\n if (of.empty())\n return EXIT_FAILURE;\n superRes->setOpticalFlow(of);\n\n superRes->setScale(scale);\n superRes->setIterations(iterations);\n superRes->setTemporalAreaRadius(temporalAreaRadius);\n\n Ptr<FrameSource> frameSource;\n if (useCuda)\n {\n \/\/ Try to use gpu Video Decoding\n try\n {\n frameSource = createFrameSource_Video_CUDA(inputVideoName);\n Mat frame;\n frameSource->nextFrame(frame);\n }\n catch (const cv::Exception&)\n {\n frameSource.release();\n }\n }\n if (!frameSource)\n frameSource = createFrameSource_Video(inputVideoName);\n\n \/\/ skip first frame, it is usually corrupted\n {\n Mat frame;\n frameSource->nextFrame(frame);\n cout << \"Input : \" << inputVideoName << \" \" << frame.size() << endl;\n cout << \"Scale factor : \" << scale << endl;\n cout << \"Iterations : \" << iterations << endl;\n cout << \"Temporal radius : \" << temporalAreaRadius << endl;\n cout << \"Optical Flow : \" << optFlow << endl;\n cout << \"Mode : \" << (useCuda ? \"CUDA\" : \"CPU\") << endl;\n }\n\n superRes->setInput(frameSource);\n\n VideoWriter writer;\n\n for (int i = 0;; ++i)\n {\n cout << '[' << setw(3) << i << \"] : \" << flush;\n Mat result;\n\n MEASURE_TIME(superRes->nextFrame(result));\n\n if (result.empty())\n break;\n\n imshow(\"Super Resolution\", result);\n\n if (waitKey(1000) > 0)\n break;\n\n if (!outputVideoName.empty())\n {\n if (!writer.isOpened())\n writer.open(outputVideoName, VideoWriter::fourcc('X', 'V', 'I', 'D'), 25.0, result.size());\n writer << result;\n }\n }\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\/prdfErrlUtil.H $ *\/\n\/* *\/\n\/* IBM CONFIDENTIAL *\/\n\/* *\/\n\/* COPYRIGHT International Business Machines Corp. 2002,2013 *\/\n\/* *\/\n\/* p1 *\/\n\/* *\/\n\/* Object Code Only (OCO) source materials *\/\n\/* Licensed Internal Code Source Materials *\/\n\/* IBM HostBoot Licensed Internal Code *\/\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\/* Origin: 30 *\/\n\/* *\/\n\/* IBM_PROLOG_END_TAG *\/\n\n#ifndef __prdfErrlUtil_H\n#define __prdfErrlUtil_H\n\n\/**\n * @file prdfErrlUtil.H\n * @brief PRD error logging code specific to hostboot.\n *\n * This file contains the Processor Runtime Diagnostics error logging\n * related declarations specific to hostboot.\n *\/\n\n#include <prdfEnums.H>\n\n\/**\n * @brief create ErrlEntry in Hostboot\n *\/\n\/* This macro does not use the below FSP input parms:\n\n - i_etype : errlEventType\n - i_type : srciType\n - i_srcAttr : srcAttr\n - i_refCode : serviceCodes\n*\/\n#define PRDF_CREATE_ERRL(io_errl, i_sev, i_etype, i_type, \\\n i_srcAttr, i_mid, i_refCode, i_reasonCode, \\\n i_user1 , i_user2, i_user3 , i_user4) \\\n io_errl = new ERRORLOG::ErrlEntry(ERRORLOG::i_sev, \\\n i_mid, \\\n i_reasonCode, \\\n PRDF_GET_UINT64_FROM_UINT32( \\\n i_user1, \\\n i_user2), \\\n PRDF_GET_UINT64_FROM_UINT32( \\\n i_user3, \\\n i_user4))\n\n\/**\n * @brief Add user data to the log\n *\/\n#define PRDF_ADD_FFDC(io_errl, i_buf, i_size, i_ver, i_subsec) \\\n io_errl->addFFDC(PRDF_COMP_ID, i_buf, i_size, i_ver, i_subsec)\n\n\/**\n * @brief Commit the log\n *\/\n\/\/ FIXME:RTC: 65609 will address this issue.\n\/\/ hberr does not use i_actions for commit\n#define PRDF_COMMIT_ERRL(io_errl, i_actions) \\\n if(i_actions) {} \\\n errlCommit(io_errl, PRDF_COMP_ID)\n\n\/**\n * @brief Collect component trace\n *\/\n#define PRDF_COLLECT_TRACE(io_errl, i_max) \\\n io_errl->collectTrace(PRDF_COMP_NAME, i_max)\n\n\/**\n * @brief Add a procedure ( software ) callout\n *\/\n#define PRDF_ADD_PROCEDURE_CALLOUT(io_errl, i_priority, i_procedure) \\\n io_errl->addProcedureCallout((const HWAS::epubProcedureID)i_procedure, \\\n (const HWAS::callOutPriority)i_priority)\n\n\/**\n * @brief Adds a software section to the log\n * mostly used as a stack call indicator\n *\/\n\/\/ FIXME:RTC: 65609 will address this issue.\n\/\/ hberrl hasn't added this in yet so make it a no-op for now\n#define PRDF_ADD_SW_ERR(io_errl, i_rc, i_fileId, i_codeloc)\n\n\/**\n * @brief Set the platform Log Id\n *\/\n\/\/ FIXME:RTC: 65609 will address this issue.\n\/\/ hberrl doesn't have this setter method so make it a no-op for now\n#define PRDF_SET_PLID(io_errl, i_plid)\n\n\/**\n * @brief Get the platform Log Id\n *\/\n#define PRDF_GET_PLID(io_errl, o_plid) \\\n o_plid = io_errl->plid()\n\n\/**\n * @brief Set 32 bit user defined return code\n *\/\n\/\/ FIXME:RTC: 65609 will address this issue.\n\/\/ hberrl doesn't have this setter method so make it a no-op for now\n#define PRDF_SET_RC(io_errl, i_rc)\n\n\/**\n * @brief Get 32 bit user defined return code\n *\/\n\/\/ FIXME:RTC: 65609 will address this issue.\n\/\/ hberrl doesn't have this setter method so make it a no-op for now\n#define PRDF_GET_RC(io_errl, o_rc)\n\n\/**\n * @brief Get reason code\n *\/\n#define PRDF_GET_REASONCODE(io_errl, o_reasonCode) \\\n o_reasonCode = io_errl->reasonCode()\n\n\/**\n * @brief get previously stored SRC\n * A special index ( 0 ) is used to a\n * ccess the primary src.\n *\/\n\/\/ FIXME:RTC: 65609 will address this issue.\n\/\/ hberrl doesn't have this setter method so make it a no-op for now\n#define PRDF_GET_SRC(io_errl, o_src, i_idx)\n\n\/**\n * @brief Determine if the src is terminating\n *\/\n\/\/ FIXME:RTC: 65609 will address this issue.\n\/\/ hberrl doesn't have this setter method so make it a no-op for now\n#define PRDF_GET_TERM_SRC(io_errl, o_termSRC)\n\n\/**\n * @brief write SRC termination flag\n *\/\n\/\/ FIXME:RTC: 65609 will address this issue.\n\/\/ hberrl doesn't have this setter method so make it a no-op for now\n#define PRDF_SRC_WRITE_TERM_STATE_ON(io_errl, i_flags)\n\n\/\/ end Singleton macros\n\n\/*--------------------------------------------------------------------*\/\n\/* HW Deconfig Errl macros for Hostboot *\/\n\/*--------------------------------------------------------------------*\/\n\n\/\/ FIXME:RTC: 65609 will address this issue.\n\/\/ defines for enums that are not available in hostboot\n\/\/ these ERRL sevs are currently not supported in HB\n#define ERRL_SEV_PREDICTIVE ERRL_SEV_UNRECOVERABLE\n#define ERRL_SEV_RECOVERED ERRL_SEV_INFORMATIONAL\n\n\/**\n * @brief function to create an error log.\n *\/\n#define PRDF_HW_CREATE_ERRL(io_errl, \\\n i_sev, \\\n i_etype, \\\n i_type, \\\n i_srcAttr, \\\n i_mid, \\\n i_refCode, \\\n i_reasonCode, \\\n i_userData1, \\\n i_userData2, \\\n i_userData3, \\\n i_userData4, \\\n i_termFlag, \\\n i_pldCheck) \\\n PRDF_CREATE_ERRL(io_errl, i_sev, i_etype, i_type, \\\n i_srcAttr, i_mid, i_refCode, i_reasonCode, \\\n i_userData1, i_userData2, i_userData3, i_userData4)\n\n\/**\n * @brief Add a procedure callout to an existing error log\n *\/\n#define PRDF_HW_ADD_PROC_CALLOUT(i_procedure, \\\n i_priority, \\\n io_errl, \\\n i_severity) \\\n PRDF_ADD_PROCEDURE_CALLOUT(io_errl, i_priority, i_procedure)\n\n\/**\n * @brief Error log interface to add a HW callout to an existing error log.\n * @note convert immediate deconfig to delayed deconfig in HB.\n *\/\n#define PRDF_HW_ADD_CALLOUT(i_target, i_priority, \\\n i_deconfigState, i_gardState, \\\n io_errl, i_writeVpd, \\\n i_gardErrType, i_severity, i_hcdb_update) \\\n HWAS::DeconfigEnum deconfigState = \\\n (i_deconfigState == HWAS::DECONFIG ? \\\n HWAS::DELAYED_DECONFIG : i_deconfigState); \\\n io_errl->addHwCallout(i_target, \\\n (const HWAS::callOutPriority)i_priority, \\\n deconfigState, \\\n (const HWAS::GARD_ErrorType)i_gardErrType); \\\n (void)(i_hcdb_update)\n\n\/**\n * @brief Process's pending deconfig and GARD service actions\n * and thencommits and deletes the error log.\n *\/\n#define PRDF_HW_COMMIT_ERRL(io_sysTerm, io_errl, i_deferDeconfig, \\\n i_action, i_continue) \\\n io_sysTerm = false; \\\n PRDF_COMMIT_ERRL(io_errl, i_action);\n\n\/**\n * @brief indicate whether an abort is active or not\n *\/\n\/\/ no-op in Hostboot\n#define PRDF_ABORTING(o_abort) \\\n o_abort = false;\n\n\/**\n * @brief Interface to request a Hardware Unit dump collection\n *\/\n\/\/ FIXME:RTC: 65609 will address this issue.\n\/\/ need to implement in Hostboot\n#define PRDF_HWUDUMP( i_errl, i_content, i_huid ) \\\n SUCCESS\n\n\n#endif \/\/ __prdfErrlUtil_H\n<commit_msg>PRD: fix local var declaration conflict in PRDF_HW_ADD_CALLOUT macro<commit_after>\/* IBM_PROLOG_BEGIN_TAG *\/\n\/* This is an automatically generated prolog. *\/\n\/* *\/\n\/* $Source: src\/usr\/diag\/prdf\/prdfErrlUtil.H $ *\/\n\/* *\/\n\/* IBM CONFIDENTIAL *\/\n\/* *\/\n\/* COPYRIGHT International Business Machines Corp. 2002,2013 *\/\n\/* *\/\n\/* p1 *\/\n\/* *\/\n\/* Object Code Only (OCO) source materials *\/\n\/* Licensed Internal Code Source Materials *\/\n\/* IBM HostBoot Licensed Internal Code *\/\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\/* Origin: 30 *\/\n\/* *\/\n\/* IBM_PROLOG_END_TAG *\/\n\n#ifndef __prdfErrlUtil_H\n#define __prdfErrlUtil_H\n\n\/**\n * @file prdfErrlUtil.H\n * @brief PRD error logging code specific to hostboot.\n *\n * This file contains the Processor Runtime Diagnostics error logging\n * related declarations specific to hostboot.\n *\/\n\n#include <prdfEnums.H>\n\n\/**\n * @brief create ErrlEntry in Hostboot\n *\/\n\/* This macro does not use the below FSP input parms:\n\n - i_etype : errlEventType\n - i_type : srciType\n - i_srcAttr : srcAttr\n - i_refCode : serviceCodes\n*\/\n#define PRDF_CREATE_ERRL(io_errl, i_sev, i_etype, i_type, \\\n i_srcAttr, i_mid, i_refCode, i_reasonCode, \\\n i_user1 , i_user2, i_user3 , i_user4) \\\n io_errl = new ERRORLOG::ErrlEntry(ERRORLOG::i_sev, \\\n i_mid, \\\n i_reasonCode, \\\n PRDF_GET_UINT64_FROM_UINT32( \\\n i_user1, \\\n i_user2), \\\n PRDF_GET_UINT64_FROM_UINT32( \\\n i_user3, \\\n i_user4))\n\n\/**\n * @brief Add user data to the log\n *\/\n#define PRDF_ADD_FFDC(io_errl, i_buf, i_size, i_ver, i_subsec) \\\n io_errl->addFFDC(PRDF_COMP_ID, i_buf, i_size, i_ver, i_subsec)\n\n\/**\n * @brief Commit the log\n *\/\n\/\/ FIXME:RTC: 65609 will address this issue.\n\/\/ hberr does not use i_actions for commit\n#define PRDF_COMMIT_ERRL(io_errl, i_actions) \\\n if(i_actions) {} \\\n errlCommit(io_errl, PRDF_COMP_ID)\n\n\/**\n * @brief Collect component trace\n *\/\n#define PRDF_COLLECT_TRACE(io_errl, i_max) \\\n io_errl->collectTrace(PRDF_COMP_NAME, i_max)\n\n\/**\n * @brief Add a procedure ( software ) callout\n *\/\n#define PRDF_ADD_PROCEDURE_CALLOUT(io_errl, i_priority, i_procedure) \\\n io_errl->addProcedureCallout((const HWAS::epubProcedureID)i_procedure, \\\n (const HWAS::callOutPriority)i_priority)\n\n\/**\n * @brief Adds a software section to the log\n * mostly used as a stack call indicator\n *\/\n\/\/ FIXME:RTC: 65609 will address this issue.\n\/\/ hberrl hasn't added this in yet so make it a no-op for now\n#define PRDF_ADD_SW_ERR(io_errl, i_rc, i_fileId, i_codeloc)\n\n\/**\n * @brief Set the platform Log Id\n *\/\n\/\/ FIXME:RTC: 65609 will address this issue.\n\/\/ hberrl doesn't have this setter method so make it a no-op for now\n#define PRDF_SET_PLID(io_errl, i_plid)\n\n\/**\n * @brief Get the platform Log Id\n *\/\n#define PRDF_GET_PLID(io_errl, o_plid) \\\n o_plid = io_errl->plid()\n\n\/**\n * @brief Set 32 bit user defined return code\n *\/\n\/\/ FIXME:RTC: 65609 will address this issue.\n\/\/ hberrl doesn't have this setter method so make it a no-op for now\n#define PRDF_SET_RC(io_errl, i_rc)\n\n\/**\n * @brief Get 32 bit user defined return code\n *\/\n\/\/ FIXME:RTC: 65609 will address this issue.\n\/\/ hberrl doesn't have this setter method so make it a no-op for now\n#define PRDF_GET_RC(io_errl, o_rc)\n\n\/**\n * @brief Get reason code\n *\/\n#define PRDF_GET_REASONCODE(io_errl, o_reasonCode) \\\n o_reasonCode = io_errl->reasonCode()\n\n\/**\n * @brief get previously stored SRC\n * A special index ( 0 ) is used to a\n * ccess the primary src.\n *\/\n\/\/ FIXME:RTC: 65609 will address this issue.\n\/\/ hberrl doesn't have this setter method so make it a no-op for now\n#define PRDF_GET_SRC(io_errl, o_src, i_idx)\n\n\/**\n * @brief Determine if the src is terminating\n *\/\n\/\/ FIXME:RTC: 65609 will address this issue.\n\/\/ hberrl doesn't have this setter method so make it a no-op for now\n#define PRDF_GET_TERM_SRC(io_errl, o_termSRC)\n\n\/**\n * @brief write SRC termination flag\n *\/\n\/\/ FIXME:RTC: 65609 will address this issue.\n\/\/ hberrl doesn't have this setter method so make it a no-op for now\n#define PRDF_SRC_WRITE_TERM_STATE_ON(io_errl, i_flags)\n\n\/\/ end Singleton macros\n\n\/*--------------------------------------------------------------------*\/\n\/* HW Deconfig Errl macros for Hostboot *\/\n\/*--------------------------------------------------------------------*\/\n\n\/\/ FIXME:RTC: 65609 will address this issue.\n\/\/ defines for enums that are not available in hostboot\n\/\/ these ERRL sevs are currently not supported in HB\n#define ERRL_SEV_PREDICTIVE ERRL_SEV_UNRECOVERABLE\n#define ERRL_SEV_RECOVERED ERRL_SEV_INFORMATIONAL\n\n\/**\n * @brief function to create an error log.\n *\/\n#define PRDF_HW_CREATE_ERRL(io_errl, \\\n i_sev, \\\n i_etype, \\\n i_type, \\\n i_srcAttr, \\\n i_mid, \\\n i_refCode, \\\n i_reasonCode, \\\n i_userData1, \\\n i_userData2, \\\n i_userData3, \\\n i_userData4, \\\n i_termFlag, \\\n i_pldCheck) \\\n PRDF_CREATE_ERRL(io_errl, i_sev, i_etype, i_type, \\\n i_srcAttr, i_mid, i_refCode, i_reasonCode, \\\n i_userData1, i_userData2, i_userData3, i_userData4)\n\n\/**\n * @brief Add a procedure callout to an existing error log\n *\/\n#define PRDF_HW_ADD_PROC_CALLOUT(i_procedure, \\\n i_priority, \\\n io_errl, \\\n i_severity) \\\n PRDF_ADD_PROCEDURE_CALLOUT(io_errl, i_priority, i_procedure)\n\n\/**\n * @brief Error log interface to add a HW callout to an existing error log.\n * @note convert immediate deconfig to delayed deconfig in HB.\n *\/\n#define PRDF_HW_ADD_CALLOUT(i_target, i_priority, \\\n i_deconfigState, i_gardState, \\\n io_errl, i_writeVpd, \\\n i_gardErrType, i_severity, i_hcdb_update) \\\n io_errl->addHwCallout(i_target, \\\n (const HWAS::callOutPriority)i_priority, \\\n (i_deconfigState == HWAS::DECONFIG ? \\\n HWAS::DELAYED_DECONFIG : i_deconfigState), \\\n (const HWAS::GARD_ErrorType)i_gardErrType); \\\n (void)(i_hcdb_update)\n\n\/**\n * @brief Process's pending deconfig and GARD service actions\n * and thencommits and deletes the error log.\n *\/\n#define PRDF_HW_COMMIT_ERRL(io_sysTerm, io_errl, i_deferDeconfig, \\\n i_action, i_continue) \\\n io_sysTerm = false; \\\n PRDF_COMMIT_ERRL(io_errl, i_action);\n\n\/**\n * @brief indicate whether an abort is active or not\n *\/\n\/\/ no-op in Hostboot\n#define PRDF_ABORTING(o_abort) \\\n o_abort = false;\n\n\/**\n * @brief Interface to request a Hardware Unit dump collection\n *\/\n\/\/ FIXME:RTC: 65609 will address this issue.\n\/\/ need to implement in Hostboot\n#define PRDF_HWUDUMP( i_errl, i_content, i_huid ) \\\n SUCCESS\n\n\n#endif \/\/ __prdfErrlUtil_H\n<|endoftext|>"} {"text":"<commit_before>\/\/\n\/\/ libavg - Media Playback Engine. \n\/\/ Copyright (C) 2003-2011 Ulrich von Zadow\n\/\/\n\/\/ This library is free software; you can redistribute it and\/or\n\/\/ modify it under the terms of the GNU Lesser General Public\n\/\/ License as published by the Free Software Foundation; either\n\/\/ version 2 of the License, or (at your option) any later version.\n\/\/\n\/\/ This library is distributed in the hope that it will be useful,\n\/\/ but WITHOUT ANY WARRANTY; without even the implied warranty of\n\/\/ MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU\n\/\/ Lesser General Public License for more details.\n\/\/\n\/\/ You should have received a copy of the GNU Lesser General Public\n\/\/ License along with this library; if not, write to the Free Software\n\/\/ Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA\n\/\/\n\/\/ Current versions can be found at www.libavg.de\n\/\/\n\/\/ Original author of this file is Nick Hebner (hebnern@gmail.com).\n\/\/\n\n#include \"AudioDecoderThread.h\"\n\n#include \"..\/base\/Logger.h\"\n#include \"..\/base\/TimeSource.h\"\n#include \"..\/base\/ScopeTimer.h\"\n\n#if AVUTIL_VERSION_INT > AV_VERSION_INT(52, 0, 0)\n#include <libavutil\/samplefmt.h>\n#endif\n\nusing namespace std;\n\nnamespace avg {\n\nAudioDecoderThread::AudioDecoderThread(CQueue& cmdQ, AudioMsgQueue& msgQ, \n VideoMsgQueue& packetQ, AVStream* pStream, const AudioParams& ap)\n : WorkerThread<AudioDecoderThread>(string(\"AudioDecoderThread\"), cmdQ),\n m_MsgQ(msgQ),\n m_PacketQ(packetQ),\n m_AP(ap),\n m_pStream(pStream),\n m_pResampleContext(0),\n m_State(DECODING)\n{\n m_LastFrameTime = 0;\n m_AudioStartTimestamp = 0;\n\n if (m_pStream->start_time != (long long)AV_NOPTS_VALUE) {\n m_AudioStartTimestamp = float(av_q2d(m_pStream->time_base)*m_pStream->start_time);\n }\n m_InputSampleRate = (int)(m_pStream->codec->sample_rate);\n m_InputSampleFormat = m_pStream->codec->sample_fmt;\n}\n\nAudioDecoderThread::~AudioDecoderThread()\n{\n if (m_pResampleContext) {\n audio_resample_close(m_pResampleContext);\n m_pResampleContext = 0;\n }\n}\n\nstatic ProfilingZoneID DecoderProfilingZone(\"Audio Decoder Thread\", true);\nstatic ProfilingZoneID PacketWaitProfilingZone(\"Audio Wait for packet\", true);\n\nbool AudioDecoderThread::work() \n{\n ScopeTimer timer(DecoderProfilingZone);\n VideoMsgPtr pMsg;\n {\n ScopeTimer timer(PacketWaitProfilingZone);\n pMsg = m_PacketQ.pop(true);\n }\n switch (pMsg->getType()) {\n case VideoMsg::PACKET: {\n AVPacket* pPacket = pMsg->getPacket();\n switch(m_State) {\n case DECODING:\n decodePacket(pPacket);\n break;\n case SEEK_DONE:\n handleSeekDone(pPacket);\n break;\n case DISCARDING:\n discardPacket(pPacket);\n break;\n default:\n AVG_ASSERT(false);\n }\n av_free_packet(pPacket);\n delete pPacket;\n break;\n }\n case VideoMsg::SEEK_DONE:\n m_State = SEEK_DONE;\n m_SeekSeqNum = pMsg->getSeekSeqNum();\n m_SeekTime = pMsg->getSeekTime();\n break;\n case VideoMsg::END_OF_FILE:\n pushEOF();\n break;\n case VideoMsg::CLOSED:\n m_MsgQ.clear();\n stop();\n break;\n default:\n pMsg->dump();\n AVG_ASSERT(false);\n }\n ThreadProfiler::get()->reset();\n return true;\n}\n\nvoid AudioDecoderThread::decodePacket(AVPacket* pPacket)\n{\n char* pDecodedData = (char*)av_malloc(AVCODEC_MAX_AUDIO_FRAME_SIZE +\n FF_INPUT_BUFFER_PADDING_SIZE);\n AVPacket* pTempPacket = new AVPacket;\n av_init_packet(pTempPacket);\n pTempPacket->data = pPacket->data;\n pTempPacket->size = pPacket->size;\n while (pTempPacket->size > 0) {\n int bytesDecoded = AVCODEC_MAX_AUDIO_FRAME_SIZE;\n#if LIBAVCODEC_VERSION_INT > AV_VERSION_INT(52, 31, 0)\n int bytesConsumed = avcodec_decode_audio3(m_pStream->codec, (short*)pDecodedData,\n &bytesDecoded, pTempPacket);\n#else\n int bytesConsumed = avcodec_decode_audio2(m_pStream->codec, (short*)pDecodedData,\n &bytesDecoded, pTempPacket->data, pTempPacket->size);\n#endif\n AVG_ASSERT(bytesConsumed != 0);\n if (bytesConsumed < 0) {\n \/\/ Error decoding -> throw away current packet.\n bytesDecoded = 0;\n pTempPacket->size = 0;\n } else {\n pTempPacket->data += bytesConsumed;\n pTempPacket->size -= bytesConsumed;\n }\n if (bytesDecoded > 0) {\n int framesDecoded = bytesDecoded\/(m_pStream->codec->channels*\n getBytesPerSample(m_InputSampleFormat));\n AudioBufferPtr pBuffer;\n bool bNeedsResample = (m_InputSampleRate != m_AP.m_SampleRate ||\n m_InputSampleFormat != SAMPLE_FMT_S16 ||\n m_pStream->codec->channels != m_AP.m_Channels);\n if (bNeedsResample) {\n pBuffer = resampleAudio(pDecodedData, framesDecoded);\n } else {\n pBuffer = AudioBufferPtr(new AudioBuffer(framesDecoded, m_AP));\n memcpy(pBuffer->getData(), pDecodedData, bytesDecoded);\n }\n m_LastFrameTime += float(pBuffer->getNumFrames())\/m_AP.m_SampleRate;\n pushAudioMsg(pBuffer, m_LastFrameTime);\n }\n }\n av_free(pDecodedData);\n delete pTempPacket;\n}\n\nvoid AudioDecoderThread::handleSeekDone(AVPacket* pPacket)\n{\n m_MsgQ.clear();\n m_LastFrameTime = float(pPacket->dts*av_q2d(m_pStream->time_base))\n - m_AudioStartTimestamp;\n\n if (fabs(m_LastFrameTime - m_SeekTime) < 0.01) {\n pushSeekDone(m_LastFrameTime, m_SeekSeqNum);\n decodePacket(pPacket);\n m_State = DECODING;\n } else {\n if (m_LastFrameTime-0.01f < m_SeekTime) {\n \/\/ Received frame that's earlier than the destination, so throw away frames\n \/\/ until the time is correct.\n m_State = DISCARDING;\n } else {\n \/\/ Received frame that's too late, so insert a buffer of silence to \n \/\/ compensate.\n insertSilence(m_LastFrameTime - m_SeekTime);\n m_LastFrameTime = m_SeekTime;\n pushSeekDone(m_LastFrameTime, m_SeekSeqNum);\n decodePacket(pPacket);\n m_State = DECODING;\n }\n }\n}\n\nvoid AudioDecoderThread::discardPacket(AVPacket* pPacket)\n{\n m_LastFrameTime = float(pPacket->dts*av_q2d(m_pStream->time_base))\n - m_AudioStartTimestamp;\n if (m_LastFrameTime-0.01f > m_SeekTime) {\n pushSeekDone(m_LastFrameTime, m_SeekSeqNum);\n m_State = DECODING;\n }\n}\n\nAudioBufferPtr AudioDecoderThread::resampleAudio(char* pDecodedData, int framesDecoded)\n{\n if (!m_pResampleContext) {\n#if LIBAVFORMAT_VERSION_INT >= AV_VERSION_INT(52, 24, 0)\n m_pResampleContext = av_audio_resample_init(m_AP.m_Channels, \n m_pStream->codec->channels, m_AP.m_SampleRate, m_InputSampleRate,\n SAMPLE_FMT_S16, (SampleFormat)m_InputSampleFormat, 16, 10, 0, 0.8);\n#else\n m_pResampleContext = audio_resample_init(m_AP.m_Channels, \n m_pStream->codec->channels, m_AP.m_SampleRate, m_InputSampleRate);\n#endif\n AVG_ASSERT(m_pResampleContext);\n }\n\n short pResampledData[AVCODEC_MAX_AUDIO_FRAME_SIZE\/2];\n int framesResampled = audio_resample(m_pResampleContext, pResampledData,\n (short*)pDecodedData, framesDecoded);\n AudioBufferPtr pBuffer(new AudioBuffer(framesResampled, m_AP));\n memcpy(pBuffer->getData(), pResampledData, \n framesResampled*m_AP.m_Channels*sizeof(short));\n return pBuffer;\n}\n\nvoid AudioDecoderThread::insertSilence(float duration)\n{\n int numDelaySamples = int(duration*m_AP.m_SampleRate);\n AudioBufferPtr pBuffer(new AudioBuffer(numDelaySamples, m_AP));\n pBuffer->clear();\n pushAudioMsg(pBuffer, m_LastFrameTime);\n}\n\nvoid AudioDecoderThread::pushAudioMsg(AudioBufferPtr pBuffer, float time)\n{\n VideoMsgPtr pMsg(new VideoMsg());\n pMsg->setAudio(pBuffer, time);\n m_MsgQ.push(pMsg);\n}\n\nvoid AudioDecoderThread::pushSeekDone(float time, int seqNum)\n{\n VideoMsgPtr pMsg(new VideoMsg());\n pMsg->setSeekDone(seqNum, time);\n m_MsgQ.push(pMsg);\n}\n\nvoid AudioDecoderThread::pushEOF()\n{\n VideoMsgPtr pMsg(new VideoMsg());\n pMsg->setEOF();\n m_MsgQ.push(pMsg);\n}\n\nint AudioDecoderThread::getBytesPerSample(int sampleFormat)\n{\n switch (sampleFormat) {\n case SAMPLE_FMT_U8:\n return 1;\n case SAMPLE_FMT_S16:\n return 2;\n case SAMPLE_FMT_S16P:\n return 2;\n case SAMPLE_FMT_S32:\n return 4;\n case SAMPLE_FMT_FLT:\n return 4;\n case SAMPLE_FMT_DBL:\n return 8;\n default:\n AVG_LOG_ERROR(\"Unknown SampleFormat: \" << sampleFormat << \"\\n\");\n AVG_ASSERT(false);\n return 0;\n }\n}\n\n}\n<commit_msg>Build fix for older ffmpeg.<commit_after>\/\/\n\/\/ libavg - Media Playback Engine. \n\/\/ Copyright (C) 2003-2011 Ulrich von Zadow\n\/\/\n\/\/ This library is free software; you can redistribute it and\/or\n\/\/ modify it under the terms of the GNU Lesser General Public\n\/\/ License as published by the Free Software Foundation; either\n\/\/ version 2 of the License, or (at your option) any later version.\n\/\/\n\/\/ This library is distributed in the hope that it will be useful,\n\/\/ but WITHOUT ANY WARRANTY; without even the implied warranty of\n\/\/ MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU\n\/\/ Lesser General Public License for more details.\n\/\/\n\/\/ You should have received a copy of the GNU Lesser General Public\n\/\/ License along with this library; if not, write to the Free Software\n\/\/ Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA\n\/\/\n\/\/ Current versions can be found at www.libavg.de\n\/\/\n\/\/ Original author of this file is Nick Hebner (hebnern@gmail.com).\n\/\/\n\n#include \"AudioDecoderThread.h\"\n\n#include \"..\/base\/Logger.h\"\n#include \"..\/base\/TimeSource.h\"\n#include \"..\/base\/ScopeTimer.h\"\n\n#if AVUTIL_VERSION_INT > AV_VERSION_INT(52, 0, 0)\n#include <libavutil\/samplefmt.h>\n#endif\n\nusing namespace std;\n\nnamespace avg {\n\nAudioDecoderThread::AudioDecoderThread(CQueue& cmdQ, AudioMsgQueue& msgQ, \n VideoMsgQueue& packetQ, AVStream* pStream, const AudioParams& ap)\n : WorkerThread<AudioDecoderThread>(string(\"AudioDecoderThread\"), cmdQ),\n m_MsgQ(msgQ),\n m_PacketQ(packetQ),\n m_AP(ap),\n m_pStream(pStream),\n m_pResampleContext(0),\n m_State(DECODING)\n{\n m_LastFrameTime = 0;\n m_AudioStartTimestamp = 0;\n\n if (m_pStream->start_time != (long long)AV_NOPTS_VALUE) {\n m_AudioStartTimestamp = float(av_q2d(m_pStream->time_base)*m_pStream->start_time);\n }\n m_InputSampleRate = (int)(m_pStream->codec->sample_rate);\n m_InputSampleFormat = m_pStream->codec->sample_fmt;\n}\n\nAudioDecoderThread::~AudioDecoderThread()\n{\n if (m_pResampleContext) {\n audio_resample_close(m_pResampleContext);\n m_pResampleContext = 0;\n }\n}\n\nstatic ProfilingZoneID DecoderProfilingZone(\"Audio Decoder Thread\", true);\nstatic ProfilingZoneID PacketWaitProfilingZone(\"Audio Wait for packet\", true);\n\nbool AudioDecoderThread::work() \n{\n ScopeTimer timer(DecoderProfilingZone);\n VideoMsgPtr pMsg;\n {\n ScopeTimer timer(PacketWaitProfilingZone);\n pMsg = m_PacketQ.pop(true);\n }\n switch (pMsg->getType()) {\n case VideoMsg::PACKET: {\n AVPacket* pPacket = pMsg->getPacket();\n switch(m_State) {\n case DECODING:\n decodePacket(pPacket);\n break;\n case SEEK_DONE:\n handleSeekDone(pPacket);\n break;\n case DISCARDING:\n discardPacket(pPacket);\n break;\n default:\n AVG_ASSERT(false);\n }\n av_free_packet(pPacket);\n delete pPacket;\n break;\n }\n case VideoMsg::SEEK_DONE:\n m_State = SEEK_DONE;\n m_SeekSeqNum = pMsg->getSeekSeqNum();\n m_SeekTime = pMsg->getSeekTime();\n break;\n case VideoMsg::END_OF_FILE:\n pushEOF();\n break;\n case VideoMsg::CLOSED:\n m_MsgQ.clear();\n stop();\n break;\n default:\n pMsg->dump();\n AVG_ASSERT(false);\n }\n ThreadProfiler::get()->reset();\n return true;\n}\n\nvoid AudioDecoderThread::decodePacket(AVPacket* pPacket)\n{\n char* pDecodedData = (char*)av_malloc(AVCODEC_MAX_AUDIO_FRAME_SIZE +\n FF_INPUT_BUFFER_PADDING_SIZE);\n AVPacket* pTempPacket = new AVPacket;\n av_init_packet(pTempPacket);\n pTempPacket->data = pPacket->data;\n pTempPacket->size = pPacket->size;\n while (pTempPacket->size > 0) {\n int bytesDecoded = AVCODEC_MAX_AUDIO_FRAME_SIZE;\n#if LIBAVCODEC_VERSION_INT > AV_VERSION_INT(52, 31, 0)\n int bytesConsumed = avcodec_decode_audio3(m_pStream->codec, (short*)pDecodedData,\n &bytesDecoded, pTempPacket);\n#else\n int bytesConsumed = avcodec_decode_audio2(m_pStream->codec, (short*)pDecodedData,\n &bytesDecoded, pTempPacket->data, pTempPacket->size);\n#endif\n AVG_ASSERT(bytesConsumed != 0);\n if (bytesConsumed < 0) {\n \/\/ Error decoding -> throw away current packet.\n bytesDecoded = 0;\n pTempPacket->size = 0;\n } else {\n pTempPacket->data += bytesConsumed;\n pTempPacket->size -= bytesConsumed;\n }\n if (bytesDecoded > 0) {\n int framesDecoded = bytesDecoded\/(m_pStream->codec->channels*\n getBytesPerSample(m_InputSampleFormat));\n AudioBufferPtr pBuffer;\n bool bNeedsResample = (m_InputSampleRate != m_AP.m_SampleRate ||\n m_InputSampleFormat != SAMPLE_FMT_S16 ||\n m_pStream->codec->channels != m_AP.m_Channels);\n if (bNeedsResample) {\n pBuffer = resampleAudio(pDecodedData, framesDecoded);\n } else {\n pBuffer = AudioBufferPtr(new AudioBuffer(framesDecoded, m_AP));\n memcpy(pBuffer->getData(), pDecodedData, bytesDecoded);\n }\n m_LastFrameTime += float(pBuffer->getNumFrames())\/m_AP.m_SampleRate;\n pushAudioMsg(pBuffer, m_LastFrameTime);\n }\n }\n av_free(pDecodedData);\n delete pTempPacket;\n}\n\nvoid AudioDecoderThread::handleSeekDone(AVPacket* pPacket)\n{\n m_MsgQ.clear();\n m_LastFrameTime = float(pPacket->dts*av_q2d(m_pStream->time_base))\n - m_AudioStartTimestamp;\n\n if (fabs(m_LastFrameTime - m_SeekTime) < 0.01) {\n pushSeekDone(m_LastFrameTime, m_SeekSeqNum);\n decodePacket(pPacket);\n m_State = DECODING;\n } else {\n if (m_LastFrameTime-0.01f < m_SeekTime) {\n \/\/ Received frame that's earlier than the destination, so throw away frames\n \/\/ until the time is correct.\n m_State = DISCARDING;\n } else {\n \/\/ Received frame that's too late, so insert a buffer of silence to \n \/\/ compensate.\n insertSilence(m_LastFrameTime - m_SeekTime);\n m_LastFrameTime = m_SeekTime;\n pushSeekDone(m_LastFrameTime, m_SeekSeqNum);\n decodePacket(pPacket);\n m_State = DECODING;\n }\n }\n}\n\nvoid AudioDecoderThread::discardPacket(AVPacket* pPacket)\n{\n m_LastFrameTime = float(pPacket->dts*av_q2d(m_pStream->time_base))\n - m_AudioStartTimestamp;\n if (m_LastFrameTime-0.01f > m_SeekTime) {\n pushSeekDone(m_LastFrameTime, m_SeekSeqNum);\n m_State = DECODING;\n }\n}\n\nAudioBufferPtr AudioDecoderThread::resampleAudio(char* pDecodedData, int framesDecoded)\n{\n if (!m_pResampleContext) {\n#if LIBAVFORMAT_VERSION_INT >= AV_VERSION_INT(52, 24, 0)\n m_pResampleContext = av_audio_resample_init(m_AP.m_Channels, \n m_pStream->codec->channels, m_AP.m_SampleRate, m_InputSampleRate,\n SAMPLE_FMT_S16, (SampleFormat)m_InputSampleFormat, 16, 10, 0, 0.8);\n#else\n m_pResampleContext = audio_resample_init(m_AP.m_Channels, \n m_pStream->codec->channels, m_AP.m_SampleRate, m_InputSampleRate);\n#endif\n AVG_ASSERT(m_pResampleContext);\n }\n\n short pResampledData[AVCODEC_MAX_AUDIO_FRAME_SIZE\/2];\n int framesResampled = audio_resample(m_pResampleContext, pResampledData,\n (short*)pDecodedData, framesDecoded);\n AudioBufferPtr pBuffer(new AudioBuffer(framesResampled, m_AP));\n memcpy(pBuffer->getData(), pResampledData, \n framesResampled*m_AP.m_Channels*sizeof(short));\n return pBuffer;\n}\n\nvoid AudioDecoderThread::insertSilence(float duration)\n{\n int numDelaySamples = int(duration*m_AP.m_SampleRate);\n AudioBufferPtr pBuffer(new AudioBuffer(numDelaySamples, m_AP));\n pBuffer->clear();\n pushAudioMsg(pBuffer, m_LastFrameTime);\n}\n\nvoid AudioDecoderThread::pushAudioMsg(AudioBufferPtr pBuffer, float time)\n{\n VideoMsgPtr pMsg(new VideoMsg());\n pMsg->setAudio(pBuffer, time);\n m_MsgQ.push(pMsg);\n}\n\nvoid AudioDecoderThread::pushSeekDone(float time, int seqNum)\n{\n VideoMsgPtr pMsg(new VideoMsg());\n pMsg->setSeekDone(seqNum, time);\n m_MsgQ.push(pMsg);\n}\n\nvoid AudioDecoderThread::pushEOF()\n{\n VideoMsgPtr pMsg(new VideoMsg());\n pMsg->setEOF();\n m_MsgQ.push(pMsg);\n}\n\nint AudioDecoderThread::getBytesPerSample(int sampleFormat)\n{\n switch (sampleFormat) {\n case SAMPLE_FMT_U8:\n return 1;\n case SAMPLE_FMT_S16:\n return 2;\n#ifdef SAMPLE_FMT_S16P \n case SAMPLE_FMT_S16P:\n return 2;\n#endif\n case SAMPLE_FMT_S32:\n return 4;\n case SAMPLE_FMT_FLT:\n return 4;\n case SAMPLE_FMT_DBL:\n return 8;\n default:\n AVG_LOG_ERROR(\"Unknown SampleFormat: \" << sampleFormat << \"\\n\");\n AVG_ASSERT(false);\n return 0;\n }\n}\n\n}\n<|endoftext|>"} {"text":"<commit_before>#include <string>\n#include <vector>\n#include <iostream>\n#include <fstream>\n#include <iomanip>\n#include <cstdlib>\n#include <chrono>\n#include <sstream>\n#include <cmath>\n#include <cstdio>\n#include <sys\/stat.h>\n#include <sys\/ipc.h>\n#include <sys\/shm.h>\n#include <sys\/msg.h>\n#include <unistd.h>\n\n#include \"entity.h\"\n#include \"character.h\"\n#include \"monster.h\"\n#include \"spell.h\"\n#include \"item.h\"\n#include \"tile.h\"\n#include \"timetable.h\"\n#include \"mailbox.h\"\n\nusing namespace std;\n\n\/\/Structure for HTTP form data\nstruct FormInfo{\n\tstring Key;\n\tstring Value;\n};\n\nvector<Tile> Map; \/\/[][]\nvector<Enemy> SpawnedEnemies; \/\/ []\nvector<Character> Players;\n\n\/\/Vector to hold Key \/ Value pairs after processing\nvector<FormInfo> FormData;\n\nvoid getFormData(string Env);\nstring GetValueFromKey(string FindKey);\n\nint main(){\n\t\/\/Setup Game state\n\tTimeTable TimeTable;\n\tMailbox Mailbox;\n\tbool Done = false;\n\tstring FormData;\n\tstring Action;\n\t\n\t\/\/Load maps\n\t\n\t\/\/Load definitions\n\tcout << \"Beginning main loop\\n\" << flush;\n\tcout << \"Mailbox: \" << Mailbox.SetupSuccessful() << \"\\n\" << flush;\n\t\/\/Main Loop\n\twhile (!Done){\n\t\t\/\/Check Time table. Perform function for all expired times\n\t\t\n\t\t\/\/Check and Process Messages\n\t\tcout << \"Next Msg\" << flush;\n\t\tFormData = Mailbox.GetNextMessage();\n\t\tcout << FormData << flush;\n\t\tgetFormData(FormData);\n\t\tAction = GetValueFromKey(\"Action\");\n\t\tcout << Action << flush;\n\t\t\n\t\tif (Action == \"EnterGame\"){\n\t\t\tCharacter NewChar(GetValueFromKey(\"u\"), GetValueFromKey(\"c\"), stoi(GetValueFromKey(\"Box\")));\n\t\t\tMailbox.OpenUserBox(NewChar.Box);\n\t\t\tMailbox.SendMessageToBox(\"This is a test of the server.\", NewChar.Box);\n\t\t\tDone = true;\n\t\t}\n\t\t\n\t\tif (Action == \"LeaveGame\"){\n\t\t}\n\t\t\n\t\tif (Action == \"Move\"){\n\t\t}\t\n\t\t\n\t\tif (Action == \"CastSpell\"){\n\t\t}\t\n\t\t\n\t\tif (Action == \"EquipItem\"){\n\t\t}\t\t\n\t\t\n\t\tif (Action == \"UseItem\"){\n\t\t}\t\t\n\n\t\tif (Action == \"Attack\"){\n\t\t}\n\t\t\/\/Game in progress action\n\n\t\t\/\/Perform a character action\n\n\t\t\/\/Perform an inventory action\n\n\t\t\/\/Perform a world action\n\n\t\t\/\/Perform targetting action\n\t\n\t\t\/\/Sleep 10 milliseconds before looping again.\t\n\t\t\n\t}\n\n\n\t\n\t\n\n \n \n}\n\n\nstring GetValueFromKey(string FindKey){\n\tfor (int i = 0; i < FormData.size(); i++){\n\t\tif (!FormData[i].Key.compare(FindKey)){ return FormData[i].Value; }\n\t}\t\n\treturn \"\";\n}\n\nvoid getFormData(string Env){\n\tint EnvLen = Env.size();\t\n\tint Start = 1;\n\tint Mid = 0;\n\tFormInfo NewData;\n\n\t\/\/Split Key-Value pairs and place in the FormData structure.\n\tfor (int i = 1; i < EnvLen; i++){\n\tif (Env[i] == '='){Mid = i + 1;}\n\t\tif (Env[i] == '&' || i == EnvLen - 1){\n\t\t\tif (i == EnvLen - 1) i++; \/\/Get last character\n\t\t\tNewData.Key = Env.substr(Start,Mid-Start-1);\n\t\t\tNewData.Value = Env.substr(Mid, i - Mid);\n\t\t\tFormData.push_back(NewData);\n\t\t\tStart = i + 1;\n\t\t}\n\t}\n}\n\n<commit_msg>testing server<commit_after>#include <string>\n#include <vector>\n#include <iostream>\n#include <fstream>\n#include <iomanip>\n#include <cstdlib>\n#include <chrono>\n#include <sstream>\n#include <cmath>\n#include <cstdio>\n#include <sys\/stat.h>\n#include <sys\/ipc.h>\n#include <sys\/shm.h>\n#include <sys\/msg.h>\n#include <unistd.h>\n\n#include \"entity.h\"\n#include \"character.h\"\n#include \"monster.h\"\n#include \"spell.h\"\n#include \"item.h\"\n#include \"tile.h\"\n#include \"timetable.h\"\n#include \"mailbox.h\"\n\nusing namespace std;\n\n\/\/Structure for HTTP form data\nstruct FormInfo{\n\tstring Key;\n\tstring Value;\n};\n\nvector<Tile> Map; \/\/[][]\nvector<Enemy> SpawnedEnemies; \/\/ []\nvector<Character> Players;\n\n\/\/Vector to hold Key \/ Value pairs after processing\nvector<FormInfo> FormData;\n\nvoid getFormData(string Env);\nstring GetValueFromKey(string FindKey);\n\nint main(){\n\t\/\/Setup Game state\n\tTimeTable TimeTable;\n\tMailbox Mailbox;\n\tbool Done = false;\n\tstring FormData;\n\tstring Action;\n\t\n\t\/\/Load maps\n\t\n\t\/\/Load definitions\n\tcout << \"Beginning main loop\\n\" << flush;\n\tcout << \"Mailbox: \" << Mailbox.SetupSuccessful() << \"\\n\" << flush;\n\t\/\/Main Loop\n\twhile (!Done){\n\t\t\/\/Check Time table. Perform function for all expired times\n\t\t\n\t\t\/\/Check and Process Messages\n\t\tFormData = Mailbox.GetNextMessage();\n\t\tcout << FormData << flush;\n\t\tgetFormData(FormData);\n\t\tAction = GetValueFromKey(\"Action\");\n\t\tcout << Action << flush;\n\t\t\n\t\tif (Action == \"EnterGame\"){\n\t\t\tCharacter NewChar(GetValueFromKey(\"u\"), GetValueFromKey(\"c\"), stoi(GetValueFromKey(\"Box\")));\n\t\t\tMailbox.OpenUserBox(NewChar.Box);\n\t\t\tMailbox.SendMessageToBox(\"This is a test of the server.\", NewChar.Box);\n\t\t\tDone = true;\n\t\t}\n\t\t\n\t\tif (Action == \"LeaveGame\"){\n\t\t}\n\t\t\n\t\tif (Action == \"Move\"){\n\t\t}\t\n\t\t\n\t\tif (Action == \"CastSpell\"){\n\t\t}\t\n\t\t\n\t\tif (Action == \"EquipItem\"){\n\t\t}\t\t\n\t\t\n\t\tif (Action == \"UseItem\"){\n\t\t}\t\t\n\n\t\tif (Action == \"Attack\"){\n\t\t}\n\t\t\/\/Game in progress action\n\n\t\t\/\/Perform a character action\n\n\t\t\/\/Perform an inventory action\n\n\t\t\/\/Perform a world action\n\n\t\t\/\/Perform targetting action\n\t\n\t\t\/\/Sleep 10 milliseconds before looping again.\t\n\t\t\n\t}\n\n\n\t\n\t\n\n \n \n}\n\n\nstring GetValueFromKey(string FindKey){\n\tfor (int i = 0; i < FormData.size(); i++){\n\t\tif (!FormData[i].Key.compare(FindKey)){ return FormData[i].Value; }\n\t}\t\n\treturn \"\";\n}\n\nvoid getFormData(string Env){\n\tint EnvLen = Env.size();\t\n\tint Start = 1;\n\tint Mid = 0;\n\tFormInfo NewData;\n\n\t\/\/Split Key-Value pairs and place in the FormData structure.\n\tfor (int i = 1; i < EnvLen; i++){\n\tif (Env[i] == '='){Mid = i + 1;}\n\t\tif (Env[i] == '&' || i == EnvLen - 1){\n\t\t\tif (i == EnvLen - 1) i++; \/\/Get last character\n\t\t\tNewData.Key = Env.substr(Start,Mid-Start-1);\n\t\t\tNewData.Value = Env.substr(Mid, i - Mid);\n\t\t\tFormData.push_back(NewData);\n\t\t\tStart = i + 1;\n\t\t}\n\t}\n}\n\n<|endoftext|>"} {"text":"<commit_before>#ifndef STATICDB_PLAN_HPP\n#define STATICDB_PLAN_HPP\n\n#include <staticdb\/expressions.hpp>\n#include <staticdb\/storage.hpp>\n#include <silicium\/function.hpp>\n\nnamespace staticdb\n{\n\ttemplate <class Storage>\n\tstruct basic_plan\n\t{\n\t\ttypedef Storage storage_type;\n\t\ttypedef Si::function<values::value (storage_type &, values::value const &)> planned_get_function;\n\t\ttypedef Si::function<values::value (storage_type &, values::value const &)> planned_set_function;\n\n\t\tstd::vector<planned_get_function> gets;\n\t\tstd::vector<planned_set_function> sets;\n\t\tSi::function<void (storage_type &)> initialize_storage;\n\t};\n\n\ttypedef expressions::expression get_function;\n\ttypedef expressions::expression set_function;\n\n\ttemplate <class Storage>\n\tinline basic_plan<Storage> make_plan(types::type const &root, Si::iterator_range<get_function const *> gets, Si::iterator_range<set_function const *> sets)\n\t{\n\t\ttypedef Storage storage_type;\n\t\tboost::ignore_unused_variable_warning(root);\n\t\tboost::ignore_unused_variable_warning(sets);\n\t\tbasic_plan<Storage> result;\n\t\tfor (get_function const &get : gets)\n\t\t{\n\t\t\tboost::ignore_unused_variable_warning(get);\n\t\t\tresult.gets.emplace_back([](storage_type &, values::value const &) -> values::value\n\t\t\t{\n\t\t\t\tthrow std::logic_error(\"not implemented\");\n\t\t\t});\n\t\t}\n\t\treturn result;\n\t}\n}\n\n#endif\n<commit_msg>first steps for layouting<commit_after>#ifndef STATICDB_PLAN_HPP\n#define STATICDB_PLAN_HPP\n\n#include <staticdb\/expressions.hpp>\n#include <staticdb\/storage.hpp>\n#include <silicium\/function.hpp>\n\nnamespace staticdb\n{\n\ttemplate <class Storage>\n\tstruct basic_plan\n\t{\n\t\ttypedef Storage storage_type;\n\t\ttypedef Si::function<values::value (storage_type &, values::value const &)> planned_get_function;\n\t\ttypedef Si::function<values::value (storage_type &, values::value const &)> planned_set_function;\n\n\t\tstd::vector<planned_get_function> gets;\n\t\tstd::vector<planned_set_function> sets;\n\t\tSi::function<void (storage_type &)> initialize_storage;\n\t};\n\n\ttypedef expressions::expression get_function;\n\ttypedef expressions::expression set_function;\n\n\tnamespace layouts\n\t{\n\t\tstruct layout;\n\n\t\tstruct unit\n\t\t{\n\t\t};\n\n\t\tstruct tuple\n\t\t{\n\t\t\tstd::vector<layout> elements;\n\n\t\t\texplicit tuple(std::vector<layout> elements)\n\t\t\t\t: elements(std::move(elements))\n\t\t\t{\n\t\t\t}\n\t\t};\n\n\t\tstruct array\n\t\t{\n\t\t\tstd::unique_ptr<layout> element;\n\n\t\t\texplicit array(std::unique_ptr<layout> element)\n\t\t\t\t: element(std::move(element))\n\t\t\t{\n\t\t\t}\n\t\t};\n\n\t\tstruct bitset\n\t\t{\n\t\t\tstd::size_t length;\n\n\t\t\texplicit bitset(std::size_t length)\n\t\t\t\t: length(length)\n\t\t\t{\n\t\t\t}\n\t\t};\n\n\t\tstruct variant\n\t\t{\n\t\t\tstd::vector<layout> possibilities;\n\n\t\t\texplicit variant(std::vector<layout> possibilities)\n\t\t\t\t: possibilities(std::move(possibilities))\n\t\t\t{\n\t\t\t}\n\t\t};\n\n\t\tstruct layout : Si::variant<unit, tuple, array, bitset, variant>\n\t\t{\n\t\t\ttypedef Si::variant<unit, tuple, array, bitset, variant> base;\n\n\t\t\ttemplate <class A0>\n\t\t\texplicit layout(A0 &&a0)\n\t\t\t\t: base(std::forward<A0>(a0))\n\t\t\t{\n\t\t\t}\n\n\t\t\tbase const &as_variant() const\n\t\t\t{\n\t\t\t\treturn *this;\n\t\t\t}\n\t\t};\n\n\t\tinline layout calculate(types::type const &root)\n\t\t{\n\t\t\treturn Si::visit<layout>(\n\t\t\t\troot.as_variant(),\n\t\t\t\t[](types::unit) -> layout\n\t\t\t\t{\n\t\t\t\t\tthrow std::invalid_argument(\"Cannot calculate layout for unit\");\n\t\t\t\t},\n\t\t\t\t[](types::bit) -> layout\n\t\t\t\t{\n\t\t\t\t\treturn layout(bitset(1));\n\t\t\t\t},\n\t\t\t\t[](types::function) -> layout\n\t\t\t\t{\n\t\t\t\t\tthrow std::invalid_argument(\"Cannot calculate layout for a function\");\n\t\t\t\t},\n\t\t\t\t[](types::tuple const &tuple_type) -> layout\n\t\t\t\t{\n\t\t\t\t\tbool could_be_bitset = true;\n\t\t\t\t\tstd::size_t bits = 0;\n\t\t\t\t\tstd::vector<layout> element_layouts;\n\t\t\t\t\tfor (types::type const &element : tuple_type.elements)\n\t\t\t\t\t{\n\t\t\t\t\t\tlayout element_layout = calculate(element);\n\t\t\t\t\t\tif (could_be_bitset)\n\t\t\t\t\t\t{\n\t\t\t\t\t\t\tcould_be_bitset = Si::visit<bool>(\n\t\t\t\t\t\t\t\telement_layout.as_variant(),\n\t\t\t\t\t\t\t\t[](unit const &)\n\t\t\t\t\t\t\t\t{\n\t\t\t\t\t\t\t\t\treturn false;\n\t\t\t\t\t\t\t\t},\n\t\t\t\t\t\t\t\t[](tuple const &)\n\t\t\t\t\t\t\t\t{\n\t\t\t\t\t\t\t\t\treturn false;\n\t\t\t\t\t\t\t\t},\n\t\t\t\t\t\t\t\t[](array const &)\n\t\t\t\t\t\t\t\t{\n\t\t\t\t\t\t\t\t\treturn false;\n\t\t\t\t\t\t\t\t},\n\t\t\t\t\t\t\t\t[&bits](bitset const &b)\n\t\t\t\t\t\t\t\t{\n\t\t\t\t\t\t\t\t\tbits += b.length;\n\t\t\t\t\t\t\t\t\treturn true;\n\t\t\t\t\t\t\t\t},\n\t\t\t\t\t\t\t\t[](variant const &)\n\t\t\t\t\t\t\t\t{\n\t\t\t\t\t\t\t\t\treturn false;\n\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t);\n\t\t\t\t\t\t}\n\t\t\t\t\t\telement_layouts.emplace_back(std::move(element_layout));\n\t\t\t\t\t}\n\t\t\t\t\tif (could_be_bitset)\n\t\t\t\t\t{\n\t\t\t\t\t\treturn layout(bitset(bits));\n\t\t\t\t\t}\n\t\t\t\t\treturn layout(tuple(std::move(element_layouts)));\n\t\t\t\t},\n\t\t\t\t[](types::variant const &variant_type) -> layout\n\t\t\t\t{\n\t\t\t\t\t\/\/TODO: fold variants\n\t\t\t\t\tstd::vector<layout> possibilities;\n\t\t\t\t\tfor (types::type const &possible_type : variant_type.possibilities)\n\t\t\t\t\t{\n\t\t\t\t\t\tpossibilities.emplace_back(calculate(possible_type));\n\t\t\t\t\t}\n\t\t\t\t\treturn layout(variant(std::move(possibilities)));\n\t\t\t\t},\n\t\t\t\t[](types::array const &array_type) -> layout\n\t\t\t\t{\n\t\t\t\t\tlayout element = calculate(*array_type.elements);\n\t\t\t\t\treturn layout(array(Si::to_unique(std::move(element))));\n\t\t\t\t}\n\t\t\t);\n\t\t}\n\t}\n\n\ttemplate <class Storage>\n\tinline basic_plan<Storage> make_plan(types::type const &root, Si::iterator_range<get_function const *> gets, Si::iterator_range<set_function const *> sets)\n\t{\n\t\ttypedef Storage storage_type;\n\t\tboost::ignore_unused_variable_warning(sets);\n\t\tlayouts::layout root_layout = layouts::calculate(root);\n\t\tbasic_plan<Storage> result;\n\t\tfor (get_function const &get : gets)\n\t\t{\n\t\t\tboost::ignore_unused_variable_warning(get);\n\t\t\tresult.gets.emplace_back([](storage_type &, values::value const &) -> values::value\n\t\t\t{\n\t\t\t\tthrow std::logic_error(\"not implemented\");\n\t\t\t});\n\t\t}\n\t\treturn result;\n\t}\n}\n\n#endif\n<|endoftext|>"} {"text":"<commit_before><commit_msg>coverity#704675 Unchecked dynamic_cast<commit_after><|endoftext|>"} {"text":"<commit_before>\/*************************************************************************\n *\n * OpenOffice.org - a multi-platform office productivity suite\n *\n * $RCSfile: progress.cxx,v $\n *\n * $Revision: 1.6 $\n *\n * last change: $Author: kz $ $Date: 2006-07-21 11: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\n\/\/ MARKER(update_precomp.py): autogen include statement, do not remove\n#include \"precompiled_sc.hxx\"\n\n\n\n\/\/------------------------------------------------------------------------\n\n#include <sfx2\/app.hxx>\n#include <sfx2\/objsh.hxx>\n#include <sfx2\/progress.hxx>\n#include <sfx2\/docfile.hxx>\n#include <sfx2\/sfxsids.hrc>\n#include <svtools\/eitem.hxx>\n#include <svtools\/itemset.hxx>\n\n#define SC_PROGRESS_CXX\n#include \"progress.hxx\"\n#include \"document.hxx\"\n#include \"global.hxx\"\n#include \"globstr.hrc\"\n\n\n\nstatic ScProgress theDummyInterpretProgress;\nSfxProgress* ScProgress::pGlobalProgress = NULL;\nULONG ScProgress::nGlobalRange = 0;\nULONG ScProgress::nGlobalPercent = 0;\nBOOL ScProgress::bGlobalNoUserBreak = TRUE;\nScProgress* ScProgress::pInterpretProgress = &theDummyInterpretProgress;\nScProgress* ScProgress::pOldInterpretProgress = NULL;\nULONG ScProgress::nInterpretProgress = 0;\nBOOL ScProgress::bAllowInterpretProgress = TRUE;\nScDocument* ScProgress::pInterpretDoc;\nBOOL ScProgress::bIdleWasDisabled = FALSE;\n\n\nBOOL lcl_IsHiddenDocument( SfxObjectShell* pObjSh )\n{\n if (pObjSh)\n {\n SfxMedium* pMed = pObjSh->GetMedium();\n if (pMed)\n {\n SfxItemSet* pSet = pMed->GetItemSet();\n const SfxPoolItem* pItem;\n if ( pSet && SFX_ITEM_SET == pSet->GetItemState( SID_HIDDEN, TRUE, &pItem ) &&\n ((const SfxBoolItem*)pItem)->GetValue() )\n return TRUE;\n }\n }\n return FALSE;\n}\n\nScProgress::ScProgress( SfxObjectShell* pObjSh, const String& rText,\n ULONG nRange, BOOL bAllDocs, BOOL bWait )\n{\n\n if ( pGlobalProgress || SfxProgress::GetActiveProgress( NULL ) )\n {\n if ( lcl_IsHiddenDocument(pObjSh) )\n {\n \/\/ loading a hidden document while a progress is active is possible - no error\n pProgress = NULL;\n }\n else\n {\n DBG_ERROR( \"ScProgress: there can be only one!\" );\n pProgress = NULL;\n }\n }\n else if ( SFX_APP()->IsDowning() )\n {\n \/\/ kommt vor z.B. beim Speichern des Clipboard-Inhalts als OLE beim Beenden\n \/\/ Dann wuerde ein SfxProgress wild im Speicher rummuellen\n \/\/! Soll das so sein ???\n\n pProgress = NULL;\n }\n else if ( pObjSh && ( pObjSh->GetCreateMode() == SFX_CREATE_MODE_EMBEDDED ||\n pObjSh->GetProgress() ) )\n {\n \/\/ #62808# no own progress for embedded objects,\n \/\/ #73633# no second progress if the document already has one\n\n pProgress = NULL;\n }\n else\n {\n pProgress = new SfxProgress( pObjSh, rText, nRange, bAllDocs, bWait );\n pGlobalProgress = pProgress;\n nGlobalRange = nRange;\n nGlobalPercent = 0;\n bGlobalNoUserBreak = TRUE;\n }\n}\n\n\nScProgress::ScProgress() :\n pProgress( NULL )\n{ \/\/ DummyInterpret\n}\n\n\nScProgress::~ScProgress()\n{\n if ( pProgress )\n {\n delete pProgress;\n pGlobalProgress = NULL;\n nGlobalRange = 0;\n nGlobalPercent = 0;\n bGlobalNoUserBreak = TRUE;\n }\n}\n\n\n\/\/ static\n\nvoid ScProgress::SetAllowInterpret( BOOL bAllow )\n{ \/\/ Grundzustand: Allow, Dummy gesetzt, pOld==NULL\n if ( !bAllow && bAllowInterpretProgress )\n { \/\/ vorherigen\/Dummy merken und Dummy setzen\n pOldInterpretProgress = pInterpretProgress;\n pInterpretProgress = &theDummyInterpretProgress;\n bAllowInterpretProgress = FALSE;\n }\n else if ( bAllow && !bAllowInterpretProgress )\n { \/\/ Dummy weg und vorherigen\/Dummy setzen\n pInterpretProgress = pOldInterpretProgress;\n pOldInterpretProgress = NULL;\n bAllowInterpretProgress = TRUE;\n }\n}\n\n\n\/\/ static\n\nvoid ScProgress::CreateInterpretProgress( ScDocument* pDoc, BOOL bWait )\n{\n if ( bAllowInterpretProgress )\n {\n if ( nInterpretProgress )\n nInterpretProgress++;\n else if ( pDoc->GetAutoCalc() )\n {\n nInterpretProgress = 1;\n bIdleWasDisabled = pDoc->IsIdleDisabled();\n pDoc->DisableIdle( TRUE );\n \/\/ Interpreter may be called in many circumstances, also if another\n \/\/ progress bar is active, for example while adapting row heights.\n \/\/ Keep the dummy interpret progress.\n if ( !pGlobalProgress )\n pInterpretProgress = new ScProgress( pDoc->GetDocumentShell(),\n ScGlobal::GetRscString( STR_PROGRESS_CALCULATING ),\n pDoc->GetFormulaCodeInTree(), FALSE, bWait );\n pInterpretDoc = pDoc;\n }\n }\n}\n\n\n\/\/ static\n\nvoid ScProgress::DeleteInterpretProgress()\n{\n if ( bAllowInterpretProgress && nInterpretProgress )\n {\n \/* Do not decrement 'nInterpretProgress', before 'pInterpretProgress'\n is deleted. In rare cases, deletion of 'pInterpretProgress' causes\n a refresh of the sheet window which may call CreateInterpretProgress\n and DeleteInterpretProgress again (from Output::DrawStrings),\n resulting in double deletion of 'pInterpretProgress'. *\/\n\/\/ if ( --nInterpretProgress == 0 )\n if ( nInterpretProgress == 1 )\n {\n if ( pInterpretProgress != &theDummyInterpretProgress )\n {\n \/\/ move pointer to local temporary to avoid double deletion\n ScProgress* pTmpProgress = pInterpretProgress;\n pInterpretProgress = &theDummyInterpretProgress;\n delete pTmpProgress;\n }\n if ( pInterpretDoc )\n pInterpretDoc->DisableIdle( bIdleWasDisabled );\n }\n --nInterpretProgress;\n }\n}\n\n\n\n<commit_msg>INTEGRATION: CWS changefileheader (1.6.492); FILE MERGED 2008\/03\/31 17:14:18 rt 1.6.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: progress.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_sc.hxx\"\n\n\n\n\/\/------------------------------------------------------------------------\n\n#include <sfx2\/app.hxx>\n#include <sfx2\/objsh.hxx>\n#include <sfx2\/progress.hxx>\n#include <sfx2\/docfile.hxx>\n#include <sfx2\/sfxsids.hrc>\n#include <svtools\/eitem.hxx>\n#include <svtools\/itemset.hxx>\n\n#define SC_PROGRESS_CXX\n#include \"progress.hxx\"\n#include \"document.hxx\"\n#include \"global.hxx\"\n#include \"globstr.hrc\"\n\n\n\nstatic ScProgress theDummyInterpretProgress;\nSfxProgress* ScProgress::pGlobalProgress = NULL;\nULONG ScProgress::nGlobalRange = 0;\nULONG ScProgress::nGlobalPercent = 0;\nBOOL ScProgress::bGlobalNoUserBreak = TRUE;\nScProgress* ScProgress::pInterpretProgress = &theDummyInterpretProgress;\nScProgress* ScProgress::pOldInterpretProgress = NULL;\nULONG ScProgress::nInterpretProgress = 0;\nBOOL ScProgress::bAllowInterpretProgress = TRUE;\nScDocument* ScProgress::pInterpretDoc;\nBOOL ScProgress::bIdleWasDisabled = FALSE;\n\n\nBOOL lcl_IsHiddenDocument( SfxObjectShell* pObjSh )\n{\n if (pObjSh)\n {\n SfxMedium* pMed = pObjSh->GetMedium();\n if (pMed)\n {\n SfxItemSet* pSet = pMed->GetItemSet();\n const SfxPoolItem* pItem;\n if ( pSet && SFX_ITEM_SET == pSet->GetItemState( SID_HIDDEN, TRUE, &pItem ) &&\n ((const SfxBoolItem*)pItem)->GetValue() )\n return TRUE;\n }\n }\n return FALSE;\n}\n\nScProgress::ScProgress( SfxObjectShell* pObjSh, const String& rText,\n ULONG nRange, BOOL bAllDocs, BOOL bWait )\n{\n\n if ( pGlobalProgress || SfxProgress::GetActiveProgress( NULL ) )\n {\n if ( lcl_IsHiddenDocument(pObjSh) )\n {\n \/\/ loading a hidden document while a progress is active is possible - no error\n pProgress = NULL;\n }\n else\n {\n DBG_ERROR( \"ScProgress: there can be only one!\" );\n pProgress = NULL;\n }\n }\n else if ( SFX_APP()->IsDowning() )\n {\n \/\/ kommt vor z.B. beim Speichern des Clipboard-Inhalts als OLE beim Beenden\n \/\/ Dann wuerde ein SfxProgress wild im Speicher rummuellen\n \/\/! Soll das so sein ???\n\n pProgress = NULL;\n }\n else if ( pObjSh && ( pObjSh->GetCreateMode() == SFX_CREATE_MODE_EMBEDDED ||\n pObjSh->GetProgress() ) )\n {\n \/\/ #62808# no own progress for embedded objects,\n \/\/ #73633# no second progress if the document already has one\n\n pProgress = NULL;\n }\n else\n {\n pProgress = new SfxProgress( pObjSh, rText, nRange, bAllDocs, bWait );\n pGlobalProgress = pProgress;\n nGlobalRange = nRange;\n nGlobalPercent = 0;\n bGlobalNoUserBreak = TRUE;\n }\n}\n\n\nScProgress::ScProgress() :\n pProgress( NULL )\n{ \/\/ DummyInterpret\n}\n\n\nScProgress::~ScProgress()\n{\n if ( pProgress )\n {\n delete pProgress;\n pGlobalProgress = NULL;\n nGlobalRange = 0;\n nGlobalPercent = 0;\n bGlobalNoUserBreak = TRUE;\n }\n}\n\n\n\/\/ static\n\nvoid ScProgress::SetAllowInterpret( BOOL bAllow )\n{ \/\/ Grundzustand: Allow, Dummy gesetzt, pOld==NULL\n if ( !bAllow && bAllowInterpretProgress )\n { \/\/ vorherigen\/Dummy merken und Dummy setzen\n pOldInterpretProgress = pInterpretProgress;\n pInterpretProgress = &theDummyInterpretProgress;\n bAllowInterpretProgress = FALSE;\n }\n else if ( bAllow && !bAllowInterpretProgress )\n { \/\/ Dummy weg und vorherigen\/Dummy setzen\n pInterpretProgress = pOldInterpretProgress;\n pOldInterpretProgress = NULL;\n bAllowInterpretProgress = TRUE;\n }\n}\n\n\n\/\/ static\n\nvoid ScProgress::CreateInterpretProgress( ScDocument* pDoc, BOOL bWait )\n{\n if ( bAllowInterpretProgress )\n {\n if ( nInterpretProgress )\n nInterpretProgress++;\n else if ( pDoc->GetAutoCalc() )\n {\n nInterpretProgress = 1;\n bIdleWasDisabled = pDoc->IsIdleDisabled();\n pDoc->DisableIdle( TRUE );\n \/\/ Interpreter may be called in many circumstances, also if another\n \/\/ progress bar is active, for example while adapting row heights.\n \/\/ Keep the dummy interpret progress.\n if ( !pGlobalProgress )\n pInterpretProgress = new ScProgress( pDoc->GetDocumentShell(),\n ScGlobal::GetRscString( STR_PROGRESS_CALCULATING ),\n pDoc->GetFormulaCodeInTree(), FALSE, bWait );\n pInterpretDoc = pDoc;\n }\n }\n}\n\n\n\/\/ static\n\nvoid ScProgress::DeleteInterpretProgress()\n{\n if ( bAllowInterpretProgress && nInterpretProgress )\n {\n \/* Do not decrement 'nInterpretProgress', before 'pInterpretProgress'\n is deleted. In rare cases, deletion of 'pInterpretProgress' causes\n a refresh of the sheet window which may call CreateInterpretProgress\n and DeleteInterpretProgress again (from Output::DrawStrings),\n resulting in double deletion of 'pInterpretProgress'. *\/\n\/\/ if ( --nInterpretProgress == 0 )\n if ( nInterpretProgress == 1 )\n {\n if ( pInterpretProgress != &theDummyInterpretProgress )\n {\n \/\/ move pointer to local temporary to avoid double deletion\n ScProgress* pTmpProgress = pInterpretProgress;\n pInterpretProgress = &theDummyInterpretProgress;\n delete pTmpProgress;\n }\n if ( pInterpretDoc )\n pInterpretDoc->DisableIdle( bIdleWasDisabled );\n }\n --nInterpretProgress;\n }\n}\n\n\n\n<|endoftext|>"} {"text":"<commit_before>\/*************************************************************************\n *\n * $RCSfile: excdefs.hxx,v $\n *\n * $Revision: 1.43 $\n *\n * last change: $Author: obo $ $Date: 2004-06-04 14: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: 2000 by Sun Microsystems, Inc.\n *\n * All Rights Reserved.\n *\n * Contributor(s): _______________________________________\n *\n *\n ************************************************************************\/\n\n#ifndef _EXCDEFS_HXX\n#define _EXCDEFS_HXX\n\n#ifndef _SAL_TYPES_H_\n#include <sal\/types.h>\n#endif\n\n\/\/ (0x001C) NOTE ==============================================================\n\n#define EXC_NOTE5_MAXTEXT 2048\n\n\/\/ (0x0031) FONT ==============================================================\n\n\/\/ color\n#define EXC_FONTCOL_IGNORE 0x7FFF\n\n\/\/ height\n#define EXC_FONTHGHT_COEFF 20.0\n\n\/\/ (0x0092) PALETTE ===========================================================\n\n\/\/ special color indices\n#define EXC_COLIND_AUTOTEXT 77\n#define EXC_COLIND_AUTOLINE 77\n#define EXC_COLIND_AUTOFILLBG 77\n#define EXC_COLIND_AUTOFILLFG 78\n\n\/\/ (0x009B, 0x009D, 0x009E) AUTOFILTER ========================================\n\n\/\/ flags\n#define EXC_AFFLAG_AND 0x0000\n#define EXC_AFFLAG_OR 0x0001\n#define EXC_AFFLAG_ANDORMASK 0x0003\n#define EXC_AFFLAG_SIMPLE1 0x0004\n#define EXC_AFFLAG_SIMPLE2 0x0008\n#define EXC_AFFLAG_TOP10 0x0010\n#define EXC_AFFLAG_TOP10TOP 0x0020\n#define EXC_AFFLAG_TOP10PERC 0x0040\n\n\/\/ data types\n#define EXC_AFTYPE_NOTUSED 0x00\n#define EXC_AFTYPE_RK 0x02\n#define EXC_AFTYPE_DOUBLE 0x04\n#define EXC_AFTYPE_STRING 0x06\n#define EXC_AFTYPE_BOOLERR 0x08\n#define EXC_AFTYPE_INVALID 0x0A\n#define EXC_AFTYPE_EMPTY 0x0C\n#define EXC_AFTYPE_NOTEMPTY 0x0E\n\n\/\/ comparison operands\n#define EXC_AFOPER_NONE 0x00\n#define EXC_AFOPER_LESS 0x01\n#define EXC_AFOPER_EQUAL 0x02\n#define EXC_AFOPER_LESSEQUAL 0x03\n#define EXC_AFOPER_GREATER 0x04\n#define EXC_AFOPER_NOTEQUAL 0x05\n#define EXC_AFOPER_GREATEREQUAL 0x06\n\n\/\/ (0x00AE, 0x00AF) SCENARIO, SCENMAN =========================================\n\n#define EXC_SCEN_MAXCELL 32\n\n\/\/ (0x00E5) CELLMERGING =======================================================\n\n#define EXC_MERGE_MAXCOUNT 1024\n\n\/\/ (0x0208) ROW ===============================================================\n\n\/\/ flags\n#define EXC_ROW_COLLAPSED 0x0010\n#define EXC_ROW_ZEROHEIGHT 0x0020\n#define EXC_ROW_UNSYNCED 0x0040\n#define EXC_ROW_GHOSTDIRTY 0x0080\n#define EXC_ROW_XFMASK 0x0FFF\n\n\/\/ outline\n#define EXC_ROW_LEVELFLAGS(nOL) (nOL & 0x0007)\n#define EXC_ROW_GETLEVEL(nFlag) (nFlag & 0x0007)\n\n\/\/ unknown, always save\n#define EXC_ROW_FLAGCOMMON 0x0100\n\n\/\/ row height\n#define EXC_ROW_VALZEROHEIGHT 0x00FF\n#define EXC_ROW_FLAGDEFHEIGHT 0x8000\n\n\/\/ (0x0236) TABLE =============================================================\n\n#define EXC_TABOP_CALCULATE 0x0003\n#define EXC_TABOP_ROW 0x0004\n#define EXC_TABOP_BOTH 0x0008\n\n\/\/ (0x023E) WINDOW2 ===========================================================\n\n#define EXC_WIN2_SHOWFORMULAS 0x0001\n#define EXC_WIN2_SHOWGRID 0x0002\n#define EXC_WIN2_SHOWHEADINGS 0x0004\n#define EXC_WIN2_FROZEN 0x0008\n#define EXC_WIN2_SHOWZEROS 0x0010\n#define EXC_WIN2_DEFAULTCOLOR 0x0020\nconst sal_uInt16 EXC_WIN2_MIRRORED = 0x0040;\n#define EXC_WIN2_OUTLINE 0x0080\n#define EXC_WIN2_FROZENNOSPLIT 0x0100\n#define EXC_WIN2_SELECTED 0x0200\n#define EXC_WIN2_DISPLAYED 0x0400\n\n\/\/ Specials for outlines ======================================================\n\n#define EXC_OUTLINE_MAX 7\n#define EXC_OUTLINE_COUNT (EXC_OUTLINE_MAX + 1)\n\n\/\/ defines for change tracking ================================================\n\n\/\/ opcodes\n#define EXC_CHTR_OP_COLFLAG 0x0001\n#define EXC_CHTR_OP_DELFLAG 0x0002\n#define EXC_CHTR_OP_INSROW 0x0000\n#define EXC_CHTR_OP_INSCOL EXC_CHTR_OP_COLFLAG\n#define EXC_CHTR_OP_DELROW EXC_CHTR_OP_DELFLAG\n#define EXC_CHTR_OP_DELCOL (EXC_CHTR_OP_COLFLAG|EXC_CHTR_OP_DELFLAG)\n#define EXC_CHTR_OP_MOVE 0x0004\n#define EXC_CHTR_OP_INSTAB 0x0005\n#define EXC_CHTR_OP_CELL 0x0008\n#define EXC_CHTR_OP_RENAME 0x0009\n#define EXC_CHTR_OP_NAME 0x000A\n#define EXC_CHTR_OP_FORMAT 0x000B\n#define EXC_CHTR_OP_UNKNOWN 0xFFFF\n\n\/\/ data types\n#define EXC_CHTR_TYPE_MASK 0x0007\n#define EXC_CHTR_TYPE_FORMATMASK 0xFF00\n#define EXC_CHTR_TYPE_EMPTY 0x0000\n#define EXC_CHTR_TYPE_RK 0x0001\n#define EXC_CHTR_TYPE_DOUBLE 0x0002\n#define EXC_CHTR_TYPE_STRING 0x0003\n#define EXC_CHTR_TYPE_BOOL 0x0004\n#define EXC_CHTR_TYPE_FORMULA 0x0005\n\n\/\/ accept flags\n#define EXC_CHTR_NOTHING 0x0000\n#define EXC_CHTR_ACCEPT 0x0001\n#define EXC_CHTR_REJECT 0x0003\n\n\/\/ ============================================================================\n\n#endif \/\/ _EXCDEFS_HXX\n\n<commit_msg>INTEGRATION: CWS encryption (1.41.6); FILE MERGED 2004\/07\/14 10:23:50 dr 1.41.6.2: RESYNC: (1.41-1.43); FILE MERGED 2004\/03\/25 13:15:18 dr 1.41.6.1: #115980# storage\/stream handling reworked<commit_after>\/*************************************************************************\n *\n * $RCSfile: excdefs.hxx,v $\n *\n * $Revision: 1.44 $\n *\n * last change: $Author: obo $ $Date: 2004-08-11 09:04:12 $\n *\n * The Contents of this file are made available subject to the terms of\n * either of the following licenses\n *\n * - GNU Lesser General Public License Version 2.1\n * - Sun Industry Standards Source License Version 1.1\n *\n * Sun Microsystems Inc., October, 2000\n *\n * GNU Lesser General Public License Version 2.1\n * =============================================\n * Copyright 2000 by Sun Microsystems, Inc.\n * 901 San Antonio Road, Palo Alto, CA 94303, USA\n *\n * This library is free software; you can redistribute it and\/or\n * modify it under the terms of the GNU Lesser General Public\n * License version 2.1, as published by the Free Software Foundation.\n *\n * This library is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU\n * Lesser General Public License for more details.\n *\n * You should have received a copy of the GNU Lesser General Public\n * License along with this library; if not, write to the Free Software\n * Foundation, Inc., 59 Temple Place, Suite 330, Boston,\n * MA 02111-1307 USA\n *\n *\n * Sun Industry Standards Source License Version 1.1\n * =================================================\n * The contents of this file are subject to the Sun Industry Standards\n * Source License Version 1.1 (the \"License\"); You may not use this file\n * except in compliance with the License. You may obtain a copy of the\n * License at http:\/\/www.openoffice.org\/license.html.\n *\n * Software provided under this License is provided on an \"AS IS\" basis,\n * WITHOUT WARRANTY OF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING,\n * WITHOUT LIMITATION, WARRANTIES THAT THE SOFTWARE IS FREE OF DEFECTS,\n * MERCHANTABLE, FIT FOR A PARTICULAR PURPOSE, OR NON-INFRINGING.\n * See the License for the specific provisions governing your rights and\n * obligations concerning the Software.\n *\n * The Initial Developer of the Original Code is: Sun Microsystems, Inc.\n *\n * Copyright: 2000 by Sun Microsystems, Inc.\n *\n * All Rights Reserved.\n *\n * Contributor(s): _______________________________________\n *\n *\n ************************************************************************\/\n\n#ifndef _EXCDEFS_HXX\n#define _EXCDEFS_HXX\n\n#ifndef _SAL_TYPES_H_\n#include <sal\/types.h>\n#endif\n\n\/\/ (0x001C) NOTE ==============================================================\n\n#define EXC_NOTE5_MAXTEXT 2048\n\n\/\/ (0x0031) FONT ==============================================================\n\n\/\/ color\n#define EXC_FONTCOL_IGNORE 0x7FFF\n\n\/\/ height\n#define EXC_FONTHGHT_COEFF 20.0\n\n\/\/ (0x0092) PALETTE ===========================================================\n\n\/\/ special color indices\n#define EXC_COLIND_AUTOTEXT 77\n#define EXC_COLIND_AUTOLINE 77\n#define EXC_COLIND_AUTOFILLBG 77\n#define EXC_COLIND_AUTOFILLFG 78\n\n\/\/ (0x009B, 0x009D, 0x009E) AUTOFILTER ========================================\n\n\/\/ flags\n#define EXC_AFFLAG_AND 0x0000\n#define EXC_AFFLAG_OR 0x0001\n#define EXC_AFFLAG_ANDORMASK 0x0003\n#define EXC_AFFLAG_SIMPLE1 0x0004\n#define EXC_AFFLAG_SIMPLE2 0x0008\n#define EXC_AFFLAG_TOP10 0x0010\n#define EXC_AFFLAG_TOP10TOP 0x0020\n#define EXC_AFFLAG_TOP10PERC 0x0040\n\n\/\/ data types\n#define EXC_AFTYPE_NOTUSED 0x00\n#define EXC_AFTYPE_RK 0x02\n#define EXC_AFTYPE_DOUBLE 0x04\n#define EXC_AFTYPE_STRING 0x06\n#define EXC_AFTYPE_BOOLERR 0x08\n#define EXC_AFTYPE_INVALID 0x0A\n#define EXC_AFTYPE_EMPTY 0x0C\n#define EXC_AFTYPE_NOTEMPTY 0x0E\n\n\/\/ comparison operands\n#define EXC_AFOPER_NONE 0x00\n#define EXC_AFOPER_LESS 0x01\n#define EXC_AFOPER_EQUAL 0x02\n#define EXC_AFOPER_LESSEQUAL 0x03\n#define EXC_AFOPER_GREATER 0x04\n#define EXC_AFOPER_NOTEQUAL 0x05\n#define EXC_AFOPER_GREATEREQUAL 0x06\n\n\/\/ (0x00AE, 0x00AF) SCENARIO, SCENMAN =========================================\n\n#define EXC_SCEN_MAXCELL 32\n\n\/\/ (0x00E5) CELLMERGING =======================================================\n\n#define EXC_MERGE_MAXCOUNT 1024\n\n\/\/ (0x0208) ROW ===============================================================\n\n\/\/ flags\n#define EXC_ROW_COLLAPSED 0x0010\n#define EXC_ROW_ZEROHEIGHT 0x0020\n#define EXC_ROW_UNSYNCED 0x0040\n#define EXC_ROW_GHOSTDIRTY 0x0080\n#define EXC_ROW_XFMASK 0x0FFF\n\n\/\/ outline\n#define EXC_ROW_LEVELFLAGS(nOL) (nOL & 0x0007)\n#define EXC_ROW_GETLEVEL(nFlag) (nFlag & 0x0007)\n\n\/\/ unknown, always save\n#define EXC_ROW_FLAGCOMMON 0x0100\n\n\/\/ row height\n#define EXC_ROW_VALZEROHEIGHT 0x00FF\n#define EXC_ROW_FLAGDEFHEIGHT 0x8000\n\n\/\/ (0x0236) TABLE =============================================================\n\n#define EXC_TABOP_CALCULATE 0x0003\n#define EXC_TABOP_ROW 0x0004\n#define EXC_TABOP_BOTH 0x0008\n\n\/\/ (0x023E) WINDOW2 ===========================================================\n\n#define EXC_WIN2_SHOWFORMULAS 0x0001\n#define EXC_WIN2_SHOWGRID 0x0002\n#define EXC_WIN2_SHOWHEADINGS 0x0004\n#define EXC_WIN2_FROZEN 0x0008\n#define EXC_WIN2_SHOWZEROS 0x0010\n#define EXC_WIN2_DEFAULTCOLOR 0x0020\nconst sal_uInt16 EXC_WIN2_MIRRORED = 0x0040;\n#define EXC_WIN2_OUTLINE 0x0080\n#define EXC_WIN2_FROZENNOSPLIT 0x0100\n#define EXC_WIN2_SELECTED 0x0200\n#define EXC_WIN2_DISPLAYED 0x0400\n\n\/\/ Specials for outlines ======================================================\n\n#define EXC_OUTLINE_MAX 7\n#define EXC_OUTLINE_COUNT (EXC_OUTLINE_MAX + 1)\n\n\/\/ defines for change tracking ================================================\n\n#define EXC_STREAM_USERNAMES CREATE_STRING( \"User Names\" )\n#define EXC_STREAM_REVLOG CREATE_STRING( \"Revision Log\" )\n\n\/\/ opcodes\n#define EXC_CHTR_OP_COLFLAG 0x0001\n#define EXC_CHTR_OP_DELFLAG 0x0002\n#define EXC_CHTR_OP_INSROW 0x0000\n#define EXC_CHTR_OP_INSCOL EXC_CHTR_OP_COLFLAG\n#define EXC_CHTR_OP_DELROW EXC_CHTR_OP_DELFLAG\n#define EXC_CHTR_OP_DELCOL (EXC_CHTR_OP_COLFLAG|EXC_CHTR_OP_DELFLAG)\n#define EXC_CHTR_OP_MOVE 0x0004\n#define EXC_CHTR_OP_INSTAB 0x0005\n#define EXC_CHTR_OP_CELL 0x0008\n#define EXC_CHTR_OP_RENAME 0x0009\n#define EXC_CHTR_OP_NAME 0x000A\n#define EXC_CHTR_OP_FORMAT 0x000B\n#define EXC_CHTR_OP_UNKNOWN 0xFFFF\n\n\/\/ data types\n#define EXC_CHTR_TYPE_MASK 0x0007\n#define EXC_CHTR_TYPE_FORMATMASK 0xFF00\n#define EXC_CHTR_TYPE_EMPTY 0x0000\n#define EXC_CHTR_TYPE_RK 0x0001\n#define EXC_CHTR_TYPE_DOUBLE 0x0002\n#define EXC_CHTR_TYPE_STRING 0x0003\n#define EXC_CHTR_TYPE_BOOL 0x0004\n#define EXC_CHTR_TYPE_FORMULA 0x0005\n\n\/\/ accept flags\n#define EXC_CHTR_NOTHING 0x0000\n#define EXC_CHTR_ACCEPT 0x0001\n#define EXC_CHTR_REJECT 0x0003\n\n\/\/ ============================================================================\n\n#endif \/\/ _EXCDEFS_HXX\n\n<|endoftext|>"} {"text":"<commit_before>\/*************************************************************************\n *\n * OpenOffice.org - a multi-platform office productivity suite\n *\n * $RCSfile: excform.hxx,v $\n *\n * $Revision: 1.15 $\n *\n * last change: $Author: hr $ $Date: 2005-09-28 11:56: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#ifndef _EXCFORM_HXX\n#define _EXCFORM_HXX\n\n#ifndef SC_XLFORMULA_HXX\n#include \"xlformula.hxx\"\n#endif\n#ifndef SC_XIROOT_HXX\n#include \"xiroot.hxx\"\n#endif\n\n#ifndef _FORMEL_HXX\n#include \"formel.hxx\"\n#endif\n\n\nclass ScRangeList;\n\n\nclass ExcelToSc : public ExcelConverterBase, protected XclImpRoot\n{\nprotected:\n BOOL bExternName; \/\/ wenn External Name gefunden wurde\n static const UINT16 nRowMask;\n static const UINT16 nLastInd; \/\/ letzter Index fuer Excel->SC-\n \/\/ Token Umsetzung\n XclFunctionProvider maFuncProv;\n const XclBiff meBiff;\n\n \/\/ ---------------------------------------------------------------\n void DoMulArgs( DefTokenId, BYTE );\n\n void ExcRelToScRel( UINT16 nRow, UINT8 nCol, SingleRefData&, const BOOL bName );\n\n void PushRangeOperator();\n\npublic:\n ExcelToSc( XclImpStream& rStrm );\n virtual ~ExcelToSc();\n virtual ConvErr Convert( const ScTokenArray*&, UINT32 nFormulaLen, const FORMULA_TYPE eFT = FT_CellFormula );\n\n virtual ConvErr Convert( _ScRangeListTabs&, UINT32 nFormulaLen, const FORMULA_TYPE eFT = FT_CellFormula );\n virtual BOOL GetAbsRefs( ScRangeList& rRangeList, UINT32 nLen );\n\n void GetDummy( const ScTokenArray*& );\n const ScTokenArray* GetBoolErr( XclBoolError );\n BOOL GetShrFmla( const ScTokenArray*&, UINT32 nFormulaLen );\n\n static BOOL SetCurVal( ScFormulaCell& rCell, double& rCurVal );\n \/\/ return = TRUE -> String-Record folgt!\n static void SetError( ScFormulaCell& rCell, const ConvErr eErr );\n\n static inline BOOL IsComplColRange( const UINT16 nCol1, const UINT16 nCol2 );\n static inline BOOL IsComplRowRange( const UINT16 nRow1, const UINT16 nRow2 );\n\n void SetComplCol( ComplRefData& );\n void SetComplRow( ComplRefData& );\n};\n\n\ninline BOOL ExcelToSc::IsComplColRange( const UINT16 nCol1, const UINT16 nCol2 )\n{\n return ( nCol1 == 0x00 ) && ( nCol2 == 0xFF );\n}\n\n\ninline BOOL ExcelToSc::IsComplRowRange( const UINT16 nRow1, const UINT16 nRow2 )\n{\n return ( ( nRow1 & 0x3FFF ) == 0x0000 ) && ( ( nRow2 & 0x3FFF ) == 0x3FFF );\n}\n\n\nclass XclImpLinkManager;\n\nclass ExcelToSc8 : public ExcelToSc\n{\nprivate:\n const XclImpLinkManager& rLinkMan;\n\n void ExcRelToScRel( UINT16 nRow, UINT16 nCol, SingleRefData&,\n const BOOL bName );\n\n \/\/ this function must read 2 bytes from stream and adjust <nBytesLeft>\n virtual BOOL Read3DTabReference( SCTAB& rFirstTab, SCTAB& rLastTab );\n\npublic:\n ExcelToSc8( XclImpStream& rStrm );\n virtual ~ExcelToSc8();\n\n virtual ConvErr Convert( const ScTokenArray*& rpTokArray, UINT32 nFormulaLen, const FORMULA_TYPE eFT = FT_CellFormula );\n\n virtual ConvErr Convert( _ScRangeListTabs&, UINT32 nFormulaLen, const FORMULA_TYPE eFT = FT_CellFormula );\n\n static inline BOOL IsComplRowRange( const UINT16 nRow1, const UINT16 nRow2 );\n\n virtual BOOL GetAbsRefs( ScRangeList& rRangeList, UINT32 nLen );\n};\n\n\ninline BOOL ExcelToSc8::IsComplRowRange( const UINT16 nRow1, const UINT16 nRow2 )\n{\n return ( nRow1 == 0x0000 ) && ( nRow2 == 0xFFFF );\n}\n\n\n\n\n\n#endif\n<commit_msg>INTEGRATION: CWS dr48 (1.15.166); FILE MERGED 2006\/05\/22 16:34:27 dr 1.15.166.2: type correctness for stream related code in Excel filters (sal_Size vs. ULONG vs. sal_uInt32) 2006\/05\/10 17:01:21 dr 1.15.166.1: #i63105# backport changes from CWS chart2mst3<commit_after>\/*************************************************************************\n *\n * OpenOffice.org - a multi-platform office productivity suite\n *\n * $RCSfile: excform.hxx,v $\n *\n * $Revision: 1.16 $\n *\n * last change: $Author: obo $ $Date: 2006-07-10 13:50: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#ifndef _EXCFORM_HXX\n#define _EXCFORM_HXX\n\n#ifndef SC_XLFORMULA_HXX\n#include \"xlformula.hxx\"\n#endif\n#ifndef SC_XIROOT_HXX\n#include \"xiroot.hxx\"\n#endif\n\n#ifndef _FORMEL_HXX\n#include \"formel.hxx\"\n#endif\n\n\nclass ScRangeList;\n\n\nclass ExcelToSc : public ExcelConverterBase, protected XclImpRoot\n{\nprotected:\n BOOL bExternName; \/\/ wenn External Name gefunden wurde\n static const UINT16 nRowMask;\n static const UINT16 nLastInd; \/\/ letzter Index fuer Excel->SC-\n \/\/ Token Umsetzung\n XclFunctionProvider maFuncProv;\n const XclBiff meBiff;\n\n \/\/ ---------------------------------------------------------------\n void DoMulArgs( DefTokenId, BYTE );\n\n void ExcRelToScRel( UINT16 nRow, UINT8 nCol, SingleRefData&, const BOOL bName );\n\n void PushRangeOperator();\n\npublic:\n ExcelToSc( const XclImpRoot& rRoot );\n virtual ~ExcelToSc();\n virtual ConvErr Convert( const ScTokenArray*&, XclImpStream& rStrm, sal_Size nFormulaLen, const FORMULA_TYPE eFT = FT_CellFormula );\n\n virtual ConvErr Convert( _ScRangeListTabs&, XclImpStream& rStrm, sal_Size nFormulaLen, const FORMULA_TYPE eFT = FT_CellFormula );\n virtual BOOL GetAbsRefs( ScRangeList& rRangeList, XclImpStream& rStrm, sal_Size nLen );\n\n void GetDummy( const ScTokenArray*& );\n const ScTokenArray* GetBoolErr( XclBoolError );\n BOOL GetShrFmla( const ScTokenArray*&, XclImpStream& rStrm, sal_Size nFormulaLen );\n\n static BOOL SetCurVal( ScFormulaCell& rCell, double& rCurVal );\n \/\/ return = TRUE -> String-Record folgt!\n static void SetError( ScFormulaCell& rCell, const ConvErr eErr );\n\n static inline BOOL IsComplColRange( const UINT16 nCol1, const UINT16 nCol2 );\n static inline BOOL IsComplRowRange( const UINT16 nRow1, const UINT16 nRow2 );\n\n void SetComplCol( ComplRefData& );\n void SetComplRow( ComplRefData& );\n};\n\n\ninline BOOL ExcelToSc::IsComplColRange( const UINT16 nCol1, const UINT16 nCol2 )\n{\n return ( nCol1 == 0x00 ) && ( nCol2 == 0xFF );\n}\n\n\ninline BOOL ExcelToSc::IsComplRowRange( const UINT16 nRow1, const UINT16 nRow2 )\n{\n return ( ( nRow1 & 0x3FFF ) == 0x0000 ) && ( ( nRow2 & 0x3FFF ) == 0x3FFF );\n}\n\n\nclass XclImpLinkManager;\n\nclass ExcelToSc8 : public ExcelToSc\n{\nprivate:\n const XclImpLinkManager& rLinkMan;\n\n void ExcRelToScRel( UINT16 nRow, UINT16 nCol, SingleRefData&,\n const BOOL bName );\n\n \/\/ this function must read 2 bytes from stream and adjust <nBytesLeft>\n virtual BOOL Read3DTabReference( XclImpStream& rStrm, SCTAB& rFirstTab, SCTAB& rLastTab );\n\npublic:\n ExcelToSc8( const XclImpRoot& rRoot );\n virtual ~ExcelToSc8();\n\n virtual ConvErr Convert( const ScTokenArray*& rpTokArray, XclImpStream& rStrm, sal_Size nFormulaLen, const FORMULA_TYPE eFT = FT_CellFormula );\n\n virtual ConvErr Convert( _ScRangeListTabs&, XclImpStream& rStrm, sal_Size nFormulaLen, const FORMULA_TYPE eFT = FT_CellFormula );\n\n static inline BOOL IsComplRowRange( const UINT16 nRow1, const UINT16 nRow2 );\n\n virtual BOOL GetAbsRefs( ScRangeList& rRangeList, XclImpStream& rStrm, sal_Size nLen );\n};\n\n\ninline BOOL ExcelToSc8::IsComplRowRange( const UINT16 nRow1, const UINT16 nRow2 )\n{\n return ( nRow1 == 0x0000 ) && ( nRow2 == 0xFFFF );\n}\n\n\n\n\n\n#endif\n<|endoftext|>"} {"text":"<commit_before>\/*************************************************************************\n *\n * $RCSfile: lotattr.hxx,v $\n *\n * $Revision: 1.2 $\n *\n * last change: $Author: rt $ $Date: 2003-12-01 17:52:11 $\n *\n * The Contents of this file are made available subject to the terms of\n * either of the following licenses\n *\n * - GNU Lesser General Public License Version 2.1\n * - Sun Industry Standards Source License Version 1.1\n *\n * Sun Microsystems Inc., October, 2000\n *\n * GNU Lesser General Public License Version 2.1\n * =============================================\n * Copyright 2000 by Sun Microsystems, Inc.\n * 901 San Antonio Road, Palo Alto, CA 94303, USA\n *\n * This library is free software; you can redistribute it and\/or\n * modify it under the terms of the GNU Lesser General Public\n * License version 2.1, as published by the Free Software Foundation.\n *\n * This library is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU\n * Lesser General Public License for more details.\n *\n * You should have received a copy of the GNU Lesser General Public\n * License along with this library; if not, write to the Free Software\n * Foundation, Inc., 59 Temple Place, Suite 330, Boston,\n * MA 02111-1307 USA\n *\n *\n * Sun Industry Standards Source License Version 1.1\n * =================================================\n * The contents of this file are subject to the Sun Industry Standards\n * Source License Version 1.1 (the \"License\"); You may not use this file\n * except in compliance with the License. You may obtain a copy of the\n * License at http:\/\/www.openoffice.org\/license.html.\n *\n * Software provided under this License is provided on an \"AS IS\" basis,\n * WITHOUT WARRANTY OF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING,\n * WITHOUT LIMITATION, WARRANTIES THAT THE SOFTWARE IS FREE OF DEFECTS,\n * MERCHANTABLE, FIT FOR A PARTICULAR PURPOSE, OR NON-INFRINGING.\n * See the License for the specific provisions governing your rights and\n * obligations concerning the Software.\n *\n * The Initial Developer of the Original Code is: Sun Microsystems, Inc.\n *\n * Copyright: 2000 by Sun Microsystems, Inc.\n *\n * All Rights Reserved.\n *\n * Contributor(s): _______________________________________\n *\n *\n ************************************************************************\/\n\n#ifndef _LOTATTR_HXX\n#define _LOTATTR_HXX\n\n#include <tools\/solar.h>\n\n#ifndef _LIST_HXX \/\/autogen\n#include <tools\/list.hxx>\n#endif\n\n#include <patattr.hxx>\n#include <scitems.hxx>\n\n\/\/ ----- forwards --------------------------------------------------------\nclass ScDocument;\nclass ScDocumentPool;\nclass SvxBorderLine;\nclass SvxColorItem;\nclass Color;\n\nclass LotAttrTable;\n\n\nstruct LotAttrWK3\n{\n UINT8 nFont;\n UINT8 nLineStyle;\n UINT8 nFontCol;\n UINT8 nBack;\n\n inline BOOL HasStyles( void );\n inline BOOL IsCentered( void );\n};\n\n\ninline BOOL LotAttrWK3::HasStyles( void )\n{\n return ( nFont || nLineStyle || nFontCol || ( nBack & 0x7F ) );\n \/\/ !! ohne Center-Bit!!\n}\n\n\ninline BOOL LotAttrWK3::IsCentered( void )\n{\n return ( nBack & 0x80 );\n}\n\n\nclass LotAttrCache : private List\n{\nprivate:\n friend class LotAttrTable;\n\n struct ENTRY\n {\n ScPatternAttr* pPattAttr;\n UINT32 nHash0;\n\n inline ENTRY( const ScPatternAttr& r ) { pPattAttr = new ScPatternAttr( r ); }\n\n inline ENTRY( ScPatternAttr* p ) { pPattAttr = p; }\n\n inline ~ENTRY() { delete pPattAttr; }\n\n inline BOOL operator ==( const ENTRY& r ) const { return nHash0 == r.nHash0; }\n\n inline BOOL operator ==( const UINT32& r ) const { return nHash0 == r; }\n };\n\n ScDocumentPool* pDocPool;\n SvxColorItem* ppColorItems[ 6 ]; \/\/ 0 und 7 fehlen!\n SvxColorItem* pBlack;\n SvxColorItem* pWhite;\n Color* pColTab;\n\n inline static void MakeHash( const LotAttrWK3& rAttr, UINT32& rOut )\n {\n ( ( UINT8* ) &rOut )[ 0 ] = rAttr.nFont & 0x7F;\n ( ( UINT8* ) &rOut )[ 1 ] = rAttr.nLineStyle;\n ( ( UINT8* ) &rOut )[ 2 ] = rAttr.nFontCol;\n ( ( UINT8* ) &rOut )[ 3 ] = rAttr.nBack;\n }\n static void LotusToScBorderLine( UINT8 nLine, SvxBorderLine& );\n const SvxColorItem& GetColorItem( const UINT8 nLotIndex ) const;\n const Color& GetColor( const UINT8 nLotIndex ) const;\npublic:\n LotAttrCache( void );\n ~LotAttrCache();\n\n const ScPatternAttr& GetPattAttr( const LotAttrWK3& );\n};\n\n\nclass LotAttrCol : private List\n{\nprivate:\n struct ENTRY\n {\n const ScPatternAttr* pPattAttr;\n UINT16 nFirstRow;\n UINT16 nLastRow;\n };\n\npublic:\n ~LotAttrCol( void );\n void SetAttr( const UINT16 nRow, const ScPatternAttr& );\n void Apply( const UINT16 nCol, const UINT16 nTab, const BOOL bClear = TRUE );\n void Clear( void );\n};\n\n\nclass LotAttrTable\n{\nprivate:\n LotAttrCol pCols[ MAXCOL + 1 ];\n LotAttrCache aAttrCache;\npublic:\n LotAttrTable( void );\n ~LotAttrTable();\n\n void SetAttr( const UINT8 nColFirst, const UINT8 nColLast, const UINT16 nRow, const LotAttrWK3& );\n void Apply( const UINT16 nTabNum );\n};\n\n\n\n\n\n#endif\n\n<commit_msg>INTEGRATION: CWS rowlimit (1.1.1.1.346); FILE MERGED 2004\/03\/02 12:00:42 jmarmion 1.1.1.1.346.4: #i1967# step 5 changes. 2004\/01\/19 09:41:14 jmarmion 1.1.1.1.346.3: #i1967# SCCOL,SCROW,SCTAB replace USHORT; SCsCOL,SCsROW,SCsTAB replace short. 2003\/12\/12 12:36:06 er 1.1.1.1.346.2: RESYNC: (1.1.1.1-1.2); FILE MERGED 2003\/11\/28 19:47:52 er 1.1.1.1.346.1: #i1967# move ScAddress, ScRange from global.hxx to address.hxx<commit_after>\/*************************************************************************\n *\n * $RCSfile: lotattr.hxx,v $\n *\n * $Revision: 1.3 $\n *\n * last change: $Author: obo $ $Date: 2004-06-04 10:55:20 $\n *\n * The Contents of this file are made available subject to the terms of\n * either of the following licenses\n *\n * - GNU Lesser General Public License Version 2.1\n * - Sun Industry Standards Source License Version 1.1\n *\n * Sun Microsystems Inc., October, 2000\n *\n * GNU Lesser General Public License Version 2.1\n * =============================================\n * Copyright 2000 by Sun Microsystems, Inc.\n * 901 San Antonio Road, Palo Alto, CA 94303, USA\n *\n * This library is free software; you can redistribute it and\/or\n * modify it under the terms of the GNU Lesser General Public\n * License version 2.1, as published by the Free Software Foundation.\n *\n * This library is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU\n * Lesser General Public License for more details.\n *\n * You should have received a copy of the GNU Lesser General Public\n * License along with this library; if not, write to the Free Software\n * Foundation, Inc., 59 Temple Place, Suite 330, Boston,\n * MA 02111-1307 USA\n *\n *\n * Sun Industry Standards Source License Version 1.1\n * =================================================\n * The contents of this file are subject to the Sun Industry Standards\n * Source License Version 1.1 (the \"License\"); You may not use this file\n * except in compliance with the License. You may obtain a copy of the\n * License at http:\/\/www.openoffice.org\/license.html.\n *\n * Software provided under this License is provided on an \"AS IS\" basis,\n * WITHOUT WARRANTY OF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING,\n * WITHOUT LIMITATION, WARRANTIES THAT THE SOFTWARE IS FREE OF DEFECTS,\n * MERCHANTABLE, FIT FOR A PARTICULAR PURPOSE, OR NON-INFRINGING.\n * See the License for the specific provisions governing your rights and\n * obligations concerning the Software.\n *\n * The Initial Developer of the Original Code is: Sun Microsystems, Inc.\n *\n * Copyright: 2000 by Sun Microsystems, Inc.\n *\n * All Rights Reserved.\n *\n * Contributor(s): _______________________________________\n *\n *\n ************************************************************************\/\n\n#ifndef _LOTATTR_HXX\n#define _LOTATTR_HXX\n\n#include <tools\/solar.h>\n\n#ifndef _LIST_HXX \/\/autogen\n#include <tools\/list.hxx>\n#endif\n\n#ifndef SC_SCPATATR_HXX\n#include \"patattr.hxx\"\n#endif\n#ifndef SC_ITEMS_HXX\n#include \"scitems.hxx\"\n#endif\n\n#ifndef SC_ADDRESS_HXX\n#include \"address.hxx\"\n#endif\n\n\/\/ ----- forwards --------------------------------------------------------\nclass ScDocument;\nclass ScDocumentPool;\nclass SvxBorderLine;\nclass SvxColorItem;\nclass Color;\n\nclass LotAttrTable;\n\n\nstruct LotAttrWK3\n{\n UINT8 nFont;\n UINT8 nLineStyle;\n UINT8 nFontCol;\n UINT8 nBack;\n\n inline BOOL HasStyles( void );\n inline BOOL IsCentered( void );\n};\n\n\ninline BOOL LotAttrWK3::HasStyles( void )\n{\n return ( nFont || nLineStyle || nFontCol || ( nBack & 0x7F ) );\n \/\/ !! ohne Center-Bit!!\n}\n\n\ninline BOOL LotAttrWK3::IsCentered( void )\n{\n return ( nBack & 0x80 );\n}\n\n\nclass LotAttrCache : private List\n{\nprivate:\n friend class LotAttrTable;\n\n struct ENTRY\n {\n ScPatternAttr* pPattAttr;\n UINT32 nHash0;\n\n inline ENTRY( const ScPatternAttr& r ) { pPattAttr = new ScPatternAttr( r ); }\n\n inline ENTRY( ScPatternAttr* p ) { pPattAttr = p; }\n\n inline ~ENTRY() { delete pPattAttr; }\n\n inline BOOL operator ==( const ENTRY& r ) const { return nHash0 == r.nHash0; }\n\n inline BOOL operator ==( const UINT32& r ) const { return nHash0 == r; }\n };\n\n ScDocumentPool* pDocPool;\n SvxColorItem* ppColorItems[ 6 ]; \/\/ 0 und 7 fehlen!\n SvxColorItem* pBlack;\n SvxColorItem* pWhite;\n Color* pColTab;\n\n inline static void MakeHash( const LotAttrWK3& rAttr, UINT32& rOut )\n {\n ( ( UINT8* ) &rOut )[ 0 ] = rAttr.nFont & 0x7F;\n ( ( UINT8* ) &rOut )[ 1 ] = rAttr.nLineStyle;\n ( ( UINT8* ) &rOut )[ 2 ] = rAttr.nFontCol;\n ( ( UINT8* ) &rOut )[ 3 ] = rAttr.nBack;\n }\n static void LotusToScBorderLine( UINT8 nLine, SvxBorderLine& );\n const SvxColorItem& GetColorItem( const UINT8 nLotIndex ) const;\n const Color& GetColor( const UINT8 nLotIndex ) const;\npublic:\n LotAttrCache( void );\n ~LotAttrCache();\n\n const ScPatternAttr& GetPattAttr( const LotAttrWK3& );\n};\n\n\nclass LotAttrCol : private List\n{\nprivate:\n struct ENTRY\n {\n const ScPatternAttr* pPattAttr;\n SCROW nFirstRow;\n SCROW nLastRow;\n };\n\npublic:\n ~LotAttrCol( void );\n void SetAttr( const SCROW nRow, const ScPatternAttr& );\n void Apply( const SCCOL nCol, const SCTAB nTab, const BOOL bClear = TRUE );\n void Clear( void );\n};\n\n\nclass LotAttrTable\n{\nprivate:\n LotAttrCol pCols[ MAXCOLCOUNT ];\n LotAttrCache aAttrCache;\npublic:\n LotAttrTable( void );\n ~LotAttrTable();\n\n void SetAttr( const SCCOL nColFirst, const SCCOL nColLast, const SCROW nRow, const LotAttrWK3& );\n void Apply( const SCTAB nTabNum );\n};\n\n\n\n\n\n#endif\n\n<|endoftext|>"} {"text":"<commit_before>\/*************************************************************************\n *\n * $RCSfile: xlstyle.hxx,v $\n *\n * $Revision: 1.2 $\n *\n * last change: $Author: hr $ $Date: 2003-03-26 18:05:14 $\n *\n * The Contents of this file are made available subject to the terms of\n * either of the following licenses\n *\n * - GNU Lesser General Public License Version 2.1\n * - Sun Industry Standards Source License Version 1.1\n *\n * Sun Microsystems Inc., October, 2000\n *\n * GNU Lesser General Public License Version 2.1\n * =============================================\n * Copyright 2000 by Sun Microsystems, Inc.\n * 901 San Antonio Road, Palo Alto, CA 94303, USA\n *\n * This library is free software; you can redistribute it and\/or\n * modify it under the terms of the GNU Lesser General Public\n * License version 2.1, as published by the Free Software Foundation.\n *\n * This library is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU\n * Lesser General Public License for more details.\n *\n * You should have received a copy of the GNU Lesser General Public\n * License along with this library; if not, write to the Free Software\n * Foundation, Inc., 59 Temple Place, Suite 330, Boston,\n * MA 02111-1307 USA\n *\n *\n * Sun Industry Standards Source License Version 1.1\n * =================================================\n * The contents of this file are subject to the Sun Industry Standards\n * Source License Version 1.1 (the \"License\"); You may not use this file\n * except in compliance with the License. You may obtain a copy of the\n * License at http:\/\/www.openoffice.org\/license.html.\n *\n * Software provided under this License is provided on an \"AS IS\" basis,\n * WITHOUT WARRANTY OF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING,\n * WITHOUT LIMITATION, WARRANTIES THAT THE SOFTWARE IS FREE OF DEFECTS,\n * MERCHANTABLE, FIT FOR A PARTICULAR PURPOSE, OR NON-INFRINGING.\n * See the License for the specific provisions governing your rights and\n * obligations concerning the Software.\n *\n * The Initial Developer of the Original Code is: Sun Microsystems, Inc.\n *\n * Copyright: 2000 by Sun Microsystems, Inc.\n *\n * All Rights Reserved.\n *\n * Contributor(s): _______________________________________\n *\n *\n ************************************************************************\/\n\n\/\/ ============================================================================\n\n#ifndef SC_XLSTYLE_HXX\n#define SC_XLSTYLE_HXX\n\n#ifndef SC_XLTOOLS_HXX\n#include \"xltools.hxx\"\n#endif\n\n\n\/\/ Color data =================================================================\n\n\/** Stores all default colors for a specific BIFF version. *\/\nclass XclDefaultPalette\n{\nprivate:\n const ColorData* mpColorTable; \/\/\/ The table with RGB values.\n sal_uInt32 mnTableSize; \/\/\/ The color table size.\n sal_uInt16 mnIndexOffset; \/\/\/ The Excel index of the first color.\n\npublic:\n explicit XclDefaultPalette( XclBiff eBiff = xlBiffUnknown );\n\n \/** Activates the default colors for the passed BIFF version. *\/\n void SetDefaultColors( XclBiff eBiff );\n\n \/** Returns the color count in the current palette. *\/\n inline sal_uInt32 GetColorCount() const { return mnTableSize; }\n\n \/** Returns the Excel index of the first color. *\/\n inline sal_uInt32 GetIndexOffset() const { return mnIndexOffset; }\n \/** Returns the Excel index of a 0-based color index. *\/\n inline sal_uInt16 GetXclIndex( sal_uInt32 nIndex ) const;\n\n \/** Returns the default RGB color data for a (non-zero-based) Excel color or nDefault on error. *\/\n ColorData GetDefColorData( sal_uInt16 nXclIndex, ColorData nDefault = COL_AUTO ) const;\n \/** Returns the default color for a (non-zero-based) Excel color or nDefault on error. *\/\n inline Color GetDefColor( sal_uInt16 nXclIndex, ColorData nDefault = COL_AUTO ) const;\n};\n\ninline sal_uInt16 XclDefaultPalette::GetXclIndex( sal_uInt32 nIndex ) const\n{\n return static_cast< sal_uInt16 >( nIndex + GetIndexOffset() );\n}\n\ninline Color XclDefaultPalette::GetDefColor( sal_uInt16 nXclIndex, ColorData nDefault ) const\n{\n return Color( GetDefColorData( nXclIndex, nDefault ) );\n}\n\n\n\/\/ Font data ==================================================================\n\n\/** Text underline style. *\/\nenum XclUnderline\n{\n xlUnderlNone = 0x00,\n xlUnderlSingle = 0x01,\n xlUnderlDouble = 0x02,\n xlUnderlSingleAcc = 0x21,\n xlUnderlDoubleAcc = 0x22\n};\n\n\/** Super-\/subscript type. *\/\nenum XclEscapement\n{\n xlEscNone = 0x00,\n xlEscSuper = 0x01,\n xlEscSub = 0x02\n};\n\n\n\/\/ ----------------------------------------------------------------------------\n\n\/** This struct helps reading and writing Excel fonts.\n @descr It stores all Excel compatible properties of a font. In detail this is the\n name, family, character set, height, color, boldness, posture, script, underline,\n strikeout, outline and shadow of the font. *\/\nstruct XclFontData\n{\n String maName; \/\/\/ Font name.\n String maStyle; \/\/\/ String with styles (bold, italic).\n XclUnderline meUnderline; \/\/\/ Underline style.\n XclEscapement meEscapem; \/\/\/ Super-\/subscript.\n sal_uInt16 mnHeight; \/\/\/ Font height in twips (1\/20 of a point).\n sal_uInt16 mnColor; \/\/\/ Index to color palette.\n sal_uInt16 mnWeight; \/\/\/ Boldness: 400=normal, 700=bold.\n sal_uInt8 mnFamily; \/\/\/ Font family.\n sal_uInt8 mnCharSet; \/\/\/ Character set.\n bool mbItalic; \/\/\/ true = Italic.\n bool mbStrikeout; \/\/\/ true = Struck out.\n bool mbOutline; \/\/\/ true = Outlined.\n bool mbShadow; \/\/\/ true = Shadowed.\n\n inline explicit XclFontData() { Clear(); }\n\n \/** Resets all members to default (empty) values. *\/\n void Clear();\n};\n\n\n\/\/ Style (XF) data ============================================================\n\n\/** Horizontal alignment of cell contents. *\/\nenum XclHorAlign\n{\n xlHAlignGeneral = 0x00,\n xlHAlignLeft = 0x01,\n xlHAlignCenter = 0x02,\n xlHAlignRight = 0x03,\n xlHAlignFill = 0x04,\n xlHAlignJustify = 0x05,\n xlHAlignCenterAcrSel = 0x06,\n xlHAlignDistrib = 0x07\n};\n\n\/** Vertical alignment of cell contents. *\/\nenum XclVerAlign\n{\n xlVAlignTop = 0x00,\n xlVAlignCenter = 0x01,\n xlVAlignBottom = 0x02,\n xlVAlignJustify = 0x03,\n xlVAlignDistrib = 0x04\n};\n\n\/** Text orientation. *\/\nenum XclTextOrient\n{\n xlTextOrientNoRot = 0x00,\n xlTextOrientTopBottom = 0x01,\n xlTextOrient90ccw = 0x02,\n xlTextOrient90cw = 0x03,\n xlTextOrientRot = 0x04\n};\n\n\/** CTL text direction. *\/\nenum XclTextDirection\n{\n xlTextDirContext = 0x00,\n xlTextDirLTR = 0x01,\n xlTextDirRTL = 0x02\n};\n\n\n\/\/ Page format ================================================================\n\n\/** The type of a margin value. *\/\nenum XclMarginType\n{\n xlLeftMargin,\n xlRightMargin,\n xlTopMargin,\n xlBottomMargin\n};\n\n\/** Orientation for page breaks. *\/\nenum XclPBOrientation\n{\n xlPBHorizontal,\n xlPBVertical\n};\n\n\n\/\/ ============================================================================\n\n#endif\n\n<commit_msg>INTEGRATION: CWS calc06 (1.1.4.2.10); FILE MERGED 2003\/03\/28 15:29:06 dr 1.1.4.2.10.2: #107688# sort\/reduce XF list on export 2003\/03\/27 16:09:04 dr 1.1.4.2.10.1: #107688# import\/export of cell styles<commit_after>\/*************************************************************************\n *\n * $RCSfile: xlstyle.hxx,v $\n *\n * $Revision: 1.3 $\n *\n * last change: $Author: rt $ $Date: 2003-04-08 16:29:30 $\n *\n * The Contents of this file are made available subject to the terms of\n * either of the following licenses\n *\n * - GNU Lesser General Public License Version 2.1\n * - Sun Industry Standards Source License Version 1.1\n *\n * Sun Microsystems Inc., October, 2000\n *\n * GNU Lesser General Public License Version 2.1\n * =============================================\n * Copyright 2000 by Sun Microsystems, Inc.\n * 901 San Antonio Road, Palo Alto, CA 94303, USA\n *\n * This library is free software; you can redistribute it and\/or\n * modify it under the terms of the GNU Lesser General Public\n * License version 2.1, as published by the Free Software Foundation.\n *\n * This library is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU\n * Lesser General Public License for more details.\n *\n * You should have received a copy of the GNU Lesser General Public\n * License along with this library; if not, write to the Free Software\n * Foundation, Inc., 59 Temple Place, Suite 330, Boston,\n * MA 02111-1307 USA\n *\n *\n * Sun Industry Standards Source License Version 1.1\n * =================================================\n * The contents of this file are subject to the Sun Industry Standards\n * Source License Version 1.1 (the \"License\"); You may not use this file\n * except in compliance with the License. You may obtain a copy of the\n * License at http:\/\/www.openoffice.org\/license.html.\n *\n * Software provided under this License is provided on an \"AS IS\" basis,\n * WITHOUT WARRANTY OF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING,\n * WITHOUT LIMITATION, WARRANTIES THAT THE SOFTWARE IS FREE OF DEFECTS,\n * MERCHANTABLE, FIT FOR A PARTICULAR PURPOSE, OR NON-INFRINGING.\n * See the License for the specific provisions governing your rights and\n * obligations concerning the Software.\n *\n * The Initial Developer of the Original Code is: Sun Microsystems, Inc.\n *\n * Copyright: 2000 by Sun Microsystems, Inc.\n *\n * All Rights Reserved.\n *\n * Contributor(s): _______________________________________\n *\n *\n ************************************************************************\/\n\n\/\/ ============================================================================\n\n#ifndef SC_XLSTYLE_HXX\n#define SC_XLSTYLE_HXX\n\n#ifndef SC_XLTOOLS_HXX\n#include \"xltools.hxx\"\n#endif\n\n\n\/\/ Color data =================================================================\n\n\/** Stores all default colors for a specific BIFF version. *\/\nclass XclDefaultPalette\n{\nprivate:\n const ColorData* mpColorTable; \/\/\/ The table with RGB values.\n sal_uInt32 mnTableSize; \/\/\/ The color table size.\n sal_uInt16 mnIndexOffset; \/\/\/ The Excel index of the first color.\n\npublic:\n explicit XclDefaultPalette( XclBiff eBiff = xlBiffUnknown );\n\n \/** Activates the default colors for the passed BIFF version. *\/\n void SetDefaultColors( XclBiff eBiff );\n\n \/** Returns the color count in the current palette. *\/\n inline sal_uInt32 GetColorCount() const { return mnTableSize; }\n\n \/** Returns the Excel index of the first color. *\/\n inline sal_uInt32 GetIndexOffset() const { return mnIndexOffset; }\n \/** Returns the Excel index of a 0-based color index. *\/\n inline sal_uInt16 GetXclIndex( sal_uInt32 nIndex ) const;\n\n \/** Returns the default RGB color data for a (non-zero-based) Excel color or nDefault on error. *\/\n ColorData GetDefColorData( sal_uInt16 nXclIndex, ColorData nDefault = COL_AUTO ) const;\n \/** Returns the default color for a (non-zero-based) Excel color or nDefault on error. *\/\n inline Color GetDefColor( sal_uInt16 nXclIndex, ColorData nDefault = COL_AUTO ) const;\n};\n\ninline sal_uInt16 XclDefaultPalette::GetXclIndex( sal_uInt32 nIndex ) const\n{\n return static_cast< sal_uInt16 >( nIndex + GetIndexOffset() );\n}\n\ninline Color XclDefaultPalette::GetDefColor( sal_uInt16 nXclIndex, ColorData nDefault ) const\n{\n return Color( GetDefColorData( nXclIndex, nDefault ) );\n}\n\n\n\/\/ Font data ==================================================================\n\n\/** Text underline style. *\/\nenum XclUnderline\n{\n xlUnderlNone = 0x00,\n xlUnderlSingle = 0x01,\n xlUnderlDouble = 0x02,\n xlUnderlSingleAcc = 0x21,\n xlUnderlDoubleAcc = 0x22\n};\n\n\/** Super-\/subscript type. *\/\nenum XclEscapement\n{\n xlEscNone = 0x00,\n xlEscSuper = 0x01,\n xlEscSub = 0x02\n};\n\n\n\/\/ ----------------------------------------------------------------------------\n\n\/** This struct helps reading and writing Excel fonts.\n @descr It stores all Excel compatible properties of a font. In detail this is the\n name, family, character set, height, color, boldness, posture, script, underline,\n strikeout, outline and shadow of the font. *\/\nstruct XclFontData\n{\n String maName; \/\/\/ Font name.\n String maStyle; \/\/\/ String with styles (bold, italic).\n XclUnderline meUnderline; \/\/\/ Underline style.\n XclEscapement meEscapem; \/\/\/ Super-\/subscript.\n sal_uInt16 mnHeight; \/\/\/ Font height in twips (1\/20 of a point).\n sal_uInt16 mnColor; \/\/\/ Index to color palette.\n sal_uInt16 mnWeight; \/\/\/ Boldness: 400=normal, 700=bold.\n sal_uInt8 mnFamily; \/\/\/ Font family.\n sal_uInt8 mnCharSet; \/\/\/ Character set.\n bool mbItalic; \/\/\/ true = Italic.\n bool mbStrikeout; \/\/\/ true = Struck out.\n bool mbOutline; \/\/\/ true = Outlined.\n bool mbShadow; \/\/\/ true = Shadowed.\n\n inline explicit XclFontData() { Clear(); }\n\n \/** Resets all members to default (empty) values. *\/\n void Clear();\n};\n\n\n\/\/ Cell formatting data (XF) ==================================================\n\n\/** Contains all cell protection attributes. *\/\nstruct XclCellProt\n{\n bool mbLocked; \/\/\/ true = Locked against editing.\n bool mbHidden; \/\/\/ true = Formula is hidden.\n\n explicit XclCellProt();\n};\n\nbool operator==( const XclCellProt& rLeft, const XclCellProt& rRight );\n\n\n\/\/ ----------------------------------------------------------------------------\n\n\/** Horizontal alignment of cell contents. *\/\nenum XclHorAlign\n{\n xlHAlignGeneral = 0x00,\n xlHAlignLeft = 0x01,\n xlHAlignCenter = 0x02,\n xlHAlignRight = 0x03,\n xlHAlignFill = 0x04,\n xlHAlignJustify = 0x05,\n xlHAlignCenterAcrSel = 0x06,\n xlHAlignDistrib = 0x07,\n xlHAlign_Default = xlHAlignGeneral\n\n};\n\n\/** Vertical alignment of cell contents. *\/\nenum XclVerAlign\n{\n xlVAlignTop = 0x00,\n xlVAlignCenter = 0x01,\n xlVAlignBottom = 0x02,\n xlVAlignJustify = 0x03,\n xlVAlignDistrib = 0x04,\n xlVAlign_Default = xlVAlignBottom\n};\n\n\/** Text orientation. *\/\nenum XclTextOrient\n{\n xlTextOrientNoRot = 0x00,\n xlTextOrientTopBottom = 0x01,\n xlTextOrient90ccw = 0x02,\n xlTextOrient90cw = 0x03,\n xlTextOrient_Default = xlTextOrientNoRot\n};\n\n\/** CTL text direction. *\/\nenum XclTextDirection\n{\n xlTextDirContext = 0x00,\n xlTextDirLTR = 0x01,\n xlTextDirRTL = 0x02,\n xlTextDir_Default = xlTextDirContext\n};\n\n\/** Contains all cell alignment attributes. *\/\nstruct XclCellAlign\n{\n XclHorAlign meHorAlign; \/\/\/ Horizontal alignment.\n XclVerAlign meVerAlign; \/\/\/ Vertical alignment.\n XclTextDirection meTextDir; \/\/\/ CTL text direction.\n XclTextOrient meOrient; \/\/\/ Text orientation.\n sal_uInt8 mnRotation; \/\/\/ Text rotation angle.\n sal_uInt8 mnIndent; \/\/\/ Indentation.\n bool mbWrapped; \/\/\/ true = Multi-line text.\n\n explicit XclCellAlign();\n};\n\nbool operator==( const XclCellAlign& rLeft, const XclCellAlign& rRight );\n\n\n\/\/ ----------------------------------------------------------------------------\n\n\/** Contains color and line style for each cell border line. *\/\nstruct XclCellBorder\n{\n sal_uInt16 mnLeftColor; \/\/\/ Palette index for left line.\n sal_uInt16 mnRightColor; \/\/\/ Palette index for right line.\n sal_uInt16 mnTopColor; \/\/\/ Palette index for top line.\n sal_uInt16 mnBottomColor; \/\/\/ Palette index for bottom line.\n sal_uInt8 mnLeftLine; \/\/\/ Style of left line.\n sal_uInt8 mnRightLine; \/\/\/ Style of right line.\n sal_uInt8 mnTopLine; \/\/\/ Style of top line.\n sal_uInt8 mnBottomLine; \/\/\/ Style of bottom line.\n\n explicit XclCellBorder();\n};\n\nbool operator==( const XclCellBorder& rLeft, const XclCellBorder& rRight );\n\n\n\/\/ ----------------------------------------------------------------------------\n\n\/** Contains background colors and pattern for a cell. *\/\nstruct XclCellArea\n{\n sal_uInt16 mnForeColor; \/\/\/ Palette index to foreground color.\n sal_uInt16 mnBackColor; \/\/\/ Palette index to background color.\n sal_uInt8 mnPattern; \/\/\/ Fill pattern.\n\n explicit XclCellArea();\n\n \/** Returns true, if the area represents transparent state. *\/\n bool IsTransparent() const;\n};\n\nbool operator==( const XclCellArea& rLeft, const XclCellArea& rRight );\n\n\n\/\/ ----------------------------------------------------------------------------\n\n\/** Contains base members for XF record import\/export.\n @In detail this class stores the XF type (cell\/style), the index to the parent\n style XF and all \"attribute used\" flags, which reflect the state of specific\n attribute groups (true = user has changed the attributes). *\/\nclass XclXFBase\n{\nprotected:\n sal_uInt16 mnParent; \/\/\/ Index to parent style XF.\n bool mbCellXF; \/\/\/ true = cell XF, false = style XF.\n bool mbProtUsed; \/\/\/ true = cell protection used.\n bool mbFontUsed; \/\/\/ true = font index used.\n bool mbFmtUsed; \/\/\/ true = number format used.\n bool mbAlignUsed; \/\/\/ true = alignment used.\n bool mbBorderUsed; \/\/\/ true = border data used.\n bool mbAreaUsed; \/\/\/ true = area data used.\n\npublic:\n explicit XclXFBase( bool bCellXF );\n\n \/** Sets all \"attribute used\" flags to the passed state. *\/\n void SetAllUsedFlags( bool bUsed );\n\n inline bool IsCellXF() const { return mbCellXF; }\n inline bool IsStyleXF() const { return !IsCellXF(); }\n\nprotected:\n \/** Returns true, if this object is equal to the passed. *\/\n bool Equals( const XclXFBase& rCmp ) const;\n};\n\n\n\/\/ Page format ================================================================\n\n\/** The type of a margin value. *\/\nenum XclMarginType\n{\n xlLeftMargin,\n xlRightMargin,\n xlTopMargin,\n xlBottomMargin\n};\n\n\/** Orientation for page breaks. *\/\nenum XclPBOrientation\n{\n xlPBHorizontal,\n xlPBVertical\n};\n\n\n\/\/ ============================================================================\n\n#endif\n\n<|endoftext|>"} {"text":"<commit_before>\/*************************************************************************\n *\n * $RCSfile: expbase.cxx,v $\n *\n * $Revision: 1.4 $\n *\n * last change: $Author: er $ $Date: 2001-08-22 11:22:12 $\n *\n * The Contents of this file are made available subject to the terms of\n * either of the following licenses\n *\n * - GNU Lesser General Public License Version 2.1\n * - Sun Industry Standards Source License Version 1.1\n *\n * Sun Microsystems Inc., October, 2000\n *\n * GNU Lesser General Public License Version 2.1\n * =============================================\n * Copyright 2000 by Sun Microsystems, Inc.\n * 901 San Antonio Road, Palo Alto, CA 94303, USA\n *\n * This library is free software; you can redistribute it and\/or\n * modify it under the terms of the GNU Lesser General Public\n * License version 2.1, as published by the Free Software Foundation.\n *\n * This library is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU\n * Lesser General Public License for more details.\n *\n * You should have received a copy of the GNU Lesser General Public\n * License along with this library; if not, write to the Free Software\n * Foundation, Inc., 59 Temple Place, Suite 330, Boston,\n * MA 02111-1307 USA\n *\n *\n * Sun Industry Standards Source License Version 1.1\n * =================================================\n * The contents of this file are subject to the Sun Industry Standards\n * Source License Version 1.1 (the \"License\"); You may not use this file\n * except in compliance with the License. You may obtain a copy of the\n * License at http:\/\/www.openoffice.org\/license.html.\n *\n * Software provided under this License is provided on an \"AS IS\" basis,\n * WITHOUT WARRANTY OF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING,\n * WITHOUT LIMITATION, WARRANTIES THAT THE SOFTWARE IS FREE OF DEFECTS,\n * MERCHANTABLE, FIT FOR A PARTICULAR PURPOSE, OR NON-INFRINGING.\n * See the License for the specific provisions governing your rights and\n * obligations concerning the Software.\n *\n * The Initial Developer of the Original Code is: Sun Microsystems, Inc.\n *\n * Copyright: 2000 by Sun Microsystems, Inc.\n *\n * All Rights Reserved.\n *\n * Contributor(s): _______________________________________\n *\n *\n ************************************************************************\/\n\n#ifdef PCH\n#include \"filt_pch.hxx\"\n#endif\n\n#pragma hdrstop\n\n\n#include \"expbase.hxx\"\n#include \"document.hxx\"\n#include \"editutil.hxx\"\n\n\n\/\/------------------------------------------------------------------\n\n#if defined(MAC)\nconst sal_Char __FAR_DATA ScExportBase::sNewLine = '\\015';\n#elif defined(UNX)\nconst sal_Char __FAR_DATA ScExportBase::sNewLine = '\\012';\n#else\nconst sal_Char __FAR_DATA ScExportBase::sNewLine[] = \"\\015\\012\";\n#endif\n\n\nScExportBase::ScExportBase( SvStream& rStrmP, ScDocument* pDocP,\n const ScRange& rRangeP )\n :\n rStrm( rStrmP ),\n aRange( rRangeP ),\n pDoc( pDocP ),\n pFormatter( pDocP->GetFormatTable() ),\n pEditEngine( NULL )\n{\n}\n\n\nScExportBase::~ScExportBase()\n{\n delete pEditEngine;\n}\n\n\nBOOL ScExportBase::GetDataArea( USHORT nTab, USHORT& nStartCol,\n USHORT& nStartRow, USHORT& nEndCol, USHORT& nEndRow ) const\n{\n pDoc->GetDataStart( nTab, nStartCol, nStartRow );\n pDoc->GetPrintArea( nTab, nEndCol, nEndRow, TRUE );\n return TrimDataArea( nTab, nStartCol, nStartRow, nEndCol, nEndRow );\n}\n\n\nBOOL ScExportBase::TrimDataArea( USHORT nTab, USHORT& nStartCol,\n USHORT& nStartRow, USHORT& nEndCol, USHORT& nEndRow ) const\n{\n while ( nStartCol <= nEndCol &&\n pDoc->GetColFlags( nStartCol, nTab ) & CR_HIDDEN )\n ++nStartCol;\n while ( nStartCol <= nEndCol &&\n pDoc->GetColFlags( nEndCol, nTab ) & CR_HIDDEN )\n --nEndCol;\n while ( nStartRow <= nEndRow &&\n pDoc->GetRowFlags( nStartRow, nTab ) & CR_HIDDEN )\n ++nStartRow;\n while ( nStartRow <= nEndRow &&\n pDoc->GetRowFlags( nEndRow, nTab ) & CR_HIDDEN )\n --nEndRow;\n return nStartCol <= nEndCol && nStartRow <= nEndRow;\n}\n\n\nBOOL ScExportBase::IsEmptyTable( USHORT nTab ) const\n{\n if ( !pDoc->HasTable( nTab ) || !pDoc->IsVisible( nTab ) )\n return TRUE;\n USHORT nStartCol, nStartRow, nEndCol, nEndRow;\n return !GetDataArea( nTab, nStartCol, nStartRow, nEndCol, nEndRow );\n}\n\n\nScFieldEditEngine& ScExportBase::GetEditEngine() const\n{\n if ( !pEditEngine )\n ((ScExportBase*)this)->pEditEngine = new ScFieldEditEngine( pDoc->GetEditPool() );\n return *pEditEngine;\n}\n\n\n<commit_msg>INTEGRATION: CWS rowlimit (1.4.324); FILE MERGED 2004\/01\/19 10:04:35 jmarmion 1.4.324.1: #i1967# SCCOL,SCROW,SCTAB replace USHORT; SCsCOL,SCsROW,SCsTAB replace short.<commit_after>\/*************************************************************************\n *\n * $RCSfile: expbase.cxx,v $\n *\n * $Revision: 1.5 $\n *\n * last change: $Author: obo $ $Date: 2004-06-04 11:04: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#ifdef PCH\n#include \"filt_pch.hxx\"\n#endif\n\n#pragma hdrstop\n\n\n#include \"expbase.hxx\"\n#include \"document.hxx\"\n#include \"editutil.hxx\"\n\n\n\/\/------------------------------------------------------------------\n\n#if defined(MAC)\nconst sal_Char __FAR_DATA ScExportBase::sNewLine = '\\015';\n#elif defined(UNX)\nconst sal_Char __FAR_DATA ScExportBase::sNewLine = '\\012';\n#else\nconst sal_Char __FAR_DATA ScExportBase::sNewLine[] = \"\\015\\012\";\n#endif\n\n\nScExportBase::ScExportBase( SvStream& rStrmP, ScDocument* pDocP,\n const ScRange& rRangeP )\n :\n rStrm( rStrmP ),\n aRange( rRangeP ),\n pDoc( pDocP ),\n pFormatter( pDocP->GetFormatTable() ),\n pEditEngine( NULL )\n{\n}\n\n\nScExportBase::~ScExportBase()\n{\n delete pEditEngine;\n}\n\n\nBOOL ScExportBase::GetDataArea( SCTAB nTab, SCCOL& nStartCol,\n SCROW& nStartRow, SCCOL& nEndCol, SCROW& nEndRow ) const\n{\n pDoc->GetDataStart( nTab, nStartCol, nStartRow );\n pDoc->GetPrintArea( nTab, nEndCol, nEndRow, TRUE );\n return TrimDataArea( nTab, nStartCol, nStartRow, nEndCol, nEndRow );\n}\n\n\nBOOL ScExportBase::TrimDataArea( SCTAB nTab, SCCOL& nStartCol,\n SCROW& nStartRow, SCCOL& nEndCol, SCROW& nEndRow ) const\n{\n while ( nStartCol <= nEndCol &&\n pDoc->GetColFlags( nStartCol, nTab ) & CR_HIDDEN )\n ++nStartCol;\n while ( nStartCol <= nEndCol &&\n pDoc->GetColFlags( nEndCol, nTab ) & CR_HIDDEN )\n --nEndCol;\n while ( nStartRow <= nEndRow &&\n pDoc->GetRowFlags( nStartRow, nTab ) & CR_HIDDEN )\n ++nStartRow;\n while ( nStartRow <= nEndRow &&\n pDoc->GetRowFlags( nEndRow, nTab ) & CR_HIDDEN )\n --nEndRow;\n return nStartCol <= nEndCol && nStartRow <= nEndRow;\n}\n\n\nBOOL ScExportBase::IsEmptyTable( SCTAB nTab ) const\n{\n if ( !pDoc->HasTable( nTab ) || !pDoc->IsVisible( nTab ) )\n return TRUE;\n SCCOL nStartCol, nEndCol;\n SCROW nStartRow, nEndRow;\n return !GetDataArea( nTab, nStartCol, nStartRow, nEndCol, nEndRow );\n}\n\n\nScFieldEditEngine& ScExportBase::GetEditEngine() const\n{\n if ( !pEditEngine )\n ((ScExportBase*)this)->pEditEngine = new ScFieldEditEngine( pDoc->GetEditPool() );\n return *pEditEngine;\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\/\/ MARKER(update_precomp.py): autogen include statement, do not remove\n#include \"precompiled_sc.hxx\"\n\n#undef SC_DLLIMPLEMENTATION\n\n\n\n#include \"scitems.hxx\"\n\n#include <sfx2\/objsh.hxx>\n#include <sfx2\/tabdlg.hxx>\n#include <svl\/cjkoptions.hxx>\n\n#include \"tabpages.hxx\"\n#include \"attrdlg.hxx\"\n#include \"scresid.hxx\"\n#include \"attrdlg.hrc\"\n#include <svx\/svxdlg.hxx>\n#include <svx\/dialogs.hrc>\n#include <svx\/flagsdef.hxx>\n#include <editeng\/flstitem.hxx>\n#include <sfx2\/app.hxx>\n\n#if !LAYOUT_SFX_TABDIALOG_BROKEN\n#include <layout\/layout-pre.hxx>\n#endif\n\n\/\/==================================================================\n\nScAttrDlg::ScAttrDlg( SfxViewFrame* pFrameP,\n Window* pParent,\n const SfxItemSet* pCellAttrs )\n\n : SfxTabDialog( pFrameP,\n pParent,\n ScResId( RID_SCDLG_ATTR ),\n pCellAttrs )\n{\n SvtCJKOptions aCJKOptions;\n SfxAbstractDialogFactory* pFact = SfxAbstractDialogFactory::Create();\n DBG_ASSERT(pFact, \"Dialogdiet fail!\");\n\n DBG_ASSERT(pFact->GetTabPageCreatorFunc( RID_SVXPAGE_NUMBERFORMAT ), \"GetTabPageCreatorFunc fail!\");\n#if LAYOUT_SFX_TABDIALOG_BROKEN\n AddTabPage( TP_NUMBER, pFact->GetTabPageCreatorFunc( RID_SVXPAGE_NUMBERFORMAT ), 0 );\n#else\n String number = rtl::OUString::createFromAscii (\"Numbers\");\n AddTabPage( TP_NUMBER, number, pFact->GetTabPageCreatorFunc (RID_SVXPAGE_NUMBERFORMAT), 0, FALSE, TAB_APPEND);\n#endif\n DBG_ASSERT(pFact->GetTabPageCreatorFunc( RID_SVXPAGE_CHAR_NAME ), \"GetTabPageCreatorFunc fail!\");\n AddTabPage( TP_FONT, pFact->GetTabPageCreatorFunc( RID_SVXPAGE_CHAR_NAME ), 0 );\n DBG_ASSERT(pFact->GetTabPageCreatorFunc( RID_SVXPAGE_CHAR_EFFECTS ), \"GetTabPageCreatorFunc fail!\");\n AddTabPage( TP_FONTEFF, pFact->GetTabPageCreatorFunc( RID_SVXPAGE_CHAR_EFFECTS ), 0 );\n DBG_ASSERT(pFact->GetTabPageCreatorFunc( RID_SVXPAGE_ALIGNMENT ), \"GetTabPageCreatorFunc fail!\");\n AddTabPage( TP_ALIGNMENT, pFact->GetTabPageCreatorFunc( RID_SVXPAGE_ALIGNMENT ), 0 );\n\n if ( aCJKOptions.IsAsianTypographyEnabled() )\n {\n DBG_ASSERT(pFact->GetTabPageCreatorFunc(RID_SVXPAGE_PARA_ASIAN), \"GetTabPageCreatorFunc fail!\");\n AddTabPage( TP_ASIAN, pFact->GetTabPageCreatorFunc(RID_SVXPAGE_PARA_ASIAN), 0 );\n }\n else\n RemoveTabPage( TP_ASIAN );\n DBG_ASSERT(pFact->GetTabPageCreatorFunc( RID_SVXPAGE_BORDER ), \"GetTabPageCreatorFunc fail!\");\n AddTabPage( TP_BORDER, pFact->GetTabPageCreatorFunc( RID_SVXPAGE_BORDER ), 0 );\n DBG_ASSERT(pFact->GetTabPageCreatorFunc( RID_SVXPAGE_BACKGROUND ), \"GetTabPageCreatorFunc fail!\");\n AddTabPage( TP_BACKGROUND, pFact->GetTabPageCreatorFunc( RID_SVXPAGE_BACKGROUND ), 0 );\n AddTabPage( TP_PROTECTION, ScTabPageProtection::Create, 0 );\n FreeResource();\n}\n\n\/\/ -----------------------------------------------------------------------\n\n__EXPORT ScAttrDlg::~ScAttrDlg()\n{\n}\n\n\/\/ -----------------------------------------------------------------------\n\nvoid __EXPORT ScAttrDlg::PageCreated( USHORT nPageId, SfxTabPage& rTabPage )\n{\n SfxObjectShell* pDocSh = SfxObjectShell::Current();\n SfxAllItemSet aSet(*(GetInputSetImpl()->GetPool()));\n switch ( nPageId )\n {\n case TP_NUMBER:\n {\n aSet.Put (SfxLinkItem( SID_LINK_TYPE, LINK( this, ScAttrDlg, OkHandler )));\n rTabPage.PageCreated(aSet);\n }\n break;\n\n case TP_FONT:\n {\n const SfxPoolItem* pInfoItem = pDocSh->GetItem( SID_ATTR_CHAR_FONTLIST );\n\n DBG_ASSERT( pInfoItem, \"FontListItem not found :-(\" );\n\n aSet.Put (SvxFontListItem(((const SvxFontListItem*)pInfoItem)->GetFontList(), SID_ATTR_CHAR_FONTLIST ));\n rTabPage.PageCreated(aSet);\n }\n break;\n\n default:\n break;\n }\n}\n\n\/\/ -----------------------------------------------------------------------\n\nIMPL_LINK( ScAttrDlg, OkHandler, void*, EMPTYARG )\n{\n ((Link&)GetOKButton().GetClickHdl()).Call( NULL );\n\n return 0;\n}\n\n\n\/* vim:set shiftwidth=4 softtabstop=4 expandtab: *\/\n<commit_msg>use RTL_CONSTASCII_USTRING_PARAM<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_sc.hxx\"\n\n#undef SC_DLLIMPLEMENTATION\n\n\n\n#include \"scitems.hxx\"\n\n#include <sfx2\/objsh.hxx>\n#include <sfx2\/tabdlg.hxx>\n#include <svl\/cjkoptions.hxx>\n\n#include \"tabpages.hxx\"\n#include \"attrdlg.hxx\"\n#include \"scresid.hxx\"\n#include \"attrdlg.hrc\"\n#include <svx\/svxdlg.hxx>\n#include <svx\/dialogs.hrc>\n#include <svx\/flagsdef.hxx>\n#include <editeng\/flstitem.hxx>\n#include <sfx2\/app.hxx>\n\n#if !LAYOUT_SFX_TABDIALOG_BROKEN\n#include <layout\/layout-pre.hxx>\n#endif\n\n\/\/==================================================================\n\nScAttrDlg::ScAttrDlg( SfxViewFrame* pFrameP,\n Window* pParent,\n const SfxItemSet* pCellAttrs )\n\n : SfxTabDialog( pFrameP,\n pParent,\n ScResId( RID_SCDLG_ATTR ),\n pCellAttrs )\n{\n SvtCJKOptions aCJKOptions;\n SfxAbstractDialogFactory* pFact = SfxAbstractDialogFactory::Create();\n DBG_ASSERT(pFact, \"Dialogdiet fail!\");\n\n DBG_ASSERT(pFact->GetTabPageCreatorFunc( RID_SVXPAGE_NUMBERFORMAT ), \"GetTabPageCreatorFunc fail!\");\n#if LAYOUT_SFX_TABDIALOG_BROKEN\n AddTabPage( TP_NUMBER, pFact->GetTabPageCreatorFunc( RID_SVXPAGE_NUMBERFORMAT ), 0 );\n#else\n String number(RTL_CONSTASCII_USTRINGPARAM(\"Numbers\"));\n AddTabPage( TP_NUMBER, number, pFact->GetTabPageCreatorFunc (RID_SVXPAGE_NUMBERFORMAT), 0, FALSE, TAB_APPEND);\n#endif\n DBG_ASSERT(pFact->GetTabPageCreatorFunc( RID_SVXPAGE_CHAR_NAME ), \"GetTabPageCreatorFunc fail!\");\n AddTabPage( TP_FONT, pFact->GetTabPageCreatorFunc( RID_SVXPAGE_CHAR_NAME ), 0 );\n DBG_ASSERT(pFact->GetTabPageCreatorFunc( RID_SVXPAGE_CHAR_EFFECTS ), \"GetTabPageCreatorFunc fail!\");\n AddTabPage( TP_FONTEFF, pFact->GetTabPageCreatorFunc( RID_SVXPAGE_CHAR_EFFECTS ), 0 );\n DBG_ASSERT(pFact->GetTabPageCreatorFunc( RID_SVXPAGE_ALIGNMENT ), \"GetTabPageCreatorFunc fail!\");\n AddTabPage( TP_ALIGNMENT, pFact->GetTabPageCreatorFunc( RID_SVXPAGE_ALIGNMENT ), 0 );\n\n if ( aCJKOptions.IsAsianTypographyEnabled() )\n {\n DBG_ASSERT(pFact->GetTabPageCreatorFunc(RID_SVXPAGE_PARA_ASIAN), \"GetTabPageCreatorFunc fail!\");\n AddTabPage( TP_ASIAN, pFact->GetTabPageCreatorFunc(RID_SVXPAGE_PARA_ASIAN), 0 );\n }\n else\n RemoveTabPage( TP_ASIAN );\n DBG_ASSERT(pFact->GetTabPageCreatorFunc( RID_SVXPAGE_BORDER ), \"GetTabPageCreatorFunc fail!\");\n AddTabPage( TP_BORDER, pFact->GetTabPageCreatorFunc( RID_SVXPAGE_BORDER ), 0 );\n DBG_ASSERT(pFact->GetTabPageCreatorFunc( RID_SVXPAGE_BACKGROUND ), \"GetTabPageCreatorFunc fail!\");\n AddTabPage( TP_BACKGROUND, pFact->GetTabPageCreatorFunc( RID_SVXPAGE_BACKGROUND ), 0 );\n AddTabPage( TP_PROTECTION, ScTabPageProtection::Create, 0 );\n FreeResource();\n}\n\n\/\/ -----------------------------------------------------------------------\n\n__EXPORT ScAttrDlg::~ScAttrDlg()\n{\n}\n\n\/\/ -----------------------------------------------------------------------\n\nvoid __EXPORT ScAttrDlg::PageCreated( USHORT nPageId, SfxTabPage& rTabPage )\n{\n SfxObjectShell* pDocSh = SfxObjectShell::Current();\n SfxAllItemSet aSet(*(GetInputSetImpl()->GetPool()));\n switch ( nPageId )\n {\n case TP_NUMBER:\n {\n aSet.Put (SfxLinkItem( SID_LINK_TYPE, LINK( this, ScAttrDlg, OkHandler )));\n rTabPage.PageCreated(aSet);\n }\n break;\n\n case TP_FONT:\n {\n const SfxPoolItem* pInfoItem = pDocSh->GetItem( SID_ATTR_CHAR_FONTLIST );\n\n DBG_ASSERT( pInfoItem, \"FontListItem not found :-(\" );\n\n aSet.Put (SvxFontListItem(((const SvxFontListItem*)pInfoItem)->GetFontList(), SID_ATTR_CHAR_FONTLIST ));\n rTabPage.PageCreated(aSet);\n }\n break;\n\n default:\n break;\n }\n}\n\n\/\/ -----------------------------------------------------------------------\n\nIMPL_LINK( ScAttrDlg, OkHandler, void*, EMPTYARG )\n{\n ((Link&)GetOKButton().GetClickHdl()).Call( NULL );\n\n return 0;\n}\n\n\n\/* vim:set shiftwidth=4 softtabstop=4 expandtab: *\/\n<|endoftext|>"} {"text":"<commit_before>#include <cstdio>\n#include <iostream>\n#include <cstdlib>\n#include <cmath>\n#include <climits>\n\n\nvoid readpgm( const std::string &fn,\n unsigned char* &data,\n int &width,\n int &height ) {\n\n FILE* stream = 0;\n\n stream = fopen(fn.c_str(),\"r\");\n if ( !stream ) {\n std::cerr << \" Failed to read pgm.\" << std::endl;\n exit(-1);\n }\n\n\n int bsize;\n int read = fscanf(stream,\"P5\\n%d %d\\n%d%*[\\n]\",&width,&height,&bsize);\n if ( read < 3 ) {\n std::cerr << \" Failed to read pgm header.\" << std::endl;\n exit(-1);\n }\n\n data = new unsigned char[width*height];\n\n read = fread(data,1,width*height,stream);\n if ( read != width*height ) {\n std::cerr << \" Failed to read pgm data.\" << std::endl;\n std::cerr << \" Read \" << read << \" expected \" << width*height\n << \".\" << std::endl;\n exit(-1);\n }\n\n fclose(stream);\n\n\n}\n\nvoid writepgm( const std::string &fn,\n unsigned char* &data,\n int &width,\n int &height ) {\n\n FILE* stream = 0;\n\n stream = fopen(fn.c_str(),\"w\");\n if ( !stream ) {\n std::cerr << \" Failed to write pgm.\" << std::endl;\n exit(-1);\n }\n\n\n int wrote = fprintf(stream,\"P5\\n%d %d\\n%d\\n\",width,height,255);\n if ( wrote < 3 ) {\n std::cerr << \" Failed to write pgm header.\" << std::endl;\n exit(-1);\n }\n\n wrote = fwrite(data,1,width*height,stream);\n if ( wrote != width*height ) {\n std::cerr << \" Failed to write pgm data.\" << std::endl;\n std::cerr << \" Wrote \" << wrote << \" expected \" << width*height\n << \".\" << std::endl;\n exit(-1);\n }\n\n fclose(stream);\n\n\n}\n\ntypedef struct _im {\n\n unsigned char *data;\n int width, height;\n\n} im_t;\n\n#define CORR_ALGO_NCC \n\nvoid patchnxcorr( int rad, im_t &im1, im_t &im2, im_t &disp ) {\n\n if ( !(im1.width == im2.width && im1.height == im2.height ) ) {\n std::cerr << \" Images are not same dimensions.\" << std::endl;\n exit(-1);\n }\n\n int width = im1.width;\n int height = im1.height;\n\n int disparityrange = width;\n\n int sz = 2*rad+1;\n unsigned char *cache = new unsigned char[sz*sz];\n\n \/\/ Loop over all scan lines\n for ( int irow = 0; irow < height; ++irow ) { \n\n for ( int icol = 0; icol < width; ++icol ) { \n\n for ( int rrow = -rad; rrow <= rad; ++rrow ) {\n for ( int rcol = -rad; rcol <= rad; ++rcol ) {\n int r = irow + rrow; \n int c = icol + rcol;\n if ( r < 0 || r >= height || c < 0 || c >= width ) {\n int pr = rrow + rad;\n int pc = rcol + rad;\n cache[pr*sz+pc] = 0;\n continue;\n }\n int pr = rrow + rad;\n int pc = rcol + rad;\n cache[pr*sz+pc] = im2.data[r*width+c];\n }\n }\n\n#ifdef CORR_ALGO_NCC\n double maxncc = 0;\n#else \n int minssd = 0;\n#endif\n\n int minidx = -1;\n\n for ( int scol = std::max(0,icol - disparityrange);\n scol < std::min(width,icol+disparityrange); ++scol ) { \n\n#ifdef CORR_ALGO_NCC\n double ncc = 0;\n double mean1 = 0;\n double mean2 = 0;\n double std1 = 0;\n double std2 = 0;\n double xcorr = 0;\n#else \n int ssd = 0;\n#endif\n\n#ifdef CORR_ALGO_NCC\n for ( int rrow = -rad; rrow <= rad; ++rrow ) {\n for ( int rcol = -rad; rcol <= rad; ++rcol ) {\n int r = irow + rrow; \n int c = scol + rcol;\n int pr = rrow + rad;\n int pc = rcol + rad;\n mean2 += cache[pr*sz+pc];\n if ( r < 0 || r >= height || c < 0 || c >= width ) {\n continue;\n }\n mean1 += im1.data[r*width+c];\n }\n }\n mean1 \/= sz*sz;\n mean2 \/= sz*sz;\n for ( int rrow = -rad; rrow <= rad; ++rrow ) {\n for ( int rcol = -rad; rcol <= rad; ++rcol ) {\n int r = irow + rrow; \n int c = scol + rcol;\n int pr = rrow + rad;\n int pc = rcol + rad;\n double v2 = cache[pr*sz+pc] - mean2;\n std2 += v2*v2;\n double e;\n if ( r < 0 || r >= height || c < 0 || c >= width ) {\n e = 0;\n } else {\n e = im1.data[r*width+c];\n }\n double v1 = e - mean1;\n std1 += v1*v1;\n xcorr += v1 * v2;\n }\n }\n std1 = std::sqrt(std1);\n std2 = std::sqrt(std2);\n ncc = xcorr \/ std1 \/ std2;\n\n \/\/std::cout << \" ncc: \" << ncc << std::endl;\n\n if ( minidx < 0 || ncc > maxncc ) {\n maxncc = ncc;\n minidx = scol;\n }\n\n#else\n for ( int rrow = -rad; rrow <= rad; ++rrow ) {\n for ( int rcol = -rad; rcol <= rad; ++rcol ) {\n int r = irow + rrow; \n int c = scol + rcol;\n int pr = rrow + rad;\n int pc = rcol + rad;\n int delta;\n if ( r < 0 || r >= height || c < 0 || c >= width ) {\n delta = (int)cache[pr*sz+pc];\n ssd += delta * delta;\n continue;\n }\n delta = (int)cache[pr*sz+pc] - (int)im1.data[r*width+c];\n ssd += delta*delta;\n }\n }\n\n if ( minidx < 0 || ssd < minssd ) {\n minssd = ssd;\n minidx = scol;\n }\n#endif\n\n }\n\n \/\/int disparity = icol - minidx;\n \/\/std::cout << \" disparity: \" << disparity << std::endl;\n\n disp.data[irow*width + icol] = (icol-minidx) \/ 16 + 127.;\n\n\n }\n\n\n }\n\n}\n\nvoid sgmscan(int ndisp,\n int mindisp,\n int p1,\n int p2,\n int npix,\n unsigned char *ref,\n unsigned char *match,\n unsigned char *out ) {\n\n int* matrix = new int[ndisp*npix];\n std::fill(matrix,matrix+ndisp*npix,0); \/* May be not required. *\/\n\n int* pathmatrix = new int[ndisp*npix];\n std::fill(pathmatrix,pathmatrix+ndisp*npix,0); \/* May be not required. *\/\n\n int* displut = new int[ndisp];\n int* dispdifflut = new int[ndisp*ndisp];\n for ( int idisp = 0; idisp < ndisp; ++idisp ) {\n displut[idisp] = idisp + mindisp; \n }\n for ( int idisp1 = 0; idisp1 < ndisp; ++idisp1 ) {\n for ( int idisp2 = 0; idisp2 < ndisp; ++idisp2 ) {\n dispdifflut[idisp1*ndisp+idisp2] =\n std::abs( displut[idisp1] - displut[idisp2] );\n }\n }\n\n \/\/ Initialize the 0th column first dependent on the data term only\n for ( int idisp = 0; idisp < ndisp; ++idisp ) {\n int matchpos = 0+displut[idisp];\n if ( matchpos >= 0 && matchpos < npix ) {\n matrix[idisp] = std::abs((int)(ref[0])-(int)(match[matchpos]));\n } else {\n matrix[idisp] = -1; \/* Negative values will indicate invalid matching *\/\n }\n pathmatrix[idisp] = -1;\n }\n \n for ( int ipix = 1; ipix < npix; ++ipix ) {\n for ( int idisp = 0; idisp < ndisp; ++idisp ) {\n int matchpos = ipix+displut[idisp];\n int dataterm = INT_MAX;\n if ( matchpos >= 0 && matchpos < npix ) {\n dataterm = std::abs((int)(ref[ipix])-(int)(match[matchpos]));\n } else {\n matrix[ipix*ndisp + idisp] = -1; \/* Negative values will indicate invalid matching *\/\n pathmatrix[ipix*ndisp + idisp] = -1;\n continue;\n }\n int mintotalterm = INT_MAX;\n int minidx = -1;\n for ( int idispprev = 0; idispprev < ndisp; ++idispprev ) {\n int smoothterm = -1;\n int v = matrix[ (ipix-1)*ndisp + idispprev ];\n if ( v < 0 ) {\n continue;\n }\n\n\t\t\t\n \/\/ mg: According to profiling, the line below is incredibly slow,\n \/\/ thus recommend a lut to replace for speed.\n \/\/int absdisp = std::abs(displut[idispprev]-displut[idisp]);\n int absdisp = dispdifflut[idisp*ndisp + idispprev];\n\n if ( absdisp == 0 ) {\n smoothterm = v;\n } else if ( absdisp == 1 ) {\n smoothterm = v + p1;\n } else { \n smoothterm = v + p2;\n }\n\n int totalterm = smoothterm + dataterm;\n\n if ( totalterm < mintotalterm ) {\n mintotalterm = totalterm;\n minidx = idispprev;\n }\n\n }\n matrix[ipix*ndisp + idisp ] = mintotalterm;\n pathmatrix[ipix*ndisp + idisp ] = minidx;\n }\n }\n\n \/\/ Decode from optimal\n int minenergy = INT_MAX;\n int minenergyidx = -1;\n for ( int idisp = 0; idisp < ndisp; ++idisp ) {\n int energy = matrix[(npix-1)*ndisp + idisp ];\n if ( energy < 0 ) {\n continue;\n }\n if ( energy < minenergy ) {\n minenergy = energy;\n minenergyidx = idisp;\n }\n }\n\n out[npix-1] = minenergyidx;\n\n for ( int ipix = npix-2; ipix >= 0; --ipix ) {\n out[ipix] = pathmatrix[ (ipix+1)*ndisp + out[ipix+1] ];\n }\n\n\n delete[] matrix;\n delete[] pathmatrix;\n delete[] displut;\n delete[] dispdifflut;\n\n\n}\n\n\nvoid sgm( int ndisp,\n int mindisp,\n int p1,\n int p2,\n im_t &im1,\n im_t &im2,\n im_t &disp ) {\n\n if ( !(im1.width == im2.width && im1.height == im2.height ) ) {\n std::cerr << \" Images are not same dimensions.\" << std::endl;\n exit(-1);\n }\n\n int width = im1.width;\n int height = im1.height;\n\n for ( int irow = 0; irow < height; ++irow ) { \n int npix = width;\n unsigned char *ref = im1.data + irow*width;\n unsigned char *match = im2.data + irow*width;\n unsigned char *out = disp.data + irow*width;\n sgmscan(ndisp,mindisp,p1,p2,npix,ref,match,out);\n std::cout << \"\\r done row \" << irow+1 << \" of \" << height << std::flush;\n }\n std::cout << std::endl;\n\n\n}\n\n\nint main( int argc, char *argv[] ) {\n\n\n \/\/int rad = 7;\n im_t im1, im2, disp;\n\n std::cout << \" Reading im1 \" << std::endl;\n readpgm(\"cones_left.pgm\",\n im1.data,\n im1.width,\n im1.height);\n\n std::cout << \" Reading im2 \" << std::endl;\n readpgm(\"cones_right.pgm\",\n im2.data,\n im2.width,\n im2.height);\n\n disp.width = im1.width;\n disp.height = im1.height;\n disp.data = new unsigned char[disp.width*disp.height];\n\n \/\/patchnxcorr(rad,im1,im2,disp);\n int ndisp = 128;\n int mindisp = -(ndisp-1);\n int p1 = 10;\n int p2 = 150;\n std::cout << \" ndisp: \" << ndisp << std::endl;\n std::cout << \" mindisp: \" << mindisp << std::endl;\n sgm(ndisp,mindisp,p1,p2,im1,im2,disp);\n\n writepgm(\"disp.pgm\",\n disp.data,\n disp.width,\n disp.height);\n\n\n delete[] im1.data, im2.data, disp.data;\n\n\n return 0;\n}\n<commit_msg>Updated algorithm to allow for arbitriary direction.<commit_after>#include <cstdio>\n#include <iostream>\n#include <cstdlib>\n#include <cmath>\n#include <climits>\n\n\nvoid readpgm( const std::string &fn,\n unsigned char* &data,\n int &width,\n int &height ) {\n\n FILE* stream = 0;\n\n stream = fopen(fn.c_str(),\"r\");\n if ( !stream ) {\n std::cerr << \" Failed to read pgm.\" << std::endl;\n exit(-1);\n }\n\n\n int bsize;\n int read = fscanf(stream,\"P5\\n%d %d\\n%d%*[\\n]\",&width,&height,&bsize);\n if ( read < 3 ) {\n std::cerr << \" Failed to read pgm header.\" << std::endl;\n exit(-1);\n }\n\n data = new unsigned char[width*height];\n\n read = fread(data,1,width*height,stream);\n if ( read != width*height ) {\n std::cerr << \" Failed to read pgm data.\" << std::endl;\n std::cerr << \" Read \" << read << \" expected \" << width*height\n << \".\" << std::endl;\n exit(-1);\n }\n\n fclose(stream);\n\n\n}\n\nvoid writepgm( const std::string &fn,\n unsigned char* &data,\n int &width,\n int &height ) {\n\n FILE* stream = 0;\n\n stream = fopen(fn.c_str(),\"w\");\n if ( !stream ) {\n std::cerr << \" Failed to write pgm.\" << std::endl;\n exit(-1);\n }\n\n\n int wrote = fprintf(stream,\"P5\\n%d %d\\n%d\\n\",width,height,255);\n if ( wrote < 3 ) {\n std::cerr << \" Failed to write pgm header.\" << std::endl;\n exit(-1);\n }\n\n wrote = fwrite(data,1,width*height,stream);\n if ( wrote != width*height ) {\n std::cerr << \" Failed to write pgm data.\" << std::endl;\n std::cerr << \" Wrote \" << wrote << \" expected \" << width*height\n << \".\" << std::endl;\n exit(-1);\n }\n\n fclose(stream);\n\n\n}\n\ntypedef struct _im {\n\n unsigned char *data;\n int width, height;\n\n} im_t;\n\n#define CORR_ALGO_NCC \n\nvoid patchnxcorr( int rad, im_t &im1, im_t &im2, im_t &disp ) {\n\n if ( !(im1.width == im2.width && im1.height == im2.height ) ) {\n std::cerr << \" Images are not same dimensions.\" << std::endl;\n exit(-1);\n }\n\n int width = im1.width;\n int height = im1.height;\n\n int disparityrange = width;\n\n int sz = 2*rad+1;\n unsigned char *cache = new unsigned char[sz*sz];\n\n \/\/ Loop over all scan lines\n for ( int irow = 0; irow < height; ++irow ) { \n\n for ( int icol = 0; icol < width; ++icol ) { \n\n for ( int rrow = -rad; rrow <= rad; ++rrow ) {\n for ( int rcol = -rad; rcol <= rad; ++rcol ) {\n int r = irow + rrow; \n int c = icol + rcol;\n if ( r < 0 || r >= height || c < 0 || c >= width ) {\n int pr = rrow + rad;\n int pc = rcol + rad;\n cache[pr*sz+pc] = 0;\n continue;\n }\n int pr = rrow + rad;\n int pc = rcol + rad;\n cache[pr*sz+pc] = im2.data[r*width+c];\n }\n }\n\n#ifdef CORR_ALGO_NCC\n double maxncc = 0;\n#else \n int minssd = 0;\n#endif\n\n int minidx = -1;\n\n for ( int scol = std::max(0,icol - disparityrange);\n scol < std::min(width,icol+disparityrange); ++scol ) { \n\n#ifdef CORR_ALGO_NCC\n double ncc = 0;\n double mean1 = 0;\n double mean2 = 0;\n double std1 = 0;\n double std2 = 0;\n double xcorr = 0;\n#else \n int ssd = 0;\n#endif\n\n#ifdef CORR_ALGO_NCC\n for ( int rrow = -rad; rrow <= rad; ++rrow ) {\n for ( int rcol = -rad; rcol <= rad; ++rcol ) {\n int r = irow + rrow; \n int c = scol + rcol;\n int pr = rrow + rad;\n int pc = rcol + rad;\n mean2 += cache[pr*sz+pc];\n if ( r < 0 || r >= height || c < 0 || c >= width ) {\n continue;\n }\n mean1 += im1.data[r*width+c];\n }\n }\n mean1 \/= sz*sz;\n mean2 \/= sz*sz;\n for ( int rrow = -rad; rrow <= rad; ++rrow ) {\n for ( int rcol = -rad; rcol <= rad; ++rcol ) {\n int r = irow + rrow; \n int c = scol + rcol;\n int pr = rrow + rad;\n int pc = rcol + rad;\n double v2 = cache[pr*sz+pc] - mean2;\n std2 += v2*v2;\n double e;\n if ( r < 0 || r >= height || c < 0 || c >= width ) {\n e = 0;\n } else {\n e = im1.data[r*width+c];\n }\n double v1 = e - mean1;\n std1 += v1*v1;\n xcorr += v1 * v2;\n }\n }\n std1 = std::sqrt(std1);\n std2 = std::sqrt(std2);\n ncc = xcorr \/ std1 \/ std2;\n\n \/\/std::cout << \" ncc: \" << ncc << std::endl;\n\n if ( minidx < 0 || ncc > maxncc ) {\n maxncc = ncc;\n minidx = scol;\n }\n\n#else\n for ( int rrow = -rad; rrow <= rad; ++rrow ) {\n for ( int rcol = -rad; rcol <= rad; ++rcol ) {\n int r = irow + rrow; \n int c = scol + rcol;\n int pr = rrow + rad;\n int pc = rcol + rad;\n int delta;\n if ( r < 0 || r >= height || c < 0 || c >= width ) {\n delta = (int)cache[pr*sz+pc];\n ssd += delta * delta;\n continue;\n }\n delta = (int)cache[pr*sz+pc] - (int)im1.data[r*width+c];\n ssd += delta*delta;\n }\n }\n\n if ( minidx < 0 || ssd < minssd ) {\n minssd = ssd;\n minidx = scol;\n }\n#endif\n\n }\n\n \/\/int disparity = icol - minidx;\n \/\/std::cout << \" disparity: \" << disparity << std::endl;\n\n disp.data[irow*width + icol] = (icol-minidx) \/ 16 + 127.;\n\n\n }\n\n\n }\n\n}\n\nvoid sgmscan(int ndisp,\n int mindisp,\n int p1,\n int p2,\n int width, \/* Image width *\/\n int *unravel,\n int npix,\n unsigned char *ref,\n unsigned char *match,\n unsigned char *out ) {\n\n int* matrix = new int[ndisp*npix];\n std::fill(matrix,matrix+ndisp*npix,0); \/* May be not required. *\/\n\n int* pathmatrix = new int[ndisp*npix];\n std::fill(pathmatrix,pathmatrix+ndisp*npix,0); \/* May be not required. *\/\n\n int* displut = new int[ndisp];\n int* dispdifflut = new int[ndisp*ndisp];\n for ( int idisp = 0; idisp < ndisp; ++idisp ) {\n displut[idisp] = idisp + mindisp; \n }\n for ( int idisp1 = 0; idisp1 < ndisp; ++idisp1 ) {\n for ( int idisp2 = 0; idisp2 < ndisp; ++idisp2 ) {\n dispdifflut[idisp1*ndisp+idisp2] =\n std::abs( displut[idisp1] - displut[idisp2] );\n }\n }\n\n \/\/ Initialize the 0th column first dependent on the data term only\n for ( int idisp = 0; idisp < ndisp; ++idisp ) {\n int refy = unravel[0];\n int refx = unravel[1];\n int matchposx = refx+displut[idisp];\n int matchposy = refy;\n if ( matchposx >= 0 && matchposx < npix ) {\n matrix[idisp] = std::abs((int)(ref[refy*width+refx])-\n (int)(match[matchposy*width+matchposx]));\n } else {\n matrix[idisp] = -1; \/* Negative values will indicate invalid matching *\/\n }\n pathmatrix[idisp] = -1;\n }\n \n for ( int ipix = 1; ipix < npix; ++ipix ) {\n for ( int idisp = 0; idisp < ndisp; ++idisp ) {\n int refy = unravel[2*ipix+0];\n int refx = unravel[2*ipix+1];\n int matchposx = refx+displut[idisp];\n int matchposy = refy;\n \/\/int matchpos = ipix+displut[idisp];\n int dataterm = INT_MAX;\n if ( matchposx >= 0 && matchposx < npix ) {\n \/\/dataterm = std::abs((int)(ref[ipix])-(int)(match[matchpos]));\n dataterm = std::abs((int)(ref[refy*width+refx])-\n (int)(match[matchposy*width+matchposx]));\n } else {\n matrix[ipix*ndisp + idisp] = -1; \/* Negative values will indicate invalid matching *\/\n pathmatrix[ipix*ndisp + idisp] = -1;\n continue;\n }\n int mintotalterm = INT_MAX;\n int minidx = -1;\n for ( int idispprev = 0; idispprev < ndisp; ++idispprev ) {\n int smoothterm = -1;\n int v = matrix[ (ipix-1)*ndisp + idispprev ];\n if ( v < 0 ) {\n continue;\n }\n\n\n \/\/ mg: According to profiling, the line below is incredibly slow,\n \/\/ thus recommend a lut to replace for speed.\n \/\/int absdisp = std::abs(displut[idispprev]-displut[idisp]);\n int absdisp = dispdifflut[idisp*ndisp + idispprev];\n\n if ( absdisp == 0 ) {\n smoothterm = v;\n } else if ( absdisp == 1 ) {\n smoothterm = v + p1;\n } else { \n smoothterm = v + p2;\n }\n\n int totalterm = smoothterm + dataterm;\n\n if ( totalterm < mintotalterm ) {\n mintotalterm = totalterm;\n minidx = idispprev;\n }\n\n }\n matrix[ipix*ndisp + idisp ] = mintotalterm;\n pathmatrix[ipix*ndisp + idisp ] = minidx;\n }\n }\n\n \/\/ Decode from optimal\n int minenergy = INT_MAX;\n int minenergyidx = -1;\n for ( int idisp = 0; idisp < ndisp; ++idisp ) {\n int energy = matrix[(npix-1)*ndisp + idisp ];\n if ( energy < 0 ) {\n continue;\n }\n if ( energy < minenergy ) {\n minenergy = energy;\n minenergyidx = idisp;\n }\n }\n\n int *_out = new int[npix];\n\n _out[npix-1] = minenergyidx;\n\n for ( int ipix = npix-2; ipix >= 0; --ipix ) {\n _out[ipix] = pathmatrix[ (ipix+1)*ndisp + _out[ipix+1] ];\n }\n\n for ( int ipix = 0; ipix < npix; ++ipix ) {\n int y = unravel[2*ipix + 0];\n int x = unravel[2*ipix + 1];\n out[y*width+x] = _out[ipix];\n }\n \n\n delete[] _out;\n\n\n delete[] matrix;\n delete[] pathmatrix;\n delete[] displut;\n delete[] dispdifflut;\n\n\n}\n\n\nvoid sgm( int ndisp,\n int mindisp,\n int p1,\n int p2,\n im_t &im1,\n im_t &im2,\n im_t &disp ) {\n\n if ( !(im1.width == im2.width && im1.height == im2.height ) ) {\n std::cerr << \" Images are not same dimensions.\" << std::endl;\n exit(-1);\n }\n\n int width = im1.width;\n int height = im1.height;\n\n int npix = width;\n int *unravel = new int[2*npix];\n\n for ( int irow = 0; irow < height; ++irow ) { \n \/\/unsigned char *ref = im1.data + irow*width;\n \/\/unsigned char *match = im2.data + irow*width;\n \/\/unsigned char *out = disp.data + irow*width;\n unsigned char *ref = im1.data;\n unsigned char *match = im2.data;\n unsigned char *out = disp.data;\n for ( int icol = 0; icol < width; ++icol ) {\n unravel[2*icol+0] = irow;\n unravel[2*icol+1] = icol;\n }\n sgmscan(ndisp,mindisp,p1,p2,width,unravel,npix,ref,match,out);\n std::cout << \"\\r done row \" << irow+1 << \" of \" << height << std::flush;\n }\n std::cout << std::endl;\n\n delete[] unravel;\n\n\n}\n\n\nint main( int argc, char *argv[] ) {\n\n\n \/\/int rad = 7;\n im_t im1, im2, disp;\n\n std::cout << \" Reading im1 \" << std::endl;\n readpgm(\"cones_left.pgm\",\n im1.data,\n im1.width,\n im1.height);\n\n std::cout << \" Reading im2 \" << std::endl;\n readpgm(\"cones_right.pgm\",\n im2.data,\n im2.width,\n im2.height);\n\n disp.width = im1.width;\n disp.height = im1.height;\n disp.data = new unsigned char[disp.width*disp.height];\n\n \/\/patchnxcorr(rad,im1,im2,disp);\n int ndisp = 128;\n int mindisp = -(ndisp-1);\n int p1 = 10;\n int p2 = 150;\n std::cout << \" ndisp: \" << ndisp << std::endl;\n std::cout << \" mindisp: \" << mindisp << std::endl;\n sgm(ndisp,mindisp,p1,p2,im1,im2,disp);\n\n writepgm(\"disp.pgm\",\n disp.data,\n disp.width,\n disp.height);\n\n\n delete[] im1.data, im2.data, disp.data;\n\n\n return 0;\n}\n<|endoftext|>"} {"text":"<commit_before>\n#include \"manager.hpp\"\n\n#ifdef _WIN32\n#include \"dirent.h\"\n#include \"fnmatch.h\"\n#else\n#include <dirent.h>\n#include <sys\/stat.h>\n#include <fnmatch.h>\n#endif\n\n#include <algorithm>\n#include <cstring>\n#include <fstream>\n#include <sstream>\n#include <vector>\n\n#include \"..\/archives\/bsaarchive.hpp\"\n\n\nnamespace\n{\n\nstd::vector<std::string> gRootPaths;\nArchives::BsaArchive gGlobalBsa;\n\n}\n\n\nnamespace VFS\n{\n\nManager::Manager()\n{\n}\n\nvoid Manager::initialize(std::string&& root_path)\n{\n if(root_path.empty())\n root_path += \".\/\";\n else if(root_path.back() != '\/' && root_path.back() != '\\\\')\n root_path += \"\/\";\n\n gGlobalBsa.load(root_path+\"GLOBAL.BSA\");\n\n gRootPaths.push_back(std::move(root_path));\n}\n\nvoid Manager::addDataPath(std::string&& path)\n{\n if(path.empty())\n path += \".\/\";\n else if(path.back() != '\/' && path.back() != '\\\\')\n path += \"\/\";\n gRootPaths.push_back(std::move(path));\n}\n\n\nIStreamPtr Manager::open(const char *name)\n{\n std::unique_ptr<std::ifstream> stream(new std::ifstream());\n \/\/ Search in reverse, so newer paths take precedence.\n auto piter = gRootPaths.rbegin();\n while(piter != gRootPaths.rend())\n {\n stream->open((*piter+name).c_str(), std::ios_base::binary);\n if(stream->good()) return IStreamPtr(std::move(stream));\n ++piter;\n }\n\n return gGlobalBsa.open(name);\n}\n\nbool Manager::exists(const char *name)\n{\n std::ifstream file;\n for(const std::string &path : gRootPaths)\n {\n file.open((path+name).c_str(), std::ios_base::binary);\n if(file.is_open()) return true;\n }\n\n return gGlobalBsa.exists(name);\n}\n\n\nvoid Manager::add_dir(const std::string &path, const std::string &pre, const char *pattern, std::vector<std::string> &names)\n{\n DIR *dir = opendir(path.c_str());\n if(!dir) return;\n\n dirent *ent;\n while((ent=readdir(dir)) != nullptr)\n {\n if(strcmp(ent->d_name, \".\") == 0 || strcmp(ent->d_name, \"..\") == 0)\n continue;\n\n if(!S_ISDIR(ent->d_type))\n {\n std::string fname = pre + ent->d_name;\n if(!pattern || fnmatch(pattern, fname.c_str(), 0) == 0)\n names.push_back(fname);\n }\n else\n {\n std::string newpath = path+\"\/\"+ent->d_name;\n std::string newpre = pre+ent->d_name+\"\/\";\n add_dir(newpath, newpre, pattern, names);\n }\n }\n\n closedir(dir);\n}\n\nstd::vector<std::string> Manager::list(const char *pattern) const\n{\n std::vector<std::string> files;\n\n auto piter = gRootPaths.rbegin();\n while(piter != gRootPaths.rend())\n {\n add_dir(*piter+\".\", \"\", pattern, files);\n ++piter;\n }\n\n if(!pattern)\n {\n const auto &list = gGlobalBsa.list();\n std::copy(list.begin(), list.end(), std::back_inserter(files));\n }\n else\n {\n const auto &list = gGlobalBsa.list();\n std::copy_if(list.begin(), list.end(), std::back_inserter(files),\n [pattern](const std::string &name) -> bool\n {\n const char *dirsep = strrchr(name.c_str(), '\/');\n return (fnmatch(pattern, dirsep?dirsep:name.c_str(), 0) == 0);\n }\n );\n }\n\n return files;\n}\n\n} \/\/ namespace VFS\n<commit_msg>Modified path to fnmatch.h.<commit_after>\n#include \"manager.hpp\"\n\n#ifdef _WIN32\n#include \"dirent.h\"\n#include \"..\/misc\/fnmatch.h\"\n#else\n#include <dirent.h>\n#include <sys\/stat.h>\n#include <fnmatch.h>\n#endif\n\n#include <algorithm>\n#include <cstring>\n#include <fstream>\n#include <sstream>\n#include <vector>\n\n#include \"..\/archives\/bsaarchive.hpp\"\n\n\nnamespace\n{\n\nstd::vector<std::string> gRootPaths;\nArchives::BsaArchive gGlobalBsa;\n\n}\n\n\nnamespace VFS\n{\n\nManager::Manager()\n{\n}\n\nvoid Manager::initialize(std::string&& root_path)\n{\n if(root_path.empty())\n root_path += \".\/\";\n else if(root_path.back() != '\/' && root_path.back() != '\\\\')\n root_path += \"\/\";\n\n gGlobalBsa.load(root_path+\"GLOBAL.BSA\");\n\n gRootPaths.push_back(std::move(root_path));\n}\n\nvoid Manager::addDataPath(std::string&& path)\n{\n if(path.empty())\n path += \".\/\";\n else if(path.back() != '\/' && path.back() != '\\\\')\n path += \"\/\";\n gRootPaths.push_back(std::move(path));\n}\n\n\nIStreamPtr Manager::open(const char *name)\n{\n std::unique_ptr<std::ifstream> stream(new std::ifstream());\n \/\/ Search in reverse, so newer paths take precedence.\n auto piter = gRootPaths.rbegin();\n while(piter != gRootPaths.rend())\n {\n stream->open((*piter+name).c_str(), std::ios_base::binary);\n if(stream->good()) return IStreamPtr(std::move(stream));\n ++piter;\n }\n\n return gGlobalBsa.open(name);\n}\n\nbool Manager::exists(const char *name)\n{\n std::ifstream file;\n for(const std::string &path : gRootPaths)\n {\n file.open((path+name).c_str(), std::ios_base::binary);\n if(file.is_open()) return true;\n }\n\n return gGlobalBsa.exists(name);\n}\n\n\nvoid Manager::add_dir(const std::string &path, const std::string &pre, const char *pattern, std::vector<std::string> &names)\n{\n DIR *dir = opendir(path.c_str());\n if(!dir) return;\n\n dirent *ent;\n while((ent=readdir(dir)) != nullptr)\n {\n if(strcmp(ent->d_name, \".\") == 0 || strcmp(ent->d_name, \"..\") == 0)\n continue;\n\n if(!S_ISDIR(ent->d_type))\n {\n std::string fname = pre + ent->d_name;\n if(!pattern || fnmatch(pattern, fname.c_str(), 0) == 0)\n names.push_back(fname);\n }\n else\n {\n std::string newpath = path+\"\/\"+ent->d_name;\n std::string newpre = pre+ent->d_name+\"\/\";\n add_dir(newpath, newpre, pattern, names);\n }\n }\n\n closedir(dir);\n}\n\nstd::vector<std::string> Manager::list(const char *pattern) const\n{\n std::vector<std::string> files;\n\n auto piter = gRootPaths.rbegin();\n while(piter != gRootPaths.rend())\n {\n add_dir(*piter+\".\", \"\", pattern, files);\n ++piter;\n }\n\n if(!pattern)\n {\n const auto &list = gGlobalBsa.list();\n std::copy(list.begin(), list.end(), std::back_inserter(files));\n }\n else\n {\n const auto &list = gGlobalBsa.list();\n std::copy_if(list.begin(), list.end(), std::back_inserter(files),\n [pattern](const std::string &name) -> bool\n {\n const char *dirsep = strrchr(name.c_str(), '\/');\n return (fnmatch(pattern, dirsep?dirsep:name.c_str(), 0) == 0);\n }\n );\n }\n\n return files;\n}\n\n} \/\/ namespace VFS\n<|endoftext|>"} {"text":"<commit_before>#ifndef STAN_MATH_OPENCL_IS_CONSTANT_HPP\n#define STAN_MATH_OPENCL_IS_CONSTANT_HPP\n#ifdef STAN_OPENCL\n\n#include <stan\/math\/prim\/meta\/is_constant.hpp>\n#include <stan\/math\/opencl\/matrix_cl.hpp>\n\nnamespace stan {\n\n\/** \\ingroup type_trait\n * Defines a static member named value and sets it to true\n * if the type of the elements in the provided matrix_cl\n * is constant, false otherwise. This is used in\n * the is_constant_all metaprogram.\n * @tparam type of the elements in the matrix_cl\n *\/\ntemplate <typename T>\nstruct is_constant<math::matrix_cl<T>> : is_constant<std::decay_t<T>> {};\n\n} \/\/ namespace stan\n\n#endif\n#endif\n<commit_msg>fix is_constant for kernel expressions<commit_after>#ifndef STAN_MATH_OPENCL_IS_CONSTANT_HPP\n#define STAN_MATH_OPENCL_IS_CONSTANT_HPP\n#ifdef STAN_OPENCL\n\n#include <stan\/math\/prim\/meta\/is_constant.hpp>\n#include <stan\/math\/opencl\/matrix_cl.hpp>\n\nnamespace stan {\n\n\/** \\ingroup type_trait\n * Defines a static member named value and sets it to true\n * if the type of the elements in the provided matrix_cl\n * is constant, false otherwise. This is used in\n * the is_constant_all metaprogram.\n * @tparam type of the elements in the matrix_cl\n *\/\ntemplate <typename T>\nstruct is_constant<T, require_all_kernel_expressions_and_none_scalar_t<T>> : std::true_type {};\n\n} \/\/ namespace stan\n\n#endif\n#endif\n<|endoftext|>"} {"text":"<commit_before>#include <сomplex_t.hpp>\n#include <catch.hpp>\nSCENARIO(\"def constructor\")\n{\n\tcomplex_t Complex;\n\tREQUIRE(Complex.a_() == 0);\n\tREQUIRE(Complex.b_() == 0);\n}\n\nSCENARIO(\"param constructor\")\n{\n\tcomplex_t Complex(1, 2);\n\tREQUIRE(Complex.a_() == 1);\n\tREQUIRE(Complex.b_() == 2);\n}\n\nSCENARIO(\"copy constructor\")\n{\n\tcomplex_t Complex(1, 2);\n\tcomplex_t cop(Complex);\n\tREQUIRE(cop.a_() == 1);\n\tREQUIRE(cop.b_() == 2);\n}\n\nSCENARIO(\"operator *\")\n{\n\tcomplex_t c1(3, 2);\n\tcomplex_t c2(5, 4);\n\tcomplex_t c3(15, 8);\n\tREQUIRE((c1*c2) == c3);\n}\n\nSCENARIO(\"operator \/\")\n{\n\tcomplex_t c1(4, 5);\n\tcomplex_t c2(4, 5);\n\tcomplex_t c3(1, 0);\n\tREQUIRE((c1 \/ c2) == c3);\n}\n\nSCENARIO(\"operator +=\")\n{\n\tcomplex_t c1(11, 1);\n\tcomplex_t c2(8, 3);\n\tcomplex_t c3(19, 4);\n\tREQUIRE((c1 += c2) == c3);\n}\n\nSCENARIO(\"operator -=\")\n{\n\tcomplex_t c1(6, 10);\n\tcomplex_t c2(3, 6);\n\tcomplex_t c3(3, 4);\n\tREQUIRE((c1 -= c2) == c3);\n}\n\nSCENARIO(\"operator *=\")\n{\n\tcomplex_t c1(7, 6);\n\tcomplex_t c2(5, 4);\n\tcomplex_t c3(11, 58);\n\tREQUIRE((c1 *= c2) == c3);\n}\n\nSCENARIO(\"operator \/=\")\n{\n\tcomplex_t c1(2, 1);\n\tcomplex_t c2(2, 1);\n\tcomplex_t c3(1, 0);\n\tREQUIRE((c1 \/= c2) == c3);\n}\n\nSCENARIO(\"operator =\")\n{\n\tcomplex_t c1(5, 7);\n\tcomplex_t c2 = c1;\n\tREQUIRE(c2 == c1);\n}\n\nSCENARIO(\"operator ==\")\n{\n\tcomplex_t c1(2, 5);\n\tcomplex_t c2(2, 5);\n\tREQUIRE(c1 == c2);\n}\n<commit_msg>Update init.cpp<commit_after>#include <сomplex_t.hpp>\n#include <catch.hpp>\nSCENARIO(\"def constructor\")\n{\n\tcomplex_t Complex;\n\tREQUIRE(Complex.a_() == 0);\n\tREQUIRE(Complex.b_() == 0);\n}\n\nSCENARIO(\"param constructor\")\n{\n\tcomplex_t Complex(1, 2);\n\tREQUIRE(Complex.a_() == 1);\n\tREQUIRE(Complex.b_() == 2);\n}\n\nSCENARIO(\"copy constructor\")\n{\n\tcomplex_t Complex(1, 2);\n\tcomplex_t cop(Complex);\n\tREQUIRE(cop.a_() == 1);\n\tREQUIRE(cop.b_() == 2);\n}\n\nSCENARIO(\"operator *\")\n{\n\tcomplex_t c1(7, 6);\n\tcomplex_t c2(5, 4);\n\tcomplex_t c3(11, 58);\n\tREQUIRE((c1*c2) == c3);\n}\n\nSCENARIO(\"operator \/\")\n{\n\tcomplex_t c1(4, 5);\n\tcomplex_t c2(4, 5);\n\tcomplex_t c3(1, 0);\n\tREQUIRE((c1 \/ c2) == c3);\n}\n\nSCENARIO(\"operator +=\")\n{\n\tcomplex_t c1(11, 1);\n\tcomplex_t c2(8, 3);\n\tcomplex_t c3(19, 4);\n\tREQUIRE((c1 += c2) == c3);\n}\n\nSCENARIO(\"operator -=\")\n{\n\tcomplex_t c1(6, 10);\n\tcomplex_t c2(3, 6);\n\tcomplex_t c3(3, 4);\n\tREQUIRE((c1 -= c2) == c3);\n}\n\nSCENARIO(\"operator *=\")\n{\n\tcomplex_t c1(7, 6);\n\tcomplex_t c2(5, 4);\n\tcomplex_t c3(11, 58);\n\tREQUIRE((c1 *= c2) == c3);\n}\n\nSCENARIO(\"operator \/=\")\n{\n\tcomplex_t c1(2, 1);\n\tcomplex_t c2(2, 1);\n\tcomplex_t c3(1, 0);\n\tREQUIRE((c1 \/= c2) == c3);\n}\n\nSCENARIO(\"operator =\")\n{\n\tcomplex_t c1(5, 7);\n\tcomplex_t c2 = c1;\n\tREQUIRE(c2 == c1);\n}\n\nSCENARIO(\"operator ==\")\n{\n\tcomplex_t c1(2, 5);\n\tcomplex_t c2(2, 5);\n\tREQUIRE(c1 == c2);\n}\n<|endoftext|>"} {"text":"<commit_before>\n#include <tree.hpp>\n#include <catch.hpp>\n\n\nSCENARIO(\"null\")\n{\n\tTree<int> a;\n\tREQUIRE(a.tree_one()==NULL);\n}\nSCENARIO(\"add\") \n{\n\tTree <int> a;\n\tbool b=a.add(5);\n\tREQUIRE(b == 1);\n}\nSCENARIO(\"find\")\n{\n\tTree<int> a;\n\ta.add(5);\n\tbool b = a.find(5);\n\tREQUIRE(b == 1);\n}\nSCENARIO(\"del1\")\n{\n\tTree<int> a;\n\ta.add(5);\n\ta.add(4);\n\ta.add(7);\n\ta.add(8);\n\ta.add(2);\n\ta.add(6);\n\ta.del(7);\n\tbool b = a.find(7);\n\tREQUIRE(b == 0);\n}\nSCENARIO(\"del2\") \n{\n\tTree<int> a;\n\ta.add(5);\n\ta.add(4);\n\ta.add(7);\n\ta.add(8);\n\ta.add(2);\n\ta.add(6);\n\ta.del(2);\n\tbool b = a.find(2);\n\tREQUIRE(b == 0);\n}\nSCENARIO(\"del3\")\n{\n\tTree<int> a;\n\ta.add(5);\n\ta.add(4);\n\ta.add(7);\n\ta.add(8);\n\ta.add(2);\n\ta.add(6);\n\ta.add(1);\n\ta.del(2);\n\tbool b = a.find(2);\n\tREQUIRE(b == 0);\n}\nSCENARIO(\"del4\")\n{\n\tTree<int> a;\n\ta.add(5);\n\ta.add(4);\n\ta.add(7);\n\ta.add(8);\n\ta.add(2);\n\ta.add(6);\n\ta.add(3);\n\ta.del(2);\n\tbool b = a.find(2);\n\tREQUIRE(b == 0);\n}\nSCENARIO(\"del5\")\n{\n\tTree<int> a;\n\ta.add(5);\n\ta.add(4);\n\ta.add(7);\n\ta.add(8);\n\ta.add(2);\n\ta.add(6);\n\ta.add(3);\n\tbool b = a.del(15);;\n\tREQUIRE(b == 0);\n}\nSCENARIO(\"file\")\n{\n\tTree<int> a, c;\n\tc.add(3);\n\tc.add(2);\n\tc.add(1);\n\tc.add(5);\n\tc.pr(\"Tr.txt\");\n\ta.file_tree(\"Tr.txt\");\n\tbool b = a.find(3);\n\tREQUIRE(b == 1);\n\tb = a.find(2);\n\tREQUIRE(b == 1);\n\tb = a.find(1);\n\tREQUIRE(b == 1);\n\tb = a.find(5);\n\tREQUIRE(b == 1);\n}\nSCENARIO(\"BST delete non inserted element\", \"[delete]\")\n{ \n\tTree<int> tree = {8}; \n\tREQUIRE( !tree.del(4) ); \n\tREQUIRE( !tree.isEmpty() ); \n} \nSCENARIO(\"BST delete root without children\", \"[delete]\") \n{ \n\tTree<int> tree = {8}; \n\tREQUIRE( tree.del(8) ); \n\tREQUIRE( tree.isEmpty() ); \n} \nSCENARIO(\"BST delete root with one child\", \"[delete]\") \n{ \n\tTree<int> tree = {8, 4, 3}; \n\tREQUIRE( tree.remove(8) ); \n\tREQUIRE( tree == Tree<int>({4, 3}) ); \n} \nSCENARIO(\"BST delete root with children\", \"[delete]\") \n{ \n\tTree<int> tree = {8, 4, 3, 10, 9, 13, 11, 12}; \n\tREQUIRE( tree.remove(8) ); \n\tREQUIRE( tree == BinarySearchTree<int>({9, 4, 3, 10, 13, 11, 12}) ); \n}\nSCENARIO(\"BST delete non root without children\", \"[delete]\") \n{ \n\tTree<int> tree = {8, 4, 3, 10, 9, 13, 11, 12}; \n\tREQUIRE( tree.remove(3) ); \n\tREQUIRE( tree == BinarySearchTree<int>({8, 4, 10, 9, 13, 11, 12}) ); \n}\nSCENARIO(\"BST delete non root with one child\", \"[delete]\") \n{ \n\tTree<int> tree = {8, 4, 3, 10, 9, 13, 11, 12}; \n\tREQUIRE( tree.remove(11) ); \n\tREQUIRE( tree == BinarySearchTree<int>({8, 4, 3, 10, 9, 13, 12}) ); \n}\nSCENARIO(\"BST delete non root with children\", \"[delete]\")\n{ \n\tTree<int> tree = {8, 4, 3, 10, 9, 13, 11, 12}; \n\tREQUIRE( tree.remove(10) ); \n\tREQUIRE( tree == BinarySearchTree<int>({8, 4, 3, 11, 9, 13, 12}) ); \n} \n<commit_msg>Update init.cpp<commit_after>\n#include <tree.hpp>\n#include <catch.hpp>\n\n\nSCENARIO(\"null\")\n{\n\tTree<int> a;\n\tREQUIRE(a.tree_one()==NULL);\n}\nSCENARIO(\"add\") \n{\n\tTree <int> a;\n\tbool b=a.add(5);\n\tREQUIRE(b == 1);\n}\nSCENARIO(\"find\")\n{\n\tTree<int> a;\n\ta.add(5);\n\tbool b = a.find(5);\n\tREQUIRE(b == 1);\n}\nSCENARIO(\"del1\")\n{\n\tTree<int> a;\n\ta.add(5);\n\ta.add(4);\n\ta.add(7);\n\ta.add(8);\n\ta.add(2);\n\ta.add(6);\n\ta.del(7);\n\tbool b = a.find(7);\n\tREQUIRE(b == 0);\n}\nSCENARIO(\"del2\") \n{\n\tTree<int> a;\n\ta.add(5);\n\ta.add(4);\n\ta.add(7);\n\ta.add(8);\n\ta.add(2);\n\ta.add(6);\n\ta.del(2);\n\tbool b = a.find(2);\n\tREQUIRE(b == 0);\n}\nSCENARIO(\"del3\")\n{\n\tTree<int> a;\n\ta.add(5);\n\ta.add(4);\n\ta.add(7);\n\ta.add(8);\n\ta.add(2);\n\ta.add(6);\n\ta.add(1);\n\ta.del(2);\n\tbool b = a.find(2);\n\tREQUIRE(b == 0);\n}\nSCENARIO(\"del4\")\n{\n\tTree<int> a;\n\ta.add(5);\n\ta.add(4);\n\ta.add(7);\n\ta.add(8);\n\ta.add(2);\n\ta.add(6);\n\ta.add(3);\n\ta.del(2);\n\tbool b = a.find(2);\n\tREQUIRE(b == 0);\n}\nSCENARIO(\"del5\")\n{\n\tTree<int> a;\n\ta.add(5);\n\ta.add(4);\n\ta.add(7);\n\ta.add(8);\n\ta.add(2);\n\ta.add(6);\n\ta.add(3);\n\tbool b = a.del(15);;\n\tREQUIRE(b == 0);\n}\nSCENARIO(\"file\")\n{\n\tTree<int> a, c;\n\tc.add(3);\n\tc.add(2);\n\tc.add(1);\n\tc.add(5);\n\tc.pr(\"Tr.txt\");\n\ta.file_tree(\"Tr.txt\");\n\tbool b = a.find(3);\n\tREQUIRE(b == 1);\n\tb = a.find(2);\n\tREQUIRE(b == 1);\n\tb = a.find(1);\n\tREQUIRE(b == 1);\n\tb = a.find(5);\n\tREQUIRE(b == 1);\n}\nSCENARIO(\"BST delete non inserted element\", \"[delete]\")\n{ \n\tTree<int> tree = {8}; \n\tREQUIRE( !tree.del(4) ); \n\tREQUIRE( !tree.isEmpty() ); \n} \nSCENARIO(\"BST delete root without children\", \"[delete]\") \n{ \n\tTree<int> tree = {8}; \n\tREQUIRE( tree.del(8) ); \n\tREQUIRE( tree.isEmpty() ); \n} \nSCENARIO(\"BST delete root with one child\", \"[delete]\") \n{ \n\tTree<int> tree = {8, 4, 3}; \n\tREQUIRE( tree.del(8) ); \n\tREQUIRE( tree == Tree<int>({4, 3}) ); \n} \nSCENARIO(\"BST delete root with children\", \"[delete]\") \n{ \n\tTree<int> tree = {8, 4, 3, 10, 9, 13, 11, 12}; \n\tREQUIRE( tree.del(8) ); \n\tREQUIRE( tree == Tree<int>({9, 4, 3, 10, 13, 11, 12}) ); \n}\nSCENARIO(\"BST delete non root without children\", \"[delete]\") \n{ \n\tTree<int> tree = {8, 4, 3, 10, 9, 13, 11, 12}; \n\tREQUIRE( tree.del(3) ); \n\tREQUIRE( tree == Tree<int>({8, 4, 10, 9, 13, 11, 12}) ); \n}\nSCENARIO(\"BST delete non root with one child\", \"[delete]\") \n{ \n\tTree<int> tree = {8, 4, 3, 10, 9, 13, 11, 12}; \n\tREQUIRE( tree.del(11) ); \n\tREQUIRE( tree == Tree<int>({8, 4, 3, 10, 9, 13, 12}) ); \n}\nSCENARIO(\"BST delete non root with children\", \"[delete]\")\n{ \n\tTree<int> tree = {8, 4, 3, 10, 9, 13, 11, 12}; \n\tREQUIRE( tree.del(10) ); \n\tREQUIRE( tree == Tree<int>({8, 4, 3, 11, 9, 13, 12}) ); \n} \n<|endoftext|>"} {"text":"<commit_before>#include \"SharedResource.h\"\n\n#define BOOST_TEST_MAIN\n#include <boost\/test\/unit_test.hpp>\n\n\nBOOST_AUTO_TEST_CASE(Basic_construction)\n{\n SharedResource<int> shared_int;\n}\n\n\nBOOST_AUTO_TEST_CASE(Construction_with_argument)\n{\n SharedResource<int> shared_int(5);\n}\n\n\nBOOST_AUTO_TEST_CASE(Construction_no_default_constructor)\n{\n struct TestClass\n {\n TestClass() = delete;\n TestClass(int) { }\n };\n\n SharedResource<TestClass> stc2(5);\n}\n\n\nBOOST_AUTO_TEST_CASE(Basic_Locking)\n{\n SharedResource<int> shared_int(0);\n shared_int.lock();\n}\n\n\nBOOST_AUTO_TEST_CASE(Locking_with_accessor)\n{\n SharedResource<int> shared_int(0);\n auto shared_int_accessor = shared_int.lock();\n}\n\n\nBOOST_AUTO_TEST_CASE(Accessor_isValid)\n{\n SharedResource<int> shared_int(0);\n auto shared_int_accessor = shared_int.lock();\n BOOST_CHECK(shared_int_accessor.isValid());\n auto shared_int_accessor_new(std::move(shared_int_accessor));\n BOOST_CHECK(!shared_int_accessor.isValid());\n BOOST_CHECK(shared_int_accessor_new.isValid());\n}\n\n<commit_msg>Tests for SharedResource dereferencing<commit_after>#include \"SharedResource.h\"\n\n#define BOOST_TEST_MAIN\n#include <boost\/test\/unit_test.hpp>\n\n\nBOOST_AUTO_TEST_CASE(Basic_construction)\n{\n SharedResource<int> shared_test_class;\n}\n\n\nBOOST_AUTO_TEST_CASE(Construction_with_argument)\n{\n SharedResource<int> shared_test_class(5);\n}\n\n\nBOOST_AUTO_TEST_CASE(Construction_no_default_constructor)\n{\n struct TestClass\n {\n TestClass() = delete;\n TestClass(int) { }\n };\n\n SharedResource<TestClass> stc2(5);\n}\n\n\nBOOST_AUTO_TEST_CASE(Basic_Locking)\n{\n SharedResource<int> shared_test_class(0);\n shared_int.lock();\n}\n\n\nBOOST_AUTO_TEST_CASE(Locking_with_accessor)\n{\n SharedResource<int> shared_test_class(0);\n auto shared_int_accessor = shared_test_class.lock();\n}\n\n\nBOOST_AUTO_TEST_CASE(Accessor_isValid)\n{\n SharedResource<int> shared_test_class(0);\n auto shared_int_accessor = shared_test_class.lock();\n BOOST_CHECK(shared_int_accessor.isValid());\n auto shared_int_accessor_new(std::move(shared_int_accessor));\n BOOST_CHECK(!shared_int_accessor.isValid());\n BOOST_CHECK(shared_int_accessor_new.isValid());\n}\n\n\nBOOST_AUTO_TEST_CASE(Acessor_dereferencing_1)\n{\n SharedResource<int> shared_test_class(0);\n auto shared_int_accessor = shared_test_class.lock();\n BOOST_CHECK_EQUAL(0, *shared_int_accessor);\n *shared_int_accessor = 5;\n BOOST_CHECK_EQUAL(5, *shared_int_accessor);\n}\n\n\nBOOST_AUTO_TEST_CASE(Acessor_dereferencing_2)\n{\n struct TestClass\n {\n TestClass(int a) : m_a(a) { }\n void set(int a) noexcept { m_a = a; }\n int get() const noexcept { return m_a; }\n private:\n int m_a;\n };\n\n SharedResource<TestClass> shared_test_class(0);\n auto shared_int_accessor = shared_test_class.lock();\n BOOST_CHECK_EQUAL(0, shared_int_accessor->get());\n shared_int_accessor->set(5);\n BOOST_CHECK_EQUAL(5, shared_int_accessor->get());\n}\n\n<|endoftext|>"} {"text":"<commit_before>\/* Copyright (c) 2015, Daniel C. Dillon\n * All rights 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\n * notice, this list of conditions and the following disclaimer in the\n * documentation and\/or other materials provided with the distribution.\n *\n * 3. Neither the name of the copyright holder nor the names of its\n * contributors may be used to endorse or promote products derived from\n * this software without specific prior written permission.\n *\n * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS\n * \"AS IS\" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED\n * TO, 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\n#define CATCH_CONFIG_MAIN\n#include \"catch.hpp\"\n\n#include \"..\/include\/cpuaff\/cpuaff.hpp\"\n\nTEST_CASE(\"affinity_manager\", \"[affinity_manager]\")\n{\n cpuaff::affinity_manager manager;\n\n SECTION(\"affinity_manager::initialize()\")\n {\n REQUIRE(manager.initialize());\n REQUIRE(manager.has_cpus());\n\n#if defined(CPUAFF_PCI_SUPPORTED)\n REQUIRE(manager.has_pci_devices());\n#endif\n }\n\n SECTION(\"affinity_manager member functions\")\n {\n REQUIRE(manager.initialize());\n\n cpuaff::cpu cpu;\n cpuaff::cpu_set cpus;\n\n#if defined(CPUAFF_PCI_SUPPORTED)\n cpuaff::pci_device_set devices;\n cpuaff::pci_device device;\n#endif\n\n REQUIRE(manager.get_cpu_from_index(cpu, 0));\n REQUIRE(manager.get_cpu_from_id(cpu, cpu.id()));\n REQUIRE(manager.get_cpu_from_id(cpu, cpu.id().get()));\n REQUIRE(manager.get_cpu_from_spec(\n cpu,\n cpuaff::cpu_spec(cpu.socket(), cpu.core(), cpu.processing_unit())));\n\n REQUIRE(manager.get_cpus(cpus));\n REQUIRE(manager.get_cpus_by_numa(cpus, cpu.numa()));\n REQUIRE(manager.get_cpus_by_socket(cpus, cpu.socket()));\n REQUIRE(manager.get_cpus_by_core(cpus, cpu.core()));\n REQUIRE(\n manager.get_cpus_by_processing_unit(cpus, cpu.processing_unit()));\n REQUIRE(manager.get_cpus_by_socket_and_core(\n cpus, cpu.socket(), cpu.core()));\n\n#if defined(CPUAFF_PCI_SUPPORTED)\n REQUIRE(manager.get_pci_devices(devices));\n device = *devices.begin();\n REQUIRE(manager.get_pci_device_for_address(device, device.address()));\n REQUIRE(\n manager.get_pci_device_for_address(device, device.address().get()));\n REQUIRE(manager.get_pci_devices_by_spec(\n devices,\n cpuaff::pci_device_spec(device.vendor(), device.device())));\n REQUIRE(manager.get_pci_devices_by_numa(devices, device.numa()));\n REQUIRE(manager.get_pci_devices_by_vendor(devices, device.vendor()));\n REQUIRE(manager.get_nearby_cpus(cpus, device));\n#endif\n\n REQUIRE(manager.get_affinity(cpus));\n REQUIRE(cpus.size() > 0);\n\n cpuaff::cpu_set new_affinity;\n new_affinity.insert(cpu);\n REQUIRE(manager.set_affinity(new_affinity));\n REQUIRE(manager.get_affinity(cpus));\n REQUIRE(cpus.size() == new_affinity.size());\n\n if (cpus.size() == new_affinity.size())\n {\n cpuaff::cpu_set::iterator i = cpus.begin();\n cpuaff::cpu_set::iterator iend = cpus.end();\n cpuaff::cpu_set::iterator j = new_affinity.begin();\n cpuaff::cpu_set::iterator jend = new_affinity.end();\n\n for (; i != iend && j != jend; ++i, ++j)\n {\n REQUIRE((*i) == (*j));\n }\n }\n\n REQUIRE(manager.get_cpus(new_affinity));\n REQUIRE(manager.set_affinity(new_affinity));\n REQUIRE(manager.get_affinity(cpus));\n REQUIRE(cpus.size() == new_affinity.size());\n\n if (cpus.size() == new_affinity.size())\n {\n cpuaff::cpu_set::iterator i = cpus.begin();\n cpuaff::cpu_set::iterator iend = cpus.end();\n cpuaff::cpu_set::iterator j = new_affinity.begin();\n cpuaff::cpu_set::iterator jend = new_affinity.end();\n\n for (; i != iend && j != jend; ++i, ++j)\n {\n REQUIRE((*i) == (*j));\n }\n }\n\n REQUIRE(manager.pin(cpu));\n REQUIRE(manager.get_affinity(cpus));\n REQUIRE(cpus.size() == 1);\n REQUIRE(*cpus.begin() == cpu);\n }\n}\n\nTEST_CASE(\"affinity_stack\", \"[affinity_stack]\")\n{\n SECTION(\"affinity_stack member functions\")\n {\n cpuaff::affinity_manager manager;\n\n REQUIRE(manager.initialize());\n\n cpuaff::affinity_stack stack(manager);\n\n cpuaff::cpu_set original_affinity;\n cpuaff::cpu_set new_affinity;\n cpuaff::cpu_set cpus;\n\n REQUIRE(stack.get_affinity(original_affinity));\n REQUIRE(original_affinity.size() > 0);\n REQUIRE(stack.push_affinity());\n REQUIRE(stack.get_affinity(cpus));\n REQUIRE(cpus.size() == original_affinity.size());\n\n if (cpus.size() == original_affinity.size())\n {\n cpuaff::cpu_set::iterator i = cpus.begin();\n cpuaff::cpu_set::iterator iend = cpus.end();\n cpuaff::cpu_set::iterator j = original_affinity.begin();\n cpuaff::cpu_set::iterator jend = original_affinity.end();\n\n for (; i != iend && j != jend; ++i, ++j)\n {\n REQUIRE((*i) == (*j));\n }\n }\n\n new_affinity.insert(*original_affinity.begin());\n\n REQUIRE(stack.set_affinity(new_affinity));\n REQUIRE(stack.get_affinity(cpus));\n REQUIRE(cpus.size() == 1);\n REQUIRE(*cpus.begin() == *new_affinity.begin());\n\n REQUIRE(stack.pop_affinity());\n REQUIRE(stack.get_affinity(cpus));\n REQUIRE(cpus.size() == original_affinity.size());\n\n if (cpus.size() == original_affinity.size())\n {\n cpuaff::cpu_set::iterator i = cpus.begin();\n cpuaff::cpu_set::iterator iend = cpus.end();\n cpuaff::cpu_set::iterator j = original_affinity.begin();\n cpuaff::cpu_set::iterator jend = original_affinity.end();\n\n for (; i != iend && j != jend; ++i, ++j)\n {\n REQUIRE((*i) == (*j));\n }\n }\n }\n}\n\nTEST_CASE(\"round_robin_allocator\", \"[round_robin_allocator]\")\n{\n SECTION(\"round_robin_allocator member functions\")\n {\n cpuaff::affinity_manager manager;\n\n REQUIRE(manager.initialize());\n\n cpuaff::round_robin_allocator allocator;\n cpuaff::cpu_set cpus;\n cpuaff::cpu_set allocated_cpus;\n cpuaff::cpu cpu;\n\n REQUIRE(manager.get_cpus(cpus));\n REQUIRE(allocator.initialize(cpus));\n\n for (int i = 0; i < cpus.size() * 2; ++i)\n {\n cpu = allocator.allocate();\n bool test = cpu.socket() >= 0 && cpu.core() >= 0 &&\n cpu.processing_unit() >= 0;\n REQUIRE(test);\n }\n\n REQUIRE(allocator.allocate(allocated_cpus, 4));\n\n bool test =\n allocated_cpus.size() == 4 ||\n (allocated_cpus.size() < 4 && allocated_cpus.size() == cpus.size());\n REQUIRE(test);\n }\n}\n\nTEST_CASE(\"native_cpu_mapper\", \"[native_cpu_mapper]\")\n{\n SECTION(\"native_cpu_mapper member functions\")\n {\n cpuaff::affinity_manager manager;\n\n REQUIRE(manager.initialize());\n\n cpuaff::native_cpu_mapper mapper;\n\n if (mapper.initialize(manager))\n {\n cpuaff::cpu_set cpus;\n manager.get_cpus(cpus);\n\n cpuaff::cpu_set::iterator i = cpus.begin();\n cpuaff::cpu_set::iterator iend = cpus.end();\n\n for (; i != iend; ++i)\n {\n cpuaff::native_cpu_mapper::native_cpu_wrapper_type native;\n cpuaff::cpu cpu;\n\n REQUIRE(mapper.get_native_from_cpu(native, *i));\n REQUIRE(mapper.get_cpu_from_native(cpu, native));\n REQUIRE(mapper.get_cpu_from_native(cpu, native.get()));\n }\n }\n }\n}\n<commit_msg>changed test to only test for pci devices if they could be properly loaded<commit_after>\/* Copyright (c) 2015, Daniel C. Dillon\n * All rights 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\n * notice, this list of conditions and the following disclaimer in the\n * documentation and\/or other materials provided with the distribution.\n *\n * 3. Neither the name of the copyright holder nor the names of its\n * contributors may be used to endorse or promote products derived from\n * this software without specific prior written permission.\n *\n * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS\n * \"AS IS\" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED\n * TO, 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\n#define CATCH_CONFIG_MAIN\n#include \"catch.hpp\"\n\n#include \"..\/include\/cpuaff\/cpuaff.hpp\"\n\nTEST_CASE(\"affinity_manager\", \"[affinity_manager]\")\n{\n cpuaff::affinity_manager manager;\n\n SECTION(\"affinity_manager::initialize()\")\n {\n REQUIRE(manager.initialize());\n REQUIRE(manager.has_cpus());\n }\n\n SECTION(\"affinity_manager member functions\")\n {\n REQUIRE(manager.initialize());\n\n cpuaff::cpu cpu;\n cpuaff::cpu_set cpus;\n\n#if defined(CPUAFF_PCI_SUPPORTED)\n cpuaff::pci_device_set devices;\n cpuaff::pci_device device;\n#endif\n\n REQUIRE(manager.get_cpu_from_index(cpu, 0));\n REQUIRE(manager.get_cpu_from_id(cpu, cpu.id()));\n REQUIRE(manager.get_cpu_from_id(cpu, cpu.id().get()));\n REQUIRE(manager.get_cpu_from_spec(\n cpu,\n cpuaff::cpu_spec(cpu.socket(), cpu.core(), cpu.processing_unit())));\n\n REQUIRE(manager.get_cpus(cpus));\n REQUIRE(manager.get_cpus_by_numa(cpus, cpu.numa()));\n REQUIRE(manager.get_cpus_by_socket(cpus, cpu.socket()));\n REQUIRE(manager.get_cpus_by_core(cpus, cpu.core()));\n REQUIRE(\n manager.get_cpus_by_processing_unit(cpus, cpu.processing_unit()));\n REQUIRE(manager.get_cpus_by_socket_and_core(\n cpus, cpu.socket(), cpu.core()));\n\n#if defined(CPUAFF_PCI_SUPPORTED)\n if (manager.has_pci_devices())\n {\n REQUIRE(manager.get_pci_devices(devices));\n device = *devices.begin();\n REQUIRE(manager.get_pci_device_for_address(device, device.address()));\n REQUIRE(\n manager.get_pci_device_for_address(device, device.address().get()));\n REQUIRE(manager.get_pci_devices_by_spec(\n devices,\n cpuaff::pci_device_spec(device.vendor(), device.device())));\n REQUIRE(manager.get_pci_devices_by_numa(devices, device.numa()));\n REQUIRE(manager.get_pci_devices_by_vendor(devices, device.vendor()));\n REQUIRE(manager.get_nearby_cpus(cpus, device));\n }\n#endif\n\n REQUIRE(manager.get_affinity(cpus));\n REQUIRE(cpus.size() > 0);\n\n cpuaff::cpu_set new_affinity;\n new_affinity.insert(cpu);\n REQUIRE(manager.set_affinity(new_affinity));\n REQUIRE(manager.get_affinity(cpus));\n REQUIRE(cpus.size() == new_affinity.size());\n\n if (cpus.size() == new_affinity.size())\n {\n cpuaff::cpu_set::iterator i = cpus.begin();\n cpuaff::cpu_set::iterator iend = cpus.end();\n cpuaff::cpu_set::iterator j = new_affinity.begin();\n cpuaff::cpu_set::iterator jend = new_affinity.end();\n\n for (; i != iend && j != jend; ++i, ++j)\n {\n REQUIRE((*i) == (*j));\n }\n }\n\n REQUIRE(manager.get_cpus(new_affinity));\n REQUIRE(manager.set_affinity(new_affinity));\n REQUIRE(manager.get_affinity(cpus));\n REQUIRE(cpus.size() == new_affinity.size());\n\n if (cpus.size() == new_affinity.size())\n {\n cpuaff::cpu_set::iterator i = cpus.begin();\n cpuaff::cpu_set::iterator iend = cpus.end();\n cpuaff::cpu_set::iterator j = new_affinity.begin();\n cpuaff::cpu_set::iterator jend = new_affinity.end();\n\n for (; i != iend && j != jend; ++i, ++j)\n {\n REQUIRE((*i) == (*j));\n }\n }\n\n REQUIRE(manager.pin(cpu));\n REQUIRE(manager.get_affinity(cpus));\n REQUIRE(cpus.size() == 1);\n REQUIRE(*cpus.begin() == cpu);\n }\n}\n\nTEST_CASE(\"affinity_stack\", \"[affinity_stack]\")\n{\n SECTION(\"affinity_stack member functions\")\n {\n cpuaff::affinity_manager manager;\n\n REQUIRE(manager.initialize());\n\n cpuaff::affinity_stack stack(manager);\n\n cpuaff::cpu_set original_affinity;\n cpuaff::cpu_set new_affinity;\n cpuaff::cpu_set cpus;\n\n REQUIRE(stack.get_affinity(original_affinity));\n REQUIRE(original_affinity.size() > 0);\n REQUIRE(stack.push_affinity());\n REQUIRE(stack.get_affinity(cpus));\n REQUIRE(cpus.size() == original_affinity.size());\n\n if (cpus.size() == original_affinity.size())\n {\n cpuaff::cpu_set::iterator i = cpus.begin();\n cpuaff::cpu_set::iterator iend = cpus.end();\n cpuaff::cpu_set::iterator j = original_affinity.begin();\n cpuaff::cpu_set::iterator jend = original_affinity.end();\n\n for (; i != iend && j != jend; ++i, ++j)\n {\n REQUIRE((*i) == (*j));\n }\n }\n\n new_affinity.insert(*original_affinity.begin());\n\n REQUIRE(stack.set_affinity(new_affinity));\n REQUIRE(stack.get_affinity(cpus));\n REQUIRE(cpus.size() == 1);\n REQUIRE(*cpus.begin() == *new_affinity.begin());\n\n REQUIRE(stack.pop_affinity());\n REQUIRE(stack.get_affinity(cpus));\n REQUIRE(cpus.size() == original_affinity.size());\n\n if (cpus.size() == original_affinity.size())\n {\n cpuaff::cpu_set::iterator i = cpus.begin();\n cpuaff::cpu_set::iterator iend = cpus.end();\n cpuaff::cpu_set::iterator j = original_affinity.begin();\n cpuaff::cpu_set::iterator jend = original_affinity.end();\n\n for (; i != iend && j != jend; ++i, ++j)\n {\n REQUIRE((*i) == (*j));\n }\n }\n }\n}\n\nTEST_CASE(\"round_robin_allocator\", \"[round_robin_allocator]\")\n{\n SECTION(\"round_robin_allocator member functions\")\n {\n cpuaff::affinity_manager manager;\n\n REQUIRE(manager.initialize());\n\n cpuaff::round_robin_allocator allocator;\n cpuaff::cpu_set cpus;\n cpuaff::cpu_set allocated_cpus;\n cpuaff::cpu cpu;\n\n REQUIRE(manager.get_cpus(cpus));\n REQUIRE(allocator.initialize(cpus));\n\n for (int i = 0; i < cpus.size() * 2; ++i)\n {\n cpu = allocator.allocate();\n bool test = cpu.socket() >= 0 && cpu.core() >= 0 &&\n cpu.processing_unit() >= 0;\n REQUIRE(test);\n }\n\n REQUIRE(allocator.allocate(allocated_cpus, 4));\n\n bool test =\n allocated_cpus.size() == 4 ||\n (allocated_cpus.size() < 4 && allocated_cpus.size() == cpus.size());\n REQUIRE(test);\n }\n}\n\nTEST_CASE(\"native_cpu_mapper\", \"[native_cpu_mapper]\")\n{\n SECTION(\"native_cpu_mapper member functions\")\n {\n cpuaff::affinity_manager manager;\n\n REQUIRE(manager.initialize());\n\n cpuaff::native_cpu_mapper mapper;\n\n if (mapper.initialize(manager))\n {\n cpuaff::cpu_set cpus;\n manager.get_cpus(cpus);\n\n cpuaff::cpu_set::iterator i = cpus.begin();\n cpuaff::cpu_set::iterator iend = cpus.end();\n\n for (; i != iend; ++i)\n {\n cpuaff::native_cpu_mapper::native_cpu_wrapper_type native;\n cpuaff::cpu cpu;\n\n REQUIRE(mapper.get_native_from_cpu(native, *i));\n REQUIRE(mapper.get_cpu_from_native(cpu, native));\n REQUIRE(mapper.get_cpu_from_native(cpu, native.get()));\n }\n }\n }\n}\n<|endoftext|>"} {"text":"<commit_before>#include \".\/importer.h\"\n#include <assimp\/scene.h>\n#include <assimp\/postprocess.h>\n#include <QDebug>\n#include <string>\n#include <vector>\n#include \".\/utils\/path_helper.h\"\n\nImporter::Importer()\n{\n}\n\nImporter::~Importer()\n{\n}\n\nconst aiScene *Importer::readScene(std::string filename)\n{\n if (scenes.count(filename))\n return scenes[filename];\n\n std::string path = absolutePathOfProjectRelativePath(filename);\n const aiScene *scene = importer.ReadFile(\n path, aiProcess_CalcTangentSpace | aiProcess_Triangulate |\n aiProcess_JoinIdenticalVertices | aiProcess_SortByPType);\n\n if (!scene)\n {\n qCritical() << \"Could not load \" << path.c_str();\n exit(1);\n }\n\n scenes[filename] = scene;\n\n return scene;\n}\n\nstd::shared_ptr<Graphics::Mesh> Importer::import(std::string filename,\n int meshIndex)\n{\n const aiScene *scene = readScene(filename);\n auto importedMesh = scene->mMeshes[meshIndex];\n return std::shared_ptr<Graphics::Mesh>(new Graphics::Mesh(\n importedMesh, scene->mMaterials[importedMesh->mMaterialIndex]));\n}\n\nstd::vector<std::shared_ptr<Graphics::Mesh>>\nImporter::importAll(std::string filename)\n{\n const aiScene *scene = readScene(filename);\n\n std::vector<std::shared_ptr<Graphics::Mesh>> result;\n for (unsigned int i = 0; i < scene->mNumMeshes; ++i)\n result.push_back(import(filename, i));\n\n return result;\n}\n\n<commit_msg>Add debug message to Importer.<commit_after>#include \".\/importer.h\"\n#include <assimp\/scene.h>\n#include <assimp\/postprocess.h>\n#include <QDebug>\n#include <string>\n#include <vector>\n#include \".\/utils\/path_helper.h\"\n\nImporter::Importer()\n{\n}\n\nImporter::~Importer()\n{\n}\n\nconst aiScene *Importer::readScene(std::string filename)\n{\n qDebug() << \"readScene:\" << filename.c_str();\n\n if (scenes.count(filename))\n return scenes[filename];\n\n std::string path = absolutePathOfProjectRelativePath(filename);\n const aiScene *scene = importer.ReadFile(\n path, aiProcess_CalcTangentSpace | aiProcess_Triangulate |\n aiProcess_JoinIdenticalVertices | aiProcess_SortByPType);\n\n if (!scene)\n {\n qCritical() << \"Could not load \" << path.c_str();\n exit(1);\n }\n\n scenes[filename] = scene;\n\n return scene;\n}\n\nstd::shared_ptr<Graphics::Mesh> Importer::import(std::string filename,\n int meshIndex)\n{\n const aiScene *scene = readScene(filename);\n auto importedMesh = scene->mMeshes[meshIndex];\n return std::shared_ptr<Graphics::Mesh>(new Graphics::Mesh(\n importedMesh, scene->mMaterials[importedMesh->mMaterialIndex]));\n}\n\nstd::vector<std::shared_ptr<Graphics::Mesh>>\nImporter::importAll(std::string filename)\n{\n const aiScene *scene = readScene(filename);\n\n std::vector<std::shared_ptr<Graphics::Mesh>> result;\n for (unsigned int i = 0; i < scene->mNumMeshes; ++i)\n result.push_back(import(filename, i));\n\n return result;\n}\n\n<|endoftext|>"} {"text":"<commit_before>\/* -*- coding: utf-8; mode: c++; tab-width: 3; indent-tabs-mode: nil -*-\n\nCopyright 2010, 2011, 2012, 2013\nRaffaello D. Di Napoli\n\nThis file is part of Application-Building Components (henceforth referred to as ABC).\n\nABC is free software: you can redistribute it and\/or modify it under the terms of the GNU General\nPublic License as published by the Free Software Foundation, either version 3 of the License, or (at\nyour option) any later version.\n\nABC is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY; without even the\nimplied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public\nLicense for more details.\n\nYou should have received a copy of the GNU General Public License along with ABC. If not, see\n<http:\/\/www.gnu.org\/licenses\/>.\n--------------------------------------------------------------------------------------------------*\/\n\n#include <abc\/core.hxx>\n#include <abc\/iostream.hxx>\n#include <abc\/trace.hxx>\n\n\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ abc::stream_base\n\n\nnamespace abc {\n\nstream_base::stream_base() :\n m_enc(text::encoding::unknown),\n m_lterm(text::line_terminator::unknown) {\n}\n\n\n\/*virtual*\/ stream_base::~stream_base() {\n}\n\n\n\/*virtual*\/ void stream_base::set_encoding(text::encoding enc) {\n m_enc = enc;\n}\n\n\n\/*virtual*\/ void stream_base::set_line_terminator(text::line_terminator lterm) {\n m_lterm = lterm;\n}\n\n} \/\/namespace abc\n\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ abc::istream\n\n\nnamespace abc {\n\n\/*virtual*\/ istream::~istream() {\n}\n\n} \/\/namespace abc\n\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ abc::ostream\n\n\nnamespace abc {\n\n\/*virtual*\/ ostream::~ostream() {\n}\n\n\n\/*virtual*\/ void ostream::flush() {\n}\n\n\n_ostream_print_helper_impl::_ostream_print_helper_impl(ostream * pos, istr const & sFormat) :\n m_pos(pos),\n \/\/ write_format_up_to_next_repl() will increment this to 0 or set it to a non-negative number.\n m_iSubstArg(unsigned(-1)),\n m_sFormat(sFormat),\n m_itFormatToWriteBegin(sFormat.cbegin()) {\n}\n\n\nvoid _ostream_print_helper_impl::run() {\n \/\/ Since this specialization has no replacements, verify that the format string doesn’t specify\n \/\/ any either.\n if (write_format_up_to_next_repl()) {\n ABC_THROW(index_error, (m_iSubstArg));\n }\n}\n\n\nvoid _ostream_print_helper_impl::throw_index_error() {\n ABC_THROW(index_error, (m_iSubstArg));\n}\n\n\nbool _ostream_print_helper_impl::write_format_up_to_next_repl() {\n ABC_TRACE_FN((this));\n\n \/\/ Search for the next replacement, if any.\n istr::const_iterator it(m_itFormatToWriteBegin), itReplFieldBegin, itEnd(m_sFormat.cend());\n char_t ch;\n for (;;) {\n if (it >= itEnd) {\n \/\/ The format string is over; write any characters not yet written.\n write_format_up_to(itEnd);\n \/\/ Report that no more replacement fields were found.\n return false;\n }\n ch = *it++;\n if (ch == CL('{') || ch == CL('}')) {\n if (ch == CL('{')) {\n \/\/ Mark the beginning of the replacement field.\n itReplFieldBegin = it - 1;\n if (it >= itEnd) {\n throw_syntax_error(SL(\"unmatched '{' in format string\"), itReplFieldBegin);\n }\n ch = *it;\n if (ch != CL('{')) {\n \/\/ We found the beginning of a replacement field.\n break;\n }\n } else if (ch == CL('}')) {\n if (it >= itEnd || *it != CL('}')) {\n throw_syntax_error(SL(\"single '}' encountered in format string\"), it - 1);\n }\n }\n \/\/ Convert “{{” into “{” or “}}” into “}”.\n \/\/ Write up to and including the first brace.\n write_format_up_to(it);\n \/\/ The next call to write_format_up_to() will skip the second brace.\n m_itFormatToWriteBegin = ++it;\n }\n }\n\n \/\/ Check if we have an argument index.\n if (ch >= CL('0') && ch <= CL('9')) {\n \/\/ Consume as many digits as there are, and convert them into the argument index.\n unsigned iArg(0);\n do {\n iArg *= 10;\n iArg += unsigned(ch - CL('0'));\n } while (++it < itEnd && (ch = *it, ch >= CL('0') && ch <= CL('9')));\n if (it >= itEnd) {\n throw_syntax_error(SL(\"unmatched '{' in format string\"), itReplFieldBegin);\n }\n \/\/ Save this index as the last used one.\n m_iSubstArg = iArg;\n } else {\n \/\/ The argument index is missing, so just use the next one.\n ++m_iSubstArg;\n }\n\n \/\/ Check for a conversion specifier; defaults to string.\n char_t chConversion(CL('s'));\n if (ch == CL('!')) {\n if (++it >= itEnd) {\n throw_syntax_error(SL(\"expected conversion specifier\"), it);\n }\n ch = *it;\n switch (ch) {\n case CL('s'):\n\/\/ TODO: case CL('r'):\n\/\/ TODO: case CL('a'):\n chConversion = ch;\n ABC_UNUSED_ARG(chConversion);\n break;\n default:\n throw_syntax_error(SL(\"unknown conversion specifier\"), it);\n }\n if (++it >= itEnd) {\n throw_syntax_error(SL(\"unmatched '{' in format string\"), itReplFieldBegin);\n }\n ch = *it;\n }\n\n \/\/ Check for a format specification.\n if (ch == CL(':')) {\n if (++it >= itEnd) {\n throw_syntax_error(SL(\"expected format specification\"), it);\n }\n m_pchReplFormatSpecBegin = it.base();\n \/\/ Find the end of the replacement field.\n it = m_sFormat.find(U32CL('}'), it);\n if (it == m_sFormat.cend()) {\n throw_syntax_error(SL(\"unmatched '{' in format string\"), itReplFieldBegin);\n }\n m_pchReplFormatSpecEnd = it.base();\n } else {\n \/\/ If there’s no format specification, it must be the end of the replacement field.\n if (ch != CL('}')) {\n throw_syntax_error(SL(\"unmatched '{' in format string\"), itReplFieldBegin);\n }\n \/\/ Set the format specification to nothing.\n m_pchReplFormatSpecBegin = NULL;\n m_pchReplFormatSpecEnd = NULL;\n }\n\n \/\/ Write the format string characters up to the beginning of the replacement.\n write_format_up_to(itReplFieldBegin);\n \/\/ Update this, so the next call to write_format_up_to() will skip over this replacement field.\n m_itFormatToWriteBegin = it + 1 \/*'}'*\/;\n \/\/ Report that a substitution must be written.\n return true;\n}\n\n\nvoid _ostream_print_helper_impl::throw_syntax_error(\n istr const & sDescription, istr::const_iterator it\n) const {\n \/\/ +1 because the first character is 1, to human beings.\n ABC_THROW(syntax_error, (sDescription, m_sFormat, unsigned(it - m_sFormat.cbegin() + 1)));\n}\n\n\nvoid _ostream_print_helper_impl::write_format_up_to(istr::const_iterator itUpTo) {\n ABC_TRACE_FN((this\/*, itUpTo*\/));\n\n if (itUpTo > m_itFormatToWriteBegin) {\n m_pos->write_raw(\n m_itFormatToWriteBegin.base(),\n sizeof(char_t) * size_t(itUpTo - m_itFormatToWriteBegin),\n text::utf_traits<>::host_encoding\n );\n m_itFormatToWriteBegin = itUpTo;\n }\n}\n\n} \/\/namespace abc\n\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ abc::iostream\n\n\nnamespace abc {\n\niostream::iostream() :\n stream_base(),\n istream(),\n ostream() {\n}\n\n\n\/*virtual*\/ iostream::~iostream() {\n}\n\n} \/\/namespace abc\n\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n<commit_msg>Include iterator in ABC_TRACE_FN() arguments<commit_after>\/* -*- coding: utf-8; mode: c++; tab-width: 3; indent-tabs-mode: nil -*-\n\nCopyright 2010, 2011, 2012, 2013\nRaffaello D. Di Napoli\n\nThis file is part of Application-Building Components (henceforth referred to as ABC).\n\nABC is free software: you can redistribute it and\/or modify it under the terms of the GNU General\nPublic License as published by the Free Software Foundation, either version 3 of the License, or (at\nyour option) any later version.\n\nABC is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY; without even the\nimplied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public\nLicense for more details.\n\nYou should have received a copy of the GNU General Public License along with ABC. If not, see\n<http:\/\/www.gnu.org\/licenses\/>.\n--------------------------------------------------------------------------------------------------*\/\n\n#include <abc\/core.hxx>\n#include <abc\/iostream.hxx>\n#include <abc\/trace.hxx>\n\n\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ abc::stream_base\n\n\nnamespace abc {\n\nstream_base::stream_base() :\n m_enc(text::encoding::unknown),\n m_lterm(text::line_terminator::unknown) {\n}\n\n\n\/*virtual*\/ stream_base::~stream_base() {\n}\n\n\n\/*virtual*\/ void stream_base::set_encoding(text::encoding enc) {\n m_enc = enc;\n}\n\n\n\/*virtual*\/ void stream_base::set_line_terminator(text::line_terminator lterm) {\n m_lterm = lterm;\n}\n\n} \/\/namespace abc\n\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ abc::istream\n\n\nnamespace abc {\n\n\/*virtual*\/ istream::~istream() {\n}\n\n} \/\/namespace abc\n\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ abc::ostream\n\n\nnamespace abc {\n\n\/*virtual*\/ ostream::~ostream() {\n}\n\n\n\/*virtual*\/ void ostream::flush() {\n}\n\n\n_ostream_print_helper_impl::_ostream_print_helper_impl(ostream * pos, istr const & sFormat) :\n m_pos(pos),\n \/\/ write_format_up_to_next_repl() will increment this to 0 or set it to a non-negative number.\n m_iSubstArg(unsigned(-1)),\n m_sFormat(sFormat),\n m_itFormatToWriteBegin(sFormat.cbegin()) {\n}\n\n\nvoid _ostream_print_helper_impl::run() {\n \/\/ Since this specialization has no replacements, verify that the format string doesn’t specify\n \/\/ any either.\n if (write_format_up_to_next_repl()) {\n ABC_THROW(index_error, (m_iSubstArg));\n }\n}\n\n\nvoid _ostream_print_helper_impl::throw_index_error() {\n ABC_THROW(index_error, (m_iSubstArg));\n}\n\n\nbool _ostream_print_helper_impl::write_format_up_to_next_repl() {\n ABC_TRACE_FN((this));\n\n \/\/ Search for the next replacement, if any.\n istr::const_iterator it(m_itFormatToWriteBegin), itReplFieldBegin, itEnd(m_sFormat.cend());\n char_t ch;\n for (;;) {\n if (it >= itEnd) {\n \/\/ The format string is over; write any characters not yet written.\n write_format_up_to(itEnd);\n \/\/ Report that no more replacement fields were found.\n return false;\n }\n ch = *it++;\n if (ch == CL('{') || ch == CL('}')) {\n if (ch == CL('{')) {\n \/\/ Mark the beginning of the replacement field.\n itReplFieldBegin = it - 1;\n if (it >= itEnd) {\n throw_syntax_error(SL(\"unmatched '{' in format string\"), itReplFieldBegin);\n }\n ch = *it;\n if (ch != CL('{')) {\n \/\/ We found the beginning of a replacement field.\n break;\n }\n } else if (ch == CL('}')) {\n if (it >= itEnd || *it != CL('}')) {\n throw_syntax_error(SL(\"single '}' encountered in format string\"), it - 1);\n }\n }\n \/\/ Convert “{{” into “{” or “}}” into “}”.\n \/\/ Write up to and including the first brace.\n write_format_up_to(it);\n \/\/ The next call to write_format_up_to() will skip the second brace.\n m_itFormatToWriteBegin = ++it;\n }\n }\n\n \/\/ Check if we have an argument index.\n if (ch >= CL('0') && ch <= CL('9')) {\n \/\/ Consume as many digits as there are, and convert them into the argument index.\n unsigned iArg(0);\n do {\n iArg *= 10;\n iArg += unsigned(ch - CL('0'));\n } while (++it < itEnd && (ch = *it, ch >= CL('0') && ch <= CL('9')));\n if (it >= itEnd) {\n throw_syntax_error(SL(\"unmatched '{' in format string\"), itReplFieldBegin);\n }\n \/\/ Save this index as the last used one.\n m_iSubstArg = iArg;\n } else {\n \/\/ The argument index is missing, so just use the next one.\n ++m_iSubstArg;\n }\n\n \/\/ Check for a conversion specifier; defaults to string.\n char_t chConversion(CL('s'));\n if (ch == CL('!')) {\n if (++it >= itEnd) {\n throw_syntax_error(SL(\"expected conversion specifier\"), it);\n }\n ch = *it;\n switch (ch) {\n case CL('s'):\n\/\/ TODO: case CL('r'):\n\/\/ TODO: case CL('a'):\n chConversion = ch;\n ABC_UNUSED_ARG(chConversion);\n break;\n default:\n throw_syntax_error(SL(\"unknown conversion specifier\"), it);\n }\n if (++it >= itEnd) {\n throw_syntax_error(SL(\"unmatched '{' in format string\"), itReplFieldBegin);\n }\n ch = *it;\n }\n\n \/\/ Check for a format specification.\n if (ch == CL(':')) {\n if (++it >= itEnd) {\n throw_syntax_error(SL(\"expected format specification\"), it);\n }\n m_pchReplFormatSpecBegin = it.base();\n \/\/ Find the end of the replacement field.\n it = m_sFormat.find(U32CL('}'), it);\n if (it == m_sFormat.cend()) {\n throw_syntax_error(SL(\"unmatched '{' in format string\"), itReplFieldBegin);\n }\n m_pchReplFormatSpecEnd = it.base();\n } else {\n \/\/ If there’s no format specification, it must be the end of the replacement field.\n if (ch != CL('}')) {\n throw_syntax_error(SL(\"unmatched '{' in format string\"), itReplFieldBegin);\n }\n \/\/ Set the format specification to nothing.\n m_pchReplFormatSpecBegin = NULL;\n m_pchReplFormatSpecEnd = NULL;\n }\n\n \/\/ Write the format string characters up to the beginning of the replacement.\n write_format_up_to(itReplFieldBegin);\n \/\/ Update this, so the next call to write_format_up_to() will skip over this replacement field.\n m_itFormatToWriteBegin = it + 1 \/*'}'*\/;\n \/\/ Report that a substitution must be written.\n return true;\n}\n\n\nvoid _ostream_print_helper_impl::throw_syntax_error(\n istr const & sDescription, istr::const_iterator it\n) const {\n \/\/ +1 because the first character is 1, to human beings.\n ABC_THROW(syntax_error, (sDescription, m_sFormat, unsigned(it - m_sFormat.cbegin() + 1)));\n}\n\n\nvoid _ostream_print_helper_impl::write_format_up_to(istr::const_iterator itUpTo) {\n ABC_TRACE_FN((this, itUpTo));\n\n if (itUpTo > m_itFormatToWriteBegin) {\n m_pos->write_raw(\n m_itFormatToWriteBegin.base(),\n sizeof(char_t) * size_t(itUpTo - m_itFormatToWriteBegin),\n text::utf_traits<>::host_encoding\n );\n m_itFormatToWriteBegin = itUpTo;\n }\n}\n\n} \/\/namespace abc\n\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ abc::iostream\n\n\nnamespace abc {\n\niostream::iostream() :\n stream_base(),\n istream(),\n ostream() {\n}\n\n\n\/*virtual*\/ iostream::~iostream() {\n}\n\n} \/\/namespace abc\n\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n<|endoftext|>"} {"text":"<commit_before>\/\/ stdafx.cpp : source file that includes just the standard includes\n\/\/ Boost Unit Test Project.pch will be the pre-compiled header\n\/\/ stdafx.obj will contain the pre-compiled type information\n\n#define BOOST_TEST_MODULE MyTest\n\n#include \"stdafx.h\"\n#include <stdlib.h>\n#include <string>\n#include <exception>\n#include <boost\/filesystem.hpp>\n\nusing namespace std;\nusing namespace boost::filesystem;\n\n\nstring get_env(const string& env)\n{\n\t\/\/ getenv is depracated for microsoft compiler\n#pragma warning(disable:4996)\n\tauto c_res = getenv(env.c_str());\n#pragma warning(default:4996)\n\n\tif(!c_res)\n\t\tthrow logic_error(\"Environment variable \"s + env + \" is not set.\");\n\n\treturn c_res;\n}\n\nstring get_test_file_full_path(const string& filename)\n{\n\tpath p(get_env(\"TEST_FILES_PATH\"));\n\tp \/= filename;\n\n\tif (!exists(p))\n\t\tthrow logic_error(p.string() + \": don't exist. Did you set TEST_FILES_PATH environment variable correctly?\");\n\n\treturn p.string();\n}\n<commit_msg>setting TEST_FILES_PATH is now optional<commit_after>\/\/ stdafx.cpp : source file that includes just the standard includes\n\/\/ Boost Unit Test Project.pch will be the pre-compiled header\n\/\/ stdafx.obj will contain the pre-compiled type information\n\n#define BOOST_TEST_MODULE MyTest\n\n#include \"stdafx.h\"\n#include <stdlib.h>\n#include <string>\n#include <exception>\n#include <boost\/filesystem.hpp>\n#include <Windows.h>\n\nusing namespace std;\nusing namespace boost::filesystem;\n\nstring get_default_test_files_dir_path()\n{\n\tchar pBuf[MAX_PATH + 1];\n\tint bytes = GetModuleFileNameA(NULL, pBuf, MAX_PATH);\n\tpath p(pBuf);\n\tp.remove_filename();\n\tp \/= \"..\/..\/test_files\/\";\n\tif (!exists(p))\n\t\tthrow logic_error(\"test_files path not found. Please set TEST_FILES_PATH environment variable.\");\n\n\treturn p.string();\n}\n\nstring get_env(const string& env)\n{\n\t\/\/ getenv is depracated for microsoft compiler\n#pragma warning(disable:4996)\n\tauto c_res = getenv(env.c_str());\n#pragma warning(default:4996)\n\n\treturn (c_res ? c_res : get_default_test_files_dir_path());\n}\n\nstring get_test_file_full_path(const string& filename)\n{\n\tpath p(get_env(\"TEST_FILES_PATH\"));\n\tp \/= filename;\n\n\tif (!exists(p))\n\t\tthrow logic_error(p.string() + \": don't exist. Did you set TEST_FILES_PATH environment variable correctly?\");\n\n\treturn p.string();\n}\n<|endoftext|>"} {"text":"<commit_before>\/* -*- Mode: C++; tab-width: 4; indent-tabs-mode: nil; c-basic-offset: 4 -*- *\/\n\/*\n * This file is part of the LibreOffice project.\n *\n * This Source Code Form is subject to the terms of the Mozilla Public\n * License, v. 2.0. If a copy of the MPL was not distributed with this\n * file, You can obtain one at http:\/\/mozilla.org\/MPL\/2.0\/.\n *\n * This file incorporates work covered by the following license notice:\n *\n * Licensed to the Apache Software Foundation (ASF) under one or more\n * contributor license agreements. See the NOTICE file distributed\n * with this work for additional information regarding copyright\n * ownership. The ASF licenses this file to you under the Apache\n * License, Version 2.0 (the \"License\"); you may not use this file\n * except in compliance with the License. You may obtain a copy of\n * the License at http:\/\/www.apache.org\/licenses\/LICENSE-2.0 .\n *\/\n\n#include <sal\/config.h>\n\n#include <stdio.h>\n#include <stdlib.h>\n#include <setjmp.h>\n#include <jpeglib.h>\n#include <jerror.h>\n\n#include <com\/sun\/star\/task\/XStatusIndicator.hpp>\n#include <osl\/diagnose.h>\n\nextern \"C\" {\n#include \"transupp.h\"\n}\n\n#include \"jpeg.h\"\n#include <JpegReader.hxx>\n#include <JpegWriter.hxx>\n#include <boost\/scoped_array.hpp>\n\nstruct ErrorManagerStruct\n{\n jpeg_error_mgr pub;\n jmp_buf setjmp_buffer;\n};\n\nextern \"C\" void errorExit (j_common_ptr cinfo)\n{\n ErrorManagerStruct * error = (ErrorManagerStruct *) cinfo->err;\n (*cinfo->err->output_message) (cinfo);\n longjmp(error->setjmp_buffer, 1);\n}\n\nextern \"C\" void outputMessage (j_common_ptr cinfo)\n{\n char buffer[JMSG_LENGTH_MAX];\n (*cinfo->err->format_message) (cinfo, buffer);\n}\n\nvoid ReadJPEG( JPEGReader* pJPEGReader, void* pInputStream, long* pLines,\n Size const & previewSize )\n{\n jpeg_decompress_struct cinfo;\n ErrorManagerStruct jerr;\n JPEGCreateBitmapParam aCreateBitmapParam;\n unsigned char * pDIB;\n unsigned char * pTmp;\n long nWidth;\n long nHeight;\n long nAlignedWidth;\n JSAMPLE* aRangeLimit;\n boost::scoped_array<unsigned char> pScanLineBuffer;\n long nScanLineBufferComponents;\n\n if ( setjmp( jerr.setjmp_buffer ) )\n {\n jpeg_destroy_decompress( &cinfo );\n return;\n }\n\n cinfo.err = jpeg_std_error( &jerr.pub );\n jerr.pub.error_exit = errorExit;\n jerr.pub.output_message = outputMessage;\n\n jpeg_create_decompress( &cinfo );\n jpeg_svstream_src( &cinfo, pInputStream );\n jpeg_read_header( &cinfo, TRUE );\n\n cinfo.scale_num = 1;\n cinfo.scale_denom = 1;\n cinfo.output_gamma = 1.0;\n cinfo.raw_data_out = FALSE;\n cinfo.quantize_colors = FALSE;\n if ( cinfo.jpeg_color_space == JCS_YCbCr )\n cinfo.out_color_space = JCS_RGB;\n else if ( cinfo.jpeg_color_space == JCS_YCCK )\n cinfo.out_color_space = JCS_CMYK;\n\n OSL_ASSERT(cinfo.out_color_space == JCS_CMYK || cinfo.out_color_space == JCS_GRAYSCALE || cinfo.out_color_space == JCS_RGB);\n\n \/* change scale for preview import *\/\n long nPreviewWidth = previewSize.Width();\n long nPreviewHeight = previewSize.Height();\n if( nPreviewWidth || nPreviewHeight )\n {\n if( nPreviewWidth == 0 )\n {\n nPreviewWidth = ( cinfo.image_width * nPreviewHeight ) \/ cinfo.image_height;\n if( nPreviewWidth <= 0 )\n {\n nPreviewWidth = 1;\n }\n }\n else if( nPreviewHeight == 0 )\n {\n nPreviewHeight = ( cinfo.image_height * nPreviewWidth ) \/ cinfo.image_width;\n if( nPreviewHeight <= 0 )\n {\n nPreviewHeight = 1;\n }\n }\n\n for( cinfo.scale_denom = 1; cinfo.scale_denom < 8; cinfo.scale_denom *= 2 )\n {\n if( cinfo.image_width < nPreviewWidth * cinfo.scale_denom )\n break;\n if( cinfo.image_height < nPreviewHeight * cinfo.scale_denom )\n break;\n }\n\n if( cinfo.scale_denom > 1 )\n {\n cinfo.dct_method = JDCT_FASTEST;\n cinfo.do_fancy_upsampling = FALSE;\n cinfo.do_block_smoothing = FALSE;\n }\n }\n\n jpeg_start_decompress( &cinfo );\n\n nWidth = cinfo.output_width;\n nHeight = cinfo.output_height;\n aCreateBitmapParam.nWidth = nWidth;\n aCreateBitmapParam.nHeight = nHeight;\n\n aCreateBitmapParam.density_unit = cinfo.density_unit;\n aCreateBitmapParam.X_density = cinfo.X_density;\n aCreateBitmapParam.Y_density = cinfo.Y_density;\n aCreateBitmapParam.bGray = long(cinfo.output_components == 1);\n pDIB = pJPEGReader->CreateBitmap( &aCreateBitmapParam );\n nAlignedWidth = aCreateBitmapParam.nAlignedWidth;\n aRangeLimit = cinfo.sample_range_limit;\n\n nScanLineBufferComponents = 0;\n if ( cinfo.out_color_space == JCS_CMYK )\n {\n nScanLineBufferComponents = cinfo.output_width * 4;\n pScanLineBuffer.reset(new unsigned char[nScanLineBufferComponents]);\n }\n\n if( pDIB )\n {\n if( aCreateBitmapParam.bTopDown )\n {\n pTmp = pDIB;\n }\n else\n {\n pTmp = pDIB + ( nHeight - 1 ) * nAlignedWidth;\n nAlignedWidth = -nAlignedWidth;\n }\n\n for ( *pLines = 0; *pLines < nHeight; (*pLines)++ )\n {\n if (pScanLineBuffer)\n { \/\/ in other words cinfo.out_color_space == JCS_CMYK\n int i;\n int j;\n unsigned char *pSLB = pScanLineBuffer.get();\n jpeg_read_scanlines( &cinfo, (JSAMPARRAY) &pSLB, 1 );\n \/\/ convert CMYK to RGB\n for( i=0, j=0; i < nScanLineBufferComponents; i+=4, j+=3 )\n {\n int color_C = 255 - pScanLineBuffer[i+0];\n int color_M = 255 - pScanLineBuffer[i+1];\n int color_Y = 255 - pScanLineBuffer[i+2];\n int color_K = 255 - pScanLineBuffer[i+3];\n pTmp[j+0] = aRangeLimit[ 255L - ( color_C + color_K ) ];\n pTmp[j+1] = aRangeLimit[ 255L - ( color_M + color_K ) ];\n pTmp[j+2] = aRangeLimit[ 255L - ( color_Y + color_K ) ];\n }\n }\n else\n {\n jpeg_read_scanlines( &cinfo, (JSAMPARRAY) &pTmp, 1 );\n }\n\n \/* PENDING ??? *\/\n if ( cinfo.err->msg_code == 113 )\n break;\n\n pTmp += nAlignedWidth;\n }\n }\n\n if ( pDIB )\n {\n jpeg_finish_decompress( &cinfo );\n }\n else\n {\n jpeg_abort_decompress( &cinfo );\n }\n\n pScanLineBuffer.reset();\n\n jpeg_destroy_decompress( &cinfo );\n}\n\nbool WriteJPEG( JPEGWriter* pJPEGWriter, void* pOutputStream,\n long nWidth, long nHeight, bool bGreys,\n long nQualityPercent, long aChromaSubsampling,\n css::uno::Reference<css::task::XStatusIndicator> const & status )\n{\n jpeg_compress_struct cinfo;\n ErrorManagerStruct jerr;\n void* pScanline;\n long nY;\n\n if ( setjmp( jerr.setjmp_buffer ) )\n {\n jpeg_destroy_compress( &cinfo );\n return false;\n }\n\n cinfo.err = jpeg_std_error( &jerr.pub );\n jerr.pub.error_exit = errorExit;\n jerr.pub.output_message = outputMessage;\n\n jpeg_create_compress( &cinfo );\n jpeg_svstream_dest( &cinfo, pOutputStream );\n\n cinfo.image_width = (JDIMENSION) nWidth;\n cinfo.image_height = (JDIMENSION) nHeight;\n if ( bGreys )\n {\n cinfo.input_components = 1;\n cinfo.in_color_space = JCS_GRAYSCALE;\n }\n else\n {\n cinfo.input_components = 3;\n cinfo.in_color_space = JCS_RGB;\n }\n\n jpeg_set_defaults( &cinfo );\n jpeg_set_quality( &cinfo, (int) nQualityPercent, FALSE );\n\n if ( ( nWidth > 128 ) || ( nHeight > 128 ) )\n jpeg_simple_progression( &cinfo );\n\n if (aChromaSubsampling == 1) \/\/ YUV 4:4:4\n {\n cinfo.comp_info[0].h_samp_factor = 1;\n cinfo.comp_info[0].v_samp_factor = 1;\n }\n else if (aChromaSubsampling == 2) \/\/ YUV 4:2:2\n {\n cinfo.comp_info[0].h_samp_factor = 2;\n cinfo.comp_info[0].v_samp_factor = 1;\n }\n else if (aChromaSubsampling == 3) \/\/ YUV 4:2:0\n {\n cinfo.comp_info[0].h_samp_factor = 2;\n cinfo.comp_info[0].v_samp_factor = 2;\n }\n\n jpeg_start_compress( &cinfo, TRUE );\n\n for( nY = 0; nY < nHeight; nY++ )\n {\n pScanline = pJPEGWriter->GetScanline( nY );\n\n if( pScanline )\n {\n jpeg_write_scanlines( &cinfo, (JSAMPARRAY) &pScanline, 1 );\n }\n\n if( status.is() )\n {\n status->setValue( nY * 100L \/ nHeight );\n }\n }\n\n jpeg_finish_compress(&cinfo);\n jpeg_destroy_compress( &cinfo );\n\n return true;\n}\n\nlong Transform(void* pInputStream, void* pOutputStream, long nAngle)\n{\n jpeg_transform_info aTransformOption;\n JCOPY_OPTION aCopyOption = JCOPYOPT_ALL;\n\n jpeg_decompress_struct aSourceInfo;\n jpeg_compress_struct aDestinationInfo;\n ErrorManagerStruct aSourceError;\n ErrorManagerStruct aDestinationError;\n\n jvirt_barray_ptr* aSourceCoefArrays = 0;\n jvirt_barray_ptr* aDestinationCoefArrays = 0;\n\n aTransformOption.force_grayscale = FALSE;\n aTransformOption.trim = FALSE;\n aTransformOption.perfect = FALSE;\n aTransformOption.crop = FALSE;\n\n \/\/ Angle to transform option\n \/\/ 90 Clockwise = 270 Counterclockwise\n switch (nAngle)\n {\n case 2700:\n aTransformOption.transform = JXFORM_ROT_90;\n break;\n case 1800:\n aTransformOption.transform = JXFORM_ROT_180;\n break;\n case 900:\n aTransformOption.transform = JXFORM_ROT_270;\n break;\n default:\n aTransformOption.transform = JXFORM_NONE;\n }\n\n \/\/ Decompression\n aSourceInfo.err = jpeg_std_error(&aSourceError.pub);\n aSourceInfo.err->error_exit = errorExit;\n aSourceInfo.err->output_message = outputMessage;\n\n \/\/ Compression\n aDestinationInfo.err = jpeg_std_error(&aDestinationError.pub);\n aDestinationInfo.err->error_exit = errorExit;\n aDestinationInfo.err->output_message = outputMessage;\n\n aDestinationInfo.optimize_coding = TRUE;\n\n if (setjmp(aSourceError.setjmp_buffer) || setjmp(aDestinationError.setjmp_buffer))\n {\n jpeg_destroy_decompress(&aSourceInfo);\n jpeg_destroy_compress(&aDestinationInfo);\n return 0;\n }\n\n jpeg_create_decompress(&aSourceInfo);\n jpeg_create_compress(&aDestinationInfo);\n\n jpeg_svstream_src (&aSourceInfo, pInputStream);\n\n jcopy_markers_setup(&aSourceInfo, aCopyOption);\n jpeg_read_header(&aSourceInfo, TRUE);\n jtransform_request_workspace(&aSourceInfo, &aTransformOption);\n\n aSourceCoefArrays = jpeg_read_coefficients(&aSourceInfo);\n jpeg_copy_critical_parameters(&aSourceInfo, &aDestinationInfo);\n\n aDestinationCoefArrays = jtransform_adjust_parameters(&aSourceInfo, &aDestinationInfo, aSourceCoefArrays, &aTransformOption);\n jpeg_svstream_dest (&aDestinationInfo, pOutputStream);\n\n \/\/ Compute optimal Huffman coding tables instead of precomuted tables\n aDestinationInfo.optimize_coding = TRUE;\n jpeg_write_coefficients(&aDestinationInfo, aDestinationCoefArrays);\n jcopy_markers_execute(&aSourceInfo, &aDestinationInfo, aCopyOption);\n jtransform_execute_transformation(&aSourceInfo, &aDestinationInfo, aSourceCoefArrays, &aTransformOption);\n\n jpeg_finish_compress(&aDestinationInfo);\n jpeg_destroy_compress(&aDestinationInfo);\n\n jpeg_finish_decompress(&aSourceInfo);\n jpeg_destroy_decompress(&aSourceInfo);\n\n return 1;\n}\n\n\/* vim:set shiftwidth=4 softtabstop=4 expandtab: *\/\n<commit_msg>Revert \"grml.. nScanLineBufferComponents still needs to be on jmp stack\"<commit_after>\/* -*- Mode: C++; tab-width: 4; indent-tabs-mode: nil; c-basic-offset: 4 -*- *\/\n\/*\n * This file is part of the LibreOffice project.\n *\n * This Source Code Form is subject to the terms of the Mozilla Public\n * License, v. 2.0. If a copy of the MPL was not distributed with this\n * file, You can obtain one at http:\/\/mozilla.org\/MPL\/2.0\/.\n *\n * This file incorporates work covered by the following license notice:\n *\n * Licensed to the Apache Software Foundation (ASF) under one or more\n * contributor license agreements. See the NOTICE file distributed\n * with this work for additional information regarding copyright\n * ownership. The ASF licenses this file to you under the Apache\n * License, Version 2.0 (the \"License\"); you may not use this file\n * except in compliance with the License. You may obtain a copy of\n * the License at http:\/\/www.apache.org\/licenses\/LICENSE-2.0 .\n *\/\n\n#include <sal\/config.h>\n\n#include <stdio.h>\n#include <stdlib.h>\n#include <setjmp.h>\n#include <jpeglib.h>\n#include <jerror.h>\n\n#include <com\/sun\/star\/task\/XStatusIndicator.hpp>\n#include <osl\/diagnose.h>\n\nextern \"C\" {\n#include \"transupp.h\"\n}\n\n#include \"jpeg.h\"\n#include <JpegReader.hxx>\n#include <JpegWriter.hxx>\n#include <boost\/scoped_array.hpp>\n\nstruct ErrorManagerStruct\n{\n jpeg_error_mgr pub;\n jmp_buf setjmp_buffer;\n};\n\nextern \"C\" void errorExit (j_common_ptr cinfo)\n{\n ErrorManagerStruct * error = (ErrorManagerStruct *) cinfo->err;\n (*cinfo->err->output_message) (cinfo);\n longjmp(error->setjmp_buffer, 1);\n}\n\nextern \"C\" void outputMessage (j_common_ptr cinfo)\n{\n char buffer[JMSG_LENGTH_MAX];\n (*cinfo->err->format_message) (cinfo, buffer);\n}\n\nvoid ReadJPEG( JPEGReader* pJPEGReader, void* pInputStream, long* pLines,\n Size const & previewSize )\n{\n jpeg_decompress_struct cinfo;\n ErrorManagerStruct jerr;\n JPEGCreateBitmapParam aCreateBitmapParam;\n unsigned char * pDIB;\n unsigned char * pTmp;\n long nWidth;\n long nHeight;\n long nAlignedWidth;\n JSAMPLE* aRangeLimit;\n boost::scoped_array<unsigned char> pScanLineBuffer;\n\n if ( setjmp( jerr.setjmp_buffer ) )\n {\n jpeg_destroy_decompress( &cinfo );\n return;\n }\n\n cinfo.err = jpeg_std_error( &jerr.pub );\n jerr.pub.error_exit = errorExit;\n jerr.pub.output_message = outputMessage;\n\n jpeg_create_decompress( &cinfo );\n jpeg_svstream_src( &cinfo, pInputStream );\n jpeg_read_header( &cinfo, TRUE );\n\n cinfo.scale_num = 1;\n cinfo.scale_denom = 1;\n cinfo.output_gamma = 1.0;\n cinfo.raw_data_out = FALSE;\n cinfo.quantize_colors = FALSE;\n if ( cinfo.jpeg_color_space == JCS_YCbCr )\n cinfo.out_color_space = JCS_RGB;\n else if ( cinfo.jpeg_color_space == JCS_YCCK )\n cinfo.out_color_space = JCS_CMYK;\n\n OSL_ASSERT(cinfo.out_color_space == JCS_CMYK || cinfo.out_color_space == JCS_GRAYSCALE || cinfo.out_color_space == JCS_RGB);\n\n \/* change scale for preview import *\/\n long nPreviewWidth = previewSize.Width();\n long nPreviewHeight = previewSize.Height();\n if( nPreviewWidth || nPreviewHeight )\n {\n if( nPreviewWidth == 0 )\n {\n nPreviewWidth = ( cinfo.image_width * nPreviewHeight ) \/ cinfo.image_height;\n if( nPreviewWidth <= 0 )\n {\n nPreviewWidth = 1;\n }\n }\n else if( nPreviewHeight == 0 )\n {\n nPreviewHeight = ( cinfo.image_height * nPreviewWidth ) \/ cinfo.image_width;\n if( nPreviewHeight <= 0 )\n {\n nPreviewHeight = 1;\n }\n }\n\n for( cinfo.scale_denom = 1; cinfo.scale_denom < 8; cinfo.scale_denom *= 2 )\n {\n if( cinfo.image_width < nPreviewWidth * cinfo.scale_denom )\n break;\n if( cinfo.image_height < nPreviewHeight * cinfo.scale_denom )\n break;\n }\n\n if( cinfo.scale_denom > 1 )\n {\n cinfo.dct_method = JDCT_FASTEST;\n cinfo.do_fancy_upsampling = FALSE;\n cinfo.do_block_smoothing = FALSE;\n }\n }\n\n jpeg_start_decompress( &cinfo );\n\n nWidth = cinfo.output_width;\n nHeight = cinfo.output_height;\n aCreateBitmapParam.nWidth = nWidth;\n aCreateBitmapParam.nHeight = nHeight;\n\n aCreateBitmapParam.density_unit = cinfo.density_unit;\n aCreateBitmapParam.X_density = cinfo.X_density;\n aCreateBitmapParam.Y_density = cinfo.Y_density;\n aCreateBitmapParam.bGray = long(cinfo.output_components == 1);\n pDIB = pJPEGReader->CreateBitmap( &aCreateBitmapParam );\n nAlignedWidth = aCreateBitmapParam.nAlignedWidth;\n aRangeLimit = cinfo.sample_range_limit;\n\n long nScanLineBufferComponents = 0;\n if ( cinfo.out_color_space == JCS_CMYK )\n {\n nScanLineBufferComponents = cinfo.output_width * 4;\n pScanLineBuffer.reset(new unsigned char[nScanLineBufferComponents]);\n }\n\n if( pDIB )\n {\n if( aCreateBitmapParam.bTopDown )\n {\n pTmp = pDIB;\n }\n else\n {\n pTmp = pDIB + ( nHeight - 1 ) * nAlignedWidth;\n nAlignedWidth = -nAlignedWidth;\n }\n\n for ( *pLines = 0; *pLines < nHeight; (*pLines)++ )\n {\n if (pScanLineBuffer)\n { \/\/ in other words cinfo.out_color_space == JCS_CMYK\n int i;\n int j;\n unsigned char *pSLB = pScanLineBuffer.get();\n jpeg_read_scanlines( &cinfo, (JSAMPARRAY) &pSLB, 1 );\n \/\/ convert CMYK to RGB\n for( i=0, j=0; i < nScanLineBufferComponents; i+=4, j+=3 )\n {\n int color_C = 255 - pScanLineBuffer[i+0];\n int color_M = 255 - pScanLineBuffer[i+1];\n int color_Y = 255 - pScanLineBuffer[i+2];\n int color_K = 255 - pScanLineBuffer[i+3];\n pTmp[j+0] = aRangeLimit[ 255L - ( color_C + color_K ) ];\n pTmp[j+1] = aRangeLimit[ 255L - ( color_M + color_K ) ];\n pTmp[j+2] = aRangeLimit[ 255L - ( color_Y + color_K ) ];\n }\n }\n else\n {\n jpeg_read_scanlines( &cinfo, (JSAMPARRAY) &pTmp, 1 );\n }\n\n \/* PENDING ??? *\/\n if ( cinfo.err->msg_code == 113 )\n break;\n\n pTmp += nAlignedWidth;\n }\n }\n\n if ( pDIB )\n {\n jpeg_finish_decompress( &cinfo );\n }\n else\n {\n jpeg_abort_decompress( &cinfo );\n }\n\n pScanLineBuffer.reset();\n\n jpeg_destroy_decompress( &cinfo );\n}\n\nbool WriteJPEG( JPEGWriter* pJPEGWriter, void* pOutputStream,\n long nWidth, long nHeight, bool bGreys,\n long nQualityPercent, long aChromaSubsampling,\n css::uno::Reference<css::task::XStatusIndicator> const & status )\n{\n jpeg_compress_struct cinfo;\n ErrorManagerStruct jerr;\n void* pScanline;\n long nY;\n\n if ( setjmp( jerr.setjmp_buffer ) )\n {\n jpeg_destroy_compress( &cinfo );\n return false;\n }\n\n cinfo.err = jpeg_std_error( &jerr.pub );\n jerr.pub.error_exit = errorExit;\n jerr.pub.output_message = outputMessage;\n\n jpeg_create_compress( &cinfo );\n jpeg_svstream_dest( &cinfo, pOutputStream );\n\n cinfo.image_width = (JDIMENSION) nWidth;\n cinfo.image_height = (JDIMENSION) nHeight;\n if ( bGreys )\n {\n cinfo.input_components = 1;\n cinfo.in_color_space = JCS_GRAYSCALE;\n }\n else\n {\n cinfo.input_components = 3;\n cinfo.in_color_space = JCS_RGB;\n }\n\n jpeg_set_defaults( &cinfo );\n jpeg_set_quality( &cinfo, (int) nQualityPercent, FALSE );\n\n if ( ( nWidth > 128 ) || ( nHeight > 128 ) )\n jpeg_simple_progression( &cinfo );\n\n if (aChromaSubsampling == 1) \/\/ YUV 4:4:4\n {\n cinfo.comp_info[0].h_samp_factor = 1;\n cinfo.comp_info[0].v_samp_factor = 1;\n }\n else if (aChromaSubsampling == 2) \/\/ YUV 4:2:2\n {\n cinfo.comp_info[0].h_samp_factor = 2;\n cinfo.comp_info[0].v_samp_factor = 1;\n }\n else if (aChromaSubsampling == 3) \/\/ YUV 4:2:0\n {\n cinfo.comp_info[0].h_samp_factor = 2;\n cinfo.comp_info[0].v_samp_factor = 2;\n }\n\n jpeg_start_compress( &cinfo, TRUE );\n\n for( nY = 0; nY < nHeight; nY++ )\n {\n pScanline = pJPEGWriter->GetScanline( nY );\n\n if( pScanline )\n {\n jpeg_write_scanlines( &cinfo, (JSAMPARRAY) &pScanline, 1 );\n }\n\n if( status.is() )\n {\n status->setValue( nY * 100L \/ nHeight );\n }\n }\n\n jpeg_finish_compress(&cinfo);\n jpeg_destroy_compress( &cinfo );\n\n return true;\n}\n\nlong Transform(void* pInputStream, void* pOutputStream, long nAngle)\n{\n jpeg_transform_info aTransformOption;\n JCOPY_OPTION aCopyOption = JCOPYOPT_ALL;\n\n jpeg_decompress_struct aSourceInfo;\n jpeg_compress_struct aDestinationInfo;\n ErrorManagerStruct aSourceError;\n ErrorManagerStruct aDestinationError;\n\n jvirt_barray_ptr* aSourceCoefArrays = 0;\n jvirt_barray_ptr* aDestinationCoefArrays = 0;\n\n aTransformOption.force_grayscale = FALSE;\n aTransformOption.trim = FALSE;\n aTransformOption.perfect = FALSE;\n aTransformOption.crop = FALSE;\n\n \/\/ Angle to transform option\n \/\/ 90 Clockwise = 270 Counterclockwise\n switch (nAngle)\n {\n case 2700:\n aTransformOption.transform = JXFORM_ROT_90;\n break;\n case 1800:\n aTransformOption.transform = JXFORM_ROT_180;\n break;\n case 900:\n aTransformOption.transform = JXFORM_ROT_270;\n break;\n default:\n aTransformOption.transform = JXFORM_NONE;\n }\n\n \/\/ Decompression\n aSourceInfo.err = jpeg_std_error(&aSourceError.pub);\n aSourceInfo.err->error_exit = errorExit;\n aSourceInfo.err->output_message = outputMessage;\n\n \/\/ Compression\n aDestinationInfo.err = jpeg_std_error(&aDestinationError.pub);\n aDestinationInfo.err->error_exit = errorExit;\n aDestinationInfo.err->output_message = outputMessage;\n\n aDestinationInfo.optimize_coding = TRUE;\n\n if (setjmp(aSourceError.setjmp_buffer) || setjmp(aDestinationError.setjmp_buffer))\n {\n jpeg_destroy_decompress(&aSourceInfo);\n jpeg_destroy_compress(&aDestinationInfo);\n return 0;\n }\n\n jpeg_create_decompress(&aSourceInfo);\n jpeg_create_compress(&aDestinationInfo);\n\n jpeg_svstream_src (&aSourceInfo, pInputStream);\n\n jcopy_markers_setup(&aSourceInfo, aCopyOption);\n jpeg_read_header(&aSourceInfo, TRUE);\n jtransform_request_workspace(&aSourceInfo, &aTransformOption);\n\n aSourceCoefArrays = jpeg_read_coefficients(&aSourceInfo);\n jpeg_copy_critical_parameters(&aSourceInfo, &aDestinationInfo);\n\n aDestinationCoefArrays = jtransform_adjust_parameters(&aSourceInfo, &aDestinationInfo, aSourceCoefArrays, &aTransformOption);\n jpeg_svstream_dest (&aDestinationInfo, pOutputStream);\n\n \/\/ Compute optimal Huffman coding tables instead of precomuted tables\n aDestinationInfo.optimize_coding = TRUE;\n jpeg_write_coefficients(&aDestinationInfo, aDestinationCoefArrays);\n jcopy_markers_execute(&aSourceInfo, &aDestinationInfo, aCopyOption);\n jtransform_execute_transformation(&aSourceInfo, &aDestinationInfo, aSourceCoefArrays, &aTransformOption);\n\n jpeg_finish_compress(&aDestinationInfo);\n jpeg_destroy_compress(&aDestinationInfo);\n\n jpeg_finish_decompress(&aSourceInfo);\n jpeg_destroy_decompress(&aSourceInfo);\n\n return 1;\n}\n\n\/* vim:set shiftwidth=4 softtabstop=4 expandtab: *\/\n<|endoftext|>"} {"text":"<commit_before>#pragma once\n\n#include <sdbusplus\/bus.hpp>\n#include <thread>\n\nnamespace sdbusplus\n{\nnamespace server\n{\nnamespace transaction\n{\nnamespace details\n{\n\n\/\/ Transaction Id\nextern thread_local uint64_t id;\n\nstruct Transaction\n{\n Transaction() : time(std::time(nullptr)), thread(std::this_thread::get_id())\n {\n }\n\n int time;\n std::thread::id thread;\n};\n\n} \/\/ namespace details\n\nstruct Transaction\n{\n Transaction(sdbusplus::bus::bus& bus, sdbusplus::message::message& msg) :\n bus(bus), msg(msg)\n {\n }\n\n sdbusplus::bus::bus& bus;\n sdbusplus::message::message& msg;\n};\n\n} \/\/ namespace transaction\n} \/\/ namespace server\n} \/\/ namespace sdbusplus\n\nnamespace std\n{\n\n\/** @ brief Overload of std::hash for sdbusplus::bus::bus *\/\ntemplate <>\nstruct hash<sdbusplus::bus::bus>\n{\n auto operator()(sdbusplus::bus::bus& b) const\n {\n auto name = b.get_unique_name();\n return std::hash<std::string>{}(name);\n }\n};\n\n\/** @ brief Overload of std::hash for sdbusplus::message::message *\/\ntemplate <>\nstruct hash<sdbusplus::message::message>\n{\n auto operator()(sdbusplus::message::message& m) const\n {\n auto cookie = m.get_cookie();\n return std::hash<uint64_t>{}(cookie);\n }\n};\n\n\/** @ brief Overload of std::hash for Transaction *\/\ntemplate <>\nstruct hash<sdbusplus::server::transaction::Transaction>\n{\n auto operator()(sdbusplus::server::transaction::Transaction const& t) const\n {\n auto hash1 = std::hash<sdbusplus::bus::bus>{}(t.bus);\n auto hash2 = std::hash<sdbusplus::message::message>{}(t.msg);\n\n \/\/ boost::hash_combine() algorithm.\n return static_cast<size_t>(\n hash1 ^ (hash2 + 0x9e3779b9 + (hash1 << 6) + (hash1 >> 2)));\n }\n};\n\n\/** @ brief Overload of std::hash for details::Transaction *\/\ntemplate <>\nstruct hash<sdbusplus::server::transaction::details::Transaction>\n{\n auto operator()(\n sdbusplus::server::transaction::details::Transaction const& t) const\n {\n auto hash1 = std::hash<int>{}(t.time);\n auto hash2 = std::hash<std::thread::id>{}(t.thread);\n\n \/\/ boost::hash_combine() algorithm.\n return static_cast<size_t>(\n hash1 ^ (hash2 + 0x9e3779b9 + (hash1 << 6) + (hash1 >> 2)));\n }\n};\n\n} \/\/ namespace std\n\nnamespace sdbusplus\n{\nnamespace server\n{\nnamespace transaction\n{\n\n\/** @brief Get transaction id\n *\n * @return The value of the transaction id\n *\/\ninline uint64_t get_id()\n{\n \/\/ If the transaction id has not been initialized, generate one.\n if (!details::id)\n {\n details::Transaction t;\n details::id = std::hash<details::Transaction>{}(t);\n }\n return details::id;\n}\n\n\/** @brief Set transaction id\n *\n * @param[in] value - Desired value for the transaction id\n *\/\ninline void set_id(uint64_t value)\n{\n details::id = value;\n}\n\n} \/\/ namespace transaction\n} \/\/ namespace server\n} \/\/ namespace sdbusplus\n<commit_msg>server\/transaction: Fix message hash<commit_after>#pragma once\n\n#include <systemd\/sd-bus.h>\n\n#include <chrono>\n#include <sdbusplus\/bus.hpp>\n#include <stdexcept>\n#include <thread>\n\nnamespace sdbusplus\n{\nnamespace server\n{\nnamespace transaction\n{\nnamespace details\n{\n\n\/\/ Transaction Id\nextern thread_local uint64_t id;\n\nstruct Transaction\n{\n Transaction() : time(std::time(nullptr)), thread(std::this_thread::get_id())\n {\n }\n\n int time;\n std::thread::id thread;\n};\n\n} \/\/ namespace details\n\nstruct Transaction\n{\n Transaction(sdbusplus::bus::bus& bus, sdbusplus::message::message& msg) :\n bus(bus), msg(msg)\n {\n }\n\n sdbusplus::bus::bus& bus;\n sdbusplus::message::message& msg;\n};\n\n} \/\/ namespace transaction\n} \/\/ namespace server\n} \/\/ namespace sdbusplus\n\nnamespace std\n{\n\n\/** @ brief Overload of std::hash for sdbusplus::bus::bus *\/\ntemplate <>\nstruct hash<sdbusplus::bus::bus>\n{\n auto operator()(sdbusplus::bus::bus& b) const\n {\n auto name = b.get_unique_name();\n return std::hash<std::string>{}(name);\n }\n};\n\n\/** @ brief Overload of std::hash for sdbusplus::message::message *\/\ntemplate <>\nstruct hash<sdbusplus::message::message>\n{\n auto operator()(sdbusplus::message::message& m) const\n {\n switch (m.get_type())\n {\n \/\/ Reply messages will always embed the cookie of the original\n \/\/ message in a separate location. We want to use this cookie\n \/\/ to correlate messages as one transaction.\n case SD_BUS_MESSAGE_METHOD_RETURN:\n case SD_BUS_MESSAGE_METHOD_ERROR:\n return std::hash<uint64_t>{}(m.get_reply_cookie());\n \/\/ Method calls will have the cookie in the header when sealed.\n \/\/ Since we are on the server side that should always be the case.\n case SD_BUS_MESSAGE_METHOD_CALL:\n return std::hash<uint64_t>{}(m.get_cookie());\n \/\/ Outgoing signals don't have a cookie so we need to use\n \/\/ something else as an id. Just use a monotonic unique one.\n case SD_BUS_MESSAGE_SIGNAL:\n return std::hash<uint64_t>{}(std::chrono::steady_clock::now()\n .time_since_epoch()\n .count());\n default:\n throw std::runtime_error(\"hash message: Unknown message type\");\n }\n }\n};\n\n\/** @ brief Overload of std::hash for Transaction *\/\ntemplate <>\nstruct hash<sdbusplus::server::transaction::Transaction>\n{\n auto operator()(sdbusplus::server::transaction::Transaction const& t) const\n {\n auto hash1 = std::hash<sdbusplus::bus::bus>{}(t.bus);\n auto hash2 = std::hash<sdbusplus::message::message>{}(t.msg);\n\n \/\/ boost::hash_combine() algorithm.\n return static_cast<size_t>(\n hash1 ^ (hash2 + 0x9e3779b9 + (hash1 << 6) + (hash1 >> 2)));\n }\n};\n\n\/** @ brief Overload of std::hash for details::Transaction *\/\ntemplate <>\nstruct hash<sdbusplus::server::transaction::details::Transaction>\n{\n auto operator()(\n sdbusplus::server::transaction::details::Transaction const& t) const\n {\n auto hash1 = std::hash<int>{}(t.time);\n auto hash2 = std::hash<std::thread::id>{}(t.thread);\n\n \/\/ boost::hash_combine() algorithm.\n return static_cast<size_t>(\n hash1 ^ (hash2 + 0x9e3779b9 + (hash1 << 6) + (hash1 >> 2)));\n }\n};\n\n} \/\/ namespace std\n\nnamespace sdbusplus\n{\nnamespace server\n{\nnamespace transaction\n{\n\n\/** @brief Get transaction id\n *\n * @return The value of the transaction id\n *\/\ninline uint64_t get_id()\n{\n \/\/ If the transaction id has not been initialized, generate one.\n if (!details::id)\n {\n details::Transaction t;\n details::id = std::hash<details::Transaction>{}(t);\n }\n return details::id;\n}\n\n\/** @brief Set transaction id\n *\n * @param[in] value - Desired value for the transaction id\n *\/\ninline void set_id(uint64_t value)\n{\n details::id = value;\n}\n\n} \/\/ namespace transaction\n} \/\/ namespace server\n} \/\/ namespace sdbusplus\n<|endoftext|>"} {"text":"<commit_before>\/\/=====================================================================================================================================\n\/\/The MIT License (MIT)\n\/\/Copyright (c) 2015 Austin Salgat\n\/\/\n\/\/Permission is hereby granted, free of charge, to any person obtaining a copy of this software and associated documentation files\n\/\/(the \"Software\"), to deal in the Software without restriction, including without limitation the rights to use, copy, modify,\n\/\/merge, publish, distribute, sublicense, and\/or sell copies of the Software, and to permit persons to whom the Software is furnished\n\/\/to do so, subject to the following conditions:\n\/\/The above copyright notice and this permission notice shall be included in all copies or substantial portions of the Software.\n\/\/\n\/\/THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES\n\/\/OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE\n\/\/LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR\n\/\/IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.\n\/\/=====================================================================================================================================\n\n#ifndef ENUM_ITERATOR_ENUMIT_HPP\n#define ENUM_ITERATOR_ENUMIT_HPP\n\nnamespace enumit {\n \/**\n * Supports iteration of enumerations (and enumeration classes).\n *\/\n template<class enum_class>\n class Iterate {\n public:\n enum_class last;\n\n Iterate() = default;\n\n Iterate(enum_class last_) {\n last = static_cast<enum_class>(static_cast<int>(last_)+1);\n }\n\n class Iterator {\n private:\n int current_position;\n\n public:\n Iterator(Iterator const& iter) = default;\n\n Iterator(int index = 0) {\n current_position = index;\n }\n\n ~Iterator(){}\n\n Iterator& operator=(Iterator const& iter) = default;\n\n Iterator operator+(int const value) {\n auto temp(*this);\n temp.current_position += value;\n return temp;\n }\n\n Iterator& operator+=(int const value) {\n current_position += value;\n return *this;\n }\n\n Iterator operator-(int const value) {\n auto temp(*this);\n temp.current_position -= value;\n return temp;\n }\n\n Iterator& operator-=(int const value) {\n current_position -= value;\n return *this;\n }\n\n Iterator& operator++() {\n ++current_position;\n return *this;\n }\n\n Iterator operator++(int) {\n auto temp(*this);\n ++current_position;\n return temp;\n }\n\n Iterator& operator--() {\n --current_position;\n return *this;\n }\n\n Iterator operator--(int) {\n auto temp(*this);\n --current_position;\n return temp;\n }\n\n bool operator==(Iterator const& other) const {\n return current_position == other.current_position;\n }\n\n bool operator!=(Iterator const& other) const {\n return current_position != other.current_position;\n }\n\n enum_class operator*() const {\n return static_cast<enum_class>(current_position);\n }\n };\n };\n\n template<class enum_class>\n typename Iterate<enum_class>::Iterator begin(Iterate<enum_class>) {\n return typename Iterate<enum_class>::Iterator(0);\n }\n\n template<class enum_class>\n typename Iterate<enum_class>::Iterator end(Iterate<enum_class> end) {\n return typename Iterate<enum_class>::Iterator(static_cast<int>(end.last));\n }\n\n \/**\n * Returns iterator pointing to first element of enumeration.\n *\n * Note: The default argument is for people who want visual consistency between Begin(last_enum) and End(last_enum).\n *\/\n template<class enum_class>\n typename Iterate<enum_class>::Iterator Begin(enum_class ignore = static_cast<enum_class>(0)) {\n return typename Iterate<enum_class>::Iterator(0);\n };\n\n \/**\n * Returns iterator pointing to one past the last element of enumeration.\n *\/\n template<class enum_class>\n typename Iterate<enum_class>::Iterator End(enum_class last_entry) {\n return typename Iterate<enum_class>::Iterator(static_cast<int>(last_entry)+1);\n };\n}\n\n#endif \/\/ENUM_ITERATOR_ENUMIT_HPP\n<commit_msg>Update Begin to allow custom starting enum value<commit_after>\/\/=====================================================================================================================================\n\/\/The MIT License (MIT)\n\/\/Copyright (c) 2015 Austin Salgat\n\/\/\n\/\/Permission is hereby granted, free of charge, to any person obtaining a copy of this software and associated documentation files\n\/\/(the \"Software\"), to deal in the Software without restriction, including without limitation the rights to use, copy, modify,\n\/\/merge, publish, distribute, sublicense, and\/or sell copies of the Software, and to permit persons to whom the Software is furnished\n\/\/to do so, subject to the following conditions:\n\/\/The above copyright notice and this permission notice shall be included in all copies or substantial portions of the Software.\n\/\/\n\/\/THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES\n\/\/OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE\n\/\/LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR\n\/\/IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.\n\/\/=====================================================================================================================================\n\n#ifndef ENUM_ITERATOR_ENUMIT_HPP\n#define ENUM_ITERATOR_ENUMIT_HPP\n\nnamespace enumit {\n \/**\n * Supports iteration of enumerations (and enumeration classes).\n *\/\n template<class enum_class>\n class Iterate {\n public:\n enum_class last;\n\n Iterate() = default;\n\n Iterate(enum_class last_) {\n last = static_cast<enum_class>(static_cast<int>(last_)+1);\n }\n\n class Iterator {\n private:\n int current_position;\n\n public:\n Iterator(Iterator const& iter) = default;\n\n Iterator(int index = 0) {\n current_position = index;\n }\n\n ~Iterator(){}\n\n Iterator& operator=(Iterator const& iter) = default;\n\n Iterator operator+(int const value) {\n auto temp(*this);\n temp.current_position += value;\n return temp;\n }\n\n Iterator& operator+=(int const value) {\n current_position += value;\n return *this;\n }\n\n Iterator operator-(int const value) {\n auto temp(*this);\n temp.current_position -= value;\n return temp;\n }\n\n Iterator& operator-=(int const value) {\n current_position -= value;\n return *this;\n }\n\n Iterator& operator++() {\n ++current_position;\n return *this;\n }\n\n Iterator operator++(int) {\n auto temp(*this);\n ++current_position;\n return temp;\n }\n\n Iterator& operator--() {\n --current_position;\n return *this;\n }\n\n Iterator operator--(int) {\n auto temp(*this);\n --current_position;\n return temp;\n }\n\n bool operator==(Iterator const& other) const {\n return current_position == other.current_position;\n }\n\n bool operator!=(Iterator const& other) const {\n return current_position != other.current_position;\n }\n\n enum_class operator*() const {\n return static_cast<enum_class>(current_position);\n }\n };\n };\n\n template<class enum_class>\n typename Iterate<enum_class>::Iterator begin(Iterate<enum_class>) {\n return typename Iterate<enum_class>::Iterator(0);\n }\n\n template<class enum_class>\n typename Iterate<enum_class>::Iterator end(Iterate<enum_class> end) {\n return typename Iterate<enum_class>::Iterator(static_cast<int>(end.last));\n }\n\n \/**\n * Returns iterator pointing to first element of enumeration.\n *\/\n template<class enum_class>\n typename Iterate<enum_class>::Iterator Begin(enum_class start = static_cast<enum_class>(0)) {\n return typename Iterate<enum_class>::Iterator(static_cast<int>(start));\n };\n\n \/**\n * Returns iterator pointing to one past the last element of enumeration.\n *\/\n template<class enum_class>\n typename Iterate<enum_class>::Iterator End(enum_class last_entry) {\n return typename Iterate<enum_class>::Iterator(static_cast<int>(last_entry)+1);\n };\n}\n\n#endif \/\/ENUM_ITERATOR_ENUMIT_HPP\n<|endoftext|>"} {"text":"<commit_before>\/* \n This file is part of Anabel\n\n Anabel is free software; you can redistribute it 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 Anabel is distributed in the hope that it will be useful,\n but WITHOUT ANY WARRANTY; without even the implied warranty of\n MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the\n GNU General Public License for more details.\n\n You should have received a copy of the GNU General Public License\n along with Anabel; if not, write to the Free Software\n Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA\n*\/\n#include <anabel\/stdafx.h>\n#include <anabel\/anabel.h>\n\nusing namespace boost::filesystem;\nusing namespace boost::interprocess;\nusing namespace Anabel::Exceptions;\nusing namespace std;\nusing namespace Anabel;\nusing namespace Anabel::Internal;\n\/**\n* Chooses a timestamp that can be chosen, so it contains needle.\n* \n* Haystack must not be empty - other way, it would not make any sense, would it?\n* Haystack must contain entry that will follow us to needle.\n*\/\nTimestamp choose(vector<Timestamp> haystack, Timestamp needle) {\n\tfor (unsigned i=0; i<haystack.size(); i++) {\n\t\tif (haystack[i] <= needle) return haystack[i];\n\t}\n\tthrow InternalError(\"needle not found\");\n}\n\nAnabel::ReadQuery * Anabel::TimeSeries::get_query(Anabel::Timestamp from, Anabel::Timestamp to) {\n\t\/\/ Sanity checks\n\tif ((this->mode != TSO_READ) && (this->mode != TSO_WRITE)) throw InvalidInvocation(\"invalid open mode\");\n\n\ttypedef vector<Timestamp> timevector;\n\ttypedef vector<Timestamp>::iterator timevectoriter;\n\n\t\/\/ Init variables\n\tpath cpath = *this->root_path;\n\ttimevector elements;\n\tTimestamp choice;\n\tvector<path> * files = new vector<path>();\n\n\t\/\/ Locate UBA\n\tcpath = *this->root_path;\n\ttry {\n\t\twhile (is_directory(cpath)) {\n\t\t\telements = scan_directory(cpath);\n\t\t\tsort(elements.begin(), elements.end(), greater<Timestamp>());\n\t\t\tchoice = choose(elements, to);\n\t\t\tcpath \/= timestamp_to_string(choice);\n\t\t}\n\t} catch (InternalError e) {\n\t\t\/\/ query empty.\n\t\tdelete files;\n\t\treturn new Anabel::ReadQuery(from, to, NULL, this->record_size);\n\t}\n\n\t\tfiles->push_back(cpath);\n\tif (choice <= from) {\n\t\treturn new Anabel::ReadQuery(from, to, files, this->record_size);\t\/\/ response is a single-file wonder\n\t}\n\n\tcpath = cpath.parent_path();\n\n\t\/\/ Now we will trace thru the filesystem, finding doodz. First up the tree, and then sharp dive towards 'to'\n\tTimestamp previous_choice = choice;\n\twhile (true) {\n\t\telements = scan_directory(cpath);\n\t\tsort(elements.begin(), elements.end(), std::greater<Timestamp>());\n\t\ttimevectoriter bound = upper_bound(elements.begin(), elements.end(), from, std::greater<Timestamp>());\n\n\t\tif (bound == elements.end()) {\t\/\/ we need to ascend\n\t\t\t\/\/ index files from bound upwards\n\t\t\tfor (timevectoriter start_bound = upper_bound(elements.begin(), elements.end(), to, std::greater<Timestamp>()); start_bound != elements.end(); start_bound++) {\n\t\t\t\tif (previous_choice == *start_bound) continue;\n\t\t\t\tfiles->push_back(cpath \/ timestamp_to_string(*start_bound));\n\t\t\t}\n\t\t\tcpath = cpath.parent_path();\n\t\t\tcontinue;\n\t\t}\n\n\t\t\/\/ Descent to \"bound\"\n\t\tfor (timevectoriter start_bound = upper_bound(elements.begin(), elements.end(), to, std::greater<Timestamp>()); start_bound != bound; start_bound++) {\n\t\t\tif (previous_choice == *start_bound) continue;\n\t\t\tfiles->push_back(cpath \/ timestamp_to_string(*start_bound));\n\t\t}\n\n\t\tcpath = cpath \/ timestamp_to_string(*bound);\n\t\tif (is_regular_file(cpath)) {\n\t\t\tfiles->push_back(cpath);\n\t\t\tbreak;\n\t\t}\n\t}\n\n\treturn new Anabel::ReadQuery(from, to, files, this->record_size);\n}\n\nvoid Anabel::TimeSeries::open(TimeSeriesOpenMode open_mode) {\n\t\/\/ Do the locking!\n\t\/*\n\t\tNow, how do I resolve deadlocks? They may happen.\n\t\tDuring a deadlock, second acquisiton will raise an exception. Then, I will release the locks. \n\t\tAnd fun begins again. Maybe backoff algorithm can be used by the upper layer? \n\t*\/\n\tswitch (open_mode) {\n\t\tcase TSO_APPEND:\n\t\t\ttry {\n\t\t\t\tthis->alock->try_lock();\n\t\t\t} catch (boost::interprocess::lock_exception exc) {\n\t\t\t\tthrow TimeSeriesLocked();\n\t\t\t}\n\t\t\tbreak;\n\t\tcase TSO_REBALANCE:\n\t\t\ttry {\n\t\t\t\tthis->block->try_lock();\n\t\t\t} catch (boost::interprocess::lock_exception exc) {\n\t\t\t\tthrow TimeSeriesLocked();\n\t\t\t}\n\t\t\tbreak;\n\t\tcase TSO_READ:\n\t\t\ttry {\n\t\t\t\tthis->alock->try_lock_sharable();\n\t\t\t} catch (boost::interprocess::lock_exception exc) {\n\t\t\t\tthrow TimeSeriesLocked();\n\t\t\t}\n\t\t\ttry {\n\t\t\t\tthis->block->try_lock_sharable();\n\t\t\t} catch (boost::interprocess::lock_exception exc) {\n\t\t\t\tthis->alock->unlock_sharable();\n\t\t\t\tthrow TimeSeriesLocked();\n\t\t\t}\n\t\t\tbreak;\n\t\tcase TSO_WRITE:\n\t\t\ttry {\n\t\t\t\tthis->alock->try_lock();\n\t\t\t} catch (boost::interprocess::lock_exception exc) {\n\t\t\t\tthrow TimeSeriesLocked();\n\t\t\t}\n\t\t\ttry {\n\t\t\t\tthis->block->try_lock();\n\t\t\t} catch (boost::interprocess::lock_exception exc) {\n\t\t\t\tthis->alock->unlock();\n\t\t\t\tthrow TimeSeriesLocked();\n\t\t\t}\n\t\t\tbreak;\n\t\tcase TSO_CLOSED:\t\/\/ funnt, not undefined though\n\t\t\tthrow InvalidInvocation(\"invalid open_mode\");\n\t\t\tbreak;\n\t\tdefault:\n\t\t\tthrow InvalidInvocation(\"unknown open_mode\");\n\t}\n\n\t\/\/ Read type of time series, as we don't know it now\n\tstd::ifstream conf((*this->root_path \/ \"record_size\").string());\n\tconf >> this->record_size;\n\tconf.close();\n\n\tthis->mode = open_mode;\n}\n\nvoid Anabel::TimeSeries::close(void) {\n\tswitch (this->mode) {\n\t\tcase TSO_READ:\n\t\t\tthis->alock->unlock_sharable();\n\t\t\tthis->block->unlock_sharable();\n\t\t\tbreak;\n\t\tcase TSO_WRITE:\n\t\t\tthis->alock->unlock();\n\t\t\tthis->block->unlock();\n\t\t\tbreak;\n\t\tcase TSO_REBALANCE:\n\t\t\tthis->block->unlock();\n\t\t\tbreak;\n\t\tcase TSO_APPEND:\n\t\t\tthis->alock->unlock();\n\t\t\tbreak;\n\t\tcase TSO_CLOSED:\n\t\t\tbreak;\n\t}\n}\n\n\nAnabel::TimeSeries::TimeSeries(std::string rootdirpath) : mode(TSO_CLOSED), record_size(0) {\n\t\/\/ Prepare pathes\n\tthis->root_path = new path(rootdirpath);\n\tpath rsize_path(*this->root_path);\n\trsize_path \/= \"record_size\";\n\tpath alock_path(*this->root_path);\n\talock_path \/= \"alock\";\n\tpath block_path(*this->root_path);\n\tblock_path \/= \"block\";\n\n\t\/\/ Sanity-check pathes\n\tif (!exists(*this->root_path)) throw InvalidRootDirectory(\"root directory does not exist\");\n\tif (!is_directory(*this->root_path)) throw InvalidRootDirectory(\"root directory is not a directory\");\n\tif (!exists(rsize_path)) throw InvalidRootDirectory(\"rsize_path file not found\");\n\tif (!exists(alock_path)) throw InvalidRootDirectory(\"append lock not found\");\n\tif (!exists(block_path)) throw InvalidRootDirectory(\"rebalance lock not found\");\n\n\t\/\/ Create locks\n\tthis->alock = new boost::interprocess::file_lock(alock_path.string().c_str());\n\tthis->block = new boost::interprocess::file_lock(block_path.string().c_str());\n}\nAnabel::TimeSeries::~TimeSeries() {\n\tif (this->mode != TSO_CLOSED) this->close();\n\tdelete this->alock;\n\tdelete this->block;\n\tdelete this->root_path;\n}\n<commit_msg>more bugs fixed<commit_after>\/* \n This file is part of Anabel\n\n Anabel is free software; you can redistribute it 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 Anabel is distributed in the hope that it will be useful,\n but WITHOUT ANY WARRANTY; without even the implied warranty of\n MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the\n GNU General Public License for more details.\n\n You should have received a copy of the GNU General Public License\n along with Anabel; if not, write to the Free Software\n Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA\n*\/\n#include <anabel\/stdafx.h>\n#include <anabel\/anabel.h>\n\nusing namespace boost::filesystem;\nusing namespace boost::interprocess;\nusing namespace Anabel::Exceptions;\nusing namespace std;\nusing namespace Anabel;\nusing namespace Anabel::Internal;\n\/**\n* Chooses a timestamp that can be chosen, so it contains needle.\n* \n* Haystack must not be empty - other way, it would not make any sense, would it?\n* Haystack must contain entry that will follow us to needle.\n*\/\nTimestamp choose(vector<Timestamp> haystack, Timestamp needle) {\n\tfor (unsigned i=0; i<haystack.size(); i++) {\n\t\tif (haystack[i] <= needle) return haystack[i];\n\t}\n\tthrow InternalError(\"needle not found\");\n}\n\nAnabel::ReadQuery * Anabel::TimeSeries::get_query(Anabel::Timestamp from, Anabel::Timestamp to) {\n\t\/\/ Sanity checks\n\tif ((this->mode != TSO_READ) && (this->mode != TSO_WRITE)) throw InvalidInvocation(\"invalid open mode\");\n\n\ttypedef vector<Timestamp> timevector;\n\ttypedef vector<Timestamp>::iterator timevectoriter;\n\n\t\/\/ Init variables\n\tpath cpath = *this->root_path;\n\ttimevector elements;\n\tTimestamp choice;\n\tvector<path> * files = new vector<path>();\n\n\t\/\/ Locate UBA\n\tcpath = *this->root_path;\n\ttry {\n\t\twhile (is_directory(cpath)) {\n\t\t\telements = scan_directory(cpath);\n\t\t\tsort(elements.begin(), elements.end(), greater<Timestamp>());\n\t\t\tchoice = choose(elements, to);\n\t\t\tcpath \/= timestamp_to_string(choice);\n\t\t}\n\t} catch (InternalError e) {\n\t\t\/\/ query empty.\n\t\tdelete files;\n\t\treturn new Anabel::ReadQuery(from, to, NULL, this->record_size);\n\t}\n\n\t\tfiles->push_back(cpath);\n\tif (choice <= from) {\n\t\treturn new Anabel::ReadQuery(from, to, files, this->record_size);\t\/\/ response is a single-file wonder\n\t}\n\n\tcpath = cpath.parent_path();\n\n\t\/\/ Now we will trace thru the filesystem, finding doodz. First up the tree, and then sharp dive towards 'to'\n\tTimestamp previous_choice = choice;\n\twhile (true) {\n\t\telements = scan_directory(cpath);\n\t\tsort(elements.begin(), elements.end(), std::greater<Timestamp>());\n\t\ttimevectoriter bound = lower_bound(elements.begin(), elements.end(), from, std::greater<Timestamp>());\n\n\t\tif (bound == elements.end()) {\t\/\/ we need to ascend\n\t\t\t\/\/ index files from bound upwards\n\t\t\tfor (timevectoriter start_bound = upper_bound(elements.begin(), elements.end(), to, std::greater<Timestamp>()); start_bound != elements.end(); start_bound++) {\n\t\t\t\tif (previous_choice == *start_bound) continue;\n\t\t\t\tprevious_choice = *start_bound;\n\t\t\t\tfiles->push_back(cpath \/ timestamp_to_string(*start_bound));\n\t\t\t}\n\t\t\tcpath = cpath.parent_path();\n\t\t\tcontinue;\n\t\t}\n\n\t\t\/\/ Descent to \"bound\"\n\t\tfor (timevectoriter start_bound = upper_bound(elements.begin(), elements.end(), to, std::greater<Timestamp>()); start_bound != bound; start_bound++) {\n\t\t\tif (previous_choice == *start_bound) continue;\n\t\t\tprevious_choice = *start_bound;\n\t\t\tfiles->push_back(cpath \/ timestamp_to_string(*start_bound));\n\t\t}\n\n\t\tcpath = cpath \/ timestamp_to_string(*bound);\n\t\tif (is_regular_file(cpath)) {\n\t\t\tfiles->push_back(cpath);\n\t\t\tbreak;\n\t\t}\n\t}\n\n\treturn new Anabel::ReadQuery(from, to, files, this->record_size);\n}\n\nvoid Anabel::TimeSeries::open(TimeSeriesOpenMode open_mode) {\n\t\/\/ Do the locking!\n\t\/*\n\t\tNow, how do I resolve deadlocks? They may happen.\n\t\tDuring a deadlock, second acquisiton will raise an exception. Then, I will release the locks. \n\t\tAnd fun begins again. Maybe backoff algorithm can be used by the upper layer? \n\t*\/\n\tswitch (open_mode) {\n\t\tcase TSO_APPEND:\n\t\t\ttry {\n\t\t\t\tthis->alock->try_lock();\n\t\t\t} catch (boost::interprocess::lock_exception exc) {\n\t\t\t\tthrow TimeSeriesLocked();\n\t\t\t}\n\t\t\tbreak;\n\t\tcase TSO_REBALANCE:\n\t\t\ttry {\n\t\t\t\tthis->block->try_lock();\n\t\t\t} catch (boost::interprocess::lock_exception exc) {\n\t\t\t\tthrow TimeSeriesLocked();\n\t\t\t}\n\t\t\tbreak;\n\t\tcase TSO_READ:\n\t\t\ttry {\n\t\t\t\tthis->alock->try_lock_sharable();\n\t\t\t} catch (boost::interprocess::lock_exception exc) {\n\t\t\t\tthrow TimeSeriesLocked();\n\t\t\t}\n\t\t\ttry {\n\t\t\t\tthis->block->try_lock_sharable();\n\t\t\t} catch (boost::interprocess::lock_exception exc) {\n\t\t\t\tthis->alock->unlock_sharable();\n\t\t\t\tthrow TimeSeriesLocked();\n\t\t\t}\n\t\t\tbreak;\n\t\tcase TSO_WRITE:\n\t\t\ttry {\n\t\t\t\tthis->alock->try_lock();\n\t\t\t} catch (boost::interprocess::lock_exception exc) {\n\t\t\t\tthrow TimeSeriesLocked();\n\t\t\t}\n\t\t\ttry {\n\t\t\t\tthis->block->try_lock();\n\t\t\t} catch (boost::interprocess::lock_exception exc) {\n\t\t\t\tthis->alock->unlock();\n\t\t\t\tthrow TimeSeriesLocked();\n\t\t\t}\n\t\t\tbreak;\n\t\tcase TSO_CLOSED:\t\/\/ funnt, not undefined though\n\t\t\tthrow InvalidInvocation(\"invalid open_mode\");\n\t\t\tbreak;\n\t\tdefault:\n\t\t\tthrow InvalidInvocation(\"unknown open_mode\");\n\t}\n\n\t\/\/ Read type of time series, as we don't know it now\n\tstd::ifstream conf((*this->root_path \/ \"record_size\").string());\n\tconf >> this->record_size;\n\tconf.close();\n\n\tthis->mode = open_mode;\n}\n\nvoid Anabel::TimeSeries::close(void) {\n\tswitch (this->mode) {\n\t\tcase TSO_READ:\n\t\t\tthis->alock->unlock_sharable();\n\t\t\tthis->block->unlock_sharable();\n\t\t\tbreak;\n\t\tcase TSO_WRITE:\n\t\t\tthis->alock->unlock();\n\t\t\tthis->block->unlock();\n\t\t\tbreak;\n\t\tcase TSO_REBALANCE:\n\t\t\tthis->block->unlock();\n\t\t\tbreak;\n\t\tcase TSO_APPEND:\n\t\t\tthis->alock->unlock();\n\t\t\tbreak;\n\t\tcase TSO_CLOSED:\n\t\t\tbreak;\n\t}\n}\n\n\nAnabel::TimeSeries::TimeSeries(std::string rootdirpath) : mode(TSO_CLOSED), record_size(0) {\n\t\/\/ Prepare pathes\n\tthis->root_path = new path(rootdirpath);\n\tpath rsize_path(*this->root_path);\n\trsize_path \/= \"record_size\";\n\tpath alock_path(*this->root_path);\n\talock_path \/= \"alock\";\n\tpath block_path(*this->root_path);\n\tblock_path \/= \"block\";\n\n\t\/\/ Sanity-check pathes\n\tif (!exists(*this->root_path)) throw InvalidRootDirectory(\"root directory does not exist\");\n\tif (!is_directory(*this->root_path)) throw InvalidRootDirectory(\"root directory is not a directory\");\n\tif (!exists(rsize_path)) throw InvalidRootDirectory(\"rsize_path file not found\");\n\tif (!exists(alock_path)) throw InvalidRootDirectory(\"append lock not found\");\n\tif (!exists(block_path)) throw InvalidRootDirectory(\"rebalance lock not found\");\n\n\t\/\/ Create locks\n\tthis->alock = new boost::interprocess::file_lock(alock_path.string().c_str());\n\tthis->block = new boost::interprocess::file_lock(block_path.string().c_str());\n}\nAnabel::TimeSeries::~TimeSeries() {\n\tif (this->mode != TSO_CLOSED) this->close();\n\tdelete this->alock;\n\tdelete this->block;\n\tdelete this->root_path;\n}\n<|endoftext|>"} {"text":"<commit_before>#define _LARGEFILE64_SOURCE\n\n#include \"util\/file.hh\"\n\n#include \"util\/exception.hh\"\n\n#include <cstdlib>\n#include <cstdio>\n#include <iostream>\n\n#include <assert.h>\n#include <sys\/types.h>\n#include <sys\/stat.h>\n#include <fcntl.h>\n#include <stdint.h>\n\n#if defined(_WIN32) || defined(_WIN64)\n#include <windows.h>\n#include <io.h>\n#include <algorithm>\n#include <limits.h>\n#else\n#include <unistd.h>\n#endif\n\nnamespace util {\n\nscoped_fd::~scoped_fd() {\n if (fd_ != -1 && close(fd_)) {\n std::cerr << \"Could not close file \" << fd_ << std::endl;\n std::abort();\n }\n}\n\nscoped_FILE::~scoped_FILE() {\n if (file_ && std::fclose(file_)) {\n std::cerr << \"Could not close file \" << std::endl;\n std::abort();\n }\n}\n\nint OpenReadOrThrow(const char *name) {\n int ret;\n#if defined(_WIN32) || defined(_WIN64)\n UTIL_THROW_IF(-1 == (ret = _open(name, _O_BINARY | _O_RDONLY)), ErrnoException, \"while opening \" << name);\n#else\n UTIL_THROW_IF(-1 == (ret = open(name, O_RDONLY)), ErrnoException, \"while opening \" << name);\n#endif\n return ret;\n}\n\nint CreateOrThrow(const char *name) {\n int ret;\n#if defined(_WIN32) || defined(_WIN64)\n UTIL_THROW_IF(-1 == (ret = _open(name, _O_CREAT | _O_TRUNC | _O_RDWR | _O_BINARY, _S_IREAD | _S_IWRITE)), ErrnoException, \"while creating \" << name);\n#else\n UTIL_THROW_IF(-1 == (ret = open(name, O_CREAT | O_TRUNC | O_RDWR, S_IRUSR | S_IWUSR | S_IRGRP | S_IROTH)), ErrnoException, \"while creating \" << name);\n#endif\n return ret;\n}\n\nuint64_t SizeFile(int fd) {\n#if defined(_WIN32) || defined(_WIN64)\n __int64 ret = _filelengthi64(fd);\n return (ret == -1) ? kBadSize : ret;\n#else\n struct stat sb;\n if (fstat(fd, &sb) == -1 || (!sb.st_size && !S_ISREG(sb.st_mode))) return kBadSize;\n return sb.st_size;\n#endif\n}\n\nvoid ResizeOrThrow(int fd, uint64_t to) {\n#if defined(_WIN32) || defined(_WIN64)\n UTIL_THROW_IF(_chsize_s(fd, to), ErrnoException, \"Resizing to \" << to << \" bytes failed\");\n#else\n UTIL_THROW_IF(ftruncate(fd, to), ErrnoException, \"Resizing to \" << to << \" bytes failed\");\n#endif\n}\n\nstd::size_t PartialRead(int fd, void *to, std::size_t amount) {\n#if defined(_WIN32) || defined(_WIN64)\n amount = min(static_cast<std::size_t>(INT_MAX), amount);\n int ret = _read(fd, to, amount); \n#else\n ssize_t ret = read(fd, to, amount);\n#endif\n UTIL_THROW_IF(ret < 0, ErrnoException, \"Reading \" << amount << \" from fd \" << fd << \" failed.\");\n return static_cast<std::size_t>(ret);\n}\n\nvoid ReadOrThrow(int fd, void *to_void, std::size_t amount) {\n uint8_t *to = static_cast<uint8_t*>(to_void);\n while (amount) {\n std::size_t ret = PartialRead(fd, to, amount);\n UTIL_THROW_IF(ret == 0, EndOfFileException, \" in fd \" << fd << \" but there should be \" << amount << \" more bytes to read.\");\n amount -= ret;\n to += ret;\n }\n}\n\nstd::size_t ReadOrEOF(int fd, void *to_void, std::size_t amount) {\n uint8_t *to = static_cast<uint8_t*>(to_void);\n std::size_t remaining = amount;\n while (remaining) {\n std::size_t ret = PartialRead(fd, to, remaining);\n if (!ret) return amount - remaining;\n remaining -= ret;\n to += ret;\n }\n return amount;\n}\n\nvoid WriteOrThrow(int fd, const void *data_void, std::size_t size) {\n const uint8_t *data = static_cast<const uint8_t*>(data_void);\n while (size) {\n#if defined(_WIN32) || defined(_WIN64)\n int ret = write(fd, data, min(static_cast<std::size_t>(INT_MAX), size));\n#else\n ssize_t ret = write(fd, data, size);\n#endif\n if (ret < 1) UTIL_THROW(util::ErrnoException, \"Write failed\");\n data += ret;\n size -= ret;\n }\n}\n\nvoid WriteOrThrow(FILE *to, const void *data, std::size_t size) {\n assert(size);\n UTIL_THROW_IF(1 != std::fwrite(data, size, 1, to), util::ErrnoException, \"Short write; requested size \" << size);\n}\n\nvoid FSyncOrThrow(int fd) {\n\/\/ Apparently windows doesn't have fsync? \n#if !defined(_WIN32) && !defined(_WIN64)\n UTIL_THROW_IF(-1 == fsync(fd), ErrnoException, \"Sync of \" << fd << \" failed.\");\n#endif\n}\n\nnamespace {\nvoid InternalSeek(int fd, int64_t off, int whence) {\n#if defined(_WIN32) || defined(_WIN64)\n UTIL_THROW_IF((__int64)-1 == _lseeki64(fd, off, whence), ErrnoException, \"Windows seek failed\");\n\n#else\n UTIL_THROW_IF((off_t)-1 == lseek64(fd, off, whence), ErrnoException, \"Seek failed\");\n#endif\n}\n} \/\/ namespace\n\nvoid SeekOrThrow(int fd, uint64_t off) {\n InternalSeek(fd, off, SEEK_SET);\n}\n\nvoid AdvanceOrThrow(int fd, int64_t off) {\n InternalSeek(fd, off, SEEK_CUR);\n}\n\nvoid SeekEnd(int fd) {\n InternalSeek(fd, 0, SEEK_END);\n}\n\nstd::FILE *FDOpenOrThrow(scoped_fd &file) {\n std::FILE *ret = fdopen(file.get(), \"r+b\");\n if (!ret) UTIL_THROW(util::ErrnoException, \"Could not fdopen descriptor \" << file.get());\n file.release();\n return ret;\n}\n\nstd::FILE *FDOpenReadOrThrow(scoped_fd &file) {\n std::FILE *ret = fdopen(file.get(), \"rb\");\n if (!ret) UTIL_THROW(util::ErrnoException, \"Could not fdopen descriptor \" << file.get());\n file.release();\n return ret;\n}\n\nTempMaker::TempMaker(const std::string &prefix) : base_(prefix) {\n base_ += \"XXXXXX\";\n}\n\n\/\/ Sigh. Windows temporary file creation is full of race conditions.\n#if defined(_WIN32) || defined(_WIN64)\n\/* mkstemp extracted from libc\/sysdeps\/posix\/tempname.c. Copyright\n (C) 1991-1999, 2000, 2001, 2006 Free Software Foundation, Inc.\n\n The GNU C Library is free software; you can redistribute it and\/or\n modify it under the terms of the GNU Lesser General Public\n License as published by the Free Software Foundation; either\n version 2.1 of the License, or (at your option) any later version. *\/\n\n\/* This has been modified from the original version to rename the function and\n * set the Windows temporary flag. *\/\n\nstatic const char letters[] =\n\"abcdefghijklmnopqrstuvwxyzABCDEFGHIJKLMNOPQRSTUVWXYZ0123456789\";\n\n\/* Generate a temporary file name based on TMPL. TMPL must match the\n rules for mk[s]temp (i.e. end in \"XXXXXX\"). The name constructed\n does not exist at the time of the call to mkstemp. TMPL is\n overwritten with the result. *\/\nint\nmkstemp_and_unlink(char *tmpl)\n{\n int len;\n char *XXXXXX;\n static unsigned long long value;\n unsigned long long random_time_bits;\n unsigned int count;\n int fd = -1;\n int save_errno = errno;\n\n \/* A lower bound on the number of temporary files to attempt to\n generate. The maximum total number of temporary file names that\n can exist for a given template is 62**6. It should never be\n necessary to try all these combinations. Instead if a reasonable\n number of names is tried (we define reasonable as 62**3) fail to\n give the system administrator the chance to remove the problems. *\/\n#define ATTEMPTS_MIN (62 * 62 * 62)\n\n \/* The number of times to attempt to generate a temporary file. To\n conform to POSIX, this must be no smaller than TMP_MAX. *\/\n#if ATTEMPTS_MIN < TMP_MAX\n unsigned int attempts = TMP_MAX;\n#else\n unsigned int attempts = ATTEMPTS_MIN;\n#endif\n\n len = strlen (tmpl);\n if (len < 6 || strcmp (&tmpl[len - 6], \"XXXXXX\"))\n {\n errno = EINVAL;\n return -1;\n }\n\n\/* This is where the Xs start. *\/\n XXXXXX = &tmpl[len - 6];\n\n \/* Get some more or less random data. *\/\n {\n SYSTEMTIME stNow;\n FILETIME ftNow;\n\n \/\/ get system time\n GetSystemTime(&stNow);\n stNow.wMilliseconds = 500;\n if (!SystemTimeToFileTime(&stNow, &ftNow))\n {\n errno = -1;\n return -1;\n }\n\n random_time_bits = (((unsigned long long)ftNow.dwHighDateTime << 32)\n | (unsigned long long)ftNow.dwLowDateTime);\n }\n value += random_time_bits ^ (unsigned long long)GetCurrentThreadId ();\n\n for (count = 0; count < attempts; value += 7777, ++count)\n {\n unsigned long long v = value;\n\n \/* Fill in the random bits. *\/\n XXXXXX[0] = letters[v % 62];\n v \/= 62;\n XXXXXX[1] = letters[v % 62];\n v \/= 62;\n XXXXXX[2] = letters[v % 62];\n v \/= 62;\n XXXXXX[3] = letters[v % 62];\n v \/= 62;\n XXXXXX[4] = letters[v % 62];\n v \/= 62;\n XXXXXX[5] = letters[v % 62];\n\n \/* Modified for windows and to unlink *\/\n \/\/ fd = open (tmpl, O_RDWR | O_CREAT | O_EXCL, _S_IREAD | _S_IWRITE);\n int flags = _O_RDWR | _O_CREAT | _O_EXCL | _O_BINARY;\n flags |= _O_TEMPORARY;\n fd = _open (tmpl, flags, _S_IREAD | _S_IWRITE);\n if (fd >= 0)\n {\n errno = save_errno;\n return fd;\n }\n else if (errno != EEXIST)\n return -1;\n }\n\n \/* We got out of the loop because we ran out of combinations to try. *\/\n errno = EEXIST;\n return -1;\n}\n#else\nint\nmkstemp_and_unlink(char *tmpl) {\n int ret = mkstemp(tmpl);\n if (ret != -1) {\n UTIL_THROW_IF(unlink(tmpl), util::ErrnoException, \"Failed to delete \" << tmpl);\n }\n return ret;\n}\n#endif\n\nint TempMaker::Make() const {\n std::string name(base_);\n name.push_back(0);\n int ret;\n UTIL_THROW_IF(-1 == (ret = mkstemp_and_unlink(&name[0])), util::ErrnoException, \"Failed to make a temporary based on \" << base_);\n return ret;\n}\n\nstd::FILE *TempMaker::MakeFile() const {\n util::scoped_fd file(Make());\n return FDOpenOrThrow(file);\n}\n\n} \/\/ namespace util\n<commit_msg>mac doesn't have lseek64()<commit_after>#define _LARGEFILE64_SOURCE\n\n#include \"util\/file.hh\"\n\n#include \"util\/exception.hh\"\n\n#include <cstdlib>\n#include <cstdio>\n#include <iostream>\n\n#include <assert.h>\n#include <sys\/types.h>\n#include <sys\/stat.h>\n#include <fcntl.h>\n#include <stdint.h>\n\n#if defined(_WIN32) || defined(_WIN64)\n#include <windows.h>\n#include <io.h>\n#include <algorithm>\n#include <limits.h>\n#else\n#include <unistd.h>\n#endif\n\n#ifdef __APPLE__ & __MACH__\n#define lseek64 lseek\n#define open64 open\n#endif\n\nnamespace util {\n\nscoped_fd::~scoped_fd() {\n if (fd_ != -1 && close(fd_)) {\n std::cerr << \"Could not close file \" << fd_ << std::endl;\n std::abort();\n }\n}\n\nscoped_FILE::~scoped_FILE() {\n if (file_ && std::fclose(file_)) {\n std::cerr << \"Could not close file \" << std::endl;\n std::abort();\n }\n}\n\nint OpenReadOrThrow(const char *name) {\n int ret;\n#if defined(_WIN32) || defined(_WIN64)\n UTIL_THROW_IF(-1 == (ret = _open(name, _O_BINARY | _O_RDONLY)), ErrnoException, \"while opening \" << name);\n#else\n UTIL_THROW_IF(-1 == (ret = open(name, O_RDONLY)), ErrnoException, \"while opening \" << name);\n#endif\n return ret;\n}\n\nint CreateOrThrow(const char *name) {\n int ret;\n#if defined(_WIN32) || defined(_WIN64)\n UTIL_THROW_IF(-1 == (ret = _open(name, _O_CREAT | _O_TRUNC | _O_RDWR | _O_BINARY, _S_IREAD | _S_IWRITE)), ErrnoException, \"while creating \" << name);\n#else\n UTIL_THROW_IF(-1 == (ret = open(name, O_CREAT | O_TRUNC | O_RDWR, S_IRUSR | S_IWUSR | S_IRGRP | S_IROTH)), ErrnoException, \"while creating \" << name);\n#endif\n return ret;\n}\n\nuint64_t SizeFile(int fd) {\n#if defined(_WIN32) || defined(_WIN64)\n __int64 ret = _filelengthi64(fd);\n return (ret == -1) ? kBadSize : ret;\n#else\n struct stat sb;\n if (fstat(fd, &sb) == -1 || (!sb.st_size && !S_ISREG(sb.st_mode))) return kBadSize;\n return sb.st_size;\n#endif\n}\n\nvoid ResizeOrThrow(int fd, uint64_t to) {\n#if defined(_WIN32) || defined(_WIN64)\n UTIL_THROW_IF(_chsize_s(fd, to), ErrnoException, \"Resizing to \" << to << \" bytes failed\");\n#else\n UTIL_THROW_IF(ftruncate(fd, to), ErrnoException, \"Resizing to \" << to << \" bytes failed\");\n#endif\n}\n\nstd::size_t PartialRead(int fd, void *to, std::size_t amount) {\n#if defined(_WIN32) || defined(_WIN64)\n amount = min(static_cast<std::size_t>(INT_MAX), amount);\n int ret = _read(fd, to, amount); \n#else\n ssize_t ret = read(fd, to, amount);\n#endif\n UTIL_THROW_IF(ret < 0, ErrnoException, \"Reading \" << amount << \" from fd \" << fd << \" failed.\");\n return static_cast<std::size_t>(ret);\n}\n\nvoid ReadOrThrow(int fd, void *to_void, std::size_t amount) {\n uint8_t *to = static_cast<uint8_t*>(to_void);\n while (amount) {\n std::size_t ret = PartialRead(fd, to, amount);\n UTIL_THROW_IF(ret == 0, EndOfFileException, \" in fd \" << fd << \" but there should be \" << amount << \" more bytes to read.\");\n amount -= ret;\n to += ret;\n }\n}\n\nstd::size_t ReadOrEOF(int fd, void *to_void, std::size_t amount) {\n uint8_t *to = static_cast<uint8_t*>(to_void);\n std::size_t remaining = amount;\n while (remaining) {\n std::size_t ret = PartialRead(fd, to, remaining);\n if (!ret) return amount - remaining;\n remaining -= ret;\n to += ret;\n }\n return amount;\n}\n\nvoid WriteOrThrow(int fd, const void *data_void, std::size_t size) {\n const uint8_t *data = static_cast<const uint8_t*>(data_void);\n while (size) {\n#if defined(_WIN32) || defined(_WIN64)\n int ret = write(fd, data, min(static_cast<std::size_t>(INT_MAX), size));\n#else\n ssize_t ret = write(fd, data, size);\n#endif\n if (ret < 1) UTIL_THROW(util::ErrnoException, \"Write failed\");\n data += ret;\n size -= ret;\n }\n}\n\nvoid WriteOrThrow(FILE *to, const void *data, std::size_t size) {\n assert(size);\n UTIL_THROW_IF(1 != std::fwrite(data, size, 1, to), util::ErrnoException, \"Short write; requested size \" << size);\n}\n\nvoid FSyncOrThrow(int fd) {\n\/\/ Apparently windows doesn't have fsync? \n#if !defined(_WIN32) && !defined(_WIN64)\n UTIL_THROW_IF(-1 == fsync(fd), ErrnoException, \"Sync of \" << fd << \" failed.\");\n#endif\n}\n\nnamespace {\nvoid InternalSeek(int fd, int64_t off, int whence) {\n#if defined(_WIN32) || defined(_WIN64)\n UTIL_THROW_IF((__int64)-1 == _lseeki64(fd, off, whence), ErrnoException, \"Windows seek failed\");\n\n#else\n UTIL_THROW_IF((off_t)-1 == lseek64(fd, off, whence), ErrnoException, \"Seek failed\");\n#endif\n}\n} \/\/ namespace\n\nvoid SeekOrThrow(int fd, uint64_t off) {\n InternalSeek(fd, off, SEEK_SET);\n}\n\nvoid AdvanceOrThrow(int fd, int64_t off) {\n InternalSeek(fd, off, SEEK_CUR);\n}\n\nvoid SeekEnd(int fd) {\n InternalSeek(fd, 0, SEEK_END);\n}\n\nstd::FILE *FDOpenOrThrow(scoped_fd &file) {\n std::FILE *ret = fdopen(file.get(), \"r+b\");\n if (!ret) UTIL_THROW(util::ErrnoException, \"Could not fdopen descriptor \" << file.get());\n file.release();\n return ret;\n}\n\nstd::FILE *FDOpenReadOrThrow(scoped_fd &file) {\n std::FILE *ret = fdopen(file.get(), \"rb\");\n if (!ret) UTIL_THROW(util::ErrnoException, \"Could not fdopen descriptor \" << file.get());\n file.release();\n return ret;\n}\n\nTempMaker::TempMaker(const std::string &prefix) : base_(prefix) {\n base_ += \"XXXXXX\";\n}\n\n\/\/ Sigh. Windows temporary file creation is full of race conditions.\n#if defined(_WIN32) || defined(_WIN64)\n\/* mkstemp extracted from libc\/sysdeps\/posix\/tempname.c. Copyright\n (C) 1991-1999, 2000, 2001, 2006 Free Software Foundation, Inc.\n\n The GNU C Library is free software; you can redistribute it and\/or\n modify it under the terms of the GNU Lesser General Public\n License as published by the Free Software Foundation; either\n version 2.1 of the License, or (at your option) any later version. *\/\n\n\/* This has been modified from the original version to rename the function and\n * set the Windows temporary flag. *\/\n\nstatic const char letters[] =\n\"abcdefghijklmnopqrstuvwxyzABCDEFGHIJKLMNOPQRSTUVWXYZ0123456789\";\n\n\/* Generate a temporary file name based on TMPL. TMPL must match the\n rules for mk[s]temp (i.e. end in \"XXXXXX\"). The name constructed\n does not exist at the time of the call to mkstemp. TMPL is\n overwritten with the result. *\/\nint\nmkstemp_and_unlink(char *tmpl)\n{\n int len;\n char *XXXXXX;\n static unsigned long long value;\n unsigned long long random_time_bits;\n unsigned int count;\n int fd = -1;\n int save_errno = errno;\n\n \/* A lower bound on the number of temporary files to attempt to\n generate. The maximum total number of temporary file names that\n can exist for a given template is 62**6. It should never be\n necessary to try all these combinations. Instead if a reasonable\n number of names is tried (we define reasonable as 62**3) fail to\n give the system administrator the chance to remove the problems. *\/\n#define ATTEMPTS_MIN (62 * 62 * 62)\n\n \/* The number of times to attempt to generate a temporary file. To\n conform to POSIX, this must be no smaller than TMP_MAX. *\/\n#if ATTEMPTS_MIN < TMP_MAX\n unsigned int attempts = TMP_MAX;\n#else\n unsigned int attempts = ATTEMPTS_MIN;\n#endif\n\n len = strlen (tmpl);\n if (len < 6 || strcmp (&tmpl[len - 6], \"XXXXXX\"))\n {\n errno = EINVAL;\n return -1;\n }\n\n\/* This is where the Xs start. *\/\n XXXXXX = &tmpl[len - 6];\n\n \/* Get some more or less random data. *\/\n {\n SYSTEMTIME stNow;\n FILETIME ftNow;\n\n \/\/ get system time\n GetSystemTime(&stNow);\n stNow.wMilliseconds = 500;\n if (!SystemTimeToFileTime(&stNow, &ftNow))\n {\n errno = -1;\n return -1;\n }\n\n random_time_bits = (((unsigned long long)ftNow.dwHighDateTime << 32)\n | (unsigned long long)ftNow.dwLowDateTime);\n }\n value += random_time_bits ^ (unsigned long long)GetCurrentThreadId ();\n\n for (count = 0; count < attempts; value += 7777, ++count)\n {\n unsigned long long v = value;\n\n \/* Fill in the random bits. *\/\n XXXXXX[0] = letters[v % 62];\n v \/= 62;\n XXXXXX[1] = letters[v % 62];\n v \/= 62;\n XXXXXX[2] = letters[v % 62];\n v \/= 62;\n XXXXXX[3] = letters[v % 62];\n v \/= 62;\n XXXXXX[4] = letters[v % 62];\n v \/= 62;\n XXXXXX[5] = letters[v % 62];\n\n \/* Modified for windows and to unlink *\/\n \/\/ fd = open (tmpl, O_RDWR | O_CREAT | O_EXCL, _S_IREAD | _S_IWRITE);\n int flags = _O_RDWR | _O_CREAT | _O_EXCL | _O_BINARY;\n flags |= _O_TEMPORARY;\n fd = _open (tmpl, flags, _S_IREAD | _S_IWRITE);\n if (fd >= 0)\n {\n errno = save_errno;\n return fd;\n }\n else if (errno != EEXIST)\n return -1;\n }\n\n \/* We got out of the loop because we ran out of combinations to try. *\/\n errno = EEXIST;\n return -1;\n}\n#else\nint\nmkstemp_and_unlink(char *tmpl) {\n int ret = mkstemp(tmpl);\n if (ret != -1) {\n UTIL_THROW_IF(unlink(tmpl), util::ErrnoException, \"Failed to delete \" << tmpl);\n }\n return ret;\n}\n#endif\n\nint TempMaker::Make() const {\n std::string name(base_);\n name.push_back(0);\n int ret;\n UTIL_THROW_IF(-1 == (ret = mkstemp_and_unlink(&name[0])), util::ErrnoException, \"Failed to make a temporary based on \" << base_);\n return ret;\n}\n\nstd::FILE *TempMaker::MakeFile() const {\n util::scoped_fd file(Make());\n return FDOpenOrThrow(file);\n}\n\n} \/\/ namespace util\n<|endoftext|>"} {"text":"<commit_before>\/******************************************************************************\n * ____ _ _____ *\n * \/ ___| \/ \\ | ___| C++ *\n * | | \/ _ \\ | |_ Actor *\n * | |___ \/ ___ \\| _| Framework *\n * \\____\/_\/ \\_|_| *\n * *\n * Copyright 2011-2018 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#ifndef CAF_OUTBOUND_PATH_HPP\n#define CAF_OUTBOUND_PATH_HPP\n\n#include <deque>\n#include <vector>\n#include <cstdint>\n#include <cstddef>\n\n#include \"caf\/actor_control_block.hpp\"\n#include \"caf\/downstream_msg.hpp\"\n#include \"caf\/fwd.hpp\"\n#include \"caf\/logger.hpp\"\n#include \"caf\/stream_aborter.hpp\"\n#include \"caf\/stream_slot.hpp\"\n#include \"caf\/system_messages.hpp\"\n\n#include \"caf\/meta\/type_name.hpp\"\n\nnamespace caf {\n\n\/\/\/ State for a single path to a sink of a `downstream_manager`.\nclass outbound_path {\npublic:\n \/\/ -- member types -----------------------------------------------------------\n\n \/\/\/ Propagates graceful shutdowns.\n using regular_shutdown = downstream_msg::close;\n\n \/\/\/ Propagates errors.\n using irregular_shutdown = downstream_msg::forced_close;\n\n \/\/\/ Stores batches until receiving corresponding ACKs.\n using cache_type = std::deque<std::pair<int64_t, downstream_msg::batch>>;\n\n \/\/ -- constants --------------------------------------------------------------\n\n \/\/\/ Stream aborter flag to monitor a path.\n static constexpr const auto aborter_type = stream_aborter::sink_aborter;\n\n \/\/ -- constructors, destructors, and assignment operators --------------------\n\n \/\/\/ Constructs a pending path for given slot and handle.\n outbound_path(stream_slot sender_slot, strong_actor_ptr receiver_hdl);\n\n ~outbound_path();\n\n \/\/ -- downstream communication -----------------------------------------------\n\n \/\/\/ Sends an `open_stream_msg` handshake.\n static void emit_open(local_actor* self, stream_slot slot,\n strong_actor_ptr to, message handshake_data,\n stream_priority prio);\n\n \/\/\/ Sends a `downstream_msg::batch` on this path. Decrements `open_credit` by\n \/\/\/ `xs_size` and increments `next_batch_id` by 1.\n void emit_batch(local_actor* self, long xs_size, message xs);\n\n \/\/\/ Calls `emit_batch` for each chunk in the cache, whereas each chunk is of\n \/\/\/ size `desired_batch_size`. Does nothing for pending paths.\n template <class T>\n void emit_batches(local_actor* self, std::vector<T>& cache,\n bool force_underfull) {\n CAF_LOG_TRACE(CAF_ARG(cache) << CAF_ARG(force_underfull));\n if (pending())\n return;\n CAF_ASSERT(desired_batch_size > 0);\n if (cache.size() == desired_batch_size) {\n emit_batch(self, desired_batch_size, make_message(std::move(cache)));\n return;\n }\n auto i = cache.begin();\n auto e = cache.end();\n while (std::distance(i, e) >= static_cast<ptrdiff_t>(desired_batch_size)) {\n std::vector<T> tmp{std::make_move_iterator(i),\n std::make_move_iterator(i + desired_batch_size)};\n emit_batch(self, desired_batch_size, make_message(std::move(tmp)));\n i += desired_batch_size;\n }\n if (i == e) {\n cache.clear();\n return;\n }\n cache.erase(cache.begin(), i);\n if (force_underfull)\n emit_batch(self, cache.size(), make_message(std::move(cache)));\n }\n\n \/\/\/ Sends a `downstream_msg::close` on this path.\n void emit_regular_shutdown(local_actor* self);\n\n \/\/\/ Sends a `downstream_msg::forced_close` on this path.\n void emit_irregular_shutdown(local_actor* self, error reason);\n\n \/\/\/ Sends a `downstream_msg::forced_close`.\n static void emit_irregular_shutdown(local_actor* self, stream_slots slots,\n const strong_actor_ptr& hdl,\n error reason);\n\n \/\/ -- properties -------------------------------------------------------------\n\n \/\/\/ Returns whether this path is pending, i.e., didn't receive an `ack_open`\n \/\/\/ yet.\n inline bool pending() const noexcept {\n return slots.receiver == invalid_stream_slot;\n }\n\n \/\/ -- member variables -------------------------------------------------------\n\n \/\/\/ Slot IDs for sender (self) and receiver (hdl).\n stream_slots slots;\n\n \/\/\/ Handle to the sink.\n strong_actor_ptr hdl;\n\n \/\/\/ Next expected batch ID.\n int64_t next_batch_id;\n\n \/\/\/ Currently available credit on this path.\n long open_credit;\n\n \/\/\/ Ideal batch size. Configured by the sink.\n uint64_t desired_batch_size;\n\n \/\/\/ ID of the first unacknowledged batch. Note that CAF uses accumulative\n \/\/\/ ACKs, i.e., receiving an ACK with a higher ID is not an error.\n int64_t next_ack_id;\n};\n\n\/\/\/ @relates outbound_path\ntemplate <class Inspector>\ntypename Inspector::result_type inspect(Inspector& f, outbound_path& x) {\n return f(meta::type_name(\"outbound_path\"), x.slots, x.hdl, x.next_batch_id,\n x.open_credit, x.desired_batch_size, x.next_ack_id);\n}\n\n} \/\/ namespace caf\n\n#endif \/\/ CAF_OUTBOUND_PATH_HPP\n<commit_msg>Deal with caches greater than available credit<commit_after>\/******************************************************************************\n * ____ _ _____ *\n * \/ ___| \/ \\ | ___| C++ *\n * | | \/ _ \\ | |_ Actor *\n * | |___ \/ ___ \\| _| Framework *\n * \\____\/_\/ \\_|_| *\n * *\n * Copyright 2011-2018 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#ifndef CAF_OUTBOUND_PATH_HPP\n#define CAF_OUTBOUND_PATH_HPP\n\n#include <deque>\n#include <vector>\n#include <cstdint>\n#include <cstddef>\n\n#include \"caf\/actor_control_block.hpp\"\n#include \"caf\/downstream_msg.hpp\"\n#include \"caf\/fwd.hpp\"\n#include \"caf\/logger.hpp\"\n#include \"caf\/stream_aborter.hpp\"\n#include \"caf\/stream_slot.hpp\"\n#include \"caf\/system_messages.hpp\"\n\n#include \"caf\/detail\/type_traits.hpp\"\n\n#include \"caf\/meta\/type_name.hpp\"\n\nnamespace caf {\n\n\/\/\/ State for a single path to a sink of a `downstream_manager`.\nclass outbound_path {\npublic:\n \/\/ -- member types -----------------------------------------------------------\n\n \/\/\/ Propagates graceful shutdowns.\n using regular_shutdown = downstream_msg::close;\n\n \/\/\/ Propagates errors.\n using irregular_shutdown = downstream_msg::forced_close;\n\n \/\/\/ Stores batches until receiving corresponding ACKs.\n using cache_type = std::deque<std::pair<int64_t, downstream_msg::batch>>;\n\n \/\/ -- constants --------------------------------------------------------------\n\n \/\/\/ Stream aborter flag to monitor a path.\n static constexpr const auto aborter_type = stream_aborter::sink_aborter;\n\n \/\/ -- constructors, destructors, and assignment operators --------------------\n\n \/\/\/ Constructs a pending path for given slot and handle.\n outbound_path(stream_slot sender_slot, strong_actor_ptr receiver_hdl);\n\n ~outbound_path();\n\n \/\/ -- downstream communication -----------------------------------------------\n\n \/\/\/ Sends an `open_stream_msg` handshake.\n static void emit_open(local_actor* self, stream_slot slot,\n strong_actor_ptr to, message handshake_data,\n stream_priority prio);\n\n \/\/\/ Sends a `downstream_msg::batch` on this path. Decrements `open_credit` by\n \/\/\/ `xs_size` and increments `next_batch_id` by 1.\n void emit_batch(local_actor* self, long xs_size, message xs);\n\n template <class Iterator>\n Iterator emit_batches_impl(local_actor* self, Iterator i, Iterator e,\n bool force_underfull) {\n CAF_LOG_TRACE(CAF_ARG(force_underfull));\n using type = detail::decay_t<decltype(*i)>;\n while (std::distance(i, e) >= static_cast<ptrdiff_t>(desired_batch_size)) {\n std::vector<type> tmp{std::make_move_iterator(i),\n std::make_move_iterator(i + desired_batch_size)};\n emit_batch(self, desired_batch_size, make_message(std::move(tmp)));\n i += desired_batch_size;\n }\n if (i != e && force_underfull) {\n std::vector<type> tmp{std::make_move_iterator(i),\n std::make_move_iterator(e)};\n emit_batch(self, tmp.size(), make_message(std::move(tmp)));\n return e;\n }\n return i;\n }\n\n \/\/\/ Calls `emit_batch` for each chunk in the cache, whereas each chunk is of\n \/\/\/ size `desired_batch_size`. Does nothing for pending paths.\n template <class T>\n void emit_batches(local_actor* self, std::vector<T>& cache,\n bool force_underfull) {\n CAF_LOG_TRACE(CAF_ARG(cache) << CAF_ARG(force_underfull));\n if (pending())\n return;\n CAF_ASSERT(desired_batch_size > 0);\n auto first = cache.begin();\n auto last = first + std::min(open_credit, static_cast<long>(cache.size()));\n if (first == last)\n return;\n auto i = emit_batches_impl(self, first, last, force_underfull);\n if (i == cache.end()) {\n cache.clear();\n } else if (i != first) {\n cache.erase(first, i);\n }\n }\n\n \/\/\/ Sends a `downstream_msg::close` on this path.\n void emit_regular_shutdown(local_actor* self);\n\n \/\/\/ Sends a `downstream_msg::forced_close` on this path.\n void emit_irregular_shutdown(local_actor* self, error reason);\n\n \/\/\/ Sends a `downstream_msg::forced_close`.\n static void emit_irregular_shutdown(local_actor* self, stream_slots slots,\n const strong_actor_ptr& hdl,\n error reason);\n\n \/\/ -- properties -------------------------------------------------------------\n\n \/\/\/ Returns whether this path is pending, i.e., didn't receive an `ack_open`\n \/\/\/ yet.\n inline bool pending() const noexcept {\n return slots.receiver == invalid_stream_slot;\n }\n\n \/\/ -- member variables -------------------------------------------------------\n\n \/\/\/ Slot IDs for sender (self) and receiver (hdl).\n stream_slots slots;\n\n \/\/\/ Handle to the sink.\n strong_actor_ptr hdl;\n\n \/\/\/ Next expected batch ID.\n int64_t next_batch_id;\n\n \/\/\/ Currently available credit on this path.\n long open_credit;\n\n \/\/\/ Ideal batch size. Configured by the sink.\n uint64_t desired_batch_size;\n\n \/\/\/ ID of the first unacknowledged batch. Note that CAF uses accumulative\n \/\/\/ ACKs, i.e., receiving an ACK with a higher ID is not an error.\n int64_t next_ack_id;\n};\n\n\/\/\/ @relates outbound_path\ntemplate <class Inspector>\ntypename Inspector::result_type inspect(Inspector& f, outbound_path& x) {\n return f(meta::type_name(\"outbound_path\"), x.slots, x.hdl, x.next_batch_id,\n x.open_credit, x.desired_batch_size, x.next_ack_id);\n}\n\n} \/\/ namespace caf\n\n#endif \/\/ CAF_OUTBOUND_PATH_HPP\n<|endoftext|>"} {"text":"<commit_before>\/\/ Copyright 2016 The Minimal Configuration Manager Authors\n\/\/\n\/\/ Licensed under the Apache License, Version 2.0 (the \"License\");\n\/\/ you may not use this file except in compliance with the License.\n\/\/ You may obtain a copy of the License at\n\/\/\n\/\/ http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n\/\/\n\/\/ Unless required by applicable law or agreed to in writing, software\n\/\/ distributed under the License is distributed on an \"AS IS\" BASIS,\n\/\/ WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n\/\/ See the License for the specific language governing permissions and\n\/\/ limitations under the License.\n\n#include \"luacat\/convert.h\"\n\n#include \"kj\/debug.h\"\n#include \"lua.hpp\"\n\n#include \"luacat\/types.h\"\n\nnamespace mcm {\n\nnamespace luacat {\n\nnamespace {\n struct Reader {\n static const int bufSize = 4096;\n\n kj::InputStream& stream;\n kj::byte buf[bufSize];\n\n explicit Reader(kj::InputStream& s) : stream(s) {}\n };\n\n const char* readStream(lua_State* state, void* data, size_t* size) {\n auto& reader = *reinterpret_cast<Reader*>(data);\n *size = reader.stream.tryRead(reader.buf, 1, Reader::bufSize);\n return reinterpret_cast<char*>(reader.buf);\n }\n} \/\/ namespace\n\nconst kj::ArrayPtr<const kj::byte> luaBytePtr(lua_State* state, int index) {\n size_t len = 0;\n auto s = reinterpret_cast<const kj::byte*>(lua_tolstring(state, index, &len));\n return kj::ArrayPtr<const kj::byte>(s, len);\n}\n\nconst kj::StringPtr luaStringPtr(lua_State* state, int index) {\n size_t len = 0;\n const char* s = lua_tolstring(state, index, &len);\n return kj::StringPtr(s, len);\n}\n\nint luaLoad(lua_State* state, kj::StringPtr name, kj::InputStream& stream) {\n Reader reader(stream);\n return lua_load(state, readStream, &reader, name.cStr(), NULL);\n}\n\nvoid pushLua(lua_State* state, kj::Exception& e) {\n luaL_where(state, 1);\n \/\/ TODO(soon): custom formatting with context\n pushLua(state, e.getDescription());\n lua_concat(state, 2);\n}\n\nvoid copyStruct(lua_State* state, capnp::DynamicStruct::Builder builder) {\n KJ_ASSERT(lua_checkstack(state, 2), \"recursion depth exceeded\");\n auto structName = builder.getSchema().getShortDisplayName();\n KJ_CONTEXT(structName);\n KJ_REQUIRE(lua_istable(state, -1), \"value must be a table\");\n lua_pushnil(state);\n while (lua_next(state, -2)) {\n KJ_REQUIRE(lua_isstring(state, -2), \"non-string key in table\");\n auto key = luaStringPtr(state, -2);\n KJ_CONTEXT(key);\n\n auto field = KJ_REQUIRE_NONNULL(builder.getSchema().findFieldByName(key), \"could not find field\");\n switch (field.getType().which()) {\n case capnp::schema::Type::VOID:\n {\n capnp::DynamicValue::Reader val(capnp::VOID);\n builder.set(field, val);\n }\n break;\n case capnp::schema::Type::BOOL:\n {\n KJ_REQUIRE(lua_isboolean(state, -1), \"non-boolean value\");\n capnp::DynamicValue::Reader val(static_cast<bool>(lua_toboolean(state, -1)));\n builder.set(field, val);\n }\n break;\n case capnp::schema::Type::INT8:\n case capnp::schema::Type::INT16:\n case capnp::schema::Type::INT32:\n case capnp::schema::Type::INT64:\n {\n KJ_REQUIRE(lua_isnumber(state, -1), \"non-number value\");\n int isint = 0;\n capnp::DynamicValue::Reader val(static_cast<int64_t>(lua_tointegerx(state, -1, &isint)));\n KJ_REQUIRE(isint, \"non-integer value\");\n builder.set(field, val);\n }\n break;\n case capnp::schema::Type::UINT8:\n case capnp::schema::Type::UINT16:\n case capnp::schema::Type::UINT32:\n {\n KJ_REQUIRE(lua_isnumber(state, -1), \"non-number value\");\n int isint = 0;\n capnp::DynamicValue::Reader val(static_cast<uint64_t>(lua_tointegerx(state, -1, &isint)));\n KJ_REQUIRE(isint, \"non-integer value\");\n builder.set(field, val);\n }\n break;\n case capnp::schema::Type::UINT64:\n {\n KJ_IF_MAYBE(id, getId(state, -1)) {\n builder.set(field, id->getValue());\n } else if (lua_isnumber(state, -1)) {\n int isint = 0;\n capnp::DynamicValue::Reader val(static_cast<uint64_t>(lua_tointegerx(state, -1, &isint)));\n KJ_REQUIRE(isint, \"non-integer value\");\n builder.set(field, val);\n } else {\n KJ_FAIL_REQUIRE(\"value is not a number or an Id\");\n }\n }\n break;\n case capnp::schema::Type::FLOAT32:\n case capnp::schema::Type::FLOAT64:\n {\n KJ_REQUIRE(lua_isnumber(state, -1), \"non-number value\");\n capnp::DynamicValue::Reader val(lua_tonumber(state, -1));\n builder.set(field, val);\n }\n break;\n case capnp::schema::Type::TEXT:\n {\n KJ_REQUIRE(lua_isstring(state, -1), \"non-string value\");\n capnp::DynamicValue::Reader val(luaStringPtr(state, -1));\n builder.set(field, val);\n }\n break;\n case capnp::schema::Type::DATA:\n {\n KJ_REQUIRE(lua_isstring(state, -1), \"non-string value\");\n capnp::DynamicValue::Reader val(luaBytePtr(state, -1));\n builder.set(field, val);\n }\n break;\n case capnp::schema::Type::LIST:\n {\n KJ_REQUIRE(lua_istable(state, -1), \"non-table value\");\n lua_len(state, -1);\n lua_Integer n = lua_tointeger(state, -1);\n lua_pop(state, 1);\n auto sub = builder.init(field, n).as<capnp::DynamicList>();\n copyList(state, sub);\n }\n break;\n case capnp::schema::Type::ENUM:\n {\n KJ_REQUIRE(lua_isstring(state, -1), \"non-string value\");\n auto sval = luaStringPtr(state, -1);\n auto schema = field.getType().asEnum();\n auto e = KJ_REQUIRE_NONNULL(schema.findEnumerantByName(sval), \"could not find enum value\", sval);\n capnp::DynamicValue::Reader val(e);\n builder.set(field, val);\n }\n break;\n case capnp::schema::Type::STRUCT:\n {\n KJ_REQUIRE(lua_istable(state, -1), \"non-table value\");\n auto sub = builder.init(field).as<capnp::DynamicStruct>();\n copyStruct(state, sub);\n }\n break;\n default:\n KJ_FAIL_REQUIRE(\"can't map field type to Lua\", field.getType().which());\n }\n\n lua_pop(state, 1); \/\/ pop value, now key is on top.\n }\n}\n\nvoid copyList(lua_State* state, capnp::DynamicList::Builder builder) {\n if (builder.size() == 0) {\n return;\n }\n KJ_ASSERT(lua_checkstack(state, 2), \"recursion depth exceeded\");\n switch (builder.getSchema().whichElementType()) {\n case capnp::schema::Type::VOID:\n \/\/ Do nothing.\n break;\n case capnp::schema::Type::BOOL:\n for (lua_Integer i = 0; i < builder.size(); i++) {\n KJ_CONTEXT(\"List(Bool)\", i);\n int ty = lua_geti(state, -1, i + 1);\n KJ_REQUIRE(ty == LUA_TBOOLEAN, \"non-boolean element\");\n capnp::DynamicValue::Reader val(static_cast<bool>(lua_toboolean(state, -1)));\n builder.set(i, val);\n lua_pop(state, 1);\n }\n break;\n case capnp::schema::Type::INT8:\n case capnp::schema::Type::INT16:\n case capnp::schema::Type::INT32:\n case capnp::schema::Type::INT64:\n for (lua_Integer i = 0; i < builder.size(); i++) {\n KJ_CONTEXT(\"List(Int)\", i);\n int ty = lua_geti(state, -1, i + 1);\n KJ_REQUIRE(ty == LUA_TNUMBER, \"non-number element\");\n int isint = 0;\n capnp::DynamicValue::Reader val(static_cast<int64_t>(lua_tointegerx(state, -1, &isint)));\n KJ_REQUIRE(isint, \"non-integer value\");\n builder.set(i, val);\n lua_pop(state, 1);\n }\n break;\n case capnp::schema::Type::UINT8:\n case capnp::schema::Type::UINT16:\n case capnp::schema::Type::UINT32:\n for (lua_Integer i = 0; i < builder.size(); i++) {\n KJ_CONTEXT(\"List(UInt)\", i);\n int ty = lua_geti(state, -1, i + 1);\n KJ_REQUIRE(ty == LUA_TNUMBER, \"non-number element\");\n int isint = 0;\n capnp::DynamicValue::Reader val(static_cast<uint64_t>(lua_tointegerx(state, -1, &isint)));\n KJ_REQUIRE(isint, \"non-integer value\");\n builder.set(i, val);\n lua_pop(state, 1);\n }\n break;\n case capnp::schema::Type::UINT64:\n for (lua_Integer i = 0; i < builder.size(); i++) {\n KJ_CONTEXT(\"List(UInt64)\", i);\n int ty = lua_geti(state, -1, i + 1);\n KJ_IF_MAYBE(id, getId(state, -1)) {\n builder.set(i, id->getValue());\n } else if (ty == LUA_TNUMBER) {\n int isint = 0;\n capnp::DynamicValue::Reader val(static_cast<uint64_t>(lua_tointegerx(state, -1, &isint)));\n KJ_REQUIRE(isint, \"non-integer value\");\n builder.set(i, val);\n } else {\n KJ_FAIL_REQUIRE(\"element is not a number or an Id\");\n }\n lua_pop(state, 1);\n }\n break;\n case capnp::schema::Type::FLOAT32:\n case capnp::schema::Type::FLOAT64:\n for (lua_Integer i = 0; i < builder.size(); i++) {\n KJ_CONTEXT(\"List(Float)\", i);\n int ty = lua_geti(state, -1, i + 1);\n KJ_REQUIRE(ty == LUA_TNUMBER, \"non-number element\");\n capnp::DynamicValue::Reader val(lua_tonumber(state, -1));\n builder.set(i, val);\n lua_pop(state, 1);\n }\n break;\n case capnp::schema::Type::TEXT:\n for (lua_Integer i = 0; i < builder.size(); i++) {\n KJ_CONTEXT(\"List(Text)\", i);\n int ty = lua_geti(state, -1, i + 1);\n KJ_REQUIRE(ty == LUA_TSTRING, \"non-string element\");\n capnp::DynamicValue::Reader val(luaStringPtr(state, -1));\n builder.set(i, val);\n lua_pop(state, 1);\n }\n break;\n case capnp::schema::Type::DATA:\n for (lua_Integer i = 0; i < builder.size(); i++) {\n KJ_CONTEXT(\"List(Data)\", i);\n int ty = lua_geti(state, -1, i + 1);\n KJ_REQUIRE(ty == LUA_TSTRING, \"non-string element\");\n capnp::DynamicValue::Reader val(luaBytePtr(state, -1));\n builder.set(i, val);\n lua_pop(state, 1);\n }\n break;\n case capnp::schema::Type::LIST:\n for (lua_Integer i = 0; i < builder.size(); i++) {\n KJ_CONTEXT(\"List(List(...))\", i);\n int ty = lua_geti(state, -1, i + 1);\n KJ_REQUIRE(ty == LUA_TTABLE, \"non-table element\");\n lua_len(state, -1);\n lua_Integer n = lua_tointeger(state, -1);\n lua_pop(state, 1);\n auto sub = builder.init(i, n).as<capnp::DynamicList>();\n copyList(state, sub);\n lua_pop(state, 1);\n }\n break;\n case capnp::schema::Type::ENUM:\n {\n auto schema = builder.getSchema().getEnumElementType();\n auto enumName = schema.getShortDisplayName();\n for (lua_Integer i = 0; i < builder.size(); i++) {\n KJ_CONTEXT(\"List(enum)\", i, enumName);\n int ty = lua_geti(state, -1, i + 1);\n KJ_REQUIRE(ty == LUA_TSTRING, \"non-string element\");\n auto sval = luaStringPtr(state, -1);\n auto e = KJ_REQUIRE_NONNULL(schema.findEnumerantByName(sval), \"could not find enum value\", sval);\n capnp::DynamicValue::Reader val(e);\n builder.set(i, val);\n lua_pop(state, 1);\n }\n }\n break;\n case capnp::schema::Type::STRUCT:\n {\n auto structName = builder.getSchema().getStructElementType().getShortDisplayName();\n for (lua_Integer i = 0; i < builder.size(); i++) {\n KJ_CONTEXT(\"List(struct)\", i, structName);\n int ty = lua_geti(state, -1, i + 1);\n KJ_REQUIRE(ty == LUA_TTABLE, \"non-table element\");\n copyStruct(state, builder[i].as<capnp::DynamicStruct>());\n lua_pop(state, 1);\n }\n }\n break;\n default:\n KJ_FAIL_REQUIRE(\"can't map type to Lua\", builder.getSchema().whichElementType());\n }\n}\n\n} \/\/ namespace luacat\n} \/\/ namespace mcm\n<commit_msg>luacat: fix string conversion that was not compiling on Darwin<commit_after>\/\/ Copyright 2016 The Minimal Configuration Manager Authors\n\/\/\n\/\/ Licensed under the Apache License, Version 2.0 (the \"License\");\n\/\/ you may not use this file except in compliance with the License.\n\/\/ You may obtain a copy of the License at\n\/\/\n\/\/ http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n\/\/\n\/\/ Unless required by applicable law or agreed to in writing, software\n\/\/ distributed under the License is distributed on an \"AS IS\" BASIS,\n\/\/ WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n\/\/ See the License for the specific language governing permissions and\n\/\/ limitations under the License.\n\n#include \"luacat\/convert.h\"\n\n#include \"kj\/debug.h\"\n#include \"lua.hpp\"\n\n#include \"luacat\/types.h\"\n\nnamespace mcm {\n\nnamespace luacat {\n\nnamespace {\n struct Reader {\n static const int bufSize = 4096;\n\n kj::InputStream& stream;\n kj::byte buf[bufSize];\n\n explicit Reader(kj::InputStream& s) : stream(s) {}\n };\n\n const char* readStream(lua_State* state, void* data, size_t* size) {\n auto& reader = *reinterpret_cast<Reader*>(data);\n *size = reader.stream.tryRead(reader.buf, 1, Reader::bufSize);\n return reinterpret_cast<char*>(reader.buf);\n }\n} \/\/ namespace\n\nconst kj::ArrayPtr<const kj::byte> luaBytePtr(lua_State* state, int index) {\n size_t len = 0;\n auto s = reinterpret_cast<const kj::byte*>(lua_tolstring(state, index, &len));\n return kj::ArrayPtr<const kj::byte>(s, len);\n}\n\nconst kj::StringPtr luaStringPtr(lua_State* state, int index) {\n size_t len = 0;\n const char* s = lua_tolstring(state, index, &len);\n return kj::StringPtr(s, len);\n}\n\nint luaLoad(lua_State* state, kj::StringPtr name, kj::InputStream& stream) {\n Reader reader(stream);\n return lua_load(state, readStream, &reader, name.cStr(), NULL);\n}\n\nvoid pushLua(lua_State* state, kj::Exception& e) {\n luaL_where(state, 1);\n \/\/ TODO(soon): custom formatting with context\n pushLua(state, e.getDescription());\n lua_concat(state, 2);\n}\n\nvoid copyStruct(lua_State* state, capnp::DynamicStruct::Builder builder) {\n KJ_ASSERT(lua_checkstack(state, 2), \"recursion depth exceeded\");\n auto structName = builder.getSchema().getShortDisplayName();\n KJ_CONTEXT(structName);\n KJ_REQUIRE(lua_istable(state, -1), \"value must be a table\");\n lua_pushnil(state);\n while (lua_next(state, -2)) {\n KJ_REQUIRE(lua_isstring(state, -2), \"non-string key in table\");\n auto key = luaStringPtr(state, -2);\n KJ_CONTEXT(key);\n\n auto field = KJ_REQUIRE_NONNULL(builder.getSchema().findFieldByName(key), \"could not find field\");\n switch (field.getType().which()) {\n case capnp::schema::Type::VOID:\n {\n capnp::DynamicValue::Reader val(capnp::VOID);\n builder.set(field, val);\n }\n break;\n case capnp::schema::Type::BOOL:\n {\n KJ_REQUIRE(lua_isboolean(state, -1), \"non-boolean value\");\n capnp::DynamicValue::Reader val(static_cast<bool>(lua_toboolean(state, -1)));\n builder.set(field, val);\n }\n break;\n case capnp::schema::Type::INT8:\n case capnp::schema::Type::INT16:\n case capnp::schema::Type::INT32:\n case capnp::schema::Type::INT64:\n {\n KJ_REQUIRE(lua_isnumber(state, -1), \"non-number value\");\n int isint = 0;\n capnp::DynamicValue::Reader val(static_cast<int64_t>(lua_tointegerx(state, -1, &isint)));\n KJ_REQUIRE(isint, \"non-integer value\");\n builder.set(field, val);\n }\n break;\n case capnp::schema::Type::UINT8:\n case capnp::schema::Type::UINT16:\n case capnp::schema::Type::UINT32:\n {\n KJ_REQUIRE(lua_isnumber(state, -1), \"non-number value\");\n int isint = 0;\n capnp::DynamicValue::Reader val(static_cast<uint64_t>(lua_tointegerx(state, -1, &isint)));\n KJ_REQUIRE(isint, \"non-integer value\");\n builder.set(field, val);\n }\n break;\n case capnp::schema::Type::UINT64:\n {\n KJ_IF_MAYBE(id, getId(state, -1)) {\n builder.set(field, id->getValue());\n } else if (lua_isnumber(state, -1)) {\n int isint = 0;\n capnp::DynamicValue::Reader val(static_cast<uint64_t>(lua_tointegerx(state, -1, &isint)));\n KJ_REQUIRE(isint, \"non-integer value\");\n builder.set(field, val);\n } else {\n KJ_FAIL_REQUIRE(\"value is not a number or an Id\");\n }\n }\n break;\n case capnp::schema::Type::FLOAT32:\n case capnp::schema::Type::FLOAT64:\n {\n KJ_REQUIRE(lua_isnumber(state, -1), \"non-number value\");\n capnp::DynamicValue::Reader val(lua_tonumber(state, -1));\n builder.set(field, val);\n }\n break;\n case capnp::schema::Type::TEXT:\n {\n KJ_REQUIRE(lua_isstring(state, -1), \"non-string value\");\n capnp::DynamicValue::Reader val(luaStringPtr(state, -1));\n builder.set(field, val);\n }\n break;\n case capnp::schema::Type::DATA:\n {\n KJ_REQUIRE(lua_isstring(state, -1), \"non-string value\");\n capnp::DynamicValue::Reader val(luaBytePtr(state, -1));\n builder.set(field, val);\n }\n break;\n case capnp::schema::Type::LIST:\n {\n KJ_REQUIRE(lua_istable(state, -1), \"non-table value\");\n lua_len(state, -1);\n lua_Integer n = lua_tointeger(state, -1);\n lua_pop(state, 1);\n auto sub = builder.init(field, n).as<capnp::DynamicList>();\n copyList(state, sub);\n }\n break;\n case capnp::schema::Type::ENUM:\n {\n KJ_REQUIRE(lua_isstring(state, -1), \"non-string value\");\n auto sval = luaStringPtr(state, -1);\n auto schema = field.getType().asEnum();\n auto e = KJ_REQUIRE_NONNULL(schema.findEnumerantByName(sval), \"could not find enum value\", sval);\n capnp::DynamicValue::Reader val(e);\n builder.set(field, val);\n }\n break;\n case capnp::schema::Type::STRUCT:\n {\n KJ_REQUIRE(lua_istable(state, -1), \"non-table value\");\n auto sub = builder.init(field).as<capnp::DynamicStruct>();\n copyStruct(state, sub);\n }\n break;\n default:\n KJ_FAIL_REQUIRE(\"can't map field type to Lua\",\n static_cast<int>(field.getType().which()));\n }\n\n lua_pop(state, 1); \/\/ pop value, now key is on top.\n }\n}\n\nvoid copyList(lua_State* state, capnp::DynamicList::Builder builder) {\n if (builder.size() == 0) {\n return;\n }\n KJ_ASSERT(lua_checkstack(state, 2), \"recursion depth exceeded\");\n switch (builder.getSchema().whichElementType()) {\n case capnp::schema::Type::VOID:\n \/\/ Do nothing.\n break;\n case capnp::schema::Type::BOOL:\n for (lua_Integer i = 0; i < builder.size(); i++) {\n KJ_CONTEXT(\"List(Bool)\", i);\n int ty = lua_geti(state, -1, i + 1);\n KJ_REQUIRE(ty == LUA_TBOOLEAN, \"non-boolean element\");\n capnp::DynamicValue::Reader val(static_cast<bool>(lua_toboolean(state, -1)));\n builder.set(i, val);\n lua_pop(state, 1);\n }\n break;\n case capnp::schema::Type::INT8:\n case capnp::schema::Type::INT16:\n case capnp::schema::Type::INT32:\n case capnp::schema::Type::INT64:\n for (lua_Integer i = 0; i < builder.size(); i++) {\n KJ_CONTEXT(\"List(Int)\", i);\n int ty = lua_geti(state, -1, i + 1);\n KJ_REQUIRE(ty == LUA_TNUMBER, \"non-number element\");\n int isint = 0;\n capnp::DynamicValue::Reader val(static_cast<int64_t>(lua_tointegerx(state, -1, &isint)));\n KJ_REQUIRE(isint, \"non-integer value\");\n builder.set(i, val);\n lua_pop(state, 1);\n }\n break;\n case capnp::schema::Type::UINT8:\n case capnp::schema::Type::UINT16:\n case capnp::schema::Type::UINT32:\n for (lua_Integer i = 0; i < builder.size(); i++) {\n KJ_CONTEXT(\"List(UInt)\", i);\n int ty = lua_geti(state, -1, i + 1);\n KJ_REQUIRE(ty == LUA_TNUMBER, \"non-number element\");\n int isint = 0;\n capnp::DynamicValue::Reader val(static_cast<uint64_t>(lua_tointegerx(state, -1, &isint)));\n KJ_REQUIRE(isint, \"non-integer value\");\n builder.set(i, val);\n lua_pop(state, 1);\n }\n break;\n case capnp::schema::Type::UINT64:\n for (lua_Integer i = 0; i < builder.size(); i++) {\n KJ_CONTEXT(\"List(UInt64)\", i);\n int ty = lua_geti(state, -1, i + 1);\n KJ_IF_MAYBE(id, getId(state, -1)) {\n builder.set(i, id->getValue());\n } else if (ty == LUA_TNUMBER) {\n int isint = 0;\n capnp::DynamicValue::Reader val(static_cast<uint64_t>(lua_tointegerx(state, -1, &isint)));\n KJ_REQUIRE(isint, \"non-integer value\");\n builder.set(i, val);\n } else {\n KJ_FAIL_REQUIRE(\"element is not a number or an Id\");\n }\n lua_pop(state, 1);\n }\n break;\n case capnp::schema::Type::FLOAT32:\n case capnp::schema::Type::FLOAT64:\n for (lua_Integer i = 0; i < builder.size(); i++) {\n KJ_CONTEXT(\"List(Float)\", i);\n int ty = lua_geti(state, -1, i + 1);\n KJ_REQUIRE(ty == LUA_TNUMBER, \"non-number element\");\n capnp::DynamicValue::Reader val(lua_tonumber(state, -1));\n builder.set(i, val);\n lua_pop(state, 1);\n }\n break;\n case capnp::schema::Type::TEXT:\n for (lua_Integer i = 0; i < builder.size(); i++) {\n KJ_CONTEXT(\"List(Text)\", i);\n int ty = lua_geti(state, -1, i + 1);\n KJ_REQUIRE(ty == LUA_TSTRING, \"non-string element\");\n capnp::DynamicValue::Reader val(luaStringPtr(state, -1));\n builder.set(i, val);\n lua_pop(state, 1);\n }\n break;\n case capnp::schema::Type::DATA:\n for (lua_Integer i = 0; i < builder.size(); i++) {\n KJ_CONTEXT(\"List(Data)\", i);\n int ty = lua_geti(state, -1, i + 1);\n KJ_REQUIRE(ty == LUA_TSTRING, \"non-string element\");\n capnp::DynamicValue::Reader val(luaBytePtr(state, -1));\n builder.set(i, val);\n lua_pop(state, 1);\n }\n break;\n case capnp::schema::Type::LIST:\n for (lua_Integer i = 0; i < builder.size(); i++) {\n KJ_CONTEXT(\"List(List(...))\", i);\n int ty = lua_geti(state, -1, i + 1);\n KJ_REQUIRE(ty == LUA_TTABLE, \"non-table element\");\n lua_len(state, -1);\n lua_Integer n = lua_tointeger(state, -1);\n lua_pop(state, 1);\n auto sub = builder.init(i, n).as<capnp::DynamicList>();\n copyList(state, sub);\n lua_pop(state, 1);\n }\n break;\n case capnp::schema::Type::ENUM:\n {\n auto schema = builder.getSchema().getEnumElementType();\n auto enumName = schema.getShortDisplayName();\n for (lua_Integer i = 0; i < builder.size(); i++) {\n KJ_CONTEXT(\"List(enum)\", i, enumName);\n int ty = lua_geti(state, -1, i + 1);\n KJ_REQUIRE(ty == LUA_TSTRING, \"non-string element\");\n auto sval = luaStringPtr(state, -1);\n auto e = KJ_REQUIRE_NONNULL(schema.findEnumerantByName(sval), \"could not find enum value\", sval);\n capnp::DynamicValue::Reader val(e);\n builder.set(i, val);\n lua_pop(state, 1);\n }\n }\n break;\n case capnp::schema::Type::STRUCT:\n {\n auto structName = builder.getSchema().getStructElementType().getShortDisplayName();\n for (lua_Integer i = 0; i < builder.size(); i++) {\n KJ_CONTEXT(\"List(struct)\", i, structName);\n int ty = lua_geti(state, -1, i + 1);\n KJ_REQUIRE(ty == LUA_TTABLE, \"non-table element\");\n copyStruct(state, builder[i].as<capnp::DynamicStruct>());\n lua_pop(state, 1);\n }\n }\n break;\n default:\n KJ_FAIL_REQUIRE(\"can't map type to Lua\",\n static_cast<int>(builder.getSchema().whichElementType()));\n }\n}\n\n} \/\/ namespace luacat\n} \/\/ namespace mcm\n<|endoftext|>"} {"text":"<commit_before>\/*\n kopetestatusmanager.cpp - Kopete Status Manager\n\n Copyright (c) 2008 by Roman Jarosz <kedgedev@centrum.cz>\n Kopete (c) 2008 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#include \"kopetestatusmanager.h\"\n\n#include <QtCore\/QFile>\n#include <QtXml\/QDomElement>\n\n#include <ksavefile.h>\n#include <kstandarddirs.h>\n\n#include \"kopeteaccountmanager.h\"\n#include \"kopeteaccount.h\"\n#include \"kopetecontact.h\"\n#include \"kopeteonlinestatusmanager.h\"\n#include \"kopetebehaviorsettings.h\"\n#include \"kopetestatusitems.h\"\n#include \"kopeteidletimer.h\"\n\nnamespace Kopete {\n\nStatusManager *StatusManager::instance = 0L;\n\nclass StatusManager::Private\n{\npublic:\n\tStatus::StatusGroup *root;\n\tQHash<QString, Status::StatusItem *> uidHash;\n\n\tint awayTimeout;\n\tbool goAvailable;\n\tbool useCustomStatus;\n\n\tuint globalStatusCategory;\n\tKopete::StatusMessage globalStatusMessage;\n\tKopete::StatusMessage customStatusMessage;\n\t\n\tbool away;\n\tQList<Kopete::Account*> autoAwayAccounts;\n\n\tKopete::IdleTimer* idleTimer;\n};\n\nStatusManager::StatusManager()\n\t: QObject(), d( new Private )\n{\n\td->away = false;\n\td->root = 0;\n\td->idleTimer = 0;\n\tloadXML();\n\n\tloadSettings();\n\tloadBehaviorSettings();\n\tconnect( Kopete::BehaviorSettings::self(), SIGNAL(configChanged()),\n\t this, SLOT(loadBehaviorSettings()) );\n\n\tconnect( Kopete::AccountManager::self(), SIGNAL(accountUnregistered(const Kopete::Account*)),\n\t this, SLOT(accountUnregistered(const Kopete::Account*)));\n}\n\nStatusManager::~StatusManager()\n{\n\tif ( d->idleTimer )\n\t\tdelete d->idleTimer;\n\n\tdelete d->root;\n\tdelete d;\n}\n\nvoid StatusManager::saveXML()\n{\n\tQString filename = KStandardDirs::locateLocal( \"data\", QLatin1String( \"kopete\/statuses.xml\" ) );\n\tKSaveFile file(filename);\n\tif( file.open() )\n\t{\n\t\tQTextStream stream (&file);\n\t\tstream.setCodec(QTextCodec::codecForName(\"UTF-8\"));\n\n\t\tQDomDocument doc( QString::fromLatin1( \"kopete-statuses\" ) );\n\t\tdoc.appendChild( StatusManager::storeStatusItem( d->root ) );\n\t\tdoc.save( stream, 4 );\n\n\t\tfile.close();\n\t}\n}\n\nvoid StatusManager::loadXML()\n{\n\tif ( d->root )\n\t\tdelete d->root;\n\n\td->uidHash.clear();\n\td->root = 0;\n\n\tQString filename = KStandardDirs::locateLocal( \"data\", QLatin1String( \"kopete\/statuses.xml\" ) );\n\n\tQDomDocument doc;\n\tQFile file( filename );\n\tif ( file.open( QIODevice::ReadOnly ) )\n\t{\n\t\tif ( doc.setContent( &file ) )\n\t\t{\n\t\t\tKopete::Status::StatusItem* rootItem = StatusManager::parseStatusItem( doc.documentElement() );\n\t\t\tif ( rootItem )\n\t\t\t{\n\t\t\t\tif ( rootItem->isGroup() )\n\t\t\t\t\td->root = qobject_cast<Status::StatusGroup *>(rootItem);\n\t\t\t\telse\n\t\t\t\t\tdelete rootItem;\n\t\t\t}\n\t\t}\n\t\tfile.close();\n\t}\n\t\n\tif ( !d->root )\n\t{\n\t\td->root = defaultStatuses();\n\t\tsaveXML();\n\t}\n\n\tupdateUidHash( d->root );\n}\n\nStatusManager *StatusManager::self()\n{\n\tif ( !instance )\n\t\tinstance = new StatusManager;\n\n\treturn instance;\n}\n\nvoid StatusManager::setRootGroup( Kopete::Status::StatusGroup *rootGroup )\n{\n\tif ( !rootGroup || rootGroup == d->root )\n\t\treturn;\n\n\tif ( d->root )\n\t\tdelete d->root;\n\n\td->uidHash.clear();\n\td->root = rootGroup;\n\tupdateUidHash( d->root );\n\t\n\temit changed();\n}\n\nStatus::StatusGroup *StatusManager::getRootGroup() const\n{\n\treturn d->root;\n}\n\nKopete::Status::StatusGroup *StatusManager::copyRootGroup() const\n{\n\treturn qobject_cast<Kopete::Status::StatusGroup *>(d->root->copy());\n}\n\nconst Status::StatusItem *StatusManager::itemForUid( const QString &uid ) const\n{\n\treturn d->uidHash.value( uid, 0 );\n}\n\nQDomElement StatusManager::storeStatusItem( const Status::StatusItem *item )\n{\n\tQDomDocument statusDoc;\n\tQString rootName = ( item->isGroup() ) ? QLatin1String( \"group\" ) : QLatin1String( \"status\" );\n\tstatusDoc.appendChild( statusDoc.createElement( rootName ) );\n\tstatusDoc.documentElement().setAttribute( \"uid\", item->uid() );\n\tstatusDoc.documentElement().setAttribute( \"category\", item->category() );\n\n\tQDomElement title = statusDoc.createElement( QLatin1String( \"title\" ) );\n\ttitle.appendChild( statusDoc.createTextNode( item->title() ) );\n\tstatusDoc.documentElement().appendChild( title );\n\n\tif ( item->isGroup() )\n\t{\n\t\tconst Status::StatusGroup *group = qobject_cast<const Kopete::Status::StatusGroup*>( item );\n\t\tconst QList<Status::StatusItem *> childs = group->childList();\n\t\tforeach ( Status::StatusItem *child , childs )\n\t\t\tstatusDoc.documentElement().appendChild( storeStatusItem( child ) );\n\t}\n\telse\n\t{\n\t\tconst Status::Status *status = qobject_cast<const Kopete::Status::Status*>( item );\n\t\tQDomElement message = statusDoc.createElement( QLatin1String( \"message\" ) );\n\t\tmessage.appendChild( statusDoc.createTextNode( status->message() ) );\n\t\tstatusDoc.documentElement().appendChild( message );\n\t}\n\n\treturn statusDoc.documentElement();\n}\n\nStatus::StatusItem *StatusManager::parseStatusItem( QDomElement element )\n{\n\tif ( element.isNull() )\n\t\treturn 0;\n\t\t\n\tif ( element.tagName() == QString::fromUtf8( \"group\" ) )\n\t{\n\t\tStatus::StatusGroup* group = new Status::StatusGroup( element.attribute( \"uid\" ) );\n\t\tgroup->setCategory( (OnlineStatusManager::Category)element.attribute( \"category\", \"0\" ).toInt() );\n\n\t\tQDomNode childNode = element.firstChild();\n\t\twhile ( !childNode.isNull() )\n\t\t{\n\t\t\tQDomElement childElement = childNode.toElement();\n\t\t\tif ( childElement.tagName() == QLatin1String( \"title\" ) )\n\t\t\t\tgroup->setTitle( childElement.text() );\n\t\t\telse if ( childElement.tagName() == QLatin1String( \"group\" ) || childElement.tagName() == QLatin1String( \"status\" ) )\n\t\t\t{\n\t\t\t\tStatus::StatusItem *item = StatusManager::parseStatusItem( childElement );\n\t\t\t\tif ( item )\n\t\t\t\t\tgroup->appendChild( item );\n\t\t\t}\n\t\t\tchildNode = childNode.nextSibling();\n\t\t}\n\t\treturn group;\n\t}\n\telse if ( element.tagName() == QString::fromUtf8( \"status\" ) )\n\t{\n\t\tStatus::Status* status = new Status::Status( element.attribute( \"uid\" ) );\n\t\tstatus->setCategory( (OnlineStatusManager::Category)element.attribute( \"category\", \"0\" ).toInt() );\n\t\t\n\t\tQDomNode childNode = element.firstChild();\n\t\twhile ( !childNode.isNull() )\n\t\t{\n\t\t\tQDomElement childElement = childNode.toElement();\n\t\t\tif ( childElement.tagName() == QLatin1String( \"title\" ) )\n\t\t\t\tstatus->setTitle( childElement.text() );\n\t\t\telse if ( childElement.tagName() == QLatin1String( \"message\" ) )\n\t\t\t\tstatus->setMessage( childElement.text() );\n\n\t\t\tchildNode = childNode.nextSibling();\n\t\t}\n\t\treturn status;\n\t}\n\n\treturn 0;\n}\n\nvoid StatusManager::updateUidHash( Status::StatusItem *item )\n{\n\tif ( item->isGroup() )\n\t{\n\t\tKopete::Status::StatusGroup *group = qobject_cast<Kopete::Status::StatusGroup*>(item);\n\t\tQList<Kopete::Status::StatusItem*> childs = group->childList();\n\t\tforeach( Kopete::Status::StatusItem* child, childs )\n\t\t\tupdateUidHash( child );\n\t}\n\telse\n\t{\n\t\td->uidHash[item->uid()] = item;\n\t}\n}\n\nStatus::StatusGroup *StatusManager::defaultStatuses() const\n{\n\tStatus::StatusGroup* group = new Status::StatusGroup();\n\t\n\tStatus::Status* status = new Status::Status();\n\tstatus->setTitle( i18n( \"Online\" ) );\n\tstatus->setCategory( OnlineStatusManager::Online );\n\tgroup->appendChild( status );\n\n\tstatus = new Status::Status();\n\tstatus->setTitle( i18n( \"Away\" ) );\n\tstatus->setMessage( i18n( \"I am gone right now, but I will be back later\" ) );\n\tstatus->setCategory( OnlineStatusManager::Away );\n\tgroup->appendChild( status );\n\n\tstatus = new Status::Status();\n\tstatus->setTitle( i18n( \"Busy\" ) );\n\tstatus->setMessage( i18n( \"Sorry, I am busy right now\" ) );\n\tstatus->setCategory( OnlineStatusManager::Busy );\n\tgroup->appendChild( status );\n\n\tstatus = new Status::Status();\n\tstatus->setTitle( i18n( \"Offline\" ) );\n\tstatus->setCategory( OnlineStatusManager::Offline );\n\tgroup->appendChild( status );\n\n\treturn group;\n}\n\nvoid StatusManager::setGlobalStatus( uint category, const Kopete::StatusMessage &statusMessage )\n{\n\td->globalStatusCategory = category;\n\td->globalStatusMessage = statusMessage;\n\n\tKConfigGroup config( KGlobal::config(), \"Status Manager\" );\n\tconfig.writeEntry( \"GlobalStatusCategory\", d->globalStatusCategory );\n\tconfig.writeEntry( \"GlobalStatusTitle\", d->globalStatusMessage.title() );\n\tconfig.writeEntry( \"GlobalStatusMessage\", d->globalStatusMessage.message() );\n\tconfig.sync();\n\n\temit globalStatusChanged();\n}\n\nvoid StatusManager::setGlobalStatusMessage( const Kopete::StatusMessage &statusMessage )\n{\n\td->globalStatusMessage = statusMessage;\n\t\n\tKConfigGroup config( KGlobal::config(), \"Status Manager\" );\n\tconfig.writeEntry( \"GlobalStatusTitle\", d->globalStatusMessage.title() );\n\tconfig.writeEntry( \"GlobalStatusMessage\", d->globalStatusMessage.message() );\n\tconfig.sync();\n\n\temit globalStatusChanged();\n}\n\nKopete::StatusMessage StatusManager::globalStatusMessage() const\n{\n\treturn d->globalStatusMessage;\n}\n\nvoid StatusManager::setActive()\n{\n\tkDebug(14010) << \"Found activity on desktop, setting accounts online\";\n\tif( d->away )\n\t{\n\t\td->away = false;\n\t\tif ( d->goAvailable )\n\t\t{\n\t\t\tQList<Kopete::Account*>::iterator it, itEnd = d->autoAwayAccounts.end();\n\t\t\tfor( it = d->autoAwayAccounts.begin(); it != itEnd; ++it )\n\t\t\t{\n\t\t\t\tif( (*it)->isConnected() && (*it)->isAway() )\n\t\t\t\t{\n\t\t\t\t\t(*it)->setOnlineStatus( Kopete::OnlineStatusManager::self()->onlineStatus( (*it)->protocol(),\n\t\t\t\t\t\tKopete::OnlineStatusManager::Online ) );\n\t\t\t\t}\n\t\t\t}\n\t\t\td->autoAwayAccounts.clear();\n\t\t}\n\t}\n}\n\nvoid StatusManager::setAutoAway()\n{\n\tkDebug(14010) << \"Going AutoAway!\";\n\tif ( !d->away )\n\t{\n\t\td->away = true;\n\t\t\n\t\t\/\/ Set all accounts that are not away already to away.\n\t\t\/\/ We remember them so later we only set the accounts to\n\t\t\/\/ available that we set to away (and not the user).\n\t\tQList<Kopete::Account *> accountList = Kopete::AccountManager::self()->accounts();\n\n\t\tQList<Kopete::Account*>::iterator it, itEnd = accountList.end();\n\t\tfor( it = accountList.begin(); it != itEnd; ++it )\n\t\t{\n\t\t\tif( (*it)->myself()->onlineStatus().status() == Kopete::OnlineStatus::Online )\n\t\t\t{\n\t\t\t\td->autoAwayAccounts.append( (*it) );\n\t\t\t\t\n\t\t\t\tif( d->useCustomStatus )\n\t\t\t\t{\n\t\t\t\t\t\/\/ Display a specific away message\n\t\t\t\t\t(*it)->setOnlineStatus( Kopete::OnlineStatusManager::self()->onlineStatus( (*it)->protocol(),\n\t\t\t\t\t\tKopete::OnlineStatusManager::Idle ), d->customStatusMessage );\n\t\t\t\t}\n\t\t\t\telse\n\t\t\t\t{\n\t\t\t\t\t\/\/ Display the last global away message used\n\t\t\t\t\t(*it)->setOnlineStatus( Kopete::OnlineStatusManager::self()->onlineStatus( (*it)->protocol(),\n\t\t\t\t\t\tKopete::OnlineStatusManager::Idle ), d->globalStatusMessage );\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n}\n\nbool StatusManager::autoAway()\n{\n\treturn d->away;\n}\n\nbool StatusManager::globalAway()\n{\n\treturn ( d->globalStatusCategory == OnlineStatusManager::Away ||\n\t d->globalStatusCategory == OnlineStatusManager::ExtendedAway ||\n\t d->globalStatusCategory == OnlineStatusManager::Busy );\n}\n\nvoid StatusManager::accountUnregistered( const Kopete::Account *account )\n{\n\td->autoAwayAccounts.removeAll( const_cast<Kopete::Account *>(account) );\n}\n\nvoid StatusManager::loadSettings()\n{\n\tKConfigGroup config( KGlobal::config(), \"Status Manager\" );\n\td->globalStatusCategory = config.readEntry( \"GlobalStatusCategory\", 0 );\n\n\tKopete::StatusMessage statusMessage;\n\tstatusMessage.setTitle( config.readEntry( \"GlobalStatusTitle\", QString() ) );\n\tstatusMessage.setMessage( config.readEntry( \"GlobalStatusMessage\", QString() ) );\n\td->globalStatusMessage = statusMessage;\n}\n\nvoid StatusManager::loadBehaviorSettings()\n{\n\td->awayTimeout = Kopete::BehaviorSettings::self()->autoAwayTimeout();\n\td->goAvailable = Kopete::BehaviorSettings::self()->autoAwayGoAvailable();\n\td->useCustomStatus = Kopete::BehaviorSettings::self()->useCustomAwayMessage();\n\t\n\tKopete::StatusMessage customStatusMessage;\n\tcustomStatusMessage.setTitle( Kopete::BehaviorSettings::self()->autoAwayCustomTitle() );\n\tcustomStatusMessage.setMessage( Kopete::BehaviorSettings::self()->autoAwayCustomMessage() );\n\td->customStatusMessage = customStatusMessage;\n\n\tKopete::IdleTimer* idleTimer = Kopete::IdleTimer::self();\n\tidleTimer->unregisterTimeout( this );\n\t\n\tif ( Kopete::BehaviorSettings::self()->useAutoAway() )\n\t\tidleTimer->registerTimeout( d->awayTimeout, this, SLOT(setActive()), SLOT(setAutoAway()) );\n}\n\n}\n\n#include \"kopetestatusmanager.moc\"\n<commit_msg>add invisible state by default. string is already used in other places.<commit_after>\/*\n kopetestatusmanager.cpp - Kopete Status Manager\n\n Copyright (c) 2008 by Roman Jarosz <kedgedev@centrum.cz>\n Kopete (c) 2008 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#include \"kopetestatusmanager.h\"\n\n#include <QtCore\/QFile>\n#include <QtXml\/QDomElement>\n\n#include <ksavefile.h>\n#include <kstandarddirs.h>\n\n#include \"kopeteaccountmanager.h\"\n#include \"kopeteaccount.h\"\n#include \"kopetecontact.h\"\n#include \"kopeteonlinestatusmanager.h\"\n#include \"kopetebehaviorsettings.h\"\n#include \"kopetestatusitems.h\"\n#include \"kopeteidletimer.h\"\n\nnamespace Kopete {\n\nStatusManager *StatusManager::instance = 0L;\n\nclass StatusManager::Private\n{\npublic:\n\tStatus::StatusGroup *root;\n\tQHash<QString, Status::StatusItem *> uidHash;\n\n\tint awayTimeout;\n\tbool goAvailable;\n\tbool useCustomStatus;\n\n\tuint globalStatusCategory;\n\tKopete::StatusMessage globalStatusMessage;\n\tKopete::StatusMessage customStatusMessage;\n\t\n\tbool away;\n\tQList<Kopete::Account*> autoAwayAccounts;\n\n\tKopete::IdleTimer* idleTimer;\n};\n\nStatusManager::StatusManager()\n\t: QObject(), d( new Private )\n{\n\td->away = false;\n\td->root = 0;\n\td->idleTimer = 0;\n\tloadXML();\n\n\tloadSettings();\n\tloadBehaviorSettings();\n\tconnect( Kopete::BehaviorSettings::self(), SIGNAL(configChanged()),\n\t this, SLOT(loadBehaviorSettings()) );\n\n\tconnect( Kopete::AccountManager::self(), SIGNAL(accountUnregistered(const Kopete::Account*)),\n\t this, SLOT(accountUnregistered(const Kopete::Account*)));\n}\n\nStatusManager::~StatusManager()\n{\n\tif ( d->idleTimer )\n\t\tdelete d->idleTimer;\n\n\tdelete d->root;\n\tdelete d;\n}\n\nvoid StatusManager::saveXML()\n{\n\tQString filename = KStandardDirs::locateLocal( \"data\", QLatin1String( \"kopete\/statuses.xml\" ) );\n\tKSaveFile file(filename);\n\tif( file.open() )\n\t{\n\t\tQTextStream stream (&file);\n\t\tstream.setCodec(QTextCodec::codecForName(\"UTF-8\"));\n\n\t\tQDomDocument doc( QString::fromLatin1( \"kopete-statuses\" ) );\n\t\tdoc.appendChild( StatusManager::storeStatusItem( d->root ) );\n\t\tdoc.save( stream, 4 );\n\n\t\tfile.close();\n\t}\n}\n\nvoid StatusManager::loadXML()\n{\n\tif ( d->root )\n\t\tdelete d->root;\n\n\td->uidHash.clear();\n\td->root = 0;\n\n\tQString filename = KStandardDirs::locateLocal( \"data\", QLatin1String( \"kopete\/statuses.xml\" ) );\n\n\tQDomDocument doc;\n\tQFile file( filename );\n\tif ( file.open( QIODevice::ReadOnly ) )\n\t{\n\t\tif ( doc.setContent( &file ) )\n\t\t{\n\t\t\tKopete::Status::StatusItem* rootItem = StatusManager::parseStatusItem( doc.documentElement() );\n\t\t\tif ( rootItem )\n\t\t\t{\n\t\t\t\tif ( rootItem->isGroup() )\n\t\t\t\t\td->root = qobject_cast<Status::StatusGroup *>(rootItem);\n\t\t\t\telse\n\t\t\t\t\tdelete rootItem;\n\t\t\t}\n\t\t}\n\t\tfile.close();\n\t}\n\t\n\tif ( !d->root )\n\t{\n\t\td->root = defaultStatuses();\n\t\tsaveXML();\n\t}\n\n\tupdateUidHash( d->root );\n}\n\nStatusManager *StatusManager::self()\n{\n\tif ( !instance )\n\t\tinstance = new StatusManager;\n\n\treturn instance;\n}\n\nvoid StatusManager::setRootGroup( Kopete::Status::StatusGroup *rootGroup )\n{\n\tif ( !rootGroup || rootGroup == d->root )\n\t\treturn;\n\n\tif ( d->root )\n\t\tdelete d->root;\n\n\td->uidHash.clear();\n\td->root = rootGroup;\n\tupdateUidHash( d->root );\n\t\n\temit changed();\n}\n\nStatus::StatusGroup *StatusManager::getRootGroup() const\n{\n\treturn d->root;\n}\n\nKopete::Status::StatusGroup *StatusManager::copyRootGroup() const\n{\n\treturn qobject_cast<Kopete::Status::StatusGroup *>(d->root->copy());\n}\n\nconst Status::StatusItem *StatusManager::itemForUid( const QString &uid ) const\n{\n\treturn d->uidHash.value( uid, 0 );\n}\n\nQDomElement StatusManager::storeStatusItem( const Status::StatusItem *item )\n{\n\tQDomDocument statusDoc;\n\tQString rootName = ( item->isGroup() ) ? QLatin1String( \"group\" ) : QLatin1String( \"status\" );\n\tstatusDoc.appendChild( statusDoc.createElement( rootName ) );\n\tstatusDoc.documentElement().setAttribute( \"uid\", item->uid() );\n\tstatusDoc.documentElement().setAttribute( \"category\", item->category() );\n\n\tQDomElement title = statusDoc.createElement( QLatin1String( \"title\" ) );\n\ttitle.appendChild( statusDoc.createTextNode( item->title() ) );\n\tstatusDoc.documentElement().appendChild( title );\n\n\tif ( item->isGroup() )\n\t{\n\t\tconst Status::StatusGroup *group = qobject_cast<const Kopete::Status::StatusGroup*>( item );\n\t\tconst QList<Status::StatusItem *> childs = group->childList();\n\t\tforeach ( Status::StatusItem *child , childs )\n\t\t\tstatusDoc.documentElement().appendChild( storeStatusItem( child ) );\n\t}\n\telse\n\t{\n\t\tconst Status::Status *status = qobject_cast<const Kopete::Status::Status*>( item );\n\t\tQDomElement message = statusDoc.createElement( QLatin1String( \"message\" ) );\n\t\tmessage.appendChild( statusDoc.createTextNode( status->message() ) );\n\t\tstatusDoc.documentElement().appendChild( message );\n\t}\n\n\treturn statusDoc.documentElement();\n}\n\nStatus::StatusItem *StatusManager::parseStatusItem( QDomElement element )\n{\n\tif ( element.isNull() )\n\t\treturn 0;\n\t\t\n\tif ( element.tagName() == QString::fromUtf8( \"group\" ) )\n\t{\n\t\tStatus::StatusGroup* group = new Status::StatusGroup( element.attribute( \"uid\" ) );\n\t\tgroup->setCategory( (OnlineStatusManager::Category)element.attribute( \"category\", \"0\" ).toInt() );\n\n\t\tQDomNode childNode = element.firstChild();\n\t\twhile ( !childNode.isNull() )\n\t\t{\n\t\t\tQDomElement childElement = childNode.toElement();\n\t\t\tif ( childElement.tagName() == QLatin1String( \"title\" ) )\n\t\t\t\tgroup->setTitle( childElement.text() );\n\t\t\telse if ( childElement.tagName() == QLatin1String( \"group\" ) || childElement.tagName() == QLatin1String( \"status\" ) )\n\t\t\t{\n\t\t\t\tStatus::StatusItem *item = StatusManager::parseStatusItem( childElement );\n\t\t\t\tif ( item )\n\t\t\t\t\tgroup->appendChild( item );\n\t\t\t}\n\t\t\tchildNode = childNode.nextSibling();\n\t\t}\n\t\treturn group;\n\t}\n\telse if ( element.tagName() == QString::fromUtf8( \"status\" ) )\n\t{\n\t\tStatus::Status* status = new Status::Status( element.attribute( \"uid\" ) );\n\t\tstatus->setCategory( (OnlineStatusManager::Category)element.attribute( \"category\", \"0\" ).toInt() );\n\t\t\n\t\tQDomNode childNode = element.firstChild();\n\t\twhile ( !childNode.isNull() )\n\t\t{\n\t\t\tQDomElement childElement = childNode.toElement();\n\t\t\tif ( childElement.tagName() == QLatin1String( \"title\" ) )\n\t\t\t\tstatus->setTitle( childElement.text() );\n\t\t\telse if ( childElement.tagName() == QLatin1String( \"message\" ) )\n\t\t\t\tstatus->setMessage( childElement.text() );\n\n\t\t\tchildNode = childNode.nextSibling();\n\t\t}\n\t\treturn status;\n\t}\n\n\treturn 0;\n}\n\nvoid StatusManager::updateUidHash( Status::StatusItem *item )\n{\n\tif ( item->isGroup() )\n\t{\n\t\tKopete::Status::StatusGroup *group = qobject_cast<Kopete::Status::StatusGroup*>(item);\n\t\tQList<Kopete::Status::StatusItem*> childs = group->childList();\n\t\tforeach( Kopete::Status::StatusItem* child, childs )\n\t\t\tupdateUidHash( child );\n\t}\n\telse\n\t{\n\t\td->uidHash[item->uid()] = item;\n\t}\n}\n\nStatus::StatusGroup *StatusManager::defaultStatuses() const\n{\n\tStatus::StatusGroup* group = new Status::StatusGroup();\n\t\n\tStatus::Status* status = new Status::Status();\n\tstatus->setTitle( i18n( \"Online\" ) );\n\tstatus->setCategory( OnlineStatusManager::Online );\n\tgroup->appendChild( status );\n\n\tstatus = new Status::Status();\n\tstatus->setTitle( i18n( \"Away\" ) );\n\tstatus->setMessage( i18n( \"I am gone right now, but I will be back later\" ) );\n\tstatus->setCategory( OnlineStatusManager::Away );\n\tgroup->appendChild( status );\n\n\tstatus = new Status::Status();\n\tstatus->setTitle( i18n( \"Busy\" ) );\n\tstatus->setMessage( i18n( \"Sorry, I am busy right now\" ) );\n\tstatus->setCategory( OnlineStatusManager::Busy );\n\tgroup->appendChild( status );\n\n\tstatus = new Status::Status();\n\tstatus->setTitle( i18n( \"Invisible\" ) );\n\tstatus->setCategory( OnlineStatusManager::Invisible );\n\tgroup->appendChild( status );\n\n\tstatus = new Status::Status();\n\tstatus->setTitle( i18n( \"Offline\" ) );\n\tstatus->setCategory( OnlineStatusManager::Offline );\n\tgroup->appendChild( status );\n\n\treturn group;\n}\n\nvoid StatusManager::setGlobalStatus( uint category, const Kopete::StatusMessage &statusMessage )\n{\n\td->globalStatusCategory = category;\n\td->globalStatusMessage = statusMessage;\n\n\tKConfigGroup config( KGlobal::config(), \"Status Manager\" );\n\tconfig.writeEntry( \"GlobalStatusCategory\", d->globalStatusCategory );\n\tconfig.writeEntry( \"GlobalStatusTitle\", d->globalStatusMessage.title() );\n\tconfig.writeEntry( \"GlobalStatusMessage\", d->globalStatusMessage.message() );\n\tconfig.sync();\n\n\temit globalStatusChanged();\n}\n\nvoid StatusManager::setGlobalStatusMessage( const Kopete::StatusMessage &statusMessage )\n{\n\td->globalStatusMessage = statusMessage;\n\t\n\tKConfigGroup config( KGlobal::config(), \"Status Manager\" );\n\tconfig.writeEntry( \"GlobalStatusTitle\", d->globalStatusMessage.title() );\n\tconfig.writeEntry( \"GlobalStatusMessage\", d->globalStatusMessage.message() );\n\tconfig.sync();\n\n\temit globalStatusChanged();\n}\n\nKopete::StatusMessage StatusManager::globalStatusMessage() const\n{\n\treturn d->globalStatusMessage;\n}\n\nvoid StatusManager::setActive()\n{\n\tkDebug(14010) << \"Found activity on desktop, setting accounts online\";\n\tif( d->away )\n\t{\n\t\td->away = false;\n\t\tif ( d->goAvailable )\n\t\t{\n\t\t\tQList<Kopete::Account*>::iterator it, itEnd = d->autoAwayAccounts.end();\n\t\t\tfor( it = d->autoAwayAccounts.begin(); it != itEnd; ++it )\n\t\t\t{\n\t\t\t\tif( (*it)->isConnected() && (*it)->isAway() )\n\t\t\t\t{\n\t\t\t\t\t(*it)->setOnlineStatus( Kopete::OnlineStatusManager::self()->onlineStatus( (*it)->protocol(),\n\t\t\t\t\t\tKopete::OnlineStatusManager::Online ) );\n\t\t\t\t}\n\t\t\t}\n\t\t\td->autoAwayAccounts.clear();\n\t\t}\n\t}\n}\n\nvoid StatusManager::setAutoAway()\n{\n\tkDebug(14010) << \"Going AutoAway!\";\n\tif ( !d->away )\n\t{\n\t\td->away = true;\n\t\t\n\t\t\/\/ Set all accounts that are not away already to away.\n\t\t\/\/ We remember them so later we only set the accounts to\n\t\t\/\/ available that we set to away (and not the user).\n\t\tQList<Kopete::Account *> accountList = Kopete::AccountManager::self()->accounts();\n\n\t\tQList<Kopete::Account*>::iterator it, itEnd = accountList.end();\n\t\tfor( it = accountList.begin(); it != itEnd; ++it )\n\t\t{\n\t\t\tif( (*it)->myself()->onlineStatus().status() == Kopete::OnlineStatus::Online )\n\t\t\t{\n\t\t\t\td->autoAwayAccounts.append( (*it) );\n\t\t\t\t\n\t\t\t\tif( d->useCustomStatus )\n\t\t\t\t{\n\t\t\t\t\t\/\/ Display a specific away message\n\t\t\t\t\t(*it)->setOnlineStatus( Kopete::OnlineStatusManager::self()->onlineStatus( (*it)->protocol(),\n\t\t\t\t\t\tKopete::OnlineStatusManager::Idle ), d->customStatusMessage );\n\t\t\t\t}\n\t\t\t\telse\n\t\t\t\t{\n\t\t\t\t\t\/\/ Display the last global away message used\n\t\t\t\t\t(*it)->setOnlineStatus( Kopete::OnlineStatusManager::self()->onlineStatus( (*it)->protocol(),\n\t\t\t\t\t\tKopete::OnlineStatusManager::Idle ), d->globalStatusMessage );\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n}\n\nbool StatusManager::autoAway()\n{\n\treturn d->away;\n}\n\nbool StatusManager::globalAway()\n{\n\treturn ( d->globalStatusCategory == OnlineStatusManager::Away ||\n\t d->globalStatusCategory == OnlineStatusManager::ExtendedAway ||\n\t d->globalStatusCategory == OnlineStatusManager::Busy );\n}\n\nvoid StatusManager::accountUnregistered( const Kopete::Account *account )\n{\n\td->autoAwayAccounts.removeAll( const_cast<Kopete::Account *>(account) );\n}\n\nvoid StatusManager::loadSettings()\n{\n\tKConfigGroup config( KGlobal::config(), \"Status Manager\" );\n\td->globalStatusCategory = config.readEntry( \"GlobalStatusCategory\", 0 );\n\n\tKopete::StatusMessage statusMessage;\n\tstatusMessage.setTitle( config.readEntry( \"GlobalStatusTitle\", QString() ) );\n\tstatusMessage.setMessage( config.readEntry( \"GlobalStatusMessage\", QString() ) );\n\td->globalStatusMessage = statusMessage;\n}\n\nvoid StatusManager::loadBehaviorSettings()\n{\n\td->awayTimeout = Kopete::BehaviorSettings::self()->autoAwayTimeout();\n\td->goAvailable = Kopete::BehaviorSettings::self()->autoAwayGoAvailable();\n\td->useCustomStatus = Kopete::BehaviorSettings::self()->useCustomAwayMessage();\n\t\n\tKopete::StatusMessage customStatusMessage;\n\tcustomStatusMessage.setTitle( Kopete::BehaviorSettings::self()->autoAwayCustomTitle() );\n\tcustomStatusMessage.setMessage( Kopete::BehaviorSettings::self()->autoAwayCustomMessage() );\n\td->customStatusMessage = customStatusMessage;\n\n\tKopete::IdleTimer* idleTimer = Kopete::IdleTimer::self();\n\tidleTimer->unregisterTimeout( this );\n\t\n\tif ( Kopete::BehaviorSettings::self()->useAutoAway() )\n\t\tidleTimer->registerTimeout( d->awayTimeout, this, SLOT(setActive()), SLOT(setAutoAway()) );\n}\n\n}\n\n#include \"kopetestatusmanager.moc\"\n<|endoftext|>"} {"text":"<commit_before>\/* Gobby - GTK-based collaborative text editor\n * Copyright (C) 2008-2014 Armin Burgmeier <armin@arbur.net>\n *\n * Permission to use, copy, modify, and\/or distribute this software for any\n * purpose with or without fee is hereby granted, provided that the above\n * copyright notice and this permission notice appear in all copies.\n *\n * THE SOFTWARE IS PROVIDED \"AS IS\" AND THE AUTHOR DISCLAIMS ALL WARRANTIES\n * WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF\n * MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR\n * ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES\n * WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN\n * ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF\n * OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE.\n *\/\n\n#include \"commands\/auth-commands.hpp\"\n#include \"util\/i18n.hpp\"\n\n#include <libinfinity\/common\/inf-xmpp-connection.h>\n#include <libinfinity\/common\/inf-error.h>\n\nnamespace\n{\n\tvoid show_error(const GError* error,\n\t Gobby::StatusBar& statusbar,\n\t InfXmlConnection* connection)\n\t{\n\t\tgchar* remote;\n\t\tg_object_get(connection,\n\t\t\t\"remote-hostname\", &remote,\n\t\t\tNULL);\n\t\tGlib::ustring short_message(Glib::ustring::compose(\n\t\t\t\"Authentication failed for \\\"%1\\\"\", remote));\n\t\tg_free(remote);\n\n\t\tif(error->domain ==\n\t\t inf_authentication_detail_error_quark())\n\t\t{\n\t\t\tstatusbar.add_error_message(\n\t\t\t\tshort_message,\n\t\t\t\tinf_authentication_detail_strerror(\n\t\t\t\t\tInfAuthenticationDetailError(\n\t\t\t\t\t\terror->code)));\n\t\t}\n\t\telse\n\t\t{\n\t\t\tstatusbar.add_error_message(\n\t\t\t\tshort_message,\n\t\t\t\terror->message);\n\t\t}\n\t}\n}\n\nGobby::AuthCommands::AuthCommands(Gtk::Window& parent,\n Browser& browser,\n StatusBar& statusbar,\n ConnectionManager& connection_manager,\n const Preferences& preferences):\n\tm_parent(parent),\n\tm_browser(browser),\n\tm_connection_manager(connection_manager),\n\tm_statusbar(statusbar),\n\tm_preferences(preferences)\n{\n\tGError* error = NULL;\n\tm_sasl_context = inf_sasl_context_new(&error);\n\n\tif(!m_sasl_context)\n\t{\n\t\tstd::string error_message =\n\t\t\tstd::string(\"SASL initialization error: \") +\n\t\t\terror->message;\n\t\tg_error_free(error);\n\t\tthrow std::runtime_error(error_message);\n\t}\n\n\tinf_sasl_context_set_callback(\n\t\tm_sasl_context, &AuthCommands::sasl_callback_static,\n\t\tthis, NULL);\n\n\t\/\/ Set SASL context for new connections:\n\tm_connection_manager.set_sasl_context(m_sasl_context,\n\t \"ANONYMOUS PLAIN\");\n\n\tg_signal_connect(\n\t\tG_OBJECT(m_browser.get_store()),\n\t\t\"set-browser\",\n\t\tG_CALLBACK(&AuthCommands::set_browser_callback_static),\n\t\tthis);\n}\n\nGobby::AuthCommands::~AuthCommands()\n{\n\tm_connection_manager.set_sasl_context(NULL, NULL);\n\tinf_sasl_context_unref(m_sasl_context);\n\n\tfor(RetryMap::iterator iter = m_retries.begin();\n\t iter != m_retries.end(); ++iter)\n\t{\n\t\tg_signal_handler_disconnect(iter->first, iter->second.handle);\n\t}\n}\n\nvoid Gobby::AuthCommands::set_sasl_error(InfXmppConnection* connection,\n const gchar* message)\n{\n\tGError* error = g_error_new_literal(\n\t\tinf_authentication_detail_error_quark(),\n\t\tINF_AUTHENTICATION_DETAIL_ERROR_AUTHENTICATION_FAILED,\n\t\tmessage\n\t);\n\n\tinf_xmpp_connection_set_sasl_error(connection, error);\n\tg_error_free(error);\n}\n\nvoid Gobby::AuthCommands::sasl_callback(InfSaslContextSession* session,\n InfXmppConnection* xmpp,\n Gsasl_property prop)\n{\n\tconst Glib::ustring username = m_preferences.user.name;\n\tconst std::string correct_password = m_preferences.user.password;\n\tconst char* password;\n\n\tswitch(prop)\n\t{\n\tcase GSASL_ANONYMOUS_TOKEN:\n\t\tinf_sasl_context_session_set_property(\n\t\t\tsession, GSASL_ANONYMOUS_TOKEN, username.c_str());\n\t\tinf_sasl_context_session_continue(session, GSASL_OK);\n\t\tbreak;\n\tcase GSASL_AUTHID:\n\t\tinf_sasl_context_session_set_property(\n\t\t\tsession, GSASL_AUTHID, username.c_str());\n\t\tinf_sasl_context_session_continue(session, GSASL_OK);\n\t\tbreak;\n\tcase GSASL_PASSWORD:\n\t\t{\n\t\t\tRetryMap::iterator i = m_retries.find(xmpp);\n\t\t\tif(i == m_retries.end())\n\t\t\t\ti = insert_retry_info(xmpp);\n\t\t\tRetryInfo& info(i->second);\n\n\t\t\tif(!info.last_password.empty())\n\t\t\t{\n\t\t\t\tinf_sasl_context_session_set_property(\n\t\t\t\t\tsession, GSASL_PASSWORD,\n\t\t\t\t\tinfo.last_password.c_str());\n\n\t\t\t\tinf_sasl_context_session_continue(session,\n\t\t\t\t GSASL_OK);\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\t\/\/ Query user for password\n\t\t\t\tg_assert(info.password_dialog == NULL);\n\n\t\t\t\tgchar* remote_id;\n\t\t\t\tg_object_get(G_OBJECT(xmpp),\n\t\t\t\t \"remote-hostname\", &remote_id,\n\t\t\t\t\t NULL);\n\t\t\t\tGlib::ustring remote_id_(remote_id);\n\t\t\t\tg_free(remote_id);\n\n\t\t\t\tinfo.password_dialog = new PasswordDialog(\n\t\t\t\t\tm_parent, remote_id_, info.retries);\n\t\t\t\tinfo.password_dialog->add_button(\n\t\t\t\t\t_(\"_Cancel\"), Gtk::RESPONSE_CANCEL);\n\t\t\t\tinfo.password_dialog->add_button(\n\t\t\t\t\t_(\"_Ok\"), Gtk::RESPONSE_ACCEPT);\n\n\t\t\t\tGtk::Dialog& dialog = *info.password_dialog;\n\t\t\t\tdialog.signal_response().connect(sigc::bind(\n\t\t\t\t\tsigc::mem_fun(\n\t\t\t\t\t\t*this,\n\t\t\t\t\t\t&AuthCommands::on_response),\n\t\t\t\t\tsession, xmpp));\n\n\t\t\t\tinfo.password_dialog->present();\n\t\t\t}\n\t\t}\n\n\t\tbreak;\n\tcase GSASL_VALIDATE_ANONYMOUS:\n\t\tif(m_preferences.user.require_password)\n\t\t{\n\t\t\tinf_sasl_context_session_continue(\n\t\t\t\tsession,\n\t\t\t\tGSASL_AUTHENTICATION_ERROR\n\t\t\t);\n\n\t\t\tset_sasl_error(xmpp, _(\"Password required\"));\n\t\t}\n\t\telse\n\t\t{\n\t\t\tinf_sasl_context_session_continue(session, GSASL_OK);\n\t\t}\n\n\t\tbreak;\n\tcase GSASL_VALIDATE_SIMPLE:\n\t\tpassword = inf_sasl_context_session_get_property(\n\t\t\tsession, GSASL_PASSWORD);\n\t\tif(strcmp(password, correct_password.c_str()) != 0)\n\t\t{\n\t\t\tinf_sasl_context_session_continue(\n\t\t\t\tsession,\n\t\t\t\tGSASL_AUTHENTICATION_ERROR\n\t\t\t);\n\n\t\t\tset_sasl_error(xmpp, _(\"Incorrect password\"));\n\t\t}\n\t\telse\n\t\t{\n\t\t\tinf_sasl_context_session_continue(session, GSASL_OK);\n\t\t}\n\n\t\tbreak;\n\tdefault:\n\t\tinf_sasl_context_session_continue(session, GSASL_NO_CALLBACK);\n\t\tbreak;\n\t}\n}\n\nvoid Gobby::AuthCommands::on_response(int response_id,\n InfSaslContextSession* session,\n InfXmppConnection* xmpp)\n{\n\tRetryMap::iterator i = m_retries.find(xmpp);\n\tg_assert(i != m_retries.end());\n\tRetryInfo& info(i->second);\n\n\tif(response_id == Gtk::RESPONSE_ACCEPT)\n\t\tinfo.last_password = info.password_dialog->get_password();\n\telse\n\t\tinfo.last_password = \"\";\n\n\tdelete info.password_dialog;\n\tinfo.password_dialog = NULL;\n\n\t++info.retries;\n\n\tif(info.last_password.empty())\n\t{\n\t\tinf_sasl_context_session_continue(session, GSASL_NO_PASSWORD);\n\t}\n\telse\n\t{\n\t\tinf_sasl_context_session_set_property(\n\t\t\tsession, GSASL_PASSWORD, info.last_password.c_str());\n\t\tinf_sasl_context_session_continue(session, GSASL_OK);\n\t}\n}\n\nvoid Gobby::AuthCommands::set_browser_callback(InfBrowser* old_browser,\n InfBrowser* new_browser)\n{\n\t\/\/ TODO: Disconnect from the signal on destruction?\n\tif(new_browser != NULL && INFC_IS_BROWSER(new_browser))\n\t{\n\t\tg_signal_connect(\n\t\t\tG_OBJECT(new_browser),\n\t\t\t\"error\",\n\t\t\tG_CALLBACK(browser_error_callback_static),\n\t\t\tthis);\n\t}\n}\n\nvoid Gobby::AuthCommands::browser_error_callback(InfcBrowser* browser,\n GError* error)\n{\n\t\/\/ The Browser already displays errors inline, but we want\n\t\/\/ auth-related error messages to show up in the status bar.\n\n\tInfXmlConnection* connection = infc_browser_get_connection(browser);\n\tg_assert(INF_IS_XMPP_CONNECTION(connection));\n\n\tInfXmppConnection* xmpp = INF_XMPP_CONNECTION(connection);\n\tRetryMap::iterator iter = m_retries.find(xmpp);\n\tif(iter == m_retries.end())\n\t\titer = insert_retry_info(xmpp);\n\tGlib::ustring& last_password(iter->second.last_password);\n\tGlib::ustring old_password;\n\n\told_password.swap(last_password);\n\n\tif(error->domain ==\n\t g_quark_from_static_string(\"INF_XMPP_CONNECTION_AUTH_ERROR\"))\n\t{\n\t\t\/\/ Authentication failed for some reason, maybe because the\n\t\t\/\/ server aborted authentication. If we were querying a\n\t\t\/\/ password then close the dialog now.\n\t\tdelete iter->second.password_dialog;\n\t\titer->second.password_dialog = NULL;\n\n\t\tconst GError* sasl_error =\n\t\t\tinf_xmpp_connection_get_sasl_error(xmpp);\n\t\tif(sasl_error != NULL &&\n\t\t sasl_error->domain ==\n\t\t inf_authentication_detail_error_quark())\n\t\t{\n\t\t\thandle_error_detail(xmpp, sasl_error,\n\t\t\t old_password,\n\t\t\t last_password);\n\t\t}\n\t\telse if(sasl_error != NULL)\n\t\t{\n\t\t\tshow_error(sasl_error, m_statusbar, connection);\n\t\t}\n\t\telse\n\t\t{\n\t\t\tshow_error(error, m_statusbar, connection);\n\t\t}\n\t}\n\telse if(error->domain == inf_gsasl_error_quark())\n\t{\n\t\tshow_error(error, m_statusbar, connection);\n\t}\n}\n\nvoid Gobby::AuthCommands::handle_error_detail(InfXmppConnection* xmpp,\n const GError* detail_error,\n Glib::ustring& old_password,\n Glib::ustring& last_password)\n{\n\tGError* error = NULL;\n\tswitch(detail_error->code)\n\t{\n\tcase INF_AUTHENTICATION_DETAIL_ERROR_AUTHENTICATION_FAILED:\n\t\tinf_xmpp_connection_retry_sasl_authentication(xmpp, &error);\n\t\tbreak;\n\tcase INF_AUTHENTICATION_DETAIL_ERROR_TRY_AGAIN:\n\t\told_password.swap(last_password);\n\t\tinf_xmpp_connection_retry_sasl_authentication(xmpp, &error);\n\n\t\tbreak;\n\tdefault:\n\t\tshow_error(detail_error, m_statusbar,\n\t\t INF_XML_CONNECTION(xmpp));\n\t\tbreak;\n\t}\n\n\tif(error)\n\t{\n\t\tshow_error(error, m_statusbar,\n\t\t INF_XML_CONNECTION(xmpp));\n\t\tg_error_free(error);\n\t}\n}\n\nGobby::AuthCommands::RetryMap::iterator\nGobby::AuthCommands::insert_retry_info(InfXmppConnection* xmpp)\n{\n\tRetryMap::iterator iter = m_retries.insert(\n\t\tstd::make_pair(xmpp,\n\t\t RetryInfo())).first;\n\titer->second.retries = 0;\n\titer->second.handle = g_signal_connect(\n\t\tG_OBJECT(xmpp),\n\t\t\"notify::status\",\n\t\tG_CALLBACK(on_notify_status_static),\n\t\tthis);\n\titer->second.password_dialog = NULL;\n\n\treturn iter;\n}\n\nvoid Gobby::AuthCommands::on_notify_status(InfXmppConnection* connection)\n{\n\tInfXmlConnectionStatus status;\n\tg_object_get(G_OBJECT(connection), \"status\", &status, NULL);\n\n\tif(status != INF_XML_CONNECTION_OPENING)\n\t{\n\t\tRetryMap::iterator iter = m_retries.find(connection);\n\t\tg_signal_handler_disconnect(connection, iter->second.handle);\n\t\tdelete iter->second.password_dialog;\n\t\tm_retries.erase(iter);\n\t}\n}\n<commit_msg>Use length-independent string compare for password check<commit_after>\/* Gobby - GTK-based collaborative text editor\n * Copyright (C) 2008-2014 Armin Burgmeier <armin@arbur.net>\n *\n * Permission to use, copy, modify, and\/or distribute this software for any\n * purpose with or without fee is hereby granted, provided that the above\n * copyright notice and this permission notice appear in all copies.\n *\n * THE SOFTWARE IS PROVIDED \"AS IS\" AND THE AUTHOR DISCLAIMS ALL WARRANTIES\n * WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF\n * MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR\n * ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES\n * WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN\n * ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF\n * OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE.\n *\/\n\n#include \"commands\/auth-commands.hpp\"\n#include \"util\/i18n.hpp\"\n\n#include <libinfinity\/common\/inf-xmpp-connection.h>\n#include <libinfinity\/common\/inf-error.h>\n\nnamespace\n{\n\tvoid show_error(const GError* error,\n\t Gobby::StatusBar& statusbar,\n\t InfXmlConnection* connection)\n\t{\n\t\tgchar* remote;\n\t\tg_object_get(connection,\n\t\t\t\"remote-hostname\", &remote,\n\t\t\tNULL);\n\t\tGlib::ustring short_message(Glib::ustring::compose(\n\t\t\t\"Authentication failed for \\\"%1\\\"\", remote));\n\t\tg_free(remote);\n\n\t\tif(error->domain ==\n\t\t inf_authentication_detail_error_quark())\n\t\t{\n\t\t\tstatusbar.add_error_message(\n\t\t\t\tshort_message,\n\t\t\t\tinf_authentication_detail_strerror(\n\t\t\t\t\tInfAuthenticationDetailError(\n\t\t\t\t\t\terror->code)));\n\t\t}\n\t\telse\n\t\t{\n\t\t\tstatusbar.add_error_message(\n\t\t\t\tshort_message,\n\t\t\t\terror->message);\n\t\t}\n\t}\n}\n\nGobby::AuthCommands::AuthCommands(Gtk::Window& parent,\n Browser& browser,\n StatusBar& statusbar,\n ConnectionManager& connection_manager,\n const Preferences& preferences):\n\tm_parent(parent),\n\tm_browser(browser),\n\tm_connection_manager(connection_manager),\n\tm_statusbar(statusbar),\n\tm_preferences(preferences)\n{\n\tGError* error = NULL;\n\tm_sasl_context = inf_sasl_context_new(&error);\n\n\tif(!m_sasl_context)\n\t{\n\t\tstd::string error_message =\n\t\t\tstd::string(\"SASL initialization error: \") +\n\t\t\terror->message;\n\t\tg_error_free(error);\n\t\tthrow std::runtime_error(error_message);\n\t}\n\n\tinf_sasl_context_set_callback(\n\t\tm_sasl_context, &AuthCommands::sasl_callback_static,\n\t\tthis, NULL);\n\n\t\/\/ Set SASL context for new connections:\n\tm_connection_manager.set_sasl_context(m_sasl_context,\n\t \"ANONYMOUS PLAIN\");\n\n\tg_signal_connect(\n\t\tG_OBJECT(m_browser.get_store()),\n\t\t\"set-browser\",\n\t\tG_CALLBACK(&AuthCommands::set_browser_callback_static),\n\t\tthis);\n}\n\nGobby::AuthCommands::~AuthCommands()\n{\n\tm_connection_manager.set_sasl_context(NULL, NULL);\n\tinf_sasl_context_unref(m_sasl_context);\n\n\tfor(RetryMap::iterator iter = m_retries.begin();\n\t iter != m_retries.end(); ++iter)\n\t{\n\t\tg_signal_handler_disconnect(iter->first, iter->second.handle);\n\t}\n}\n\nvoid Gobby::AuthCommands::set_sasl_error(InfXmppConnection* connection,\n const gchar* message)\n{\n\tGError* error = g_error_new_literal(\n\t\tinf_authentication_detail_error_quark(),\n\t\tINF_AUTHENTICATION_DETAIL_ERROR_AUTHENTICATION_FAILED,\n\t\tmessage\n\t);\n\n\tinf_xmpp_connection_set_sasl_error(connection, error);\n\tg_error_free(error);\n}\n\nvoid Gobby::AuthCommands::sasl_callback(InfSaslContextSession* session,\n InfXmppConnection* xmpp,\n Gsasl_property prop)\n{\n\tconst Glib::ustring username = m_preferences.user.name;\n\tconst std::string correct_password = m_preferences.user.password;\n\tconst char* password;\n\tgsize password_len;\n\tgchar cmp;\n\n\tswitch(prop)\n\t{\n\tcase GSASL_ANONYMOUS_TOKEN:\n\t\tinf_sasl_context_session_set_property(\n\t\t\tsession, GSASL_ANONYMOUS_TOKEN, username.c_str());\n\t\tinf_sasl_context_session_continue(session, GSASL_OK);\n\t\tbreak;\n\tcase GSASL_AUTHID:\n\t\tinf_sasl_context_session_set_property(\n\t\t\tsession, GSASL_AUTHID, username.c_str());\n\t\tinf_sasl_context_session_continue(session, GSASL_OK);\n\t\tbreak;\n\tcase GSASL_PASSWORD:\n\t\t{\n\t\t\tRetryMap::iterator i = m_retries.find(xmpp);\n\t\t\tif(i == m_retries.end())\n\t\t\t\ti = insert_retry_info(xmpp);\n\t\t\tRetryInfo& info(i->second);\n\n\t\t\tif(!info.last_password.empty())\n\t\t\t{\n\t\t\t\tinf_sasl_context_session_set_property(\n\t\t\t\t\tsession, GSASL_PASSWORD,\n\t\t\t\t\tinfo.last_password.c_str());\n\n\t\t\t\tinf_sasl_context_session_continue(session,\n\t\t\t\t GSASL_OK);\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\t\/\/ Query user for password\n\t\t\t\tg_assert(info.password_dialog == NULL);\n\n\t\t\t\tgchar* remote_id;\n\t\t\t\tg_object_get(G_OBJECT(xmpp),\n\t\t\t\t \"remote-hostname\", &remote_id,\n\t\t\t\t\t NULL);\n\t\t\t\tGlib::ustring remote_id_(remote_id);\n\t\t\t\tg_free(remote_id);\n\n\t\t\t\tinfo.password_dialog = new PasswordDialog(\n\t\t\t\t\tm_parent, remote_id_, info.retries);\n\t\t\t\tinfo.password_dialog->add_button(\n\t\t\t\t\t_(\"_Cancel\"), Gtk::RESPONSE_CANCEL);\n\t\t\t\tinfo.password_dialog->add_button(\n\t\t\t\t\t_(\"_Ok\"), Gtk::RESPONSE_ACCEPT);\n\n\t\t\t\tGtk::Dialog& dialog = *info.password_dialog;\n\t\t\t\tdialog.signal_response().connect(sigc::bind(\n\t\t\t\t\tsigc::mem_fun(\n\t\t\t\t\t\t*this,\n\t\t\t\t\t\t&AuthCommands::on_response),\n\t\t\t\t\tsession, xmpp));\n\n\t\t\t\tinfo.password_dialog->present();\n\t\t\t}\n\t\t}\n\n\t\tbreak;\n\tcase GSASL_VALIDATE_ANONYMOUS:\n\t\tif(m_preferences.user.require_password)\n\t\t{\n\t\t\tinf_sasl_context_session_continue(\n\t\t\t\tsession,\n\t\t\t\tGSASL_AUTHENTICATION_ERROR\n\t\t\t);\n\n\t\t\tset_sasl_error(xmpp, _(\"Password required\"));\n\t\t}\n\t\telse\n\t\t{\n\t\t\tinf_sasl_context_session_continue(session, GSASL_OK);\n\t\t}\n\n\t\tbreak;\n\tcase GSASL_VALIDATE_SIMPLE:\n\t\tpassword = inf_sasl_context_session_get_property(\n\t\t\tsession, GSASL_PASSWORD);\n\n\t\t\/* length-independent string compare *\/\n\t\tcmp = 0;\n\t\tpassword_len = strlen(password);\n\t\tfor(unsigned i = 0; i < correct_password.size(); ++i)\n\t\t{\n\t\t\tif(i < password_len)\n\t\t\t\tcmp |= (password[i] ^ correct_password[i]);\n\t\t\telse\n\t\t\t\tcmp |= (0x00 ^ correct_password[i]);\n\t\t}\n\n\t\tif(password_len != correct_password.size())\n\t\t\tcmp = 0xFF;\n\n\t\tif(cmp != 0)\n\t\t{\n\t\t\tinf_sasl_context_session_continue(\n\t\t\t\tsession,\n\t\t\t\tGSASL_AUTHENTICATION_ERROR\n\t\t\t);\n\n\t\t\tset_sasl_error(xmpp, _(\"Incorrect password\"));\n\t\t}\n\t\telse\n\t\t{\n\t\t\tinf_sasl_context_session_continue(session, GSASL_OK);\n\t\t}\n\n\t\tbreak;\n\tdefault:\n\t\tinf_sasl_context_session_continue(session, GSASL_NO_CALLBACK);\n\t\tbreak;\n\t}\n}\n\nvoid Gobby::AuthCommands::on_response(int response_id,\n InfSaslContextSession* session,\n InfXmppConnection* xmpp)\n{\n\tRetryMap::iterator i = m_retries.find(xmpp);\n\tg_assert(i != m_retries.end());\n\tRetryInfo& info(i->second);\n\n\tif(response_id == Gtk::RESPONSE_ACCEPT)\n\t\tinfo.last_password = info.password_dialog->get_password();\n\telse\n\t\tinfo.last_password = \"\";\n\n\tdelete info.password_dialog;\n\tinfo.password_dialog = NULL;\n\n\t++info.retries;\n\n\tif(info.last_password.empty())\n\t{\n\t\tinf_sasl_context_session_continue(session, GSASL_NO_PASSWORD);\n\t}\n\telse\n\t{\n\t\tinf_sasl_context_session_set_property(\n\t\t\tsession, GSASL_PASSWORD, info.last_password.c_str());\n\t\tinf_sasl_context_session_continue(session, GSASL_OK);\n\t}\n}\n\nvoid Gobby::AuthCommands::set_browser_callback(InfBrowser* old_browser,\n InfBrowser* new_browser)\n{\n\t\/\/ TODO: Disconnect from the signal on destruction?\n\tif(new_browser != NULL && INFC_IS_BROWSER(new_browser))\n\t{\n\t\tg_signal_connect(\n\t\t\tG_OBJECT(new_browser),\n\t\t\t\"error\",\n\t\t\tG_CALLBACK(browser_error_callback_static),\n\t\t\tthis);\n\t}\n}\n\nvoid Gobby::AuthCommands::browser_error_callback(InfcBrowser* browser,\n GError* error)\n{\n\t\/\/ The Browser already displays errors inline, but we want\n\t\/\/ auth-related error messages to show up in the status bar.\n\n\tInfXmlConnection* connection = infc_browser_get_connection(browser);\n\tg_assert(INF_IS_XMPP_CONNECTION(connection));\n\n\tInfXmppConnection* xmpp = INF_XMPP_CONNECTION(connection);\n\tRetryMap::iterator iter = m_retries.find(xmpp);\n\tif(iter == m_retries.end())\n\t\titer = insert_retry_info(xmpp);\n\tGlib::ustring& last_password(iter->second.last_password);\n\tGlib::ustring old_password;\n\n\told_password.swap(last_password);\n\n\tif(error->domain ==\n\t g_quark_from_static_string(\"INF_XMPP_CONNECTION_AUTH_ERROR\"))\n\t{\n\t\t\/\/ Authentication failed for some reason, maybe because the\n\t\t\/\/ server aborted authentication. If we were querying a\n\t\t\/\/ password then close the dialog now.\n\t\tdelete iter->second.password_dialog;\n\t\titer->second.password_dialog = NULL;\n\n\t\tconst GError* sasl_error =\n\t\t\tinf_xmpp_connection_get_sasl_error(xmpp);\n\t\tif(sasl_error != NULL &&\n\t\t sasl_error->domain ==\n\t\t inf_authentication_detail_error_quark())\n\t\t{\n\t\t\thandle_error_detail(xmpp, sasl_error,\n\t\t\t old_password,\n\t\t\t last_password);\n\t\t}\n\t\telse if(sasl_error != NULL)\n\t\t{\n\t\t\tshow_error(sasl_error, m_statusbar, connection);\n\t\t}\n\t\telse\n\t\t{\n\t\t\tshow_error(error, m_statusbar, connection);\n\t\t}\n\t}\n\telse if(error->domain == inf_gsasl_error_quark())\n\t{\n\t\tshow_error(error, m_statusbar, connection);\n\t}\n}\n\nvoid Gobby::AuthCommands::handle_error_detail(InfXmppConnection* xmpp,\n const GError* detail_error,\n Glib::ustring& old_password,\n Glib::ustring& last_password)\n{\n\tGError* error = NULL;\n\tswitch(detail_error->code)\n\t{\n\tcase INF_AUTHENTICATION_DETAIL_ERROR_AUTHENTICATION_FAILED:\n\t\tinf_xmpp_connection_retry_sasl_authentication(xmpp, &error);\n\t\tbreak;\n\tcase INF_AUTHENTICATION_DETAIL_ERROR_TRY_AGAIN:\n\t\told_password.swap(last_password);\n\t\tinf_xmpp_connection_retry_sasl_authentication(xmpp, &error);\n\n\t\tbreak;\n\tdefault:\n\t\tshow_error(detail_error, m_statusbar,\n\t\t INF_XML_CONNECTION(xmpp));\n\t\tbreak;\n\t}\n\n\tif(error)\n\t{\n\t\tshow_error(error, m_statusbar,\n\t\t INF_XML_CONNECTION(xmpp));\n\t\tg_error_free(error);\n\t}\n}\n\nGobby::AuthCommands::RetryMap::iterator\nGobby::AuthCommands::insert_retry_info(InfXmppConnection* xmpp)\n{\n\tRetryMap::iterator iter = m_retries.insert(\n\t\tstd::make_pair(xmpp,\n\t\t RetryInfo())).first;\n\titer->second.retries = 0;\n\titer->second.handle = g_signal_connect(\n\t\tG_OBJECT(xmpp),\n\t\t\"notify::status\",\n\t\tG_CALLBACK(on_notify_status_static),\n\t\tthis);\n\titer->second.password_dialog = NULL;\n\n\treturn iter;\n}\n\nvoid Gobby::AuthCommands::on_notify_status(InfXmppConnection* connection)\n{\n\tInfXmlConnectionStatus status;\n\tg_object_get(G_OBJECT(connection), \"status\", &status, NULL);\n\n\tif(status != INF_XML_CONNECTION_OPENING)\n\t{\n\t\tRetryMap::iterator iter = m_retries.find(connection);\n\t\tg_signal_handler_disconnect(connection, iter->second.handle);\n\t\tdelete iter->second.password_dialog;\n\t\tm_retries.erase(iter);\n\t}\n}\n<|endoftext|>"} {"text":"<commit_before>#ifdef FROGBOY_SDL\n#include <stdlib.h>\n#include <string.h>\n#include <time.h>\n#include <SDL.h>\n\n#include \"frogboy.h\"\n\nnamespace {\n bool open = false;\n SDL_Window* window = nullptr;\n SDL_Surface* windowSurface = nullptr;\n SDL_Surface* backSurface = nullptr;\n uint8_t screenBuffer[frogboy::SCREEN_WIDTH * (frogboy::SCREEN_HEIGHT \/ 8)];\n uint32_t lastFrame = 0;\n\n const uint8_t SCREEN_SCALE = 8;\n\n bool pressed[static_cast<size_t>(frogboy::BUTTON_COUNT)];\n\n const SDL_Keycode keycodes[static_cast<size_t>(frogboy::BUTTON_COUNT)] = {\n SDLK_LEFT,\n SDLK_RIGHT,\n SDLK_UP,\n SDLK_DOWN, \n SDLK_z,\n SDLK_x,\n };\n}\n\nnamespace frogboy {\n void init() {\n srand(static_cast<unsigned int>(time(nullptr)));\n\n SDL_Init(SDL_INIT_VIDEO | SDL_INIT_TIMER);\n window = SDL_CreateWindow(FROGBOY_APPNAME, SDL_WINDOWPOS_CENTERED, SDL_WINDOWPOS_CENTERED, SCREEN_WIDTH * SCREEN_SCALE, SCREEN_HEIGHT * SCREEN_SCALE, 0);\n windowSurface = SDL_GetWindowSurface(window);\n backSurface = SDL_CreateRGBSurface(0, SCREEN_WIDTH, SCREEN_HEIGHT, 32, 0, 0, 0, 0);\n clearScreen();\n lastFrame = SDL_GetTicks();\n\n memset(pressed, 0, sizeof(pressed));\n\n open = true;\n }\n\n void destroy() {\n SDL_FreeSurface(backSurface);\n SDL_DestroyWindow(window);\n SDL_Quit();\n }\n\n void clearScreen() {\n memset(screenBuffer, 0, sizeof(screenBuffer));\n }\n\n void refreshScreen() {\n SDL_LockSurface(backSurface);\n uint32_t black = SDL_MapRGBA(backSurface->format, 0, 0, 0, 0);\n uint32_t white = SDL_MapRGBA(backSurface->format, 255, 255, 255, 0);\n uint32_t* surfaceRowPtr = static_cast<uint32_t*>(backSurface->pixels);\n for(size_t y = 0; y != SCREEN_HEIGHT; ++y) {\n uint32_t* ptr = surfaceRowPtr;\n for(size_t x = 0; x != SCREEN_WIDTH; ++x) {\n size_t shift = y % 8;\n size_t bufferRow = y \/ 8;\n *ptr = ((screenBuffer[bufferRow * SCREEN_WIDTH + x] >> shift) & 1) == 0 ? black : white;\n ptr++;\n }\n surfaceRowPtr = static_cast<uint32_t*>(static_cast<void*>(\n static_cast<uint8_t*>(static_cast<void*>(surfaceRowPtr)) + backSurface->pitch));\n }\n SDL_UnlockSurface(backSurface);\n\n SDL_FillRect(windowSurface, NULL, black);\n\n SDL_Rect destRect;\n destRect.x = 0;\n destRect.y = 0;\n destRect.w = SCREEN_WIDTH * SCREEN_SCALE;\n destRect.h = SCREEN_HEIGHT * SCREEN_SCALE; \n SDL_BlitScaled(backSurface, nullptr, windowSurface, &destRect);\n\n SDL_UpdateWindowSurface(window);\n }\n\n bool waitForFrame() {\n if(!open) {\n return false;\n }\n\n SDL_Event e;\n while(SDL_PollEvent(&e) != 0) {\n switch(e.type) {\n case SDL_QUIT:\n open = false;\n break;\n case SDL_KEYDOWN:\n for(size_t i = 0; i != BUTTON_COUNT; ++i) {\n if(e.key.keysym.sym == keycodes[i]) {\n pressed[i] = true;\n break;\n }\n }\n break;\n case SDL_KEYUP:\n for(size_t i = 0; i != BUTTON_COUNT; ++i) {\n if(e.key.keysym.sym == keycodes[i]) {\n pressed[i] = false;\n break;\n }\n }\n break;\n }\n }\n\n if(open) {\n uint32_t timer = SDL_GetTicks();\n if(timer - lastFrame > 16) {\n lastFrame = timer;\n return true;\n }\n }\n\n return false;\n }\n\n bool isActive() {\n return open;\n } \n\n uint8_t reverseBits(uint8_t value) {\n value = (value & 0xF0) >> 4 | (value & 0x0F) << 4;\n value = (value & 0xCC) >> 2 | (value & 0x33) << 2;\n value = (value & 0xAA) >> 1 | (value & 0x55) << 1;\n return value;\n }\n\n uint8_t* getScreenBuffer() {\n return screenBuffer;\n }\n\n bool isPressed(Button button) {\n return pressed[static_cast<size_t>(button)];\n }\n\n int getRandom(int min, int max) {\n return rand() % (max - min + 1) + min;\n }\n}\n#endif<commit_msg>For SDL target, use their renderer instead of accessing the window surface directly. Add ability to resize the window. Snap the window to the nearest integer ratio to pretty ugly jagged resizes. This takes care of most of the work to scale the screen to arbitrary sizes. Next up will probably be figuring out some way to lower CPU usage without sacrificing too much framerate.<commit_after>#ifdef FROGBOY_SDL\n#include <stdlib.h>\n#include <string.h>\n#include <time.h>\n#include <SDL.h>\n\n#include \"frogboy.h\"\n\nnamespace {\n bool open = false;\n SDL_Window* window = nullptr;\n SDL_Renderer* renderer = nullptr;\n SDL_Texture* screenTexture = nullptr;\n SDL_Surface* screenSurface = nullptr;\n uint8_t screenBuffer[frogboy::SCREEN_WIDTH * (frogboy::SCREEN_HEIGHT \/ 8)];\n uint32_t lastFrame = 0;\n\n const uint8_t SCREEN_SCALE = 8;\n\n bool windowMaximized = false;\n\n bool pressed[static_cast<size_t>(frogboy::BUTTON_COUNT)];\n\n const SDL_Keycode keycodes[static_cast<size_t>(frogboy::BUTTON_COUNT)] = {\n SDLK_LEFT,\n SDLK_RIGHT,\n SDLK_UP,\n SDLK_DOWN, \n SDLK_z,\n SDLK_x,\n };\n}\n\nnamespace frogboy {\n void init() {\n srand(static_cast<unsigned int>(time(nullptr)));\n\n SDL_Init(SDL_INIT_VIDEO | SDL_INIT_TIMER);\n window = SDL_CreateWindow(FROGBOY_APPNAME, SDL_WINDOWPOS_CENTERED, SDL_WINDOWPOS_CENTERED, SCREEN_WIDTH * SCREEN_SCALE, SCREEN_HEIGHT * SCREEN_SCALE, SDL_WINDOW_RESIZABLE);\n renderer = SDL_CreateRenderer(window, -1, SDL_RENDERER_PRESENTVSYNC | SDL_RENDERER_ACCELERATED);\n\n SDL_SetHint(SDL_HINT_RENDER_SCALE_QUALITY, \"nearest\");\n SDL_RenderSetLogicalSize(renderer, SCREEN_WIDTH, SCREEN_HEIGHT);\n screenTexture = SDL_CreateTexture(renderer, SDL_PIXELFORMAT_ARGB8888, SDL_TEXTUREACCESS_STREAMING, SCREEN_WIDTH, SCREEN_HEIGHT);\n screenSurface = SDL_CreateRGBSurface(0, SCREEN_WIDTH, SCREEN_HEIGHT, 32, 0, 0, 0, 0);\n clearScreen();\n lastFrame = SDL_GetTicks();\n\n memset(pressed, 0, sizeof(pressed));\n\n windowMaximized = false;\n open = true;\n }\n\n void destroy() {\n SDL_FreeSurface(screenSurface);\n SDL_DestroyRenderer(renderer);\n SDL_DestroyWindow(window);\n SDL_Quit();\n }\n\n void clearScreen() {\n memset(screenBuffer, 0, sizeof(screenBuffer));\n }\n\n void refreshScreen() {\n SDL_LockSurface(screenSurface);\n uint32_t black = SDL_MapRGBA(screenSurface->format, 0, 0, 0, 0);\n uint32_t white = SDL_MapRGBA(screenSurface->format, 255, 255, 255, 0);\n uint32_t* surfaceRowPtr = static_cast<uint32_t*>(screenSurface->pixels);\n for(size_t y = 0; y != SCREEN_HEIGHT; ++y) {\n uint32_t* ptr = surfaceRowPtr;\n for(size_t x = 0; x != SCREEN_WIDTH; ++x) {\n size_t shift = y % 8;\n size_t bufferRow = y \/ 8;\n *ptr = ((screenBuffer[bufferRow * SCREEN_WIDTH + x] >> shift) & 1) == 0 ? black : white;\n ptr++;\n }\n surfaceRowPtr = static_cast<uint32_t*>(static_cast<void*>(\n static_cast<uint8_t*>(static_cast<void*>(surfaceRowPtr)) + screenSurface->pitch));\n }\n SDL_UnlockSurface(screenSurface);\n\n SDL_UpdateTexture(screenTexture, NULL, screenSurface->pixels, screenSurface->pitch);\n SDL_SetRenderDrawColor(renderer, 0, 0, 0, 255);\n SDL_RenderClear(renderer);\n SDL_RenderCopy(renderer, screenTexture, NULL, NULL);\n SDL_RenderPresent(renderer);\n }\n\n bool waitForFrame() {\n if(!open) {\n return false;\n }\n\n bool resized = false;\n\n {\n SDL_Event e;\n while(SDL_PollEvent(&e) != 0) {\n switch(e.type) {\n case SDL_QUIT:\n open = false;\n break;\n case SDL_KEYDOWN:\n for(size_t i = 0; i != BUTTON_COUNT; ++i) {\n if(e.key.keysym.sym == keycodes[i]) {\n pressed[i] = true;\n break;\n }\n }\n break;\n case SDL_KEYUP:\n for(size_t i = 0; i != BUTTON_COUNT; ++i) {\n if(e.key.keysym.sym == keycodes[i]) {\n pressed[i] = false;\n break;\n }\n }\n break;\n case SDL_WINDOWEVENT:\n switch(e.window.event) {\r\n case SDL_WINDOWEVENT_RESIZED: {\r\n resized = true;\r\n break;\r\n }\r\n case SDL_WINDOWEVENT_MAXIMIZED: {\r\n windowMaximized = true;\r\n break;\r\n }\r\n case SDL_WINDOWEVENT_RESTORED: {\r\n windowMaximized = false;\r\n break;\r\n }\r\n }\n }\n }\n }\n\n if(!windowMaximized && resized) {\r\n int width, height;\r\n SDL_GetWindowSize(window, &width, &height);\r\n int xscale = (width + SCREEN_WIDTH \/ 2) \/ SCREEN_WIDTH;\r\n int yscale = (height + SCREEN_WIDTH \/ 2) \/ SCREEN_WIDTH;\r\n\r\n if(width % SCREEN_WIDTH != 0\r\n || height % SCREEN_HEIGHT != 0\r\n || xscale != yscale) {\r\n int scale = xscale;\r\n if(scale < yscale) {\r\n scale = yscale;\r\n }\r\n if(scale < 1) {\r\n scale = 1;\r\n }\r\n SDL_SetWindowSize(window, scale * SCREEN_WIDTH, scale * SCREEN_HEIGHT);\r\n }\r\n }\n\n if(open) {\n uint32_t timer = SDL_GetTicks();\n if(timer - lastFrame > 16) {\n lastFrame = timer;\n return true;\n }\n }\n\n return false;\n }\n\n bool isActive() {\n return open;\n } \n\n uint8_t reverseBits(uint8_t value) {\n value = (value & 0xF0) >> 4 | (value & 0x0F) << 4;\n value = (value & 0xCC) >> 2 | (value & 0x33) << 2;\n value = (value & 0xAA) >> 1 | (value & 0x55) << 1;\n return value;\n }\n\n uint8_t* getScreenBuffer() {\n return screenBuffer;\n }\n\n bool isPressed(Button button) {\n return pressed[static_cast<size_t>(button)];\n }\n\n int getRandom(int min, int max) {\n return rand() % (max - min + 1) + min;\n }\n}\n#endif<|endoftext|>"} {"text":"<commit_before>\/\/ -*- C++ -*-\n\/\/\n\/\/ ----------------------------------------------------------------------\n\/\/\n\/\/ Brad T. Aagaard\n\/\/ U.S. Geological Survey\n\/\/\n\/\/ <LicenseText>\n\/\/\n\/\/ ----------------------------------------------------------------------\n\/\/\n\n#include <portinfo>\n\n#include \"SimpleIOAscii.hh\" \/\/ implementation of class methods\n\n#include \"SpatialDB.hh\" \/\/ USES SimpleDB\n#include \"SimpleDB.hh\" \/\/ USES SimpleDB\n\n#include \"SimpleDBData.hh\" \/\/ USES SimpleDBData\n#include \"spatialdata\/geocoords\/CoordSys.hh\" \/\/ USES CSCart\n#include \"spatialdata\/geocoords\/CSCart.hh\" \/\/ USES CSCart\n#include \"spatialdata\/geocoords\/CSPicklerAscii.hh\" \/\/ USES CSPicklerAscii\n\n#include \"spatialdata\/utils\/LineParser.hh\" \/\/ USES LineParser\n\n#include <fstream> \/\/ USES std::ofstream, std::ifstream\n#include <iomanip> \/\/ USES setw(), setiosflags(), resetiosflags()\n\n#include <stdexcept> \/\/ USES std::runtime_error\n#include <sstream> \/\/ USES std::ostringsgream\n#include <strings.h> \/\/ USES strcasecmp()\n#include <string.h> \/\/ USES strlen()\n#include <assert.h> \/\/ USES assert()\n\n\/\/ ----------------------------------------------------------------------\nconst char* spatialdata::spatialdb::SimpleIOAscii::HEADER =\n \"#SPATIAL.ascii\";\n\n\/\/ ----------------------------------------------------------------------\n\/\/ Read ascii database file.\nvoid\nspatialdata::spatialdb::SimpleIOAscii::read(\n\t\t\t\t SimpleDBData* pData,\n\t\t\t\t spatialdata::geocoords::CoordSys** ppCS)\n{ \/\/ read\n assert(0 != pData);\n\n try {\n std::ifstream filein(filename());\n if (!filein.is_open() || !filein.good()) {\n std::ostringstream msg;\n msg << \"Could not open spatial database file '\" << filename()\n\t << \"' for reading.\\n\";\n throw std::runtime_error(msg.str());\n } \/\/ if\n\n utils::LineParser parser(filein, \"\/\/\");\n parser.eatwhitespace(true);\n\n std::istringstream buffer;\n\n buffer.str(parser.next());\n buffer.clear();\n\n const int headerLen = strlen(HEADER);\n std::string hbuffer;\n hbuffer.resize(headerLen+1);\n buffer.read((char*) hbuffer.c_str(), sizeof(char)*headerLen);\n hbuffer[headerLen] = '\\0';\n if (0 != strcasecmp(HEADER, hbuffer.c_str())) {\n std::ostringstream msg;\n msg\n\t<< \"Magic header '\" << buffer << \"' does not match expected header '\"\n\t<< HEADER << \"' in spatial database file '\" << filename() << \"'.\\n\";\n throw std::runtime_error(msg.str());\n } \/\/ if\n int version = 0;\n buffer >> version;\n switch (version)\n { \/\/ switch\n case 1 :\n\t_readV1(pData, ppCS, filein);\n\tbreak;\n default :\n\t{ \/\/ default\n\t std::ostringstream msg;\n\t msg\n\t << \"Did not recognize format version \" << version\n\t << \" of spatial database file '\" << filename() << \"'.\\n\";\n\t throw std::runtime_error(msg.str());\n\t} \/\/ default\n } \/\/ switch\n if (!filein.good())\n throw std::runtime_error(\"Unknown error while reading.\");\n } catch (const std::exception& err) {\n std::ostringstream msg;\n msg << \"Error occurred while reading spatial database file '\"\n\t<< filename() << \"'.\\n\"\n\t<< err.what();\n throw std::runtime_error(msg.str());\n } catch (...) {\n std::ostringstream msg;\n msg << \"Unknown error occurred while reading spatial database file '\"\n\t<< filename() << \"'.\\n\";\n throw std::runtime_error(msg.str());\n } \/\/ try\/catch\n\n} \/\/ read\n\n\/\/ ----------------------------------------------------------------------\n\/\/ Read ascii database file.\nvoid\nspatialdata::spatialdb::SimpleIOAscii::_readV1(\n\t\t\t\t SimpleDBData* pData,\n\t\t\t\t spatialdata::geocoords::CoordSys** ppCS,\n\t\t\t\t std::istream& filein)\n{ \/\/ ReadV1\n assert(0 != pData);\n assert(0 != ppCS);\n\n \/\/ Clear memory and set default values\n delete *ppCS; *ppCS = new spatialdata::geocoords::CSCart();\n\n utils::LineParser parser(filein, \"\/\/\");\n parser.eatwhitespace(true);\n\n std::string token;\n std::istringstream buffer;\n const int maxIgnore = 256;\n\n buffer.str(parser.next());\n buffer.clear();\n buffer >> token;\n if (0 != strcasecmp(token.c_str(), \"SimpleDB\")) {\n std::ostringstream msg;\n msg << \"Could not parse '\" << token << \"' into 'SimpleDB'.\\n\";\n throw std::runtime_error(msg.str());\n } \/\/ else\n\n int numValues = 0;\n int numLocs = 0;\n int spaceDim = 3; \/\/ default\n int dataDim = 0;\n std::string* names = 0;\n std::string* units = 0;\n\n buffer.str(parser.next());\n buffer.clear();\n buffer >> token;\n while (buffer.good() && token != \"}\") {\n if (0 == strcasecmp(token.c_str(), \"num-values\")) {\n buffer.ignore(maxIgnore, '=');\n buffer >> numValues;\n } else if (0 == strcasecmp(token.c_str(), \"num-locs\")) {\n buffer.ignore(maxIgnore, '=');\n buffer >> numLocs;\n } else if (0 == strcasecmp(token.c_str(), \"value-names\")) {\n if (numValues > 0)\n\tnames = new std::string[numValues];\n else\n\tthrow std::runtime_error(\"Number of values must be specified BEFORE \"\n\t\t\t\t \"names of values in SimpleDB file.\");\n buffer.ignore(maxIgnore, '=');\n for (int iVal=0; iVal < numValues; ++iVal)\n\tbuffer >> names[iVal];\n } else if (0 == strcasecmp(token.c_str(), \"value-units\")) {\n if (numValues > 0)\n\tunits = new std::string[numValues];\n else\n\tthrow std::runtime_error(\"Number of values must be specified BEFORE \"\n\t\t\t\t \"units of values in SimpleDB file.\");\n buffer.ignore(maxIgnore, '=');\n for (int iVal=0; iVal < numValues; ++iVal)\n\tbuffer >> units[iVal];\n } else if (0 == strcasecmp(token.c_str(), \"data-dim\")) {\n buffer.ignore(maxIgnore, '=');\n buffer >> dataDim;\n } else if (0 == strcasecmp(token.c_str(), \"space-dim\")) {\n buffer.ignore(maxIgnore, '=');\n buffer >> spaceDim;\n } else if (0 == strcasecmp(token.c_str(), \"cs-data\")) {\n buffer.ignore(maxIgnore, '=');\n std::string rbuffer(buffer.str());\n filein.putback('\\n');\n filein.clear();\n int i = rbuffer.length()-1;\n while (i >= 0) {\n\tfilein.putback(rbuffer[i]);\n\tif ('=' == rbuffer[i--])\n\t break;\n } \/\/ while\n filein.clear();\n spatialdata::geocoords::CSPicklerAscii::unpickle(filein, ppCS);\n } else {\n std::ostringstream msg;\n msg << \"Could not parse '\" << token << \"' into a SimpleDB setting.\";\n throw std::runtime_error(msg.str());\n } \/\/ else\n\n buffer.str(parser.next());\n buffer.clear();\n buffer >> token;\n } \/\/ while\n if (token != \"}\" || !filein.good())\n throw std::runtime_error(\"I\/O error while parsing SimpleDB settings.\");\n\n bool ok = true;\n std::ostringstream msg;\n if (0 == numValues) {\n ok = false;\n msg << \"SimpleDB settings must include 'num-values'.\\n\";\n } \/\/ if\n if (0 == numLocs) {\n ok = false;\n msg << \"SimpleDB settings must include 'num-locs'.\\n\";\n } \/\/ if\n if (0 == names) {\n ok = false;\n msg << \"SimpleDB settings must include 'value-names'.\\n\";\n } \/\/ if\n if (0 == units) {\n ok = false;\n msg << \"SimpleDB settings must include 'value-units'.\\n\";\n } \/\/ if\n if (!ok)\n throw std::runtime_error(msg.str());\n \n pData->allocate(numLocs, numValues, spaceDim, dataDim);\n char** cnames = (numValues > 0) ? new char*[numValues] : 0;\n char** cunits = (numValues > 0) ? new char*[numValues] : 0;\n for (int i=0; i < numValues; ++i) {\n cnames[i] = const_cast<char*>(names[i].c_str());\n cunits[i] = const_cast<char*>(units[i].c_str());\n } \/\/ for\n pData->names(const_cast<const char**>(cnames), numValues);\n pData->units(const_cast<const char**>(cunits), numValues);\n\n for (int iLoc=0; iLoc < numLocs; ++iLoc) {\n buffer.str(parser.next());\n buffer.clear();\n double* coordinates = pData->coordinates(iLoc);\n for (int iDim=0; iDim < spaceDim; ++iDim)\n buffer >> coordinates[iDim];\n double* data = pData->data(iLoc);\n for (int iVal=0; iVal < numValues; ++iVal)\n buffer >> data[iVal];\n } \/\/ for\n if (!filein.good())\n throw std::runtime_error(\"I\/O error while reading SimpleDB data.\");\n \n \/\/ Check compatibility of dimension of data, spatial dimension and\n \/\/ number of points\n checkCompatibility(*pData, *ppCS);\n \n (*ppCS)->initialize();\n} \/\/ _readV1\n\n\/\/ ----------------------------------------------------------------------\n\/\/ Write ascii database file.\nvoid\nspatialdata::spatialdb::SimpleIOAscii::write(\n\t\t\t\tconst SimpleDBData& data,\n\t\t\t\tconst spatialdata::geocoords::CoordSys* pCS)\n{ \/\/ write\n try {\n std::ofstream fileout(filename());\n if (!fileout.is_open() || !fileout.good()) {\n std::ostringstream msg;\n msg << \"Could not open spatial database file \" << filename()\n\t << \"for writing.\\n\";\n throw std::runtime_error(msg.str());\n } \/\/ if\n \n const int version = 1;\n const int numLocs = data.numLocs();\n const int numValues = data.numValues();\n const int spaceDim = data.spaceDim();\n const int dataDim = data.dataDim();\n \n fileout\n << HEADER << \" \" << version << \"\\n\"\n << \"SimpleDB {\\n\"\n << \" num-values = \" << std::setw(6) << numValues << \"\\n\"\n << \" value-names =\";\n for (int iVal=0; iVal < numValues; ++iVal)\n fileout << \" \" << data.name(iVal);\n fileout << \"\\n\";\n fileout << \" value-units =\";\n for (int iVal=0; iVal < numValues; ++iVal)\n fileout << \" \" << data.units(iVal);\n fileout << \"\\n\";\n fileout\n << \" num-locs = \" << std::setw(6) << numLocs << \"\\n\"\n << \" data-dim = \" << std::setw(4) << dataDim << \"\\n\"\n << \" space-dim = \" << std::setw(4) << spaceDim << \"\\n\"\n << \" cs-data = \";\n spatialdata::geocoords::CSPicklerAscii::pickle(fileout, pCS);\n fileout << \"}\\n\";\n if (!fileout.good())\n throw std::runtime_error(\"I\/O error while writing SimpleDB settings.\");\n\n fileout\n << std::resetiosflags(std::ios::fixed)\n << std::setiosflags(std::ios::scientific)\n << std::setprecision(6);\n for (int iLoc=0; iLoc < numLocs; ++iLoc) {\n const double* coordinates = data.coordinates(iLoc);\n for (int iCoord=0; iCoord < spaceDim; ++iCoord)\n\tfileout << std::setw(14) << coordinates[iCoord];\n const double* values = data.data(iLoc);\n for (int iVal=0; iVal < numValues; ++iVal)\n\tfileout << std::setw(14) << values[iVal];\n fileout << \"\\n\";\n } \/\/ for\n if (!fileout.good())\n throw std::runtime_error(\"I\/O error while writing SimpleDB data.\");\n } catch (const std::exception& err) {\n std::ostringstream msg;\n msg << \"Error occurred while writing spatial database file '\"\n\t<< filename() << \"'.\\n\" \n\t<< err.what();\n throw std::runtime_error(msg.str());\n } catch (...) {\n std::ostringstream msg;\n msg << \"Unknown error occurred while writing spatial database file '\"\n\t<< filename() << \"'.\";\n throw std::runtime_error(msg.str());\n } \/\/ try\/catch\n} \/\/ write\n\n\n\/\/ End of file \n<commit_msg>Fixed a few minor memory leaks.<commit_after>\/\/ -*- C++ -*-\n\/\/\n\/\/ ----------------------------------------------------------------------\n\/\/\n\/\/ Brad T. Aagaard\n\/\/ U.S. Geological Survey\n\/\/\n\/\/ <LicenseText>\n\/\/\n\/\/ ----------------------------------------------------------------------\n\/\/\n\n#include <portinfo>\n\n#include \"SimpleIOAscii.hh\" \/\/ implementation of class methods\n\n#include \"SpatialDB.hh\" \/\/ USES SimpleDB\n#include \"SimpleDB.hh\" \/\/ USES SimpleDB\n\n#include \"SimpleDBData.hh\" \/\/ USES SimpleDBData\n#include \"spatialdata\/geocoords\/CoordSys.hh\" \/\/ USES CSCart\n#include \"spatialdata\/geocoords\/CSCart.hh\" \/\/ USES CSCart\n#include \"spatialdata\/geocoords\/CSPicklerAscii.hh\" \/\/ USES CSPicklerAscii\n\n#include \"spatialdata\/utils\/LineParser.hh\" \/\/ USES LineParser\n\n#include <fstream> \/\/ USES std::ofstream, std::ifstream\n#include <iomanip> \/\/ USES setw(), setiosflags(), resetiosflags()\n\n#include <stdexcept> \/\/ USES std::runtime_error\n#include <sstream> \/\/ USES std::ostringsgream\n#include <strings.h> \/\/ USES strcasecmp()\n#include <string.h> \/\/ USES strlen()\n#include <assert.h> \/\/ USES assert()\n\n\/\/ ----------------------------------------------------------------------\nconst char* spatialdata::spatialdb::SimpleIOAscii::HEADER =\n \"#SPATIAL.ascii\";\n\n\/\/ ----------------------------------------------------------------------\n\/\/ Read ascii database file.\nvoid\nspatialdata::spatialdb::SimpleIOAscii::read(\n\t\t\t\t SimpleDBData* pData,\n\t\t\t\t spatialdata::geocoords::CoordSys** ppCS)\n{ \/\/ read\n assert(0 != pData);\n\n try {\n std::ifstream filein(filename());\n if (!filein.is_open() || !filein.good()) {\n std::ostringstream msg;\n msg << \"Could not open spatial database file '\" << filename()\n\t << \"' for reading.\\n\";\n throw std::runtime_error(msg.str());\n } \/\/ if\n\n utils::LineParser parser(filein, \"\/\/\");\n parser.eatwhitespace(true);\n\n std::istringstream buffer;\n\n buffer.str(parser.next());\n buffer.clear();\n\n const int headerLen = strlen(HEADER);\n std::string hbuffer;\n hbuffer.resize(headerLen+1);\n buffer.read((char*) hbuffer.c_str(), sizeof(char)*headerLen);\n hbuffer[headerLen] = '\\0';\n if (0 != strcasecmp(HEADER, hbuffer.c_str())) {\n std::ostringstream msg;\n msg\n\t<< \"Magic header '\" << buffer << \"' does not match expected header '\"\n\t<< HEADER << \"' in spatial database file '\" << filename() << \"'.\\n\";\n throw std::runtime_error(msg.str());\n } \/\/ if\n int version = 0;\n buffer >> version;\n switch (version)\n { \/\/ switch\n case 1 :\n\t_readV1(pData, ppCS, filein);\n\tbreak;\n default :\n\t{ \/\/ default\n\t std::ostringstream msg;\n\t msg\n\t << \"Did not recognize format version \" << version\n\t << \" of spatial database file '\" << filename() << \"'.\\n\";\n\t throw std::runtime_error(msg.str());\n\t} \/\/ default\n } \/\/ switch\n if (!filein.good())\n throw std::runtime_error(\"Unknown error while reading.\");\n } catch (const std::exception& err) {\n std::ostringstream msg;\n msg << \"Error occurred while reading spatial database file '\"\n\t<< filename() << \"'.\\n\"\n\t<< err.what();\n throw std::runtime_error(msg.str());\n } catch (...) {\n std::ostringstream msg;\n msg << \"Unknown error occurred while reading spatial database file '\"\n\t<< filename() << \"'.\\n\";\n throw std::runtime_error(msg.str());\n } \/\/ try\/catch\n\n} \/\/ read\n\n\/\/ ----------------------------------------------------------------------\n\/\/ Read ascii database file.\nvoid\nspatialdata::spatialdb::SimpleIOAscii::_readV1(\n\t\t\t\t SimpleDBData* pData,\n\t\t\t\t spatialdata::geocoords::CoordSys** ppCS,\n\t\t\t\t std::istream& filein)\n{ \/\/ ReadV1\n assert(0 != pData);\n assert(0 != ppCS);\n\n utils::LineParser parser(filein, \"\/\/\");\n parser.eatwhitespace(true);\n\n std::string token;\n std::istringstream buffer;\n const int maxIgnore = 256;\n\n buffer.str(parser.next());\n buffer.clear();\n buffer >> token;\n if (0 != strcasecmp(token.c_str(), \"SimpleDB\")) {\n std::ostringstream msg;\n msg << \"Could not parse '\" << token << \"' into 'SimpleDB'.\\n\";\n throw std::runtime_error(msg.str());\n } \/\/ else\n\n int numValues = 0;\n int numLocs = 0;\n int spaceDim = 3; \/\/ default\n int dataDim = 0;\n std::string* names = 0;\n std::string* units = 0;\n\n buffer.str(parser.next());\n buffer.clear();\n buffer >> token;\n while (buffer.good() && token != \"}\") {\n if (0 == strcasecmp(token.c_str(), \"num-values\")) {\n buffer.ignore(maxIgnore, '=');\n buffer >> numValues;\n } else if (0 == strcasecmp(token.c_str(), \"num-locs\")) {\n buffer.ignore(maxIgnore, '=');\n buffer >> numLocs;\n } else if (0 == strcasecmp(token.c_str(), \"value-names\")) {\n if (numValues > 0) {\n\tdelete[] names; names = new std::string[numValues];\n } else\n\tthrow std::runtime_error(\"Number of values must be specified BEFORE \"\n\t\t\t\t \"names of values in SimpleDB file.\");\n buffer.ignore(maxIgnore, '=');\n for (int iVal=0; iVal < numValues; ++iVal)\n\tbuffer >> names[iVal];\n } else if (0 == strcasecmp(token.c_str(), \"value-units\")) {\n if (numValues > 0) {\n\tdelete[] units; units = new std::string[numValues];\n } else\n\tthrow std::runtime_error(\"Number of values must be specified BEFORE \"\n\t\t\t\t \"units of values in SimpleDB file.\");\n buffer.ignore(maxIgnore, '=');\n for (int iVal=0; iVal < numValues; ++iVal)\n\tbuffer >> units[iVal];\n } else if (0 == strcasecmp(token.c_str(), \"data-dim\")) {\n buffer.ignore(maxIgnore, '=');\n buffer >> dataDim;\n } else if (0 == strcasecmp(token.c_str(), \"space-dim\")) {\n buffer.ignore(maxIgnore, '=');\n buffer >> spaceDim;\n } else if (0 == strcasecmp(token.c_str(), \"cs-data\")) {\n buffer.ignore(maxIgnore, '=');\n std::string rbuffer(buffer.str());\n filein.putback('\\n');\n filein.clear();\n int i = rbuffer.length()-1;\n while (i >= 0) {\n\tfilein.putback(rbuffer[i]);\n\tif ('=' == rbuffer[i--])\n\t break;\n } \/\/ while\n filein.clear();\n spatialdata::geocoords::CSPicklerAscii::unpickle(filein, ppCS);\n } else {\n std::ostringstream msg;\n msg << \"Could not parse '\" << token << \"' into a SimpleDB setting.\";\n throw std::runtime_error(msg.str());\n } \/\/ else\n\n buffer.str(parser.next());\n buffer.clear();\n buffer >> token;\n } \/\/ while\n if (token != \"}\" || !filein.good())\n throw std::runtime_error(\"I\/O error while parsing SimpleDB settings.\");\n\n bool ok = true;\n std::ostringstream msg;\n if (0 == numValues) {\n ok = false;\n msg << \"SimpleDB settings must include 'num-values'.\\n\";\n } \/\/ if\n if (0 == numLocs) {\n ok = false;\n msg << \"SimpleDB settings must include 'num-locs'.\\n\";\n } \/\/ if\n if (0 == names) {\n ok = false;\n msg << \"SimpleDB settings must include 'value-names'.\\n\";\n } \/\/ if\n if (0 == units) {\n ok = false;\n msg << \"SimpleDB settings must include 'value-units'.\\n\";\n } \/\/ if\n if (!ok)\n throw std::runtime_error(msg.str());\n \n pData->allocate(numLocs, numValues, spaceDim, dataDim);\n char** cnames = (numValues > 0) ? new char*[numValues] : 0;\n char** cunits = (numValues > 0) ? new char*[numValues] : 0;\n for (int i=0; i < numValues; ++i) {\n cnames[i] = const_cast<char*>(names[i].c_str());\n cunits[i] = const_cast<char*>(units[i].c_str());\n } \/\/ for\n pData->names(const_cast<const char**>(cnames), numValues);\n pData->units(const_cast<const char**>(cunits), numValues);\n delete[] names; names = 0;\n delete[] units; units = 0;\n delete[] cnames; cnames = 0;\n delete[] cunits; cunits = 0;\n\n for (int iLoc=0; iLoc < numLocs; ++iLoc) {\n buffer.str(parser.next());\n buffer.clear();\n double* coordinates = pData->coordinates(iLoc);\n for (int iDim=0; iDim < spaceDim; ++iDim)\n buffer >> coordinates[iDim];\n double* data = pData->data(iLoc);\n for (int iVal=0; iVal < numValues; ++iVal)\n buffer >> data[iVal];\n } \/\/ for\n if (!filein.good())\n throw std::runtime_error(\"I\/O error while reading SimpleDB data.\");\n \n \/\/ Check compatibility of dimension of data, spatial dimension and\n \/\/ number of points\n checkCompatibility(*pData, *ppCS);\n \n assert(0 != *ppCS);\n (*ppCS)->initialize();\n} \/\/ _readV1\n\n\/\/ ----------------------------------------------------------------------\n\/\/ Write ascii database file.\nvoid\nspatialdata::spatialdb::SimpleIOAscii::write(\n\t\t\t\tconst SimpleDBData& data,\n\t\t\t\tconst spatialdata::geocoords::CoordSys* pCS)\n{ \/\/ write\n try {\n std::ofstream fileout(filename());\n if (!fileout.is_open() || !fileout.good()) {\n std::ostringstream msg;\n msg << \"Could not open spatial database file \" << filename()\n\t << \"for writing.\\n\";\n throw std::runtime_error(msg.str());\n } \/\/ if\n \n const int version = 1;\n const int numLocs = data.numLocs();\n const int numValues = data.numValues();\n const int spaceDim = data.spaceDim();\n const int dataDim = data.dataDim();\n \n fileout\n << HEADER << \" \" << version << \"\\n\"\n << \"SimpleDB {\\n\"\n << \" num-values = \" << std::setw(6) << numValues << \"\\n\"\n << \" value-names =\";\n for (int iVal=0; iVal < numValues; ++iVal)\n fileout << \" \" << data.name(iVal);\n fileout << \"\\n\";\n fileout << \" value-units =\";\n for (int iVal=0; iVal < numValues; ++iVal)\n fileout << \" \" << data.units(iVal);\n fileout << \"\\n\";\n fileout\n << \" num-locs = \" << std::setw(6) << numLocs << \"\\n\"\n << \" data-dim = \" << std::setw(4) << dataDim << \"\\n\"\n << \" space-dim = \" << std::setw(4) << spaceDim << \"\\n\"\n << \" cs-data = \";\n spatialdata::geocoords::CSPicklerAscii::pickle(fileout, pCS);\n fileout << \"}\\n\";\n if (!fileout.good())\n throw std::runtime_error(\"I\/O error while writing SimpleDB settings.\");\n\n fileout\n << std::resetiosflags(std::ios::fixed)\n << std::setiosflags(std::ios::scientific)\n << std::setprecision(6);\n for (int iLoc=0; iLoc < numLocs; ++iLoc) {\n const double* coordinates = data.coordinates(iLoc);\n for (int iCoord=0; iCoord < spaceDim; ++iCoord)\n\tfileout << std::setw(14) << coordinates[iCoord];\n const double* values = data.data(iLoc);\n for (int iVal=0; iVal < numValues; ++iVal)\n\tfileout << std::setw(14) << values[iVal];\n fileout << \"\\n\";\n } \/\/ for\n if (!fileout.good())\n throw std::runtime_error(\"I\/O error while writing SimpleDB data.\");\n } catch (const std::exception& err) {\n std::ostringstream msg;\n msg << \"Error occurred while writing spatial database file '\"\n\t<< filename() << \"'.\\n\" \n\t<< err.what();\n throw std::runtime_error(msg.str());\n } catch (...) {\n std::ostringstream msg;\n msg << \"Unknown error occurred while writing spatial database file '\"\n\t<< filename() << \"'.\";\n throw std::runtime_error(msg.str());\n } \/\/ try\/catch\n} \/\/ write\n\n\n\/\/ End of file \n<|endoftext|>"} {"text":"<commit_before>\/*************************************************************************\n *\n * $RCSfile: frmfmt.hxx,v $\n *\n * $Revision: 1.2 $\n *\n * last change: $Author: od $ $Date: 2002-08-28 12:02: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#ifndef _FRMFMT_HXX\n#define _FRMFMT_HXX\n\n#ifndef _FORMAT_HXX\n#include <format.hxx>\n#endif\n\nclass SwDrawContact;\nclass SwFlyFrm;\nclass Graphic;\nclass Point;\nclass ImageMap;\nclass IMapObject;\nclass SwRect;\nclass SwContact;\nclass SdrObject;\n\nclass SwFrmFmt: public SwFmt\n{\n friend class SwDoc;\n friend class SwPageDesc; \/\/darf den protected CTor rufen.\n friend class SwSwgReader; \/\/ der SW2-Reader auch!\n friend class Sw3IoImp; \/\/ der SW3-Reader auch!\n\nprotected:\n SwFrmFmt( SwAttrPool& rPool, const sal_Char* pFmtNm,\n SwFrmFmt *pDrvdFrm, USHORT nFmtWhich = RES_FRMFMT,\n const USHORT* pWhichRange = 0 )\n : SwFmt( rPool, pFmtNm, (pWhichRange ? pWhichRange : aFrmFmtSetRange),\n pDrvdFrm, nFmtWhich )\n {}\n\n SwFrmFmt( SwAttrPool& rPool, const String &rFmtNm,\n SwFrmFmt *pDrvdFrm, USHORT nFmtWhich = RES_FRMFMT,\n const USHORT* pWhichRange = 0 )\n : SwFmt( rPool, rFmtNm, (pWhichRange ? pWhichRange : aFrmFmtSetRange),\n pDrvdFrm, nFmtWhich )\n {}\n\npublic:\n TYPEINFO(); \/\/Bereits in Basisklasse Client drin.\n\n \/\/Vernichtet alle Frms in aDepend (Frms werden per PTR_CAST erkannt).\n virtual void DelFrms();\n\n \/\/Erzeugt die Ansichten\n virtual void MakeFrms();\n\n virtual Graphic MakeGraphic( ImageMap* pMap = NULL );\n\n virtual void Modify( SfxPoolItem* pOldValue, SfxPoolItem* pNewValue );\n\n \/\/ returnt das IMapObject, das an dem Format (Fly), in der ImageMap\n \/\/ an der Point Position definiert ist.\n \/\/ rPoint - teste auf der DocPosition\n \/\/ pFly - optionaler FlyFrame, falls der schon bekannt ist.\n IMapObject* GetIMapObject( const Point& rPoint,\n const SwFlyFrm *pFly = 0 ) const;\n\n \/\/ Gibt die tatsaechlche Groesse des Frames zurueck bzw. ein leeres\n \/\/ Rechteck, wenn kein Layout existiert. Wird pPoint angegeben, dann\n \/\/ wird der am dichtesten liegende Frame gesucht.\n SwRect FindLayoutRect( const BOOL bPrtArea = FALSE,\n const Point* pPoint = 0,\n const BOOL bCalcFrm = FALSE ) const;\n\n \/\/ Sucht das SdrObject. Der SdrObjUserCall ist Client vom Format.\n \/\/ Der UserCall kennt sein SdrObject.\n SwContact *FindContactObj();\n const SwContact *FindContactObj() const\n { return ((SwFrmFmt*)this)->FindContactObj(); }\n\n \/\/ returns the SdrObject, that ist connected to the ContactObject.\n \/\/ Only DrawFrmFmts are connected to the \"real SdrObject\". FlyFrmFmts\n \/\/ are connected to a Master and all FlyFrms has the \"real SdrObject\".\n \/\/ \"Real SdrObject\" has position and a Z-order.\n SdrObject *FindSdrObject();\n const SdrObject *FindSdrObject() const\n { return ((SwFrmFmt*)this)->FindSdrObject(); }\n\n SdrObject *FindRealSdrObject();\n const SdrObject *FindRealSdrObject() const\n { return ((SwFrmFmt*)this)->FindRealSdrObject(); }\n\n BOOL IsLowerOf( const SwFrmFmt& rFmt ) const;\n\n DECL_FIXEDMEMPOOL_NEWDEL(SwFrmFmt)\n};\n\n\/\/Das FlyFrame-Format ------------------------------\n\nclass SwFlyFrmFmt: public SwFrmFmt\n{\n friend class SwDoc;\n\n \/\/Beide nicht vorhanden.\n SwFlyFrmFmt( const SwFlyFrmFmt &rCpy );\n SwFlyFrmFmt &operator=( const SwFlyFrmFmt &rCpy );\n\nprotected:\n SwFlyFrmFmt( SwAttrPool& rPool, const sal_Char* pFmtNm,\n SwFrmFmt *pDrvdFrm )\n : SwFrmFmt( rPool, pFmtNm, pDrvdFrm, RES_FLYFRMFMT )\n {}\n SwFlyFrmFmt( SwAttrPool& rPool, const String &rFmtNm,\n SwFrmFmt *pDrvdFrm )\n : SwFrmFmt( rPool, rFmtNm, pDrvdFrm, RES_FLYFRMFMT )\n {}\n\npublic:\n TYPEINFO();\n ~SwFlyFrmFmt();\n\n \/\/Erzeugt die Ansichten\n virtual void MakeFrms();\n\n SwFlyFrm* GetFrm( const Point* pDocPos = 0,\n const BOOL bCalcFrm = FALSE ) const;\n\n virtual Graphic MakeGraphic( ImageMap* pMap = NULL );\n\n virtual BOOL GetInfo( SfxPoolItem& rInfo ) const;\n\n \/** SwFlyFrmFmt::IsBackgroundTransparent - for #99657#\n\n OD 22.08.2002 - overloading virtual method and its default implementation,\n because format of fly frame provides transparent backgrounds.\n Method determines, if background of fly frame has to be drawn transparent.\n\n @author OD\n\n @return true, if background color is transparent, but not \"no fill\"\n or a existing background graphic is transparent.\n *\/\n virtual const sal_Bool IsBackgroundTransparent() const;\n\n DECL_FIXEDMEMPOOL_NEWDEL(SwFlyFrmFmt)\n};\n\n\/\/Das DrawFrame-Format -----------------------------\n\nclass SwDrawFrmFmt: public SwFrmFmt\n{\n friend class SwDoc;\n\n \/\/Beide nicht vorhanden.\n SwDrawFrmFmt( const SwDrawFrmFmt &rCpy );\n SwDrawFrmFmt &operator=( const SwDrawFrmFmt &rCpy );\n\nprotected:\n SwDrawFrmFmt( SwAttrPool& rPool, const sal_Char* pFmtNm,\n SwFrmFmt *pDrvdFrm )\n : SwFrmFmt( rPool, pFmtNm, pDrvdFrm, RES_DRAWFRMFMT )\n {}\n SwDrawFrmFmt( SwAttrPool& rPool, const String &rFmtNm,\n SwFrmFmt *pDrvdFrm )\n : SwFrmFmt( rPool, rFmtNm, pDrvdFrm, RES_DRAWFRMFMT )\n {}\n\npublic:\n TYPEINFO();\n ~SwDrawFrmFmt();\n\n \/\/DrawObjecte werden aus den Arrays am Layout entfernt. Die DrawObjecte\n \/\/werden als geloescht gekennzeichnet.\n virtual void DelFrms();\n\n \/\/Anmelden der DrawObjecte in den Arrays am Layout. Loeschkennzeichen\n \/\/werden zurueckgesetzt.\n virtual void MakeFrms();\n\n virtual Graphic MakeGraphic( ImageMap* pMap = NULL );\n\n\n DECL_FIXEDMEMPOOL_NEWDEL(SwDrawFrmFmt);\n};\n\n\n#endif\n\n<commit_msg>#103898# - new method SwFlyFrmFmt::IsBackgroundBrushInherited for transparency<commit_after>\/*************************************************************************\n *\n * $RCSfile: frmfmt.hxx,v $\n *\n * $Revision: 1.3 $\n *\n * last change: $Author: od $ $Date: 2002-10-11 11:37:10 $\n *\n * The Contents of this file are made available subject to the terms of\n * either of the following licenses\n *\n * - GNU Lesser General Public License Version 2.1\n * - Sun Industry Standards Source License Version 1.1\n *\n * Sun Microsystems Inc., October, 2000\n *\n * GNU Lesser General Public License Version 2.1\n * =============================================\n * Copyright 2000 by Sun Microsystems, Inc.\n * 901 San Antonio Road, Palo Alto, CA 94303, USA\n *\n * This library is free software; you can redistribute it and\/or\n * modify it under the terms of the GNU Lesser General Public\n * License version 2.1, as published by the Free Software Foundation.\n *\n * This library is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU\n * Lesser General Public License for more details.\n *\n * You should have received a copy of the GNU Lesser General Public\n * License along with this library; if not, write to the Free Software\n * Foundation, Inc., 59 Temple Place, Suite 330, Boston,\n * MA 02111-1307 USA\n *\n *\n * Sun Industry Standards Source License Version 1.1\n * =================================================\n * The contents of this file are subject to the Sun Industry Standards\n * Source License Version 1.1 (the \"License\"); You may not use this file\n * except in compliance with the License. You may obtain a copy of the\n * License at http:\/\/www.openoffice.org\/license.html.\n *\n * Software provided under this License is provided on an \"AS IS\" basis,\n * WITHOUT WARRANTY OF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING,\n * WITHOUT LIMITATION, WARRANTIES THAT THE SOFTWARE IS FREE OF DEFECTS,\n * MERCHANTABLE, FIT FOR A PARTICULAR PURPOSE, OR NON-INFRINGING.\n * See the License for the specific provisions governing your rights and\n * obligations concerning the Software.\n *\n * The Initial Developer of the Original Code is: Sun Microsystems, Inc.\n *\n * Copyright: 2000 by Sun Microsystems, Inc.\n *\n * All Rights Reserved.\n *\n * Contributor(s): _______________________________________\n *\n *\n ************************************************************************\/\n#ifndef _FRMFMT_HXX\n#define _FRMFMT_HXX\n\n#ifndef _FORMAT_HXX\n#include <format.hxx>\n#endif\n\nclass SwDrawContact;\nclass SwFlyFrm;\nclass Graphic;\nclass Point;\nclass ImageMap;\nclass IMapObject;\nclass SwRect;\nclass SwContact;\nclass SdrObject;\n\nclass SwFrmFmt: public SwFmt\n{\n friend class SwDoc;\n friend class SwPageDesc; \/\/darf den protected CTor rufen.\n friend class SwSwgReader; \/\/ der SW2-Reader auch!\n friend class Sw3IoImp; \/\/ der SW3-Reader auch!\n\nprotected:\n SwFrmFmt( SwAttrPool& rPool, const sal_Char* pFmtNm,\n SwFrmFmt *pDrvdFrm, USHORT nFmtWhich = RES_FRMFMT,\n const USHORT* pWhichRange = 0 )\n : SwFmt( rPool, pFmtNm, (pWhichRange ? pWhichRange : aFrmFmtSetRange),\n pDrvdFrm, nFmtWhich )\n {}\n\n SwFrmFmt( SwAttrPool& rPool, const String &rFmtNm,\n SwFrmFmt *pDrvdFrm, USHORT nFmtWhich = RES_FRMFMT,\n const USHORT* pWhichRange = 0 )\n : SwFmt( rPool, rFmtNm, (pWhichRange ? pWhichRange : aFrmFmtSetRange),\n pDrvdFrm, nFmtWhich )\n {}\n\npublic:\n TYPEINFO(); \/\/Bereits in Basisklasse Client drin.\n\n \/\/Vernichtet alle Frms in aDepend (Frms werden per PTR_CAST erkannt).\n virtual void DelFrms();\n\n \/\/Erzeugt die Ansichten\n virtual void MakeFrms();\n\n virtual Graphic MakeGraphic( ImageMap* pMap = NULL );\n\n virtual void Modify( SfxPoolItem* pOldValue, SfxPoolItem* pNewValue );\n\n \/\/ returnt das IMapObject, das an dem Format (Fly), in der ImageMap\n \/\/ an der Point Position definiert ist.\n \/\/ rPoint - teste auf der DocPosition\n \/\/ pFly - optionaler FlyFrame, falls der schon bekannt ist.\n IMapObject* GetIMapObject( const Point& rPoint,\n const SwFlyFrm *pFly = 0 ) const;\n\n \/\/ Gibt die tatsaechlche Groesse des Frames zurueck bzw. ein leeres\n \/\/ Rechteck, wenn kein Layout existiert. Wird pPoint angegeben, dann\n \/\/ wird der am dichtesten liegende Frame gesucht.\n SwRect FindLayoutRect( const BOOL bPrtArea = FALSE,\n const Point* pPoint = 0,\n const BOOL bCalcFrm = FALSE ) const;\n\n \/\/ Sucht das SdrObject. Der SdrObjUserCall ist Client vom Format.\n \/\/ Der UserCall kennt sein SdrObject.\n SwContact *FindContactObj();\n const SwContact *FindContactObj() const\n { return ((SwFrmFmt*)this)->FindContactObj(); }\n\n \/\/ returns the SdrObject, that ist connected to the ContactObject.\n \/\/ Only DrawFrmFmts are connected to the \"real SdrObject\". FlyFrmFmts\n \/\/ are connected to a Master and all FlyFrms has the \"real SdrObject\".\n \/\/ \"Real SdrObject\" has position and a Z-order.\n SdrObject *FindSdrObject();\n const SdrObject *FindSdrObject() const\n { return ((SwFrmFmt*)this)->FindSdrObject(); }\n\n SdrObject *FindRealSdrObject();\n const SdrObject *FindRealSdrObject() const\n { return ((SwFrmFmt*)this)->FindRealSdrObject(); }\n\n BOOL IsLowerOf( const SwFrmFmt& rFmt ) const;\n\n DECL_FIXEDMEMPOOL_NEWDEL(SwFrmFmt)\n};\n\n\/\/Das FlyFrame-Format ------------------------------\n\nclass SwFlyFrmFmt: public SwFrmFmt\n{\n friend class SwDoc;\n\n \/\/Beide nicht vorhanden.\n SwFlyFrmFmt( const SwFlyFrmFmt &rCpy );\n SwFlyFrmFmt &operator=( const SwFlyFrmFmt &rCpy );\n\nprotected:\n SwFlyFrmFmt( SwAttrPool& rPool, const sal_Char* pFmtNm,\n SwFrmFmt *pDrvdFrm )\n : SwFrmFmt( rPool, pFmtNm, pDrvdFrm, RES_FLYFRMFMT )\n {}\n SwFlyFrmFmt( SwAttrPool& rPool, const String &rFmtNm,\n SwFrmFmt *pDrvdFrm )\n : SwFrmFmt( rPool, rFmtNm, pDrvdFrm, RES_FLYFRMFMT )\n {}\n\npublic:\n TYPEINFO();\n ~SwFlyFrmFmt();\n\n \/\/Erzeugt die Ansichten\n virtual void MakeFrms();\n\n SwFlyFrm* GetFrm( const Point* pDocPos = 0,\n const BOOL bCalcFrm = FALSE ) const;\n\n virtual Graphic MakeGraphic( ImageMap* pMap = NULL );\n\n virtual BOOL GetInfo( SfxPoolItem& rInfo ) const;\n\n \/** SwFlyFrmFmt::IsBackgroundTransparent - for #99657#\n\n OD 22.08.2002 - overloading virtual method and its default implementation,\n because format of fly frame provides transparent backgrounds.\n Method determines, if background of fly frame is transparent.\n\n @author OD\n\n @return true, if background color is transparent, but not \"no fill\"\n or a existing background graphic is transparent.\n *\/\n virtual const sal_Bool IsBackgroundTransparent() const;\n\n \/** SwFlyFrmFmt::IsBackgroundBrushInherited - for #103898#\n\n OD 08.10.2002 - method to determine, if the brush for drawing the\n background is \"inherited\" from its parent\/grandparent.\n This is the case, if no background graphic is set and the background\n color is \"no fill\"\/\"auto fill\"\n\n @author OD\n\n @return true, if background brush is \"inherited\" from parent\/grandparent\n *\/\n const sal_Bool IsBackgroundBrushInherited() const;\n\n DECL_FIXEDMEMPOOL_NEWDEL(SwFlyFrmFmt)\n};\n\n\/\/Das DrawFrame-Format -----------------------------\n\nclass SwDrawFrmFmt: public SwFrmFmt\n{\n friend class SwDoc;\n\n \/\/Beide nicht vorhanden.\n SwDrawFrmFmt( const SwDrawFrmFmt &rCpy );\n SwDrawFrmFmt &operator=( const SwDrawFrmFmt &rCpy );\n\nprotected:\n SwDrawFrmFmt( SwAttrPool& rPool, const sal_Char* pFmtNm,\n SwFrmFmt *pDrvdFrm )\n : SwFrmFmt( rPool, pFmtNm, pDrvdFrm, RES_DRAWFRMFMT )\n {}\n SwDrawFrmFmt( SwAttrPool& rPool, const String &rFmtNm,\n SwFrmFmt *pDrvdFrm )\n : SwFrmFmt( rPool, rFmtNm, pDrvdFrm, RES_DRAWFRMFMT )\n {}\n\npublic:\n TYPEINFO();\n ~SwDrawFrmFmt();\n\n \/\/DrawObjecte werden aus den Arrays am Layout entfernt. Die DrawObjecte\n \/\/werden als geloescht gekennzeichnet.\n virtual void DelFrms();\n\n \/\/Anmelden der DrawObjecte in den Arrays am Layout. Loeschkennzeichen\n \/\/werden zurueckgesetzt.\n virtual void MakeFrms();\n\n virtual Graphic MakeGraphic( ImageMap* pMap = NULL );\n\n\n DECL_FIXEDMEMPOOL_NEWDEL(SwDrawFrmFmt);\n};\n\n\n#endif\n\n<|endoftext|>"} {"text":"<commit_before>\/\/ This may look like C code, but it is really -*- C++ -*-\n\/* \nCopyright (C) 1988 Free Software Foundation\n written by Dirk Grunwald (grunwald@cs.uiuc.edu)\n\nThis file is part of the GNU C++ Library. This library is free\nsoftware; you can redistribute it and\/or modify it under the terms of\nthe GNU Library General Public License as published by the Free\nSoftware Foundation; either version 2 of the License, or (at your\noption) any later version. This library is distributed in the hope\nthat it will be useful, but WITHOUT ANY WARRANTY; without even the\nimplied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR\nPURPOSE. See the GNU Library General Public License for more details.\nYou should have received a copy of the GNU Library General Public\nLicense along with this library; if not, write to the Free Software\nFoundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301, USA.\n*\/\n\n#ifdef HAVE_CONFIG_H\n#include <simgear_config.h>\n#endif\n\n#include <iostream>\n#include <fstream>\n#include \"SGSmplhist.hxx\"\n#include <math.h>\n\n#ifndef HUGE_VAL\n#ifdef HUGE\n#define HUGE_VAL HUGE\n#else\n#include <float.h>\n#define HUGE_VAL DBL_MAX\n#endif\n#endif\n\nconst int SampleHistogramMinimum = -2;\nconst int SampleHistogramMaximum = -1;\n\nSampleHistogram::SampleHistogram (double low, double high, double width)\n{\n if (high < low)\n {\n double t = high;\n high = low;\n low = t;\n }\n\n if (width == -1)\n {\n width = (high - low) \/ 10;\n }\n\n howManyBuckets = int ((high - low) \/ width) + 2;\n bucketCount = new int[howManyBuckets];\n bucketLimit = new double[howManyBuckets];\n double lim = low;\n for (int i = 0; i < howManyBuckets; i++)\n {\n bucketCount[i] = 0;\n bucketLimit[i] = lim;\n lim += width;\n }\n bucketLimit[howManyBuckets - 1] = HUGE_VAL;\t\/* from math.h *\/\n}\n\nSampleHistogram::~SampleHistogram ()\n{\n if (howManyBuckets > 0)\n {\n delete[]bucketCount;\n delete[]bucketLimit;\n }\n}\n\nvoid SampleHistogram::operator += (double value)\n{\n int i;\n for (i = 0; i < howManyBuckets; i++)\n {\n if (value < bucketLimit[i])\n\tbreak;\n }\n bucketCount[i]++;\n this->SampleStatistic::operator += (value);\n}\n\nint SampleHistogram::similarSamples (double d)\n{\n int i;\n for (i = 0; i < howManyBuckets; i++)\n {\n if (d < bucketLimit[i])\n\treturn (bucketCount[i]);\n }\n return (0);\n}\n\nvoid SampleHistogram::printBuckets (std::ostream & s)\n{\n for (int i = 0; i < howManyBuckets; i++)\n {\n if (bucketLimit[i] >= HUGE_VAL)\n\t{\n\t s << \"< max : \" << bucketCount[i] << \"\\n\";\n\t}\n else\n\t{\n\t s << \"< \" << bucketLimit[i] << \" : \" << bucketCount[i] << \"\\n\";\n\t}\n }\n}\n\nvoid SampleHistogram::reset ()\n{\n this->SampleStatistic::reset ();\n if (howManyBuckets > 0)\n {\n for (register int i = 0; i < howManyBuckets; i++)\n\t{\n\t bucketCount[i] = 0;\n\t}\n }\n}\n<commit_msg>Fix a clang warning<commit_after>\/\/ This may look like C code, but it is really -*- C++ -*-\n\/* \nCopyright (C) 1988 Free Software Foundation\n written by Dirk Grunwald (grunwald@cs.uiuc.edu)\n\nThis file is part of the GNU C++ Library. This library is free\nsoftware; you can redistribute it and\/or modify it under the terms of\nthe GNU Library General Public License as published by the Free\nSoftware Foundation; either version 2 of the License, or (at your\noption) any later version. This library is distributed in the hope\nthat it will be useful, but WITHOUT ANY WARRANTY; without even the\nimplied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR\nPURPOSE. See the GNU Library General Public License for more details.\nYou should have received a copy of the GNU Library General Public\nLicense along with this library; if not, write to the Free Software\nFoundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301, USA.\n*\/\n\n#ifdef HAVE_CONFIG_H\n#include <simgear_config.h>\n#endif\n\n#include <iostream>\n#include <fstream>\n#include \"SGSmplhist.hxx\"\n#include <math.h>\n\n#ifndef HUGE_VAL\n#ifdef HUGE\n#define HUGE_VAL HUGE\n#else\n#include <float.h>\n#define HUGE_VAL DBL_MAX\n#endif\n#endif\n\nconst int SampleHistogramMinimum = -2;\nconst int SampleHistogramMaximum = -1;\n\nSampleHistogram::SampleHistogram (double low, double high, double width)\n{\n if (high < low)\n {\n double t = high;\n high = low;\n low = t;\n }\n\n if (width == -1)\n {\n width = (high - low) \/ 10;\n }\n\n howManyBuckets = int ((high - low) \/ width) + 2;\n bucketCount = new int[howManyBuckets];\n bucketLimit = new double[howManyBuckets];\n double lim = low;\n for (int i = 0; i < howManyBuckets; i++)\n {\n bucketCount[i] = 0;\n bucketLimit[i] = lim;\n lim += width;\n }\n bucketLimit[howManyBuckets - 1] = HUGE_VAL;\t\/* from math.h *\/\n}\n\nSampleHistogram::~SampleHistogram ()\n{\n if (howManyBuckets > 0)\n {\n delete[]bucketCount;\n delete[]bucketLimit;\n }\n}\n\nvoid SampleHistogram::operator += (double value)\n{\n int i;\n for (i = 0; i < howManyBuckets; i++)\n {\n if (value < bucketLimit[i])\n\tbreak;\n }\n bucketCount[i]++;\n this->SampleStatistic::operator += (value);\n}\n\nint SampleHistogram::similarSamples (double d)\n{\n int i;\n for (i = 0; i < howManyBuckets; i++)\n {\n if (d < bucketLimit[i])\n\treturn (bucketCount[i]);\n }\n return (0);\n}\n\nvoid SampleHistogram::printBuckets (std::ostream & s)\n{\n for (int i = 0; i < howManyBuckets; i++)\n {\n if (bucketLimit[i] >= HUGE_VAL)\n\t{\n\t s << \"< max : \" << bucketCount[i] << \"\\n\";\n\t}\n else\n\t{\n\t s << \"< \" << bucketLimit[i] << \" : \" << bucketCount[i] << \"\\n\";\n\t}\n }\n}\n\nvoid SampleHistogram::reset ()\n{\n this->SampleStatistic::reset ();\n if (howManyBuckets > 0)\n {\n for (int i = 0; i < howManyBuckets; i++)\n\t{\n\t bucketCount[i] = 0;\n\t}\n }\n}\n<|endoftext|>"} {"text":"<commit_before>\/** \n * @file heisenberg.cpp\n * @brief The main c++ file for the DMRG\n *\n * \n * @author Roger Melko \n * @author Ivan Gonzalez\n * @date $Date$\n *\n * $Revision$ \n *\n * Elementary DMRG simulation for the Heisenberg chain; \n * \\f$H= \\sum_{ij} (S^x_i S^x_j + S^y_i S^y_j + S^z_i S^z_j ) \\f$\n *\n * <ul> \n * <li> Begins with the \"symmetric\" infinite system algorithm to build \n * up the chain\n * <li> After this, a number of finite system algorithm sweeps are performed\n * <li> The exact diagonalization performed with Lanczos\n * <li> The output is the energy as a function of sweep\n * <li> The code uses Blitz++ to handle tensors and matrices: see http:\/\/www.oonumerics.org\/blitz\/\n * <\/ul>\n *\/\n#include \"blitz\/array.h\"\n#include \"block.h\"\n#include \"matrixManipulation.h\"\n#include \"lanczosDMRG.h\"\n#include \"densityMatrix.h\"\n#include \"main_helpers.h\"\n\nint main()\n{\n \/\/ Read some input from user\n int numberOfHalfSweeps;\n int numberOfSites; \n int m;\n std::cout<<\"Enter the number states to keep: \";\n std::cin>>m;\n std::cout<<\"Enter the number of sites in the chain: \";\n std::cin>>numberOfSites;\n std::cout<<\"Enter the number of FSA sweeps : \";\n std::cin>>numberOfHalfSweeps;\n\n Block system; \/\/create the system block\n Block environ; \/\/create the environment block\n\n \/\/Below we declare the Blitz++ matrices used by the program\n blitz::Array<double,4> TSR(2,2,2,2); \/\/tensor product for Hab hamiltonian\n\n blitz::Array<double,4> Habcd(4,4,4,4); \/\/ superblock hamiltonian\n blitz::Array<double,2> Psi(4,4); \/\/ ground state wavefunction\n blitz::Array<double,2> reducedDM(4,4); \/\/ reduced density matrix\n blitz::Array<double,2> OO(m,4); \/\/ the truncation matrix\n blitz::Array<double,2> OT(4,m); \/\/ transposed truncation matrix\n\n blitz::Array<double,2> HAp; \/\/A' block hamiltonian\n blitz::Array<double,2> SzB; \/\/Sz(left) operator \n blitz::Array<double,2> SmB; \/\/Sm(left) operator\n blitz::Array<double,2> SpB; \/\/Sp(left) operator\n\n \/\/ create the pauli matrices and the 2x2 identity matrix\n blitz::Array<double,2> sigma_z(2,2), sigma_p(2,2), sigma_m(2,2);\n sigma_z = 0.5, 0,\n 0, -0.5;\n sigma_p = 0, 1.0,\n 0, 0;\n sigma_m = 0, 0,\n 1.0, 0;\n blitz::Array<double,2> I2=createIdentityMatrix(2);\n\n \/\/ declare tensor indices according to Blitz++ convention\n blitz::firstIndex i; blitz::secondIndex j; \n blitz::thirdIndex k; blitz::fourthIndex l; \n\n \/\/ build the Hamiltonian for two-sites only\n TSR = sigma_z(i,k)*sigma_z(j,l)+ 0.5*sigma_p(i,k)*sigma_m(j,l) + \n\t0.5*sigma_m(i,k)*sigma_p(j,l);\n system.blockH.resize(4,4);\n system.blockH = reduceM2M2(TSR);\n\n TSR = sigma_z(i,k)*I2(j,l);\n blitz::Array<double,2> S_z = reduceM2M2(TSR);\n\n TSR = sigma_m(i,k)*I2(j,l);\n blitz::Array<double,2> S_m = reduceM2M2(TSR);\n\n TSR = sigma_p(i,k)*I2(j,l);\n blitz::Array<double,2> S_p = reduceM2M2(TSR);\n \/\/ done building the Hamiltonian\n\n \/**\n * Infinite system algorithm: build the Hamiltonian from 2 to N-sites\n *\/\n int statesToKeep=2; \/\/start with a 2^2=4 state system\n int sitesInSystem=2; \/\/# sites in the system block\n\n blitz::Array<double,2> I2st=createIdentityMatrix(4);\n\n while (sitesInSystem <= (numberOfSites)\/2 ) \n {\n\t\/\/ build the hamiltonian as a four-index tensor\n Habcd = system.blockH(i,k)*I2st(j,l)+ \n I2st(i,k)*system.blockH(j,l)+\n S_z(i,k)*S_z(j,l)+0.5*S_p(i,k)*S_m(j,l)+0.5*S_m(i,k)*S_p(j,l);\n\n\t\/\/ calculate the ground state energy \n double groundStateEnergy=calculateGroundState(Habcd, Psi);\n\n printGroundStateEnergy(sitesInSystem, sitesInSystem, groundStateEnergy);\n\n\t\/\/ increase the number of states if you are not at m yet\n statesToKeep= (2*statesToKeep<=m)? 2*statesToKeep : m;\n\n \/\/ calculate the reduced density matrix and truncate \n reducedDM=calculateReducedDensityMatrix(Psi);\n\n OO.resize(statesToKeep,reducedDM.rows()); \/\/resize transf. matrix\n OT.resize(reducedDM.rows(),statesToKeep); \/\/ and its inverse\n OO=truncateReducedDM(reducedDM, statesToKeep); \/\/get transf. matrix \n OT=OO.transpose(blitz::secondDim, blitz::firstDim); \/\/and its inverse\n\n \/\/transform the operators to new basis\n HAp.resize(statesToKeep, statesToKeep);\n SzB.resize(statesToKeep, statesToKeep);\n SpB.resize(statesToKeep, statesToKeep);\n SmB.resize(statesToKeep, statesToKeep);\n HAp=transformOperator(system.blockH, OT, OO);\n SzB=transformOperator(S_z, OT, OO);\n SpB=transformOperator(S_p, OT, OO);\n SmB=transformOperator(S_m, OT, OO);\n\n \/\/Hamiltonian for next iteration\n TSR.resize(statesToKeep,2,statesToKeep,2);\n TSR = HAp(i,k)*I2(j,l) + SzB(i,k)*sigma_z(j,l)+ \n 0.5*SpB(i,k)*sigma_m(j,l) + 0.5*SmB(i,k)*sigma_p(j,l) ;\n\n system.blockH.resize(2*statesToKeep,2*statesToKeep); \n system.blockH = reduceM2M2(TSR);\n\n\t\/\/redefine identity matrix\n\tint statesToKeepNext= (2*statesToKeep<=m)? 4*statesToKeep : 2*m;\n\tI2st.resize(statesToKeepNext, statesToKeepNext); \n\tI2st = createIdentityMatrix(statesToKeepNext);\n\n\t\/\/redefine the operators for next iteration\n\tS_z.resize(2*statesToKeep,2*statesToKeep); \n\tTSR = I2st(i,k)*sigma_z(j,l);\n\tS_z = reduceM2M2(TSR);\n\n\tS_p.resize(2*statesToKeep,2*statesToKeep);\n\tTSR = I2st(i,k)*sigma_p(j,l);\n\tS_p = reduceM2M2(TSR);\n\n\tS_m.resize(2*statesToKeep,2*statesToKeep);\n\tTSR = I2st(i,k)*sigma_m(j,l);\n\tS_m = reduceM2M2(TSR); \n\n\t\/\/ re-prepare superblock matrix, wavefunction and reduced DM\n\tHabcd.resize(2*statesToKeep,2*statesToKeep,2*statesToKeep,2*statesToKeep); \n\tPsi.resize(2*statesToKeep,2*statesToKeep); \n\treducedDM.resize(2*statesToKeep,2*statesToKeep);\n\n\t\/\/ make the system one site larger and save it\n system.size = ++sitesInSystem; \n system.ISAwrite(sitesInSystem);\n\n }\/\/end INFINITE SYSTEM ALGORITHM \n\n std::cout<<\"End of the infinite system algorithm\\n\";\n\n \/**\n * Finite size algorithm \n *\/\n {\n \/\/ find minimum size of the enviroment\n int minEnviromentSize=calculateMinEnviromentSize(m,numberOfSites);\n\n \/\/ start in the middle of the chain \n int sitesInSystem = numberOfSites\/2;\n system.FSAread(sitesInSystem,1);\n\n for (int halfSweep=0; halfSweep<numberOfHalfSweeps; halfSweep++)\n {\n while (sitesInSystem <= numberOfSites-minEnviromentSize)\n {\n int sitesInEnviroment = numberOfSites - sitesInSystem;\n\n \/\/ read the environment block from disk\n environ.FSAread(sitesInEnviroment,halfSweep);\n\n \/\/ build the hamiltonian as a four-index tensor\n Habcd = environ.blockH(i,k)*I2st(j,l)+\n\t\t I2st(i,k)*system.blockH(j,l)+\n S_z(i,k)*S_z(j,l)+\n 0.5*S_p(i,k)*S_m(j,l)+0.5*S_m(i,k)*S_p(j,l);\n\n \/\/ calculate the ground state energy \n double groundStateEnergy=calculateGroundState(Habcd, Psi);\n\n if (halfSweep%2 == 0) \n printGroundStateEnergy(sitesInSystem, sitesInEnviroment, \n groundStateEnergy);\n else \n printGroundStateEnergy(sitesInEnviroment, sitesInSystem, \n groundStateEnergy);\n\n \/\/ calculate the reduced density matrix and truncate \n reducedDM=calculateReducedDensityMatrix(Psi);\n\n blitz::Array<double,2> OO=truncateReducedDM(reducedDM, m); \n OT=OO.transpose(blitz::secondDim, blitz::firstDim);\n\n \/\/ transform the operators to new basis\n HAp=transformOperator(system.blockH, OT, OO);\n SzB=transformOperator(S_z, OT, OO);\n SpB=transformOperator(S_p, OT, OO);\n SmB=transformOperator(S_m, OT, OO);\n\n \/\/ add spin to the system block only\n TSR = HAp(i,k)*I2(j,l) + SzB(i,k)*sigma_z(j,l)+ \n 0.5*SpB(i,k)*sigma_m(j,l) + 0.5*SmB(i,k)*sigma_p(j,l); \n system.blockH = reduceM2M2(TSR);\n\n sitesInSystem++;\n\n system.size = sitesInSystem;\n system.FSAwrite(sitesInSystem,halfSweep);\n }\/\/ while\n\n sitesInSystem = minEnviromentSize;\n system.FSAread(sitesInSystem,halfSweep);\n\n }\/\/ for\n } \/\/ end of the finite size algorithm\n return 0;\n} \/\/ end main\n<commit_msg>Last name changes.<commit_after>\/** \n * @file heisenberg.cpp\n * @brief The main c++ file for the DMRG\n *\n * \n * @author Roger Melko \n * @author Ivan Gonzalez\n * @date $Date$\n *\n * $Revision$ \n *\n * Elementary DMRG simulation for the Heisenberg chain; \n * \\f$H= \\sum_{ij} (S^x_i S^x_j + S^y_i S^y_j + S^z_i S^z_j ) \\f$\n *\n * <ul> \n * <li> Begins with the \"symmetric\" infinite system algorithm to build \n * up the chain\n * <li> After this, a number of finite system algorithm sweeps are performed\n * <li> The exact diagonalization performed with Lanczos\n * <li> The output is the energy as a function of sweep\n * <li> The code uses Blitz++ to handle tensors and matrices: see http:\/\/www.oonumerics.org\/blitz\/\n * <\/ul>\n *\/\n#include \"blitz\/array.h\"\n#include \"block.h\"\n#include \"matrixManipulation.h\"\n#include \"lanczosDMRG.h\"\n#include \"densityMatrix.h\"\n#include \"main_helpers.h\"\n\nint main()\n{\n \/\/ Read some input from user\n int numberOfHalfSweeps;\n int numberOfSites; \n int m;\n std::cout<<\"Enter the number states to keep: \";\n std::cin>>m;\n std::cout<<\"Enter the number of sites in the chain: \";\n std::cin>>numberOfSites;\n std::cout<<\"Enter the number of FSA sweeps : \";\n std::cin>>numberOfHalfSweeps;\n\n Block system; \/\/create the system block\n Block environ; \/\/create the environment block\n\n \/\/Below we declare the Blitz++ matrices used by the program\n blitz::Array<double,4> TSR(2,2,2,2); \/\/tensor product for Hab hamiltonian\n\n blitz::Array<double,4> Habcd(4,4,4,4); \/\/ superblock hamiltonian\n blitz::Array<double,2> Psi(4,4); \/\/ ground state wavefunction\n blitz::Array<double,2> reducedDM(4,4); \/\/ reduced density matrix\n blitz::Array<double,2> OO(m,4); \/\/ the truncation matrix\n blitz::Array<double,2> OT(4,m); \/\/ transposed truncation matrix\n\n blitz::Array<double,2> blockH_p; \/\/block hamiltonian after transform.\n blitz::Array<double,2> S_z_p; \/\/S_z operator after transformation \n blitz::Array<double,2> S_m_p; \/\/S_m operator after transformation\n blitz::Array<double,2> S_p_p; \/\/S_p operator after transformation\n\n \/\/ create the pauli matrices and the 2x2 identity matrix\n blitz::Array<double,2> sigma_z(2,2), sigma_p(2,2), sigma_m(2,2);\n sigma_z = 0.5, 0,\n 0, -0.5;\n sigma_p = 0, 1.0,\n 0, 0;\n sigma_m = 0, 0,\n 1.0, 0;\n blitz::Array<double,2> I2=createIdentityMatrix(2);\n\n \/\/ declare tensor indices according to Blitz++ convention\n blitz::firstIndex i; blitz::secondIndex j; \n blitz::thirdIndex k; blitz::fourthIndex l; \n\n \/\/ build the Hamiltonian for two-sites only\n TSR = sigma_z(i,k)*sigma_z(j,l)+ 0.5*sigma_p(i,k)*sigma_m(j,l) + \n\t0.5*sigma_m(i,k)*sigma_p(j,l);\n system.blockH.resize(4,4);\n system.blockH = reduceM2M2(TSR);\n\n TSR = sigma_z(i,k)*I2(j,l);\n blitz::Array<double,2> S_z = reduceM2M2(TSR);\n\n TSR = sigma_m(i,k)*I2(j,l);\n blitz::Array<double,2> S_m = reduceM2M2(TSR);\n\n TSR = sigma_p(i,k)*I2(j,l);\n blitz::Array<double,2> S_p = reduceM2M2(TSR);\n \/\/ done building the Hamiltonian\n\n \/**\n * Infinite system algorithm: build the Hamiltonian from 2 to N-sites\n *\/\n int statesToKeep=2; \/\/start with a 2^2=4 state system\n int sitesInSystem=2; \/\/# sites in the system block\n\n blitz::Array<double,2> I2st=createIdentityMatrix(4);\n\n while (sitesInSystem <= (numberOfSites)\/2 ) \n {\n\t\/\/ build the hamiltonian as a four-index tensor\n Habcd = system.blockH(i,k)*I2st(j,l)+ \n I2st(i,k)*system.blockH(j,l)+\n S_z(i,k)*S_z(j,l)+0.5*S_p(i,k)*S_m(j,l)+0.5*S_m(i,k)*S_p(j,l);\n\n\t\/\/ calculate the ground state energy \n double groundStateEnergy=calculateGroundState(Habcd, Psi);\n\n printGroundStateEnergy(sitesInSystem, sitesInSystem, groundStateEnergy);\n\n\t\/\/ increase the number of states if you are not at m yet\n statesToKeep= (2*statesToKeep<=m)? 2*statesToKeep : m;\n\n \/\/ calculate the reduced density matrix and truncate \n reducedDM=calculateReducedDensityMatrix(Psi);\n\n OO.resize(statesToKeep,reducedDM.rows()); \/\/resize transf. matrix\n OT.resize(reducedDM.rows(),statesToKeep); \/\/ and its inverse\n OO=truncateReducedDM(reducedDM, statesToKeep); \/\/get transf. matrix \n OT=OO.transpose(blitz::secondDim, blitz::firstDim); \/\/and its inverse\n\n \/\/transform the operators to new basis\n blockH_p.resize(statesToKeep, statesToKeep);\n S_z_p.resize(statesToKeep, statesToKeep);\n S_p_p.resize(statesToKeep, statesToKeep);\n S_m_p.resize(statesToKeep, statesToKeep);\n blockH_p=transformOperator(system.blockH, OT, OO);\n S_z_p=transformOperator(S_z, OT, OO);\n S_p_p=transformOperator(S_p, OT, OO);\n S_m_p=transformOperator(S_m, OT, OO);\n\n \/\/Hamiltonian for next iteration\n TSR.resize(statesToKeep,2,statesToKeep,2);\n TSR = blockH_p(i,k)*I2(j,l) + S_z_p(i,k)*sigma_z(j,l)+ \n 0.5*S_p_p(i,k)*sigma_m(j,l) + 0.5*S_m_p(i,k)*sigma_p(j,l) ;\n\n system.blockH.resize(2*statesToKeep,2*statesToKeep); \n system.blockH = reduceM2M2(TSR);\n\n\t\/\/redefine identity matrix\n\tint statesToKeepNext= (2*statesToKeep<=m)? 4*statesToKeep : 2*m;\n\tI2st.resize(statesToKeepNext, statesToKeepNext); \n\tI2st = createIdentityMatrix(statesToKeepNext);\n\n\t\/\/redefine the operators for next iteration\n\tS_z.resize(2*statesToKeep,2*statesToKeep); \n\tTSR = I2st(i,k)*sigma_z(j,l);\n\tS_z = reduceM2M2(TSR);\n\n\tS_p.resize(2*statesToKeep,2*statesToKeep);\n\tTSR = I2st(i,k)*sigma_p(j,l);\n\tS_p = reduceM2M2(TSR);\n\n\tS_m.resize(2*statesToKeep,2*statesToKeep);\n\tTSR = I2st(i,k)*sigma_m(j,l);\n\tS_m = reduceM2M2(TSR); \n\n\t\/\/ re-prepare superblock matrix, wavefunction and reduced DM\n\tHabcd.resize(2*statesToKeep,2*statesToKeep,2*statesToKeep,2*statesToKeep); \n\tPsi.resize(2*statesToKeep,2*statesToKeep); \n\treducedDM.resize(2*statesToKeep,2*statesToKeep);\n\n\t\/\/ make the system one site larger and save it\n system.size = ++sitesInSystem; \n system.ISAwrite(sitesInSystem);\n\n }\/\/end INFINITE SYSTEM ALGORITHM \n\n std::cout<<\"End of the infinite system algorithm\\n\";\n\n \/**\n * Finite size algorithm \n *\/\n {\n \/\/ find minimum size of the enviroment\n int minEnviromentSize=calculateMinEnviromentSize(m,numberOfSites);\n\n \/\/ start in the middle of the chain \n int sitesInSystem = numberOfSites\/2;\n system.FSAread(sitesInSystem,1);\n\n for (int halfSweep=0; halfSweep<numberOfHalfSweeps; halfSweep++)\n {\n while (sitesInSystem <= numberOfSites-minEnviromentSize)\n {\n int sitesInEnviroment = numberOfSites - sitesInSystem;\n\n \/\/ read the environment block from disk\n environ.FSAread(sitesInEnviroment,halfSweep);\n\n \/\/ build the hamiltonian as a four-index tensor\n Habcd = environ.blockH(i,k)*I2st(j,l)+\n\t\t I2st(i,k)*system.blockH(j,l)+\n S_z(i,k)*S_z(j,l)+\n 0.5*S_p(i,k)*S_m(j,l)+0.5*S_m(i,k)*S_p(j,l);\n\n \/\/ calculate the ground state energy \n double groundStateEnergy=calculateGroundState(Habcd, Psi);\n\n if (halfSweep%2 == 0) \n printGroundStateEnergy(sitesInSystem, sitesInEnviroment, \n groundStateEnergy);\n else \n printGroundStateEnergy(sitesInEnviroment, sitesInSystem, \n groundStateEnergy);\n\n \/\/ calculate the reduced density matrix and truncate \n reducedDM=calculateReducedDensityMatrix(Psi);\n\n blitz::Array<double,2> OO=truncateReducedDM(reducedDM, m); \n OT=OO.transpose(blitz::secondDim, blitz::firstDim);\n\n \/\/ transform the operators to new basis\n blockH_p=transformOperator(system.blockH, OT, OO);\n S_z_p=transformOperator(S_z, OT, OO);\n S_p_p=transformOperator(S_p, OT, OO);\n S_m_p=transformOperator(S_m, OT, OO);\n\n \/\/ add spin to the system block only\n TSR = blockH_p(i,k)*I2(j,l) + S_z_p(i,k)*sigma_z(j,l)+ \n 0.5*S_p_p(i,k)*sigma_m(j,l) + 0.5*S_m_p(i,k)*sigma_p(j,l); \n system.blockH = reduceM2M2(TSR);\n\n sitesInSystem++;\n\n system.size = sitesInSystem;\n system.FSAwrite(sitesInSystem,halfSweep);\n }\/\/ while\n\n sitesInSystem = minEnviromentSize;\n system.FSAread(sitesInSystem,halfSweep);\n\n }\/\/ for\n } \/\/ end of the finite size algorithm\n return 0;\n} \/\/ end main\n<|endoftext|>"} {"text":"<commit_before>\/* Copyright (C) 2005-2011 Fabio Riccardi *\/\n\n\/\/ standard\n#include <X11\/Xlib.h>\n#include <iostream>\n\n\/\/ local\n#include \"LC_JNIUtils.h\"\n#ifndef AUTO_DEP\n#include \"javah\/com_lightcrafts_platform_linux_LinuxKeyUtil.h\"\n#endif\n\nusing namespace std;\nusing namespace LightCrafts;\n\n\/\/\/\/\/\/\/\/\/\/ JNI \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n#define LinuxKeyUtil_METHOD(method) \\\n name4(Java_,com_lightcrafts_platform_linux_LinuxKeyUtil,_,method)\n\n\/**\n * Find the index of the first nonzero bit in the given char, where the least\n * significant bit has index zero. Used in keysToKeycode().\n *\/\nint indexOfBit(char c) {\n int n;\n for (n=0; n<8; n++) {\n if (c & 0x01) {\n return n;\n }\n c = c >> 1;\n }\n}\n\n\/**\n * Determine the KeyCode of the first pressed key in the 32-character keys\n * array returned from XQueryKeymap.\n *\/\nKeyCode keysToKeycode(char *keys) {\n int n;\n for (n=0; n<32; n++) {\n if (keys[n] != 0) {\n return 8 * n + indexOfBit(keys[n]);\n }\n }\n return 0;\n}\n\n\/**\n * The X11 Display reference is a global variable, initialized in the first\n * call to isKeyPressed().\n *\/\nDisplay *display = NULL;\n\n\/**\n * Detect whether the key corresponding to the given virtual key code is\n * currently pressed. (For ASCII characters, the virtual key code is just\n * the ASCII code.)\n *\/\nJNIEXPORT jboolean JNICALL LinuxKeyUtil_METHOD(isKeyPressed)\n ( JNIEnv *env, jclass, jint keyCode )\n{\n if (display == NULL) {\n display = XOpenDisplay(NULL);\n }\n if (display == NULL) {\n cerr << \"LinuxPlatform cannot connect to X server \"\n << XDisplayName(NULL)\n << endl;\n return false;\n }\n char keys[32];\n XQueryKeymap(display, keys);\n\n KeyCode code = keysToKeycode(keys);\n\n KeySym sym = XKeycodeToKeysym(display, code, 0);\n\n bool pressed = keyCode == sym;\n#ifdef DEBUG\n cout << \"keyCode \" << keyCode << \" is \";\n if ( ! pressed ) {\n cout << \"not \";\n }\n cout << \"pressed\" << endl;\n#endif\n return pressed;\n}\n\/* vim:set et sw=4 ts=4: *\/\n<commit_msg>Linux - Replace deprecated XKeycodeToKeysym with XkbKeycodeToKeysym<commit_after>\/* Copyright (C) 2005-2011 Fabio Riccardi *\/\n\n\/\/ standard\n#include <X11\/Xlib.h>\n#include <X11\/XKBlib.h>\n#include <iostream>\n\n\/\/ local\n#include \"LC_JNIUtils.h\"\n#ifndef AUTO_DEP\n#include \"javah\/com_lightcrafts_platform_linux_LinuxKeyUtil.h\"\n#endif\n\nusing namespace std;\nusing namespace LightCrafts;\n\n\/\/\/\/\/\/\/\/\/\/ JNI \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n#define LinuxKeyUtil_METHOD(method) \\\n name4(Java_,com_lightcrafts_platform_linux_LinuxKeyUtil,_,method)\n\n\/**\n * Find the index of the first nonzero bit in the given char, where the least\n * significant bit has index zero. Used in keysToKeycode().\n *\/\nint indexOfBit(char c) {\n int n;\n for (n=0; n<8; n++) {\n if (c & 0x01) {\n return n;\n }\n c = c >> 1;\n }\n}\n\n\/**\n * Determine the KeyCode of the first pressed key in the 32-character keys\n * array returned from XQueryKeymap.\n *\/\nKeyCode keysToKeycode(char *keys) {\n int n;\n for (n=0; n<32; n++) {\n if (keys[n] != 0) {\n return 8 * n + indexOfBit(keys[n]);\n }\n }\n return 0;\n}\n\n\/**\n * The X11 Display reference is a global variable, initialized in the first\n * call to isKeyPressed().\n *\/\nDisplay *display = NULL;\n\n\/**\n * Detect whether the key corresponding to the given virtual key code is\n * currently pressed. (For ASCII characters, the virtual key code is just\n * the ASCII code.)\n *\/\nJNIEXPORT jboolean JNICALL LinuxKeyUtil_METHOD(isKeyPressed)\n ( JNIEnv *env, jclass, jint keyCode )\n{\n if (display == NULL) {\n display = XOpenDisplay(NULL);\n }\n if (display == NULL) {\n cerr << \"LinuxPlatform cannot connect to X server \"\n << XDisplayName(NULL)\n << endl;\n return false;\n }\n char keys[32];\n XQueryKeymap(display, keys);\n\n KeyCode code = keysToKeycode(keys);\n\n KeySym sym = XkbKeycodeToKeysym(display, code, 0, 0);\n\n bool pressed = keyCode == sym;\n#ifdef DEBUG\n cout << \"keyCode \" << keyCode << \" is \";\n if ( ! pressed ) {\n cout << \"not \";\n }\n cout << \"pressed\" << endl;\n#endif\n return pressed;\n}\n\/* vim:set et sw=4 ts=4: *\/\n<|endoftext|>"} {"text":"<commit_before>#include <tesseract\/baseapi.h>\n#include <leptonica\/allheaders.h>\n#include <string>\n#include <libgen.h>\n\nint main(int argc, char *argv[]) {\n std::string input_filename = std::string(argv[1]);\n std::string input_basename = std::string(basename(argv[1]));\n Pix *image = pixRead(input_filename.c_str());\n tesseract::TessBaseAPI *api = new tesseract::TessBaseAPI();\n api->Init(NULL, \"eng\");\n api->SetImage(image);\n Boxa* boxes = api->GetComponentImages(tesseract::RIL_TEXTLINE, true, NULL, NULL);\n printf(\"Found %d textline image components.\\n\", boxes->n);\n for (int i = 0; i < boxes->n; i++) {\n BOX* box = boxaGetBox(boxes, i, L_CLONE);\n PIX* pixd= pixClipRectangle(image, box, NULL);\n int lastindex = input_basename.find_last_of(\".\");\n std::string basename = input_basename.substr(0, lastindex);\n std::string extension = input_basename.substr(lastindex + 1, 3);\n char* linefilename = (char*)malloc((basename.length()+strlen(\"-line_extract-00000.ext\")+1)*sizeof(char));\n sprintf(linefilename, \"%s-line_extract-%05d.%s\", basename.c_str(), i, extension.c_str());\n pixWrite(linefilename, pixd, IFF_DEFAULT);\n pixDestroy(&pixd);\n boxDestroy(&box);\n free(linefilename);\n }\n return 0;\n}\n<commit_msg>edited for changes to ocular<commit_after>#include <tesseract\/baseapi.h>\n#include <leptonica\/allheaders.h>\n#include <string>\n#include <libgen.h>\n\nint main(int argc, char *argv[]) {\n if(argc != 3) { printf(\"USAGE: %s imagefile outputdir\", argv[0]); }\n\n std::string input_filename = std::string(argv[1]);\n std::string input_basename = std::string(basename(argv[1]));\n\n std::string output_dir = std::string(argv[2]);\n\n Pix *image = pixRead(input_filename.c_str());\n tesseract::TessBaseAPI *api = new tesseract::TessBaseAPI();\n api->Init(NULL, \"eng\");\n api->SetImage(image);\n Boxa* boxes = api->GetComponentImages(tesseract::RIL_TEXTLINE, true, NULL, NULL);\n printf(\"Found %d textline image components.\\n\", boxes->n);\n\n int lastindex = input_basename.find_last_of(\".\");\n std::string basename = input_basename.substr(0, lastindex).c_str();\n std::string extension = input_basename.substr(lastindex + 1).c_str();\n std::string outdir = output_dir.c_str();\n int linedirLen = outdir.length()+1+basename.length()+strlen(\"-line_extract_\")+extension.length()+1;\n char* linedir = (char*)malloc(linedirLen*sizeof(char));\n sprintf(linedir, \"%s\/%s-line_extract_%s\", output_dir.c_str(), basename.c_str(), extension.c_str());\n printf(\"Writing to directory [%s]. If this fails, try:\\n mkdir -p %s\\n\\n\\n\", linedir, linedir);\n\n for (int i = 0; i < boxes->n; i++) {\n BOX* box = boxaGetBox(boxes, i, L_CLONE);\n PIX* pixd= pixClipRectangle(image, box, NULL);\n\n char* linefilename = (char*)malloc((linedirLen+strlen(\"\/line00.\")+extension.length()+1)*sizeof(char));\n sprintf(linefilename, \"%s\/line%02d.%s\", linedir, i, extension.c_str());\n printf(\" Writing %s\\n\", linefilename);\n pixWrite(linefilename, pixd, IFF_DEFAULT);\n pixDestroy(&pixd);\n boxDestroy(&box);\n free(linefilename);\n }\n return 0;\n}\n<|endoftext|>"} {"text":"<commit_before>\/\/===-- TCPSocket.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#if defined(_MSC_VER)\n#define _WINSOCK_DEPRECATED_NO_WARNINGS\n#endif\n\n#include \"lldb\/Host\/common\/TCPSocket.h\"\n\n#include \"lldb\/Host\/Config.h\"\n#include \"lldb\/Host\/MainLoop.h\"\n#include \"lldb\/Utility\/Log.h\"\n\n#include \"llvm\/Config\/config.h\"\n#include \"llvm\/Support\/raw_ostream.h\"\n\n#ifndef LLDB_DISABLE_POSIX\n#include <arpa\/inet.h>\n#include <netinet\/tcp.h>\n#include <sys\/socket.h>\n#endif\n\n#if defined(LLVM_ON_WIN32)\n#include <winsock2.h>\n#endif\n\n#ifdef LLVM_ON_WIN32\n#define CLOSE_SOCKET closesocket\n#else\n#define CLOSE_SOCKET ::close\n#endif\n\nusing namespace lldb;\nusing namespace lldb_private;\n\nnamespace {\nconst int kType = SOCK_STREAM;\n}\n\nTCPSocket::TCPSocket(bool should_close, bool child_processes_inherit)\n : Socket(ProtocolTcp, should_close, child_processes_inherit) {}\n\nTCPSocket::TCPSocket(NativeSocket socket, const TCPSocket &listen_socket)\n : Socket(ProtocolTcp, listen_socket.m_should_close_fd,\n listen_socket.m_child_processes_inherit) {\n m_socket = socket;\n}\n\nTCPSocket::TCPSocket(NativeSocket socket, bool should_close,\n bool child_processes_inherit)\n : Socket(ProtocolTcp, should_close, child_processes_inherit) {\n m_socket = socket;\n}\n\nTCPSocket::~TCPSocket() { CloseListenSockets(); }\n\nbool TCPSocket::IsValid() const {\n return m_socket != kInvalidSocketValue || m_listen_sockets.size() != 0;\n}\n\n\/\/ Return the port number that is being used by the socket.\nuint16_t TCPSocket::GetLocalPortNumber() const {\n if (m_socket != kInvalidSocketValue) {\n SocketAddress sock_addr;\n socklen_t sock_addr_len = sock_addr.GetMaxLength();\n if (::getsockname(m_socket, sock_addr, &sock_addr_len) == 0)\n return sock_addr.GetPort();\n } else if (!m_listen_sockets.empty()) {\n SocketAddress sock_addr;\n socklen_t sock_addr_len = sock_addr.GetMaxLength();\n if (::getsockname(m_listen_sockets.begin()->first, sock_addr,\n &sock_addr_len) == 0)\n return sock_addr.GetPort();\n }\n return 0;\n}\n\nstd::string TCPSocket::GetLocalIPAddress() const {\n \/\/ We bound to port zero, so we need to figure out which port we actually\n \/\/ bound to\n if (m_socket != kInvalidSocketValue) {\n SocketAddress sock_addr;\n socklen_t sock_addr_len = sock_addr.GetMaxLength();\n if (::getsockname(m_socket, sock_addr, &sock_addr_len) == 0)\n return sock_addr.GetIPAddress();\n }\n return \"\";\n}\n\nuint16_t TCPSocket::GetRemotePortNumber() const {\n if (m_socket != kInvalidSocketValue) {\n SocketAddress sock_addr;\n socklen_t sock_addr_len = sock_addr.GetMaxLength();\n if (::getpeername(m_socket, sock_addr, &sock_addr_len) == 0)\n return sock_addr.GetPort();\n }\n return 0;\n}\n\nstd::string TCPSocket::GetRemoteIPAddress() const {\n \/\/ We bound to port zero, so we need to figure out which port we actually\n \/\/ bound to\n if (m_socket != kInvalidSocketValue) {\n SocketAddress sock_addr;\n socklen_t sock_addr_len = sock_addr.GetMaxLength();\n if (::getpeername(m_socket, sock_addr, &sock_addr_len) == 0)\n return sock_addr.GetIPAddress();\n }\n return \"\";\n}\n\nError TCPSocket::CreateSocket(int domain) {\n Error error;\n if (IsValid())\n error = Close();\n if (error.Fail())\n return error;\n m_socket = Socket::CreateSocket(domain, kType, IPPROTO_TCP,\n m_child_processes_inherit, error);\n return error;\n}\n\nError TCPSocket::Connect(llvm::StringRef name) {\n\n Log *log(lldb_private::GetLogIfAnyCategoriesSet(LIBLLDB_LOG_COMMUNICATION));\n if (log)\n log->Printf(\"TCPSocket::%s (host\/port = %s)\", __FUNCTION__, name.data());\n\n Error error;\n std::string host_str;\n std::string port_str;\n int32_t port = INT32_MIN;\n if (!DecodeHostAndPort(name, host_str, port_str, port, &error))\n return error;\n\n auto addresses = lldb_private::SocketAddress::GetAddressInfo(\n host_str.c_str(), NULL, AF_UNSPEC, SOCK_STREAM, IPPROTO_TCP);\n for (auto address : addresses) {\n error = CreateSocket(address.GetFamily());\n if (error.Fail())\n continue;\n\n address.SetPort(port);\n\n if (-1 == ::connect(GetNativeSocket(), &address.sockaddr(),\n address.GetLength())) {\n CLOSE_SOCKET(GetNativeSocket());\n continue;\n }\n\n SetOptionNoDelay();\n\n error.Clear();\n return error;\n }\n\n error.SetErrorString(\"Failed to connect port\");\n return error;\n}\n\nError TCPSocket::Listen(llvm::StringRef name, int backlog) {\n Log *log(lldb_private::GetLogIfAnyCategoriesSet(LIBLLDB_LOG_CONNECTION));\n if (log)\n log->Printf(\"TCPSocket::%s (%s)\", __FUNCTION__, name.data());\n\n Error error;\n std::string host_str;\n std::string port_str;\n int32_t port = INT32_MIN;\n if (!DecodeHostAndPort(name, host_str, port_str, port, &error))\n return error;\n\n auto addresses = lldb_private::SocketAddress::GetAddressInfo(\n host_str.c_str(), NULL, AF_UNSPEC, SOCK_STREAM, IPPROTO_TCP);\n for (auto address : addresses) {\n int fd = Socket::CreateSocket(address.GetFamily(), kType, IPPROTO_TCP,\n m_child_processes_inherit, error);\n if (error.Fail()) {\n error.Clear();\n continue;\n }\n\n \/\/ enable local address reuse\n int option_value = 1;\n set_socket_option_arg_type option_value_p =\n reinterpret_cast<get_socket_option_arg_type>(&option_value);\n ::setsockopt(fd, SOL_SOCKET, SO_REUSEADDR, option_value_p,\n sizeof(option_value));\n\n address.SetPort(port);\n\n int err = ::bind(fd, &address.sockaddr(), address.GetLength());\n if (-1 != err)\n err = ::listen(fd, backlog);\n\n if (-1 == err) {\n CLOSE_SOCKET(fd);\n continue;\n }\n\n if (port == 0) {\n socklen_t sa_len = address.GetLength();\n if (getsockname(fd, &address.sockaddr(), &sa_len) == 0)\n port = address.GetPort();\n }\n m_listen_sockets[fd] = address;\n }\n\n if (m_listen_sockets.size() == 0)\n error.SetErrorString(\"Failed to connect port\");\n return error;\n}\n\nvoid TCPSocket::CloseListenSockets() {\n for (auto socket : m_listen_sockets)\n CLOSE_SOCKET(socket.first);\n m_listen_sockets.clear();\n}\n\nError TCPSocket::Accept(Socket *&conn_socket) {\n Error error;\n if (m_listen_sockets.size() == 0) {\n error.SetErrorString(\"No open listening sockets!\");\n return error;\n }\n\n int sock = -1;\n int listen_sock = -1;\n lldb_private::SocketAddress AcceptAddr;\n MainLoop accept_loop;\n std::vector<MainLoopBase::ReadHandleUP> handles;\n for (auto socket : m_listen_sockets) {\n auto fd = socket.first;\n auto inherit = this->m_child_processes_inherit;\n auto io_sp = IOObjectSP(new TCPSocket(socket.first, false, inherit));\n handles.emplace_back(accept_loop.RegisterReadObject(\n io_sp, [fd, inherit, &sock, &AcceptAddr, &error,\n &listen_sock](MainLoopBase &loop) {\n socklen_t sa_len = AcceptAddr.GetMaxLength();\n sock = AcceptSocket(fd, &AcceptAddr.sockaddr(), &sa_len, inherit,\n error);\n listen_sock = fd;\n loop.RequestTermination();\n }, error));\n if (error.Fail())\n return error;\n }\n\n bool accept_connection = false;\n std::unique_ptr<TCPSocket> accepted_socket;\n \/\/ Loop until we are happy with our connection\n while (!accept_connection) {\n accept_loop.Run();\n \n if (error.Fail())\n return error;\n\n lldb_private::SocketAddress &AddrIn = m_listen_sockets[listen_sock];\n if (!AddrIn.IsAnyAddr() && AcceptAddr != AddrIn) {\n CLOSE_SOCKET(sock);\n llvm::errs() << llvm::formatv(\n \"error: rejecting incoming connection from {0} (expecting {1})\",\n AcceptAddr.GetIPAddress(), AddrIn.GetIPAddress());\n continue;\n }\n accept_connection = true;\n accepted_socket.reset(new TCPSocket(sock, *this));\n }\n\n if (!accepted_socket)\n return error;\n\n \/\/ Keep our TCP packets coming without any delays.\n accepted_socket->SetOptionNoDelay();\n error.Clear();\n conn_socket = accepted_socket.release();\n return error;\n}\n\nint TCPSocket::SetOptionNoDelay() {\n return SetOption(IPPROTO_TCP, TCP_NODELAY, 1);\n}\n\nint TCPSocket::SetOptionReuseAddress() {\n return SetOption(SOL_SOCKET, SO_REUSEADDR, 1);\n}\n<commit_msg>One more attempt to fix the broken bots.<commit_after>\/\/===-- TCPSocket.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#if defined(_MSC_VER)\n#define _WINSOCK_DEPRECATED_NO_WARNINGS\n#endif\n\n#include \"lldb\/Host\/common\/TCPSocket.h\"\n\n#include \"lldb\/Host\/Config.h\"\n#include \"lldb\/Host\/MainLoop.h\"\n#include \"lldb\/Utility\/Log.h\"\n\n#include \"llvm\/Config\/config.h\"\n#include \"llvm\/Support\/raw_ostream.h\"\n\n#ifndef LLDB_DISABLE_POSIX\n#include <arpa\/inet.h>\n#include <netinet\/tcp.h>\n#include <sys\/socket.h>\n#endif\n\n#if defined(LLVM_ON_WIN32)\n#include <winsock2.h>\n#endif\n\n#ifdef LLVM_ON_WIN32\n#define CLOSE_SOCKET closesocket\ntypedef const char *set_socket_option_arg_type;\n#else\n#define CLOSE_SOCKET ::close\ntypedef const void *set_socket_option_arg_type;\n#endif\n\nusing namespace lldb;\nusing namespace lldb_private;\n\nnamespace {\nconst int kType = SOCK_STREAM;\n}\n\nTCPSocket::TCPSocket(bool should_close, bool child_processes_inherit)\n : Socket(ProtocolTcp, should_close, child_processes_inherit) {}\n\nTCPSocket::TCPSocket(NativeSocket socket, const TCPSocket &listen_socket)\n : Socket(ProtocolTcp, listen_socket.m_should_close_fd,\n listen_socket.m_child_processes_inherit) {\n m_socket = socket;\n}\n\nTCPSocket::TCPSocket(NativeSocket socket, bool should_close,\n bool child_processes_inherit)\n : Socket(ProtocolTcp, should_close, child_processes_inherit) {\n m_socket = socket;\n}\n\nTCPSocket::~TCPSocket() { CloseListenSockets(); }\n\nbool TCPSocket::IsValid() const {\n return m_socket != kInvalidSocketValue || m_listen_sockets.size() != 0;\n}\n\n\/\/ Return the port number that is being used by the socket.\nuint16_t TCPSocket::GetLocalPortNumber() const {\n if (m_socket != kInvalidSocketValue) {\n SocketAddress sock_addr;\n socklen_t sock_addr_len = sock_addr.GetMaxLength();\n if (::getsockname(m_socket, sock_addr, &sock_addr_len) == 0)\n return sock_addr.GetPort();\n } else if (!m_listen_sockets.empty()) {\n SocketAddress sock_addr;\n socklen_t sock_addr_len = sock_addr.GetMaxLength();\n if (::getsockname(m_listen_sockets.begin()->first, sock_addr,\n &sock_addr_len) == 0)\n return sock_addr.GetPort();\n }\n return 0;\n}\n\nstd::string TCPSocket::GetLocalIPAddress() const {\n \/\/ We bound to port zero, so we need to figure out which port we actually\n \/\/ bound to\n if (m_socket != kInvalidSocketValue) {\n SocketAddress sock_addr;\n socklen_t sock_addr_len = sock_addr.GetMaxLength();\n if (::getsockname(m_socket, sock_addr, &sock_addr_len) == 0)\n return sock_addr.GetIPAddress();\n }\n return \"\";\n}\n\nuint16_t TCPSocket::GetRemotePortNumber() const {\n if (m_socket != kInvalidSocketValue) {\n SocketAddress sock_addr;\n socklen_t sock_addr_len = sock_addr.GetMaxLength();\n if (::getpeername(m_socket, sock_addr, &sock_addr_len) == 0)\n return sock_addr.GetPort();\n }\n return 0;\n}\n\nstd::string TCPSocket::GetRemoteIPAddress() const {\n \/\/ We bound to port zero, so we need to figure out which port we actually\n \/\/ bound to\n if (m_socket != kInvalidSocketValue) {\n SocketAddress sock_addr;\n socklen_t sock_addr_len = sock_addr.GetMaxLength();\n if (::getpeername(m_socket, sock_addr, &sock_addr_len) == 0)\n return sock_addr.GetIPAddress();\n }\n return \"\";\n}\n\nError TCPSocket::CreateSocket(int domain) {\n Error error;\n if (IsValid())\n error = Close();\n if (error.Fail())\n return error;\n m_socket = Socket::CreateSocket(domain, kType, IPPROTO_TCP,\n m_child_processes_inherit, error);\n return error;\n}\n\nError TCPSocket::Connect(llvm::StringRef name) {\n\n Log *log(lldb_private::GetLogIfAnyCategoriesSet(LIBLLDB_LOG_COMMUNICATION));\n if (log)\n log->Printf(\"TCPSocket::%s (host\/port = %s)\", __FUNCTION__, name.data());\n\n Error error;\n std::string host_str;\n std::string port_str;\n int32_t port = INT32_MIN;\n if (!DecodeHostAndPort(name, host_str, port_str, port, &error))\n return error;\n\n auto addresses = lldb_private::SocketAddress::GetAddressInfo(\n host_str.c_str(), NULL, AF_UNSPEC, SOCK_STREAM, IPPROTO_TCP);\n for (auto address : addresses) {\n error = CreateSocket(address.GetFamily());\n if (error.Fail())\n continue;\n\n address.SetPort(port);\n\n if (-1 == ::connect(GetNativeSocket(), &address.sockaddr(),\n address.GetLength())) {\n CLOSE_SOCKET(GetNativeSocket());\n continue;\n }\n\n SetOptionNoDelay();\n\n error.Clear();\n return error;\n }\n\n error.SetErrorString(\"Failed to connect port\");\n return error;\n}\n\nError TCPSocket::Listen(llvm::StringRef name, int backlog) {\n Log *log(lldb_private::GetLogIfAnyCategoriesSet(LIBLLDB_LOG_CONNECTION));\n if (log)\n log->Printf(\"TCPSocket::%s (%s)\", __FUNCTION__, name.data());\n\n Error error;\n std::string host_str;\n std::string port_str;\n int32_t port = INT32_MIN;\n if (!DecodeHostAndPort(name, host_str, port_str, port, &error))\n return error;\n\n auto addresses = lldb_private::SocketAddress::GetAddressInfo(\n host_str.c_str(), NULL, AF_UNSPEC, SOCK_STREAM, IPPROTO_TCP);\n for (auto address : addresses) {\n int fd = Socket::CreateSocket(address.GetFamily(), kType, IPPROTO_TCP,\n m_child_processes_inherit, error);\n if (error.Fail()) {\n error.Clear();\n continue;\n }\n\n \/\/ enable local address reuse\n int option_value = 1;\n set_socket_option_arg_type option_value_p =\n reinterpret_cast<get_socket_option_arg_type>(&option_value);\n ::setsockopt(fd, SOL_SOCKET, SO_REUSEADDR, option_value_p,\n sizeof(option_value));\n\n address.SetPort(port);\n\n int err = ::bind(fd, &address.sockaddr(), address.GetLength());\n if (-1 != err)\n err = ::listen(fd, backlog);\n\n if (-1 == err) {\n CLOSE_SOCKET(fd);\n continue;\n }\n\n if (port == 0) {\n socklen_t sa_len = address.GetLength();\n if (getsockname(fd, &address.sockaddr(), &sa_len) == 0)\n port = address.GetPort();\n }\n m_listen_sockets[fd] = address;\n }\n\n if (m_listen_sockets.size() == 0)\n error.SetErrorString(\"Failed to connect port\");\n return error;\n}\n\nvoid TCPSocket::CloseListenSockets() {\n for (auto socket : m_listen_sockets)\n CLOSE_SOCKET(socket.first);\n m_listen_sockets.clear();\n}\n\nError TCPSocket::Accept(Socket *&conn_socket) {\n Error error;\n if (m_listen_sockets.size() == 0) {\n error.SetErrorString(\"No open listening sockets!\");\n return error;\n }\n\n int sock = -1;\n int listen_sock = -1;\n lldb_private::SocketAddress AcceptAddr;\n MainLoop accept_loop;\n std::vector<MainLoopBase::ReadHandleUP> handles;\n for (auto socket : m_listen_sockets) {\n auto fd = socket.first;\n auto inherit = this->m_child_processes_inherit;\n auto io_sp = IOObjectSP(new TCPSocket(socket.first, false, inherit));\n handles.emplace_back(accept_loop.RegisterReadObject(\n io_sp, [fd, inherit, &sock, &AcceptAddr, &error,\n &listen_sock](MainLoopBase &loop) {\n socklen_t sa_len = AcceptAddr.GetMaxLength();\n sock = AcceptSocket(fd, &AcceptAddr.sockaddr(), &sa_len, inherit,\n error);\n listen_sock = fd;\n loop.RequestTermination();\n }, error));\n if (error.Fail())\n return error;\n }\n\n bool accept_connection = false;\n std::unique_ptr<TCPSocket> accepted_socket;\n \/\/ Loop until we are happy with our connection\n while (!accept_connection) {\n accept_loop.Run();\n \n if (error.Fail())\n return error;\n\n lldb_private::SocketAddress &AddrIn = m_listen_sockets[listen_sock];\n if (!AddrIn.IsAnyAddr() && AcceptAddr != AddrIn) {\n CLOSE_SOCKET(sock);\n llvm::errs() << llvm::formatv(\n \"error: rejecting incoming connection from {0} (expecting {1})\",\n AcceptAddr.GetIPAddress(), AddrIn.GetIPAddress());\n continue;\n }\n accept_connection = true;\n accepted_socket.reset(new TCPSocket(sock, *this));\n }\n\n if (!accepted_socket)\n return error;\n\n \/\/ Keep our TCP packets coming without any delays.\n accepted_socket->SetOptionNoDelay();\n error.Clear();\n conn_socket = accepted_socket.release();\n return error;\n}\n\nint TCPSocket::SetOptionNoDelay() {\n return SetOption(IPPROTO_TCP, TCP_NODELAY, 1);\n}\n\nint TCPSocket::SetOptionReuseAddress() {\n return SetOption(SOL_SOCKET, SO_REUSEADDR, 1);\n}\n<|endoftext|>"} {"text":"<commit_before>#include <iostream>\n#include <fstream>\n#include <cmath>\n#include <string>\n\nusing std::cout;\nusing std::cerr;\nusing std::endl;\nusing std::string;\n\nbool checkParameters(int argc, char* argv[]);\n\nconst string REPLACEMENT_ALGORITHMS[3] = {\"lru\", \"clock\", \"fifo\"},\n PAGING_METHODS[2] = {\"d\", \"p\"};\nconst int NUM_REPLACEMENT_ALGORITHMS = 3, NUM_PAGING_METHODS = 2;\nint main(int argc, char* argv[])\n{\n std::ifstream programListIn, programTraceIn;\n std::ofstream fileOut;\n int pageSize;\n string replacementAlgorithm, pagingMethod;\n\n if(checkParameters(argc, argv))\n {\n \/\/Everything is cool\n\n }\n\n return 0;\n}\n\nbool checkParameters(int argc, char* argv[])\n{\n std::ifstream programListIn, programTraceIn;\n std::ofstream fileOut;\n bool pageSizeGood = false, replacementAlgorithmGood = false, pagingMethodGood = false;\n int pageSize;\n string replacementAlgorithm, pagingMethod;\n\n \/\/Valid number of arguments, but some may not make sense\n if(argc == 6)\n {\n \/\/Check to see if programList exists\n programListIn.open(argv[1]);\n\n if(programListIn)\n {\n \/\/File1 exists\n\n\n \/\/Check to see if file2 exists\n programTraceIn.open(argv[2]);\n\n if(programTraceIn)\n {\n \/\/File2 exists\n try\n {\n pageSize = std::stoi(argv[3]);\n\n \/\/Page Size is numeric, but is it 1,2,4,8,16?\n for(int i = 0; i < 5; i++)\n {\n if(pageSize == std::pow(2, i))\n {\n \/\/It is\n pageSizeGood = true;\n break;\n }\n }\n\n if(pageSizeGood)\n {\n \/\/Page size is good\n\n \/\/Check replacement algorithm\n replacementAlgorithm = argv[4];\n\n for(int i = 0; i < NUM_REPLACEMENT_ALGORITHMS; i++)\n {\n if(replacementAlgorithm == REPLACEMENT_ALGORITHMS[i])\n {\n \/\/Replacement algorithm is valid\n replacementAlgorithmGood = true;\n break;\n }\n }\n\n if(replacementAlgorithmGood)\n {\n \/\/Replacement algorithm is valid\n\n \/\/Check paging method\n pagingMethod = argv[5];\n\n for(int i = 0; i < NUM_PAGING_METHODS; i++)\n {\n if(pagingMethod == PAGING_METHODS[i])\n {\n pagingMethodGood = true;\n break;\n }\n }\n\n if(pagingMethodGood)\n {\n \/\/Paging Method is valid\n\n \/\/All Options are valid\n return true;\n }\n else\n {\n \/\/Paging Method is invalid\n cerr << \"Error: Paging Method \" << pagingMethod << \" is invalid.\" << endl;\n }\n }\n else\n {\n \/\/It's not\n cerr << \"Error: Page Replacement Algorithm \" << replacementAlgorithm << \" is invalid.\" << endl;\n }\n\n }\n else\n {\n \/\/Page size isn't good\n cerr << \"Error: \" << pageSize << \" is not a power of two.\" << endl;\n }\n\n\n }\n catch(std::invalid_argument e)\n {\n \/\/Third argument is not an integer\n cerr << \"Error: \" << pageSize << \" is not a numeric type.\" << endl;\n }\n }\n else\n {\n \/\/It doesn't\n cerr << \"Error: File \" << argv[2] << \".txt does not exist. Please provide a valid filename\" << endl;\n }\n }\n else\n {\n \/\/It doesn't\n cerr << \"Error: File \" << argv[1] << \".txt does not exist. Please provide a valid filename\" << endl;\n }\n }\n else\n {\n \/\/Invalid number of parameters\n cerr << \"Error: Invalid number of parameters provided. Please provide exactly 5 arguments.\" << endl;\n }\n\n cerr << endl;\n cerr << \"Usage \" << argv[0] << \" programListFile programTraceFile numPages replacementAlgorithm pagingMethod\" << endl;\n cerr << endl;\n cerr << \"programListFile: The file containing the program list\" << endl;\n cerr << \"programTraceFile: The file containing the program trace\" << endl;\n cerr << \"numPages: The number of pages. Must be in the set {1,2,4,8,16}\" << endl;\n cerr << \"replacementAlgorithm: The replacement algorithm to use. Must be in the set {lru, fifo, clock}\" << endl;\n cerr << \"pagingMethod: The paging method to use. Must be in the set {p(Prepaging), d(Demand Paging)}\" << endl;\n\n return false;\n}<commit_msg>Initialized pertinent parameters<commit_after>#include <iostream>\n#include <fstream>\n#include <cmath>\n#include <string>\n\nusing std::cout;\nusing std::cerr;\nusing std::endl;\nusing std::string;\nusing std::stoi;\n\nbool checkParameters(int argc, char* argv[]);\n\nconst string REPLACEMENT_ALGORITHMS[3] = {\"lru\", \"clock\", \"fifo\"},\n PAGING_METHODS[2] = {\"d\", \"p\"};\nconst int NUM_REPLACEMENT_ALGORITHMS = 3, NUM_PAGING_METHODS = 2;\nint main(int argc, char* argv[])\n{\n std::ifstream programListIn, programTraceIn;\n std::ofstream fileOut;\n int pageSize;\n string replacementAlgorithm, pagingMethod;\n\n if(checkParameters(argc, argv))\n {\n \/\/Everything is cool\n programListIn.open(argv[1]);\n programTraceIn.open(argv[2]);\n pageSize = stoi(argv[3]);\n replacementAlgorithm = argv[4];\n pagingMethod = argv[5];\n\n \/\/We're ready to roll\n }\n\n return 0;\n}\n\nbool checkParameters(int argc, char* argv[])\n{\n std::ifstream programListIn, programTraceIn;\n std::ofstream fileOut;\n bool pageSizeGood = false, replacementAlgorithmGood = false, pagingMethodGood = false;\n int pageSize;\n string replacementAlgorithm, pagingMethod;\n\n \/\/Valid number of arguments, but some may not make sense\n if(argc == 6)\n {\n \/\/Check to see if programList exists\n programListIn.open(argv[1]);\n\n if(programListIn)\n {\n \/\/File1 exists\n\n\n \/\/Check to see if file2 exists\n programTraceIn.open(argv[2]);\n\n if(programTraceIn)\n {\n \/\/File2 exists\n try\n {\n pageSize = std::stoi(argv[3]);\n\n \/\/Page Size is numeric, but is it 1,2,4,8,16?\n for(int i = 0; i < 5; i++)\n {\n if(pageSize == std::pow(2, i))\n {\n \/\/It is\n pageSizeGood = true;\n break;\n }\n }\n\n if(pageSizeGood)\n {\n \/\/Page size is good\n\n \/\/Check replacement algorithm\n replacementAlgorithm = argv[4];\n\n for(int i = 0; i < NUM_REPLACEMENT_ALGORITHMS; i++)\n {\n if(replacementAlgorithm == REPLACEMENT_ALGORITHMS[i])\n {\n \/\/Replacement algorithm is valid\n replacementAlgorithmGood = true;\n break;\n }\n }\n\n if(replacementAlgorithmGood)\n {\n \/\/Replacement algorithm is valid\n\n \/\/Check paging method\n pagingMethod = argv[5];\n\n for(int i = 0; i < NUM_PAGING_METHODS; i++)\n {\n if(pagingMethod == PAGING_METHODS[i])\n {\n pagingMethodGood = true;\n break;\n }\n }\n\n if(pagingMethodGood)\n {\n \/\/Paging Method is valid\n\n \/\/All Options are valid\n return true;\n }\n else\n {\n \/\/Paging Method is invalid\n cerr << \"Error: Paging Method \" << pagingMethod << \" is invalid.\" << endl;\n }\n }\n else\n {\n \/\/It's not\n cerr << \"Error: Page Replacement Algorithm \" << replacementAlgorithm << \" is invalid.\" << endl;\n }\n\n }\n else\n {\n \/\/Page size isn't good\n cerr << \"Error: \" << pageSize << \" is not a power of two.\" << endl;\n }\n\n\n }\n catch(std::invalid_argument e)\n {\n \/\/Third argument is not an integer\n cerr << \"Error: \" << pageSize << \" is not a numeric type.\" << endl;\n }\n }\n else\n {\n \/\/It doesn't\n cerr << \"Error: File \" << argv[2] << \".txt does not exist. Please provide a valid filename\" << endl;\n }\n }\n else\n {\n \/\/It doesn't\n cerr << \"Error: File \" << argv[1] << \".txt does not exist. Please provide a valid filename\" << endl;\n }\n }\n else\n {\n \/\/Invalid number of parameters\n cerr << \"Error: Invalid number of parameters provided. Please provide exactly 5 arguments.\" << endl;\n }\n\n cerr << endl;\n cerr << \"Usage \" << argv[0] << \" programListFile programTraceFile numPages replacementAlgorithm pagingMethod\" << endl;\n cerr << endl;\n cerr << \"programListFile: The file containing the program list\" << endl;\n cerr << \"programTraceFile: The file containing the program trace\" << endl;\n cerr << \"numPages: The number of pages. Must be in the set {1,2,4,8,16}\" << endl;\n cerr << \"replacementAlgorithm: The replacement algorithm to use. Must be in the set {lru, fifo, clock}\" << endl;\n cerr << \"pagingMethod: The paging method to use. Must be in the set {p(Prepaging), d(Demand Paging)}\" << endl;\n\n return false;\n}<|endoftext|>"} {"text":"<commit_before>\/\/ ---------------------------------------------------------------------\n\/\/\n\/\/ Copyright (C) 2005 - 2014 by the deal.II authors\n\/\/\n\/\/ This file is part of the deal.II library.\n\/\/\n\/\/ The deal.II library is free software; you can use it, redistribute\n\/\/ it, and\/or modify it under the terms of the GNU Lesser General\n\/\/ Public License as published by the Free Software Foundation; either\n\/\/ version 2.1 of the License, or (at your option) any later version.\n\/\/ The full text of the license can be found in the file LICENSE at\n\/\/ the top level of the deal.II distribution.\n\/\/\n\/\/ ---------------------------------------------------------------------\n\n\n#include <deal.II\/lac\/tridiagonal_matrix.h>\n#include <deal.II\/lac\/vector.h>\n#include <deal.II\/lac\/lapack_templates.h>\n\nDEAL_II_NAMESPACE_OPEN\n\nusing namespace LAPACKSupport;\n\ntemplate <typename number>\nTridiagonalMatrix<number>::TridiagonalMatrix(\n size_type size,\n bool symmetric)\n :\n diagonal(size, 0.),\n left((symmetric ? 0 : size), 0.),\n right(size, 0.),\n is_symmetric(symmetric),\n state(matrix)\n{}\n\n\ntemplate <typename number>\nvoid\nTridiagonalMatrix<number>::reinit(\n size_type size,\n bool symmetric)\n{\n is_symmetric = symmetric;\n diagonal.resize(size);\n right.resize(size);\n left.resize(symmetric ? 0 : size);\n state = matrix;\n}\n\n\ntemplate <typename number>\nbool\nTridiagonalMatrix<number>::all_zero() const\n{\n Assert(state == matrix, ExcState(state));\n\n typename std::vector<number>::const_iterator i;\n typename std::vector<number>::const_iterator e;\n\n e = diagonal.end();\n for (i=diagonal.begin() ; i != e ; ++i)\n if (*i != 0.) return false;\n\n e = left.end();\n for (i=left.begin() ; i != e ; ++i)\n if (*i != 0.) return false;\n\n e = right.end();\n for (i=right.begin() ; i != e ; ++i)\n if (*i != 0.) return false;\n return true;\n}\n\n\ntemplate <typename number>\nvoid\nTridiagonalMatrix<number>::vmult (\n Vector<number> &w,\n const Vector<number> &v,\n const bool adding) const\n{\n Assert(state == matrix, ExcState(state));\n\n Assert(w.size() == n(), ExcDimensionMismatch(w.size(), n()));\n Assert(v.size() == n(), ExcDimensionMismatch(v.size(), n()));\n\n if (n()==0) return;\n\n \/\/ The actual loop skips the first\n \/\/ and last row\n const size_type e=n()-1;\n \/\/ Let iterators point to the first\n \/\/ entry of each diagonal\n typename std::vector<number>::const_iterator d = diagonal.begin();\n typename std::vector<number>::const_iterator r = right.begin();\n \/\/ The left diagonal starts one\n \/\/ later or is equal to the right\n \/\/ one for symmetric storage\n typename std::vector<number>::const_iterator l = left.begin();\n if (is_symmetric)\n l = r;\n else\n ++l;\n\n if (adding)\n {\n \/\/ Treat first row separately\n w(0) += (*d) * v(0) + (*r) * v(1);\n ++d;\n ++r;\n \/\/ All rows with three entries\n for (size_type i=1; i<e; ++i,++d,++r,++l)\n w(i) += (*l) * v(i-1) + (*d) * v(i) + (*r) * v(i+1);\n \/\/ Last row is special again\n w(e) += (*l) * v(e-1) + (*d) * v(e);\n }\n else\n {\n w(0) = (*d) * v(0) + (*r) * v(1);\n ++d;\n ++r;\n for (size_type i=1; i<e; ++i,++d,++r,++l)\n w(i) = (*l) * v(i-1) + (*d) * v(i) + (*r) * v(i+1);\n w(e) = (*l) * v(e-1) + (*d) * v(e);\n }\n}\n\n\ntemplate <typename number>\nvoid\nTridiagonalMatrix<number>::vmult_add (\n Vector<number> &w,\n const Vector<number> &v) const\n{\n vmult(w, v, true);\n}\n\n\ntemplate <typename number>\nvoid\nTridiagonalMatrix<number>::Tvmult (\n Vector<number> &w,\n const Vector<number> &v,\n const bool adding) const\n{\n Assert(state == matrix, ExcState(state));\n\n Assert(w.size() == n(), ExcDimensionMismatch(w.size(), n()));\n Assert(v.size() == n(), ExcDimensionMismatch(v.size(), n()));\n\n if (n()==0) return;\n\n const size_type e=n()-1;\n typename std::vector<number>::const_iterator d = diagonal.begin();\n typename std::vector<number>::const_iterator r = right.begin();\n typename std::vector<number>::const_iterator l = left.begin();\n if (is_symmetric)\n l = r;\n else\n ++l;\n\n if (adding)\n {\n w(0) += (*d) * v(0) + (*l) * v(1);\n ++d;\n ++l;\n for (size_type i=1; i<e; ++i,++d,++r,++l)\n w(i) += (*l) * v(i+1) + (*d) * v(i) + (*r) * v(i-1);\n w(e) += (*d) * v(e) + (*r) * v(e-1);\n }\n else\n {\n w(0) = (*d) * v(0) + (*l) * v(1);\n ++d;\n ++l;\n for (size_type i=1; i<e; ++i,++d,++r,++l)\n w(i) = (*l) * v(i+1) + (*d) * v(i) + (*r) * v(i-1);\n w(e) = (*d) * v(e) + (*r) * v(e-1);\n }\n}\n\n\ntemplate <typename number>\nvoid\nTridiagonalMatrix<number>::Tvmult_add (\n Vector<number> &w,\n const Vector<number> &v) const\n{\n Tvmult(w, v, true);\n}\n\n\ntemplate <typename number>\nnumber\nTridiagonalMatrix<number>::matrix_scalar_product(\n const Vector<number> &w,\n const Vector<number> &v) const\n{\n Assert(state == matrix, ExcState(state));\n\n const size_type e=n()-1;\n typename std::vector<number>::const_iterator d = diagonal.begin();\n typename std::vector<number>::const_iterator r = right.begin();\n typename std::vector<number>::const_iterator l = left.begin();\n if (is_symmetric)\n l = r;\n else\n ++l;\n\n number result = w(0) * ((*d) * v(0) + (*r) * v(1));\n ++d;\n ++r;\n for (size_type i=1; i<e; ++i,++d,++r,++l)\n result += w(i) * ((*l) * v(i-1)+ (*d) * v(i)+ (*r) * v(i+1));\n result += w(e) * ((*l) * v(e-1) + (*d) * v(e));\n return result;\n}\n\n\ntemplate <typename number>\nnumber\nTridiagonalMatrix<number>::matrix_norm_square(\n const Vector<number> &v) const\n{\n return matrix_scalar_product(v,v);\n}\n\n\ntemplate <>\nvoid\nTridiagonalMatrix<double>::compute_eigenvalues()\n{\n#ifdef DEAL_II_WITH_LAPACK\n Assert(state == matrix, ExcState(state));\n Assert(is_symmetric, ExcNotImplemented());\n\n const int nn = n();\n int info;\n stev (&N, &nn, &*diagonal.begin(), &*right.begin(), nullptr, &one, nullptr, &info);\n Assert(info == 0, ExcInternalError());\n\n state = LAPACKSupport::eigenvalues;\n#else\n Assert(false, ExcNeedsLAPACK());\n#endif\n}\n\n\ntemplate <typename number>\nnumber\nTridiagonalMatrix<number>::eigenvalue(const size_type i) const\n{\n Assert(state == LAPACKSupport::eigenvalues, ExcState(state));\n Assert(i<n(), ExcIndexRange(i,0,n()));\n return diagonal[i];\n}\n\n\n\/*\ntemplate <typename number>\nTridiagonalMatrix<number>::\n{\n}\n\n\n*\/\n\ntemplate class TridiagonalMatrix<float>;\ntemplate class TridiagonalMatrix<double>;\n\nDEAL_II_NAMESPACE_CLOSE\n<commit_msg>Fix undefined behavior in TridiagonalMatrix<commit_after>\/\/ ---------------------------------------------------------------------\n\/\/\n\/\/ Copyright (C) 2005 - 2014 by the deal.II authors\n\/\/\n\/\/ This file is part of the deal.II library.\n\/\/\n\/\/ The deal.II library is free software; you can use it, redistribute\n\/\/ it, and\/or modify it under the terms of the GNU Lesser General\n\/\/ Public License as published by the Free Software Foundation; either\n\/\/ version 2.1 of the License, or (at your option) any later version.\n\/\/ The full text of the license can be found in the file LICENSE at\n\/\/ the top level of the deal.II distribution.\n\/\/\n\/\/ ---------------------------------------------------------------------\n\n\n#include <deal.II\/lac\/tridiagonal_matrix.h>\n#include <deal.II\/lac\/vector.h>\n#include <deal.II\/lac\/lapack_templates.h>\n\nDEAL_II_NAMESPACE_OPEN\n\nusing namespace LAPACKSupport;\n\ntemplate <typename number>\nTridiagonalMatrix<number>::TridiagonalMatrix(\n size_type size,\n bool symmetric)\n :\n diagonal(size, 0.),\n left((symmetric ? 0 : size), 0.),\n right(size, 0.),\n is_symmetric(symmetric),\n state(matrix)\n{}\n\n\ntemplate <typename number>\nvoid\nTridiagonalMatrix<number>::reinit(\n size_type size,\n bool symmetric)\n{\n is_symmetric = symmetric;\n diagonal.resize(size);\n right.resize(size);\n left.resize(symmetric ? 0 : size);\n state = matrix;\n}\n\n\ntemplate <typename number>\nbool\nTridiagonalMatrix<number>::all_zero() const\n{\n Assert(state == matrix, ExcState(state));\n\n typename std::vector<number>::const_iterator i;\n typename std::vector<number>::const_iterator e;\n\n e = diagonal.end();\n for (i=diagonal.begin() ; i != e ; ++i)\n if (*i != 0.) return false;\n\n e = left.end();\n for (i=left.begin() ; i != e ; ++i)\n if (*i != 0.) return false;\n\n e = right.end();\n for (i=right.begin() ; i != e ; ++i)\n if (*i != 0.) return false;\n return true;\n}\n\n\ntemplate <typename number>\nvoid\nTridiagonalMatrix<number>::vmult (\n Vector<number> &w,\n const Vector<number> &v,\n const bool adding) const\n{\n Assert(state == matrix, ExcState(state));\n\n Assert(w.size() == n(), ExcDimensionMismatch(w.size(), n()));\n Assert(v.size() == n(), ExcDimensionMismatch(v.size(), n()));\n\n if (n()==0) return;\n\n \/\/ The actual loop skips the first\n \/\/ and last row\n const size_type e=n()-1;\n \/\/ Let iterators point to the first\n \/\/ entry of each diagonal\n typename std::vector<number>::const_iterator d = diagonal.begin();\n typename std::vector<number>::const_iterator r = right.begin();\n \/\/ The left diagonal starts one\n \/\/ later or is equal to the right\n \/\/ one for symmetric storage\n typename std::vector<number>::const_iterator l = left.begin();\n if (is_symmetric)\n l = r;\n else\n ++l;\n\n if (adding)\n {\n \/\/ Treat first row separately\n w(0) += (*d) * v(0) + (*r) * v(1);\n ++d;\n ++r;\n \/\/ All rows with three entries\n for (size_type i=1; i<e; ++i,++d,++r,++l)\n w(i) += (*l) * v(i-1) + (*d) * v(i) + (*r) * v(i+1);\n \/\/ Last row is special again\n w(e) += (*l) * v(e-1) + (*d) * v(e);\n }\n else\n {\n w(0) = (*d) * v(0) + (*r) * v(1);\n ++d;\n ++r;\n for (size_type i=1; i<e; ++i,++d,++r,++l)\n w(i) = (*l) * v(i-1) + (*d) * v(i) + (*r) * v(i+1);\n w(e) = (*l) * v(e-1) + (*d) * v(e);\n }\n}\n\n\ntemplate <typename number>\nvoid\nTridiagonalMatrix<number>::vmult_add (\n Vector<number> &w,\n const Vector<number> &v) const\n{\n vmult(w, v, true);\n}\n\n\ntemplate <typename number>\nvoid\nTridiagonalMatrix<number>::Tvmult (\n Vector<number> &w,\n const Vector<number> &v,\n const bool adding) const\n{\n Assert(state == matrix, ExcState(state));\n\n Assert(w.size() == n(), ExcDimensionMismatch(w.size(), n()));\n Assert(v.size() == n(), ExcDimensionMismatch(v.size(), n()));\n\n if (n()==0) return;\n\n const size_type e=n()-1;\n typename std::vector<number>::const_iterator d = diagonal.begin();\n typename std::vector<number>::const_iterator r = right.begin();\n typename std::vector<number>::const_iterator l = left.begin();\n if (is_symmetric)\n l = r;\n else\n ++l;\n\n if (adding)\n {\n w(0) += (*d) * v(0) + (*l) * v(1);\n ++d;\n ++l;\n for (size_type i=1; i<e; ++i,++d,++r,++l)\n w(i) += (*l) * v(i+1) + (*d) * v(i) + (*r) * v(i-1);\n w(e) += (*d) * v(e) + (*r) * v(e-1);\n }\n else\n {\n w(0) = (*d) * v(0) + (*l) * v(1);\n ++d;\n ++l;\n for (size_type i=1; i<e; ++i,++d,++r,++l)\n w(i) = (*l) * v(i+1) + (*d) * v(i) + (*r) * v(i-1);\n w(e) = (*d) * v(e) + (*r) * v(e-1);\n }\n}\n\n\ntemplate <typename number>\nvoid\nTridiagonalMatrix<number>::Tvmult_add (\n Vector<number> &w,\n const Vector<number> &v) const\n{\n Tvmult(w, v, true);\n}\n\n\ntemplate <typename number>\nnumber\nTridiagonalMatrix<number>::matrix_scalar_product(\n const Vector<number> &w,\n const Vector<number> &v) const\n{\n Assert(state == matrix, ExcState(state));\n\n const size_type e=n()-1;\n typename std::vector<number>::const_iterator d = diagonal.begin();\n typename std::vector<number>::const_iterator r = right.begin();\n typename std::vector<number>::const_iterator l = left.begin();\n if (is_symmetric)\n l = r;\n else\n ++l;\n\n number result = w(0) * ((*d) * v(0) + (*r) * v(1));\n ++d;\n ++r;\n for (size_type i=1; i<e; ++i,++d,++r,++l)\n result += w(i) * ((*l) * v(i-1)+ (*d) * v(i)+ (*r) * v(i+1));\n result += w(e) * ((*l) * v(e-1) + (*d) * v(e));\n return result;\n}\n\n\ntemplate <typename number>\nnumber\nTridiagonalMatrix<number>::matrix_norm_square(\n const Vector<number> &v) const\n{\n return matrix_scalar_product(v,v);\n}\n\n\ntemplate <>\nvoid\nTridiagonalMatrix<double>::compute_eigenvalues()\n{\n#ifdef DEAL_II_WITH_LAPACK\n Assert(state == matrix, ExcState(state));\n Assert(is_symmetric, ExcNotImplemented());\n\n const int nn = n();\n int info;\n stev (&N, &nn, diagonal.data(), right.data(), nullptr, &one, nullptr, &info);\n Assert(info == 0, ExcInternalError());\n\n state = LAPACKSupport::eigenvalues;\n#else\n Assert(false, ExcNeedsLAPACK());\n#endif\n}\n\n\ntemplate <typename number>\nnumber\nTridiagonalMatrix<number>::eigenvalue(const size_type i) const\n{\n Assert(state == LAPACKSupport::eigenvalues, ExcState(state));\n Assert(i<n(), ExcIndexRange(i,0,n()));\n return diagonal[i];\n}\n\n\n\/*\ntemplate <typename number>\nTridiagonalMatrix<number>::\n{\n}\n\n\n*\/\n\ntemplate class TridiagonalMatrix<float>;\ntemplate class TridiagonalMatrix<double>;\n\nDEAL_II_NAMESPACE_CLOSE\n<|endoftext|>"} {"text":"<commit_before>\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ This file is part of Grappa, a system for scaling irregular\n\/\/ applications on commodity clusters. \n\n\/\/ Copyright (C) 2010-2014 University of Washington and Battelle\n\/\/ Memorial Institute. University of Washington authorizes use of this\n\/\/ Grappa software.\n\n\/\/ Grappa is free software: you can redistribute it and\/or modify it\n\/\/ under the terms of the Affero General Public License as published\n\/\/ by Affero, Inc., either version 1 of the License, or (at your\n\/\/ option) any later version.\n\n\/\/ Grappa 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\/\/ Affero General Public License for more details.\n\n\/\/ You should have received a copy of the Affero General Public\n\/\/ License along with this program. If not, you may obtain one from\n\/\/ http:\/\/www.affero.org\/oagpl.html.\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n\/\/\/ useful utilities\n\n#ifndef __COMMON_HPP__\n#define __COMMON_HPP__\n\n#include <stdint.h>\n#include <iostream>\n#include <glog\/logging.h>\n#include <memory>\n#include <algorithm>\n\nusing std::unique_ptr;\n\n\/\/\/ Construct unique_ptr more easily. (to be included in C++1y)\n\/\/\/ \n\/\/\/ ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~\n\/\/\/ auto m = make_unique<MyClass>(a,5);\n\/\/\/ \/\/ equivalent to:\n\/\/\/ auto m = std::unique_ptr<MyClass>(new MyClass(a,5));\n\/\/\/ ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~\ntemplate<typename T, typename... Args>\nstd::unique_ptr<T> make_unique(Args&&... args) {\n return std::unique_ptr<T>(new T(std::forward<Args>(args)...));\n}\n\n#include <cstddef>\nusing std::nullptr_t;\n\n#if defined(__MTA__)\n#include <sys\/mta_task.h>\n#include <machine\/runtime.h>\n#elif defined(__MACH__)\n#include <mach\/mach_time.h>\n#else\n#include <time.h>\n#endif\n\n#define BILLION 1000000000\n#define MILLION 1000000\n\n\/\/\/ Use to deprecate old APIs\n#define GRAPPA_DEPRECATED __attribute__((deprecated))\n\nnamespace Grappa {\n \n \/\/\/ Specify whether tasks are bound to the core they're spawned on, or if they can be load-balanced (via work-stealing).\n enum class TaskMode { Bound \/*default*\/, Unbound };\n \n \/\/\/ Specify whether an operation blocks until complete, or returns \"immediately\".\n enum class SyncMode { Blocking \/*default*\/, Async };\n \n \n\/\/\/ \"Universal\" wallclock time (works at least for Mac, MTA, and most Linux)\ninline double walltime(void) {\n#if defined(__MTA__)\n\treturn((double)mta_get_clock(0) \/ mta_clock_freq());\n#elif defined(__MACH__)\n\tstatic mach_timebase_info_data_t info;\n\tmach_timebase_info(&info);\n\tuint64_t now = mach_absolute_time();\n\tnow *= info.numer;\n\tnow \/= info.denom;\n\treturn 1.0e-9 * (double)now;\n#else\n\tstruct timespec tp;\n#if defined(CLOCK_PROCESS_CPUTIME_ID)\n#define CLKID CLOCK_PROCESS_CPUTIME_ID\n#elif defined(CLOCK_REALTIME_ID)\n#define CLKID CLOCK_REALTIME_ID\n#endif\n\tclock_gettime(CLOCK_MONOTONIC, &tp);\n\treturn (double)tp.tv_sec + (double)tp.tv_nsec \/ BILLION;\n#endif\n}\n\n} \/\/ namespace Grappa\n\n #define GRAPPA_TIME(var, block) \\\n do { \\\n double _tmptime = Grappa::walltime(); \\\n block \\\n var = Grappa::walltime()-_tmptime; \\\n } while(0)\n\n#define GRAPPA_TIMER(var) \\\n for (double _tmpstart = Grappa::walltime(), _tmptime = -1; \\\n _tmptime < 0; \\\n var = _tmptime = Grappa::walltime() - _tmpstart)\n\n#define GRAPPA_TIME_LOG(name) \\\n for (double _tmpstart = Grappa::walltime(), _tmptime = -1; _tmptime < 0; \\\n LOG(INFO) << name << \": \" << (Grappa::walltime()-_tmpstart), _tmptime = 1)\n\n#define GRAPPA_TIME_REGION(var) \\\n for (double _tmpstart = Grappa::walltime(), _tmptime = -1; _tmptime < 0; \\\n var += (Grappa::walltime()-_tmpstart), _tmptime = 1)\n\n\/\/\/ Compute ratio of doubles, returning 0 when divisor is 0\ntemplate< typename T, typename U >\nstatic inline double nanless_double_ratio( T x, U y ) {\n return y == 0 ? 0.0 : static_cast<double>(x) \/ static_cast<double>(y);\n}\n\n\/\/\/ Disable copy constructor and assignment operator.\n\/\/\/ Put this in your class' private declarations.\n\/\/\/ (from google public C++ coding standards)\n#define DISALLOW_COPY_AND_ASSIGN( Name )\t\\\n Name( const Name & );\t\t\t\t\\\n void operator=( const Name & )\n\n\/\/\/ Sign extension.\n\/\/\/ From Stanford bit-twiddling hacks.\ntemplate <typename T, unsigned B>\ninline T signextend(const T x)\n{\n struct {T x:B;} s;\n return s.x = x;\n}\n\n\/\/\/ Base 2 log of 32-bit number.\n\/\/\/ Modified from Stanford bit twiddling hacks.\ninline unsigned int log2( unsigned int v ) {\n unsigned int r; \/\/ result of log2(v) will go here\n unsigned int shift;\n\n r = (v > 0xFFFF) << 4; v >>= r;\n shift = (v > 0xFF ) << 3; v >>= shift; r |= shift;\n shift = (v > 0xF ) << 2; v >>= shift; r |= shift;\n shift = (v > 0x3 ) << 1; v >>= shift; r |= shift;\n r |= (v >> 1);\n\n return r;\n}\n\n\/\/\/ Read 64-bit timestamp counter.\n#define rdtscll(val) do {\t\t\t\t\t\\\n unsigned int __a,__d;\t\t\t\t\t\\\n asm volatile(\"rdtsc\" : \"=a\" (__a), \"=d\" (__d));\t\t\\\n (val) = ((unsigned long)__a) | (((unsigned long)__d)<<32);\t\\\n } while(0)\n\n\/\/\/ Read 64-bit timestamp counter.\nstatic inline unsigned long long rdtsc() {\n unsigned long long val;\n rdtscll(val);\n return val;\n}\n\n\/\/\/ OMGWTFBBQ Grappa magic identity function\n\/\/\/ Use this to get a pointer to a template function inside a template function, etc.\ntemplate< typename T >\nT * Grappa_magic_identity_function(T * t) {\n return t;\n}\n\n\/\/\/ range for block distribution\nstruct range_t { int64_t start, end; };\n\ninline std::ostream& operator<<(std::ostream& o, const range_t& r) {\n o << \"<\" << r.start << \",\" << r.end << \">\";\n return o;\n}\n\ninline range_t blockDist(int64_t start, int64_t end, int64_t rank, int64_t numBlocks) {\n\tint64_t numElems = end-start;\n\tint64_t each = numElems \/ numBlocks;\n int64_t remain = numElems % numBlocks;\n\tint64_t mynum = (rank < remain) ? each+1 : each;\n\tint64_t mystart = start + ((rank < remain) ? (each+1)*rank : (each+1)*remain + (rank-remain)*each);\n\trange_t r = { mystart, mystart+mynum };\n return r;\n}\n\nstruct block_offset_t { int64_t block, offset; };\n\ninline block_offset_t indexToBlock(int64_t index, int64_t numElements, int64_t numBlocks) {\n block_offset_t result;\n\tint64_t each = numElements \/ numBlocks,\n remain = numElements % numBlocks;\n\tif (index < (each+1)*remain) {\n\t\tresult = { index \/ (each+1), index % (each+1) };\n\t} else {\n\t\tindex -= (each+1)*remain;\n\t\tresult = { remain + index\/each, index % each };\n\t}\n \/\/ VLOG(1) << \"result.block = \" << result.block << \", remain = \" << remain << \", index = \" << index << \", each = \" << each;\n return result;\n}\n\n#define GET_TYPE(member) BOOST_PP_TUPLE_ELEM(2,0,member)\n\n#define GET_NAME(member) BOOST_PP_TUPLE_ELEM(2,1,member)\n\n#define CAT_EACH(r, data, elem) BOOST_PP_CAT(elem, data)\n\n#define AUTO_CONSTRUCTOR_DETAIL_PARAM(r, data, member) \\\nGET_TYPE(member) GET_NAME(member) \n\n#define DECL_W_TYPE(r, data, member) \\\nGET_TYPE(member) GET_NAME(member);\n\n#define AUTO_CONSTRUCTOR_DETAIL_INIT(r, data, member) \\\nGET_NAME(member) ( GET_NAME(member) )\n\n#define AUTO_CONSTRUCTOR_DETAIL(className, members) \\\nclassName(BOOST_PP_SEQ_ENUM(BOOST_PP_SEQ_TRANSFORM( \\\nAUTO_CONSTRUCTOR_DETAIL_PARAM, BOOST_PP_EMPTY, members))) : \\\nBOOST_PP_SEQ_ENUM(BOOST_PP_SEQ_TRANSFORM( \\\nAUTO_CONSTRUCTOR_DETAIL_INIT, BOOST_PP_EMPTY, members)) \\\n{} \n\n#define AUTO_CONSTRUCTOR(className, members) \\\nAUTO_CONSTRUCTOR_DETAIL(className, members)\n\n#define AUTO_DECLS(members) \\\nBOOST_PP_SEQ_FOR_EACH(CAT_EACH, ,BOOST_PP_SEQ_TRANSFORM(DECL_W_TYPE, BOOST_PP_EMPTY, members))\n\nstruct Functor {\n void operator()();\n};\n\n#define FUNCTOR(name, members) \\\nstruct name : public Functor { \\\nAUTO_DECLS(members) \\\nAUTO_CONSTRUCTOR( name, members ) \\\nname() {} \/* default constructor *\/\\\ninline void operator()() const; \\\n}; \\\ninline void name::operator()() const\n\n\n\/\/ fast pseudo-random number generator 0 to 32768\n\/\/ http:\/\/software.intel.com\/en-us\/articles\/fast-random-number-generator-on-the-intel-pentiumr-4-processor\/\nstatic unsigned int g_seed;\ninline void fast_srand( int seed ) {\n g_seed = seed;\n}\ninline int fast_rand() {\n g_seed = (214013*g_seed+2531011);\n return (g_seed>>16)&0x7FFF;\n}\n\n\n\nnamespace Grappa {\n \n \/\/\/ @addtogroup Utility\n \/\/\/ @{\n \n \/\/\/ Get string containing name of type.\n template< typename T >\n const char * typename_of( ) { \n \/\/ how big is the name of the type of this function?\n static const int size = sizeof(__PRETTY_FUNCTION__);\n \n \/\/ make a modifiable copy that's that big\n static char fn_name[ size ] = { '\\0' };\n \n \/\/ copy the name into the modifiable copy\n static const char * strcpy_retval = strncpy( fn_name, __PRETTY_FUNCTION__, size );\n \n \/\/ find the start of the type name\n static const char with[] = \"[with T = \";\n static const char * name = strstr( fn_name, with ) + sizeof( with ) - 1;\n \n \/\/ erase the bracket at the end of the string\n static const char erase_bracket = fn_name[size-2] = '\\0';\n \n \/\/ whew. return the string we built.\n return name;\n }\n \n \/\/\/ Get string containing name of type\n template< typename T >\n const char * typename_of( const T& unused ) { \n return typename_of<T>();\n }\n\n namespace impl {\n \/\/ A small helper for Google logging CHECK_NULL().\n template <typename T>\n inline T* CheckNull(const char *file, int line, const char *names, T* t) {\n if (t != NULL) {\n google::LogMessageFatal(file, line, new std::string(names));\n }\n return t;\n }\n }\n\n#define CHECK_NULL(val) \\\n Grappa::impl::CheckNull(__FILE__, __LINE__, \"'\" #val \"' Must be non NULL\", (val))\n\n#ifdef NDEBUG\n#define DCHECK_NULL(val) \\\n Grappa::impl::CheckNull(__FILE__, __LINE__, \"'\" #val \"' Must be non NULL\", (val))\n#else\n#define DCHECK_NULL(val) \\\n ;\n#endif \n\n\n#define MPI_CHECK( mpi_call ) \\\n do { \\\n int retval; \\\n if( (retval = (mpi_call)) != 0 ) { \\\n char error_string[MPI_MAX_ERROR_STRING]; \\\n int length; \\\n MPI_Error_string( retval, error_string, &length); \\\n LOG(FATAL) << \"MPI call failed: \" #mpi_call \": \" \\\n << error_string; \\\n } \\\n } while(0)\n\n \/\/\/ @}\n\n}\n\n#endif\n<commit_msg>add 'min_element' helpers<commit_after>\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ This file is part of Grappa, a system for scaling irregular\n\/\/ applications on commodity clusters. \n\n\/\/ Copyright (C) 2010-2014 University of Washington and Battelle\n\/\/ Memorial Institute. University of Washington authorizes use of this\n\/\/ Grappa software.\n\n\/\/ Grappa is free software: you can redistribute it and\/or modify it\n\/\/ under the terms of the Affero General Public License as published\n\/\/ by Affero, Inc., either version 1 of the License, or (at your\n\/\/ option) any later version.\n\n\/\/ Grappa 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\/\/ Affero General Public License for more details.\n\n\/\/ You should have received a copy of the Affero General Public\n\/\/ License along with this program. If not, you may obtain one from\n\/\/ http:\/\/www.affero.org\/oagpl.html.\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n\/\/\/ useful utilities\n\n#ifndef __COMMON_HPP__\n#define __COMMON_HPP__\n\n#include <stdint.h>\n#include <iostream>\n#include <glog\/logging.h>\n#include <memory>\n#include <algorithm>\n\nusing std::unique_ptr;\n\n\/\/\/ Construct unique_ptr more easily. (to be included in C++1y)\n\/\/\/ \n\/\/\/ ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~\n\/\/\/ auto m = make_unique<MyClass>(a,5);\n\/\/\/ \/\/ equivalent to:\n\/\/\/ auto m = std::unique_ptr<MyClass>(new MyClass(a,5));\n\/\/\/ ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~\ntemplate<typename T, typename... Args>\nstd::unique_ptr<T> make_unique(Args&&... args) {\n return std::unique_ptr<T>(new T(std::forward<Args>(args)...));\n}\n\n#include <cstddef>\nusing std::nullptr_t;\n\n#if defined(__MTA__)\n#include <sys\/mta_task.h>\n#include <machine\/runtime.h>\n#elif defined(__MACH__)\n#include <mach\/mach_time.h>\n#else\n#include <time.h>\n#endif\n\n#define BILLION 1000000000\n#define MILLION 1000000\n\n\/\/\/ Use to deprecate old APIs\n#define GRAPPA_DEPRECATED __attribute__((deprecated))\n\nnamespace Grappa {\n \n \/\/\/ Specify whether tasks are bound to the core they're spawned on, or if they can be load-balanced (via work-stealing).\n enum class TaskMode { Bound \/*default*\/, Unbound };\n \n \/\/\/ Specify whether an operation blocks until complete, or returns \"immediately\".\n enum class SyncMode { Blocking \/*default*\/, Async };\n \n \n\/\/\/ \"Universal\" wallclock time (works at least for Mac, MTA, and most Linux)\ninline double walltime(void) {\n#if defined(__MTA__)\n\treturn((double)mta_get_clock(0) \/ mta_clock_freq());\n#elif defined(__MACH__)\n\tstatic mach_timebase_info_data_t info;\n\tmach_timebase_info(&info);\n\tuint64_t now = mach_absolute_time();\n\tnow *= info.numer;\n\tnow \/= info.denom;\n\treturn 1.0e-9 * (double)now;\n#else\n\tstruct timespec tp;\n#if defined(CLOCK_PROCESS_CPUTIME_ID)\n#define CLKID CLOCK_PROCESS_CPUTIME_ID\n#elif defined(CLOCK_REALTIME_ID)\n#define CLKID CLOCK_REALTIME_ID\n#endif\n\tclock_gettime(CLOCK_MONOTONIC, &tp);\n\treturn (double)tp.tv_sec + (double)tp.tv_nsec \/ BILLION;\n#endif\n}\n\n} \/\/ namespace Grappa\n\n #define GRAPPA_TIME(var, block) \\\n do { \\\n double _tmptime = Grappa::walltime(); \\\n block \\\n var = Grappa::walltime()-_tmptime; \\\n } while(0)\n\n#define GRAPPA_TIMER(var) \\\n for (double _tmpstart = Grappa::walltime(), _tmptime = -1; \\\n _tmptime < 0; \\\n var = _tmptime = Grappa::walltime() - _tmpstart)\n\n#define GRAPPA_TIME_LOG(name) \\\n for (double _tmpstart = Grappa::walltime(), _tmptime = -1; _tmptime < 0; \\\n LOG(INFO) << name << \": \" << (Grappa::walltime()-_tmpstart), _tmptime = 1)\n\n#define GRAPPA_TIME_REGION(var) \\\n for (double _tmpstart = Grappa::walltime(), _tmptime = -1; _tmptime < 0; \\\n var += (Grappa::walltime()-_tmpstart), _tmptime = 1)\n\n\/\/\/ Compute ratio of doubles, returning 0 when divisor is 0\ntemplate< typename T, typename U >\nstatic inline double nanless_double_ratio( T x, U y ) {\n return y == 0 ? 0.0 : static_cast<double>(x) \/ static_cast<double>(y);\n}\n\n\/\/\/ Disable copy constructor and assignment operator.\n\/\/\/ Put this in your class' private declarations.\n\/\/\/ (from google public C++ coding standards)\n#define DISALLOW_COPY_AND_ASSIGN( Name )\t\\\n Name( const Name & );\t\t\t\t\\\n void operator=( const Name & )\n\n\/\/\/ Sign extension.\n\/\/\/ From Stanford bit-twiddling hacks.\ntemplate <typename T, unsigned B>\ninline T signextend(const T x)\n{\n struct {T x:B;} s;\n return s.x = x;\n}\n\n\/\/\/ Base 2 log of 32-bit number.\n\/\/\/ Modified from Stanford bit twiddling hacks.\ninline unsigned int log2( unsigned int v ) {\n unsigned int r; \/\/ result of log2(v) will go here\n unsigned int shift;\n\n r = (v > 0xFFFF) << 4; v >>= r;\n shift = (v > 0xFF ) << 3; v >>= shift; r |= shift;\n shift = (v > 0xF ) << 2; v >>= shift; r |= shift;\n shift = (v > 0x3 ) << 1; v >>= shift; r |= shift;\n r |= (v >> 1);\n\n return r;\n}\n\n\/\/\/ Read 64-bit timestamp counter.\n#define rdtscll(val) do {\t\t\t\t\t\\\n unsigned int __a,__d;\t\t\t\t\t\\\n asm volatile(\"rdtsc\" : \"=a\" (__a), \"=d\" (__d));\t\t\\\n (val) = ((unsigned long)__a) | (((unsigned long)__d)<<32);\t\\\n } while(0)\n\n\/\/\/ Read 64-bit timestamp counter.\nstatic inline unsigned long long rdtsc() {\n unsigned long long val;\n rdtscll(val);\n return val;\n}\n\n\/\/\/ OMGWTFBBQ Grappa magic identity function\n\/\/\/ Use this to get a pointer to a template function inside a template function, etc.\ntemplate< typename T >\nT * Grappa_magic_identity_function(T * t) {\n return t;\n}\n\n\/\/\/ Helper for invoking 'std::min_element' on containers.\ntemplate< typename Container, typename Comparator >\nauto min_element(const Container& c, Comparator cmp) -> decltype(*c.begin()) {\n return *std::min_element(c.begin(), c.end(), cmp);\n}\n\n\/\/\/ Helper for invoking 'std::min_element' on containers.\ntemplate< typename Container, typename Comparator >\nauto min_element(const Container& c0, const Container& c1, Comparator cmp) -> decltype(*c0.begin()) {\n auto m0 = min_element(c0, cmp);\n auto m1 = min_element(c1, cmp);\n return cmp(m0,m1) ? m0 : m1;\n}\n\n\/\/\/ Range type that represents the values `[start,end)`.\n\/\/\/ Only valid for types that define `<`, `==`, and `++`.\ntemplate< typename T >\nstruct Range { T start, end; };\n\n\/\/\/ Helper for invoking 'std::min_element' on a Range.\ntemplate< typename T, typename Comparator >\nT min_element(Range<T> r, Comparator cmp) {\n T best = r.start;\n for (T e = r.start; e < r.end; e++) {\n if (cmp(e,best)) {\n best = e;\n }\n }\n return best;\n}\n\n\/\/\/ range for block distribution\nusing range_t = Range<int64_t>;\n\n\ninline std::ostream& operator<<(std::ostream& o, const range_t& r) {\n o << \"<\" << r.start << \",\" << r.end << \">\";\n return o;\n}\n\ninline range_t blockDist(int64_t start, int64_t end, int64_t rank, int64_t numBlocks) {\n\tint64_t numElems = end-start;\n\tint64_t each = numElems \/ numBlocks;\n int64_t remain = numElems % numBlocks;\n\tint64_t mynum = (rank < remain) ? each+1 : each;\n\tint64_t mystart = start + ((rank < remain) ? (each+1)*rank : (each+1)*remain + (rank-remain)*each);\n\trange_t r = { mystart, mystart+mynum };\n return r;\n}\n\nstruct block_offset_t { int64_t block, offset; };\n\ninline block_offset_t indexToBlock(int64_t index, int64_t numElements, int64_t numBlocks) {\n block_offset_t result;\n\tint64_t each = numElements \/ numBlocks,\n remain = numElements % numBlocks;\n\tif (index < (each+1)*remain) {\n\t\tresult = { index \/ (each+1), index % (each+1) };\n\t} else {\n\t\tindex -= (each+1)*remain;\n\t\tresult = { remain + index\/each, index % each };\n\t}\n \/\/ VLOG(1) << \"result.block = \" << result.block << \", remain = \" << remain << \", index = \" << index << \", each = \" << each;\n return result;\n}\n\n#define GET_TYPE(member) BOOST_PP_TUPLE_ELEM(2,0,member)\n\n#define GET_NAME(member) BOOST_PP_TUPLE_ELEM(2,1,member)\n\n#define CAT_EACH(r, data, elem) BOOST_PP_CAT(elem, data)\n\n#define AUTO_CONSTRUCTOR_DETAIL_PARAM(r, data, member) \\\nGET_TYPE(member) GET_NAME(member) \n\n#define DECL_W_TYPE(r, data, member) \\\nGET_TYPE(member) GET_NAME(member);\n\n#define AUTO_CONSTRUCTOR_DETAIL_INIT(r, data, member) \\\nGET_NAME(member) ( GET_NAME(member) )\n\n#define AUTO_CONSTRUCTOR_DETAIL(className, members) \\\nclassName(BOOST_PP_SEQ_ENUM(BOOST_PP_SEQ_TRANSFORM( \\\nAUTO_CONSTRUCTOR_DETAIL_PARAM, BOOST_PP_EMPTY, members))) : \\\nBOOST_PP_SEQ_ENUM(BOOST_PP_SEQ_TRANSFORM( \\\nAUTO_CONSTRUCTOR_DETAIL_INIT, BOOST_PP_EMPTY, members)) \\\n{} \n\n#define AUTO_CONSTRUCTOR(className, members) \\\nAUTO_CONSTRUCTOR_DETAIL(className, members)\n\n#define AUTO_DECLS(members) \\\nBOOST_PP_SEQ_FOR_EACH(CAT_EACH, ,BOOST_PP_SEQ_TRANSFORM(DECL_W_TYPE, BOOST_PP_EMPTY, members))\n\nstruct Functor {\n void operator()();\n};\n\n#define FUNCTOR(name, members) \\\nstruct name : public Functor { \\\nAUTO_DECLS(members) \\\nAUTO_CONSTRUCTOR( name, members ) \\\nname() {} \/* default constructor *\/\\\ninline void operator()() const; \\\n}; \\\ninline void name::operator()() const\n\n\n\/\/ fast pseudo-random number generator 0 to 32768\n\/\/ http:\/\/software.intel.com\/en-us\/articles\/fast-random-number-generator-on-the-intel-pentiumr-4-processor\/\nstatic unsigned int g_seed;\ninline void fast_srand( int seed ) {\n g_seed = seed;\n}\ninline int fast_rand() {\n g_seed = (214013*g_seed+2531011);\n return (g_seed>>16)&0x7FFF;\n}\n\n\n\nnamespace Grappa {\n \n \/\/\/ @addtogroup Utility\n \/\/\/ @{\n \n \/\/\/ Get string containing name of type.\n template< typename T >\n const char * typename_of( ) { \n \/\/ how big is the name of the type of this function?\n static const int size = sizeof(__PRETTY_FUNCTION__);\n \n \/\/ make a modifiable copy that's that big\n static char fn_name[ size ] = { '\\0' };\n \n \/\/ copy the name into the modifiable copy\n static const char * strcpy_retval = strncpy( fn_name, __PRETTY_FUNCTION__, size );\n \n \/\/ find the start of the type name\n static const char with[] = \"[with T = \";\n static const char * name = strstr( fn_name, with ) + sizeof( with ) - 1;\n \n \/\/ erase the bracket at the end of the string\n static const char erase_bracket = fn_name[size-2] = '\\0';\n \n \/\/ whew. return the string we built.\n return name;\n }\n \n \/\/\/ Get string containing name of type\n template< typename T >\n const char * typename_of( const T& unused ) { \n return typename_of<T>();\n }\n\n namespace impl {\n \/\/ A small helper for Google logging CHECK_NULL().\n template <typename T>\n inline T* CheckNull(const char *file, int line, const char *names, T* t) {\n if (t != NULL) {\n google::LogMessageFatal(file, line, new std::string(names));\n }\n return t;\n }\n }\n\n#define CHECK_NULL(val) \\\n Grappa::impl::CheckNull(__FILE__, __LINE__, \"'\" #val \"' Must be non NULL\", (val))\n\n#ifdef NDEBUG\n#define DCHECK_NULL(val) \\\n Grappa::impl::CheckNull(__FILE__, __LINE__, \"'\" #val \"' Must be non NULL\", (val))\n#else\n#define DCHECK_NULL(val) \\\n ;\n#endif \n\n\n#define MPI_CHECK( mpi_call ) \\\n do { \\\n int retval; \\\n if( (retval = (mpi_call)) != 0 ) { \\\n char error_string[MPI_MAX_ERROR_STRING]; \\\n int length; \\\n MPI_Error_string( retval, error_string, &length); \\\n LOG(FATAL) << \"MPI call failed: \" #mpi_call \": \" \\\n << error_string; \\\n } \\\n } while(0)\n\n \/\/\/ @}\n\n}\n\n#endif\n<|endoftext|>"} {"text":"<commit_before><commit_msg>ruler: translate or clear comments in ruler.cxx<commit_after><|endoftext|>"} {"text":"<commit_before><commit_msg>WaE: implicit conversion of literal of type 'int' to 'bool'<commit_after><|endoftext|>"} {"text":"<commit_before><commit_msg>tdf#91840: Default to transparent text background<commit_after><|endoftext|>"} {"text":"<commit_before><commit_msg>fix picture jumping to incorrect X position after dragging<commit_after><|endoftext|>"} {"text":"<commit_before><commit_msg>rendercontext: Don't direct paint the SHOW_IDLE when double-buffering.<commit_after><|endoftext|>"} {"text":"<commit_before>\/*\n** Copyright 2011-2015 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 <cstdlib>\n#include <QMutexLocker>\n#include <QWaitCondition>\n#include \"com\/centreon\/broker\/exceptions\/msg.hh\"\n#include \"com\/centreon\/broker\/io\/events.hh\"\n#include \"com\/centreon\/broker\/io\/exceptions\/shutdown.hh\"\n#include \"com\/centreon\/broker\/io\/raw.hh\"\n#include \"com\/centreon\/broker\/logging\/logging.hh\"\n#include \"com\/centreon\/broker\/tcp\/stream.hh\"\n\nusing namespace com::centreon::broker;\nusing namespace com::centreon::broker::tcp;\n\n\/**************************************\n* *\n* Public Methods *\n* *\n**************************************\/\n\n\/**\n * Constructor.\n *\n * @param[in] sock Socket used by this stream.\n *\/\nstream::stream(misc::shared_ptr<QTcpSocket> sock)\n : _mutex(new QMutex),\n _read_timeout(-1),\n _socket(sock),\n _write_timeout(-1) {}\n\n\/**\n * Constructor.\n *\n * @param[in] sock Socket used by this stream.\n * @param[in] mutex Mutex used by this stream.\n *\/\nstream::stream(\n misc::shared_ptr<QTcpSocket> sock,\n misc::shared_ptr<QMutex> mutex)\n : _mutex(mutex),\n _read_timeout(-1),\n _socket(sock),\n _write_timeout(-1) {}\n\n\/**\n * Destructor.\n *\/\nstream::~stream() {\n QMutexLocker lock(&*_mutex);\n if (!_socket.isNull())\n _socket->close();\n}\n\n\/**\n * Read data with timeout.\n *\n * @param[out] d Received event if any.\n * @param[in] deadline Timeout in seconds.\n *\n * @return Respects io::stream::read()'s return value.\n *\/\nbool stream::read(\n misc::shared_ptr<io::data>& d,\n time_t deadline) {\n d.clear();\n QMutexLocker lock(&*_mutex);\n\n \/\/ If data is already available, skip the waitForReadyRead() loop.\n if (_socket->bytesAvailable() <= 0) {\n while (1) {\n if ((deadline != (time_t)-1)\n && (time(NULL) >= deadline)) {\n return (false);\n }\n bool ret;\n if (!(ret = _socket->waitForReadyRead(200))\n \/\/ Disconnected socket with no data.\n && (_socket->state()\n == QAbstractSocket::UnconnectedState)\n && (_socket->bytesAvailable() <= 0))\n throw (exceptions::msg() << \"TCP stream is disconnected\");\n if (ret\n || (_socket->error() != QAbstractSocket::SocketTimeoutError)\n || (_socket->bytesAvailable() > 0))\n break ;\n else {\n QWaitCondition cv;\n cv.wait(&*_mutex, 1);\n }\n }\n }\n\n char buffer[2048];\n qint64 rb(_socket->read(buffer, sizeof(buffer)));\n if (rb < 0)\n throw (exceptions::msg() << \"TCP: error while reading: \"\n << _socket->errorString());\n misc::shared_ptr<io::raw> data(new io::raw);\n#if QT_VERSION >= 0x040500\n data->append(buffer, rb);\n#else\n data->append(QByteArray(buffer, rb));\n#endif \/\/ Qt version\n d = data;\n return (true);\n}\n\n\/**\n * Set read timeout.\n *\n * @param[in] secs Timeout in seconds.\n *\/\nvoid stream::set_read_timeout(int secs) {\n _read_timeout = secs;\n return ;\n}\n\n\/**\n * Set write timeout.\n *\n * @param[in] secs Write timeout in seconds.\n *\/\nvoid stream::set_write_timeout(int secs) {\n _write_timeout = secs;\n return ;\n}\n\n\/**\n * Write data to the socket.\n *\n * @param[in] d Data to write.\n *\n * @return Number of events acknowledged.\n *\/\nunsigned int stream::write(misc::shared_ptr<io::data> const& d) {\n \/\/ Check that data exists and should be processed.\n if (d.isNull())\n return (1);\n\n if (d->type() == io::raw::static_type()) {\n misc::shared_ptr<io::raw> r(d.staticCast<io::raw>());\n logging::debug(logging::low) << \"TCP: write request of \"\n << r->size() << \" bytes\";\n QMutexLocker lock(&*_mutex);\n qint64 wb(_socket->write(static_cast<char*>(r->QByteArray::data()),\n r->size()));\n if ((wb < 0) || (_socket->state() == QAbstractSocket::UnconnectedState))\n throw (exceptions::msg() << \"TCP: error while writing: \"\n << _socket->errorString());\n if (_socket->waitForBytesWritten(_write_timeout * 1000) == false)\n throw (exceptions::msg() << \"TCP: error while sending data: \"\n << _socket->errorString());\n }\n return (1);\n}\n<commit_msg>TCP: fix stream read method.<commit_after>\/*\n** Copyright 2011-2015 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 <cstdlib>\n#include <QMutexLocker>\n#include <QWaitCondition>\n#include \"com\/centreon\/broker\/exceptions\/msg.hh\"\n#include \"com\/centreon\/broker\/io\/events.hh\"\n#include \"com\/centreon\/broker\/io\/exceptions\/shutdown.hh\"\n#include \"com\/centreon\/broker\/io\/raw.hh\"\n#include \"com\/centreon\/broker\/logging\/logging.hh\"\n#include \"com\/centreon\/broker\/tcp\/stream.hh\"\n\nusing namespace com::centreon::broker;\nusing namespace com::centreon::broker::tcp;\n\n\/**************************************\n* *\n* Public Methods *\n* *\n**************************************\/\n\n\/**\n * Constructor.\n *\n * @param[in] sock Socket used by this stream.\n *\/\nstream::stream(misc::shared_ptr<QTcpSocket> sock)\n : _mutex(new QMutex),\n _read_timeout(-1),\n _socket(sock),\n _write_timeout(-1) {}\n\n\/**\n * Constructor.\n *\n * @param[in] sock Socket used by this stream.\n * @param[in] mutex Mutex used by this stream.\n *\/\nstream::stream(\n misc::shared_ptr<QTcpSocket> sock,\n misc::shared_ptr<QMutex> mutex)\n : _mutex(mutex),\n _read_timeout(-1),\n _socket(sock),\n _write_timeout(-1) {}\n\n\/**\n * Destructor.\n *\/\nstream::~stream() {\n QMutexLocker lock(&*_mutex);\n if (!_socket.isNull())\n _socket->close();\n}\n\n\/**\n * Read data with timeout.\n *\n * @param[out] d Received event if any.\n * @param[in] deadline Timeout in seconds.\n *\n * @return Respects io::stream::read()'s return value.\n *\/\nbool stream::read(\n misc::shared_ptr<io::data>& d,\n time_t deadline) {\n d.clear();\n QMutexLocker lock(&*_mutex);\n\n \/\/ If data is already available, skip the waitForReadyRead() loop.\n if (_socket->bytesAvailable() <= 0) {\n bool ret(_socket->waitForReadyRead(0));\n while (_socket->bytesAvailable() <= 0) {\n \/\/ Request timeout.\n if ((deadline != (time_t)-1)\n && (time(NULL) >= deadline)) {\n return (false);\n }\n \/\/ Disconnected socket with no data.\n else if (!ret\n && (_socket->state() == QAbstractSocket::UnconnectedState)\n && (_socket->bytesAvailable() <= 0))\n throw (exceptions::msg() << \"TCP stream is disconnected\");\n \/\/ Got data.\n else if (ret\n || (_socket->error() != QAbstractSocket::SocketTimeoutError)\n || (_socket->bytesAvailable() > 0))\n break ;\n \/\/ Wait very little on mutex to allow socket shutdown.\n else {\n QWaitCondition cv;\n cv.wait(&*_mutex, 1);\n }\n\n \/\/ Wait for data.\n _socket->waitForReadyRead(200);\n }\n }\n\n char buffer[2048];\n qint64 rb(_socket->read(buffer, sizeof(buffer)));\n if (rb < 0)\n throw (exceptions::msg() << \"TCP: error while reading: \"\n << _socket->errorString());\n misc::shared_ptr<io::raw> data(new io::raw);\n#if QT_VERSION >= 0x040500\n data->append(buffer, rb);\n#else\n data->append(QByteArray(buffer, rb));\n#endif \/\/ Qt version\n d = data;\n return (true);\n}\n\n\/**\n * Set read timeout.\n *\n * @param[in] secs Timeout in seconds.\n *\/\nvoid stream::set_read_timeout(int secs) {\n _read_timeout = secs;\n return ;\n}\n\n\/**\n * Set write timeout.\n *\n * @param[in] secs Write timeout in seconds.\n *\/\nvoid stream::set_write_timeout(int secs) {\n _write_timeout = secs;\n return ;\n}\n\n\/**\n * Write data to the socket.\n *\n * @param[in] d Data to write.\n *\n * @return Number of events acknowledged.\n *\/\nunsigned int stream::write(misc::shared_ptr<io::data> const& d) {\n \/\/ Check that data exists and should be processed.\n if (d.isNull())\n return (1);\n\n if (d->type() == io::raw::static_type()) {\n misc::shared_ptr<io::raw> r(d.staticCast<io::raw>());\n logging::debug(logging::low) << \"TCP: write request of \"\n << r->size() << \" bytes\";\n QMutexLocker lock(&*_mutex);\n qint64 wb(_socket->write(static_cast<char*>(r->QByteArray::data()),\n r->size()));\n if ((wb < 0) || (_socket->state() == QAbstractSocket::UnconnectedState))\n throw (exceptions::msg() << \"TCP: error while writing: \"\n << _socket->errorString());\n if (_socket->waitForBytesWritten(_write_timeout * 1000) == false)\n throw (exceptions::msg() << \"TCP: error while sending data: \"\n << _socket->errorString());\n }\n return (1);\n}\n<|endoftext|>"} {"text":"<commit_before>#ifndef ALEPH_FUNCTION_HH__\n#define ALEPH_FUNCTION_HH__\n\n#include \"BoundaryMatrix.hh\"\n\n#include <algorithm>\n#include <fstream>\n#include <iterator>\n#include <numeric>\n#include <string>\n#include <vector>\n\nnamespace aleph\n{\n\nnamespace io\n{\n\ntemplate <\n class Index,\n class DataType\n> void loadFunction( const std::string& filename,\n BoundaryMatrix<Index>& boundaryMatrix,\n std::vector<DataType>& functionValues )\n{\n using BoundaryMatrix = BoundaryMatrix<Index>;\n\n std::ifstream in( filename );\n\n if( !in )\n throw std::runtime_error( \"Unable to open input filename\" );\n\n functionValues.clear();\n functionValues.shrink_to_fit();\n\n std::copy( std::istream_iterator<DataType>( in ),\n std::istream_iterator<DataType>(),\n std::back_inserter( functionValues ) );\n\n if( functionValues.empty() )\n throw std::runtime_error( \"Unable to load any function values\" );\n\n std::vector<Index> indices( 2*functionValues.size() - 1 );\n std::iota( indices.begin(), indices.end(), Index(0) );\n\n std::stable_sort( indices.begin(), indices.end(),\n [&functionValues] ( Index i, Index j )\n {\n auto weight = [&] ( Index i )\n {\n if( i < functionValues.size() )\n return functionValues.at(i);\n else\n {\n auto l = functionValues.at( i - functionValues.size() );\n auto r = functionValues.at( i - functionValues.size() + 1 );\n\n return std::max( l, r );\n }\n };\n\n return weight(i) < weight(j);\n } );\n\n std::vector<Index> vertexIndices( functionValues.size() );\n\n std::iota( vertexIndices.begin(), vertexIndices.end(),\n Index(0) );\n\n std::sort( vertexIndices.begin(), vertexIndices.end(),\n [&functionValues] ( Index i, Index j )\n {\n return functionValues.at(i) < functionValues.at(j);\n } );\n\n std::vector<Index> edgeIndices( functionValues.size() - 1 );\n\n std::iota( edgeIndices.begin(),\n edgeIndices.end(),\n static_cast<Index>( functionValues.size() ) );\n\n std::sort( edgeIndices.begin(), edgeIndices.end(),\n [&functionValues] ( Index i, Index j )\n {\n auto k = i - functionValues.size();\n auto l = j - functionValues.size();\n\n return functionValues.at(k) < functionValues.at(l);\n } );\n\n boundaryMatrix.setNumColumns( 2 * functionValues.size() - 1 );\n\n for( Index j = 0; j < static_cast<Index>( functionValues.size() ); j++ )\n boundaryMatrix.clearColumn( j );\n}\n\n}\n\n}\n\n#endif\n<commit_msg>Filling boundary matrix for 1D function loading<commit_after>#ifndef ALEPH_FUNCTION_HH__\n#define ALEPH_FUNCTION_HH__\n\n#include \"BoundaryMatrix.hh\"\n\n#include <algorithm>\n#include <fstream>\n#include <iterator>\n#include <numeric>\n#include <string>\n#include <vector>\n\nnamespace aleph\n{\n\nnamespace io\n{\n\ntemplate <\n class Index,\n class DataType\n> void loadFunction( const std::string& filename,\n BoundaryMatrix<Index>& boundaryMatrix,\n std::vector<DataType>& functionValues )\n{\n using BoundaryMatrix = BoundaryMatrix<Index>;\n\n std::ifstream in( filename );\n\n if( !in )\n throw std::runtime_error( \"Unable to open input filename\" );\n\n functionValues.clear();\n functionValues.shrink_to_fit();\n\n std::copy( std::istream_iterator<DataType>( in ),\n std::istream_iterator<DataType>(),\n std::back_inserter( functionValues ) );\n\n if( functionValues.empty() )\n throw std::runtime_error( \"Unable to load any function values\" );\n\n std::vector<Index> indices( 2*functionValues.size() - 1 );\n std::iota( indices.begin(), indices.end(), Index(0) );\n\n std::stable_sort( indices.begin(), indices.end(),\n [&functionValues] ( Index i, Index j )\n {\n auto weight = [&] ( Index i )\n {\n if( i < functionValues.size() )\n return functionValues.at(i);\n else\n {\n auto l = functionValues.at( i - functionValues.size() );\n auto r = functionValues.at( i - functionValues.size() + 1 );\n\n return std::max( l, r );\n }\n };\n\n return weight(i) < weight(j);\n } );\n\n for( Index j = 0; j < static_cast<Index>( indices.size() ); j++ )\n {\n auto&& index = indices.at(j);\n\n if( index < functionValues.size() )\n boundaryMatrix.clearColumn( j );\n else\n {\n std::vector<Index> vertexIndices = { index, index + 1 };\n\n boundaryMatrix.setColumn(j,\n vertexIndices.begin(), vertexIndices.end() );\n }\n }\n}\n\n}\n\n}\n\n#endif\n<|endoftext|>"} {"text":"<commit_before><commit_msg>Drop unused declaration<commit_after><|endoftext|>"} {"text":"<commit_before>\/*\n** Copyright 2011-2012 Merethis\n**\n** This file is part of Centreon Broker.\n**\n** Centreon Broker is free software: you can redistribute it and\/or\n** modify it under the terms of the GNU General Public License version 2\n** as published by the Free Software Foundation.\n**\n** Centreon Broker is distributed in the hope that it will be useful,\n** but WITHOUT ANY WARRANTY; without even the implied warranty of\n** MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU\n** General Public License for more details.\n**\n** You should have received a copy of the GNU General Public License\n** along with Centreon Broker. If not, see\n** <http:\/\/www.gnu.org\/licenses\/>.\n*\/\n\n#include <cassert>\n#include <cstdlib>\n#include <QMutexLocker>\n#include <QWaitCondition>\n#include \"com\/centreon\/broker\/exceptions\/msg.hh\"\n#include \"com\/centreon\/broker\/io\/exceptions\/shutdown.hh\"\n#include \"com\/centreon\/broker\/io\/raw.hh\"\n#include \"com\/centreon\/broker\/tcp\/stream.hh\"\n\nusing namespace com::centreon::broker;\nusing namespace com::centreon::broker::tcp;\n\n\/**************************************\n* *\n* Public Methods *\n* *\n**************************************\/\n\n\/**\n * Constructor.\n *\n * @param[in] sock Socket used by this stream.\n *\/\nstream::stream(misc::shared_ptr<QTcpSocket> sock)\n : _mutex(new QMutex),\n _process_in(true),\n _process_out(true),\n _socket(sock),\n _timeout(-1) {}\n\n\/**\n * Constructor.\n *\n * @param[in] sock Socket used by this stream.\n * @param[in] mutex Mutex used by this stream.\n *\/\nstream::stream(\n misc::shared_ptr<QTcpSocket> sock,\n misc::shared_ptr<QMutex> mutex)\n : _mutex(mutex),\n _process_in(true),\n _process_out(true),\n _socket(sock),\n _timeout(-1) {}\n\n\/**\n * Destructor.\n *\/\nstream::~stream() {\n QMutexLocker lock(&*_mutex);\n if (!_socket.isNull())\n _socket->close();\n}\n\n\/**\n * Enable or disable event processing.\n *\n * @param[in] in Set to true to enable input event processing.\n * @param[in] out Set to true to enable output event processing.\n *\/\nvoid stream::process(bool in, bool out) {\n _process_in = in;\n _process_out = out;\n return ;\n}\n\n\/**\n * Read data from the socket.\n *\n * @param[out] d Data read.\n *\/\nvoid stream::read(misc::shared_ptr<io::data>& d) {\n d.clear();\n QMutexLocker lock(&*_mutex);\n bool ret;\n while (1) {\n if (!_process_in)\n throw (io::exceptions::shutdown(!_process_in, !_process_out)\n << \"TCP stream is shutdown\");\n if (!(ret = _socket->waitForReadyRead(\n (_timeout == -1)\n ? 200\n : _timeout))\n \/\/ Standalone socket.\n && ((_timeout != -1)\n \/\/ Disconnected socket with no data.\n || ((_socket->state()\n == QAbstractSocket::UnconnectedState)\n && (_socket->bytesAvailable() <= 0))))\n throw (exceptions::msg() << \"TCP stream is disconnected\");\n if (ret\n || (_socket->error() != QAbstractSocket::SocketTimeoutError)\n || (_socket->bytesAvailable() > 0))\n break ;\n else {\n QWaitCondition cv;\n cv.wait(&*_mutex, 1);\n }\n }\n\n char buffer[2048];\n qint64 rb(_socket->read(buffer, sizeof(buffer)));\n if (rb < 0)\n throw (exceptions::msg() << \"TCP: error while reading: \"\n << _socket->errorString());\n misc::shared_ptr<io::raw> data(new io::raw);\n#if QT_VERSION >= 0x040500\n data->append(buffer, rb);\n#else\n data->append(QByteArray(buffer, rb));\n#endif \/\/ Qt version\n d = data.staticCast<io::data>();\n return ;\n}\n\n\/**\n * Set connection timeout.\n *\n * @param[in] msecs Timeout in ms.\n *\/\nvoid stream::set_timeout(int msecs) {\n _timeout = msecs;\n return ;\n}\n\n\/**\n * Write data to the socket.\n *\n * @param[in] d Data to write.\n *\/\nvoid stream::write(misc::shared_ptr<io::data> const& d) {\n \/\/ Raw type.\n static QString const raw_type(\"com::centreon::broker::io::raw\");\n\n \/\/ Check that data exists and should be processed.\n if (!_process_out)\n throw (io::exceptions::shutdown(!_process_in, !_process_out)\n << \"TCP stream is shutdown\");\n if (d.isNull())\n return ;\n\n if (d->type() == raw_type) {\n misc::shared_ptr<io::raw> r(d.staticCast<io::raw>());\n QMutexLocker lock(&*_mutex);\n qint64 wb(_socket->write(static_cast<char*>(r->QByteArray::data()),\n r->size()));\n if ((wb < 0) || (_socket->state() != QAbstractSocket::UnconnectedState))\n throw (exceptions::msg() << \"TCP: error while writing: \"\n << _socket->errorString());\n _socket->waitForBytesWritten(-1);\n }\n return ;\n}\n\n\/**************************************\n* *\n* Private Methods *\n* *\n**************************************\/\n\n\/**\n * @brief Copy constructor.\n *\n * Any call to this constructor will result in a call to abort().\n *\n * @param[in] s Object to copy.\n *\/\nstream::stream(stream const& s) : io::stream(s) {\n assert(!\"TCP stream is not copyable\");\n abort();\n}\n\n\/**\n * @brief Assignment operator.\n *\n * Any call to this method will result in a call to abort().\n *\n * @param[in] s Object to copy.\n *\n * @return This object.\n *\/\nstream& stream::operator=(stream const& s) {\n (void)s;\n assert(!\"TCP stream is not copyable\");\n abort();\n return (*this);\n}\n<commit_msg>Handle TLS connection failures.<commit_after>\/*\n** Copyright 2011-2012 Merethis\n**\n** This file is part of Centreon Broker.\n**\n** Centreon Broker is free software: you can redistribute it and\/or\n** modify it under the terms of the GNU General Public License version 2\n** as published by the Free Software Foundation.\n**\n** Centreon Broker is distributed in the hope that it will be useful,\n** but WITHOUT ANY WARRANTY; without even the implied warranty of\n** MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU\n** General Public License for more details.\n**\n** You should have received a copy of the GNU General Public License\n** along with Centreon Broker. If not, see\n** <http:\/\/www.gnu.org\/licenses\/>.\n*\/\n\n#include <cassert>\n#include <cstdlib>\n#include <QMutexLocker>\n#include <QWaitCondition>\n#include \"com\/centreon\/broker\/exceptions\/msg.hh\"\n#include \"com\/centreon\/broker\/io\/exceptions\/shutdown.hh\"\n#include \"com\/centreon\/broker\/io\/raw.hh\"\n#include \"com\/centreon\/broker\/tcp\/stream.hh\"\n\nusing namespace com::centreon::broker;\nusing namespace com::centreon::broker::tcp;\n\n\/**************************************\n* *\n* Public Methods *\n* *\n**************************************\/\n\n\/**\n * Constructor.\n *\n * @param[in] sock Socket used by this stream.\n *\/\nstream::stream(misc::shared_ptr<QTcpSocket> sock)\n : _mutex(new QMutex),\n _process_in(true),\n _process_out(true),\n _socket(sock),\n _timeout(-1) {}\n\n\/**\n * Constructor.\n *\n * @param[in] sock Socket used by this stream.\n * @param[in] mutex Mutex used by this stream.\n *\/\nstream::stream(\n misc::shared_ptr<QTcpSocket> sock,\n misc::shared_ptr<QMutex> mutex)\n : _mutex(mutex),\n _process_in(true),\n _process_out(true),\n _socket(sock),\n _timeout(-1) {}\n\n\/**\n * Destructor.\n *\/\nstream::~stream() {\n QMutexLocker lock(&*_mutex);\n if (!_socket.isNull())\n _socket->close();\n}\n\n\/**\n * Enable or disable event processing.\n *\n * @param[in] in Set to true to enable input event processing.\n * @param[in] out Set to true to enable output event processing.\n *\/\nvoid stream::process(bool in, bool out) {\n _process_in = in;\n _process_out = out;\n return ;\n}\n\n\/**\n * Read data from the socket.\n *\n * @param[out] d Data read.\n *\/\nvoid stream::read(misc::shared_ptr<io::data>& d) {\n d.clear();\n QMutexLocker lock(&*_mutex);\n bool ret;\n while (1) {\n if (!_process_in)\n throw (io::exceptions::shutdown(!_process_in, !_process_out)\n << \"TCP stream is shutdown\");\n if (!(ret = _socket->waitForReadyRead(\n (_timeout == -1)\n ? 200\n : _timeout))\n \/\/ Standalone socket.\n && ((_timeout != -1)\n \/\/ Disconnected socket with no data.\n || ((_socket->state()\n == QAbstractSocket::UnconnectedState)\n && (_socket->bytesAvailable() <= 0))))\n throw (exceptions::msg() << \"TCP stream is disconnected\");\n if (ret\n || (_socket->error() != QAbstractSocket::SocketTimeoutError)\n || (_socket->bytesAvailable() > 0))\n break ;\n else {\n QWaitCondition cv;\n cv.wait(&*_mutex, 1);\n }\n }\n\n char buffer[2048];\n qint64 rb(_socket->read(buffer, sizeof(buffer)));\n if (rb < 0)\n throw (exceptions::msg() << \"TCP: error while reading: \"\n << _socket->errorString());\n misc::shared_ptr<io::raw> data(new io::raw);\n#if QT_VERSION >= 0x040500\n data->append(buffer, rb);\n#else\n data->append(QByteArray(buffer, rb));\n#endif \/\/ Qt version\n d = data.staticCast<io::data>();\n return ;\n}\n\n\/**\n * Set connection timeout.\n *\n * @param[in] msecs Timeout in ms.\n *\/\nvoid stream::set_timeout(int msecs) {\n _timeout = msecs;\n return ;\n}\n\n\/**\n * Write data to the socket.\n *\n * @param[in] d Data to write.\n *\/\nvoid stream::write(misc::shared_ptr<io::data> const& d) {\n \/\/ Raw type.\n static QString const raw_type(\"com::centreon::broker::io::raw\");\n\n \/\/ Check that data exists and should be processed.\n if (!_process_out)\n throw (io::exceptions::shutdown(!_process_in, !_process_out)\n << \"TCP stream is shutdown\");\n if (d.isNull())\n return ;\n\n if (d->type() == raw_type) {\n misc::shared_ptr<io::raw> r(d.staticCast<io::raw>());\n QMutexLocker lock(&*_mutex);\n qint64 wb(_socket->write(static_cast<char*>(r->QByteArray::data()),\n r->size()));\n if ((wb < 0) || (_socket->state() == QAbstractSocket::UnconnectedState))\n throw (exceptions::msg() << \"TCP: error while writing: \"\n << _socket->errorString());\n _socket->waitForBytesWritten(-1);\n }\n return ;\n}\n\n\/**************************************\n* *\n* Private Methods *\n* *\n**************************************\/\n\n\/**\n * @brief Copy constructor.\n *\n * Any call to this constructor will result in a call to abort().\n *\n * @param[in] s Object to copy.\n *\/\nstream::stream(stream const& s) : io::stream(s) {\n assert(!\"TCP stream is not copyable\");\n abort();\n}\n\n\/**\n * @brief Assignment operator.\n *\n * Any call to this method will result in a call to abort().\n *\n * @param[in] s Object to copy.\n *\n * @return This object.\n *\/\nstream& stream::operator=(stream const& s) {\n (void)s;\n assert(!\"TCP stream is not copyable\");\n abort();\n return (*this);\n}\n<|endoftext|>"} {"text":"<commit_before><commit_msg>avoid out-of-bounds access<commit_after><|endoftext|>"} {"text":"<commit_before>\/\/ Copyright (c) 2012 Roman Neuhauser\n\/\/ Distributed under the MIT license (see LICENSE file)\n\/\/ vim: sw=2 sts=2 ts=2 fdm=marker cms=\\ \/\/\\ %s\n\n\/\/ shared_ptr\n#include <memory>\n\n#include <iostream>\n#include <istream>\n#include <ostream>\n#include <fstream>\n#include <string>\n#include <vector>\n\n#define EX_OK 0 \/* successful termination *\/\n#define EX_USAGE 64 \/* command line usage error *\/\n#define EX_DATAERR 65 \/* data format error *\/\n#define EX_NOINPUT 66 \/* cannot open input *\/\n\n#include \"boost\/ref.hpp\"\n#include \"boost\/foreach.hpp\"\n#include \"boost\/format.hpp\"\n#include \"boost\/date_time\/gregorian\/gregorian.hpp\"\n#include \"boost\/regex.hpp\"\n\n#include \"iniphile\/input.hpp\"\n#include \"iniphile\/ast.hpp\"\n#include \"iniphile\/output.hpp\"\n\n#define foreach BOOST_FOREACH\n\nusing std::shared_ptr;\n\nusing std::cin;\nusing std::cerr;\nusing std::endl;\nusing std::ios;\nusing std::getline;\nusing std::ostream;\nusing std::ifstream;\nusing std::ofstream;\nusing std::string;\nusing std::vector;\n\nusing boost::cref;\nusing boost::format;\nusing namespace boost::gregorian;\nusing boost::regex;\nusing boost::smatch;\n\nnamespace\n{\n\nstruct expand_sink \/\/ {{{\n{\n expand_sink(string const &prefix, date const &today)\n : prefix(prefix)\n , today(today)\n {}\nprivate:\n string const &prefix;\n date const &today;\npublic:\n string\n operator()(smatch const &expando) const\n {\n auto sexpando = expando.str();\n if (sexpando == \"%D\") return to_iso_extended_string(today);\n if (sexpando == \"%P\") return prefix;\n return \"LOGDEMUX-BUG\";\n }\n}; \/\/ }}}\n\nclass rule\n{\npublic:\n rule(string const &prefix, string const &match, string const &sink, bool final, ostream &diag) \/\/ {{{\n : sink(sink)\n , prefix(prefix)\n , final(final)\n , pat(match, regex::perl)\n , opened_on()\n , os()\n , diag(diag)\n {\n } \/\/ }}}\n bool\n handle(date const &today, string const &line) \/\/ {{{\n {\n if (!regex_search(line, pat))\n return false;\n if (opened_on != today)\n reopen(today);\n os << line << endl;\n return final;\n } \/\/ }}}\nprivate:\n string const sink;\n string const prefix;\n bool final;\n regex pat;\n date opened_on;\n ofstream os;\n ostream &diag;\n\n void\n reopen(date const &today) \/\/ {{{\n {\n if (os.is_open()) os.close();\n os.clear();\n auto fname = expand(sink, today);\n os.open(fname.c_str(), ios::app | ios::binary);\n if (os.fail())\n diag << \"failed to open \" << fname << endl;\n opened_on = today;\n } \/\/ }}}\n string\n expand(string const &fmt, date const &d) const \/\/ {{{\n {\n return regex_replace(\n fmt\n , regex(\"%[DP]\\\\>\")\n , cref(expand_sink(prefix, d))\n );\n } \/\/ }}}\n};\n\nclass ruleset\n{\npublic:\n ruleset(iniphile::ast::node const &ini, string const &prefix, ostream &diag)\n {\n foreach (auto const &rname, iniphile::get(ini, \"rules.order\", vector<string>()))\n rules.push_back(shared_ptr<rule>(new rule(\n prefix\n , iniphile::get(ini, rname + \".match\", string(\"\")) \n , iniphile::get(ini, rname + \".sink\", string(\"\")) \n , iniphile::get(ini, rname + \".final\", false) \n , diag\n )));\n }\n void\n handle(date const &now, string const &line) \/\/ {{{\n {\n foreach (auto &r, rules)\n if (r->handle(now, line))\n break;\n } \/\/ }}}\nprivate:\n vector<shared_ptr<rule>> rules;\n};\n\ndate\ntoday() \/\/ {{{\n{\n return day_clock::local_day();\n} \/\/ }}}\n\ntemplate<class Fmt>\nint\ncomplain(int exitcode, Fmt msg)\n{\n cerr << msg << endl;\n return exitcode;\n}\n\n}\n\nint\nmain(int argc, char **argv)\n{\n string self = argc > 0 ? argv[0] : \"logdemux\";\n string bself = regex_replace(\n self\n , regex(\"^(.*\/)?([^\/]+)(.exe)?$\", regex::perl)\n , \"$2\"\n );\n\n if (argc < 3)\n return complain(\n EX_USAGE\n , format(\"usage: %1% rules prefix\") % bself\n );\n\n string ini = argv[1];\n string prefix = argv[2];\n ifstream sini;\n sini.open(ini);\n if (sini.fail())\n return complain(\n EX_NOINPUT\n , format(\"%1%: rules file '%2%' missing\") % bself % ini\n );\n\n auto cfg = iniphile::parse(sini, cerr);\n sini.close();\n if (!cfg)\n return complain(\n EX_DATAERR\n , format(\"%1%: rules file '%2%' broken\") % bself % ini\n );\n\n auto afg(iniphile::normalize(*cfg));\n\n if (iniphile::get(afg, \"rules.order\", string(\"\")) == \"\")\n return complain(\n EX_DATAERR\n , format(\"%1%: no rules.order in '%2%'\") % bself % ini\n );\n\n ruleset rules(afg, prefix, cerr);\n\n string line;\n while (cin.good()) {\n while (getline(cin, line)) {\n rules.handle(today(), line);\n }\n }\n\n return EX_OK;\n}\n<commit_msg>logdemux.cpp needed more foldmarkers<commit_after>\/\/ Copyright (c) 2012 Roman Neuhauser\n\/\/ Distributed under the MIT license (see LICENSE file)\n\/\/ vim: sw=2 sts=2 ts=2 fdm=marker cms=\\ \/\/\\ %s\n\n\/\/ shared_ptr\n#include <memory>\n\n#include <iostream>\n#include <istream>\n#include <ostream>\n#include <fstream>\n#include <string>\n#include <vector>\n\n#define EX_OK 0 \/* successful termination *\/\n#define EX_USAGE 64 \/* command line usage error *\/\n#define EX_DATAERR 65 \/* data format error *\/\n#define EX_NOINPUT 66 \/* cannot open input *\/\n\n#include \"boost\/ref.hpp\"\n#include \"boost\/foreach.hpp\"\n#include \"boost\/format.hpp\"\n#include \"boost\/date_time\/gregorian\/gregorian.hpp\"\n#include \"boost\/regex.hpp\"\n\n#include \"iniphile\/input.hpp\"\n#include \"iniphile\/ast.hpp\"\n#include \"iniphile\/output.hpp\"\n\n#define foreach BOOST_FOREACH\n\nusing std::shared_ptr;\n\nusing std::cin;\nusing std::cerr;\nusing std::endl;\nusing std::ios;\nusing std::getline;\nusing std::ostream;\nusing std::ifstream;\nusing std::ofstream;\nusing std::string;\nusing std::vector;\n\nusing boost::cref;\nusing boost::format;\nusing namespace boost::gregorian;\nusing boost::regex;\nusing boost::smatch;\n\nnamespace\n{\n\nstruct expand_sink \/\/ {{{\n{\n expand_sink(string const &prefix, date const &today)\n : prefix(prefix)\n , today(today)\n {}\nprivate:\n string const &prefix;\n date const &today;\npublic:\n string\n operator()(smatch const &expando) const\n {\n auto sexpando = expando.str();\n if (sexpando == \"%D\") return to_iso_extended_string(today);\n if (sexpando == \"%P\") return prefix;\n return \"LOGDEMUX-BUG\";\n }\n}; \/\/ }}}\n\nclass rule\n\/\/ {{{\n{\npublic:\n rule(string const &prefix, string const &match, string const &sink, bool final, ostream &diag) \/\/ {{{\n : sink(sink)\n , prefix(prefix)\n , final(final)\n , pat(match, regex::perl)\n , opened_on()\n , os()\n , diag(diag)\n {\n } \/\/ }}}\n bool\n handle(date const &today, string const &line) \/\/ {{{\n {\n if (!regex_search(line, pat))\n return false;\n if (opened_on != today)\n reopen(today);\n os << line << endl;\n return final;\n } \/\/ }}}\nprivate:\n string const sink;\n string const prefix;\n bool final;\n regex pat;\n date opened_on;\n ofstream os;\n ostream &diag;\n\n void\n reopen(date const &today) \/\/ {{{\n {\n if (os.is_open()) os.close();\n os.clear();\n auto fname = expand(sink, today);\n os.open(fname.c_str(), ios::app | ios::binary);\n if (os.fail())\n diag << \"failed to open \" << fname << endl;\n opened_on = today;\n } \/\/ }}}\n string\n expand(string const &fmt, date const &d) const \/\/ {{{\n {\n return regex_replace(\n fmt\n , regex(\"%[DP]\\\\>\")\n , cref(expand_sink(prefix, d))\n );\n } \/\/ }}}\n}; \/\/ }}}\n\nclass ruleset\n\/\/ {{{\n{\npublic:\n ruleset(iniphile::ast::node const &ini, string const &prefix, ostream &diag) \/\/ {{{\n {\n foreach (auto const &rname, iniphile::get(ini, \"rules.order\", vector<string>()))\n rules.push_back(shared_ptr<rule>(new rule(\n prefix\n , iniphile::get(ini, rname + \".match\", string(\"\")) \n , iniphile::get(ini, rname + \".sink\", string(\"\")) \n , iniphile::get(ini, rname + \".final\", false) \n , diag\n )));\n } \/\/ }}}\n void\n handle(date const &now, string const &line) \/\/ {{{\n {\n foreach (auto &r, rules)\n if (r->handle(now, line))\n break;\n } \/\/ }}}\nprivate:\n vector<shared_ptr<rule>> rules;\n}; \/\/ }}}\n\ndate\ntoday() \/\/ {{{\n{\n return day_clock::local_day();\n} \/\/ }}}\n\ntemplate<class Fmt>\nint\ncomplain(int exitcode, Fmt msg) \/\/ {{{\n{\n cerr << msg << endl;\n return exitcode;\n} \/\/ }}}\n\n}\n\nint\nmain(int argc, char **argv)\n{\n string self = argc > 0 ? argv[0] : \"logdemux\";\n string bself = regex_replace(\n self\n , regex(\"^(.*\/)?([^\/]+)(.exe)?$\", regex::perl)\n , \"$2\"\n );\n\n if (argc < 3)\n return complain(\n EX_USAGE\n , format(\"usage: %1% rules prefix\") % bself\n );\n\n string ini = argv[1];\n string prefix = argv[2];\n ifstream sini;\n sini.open(ini);\n if (sini.fail())\n return complain(\n EX_NOINPUT\n , format(\"%1%: rules file '%2%' missing\") % bself % ini\n );\n\n auto cfg = iniphile::parse(sini, cerr);\n sini.close();\n if (!cfg)\n return complain(\n EX_DATAERR\n , format(\"%1%: rules file '%2%' broken\") % bself % ini\n );\n\n auto afg(iniphile::normalize(*cfg));\n\n if (iniphile::get(afg, \"rules.order\", string(\"\")) == \"\")\n return complain(\n EX_DATAERR\n , format(\"%1%: no rules.order in '%2%'\") % bself % ini\n );\n\n ruleset rules(afg, prefix, cerr);\n\n string line;\n while (cin.good()) {\n while (getline(cin, line)) {\n rules.handle(today(), line);\n }\n }\n\n return EX_OK;\n}\n<|endoftext|>"} {"text":"<commit_before>\/\/ Copyright 2017 Jose M. Arbos\n\/\/\n\/\/ Licensed under the Apache License, Version 2.0 (the \"License\");\n\/\/ you may not use this file except in compliance with the License.\n\/\/ You may obtain a copy of the License at\n\/\/\n\/\/ http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n\/\/\n\/\/ Unless required by applicable law or agreed to in writing, software\n\/\/ distributed under the License is distributed on an \"AS IS\" BASIS,\n\/\/ WITHOUT WARRANTIES OR CONDITIONS OF 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 <experimental\/filesystem>\n#include <fstream>\n#include <iostream>\n\n#include \"config.h\"\n#include \"yaml-cpp\/yaml.h\"\n\nusing namespace std;\nusing namespace std::experimental::filesystem::v1;\n\nstatic const char* nwn2_dirs[] = {\n \"C:\\\\Program Files\\\\Atari\\\\Neverwinter Nights 2\",\n \"C:\\\\Program Files (x86)\\\\Atari\\\\Neverwinter Nights 2\",\n \"C:\\\\GOG Games\\\\Neverwinter Nights 2 Complete\"};\n\nstatic void create_config_file(const char *filename)\n{\n\tofstream out(filename);\n\tout << \"# (Optional) Directory where NWN2 is installed.\\n\";\n\tout << \"# nwn2_home: C:\\\\Program Files\\\\Atari\\\\Neverwinter Nights 2\\n\";\n}\n\nstatic void find_nwn2_home(Config& config, YAML::Node& config_file)\n{\n\tif (config_file[\"nwn2_home\"]) {\n\t\tauto nwn2_home = config_file[\"nwn2_home\"].as<string>(\"\");\n\t\tif (exists(nwn2_home))\n\t\t\tconfig.nwn2_home = nwn2_home;\n\t\telse\n\t\t\tcout << \"ERROR: The NWN2 installation directory specified in config.yml doesn't exist: \\\"\" << nwn2_home << \"\\\"\\n\";\n\t}\n\telse {\n\t\tfor (unsigned i = 0; i < sizeof(nwn2_dirs) \/ sizeof(char*); ++i)\n\t\t\tif (exists(nwn2_dirs[i]))\n\t\t\t\tconfig.nwn2_home = nwn2_dirs[i];\t\t\t\n\t}\n}\n\nConfig::Config(const char *filename)\n{\n\tif (!exists(filename))\n\t\tcreate_config_file(filename);\n\n\ttry {\n\t\tauto config_file = YAML::LoadFile(filename);\n\t\tif (!config_file) {\n\t\t\tcout << \"ERROR: Cannot open \" << filename << endl;\n\t\t\treturn;\n\t\t}\n\n\t\tfind_nwn2_home(*this, config_file);\n\t}\n\tcatch (...) {\n\t\tcout << \"ERROR: Cannot open \" << filename << \": It's ill-formed.\" << endl;\n\t\treturn;\n\t}\n\n\tif (nwn2_home.empty()) {\n\t\tcout << \"Cannot find a NWN2 installation directory. Edit the \"\n\t\t\t\"config.yml file and put the directory where NWN2 is \"\n\t\t\t\"installed.\\n\";\n\t}\n}<commit_msg>Search NWN2 install dir in Windows registry<commit_after>\/\/ Copyright 2017 Jose M. Arbos\n\/\/\n\/\/ Licensed under the Apache License, Version 2.0 (the \"License\");\n\/\/ you may not use this file except in compliance with the License.\n\/\/ You may obtain a copy of the License at\n\/\/\n\/\/ http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n\/\/\n\/\/ Unless required by applicable law or agreed to in writing, software\n\/\/ distributed under the License is distributed on an \"AS IS\" BASIS,\n\/\/ WITHOUT WARRANTIES OR CONDITIONS OF 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 <experimental\/filesystem>\n#include <fstream>\n#include <iostream>\n\n#ifdef _WIN32\n#include <windows.h>\n#endif\n\n#include \"config.h\"\n#include \"yaml-cpp\/yaml.h\"\n\nusing namespace std;\nusing namespace std::experimental::filesystem::v1;\n\nstatic void create_config_file(const char *filename)\n{\n\tofstream out(filename);\n\tout << \"# (Optional) Directory where NWN2 is installed.\\n\";\n\tout << \"# nwn2_home: C:\\\\Program Files\\\\Atari\\\\Neverwinter Nights 2\\n\";\n}\n\nstatic bool find_nwn2_home_in_config(Config& config, YAML::Node& config_file)\n{\n\tif (config_file[\"nwn2_home\"]) {\n\t\tauto nwn2_home = config_file[\"nwn2_home\"].as<string>(\"\");\n\n\t\tif (exists(nwn2_home))\n\t\t\tconfig.nwn2_home = nwn2_home;\n\t\telse\n\t\t\tcout << \"ERROR: The NWN2 installation directory specified in config.yml doesn't exist: \\\"\" << nwn2_home << \"\\\"\\n\";\n\n\t\treturn true;\n\t}\n\n\treturn false;\n}\n\nstatic bool find_nwn2_home_in_list(Config& config)\n{\n\tstatic const char* nwn2_dirs[] = {\n\t\t\"C:\\\\Program Files\\\\Atari\\\\Neverwinter Nights 2\",\n\t\t\"C:\\\\Program Files (x86)\\\\Atari\\\\Neverwinter Nights 2\",\n\t\t\"C:\\\\GOG Games\\\\Neverwinter Nights 2 Complete\" };\n\n\tfor (size_t i = 0; i < size(nwn2_dirs); ++i) {\n\t\tif (exists(nwn2_dirs[i])) {\n\t\t\tconfig.nwn2_home = nwn2_dirs[i];\n\t\t\treturn true;\n\t\t}\n\t}\n\n\treturn false;\n}\n\nstatic bool find_nwn2_home_in_registry(Config& config)\n{\n#ifdef _WIN32\n\tHKEY key;\n\n\tLSTATUS status = RegOpenKeyExA(HKEY_LOCAL_MACHINE,\n\t\t\"SOFTWARE\\\\Obsidian\\\\NWN 2\\\\Neverwinter\",\n\t\tREG_OPTION_RESERVED,\n#ifdef _WIN64\n\t\tKEY_QUERY_VALUE | KEY_WOW64_32KEY,\n#else\n\t\tKEY_QUERY_VALUE,\n#endif\n\t\t&key);\n\n\tif (status != NO_ERROR)\n\t\treturn false;\n\n\tchar path[MAX_PATH + 1];\n\tDWORD path_size = MAX_PATH;\n\n\tstatic const char* names[] = {\n\t\t\"Location\", \/\/ Steam & GOG NWN2\n\t\t\"Path\" \/\/ Retail NWN2\n\t};\n\n\tfor (size_t i = 0; i < size(names); ++i) {\n\t\tstatus = RegQueryValueExA(\n\t\t\tkey, names[i], NULL, NULL,\n\t\t\treinterpret_cast<LPBYTE>(path), &path_size);\n\n\t\tif (status == NO_ERROR) {\n\t\t\t\/\/ A registry value may not have been stored with the proper\n\t\t\t\/\/ terminating null character. Ensure the path is null-terminated.\n\t\t\tif (path_size == 0 || path[path_size - 1] != '\\0')\n\t\t\t\tpath[path_size] = '\\0';\n\n\t\t\tif (exists(path)) {\n\t\t\t\tRegCloseKey(key);\n\t\t\t\tconfig.nwn2_home = path;\n\t\t\t\treturn true;\n\t\t\t}\n\t\t}\n\t}\n\n\tRegCloseKey(key);\n#endif\n\n\treturn false;\n}\n\nstatic void find_nwn2_home(Config& config, YAML::Node& config_file)\n{\n\tif (find_nwn2_home_in_config(config, config_file))\n\t\treturn;\n\telse if (find_nwn2_home_in_registry(config))\n\t\treturn;\n\telse if (find_nwn2_home_in_list(config))\n\t\treturn;\n\n\tcout << \"ERROR: Cannot find a NWN2 installation directory. Edit the \"\n\t\t\"config.yml file and put the directory where NWN2 is \"\n\t\t\"installed.\\n\";\n}\n\nConfig::Config(const char *filename)\n{\n\tif (!exists(filename))\n\t\tcreate_config_file(filename);\n\n\ttry {\n\t\tauto config_file = YAML::LoadFile(filename);\n\t\tif (!config_file) {\n\t\t\tcout << \"ERROR: Cannot open \" << filename << endl;\n\t\t\treturn;\n\t\t}\n\n\t\tfind_nwn2_home(*this, config_file);\n\t}\n\tcatch (...) {\n\t\tcout << \"ERROR: Cannot open \" << filename << \": It's ill-formed.\" << endl;\n\t\treturn;\n\t}\n}<|endoftext|>"} {"text":"<commit_before>\/*\nCopyright 2013-present Barefoot Networks, Inc. \n\nLicensed under the Apache License, Version 2.0 (the \"License\");\nyou may not use this file except in compliance with the License.\nYou may obtain a copy of the License at\n\n http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n\nUnless required by applicable law or agreed to in writing, software\ndistributed under the License is distributed on an \"AS IS\" BASIS,\nWITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\nSee the License for the specific language governing permissions and\nlimitations under the License.\n*\/\n\n#include <time.h>\n#include \"ir.h\"\n#include \"lib\/log.h\"\n\nclass Visitor::ChangeTracker {\n \/\/ FIXME -- this code is really incomprehensible due to all the pairs\/first\/second stuff\n \/\/ unfortunatelly maps use pairs all over the place, which is where they come from.\n typedef unordered_map<const IR::Node *, std::pair<bool, const IR::Node *>> visited_t;\n visited_t visited;\n\n public:\n struct change_t {\n bool valid;\n std::pair<visited_t::iterator, bool> state; \/\/ result of visited.emplace\n change_t() : valid(false) {}\n change_t(visited_t *visited, const IR::Node *n) : valid(true),\n state(visited->emplace(n, std::make_pair(false, n))) {\n if (!state.second && !state.first->second.first)\n BUG(\"IR loop detected \"); }\n explicit operator bool() { return valid; }\n bool done() { return !state.second; }\n const IR::Node *orig() { return state.first->first; }\n const IR::Node *result() { return state.first->second.second; }\n };\n bool done(const IR::Node *n) const { return visited.count(n) && visited.at(n).first; }\n const IR::Node *result(IR::Node *n) const { return visited.at(n).second; }\n change_t track(const IR::Node *n) { return change_t(&visited, n); }\n void start(change_t &change) { change.state.first->second.first = false; }\n bool finish(change_t &change, const IR::Node *orig, const IR::Node *final) {\n if (!change.valid || (change.state.first = visited.find(orig)) == visited.end())\n BUG(\"visitor state tracker corrupted\");\n change.state.first->second.first = true;\n if (!final || *final != *orig) {\n change.state.first->second.second = final;\n visited.emplace(final, std::make_pair(true, final));\n return true;\n } else {\n \/\/ FIXME -- not safe if the visitor resurrects the node (which it shouldn't)\n \/\/ if (final && final->id == IR::Node::currentId - 1)\n \/\/ --IR::Node::currentId;\n return false; } }\n const IR::Node *result(const IR::Node *n) const {\n auto it = visited.find(n);\n if (it == visited.end())\n return n;\n if (!it->second.first) BUG(\"IR loop detected\");\n return it->second.second; }\n void revisit_visited() {\n for (auto it = visited.begin(); it != visited.end();) {\n if (it->second.first)\n it = visited.erase(it);\n else\n ++it; } }\n};\n\nVisitor::profile_t Visitor::init_apply(const IR::Node *root) {\n if (ctxt) BUG(\"previous use of visitor did not clean up properly\");\n ctxt = nullptr;\n if (joinFlows) init_join_flows(root);\n return profile_t(*this);\n}\nVisitor::profile_t Modifier::init_apply(const IR::Node *root) {\n auto rv = Visitor::init_apply(root);\n visited = new ChangeTracker();\n return rv; }\nVisitor::profile_t Inspector::init_apply(const IR::Node *root) {\n auto rv = Visitor::init_apply(root);\n visited = new visited_t();\n return rv; }\nVisitor::profile_t Transform::init_apply(const IR::Node *root) {\n auto rv = Visitor::init_apply(root);\n visited = new ChangeTracker();\n return rv; }\nvoid Visitor::end_apply() {}\nvoid Visitor::end_apply(const IR::Node*) {}\n\nstatic indent_t profile_indent;\nVisitor::profile_t::profile_t(Visitor &v_) : v(v_) {\n struct timespec ts;\n#ifdef CLOCK_MONOTONIC\n clock_gettime(CLOCK_MONOTONIC, &ts);\n#else\n \/\/ FIXME -- figure out how to do this on OSX\/Mach\n ts.tv_sec = ts.tv_nsec = 0;\n#endif\n start = ts.tv_sec*1000000000UL + ts.tv_nsec + 1;\n assert(start);\n ++profile_indent;\n}\nVisitor::profile_t::profile_t(profile_t &&a) : v(a.v), start(a.start) {\n a.start = 0;\n}\nVisitor::profile_t::~profile_t() {\n if (start) {\n v.end_apply();\n --profile_indent;\n struct timespec ts;\n#ifdef CLOCK_MONOTONIC\n clock_gettime(CLOCK_MONOTONIC, &ts);\n#else\n \/\/ FIXME -- figure out how to do this on OSX\/Mach\n ts.tv_sec = ts.tv_nsec = 0;\n#endif\n uint64_t end = ts.tv_sec*1000000000UL + ts.tv_nsec + 1;\n LOG1(profile_indent << v.name() << ' ' << (end-start)\/1000.0 << \" usec\"); }\n}\n\nvoid Visitor::print_context() const {\n std::ostream &out = std::cout;\n out << \"Context:\" << std::endl;\n auto ctx = getContext();\n if (ctx == nullptr) {\n out << \"<nullptr>\" << std::endl;\n return;\n }\n\n while (ctx != nullptr) {\n out << ctx->node << \" (\" << ctx->original << \")\" << std::endl;\n ctx = ctx->parent;\n }\n}\n\nvoid Visitor::visitor_const_error() {\n BUG(\"const Visitor wants to change IR\"); }\nvoid Modifier::visitor_const_error() {\n BUG(\"Modifier called const visit function -- missing template \"\n \"instantiation in gen-tree-macro.h?\"); }\nvoid Transform::visitor_const_error() {\n BUG(\"Transform called const visit function -- missing template \"\n \"instantiation in gen-tree-macro.h?\"); }\n\nstruct PushContext {\n Visitor::Context current;\n const Visitor::Context *&stack;\n PushContext(const Visitor::Context *&stck, const IR::Node *node) : stack(stck) {\n current.parent = stack;\n current.node = current.original = node;\n current.child_index = 0;\n current.depth = stack ? stack->depth+1 : 1;\n assert(current.depth < 10000); \/\/ stack overflow?\n stack = ¤t; }\n ~PushContext() { stack = current.parent; }\n};\n\nnamespace {\nclass ForwardChildren : public Visitor {\n const ChangeTracker &visited;\n const IR::Node *apply_visitor(const IR::Node *n, const char * = 0) {\n return visited.result(n); }\n public:\n explicit ForwardChildren(const ChangeTracker &v) : visited(v) {}\n};\n}\n\nconst IR::Node *Modifier::apply_visitor(const IR::Node *n, const char *name) {\n if (ctxt) ctxt->child_name = name;\n if (n) {\n PushContext local(ctxt, n);\n auto track = visited->track(n);\n if (track.done() && visitDagOnce) {\n track.orig()->apply_visitor_revisit(*this, track.result());\n n = track.result();\n } else {\n visited->start(track);\n IR::Node *copy = n->clone();\n local.current.node = copy;\n if (visitDagOnce && !dontForwardChildrenBeforePreorder) {\n ForwardChildren forward_children(*visited);\n copy->visit_children(forward_children); }\n if (copy->apply_visitor_preorder(*this)) {\n copy->visit_children(*this);\n copy->apply_visitor_postorder(*this); }\n if (visited->finish(track, n, copy))\n (n = copy)->validate(); } }\n if (ctxt)\n ctxt->child_index++;\n else\n visited = nullptr;\n return n;\n}\n\nconst IR::Node *Inspector::apply_visitor(const IR::Node *n, const char *name) {\n if (ctxt) ctxt->child_name = name;\n if (n && !join_flows(n)) {\n PushContext local(ctxt, n);\n auto vp = visited->emplace(n, false);\n if (!vp.second && !vp.first->second)\n BUG(\"IR loop detected\");\n if (!vp.second && visitDagOnce) {\n n->apply_visitor_revisit(*this);\n } else {\n vp.first->second = false;\n if (n->apply_visitor_preorder(*this)) {\n n->visit_children(*this);\n n->apply_visitor_postorder(*this); }\n vp.first = visited->find(n); \/\/ iterator may have been invalidated\n if (vp.first == visited->end())\n BUG(\"visitor state tracker corrupted\");\n vp.first->second = true; } }\n if (ctxt)\n ctxt->child_index++;\n else\n visited = nullptr;\n return n;\n}\n\nconst IR::Node *Transform::apply_visitor(const IR::Node *n, const char *name) {\n if (ctxt) ctxt->child_name = name;\n if (n) {\n PushContext local(ctxt, n);\n auto track = visited->track(n);\n if (track.done() && visitDagOnce) {\n track.orig()->apply_visitor_revisit(*this, track.result());\n n = track.result();\n } else {\n visited->start(track);\n auto copy = n->clone();\n local.current.node = copy;\n if (visitDagOnce && !dontForwardChildrenBeforePreorder) {\n ForwardChildren forward_children(*visited);\n copy->visit_children(forward_children); }\n prune_flag = false;\n auto preorder_result = copy->apply_visitor_preorder(*this);\n ChangeTracker::change_t preorder_result_track;\n assert(preorder_result != n); \/\/ should never happen\n auto final = preorder_result;\n if (preorder_result != copy) {\n \/\/ FIXME -- not safe if the visitor resurrects the node (which it shouldn't)\n \/\/ if (copy->id == IR::Node::currentId - 1)\n \/\/ --IR::Node::currentId;\n if (!preorder_result) {\n prune_flag = true;\n } else if (visited->done(preorder_result) && visitDagOnce) {\n final = visited->result(preorder_result);\n prune_flag = true;\n } else {\n preorder_result_track = visited->track(preorder_result);\n visited->start(preorder_result_track);\n local.current.node = copy = preorder_result->clone(); } }\n if (!prune_flag) {\n copy->visit_children(*this);\n final = copy->apply_visitor_postorder(*this); }\n if (final && final != preorder_result && *final == *preorder_result)\n final = preorder_result;\n if (visited->finish(track, n, final) && (n = final))\n final->validate();\n if (preorder_result_track)\n visited->finish(preorder_result_track, preorder_result, final); } }\n if (ctxt)\n ctxt->child_index++;\n else\n visited = nullptr;\n return n;\n}\n\nvoid Inspector::revisit_visited() {\n for (auto it = visited->begin(); it != visited->end();) {\n if (it->second)\n it = visited->erase(it);\n else\n ++it; }\n}\nvoid Modifier::revisit_visited() {\n visited->revisit_visited();\n}\nvoid Transform::revisit_visited() {\n visited->revisit_visited();\n}\n\n#define DEFINE_VISIT_FUNCTIONS(CLASS, BASE) \\\nbool Modifier::preorder(IR::CLASS *n) { \\\n return preorder(static_cast<IR::BASE *>(n)); } \\\nvoid Modifier::postorder(IR::CLASS *n) { \\\n postorder(static_cast<IR::BASE *>(n)); } \\\nvoid Modifier::revisit(const IR::CLASS *o, const IR::CLASS *n) { \\\n revisit(static_cast<const IR::BASE *>(o), static_cast<const IR::BASE *>(n)); } \\\nbool Inspector::preorder(const IR::CLASS *n) { \\\n return preorder(static_cast<const IR::BASE *>(n)); } \\\nvoid Inspector::postorder(const IR::CLASS *n) { \\\n postorder(static_cast<const IR::BASE *>(n)); } \\\nvoid Inspector::revisit(const IR::CLASS *n) { \\\n revisit(static_cast<const IR::BASE *>(n)); } \\\nconst IR::Node *Transform::preorder(IR::CLASS *n) { \\\n return preorder(static_cast<IR::BASE *>(n)); } \\\nconst IR::Node *Transform::postorder(IR::CLASS *n) { \\\n return postorder(static_cast<IR::BASE *>(n)); } \\\nvoid Transform::revisit(const IR::CLASS *o, const IR::Node *n) { \\\n return revisit(static_cast<const IR::BASE *>(o), n); } \\\n\nIRNODE_ALL_SUBCLASSES(DEFINE_VISIT_FUNCTIONS)\n\nclass SetupJoinPoints : public Inspector {\n map<const IR::Node *, std::pair<ControlFlowVisitor *, int>> &join_points;\n bool preorder(const IR::Node *n) override {\n return ++join_points[n].second == 1; }\n public:\n explicit SetupJoinPoints(decltype(join_points) &fjp)\n : join_points(fjp) { visitDagOnce = false; }\n};\n\nvoid ControlFlowVisitor::init_join_flows(const IR::Node *root) {\n if (!dynamic_cast<Inspector *>(this))\n BUG(\"joinFlows only works for Inspector passes currently, not Modifier or Transform\");\n if (flow_join_points)\n flow_join_points->clear();\n else\n flow_join_points = new std::remove_reference<decltype(*flow_join_points)>::type;\n root->apply(SetupJoinPoints(*flow_join_points));\n for (auto it = flow_join_points->begin(); it != flow_join_points->end(); ) {\n if (it->second.second > 1 && !filter_join_point(it->first)) {\n ++it;\n } else {\n it = flow_join_points->erase(it); } }\n}\n\nbool ControlFlowVisitor::join_flows(const IR::Node *n) {\n if (flow_join_points && flow_join_points->count(n)) {\n auto &status = flow_join_points->at(n);\n if (!--status.second) {\n flow_merge(*status.first);\n return false;\n } else if (status.first) {\n status.first->flow_merge(*this);\n return true;\n } else {\n status.first = clone();\n return true; } }\n return false;\n}\n\nvoid Inspector::check_clone(const Visitor *v) {\n auto *t = dynamic_cast<const Inspector *>(v);\n BUG_CHECK(t && t->visited == visited, \"Clone failed to copy base object\");\n}\nvoid Modifier::check_clone(const Visitor *v) {\n auto *t = dynamic_cast<const Modifier *>(v);\n BUG_CHECK(t && t->visited == visited, \"Clone failed to copy base object\");\n}\nvoid Transform::check_clone(const Visitor *v) {\n auto *t = dynamic_cast<const Transform *>(v);\n BUG_CHECK(t && t->visited == visited, \"Clone failed to copy base object\");\n}\n\nControlFlowVisitor &ControlFlowVisitor::flow_clone() {\n auto *rv = clone();\n rv->check_clone(this);\n return *rv;\n}\n<commit_msg>Work around dynamic_cast bug in clang<commit_after>\/*\nCopyright 2013-present Barefoot Networks, Inc. \n\nLicensed under the Apache License, Version 2.0 (the \"License\");\nyou may not use this file except in compliance with the License.\nYou may obtain a copy of the License at\n\n http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n\nUnless required by applicable law or agreed to in writing, software\ndistributed under the License is distributed on an \"AS IS\" BASIS,\nWITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\nSee the License for the specific language governing permissions and\nlimitations under the License.\n*\/\n\n#include <time.h>\n#include \"ir.h\"\n#include \"lib\/log.h\"\n\nclass Visitor::ChangeTracker {\n \/\/ FIXME -- this code is really incomprehensible due to all the pairs\/first\/second stuff\n \/\/ unfortunatelly maps use pairs all over the place, which is where they come from.\n typedef unordered_map<const IR::Node *, std::pair<bool, const IR::Node *>> visited_t;\n visited_t visited;\n\n public:\n struct change_t {\n bool valid;\n std::pair<visited_t::iterator, bool> state; \/\/ result of visited.emplace\n change_t() : valid(false) {}\n change_t(visited_t *visited, const IR::Node *n) : valid(true),\n state(visited->emplace(n, std::make_pair(false, n))) {\n if (!state.second && !state.first->second.first)\n BUG(\"IR loop detected \"); }\n explicit operator bool() { return valid; }\n bool done() { return !state.second; }\n const IR::Node *orig() { return state.first->first; }\n const IR::Node *result() { return state.first->second.second; }\n };\n bool done(const IR::Node *n) const { return visited.count(n) && visited.at(n).first; }\n const IR::Node *result(IR::Node *n) const { return visited.at(n).second; }\n change_t track(const IR::Node *n) { return change_t(&visited, n); }\n void start(change_t &change) { change.state.first->second.first = false; }\n bool finish(change_t &change, const IR::Node *orig, const IR::Node *final) {\n if (!change.valid || (change.state.first = visited.find(orig)) == visited.end())\n BUG(\"visitor state tracker corrupted\");\n change.state.first->second.first = true;\n if (!final || *final != *orig) {\n change.state.first->second.second = final;\n visited.emplace(final, std::make_pair(true, final));\n return true;\n } else {\n \/\/ FIXME -- not safe if the visitor resurrects the node (which it shouldn't)\n \/\/ if (final && final->id == IR::Node::currentId - 1)\n \/\/ --IR::Node::currentId;\n return false; } }\n const IR::Node *result(const IR::Node *n) const {\n auto it = visited.find(n);\n if (it == visited.end())\n return n;\n if (!it->second.first) BUG(\"IR loop detected\");\n return it->second.second; }\n void revisit_visited() {\n for (auto it = visited.begin(); it != visited.end();) {\n if (it->second.first)\n it = visited.erase(it);\n else\n ++it; } }\n};\n\nVisitor::profile_t Visitor::init_apply(const IR::Node *root) {\n if (ctxt) BUG(\"previous use of visitor did not clean up properly\");\n ctxt = nullptr;\n if (joinFlows) init_join_flows(root);\n return profile_t(*this);\n}\nVisitor::profile_t Modifier::init_apply(const IR::Node *root) {\n auto rv = Visitor::init_apply(root);\n visited = new ChangeTracker();\n return rv; }\nVisitor::profile_t Inspector::init_apply(const IR::Node *root) {\n auto rv = Visitor::init_apply(root);\n visited = new visited_t();\n return rv; }\nVisitor::profile_t Transform::init_apply(const IR::Node *root) {\n auto rv = Visitor::init_apply(root);\n visited = new ChangeTracker();\n return rv; }\nvoid Visitor::end_apply() {}\nvoid Visitor::end_apply(const IR::Node*) {}\n\nstatic indent_t profile_indent;\nVisitor::profile_t::profile_t(Visitor &v_) : v(v_) {\n struct timespec ts;\n#ifdef CLOCK_MONOTONIC\n clock_gettime(CLOCK_MONOTONIC, &ts);\n#else\n \/\/ FIXME -- figure out how to do this on OSX\/Mach\n ts.tv_sec = ts.tv_nsec = 0;\n#endif\n start = ts.tv_sec*1000000000UL + ts.tv_nsec + 1;\n assert(start);\n ++profile_indent;\n}\nVisitor::profile_t::profile_t(profile_t &&a) : v(a.v), start(a.start) {\n a.start = 0;\n}\nVisitor::profile_t::~profile_t() {\n if (start) {\n v.end_apply();\n --profile_indent;\n struct timespec ts;\n#ifdef CLOCK_MONOTONIC\n clock_gettime(CLOCK_MONOTONIC, &ts);\n#else\n \/\/ FIXME -- figure out how to do this on OSX\/Mach\n ts.tv_sec = ts.tv_nsec = 0;\n#endif\n uint64_t end = ts.tv_sec*1000000000UL + ts.tv_nsec + 1;\n LOG1(profile_indent << v.name() << ' ' << (end-start)\/1000.0 << \" usec\"); }\n}\n\nvoid Visitor::print_context() const {\n std::ostream &out = std::cout;\n out << \"Context:\" << std::endl;\n auto ctx = getContext();\n if (ctx == nullptr) {\n out << \"<nullptr>\" << std::endl;\n return;\n }\n\n while (ctx != nullptr) {\n out << ctx->node << \" (\" << ctx->original << \")\" << std::endl;\n ctx = ctx->parent;\n }\n}\n\nvoid Visitor::visitor_const_error() {\n BUG(\"const Visitor wants to change IR\"); }\nvoid Modifier::visitor_const_error() {\n BUG(\"Modifier called const visit function -- missing template \"\n \"instantiation in gen-tree-macro.h?\"); }\nvoid Transform::visitor_const_error() {\n BUG(\"Transform called const visit function -- missing template \"\n \"instantiation in gen-tree-macro.h?\"); }\n\nstruct PushContext {\n Visitor::Context current;\n const Visitor::Context *&stack;\n PushContext(const Visitor::Context *&stck, const IR::Node *node) : stack(stck) {\n current.parent = stack;\n current.node = current.original = node;\n current.child_index = 0;\n current.depth = stack ? stack->depth+1 : 1;\n assert(current.depth < 10000); \/\/ stack overflow?\n stack = ¤t; }\n ~PushContext() { stack = current.parent; }\n};\n\nnamespace {\nclass ForwardChildren : public Visitor {\n const ChangeTracker &visited;\n const IR::Node *apply_visitor(const IR::Node *n, const char * = 0) {\n return visited.result(n); }\n public:\n explicit ForwardChildren(const ChangeTracker &v) : visited(v) {}\n};\n}\n\nconst IR::Node *Modifier::apply_visitor(const IR::Node *n, const char *name) {\n if (ctxt) ctxt->child_name = name;\n if (n) {\n PushContext local(ctxt, n);\n auto track = visited->track(n);\n if (track.done() && visitDagOnce) {\n track.orig()->apply_visitor_revisit(*this, track.result());\n n = track.result();\n } else {\n visited->start(track);\n IR::Node *copy = n->clone();\n local.current.node = copy;\n if (visitDagOnce && !dontForwardChildrenBeforePreorder) {\n ForwardChildren forward_children(*visited);\n copy->visit_children(forward_children); }\n if (copy->apply_visitor_preorder(*this)) {\n copy->visit_children(*this);\n copy->apply_visitor_postorder(*this); }\n if (visited->finish(track, n, copy))\n (n = copy)->validate(); } }\n if (ctxt)\n ctxt->child_index++;\n else\n visited = nullptr;\n return n;\n}\n\nconst IR::Node *Inspector::apply_visitor(const IR::Node *n, const char *name) {\n if (ctxt) ctxt->child_name = name;\n if (n && !join_flows(n)) {\n PushContext local(ctxt, n);\n auto vp = visited->emplace(n, false);\n if (!vp.second && !vp.first->second)\n BUG(\"IR loop detected\");\n if (!vp.second && visitDagOnce) {\n n->apply_visitor_revisit(*this);\n } else {\n vp.first->second = false;\n if (n->apply_visitor_preorder(*this)) {\n n->visit_children(*this);\n n->apply_visitor_postorder(*this); }\n vp.first = visited->find(n); \/\/ iterator may have been invalidated\n if (vp.first == visited->end())\n BUG(\"visitor state tracker corrupted\");\n vp.first->second = true; } }\n if (ctxt)\n ctxt->child_index++;\n else\n visited = nullptr;\n return n;\n}\n\nconst IR::Node *Transform::apply_visitor(const IR::Node *n, const char *name) {\n if (ctxt) ctxt->child_name = name;\n if (n) {\n PushContext local(ctxt, n);\n auto track = visited->track(n);\n if (track.done() && visitDagOnce) {\n track.orig()->apply_visitor_revisit(*this, track.result());\n n = track.result();\n } else {\n visited->start(track);\n auto copy = n->clone();\n local.current.node = copy;\n if (visitDagOnce && !dontForwardChildrenBeforePreorder) {\n ForwardChildren forward_children(*visited);\n copy->visit_children(forward_children); }\n prune_flag = false;\n auto preorder_result = copy->apply_visitor_preorder(*this);\n ChangeTracker::change_t preorder_result_track;\n assert(preorder_result != n); \/\/ should never happen\n auto final = preorder_result;\n if (preorder_result != copy) {\n \/\/ FIXME -- not safe if the visitor resurrects the node (which it shouldn't)\n \/\/ if (copy->id == IR::Node::currentId - 1)\n \/\/ --IR::Node::currentId;\n if (!preorder_result) {\n prune_flag = true;\n } else if (visited->done(preorder_result) && visitDagOnce) {\n final = visited->result(preorder_result);\n prune_flag = true;\n } else {\n preorder_result_track = visited->track(preorder_result);\n visited->start(preorder_result_track);\n local.current.node = copy = preorder_result->clone(); } }\n if (!prune_flag) {\n copy->visit_children(*this);\n final = copy->apply_visitor_postorder(*this); }\n if (final && final != preorder_result && *final == *preorder_result)\n final = preorder_result;\n if (visited->finish(track, n, final) && (n = final))\n final->validate();\n if (preorder_result_track)\n visited->finish(preorder_result_track, preorder_result, final); } }\n if (ctxt)\n ctxt->child_index++;\n else\n visited = nullptr;\n return n;\n}\n\nvoid Inspector::revisit_visited() {\n for (auto it = visited->begin(); it != visited->end();) {\n if (it->second)\n it = visited->erase(it);\n else\n ++it; }\n}\nvoid Modifier::revisit_visited() {\n visited->revisit_visited();\n}\nvoid Transform::revisit_visited() {\n visited->revisit_visited();\n}\n\n#define DEFINE_VISIT_FUNCTIONS(CLASS, BASE) \\\nbool Modifier::preorder(IR::CLASS *n) { \\\n return preorder(static_cast<IR::BASE *>(n)); } \\\nvoid Modifier::postorder(IR::CLASS *n) { \\\n postorder(static_cast<IR::BASE *>(n)); } \\\nvoid Modifier::revisit(const IR::CLASS *o, const IR::CLASS *n) { \\\n revisit(static_cast<const IR::BASE *>(o), static_cast<const IR::BASE *>(n)); } \\\nbool Inspector::preorder(const IR::CLASS *n) { \\\n return preorder(static_cast<const IR::BASE *>(n)); } \\\nvoid Inspector::postorder(const IR::CLASS *n) { \\\n postorder(static_cast<const IR::BASE *>(n)); } \\\nvoid Inspector::revisit(const IR::CLASS *n) { \\\n revisit(static_cast<const IR::BASE *>(n)); } \\\nconst IR::Node *Transform::preorder(IR::CLASS *n) { \\\n return preorder(static_cast<IR::BASE *>(n)); } \\\nconst IR::Node *Transform::postorder(IR::CLASS *n) { \\\n return postorder(static_cast<IR::BASE *>(n)); } \\\nvoid Transform::revisit(const IR::CLASS *o, const IR::Node *n) { \\\n return revisit(static_cast<const IR::BASE *>(o), n); } \\\n\nIRNODE_ALL_SUBCLASSES(DEFINE_VISIT_FUNCTIONS)\n\nclass SetupJoinPoints : public Inspector {\n map<const IR::Node *, std::pair<ControlFlowVisitor *, int>> &join_points;\n bool preorder(const IR::Node *n) override {\n return ++join_points[n].second == 1; }\n public:\n explicit SetupJoinPoints(decltype(join_points) &fjp)\n : join_points(fjp) { visitDagOnce = false; }\n};\n\nvoid ControlFlowVisitor::init_join_flows(const IR::Node *root) {\n if (!dynamic_cast<Inspector *>(static_cast<Visitor *>(this)))\n BUG(\"joinFlows only works for Inspector passes currently, not Modifier or Transform\");\n if (flow_join_points)\n flow_join_points->clear();\n else\n flow_join_points = new std::remove_reference<decltype(*flow_join_points)>::type;\n root->apply(SetupJoinPoints(*flow_join_points));\n for (auto it = flow_join_points->begin(); it != flow_join_points->end(); ) {\n if (it->second.second > 1 && !filter_join_point(it->first)) {\n ++it;\n } else {\n it = flow_join_points->erase(it); } }\n}\n\nbool ControlFlowVisitor::join_flows(const IR::Node *n) {\n if (flow_join_points && flow_join_points->count(n)) {\n auto &status = flow_join_points->at(n);\n if (!--status.second) {\n flow_merge(*status.first);\n return false;\n } else if (status.first) {\n status.first->flow_merge(*this);\n return true;\n } else {\n status.first = clone();\n return true; } }\n return false;\n}\n\nvoid Inspector::check_clone(const Visitor *v) {\n auto *t = dynamic_cast<const Inspector *>(v);\n BUG_CHECK(t && t->visited == visited, \"Clone failed to copy base object\");\n}\nvoid Modifier::check_clone(const Visitor *v) {\n auto *t = dynamic_cast<const Modifier *>(v);\n BUG_CHECK(t && t->visited == visited, \"Clone failed to copy base object\");\n}\nvoid Transform::check_clone(const Visitor *v) {\n auto *t = dynamic_cast<const Transform *>(v);\n BUG_CHECK(t && t->visited == visited, \"Clone failed to copy base object\");\n}\n\nControlFlowVisitor &ControlFlowVisitor::flow_clone() {\n auto *rv = clone();\n rv->check_clone(this);\n return *rv;\n}\n<|endoftext|>"} {"text":"<commit_before>\/*************************************************************************\n *\n * OpenOffice.org - a multi-platform office productivity suite\n *\n * $RCSfile: xmlbrsh.cxx,v $\n *\n * $Revision: 1.13 $\n *\n * last change: $Author: obo $ $Date: 2006-09-16 22:27: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\/\/ MARKER(update_precomp.py): autogen include statement, do not remove\n#include \"precompiled_sw.hxx\"\n\n\n\n#include \"hintids.hxx\"\n#include <tools\/debug.hxx>\n\n#ifndef _COM_SUN_STAR_IO_XOUTPUTSTREAM_HPP_\n#include <com\/sun\/star\/io\/XOutputStream.hpp>\n#endif\n\n#include <xmloff\/nmspmap.hxx>\n#include <xmloff\/xmlnmspe.hxx>\n#include <xmloff\/xmlimp.hxx>\n#include <xmloff\/xmltkmap.hxx>\n#ifndef _XMLOFF_XMLBASE64IMPORTCONTEXT_HXX\n#include <xmloff\/XMLBase64ImportContext.hxx>\n#endif\n#ifndef _GRFMGR_HXX \/\/autogen\n#include <goodies\/grfmgr.hxx>\n#endif\n\n#ifndef _SVX_UNOMID_HXX\n#include <svx\/unomid.hxx>\n#endif\n#ifndef _SVX_BRSHITEM_HXX\n#include <svx\/brshitem.hxx>\n#endif\n#ifndef _XMLOFF_XMLUCONV_HXX\n#include <xmloff\/xmluconv.hxx>\n#endif\n\n#include \"xmlbrshi.hxx\"\n#include \"xmlbrshe.hxx\"\n#include \"xmlexp.hxx\"\n#include \"xmlimpit.hxx\"\n#include \"xmlexpit.hxx\"\n\nusing namespace ::rtl;\nusing namespace ::com::sun::star;\nusing namespace ::com::sun::star::uno;\nusing namespace ::xmloff::token;\n\nenum SvXMLTokenMapAttrs\n{\n XML_TOK_BGIMG_HREF,\n XML_TOK_BGIMG_TYPE,\n XML_TOK_BGIMG_ACTUATE,\n XML_TOK_BGIMG_SHOW,\n XML_TOK_BGIMG_POSITION,\n XML_TOK_BGIMG_REPEAT,\n XML_TOK_BGIMG_FILTER,\n XML_TOK_NGIMG_END=XML_TOK_UNKNOWN\n};\n\nstatic __FAR_DATA SvXMLTokenMapEntry aBGImgAttributesAttrTokenMap[] =\n{\n { XML_NAMESPACE_XLINK, XML_HREF, XML_TOK_BGIMG_HREF },\n { XML_NAMESPACE_XLINK, XML_TYPE, XML_TOK_BGIMG_TYPE },\n { XML_NAMESPACE_XLINK, XML_ACTUATE, XML_TOK_BGIMG_ACTUATE },\n { XML_NAMESPACE_XLINK, XML_SHOW, XML_TOK_BGIMG_SHOW },\n { XML_NAMESPACE_STYLE, XML_POSITION, XML_TOK_BGIMG_POSITION },\n { XML_NAMESPACE_STYLE, XML_REPEAT, XML_TOK_BGIMG_REPEAT },\n { XML_NAMESPACE_STYLE, XML_FILTER_NAME, XML_TOK_BGIMG_FILTER },\n XML_TOKEN_MAP_END\n};\n\nTYPEINIT1( SwXMLBrushItemImportContext, SvXMLImportContext );\n\nvoid SwXMLBrushItemImportContext::ProcessAttrs(\n const Reference< xml::sax::XAttributeList >& xAttrList,\n const SvXMLUnitConverter& rUnitConv )\n{\n SvXMLTokenMap aTokenMap( aBGImgAttributesAttrTokenMap );\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 OUString aLocalName;\n sal_uInt16 nPrefix =\n GetImport().GetNamespaceMap().GetKeyByAttrName( rAttrName,\n &aLocalName );\n const OUString& rValue = xAttrList->getValueByIndex( i );\n\n switch( aTokenMap.Get( nPrefix, aLocalName ) )\n {\n case XML_TOK_BGIMG_HREF:\n SvXMLImportItemMapper::PutXMLValue(\n *pItem, GetImport().ResolveGraphicObjectURL( rValue,sal_False),\n MID_GRAPHIC_LINK, rUnitConv );\n break;\n case XML_TOK_BGIMG_TYPE:\n case XML_TOK_BGIMG_ACTUATE:\n case XML_TOK_BGIMG_SHOW:\n break;\n case XML_TOK_BGIMG_POSITION:\n SvXMLImportItemMapper::PutXMLValue(\n *pItem, rValue, MID_GRAPHIC_POSITION, rUnitConv );\n break;\n case XML_TOK_BGIMG_REPEAT:\n SvXMLImportItemMapper::PutXMLValue(\n *pItem, rValue, MID_GRAPHIC_REPEAT, rUnitConv );\n break;\n case XML_TOK_BGIMG_FILTER:\n SvXMLImportItemMapper::PutXMLValue(\n *pItem, rValue, MID_GRAPHIC_FILTER, rUnitConv );\n break;\n }\n }\n\n}\n\nSvXMLImportContext *SwXMLBrushItemImportContext::CreateChildContext(\n sal_uInt16 nPrefix, const OUString& rLocalName,\n const Reference< xml::sax::XAttributeList > & xAttrList )\n{\n SvXMLImportContext *pContext = 0;\n if( xmloff::token::IsXMLToken( rLocalName,\n xmloff::token::XML_BINARY_DATA ) )\n {\n if( !xBase64Stream.is() && !pItem->GetGraphicLink() )\n {\n const GraphicObject *pGrObj = pItem->GetGraphicObject();\n if( !pGrObj || GRAPHIC_NONE == pGrObj->GetType() )\n {\n xBase64Stream =\n GetImport().GetStreamForGraphicObjectURLFromBase64();\n if( xBase64Stream.is() )\n pContext = new XMLBase64ImportContext( GetImport(), nPrefix,\n rLocalName, xAttrList,\n xBase64Stream );\n }\n }\n }\n if( !pContext )\n {\n pContext = new SvXMLImportContext( GetImport(), nPrefix, rLocalName );\n }\n\n return pContext;\n}\n\nvoid SwXMLBrushItemImportContext::EndElement()\n{\n if( xBase64Stream.is() )\n {\n OUString sURL( GetImport().ResolveGraphicObjectURLFromBase64( xBase64Stream ) );\n xBase64Stream = 0;\n SvXMLImportItemMapper::PutXMLValue( *pItem, sURL, MID_GRAPHIC_LINK, GetImport().GetMM100UnitConverter() );\n }\n\n if( !(pItem->GetGraphicLink() || pItem->GetGraphic() ) )\n pItem->SetGraphicPos( GPOS_NONE );\n else if( GPOS_NONE == pItem->GetGraphicPos() )\n pItem->SetGraphicPos( GPOS_TILED );\n}\n\nSwXMLBrushItemImportContext::SwXMLBrushItemImportContext(\n SvXMLImport& rImport, sal_uInt16 nPrfx,\n const OUString& rLName,\n const Reference< xml::sax::XAttributeList >& xAttrList,\n const SvXMLUnitConverter& rUnitConv,\n const SvxBrushItem& rItem ) :\n SvXMLImportContext( rImport, nPrfx, rLName ),\n pItem( new SvxBrushItem( rItem ) )\n{\n \/\/ delete any grephic that is existing\n pItem->SetGraphicPos( GPOS_NONE );\n\n ProcessAttrs( xAttrList, rUnitConv );\n}\n\nSwXMLBrushItemImportContext::SwXMLBrushItemImportContext(\n SvXMLImport& rImport, sal_uInt16 nPrfx,\n const OUString& rLName,\n const Reference< xml::sax::XAttributeList > & xAttrList,\n const SvXMLUnitConverter& rUnitConv,\n sal_uInt16 nWhich ) :\n SvXMLImportContext( rImport, nPrfx, rLName ),\n pItem( new SvxBrushItem( nWhich ) )\n{\n ProcessAttrs( xAttrList, rUnitConv );\n}\n\nSwXMLBrushItemImportContext::~SwXMLBrushItemImportContext()\n{\n delete pItem;\n}\n\nSwXMLBrushItemExport::SwXMLBrushItemExport( SwXMLExport& rExp ) :\n rExport( rExp )\n{\n}\n\nSwXMLBrushItemExport::~SwXMLBrushItemExport()\n{\n}\n\n\nvoid SwXMLBrushItemExport::exportXML( const SvxBrushItem& rItem )\n{\n GetExport().CheckAttrList();\n\n OUString sValue, sURL;\n const SvXMLUnitConverter& rUnitConv = GetExport().GetTwipUnitConverter();\n if( SvXMLExportItemMapper::QueryXMLValue(\n rItem, sURL, MID_GRAPHIC_LINK, rUnitConv ) )\n {\n sValue = GetExport().AddEmbeddedGraphicObject( sURL );\n if( sValue.getLength() )\n {\n GetExport().AddAttribute( XML_NAMESPACE_XLINK, XML_HREF, sValue );\n GetExport().AddAttribute( XML_NAMESPACE_XLINK, XML_TYPE, XML_SIMPLE );\n \/\/ AddAttribute( XML_NAMESPACE_XLINK, XML_SHOW, ACP2WS(sXML_embed) );\n GetExport().AddAttribute( XML_NAMESPACE_XLINK, XML_ACTUATE, XML_ONLOAD );\n }\n\n if( SvXMLExportItemMapper::QueryXMLValue(\n rItem, sValue, MID_GRAPHIC_POSITION, rUnitConv ) )\n GetExport().AddAttribute( XML_NAMESPACE_STYLE, XML_POSITION, sValue );\n\n if( SvXMLExportItemMapper::QueryXMLValue(\n rItem, sValue, MID_GRAPHIC_REPEAT, rUnitConv ) )\n GetExport().AddAttribute( XML_NAMESPACE_STYLE, XML_REPEAT, sValue );\n\n if( SvXMLExportItemMapper::QueryXMLValue(\n rItem, sValue, MID_GRAPHIC_FILTER, rUnitConv ) )\n GetExport().AddAttribute( XML_NAMESPACE_STYLE, XML_FILTER_NAME, sValue );\n }\n\n {\n SvXMLElementExport aElem( GetExport(), XML_NAMESPACE_STYLE, XML_BACKGROUND_IMAGE,\n sal_True, sal_True );\n if( sURL.getLength() )\n {\n \/\/ optional office:binary-data\n GetExport().AddEmbeddedGraphicObjectAsBase64( sURL );\n }\n }\n}\n\n\n<commit_msg>INTEGRATION: CWS swwarnings (1.13.222); FILE MERGED 2007\/04\/11 07:03:10 tl 1.13.222.1: #i69287# warning-free code<commit_after>\/*************************************************************************\n *\n * OpenOffice.org - a multi-platform office productivity suite\n *\n * $RCSfile: xmlbrsh.cxx,v $\n *\n * $Revision: 1.14 $\n *\n * last change: $Author: hr $ $Date: 2007-09-27 10:09: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_sw.hxx\"\n\n\n\n#include \"hintids.hxx\"\n#include <tools\/debug.hxx>\n\n#ifndef _COM_SUN_STAR_IO_XOUTPUTSTREAM_HPP_\n#include <com\/sun\/star\/io\/XOutputStream.hpp>\n#endif\n\n#include <xmloff\/nmspmap.hxx>\n#include <xmloff\/xmlnmspe.hxx>\n#include <xmloff\/xmlimp.hxx>\n#include <xmloff\/xmltkmap.hxx>\n#ifndef _XMLOFF_XMLBASE64IMPORTCONTEXT_HXX\n#include <xmloff\/XMLBase64ImportContext.hxx>\n#endif\n#ifndef _GRFMGR_HXX \/\/autogen\n#include <goodies\/grfmgr.hxx>\n#endif\n\n#ifndef _SVX_UNOMID_HXX\n#include <svx\/unomid.hxx>\n#endif\n#ifndef _SVX_BRSHITEM_HXX\n#include <svx\/brshitem.hxx>\n#endif\n#ifndef _XMLOFF_XMLUCONV_HXX\n#include <xmloff\/xmluconv.hxx>\n#endif\n\n#include \"xmlbrshi.hxx\"\n#include \"xmlbrshe.hxx\"\n#include \"xmlexp.hxx\"\n#include \"xmlimpit.hxx\"\n#include \"xmlexpit.hxx\"\n\nusing namespace ::rtl;\nusing namespace ::com::sun::star;\nusing namespace ::com::sun::star::uno;\nusing namespace ::xmloff::token;\n\nenum SvXMLTokenMapAttrs\n{\n XML_TOK_BGIMG_HREF,\n XML_TOK_BGIMG_TYPE,\n XML_TOK_BGIMG_ACTUATE,\n XML_TOK_BGIMG_SHOW,\n XML_TOK_BGIMG_POSITION,\n XML_TOK_BGIMG_REPEAT,\n XML_TOK_BGIMG_FILTER,\n XML_TOK_NGIMG_END=XML_TOK_UNKNOWN\n};\n\nstatic __FAR_DATA SvXMLTokenMapEntry aBGImgAttributesAttrTokenMap[] =\n{\n { XML_NAMESPACE_XLINK, XML_HREF, XML_TOK_BGIMG_HREF },\n { XML_NAMESPACE_XLINK, XML_TYPE, XML_TOK_BGIMG_TYPE },\n { XML_NAMESPACE_XLINK, XML_ACTUATE, XML_TOK_BGIMG_ACTUATE },\n { XML_NAMESPACE_XLINK, XML_SHOW, XML_TOK_BGIMG_SHOW },\n { XML_NAMESPACE_STYLE, XML_POSITION, XML_TOK_BGIMG_POSITION },\n { XML_NAMESPACE_STYLE, XML_REPEAT, XML_TOK_BGIMG_REPEAT },\n { XML_NAMESPACE_STYLE, XML_FILTER_NAME, XML_TOK_BGIMG_FILTER },\n XML_TOKEN_MAP_END\n};\n\nTYPEINIT1( SwXMLBrushItemImportContext, SvXMLImportContext );\n\nvoid SwXMLBrushItemImportContext::ProcessAttrs(\n const Reference< xml::sax::XAttributeList >& xAttrList,\n const SvXMLUnitConverter& rUnitConv )\n{\n SvXMLTokenMap aTokenMap( aBGImgAttributesAttrTokenMap );\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 OUString aLocalName;\n sal_uInt16 nPrefix =\n GetImport().GetNamespaceMap().GetKeyByAttrName( rAttrName,\n &aLocalName );\n const OUString& rValue = xAttrList->getValueByIndex( i );\n\n switch( aTokenMap.Get( nPrefix, aLocalName ) )\n {\n case XML_TOK_BGIMG_HREF:\n SvXMLImportItemMapper::PutXMLValue(\n *pItem, GetImport().ResolveGraphicObjectURL( rValue,sal_False),\n MID_GRAPHIC_LINK, rUnitConv );\n break;\n case XML_TOK_BGIMG_TYPE:\n case XML_TOK_BGIMG_ACTUATE:\n case XML_TOK_BGIMG_SHOW:\n break;\n case XML_TOK_BGIMG_POSITION:\n SvXMLImportItemMapper::PutXMLValue(\n *pItem, rValue, MID_GRAPHIC_POSITION, rUnitConv );\n break;\n case XML_TOK_BGIMG_REPEAT:\n SvXMLImportItemMapper::PutXMLValue(\n *pItem, rValue, MID_GRAPHIC_REPEAT, rUnitConv );\n break;\n case XML_TOK_BGIMG_FILTER:\n SvXMLImportItemMapper::PutXMLValue(\n *pItem, rValue, MID_GRAPHIC_FILTER, rUnitConv );\n break;\n }\n }\n\n}\n\nSvXMLImportContext *SwXMLBrushItemImportContext::CreateChildContext(\n sal_uInt16 nPrefix, const OUString& rLocalName,\n const Reference< xml::sax::XAttributeList > & xAttrList )\n{\n SvXMLImportContext *pContext = 0;\n if( xmloff::token::IsXMLToken( rLocalName,\n xmloff::token::XML_BINARY_DATA ) )\n {\n if( !xBase64Stream.is() && !pItem->GetGraphicLink() )\n {\n const GraphicObject *pGrObj = pItem->GetGraphicObject();\n if( !pGrObj || GRAPHIC_NONE == pGrObj->GetType() )\n {\n xBase64Stream =\n GetImport().GetStreamForGraphicObjectURLFromBase64();\n if( xBase64Stream.is() )\n pContext = new XMLBase64ImportContext( GetImport(), nPrefix,\n rLocalName, xAttrList,\n xBase64Stream );\n }\n }\n }\n if( !pContext )\n {\n pContext = new SvXMLImportContext( GetImport(), nPrefix, rLocalName );\n }\n\n return pContext;\n}\n\nvoid SwXMLBrushItemImportContext::EndElement()\n{\n if( xBase64Stream.is() )\n {\n OUString sURL( GetImport().ResolveGraphicObjectURLFromBase64( xBase64Stream ) );\n xBase64Stream = 0;\n SvXMLImportItemMapper::PutXMLValue( *pItem, sURL, MID_GRAPHIC_LINK, GetImport().GetMM100UnitConverter() );\n }\n\n if( !(pItem->GetGraphicLink() || pItem->GetGraphic() ) )\n pItem->SetGraphicPos( GPOS_NONE );\n else if( GPOS_NONE == pItem->GetGraphicPos() )\n pItem->SetGraphicPos( GPOS_TILED );\n}\n\nSwXMLBrushItemImportContext::SwXMLBrushItemImportContext(\n SvXMLImport& rImport, sal_uInt16 nPrfx,\n const OUString& rLName,\n const Reference< xml::sax::XAttributeList >& xAttrList,\n const SvXMLUnitConverter& rUnitConv,\n const SvxBrushItem& rItem ) :\n SvXMLImportContext( rImport, nPrfx, rLName ),\n pItem( new SvxBrushItem( rItem ) )\n{\n \/\/ delete any grephic that is existing\n pItem->SetGraphicPos( GPOS_NONE );\n\n ProcessAttrs( xAttrList, rUnitConv );\n}\n\nSwXMLBrushItemImportContext::SwXMLBrushItemImportContext(\n SvXMLImport& rImport, sal_uInt16 nPrfx,\n const OUString& rLName,\n const Reference< xml::sax::XAttributeList > & xAttrList,\n const SvXMLUnitConverter& rUnitConv,\n sal_uInt16 nWhich ) :\n SvXMLImportContext( rImport, nPrfx, rLName ),\n pItem( new SvxBrushItem( nWhich ) )\n{\n ProcessAttrs( xAttrList, rUnitConv );\n}\n\nSwXMLBrushItemImportContext::~SwXMLBrushItemImportContext()\n{\n delete pItem;\n}\n\nSwXMLBrushItemExport::SwXMLBrushItemExport( SwXMLExport& rExp ) :\n rExport( rExp )\n{\n}\n\nSwXMLBrushItemExport::~SwXMLBrushItemExport()\n{\n}\n\n\nvoid SwXMLBrushItemExport::exportXML( const SvxBrushItem& rItem )\n{\n GetExport().CheckAttrList();\n\n OUString sValue, sURL;\n const SvXMLUnitConverter& rUnitConv = GetExport().GetTwipUnitConverter();\n if( SvXMLExportItemMapper::QueryXMLValue(\n rItem, sURL, MID_GRAPHIC_LINK, rUnitConv ) )\n {\n sValue = GetExport().AddEmbeddedGraphicObject( sURL );\n if( sValue.getLength() )\n {\n GetExport().AddAttribute( XML_NAMESPACE_XLINK, XML_HREF, sValue );\n GetExport().AddAttribute( XML_NAMESPACE_XLINK, XML_TYPE, XML_SIMPLE );\n \/\/ AddAttribute( XML_NAMESPACE_XLINK, XML_SHOW, ACP2WS(sXML_embed) );\n GetExport().AddAttribute( XML_NAMESPACE_XLINK, XML_ACTUATE, XML_ONLOAD );\n }\n\n if( SvXMLExportItemMapper::QueryXMLValue(\n rItem, sValue, MID_GRAPHIC_POSITION, rUnitConv ) )\n GetExport().AddAttribute( XML_NAMESPACE_STYLE, XML_POSITION, sValue );\n\n if( SvXMLExportItemMapper::QueryXMLValue(\n rItem, sValue, MID_GRAPHIC_REPEAT, rUnitConv ) )\n GetExport().AddAttribute( XML_NAMESPACE_STYLE, XML_REPEAT, sValue );\n\n if( SvXMLExportItemMapper::QueryXMLValue(\n rItem, sValue, MID_GRAPHIC_FILTER, rUnitConv ) )\n GetExport().AddAttribute( XML_NAMESPACE_STYLE, XML_FILTER_NAME, sValue );\n }\n\n {\n SvXMLElementExport aElem( GetExport(), XML_NAMESPACE_STYLE, XML_BACKGROUND_IMAGE,\n sal_True, sal_True );\n if( sURL.getLength() )\n {\n \/\/ optional office:binary-data\n GetExport().AddEmbeddedGraphicObjectAsBase64( sURL );\n }\n }\n}\n\n\n<|endoftext|>"} {"text":"<commit_before><commit_msg>fdo#34800 sw: small cleanup<commit_after><|endoftext|>"} {"text":"<commit_before>\r\n\/*\r\n * arg_test.cpp - Tests argument analyzer which is part of the test suite\r\n * of this project, and could extended further to be \r\n * user in other projects\r\n *\/\r\n \r\n#include \"test_suite.h\"\r\n \r\n\/*\r\n * TestArgBasic() - Tests basic functionality \r\n *\/\r\nvoid TestArgBasic() {\r\n PrintTestName(\"TestArgBasic\");\r\n \r\n int argc = 6;\r\n char v1[] = \"test\";\r\n char v2[] = \"-1\";\r\n char v3[] = \"--second_key=2nd_value\";\r\n char v4[] = \"-3\";\r\n char v5[] = \"--fourth_key\";\r\n char v6[] = \"--b\";\r\n \r\n char *argv[] = {v1, v2, v3, v4, v5, v6};\r\n \r\n Argv args{argc, argv};\r\n const auto &kv_map = args.GetKVMap();\r\n \r\n dbg_printf(\"kv_list content: \\n\");\r\n for(auto it = kv_map.begin();it != kv_map.end();it++) {\r\n dbg_printf(\"%s -> %s\\n\", it->first.c_str(), it->second.c_str());\r\n }\r\n \r\n const auto &arg_list = args.GetArgList();\r\n dbg_printf(\"arg_list content: \\n\");\r\n for(auto it = arg_list.begin();it != arg_list.end();it++) {\r\n dbg_printf(\"%s\\n\", it->c_str()); \r\n }\r\n \r\n return;\r\n}\r\n\r\nint main() {\r\n return 0; \r\n}\r\n<commit_msg>Adding arg test<commit_after>\r\n\/*\r\n * arg_test.cpp - Tests argument analyzer which is part of the test suite\r\n * of this project, and could extended further to be \r\n * user in other projects\r\n *\/\r\n \r\n#include \"test_suite.h\"\r\n \r\n\/*\r\n * TestArgBasic() - Tests basic functionality \r\n *\/\r\nvoid TestArgBasic() {\r\n PrintTestName(\"TestArgBasic\");\r\n \r\n char v1[] = \"test\";\r\n char v2[] = \"-1\";\r\n char v3[] = \"--second_key=2nd_value\";\r\n char v4[] = \"--3\";\r\n char v5[] = \"--fourth_key\";\r\n char vv[] = \"--\";\r\n char v6[] = \"--b=nonsense\";\r\n char v7[] = \"value_1\";\r\n char v8[] = \"value_2\";\r\n \r\n char *argv[] = {v1, v2, v3, v4, v5, vv, v6, v7, v8};\r\n int argc = static_cast<int>(sizeof(argv) \/ sizeof(char *));\r\n \r\n dbg_printf(\"*** Command line input: \\n\");\r\n dbg_printf(\"\");\r\n for(int i = 0;i < argc;i++) {\r\n printf(\"%s \", argv[i]);\r\n }\r\n putchar('\\n');\r\n \r\n Argv args{argc, argv};\r\n const auto &kv_map = args.GetKVMap();\r\n \r\n dbg_printf(\"*** kv_list content: \\n\\n\");\r\n for(auto it = kv_map.begin();it != kv_map.end();it++) {\r\n dbg_printf(\"%s -> %s\\n\", it->first.c_str(), it->second.c_str());\r\n }\r\n \r\n const auto &arg_list = args.GetArgList();\r\n dbg_printf(\"*** arg_list content: \\n\\n\");\r\n for(auto it = arg_list.begin();it != arg_list.end();it++) {\r\n dbg_printf(\"%s\\n\", it->c_str()); \r\n }\r\n \r\n return;\r\n}\r\n\r\nint main() {\r\n TestArgBasic();\r\n \r\n return 0; \r\n}\r\n<|endoftext|>"} {"text":"<commit_before>\/\/ g++ j.cc -o j -L\/usr\/local\/lib -lroaring\n#include <vector>\n#include <string>\n#include <array>\n#include <map>\n#include \"roaring.hh\"\n\nenum FieldType {\n TIMESTAMP,\n DIMENSION,\n BOOL,\n METRIC_INT,\n METRIC_FLOAT\n};\n\nclass FieldBase {};\n\ntemplate <FieldType, typename T>\nclass Field : FieldBase {\n private:\n std::string name;\n std::vector<T> vals;\n std::vector< std::vector<T> > mvals;\n std::map<T, Roaring *> dict_;\n Roaring *roar_;\n int count_;\n FieldType type_;\n public:\n Field(std::string name);\n void insert(T &val);\n std::map<std::string, Roaring *> &dict();\n Roaring *roar() {\n return roar_;\n }\n};\n\ntemplate <FieldType type, typename T>\nField<type, T>::Field(std::string name):\n type_(type), name(name) {\n switch (type) {\n case METRIC_INT:\n case METRIC_FLOAT: {\n } break;\n default:\n throw std::runtime_error(\"invalid field type for Field<>\");\n }\n}\n\ntemplate <>\nField<DIMENSION, std::string>::Field(std::string name):\n type_(DIMENSION), name(name) {\n \/\/ switch (type) {\n \/\/ case DIMENSION: {\n \/\/ } break;\n \/\/ default:\n \/\/ throw std::runtime_error(\"invalid field type for string\");\n \/\/ }\n}\n\ntemplate <>\nField<TIMESTAMP, int64_t>::Field(std::string name):\n type_(TIMESTAMP), name(name) {\n \/\/ switch (type) {\n \/\/ case TIMESTAMP: {\n \/\/ } break;\n \/\/ default:\n \/\/ throw std::runtime_error(\"invalid field type for int64\");\n \/\/ }\n}\n\ntemplate <>\nField<BOOL, bool>::Field(std::string name):\n type_(BOOL), name(name) {\n roar_ = new Roaring();\n \/\/ switch (type) {\n \/\/ case BOOL: {\n \/\/ roar_ = new Roaring();\n \/\/ } break;\n \/\/ default:\n \/\/ throw std::runtime_error(\"invalid field type for bool\");\n \/\/ }\n}\n\ntemplate <FieldType type, typename T>\nvoid Field<type, T>::insert(T &val) {\n switch (type_) {\n case TIMESTAMP:\n case METRIC_INT:\n case METRIC_FLOAT: {\n vals.push_back(val);\n } break;\n case DIMENSION: {\n Roaring *roar;\n if (dict_.count(val) > 0) {\n roar = dict_[val];\n } else {\n roar = new Roaring();\n dict_[val] = roar;\n }\n roar->add(count_);\n } break;\n default:\n throw std::runtime_error(\"can not insert val to field with unknown type\");\n }\n\n count_++;\n}\n\ntemplate<>\nstd::map<std::string, Roaring *> &Field<DIMENSION, std::string>::dict() {\n return dict_;\n}\n\nclass DimensionField {\n public:\n Field<DIMENSION, std::string> *strdim;\n Field<BOOL, bool> *booldim;\n bool isBoolDim;\n DimensionField(Field<DIMENSION, std::string> *strdim_): strdim(strdim_), isBoolDim(false) {}\n DimensionField(Field<BOOL, bool> *booldim_): booldim(booldim_), isBoolDim(true) {}\n};\n\nclass Query {\n private:\n public:\n Query();\n ~Query();\n};\n\nstruct GroupByResult {\n std::vector<std::string> key;\n Roaring roaring;\n};\n\nstatic void genGroups(std::vector<GroupByResult> &groups, std::vector<std::string> &groupByKeys, std::map<std::string, FieldBase*> &fields, std::vector<std::string> currKey, int index) {\n bool genGroup = index == (groupByKeys.size() - 1);\n std::string key = groupByKeys[index];\n FieldBase *fieldRef = fields[key];\n Field<DIMENSION, std::string> *field = (Field<DIMENSION, std::string> *)fieldRef;\n std::map<std::string, Roaring *> &dict = field->dict();\n for (std::map<std::string, Roaring *>::iterator it = dict.begin(); it != dict.end(); it++) {}\n}\n\nstd::vector<GroupByResult> genGroupByResult(std::vector<std::string> &groupByKeys, std::map<std::string, FieldBase*> &fields) {\n std::vector<GroupByResult> groups;\n genGroups(groups, groupByKeys, fields, std::vector<std::string>(), 0);\n return groups;\n}\n\nint main(int argc, char *argv[]) {\n Field<TIMESTAMP, int64_t> *timestamp = new Field<TIMESTAMP, int64_t>(\"timestamp\");\n Field<DIMENSION, std::string> *publisher = new Field<DIMENSION, std::string>(\"publisher\");\n Field<DIMENSION, std::string> *advertiser = new Field<DIMENSION, std::string>(\"advertiser\");\n Field<DIMENSION, std::string> *gender = new Field<DIMENSION, std::string>(\"gender\");\n Field<DIMENSION, std::string> *country = new Field<DIMENSION, std::string>(\"country\");\n Field<BOOL, bool> *click = new Field<BOOL, bool>(\"click\");\n Field<METRIC_FLOAT, float> *price = new Field<METRIC_FLOAT, float>(\"price\");\n std::map<std::string, FieldBase*> fields;\n\n fields[\"timestamp\"] = (FieldBase*)timestamp;\n fields[\"publisher\"] = (FieldBase*)publisher;\n fields[\"advertiser\"] = (FieldBase*)advertiser;\n fields[\"gender\"] = (FieldBase*)gender;\n fields[\"country\"] = (FieldBase*)country;\n fields[\"click\"] = (FieldBase*)click;\n fields[\"price\"] = (FieldBase*)price;\n\n \/\/ select count(*) from logs where click = 1 group by country,gender\n {\n \/\/ generate new bitmap of all elements. so we need segment wide count variable\n int count = 3;\n Roaring roar(roaring_bitmap_from_range(0, count, 1));\n\n \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n \/\/\/\/\/\/\/\/\/\/\/ FILTERING STATE \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n \/\/ do bitwise AND with click = 1\n \/\/ roar.printf();\n roar &= click->roar();\n \/\/ roar.printf();\n\n \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n \/\/\/\/\/\/\/\/\/\/\/ GROUPING STATE \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n \/\/ generate groups for every group by term\n std::vector< GroupByResult > groups;\n std::vector<std::string> groupByKeys;\n groupByKeys.push_back(\"advertiser\");\n groupByKeys.push_back(\"gender\");\n groupByKeys.push_back(\"country\");\n }\n\n return 0;\n}\n\n\n<commit_msg>generate GroupByResult struct by grouping keys and their values<commit_after>\/\/ g++ j.cc -o j -L\/usr\/local\/lib -lroaring\n#include <vector>\n#include <string>\n#include <array>\n#include <map>\n#include \"roaring.hh\"\n\nenum FieldType {\n TIMESTAMP,\n DIMENSION,\n BOOL,\n METRIC_INT,\n METRIC_FLOAT\n};\n\nclass FieldBase {};\n\ntemplate <FieldType, typename T>\nclass Field : FieldBase {\n private:\n std::string name;\n std::vector<T> vals;\n std::vector< std::vector<T> > mvals;\n std::map<T, Roaring *> dict_;\n Roaring *roar_;\n int count_;\n FieldType type_;\n public:\n Field(std::string name);\n void insert(T &val);\n std::map<std::string, Roaring *> &dict();\n Roaring *roar() {\n return roar_;\n }\n};\n\ntemplate <FieldType type, typename T>\nField<type, T>::Field(std::string name):\n type_(type), name(name) {\n switch (type) {\n case METRIC_INT:\n case METRIC_FLOAT: {\n } break;\n default:\n throw std::runtime_error(\"invalid field type for Field<>\");\n }\n}\n\ntemplate <>\nField<DIMENSION, std::string>::Field(std::string name):\n type_(DIMENSION), name(name) {\n \/\/ switch (type) {\n \/\/ case DIMENSION: {\n \/\/ } break;\n \/\/ default:\n \/\/ throw std::runtime_error(\"invalid field type for string\");\n \/\/ }\n}\n\ntemplate <>\nField<TIMESTAMP, int64_t>::Field(std::string name):\n type_(TIMESTAMP), name(name) {\n \/\/ switch (type) {\n \/\/ case TIMESTAMP: {\n \/\/ } break;\n \/\/ default:\n \/\/ throw std::runtime_error(\"invalid field type for int64\");\n \/\/ }\n}\n\ntemplate <>\nField<BOOL, bool>::Field(std::string name):\n type_(BOOL), name(name) {\n roar_ = new Roaring();\n \/\/ switch (type) {\n \/\/ case BOOL: {\n \/\/ roar_ = new Roaring();\n \/\/ } break;\n \/\/ default:\n \/\/ throw std::runtime_error(\"invalid field type for bool\");\n \/\/ }\n}\n\ntemplate <FieldType type, typename T>\nvoid Field<type, T>::insert(T &val) {\n switch (type_) {\n case TIMESTAMP:\n case METRIC_INT:\n case METRIC_FLOAT: {\n vals.push_back(val);\n } break;\n case DIMENSION: {\n Roaring *roar;\n if (dict_.count(val) > 0) {\n roar = dict_[val];\n } else {\n roar = new Roaring();\n dict_[val] = roar;\n }\n roar->add(count_);\n } break;\n default:\n throw std::runtime_error(\"can not insert val to field with unknown type\");\n }\n\n count_++;\n}\n\ntemplate<>\nstd::map<std::string, Roaring *> &Field<DIMENSION, std::string>::dict() {\n return dict_;\n}\n\nclass DimensionField {\n public:\n Field<DIMENSION, std::string> *strdim;\n Field<BOOL, bool> *booldim;\n bool isBoolDim;\n DimensionField(Field<DIMENSION, std::string> *strdim_): strdim(strdim_), isBoolDim(false) {}\n DimensionField(Field<BOOL, bool> *booldim_): booldim(booldim_), isBoolDim(true) {}\n};\n\nclass Query {\n private:\n public:\n Query();\n ~Query();\n};\n\nstruct GroupByResult {\n std::vector<std::string> key;\n Roaring roaring;\n};\n\nstatic void genGroups(std::vector<GroupByResult> &groups, std::vector<std::string> &groupByKeys, std::map<std::string, FieldBase*> &fields, std::vector<std::string> currKey, int index) {\n bool genGroup = index == (groupByKeys.size() - 1);\n std::string key = groupByKeys[index];\n FieldBase *fieldRef = fields[key];\n Field<DIMENSION, std::string> *field = (Field<DIMENSION, std::string> *)fieldRef;\n std::map<std::string, Roaring *> &dict = field->dict();\n for (std::map<std::string, Roaring *>::iterator it = dict.begin(); it != dict.end(); it++) {\n std::vector<std::string> groupKey = currKey;\n groupKey.push_back(it->first);\n\n if (genGroup) {\n GroupByResult gres;\n gres.key = groupKey;\n groups.push_back(gres);\n } else {\n genGroups(groups, groupByKeys, fields, groupKey, index + 1);\n }\n }\n}\n\nstd::vector<GroupByResult> genGroupByResult(std::vector<std::string> &groupByKeys, std::map<std::string, FieldBase*> &fields) {\n std::vector<GroupByResult> groups;\n genGroups(groups, groupByKeys, fields, std::vector<std::string>(), 0);\n return groups;\n}\n\nint main(int argc, char *argv[]) {\n Field<TIMESTAMP, int64_t> *timestamp = new Field<TIMESTAMP, int64_t>(\"timestamp\");\n Field<DIMENSION, std::string> *publisher = new Field<DIMENSION, std::string>(\"publisher\");\n Field<DIMENSION, std::string> *advertiser = new Field<DIMENSION, std::string>(\"advertiser\");\n Field<DIMENSION, std::string> *gender = new Field<DIMENSION, std::string>(\"gender\");\n Field<DIMENSION, std::string> *country = new Field<DIMENSION, std::string>(\"country\");\n Field<BOOL, bool> *click = new Field<BOOL, bool>(\"click\");\n Field<METRIC_FLOAT, float> *price = new Field<METRIC_FLOAT, float>(\"price\");\n std::map<std::string, FieldBase*> fields;\n\n fields[\"timestamp\"] = (FieldBase*)timestamp;\n fields[\"publisher\"] = (FieldBase*)publisher;\n fields[\"advertiser\"] = (FieldBase*)advertiser;\n fields[\"gender\"] = (FieldBase*)gender;\n fields[\"country\"] = (FieldBase*)country;\n fields[\"click\"] = (FieldBase*)click;\n fields[\"price\"] = (FieldBase*)price;\n\n \/\/ select count(*) from logs where click = 1 group by country,gender\n {\n \/\/ generate new bitmap of all elements. so we need segment wide count variable\n int count = 3;\n Roaring roar(roaring_bitmap_from_range(0, count, 1));\n\n \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n \/\/\/\/\/\/\/\/\/\/\/ FILTERING STATE \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n \/\/ do bitwise AND with click = 1\n \/\/ roar.printf();\n roar &= click->roar();\n \/\/ roar.printf();\n\n \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n \/\/\/\/\/\/\/\/\/\/\/ GROUPING STATE \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n \/\/ generate groups for every group by term\n std::vector< GroupByResult > groups;\n std::vector<std::string> groupByKeys;\n groupByKeys.push_back(\"advertiser\");\n groupByKeys.push_back(\"gender\");\n groupByKeys.push_back(\"country\");\n }\n\n return 0;\n}\n\n\n<|endoftext|>"} {"text":"<commit_before>\/*\n** Copyright (C) 1999-2012 Erik de Castro Lopo <erikd@mega-nerd.com>\n**\n** All rights reserved.\n**\n** Redistribution and use in source and binary forms, with or without\n** modification, are permitted provided that the following conditions are\n** met:\n**\n** * Redistributions of source code must retain the above copyright\n** notice, this list of conditions and the following disclaimer.\n** * Redistributions in binary form must reproduce the above copyright\n** notice, this list of conditions and the following disclaimer in\n** the documentation and\/or other materials provided with the\n** distribution.\n** * Neither the author nor the names of any contributors may be used\n** to endorse or promote products derived from this software without\n** specific prior written permission.\n**\n** THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS\n** \"AS IS\" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED\n** TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR\n** PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE 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 PROFITS;\n** OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY,\n** WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR\n** OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF\n** ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.\n*\/\n\n#include <cmath>\n#include <cstdio>\n#include <cstdlib>\n#include <cstring>\n\n#include <sndfile.h>\n\nint main() {\n const double pi = 3.14159265358979323846264338;\n const double freq = 440.0;\n const double duration = 1\/freq;\n const int channels = 1;\n const int samplerate = 48000;\n const double sample_duration = 1.0\/samplerate;\n const int sample_count = samplerate * duration;\n \/\/ 0x2F000000 => 788529152\n const double amplitude = 1.0 * 0x2F000000;\n\n printf(\"duration=%f\\n\", duration);\n printf(\"channels=%d\\n\", channels);\n printf(\"samplerate=%d\\n\", samplerate);\n printf(\"sample_count=%d\\n\", sample_count);\n printf(\"sample_duration=%f\\n\", sample_duration);\n printf(\"amplitude=%f\\n\", amplitude);\n printf(\"freq=%f\\n\", freq);\n\n SNDFILE *file;\n SF_INFO sfinfo;\n int *buffer;\n\n if (!(buffer = static_cast<int *>(malloc(2 * sample_count * sizeof *buffer)))) {\n printf(\"Error : Malloc failed.\\n\");\n return 1;\n };\n\n memset(&sfinfo, 0, sizeof(sfinfo));\n\n sfinfo.samplerate = samplerate;\n sfinfo.frames = sample_count;\n sfinfo.channels = channels;\n sfinfo.format = (SF_FORMAT_WAV | SF_FORMAT_PCM_32);\n\n if (!(file = sf_open(\"sine.wav\", SFM_WRITE, &sfinfo))) {\n printf(\"Error : Not able to open output file.\\n\");\n free(buffer);\n return 1;\n };\n\n if (sfinfo.channels == 1) {\n for (int k = 0; k < sample_count; k++) {\n buffer[k] = amplitude * sin(freq * 2 * k * pi \/ samplerate);\n printf(\"%d: %f: %d\\n\", k, sample_duration*k, buffer[k]);\n }\n } else {\n printf(\"Error : make_sine can only generate mono files.\\n\");\n\tsf_close(file);\n\tfree(buffer);\n return 1;\n };\n\n if (sf_write_int(file, buffer, sfinfo.channels * sample_count) !=\n sfinfo.channels * sample_count)\n puts(sf_strerror(file));\n\n sf_close(file);\n free(buffer);\n return 0;\n} \/* main *\/\n<commit_msg>Use a SndfileHandle.<commit_after>\/*\n** Copyright (C) 1999-2012 Erik de Castro Lopo <erikd@mega-nerd.com>\n**\n** All rights reserved.\n**\n** Redistribution and use in source and binary forms, with or without\n** modification, are permitted provided that the following conditions are\n** met:\n**\n** * Redistributions of source code must retain the above copyright\n** notice, this list of conditions and the following disclaimer.\n** * Redistributions in binary form must reproduce the above copyright\n** notice, this list of conditions and the following disclaimer in\n** the documentation and\/or other materials provided with the\n** distribution.\n** * Neither the author nor the names of any contributors may be used\n** to endorse or promote products derived from this software without\n** specific prior written permission.\n**\n** THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS\n** \"AS IS\" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED\n** TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR\n** PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE 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 PROFITS;\n** OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY,\n** WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR\n** OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF\n** ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.\n*\/\n\n#include <cmath>\n#include <cstdio>\n#include <cstdlib>\n#include <cstring>\n\n#include <sndfile.hh>\n\nint main() {\n const char * filename = \"sine.wav\";\n const double pi = 3.14159265358979323846264338;\n const double freq = 440.0;\n const double duration = 1\/freq;\n const int channels = 1;\n const int samplerate = 48000;\n const double sample_duration = 1.0\/samplerate;\n const int sample_count = samplerate * duration;\n \/\/ 0x2F000000 => 788529152\n const double amplitude = 1.0 * 0x2F000000;\n\n printf(\"duration=%f\\n\", duration);\n printf(\"channels=%d\\n\", channels);\n printf(\"samplerate=%d\\n\", samplerate);\n printf(\"sample_count=%d\\n\", sample_count);\n printf(\"sample_duration=%f\\n\", sample_duration);\n printf(\"amplitude=%f\\n\", amplitude);\n printf(\"freq=%f\\n\", freq);\n\n SndfileHandle sndfilehandle(filename, SFM_WRITE, (SF_FORMAT_WAV | SF_FORMAT_PCM_32), channels, samplerate);\n\n int *buffer;\n if (!(buffer = static_cast<int *>(malloc(2 * sample_count * sizeof *buffer)))) {\n printf(\"Error : Malloc failed.\\n\");\n return 1;\n };\n\n if (sndfilehandle.channels() == 1) {\n for (int k = 0; k < sample_count; k++) {\n buffer[k] = amplitude * sin(freq * 2 * k * pi \/ samplerate);\n printf(\"%d: %f: %d\\n\", k, sample_duration*k, buffer[k]);\n }\n } else {\n printf(\"Error : make_sine can only generate mono files.\\n\");\n\tfree(buffer);\n return 1;\n };\n\n sndfilehandle.write(buffer, sndfilehandle.channels() * sample_count);\n\n free(buffer);\n return 0;\n} \/* main *\/\n<|endoftext|>"} {"text":"<commit_before>#include <cstdio>\n#include <vector>\n#include <stack>\n#include <algorithm>\n#include <memory>\n\n\nnamespace Frogs\n{\n enum class Frog { None, Brown, Green };\n enum class Step { None, JumpLeft, LeapLeft, JumpRight, LeapRight };\n\n class State\n {\n std::vector<Frog> lilies;\n int count, blankPos;\n\n public:\n State(): count(0), blankPos(-1)\n {\n }\n State(int count): lilies(2 * count + 1), count(count), blankPos(count)\n {\n for (int i = 0; i < count; ++i)\n {\n lilies[i] = Frog::Brown;\n lilies[2 * count - i] = Frog::Green;\n }\n\n lilies[blankPos] = Frog::None;\n }\n\n bool operator==(const State& other) const\n {\n return count == other.count && lilies == other.lilies && blankPos == other.blankPos;\n }\n\n bool IsStuckJumpLeft() const { return blankPos >= (int)lilies.size() - 1 || lilies[blankPos + 1] != Frog::Green; }\n bool IsStuckLeapLeft() const { return blankPos >= (int)lilies.size() - 2 || lilies[blankPos + 2] != Frog::Green; }\n bool IsStuckJumpRight() const { return blankPos < 1 || lilies[blankPos - 1] != Frog::Brown; }\n bool IsStuckLeapRight() const { return blankPos < 2 || lilies[blankPos - 2] != Frog::Brown; }\n\n bool WasTargetReached() const\n {\n for (int i = 0; i < count; ++i)\n if (lilies[i] != Frog::Green || lilies[2 * count - i] != Frog::Brown)\n return false;\n\n return lilies[count] == Frog::None;\n }\n\n std::shared_ptr<State> Move(Step step) const\n {\n bool canMove = false;\n auto moved = std::make_shared<State>(*this);\n\n switch (step)\n {\n case Step::JumpLeft:\n if (!moved->IsStuckJumpLeft())\n {\n moved->lilies[moved->blankPos] = Frog::Green;\n moved->blankPos++;\n canMove = true;\n }\n break;\n\n case Step::LeapLeft:\n if (!moved->IsStuckLeapLeft())\n {\n moved->lilies[moved->blankPos] = Frog::Green;\n moved->blankPos += 2;\n canMove = true;\n }\n break;\n\n case Step::JumpRight:\n if (!moved->IsStuckJumpRight())\n {\n moved->lilies[moved->blankPos] = Frog::Brown;\n moved->blankPos--;\n canMove = true;\n }\n break;\n\n case Step::LeapRight:\n if (!moved->IsStuckLeapRight())\n {\n moved->lilies[moved->blankPos] = Frog::Brown;\n moved->blankPos -= 2;\n canMove = true;\n }\n break;\n\n default:\n break;\n }\n\n if (canMove)\n moved->lilies[moved->blankPos] = Frog::None;\n return canMove ? moved : nullptr;\n }\n\n void Print() const\n {\n for (const auto& frog: lilies)\n switch (frog)\n {\n case Frog::Brown:\n printf(\">\");\n break;\n\n case Frog::Green:\n printf(\"<\");\n break;\n\n case Frog::None:\n printf(\"_\");\n break;\n }\n\n printf(\"\\n\");\n }\n };\n}\n\nint main()\n{\n int count;\n scanf(\"%u\", &count);\n\n if (count < 0)\n return 1;\n\n std::vector<std::shared_ptr<Frogs::State> > visited;\n std::stack<std::shared_ptr<Frogs::State> > trace;\n trace.push(std::make_shared<Frogs::State>(count));\n\n while (!trace.empty() && !trace.top()->WasTargetReached())\n {\n auto state = trace.top();\n trace.pop();\n\n auto move = [&](Frogs::Step step)\n {\n auto newState = state->Move(step);\n if (newState)\n trace.push(newState);\n };\n\n if (!state)\n continue;\n\n if (visited.crend() == std::find(visited.crbegin(), visited.crend(), state))\n {\n visited.push_back(state);\n move(Frogs::Step::JumpLeft);\n move(Frogs::Step::LeapLeft);\n move(Frogs::Step::JumpRight);\n move(Frogs::Step::LeapRight);\n\n state->Print();\n }\n }\n\n if (!trace.empty())\n trace.top()->Print();\n\n return 0;\n}\n<commit_msg>frogs: dropped a redundant check<commit_after>#include <cstdio>\n#include <vector>\n#include <stack>\n#include <algorithm>\n#include <memory>\n\n\nnamespace Frogs\n{\n enum class Frog { None, Brown, Green };\n enum class Step { None, JumpLeft, LeapLeft, JumpRight, LeapRight };\n\n class State\n {\n std::vector<Frog> lilies;\n int count, blankPos;\n\n public:\n State(): count(0), blankPos(-1)\n {\n }\n State(int count): lilies(2 * count + 1), count(count), blankPos(count)\n {\n for (int i = 0; i < count; ++i)\n {\n lilies[i] = Frog::Brown;\n lilies[2 * count - i] = Frog::Green;\n }\n\n lilies[blankPos] = Frog::None;\n }\n\n bool operator==(const State& other) const\n {\n return count == other.count && lilies == other.lilies && blankPos == other.blankPos;\n }\n\n bool IsStuckJumpLeft() const { return blankPos >= (int)lilies.size() - 1 || lilies[blankPos + 1] != Frog::Green; }\n bool IsStuckLeapLeft() const { return blankPos >= (int)lilies.size() - 2 || lilies[blankPos + 2] != Frog::Green; }\n bool IsStuckJumpRight() const { return blankPos < 1 || lilies[blankPos - 1] != Frog::Brown; }\n bool IsStuckLeapRight() const { return blankPos < 2 || lilies[blankPos - 2] != Frog::Brown; }\n\n bool WasTargetReached() const\n {\n for (int i = 0; i < count; ++i)\n if (lilies[i] != Frog::Green || lilies[2 * count - i] != Frog::Brown)\n return false;\n\n return lilies[count] == Frog::None;\n }\n\n std::shared_ptr<State> Move(Step step) const\n {\n bool canMove = false;\n auto moved = std::make_shared<State>(*this);\n\n switch (step)\n {\n case Step::JumpLeft:\n if (!moved->IsStuckJumpLeft())\n {\n moved->lilies[moved->blankPos] = Frog::Green;\n moved->blankPos++;\n canMove = true;\n }\n break;\n\n case Step::LeapLeft:\n if (!moved->IsStuckLeapLeft())\n {\n moved->lilies[moved->blankPos] = Frog::Green;\n moved->blankPos += 2;\n canMove = true;\n }\n break;\n\n case Step::JumpRight:\n if (!moved->IsStuckJumpRight())\n {\n moved->lilies[moved->blankPos] = Frog::Brown;\n moved->blankPos--;\n canMove = true;\n }\n break;\n\n case Step::LeapRight:\n if (!moved->IsStuckLeapRight())\n {\n moved->lilies[moved->blankPos] = Frog::Brown;\n moved->blankPos -= 2;\n canMove = true;\n }\n break;\n\n default:\n break;\n }\n\n if (canMove)\n moved->lilies[moved->blankPos] = Frog::None;\n return canMove ? moved : nullptr;\n }\n\n void Print() const\n {\n for (const auto& frog: lilies)\n switch (frog)\n {\n case Frog::Brown:\n printf(\">\");\n break;\n\n case Frog::Green:\n printf(\"<\");\n break;\n\n case Frog::None:\n printf(\"_\");\n break;\n }\n\n printf(\"\\n\");\n }\n };\n}\n\nint main()\n{\n int count;\n scanf(\"%u\", &count);\n\n if (count < 0)\n return 1;\n\n std::vector<std::shared_ptr<Frogs::State> > visited;\n std::stack<std::shared_ptr<Frogs::State> > trace;\n trace.push(std::make_shared<Frogs::State>(count));\n\n while (!trace.empty() && !trace.top()->WasTargetReached())\n {\n auto state = trace.top();\n trace.pop();\n\n auto move = [&](Frogs::Step step)\n {\n auto newState = state->Move(step);\n if (newState)\n trace.push(newState);\n };\n\n if (visited.crend() == std::find(visited.crbegin(), visited.crend(), state))\n {\n visited.push_back(state);\n move(Frogs::Step::JumpLeft);\n move(Frogs::Step::LeapLeft);\n move(Frogs::Step::JumpRight);\n move(Frogs::Step::LeapRight);\n\n state->Print();\n }\n }\n\n if (!trace.empty())\n trace.top()->Print();\n\n return 0;\n}\n<|endoftext|>"} {"text":"<commit_before>#include <iostream>\n#include <iomanip>\n#include <fstream>\n#include <sstream>\n#include <array>\n#include <vector>\n#include <set>\n#include <map>\n#include <random>\n#include <chrono>\n#include <functional>\n#include <algorithm>\n\n#include <cmath>\n\n#define NUM_FIELDS 16\n\n\nusing Entry = std::array<double, NUM_FIELDS>;\n\nint main(int argc, char** argv)\n{\n \/\/ smoothing factor\n const double alpha = 1.0;\n \/\/ decision rule\n const int decision = 1;\n\n if (argc < 2)\n return 1;\n\n \/\/ preparing data\n int total = 0, correct = 0, totalClassified = 0;\n std::map<std::string, std::vector<Entry> > data;\n std::map<std::string, int> n;\n std::map<std::string, double> priors;\n std::map<std::string, std::vector<double> > multinomialLikelihoods;\n std::map<std::string, int> multinomialSums;\n std::map<std::string, Entry > sumX;\n std::map<std::string, std::vector<double> > means;\n std::map<std::string, std::vector<double> > variances;\n\n auto classify = [&](const std::string& label, const Entry& entry)\n {\n std::string predlabel;\n double maxlikelihood = 0.0;\n double denom = 0.0;\n std::vector<double> probs;\n for (auto it = priors.begin(); it != priors.end(); it++)\n {\n double numer = priors[it->first];\n const auto& firstMultinomialLikelihood = multinomialLikelihoods[it->first];\n const auto& firstMean = means[it->first];\n const auto& firstVariance = variances[it->first];\n for (int j = 0; j < NUM_FIELDS; j++)\n switch (decision)\n {\n case 2:\n \/\/ Multinomial\n if (entry[j])\n numer *= pow(firstMultinomialLikelihood[j], entry[j]);\n break;\n\n case 3:\n \/\/ Bernoulli\n numer *= pow(firstMean[j], entry[j]) * pow(1.0 - firstMean[j], 1.0 - entry[j]);\n break;\n\n default:\n \/\/ Gaussian\n numer *= 1 \/ sqrt(2 * M_PI * firstVariance[j]) * exp((-1 * (entry[j] - firstMean[j]) * (entry[j] -firstMean[j])) \/ (2 * firstVariance[j]));\n break;\n }\n\n if (numer > maxlikelihood)\n {\n maxlikelihood = numer;\n predlabel = it->first;\n }\n denom += numer;\n probs.push_back(numer);\n }\n\n std::cout << predlabel << \"\\t\" << std::setw(1) << std::setprecision(3) << maxlikelihood\/denom << \"\\t\";\n if (\"\" == label)\n std::cout << \"<no label>\" << std::endl;\n else if (predlabel == label)\n {\n std::cout << \"correct\" << std::endl;\n correct++;\n }\n else\n std::cout << \"incorrect\" << std::endl;\n\n totalClassified++;\n };\n\n auto readFromFile = [&](const char* filename, bool isClassification)\n {\n std::ifstream file(argv[1]);\n if (!file.is_open())\n return 1;\n\n while (!file.eof())\n {\n std::string line;\n std::getline(file, line);\n if (\"\" == line)\n continue;\n std::istringstream linein(std::move(line));\n std::string label;\n std::getline(linein, label, ',');\n Entry entry;\n auto setField = [&entry, &label, &sumX, &multinomialSums, isClassification](int i, const std::string& field)\n {\n switch (field[0])\n {\n case 'y':\n entry[i] = 1.0;\n break;\n\n case 'n':\n entry[i] = 0.0;\n break;\n\n case '?':\n entry[i] = 0.5;\n break;\n }\n if (!isClassification)\n {\n sumX[label][i] += entry[i];\n multinomialSums[label] += entry[i];\n }\n };\n for (int i = 0; i < NUM_FIELDS; i++)\n {\n std::string field;\n std::getline(linein, field, ',');\n setField(i, field);\n }\n std::string field;\n std::getline(linein, field);\n setField(NUM_FIELDS - 1, field);\n if (!isClassification)\n {\n data[label].push_back(std::move(entry));\n n[label]++;\n total++;\n }\n else\n classify(label, entry);\n }\n\n return 0;\n };\n\n int errcode = readFromFile(argv[1], false);\n if (errcode)\n return errcode;\n\n for (auto it = sumX.begin(); it != sumX.end(); it++)\n {\n priors[it->first] = (double)n[it->first] \/ total;\n\n std::cout << \"Class \" << it->first << \", prior: \" << std::setw(1) << std::setprecision(3) << priors[it->first] << std::endl;\n std::cout << \"feature\\tmean\\tvar\\tstddev\\tmnl\" << std::endl;\n\n \/\/ calculate means\n std::vector<double> featureMeans(NUM_FIELDS);\n for (int i = 0; i < NUM_FIELDS; i++)\n featureMeans[i] = sumX[it->first][i] \/ n[it->first];\n\n \/\/ calculate variances\n std::vector<double> featureVariances(NUM_FIELDS);\n const auto& firstData = data[it->first];\n for (int i = 0; i < (int)firstData.size(); i++)\n for (int j = 0; j < NUM_FIELDS; j++)\n featureVariances[j] += (firstData[i][j] - featureMeans[j]) * (firstData[i][j] - featureMeans[j]);\n for (int i = 0; i < NUM_FIELDS; i++)\n featureVariances[i] \/= firstData.size();\n\n const auto& firstSumX = sumX[it->first];\n auto firstMultinomialSum = multinomialSums[it->first];\n auto& firstMultinomialLikelihood = multinomialLikelihoods[it->first];\n \/\/ calculate multinomial likelihoods\n for (int i = 0; i < NUM_FIELDS; i++)\n {\n double mnl = (firstSumX[i] + alpha) \/ (firstMultinomialSum + (alpha * featureMeans.size()));\n firstMultinomialLikelihood.push_back(mnl);\n }\n\n for (unsigned int i = 0; i < NUM_FIELDS; i++)\n printf(\"%i\\t%2.3f\\t%2.3f\\t%2.3f\\t%2.3f\\n\",i+1,featureMeans[i],featureVariances[i],sqrt(featureVariances[i]),firstMultinomialLikelihood[i]);\n\n means[it->first] = std::move(featureMeans);\n variances[it->first] = std::move(featureVariances);\n }\n\n \/\/ classify\n std::cout << \"Classifying:\" << std::endl;\n std::cout << \"class\\tprob\\tresult\" << std::endl;\n\n errcode = readFromFile(argv[2], true);\n if (errcode)\n return errcode;\n printf(\"Accuracy: %3.2f %% (%i\/%i)\\n\", 100.0 * correct \/ totalClassified, correct, totalClassified);\n\n return 0;\n}\n<commit_msg>bayes: added function that splits dataset into sets; split off parts of the program into their own functions<commit_after>#include <iostream>\n#include <iomanip>\n#include <fstream>\n#include <sstream>\n#include <array>\n#include <vector>\n#include <set>\n#include <map>\n#include <random>\n#include <chrono>\n#include <functional>\n#include <algorithm>\n\n#include <cmath>\n\n#define NUM_FIELDS 16\n#define NUM_SETS 10\n\n\nnamespace NaiveBayesClassifier\n{\n using Entry = std::array<double, NUM_FIELDS>;\n\n struct State\n {\n std::map<std::string, std::vector<Entry> > data;\n std::map<std::string, int> n;\n std::map<std::string, double> priors;\n std::map<std::string, std::vector<double> > multinomialLikelihoods;\n std::map<std::string, int> multinomialSums;\n std::map<std::string, Entry > sumX;\n std::map<std::string, std::vector<double> > means;\n std::map<std::string, std::vector<double> > variances;\n };\n\n bool LoadDataset(const char* filename, State& state, int& total)\n {\n std::ifstream filein(filename);\n if (!filein.is_open())\n return false;\n\n while (!filein.eof())\n {\n std::string line;\n std::getline(filein, line);\n if (\"\" == line)\n continue;\n std::istringstream linein(std::move(line));\n std::string label;\n std::getline(linein, label, ',');\n Entry entry;\n auto setField = [&entry, &label, &state](int i, const std::string& field)\n {\n switch (field[0])\n {\n case 'y':\n entry[i] = 1.0;\n break;\n\n case 'n':\n entry[i] = 0.0;\n break;\n\n case '?':\n entry[i] = 0.5;\n break;\n }\n state.sumX[label][i] += entry[i];\n state.multinomialSums[label] += entry[i];\n };\n for (int i = 0; i < NUM_FIELDS; i++)\n {\n std::string value;\n std::getline(linein, value, ',');\n setField(i, value);\n }\n std::string value;\n std::getline(linein, value);\n setField(NUM_FIELDS - 1, value);\n state.data[label].push_back(std::move(entry));\n state.n[label]++;\n total++;\n }\n\n return true;\n }\n\n void SplitData(const State& state, std::vector<std::set<int> >& dataSets)\n {\n std::default_random_engine generator(std::chrono::system_clock::now().time_since_epoch().count());\n std::uniform_int_distribution<> distribution(0, (int)state.data.size() - 1);\n auto addNextSet = [&generator, &distribution, &dataSets](int i, int size)\n {\n std::set<int> currentSet;\n\n while (currentSet.size() < size)\n {\n int index = distribution(generator);\n for (const auto& dataSet: dataSets)\n if (dataSet.count(index))\n continue;\n currentSet.insert(index);\n }\n\n dataSets.push_back(std::move(currentSet));\n };\n for (int i = 0; i < NUM_SETS - 1; ++i)\n addNextSet(i, state.data.size() \/ NUM_SETS);\n addNextSet(NUM_SETS - 1, state.data.size() % NUM_SETS);\n }\n\n void Train(const State& state)\n {\n for (auto it = state.sumX.begin(); it != state.sumX.end(); it++)\n {\n state.priors[it->first] = (double)state.n[it->first] \/ total;\n\n std::cout << \"Class \" << it->first << \", prior: \" << std::setw(1) << std::setprecision(3) << priors[it->first] << std::endl;\n std::cout << \"feature\\tmean\\tvar\\tstddev\\tmnl\" << std::endl;\n\n \/\/ calculate means\n std::vector<double> featureMeans(NUM_FIELDS);\n for (int i = 0; i < NUM_FIELDS; i++)\n featureMeans[i] = state.sumX[it->first][i] \/ state.n[it->first];\n\n \/\/ calculate variances\n std::vector<double> featureVariances(NUM_FIELDS);\n const auto& firstData = state.data[it->first];\n for (int i = 0; i < (int)firstData.size(); i++)\n for (int j = 0; j < NUM_FIELDS; j++)\n featureVariances[j] += (firstData[i][j] - featureMeans[j]) * (firstData[i][j] - featureMeans[j]);\n for (int i = 0; i < NUM_FIELDS; i++)\n featureVariances[i] \/= firstData.size();\n\n const auto& firstSumX = state.sumX[it->first];\n auto firstMultinomialSum = state.multinomialSums[it->first];\n auto& firstMultinomialLikelihood = state.multinomialLikelihoods[it->first];\n \/\/ calculate multinomial likelihoods\n for (int i = 0; i < NUM_FIELDS; i++)\n {\n double mnl = (firstSumX[i] + state.alpha) \/ (firstMultinomialSum + (state.alpha * featureMeans.size()));\n firstMultinomialLikelihood.push_back(mnl);\n }\n\n for (unsigned int i = 0; i < NUM_FIELDS; i++)\n printf(\"%i\\t%2.3f\\t%2.3f\\t%2.3f\\t%2.3f\\n\",i+1,featureMeans[i],featureVariances[i],sqrt(featureVariances[i]),firstMultinomialLikelihood[i]);\n\n state.means[it->first] = std::move(featureMeans);\n state.variances[it->first] = std::move(featureVariances);\n }\n }\n\n void Classify(const State& state, const std::string& label, const Entry& entry)\n {\n std::string predlabel;\n double maxlikelihood = 0.0;\n double denom = 0.0;\n std::vector<double> probs;\n for (auto it = state.priors.begin(); it != state.priors.end(); it++)\n {\n double numer = priors[it->first];\n const auto& firstMultinomialLikelihood = atate.multinomialLikelihoods[it->first];\n const auto& firstMean = state.means[it->first];\n const auto& firstVariance = state.variances[it->first];\n for (int j = 0; j < NUM_FIELDS; j++)\n switch (state,decision)\n {\n case 2:\n \/\/ Multinomial\n if (entry[j])\n numer *= pow(firstMultinomialLikelihood[j], entry[j]);\n break;\n\n case 3:\n \/\/ Bernoulli\n numer *= pow(firstMean[j], entry[j]) * pow(1.0 - firstMean[j], 1.0 - entry[j]);\n break;\n\n default:\n \/\/ Gaussian\n numer *= 1 \/ sqrt(2 * M_PI * firstVariance[j]) * exp((-1 * (entry[j] - firstMean[j]) * (entry[j] -firstMean[j])) \/ (2 * firstVariance[j]));\n break;\n }\n\n if (numer > maxlikelihood)\n {\n maxlikelihood = numer;\n predlabel = it->first;\n }\n denom += numer;\n probs.push_back(numer);\n }\n\n std::cout << predlabel << \"\\t\" << std::setw(1) << std::setprecision(3) << maxlikelihood\/denom << \"\\t\";\n if (\"\" == label)\n std::cout << \"<no label>\" << std::endl;\n else if (predlabel == label)\n {\n std::cout << \"correct\" << std::endl;\n correct++;\n }\n else\n std::cout << \"incorrect\" << std::endl;\n\n totalClassified++;\n }\n}\n\nint main(int argc, char** argv)\n{\n \/\/ smoothing factor\n const double alpha = 1.0;\n \/\/ decision rule\n const int decision = 1;\n\n if (argc < 2)\n return 1;\n\n \/\/ preparing data\n int total = 0, correct = 0, totalClassified = 0;\n\n\n\n int errcode = readFromFile(argv[1], false);\n if (errcode)\n return errcode;\n\n\n \/\/ classify\n std::cout << \"Classifying:\" << std::endl;\n std::cout << \"class\\tprob\\tresult\" << std::endl;\n\n errcode = readFromFile(argv[2], true);\n if (errcode)\n return errcode;\n printf(\"Accuracy: %3.2f %% (%i\/%i)\\n\", 100.0 * correct \/ totalClassified, correct, totalClassified);\n\n return 0;\n}\n<|endoftext|>"} {"text":"<commit_before>\/*\n * Copyright (C) 2014 Cloudius Systems, Ltd.\n *\n *\/\n\n#include \"ip.hh\"\n\nnamespace net {\n\nuint16_t ip_checksum(void* data, size_t len) {\n uint64_t csum = 0;\n auto p64 = reinterpret_cast<uint64_t*>(data);\n while (len >= 8) {\n auto old = csum;\n csum += ntohq(*p64++);\n csum += (csum < old);\n len -= 8;\n }\n auto p16 = reinterpret_cast<uint16_t*>(p64);\n while (len >= 2) {\n auto old = csum;\n csum += ntohs(*p16++);\n csum += (csum < old);\n len -= 2;\n }\n auto p8 = reinterpret_cast<uint16_t*>(p16);\n if (len) {\n auto old = csum;\n csum += *p8++;\n csum += (csum < old);\n len -= 1;\n }\n csum = (csum & 0xffff) + ((csum >> 16) & 0xffff) + ((csum >> 32) & 0xffff) + (csum >> 48);\n csum += csum >> 16;\n return htons(~csum);\n}\n\n}\n<commit_msg>ip: fix checksum for odd-sized packets<commit_after>\/*\n * Copyright (C) 2014 Cloudius Systems, Ltd.\n *\n *\/\n\n#include \"ip.hh\"\n\nnamespace net {\n\nuint16_t ip_checksum(void* data, size_t len) {\n uint64_t csum = 0;\n auto p64 = reinterpret_cast<uint64_t*>(data);\n while (len >= 8) {\n auto old = csum;\n csum += ntohq(*p64++);\n csum += (csum < old);\n len -= 8;\n }\n auto p16 = reinterpret_cast<uint16_t*>(p64);\n while (len >= 2) {\n auto old = csum;\n csum += ntohs(*p16++);\n csum += (csum < old);\n len -= 2;\n }\n auto p8 = reinterpret_cast<uint8_t*>(p16);\n if (len) {\n auto old = csum;\n csum += *p8++;\n csum += (csum < old);\n len -= 1;\n }\n csum = (csum & 0xffff) + ((csum >> 16) & 0xffff) + ((csum >> 32) & 0xffff) + (csum >> 48);\n csum += csum >> 16;\n return htons(~csum);\n}\n\n}\n<|endoftext|>"} {"text":"<commit_before>\/*c++11*\/\n#include <cstdio>\n#include <iostream>\n#include <algorithm>\n#include <vector>\n#include <map>\n#include <set>\n#include <string>\n#include <cstring>\n#include <cmath>\n\nusing namespace std;\n\nint main(int args, char *argc[]){\n\n return 0;\n}\n<commit_msg>change template<commit_after>\/*c++11*\/\n#include <iostream>\n\nusing namespace std;\n\nint main(int args, char *argc[]){\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\/kernel\/ipc.C $ *\/\n\/* *\/\n\/* OpenPOWER HostBoot Project *\/\n\/* *\/\n\/* Contributors Listed Below - COPYRIGHT 2013,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#include <arch\/ppc.H>\n#include <kernel\/ipc.H>\n#include <kernel\/cpu.H>\n#include <kernel\/intmsghandler.H>\n#include <kernel\/console.H>\n#include <errno.h>\n#include <kernel\/doorbell.H>\n#include <assert.h>\n\nusing namespace KernelIpc;\n\n\n\/\/ The base divisor (common to both modes) is everything until the 4 bits of topology ID. Converting bits into total\n\/\/ values, this is 2 (reserved) * 32 (cores) * 4 (threads)\n\/\/\n\/\/ To get the rest of the divisor we consider the mode.\n\/\/ Mode 0 = GGGC, also known as chip=node mode\n\/\/ Since C is the node number and it's not used (always zero) simply divide the PIR by a value larger than it\n\/\/ to always get 0 for the node number.\n#define TOPOLOGY_MODE_0_NODE_DIVISOR (16 * 2 * 32 * 4)\n\/\/ Mode 1 = GGCC, also known as chip=group mode\n\/\/ GG are the bits the represent the node number so divide by the value that leaves only GG as the remainder.\n#define TOPOLOGY_MODE_1_NODE_DIVISOR (4 * 2 * 32 * 4)\n\nTARGETING::topoMode_t g_topology_mode = TARGETING::PROC_FABRIC_TOPOLOGY_MODE_INVALID;\n\n\/**\n * IPC communication area. Interrupt service provider initializes.\n * @see intrrp.C\n *\/\nKernelIpc::ipc_data_area_t KernelIpc::ipc_data_area;\n\n\/\/ Put the IPC message in the other nodes memory space\n\/\/ Two potential issues:\n\/\/ 1. The destination node is not there - memory location is nonexistant.\n\/\/ 2. The destination node never responds, potentially hanging this thread.\nint KernelIpc::send(uint64_t i_q, msg_t * i_msg)\n{\n \/\/ the destination node is a 3 bit field encoded in the 64 bit queue id\n \/\/ big endian bits 29:31, ie, xxxx_xxxN__xxxx_xxxx\n \/\/ extract it from the appropriate field\n uint64_t dest_node = ((i_q >> 32) &\n (internode_info_vals_t::MAX_NODES_PER_SYS - 1));\n\n ipc_data_area_t * p_dest = ipc_data_area.remote_ipc_data_addr[dest_node];\n printkd(\"IPC Dest addr %px Q_id:%lx dest_node:%.lx\\n\",\n p_dest,i_q, dest_node);\n\n \/\/ validate destination address\n if ( (p_dest == nullptr ) ||\n ((reinterpret_cast<uint64_t>(p_dest) &\n IPC_INVALID_REMOTE_ADDR_MASK) ==\n IPC_INVALID_REMOTE_ADDR))\n {\n return( EINVAL);\n }\n\n \/\/ get lock on IPC data area in other node\n if(false == __sync_bool_compare_and_swap(&(p_dest->msg_queue_id),\n IPC_DATA_AREA_CLEAR,\n IPC_DATA_AREA_LOCKED))\n {\n return -EAGAIN;\n }\n\n p_dest->msg_payload = *i_msg; \/\/ copy in message\n lwsync();\n\n p_dest->msg_queue_id = i_q; \/\/ set destination queue id\n lwsync();\n\n printk(\"IPC to PIR %x\\n\",p_dest->pir);\n\n \/\/ send doorbell to interrupt the other drawer\n send_doorbell_ipc(p_dest->pir);\n\n \/\/ The message allocation is freed here to make msg_send for IPC\n \/\/ messages behave the same as non-IPC msg_send; that is, the message\n \/\/ is freed by the consumer; however, i_msg was allocated in user space\n \/\/ code and freed here in kernel space. The assumption is that this is OK.\n msg_free(i_msg);\n\n return 0;\n}\n\n\n\/\/ update the address this IPC instance will use to send messages\n\/\/ to a remote node\nint KernelIpc::updateRemoteIpcAddr(uint64_t i_Node, uint64_t i_RemoteAddr)\n{\n int rc;\n if \/\/ input node is valid\n (i_Node < internode_info_vals_t::MAX_NODES_PER_SYS)\n {\n \/\/ update local array entry\n rc = 0;\n printk(\"IPC ADDR %d = 0x%lx\\n\", (int)i_Node, i_RemoteAddr);\n ipc_data_area.remote_ipc_data_addr[i_Node] =\n reinterpret_cast<ipc_data_area_t*>(i_RemoteAddr);\n }\n else\n {\n rc = EINVAL;\n printk(\"updateRemoteAddr() Invalid input node: %lx\\n\",i_Node);\n }\n\n return(rc);\n}\n\n\n\/\/ query the node and remote address other nodes will use to send\n\/\/ messages to this IPC instance\nint KernelIpc::qryLocalIpcInfo(uint64_t * i_pONode, uint64_t * i_pOAddr)\n{\n \/\/ determine node and remote address\n uint64_t l_localNode = 0;\n\n if (g_topology_mode == PROC_FABRIC_TOPOLOGY_MODE_MODE0)\n {\n l_localNode = getPIR()\/TOPOLOGY_MODE_0_NODE_DIVISOR;\n }\n else if (g_topology_mode == PROC_FABRIC_TOPOLOGY_MODE_MODE1)\n {\n l_localNode = getPIR()\/TOPOLOGY_MODE_1_NODE_DIVISOR;\n }\n else\n {\n \/\/ Topology Mode was not setup yet.\n crit_assert(false);\n }\n\n uint64_t l_localAddr = reinterpret_cast<uint64_t>(&ipc_data_area);\n uint64_t l_hrmor = getHRMOR();\n\n uint64_t l_oAddr = (( l_localAddr +\n l_hrmor ) |\n 0x8000000000000000ul);\n\n *i_pONode = l_localNode;\n *i_pOAddr = l_oAddr;\n\n return(0);\n}\n\nvoid KernelIpc::setTopologyMode(TARGETING::topoMode_t const i_topologyMode)\n{\n g_topology_mode = i_topologyMode;\n printk(\"Topology Mode = %d\\n\",g_topology_mode);\n}\n\n<commit_msg>Remove confusing comments from ipc.C regarding topoId<commit_after>\/* IBM_PROLOG_BEGIN_TAG *\/\n\/* This is an automatically generated prolog. *\/\n\/* *\/\n\/* $Source: src\/kernel\/ipc.C $ *\/\n\/* *\/\n\/* OpenPOWER HostBoot Project *\/\n\/* *\/\n\/* Contributors Listed Below - COPYRIGHT 2013,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#include <arch\/ppc.H>\n#include <kernel\/ipc.H>\n#include <kernel\/cpu.H>\n#include <kernel\/intmsghandler.H>\n#include <kernel\/console.H>\n#include <errno.h>\n#include <kernel\/doorbell.H>\n#include <assert.h>\n\nusing namespace KernelIpc;\n\n\n\/\/ The base divisor (common to both modes) is everything until the 4 bits of topology ID. Converting bits into total\n\/\/ values, this is 2 (reserved) * 32 (cores) * 4 (threads)\n\/\/\n\/\/ To get the rest of the divisor we consider the mode.\n\/\/ Mode 0 = GGGC, C is the node number and it's not used (always zero) simply divide the PIR by a value larger\n\/\/ than it to always get 0 for the node number.\n#define TOPOLOGY_MODE_0_NODE_DIVISOR (16 * 2 * 32 * 4)\n\/\/ Mode 1 = GGCC, GG are the bits the represent the node number so divide by the value that leaves only GG as the\n\/\/ remainder.\n#define TOPOLOGY_MODE_1_NODE_DIVISOR (4 * 2 * 32 * 4)\n\nTARGETING::topoMode_t g_topology_mode = TARGETING::PROC_FABRIC_TOPOLOGY_MODE_INVALID;\n\n\/**\n * IPC communication area. Interrupt service provider initializes.\n * @see intrrp.C\n *\/\nKernelIpc::ipc_data_area_t KernelIpc::ipc_data_area;\n\n\/\/ Put the IPC message in the other nodes memory space\n\/\/ Two potential issues:\n\/\/ 1. The destination node is not there - memory location is nonexistant.\n\/\/ 2. The destination node never responds, potentially hanging this thread.\nint KernelIpc::send(uint64_t i_q, msg_t * i_msg)\n{\n \/\/ the destination node is a 3 bit field encoded in the 64 bit queue id\n \/\/ big endian bits 29:31, ie, xxxx_xxxN__xxxx_xxxx\n \/\/ extract it from the appropriate field\n uint64_t dest_node = ((i_q >> 32) &\n (internode_info_vals_t::MAX_NODES_PER_SYS - 1));\n\n ipc_data_area_t * p_dest = ipc_data_area.remote_ipc_data_addr[dest_node];\n printkd(\"IPC Dest addr %px Q_id:%lx dest_node:%.lx\\n\",\n p_dest,i_q, dest_node);\n\n \/\/ validate destination address\n if ( (p_dest == nullptr ) ||\n ((reinterpret_cast<uint64_t>(p_dest) &\n IPC_INVALID_REMOTE_ADDR_MASK) ==\n IPC_INVALID_REMOTE_ADDR))\n {\n return( EINVAL);\n }\n\n \/\/ get lock on IPC data area in other node\n if(false == __sync_bool_compare_and_swap(&(p_dest->msg_queue_id),\n IPC_DATA_AREA_CLEAR,\n IPC_DATA_AREA_LOCKED))\n {\n return -EAGAIN;\n }\n\n p_dest->msg_payload = *i_msg; \/\/ copy in message\n lwsync();\n\n p_dest->msg_queue_id = i_q; \/\/ set destination queue id\n lwsync();\n\n printk(\"IPC to PIR %x\\n\",p_dest->pir);\n\n \/\/ send doorbell to interrupt the other drawer\n send_doorbell_ipc(p_dest->pir);\n\n \/\/ The message allocation is freed here to make msg_send for IPC\n \/\/ messages behave the same as non-IPC msg_send; that is, the message\n \/\/ is freed by the consumer; however, i_msg was allocated in user space\n \/\/ code and freed here in kernel space. The assumption is that this is OK.\n msg_free(i_msg);\n\n return 0;\n}\n\n\n\/\/ update the address this IPC instance will use to send messages\n\/\/ to a remote node\nint KernelIpc::updateRemoteIpcAddr(uint64_t i_Node, uint64_t i_RemoteAddr)\n{\n int rc;\n if \/\/ input node is valid\n (i_Node < internode_info_vals_t::MAX_NODES_PER_SYS)\n {\n \/\/ update local array entry\n rc = 0;\n printk(\"IPC ADDR %d = 0x%lx\\n\", (int)i_Node, i_RemoteAddr);\n ipc_data_area.remote_ipc_data_addr[i_Node] =\n reinterpret_cast<ipc_data_area_t*>(i_RemoteAddr);\n }\n else\n {\n rc = EINVAL;\n printk(\"updateRemoteAddr() Invalid input node: %lx\\n\",i_Node);\n }\n\n return(rc);\n}\n\n\n\/\/ query the node and remote address other nodes will use to send\n\/\/ messages to this IPC instance\nint KernelIpc::qryLocalIpcInfo(uint64_t * i_pONode, uint64_t * i_pOAddr)\n{\n \/\/ determine node and remote address\n uint64_t l_localNode = 0;\n\n if (g_topology_mode == PROC_FABRIC_TOPOLOGY_MODE_MODE0)\n {\n l_localNode = getPIR()\/TOPOLOGY_MODE_0_NODE_DIVISOR;\n }\n else if (g_topology_mode == PROC_FABRIC_TOPOLOGY_MODE_MODE1)\n {\n l_localNode = getPIR()\/TOPOLOGY_MODE_1_NODE_DIVISOR;\n }\n else\n {\n \/\/ Topology Mode was not setup yet.\n crit_assert(false);\n }\n\n uint64_t l_localAddr = reinterpret_cast<uint64_t>(&ipc_data_area);\n uint64_t l_hrmor = getHRMOR();\n\n uint64_t l_oAddr = (( l_localAddr +\n l_hrmor ) |\n 0x8000000000000000ul);\n\n *i_pONode = l_localNode;\n *i_pOAddr = l_oAddr;\n\n return(0);\n}\n\nvoid KernelIpc::setTopologyMode(TARGETING::topoMode_t const i_topologyMode)\n{\n g_topology_mode = i_topologyMode;\n printk(\"Topology Mode = %d\\n\",g_topology_mode);\n}\n\n<|endoftext|>"} {"text":"<commit_before>#include \"SpikeSlab.h\"\n#include \"Utils.h\"\n\nusing namespace std;\nusing namespace DNest4;\n\nSpikeSlab::SpikeSlab()\n:params(20)\n{\n\n}\n\nvoid SpikeSlab::from_prior(RNG& rng)\n{\n\tfor(size_t i=0; i<params.size(); i++)\n\t\tparams[i] = -0.5 + rng.rand();\n}\n\ndouble SpikeSlab::perturb(RNG& rng)\n{\n\tint which = rng.rand_int(params.size());\n\tparams[which] += rng.randh();\n\twrap(params[which], -0.5, 0.5);\n\treturn 0.;\n}\n\ndouble SpikeSlab::log_likelihood() const\n{\n\tdouble u = 0.01;\n\tdouble v = 0.1;\n\tdouble C = log(1.0\/sqrt(2*M_PI));\n\n\tdouble logl1 = params.size()*(C - log(u));\n\tdouble logl2 = params.size()*(C - log(v));\n\n\tfor(const double& x: params)\n\t{\n\t\tlogl1 += -0.5*pow((x - 0.031)\/u, 2);\n\t\tlogl2 += -0.5*pow(x\/v, 2);\n\t}\n\tlogl1 += log(100.);\n\n\treturn logsumexp(logl1, logl2);\n}\n\nvoid SpikeSlab::print(std::ostream& out) const\n{\n\tfor(const double& x: params)\n\t\tout<<x<<' ';\n}\n\nstring SpikeSlab::description() const\n{\n\treturn string(\"Each column is one of the 20 parameters.\");\n}\n\n<commit_msg>constexpr<commit_after>#include \"SpikeSlab.h\"\n#include \"Utils.h\"\n\nusing namespace std;\nusing namespace DNest4;\n\nSpikeSlab::SpikeSlab()\n:params(20)\n{\n\n}\n\nvoid SpikeSlab::from_prior(RNG& rng)\n{\n\tfor(size_t i=0; i<params.size(); i++)\n\t\tparams[i] = -0.5 + rng.rand();\n}\n\ndouble SpikeSlab::perturb(RNG& rng)\n{\n\tint which = rng.rand_int(params.size());\n\tparams[which] += rng.randh();\n\twrap(params[which], -0.5, 0.5);\n\treturn 0.;\n}\n\ndouble SpikeSlab::log_likelihood() const\n{\n\tconstexpr double u = 0.01;\n\tconstexpr double v = 0.1;\n\tconstexpr double C = log(1.0\/sqrt(2*M_PI));\n\n\tdouble logl1 = params.size()*(C - log(u));\n\tdouble logl2 = params.size()*(C - log(v));\n\n\tfor(const double& x: params)\n\t{\n\t\tlogl1 += -0.5*pow((x - 0.031)\/u, 2);\n\t\tlogl2 += -0.5*pow(x\/v, 2);\n\t}\n\tlogl1 += log(100.);\n\n\treturn logsumexp(logl1, logl2);\n}\n\nvoid SpikeSlab::print(std::ostream& out) const\n{\n\tfor(const double& x: params)\n\t\tout<<x<<' ';\n}\n\nstring SpikeSlab::description() const\n{\n\treturn string(\"Each column is one of the 20 parameters.\");\n}\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 \"..\/Containers\/Mapping.h\"\n#include \"..\/Debug\/Assertions.h\"\n#include \"..\/Debug\/Trace.h\"\n#include \"DateTime.h\"\n#include \"..\/Execution\/ProcessRunner.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 if (result.fID.empty ()) {\n try {\n result.fID = Execution::ProcessRunner (L\"date +%Z\").Run (String ()).Trim ();\n }\n catch (...) {\n DbgTrace (\"Ignoring missing ID from date +%Z\");\n }\n }\n if (result.fID.empty ()) {\n \/\/ We could look to see if \/etc\/localtime is a symlink or a copy of any named file from \/usr\/share\/zoneinfo, but\n \/\/ hope thats not needed!\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}<commit_msg>fix mistake in last checkin(posix)<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 \"..\/Execution\/ProcessRunner.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 if (result.fID.IsMissing ()) {\n try {\n result.fID = Execution::ProcessRunner (L\"date +%Z\").Run (String ()).Trim ();\n }\n catch (...) {\n DbgTrace (\"Ignoring missing ID from date +%Z\");\n }\n }\n if (result.fID.empty ()) {\n \/\/ We could look to see if \/etc\/localtime is a symlink or a copy of any named file from \/usr\/share\/zoneinfo, but\n \/\/ hope thats not needed!\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 \"symbiosis.hpp\"\n#include \"shader.hpp\"\n#include \"symbiont_material.hpp\"\n#include \"symbiont_species.hpp\"\n#include \"holobiont.hpp\"\n#include \"material_struct.hpp\"\n#include \"entity_templates.hpp\"\n#include \"render_templates.hpp\"\n#include \"code\/ylikuutio\/hierarchy\/hierarchy_templates.hpp\"\n#include <ofbx.h>\n\n\/\/ Include standard headers\n#include <iostream> \/\/ std::cout, std::cin, std::cerr\n#include <stdint.h> \/\/ uint32_t etc.\n#include <string> \/\/ std::string\n#include <vector> \/\/ std::vector\n\nnamespace ontology\n{\n class Holobiont;\n\n void Symbiosis::bind_symbiont_material(ontology::SymbiontMaterial* const symbiont_material)\n {\n \/\/ get `childID` from `Symbiosis` and set pointer to `symbiont_material`.\n hierarchy::bind_child_to_parent<ontology::SymbiontMaterial*>(\n symbiont_material,\n this->symbiont_material_pointer_vector,\n this->free_symbiont_materialID_queue,\n &this->number_of_symbiont_materials);\n }\n\n void Symbiosis::bind_holobiont(ontology::Holobiont* const holobiont)\n {\n \/\/ get `childID` from `Symbiosis` and set pointer to `object`.\n hierarchy::bind_child_to_parent<ontology::Holobiont*>(\n holobiont,\n this->holobiont_pointer_vector,\n this->free_holobiontID_queue,\n &this->number_of_holobionts);\n }\n\n void Symbiosis::unbind_holobiont(const int32_t childID)\n {\n ontology::Holobiont* dummy_child_pointer = nullptr;\n hierarchy::set_child_pointer(\n childID,\n dummy_child_pointer,\n this->holobiont_pointer_vector,\n this->free_holobiontID_queue,\n &this->number_of_holobionts);\n }\n\n void Symbiosis::bind_to_parent()\n {\n \/\/ get `childID` from `Shader` and set pointer to this `Symbiosis`.\n this->parent->bind_symbiosis(this);\n }\n\n void Symbiosis::bind_to_new_parent(ontology::Shader* const new_shader_pointer)\n {\n \/\/ unbind from the old parent `Shader`.\n this->parent->unbind_symbiosis(this->childID);\n\n \/\/ get `childID` from `Shader` and set pointer to this `Symbiosis`.\n this->parent = new_shader_pointer;\n this->parent->bind_symbiosis(this);\n }\n\n Symbiosis::~Symbiosis()\n {\n \/\/ destructor.\n std::cout << \"Symbiosis with childID \" << std::dec << this->childID << \" will be destroyed.\\n\";\n\n \/\/ destroy all holobionts of this symbiosis.\n std::cout << \"All holobionts of this symbiosis will be destroyed.\\n\";\n hierarchy::delete_children<ontology::Holobiont*>(this->holobiont_pointer_vector, &this->number_of_holobionts);\n\n \/\/ destroy all symbiont materials of this symbiosis.\n std::cout << \"All symbiont materials of this symbiosis will be destroyed.\\n\";\n hierarchy::delete_children<ontology::SymbiontMaterial*>(this->symbiont_material_pointer_vector, &this->number_of_symbiont_materials);\n\n \/\/ set pointer to this symbiosis to nullptr.\n this->parent->set_symbiosis_pointer(this->childID, nullptr);\n }\n\n void Symbiosis::render()\n {\n this->prerender();\n\n \/\/ render this `Symbiosis` by calling `render()` function of each `Holobiont`.\n ontology::render_children<ontology::Holobiont*>(this->holobiont_pointer_vector);\n\n this->postrender();\n }\n\n void Symbiosis::set_name(const std::string& name)\n {\n ontology::set_name(name, this);\n }\n\n ontology::Entity* Symbiosis::get_parent() const\n {\n return this->parent;\n }\n\n int32_t Symbiosis::get_number_of_children() const\n {\n return this->number_of_symbiont_materials + this->number_of_holobionts;\n }\n\n int32_t Symbiosis::get_number_of_descendants() const\n {\n return -1;\n }\n\n const std::string& Symbiosis::get_model_file_format()\n {\n return this->model_file_format;\n }\n\n void Symbiosis::set_symbiont_material_pointer(const int32_t childID, ontology::SymbiontMaterial* const child_pointer)\n {\n hierarchy::set_child_pointer(\n childID,\n child_pointer,\n this->symbiont_material_pointer_vector,\n this->free_symbiont_materialID_queue,\n &this->number_of_symbiont_materials);\n }\n\n void Symbiosis::set_holobiont_pointer(const int32_t childID, ontology::Holobiont* const child_pointer)\n {\n hierarchy::set_child_pointer(\n childID,\n child_pointer,\n this->holobiont_pointer_vector,\n this->free_holobiontID_queue,\n &this->number_of_holobionts);\n }\n\n void Symbiosis::create_symbionts()\n {\n SymbiosisLoaderStruct symbiosis_loader_struct;\n symbiosis_loader_struct.model_filename = this->model_filename;\n symbiosis_loader_struct.model_file_format = this->model_file_format;\n symbiosis_loader_struct.triangulation_type = this->triangulation_type;\n\n if (loaders::load_symbiosis(\n symbiosis_loader_struct,\n this->vertices,\n this->uvs,\n this->normals,\n this->indices,\n this->indexed_vertices,\n this->indexed_uvs,\n this->indexed_normals,\n this->ofbx_diffuse_texture_mesh_map,\n this->ofbx_meshes,\n this->ofbx_diffuse_texture_vector,\n this->ofbx_normal_texture_vector,\n this->ofbx_count_texture_vector,\n this->ofbx_mesh_count))\n {\n std::cout << \"number of meshes: \" << this->ofbx_mesh_count << \"\\n\";\n\n std::vector<const ofbx::Texture*> ofbx_diffuse_texture_pointer_vector;\n ofbx_diffuse_texture_pointer_vector.reserve(this->ofbx_diffuse_texture_mesh_map.size());\n this->biontID_symbiont_material_vector.resize(this->ofbx_mesh_count);\n\n this->biontID_symbiont_species_vector.resize(this->ofbx_mesh_count);\n\n for (auto key_and_value : ofbx_diffuse_texture_mesh_map)\n {\n ofbx_diffuse_texture_pointer_vector.push_back(key_and_value.first); \/\/ key.\n }\n\n \/\/ Create `SymbiontMaterial`s.\n for (const ofbx::Texture* ofbx_texture : ofbx_diffuse_texture_pointer_vector)\n {\n std::cout << \"Creating ontology::SymbiontMaterial* based on ofbx::Texture* at 0x\" << std::hex << (uint64_t) ofbx_texture << std::dec << \" ...\\n\";\n MaterialStruct material_struct;\n material_struct.shader = this->parent;\n material_struct.symbiosis = this;\n material_struct.is_symbiont_material = true;\n material_struct.ofbx_texture = ofbx_texture;\n ontology::SymbiontMaterial* symbiont_material = new ontology::SymbiontMaterial(this->universe, material_struct);\n symbiont_material->load_texture();\n\n std::cout << \"ontology::SymbiontMaterial* successfully created.\\n\";\n\n \/\/ Create `SymbiontSpecies`s.\n \/\/ Care only about `ofbx::Texture*`s with are DIFFUSE textures.\n for (int32_t mesh_i : this->ofbx_diffuse_texture_mesh_map.at(ofbx_texture))\n {\n int32_t vertex_count = this->vertices.at(mesh_i).size();\n std::vector<glm::vec3> vertices = this->vertices.at(mesh_i);\n\n SpeciesStruct species_struct;\n species_struct.is_symbiont_species = true;\n species_struct.scene = static_cast<ontology::Scene*>(this->parent->get_parent());\n species_struct.shader = this->parent;\n species_struct.symbiont_material = symbiont_material;\n species_struct.vertex_count = vertex_count;\n species_struct.vertices = this->vertices.at(mesh_i);\n species_struct.uvs = this->uvs.at(mesh_i);\n species_struct.normals = this->normals.at(mesh_i);\n species_struct.light_position = this->light_position;\n\n std::cout << \"Creating ontology::SymbiontSpecies*, mesh index \" << mesh_i << \"...\\n\";\n\n ontology::SymbiontSpecies* symbiont_species = new ontology::SymbiontSpecies(this->universe, species_struct);\n\n std::cout << \"ontology::SymbiontSpecies*, mesh index \" << mesh_i << \" successfully created.\\n\";\n\n std::cout << \"storing ontology::SymbiontMaterial* symbiont_material into vector with mesh_i \" << mesh_i << \" ...\\n\";\n this->biontID_symbiont_material_vector.at(mesh_i) = symbiont_material;\n std::cout << \"storing ontology::SymbiontSpecies* symbiont_species into vector with mesh_i \" << mesh_i << \" ...\\n\";\n this->biontID_symbiont_species_vector.at(mesh_i) = symbiont_species;\n\n std::cout << \"Success.\\n\";\n \/\/ TODO: Compute the graph of each type to enable object vertex modification!\n }\n }\n\n std::cout << \"All symbionts successfully created.\\n\";\n }\n }\n\n ontology::SymbiontSpecies* Symbiosis::get_symbiont_species(const int32_t biontID) const\n {\n return this->biontID_symbiont_species_vector.at(biontID);\n }\n\n GLuint Symbiosis::get_vertex_position_modelspaceID(const int32_t biontID) const\n {\n return this->biontID_symbiont_species_vector.at(biontID)->get_vertex_position_modelspaceID();\n }\n\n GLuint Symbiosis::get_vertexUVID(const int32_t biontID) const\n {\n return this->biontID_symbiont_species_vector.at(biontID)->get_vertexUVID();\n }\n\n GLuint Symbiosis::get_vertex_normal_modelspaceID(const int32_t biontID) const\n {\n return this->biontID_symbiont_species_vector.at(biontID)->get_vertex_normal_modelspaceID();\n }\n\n GLuint Symbiosis::get_vertexbuffer(const int32_t biontID) const\n {\n return this->biontID_symbiont_species_vector.at(biontID)->get_vertexbuffer();\n }\n\n GLuint Symbiosis::get_uvbuffer(const int32_t biontID) const\n {\n return this->biontID_symbiont_species_vector.at(biontID)->get_uvbuffer();\n }\n\n GLuint Symbiosis::get_normalbuffer(const int32_t biontID) const\n {\n return this->biontID_symbiont_species_vector.at(biontID)->get_normalbuffer();\n }\n\n GLuint Symbiosis::get_elementbuffer(const int32_t biontID) const\n {\n return this->biontID_symbiont_species_vector.at(biontID)->get_elementbuffer();\n }\n\n std::vector<uint32_t> Symbiosis::get_indices(const int32_t biontID) const\n {\n return this->biontID_symbiont_species_vector.at(biontID)->get_indices();\n \/\/ return this->indices.at(biontID);\n }\n\n GLuint Symbiosis::get_indices_size(const int32_t biontID) const\n {\n return this->biontID_symbiont_species_vector.at(biontID)->get_indices_size();\n \/\/ return this->indices.at(biontID).size();\n }\n\n int32_t Symbiosis::get_number_of_symbionts() const\n {\n return this->ofbx_mesh_count;\n }\n\n bool Symbiosis::has_texture(const int32_t biontID) const\n {\n if (biontID >= this->biontID_symbiont_material_vector.size())\n {\n return false;\n }\n\n if (this->biontID_symbiont_material_vector.at(biontID) == nullptr)\n {\n return false;\n }\n\n return true;\n }\n\n GLuint Symbiosis::get_texture(const int32_t biontID) const\n {\n return this->biontID_symbiont_material_vector.at(biontID)->get_texture();\n }\n\n GLuint Symbiosis::get_openGL_textureID(const int32_t biontID) const\n {\n return this->biontID_symbiont_material_vector.at(biontID)->get_openGL_textureID();\n }\n\n GLuint Symbiosis::get_lightID(const int32_t biontID) const\n {\n return this->biontID_symbiont_species_vector.at(biontID)->get_lightID();\n }\n\n glm::vec3 Symbiosis::get_light_position(const int32_t biontID) const\n {\n return this->light_position;\n }\n}\n<commit_msg>Fixed a typo in a comment.<commit_after>#include \"symbiosis.hpp\"\n#include \"shader.hpp\"\n#include \"symbiont_material.hpp\"\n#include \"symbiont_species.hpp\"\n#include \"holobiont.hpp\"\n#include \"material_struct.hpp\"\n#include \"entity_templates.hpp\"\n#include \"render_templates.hpp\"\n#include \"code\/ylikuutio\/hierarchy\/hierarchy_templates.hpp\"\n#include <ofbx.h>\n\n\/\/ Include standard headers\n#include <iostream> \/\/ std::cout, std::cin, std::cerr\n#include <stdint.h> \/\/ uint32_t etc.\n#include <string> \/\/ std::string\n#include <vector> \/\/ std::vector\n\nnamespace ontology\n{\n class Holobiont;\n\n void Symbiosis::bind_symbiont_material(ontology::SymbiontMaterial* const symbiont_material)\n {\n \/\/ get `childID` from `Symbiosis` and set pointer to `symbiont_material`.\n hierarchy::bind_child_to_parent<ontology::SymbiontMaterial*>(\n symbiont_material,\n this->symbiont_material_pointer_vector,\n this->free_symbiont_materialID_queue,\n &this->number_of_symbiont_materials);\n }\n\n void Symbiosis::bind_holobiont(ontology::Holobiont* const holobiont)\n {\n \/\/ get `childID` from `Symbiosis` and set pointer to `object`.\n hierarchy::bind_child_to_parent<ontology::Holobiont*>(\n holobiont,\n this->holobiont_pointer_vector,\n this->free_holobiontID_queue,\n &this->number_of_holobionts);\n }\n\n void Symbiosis::unbind_holobiont(const int32_t childID)\n {\n ontology::Holobiont* dummy_child_pointer = nullptr;\n hierarchy::set_child_pointer(\n childID,\n dummy_child_pointer,\n this->holobiont_pointer_vector,\n this->free_holobiontID_queue,\n &this->number_of_holobionts);\n }\n\n void Symbiosis::bind_to_parent()\n {\n \/\/ get `childID` from `Shader` and set pointer to this `Symbiosis`.\n this->parent->bind_symbiosis(this);\n }\n\n void Symbiosis::bind_to_new_parent(ontology::Shader* const new_shader_pointer)\n {\n \/\/ unbind from the old parent `Shader`.\n this->parent->unbind_symbiosis(this->childID);\n\n \/\/ get `childID` from `Shader` and set pointer to this `Symbiosis`.\n this->parent = new_shader_pointer;\n this->parent->bind_symbiosis(this);\n }\n\n Symbiosis::~Symbiosis()\n {\n \/\/ destructor.\n std::cout << \"Symbiosis with childID \" << std::dec << this->childID << \" will be destroyed.\\n\";\n\n \/\/ destroy all holobionts of this symbiosis.\n std::cout << \"All holobionts of this symbiosis will be destroyed.\\n\";\n hierarchy::delete_children<ontology::Holobiont*>(this->holobiont_pointer_vector, &this->number_of_holobionts);\n\n \/\/ destroy all symbiont materials of this symbiosis.\n std::cout << \"All symbiont materials of this symbiosis will be destroyed.\\n\";\n hierarchy::delete_children<ontology::SymbiontMaterial*>(this->symbiont_material_pointer_vector, &this->number_of_symbiont_materials);\n\n \/\/ set pointer to this symbiosis to nullptr.\n this->parent->set_symbiosis_pointer(this->childID, nullptr);\n }\n\n void Symbiosis::render()\n {\n this->prerender();\n\n \/\/ render this `Symbiosis` by calling `render()` function of each `Holobiont`.\n ontology::render_children<ontology::Holobiont*>(this->holobiont_pointer_vector);\n\n this->postrender();\n }\n\n void Symbiosis::set_name(const std::string& name)\n {\n ontology::set_name(name, this);\n }\n\n ontology::Entity* Symbiosis::get_parent() const\n {\n return this->parent;\n }\n\n int32_t Symbiosis::get_number_of_children() const\n {\n return this->number_of_symbiont_materials + this->number_of_holobionts;\n }\n\n int32_t Symbiosis::get_number_of_descendants() const\n {\n return -1;\n }\n\n const std::string& Symbiosis::get_model_file_format()\n {\n return this->model_file_format;\n }\n\n void Symbiosis::set_symbiont_material_pointer(const int32_t childID, ontology::SymbiontMaterial* const child_pointer)\n {\n hierarchy::set_child_pointer(\n childID,\n child_pointer,\n this->symbiont_material_pointer_vector,\n this->free_symbiont_materialID_queue,\n &this->number_of_symbiont_materials);\n }\n\n void Symbiosis::set_holobiont_pointer(const int32_t childID, ontology::Holobiont* const child_pointer)\n {\n hierarchy::set_child_pointer(\n childID,\n child_pointer,\n this->holobiont_pointer_vector,\n this->free_holobiontID_queue,\n &this->number_of_holobionts);\n }\n\n void Symbiosis::create_symbionts()\n {\n SymbiosisLoaderStruct symbiosis_loader_struct;\n symbiosis_loader_struct.model_filename = this->model_filename;\n symbiosis_loader_struct.model_file_format = this->model_file_format;\n symbiosis_loader_struct.triangulation_type = this->triangulation_type;\n\n if (loaders::load_symbiosis(\n symbiosis_loader_struct,\n this->vertices,\n this->uvs,\n this->normals,\n this->indices,\n this->indexed_vertices,\n this->indexed_uvs,\n this->indexed_normals,\n this->ofbx_diffuse_texture_mesh_map,\n this->ofbx_meshes,\n this->ofbx_diffuse_texture_vector,\n this->ofbx_normal_texture_vector,\n this->ofbx_count_texture_vector,\n this->ofbx_mesh_count))\n {\n std::cout << \"number of meshes: \" << this->ofbx_mesh_count << \"\\n\";\n\n std::vector<const ofbx::Texture*> ofbx_diffuse_texture_pointer_vector;\n ofbx_diffuse_texture_pointer_vector.reserve(this->ofbx_diffuse_texture_mesh_map.size());\n this->biontID_symbiont_material_vector.resize(this->ofbx_mesh_count);\n\n this->biontID_symbiont_species_vector.resize(this->ofbx_mesh_count);\n\n for (auto key_and_value : ofbx_diffuse_texture_mesh_map)\n {\n ofbx_diffuse_texture_pointer_vector.push_back(key_and_value.first); \/\/ key.\n }\n\n \/\/ Create `SymbiontMaterial`s.\n for (const ofbx::Texture* ofbx_texture : ofbx_diffuse_texture_pointer_vector)\n {\n std::cout << \"Creating ontology::SymbiontMaterial* based on ofbx::Texture* at 0x\" << std::hex << (uint64_t) ofbx_texture << std::dec << \" ...\\n\";\n MaterialStruct material_struct;\n material_struct.shader = this->parent;\n material_struct.symbiosis = this;\n material_struct.is_symbiont_material = true;\n material_struct.ofbx_texture = ofbx_texture;\n ontology::SymbiontMaterial* symbiont_material = new ontology::SymbiontMaterial(this->universe, material_struct);\n symbiont_material->load_texture();\n\n std::cout << \"ontology::SymbiontMaterial* successfully created.\\n\";\n\n \/\/ Create `SymbiontSpecies`s.\n \/\/ Care only about `ofbx::Texture*`s which are DIFFUSE textures.\n for (int32_t mesh_i : this->ofbx_diffuse_texture_mesh_map.at(ofbx_texture))\n {\n int32_t vertex_count = this->vertices.at(mesh_i).size();\n std::vector<glm::vec3> vertices = this->vertices.at(mesh_i);\n\n SpeciesStruct species_struct;\n species_struct.is_symbiont_species = true;\n species_struct.scene = static_cast<ontology::Scene*>(this->parent->get_parent());\n species_struct.shader = this->parent;\n species_struct.symbiont_material = symbiont_material;\n species_struct.vertex_count = vertex_count;\n species_struct.vertices = this->vertices.at(mesh_i);\n species_struct.uvs = this->uvs.at(mesh_i);\n species_struct.normals = this->normals.at(mesh_i);\n species_struct.light_position = this->light_position;\n\n std::cout << \"Creating ontology::SymbiontSpecies*, mesh index \" << mesh_i << \"...\\n\";\n\n ontology::SymbiontSpecies* symbiont_species = new ontology::SymbiontSpecies(this->universe, species_struct);\n\n std::cout << \"ontology::SymbiontSpecies*, mesh index \" << mesh_i << \" successfully created.\\n\";\n\n std::cout << \"storing ontology::SymbiontMaterial* symbiont_material into vector with mesh_i \" << mesh_i << \" ...\\n\";\n this->biontID_symbiont_material_vector.at(mesh_i) = symbiont_material;\n std::cout << \"storing ontology::SymbiontSpecies* symbiont_species into vector with mesh_i \" << mesh_i << \" ...\\n\";\n this->biontID_symbiont_species_vector.at(mesh_i) = symbiont_species;\n\n std::cout << \"Success.\\n\";\n \/\/ TODO: Compute the graph of each type to enable object vertex modification!\n }\n }\n\n std::cout << \"All symbionts successfully created.\\n\";\n }\n }\n\n ontology::SymbiontSpecies* Symbiosis::get_symbiont_species(const int32_t biontID) const\n {\n return this->biontID_symbiont_species_vector.at(biontID);\n }\n\n GLuint Symbiosis::get_vertex_position_modelspaceID(const int32_t biontID) const\n {\n return this->biontID_symbiont_species_vector.at(biontID)->get_vertex_position_modelspaceID();\n }\n\n GLuint Symbiosis::get_vertexUVID(const int32_t biontID) const\n {\n return this->biontID_symbiont_species_vector.at(biontID)->get_vertexUVID();\n }\n\n GLuint Symbiosis::get_vertex_normal_modelspaceID(const int32_t biontID) const\n {\n return this->biontID_symbiont_species_vector.at(biontID)->get_vertex_normal_modelspaceID();\n }\n\n GLuint Symbiosis::get_vertexbuffer(const int32_t biontID) const\n {\n return this->biontID_symbiont_species_vector.at(biontID)->get_vertexbuffer();\n }\n\n GLuint Symbiosis::get_uvbuffer(const int32_t biontID) const\n {\n return this->biontID_symbiont_species_vector.at(biontID)->get_uvbuffer();\n }\n\n GLuint Symbiosis::get_normalbuffer(const int32_t biontID) const\n {\n return this->biontID_symbiont_species_vector.at(biontID)->get_normalbuffer();\n }\n\n GLuint Symbiosis::get_elementbuffer(const int32_t biontID) const\n {\n return this->biontID_symbiont_species_vector.at(biontID)->get_elementbuffer();\n }\n\n std::vector<uint32_t> Symbiosis::get_indices(const int32_t biontID) const\n {\n return this->biontID_symbiont_species_vector.at(biontID)->get_indices();\n \/\/ return this->indices.at(biontID);\n }\n\n GLuint Symbiosis::get_indices_size(const int32_t biontID) const\n {\n return this->biontID_symbiont_species_vector.at(biontID)->get_indices_size();\n \/\/ return this->indices.at(biontID).size();\n }\n\n int32_t Symbiosis::get_number_of_symbionts() const\n {\n return this->ofbx_mesh_count;\n }\n\n bool Symbiosis::has_texture(const int32_t biontID) const\n {\n if (biontID >= this->biontID_symbiont_material_vector.size())\n {\n return false;\n }\n\n if (this->biontID_symbiont_material_vector.at(biontID) == nullptr)\n {\n return false;\n }\n\n return true;\n }\n\n GLuint Symbiosis::get_texture(const int32_t biontID) const\n {\n return this->biontID_symbiont_material_vector.at(biontID)->get_texture();\n }\n\n GLuint Symbiosis::get_openGL_textureID(const int32_t biontID) const\n {\n return this->biontID_symbiont_material_vector.at(biontID)->get_openGL_textureID();\n }\n\n GLuint Symbiosis::get_lightID(const int32_t biontID) const\n {\n return this->biontID_symbiont_species_vector.at(biontID)->get_lightID();\n }\n\n glm::vec3 Symbiosis::get_light_position(const int32_t biontID) const\n {\n return this->light_position;\n }\n}\n<|endoftext|>"} {"text":"<commit_before>\/*=========================================================================\r\n\r\nProgram: Medical Imaging & Interaction Toolkit\r\nLanguage: C++\r\nDate: $Date: 2009-05-13 14:52:01 +0200 (Mi, 13. Mai 2009) $\r\nVersion: $Revision: 17230 $\r\n\r\nCopyright (c) German Cancer Research Center, Division of Medical and\r\nBiological Informatics. All rights reserved.\r\nSee MITKCopyright.txt or http:\/\/www.mitk.org\/copyright.html for details.\r\n\r\nThis software is distributed WITHOUT ANY WARRANTY; without even\r\nthe implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR\r\nPURPOSE. See the above copyright notices for more information.\r\n\r\n=========================================================================*\/\r\n\r\n#include \"mitkNavigationDataPlayer.h\"\r\n#include \"mitkNavigationData.h\"\r\n\r\n#include \"mitkTestingMacros.h\"\r\n#include \"mitkStandardFileLocations.h\"\r\n#include \"mitkTimeStamp.h\"\r\n\r\n#include <iostream>\r\n#include <sstream>\r\n\r\n\/**Documentation\r\n * test for the class \"NavigationDataPlayer\".\r\n *\/\r\nint mitkNavigationDataPlayerTest(int \/* argc *\/, char* \/*argv*\/[])\r\n{\r\n MITK_TEST_BEGIN(\"NavigationDataPlayer\");\r\n std::string tmp = \"\";\r\n std::ostringstream* stream = new std::ostringstream( std::ostringstream::trunc );\r\n\r\n \/\/ let's create an object of our class \r\n mitk::NavigationDataPlayer::Pointer player = mitk::NavigationDataPlayer::New();\r\n \r\n \/\/ first test: did this work?\r\n \/\/ using MITK_TEST_CONDITION_REQUIRED makes the test stop after failure, since\r\n \/\/ it makes no sense to continue without an object.\r\n MITK_TEST_CONDITION_REQUIRED(player.IsNotNull(), \"Testing instantiation\");\r\n\r\n std::string file = mitk::StandardFileLocations::GetInstance()->FindFile(\"NavigationDataTestData.xml\", \"Modules\/IGT\/Testing\/Data\");\r\n\r\n player->SetFileName( file );\r\n\r\n MITK_TEST_CONDITION_REQUIRED( strcmp(player->GetFileName(), file.c_str()) == 0, \"Testing SetFileName and GetFileName\");\r\n\r\n player->SetStream( mitk::NavigationDataPlayer::NormalFile );\r\n player->StartPlaying();\r\n player->Update();\r\n player->StopPlaying();\r\n\r\n mitk::NavigationData::Pointer nd = player->GetOutput();\r\n mitk::Point3D pnt;\r\n pnt[0] = 1;\r\n pnt[1] = 0;\r\n pnt[2] = 3;\r\n\r\n MITK_TEST_CONDITION_REQUIRED( nd->GetPosition() == pnt, \"Testing position of replayed NavigaionData\" );\r\n \/\/MITK_TEST_CONDITION_REQUIRED( nd->GetTimeStamp() == 3068.94, \"Testing for correct TimeStamp\" );\r\n\r\n\r\n std::vector<double> times, refTimes;\r\n refTimes.resize(5);\r\n refTimes[0] = 3.9;\r\n refTimes[1] = 83.6;\r\n refTimes[2] = 174.4;\r\n refTimes[3] = 275.0;\r\n refTimes[4] = 385.39;\r\n\r\n mitk::TimeStamp::Pointer timer = mitk::TimeStamp::GetInstance();\r\n timer->Initialize();\r\n\r\n itk::Object::Pointer obj = itk::Object::New();\r\n timer->Start( obj );\r\n\r\n mitk::Point3D oldPos;\r\n oldPos[0] = 1;\r\n oldPos[1] = 0;\r\n oldPos[2] = 3;\r\n \/\/pnt = oldPos;\r\n player->StartPlaying();\r\n while( times.size()<5 )\r\n {\r\n player->Update();\r\n pnt = nd->GetPosition();\r\n if ( pnt != oldPos )\r\n {\r\n times.push_back( timer->GetElapsed(obj) );\r\n oldPos = pnt;\r\n }\r\n }\r\n\r\n \/\/ if this test fails, it may be because the dartclient runs on a virtual machine.\r\n \/\/ Under these circumstances, it may be impossible to achieve a time-accuracy of 10ms\r\n for ( int i=0;i<5;i++ )\r\n {\r\n std::cout << \"ref: \" << refTimes[i] << \" \/ time elapsed: \" << times[i] << std::endl;\r\n MITK_TEST_CONDITION_REQUIRED( (times[i]>refTimes[i]-10 && times[i]<refTimes[i]+10), \"checking for more or less correct time-line\" );\r\n }\r\n\r\n\r\n \/\/ always end with this!\r\n MITK_TEST_END();\r\n}\r\n<commit_msg>STYLE: removed unused variable<commit_after>\/*=========================================================================\r\n\r\nProgram: Medical Imaging & Interaction Toolkit\r\nLanguage: C++\r\nDate: $Date: 2009-05-13 14:52:01 +0200 (Mi, 13. Mai 2009) $\r\nVersion: $Revision: 17230 $\r\n\r\nCopyright (c) German Cancer Research Center, Division of Medical and\r\nBiological Informatics. All rights reserved.\r\nSee MITKCopyright.txt or http:\/\/www.mitk.org\/copyright.html for details.\r\n\r\nThis software is distributed WITHOUT ANY WARRANTY; without even\r\nthe implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR\r\nPURPOSE. See the above copyright notices for more information.\r\n\r\n=========================================================================*\/\r\n\r\n#include \"mitkNavigationDataPlayer.h\"\r\n#include \"mitkNavigationData.h\"\r\n\r\n#include \"mitkTestingMacros.h\"\r\n#include \"mitkStandardFileLocations.h\"\r\n#include \"mitkTimeStamp.h\"\r\n\r\n#include <iostream>\r\n#include <sstream>\r\n\r\n\/**Documentation\r\n * test for the class \"NavigationDataPlayer\".\r\n *\/\r\nint mitkNavigationDataPlayerTest(int \/* argc *\/, char* \/*argv*\/[])\r\n{\r\n MITK_TEST_BEGIN(\"NavigationDataPlayer\");\r\n std::string tmp = \"\";\r\n\r\n \/\/ let's create an object of our class \r\n mitk::NavigationDataPlayer::Pointer player = mitk::NavigationDataPlayer::New();\r\n \r\n \/\/ first test: did this work?\r\n \/\/ using MITK_TEST_CONDITION_REQUIRED makes the test stop after failure, since\r\n \/\/ it makes no sense to continue without an object.\r\n MITK_TEST_CONDITION_REQUIRED(player.IsNotNull(), \"Testing instantiation\");\r\n\r\n std::string file = mitk::StandardFileLocations::GetInstance()->FindFile(\"NavigationDataTestData.xml\", \"Modules\/IGT\/Testing\/Data\");\r\n\r\n player->SetFileName( file );\r\n\r\n MITK_TEST_CONDITION_REQUIRED( strcmp(player->GetFileName(), file.c_str()) == 0, \"Testing SetFileName and GetFileName\");\r\n\r\n player->SetStream( mitk::NavigationDataPlayer::NormalFile );\r\n player->StartPlaying();\r\n player->Update();\r\n player->StopPlaying();\r\n\r\n mitk::NavigationData::Pointer nd = player->GetOutput();\r\n mitk::Point3D pnt;\r\n pnt[0] = 1;\r\n pnt[1] = 0;\r\n pnt[2] = 3;\r\n\r\n MITK_TEST_CONDITION_REQUIRED( nd->GetPosition() == pnt, \"Testing position of replayed NavigaionData\" );\r\n \/\/MITK_TEST_CONDITION_REQUIRED( nd->GetTimeStamp() == 3068.94, \"Testing for correct TimeStamp\" );\r\n\r\n\r\n std::vector<double> times, refTimes;\r\n refTimes.resize(5);\r\n refTimes[0] = 3.9;\r\n refTimes[1] = 83.6;\r\n refTimes[2] = 174.4;\r\n refTimes[3] = 275.0;\r\n refTimes[4] = 385.39;\r\n\r\n mitk::TimeStamp::Pointer timer = mitk::TimeStamp::GetInstance();\r\n timer->Initialize();\r\n\r\n itk::Object::Pointer obj = itk::Object::New();\r\n timer->Start( obj );\r\n\r\n mitk::Point3D oldPos;\r\n oldPos[0] = 1;\r\n oldPos[1] = 0;\r\n oldPos[2] = 3;\r\n \/\/pnt = oldPos;\r\n player->StartPlaying();\r\n while( times.size()<5 )\r\n {\r\n player->Update();\r\n pnt = nd->GetPosition();\r\n if ( pnt != oldPos )\r\n {\r\n times.push_back( timer->GetElapsed(obj) );\r\n oldPos = pnt;\r\n }\r\n }\r\n\r\n \/\/ if this test fails, it may be because the dartclient runs on a virtual machine.\r\n \/\/ Under these circumstances, it may be impossible to achieve a time-accuracy of 10ms\r\n for ( int i=0;i<5;i++ )\r\n {\r\n std::cout << \"ref: \" << refTimes[i] << \" \/ time elapsed: \" << times[i] << std::endl;\r\n MITK_TEST_CONDITION_REQUIRED( (times[i]>refTimes[i]-10 && times[i]<refTimes[i]+10), \"checking for more or less correct time-line\" );\r\n }\r\n\r\n\r\n \/\/ always end with this!\r\n MITK_TEST_END();\r\n}\r\n<|endoftext|>"} {"text":"<commit_before>#include <catch.hpp>\n#include <ProgramOptions.hxx>\n#include \"arg_provider.hxx\"\n\nTEST_CASE( \"callback\", \"[ProgramOptions]\" ) {\n\tpo::parser parser;\n\tparser.silent();\n\n\tpo::i32_t a_value{};\n\tpo::string_t a_value_str{};\n\tstd::size_t a_counter_1 = 0;\n\tstd::size_t a_counter_2 = 0;\n\tauto&& a = parser[ \"a\" ]\n\t\t.type( po::i32 )\n\t\t.callback( [ & ]( po::i32_t const& value ){ ++a_counter_1; a_value = value; } )\n\t\t.callback( [ & ]( po::string_t const& value ){ ++a_counter_2; a_value_str = value; } );\n\n\tpo::i64_t b_value{};\n\tpo::string_t b_value_str{};\n\tstd::size_t b_counter_1 = 0;\n\tstd::size_t b_counter_2 = 0;\n\tauto&& b = parser[ \"b\" ]\n\t\t.type( po::i64 )\n\t\t.callback( [ & ]( po::i64_t const& value ){ ++b_counter_1; b_value = value; } )\n\t\t.callback( [ & ]( po::string_t const& value ){ ++b_counter_2; b_value_str = value; } );\n\n\tpo::u32_t c_value{};\n\tpo::string_t c_value_str{};\n\tstd::size_t c_counter_1 = 0;\n\tstd::size_t c_counter_2 = 0;\n\tauto&& c = parser[ \"c\" ]\n\t\t.type( po::u32 )\n\t\t.callback( [ & ]( po::u32_t const& value ){ ++c_counter_1; c_value = value; } )\n\t\t.callback( [ & ]( po::string_t const& value ){ ++c_counter_2; c_value_str = value; } );\n\n\tpo::u64_t d_value{};\n\tpo::string_t d_value_str{};\n\tstd::size_t d_counter_1 = 0;\n\tstd::size_t d_counter_2 = 0;\n\tauto&& d = parser[ \"d\" ]\n\t\t.type( po::u64 )\n\t\t.callback( [ & ]( po::u64_t const& value ){ ++d_counter_1; d_value = value; } )\n\t\t.callback( [ & ]( po::string_t const& value ){ ++d_counter_2; d_value_str = value; } );\n\n\tpo::f32_t e_value{};\n\tpo::string_t e_value_str{};\n\tstd::size_t e_counter_1 = 0;\n\tstd::size_t e_counter_2 = 0;\n\tauto&& e = parser[ \"e\" ]\n\t\t.type( po::f32 )\n\t\t.callback( [ & ]( po::f32_t const& value ){ ++e_counter_1; e_value = value; } )\n\t\t.callback( [ & ]( po::string_t const& value ){ ++e_counter_2; e_value_str = value; } );\n\n\tpo::f64_t f_value{};\n\tpo::string_t f_value_str{};\n\tstd::size_t f_counter_1 = 0;\n\tstd::size_t f_counter_2 = 0;\n\tauto&& f = parser[ \"f\" ]\n\t\t.type( po::f64 )\n\t\t.callback( [ & ]( po::f64_t const& value ){ ++f_counter_1; f_value = value; } )\n\t\t.callback( [ & ]( po::string_t const& value ){ ++f_counter_2; f_value_str = value; } );\n\n\tpo::string_t g_value{};\n\tstd::size_t g_counter_1 = 0;\n\tauto&& g = parser[ \"g\" ]\n\t\t.type( po::string )\n\t\t.callback( [ & ]( po::string_t const& value ){ ++g_counter_1; g_value = value; } );\n\n\tstd::size_t h_counter_1 = 0;\n\tauto&& h = parser[ \"h\" ]\n\t\t.type( po::void_ )\n\t\t.callback( [ & ](){ ++h_counter_1; } );\n\n\tconst arg_provider A {\n\t\t\"\/Test\",\n\t\t\"-a\",\n\t\t\"-65\",\n\t\t\"-b+14e12\",\n\t\t\"-c12\",\n\t\t\"-c0000000\",\n\t\t\"-d2\",\n\t\t\"-d4\",\n\t\t\"-d42\",\n\t\t\"-e0\",\n\t\t\"-f7.39\",\n\t\t\"-f\",\n\t\t\"-7.39000\",\n\t\t\"-g\",\n\t\t\"foo\",\n\t\t\"-g\",\n\t\t\"bar\",\n\t\t\"-hhhh\"\n\t};\n\tCHECK( parser( A.argc, A.argv ) );\n\n\tCHECK( a_value == -65 );\n\tCHECK( a_value_str == \"-65\" );\n\tCHECK( a_counter_1 == 1 );\n\tCHECK( a_counter_2 == 1 );\n\n\tCHECK( b_value == 14000000000000 );\n\tCHECK( b_value_str == \"+14e12\" );\n\tCHECK( b_counter_1 == 1 );\n\tCHECK( b_counter_2 == 1 );\n\n\tCHECK( c_value == 0 );\n\tCHECK( c_value_str == \"0000000\" );\n\tCHECK( c_counter_1 == 2 );\n\tCHECK( c_counter_2 == 2 );\n\n\tCHECK( d_value == 42 );\n\tCHECK( d_value_str == \"42\" );\n\tCHECK( d_counter_1 == 3 );\n\tCHECK( d_counter_2 == 3 );\n\n\tCHECK( e_value == 0 );\n\tCHECK( e_value_str == \"0\" );\n\tCHECK( e_counter_1 == 1 );\n\tCHECK( e_counter_2 == 1 );\n\n\tCHECK( f_value == Approx( -7.39 ) );\n\tCHECK( f_value_str == \"-7.39000\" );\n\tCHECK( f_counter_1 == 2 );\n\tCHECK( f_counter_2 == 2 );\n\n\tCHECK( g_value == \"bar\" );\n\tCHECK( g_counter_1 == 2 );\n\n\tCHECK( h_counter_1 == 4 );\n}\n<commit_msg>remove unnecessary reference variables in callback.cxx<commit_after>#include <catch.hpp>\n#include <ProgramOptions.hxx>\n#include \"arg_provider.hxx\"\n\nTEST_CASE( \"callback\", \"[ProgramOptions]\" ) {\n\tpo::parser parser;\n\tparser.silent();\n\n\tpo::i32_t a_value{};\n\tpo::string_t a_value_str{};\n\tstd::size_t a_counter_1 = 0;\n\tstd::size_t a_counter_2 = 0;\n\tparser[ \"a\" ]\n\t\t.type( po::i32 )\n\t\t.callback( [ & ]( po::i32_t const& value ){ ++a_counter_1; a_value = value; } )\n\t\t.callback( [ & ]( po::string_t const& value ){ ++a_counter_2; a_value_str = value; } );\n\n\tpo::i64_t b_value{};\n\tpo::string_t b_value_str{};\n\tstd::size_t b_counter_1 = 0;\n\tstd::size_t b_counter_2 = 0;\n\tparser[ \"b\" ]\n\t\t.type( po::i64 )\n\t\t.callback( [ & ]( po::i64_t const& value ){ ++b_counter_1; b_value = value; } )\n\t\t.callback( [ & ]( po::string_t const& value ){ ++b_counter_2; b_value_str = value; } );\n\n\tpo::u32_t c_value{};\n\tpo::string_t c_value_str{};\n\tstd::size_t c_counter_1 = 0;\n\tstd::size_t c_counter_2 = 0;\n\tparser[ \"c\" ]\n\t\t.type( po::u32 )\n\t\t.callback( [ & ]( po::u32_t const& value ){ ++c_counter_1; c_value = value; } )\n\t\t.callback( [ & ]( po::string_t const& value ){ ++c_counter_2; c_value_str = value; } );\n\n\tpo::u64_t d_value{};\n\tpo::string_t d_value_str{};\n\tstd::size_t d_counter_1 = 0;\n\tstd::size_t d_counter_2 = 0;\n\tparser[ \"d\" ]\n\t\t.type( po::u64 )\n\t\t.callback( [ & ]( po::u64_t const& value ){ ++d_counter_1; d_value = value; } )\n\t\t.callback( [ & ]( po::string_t const& value ){ ++d_counter_2; d_value_str = value; } );\n\n\tpo::f32_t e_value{};\n\tpo::string_t e_value_str{};\n\tstd::size_t e_counter_1 = 0;\n\tstd::size_t e_counter_2 = 0;\n\tparser[ \"e\" ]\n\t\t.type( po::f32 )\n\t\t.callback( [ & ]( po::f32_t const& value ){ ++e_counter_1; e_value = value; } )\n\t\t.callback( [ & ]( po::string_t const& value ){ ++e_counter_2; e_value_str = value; } );\n\n\tpo::f64_t f_value{};\n\tpo::string_t f_value_str{};\n\tstd::size_t f_counter_1 = 0;\n\tstd::size_t f_counter_2 = 0;\n\tparser[ \"f\" ]\n\t\t.type( po::f64 )\n\t\t.callback( [ & ]( po::f64_t const& value ){ ++f_counter_1; f_value = value; } )\n\t\t.callback( [ & ]( po::string_t const& value ){ ++f_counter_2; f_value_str = value; } );\n\n\tpo::string_t g_value{};\n\tstd::size_t g_counter_1 = 0;\n\tparser[ \"g\" ]\n\t\t.type( po::string )\n\t\t.callback( [ & ]( po::string_t const& value ){ ++g_counter_1; g_value = value; } );\n\n\tstd::size_t h_counter_1 = 0;\n\tparser[ \"h\" ]\n\t\t.type( po::void_ )\n\t\t.callback( [ & ](){ ++h_counter_1; } );\n\n\tconst arg_provider A {\n\t\t\"\/Test\",\n\t\t\"-a\",\n\t\t\"-65\",\n\t\t\"-b+14e12\",\n\t\t\"-c12\",\n\t\t\"-c0000000\",\n\t\t\"-d2\",\n\t\t\"-d4\",\n\t\t\"-d42\",\n\t\t\"-e0\",\n\t\t\"-f7.39\",\n\t\t\"-f\",\n\t\t\"-7.39000\",\n\t\t\"-g\",\n\t\t\"foo\",\n\t\t\"-g\",\n\t\t\"bar\",\n\t\t\"-hhhh\"\n\t};\n\tCHECK( parser( A.argc, A.argv ) );\n\n\tCHECK( a_value == -65 );\n\tCHECK( a_value_str == \"-65\" );\n\tCHECK( a_counter_1 == 1 );\n\tCHECK( a_counter_2 == 1 );\n\n\tCHECK( b_value == 14000000000000 );\n\tCHECK( b_value_str == \"+14e12\" );\n\tCHECK( b_counter_1 == 1 );\n\tCHECK( b_counter_2 == 1 );\n\n\tCHECK( c_value == 0 );\n\tCHECK( c_value_str == \"0000000\" );\n\tCHECK( c_counter_1 == 2 );\n\tCHECK( c_counter_2 == 2 );\n\n\tCHECK( d_value == 42 );\n\tCHECK( d_value_str == \"42\" );\n\tCHECK( d_counter_1 == 3 );\n\tCHECK( d_counter_2 == 3 );\n\n\tCHECK( e_value == 0 );\n\tCHECK( e_value_str == \"0\" );\n\tCHECK( e_counter_1 == 1 );\n\tCHECK( e_counter_2 == 1 );\n\n\tCHECK( f_value == Approx( -7.39 ) );\n\tCHECK( f_value_str == \"-7.39000\" );\n\tCHECK( f_counter_1 == 2 );\n\tCHECK( f_counter_2 == 2 );\n\n\tCHECK( g_value == \"bar\" );\n\tCHECK( g_counter_1 == 2 );\n\n\tCHECK( h_counter_1 == 4 );\n}\n<|endoftext|>"} {"text":"<commit_before>#include \"spec_helper.h\"\n#include \"runtime\/alloc.h\"\n#include \"helpers\/load_language.h\"\n#include \"helpers\/read_test_entries.h\"\n#include \"helpers\/spy_input.h\"\n#include \"helpers\/stderr_logger.h\"\n#include \"helpers\/point_helpers.h\"\n#include \"helpers\/encoding_helpers.h\"\n#include \"helpers\/record_alloc.h\"\n#include \"helpers\/random_helpers.h\"\n#include \"helpers\/scope_sequence.h\"\n#include <set>\n\nstatic void assert_correct_tree_shape(const TSDocument *document, string tree_string) {\n TSNode root_node = ts_document_root_node(document);\n const char *node_string = ts_node_string(root_node, document);\n string result(node_string);\n ts_free((void *)node_string);\n AssertThat(result, Equals(tree_string));\n}\n\nstatic void assert_consistent_sizes(TSNode node) {\n size_t child_count = ts_node_child_count(node);\n size_t start_byte = ts_node_start_byte(node);\n size_t end_byte = ts_node_end_byte(node);\n TSPoint start_point = ts_node_start_point(node);\n TSPoint end_point = ts_node_end_point(node);\n bool some_child_has_changes = false;\n\n AssertThat(start_byte, !IsGreaterThan(end_byte));\n AssertThat(start_point, !IsGreaterThan(end_point));\n\n size_t last_child_end_byte = start_byte;\n TSPoint last_child_end_point = start_point;\n\n for (size_t i = 0; i < child_count; i++) {\n TSNode child = ts_node_child(node, i);\n size_t child_start_byte = ts_node_start_byte(child);\n TSPoint child_start_point = ts_node_start_point(child);\n\n AssertThat(child_start_byte, !IsLessThan(last_child_end_byte));\n AssertThat(child_start_point, !IsLessThan(last_child_end_point));\n assert_consistent_sizes(child);\n if (ts_node_has_changes(child))\n some_child_has_changes = true;\n\n last_child_end_byte = ts_node_end_byte(child);\n last_child_end_point = ts_node_end_point(child);\n }\n\n if (child_count > 0) {\n AssertThat(end_byte, !IsLessThan(last_child_end_byte));\n AssertThat(end_point, !IsLessThan(last_child_end_point));\n }\n\n if (some_child_has_changes) {\n AssertThat(ts_node_has_changes(node), IsTrue());\n }\n}\n\nstatic void assert_correct_tree_size(TSDocument *document, string content) {\n TSNode root_node = ts_document_root_node(document);\n size_t expected_size = content.size();\n\n \/\/ In the JSON grammar, the start rule (`_value`) is hidden, so the node\n \/\/ returned from `ts_document_root_node` (e.g. an `object` node), does not\n \/\/ actually point to the root of the tree. In this weird case, trailing\n \/\/ whitespace is not included in the root node's size.\n \/\/\n \/\/ TODO: Fix this inconsistency. Maybe disallow the start rule being hidden?\n if (ts_document_language(document) == get_test_language(\"json\") &&\n string(ts_node_type(root_node, document)) != \"ERROR\")\n expected_size = content.find_last_not_of(\"\\n \") + 1;\n\n AssertThat(ts_node_end_byte(root_node), Equals(expected_size));\n assert_consistent_sizes(root_node);\n}\n\nSTART_TEST\n\ndescribe(\"The Corpus\", []() {\n vector<string> test_languages({\n \"javascript\",\n \"json\",\n \"c\",\n \"cpp\",\n \"python\",\n });\n\n for (auto &language_name : test_languages) {\n describe((\"the \" + language_name + \" language\").c_str(), [&]() {\n TSDocument *document;\n\n before_each([&]() {\n record_alloc::start();\n document = ts_document_new();\n ts_document_set_language(document, get_test_language(language_name));\n\n \/\/ ts_document_set_logger(document, stderr_logger_new(true));\n \/\/ ts_document_print_debugging_graphs(document, true);\n });\n\n after_each([&]() {\n ts_document_free(document);\n AssertThat(record_alloc::outstanding_allocation_indices(), IsEmpty());\n });\n\n for (auto &entry : read_corpus_entries(language_name)) {\n SpyInput *input;\n\n auto it_handles_edit_sequence = [&](string name, std::function<void()> edit_sequence){\n it((\"parses \" + entry.description + \": \" + name).c_str(), [&]() {\n input = new SpyInput(entry.input, 3);\n ts_document_set_input(document, input->input());\n edit_sequence();\n assert_correct_tree_shape(document, entry.tree_string);\n assert_correct_tree_size(document, input->content);\n delete input;\n });\n };\n\n it_handles_edit_sequence(\"initial parse\", [&]() {\n ts_document_parse(document);\n });\n\n std::set<std::pair<size_t, size_t>> deletions;\n std::set<std::pair<size_t, string>> insertions;\n\n for (size_t i = 0; i < 60; i++) {\n size_t edit_position = random() % utf8_char_count(entry.input);\n size_t deletion_size = random() % (utf8_char_count(entry.input) - edit_position);\n string inserted_text = random_words(random() % 4 + 1);\n\n if (language_name == \"python\") return;\n\n if (insertions.insert({edit_position, inserted_text}).second) {\n string description = \"\\\"\" + inserted_text + \"\\\" at \" + to_string(edit_position);\n\n it_handles_edit_sequence(\"repairing an insertion of \" + description, [&]() {\n ts_document_edit(document, input->replace(edit_position, 0, inserted_text));\n ts_document_parse(document);\n assert_correct_tree_size(document, input->content);\n\n ts_document_edit(document, input->undo());\n assert_correct_tree_size(document, input->content);\n\n TSRange *ranges;\n uint32_t range_count;\n ScopeSequence old_scope_sequence = build_scope_sequence(document, input->content);\n ts_document_parse_and_get_changed_ranges(document, &ranges, &range_count);\n\n ScopeSequence new_scope_sequence = build_scope_sequence(document, input->content);\n verify_changed_ranges(old_scope_sequence, new_scope_sequence,\n input->content, ranges, range_count);\n ts_free(ranges);\n });\n }\n\n if (deletions.insert({edit_position, deletion_size}).second) {\n string desription = to_string(edit_position) + \"-\" + to_string(edit_position + deletion_size);\n\n it_handles_edit_sequence(\"repairing a deletion of \" + desription, [&]() {\n ts_document_edit(document, input->replace(edit_position, deletion_size, \"\"));\n ts_document_parse(document);\n assert_correct_tree_size(document, input->content);\n\n ts_document_edit(document, input->undo());\n assert_correct_tree_size(document, input->content);\n\n TSRange *ranges;\n uint32_t range_count;\n ScopeSequence old_scope_sequence = build_scope_sequence(document, input->content);\n ts_document_parse_and_get_changed_ranges(document, &ranges, &range_count);\n\n ScopeSequence new_scope_sequence = build_scope_sequence(document, input->content);\n verify_changed_ranges(old_scope_sequence, new_scope_sequence,\n input->content, ranges, range_count);\n ts_free(ranges);\n });\n }\n }\n }\n });\n }\n});\n\nEND_TEST\n<commit_msg>Enable randomized incremental parsing tests for Python<commit_after>#include \"spec_helper.h\"\n#include \"runtime\/alloc.h\"\n#include \"helpers\/load_language.h\"\n#include \"helpers\/read_test_entries.h\"\n#include \"helpers\/spy_input.h\"\n#include \"helpers\/stderr_logger.h\"\n#include \"helpers\/point_helpers.h\"\n#include \"helpers\/encoding_helpers.h\"\n#include \"helpers\/record_alloc.h\"\n#include \"helpers\/random_helpers.h\"\n#include \"helpers\/scope_sequence.h\"\n#include <set>\n\nstatic void assert_correct_tree_shape(const TSDocument *document, string tree_string) {\n TSNode root_node = ts_document_root_node(document);\n const char *node_string = ts_node_string(root_node, document);\n string result(node_string);\n ts_free((void *)node_string);\n AssertThat(result, Equals(tree_string));\n}\n\nstatic void assert_consistent_sizes(TSNode node) {\n size_t child_count = ts_node_child_count(node);\n size_t start_byte = ts_node_start_byte(node);\n size_t end_byte = ts_node_end_byte(node);\n TSPoint start_point = ts_node_start_point(node);\n TSPoint end_point = ts_node_end_point(node);\n bool some_child_has_changes = false;\n\n AssertThat(start_byte, !IsGreaterThan(end_byte));\n AssertThat(start_point, !IsGreaterThan(end_point));\n\n size_t last_child_end_byte = start_byte;\n TSPoint last_child_end_point = start_point;\n\n for (size_t i = 0; i < child_count; i++) {\n TSNode child = ts_node_child(node, i);\n size_t child_start_byte = ts_node_start_byte(child);\n TSPoint child_start_point = ts_node_start_point(child);\n\n AssertThat(child_start_byte, !IsLessThan(last_child_end_byte));\n AssertThat(child_start_point, !IsLessThan(last_child_end_point));\n assert_consistent_sizes(child);\n if (ts_node_has_changes(child))\n some_child_has_changes = true;\n\n last_child_end_byte = ts_node_end_byte(child);\n last_child_end_point = ts_node_end_point(child);\n }\n\n if (child_count > 0) {\n AssertThat(end_byte, !IsLessThan(last_child_end_byte));\n AssertThat(end_point, !IsLessThan(last_child_end_point));\n }\n\n if (some_child_has_changes) {\n AssertThat(ts_node_has_changes(node), IsTrue());\n }\n}\n\nstatic void assert_correct_tree_size(TSDocument *document, string content) {\n TSNode root_node = ts_document_root_node(document);\n size_t expected_size = content.size();\n\n \/\/ In the JSON grammar, the start rule (`_value`) is hidden, so the node\n \/\/ returned from `ts_document_root_node` (e.g. an `object` node), does not\n \/\/ actually point to the root of the tree. In this weird case, trailing\n \/\/ whitespace is not included in the root node's size.\n \/\/\n \/\/ TODO: Fix this inconsistency. Maybe disallow the start rule being hidden?\n if (ts_document_language(document) == get_test_language(\"json\") &&\n string(ts_node_type(root_node, document)) != \"ERROR\")\n expected_size = content.find_last_not_of(\"\\n \") + 1;\n\n AssertThat(ts_node_end_byte(root_node), Equals(expected_size));\n assert_consistent_sizes(root_node);\n}\n\nSTART_TEST\n\ndescribe(\"The Corpus\", []() {\n vector<string> test_languages({\n \"javascript\",\n \"json\",\n \"c\",\n \"cpp\",\n \"python\",\n });\n\n for (auto &language_name : test_languages) {\n describe((\"the \" + language_name + \" language\").c_str(), [&]() {\n TSDocument *document;\n\n before_each([&]() {\n record_alloc::start();\n document = ts_document_new();\n ts_document_set_language(document, get_test_language(language_name));\n\n \/\/ ts_document_set_logger(document, stderr_logger_new(true));\n \/\/ ts_document_print_debugging_graphs(document, true);\n });\n\n after_each([&]() {\n ts_document_free(document);\n AssertThat(record_alloc::outstanding_allocation_indices(), IsEmpty());\n });\n\n for (auto &entry : read_corpus_entries(language_name)) {\n SpyInput *input;\n\n auto it_handles_edit_sequence = [&](string name, std::function<void()> edit_sequence){\n it((\"parses \" + entry.description + \": \" + name).c_str(), [&]() {\n input = new SpyInput(entry.input, 3);\n ts_document_set_input(document, input->input());\n edit_sequence();\n assert_correct_tree_shape(document, entry.tree_string);\n assert_correct_tree_size(document, input->content);\n delete input;\n });\n };\n\n it_handles_edit_sequence(\"initial parse\", [&]() {\n ts_document_parse(document);\n });\n\n std::set<std::pair<size_t, size_t>> deletions;\n std::set<std::pair<size_t, string>> insertions;\n\n for (size_t i = 0; i < 60; i++) {\n size_t edit_position = random() % utf8_char_count(entry.input);\n size_t deletion_size = random() % (utf8_char_count(entry.input) - edit_position);\n string inserted_text = random_words(random() % 4 + 1);\n\n if (insertions.insert({edit_position, inserted_text}).second) {\n string description = \"\\\"\" + inserted_text + \"\\\" at \" + to_string(edit_position);\n\n it_handles_edit_sequence(\"repairing an insertion of \" + description, [&]() {\n ts_document_edit(document, input->replace(edit_position, 0, inserted_text));\n ts_document_parse(document);\n assert_correct_tree_size(document, input->content);\n\n ts_document_edit(document, input->undo());\n assert_correct_tree_size(document, input->content);\n\n TSRange *ranges;\n uint32_t range_count;\n ScopeSequence old_scope_sequence = build_scope_sequence(document, input->content);\n ts_document_parse_and_get_changed_ranges(document, &ranges, &range_count);\n\n ScopeSequence new_scope_sequence = build_scope_sequence(document, input->content);\n verify_changed_ranges(old_scope_sequence, new_scope_sequence,\n input->content, ranges, range_count);\n ts_free(ranges);\n });\n }\n\n if (deletions.insert({edit_position, deletion_size}).second) {\n string desription = to_string(edit_position) + \"-\" + to_string(edit_position + deletion_size);\n\n it_handles_edit_sequence(\"repairing a deletion of \" + desription, [&]() {\n ts_document_edit(document, input->replace(edit_position, deletion_size, \"\"));\n ts_document_parse(document);\n assert_correct_tree_size(document, input->content);\n\n ts_document_edit(document, input->undo());\n assert_correct_tree_size(document, input->content);\n\n TSRange *ranges;\n uint32_t range_count;\n ScopeSequence old_scope_sequence = build_scope_sequence(document, input->content);\n ts_document_parse_and_get_changed_ranges(document, &ranges, &range_count);\n\n ScopeSequence new_scope_sequence = build_scope_sequence(document, input->content);\n verify_changed_ranges(old_scope_sequence, new_scope_sequence,\n input->content, ranges, range_count);\n ts_free(ranges);\n });\n }\n }\n }\n });\n }\n});\n\nEND_TEST\n<|endoftext|>"} {"text":"<commit_before>void AddTask_LMeeCocktailMC(Int_t CollisionSystem = 200, Float_t MaxEta = 0.8, Float_t MinPt = 0.2, Bool_t WriteTTree = kFALSE, Int_t ResolType = 2 , Int_t ALTweightType = 1, TString resFileName = \"\") {\n\n \/\/ ================= Load Librariers =================================\n gSystem->Load(\"libCore\");\n gSystem->Load(\"libTree\");\n gSystem->Load(\"libGeom\");\n gSystem->Load(\"libVMC\");\n gSystem->Load(\"libPhysics\");\n gSystem->Load(\"libMinuit\");\n gSystem->Load(\"libSTEERBase\");\n gSystem->Load(\"libESD\");\n gSystem->Load(\"libAOD\");\n gSystem->Load(\"libANALYSIS\");\n gSystem->Load(\"libANALYSISalice\"); \n gSystem->Load(\"libCDB\");\n gSystem->Load(\"libSTEER\");\n gSystem->Load(\"libSTEERBase\");\n gSystem->Load(\"libTender\");\n gSystem->Load(\"libTenderSupplies\");\n gSystem->Load(\"libPWGflowBase\");\n gSystem->Load(\"libPWGflowTasks\");\n gSystem->Load(\"libPWGGAGammaConv\");\n\n \/\/ ================== GetAnalysisManager ===============================\n AliAnalysisManager *mgr = AliAnalysisManager::GetAnalysisManager();\n if (!mgr) {\n Error(\"AddTask_LMeeCocktailMC\", \"No analysis manager found.\");\n return ;\n }\n\n \/\/ ================== GetInputEventHandler =============================\n AliVEventHandler *inputHandler=mgr->GetInputEventHandler();\n \/\/ find input container\n AliAnalysisDataContainer *cinput = mgr->GetCommonInputContainer();\n\n \/\/================================================\n \/\/========= Add task to the ANALYSIS manager =====\n \/\/================================================\n\n AliAnalysisTaskLMeeCocktailMC *task=NULL;\n task= new AliAnalysisTaskLMeeCocktailMC(Form(\"LMeeCocktailMC_%1.2f\",MaxEta));\n task->SetCollisionSystem(CollisionSystem);\n task->SetMaxEta(MaxEta);\n task->SetMinPt(MinPt);\n task->SetWriteTTree(WriteTTree);\n task->SetResolType(ResolType);\n task->SetALTweight(ALTweightType);\n\tif(pPbDataSetName != \"\"){\n\t\ttask->SetpPbResFileName(resFileName);\n\t}\n \n \/\/connect containers\n AliAnalysisDataContainer *coutput =\n mgr->CreateContainer(Form(\"LMeeCocktailMC_%1.2f\",MaxEta), TList::Class(), AliAnalysisManager::kOutputContainer, Form(\"%s:LMeeCocktailMC\",AliAnalysisManager::GetCommonFileName()));\n \n mgr->AddTask(task);\n mgr->ConnectInput(task,0,cinput);\n mgr->ConnectOutput(task,1,coutput);\n \n return;\n}\n<commit_msg>Variable name<commit_after>void AddTask_LMeeCocktailMC(Int_t CollisionSystem = 200, Float_t MaxEta = 0.8, Float_t MinPt = 0.2, Bool_t WriteTTree = kFALSE, Int_t ResolType = 2 , Int_t ALTweightType = 1, TString resFileName = \"\") {\n\n \/\/ ================= Load Librariers =================================\n gSystem->Load(\"libCore\");\n gSystem->Load(\"libTree\");\n gSystem->Load(\"libGeom\");\n gSystem->Load(\"libVMC\");\n gSystem->Load(\"libPhysics\");\n gSystem->Load(\"libMinuit\");\n gSystem->Load(\"libSTEERBase\");\n gSystem->Load(\"libESD\");\n gSystem->Load(\"libAOD\");\n gSystem->Load(\"libANALYSIS\");\n gSystem->Load(\"libANALYSISalice\"); \n gSystem->Load(\"libCDB\");\n gSystem->Load(\"libSTEER\");\n gSystem->Load(\"libSTEERBase\");\n gSystem->Load(\"libTender\");\n gSystem->Load(\"libTenderSupplies\");\n gSystem->Load(\"libPWGflowBase\");\n gSystem->Load(\"libPWGflowTasks\");\n gSystem->Load(\"libPWGGAGammaConv\");\n\n \/\/ ================== GetAnalysisManager ===============================\n AliAnalysisManager *mgr = AliAnalysisManager::GetAnalysisManager();\n if (!mgr) {\n Error(\"AddTask_LMeeCocktailMC\", \"No analysis manager found.\");\n return ;\n }\n\n \/\/ ================== GetInputEventHandler =============================\n AliVEventHandler *inputHandler=mgr->GetInputEventHandler();\n \/\/ find input container\n AliAnalysisDataContainer *cinput = mgr->GetCommonInputContainer();\n\n \/\/================================================\n \/\/========= Add task to the ANALYSIS manager =====\n \/\/================================================\n\n AliAnalysisTaskLMeeCocktailMC *task=NULL;\n task= new AliAnalysisTaskLMeeCocktailMC(Form(\"LMeeCocktailMC_%1.2f\",MaxEta));\n task->SetCollisionSystem(CollisionSystem);\n task->SetMaxEta(MaxEta);\n task->SetMinPt(MinPt);\n task->SetWriteTTree(WriteTTree);\n task->SetResolType(ResolType);\n task->SetALTweight(ALTweightType);\n\tif(resFileName != \"\"){\n\t\ttask->SetpPbResFileName(resFileName);\n\t}\n \n \/\/connect containers\n AliAnalysisDataContainer *coutput =\n mgr->CreateContainer(Form(\"LMeeCocktailMC_%1.2f\",MaxEta), TList::Class(), AliAnalysisManager::kOutputContainer, Form(\"%s:LMeeCocktailMC\",AliAnalysisManager::GetCommonFileName()));\n \n mgr->AddTask(task);\n mgr->ConnectInput(task,0,cinput);\n mgr->ConnectOutput(task,1,coutput);\n \n return;\n}\n<|endoftext|>"} {"text":"<commit_before>\/**************************************************************************\n * Copyright(c) 1998-1999, ALICE Experiment at CERN, All rights reserved. *\n * *\n * Author: Friederike Bock, Lucia Leardini , A. Marin *\n * Version 1.0 *\n * *\n * *\n * Permission to use, copy, modify and distribute this software and its *\n * documentation strictly for non-commercial purposes is hereby granted *\n * without fee, provided that the above copyright notice appears in all *\n * copies and that both the copyright notice and this permission notice *\n * appear in the supporting documentation. The authors make no claims *\n * about the suitability of this software for any purpose. It is *\n * provided \"as is\" without express or implied warranty. *\n **************************************************************************\/\n\n\/\/***************************************************************************************\n\/\/This AddTask is supposed to set up the main task\n\/\/($ALIPHYSICS\/PWGGA\/GammaConv\/AliAnalysisTaskMaterialHistos.cxx) for\n\/\/pp together with all supporting classes\n\/\/***************************************************************************************\n\n\/\/***************************************************************************************\n\/\/CutHandler contains all cuts for a certain analysis and trainconfig,\n\/\/it automatically checks length of cutStrings and takes care of the number of added cuts,\n\/\/no specification of the variable 'numberOfCuts' needed anymore.\n\/\/***************************************************************************************\n\nclass CutHandlerConv{\n public:\n CutHandlerConv(Int_t nMax=10){\n nCuts=0; nMaxCuts=nMax; validCuts = true;\n eventCutArray = new TString[nMaxCuts]; photonCutArray = new TString[nMaxCuts]; mesonCutArray = new TString[nMaxCuts]; clusterCutArray = new TString[nMaxCuts];\n for(Int_t i=0; i<nMaxCuts; i++) {eventCutArray[i] = \"\"; photonCutArray[i] = \"\"; mesonCutArray[i] = \"\"; clusterCutArray[i] = \"\";}\n }\n void AddCut(TString eventCut, TString photonCut){\n if(nCuts>=nMaxCuts) {cout << \"ERROR in CutHandlerConv: Exceeded maximum number of cuts!\" << endl; validCuts = false; return;}\n if( eventCut.Length()!=8 || photonCut.Length()!=26 ) {cout << \"ERROR in CutHandlerConv: Incorrect length of cut string!\" << endl; validCuts = false; return;}\n eventCutArray[nCuts]=eventCut; photonCutArray[nCuts]=photonCut; mesonCutArray[nCuts]=\"\"; clusterCutArray[nCuts]=\"\";\n nCuts++;\n return;\n }\n void AddCut(TString eventCut, TString photonCut, TString mesonCut){\n if(nCuts>=nMaxCuts) {cout << \"ERROR in CutHandlerConv: Exceeded maximum number of cuts!\" << endl; validCuts = false; return;}\n if( eventCut.Length()!=8 || photonCut.Length()!=26 || mesonCut.Length()!=16 ) {cout << \"ERROR in CutHandlerConv: Incorrect length of cut string!\" << endl; validCuts = false; return;}\n eventCutArray[nCuts]=eventCut; photonCutArray[nCuts]=photonCut; mesonCutArray[nCuts]=mesonCut; clusterCutArray[nCuts]=\"\";\n nCuts++;\n return;\n }\n void AddCut(TString eventCut, TString photonCut, TString mesonCut, TString clusterCut){\n if(nCuts>=nMaxCuts) {cout << \"ERROR in CutHandlerConv: Exceeded maximum number of cuts!\" << endl; validCuts = false; return;}\n if( eventCut.Length()!=8 || photonCut.Length()!=26 || mesonCut.Length()!=16 || clusterCut.Length()!=19 ) {cout << \"ERROR in CutHandlerConv: Incorrect length of cut string!\" << endl; validCuts = false; return;}\n eventCutArray[nCuts]=eventCut; photonCutArray[nCuts]=photonCut; mesonCutArray[nCuts]=mesonCut; clusterCutArray[nCuts]=clusterCut;\n nCuts++;\n return;\n }\n\n Bool_t AreValid(){return validCuts;}\n Int_t GetNCuts(){if(validCuts) return nCuts; else return 0;}\n TString GetEventCut(Int_t i){if(validCuts&&i<nMaxCuts&&i>=0) return eventCutArray[i]; else{cout << \"ERROR in CutHandlerConv: GetEventCut wrong index i\" << endl;return \"\";}}\n TString GetPhotonCut(Int_t i){if(validCuts&&i<nMaxCuts&&i>=0) return photonCutArray[i]; else {cout << \"ERROR in CutHandlerConv: GetPhotonCut wrong index i\" << endl;return \"\";}}\n TString GetMesonCut(Int_t i){if(validCuts&&i<nMaxCuts&&i>=0) return mesonCutArray[i]; else {cout << \"ERROR in CutHandlerConv: GetMesonCut wrong index i\" << endl;return \"\";}}\n TString GetClusterCut(Int_t i){if(validCuts&&i<nMaxCuts&&i>=0) return clusterCutArray[i]; else {cout << \"ERROR in CutHandlerConv: GetClusterCut wrong index i\" << endl;return \"\";}}\n private:\n Bool_t validCuts;\n Int_t nCuts; Int_t nMaxCuts;\n TString* eventCutArray;\n TString* photonCutArray;\n TString* mesonCutArray;\n TString* clusterCutArray;\n};\n\n\n\nvoid AddTask_MaterialHistos_PbPb(\tInt_t trainConfig = 1, \/\/ change different set of cuts\n Int_t \tisMC \t\t\t\t= 0,\n\t\t\t\tTString periodname = \"LHC10b\", \/\/ period name\n\t\t\t\tTString periodNameV0Reader = \"\",\n\t\t\t\tTString periodNameAnchor = \"\",\n\t\t\t\tBool_t \tenableV0findingEffi \t\t= kFALSE\t\t\t\t\t\t\t\/\/ enables V0finding efficiency histograms\n\t\t\t\t){\n\n \/\/ ================= Load Librariers =================================\n gSystem->Load(\"libCore\");\n gSystem->Load(\"libTree\");\n gSystem->Load(\"libGeom\");\n gSystem->Load(\"libVMC\");\n gSystem->Load(\"libPhysics\");\n gSystem->Load(\"libMinuit\");\n gSystem->Load(\"libSTEERBase\");\n gSystem->Load(\"libESD\");\n gSystem->Load(\"libAOD\");\n gSystem->Load(\"libANALYSIS\");\n gSystem->Load(\"libANALYSISalice\"); \n gSystem->Load(\"libCDB\");\n gSystem->Load(\"libSTEER\");\n gSystem->Load(\"libSTEERBase\");\n gSystem->Load(\"libTender\");\n gSystem->Load(\"libTenderSupplies\");\n gSystem->Load(\"libPWGflowBase\");\n gSystem->Load(\"libPWGflowTasks\");\n gSystem->Load(\"libPWGGAGammaConv\");\n \n \n Int_t IsHeavyIon = 1;\n \/\/ ================== GetAnalysisManager ===============================\n AliAnalysisManager *mgr = AliAnalysisManager::GetAnalysisManager();\n if (!mgr) {\n Error(Form(\"AddTask_GammaConvV1_%i\",trainConfig), \"No analysis manager found.\");\n return ;\n }\n \n \/\/ ================== GetInputEventHandler =============================\n AliVEventHandler *inputHandler=mgr->GetInputEventHandler();\n Bool_t isMCForOtherSettings = 0;\n if (isMC > 0) isMCForOtherSettings = 1;\n \/\/========= Add PID Reponse to ANALYSIS manager ====\n if(!(AliPIDResponse*)mgr->GetTask(\"PIDResponseTask\")){\n gROOT->LoadMacro(\"$ALICE_ROOT\/ANALYSIS\/macros\/AddTaskPIDResponse.C\");\n AddTaskPIDResponse(isMCForOtherSettings);\n }\n \n \/\/========= Set Cutnumber for V0Reader ================================\n TString cutnumberPhoton = \"00000000000000000500000000\";\n \/\/00000070000000000500004000 V0 Reader cuts in GammaConv PbPb task \n TString cutnumberEvent = \"10000103\"; \n \/\/10000003\n AliAnalysisDataContainer *cinput = mgr->GetCommonInputContainer();\n\n\n Bool_t enableConstructGamma=kFALSE;\n if (trainConfig>200){\n enableConstructGamma=kTRUE;\n }\n if (trainConfig>100 && trainConfig<200 ){\n cutnumberPhoton = \"10000000000000000500000000\";\n }\n\n\n \n \/\/========= Add V0 Reader to ANALYSIS manager if not yet existent =====\n TString V0ReaderName = Form(\"V0ReaderV1_%s_%s\",cutnumberEvent.Data(),cutnumberPhoton.Data());\n if( !(AliV0ReaderV1*)mgr->GetTask(V0ReaderName.Data()) ){\n AliV0ReaderV1 *fV0ReaderV1 = new AliV0ReaderV1(V0ReaderName.Data());\n if (periodNameV0Reader.CompareTo(\"\") != 0) fV0ReaderV1->SetPeriodName(periodNameV0Reader);\n fV0ReaderV1->SetUseOwnXYZCalculation(kTRUE);\n fV0ReaderV1->SetUseConstructGamma(enableConstructGamma);\n fV0ReaderV1->SetCreateAODs(kFALSE);\/\/ AOD Output\n fV0ReaderV1->SetUseAODConversionPhoton(kTRUE);\n fV0ReaderV1->SetProduceV0FindingEfficiency(enableV0findingEffi);\n if (!mgr) {\n Error(\"AddTask_V0ReaderV1\", \"No analysis manager found.\");\n return;\n }\n \n AliConvEventCuts *fEventCuts=NULL;\n if(cutnumberEvent!=\"\"){\n fEventCuts= new AliConvEventCuts(cutnumberEvent.Data(),cutnumberEvent.Data());\n fEventCuts->SetPreSelectionCutFlag(kTRUE);\n fEventCuts->SetV0ReaderName(V0ReaderName);\n if(fEventCuts->InitializeCutsFromCutString(cutnumberEvent.Data())){\n fV0ReaderV1->SetEventCuts(fEventCuts);\n fEventCuts->SetFillCutHistograms(\"\",kTRUE);\n }\n }\n \n \/\/ Set AnalysisCut Number\n AliConversionPhotonCuts *fCuts=NULL;\n if(cutnumberPhoton!=\"\"){\n fCuts= new AliConversionPhotonCuts(cutnumberPhoton.Data(),cutnumberPhoton.Data());\n fCuts->SetPreSelectionCutFlag(kTRUE);\n fCuts->SetIsHeavyIon(IsHeavyIon);\n fCuts->SetV0ReaderName(V0ReaderName);\n if(fCuts->InitializeCutsFromCutString(cutnumberPhoton.Data())){\n fV0ReaderV1->SetConversionCuts(fCuts);\n fCuts->SetFillCutHistograms(\"\",kTRUE);\n }\n }\n \n \n if(inputHandler->IsA()==AliAODInputHandler::Class()){\n \/\/ AOD mode\n fV0ReaderV1->SetDeltaAODBranchName(Form(\"GammaConv_%s_gamma\",cutnumberAODBranch.Data()));\n }\n fV0ReaderV1->Init();\n \n AliLog::SetGlobalLogLevel(AliLog::kInfo);\n \n \/\/connect input V0Reader\n mgr->AddTask(fV0ReaderV1);\n mgr->ConnectInput(fV0ReaderV1,0,cinput);\n \n } else {\n Error(\"AddTask_V0ReaderV1\", \"Cannot execute AddTask, V0ReaderV1 already exists.\");\n } \n\n \/\/================================================\n \/\/========= Add task to the ANALYSIS manager =====\n \/\/ find input container\n\n\n AliAnalysisTaskMaterialHistos *fMaterialHistos=NULL;\n fMaterialHistos= new AliAnalysisTaskMaterialHistos(Form(\"MaterialHistos_%i\",trainConfig));\n fMaterialHistos->SetIsMC(isMC);\n fMaterialHistos->SetIsHeavyIon(IsHeavyIon);\n fMaterialHistos->SetV0ReaderName(V0ReaderName);\n\n CutHandlerConv cuts;\n if(trainConfig == 1){\n cuts.AddCut(\"20010103\", \"00000009247602008250404000\"); \/\/ INT7, CL1\n\n \/\/ Offline V0Finder is used\n\n } else if(trainConfig == 101){\n cuts.AddCut(\"20010103\", \"10000009247602008250404000\"); \/\/INT7, CL1\n\n }else {\n Error(Form(\"GammaConvV1_%i\",trainConfig), \"wrong trainConfig variable no cuts have been specified for the configuration\");\n return;\n }\n \n\tif(!cuts.AreValid()){\n cout << \"\\n\\n****************************************************\" << endl;\n cout << \"ERROR: No valid cuts stored in CutHandlerConv! Returning...\" << endl;\n cout << \"****************************************************\\n\\n\" << endl;\n return;\n }\n\n Int_t numberOfCuts = cuts.GetNCuts(); \n \n TList *EventCutList = new TList();\n TList *ConvCutList = new TList();\n\n \n EventCutList->SetOwner(kTRUE);\n AliConvEventCuts **analysisEventCuts = new AliConvEventCuts*[numberOfCuts];\n ConvCutList->SetOwner(kTRUE);\n AliConversionPhotonCuts **analysisCuts = new AliConversionPhotonCuts*[numberOfCuts];\n for(Int_t i = 0; i<numberOfCuts; i++){\n analysisEventCuts[i] = new AliConvEventCuts();\n analysisEventCuts[i]->InitializeCutsFromCutString((cuts.GetEventCut(i)).Data());\n analysisEventCuts[i]->SetV0ReaderName(V0ReaderName);\n EventCutList->Add(analysisEventCuts[i]);\n analysisEventCuts[i]->SetFillCutHistograms(\"\",kTRUE);\n\n analysisCuts[i] = new AliConversionPhotonCuts();\n analysisCuts[i]->InitializeCutsFromCutString((cuts.GetPhotonCut(i)).Data());\n analysisCuts[i]->SetV0ReaderName(V0ReaderName);\n ConvCutList->Add(analysisCuts[i]);\n analysisCuts[i]->SetFillCutHistograms(\"\",kTRUE);\n \n }\n\n\n\n\n fMaterialHistos->SetEventCutList(numberOfCuts,EventCutList); \n fMaterialHistos->SetConversionCutList(numberOfCuts,ConvCutList);\n mgr->AddTask(fMaterialHistos);\n\n \n AliAnalysisDataContainer *coutput =\n mgr->CreateContainer(Form(\"GammaConvMaterial_%i\",trainConfig), TList::Class(), \n\t\t\t AliAnalysisManager::kOutputContainer,Form(\"GammaConv_Material_%i.root\",trainConfig ));\n\n mgr->ConnectInput(fMaterialHistos, 0, cinput );\n mgr->ConnectOutput(fMaterialHistos, 1, coutput);\n \/\/connect containers\n\treturn;\n}\n<commit_msg>changed trainconfig material histos PbPb<commit_after>\/**************************************************************************\n * Copyright(c) 1998-1999, ALICE Experiment at CERN, All rights reserved. *\n * *\n * Author: Friederike Bock, Lucia Leardini , A. Marin *\n * Version 1.0 *\n * *\n * *\n * Permission to use, copy, modify and distribute this software and its *\n * documentation strictly for non-commercial purposes is hereby granted *\n * without fee, provided that the above copyright notice appears in all *\n * copies and that both the copyright notice and this permission notice *\n * appear in the supporting documentation. The authors make no claims *\n * about the suitability of this software for any purpose. It is *\n * provided \"as is\" without express or implied warranty. *\n **************************************************************************\/\n\n\/\/***************************************************************************************\n\/\/This AddTask is supposed to set up the main task\n\/\/($ALIPHYSICS\/PWGGA\/GammaConv\/AliAnalysisTaskMaterialHistos.cxx) for\n\/\/pp together with all supporting classes\n\/\/***************************************************************************************\n\n\/\/***************************************************************************************\n\/\/CutHandler contains all cuts for a certain analysis and trainconfig,\n\/\/it automatically checks length of cutStrings and takes care of the number of added cuts,\n\/\/no specification of the variable 'numberOfCuts' needed anymore.\n\/\/***************************************************************************************\n\nclass CutHandlerConv{\n public:\n CutHandlerConv(Int_t nMax=10){\n nCuts=0; nMaxCuts=nMax; validCuts = true;\n eventCutArray = new TString[nMaxCuts]; photonCutArray = new TString[nMaxCuts]; mesonCutArray = new TString[nMaxCuts]; clusterCutArray = new TString[nMaxCuts];\n for(Int_t i=0; i<nMaxCuts; i++) {eventCutArray[i] = \"\"; photonCutArray[i] = \"\"; mesonCutArray[i] = \"\"; clusterCutArray[i] = \"\";}\n }\n void AddCut(TString eventCut, TString photonCut){\n if(nCuts>=nMaxCuts) {cout << \"ERROR in CutHandlerConv: Exceeded maximum number of cuts!\" << endl; validCuts = false; return;}\n if( eventCut.Length()!=8 || photonCut.Length()!=26 ) {cout << \"ERROR in CutHandlerConv: Incorrect length of cut string!\" << endl; validCuts = false; return;}\n eventCutArray[nCuts]=eventCut; photonCutArray[nCuts]=photonCut; mesonCutArray[nCuts]=\"\"; clusterCutArray[nCuts]=\"\";\n nCuts++;\n return;\n }\n void AddCut(TString eventCut, TString photonCut, TString mesonCut){\n if(nCuts>=nMaxCuts) {cout << \"ERROR in CutHandlerConv: Exceeded maximum number of cuts!\" << endl; validCuts = false; return;}\n if( eventCut.Length()!=8 || photonCut.Length()!=26 || mesonCut.Length()!=16 ) {cout << \"ERROR in CutHandlerConv: Incorrect length of cut string!\" << endl; validCuts = false; return;}\n eventCutArray[nCuts]=eventCut; photonCutArray[nCuts]=photonCut; mesonCutArray[nCuts]=mesonCut; clusterCutArray[nCuts]=\"\";\n nCuts++;\n return;\n }\n void AddCut(TString eventCut, TString photonCut, TString mesonCut, TString clusterCut){\n if(nCuts>=nMaxCuts) {cout << \"ERROR in CutHandlerConv: Exceeded maximum number of cuts!\" << endl; validCuts = false; return;}\n if( eventCut.Length()!=8 || photonCut.Length()!=26 || mesonCut.Length()!=16 || clusterCut.Length()!=19 ) {cout << \"ERROR in CutHandlerConv: Incorrect length of cut string!\" << endl; validCuts = false; return;}\n eventCutArray[nCuts]=eventCut; photonCutArray[nCuts]=photonCut; mesonCutArray[nCuts]=mesonCut; clusterCutArray[nCuts]=clusterCut;\n nCuts++;\n return;\n }\n\n Bool_t AreValid(){return validCuts;}\n Int_t GetNCuts(){if(validCuts) return nCuts; else return 0;}\n TString GetEventCut(Int_t i){if(validCuts&&i<nMaxCuts&&i>=0) return eventCutArray[i]; else{cout << \"ERROR in CutHandlerConv: GetEventCut wrong index i\" << endl;return \"\";}}\n TString GetPhotonCut(Int_t i){if(validCuts&&i<nMaxCuts&&i>=0) return photonCutArray[i]; else {cout << \"ERROR in CutHandlerConv: GetPhotonCut wrong index i\" << endl;return \"\";}}\n TString GetMesonCut(Int_t i){if(validCuts&&i<nMaxCuts&&i>=0) return mesonCutArray[i]; else {cout << \"ERROR in CutHandlerConv: GetMesonCut wrong index i\" << endl;return \"\";}}\n TString GetClusterCut(Int_t i){if(validCuts&&i<nMaxCuts&&i>=0) return clusterCutArray[i]; else {cout << \"ERROR in CutHandlerConv: GetClusterCut wrong index i\" << endl;return \"\";}}\n private:\n Bool_t validCuts;\n Int_t nCuts; Int_t nMaxCuts;\n TString* eventCutArray;\n TString* photonCutArray;\n TString* mesonCutArray;\n TString* clusterCutArray;\n};\n\n\n\nvoid AddTask_MaterialHistos_PbPb(\tInt_t trainConfig = 1, \/\/ change different set of cuts\n Int_t \tisMC \t\t\t\t= 0,\n\t\t\t\tTString periodname = \"LHC10b\", \/\/ period name\n\t\t\t\tTString periodNameV0Reader = \"\",\n\t\t\t\tTString periodNameAnchor = \"\",\n\t\t\t\tBool_t \tenableV0findingEffi \t\t= kFALSE\t\t\t\t\t\t\t\/\/ enables V0finding efficiency histograms\n\t\t\t\t){\n\n \/\/ ================= Load Librariers =================================\n gSystem->Load(\"libCore\");\n gSystem->Load(\"libTree\");\n gSystem->Load(\"libGeom\");\n gSystem->Load(\"libVMC\");\n gSystem->Load(\"libPhysics\");\n gSystem->Load(\"libMinuit\");\n gSystem->Load(\"libSTEERBase\");\n gSystem->Load(\"libESD\");\n gSystem->Load(\"libAOD\");\n gSystem->Load(\"libANALYSIS\");\n gSystem->Load(\"libANALYSISalice\"); \n gSystem->Load(\"libCDB\");\n gSystem->Load(\"libSTEER\");\n gSystem->Load(\"libSTEERBase\");\n gSystem->Load(\"libTender\");\n gSystem->Load(\"libTenderSupplies\");\n gSystem->Load(\"libPWGflowBase\");\n gSystem->Load(\"libPWGflowTasks\");\n gSystem->Load(\"libPWGGAGammaConv\");\n \n \n Int_t IsHeavyIon = 1;\n \/\/ ================== GetAnalysisManager ===============================\n AliAnalysisManager *mgr = AliAnalysisManager::GetAnalysisManager();\n if (!mgr) {\n Error(Form(\"AddTask_GammaConvV1_%i\",trainConfig), \"No analysis manager found.\");\n return ;\n }\n \n \/\/ ================== GetInputEventHandler =============================\n AliVEventHandler *inputHandler=mgr->GetInputEventHandler();\n Bool_t isMCForOtherSettings = 0;\n if (isMC > 0) isMCForOtherSettings = 1;\n \/\/========= Add PID Reponse to ANALYSIS manager ====\n if(!(AliPIDResponse*)mgr->GetTask(\"PIDResponseTask\")){\n gROOT->LoadMacro(\"$ALICE_ROOT\/ANALYSIS\/macros\/AddTaskPIDResponse.C\");\n AddTaskPIDResponse(isMCForOtherSettings);\n }\n \n \/\/========= Set Cutnumber for V0Reader ================================\n TString cutnumberPhoton = \"00000000000000000500000000\";\n TString cutnumberEvent = \"10000003\";\n AliAnalysisDataContainer *cinput = mgr->GetCommonInputContainer();\n\n\n Bool_t enableConstructGamma=kFALSE;\n if (trainConfig>200){\n enableConstructGamma=kTRUE;\n }\n if (trainConfig>100 && trainConfig<200 ){\n cutnumberPhoton = \"10000000000000000500000000\";\n }\n\n\n \n \/\/========= Add V0 Reader to ANALYSIS manager if not yet existent =====\n TString V0ReaderName = Form(\"V0ReaderV1_%s_%s\",cutnumberEvent.Data(),cutnumberPhoton.Data());\n if( !(AliV0ReaderV1*)mgr->GetTask(V0ReaderName.Data()) ){\n AliV0ReaderV1 *fV0ReaderV1 = new AliV0ReaderV1(V0ReaderName.Data());\n if (periodNameV0Reader.CompareTo(\"\") != 0) fV0ReaderV1->SetPeriodName(periodNameV0Reader);\n fV0ReaderV1->SetUseOwnXYZCalculation(kTRUE);\n fV0ReaderV1->SetUseConstructGamma(enableConstructGamma);\n fV0ReaderV1->SetCreateAODs(kFALSE);\/\/ AOD Output\n fV0ReaderV1->SetUseAODConversionPhoton(kTRUE);\n fV0ReaderV1->SetProduceV0FindingEfficiency(enableV0findingEffi);\n if (!mgr) {\n Error(\"AddTask_V0ReaderV1\", \"No analysis manager found.\");\n return;\n }\n \n AliConvEventCuts *fEventCuts=NULL;\n if(cutnumberEvent!=\"\"){\n fEventCuts= new AliConvEventCuts(cutnumberEvent.Data(),cutnumberEvent.Data());\n fEventCuts->SetPreSelectionCutFlag(kTRUE);\n fEventCuts->SetV0ReaderName(V0ReaderName);\n if(fEventCuts->InitializeCutsFromCutString(cutnumberEvent.Data())){\n fV0ReaderV1->SetEventCuts(fEventCuts);\n fEventCuts->SetFillCutHistograms(\"\",kTRUE);\n }\n }\n \n \/\/ Set AnalysisCut Number\n AliConversionPhotonCuts *fCuts=NULL;\n if(cutnumberPhoton!=\"\"){\n fCuts= new AliConversionPhotonCuts(cutnumberPhoton.Data(),cutnumberPhoton.Data());\n fCuts->SetPreSelectionCutFlag(kTRUE);\n fCuts->SetIsHeavyIon(IsHeavyIon);\n fCuts->SetV0ReaderName(V0ReaderName);\n if(fCuts->InitializeCutsFromCutString(cutnumberPhoton.Data())){\n fV0ReaderV1->SetConversionCuts(fCuts);\n fCuts->SetFillCutHistograms(\"\",kTRUE);\n }\n }\n \n \n if(inputHandler->IsA()==AliAODInputHandler::Class()){\n \/\/ AOD mode\n fV0ReaderV1->SetDeltaAODBranchName(Form(\"GammaConv_%s_gamma\",cutnumberAODBranch.Data()));\n }\n fV0ReaderV1->Init();\n \n AliLog::SetGlobalLogLevel(AliLog::kInfo);\n \n \/\/connect input V0Reader\n mgr->AddTask(fV0ReaderV1);\n mgr->ConnectInput(fV0ReaderV1,0,cinput);\n \n } else {\n Error(\"AddTask_V0ReaderV1\", \"Cannot execute AddTask, V0ReaderV1 already exists.\");\n } \n\n \/\/================================================\n \/\/========= Add task to the ANALYSIS manager =====\n \/\/ find input container\n\n\n AliAnalysisTaskMaterialHistos *fMaterialHistos=NULL;\n fMaterialHistos= new AliAnalysisTaskMaterialHistos(Form(\"MaterialHistos_%i\",trainConfig));\n fMaterialHistos->SetIsMC(isMC);\n fMaterialHistos->SetIsHeavyIon(IsHeavyIon);\n fMaterialHistos->SetV0ReaderName(V0ReaderName);\n\n CutHandlerConv cuts;\n if(trainConfig == 1){\n cuts.AddCut(\"10000013\", \"00000009247602008250404000\"); \/\/ kMB, V0M\n\n \/\/ Offline V0Finder is used\n\n } else if(trainConfig == 101){\n cuts.AddCut(\"20010103\", \"10000009247602008250404000\"); \/\/INT7, CL1\n\n }else {\n Error(Form(\"GammaConvV1_%i\",trainConfig), \"wrong trainConfig variable no cuts have been specified for the configuration\");\n return;\n }\n \n\tif(!cuts.AreValid()){\n cout << \"\\n\\n****************************************************\" << endl;\n cout << \"ERROR: No valid cuts stored in CutHandlerConv! Returning...\" << endl;\n cout << \"****************************************************\\n\\n\" << endl;\n return;\n }\n\n Int_t numberOfCuts = cuts.GetNCuts(); \n \n TList *EventCutList = new TList();\n TList *ConvCutList = new TList();\n\n \n EventCutList->SetOwner(kTRUE);\n AliConvEventCuts **analysisEventCuts = new AliConvEventCuts*[numberOfCuts];\n ConvCutList->SetOwner(kTRUE);\n AliConversionPhotonCuts **analysisCuts = new AliConversionPhotonCuts*[numberOfCuts];\n for(Int_t i = 0; i<numberOfCuts; i++){\n analysisEventCuts[i] = new AliConvEventCuts();\n analysisEventCuts[i]->InitializeCutsFromCutString((cuts.GetEventCut(i)).Data());\n analysisEventCuts[i]->SetV0ReaderName(V0ReaderName);\n EventCutList->Add(analysisEventCuts[i]);\n analysisEventCuts[i]->SetFillCutHistograms(\"\",kTRUE);\n\n analysisCuts[i] = new AliConversionPhotonCuts();\n analysisCuts[i]->InitializeCutsFromCutString((cuts.GetPhotonCut(i)).Data());\n analysisCuts[i]->SetV0ReaderName(V0ReaderName);\n ConvCutList->Add(analysisCuts[i]);\n analysisCuts[i]->SetFillCutHistograms(\"\",kTRUE);\n \n }\n\n\n\n\n fMaterialHistos->SetEventCutList(numberOfCuts,EventCutList); \n fMaterialHistos->SetConversionCutList(numberOfCuts,ConvCutList);\n mgr->AddTask(fMaterialHistos);\n\n \n AliAnalysisDataContainer *coutput =\n mgr->CreateContainer(Form(\"GammaConvMaterial_%i\",trainConfig), TList::Class(), \n\t\t\t AliAnalysisManager::kOutputContainer,Form(\"GammaConv_Material_%i.root\",trainConfig ));\n\n mgr->ConnectInput(fMaterialHistos, 0, cinput );\n mgr->ConnectOutput(fMaterialHistos, 1, coutput);\n \/\/connect containers\n\treturn;\n}\n<|endoftext|>"} {"text":"<commit_before>\/\/ EMCal tender task adder\n\/\/ Author: Jiri Kral\n\nAliTender *AddTaskEMCALTender(const char *geoname=\"EMCAL_COMPLETEV1\", AliEMCALRecParam *pars = 0 )\n{\n \/\/ Parameters: geoname = \"EMCAL_FIRSTYEARV1\" or \"EMCAL_COMPLETEV1\" or \"\"\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(\"AddTaskEMCALTender\", \"No analysis manager to connect to.\");\n return NULL;\n } \n \n \/\/ Create the task and configure it.\n \/\/===========================================================================\n AliTender* ana = new AliTender(\"TenderTask\");\n \n mgr->AddTask(ana);\n\n \/\/ Adding EMCAL supply\n AliEMCALTenderSupply *EMCALSupply=new AliEMCALTenderSupply(\"EMCALtender\"); \n\n EMCALSupply->SetEMCALGeometryName(geoname); \n\n \/\/ prepare the reco params ------------------------------------------------\n\tif( pars == 0 ){\n\t\t\/\/ you can write your reco params here to avoid loading them automatically\n\t\t\/\/ from OCDB during execution time\n\t\tAliEMCALRecParam *params = new AliEMCALRecParam();\n\t\t\/\/ reclustering parameters\n\t\t\/\/ use v1 for pp and v2 for PbPb\n\t\tparams->SetClusterizerFlag(AliEMCALRecParam::kClusterizerv2);\n\t\tparams->SetClusteringThreshold(0.1); \/\/ 100 MeV\n\t\tparams->SetMinECut(0.05); \/\/50 MeV \n\t\tparams->SetW0(4.5);\n\t\t\/\/ you may want to enable the timing cut\n\t\tparams->SetTimeCut(1e6);\/\/ s\n\t\tparams->SetTimeMin(-1);\n\t\tparams->SetTimeMax(1e6);\/\/s\n\n\t\tEMCALSupply->SetRecParam(params);\n\t}\n\telse{\n\t\tcout << \"------- TENDER is using supplied reco params -------\" << endl;\n\t\tpars->Print( \"reco\" );\n\t\tcout << \"----------------------------------------------------\" << endl;\n\t\tEMCALSupply->SetRecParam(pars);\n\t}\n\n \/\/ prepare tender parameters ----------------------------------------------\n EMCALSupply->SetDebugLevel( 0 );\n\n \/\/ fiducial cut\n EMCALSupply->SetNumberOfCellsFromEMCALBorder( 1 );\n\n \/\/ nonlinearity\n EMCALSupply->SetNonLinearityFunction( AliEMCALTenderSupply::kBeamTestCorrected );\n\n \/\/ track matching parameters\n \/\/EMCALSupply->SetMass(0.139);\n \/\/EMCALSupply->SetStep(5);\n EMCALSupply->SwitchOnCutEtaPhiSum(); \n EMCALSupply->SetRCut(0.025);\n \/\/EMCALSupply->SwitchOnCutEtaPhiSeparate();\n EMCALSupply->SetEtaCut(0.025);\n EMCALSupply->SetPhiCut(0.05);\n\n \/\/ switches ---------------------------------------------------------------\n EMCALSupply->SwitchOnBadCellRemove();\n EMCALSupply->SwitchOnExoticCellRemove();\n EMCALSupply->SwitchOnCalibrateEnergy();\n EMCALSupply->SwitchOnCalibrateTime();\n EMCALSupply->SwitchOnUpdateCell();\n EMCALSupply->SwitchOnReclustering();\n EMCALSupply->SwitchOnClusterBadChannelCheck();\n EMCALSupply->SwitchOnClusterExoticChannelCheck();\n EMCALSupply->SwitchOnCellFiducialRegion();\n EMCALSupply->SwitchOnReCalibrateCluster();\n EMCALSupply->SwitchOnRecalculateClusPos();\n EMCALSupply->SwitchOnRecalShowerShape();\n EMCALSupply->SwitchOnRecalDistBadChannel();\n EMCALSupply->SwitchOnNonLinearityCorrection();\n EMCALSupply->SwitchOnTrackMatch();\n \n\n ana->AddSupply(EMCALSupply);\n \/\/ Create ONLY the output containers for the data produced by the task.\n \/\/ Get and connect other common input\/output containers via the manager as below\n \/\/==============================================================================\n\/\/ AliAnalysisDataContainer *coutput1 = mgr->CreateContainer(\"histosEmcalTender\", TList::Class(),AliAnalysisManager::kOutputContainer,Form(\"%s\", AliAnalysisManager::GetCommonFileName()));\n AliAnalysisDataContainer *coutput1 = mgr->CreateContainer(\"emcal_tender_event\", AliESDEvent::Class(),\n AliAnalysisManager::kExchangeContainer,\"emcal_tender\");\n \n mgr->ConnectInput (ana, 0, mgr->GetCommonInputContainer());\n mgr->ConnectOutput (ana, 1, coutput1 );\n \n return ana;\n}\n \n<commit_msg>Switching off reclustering in tender supply for ET analysis<commit_after>\/\/ EMCal tender task adder\n\/\/ Author: Jiri Kral\n\nAliTender *AddTaskEMCALTender(const char *geoname=\"EMCAL_COMPLETEV1\", AliEMCALRecParam *pars = 0 )\n{\n \/\/ Parameters: geoname = \"EMCAL_FIRSTYEARV1\" or \"EMCAL_COMPLETEV1\" or \"\"\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(\"AddTaskEMCALTender\", \"No analysis manager to connect to.\");\n return NULL;\n } \n \n \/\/ Create the task and configure it.\n \/\/===========================================================================\n AliTender* ana = new AliTender(\"TenderTask\");\n \n mgr->AddTask(ana);\n\n \/\/ Adding EMCAL supply\n AliEMCALTenderSupply *EMCALSupply=new AliEMCALTenderSupply(\"EMCALtender\"); \n\n EMCALSupply->SetEMCALGeometryName(geoname); \n\n \/\/ prepare the reco params ------------------------------------------------\n\tif( pars == 0 ){\n\t\t\/\/ you can write your reco params here to avoid loading them automatically\n\t\t\/\/ from OCDB during execution time\n\t\tAliEMCALRecParam *params = new AliEMCALRecParam();\n\t\t\/\/ reclustering parameters\n\t\t\/\/ use v1 for pp and v2 for PbPb\n\t\tparams->SetClusterizerFlag(AliEMCALRecParam::kClusterizerv2);\n\t\tparams->SetClusteringThreshold(0.1); \/\/ 100 MeV\n\t\tparams->SetMinECut(0.05); \/\/50 MeV \n\t\tparams->SetW0(4.5);\n\t\t\/\/ you may want to enable the timing cut\n\t\tparams->SetTimeCut(1e6);\/\/ s\n\t\tparams->SetTimeMin(-1);\n\t\tparams->SetTimeMax(1e6);\/\/s\n\n\t\tEMCALSupply->SetRecParam(params);\n\t}\n\telse{\n\t\tcout << \"------- TENDER is using supplied reco params -------\" << endl;\n\t\tpars->Print( \"reco\" );\n\t\tcout << \"----------------------------------------------------\" << endl;\n\t\tEMCALSupply->SetRecParam(pars);\n\t}\n\n \/\/ prepare tender parameters ----------------------------------------------\n EMCALSupply->SetDebugLevel( 0 );\n\n \/\/ fiducial cut\n EMCALSupply->SetNumberOfCellsFromEMCALBorder( 1 );\n\n \/\/ nonlinearity\n EMCALSupply->SetNonLinearityFunction( AliEMCALTenderSupply::kBeamTestCorrected );\n\n \/\/ track matching parameters\n \/\/EMCALSupply->SetMass(0.139);\n \/\/EMCALSupply->SetStep(5);\n EMCALSupply->SwitchOnCutEtaPhiSum(); \n EMCALSupply->SetRCut(0.025);\n \/\/EMCALSupply->SwitchOnCutEtaPhiSeparate();\n EMCALSupply->SetEtaCut(0.025);\n EMCALSupply->SetPhiCut(0.05);\n\n \/\/ switches ---------------------------------------------------------------\n EMCALSupply->SwitchOnBadCellRemove();\n EMCALSupply->SwitchOnExoticCellRemove();\n EMCALSupply->SwitchOnCalibrateEnergy();\n EMCALSupply->SwitchOnCalibrateTime();\n EMCALSupply->SwitchOnUpdateCell();\n \/\/EMCALSupply->SwitchOnReclustering();\n EMCALSupply->SwitchOnClusterBadChannelCheck();\n EMCALSupply->SwitchOnClusterExoticChannelCheck();\n EMCALSupply->SwitchOnCellFiducialRegion();\n EMCALSupply->SwitchOnReCalibrateCluster();\n EMCALSupply->SwitchOnRecalculateClusPos();\n EMCALSupply->SwitchOnRecalShowerShape();\n EMCALSupply->SwitchOnRecalDistBadChannel();\n EMCALSupply->SwitchOnNonLinearityCorrection();\n EMCALSupply->SwitchOnTrackMatch();\n \n\n ana->AddSupply(EMCALSupply);\n \/\/ Create ONLY the output containers for the data produced by the task.\n \/\/ Get and connect other common input\/output containers via the manager as below\n \/\/==============================================================================\n\/\/ AliAnalysisDataContainer *coutput1 = mgr->CreateContainer(\"histosEmcalTender\", TList::Class(),AliAnalysisManager::kOutputContainer,Form(\"%s\", AliAnalysisManager::GetCommonFileName()));\n AliAnalysisDataContainer *coutput1 = mgr->CreateContainer(\"emcal_tender_event\", AliESDEvent::Class(),\n AliAnalysisManager::kExchangeContainer,\"emcal_tender\");\n \n mgr->ConnectInput (ana, 0, mgr->GetCommonInputContainer());\n mgr->ConnectOutput (ana, 1, coutput1 );\n \n return ana;\n}\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\n#include \"config.h\"\n#include \"platform\/graphics\/GraphicsContextRecorder.h\"\n\n#include \"platform\/graphics\/ImageBuffer.h\"\n#include \"platform\/graphics\/ImageSource.h\"\n#include \"platform\/graphics\/LoggingCanvas.h\"\n#include \"platform\/graphics\/ProfilingCanvas.h\"\n#include \"platform\/graphics\/ReplayingCanvas.h\"\n#include \"platform\/image-decoders\/ImageDecoder.h\"\n#include \"platform\/image-decoders\/ImageFrame.h\"\n#include \"platform\/image-encoders\/skia\/PNGImageEncoder.h\"\n#include \"third_party\/skia\/include\/core\/SkBitmapDevice.h\"\n#include \"third_party\/skia\/include\/core\/SkPictureRecorder.h\"\n#include \"third_party\/skia\/include\/core\/SkStream.h\"\n#include \"wtf\/HexNumber.h\"\n#include \"wtf\/text\/Base64.h\"\n#include \"wtf\/text\/TextEncoding.h\"\n\nnamespace blink {\n\nGraphicsContext* GraphicsContextRecorder::record(const IntSize& size, bool isCertainlyOpaque)\n{\n ASSERT(!m_picture);\n ASSERT(!m_recorder);\n ASSERT(!m_context);\n m_isCertainlyOpaque = isCertainlyOpaque;\n m_recorder = adoptPtr(new SkPictureRecorder);\n SkCanvas* canvas = m_recorder->beginRecording(size.width(), size.height(), 0, 0);\n m_context = adoptPtr(new GraphicsContext(canvas));\n m_context->setRegionTrackingMode(isCertainlyOpaque ? GraphicsContext::RegionTrackingOpaque : GraphicsContext::RegionTrackingDisabled);\n m_context->setCertainlyOpaque(isCertainlyOpaque);\n return m_context.get();\n}\n\nPassRefPtr<GraphicsContextSnapshot> GraphicsContextRecorder::stop()\n{\n m_context.clear();\n m_picture = adoptRef(m_recorder->endRecording());\n m_recorder.clear();\n return adoptRef(new GraphicsContextSnapshot(m_picture.release()));\n}\n\nGraphicsContextSnapshot::GraphicsContextSnapshot(PassRefPtr<SkPicture> picture)\n : m_picture(picture)\n{\n}\n\nstatic bool decodeBitmap(const void* data, size_t length, SkBitmap* result)\n{\n RefPtr<SharedBuffer> buffer = SharedBuffer::create(static_cast<const char*>(data), length);\n OwnPtr<ImageDecoder> imageDecoder = ImageDecoder::create(*buffer, ImageSource::AlphaPremultiplied, ImageSource::GammaAndColorProfileIgnored);\n if (!imageDecoder)\n return false;\n imageDecoder->setData(buffer.get(), true);\n ImageFrame* frame = imageDecoder->frameBufferAtIndex(0);\n if (!frame)\n return true;\n *result = frame->getSkBitmap();\n return true;\n}\n\nPassRefPtr<GraphicsContextSnapshot> GraphicsContextSnapshot::load(const char* data, size_t size)\n{\n SkMemoryStream stream(data, size);\n RefPtr<SkPicture> picture = adoptRef(SkPicture::CreateFromStream(&stream, decodeBitmap));\n if (!picture)\n return nullptr;\n return adoptRef(new GraphicsContextSnapshot(picture));\n}\n\nPassOwnPtr<Vector<char> > GraphicsContextSnapshot::replay(unsigned fromStep, unsigned toStep, double scale) const\n{\n int width = ceil(scale * m_picture->width());\n int height = ceil(scale * m_picture->height());\n SkBitmap bitmap;\n bitmap.allocPixels(SkImageInfo::MakeN32Premul(width, height));\n {\n ReplayingCanvas canvas(bitmap, fromStep, toStep);\n canvas.scale(scale, scale);\n canvas.resetStepCount();\n m_picture->draw(&canvas, &canvas);\n }\n OwnPtr<Vector<char> > base64Data = adoptPtr(new Vector<char>());\n Vector<char> encodedImage;\n if (!PNGImageEncoder::encode(bitmap, reinterpret_cast<Vector<unsigned char>*>(&encodedImage)))\n return nullptr;\n base64Encode(encodedImage, *base64Data);\n return base64Data.release();\n}\n\nPassOwnPtr<GraphicsContextSnapshot::Timings> GraphicsContextSnapshot::profile(unsigned minRepeatCount, double minDuration) const\n{\n OwnPtr<GraphicsContextSnapshot::Timings> timings = adoptPtr(new GraphicsContextSnapshot::Timings());\n timings->reserveCapacity(minRepeatCount);\n SkBitmap bitmap;\n bitmap.allocPixels(SkImageInfo::MakeN32Premul(m_picture->width(), m_picture->height()));\n OwnPtr<ProfilingCanvas> canvas = adoptPtr(new ProfilingCanvas(bitmap));\n\n double now = WTF::monotonicallyIncreasingTime();\n double stopTime = now + minDuration;\n for (unsigned step = 0; step < minRepeatCount || now < stopTime; ++step) {\n timings->append(Vector<double>());\n Vector<double>* currentTimings = &timings->last();\n if (timings->size() > 1)\n currentTimings->reserveCapacity(timings->begin()->size());\n if (step)\n canvas = adoptPtr(new ProfilingCanvas(bitmap));\n canvas->setTimings(currentTimings);\n m_picture->draw(canvas.get());\n now = WTF::monotonicallyIncreasingTime();\n }\n return timings.release();\n}\n\nPassRefPtr<JSONArray> GraphicsContextSnapshot::snapshotCommandLog() const\n{\n LoggingCanvas canvas(m_picture->width(), m_picture->height());\n m_picture->draw(&canvas);\n return canvas.log();\n}\n\n} \/\/ namespace blink\n<commit_msg>Paint Profiler: erase bitmap before replaying SkPicture<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\n#include \"config.h\"\n#include \"platform\/graphics\/GraphicsContextRecorder.h\"\n\n#include \"platform\/graphics\/ImageBuffer.h\"\n#include \"platform\/graphics\/ImageSource.h\"\n#include \"platform\/graphics\/LoggingCanvas.h\"\n#include \"platform\/graphics\/ProfilingCanvas.h\"\n#include \"platform\/graphics\/ReplayingCanvas.h\"\n#include \"platform\/image-decoders\/ImageDecoder.h\"\n#include \"platform\/image-decoders\/ImageFrame.h\"\n#include \"platform\/image-encoders\/skia\/PNGImageEncoder.h\"\n#include \"third_party\/skia\/include\/core\/SkBitmapDevice.h\"\n#include \"third_party\/skia\/include\/core\/SkPictureRecorder.h\"\n#include \"third_party\/skia\/include\/core\/SkStream.h\"\n#include \"wtf\/HexNumber.h\"\n#include \"wtf\/text\/Base64.h\"\n#include \"wtf\/text\/TextEncoding.h\"\n\nnamespace blink {\n\nGraphicsContext* GraphicsContextRecorder::record(const IntSize& size, bool isCertainlyOpaque)\n{\n ASSERT(!m_picture);\n ASSERT(!m_recorder);\n ASSERT(!m_context);\n m_isCertainlyOpaque = isCertainlyOpaque;\n m_recorder = adoptPtr(new SkPictureRecorder);\n SkCanvas* canvas = m_recorder->beginRecording(size.width(), size.height(), 0, 0);\n m_context = adoptPtr(new GraphicsContext(canvas));\n m_context->setRegionTrackingMode(isCertainlyOpaque ? GraphicsContext::RegionTrackingOpaque : GraphicsContext::RegionTrackingDisabled);\n m_context->setCertainlyOpaque(isCertainlyOpaque);\n return m_context.get();\n}\n\nPassRefPtr<GraphicsContextSnapshot> GraphicsContextRecorder::stop()\n{\n m_context.clear();\n m_picture = adoptRef(m_recorder->endRecording());\n m_recorder.clear();\n return adoptRef(new GraphicsContextSnapshot(m_picture.release()));\n}\n\nGraphicsContextSnapshot::GraphicsContextSnapshot(PassRefPtr<SkPicture> picture)\n : m_picture(picture)\n{\n}\n\nstatic bool decodeBitmap(const void* data, size_t length, SkBitmap* result)\n{\n RefPtr<SharedBuffer> buffer = SharedBuffer::create(static_cast<const char*>(data), length);\n OwnPtr<ImageDecoder> imageDecoder = ImageDecoder::create(*buffer, ImageSource::AlphaPremultiplied, ImageSource::GammaAndColorProfileIgnored);\n if (!imageDecoder)\n return false;\n imageDecoder->setData(buffer.get(), true);\n ImageFrame* frame = imageDecoder->frameBufferAtIndex(0);\n if (!frame)\n return true;\n *result = frame->getSkBitmap();\n return true;\n}\n\nPassRefPtr<GraphicsContextSnapshot> GraphicsContextSnapshot::load(const char* data, size_t size)\n{\n SkMemoryStream stream(data, size);\n RefPtr<SkPicture> picture = adoptRef(SkPicture::CreateFromStream(&stream, decodeBitmap));\n if (!picture)\n return nullptr;\n return adoptRef(new GraphicsContextSnapshot(picture));\n}\n\nPassOwnPtr<Vector<char> > GraphicsContextSnapshot::replay(unsigned fromStep, unsigned toStep, double scale) const\n{\n int width = ceil(scale * m_picture->width());\n int height = ceil(scale * m_picture->height());\n SkBitmap bitmap;\n bitmap.allocPixels(SkImageInfo::MakeN32Premul(width, height));\n bitmap.eraseARGB(0, 0, 0, 0);\n {\n ReplayingCanvas canvas(bitmap, fromStep, toStep);\n canvas.scale(scale, scale);\n canvas.resetStepCount();\n m_picture->draw(&canvas, &canvas);\n }\n OwnPtr<Vector<char> > base64Data = adoptPtr(new Vector<char>());\n Vector<char> encodedImage;\n if (!PNGImageEncoder::encode(bitmap, reinterpret_cast<Vector<unsigned char>*>(&encodedImage)))\n return nullptr;\n base64Encode(encodedImage, *base64Data);\n return base64Data.release();\n}\n\nPassOwnPtr<GraphicsContextSnapshot::Timings> GraphicsContextSnapshot::profile(unsigned minRepeatCount, double minDuration) const\n{\n OwnPtr<GraphicsContextSnapshot::Timings> timings = adoptPtr(new GraphicsContextSnapshot::Timings());\n timings->reserveCapacity(minRepeatCount);\n SkBitmap bitmap;\n bitmap.allocPixels(SkImageInfo::MakeN32Premul(m_picture->width(), m_picture->height()));\n OwnPtr<ProfilingCanvas> canvas = adoptPtr(new ProfilingCanvas(bitmap));\n\n double now = WTF::monotonicallyIncreasingTime();\n double stopTime = now + minDuration;\n for (unsigned step = 0; step < minRepeatCount || now < stopTime; ++step) {\n timings->append(Vector<double>());\n Vector<double>* currentTimings = &timings->last();\n if (timings->size() > 1)\n currentTimings->reserveCapacity(timings->begin()->size());\n if (step)\n canvas = adoptPtr(new ProfilingCanvas(bitmap));\n canvas->setTimings(currentTimings);\n m_picture->draw(canvas.get());\n now = WTF::monotonicallyIncreasingTime();\n }\n return timings.release();\n}\n\nPassRefPtr<JSONArray> GraphicsContextSnapshot::snapshotCommandLog() const\n{\n LoggingCanvas canvas(m_picture->width(), m_picture->height());\n m_picture->draw(&canvas);\n return canvas.log();\n}\n\n} \/\/ namespace blink\n<|endoftext|>"} {"text":"<commit_before><commit_msg>Update asio.cpp: fix assert<commit_after><|endoftext|>"} {"text":"<commit_before>#include \"Zenderer\/CoreGraphics\/VertexArray.hpp\"\n\nusing namespace zen::gfxcore;\n\nCVertexArray::CVertexArray(const GLenum type) :\n CGLSubsystem(\"Vertex Array\"),\n m_icount(0), m_vcount(0),\n m_vao(0), m_vbo(0), m_ibo(0),\n m_type(type)\n{\n m_vaoIndices.clear();\n m_vaoVertices.clear();\n}\n\nCVertexArray::~CVertexArray()\n{\n this->Destroy();\n}\n\nbool CVertexArray::Init()\n{\n if(m_init) this->Destroy();\n\n \/\/ Bad GL version.\n if(!glGenVertexArrays) return false;\n\n GL(glGenVertexArrays(1, &m_vao));\n GL(glGenBuffers(1, &m_vbo));\n GL(glGenBuffers(1, &m_ibo));\n\n ZEN_ASSERT(m_vao != 0);\n ZEN_ASSERT(m_vbo != 0);\n ZEN_ASSERT(m_ibo != 0);\n\n return (m_init = true);\n}\n\nbool CVertexArray::Destroy()\n{\n if(!m_init) return true;\n\n ZEN_ASSERT(m_vao != 0);\n ZEN_ASSERT(m_vbo != 0);\n ZEN_ASSERT(m_ibo != 0);\n\n glDeleteVertexArrays(1, &m_vao);\n glDeleteBuffers(1, &m_vbo);\n glDeleteBuffers(1, &m_ibo);\n\n return true;\n}\n\nbool CVertexArray::Bind()\n{\n if(!this->Init()) return false;\n\n GL(glBindVertexArray(m_vao));\n GL(glEnableVertexAttribArray(0)); \/\/ Enable shader attribute 0\n GL(glEnableVertexAttribArray(1));\n GL(glEnableVertexAttribArray(2));\n return true;\n}\n\nbool CVertexArray::Unbind()\n{\n if(!this->Init()) return false;\n\n GL(glBindVertexArray(0));\n\n return true;\n}\n\nindex_t CVertexArray::AddData(const DrawBatch& D)\n{\n ZEN_ASSERTM(D.vcount > 0, \"no buffer vertices given\");\n ZEN_ASSERTM(D.icount > 0, \"no buffer indices given\");\n\n m_vaoVertices.resize(m_vaoVertices.size() + D.vcount);\n for(size_t v = 0; v < D.vcount; ++v)\n m_vaoVertices.push_back(D.Vertices[v]);\n\n size_t offset = m_vaoIndices.size();\n\n m_vaoIndices.resize(m_vaoIndices.size() + D.icount);\n for(size_t i = 0; i < D.icount; ++i)\n m_vaoIndices.push_back(D.Indices[i]);\n\n return offset + m_icount;\n}\n\nbool CVertexArray::Offload()\n{\n if(!this->Bind()) return false;\n if(this->Offloaded()) return false;\n\n \/\/ Check if there's existing data on the buffers.\n GLint bsize = 0;\n glGetBufferParameteriv(GL_ARRAY_BUFFER, GL_BUFFER_SIZE, &bsize);\n\n \/\/ There is!\n if(bsize > 0)\n {\n \/\/ Copy existing buffer data from GPU to local buffer.\n const vertex_t* const data = this->GetVerticesFromGPU();\n vertex_t* tmp = new vertex_t[bsize \/ sizeof(vertex_t)];\n memcpy(tmp, data, bsize);\n glUnmapBuffer(GL_ARRAY_BUFFER);\n\n \/\/ Allocate enough GPU space for all vertex data, new and old.\n \/\/ Pass the old data directly to it.\n glBufferData(GL_ARRAY_BUFFER,\n bsize + (sizeof(vertex_t) * m_vaoVertices.size()),\n tmp, m_type);\n\n \/\/ Pass the latest vertex data at the end of the existing data.\n glBufferSubData(GL_ARRAY_BUFFER, bsize,\n sizeof(vertex_t) * m_vaoVertices.size(),\n &m_vaoVertices[0]);\n }\n \/\/ No existing buffer or vertices.\n else\n {\n \/\/ Allocate enough space for all vertices on GPU.\n glBufferData(GL_ARRAY_BUFFER,\n sizeof(vertex_t) * m_vaoVertices.size(),\n &m_vaoVertices[0], m_type);\n }\n\n \/\/ Repeat process for index buffer.\n bsize = 0;\n glGetBufferParameteriv(GL_ELEMENT_ARRAY_BUFFER, GL_BUFFER_SIZE, &bsize);\n\n if(bsize > 0)\n {\n \/\/ Copy from GPU to local buffer.\n const index_t* const data = this->GetIndicesFromGPU();\n index_t* tmp = new index_t[bsize \/ sizeof(index_t)];\n memcpy(tmp, data, bsize);\n glUnmapBuffer(GL_ELEMENT_ARRAY_BUFFER);\n\n \/\/ Allocate enough GPU space for all vertex data, new and old.\n \/\/ Pass the old data directly to it.\n glBufferData(GL_ELEMENT_ARRAY_BUFFER, \/\/ IBO\n bsize + (sizeof(index_t) * m_vaoIndices.size()), \/\/ Size\n tmp, \/\/ Initial data\n m_type); \/\/ Access type\n\n \/\/ Pass the latest vertex data at the end of the existing data.\n glBufferSubData(GL_ELEMENT_ARRAY_BUFFER, bsize,\n sizeof(index_t) * m_vaoIndices.size(),\n &m_vaoIndices[0]);\n }\n else\n {\n \/\/ No existing data, so we just write new stuff to the buffer.\n glBufferData(GL_ELEMENT_ARRAY_BUFFER,\n sizeof(index_t) * m_vaoIndices.size(),\n &m_vaoIndices[0], m_type);\n }\n\n \/\/ Vertices are arranged in memory like so:\n \/\/\n \/\/ [ x, y, z, t, s, r, r, g, b, a ]\n \/\/\n \/\/ (see the definition of vertex_t in Zenderer\/CoreGraphics\/OpenGL.hpp)\n \/\/\n \/\/ Specify vertex position arrangement.\n \/\/ According to the diagram shown above, the vertex position\n \/\/ would start at index 0.\n glVertexAttribPointer(0, \/* Attribute index *\/\n 3, \/* Number of values *\/\n GL_FLOAT, \/* Type of value *\/\n GL_FALSE, \/* Normalized? *\/\n sizeof(vertex_t), \/* Size of field *\/\n VBO_OFFSET(0, vertex_t, position)); \/* Size of offset *\/\n\n \/\/ Specify texture coordinate position arrangement.\n \/\/ According to the diagram, texture coordinates\n \/\/ start at index 3.\n glVertexAttribPointer(1, 3, GL_FLOAT, GL_FALSE, sizeof(vertex_t),\n VBO_OFFSET(0, vertex_t, tc));\n\n \/\/ Specify the color arrangement, starting at index 4.\n glVertexAttribPointer(2, 4, GL_FLOAT, GL_FALSE, sizeof(vertex_t),\n VBO_OFFSET(0, vertex_t, color));\n\n \/\/ We're done, clean up buffers.\n m_vcount += m_vaoVertices.size();\n m_icount += m_vaoIndices.size();\n\n m_vaoVertices.clear();\n m_vaoIndices.clear();\n\n return this->Unbind();\n}\n\nconst vertex_t* const CVertexArray::GetVerticesFromGPU() const\n{\n return (vertex_t*)glMapBuffer(GL_ARRAY_BUFFER, GL_READ_ONLY);\n}\n\nconst index_t* const CVertexArray::GetIndicesFromGPU() const\n{\n return (index_t*)glMapBuffer(GL_ELEMENT_ARRAY_BUFFER, GL_READ_ONLY);\n}\n\nsize_t CVertexArray::GetVertexCount() const\n{\n return m_vcount;\n}\n\nsize_t CVertexArray::GetIndexCount() const\n{\n return m_icount;\n}\n\nbool CVertexArray::Offloaded() const\n{\n return (m_vaoIndices.size() > 0 && m_vaoVertices.size() > 0);\n}\n<commit_msg>Critical VAO bugfix<commit_after>#include \"Zenderer\/CoreGraphics\/VertexArray.hpp\"\n\nusing namespace zen::gfxcore;\n\nCVertexArray::CVertexArray(const GLenum type) :\n CGLSubsystem(\"Vertex Array\"),\n m_icount(0), m_vcount(0),\n m_vao(0), m_vbo(0), m_ibo(0),\n m_type(type)\n{\n m_vaoIndices.clear();\n m_vaoVertices.clear();\n}\n\nCVertexArray::~CVertexArray()\n{\n this->Destroy();\n}\n\nbool CVertexArray::Init()\n{\n if(m_init) this->Destroy();\n\n \/\/ Bad GL version.\n if(!glGenVertexArrays) return false;\n\n GL(glGenVertexArrays(1, &m_vao));\n GL(glGenBuffers(1, &m_vbo));\n GL(glGenBuffers(1, &m_ibo));\n\n ZEN_ASSERT(m_vao != 0);\n ZEN_ASSERT(m_vbo != 0);\n ZEN_ASSERT(m_ibo != 0);\n\n return (m_init = true);\n}\n\nbool CVertexArray::Destroy()\n{\n if(!m_init) return true;\n\n ZEN_ASSERT(m_vao != 0);\n ZEN_ASSERT(m_vbo != 0);\n ZEN_ASSERT(m_ibo != 0);\n\n glDeleteVertexArrays(1, &m_vao);\n glDeleteBuffers(1, &m_vbo);\n glDeleteBuffers(1, &m_ibo);\n\n return true;\n}\n\nbool CVertexArray::Bind()\n{\n if(!m_init) return false;\n\n GL(glBindVertexArray(m_vao));\n GL(glEnableVertexAttribArray(0)); \/\/ Enable shader attribute 0\n GL(glEnableVertexAttribArray(1));\n GL(glEnableVertexAttribArray(2));\n return true;\n}\n\nbool CVertexArray::Unbind()\n{\n if(!this->Init()) return false;\n\n GL(glBindVertexArray(0));\n\n return true;\n}\n\nindex_t CVertexArray::AddData(const DrawBatch& D)\n{\n ZEN_ASSERTM(D.vcount > 0, \"no buffer vertices given\");\n ZEN_ASSERTM(D.icount > 0, \"no buffer indices given\");\n\n m_vaoVertices.resize(m_vaoVertices.size() + D.vcount);\n for(size_t v = 0; v < D.vcount; ++v)\n m_vaoVertices.push_back(D.Vertices[v]);\n\n size_t offset = m_vaoIndices.size();\n\n m_vaoIndices.resize(m_vaoIndices.size() + D.icount);\n for(size_t i = 0; i < D.icount; ++i)\n m_vaoIndices.push_back(D.Indices[i]);\n\n return offset + m_icount;\n}\n\nbool CVertexArray::Offload()\n{\n if(!this->Bind()) return false;\n if(this->Offloaded()) return false;\n\n \/\/ Check if there's existing data on the buffers.\n GLint bsize = 0;\n glGetBufferParameteriv(GL_ARRAY_BUFFER, GL_BUFFER_SIZE, &bsize);\n\n \/\/ There is!\n if(bsize > 0)\n {\n \/\/ Copy existing buffer data from GPU to local buffer.\n const vertex_t* const data = this->GetVerticesFromGPU();\n vertex_t* tmp = new vertex_t[bsize \/ sizeof(vertex_t)];\n memcpy(tmp, data, bsize);\n glUnmapBuffer(GL_ARRAY_BUFFER);\n\n \/\/ Allocate enough GPU space for all vertex data, new and old.\n \/\/ Pass the old data directly to it.\n glBufferData(GL_ARRAY_BUFFER,\n bsize + (sizeof(vertex_t) * m_vaoVertices.size()),\n tmp, m_type);\n\n \/\/ Pass the latest vertex data at the end of the existing data.\n glBufferSubData(GL_ARRAY_BUFFER, bsize,\n sizeof(vertex_t) * m_vaoVertices.size(),\n &m_vaoVertices[0]);\n }\n \/\/ No existing buffer or vertices.\n else\n {\n \/\/ Allocate enough space for all vertices on GPU.\n glBufferData(GL_ARRAY_BUFFER,\n sizeof(vertex_t) * m_vaoVertices.size(),\n &m_vaoVertices[0], m_type);\n }\n\n \/\/ Repeat process for index buffer.\n bsize = 0;\n glGetBufferParameteriv(GL_ELEMENT_ARRAY_BUFFER, GL_BUFFER_SIZE, &bsize);\n\n if(bsize > 0)\n {\n \/\/ Copy from GPU to local buffer.\n const index_t* const data = this->GetIndicesFromGPU();\n index_t* tmp = new index_t[bsize \/ sizeof(index_t)];\n memcpy(tmp, data, bsize);\n glUnmapBuffer(GL_ELEMENT_ARRAY_BUFFER);\n\n \/\/ Allocate enough GPU space for all vertex data, new and old.\n \/\/ Pass the old data directly to it.\n glBufferData(GL_ELEMENT_ARRAY_BUFFER, \/\/ IBO\n bsize + (sizeof(index_t) * m_vaoIndices.size()), \/\/ Size\n tmp, \/\/ Initial data\n m_type); \/\/ Access type\n\n \/\/ Pass the latest vertex data at the end of the existing data.\n glBufferSubData(GL_ELEMENT_ARRAY_BUFFER, bsize,\n sizeof(index_t) * m_vaoIndices.size(),\n &m_vaoIndices[0]);\n }\n else\n {\n \/\/ No existing data, so we just write new stuff to the buffer.\n glBufferData(GL_ELEMENT_ARRAY_BUFFER,\n sizeof(index_t) * m_vaoIndices.size(),\n &m_vaoIndices[0], m_type);\n }\n\n \/\/ Vertices are arranged in memory like so:\n \/\/\n \/\/ [ x, y, z, t, s, r, r, g, b, a ]\n \/\/\n \/\/ (see the definition of vertex_t in Zenderer\/CoreGraphics\/OpenGL.hpp)\n \/\/\n \/\/ Specify vertex position arrangement.\n \/\/ According to the diagram shown above, the vertex position\n \/\/ would start at index 0.\n glVertexAttribPointer(0, \/* Attribute index *\/\n 3, \/* Number of values *\/\n GL_FLOAT, \/* Type of value *\/\n GL_FALSE, \/* Normalized? *\/\n sizeof(vertex_t), \/* Size of field *\/\n VBO_OFFSET(0, vertex_t, position)); \/* Size of offset *\/\n\n \/\/ Specify texture coordinate position arrangement.\n \/\/ According to the diagram, texture coordinates\n \/\/ start at index 3.\n glVertexAttribPointer(1, 3, GL_FLOAT, GL_FALSE, sizeof(vertex_t),\n VBO_OFFSET(0, vertex_t, tc));\n\n \/\/ Specify the color arrangement, starting at index 4.\n glVertexAttribPointer(2, 4, GL_FLOAT, GL_FALSE, sizeof(vertex_t),\n VBO_OFFSET(0, vertex_t, color));\n\n \/\/ We're done, clean up buffers.\n m_vcount += m_vaoVertices.size();\n m_icount += m_vaoIndices.size();\n\n m_vaoVertices.clear();\n m_vaoIndices.clear();\n\n return this->Unbind();\n}\n\nconst vertex_t* const CVertexArray::GetVerticesFromGPU() const\n{\n return (vertex_t*)glMapBuffer(GL_ARRAY_BUFFER, GL_READ_ONLY);\n}\n\nconst index_t* const CVertexArray::GetIndicesFromGPU() const\n{\n return (index_t*)glMapBuffer(GL_ELEMENT_ARRAY_BUFFER, GL_READ_ONLY);\n}\n\nsize_t CVertexArray::GetVertexCount() const\n{\n return m_vcount;\n}\n\nsize_t CVertexArray::GetIndexCount() const\n{\n return m_icount;\n}\n\nbool CVertexArray::Offloaded() const\n{\n return (m_vaoIndices.size() == 0 && m_vaoVertices.size() == 0);\n}\n<|endoftext|>"} {"text":"<commit_before>\n\/\/ GridStructGen.cpp\n\n\/\/ Implements the cGridStructGen class representing a common base class for structure generators that place structures in a semi-random grid\n\n#include \"Globals.h\"\n#include \"GridStructGen.h\"\n\n\n\n\ncGridStructGen::cGridStructGen(\n\tint a_Seed,\n\tint a_GridSizeX, int a_GridSizeZ,\n\tint a_MaxStructureSizeX, int a_MaxStructureSizeZ,\n\tsize_t a_MaxCacheSize\n) :\n\tm_Seed(a_Seed),\n\tm_GridSizeX(a_GridSizeX),\n\tm_GridSizeZ(a_GridSizeZ),\n\tm_MaxStructureSizeX(a_MaxStructureSizeX),\n\tm_MaxStructureSizeZ(a_MaxStructureSizeZ),\n\tm_MaxCacheSize(a_MaxCacheSize)\n{\n}\n\n\n\n\n\nvoid cGridStructGen::GetStructuresForChunk(int a_ChunkX, int a_ChunkZ, cStructurePtrs & a_Structures)\n{\n\t\/\/ Calculate the min and max grid coords of the structures to be returned:\n\tint MinBlockX = a_ChunkX * cChunkDef::Width - m_MaxStructureSizeX;\n\tint MinBlockZ = a_ChunkZ * cChunkDef::Width - m_MaxStructureSizeZ;\n\tint MaxBlockX = a_ChunkX * cChunkDef::Width + m_MaxStructureSizeX + cChunkDef::Width - 1;\n\tint MaxBlockZ = a_ChunkZ * cChunkDef::Width + m_MaxStructureSizeZ + cChunkDef::Width - 1;\n\tint MinGridX = MinBlockX \/ m_GridSizeX;\n\tint MinGridZ = MinBlockZ \/ m_GridSizeZ;\n\tint MaxGridX = (MaxBlockX + m_GridSizeX - 1) \/ m_GridSizeX;\n\tint MaxGridZ = (MaxBlockZ + m_GridSizeZ - 1) \/ m_GridSizeZ;\n\tif (MinBlockX < 0)\n\t{\n\t\t--MinGridX;\n\t}\n\tif (MinBlockZ < 0)\n\t{\n\t\t--MinGridZ;\n\t}\n\tif (MaxBlockX < 0)\n\t{\n\t\t--MaxGridX;\n\t}\n\tif (MaxBlockZ < 0)\n\t{\n\t\t--MaxGridZ;\n\t}\n\n\t\/\/ Walk the cache, move each structure that we want into a_Structures:\n\tfor (cStructurePtrs::iterator itr = m_Cache.begin(), end = m_Cache.end(); itr != end;)\n\t{\n\t\tif (\n\t\t\t((*itr)->m_OriginX >= MinBlockX) && ((*itr)->m_OriginX < MaxBlockX) &&\n\t\t\t((*itr)->m_OriginZ >= MinBlockZ) && ((*itr)->m_OriginZ < MaxBlockZ)\n\t\t)\n\t\t{\n\t\t\t\/\/ want\n\t\t\ta_Structures.push_back(*itr);\n\t\t\titr = m_Cache.erase(itr);\n\t\t}\n\t\telse\n\t\t{\n\t\t\t\/\/ don't want\n\t\t\t++itr;\n\t\t}\n\t} \/\/ for itr - m_Cache[]\n\n\t\/\/ Create those structures that haven't been in the cache:\n\tfor (int x = MinGridX; x < MaxGridX; x++)\n\t{\n\t\tint OriginX = x * m_GridSizeX;\n\t\tfor (int z = MinGridZ; z < MaxGridZ; z++)\n\t\t{\n\t\t\tint OriginZ = z * m_GridSizeZ;\n\t\t\tbool Found = false;\n\t\t\tfor (cStructurePtrs::const_iterator itr = a_Structures.begin(), end = a_Structures.end(); itr != end; ++itr)\n\t\t\t{\n\t\t\t\tif (((*itr)->m_OriginX == OriginX) && ((*itr)->m_OriginZ == OriginZ))\n\t\t\t\t{\n\t\t\t\t\tFound = true;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t} \/\/ for itr - a_Structures[]\n\t\t\tif (!Found)\n\t\t\t{\n\t\t\t\ta_Structures.push_back(CreateStructure(OriginX, OriginZ));\n\t\t\t}\n\t\t} \/\/ for z\n\t} \/\/ for x\n\n\t\/\/ Copy a_Forts into m_Cache to the beginning:\n\tcStructurePtrs StructuresCopy (a_Structures);\n\tm_Cache.splice(m_Cache.begin(), StructuresCopy, StructuresCopy.begin(), StructuresCopy.end());\n\n\t\/\/ Trim the cache if it's too long:\n\tsize_t CacheSize = 0;\n\tfor (cStructurePtrs::iterator itr = m_Cache.begin(), end = m_Cache.end(); itr != end; ++itr)\n\t{\n\t\tCacheSize += (*itr)->GetCacheCost();\n\t\tif (CacheSize > m_MaxCacheSize)\n\t\t{\n\t\t\t\/\/ Erase all items from this one till the cache end\n\t\t\tm_Cache.erase(itr, m_Cache.end());\n\t\t\tbreak;\n\t\t}\n\t}\n}\n\n\n\n\n\nvoid cGridStructGen::GenFinish(cChunkDesc & a_ChunkDesc)\n{\n\tint ChunkX = a_ChunkDesc.GetChunkX();\n\tint ChunkZ = a_ChunkDesc.GetChunkZ();\n\tcStructurePtrs Structures;\n\tGetStructuresForChunk(ChunkX, ChunkZ, Structures);\n\tfor (cStructurePtrs::const_iterator itr = Structures.begin(); itr != Structures.end(); ++itr)\n\t{\n\t\t(*itr)->DrawIntoChunk(a_ChunkDesc);\n\t} \/\/ for itr - Structures[]\n}\n\n\n\n\n\n<commit_msg>Fixed cGridStructGen.<commit_after>\n\/\/ GridStructGen.cpp\n\n\/\/ Implements the cGridStructGen class representing a common base class for structure generators that place structures in a semi-random grid\n\n#include \"Globals.h\"\n#include \"GridStructGen.h\"\n\n\n\n\ncGridStructGen::cGridStructGen(\n\tint a_Seed,\n\tint a_GridSizeX, int a_GridSizeZ,\n\tint a_MaxStructureSizeX, int a_MaxStructureSizeZ,\n\tsize_t a_MaxCacheSize\n) :\n\tm_Seed(a_Seed),\n\tm_GridSizeX(a_GridSizeX),\n\tm_GridSizeZ(a_GridSizeZ),\n\tm_MaxStructureSizeX(a_MaxStructureSizeX),\n\tm_MaxStructureSizeZ(a_MaxStructureSizeZ),\n\tm_MaxCacheSize(a_MaxCacheSize)\n{\n}\n\n\n\n\n\nvoid cGridStructGen::GetStructuresForChunk(int a_ChunkX, int a_ChunkZ, cStructurePtrs & a_Structures)\n{\n\t\/\/ Calculate the min and max grid coords of the structures to be returned:\n\tint MinBlockX = a_ChunkX * cChunkDef::Width - m_MaxStructureSizeX;\n\tint MinBlockZ = a_ChunkZ * cChunkDef::Width - m_MaxStructureSizeZ;\n\tint MaxBlockX = a_ChunkX * cChunkDef::Width + m_MaxStructureSizeX + cChunkDef::Width - 1;\n\tint MaxBlockZ = a_ChunkZ * cChunkDef::Width + m_MaxStructureSizeZ + cChunkDef::Width - 1;\n\tint MinGridX = MinBlockX \/ m_GridSizeX;\n\tint MinGridZ = MinBlockZ \/ m_GridSizeZ;\n\tint MaxGridX = (MaxBlockX + m_GridSizeX - 1) \/ m_GridSizeX;\n\tint MaxGridZ = (MaxBlockZ + m_GridSizeZ - 1) \/ m_GridSizeZ;\n\tint MinX = MinGridX * m_GridSizeX;\n\tint MaxX = MaxGridX * m_GridSizeX;\n\tint MinZ = MinGridZ * m_GridSizeZ;\n\tint MaxZ = MaxGridZ * m_GridSizeZ;\n\n\t\/\/ Walk the cache, move each structure that we want into a_Structures:\n\tfor (cStructurePtrs::iterator itr = m_Cache.begin(), end = m_Cache.end(); itr != end;)\n\t{\n\t\tif (\n\t\t\t((*itr)->m_OriginX >= MinX) && ((*itr)->m_OriginX < MaxX) &&\n\t\t\t((*itr)->m_OriginZ >= MinZ) && ((*itr)->m_OriginZ < MaxZ)\n\t\t)\n\t\t{\n\t\t\t\/\/ want\n\t\t\ta_Structures.push_back(*itr);\n\t\t\titr = m_Cache.erase(itr);\n\t\t}\n\t\telse\n\t\t{\n\t\t\t\/\/ don't want\n\t\t\t++itr;\n\t\t}\n\t} \/\/ for itr - m_Cache[]\n\n\t\/\/ Create those structures that haven't been in the cache:\n\tfor (int x = MinGridX; x < MaxGridX; x++)\n\t{\n\t\tint OriginX = x * m_GridSizeX;\n\t\tfor (int z = MinGridZ; z < MaxGridZ; z++)\n\t\t{\n\t\t\tint OriginZ = z * m_GridSizeZ;\n\t\t\tbool Found = false;\n\t\t\tfor (cStructurePtrs::const_iterator itr = a_Structures.begin(), end = a_Structures.end(); itr != end; ++itr)\n\t\t\t{\n\t\t\t\tif (((*itr)->m_OriginX == OriginX) && ((*itr)->m_OriginZ == OriginZ))\n\t\t\t\t{\n\t\t\t\t\tFound = true;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t} \/\/ for itr - a_Structures[]\n\t\t\tif (!Found)\n\t\t\t{\n\t\t\t\ta_Structures.push_back(CreateStructure(OriginX, OriginZ));\n\t\t\t}\n\t\t} \/\/ for z\n\t} \/\/ for x\n\n\t\/\/ Copy a_Forts into m_Cache to the beginning:\n\tcStructurePtrs StructuresCopy (a_Structures);\n\tm_Cache.splice(m_Cache.begin(), StructuresCopy, StructuresCopy.begin(), StructuresCopy.end());\n\n\t\/\/ Trim the cache if it's too long:\n\tsize_t CacheSize = 0;\n\tfor (cStructurePtrs::iterator itr = m_Cache.begin(), end = m_Cache.end(); itr != end; ++itr)\n\t{\n\t\tCacheSize += (*itr)->GetCacheCost();\n\t\tif (CacheSize > m_MaxCacheSize)\n\t\t{\n\t\t\t\/\/ Erase all items from this one till the cache end\n\t\t\tm_Cache.erase(itr, m_Cache.end());\n\t\t\tbreak;\n\t\t}\n\t}\n}\n\n\n\n\n\nvoid cGridStructGen::GenFinish(cChunkDesc & a_ChunkDesc)\n{\n\tint ChunkX = a_ChunkDesc.GetChunkX();\n\tint ChunkZ = a_ChunkDesc.GetChunkZ();\n\tcStructurePtrs Structures;\n\tGetStructuresForChunk(ChunkX, ChunkZ, Structures);\n\tfor (cStructurePtrs::const_iterator itr = Structures.begin(); itr != Structures.end(); ++itr)\n\t{\n\t\t(*itr)->DrawIntoChunk(a_ChunkDesc);\n\t} \/\/ for itr - Structures[]\n}\n\n\n\n\n\n<|endoftext|>"} {"text":"<commit_before>#include \"MatrixOptimizationDataTx.hpp\"\n#include \"SparseMatrix.hpp\"\n#include \"KernelWrappers.h\"\n\n#ifndef HPCG_NOMPI\n#include \"ExchangeHalo.hpp\"\n#include \"mpi.h\"\n#endif\n\nMatrixOptimizationDataTx::MatrixOptimizationDataTx()\n : handle(0), matDescr(0), localMatrix(0), gsContext(0), f2c(0),\n workvector(0) {\n cusparseStatus_t err = cusparseCreate(&handle);\n CHKCUSPARSEERR(err);\n}\n\nMatrixOptimizationDataTx::~MatrixOptimizationDataTx() {\n if (handle) {\n cusparseDestroy(handle);\n handle = 0;\n }\n if (matDescr) {\n cusparseDestroyMatDescr(matDescr);\n matDescr = 0;\n }\n if (localMatrix) {\n cusparseDestroyHybMat(localMatrix);\n localMatrix = 0;\n }\n if (gsContext) {\n cugelusDestroySorIterationData(gsContext);\n gsContext = 0;\n }\n if (f2c) {\n CHKCUDAERR(cudaFree(f2c));\n }\n if (workvector) {\n CHKCUDAERR(cudaFree(workvector));\n }\n}\n\nint MatrixOptimizationDataTx::setupLocalMatrixOnGPU(SparseMatrix& A) {\n std::vector<local_int_t> i(A.localNumberOfRows + 1, 0);\n std::vector<local_int_t> j(A.localNumberOfNonzeros, 0);\n std::vector<double> a(A.localNumberOfNonzeros, 0);\n for (local_int_t m = 0; m < A.localNumberOfRows; ++m) {\n i[m + 1] = i[m] + A.nonzerosInRow[m];\n }\n local_int_t index = 0;\n for (local_int_t m = 0; m < A.localNumberOfRows; ++m) {\n for (local_int_t n = 0; n < A.nonzerosInRow[m]; ++n) {\n j[index] = A.mtxIndL[m][n];\n ++index;\n }\n }\n index = 0;\n for (local_int_t m = 0; m < A.localNumberOfRows; ++m) {\n for (local_int_t n = 0; n < A.nonzerosInRow[m]; ++n) {\n a[index] = A.matrixValues[m][n];\n ++index;\n }\n }\n\n cudaError_t err = cudaSuccess;\n int* i_d;\n err = cudaMalloc((void**)&i_d, i.size() * sizeof(i[0]));\n CHKCUDAERR(err);\n err = cudaMemcpy(i_d, &i[0], i.size() * sizeof(i[0]), cudaMemcpyHostToDevice);\n CHKCUDAERR(err);\n int* j_d;\n err = cudaMalloc((void**)&j_d, j.size() * sizeof(j[0]));\n CHKCUDAERR(err);\n err = cudaMemcpy(j_d, &j[0], j.size() * sizeof(j[0]), cudaMemcpyHostToDevice);\n CHKCUDAERR(err);\n double* a_d;\n err = cudaMalloc((void**)&a_d, a.size() * sizeof(a[0]));\n CHKCUDAERR(err);\n err = cudaMemcpy(a_d, &a[0], a.size() * sizeof(a[0]), cudaMemcpyHostToDevice);\n CHKCUDAERR(err);\n\n cusparseStatus_t cerr = CUSPARSE_STATUS_SUCCESS;\n cerr = cusparseCreateMatDescr(&matDescr);\n CHKCUSPARSEERR(cerr);\n cerr = cusparseSetMatIndexBase(matDescr, CUSPARSE_INDEX_BASE_ZERO);\n CHKCUSPARSEERR(cerr);\n cerr = cusparseSetMatType(matDescr, CUSPARSE_MATRIX_TYPE_GENERAL);\n CHKCUSPARSEERR(cerr);\n cerr = cusparseCreateHybMat(&localMatrix);\n CHKCUSPARSEERR(cerr);\n cerr = cusparseDcsr2hyb(handle, A.localNumberOfRows, A.localNumberOfColumns,\n matDescr, a_d, i_d, j_d, localMatrix, 27,\n CUSPARSE_HYB_PARTITION_USER);\n CHKCUSPARSEERR(cerr);\n\n \/\/ Set up the GS data.\n \/\/ Need to extract the local portion of the matrix for gelus.\n \/\/ The part for scattering from the halo into the local portion of the\n \/\/ vector goes into scatterFromHalo.\n j.resize(0);\n a.resize(0);\n scatterFromHalo.setNumRows(A.localNumberOfRows);\n scatterFromHalo.setNumCols(A.localNumberOfColumns);\n scatterFromHalo.clear();\n for (local_int_t m = 0; m < A.localNumberOfRows; ++m) {\n local_int_t nonzerosInRow = 0;\n for (local_int_t n = 0; n < A.nonzerosInRow[m]; ++n) {\n local_int_t col = A.mtxIndL[m][n];\n if (col < A.localNumberOfRows) {\n j.push_back(col);\n a.push_back(A.matrixValues[m][n]);\n ++nonzerosInRow;\n } else {\n scatterFromHalo.addEntry(m, col, A.matrixValues[m][n]);\n }\n }\n i[m + 1] = i[m] + nonzerosInRow;\n }\n\n gelusStatus_t gerr = GELUS_STATUS_SUCCESS;\n gelusSolveDescription_t solveDescr;\n gerr = gelusCreateSolveDescr(&solveDescr);\n CHKGELUSERR(gerr);\n gerr = gelusSetSolveOperation(solveDescr, GELUS_OPERATION_NON_TRANSPOSE);\n CHKGELUSERR(gerr);\n gerr = gelusSetSolveFillMode(solveDescr, GELUS_FILL_MODE_FULL);\n CHKGELUSERR(gerr);\n gerr = gelusSetSolveStorageFormat(solveDescr, GELUS_STORAGE_FORMAT_HYB);\n CHKGELUSERR(gerr);\n gerr = gelusSetOptimizationLevel(solveDescr, GELUS_OPTIMIZATION_LEVEL_THREE);\n CHKGELUSERR(gerr);\n\n gerr = cugelusCreateSorIterationData(&gsContext);\n CHKGELUSERR(gerr);\n\n#ifdef HPCG_DEBUG\n std::cout << A.localNumberOfRows << std::endl;\n std::cout << A.localNumberOfColumns << std::endl;\n std::cout << A.localNumberOfNonzeros << std::endl;\n int myrank;\n MPI_Comm_rank(MPI_COMM_WORLD, &myrank);\n if (myrank == 0) {\n dumpMatrix(std::cout, i, j, a);\n }\n#endif\n\n gerr = cugelusDcsrsor_iteration_analysis(\n A.localNumberOfRows, solveDescr, GELUS_SOR_SYMMETRIC, 1.0,\n &i[0], &j[0], &a[0], gsContext);\n gerr = gelusDestroySolveDescr(solveDescr);\n CHKGELUSERR(gerr);\n\n if (A.mgData) {\n err =\n cudaMalloc((void**)&f2c, A.mgData->rc->localLength * sizeof(local_int_t));\n CHKCUDAERR(err);\n err = cudaMemcpy(f2c, A.mgData->f2cOperator,\n A.mgData->rc->localLength * sizeof(local_int_t),\n cudaMemcpyHostToDevice);\n CHKCUDAERR(err);\n }\n\n err = cudaMalloc((void**)&workvector, A.localNumberOfRows * sizeof(double));\n CHKCUDAERR(err);\n\n return (int)cerr | (int)gerr | (int)err;\n}\n\nint MatrixOptimizationDataTx::ComputeSPMV(const SparseMatrix& A, Vector& x,\n Vector& y, bool copyIn,\n bool copyOut) {\n double* x_dev = 0;\n double* y_dev = 0;\n#ifndef HPCG_NOMPI\n DataTransfer transfer = BeginExchangeHalo(A, x);\n EndExchangeHalo(A, x, transfer);\n x_dev = transferDataToGPU(x);\n#endif\n if (copyIn) {\n#ifdef HPCG_NOMPI\n x_dev = transferDataToGPU(x);\n#endif\n y_dev = transferDataToGPU(y);\n } else {\n x_dev = ((VectorOptimizationDataTx*)x.optimizationData)->devicePtr;\n y_dev = ((VectorOptimizationDataTx*)y.optimizationData)->devicePtr;\n }\n double alpha = 1.0;\n double beta = 0.0;\n cusparseStatus_t cerr;\n cerr = cusparseDhybmv(handle, CUSPARSE_OPERATION_NON_TRANSPOSE, &alpha,\n matDescr, localMatrix, x_dev, &beta, y_dev);\n CHKCUSPARSEERR(cerr);\n if (copyOut) {\n transferDataFromGPU(y);\n }\n return 0;\n}\n\nint MatrixOptimizationDataTx::ComputeSYMGS(const SparseMatrix &A,\n const Vector &r, Vector &x,\n int numberOfSmootherSteps,\n bool copyIn, bool copyOut) {\n const double* r_dev = 0; \n double* x_dev = 0;\n#ifndef HPCG_NOMPI\n DataTransfer transfer = BeginExchangeHalo(A, x);\n EndExchangeHalo(A, x, transfer);\n x_dev = transferDataToGPU(x);\n#endif\n if (copyIn) {\n#ifdef HPCG_NOMPI\n x_dev = transferDataToGPU(x);\n#endif\n r_dev = transferDataToGPU(r);\n } else {\n x_dev = ((VectorOptimizationDataTx*)x.optimizationData)->devicePtr;\n r_dev = ((VectorOptimizationDataTx*)r.optimizationData)->devicePtr;\n }\n launchDeviceCopy(workvector, r_dev, r.localLength);\n scatterFromHalo.spmv(x_dev, workvector, -1, 1);\n gelusStatus_t err =\n cugelusDcsrsor_iterate(x_dev, workvector, GELUS_SOR_INITIAL_GUESS_NONZERO,\n numberOfSmootherSteps, gsContext);\n CHKGELUSERR(err);\n if (copyOut) {\n transferDataFromGPU(x);\n transferDataFromGPU(r);\n }\n return 0;\n}\n\nint MatrixOptimizationDataTx::ComputeProlongation(const SparseMatrix& Af,\n Vector& xf, bool copyIn, bool copyOut) {\n double* xf_d = 0;\n double* xc_d = 0;\n if (copyIn) {\n xf_d = transferDataToGPU(xf);\n xc_d = transferDataToGPU(*Af.mgData->xc);\n } else {\n xf_d = ((VectorOptimizationDataTx*)xf.optimizationData)->devicePtr;\n xc_d = ((VectorOptimizationDataTx*)Af.mgData->xc->optimizationData)->devicePtr;\n }\n\n local_int_t nc = Af.mgData->rc->localLength;\n launchProlongationKernel(xf_d, xc_d, nc, f2c); \n\n if (copyOut) {\n transferDataFromGPU(xf);\n transferDataFromGPU(*Af.mgData->xc);\n }\n return 0;\n}\n\nint MatrixOptimizationDataTx::ComputeRestriction(const SparseMatrix& Af,\n const Vector& rf, bool copyIn,\n bool copyOut) {\n double* Axf_d = 0;\n double* rf_d = 0;\n double* rc_d = 0;\n if (copyIn) {\n Axf_d = transferDataToGPU(*Af.mgData->Axf);\n rf_d = transferDataToGPU(rf);\n rc_d = transferDataToGPU(*Af.mgData->rc);\n } else {\n Axf_d = ((VectorOptimizationDataTx*)Af.mgData->Axf->optimizationData)->devicePtr;\n rf_d = ((VectorOptimizationDataTx*)rf.optimizationData)->devicePtr;\n rc_d = ((VectorOptimizationDataTx*)Af.mgData->rc->optimizationData)->devicePtr;\n }\n\n local_int_t nc = Af.mgData->rc->localLength;\n launchRestrictionKernel(rc_d, rf_d, Axf_d, nc, f2c); \n\n if (copyOut) {\n transferDataFromGPU(*Af.mgData->Axf);\n transferDataFromGPU(rf);\n transferDataFromGPU(*Af.mgData->rc);\n }\n return 0;\n}\n\nvoid dumpMatrix(std::ostream& s, const std::vector<int>& i,\n const std::vector<int>& j, const std::vector<double>& a)\n{\n s << \"%%MatrixMarket matrix coordinate real general\\n\";\n int numRows = i.size() - 1;\n int nnz = j.size();\n s << numRows << \" \" << numRows << \" \" << nnz << \"\\n\";\n for (int m = 0; m < numRows; ++m) {\n for (int n = i[m]; n < i[m + 1]; ++n) {\n s << m + 1 << \" \" << j[n] + 1 << \" \" << a[n] << \"\\n\";\n }\n }\n}\n<commit_msg>Break matrix up into diagonal and off-diagonal block.<commit_after>#include \"MatrixOptimizationDataTx.hpp\"\n#include \"SparseMatrix.hpp\"\n#include \"KernelWrappers.h\"\n\n#ifndef HPCG_NOMPI\n#include \"ExchangeHalo.hpp\"\n#include \"mpi.h\"\n#endif\n\nMatrixOptimizationDataTx::MatrixOptimizationDataTx()\n : handle(0), matDescr(0), localMatrix(0), gsContext(0), f2c(0),\n workvector(0) {\n cusparseStatus_t err = cusparseCreate(&handle);\n CHKCUSPARSEERR(err);\n}\n\nMatrixOptimizationDataTx::~MatrixOptimizationDataTx() {\n if (handle) {\n cusparseDestroy(handle);\n handle = 0;\n }\n if (matDescr) {\n cusparseDestroyMatDescr(matDescr);\n matDescr = 0;\n }\n if (localMatrix) {\n cusparseDestroyHybMat(localMatrix);\n localMatrix = 0;\n }\n if (gsContext) {\n cugelusDestroySorIterationData(gsContext);\n gsContext = 0;\n }\n if (f2c) {\n CHKCUDAERR(cudaFree(f2c));\n }\n if (workvector) {\n CHKCUDAERR(cudaFree(workvector));\n }\n}\n\nint MatrixOptimizationDataTx::setupLocalMatrixOnGPU(SparseMatrix& A) {\n std::vector<local_int_t> i(A.localNumberOfRows + 1, 0);\n std::vector<local_int_t> j(A.localNumberOfNonzeros, 0);\n std::vector<double> a(A.localNumberOfNonzeros, 0);\n scatterFromHalo.setNumRows(A.localNumberOfRows);\n scatterFromHalo.setNumCols(A.localNumberOfColumns);\n scatterFromHalo.clear();\n \/\/ We're splitting the matrix into diagonal and off-diagonal block to\n \/\/ enable overlapping of computation and communication.\n for (local_int_t m = 0; m < A.localNumberOfRows; ++m) {\n local_int_t nonzerosInRow = 0;\n for (local_int_t n = 0; n < A.nonzerosInRow[m]; ++n) {\n local_int_t col = A.mtxIndL[m][n];\n if (col < A.localNumberOfRows) {\n j.push_back(col);\n a.push_back(A.matrixValues[m][n]);\n ++nonzerosInRow;\n } else {\n scatterFromHalo.addEntry(m, col, A.matrixValues[m][n]);\n }\n }\n i[m + 1] = i[m] + nonzerosInRow;\n }\n\n \/\/ Setup SpMV data on GPU\n cudaError_t err = cudaSuccess;\n int* i_d;\n err = cudaMalloc((void**)&i_d, i.size() * sizeof(i[0]));\n CHKCUDAERR(err);\n err = cudaMemcpy(i_d, &i[0], i.size() * sizeof(i[0]), cudaMemcpyHostToDevice);\n CHKCUDAERR(err);\n int* j_d;\n err = cudaMalloc((void**)&j_d, j.size() * sizeof(j[0]));\n CHKCUDAERR(err);\n err = cudaMemcpy(j_d, &j[0], j.size() * sizeof(j[0]), cudaMemcpyHostToDevice);\n CHKCUDAERR(err);\n double* a_d;\n err = cudaMalloc((void**)&a_d, a.size() * sizeof(a[0]));\n CHKCUDAERR(err);\n err = cudaMemcpy(a_d, &a[0], a.size() * sizeof(a[0]), cudaMemcpyHostToDevice);\n CHKCUDAERR(err);\n cusparseStatus_t cerr = CUSPARSE_STATUS_SUCCESS;\n cerr = cusparseCreateMatDescr(&matDescr);\n CHKCUSPARSEERR(cerr);\n cerr = cusparseSetMatIndexBase(matDescr, CUSPARSE_INDEX_BASE_ZERO);\n CHKCUSPARSEERR(cerr);\n cerr = cusparseSetMatType(matDescr, CUSPARSE_MATRIX_TYPE_GENERAL);\n CHKCUSPARSEERR(cerr);\n cerr = cusparseCreateHybMat(&localMatrix);\n CHKCUSPARSEERR(cerr);\n cerr = cusparseDcsr2hyb(handle, A.localNumberOfRows, A.localNumberOfColumns,\n matDescr, a_d, i_d, j_d, localMatrix, 27,\n CUSPARSE_HYB_PARTITION_USER);\n CHKCUSPARSEERR(cerr);\n\n \/\/ Set up the GS data.\n gelusStatus_t gerr = GELUS_STATUS_SUCCESS;\n gelusSolveDescription_t solveDescr;\n gerr = gelusCreateSolveDescr(&solveDescr);\n CHKGELUSERR(gerr);\n gerr = gelusSetSolveOperation(solveDescr, GELUS_OPERATION_NON_TRANSPOSE);\n CHKGELUSERR(gerr);\n gerr = gelusSetSolveFillMode(solveDescr, GELUS_FILL_MODE_FULL);\n CHKGELUSERR(gerr);\n gerr = gelusSetSolveStorageFormat(solveDescr, GELUS_STORAGE_FORMAT_HYB);\n CHKGELUSERR(gerr);\n gerr = gelusSetOptimizationLevel(solveDescr, GELUS_OPTIMIZATION_LEVEL_THREE);\n CHKGELUSERR(gerr);\n\n gerr = cugelusCreateSorIterationData(&gsContext);\n CHKGELUSERR(gerr);\n\n#ifdef HPCG_DEBUG\n std::cout << A.localNumberOfRows << std::endl;\n std::cout << A.localNumberOfColumns << std::endl;\n std::cout << A.localNumberOfNonzeros << std::endl;\n int myrank;\n MPI_Comm_rank(MPI_COMM_WORLD, &myrank);\n if (myrank == 0) {\n dumpMatrix(std::cout, i, j, a);\n }\n#endif\n\n gerr = cugelusDcsrsor_iteration_analysis(\n A.localNumberOfRows, solveDescr, GELUS_SOR_SYMMETRIC, 1.0,\n &i[0], &j[0], &a[0], gsContext);\n gerr = gelusDestroySolveDescr(solveDescr);\n CHKGELUSERR(gerr);\n\n if (A.mgData) {\n err =\n cudaMalloc((void**)&f2c, A.mgData->rc->localLength * sizeof(local_int_t));\n CHKCUDAERR(err);\n err = cudaMemcpy(f2c, A.mgData->f2cOperator,\n A.mgData->rc->localLength * sizeof(local_int_t),\n cudaMemcpyHostToDevice);\n CHKCUDAERR(err);\n }\n\n err = cudaMalloc((void**)&workvector, A.localNumberOfRows * sizeof(double));\n CHKCUDAERR(err);\n\n return (int)cerr | (int)gerr | (int)err;\n}\n\nint MatrixOptimizationDataTx::ComputeSPMV(const SparseMatrix& A, Vector& x,\n Vector& y, bool copyIn,\n bool copyOut) {\n double* x_dev = 0;\n double* y_dev = 0;\n#ifndef HPCG_NOMPI\n DataTransfer transfer = BeginExchangeHalo(A, x);\n EndExchangeHalo(A, x, transfer);\n x_dev = transferDataToGPU(x);\n#endif\n if (copyIn) {\n#ifdef HPCG_NOMPI\n x_dev = transferDataToGPU(x);\n#endif\n y_dev = transferDataToGPU(y);\n } else {\n x_dev = ((VectorOptimizationDataTx*)x.optimizationData)->devicePtr;\n y_dev = ((VectorOptimizationDataTx*)y.optimizationData)->devicePtr;\n }\n double alpha = 1.0;\n double beta = 0.0;\n cusparseStatus_t cerr;\n cerr = cusparseDhybmv(handle, CUSPARSE_OPERATION_NON_TRANSPOSE, &alpha,\n matDescr, localMatrix, x_dev, &beta, y_dev);\n CHKCUSPARSEERR(cerr);\n if (copyOut) {\n transferDataFromGPU(y);\n }\n return 0;\n}\n\nint MatrixOptimizationDataTx::ComputeSYMGS(const SparseMatrix &A,\n const Vector &r, Vector &x,\n int numberOfSmootherSteps,\n bool copyIn, bool copyOut) {\n const double* r_dev = 0; \n double* x_dev = 0;\n#ifndef HPCG_NOMPI\n DataTransfer transfer = BeginExchangeHalo(A, x);\n EndExchangeHalo(A, x, transfer);\n x_dev = transferDataToGPU(x);\n#endif\n if (copyIn) {\n#ifdef HPCG_NOMPI\n x_dev = transferDataToGPU(x);\n#endif\n r_dev = transferDataToGPU(r);\n } else {\n x_dev = ((VectorOptimizationDataTx*)x.optimizationData)->devicePtr;\n r_dev = ((VectorOptimizationDataTx*)r.optimizationData)->devicePtr;\n }\n launchDeviceCopy(workvector, r_dev, r.localLength);\n scatterFromHalo.spmv(x_dev, workvector, -1, 1);\n gelusStatus_t err =\n cugelusDcsrsor_iterate(x_dev, workvector, GELUS_SOR_INITIAL_GUESS_NONZERO,\n numberOfSmootherSteps, gsContext);\n CHKGELUSERR(err);\n if (copyOut) {\n transferDataFromGPU(x);\n transferDataFromGPU(r);\n }\n return 0;\n}\n\nint MatrixOptimizationDataTx::ComputeProlongation(const SparseMatrix& Af,\n Vector& xf, bool copyIn, bool copyOut) {\n double* xf_d = 0;\n double* xc_d = 0;\n if (copyIn) {\n xf_d = transferDataToGPU(xf);\n xc_d = transferDataToGPU(*Af.mgData->xc);\n } else {\n xf_d = ((VectorOptimizationDataTx*)xf.optimizationData)->devicePtr;\n xc_d = ((VectorOptimizationDataTx*)Af.mgData->xc->optimizationData)->devicePtr;\n }\n\n local_int_t nc = Af.mgData->rc->localLength;\n launchProlongationKernel(xf_d, xc_d, nc, f2c); \n\n if (copyOut) {\n transferDataFromGPU(xf);\n transferDataFromGPU(*Af.mgData->xc);\n }\n return 0;\n}\n\nint MatrixOptimizationDataTx::ComputeRestriction(const SparseMatrix& Af,\n const Vector& rf, bool copyIn,\n bool copyOut) {\n double* Axf_d = 0;\n double* rf_d = 0;\n double* rc_d = 0;\n if (copyIn) {\n Axf_d = transferDataToGPU(*Af.mgData->Axf);\n rf_d = transferDataToGPU(rf);\n rc_d = transferDataToGPU(*Af.mgData->rc);\n } else {\n Axf_d = ((VectorOptimizationDataTx*)Af.mgData->Axf->optimizationData)->devicePtr;\n rf_d = ((VectorOptimizationDataTx*)rf.optimizationData)->devicePtr;\n rc_d = ((VectorOptimizationDataTx*)Af.mgData->rc->optimizationData)->devicePtr;\n }\n\n local_int_t nc = Af.mgData->rc->localLength;\n launchRestrictionKernel(rc_d, rf_d, Axf_d, nc, f2c); \n\n if (copyOut) {\n transferDataFromGPU(*Af.mgData->Axf);\n transferDataFromGPU(rf);\n transferDataFromGPU(*Af.mgData->rc);\n }\n return 0;\n}\n\nvoid dumpMatrix(std::ostream& s, const std::vector<int>& i,\n const std::vector<int>& j, const std::vector<double>& a)\n{\n s << \"%%MatrixMarket matrix coordinate real general\\n\";\n int numRows = i.size() - 1;\n int nnz = j.size();\n s << numRows << \" \" << numRows << \" \" << nnz << \"\\n\";\n for (int m = 0; m < numRows; ++m) {\n for (int n = i[m]; n < i[m + 1]; ++n) {\n s << m + 1 << \" \" << j[n] + 1 << \" \" << a[n] << \"\\n\";\n }\n }\n}\n<|endoftext|>"} {"text":"<commit_before>\/\/ Copyright (C) 2014 Jérôme Leclercq\n\/\/ This file is part of the \"Nazara Engine - Graphics module\"\n\/\/ For conditions of distribution and use, see copyright notice in Config.hpp\n\n#include <Nazara\/Graphics\/Graphics.hpp>\n#include <Nazara\/Core\/CallOnExit.hpp>\n#include <Nazara\/Core\/Error.hpp>\n#include <Nazara\/Core\/Log.hpp>\n#include <Nazara\/Graphics\/Config.hpp>\n#include <Nazara\/Graphics\/DeferredRenderTechnique.hpp>\n#include <Nazara\/Graphics\/ForwardRenderTechnique.hpp>\n#include <Nazara\/Graphics\/GuillotineTextureAtlas.hpp>\n#include <Nazara\/Graphics\/Material.hpp>\n#include <Nazara\/Graphics\/RenderTechniques.hpp>\n#include <Nazara\/Graphics\/SkinningManager.hpp>\n#include <Nazara\/Graphics\/Loaders\/Mesh.hpp>\n#include <Nazara\/Graphics\/Loaders\/OBJ.hpp>\n#include <Nazara\/Graphics\/Loaders\/Texture.hpp>\n#include <Nazara\/Renderer\/Renderer.hpp>\n#include <Nazara\/Graphics\/Debug.hpp>\n\nbool NzGraphics::Initialize()\n{\n\tif (s_moduleReferenceCounter > 0)\n\t{\n\t\ts_moduleReferenceCounter++;\n\t\treturn true; \/\/ Déjà initialisé\n\t}\n\n\t\/\/ Initialisation des dépendances\n\tif (!NzRenderer::Initialize())\n\t{\n\t\tNazaraError(\"Failed to initialize Renderer module\");\n\t\treturn false;\n\t}\n\n\ts_moduleReferenceCounter++;\n\n\t\/\/ Initialisation du module\n\tNzCallOnExit onExit(NzGraphics::Uninitialize);\n\n\tif (!NzMaterial::Initialize())\n\t{\n\t\tNazaraError(\"Failed to initialize materials\");\n\t\treturn false;\n\t}\n\n\tif (!NzSkinningManager::Initialize())\n\t{\n\t\tNazaraError(\"Failed to initialize skinning manager\");\n\t\treturn false;\n\t}\n\n\t\/\/ Loaders\n\tNzLoaders_OBJ_Register();\n\n\t\/\/ Loaders génériques\n\tNzLoaders_Mesh_Register();\n\tNzLoaders_Texture_Register();\n\n\t\/\/ RenderTechniques\n\tNzRenderTechniques::Register(NzRenderTechniques::ToString(nzRenderTechniqueType_BasicForward), 0, []() -> NzAbstractRenderTechnique* { return new NzForwardRenderTechnique; });\n\n\tif (NzDeferredRenderTechnique::IsSupported())\n\t{\n\t\tNzDeferredRenderTechnique::Initialize();\n\t\tNzRenderTechniques::Register(NzRenderTechniques::ToString(nzRenderTechniqueType_DeferredShading), 20, []() -> NzAbstractRenderTechnique* { return new NzDeferredRenderTechnique; });\n\t}\n\n\tNzFont::SetDefaultAtlas(new NzGuillotineTextureAtlas);\n\n\tonExit.Reset();\n\n\tNazaraNotice(\"Initialized: Graphics module\");\n\treturn true;\n}\n\nbool NzGraphics::IsInitialized()\n{\n\treturn s_moduleReferenceCounter != 0;\n}\n\nvoid NzGraphics::Uninitialize()\n{\n\tif (s_moduleReferenceCounter != 1)\n\t{\n\t\t\/\/ Le module est soit encore utilisé, soit pas initialisé\n\t\tif (s_moduleReferenceCounter > 1)\n\t\t\ts_moduleReferenceCounter--;\n\n\t\treturn;\n\t}\n\n\t\/\/ Libération du module\n\ts_moduleReferenceCounter = 0;\n\n\t\/\/ Loaders\n\tNzLoaders_Mesh_Unregister();\n\tNzLoaders_OBJ_Unregister();\n\tNzLoaders_Texture_Unregister();\n\n\tNzDeferredRenderTechnique::Uninitialize();\n\tNzMaterial::Uninitialize();\n\tNzSkinningManager::Uninitialize();\n\n\tNazaraNotice(\"Uninitialized: Graphics module\");\n\n\t\/\/ Libération des dépendances\n\tNzRenderer::Uninitialize();\n}\n\nunsigned int NzGraphics::s_moduleReferenceCounter = 0;\n<commit_msg>Fixed missing include<commit_after>\/\/ Copyright (C) 2014 Jérôme Leclercq\n\/\/ This file is part of the \"Nazara Engine - Graphics module\"\n\/\/ For conditions of distribution and use, see copyright notice in Config.hpp\n\n#include <Nazara\/Graphics\/Graphics.hpp>\n#include <Nazara\/Core\/CallOnExit.hpp>\n#include <Nazara\/Core\/Error.hpp>\n#include <Nazara\/Core\/Log.hpp>\n#include <Nazara\/Graphics\/Config.hpp>\n#include <Nazara\/Graphics\/DeferredRenderTechnique.hpp>\n#include <Nazara\/Graphics\/ForwardRenderTechnique.hpp>\n#include <Nazara\/Graphics\/GuillotineTextureAtlas.hpp>\n#include <Nazara\/Graphics\/Material.hpp>\n#include <Nazara\/Graphics\/RenderTechniques.hpp>\n#include <Nazara\/Graphics\/SkinningManager.hpp>\n#include <Nazara\/Graphics\/Loaders\/Mesh.hpp>\n#include <Nazara\/Graphics\/Loaders\/OBJ.hpp>\n#include <Nazara\/Graphics\/Loaders\/Texture.hpp>\n#include <Nazara\/Renderer\/Renderer.hpp>\n#include <Nazara\/Utility\/Font.hpp>\n#include <Nazara\/Graphics\/Debug.hpp>\n\nbool NzGraphics::Initialize()\n{\n\tif (s_moduleReferenceCounter > 0)\n\t{\n\t\ts_moduleReferenceCounter++;\n\t\treturn true; \/\/ Déjà initialisé\n\t}\n\n\t\/\/ Initialisation des dépendances\n\tif (!NzRenderer::Initialize())\n\t{\n\t\tNazaraError(\"Failed to initialize Renderer module\");\n\t\treturn false;\n\t}\n\n\ts_moduleReferenceCounter++;\n\n\t\/\/ Initialisation du module\n\tNzCallOnExit onExit(NzGraphics::Uninitialize);\n\n\tif (!NzMaterial::Initialize())\n\t{\n\t\tNazaraError(\"Failed to initialize materials\");\n\t\treturn false;\n\t}\n\n\tif (!NzSkinningManager::Initialize())\n\t{\n\t\tNazaraError(\"Failed to initialize skinning manager\");\n\t\treturn false;\n\t}\n\n\t\/\/ Loaders\n\tNzLoaders_OBJ_Register();\n\n\t\/\/ Loaders génériques\n\tNzLoaders_Mesh_Register();\n\tNzLoaders_Texture_Register();\n\n\t\/\/ RenderTechniques\n\tNzRenderTechniques::Register(NzRenderTechniques::ToString(nzRenderTechniqueType_BasicForward), 0, []() -> NzAbstractRenderTechnique* { return new NzForwardRenderTechnique; });\n\n\tif (NzDeferredRenderTechnique::IsSupported())\n\t{\n\t\tNzDeferredRenderTechnique::Initialize();\n\t\tNzRenderTechniques::Register(NzRenderTechniques::ToString(nzRenderTechniqueType_DeferredShading), 20, []() -> NzAbstractRenderTechnique* { return new NzDeferredRenderTechnique; });\n\t}\n\n\tNzFont::SetDefaultAtlas(new NzGuillotineTextureAtlas);\n\n\tonExit.Reset();\n\n\tNazaraNotice(\"Initialized: Graphics module\");\n\treturn true;\n}\n\nbool NzGraphics::IsInitialized()\n{\n\treturn s_moduleReferenceCounter != 0;\n}\n\nvoid NzGraphics::Uninitialize()\n{\n\tif (s_moduleReferenceCounter != 1)\n\t{\n\t\t\/\/ Le module est soit encore utilisé, soit pas initialisé\n\t\tif (s_moduleReferenceCounter > 1)\n\t\t\ts_moduleReferenceCounter--;\n\n\t\treturn;\n\t}\n\n\t\/\/ Libération du module\n\ts_moduleReferenceCounter = 0;\n\n\t\/\/ Loaders\n\tNzLoaders_Mesh_Unregister();\n\tNzLoaders_OBJ_Unregister();\n\tNzLoaders_Texture_Unregister();\n\n\tNzDeferredRenderTechnique::Uninitialize();\n\tNzMaterial::Uninitialize();\n\tNzSkinningManager::Uninitialize();\n\n\tNazaraNotice(\"Uninitialized: Graphics module\");\n\n\t\/\/ Libération des dépendances\n\tNzRenderer::Uninitialize();\n}\n\nunsigned int NzGraphics::s_moduleReferenceCounter = 0;\n<|endoftext|>"} {"text":"<commit_before>\/*\n * Resource loader, functions for loading all supported data types\n * - Loads JSON scene information from jsoncpp (https:\/\/github.com\/open-source-parsers\/jsoncpp)\n * - Loads TGA textures via FreeImage\n * - Loads 3Ds models via Assimp\n *\/\n\n#include \"resourceloader.hpp\"\n\n#include <glm\/glm.hpp>\n#include <assimp\/Importer.hpp>\n#include <assimp\/scene.h>\n#include <assimp\/postprocess.h>\n#include <FreeImage.h>\n\n#include <memory>\n#include <vector>\n#include <fstream>\n#include <iostream>\n\n#include <Utilities\/exceptions.hpp>\n#include <Utilities\/log.hpp>\n#include <GL\/gl3w.h>\n#include <Resources\/model3d.hpp>\n#include <Models\/line.hpp>\n#include <Models\/staticmodel.hpp>\n\nusing json = nlohmann::json;\n\nstd::shared_ptr<IRenderObject> ResourceLoader::LoadModelJSON(json object) {\n std::string type = \"\";\n std::string name = \"\";\n\n if(object.find(\"datatype\") != object.end()) {\n type = object[\"datatype\"];\n } else {\n type = \"normal\";\n }\n\n if(object.find(\"name\") != object.end()) {\n name = object[\"name\"];\n } else {\n name = \"null\";\n }\n\n Model3D* model3D;\n\n if(type == \"normal\") {\n model3D = ResourceLoader::LoadModel3D(object[\"filename\"]);\n } else if(type == \"raw\") {\n std::vector<glm::vec3> verts;\n std::vector<std::vector<float>> vertsf = object[\"vertices\"];\n for(std::vector<float> vert : vertsf) {\n if(vert.size() != 3) {\n throw bad_resource(\"Vertex data size is not 3\", name);\n }\n verts.push_back(glm::vec3(vert[0], vert[1], vert[2]));\n }\n\n std::vector<GLuint> indices;\n std::vector<uint> indicesf = object[\"indices\"];\n for(uint index : indicesf) {\n if(index >= verts.size()) {\n throw bad_resource(\"Index is out of range\", name);\n }\n indices.push_back(index);\n }\n\n std::vector<glm::vec3> norms;\n if(object.find(\"noramls\") != object.end()) {\n std::vector<std::vector<float>> normsf = object[\"normals\"];\n for(std::vector<float> norm : normsf) {\n if(norm.size() != 3) {\n throw bad_resource(\"Normal data size is not 3\", name);\n }\n norms.push_back(glm::vec3(norm[0], norm[1], norm[2]));\n }\n } else {\n norms.clear();\n for(uint i = 0; i < verts.size(); i++) {\n norms.push_back(glm::vec3(0.0f));\n }\n }\n\n std::vector<glm::vec2> uvs;\n if(object.find(\"uvs\") != object.end()) {\n std::vector<std::vector<float>> uvsf = object[\"uvs\"];\n for(std::vector<float> uv : uvsf) {\n if(uv.size() != 2) {\n throw bad_resource(\"UV data size is not 2\", name);\n }\n uvs.push_back(glm::vec2(uv[0], uv[1]));\n }\n } else {\n uvs.clear();\n for(uint i = 0; i < verts.size(); i++) {\n uvs.push_back(glm::vec2(0.0f));\n }\n }\n\n std::vector<Model3D::Vertex> vertices;\n for(uint i = 0; i < verts.size(); i++) {\n vertices.push_back(Model3D::Vertex(verts[i], norms[i], uvs[i]));\n }\n\n std::vector<std::shared_ptr<Model3D::Mesh>> meshes;\n meshes.push_back(std::make_shared<Model3D::Mesh>(vertices, indices));\n meshes[0]->SetMatName(\"texture\");\n\n std::unordered_map<std::string, std::shared_ptr<Texture>> textures;\n textures[\"texture\"] = ResourceLoader::LoadTexture(object[\"matname\"], true);\n\n model3D = new Model3D(meshes, textures);\n } else {\n throw bad_resource(\"Unknown data type\", name);\n }\n\n \/*if(object.find(\"scale\") != object.end()) {\n std::vector<float> scale = object[\"scale\"];\n if(scale.size() != 3) {\n throw bad_resource(\"Scale data size is not 3\", name);\n }\n rObject->Scale(glm::vec3(scale[0], scale[1], scale[2]));\n }\n\n if(object.find(\"translation\") != object.end()) {\n std::vector<float> translation = object[\"translation\"];\n if(translation.size() != 3) {\n throw bad_resource(\"Translation data size is not 3\", name);\n }\n rObject->Translate(glm::vec3(translation[0], translation[1], translation[2]));\n }\n\n if(object.find(\"rotation\") != object.end()) {\n std::vector<float> rotation = object[\"rotation\"];\n if(rotation.size() != 3) {\n throw bad_resource(\"Rotation data size is not 3\", name);\n }\n }*\/\n\n return std::make_shared<StaticModel>(model3D);\n}\n\nstd::shared_ptr<IRenderObject> ResourceLoader::LoadLineJSON(json object) {\n glm::vec3 head, tail, color;\n std::string name;\n\n if(object.find(\"name\") != object.end()) {\n name = object[\"name\"];\n } else {\n name = \"null\";\n }\n\n std::vector<float> head3f = object[\"head\"];\n if(head3f.size() == 3) {\n head = glm::vec3(head3f[0], head3f[1], head3f[2]);\n } else {\n throw bad_resource(\"head data size is not 3\", name);\n }\n\n std::vector<float> tail3f = object[\"tail\"];\n if(tail3f.size() == 3) {\n tail = glm::vec3(tail3f[0], tail3f[1], tail3f[2]);\n } else {\n throw bad_resource(\"tail data size is not 3\", name);\n }\n\n std::vector<float> color3f = object[\"color\"];\n if(head3f.size() == 3) {\n color = glm::vec3(color3f[0], color3f[1], color3f[2]);\n } else {\n throw bad_resource(\"color data size is not 3\", name);\n }\n\n return std::make_shared<Line>(head, tail, color);\n}\n\nstd::shared_ptr<Texture> ResourceLoader::LoadTexture(std::string filename, bool genMipMaps) {\n FIBITMAP *img;\n filename = \"Resources\/Textures\/\" + filename + \".tga\";\n FREE_IMAGE_FORMAT format = FreeImage_GetFIFFromFilename(filename.c_str());\n\n if(!FreeImage_FIFSupportsReading(format)) {\n throw bad_resource(\"FreeImage can't read from file\", filename);\n }\n\n if(format == FIF_UNKNOWN) {\n throw bad_resource(\"Unknown format\", filename);\n }\n\n img = FreeImage_Load(format, filename.c_str());\n\n if(!img) {\n throw bad_resource(\"Couldn't load image data\", filename);\n }\n\n if(FreeImage_GetBPP(img) != 32) {\n FIBITMAP* oldImg = img;\n img = FreeImage_ConvertTo32Bits(oldImg);\n FreeImage_Unload(oldImg);\n }\n\n int height, width;\n width = FreeImage_GetWidth(img);\n height = FreeImage_GetHeight(img);\n\n unsigned char* bytes = FreeImage_GetBits(img);\n\n if(bytes == nullptr) {\n FreeImage_Unload(img);\n throw bad_resource(\"couldn't load image bytes\", filename);\n }\n\n GLuint glTexture;\n glBindTexture(GL_TEXTURE_2D, 0);\n glGenTextures(1, &glTexture);\n glBindTexture(GL_TEXTURE_2D, glTexture);\n glTexImage2D(GL_TEXTURE_2D, 0, GL_RGBA8, width, height, 0, GL_BGRA, GL_UNSIGNED_BYTE, bytes);\n\n if(genMipMaps) {\n glGenerateMipmap(GL_TEXTURE_2D);\n }\n\n glBindTexture(GL_TEXTURE_2D, 0);\n\n if(!glIsTexture(glTexture)) {\n FreeImage_Unload(img);\n throw bad_resource(\"texture is not valid\", filename);\n }\n\n FreeImage_Unload(img);\n\n std::shared_ptr<Texture> texture = std::make_shared<Texture>();\n texture->SetFileName(filename);\n texture->SetTexture(glTexture);\n return texture;\n}\n\nvoid CopyaiMat(const aiMatrix4x4* from, glm::mat4& to) {\n to[0][0] = from->a1; to[1][0] = from->a2;\n to[2][0] = from->a3; to[3][0] = from->a4;\n to[0][1] = from->b1; to[1][1] = from->b2;\n to[2][1] = from->b3; to[3][1] = from->b4;\n to[0][2] = from->c1; to[1][2] = from->c2;\n to[2][2] = from->c3; to[3][2] = from->c4;\n to[0][3] = from->d1; to[1][3] = from->d2;\n to[2][3] = from->d3; to[3][3] = from->d4;\n}\n\nvoid LoadNode(const aiScene* scene, const aiNode* node, std::vector<std::shared_ptr<Model3D::Mesh>>& meshes) {\n for(uint i = 0; i < node->mNumChildren; i++) {\n LoadNode(scene, node->mChildren[i], meshes);\n }\n\n for(uint i = 0; i < node->mNumMeshes; i++) {\n aiMesh* mesh = scene->mMeshes[node->mMeshes[i]];\n std::vector<Model3D::Vertex> vertices;\n\n for(uint j = 0; j < mesh->mNumVertices; j++) {\n Model3D::Vertex vertex;\n\n vertex.position = glm::vec3(mesh->mVertices[j].x, mesh->mVertices[j].y, mesh->mVertices[j].z);\n\n vertex.normal = (mesh->HasNormals())\n ? glm::vec3(mesh->mNormals[j].x, mesh->mNormals[j].y, mesh->mNormals[j].z)\n : glm::vec3(0.0f, 0.0f, 0.0f);\n\n vertex.texCoord = (mesh->HasTextureCoords(0))\n ? glm::vec2(mesh->mTextureCoords[0][j].x, mesh->mTextureCoords[0][j].y)\n : glm::vec2(0.0f, 0.0f);\n\n vertices.push_back(vertex);\n }\n\n std::vector<uint> indices;\n if(mesh->HasFaces()) {\n for(uint j = 0; j < mesh->mNumFaces; j++) {\n aiFace face = mesh->mFaces[j];\n for(uint k = 0; k < face.mNumIndices; k++) {\n indices.push_back(face.mIndices[k]);\n }\n }\n } else {\n throw bad_resource(\"Node was missing faces, load cancled\");\n }\n\n glm::mat4x4 transformation;\n CopyaiMat(&node->mTransformation, transformation);\n std::shared_ptr<Model3D::Mesh> rmesh = std::make_shared<Model3D::Mesh>(vertices, indices);\n rmesh->SetTransformation(transformation);\n rmesh->SetMatIndex(mesh->mMaterialIndex);\n\n meshes.push_back(rmesh);\n }\n}\n\nModel3D* ResourceLoader::LoadModel3D(std::string modelname) {\n std::string filename = \"Resources\/Models\/\" + modelname + \".3ds\";\n Assimp::Importer importer;\n const aiScene* scene = importer.ReadFile(filename.c_str(),\n aiProcess_CalcTangentSpace |\n aiProcess_Triangulate |\n aiProcess_JoinIdenticalVertices |\n aiProcess_SortByPType);\n\n if(!scene || !scene->mRootNode || scene->mFlags == AI_SCENE_FLAGS_INCOMPLETE) {\n throw bad_resource(importer.GetErrorString(), filename);\n }\n\n auto model = new Model3D();\n\n aiMaterial** materials = scene->mMaterials;\n std::unordered_map<std::string, std::shared_ptr<Texture>> textures;\n for(uint i = 0; i < scene->mNumMaterials; i++) {\n aiString aName;\n materials[i]->Get(AI_MATKEY_NAME, aName);\n std::string name = std::string(aName.C_Str());\n\n if(textures.find(name) == textures.end()) {\n try {\n std::shared_ptr<Texture> temp = LoadTexture(modelname + \"\/\" + name, true);\n if(temp != nullptr) {\n textures[name] = temp;\n }\n } catch (bad_resource& error) {\n error.PrintError();\n }\n }\n }\n model->SetTextures(textures);\n\n std::vector<std::shared_ptr<Model3D::Mesh>> meshes;\n LoadNode(scene, scene->mRootNode, meshes);\n\n for(std::shared_ptr<Model3D::Mesh>& mesh : meshes) {\n aiString aName;\n uint index = mesh->GetMatIndex();\n if(index < scene->mNumMaterials) {\n materials[mesh->GetMatIndex()]->Get(AI_MATKEY_NAME, aName);\n mesh->SetMatName(std::string(aName.C_Str()));\n }\n }\n\n model->SetMeshes(meshes);\n\n return model;\n}\n<commit_msg>transformation are applied on load<commit_after>\/*\n * Resource loader, functions for loading all supported data types\n * - Loads JSON scene information from jsoncpp (https:\/\/github.com\/open-source-parsers\/jsoncpp)\n * - Loads TGA textures via FreeImage\n * - Loads 3Ds models via Assimp\n *\/\n\n#include \"resourceloader.hpp\"\n\n#include <glm\/glm.hpp>\n#include <assimp\/Importer.hpp>\n#include <assimp\/scene.h>\n#include <assimp\/postprocess.h>\n#include <FreeImage.h>\n\n#include <memory>\n#include <vector>\n#include <fstream>\n#include <iostream>\n\n#include <Utilities\/exceptions.hpp>\n#include <Utilities\/log.hpp>\n#include <GL\/gl3w.h>\n#include <Resources\/model3d.hpp>\n#include <Models\/line.hpp>\n#include <Models\/staticmodel.hpp>\n\nusing json = nlohmann::json;\n\nstd::shared_ptr<IRenderObject> ResourceLoader::LoadModelJSON(json object) {\n std::string type = \"\";\n std::string name = \"\";\n\n if(object.find(\"datatype\") != object.end()) {\n type = object[\"datatype\"];\n } else {\n type = \"normal\";\n }\n\n if(object.find(\"name\") != object.end()) {\n name = object[\"name\"];\n } else {\n name = \"null\";\n }\n\n Model3D* model3D;\n\n if(type == \"normal\") {\n model3D = ResourceLoader::LoadModel3D(object[\"filename\"]);\n } else if(type == \"raw\") {\n std::vector<glm::vec3> verts;\n std::vector<std::vector<float>> vertsf = object[\"vertices\"];\n for(std::vector<float> vert : vertsf) {\n if(vert.size() != 3) {\n throw bad_resource(\"Vertex data size is not 3\", name);\n }\n verts.push_back(glm::vec3(vert[0], vert[1], vert[2]));\n }\n\n std::vector<GLuint> indices;\n std::vector<uint> indicesf = object[\"indices\"];\n for(uint index : indicesf) {\n if(index >= verts.size()) {\n throw bad_resource(\"Index is out of range\", name);\n }\n indices.push_back(index);\n }\n\n std::vector<glm::vec3> norms;\n if(object.find(\"noramls\") != object.end()) {\n std::vector<std::vector<float>> normsf = object[\"normals\"];\n for(std::vector<float> norm : normsf) {\n if(norm.size() != 3) {\n throw bad_resource(\"Normal data size is not 3\", name);\n }\n norms.push_back(glm::vec3(norm[0], norm[1], norm[2]));\n }\n } else {\n norms.clear();\n for(uint i = 0; i < verts.size(); i++) {\n norms.push_back(glm::vec3(0.0f));\n }\n }\n\n std::vector<glm::vec2> uvs;\n if(object.find(\"uvs\") != object.end()) {\n std::vector<std::vector<float>> uvsf = object[\"uvs\"];\n for(std::vector<float> uv : uvsf) {\n if(uv.size() != 2) {\n throw bad_resource(\"UV data size is not 2\", name);\n }\n uvs.push_back(glm::vec2(uv[0], uv[1]));\n }\n } else {\n uvs.clear();\n for(uint i = 0; i < verts.size(); i++) {\n uvs.push_back(glm::vec2(0.0f));\n }\n }\n\n std::vector<Model3D::Vertex> vertices;\n for(uint i = 0; i < verts.size(); i++) {\n vertices.push_back(Model3D::Vertex(verts[i], norms[i], uvs[i]));\n }\n\n std::vector<std::shared_ptr<Model3D::Mesh>> meshes;\n meshes.push_back(std::make_shared<Model3D::Mesh>(vertices, indices));\n meshes[0]->SetMatName(\"texture\");\n\n std::unordered_map<std::string, std::shared_ptr<Texture>> textures;\n textures[\"texture\"] = ResourceLoader::LoadTexture(object[\"matname\"], true);\n\n model3D = new Model3D(meshes, textures);\n } else {\n throw bad_resource(\"Unknown data type\", name);\n }\n\n \/*if(object.find(\"scale\") != object.end()) {\n std::vector<float> scale = object[\"scale\"];\n if(scale.size() != 3) {\n throw bad_resource(\"Scale data size is not 3\", name);\n }\n rObject->Scale(glm::vec3(scale[0], scale[1], scale[2]));\n }\n\n if(object.find(\"translation\") != object.end()) {\n std::vector<float> translation = object[\"translation\"];\n if(translation.size() != 3) {\n throw bad_resource(\"Translation data size is not 3\", name);\n }\n rObject->Translate(glm::vec3(translation[0], translation[1], translation[2]));\n }\n\n if(object.find(\"rotation\") != object.end()) {\n std::vector<float> rotation = object[\"rotation\"];\n if(rotation.size() != 3) {\n throw bad_resource(\"Rotation data size is not 3\", name);\n }\n }*\/\n\n return std::make_shared<StaticModel>(model3D);\n}\n\nstd::shared_ptr<IRenderObject> ResourceLoader::LoadLineJSON(json object) {\n glm::vec3 head, tail, color;\n std::string name;\n\n if(object.find(\"name\") != object.end()) {\n name = object[\"name\"];\n } else {\n name = \"null\";\n }\n\n std::vector<float> head3f = object[\"head\"];\n if(head3f.size() == 3) {\n head = glm::vec3(head3f[0], head3f[1], head3f[2]);\n } else {\n throw bad_resource(\"head data size is not 3\", name);\n }\n\n std::vector<float> tail3f = object[\"tail\"];\n if(tail3f.size() == 3) {\n tail = glm::vec3(tail3f[0], tail3f[1], tail3f[2]);\n } else {\n throw bad_resource(\"tail data size is not 3\", name);\n }\n\n std::vector<float> color3f = object[\"color\"];\n if(head3f.size() == 3) {\n color = glm::vec3(color3f[0], color3f[1], color3f[2]);\n } else {\n throw bad_resource(\"color data size is not 3\", name);\n }\n\n return std::make_shared<Line>(head, tail, color);\n}\n\nstd::shared_ptr<Texture> ResourceLoader::LoadTexture(std::string filename, bool genMipMaps) {\n FIBITMAP *img;\n filename = \"Resources\/Textures\/\" + filename + \".tga\";\n FREE_IMAGE_FORMAT format = FreeImage_GetFIFFromFilename(filename.c_str());\n\n if(!FreeImage_FIFSupportsReading(format)) {\n throw bad_resource(\"FreeImage can't read from file\", filename);\n }\n\n if(format == FIF_UNKNOWN) {\n throw bad_resource(\"Unknown format\", filename);\n }\n\n img = FreeImage_Load(format, filename.c_str());\n\n if(!img) {\n throw bad_resource(\"Couldn't load image data\", filename);\n }\n\n if(FreeImage_GetBPP(img) != 32) {\n FIBITMAP* oldImg = img;\n img = FreeImage_ConvertTo32Bits(oldImg);\n FreeImage_Unload(oldImg);\n }\n\n int height, width;\n width = FreeImage_GetWidth(img);\n height = FreeImage_GetHeight(img);\n\n unsigned char* bytes = FreeImage_GetBits(img);\n\n if(bytes == nullptr) {\n FreeImage_Unload(img);\n throw bad_resource(\"couldn't load image bytes\", filename);\n }\n\n GLuint glTexture;\n glBindTexture(GL_TEXTURE_2D, 0);\n glGenTextures(1, &glTexture);\n glBindTexture(GL_TEXTURE_2D, glTexture);\n glTexImage2D(GL_TEXTURE_2D, 0, GL_RGBA8, width, height, 0, GL_BGRA, GL_UNSIGNED_BYTE, bytes);\n\n if(genMipMaps) {\n glGenerateMipmap(GL_TEXTURE_2D);\n }\n\n glBindTexture(GL_TEXTURE_2D, 0);\n\n if(!glIsTexture(glTexture)) {\n FreeImage_Unload(img);\n throw bad_resource(\"texture is not valid\", filename);\n }\n\n FreeImage_Unload(img);\n\n std::shared_ptr<Texture> texture = std::make_shared<Texture>();\n texture->SetFileName(filename);\n texture->SetTexture(glTexture);\n return texture;\n}\n\nvoid CopyaiMat(const aiMatrix4x4* from, glm::mat4& to) {\n to[0][0] = from->a1; to[1][0] = from->a2;\n to[2][0] = from->a3; to[3][0] = from->a4;\n to[0][1] = from->b1; to[1][1] = from->b2;\n to[2][1] = from->b3; to[3][1] = from->b4;\n to[0][2] = from->c1; to[1][2] = from->c2;\n to[2][2] = from->c3; to[3][2] = from->c4;\n to[0][3] = from->d1; to[1][3] = from->d2;\n to[2][3] = from->d3; to[3][3] = from->d4;\n}\n\nvoid LoadNode(const aiScene* scene, const aiNode* node, glm::mat4 parentTransform, std::vector<std::shared_ptr<Model3D::Mesh>>& meshes) {\n glm::mat4x4 transformation;\n CopyaiMat(&node->mTransformation, transformation);\n transformation = parentTransform * transformation;\n\n for(uint i = 0; i < node->mNumChildren; i++) {\n LoadNode(scene, node->mChildren[i], transformation, meshes);\n }\n\n for(uint i = 0; i < node->mNumMeshes; i++) {\n aiMesh* mesh = scene->mMeshes[node->mMeshes[i]];\n std::vector<Model3D::Vertex> vertices;\n\n for(uint j = 0; j < mesh->mNumVertices; j++) {\n Model3D::Vertex vertex;\n\n glm::vec4 position = glm::vec4(mesh->mVertices[j].x, mesh->mVertices[j].y, mesh->mVertices[j].z, 1.0f);\n position = transformation * position;\n vertex.position = glm::vec3(position.x, position.y, position.z);\n\n vertex.normal = (mesh->HasNormals())\n ? glm::vec3(mesh->mNormals[j].x, mesh->mNormals[j].y, mesh->mNormals[j].z)\n : glm::vec3(0.0f, 0.0f, 0.0f);\n\n vertex.texCoord = (mesh->HasTextureCoords(0))\n ? glm::vec2(mesh->mTextureCoords[0][j].x, mesh->mTextureCoords[0][j].y)\n : glm::vec2(0.0f, 0.0f);\n\n vertices.push_back(vertex);\n }\n\n std::vector<uint> indices;\n if(mesh->HasFaces()) {\n for(uint j = 0; j < mesh->mNumFaces; j++) {\n aiFace face = mesh->mFaces[j];\n for(uint k = 0; k < face.mNumIndices; k++) {\n indices.push_back(face.mIndices[k]);\n }\n }\n } else {\n throw bad_resource(\"Node was missing faces, load cancled\");\n }\n\n std::shared_ptr<Model3D::Mesh> rmesh = std::make_shared<Model3D::Mesh>(vertices, indices);\n rmesh->SetTransformation(transformation);\n rmesh->SetMatIndex(mesh->mMaterialIndex);\n\n meshes.push_back(rmesh);\n }\n}\n\nModel3D* ResourceLoader::LoadModel3D(std::string modelname) {\n std::string filename = \"Resources\/Models\/\" + modelname + \".3ds\";\n Assimp::Importer importer;\n const aiScene* scene = importer.ReadFile(filename.c_str(),\n aiProcess_CalcTangentSpace |\n aiProcess_Triangulate |\n aiProcess_JoinIdenticalVertices |\n aiProcess_SortByPType);\n\n if(!scene || !scene->mRootNode || scene->mFlags == AI_SCENE_FLAGS_INCOMPLETE) {\n throw bad_resource(importer.GetErrorString(), filename);\n }\n\n auto model = new Model3D();\n\n aiMaterial** materials = scene->mMaterials;\n std::unordered_map<std::string, std::shared_ptr<Texture>> textures;\n for(uint i = 0; i < scene->mNumMaterials; i++) {\n aiString aName;\n materials[i]->Get(AI_MATKEY_NAME, aName);\n std::string name = std::string(aName.C_Str());\n\n if(textures.find(name) == textures.end()) {\n try {\n std::shared_ptr<Texture> temp = LoadTexture(modelname + \"\/\" + name, true);\n if(temp != nullptr) {\n textures[name] = temp;\n }\n } catch (bad_resource& error) {\n error.PrintError();\n }\n }\n }\n model->SetTextures(textures);\n\n std::vector<std::shared_ptr<Model3D::Mesh>> meshes;\n LoadNode(scene, scene->mRootNode, glm::mat4(1.0f), meshes);\n\n for(std::shared_ptr<Model3D::Mesh>& mesh : meshes) {\n aiString aName;\n uint index = mesh->GetMatIndex();\n if(index < scene->mNumMaterials) {\n materials[mesh->GetMatIndex()]->Get(AI_MATKEY_NAME, aName);\n mesh->SetMatName(std::string(aName.C_Str()));\n }\n }\n\n model->SetMeshes(meshes);\n\n return model;\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\tmCurrentMode = Mode::Docked;\n\tmDialog->close();\n\tmDialog->layout()->removeWidget(mInnerWidget);\n\tsetWidget(mInnerWidget);\n\tsetFloating(false);\n\tshow();\n}\n\nvoid SmartDock::switchToFloating()\n{\n\tif (mCurrentMode == Mode::Floats) {\n\t\treturn;\n\t}\n\n\tmCurrentMode = Mode::Floats;\n\tsetWidget(nullptr);\n\tclose();\n\tstatic_cast<QVBoxLayout *>(mDialog->layout())->addWidget(mInnerWidget);\n\tmInnerWidget->show();\n\tmDialog->show();\n\tif (QWidget * const button = mDialog->findChild<QWidget *>(\"dockSmartDockToMainWindowButton\")) {\n\t\t\/\/ This button is not in layout and thus can sunk in other widgets.\n\t\tbutton->raise();\n\t}\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\tswitchToDocked();\n\t} else {\n\t\tmCurrentMode = Mode::Docked;\n\t\tswitchToFloating();\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\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\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}\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\tQPushButton * const button = new QPushButton(mDialog);\n\t\tbutton->setObjectName(\"dockSmartDockToMainWindowButton\");\n\t\tbutton->setSizePolicy(QSizePolicy::Maximum, QSizePolicy::Maximum);\n\t\tconst int smallButtonSize = 20;\n\t\tbutton->setFixedSize(smallButtonSize, smallButtonSize);\n\t\tbutton->setIcon(style()->standardIcon(QStyle::SP_TitleBarNormalButton));\n\t\tbutton->setToolTip(\"Dock window into main\");\n\t\tconnect(button, &QAbstractButton::clicked, this, &SmartDock::switchToDocked);\n\t} else {\n\t\tswitchToFloating();\n\t}\n}\n<commit_msg>Removed horrible dock button from undocked 2D model<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\tmCurrentMode = Mode::Docked;\n\tmDialog->close();\n\tmDialog->layout()->removeWidget(mInnerWidget);\n\tsetWidget(mInnerWidget);\n\tsetFloating(false);\n\tshow();\n}\n\nvoid SmartDock::switchToFloating()\n{\n\tif (mCurrentMode == Mode::Floats) {\n\t\treturn;\n\t}\n\n\tmCurrentMode = Mode::Floats;\n\tsetWidget(nullptr);\n\tclose();\n\tstatic_cast<QVBoxLayout *>(mDialog->layout())->addWidget(mInnerWidget);\n\tmInnerWidget->show();\n\tmDialog->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\tswitchToDocked();\n\t} else {\n\t\tmCurrentMode = Mode::Docked;\n\t\tswitchToFloating();\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\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\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}\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<|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 \"TestFile.hpp\"\n\n#include <nix\/util\/util.hpp>\n#include <nix\/valid\/validate.hpp>\n\n#include <ctime>\n\n\nusing namespace std;\nusing namespace nix;\nusing namespace valid;\n\n\nvoid TestFile::setUp() {\n statup_time = time(NULL);\n file_open = File::open(\"test_file.h5\", FileMode::Overwrite);\n file_other = File::open(\"test_file_other.h5\", FileMode::Overwrite);\n file_null = NULL;\n}\n\n\nvoid TestFile::tearDown() {\n file_open.close();\n file_other.close();\n}\n\n\nvoid TestFile::testValidate() {\n valid::Result result = validate(file_open);\n CPPUNIT_ASSERT(result.getErrors().size() == 0);\n CPPUNIT_ASSERT(result.getErrors().size() == 0);\n}\n\n\nvoid TestFile::testFormat() {\n CPPUNIT_ASSERT(file_open.format() == \"nix\");\n}\n\n\nvoid TestFile::testLocation() {\n CPPUNIT_ASSERT(file_open.location() == \"test_file.h5\");\n CPPUNIT_ASSERT(file_other.location() == \"test_file_other.h5\");\n}\n\n\nvoid TestFile::testVersion() {\n vector<int> version{1, 0, 0};\n CPPUNIT_ASSERT(file_open.version() == version);\n}\n\n\nvoid TestFile::testCreatedAt() {\n CPPUNIT_ASSERT(file_open.createdAt() >= statup_time);\n time_t past_time = time(NULL) - 10000000;\n file_open.forceCreatedAt(past_time);\n CPPUNIT_ASSERT(file_open.createdAt() == past_time);\n}\n\n\nvoid TestFile::testUpdatedAt() {\n CPPUNIT_ASSERT(file_open.updatedAt() >= statup_time);\n}\n\n\nvoid TestFile::testBlockAccess() {\n vector<string> names = { \"block_a\", \"block_b\", \"block_c\", \"block_d\", \"block_e\" };\n\n CPPUNIT_ASSERT(file_open.blockCount() == 0);\n CPPUNIT_ASSERT(file_open.blocks().size() == 0);\n CPPUNIT_ASSERT(file_open.getBlock(\"invalid_id\") == false);\n\n vector<string> ids;\n for (auto it = names.begin(); it != names.end(); it++) {\n Block bl = file_open.createBlock(*it, \"dataset\");\n CPPUNIT_ASSERT(bl.name() == *it);\n\n ids.push_back(bl.id());\n }\n CPPUNIT_ASSERT_THROW(file_open.createBlock(names[0], \"dataset\"),\n DuplicateName);\n\n CPPUNIT_ASSERT(file_open.blockCount() == names.size());\n CPPUNIT_ASSERT(file_open.blocks().size() == names.size());\n\n for (const auto &name : names) {\n Block bl_name = file_open.getBlock(name);\n CPPUNIT_ASSERT(bl_name);\n\n Block bl_id = file_open.getBlock(bl_name.id());\n CPPUNIT_ASSERT(bl_id);\n CPPUNIT_ASSERT_EQUAL(bl_name.name(), bl_id.name());\n }\n \n for (auto it = ids.begin(); it != ids.end(); it++) {\n Block bl = file_open.getBlock(*it);\n CPPUNIT_ASSERT(file_open.hasBlock(*it) == true);\n CPPUNIT_ASSERT(bl.id() == *it);\n\n file_open.deleteBlock(*it);\n }\n\n CPPUNIT_ASSERT(file_open.blockCount() == 0);\n CPPUNIT_ASSERT(file_open.blocks().size() == 0);\n CPPUNIT_ASSERT(file_open.getBlock(\"invalid_id\") == false);\n}\n\n\nvoid TestFile::testSectionAccess() {\n vector<string> names = {\"section_a\", \"section_b\", \"section_c\", \"section_d\", \"section_e\" };\n\n CPPUNIT_ASSERT(file_open.sectionCount() == 0);\n CPPUNIT_ASSERT(file_open.sections().size() == 0);\n CPPUNIT_ASSERT(file_open.getSection(\"invalid_id\") == false);\n\n vector<string> ids;\n for (auto it = names.begin(); it != names.end(); it++) {\n Section sec = file_open.createSection(*it, \"root section\");\n CPPUNIT_ASSERT(sec.name() == *it);\n\n ids.push_back(sec.id());\n }\n CPPUNIT_ASSERT_THROW(file_open.createSection(names[0], \"root section\"),\n DuplicateName);\n\n CPPUNIT_ASSERT(file_open.sectionCount() == names.size());\n CPPUNIT_ASSERT(file_open.sections().size() == names.size());\n\n for (auto it = ids.begin(); it != ids.end(); it++) {\n Section sec = file_open.getSection(*it);\n CPPUNIT_ASSERT(file_open.hasSection(*it) == true);\n CPPUNIT_ASSERT(sec.id() == *it);\n\n file_open.deleteSection(*it);\n }\n\n CPPUNIT_ASSERT(file_open.sectionCount() == 0);\n CPPUNIT_ASSERT(file_open.sections().size() == 0);\n CPPUNIT_ASSERT(file_open.getSection(\"invalid_id\") == false);\n}\n\n\nvoid TestFile::testOperators(){\n CPPUNIT_ASSERT(file_null == false);\n CPPUNIT_ASSERT(file_null == none);\n\n CPPUNIT_ASSERT(file_open != false);\n CPPUNIT_ASSERT(file_open != none);\n\n CPPUNIT_ASSERT(file_open == file_open);\n CPPUNIT_ASSERT(file_open != file_other);\n\n file_other = file_open;\n CPPUNIT_ASSERT(file_other == file_open);\n\n file_other = none;\n CPPUNIT_ASSERT(file_null == false);\n CPPUNIT_ASSERT(file_null == none);\n}\n\nvoid TestFile::testReopen() {\n \/\/file_open is currently open\n Block b = file_open.createBlock(\"a\", \"a\");\n b = none;\n file_open.close();\n\n file_open = nix::File::open(\"test_file_b.h5\", FileMode::Overwrite);\n b = file_open.createBlock(\"b\", \"b\");\n}\n\n<commit_msg>[test] File: block access: cleanup + extend<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 \"TestFile.hpp\"\n\n#include <nix\/util\/util.hpp>\n#include <nix\/valid\/validate.hpp>\n\n#include <ctime>\n\n\nusing namespace std;\nusing namespace nix;\nusing namespace valid;\n\n\nvoid TestFile::setUp() {\n statup_time = time(NULL);\n file_open = File::open(\"test_file.h5\", FileMode::Overwrite);\n file_other = File::open(\"test_file_other.h5\", FileMode::Overwrite);\n file_null = NULL;\n}\n\n\nvoid TestFile::tearDown() {\n file_open.close();\n file_other.close();\n}\n\n\nvoid TestFile::testValidate() {\n valid::Result result = validate(file_open);\n CPPUNIT_ASSERT(result.getErrors().size() == 0);\n CPPUNIT_ASSERT(result.getErrors().size() == 0);\n}\n\n\nvoid TestFile::testFormat() {\n CPPUNIT_ASSERT(file_open.format() == \"nix\");\n}\n\n\nvoid TestFile::testLocation() {\n CPPUNIT_ASSERT(file_open.location() == \"test_file.h5\");\n CPPUNIT_ASSERT(file_other.location() == \"test_file_other.h5\");\n}\n\n\nvoid TestFile::testVersion() {\n vector<int> version{1, 0, 0};\n CPPUNIT_ASSERT(file_open.version() == version);\n}\n\n\nvoid TestFile::testCreatedAt() {\n CPPUNIT_ASSERT(file_open.createdAt() >= statup_time);\n time_t past_time = time(NULL) - 10000000;\n file_open.forceCreatedAt(past_time);\n CPPUNIT_ASSERT(file_open.createdAt() == past_time);\n}\n\n\nvoid TestFile::testUpdatedAt() {\n CPPUNIT_ASSERT(file_open.updatedAt() >= statup_time);\n}\n\n\nvoid TestFile::testBlockAccess() {\n vector<string> names = { \"block_a\", \"block_b\", \"block_c\", \"block_d\", \"block_e\" };\n\n CPPUNIT_ASSERT(file_open.blockCount() == 0);\n CPPUNIT_ASSERT(file_open.blocks().size() == 0);\n CPPUNIT_ASSERT(file_open.getBlock(\"invalid_id\") == false);\n CPPUNIT_ASSERT_EQUAL(false, file_open.hasBlock(\"invalid_id\"));\n\n vector<string> ids;\n for (const auto &name : names) {\n Block bl = file_open.createBlock(name, \"dataset\");\n CPPUNIT_ASSERT(bl.name() == name);\n CPPUNIT_ASSERT(file_open.hasBlock(bl));\n CPPUNIT_ASSERT(file_open.hasBlock(name));\n\n ids.push_back(bl.id());\n }\n CPPUNIT_ASSERT_THROW(file_open.createBlock(names[0], \"dataset\"),\n DuplicateName);\n\n CPPUNIT_ASSERT(file_open.blockCount() == names.size());\n CPPUNIT_ASSERT(file_open.blocks().size() == names.size());\n\n for (const auto &name : names) {\n Block bl_name = file_open.getBlock(name);\n CPPUNIT_ASSERT(bl_name);\n\n Block bl_id = file_open.getBlock(bl_name.id());\n CPPUNIT_ASSERT(bl_id);\n CPPUNIT_ASSERT_EQUAL(bl_name.name(), bl_id.name());\n }\n \n for (const auto &id: ids) {\n Block bl = file_open.getBlock(id);\n CPPUNIT_ASSERT(file_open.hasBlock(id) == true);\n CPPUNIT_ASSERT(bl.id() == id);\n\n file_open.deleteBlock(id);\n }\n\n CPPUNIT_ASSERT(file_open.blockCount() == 0);\n CPPUNIT_ASSERT(file_open.blocks().size() == 0);\n CPPUNIT_ASSERT(file_open.getBlock(\"invalid_id\") == false);\n}\n\n\nvoid TestFile::testSectionAccess() {\n vector<string> names = {\"section_a\", \"section_b\", \"section_c\", \"section_d\", \"section_e\" };\n\n CPPUNIT_ASSERT(file_open.sectionCount() == 0);\n CPPUNIT_ASSERT(file_open.sections().size() == 0);\n CPPUNIT_ASSERT(file_open.getSection(\"invalid_id\") == false);\n\n vector<string> ids;\n for (auto it = names.begin(); it != names.end(); it++) {\n Section sec = file_open.createSection(*it, \"root section\");\n CPPUNIT_ASSERT(sec.name() == *it);\n\n ids.push_back(sec.id());\n }\n CPPUNIT_ASSERT_THROW(file_open.createSection(names[0], \"root section\"),\n DuplicateName);\n\n CPPUNIT_ASSERT(file_open.sectionCount() == names.size());\n CPPUNIT_ASSERT(file_open.sections().size() == names.size());\n\n for (auto it = ids.begin(); it != ids.end(); it++) {\n Section sec = file_open.getSection(*it);\n CPPUNIT_ASSERT(file_open.hasSection(*it) == true);\n CPPUNIT_ASSERT(sec.id() == *it);\n\n file_open.deleteSection(*it);\n }\n\n CPPUNIT_ASSERT(file_open.sectionCount() == 0);\n CPPUNIT_ASSERT(file_open.sections().size() == 0);\n CPPUNIT_ASSERT(file_open.getSection(\"invalid_id\") == false);\n}\n\n\nvoid TestFile::testOperators(){\n CPPUNIT_ASSERT(file_null == false);\n CPPUNIT_ASSERT(file_null == none);\n\n CPPUNIT_ASSERT(file_open != false);\n CPPUNIT_ASSERT(file_open != none);\n\n CPPUNIT_ASSERT(file_open == file_open);\n CPPUNIT_ASSERT(file_open != file_other);\n\n file_other = file_open;\n CPPUNIT_ASSERT(file_other == file_open);\n\n file_other = none;\n CPPUNIT_ASSERT(file_null == false);\n CPPUNIT_ASSERT(file_null == none);\n}\n\nvoid TestFile::testReopen() {\n \/\/file_open is currently open\n Block b = file_open.createBlock(\"a\", \"a\");\n b = none;\n file_open.close();\n\n file_open = nix::File::open(\"test_file_b.h5\", FileMode::Overwrite);\n b = file_open.createBlock(\"b\", \"b\");\n}\n\n<|endoftext|>"} {"text":"<commit_before>\/\/ Copyright (c) 2013, German Neuroinformatics Node (G-Node)\n\/\/\n\/\/ All rights reserved.\n\/\/\n\/\/ Redistribution and use in source and binary forms, with or without\n\/\/ modification, are permitted under the terms of the BSD License. See\n\/\/ LICENSE file in the root of the Project.\n\n#include \"TestUtil.hpp\"\n\n#include <ctime>\n#include <cmath>\n\n\nusing namespace std;\nusing namespace nix;\n\n\nvoid TestUtil::testStrUtils() {\n string a = \" a \";\n string b = \"\\tb\\t\";\n string c = \" c c\\tc \";\n\n const string ac = a;\n const string bc = b;\n const string cc = c;\n\n string ad = util::deblankString(ac);\n string bd = util::deblankString(bc);\n string cd = util::deblankString(cc);\n\n util::deblankString(a);\n util::deblankString(b);\n util::deblankString(c);\n\n CPPUNIT_ASSERT_EQUAL(string(\"a\"), a);\n CPPUNIT_ASSERT_EQUAL(string(\"b\"), b);\n CPPUNIT_ASSERT_EQUAL(string(\"ccc\"), c);\n\n CPPUNIT_ASSERT_EQUAL(ad, a);\n CPPUNIT_ASSERT_EQUAL(bd, b);\n CPPUNIT_ASSERT_EQUAL(cd, c);\n}\n\nvoid TestUtil::testUnitScaling() {\n CPPUNIT_ASSERT_THROW(util::getSIScaling(\"mOhm\",\"ms\"), nix::InvalidUnit);\n CPPUNIT_ASSERT(util::getSIScaling(\"mV\",\"kV\") == 1e-6);\n CPPUNIT_ASSERT(util::getSIScaling(\"V\",\"kV\") == 1e-03);\n CPPUNIT_ASSERT(util::getSIScaling(\"kV\",\"V\") == 1e+03);\n CPPUNIT_ASSERT_THROW(util::getSIScaling(\"mV^2\",\"V\"), nix::InvalidUnit);\n CPPUNIT_ASSERT(util::getSIScaling(\"V^2\",\"V^2\") == 1.0);\n CPPUNIT_ASSERT(util::getSIScaling(\"V\",\"mV\") == 1e+03);\n CPPUNIT_ASSERT(util::getSIScaling(\"V^2\",\"mV^2\") == 1e+06);\n CPPUNIT_ASSERT(util::getSIScaling(\"mV^2\",\"kV^2\") == 1e-12);\n}\n\nvoid TestUtil::testIsSIUnit() {\n CPPUNIT_ASSERT(util::isSIUnit(\"V\"));\n CPPUNIT_ASSERT(util::isSIUnit(\"mV\"));\n CPPUNIT_ASSERT(util::isSIUnit(\"mV^-2\"));\n CPPUNIT_ASSERT(util::isSIUnit(\"mV\/cm\"));\n CPPUNIT_ASSERT(util::isSIUnit(\"dB\"));\n CPPUNIT_ASSERT(util::isSIUnit(\"rad\"));\n}\n\nvoid TestUtil::testSIUnitSplit() {\n string unit_1 = \"V\";\n string unit_2 = \"mV\";\n string unit_3 = \"mV^2\";\n string unit_4 = \"mV^-2\";\n string unit_5 = \"m^2\";\n\n string unit, prefix, power;\n util::splitUnit(unit_1, prefix, unit, power);\n CPPUNIT_ASSERT(prefix == \"\" && unit == \"V\" && power == \"\");\n util::splitUnit(unit_2, prefix, unit, power);\n CPPUNIT_ASSERT(prefix == \"m\" && unit == \"V\" && power == \"\");\n util::splitUnit(unit_3, prefix, unit, power);\n CPPUNIT_ASSERT(prefix == \"m\" && unit == \"V\" && power == \"2\");\n util::splitUnit(unit_4, prefix, unit, power);\n CPPUNIT_ASSERT(prefix == \"m\" && unit == \"V\" && power == \"-2\");\n util::splitUnit(unit_5, prefix, unit, power);\n CPPUNIT_ASSERT(prefix == \"\" && unit == \"m\" && power == \"2\");\n}\n\nvoid TestUtil::testIsAtomicSIUnit() {\n CPPUNIT_ASSERT(util::isAtomicSIUnit(\"V\"));\n CPPUNIT_ASSERT(util::isAtomicSIUnit(\"mV\"));\n CPPUNIT_ASSERT(util::isAtomicSIUnit(\"mV^-2\"));\n CPPUNIT_ASSERT(!util::isAtomicSIUnit(\"mV\/cm\"));\n CPPUNIT_ASSERT(util::isAtomicSIUnit(\"dB\"));\n CPPUNIT_ASSERT(util::isAtomicSIUnit(\"rad\"));\n}\n\nvoid TestUtil::testIsCompoundSIUnit() {\n string unit_1 = \"mV*cm^-2\";\n string unit_2 = \"mV\/cm^2\";\n string unit_3 = \"mV\/cm^2*kg\";\n string unit_4 = \"mV\";\n\n CPPUNIT_ASSERT(util::isCompoundSIUnit(unit_1));\n CPPUNIT_ASSERT(util::isCompoundSIUnit(unit_2));\n CPPUNIT_ASSERT(util::isCompoundSIUnit(unit_3));\n CPPUNIT_ASSERT(!util::isCompoundSIUnit(unit_4));\n}\n\n\nvoid TestUtil::testSplitCompoundUnit() {\n string unit = \"mV\/cm^2*kg*V\";\n vector<string> atomic_units;\n\n util::splitCompoundUnit(unit, atomic_units);\n\n CPPUNIT_ASSERT(atomic_units.size() == 4);\n CPPUNIT_ASSERT(atomic_units[0] == \"mV\" && atomic_units[1] == \"cm^2\" &&\n atomic_units[2] == \"kg\" && atomic_units[3] == \"V\");\n}\n\nvoid TestUtil::testConvertToSeconds() {\n string unit_min = \"min\";\n string unit_h = \"h\";\n string unit_s = \"s\";\n string unit_ms = \"ms\";\n string unit_Ms = \"Ms\";\n double min_value = 25.5;\n double h_value = 12.25;\n double s_value = 100;\n int64_t m_value = 25;\n CPPUNIT_ASSERT(util::convertToSeconds(unit_min, min_value) == 1530.0);\n CPPUNIT_ASSERT(util::convertToSeconds(unit_h, h_value) == 44100.0);\n CPPUNIT_ASSERT(util::convertToSeconds(unit_min, m_value) == 1500);\n CPPUNIT_ASSERT(util::convertToSeconds(unit_s, s_value) == s_value);\n CPPUNIT_ASSERT(util::convertToSeconds(unit_ms, s_value) == s_value\/1000.);\n CPPUNIT_ASSERT(util::convertToSeconds(unit_Ms, s_value) == s_value*1000000.);\n}\n\nvoid TestUtil::testConvertToKelvin() {\n string unit_f = \"°F\";\n string unit_f2 = \"F\";\n string unit_c = \"°C\";\n string unit_c2 = \"C\";\n string unit_k = \"K\";\n string unit_mk = \"mK\";\n string unit_Mk = \"MK\";\n string unit_k2 =\"°K\" ;\n double temperature = 100.0;\n CPPUNIT_ASSERT(util::convertToKelvin(unit_c, temperature) == 373.15);\n CPPUNIT_ASSERT(util::convertToKelvin(unit_c2, temperature) == 373.15);\n CPPUNIT_ASSERT(round(util::convertToKelvin(unit_f, temperature)) == 311.0);\n CPPUNIT_ASSERT(round(util::convertToKelvin(unit_f2, temperature)) == 311.0);\n CPPUNIT_ASSERT(util::convertToKelvin(unit_k, temperature) == temperature);\n CPPUNIT_ASSERT(util::convertToKelvin(unit_k2, temperature) == temperature);\n CPPUNIT_ASSERT(util::convertToKelvin(unit_mk, temperature) == temperature\/1000.);\n CPPUNIT_ASSERT(util::convertToKelvin(unit_Mk, temperature) == temperature*1000000.);\n int temp_fi = 100;\n CPPUNIT_ASSERT(util::convertToKelvin(unit_f, temp_fi) == 311);\n}\n\nvoid TestUtil::testUnitSanitizer() {\n std::string unit = \" mul\/µs \";\n CPPUNIT_ASSERT(util::unitSanitizer(unit) == \"ul\/us\");\n}\n<commit_msg>[util] adapt and extend test for util::split_compound<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 \"TestUtil.hpp\"\n\n#include <ctime>\n#include <cmath>\n\n\nusing namespace std;\nusing namespace nix;\n\n\nvoid TestUtil::testStrUtils() {\n string a = \" a \";\n string b = \"\\tb\\t\";\n string c = \" c c\\tc \";\n\n const string ac = a;\n const string bc = b;\n const string cc = c;\n\n string ad = util::deblankString(ac);\n string bd = util::deblankString(bc);\n string cd = util::deblankString(cc);\n\n util::deblankString(a);\n util::deblankString(b);\n util::deblankString(c);\n\n CPPUNIT_ASSERT_EQUAL(string(\"a\"), a);\n CPPUNIT_ASSERT_EQUAL(string(\"b\"), b);\n CPPUNIT_ASSERT_EQUAL(string(\"ccc\"), c);\n\n CPPUNIT_ASSERT_EQUAL(ad, a);\n CPPUNIT_ASSERT_EQUAL(bd, b);\n CPPUNIT_ASSERT_EQUAL(cd, c);\n}\n\nvoid TestUtil::testUnitScaling() {\n CPPUNIT_ASSERT_THROW(util::getSIScaling(\"mOhm\",\"ms\"), nix::InvalidUnit);\n CPPUNIT_ASSERT(util::getSIScaling(\"mV\",\"kV\") == 1e-6);\n CPPUNIT_ASSERT(util::getSIScaling(\"V\",\"kV\") == 1e-03);\n CPPUNIT_ASSERT(util::getSIScaling(\"kV\",\"V\") == 1e+03);\n CPPUNIT_ASSERT_THROW(util::getSIScaling(\"mV^2\",\"V\"), nix::InvalidUnit);\n CPPUNIT_ASSERT(util::getSIScaling(\"V^2\",\"V^2\") == 1.0);\n CPPUNIT_ASSERT(util::getSIScaling(\"V\",\"mV\") == 1e+03);\n CPPUNIT_ASSERT(util::getSIScaling(\"V^2\",\"mV^2\") == 1e+06);\n CPPUNIT_ASSERT(util::getSIScaling(\"mV^2\",\"kV^2\") == 1e-12);\n}\n\nvoid TestUtil::testIsSIUnit() {\n CPPUNIT_ASSERT(util::isSIUnit(\"V\"));\n CPPUNIT_ASSERT(util::isSIUnit(\"mV\"));\n CPPUNIT_ASSERT(util::isSIUnit(\"mV^-2\"));\n CPPUNIT_ASSERT(util::isSIUnit(\"mV\/cm\"));\n CPPUNIT_ASSERT(util::isSIUnit(\"dB\"));\n CPPUNIT_ASSERT(util::isSIUnit(\"rad\"));\n}\n\nvoid TestUtil::testSIUnitSplit() {\n string unit_1 = \"V\";\n string unit_2 = \"mV\";\n string unit_3 = \"mV^2\";\n string unit_4 = \"mV^-2\";\n string unit_5 = \"m^2\";\n\n string unit, prefix, power;\n util::splitUnit(unit_1, prefix, unit, power);\n CPPUNIT_ASSERT(prefix == \"\" && unit == \"V\" && power == \"\");\n util::splitUnit(unit_2, prefix, unit, power);\n CPPUNIT_ASSERT(prefix == \"m\" && unit == \"V\" && power == \"\");\n util::splitUnit(unit_3, prefix, unit, power);\n CPPUNIT_ASSERT(prefix == \"m\" && unit == \"V\" && power == \"2\");\n util::splitUnit(unit_4, prefix, unit, power);\n CPPUNIT_ASSERT(prefix == \"m\" && unit == \"V\" && power == \"-2\");\n util::splitUnit(unit_5, prefix, unit, power);\n CPPUNIT_ASSERT(prefix == \"\" && unit == \"m\" && power == \"2\");\n}\n\nvoid TestUtil::testIsAtomicSIUnit() {\n CPPUNIT_ASSERT(util::isAtomicSIUnit(\"V\"));\n CPPUNIT_ASSERT(util::isAtomicSIUnit(\"mV\"));\n CPPUNIT_ASSERT(util::isAtomicSIUnit(\"mV^-2\"));\n CPPUNIT_ASSERT(!util::isAtomicSIUnit(\"mV\/cm\"));\n CPPUNIT_ASSERT(util::isAtomicSIUnit(\"dB\"));\n CPPUNIT_ASSERT(util::isAtomicSIUnit(\"rad\"));\n}\n\nvoid TestUtil::testIsCompoundSIUnit() {\n string unit_1 = \"mV*cm^-2\";\n string unit_2 = \"mV\/cm^2\";\n string unit_3 = \"mV\/cm^2*kg\";\n string unit_4 = \"mV\";\n\n CPPUNIT_ASSERT(util::isCompoundSIUnit(unit_1));\n CPPUNIT_ASSERT(util::isCompoundSIUnit(unit_2));\n CPPUNIT_ASSERT(util::isCompoundSIUnit(unit_3));\n CPPUNIT_ASSERT(!util::isCompoundSIUnit(unit_4));\n}\n\n\nvoid TestUtil::testSplitCompoundUnit() {\n string unit = \"mV\/cm^2*kg*V\";\n string unit_2 = \"mOhm\/m\";\n string unit_3 = \"mV\";\n\n vector<string> atomic_units, atomic_units_2, atomic_units_3;\n util::splitCompoundUnit(unit, atomic_units);\n CPPUNIT_ASSERT(atomic_units.size() == 4);\n CPPUNIT_ASSERT(atomic_units[0] == \"mV\" && atomic_units[1] == \"cm^-2\" &&\n atomic_units[2] == \"kg\" && atomic_units[3] == \"V\");\n\n util::splitCompoundUnit(unit_2, atomic_units_2);\n CPPUNIT_ASSERT(atomic_units_2.size() == 2);\n CPPUNIT_ASSERT(atomic_units_2[0] == \"mOhm\" && atomic_units_2[1] == \"m^-1\");\n\n util::splitCompoundUnit(unit_3, atomic_units_3);\n CPPUNIT_ASSERT(atomic_units_3.size() == 1);\n CPPUNIT_ASSERT(atomic_units_3[0] == unit_3);\n}\n\n\nvoid TestUtil::testConvertToSeconds() {\n string unit_min = \"min\";\n string unit_h = \"h\";\n string unit_s = \"s\";\n string unit_ms = \"ms\";\n string unit_Ms = \"Ms\";\n double min_value = 25.5;\n double h_value = 12.25;\n double s_value = 100;\n int64_t m_value = 25;\n CPPUNIT_ASSERT(util::convertToSeconds(unit_min, min_value) == 1530.0);\n CPPUNIT_ASSERT(util::convertToSeconds(unit_h, h_value) == 44100.0);\n CPPUNIT_ASSERT(util::convertToSeconds(unit_min, m_value) == 1500);\n CPPUNIT_ASSERT(util::convertToSeconds(unit_s, s_value) == s_value);\n CPPUNIT_ASSERT(util::convertToSeconds(unit_ms, s_value) == s_value\/1000.);\n CPPUNIT_ASSERT(util::convertToSeconds(unit_Ms, s_value) == s_value*1000000.);\n}\n\nvoid TestUtil::testConvertToKelvin() {\n string unit_f = \"°F\";\n string unit_f2 = \"F\";\n string unit_c = \"°C\";\n string unit_c2 = \"C\";\n string unit_k = \"K\";\n string unit_mk = \"mK\";\n string unit_Mk = \"MK\";\n string unit_k2 =\"°K\" ;\n double temperature = 100.0;\n CPPUNIT_ASSERT(util::convertToKelvin(unit_c, temperature) == 373.15);\n CPPUNIT_ASSERT(util::convertToKelvin(unit_c2, temperature) == 373.15);\n CPPUNIT_ASSERT(round(util::convertToKelvin(unit_f, temperature)) == 311.0);\n CPPUNIT_ASSERT(round(util::convertToKelvin(unit_f2, temperature)) == 311.0);\n CPPUNIT_ASSERT(util::convertToKelvin(unit_k, temperature) == temperature);\n CPPUNIT_ASSERT(util::convertToKelvin(unit_k2, temperature) == temperature);\n CPPUNIT_ASSERT(util::convertToKelvin(unit_mk, temperature) == temperature\/1000.);\n CPPUNIT_ASSERT(util::convertToKelvin(unit_Mk, temperature) == temperature*1000000.);\n int temp_fi = 100;\n CPPUNIT_ASSERT(util::convertToKelvin(unit_f, temp_fi) == 311);\n}\n\nvoid TestUtil::testUnitSanitizer() {\n std::string unit = \" mul\/µs \";\n CPPUNIT_ASSERT(util::unitSanitizer(unit) == \"ul\/us\");\n}\n<|endoftext|>"} {"text":"<commit_before>\/*************************************************************************\n *\n * $RCSfile: detdata.hxx,v $\n *\n * $Revision: 1.2 $\n *\n * last change: $Author: nn $ $Date: 2002-11-04 15:45: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#ifndef SC_DETDATA_HXX\n#define SC_DETDATA_HXX\n\n#ifndef _SVARRAY_HXX \/\/autogen\n#include <svtools\/svarray.hxx>\n#endif\n\n#ifndef SC_SCGLOB_HXX\n#include \"global.hxx\"\n#endif\n\n\n\/\/------------------------------------------------------------------------\n\n#define SC_DETOP_GROW 4\n\n\/\/------------------------------------------------------------------------\nenum ScDetOpType\n{\n SCDETOP_ADDSUCC,\n SCDETOP_DELSUCC,\n SCDETOP_ADDPRED,\n SCDETOP_DELPRED,\n SCDETOP_ADDERROR\n};\n\n\/\/------------------------------------------------------------------------\n\nclass ScDetOpData\n{\n ScAddress aPos;\n ScDetOpType eOperation;\n\npublic:\n ScDetOpData( const ScAddress& rP, ScDetOpType eOp ) :\n aPos(rP), eOperation(eOp) {}\n\n ScDetOpData( const ScDetOpData& rData ) :\n aPos(rData.aPos), eOperation(rData.eOperation) {}\n\n const ScAddress& GetPos() const { return aPos; }\n ScDetOpType GetOperation() const { return eOperation; }\n\n \/\/ fuer UpdateRef:\n void SetPos(const ScAddress& rNew) { aPos=rNew; }\n\n int operator== ( const ScDetOpData& r ) const\n { return eOperation == r.eOperation && aPos == r.aPos; }\n};\n\n\/\/------------------------------------------------------------------------\n\n\/\/\n\/\/ Liste der Operationen\n\/\/\n\ntypedef ScDetOpData* ScDetOpDataPtr;\n\nSV_DECL_PTRARR_DEL(ScDetOpArr_Impl, ScDetOpDataPtr, SC_DETOP_GROW, SC_DETOP_GROW);\n\nclass ScDetOpList : public ScDetOpArr_Impl\n{\n BOOL bHasAddError; \/\/ updated in Append\n\npublic:\n ScDetOpList() : bHasAddError(FALSE) {}\n ScDetOpList(const ScDetOpList& rList);\n ~ScDetOpList() {}\n\n void UpdateReference( ScDocument* pDoc, UpdateRefMode eUpdateRefMode,\n const ScRange& rRange, short nDx, short nDy, short nDz );\n\n BOOL operator==( const ScDetOpList& r ) const; \/\/ fuer Ref-Undo\n\n void Append( ScDetOpData* pData );\n\n void Load( SvStream& rStream );\n void Store( SvStream& rStream ) const;\n\n BOOL HasAddError() const { return bHasAddError; }\n};\n\n\n\n#endif\n<commit_msg>INTEGRATION: CWS rowlimit (1.2.302); FILE MERGED 2004\/01\/12 17:14:55 er 1.2.302.2: #i1967# SCCOL,SCROW,SCTAB replace USHORT; SCsCOL,SCsROW,SCsTAB replace short 2003\/11\/28 19:47:18 er 1.2.302.1: #i1967# move ScAddress, ScRange from global.hxx to address.hxx<commit_after>\/*************************************************************************\n *\n * $RCSfile: detdata.hxx,v $\n *\n * $Revision: 1.3 $\n *\n * last change: $Author: obo $ $Date: 2004-06-04 10:06:42 $\n *\n * The Contents of this file are made available subject to the terms of\n * either of the following licenses\n *\n * - GNU Lesser General Public License Version 2.1\n * - Sun Industry Standards Source License Version 1.1\n *\n * Sun Microsystems Inc., October, 2000\n *\n * GNU Lesser General Public License Version 2.1\n * =============================================\n * Copyright 2000 by Sun Microsystems, Inc.\n * 901 San Antonio Road, Palo Alto, CA 94303, USA\n *\n * This library is free software; you can redistribute it and\/or\n * modify it under the terms of the GNU Lesser General Public\n * License version 2.1, as published by the Free Software Foundation.\n *\n * This library is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU\n * Lesser General Public License for more details.\n *\n * You should have received a copy of the GNU Lesser General Public\n * License along with this library; if not, write to the Free Software\n * Foundation, Inc., 59 Temple Place, Suite 330, Boston,\n * MA 02111-1307 USA\n *\n *\n * Sun Industry Standards Source License Version 1.1\n * =================================================\n * The contents of this file are subject to the Sun Industry Standards\n * Source License Version 1.1 (the \"License\"); You may not use this file\n * except in compliance with the License. You may obtain a copy of the\n * License at http:\/\/www.openoffice.org\/license.html.\n *\n * Software provided under this License is provided on an \"AS IS\" basis,\n * WITHOUT WARRANTY OF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING,\n * WITHOUT LIMITATION, WARRANTIES THAT THE SOFTWARE IS FREE OF DEFECTS,\n * MERCHANTABLE, FIT FOR A PARTICULAR PURPOSE, OR NON-INFRINGING.\n * See the License for the specific provisions governing your rights and\n * obligations concerning the Software.\n *\n * The Initial Developer of the Original Code is: Sun Microsystems, Inc.\n *\n * Copyright: 2000 by Sun Microsystems, Inc.\n *\n * All Rights Reserved.\n *\n * Contributor(s): _______________________________________\n *\n *\n ************************************************************************\/\n\n#ifndef SC_DETDATA_HXX\n#define SC_DETDATA_HXX\n\n#ifndef _SVARRAY_HXX \/\/autogen\n#include <svtools\/svarray.hxx>\n#endif\n\n#ifndef SC_SCGLOB_HXX\n#include \"global.hxx\"\n#endif\n\n#ifndef SC_ADDRESS_HXX\n#include \"address.hxx\"\n#endif\n\n\n\/\/------------------------------------------------------------------------\n\n#define SC_DETOP_GROW 4\n\n\/\/------------------------------------------------------------------------\nenum ScDetOpType\n{\n SCDETOP_ADDSUCC,\n SCDETOP_DELSUCC,\n SCDETOP_ADDPRED,\n SCDETOP_DELPRED,\n SCDETOP_ADDERROR\n};\n\n\/\/------------------------------------------------------------------------\n\nclass ScDetOpData\n{\n ScAddress aPos;\n ScDetOpType eOperation;\n\npublic:\n ScDetOpData( const ScAddress& rP, ScDetOpType eOp ) :\n aPos(rP), eOperation(eOp) {}\n\n ScDetOpData( const ScDetOpData& rData ) :\n aPos(rData.aPos), eOperation(rData.eOperation) {}\n\n const ScAddress& GetPos() const { return aPos; }\n ScDetOpType GetOperation() const { return eOperation; }\n\n \/\/ fuer UpdateRef:\n void SetPos(const ScAddress& rNew) { aPos=rNew; }\n\n int operator== ( const ScDetOpData& r ) const\n { return eOperation == r.eOperation && aPos == r.aPos; }\n};\n\n\/\/------------------------------------------------------------------------\n\n\/\/\n\/\/ Liste der Operationen\n\/\/\n\ntypedef ScDetOpData* ScDetOpDataPtr;\n\nSV_DECL_PTRARR_DEL(ScDetOpArr_Impl, ScDetOpDataPtr, SC_DETOP_GROW, SC_DETOP_GROW);\n\nclass ScDetOpList : public ScDetOpArr_Impl\n{\n BOOL bHasAddError; \/\/ updated in Append\n\npublic:\n ScDetOpList() : bHasAddError(FALSE) {}\n ScDetOpList(const ScDetOpList& rList);\n ~ScDetOpList() {}\n\n void UpdateReference( ScDocument* pDoc, UpdateRefMode eUpdateRefMode,\n const ScRange& rRange, SCsCOL nDx, SCsROW nDy, SCsTAB nDz );\n\n BOOL operator==( const ScDetOpList& r ) const; \/\/ fuer Ref-Undo\n\n void Append( ScDetOpData* pData );\n\n void Load( SvStream& rStream );\n void Store( SvStream& rStream ) const;\n\n BOOL HasAddError() const { return bHasAddError; }\n};\n\n\n\n#endif\n<|endoftext|>"} {"text":"<commit_before>\/\/ Copyright 2018 The Clspv 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 <climits>\n#include <map>\n#include <set>\n#include <utility>\n#include <vector>\n\n#include \"llvm\/ADT\/DenseMap.h\"\n#include \"llvm\/ADT\/SmallVector.h\"\n#include \"llvm\/ADT\/UniqueVector.h\"\n#include \"llvm\/IR\/Constants.h\"\n#include \"llvm\/IR\/DerivedTypes.h\"\n#include \"llvm\/IR\/Function.h\"\n#include \"llvm\/IR\/IRBuilder.h\"\n#include \"llvm\/IR\/Instructions.h\"\n#include \"llvm\/IR\/Module.h\"\n#include \"llvm\/Pass.h\"\n#include \"llvm\/Support\/CommandLine.h\"\n#include \"llvm\/Support\/raw_ostream.h\"\n\n#include \"clspv\/Option.h\"\n\n#include \"ArgKind.h\"\n#include \"Builtins.h\"\n#include \"CallGraphOrderedFunctions.h\"\n#include \"Constants.h\"\n#include \"DirectResourceAccessPass.h\"\n\nusing namespace llvm;\n\n#define DEBUG_TYPE \"directresourceaccess\"\n\nnamespace {\n\ncl::opt<bool> ShowDRA(\"show-dra\", cl::init(false), cl::Hidden,\n cl::desc(\"Show direct resource access details\"));\n\n} \/\/ namespace\n\nPreservedAnalyses\nclspv::DirectResourceAccessPass::run(Module &M, ModuleAnalysisManager &) {\n PreservedAnalyses PA;\n\n if (clspv::Option::DirectResourceAccess()) {\n auto ordered_functions = clspv::CallGraphOrderedFunctions(M);\n if (ShowDRA) {\n outs() << \"DRA: Ordered functions:\\n\";\n for (Function *fun : ordered_functions) {\n outs() << \"DRA: \" << fun->getName() << \"\\n\";\n }\n }\n\n for (auto *fn : ordered_functions) {\n RewriteResourceAccesses(fn);\n }\n }\n\n return PA;\n}\n\nbool clspv::DirectResourceAccessPass::RewriteResourceAccesses(Function *fn) {\n bool Changed = false;\n int arg_index = 0;\n for (Argument &arg : fn->args()) {\n switch (clspv::GetArgKind(arg)) {\n case clspv::ArgKind::Buffer:\n case clspv::ArgKind::BufferUBO:\n case clspv::ArgKind::SampledImage:\n case clspv::ArgKind::StorageImage:\n case clspv::ArgKind::Sampler:\n case clspv::ArgKind::Local:\n Changed |= RewriteAccessesForArg(fn, arg_index, arg);\n break;\n default:\n \/\/ Should not happen\n break;\n }\n arg_index++;\n }\n return Changed;\n}\n\nbool clspv::DirectResourceAccessPass::RewriteAccessesForArg(Function *fn,\n int arg_index,\n Argument &arg) {\n bool Changed = false;\n if (fn->use_empty()) {\n return false;\n }\n\n \/\/ We can convert a parameter to a direct resource access if it is\n \/\/ either a direct call to a clspv.resource.var.* or if it a GEP of\n \/\/ such a thing (where the GEP can only have zero indices).\n struct ParamInfo {\n \/\/ The base value. It is either a global variable or a resource-access\n \/\/ builtin function. (@clspv.resource.var.* or @clspv.local.var.*)\n Value *base;\n \/\/ The descriptor set.\n uint32_t set;\n \/\/ The binding.\n uint32_t binding;\n \/\/ If the parameter is a GEP, then this is the number of zero-indices\n \/\/ the GEP used.\n unsigned num_gep_zeroes;\n \/\/ An example call fitting\n CallInst *sample_call;\n };\n \/\/ The common valid parameter info across all the callers seen soo far.\n\n bool seen_one = false;\n ParamInfo common;\n \/\/ Tries to merge the given parameter info into |common|. If it is the first\n \/\/ time we've tried, then save it. Returns true if there is no conflict.\n auto merge_param_info = [&seen_one, &common](const ParamInfo &pi) {\n if (!seen_one) {\n common = pi;\n seen_one = true;\n return true;\n }\n return pi.base == common.base && pi.set == common.set &&\n pi.binding == common.binding &&\n pi.num_gep_zeroes == common.num_gep_zeroes;\n };\n\n for (auto &use : fn->uses()) {\n if (auto *caller = dyn_cast<CallInst>(use.getUser())) {\n Value *value = caller->getArgOperand(arg_index);\n \/\/ We care about two cases:\n \/\/ - a direct call to clspv.resource.var.*\n \/\/ - a GEP with only zero indices, where the base pointer is\n\n \/\/ Unpack GEPs with zeros, if we can. Rewrite |value| as we go along.\n unsigned num_gep_zeroes = 0;\n bool first_gep = true;\n for (auto *gep = dyn_cast<GetElementPtrInst>(value); gep;\n gep = dyn_cast<GetElementPtrInst>(value)) {\n if (!gep->hasAllZeroIndices()) {\n return false;\n }\n \/\/ If not the first GEP, then ignore the \"element\" index (which I call\n \/\/ \"slide\") since that will be combined with the last index of the\n \/\/ previous GEP.\n num_gep_zeroes += gep->getNumIndices() + (first_gep ? 0 : -1);\n value = gep->getPointerOperand();\n first_gep = false;\n }\n if (auto *call = dyn_cast<CallInst>(value)) {\n \/\/ If the call is a call to a @clspv.resource.var.* function, then try\n \/\/ to merge it, assuming the given number of GEP zero-indices so far.\n auto *callee = call->getCalledFunction();\n auto &func_info = clspv::Builtins::Lookup(callee);\n if (func_info.getType() == clspv::Builtins::kClspvResource) {\n const auto set = uint32_t(\n dyn_cast<ConstantInt>(call->getOperand(0))->getZExtValue());\n const auto binding = uint32_t(\n dyn_cast<ConstantInt>(call->getOperand(1))->getZExtValue());\n if (!merge_param_info({callee, set, binding, num_gep_zeroes, call}))\n return false;\n } else if (func_info.getType() == clspv::Builtins::kClspvLocal) {\n const uint32_t spec_id = uint32_t(\n dyn_cast<ConstantInt>(call->getOperand(0))->getZExtValue());\n if (!merge_param_info({callee, spec_id, 0, num_gep_zeroes, call}))\n return false;\n } else {\n \/\/ A call but not to a resource access builtin function.\n return false;\n }\n } else if (isa<GlobalValue>(value)) {\n if (!merge_param_info({value, 0, 0, num_gep_zeroes, nullptr}))\n return false;\n } else {\n \/\/ Not a call.\n return false;\n }\n } else {\n \/\/ There isn't enough commonality. Bail out without changing anything.\n return false;\n }\n }\n if (ShowDRA) {\n if (seen_one) {\n outs() << \"DRA: Rewrite \" << fn->getName() << \" arg \" << arg_index << \" \"\n << arg.getName() << \": \" << common.base->getName() << \" (\"\n << common.set << \",\" << common.binding\n << \") zeroes: \" << common.num_gep_zeroes << \" sample-call \";\n if (common.sample_call)\n outs() << *common.sample_call << \"\\n\";\n else\n outs() << \"nullptr\\n\";\n }\n }\n\n \/\/ Now rewrite the argument, using the info in |common|.\n\n Changed = true;\n IRBuilder<> Builder(fn->getParent()->getContext());\n auto *zero = Builder.getInt32(0);\n Builder.SetInsertPoint(fn->getEntryBlock().getFirstNonPHI());\n\n Value *replacement = common.base;\n if (Function *function = dyn_cast<Function>(replacement)) {\n \/\/ Create the call.\n SmallVector<Value *, 8> args(common.sample_call->arg_begin(),\n common.sample_call->arg_end());\n replacement = Builder.CreateCall(function, args);\n if (ShowDRA) {\n outs() << \"DRA: Replace: call \" << *replacement << \"\\n\";\n }\n }\n if (common.num_gep_zeroes) {\n SmallVector<Value *, 3> zeroes;\n for (unsigned i = 0; i < common.num_gep_zeroes; i++) {\n zeroes.push_back(zero);\n }\n \/\/ Builder.CreateGEP is not used to avoid creating a GEPConstantExpr in the\n \/\/ case of global variables.\n replacement = GetElementPtrInst::Create(\n replacement->getType()->getPointerElementType(), replacement, zeroes);\n Builder.Insert(cast<Instruction>(replacement));\n if (ShowDRA) {\n outs() << \"DRA: Replace: gep \" << *replacement << \"\\n\";\n }\n }\n arg.replaceAllUsesWith(replacement);\n\n return Changed;\n}\n<commit_msg>DRA: document what happens for other arg kinds (#861)<commit_after>\/\/ Copyright 2018 The Clspv 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 <climits>\n#include <map>\n#include <set>\n#include <utility>\n#include <vector>\n\n#include \"llvm\/ADT\/DenseMap.h\"\n#include \"llvm\/ADT\/SmallVector.h\"\n#include \"llvm\/ADT\/UniqueVector.h\"\n#include \"llvm\/IR\/Constants.h\"\n#include \"llvm\/IR\/DerivedTypes.h\"\n#include \"llvm\/IR\/Function.h\"\n#include \"llvm\/IR\/IRBuilder.h\"\n#include \"llvm\/IR\/Instructions.h\"\n#include \"llvm\/IR\/Module.h\"\n#include \"llvm\/Pass.h\"\n#include \"llvm\/Support\/CommandLine.h\"\n#include \"llvm\/Support\/raw_ostream.h\"\n\n#include \"clspv\/Option.h\"\n\n#include \"ArgKind.h\"\n#include \"Builtins.h\"\n#include \"CallGraphOrderedFunctions.h\"\n#include \"Constants.h\"\n#include \"DirectResourceAccessPass.h\"\n\nusing namespace llvm;\n\n#define DEBUG_TYPE \"directresourceaccess\"\n\nnamespace {\n\ncl::opt<bool> ShowDRA(\"show-dra\", cl::init(false), cl::Hidden,\n cl::desc(\"Show direct resource access details\"));\n\n} \/\/ namespace\n\nPreservedAnalyses\nclspv::DirectResourceAccessPass::run(Module &M, ModuleAnalysisManager &) {\n PreservedAnalyses PA;\n\n if (clspv::Option::DirectResourceAccess()) {\n auto ordered_functions = clspv::CallGraphOrderedFunctions(M);\n if (ShowDRA) {\n outs() << \"DRA: Ordered functions:\\n\";\n for (Function *fun : ordered_functions) {\n outs() << \"DRA: \" << fun->getName() << \"\\n\";\n }\n }\n\n for (auto *fn : ordered_functions) {\n RewriteResourceAccesses(fn);\n }\n }\n\n return PA;\n}\n\nbool clspv::DirectResourceAccessPass::RewriteResourceAccesses(Function *fn) {\n bool Changed = false;\n int arg_index = 0;\n for (Argument &arg : fn->args()) {\n switch (clspv::GetArgKind(arg)) {\n case clspv::ArgKind::Buffer:\n case clspv::ArgKind::BufferUBO:\n case clspv::ArgKind::SampledImage:\n case clspv::ArgKind::StorageImage:\n case clspv::ArgKind::Sampler:\n case clspv::ArgKind::Local:\n Changed |= RewriteAccessesForArg(fn, arg_index, arg);\n break;\n case clspv::ArgKind::Pod:\n case clspv::ArgKind::PodUBO:\n case clspv::ArgKind::PodPushConstant:\n \/\/ These are represented by structs. Don't rewrite them.\n break;\n default:\n errs() << \"Unhandled ArgKind in \"\n \"clspv::DirectResourceAccessPass::RewriteResourceAccesses: \"\n << int(clspv::GetArgKind(arg)) << \"\\n\";\n llvm_unreachable(\n \"Unhandled ArgKind in \"\n \"clspv::DirectResourceAccessPass::RewriteResourceAccesses\");\n break;\n }\n arg_index++;\n }\n return Changed;\n}\n\nbool clspv::DirectResourceAccessPass::RewriteAccessesForArg(Function *fn,\n int arg_index,\n Argument &arg) {\n bool Changed = false;\n if (fn->use_empty()) {\n return false;\n }\n\n \/\/ We can convert a parameter to a direct resource access if it is\n \/\/ either a direct call to a clspv.resource.var.* or if it a GEP of\n \/\/ such a thing (where the GEP can only have zero indices).\n struct ParamInfo {\n \/\/ The base value. It is either a global variable or a resource-access\n \/\/ builtin function. (@clspv.resource.var.* or @clspv.local.var.*)\n Value *base;\n \/\/ The descriptor set.\n uint32_t set;\n \/\/ The binding.\n uint32_t binding;\n \/\/ If the parameter is a GEP, then this is the number of zero-indices\n \/\/ the GEP used.\n unsigned num_gep_zeroes;\n \/\/ An example call fitting\n CallInst *sample_call;\n };\n \/\/ The common valid parameter info across all the callers seen soo far.\n\n bool seen_one = false;\n ParamInfo common;\n \/\/ Tries to merge the given parameter info into |common|. If it is the first\n \/\/ time we've tried, then save it. Returns true if there is no conflict.\n auto merge_param_info = [&seen_one, &common](const ParamInfo &pi) {\n if (!seen_one) {\n common = pi;\n seen_one = true;\n return true;\n }\n return pi.base == common.base && pi.set == common.set &&\n pi.binding == common.binding &&\n pi.num_gep_zeroes == common.num_gep_zeroes;\n };\n\n for (auto &use : fn->uses()) {\n if (auto *caller = dyn_cast<CallInst>(use.getUser())) {\n Value *value = caller->getArgOperand(arg_index);\n \/\/ We care about two cases:\n \/\/ - a direct call to clspv.resource.var.*\n \/\/ - a GEP with only zero indices, where the base pointer is\n\n \/\/ Unpack GEPs with zeros, if we can. Rewrite |value| as we go along.\n unsigned num_gep_zeroes = 0;\n bool first_gep = true;\n for (auto *gep = dyn_cast<GetElementPtrInst>(value); gep;\n gep = dyn_cast<GetElementPtrInst>(value)) {\n if (!gep->hasAllZeroIndices()) {\n return false;\n }\n \/\/ If not the first GEP, then ignore the \"element\" index (which I call\n \/\/ \"slide\") since that will be combined with the last index of the\n \/\/ previous GEP.\n num_gep_zeroes += gep->getNumIndices() + (first_gep ? 0 : -1);\n value = gep->getPointerOperand();\n first_gep = false;\n }\n if (auto *call = dyn_cast<CallInst>(value)) {\n \/\/ If the call is a call to a @clspv.resource.var.* function, then try\n \/\/ to merge it, assuming the given number of GEP zero-indices so far.\n auto *callee = call->getCalledFunction();\n auto &func_info = clspv::Builtins::Lookup(callee);\n if (func_info.getType() == clspv::Builtins::kClspvResource) {\n const auto set = uint32_t(\n dyn_cast<ConstantInt>(call->getOperand(0))->getZExtValue());\n const auto binding = uint32_t(\n dyn_cast<ConstantInt>(call->getOperand(1))->getZExtValue());\n if (!merge_param_info({callee, set, binding, num_gep_zeroes, call}))\n return false;\n } else if (func_info.getType() == clspv::Builtins::kClspvLocal) {\n const uint32_t spec_id = uint32_t(\n dyn_cast<ConstantInt>(call->getOperand(0))->getZExtValue());\n if (!merge_param_info({callee, spec_id, 0, num_gep_zeroes, call}))\n return false;\n } else {\n \/\/ A call but not to a resource access builtin function.\n return false;\n }\n } else if (isa<GlobalValue>(value)) {\n if (!merge_param_info({value, 0, 0, num_gep_zeroes, nullptr}))\n return false;\n } else {\n \/\/ Not a call.\n return false;\n }\n } else {\n \/\/ There isn't enough commonality. Bail out without changing anything.\n return false;\n }\n }\n if (ShowDRA) {\n if (seen_one) {\n outs() << \"DRA: Rewrite \" << fn->getName() << \" arg \" << arg_index << \" \"\n << arg.getName() << \": \" << common.base->getName() << \" (\"\n << common.set << \",\" << common.binding\n << \") zeroes: \" << common.num_gep_zeroes << \" sample-call \";\n if (common.sample_call)\n outs() << *common.sample_call << \"\\n\";\n else\n outs() << \"nullptr\\n\";\n }\n }\n\n \/\/ Now rewrite the argument, using the info in |common|.\n\n Changed = true;\n IRBuilder<> Builder(fn->getParent()->getContext());\n auto *zero = Builder.getInt32(0);\n Builder.SetInsertPoint(fn->getEntryBlock().getFirstNonPHI());\n\n Value *replacement = common.base;\n if (Function *function = dyn_cast<Function>(replacement)) {\n \/\/ Create the call.\n SmallVector<Value *, 8> args(common.sample_call->arg_begin(),\n common.sample_call->arg_end());\n replacement = Builder.CreateCall(function, args);\n if (ShowDRA) {\n outs() << \"DRA: Replace: call \" << *replacement << \"\\n\";\n }\n }\n if (common.num_gep_zeroes) {\n SmallVector<Value *, 3> zeroes;\n for (unsigned i = 0; i < common.num_gep_zeroes; i++) {\n zeroes.push_back(zero);\n }\n \/\/ Builder.CreateGEP is not used to avoid creating a GEPConstantExpr in the\n \/\/ case of global variables.\n replacement = GetElementPtrInst::Create(\n replacement->getType()->getPointerElementType(), replacement, zeroes);\n Builder.Insert(cast<Instruction>(replacement));\n if (ShowDRA) {\n outs() << \"DRA: Replace: gep \" << *replacement << \"\\n\";\n }\n }\n arg.replaceAllUsesWith(replacement);\n\n return Changed;\n}\n<|endoftext|>"} {"text":"<commit_before>#include \"scoretabwidget.hpp\"\n\n#include <QComboBox>\n#include <QString>\n#include <QFile>\n#include <QTextStream>\n#include <QSet>\n#include <QDebug>\n\n\/**\n* Constructeur\n* Crée un ScoreTabWidget\n* @param parent Widget parent\n*\/\nScoreTabWidget::ScoreTabWidget(QWidget *parent) : QWidget(parent) {\n playerNameLabel__.setParent(this);\n playerNameLabel__.setText(QString(\"Filtrer les résultats pour le joueur:\"));\n playerName__.setParent(this);\n scoreTree__.setParent(this);\n scoreWatcher__.setParent(this);\n scoreWatcher__.addPath(QString(\"score.csv\"));\n\n scoreChanged__(QString());\n\n connect(&playerName__, SIGNAL(currentTextChanged(const QString &)), this,\n SLOT(playerNameChanged__(const QString &)));\n connect(&scoreWatcher__, SIGNAL(fileChanged(const QString &)), this,\n SLOT(scoreChanged__(const QString &)));\n\n layout__.addWidget(&playerNameLabel__);\n layout__.addWidget(&playerName__);\n layout__.addWidget(&scoreTree__);\n\n setLayout(&layout__);\n}\n\nScoreTabWidget::~ScoreTabWidget() {\n QTreeWidgetItem *item;\n QVectorIterator<QTreeWidgetItem *> itemIt(items__);\n while (itemIt.hasNext()) {\n item = itemIt.next();\n delete item;\n }\n}\n\nvoid ScoreTabWidget::scoreChanged__(const QString &file) {\n playerName__.setDisabled(true);\n\n playerName__.clear();\n scores__.clear();\n\n QSet<QString> players;\n QFile scoreFile(QString(\"score.csv\"));\n if (scoreFile.open(QIODevice::ReadOnly | QIODevice::Text)) {\n QTextStream in(&scoreFile);\n while (!in.atEnd()) {\n QString line = in.readLine();\n QStringList lineSplit = line.split(QChar(';'));\n if (lineSplit.size() >= 5) {\n scores__.append(lineSplit);\n players.insert(lineSplit.at(0));\n }\n }\n }\n\n playerName__.addItem(QString());\n for (QSet<QString>::const_iterator it = players.constBegin();\n it != players.constEnd(); it++) {\n playerName__.addItem(*it);\n }\n\n playerName__.setEnabled(true);\n\n playerNameChanged__(QString());\n}\n\nvoid ScoreTabWidget::playerNameChanged__(const QString &text) {\n qInfo(\"player name combo box changed\");\n\n scoreTree__.setDisabled(true);\n\n QTreeWidgetItem *item;\n QVectorIterator<QTreeWidgetItem *> itemIt(items__);\n while (itemIt.hasNext()) {\n item = itemIt.next();\n delete item;\n }\n items__.clear();\n scoreTree__.clear();\n\n QStringList headerLabels;\n headerLabels.append(QString(\"Nom\"));\n headerLabels.append(QString(\"Date\"));\n headerLabels.append(QString(\"Partition\"));\n headerLabels.append(QString(\"Score\"));\n scoreTree__.setColumnCount(4);\n scoreTree__.setHeaderLabels(headerLabels);\n\n for (int i = 0; i < scores__.size(); ++i) {\n if (text.isEmpty() || text == scores__.at(i).at(0)) {\n item = new QTreeWidgetItem(&scoreTree__);\n item->setText(0, scores__.at(i).at(0));\n item->setText(1, scores__.at(i).at(1));\n item->setText(2, scores__.at(i).at(2));\n item->setText(3,\n scores__.at(i).at(3) + QString(\"\/\") + scores__.at(i).at(4));\n items__.append(item);\n scoreTree__.addTopLevelItem(item);\n }\n }\n\n for (int i = 0; i < 4; i++) {\n scoreTree__.resizeColumnToContents(i);\n }\n\n scoreTree__.setEnabled(true);\n}\n<commit_msg>c'est pas mal<commit_after>#include \"scoretabwidget.hpp\"\n\n#include <QComboBox>\n#include <QString>\n#include <QFile>\n#include <QTextStream>\n#include <QSet>\n#include <QDebug>\n\n\/**\n* Constructeur\n* Crée un ScoreTabWidget\n* @param parent Widget parent\n*\/\nScoreTabWidget::ScoreTabWidget(QWidget *parent) : QWidget(parent) {\n playerNameLabel__.setParent(this);\n playerNameLabel__.setText(QString(\"Filtrer les résultats pour le joueur:\"));\n playerName__.setParent(this);\n scoreTree__.setParent(this);\n\n QFile scoreFile(QString(\"score.csv\"));\n if (!scoreFile.exists()) {\n scoreFile.open(QIODevice::WriteOnly);\n scoreFile.close();\n }\n scoreWatcher__.setParent(this);\n scoreWatcher__.addPath(QString(\"score.csv\"));\n\n scoreChanged__(QString());\n\n connect(&playerName__, SIGNAL(currentTextChanged(const QString &)), this,\n SLOT(playerNameChanged__(const QString &)));\n connect(&scoreWatcher__, SIGNAL(fileChanged(const QString &)), this,\n SLOT(scoreChanged__(const QString &)));\n\n layout__.addWidget(&playerNameLabel__);\n layout__.addWidget(&playerName__);\n layout__.addWidget(&scoreTree__);\n\n setLayout(&layout__);\n}\n\nScoreTabWidget::~ScoreTabWidget() {\n QTreeWidgetItem *item;\n QVectorIterator<QTreeWidgetItem *> itemIt(items__);\n while (itemIt.hasNext()) {\n item = itemIt.next();\n delete item;\n }\n}\n\nvoid ScoreTabWidget::scoreChanged__(const QString &file) {\n playerName__.setDisabled(true);\n\n playerName__.clear();\n scores__.clear();\n\n QSet<QString> players;\n QFile scoreFile(QString(\"score.csv\"));\n if (scoreFile.open(QIODevice::ReadOnly | QIODevice::Text)) {\n QTextStream in(&scoreFile);\n while (!in.atEnd()) {\n QString line = in.readLine();\n QStringList lineSplit = line.split(QChar(';'));\n if (lineSplit.size() >= 5) {\n scores__.append(lineSplit);\n players.insert(lineSplit.at(0));\n }\n }\n }\n\n playerName__.addItem(QString());\n for (QSet<QString>::const_iterator it = players.constBegin();\n it != players.constEnd(); it++) {\n playerName__.addItem(*it);\n }\n\n playerName__.setEnabled(true);\n\n playerNameChanged__(QString());\n}\n\nvoid ScoreTabWidget::playerNameChanged__(const QString &text) {\n qInfo(\"player name combo box changed\");\n\n scoreTree__.setDisabled(true);\n\n QTreeWidgetItem *item;\n QVectorIterator<QTreeWidgetItem *> itemIt(items__);\n while (itemIt.hasNext()) {\n item = itemIt.next();\n delete item;\n }\n items__.clear();\n scoreTree__.clear();\n\n QStringList headerLabels;\n headerLabels.append(QString(\"Nom\"));\n headerLabels.append(QString(\"Date\"));\n headerLabels.append(QString(\"Partition\"));\n headerLabels.append(QString(\"Score\"));\n scoreTree__.setColumnCount(4);\n scoreTree__.setHeaderLabels(headerLabels);\n\n for (int i = 0; i < scores__.size(); ++i) {\n if (text.isEmpty() || text == scores__.at(i).at(0)) {\n item = new QTreeWidgetItem(&scoreTree__);\n item->setText(0, scores__.at(i).at(0));\n item->setText(1, scores__.at(i).at(1));\n item->setText(2, scores__.at(i).at(2));\n item->setText(3,\n scores__.at(i).at(3) + QString(\"\/\") + scores__.at(i).at(4));\n items__.append(item);\n scoreTree__.addTopLevelItem(item);\n }\n }\n\n for (int i = 0; i < 4; i++) {\n scoreTree__.resizeColumnToContents(i);\n }\n\n scoreTree__.setEnabled(true);\n}\n<|endoftext|>"} {"text":"<commit_before>\/* BEGIN_COMMON_COPYRIGHT_HEADER\n * (c)LGPL2+\n *\n * LXDE-Qt - a lightweight, Qt based, desktop toolset\n *\n * Authors:\n * Christian Surlykke <christian@surlykke.dk>\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 <QComboBox>\n\n#include <LXQt\/Power>\n\n#include \"helpers.h\"\n\nvoid fillComboBox(QComboBox* comboBox)\n{\n comboBox->clear();\n comboBox->addItem(QObject::tr(\"Nothing\"), -1);\n comboBox->addItem(QObject::tr(\"Lock screen\"), -2); \/\/ FIXME\n comboBox->addItem(QObject::tr(\"Suspend\"), LXQt::Power::PowerSuspend);\n comboBox->addItem(QObject::tr(\"Hibernate\"), LXQt::Power::PowerHibernate);\n comboBox->addItem(QObject::tr(\"Shutdown\"), LXQt::Power::PowerShutdown);\n}\n\nvoid setComboBoxToValue(QComboBox* comboBox, int value)\n{\n for (int index = 0; index < comboBox->count(); index++)\n {\n if (value == comboBox->itemData(index).toInt())\n {\n comboBox->setCurrentIndex(index);\n return;\n }\n }\n\n comboBox->setCurrentIndex(0);\n}\n\nint currentValue(QComboBox *comboBox)\n{\n return comboBox->itemData(comboBox->currentIndex()).toInt();\n}\n\n<commit_msg>Add support for turning monitor(s) off<commit_after>\/* BEGIN_COMMON_COPYRIGHT_HEADER\n * (c)LGPL2+\n *\n * LXDE-Qt - a lightweight, Qt based, desktop toolset\n *\n * Authors:\n * Christian Surlykke <christian@surlykke.dk>\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 <QComboBox>\n\n#include <LXQt\/Power>\n\n#include \"helpers.h\"\n\nvoid fillComboBox(QComboBox* comboBox)\n{\n comboBox->clear();\n comboBox->addItem(QObject::tr(\"Nothing\"), -1);\n comboBox->addItem(QObject::tr(\"Lock screen\"), -2); \/\/ FIXME\n comboBox->addItem(QObject::tr(\"Suspend\"), LXQt::Power::PowerSuspend);\n comboBox->addItem(QObject::tr(\"Hibernate\"), LXQt::Power::PowerHibernate);\n comboBox->addItem(QObject::tr(\"Shutdown\"), LXQt::Power::PowerShutdown);\n comboBox->addItem(QObject::tr(\"Turn Off monitor(s)\"), LXQt::Power::PowerMonitorOff);\n}\n\nvoid setComboBoxToValue(QComboBox* comboBox, int value)\n{\n for (int index = 0; index < comboBox->count(); index++)\n {\n if (value == comboBox->itemData(index).toInt())\n {\n comboBox->setCurrentIndex(index);\n return;\n }\n }\n\n comboBox->setCurrentIndex(0);\n}\n\nint currentValue(QComboBox *comboBox)\n{\n return comboBox->itemData(comboBox->currentIndex()).toInt();\n}\n\n<|endoftext|>"} {"text":"<commit_before>\/\/ This file is a part of the IncludeOS unikernel - www.includeos.org\n\/\/\n\/\/ Copyright 2015-2016 Oslo and Akershus University College of Applied Sciences\n\/\/ and Alfred Bratterud\n\/\/\n\/\/ Licensed under the Apache License, Version 2.0 (the \"License\");\n\/\/ you may not use this file except in compliance with the License.\n\/\/ You may obtain a copy of the License at\n\/\/\n\/\/ http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n\/\/\n\/\/ Unless required by applicable law or agreed to in writing, software\n\/\/ distributed under the License is distributed on an \"AS IS\" BASIS,\n\/\/ WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n\/\/ See the License for the specific language governing permissions and\n\/\/ limitations under the License.\n#pragma once\n\n#ifndef UTIL_TIMER_HPP\n#define UTIL_TIMER_HPP\n\n#include <timers>\n\n\/**\n * @brief A start- and stoppable timer\n * @details A timer which can be started, stopped and restarted.\n * Uses the underlying Timers interface.\n *\n *\/\nclass Timer {\npublic:\n using id_t = Timers::id_t;\n using duration_t = Timers::duration_t;\n using handler_t = Timers::handler_t;\n\n \/**\n * @brief Constructs a Timer without a handler\n *\/\n Timer() : Timer({this, &Timer::_do_nothing}) {}\n\n \/**\n * @brief Constructs a Timer with a handler\n *\n * @param on_timeout function to be executed on timeout\n *\/\n Timer(handler_t on_timeout)\n : on_timeout_{on_timeout}, running_{false} {}\n\n \/**\n * @brief Start the timer with a timeout duration\n * @details Starts the timer (if not already running)\n * and stores the current timer id returned by the underlying Timers.\n *\n * Requires on_timeout to be set.\n *\n * @param duration until timing out\n *\/\n inline void start(duration_t);\n\n \/**\n * @brief Stops the timer\n * @details Stops the timer (if running) by\n * calling stop with the current id to the underlying Timers.\n *\/\n inline void stop();\n\n \/**\n * @brief Restart the timer\n * @details First stops the timer (if running)\n * and then starts the timer with a new refreshed duration.\n *\n * @param duration until timing out\n *\/\n inline void restart(duration_t);\n\n \/**\n * @brief Sets the on timeout handler\n * @details Sets what to be done when the timer times out.\n *\n * @param on_timeout a timeout handler\n *\/\n void set_on_timeout(handler_t on_timeout)\n { on_timeout_ = on_timeout; }\n\n \/**\n * @brief If the timer is running (active)\n *\n * @return Wether the timer is running or not\n *\/\n bool is_running() const\n { return running_; }\n\n \/**\n * @brief Destroys the Timer\n * @details Makes sure to stop any eventual underlying Timer\n * if its running.\n *\/\n ~Timer()\n { stop(); }\n\n \/** Delete copy and move *\/\n Timer(const Timer&) = delete;\n Timer(Timer&&) = delete;\n Timer& operator=(const Timer&) = delete;\n Timer& operator=(Timer&&) = delete;\n\nprivate:\n \/** ID for the running timer. *\/\n Timers::id_t id_;\n \/** Function to execute on timeout *\/\n handler_t on_timeout_;\n \/** Wether the timer is running or not *\/\n bool running_;\n\n \/**\n * @brief Sets the timer to inactive before calling the user callback\n * @details Wraps the on timeout handler, setting the timer to not running\n * before calling the timeout handler.\n * This is the delegate being sent to the underlying Timers interface\n *\n * @param id the timer id returned by the Timers interface\n *\/\n inline void _internal_timeout(id_t id);\n\n void _do_nothing(id_t) {}\n\n} __attribute__((packed)); \/\/ < class Timer\n\ninline void Timer::start(duration_t when) {\n if(!running_) {\n id_ = Timers::oneshot(when, {this, &Timer::_internal_timeout});\n running_ = true;\n }\n}\n\ninline void Timer::stop() {\n if(running_) {\n Timers::stop(id_);\n running_ = false;\n }\n}\n\ninline void Timer::restart(duration_t when) {\n stop();\n start(when);\n}\n\ninline void Timer::_internal_timeout(id_t id) {\n running_ = false;\n on_timeout_(id);\n}\n\n#endif\n<commit_msg>util: Timer running is now instead decided by id 43a6d6f<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#pragma once\n\n#ifndef UTIL_TIMER_HPP\n#define UTIL_TIMER_HPP\n\n#include <timers>\n\n\/**\n * @brief A start- and stoppable timer\n * @details A timer which can be started, stopped and restarted.\n * Uses the underlying Timers interface.\n *\n *\/\nclass Timer {\npublic:\n using id_t = Timers::id_t;\n using duration_t = Timers::duration_t;\n using handler_t = Timers::handler_t;\n\n \/**\n * @brief Constructs a Timer without a handler\n *\/\n Timer() : Timer({this, &Timer::_do_nothing}) {}\n\n \/**\n * @brief Constructs a Timer with a handler\n *\n * @param on_timeout function to be executed on timeout\n *\/\n Timer(handler_t on_timeout)\n : id_{Timers::UNUSED_ID},\n on_timeout_{on_timeout}\n {}\n\n \/**\n * @brief Start the timer with a timeout duration\n * @details Starts the timer (if not already running)\n * and stores the current timer id returned by the underlying Timers.\n *\n * Requires on_timeout to be set.\n *\n * @param duration until timing out\n *\/\n inline void start(duration_t);\n\n \/**\n * @brief Stops the timer\n * @details Stops the timer (if running) by\n * calling stop with the current id to the underlying Timers.\n *\/\n inline void stop();\n\n \/**\n * @brief Restart the timer\n * @details First stops the timer (if running)\n * and then starts the timer with a new refreshed duration.\n *\n * @param duration until timing out\n *\/\n inline void restart(duration_t);\n\n \/**\n * @brief Sets the on timeout handler\n * @details Sets what to be done when the timer times out.\n *\n * @param on_timeout a timeout handler\n *\/\n void set_on_timeout(handler_t on_timeout)\n { on_timeout_ = on_timeout; }\n\n \/**\n * @brief If the timer is running (active)\n *\n * @return Wether the timer is running or not\n *\/\n bool is_running() const\n { return id_ != Timers::UNUSED_ID; }\n\n \/**\n * @brief Destroys the Timer\n * @details Makes sure to stop any eventual underlying Timer\n * if its running.\n *\/\n ~Timer()\n { stop(); }\n\n \/** Delete copy and move *\/\n Timer(const Timer&) = delete;\n Timer(Timer&&) = delete;\n Timer& operator=(const Timer&) = delete;\n Timer& operator=(Timer&&) = delete;\n\nprivate:\n \/** ID for the running timer. *\/\n Timers::id_t id_;\n \/** Function to execute on timeout *\/\n handler_t on_timeout_;\n\n \/**\n * @brief Sets the timer to inactive before calling the user callback\n * @details Wraps the on timeout handler, setting the timer to not running\n * before calling the timeout handler.\n * This is the delegate being sent to the underlying Timers interface\n *\n * @param id the timer id returned by the Timers interface\n *\/\n inline void _internal_timeout(id_t id);\n\n void _do_nothing(id_t) {}\n\n} __attribute__((packed)); \/\/ < class Timer\n\ninline void Timer::start(duration_t when) {\n if(!is_running())\n {\n id_ = Timers::oneshot(when, {this, &Timer::_internal_timeout});\n }\n}\n\ninline void Timer::stop() {\n if(is_running())\n {\n Timers::stop(id_);\n id_ = Timers::UNUSED_ID;\n }\n}\n\ninline void Timer::restart(duration_t when) {\n stop();\n start(when);\n}\n\ninline void Timer::_internal_timeout(id_t id) {\n id_ = Timers::UNUSED_ID;\n on_timeout_(id);\n}\n\n#endif\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\/lib\/io\/format.h\"\n\n#include \"tensorflow\/core\/lib\/core\/coding.h\"\n#include \"tensorflow\/core\/lib\/core\/errors.h\"\n#include \"tensorflow\/core\/lib\/hash\/crc32c.h\"\n#include \"tensorflow\/core\/lib\/io\/block.h\"\n#include \"tensorflow\/core\/platform\/env.h\"\n#include \"tensorflow\/core\/platform\/snappy.h\"\n\nnamespace tensorflow {\nnamespace table {\n\nvoid BlockHandle::EncodeTo(string* dst) const {\n \/\/ Sanity check that all fields have been set\n assert(offset_ != ~static_cast<uint64>(0));\n assert(size_ != ~static_cast<uint64>(0));\n core::PutVarint64(dst, offset_);\n core::PutVarint64(dst, size_);\n}\n\nStatus BlockHandle::DecodeFrom(StringPiece* input) {\n if (core::GetVarint64(input, &offset_) && core::GetVarint64(input, &size_)) {\n return Status::OK();\n } else {\n return errors::DataLoss(\"bad block handle\");\n }\n}\n\nvoid Footer::EncodeTo(string* dst) const {\n#ifndef NDEBUG\n const size_t original_size = dst->size();\n#endif\n metaindex_handle_.EncodeTo(dst);\n index_handle_.EncodeTo(dst);\n dst->resize(2 * BlockHandle::kMaxEncodedLength); \/\/ Padding\n core::PutFixed32(dst, static_cast<uint32>(kTableMagicNumber & 0xffffffffu));\n core::PutFixed32(dst, static_cast<uint32>(kTableMagicNumber >> 32));\n assert(dst->size() == original_size + kEncodedLength);\n}\n\nStatus Footer::DecodeFrom(StringPiece* input) {\n const char* magic_ptr = input->data() + kEncodedLength - 8;\n const uint32 magic_lo = core::DecodeFixed32(magic_ptr);\n const uint32 magic_hi = core::DecodeFixed32(magic_ptr + 4);\n const uint64 magic =\n ((static_cast<uint64>(magic_hi) << 32) | (static_cast<uint64>(magic_lo)));\n if (magic != kTableMagicNumber) {\n return errors::DataLoss(\"not an sstable (bad magic number)\");\n }\n\n Status result = metaindex_handle_.DecodeFrom(input);\n if (result.ok()) {\n result = index_handle_.DecodeFrom(input);\n }\n if (result.ok()) {\n \/\/ We skip over any leftover data (just padding for now) in \"input\"\n const char* end = magic_ptr + 8;\n *input = StringPiece(end, input->data() + input->size() - end);\n }\n return result;\n}\n\nStatus ReadBlock(RandomAccessFile* file, const BlockHandle& handle,\n BlockContents* result) {\n result->data = StringPiece();\n result->cachable = false;\n result->heap_allocated = false;\n\n \/\/ Read the block contents as well as the type\/crc footer.\n \/\/ See table_builder.cc for the code that built this structure.\n size_t n = static_cast<size_t>(handle.size());\n char* buf = new char[n + kBlockTrailerSize];\n StringPiece contents;\n Status s = file->Read(handle.offset(), n + kBlockTrailerSize, &contents, buf);\n if (!s.ok()) {\n delete[] buf;\n return s;\n }\n if (contents.size() != n + kBlockTrailerSize) {\n delete[] buf;\n return errors::DataLoss(\"truncated block read\");\n }\n\n \/\/ Check the crc of the type and the block contents\n const char* data = contents.data(); \/\/ Pointer to where Read put the data\n \/\/ This checksum verification is optional. We leave it on for now\n const bool verify_checksum = true;\n if (verify_checksum) {\n const uint32 crc = crc32c::Unmask(core::DecodeFixed32(data + n + 1));\n const uint32 actual = crc32c::Value(data, n + 1);\n if (actual != crc) {\n delete[] buf;\n s = errors::DataLoss(\"block checksum mismatch\");\n return s;\n }\n }\n\n switch (data[n]) {\n case kNoCompression:\n if (data != buf) {\n \/\/ File implementation gave us pointer to some other data.\n \/\/ Use it directly under the assumption that it will be live\n \/\/ while the file is open.\n delete[] buf;\n result->data = StringPiece(data, n);\n result->heap_allocated = false;\n result->cachable = false; \/\/ Do not double-cache\n } else {\n result->data = StringPiece(buf, n);\n result->heap_allocated = true;\n result->cachable = true;\n }\n\n \/\/ Ok\n break;\n case kSnappyCompression: {\n size_t ulength = 0;\n if (!port::Snappy_GetUncompressedLength(data, n, &ulength)) {\n delete[] buf;\n return errors::DataLoss(\"corrupted compressed block contents\");\n }\n char* ubuf = new char[ulength];\n if (!port::Snappy_Uncompress(data, n, ubuf)) {\n delete[] buf;\n delete[] ubuf;\n return errors::DataLoss(\"corrupted compressed block contents\");\n }\n delete[] buf;\n result->data = StringPiece(ubuf, ulength);\n result->heap_allocated = true;\n result->cachable = true;\n break;\n }\n default:\n delete[] buf;\n return errors::DataLoss(\"bad block type\");\n }\n\n return Status::OK();\n}\n\n} \/\/ namespace table\n} \/\/ namespace tensorflow\n<commit_msg>Check that n + kBlockTrailerSize does not overflow before reading a block<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 <limits>\n\n#include \"tensorflow\/core\/lib\/io\/format.h\"\n\n#include \"tensorflow\/core\/lib\/core\/coding.h\"\n#include \"tensorflow\/core\/lib\/core\/errors.h\"\n#include \"tensorflow\/core\/lib\/hash\/crc32c.h\"\n#include \"tensorflow\/core\/lib\/io\/block.h\"\n#include \"tensorflow\/core\/platform\/env.h\"\n#include \"tensorflow\/core\/platform\/snappy.h\"\n\nnamespace tensorflow {\nnamespace table {\n\nvoid BlockHandle::EncodeTo(string* dst) const {\n \/\/ Sanity check that all fields have been set\n assert(offset_ != ~static_cast<uint64>(0));\n assert(size_ != ~static_cast<uint64>(0));\n core::PutVarint64(dst, offset_);\n core::PutVarint64(dst, size_);\n}\n\nStatus BlockHandle::DecodeFrom(StringPiece* input) {\n if (core::GetVarint64(input, &offset_) && core::GetVarint64(input, &size_)) {\n return Status::OK();\n } else {\n return errors::DataLoss(\"bad block handle\");\n }\n}\n\nvoid Footer::EncodeTo(string* dst) const {\n#ifndef NDEBUG\n const size_t original_size = dst->size();\n#endif\n metaindex_handle_.EncodeTo(dst);\n index_handle_.EncodeTo(dst);\n dst->resize(2 * BlockHandle::kMaxEncodedLength); \/\/ Padding\n core::PutFixed32(dst, static_cast<uint32>(kTableMagicNumber & 0xffffffffu));\n core::PutFixed32(dst, static_cast<uint32>(kTableMagicNumber >> 32));\n assert(dst->size() == original_size + kEncodedLength);\n}\n\nStatus Footer::DecodeFrom(StringPiece* input) {\n const char* magic_ptr = input->data() + kEncodedLength - 8;\n const uint32 magic_lo = core::DecodeFixed32(magic_ptr);\n const uint32 magic_hi = core::DecodeFixed32(magic_ptr + 4);\n const uint64 magic =\n ((static_cast<uint64>(magic_hi) << 32) | (static_cast<uint64>(magic_lo)));\n if (magic != kTableMagicNumber) {\n return errors::DataLoss(\"not an sstable (bad magic number)\");\n }\n\n Status result = metaindex_handle_.DecodeFrom(input);\n if (result.ok()) {\n result = index_handle_.DecodeFrom(input);\n }\n if (result.ok()) {\n \/\/ We skip over any leftover data (just padding for now) in \"input\"\n const char* end = magic_ptr + 8;\n *input = StringPiece(end, input->data() + input->size() - end);\n }\n return result;\n}\n\nStatus ReadBlock(RandomAccessFile* file, const BlockHandle& handle,\n BlockContents* result) {\n result->data = StringPiece();\n result->cachable = false;\n result->heap_allocated = false;\n\n \/\/ Read the block contents as well as the type\/crc footer.\n \/\/ See table_builder.cc for the code that built this structure.\n size_t n = static_cast<size_t>(handle.size());\n\n if (kBlockTrailerSize > std::numeric_limits<size_t>::max() - n) {\n return errors::DataLoss(\"handle.size() too big\");\n }\n\n char* buf = new char[n + kBlockTrailerSize];\n StringPiece contents;\n Status s = file->Read(handle.offset(), n + kBlockTrailerSize, &contents, buf);\n if (!s.ok()) {\n delete[] buf;\n return s;\n }\n if (contents.size() != n + kBlockTrailerSize) {\n delete[] buf;\n return errors::DataLoss(\"truncated block read\");\n }\n\n \/\/ Check the crc of the type and the block contents\n const char* data = contents.data(); \/\/ Pointer to where Read put the data\n \/\/ This checksum verification is optional. We leave it on for now\n const bool verify_checksum = true;\n if (verify_checksum) {\n const uint32 crc = crc32c::Unmask(core::DecodeFixed32(data + n + 1));\n const uint32 actual = crc32c::Value(data, n + 1);\n if (actual != crc) {\n delete[] buf;\n s = errors::DataLoss(\"block checksum mismatch\");\n return s;\n }\n }\n\n switch (data[n]) {\n case kNoCompression:\n if (data != buf) {\n \/\/ File implementation gave us pointer to some other data.\n \/\/ Use it directly under the assumption that it will be live\n \/\/ while the file is open.\n delete[] buf;\n result->data = StringPiece(data, n);\n result->heap_allocated = false;\n result->cachable = false; \/\/ Do not double-cache\n } else {\n result->data = StringPiece(buf, n);\n result->heap_allocated = true;\n result->cachable = true;\n }\n\n \/\/ Ok\n break;\n case kSnappyCompression: {\n size_t ulength = 0;\n if (!port::Snappy_GetUncompressedLength(data, n, &ulength)) {\n delete[] buf;\n return errors::DataLoss(\"corrupted compressed block contents\");\n }\n char* ubuf = new char[ulength];\n if (!port::Snappy_Uncompress(data, n, ubuf)) {\n delete[] buf;\n delete[] ubuf;\n return errors::DataLoss(\"corrupted compressed block contents\");\n }\n delete[] buf;\n result->data = StringPiece(ubuf, ulength);\n result->heap_allocated = true;\n result->cachable = true;\n break;\n }\n default:\n delete[] buf;\n return errors::DataLoss(\"bad block type\");\n }\n\n return Status::OK();\n}\n\n} \/\/ namespace table\n} \/\/ namespace tensorflow\n<|endoftext|>"} {"text":"<commit_before>\/*\n * ManagerResponsesHandler.cpp\n *\n * Created on: Jul 14, 2011\n * Author: augcampos\n *\/\n\n#include \"asteriskcpp\/manager\/ManagerResponsesHandler.h\"\n#include \"asteriskcpp\/utils\/LogHandler.h\"\n#include \"asteriskcpp\/utils\/StringUtils.h\"\n\n#define LOOP_INTERVAL 500\n\nnamespace asteriskcpp {\n\n ResponseCallBack::ResponseCallBack(ManagerAction* a, unsigned int tout)\n : isTimeout(false) {\n setAction(a);\n this->timeout = boost::get_system_time() + boost::posix_time::milliseconds(tout);\n }\n\n ResponseCallBack::~ResponseCallBack() {\n LOG_TRACE_STR(\"OUT\");\n }\n\n ASyncResponseCallBack::ASyncResponseCallBack(ManagerAction* a, unsigned int tout, responseCallbackFunction_t f) :\n ResponseCallBack(a, tout) {\n this->function = f;\n }\n\n ASyncResponseCallBack::~ASyncResponseCallBack() {\n LOG_TRACE_STR(\"IN\");\n delete this->action;\n LOG_TRACE_STR(\"OUT\");\n }\n\n void ASyncResponseCallBack::fireCallBack(ManagerResponse* mr) {\n LOG_TRACE_STR(\"ASyncResponseCallBack :\" + mr->toLog());\n if (this->function != NULL) {\n (this->function)(mr);\n }\n delete mr;\n LOG_TRACE_STR(\"OUT\");\n }\n\n SyncResponseCallBack::SyncResponseCallBack(ManagerAction* a, unsigned int timeOut) :\n ResponseCallBack(a, timeOut), response(NULL), isReady(false), isStollEnd(false) {\n }\n\n SyncResponseCallBack::~SyncResponseCallBack() {\n boost::unique_lock<boost::mutex> lock(this->m_mutex);\n this->m_cond.notify_all();\n if (this->isStollEnd == false) {\n this->m_cond.wait(lock);\n }\n LOG_TRACE_STR(\"OUT\");\n }\n\n ManagerResponse* SyncResponseCallBack::stoll() {\n boost::unique_lock<boost::mutex> lock(this->m_mutex);\n LOG_TRACE_STR(\"\");\n if (this->isReady == false) {\n this->m_cond.wait(lock);\n }\n ManagerResponse* mr = this->response;\n this->isStollEnd = true;\n this->m_cond.notify_all();\n LOG_TRACE_STR(\"OUT\");\n return response;\n }\n\n void SyncResponseCallBack::fireCallBack(ManagerResponse* mr) {\n boost::lock_guard<boost::mutex> lock(this->m_mutex);\n this->response = mr;\n LOG_TRACE_STR(\"SyncResponseCallBack : \" + (*mr).toLog());\n this->isReady = true;\n this->m_cond.notify_all();\n }\n\n ManagerAction *ResponseCallBack::getAction() const {\n return (this->action);\n }\n\n void ResponseCallBack::setAction(ManagerAction *action) {\n this->action = action;\n }\n\n void ResponseCallBack::fireTimeout() {\n std::string msg = \"Response: Error\\r\\nActionID: \" + this->action->getActionId() + \"\\r\\nMessage: Time Out\\r\\n\\r\\n\";\n ManagerResponse* rto = new ManagerResponse(msg);\n fireCallBack(rto);\n LOG_TRACE_STR(\"OUT\");\n }\n\n ManagerResponsesHandler::~ManagerResponsesHandler() {\n this->stop();\n }\n\n void ManagerResponsesHandler::addResponsetListener(const std::string& key, ResponseCallBack* bcb) {\n boost::lock_guard<boost::mutex> lock(this->m_mutex);\n LOG_TRACE_STR(\"ADD RESPONSE Listener \" + key + \"::\" + typeid (*bcb).name() + \"::\" + convertToString(bcb->timeout));\n const std::pair<std::string, ResponseCallBack*> p = std::make_pair(key, bcb);\n this->listeners.insert(p);\n this->m_cond.notify_all();\n }\n\n void ManagerResponsesHandler::removeResponseListener(const std::string& key) {\n std::string keytmp = key;\n LOG_TRACE_STR(\"REMOVE RESPONSE Listener \" + key);\n ResponseCallBack* m = getListener(key);\n this->listeners.erase(key);\n if (m) {\n delete (m);\n }\n LOG_TRACE_STR(\"OUT\" + keytmp);\n }\n\n bool ManagerResponsesHandler::isEmpty() {\n boost::unique_lock<boost::mutex> lock(this->m_mutex);\n bool rt = this->listeners.empty();\n if (rt) {\n this->m_cond.wait(lock);\n }\n return (rt);\n }\n\n void ManagerResponsesHandler::stop() {\n if (!Thread::isStoped()) {\n clear();\n Thread::stop();\n }\n }\n\n void ManagerResponsesHandler::run() {\n boost::posix_time::milliseconds duration(LOOP_INTERVAL);\n boost::this_thread::sleep<boost::posix_time::milliseconds>(duration);\n {\n boost::this_thread::disable_interruption di;\n {\n if (!isEmpty()) {\n for (listenersList_t::const_iterator it = this->listeners.begin(); it != this->listeners.end(); ) {\n ResponseCallBack* m = (*it).second;\n if ((boost::get_system_time() >= m->timeout) && (m->isTimeout == false)) {\n m->isTimeout = true;\n std::string msg = \"Response: Error\\r\\nActionID: \" + m->getAction()->getActionId() + \"\\r\\nMessage: Time Out\\r\\n\\r\\n\";\n this->notifyResponseMessage(msg);\n } else {\n ++it;\n }\n }\n }\n\n }\n }\n }\n\n void ManagerResponsesHandler::clear() {\n boost::lock_guard<boost::mutex> lock(this->m_mutex);\n for (listenersList_t::const_iterator it = this->listeners.begin(); it != this->listeners.end(); ) {\n removeResponseListener((*it++).first);\n }\n this->m_cond.notify_all();\n LOG_TRACE_STR(\"OUT\");\n }\n\n ResponseCallBack* ManagerResponsesHandler::getListener(const std::string& key) {\n if (this->listeners.find(key) != this->listeners.end())\n return (this->listeners[key]);\n\n return (NULL);\n }\n\n void ManagerResponsesHandler::fireResponseCallback(ManagerResponse *mr) {\n LOG_DEBUG_STR(\"FIRE RESPONSE \" + \"::\" + mr->toLog());\n std::string key = mr->getActionId();\n\n ResponseCallBack* listner = this->getListener(key);\n if (listner) {\n listner->fireCallBack(mr);\n }\n removeResponseListener(key);\n\n }\n\n}\n\n<commit_msg>fix segmentation fault<commit_after>\/*\n * ManagerResponsesHandler.cpp\n *\n * Created on: Jul 14, 2011\n * Author: augcampos\n *\/\n\n#include \"asteriskcpp\/manager\/ManagerResponsesHandler.h\"\n#include \"asteriskcpp\/utils\/LogHandler.h\"\n#include \"asteriskcpp\/utils\/StringUtils.h\"\n\n#define LOOP_INTERVAL 500\n\nnamespace asteriskcpp {\n\n ResponseCallBack::ResponseCallBack(ManagerAction* a, unsigned int tout)\n : isTimeout(false) {\n setAction(a);\n this->timeout = boost::get_system_time() + boost::posix_time::milliseconds(tout);\n }\n\n ResponseCallBack::~ResponseCallBack() {\n LOG_TRACE_STR(\"OUT\");\n }\n\n ASyncResponseCallBack::ASyncResponseCallBack(ManagerAction* a, unsigned int tout, responseCallbackFunction_t f) :\n ResponseCallBack(a, tout) {\n this->function = f;\n }\n\n ASyncResponseCallBack::~ASyncResponseCallBack() {\n LOG_TRACE_STR(\"IN\");\n delete this->action;\n LOG_TRACE_STR(\"OUT\");\n }\n\n void ASyncResponseCallBack::fireCallBack(ManagerResponse* mr) {\n LOG_TRACE_STR(\"ASyncResponseCallBack :\" + mr->toLog());\n if (this->function != NULL) {\n (this->function)(mr);\n }\n delete mr;\n LOG_TRACE_STR(\"OUT\");\n }\n\n SyncResponseCallBack::SyncResponseCallBack(ManagerAction* a, unsigned int timeOut) :\n ResponseCallBack(a, timeOut), response(NULL), isReady(false), isStollEnd(false) {\n }\n\n SyncResponseCallBack::~SyncResponseCallBack() {\n boost::unique_lock<boost::mutex> lock(this->m_mutex);\n this->m_cond.notify_all();\n if (this->isStollEnd == false) {\n this->m_cond.wait(lock);\n }\n LOG_TRACE_STR(\"OUT\");\n }\n\n ManagerResponse* SyncResponseCallBack::stoll() {\n boost::unique_lock<boost::mutex> lock(this->m_mutex);\n LOG_TRACE_STR(\"\");\n if (this->isReady == false) {\n this->m_cond.wait(lock);\n }\n ManagerResponse* mr = this->response;\n this->isStollEnd = true;\n this->m_cond.notify_all();\n LOG_TRACE_STR(\"OUT\");\n return response;\n }\n\n void SyncResponseCallBack::fireCallBack(ManagerResponse* mr) {\n boost::lock_guard<boost::mutex> lock(this->m_mutex);\n this->response = mr;\n LOG_TRACE_STR(\"SyncResponseCallBack : \" + (*mr).toLog());\n this->isReady = true;\n this->m_cond.notify_all();\n }\n\n ManagerAction *ResponseCallBack::getAction() const {\n return (this->action);\n }\n\n void ResponseCallBack::setAction(ManagerAction *action) {\n this->action = action;\n }\n\n void ResponseCallBack::fireTimeout() {\n std::string msg = \"Response: Error\\r\\nActionID: \" + this->action->getActionId() + \"\\r\\nMessage: Time Out\\r\\n\\r\\n\";\n ManagerResponse* rto = new ManagerResponse(msg);\n fireCallBack(rto);\n LOG_TRACE_STR(\"OUT\");\n }\n\n ManagerResponsesHandler::~ManagerResponsesHandler() {\n }\n\n void ManagerResponsesHandler::addResponsetListener(const std::string& key, ResponseCallBack* bcb) {\n boost::lock_guard<boost::mutex> lock(this->m_mutex);\n LOG_TRACE_STR(\"ADD RESPONSE Listener \" + key + \"::\" + typeid (*bcb).name() + \"::\" + convertToString(bcb->timeout));\n const std::pair<std::string, ResponseCallBack*> p = std::make_pair(key, bcb);\n this->listeners.insert(p);\n this->m_cond.notify_all();\n }\n\n void ManagerResponsesHandler::removeResponseListener(const std::string& key) {\n boost::lock_guard<boost::mutex> lock(this->m_mutex);\n std::string keytmp = key;\n LOG_TRACE_STR(\"REMOVE RESPONSE Listener \" + key);\n ResponseCallBack* m = getListener(key);\n this->listeners.erase(key);\n if (m) {\n delete (m);\n }\n LOG_TRACE_STR(\"OUT\" + keytmp);\n }\n\n bool ManagerResponsesHandler::isEmpty() {\n boost::unique_lock<boost::mutex> lock(this->m_mutex);\n bool rt = this->listeners.empty();\n if (rt) {\n this->m_cond.wait(lock);\n }\n return (rt);\n }\n\n void ManagerResponsesHandler::stop() {\n if (!Thread::isStoped()) {\n clear();\n Thread::stop();\n }\n }\n\n void ManagerResponsesHandler::run() {\n boost::posix_time::milliseconds duration(LOOP_INTERVAL);\n boost::this_thread::sleep<boost::posix_time::milliseconds>(duration);\n {\n \/\/boost::this_thread::disable_interruption di;\n {\n boost::lock_guard<boost::mutex> lock(this->m_mutex);\n if (!this->listeners.empty()) {\n for (listenersList_t::const_iterator it = this->listeners.begin(); it != this->listeners.end(); ) {\n ResponseCallBack* m = (*it).second;\n if ((boost::get_system_time() >= m->timeout) && (m->isTimeout == false)) {\n m->isTimeout = true;\n std::string msg = \"Response: Error\\r\\nActionID: \" + m->getAction()->getActionId() + \"\\r\\nMessage: Time Out\\r\\n\\r\\n\";\n this->notifyResponseMessage(msg);\n } else {\n ++it;\n }\n }\n }\n }\n }\n }\n\n void ManagerResponsesHandler::clear() {\n boost::lock_guard<boost::mutex> lock(this->m_mutex);\n for (listenersList_t::const_iterator it = this->listeners.begin(); it != this->listeners.end(); ) {\n removeResponseListener((*it++).first);\n }\n this->m_cond.notify_all();\n LOG_TRACE_STR(\"OUT\");\n }\n\n ResponseCallBack* ManagerResponsesHandler::getListener(const std::string& key) {\n if (this->listeners.find(key) != this->listeners.end())\n return (this->listeners[key]);\n\n return (NULL);\n }\n\n void ManagerResponsesHandler::fireResponseCallback(ManagerResponse *mr) {\n LOG_DEBUG_STR(\"FIRE RESPONSE \" + \"::\" + mr->toLog());\n std::string key = mr->getActionId();\n\n ResponseCallBack* listner = this->getListener(key);\n if (listner) {\n listner->fireCallBack(mr);\n }\n removeResponseListener(key);\n\n }\n\n}\n\n<|endoftext|>"} {"text":"<commit_before>\/\/ This file is part of Eigen, a lightweight C++ template library\n\/\/ for linear algebra.\n\/\/\n\/\/ Copyright (C) 2008 Gael Guennebaud <gael.guennebaud@inria.fr>\n\/\/ Copyright (C) 2010 Jitse Niesen <jitse@maths.leeds.ac.uk>\n\/\/\n\/\/ This Source Code Form is subject to the terms of the Mozilla\n\/\/ Public License v. 2.0. If a copy of the MPL was not distributed\n\/\/ with this file, You can obtain one at http:\/\/mozilla.org\/MPL\/2.0\/.\n\n#include \"main.h\"\n#include <limits>\n#include <Eigen\/Eigenvalues>\n\ntemplate<typename MatrixType> void selfadjointeigensolver(const MatrixType& m)\n{\n typedef typename MatrixType::Index Index;\n \/* this test covers the following files:\n EigenSolver.h, SelfAdjointEigenSolver.h (and indirectly: Tridiagonalization.h)\n *\/\n Index rows = m.rows();\n Index cols = m.cols();\n\n typedef typename MatrixType::Scalar Scalar;\n typedef typename NumTraits<Scalar>::Real RealScalar;\n\n RealScalar largerEps = 10*test_precision<RealScalar>();\n\n MatrixType a = MatrixType::Random(rows,cols);\n MatrixType a1 = MatrixType::Random(rows,cols);\n MatrixType symmA = a.adjoint() * a + a1.adjoint() * a1;\n MatrixType symmC = symmA;\n \n \/\/ randomly nullify some rows\/columns\n {\n Index count = 1;\/\/internal::random<Index>(-cols,cols);\n for(Index k=0; k<count; ++k)\n {\n Index i = internal::random<Index>(0,cols-1);\n symmA.row(i).setZero();\n symmA.col(i).setZero();\n }\n }\n \n symmA.template triangularView<StrictlyUpper>().setZero();\n symmC.template triangularView<StrictlyUpper>().setZero();\n\n MatrixType b = MatrixType::Random(rows,cols);\n MatrixType b1 = MatrixType::Random(rows,cols);\n MatrixType symmB = b.adjoint() * b + b1.adjoint() * b1;\n symmB.template triangularView<StrictlyUpper>().setZero();\n\n SelfAdjointEigenSolver<MatrixType> eiSymm(symmA);\n SelfAdjointEigenSolver<MatrixType> eiDirect;\n eiDirect.computeDirect(symmA);\n \/\/ generalized eigen pb\n GeneralizedSelfAdjointEigenSolver<MatrixType> eiSymmGen(symmC, symmB);\n\n VERIFY_IS_EQUAL(eiSymm.info(), Success);\n VERIFY((symmA.template selfadjointView<Lower>() * eiSymm.eigenvectors()).isApprox(\n eiSymm.eigenvectors() * eiSymm.eigenvalues().asDiagonal(), largerEps));\n VERIFY_IS_APPROX(symmA.template selfadjointView<Lower>().eigenvalues(), eiSymm.eigenvalues());\n \n VERIFY_IS_EQUAL(eiDirect.info(), Success);\n VERIFY((symmA.template selfadjointView<Lower>() * eiDirect.eigenvectors()).isApprox(\n eiDirect.eigenvectors() * eiDirect.eigenvalues().asDiagonal(), largerEps));\n VERIFY_IS_APPROX(symmA.template selfadjointView<Lower>().eigenvalues(), eiDirect.eigenvalues());\n\n SelfAdjointEigenSolver<MatrixType> eiSymmNoEivecs(symmA, false);\n VERIFY_IS_EQUAL(eiSymmNoEivecs.info(), Success);\n VERIFY_IS_APPROX(eiSymm.eigenvalues(), eiSymmNoEivecs.eigenvalues());\n \n \/\/ generalized eigen problem Ax = lBx\n eiSymmGen.compute(symmC, symmB,Ax_lBx);\n VERIFY_IS_EQUAL(eiSymmGen.info(), Success);\n VERIFY((symmC.template selfadjointView<Lower>() * eiSymmGen.eigenvectors()).isApprox(\n symmB.template selfadjointView<Lower>() * (eiSymmGen.eigenvectors() * eiSymmGen.eigenvalues().asDiagonal()), largerEps));\n\n \/\/ generalized eigen problem BAx = lx\n eiSymmGen.compute(symmC, symmB,BAx_lx);\n VERIFY_IS_EQUAL(eiSymmGen.info(), Success);\n VERIFY((symmB.template selfadjointView<Lower>() * (symmC.template selfadjointView<Lower>() * eiSymmGen.eigenvectors())).isApprox(\n (eiSymmGen.eigenvectors() * eiSymmGen.eigenvalues().asDiagonal()), largerEps));\n\n \/\/ generalized eigen problem ABx = lx\n eiSymmGen.compute(symmC, symmB,ABx_lx);\n VERIFY_IS_EQUAL(eiSymmGen.info(), Success);\n VERIFY((symmC.template selfadjointView<Lower>() * (symmB.template selfadjointView<Lower>() * eiSymmGen.eigenvectors())).isApprox(\n (eiSymmGen.eigenvectors() * eiSymmGen.eigenvalues().asDiagonal()), largerEps));\n\n\n eiSymm.compute(symmC);\n MatrixType sqrtSymmA = eiSymm.operatorSqrt();\n VERIFY_IS_APPROX(MatrixType(symmC.template selfadjointView<Lower>()), sqrtSymmA*sqrtSymmA);\n VERIFY_IS_APPROX(sqrtSymmA, symmC.template selfadjointView<Lower>()*eiSymm.operatorInverseSqrt());\n\n MatrixType id = MatrixType::Identity(rows, cols);\n VERIFY_IS_APPROX(id.template selfadjointView<Lower>().operatorNorm(), RealScalar(1));\n\n SelfAdjointEigenSolver<MatrixType> eiSymmUninitialized;\n VERIFY_RAISES_ASSERT(eiSymmUninitialized.info());\n VERIFY_RAISES_ASSERT(eiSymmUninitialized.eigenvalues());\n VERIFY_RAISES_ASSERT(eiSymmUninitialized.eigenvectors());\n VERIFY_RAISES_ASSERT(eiSymmUninitialized.operatorSqrt());\n VERIFY_RAISES_ASSERT(eiSymmUninitialized.operatorInverseSqrt());\n\n eiSymmUninitialized.compute(symmA, false);\n VERIFY_RAISES_ASSERT(eiSymmUninitialized.eigenvectors());\n VERIFY_RAISES_ASSERT(eiSymmUninitialized.operatorSqrt());\n VERIFY_RAISES_ASSERT(eiSymmUninitialized.operatorInverseSqrt());\n\n \/\/ test Tridiagonalization's methods\n Tridiagonalization<MatrixType> tridiag(symmC);\n VERIFY_IS_APPROX(tridiag.diagonal(), tridiag.matrixT().template diagonal());\n VERIFY_IS_APPROX(tridiag.subDiagonal(), tridiag.matrixT().template diagonal<-1>());\n MatrixType T = tridiag.matrixT();\n if(rows>1 && cols>1) {\n \/\/ FIXME check that upper and lower part are 0:\n \/\/VERIFY(T.topRightCorner(rows-2, cols-2).template triangularView<Upper>().isZero());\n }\n VERIFY_IS_APPROX(tridiag.diagonal(), T.diagonal().real());\n VERIFY_IS_APPROX(tridiag.subDiagonal(), T.template diagonal<1>().real());\n VERIFY_IS_APPROX(MatrixType(symmC.template selfadjointView<Lower>()), tridiag.matrixQ() * tridiag.matrixT().eval() * MatrixType(tridiag.matrixQ()).adjoint());\n VERIFY_IS_APPROX(MatrixType(symmC.template selfadjointView<Lower>()), tridiag.matrixQ() * tridiag.matrixT() * tridiag.matrixQ().adjoint());\n \n \/\/ Test computation of eigenvalues from tridiagonal matrix\n if(rows > 1)\n {\n SelfAdjointEigenSolver<MatrixType> eiSymmTridiag;\n eiSymmTridiag.computeFromTridiagonal(tridiag.matrixT().diagonal(), tridiag.matrixT().diagonal(-1), ComputeEigenvectors);\n VERIFY_IS_APPROX(eiSymm.eigenvalues(), eiSymmTridiag.eigenvalues());\n VERIFY_IS_APPROX(tridiag.matrixT(), eiSymmTridiag.eigenvectors().real() * eiSymmTridiag.eigenvalues().asDiagonal() * eiSymmTridiag.eigenvectors().real().transpose());\n }\n\n if (rows > 1)\n {\n \/\/ Test matrix with NaN\n symmC(0,0) = std::numeric_limits<typename MatrixType::RealScalar>::quiet_NaN();\n SelfAdjointEigenSolver<MatrixType> eiSymmNaN(symmC);\n VERIFY_IS_EQUAL(eiSymmNaN.info(), NoConvergence);\n }\n}\n\nvoid test_eigensolver_selfadjoint()\n{\n int s = 0;\n for(int i = 0; i < g_repeat; i++) {\n \/\/ very important to test 3x3 and 2x2 matrices since we provide special paths for them\n CALL_SUBTEST_1( selfadjointeigensolver(Matrix2f()) );\n CALL_SUBTEST_1( selfadjointeigensolver(Matrix2d()) );\n CALL_SUBTEST_1( selfadjointeigensolver(Matrix3f()) );\n CALL_SUBTEST_1( selfadjointeigensolver(Matrix3d()) );\n CALL_SUBTEST_2( selfadjointeigensolver(Matrix4d()) );\n s = internal::random<int>(1,EIGEN_TEST_MAX_SIZE\/4);\n CALL_SUBTEST_3( selfadjointeigensolver(MatrixXf(s,s)) );\n s = internal::random<int>(1,EIGEN_TEST_MAX_SIZE\/4);\n CALL_SUBTEST_4( selfadjointeigensolver(MatrixXd(s,s)) );\n s = internal::random<int>(1,EIGEN_TEST_MAX_SIZE\/4);\n CALL_SUBTEST_5( selfadjointeigensolver(MatrixXcd(s,s)) );\n \n s = internal::random<int>(1,EIGEN_TEST_MAX_SIZE\/4);\n CALL_SUBTEST_9( selfadjointeigensolver(Matrix<std::complex<double>,Dynamic,Dynamic,RowMajor>(s,s)) );\n\n \/\/ some trivial but implementation-wise tricky cases\n CALL_SUBTEST_4( selfadjointeigensolver(MatrixXd(1,1)) );\n CALL_SUBTEST_4( selfadjointeigensolver(MatrixXd(2,2)) );\n CALL_SUBTEST_6( selfadjointeigensolver(Matrix<double,1,1>()) );\n CALL_SUBTEST_7( selfadjointeigensolver(Matrix<double,2,2>()) );\n }\n\n \/\/ Test problem size constructors\n s = internal::random<int>(1,EIGEN_TEST_MAX_SIZE\/4);\n CALL_SUBTEST_8(SelfAdjointEigenSolver<MatrixXf> tmp1(s));\n CALL_SUBTEST_8(Tridiagonalization<MatrixXf> tmp2(s));\n \n TEST_SET_BUT_UNUSED_VARIABLE(s)\n}\n\n<commit_msg>template keyword not allowed before non-template function call<commit_after>\/\/ This file is part of Eigen, a lightweight C++ template library\n\/\/ for linear algebra.\n\/\/\n\/\/ Copyright (C) 2008 Gael Guennebaud <gael.guennebaud@inria.fr>\n\/\/ Copyright (C) 2010 Jitse Niesen <jitse@maths.leeds.ac.uk>\n\/\/\n\/\/ This Source Code Form is subject to the terms of the Mozilla\n\/\/ Public License v. 2.0. If a copy of the MPL was not distributed\n\/\/ with this file, You can obtain one at http:\/\/mozilla.org\/MPL\/2.0\/.\n\n#include \"main.h\"\n#include <limits>\n#include <Eigen\/Eigenvalues>\n\ntemplate<typename MatrixType> void selfadjointeigensolver(const MatrixType& m)\n{\n typedef typename MatrixType::Index Index;\n \/* this test covers the following files:\n EigenSolver.h, SelfAdjointEigenSolver.h (and indirectly: Tridiagonalization.h)\n *\/\n Index rows = m.rows();\n Index cols = m.cols();\n\n typedef typename MatrixType::Scalar Scalar;\n typedef typename NumTraits<Scalar>::Real RealScalar;\n\n RealScalar largerEps = 10*test_precision<RealScalar>();\n\n MatrixType a = MatrixType::Random(rows,cols);\n MatrixType a1 = MatrixType::Random(rows,cols);\n MatrixType symmA = a.adjoint() * a + a1.adjoint() * a1;\n MatrixType symmC = symmA;\n \n \/\/ randomly nullify some rows\/columns\n {\n Index count = 1;\/\/internal::random<Index>(-cols,cols);\n for(Index k=0; k<count; ++k)\n {\n Index i = internal::random<Index>(0,cols-1);\n symmA.row(i).setZero();\n symmA.col(i).setZero();\n }\n }\n \n symmA.template triangularView<StrictlyUpper>().setZero();\n symmC.template triangularView<StrictlyUpper>().setZero();\n\n MatrixType b = MatrixType::Random(rows,cols);\n MatrixType b1 = MatrixType::Random(rows,cols);\n MatrixType symmB = b.adjoint() * b + b1.adjoint() * b1;\n symmB.template triangularView<StrictlyUpper>().setZero();\n\n SelfAdjointEigenSolver<MatrixType> eiSymm(symmA);\n SelfAdjointEigenSolver<MatrixType> eiDirect;\n eiDirect.computeDirect(symmA);\n \/\/ generalized eigen pb\n GeneralizedSelfAdjointEigenSolver<MatrixType> eiSymmGen(symmC, symmB);\n\n VERIFY_IS_EQUAL(eiSymm.info(), Success);\n VERIFY((symmA.template selfadjointView<Lower>() * eiSymm.eigenvectors()).isApprox(\n eiSymm.eigenvectors() * eiSymm.eigenvalues().asDiagonal(), largerEps));\n VERIFY_IS_APPROX(symmA.template selfadjointView<Lower>().eigenvalues(), eiSymm.eigenvalues());\n \n VERIFY_IS_EQUAL(eiDirect.info(), Success);\n VERIFY((symmA.template selfadjointView<Lower>() * eiDirect.eigenvectors()).isApprox(\n eiDirect.eigenvectors() * eiDirect.eigenvalues().asDiagonal(), largerEps));\n VERIFY_IS_APPROX(symmA.template selfadjointView<Lower>().eigenvalues(), eiDirect.eigenvalues());\n\n SelfAdjointEigenSolver<MatrixType> eiSymmNoEivecs(symmA, false);\n VERIFY_IS_EQUAL(eiSymmNoEivecs.info(), Success);\n VERIFY_IS_APPROX(eiSymm.eigenvalues(), eiSymmNoEivecs.eigenvalues());\n \n \/\/ generalized eigen problem Ax = lBx\n eiSymmGen.compute(symmC, symmB,Ax_lBx);\n VERIFY_IS_EQUAL(eiSymmGen.info(), Success);\n VERIFY((symmC.template selfadjointView<Lower>() * eiSymmGen.eigenvectors()).isApprox(\n symmB.template selfadjointView<Lower>() * (eiSymmGen.eigenvectors() * eiSymmGen.eigenvalues().asDiagonal()), largerEps));\n\n \/\/ generalized eigen problem BAx = lx\n eiSymmGen.compute(symmC, symmB,BAx_lx);\n VERIFY_IS_EQUAL(eiSymmGen.info(), Success);\n VERIFY((symmB.template selfadjointView<Lower>() * (symmC.template selfadjointView<Lower>() * eiSymmGen.eigenvectors())).isApprox(\n (eiSymmGen.eigenvectors() * eiSymmGen.eigenvalues().asDiagonal()), largerEps));\n\n \/\/ generalized eigen problem ABx = lx\n eiSymmGen.compute(symmC, symmB,ABx_lx);\n VERIFY_IS_EQUAL(eiSymmGen.info(), Success);\n VERIFY((symmC.template selfadjointView<Lower>() * (symmB.template selfadjointView<Lower>() * eiSymmGen.eigenvectors())).isApprox(\n (eiSymmGen.eigenvectors() * eiSymmGen.eigenvalues().asDiagonal()), largerEps));\n\n\n eiSymm.compute(symmC);\n MatrixType sqrtSymmA = eiSymm.operatorSqrt();\n VERIFY_IS_APPROX(MatrixType(symmC.template selfadjointView<Lower>()), sqrtSymmA*sqrtSymmA);\n VERIFY_IS_APPROX(sqrtSymmA, symmC.template selfadjointView<Lower>()*eiSymm.operatorInverseSqrt());\n\n MatrixType id = MatrixType::Identity(rows, cols);\n VERIFY_IS_APPROX(id.template selfadjointView<Lower>().operatorNorm(), RealScalar(1));\n\n SelfAdjointEigenSolver<MatrixType> eiSymmUninitialized;\n VERIFY_RAISES_ASSERT(eiSymmUninitialized.info());\n VERIFY_RAISES_ASSERT(eiSymmUninitialized.eigenvalues());\n VERIFY_RAISES_ASSERT(eiSymmUninitialized.eigenvectors());\n VERIFY_RAISES_ASSERT(eiSymmUninitialized.operatorSqrt());\n VERIFY_RAISES_ASSERT(eiSymmUninitialized.operatorInverseSqrt());\n\n eiSymmUninitialized.compute(symmA, false);\n VERIFY_RAISES_ASSERT(eiSymmUninitialized.eigenvectors());\n VERIFY_RAISES_ASSERT(eiSymmUninitialized.operatorSqrt());\n VERIFY_RAISES_ASSERT(eiSymmUninitialized.operatorInverseSqrt());\n\n \/\/ test Tridiagonalization's methods\n Tridiagonalization<MatrixType> tridiag(symmC);\n VERIFY_IS_APPROX(tridiag.diagonal(), tridiag.matrixT().diagonal());\n VERIFY_IS_APPROX(tridiag.subDiagonal(), tridiag.matrixT().template diagonal<-1>());\n MatrixType T = tridiag.matrixT();\n if(rows>1 && cols>1) {\n \/\/ FIXME check that upper and lower part are 0:\n \/\/VERIFY(T.topRightCorner(rows-2, cols-2).template triangularView<Upper>().isZero());\n }\n VERIFY_IS_APPROX(tridiag.diagonal(), T.diagonal().real());\n VERIFY_IS_APPROX(tridiag.subDiagonal(), T.template diagonal<1>().real());\n VERIFY_IS_APPROX(MatrixType(symmC.template selfadjointView<Lower>()), tridiag.matrixQ() * tridiag.matrixT().eval() * MatrixType(tridiag.matrixQ()).adjoint());\n VERIFY_IS_APPROX(MatrixType(symmC.template selfadjointView<Lower>()), tridiag.matrixQ() * tridiag.matrixT() * tridiag.matrixQ().adjoint());\n \n \/\/ Test computation of eigenvalues from tridiagonal matrix\n if(rows > 1)\n {\n SelfAdjointEigenSolver<MatrixType> eiSymmTridiag;\n eiSymmTridiag.computeFromTridiagonal(tridiag.matrixT().diagonal(), tridiag.matrixT().diagonal(-1), ComputeEigenvectors);\n VERIFY_IS_APPROX(eiSymm.eigenvalues(), eiSymmTridiag.eigenvalues());\n VERIFY_IS_APPROX(tridiag.matrixT(), eiSymmTridiag.eigenvectors().real() * eiSymmTridiag.eigenvalues().asDiagonal() * eiSymmTridiag.eigenvectors().real().transpose());\n }\n\n if (rows > 1)\n {\n \/\/ Test matrix with NaN\n symmC(0,0) = std::numeric_limits<typename MatrixType::RealScalar>::quiet_NaN();\n SelfAdjointEigenSolver<MatrixType> eiSymmNaN(symmC);\n VERIFY_IS_EQUAL(eiSymmNaN.info(), NoConvergence);\n }\n}\n\nvoid test_eigensolver_selfadjoint()\n{\n int s = 0;\n for(int i = 0; i < g_repeat; i++) {\n \/\/ very important to test 3x3 and 2x2 matrices since we provide special paths for them\n CALL_SUBTEST_1( selfadjointeigensolver(Matrix2f()) );\n CALL_SUBTEST_1( selfadjointeigensolver(Matrix2d()) );\n CALL_SUBTEST_1( selfadjointeigensolver(Matrix3f()) );\n CALL_SUBTEST_1( selfadjointeigensolver(Matrix3d()) );\n CALL_SUBTEST_2( selfadjointeigensolver(Matrix4d()) );\n s = internal::random<int>(1,EIGEN_TEST_MAX_SIZE\/4);\n CALL_SUBTEST_3( selfadjointeigensolver(MatrixXf(s,s)) );\n s = internal::random<int>(1,EIGEN_TEST_MAX_SIZE\/4);\n CALL_SUBTEST_4( selfadjointeigensolver(MatrixXd(s,s)) );\n s = internal::random<int>(1,EIGEN_TEST_MAX_SIZE\/4);\n CALL_SUBTEST_5( selfadjointeigensolver(MatrixXcd(s,s)) );\n \n s = internal::random<int>(1,EIGEN_TEST_MAX_SIZE\/4);\n CALL_SUBTEST_9( selfadjointeigensolver(Matrix<std::complex<double>,Dynamic,Dynamic,RowMajor>(s,s)) );\n\n \/\/ some trivial but implementation-wise tricky cases\n CALL_SUBTEST_4( selfadjointeigensolver(MatrixXd(1,1)) );\n CALL_SUBTEST_4( selfadjointeigensolver(MatrixXd(2,2)) );\n CALL_SUBTEST_6( selfadjointeigensolver(Matrix<double,1,1>()) );\n CALL_SUBTEST_7( selfadjointeigensolver(Matrix<double,2,2>()) );\n }\n\n \/\/ Test problem size constructors\n s = internal::random<int>(1,EIGEN_TEST_MAX_SIZE\/4);\n CALL_SUBTEST_8(SelfAdjointEigenSolver<MatrixXf> tmp1(s));\n CALL_SUBTEST_8(Tridiagonalization<MatrixXf> tmp2(s));\n \n TEST_SET_BUT_UNUSED_VARIABLE(s)\n}\n\n<|endoftext|>"} {"text":"<commit_before>#include <iostream>\n#include <string>\n#include <unordered_map>\n#include <utility>\n#include <algorithm>\n\n\nstruct SvoRow {\n std::string s;\n std::string v;\n std::string o;\n int n;\n};\n\n\nstruct hashPair {\n template <class T1, class T2>\n std::size_t operator () (const std::pair<T1, T2> &p) const {\n auto h1 = std::hash<T1>{}(p.first);\n auto h2 = std::hash<T2>{}(p.second);\n return h1 ^ h2;\n }\n};\n\n\nbool compareTuples(std::tuple<std::string, std::string, int> a,\n std::tuple<std::string, std::string, int> b) {\n return std::get<2>(a) > std::get<2>(b);\n}\n\n\nint main(int argc, char** argv) {\n if (argc < 2) {\n std::cout << \"Unspecified N value\" << std::endl;\n return -1;\n }\n\n\n int n = std::stoi(argv[1]);\n SvoRow row;\n std::unordered_map<std::pair<std::string, std::string>, int, hashPair> pairs;\n std::vector<std::tuple<std::string, std::string, int> > ordered;\n\n while (std::cin >> row.s >> row.v >> row.o >> row.n) {\n pairs[std::make_pair(row.s, row.o)] += row.n;\n }\n\n for (const auto &data : pairs) {\n ordered.push_back(std::make_tuple(data.first.first,\n data.first.second, data.second));\n }\n\n n = std::min(n, (int)ordered.size());\n\n std::partial_sort(ordered.begin(), ordered.begin() + n,\n ordered.end(), compareTuples);\n\n for (auto it = ordered.begin(); it != ordered.begin() + n; ++it) {\n std::cout << \"(\" << std::get<0>(*it) << \", \" << std::get<1>(*it)\n << \") = \" << std::get<2>(*it) << \"\\n\";\n }\n}\n<commit_msg>Now properly accounts for whitespaces<commit_after>#include <iostream>\n#include <string>\n#include <unordered_map>\n#include <utility>\n#include <algorithm>\n#include <sstream>\n#include <vector>\n\n\nstruct SvoRow {\n std::string s;\n std::string v;\n std::string o;\n int n;\n};\n\n\nstruct hashPair {\n template <class T1, class T2>\n std::size_t operator () (const std::pair<T1, T2> &p) const {\n auto h1 = std::hash<T1>{}(p.first);\n auto h2 = std::hash<T2>{}(p.second);\n return h1 ^ h2;\n }\n};\n\n\nbool compareTuples(std::tuple<std::string, std::string, int> a,\n std::tuple<std::string, std::string, int> b) {\n return std::get<2>(a) > std::get<2>(b);\n}\n\n\nstd::vector<std::string> &split(const std::string &s, char delim,\n std::vector<std::string> &elems) {\n std::stringstream ss(s);\n std::string item;\n while (std::getline(ss, item, delim)) {\n elems.push_back(item);\n }\n return elems;\n}\n\n\nSvoRow rowFromSplit(std::vector<std::string> vec) {\n SvoRow row;\n row.s = vec[0];\n row.v = vec[1];\n row.o = vec[2];\n row.n = std::stoi(vec[3]);\n return row;\n}\n\nstd::vector<std::string> split(const std::string &s, char delim) {\n std::vector<std::string> elems;\n split(s, delim, elems);\n return elems;\n}\n\n\nint main(int argc, char** argv) {\n if (argc < 2) {\n std::cout << \"Unspecified N value\" << std::endl;\n return -1;\n }\n\n\n int n = std::stoi(argv[1]);\n SvoRow row;\n std::unordered_map<std::pair<std::string, std::string>, int, hashPair> pairs;\n std::vector<std::tuple<std::string, std::string, int> > ordered;\n std::string line;\n\n while (std::getline(std::cin, line)) {\n std::vector<std::string> elems = split(line, '\\t');\n row = rowFromSplit(elems);\n pairs[std::make_pair(row.s, row.o)] += row.n;\n }\n\n for (const auto &data : pairs) {\n ordered.push_back(std::make_tuple(data.first.first,\n data.first.second, data.second));\n }\n\n n = std::min(n, (int)ordered.size());\n\n std::partial_sort(ordered.begin(), ordered.begin() + n,\n ordered.end(), compareTuples);\n\n for (auto it = ordered.begin(); it != ordered.begin() + n; ++it) {\n std::cout << \"(\" << std::get<0>(*it) << \", \" << std::get<1>(*it)\n << \") = \" << std::get<2>(*it) << \"\\n\";\n }\n}\n<|endoftext|>"} {"text":"<commit_before>#include <iostream>\n#include <string>\n#include <unordered_map>\n#include <utility>\n#include <algorithm>\n#include <sstream>\n#include <vector>\n\n\nstruct SvoRow {\n std::string s;\n std::string v;\n std::string o;\n int n;\n};\n\n\nstruct hashPair {\n template <class T1, class T2>\n std::size_t operator () (const std::pair<T1, T2> &p) const {\n auto h1 = std::hash<T1>{}(p.first);\n auto h2 = std::hash<T2>{}(p.second);\n return h1 ^ h2;\n }\n};\n\n\nbool compareTuples(std::tuple<std::string, std::string, int> a,\n std::tuple<std::string, std::string, int> b) {\n return std::get<2>(a) > std::get<2>(b);\n}\n\n\nstd::vector<std::string> &split(const std::string &s, char delim,\n std::vector<std::string> &elems) {\n std::stringstream ss(s);\n std::string item;\n while (std::getline(ss, item, delim)) {\n elems.push_back(item);\n }\n return elems;\n}\n\n\nSvoRow rowFromSplit(std::vector<std::string> vec) {\n SvoRow row;\n row.s = vec[0];\n row.v = vec[1];\n row.o = vec[2];\n row.n = std::stoi(vec[3]);\n return row;\n}\n\nstd::vector<std::string> split(const std::string &s, char delim) {\n std::vector<std::string> elems;\n split(s, delim, elems);\n return elems;\n}\n\n\nint main(int argc, char** argv) {\n if (argc < 2) {\n std::cout << \"Unspecified N value\" << std::endl;\n return -1;\n }\n\n\n int n = std::stoi(argv[1]);\n SvoRow row;\n std::unordered_map<std::pair<std::string, std::string>, int, hashPair> pairs;\n std::vector<std::tuple<std::string, std::string, int> > ordered;\n std::string line;\n\n while (std::getline(std::cin, line)) {\n std::vector<std::string> elems = split(line, '\\t');\n row = rowFromSplit(elems);\n pairs[std::make_pair(row.s, row.o)] += row.n;\n }\n\n for (const auto &data : pairs) {\n ordered.push_back(std::make_tuple(data.first.first,\n data.first.second, data.second));\n }\n\n n = std::min(n, (int)ordered.size());\n\n std::partial_sort(ordered.begin(), ordered.begin() + n,\n ordered.end(), compareTuples);\n\n for (auto it = ordered.begin(); it != ordered.begin() + n; ++it) {\n std::cout << \"(\" << std::get<0>(*it) << \", \" << std::get<1>(*it)\n << \") = \" << std::get<2>(*it) << \"\\n\";\n }\n}\n<commit_msg>Changed hash implementation to mirror Python's<commit_after>#include <iostream>\n#include <string>\n#include <unordered_map>\n#include <utility>\n#include <algorithm>\n#include <sstream>\n#include <vector>\n\n\nstruct SvoRow {\n std::string s;\n std::string v;\n std::string o;\n int n;\n};\n\n\nstruct hashPair {\n template <class T1, class T2>\n std::size_t operator () (const std::pair<T1, T2> &p) const {\n auto value = 0x345678;\n auto h1 = std::hash<T1>{}(p.first);\n auto h2 = std::hash<T2>{}(p.second);\n value = (100003 * value) ^ h1;\n value = (100003 * value) ^ h2;\n return value;\n }\n};\n\n\nbool compareTuples(std::tuple<std::string, std::string, int> a,\n std::tuple<std::string, std::string, int> b) {\n return std::get<2>(a) > std::get<2>(b);\n}\n\n\nstd::vector<std::string> &split(const std::string &s, char delim,\n std::vector<std::string> &elems) {\n std::stringstream ss(s);\n std::string item;\n while (std::getline(ss, item, delim)) {\n elems.push_back(item);\n }\n return elems;\n}\n\n\nSvoRow rowFromSplit(std::vector<std::string> vec) {\n SvoRow row;\n row.s = vec[0];\n row.v = vec[1];\n row.o = vec[2];\n row.n = std::stoi(vec[3]);\n return row;\n}\n\nstd::vector<std::string> split(const std::string &s, char delim) {\n std::vector<std::string> elems;\n split(s, delim, elems);\n return elems;\n}\n\n\nint main(int argc, char** argv) {\n if (argc < 2) {\n std::cout << \"Unspecified N value\" << std::endl;\n return -1;\n }\n\n\n int n = std::stoi(argv[1]);\n SvoRow row;\n std::unordered_map<std::pair<std::string, std::string>, int, hashPair> pairs;\n std::vector<std::tuple<std::string, std::string, int> > ordered;\n std::string line;\n\n while (std::getline(std::cin, line)) {\n std::vector<std::string> elems = split(line, '\\t');\n row = rowFromSplit(elems);\n pairs[std::make_pair(row.s, row.o)] += row.n;\n }\n\n for (const auto &data : pairs) {\n ordered.push_back(std::make_tuple(data.first.first,\n data.first.second, data.second));\n }\n\n n = std::min(n, (int)ordered.size());\n\n std::partial_sort(ordered.begin(), ordered.begin() + n,\n ordered.end(), compareTuples);\n\n for (auto it = ordered.begin(); it != ordered.begin() + n; ++it) {\n std::cout << \"(\" << std::get<0>(*it) << \", \" << std::get<1>(*it)\n << \") = \" << std::get<2>(*it) << \"\\n\";\n }\n}\n<|endoftext|>"} {"text":"<commit_before>\/**\n * SFCGAL\n *\n * Copyright (C) 2012-2013 Oslandia <infos@oslandia.com>\n * Copyright (C) 2012-2013 IGN (http:\/\/www.ign.fr)\n *\n * This program is free software: you can redistribute it and\/or modify\n * it under the terms of the GNU General Public License as published by\n * the Free Software Foundation, either version 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 <boost\/test\/unit_test.hpp>\n\n#include <exception>\n\n#include <SFCGAL\/numeric.h>\n\nusing namespace boost::unit_test ;\nusing namespace SFCGAL ;\n\nBOOST_AUTO_TEST_SUITE( SFCGAL_NumericTest )\n\nBOOST_AUTO_TEST_CASE( testFloorRational )\n{\n\tBOOST_CHECK_EQUAL( SFCGAL::floor( CGAL::Gmpq(0) ), 0 ) ;\n\tBOOST_CHECK_EQUAL( SFCGAL::floor( CGAL::Gmpq(1,2) ), 0 ) ;\n\tBOOST_CHECK_EQUAL( SFCGAL::floor( CGAL::Gmpq(1,3) ), 0 ) ;\n\tBOOST_CHECK_EQUAL( SFCGAL::floor( CGAL::Gmpq(2,3) ), 0 ) ;\n\tBOOST_CHECK_EQUAL( SFCGAL::floor( CGAL::Gmpq(1,1) ), 1 ) ;\n\tBOOST_CHECK_EQUAL( SFCGAL::floor( CGAL::Gmpq(4,3) ), 1 ) ;\n}\n\nBOOST_AUTO_TEST_CASE( testCeilRational )\n{\n\tBOOST_CHECK_EQUAL( SFCGAL::ceil( CGAL::Gmpq(0) ), 0 ) ;\n\tBOOST_CHECK_EQUAL( SFCGAL::ceil( CGAL::Gmpq(1,2) ), 1 ) ;\n\tBOOST_CHECK_EQUAL( SFCGAL::ceil( CGAL::Gmpq(1,3) ), 1 ) ;\n\tBOOST_CHECK_EQUAL( SFCGAL::ceil( CGAL::Gmpq(1,1) ), 1 ) ;\n\tBOOST_CHECK_EQUAL( SFCGAL::ceil( CGAL::Gmpq(4,3) ), 2 ) ;\n}\n\nBOOST_AUTO_TEST_CASE( testRoundRational )\n{\n\tBOOST_CHECK_EQUAL( SFCGAL::round( CGAL::Gmpq(0) ), 0 ) ;\n\tBOOST_CHECK_EQUAL( SFCGAL::round( CGAL::Gmpq(1,2) ), 1 ) ;\n\tBOOST_CHECK_EQUAL( SFCGAL::round( CGAL::Gmpq(1,3) ), 0 ) ;\n\tBOOST_CHECK_EQUAL( SFCGAL::round( CGAL::Gmpq(1,1) ), 1 ) ;\n\tBOOST_CHECK_EQUAL( SFCGAL::round( CGAL::Gmpq(4,3) ), 1 ) ;\n}\n\nBOOST_AUTO_TEST_SUITE_END()\n\n\n\n\n<commit_msg>[numeric]add test for NaN\/isNaN<commit_after>\/**\n * SFCGAL\n *\n * Copyright (C) 2012-2013 Oslandia <infos@oslandia.com>\n * Copyright (C) 2012-2013 IGN (http:\/\/www.ign.fr)\n *\n * This program is free software: you can redistribute it and\/or modify\n * it under the terms of the GNU General Public License as published by\n * the Free Software Foundation, either version 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 <boost\/test\/unit_test.hpp>\n\n#include <exception>\n\n#include <SFCGAL\/numeric.h>\n\nusing namespace boost::unit_test ;\nusing namespace SFCGAL ;\n\nBOOST_AUTO_TEST_SUITE( SFCGAL_NumericTest )\n\nBOOST_AUTO_TEST_CASE( testNaNAndIsNaN ){\n\tBOOST_CHECK( NaN() != NaN() );\n\tBOOST_CHECK( ! isNaN( 0.0 ) );\n\tBOOST_CHECK( isNaN( NaN() ) );\n}\n\nBOOST_AUTO_TEST_CASE( testFloorRational )\n{\n\tBOOST_CHECK_EQUAL( SFCGAL::floor( CGAL::Gmpq(0) ), 0 ) ;\n\tBOOST_CHECK_EQUAL( SFCGAL::floor( CGAL::Gmpq(1,2) ), 0 ) ;\n\tBOOST_CHECK_EQUAL( SFCGAL::floor( CGAL::Gmpq(1,3) ), 0 ) ;\n\tBOOST_CHECK_EQUAL( SFCGAL::floor( CGAL::Gmpq(2,3) ), 0 ) ;\n\tBOOST_CHECK_EQUAL( SFCGAL::floor( CGAL::Gmpq(1,1) ), 1 ) ;\n\tBOOST_CHECK_EQUAL( SFCGAL::floor( CGAL::Gmpq(4,3) ), 1 ) ;\n}\n\nBOOST_AUTO_TEST_CASE( testCeilRational )\n{\n\tBOOST_CHECK_EQUAL( SFCGAL::ceil( CGAL::Gmpq(0) ), 0 ) ;\n\tBOOST_CHECK_EQUAL( SFCGAL::ceil( CGAL::Gmpq(1,2) ), 1 ) ;\n\tBOOST_CHECK_EQUAL( SFCGAL::ceil( CGAL::Gmpq(1,3) ), 1 ) ;\n\tBOOST_CHECK_EQUAL( SFCGAL::ceil( CGAL::Gmpq(1,1) ), 1 ) ;\n\tBOOST_CHECK_EQUAL( SFCGAL::ceil( CGAL::Gmpq(4,3) ), 2 ) ;\n}\n\nBOOST_AUTO_TEST_CASE( testRoundRational )\n{\n\tBOOST_CHECK_EQUAL( SFCGAL::round( CGAL::Gmpq(0) ), 0 ) ;\n\tBOOST_CHECK_EQUAL( SFCGAL::round( CGAL::Gmpq(1,2) ), 1 ) ;\n\tBOOST_CHECK_EQUAL( SFCGAL::round( CGAL::Gmpq(1,3) ), 0 ) ;\n\tBOOST_CHECK_EQUAL( SFCGAL::round( CGAL::Gmpq(1,1) ), 1 ) ;\n\tBOOST_CHECK_EQUAL( SFCGAL::round( CGAL::Gmpq(4,3) ), 1 ) ;\n}\n\nBOOST_AUTO_TEST_SUITE_END()\n\n\n\n\n<|endoftext|>"} {"text":"<commit_before>\/\/ Copyright 2015 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 <unistd.h>\n#ifdef __APPLE__\n#include <sys\/time.h>\n#endif\n\n#include <iostream>\n#include <ctime>\n#include <cstdint>\n#include <vector>\n#include <map>\n#include <cstdlib>\n\n#include \"test.h\"\n#include \"..\/public\/gemmlowp.h\"\n\n#ifndef GEMMLOWP_TEST_BIT_DEPTH\n#define GEMMLOWP_TEST_BIT_DEPTH L8R8\n#endif\n\n#if defined(__arm__) && !defined(GEMMLOWP_NEON)\n#warning \"Building without NEON support on ARM, check your compiler setup!\"\n#endif\n\nnamespace gemmlowp {\n\ndouble time() {\n#ifdef __APPLE__\n timeval t;\n gettimeofday(&t, nullptr);\n return t.tv_sec + 1e-6 * t.tv_usec;\n#else\n timespec t;\n clock_gettime(CLOCK_REALTIME, &t);\n return t.tv_sec + 1e-9 * t.tv_nsec;\n#endif\n}\n\nconst double min_accurate_duration = 1e-1;\nconst std::size_t min_working_set_size = 16 * 1024 * 1024;\n\nstruct gemm_t {\n int rows, depth, cols;\n gemm_t() : rows(0), depth(0), cols(0) {}\n gemm_t(int r, int d, int c) : rows(r), depth(d), cols(c) {}\n};\n\nbool operator<(const gemm_t& a, const gemm_t& b) {\n return a.rows < b.rows ||\n (a.rows <= b.rows &&\n (a.depth < b.depth || (a.depth <= b.depth && (a.cols < b.cols))));\n}\n\ntemplate <typename LhsType, typename RhsType, typename ResultType>\ndouble time_for_gemms(GemmContext* context, const std::vector<gemm_t>& gemms) {\n typedef std::uint8_t Scalar;\n\n \/\/ set up the matrix pool\n\n std::size_t combined_gemm_sizes = 0;\n for (auto gemm : gemms) {\n int rows = gemm.rows;\n int depth = gemm.depth;\n int cols = gemm.cols;\n combined_gemm_sizes +=\n sizeof(Scalar) * (rows * depth + depth * cols + rows * cols);\n }\n\n const std::size_t pool_size = 1 + min_working_set_size \/ combined_gemm_sizes;\n\n std::vector<LhsType> lhs(pool_size * gemms.size());\n std::vector<RhsType> rhs(pool_size * gemms.size());\n std::vector<ResultType> result(pool_size * gemms.size());\n\n for (std::size_t i = 0; i < pool_size; i++) {\n for (std::size_t j = 0; j < gemms.size(); j++) {\n int k = i * gemms.size() + j;\n lhs[k].Resize(gemms[j].rows, gemms[j].depth);\n MakeConstant(&lhs[k], 0);\n rhs[k].Resize(gemms[j].depth, gemms[j].cols);\n MakeConstant(&rhs[k], 0);\n result[k].Resize(gemms[j].rows, gemms[j].cols);\n MakeConstant(&result[k], 0);\n }\n }\n\n \/\/ main benchmark loop\n\n int iters_at_a_time = 1;\n float time_per_iter = 0.0f;\n std::size_t pool_index = 0;\n\n while (true) {\n double starttime = time();\n for (int i = 0; i < iters_at_a_time; i++) {\n for (int j = 0; j < gemms.size(); j++) {\n int k = pool_index * gemms.size() + j;\n Gemm<std::uint8_t, BitDepthSetting::GEMMLOWP_TEST_BIT_DEPTH>(\n context, lhs[k].const_map(), rhs[k].const_map(), &result[k].map(),\n -75, -91, 74980, 123, 20);\n }\n pool_index++;\n if (pool_index == pool_size) {\n pool_index = 0;\n }\n }\n double endtime = time();\n\n const float timing = static_cast<float>(endtime - starttime);\n\n if (timing >= min_accurate_duration) {\n time_per_iter = timing \/ iters_at_a_time;\n break;\n }\n\n iters_at_a_time *= 2;\n }\n\n return time_per_iter;\n}\n\ntemplate <typename LhsType, typename RhsType, typename ResultType>\ndouble gflops_for_gemms(GemmContext* context,\n const std::vector<gemm_t>& gemms) {\n const double time_per_iter =\n time_for_gemms<LhsType, RhsType, ResultType>(context, gemms);\n double ops = 0;\n for (auto gemm : gemms) {\n ops += 2.0 * gemm.rows * gemm.depth * gemm.cols;\n }\n return 1e-9 * ops \/ time_per_iter;\n}\n\nvoid benchmark(GemmContext* context) {\n std::map<gemm_t, std::vector<double>> benchmark_results;\n\n std::vector<gemm_t> benchmark_gemms;\n benchmark_gemms.emplace_back(10, 10, 10);\n benchmark_gemms.emplace_back(20, 20, 20);\n benchmark_gemms.emplace_back(30, 30, 30);\n benchmark_gemms.emplace_back(40, 40, 40);\n benchmark_gemms.emplace_back(50, 50, 50);\n benchmark_gemms.emplace_back(60, 60, 60);\n benchmark_gemms.emplace_back(64, 256, 147);\n benchmark_gemms.emplace_back(100, 100, 1);\n benchmark_gemms.emplace_back(100, 100, 100);\n benchmark_gemms.emplace_back(100, 1000, 100);\n benchmark_gemms.emplace_back(1000, 1000, 1);\n benchmark_gemms.emplace_back(1000, 1000, 10);\n benchmark_gemms.emplace_back(1000, 1000, 100);\n benchmark_gemms.emplace_back(1000, 1000, 1000);\n\n const int repeat = 2;\n\n typedef Matrix<std::uint8_t, MapOrder::RowMajor> LhsType;\n typedef Matrix<std::uint8_t, MapOrder::ColMajor> RhsType;\n typedef Matrix<std::uint8_t, MapOrder::ColMajor> ResultType;\n\n#ifdef GEMMLOWP_TEST_PROFILE\n gemmlowp::RegisterCurrentThreadForProfiling();\n gemmlowp::StartProfiling();\n#endif\n\n \/\/ We don't record the first repetition, it's just warm-up.\n for (int r = 0; r < repeat + 1; r++) {\n std::cout << \"repetition \" << r + 1 << \"\/\" << repeat + 1 << \"...\\r\"\n << std::flush;\n for (auto gemm : benchmark_gemms) {\n double gflops = 0;\n std::vector<gemm_t> unique_gemm;\n unique_gemm.push_back(gemm);\n gflops =\n gflops_for_gemms<LhsType, RhsType, ResultType>(context, unique_gemm);\n if (r > 0) {\n benchmark_results[gemm].emplace_back(gflops);\n }\n }\n }\n\n#ifdef GEMMLOWP_TEST_PROFILE\n gemmlowp::FinishProfiling();\n#endif\n\n std::cout << \" \\r\"\n << std::flush;\n\n std::cout.precision(4);\n\n for (auto b : benchmark_results) {\n sort(b.second.begin(), b.second.end());\n std::cout << b.first.rows << \"x\" << b.first.depth << \"x\" << b.first.cols\n << \" : \" << b.second.back() << \" GFlops\/s\" << std::endl;\n }\n std::cout << std::endl;\n}\n\nvoid benchmark_googlenet(GemmContext* context) {\n \/\/ These are the m, n, k sizes for a typical GoogLeNet.\n const int googlenet_gemm_sizes[] = {\n 12544, 64, 147, 3136, 64, 64, 3136, 192, 576, 784, 64, 192,\n 784, 96, 192, 784, 128, 864, 784, 16, 192, 784, 32, 400,\n 784, 32, 192, 784, 128, 256, 784, 128, 256, 784, 192, 1152,\n 784, 32, 256, 784, 96, 800, 784, 64, 256, 196, 192, 480,\n 196, 96, 480, 196, 204, 864, 196, 16, 480, 196, 48, 400,\n 196, 64, 480, 196, 160, 508, 196, 112, 508, 196, 224, 1008,\n 196, 24, 508, 196, 64, 600, 196, 64, 508, 196, 128, 512,\n 196, 128, 512, 196, 256, 1152, 196, 24, 512, 196, 64, 600,\n 196, 64, 512, 196, 112, 512, 196, 144, 512, 196, 288, 1296,\n 196, 32, 512, 196, 64, 800, 196, 64, 512, 196, 256, 528,\n 196, 160, 528, 196, 320, 1440, 196, 32, 528, 196, 128, 800,\n 196, 128, 528, 49, 256, 832, 49, 160, 832, 49, 320, 1440,\n 49, 48, 832, 49, 128, 1200, 49, 128, 832, 49, 384, 832,\n 49, 192, 832, 49, 384, 1728, 49, 48, 832, 49, 128, 1200,\n 49, 128, 832, 16, 128, 508, 1, 1024, 2048, 1, 1008, 1024,\n 16, 128, 528, 1, 1024, 2048, 1, 1008, 1024, 1, 1008, 1024,\n };\n assert(sizeof(googlenet_gemm_sizes) % (3 * sizeof(googlenet_gemm_sizes[0])) ==\n 0);\n const std::size_t num_googlenet_gemms =\n sizeof(googlenet_gemm_sizes) \/ (3 * sizeof(googlenet_gemm_sizes[0]));\n\n std::vector<gemm_t> googlenet_gemms(num_googlenet_gemms);\n for (std::size_t i = 0; i < num_googlenet_gemms; i++) {\n googlenet_gemms[i].rows = googlenet_gemm_sizes[3 * i + 1];\n googlenet_gemms[i].depth = googlenet_gemm_sizes[3 * i + 2];\n googlenet_gemms[i].cols = googlenet_gemm_sizes[3 * i + 0];\n }\n\n typedef Matrix<std::uint8_t, MapOrder::RowMajor> LhsType;\n typedef Matrix<std::uint8_t, MapOrder::ColMajor> RhsType;\n typedef Matrix<std::uint8_t, MapOrder::ColMajor> ResultType;\n\n std::vector<float> gemm_times;\n const double mintime = 20.0;\n std::cout << \"running for \" << mintime << \" seconds...\" << std::endl;\n\n#ifdef GEMMLOWP_TEST_PROFILE\n gemmlowp::RegisterCurrentThreadForProfiling();\n gemmlowp::StartProfiling();\n#endif\n\n double starttime = time();\n while (time() < starttime + mintime) {\n gemm_times.push_back(\n time_for_gemms<LhsType, RhsType, ResultType>(context, googlenet_gemms));\n }\n\n#ifdef GEMMLOWP_TEST_PROFILE\n gemmlowp::FinishProfiling();\n#endif\n\n std::sort(gemm_times.begin(), gemm_times.end());\n const std::size_t omit = gemm_times.size() \/ 4;\n float sum = 0;\n float count = 0;\n for (std::size_t i = omit; i < gemm_times.size() - omit; i++) {\n sum += gemm_times[i];\n count++;\n }\n const float avg = sum \/ count;\n const float ms_per_network = avg * 1000.0f;\n std::cout.precision(4);\n std::cout << \"GoogLeNet GEMMs took \" << ms_per_network << \"ms\" << std::endl;\n}\n\n} \/\/ end namespace gemmlowp\n\nint main() {\n if (1) {\n gemmlowp::GemmContext context;\n std::cout << \"Benchmarking typical GoogLeNet GEMMs...\" << std::endl;\n gemmlowp::benchmark_googlenet(&context);\n }\n\n if (0) {\n gemmlowp::GemmContext context;\n std::cout << \"Benchmarking default mode (typically multi-threaded)...\"\n << std::endl;\n gemmlowp::benchmark(&context);\n }\n\n {\n gemmlowp::GemmContext context;\n context.set_max_num_threads(1);\n std::cout << \"Benchmarking single-threaded mode...\" << std::endl;\n gemmlowp::benchmark(&context);\n }\n}\n<commit_msg>oops, unwanted changes<commit_after>\/\/ Copyright 2015 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 <unistd.h>\n#ifdef __APPLE__\n#include <sys\/time.h>\n#endif\n\n#include <iostream>\n#include <ctime>\n#include <cstdint>\n#include <vector>\n#include <map>\n#include <cstdlib>\n\n#include \"test.h\"\n#include \"..\/public\/gemmlowp.h\"\n\n#ifndef GEMMLOWP_TEST_BIT_DEPTH\n#define GEMMLOWP_TEST_BIT_DEPTH L8R8\n#endif\n\n#if defined(__arm__) && !defined(GEMMLOWP_NEON)\n#warning \"Building without NEON support on ARM, check your compiler setup!\"\n#endif\n\nnamespace gemmlowp {\n\ndouble time() {\n#ifdef __APPLE__\n timeval t;\n gettimeofday(&t, nullptr);\n return t.tv_sec + 1e-6 * t.tv_usec;\n#else\n timespec t;\n clock_gettime(CLOCK_REALTIME, &t);\n return t.tv_sec + 1e-9 * t.tv_nsec;\n#endif\n}\n\nconst double min_accurate_duration = 1e-1;\nconst std::size_t min_working_set_size = 16 * 1024 * 1024;\n\nstruct gemm_t {\n int rows, depth, cols;\n gemm_t() : rows(0), depth(0), cols(0) {}\n gemm_t(int r, int d, int c) : rows(r), depth(d), cols(c) {}\n};\n\nbool operator<(const gemm_t& a, const gemm_t& b) {\n return a.rows < b.rows ||\n (a.rows <= b.rows &&\n (a.depth < b.depth || (a.depth <= b.depth && (a.cols < b.cols))));\n}\n\ntemplate <typename LhsType, typename RhsType, typename ResultType>\ndouble time_for_gemms(GemmContext* context, const std::vector<gemm_t>& gemms) {\n typedef std::uint8_t Scalar;\n\n \/\/ set up the matrix pool\n\n std::size_t combined_gemm_sizes = 0;\n for (auto gemm : gemms) {\n int rows = gemm.rows;\n int depth = gemm.depth;\n int cols = gemm.cols;\n combined_gemm_sizes +=\n sizeof(Scalar) * (rows * depth + depth * cols + rows * cols);\n }\n\n const std::size_t pool_size = 1 + min_working_set_size \/ combined_gemm_sizes;\n\n std::vector<LhsType> lhs(pool_size * gemms.size());\n std::vector<RhsType> rhs(pool_size * gemms.size());\n std::vector<ResultType> result(pool_size * gemms.size());\n\n for (std::size_t i = 0; i < pool_size; i++) {\n for (std::size_t j = 0; j < gemms.size(); j++) {\n int k = i * gemms.size() + j;\n lhs[k].Resize(gemms[j].rows, gemms[j].depth);\n MakeConstant(&lhs[k], 0);\n rhs[k].Resize(gemms[j].depth, gemms[j].cols);\n MakeConstant(&rhs[k], 0);\n result[k].Resize(gemms[j].rows, gemms[j].cols);\n MakeConstant(&result[k], 0);\n }\n }\n\n \/\/ main benchmark loop\n\n int iters_at_a_time = 1;\n float time_per_iter = 0.0f;\n std::size_t pool_index = 0;\n\n while (true) {\n double starttime = time();\n for (int i = 0; i < iters_at_a_time; i++) {\n for (int j = 0; j < gemms.size(); j++) {\n int k = pool_index * gemms.size() + j;\n Gemm<std::uint8_t, BitDepthSetting::GEMMLOWP_TEST_BIT_DEPTH>(\n context, lhs[k].const_map(), rhs[k].const_map(), &result[k].map(),\n -75, -91, 74980, 123, 20);\n }\n pool_index++;\n if (pool_index == pool_size) {\n pool_index = 0;\n }\n }\n double endtime = time();\n\n const float timing = static_cast<float>(endtime - starttime);\n\n if (timing >= min_accurate_duration) {\n time_per_iter = timing \/ iters_at_a_time;\n break;\n }\n\n iters_at_a_time *= 2;\n }\n\n return time_per_iter;\n}\n\ntemplate <typename LhsType, typename RhsType, typename ResultType>\ndouble gflops_for_gemms(GemmContext* context,\n const std::vector<gemm_t>& gemms) {\n const double time_per_iter =\n time_for_gemms<LhsType, RhsType, ResultType>(context, gemms);\n double ops = 0;\n for (auto gemm : gemms) {\n ops += 2.0 * gemm.rows * gemm.depth * gemm.cols;\n }\n return 1e-9 * ops \/ time_per_iter;\n}\n\nvoid benchmark(GemmContext* context) {\n std::map<gemm_t, std::vector<double>> benchmark_results;\n\n std::vector<gemm_t> benchmark_gemms;\n benchmark_gemms.emplace_back(10, 10, 10);\n benchmark_gemms.emplace_back(20, 20, 20);\n benchmark_gemms.emplace_back(30, 30, 30);\n benchmark_gemms.emplace_back(40, 40, 40);\n benchmark_gemms.emplace_back(50, 50, 50);\n benchmark_gemms.emplace_back(60, 60, 60);\n benchmark_gemms.emplace_back(64, 256, 147);\n benchmark_gemms.emplace_back(100, 100, 1);\n benchmark_gemms.emplace_back(100, 100, 100);\n benchmark_gemms.emplace_back(100, 1000, 100);\n benchmark_gemms.emplace_back(1000, 1000, 1);\n benchmark_gemms.emplace_back(1000, 1000, 10);\n benchmark_gemms.emplace_back(1000, 1000, 100);\n benchmark_gemms.emplace_back(1000, 1000, 1000);\n\n const int repeat = 2;\n\n typedef Matrix<std::uint8_t, MapOrder::RowMajor> LhsType;\n typedef Matrix<std::uint8_t, MapOrder::ColMajor> RhsType;\n typedef Matrix<std::uint8_t, MapOrder::ColMajor> ResultType;\n\n#ifdef GEMMLOWP_TEST_PROFILE\n gemmlowp::RegisterCurrentThreadForProfiling();\n gemmlowp::StartProfiling();\n#endif\n\n \/\/ We don't record the first repetition, it's just warm-up.\n for (int r = 0; r < repeat + 1; r++) {\n std::cout << \"repetition \" << r + 1 << \"\/\" << repeat + 1 << \"...\\r\"\n << std::flush;\n for (auto gemm : benchmark_gemms) {\n double gflops = 0;\n std::vector<gemm_t> unique_gemm;\n unique_gemm.push_back(gemm);\n gflops =\n gflops_for_gemms<LhsType, RhsType, ResultType>(context, unique_gemm);\n if (r > 0) {\n benchmark_results[gemm].emplace_back(gflops);\n }\n }\n }\n\n#ifdef GEMMLOWP_TEST_PROFILE\n gemmlowp::FinishProfiling();\n#endif\n\n std::cout << \" \\r\"\n << std::flush;\n\n std::cout.precision(4);\n\n for (auto b : benchmark_results) {\n sort(b.second.begin(), b.second.end());\n std::cout << b.first.rows << \"x\" << b.first.depth << \"x\" << b.first.cols\n << \" : \" << b.second.back() << \" GFlops\/s\" << std::endl;\n }\n std::cout << std::endl;\n}\n\nvoid benchmark_googlenet(GemmContext* context) {\n \/\/ These are the m, n, k sizes for a typical GoogLeNet.\n const int googlenet_gemm_sizes[] = {\n 12544, 64, 147, 3136, 64, 64, 3136, 192, 576, 784, 64, 192,\n 784, 96, 192, 784, 128, 864, 784, 16, 192, 784, 32, 400,\n 784, 32, 192, 784, 128, 256, 784, 128, 256, 784, 192, 1152,\n 784, 32, 256, 784, 96, 800, 784, 64, 256, 196, 192, 480,\n 196, 96, 480, 196, 204, 864, 196, 16, 480, 196, 48, 400,\n 196, 64, 480, 196, 160, 508, 196, 112, 508, 196, 224, 1008,\n 196, 24, 508, 196, 64, 600, 196, 64, 508, 196, 128, 512,\n 196, 128, 512, 196, 256, 1152, 196, 24, 512, 196, 64, 600,\n 196, 64, 512, 196, 112, 512, 196, 144, 512, 196, 288, 1296,\n 196, 32, 512, 196, 64, 800, 196, 64, 512, 196, 256, 528,\n 196, 160, 528, 196, 320, 1440, 196, 32, 528, 196, 128, 800,\n 196, 128, 528, 49, 256, 832, 49, 160, 832, 49, 320, 1440,\n 49, 48, 832, 49, 128, 1200, 49, 128, 832, 49, 384, 832,\n 49, 192, 832, 49, 384, 1728, 49, 48, 832, 49, 128, 1200,\n 49, 128, 832, 16, 128, 508, 1, 1024, 2048, 1, 1008, 1024,\n 16, 128, 528, 1, 1024, 2048, 1, 1008, 1024, 1, 1008, 1024,\n };\n assert(sizeof(googlenet_gemm_sizes) % (3 * sizeof(googlenet_gemm_sizes[0])) ==\n 0);\n const std::size_t num_googlenet_gemms =\n sizeof(googlenet_gemm_sizes) \/ (3 * sizeof(googlenet_gemm_sizes[0]));\n\n std::vector<gemm_t> googlenet_gemms(num_googlenet_gemms);\n for (std::size_t i = 0; i < num_googlenet_gemms; i++) {\n googlenet_gemms[i].rows = googlenet_gemm_sizes[3 * i + 1];\n googlenet_gemms[i].depth = googlenet_gemm_sizes[3 * i + 2];\n googlenet_gemms[i].cols = googlenet_gemm_sizes[3 * i + 0];\n }\n\n typedef Matrix<std::uint8_t, MapOrder::RowMajor> LhsType;\n typedef Matrix<std::uint8_t, MapOrder::ColMajor> RhsType;\n typedef Matrix<std::uint8_t, MapOrder::ColMajor> ResultType;\n\n std::vector<float> gemm_times;\n const double mintime = 20.0;\n std::cout << \"running for \" << mintime << \" seconds...\" << std::endl;\n\n#ifdef GEMMLOWP_TEST_PROFILE\n gemmlowp::RegisterCurrentThreadForProfiling();\n gemmlowp::StartProfiling();\n#endif\n\n double starttime = time();\n while (time() < starttime + mintime) {\n gemm_times.push_back(\n time_for_gemms<LhsType, RhsType, ResultType>(context, googlenet_gemms));\n }\n\n#ifdef GEMMLOWP_TEST_PROFILE\n gemmlowp::FinishProfiling();\n#endif\n\n std::sort(gemm_times.begin(), gemm_times.end());\n const std::size_t omit = gemm_times.size() \/ 4;\n float sum = 0;\n float count = 0;\n for (std::size_t i = omit; i < gemm_times.size() - omit; i++) {\n sum += gemm_times[i];\n count++;\n }\n const float avg = sum \/ count;\n const float ms_per_network = avg * 1000.0f;\n std::cout.precision(4);\n std::cout << \"GoogLeNet GEMMs took \" << ms_per_network << \"ms\" << std::endl;\n}\n\n} \/\/ end namespace gemmlowp\n\nint main() {\n {\n gemmlowp::GemmContext context;\n std::cout << \"Benchmarking typical GoogLeNet GEMMs...\" << std::endl;\n gemmlowp::benchmark_googlenet(&context);\n }\n\n {\n gemmlowp::GemmContext context;\n std::cout << \"Benchmarking default mode (typically multi-threaded)...\"\n << std::endl;\n gemmlowp::benchmark(&context);\n }\n\n {\n gemmlowp::GemmContext context;\n context.set_max_num_threads(1);\n std::cout << \"Benchmarking single-threaded mode...\" << std::endl;\n gemmlowp::benchmark(&context);\n }\n}\n<|endoftext|>"} {"text":"<commit_before>\/\/ Copyright 2014 The Chromium Authors. All rights reserved.\n\/\/ Use of this source code is governed by a BSD-style license that can be\n\/\/ found in the LICENSE file.\n\n#include \"components\/domain_reliability\/util.h\"\n\n#include \"base\/callback.h\"\n#include \"base\/logging.h\"\n#include \"base\/memory\/weak_ptr.h\"\n#include \"base\/strings\/stringprintf.h\"\n#include \"base\/time\/time.h\"\n#include \"base\/timer\/timer.h\"\n#include \"net\/base\/net_errors.h\"\n\nnamespace domain_reliability {\n\nnamespace {\n\nclass ActualTimer : public MockableTime::Timer {\n public:\n \/\/ Initialize base timer with retain_user_info and is_repeating false.\n ActualTimer() : base_timer_(false, false) {}\n\n virtual ~ActualTimer() {}\n\n \/\/ MockableTime::Timer implementation:\n virtual void Start(const tracked_objects::Location& posted_from,\n base::TimeDelta delay,\n const base::Closure& user_task) OVERRIDE {\n base_timer_.Start(posted_from, delay, user_task);\n }\n\n virtual void Stop() OVERRIDE {\n base_timer_.Stop();\n }\n\n virtual bool IsRunning() OVERRIDE {\n return base_timer_.IsRunning();\n }\n\n private:\n base::Timer base_timer_;\n};\n\nconst struct NetErrorMapping {\n int net_error;\n const char* beacon_status;\n} net_error_map[] = {\n { net::OK, \"ok\" },\n { net::ERR_TIMED_OUT, \"tcp.connection.timed_out\" },\n { net::ERR_CONNECTION_CLOSED, \"tcp.connection.closed\" },\n { net::ERR_CONNECTION_RESET, \"tcp.connection.reset\" },\n { net::ERR_CONNECTION_REFUSED, \"tcp.connection.refused\" },\n { net::ERR_CONNECTION_ABORTED, \"tcp.connection.aborted\" },\n { net::ERR_CONNECTION_FAILED, \"tcp.connection.failed\" },\n { net::ERR_NAME_NOT_RESOLVED, \"dns\" },\n { net::ERR_SSL_PROTOCOL_ERROR, \"ssl.protocol.error\" },\n { net::ERR_ADDRESS_INVALID, \"tcp.connection.address_invalid\" },\n { net::ERR_ADDRESS_UNREACHABLE, \"tcp.connection.address_unreachable\" },\n { net::ERR_CONNECTION_TIMED_OUT, \"tcp.connection.timed_out\" },\n { net::ERR_NAME_RESOLUTION_FAILED, \"dns\" },\n { net::ERR_SSL_PINNED_KEY_NOT_IN_CERT_CHAIN,\n \"ssl.pinned_key_not_in_cert_chain\" },\n { net::ERR_CERT_COMMON_NAME_INVALID, \"ssl.cert.name_invalid\" },\n { net::ERR_CERT_DATE_INVALID, \"ssl.cert.date_invalid\" },\n { net::ERR_CERT_AUTHORITY_INVALID, \"ssl.cert.authority_invalid\" },\n { net::ERR_CERT_REVOKED, \"ssl.cert.revoked\" },\n { net::ERR_CERT_INVALID, \"ssl.cert.invalid\" },\n { net::ERR_EMPTY_RESPONSE, \"http.empty_response\" },\n { net::ERR_SPDY_PING_FAILED, \"spdy.ping_failed\" },\n { net::ERR_SPDY_PROTOCOL_ERROR, \"spdy.protocol\" },\n { net::ERR_QUIC_PROTOCOL_ERROR, \"quic.protocol\" },\n { net::ERR_DNS_MALFORMED_RESPONSE, \"dns.protocol\" },\n { net::ERR_DNS_SERVER_FAILED, \"dns.server\" },\n { net::ERR_DNS_TIMED_OUT, \"dns.timed_out\" },\n};\n\n} \/\/ namespace\n\n\/\/ static\nbool GetDomainReliabilityBeaconStatus(\n int net_error,\n int http_response_code,\n std::string* beacon_status_out) {\n if (net_error == net::OK) {\n if (http_response_code >= 400 && http_response_code < 600)\n *beacon_status_out = base::StringPrintf(\"http.%d\", http_response_code);\n else\n *beacon_status_out = \"ok\";\n return true;\n }\n\n \/\/ TODO(ttuttle): Consider sorting and using binary search?\n for (size_t i = 0; i < arraysize(net_error_map); i++) {\n if (net_error_map[i].net_error == net_error) {\n *beacon_status_out = net_error_map[i].beacon_status;\n return true;\n }\n }\n return false;\n}\n\n\/\/ TODO(ttuttle): Consider using NPN\/ALPN instead, if there's a good way to\n\/\/ differentiate HTTP and HTTPS.\nstd::string GetDomainReliabilityProtocol(\n net::HttpResponseInfo::ConnectionInfo connection_info,\n bool ssl_info_populated) {\n switch (connection_info) {\n case net::HttpResponseInfo::CONNECTION_INFO_UNKNOWN:\n return \"\";\n case net::HttpResponseInfo::CONNECTION_INFO_HTTP1:\n return ssl_info_populated ? \"HTTPS\" : \"HTTP\";\n case net::HttpResponseInfo::CONNECTION_INFO_DEPRECATED_SPDY2:\n case net::HttpResponseInfo::CONNECTION_INFO_SPDY3:\n case net::HttpResponseInfo::CONNECTION_INFO_SPDY4:\n return \"SPDY\";\n case net::HttpResponseInfo::CONNECTION_INFO_QUIC1_SPDY3:\n return \"QUIC\";\n case net::HttpResponseInfo::NUM_OF_CONNECTION_INFOS:\n NOTREACHED();\n return \"\";\n }\n NOTREACHED();\n return \"\";\n}\n\nMockableTime::Timer::~Timer() {}\nMockableTime::Timer::Timer() {}\n\nMockableTime::~MockableTime() {}\nMockableTime::MockableTime() {}\n\nActualTime::ActualTime() {}\nActualTime::~ActualTime() {}\n\nbase::Time ActualTime::Now() { return base::Time::Now(); }\nbase::TimeTicks ActualTime::NowTicks() { return base::TimeTicks::Now(); }\n\nscoped_ptr<MockableTime::Timer> ActualTime::CreateTimer() {\n return scoped_ptr<MockableTime::Timer>(new ActualTimer());\n}\n\n} \/\/ namespace domain_reliability\n<commit_msg>Domain Reliability: Return http.error for HTTP errors<commit_after>\/\/ Copyright 2014 The Chromium Authors. All rights reserved.\n\/\/ Use of this source code is governed by a BSD-style license that can be\n\/\/ found in the LICENSE file.\n\n#include \"components\/domain_reliability\/util.h\"\n\n#include \"base\/callback.h\"\n#include \"base\/logging.h\"\n#include \"base\/memory\/weak_ptr.h\"\n#include \"base\/time\/time.h\"\n#include \"base\/timer\/timer.h\"\n#include \"net\/base\/net_errors.h\"\n\nnamespace domain_reliability {\n\nnamespace {\n\nclass ActualTimer : public MockableTime::Timer {\n public:\n \/\/ Initialize base timer with retain_user_info and is_repeating false.\n ActualTimer() : base_timer_(false, false) {}\n\n virtual ~ActualTimer() {}\n\n \/\/ MockableTime::Timer implementation:\n virtual void Start(const tracked_objects::Location& posted_from,\n base::TimeDelta delay,\n const base::Closure& user_task) OVERRIDE {\n base_timer_.Start(posted_from, delay, user_task);\n }\n\n virtual void Stop() OVERRIDE {\n base_timer_.Stop();\n }\n\n virtual bool IsRunning() OVERRIDE {\n return base_timer_.IsRunning();\n }\n\n private:\n base::Timer base_timer_;\n};\n\nconst struct NetErrorMapping {\n int net_error;\n const char* beacon_status;\n} net_error_map[] = {\n { net::OK, \"ok\" },\n { net::ERR_TIMED_OUT, \"tcp.connection.timed_out\" },\n { net::ERR_CONNECTION_CLOSED, \"tcp.connection.closed\" },\n { net::ERR_CONNECTION_RESET, \"tcp.connection.reset\" },\n { net::ERR_CONNECTION_REFUSED, \"tcp.connection.refused\" },\n { net::ERR_CONNECTION_ABORTED, \"tcp.connection.aborted\" },\n { net::ERR_CONNECTION_FAILED, \"tcp.connection.failed\" },\n { net::ERR_NAME_NOT_RESOLVED, \"dns\" },\n { net::ERR_SSL_PROTOCOL_ERROR, \"ssl.protocol.error\" },\n { net::ERR_ADDRESS_INVALID, \"tcp.connection.address_invalid\" },\n { net::ERR_ADDRESS_UNREACHABLE, \"tcp.connection.address_unreachable\" },\n { net::ERR_CONNECTION_TIMED_OUT, \"tcp.connection.timed_out\" },\n { net::ERR_NAME_RESOLUTION_FAILED, \"dns\" },\n { net::ERR_SSL_PINNED_KEY_NOT_IN_CERT_CHAIN,\n \"ssl.pinned_key_not_in_cert_chain\" },\n { net::ERR_CERT_COMMON_NAME_INVALID, \"ssl.cert.name_invalid\" },\n { net::ERR_CERT_DATE_INVALID, \"ssl.cert.date_invalid\" },\n { net::ERR_CERT_AUTHORITY_INVALID, \"ssl.cert.authority_invalid\" },\n { net::ERR_CERT_REVOKED, \"ssl.cert.revoked\" },\n { net::ERR_CERT_INVALID, \"ssl.cert.invalid\" },\n { net::ERR_EMPTY_RESPONSE, \"http.empty_response\" },\n { net::ERR_SPDY_PING_FAILED, \"spdy.ping_failed\" },\n { net::ERR_SPDY_PROTOCOL_ERROR, \"spdy.protocol\" },\n { net::ERR_QUIC_PROTOCOL_ERROR, \"quic.protocol\" },\n { net::ERR_DNS_MALFORMED_RESPONSE, \"dns.protocol\" },\n { net::ERR_DNS_SERVER_FAILED, \"dns.server\" },\n { net::ERR_DNS_TIMED_OUT, \"dns.timed_out\" },\n};\n\n} \/\/ namespace\n\n\/\/ static\nbool GetDomainReliabilityBeaconStatus(\n int net_error,\n int http_response_code,\n std::string* beacon_status_out) {\n if (net_error == net::OK) {\n if (http_response_code >= 400 && http_response_code < 600)\n *beacon_status_out = \"http.error\";\n else\n *beacon_status_out = \"ok\";\n return true;\n }\n\n \/\/ TODO(ttuttle): Consider sorting and using binary search?\n for (size_t i = 0; i < arraysize(net_error_map); i++) {\n if (net_error_map[i].net_error == net_error) {\n *beacon_status_out = net_error_map[i].beacon_status;\n return true;\n }\n }\n return false;\n}\n\n\/\/ TODO(ttuttle): Consider using NPN\/ALPN instead, if there's a good way to\n\/\/ differentiate HTTP and HTTPS.\nstd::string GetDomainReliabilityProtocol(\n net::HttpResponseInfo::ConnectionInfo connection_info,\n bool ssl_info_populated) {\n switch (connection_info) {\n case net::HttpResponseInfo::CONNECTION_INFO_UNKNOWN:\n return \"\";\n case net::HttpResponseInfo::CONNECTION_INFO_HTTP1:\n return ssl_info_populated ? \"HTTPS\" : \"HTTP\";\n case net::HttpResponseInfo::CONNECTION_INFO_DEPRECATED_SPDY2:\n case net::HttpResponseInfo::CONNECTION_INFO_SPDY3:\n case net::HttpResponseInfo::CONNECTION_INFO_SPDY4:\n return \"SPDY\";\n case net::HttpResponseInfo::CONNECTION_INFO_QUIC1_SPDY3:\n return \"QUIC\";\n case net::HttpResponseInfo::NUM_OF_CONNECTION_INFOS:\n NOTREACHED();\n return \"\";\n }\n NOTREACHED();\n return \"\";\n}\n\nMockableTime::Timer::~Timer() {}\nMockableTime::Timer::Timer() {}\n\nMockableTime::~MockableTime() {}\nMockableTime::MockableTime() {}\n\nActualTime::ActualTime() {}\nActualTime::~ActualTime() {}\n\nbase::Time ActualTime::Now() { return base::Time::Now(); }\nbase::TimeTicks ActualTime::NowTicks() { return base::TimeTicks::Now(); }\n\nscoped_ptr<MockableTime::Timer> ActualTime::CreateTimer() {\n return scoped_ptr<MockableTime::Timer>(new ActualTimer());\n}\n\n} \/\/ namespace domain_reliability\n<|endoftext|>"} {"text":"<commit_before><commit_msg>Silent debug by default<commit_after><|endoftext|>"} {"text":"<commit_before>\/*******************************************************************************\n * test\/bit_copy.cpp\n *\n * Copyright (C) 2017 Marvin Löbel <loebel.marvin@gmail.com>\n *\n * All rights reserved. Published under the BSD-2 license in the LICENSE file.\n ******************************************************************************\/\n\n#include <gtest\/gtest.h>\n\n#include \"test\/util.hpp\"\n#include \"util\/merge.hpp\"\n#include \"util\/debug.hpp\"\n\nvoid bit_compare(\n std::vector<uint8_t> const& left,\n std::vector<uint8_t> const& right\n) {\n auto left_s = bit_string<uint8_t>(left, left.size());\n auto right_s = bit_string<uint8_t>(right, right.size());\n\n if (left_s != right_s) {\n auto diff = std::string(std::max(left_s.size(), right_s.size()), ' ');\n\n size_t i = 0;\n for(; i < std::min(left_s.size(), right_s.size()); i++) {\n if (left_s[i] != right_s[i]) {\n diff[i] = '#';\n }\n }\n for(; i < std::max(left_s.size(), right_s.size()); i++) {\n diff[i] = '#';\n }\n\n std::stringstream ss;\n ss << \"left: \" << left_s << \"\\n\";\n ss << \"right: \" << right_s << \"\\n\";\n ss << \"diff: \" << diff << \"\\n\";\n\n ASSERT_TRUE(left_s == right_s) << ss.str();\n }\n\n}\n\nTEST(BitCopy, test0) {\n auto const src = std::vector<uint8_t> {\n 0b00000000,0b01101011,0b00000000,0b000'10100,0b10001101,0b10011101,0b00101'000,\n };\n auto dst = std::vector<uint8_t> {\n 0b00000000,0b00000000,0b00000000,0b00000000,0b00000000,0b00000000,0b00000000,\n };\n auto test = [&](size_t dst_off, size_t src_off, size_t block_size) {\n copy_bits<uint8_t>(dst.data(), src.data(), dst_off, src_off, block_size);\n };\n\n \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n test(3, 9, 7);\n bit_compare(dst, std::vector<uint8_t> {\n 0b00011010,0b11000000,0b00000000,0b00000000,0b00000000,0b00000000,0b00000000,\n });\n\n test(0, 27, 3);\n bit_compare(dst, std::vector<uint8_t> {\n 0b10111010,0b11000000,0b00000000,0b00000000,0b00000000,0b00000000,0b00000000,\n });\n\n test(10, 27, 26);\n bit_compare(dst, std::vector<uint8_t> {\n 0b10111010,0b11'101001,0b00011011,0b00111010,0b01010000,0b00000000,0b00000000,\n\/\/ 101001 00011011 00111010 0101\n });\n\n \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n}\n\nTEST(BitCopy, test1) {\n auto const src = std::vector<uint8_t> {\n 0b11111111,0b11111111,0b11111111,0b11111111,0b11111111,0b11111111,0b11111111,\n };\n auto dst = std::vector<uint8_t> {\n 0b00000000,0b00000000,0b00000000,0b00000000,0b00000000,0b00000000,0b00000000,\n };\n auto test = [&](size_t dst_off, size_t src_off, size_t block_size) {\n copy_bits<uint8_t>(dst.data(), src.data(), dst_off, src_off, block_size);\n };\n\n \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n test(3, 9, 25);\n bit_compare(dst, std::vector<uint8_t> {\n 0b00011111,0b11111111,0b11111111,0b11110000,0b00000000,0b00000000,0b00000000,\n });\n\n test(34, 34, 16);\n bit_compare(dst, std::vector<uint8_t> {\n 0b00011111,0b11111111,0b11111111,0b11110000,0b00111111,0b11111111,0b11000000,\n });\n\n \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n}\n\nTEST(BitCopy, test2) {\n auto const src = std::vector<uint8_t> {\n 0b11111111,0b11111111,0b11111111,0b11111111,0b11111111,0b11111111,0b11111111,\n };\n auto dst = std::vector<uint8_t> {\n 0b00000000,0b00000000,0b00000000,0b00000000,0b00000000,0b00000000,0b00000000,\n };\n auto test = [&](size_t dst_off, size_t src_off, size_t block_size) {\n copy_bits<uint8_t>(dst.data(), src.data(), dst_off, src_off, block_size);\n };\n\n \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n test(32, 32, 16);\n bit_compare(dst, std::vector<uint8_t> {\n 0b00000000,0b00000000,0b00000000,0b00000000,0b11111111,0b11111111,0b00000000,\n });\n\n \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n}\n\nTEST(BitCopy, env_debug) {\n std::cout << \"size_t size: \" << sizeof(size_t) * CHAR_BIT << \"\\n\";\n std::cout << \"omp size: \" << omp_get_max_threads() << \"\\n\";\n}\n\n\/******************************************************************************\/\n<commit_msg>Remove unnecessary output<commit_after>\/*******************************************************************************\n * test\/bit_copy.cpp\n *\n * Copyright (C) 2017 Marvin Löbel <loebel.marvin@gmail.com>\n *\n * All rights reserved. Published under the BSD-2 license in the LICENSE file.\n ******************************************************************************\/\n\n#include <gtest\/gtest.h>\n\n#include \"test\/util.hpp\"\n#include \"util\/merge.hpp\"\n#include \"util\/debug.hpp\"\n\nvoid bit_compare(\n std::vector<uint8_t> const& left,\n std::vector<uint8_t> const& right\n) {\n auto left_s = bit_string<uint8_t>(left, left.size());\n auto right_s = bit_string<uint8_t>(right, right.size());\n\n if (left_s != right_s) {\n auto diff = std::string(std::max(left_s.size(), right_s.size()), ' ');\n\n size_t i = 0;\n for(; i < std::min(left_s.size(), right_s.size()); i++) {\n if (left_s[i] != right_s[i]) {\n diff[i] = '#';\n }\n }\n for(; i < std::max(left_s.size(), right_s.size()); i++) {\n diff[i] = '#';\n }\n\n std::stringstream ss;\n ss << \"left: \" << left_s << \"\\n\";\n ss << \"right: \" << right_s << \"\\n\";\n ss << \"diff: \" << diff << \"\\n\";\n\n ASSERT_TRUE(left_s == right_s) << ss.str();\n }\n\n}\n\nTEST(BitCopy, test0) {\n auto const src = std::vector<uint8_t> {\n 0b00000000,0b01101011,0b00000000,0b000'10100,0b10001101,0b10011101,0b00101'000,\n };\n auto dst = std::vector<uint8_t> {\n 0b00000000,0b00000000,0b00000000,0b00000000,0b00000000,0b00000000,0b00000000,\n };\n auto test = [&](size_t dst_off, size_t src_off, size_t block_size) {\n copy_bits<uint8_t>(dst.data(), src.data(), dst_off, src_off, block_size);\n };\n\n \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n test(3, 9, 7);\n bit_compare(dst, std::vector<uint8_t> {\n 0b00011010,0b11000000,0b00000000,0b00000000,0b00000000,0b00000000,0b00000000,\n });\n\n test(0, 27, 3);\n bit_compare(dst, std::vector<uint8_t> {\n 0b10111010,0b11000000,0b00000000,0b00000000,0b00000000,0b00000000,0b00000000,\n });\n\n test(10, 27, 26);\n bit_compare(dst, std::vector<uint8_t> {\n 0b10111010,0b11'101001,0b00011011,0b00111010,0b01010000,0b00000000,0b00000000,\n\/\/ 101001 00011011 00111010 0101\n });\n\n \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n}\n\nTEST(BitCopy, test1) {\n auto const src = std::vector<uint8_t> {\n 0b11111111,0b11111111,0b11111111,0b11111111,0b11111111,0b11111111,0b11111111,\n };\n auto dst = std::vector<uint8_t> {\n 0b00000000,0b00000000,0b00000000,0b00000000,0b00000000,0b00000000,0b00000000,\n };\n auto test = [&](size_t dst_off, size_t src_off, size_t block_size) {\n copy_bits<uint8_t>(dst.data(), src.data(), dst_off, src_off, block_size);\n };\n\n \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n test(3, 9, 25);\n bit_compare(dst, std::vector<uint8_t> {\n 0b00011111,0b11111111,0b11111111,0b11110000,0b00000000,0b00000000,0b00000000,\n });\n\n test(34, 34, 16);\n bit_compare(dst, std::vector<uint8_t> {\n 0b00011111,0b11111111,0b11111111,0b11110000,0b00111111,0b11111111,0b11000000,\n });\n\n \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n}\n\nTEST(BitCopy, test2) {\n auto const src = std::vector<uint8_t> {\n 0b11111111,0b11111111,0b11111111,0b11111111,0b11111111,0b11111111,0b11111111,\n };\n auto dst = std::vector<uint8_t> {\n 0b00000000,0b00000000,0b00000000,0b00000000,0b00000000,0b00000000,0b00000000,\n };\n auto test = [&](size_t dst_off, size_t src_off, size_t block_size) {\n copy_bits<uint8_t>(dst.data(), src.data(), dst_off, src_off, block_size);\n };\n\n \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n test(32, 32, 16);\n bit_compare(dst, std::vector<uint8_t> {\n 0b00000000,0b00000000,0b00000000,0b00000000,0b11111111,0b11111111,0b00000000,\n });\n\n \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n}\n\n\/******************************************************************************\/\n<|endoftext|>"} {"text":"<commit_before>\n#include \"anh\/plugin\/plugin_manager.h\"\n\n#include <algorithm>\n#include <fstream>\n#include <iostream>\n\n#define BOOST_FILESYSTEM_VERSION 3\n\n#include <boost\/filesystem.hpp>\n#include <boost\/log\/trivial.hpp>\n#include <boost\/program_options.hpp>\n\n#include \"anh\/app\/kernel_interface.h\"\n\n#include \"anh\/plugin\/platform\/library_interface.h\"\n\n#ifdef WIN32\n#include \"anh\/plugin\/platform\/win32_library.h\"\ntypedef anh::plugin::platform::Win32Library DynamicLibrary;\n#else\n#include <dlfcn.h>\n#include \"anh\/plugin\/platform\/posix_library.h\"\ntypedef anh::plugin::platform::PosixLibrary DynamicLibrary;\n#endif\n\n#if defined(__APPLE__)\n static std::string library_extension(\".dylib\");\n#elif defined(WIN32)\n static std::string library_extension(\".dll\");\n#else\n static std::string library_extension(\".so\");\n#endif\n\nusing namespace anh::app;\nusing namespace anh::plugin;\nusing namespace boost::program_options;\nusing namespace std;\n\nPluginManager::PluginManager(KernelInterface* kernel)\n : kernel_(kernel) \n{\n#ifndef WIN32\n dlopen(NULL,RTLD_NOW|RTLD_GLOBAL);\n#endif\n}\n\nPluginManager::~PluginManager() { \n std::for_each(\n begin(exit_funcs_), \n end(exit_funcs_), \n [] (ExitFunc exit_func) \n {\n try {\n (*exit_func)();\n } catch(...) {\n \/\/ Report error here.\n }\n });\n}\n\nvoid PluginManager::LoadPlugin(const std::string& path) {\n if (library_map_.find(path) != library_map_.end()) {\n throw PluginLoadingError(\"Plugin has already been loaded [\"+ path + \"]\");\n }\n\n auto library = LoadLibrary_(path + library_extension);\n if (!library) {\n throw PluginLoadingError(\"Plugin failed to load [\"+ path + \"]\");\n }\n \n if (ConfigFunc config_func = library->GetSymbol<ConfigFunc>(\"ConfigurePlugin\")) {\n ConfigurePlugin(path, config_func);\n }\n\n InitFunc init_func = library->GetSymbol<InitFunc>(\"InitializePlugin\");\n if (!InitializePlugin(init_func)) {\n throw PluginLoadingError(\"Plugin failed to initialize [\"+ path + \"]\");\n }\n \n library_map_[path] = library;\n}\n\nvoid PluginManager::LoadAllPlugins(const std::string& directory) {\n boost::filesystem::path plugin_dir(directory);\n\n try {\n if (!boost::filesystem::exists(plugin_dir) ||\n !boost::filesystem::is_directory(plugin_dir)) {\n throw PluginLoadingError(\"Plugin failed to load [\"+ directory + \"]\");\n }\n\n std::for_each(boost::filesystem::directory_iterator(plugin_dir),\n boost::filesystem::directory_iterator(),\n [this] (const boost::filesystem::directory_entry& entry) \n { \n if (entry.path().extension() != library_extension) {\n return;\n }\n\n auto native_path = entry.path().native();\n\n this->LoadPlugin(string(native_path.begin(), native_path.end()));\n });\n\n } catch(const std::exception& e) {\n BOOST_LOG_TRIVIAL(fatal) << e.what();\n }\n}\n\nvoid PluginManager::ConfigurePlugin(std::string plugin_name, ConfigFunc config_func) {\n if (!config_func) {\n throw runtime_error(\"Unable to open the configuration file at: config\/swganh.cfg\");\n }\n\n ifstream config_file(\"config\/plugins\/\" + plugin_name + \"\/\" + plugin_name + \".cfg\");\n \n if (!config_file.is_open()) {\n throw runtime_error(\"Unable to open the configuration file at: config\/plugins\/\" + plugin_name + \".cfg\");\n }\n \n variables_map vm;\n options_description description;\n\n config_func(description);\n\n try {\n store(parse_config_file(config_file, description, true), vm);\n } catch(const std::exception& e) {\n throw runtime_error(\"Unable to parse the configuration file at: config\/plugins\/\" + plugin_name + \".cfg: \" + std::string(e.what()));\n }\n \n notify(vm);\n config_file.close();\n}\n\nbool PluginManager::InitializePlugin(InitFunc init_func) {\n if (!init_func) {\n return false;\n }\n\n ExitFunc exit_func = init_func(kernel_);\n\n if (!exit_func) {\n return false;\n }\n\n exit_funcs_.push_back(exit_func);\n\n return true;\n}\n\nbool PluginManager::RegisterObject(const std::string& name, const ObjectRegistration* registration) {\n if (name.empty()) {\n return false;\n }\n\n if (!registration || !registration->CreateObject || !registration->DestroyObject) {\n return false;\n }\n\n anh::app::Version version = kernel_->GetVersion();\n if (version.major != registration->version.major) {\n return false;\n }\n\n if (registration_map_.find(name) != registration_map_.end()) {\n return false;\n }\n\n registration_map_[name] = *registration;\n\n return true;\n}\n\nconst RegistrationMap& PluginManager::registration_map() {\n return registration_map_;\n}\n\nstd::shared_ptr<platform::LibraryInterface> PluginManager::LoadLibrary_(const std::string& path) {\n auto library = DynamicLibrary::Load(path);\n\n if (!library) {\n return nullptr;\n }\n\n return library;\n}\n<commit_msg>Removed explicit reference to filesystem version 3 (v3 is now the default in our minimum boost dependency)<commit_after>\n#include \"anh\/plugin\/plugin_manager.h\"\n\n#include <algorithm>\n#include <fstream>\n#include <iostream>\n\n#include <boost\/filesystem.hpp>\n#include <boost\/log\/trivial.hpp>\n#include <boost\/program_options.hpp>\n\n#include \"anh\/app\/kernel_interface.h\"\n\n#include \"anh\/plugin\/platform\/library_interface.h\"\n\n#ifdef WIN32\n#include \"anh\/plugin\/platform\/win32_library.h\"\ntypedef anh::plugin::platform::Win32Library DynamicLibrary;\n#else\n#include <dlfcn.h>\n#include \"anh\/plugin\/platform\/posix_library.h\"\ntypedef anh::plugin::platform::PosixLibrary DynamicLibrary;\n#endif\n\n#if defined(__APPLE__)\n static std::string library_extension(\".dylib\");\n#elif defined(WIN32)\n static std::string library_extension(\".dll\");\n#else\n static std::string library_extension(\".so\");\n#endif\n\nusing namespace anh::app;\nusing namespace anh::plugin;\nusing namespace boost::program_options;\nusing namespace std;\n\nPluginManager::PluginManager(KernelInterface* kernel)\n : kernel_(kernel) \n{\n#ifndef WIN32\n dlopen(NULL,RTLD_NOW|RTLD_GLOBAL);\n#endif\n}\n\nPluginManager::~PluginManager() { \n std::for_each(\n begin(exit_funcs_), \n end(exit_funcs_), \n [] (ExitFunc exit_func) \n {\n try {\n (*exit_func)();\n } catch(...) {\n \/\/ Report error here.\n }\n });\n}\n\nvoid PluginManager::LoadPlugin(const std::string& path) {\n if (library_map_.find(path) != library_map_.end()) {\n throw PluginLoadingError(\"Plugin has already been loaded [\"+ path + \"]\");\n }\n\n auto library = LoadLibrary_(path + library_extension);\n if (!library) {\n throw PluginLoadingError(\"Plugin failed to load [\"+ path + \"]\");\n }\n \n if (ConfigFunc config_func = library->GetSymbol<ConfigFunc>(\"ConfigurePlugin\")) {\n ConfigurePlugin(path, config_func);\n }\n\n InitFunc init_func = library->GetSymbol<InitFunc>(\"InitializePlugin\");\n if (!InitializePlugin(init_func)) {\n throw PluginLoadingError(\"Plugin failed to initialize [\"+ path + \"]\");\n }\n \n library_map_[path] = library;\n}\n\nvoid PluginManager::LoadAllPlugins(const std::string& directory) {\n boost::filesystem::path plugin_dir(directory);\n\n try {\n if (!boost::filesystem::exists(plugin_dir) ||\n !boost::filesystem::is_directory(plugin_dir)) {\n throw PluginLoadingError(\"Plugin failed to load [\"+ directory + \"]\");\n }\n\n std::for_each(boost::filesystem::directory_iterator(plugin_dir),\n boost::filesystem::directory_iterator(),\n [this] (const boost::filesystem::directory_entry& entry) \n { \n if (entry.path().extension() != library_extension) {\n return;\n }\n\n auto native_path = entry.path().native();\n\n this->LoadPlugin(string(native_path.begin(), native_path.end()));\n });\n\n } catch(const std::exception& e) {\n BOOST_LOG_TRIVIAL(fatal) << e.what();\n }\n}\n\nvoid PluginManager::ConfigurePlugin(std::string plugin_name, ConfigFunc config_func) {\n if (!config_func) {\n throw runtime_error(\"Unable to open the configuration file at: config\/swganh.cfg\");\n }\n\n ifstream config_file(\"config\/plugins\/\" + plugin_name + \"\/\" + plugin_name + \".cfg\");\n \n if (!config_file.is_open()) {\n throw runtime_error(\"Unable to open the configuration file at: config\/plugins\/\" + plugin_name + \".cfg\");\n }\n \n variables_map vm;\n options_description description;\n\n config_func(description);\n\n try {\n store(parse_config_file(config_file, description, true), vm);\n } catch(const std::exception& e) {\n throw runtime_error(\"Unable to parse the configuration file at: config\/plugins\/\" + plugin_name + \".cfg: \" + std::string(e.what()));\n }\n \n notify(vm);\n config_file.close();\n}\n\nbool PluginManager::InitializePlugin(InitFunc init_func) {\n if (!init_func) {\n return false;\n }\n\n ExitFunc exit_func = init_func(kernel_);\n\n if (!exit_func) {\n return false;\n }\n\n exit_funcs_.push_back(exit_func);\n\n return true;\n}\n\nbool PluginManager::RegisterObject(const std::string& name, const ObjectRegistration* registration) {\n if (name.empty()) {\n return false;\n }\n\n if (!registration || !registration->CreateObject || !registration->DestroyObject) {\n return false;\n }\n\n anh::app::Version version = kernel_->GetVersion();\n if (version.major != registration->version.major) {\n return false;\n }\n\n if (registration_map_.find(name) != registration_map_.end()) {\n return false;\n }\n\n registration_map_[name] = *registration;\n\n return true;\n}\n\nconst RegistrationMap& PluginManager::registration_map() {\n return registration_map_;\n}\n\nstd::shared_ptr<platform::LibraryInterface> PluginManager::LoadLibrary_(const std::string& path) {\n auto library = DynamicLibrary::Load(path);\n\n if (!library) {\n return nullptr;\n }\n\n return library;\n}\n<|endoftext|>"} {"text":"<commit_before>\/\/ Copyright (c) 2010 The Chromium Authors. All rights reserved.\n\/\/ Use of this source code is governed by a BSD-style license that can be\n\/\/ found in the LICENSE file.\n\n#include \"webkit\/support\/webkit_support.h\"\n\n#include \"base\/at_exit.h\"\n#include \"base\/command_line.h\"\n#include \"base\/debug_util.h\"\n#include \"base\/file_path.h\"\n#include \"base\/file_util.h\"\n#include \"base\/i18n\/icu_util.h\"\n#include \"base\/message_loop.h\"\n#include \"base\/path_service.h\"\n#include \"base\/process_util.h\"\n#include \"base\/sys_string_conversions.h\"\n#include \"base\/utf_string_conversions.h\"\n#include \"base\/weak_ptr.h\"\n#include \"net\/base\/net_util.h\"\n#include \"third_party\/WebKit\/WebKit\/chromium\/public\/WebKit.h\"\n#include \"third_party\/WebKit\/WebKit\/chromium\/public\/WebPluginParams.h\"\n#include \"webkit\/appcache\/web_application_cache_host_impl.h\"\n#include \"webkit\/glue\/media\/buffered_data_source.h\"\n#include \"webkit\/glue\/media\/media_resource_loader_bridge_factory.h\"\n#include \"webkit\/glue\/media\/simple_data_source.h\"\n#include \"webkit\/glue\/media\/video_renderer_impl.h\"\n#include \"webkit\/glue\/plugins\/plugin_list.h\"\n#include \"webkit\/glue\/plugins\/webplugin_impl.h\"\n#include \"webkit\/glue\/plugins\/webplugin_page_delegate.h\"\n#include \"webkit\/glue\/plugins\/webplugininfo.h\"\n#include \"webkit\/glue\/webkitclient_impl.h\"\n#include \"webkit\/glue\/webmediaplayer_impl.h\"\n#include \"webkit\/support\/platform_support.h\"\n#include \"webkit\/support\/test_webplugin_page_delegate.h\"\n#include \"webkit\/support\/test_webkit_client.h\"\n#include \"webkit\/tools\/test_shell\/simple_database_system.h\"\n#include \"webkit\/tools\/test_shell\/simple_resource_loader_bridge.h\"\n\nusing WebKit::WebFrame;\nusing WebKit::WebMediaPlayerClient;\nusing WebKit::WebPlugin;\nusing WebKit::WebPluginParams;\nusing WebKit::WebString;\nusing WebKit::WebURL;\n\nnamespace {\n\nclass TestEnvironment {\n public:\n explicit TestEnvironment(bool unit_test_mode) {\n if (!unit_test_mode)\n at_exit_manager_.reset(new base::AtExitManager);\n main_message_loop_.reset(new MessageLoopForUI);\n \/\/ TestWebKitClient must be instantiated after the MessageLoopForUI.\n webkit_client_.reset(new TestWebKitClient);\n }\n\n ~TestEnvironment() {\n SimpleResourceLoaderBridge::Shutdown();\n }\n\n WebKit::WebKitClient* webkit_client() { return webkit_client_.get(); }\n\n#if defined(OS_WIN)\n void set_theme_engine(WebKit::WebThemeEngine* engine) {\n DCHECK(webkit_client_ != 0);\n webkit_client_->SetThemeEngine(engine);\n }\n\n WebKit::WebThemeEngine* theme_engine() {\n return webkit_client_->themeEngine();\n }\n#endif\n\n private:\n scoped_ptr<base::AtExitManager> at_exit_manager_;\n scoped_ptr<MessageLoopForUI> main_message_loop_;\n scoped_ptr<TestWebKitClient> webkit_client_;\n};\n\nclass WebPluginImplWithPageDelegate\n : public webkit_support::TestWebPluginPageDelegate,\n public base::SupportsWeakPtr<WebPluginImplWithPageDelegate>,\n public webkit_glue::WebPluginImpl {\n public:\n WebPluginImplWithPageDelegate(WebFrame* frame,\n const WebPluginParams& params,\n const FilePath& path,\n const std::string& mime_type)\n : webkit_support::TestWebPluginPageDelegate(),\n webkit_glue::WebPluginImpl(\n frame, params, path, mime_type, AsWeakPtr()) {}\n virtual ~WebPluginImplWithPageDelegate() {}\n private:\n DISALLOW_COPY_AND_ASSIGN(WebPluginImplWithPageDelegate);\n};\n\nFilePath GetWebKitRootDirFilePath() {\n FilePath basePath;\n PathService::Get(base::DIR_SOURCE_ROOT, &basePath);\n FilePath path = basePath.Append(FILE_PATH_LITERAL(\"third_party\/WebKit\"));\n if (!file_util::PathExists(path)) {\n \/\/ WebKit\/WebKit\/chromium\/ -> WebKit\/\n path = basePath.Append(FILE_PATH_LITERAL(\"..\/..\"));\n }\n return path;\n}\n\n} \/\/ namespace\n\nnamespace webkit_support {\n\nstatic TestEnvironment* test_environment;\n\nvoid SetUpTestEnvironment() {\n SetUpTestEnvironment(false);\n}\n\nvoid SetUpTestEnvironment(bool unit_test_mode) {\n base::EnableTerminationOnHeapCorruption();\n\n \/\/ Initialize the singleton CommandLine with fixed values. Some code refer to\n \/\/ CommandLine::ForCurrentProcess(). We don't use the actual command-line\n \/\/ arguments of DRT to avoid unexpected behavior change.\n \/\/\n \/\/ webkit\/glue\/webmediaplayer_impl.cc checks --enable-openmax.\n \/\/ webkit\/glue\/plugin\/plugin_list_posix.cc checks --debug-plugin-loading.\n \/\/ webkit\/glue\/plugin\/plugin_list_win.cc checks --old-wmp.\n \/\/ If DRT needs these flags, specify them in the following kFixedArguments.\n const char* kFixedArguments[] = {\"DumpRenderTree\"};\n CommandLine::Init(arraysize(kFixedArguments), kFixedArguments);\n\n BeforeInitialize();\n test_environment = new TestEnvironment(unit_test_mode);\n AfterInitialize();\n if (!unit_test_mode) {\n \/\/ Load ICU data tables. This has to run after TestEnvironment is created\n \/\/ because on Linux, we need base::AtExitManager.\n icu_util::Initialize();\n }\n}\n\nvoid TearDownTestEnvironment() {\n \/\/ Flush any remaining messages before we kill ourselves.\n \/\/ http:\/\/code.google.com\/p\/chromium\/issues\/detail?id=9500\n MessageLoop::current()->RunAllPending();\n\n BeforeShutdown();\n WebKit::shutdown();\n delete test_environment;\n test_environment = NULL;\n AfterShutdown();\n}\n\nWebKit::WebKitClient* GetWebKitClient() {\n DCHECK(test_environment);\n return test_environment->webkit_client();\n}\n\nWebPlugin* CreateWebPlugin(WebFrame* frame,\n const WebPluginParams& params) {\n const bool kAllowWildcard = true;\n WebPluginInfo info;\n std::string actual_mime_type;\n if (!NPAPI::PluginList::Singleton()->GetPluginInfo(\n params.url, params.mimeType.utf8(), kAllowWildcard, &info,\n &actual_mime_type)) {\n return NULL;\n }\n\n if (actual_mime_type.empty())\n actual_mime_type = params.mimeType.utf8();\n\n return new WebPluginImplWithPageDelegate(\n frame, params, info.path, actual_mime_type);\n}\n\nWebKit::WebMediaPlayer* CreateMediaPlayer(WebFrame* frame,\n WebMediaPlayerClient* client) {\n scoped_refptr<media::FilterFactoryCollection> factory =\n new media::FilterFactoryCollection();\n\n appcache::WebApplicationCacheHostImpl* appcache_host =\n appcache::WebApplicationCacheHostImpl::FromFrame(frame);\n\n \/\/ TODO(hclam): this is the same piece of code as in RenderView, maybe they\n \/\/ should be grouped together.\n webkit_glue::MediaResourceLoaderBridgeFactory* bridge_factory =\n new webkit_glue::MediaResourceLoaderBridgeFactory(\n GURL(), \/\/ referrer\n \"null\", \/\/ frame origin\n \"null\", \/\/ main_frame_origin\n base::GetCurrentProcId(),\n appcache_host ? appcache_host->host_id() : appcache::kNoHostId,\n 0);\n \/\/ A simple data source that keeps all data in memory.\n media::FilterFactory* simple_data_source_factory =\n webkit_glue::SimpleDataSource::CreateFactory(MessageLoop::current(),\n bridge_factory);\n \/\/ A sophisticated data source that does memory caching.\n media::FilterFactory* buffered_data_source_factory =\n webkit_glue::BufferedDataSource::CreateFactory(MessageLoop::current(),\n bridge_factory);\n factory->AddFactory(buffered_data_source_factory);\n factory->AddFactory(simple_data_source_factory);\n return new webkit_glue::WebMediaPlayerImpl(\n client, factory,\n new webkit_glue::VideoRendererImpl::FactoryFactory(false));\n}\n\nWebKit::WebApplicationCacheHost* CreateApplicationCacheHost(\n WebFrame*, WebKit::WebApplicationCacheHostClient* client) {\n return SimpleAppCacheSystem::CreateApplicationCacheHost(client);\n}\n\nWebKit::WebString GetWebKitRootDir() {\n FilePath path = GetWebKitRootDirFilePath();\n return WebKit::WebString::fromUTF8(WideToUTF8(path.ToWStringHack()).c_str());\n}\n\n\/\/ Wrapper for debug_util\nbool BeingDebugged() {\n return DebugUtil::BeingDebugged();\n}\n\n\/\/ Wrappers for MessageLoop\n\nvoid RunMessageLoop() {\n MessageLoop::current()->Run();\n}\n\nvoid QuitMessageLoop() {\n MessageLoop::current()->Quit();\n}\n\nvoid RunAllPendingMessages() {\n MessageLoop::current()->RunAllPending();\n}\n\nvoid DispatchMessageLoop() {\n MessageLoop* current = MessageLoop::current();\n bool old_state = current->NestableTasksAllowed();\n current->SetNestableTasksAllowed(true);\n current->RunAllPending();\n current->SetNestableTasksAllowed(old_state);\n}\n\nvoid PostTaskFromHere(Task* task) {\n MessageLoop::current()->PostTask(FROM_HERE, task);\n}\n\nvoid PostDelayedTaskFromHere(Task* task, int64 delay_ms) {\n MessageLoop::current()->PostDelayedTask(FROM_HERE, task, delay_ms);\n}\n\n\/\/ Wrappers for FilePath and file_util\n\nWebString GetAbsoluteWebStringFromUTF8Path(const std::string& utf8_path) {\n#if defined(OS_WIN)\n FilePath path(UTF8ToWide(utf8_path));\n file_util::AbsolutePath(&path);\n return WebString(path.value());\n#else\n FilePath path(base::SysWideToNativeMB(base::SysUTF8ToWide(utf8_path)));\n file_util::AbsolutePath(&path);\n return WideToUTF16(base::SysNativeMBToWide(path.value()));\n#endif\n}\n\nWebURL CreateURLForPathOrURL(const std::string& path_or_url_in_nativemb) {\n \/\/ NativeMB to UTF-8\n std::wstring wide_path_or_url\n = base::SysNativeMBToWide(path_or_url_in_nativemb);\n std::string path_or_url_in_utf8 = WideToUTF8(wide_path_or_url);\n\n GURL url(path_or_url_in_utf8);\n if (url.is_valid() && url.has_scheme())\n return WebURL(url);\n#if defined(OS_WIN)\n return net::FilePathToFileURL(FilePath(wide_path_or_url));\n#else\n return net::FilePathToFileURL(FilePath(path_or_url_in_nativemb));\n#endif\n}\n\nWebURL RewriteLayoutTestsURL(const std::string& utf8_url) {\n const char kPrefix[] = \"file:\/\/\/tmp\/LayoutTests\/\";\n const int kPrefixLen = arraysize(kPrefix) - 1;\n\n if (utf8_url.compare(0, kPrefixLen, kPrefix, kPrefixLen))\n return WebURL(GURL(utf8_url));\n\n FilePath replacePath =\n GetWebKitRootDirFilePath().Append(FILE_PATH_LITERAL(\"LayoutTests\/\"));\n CHECK(file_util::PathExists(replacePath));\n#if defined(OS_WIN)\n std::string utf8_path = WideToUTF8(replacePath.value());\n#else\n std::string utf8_path\n = WideToUTF8(base::SysNativeMBToWide(replacePath.value()));\n#endif\n std::string newUrl = std::string(\"file:\/\/\") + utf8_path\n + utf8_url.substr(kPrefixLen);\n return WebURL(GURL(newUrl));\n}\n\nbool SetCurrentDirectoryForFileURL(const WebKit::WebURL& fileUrl) {\n FilePath localPath;\n return net::FileURLToFilePath(fileUrl, &localPath)\n && file_util::SetCurrentDirectory(localPath.DirName());\n}\n\n\/\/ Bridge for SimpleDatabaseSystem\n\nvoid SetDatabaseQuota(int quota) {\n SimpleDatabaseSystem::GetInstance()->SetDatabaseQuota(quota);\n}\n\nvoid ClearAllDatabases() {\n SimpleDatabaseSystem::GetInstance()->ClearAllDatabases();\n}\n\n\/\/ Bridge for SimpleResourceLoaderBridge\n\nvoid SetAcceptAllCookies(bool accept) {\n SimpleResourceLoaderBridge::SetAcceptAllCookies(accept);\n}\n\n\/\/ Theme engine\n#if defined(OS_WIN)\n\nvoid SetThemeEngine(WebKit::WebThemeEngine* engine) {\n DCHECK(test_environment);\n test_environment->set_theme_engine(engine);\n}\n\nWebKit::WebThemeEngine* GetThemeEngine() {\n DCHECK(test_environment);\n return test_environment->theme_engine();\n}\n\n#endif\n\n} \/\/ namespace webkit_support\n<commit_msg>Fix detection of WebKit-only checkout or Chromium checkout<commit_after>\/\/ Copyright (c) 2010 The Chromium Authors. All rights reserved.\n\/\/ Use of this source code is governed by a BSD-style license that can be\n\/\/ found in the LICENSE file.\n\n#include \"webkit\/support\/webkit_support.h\"\n\n#include \"base\/at_exit.h\"\n#include \"base\/command_line.h\"\n#include \"base\/debug_util.h\"\n#include \"base\/file_path.h\"\n#include \"base\/file_util.h\"\n#include \"base\/i18n\/icu_util.h\"\n#include \"base\/message_loop.h\"\n#include \"base\/path_service.h\"\n#include \"base\/process_util.h\"\n#include \"base\/sys_string_conversions.h\"\n#include \"base\/utf_string_conversions.h\"\n#include \"base\/weak_ptr.h\"\n#include \"net\/base\/net_util.h\"\n#include \"third_party\/WebKit\/WebKit\/chromium\/public\/WebKit.h\"\n#include \"third_party\/WebKit\/WebKit\/chromium\/public\/WebPluginParams.h\"\n#include \"webkit\/appcache\/web_application_cache_host_impl.h\"\n#include \"webkit\/glue\/media\/buffered_data_source.h\"\n#include \"webkit\/glue\/media\/media_resource_loader_bridge_factory.h\"\n#include \"webkit\/glue\/media\/simple_data_source.h\"\n#include \"webkit\/glue\/media\/video_renderer_impl.h\"\n#include \"webkit\/glue\/plugins\/plugin_list.h\"\n#include \"webkit\/glue\/plugins\/webplugin_impl.h\"\n#include \"webkit\/glue\/plugins\/webplugin_page_delegate.h\"\n#include \"webkit\/glue\/plugins\/webplugininfo.h\"\n#include \"webkit\/glue\/webkitclient_impl.h\"\n#include \"webkit\/glue\/webmediaplayer_impl.h\"\n#include \"webkit\/support\/platform_support.h\"\n#include \"webkit\/support\/test_webplugin_page_delegate.h\"\n#include \"webkit\/support\/test_webkit_client.h\"\n#include \"webkit\/tools\/test_shell\/simple_database_system.h\"\n#include \"webkit\/tools\/test_shell\/simple_resource_loader_bridge.h\"\n\nusing WebKit::WebFrame;\nusing WebKit::WebMediaPlayerClient;\nusing WebKit::WebPlugin;\nusing WebKit::WebPluginParams;\nusing WebKit::WebString;\nusing WebKit::WebURL;\n\nnamespace {\n\nclass TestEnvironment {\n public:\n explicit TestEnvironment(bool unit_test_mode) {\n if (!unit_test_mode)\n at_exit_manager_.reset(new base::AtExitManager);\n main_message_loop_.reset(new MessageLoopForUI);\n \/\/ TestWebKitClient must be instantiated after the MessageLoopForUI.\n webkit_client_.reset(new TestWebKitClient);\n }\n\n ~TestEnvironment() {\n SimpleResourceLoaderBridge::Shutdown();\n }\n\n WebKit::WebKitClient* webkit_client() { return webkit_client_.get(); }\n\n#if defined(OS_WIN)\n void set_theme_engine(WebKit::WebThemeEngine* engine) {\n DCHECK(webkit_client_ != 0);\n webkit_client_->SetThemeEngine(engine);\n }\n\n WebKit::WebThemeEngine* theme_engine() {\n return webkit_client_->themeEngine();\n }\n#endif\n\n private:\n scoped_ptr<base::AtExitManager> at_exit_manager_;\n scoped_ptr<MessageLoopForUI> main_message_loop_;\n scoped_ptr<TestWebKitClient> webkit_client_;\n};\n\nclass WebPluginImplWithPageDelegate\n : public webkit_support::TestWebPluginPageDelegate,\n public base::SupportsWeakPtr<WebPluginImplWithPageDelegate>,\n public webkit_glue::WebPluginImpl {\n public:\n WebPluginImplWithPageDelegate(WebFrame* frame,\n const WebPluginParams& params,\n const FilePath& path,\n const std::string& mime_type)\n : webkit_support::TestWebPluginPageDelegate(),\n webkit_glue::WebPluginImpl(\n frame, params, path, mime_type, AsWeakPtr()) {}\n virtual ~WebPluginImplWithPageDelegate() {}\n private:\n DISALLOW_COPY_AND_ASSIGN(WebPluginImplWithPageDelegate);\n};\n\nFilePath GetWebKitRootDirFilePath() {\n FilePath basePath;\n PathService::Get(base::DIR_SOURCE_ROOT, &basePath);\n if (file_util::PathExists(basePath.Append(FILE_PATH_LITERAL(\"chrome\")))) {\n return basePath.Append(FILE_PATH_LITERAL(\"third_party\/WebKit\"));\n } else {\n \/\/ WebKit\/WebKit\/chromium\/ -> WebKit\/\n return basePath.Append(FILE_PATH_LITERAL(\"..\/..\"));\n }\n}\n\n} \/\/ namespace\n\nnamespace webkit_support {\n\nstatic TestEnvironment* test_environment;\n\nvoid SetUpTestEnvironment() {\n SetUpTestEnvironment(false);\n}\n\nvoid SetUpTestEnvironment(bool unit_test_mode) {\n base::EnableTerminationOnHeapCorruption();\n\n \/\/ Initialize the singleton CommandLine with fixed values. Some code refer to\n \/\/ CommandLine::ForCurrentProcess(). We don't use the actual command-line\n \/\/ arguments of DRT to avoid unexpected behavior change.\n \/\/\n \/\/ webkit\/glue\/webmediaplayer_impl.cc checks --enable-openmax.\n \/\/ webkit\/glue\/plugin\/plugin_list_posix.cc checks --debug-plugin-loading.\n \/\/ webkit\/glue\/plugin\/plugin_list_win.cc checks --old-wmp.\n \/\/ If DRT needs these flags, specify them in the following kFixedArguments.\n const char* kFixedArguments[] = {\"DumpRenderTree\"};\n CommandLine::Init(arraysize(kFixedArguments), kFixedArguments);\n\n BeforeInitialize();\n test_environment = new TestEnvironment(unit_test_mode);\n AfterInitialize();\n if (!unit_test_mode) {\n \/\/ Load ICU data tables. This has to run after TestEnvironment is created\n \/\/ because on Linux, we need base::AtExitManager.\n icu_util::Initialize();\n }\n}\n\nvoid TearDownTestEnvironment() {\n \/\/ Flush any remaining messages before we kill ourselves.\n \/\/ http:\/\/code.google.com\/p\/chromium\/issues\/detail?id=9500\n MessageLoop::current()->RunAllPending();\n\n BeforeShutdown();\n WebKit::shutdown();\n delete test_environment;\n test_environment = NULL;\n AfterShutdown();\n}\n\nWebKit::WebKitClient* GetWebKitClient() {\n DCHECK(test_environment);\n return test_environment->webkit_client();\n}\n\nWebPlugin* CreateWebPlugin(WebFrame* frame,\n const WebPluginParams& params) {\n const bool kAllowWildcard = true;\n WebPluginInfo info;\n std::string actual_mime_type;\n if (!NPAPI::PluginList::Singleton()->GetPluginInfo(\n params.url, params.mimeType.utf8(), kAllowWildcard, &info,\n &actual_mime_type)) {\n return NULL;\n }\n\n if (actual_mime_type.empty())\n actual_mime_type = params.mimeType.utf8();\n\n return new WebPluginImplWithPageDelegate(\n frame, params, info.path, actual_mime_type);\n}\n\nWebKit::WebMediaPlayer* CreateMediaPlayer(WebFrame* frame,\n WebMediaPlayerClient* client) {\n scoped_refptr<media::FilterFactoryCollection> factory =\n new media::FilterFactoryCollection();\n\n appcache::WebApplicationCacheHostImpl* appcache_host =\n appcache::WebApplicationCacheHostImpl::FromFrame(frame);\n\n \/\/ TODO(hclam): this is the same piece of code as in RenderView, maybe they\n \/\/ should be grouped together.\n webkit_glue::MediaResourceLoaderBridgeFactory* bridge_factory =\n new webkit_glue::MediaResourceLoaderBridgeFactory(\n GURL(), \/\/ referrer\n \"null\", \/\/ frame origin\n \"null\", \/\/ main_frame_origin\n base::GetCurrentProcId(),\n appcache_host ? appcache_host->host_id() : appcache::kNoHostId,\n 0);\n \/\/ A simple data source that keeps all data in memory.\n media::FilterFactory* simple_data_source_factory =\n webkit_glue::SimpleDataSource::CreateFactory(MessageLoop::current(),\n bridge_factory);\n \/\/ A sophisticated data source that does memory caching.\n media::FilterFactory* buffered_data_source_factory =\n webkit_glue::BufferedDataSource::CreateFactory(MessageLoop::current(),\n bridge_factory);\n factory->AddFactory(buffered_data_source_factory);\n factory->AddFactory(simple_data_source_factory);\n return new webkit_glue::WebMediaPlayerImpl(\n client, factory,\n new webkit_glue::VideoRendererImpl::FactoryFactory(false));\n}\n\nWebKit::WebApplicationCacheHost* CreateApplicationCacheHost(\n WebFrame*, WebKit::WebApplicationCacheHostClient* client) {\n return SimpleAppCacheSystem::CreateApplicationCacheHost(client);\n}\n\nWebKit::WebString GetWebKitRootDir() {\n FilePath path = GetWebKitRootDirFilePath();\n return WebKit::WebString::fromUTF8(WideToUTF8(path.ToWStringHack()).c_str());\n}\n\n\/\/ Wrapper for debug_util\nbool BeingDebugged() {\n return DebugUtil::BeingDebugged();\n}\n\n\/\/ Wrappers for MessageLoop\n\nvoid RunMessageLoop() {\n MessageLoop::current()->Run();\n}\n\nvoid QuitMessageLoop() {\n MessageLoop::current()->Quit();\n}\n\nvoid RunAllPendingMessages() {\n MessageLoop::current()->RunAllPending();\n}\n\nvoid DispatchMessageLoop() {\n MessageLoop* current = MessageLoop::current();\n bool old_state = current->NestableTasksAllowed();\n current->SetNestableTasksAllowed(true);\n current->RunAllPending();\n current->SetNestableTasksAllowed(old_state);\n}\n\nvoid PostTaskFromHere(Task* task) {\n MessageLoop::current()->PostTask(FROM_HERE, task);\n}\n\nvoid PostDelayedTaskFromHere(Task* task, int64 delay_ms) {\n MessageLoop::current()->PostDelayedTask(FROM_HERE, task, delay_ms);\n}\n\n\/\/ Wrappers for FilePath and file_util\n\nWebString GetAbsoluteWebStringFromUTF8Path(const std::string& utf8_path) {\n#if defined(OS_WIN)\n FilePath path(UTF8ToWide(utf8_path));\n file_util::AbsolutePath(&path);\n return WebString(path.value());\n#else\n FilePath path(base::SysWideToNativeMB(base::SysUTF8ToWide(utf8_path)));\n file_util::AbsolutePath(&path);\n return WideToUTF16(base::SysNativeMBToWide(path.value()));\n#endif\n}\n\nWebURL CreateURLForPathOrURL(const std::string& path_or_url_in_nativemb) {\n \/\/ NativeMB to UTF-8\n std::wstring wide_path_or_url\n = base::SysNativeMBToWide(path_or_url_in_nativemb);\n std::string path_or_url_in_utf8 = WideToUTF8(wide_path_or_url);\n\n GURL url(path_or_url_in_utf8);\n if (url.is_valid() && url.has_scheme())\n return WebURL(url);\n#if defined(OS_WIN)\n return net::FilePathToFileURL(FilePath(wide_path_or_url));\n#else\n return net::FilePathToFileURL(FilePath(path_or_url_in_nativemb));\n#endif\n}\n\nWebURL RewriteLayoutTestsURL(const std::string& utf8_url) {\n const char kPrefix[] = \"file:\/\/\/tmp\/LayoutTests\/\";\n const int kPrefixLen = arraysize(kPrefix) - 1;\n\n if (utf8_url.compare(0, kPrefixLen, kPrefix, kPrefixLen))\n return WebURL(GURL(utf8_url));\n\n FilePath replacePath =\n GetWebKitRootDirFilePath().Append(FILE_PATH_LITERAL(\"LayoutTests\/\"));\n CHECK(file_util::PathExists(replacePath));\n#if defined(OS_WIN)\n std::string utf8_path = WideToUTF8(replacePath.value());\n#else\n std::string utf8_path\n = WideToUTF8(base::SysNativeMBToWide(replacePath.value()));\n#endif\n std::string newUrl = std::string(\"file:\/\/\") + utf8_path\n + utf8_url.substr(kPrefixLen);\n return WebURL(GURL(newUrl));\n}\n\nbool SetCurrentDirectoryForFileURL(const WebKit::WebURL& fileUrl) {\n FilePath localPath;\n return net::FileURLToFilePath(fileUrl, &localPath)\n && file_util::SetCurrentDirectory(localPath.DirName());\n}\n\n\/\/ Bridge for SimpleDatabaseSystem\n\nvoid SetDatabaseQuota(int quota) {\n SimpleDatabaseSystem::GetInstance()->SetDatabaseQuota(quota);\n}\n\nvoid ClearAllDatabases() {\n SimpleDatabaseSystem::GetInstance()->ClearAllDatabases();\n}\n\n\/\/ Bridge for SimpleResourceLoaderBridge\n\nvoid SetAcceptAllCookies(bool accept) {\n SimpleResourceLoaderBridge::SetAcceptAllCookies(accept);\n}\n\n\/\/ Theme engine\n#if defined(OS_WIN)\n\nvoid SetThemeEngine(WebKit::WebThemeEngine* engine) {\n DCHECK(test_environment);\n test_environment->set_theme_engine(engine);\n}\n\nWebKit::WebThemeEngine* GetThemeEngine() {\n DCHECK(test_environment);\n return test_environment->theme_engine();\n}\n\n#endif\n\n} \/\/ namespace webkit_support\n<|endoftext|>"} {"text":"<commit_before>\/*************************************************************************\n *\n * OpenOffice.org - a multi-platform office productivity suite\n *\n * $RCSfile: except.cxx,v $\n *\n * $Revision: 1.4 $\n *\n * last change: $Author: obo $ $Date: 2006-09-16 15:53: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_bridges.hxx\"\n\n#include <stdio.h>\n#include <dlfcn.h>\n#include <cxxabi.h>\n#include <hash_map>\n\n#include <rtl\/strbuf.hxx>\n#include <rtl\/ustrbuf.hxx>\n#include <osl\/diagnose.h>\n#include <osl\/mutex.hxx>\n\n#include <com\/sun\/star\/uno\/genfunc.hxx>\n#include \"com\/sun\/star\/uno\/RuntimeException.hpp\"\n#include <typelib\/typedescription.hxx>\n#include <uno\/any2.h>\n\n#include \"share.hxx\"\n\n\nusing namespace ::std;\nusing namespace ::osl;\nusing namespace ::rtl;\nusing namespace ::com::sun::star::uno;\nusing namespace ::__cxxabiv1;\n\n\nnamespace CPPU_CURRENT_NAMESPACE\n{\n\nvoid dummy_can_throw_anything( char const * )\n{\n}\n\n\/\/==================================================================================================\nstatic OUString toUNOname( char const * p ) SAL_THROW( () )\n{\n#if OSL_DEBUG_LEVEL > 1\n char const * start = p;\n#endif\n\n \/\/ example: N3com3sun4star4lang24IllegalArgumentExceptionE\n\n OUStringBuffer buf( 64 );\n OSL_ASSERT( 'N' == *p );\n ++p; \/\/ skip N\n\n while ('E' != *p)\n {\n \/\/ read chars count\n long n = (*p++ - '0');\n while ('0' <= *p && '9' >= *p)\n {\n n *= 10;\n n += (*p++ - '0');\n }\n buf.appendAscii( p, n );\n p += n;\n if ('E' != *p)\n buf.append( (sal_Unicode)'.' );\n }\n\n#if OSL_DEBUG_LEVEL > 1\n OUString ret( buf.makeStringAndClear() );\n OString c_ret( OUStringToOString( ret, RTL_TEXTENCODING_ASCII_US ) );\n fprintf( stderr, \"> toUNOname(): %s => %s\\n\", start, c_ret.getStr() );\n return ret;\n#else\n return buf.makeStringAndClear();\n#endif\n}\n\n\/\/==================================================================================================\nclass RTTI\n{\n typedef hash_map< OUString, type_info *, OUStringHash > t_rtti_map;\n\n Mutex m_mutex;\n t_rtti_map m_rttis;\n t_rtti_map m_generatedRttis;\n\n void * m_hApp;\n\npublic:\n RTTI() SAL_THROW( () );\n ~RTTI() SAL_THROW( () );\n\n type_info * getRTTI( typelib_CompoundTypeDescription * ) SAL_THROW( () );\n};\n\/\/__________________________________________________________________________________________________\nRTTI::RTTI() SAL_THROW( () )\n : m_hApp( dlopen( 0, RTLD_LAZY ) )\n{\n}\n\/\/__________________________________________________________________________________________________\nRTTI::~RTTI() SAL_THROW( () )\n{\n dlclose( m_hApp );\n}\n\n\/\/__________________________________________________________________________________________________\ntype_info * RTTI::getRTTI( typelib_CompoundTypeDescription *pTypeDescr ) SAL_THROW( () )\n{\n type_info * rtti;\n\n OUString const & unoName = *(OUString const *)&pTypeDescr->aBase.pTypeName;\n\n MutexGuard guard( m_mutex );\n t_rtti_map::const_iterator iFind( m_rttis.find( unoName ) );\n if (iFind == m_rttis.end())\n {\n \/\/ RTTI symbol\n OStringBuffer buf( 64 );\n buf.append( RTL_CONSTASCII_STRINGPARAM(\"_ZTIN\") );\n sal_Int32 index = 0;\n do\n {\n OUString token( unoName.getToken( 0, '.', index ) );\n buf.append( token.getLength() );\n OString c_token( OUStringToOString( token, RTL_TEXTENCODING_ASCII_US ) );\n buf.append( c_token );\n }\n while (index >= 0);\n buf.append( 'E' );\n\n OString symName( buf.makeStringAndClear() );\n rtti = (type_info *)dlsym( m_hApp, symName.getStr() );\n\n if (rtti)\n {\n pair< t_rtti_map::iterator, bool > insertion(\n m_rttis.insert( t_rtti_map::value_type( unoName, rtti ) ) );\n OSL_ENSURE( insertion.second, \"### inserting new rtti failed?!\" );\n }\n else\n {\n \/\/ try to lookup the symbol in the generated rtti map\n t_rtti_map::const_iterator iFind( m_generatedRttis.find( unoName ) );\n if (iFind == m_generatedRttis.end())\n {\n \/\/ we must generate it !\n \/\/ symbol and rtti-name is nearly identical,\n \/\/ the symbol is prefixed with _ZTI\n char const * rttiName = symName.getStr() +4;\n#if OSL_DEBUG_LEVEL > 1\n fprintf( stderr,\"generated rtti for %s\\n\", rttiName );\n#endif\n if (pTypeDescr->pBaseTypeDescription)\n {\n \/\/ ensure availability of base\n type_info * base_rtti = getRTTI(\n (typelib_CompoundTypeDescription *)pTypeDescr->pBaseTypeDescription );\n rtti = new __si_class_type_info(\n strdup( rttiName ), (__class_type_info *)base_rtti );\n }\n else\n {\n \/\/ this class has no base class\n rtti = new __class_type_info( strdup( rttiName ) );\n }\n\n pair< t_rtti_map::iterator, bool > insertion(\n m_generatedRttis.insert( t_rtti_map::value_type( unoName, rtti ) ) );\n OSL_ENSURE( insertion.second, \"### inserting new generated rtti failed?!\" );\n }\n else \/\/ taking already generated rtti\n {\n rtti = iFind->second;\n }\n }\n }\n else\n {\n rtti = iFind->second;\n }\n\n return rtti;\n}\n\n\/\/--------------------------------------------------------------------------------------------------\nstatic void deleteException( void * pExc )\n{\n __cxa_exception const * header = ((__cxa_exception const *)pExc - 1);\n typelib_TypeDescription * pTD = 0;\n OUString unoName( toUNOname( header->exceptionType->name() ) );\n ::typelib_typedescription_getByName( &pTD, unoName.pData );\n OSL_ENSURE( pTD, \"### unknown exception type! leaving out destruction => leaking!!!\" );\n if (pTD)\n {\n ::uno_destructData( pExc, pTD, cpp_release );\n ::typelib_typedescription_release( pTD );\n }\n}\n\n\/\/==================================================================================================\nvoid raiseException( uno_Any * pUnoExc, uno_Mapping * pUno2Cpp )\n{\n#if OSL_DEBUG_LEVEL > 1\n OString cstr(\n OUStringToOString(\n *reinterpret_cast< OUString const * >( &pUnoExc->pType->pTypeName ),\n RTL_TEXTENCODING_ASCII_US ) );\n fprintf( stderr, \"> uno exception occured: %s\\n\", cstr.getStr() );\n#endif\n void * pCppExc;\n type_info * rtti;\n\n {\n \/\/ construct cpp exception object\n typelib_TypeDescription * pTypeDescr = 0;\n TYPELIB_DANGER_GET( &pTypeDescr, pUnoExc->pType );\n OSL_ASSERT( pTypeDescr );\n if (! pTypeDescr)\n {\n throw RuntimeException(\n OUString( RTL_CONSTASCII_USTRINGPARAM(\"cannot get typedescription for type \") ) +\n *reinterpret_cast< OUString const * >( &pUnoExc->pType->pTypeName ),\n Reference< XInterface >() );\n }\n\n pCppExc = __cxa_allocate_exception( pTypeDescr->nSize );\n ::uno_copyAndConvertData( pCppExc, pUnoExc->pData, pTypeDescr, pUno2Cpp );\n\n \/\/ destruct uno exception\n ::uno_any_destruct( pUnoExc, 0 );\n \/\/ avoiding locked counts\n static RTTI * s_rtti = 0;\n if (! s_rtti)\n {\n MutexGuard guard( Mutex::getGlobalMutex() );\n if (! s_rtti)\n {\n#ifdef LEAK_STATIC_DATA\n s_rtti = new RTTI();\n#else\n static RTTI rtti_data;\n s_rtti = &rtti_data;\n#endif\n }\n }\n rtti = (type_info *)s_rtti->getRTTI( (typelib_CompoundTypeDescription *) pTypeDescr );\n TYPELIB_DANGER_RELEASE( pTypeDescr );\n OSL_ENSURE( rtti, \"### no rtti for throwing exception!\" );\n if (! rtti)\n {\n throw RuntimeException(\n OUString( RTL_CONSTASCII_USTRINGPARAM(\"no rtti for type \") ) +\n *reinterpret_cast< OUString const * >( &pUnoExc->pType->pTypeName ),\n Reference< XInterface >() );\n }\n }\n\n __cxa_throw( pCppExc, rtti, deleteException );\n}\n\n\/\/==================================================================================================\nvoid fillUnoException( __cxa_exception * header, uno_Any * pUnoExc, uno_Mapping * pCpp2Uno )\n{\n if (! header)\n {\n RuntimeException aRE(\n OUString( RTL_CONSTASCII_USTRINGPARAM(\"no exception header!\") ),\n Reference< XInterface >() );\n Type const & rType = ::getCppuType( &aRE );\n uno_type_any_constructAndConvert( pUnoExc, &aRE, rType.getTypeLibType(), pCpp2Uno );\n#if OSL_DEBUG_LEVEL > 0\n OString cstr( OUStringToOString( aRE.Message, RTL_TEXTENCODING_ASCII_US ) );\n OSL_ENSURE( 0, cstr.getStr() );\n#endif\n return;\n }\n\n typelib_TypeDescription * pExcTypeDescr = 0;\n OUString unoName( toUNOname( header->exceptionType->name() ) );\n#if OSL_DEBUG_LEVEL > 1\n OString cstr_unoName( OUStringToOString( unoName, RTL_TEXTENCODING_ASCII_US ) );\n fprintf( stderr, \"> c++ exception occured: %s\\n\", cstr_unoName.getStr() );\n#endif\n typelib_typedescription_getByName( &pExcTypeDescr, unoName.pData );\n if (0 == pExcTypeDescr)\n {\n RuntimeException aRE(\n OUString( RTL_CONSTASCII_USTRINGPARAM(\"exception type not found: \") ) + unoName,\n Reference< XInterface >() );\n Type const & rType = ::getCppuType( &aRE );\n uno_type_any_constructAndConvert( pUnoExc, &aRE, rType.getTypeLibType(), pCpp2Uno );\n#if OSL_DEBUG_LEVEL > 0\n OString cstr( OUStringToOString( aRE.Message, RTL_TEXTENCODING_ASCII_US ) );\n OSL_ENSURE( 0, cstr.getStr() );\n#endif\n }\n else\n {\n \/\/ construct uno exception any\n uno_any_constructAndConvert( pUnoExc, header->adjustedPtr, pExcTypeDescr, pCpp2Uno );\n typelib_typedescription_release( pExcTypeDescr );\n }\n}\n\n}\n\n<commit_msg>INTEGRATION: CWS changefileheader (1.4.100); FILE MERGED 2008\/03\/28 16:30:32 rt 1.4.100.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: except.cxx,v $\n * $Revision: 1.5 $\n *\n * This file is part of OpenOffice.org.\n *\n * OpenOffice.org is free software: you can redistribute it and\/or modify\n * it under the terms of the GNU Lesser General Public License version 3\n * only, as published by the Free Software Foundation.\n *\n * OpenOffice.org is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the\n * GNU Lesser General Public License version 3 for more details\n * (a copy is included in the LICENSE file that accompanied this code).\n *\n * You should have received a copy of the GNU Lesser General Public License\n * version 3 along with OpenOffice.org. If not, see\n * <http:\/\/www.openoffice.org\/license.html>\n * for a copy of the LGPLv3 License.\n *\n ************************************************************************\/\n\n\/\/ MARKER(update_precomp.py): autogen include statement, do not remove\n#include \"precompiled_bridges.hxx\"\n\n#include <stdio.h>\n#include <dlfcn.h>\n#include <cxxabi.h>\n#include <hash_map>\n\n#include <rtl\/strbuf.hxx>\n#include <rtl\/ustrbuf.hxx>\n#include <osl\/diagnose.h>\n#include <osl\/mutex.hxx>\n\n#include <com\/sun\/star\/uno\/genfunc.hxx>\n#include \"com\/sun\/star\/uno\/RuntimeException.hpp\"\n#include <typelib\/typedescription.hxx>\n#include <uno\/any2.h>\n\n#include \"share.hxx\"\n\n\nusing namespace ::std;\nusing namespace ::osl;\nusing namespace ::rtl;\nusing namespace ::com::sun::star::uno;\nusing namespace ::__cxxabiv1;\n\n\nnamespace CPPU_CURRENT_NAMESPACE\n{\n\nvoid dummy_can_throw_anything( char const * )\n{\n}\n\n\/\/==================================================================================================\nstatic OUString toUNOname( char const * p ) SAL_THROW( () )\n{\n#if OSL_DEBUG_LEVEL > 1\n char const * start = p;\n#endif\n\n \/\/ example: N3com3sun4star4lang24IllegalArgumentExceptionE\n\n OUStringBuffer buf( 64 );\n OSL_ASSERT( 'N' == *p );\n ++p; \/\/ skip N\n\n while ('E' != *p)\n {\n \/\/ read chars count\n long n = (*p++ - '0');\n while ('0' <= *p && '9' >= *p)\n {\n n *= 10;\n n += (*p++ - '0');\n }\n buf.appendAscii( p, n );\n p += n;\n if ('E' != *p)\n buf.append( (sal_Unicode)'.' );\n }\n\n#if OSL_DEBUG_LEVEL > 1\n OUString ret( buf.makeStringAndClear() );\n OString c_ret( OUStringToOString( ret, RTL_TEXTENCODING_ASCII_US ) );\n fprintf( stderr, \"> toUNOname(): %s => %s\\n\", start, c_ret.getStr() );\n return ret;\n#else\n return buf.makeStringAndClear();\n#endif\n}\n\n\/\/==================================================================================================\nclass RTTI\n{\n typedef hash_map< OUString, type_info *, OUStringHash > t_rtti_map;\n\n Mutex m_mutex;\n t_rtti_map m_rttis;\n t_rtti_map m_generatedRttis;\n\n void * m_hApp;\n\npublic:\n RTTI() SAL_THROW( () );\n ~RTTI() SAL_THROW( () );\n\n type_info * getRTTI( typelib_CompoundTypeDescription * ) SAL_THROW( () );\n};\n\/\/__________________________________________________________________________________________________\nRTTI::RTTI() SAL_THROW( () )\n : m_hApp( dlopen( 0, RTLD_LAZY ) )\n{\n}\n\/\/__________________________________________________________________________________________________\nRTTI::~RTTI() SAL_THROW( () )\n{\n dlclose( m_hApp );\n}\n\n\/\/__________________________________________________________________________________________________\ntype_info * RTTI::getRTTI( typelib_CompoundTypeDescription *pTypeDescr ) SAL_THROW( () )\n{\n type_info * rtti;\n\n OUString const & unoName = *(OUString const *)&pTypeDescr->aBase.pTypeName;\n\n MutexGuard guard( m_mutex );\n t_rtti_map::const_iterator iFind( m_rttis.find( unoName ) );\n if (iFind == m_rttis.end())\n {\n \/\/ RTTI symbol\n OStringBuffer buf( 64 );\n buf.append( RTL_CONSTASCII_STRINGPARAM(\"_ZTIN\") );\n sal_Int32 index = 0;\n do\n {\n OUString token( unoName.getToken( 0, '.', index ) );\n buf.append( token.getLength() );\n OString c_token( OUStringToOString( token, RTL_TEXTENCODING_ASCII_US ) );\n buf.append( c_token );\n }\n while (index >= 0);\n buf.append( 'E' );\n\n OString symName( buf.makeStringAndClear() );\n rtti = (type_info *)dlsym( m_hApp, symName.getStr() );\n\n if (rtti)\n {\n pair< t_rtti_map::iterator, bool > insertion(\n m_rttis.insert( t_rtti_map::value_type( unoName, rtti ) ) );\n OSL_ENSURE( insertion.second, \"### inserting new rtti failed?!\" );\n }\n else\n {\n \/\/ try to lookup the symbol in the generated rtti map\n t_rtti_map::const_iterator iFind( m_generatedRttis.find( unoName ) );\n if (iFind == m_generatedRttis.end())\n {\n \/\/ we must generate it !\n \/\/ symbol and rtti-name is nearly identical,\n \/\/ the symbol is prefixed with _ZTI\n char const * rttiName = symName.getStr() +4;\n#if OSL_DEBUG_LEVEL > 1\n fprintf( stderr,\"generated rtti for %s\\n\", rttiName );\n#endif\n if (pTypeDescr->pBaseTypeDescription)\n {\n \/\/ ensure availability of base\n type_info * base_rtti = getRTTI(\n (typelib_CompoundTypeDescription *)pTypeDescr->pBaseTypeDescription );\n rtti = new __si_class_type_info(\n strdup( rttiName ), (__class_type_info *)base_rtti );\n }\n else\n {\n \/\/ this class has no base class\n rtti = new __class_type_info( strdup( rttiName ) );\n }\n\n pair< t_rtti_map::iterator, bool > insertion(\n m_generatedRttis.insert( t_rtti_map::value_type( unoName, rtti ) ) );\n OSL_ENSURE( insertion.second, \"### inserting new generated rtti failed?!\" );\n }\n else \/\/ taking already generated rtti\n {\n rtti = iFind->second;\n }\n }\n }\n else\n {\n rtti = iFind->second;\n }\n\n return rtti;\n}\n\n\/\/--------------------------------------------------------------------------------------------------\nstatic void deleteException( void * pExc )\n{\n __cxa_exception const * header = ((__cxa_exception const *)pExc - 1);\n typelib_TypeDescription * pTD = 0;\n OUString unoName( toUNOname( header->exceptionType->name() ) );\n ::typelib_typedescription_getByName( &pTD, unoName.pData );\n OSL_ENSURE( pTD, \"### unknown exception type! leaving out destruction => leaking!!!\" );\n if (pTD)\n {\n ::uno_destructData( pExc, pTD, cpp_release );\n ::typelib_typedescription_release( pTD );\n }\n}\n\n\/\/==================================================================================================\nvoid raiseException( uno_Any * pUnoExc, uno_Mapping * pUno2Cpp )\n{\n#if OSL_DEBUG_LEVEL > 1\n OString cstr(\n OUStringToOString(\n *reinterpret_cast< OUString const * >( &pUnoExc->pType->pTypeName ),\n RTL_TEXTENCODING_ASCII_US ) );\n fprintf( stderr, \"> uno exception occured: %s\\n\", cstr.getStr() );\n#endif\n void * pCppExc;\n type_info * rtti;\n\n {\n \/\/ construct cpp exception object\n typelib_TypeDescription * pTypeDescr = 0;\n TYPELIB_DANGER_GET( &pTypeDescr, pUnoExc->pType );\n OSL_ASSERT( pTypeDescr );\n if (! pTypeDescr)\n {\n throw RuntimeException(\n OUString( RTL_CONSTASCII_USTRINGPARAM(\"cannot get typedescription for type \") ) +\n *reinterpret_cast< OUString const * >( &pUnoExc->pType->pTypeName ),\n Reference< XInterface >() );\n }\n\n pCppExc = __cxa_allocate_exception( pTypeDescr->nSize );\n ::uno_copyAndConvertData( pCppExc, pUnoExc->pData, pTypeDescr, pUno2Cpp );\n\n \/\/ destruct uno exception\n ::uno_any_destruct( pUnoExc, 0 );\n \/\/ avoiding locked counts\n static RTTI * s_rtti = 0;\n if (! s_rtti)\n {\n MutexGuard guard( Mutex::getGlobalMutex() );\n if (! s_rtti)\n {\n#ifdef LEAK_STATIC_DATA\n s_rtti = new RTTI();\n#else\n static RTTI rtti_data;\n s_rtti = &rtti_data;\n#endif\n }\n }\n rtti = (type_info *)s_rtti->getRTTI( (typelib_CompoundTypeDescription *) pTypeDescr );\n TYPELIB_DANGER_RELEASE( pTypeDescr );\n OSL_ENSURE( rtti, \"### no rtti for throwing exception!\" );\n if (! rtti)\n {\n throw RuntimeException(\n OUString( RTL_CONSTASCII_USTRINGPARAM(\"no rtti for type \") ) +\n *reinterpret_cast< OUString const * >( &pUnoExc->pType->pTypeName ),\n Reference< XInterface >() );\n }\n }\n\n __cxa_throw( pCppExc, rtti, deleteException );\n}\n\n\/\/==================================================================================================\nvoid fillUnoException( __cxa_exception * header, uno_Any * pUnoExc, uno_Mapping * pCpp2Uno )\n{\n if (! header)\n {\n RuntimeException aRE(\n OUString( RTL_CONSTASCII_USTRINGPARAM(\"no exception header!\") ),\n Reference< XInterface >() );\n Type const & rType = ::getCppuType( &aRE );\n uno_type_any_constructAndConvert( pUnoExc, &aRE, rType.getTypeLibType(), pCpp2Uno );\n#if OSL_DEBUG_LEVEL > 0\n OString cstr( OUStringToOString( aRE.Message, RTL_TEXTENCODING_ASCII_US ) );\n OSL_ENSURE( 0, cstr.getStr() );\n#endif\n return;\n }\n\n typelib_TypeDescription * pExcTypeDescr = 0;\n OUString unoName( toUNOname( header->exceptionType->name() ) );\n#if OSL_DEBUG_LEVEL > 1\n OString cstr_unoName( OUStringToOString( unoName, RTL_TEXTENCODING_ASCII_US ) );\n fprintf( stderr, \"> c++ exception occured: %s\\n\", cstr_unoName.getStr() );\n#endif\n typelib_typedescription_getByName( &pExcTypeDescr, unoName.pData );\n if (0 == pExcTypeDescr)\n {\n RuntimeException aRE(\n OUString( RTL_CONSTASCII_USTRINGPARAM(\"exception type not found: \") ) + unoName,\n Reference< XInterface >() );\n Type const & rType = ::getCppuType( &aRE );\n uno_type_any_constructAndConvert( pUnoExc, &aRE, rType.getTypeLibType(), pCpp2Uno );\n#if OSL_DEBUG_LEVEL > 0\n OString cstr( OUStringToOString( aRE.Message, RTL_TEXTENCODING_ASCII_US ) );\n OSL_ENSURE( 0, cstr.getStr() );\n#endif\n }\n else\n {\n \/\/ construct uno exception any\n uno_any_constructAndConvert( pUnoExc, header->adjustedPtr, pExcTypeDescr, pCpp2Uno );\n typelib_typedescription_release( pExcTypeDescr );\n }\n}\n\n}\n\n<|endoftext|>"} {"text":"<commit_before><commit_msg>double buffer release corrected<commit_after><|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#include <minizinc\/gc.hh>\n#include <minizinc\/ast.hh>\n#include <minizinc\/model.hh>\n\n#include <vector>\n#include <cstring>\n\nnamespace MiniZinc {\n \n GC*&\n GC::gc(void) {\n static __thread GC* gc = NULL;\n return gc;\n }\n \n void\n GC::init(void) {\n if (gc()==NULL) {\n gc() = new GC();\n }\n }\n \n bool\n GC::locked(void) {\n assert(gc());\n return gc()->_lock_count > 0;\n }\n\n GCLock::GCLock(void) {\n GC::lock();\n }\n GCLock::~GCLock(void) {\n GC::unlock();\n }\n\n class FreeListNode : public ASTNode {\n public:\n FreeListNode* next;\n size_t size;\n FreeListNode(size_t s, FreeListNode* n)\n : ASTNode(ASTNode::NID_FL)\n , next(n)\n , size(s) {\n _gc_mark = 1;\n }\n };\n\n class HeapPage {\n public:\n HeapPage* next;\n size_t size;\n size_t used;\n char data[1];\n HeapPage(HeapPage* n, size_t s) : next(n), size(s), used(0) {}\n };\n\n \/\/\/ Memory managed by the garbage collector\n class GC::Heap {\n friend class GC;\n protected:\n HeapPage* _page;\n Model* _rootset;\n static const int _max_fl = 5;\n FreeListNode* _fl[_max_fl+1];\n static const size_t _fl_size[_max_fl+1];\n int _fl_slot(size_t size) {\n assert(size <= _fl_size[_max_fl]);\n assert(size >= sizeof(Item));\n size -= sizeof(Item);\n size \/= sizeof(void*);\n int slot = static_cast<int>(size)-1;\n return slot < 0 ? 0 : slot;\n }\n\n \/\/\/ Total amount of memory allocated\n size_t _alloced_mem;\n \/\/\/ Total amount of memory currently free\n size_t _free_mem;\n \/\/\/ Memory threshold for next garbage collection\n size_t _gc_threshold;\n\n \/\/\/ A trail item\n struct TItem {\n void** l;\n void* v;\n bool mark;\n TItem(void** l0, void* v0)\n : l(l0), v(v0), mark(false) {}\n };\n \/\/\/ Trail\n std::vector<TItem> trail;\n\n Heap(void)\n : _page(NULL)\n , _rootset(NULL)\n , _alloced_mem(0)\n , _free_mem(0)\n , _gc_threshold(10) {\n for (int i=_max_fl+1; i--;)\n _fl[i] = NULL;\n }\n\n \/\/\/ Default size of pages to allocate\n static const size_t pageSize = 1<<20;\n \n HeapPage* allocPage(size_t s, bool exact=false) {\n if (!exact)\n s = std::max(s,pageSize);\n HeapPage* newPage =\n static_cast<HeapPage*>(::malloc(sizeof(HeapPage)+s-1));\n _alloced_mem += s;\n _free_mem += s;\n if (exact && _page) {\n new (newPage) HeapPage(_page->next,s);\n _page->next = newPage;\n } else {\n if (_page) {\n size_t ns = _page->size-_page->used;\n assert(ns <= _fl_size[_max_fl]);\n if (ns >= _fl_size[0]) {\n \/\/ Remainder of page can be added to free lists\n FreeListNode* fln = \n reinterpret_cast<FreeListNode*>(_page->data+_page->used);\n new (fln) FreeListNode(ns, _fl[_fl_slot(ns)]);\n _fl[_fl_slot(ns)] = fln;\n } else {\n \/\/ Waste a little memory (less than smallest free list slot)\n _free_mem -= ns;\n }\n }\n new (newPage) HeapPage(_page,s);\n _page = newPage;\n }\n return newPage;\n }\n\n void*\n alloc(size_t size, bool exact=false) {\n assert(size<=80 || exact);\n \/\/\/ Align to word boundary\n size += ((8 - (size & 7)) & 7);\n HeapPage* p = _page;\n if (exact || _page==NULL || _page->used+size >= _page->size)\n p = allocPage(size,exact);\n char* ret = p->data+p->used;\n p->used += size;\n _free_mem -= size;\n return ret;\n }\n\n \/\/\/ Allocate one object of type T (no initialisation)\n template<typename T>\n T* alloc(void) { return static_cast<T*>(alloc(sizeof(T))); }\n \n \/\/\/ Allocate \\a n objects of type T (no initialisation)\n template<typename T>\n T* alloc(int n) { return static_cast<T*>(alloc(n*sizeof(T))); }\n\n void* fl(size_t size) {\n int slot = _fl_slot(size);\n assert(slot <= _max_fl);\n if (_fl[slot]) {\n FreeListNode* p = _fl[slot];\n _fl[slot] = p->next;\n return p;\n }\n return alloc(size);\n }\n\n void rungc(void) {\n if (_alloced_mem-_free_mem > _gc_threshold) {\n mark();\n sweep();\n if (_alloced_mem-_free_mem > _gc_threshold) {\n \/\/ grow threshold for next garbage collection\n _gc_threshold = std::max(_alloced_mem-_free_mem,_gc_threshold);\n _gc_threshold *= 1.5;\n }\n }\n }\n void mark(void);\n void sweep(void);\n\n static size_t\n nodesize(ASTNode* n) {\n static const size_t _nodesize[Item::II_END+1] = {\n 0, \/\/ NID_FL\n 0, \/\/ NID_CHUNK\n 0, \/\/ NID_VEC\n sizeof(IntLit), \/\/ E_INTLIT\n sizeof(FloatLit), \/\/ E_FLOATLIT\n sizeof(SetLit), \/\/ E_SETLIT\n sizeof(BoolLit), \/\/ E_BOOLLIT\n sizeof(StringLit), \/\/ E_STRINGLIT\n sizeof(Id), \/\/ E_ID\n sizeof(AnonVar), \/\/ E_ANON\n sizeof(ArrayLit), \/\/ E_ARRAYLIT\n sizeof(ArrayAccess), \/\/ E_ARRAYACCESS\n sizeof(Comprehension), \/\/ E_COMP\n sizeof(ITE), \/\/ E_ITE\n sizeof(BinOp), \/\/ E_BINOP\n sizeof(UnOp), \/\/ E_UNOP\n sizeof(Call), \/\/ E_CALL\n sizeof(VarDecl), \/\/ E_VARDECL\n sizeof(Let), \/\/ E_LET\n sizeof(Annotation), \/\/ E_ANN\n sizeof(TypeInst), \/\/ E_TI\n sizeof(TIId), \/\/ E_TIID\n sizeof(IncludeI), \/\/ II_INC\n sizeof(VarDeclI), \/\/ II_VD\n sizeof(AssignI), \/\/ II_ASN\n sizeof(ConstraintI), \/\/ II_CON\n sizeof(SolveI), \/\/ II_SOL\n sizeof(OutputI), \/\/ II_OUT\n sizeof(FunctionI) \/\/ II_FUN\n };\n switch (n->_id) {\n case ASTNode::NID_FL:\n return static_cast<FreeListNode*>(n)->size;\n case ASTNode::NID_CHUNK:\n return static_cast<ASTChunk*>(n)->memsize();\n case ASTNode::NID_VEC:\n return static_cast<ASTVec*>(n)->memsize();\n default:\n assert(n->_id <= Item::II_END);\n return _nodesize[n->_id];\n }\n }\n\n\n };\n\n void\n GC::lock(void) {\n assert(gc());\n if (gc()->_lock_count==0)\n gc()->_heap->rungc();\n gc()->_lock_count++;\n }\n void\n GC::unlock(void) {\n assert(locked());\n gc()->_lock_count--;\n }\n\n const size_t GC::Heap::pageSize;\n\n const size_t\n GC::Heap::_fl_size[GC::Heap::_max_fl+1] = {\n sizeof(Item)+1*sizeof(void*),\n sizeof(Item)+2*sizeof(void*),\n sizeof(Item)+3*sizeof(void*),\n sizeof(Item)+4*sizeof(void*),\n sizeof(Item)+5*sizeof(void*),\n sizeof(Item)+6*sizeof(void*),\n };\n\n GC::GC(void) : _heap(new Heap()), _lock_count(0) {}\n\n void\n GC::add(Model* m) {\n GC* gc = GC::gc();\n if (gc->_heap->_rootset) {\n m->_roots_next = gc->_heap->_rootset;\n m->_roots_prev = m->_roots_next->_roots_prev;\n m->_roots_prev->_roots_next = m;\n m->_roots_next->_roots_prev = m;\n } else {\n gc->_heap->_rootset = m->_roots_next = m->_roots_prev = m;\n }\n }\n\n void\n GC::remove(Model* m) {\n if (m->_roots_next || m->_roots_prev) {\n GC* gc = GC::gc();\n if (m->_roots_next == m->_roots_prev) {\n gc->_heap->_rootset = NULL;\n } else {\n m->_roots_next->_roots_prev = m->_roots_prev;\n m->_roots_prev->_roots_next = m->_roots_next;\n if (m==gc->_heap->_rootset)\n gc->_heap->_rootset = m->_roots_prev;\n }\n }\n }\n\n void*\n GC::alloc(size_t size) {\n assert(locked());\n if (size > _heap->_fl_size[_heap->_max_fl]) {\n return _heap->alloc(size,true);\n } else {\n return _heap->fl(size);\n }\n }\n\n void\n GC::Heap::mark(void) {\n Model* m = _rootset;\n do {\n for (Item* i : m->_items) {\n if (i->_gc_mark==0) {\n i->_gc_mark = 1;\n i->_loc.mark();\n switch (i->iid()) {\n case Item::II_INC:\n i->cast<IncludeI>()->_f.mark();\n break;\n case Item::II_VD:\n Expression::mark(i->cast<VarDeclI>()->_e);\n break;\n case Item::II_ASN:\n i->cast<AssignI>()->_id.mark();\n Expression::mark(i->cast<AssignI>()->_e);\n Expression::mark(i->cast<AssignI>()->_decl);\n break;\n case Item::II_CON:\n Expression::mark(i->cast<ConstraintI>()->_e);\n break;\n case Item::II_SOL:\n Expression::mark(i->cast<SolveI>()->_ann);\n Expression::mark(i->cast<SolveI>()->_e);\n break;\n case Item::II_OUT:\n Expression::mark(i->cast<OutputI>()->_e);\n break;\n case Item::II_FUN:\n i->cast<FunctionI>()->_id.mark();\n Expression::mark(i->cast<FunctionI>()->_ti);\n Expression::mark(i->cast<FunctionI>()->_ann);\n Expression::mark(i->cast<FunctionI>()->_e);\n i->cast<FunctionI>()->_params.mark();\n for (Expression* e : i->cast<FunctionI>()->_params) {\n Expression::mark(e);\n }\n break; \n }\n }\n }\n m = m->_roots_next;\n } while (m != _rootset);\n }\n \n void\n GC::Heap::sweep(void) {\n HeapPage* p = _page;\n HeapPage* prev = NULL;\n while (p) {\n size_t off = 0;\n bool wholepage = false;\n while (off < p->used) {\n ASTNode* n = reinterpret_cast<ASTNode*>(p->data+off);\n size_t ns = nodesize(n);\n if (n->_gc_mark==0) {\n if (ns <= _fl_size[_max_fl]) {\n FreeListNode* fln = static_cast<FreeListNode*>(n);\n new (fln) FreeListNode(ns, _fl[_fl_slot(ns)]);\n _fl[_fl_slot(ns)] = fln;\n _free_mem += ns;\n } else {\n assert(off==0);\n assert(p->used==p->size);\n wholepage = true;\n }\n } else {\n n->_gc_mark=0;\n }\n off += ns;\n }\n if (wholepage) {\n#ifndef NDEBUG\n memset(p->data,42,p->size);\n#endif\n if (prev)\n prev->next = p->next;\n HeapPage* pf = p;\n p = p->next;\n _alloced_mem -= pf->size;\n ::free(pf);\n } else {\n prev = p;\n p = p->next;\n }\n }\n }\n\n ASTVec::ASTVec(size_t size)\n : ASTNode(NID_VEC), _size(size) {}\n void*\n ASTVec::alloc(size_t size) {\n size_t s = sizeof(ASTVec)+(size<=2?0:size-2)*sizeof(void*);\n s += ((8 - (s & 7)) & 7);\n return GC::gc()->alloc(s);\n }\n\n ASTChunk::ASTChunk(size_t size)\n : ASTNode(NID_CHUNK), _size(size) {}\n void*\n ASTChunk::alloc(size_t size) {\n size_t s = sizeof(ASTChunk)+(size<=4?0:size-4)*sizeof(char);\n s += ((8 - (s & 7)) & 7);\n return GC::gc()->alloc(s);\n }\n\n void\n GC::mark(void) {\n GC* gc = GC::gc();\n if (!gc->_heap->trail.empty())\n gc->_heap->trail.back().mark = true;\n }\n void\n GC::trail(void** l,void* v) {\n GC* gc = GC::gc();\n gc->_heap->trail.push_back(GC::Heap::TItem(l,v));\n }\n void\n GC::untrail(void) {\n GC* gc = GC::gc();\n while (!gc->_heap->trail.empty() && !gc->_heap->trail.back().mark) {\n *gc->_heap->trail.back().l = gc->_heap->trail.back().v;\n gc->_heap->trail.pop_back();\n }\n if (!gc->_heap->trail.empty())\n gc->_heap->trail.back().mark = false;\n } \n\n void*\n ASTNode::operator new(size_t size) throw (std::bad_alloc) {\n return GC::gc()->alloc(size);\n }\n\n}\n<commit_msg>Don't unmark FreeList nodes<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#include <minizinc\/gc.hh>\n#include <minizinc\/ast.hh>\n#include <minizinc\/model.hh>\n\n#include <vector>\n#include <cstring>\n\nnamespace MiniZinc {\n \n GC*&\n GC::gc(void) {\n static __thread GC* gc = NULL;\n return gc;\n }\n \n void\n GC::init(void) {\n if (gc()==NULL) {\n gc() = new GC();\n }\n }\n \n bool\n GC::locked(void) {\n assert(gc());\n return gc()->_lock_count > 0;\n }\n\n GCLock::GCLock(void) {\n GC::lock();\n }\n GCLock::~GCLock(void) {\n GC::unlock();\n }\n\n class FreeListNode : public ASTNode {\n public:\n FreeListNode* next;\n size_t size;\n FreeListNode(size_t s, FreeListNode* n)\n : ASTNode(ASTNode::NID_FL)\n , next(n)\n , size(s) {\n _gc_mark = 1;\n }\n };\n\n class HeapPage {\n public:\n HeapPage* next;\n size_t size;\n size_t used;\n char data[1];\n HeapPage(HeapPage* n, size_t s) : next(n), size(s), used(0) {}\n };\n\n \/\/\/ Memory managed by the garbage collector\n class GC::Heap {\n friend class GC;\n protected:\n HeapPage* _page;\n Model* _rootset;\n static const int _max_fl = 5;\n FreeListNode* _fl[_max_fl+1];\n static const size_t _fl_size[_max_fl+1];\n int _fl_slot(size_t size) {\n assert(size <= _fl_size[_max_fl]);\n assert(size >= sizeof(Item));\n size -= sizeof(Item);\n size \/= sizeof(void*);\n int slot = static_cast<int>(size)-1;\n return slot < 0 ? 0 : slot;\n }\n\n \/\/\/ Total amount of memory allocated\n size_t _alloced_mem;\n \/\/\/ Total amount of memory currently free\n size_t _free_mem;\n \/\/\/ Memory threshold for next garbage collection\n size_t _gc_threshold;\n\n \/\/\/ A trail item\n struct TItem {\n void** l;\n void* v;\n bool mark;\n TItem(void** l0, void* v0)\n : l(l0), v(v0), mark(false) {}\n };\n \/\/\/ Trail\n std::vector<TItem> trail;\n\n Heap(void)\n : _page(NULL)\n , _rootset(NULL)\n , _alloced_mem(0)\n , _free_mem(0)\n , _gc_threshold(10) {\n for (int i=_max_fl+1; i--;)\n _fl[i] = NULL;\n }\n\n \/\/\/ Default size of pages to allocate\n static const size_t pageSize = 1<<20;\n \n HeapPage* allocPage(size_t s, bool exact=false) {\n if (!exact)\n s = std::max(s,pageSize);\n HeapPage* newPage =\n static_cast<HeapPage*>(::malloc(sizeof(HeapPage)+s-1));\n _alloced_mem += s;\n _free_mem += s;\n if (exact && _page) {\n new (newPage) HeapPage(_page->next,s);\n _page->next = newPage;\n } else {\n if (_page) {\n size_t ns = _page->size-_page->used;\n assert(ns <= _fl_size[_max_fl]);\n if (ns >= _fl_size[0]) {\n \/\/ Remainder of page can be added to free lists\n FreeListNode* fln = \n reinterpret_cast<FreeListNode*>(_page->data+_page->used);\n new (fln) FreeListNode(ns, _fl[_fl_slot(ns)]);\n _fl[_fl_slot(ns)] = fln;\n } else {\n \/\/ Waste a little memory (less than smallest free list slot)\n _free_mem -= ns;\n }\n }\n new (newPage) HeapPage(_page,s);\n _page = newPage;\n }\n return newPage;\n }\n\n void*\n alloc(size_t size, bool exact=false) {\n assert(size<=80 || exact);\n \/\/\/ Align to word boundary\n size += ((8 - (size & 7)) & 7);\n HeapPage* p = _page;\n if (exact || _page==NULL || _page->used+size >= _page->size)\n p = allocPage(size,exact);\n char* ret = p->data+p->used;\n p->used += size;\n _free_mem -= size;\n return ret;\n }\n\n \/\/\/ Allocate one object of type T (no initialisation)\n template<typename T>\n T* alloc(void) { return static_cast<T*>(alloc(sizeof(T))); }\n \n \/\/\/ Allocate \\a n objects of type T (no initialisation)\n template<typename T>\n T* alloc(int n) { return static_cast<T*>(alloc(n*sizeof(T))); }\n\n void* fl(size_t size) {\n int slot = _fl_slot(size);\n assert(slot <= _max_fl);\n if (_fl[slot]) {\n FreeListNode* p = _fl[slot];\n _fl[slot] = p->next;\n return p;\n }\n return alloc(size);\n }\n\n void rungc(void) {\n if (_alloced_mem-_free_mem > _gc_threshold) {\n mark();\n sweep();\n if (_alloced_mem-_free_mem > _gc_threshold) {\n \/\/ grow threshold for next garbage collection\n _gc_threshold = std::max(_alloced_mem-_free_mem,_gc_threshold);\n _gc_threshold *= 1.5;\n }\n }\n }\n void mark(void);\n void sweep(void);\n\n static size_t\n nodesize(ASTNode* n) {\n static const size_t _nodesize[Item::II_END+1] = {\n 0, \/\/ NID_FL\n 0, \/\/ NID_CHUNK\n 0, \/\/ NID_VEC\n sizeof(IntLit), \/\/ E_INTLIT\n sizeof(FloatLit), \/\/ E_FLOATLIT\n sizeof(SetLit), \/\/ E_SETLIT\n sizeof(BoolLit), \/\/ E_BOOLLIT\n sizeof(StringLit), \/\/ E_STRINGLIT\n sizeof(Id), \/\/ E_ID\n sizeof(AnonVar), \/\/ E_ANON\n sizeof(ArrayLit), \/\/ E_ARRAYLIT\n sizeof(ArrayAccess), \/\/ E_ARRAYACCESS\n sizeof(Comprehension), \/\/ E_COMP\n sizeof(ITE), \/\/ E_ITE\n sizeof(BinOp), \/\/ E_BINOP\n sizeof(UnOp), \/\/ E_UNOP\n sizeof(Call), \/\/ E_CALL\n sizeof(VarDecl), \/\/ E_VARDECL\n sizeof(Let), \/\/ E_LET\n sizeof(Annotation), \/\/ E_ANN\n sizeof(TypeInst), \/\/ E_TI\n sizeof(TIId), \/\/ E_TIID\n sizeof(IncludeI), \/\/ II_INC\n sizeof(VarDeclI), \/\/ II_VD\n sizeof(AssignI), \/\/ II_ASN\n sizeof(ConstraintI), \/\/ II_CON\n sizeof(SolveI), \/\/ II_SOL\n sizeof(OutputI), \/\/ II_OUT\n sizeof(FunctionI) \/\/ II_FUN\n };\n switch (n->_id) {\n case ASTNode::NID_FL:\n return static_cast<FreeListNode*>(n)->size;\n case ASTNode::NID_CHUNK:\n return static_cast<ASTChunk*>(n)->memsize();\n case ASTNode::NID_VEC:\n return static_cast<ASTVec*>(n)->memsize();\n default:\n assert(n->_id <= Item::II_END);\n return _nodesize[n->_id];\n }\n }\n\n\n };\n\n void\n GC::lock(void) {\n assert(gc());\n if (gc()->_lock_count==0)\n gc()->_heap->rungc();\n gc()->_lock_count++;\n }\n void\n GC::unlock(void) {\n assert(locked());\n gc()->_lock_count--;\n }\n\n const size_t GC::Heap::pageSize;\n\n const size_t\n GC::Heap::_fl_size[GC::Heap::_max_fl+1] = {\n sizeof(Item)+1*sizeof(void*),\n sizeof(Item)+2*sizeof(void*),\n sizeof(Item)+3*sizeof(void*),\n sizeof(Item)+4*sizeof(void*),\n sizeof(Item)+5*sizeof(void*),\n sizeof(Item)+6*sizeof(void*),\n };\n\n GC::GC(void) : _heap(new Heap()), _lock_count(0) {}\n\n void\n GC::add(Model* m) {\n GC* gc = GC::gc();\n if (gc->_heap->_rootset) {\n m->_roots_next = gc->_heap->_rootset;\n m->_roots_prev = m->_roots_next->_roots_prev;\n m->_roots_prev->_roots_next = m;\n m->_roots_next->_roots_prev = m;\n } else {\n gc->_heap->_rootset = m->_roots_next = m->_roots_prev = m;\n }\n }\n\n void\n GC::remove(Model* m) {\n if (m->_roots_next || m->_roots_prev) {\n GC* gc = GC::gc();\n if (m->_roots_next == m->_roots_prev) {\n gc->_heap->_rootset = NULL;\n } else {\n m->_roots_next->_roots_prev = m->_roots_prev;\n m->_roots_prev->_roots_next = m->_roots_next;\n if (m==gc->_heap->_rootset)\n gc->_heap->_rootset = m->_roots_prev;\n }\n }\n }\n\n void*\n GC::alloc(size_t size) {\n assert(locked());\n if (size > _heap->_fl_size[_heap->_max_fl]) {\n return _heap->alloc(size,true);\n } else {\n return _heap->fl(size);\n }\n }\n\n void\n GC::Heap::mark(void) {\n Model* m = _rootset;\n do {\n for (Item* i : m->_items) {\n if (i->_gc_mark==0) {\n i->_gc_mark = 1;\n i->_loc.mark();\n switch (i->iid()) {\n case Item::II_INC:\n i->cast<IncludeI>()->_f.mark();\n break;\n case Item::II_VD:\n Expression::mark(i->cast<VarDeclI>()->_e);\n break;\n case Item::II_ASN:\n i->cast<AssignI>()->_id.mark();\n Expression::mark(i->cast<AssignI>()->_e);\n Expression::mark(i->cast<AssignI>()->_decl);\n break;\n case Item::II_CON:\n Expression::mark(i->cast<ConstraintI>()->_e);\n break;\n case Item::II_SOL:\n Expression::mark(i->cast<SolveI>()->_ann);\n Expression::mark(i->cast<SolveI>()->_e);\n break;\n case Item::II_OUT:\n Expression::mark(i->cast<OutputI>()->_e);\n break;\n case Item::II_FUN:\n i->cast<FunctionI>()->_id.mark();\n Expression::mark(i->cast<FunctionI>()->_ti);\n Expression::mark(i->cast<FunctionI>()->_ann);\n Expression::mark(i->cast<FunctionI>()->_e);\n i->cast<FunctionI>()->_params.mark();\n for (Expression* e : i->cast<FunctionI>()->_params) {\n Expression::mark(e);\n }\n break; \n }\n }\n }\n m = m->_roots_next;\n } while (m != _rootset);\n }\n \n void\n GC::Heap::sweep(void) {\n HeapPage* p = _page;\n HeapPage* prev = NULL;\n while (p) {\n size_t off = 0;\n bool wholepage = false;\n while (off < p->used) {\n ASTNode* n = reinterpret_cast<ASTNode*>(p->data+off);\n size_t ns = nodesize(n);\n if (n->_gc_mark==0) {\n if (ns <= _fl_size[_max_fl]) {\n FreeListNode* fln = static_cast<FreeListNode*>(n);\n new (fln) FreeListNode(ns, _fl[_fl_slot(ns)]);\n _fl[_fl_slot(ns)] = fln;\n _free_mem += ns;\n } else {\n assert(off==0);\n assert(p->used==p->size);\n wholepage = true;\n }\n } else {\n if (n->_id != ASTNode::NID_FL)\n n->_gc_mark=0;\n }\n off += ns;\n }\n if (wholepage) {\n#ifndef NDEBUG\n memset(p->data,42,p->size);\n#endif\n if (prev)\n prev->next = p->next;\n HeapPage* pf = p;\n p = p->next;\n _alloced_mem -= pf->size;\n ::free(pf);\n } else {\n prev = p;\n p = p->next;\n }\n }\n }\n\n ASTVec::ASTVec(size_t size)\n : ASTNode(NID_VEC), _size(size) {}\n void*\n ASTVec::alloc(size_t size) {\n size_t s = sizeof(ASTVec)+(size<=2?0:size-2)*sizeof(void*);\n s += ((8 - (s & 7)) & 7);\n return GC::gc()->alloc(s);\n }\n\n ASTChunk::ASTChunk(size_t size)\n : ASTNode(NID_CHUNK), _size(size) {}\n void*\n ASTChunk::alloc(size_t size) {\n size_t s = sizeof(ASTChunk)+(size<=4?0:size-4)*sizeof(char);\n s += ((8 - (s & 7)) & 7);\n return GC::gc()->alloc(s);\n }\n\n void\n GC::mark(void) {\n GC* gc = GC::gc();\n if (!gc->_heap->trail.empty())\n gc->_heap->trail.back().mark = true;\n }\n void\n GC::trail(void** l,void* v) {\n GC* gc = GC::gc();\n gc->_heap->trail.push_back(GC::Heap::TItem(l,v));\n }\n void\n GC::untrail(void) {\n GC* gc = GC::gc();\n while (!gc->_heap->trail.empty() && !gc->_heap->trail.back().mark) {\n *gc->_heap->trail.back().l = gc->_heap->trail.back().v;\n gc->_heap->trail.pop_back();\n }\n if (!gc->_heap->trail.empty())\n gc->_heap->trail.back().mark = false;\n } \n\n void*\n ASTNode::operator new(size_t size) throw (std::bad_alloc) {\n return GC::gc()->alloc(size);\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\/shell\/shell.h\"\n\n#include <gdk\/gdkkeysyms.h>\n#include <gtk\/gtk.h>\n\n#include \"base\/logging.h\"\n#include \"base\/string_piece.h\"\n#include \"content\/public\/browser\/browser_context.h\"\n#include \"content\/public\/browser\/native_web_keyboard_event.h\"\n#include \"content\/public\/browser\/web_contents.h\"\n#include \"content\/public\/browser\/web_contents_view.h\"\n#include \"content\/public\/common\/renderer_preferences.h\"\n#include \"third_party\/skia\/include\/core\/SkColor.h\"\n\nnamespace content {\n\nvoid Shell::PlatformInitialize() {\n gtk_init(NULL, NULL);\n}\n\nbase::StringPiece Shell::PlatformResourceProvider(int key) {\n NOTIMPLEMENTED();\n return base::StringPiece();\n}\n\nvoid Shell::PlatformCleanUp() {\n \/\/ Nothing to clean up; GTK will clean up the widgets shortly after.\n}\n\nvoid Shell::PlatformEnableUIControl(UIControl control, bool is_enabled) {\n GtkToolItem* item = NULL;\n switch (control) {\n case BACK_BUTTON:\n item = back_button_;\n break;\n case FORWARD_BUTTON:\n item = forward_button_;\n break;\n case STOP_BUTTON:\n item = stop_button_;\n break;\n default:\n NOTREACHED() << \"Unknown UI control\";\n return;\n }\n gtk_widget_set_sensitive(GTK_WIDGET(item), is_enabled);\n}\n\nvoid Shell::PlatformSetAddressBarURL(const GURL& url) {\n gtk_entry_set_text(GTK_ENTRY(url_edit_view_), url.spec().c_str());\n}\n\nvoid Shell::PlatformSetIsLoading(bool loading) {\n if (loading)\n gtk_spinner_start(GTK_SPINNER(spinner_));\n else\n gtk_spinner_stop(GTK_SPINNER(spinner_));\n}\n\nvoid Shell::PlatformCreateWindow(int width, int height) {\n window_ = GTK_WINDOW(gtk_window_new(GTK_WINDOW_TOPLEVEL));\n gtk_window_set_title(window_, \"Content Shell\");\n g_signal_connect(G_OBJECT(window_), \"destroy\",\n G_CALLBACK(OnWindowDestroyedThunk), this);\n\n vbox_ = gtk_vbox_new(FALSE, 0);\n\n \/\/ Create the object that mediates accelerators.\n GtkAccelGroup* accel_group = gtk_accel_group_new();\n gtk_window_add_accel_group(GTK_WINDOW(window_), accel_group);\n\n \/\/ Set global window handling accelerators:\n gtk_accel_group_connect(\n accel_group, GDK_w, GDK_CONTROL_MASK,\n GTK_ACCEL_VISIBLE,\n g_cclosure_new(G_CALLBACK(OnCloseWindowKeyPressedThunk),\n this, NULL));\n\n GtkWidget* toolbar = gtk_toolbar_new();\n \/\/ Turn off the labels on the toolbar buttons.\n gtk_toolbar_set_style(GTK_TOOLBAR(toolbar), GTK_TOOLBAR_ICONS);\n\n back_button_ = gtk_tool_button_new_from_stock(GTK_STOCK_GO_BACK);\n g_signal_connect(back_button_, \"clicked\",\n G_CALLBACK(&OnBackButtonClickedThunk), this);\n gtk_toolbar_insert(GTK_TOOLBAR(toolbar), back_button_, -1 \/* append *\/);\n gtk_widget_add_accelerator(GTK_WIDGET(back_button_), \"clicked\", accel_group,\n GDK_Left, GDK_MOD1_MASK, GTK_ACCEL_VISIBLE);\n\n forward_button_ = gtk_tool_button_new_from_stock(GTK_STOCK_GO_FORWARD);\n g_signal_connect(forward_button_, \"clicked\",\n G_CALLBACK(&OnForwardButtonClickedThunk), this);\n gtk_toolbar_insert(GTK_TOOLBAR(toolbar), forward_button_, -1 \/* append *\/);\n gtk_widget_add_accelerator(GTK_WIDGET(forward_button_), \"clicked\",\n accel_group,\n GDK_Right, GDK_MOD1_MASK, GTK_ACCEL_VISIBLE);\n\n reload_button_ = gtk_tool_button_new_from_stock(GTK_STOCK_REFRESH);\n g_signal_connect(reload_button_, \"clicked\",\n G_CALLBACK(&OnReloadButtonClickedThunk), this);\n gtk_toolbar_insert(GTK_TOOLBAR(toolbar), reload_button_, -1 \/* append *\/);\n gtk_widget_add_accelerator(GTK_WIDGET(reload_button_), \"clicked\",\n accel_group,\n GDK_r, GDK_CONTROL_MASK, GTK_ACCEL_VISIBLE);\n\n stop_button_ = gtk_tool_button_new_from_stock(GTK_STOCK_STOP);\n g_signal_connect(stop_button_, \"clicked\",\n G_CALLBACK(&OnStopButtonClickedThunk), this);\n gtk_toolbar_insert(GTK_TOOLBAR(toolbar), stop_button_, -1 \/* append *\/);\n\n url_edit_view_ = gtk_entry_new();\n g_signal_connect(G_OBJECT(url_edit_view_), \"activate\",\n G_CALLBACK(&OnURLEntryActivateThunk), this);\n\n gtk_accel_group_connect(\n accel_group, GDK_l, GDK_CONTROL_MASK,\n GTK_ACCEL_VISIBLE,\n g_cclosure_new(G_CALLBACK(OnHighlightURLViewThunk),\n this, NULL));\n\n GtkToolItem* tool_item = gtk_tool_item_new();\n gtk_container_add(GTK_CONTAINER(tool_item), url_edit_view_);\n gtk_tool_item_set_expand(tool_item, TRUE);\n gtk_toolbar_insert(GTK_TOOLBAR(toolbar), tool_item, -1 \/* append *\/);\n\n \/\/ Center a 20x20 spinner in a 26x24 area.\n GtkWidget* spinner_alignment = gtk_alignment_new(0.5, 0.5, 0, 0);\n gtk_alignment_set_padding(GTK_ALIGNMENT(spinner_alignment), 2, 2, 4, 4);\n spinner_ = gtk_spinner_new();\n gtk_widget_set_size_request(spinner_, 20, 20);\n gtk_container_add(GTK_CONTAINER(spinner_alignment), spinner_);\n\n spinner_item_ = gtk_tool_item_new();\n gtk_container_add(GTK_CONTAINER(spinner_item_), spinner_alignment);\n gtk_toolbar_insert(GTK_TOOLBAR(toolbar), spinner_item_, -1 \/* append *\/);\n\n gtk_box_pack_start(GTK_BOX(vbox_), toolbar, FALSE, FALSE, 0);\n\n gtk_container_add(GTK_CONTAINER(window_), vbox_);\n gtk_widget_show_all(GTK_WIDGET(window_));\n\n SizeTo(width, height);\n}\n\nvoid Shell::PlatformSetContents() {\n WebContentsView* content_view = web_contents_->GetView();\n gtk_container_add(GTK_CONTAINER(vbox_), content_view->GetNativeView());\n\n \/\/ As an additional requirement on Linux, we must set the colors for the\n \/\/ render widgets in webkit.\n content::RendererPreferences* prefs =\n web_contents_->GetMutableRendererPrefs();\n prefs->focus_ring_color = SkColorSetARGB(255, 229, 151, 0);\n prefs->thumb_active_color = SkColorSetRGB(244, 244, 244);\n prefs->thumb_inactive_color = SkColorSetRGB(234, 234, 234);\n prefs->track_color = SkColorSetRGB(211, 211, 211);\n\n prefs->active_selection_bg_color = SkColorSetRGB(30, 144, 255);\n prefs->active_selection_fg_color = SK_ColorWHITE;\n prefs->inactive_selection_bg_color = SkColorSetRGB(200, 200, 200);\n prefs->inactive_selection_fg_color = SkColorSetRGB(50, 50, 50);\n}\n\nvoid Shell::SizeTo(int width, int height) {\n content_width_ = width;\n content_height_ = height;\n if (web_contents_.get()) {\n gtk_widget_set_size_request(web_contents_->GetNativeView(), width, height);\n }\n}\n\nvoid Shell::PlatformResizeSubViews() {\n SizeTo(content_width_, content_height_);\n}\n\nvoid Shell::Close() {\n gtk_widget_destroy(GTK_WIDGET(window_));\n}\n\nvoid Shell::OnBackButtonClicked(GtkWidget* widget) {\n GoBackOrForward(-1);\n}\n\nvoid Shell::OnForwardButtonClicked(GtkWidget* widget) {\n GoBackOrForward(1);\n}\n\nvoid Shell::OnReloadButtonClicked(GtkWidget* widget) {\n Reload();\n}\n\nvoid Shell::OnStopButtonClicked(GtkWidget* widget) {\n Stop();\n}\n\nvoid Shell::OnURLEntryActivate(GtkWidget* entry) {\n const gchar* str = gtk_entry_get_text(GTK_ENTRY(entry));\n GURL url(str);\n if (!url.has_scheme())\n url = GURL(std::string(\"http:\/\/\") + std::string(str));\n LoadURL(GURL(url));\n}\n\n\/\/ Callback for when the main window is destroyed.\ngboolean Shell::OnWindowDestroyed(GtkWidget* window) {\n delete this;\n return FALSE; \/\/ Don't stop this message.\n}\n\ngboolean Shell::OnCloseWindowKeyPressed(GtkAccelGroup* accel_group,\n GObject* acceleratable,\n guint keyval,\n GdkModifierType modifier) {\n gtk_widget_destroy(GTK_WIDGET(window_));\n return TRUE;\n}\n\ngboolean Shell::OnHighlightURLView(GtkAccelGroup* accel_group,\n GObject* acceleratable,\n guint keyval,\n GdkModifierType modifier) {\n gtk_widget_grab_focus(GTK_WIDGET(url_edit_view_));\n return TRUE;\n}\n\n} \/\/ namespace content\n<commit_msg>Remove duplicated gtk_init() in the Shell::PlatformInitialize(). gtk_init() is called in content layer by calling gfx::GtkInitFromCommandLine().<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\/shell\/shell.h\"\n\n#include <gdk\/gdkkeysyms.h>\n#include <gtk\/gtk.h>\n\n#include \"base\/logging.h\"\n#include \"base\/string_piece.h\"\n#include \"content\/public\/browser\/browser_context.h\"\n#include \"content\/public\/browser\/native_web_keyboard_event.h\"\n#include \"content\/public\/browser\/web_contents.h\"\n#include \"content\/public\/browser\/web_contents_view.h\"\n#include \"content\/public\/common\/renderer_preferences.h\"\n#include \"third_party\/skia\/include\/core\/SkColor.h\"\n\nnamespace content {\n\nvoid Shell::PlatformInitialize() {\n}\n\nbase::StringPiece Shell::PlatformResourceProvider(int key) {\n NOTIMPLEMENTED();\n return base::StringPiece();\n}\n\nvoid Shell::PlatformCleanUp() {\n \/\/ Nothing to clean up; GTK will clean up the widgets shortly after.\n}\n\nvoid Shell::PlatformEnableUIControl(UIControl control, bool is_enabled) {\n GtkToolItem* item = NULL;\n switch (control) {\n case BACK_BUTTON:\n item = back_button_;\n break;\n case FORWARD_BUTTON:\n item = forward_button_;\n break;\n case STOP_BUTTON:\n item = stop_button_;\n break;\n default:\n NOTREACHED() << \"Unknown UI control\";\n return;\n }\n gtk_widget_set_sensitive(GTK_WIDGET(item), is_enabled);\n}\n\nvoid Shell::PlatformSetAddressBarURL(const GURL& url) {\n gtk_entry_set_text(GTK_ENTRY(url_edit_view_), url.spec().c_str());\n}\n\nvoid Shell::PlatformSetIsLoading(bool loading) {\n if (loading)\n gtk_spinner_start(GTK_SPINNER(spinner_));\n else\n gtk_spinner_stop(GTK_SPINNER(spinner_));\n}\n\nvoid Shell::PlatformCreateWindow(int width, int height) {\n window_ = GTK_WINDOW(gtk_window_new(GTK_WINDOW_TOPLEVEL));\n gtk_window_set_title(window_, \"Content Shell\");\n g_signal_connect(G_OBJECT(window_), \"destroy\",\n G_CALLBACK(OnWindowDestroyedThunk), this);\n\n vbox_ = gtk_vbox_new(FALSE, 0);\n\n \/\/ Create the object that mediates accelerators.\n GtkAccelGroup* accel_group = gtk_accel_group_new();\n gtk_window_add_accel_group(GTK_WINDOW(window_), accel_group);\n\n \/\/ Set global window handling accelerators:\n gtk_accel_group_connect(\n accel_group, GDK_w, GDK_CONTROL_MASK,\n GTK_ACCEL_VISIBLE,\n g_cclosure_new(G_CALLBACK(OnCloseWindowKeyPressedThunk),\n this, NULL));\n\n GtkWidget* toolbar = gtk_toolbar_new();\n \/\/ Turn off the labels on the toolbar buttons.\n gtk_toolbar_set_style(GTK_TOOLBAR(toolbar), GTK_TOOLBAR_ICONS);\n\n back_button_ = gtk_tool_button_new_from_stock(GTK_STOCK_GO_BACK);\n g_signal_connect(back_button_, \"clicked\",\n G_CALLBACK(&OnBackButtonClickedThunk), this);\n gtk_toolbar_insert(GTK_TOOLBAR(toolbar), back_button_, -1 \/* append *\/);\n gtk_widget_add_accelerator(GTK_WIDGET(back_button_), \"clicked\", accel_group,\n GDK_Left, GDK_MOD1_MASK, GTK_ACCEL_VISIBLE);\n\n forward_button_ = gtk_tool_button_new_from_stock(GTK_STOCK_GO_FORWARD);\n g_signal_connect(forward_button_, \"clicked\",\n G_CALLBACK(&OnForwardButtonClickedThunk), this);\n gtk_toolbar_insert(GTK_TOOLBAR(toolbar), forward_button_, -1 \/* append *\/);\n gtk_widget_add_accelerator(GTK_WIDGET(forward_button_), \"clicked\",\n accel_group,\n GDK_Right, GDK_MOD1_MASK, GTK_ACCEL_VISIBLE);\n\n reload_button_ = gtk_tool_button_new_from_stock(GTK_STOCK_REFRESH);\n g_signal_connect(reload_button_, \"clicked\",\n G_CALLBACK(&OnReloadButtonClickedThunk), this);\n gtk_toolbar_insert(GTK_TOOLBAR(toolbar), reload_button_, -1 \/* append *\/);\n gtk_widget_add_accelerator(GTK_WIDGET(reload_button_), \"clicked\",\n accel_group,\n GDK_r, GDK_CONTROL_MASK, GTK_ACCEL_VISIBLE);\n\n stop_button_ = gtk_tool_button_new_from_stock(GTK_STOCK_STOP);\n g_signal_connect(stop_button_, \"clicked\",\n G_CALLBACK(&OnStopButtonClickedThunk), this);\n gtk_toolbar_insert(GTK_TOOLBAR(toolbar), stop_button_, -1 \/* append *\/);\n\n url_edit_view_ = gtk_entry_new();\n g_signal_connect(G_OBJECT(url_edit_view_), \"activate\",\n G_CALLBACK(&OnURLEntryActivateThunk), this);\n\n gtk_accel_group_connect(\n accel_group, GDK_l, GDK_CONTROL_MASK,\n GTK_ACCEL_VISIBLE,\n g_cclosure_new(G_CALLBACK(OnHighlightURLViewThunk),\n this, NULL));\n\n GtkToolItem* tool_item = gtk_tool_item_new();\n gtk_container_add(GTK_CONTAINER(tool_item), url_edit_view_);\n gtk_tool_item_set_expand(tool_item, TRUE);\n gtk_toolbar_insert(GTK_TOOLBAR(toolbar), tool_item, -1 \/* append *\/);\n\n \/\/ Center a 20x20 spinner in a 26x24 area.\n GtkWidget* spinner_alignment = gtk_alignment_new(0.5, 0.5, 0, 0);\n gtk_alignment_set_padding(GTK_ALIGNMENT(spinner_alignment), 2, 2, 4, 4);\n spinner_ = gtk_spinner_new();\n gtk_widget_set_size_request(spinner_, 20, 20);\n gtk_container_add(GTK_CONTAINER(spinner_alignment), spinner_);\n\n spinner_item_ = gtk_tool_item_new();\n gtk_container_add(GTK_CONTAINER(spinner_item_), spinner_alignment);\n gtk_toolbar_insert(GTK_TOOLBAR(toolbar), spinner_item_, -1 \/* append *\/);\n\n gtk_box_pack_start(GTK_BOX(vbox_), toolbar, FALSE, FALSE, 0);\n\n gtk_container_add(GTK_CONTAINER(window_), vbox_);\n gtk_widget_show_all(GTK_WIDGET(window_));\n\n SizeTo(width, height);\n}\n\nvoid Shell::PlatformSetContents() {\n WebContentsView* content_view = web_contents_->GetView();\n gtk_container_add(GTK_CONTAINER(vbox_), content_view->GetNativeView());\n\n \/\/ As an additional requirement on Linux, we must set the colors for the\n \/\/ render widgets in webkit.\n content::RendererPreferences* prefs =\n web_contents_->GetMutableRendererPrefs();\n prefs->focus_ring_color = SkColorSetARGB(255, 229, 151, 0);\n prefs->thumb_active_color = SkColorSetRGB(244, 244, 244);\n prefs->thumb_inactive_color = SkColorSetRGB(234, 234, 234);\n prefs->track_color = SkColorSetRGB(211, 211, 211);\n\n prefs->active_selection_bg_color = SkColorSetRGB(30, 144, 255);\n prefs->active_selection_fg_color = SK_ColorWHITE;\n prefs->inactive_selection_bg_color = SkColorSetRGB(200, 200, 200);\n prefs->inactive_selection_fg_color = SkColorSetRGB(50, 50, 50);\n}\n\nvoid Shell::SizeTo(int width, int height) {\n content_width_ = width;\n content_height_ = height;\n if (web_contents_.get()) {\n gtk_widget_set_size_request(web_contents_->GetNativeView(), width, height);\n }\n}\n\nvoid Shell::PlatformResizeSubViews() {\n SizeTo(content_width_, content_height_);\n}\n\nvoid Shell::Close() {\n gtk_widget_destroy(GTK_WIDGET(window_));\n}\n\nvoid Shell::OnBackButtonClicked(GtkWidget* widget) {\n GoBackOrForward(-1);\n}\n\nvoid Shell::OnForwardButtonClicked(GtkWidget* widget) {\n GoBackOrForward(1);\n}\n\nvoid Shell::OnReloadButtonClicked(GtkWidget* widget) {\n Reload();\n}\n\nvoid Shell::OnStopButtonClicked(GtkWidget* widget) {\n Stop();\n}\n\nvoid Shell::OnURLEntryActivate(GtkWidget* entry) {\n const gchar* str = gtk_entry_get_text(GTK_ENTRY(entry));\n GURL url(str);\n if (!url.has_scheme())\n url = GURL(std::string(\"http:\/\/\") + std::string(str));\n LoadURL(GURL(url));\n}\n\n\/\/ Callback for when the main window is destroyed.\ngboolean Shell::OnWindowDestroyed(GtkWidget* window) {\n delete this;\n return FALSE; \/\/ Don't stop this message.\n}\n\ngboolean Shell::OnCloseWindowKeyPressed(GtkAccelGroup* accel_group,\n GObject* acceleratable,\n guint keyval,\n GdkModifierType modifier) {\n gtk_widget_destroy(GTK_WIDGET(window_));\n return TRUE;\n}\n\ngboolean Shell::OnHighlightURLView(GtkAccelGroup* accel_group,\n GObject* acceleratable,\n guint keyval,\n GdkModifierType modifier) {\n gtk_widget_grab_focus(GTK_WIDGET(url_edit_view_));\n return TRUE;\n}\n\n} \/\/ namespace content\n<|endoftext|>"} {"text":"<commit_before>#include <reactive\/buffer.hpp>\n#include <reactive\/process.hpp>\n#include <reactive\/variant.hpp>\n#include <reactive\/coroutine.hpp>\n#include <reactive\/generate.hpp>\n#include <reactive\/consume.hpp>\n#include <reactive\/tuple.hpp>\n#include <reactive\/ptr_observable.hpp>\n#include <reactive\/transform.hpp>\n#include <reactive\/bridge.hpp>\n#include <reactive\/take.hpp>\n#include <reactive\/enumerate.hpp>\n#include <reactive\/cache.hpp>\n#include <reactive\/connector.hpp>\n#include <reactive\/receiver.hpp>\n#include <reactive\/deref_optional.hpp>\n#include <boost\/container\/string.hpp>\n#include <boost\/test\/unit_test.hpp>\n#include <boost\/bind.hpp>\n\nnamespace rx\n{\n\ttemplate <class Element>\n\tstruct empty : observable<Element>\n\t{\n\t\tvirtual void async_get_one(observer<Element> &receiver) SILICIUM_OVERRIDE\n\t\t{\n\t\t\treturn receiver.ended();\n\t\t}\n\n\t\tvirtual void cancel() SILICIUM_OVERRIDE\n\t\t{\n\t\t\tthrow std::logic_error(\"empty observable cannot be cancelled\");\n\t\t}\n\t};\n}\n\nnamespace Si\n{\n#if SILICIUM_RX_TUPLE_AVAILABLE\n\tBOOST_AUTO_TEST_CASE(reactive_take)\n\t{\n\t\tauto zeros = rx::generate([]{ return 0; });\n\t\tauto ones = rx::generate([]{ return 1; });\n\t\tauto both = rx::make_tuple(zeros, ones);\n\t\tstd::vector<std::tuple<int, int>> const expected(4, std::make_tuple(0, 1));\n\t\tstd::vector<std::tuple<int, int>> const generated = rx::take(both, expected.size());\n\t\tBOOST_CHECK(expected == generated);\n\t}\n#endif\n\n#if SILICIUM_RX_TUPLE_AVAILABLE\n\tBOOST_AUTO_TEST_CASE(reactive_transform)\n\t{\n\t\tauto twos = rx::generate([]{ return 2; });\n\t\tauto ones = rx::generate([]{ return 1; });\n\t\tauto both = rx::make_tuple(twos, ones);\n\t\tauto added = rx::transform(both, [](std::tuple<int, int> const &element)\n\t\t{\n\t\t\treturn std::get<0>(element) + std::get<1>(element);\n\t\t});\n\t\tstd::vector<int> const expected(4, 3);\n\t\tstd::vector<int> const generated = rx::take(added, expected.size());\n\t\tBOOST_CHECK(expected == generated);\n\t}\n#endif\n\n#if SILICIUM_RX_TUPLE_AVAILABLE\n\tBOOST_AUTO_TEST_CASE(reactive_bridge)\n\t{\n\t\tauto bridge = std::make_shared<rx::bridge<int>>();\n\t\trx::ptr_observable<int, std::shared_ptr<rx::observable<int>>> first(bridge);\n\t\tauto ones = rx::generate([]{ return 1; });\n\t\tauto both = rx::make_tuple(first, ones);\n\t\tauto added = rx::transform(both, [](std::tuple<int, int> const &element)\n\t\t{\n\t\t\treturn std::get<0>(element) + std::get<1>(element);\n\t\t});\n\t\tstd::vector<int> generated;\n\t\tauto consumer = rx::consume<int>([&generated](int element)\n\t\t{\n\t\t\tgenerated.emplace_back(element);\n\t\t});\n\t\tBOOST_CHECK(generated.empty());\n\n\t\tadded.async_get_one(consumer);\n\t\tBOOST_CHECK(generated.empty());\n\n\t\tbridge->got_element(2);\n\t\tstd::vector<int> const expected(1, 3);\n\t\tBOOST_CHECK(expected == generated);\n\t}\n#endif\n\n\tBOOST_AUTO_TEST_CASE(reactive_make_buffer)\n\t{\n\t\tauto bridge = std::make_shared<rx::bridge<int>>();\n\t\trx::ptr_observable<int, std::shared_ptr<rx::observable<int>>> first{bridge};\n\t\tauto buf = rx::make_buffer(first, 2);\n\n\t\tstd::vector<int> generated;\n\t\tauto consumer = rx::consume<int>([&generated](int element)\n\t\t{\n\t\t\tgenerated.emplace_back(element);\n\t\t});\n\t\tBOOST_CHECK(generated.empty());\n\n\t\tfor (size_t i = 0; i < 2; ++i)\n\t\t{\n\t\t\tBOOST_REQUIRE(bridge->is_waiting());\n\t\t\tbridge->got_element(7);\n\t\t}\n\t\tBOOST_CHECK(!bridge->is_waiting());\n\t\tBOOST_CHECK(generated.empty());\n\n\t\tbuf.async_get_one(consumer);\n\t\tstd::vector<int> expected(1, 7);\n\t\tBOOST_CHECK(expected == generated);\n\n\t\tbuf.async_get_one(consumer);\n\t\texpected.emplace_back(7);\n\t\tBOOST_CHECK(expected == generated);\n\n\t\tbuf.async_get_one(consumer);\n\t\tBOOST_CHECK(expected == generated);\n\t}\n\n\tBOOST_AUTO_TEST_CASE(reactive_coroutine_generate)\n\t{\n\t\tauto co = rx::make_coroutine<int>([](rx::yield_context<int> &yield) -> void\n\t\t{\n\t\t\tyield(1);\n\t\t\tyield(2);\n\t\t});\n\t\tstd::vector<int> generated;\n\t\tauto collector = rx::consume<int>([&generated](int element)\n\t\t{\n\t\t\tgenerated.emplace_back(element);\n\t\t});\n\t\tfor (;;)\n\t\t{\n\t\t\tauto old_size = generated.size();\n\t\t\tco.async_get_one(collector);\n\t\t\tif (generated.size() == old_size)\n\t\t\t{\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\tBOOST_REQUIRE(generated.size() == old_size + 1);\n\t\t}\n\t\tstd::vector<int> const expected{1, 2};\n\t\tBOOST_CHECK(expected == generated);\n\t}\n\n\tBOOST_AUTO_TEST_CASE(reactive_coroutine_get_one)\n\t{\n\t\trx::bridge<int> asyncs;\n\t\tbool exited_cleanly = false;\n\t\tauto co = rx::make_coroutine<int>([&asyncs, &exited_cleanly](rx::yield_context<int> &yield) -> void\n\t\t{\n\t\t\tauto a = yield.get_one(asyncs);\n\t\t\tBOOST_REQUIRE(a);\n\t\t\tyield(*a - 1);\n\t\t\texited_cleanly = true;\n\t\t});\n\t\tstd::vector<int> generated;\n\t\tauto collector = rx::consume<int>([&generated](int element)\n\t\t{\n\t\t\tgenerated.emplace_back(element);\n\t\t});\n\t\tco.async_get_one(collector);\n\t\tBOOST_REQUIRE(generated.empty());\n\t\tasyncs.got_element(4);\n\n\t\t\/\/TODO: reading past the end should not be the required way to avoid a force unwind of the coroutine\n\t\t\/\/ because the unwinding is done by throwing an exception.\n\t\tco.async_get_one(collector);\n\t\tBOOST_CHECK(exited_cleanly);\n\n\t\tstd::vector<int> const expected{3};\n\t\tBOOST_CHECK(expected == generated);\n\t}\n\n#if SILICIUM_RX_VARIANT_AVAILABLE\n\tBOOST_AUTO_TEST_CASE(reactive_make_variant)\n\t{\n\t\trx::bridge<int> first;\n\t\trx::bridge<boost::container::string> second;\n\t\tauto variants = make_variant(rx::ref(first), rx::ref(second));\n\n\t\ttypedef Si::fast_variant<int, boost::container::string> variant;\n\t\tstd::vector<variant> produced;\n\t\tauto consumer = rx::consume<variant>([&produced](variant element)\n\t\t{\n\t\t\tproduced.emplace_back(std::move(element));\n\t\t});\n\n\t\tvariants.async_get_one(consumer);\n\t\tBOOST_CHECK(produced.empty());\n\t\tfirst.got_element(4);\n\n\t\tvariants.async_get_one(consumer);\n\t\tBOOST_CHECK_EQUAL(1,produced.size());\n\t\tsecond.got_element(\"Hi\");\n\n\t\tstd::vector<variant> const expected\n\t\t{\n\t\t\t4,\n\t\t\tboost::container::string(\"Hi\")\n\t\t};\n\n\t\tBOOST_CHECK(expected == produced);\n\t\tBOOST_CHECK(!rx::get_immediate(variants));\n\t}\n#endif\n\n\ttemplate <class Element, class Action>\n\tstruct blocking_then_state : rx::observer<Element>\n\t{\n\t\tboost::asio::io_service &dispatcher;\n\t\tboost::optional<boost::asio::io_service::work> blocker;\n\t\tAction action;\n\t\trx::observable<Element> *from = nullptr;\n\n\t\texplicit blocking_then_state(boost::asio::io_service &dispatcher, Action action)\n\t\t\t: dispatcher(dispatcher)\n\t\t\t, blocker(boost::in_place(boost::ref(dispatcher)))\n\t\t\t, action(std::move(action))\n\t\t{\n\t\t}\n\n\t\t~blocking_then_state()\n\t\t{\n\t\t\tif (!from)\n\t\t\t{\n\t\t\t\treturn;\n\t\t\t}\n\t\t\tfrom->cancel();\n\t\t}\n\n\t\tvirtual void got_element(Element value) SILICIUM_OVERRIDE\n\t\t{\n\t\t\tdispatcher.post(boost::bind<void>(action, boost::make_optional(std::move(value))));\n\t\t\tblocker.reset();\n\t\t}\n\n\t\tvirtual void ended() SILICIUM_OVERRIDE\n\t\t{\n\t\t\tdispatcher.post(boost::bind<void>(action, boost::optional<Element>()));\n\t\t\tblocker.reset();\n\t\t}\n\t};\n\n\ttemplate <class Element, class Action>\n\tauto blocking_then(boost::asio::io_service &io, rx::observable<Element> &from, Action &&action) -> std::shared_ptr<blocking_then_state<Element, typename std::decay<Action>::type>>\n\t{\n\t\tauto state = std::make_shared<blocking_then_state<Element, typename std::decay<Action>::type>>(io, std::forward<Action>(action));\n\t\tfrom.async_get_one(*state);\n\t\tstate->from = &from;\n\t\treturn state;\n\t}\n\n\tBOOST_AUTO_TEST_CASE(reactive_process)\n\t{\n\t\trx::empty<char> input;\n\t\trx::process proc = rx::launch_process(\"\/usr\/bin\/which\", {\"which\"}, input);\n\n\t\tboost::asio::io_service io;\n\t\tauto blocking = blocking_then(io, proc.exit_code, [](boost::optional<int> ec)\n\t\t{\n\t\t\tBOOST_CHECK_EQUAL(0, ec);\n\t\t});\n\t\tio.run();\n\t}\n}\n<commit_msg>design a replacement for boost::signal<commit_after>#include <reactive\/buffer.hpp>\n#include <reactive\/process.hpp>\n#include <reactive\/variant.hpp>\n#include <reactive\/coroutine.hpp>\n#include <reactive\/generate.hpp>\n#include <reactive\/consume.hpp>\n#include <reactive\/tuple.hpp>\n#include <reactive\/ptr_observable.hpp>\n#include <reactive\/transform.hpp>\n#include <reactive\/bridge.hpp>\n#include <reactive\/take.hpp>\n#include <reactive\/enumerate.hpp>\n#include <reactive\/cache.hpp>\n#include <reactive\/connector.hpp>\n#include <reactive\/receiver.hpp>\n#include <reactive\/deref_optional.hpp>\n#include <boost\/container\/string.hpp>\n#include <boost\/test\/unit_test.hpp>\n#include <boost\/bind.hpp>\n#include <boost\/container\/flat_map.hpp>\n\nnamespace rx\n{\n\ttemplate <class Element>\n\tstruct empty : observable<Element>\n\t{\n\t\tvirtual void async_get_one(observer<Element> &receiver) SILICIUM_OVERRIDE\n\t\t{\n\t\t\treturn receiver.ended();\n\t\t}\n\n\t\tvirtual void cancel() SILICIUM_OVERRIDE\n\t\t{\n\t\t\tthrow std::logic_error(\"empty observable cannot be cancelled\");\n\t\t}\n\t};\n}\n\nnamespace Si\n{\n#if SILICIUM_RX_TUPLE_AVAILABLE\n\tBOOST_AUTO_TEST_CASE(reactive_take)\n\t{\n\t\tauto zeros = rx::generate([]{ return 0; });\n\t\tauto ones = rx::generate([]{ return 1; });\n\t\tauto both = rx::make_tuple(zeros, ones);\n\t\tstd::vector<std::tuple<int, int>> const expected(4, std::make_tuple(0, 1));\n\t\tstd::vector<std::tuple<int, int>> const generated = rx::take(both, expected.size());\n\t\tBOOST_CHECK(expected == generated);\n\t}\n#endif\n\n#if SILICIUM_RX_TUPLE_AVAILABLE\n\tBOOST_AUTO_TEST_CASE(reactive_transform)\n\t{\n\t\tauto twos = rx::generate([]{ return 2; });\n\t\tauto ones = rx::generate([]{ return 1; });\n\t\tauto both = rx::make_tuple(twos, ones);\n\t\tauto added = rx::transform(both, [](std::tuple<int, int> const &element)\n\t\t{\n\t\t\treturn std::get<0>(element) + std::get<1>(element);\n\t\t});\n\t\tstd::vector<int> const expected(4, 3);\n\t\tstd::vector<int> const generated = rx::take(added, expected.size());\n\t\tBOOST_CHECK(expected == generated);\n\t}\n#endif\n\n#if SILICIUM_RX_TUPLE_AVAILABLE\n\tBOOST_AUTO_TEST_CASE(reactive_bridge)\n\t{\n\t\tauto bridge = std::make_shared<rx::bridge<int>>();\n\t\trx::ptr_observable<int, std::shared_ptr<rx::observable<int>>> first(bridge);\n\t\tauto ones = rx::generate([]{ return 1; });\n\t\tauto both = rx::make_tuple(first, ones);\n\t\tauto added = rx::transform(both, [](std::tuple<int, int> const &element)\n\t\t{\n\t\t\treturn std::get<0>(element) + std::get<1>(element);\n\t\t});\n\t\tstd::vector<int> generated;\n\t\tauto consumer = rx::consume<int>([&generated](int element)\n\t\t{\n\t\t\tgenerated.emplace_back(element);\n\t\t});\n\t\tBOOST_CHECK(generated.empty());\n\n\t\tadded.async_get_one(consumer);\n\t\tBOOST_CHECK(generated.empty());\n\n\t\tbridge->got_element(2);\n\t\tstd::vector<int> const expected(1, 3);\n\t\tBOOST_CHECK(expected == generated);\n\t}\n#endif\n\n\tBOOST_AUTO_TEST_CASE(reactive_make_buffer)\n\t{\n\t\tauto bridge = std::make_shared<rx::bridge<int>>();\n\t\trx::ptr_observable<int, std::shared_ptr<rx::observable<int>>> first{bridge};\n\t\tauto buf = rx::make_buffer(first, 2);\n\n\t\tstd::vector<int> generated;\n\t\tauto consumer = rx::consume<int>([&generated](int element)\n\t\t{\n\t\t\tgenerated.emplace_back(element);\n\t\t});\n\t\tBOOST_CHECK(generated.empty());\n\n\t\tfor (size_t i = 0; i < 2; ++i)\n\t\t{\n\t\t\tBOOST_REQUIRE(bridge->is_waiting());\n\t\t\tbridge->got_element(7);\n\t\t}\n\t\tBOOST_CHECK(!bridge->is_waiting());\n\t\tBOOST_CHECK(generated.empty());\n\n\t\tbuf.async_get_one(consumer);\n\t\tstd::vector<int> expected(1, 7);\n\t\tBOOST_CHECK(expected == generated);\n\n\t\tbuf.async_get_one(consumer);\n\t\texpected.emplace_back(7);\n\t\tBOOST_CHECK(expected == generated);\n\n\t\tbuf.async_get_one(consumer);\n\t\tBOOST_CHECK(expected == generated);\n\t}\n\n\tBOOST_AUTO_TEST_CASE(reactive_coroutine_generate)\n\t{\n\t\tauto co = rx::make_coroutine<int>([](rx::yield_context<int> &yield) -> void\n\t\t{\n\t\t\tyield(1);\n\t\t\tyield(2);\n\t\t});\n\t\tstd::vector<int> generated;\n\t\tauto collector = rx::consume<int>([&generated](int element)\n\t\t{\n\t\t\tgenerated.emplace_back(element);\n\t\t});\n\t\tfor (;;)\n\t\t{\n\t\t\tauto old_size = generated.size();\n\t\t\tco.async_get_one(collector);\n\t\t\tif (generated.size() == old_size)\n\t\t\t{\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\tBOOST_REQUIRE(generated.size() == old_size + 1);\n\t\t}\n\t\tstd::vector<int> const expected{1, 2};\n\t\tBOOST_CHECK(expected == generated);\n\t}\n\n\tBOOST_AUTO_TEST_CASE(reactive_coroutine_get_one)\n\t{\n\t\trx::bridge<int> asyncs;\n\t\tbool exited_cleanly = false;\n\t\tauto co = rx::make_coroutine<int>([&asyncs, &exited_cleanly](rx::yield_context<int> &yield) -> void\n\t\t{\n\t\t\tauto a = yield.get_one(asyncs);\n\t\t\tBOOST_REQUIRE(a);\n\t\t\tyield(*a - 1);\n\t\t\texited_cleanly = true;\n\t\t});\n\t\tstd::vector<int> generated;\n\t\tauto collector = rx::consume<int>([&generated](int element)\n\t\t{\n\t\t\tgenerated.emplace_back(element);\n\t\t});\n\t\tco.async_get_one(collector);\n\t\tBOOST_REQUIRE(generated.empty());\n\t\tasyncs.got_element(4);\n\n\t\t\/\/TODO: reading past the end should not be the required way to avoid a force unwind of the coroutine\n\t\t\/\/ because the unwinding is done by throwing an exception.\n\t\tco.async_get_one(collector);\n\t\tBOOST_CHECK(exited_cleanly);\n\n\t\tstd::vector<int> const expected{3};\n\t\tBOOST_CHECK(expected == generated);\n\t}\n\n#if SILICIUM_RX_VARIANT_AVAILABLE\n\tBOOST_AUTO_TEST_CASE(reactive_make_variant)\n\t{\n\t\trx::bridge<int> first;\n\t\trx::bridge<boost::container::string> second;\n\t\tauto variants = make_variant(rx::ref(first), rx::ref(second));\n\n\t\ttypedef Si::fast_variant<int, boost::container::string> variant;\n\t\tstd::vector<variant> produced;\n\t\tauto consumer = rx::consume<variant>([&produced](variant element)\n\t\t{\n\t\t\tproduced.emplace_back(std::move(element));\n\t\t});\n\n\t\tvariants.async_get_one(consumer);\n\t\tBOOST_CHECK(produced.empty());\n\t\tfirst.got_element(4);\n\n\t\tvariants.async_get_one(consumer);\n\t\tBOOST_CHECK_EQUAL(1,produced.size());\n\t\tsecond.got_element(\"Hi\");\n\n\t\tstd::vector<variant> const expected\n\t\t{\n\t\t\t4,\n\t\t\tboost::container::string(\"Hi\")\n\t\t};\n\n\t\tBOOST_CHECK(expected == produced);\n\t\tBOOST_CHECK(!rx::get_immediate(variants));\n\t}\n#endif\n\n\ttemplate <class Element, class Action>\n\tstruct blocking_then_state : rx::observer<Element>\n\t{\n\t\tboost::asio::io_service &dispatcher;\n\t\tboost::optional<boost::asio::io_service::work> blocker;\n\t\tAction action;\n\t\trx::observable<Element> *from = nullptr;\n\n\t\texplicit blocking_then_state(boost::asio::io_service &dispatcher, Action action)\n\t\t\t: dispatcher(dispatcher)\n\t\t\t, blocker(boost::in_place(boost::ref(dispatcher)))\n\t\t\t, action(std::move(action))\n\t\t{\n\t\t}\n\n\t\t~blocking_then_state()\n\t\t{\n\t\t\tif (!from)\n\t\t\t{\n\t\t\t\treturn;\n\t\t\t}\n\t\t\tfrom->cancel();\n\t\t}\n\n\t\tvirtual void got_element(Element value) SILICIUM_OVERRIDE\n\t\t{\n\t\t\tdispatcher.post(boost::bind<void>(action, boost::make_optional(std::move(value))));\n\t\t\tblocker.reset();\n\t\t}\n\n\t\tvirtual void ended() SILICIUM_OVERRIDE\n\t\t{\n\t\t\tdispatcher.post(boost::bind<void>(action, boost::optional<Element>()));\n\t\t\tblocker.reset();\n\t\t}\n\t};\n\n\ttemplate <class Element, class Action>\n\tauto blocking_then(boost::asio::io_service &io, rx::observable<Element> &from, Action &&action) -> std::shared_ptr<blocking_then_state<Element, typename std::decay<Action>::type>>\n\t{\n\t\tauto state = std::make_shared<blocking_then_state<Element, typename std::decay<Action>::type>>(io, std::forward<Action>(action));\n\t\tfrom.async_get_one(*state);\n\t\tstate->from = &from;\n\t\treturn state;\n\t}\n\n\tBOOST_AUTO_TEST_CASE(reactive_process)\n\t{\n\t\trx::empty<char> input;\n\t\trx::process proc = rx::launch_process(\"\/usr\/bin\/which\", {\"which\"}, input);\n\n\t\tboost::asio::io_service io;\n\t\tauto blocking = blocking_then(io, proc.exit_code, [](boost::optional<int> ec)\n\t\t{\n\t\t\tBOOST_CHECK_EQUAL(0, ec);\n\t\t});\n\t\tio.run();\n\t}\n}\n\nnamespace rx\n{\n\ttemplate <class Element>\n\tusing signal_observer_map = boost::container::flat_map<observer<Element> *, bool>;\n\n\ttemplate <class Element>\n\tstruct connection : observable<Element>\n\t{\n\t\ttypedef Element element_type;\n\n\t\tconnection()\n\t\t{\n\t\t}\n\n\t\texplicit connection(signal_observer_map<Element> &connections)\n\t\t\t: connections(&connections)\n\t\t{\n\t\t}\n\n\t\tconnection(connection &&other)\n\t\t\t: connections(other.connections)\n\t\t\t, receiver_(other.receiver_)\n\t\t{\n\t\t\tother.connections = nullptr;\n\t\t\tother.receiver_ = nullptr;\n\t\t}\n\n\t\tconnection &operator = (connection &&other)\n\t\t{\n\t\t\tboost::swap(connections, other.connections);\n\t\t\tboost::swap(receiver_, other.receiver_);\n\t\t\treturn *this;\n\t\t}\n\n\t\t~connection()\n\t\t{\n\t\t\tif (!connections)\n\t\t\t{\n\t\t\t\treturn;\n\t\t\t}\n\t\t\tconnections->erase(receiver_);\n\t\t}\n\n\t\tvirtual void async_get_one(observer<element_type> &receiver) SILICIUM_OVERRIDE\n\t\t{\n\t\t\tauto * const old_receiver = receiver_;\n\t\t\tconnections->insert(std::make_pair(&receiver, true)).first->second = true;\n\t\t\tif (old_receiver && (old_receiver != &receiver))\n\t\t\t{\n\t\t\t\tauto i = connections->find(receiver_);\n\t\t\t\tassert(i->second);\n\t\t\t\tconnections->erase(i);\n\t\t\t}\n\t\t\treceiver_ = &receiver;\n\t\t}\n\n\t\tvirtual void cancel() SILICIUM_OVERRIDE\n\t\t{\n\t\t\tassert(receiver_);\n\t\t\tsize_t erased = connections->erase(exchange(receiver_, nullptr));\n\t\t\tassert(erased == 1);\n\t\t}\n\n\tprivate:\n\n\t\tsignal_observer_map<Element> *connections = nullptr;\n\t\tobserver<Element> *receiver_ = nullptr;\n\n\t\tBOOST_DELETED_FUNCTION(connection(connection const &))\n\t\tBOOST_DELETED_FUNCTION(connection &operator = (connection const &))\n\t};\n\n\ttemplate <class Element>\n\tstruct signal\n\t{\n\t\ttypedef connection<Element> connection_type;\n\n\t\tconnection_type connect()\n\t\t{\n\t\t\treturn connection_type(observers);\n\t\t}\n\n\t\tvoid emit_one(Element const &value)\n\t\t{\n\t\t\tfor (auto &observer : observers)\n\t\t\t{\n\t\t\t\tif (observer.second)\n\t\t\t\t{\n\t\t\t\t\tobserver.second = false;\n\t\t\t\t\tobserver.first->got_element(value);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\tprivate:\n\n\t\tsignal_observer_map<Element> observers;\n\t};\n}\n\nnamespace\n{\n\tBOOST_AUTO_TEST_CASE(reactive_signal)\n\t{\n\t\trx::signal<int> s;\n\t\tauto con1 = s.connect();\n\t\tauto con2 = s.connect();\n\t\tstd::vector<int> generated;\n\t\tauto consumer = rx::consume<int>([&generated](boost::optional<int> value)\n\t\t{\n\t\t\tBOOST_REQUIRE(value);\n\t\t\tgenerated.emplace_back(*value);\n\t\t});\n\t\tcon1.async_get_one(consumer);\n\t\ts.emit_one(2);\n\t\tcon2 = std::move(con1);\n\t\tcon2.async_get_one(consumer);\n\t\ts.emit_one(3);\n\t\ts.emit_one(4);\n\t\tstd::vector<int> const expected{2, 3};\n\t\tBOOST_CHECK(expected == generated);\n\t}\n}\n<|endoftext|>"} {"text":"<commit_before>#include <MdisPlugin.h>\n#include <MdisNacSensorModel.h>\n#include <IsdReader.h>\n\n#include <csm\/Isd.h>\n\n#include <gtest\/gtest.h>\n\n\n\/**\n * Sub-class MdisNacSensorModel to get test its protected linear algebra methods.\n * \n * We should be testing the protected methods of MdisNacSensorModel since imageToGround\n * depends on intersect, which depends on project, etc.\n *\/\nclass TestableMdisNacSensorModel : public MdisNacSensorModel {\n \/\/ Give linear algebra methods public accessing when using instances of this class.\n public:\n using MdisNacSensorModel::computeElevation;\n using MdisNacSensorModel::intersect;\n using MdisNacSensorModel::perpendicular;\n using MdisNacSensorModel::project;\n using MdisNacSensorModel::dot;\n using MdisNacSensorModel::magnitude;\n using MdisNacSensorModel::normalize;\n};\n\n\n\/\/ Set up a fixture (i.e. objects we can use throughout test)\nclass MdisNacSensorModelTest : public ::testing::Test {\n protected:\n \/\/ Per test-case setup and teardown (e.g. once for this MdisNacSensorModelTest)\n static void SetUpTestCase() {\n dataFile = \".\/data\/EN1007907102M.json\";\n isd = readISD(dataFile);\n \/\/ printISD(*isd);\n }\n \n static void TearDownTestCase() {\n delete isd;\n isd = NULL;\n }\n \n \/\/ Per test setup and teardown (e.g. each TEST_F)\n virtual void SetUp() {\n tolerance = 0.00001;\n }\n\n virtual void TearDown() {}\n\n static csm::Isd *isd; \/\/ ISD converted from JSON to use for creating model.\n static std::string dataFile; \/\/ JSON data file to be converted to ISD for testing.\n \n double tolerance; \/\/ Tolerance to be used for double comparison.\n MdisPlugin mdisPlugin; \/\/ Plugin used to create a model from ISD.\n MdisNacSensorModel defaultMdisNac; \/\/ A default constructed MdisNacSensorModel.\n TestableMdisNacSensorModel testMath; \/\/ Subclassed MdisNacSensorModel for protected methods.\n};\n\n\ncsm::Isd *MdisNacSensorModelTest::isd = NULL;\nstd::string MdisNacSensorModelTest::dataFile;\n\n\n\/* \n * Test imageToGround - truth extracted as follows:\n * setisis isis3\n * qview \/work\/projects\/IAA_camera\/data\/EN100790102M.cub\n * F (selects \"Find Tool\")\n * On top toolbar, select \"Find Point\"\n * Type in 512.5, 512.5 for Sample\/Line (ISIS3 pixel center = 1,1)\n * Click \"Record Point\"\n * Check \"XYZ\" -> { 1132.18, -1597.75, 1455.66 }\n *\/\nTEST_F(MdisNacSensorModelTest, imageToGround1) {\n \/\/ CSM Line\/Sample center = 512, 512\n csm::ImageCoord point(512.0, 512.0);\n double height = 0.0;\n \n \/\/ Create a model from the ISD so we can test a valid image.\n \/\/ Make sure the isd was read correctly.\n if (!isd) {\n FAIL() << \"Could not create isd from file: \" << dataFile;\n }\n std::string modelName = MdisNacSensorModel::_SENSOR_MODEL_NAME;\n csm::Model *validModel = mdisPlugin.constructModelFromISD(*isd, modelName);\n \/\/ We could static_cast, but may be hard to debug if it doesn't correctly cast.\n MdisNacSensorModel *mdisModel = dynamic_cast<MdisNacSensorModel *>(validModel);\n \n \/\/ Fatal failure if the downcast doesn't work\n if (!mdisModel) {\n FAIL() << \"Could not downcast Model* to MdisNacSensorModel*.\";\n }\n \n csm::EcefCoord xyz = mdisModel->imageToGround(point, height);\n double truth[] = { 1132.18*1000, -1597.75*1000, 1455.66*1000 };\n EXPECT_EQ(truth[0], xyz.x);\n EXPECT_EQ(truth[1], xyz.y);\n EXPECT_EQ(truth[2], xyz.z);\n \n \/\/ Remove the memory we took ownership of.\n delete mdisModel;\n}\n\n\n\/\/ Tests the getModelState() method with a default constructed MdisNacSensorModel.\nTEST_F(MdisNacSensorModelTest, getModelStateDefault) {\n EXPECT_EQ(defaultMdisNac.getModelState(), std::string());\n}\n\n\n\/\/ Test getElevation\nTEST_F(MdisNacSensorModelTest, computeElevationOnSphere) {\n \/\/ (1\/4)^2 + (1\/2)^2 + z^2 = 1^2; z^2 = 11\/16\n double elevation = testMath.computeElevation(0.25, 0.5, sqrt(11)\/4.0);\n EXPECT_EQ(0.0, elevation);\n}\n\n\n\/\/ Test intersect\nTEST_F(MdisNacSensorModelTest, intersectTrivial) {\n std::vector<double> position { 0.0, 0.0, 1.5 };\n std::vector<double> look { 0.0, 0.0, -0.5 };\n csm::EcefCoord intersectGround = testMath.intersect(position, look, 1.0);\n EXPECT_EQ(0.0, intersectGround.x);\n EXPECT_EQ(0.0, intersectGround.y);\n EXPECT_EQ(1.0, intersectGround.z);\n}\n\nTEST_F(MdisNacSensorModelTest, intersectLookingAway) {\n std::vector<double> position { 0.0, 0.0, 2.0 };\n std::vector<double> look { 0.0, 0.0, 0.5 };\n csm::EcefCoord ground = testMath.intersect(position, look, 1.0);\n EXPECT_EQ(0.0, ground.x);\n EXPECT_EQ(0.0, ground.y);\n EXPECT_EQ(0.0, ground.z);\n}\n\n\n\/\/ Test perpendicular\nTEST_F(MdisNacSensorModelTest, perpendicularNonZeros) {\n std::vector<double> v1(3), v2(3);\n v1[0] = 0.0;\n v1[1] = 0.0;\n v1[2] = 1.5;\n v2[0] = 0.0;\n v2[1] = -0.25;\n v2[2] = -0.5;\n std::vector<double> result = testMath.perpendicular(v1, v2);\n EXPECT_NEAR(0.0, result[0], tolerance);\n EXPECT_NEAR(-0.6, result[1], tolerance);\n EXPECT_NEAR(0.3, result[2], tolerance);\n}\n\n\n\/\/ Test project\nTEST_F(MdisNacSensorModelTest, projectNonZeros) {\n std::vector<double> v1(3), v2(3);\n v1[0] = 0.0;\n v1[1] = 0.0;\n v1[2] = 1.5;\n v2[0] = 0.0;\n v2[1] = -0.25;\n v2[2] = -0.5;\n std::vector<double> result = testMath.project(v1, v2);\n EXPECT_NEAR(0.0, result[0], tolerance);\n EXPECT_NEAR(0.6, result[1], tolerance);\n EXPECT_NEAR(1.2, result[2], tolerance);\n}\n\n\n\/\/ Test dot\n\/\/ TODO: use value-parameterized tests\nTEST_F(MdisNacSensorModelTest, dotZeroVectors) {\n std::vector<double> v1(3, 0.0), v2(3, 0.0);\n EXPECT_EQ(0.0, testMath.dot(v1, v2));\n}\n\nTEST_F(MdisNacSensorModelTest, dotOneZeroVector) {\n std::vector<double> v1(3, 0.0), v2(3);\n v2[0] = 1.0;\n v2[1] = 2.0;\n v2[2] = 3.0;\n EXPECT_EQ(0.0, testMath.dot(v1, v2));\n}\n\nTEST_F(MdisNacSensorModelTest, dotVectors) {\n std::vector<double> v1(3), v2(3);\n v1[0] = 1.0;\n v1[1] = 2.0;\n v1[2] = 3.0;\n v2[0] = -2.0;\n v2[1] = 2.0;\n v2[2] = 3.0;\n EXPECT_EQ(11.0, testMath.dot(v1, v2));\n}\n\n\n\/\/ Test magnitude\nTEST_F(MdisNacSensorModelTest, magnitudeZero) {\n std::vector<double> v(3, 0.0);\n EXPECT_EQ(0.0, testMath.magnitude(v));\n}\n\nTEST_F(MdisNacSensorModelTest, magnitudePositive) {\n std::vector<double>v(3);\n v[0] = 3.0;\n v[1] = 4.0;\n v[2] = 5.0;\n EXPECT_EQ(sqrt(50.0), testMath.magnitude(v));\n}\n\nTEST_F(MdisNacSensorModelTest, magnitudeNegative) {\n std::vector<double>v(3);\n v[0] = -3.0;\n v[1] = -4.0;\n v[2] = -5.0;\n EXPECT_EQ(sqrt(50.0), testMath.magnitude(v));\n}\n\n\n\/\/ Test normalize\nTEST_F(MdisNacSensorModelTest, normalizeVector) {\n std::vector<double>v(3);\n v[0] = 2.0;\n v[1] = 3.0;\n v[2] = 4.0;\n std::vector<double> result = testMath.normalize(v);\n EXPECT_EQ((v[0] \/ sqrt(29.0)), result[0]);\n EXPECT_EQ((v[1] \/ sqrt(29.0)), result[1]);\n EXPECT_EQ((v[2] \/ sqrt(29.0)), result[2]);\n}\n<commit_msg>Added preliminary groundToImage test. Refactor MdisNacSensorModelTest to avoid code duplication between imageToGround and groundToImage test.<commit_after>#include <MdisPlugin.h>\n#include <MdisNacSensorModel.h>\n#include <IsdReader.h>\n\n#include <csm\/Isd.h>\n\n#include <gtest\/gtest.h>\n\n\n\/**\n * Sub-class MdisNacSensorModel to get test its protected linear algebra methods.\n * \n * We should be testing the protected methods of MdisNacSensorModel since imageToGround\n * depends on intersect, which depends on project, etc.\n *\/\nclass TestableMdisNacSensorModel : public MdisNacSensorModel {\n \/\/ Give linear algebra methods public accessing when using instances of this class.\n public:\n using MdisNacSensorModel::computeElevation;\n using MdisNacSensorModel::intersect;\n using MdisNacSensorModel::perpendicular;\n using MdisNacSensorModel::project;\n using MdisNacSensorModel::dot;\n using MdisNacSensorModel::magnitude;\n using MdisNacSensorModel::normalize;\n};\n\n\n\/\/ Set up a fixture (i.e. objects we can use throughout test)\nclass MdisNacSensorModelTest : public ::testing::Test {\n protected:\n \n \/\/ Per test-case setup and teardown (e.g. once for this MdisNacSensorModelTest)\n static void SetUpTestCase() {\n dataFile = \".\/data\/EN1007907102M.json\";\n isd = readISD(dataFile);\n \/\/ printISD(*isd);\n \n \/\/ Make sure the isd was read correctly.\n if (isd == nullptr) {\n FAIL() << \"Could not create isd from file: \" << dataFile;\n }\n \n \/\/ Create a model from the ISD so we can test a valid image.\n std::string modelName = MdisNacSensorModel::_SENSOR_MODEL_NAME;\n csm::Model *validModel = mdisPlugin.constructModelFromISD(*isd, modelName);\n \n \/\/ We could static_cast, but may be hard to debug if it doesn't correctly cast.\n mdisModel = dynamic_cast<MdisNacSensorModel *>(validModel);\n std::cout << \"Construction model: \" << mdisModel << \"\\n\";\n \n \/\/ Fatal failure if the downcast doesn't work\n if (mdisModel == nullptr) {\n FAIL() << \"Could not downcast Model* to MdisNacSensorModel*.\";\n }\n }\n \n static void TearDownTestCase() {\n delete isd;\n delete mdisModel;\n }\n \n static csm::Isd *isd; \/\/ ISD converted from JSON to use for creating model.\n static std::string dataFile; \/\/ JSON data file to be converted to ISD for testing.\n static MdisPlugin mdisPlugin; \/\/ Plugin used to create a model from ISD.\n static MdisNacSensorModel *mdisModel; \/\/ MDIS-NAC sensor model created with ISD.\n \n \n \/\/ Per test setup and teardown (e.g. each TEST_F)\n virtual void SetUp() {\n tolerance = 0.00001;\n }\n\n virtual void TearDown() {}\n \n double tolerance; \/\/ Tolerance to be used for double comparison.\n MdisNacSensorModel defaultMdisNac; \/\/ A default constructed MdisNacSensorModel.\n TestableMdisNacSensorModel testMath; \/\/ Subclassed MdisNacSensorModel for protected methods.\n};\n\n\ncsm::Isd *MdisNacSensorModelTest::isd = nullptr;\nstd::string MdisNacSensorModelTest::dataFile;\nMdisPlugin MdisNacSensorModelTest::mdisPlugin;\nMdisNacSensorModel *MdisNacSensorModelTest::mdisModel = nullptr;\n\n\n\/* \n * Test imageToGround - truth extracted as follows:\n * setisis isis3\n * qview \/work\/projects\/IAA_camera\/data\/EN100790102M.cub\n * F (selects \"Find Tool\")\n * On top toolbar, select \"Find Point\"\n * Type in 512.5, 512.5 for Sample\/Line (ISIS3 pixel center = 1,1)\n * Click \"Record Point\"\n * Check \"XYZ\" -> { 1132.18, -1597.75, 1455.66 }\n *\/\nTEST_F(MdisNacSensorModelTest, imageToGround1) {\n \/\/ CSM Line\/Sample center = 512, 512\n csm::ImageCoord point(512.0, 512.0);\n double height = 0.0; \n csm::EcefCoord xyz = mdisModel->imageToGround(point, height);\n double truth[] = { 1132.18*1000, -1597.75*1000, 1455.66*1000 };\n EXPECT_EQ(truth[0], xyz.x);\n EXPECT_EQ(truth[1], xyz.y);\n EXPECT_EQ(truth[2], xyz.z);\n}\n\n\n\/\/ Test groundToImage\nTEST_F(MdisNacSensorModelTest, groundToImage1) {\n double x = 1132.18*1000;\n double y = -1597.75*1000;\n double z = 1455.66*1000;\n csm::EcefCoord xyz(x, y, z);\n csm::ImageCoord pt = mdisModel->groundToImage(xyz);\n EXPECT_EQ(512.0, pt.line);\n EXPECT_EQ(512.0, pt.samp);\n}\n\n\n\/\/ Tests the getModelState() method with a default constructed MdisNacSensorModel.\nTEST_F(MdisNacSensorModelTest, getModelStateDefault) {\n EXPECT_EQ(defaultMdisNac.getModelState(), std::string());\n}\n\n\n\/\/ Test getElevation\nTEST_F(MdisNacSensorModelTest, computeElevationOnSphere) {\n \/\/ (1\/4)^2 + (1\/2)^2 + z^2 = 1^2; z^2 = 11\/16\n double elevation = testMath.computeElevation(0.25, 0.5, sqrt(11)\/4.0);\n EXPECT_EQ(0.0, elevation);\n}\n\n\n\/\/ Test intersect\nTEST_F(MdisNacSensorModelTest, intersectTrivial) {\n std::vector<double> position { 0.0, 0.0, 1.5 };\n std::vector<double> look { 0.0, 0.0, -0.5 };\n csm::EcefCoord intersectGround = testMath.intersect(position, look, 1.0);\n EXPECT_EQ(0.0, intersectGround.x);\n EXPECT_EQ(0.0, intersectGround.y);\n EXPECT_EQ(1.0, intersectGround.z);\n}\n\nTEST_F(MdisNacSensorModelTest, intersectLookingAway) {\n std::vector<double> position { 0.0, 0.0, 2.0 };\n std::vector<double> look { 0.0, 0.0, 0.5 };\n csm::EcefCoord ground = testMath.intersect(position, look, 1.0);\n EXPECT_EQ(0.0, ground.x);\n EXPECT_EQ(0.0, ground.y);\n EXPECT_EQ(0.0, ground.z);\n}\n\n\n\/\/ Test perpendicular\nTEST_F(MdisNacSensorModelTest, perpendicularNonZeros) {\n std::vector<double> v1(3), v2(3);\n v1[0] = 0.0;\n v1[1] = 0.0;\n v1[2] = 1.5;\n v2[0] = 0.0;\n v2[1] = -0.25;\n v2[2] = -0.5;\n std::vector<double> result = testMath.perpendicular(v1, v2);\n EXPECT_NEAR(0.0, result[0], tolerance);\n EXPECT_NEAR(-0.6, result[1], tolerance);\n EXPECT_NEAR(0.3, result[2], tolerance);\n}\n\n\n\/\/ Test project\nTEST_F(MdisNacSensorModelTest, projectNonZeros) {\n std::vector<double> v1(3), v2(3);\n v1[0] = 0.0;\n v1[1] = 0.0;\n v1[2] = 1.5;\n v2[0] = 0.0;\n v2[1] = -0.25;\n v2[2] = -0.5;\n std::vector<double> result = testMath.project(v1, v2);\n EXPECT_NEAR(0.0, result[0], tolerance);\n EXPECT_NEAR(0.6, result[1], tolerance);\n EXPECT_NEAR(1.2, result[2], tolerance);\n}\n\n\n\/\/ Test dot\n\/\/ TODO: use value-parameterized tests\nTEST_F(MdisNacSensorModelTest, dotZeroVectors) {\n std::vector<double> v1(3, 0.0), v2(3, 0.0);\n EXPECT_EQ(0.0, testMath.dot(v1, v2));\n}\n\nTEST_F(MdisNacSensorModelTest, dotOneZeroVector) {\n std::vector<double> v1(3, 0.0), v2(3);\n v2[0] = 1.0;\n v2[1] = 2.0;\n v2[2] = 3.0;\n EXPECT_EQ(0.0, testMath.dot(v1, v2));\n}\n\nTEST_F(MdisNacSensorModelTest, dotVectors) {\n std::vector<double> v1(3), v2(3);\n v1[0] = 1.0;\n v1[1] = 2.0;\n v1[2] = 3.0;\n v2[0] = -2.0;\n v2[1] = 2.0;\n v2[2] = 3.0;\n EXPECT_EQ(11.0, testMath.dot(v1, v2));\n}\n\n\n\/\/ Test magnitude\nTEST_F(MdisNacSensorModelTest, magnitudeZero) {\n std::vector<double> v(3, 0.0);\n EXPECT_EQ(0.0, testMath.magnitude(v));\n}\n\nTEST_F(MdisNacSensorModelTest, magnitudePositive) {\n std::vector<double>v(3);\n v[0] = 3.0;\n v[1] = 4.0;\n v[2] = 5.0;\n EXPECT_EQ(sqrt(50.0), testMath.magnitude(v));\n}\n\nTEST_F(MdisNacSensorModelTest, magnitudeNegative) {\n std::vector<double>v(3);\n v[0] = -3.0;\n v[1] = -4.0;\n v[2] = -5.0;\n EXPECT_EQ(sqrt(50.0), testMath.magnitude(v));\n}\n\n\n\/\/ Test normalize\nTEST_F(MdisNacSensorModelTest, normalizeVector) {\n std::vector<double>v(3);\n v[0] = 2.0;\n v[1] = 3.0;\n v[2] = 4.0;\n std::vector<double> result = testMath.normalize(v);\n EXPECT_EQ((v[0] \/ sqrt(29.0)), result[0]);\n EXPECT_EQ((v[1] \/ sqrt(29.0)), result[1]);\n EXPECT_EQ((v[2] \/ sqrt(29.0)), result[2]);\n}\n<|endoftext|>"} {"text":"<commit_before><commit_msg>INTEGRATION: CWS geordi2q14 (1.27.164); FILE MERGED 2004\/01\/30 11:16:42 hr 1.27.164.1: #111934#: merge CWS ooo111fix2<commit_after><|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#include \"arch\/x86\/insts\/microregop.hh\"\n#include \"arch\/x86\/miscregs.hh\"\n#include \"base\/condcodes.hh\"\n#include <string>\n\nnamespace X86ISA\n{\n uint64_t RegOpBase::genFlags(uint64_t oldFlags, uint64_t flagMask,\n uint64_t _dest, uint64_t _src1, uint64_t _src2,\n bool subtract) const\n {\n DPRINTF(Sparc, \"flagMask = %#x\\n\", flagMask);\n uint64_t flags = oldFlags & ~flagMask;\n if(flagMask & (ECFBit | CFBit))\n {\n if(findCarry(dataSize*8, _dest, _src1, _src2))\n flags |= (flagMask & (ECFBit | CFBit));\n if(subtract)\n flags ^= (flagMask & (ECFBit | CFBit));\n }\n if(flagMask & PFBit && findParity(dataSize*8, _dest))\n flags |= PFBit;\n if(flagMask & AFBit)\n {\n if(findCarry(4, _dest, _src1, _src2))\n flags |= AFBit;\n if(subtract)\n flags ^= AFBit;\n }\n if(flagMask & (EZFBit | ZFBit) && findZero(dataSize*8, _dest))\n flags |= (flagMask & (EZFBit | ZFBit));\n if(flagMask & SFBit && findNegative(dataSize*8, _dest))\n flags |= SFBit;\n if(flagMask & OFBit && findOverflow(dataSize*8, _dest, _src1, _src2))\n flags |= OFBit;\n return flags;\n }\n\n std::string RegOp::generateDisassembly(Addr pc,\n const SymbolTable *symtab) const\n {\n std::stringstream response;\n\n printMnemonic(response, instMnem, mnemonic);\n printDestReg(response, 0, dataSize);\n response << \", \";\n printSrcReg(response, 0, dataSize);\n response << \", \";\n printSrcReg(response, 1, dataSize);\n return response.str();\n }\n\n std::string RegOpImm::generateDisassembly(Addr pc,\n const SymbolTable *symtab) const\n {\n std::stringstream response;\n\n printMnemonic(response, instMnem, mnemonic);\n printDestReg(response, 0, dataSize);\n response << \", \";\n printSrcReg(response, 0, dataSize);\n ccprintf(response, \", %#x\", imm8);\n return response.str();\n }\n}\n<commit_msg>X86: Get rid of stray Sparc DPRINTF<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#include \"arch\/x86\/insts\/microregop.hh\"\n#include \"arch\/x86\/miscregs.hh\"\n#include \"base\/condcodes.hh\"\n#include <string>\n\nnamespace X86ISA\n{\n uint64_t RegOpBase::genFlags(uint64_t oldFlags, uint64_t flagMask,\n uint64_t _dest, uint64_t _src1, uint64_t _src2,\n bool subtract) const\n {\n DPRINTF(X86, \"flagMask = %#x\\n\", flagMask);\n uint64_t flags = oldFlags & ~flagMask;\n if(flagMask & (ECFBit | CFBit))\n {\n if(findCarry(dataSize*8, _dest, _src1, _src2))\n flags |= (flagMask & (ECFBit | CFBit));\n if(subtract)\n flags ^= (flagMask & (ECFBit | CFBit));\n }\n if(flagMask & PFBit && findParity(dataSize*8, _dest))\n flags |= PFBit;\n if(flagMask & AFBit)\n {\n if(findCarry(4, _dest, _src1, _src2))\n flags |= AFBit;\n if(subtract)\n flags ^= AFBit;\n }\n if(flagMask & (EZFBit | ZFBit) && findZero(dataSize*8, _dest))\n flags |= (flagMask & (EZFBit | ZFBit));\n if(flagMask & SFBit && findNegative(dataSize*8, _dest))\n flags |= SFBit;\n if(flagMask & OFBit && findOverflow(dataSize*8, _dest, _src1, _src2))\n flags |= OFBit;\n return flags;\n }\n\n std::string RegOp::generateDisassembly(Addr pc,\n const SymbolTable *symtab) const\n {\n std::stringstream response;\n\n printMnemonic(response, instMnem, mnemonic);\n printDestReg(response, 0, dataSize);\n response << \", \";\n printSrcReg(response, 0, dataSize);\n response << \", \";\n printSrcReg(response, 1, dataSize);\n return response.str();\n }\n\n std::string RegOpImm::generateDisassembly(Addr pc,\n const SymbolTable *symtab) const\n {\n std::stringstream response;\n\n printMnemonic(response, instMnem, mnemonic);\n printDestReg(response, 0, dataSize);\n response << \", \";\n printSrcReg(response, 0, dataSize);\n ccprintf(response, \", %#x\", imm8);\n return response.str();\n }\n}\n<|endoftext|>"} {"text":"<commit_before>#include <iostream>\n#include <unistd.h>\n#include <sys\/stat.h>\n#include <stdio.h>\n#include <vector>\n#include <sstream>\n#include <dirent.h>\n#include <errno.h>\n#include <sys\/types.h>\nusing namespace std;\n\nbool isDirectory(char* directoryName) {\n\t\n\tstruct stat directoryInCurrent;\n\n\tif (-1 == (stat(directoryName, &directoryInCurrent))) {\n\n\t\tperror(\"stat failed\");\n\t\treturn false;\n\t}\n\n\tif (directoryInCurrent.st_mode & S_IFDIR) {\n\t\treturn true;\n\t}\n\telse {\n\t\treturn false;\n\t}\n}\n\nint ls(char* directoryName) {\n\n\t\n\t\tchar const *dirName = \".\";\n\t\tDIR *dirp;\n\t\tif (!(dirp = opendir(dirName))) {\n\t\t\tcerr << \"Error(\" << errno << \") opening \" << dirName << endl;\n\t\t}\n\n\t\tdirent *direntp;\n\t\twhile ((direntp = readdir(dirp))) {\n\t\t\tif (direntp->d_name[0] != '.') {\n\t\t\t\t\t\n\t\t\t\t\/\/cout << direntp->d_name << endl; \/\/ use stat here to find attributes of a file\n\t\t\t\tprintf(direntp->d_name, 8);\n\t\t\t\tcout << \" \";\n\t\t\t}\n\t\t}\n\t\tcout << endl;\n\t\tclosedir(dirp);\n\t\treturn 0;\n}\n\nint lsWithFlags(char* directoryName, vector<string> flags) {\n\n\tbool isA = false;\n\tbool isL = false;\n\tbool isR = false;\n\tfor (unsigned i = 0; i < flags.size(); ++i) {\n\t\tfor (unsigned k = 0; k < flags.at(i).size(); ++k) {\n\t\t\tif (flags.at(i).at(k) == 'a') \n\t\t\t\tisA = true;\n\t\t\telse if (flags.at(i).at(k) == 'l') \n\t\t\t\tisL = true;\n\t\t\telse if (flags.at(i).at(k) == 'R')\n\t\t\t\tisR = true;\n\t\t}\n\n\t}\n\tchar const *dirName = directoryName;\n\tDIR *dirp;\n\tif (!(dirp = opendir(dirName))) {\n\t\tcerr << \"Error(\" << errno << \") opening \" << dirName << endl;\n\t\treturn errno;\n\t}\n\n\tdirent *direntp;\n\tif (isA) {\n\t\twhile ((direntp = readdir(dirp))) {\n\t\n\t\t\t\t\t\n\t\t\t\/\/cout << direntp->d_name << endl; \/\/ use stat here to find attributes of a file\n\t\t\tprintf(direntp->d_name, 8);\n\t\t\tcout << \" \";\n\n\t\t}\n\t}\n\tcout << endl;\n\tclosedir(dirp);\n\treturn 0;\n}\n\nint main(int argc, char* argv[]) {\n\t\n\tif (argc == 1) {\n\t\t\n\t\tif (errno == ls(\".\")) {\n\t\t\n\t\t\treturn errno;\n\t\t}\n\t}\t\n\t\n\telse {\n\t\t\n\t\tvector<string> directories;\n\t\tvector<string> flags;\n\t\tvector<int> directoryIndex;\n\t\tbool directoryInArgv = false;\n\t\tfor (int i = 1; i < argc; ++i) {\n\t\t\t\n\t\t\tif (isDirectory(argv[i])) {\n\t\t\t\tdirectoryInArgv = true;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\telse {\n\t\t\t\n\t\t\t\tif (argv[i][0] == '-') {\n\t\t\t\t\n\t\t\t\t\tflags.push_back(argv[i]);\n\t\t\t\t}\t\n\t\t\t}\n\t\t}\n\t\tif (!directoryInArgv) {\n\t\t\t\t\t\n\t\t\tif (errno == lsWithFlags(\".\", flags)) {\n\t\t\t\n\t\t\t\treturn errno;\n\t\t\t}\n\t\t}\n\t\telse {\n\n\t\t\tcout << 131 << endl;\n\t\t\tfor (int i = 0; i < argc; ++i) {\n\t\t\t\n\t\t\t\tif (isDirectory(argv[i])) {\n\t\t\t\t\tdirectories.push_back(argv[i]);\n\t\t\t\t\tdirectoryIndex.push_back(i);\n\t\t\t\t}\n\t\t\t}\t\n\n\t\t\tcout << \"directories size: \" << directories.size() << endl;\n\t\t\tfor (unsigned int i = 0; i < directories.size(); ++i) {\n\t\t\t\tflags.clear();\n\t\t\t\tfor (unsigned int k = static_cast<unsigned>(directoryIndex.at(i)); \n\t\t\t\t\t (i + 1) < directoryIndex.size() && \n\t\t\t\t\t k != (unsigned)directoryIndex.at(i + 1);\n\t\t\t\t\t ++k) {\n\t\t\t\t\tif (argv[k][0] == '-') {\n\t\t\t\t\t\n\t\t\t\t\t\tflags.push_back(argv[k]);\n\t\t\t\t\t}\n\t\t\t\t}\n\n\t\t\t\tcout << \"flags: \";\n\t\t\t\tfor (unsigned j = 0; j < flags.size(); ++j) {\n\t\t\t\t\n\t\t\t\t\tcout << flags.at(j) << \" \";\n\t\t\t\t}\n\t\t\t\tcout << endl;\n\t\t\t\t\n\t\t\t\tchar* directoryName = new char[directories.at(i).size() + 1];\n\t\t\t\tstrcpy(directoryName, directories.at(i).c_str());\n\t\t\t\t\n\t\t\t\tif (errno == lsWithFlags(directoryName, flags)) {\n\t\t\t\t\n\t\t\t\t\treturn errno;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\t\n\n}\n\n<commit_msg>changed conditions for boolean variables in lswithflags function<commit_after>#include <iostream>\n#include <unistd.h>\n#include <sys\/stat.h>\n#include <stdio.h>\n#include <vector>\n#include <sstream>\n#include <dirent.h>\n#include <errno.h>\n#include <sys\/types.h>\nusing namespace std;\n\nbool isDirectory(char* directoryName) {\n\t\n\tstruct stat directoryInCurrent;\n\n\tif (-1 == (stat(directoryName, &directoryInCurrent))) {\n\n\t\tperror(\"stat failed\");\n\t\treturn false;\n\t}\n\n\tif (directoryInCurrent.st_mode & S_IFDIR) {\n\t\treturn true;\n\t}\n\telse {\n\t\treturn false;\n\t}\n}\n\nint ls(char* directoryName) {\n\n\t\n\t\tchar const *dirName = \".\";\n\t\tDIR *dirp;\n\t\tif (!(dirp = opendir(dirName))) {\n\t\t\tcerr << \"Error(\" << errno << \") opening \" << dirName << endl;\n\t\t}\n\n\t\tdirent *direntp;\n\t\twhile ((direntp = readdir(dirp))) {\n\t\t\tif (direntp->d_name[0] != '.') {\n\t\t\t\t\t\n\t\t\t\t\/\/cout << direntp->d_name << endl; \/\/ use stat here to find attributes of a file\n\t\t\t\tprintf(direntp->d_name, 8);\n\t\t\t\tcout << \" \";\n\t\t\t}\n\t\t}\n\t\tcout << endl;\n\t\tclosedir(dirp);\n\t\treturn 0;\n}\n\nint lsWithFlags(char* directoryName, vector<string> flags) {\n\n\tbool isA = false;\n\tbool isL = false;\n\tbool isR = false;\n\tfor (unsigned i = 0; i < flags.size(); ++i) {\n\t\tfor (unsigned k = 0; k < flags.at(i).size(); ++k) {\n\t\t\tif (flags.at(i).at(k) == 'a') \n\t\t\t\tisA = true;\n\t\t\telse if (flags.at(i).at(k) == 'l') \n\t\t\t\tisL = true;\n\t\t\telse if (flags.at(i).at(k) == 'R')\n\t\t\t\tisR = true;\n\t\t}\n\n\t}\n\tchar const *dirName = directoryName;\n\tDIR *dirp;\n\tif (!(dirp = opendir(dirName))) {\n\t\tcerr << \"Error(\" << errno << \") opening \" << dirName << endl;\n\t\treturn errno;\n\t}\n\n\tdirent *direntp;\n\tif (isA) {\n\t\twhile ((direntp = readdir(dirp))) {\n\t\n\t\t\t\t\t\n\t\t\t\/\/cout << direntp->d_name << endl; \/\/ use stat here to find attributes of a file\n\t\t\tprintf(direntp->d_name, 8);\n\t\t\tcout << \" \";\n\n\t\t}\n\t}\n\tcout << endl;\n\tclosedir(dirp);\n\treturn 0;\n}\n\nint main(int argc, char* argv[]) {\n\t\n\tif (argc == 1) {\n\t\t\n\t\tif (errno == ls(\".\")) {\n\t\t\n\t\t\treturn errno;\n\t\t}\n\t}\t\n\t\n\telse {\n\t\t\n\t\tvector<string> directories;\n\t\tvector<string> flags;\n\t\tvector<int> directoryIndex;\n\t\tbool directoryInArgv = false;\n\t\tfor (int i = 1; i < argc; ++i) {\n\t\t\t\n\t\t\tif (isDirectory(argv[i])) {\n\t\t\t\tdirectoryInArgv = true;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\telse {\n\t\t\t\n\t\t\t\tif (argv[i][0] == '-') {\n\t\t\t\t\n\t\t\t\t\tflags.push_back(argv[i]);\n\t\t\t\t}\t\n\t\t\t}\n\t\t}\n\t\tif (!directoryInArgv) {\n\t\t\t\t\t\n\t\t\tif (errno == lsWithFlags(\".\", flags)) {\n\t\t\t\n\t\t\t\treturn errno;\n\t\t\t}\n\t\t}\n\t\telse {\n\n\t\t\tcout << 131 << endl;\n\t\t\tfor (int i = 1; i < argc; ++i) {\n\t\t\t\n\t\t\t\tif (isDirectory(argv[i])) {\n\t\t\t\t\tdirectories.push_back(argv[i]);\n\t\t\t\t\tdirectoryIndex.push_back(i);\n\t\t\t\t}\n\t\t\t}\t\n\n\t\t\tcout << \"directories size: \" << directories.size() << endl;\n\t\t\tfor (unsigned int i = 0; i < directories.size(); ++i) {\n\t\t\t\tflags.clear();\n\t\t\t\tfor (unsigned int k = static_cast<unsigned>(directoryIndex.at(i)); \n\t\t\t\t\t (i + 1) < directoryIndex.size() && \n\t\t\t\t\t k != (unsigned)directoryIndex.at(i + 1);\n\t\t\t\t\t ++k) {\n\t\t\t\t\tif (argv[k][0] == '-') {\n\t\t\t\t\t\n\t\t\t\t\t\tflags.push_back(argv[k]);\n\t\t\t\t\t}\n\t\t\t\t}\n\n\t\t\t\tcout << \"flags: \";\n\t\t\t\tfor (unsigned j = 0; j < flags.size(); ++j) {\n\t\t\t\t\n\t\t\t\t\tcout << flags.at(j) << \" \";\n\t\t\t\t}\n\t\t\t\tcout << endl;\n\t\t\t\t\n\t\t\t\tchar* directoryName = new char[directories.at(i).size() + 1];\n\t\t\t\tstrcpy(directoryName, directories.at(i).c_str());\n\t\t\t\t\n\t\t\t\tif (errno == lsWithFlags(directoryName, flags)) {\n\t\t\t\t\n\t\t\t\t\treturn errno;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\t\n\n}\n\n<|endoftext|>"} {"text":"<commit_before>\/\/\r\n\/\/#include <unistd.h>\r\n#include <cstdio>\r\n#include <cstdlib>\r\n#include <string>\r\n#include <ctime>\r\n#include <algorithm>\r\n#include <cmath>\r\n#include \"GPIOClass.h\"\r\n\r\nusing namespace std;\r\n\r\nvoid Pulse(GPIOClass* pin, double cycles);\r\nvoid Wait(double seconds);\r\nclock_t timer;\r\ndouble time_to_complete;\r\ndouble resolution = 100;\r\n\r\n#define PI 4*atan(1)\r\n\r\nint main (int argc, char *argv[]) {\r\n\tstring type = argv[1];\r\n\ttransform(type.begin(), type.end(), type.begin(), :: tolower);\r\n\t\/\/ lets assume that the way to run this is\r\n\t\/\/ pwm.exe [rising\/falling\/sine\/constant]\r\n\tif (argc != 2) {\r\n\t\tcout << \"Usage: pwm [rising\/falling\/sine\/constant\/blink]\" << endl;\r\n\t\treturn -1;\r\n\t}\r\n\r\n\twhile (time_to_complete <= 0) {\r\n\t\tcout << \"Input How Long To Run (in seconds)\" << endl;\r\n\t\tcin >> time_to_complete;\r\n\t}\r\n\r\n\tGPIOClass* out1 = new GPIOClass(\"4\");\r\n\tGPIOClass* in2 = new GPIOClass(\"17\");\r\n\r\n\tout1->export_gpio();\r\n\tin2->export_gpio();\r\n\r\n\tout1->setdir_gpio(\"out\");\r\n\tin2->setdir_gpio(\"in\");\r\n\r\n\tcout << \"Pins are setup.\" << endl;\r\n\t\/\/ avoiding flickering will be at 100hz\r\n\t\/\/ aka turn on and off 100 times a sec\r\n\t\/\/ a cycle of 0 is off\r\n\t\/\/ a cycle of 100 is on\r\n\r\n\tif (type == \"rising\") {\r\n\t\tclock_t finish = clock() + time_to_complete * CLOCKS_PER_SEC;\r\n\t\tdouble t = time_to_complete;\r\n\t\twhile (clock() < finish) {\r\n\t\t\t\/\/ pulse for however long we need to to achieve brightness.\r\n\t\t\t\tt -= (1\/t);\r\n\t\t\t\t\/\/cout << sin((PI\/2) * (1\/t)) << endl;\r\n\t\t\t\tPulse(out1, sin((PI\/2) * (1\/t)));\r\n\t\t\t\tWait(sin((PI\/2) * (1\/t)));\r\n\t\t}\r\n\t}\r\n\tif (type == \"falling\") {\r\n\r\n\t}\r\n\tif (type == \"sine\") {\r\n\r\n\t}\r\n\tif (type == \"constant\") {\r\n\t\tout1->setval_gpio(\"1\"); \/\/ turn the pin on\r\n\t\tWait(time_to_complete); \/\/ sleep for number of cycles \/ 1\/100 sec\r\n\t\t\/\/cout << \"Waiting during pulse\" << endl;\r\n\t\tout1->setval_gpio(\"0\"); \/\/ turn the pin off\r\n\t}\r\n\tif (type == \"blink\") { \/\/ aka. TESTR\r\n\t\tclock_t finish = clock() + time_to_complete * CLOCKS_PER_SEC;\r\n\t\twhile (clock() < finish) {\r\n\t\t\t\/\/ pulse for however long we need to to achieve brightness.\r\n\t\t\tPulse(out1, 1 * resolution);\r\n\t\t\tWait(0.5);\r\n\t\t}\r\n\t}\r\n\tcout << \"Done.\" << endl;\r\n}\r\n\r\n\/\/1 cycle is 1\/100th of a second\r\n\/\/100 cycles is 1 sec\r\nvoid Pulse(GPIOClass* pin, double cycles) {\r\n\tbool running = true;\r\n\twhile (running) {\r\n\t\tpin->setval_gpio(\"1\"); \/\/ turn the pin on\r\n\t\tWait(cycles \/ resolution); \/\/ sleep for number of cycles \/ 1\/100 sec\r\n\t\t\/\/cout << \"Waiting during pulse\" << endl;\r\n\t\tpin->setval_gpio(\"0\"); \/\/ turn the pin off\r\n\t\trunning = false; \/\/ this is unnessesary but could be useful if modified a bit.\r\n\t}\r\n}\r\n\r\nvoid Wait ( double seconds )\r\n{\r\n\tclock_t endwait;\r\n\tendwait = clock () + seconds * CLOCKS_PER_SEC ;\r\n\twhile (clock() < endwait) {}\r\n}\r\n<commit_msg>Update pwm.cpp<commit_after>\/\/\r\n\/\/#include <unistd.h>\r\n#include <cstdio>\r\n#include <cstdlib>\r\n#include <string>\r\n#include <ctime>\r\n#include <algorithm>\r\n#include <cmath>\r\n#include \"GPIOClass.h\"\r\n\r\nusing namespace std;\r\n\r\nvoid Pulse(GPIOClass* pin, double cycles);\r\nvoid Wait(double seconds);\r\nclock_t timer;\r\ndouble time_to_complete;\r\ndouble resolution = 100;\r\n\r\n#define PI 4*atan(1)\r\n\r\nint main (int argc, char *argv[]) {\r\n\tstring type = argv[1];\r\n\ttransform(type.begin(), type.end(), type.begin(), :: tolower);\r\n\t\/\/ lets assume that the way to run this is\r\n\t\/\/ pwm.exe [rising\/falling\/sine\/constant]\r\n\tif (argc != 2) {\r\n\t\tcout << \"Usage: pwm [rising\/falling\/sine\/constant\/blink]\" << endl;\r\n\t\treturn -1;\r\n\t}\r\n\r\n\twhile (time_to_complete <= 0) {\r\n\t\tcout << \"Input How Long To Run (in seconds)\" << endl;\r\n\t\tcin >> time_to_complete;\r\n\t}\r\n\r\n\tGPIOClass* out1 = new GPIOClass(\"4\");\r\n\tGPIOClass* in2 = new GPIOClass(\"17\");\r\n\r\n\tout1->export_gpio();\r\n\tin2->export_gpio();\r\n\r\n\tout1->setdir_gpio(\"out\");\r\n\tin2->setdir_gpio(\"in\");\r\n\r\n\tcout << \"Pins are setup.\" << endl;\r\n\t\/\/ avoiding flickering will be at 100hz\r\n\t\/\/ aka turn on and off 100 times a sec\r\n\t\/\/ a cycle of 0 is off\r\n\t\/\/ a cycle of 100 is on\r\n\r\n\tif (type == \"rising\") {\r\n\t\tclock_t finish = clock() + time_to_complete * CLOCKS_PER_SEC;\r\n\t\tdouble t = time_to_complete;\r\n\t\twhile (clock() < finish) {\r\n\t\t\t\/\/ pulse for however long we need to to achieve brightness.\r\n\t\t\t\tt -= 1;\r\n\t\t\t\tcout << t << endl;\r\n\t\t\t\tPulse(out1, sin((PI\/2) * (1\/t)));\r\n\t\t\t\tWait(sin((PI\/2) * (1\/t)));\r\n\t\t}\r\n\t}\r\n\tif (type == \"falling\") {\r\n\r\n\t}\r\n\tif (type == \"sine\") {\r\n\r\n\t}\r\n\tif (type == \"constant\") {\r\n\t\tout1->setval_gpio(\"1\"); \/\/ turn the pin on\r\n\t\tWait(time_to_complete); \/\/ sleep for number of cycles \/ 1\/100 sec\r\n\t\t\/\/cout << \"Waiting during pulse\" << endl;\r\n\t\tout1->setval_gpio(\"0\"); \/\/ turn the pin off\r\n\t}\r\n\tif (type == \"blink\") { \/\/ aka. TESTR\r\n\t\tclock_t finish = clock() + time_to_complete * CLOCKS_PER_SEC;\r\n\t\twhile (clock() < finish) {\r\n\t\t\t\/\/ pulse for however long we need to to achieve brightness.\r\n\t\t\tPulse(out1, 1 * resolution);\r\n\t\t\tWait(0.5);\r\n\t\t}\r\n\t}\r\n\tcout << \"Done.\" << endl;\r\n}\r\n\r\n\/\/1 cycle is 1\/100th of a second\r\n\/\/100 cycles is 1 sec\r\nvoid Pulse(GPIOClass* pin, double cycles) {\r\n\tbool running = true;\r\n\twhile (running) {\r\n\t\tpin->setval_gpio(\"1\"); \/\/ turn the pin on\r\n\t\tWait(cycles \/ resolution); \/\/ sleep for number of cycles \/ 1\/100 sec\r\n\t\t\/\/cout << \"Waiting during pulse\" << endl;\r\n\t\tpin->setval_gpio(\"0\"); \/\/ turn the pin off\r\n\t\trunning = false; \/\/ this is unnessesary but could be useful if modified a bit.\r\n\t}\r\n}\r\n\r\nvoid Wait ( double seconds )\r\n{\r\n\tclock_t endwait;\r\n\tendwait = clock () + seconds * CLOCKS_PER_SEC ;\r\n\twhile (clock() < endwait) {}\r\n}\r\n<|endoftext|>"} {"text":"<commit_before>\/*******************************************************************************\n *\n * MIT License\n *\n * Copyright (c) 2017 Advanced Micro Devices, Inc.\n *\n * Permission is hereby granted, free of charge, to any person obtaining a copy\n * of this software and associated documentation files (the \"Software\"), to deal\n * in the Software without restriction, including without limitation the rights\n * to use, copy, modify, merge, publish, distribute, sublicense, and\/or sell\n * copies of the Software, and to permit persons to whom the Software is\n * furnished to do so, subject to the following conditions:\n *\n * The above copyright notice and this permission notice shall be included in all\n * copies or substantial portions of the Software.\n *\n * THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\n * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\n * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE\n * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\n * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,\n * OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE\n * SOFTWARE.\n *\n *******************************************************************************\/\n#include \"driver.hpp\"\n#include \"test.hpp\"\n#include \"verify.hpp\"\n#include \"get_handle.hpp\"\n#include \"tensor_holder.hpp\"\n#include <miopen\/miopen.h>\n#include <miopen\/tensor.hpp>\n#include <miopen\/stringutils.hpp>\n#include <miopen\/lrn.hpp>\n#include <random>\n#include <algorithm>\n#include <iterator>\n#include <limits>\n#include <iostream>\n\ntemplate <class T>\nstruct verify_lrn_foward\n{\n miopen::LRNDescriptor lrn;\n tensor<T> input;\n\n tensor<T> cpu()\n {\n auto output = input;\n int n_batch, channels, height, width;\n std::tie(n_batch, channels, height, width) = miopen::tien<4>(input.desc.GetLengths());\n\n auto alpha = lrn.GetAlpha();\n auto beta = lrn.GetBeta();\n auto K = lrn.GetK();\n auto lrn_n = lrn.GetN();\n auto radius = (lrn.GetN() - 1) \/ 2;\n auto mode = lrn.GetMode();\n\n CHECK((lrn_n & 1) == 1);\n if(mode == miopenLRNCrossChannel)\n {\n auto alphaoverarea = alpha \/ lrn_n;\n\n par_ford(n_batch, height, width)([&](int b, int h, int w) {\n double scale = 0;\n ford(channels)([&](int c) {\n auto start = (c - radius) < 0 ? 0 : (c - radius);\n auto end = (c + radius) > channels ? channels : (c + radius);\n\n for(auto k = start; k < end; k++)\n {\n scale += std::pow(input(b, k, h, w), 2);\n }\n\n scale *= alphaoverarea;\n scale += K;\n scale = std::pow(scale, -beta);\n\n output(b, c, h, w) = input(b, c, h, w) * scale;\n });\n });\n }\n else\n {\n\n par_ford(n_batch, channels)([&](int b, int c) {\n double scale = 0;\n ford(height, width)([&](int h, int w) {\n auto left = (w - radius) < 0 ? 0 : (w - radius);\n auto right = (w + radius) > width ? width : (w + radius);\n auto top = (h - radius) < 0 ? 0 : (h - radius);\n auto bottom = (h + radius) > height ? height : (h + radius);\n auto alphaoverarea = alpha \/ ((right - left) * (bottom - top));\n\n for(auto i = left; i < right; i++)\n {\n for(auto j = top; j < bottom; j++)\n {\n scale += std::pow(input(b, c, h, w), 2);\n }\n }\n scale *= alphaoverarea;\n scale += K;\n scale = std::pow(scale, -beta);\n output(b, c, h, w) = input(b, c, h, w) * scale;\n });\n });\n }\n\n return output;\n }\n\n tensor<T> gpu()\n {\n auto&& handle = get_handle();\n auto out = input;\n auto in_dev = handle.Write(input.data);\n auto out_dev = handle.Write(out.data);\n auto alpha = lrn.GetAlpha();\n auto beta = lrn.GetBeta();\n auto bDoBwd = false;\n\n lrn.Forward(handle,\n &alpha,\n input.desc,\n in_dev.get(),\n &beta,\n out.desc,\n out_dev.get(),\n bDoBwd,\n nullptr);\n\n out.data = handle.Read<T>(out_dev, out.data.size());\n return out;\n }\n\n void fail(int)\n {\n std::cout << \"verify_lrn_foward\" << std::endl;\n std::cout << \"Input Tensor\"\n << \" \" << input.desc.ToString() << std::endl;\n }\n};\n\ntemplate <class T>\nstruct verify_lrn_bwd\n{\n\n miopen::LRNDescriptor lrn;\n tensor<T> inputY;\n tensor<T> inputDY;\n tensor<T> inputX;\n tensor<T> outputDX;\n tensor<T> scale;\n\n tensor<T> cpu()\n {\n int n_batch, channels, height, width;\n std::tie(n_batch, channels, height, width) = miopen::tien<4>(inputY.desc.GetLengths());\n\n auto alpha = lrn.GetAlpha();\n auto beta = lrn.GetBeta();\n auto lrn_n = lrn.GetN();\n auto mode = lrn.GetMode();\n auto radius = (lrn_n - 1) \/ 2;\n\n if(mode == miopenLRNWithinChannel)\n {\n par_ford(n_batch, channels)([&](int b, int c) {\n ford(height, width)([&](int h, int w) {\n double ydy = 0;\n auto left = (w - radius) < 0 ? 0 : (w - radius);\n auto right = (left + lrn_n) > width ? width : (left + lrn_n);\n auto top = (h - radius) < 0 ? 0 : (h - radius);\n auto bottom = (top + lrn_n) > height ? height : (top + lrn_n);\n auto adjust_area = (right - left) * (bottom - top);\n auto cache_ratio_value = 2 * alpha * beta \/ adjust_area;\n\n for(auto i = left; i < right; i++)\n {\n for(auto j = top; j < bottom; j++)\n {\n ydy += (inputY(b, c, j, i) * inputDY(b, c, j, i) \/ scale(b, c, j, i));\n }\n }\n\n outputDX(b, c, h, w) = pow(scale(b, c, h, w), -beta) * inputDY(b, c, h, w) -\n cache_ratio_value * inputX(b, c, h, w) * ydy;\n });\n });\n }\n else\n {\n auto cache_ratio_value = 2 * alpha * beta \/ lrn_n;\n\n par_ford(n_batch, height, width)([&](int b, int h, int w) {\n ford(channels)([&](int c) {\n double ydy = 0;\n auto start = (c - radius) < 0 ? 0 : (c - radius);\n auto end = (c + radius) > channels ? channels : (c + radius);\n\n for(auto k = start; k < end; k++)\n {\n ydy += (inputY(b, k, h, w) * inputDY(b, k, h, w) \/ scale(b, k, h, w));\n }\n\n outputDX(b, c, h, w) = pow(scale(b, c, h, w), -beta) * inputDY(b, c, h, w) -\n cache_ratio_value * inputX(b, c, h, w) * ydy;\n });\n });\n }\n\n return outputDX;\n }\n\n tensor<T> gpu()\n {\n auto&& handle = get_handle();\n auto inputY_dev = handle.Write(inputY.data);\n auto inputDY_dev = handle.Write(inputDY.data);\n auto inputX_dev = handle.Write(inputX.data);\n auto outputDX_dev = handle.Create<T>(outputDX.data.size());\n auto scale_dev = handle.Write(scale.data);\n\n auto alpha = lrn.GetAlpha(), beta = lrn.GetBeta();\n lrn.Backward(handle,\n &alpha,\n inputY.desc, \/\/ Y\n inputY_dev.get(),\n inputDY.desc, \/\/ DY\n inputDY_dev.get(),\n inputX.desc, \/\/ X\n inputX_dev.get(),\n &beta,\n outputDX.desc, \/\/ DX\n outputDX_dev.get(),\n scale_dev.get());\n\n outputDX.data = handle.Read<T>(outputDX_dev, outputDX.data.size());\n return outputDX;\n }\n\n void fail(int)\n {\n std::cout << \"verify_lrn_bwd\" << std::endl;\n std::cout << \"Input Tensor Y\"\n << \" \" << inputY.desc.ToString() << std::endl;\n std::cout << \"Input Tensor DY\"\n << \" \" << inputDY.desc.ToString() << std::endl;\n std::cout << \"Input Tensor X\"\n << \" \" << scale.desc.ToString() << std::endl;\n }\n};\n\ntemplate <class T>\nstruct lrn_driver : test_driver\n{\n tensor<T> input;\n\n unsigned int n = 0;\n T alpha = 0;\n T beta = 0;\n T k = 0;\n std::string mode;\n\n std::unordered_map<std::string, miopenLRNMode_t> mode_lookup = {\n {\"WITHIN_CHANNEL\", miopenLRNWithinChannel}, {\"ACROSS_CHANNEL\", miopenLRNCrossChannel}};\n\n lrn_driver()\n {\n add(input, \"input\", get_input_tensor());\n add(n, \"N\", generate_data({1, 3, 5}));\n add(alpha, \"alpha\", generate_data({1.0}));\n add(beta, \"beta\", generate_data({0}));\n add(k, \"K\", generate_data({1}));\n add(mode, \"mode\", generate_data({\"Within_Channel\", \"Across_Channel\"}));\n }\n\n void run()\n {\n miopen::LRNDescriptor lrn{mode_lookup.at(miopen::ToUpper(mode)), n, {alpha, beta, k}};\n\n auto OutputDX = input;\n auto fwd_output = verify(verify_lrn_foward<T>{lrn, input});\n auto out = fwd_output.first;\n\n std::size_t n_batch, channels, height, width;\n std::tie(n_batch, channels, height, width) = miopen::tien<4>(input.desc.GetLengths());\n auto scale = tensor<T>{n_batch, channels, height, width}.generate(rand_gen{});\n auto inputX = tensor<T>{n_batch, channels, height, width}.generate(rand_gen{});\n par_ford(n_batch, channels, height, width)([&](int b, int c, int h, int w) { scale(b, c, h, w) += 1; });\n\n auto bwd_output = verify(verify_lrn_bwd<T>{lrn, input, out, inputX, OutputDX, scale});\n };\n};\n\nint main(int argc, const char *argv[]) { test_drive<lrn_driver<float>>(argc, argv); };\n<commit_msg>clang-format fix<commit_after>\/*******************************************************************************\n *\n * MIT License\n *\n * Copyright (c) 2017 Advanced Micro Devices, Inc.\n *\n * Permission is hereby granted, free of charge, to any person obtaining a copy\n * of this software and associated documentation files (the \"Software\"), to deal\n * in the Software without restriction, including without limitation the rights\n * to use, copy, modify, merge, publish, distribute, sublicense, and\/or sell\n * copies of the Software, and to permit persons to whom the Software is\n * furnished to do so, subject to the following conditions:\n *\n * The above copyright notice and this permission notice shall be included in all\n * copies or substantial portions of the Software.\n *\n * THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\n * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\n * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE\n * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\n * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,\n * OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE\n * SOFTWARE.\n *\n *******************************************************************************\/\n#include \"driver.hpp\"\n#include \"test.hpp\"\n#include \"verify.hpp\"\n#include \"get_handle.hpp\"\n#include \"tensor_holder.hpp\"\n#include <miopen\/miopen.h>\n#include <miopen\/tensor.hpp>\n#include <miopen\/stringutils.hpp>\n#include <miopen\/lrn.hpp>\n#include <random>\n#include <algorithm>\n#include <iterator>\n#include <limits>\n#include <iostream>\n\ntemplate <class T>\nstruct verify_lrn_foward\n{\n miopen::LRNDescriptor lrn;\n tensor<T> input;\n\n tensor<T> cpu()\n {\n auto output = input;\n int n_batch, channels, height, width;\n std::tie(n_batch, channels, height, width) = miopen::tien<4>(input.desc.GetLengths());\n\n auto alpha = lrn.GetAlpha();\n auto beta = lrn.GetBeta();\n auto K = lrn.GetK();\n auto lrn_n = lrn.GetN();\n auto radius = (lrn.GetN() - 1) \/ 2;\n auto mode = lrn.GetMode();\n\n CHECK((lrn_n & 1) == 1);\n if(mode == miopenLRNCrossChannel)\n {\n auto alphaoverarea = alpha \/ lrn_n;\n\n par_ford(n_batch, height, width)([&](int b, int h, int w) {\n double scale = 0;\n ford(channels)([&](int c) {\n auto start = (c - radius) < 0 ? 0 : (c - radius);\n auto end = (c + radius) > channels ? channels : (c + radius);\n\n for(auto k = start; k < end; k++)\n {\n scale += std::pow(input(b, k, h, w), 2);\n }\n\n scale *= alphaoverarea;\n scale += K;\n scale = std::pow(scale, -beta);\n\n output(b, c, h, w) = input(b, c, h, w) * scale;\n });\n });\n }\n else\n {\n\n par_ford(n_batch, channels)([&](int b, int c) {\n double scale = 0;\n ford(height, width)([&](int h, int w) {\n auto left = (w - radius) < 0 ? 0 : (w - radius);\n auto right = (w + radius) > width ? width : (w + radius);\n auto top = (h - radius) < 0 ? 0 : (h - radius);\n auto bottom = (h + radius) > height ? height : (h + radius);\n auto alphaoverarea = alpha \/ ((right - left) * (bottom - top));\n\n for(auto i = left; i < right; i++)\n {\n for(auto j = top; j < bottom; j++)\n {\n scale += std::pow(input(b, c, h, w), 2);\n }\n }\n scale *= alphaoverarea;\n scale += K;\n scale = std::pow(scale, -beta);\n output(b, c, h, w) = input(b, c, h, w) * scale;\n });\n });\n }\n\n return output;\n }\n\n tensor<T> gpu()\n {\n auto&& handle = get_handle();\n auto out = input;\n auto in_dev = handle.Write(input.data);\n auto out_dev = handle.Write(out.data);\n auto alpha = lrn.GetAlpha();\n auto beta = lrn.GetBeta();\n auto bDoBwd = false;\n\n lrn.Forward(handle,\n &alpha,\n input.desc,\n in_dev.get(),\n &beta,\n out.desc,\n out_dev.get(),\n bDoBwd,\n nullptr);\n\n out.data = handle.Read<T>(out_dev, out.data.size());\n return out;\n }\n\n void fail(int)\n {\n std::cout << \"verify_lrn_foward\" << std::endl;\n std::cout << \"Input Tensor\"\n << \" \" << input.desc.ToString() << std::endl;\n }\n};\n\ntemplate <class T>\nstruct verify_lrn_bwd\n{\n\n miopen::LRNDescriptor lrn;\n tensor<T> inputY;\n tensor<T> inputDY;\n tensor<T> inputX;\n tensor<T> outputDX;\n tensor<T> scale;\n\n tensor<T> cpu()\n {\n int n_batch, channels, height, width;\n std::tie(n_batch, channels, height, width) = miopen::tien<4>(inputY.desc.GetLengths());\n\n auto alpha = lrn.GetAlpha();\n auto beta = lrn.GetBeta();\n auto lrn_n = lrn.GetN();\n auto mode = lrn.GetMode();\n auto radius = (lrn_n - 1) \/ 2;\n\n if(mode == miopenLRNWithinChannel)\n {\n par_ford(n_batch, channels)([&](int b, int c) {\n ford(height, width)([&](int h, int w) {\n double ydy = 0;\n auto left = (w - radius) < 0 ? 0 : (w - radius);\n auto right = (left + lrn_n) > width ? width : (left + lrn_n);\n auto top = (h - radius) < 0 ? 0 : (h - radius);\n auto bottom = (top + lrn_n) > height ? height : (top + lrn_n);\n auto adjust_area = (right - left) * (bottom - top);\n auto cache_ratio_value = 2 * alpha * beta \/ adjust_area;\n\n for(auto i = left; i < right; i++)\n {\n for(auto j = top; j < bottom; j++)\n {\n ydy += (inputY(b, c, j, i) * inputDY(b, c, j, i) \/ scale(b, c, j, i));\n }\n }\n\n outputDX(b, c, h, w) = pow(scale(b, c, h, w), -beta) * inputDY(b, c, h, w) -\n cache_ratio_value * inputX(b, c, h, w) * ydy;\n });\n });\n }\n else\n {\n auto cache_ratio_value = 2 * alpha * beta \/ lrn_n;\n\n par_ford(n_batch, height, width)([&](int b, int h, int w) {\n ford(channels)([&](int c) {\n double ydy = 0;\n auto start = (c - radius) < 0 ? 0 : (c - radius);\n auto end = (c + radius) > channels ? channels : (c + radius);\n\n for(auto k = start; k < end; k++)\n {\n ydy += (inputY(b, k, h, w) * inputDY(b, k, h, w) \/ scale(b, k, h, w));\n }\n\n outputDX(b, c, h, w) = pow(scale(b, c, h, w), -beta) * inputDY(b, c, h, w) -\n cache_ratio_value * inputX(b, c, h, w) * ydy;\n });\n });\n }\n\n return outputDX;\n }\n\n tensor<T> gpu()\n {\n auto&& handle = get_handle();\n auto inputY_dev = handle.Write(inputY.data);\n auto inputDY_dev = handle.Write(inputDY.data);\n auto inputX_dev = handle.Write(inputX.data);\n auto outputDX_dev = handle.Create<T>(outputDX.data.size());\n auto scale_dev = handle.Write(scale.data);\n\n auto alpha = lrn.GetAlpha(), beta = lrn.GetBeta();\n lrn.Backward(handle,\n &alpha,\n inputY.desc, \/\/ Y\n inputY_dev.get(),\n inputDY.desc, \/\/ DY\n inputDY_dev.get(),\n inputX.desc, \/\/ X\n inputX_dev.get(),\n &beta,\n outputDX.desc, \/\/ DX\n outputDX_dev.get(),\n scale_dev.get());\n\n outputDX.data = handle.Read<T>(outputDX_dev, outputDX.data.size());\n return outputDX;\n }\n\n void fail(int)\n {\n std::cout << \"verify_lrn_bwd\" << std::endl;\n std::cout << \"Input Tensor Y\"\n << \" \" << inputY.desc.ToString() << std::endl;\n std::cout << \"Input Tensor DY\"\n << \" \" << inputDY.desc.ToString() << std::endl;\n std::cout << \"Input Tensor X\"\n << \" \" << scale.desc.ToString() << std::endl;\n }\n};\n\ntemplate <class T>\nstruct lrn_driver : test_driver\n{\n tensor<T> input;\n\n unsigned int n = 0;\n T alpha = 0;\n T beta = 0;\n T k = 0;\n std::string mode;\n\n std::unordered_map<std::string, miopenLRNMode_t> mode_lookup = {\n {\"WITHIN_CHANNEL\", miopenLRNWithinChannel}, {\"ACROSS_CHANNEL\", miopenLRNCrossChannel}};\n\n lrn_driver()\n {\n add(input, \"input\", get_input_tensor());\n add(n, \"N\", generate_data({1, 3, 5}));\n add(alpha, \"alpha\", generate_data({1.0}));\n add(beta, \"beta\", generate_data({0}));\n add(k, \"K\", generate_data({1}));\n add(mode, \"mode\", generate_data({\"Within_Channel\", \"Across_Channel\"}));\n }\n\n void run()\n {\n miopen::LRNDescriptor lrn{mode_lookup.at(miopen::ToUpper(mode)), n, {alpha, beta, k}};\n\n auto OutputDX = input;\n auto fwd_output = verify(verify_lrn_foward<T>{lrn, input});\n auto out = fwd_output.first;\n\n std::size_t n_batch, channels, height, width;\n std::tie(n_batch, channels, height, width) = miopen::tien<4>(input.desc.GetLengths());\n auto scale = tensor<T>{n_batch, channels, height, width}.generate(rand_gen{});\n auto inputX = tensor<T>{n_batch, channels, height, width}.generate(rand_gen{});\n par_ford(n_batch, channels, height, width)(\n [&](int b, int c, int h, int w) { scale(b, c, h, w) += 1; });\n\n auto bwd_output = verify(verify_lrn_bwd<T>{lrn, input, out, inputX, OutputDX, scale});\n };\n};\n\nint main(int argc, const char* argv[]) { test_drive<lrn_driver<float>>(argc, argv); };\n<|endoftext|>"} {"text":"<commit_before>namespace factor\n{\n\ntemplate<typename T>\nstruct identity {\n\tT operator()(T t)\n\t{\n\t\treturn t;\n\t}\n};\n\nstruct no_fixup {\n\tstatic const bool translated_code_block_map = false;\n\n\tobject *fixup_data(object *obj)\n\t{\n\t\treturn obj;\n\t}\n\n\tcode_block *fixup_code(code_block *compiled)\n\t{\n\t\treturn compiled;\n\t}\n\n\tobject *translate_data(const object *obj)\n\t{\n\t\treturn fixup_data((object *)obj);\n\t}\n\n\tcode_block *translate_code(const code_block *compiled)\n\t{\n\t\treturn fixup_code((code_block *)compiled);\n\t}\n\n\tcell size(object *obj)\n\t{\n\t\treturn obj->size();\n\t}\n\n\tcell size(code_block *compiled)\n\t{\n\t\treturn compiled->size();\n\t}\n};\n\n}\n<commit_msg>VM: Refactor fixup.hpp to Factor style<commit_after>namespace factor {\n\ntemplate <typename T> struct identity {\n T operator()(T t) { return t; }\n};\n\nstruct no_fixup {\n static const bool translated_code_block_map = false;\n\n object* fixup_data(object* obj) { return obj; }\n\n code_block* fixup_code(code_block* compiled) { return compiled; }\n\n object* translate_data(const object* obj) { return fixup_data((object*)obj); }\n\n code_block* translate_code(const code_block* compiled) {\n return fixup_code((code_block*)compiled);\n }\n\n cell size(object* obj) { return obj->size(); }\n\n cell size(code_block* compiled) { return compiled->size(); }\n};\n\n}\n<|endoftext|>"} {"text":"<commit_before>#include \"master.hpp\"\n\nnamespace factor {\n\nbool factor_arg(const vm_char* str, const vm_char* arg, cell* value) {\n int val;\n if (SSCANF(str, arg, &val) > 0) {\n *value = val;\n return true;\n }\n return false;\n}\n\nvm_parameters::vm_parameters() {\n embedded_image = false;\n image_path = NULL;\n\n datastack_size = 32 * sizeof(cell);\n retainstack_size = 32 * sizeof(cell);\n\n#if defined(FACTOR_PPC)\n callstack_size = 256 * sizeof(cell);\n#else\n callstack_size = 128 * sizeof(cell);\n#endif\n\n code_size = 64;\n young_size = sizeof(cell) \/ 4;\n aging_size = sizeof(cell) \/ 2;\n tenured_size = 24 * sizeof(cell);\n\n max_pic_size = 3;\n\n fep = false;\n signals = true;\n\n#ifdef WINDOWS\n console = GetConsoleWindow() != NULL;\n#else\n console = true;\n#endif\n\n callback_size = 256;\n}\n\nvoid vm_parameters::init_from_args(int argc, vm_char** argv) {\n executable_path = argv[0];\n\n int i = 0;\n\n for (i = 1; i < argc; i++) {\n vm_char* arg = argv[i];\n if (STRCMP(arg, STRING_LITERAL(\"--\")) == 0)\n break;\n else if (factor_arg(arg, STRING_LITERAL(\"-datastack=%d\"),\n &datastack_size))\n ;\n else if (factor_arg(arg, STRING_LITERAL(\"-retainstack=%d\"),\n &retainstack_size))\n ;\n else if (factor_arg(arg, STRING_LITERAL(\"-callstack=%d\"),\n &callstack_size))\n ;\n else if (factor_arg(arg, STRING_LITERAL(\"-young=%d\"), &young_size))\n ;\n else if (factor_arg(arg, STRING_LITERAL(\"-aging=%d\"), &aging_size))\n ;\n else if (factor_arg(arg, STRING_LITERAL(\"-tenured=%d\"), &tenured_size))\n ;\n else if (factor_arg(arg, STRING_LITERAL(\"-codeheap=%d\"), &code_size))\n ;\n else if (factor_arg(arg, STRING_LITERAL(\"-pic=%d\"), &max_pic_size))\n ;\n else if (factor_arg(arg, STRING_LITERAL(\"-callbacks=%d\"), &callback_size))\n ;\n else if (STRNCMP(arg, STRING_LITERAL(\"-i=\"), 3) == 0)\n image_path = arg + 3;\n else if (STRCMP(arg, STRING_LITERAL(\"-fep\")) == 0)\n fep = true;\n else if (STRCMP(arg, STRING_LITERAL(\"-nosignals\")) == 0)\n signals = false;\n else if (STRCMP(arg, STRING_LITERAL(\"-console\")) == 0)\n console = true;\n }\n}\n\nvoid factor_vm::load_data_heap(FILE* file, image_header* h, vm_parameters* p) {\n p->tenured_size = std::max((h->data_size * 3) \/ 2, p->tenured_size);\n\n init_data_heap(p->young_size, p->aging_size, p->tenured_size);\n\n fixnum bytes_read =\n raw_fread((void*)data->tenured->start, 1, h->data_size, file);\n\n if ((cell)bytes_read != h->data_size) {\n std::cout << \"truncated image: \" << bytes_read << \" bytes read, \";\n std::cout << h->data_size << \" bytes expected\\n\";\n fatal_error(\"load_data_heap failed\", 0);\n }\n\n data->tenured->initial_free_list(h->data_size);\n}\n\nvoid factor_vm::load_code_heap(FILE* file, image_header* h, vm_parameters* p) {\n if (h->code_size > p->code_size)\n fatal_error(\"Code heap too small to fit image\", h->code_size);\n\n code = new code_heap(p->code_size);\n\n if (h->code_size != 0) {\n size_t bytes_read =\n raw_fread((void*)code->allocator->start, 1, h->code_size, file);\n if (bytes_read != h->code_size) {\n std::cout << \"truncated image: \" << bytes_read << \" bytes read, \";\n std::cout << h->code_size << \" bytes expected\\n\";\n fatal_error(\"load_code_heap failed\", 0);\n }\n }\n\n code->allocator->initial_free_list(h->code_size);\n code->initialize_all_blocks_set();\n}\n\nstruct startup_fixup {\n static const bool translated_code_block_map = true;\n\n cell data_offset;\n cell code_offset;\n\n startup_fixup(cell data_offset, cell code_offset)\n : data_offset(data_offset), code_offset(code_offset) {}\n\n object* fixup_data(object* obj) {\n return (object*)((cell)obj + data_offset);\n }\n\n code_block* fixup_code(code_block* obj) {\n return (code_block*)((cell)obj + code_offset);\n }\n\n object* translate_data(const object* obj) { return fixup_data((object*)obj); }\n\n code_block* translate_code(const code_block* compiled) {\n return fixup_code((code_block*)compiled);\n }\n\n cell size(const object* obj) { return obj->size(*this); }\n\n cell size(code_block* compiled) { return compiled->size(*this); }\n};\n\nvoid factor_vm::fixup_heaps(cell data_offset, cell code_offset) {\n startup_fixup fixup(data_offset, code_offset);\n slot_visitor<startup_fixup> visitor(this, fixup);\n visitor.visit_all_roots();\n\n auto start_object_updater = [&](object *obj, cell size) {\n data->tenured->starts.record_object_start_offset(obj);\n visitor.visit_slots(obj);\n switch (obj->type()) {\n case ALIEN_TYPE: {\n alien* ptr = (alien*)obj;\n if (to_boolean(ptr->base))\n ptr->update_address();\n else\n ptr->expired = special_objects[OBJ_CANONICAL_TRUE];\n break;\n }\n case DLL_TYPE: {\n ffi_dlopen((dll*)obj);\n break;\n }\n default: {\n visitor.visit_object_code_block(obj);\n break;\n }\n }\n };\n data->tenured->iterate(start_object_updater, fixup);\n\n auto updater = [&](code_block* compiled, cell size) {\n visitor.visit_code_block_objects(compiled);\n cell rel_base = compiled->entry_point() - fixup.code_offset;\n visitor.visit_instruction_operands(compiled, rel_base);\n };\n code->allocator->iterate(updater, fixup);\n}\n\nbool factor_vm::read_embedded_image_footer(FILE* file,\n embedded_image_footer* footer) {\n safe_fseek(file, -(off_t)sizeof(embedded_image_footer), SEEK_END);\n safe_fread(footer, (off_t)sizeof(embedded_image_footer), 1, file);\n return footer->magic == image_magic;\n}\n\nchar *threadsafe_strerror(int errnum) {\n char *buf = (char *) malloc(STRERROR_BUFFER_SIZE);\n if(!buf) {\n fatal_error(\"Out of memory in threadsafe_strerror, errno\", errnum);\n }\n THREADSAFE_STRERROR(errnum, buf, STRERROR_BUFFER_SIZE);\n return buf;\n}\n\nFILE* factor_vm::open_image(vm_parameters* p) {\n if (!p->embedded_image)\n return OPEN_READ(p->image_path);\n\n FILE* file = OPEN_READ(p->executable_path);\n if (file == NULL) {\n std::cout << \"Cannot open embedded image\" << std::endl;\n char *msg = threadsafe_strerror(errno);\n std::cout << \"strerror:1: \" << msg << std::endl;\n free(msg);\n exit(1);\n }\n embedded_image_footer footer;\n if (!read_embedded_image_footer(file, &footer)) {\n std::cout << \"No embedded image\" << std::endl;\n exit(1);\n }\n safe_fseek(file, (off_t)footer.image_offset, SEEK_SET);\n return file;\n}\n\n\/* Read an image file from disk, only done once during startup *\/\n\/* This function also initializes the data and code heaps *\/\nvoid factor_vm::load_image(vm_parameters* p) {\n FILE* file = open_image(p);\n if (file == NULL) {\n std::cout << \"Cannot open image file: \" << p->image_path << std::endl;\n char *msg = threadsafe_strerror(errno);\n std::cout << \"strerror:2: \" << msg << std::endl;\n free(msg);\n exit(1);\n }\n image_header h;\n if (raw_fread(&h, sizeof(image_header), 1, file) != 1)\n fatal_error(\"Cannot read image header\", 0);\n\n if (h.magic != image_magic)\n fatal_error(\"Bad image: magic number check failed\", h.magic);\n\n if (h.version != image_version)\n fatal_error(\"Bad image: version number check failed\", h.version);\n\n load_data_heap(file, &h, p);\n load_code_heap(file, &h, p);\n\n raw_fclose(file);\n\n \/* Certain special objects in the image are known to the runtime *\/\n memcpy(special_objects, h.special_objects, sizeof(special_objects));\n\n cell data_offset = data->tenured->start - h.data_relocation_base;\n cell code_offset = code->allocator->start - h.code_relocation_base;\n fixup_heaps(data_offset, code_offset);\n\n \/* Store image path name *\/\n special_objects[OBJ_IMAGE] = allot_alien(false_object, (cell)p->image_path);\n}\n\n\/* Save the current image to disk. We don't throw any exceptions here\n because if the 'then-die' argument is t it is not safe to do\n so. Instead we signal failure by returning false. *\/\nbool factor_vm::save_image(const vm_char* saving_filename,\n const vm_char* filename) {\n image_header h;\n\n h.magic = image_magic;\n h.version = image_version;\n h.data_relocation_base = data->tenured->start;\n h.data_size = data->tenured->occupied_space();\n h.code_relocation_base = code->allocator->start;\n h.code_size = code->allocator->occupied_space();\n\n for (cell i = 0; i < special_object_count; i++)\n h.special_objects[i] =\n (save_special_p(i) ? special_objects[i] : false_object);\n\n FILE* file = OPEN_WRITE(saving_filename);\n if (file == NULL)\n return false;\n if (safe_fwrite(&h, sizeof(image_header), 1, file) != 1)\n return false;\n if (h.data_size > 0 &&\n safe_fwrite((void*)data->tenured->start, h.data_size, 1, file) != 1)\n return false;\n if (h.code_size > 0 &&\n safe_fwrite((void*)code->allocator->start, h.code_size, 1, file) != 1)\n return false;\n if (raw_fclose(file) == -1)\n return false;\n if (!move_file(saving_filename, filename))\n return false;\n return true;\n}\n\n\/* Allocates memory *\/\nvoid factor_vm::primitive_save_image() {\n \/* We unbox this before doing anything else. This is the only point\n where we might throw an error, so we have to throw an error here since\n later steps destroy the current image. *\/\n bool then_die = to_boolean(ctx->pop());\n byte_array* path2 = untag_check<byte_array>(ctx->pop());\n byte_array* path1 = untag_check<byte_array>(ctx->pop());\n\n \/* Copy the paths to non-gc memory to avoid them hanging around in\n the saved image. *\/\n vm_char* path1_saved = safe_strdup(path1->data<vm_char>());\n vm_char* path2_saved = safe_strdup(path2->data<vm_char>());\n\n if (then_die) {\n \/* strip out special_objects data which is set on startup anyway *\/\n for (cell i = 0; i < special_object_count; i++)\n if (!save_special_p(i))\n special_objects[i] = false_object;\n\n \/* dont trace objects only reachable from context stacks so we don't\n get volatile data saved in the image. *\/\n active_contexts.clear();\n code->uninitialized_blocks.clear();\n\n \/* I think clearing the callback heap should be fine too. *\/\n callbacks->allocator->initial_free_list(0);\n }\n\n \/* do a full GC to push everything remaining into tenured space *\/\n primitive_compact_gc();\n\n \/* Save the image *\/\n bool ret = save_image(path1_saved, path2_saved);\n if (then_die) {\n exit(ret ? 0 : 1);\n }\n free(path1_saved);\n free(path2_saved);\n\n if (!ret) {\n general_error(ERROR_IO, tag_fixnum(errno), false_object);\n }\n}\n\nbool factor_vm::embedded_image_p() {\n const vm_char* vm_path = vm_executable_path();\n if (!vm_path)\n return false;\n FILE* file = OPEN_READ(vm_path);\n if (!file)\n return false;\n embedded_image_footer footer;\n bool embedded_p = read_embedded_image_footer(file, &footer);\n fclose(file);\n return embedded_p;\n}\n\n}\n<commit_msg>VM: return value of vm_executable_path() should be free'd<commit_after>#include \"master.hpp\"\n\nnamespace factor {\n\nbool factor_arg(const vm_char* str, const vm_char* arg, cell* value) {\n int val;\n if (SSCANF(str, arg, &val) > 0) {\n *value = val;\n return true;\n }\n return false;\n}\n\nvm_parameters::vm_parameters() {\n embedded_image = false;\n image_path = NULL;\n\n datastack_size = 32 * sizeof(cell);\n retainstack_size = 32 * sizeof(cell);\n\n#if defined(FACTOR_PPC)\n callstack_size = 256 * sizeof(cell);\n#else\n callstack_size = 128 * sizeof(cell);\n#endif\n\n code_size = 64;\n young_size = sizeof(cell) \/ 4;\n aging_size = sizeof(cell) \/ 2;\n tenured_size = 24 * sizeof(cell);\n\n max_pic_size = 3;\n\n fep = false;\n signals = true;\n\n#ifdef WINDOWS\n console = GetConsoleWindow() != NULL;\n#else\n console = true;\n#endif\n\n callback_size = 256;\n}\n\nvoid vm_parameters::init_from_args(int argc, vm_char** argv) {\n executable_path = argv[0];\n\n int i = 0;\n\n for (i = 1; i < argc; i++) {\n vm_char* arg = argv[i];\n if (STRCMP(arg, STRING_LITERAL(\"--\")) == 0)\n break;\n else if (factor_arg(arg, STRING_LITERAL(\"-datastack=%d\"),\n &datastack_size))\n ;\n else if (factor_arg(arg, STRING_LITERAL(\"-retainstack=%d\"),\n &retainstack_size))\n ;\n else if (factor_arg(arg, STRING_LITERAL(\"-callstack=%d\"),\n &callstack_size))\n ;\n else if (factor_arg(arg, STRING_LITERAL(\"-young=%d\"), &young_size))\n ;\n else if (factor_arg(arg, STRING_LITERAL(\"-aging=%d\"), &aging_size))\n ;\n else if (factor_arg(arg, STRING_LITERAL(\"-tenured=%d\"), &tenured_size))\n ;\n else if (factor_arg(arg, STRING_LITERAL(\"-codeheap=%d\"), &code_size))\n ;\n else if (factor_arg(arg, STRING_LITERAL(\"-pic=%d\"), &max_pic_size))\n ;\n else if (factor_arg(arg, STRING_LITERAL(\"-callbacks=%d\"), &callback_size))\n ;\n else if (STRNCMP(arg, STRING_LITERAL(\"-i=\"), 3) == 0)\n image_path = arg + 3;\n else if (STRCMP(arg, STRING_LITERAL(\"-fep\")) == 0)\n fep = true;\n else if (STRCMP(arg, STRING_LITERAL(\"-nosignals\")) == 0)\n signals = false;\n else if (STRCMP(arg, STRING_LITERAL(\"-console\")) == 0)\n console = true;\n }\n}\n\nvoid factor_vm::load_data_heap(FILE* file, image_header* h, vm_parameters* p) {\n p->tenured_size = std::max((h->data_size * 3) \/ 2, p->tenured_size);\n\n init_data_heap(p->young_size, p->aging_size, p->tenured_size);\n\n fixnum bytes_read =\n raw_fread((void*)data->tenured->start, 1, h->data_size, file);\n\n if ((cell)bytes_read != h->data_size) {\n std::cout << \"truncated image: \" << bytes_read << \" bytes read, \";\n std::cout << h->data_size << \" bytes expected\\n\";\n fatal_error(\"load_data_heap failed\", 0);\n }\n\n data->tenured->initial_free_list(h->data_size);\n}\n\nvoid factor_vm::load_code_heap(FILE* file, image_header* h, vm_parameters* p) {\n if (h->code_size > p->code_size)\n fatal_error(\"Code heap too small to fit image\", h->code_size);\n\n code = new code_heap(p->code_size);\n\n if (h->code_size != 0) {\n size_t bytes_read =\n raw_fread((void*)code->allocator->start, 1, h->code_size, file);\n if (bytes_read != h->code_size) {\n std::cout << \"truncated image: \" << bytes_read << \" bytes read, \";\n std::cout << h->code_size << \" bytes expected\\n\";\n fatal_error(\"load_code_heap failed\", 0);\n }\n }\n\n code->allocator->initial_free_list(h->code_size);\n code->initialize_all_blocks_set();\n}\n\nstruct startup_fixup {\n static const bool translated_code_block_map = true;\n\n cell data_offset;\n cell code_offset;\n\n startup_fixup(cell data_offset, cell code_offset)\n : data_offset(data_offset), code_offset(code_offset) {}\n\n object* fixup_data(object* obj) {\n return (object*)((cell)obj + data_offset);\n }\n\n code_block* fixup_code(code_block* obj) {\n return (code_block*)((cell)obj + code_offset);\n }\n\n object* translate_data(const object* obj) { return fixup_data((object*)obj); }\n\n code_block* translate_code(const code_block* compiled) {\n return fixup_code((code_block*)compiled);\n }\n\n cell size(const object* obj) { return obj->size(*this); }\n\n cell size(code_block* compiled) { return compiled->size(*this); }\n};\n\nvoid factor_vm::fixup_heaps(cell data_offset, cell code_offset) {\n startup_fixup fixup(data_offset, code_offset);\n slot_visitor<startup_fixup> visitor(this, fixup);\n visitor.visit_all_roots();\n\n auto start_object_updater = [&](object *obj, cell size) {\n data->tenured->starts.record_object_start_offset(obj);\n visitor.visit_slots(obj);\n switch (obj->type()) {\n case ALIEN_TYPE: {\n alien* ptr = (alien*)obj;\n if (to_boolean(ptr->base))\n ptr->update_address();\n else\n ptr->expired = special_objects[OBJ_CANONICAL_TRUE];\n break;\n }\n case DLL_TYPE: {\n ffi_dlopen((dll*)obj);\n break;\n }\n default: {\n visitor.visit_object_code_block(obj);\n break;\n }\n }\n };\n data->tenured->iterate(start_object_updater, fixup);\n\n auto updater = [&](code_block* compiled, cell size) {\n visitor.visit_code_block_objects(compiled);\n cell rel_base = compiled->entry_point() - fixup.code_offset;\n visitor.visit_instruction_operands(compiled, rel_base);\n };\n code->allocator->iterate(updater, fixup);\n}\n\nbool factor_vm::read_embedded_image_footer(FILE* file,\n embedded_image_footer* footer) {\n safe_fseek(file, -(off_t)sizeof(embedded_image_footer), SEEK_END);\n safe_fread(footer, (off_t)sizeof(embedded_image_footer), 1, file);\n return footer->magic == image_magic;\n}\n\nchar *threadsafe_strerror(int errnum) {\n char *buf = (char *) malloc(STRERROR_BUFFER_SIZE);\n if(!buf) {\n fatal_error(\"Out of memory in threadsafe_strerror, errno\", errnum);\n }\n THREADSAFE_STRERROR(errnum, buf, STRERROR_BUFFER_SIZE);\n return buf;\n}\n\nFILE* factor_vm::open_image(vm_parameters* p) {\n if (!p->embedded_image)\n return OPEN_READ(p->image_path);\n\n FILE* file = OPEN_READ(p->executable_path);\n if (file == NULL) {\n std::cout << \"Cannot open embedded image\" << std::endl;\n char *msg = threadsafe_strerror(errno);\n std::cout << \"strerror:1: \" << msg << std::endl;\n free(msg);\n exit(1);\n }\n embedded_image_footer footer;\n if (!read_embedded_image_footer(file, &footer)) {\n std::cout << \"No embedded image\" << std::endl;\n exit(1);\n }\n safe_fseek(file, (off_t)footer.image_offset, SEEK_SET);\n return file;\n}\n\n\/* Read an image file from disk, only done once during startup *\/\n\/* This function also initializes the data and code heaps *\/\nvoid factor_vm::load_image(vm_parameters* p) {\n FILE* file = open_image(p);\n if (file == NULL) {\n std::cout << \"Cannot open image file: \" << p->image_path << std::endl;\n char *msg = threadsafe_strerror(errno);\n std::cout << \"strerror:2: \" << msg << std::endl;\n free(msg);\n exit(1);\n }\n image_header h;\n if (raw_fread(&h, sizeof(image_header), 1, file) != 1)\n fatal_error(\"Cannot read image header\", 0);\n\n if (h.magic != image_magic)\n fatal_error(\"Bad image: magic number check failed\", h.magic);\n\n if (h.version != image_version)\n fatal_error(\"Bad image: version number check failed\", h.version);\n\n load_data_heap(file, &h, p);\n load_code_heap(file, &h, p);\n\n raw_fclose(file);\n\n \/* Certain special objects in the image are known to the runtime *\/\n memcpy(special_objects, h.special_objects, sizeof(special_objects));\n\n cell data_offset = data->tenured->start - h.data_relocation_base;\n cell code_offset = code->allocator->start - h.code_relocation_base;\n fixup_heaps(data_offset, code_offset);\n\n \/* Store image path name *\/\n special_objects[OBJ_IMAGE] = allot_alien(false_object, (cell)p->image_path);\n}\n\n\/* Save the current image to disk. We don't throw any exceptions here\n because if the 'then-die' argument is t it is not safe to do\n so. Instead we signal failure by returning false. *\/\nbool factor_vm::save_image(const vm_char* saving_filename,\n const vm_char* filename) {\n image_header h;\n\n h.magic = image_magic;\n h.version = image_version;\n h.data_relocation_base = data->tenured->start;\n h.data_size = data->tenured->occupied_space();\n h.code_relocation_base = code->allocator->start;\n h.code_size = code->allocator->occupied_space();\n\n for (cell i = 0; i < special_object_count; i++)\n h.special_objects[i] =\n (save_special_p(i) ? special_objects[i] : false_object);\n\n FILE* file = OPEN_WRITE(saving_filename);\n if (file == NULL)\n return false;\n if (safe_fwrite(&h, sizeof(image_header), 1, file) != 1)\n return false;\n if (h.data_size > 0 &&\n safe_fwrite((void*)data->tenured->start, h.data_size, 1, file) != 1)\n return false;\n if (h.code_size > 0 &&\n safe_fwrite((void*)code->allocator->start, h.code_size, 1, file) != 1)\n return false;\n if (raw_fclose(file) == -1)\n return false;\n if (!move_file(saving_filename, filename))\n return false;\n return true;\n}\n\n\/* Allocates memory *\/\nvoid factor_vm::primitive_save_image() {\n \/* We unbox this before doing anything else. This is the only point\n where we might throw an error, so we have to throw an error here since\n later steps destroy the current image. *\/\n bool then_die = to_boolean(ctx->pop());\n byte_array* path2 = untag_check<byte_array>(ctx->pop());\n byte_array* path1 = untag_check<byte_array>(ctx->pop());\n\n \/* Copy the paths to non-gc memory to avoid them hanging around in\n the saved image. *\/\n vm_char* path1_saved = safe_strdup(path1->data<vm_char>());\n vm_char* path2_saved = safe_strdup(path2->data<vm_char>());\n\n if (then_die) {\n \/* strip out special_objects data which is set on startup anyway *\/\n for (cell i = 0; i < special_object_count; i++)\n if (!save_special_p(i))\n special_objects[i] = false_object;\n\n \/* dont trace objects only reachable from context stacks so we don't\n get volatile data saved in the image. *\/\n active_contexts.clear();\n code->uninitialized_blocks.clear();\n\n \/* I think clearing the callback heap should be fine too. *\/\n callbacks->allocator->initial_free_list(0);\n }\n\n \/* do a full GC to push everything remaining into tenured space *\/\n primitive_compact_gc();\n\n \/* Save the image *\/\n bool ret = save_image(path1_saved, path2_saved);\n if (then_die) {\n exit(ret ? 0 : 1);\n }\n free(path1_saved);\n free(path2_saved);\n\n if (!ret) {\n general_error(ERROR_IO, tag_fixnum(errno), false_object);\n }\n}\n\nbool factor_vm::embedded_image_p() {\n const vm_char* vm_path = vm_executable_path();\n FILE* file = OPEN_READ(vm_path);\n if (!file) {\n free((vm_char *)vm_path);\n return false;\n }\n embedded_image_footer footer;\n bool embedded_p = read_embedded_image_footer(file, &footer);\n fclose(file);\n free((vm_char *)vm_path);\n return embedded_p;\n}\n\n}\n<|endoftext|>"} {"text":"<commit_before>#define PUT(x) std::cout << #x \"=\" << (x) << std::endl;\n#include <mcl\/fp.hpp>\n#include <mcl\/ecparam.hpp>\n#include <cybozu\/xorshift.hpp>\n#include <cybozu\/test.hpp>\n#include <cybozu\/benchmark.hpp>\n\nstruct FpTag;\ntypedef mcl::FpT<FpTag, 384> Fp;\n\nvoid put(const void *buf, size_t bufSize)\n{\n\tconst unsigned char* p = (const unsigned char*)buf;\n\tfor (size_t i = 0; i < bufSize; i++) {\n\t\tprintf(\"%02x\", p[i]);\n\t}\n\tprintf(\"\\n\");\n}\n\ntemplate<class F, typename T>\nvoid powC(F& z, const F& x, const T *yTbl, size_t yn)\n{\n\tconst size_t w = 4;\n\tconst size_t N = 1 << w;\n\tuint8_t idxTbl[256\/w];\n\tmcl::fp::ArrayIterator<T> iter(yTbl, sizeof(T) * 8 * yn, w);\n\tsize_t idxN = 0;\n\twhile (iter.hasNext()) {\n\t\tassert(idxN < sizeof(idxTbl));\n\t\tidxTbl[idxN++] = iter.getNext();\n\t}\n\tassert(idxN > 0);\n\tF tbl[N];\n\ttbl[1] = x;\n\tfor (size_t i = 2; i < N; i++) {\n\t\ttbl[i] = tbl[i-1] * x;\n\t}\n\tz = tbl[idxTbl[idxN - 1]];\n\tfor (size_t i = 1; i < idxN; i++) {\n\t\tfor (size_t j = 0; j < w; j++) {\n\t\t\tF::sqr(z, z);\n\t\t}\n\t\tuint32_t idx = idxTbl[idxN - 1 - i];\n\t\tif (idx) z *= tbl[idx];\n\t}\n}\n\ninline size_t getBinary(uint8_t *bin, size_t maxBinN, mpz_class x, size_t w)\n{\n\tif (w == 0 || w >= 8) return 0;\n\tsize_t binN = 0;\n\tsize_t zeroNum = 0;\n\tconst size_t maskW = (1u << w) - 1;\n\tusing namespace mcl::gmp;\n\twhile (!isZero(x)) {\n\t\tsize_t z = getLowerZeroBitNum(x);\n\t\tif (z) {\n\t\t\tx >>= z;\n\t\t\tzeroNum += z;\n\t\t}\n\t\tfor (size_t i = 0; i < zeroNum; i++) {\n\t\t\tif (binN == maxBinN) return 0;\n\t\t\tbin[binN++] = 0;\n\t\t}\n\t\tint v = getUnit(x)[0] & maskW;\n\t\tx >>= w;\n\t\tif (binN == maxBinN) return 0;\n\t\tbin[binN++] = v;\n\t\tzeroNum = w - 1;\n\t}\n\treturn binN;\n}\n\ntemplate<class F, size_t w = 5>\nvoid pow3(F& z, const F& x, const mpz_class& y)\n{\n\tassert(y >= 0);\n\tassert(w > 0);\n\tif (y == 0) {\n\t\tz = 1;\n\t\treturn;\n\t}\n\tconst size_t tblSize = 1 << (w - 1);\n\tuint8_t bin[sizeof(F) * 8];\n\tF tbl[tblSize];\n\tmpz_class u;\n\tsize_t binN = getBinary(bin, sizeof(bin), y, w);\n\n\tF x2;\n\tF::sqr(x2, x);\n\ttbl[0] = x;\n\tfor (size_t i = 1; i < tblSize; i++) {\n\t\tF::mul(tbl[i], tbl[i - 1], x2);\n\t}\n\tz = 1;\n\tfor (size_t i = 0; i < binN; i++) {\n\t\tconst size_t bit = binN - 1 - i;\n\t\tF::sqr(z, z);\n\t\tuint8_t n = bin[bit];\n\t\tif (n > 0) {\n\t\t\tz *= tbl[(n - 1) >> 1];\n\t\t}\n\t}\n}\n\ntemplate<class T>\nvoid pow2(T& z, const T& x, const mpz_class& y)\n{\n\tpowC(z, x, mcl::gmp::getUnit(y), mcl::gmp::getUnitSize(y));\n}\n\ntemplate<class T, class F>\nvoid pow2(T& z, const T& x, const F& y_)\n{\n\tmpz_class y = y_.getMpz();\n\tpowC(z, x, mcl::gmp::getUnit(y), mcl::gmp::getUnitSize(y));\n}\n\nvoid bench(const char *name, const char *pStr)\n{\n\tprintf(\"bench name=%s\\n\", name);\n\tFp::init(pStr);\n\tconst int C = 100000;\n\tcybozu::XorShift rg;\n\tFp x, y;\n\tfor (int i = 0; i < 100; i++) {\n\t\tx.setByCSPRNG(rg);\n\t\ty.setByCSPRNG(rg);\n\t\tFp t1, t2;\n\t\tFp::pow(t1, x, y);\n\t\tpow3(t2, x, y.getMpz());\n\t\tCYBOZU_TEST_EQUAL(t1, t2);\n\t}\n\tCYBOZU_BENCH_C(\"Fp::add\", C, Fp::add, x, x, y);\n\tCYBOZU_BENCH_C(\"Fp::sub\", C, Fp::sub, x, x, y);\n\tCYBOZU_BENCH_C(\"Fp::mul\", C, Fp::mul, x, x, y);\n\tCYBOZU_BENCH_C(\"Fp::sqr\", C, Fp::sqr, x, x);\n\tCYBOZU_BENCH_C(\"Fp::inv\", C, Fp::inv, x, x);\n\tCYBOZU_BENCH_C(\"Fp::pow\", C, Fp::pow, x, x, y);\n\tmpz_class my = y.getMpz();\n\tCYBOZU_BENCH_C(\"pow3\", C, pow3, x, x, my);\n\tCYBOZU_BENCH_C(\"pow2\", C, pow2, x, x, y);\n}\n\nCYBOZU_TEST_AUTO(main)\n{\n\tconst struct {\n\t\tconst char *name;\n\t\tconst char *pStr;\n\t} tbl[] = {\n\t\t{ \"secp256k1p\", mcl::ecparam::secp256k1.p },\n\t\t{ \"secp256k1r\", mcl::ecparam::secp256k1.n },\n\t\t{ \"bn254r\", \"0x2523648240000001ba344d8000000007ff9f800000000010a10000000000000d\" },\n\t\t{ \"bn254p\", \"0x2523648240000001ba344d80000000086121000000000013a700000000000013\" },\n\t\t{ \"bls12_381p\", \"0x73eda753299d7d483339d80809a1d80553bda402fffe5bfeffffffff00000001\" },\n\t\t{ \"bls12_381r\", \"0x1a0111ea397fe69a4b1ba7b6434bacd764774b84f38512bf6730d2a0f6b0f6241eabfffeb153ffffb9feffffffffaaab\" },\n\t};\n\tfor (size_t i = 0; i < CYBOZU_NUM_OF_ARRAY(tbl); i++) {\n\t\tbench(tbl[i].name, tbl[i].pStr);\n\t}\n}\n\n<commit_msg>[skip ci] count mul\/sqr<commit_after>#define PUT(x) std::cout << #x \"=\" << (x) << std::endl;\n#include <mcl\/fp.hpp>\n#include <mcl\/ecparam.hpp>\n#include <cybozu\/xorshift.hpp>\n#include <cybozu\/test.hpp>\n#include <cybozu\/benchmark.hpp>\n\nstruct FpTag;\ntypedef mcl::FpT<FpTag, 384> Fp;\n\nvoid put(const void *buf, size_t bufSize)\n{\n\tconst unsigned char* p = (const unsigned char*)buf;\n\tfor (size_t i = 0; i < bufSize; i++) {\n\t\tprintf(\"%02x\", p[i]);\n\t}\n\tprintf(\"\\n\");\n}\n\nstatic int ccc_mul;\nstatic int ccc_sqr;\n\ntemplate<class F, typename T>\nvoid powC(F& z, const F& x, const T *yTbl, size_t yn)\n{\n\tconst size_t w = 4;\n\tconst size_t N = 1 << w;\n\tuint8_t idxTbl[256\/w];\n\tmcl::fp::ArrayIterator<T> iter(yTbl, sizeof(T) * 8 * yn, w);\n\tsize_t idxN = 0;\n\twhile (iter.hasNext()) {\n\t\tassert(idxN < sizeof(idxTbl));\n\t\tidxTbl[idxN++] = iter.getNext();\n\t}\n\tassert(idxN > 0);\n\tF tbl[N];\n\ttbl[1] = x;\n\tfor (size_t i = 2; i < N; i++) {\n\t\ttbl[i] = tbl[i-1] * x;\nccc_mul++;\n\t}\n\tz = tbl[idxTbl[idxN - 1]];\n\tfor (size_t i = 1; i < idxN; i++) {\n\t\tfor (size_t j = 0; j < w; j++) {\n\t\t\tF::sqr(z, z);\nccc_sqr++;\n\t\t}\n\t\tuint32_t idx = idxTbl[idxN - 1 - i];\n\t\tif (idx) {\n\t\t\tz *= tbl[idx];\nccc_mul++;\n\t\t}\n\t}\n}\n\ninline size_t getBinary(uint8_t *bin, size_t maxBinN, mpz_class x, size_t w)\n{\n\tif (w == 0 || w >= 8) return 0;\n\tsize_t binN = 0;\n\tsize_t zeroNum = 0;\n\tconst size_t maskW = (1u << w) - 1;\n\tusing namespace mcl::gmp;\n\twhile (!isZero(x)) {\n\t\tsize_t z = getLowerZeroBitNum(x);\n\t\tif (z) {\n\t\t\tx >>= z;\n\t\t\tzeroNum += z;\n\t\t}\n\t\tfor (size_t i = 0; i < zeroNum; i++) {\n\t\t\tif (binN == maxBinN) return 0;\n\t\t\tbin[binN++] = 0;\n\t\t}\n\t\tint v = getUnit(x)[0] & maskW;\n\t\tx >>= w;\n\t\tif (binN == maxBinN) return 0;\n\t\tbin[binN++] = v;\n\t\tzeroNum = w - 1;\n\t}\n\treturn binN;\n}\n\ntemplate<class F, size_t w = 5>\nvoid pow3(F& z, const F& x, const mpz_class& y)\n{\n\tassert(y >= 0);\n\tassert(w > 0);\n\tif (y == 0) {\n\t\tz = 1;\n\t\treturn;\n\t}\n\tconst size_t tblSize = 1 << (w - 1);\n\tuint8_t bin[sizeof(F) * 8];\n\tF tbl[tblSize];\n\tmpz_class u;\n\tsize_t binN = getBinary(bin, sizeof(bin), y, w);\n\n\tF x2;\n\tF::sqr(x2, x);\nccc_sqr++;\n\ttbl[0] = x;\n\tfor (size_t i = 1; i < tblSize; i++) {\n\t\tF::mul(tbl[i], tbl[i - 1], x2);\nccc_mul++;\n\t}\n\tz = 1;\n\tfor (size_t i = 0; i < binN; i++) {\n\t\tconst size_t bit = binN - 1 - i;\n\t\tF::sqr(z, z);\nccc_sqr++;\n\t\tuint8_t n = bin[bit];\n\t\tif (n > 0) {\n\t\t\tz *= tbl[(n - 1) >> 1];\nccc_mul++;\n\t\t}\n\t}\n}\n\ntemplate<class T>\nvoid pow2(T& z, const T& x, const mpz_class& y)\n{\n\tpowC(z, x, mcl::gmp::getUnit(y), mcl::gmp::getUnitSize(y));\n}\n\ntemplate<class T, class F>\nvoid pow2(T& z, const T& x, const F& y_)\n{\n\tmpz_class y = y_.getMpz();\n\tpowC(z, x, mcl::gmp::getUnit(y), mcl::gmp::getUnitSize(y));\n}\n\ntemplate<class T, class F>\nvoid pow3(T& z, const T& x, const F& y_)\n{\n\tmpz_class y = y_.getMpz();\n\tpow3(z, x, y);\n}\n\nvoid bench(const char *name, const char *pStr)\n{\n\tprintf(\"bench name=%s\\n\", name);\n\tFp::init(pStr);\n\tconst int C = 10000;\n\tcybozu::XorShift rg;\n\tFp x, y;\n\tfor (int i = 0; i < 100; i++) {\n\t\tx.setByCSPRNG(rg);\n\t\ty.setByCSPRNG(rg);\n\t\tFp t1, t2;\n\t\tFp::pow(t1, x, y);\n\t\tpow3(t2, x, y.getMpz());\n\t\tCYBOZU_TEST_EQUAL(t1, t2);\n\t}\n\tCYBOZU_BENCH_C(\"Fp::add\", C, Fp::add, x, x, y);\n\tCYBOZU_BENCH_C(\"Fp::sub\", C, Fp::sub, x, x, y);\n\tCYBOZU_BENCH_C(\"Fp::mul\", C, Fp::mul, x, x, y);\n\tCYBOZU_BENCH_C(\"Fp::sqr\", C, Fp::sqr, x, x);\n\tCYBOZU_BENCH_C(\"Fp::inv\", C, Fp::inv, x, x);\n\tCYBOZU_BENCH_C(\"Fp::pow\", C, Fp::pow, x, x, x);\nccc_mul=0;\nccc_sqr=0;\n\tCYBOZU_BENCH_C(\"pow2\", C, pow2, x, x, x);\nprintf(\"mul=%d sqr=%d\\n\", ccc_mul, ccc_sqr);\nccc_mul=0;\nccc_sqr=0;\n\tCYBOZU_BENCH_C(\"pow3\", C, pow3, x, x, x);\nprintf(\"mul=%d sqr=%d\\n\", ccc_mul, ccc_sqr);\n}\n\nCYBOZU_TEST_AUTO(main)\n{\n\tconst struct {\n\t\tconst char *name;\n\t\tconst char *pStr;\n\t} tbl[] = {\n\t\t{ \"secp256k1p\", mcl::ecparam::secp256k1.p },\n\t\t{ \"secp256k1r\", mcl::ecparam::secp256k1.n },\n\t\t{ \"bn254r\", \"0x2523648240000001ba344d8000000007ff9f800000000010a10000000000000d\" },\n\t\t{ \"bn254p\", \"0x2523648240000001ba344d80000000086121000000000013a700000000000013\" },\n\t\t{ \"bls12_381p\", \"0x73eda753299d7d483339d80809a1d80553bda402fffe5bfeffffffff00000001\" },\n\t\t{ \"bls12_381r\", \"0x1a0111ea397fe69a4b1ba7b6434bacd764774b84f38512bf6730d2a0f6b0f6241eabfffeb153ffffb9feffffffffaaab\" },\n\t};\n\tfor (size_t i = 0; i < CYBOZU_NUM_OF_ARRAY(tbl); i++) {\n\t\tbench(tbl[i].name, tbl[i].pStr);\n\t}\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#ifndef _CHART2_DLG_INSERT_ERRORBARS_HXX\n#define _CHART2_DLG_INSERT_ERRORBARS_HXX\n\n#include <vcl\/dialog.hxx>\n#include <vcl\/button.hxx>\n#include <svl\/itemset.hxx>\n#include <memory>\n#include <com\/sun\/star\/frame\/XModel.hpp>\n\n#include \"res_ErrorBar.hxx\"\n\n\/\/.............................................................................\nnamespace chart\n{\n\/\/.............................................................................\n\nclass InsertErrorBarsDialog : public ModalDialog\n{\npublic:\n InsertErrorBarsDialog( Window* pParent, const SfxItemSet& rMyAttrs,\n const ::com::sun::star::uno::Reference<\n ::com::sun::star::chart2::XChartDocument > & xChartDocument,\n ErrorBarResources::tErrorBarType eType = ErrorBarResources::ERROR_BAR_Y );\n virtual ~InsertErrorBarsDialog();\n\n void SetAxisMinorStepWidthForErrorBarDecimals( double fMinorStepWidth );\n\n static double getAxisMinorStepWidthForErrorBarDecimals(\n const ::com::sun::star::uno::Reference<\n ::com::sun::star::frame::XModel >& xChartModel,\n const ::com::sun::star::uno::Reference<\n ::com::sun::star::uno::XInterface >& xChartView,\n const ::rtl::OUString& rSelectedObjectCID );\n\n void FillItemSet( SfxItemSet& rOutAttrs );\n virtual void DataChanged( const DataChangedEvent& rDCEvt );\n\nprivate:\n const SfxItemSet & rInAttrs;\n\n OKButton aBtnOK;\n CancelButton aBtnCancel;\n HelpButton aBtnHelp;\n\n ::std::auto_ptr< ErrorBarResources > m_apErrorBarResources;\n};\n\n\/\/.............................................................................\n} \/\/namespace chart\n\/\/.............................................................................\n\n#endif\n\n\/* vim:set shiftwidth=4 softtabstop=4 expandtab: *\/\n<commit_msg>Remove default values in InsertErrorBarsDialog constructor.<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#ifndef _CHART2_DLG_INSERT_ERRORBARS_HXX\n#define _CHART2_DLG_INSERT_ERRORBARS_HXX\n\n#include <vcl\/dialog.hxx>\n#include <vcl\/button.hxx>\n#include <svl\/itemset.hxx>\n#include <memory>\n#include <com\/sun\/star\/frame\/XModel.hpp>\n\n#include \"res_ErrorBar.hxx\"\n\n\/\/.............................................................................\nnamespace chart\n{\n\/\/.............................................................................\n\nclass InsertErrorBarsDialog : public ModalDialog\n{\npublic:\n InsertErrorBarsDialog( Window* pParent, const SfxItemSet& rMyAttrs,\n const ::com::sun::star::uno::Reference<\n ::com::sun::star::chart2::XChartDocument > & xChartDocument,\n ErrorBarResources::tErrorBarType eType );\n virtual ~InsertErrorBarsDialog();\n\n void SetAxisMinorStepWidthForErrorBarDecimals( double fMinorStepWidth );\n\n static double getAxisMinorStepWidthForErrorBarDecimals(\n const ::com::sun::star::uno::Reference<\n ::com::sun::star::frame::XModel >& xChartModel,\n const ::com::sun::star::uno::Reference<\n ::com::sun::star::uno::XInterface >& xChartView,\n const ::rtl::OUString& rSelectedObjectCID );\n\n void FillItemSet( SfxItemSet& rOutAttrs );\n virtual void DataChanged( const DataChangedEvent& rDCEvt );\n\nprivate:\n const SfxItemSet & rInAttrs;\n\n OKButton aBtnOK;\n CancelButton aBtnCancel;\n HelpButton aBtnHelp;\n\n ::std::auto_ptr< ErrorBarResources > m_apErrorBarResources;\n};\n\n\/\/.............................................................................\n} \/\/namespace chart\n\/\/.............................................................................\n\n#endif\n\n\/* vim:set shiftwidth=4 softtabstop=4 expandtab: *\/\n<|endoftext|>"} {"text":"<commit_before>\/*\n * Copyright 2017-2018 Leonid Yuriev <leo@yuriev.ru>\n * and other libmdbx authors: please see AUTHORS file.\n * All rights reserved.\n *\n * Redistribution and use in source and binary forms, with or without\n * modification, are permitted only as authorized by the OpenLDAP\n * Public License.\n *\n * A copy of this license is available in the file LICENSE in the\n * top-level directory of the distribution or, alternatively, at\n * <http:\/\/www.OpenLDAP.org\/license.html>.\n *\/\n\n#include \"test.h\"\n\n#include <pthread.h>\n#include <signal.h>\n#include <sys\/mman.h>\n#include <sys\/types.h>\n#include <sys\/wait.h>\n#include <unistd.h>\n\nstruct shared_t {\n pthread_barrier_t barrier;\n pthread_mutex_t mutex;\n size_t conds_size;\n pthread_cond_t conds[1];\n};\n\nstatic shared_t *shared;\n\nvoid osal_wait4barrier(void) {\n assert(shared != nullptr && shared != MAP_FAILED);\n int rc = pthread_barrier_wait(&shared->barrier);\n if (rc != 0 && rc != PTHREAD_BARRIER_SERIAL_THREAD) {\n failure_perror(\"pthread_barrier_wait(shared)\", rc);\n }\n}\n\nvoid osal_setup(const std::vector<actor_config> &actors) {\n assert(shared == nullptr);\n\n pthread_mutexattr_t mutexattr;\n int rc = pthread_mutexattr_init(&mutexattr);\n if (rc)\n failure_perror(\"pthread_mutexattr_init()\", rc);\n rc = pthread_mutexattr_setpshared(&mutexattr, PTHREAD_PROCESS_SHARED);\n if (rc)\n failure_perror(\"pthread_mutexattr_setpshared()\", rc);\n\n pthread_barrierattr_t barrierattr;\n rc = pthread_barrierattr_init(&barrierattr);\n if (rc)\n failure_perror(\"pthread_barrierattr_init()\", rc);\n rc = pthread_barrierattr_setpshared(&barrierattr, PTHREAD_PROCESS_SHARED);\n if (rc)\n failure_perror(\"pthread_barrierattr_setpshared()\", rc);\n\n pthread_condattr_t condattr;\n rc = pthread_condattr_init(&condattr);\n if (rc)\n failure_perror(\"pthread_condattr_init()\", rc);\n rc = pthread_condattr_setpshared(&condattr, PTHREAD_PROCESS_SHARED);\n if (rc)\n failure_perror(\"pthread_condattr_setpshared()\", rc);\n\n shared = (shared_t *)mmap(\n nullptr, sizeof(shared_t) + actors.size() * sizeof(pthread_cond_t),\n PROT_READ | PROT_WRITE, MAP_SHARED | MAP_ANONYMOUS, -1, 0);\n if (MAP_FAILED == (void *)shared)\n failure_perror(\"mmap(shared_conds)\", errno);\n\n rc = pthread_mutex_init(&shared->mutex, &mutexattr);\n if (rc)\n failure_perror(\"pthread_mutex_init(shared)\", rc);\n\n rc = pthread_barrier_init(&shared->barrier, &barrierattr, actors.size() + 1);\n if (rc)\n failure_perror(\"pthread_barrier_init(shared)\", rc);\n\n const size_t n = actors.size() + 1;\n for (size_t i = 0; i < n; ++i) {\n pthread_cond_t *event = &shared->conds[i];\n rc = pthread_cond_init(event, &condattr);\n if (rc)\n failure_perror(\"pthread_cond_init(shared)\", rc);\n log_trace(\"osal_setup: event(shared pthread_cond) %\" PRIuPTR \" -> %p\", i,\n event);\n }\n shared->conds_size = actors.size() + 1;\n\n pthread_barrierattr_destroy(&barrierattr);\n pthread_condattr_destroy(&condattr);\n pthread_mutexattr_destroy(&mutexattr);\n}\n\nvoid osal_broadcast(unsigned id) {\n assert(shared != nullptr && shared != MAP_FAILED);\n log_trace(\"osal_broadcast: event %u\", id);\n if (id >= shared->conds_size)\n failure(\"osal_broadcast: id > limit\");\n int rc = pthread_cond_broadcast(shared->conds + id);\n if (rc)\n failure_perror(\"sem_post(shared)\", rc);\n}\n\nint osal_waitfor(unsigned id) {\n assert(shared != nullptr && shared != MAP_FAILED);\n\n log_trace(\"osal_waitfor: event %u\", id);\n if (id >= shared->conds_size)\n failure(\"osal_waitfor: id > limit\");\n\n int rc = pthread_mutex_lock(&shared->mutex);\n if (rc != 0)\n failure_perror(\"pthread_mutex_lock(shared)\", rc);\n\n rc = pthread_cond_wait(shared->conds + id, &shared->mutex);\n if (rc && rc != EINTR)\n failure_perror(\"pthread_cond_wait(shared)\", rc);\n\n rc = pthread_mutex_unlock(&shared->mutex);\n if (rc != 0)\n failure_perror(\"pthread_mutex_unlock(shared)\", rc);\n\n return (rc == 0) ? true : false;\n}\n\n\/\/-----------------------------------------------------------------------------\n\nconst std::string\nactor_config::osal_serialize(simple_checksum &checksum) const {\n (void)checksum;\n \/* not used in workload, but just for testing *\/\n return \"unix.fork\";\n}\n\nbool actor_config::osal_deserialize(const char *str, const char *end,\n simple_checksum &checksum) {\n (void)checksum;\n \/* not used in workload, but just for testing *\/\n return strncmp(str, \"unix.fork\", 9) == 0 && str + 9 == end;\n}\n\n\/\/-----------------------------------------------------------------------------\n\nstatic std::unordered_map<pid_t, actor_status> childs;\n\nstatic void handler_SIGCHLD(int unused) { (void)unused; }\n\nmdbx_pid_t osal_getpid(void) { return getpid(); }\n\nint osal_delay(unsigned seconds) { return sleep(seconds) ? errno : 0; }\n\nint osal_actor_start(const actor_config &config, mdbx_pid_t &pid) {\n if (childs.empty())\n signal(SIGCHLD, handler_SIGCHLD);\n\n pid = fork();\n\n if (pid == 0) {\n const bool result = test_execute(config);\n exit(result ? EXIT_SUCCESS : EXIT_FAILURE);\n }\n\n if (pid < 0)\n return errno;\n\n log_trace(\"osal_actor_start: fork pid %i for %u\", pid, config.actor_id);\n childs[pid] = as_running;\n return 0;\n}\n\nactor_status osal_actor_info(const mdbx_pid_t pid) { return childs.at(pid); }\n\nvoid osal_killall_actors(void) {\n for (auto &pair : childs) {\n kill(pair.first, SIGKILL);\n pair.second = as_killed;\n }\n}\n\nint osal_actor_poll(mdbx_pid_t &pid, unsigned timeout) {\nretry:\n int status, options = WNOHANG;\n#ifdef WUNTRACED\n options |= WUNTRACED;\n#endif\n#ifdef WCONTINUED\n options |= WCONTINUED;\n#endif\n pid = waitpid(0, &status, options);\n\n if (pid > 0) {\n if (WIFEXITED(status))\n childs[pid] =\n (WEXITSTATUS(status) == EXIT_SUCCESS) ? as_successful : as_failed;\n else if (WIFSIGNALED(status) || WCOREDUMP(status))\n childs[pid] = as_killed;\n else if (WIFSTOPPED(status))\n childs[pid] = as_debuging;\n else if (WIFCONTINUED(status))\n childs[pid] = as_running;\n else {\n assert(false);\n }\n return 0;\n }\n\n if (pid == 0) {\n if (timeout && sleep(timeout))\n goto retry;\n return 0;\n }\n\n switch (errno) {\n case EINTR:\n pid = 0;\n return 0;\n\n case ECHILD:\n default:\n pid = 0;\n return errno;\n }\n}\n\nvoid osal_yield(void) {\n if (sched_yield())\n failure_perror(\"sched_yield()\", errno);\n}\n\nvoid osal_udelay(unsigned us) {\n chrono::time until, now = chrono::now_motonic();\n until.fixedpoint = now.fixedpoint + chrono::from_us(us).fixedpoint;\n struct timespec ts;\n\n static unsigned threshold_us;\n if (threshold_us == 0) {\n if (clock_getres(CLOCK_PROCESS_CPUTIME_ID, &ts)) {\n int rc = errno;\n failure_perror(\"clock_getres(CLOCK_PROCESS_CPUTIME_ID)\", rc);\n }\n chrono::time threshold = chrono::from_timespec(ts);\n assert(threshold.seconds() == 0);\n\n threshold_us = chrono::fractional2us(threshold.fractional);\n if (threshold_us < 1000)\n threshold_us = 1000;\n }\n\n ts.tv_sec = ts.tv_nsec = 0;\n if (us > threshold_us) {\n ts.tv_sec = us \/ 1000000u;\n ts.tv_nsec = (us % 1000000u) * 1000u;\n }\n\n do {\n if (us > threshold_us) {\n if (nanosleep(&ts, &ts)) {\n int rc = errno;\n \/* if (rc == EINTR) { ... } ? *\/\n failure_perror(\"usleep()\", rc);\n }\n us = ts.tv_sec * 1000000u + ts.tv_nsec \/ 1000u;\n }\n cpu_relax();\n\n now = chrono::now_motonic();\n } while (until.fixedpoint > now.fixedpoint);\n}\n\nbool osal_istty(int fd) { return isatty(fd) == 1; }\n\nstd::string osal_tempdir(void) {\n const char *tempdir = getenv(\"TMPDIR\");\n if (!tempdir)\n tempdir = getenv(\"TMP\");\n if (!tempdir)\n tempdir = getenv(\"TEMPDIR\");\n if (!tempdir)\n tempdir = getenv(\"TEMP\");\n if (tempdir) {\n std::string dir(tempdir);\n if (!dir.empty() && dir.at(dir.length() - 1) != '\/')\n dir.append(\"\/\");\n return dir;\n }\n if (access(\"\/dev\/shm\/\", R_OK | W_OK | X_OK) == 0)\n return \"\/dev\/shm\/\";\n return \"\";\n}\n<commit_msg>mdbx-test: fix sleep\/child-signal handling.<commit_after>\/*\n * Copyright 2017-2018 Leonid Yuriev <leo@yuriev.ru>\n * and other libmdbx authors: please see AUTHORS file.\n * All rights reserved.\n *\n * Redistribution and use in source and binary forms, with or without\n * modification, are permitted only as authorized by the OpenLDAP\n * Public License.\n *\n * A copy of this license is available in the file LICENSE in the\n * top-level directory of the distribution or, alternatively, at\n * <http:\/\/www.OpenLDAP.org\/license.html>.\n *\/\n\n#include \"test.h\"\n\n#include <pthread.h>\n#include <signal.h>\n#include <sys\/mman.h>\n#include <sys\/types.h>\n#include <sys\/wait.h>\n#include <unistd.h>\n\nstruct shared_t {\n pthread_barrier_t barrier;\n pthread_mutex_t mutex;\n size_t conds_size;\n pthread_cond_t conds[1];\n};\n\nstatic shared_t *shared;\n\nvoid osal_wait4barrier(void) {\n assert(shared != nullptr && shared != MAP_FAILED);\n int rc = pthread_barrier_wait(&shared->barrier);\n if (rc != 0 && rc != PTHREAD_BARRIER_SERIAL_THREAD) {\n failure_perror(\"pthread_barrier_wait(shared)\", rc);\n }\n}\n\nvoid osal_setup(const std::vector<actor_config> &actors) {\n assert(shared == nullptr);\n\n pthread_mutexattr_t mutexattr;\n int rc = pthread_mutexattr_init(&mutexattr);\n if (rc)\n failure_perror(\"pthread_mutexattr_init()\", rc);\n rc = pthread_mutexattr_setpshared(&mutexattr, PTHREAD_PROCESS_SHARED);\n if (rc)\n failure_perror(\"pthread_mutexattr_setpshared()\", rc);\n\n pthread_barrierattr_t barrierattr;\n rc = pthread_barrierattr_init(&barrierattr);\n if (rc)\n failure_perror(\"pthread_barrierattr_init()\", rc);\n rc = pthread_barrierattr_setpshared(&barrierattr, PTHREAD_PROCESS_SHARED);\n if (rc)\n failure_perror(\"pthread_barrierattr_setpshared()\", rc);\n\n pthread_condattr_t condattr;\n rc = pthread_condattr_init(&condattr);\n if (rc)\n failure_perror(\"pthread_condattr_init()\", rc);\n rc = pthread_condattr_setpshared(&condattr, PTHREAD_PROCESS_SHARED);\n if (rc)\n failure_perror(\"pthread_condattr_setpshared()\", rc);\n\n shared = (shared_t *)mmap(\n nullptr, sizeof(shared_t) + actors.size() * sizeof(pthread_cond_t),\n PROT_READ | PROT_WRITE, MAP_SHARED | MAP_ANONYMOUS, -1, 0);\n if (MAP_FAILED == (void *)shared)\n failure_perror(\"mmap(shared_conds)\", errno);\n\n rc = pthread_mutex_init(&shared->mutex, &mutexattr);\n if (rc)\n failure_perror(\"pthread_mutex_init(shared)\", rc);\n\n rc = pthread_barrier_init(&shared->barrier, &barrierattr, actors.size() + 1);\n if (rc)\n failure_perror(\"pthread_barrier_init(shared)\", rc);\n\n const size_t n = actors.size() + 1;\n for (size_t i = 0; i < n; ++i) {\n pthread_cond_t *event = &shared->conds[i];\n rc = pthread_cond_init(event, &condattr);\n if (rc)\n failure_perror(\"pthread_cond_init(shared)\", rc);\n log_trace(\"osal_setup: event(shared pthread_cond) %\" PRIuPTR \" -> %p\", i,\n event);\n }\n shared->conds_size = actors.size() + 1;\n\n pthread_barrierattr_destroy(&barrierattr);\n pthread_condattr_destroy(&condattr);\n pthread_mutexattr_destroy(&mutexattr);\n}\n\nvoid osal_broadcast(unsigned id) {\n assert(shared != nullptr && shared != MAP_FAILED);\n log_trace(\"osal_broadcast: event %u\", id);\n if (id >= shared->conds_size)\n failure(\"osal_broadcast: id > limit\");\n int rc = pthread_cond_broadcast(shared->conds + id);\n if (rc)\n failure_perror(\"sem_post(shared)\", rc);\n}\n\nint osal_waitfor(unsigned id) {\n assert(shared != nullptr && shared != MAP_FAILED);\n\n log_trace(\"osal_waitfor: event %u\", id);\n if (id >= shared->conds_size)\n failure(\"osal_waitfor: id > limit\");\n\n int rc = pthread_mutex_lock(&shared->mutex);\n if (rc != 0)\n failure_perror(\"pthread_mutex_lock(shared)\", rc);\n\n rc = pthread_cond_wait(shared->conds + id, &shared->mutex);\n if (rc && rc != EINTR)\n failure_perror(\"pthread_cond_wait(shared)\", rc);\n\n rc = pthread_mutex_unlock(&shared->mutex);\n if (rc != 0)\n failure_perror(\"pthread_mutex_unlock(shared)\", rc);\n\n return (rc == 0) ? true : false;\n}\n\n\/\/-----------------------------------------------------------------------------\n\nconst std::string\nactor_config::osal_serialize(simple_checksum &checksum) const {\n (void)checksum;\n \/* not used in workload, but just for testing *\/\n return \"unix.fork\";\n}\n\nbool actor_config::osal_deserialize(const char *str, const char *end,\n simple_checksum &checksum) {\n (void)checksum;\n \/* not used in workload, but just for testing *\/\n return strncmp(str, \"unix.fork\", 9) == 0 && str + 9 == end;\n}\n\n\/\/-----------------------------------------------------------------------------\n\nstatic std::unordered_map<pid_t, actor_status> childs;\n\nstatic void handler_SIGCHLD(int unused) { (void)unused; }\n\nmdbx_pid_t osal_getpid(void) { return getpid(); }\n\nint osal_delay(unsigned seconds) { return sleep(seconds) ? errno : 0; }\n\nint osal_actor_start(const actor_config &config, mdbx_pid_t &pid) {\n if (childs.empty())\n signal(SIGCHLD, handler_SIGCHLD);\n\n pid = fork();\n\n if (pid == 0) {\n const bool result = test_execute(config);\n exit(result ? EXIT_SUCCESS : EXIT_FAILURE);\n }\n\n if (pid < 0)\n return errno;\n\n log_trace(\"osal_actor_start: fork pid %i for %u\", pid, config.actor_id);\n childs[pid] = as_running;\n return 0;\n}\n\nactor_status osal_actor_info(const mdbx_pid_t pid) { return childs.at(pid); }\n\nvoid osal_killall_actors(void) {\n for (auto &pair : childs) {\n kill(pair.first, SIGKILL);\n pair.second = as_killed;\n }\n}\n\nint osal_actor_poll(mdbx_pid_t &pid, unsigned timeout) {\n struct timespec ts;\n ts.tv_nsec = 0;\n ts.tv_sec = timeout;\nretry:\n int status, options = WNOHANG;\n#ifdef WUNTRACED\n options |= WUNTRACED;\n#endif\n#ifdef WCONTINUED\n options |= WCONTINUED;\n#endif\n pid = waitpid(0, &status, options);\n\n if (pid > 0) {\n if (WIFEXITED(status))\n childs[pid] =\n (WEXITSTATUS(status) == EXIT_SUCCESS) ? as_successful : as_failed;\n else if (WIFSIGNALED(status) || WCOREDUMP(status))\n childs[pid] = as_killed;\n else if (WIFSTOPPED(status))\n childs[pid] = as_debuging;\n else if (WIFCONTINUED(status))\n childs[pid] = as_running;\n else {\n assert(false);\n }\n return 0;\n }\n\n if (pid == 0) {\n \/* child still running *\/\n if (ts.tv_sec == 0 && ts.tv_nsec == 0)\n ts.tv_nsec = 1;\n if (nanosleep(&ts, &ts) == 0) {\n \/* timeout and no signal fomr child *\/\n pid = 0;\n return 0;\n }\n if (errno == EINTR)\n goto retry;\n }\n\n switch (errno) {\n case EINTR:\n pid = 0;\n return 0;\n\n case ECHILD:\n default:\n pid = 0;\n return errno;\n }\n}\n\nvoid osal_yield(void) {\n if (sched_yield())\n failure_perror(\"sched_yield()\", errno);\n}\n\nvoid osal_udelay(unsigned us) {\n chrono::time until, now = chrono::now_motonic();\n until.fixedpoint = now.fixedpoint + chrono::from_us(us).fixedpoint;\n struct timespec ts;\n\n static unsigned threshold_us;\n if (threshold_us == 0) {\n if (clock_getres(CLOCK_PROCESS_CPUTIME_ID, &ts)) {\n int rc = errno;\n failure_perror(\"clock_getres(CLOCK_PROCESS_CPUTIME_ID)\", rc);\n }\n chrono::time threshold = chrono::from_timespec(ts);\n assert(threshold.seconds() == 0);\n\n threshold_us = chrono::fractional2us(threshold.fractional);\n if (threshold_us < 1000)\n threshold_us = 1000;\n }\n\n ts.tv_sec = ts.tv_nsec = 0;\n if (us > threshold_us) {\n ts.tv_sec = us \/ 1000000u;\n ts.tv_nsec = (us % 1000000u) * 1000u;\n }\n\n do {\n if (us > threshold_us) {\n if (nanosleep(&ts, &ts)) {\n int rc = errno;\n \/* if (rc == EINTR) { ... } ? *\/\n failure_perror(\"usleep()\", rc);\n }\n us = ts.tv_sec * 1000000u + ts.tv_nsec \/ 1000u;\n }\n cpu_relax();\n\n now = chrono::now_motonic();\n } while (until.fixedpoint > now.fixedpoint);\n}\n\nbool osal_istty(int fd) { return isatty(fd) == 1; }\n\nstd::string osal_tempdir(void) {\n const char *tempdir = getenv(\"TMPDIR\");\n if (!tempdir)\n tempdir = getenv(\"TMP\");\n if (!tempdir)\n tempdir = getenv(\"TEMPDIR\");\n if (!tempdir)\n tempdir = getenv(\"TEMP\");\n if (tempdir) {\n std::string dir(tempdir);\n if (!dir.empty() && dir.at(dir.length() - 1) != '\/')\n dir.append(\"\/\");\n return dir;\n }\n if (access(\"\/dev\/shm\/\", R_OK | W_OK | X_OK) == 0)\n return \"\/dev\/shm\/\";\n return \"\";\n}\n<|endoftext|>"} {"text":"<commit_before><commit_msg>Protect against setting an iterator before begin().<commit_after><|endoftext|>"} {"text":"<commit_before>#include <iostream>\n#include <CL\/cl.hpp>\n#include <string>\n#include <vector>\n\nusing namespace std;\n\nint main (int argc, char* argv[])\n{\n \/\/read input commandline arguments\n for (int i = 1; i < argc; ++i) \n {\n if (std::string(argv[i]) == \"-a\") \n {\n \/\/initialise desired accuracy variable according to commandline argument -a\n \/\/or if no argument is given, set default value\n int accuracy = 90;\n }\n if (std::string(argv[i]) == \"-p\") \n {\n \/\/initialise maximum polygons variable according to commandline argument -p\n \/\/or if no argument is given, set default value\n int polygons = 50;\n }\n if (std::string(argv[i]) == \"-v\") \n {\n \/\/initialise maximum verices per polygon variable according to commandline argument -v\n \/\/or if no argument is given, set default value\n int vertices = 6;\n }\n }\n\n \/\/read specified input image file\n\n \n \/\/initialise variables\n\tclass DNA \n\t{\n\t\tpublic:\n\t\tstring genome;\n int polygons;\n int vertices;\n polygon[polygons];\n\n\t}\n class polygon;\n {\n public:\n int x[vertices];\n int y[vertices];\n int R;\n int G;\n int B;\n int alpha;\n }\n \/\/initialise opencl device\n \/\/get all platforms (drivers)\n std::vector<cl::Platform> all_platforms;\n cl::Platform::get(&all_platforms);\n if(all_platforms.size()==0){\n std::cout<<\" No platforms found. Check OpenCL installation!\\n\";\n exit(1);\n }\n cl::Platform default_platform=all_platforms[0];\n std::cout << \"Using platform: \"<<default_platform.getInfo<CL_PLATFORM_NAME>()<<\"\\n\";\n \n \/\/get default device of the default platform\n std::vector<cl::Device> all_devices;\n default_platform.getDevices(CL_DEVICE_TYPE_ALL, &all_devices);\n if(all_devices.size()==0){\n std::cout<<\" No devices found. Check OpenCL installation!\\n\";\n exit(1);\n }\n cl::Device default_device=all_devices[0];\n std::cout<< \"Using device: \"<<default_device.getInfo<CL_DEVICE_NAME>()<<\"\\n\";\n \n \n cl::Context context({default_device});\n \n cl::Program::Sources sources;\n\n \/\/initialise DNA with a random seed\n leaderDNA = seedDNA();\n \/\/run render loop until desired accuracy is reached\n while (leaderaccuracy<accuracy) \n {\n \/\/mutate from the leaderDNA\n mutatedDNA = mutateDNA(leaderDNA)\n \/\/compute fitness of mutation vs leaderDNA\n \/\/check if it is fitter, if so overwrite leaderDNA\n if (computefitness() == 1)\n {\n \/\/overwrite leaderDNA\n }\n }\n \/\/perform final render, output svg and raster image\n saverender(leaderDNA);\n}\nint computefitnesspercent (DNA, originalimage)\n{\n \/\/compute what % match DNA is to original image\n}\nint computefitness (DNA, originalimage)\n{\n\t\/\/compute the fitness of input DNA, i.e. how close is it to original image?\n\n \/\/read leader dna\n\n \/\/compare input dna to leader dna to find changed polygons\n compareDNA(leaderDNA,DNA);\n \/\/create bounding box containing changed polygons\n\n \/\/render leader dna within bounding box\n leaderrender = renderDNA(leaderDNA,boundx,boundy);\n \/\/render input dna within bounding box\n inputrender = renderDNA(DNA,boundx,boundy);\n \/\/compare leader and input dna rendered bounding boxes\n compareimage(leaderrender,inputrender);\n \/\/returns 1 if input dna is fitter than leader dna, else returns 0\n}\nint seedDNA()\n{\n \/\/create a random seed dna\n}\nint compareDNA(DNA0,DNA1)\n{\n \/\/compare DNA0 to DNA1 to find changed polygons\n}\nint compareimage(image0,image1)\n{\n \/\/compare two raster images, return 1 if image1 fitter than image0, else return 0\n char *img1data, *img2data, fname[15];\n int s, n = 0, y = 0;\n\n sprintf(fname, \"photo%d.bmp\", p - 1);\n cout << \"\\n\" << fname;\n ifstream img1(fname, ios::in|ios::binary|ios::ate);\n sprintf(fname, \"photo%d.bmp\", p);\n cout << \"\\n\" << fname;\n ifstream img2(fname, ios::in|ios::binary|ios::ate);\n\n if (img1.is_open() && img2.is_open())\n {\n s = (int)img1.tellg();\n img1data = new char [s];\n img1.seekg (0, ios::beg);\n img1.read (img1data, s);\n img1.close();\n\n img2data = new char [s];\n img2.seekg (0, ios::beg);\n img2.read (img2data, s);\n img2.close();\n }\n \n for(int i=0; i<s; i++)\n if (img1data[i]==img2data[i]) y++;\n\n return (y);\n}\n\nint renderDNA (shape_t * DNA, cairo_t * cr)\n{\n\t\/\/render input DNA to a raster image and svg\n\n \/\/render to raster image\n cairo_set_source_rgb(cr, 1, 1, 1);\n cairo_rectangle(cr, 0, 0, WIDTH, HEIGHT);\n cairo_fill(cr);\n for(int i = 0; i < NUM_SHAPES; i++)\n draw_shape(dna, cr, i);\n \/\/render to svg\n}\n\nvoid draw_shape(shape_t * dna, cairo_t * cr, int i)\n{\n\t\/\/draw an individual shape within a DNA strand\n cairo_set_line_width(cr, 0);\n shape_t * shape = &dna[i];\n cairo_set_source_rgba(cr, shape->r, shape->g, shape->b, shape->a);\n cairo_move_to(cr, shape->points[0].x, shape->points[0].y);\n for(int j = 1; j < NUM_POINTS; j++)\n cairo_line_to(cr, shape->points[j].x, shape->points[j].y);\n cairo_fill(cr);\n}\n\n}\n\nint mutateDNA (DNA,mutationtype)\n{\n\t\/\/mutate input DNA randomly according to mutation type\n\t mutated_shape = RANDINT(NUM_SHAPES);\n double roulette = RANDDOUBLE(2.8);\n double drastic = RANDDOUBLE(2);\n \n \/\/ mutate color\n if(roulette<1)\n {\n if(dna_test[mutated_shape].a < 0.01 \/\/ completely transparent shapes are stupid\n || roulette<0.25)\n {\n if(drastic < 1)\n {\n dna_test[mutated_shape].a += RANDDOUBLE(0.1);\n dna_test[mutated_shape].a = CLAMP(dna_test[mutated_shape].a, 0.0, 1.0);\n }\n else\n dna_test[mutated_shape].a = RANDDOUBLE(1.0);\n }\n else if(roulette<0.50)\n {\n if(drastic < 1)\n {\n dna_test[mutated_shape].r += RANDDOUBLE(0.1);\n dna_test[mutated_shape].r = CLAMP(dna_test[mutated_shape].r, 0.0, 1.0);\n }\n else\n dna_test[mutated_shape].r = RANDDOUBLE(1.0);\n }\n else if(roulette<0.75)\n {\n if(drastic < 1)\n {\n dna_test[mutated_shape].g += RANDDOUBLE(0.1);\n dna_test[mutated_shape].g = CLAMP(dna_test[mutated_shape].g, 0.0, 1.0);\n }\n else\n dna_test[mutated_shape].g = RANDDOUBLE(1.0);\n }\n else\n {\n if(drastic < 1)\n {\n dna_test[mutated_shape].b += RANDDOUBLE(0.1);\n dna_test[mutated_shape].b = CLAMP(dna_test[mutated_shape].b, 0.0, 1.0);\n }\n else\n dna_test[mutated_shape].b = RANDDOUBLE(1.0);\n }\n }\n \n \/\/ mutate shape\n else if(roulette < 2.0)\n {\n int point_i = RANDINT(NUM_POINTS);\n if(roulette<1.5)\n {\n if(drastic < 1)\n {\n dna_test[mutated_shape].points[point_i].x += (int)RANDDOUBLE(WIDTH\/10.0);\n dna_test[mutated_shape].points[point_i].x = CLAMP(dna_test[mutated_shape].points[point_i].x, 0, WIDTH-1);\n }\n else\n dna_test[mutated_shape].points[point_i].x = RANDDOUBLE(WIDTH);\n }\n else\n {\n if(drastic < 1)\n {\n dna_test[mutated_shape].points[point_i].y += (int)RANDDOUBLE(HEIGHT\/10.0);\n dna_test[mutated_shape].points[point_i].y = CLAMP(dna_test[mutated_shape].points[point_i].y, 0, HEIGHT-1);\n }\n else\n dna_test[mutated_shape].points[point_i].y = RANDDOUBLE(HEIGHT);\n }\n }\n\n \/\/ mutate stacking\n else\n {\n int destination = RANDINT(NUM_SHAPES);\n shape_t s = dna_test[mutated_shape];\n dna_test[mutated_shape] = dna_test[destination];\n dna_test[destination] = s;\n return destination;\n }\n return -1;\n\n}\n}\n\nint saveDNA(DNA)\n{\n\tint result;\n\n\twhile(1)\n\t{\n\t\t\/\/ start by writing a temp file.\n\n\t\tpFile = fopen (\"volution.dna.temp\",\"w\");\n\t\tfprintf (pFile, DNA);\n\t\tfclose (pFile);\n\n\t\t\/\/ Then rename the real backup to a secondary backup.\n \n\t\tresult = rename(\"volution.dna\",\"volution_2.dna\");\n \n\t\t\/\/ Then rename the temp file to the primary backup\n\n\t\tresult = rename(\"volution.dna.temp\",\"volution.dna\");\n \n\t\t\/\/ Then delete the temp file\n \n\t\tresult = remove(\"volution.dna.temp\");\n\n\t\t\/\/sleep for 30 seconds.\n\t\t\n\t\tsleep(30000);\n\t}\n}\n\nint saverender(DNA)\n{\n \/\/render DNA and save resulting image to disk as .svg file and raster image (.png)\n\n \/\/render image from DNA\n renderDNA(DNA);\n \/\/save resultant image to disk as svg and png files\n}\n<commit_msg>fitness function improvements<commit_after>#include <iostream>\n#include <CL\/cl.hpp>\n#include <string>\n#include <vector>\n\nusing namespace std;\n\nint main (int argc, char* argv[])\n{\n \/\/read input commandline arguments\n for (int i = 1; i < argc; ++i) \n {\n if (std::string(argv[i]) == \"-a\") \n {\n \/\/initialise desired accuracy variable according to commandline argument -a\n \/\/or if no argument is given, set default value\n int accuracy = 90;\n }\n if (std::string(argv[i]) == \"-p\") \n {\n \/\/initialise maximum polygons variable according to commandline argument -p\n \/\/or if no argument is given, set default value\n int polygons = 50;\n }\n if (std::string(argv[i]) == \"-v\") \n {\n \/\/initialise maximum verices per polygon variable according to commandline argument -v\n \/\/or if no argument is given, set default value\n int vertices = 6;\n }\n }\n\n \/\/read specified input image file\n\n \n \/\/initialise variables\n\tclass DNA \n\t{\n\t\tpublic:\n\t\tstring genome;\n int polygons;\n int vertices;\n polygon[polygons];\n\n\t}\n class polygon;\n {\n public:\n int x[vertices];\n int y[vertices];\n int R;\n int G;\n int B;\n int alpha;\n }\n \/\/initialise opencl device\n \/\/get all platforms (drivers)\n std::vector<cl::Platform> all_platforms;\n cl::Platform::get(&all_platforms);\n if(all_platforms.size()==0){\n std::cout<<\" No platforms found. Check OpenCL installation!\\n\";\n exit(1);\n }\n cl::Platform default_platform=all_platforms[0];\n std::cout << \"Using platform: \"<<default_platform.getInfo<CL_PLATFORM_NAME>()<<\"\\n\";\n \n \/\/get default device of the default platform\n std::vector<cl::Device> all_devices;\n default_platform.getDevices(CL_DEVICE_TYPE_ALL, &all_devices);\n if(all_devices.size()==0){\n std::cout<<\" No devices found. Check OpenCL installation!\\n\";\n exit(1);\n }\n cl::Device default_device=all_devices[0];\n std::cout<< \"Using device: \"<<default_device.getInfo<CL_DEVICE_NAME>()<<\"\\n\";\n \n \n cl::Context context({default_device});\n \n cl::Program::Sources sources;\n\n \/\/initialise DNA with a random seed\n leaderDNA = seedDNA();\n \/\/run render loop until desired accuracy is reached\n while (leaderaccuracy<accuracy) \n {\n \/\/mutate from the leaderDNA\n mutatedDNA = mutateDNA(leaderDNA)\n \/\/compute fitness of mutation vs leaderDNA\n \/\/check if it is fitter, if so overwrite leaderDNA\n if (computefitness(leaderDNA,mutatedDNA) == 1)\n {\n \/\/overwrite leaderDNA\n leaderDNA = mutatedDNA;\n }\n }\n \/\/perform final render, output svg and raster image\n saverender(leaderDNA);\n}\nint computefitnesspercent (DNA, originalimage)\n{\n \/\/compute what % match DNA is to original image\n}\nint computefitness (DNA0, DNA1)\n{\n\t\/\/compute the fitness of input DNA, i.e. how close is it to original image?\n\n \/\/read leader dna\n\n \/\/compare input dna to leader dna to find changed polygons\n compareDNA(leaderDNA,DNA);\n \/\/create bounding box containing changed polygons\n\n \/\/render leader dna within bounding box\n leaderrender = renderDNA(leaderDNA,boundx,boundy);\n \/\/render input dna within bounding box\n inputrender = renderDNA(DNA,boundx,boundy);\n \/\/compare leader and input dna rendered bounding boxes\n compareimage(leaderrender,inputrender);\n \/\/returns 1 if dna1 is fitter than dna0, else returns 0\n}\nint seedDNA()\n{\n \/\/create a random seed dna\n}\nint compareDNA(DNA0,DNA1)\n{\n \/\/compare DNA0 to DNA1 to find changed polygons\n}\nint compareimage(image0,image1)\n{\n \/\/compare two raster images, return 1 if image1 fitter than image0, else return 0\n char *img1data, *img2data, fname[15];\n int s, n = 0, y = 0;\n\n sprintf(fname, \"photo%d.bmp\", p - 1);\n cout << \"\\n\" << fname;\n ifstream img1(fname, ios::in|ios::binary|ios::ate);\n sprintf(fname, \"photo%d.bmp\", p);\n cout << \"\\n\" << fname;\n ifstream img2(fname, ios::in|ios::binary|ios::ate);\n\n if (img1.is_open() && img2.is_open())\n {\n s = (int)img1.tellg();\n img1data = new char [s];\n img1.seekg (0, ios::beg);\n img1.read (img1data, s);\n img1.close();\n\n img2data = new char [s];\n img2.seekg (0, ios::beg);\n img2.read (img2data, s);\n img2.close();\n }\n \n for(int i=0; i<s; i++)\n if (img1data[i]==img2data[i]) y++;\n\n return (y);\n}\n\nint renderDNA (shape_t * DNA, cairo_t * cr)\n{\n\t\/\/render input DNA to a raster image and svg\n\n \/\/render to raster image\n cairo_set_source_rgb(cr, 1, 1, 1);\n cairo_rectangle(cr, 0, 0, WIDTH, HEIGHT);\n cairo_fill(cr);\n for(int i = 0; i < NUM_SHAPES; i++)\n draw_shape(dna, cr, i);\n \/\/render to svg\n}\n\nvoid draw_shape(shape_t * dna, cairo_t * cr, int i)\n{\n\t\/\/draw an individual shape within a DNA strand\n cairo_set_line_width(cr, 0);\n shape_t * shape = &dna[i];\n cairo_set_source_rgba(cr, shape->r, shape->g, shape->b, shape->a);\n cairo_move_to(cr, shape->points[0].x, shape->points[0].y);\n for(int j = 1; j < NUM_POINTS; j++)\n cairo_line_to(cr, shape->points[j].x, shape->points[j].y);\n cairo_fill(cr);\n}\n\n}\n\nint mutateDNA (DNA,mutationtype)\n{\n\t\/\/mutate input DNA randomly according to mutation type\n\t mutated_shape = RANDINT(NUM_SHAPES);\n double roulette = RANDDOUBLE(2.8);\n double drastic = RANDDOUBLE(2);\n \n \/\/ mutate color\n if(roulette<1)\n {\n if(dna_test[mutated_shape].a < 0.01 \/\/ completely transparent shapes are stupid\n || roulette<0.25)\n {\n if(drastic < 1)\n {\n dna_test[mutated_shape].a += RANDDOUBLE(0.1);\n dna_test[mutated_shape].a = CLAMP(dna_test[mutated_shape].a, 0.0, 1.0);\n }\n else\n dna_test[mutated_shape].a = RANDDOUBLE(1.0);\n }\n else if(roulette<0.50)\n {\n if(drastic < 1)\n {\n dna_test[mutated_shape].r += RANDDOUBLE(0.1);\n dna_test[mutated_shape].r = CLAMP(dna_test[mutated_shape].r, 0.0, 1.0);\n }\n else\n dna_test[mutated_shape].r = RANDDOUBLE(1.0);\n }\n else if(roulette<0.75)\n {\n if(drastic < 1)\n {\n dna_test[mutated_shape].g += RANDDOUBLE(0.1);\n dna_test[mutated_shape].g = CLAMP(dna_test[mutated_shape].g, 0.0, 1.0);\n }\n else\n dna_test[mutated_shape].g = RANDDOUBLE(1.0);\n }\n else\n {\n if(drastic < 1)\n {\n dna_test[mutated_shape].b += RANDDOUBLE(0.1);\n dna_test[mutated_shape].b = CLAMP(dna_test[mutated_shape].b, 0.0, 1.0);\n }\n else\n dna_test[mutated_shape].b = RANDDOUBLE(1.0);\n }\n }\n \n \/\/ mutate shape\n else if(roulette < 2.0)\n {\n int point_i = RANDINT(NUM_POINTS);\n if(roulette<1.5)\n {\n if(drastic < 1)\n {\n dna_test[mutated_shape].points[point_i].x += (int)RANDDOUBLE(WIDTH\/10.0);\n dna_test[mutated_shape].points[point_i].x = CLAMP(dna_test[mutated_shape].points[point_i].x, 0, WIDTH-1);\n }\n else\n dna_test[mutated_shape].points[point_i].x = RANDDOUBLE(WIDTH);\n }\n else\n {\n if(drastic < 1)\n {\n dna_test[mutated_shape].points[point_i].y += (int)RANDDOUBLE(HEIGHT\/10.0);\n dna_test[mutated_shape].points[point_i].y = CLAMP(dna_test[mutated_shape].points[point_i].y, 0, HEIGHT-1);\n }\n else\n dna_test[mutated_shape].points[point_i].y = RANDDOUBLE(HEIGHT);\n }\n }\n\n \/\/ mutate stacking\n else\n {\n int destination = RANDINT(NUM_SHAPES);\n shape_t s = dna_test[mutated_shape];\n dna_test[mutated_shape] = dna_test[destination];\n dna_test[destination] = s;\n return destination;\n }\n return -1;\n\n}\n}\n\nint saveDNA(DNA)\n{\n\tint result;\n\n\twhile(1)\n\t{\n\t\t\/\/ start by writing a temp file.\n\n\t\tpFile = fopen (\"volution.dna.temp\",\"w\");\n\t\tfprintf (pFile, DNA);\n\t\tfclose (pFile);\n\n\t\t\/\/ Then rename the real backup to a secondary backup.\n \n\t\tresult = rename(\"volution.dna\",\"volution_2.dna\");\n \n\t\t\/\/ Then rename the temp file to the primary backup\n\n\t\tresult = rename(\"volution.dna.temp\",\"volution.dna\");\n \n\t\t\/\/ Then delete the temp file\n \n\t\tresult = remove(\"volution.dna.temp\");\n\n\t\t\/\/sleep for 30 seconds.\n\t\t\n\t\tsleep(30000);\n\t}\n}\n\nint saverender(DNA)\n{\n \/\/render DNA and save resulting image to disk as .svg file and raster image (.png)\n\n \/\/render image from DNA\n renderDNA(DNA);\n \/\/save resultant image to disk as svg and png files\n}\n<|endoftext|>"} {"text":"<commit_before>\/*\n * Copyright (c) 2004 Stephen Williams (steve@icarus.com)\n *\n * This source code is free software; you can redistribute it\n * and\/or modify it in source code form under the terms of the GNU\n * General Public License as published by the Free Software\n * 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,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the\n * 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#ifdef HAVE_CVS_IDENT\n#ident \"$Id: event.cc,v 1.20 2005\/06\/22 00:04:49 steve Exp $\"\n#endif\n\n# include \"event.h\"\n# include \"compile.h\"\n# include \"vthread.h\"\n# include \"schedule.h\"\n# include \"vpi_priv.h\"\n\n# include <string.h>\n# include <assert.h>\n# include <stdlib.h>\n#ifdef HAVE_MALLOC_H\n# include <malloc.h>\n#endif\n\nvoid waitable_hooks_s::run_waiting_threads_()\n{\n if (threads == 0)\n\t return;\n\n vthread_t tmp = threads;\n threads = 0;\n vthread_schedule_list(tmp);\n}\n\ninline vvp_fun_edge::edge_t VVP_EDGE(vvp_bit4_t from, vvp_bit4_t to)\n{\n return 1 << ((from << 2) | to);\n}\n\nconst vvp_fun_edge::edge_t vvp_edge_posedge\n = VVP_EDGE(BIT4_0,BIT4_1)\n | VVP_EDGE(BIT4_0,BIT4_X)\n | VVP_EDGE(BIT4_0,BIT4_Z)\n | VVP_EDGE(BIT4_X,BIT4_1)\n | VVP_EDGE(BIT4_Z,BIT4_1)\n ;\n\nconst vvp_fun_edge::edge_t vvp_edge_negedge\n = VVP_EDGE(BIT4_1,BIT4_0)\n | VVP_EDGE(BIT4_1,BIT4_X)\n | VVP_EDGE(BIT4_1,BIT4_Z)\n | VVP_EDGE(BIT4_X,BIT4_0)\n | VVP_EDGE(BIT4_Z,BIT4_0)\n ;\n\nconst vvp_fun_edge::edge_t vvp_edge_none = 0;\n\nvvp_fun_edge::vvp_fun_edge(edge_t e)\n: edge_(e)\n{\n bits_[0] = BIT4_X;\n bits_[1] = BIT4_X;\n bits_[2] = BIT4_X;\n bits_[3] = BIT4_X;\n}\n\nvvp_fun_edge::~vvp_fun_edge()\n{\n}\n\nvoid vvp_fun_edge::recv_vec4(vvp_net_ptr_t port, const vvp_vector4_t&bit)\n{\n\t\/* See what kind of edge this represents. *\/\n edge_t mask = VVP_EDGE(bits_[port.port()], bit.value(0));\n\n\t\/* Save the current input for the next time around. *\/\n bits_[port.port()] = bit.value(0);\n\n if ((edge_ == vvp_edge_none) || (edge_ & mask)) {\n\t run_waiting_threads_();\n\n\t vvp_net_t*net = port.ptr();\n\t vvp_send_vec4(net->out, bit);\n }\n}\n\n\nvvp_fun_anyedge::vvp_fun_anyedge()\n{\n}\n\nvvp_fun_anyedge::~vvp_fun_anyedge()\n{\n}\n\nvoid vvp_fun_anyedge::recv_vec4(vvp_net_ptr_t port, const vvp_vector4_t&bit)\n{\n unsigned pdx = port.port();\n bool flag = false;\n\n if (bits_[pdx].size() != bit.size()) {\n\t flag = true;\n\n } else {\n\t for (unsigned idx = 0 ; idx < bit.size() ; idx += 1) {\n\t\t if (bits_[pdx].value(idx) != bit.value(idx)) {\n\t\t\tflag = true;\n\t\t\tbreak;\n\t\t }\n\t }\n }\n\n if (flag) {\n\t bits_[pdx] = bit;\n\t run_waiting_threads_();\n\t vvp_net_t*net = port.ptr();\n\t vvp_send_vec4(net->out, bit);\n }\n}\n\nvvp_fun_event_or::vvp_fun_event_or()\n{\n}\n\nvvp_fun_event_or::~vvp_fun_event_or()\n{\n}\n\nvoid vvp_fun_event_or::recv_vec4(vvp_net_ptr_t port, const vvp_vector4_t&bit)\n{\n run_waiting_threads_();\n vvp_net_t*net = port.ptr();\n vvp_send_vec4(net->out, bit);\n}\n\nvvp_named_event::vvp_named_event(struct __vpiHandle*h)\n{\n handle_ = h;\n}\n\nvvp_named_event::~vvp_named_event()\n{\n}\n\nvoid vvp_named_event::recv_vec4(vvp_net_ptr_t port, const vvp_vector4_t&bit)\n{\n run_waiting_threads_();\n vvp_net_t*net = port.ptr();\n vvp_send_vec4(net->out, bit);\n}\n\n\/*\n** Create an event functor\n** edge: compile_event(label, type, argc, argv)\n** or: compile_event(label, NULL, argc, argv)\n**\n** Named events are handled elsewhere.\n*\/\n\nstatic void compile_event_or(char*label, unsigned argc, struct symb_s*argv);\n\nvoid compile_event(char*label, char*type,\n\t\t unsigned argc, struct symb_s*argv)\n{\n vvp_net_fun_t*fun = 0;\n\n if (type == 0) {\n\t compile_event_or(label, argc, argv);\n\t return;\n }\n\n if (strcmp(type,\"edge\") == 0) {\n\n\t free(type);\n\t fun = new vvp_fun_anyedge;\n\n } else {\n\n\t vvp_fun_edge::edge_t edge = vvp_edge_none;\n\n\t if (strcmp(type,\"posedge\") == 0)\n\t\t edge = vvp_edge_posedge;\n\t else if (strcmp(type,\"negedge\") == 0)\n\t\t edge = vvp_edge_negedge;\n\n\t assert(argc <= 4);\n\t free(type);\n\n\t fun = new vvp_fun_edge(edge);\n }\n\n vvp_net_t* ptr = new vvp_net_t;\n ptr->fun = fun;\n\n define_functor_symbol(label, ptr);\n free(label);\n\n inputs_connect(ptr, argc, argv);\n}\n\nstatic void compile_event_or(char*label, unsigned argc, struct symb_s*argv)\n{\n vvp_net_fun_t*fun = new vvp_fun_event_or;\n vvp_net_t* ptr = new vvp_net_t;\n ptr->fun = fun;\n\n define_functor_symbol(label, ptr);\n free(label);\n\n\t\/* This is a very special case. Point all the source inputs to\n\t the same input. It doesn't matter that the streams get\n\t tangled because data values are irrelevant. *\/\n for (unsigned idx = 0 ; idx < argc ; idx += 1) {\n\t input_connect(ptr, 0, argv[idx].text);\n }\n}\n\n\/*\n * This handles the compile of named events. This functor has no\n * inputs, it is only accessed by behavioral trigger statements, which\n * in vvp are %set instructions.\n *\/\nvoid compile_named_event(char*label, char*name)\n{\n vvp_net_t*ptr = new vvp_net_t;\n\n vpiHandle obj = vpip_make_named_event(name, ptr);\n ptr->fun = new vvp_named_event(obj);\n\n define_functor_symbol(label, ptr);\n compile_vpi_symbol(label, obj);\n vpip_attach_to_current_scope(obj);\n\n free(label);\n free(name);\n}\n\n\/*\n * $Log: event.cc,v $\n * Revision 1.20 2005\/06\/22 00:04:49 steve\n * Reduce vvp_vector4 copies by using const references.\n *\n * Revision 1.19 2005\/06\/17 23:47:02 steve\n * threads member for waitable_hook_s needs initailizing.\n *\n * Revision 1.18 2005\/05\/25 05:44:51 steve\n * Handle event\/or with specific, efficient nodes.\n *\n * Revision 1.17 2004\/12\/29 23:45:13 steve\n * Add the part concatenation node (.concat).\n *\n * Add a vvp_event_anyedge class to handle the special\n * case of .event statements of edge type. This also\n * frees the posedge\/negedge types to handle all 4 inputs.\n *\n * Implement table functor recv_vec4 method to receive\n * and process vectors.\n *\n * Revision 1.16 2004\/12\/18 18:52:44 steve\n * Rework named events and event\/or.\n *\n * Revision 1.15 2004\/12\/11 02:31:29 steve\n * Rework of internals to carry vectors through nexus instead\n * of single bits. Make the ivl, tgt-vvp and vvp initial changes\n * down this path.\n *\n *\/\n<commit_msg> Callbacks for named event triggers.<commit_after>\/*\n * Copyright (c) 2004 Stephen Williams (steve@icarus.com)\n *\n * This source code is free software; you can redistribute it\n * and\/or modify it in source code form under the terms of the GNU\n * General Public License as published by the Free Software\n * 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,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the\n * 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#ifdef HAVE_CVS_IDENT\n#ident \"$Id: event.cc,v 1.21 2006\/02\/21 04:57:26 steve Exp $\"\n#endif\n\n# include \"event.h\"\n# include \"compile.h\"\n# include \"vthread.h\"\n# include \"schedule.h\"\n# include \"vpi_priv.h\"\n\n# include <string.h>\n# include <assert.h>\n# include <stdlib.h>\n#ifdef HAVE_MALLOC_H\n# include <malloc.h>\n#endif\n\nvoid waitable_hooks_s::run_waiting_threads_()\n{\n if (threads == 0)\n\t return;\n\n vthread_t tmp = threads;\n threads = 0;\n vthread_schedule_list(tmp);\n}\n\ninline vvp_fun_edge::edge_t VVP_EDGE(vvp_bit4_t from, vvp_bit4_t to)\n{\n return 1 << ((from << 2) | to);\n}\n\nconst vvp_fun_edge::edge_t vvp_edge_posedge\n = VVP_EDGE(BIT4_0,BIT4_1)\n | VVP_EDGE(BIT4_0,BIT4_X)\n | VVP_EDGE(BIT4_0,BIT4_Z)\n | VVP_EDGE(BIT4_X,BIT4_1)\n | VVP_EDGE(BIT4_Z,BIT4_1)\n ;\n\nconst vvp_fun_edge::edge_t vvp_edge_negedge\n = VVP_EDGE(BIT4_1,BIT4_0)\n | VVP_EDGE(BIT4_1,BIT4_X)\n | VVP_EDGE(BIT4_1,BIT4_Z)\n | VVP_EDGE(BIT4_X,BIT4_0)\n | VVP_EDGE(BIT4_Z,BIT4_0)\n ;\n\nconst vvp_fun_edge::edge_t vvp_edge_none = 0;\n\nvvp_fun_edge::vvp_fun_edge(edge_t e)\n: edge_(e)\n{\n bits_[0] = BIT4_X;\n bits_[1] = BIT4_X;\n bits_[2] = BIT4_X;\n bits_[3] = BIT4_X;\n}\n\nvvp_fun_edge::~vvp_fun_edge()\n{\n}\n\nvoid vvp_fun_edge::recv_vec4(vvp_net_ptr_t port, const vvp_vector4_t&bit)\n{\n\t\/* See what kind of edge this represents. *\/\n edge_t mask = VVP_EDGE(bits_[port.port()], bit.value(0));\n\n\t\/* Save the current input for the next time around. *\/\n bits_[port.port()] = bit.value(0);\n\n if ((edge_ == vvp_edge_none) || (edge_ & mask)) {\n\t run_waiting_threads_();\n\n\t vvp_net_t*net = port.ptr();\n\t vvp_send_vec4(net->out, bit);\n }\n}\n\n\nvvp_fun_anyedge::vvp_fun_anyedge()\n{\n}\n\nvvp_fun_anyedge::~vvp_fun_anyedge()\n{\n}\n\nvoid vvp_fun_anyedge::recv_vec4(vvp_net_ptr_t port, const vvp_vector4_t&bit)\n{\n unsigned pdx = port.port();\n bool flag = false;\n\n if (bits_[pdx].size() != bit.size()) {\n\t flag = true;\n\n } else {\n\t for (unsigned idx = 0 ; idx < bit.size() ; idx += 1) {\n\t\t if (bits_[pdx].value(idx) != bit.value(idx)) {\n\t\t\tflag = true;\n\t\t\tbreak;\n\t\t }\n\t }\n }\n\n if (flag) {\n\t bits_[pdx] = bit;\n\t run_waiting_threads_();\n\t vvp_net_t*net = port.ptr();\n\t vvp_send_vec4(net->out, bit);\n }\n}\n\nvvp_fun_event_or::vvp_fun_event_or()\n{\n}\n\nvvp_fun_event_or::~vvp_fun_event_or()\n{\n}\n\nvoid vvp_fun_event_or::recv_vec4(vvp_net_ptr_t port, const vvp_vector4_t&bit)\n{\n run_waiting_threads_();\n vvp_net_t*net = port.ptr();\n vvp_send_vec4(net->out, bit);\n}\n\nvvp_named_event::vvp_named_event(struct __vpiHandle*h)\n{\n handle_ = h;\n}\n\nvvp_named_event::~vvp_named_event()\n{\n}\n\nvoid vvp_named_event::recv_vec4(vvp_net_ptr_t port, const vvp_vector4_t&bit)\n{\n run_waiting_threads_();\n vvp_net_t*net = port.ptr();\n vvp_send_vec4(net->out, bit);\n\n vpip_run_named_event_callbacks(handle_);\n}\n\n\/*\n** Create an event functor\n** edge: compile_event(label, type, argc, argv)\n** or: compile_event(label, NULL, argc, argv)\n**\n** Named events are handled elsewhere.\n*\/\n\nstatic void compile_event_or(char*label, unsigned argc, struct symb_s*argv);\n\nvoid compile_event(char*label, char*type,\n\t\t unsigned argc, struct symb_s*argv)\n{\n vvp_net_fun_t*fun = 0;\n\n if (type == 0) {\n\t compile_event_or(label, argc, argv);\n\t return;\n }\n\n if (strcmp(type,\"edge\") == 0) {\n\n\t free(type);\n\t fun = new vvp_fun_anyedge;\n\n } else {\n\n\t vvp_fun_edge::edge_t edge = vvp_edge_none;\n\n\t if (strcmp(type,\"posedge\") == 0)\n\t\t edge = vvp_edge_posedge;\n\t else if (strcmp(type,\"negedge\") == 0)\n\t\t edge = vvp_edge_negedge;\n\n\t assert(argc <= 4);\n\t free(type);\n\n\t fun = new vvp_fun_edge(edge);\n }\n\n vvp_net_t* ptr = new vvp_net_t;\n ptr->fun = fun;\n\n define_functor_symbol(label, ptr);\n free(label);\n\n inputs_connect(ptr, argc, argv);\n}\n\nstatic void compile_event_or(char*label, unsigned argc, struct symb_s*argv)\n{\n vvp_net_fun_t*fun = new vvp_fun_event_or;\n vvp_net_t* ptr = new vvp_net_t;\n ptr->fun = fun;\n\n define_functor_symbol(label, ptr);\n free(label);\n\n\t\/* This is a very special case. Point all the source inputs to\n\t the same input. It doesn't matter that the streams get\n\t tangled because data values are irrelevant. *\/\n for (unsigned idx = 0 ; idx < argc ; idx += 1) {\n\t input_connect(ptr, 0, argv[idx].text);\n }\n}\n\n\/*\n * This handles the compile of named events. This functor has no\n * inputs, it is only accessed by behavioral trigger statements, which\n * in vvp are %set instructions.\n *\/\nvoid compile_named_event(char*label, char*name)\n{\n vvp_net_t*ptr = new vvp_net_t;\n\n vpiHandle obj = vpip_make_named_event(name, ptr);\n ptr->fun = new vvp_named_event(obj);\n\n define_functor_symbol(label, ptr);\n compile_vpi_symbol(label, obj);\n vpip_attach_to_current_scope(obj);\n\n free(label);\n free(name);\n}\n\n\/*\n * $Log: event.cc,v $\n * Revision 1.21 2006\/02\/21 04:57:26 steve\n * Callbacks for named event triggers.\n *\n * Revision 1.20 2005\/06\/22 00:04:49 steve\n * Reduce vvp_vector4 copies by using const references.\n *\n * Revision 1.19 2005\/06\/17 23:47:02 steve\n * threads member for waitable_hook_s needs initailizing.\n *\n * Revision 1.18 2005\/05\/25 05:44:51 steve\n * Handle event\/or with specific, efficient nodes.\n *\n * Revision 1.17 2004\/12\/29 23:45:13 steve\n * Add the part concatenation node (.concat).\n *\n * Add a vvp_event_anyedge class to handle the special\n * case of .event statements of edge type. This also\n * frees the posedge\/negedge types to handle all 4 inputs.\n *\n * Implement table functor recv_vec4 method to receive\n * and process vectors.\n *\n * Revision 1.16 2004\/12\/18 18:52:44 steve\n * Rework named events and event\/or.\n *\n * Revision 1.15 2004\/12\/11 02:31:29 steve\n * Rework of internals to carry vectors through nexus instead\n * of single bits. Make the ivl, tgt-vvp and vvp initial changes\n * down this path.\n *\n *\/\n<|endoftext|>"} {"text":"<commit_before>\/**\n * Clever programming language\n * Copyright (c) Clever Team\n *\n * This file is distributed under the MIT license. See LICENSE for details.\n *\/\n\n#include <iostream>\n#include \"core\/driver.h\"\n#include \"core\/modmanager.h\"\n#include \"core\/value.h\"\n#include \"core\/cstring.h\"\n#include \"core\/scope.h\"\n#include \"modules\/std\/std_pkg.h\"\n#include \"modules\/db\/db_pkg.h\"\n#include \"core\/user.h\"\n\nnamespace clever {\n\n\/\/\/ Adds the available packages to be imported\nvoid ModManager::init()\n{\n\taddModule(\"std\", new modules::Std);\n\taddModule(\"db\",\t new modules::Db);\n\taddModule(\"_user\", m_user = new UserModule);\n}\n\n\/\/\/ Performs shutdown operation\nvoid ModManager::shutdown()\n{\n\tstd::vector<Type*> typevec;\n\tModuleMap::const_iterator itm = m_mods.begin(), endm = m_mods.end();\n\n\twhile (itm != endm) {\n\t\tTypeMap& types = itm->second->getTypes();\n\t\tTypeMap::const_iterator itt(types.begin()), ite(types.end());\n\n\t\twhile (itt != ite) {\n\t\t\titt->second->deallocMembers();\n\t\t\ttypevec.push_back(itt->second);\n\t\t\t++itt;\n\t\t}\n\n\t\tclever_delete(itm->second);\n\t\t++itm;\n\t}\n\n\tstd::for_each(typevec.begin(), typevec.end(), clever_delete<Type>);\n}\n\n\/\/\/ Adds a new module\nvoid ModManager::addModule(const std::string& name, Module* module)\n{\n\tif (m_mods.find(name) != m_mods.end()) {\n\t\t\/\/std::cerr << \"Module `\" << name << \"' already added!\" << std::endl;\n\t\treturn;\n\t}\n\n\tm_mods.insert(ModulePair(name, module));\n\tmodule->init();\n\tmodule->setLoaded();\n\n\t\/\/std::cout << \"init \" << module->getName() << std::endl;\n\n\tif (module->hasModules()) {\n\t\tModuleMap& mods = module->getModules();\n\t\tModuleMap::const_iterator it = mods.begin(), end = mods.end();\n\n\t\twhile (it != end) {\n\t\t\t\/\/ @TODO(Felipe): recursivity\n\t\t\tm_mods.insert(ModulePair(it->first, it->second));\n\t\t\t++it;\n\t\t}\n\t}\n}\n\n\/\/\/ Loads an specific module type\nvoid ModManager::loadType(Scope* scope, Environment* env, const std::string& name,\n\tType* type) const\n{\n\tValue* tmp = new Value(type);\n\n\tscope->pushValue(CSTRING(name), tmp)->voffset = env->pushValue(tmp);\n\n\ttype->init();\n}\n\n\/\/\/ Loads an specific module function\nvoid ModManager::loadFunction(Scope* scope, Environment* env, const CString* name,\n\tFunction* func) const\n{\n\tValue* fval = new Value();\n\n\tfval->setObj(CLEVER_FUNC_TYPE, func);\n\n\tscope->pushValue(name, fval)->voffset = env->pushValue(fval);\n}\n\n\/\/\/ Loads a module if it is not already loaded\nvoid ModManager::loadModule(Scope* scope, Environment* env, Module* module,\n\tImportKind kind, const CString* name) const\n{\n\tif (kind == ModManager::ALL && module->hasModules()) {\n\t\tModuleMap& mods = module->getModules();\n\t\tModuleMap::const_iterator it = mods.begin(), end = mods.end();\n\n\t\twhile (it != end) {\n\t\t\tloadModule(scope, env, it->second, kind, NULL);\n\t\t\t++it;\n\t\t}\n\t}\n\n\tif (module->isLoaded()) {\n\t\treturn;\n\t}\n\n\tmodule->init();\n\tmodule->setLoaded();\n\n\t\/\/std::cout << \"load \" << module->getName() << std::endl;\n\n\tif (kind & ModManager::FUNCTION) {\n\t\tFunctionMap& funcs = module->getFunctions();\n\n\t\tif (name) {\n\t\t\tFunctionMap::const_iterator it = funcs.find(name);\n\n\t\t\tif (it == funcs.end()) {\n\t\t\t\tstd::cerr << \"Function `\" << *name << \"' not found!\" << std::endl;\n\t\t\t} else {\n\t\t\t\tloadFunction(scope, env, it->first, it->second);\n\t\t\t}\n\t\t} else {\n\t\t\tFunctionMap::const_iterator itf(funcs.begin()),\tendf(funcs.end());\n\n\t\t\twhile (EXPECTED(itf != endf)) {\n\t\t\t\tloadFunction(scope, env, itf->first, itf->second);\n\t\t\t\t++itf;\n\t\t\t}\n\t\t}\n\t}\n\n\tif (kind & ModManager::TYPE) {\n\t\tTypeMap& types = module->getTypes();\n\n\t\tif (name) {\n\t\t\tTypeMap::const_iterator it = types.find(*name);\n\n\t\t\tif (it == types.end()) {\n\t\t\t\tstd::cerr << \"Type `\" << *name << \"' not found!\" << std::endl;\n\t\t\t} else {\n\t\t\t\tloadType(scope, env, it->first, it->second);\n\t\t\t}\n\t\t} else {\n\t\t\tTypeMap::const_iterator itt(types.begin()), ite(types.end());\n\n\t\t\twhile (EXPECTED(itt != ite)) {\n\t\t\t\tloadType(scope, env, itt->first, itt->second);\n\t\t\t\t++itt;\n\t\t\t}\n\t\t}\n\t}\n}\n\n\/\/\/ Imports an userland module\nast::Node* ModManager::importFile(Scope* scope, Environment* env,\n\tconst std::string& module, ImportKind kind, const CString* name) const\n{\n\tstd::string mod_name = module;\n\n\tstd::replace(mod_name.begin(), mod_name.end(), '.', '\/');\n\n\tconst std::string& fname = m_include_path + mod_name + \".clv\";\n\n\tif (!m_driver->loadFile(fname)) {\n\t\treturn m_driver->getCompiler().getAST();\n\t}\n\n\treturn NULL;\n}\n\n\/\/\/ Imports a module\nast::Node* ModManager::importModule(Scope* scope, Environment* env,\n\tconst std::string& module, ImportKind kind, const CString* name) const\n{\n\tModuleMap::const_iterator it = m_mods.find(module);\n\n\t\/\/std::cout << \"imp \" << module << std::endl;\n\n\tif (it == m_mods.end()) {\n\t\tast::Node* tree;\n\n\t\tif ((tree = importFile(scope, env, module, kind, name)) == NULL) {\n\t\t\tstd::cerr << \"Module `\" << module << \"' not found!\" << std::endl;\n\t\t\treturn NULL;\n\t\t}\n\t\treturn tree;\n\t}\n\n\tloadModule(scope, env, it->second, kind, name);\n\n\treturn NULL;\n}\n\n} \/\/ clever\n<commit_msg>- Make function related Values constant<commit_after>\/**\n * Clever programming language\n * Copyright (c) Clever Team\n *\n * This file is distributed under the MIT license. See LICENSE for details.\n *\/\n\n#include <iostream>\n#include \"core\/driver.h\"\n#include \"core\/modmanager.h\"\n#include \"core\/value.h\"\n#include \"core\/cstring.h\"\n#include \"core\/scope.h\"\n#include \"modules\/std\/std_pkg.h\"\n#include \"modules\/db\/db_pkg.h\"\n#include \"core\/user.h\"\n\nnamespace clever {\n\n\/\/\/ Adds the available packages to be imported\nvoid ModManager::init()\n{\n\taddModule(\"std\", new modules::Std);\n\taddModule(\"db\",\t new modules::Db);\n\taddModule(\"_user\", m_user = new UserModule);\n}\n\n\/\/\/ Performs shutdown operation\nvoid ModManager::shutdown()\n{\n\tstd::vector<Type*> typevec;\n\tModuleMap::const_iterator itm = m_mods.begin(), endm = m_mods.end();\n\n\twhile (itm != endm) {\n\t\tTypeMap& types = itm->second->getTypes();\n\t\tTypeMap::const_iterator itt(types.begin()), ite(types.end());\n\n\t\twhile (itt != ite) {\n\t\t\titt->second->deallocMembers();\n\t\t\ttypevec.push_back(itt->second);\n\t\t\t++itt;\n\t\t}\n\n\t\tclever_delete(itm->second);\n\t\t++itm;\n\t}\n\n\tstd::for_each(typevec.begin(), typevec.end(), clever_delete<Type>);\n}\n\n\/\/\/ Adds a new module\nvoid ModManager::addModule(const std::string& name, Module* module)\n{\n\tif (m_mods.find(name) != m_mods.end()) {\n\t\t\/\/std::cerr << \"Module `\" << name << \"' already added!\" << std::endl;\n\t\treturn;\n\t}\n\n\tm_mods.insert(ModulePair(name, module));\n\tmodule->init();\n\tmodule->setLoaded();\n\n\t\/\/std::cout << \"init \" << module->getName() << std::endl;\n\n\tif (module->hasModules()) {\n\t\tModuleMap& mods = module->getModules();\n\t\tModuleMap::const_iterator it = mods.begin(), end = mods.end();\n\n\t\twhile (it != end) {\n\t\t\t\/\/ @TODO(Felipe): recursivity\n\t\t\tm_mods.insert(ModulePair(it->first, it->second));\n\t\t\t++it;\n\t\t}\n\t}\n}\n\n\/\/\/ Loads an specific module type\nvoid ModManager::loadType(Scope* scope, Environment* env, const std::string& name,\n\tType* type) const\n{\n\tValue* tmp = new Value(type);\n\n\tscope->pushValue(CSTRING(name), tmp)->voffset = env->pushValue(tmp);\n\n\ttype->init();\n}\n\n\/\/\/ Loads an specific module function\nvoid ModManager::loadFunction(Scope* scope, Environment* env, const CString* name,\n\tFunction* func) const\n{\n\tValue* fval = new Value();\n\n\tfval->setObj(CLEVER_FUNC_TYPE, func);\n\tfval->setConst(true);\n\n\tscope->pushValue(name, fval)->voffset = env->pushValue(fval);\n}\n\n\/\/\/ Loads a module if it is not already loaded\nvoid ModManager::loadModule(Scope* scope, Environment* env, Module* module,\n\tImportKind kind, const CString* name) const\n{\n\tif (kind == ModManager::ALL && module->hasModules()) {\n\t\tModuleMap& mods = module->getModules();\n\t\tModuleMap::const_iterator it = mods.begin(), end = mods.end();\n\n\t\twhile (it != end) {\n\t\t\tloadModule(scope, env, it->second, kind, NULL);\n\t\t\t++it;\n\t\t}\n\t}\n\n\tif (module->isLoaded()) {\n\t\treturn;\n\t}\n\n\tmodule->init();\n\tmodule->setLoaded();\n\n\t\/\/std::cout << \"load \" << module->getName() << std::endl;\n\n\tif (kind & ModManager::FUNCTION) {\n\t\tFunctionMap& funcs = module->getFunctions();\n\n\t\tif (name) {\n\t\t\tFunctionMap::const_iterator it = funcs.find(name);\n\n\t\t\tif (it == funcs.end()) {\n\t\t\t\tstd::cerr << \"Function `\" << *name << \"' not found!\" << std::endl;\n\t\t\t} else {\n\t\t\t\tloadFunction(scope, env, it->first, it->second);\n\t\t\t}\n\t\t} else {\n\t\t\tFunctionMap::const_iterator itf(funcs.begin()),\tendf(funcs.end());\n\n\t\t\twhile (EXPECTED(itf != endf)) {\n\t\t\t\tloadFunction(scope, env, itf->first, itf->second);\n\t\t\t\t++itf;\n\t\t\t}\n\t\t}\n\t}\n\n\tif (kind & ModManager::TYPE) {\n\t\tTypeMap& types = module->getTypes();\n\n\t\tif (name) {\n\t\t\tTypeMap::const_iterator it = types.find(*name);\n\n\t\t\tif (it == types.end()) {\n\t\t\t\tstd::cerr << \"Type `\" << *name << \"' not found!\" << std::endl;\n\t\t\t} else {\n\t\t\t\tloadType(scope, env, it->first, it->second);\n\t\t\t}\n\t\t} else {\n\t\t\tTypeMap::const_iterator itt(types.begin()), ite(types.end());\n\n\t\t\twhile (EXPECTED(itt != ite)) {\n\t\t\t\tloadType(scope, env, itt->first, itt->second);\n\t\t\t\t++itt;\n\t\t\t}\n\t\t}\n\t}\n}\n\n\/\/\/ Imports an userland module\nast::Node* ModManager::importFile(Scope* scope, Environment* env,\n\tconst std::string& module, ImportKind kind, const CString* name) const\n{\n\tstd::string mod_name = module;\n\n\tstd::replace(mod_name.begin(), mod_name.end(), '.', '\/');\n\n\tconst std::string& fname = m_include_path + mod_name + \".clv\";\n\n\tif (!m_driver->loadFile(fname)) {\n\t\treturn m_driver->getCompiler().getAST();\n\t}\n\n\treturn NULL;\n}\n\n\/\/\/ Imports a module\nast::Node* ModManager::importModule(Scope* scope, Environment* env,\n\tconst std::string& module, ImportKind kind, const CString* name) const\n{\n\tModuleMap::const_iterator it = m_mods.find(module);\n\n\t\/\/std::cout << \"imp \" << module << std::endl;\n\n\tif (it == m_mods.end()) {\n\t\tast::Node* tree;\n\n\t\tif ((tree = importFile(scope, env, module, kind, name)) == NULL) {\n\t\t\tstd::cerr << \"Module `\" << module << \"' not found!\" << std::endl;\n\t\t\treturn NULL;\n\t\t}\n\t\treturn tree;\n\t}\n\n\tloadModule(scope, env, it->second, kind, name);\n\n\treturn NULL;\n}\n\n} \/\/ clever\n<|endoftext|>"} {"text":"<commit_before>\/\/\n\/\/ Copyright (C) 2007 SIPez LLC.\n\/\/ Licensed to SIPfoundry under a Contributor Agreement.\n\/\/ \n\/\/ Copyright (C) 2007 SIPfoundry Inc. \n\/\/ Licensed by SIPfoundry under the LGPL license. \n\/\/ \n\/\/ $$ \n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/ \n\n#ifdef HAVE_ILBC \/\/ [\n\n\/\/ SYSTEM INCLUDES\n#include <limits.h>\n\n\/\/ APPLICATION INCLUDES\n#include \"mp\/MpdSipxILBC.h\"\nextern \"C\" {\n#include <iLBC_define.h>\n#include <iLBC_decode.h>\n}\n\nconst MpCodecInfo MpdSipxILBC::smCodecInfo(\n SdpCodec::SDP_CODEC_ILBC, \/\/ codecType\n \"iLBC\", \/\/ codecVersion\n 8000, \/\/ samplingRate\n 8, \/\/ numBitsPerSample (not used)\n 1, \/\/ numChannels\n 240, \/\/ interleaveBlockSize\n 13334, \/\/ bitRate\n NO_OF_BYTES_30MS * 8, \/\/ minPacketBits\n NO_OF_BYTES_30MS * 8, \/\/ avgPacketBits\n NO_OF_BYTES_30MS * 8, \/\/ maxPacketBits\n 240, \/\/ numSamplesPerFrame\n 6); \/\/ preCodecJitterBufferSize (should be adjusted)\n\n\n\nMpdSipxILBC::MpdSipxILBC(int payloadType)\n: MpDecoderBase(payloadType, &smCodecInfo)\n, mpState(NULL)\n{\n}\n\nMpdSipxILBC::~MpdSipxILBC()\n{\n freeDecode();\n}\n\nOsStatus MpdSipxILBC::initDecode()\n{\n if (mpState == NULL) \n {\n mpState = new iLBC_Dec_Inst_t();\n memset(mpState, 0, sizeof(*mpState));\n ::initDecode(mpState, 30, 1);\n }\n return OS_SUCCESS;\n}\n\nOsStatus MpdSipxILBC::freeDecode(void)\n{\n delete mpState;\n mpState = NULL;\n return OS_SUCCESS;\n}\n\nint MpdSipxILBC::decode(const MpRtpBufPtr &pPacket,\n unsigned decodedBufferLength,\n MpAudioSample *samplesBuffer)\n{\n \/\/ Check if available buffer size is enough for the packet.\n if (decodedBufferLength < 240)\n {\n osPrintf(\"MpdSipxILBC::decode: Jitter buffer overloaded. Glitch!\\n\");\n return 0;\n }\n\n \/\/ Decode incoming packet to temp buffer. If no packet - do PLC.\n float buffer[240];\n if (pPacket.isValid())\n {\n if (NO_OF_BYTES_30MS != pPacket->getPayloadSize())\n {\n osPrintf(\"MpdSipxILBC::decode: Payload size: %d!\\n\", pPacket->getPayloadSize());\n return 0;\n }\n\n \/\/ Packet data available. Decode it.\n iLBC_decode(buffer, (unsigned char*)pPacket->getDataPtr(), mpState, 1);\n }\n else\n {\n \/\/ Packet data is not available. Do PLC.\n iLBC_decode(buffer, NULL, mpState, 0);\n }\n \n for (int i = 0; i < 240; ++i)\n {\n float tmp = buffer[i];\n if (tmp > SHRT_MAX)\n tmp = SHRT_MAX;\n if (tmp < SHRT_MIN)\n tmp = SHRT_MIN;\n\n samplesBuffer[i] = MpAudioSample(tmp + 0.5f);\n }\n\n return 240;\n}\n\n#endif \/\/ HAVE_ILBC ]\n<commit_msg>Remove dependency of MpdSipxILBC from <limits.h> and make it a litle bit more flexible.<commit_after>\/\/\n\/\/ Copyright (C) 2007 SIPez LLC.\n\/\/ Licensed to SIPfoundry under a Contributor Agreement.\n\/\/ \n\/\/ Copyright (C) 2007 SIPfoundry Inc. \n\/\/ Licensed by SIPfoundry under the LGPL license. \n\/\/ \n\/\/ $$ \n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/ \n\n#ifdef HAVE_ILBC \/\/ [\n\n\/\/ SYSTEM INCLUDES\n\/\/ APPLICATION INCLUDES\n#include \"mp\/MpdSipxILBC.h\"\nextern \"C\" {\n#include <iLBC_define.h>\n#include <iLBC_decode.h>\n}\n\nconst MpCodecInfo MpdSipxILBC::smCodecInfo(\n SdpCodec::SDP_CODEC_ILBC, \/\/ codecType\n \"iLBC\", \/\/ codecVersion\n 8000, \/\/ samplingRate\n 8, \/\/ numBitsPerSample (not used)\n 1, \/\/ numChannels\n 240, \/\/ interleaveBlockSize\n 13334, \/\/ bitRate\n NO_OF_BYTES_30MS * 8, \/\/ minPacketBits\n NO_OF_BYTES_30MS * 8, \/\/ avgPacketBits\n NO_OF_BYTES_30MS * 8, \/\/ maxPacketBits\n 240, \/\/ numSamplesPerFrame\n 6); \/\/ preCodecJitterBufferSize (should be adjusted)\n\n\n\nMpdSipxILBC::MpdSipxILBC(int payloadType)\n: MpDecoderBase(payloadType, &smCodecInfo)\n, mpState(NULL)\n{\n}\n\nMpdSipxILBC::~MpdSipxILBC()\n{\n freeDecode();\n}\n\nOsStatus MpdSipxILBC::initDecode()\n{\n if (mpState == NULL) \n {\n mpState = new iLBC_Dec_Inst_t();\n memset(mpState, 0, sizeof(*mpState));\n ::initDecode(mpState, 30, 1);\n }\n return OS_SUCCESS;\n}\n\nOsStatus MpdSipxILBC::freeDecode(void)\n{\n delete mpState;\n mpState = NULL;\n return OS_SUCCESS;\n}\n\nint MpdSipxILBC::decode(const MpRtpBufPtr &pPacket,\n unsigned decodedBufferLength,\n MpAudioSample *samplesBuffer)\n{\n \/\/ Check if available buffer size is enough for the packet.\n if (decodedBufferLength < 240)\n {\n osPrintf(\"MpdSipxILBC::decode: Jitter buffer overloaded. Glitch!\\n\");\n return 0;\n }\n\n \/\/ Decode incoming packet to temp buffer. If no packet - do PLC.\n float buffer[240];\n if (pPacket.isValid())\n {\n if (pPacket->getPayloadSize() != pPacket->getPayloadSize())\n {\n osPrintf(\"MpdSipxILBC::decode: Payload size: %d!\\n\", pPacket->getPayloadSize());\n return 0;\n }\n\n \/\/ Packet data available. Decode it.\n iLBC_decode(buffer, (unsigned char*)pPacket->getDataPtr(), mpState, 1);\n }\n else\n {\n \/\/ Packet data is not available. Do PLC.\n iLBC_decode(buffer, NULL, mpState, 0);\n }\n \n for (int i = 0; i < 240; ++i)\n {\n float tmp = buffer[i];\n if (tmp > MAX_SAMPLE)\n tmp = MAX_SAMPLE;\n if (tmp < MIN_SAMPLE)\n tmp = MIN_SAMPLE;\n\n samplesBuffer[i] = MpAudioSample(tmp + 0.5f);\n }\n\n return 240;\n}\n\n#endif \/\/ HAVE_ILBC ]\n<|endoftext|>"}